1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
1337
1338
1339
1340
1341
1342
1343
1344
1345
1346
1347
1348
1349
1350
1351
1352
1353
1354
1355
1356
1357
1358
1359
1360
1361
1362
1363
1364
1365
1366
1367
1368
1369
1370
1371
1372
1373
1374
1375
1376
1377
1378
1379
1380
1381
1382
1383
1384
1385
1386
1387
1388
1389
1390
1391
1392
1393
1394
1395
1396
1397
1398
1399
1400
1401
1402
1403
1404
1405
1406
1407
1408
1409
1410
1411
1412
1413
1414
1415
1416
1417
1418
1419
1420
1421
1422
1423
1424
1425
1426
1427
1428
1429
1430
1431
1432
1433
1434
1435
1436
1437
1438
1439
1440
1441
1442
1443
1444
1445
1446
1447
1448
1449
1450
1451
1452
1453
1454
1455
1456
1457
1458
1459
1460
1461
1462
1463
1464
1465
1466
1467
1468
1469
1470
1471
1472
1473
|
/*
* Copyright (c) 2009, Rambler media
* 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 Rambler media ''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 Rambler 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.
*/
/***MODULE:regexp
* rspamd module that implements different regexp rules
*/
#include "config.h"
#include "main.h"
#include "message.h"
#include "cfg_file.h"
#include "map.h"
#include "util.h"
#include "expressions.h"
#include "view.h"
#include "lua/lua_common.h"
#include "json/jansson.h"
#include "cfg_xml.h"
#define DEFAULT_STATFILE_PREFIX "./"
struct regexp_module_item {
struct expression *expr;
gchar *symbol;
guint32 avg_time;
gpointer lua_function;
};
struct autolearn_data {
gchar *statfile_name;
gchar *symbol;
float weight;
};
struct regexp_ctx {
gint (*filter) (struct worker_task * task);
GHashTable *autolearn_symbols;
gchar *statfile_prefix;
memory_pool_t *regexp_pool;
memory_pool_t *dynamic_pool;
gsize max_size;
};
struct regexp_json_buf {
gchar *buf;
gchar *pos;
size_t buflen;
struct config_file *cfg;
};
/* Lua regexp module for checking rspamd regexps */
LUA_FUNCTION_DEF (regexp, match);
static const struct luaL_reg regexplib_m[] = {
LUA_INTERFACE_DEF (regexp, match),
{"__tostring", lua_class_tostring},
{NULL, NULL}
};
static struct regexp_ctx *regexp_module_ctx = NULL;
static gint regexp_common_filter (struct worker_task *task);
static gboolean rspamd_regexp_match_number (struct worker_task *task, GList * args, void *unused);
static gboolean rspamd_raw_header_exists (struct worker_task *task, GList * args, void *unused);
static gboolean rspamd_check_smtp_data (struct worker_task *task, GList * args, void *unused);
static gboolean rspamd_regexp_occurs_number (struct worker_task *task, GList * args, void *unused);
static void process_regexp_item (struct worker_task *task, void *user_data);
static gint
luaopen_regexp (lua_State * L)
{
luaL_openlib (L, "rspamd_regexp", regexplib_m, 0);
return 1;
}
static void
regexp_dynamic_insert_result (struct worker_task *task, void *user_data)
{
gchar *symbol = user_data;
insert_result (task, symbol, 1, NULL);
}
/*
* Utility functions for matching exact number of regexps
*/
typedef gboolean (*int_compare_func) (gint a, gint b);
static gboolean
op_equal (gint a, gint b)
{
return a == b;
}
static gboolean
op_more (gint a, gint b)
{
return a > b;
}
static gboolean
op_less (gint a, gint b)
{
return a < b;
}
static gboolean
op_more_equal (gint a, gint b)
{
return a >= b;
}
static gboolean
op_less_equal (gint a, gint b)
{
return a <= b;
}
/*
* Process ip and mask of dynamic regexp
*/
static gboolean
parse_regexp_ipmask (const gchar *begin, struct dynamic_map_item *addr)
{
const gchar *pos;
gchar ip_buf[sizeof ("255.255.255.255")], mask_buf[3], *p;
gint state = 0, dots = 0;
bzero (ip_buf, sizeof (ip_buf));
bzero (mask_buf, sizeof (mask_buf));
pos = begin;
p = ip_buf;
if (*pos == '!') {
addr->negative = TRUE;
pos ++;
}
else {
addr->negative = FALSE;
}
while (*pos) {
switch (state) {
case 0:
state = 1;
p = ip_buf;
dots = 0;
break;
case 1:
/* Begin parse ip */
if (p - ip_buf >= (gint)sizeof (ip_buf) || dots > 3) {
return FALSE;
}
if (g_ascii_isdigit (*pos)) {
*p ++ = *pos ++;
}
else if (*pos == '.') {
*p ++ = *pos ++;
dots ++;
}
else if (*pos == '/') {
pos ++;
p = mask_buf;
state = 2;
}
else {
/* Invalid character */
return FALSE;
}
break;
case 2:
/* Parse mask */
if (p - mask_buf > 2) {
return FALSE;
}
if (g_ascii_isdigit (*pos)) {
*p ++ = *pos ++;
}
else {
return FALSE;
}
break;
}
}
if (!inet_aton (ip_buf, &addr->addr)) {
return FALSE;
}
if (state == 2) {
/* Also parse mask */
addr->mask = (mask_buf[0] - '0') * 10 + mask_buf[1] - '0';
if (addr->mask > 32) {
msg_info ("bad ipmask value: '%s'", begin);
return FALSE;
}
}
else {
addr->mask = 32;
}
return TRUE;
}
/* Process regexp expression */
static gboolean
read_regexp_expression (memory_pool_t * pool, struct regexp_module_item *chain, gchar *symbol, gchar *line, gboolean raw_mode)
{
struct expression *e, *cur;
e = parse_expression (pool, line);
if (e == NULL) {
msg_warn ("%s = \"%s\" is invalid regexp expression", symbol, line);
return FALSE;
}
chain->expr = e;
cur = e;
while (cur) {
if (cur->type == EXPR_REGEXP) {
cur->content.operand = parse_regexp (pool, cur->content.operand, raw_mode);
if (cur->content.operand == NULL) {
msg_warn ("cannot parse regexp, skip expression %s = \"%s\"", symbol, line);
return FALSE;
}
cur->type = EXPR_REGEXP_PARSED;
}
cur = cur->next;
}
return TRUE;
}
/* Callbacks for reading json dynamic rules */
gchar *
json_regexp_read_cb (memory_pool_t * pool, gchar * chunk, gint len, struct map_cb_data *data)
{
struct regexp_json_buf *jb;
gint free, off;
if (data->cur_data == NULL) {
jb = g_malloc (sizeof (struct regexp_json_buf));
jb->cfg = ((struct regexp_json_buf *)data->prev_data)->cfg;
jb->buf = NULL;
jb->pos = NULL;
data->cur_data = jb;
}
else {
jb = data->cur_data;
}
if (jb->buf == NULL) {
/* Allocate memory for buffer */
jb->buflen = len * 2;
jb->buf = g_malloc (jb->buflen);
jb->pos = jb->buf;
}
off = jb->pos - jb->buf;
free = jb->buflen - off;
if (free < len) {
jb->buflen = MAX (jb->buflen * 2, jb->buflen + len * 2);
jb->buf = g_realloc (jb->buf, jb->buflen);
jb->pos = jb->buf + off;
}
memcpy (jb->pos, chunk, len);
jb->pos += len;
/* Say not to copy any part of this buffer */
return NULL;
}
void
json_regexp_fin_cb (memory_pool_t * pool, struct map_cb_data *data)
{
struct regexp_json_buf *jb;
guint nelts, i, j;
json_t *js, *cur_elt, *cur_nm, *it_val;
json_error_t je;
gchar *cur_rule, *cur_symbol;
double score;
gboolean enabled;
struct regexp_module_item *cur_item;
GList *cur_networks = NULL;
struct dynamic_map_item *cur_nitem;
memory_pool_t *new_pool;
if (data->prev_data) {
jb = data->prev_data;
/* Clean prev data */
if (jb->buf) {
g_free (jb->buf);
}
g_free (jb);
}
/* Now parse json */
if (data->cur_data) {
jb = data->cur_data;
}
else {
msg_err ("no data read");
return;
}
if (jb->buf == NULL) {
msg_err ("no data read");
return;
}
/* NULL terminate current buf */
*jb->pos = '\0';
js = json_loads (jb->buf, &je);
if (!js) {
msg_err ("cannot load json data: parse error %s, on line %d", je.text, je.line);
return;
}
if (!json_is_array (js)) {
json_decref (js);
msg_err ("loaded json is not an array");
return;
}
new_pool = memory_pool_new (memory_pool_get_size ());
remove_dynamic_rules (jb->cfg->cache);
if (regexp_module_ctx->dynamic_pool != NULL) {
memory_pool_delete (regexp_module_ctx->dynamic_pool);
}
regexp_module_ctx->dynamic_pool = new_pool;
nelts = json_array_size (js);
for (i = 0; i < nelts; i++) {
cur_networks = NULL;
cur_rule = NULL;
enabled = TRUE;
cur_elt = json_array_get (js, i);
if (!cur_elt || !json_is_object (cur_elt)) {
msg_err ("loaded json is not an object");
continue;
}
/* Factor param */
cur_nm = json_object_get (cur_elt, "factor");
if (cur_nm == NULL || !json_is_number (cur_nm)) {
msg_err ("factor is not a number or not exists, but is required");
continue;
}
score = json_number_value (cur_nm);
/* Symbol param */
cur_nm = json_object_get (cur_elt, "symbol");
if (cur_nm == NULL || !json_is_string (cur_nm)) {
msg_err ("symbol is not a string or not exists, but is required");
continue;
}
cur_symbol = memory_pool_strdup (new_pool, json_string_value (cur_nm));
/* Enabled flag */
cur_nm = json_object_get (cur_elt, "enabled");
if (cur_nm != NULL && json_is_boolean (cur_nm)) {
if (json_is_false (cur_nm)) {
msg_info ("rule %s is disabled in json", cur_symbol);
continue;
}
}
/* Now check other settings */
/* Rule */
cur_nm = json_object_get (cur_elt, "rule");
if (cur_nm != NULL && json_is_string (cur_nm)) {
cur_rule = memory_pool_strdup (new_pool, json_string_value (cur_nm));
}
/* Networks array */
cur_nm = json_object_get (cur_elt, "networks");
if (cur_nm != NULL && json_is_array (cur_nm)) {
for (j = 0; j < json_array_size (cur_nm); j++) {
it_val = json_array_get (cur_nm, i);
if (it_val && json_is_string (it_val)) {
cur_nitem = memory_pool_alloc (new_pool, sizeof (struct dynamic_map_item));
if (parse_regexp_ipmask (json_string_value (it_val), cur_nitem)) {
cur_networks = g_list_prepend (cur_networks, cur_nitem);
}
}
}
}
if (cur_rule) {
/* Dynamic rule has rule option */
cur_item = memory_pool_alloc0 (new_pool, sizeof (struct regexp_module_item));
cur_item->symbol = cur_symbol;
if (read_regexp_expression (new_pool, cur_item, cur_symbol, cur_rule, jb->cfg->raw_mode)) {
register_dynamic_symbol (new_pool, &jb->cfg->cache, cur_symbol, score, process_regexp_item, cur_item, cur_networks);
}
else {
msg_warn ("cannot parse dynamic rule");
}
}
else {
/* Just rule that is allways true (for whitelisting for example) */
register_dynamic_symbol (new_pool, &jb->cfg->cache, cur_symbol, score, regexp_dynamic_insert_result, cur_symbol, cur_networks);
}
if (cur_networks) {
g_list_free (cur_networks);
}
}
json_decref (js);
}
/* Init function */
gint
regexp_module_init (struct config_file *cfg, struct module_ctx **ctx)
{
regexp_module_ctx = g_malloc (sizeof (struct regexp_ctx));
regexp_module_ctx->filter = regexp_common_filter;
regexp_module_ctx->regexp_pool = memory_pool_new (memory_pool_get_size ());
regexp_module_ctx->dynamic_pool = NULL;
regexp_module_ctx->autolearn_symbols = g_hash_table_new (g_str_hash, g_str_equal);
*ctx = (struct module_ctx *)regexp_module_ctx;
register_expression_function ("regexp_match_number", rspamd_regexp_match_number, NULL);
register_expression_function ("regexp_occurs_number", rspamd_regexp_occurs_number, NULL);
register_expression_function ("raw_header_exists", rspamd_raw_header_exists, NULL);
register_expression_function ("check_smtp_data", rspamd_check_smtp_data, NULL);
(void)luaopen_regexp (cfg->lua_state);
register_module_opt ("regexp", "dynamic_rules", MODULE_OPT_TYPE_STRING);
register_module_opt ("regexp", "max_size", MODULE_OPT_TYPE_SIZE);
register_module_opt ("regexp", "/^\\S+$/", MODULE_OPT_TYPE_STRING);
return 0;
}
/*
* Parse string in format:
* SYMBOL:statfile:weight
*/
void
parse_autolearn_param (const gchar *param, const gchar *value, struct config_file *cfg)
{
struct autolearn_data *d;
gchar *p;
p = memory_pool_strdup (regexp_module_ctx->regexp_pool, value);
d = memory_pool_alloc (regexp_module_ctx->regexp_pool, sizeof (struct autolearn_data));
d->symbol = strsep (&p, ":");
if (d->symbol) {
d->statfile_name = strsep (&p, ":");
if (d->statfile_name) {
if (p != NULL && *p != '\0') {
d->weight = strtod (p, NULL);
g_hash_table_insert (regexp_module_ctx->autolearn_symbols, d->symbol, d);
}
}
else {
msg_warn ("cannot extract statfile name from %s", p);
}
}
else {
msg_warn ("cannot extract symbol name from %s", p);
}
}
gint
regexp_module_config (struct config_file *cfg)
{
GList *cur_opt = NULL;
struct module_opt *cur;
struct regexp_module_item *cur_item;
gchar *value;
gint res = TRUE;
struct regexp_json_buf *jb, **pjb;
if ((value = get_module_opt (cfg, "regexp", "statfile_prefix")) != NULL) {
regexp_module_ctx->statfile_prefix = memory_pool_strdup (regexp_module_ctx->regexp_pool, value);
}
else {
regexp_module_ctx->statfile_prefix = DEFAULT_STATFILE_PREFIX;
}
if ((value = get_module_opt (cfg, "regexp", "max_size")) != NULL) {
regexp_module_ctx->max_size = parse_limit (value);
}
else {
regexp_module_ctx->max_size = 0;
}
if ((value = get_module_opt (cfg, "regexp", "dynamic_rules")) != NULL) {
jb = g_malloc (sizeof (struct regexp_json_buf));
pjb = g_malloc (sizeof (struct regexp_json_buf *));
jb->buf = NULL;
jb->cfg = cfg;
*pjb = jb;
if (!add_map (value, json_regexp_read_cb, json_regexp_fin_cb, (void **)pjb)) {
msg_err ("cannot add map %s", value);
}
}
cur_opt = g_hash_table_lookup (cfg->modules_opts, "regexp");
while (cur_opt) {
cur = cur_opt->data;
if (strcmp (cur->param, "metric") == 0 || strcmp (cur->param, "statfile_prefix") == 0) {
cur_opt = g_list_next (cur_opt);
continue;
}
else if (g_ascii_strncasecmp (cur->param, "autolearn", sizeof ("autolearn") - 1) == 0) {
parse_autolearn_param (cur->param, cur->value, cfg);
cur_opt = g_list_next (cur_opt);
continue;
}
else if (g_ascii_strncasecmp (cur->param, "dynamic_rules", sizeof ("dynamic_rules") - 1) == 0) {
cur_opt = g_list_next (cur_opt);
continue;
}
else if (g_ascii_strncasecmp (cur->param, "max_size", sizeof ("max_size") - 1) == 0) {
cur_opt = g_list_next (cur_opt);
continue;
}
cur_item = memory_pool_alloc0 (regexp_module_ctx->regexp_pool, sizeof (struct regexp_module_item));
cur_item->symbol = cur->param;
if (cur->is_lua && cur->lua_type == LUA_VAR_STRING) {
if (!read_regexp_expression (regexp_module_ctx->regexp_pool, cur_item, cur->param, cur->actual_data, cfg->raw_mode)) {
res = FALSE;
}
}
else if (cur->is_lua && cur->lua_type == LUA_VAR_FUNCTION) {
cur_item->lua_function = cur->actual_data;
}
else if (! cur->is_lua) {
if (!read_regexp_expression (regexp_module_ctx->regexp_pool, cur_item, cur->param, cur->value, cfg->raw_mode)) {
res = FALSE;
}
}
else {
msg_err ("unknown variable type for %s", cur->param);
res = FALSE;
}
if ( !res) {
/* Stop on errors */
break;
}
register_symbol (&cfg->cache, cur->param, 1, process_regexp_item, cur_item);
cur_opt = g_list_next (cur_opt);
}
return res;
}
gint
regexp_module_reconfig (struct config_file *cfg)
{
memory_pool_delete (regexp_module_ctx->regexp_pool);
regexp_module_ctx->regexp_pool = memory_pool_new (memory_pool_get_size ());
return regexp_module_config (cfg);
}
struct url_regexp_param {
struct worker_task *task;
GRegex *regexp;
struct rspamd_regexp *re;
gboolean found;
};
static gboolean
tree_url_callback (gpointer key, gpointer value, void *data)
{
struct url_regexp_param *param = data;
struct uri *url = value;
GError *err = NULL;
if (g_regex_match_full (param->regexp, struri (url), -1, 0, 0, NULL, &err) == TRUE) {
if (G_UNLIKELY (param->re->is_test)) {
msg_info ("process test regexp %s for url %s returned TRUE", struri (url));
}
task_cache_add (param->task, param->re, 1);
param->found = TRUE;
return TRUE;
}
else if (G_UNLIKELY (param->re->is_test)) {
msg_info ("process test regexp %s for url %s returned FALSE", struri (url));
}
if (err != NULL) {
msg_info ("error occured while processing regexp \"%s\": %s", param->re->regexp_text, err->message);
}
return FALSE;
}
static gsize
process_regexp (struct rspamd_regexp *re, struct worker_task *task, const gchar *additional,
gint limit, int_compare_func f)
{
guint8 *ct;
gsize clen;
gint r, passed = 0, start, end, old;
gboolean matched = FALSE;
GList *cur, *headerlist;
GRegex *regexp;
GMatchInfo *info;
GError *err = NULL;
struct url_regexp_param callback_param = {
.task = task,
.regexp = re->regexp,
.re = re,
.found = FALSE
};
struct mime_text_part *part;
struct raw_header *rh;
if (re == NULL) {
msg_info ("invalid regexp passed");
return 0;
}
if ((r = task_cache_check (task, re)) != -1) {
debug_task ("regexp /%s/ is found in cache, result: %d", re->regexp_text, r);
return r == 1;
}
if (additional != NULL) {
/* We have additional parameter defined, so ignore type of regexp expression and use it for parsing */
if (G_UNLIKELY (re->is_test)) {
msg_info ("process test regexp %s with test %s", re->regexp_text, additional);
}
if (g_regex_match_full (re->regexp, additional, strlen (additional), 0, 0, NULL, NULL) == TRUE) {
if (G_UNLIKELY (re->is_test)) {
msg_info ("result of regexp %s is true", re->regexp_text);
}
task_cache_add (task, re, 1);
return 1;
}
else {
task_cache_add (task, re, 0);
return 0;
}
}
switch (re->type) {
case REGEXP_NONE:
msg_warn ("bad error detected: %s has invalid regexp type", re->regexp_text);
return 0;
case REGEXP_HEADER:
/* Check header's name */
if (re->header == NULL) {
msg_info ("header regexp without header name: '%s'", re->regexp_text);
task_cache_add (task, re, 0);
return 0;
}
debug_task ("checking header regexp: %s = %s", re->header, re->regexp_text);
/* Get list of specified headers */
headerlist = message_get_header (task->task_pool, task->message, re->header, re->is_strong);
if (headerlist == NULL) {
/* Header is not found */
if (G_UNLIKELY (re->is_test)) {
msg_info ("process test regexp %s for header %s returned FALSE: no header found", re->regexp_text, re->header);
}
task_cache_add (task, re, 0);
return 0;
}
else {
memory_pool_add_destructor (task->task_pool, (pool_destruct_func)g_list_free, headerlist);
/* Check whether we have regexp for it */
if (re->regexp == NULL) {
debug_task ("regexp contains only header and it is found %s", re->header);
task_cache_add (task, re, 1);
return 1;
}
/* Iterate throught headers */
cur = headerlist;
while (cur) {
debug_task ("found header \"%s\" with value \"%s\"", re->header, (const gchar *)cur->data);
/* Try to match regexp */
if (cur->data && g_regex_match_full (re->regexp, cur->data, -1, 0, 0, NULL, &err) == TRUE) {
if (G_UNLIKELY (re->is_test)) {
msg_info ("process test regexp %s for header %s with value '%s' returned TRUE", re->regexp_text, re->header, (const gchar *)cur->data);
}
if (f != NULL && limit > 1) {
/* If we have limit count, increase passed count and compare with limit */
if (f (++passed, limit)) {
task_cache_add (task, re, 1);
return 1;
}
}
else {
task_cache_add (task, re, 1);
return 1;
}
}
else if (G_UNLIKELY (re->is_test)) {
msg_info ("process test regexp %s for header %s with value '%s' returned FALSE", re->regexp_text, re->header, (const gchar *)cur->data);
}
if (err != NULL) {
msg_info ("error occured while processing regexp \"%s\": %s", re->regexp_text, err->message);
}
cur = g_list_next (cur);
}
task_cache_add (task, re, 0);
return 0;
}
break;
case REGEXP_MIME:
debug_task ("checking mime regexp: %s", re->regexp_text);
/* Iterate throught text parts */
cur = g_list_first (task->text_parts);
while (cur) {
part = (struct mime_text_part *)cur->data;
/* Skip empty parts */
if (part->is_empty) {
cur = g_list_next (cur);
continue;
}
/* Skip too large parts */
if (regexp_module_ctx->max_size != 0 && part->content->len > regexp_module_ctx->max_size) {
msg_info ("<%s> skip part of size %Hud", task->message_id, part->content->len);
cur = g_list_next (cur);
continue;
}
/* Check raw flags */
if (part->is_raw) {
regexp = re->raw_regexp;
}
else {
regexp = re->regexp;
}
/* Select data for regexp */
if (re->is_raw) {
ct = part->orig->data;
clen = part->orig->len;
}
else {
ct = part->content->data;
clen = part->content->len;
}
/* If we have limit, apply regexp so much times as we can */
if (f != NULL && limit > 1) {
end = 0;
while ((matched = g_regex_match_full (regexp, ct + end + 1, clen - end - 1, 0, 0, &info, &err)) == TRUE) {
if (G_UNLIKELY (re->is_test)) {
msg_info ("process test regexp %s for mime part of length %d returned TRUE",
re->regexp_text,
(gint)clen,
end);
}
if (f (++passed, limit)) {
task_cache_add (task, re, 1);
return 1;
}
else {
/* Match not found, skip further cycles */
old = end;
if (!g_match_info_fetch_pos (info, 0, &start, &end) || end <= 0) {
break;
}
end += old;
}
g_match_info_free (info);
}
g_match_info_free (info);
}
else {
if (g_regex_match_full (regexp, ct, clen, 0, 0, NULL, &err) == TRUE) {
if (G_UNLIKELY (re->is_test)) {
msg_info ("process test regexp %s for mime part of length %d returned TRUE", re->regexp_text,
(gint)clen);
}
task_cache_add (task, re, 1);
return 1;
}
}
if (!matched && G_UNLIKELY (re->is_test)) {
msg_info ("process test regexp %s for mime part of length %d returned FALSE", re->regexp_text,
(gint)clen);
}
if (err != NULL) {
msg_info ("error occured while processing regexp \"%s\": %s", re->regexp_text, err->message);
}
cur = g_list_next (cur);
}
task_cache_add (task, re, 0);
return 0;
case REGEXP_MESSAGE:
debug_task ("checking message regexp: %s", re->regexp_text);
regexp = re->raw_regexp;
ct = task->msg->begin;
clen = task->msg->len;
if (regexp_module_ctx->max_size != 0 && clen > regexp_module_ctx->max_size) {
msg_info ("<%s> skip message of size %Hz", task->message_id, clen);
return 0;
}
/* If we have limit, apply regexp so much times as we can */
if (f != NULL && limit > 1) {
end = 0;
while ((matched = g_regex_match_full (regexp, ct + end + 1, clen - end - 1, 0, 0, &info, &err)) == TRUE) {
if (G_UNLIKELY (re->is_test)) {
msg_info ("process test regexp %s for mime part of length %d returned TRUE", re->regexp_text,
(gint)clen);
}
if (f (++passed, limit)) {
task_cache_add (task, re, 1);
return 1;
}
else {
/* Match not found, skip further cycles */
old = end;
if (!g_match_info_fetch_pos (info, 0, &start, &end) || end <= 0) {
break;
}
old += end;
}
g_match_info_free (info);
}
g_match_info_free (info);
}
else {
if (g_regex_match_full (regexp, ct, clen, 0, 0, NULL, &err) == TRUE) {
if (G_UNLIKELY (re->is_test)) {
msg_info ("process test regexp %s for message part of length %d returned TRUE", re->regexp_text,
(gint)clen);
}
task_cache_add (task, re, 1);
return 1;
}
}
if (!matched && G_UNLIKELY (re->is_test)) {
msg_info ("process test regexp %s for message part of length %d returned FALSE", re->regexp_text,
(gint)clen);
}
if (err != NULL) {
msg_info ("error occured while processing regexp \"%s\": %s", re->regexp_text, err->message);
}
task_cache_add (task, re, 0);
return 0;
case REGEXP_URL:
debug_task ("checking url regexp: %s", re->regexp_text);
if (f != NULL && limit > 1) {
/*XXX: add support of it */
msg_warn ("numbered matches are not supported for url regexp");
}
regexp = re->regexp;
callback_param.task = task;
callback_param.regexp = regexp;
callback_param.re = re;
callback_param.found = FALSE;
if (task->urls) {
g_tree_foreach (task->urls, tree_url_callback, &callback_param);
}
if (task->emails && callback_param.found == FALSE) {
g_tree_foreach (task->emails, tree_url_callback, &callback_param);
}
if (callback_param.found == FALSE) {
task_cache_add (task, re, 0);
}
return 0;
case REGEXP_RAW_HEADER:
debug_task ("checking for raw header: %s with regexp: %s", re->header, re->regexp_text);
/* Check header's name */
if (re->header == NULL) {
msg_info ("header regexp without header name: '%s'", re->regexp_text);
task_cache_add (task, re, 0);
return 0;
}
debug_task ("checking header regexp: %s = %s", re->header, re->regexp_text);
/* Get list of specified headers */
headerlist = message_get_raw_header (task, re->header, re->is_strong);
if (headerlist == NULL) {
/* Header is not found */
if (G_UNLIKELY (re->is_test)) {
msg_info ("process test regexp %s for header %s returned FALSE: no header found", re->regexp_text, re->header);
}
task_cache_add (task, re, 0);
return 0;
}
else {
/* Check whether we have regexp for it */
if (re->regexp == NULL) {
debug_task ("regexp contains only header and it is found %s", re->header);
task_cache_add (task, re, 1);
return 1;
}
/* Iterate throught headers */
cur = headerlist;
while (cur) {
debug_task ("found header \"%s\" with value \"%s\"", re->header, (const gchar *)cur->data);
rh = cur->data;
/* Try to match regexp */
if (rh->value && g_regex_match_full (re->regexp, rh->value, -1, 0, 0, NULL, &err) == TRUE) {
if (G_UNLIKELY (re->is_test)) {
msg_info ("process test regexp %s for header %s with value '%s' returned TRUE", re->regexp_text, re->header, (const gchar *)cur->data);
}
if (f != NULL && limit > 1) {
/* If we have limit count, increase passed count and compare with limit */
if (f (++passed, limit)) {
task_cache_add (task, re, 1);
return 1;
}
}
else {
task_cache_add (task, re, 1);
return 1;
}
}
else if (G_UNLIKELY (re->is_test)) {
msg_info ("process test regexp %s for header %s with value '%s' returned FALSE", re->regexp_text, re->header, (const gchar *)cur->data);
}
if (err != NULL) {
msg_info ("error occured while processing regexp \"%s\": %s", re->regexp_text, err->message);
}
cur = g_list_next (cur);
}
task_cache_add (task, re, 0);
return 0;
}
break;
default:
msg_warn ("bad error detected: %p is not a valid regexp object", re);
}
/* Not reached */
return 0;
}
static gboolean
maybe_call_lua_function (const gchar *name, struct worker_task *task)
{
lua_State *L = task->cfg->lua_state;
struct worker_task **ptask;
lua_getglobal (L, name);
if (lua_isfunction (L, -1)) {
ptask = lua_newuserdata (L, sizeof (struct worker_task *));
lua_setclass (L, "rspamd{task}", -1);
*ptask = task;
/* Call function */
if (lua_pcall (L, 1, 1, 0) != 0) {
msg_info ("call to %s failed: %s", (gchar *)name, lua_tostring (L, -1));
return FALSE;
}
return lua_toboolean (L, -1);
}
return FALSE;
}
static gboolean
optimize_regexp_expression (struct expression **e, GQueue * stack, gboolean res)
{
struct expression *it = (*e)->next;
gboolean ret = FALSE, is_nearest = TRUE;
gint skip_level = 0;
/* Skip nearest logical operators from optimization */
if (!it || (it->type == EXPR_OPERATION && it->content.operation != '!')) {
g_queue_push_head (stack, GSIZE_TO_POINTER (res));
return ret;
}
while (it) {
/* Find first operation for this iterator */
if (it->type == EXPR_OPERATION) {
/* If this operation is just ! just inverse res and check for further operators */
if (it->content.operation == '!') {
if (is_nearest) {
msg_debug ("found '!' operator, inversing result");
res = !res;
*e = it;
}
it = it->next;
continue;
}
else {
skip_level--;
}
/* Check whether we found corresponding operator for this operand */
if (skip_level <= 0) {
if (it->content.operation == '|' && res == TRUE) {
msg_debug ("found '|' and previous expression is true");
*e = it;
ret = TRUE;
}
else if (it->content.operation == '&' && res == FALSE) {
msg_debug ("found '&' and previous expression is false");
*e = it;
ret = TRUE;
}
break;
}
}
else {
is_nearest = FALSE;
skip_level++;
}
it = it->next;
}
g_queue_push_head (stack, GSIZE_TO_POINTER (res));
return ret;
}
static gboolean
process_regexp_expression (struct expression *expr, gchar *symbol, struct worker_task *task, const gchar *additional)
{
GQueue *stack;
gsize cur, op1, op2;
struct expression *it = expr;
struct rspamd_regexp *re;
gboolean try_optimize = TRUE;
stack = g_queue_new ();
while (it) {
if (it->type == EXPR_REGEXP_PARSED) {
/* Find corresponding symbol */
cur = process_regexp ((struct rspamd_regexp *)it->content.operand, task, additional, 0, NULL);
debug_task ("regexp %s found", cur ? "is" : "is not");
if (try_optimize) {
try_optimize = optimize_regexp_expression (&it, stack, cur);
}
else {
g_queue_push_head (stack, GSIZE_TO_POINTER (cur));
}
}
else if (it->type == EXPR_FUNCTION) {
cur = (gsize) call_expression_function ((struct expression_function *)it->content.operand, task);
debug_task ("function %s returned %s", ((struct expression_function *)it->content.operand)->name, cur ? "true" : "false");
if (try_optimize) {
try_optimize = optimize_regexp_expression (&it, stack, cur);
}
else {
g_queue_push_head (stack, GSIZE_TO_POINTER (cur));
}
}
else if (it->type == EXPR_STR) {
/* This may be lua function, try to call it */
cur = maybe_call_lua_function ((const gchar*)it->content.operand, task);
debug_task ("function %s returned %s", (const gchar *)it->content.operand, cur ? "true" : "false");
if (try_optimize) {
try_optimize = optimize_regexp_expression (&it, stack, cur);
}
else {
g_queue_push_head (stack, GSIZE_TO_POINTER (cur));
}
}
else if (it->type == EXPR_REGEXP) {
/* Compile regexp if it is not parsed */
if (it->content.operand == NULL) {
it = it->next;
continue;
}
re = parse_regexp (task->cfg->cfg_pool, it->content.operand, task->cfg->raw_mode);
if (re == NULL) {
msg_warn ("cannot parse regexp, skip expression");
g_queue_free (stack);
return FALSE;
}
it->content.operand = re;
it->type = EXPR_REGEXP_PARSED;
/* Continue with this regexp once again */
continue;
}
else if (it->type == EXPR_OPERATION) {
if (g_queue_is_empty (stack)) {
/* Queue has no operands for operation, exiting */
msg_warn ("regexp expression seems to be invalid: empty stack while reading operation");
g_queue_free (stack);
return FALSE;
}
debug_task ("got operation %c", it->content.operation);
switch (it->content.operation) {
case '!':
op1 = GPOINTER_TO_SIZE (g_queue_pop_head (stack));
op1 = !op1;
try_optimize = optimize_regexp_expression (&it, stack, op1);
break;
case '&':
op1 = GPOINTER_TO_SIZE (g_queue_pop_head (stack));
op2 = GPOINTER_TO_SIZE (g_queue_pop_head (stack));
try_optimize = optimize_regexp_expression (&it, stack, op1 && op2);
break;
case '|':
op1 = GPOINTER_TO_SIZE (g_queue_pop_head (stack));
op2 = GPOINTER_TO_SIZE (g_queue_pop_head (stack));
try_optimize = optimize_regexp_expression (&it, stack, op1 || op2);
break;
default:
it = it->next;
continue;
}
}
if (it) {
it = it->next;
}
}
if (!g_queue_is_empty (stack)) {
op1 = GPOINTER_TO_SIZE (g_queue_pop_head (stack));
if (op1) {
g_queue_free (stack);
return TRUE;
}
}
else {
msg_warn ("regexp expression seems to be invalid: empty stack at the end of expression, symbol %s", symbol);
}
g_queue_free (stack);
return FALSE;
}
static void
process_regexp_item (struct worker_task *task, void *user_data)
{
struct regexp_module_item *item = user_data;
gboolean res = FALSE;
if (item->lua_function) {
/* Just call function */
if (lua_call_expression_func ("regexp", item->lua_function, task, NULL, &res) && res) {
insert_result (task, item->symbol, 1, NULL);
}
}
else {
/* Process expression */
if (process_regexp_expression (item->expr, item->symbol, task, NULL)) {
insert_result (task, item->symbol, 1, NULL);
}
}
}
static gint
regexp_common_filter (struct worker_task *task)
{
/* XXX: remove this shit too */
return 0;
}
static gboolean
rspamd_regexp_match_number (struct worker_task *task, GList * args, void *unused)
{
gint param_count, res = 0;
struct expression_argument *arg;
GList *cur;
if (args == NULL) {
msg_warn ("no parameters to function");
return FALSE;
}
arg = get_function_arg (args->data, task, TRUE);
param_count = strtoul (arg->data, NULL, 10);
cur = args->next;
while (cur) {
arg = get_function_arg (cur->data, task, FALSE);
if (arg && arg->type == EXPRESSION_ARGUMENT_BOOL) {
if ((gboolean) GPOINTER_TO_SIZE (arg->data)) {
res++;
}
}
else {
if (process_regexp_expression (cur->data, "regexp_match_number", task, NULL)) {
res++;
}
if (res >= param_count) {
return TRUE;
}
}
cur = g_list_next (cur);
}
return res >= param_count;
}
static gboolean
rspamd_regexp_occurs_number (struct worker_task *task, GList * args, void *unused)
{
gint limit;
struct expression_argument *arg;
struct rspamd_regexp *re;
gchar *param, *err_str, op;
int_compare_func f = NULL;
if (args == NULL || args->next == NULL) {
msg_warn ("wrong number of parameters to function, must be 2");
return FALSE;
}
arg = get_function_arg (args->data, task, TRUE);
if ((re = re_cache_check (arg->data, task->cfg->cfg_pool)) == NULL) {
re = parse_regexp (task->cfg->cfg_pool, arg->data, task->cfg->raw_mode);
if (!re) {
msg_err ("cannot parse given regexp: %s", (gchar *)arg->data);
return FALSE;
}
}
arg = get_function_arg (args->next->data, task, TRUE);
param = arg->data;
op = *param;
if (g_ascii_isdigit (op)) {
op = '=';
}
else {
param ++;
}
switch (op) {
case '>':
if (*param == '=') {
f = op_more_equal;
param ++;
}
else {
f = op_more;
}
break;
case '<':
if (*param == '=') {
f = op_less_equal;
param ++;
}
else {
f = op_less;
}
break;
case '=':
f = op_equal;
break;
default:
msg_err ("wrong operation character: %c, assumed '=', '>', '<', '>=', '<=' or empty op", op);
return FALSE;
}
limit = strtoul (param, &err_str, 10);
if (*err_str != 0) {
msg_err ("wrong numeric: %s at position: %s", param, err_str);
return FALSE;
}
return process_regexp (re, task, NULL, limit, f);
}
static gboolean
rspamd_raw_header_exists (struct worker_task *task, GList * args, void *unused)
{
struct expression_argument *arg;
if (args == NULL || task == NULL) {
return FALSE;
}
arg = get_function_arg (args->data, task, TRUE);
if (!arg || arg->type == EXPRESSION_ARGUMENT_BOOL) {
msg_warn ("invalid argument to function is passed");
return FALSE;
}
return g_hash_table_lookup (task->raw_headers, arg->data) != NULL;
}
static gboolean
match_smtp_data (struct worker_task *task, const gchar *re_text, const gchar *what)
{
struct rspamd_regexp *re;
gint r;
if (*re_text == '/') {
/* This is a regexp */
if ((re = re_cache_check (re_text, task->cfg->cfg_pool)) == NULL) {
re = parse_regexp (task->cfg->cfg_pool, (gchar *)re_text, task->cfg->raw_mode);
if (re == NULL) {
msg_warn ("cannot compile regexp for function");
return FALSE;
}
re_cache_add ((gchar *)re_text, re, task->cfg->cfg_pool);
}
if ((r = task_cache_check (task, re)) == -1) {
if (g_regex_match (re->regexp, what, 0, NULL) == TRUE) {
task_cache_add (task, re, 1);
return TRUE;
}
task_cache_add (task, re, 0);
}
else {
return r == 1;
}
}
else if (g_ascii_strcasecmp (re_text, what) == 0) {
return TRUE;
}
return FALSE;
}
static gboolean
rspamd_check_smtp_data (struct worker_task *task, GList * args, void *unused)
{
struct expression_argument *arg;
GList *cur, *rcpt_list = NULL;
gchar *type, *what = NULL;
if (args == NULL) {
msg_warn ("no parameters to function");
return FALSE;
}
arg = get_function_arg (args->data, task, TRUE);
if (!arg || !arg->data) {
msg_warn ("no parameters to function");
return FALSE;
}
else {
type = arg->data;
switch (*type) {
case 'f':
case 'F':
if (g_ascii_strcasecmp (type, "from") == 0) {
what = task->from;
}
else {
msg_warn ("bad argument to function: %s", type);
return FALSE;
}
break;
case 'h':
case 'H':
if (g_ascii_strcasecmp (type, "helo") == 0) {
what = task->helo;
}
else {
msg_warn ("bad argument to function: %s", type);
return FALSE;
}
break;
case 'u':
case 'U':
if (g_ascii_strcasecmp (type, "user") == 0) {
what = task->user;
}
else {
msg_warn ("bad argument to function: %s", type);
return FALSE;
}
break;
case 's':
case 'S':
if (g_ascii_strcasecmp (type, "subject") == 0) {
what = task->subject;
}
else {
msg_warn ("bad argument to function: %s", type);
return FALSE;
}
break;
case 'r':
case 'R':
if (g_ascii_strcasecmp (type, "rcpt") == 0) {
rcpt_list = task->rcpt;
}
else {
msg_warn ("bad argument to function: %s", type);
return FALSE;
}
break;
default:
msg_warn ("bad argument to function: %s", type);
return FALSE;
}
}
if (what == NULL && rcpt_list == NULL) {
/* Not enough data so regexp would NOT be found anyway */
return FALSE;
}
/* We would process only one more argument, others are ignored */
cur = args->next;
if (cur) {
arg = get_function_arg (cur->data, task, FALSE);
if (arg && arg->type == EXPRESSION_ARGUMENT_NORMAL) {
if (what != NULL) {
return match_smtp_data (task, arg->data, what);
}
else {
while (rcpt_list) {
if (match_smtp_data (task, arg->data, rcpt_list->data)) {
return TRUE;
}
rcpt_list = g_list_next (rcpt_list);
}
}
}
else if (arg != NULL) {
if (what != NULL) {
if (process_regexp_expression (arg->data, "regexp_check_smtp_data", task, what)) {
return TRUE;
}
}
else {
while (rcpt_list) {
if (process_regexp_expression (arg->data, "regexp_check_smtp_data", task, rcpt_list->data)) {
return TRUE;
}
rcpt_list = g_list_next (rcpt_list);
}
}
}
}
return FALSE;
}
/* Lua part */
static gint
lua_regexp_match (lua_State *L)
{
void *ud = luaL_checkudata (L, 1, "rspamd{task}");
struct worker_task *task;
const gchar *re_text;
struct rspamd_regexp *re;
gint r = 0;
luaL_argcheck (L, ud != NULL, 1, "'task' expected");
task = ud ? *((struct worker_task **)ud) : NULL;
re_text = luaL_checkstring (L, 2);
/* This is a regexp */
if (task != NULL) {
if ((re = re_cache_check (re_text, task->cfg->cfg_pool)) == NULL) {
re = parse_regexp (task->cfg->cfg_pool, (gchar *)re_text, task->cfg->raw_mode);
if (re == NULL) {
msg_warn ("cannot compile regexp for function");
return FALSE;
}
re_cache_add ((gchar *)re_text, re, task->cfg->cfg_pool);
}
r = process_regexp (re, task, NULL, 0, NULL);
}
lua_pushboolean (L, r == 1);
return 1;
}
|