regex.c 35 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086
  1. /*
  2. Search text engine.
  3. Regex search
  4. Copyright (C) 2009-2023
  5. Free Software Foundation, Inc.
  6. Written by:
  7. Slava Zanko <slavazanko@gmail.com>, 2009, 2010, 2011, 2013
  8. Vitaliy Filippov <vitalif@yourcmc.ru>, 2011
  9. Andrew Borodin <aborodin@vmail.ru>, 2013-2015
  10. This file is part of the Midnight Commander.
  11. The Midnight Commander is free software: you can redistribute it
  12. and/or modify it under the terms of the GNU General Public License as
  13. published by the Free Software Foundation, either version 3 of the License,
  14. or (at your option) any later version.
  15. The Midnight Commander is distributed in the hope that it will be useful,
  16. but WITHOUT ANY WARRANTY; without even the implied warranty of
  17. MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  18. GNU General Public License for more details.
  19. You should have received a copy of the GNU General Public License
  20. along with this program. If not, see <http://www.gnu.org/licenses/>.
  21. */
  22. #include <config.h>
  23. #include <stdlib.h>
  24. #include "lib/global.h"
  25. #include "lib/strutil.h"
  26. #include "lib/search.h"
  27. #include "lib/strescape.h"
  28. #include "lib/util.h" /* MC_PTR_FREE */
  29. #include "internal.h"
  30. /*** global variables ****************************************************************************/
  31. /*** file scope macro definitions ****************************************************************/
  32. #define REPLACE_PREPARE_T_NOTHING_SPECIAL -1
  33. #define REPLACE_PREPARE_T_REPLACE_FLAG -2
  34. #define REPLACE_PREPARE_T_ESCAPE_SEQ -3
  35. /*** file scope type declarations ****************************************************************/
  36. typedef enum
  37. {
  38. REPLACE_T_NO_TRANSFORM = 0,
  39. REPLACE_T_UPP_TRANSFORM_CHAR = 1,
  40. REPLACE_T_LOW_TRANSFORM_CHAR = 2,
  41. REPLACE_T_UPP_TRANSFORM = 4,
  42. REPLACE_T_LOW_TRANSFORM = 8
  43. } replace_transform_type_t;
  44. /*** file scope variables ************************************************************************/
  45. /*** file scope functions ************************************************************************/
  46. static gboolean
  47. mc_search__regex_str_append_if_special (GString * copy_to, const GString * regex_str,
  48. gsize * offset)
  49. {
  50. const char *special_chars[] = {
  51. "\\s", "\\S",
  52. "\\d", "\\D",
  53. "\\b", "\\B",
  54. "\\w", "\\W",
  55. "\\t", "\\n",
  56. "\\r", "\\f",
  57. "\\a", "\\e",
  58. "\\x", "\\X",
  59. "\\c", "\\C",
  60. "\\l", "\\L",
  61. "\\u", "\\U",
  62. "\\E", "\\Q",
  63. NULL
  64. };
  65. char *tmp_regex_str;
  66. const char **spec_chr;
  67. tmp_regex_str = &(regex_str->str[*offset]);
  68. for (spec_chr = special_chars; *spec_chr != NULL; spec_chr++)
  69. {
  70. gsize spec_chr_len;
  71. spec_chr_len = strlen (*spec_chr);
  72. if (strncmp (tmp_regex_str, *spec_chr, spec_chr_len) == 0
  73. && !strutils_is_char_escaped (regex_str->str, tmp_regex_str))
  74. {
  75. if (strncmp ("\\x", *spec_chr, spec_chr_len) == 0)
  76. {
  77. if (tmp_regex_str[spec_chr_len] != '{')
  78. spec_chr_len += 2;
  79. else
  80. {
  81. while ((spec_chr_len < regex_str->len - *offset)
  82. && tmp_regex_str[spec_chr_len] != '}')
  83. spec_chr_len++;
  84. if (tmp_regex_str[spec_chr_len] == '}')
  85. spec_chr_len++;
  86. }
  87. }
  88. g_string_append_len (copy_to, tmp_regex_str, spec_chr_len);
  89. *offset += spec_chr_len;
  90. return TRUE;
  91. }
  92. }
  93. return FALSE;
  94. }
  95. /* --------------------------------------------------------------------------------------------- */
  96. static void
  97. mc_search__cond_struct_new_regex_hex_add (const char *charset, GString * str_to,
  98. const GString * one_char)
  99. {
  100. GString *upp, *low;
  101. gsize loop;
  102. upp = mc_search__toupper_case_str (charset, one_char);
  103. low = mc_search__tolower_case_str (charset, one_char);
  104. for (loop = 0; loop < upp->len; loop++)
  105. {
  106. gchar tmp_str[10 + 1]; /* longest content is "[\\x%02X\\x%02X]" */
  107. gint tmp_len;
  108. if (loop >= low->len || upp->str[loop] == low->str[loop])
  109. tmp_len =
  110. g_snprintf (tmp_str, sizeof (tmp_str), "\\x%02X", (unsigned char) upp->str[loop]);
  111. else
  112. tmp_len =
  113. g_snprintf (tmp_str, sizeof (tmp_str), "[\\x%02X\\x%02X]",
  114. (unsigned char) upp->str[loop], (unsigned char) low->str[loop]);
  115. g_string_append_len (str_to, tmp_str, tmp_len);
  116. }
  117. g_string_free (upp, TRUE);
  118. g_string_free (low, TRUE);
  119. }
  120. /* --------------------------------------------------------------------------------------------- */
  121. static void
  122. mc_search__cond_struct_new_regex_accum_append (const char *charset, GString * str_to,
  123. GString * str_from)
  124. {
  125. GString *recoded_part;
  126. gsize loop = 0;
  127. recoded_part = g_string_sized_new (32);
  128. while (loop < str_from->len)
  129. {
  130. GString *one_char;
  131. gboolean just_letters;
  132. one_char =
  133. mc_search__get_one_symbol (charset, str_from->str + loop,
  134. MIN (str_from->len - loop, 6), &just_letters);
  135. if (one_char->len == 0)
  136. loop++;
  137. else
  138. {
  139. loop += one_char->len;
  140. if (just_letters)
  141. mc_search__cond_struct_new_regex_hex_add (charset, recoded_part, one_char);
  142. else
  143. g_string_append_len (recoded_part, one_char->str, one_char->len);
  144. }
  145. g_string_free (one_char, TRUE);
  146. }
  147. g_string_append_len (str_to, recoded_part->str, recoded_part->len);
  148. g_string_free (recoded_part, TRUE);
  149. g_string_set_size (str_from, 0);
  150. }
  151. /* --------------------------------------------------------------------------------------------- */
  152. /**
  153. * Creates a case-insensitive version of a regex pattern.
  154. *
  155. * For example (assuming ASCII charset): given "\\bHello!\\xAB", returns
  156. * "\\b[Hh][Ee][Ll][Ll][Oo]!\\xAB" (this example is for easier reading; in
  157. * reality hex codes are used instead of letters).
  158. *
  159. * This function knows not to ruin special regex symbols.
  160. *
  161. * This function is used when working with non-UTF-8 charsets: GLib's
  162. * regex engine doesn't understand such charsets and therefore can't do
  163. * this job itself.
  164. */
  165. static GString *
  166. mc_search__cond_struct_new_regex_ci_str (const char *charset, const GString * astr)
  167. {
  168. GString *accumulator, *spec_char, *ret_str;
  169. gsize loop;
  170. ret_str = g_string_sized_new (64);
  171. accumulator = g_string_sized_new (64);
  172. spec_char = g_string_sized_new (64);
  173. loop = 0;
  174. while (loop < astr->len)
  175. {
  176. if (mc_search__regex_str_append_if_special (spec_char, astr, &loop))
  177. {
  178. mc_search__cond_struct_new_regex_accum_append (charset, ret_str, accumulator);
  179. g_string_append_len (ret_str, spec_char->str, spec_char->len);
  180. g_string_set_size (spec_char, 0);
  181. continue;
  182. }
  183. if (astr->str[loop] == '[' && !strutils_is_char_escaped (astr->str, &(astr->str[loop])))
  184. {
  185. mc_search__cond_struct_new_regex_accum_append (charset, ret_str, accumulator);
  186. while (loop < astr->len && !(astr->str[loop] == ']'
  187. && !strutils_is_char_escaped (astr->str,
  188. &(astr->str[loop]))))
  189. {
  190. g_string_append_c (ret_str, astr->str[loop]);
  191. loop++;
  192. }
  193. g_string_append_c (ret_str, astr->str[loop]);
  194. loop++;
  195. continue;
  196. }
  197. /*
  198. TODO: handle [ and ]
  199. */
  200. g_string_append_c (accumulator, astr->str[loop]);
  201. loop++;
  202. }
  203. mc_search__cond_struct_new_regex_accum_append (charset, ret_str, accumulator);
  204. g_string_free (accumulator, TRUE);
  205. g_string_free (spec_char, TRUE);
  206. return ret_str;
  207. }
  208. /* --------------------------------------------------------------------------------------------- */
  209. #ifdef SEARCH_TYPE_GLIB
  210. /* A thin wrapper above g_regex_match_full that makes sure the string passed
  211. * to it is valid UTF-8 (unless G_REGEX_RAW compile flag was set), as it is a
  212. * requirement by glib and it might crash otherwise. See: mc ticket 3449.
  213. * Be careful: there might be embedded NULs in the strings. */
  214. static gboolean
  215. mc_search__g_regex_match_full_safe (const GRegex * regex,
  216. const gchar * string,
  217. gssize string_len,
  218. gint start_position,
  219. GRegexMatchFlags match_options,
  220. GMatchInfo ** match_info, GError ** error)
  221. {
  222. char *string_safe, *p, *end;
  223. gboolean ret;
  224. if (string_len < 0)
  225. string_len = strlen (string);
  226. if ((g_regex_get_compile_flags (regex) & G_REGEX_RAW)
  227. || g_utf8_validate (string, string_len, NULL))
  228. {
  229. return g_regex_match_full (regex, string, string_len, start_position, match_options,
  230. match_info, error);
  231. }
  232. /* Correctly handle embedded NULs while copying */
  233. p = string_safe = g_malloc (string_len + 1);
  234. memcpy (string_safe, string, string_len);
  235. string_safe[string_len] = '\0';
  236. end = p + string_len;
  237. while (p < end)
  238. {
  239. gunichar c = g_utf8_get_char_validated (p, -1);
  240. if (c != (gunichar) (-1) && c != (gunichar) (-2))
  241. {
  242. p = g_utf8_next_char (p);
  243. }
  244. else
  245. {
  246. /* U+FFFD would be the proper choice, but then we'd have to
  247. maintain mapping between old and new offsets.
  248. So rather do a byte by byte replacement. */
  249. *p++ = '\0';
  250. }
  251. }
  252. ret =
  253. g_regex_match_full (regex, string_safe, string_len, start_position, match_options,
  254. match_info, error);
  255. g_free (string_safe);
  256. return ret;
  257. }
  258. #endif /* SEARCH_TYPE_GLIB */
  259. /* --------------------------------------------------------------------------------------------- */
  260. static mc_search__found_cond_t
  261. mc_search__regex_found_cond_one (mc_search_t * lc_mc_search, mc_search_regex_t * regex,
  262. GString * search_str)
  263. {
  264. #ifdef SEARCH_TYPE_GLIB
  265. GError *mcerror = NULL;
  266. if (!mc_search__g_regex_match_full_safe
  267. (regex, search_str->str, search_str->len, 0, G_REGEX_MATCH_NEWLINE_ANY,
  268. &lc_mc_search->regex_match_info, &mcerror))
  269. {
  270. g_match_info_free (lc_mc_search->regex_match_info);
  271. lc_mc_search->regex_match_info = NULL;
  272. if (mcerror != NULL)
  273. {
  274. lc_mc_search->error = MC_SEARCH_E_REGEX;
  275. g_free (lc_mc_search->error_str);
  276. lc_mc_search->error_str =
  277. str_conv_gerror_message (mcerror, _("Regular expression error"));
  278. g_error_free (mcerror);
  279. return COND__FOUND_ERROR;
  280. }
  281. return COND__NOT_FOUND;
  282. }
  283. lc_mc_search->num_results = g_match_info_get_match_count (lc_mc_search->regex_match_info);
  284. #else /* SEARCH_TYPE_GLIB */
  285. lc_mc_search->num_results = pcre_exec (regex, lc_mc_search->regex_match_info,
  286. search_str->str, search_str->len, 0, 0,
  287. lc_mc_search->iovector, MC_SEARCH__NUM_REPLACE_ARGS);
  288. if (lc_mc_search->num_results < 0)
  289. {
  290. return COND__NOT_FOUND;
  291. }
  292. #endif /* SEARCH_TYPE_GLIB */
  293. return COND__FOUND_OK;
  294. }
  295. /* --------------------------------------------------------------------------------------------- */
  296. static mc_search__found_cond_t
  297. mc_search__regex_found_cond (mc_search_t * lc_mc_search, GString * search_str)
  298. {
  299. gsize loop1;
  300. for (loop1 = 0; loop1 < lc_mc_search->prepared.conditions->len; loop1++)
  301. {
  302. mc_search_cond_t *mc_search_cond;
  303. mc_search__found_cond_t ret;
  304. mc_search_cond =
  305. (mc_search_cond_t *) g_ptr_array_index (lc_mc_search->prepared.conditions, loop1);
  306. if (!mc_search_cond->regex_handle)
  307. continue;
  308. ret =
  309. mc_search__regex_found_cond_one (lc_mc_search, mc_search_cond->regex_handle,
  310. search_str);
  311. if (ret != COND__NOT_FOUND)
  312. return ret;
  313. }
  314. return COND__NOT_ALL_FOUND;
  315. }
  316. /* --------------------------------------------------------------------------------------------- */
  317. static int
  318. mc_search_regex__get_max_num_of_replace_tokens (const gchar * str, gsize len)
  319. {
  320. int max_token = 0;
  321. gsize loop;
  322. for (loop = 0; loop < len - 1; loop++)
  323. {
  324. if (str[loop] == '\\' && g_ascii_isdigit (str[loop + 1]))
  325. {
  326. if (strutils_is_char_escaped (str, &str[loop]))
  327. continue;
  328. if (max_token < str[loop + 1] - '0')
  329. max_token = str[loop + 1] - '0';
  330. continue;
  331. }
  332. if (str[loop] == '$' && str[loop + 1] == '{')
  333. {
  334. gsize tmp_len;
  335. if (strutils_is_char_escaped (str, &str[loop]))
  336. continue;
  337. for (tmp_len = 0;
  338. loop + tmp_len + 2 < len && (str[loop + 2 + tmp_len] & (char) 0xf0) == 0x30;
  339. tmp_len++);
  340. if (str[loop + 2 + tmp_len] == '}')
  341. {
  342. int tmp_token;
  343. char *tmp_str;
  344. tmp_str = g_strndup (&str[loop + 2], tmp_len);
  345. tmp_token = atoi (tmp_str);
  346. if (max_token < tmp_token)
  347. max_token = tmp_token;
  348. g_free (tmp_str);
  349. }
  350. }
  351. }
  352. return max_token;
  353. }
  354. /* --------------------------------------------------------------------------------------------- */
  355. static char *
  356. mc_search_regex__get_token_by_num (const mc_search_t * lc_mc_search, gsize lc_index)
  357. {
  358. int fnd_start = 0, fnd_end = 0;
  359. #ifdef SEARCH_TYPE_GLIB
  360. g_match_info_fetch_pos (lc_mc_search->regex_match_info, lc_index, &fnd_start, &fnd_end);
  361. #else /* SEARCH_TYPE_GLIB */
  362. fnd_start = lc_mc_search->iovector[lc_index * 2 + 0];
  363. fnd_end = lc_mc_search->iovector[lc_index * 2 + 1];
  364. #endif /* SEARCH_TYPE_GLIB */
  365. if (fnd_end == fnd_start)
  366. return g_strdup ("");
  367. return g_strndup (lc_mc_search->regex_buffer->str + fnd_start, fnd_end - fnd_start);
  368. }
  369. /* --------------------------------------------------------------------------------------------- */
  370. static gboolean
  371. mc_search_regex__replace_handle_esc_seq (const GString * replace_str, const gsize current_pos,
  372. gsize * skip_len, int *ret)
  373. {
  374. char *curr_str = &(replace_str->str[current_pos]);
  375. char c = curr_str[1];
  376. if (replace_str->len > current_pos + 2)
  377. {
  378. if (c == '{')
  379. {
  380. for (*skip_len = 2; /* \{ */
  381. current_pos + *skip_len < replace_str->len && curr_str[*skip_len] >= '0'
  382. && curr_str[*skip_len] <= '7'; (*skip_len)++)
  383. ;
  384. if (current_pos + *skip_len < replace_str->len && curr_str[*skip_len] == '}')
  385. {
  386. (*skip_len)++;
  387. *ret = REPLACE_PREPARE_T_ESCAPE_SEQ;
  388. return FALSE;
  389. }
  390. else
  391. {
  392. *ret = REPLACE_PREPARE_T_NOTHING_SPECIAL;
  393. return TRUE;
  394. }
  395. }
  396. if (c == 'x')
  397. {
  398. *skip_len = 2; /* \x */
  399. c = curr_str[2];
  400. if (c == '{')
  401. {
  402. for (*skip_len = 3; /* \x{ */
  403. current_pos + *skip_len < replace_str->len
  404. && g_ascii_isxdigit ((guchar) curr_str[*skip_len]); (*skip_len)++)
  405. ;
  406. if (current_pos + *skip_len < replace_str->len && curr_str[*skip_len] == '}')
  407. {
  408. (*skip_len)++;
  409. *ret = REPLACE_PREPARE_T_ESCAPE_SEQ;
  410. return FALSE;
  411. }
  412. else
  413. {
  414. *ret = REPLACE_PREPARE_T_NOTHING_SPECIAL;
  415. return TRUE;
  416. }
  417. }
  418. else if (!g_ascii_isxdigit ((guchar) c))
  419. {
  420. *skip_len = 2; /* \x without number behind */
  421. *ret = REPLACE_PREPARE_T_NOTHING_SPECIAL;
  422. return FALSE;
  423. }
  424. else
  425. {
  426. c = curr_str[3];
  427. if (!g_ascii_isxdigit ((guchar) c))
  428. *skip_len = 3; /* \xH */
  429. else
  430. *skip_len = 4; /* \xHH */
  431. *ret = REPLACE_PREPARE_T_ESCAPE_SEQ;
  432. return FALSE;
  433. }
  434. }
  435. }
  436. if (strchr ("ntvbrfa", c) != NULL)
  437. {
  438. *skip_len = 2;
  439. *ret = REPLACE_PREPARE_T_ESCAPE_SEQ;
  440. return FALSE;
  441. }
  442. return TRUE;
  443. }
  444. /* --------------------------------------------------------------------------------------------- */
  445. static int
  446. mc_search_regex__process_replace_str (const GString * replace_str, const gsize current_pos,
  447. gsize * skip_len, replace_transform_type_t * replace_flags)
  448. {
  449. int ret = -1;
  450. const char *curr_str = &(replace_str->str[current_pos]);
  451. if (current_pos > replace_str->len)
  452. return REPLACE_PREPARE_T_NOTHING_SPECIAL;
  453. *skip_len = 0;
  454. if (replace_str->len > current_pos + 2 && curr_str[0] == '$' && curr_str[1] == '{'
  455. && (curr_str[2] & (char) 0xf0) == 0x30)
  456. {
  457. char *tmp_str;
  458. if (strutils_is_char_escaped (replace_str->str, curr_str))
  459. {
  460. *skip_len = 1;
  461. return REPLACE_PREPARE_T_NOTHING_SPECIAL;
  462. }
  463. for (*skip_len = 0;
  464. current_pos + *skip_len + 2 < replace_str->len
  465. && (curr_str[2 + *skip_len] & (char) 0xf0) == 0x30; (*skip_len)++)
  466. ;
  467. if (curr_str[2 + *skip_len] != '}')
  468. return REPLACE_PREPARE_T_NOTHING_SPECIAL;
  469. tmp_str = g_strndup (curr_str + 2, *skip_len);
  470. if (tmp_str == NULL)
  471. return REPLACE_PREPARE_T_NOTHING_SPECIAL;
  472. ret = atoi (tmp_str);
  473. g_free (tmp_str);
  474. *skip_len += 3; /* ${} */
  475. return ret; /* capture buffer index >= 0 */
  476. }
  477. if (curr_str[0] == '\\' && replace_str->len > current_pos + 1)
  478. {
  479. if (strutils_is_char_escaped (replace_str->str, curr_str))
  480. {
  481. *skip_len = 1;
  482. return REPLACE_PREPARE_T_NOTHING_SPECIAL;
  483. }
  484. if (g_ascii_isdigit (curr_str[1]))
  485. {
  486. ret = g_ascii_digit_value (curr_str[1]); /* capture buffer index >= 0 */
  487. *skip_len = 2; /* \\ and one digit */
  488. return ret;
  489. }
  490. if (!mc_search_regex__replace_handle_esc_seq (replace_str, current_pos, skip_len, &ret))
  491. return ret;
  492. ret = REPLACE_PREPARE_T_REPLACE_FLAG;
  493. *skip_len += 2;
  494. switch (curr_str[1])
  495. {
  496. case 'U':
  497. *replace_flags |= REPLACE_T_UPP_TRANSFORM;
  498. *replace_flags &= ~REPLACE_T_LOW_TRANSFORM;
  499. break;
  500. case 'u':
  501. *replace_flags |= REPLACE_T_UPP_TRANSFORM_CHAR;
  502. break;
  503. case 'L':
  504. *replace_flags |= REPLACE_T_LOW_TRANSFORM;
  505. *replace_flags &= ~REPLACE_T_UPP_TRANSFORM;
  506. break;
  507. case 'l':
  508. *replace_flags |= REPLACE_T_LOW_TRANSFORM_CHAR;
  509. break;
  510. case 'E':
  511. *replace_flags = REPLACE_T_NO_TRANSFORM;
  512. break;
  513. default:
  514. ret = REPLACE_PREPARE_T_NOTHING_SPECIAL;
  515. break;
  516. }
  517. }
  518. return ret;
  519. }
  520. /* --------------------------------------------------------------------------------------------- */
  521. static void
  522. mc_search_regex__process_append_str (GString * dest_str, const char *from, gsize len,
  523. replace_transform_type_t * replace_flags)
  524. {
  525. gsize loop;
  526. gsize char_len;
  527. if (len == (gsize) (-1))
  528. len = strlen (from);
  529. if (*replace_flags == REPLACE_T_NO_TRANSFORM)
  530. {
  531. g_string_append_len (dest_str, from, len);
  532. return;
  533. }
  534. for (loop = 0; loop < len; loop += char_len)
  535. {
  536. GString *tmp_string = NULL;
  537. GString *s;
  538. s = mc_search__get_one_symbol (NULL, from + loop, len - loop, NULL);
  539. char_len = s->len;
  540. if ((*replace_flags & REPLACE_T_UPP_TRANSFORM_CHAR) != 0)
  541. {
  542. *replace_flags &= ~REPLACE_T_UPP_TRANSFORM_CHAR;
  543. tmp_string = mc_search__toupper_case_str (NULL, s);
  544. g_string_append_len (dest_str, tmp_string->str, tmp_string->len);
  545. }
  546. else if ((*replace_flags & REPLACE_T_LOW_TRANSFORM_CHAR) != 0)
  547. {
  548. *replace_flags &= ~REPLACE_T_LOW_TRANSFORM_CHAR;
  549. tmp_string = mc_search__tolower_case_str (NULL, s);
  550. g_string_append_len (dest_str, tmp_string->str, tmp_string->len);
  551. }
  552. else if ((*replace_flags & REPLACE_T_UPP_TRANSFORM) != 0)
  553. {
  554. tmp_string = mc_search__toupper_case_str (NULL, s);
  555. g_string_append_len (dest_str, tmp_string->str, tmp_string->len);
  556. }
  557. else if ((*replace_flags & REPLACE_T_LOW_TRANSFORM) != 0)
  558. {
  559. tmp_string = mc_search__tolower_case_str (NULL, s);
  560. g_string_append_len (dest_str, tmp_string->str, tmp_string->len);
  561. }
  562. g_string_free (s, TRUE);
  563. if (tmp_string != NULL)
  564. g_string_free (tmp_string, TRUE);
  565. }
  566. }
  567. /* --------------------------------------------------------------------------------------------- */
  568. static void
  569. mc_search_regex__process_escape_sequence (GString * dest_str, const char *from, gsize len,
  570. replace_transform_type_t * replace_flags,
  571. gboolean is_utf8)
  572. {
  573. gsize i = 0;
  574. unsigned int c = 0;
  575. char b;
  576. if (len == (gsize) (-1))
  577. len = strlen (from);
  578. if (len == 0)
  579. return;
  580. if (from[i] == '{')
  581. i++;
  582. if (i >= len)
  583. return;
  584. if (from[i] == 'x')
  585. {
  586. i++;
  587. if (i < len && from[i] == '{')
  588. i++;
  589. for (; i < len; i++)
  590. {
  591. if (from[i] >= '0' && from[i] <= '9')
  592. c = c * 16 + from[i] - '0';
  593. else if (from[i] >= 'a' && from[i] <= 'f')
  594. c = c * 16 + 10 + from[i] - 'a';
  595. else if (from[i] >= 'A' && from[i] <= 'F')
  596. c = c * 16 + 10 + from[i] - 'A';
  597. else
  598. break;
  599. }
  600. }
  601. else if (from[i] >= '0' && from[i] <= '7')
  602. for (; i < len && from[i] >= '0' && from[i] <= '7'; i++)
  603. c = c * 8 + from[i] - '0';
  604. else
  605. {
  606. switch (from[i])
  607. {
  608. case 'n':
  609. c = '\n';
  610. break;
  611. case 't':
  612. c = '\t';
  613. break;
  614. case 'v':
  615. c = '\v';
  616. break;
  617. case 'b':
  618. c = '\b';
  619. break;
  620. case 'r':
  621. c = '\r';
  622. break;
  623. case 'f':
  624. c = '\f';
  625. break;
  626. case 'a':
  627. c = '\a';
  628. break;
  629. default:
  630. mc_search_regex__process_append_str (dest_str, from, len, replace_flags);
  631. return;
  632. }
  633. }
  634. if (c < 0x80 || !is_utf8)
  635. g_string_append_c (dest_str, (char) c);
  636. else if (c < 0x800)
  637. {
  638. b = 0xC0 | (c >> 6);
  639. g_string_append_c (dest_str, b);
  640. b = 0x80 | (c & 0x3F);
  641. g_string_append_c (dest_str, b);
  642. }
  643. else if (c < 0x10000)
  644. {
  645. b = 0xE0 | (c >> 12);
  646. g_string_append_c (dest_str, b);
  647. b = 0x80 | ((c >> 6) & 0x3F);
  648. g_string_append_c (dest_str, b);
  649. b = 0x80 | (c & 0x3F);
  650. g_string_append_c (dest_str, b);
  651. }
  652. else if (c < 0x10FFFF)
  653. {
  654. b = 0xF0 | (c >> 16);
  655. g_string_append_c (dest_str, b);
  656. b = 0x80 | ((c >> 12) & 0x3F);
  657. g_string_append_c (dest_str, b);
  658. b = 0x80 | ((c >> 6) & 0x3F);
  659. g_string_append_c (dest_str, b);
  660. b = 0x80 | (c & 0x3F);
  661. g_string_append_c (dest_str, b);
  662. }
  663. }
  664. /* --------------------------------------------------------------------------------------------- */
  665. /*** public functions ****************************************************************************/
  666. /* --------------------------------------------------------------------------------------------- */
  667. void
  668. mc_search__cond_struct_new_init_regex (const char *charset, mc_search_t * lc_mc_search,
  669. mc_search_cond_t * mc_search_cond)
  670. {
  671. if (lc_mc_search->whole_words && !lc_mc_search->is_entire_line)
  672. {
  673. /* NOTE: \b as word boundary doesn't allow search
  674. * whole words with non-ASCII symbols.
  675. * Update: Is it still true nowadays? Probably not. #2396, #3524 */
  676. g_string_prepend (mc_search_cond->str, "(?<![\\p{L}\\p{N}_])");
  677. g_string_append (mc_search_cond->str, "(?![\\p{L}\\p{N}_])");
  678. }
  679. {
  680. #ifdef SEARCH_TYPE_GLIB
  681. GError *mcerror = NULL;
  682. GRegexCompileFlags g_regex_options = G_REGEX_OPTIMIZE | G_REGEX_DOTALL;
  683. if (str_isutf8 (charset) && mc_global.utf8_display)
  684. {
  685. if (!lc_mc_search->is_case_sensitive)
  686. g_regex_options |= G_REGEX_CASELESS;
  687. }
  688. else
  689. {
  690. g_regex_options |= G_REGEX_RAW;
  691. if (!lc_mc_search->is_case_sensitive)
  692. {
  693. GString *tmp;
  694. tmp = mc_search_cond->str;
  695. mc_search_cond->str = mc_search__cond_struct_new_regex_ci_str (charset, tmp);
  696. g_string_free (tmp, TRUE);
  697. }
  698. }
  699. mc_search_cond->regex_handle =
  700. g_regex_new (mc_search_cond->str->str, g_regex_options, 0, &mcerror);
  701. if (mcerror != NULL)
  702. {
  703. lc_mc_search->error = MC_SEARCH_E_REGEX_COMPILE;
  704. g_free (lc_mc_search->error_str);
  705. lc_mc_search->error_str =
  706. str_conv_gerror_message (mcerror, _("Regular expression error"));
  707. g_error_free (mcerror);
  708. return;
  709. }
  710. #else /* SEARCH_TYPE_GLIB */
  711. const char *error;
  712. int erroffset;
  713. int pcre_options = PCRE_EXTRA | PCRE_MULTILINE;
  714. if (str_isutf8 (charset) && mc_global.utf8_display)
  715. {
  716. pcre_options |= PCRE_UTF8;
  717. if (!lc_mc_search->is_case_sensitive)
  718. pcre_options |= PCRE_CASELESS;
  719. }
  720. else if (!lc_mc_search->is_case_sensitive)
  721. {
  722. GString *tmp;
  723. tmp = mc_search_cond->str;
  724. mc_search_cond->str = mc_search__cond_struct_new_regex_ci_str (charset, tmp);
  725. g_string_free (tmp, TRUE);
  726. }
  727. mc_search_cond->regex_handle =
  728. pcre_compile (mc_search_cond->str->str, pcre_options, &error, &erroffset, NULL);
  729. if (mc_search_cond->regex_handle == NULL)
  730. {
  731. mc_search_set_error (lc_mc_search, MC_SEARCH_E_REGEX_COMPILE, "%s", error);
  732. return;
  733. }
  734. lc_mc_search->regex_match_info = pcre_study (mc_search_cond->regex_handle, 0, &error);
  735. if (lc_mc_search->regex_match_info == NULL && error != NULL)
  736. {
  737. mc_search_set_error (lc_mc_search, MC_SEARCH_E_REGEX_COMPILE, "%s", error);
  738. MC_PTR_FREE (mc_search_cond->regex_handle);
  739. return;
  740. }
  741. #endif /* SEARCH_TYPE_GLIB */
  742. }
  743. lc_mc_search->is_utf8 = str_isutf8 (charset);
  744. }
  745. /* --------------------------------------------------------------------------------------------- */
  746. gboolean
  747. mc_search__run_regex (mc_search_t * lc_mc_search, const void *user_data,
  748. gsize start_search, gsize end_search, gsize * found_len)
  749. {
  750. mc_search_cbret_t ret = MC_SEARCH_CB_NOTFOUND;
  751. gsize current_pos, virtual_pos;
  752. gint start_pos;
  753. gint end_pos;
  754. if (lc_mc_search->regex_buffer != NULL)
  755. g_string_set_size (lc_mc_search->regex_buffer, 0);
  756. else
  757. lc_mc_search->regex_buffer = g_string_sized_new (64);
  758. virtual_pos = current_pos = start_search;
  759. while (virtual_pos <= end_search)
  760. {
  761. g_string_set_size (lc_mc_search->regex_buffer, 0);
  762. lc_mc_search->start_buffer = current_pos;
  763. if (lc_mc_search->search_fn != NULL)
  764. {
  765. while (TRUE)
  766. {
  767. int current_chr = '\n'; /* stop search symbol */
  768. ret = lc_mc_search->search_fn (user_data, current_pos, &current_chr);
  769. if (ret == MC_SEARCH_CB_ABORT)
  770. break;
  771. if (ret == MC_SEARCH_CB_INVALID)
  772. continue;
  773. current_pos++;
  774. if (ret == MC_SEARCH_CB_SKIP)
  775. continue;
  776. virtual_pos++;
  777. g_string_append_c (lc_mc_search->regex_buffer, (char) current_chr);
  778. if ((char) current_chr == '\n' || virtual_pos > end_search)
  779. break;
  780. }
  781. }
  782. else
  783. {
  784. /* optimization for standard case (for search from file manager)
  785. * where there is no MC_SEARCH_CB_INVALID or MC_SEARCH_CB_SKIP
  786. * return codes, so we can copy line at regex buffer all at once
  787. */
  788. while (TRUE)
  789. {
  790. const char current_chr = ((const char *) user_data)[current_pos];
  791. if (current_chr == '\0')
  792. break;
  793. current_pos++;
  794. if (current_chr == '\n' || current_pos > end_search)
  795. break;
  796. }
  797. /* use virtual_pos as index of start of current chunk */
  798. g_string_append_len (lc_mc_search->regex_buffer, (const char *) user_data + virtual_pos,
  799. current_pos - virtual_pos);
  800. virtual_pos = current_pos;
  801. }
  802. switch (mc_search__regex_found_cond (lc_mc_search, lc_mc_search->regex_buffer))
  803. {
  804. case COND__FOUND_OK:
  805. #ifdef SEARCH_TYPE_GLIB
  806. g_match_info_fetch_pos (lc_mc_search->regex_match_info, 0, &start_pos, &end_pos);
  807. #else /* SEARCH_TYPE_GLIB */
  808. start_pos = lc_mc_search->iovector[0];
  809. end_pos = lc_mc_search->iovector[1];
  810. #endif /* SEARCH_TYPE_GLIB */
  811. if (found_len != NULL)
  812. *found_len = end_pos - start_pos;
  813. lc_mc_search->normal_offset = lc_mc_search->start_buffer + start_pos;
  814. return TRUE;
  815. case COND__NOT_ALL_FOUND:
  816. break;
  817. default:
  818. g_string_free (lc_mc_search->regex_buffer, TRUE);
  819. lc_mc_search->regex_buffer = NULL;
  820. return FALSE;
  821. }
  822. if ((lc_mc_search->update_fn != NULL) &&
  823. ((lc_mc_search->update_fn) (user_data, current_pos) == MC_SEARCH_CB_ABORT))
  824. ret = MC_SEARCH_CB_ABORT;
  825. if (ret == MC_SEARCH_CB_ABORT || ret == MC_SEARCH_CB_NOTFOUND)
  826. break;
  827. }
  828. g_string_free (lc_mc_search->regex_buffer, TRUE);
  829. lc_mc_search->regex_buffer = NULL;
  830. MC_PTR_FREE (lc_mc_search->error_str);
  831. lc_mc_search->error = ret == MC_SEARCH_CB_ABORT ? MC_SEARCH_E_ABORT : MC_SEARCH_E_NOTFOUND;
  832. return FALSE;
  833. }
  834. /* --------------------------------------------------------------------------------------------- */
  835. GString *
  836. mc_search_regex_prepare_replace_str (mc_search_t * lc_mc_search, GString * replace_str)
  837. {
  838. GString *ret;
  839. int num_replace_tokens;
  840. gsize loop;
  841. gsize prev = 0;
  842. replace_transform_type_t replace_flags = REPLACE_T_NO_TRANSFORM;
  843. num_replace_tokens =
  844. mc_search_regex__get_max_num_of_replace_tokens (replace_str->str, replace_str->len);
  845. if (lc_mc_search->num_results < 0)
  846. return mc_g_string_dup (replace_str);
  847. if (num_replace_tokens > lc_mc_search->num_results - 1
  848. || num_replace_tokens > MC_SEARCH__NUM_REPLACE_ARGS)
  849. {
  850. mc_search_set_error (lc_mc_search, MC_SEARCH_E_REGEX_REPLACE, "%s",
  851. _(STR_E_RPL_NOT_EQ_TO_FOUND));
  852. return NULL;
  853. }
  854. ret = g_string_sized_new (64);
  855. for (loop = 0; loop < replace_str->len - 1; loop++)
  856. {
  857. int lc_index;
  858. gchar *tmp_str;
  859. gsize len = 0;
  860. lc_index = mc_search_regex__process_replace_str (replace_str, loop, &len, &replace_flags);
  861. if (lc_index == REPLACE_PREPARE_T_NOTHING_SPECIAL)
  862. {
  863. if (len != 0)
  864. {
  865. mc_search_regex__process_append_str (ret, replace_str->str + prev, loop - prev,
  866. &replace_flags);
  867. mc_search_regex__process_append_str (ret, replace_str->str + loop + 1, len - 1,
  868. &replace_flags);
  869. prev = loop + len;
  870. loop = prev - 1; /* prepare to loop++ */
  871. }
  872. continue;
  873. }
  874. if (lc_index == REPLACE_PREPARE_T_REPLACE_FLAG)
  875. {
  876. if (loop != 0)
  877. mc_search_regex__process_append_str (ret, replace_str->str + prev, loop - prev,
  878. &replace_flags);
  879. prev = loop + len;
  880. loop = prev - 1; /* prepare to loop++ */
  881. continue;
  882. }
  883. /* escape sequence */
  884. if (lc_index == REPLACE_PREPARE_T_ESCAPE_SEQ)
  885. {
  886. mc_search_regex__process_append_str (ret, replace_str->str + prev, loop - prev,
  887. &replace_flags);
  888. /* call process_escape_sequence without starting '\\' */
  889. mc_search_regex__process_escape_sequence (ret, replace_str->str + loop + 1, len - 1,
  890. &replace_flags, lc_mc_search->is_utf8);
  891. prev = loop + len;
  892. loop = prev - 1; /* prepare to loop++ */
  893. continue;
  894. }
  895. /* invalid capture buffer number */
  896. if (lc_index > lc_mc_search->num_results)
  897. {
  898. g_string_free (ret, TRUE);
  899. mc_search_set_error (lc_mc_search, MC_SEARCH_E_REGEX_REPLACE,
  900. _(STR_E_RPL_INVALID_TOKEN), lc_index);
  901. return NULL;
  902. }
  903. tmp_str = mc_search_regex__get_token_by_num (lc_mc_search, lc_index);
  904. if (loop != 0)
  905. mc_search_regex__process_append_str (ret, replace_str->str + prev, loop - prev,
  906. &replace_flags);
  907. mc_search_regex__process_append_str (ret, tmp_str, -1, &replace_flags);
  908. g_free (tmp_str);
  909. prev = loop + len;
  910. loop = prev - 1; /* prepare to loop++ */
  911. }
  912. mc_search_regex__process_append_str (ret, replace_str->str + prev, replace_str->len - prev,
  913. &replace_flags);
  914. return ret;
  915. }