gitea.git - Git with a cup of tea! Painless self-hosted all-in-one software development service, including Git hosting, code review, team collaboration, package registry and CI/CD: https://github.com/go-gitea/gitea

	Commit message (Expand)	Author	Age	Files	Lines
*	Fix redirect url of legacy commits route (#2825)	Morlinest	2017-11-03	1	-1/+3
*	Make URL scheme unambiguous (#2408)	Ethan Koenig	2017-10-30	1	-1/+17
*	Move swagger-ui under /api/v1 (#2746)	Antoine GIRARD	2017-10-21	1	-2/+4
*	Merge password and 2fa page on user settings (#2695)	Lunny Xiao	2017-10-16	1	-2/+2
*	Fix integration test after librejs location change (#2374)	Sandro Santilli	2017-08-24	1	-1/+1
*	Add more test for login links and fix a bug on action retrieve (#2361)	Lunny Xiao	2017-08-23	1	-0/+97
*	Add public links check (#2323)	Lunny Xiao	2017-08-17	1	-0/+33

/* * Copyright (c) 2015, Vsevolod Stakhov * All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions are met: * * Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * * Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * * THIS SOFTWARE IS PROVIDED BY AUTHOR ''AS IS'' AND ANY * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE * DISCLAIMED. IN NO EVENT SHALL AUTHOR BE LIABLE FOR ANY * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ #include "lua_common.h" #include "acism.h" #include "message.h" /*** * @module rspamd_trie * Rspamd trie module provides the data structure suitable for searching of many * patterns in arbitrary texts (or binary chunks). The algorithmic complexity of * this algorithm is at most O(n + m + z), where `n` is the length of text, `m` is a length of pattern and `z` is a number of patterns in the text. * * Here is a typical example of trie usage: * @example local rspamd_trie = require "rspamd_trie" local patterns = {'aab', 'ab', 'bcd\0ef'} local trie = rspamd_trie.create(patterns) local function trie_callback(number, pos) print('Matched pattern number ' .. tostring(number) .. ' at pos: ' .. tostring(pos)) end trie:match('some big text', trie_callback) */ /* Suffix trie */ LUA_FUNCTION_DEF (trie, create); LUA_FUNCTION_DEF (trie, match); LUA_FUNCTION_DEF (trie, search_mime); LUA_FUNCTION_DEF (trie, search_rawmsg); LUA_FUNCTION_DEF (trie, destroy); static const struct luaL_reg trielib_m[] = { LUA_INTERFACE_DEF (trie, match), LUA_INTERFACE_DEF (trie, search_mime), LUA_INTERFACE_DEF (trie, search_rawmsg), {"__tostring", rspamd_lua_class_tostring}, {"__gc", lua_trie_destroy}, {NULL, NULL} }; static const struct luaL_reg trielib_f[] = { LUA_INTERFACE_DEF (trie, create), {NULL, NULL} }; static ac_trie_t * lua_check_trie (lua_State * L, gint idx) { void *ud = luaL_checkudata (L, 1, "rspamd{trie}"); luaL_argcheck (L, ud != NULL, 1, "'trie' expected"); return ud ? *((ac_trie_t **)ud) : NULL; } static gint lua_trie_destroy (lua_State *L) { ac_trie_t *trie = lua_check_trie (L, 1); if (trie) { acism_destroy (trie); } return 0; } /*** * function trie.create(patterns) * Creates new trie data structure * @param {table} array of string patterns * @return {trie} new trie object */ static gint lua_trie_create (lua_State *L) { ac_trie_t *trie, **ptrie; ac_trie_pat_t *pat; gint npat = 0; gsize sz; if (!lua_istable (L, 1)) { msg_err ("lua trie expects array of patterns for now"); lua_pushnil (L); } else { lua_pushvalue (L, 1); lua_pushnil (L); while (lua_next (L, -2) != 0) { if (lua_isstring (L, -1)) { npat ++; } lua_pop (L, 1); } pat = g_new (ac_trie_pat_t, npat); lua_pushnil (L); npat = 0; while (lua_next (L, -2) != 0) { if (lua_isstring (L, -1)) { pat[npat].ptr = lua_tolstring (L, -1, &sz); pat[npat].len = sz; npat ++; } lua_pop (L, 1); } lua_pop (L, 1); /* table */ trie = acism_create (pat, npat); ptrie = lua_newuserdata (L, sizeof (ac_trie_t *)); rspamd_lua_setclass (L, "rspamd{trie}", -1); *ptrie = trie; g_free (pat); } return 1; } struct lua_trie_cbdata { gboolean found; lua_State *L; }; static gint lua_trie_callback (int strnum, int textpos, void *context) { struct lua_trie_cbdata *cb = context; lua_State *L; gint ret; L = cb->L; cb->found = TRUE; /* Function */ lua_pushvalue (L, 3); lua_pushnumber (L, strnum + 1); lua_pushnumber (L, textpos); if (lua_pcall (L, 2, 1, 0) != 0) { msg_info ("call to trie callback has failed: %s", lua_tostring (L, -1)); return 1; } ret = lua_tonumber (L, -1); lua_pop (L, 1); return ret; } /* * We assume that callback argument is at pos 3 and icase is in position 4 */ static gint lua_trie_search_str (lua_State *L, ac_trie_t *trie, const gchar *str, gsize len, gint *statep) { struct lua_trie_cbdata cb; gboolean icase = FALSE; if (lua_gettop (L) == 4) { icase = lua_toboolean (L, 4); } cb.L = L; cb.found = FALSE; acism_lookup (trie, str, len, lua_trie_callback, &cb, statep, icase); return cb.found; } /*** * @method trie:match(input, cb[, caseless]) * Search for patterns in `input` invoking `cb` optionally ignoring case * @param {table or string} input one or several (if `input` is an array) strings of input text * @param {function} cb callback called on each pattern match in form `function (idx, pos)` where `idx` is a numeric index of pattern (starting from 1) and `pos` is a numeric offset where the pattern ends * @param {boolean} caseless if `true` then match ignores symbols case (ASCII only) * @return {boolean} `true` if any pattern has been found (`cb` might be called multiple times however) */ static gint lua_trie_match (lua_State *L) { ac_trie_t *trie = lua_check_trie (L, 1); const gchar *text; gint state = 0; gsize len; gboolean found = FALSE; if (trie) { if (lua_type (L, 2) == LUA_TTABLE) { lua_pushvalue (L, 2); lua_pushnil (L); while (lua_next (L, -2) != 0) { if (lua_isstring (L, -1)) { text = lua_tolstring (L, -1, &len); if (lua_trie_search_str (L, trie, text, len, &state)) { found = TRUE; } } lua_pop (L, 1); } lua_pop (L, 1); /* table */ } else if (lua_type (L, 2) == LUA_TSTRING) { text = lua_tolstring (L, 2, &len); if (lua_trie_search_str (L, trie, text, len, &state)) { found = TRUE; } } } lua_pushboolean (L, found); return 1; } /*** * @method trie:search_mime(task, cb[, caseless]) * This is a helper mehthod to search pattern within text parts of a message in rspamd task * @param {task} task object * @param {function} cb callback called on each pattern match @see trie:match * @param {boolean} caseless if `true` then match ignores symbols case (ASCII only) * @return {boolean} `true` if any pattern has been found (`cb` might be called multiple times however) */ static gint lua_trie_search_mime (lua_State *L) { ac_trie_t *trie = lua_check_trie (L, 1); struct rspamd_task *task = lua_check_task (L, 2); struct mime_text_part *part; const gchar *text; gint state = 0; gsize len, i; gboolean found = FALSE; if (trie) { for (i = 0; i < task->text_parts->len; i ++) { part = g_ptr_array_index (task->text_parts, i); if (!IS_PART_EMPTY (part) && part->content != NULL) { text = part->content->data; len = part->content->len; if (lua_trie_search_str (L, trie, text, len, &state) != 0) { found = TRUE; } } } } lua_pushboolean (L, found); return 1; } /*** * @method trie:search_rawmsg(task, cb[, caseless]) * This is a helper mehthod to search pattern within the whole undecoded content of rspamd task * @param {task} task object * @param {function} cb callback called on each pattern match @see trie:match * @param {boolean} caseless if `true` then match ignores symbols case (ASCII only) * @return {boolean} `true` if any pattern has been found (`cb` might be called multiple times however) */ static gint lua_trie_search_rawmsg (lua_State *L) { ac_trie_t *trie = lua_check_trie (L, 1); struct rspamd_task *task = lua_check_task (L, 2); const gchar *text; gint state = 0; gsize len; gboolean found = FALSE; if (trie) { text = task->msg.begin; len = task->msg.len; if (lua_trie_search_str (L, trie, text, len, &state) != 0) { found = TRUE; } } lua_pushboolean (L, found); return 1; } static gint lua_load_trie (lua_State *L) { lua_newtable (L); luaL_register (L, NULL, trielib_f); return 1; } void luaopen_trie (lua_State * L) { luaL_newmetatable (L, "rspamd{trie}"); lua_pushstring (L, "__index"); lua_pushvalue (L, -2); lua_settable (L, -3); lua_pushstring (L, "class"); lua_pushstring (L, "rspamd{trie}"); lua_rawset (L, -3); luaL_register (L, NULL, trielib_m); rspamd_lua_add_preload (L, "rspamd_trie", lua_load_trie); lua_pop (L, 1); /* remove metatable from stack */ }