You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

map_helpers.c 41KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845
  1. /*
  2. * Copyright 2023 Vsevolod Stakhov
  3. *
  4. * Licensed under the Apache License, Version 2.0 (the "License");
  5. * you may not use this file except in compliance with the License.
  6. * You may obtain a copy of the License at
  7. *
  8. * http://www.apache.org/licenses/LICENSE-2.0
  9. *
  10. * Unless required by applicable law or agreed to in writing, software
  11. * distributed under the License is distributed on an "AS IS" BASIS,
  12. * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  13. * See the License for the specific language governing permissions and
  14. * limitations under the License.
  15. */
  16. #include "map_helpers.h"
  17. #include "map_private.h"
  18. #include "khash.h"
  19. #include "radix.h"
  20. #include "rspamd.h"
  21. #include "cryptobox.h"
  22. #include "mempool_vars_internal.h"
  23. #include "contrib/fastutf8/fastutf8.h"
  24. #include "contrib/cdb/cdb.h"
  25. #ifdef WITH_HYPERSCAN
  26. #include "hs.h"
  27. #include "hyperscan_tools.h"
  28. #endif
  29. #ifndef WITH_PCRE2
  30. #include <pcre.h>
  31. #else
  32. #include <pcre2.h>
  33. #endif
  34. static const uint64_t map_hash_seed = 0xdeadbabeULL;
  35. static const char *const hash_fill = "1";
  36. struct rspamd_map_helper_value {
  37. gsize hits;
  38. gconstpointer key;
  39. char value[]; /* Null terminated */
  40. };
  41. #define rspamd_map_ftok_hash(t) (rspamd_icase_hash((t).begin, (t).len, rspamd_hash_seed()))
  42. #define rspamd_map_ftok_equal(a, b) ((a).len == (b).len && rspamd_lc_cmp((a).begin, (b).begin, (a).len) == 0)
  43. KHASH_INIT(rspamd_map_hash, rspamd_ftok_t,
  44. struct rspamd_map_helper_value *, true,
  45. rspamd_map_ftok_hash, rspamd_map_ftok_equal);
  46. struct rspamd_radix_map_helper {
  47. rspamd_mempool_t *pool;
  48. khash_t(rspamd_map_hash) * htb;
  49. radix_compressed_t *trie;
  50. struct rspamd_map *map;
  51. rspamd_cryptobox_fast_hash_state_t hst;
  52. };
  53. struct rspamd_hash_map_helper {
  54. rspamd_mempool_t *pool;
  55. khash_t(rspamd_map_hash) * htb;
  56. struct rspamd_map *map;
  57. rspamd_cryptobox_fast_hash_state_t hst;
  58. };
  59. struct rspamd_cdb_map_helper {
  60. GQueue cdbs;
  61. struct rspamd_map *map;
  62. rspamd_cryptobox_fast_hash_state_t hst;
  63. gsize total_size;
  64. };
  65. struct rspamd_regexp_map_helper {
  66. rspamd_cryptobox_hash_state_t hst;
  67. unsigned char re_digest[rspamd_cryptobox_HASHBYTES];
  68. rspamd_mempool_t *pool;
  69. struct rspamd_map *map;
  70. GPtrArray *regexps;
  71. GPtrArray *values;
  72. khash_t(rspamd_map_hash) * htb;
  73. enum rspamd_regexp_map_flags map_flags;
  74. #ifdef WITH_HYPERSCAN
  75. rspamd_hyperscan_t *hs_db;
  76. hs_scratch_t *hs_scratch;
  77. char **patterns;
  78. int *flags;
  79. int *ids;
  80. #endif
  81. };
  82. /**
  83. * FSM for parsing lists
  84. */
  85. #define MAP_STORE_KEY \
  86. do { \
  87. while (g_ascii_isspace(*c) && p > c) { c++; } \
  88. key = g_malloc(p - c + 1); \
  89. rspamd_strlcpy(key, c, p - c + 1); \
  90. stripped_key = g_strstrip(key); \
  91. } while (0)
  92. #define MAP_STORE_VALUE \
  93. do { \
  94. while (g_ascii_isspace(*c) && p > c) { c++; } \
  95. value = g_malloc(p - c + 1); \
  96. rspamd_strlcpy(value, c, p - c + 1); \
  97. stripped_value = g_strstrip(value); \
  98. } while (0)
  99. char *
  100. rspamd_parse_kv_list(
  101. char *chunk,
  102. int len,
  103. struct map_cb_data *data,
  104. rspamd_map_insert_func func,
  105. const char *default_value,
  106. gboolean final)
  107. {
  108. enum {
  109. map_skip_spaces_before_key = 0,
  110. map_read_key,
  111. map_read_key_quoted,
  112. map_read_key_slashed,
  113. map_skip_spaces_after_key,
  114. map_backslash_quoted,
  115. map_backslash_slashed,
  116. map_read_key_after_slash,
  117. map_read_value,
  118. map_read_comment_start,
  119. map_skip_comment,
  120. map_read_eol,
  121. };
  122. char *c, *p, *key = NULL, *value = NULL, *stripped_key, *stripped_value, *end;
  123. struct rspamd_map *map = data->map;
  124. unsigned int line_number = 0;
  125. p = chunk;
  126. c = p;
  127. end = p + len;
  128. while (p < end) {
  129. switch (data->state) {
  130. case map_skip_spaces_before_key:
  131. if (g_ascii_isspace(*p)) {
  132. p++;
  133. }
  134. else {
  135. if (*p == '"') {
  136. p++;
  137. c = p;
  138. data->state = map_read_key_quoted;
  139. }
  140. else if (*p == '/') {
  141. /* Note that c is on '/' here as '/' is a part of key */
  142. c = p;
  143. p++;
  144. data->state = map_read_key_slashed;
  145. }
  146. else {
  147. c = p;
  148. data->state = map_read_key;
  149. }
  150. }
  151. break;
  152. case map_read_key:
  153. /* read key */
  154. /* Check here comments, eol and end of buffer */
  155. if (*p == '#' && (p == c || *(p - 1) != '\\')) {
  156. if (p - c > 0) {
  157. /* Store a single key */
  158. MAP_STORE_KEY;
  159. func(data->cur_data, stripped_key, default_value);
  160. msg_debug_map("insert key only pair: %s -> %s; line: %d",
  161. stripped_key, default_value, line_number);
  162. g_free(key);
  163. }
  164. key = NULL;
  165. data->state = map_read_comment_start;
  166. }
  167. else if (*p == '\r' || *p == '\n') {
  168. if (p - c > 0) {
  169. /* Store a single key */
  170. MAP_STORE_KEY;
  171. func(data->cur_data, stripped_key, default_value);
  172. msg_debug_map("insert key only pair: %s -> %s; line: %d",
  173. stripped_key, default_value, line_number);
  174. g_free(key);
  175. }
  176. data->state = map_read_eol;
  177. key = NULL;
  178. }
  179. else if (g_ascii_isspace(*p)) {
  180. if (p - c > 0) {
  181. MAP_STORE_KEY;
  182. data->state = map_skip_spaces_after_key;
  183. }
  184. else {
  185. msg_err_map("empty or invalid key found on line %d", line_number);
  186. data->state = map_skip_comment;
  187. }
  188. }
  189. else {
  190. p++;
  191. }
  192. break;
  193. case map_read_key_quoted:
  194. if (*p == '\\') {
  195. data->state = map_backslash_quoted;
  196. p++;
  197. }
  198. else if (*p == '"') {
  199. /* Allow empty keys in this case */
  200. if (p - c >= 0) {
  201. MAP_STORE_KEY;
  202. data->state = map_skip_spaces_after_key;
  203. }
  204. else {
  205. g_assert_not_reached();
  206. }
  207. p++;
  208. }
  209. else {
  210. p++;
  211. }
  212. break;
  213. case map_read_key_slashed:
  214. if (*p == '\\') {
  215. data->state = map_backslash_slashed;
  216. p++;
  217. }
  218. else if (*p == '/') {
  219. /* Allow empty keys in this case */
  220. if (p - c >= 0) {
  221. data->state = map_read_key_after_slash;
  222. }
  223. else {
  224. g_assert_not_reached();
  225. }
  226. }
  227. else {
  228. p++;
  229. }
  230. break;
  231. case map_read_key_after_slash:
  232. /*
  233. * This state is equal to reading of key but '/' is not
  234. * treated specially
  235. */
  236. if (*p == '#') {
  237. if (p - c > 0) {
  238. /* Store a single key */
  239. MAP_STORE_KEY;
  240. func(data->cur_data, stripped_key, default_value);
  241. msg_debug_map("insert key only pair: %s -> %s; line: %d",
  242. stripped_key, default_value, line_number);
  243. g_free(key);
  244. key = NULL;
  245. }
  246. data->state = map_read_comment_start;
  247. }
  248. else if (*p == '\r' || *p == '\n') {
  249. if (p - c > 0) {
  250. /* Store a single key */
  251. MAP_STORE_KEY;
  252. func(data->cur_data, stripped_key, default_value);
  253. msg_debug_map("insert key only pair: %s -> %s; line: %d",
  254. stripped_key, default_value, line_number);
  255. g_free(key);
  256. key = NULL;
  257. }
  258. data->state = map_read_eol;
  259. key = NULL;
  260. }
  261. else if (g_ascii_isspace(*p)) {
  262. if (p - c > 0) {
  263. MAP_STORE_KEY;
  264. data->state = map_skip_spaces_after_key;
  265. }
  266. else {
  267. msg_err_map("empty or invalid key found on line %d", line_number);
  268. data->state = map_skip_comment;
  269. }
  270. }
  271. else {
  272. p++;
  273. }
  274. break;
  275. case map_backslash_quoted:
  276. p++;
  277. data->state = map_read_key_quoted;
  278. break;
  279. case map_backslash_slashed:
  280. p++;
  281. data->state = map_read_key_slashed;
  282. break;
  283. case map_skip_spaces_after_key:
  284. if (*p == ' ' || *p == '\t') {
  285. p++;
  286. }
  287. else {
  288. c = p;
  289. data->state = map_read_value;
  290. }
  291. break;
  292. case map_read_value:
  293. if (key == NULL) {
  294. /* Ignore line */
  295. msg_err_map("empty or invalid key found on line %d", line_number);
  296. data->state = map_skip_comment;
  297. }
  298. else {
  299. if (*p == '#') {
  300. if (p - c > 0) {
  301. /* Store a single key */
  302. MAP_STORE_VALUE;
  303. func(data->cur_data, stripped_key, stripped_value);
  304. msg_debug_map("insert key value pair: %s -> %s; line: %d",
  305. stripped_key, stripped_value, line_number);
  306. g_free(key);
  307. g_free(value);
  308. key = NULL;
  309. value = NULL;
  310. }
  311. else {
  312. func(data->cur_data, stripped_key, default_value);
  313. msg_debug_map("insert key only pair: %s -> %s; line: %d",
  314. stripped_key, default_value, line_number);
  315. g_free(key);
  316. key = NULL;
  317. }
  318. data->state = map_read_comment_start;
  319. }
  320. else if (*p == '\r' || *p == '\n') {
  321. if (p - c > 0) {
  322. /* Store a single key */
  323. MAP_STORE_VALUE;
  324. func(data->cur_data, stripped_key, stripped_value);
  325. msg_debug_map("insert key value pair: %s -> %s",
  326. stripped_key, stripped_value);
  327. g_free(key);
  328. g_free(value);
  329. key = NULL;
  330. value = NULL;
  331. }
  332. else {
  333. func(data->cur_data, stripped_key, default_value);
  334. msg_debug_map("insert key only pair: %s -> %s",
  335. stripped_key, default_value);
  336. g_free(key);
  337. key = NULL;
  338. }
  339. data->state = map_read_eol;
  340. key = NULL;
  341. }
  342. else {
  343. p++;
  344. }
  345. }
  346. break;
  347. case map_read_comment_start:
  348. if (*p == '#') {
  349. data->state = map_skip_comment;
  350. p++;
  351. key = NULL;
  352. value = NULL;
  353. }
  354. else {
  355. g_assert_not_reached();
  356. }
  357. break;
  358. case map_skip_comment:
  359. if (*p == '\r' || *p == '\n') {
  360. data->state = map_read_eol;
  361. }
  362. else {
  363. p++;
  364. }
  365. break;
  366. case map_read_eol:
  367. /* Skip \r\n and whitespaces */
  368. if (*p == '\r' || *p == '\n') {
  369. if (*p == '\n') {
  370. /* We don't care about \r only line separators, they are too rare */
  371. line_number++;
  372. }
  373. p++;
  374. }
  375. else {
  376. data->state = map_skip_spaces_before_key;
  377. }
  378. break;
  379. default:
  380. g_assert_not_reached();
  381. break;
  382. }
  383. }
  384. if (final) {
  385. /* Examine the state */
  386. switch (data->state) {
  387. case map_read_key:
  388. case map_read_key_slashed:
  389. case map_read_key_quoted:
  390. case map_read_key_after_slash:
  391. if (p - c > 0) {
  392. /* Store a single key */
  393. MAP_STORE_KEY;
  394. func(data->cur_data, stripped_key, default_value);
  395. msg_debug_map("insert key only pair: %s -> %s",
  396. stripped_key, default_value);
  397. g_free(key);
  398. key = NULL;
  399. }
  400. break;
  401. case map_read_value:
  402. if (key == NULL) {
  403. /* Ignore line */
  404. msg_err_map("empty or invalid key found on line %d", line_number);
  405. data->state = map_skip_comment;
  406. }
  407. else {
  408. if (p - c > 0) {
  409. /* Store a single key */
  410. MAP_STORE_VALUE;
  411. func(data->cur_data, stripped_key, stripped_value);
  412. msg_debug_map("insert key value pair: %s -> %s",
  413. stripped_key, stripped_value);
  414. g_free(key);
  415. g_free(value);
  416. key = NULL;
  417. value = NULL;
  418. }
  419. else {
  420. func(data->cur_data, stripped_key, default_value);
  421. msg_debug_map("insert key only pair: %s -> %s",
  422. stripped_key, default_value);
  423. g_free(key);
  424. key = NULL;
  425. }
  426. }
  427. break;
  428. }
  429. data->state = map_skip_spaces_before_key;
  430. }
  431. return c;
  432. }
  433. /**
  434. * Radix tree helper function
  435. */
  436. void rspamd_map_helper_insert_radix(gpointer st, gconstpointer key, gconstpointer value)
  437. {
  438. struct rspamd_radix_map_helper *r = (struct rspamd_radix_map_helper *) st;
  439. struct rspamd_map_helper_value *val;
  440. gsize vlen;
  441. khiter_t k;
  442. gconstpointer nk;
  443. rspamd_ftok_t tok;
  444. int res;
  445. struct rspamd_map *map;
  446. map = r->map;
  447. tok.begin = key;
  448. tok.len = strlen(key);
  449. k = kh_get(rspamd_map_hash, r->htb, tok);
  450. if (k == kh_end(r->htb)) {
  451. nk = rspamd_mempool_strdup(r->pool, key);
  452. tok.begin = nk;
  453. k = kh_put(rspamd_map_hash, r->htb, tok, &res);
  454. }
  455. else {
  456. val = kh_value(r->htb, k);
  457. if (strcmp(value, val->value) == 0) {
  458. /* Same element, skip */
  459. return;
  460. }
  461. else {
  462. msg_warn_map("duplicate radix entry found for map %s: %s (old value: '%s', new: '%s')",
  463. map->name, key, val->value, value);
  464. }
  465. nk = kh_key(r->htb, k).begin;
  466. val->key = nk;
  467. kh_value(r->htb, k) = val;
  468. return; /* do not touch radix in case of exact duplicate */
  469. }
  470. vlen = strlen(value);
  471. val = rspamd_mempool_alloc0(r->pool, sizeof(*val) +
  472. vlen + 1);
  473. memcpy(val->value, value, vlen);
  474. nk = kh_key(r->htb, k).begin;
  475. val->key = nk;
  476. kh_value(r->htb, k) = val;
  477. rspamd_radix_add_iplist(key, ",", r->trie, val, FALSE,
  478. r->map->name);
  479. rspamd_cryptobox_fast_hash_update(&r->hst, nk, tok.len);
  480. }
  481. void rspamd_map_helper_insert_radix_resolve(gpointer st, gconstpointer key, gconstpointer value)
  482. {
  483. struct rspamd_radix_map_helper *r = (struct rspamd_radix_map_helper *) st;
  484. struct rspamd_map_helper_value *val;
  485. gsize vlen;
  486. khiter_t k;
  487. gconstpointer nk;
  488. rspamd_ftok_t tok;
  489. int res;
  490. struct rspamd_map *map;
  491. map = r->map;
  492. if (!key) {
  493. msg_warn_map("cannot insert NULL value in the map: %s",
  494. map->name);
  495. return;
  496. }
  497. tok.begin = key;
  498. tok.len = strlen(key);
  499. k = kh_get(rspamd_map_hash, r->htb, tok);
  500. if (k == kh_end(r->htb)) {
  501. nk = rspamd_mempool_strdup(r->pool, key);
  502. tok.begin = nk;
  503. k = kh_put(rspamd_map_hash, r->htb, tok, &res);
  504. }
  505. else {
  506. val = kh_value(r->htb, k);
  507. if (strcmp(value, val->value) == 0) {
  508. /* Same element, skip */
  509. return;
  510. }
  511. else {
  512. msg_warn_map("duplicate radix entry found for map %s: %s (old value: '%s', new: '%s')",
  513. map->name, key, val->value, value);
  514. }
  515. nk = kh_key(r->htb, k).begin;
  516. val->key = nk;
  517. kh_value(r->htb, k) = val;
  518. return; /* do not touch radix in case of exact duplicate */
  519. }
  520. vlen = strlen(value);
  521. val = rspamd_mempool_alloc0(r->pool, sizeof(*val) +
  522. vlen + 1);
  523. memcpy(val->value, value, vlen);
  524. nk = kh_key(r->htb, k).begin;
  525. val->key = nk;
  526. kh_value(r->htb, k) = val;
  527. rspamd_radix_add_iplist(key, ",", r->trie, val, TRUE,
  528. r->map->name);
  529. rspamd_cryptobox_fast_hash_update(&r->hst, nk, tok.len);
  530. }
  531. void rspamd_map_helper_insert_hash(gpointer st, gconstpointer key, gconstpointer value)
  532. {
  533. struct rspamd_hash_map_helper *ht = st;
  534. struct rspamd_map_helper_value *val;
  535. khiter_t k;
  536. gconstpointer nk;
  537. gsize vlen;
  538. int r;
  539. rspamd_ftok_t tok;
  540. struct rspamd_map *map;
  541. tok.begin = key;
  542. tok.len = strlen(key);
  543. map = ht->map;
  544. k = kh_get(rspamd_map_hash, ht->htb, tok);
  545. if (k == kh_end(ht->htb)) {
  546. nk = rspamd_mempool_strdup(ht->pool, key);
  547. tok.begin = nk;
  548. k = kh_put(rspamd_map_hash, ht->htb, tok, &r);
  549. }
  550. else {
  551. val = kh_value(ht->htb, k);
  552. if (strcmp(value, val->value) == 0) {
  553. /* Same element, skip */
  554. return;
  555. }
  556. else {
  557. msg_warn_map("duplicate hash entry found for map %s: %s (old value: '%s', new: '%s')",
  558. map->name, key, val->value, value);
  559. }
  560. }
  561. /* Null termination due to alloc0 */
  562. vlen = strlen(value);
  563. val = rspamd_mempool_alloc0(ht->pool, sizeof(*val) + vlen + 1);
  564. memcpy(val->value, value, vlen);
  565. tok = kh_key(ht->htb, k);
  566. nk = tok.begin;
  567. val->key = nk;
  568. kh_value(ht->htb, k) = val;
  569. rspamd_cryptobox_fast_hash_update(&ht->hst, nk, tok.len);
  570. }
  571. void rspamd_map_helper_insert_re(gpointer st, gconstpointer key, gconstpointer value)
  572. {
  573. struct rspamd_regexp_map_helper *re_map = st;
  574. struct rspamd_map *map;
  575. rspamd_regexp_t *re;
  576. char *escaped;
  577. GError *err = NULL;
  578. int pcre_flags;
  579. gsize escaped_len;
  580. struct rspamd_map_helper_value *val;
  581. khiter_t k;
  582. rspamd_ftok_t tok;
  583. gconstpointer nk;
  584. gsize vlen;
  585. int r;
  586. map = re_map->map;
  587. tok.begin = key;
  588. tok.len = strlen(key);
  589. k = kh_get(rspamd_map_hash, re_map->htb, tok);
  590. if (k == kh_end(re_map->htb)) {
  591. nk = rspamd_mempool_strdup(re_map->pool, key);
  592. tok.begin = nk;
  593. k = kh_put(rspamd_map_hash, re_map->htb, tok, &r);
  594. }
  595. else {
  596. val = kh_value(re_map->htb, k);
  597. /* Always warn about regexp duplicate as it's likely a bad mistake */
  598. msg_warn_map("duplicate re entry found for map %s: %s (old value: '%s', new: '%s')",
  599. map->name, key, val->value, value);
  600. if (strcmp(val->value, value) == 0) {
  601. /* Same value, skip */
  602. return;
  603. }
  604. /* Replace value but do not touch regexp */
  605. nk = kh_key(re_map->htb, k).begin;
  606. val->key = nk;
  607. kh_value(re_map->htb, k) = val;
  608. return;
  609. }
  610. /* Check regexp stuff */
  611. if (re_map->map_flags & RSPAMD_REGEXP_MAP_FLAG_GLOB) {
  612. escaped = rspamd_str_regexp_escape(key, strlen(key), &escaped_len,
  613. RSPAMD_REGEXP_ESCAPE_GLOB | RSPAMD_REGEXP_ESCAPE_UTF);
  614. re = rspamd_regexp_new(escaped, NULL, &err);
  615. g_free(escaped);
  616. }
  617. else {
  618. re = rspamd_regexp_new(key, NULL, &err);
  619. }
  620. if (re == NULL) {
  621. msg_err_map("cannot parse regexp %s: %e", key, err);
  622. if (err) {
  623. g_error_free(err);
  624. }
  625. return;
  626. }
  627. vlen = strlen(value);
  628. val = rspamd_mempool_alloc0(re_map->pool, sizeof(*val) +
  629. vlen + 1);
  630. memcpy(val->value, value, vlen); /* Null terminated due to alloc0 previously */
  631. nk = kh_key(re_map->htb, k).begin;
  632. val->key = nk;
  633. kh_value(re_map->htb, k) = val;
  634. rspamd_cryptobox_hash_update(&re_map->hst, nk, tok.len);
  635. pcre_flags = rspamd_regexp_get_pcre_flags(re);
  636. #ifndef WITH_PCRE2
  637. if (pcre_flags & PCRE_FLAG(UTF8)) {
  638. re_map->map_flags |= RSPAMD_REGEXP_MAP_FLAG_UTF;
  639. }
  640. #else
  641. if (pcre_flags & PCRE_FLAG(UTF)) {
  642. re_map->map_flags |= RSPAMD_REGEXP_MAP_FLAG_UTF;
  643. }
  644. #endif
  645. g_ptr_array_add(re_map->regexps, re);
  646. g_ptr_array_add(re_map->values, val);
  647. }
  648. static void
  649. rspamd_map_helper_traverse_regexp(void *data,
  650. rspamd_map_traverse_cb cb,
  651. gpointer cbdata,
  652. gboolean reset_hits)
  653. {
  654. rspamd_ftok_t tok;
  655. struct rspamd_map_helper_value *val;
  656. struct rspamd_regexp_map_helper *re_map = data;
  657. kh_foreach(re_map->htb, tok, val, {
  658. if (!cb(tok.begin, val->value, val->hits, cbdata)) {
  659. break;
  660. }
  661. if (reset_hits) {
  662. val->hits = 0;
  663. }
  664. });
  665. }
  666. struct rspamd_hash_map_helper *
  667. rspamd_map_helper_new_hash(struct rspamd_map *map)
  668. {
  669. struct rspamd_hash_map_helper *htb;
  670. rspamd_mempool_t *pool;
  671. if (map) {
  672. pool = rspamd_mempool_new(rspamd_mempool_suggest_size(),
  673. map->tag, 0);
  674. }
  675. else {
  676. pool = rspamd_mempool_new(rspamd_mempool_suggest_size(),
  677. NULL, 0);
  678. }
  679. htb = rspamd_mempool_alloc0_type(pool, struct rspamd_hash_map_helper);
  680. htb->htb = kh_init(rspamd_map_hash);
  681. htb->pool = pool;
  682. htb->map = map;
  683. rspamd_cryptobox_fast_hash_init(&htb->hst, map_hash_seed);
  684. return htb;
  685. }
  686. void rspamd_map_helper_destroy_hash(struct rspamd_hash_map_helper *r)
  687. {
  688. if (r == NULL || r->pool == NULL) {
  689. return;
  690. }
  691. rspamd_mempool_t *pool = r->pool;
  692. kh_destroy(rspamd_map_hash, r->htb);
  693. memset(r, 0, sizeof(*r));
  694. rspamd_mempool_delete(pool);
  695. }
  696. static void
  697. rspamd_map_helper_traverse_hash(void *data,
  698. rspamd_map_traverse_cb cb,
  699. gpointer cbdata,
  700. gboolean reset_hits)
  701. {
  702. rspamd_ftok_t tok;
  703. struct rspamd_map_helper_value *val;
  704. struct rspamd_hash_map_helper *ht = data;
  705. kh_foreach(ht->htb, tok, val, {
  706. if (!cb(tok.begin, val->value, val->hits, cbdata)) {
  707. break;
  708. }
  709. if (reset_hits) {
  710. val->hits = 0;
  711. }
  712. });
  713. }
  714. struct rspamd_radix_map_helper *
  715. rspamd_map_helper_new_radix(struct rspamd_map *map)
  716. {
  717. struct rspamd_radix_map_helper *r;
  718. rspamd_mempool_t *pool;
  719. const char *name = "unnamed";
  720. if (map) {
  721. pool = rspamd_mempool_new(rspamd_mempool_suggest_size(),
  722. map->tag, 0);
  723. name = map->name;
  724. }
  725. else {
  726. pool = rspamd_mempool_new(rspamd_mempool_suggest_size(),
  727. NULL, 0);
  728. }
  729. r = rspamd_mempool_alloc0_type(pool, struct rspamd_radix_map_helper);
  730. r->trie = radix_create_compressed_with_pool(pool, name);
  731. r->htb = kh_init(rspamd_map_hash);
  732. r->pool = pool;
  733. r->map = map;
  734. rspamd_cryptobox_fast_hash_init(&r->hst, map_hash_seed);
  735. return r;
  736. }
  737. void rspamd_map_helper_destroy_radix(struct rspamd_radix_map_helper *r)
  738. {
  739. if (r == NULL || !r->pool) {
  740. return;
  741. }
  742. kh_destroy(rspamd_map_hash, r->htb);
  743. rspamd_mempool_t *pool = r->pool;
  744. memset(r, 0, sizeof(*r));
  745. rspamd_mempool_delete(pool);
  746. }
  747. static void
  748. rspamd_map_helper_traverse_radix(void *data,
  749. rspamd_map_traverse_cb cb,
  750. gpointer cbdata,
  751. gboolean reset_hits)
  752. {
  753. rspamd_ftok_t tok;
  754. struct rspamd_map_helper_value *val;
  755. struct rspamd_radix_map_helper *r = data;
  756. kh_foreach(r->htb, tok, val, {
  757. if (!cb(tok.begin, val->value, val->hits, cbdata)) {
  758. break;
  759. }
  760. if (reset_hits) {
  761. val->hits = 0;
  762. }
  763. });
  764. }
  765. struct rspamd_regexp_map_helper *
  766. rspamd_map_helper_new_regexp(struct rspamd_map *map,
  767. enum rspamd_regexp_map_flags flags)
  768. {
  769. struct rspamd_regexp_map_helper *re_map;
  770. rspamd_mempool_t *pool;
  771. pool = rspamd_mempool_new(rspamd_mempool_suggest_size(),
  772. map->tag, 0);
  773. re_map = rspamd_mempool_alloc0_type(pool, struct rspamd_regexp_map_helper);
  774. re_map->pool = pool;
  775. re_map->values = g_ptr_array_new();
  776. re_map->regexps = g_ptr_array_new();
  777. re_map->map = map;
  778. re_map->map_flags = flags;
  779. re_map->htb = kh_init(rspamd_map_hash);
  780. rspamd_cryptobox_hash_init(&re_map->hst, NULL, 0);
  781. return re_map;
  782. }
  783. void rspamd_map_helper_destroy_regexp(struct rspamd_regexp_map_helper *re_map)
  784. {
  785. rspamd_regexp_t *re;
  786. unsigned int i;
  787. if (!re_map || !re_map->regexps) {
  788. return;
  789. }
  790. #ifdef WITH_HYPERSCAN
  791. if (re_map->hs_scratch) {
  792. hs_free_scratch(re_map->hs_scratch);
  793. }
  794. if (re_map->hs_db) {
  795. rspamd_hyperscan_free(re_map->hs_db, false);
  796. }
  797. if (re_map->patterns) {
  798. for (i = 0; i < re_map->regexps->len; i++) {
  799. g_free(re_map->patterns[i]);
  800. }
  801. g_free(re_map->patterns);
  802. }
  803. if (re_map->flags) {
  804. g_free(re_map->flags);
  805. }
  806. if (re_map->ids) {
  807. g_free(re_map->ids);
  808. }
  809. #endif
  810. for (i = 0; i < re_map->regexps->len; i++) {
  811. re = g_ptr_array_index(re_map->regexps, i);
  812. rspamd_regexp_unref(re);
  813. }
  814. g_ptr_array_free(re_map->regexps, TRUE);
  815. g_ptr_array_free(re_map->values, TRUE);
  816. kh_destroy(rspamd_map_hash, re_map->htb);
  817. rspamd_mempool_t *pool = re_map->pool;
  818. memset(re_map, 0, sizeof(*re_map));
  819. rspamd_mempool_delete(pool);
  820. }
  821. char *
  822. rspamd_kv_list_read(
  823. char *chunk,
  824. int len,
  825. struct map_cb_data *data,
  826. gboolean final)
  827. {
  828. if (data->cur_data == NULL) {
  829. data->cur_data = rspamd_map_helper_new_hash(data->map);
  830. }
  831. return rspamd_parse_kv_list(
  832. chunk,
  833. len,
  834. data,
  835. rspamd_map_helper_insert_hash,
  836. "",
  837. final);
  838. }
  839. void rspamd_kv_list_fin(struct map_cb_data *data, void **target)
  840. {
  841. struct rspamd_map *map = data->map;
  842. struct rspamd_hash_map_helper *htb;
  843. if (data->errored) {
  844. /* Clean up the current data and do not touch prev data */
  845. if (data->cur_data) {
  846. msg_info_map("cleanup unfinished new data as error occurred for %s",
  847. map->name);
  848. htb = (struct rspamd_hash_map_helper *) data->cur_data;
  849. rspamd_map_helper_destroy_hash(htb);
  850. data->cur_data = NULL;
  851. }
  852. }
  853. else {
  854. if (data->cur_data) {
  855. htb = (struct rspamd_hash_map_helper *) data->cur_data;
  856. msg_info_map("read hash of %d elements from %s", kh_size(htb->htb),
  857. map->name);
  858. data->map->traverse_function = rspamd_map_helper_traverse_hash;
  859. data->map->nelts = kh_size(htb->htb);
  860. data->map->digest = rspamd_cryptobox_fast_hash_final(&htb->hst);
  861. }
  862. if (target) {
  863. *target = data->cur_data;
  864. }
  865. if (data->prev_data) {
  866. htb = (struct rspamd_hash_map_helper *) data->prev_data;
  867. rspamd_map_helper_destroy_hash(htb);
  868. }
  869. }
  870. }
  871. void rspamd_kv_list_dtor(struct map_cb_data *data)
  872. {
  873. struct rspamd_hash_map_helper *htb;
  874. if (data->cur_data) {
  875. htb = (struct rspamd_hash_map_helper *) data->cur_data;
  876. rspamd_map_helper_destroy_hash(htb);
  877. }
  878. }
  879. char *
  880. rspamd_radix_read(
  881. char *chunk,
  882. int len,
  883. struct map_cb_data *data,
  884. gboolean final)
  885. {
  886. struct rspamd_radix_map_helper *r;
  887. struct rspamd_map *map = data->map;
  888. if (data->cur_data == NULL) {
  889. r = rspamd_map_helper_new_radix(map);
  890. data->cur_data = r;
  891. }
  892. return rspamd_parse_kv_list(
  893. chunk,
  894. len,
  895. data,
  896. rspamd_map_helper_insert_radix,
  897. hash_fill,
  898. final);
  899. }
  900. void rspamd_radix_fin(struct map_cb_data *data, void **target)
  901. {
  902. struct rspamd_map *map = data->map;
  903. struct rspamd_radix_map_helper *r;
  904. if (data->errored) {
  905. /* Clean up the current data and do not touch prev data */
  906. if (data->cur_data) {
  907. msg_info_map("cleanup unfinished new data as error occurred for %s",
  908. map->name);
  909. r = (struct rspamd_radix_map_helper *) data->cur_data;
  910. rspamd_map_helper_destroy_radix(r);
  911. data->cur_data = NULL;
  912. }
  913. }
  914. else {
  915. if (data->cur_data) {
  916. r = (struct rspamd_radix_map_helper *) data->cur_data;
  917. msg_info_map("read radix trie of %z elements: %s",
  918. radix_get_size(r->trie), radix_get_info(r->trie));
  919. data->map->traverse_function = rspamd_map_helper_traverse_radix;
  920. data->map->nelts = kh_size(r->htb);
  921. data->map->digest = rspamd_cryptobox_fast_hash_final(&r->hst);
  922. }
  923. if (target) {
  924. *target = data->cur_data;
  925. }
  926. if (data->prev_data) {
  927. r = (struct rspamd_radix_map_helper *) data->prev_data;
  928. rspamd_map_helper_destroy_radix(r);
  929. }
  930. }
  931. }
  932. void rspamd_radix_dtor(struct map_cb_data *data)
  933. {
  934. struct rspamd_radix_map_helper *r;
  935. if (data->cur_data) {
  936. r = (struct rspamd_radix_map_helper *) data->cur_data;
  937. rspamd_map_helper_destroy_radix(r);
  938. }
  939. }
  940. #ifdef WITH_HYPERSCAN
  941. static gboolean
  942. rspamd_try_load_re_map_cache(struct rspamd_regexp_map_helper *re_map)
  943. {
  944. char fp[PATH_MAX];
  945. struct rspamd_map *map;
  946. map = re_map->map;
  947. if (!map->cfg->hs_cache_dir) {
  948. return FALSE;
  949. }
  950. rspamd_snprintf(fp, sizeof(fp), "%s/%*xs.hsmc",
  951. map->cfg->hs_cache_dir,
  952. (int) rspamd_cryptobox_HASHBYTES / 2, re_map->re_digest);
  953. re_map->hs_db = rspamd_hyperscan_maybe_load(fp, 0);
  954. return re_map->hs_db != NULL;
  955. }
  956. static gboolean
  957. rspamd_try_save_re_map_cache(struct rspamd_regexp_map_helper *re_map)
  958. {
  959. char fp[PATH_MAX], np[PATH_MAX];
  960. gsize len;
  961. int fd;
  962. char *bytes = NULL;
  963. struct rspamd_map *map;
  964. map = re_map->map;
  965. if (!map->cfg->hs_cache_dir) {
  966. return FALSE;
  967. }
  968. rspamd_snprintf(fp, sizeof(fp), "%s/hsmc-XXXXXXXXXXXXX",
  969. re_map->map->cfg->hs_cache_dir);
  970. if ((fd = g_mkstemp_full(fp, O_WRONLY | O_CREAT | O_EXCL, 00644)) != -1) {
  971. if (hs_serialize_database(rspamd_hyperscan_get_database(re_map->hs_db), &bytes, &len) == HS_SUCCESS) {
  972. if (write(fd, bytes, len) == -1) {
  973. msg_warn_map("cannot write hyperscan cache to %s: %s",
  974. fp, strerror(errno));
  975. unlink(fp);
  976. free(bytes);
  977. }
  978. else {
  979. free(bytes);
  980. fsync(fd);
  981. rspamd_snprintf(np, sizeof(np), "%s/%*xs.hsmc",
  982. re_map->map->cfg->hs_cache_dir,
  983. (int) rspamd_cryptobox_HASHBYTES / 2, re_map->re_digest);
  984. if (rename(fp, np) == -1) {
  985. msg_warn_map("cannot rename hyperscan cache from %s to %s: %s",
  986. fp, np, strerror(errno));
  987. unlink(fp);
  988. }
  989. else {
  990. msg_info_map("written cached hyperscan data for %s to %s (%Hz length)",
  991. map->name, np, len);
  992. rspamd_hyperscan_notice_known(np);
  993. }
  994. }
  995. }
  996. else {
  997. msg_warn_map("cannot serialize hyperscan cache to %s: %s",
  998. fp, strerror(errno));
  999. unlink(fp);
  1000. }
  1001. close(fd);
  1002. }
  1003. return FALSE;
  1004. }
  1005. #endif
  1006. static void
  1007. rspamd_re_map_finalize(struct rspamd_regexp_map_helper *re_map)
  1008. {
  1009. #ifdef WITH_HYPERSCAN
  1010. unsigned int i;
  1011. hs_platform_info_t plt;
  1012. hs_compile_error_t *err;
  1013. struct rspamd_map *map;
  1014. rspamd_regexp_t *re;
  1015. int pcre_flags;
  1016. map = re_map->map;
  1017. #if !defined(__aarch64__) && !defined(__powerpc64__)
  1018. if (!(map->cfg->libs_ctx->crypto_ctx->cpu_config & CPUID_SSSE3)) {
  1019. msg_info_map("disable hyperscan for map %s, ssse3 instructions are not supported by CPU",
  1020. map->name);
  1021. return;
  1022. }
  1023. #endif
  1024. if (hs_populate_platform(&plt) != HS_SUCCESS) {
  1025. msg_err_map("cannot populate hyperscan platform");
  1026. return;
  1027. }
  1028. re_map->patterns = g_new(char *, re_map->regexps->len);
  1029. re_map->flags = g_new(int, re_map->regexps->len);
  1030. re_map->ids = g_new(int, re_map->regexps->len);
  1031. for (i = 0; i < re_map->regexps->len; i++) {
  1032. const char *pat;
  1033. char *escaped;
  1034. int pat_flags;
  1035. re = g_ptr_array_index(re_map->regexps, i);
  1036. pcre_flags = rspamd_regexp_get_pcre_flags(re);
  1037. pat = rspamd_regexp_get_pattern(re);
  1038. pat_flags = rspamd_regexp_get_flags(re);
  1039. if (pat_flags & RSPAMD_REGEXP_FLAG_UTF) {
  1040. escaped = rspamd_str_regexp_escape(pat, strlen(pat), NULL,
  1041. RSPAMD_REGEXP_ESCAPE_RE | RSPAMD_REGEXP_ESCAPE_UTF);
  1042. re_map->flags[i] |= HS_FLAG_UTF8;
  1043. }
  1044. else {
  1045. escaped = rspamd_str_regexp_escape(pat, strlen(pat), NULL,
  1046. RSPAMD_REGEXP_ESCAPE_RE);
  1047. }
  1048. re_map->patterns[i] = escaped;
  1049. re_map->flags[i] = HS_FLAG_SINGLEMATCH;
  1050. #ifndef WITH_PCRE2
  1051. if (pcre_flags & PCRE_FLAG(UTF8)) {
  1052. re_map->flags[i] |= HS_FLAG_UTF8;
  1053. }
  1054. #else
  1055. if (pcre_flags & PCRE_FLAG(UTF)) {
  1056. re_map->flags[i] |= HS_FLAG_UTF8;
  1057. }
  1058. #endif
  1059. if (pcre_flags & PCRE_FLAG(CASELESS)) {
  1060. re_map->flags[i] |= HS_FLAG_CASELESS;
  1061. }
  1062. if (pcre_flags & PCRE_FLAG(MULTILINE)) {
  1063. re_map->flags[i] |= HS_FLAG_MULTILINE;
  1064. }
  1065. if (pcre_flags & PCRE_FLAG(DOTALL)) {
  1066. re_map->flags[i] |= HS_FLAG_DOTALL;
  1067. }
  1068. if (rspamd_regexp_get_maxhits(re) == 1) {
  1069. re_map->flags[i] |= HS_FLAG_SINGLEMATCH;
  1070. }
  1071. re_map->ids[i] = i;
  1072. }
  1073. if (re_map->regexps->len > 0 && re_map->patterns) {
  1074. if (!rspamd_try_load_re_map_cache(re_map)) {
  1075. double ts1 = rspamd_get_ticks(FALSE);
  1076. hs_database_t *hs_db = NULL;
  1077. if (hs_compile_multi((const char **) re_map->patterns,
  1078. re_map->flags,
  1079. re_map->ids,
  1080. re_map->regexps->len,
  1081. HS_MODE_BLOCK,
  1082. &plt,
  1083. &hs_db,
  1084. &err) != HS_SUCCESS) {
  1085. msg_err_map("cannot create tree of regexp when processing '%s': %s",
  1086. err->expression >= 0 ? re_map->patterns[err->expression] : "unknown regexp", err->message);
  1087. re_map->hs_db = NULL;
  1088. hs_free_compile_error(err);
  1089. return;
  1090. }
  1091. if (re_map->map->cfg->hs_cache_dir) {
  1092. char fpath[PATH_MAX];
  1093. rspamd_snprintf(fpath, sizeof(fpath), "%s/%*xs.hsmc",
  1094. re_map->map->cfg->hs_cache_dir,
  1095. (int) rspamd_cryptobox_HASHBYTES / 2, re_map->re_digest);
  1096. re_map->hs_db = rspamd_hyperscan_from_raw_db(hs_db, fpath);
  1097. }
  1098. else {
  1099. re_map->hs_db = rspamd_hyperscan_from_raw_db(hs_db, NULL);
  1100. }
  1101. ts1 = (rspamd_get_ticks(FALSE) - ts1) * 1000.0;
  1102. msg_info_map("hyperscan compiled %d regular expressions from %s in %.1f ms",
  1103. re_map->regexps->len, re_map->map->name, ts1);
  1104. rspamd_try_save_re_map_cache(re_map);
  1105. }
  1106. else {
  1107. msg_info_map("hyperscan read %d cached regular expressions from %s",
  1108. re_map->regexps->len, re_map->map->name);
  1109. }
  1110. if (hs_alloc_scratch(rspamd_hyperscan_get_database(re_map->hs_db), &re_map->hs_scratch) != HS_SUCCESS) {
  1111. msg_err_map("cannot allocate scratch space for hyperscan");
  1112. rspamd_hyperscan_free(re_map->hs_db, true);
  1113. re_map->hs_db = NULL;
  1114. }
  1115. }
  1116. else {
  1117. msg_err_map("regexp map is empty");
  1118. }
  1119. #endif
  1120. }
  1121. char *
  1122. rspamd_regexp_list_read_single(
  1123. char *chunk,
  1124. int len,
  1125. struct map_cb_data *data,
  1126. gboolean final)
  1127. {
  1128. struct rspamd_regexp_map_helper *re_map;
  1129. if (data->cur_data == NULL) {
  1130. re_map = rspamd_map_helper_new_regexp(data->map, 0);
  1131. data->cur_data = re_map;
  1132. }
  1133. return rspamd_parse_kv_list(
  1134. chunk,
  1135. len,
  1136. data,
  1137. rspamd_map_helper_insert_re,
  1138. hash_fill,
  1139. final);
  1140. }
  1141. char *
  1142. rspamd_glob_list_read_single(
  1143. char *chunk,
  1144. int len,
  1145. struct map_cb_data *data,
  1146. gboolean final)
  1147. {
  1148. struct rspamd_regexp_map_helper *re_map;
  1149. if (data->cur_data == NULL) {
  1150. re_map = rspamd_map_helper_new_regexp(data->map, RSPAMD_REGEXP_MAP_FLAG_GLOB);
  1151. data->cur_data = re_map;
  1152. }
  1153. return rspamd_parse_kv_list(
  1154. chunk,
  1155. len,
  1156. data,
  1157. rspamd_map_helper_insert_re,
  1158. hash_fill,
  1159. final);
  1160. }
  1161. char *
  1162. rspamd_regexp_list_read_multiple(
  1163. char *chunk,
  1164. int len,
  1165. struct map_cb_data *data,
  1166. gboolean final)
  1167. {
  1168. struct rspamd_regexp_map_helper *re_map;
  1169. if (data->cur_data == NULL) {
  1170. re_map = rspamd_map_helper_new_regexp(data->map,
  1171. RSPAMD_REGEXP_MAP_FLAG_MULTIPLE);
  1172. data->cur_data = re_map;
  1173. }
  1174. return rspamd_parse_kv_list(
  1175. chunk,
  1176. len,
  1177. data,
  1178. rspamd_map_helper_insert_re,
  1179. hash_fill,
  1180. final);
  1181. }
  1182. char *
  1183. rspamd_glob_list_read_multiple(
  1184. char *chunk,
  1185. int len,
  1186. struct map_cb_data *data,
  1187. gboolean final)
  1188. {
  1189. struct rspamd_regexp_map_helper *re_map;
  1190. if (data->cur_data == NULL) {
  1191. re_map = rspamd_map_helper_new_regexp(data->map,
  1192. RSPAMD_REGEXP_MAP_FLAG_GLOB | RSPAMD_REGEXP_MAP_FLAG_MULTIPLE);
  1193. data->cur_data = re_map;
  1194. }
  1195. return rspamd_parse_kv_list(
  1196. chunk,
  1197. len,
  1198. data,
  1199. rspamd_map_helper_insert_re,
  1200. hash_fill,
  1201. final);
  1202. }
  1203. void rspamd_regexp_list_fin(struct map_cb_data *data, void **target)
  1204. {
  1205. struct rspamd_regexp_map_helper *re_map = NULL, *old_re_map;
  1206. struct rspamd_map *map = data->map;
  1207. if (data->errored) {
  1208. /* Clean up the current data and do not touch prev data */
  1209. if (data->cur_data) {
  1210. msg_info_map("cleanup unfinished new data as error occurred for %s",
  1211. map->name);
  1212. re_map = (struct rspamd_regexp_map_helper *) data->cur_data;
  1213. rspamd_map_helper_destroy_regexp(re_map);
  1214. data->cur_data = NULL;
  1215. }
  1216. }
  1217. else {
  1218. if (data->cur_data) {
  1219. re_map = data->cur_data;
  1220. rspamd_cryptobox_hash_final(&re_map->hst, re_map->re_digest);
  1221. memcpy(&data->map->digest, re_map->re_digest, sizeof(data->map->digest));
  1222. rspamd_re_map_finalize(re_map);
  1223. msg_info_map("read regexp list of %ud elements",
  1224. re_map->regexps->len);
  1225. data->map->traverse_function = rspamd_map_helper_traverse_regexp;
  1226. data->map->nelts = kh_size(re_map->htb);
  1227. }
  1228. if (target) {
  1229. *target = data->cur_data;
  1230. }
  1231. if (data->prev_data) {
  1232. old_re_map = data->prev_data;
  1233. rspamd_map_helper_destroy_regexp(old_re_map);
  1234. }
  1235. }
  1236. }
  1237. void rspamd_regexp_list_dtor(struct map_cb_data *data)
  1238. {
  1239. if (data->cur_data) {
  1240. rspamd_map_helper_destroy_regexp(data->cur_data);
  1241. }
  1242. }
  1243. #ifdef WITH_HYPERSCAN
  1244. static int
  1245. rspamd_match_hs_single_handler(unsigned int id, unsigned long long from,
  1246. unsigned long long to,
  1247. unsigned int flags, void *context)
  1248. {
  1249. unsigned int *i = context;
  1250. /* Always return non-zero as we need a single match here */
  1251. *i = id;
  1252. return 1;
  1253. }
  1254. #endif
  1255. gconstpointer
  1256. rspamd_match_regexp_map_single(struct rspamd_regexp_map_helper *map,
  1257. const char *in, gsize len)
  1258. {
  1259. unsigned int i;
  1260. rspamd_regexp_t *re;
  1261. int res = 0;
  1262. gpointer ret = NULL;
  1263. struct rspamd_map_helper_value *val;
  1264. gboolean validated = FALSE;
  1265. g_assert(in != NULL);
  1266. if (map == NULL || len == 0 || map->regexps == NULL) {
  1267. return NULL;
  1268. }
  1269. if (map->map_flags & RSPAMD_REGEXP_MAP_FLAG_UTF) {
  1270. if (rspamd_fast_utf8_validate(in, len) == 0) {
  1271. validated = TRUE;
  1272. }
  1273. }
  1274. else {
  1275. validated = TRUE;
  1276. }
  1277. #ifdef WITH_HYPERSCAN
  1278. if (map->hs_db && map->hs_scratch) {
  1279. if (validated) {
  1280. res = hs_scan(rspamd_hyperscan_get_database(map->hs_db), in, len, 0,
  1281. map->hs_scratch,
  1282. rspamd_match_hs_single_handler, (void *) &i);
  1283. if (res == HS_SCAN_TERMINATED) {
  1284. res = 1;
  1285. val = g_ptr_array_index(map->values, i);
  1286. ret = val->value;
  1287. val->hits++;
  1288. }
  1289. return ret;
  1290. }
  1291. }
  1292. #endif
  1293. if (!res) {
  1294. /* PCRE version */
  1295. for (i = 0; i < map->regexps->len; i++) {
  1296. re = g_ptr_array_index(map->regexps, i);
  1297. if (rspamd_regexp_search(re, in, len, NULL, NULL, !validated, NULL)) {
  1298. val = g_ptr_array_index(map->values, i);
  1299. ret = val->value;
  1300. val->hits++;
  1301. break;
  1302. }
  1303. }
  1304. }
  1305. return ret;
  1306. }
  1307. #ifdef WITH_HYPERSCAN
  1308. struct rspamd_multiple_cbdata {
  1309. GPtrArray *ar;
  1310. struct rspamd_regexp_map_helper *map;
  1311. };
  1312. static int
  1313. rspamd_match_hs_multiple_handler(unsigned int id, unsigned long long from,
  1314. unsigned long long to,
  1315. unsigned int flags, void *context)
  1316. {
  1317. struct rspamd_multiple_cbdata *cbd = context;
  1318. struct rspamd_map_helper_value *val;
  1319. if (id < cbd->map->values->len) {
  1320. val = g_ptr_array_index(cbd->map->values, id);
  1321. val->hits++;
  1322. g_ptr_array_add(cbd->ar, val->value);
  1323. }
  1324. /* Always return zero as we need all matches here */
  1325. return 0;
  1326. }
  1327. #endif
  1328. GPtrArray *
  1329. rspamd_match_regexp_map_all(struct rspamd_regexp_map_helper *map,
  1330. const char *in, gsize len)
  1331. {
  1332. unsigned int i;
  1333. rspamd_regexp_t *re;
  1334. GPtrArray *ret;
  1335. int res = 0;
  1336. gboolean validated = FALSE;
  1337. struct rspamd_map_helper_value *val;
  1338. if (map == NULL || map->regexps == NULL || len == 0) {
  1339. return NULL;
  1340. }
  1341. g_assert(in != NULL);
  1342. if (map->map_flags & RSPAMD_REGEXP_MAP_FLAG_UTF) {
  1343. if (rspamd_fast_utf8_validate(in, len) == 0) {
  1344. validated = TRUE;
  1345. }
  1346. }
  1347. else {
  1348. validated = TRUE;
  1349. }
  1350. ret = g_ptr_array_new();
  1351. #ifdef WITH_HYPERSCAN
  1352. if (map->hs_db && map->hs_scratch) {
  1353. if (validated) {
  1354. struct rspamd_multiple_cbdata cbd;
  1355. cbd.ar = ret;
  1356. cbd.map = map;
  1357. if (hs_scan(rspamd_hyperscan_get_database(map->hs_db), in, len,
  1358. 0, map->hs_scratch,
  1359. rspamd_match_hs_multiple_handler, &cbd) == HS_SUCCESS) {
  1360. res = 1;
  1361. }
  1362. }
  1363. }
  1364. #endif
  1365. if (!res) {
  1366. /* PCRE version */
  1367. for (i = 0; i < map->regexps->len; i++) {
  1368. re = g_ptr_array_index(map->regexps, i);
  1369. if (rspamd_regexp_search(re, in, len, NULL, NULL,
  1370. !validated, NULL)) {
  1371. val = g_ptr_array_index(map->values, i);
  1372. val->hits++;
  1373. g_ptr_array_add(ret, val->value);
  1374. }
  1375. }
  1376. }
  1377. if (ret->len > 0) {
  1378. return ret;
  1379. }
  1380. g_ptr_array_free(ret, TRUE);
  1381. return NULL;
  1382. }
  1383. gconstpointer
  1384. rspamd_match_hash_map(struct rspamd_hash_map_helper *map, const char *in,
  1385. gsize len)
  1386. {
  1387. khiter_t k;
  1388. struct rspamd_map_helper_value *val;
  1389. rspamd_ftok_t tok;
  1390. if (map == NULL || map->htb == NULL) {
  1391. return NULL;
  1392. }
  1393. tok.begin = in;
  1394. tok.len = len;
  1395. k = kh_get(rspamd_map_hash, map->htb, tok);
  1396. if (k != kh_end(map->htb)) {
  1397. val = kh_value(map->htb, k);
  1398. val->hits++;
  1399. return val->value;
  1400. }
  1401. return NULL;
  1402. }
  1403. gconstpointer
  1404. rspamd_match_radix_map(struct rspamd_radix_map_helper *map,
  1405. const unsigned char *in, gsize inlen)
  1406. {
  1407. struct rspamd_map_helper_value *val;
  1408. if (map == NULL || map->trie == NULL) {
  1409. return NULL;
  1410. }
  1411. val = (struct rspamd_map_helper_value *) radix_find_compressed(map->trie,
  1412. in, inlen);
  1413. if (val != (gconstpointer) RADIX_NO_VALUE) {
  1414. val->hits++;
  1415. return val->value;
  1416. }
  1417. return NULL;
  1418. }
  1419. gconstpointer
  1420. rspamd_match_radix_map_addr(struct rspamd_radix_map_helper *map,
  1421. const rspamd_inet_addr_t *addr)
  1422. {
  1423. struct rspamd_map_helper_value *val;
  1424. if (map == NULL || map->trie == NULL) {
  1425. return NULL;
  1426. }
  1427. val = (struct rspamd_map_helper_value *) radix_find_compressed_addr(map->trie, addr);
  1428. if (val != (gconstpointer) RADIX_NO_VALUE) {
  1429. val->hits++;
  1430. return val->value;
  1431. }
  1432. return NULL;
  1433. }
  1434. /*
  1435. * CBD stuff
  1436. */
  1437. struct rspamd_cdb_map_helper *
  1438. rspamd_map_helper_new_cdb(struct rspamd_map *map)
  1439. {
  1440. struct rspamd_cdb_map_helper *n;
  1441. n = g_malloc0(sizeof(*n));
  1442. n->cdbs = (GQueue) G_QUEUE_INIT;
  1443. n->map = map;
  1444. rspamd_cryptobox_fast_hash_init(&n->hst, map_hash_seed);
  1445. return n;
  1446. }
  1447. void rspamd_map_helper_destroy_cdb(struct rspamd_cdb_map_helper *c)
  1448. {
  1449. if (c == NULL) {
  1450. return;
  1451. }
  1452. GList *cur = c->cdbs.head;
  1453. while (cur) {
  1454. struct cdb *cdb = (struct cdb *) cur->data;
  1455. cdb_free(cdb);
  1456. g_free(cdb->filename);
  1457. close(cdb->cdb_fd);
  1458. g_free(cdb);
  1459. cur = g_list_next(cur);
  1460. }
  1461. g_queue_clear(&c->cdbs);
  1462. g_free(c);
  1463. }
  1464. char *
  1465. rspamd_cdb_list_read(char *chunk,
  1466. int len,
  1467. struct map_cb_data *data,
  1468. gboolean final)
  1469. {
  1470. struct rspamd_cdb_map_helper *cdb_data;
  1471. struct cdb *found = NULL;
  1472. struct rspamd_map *map = data->map;
  1473. g_assert(map->no_file_read);
  1474. if (data->cur_data == NULL) {
  1475. cdb_data = rspamd_map_helper_new_cdb(data->map);
  1476. data->cur_data = cdb_data;
  1477. }
  1478. else {
  1479. cdb_data = (struct rspamd_cdb_map_helper *) data->cur_data;
  1480. }
  1481. GList *cur = cdb_data->cdbs.head;
  1482. while (cur) {
  1483. struct cdb *elt = (struct cdb *) cur->data;
  1484. if (strcmp(elt->filename, chunk) == 0) {
  1485. found = elt;
  1486. break;
  1487. }
  1488. cur = g_list_next(cur);
  1489. }
  1490. if (found == NULL) {
  1491. /* New cdb */
  1492. int fd;
  1493. struct cdb *cdb;
  1494. fd = rspamd_file_xopen(chunk, O_RDONLY, 0, TRUE);
  1495. if (fd == -1) {
  1496. msg_err_map("cannot open cdb map from %s: %s", chunk, strerror(errno));
  1497. return NULL;
  1498. }
  1499. cdb = g_malloc0(sizeof(struct cdb));
  1500. if (cdb_init(cdb, fd) == -1) {
  1501. g_free(cdb);
  1502. msg_err_map("cannot init cdb map from %s: %s", chunk, strerror(errno));
  1503. return NULL;
  1504. }
  1505. cdb->filename = g_strdup(chunk);
  1506. g_queue_push_tail(&cdb_data->cdbs, cdb);
  1507. cdb_data->total_size += cdb->cdb_fsize;
  1508. rspamd_cryptobox_fast_hash_update(&cdb_data->hst, chunk, len);
  1509. }
  1510. return chunk + len;
  1511. }
  1512. void rspamd_cdb_list_fin(struct map_cb_data *data, void **target)
  1513. {
  1514. struct rspamd_map *map = data->map;
  1515. struct rspamd_cdb_map_helper *cdb_data;
  1516. if (data->errored) {
  1517. /* Clean up the current data and do not touch prev data */
  1518. if (data->cur_data) {
  1519. msg_info_map("cleanup unfinished new data as error occurred for %s",
  1520. map->name);
  1521. cdb_data = (struct rspamd_cdb_map_helper *) data->cur_data;
  1522. rspamd_map_helper_destroy_cdb(cdb_data);
  1523. data->cur_data = NULL;
  1524. }
  1525. }
  1526. else {
  1527. if (data->cur_data) {
  1528. cdb_data = (struct rspamd_cdb_map_helper *) data->cur_data;
  1529. msg_info_map("read cdb of %Hz size", cdb_data->total_size);
  1530. data->map->traverse_function = NULL;
  1531. data->map->nelts = 0;
  1532. data->map->digest = rspamd_cryptobox_fast_hash_final(&cdb_data->hst);
  1533. }
  1534. if (target) {
  1535. *target = data->cur_data;
  1536. }
  1537. if (data->prev_data) {
  1538. cdb_data = (struct rspamd_cdb_map_helper *) data->prev_data;
  1539. rspamd_map_helper_destroy_cdb(cdb_data);
  1540. }
  1541. }
  1542. }
  1543. void rspamd_cdb_list_dtor(struct map_cb_data *data)
  1544. {
  1545. if (data->cur_data) {
  1546. rspamd_map_helper_destroy_cdb(data->cur_data);
  1547. }
  1548. }
  1549. gconstpointer
  1550. rspamd_match_cdb_map(struct rspamd_cdb_map_helper *map,
  1551. const char *in, gsize inlen)
  1552. {
  1553. if (map == NULL || map->cdbs.head == NULL) {
  1554. return NULL;
  1555. }
  1556. GList *cur = map->cdbs.head;
  1557. static rspamd_ftok_t found;
  1558. while (cur) {
  1559. struct cdb *cdb = (struct cdb *) cur->data;
  1560. if (cdb_find(cdb, in, inlen) > 0) {
  1561. /* Extract and push value to lua as string */
  1562. unsigned vlen;
  1563. gconstpointer vpos;
  1564. vpos = cdb->cdb_mem + cdb_datapos(cdb);
  1565. vlen = cdb_datalen(cdb);
  1566. found.len = vlen;
  1567. found.begin = vpos;
  1568. return &found; /* Do not reuse! */
  1569. }
  1570. cur = g_list_next(cur);
  1571. }
  1572. return NULL;
  1573. }