static gint
lua_trie_search_text (lua_State *L)
{
rspamd_trie_t *trie = lua_check_trie (L);
const gchar *text, *pos;
gint id, i = 1;
gsize len;
gboolean found = FALSE;
if (trie) {
text = luaL_checkstring (L, 2);
len = strlen (text);
if (text) {
lua_newtable (L);
pos = text;
while (pos < text + len &&
(pos = rspamd_trie_lookup (trie, pos, len, &id)) != NULL) {
lua_pushinteger (L, i);
lua_pushinteger (L, id);
lua_settable (L, -3);
i++;
found = TRUE;
break;
}
if (!found) {
lua_pushnil (L);
}
return 1;
}
}
lua_pushnil (L);
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;
GList *cur;
const gchar *text;
gint state = 0;
gsize len;
gboolean found = FALSE;
if (trie) {
cur = task->text_parts;
while (cur) {
part = cur->data;
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;
}
}
cur = g_list_next (cur);
}
}
lua_pushboolean (L, found);
return 1;
}
static gint
lua_trie_destroy (lua_State *L)
{
ac_trie_t *trie = lua_check_trie (L, 1);
if (trie) {
acism_destroy (trie);
}
return 0;
}
static gint
lua_trie_search_task (lua_State *L)
{
rspamd_trie_t *trie = lua_check_trie (L);
struct rspamd_task *task;
struct mime_text_part *part;
GList *cur;
const gchar *pos, *end;
gint id, i = 1;
void *ud;
gboolean found = FALSE;
if (trie) {
ud = luaL_checkudata (L, 2, "rspamd{task}");
luaL_argcheck (L, ud != NULL, 1, "'task' expected");
task = ud ? *((struct rspamd_task **)ud) : NULL;
if (task) {
lua_newtable (L);
cur = task->text_parts;
while (cur) {
part = cur->data;
if (!part->is_empty && part->content != NULL) {
pos = (const gchar *)part->content->data;
end = pos + part->content->len;
while (pos < end &&
(pos =
rspamd_trie_lookup (trie, pos, part->content->len,
&id)) != NULL) {
lua_pushinteger (L, i);
lua_pushinteger (L, id);
lua_settable (L, -3);
i++;
found = TRUE;
break;
}
}
cur = g_list_next (cur);
}
if (!found) {
lua_pushnil (L);
}
return 1;
}
}
if (!found) {
lua_pushnil (L);
}
return 1;
}
static gint
lua_trie_add_pattern (lua_State *L)
{
rspamd_trie_t *trie = lua_check_trie (L);
const gchar *pattern;
gint id;
if (trie) {
pattern = luaL_checkstring (L, 2);
id = luaL_checknumber (L, 3);
if (pattern != NULL) {
rspamd_trie_insert (trie, pattern, id);
lua_pushboolean (L, 1);
}
}
lua_pushboolean (L, 0);
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.start;
len = task->msg.len;
if (lua_trie_search_str (L, trie, text, len, &state) != 0) {
found = TRUE;
}
}
lua_pushboolean (L, found);
return 1;
}
/***
* @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;
}
