regex.c 24 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766
  1. /*
  2. Search text engine.
  3. Regex search
  4. Copyright (C) 2009 The Free Software Foundation, Inc.
  5. Written by:
  6. Slava Zanko <slavazanko@gmail.com>, 2009.
  7. This file is part of the Midnight Commander.
  8. The Midnight Commander is free software; you can redistribute it
  9. and/or modify it under the terms of the GNU General Public License as
  10. published by the Free Software Foundation; either version 2 of the
  11. License, or (at your option) any later version.
  12. The Midnight Commander is distributed in the hope that it will be
  13. useful, but WITHOUT ANY WARRANTY; without even the implied warranty
  14. of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  15. General Public License for more details.
  16. You should have received a copy of the GNU General Public License
  17. along with this program; if not, write to the Free Software
  18. Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston,
  19. MA 02110-1301, USA.
  20. */
  21. #include <config.h>
  22. #include <stdlib.h>
  23. #include "lib/global.h"
  24. #include "lib/strutil.h"
  25. #include "lib/search.h"
  26. #include "lib/strescape.h"
  27. #include "lib/charsets.h"
  28. #include "internal.h"
  29. /*** global variables ****************************************************************************/
  30. /*** file scope macro definitions ****************************************************************/
  31. /*** file scope type declarations ****************************************************************/
  32. typedef enum
  33. {
  34. REPLACE_T_NO_TRANSFORM = 0,
  35. REPLACE_T_UPP_TRANSFORM_CHAR = 1,
  36. REPLACE_T_LOW_TRANSFORM_CHAR = 2,
  37. REPLACE_T_UPP_TRANSFORM = 4,
  38. REPLACE_T_LOW_TRANSFORM = 8
  39. } replace_transform_type_t;
  40. /*** file scope variables ************************************************************************/
  41. /*** file scope functions ************************************************************************/
  42. static gboolean
  43. mc_search__regex_str_append_if_special (GString * copy_to, const GString * regex_str,
  44. gsize * offset)
  45. {
  46. char *tmp_regex_str;
  47. gsize spec_chr_len;
  48. const char **spec_chr;
  49. const char *special_chars[] = {
  50. "\\s", "\\S",
  51. "\\d", "\\D",
  52. "\\b", "\\B",
  53. "\\w", "\\W",
  54. "\\t", "\\n",
  55. "\\r", "\\f",
  56. "\\a", "\\e",
  57. "\\x", "\\X",
  58. "\\c", "\\C",
  59. "\\l", "\\L",
  60. "\\u", "\\U",
  61. "\\E", "\\Q",
  62. NULL
  63. };
  64. spec_chr = special_chars;
  65. tmp_regex_str = &(regex_str->str[*offset]);
  66. while (*spec_chr)
  67. {
  68. spec_chr_len = strlen (*spec_chr);
  69. if (!strncmp (tmp_regex_str, *spec_chr, spec_chr_len))
  70. {
  71. if (!strutils_is_char_escaped (regex_str->str, tmp_regex_str))
  72. {
  73. if (!strncmp ("\\x", *spec_chr, spec_chr_len))
  74. {
  75. if (*(tmp_regex_str + spec_chr_len) == '{')
  76. {
  77. while ((spec_chr_len < regex_str->len - *offset)
  78. && *(tmp_regex_str + spec_chr_len) != '}')
  79. spec_chr_len++;
  80. if (*(tmp_regex_str + spec_chr_len) == '}')
  81. spec_chr_len++;
  82. }
  83. else
  84. spec_chr_len += 2;
  85. }
  86. g_string_append_len (copy_to, tmp_regex_str, spec_chr_len);
  87. *offset += spec_chr_len;
  88. return TRUE;
  89. }
  90. }
  91. spec_chr++;
  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 char *one_char, gsize str_len)
  99. {
  100. GString *upp, *low;
  101. gchar *tmp_str;
  102. gsize loop;
  103. upp = mc_search__toupper_case_str (charset, one_char, str_len);
  104. low = mc_search__tolower_case_str (charset, one_char, str_len);
  105. for (loop = 0; loop < upp->len; loop++)
  106. {
  107. if (loop < low->len)
  108. {
  109. if (upp->str[loop] == low->str[loop])
  110. tmp_str = g_strdup_printf ("\\x%02X", (unsigned char) upp->str[loop]);
  111. else
  112. tmp_str =
  113. g_strdup_printf ("[\\x%02X\\x%02X]", (unsigned char) upp->str[loop],
  114. (unsigned char) low->str[loop]);
  115. }
  116. else
  117. {
  118. tmp_str = g_strdup_printf ("\\x%02X", (unsigned char) upp->str[loop]);
  119. }
  120. g_string_append (str_to, tmp_str);
  121. g_free (tmp_str);
  122. }
  123. g_string_free (upp, TRUE);
  124. g_string_free (low, TRUE);
  125. }
  126. /* --------------------------------------------------------------------------------------------- */
  127. static void
  128. mc_search__cond_struct_new_regex_accum_append (const char *charset, GString * str_to,
  129. GString * str_from)
  130. {
  131. GString *recoded_part;
  132. gsize loop = 0;
  133. recoded_part = g_string_sized_new (32);
  134. while (loop < str_from->len)
  135. {
  136. gchar *one_char;
  137. gsize one_char_len;
  138. gboolean just_letters;
  139. one_char =
  140. mc_search__get_one_symbol (charset, &(str_from->str[loop]),
  141. min (str_from->len - loop, 6), &just_letters);
  142. one_char_len = strlen (one_char);
  143. if (one_char_len == 0)
  144. loop++;
  145. else
  146. {
  147. loop += one_char_len;
  148. if (just_letters)
  149. mc_search__cond_struct_new_regex_hex_add (charset, recoded_part, one_char,
  150. one_char_len);
  151. else
  152. g_string_append_len (recoded_part, one_char, one_char_len);
  153. }
  154. g_free (one_char);
  155. }
  156. g_string_append (str_to, recoded_part->str);
  157. g_string_free (recoded_part, TRUE);
  158. g_string_set_size (str_from, 0);
  159. }
  160. /* --------------------------------------------------------------------------------------------- */
  161. static GString *
  162. mc_search__cond_struct_new_regex_ci_str (const char *charset, const GString * astr)
  163. {
  164. GString *accumulator, *spec_char, *ret_str;
  165. gsize loop;
  166. ret_str = g_string_sized_new (64);
  167. accumulator = g_string_sized_new (64);
  168. spec_char = g_string_sized_new (64);
  169. loop = 0;
  170. while (loop <= astr->len)
  171. {
  172. if (mc_search__regex_str_append_if_special (spec_char, astr, &loop))
  173. {
  174. mc_search__cond_struct_new_regex_accum_append (charset, ret_str, accumulator);
  175. g_string_append_len (ret_str, spec_char->str, spec_char->len);
  176. g_string_set_size (spec_char, 0);
  177. continue;
  178. }
  179. if (astr->str[loop] == '[' && !strutils_is_char_escaped (astr->str, &(astr->str[loop])))
  180. {
  181. mc_search__cond_struct_new_regex_accum_append (charset, ret_str, accumulator);
  182. while (loop < astr->len && !(astr->str[loop] == ']'
  183. && !strutils_is_char_escaped (astr->str,
  184. &(astr->str[loop]))))
  185. {
  186. g_string_append_c (ret_str, astr->str[loop]);
  187. loop++;
  188. }
  189. g_string_append_c (ret_str, astr->str[loop]);
  190. loop++;
  191. continue;
  192. }
  193. /*
  194. TODO: handle [ and ]
  195. */
  196. g_string_append_c (accumulator, astr->str[loop]);
  197. loop++;
  198. }
  199. mc_search__cond_struct_new_regex_accum_append (charset, ret_str, accumulator);
  200. g_string_free (accumulator, TRUE);
  201. g_string_free (spec_char, TRUE);
  202. return ret_str;
  203. }
  204. /* --------------------------------------------------------------------------------------------- */
  205. static mc_search__found_cond_t
  206. mc_search__regex_found_cond_one (mc_search_t * lc_mc_search, mc_search_regex_t * regex,
  207. GString * search_str)
  208. {
  209. #ifdef SEARCH_TYPE_GLIB
  210. GError *error = NULL;
  211. if (!g_regex_match_full
  212. (regex, search_str->str, -1, 0, G_REGEX_MATCH_NEWLINE_ANY, &lc_mc_search->regex_match_info,
  213. &error))
  214. {
  215. g_match_info_free (lc_mc_search->regex_match_info);
  216. lc_mc_search->regex_match_info = NULL;
  217. if (error)
  218. {
  219. lc_mc_search->error = MC_SEARCH_E_REGEX;
  220. lc_mc_search->error_str =
  221. str_conv_gerror_message (error, _("Regular expression error"));
  222. g_error_free (error);
  223. return COND__FOUND_ERROR;
  224. }
  225. return COND__NOT_FOUND;
  226. }
  227. lc_mc_search->num_results = g_match_info_get_match_count (lc_mc_search->regex_match_info);
  228. #else /* SEARCH_TYPE_GLIB */
  229. lc_mc_search->num_results = pcre_exec (regex, lc_mc_search->regex_match_info,
  230. search_str->str, search_str->len - 1, 0, 0,
  231. lc_mc_search->iovector, MC_SEARCH__NUM_REPLACE_ARGS);
  232. if (lc_mc_search->num_results < 0)
  233. {
  234. return COND__NOT_FOUND;
  235. }
  236. #endif /* SEARCH_TYPE_GLIB */
  237. return COND__FOUND_OK;
  238. }
  239. /* --------------------------------------------------------------------------------------------- */
  240. static mc_search__found_cond_t
  241. mc_search__regex_found_cond (mc_search_t * lc_mc_search, GString * search_str)
  242. {
  243. gsize loop1;
  244. mc_search_cond_t *mc_search_cond;
  245. mc_search__found_cond_t ret;
  246. for (loop1 = 0; loop1 < lc_mc_search->conditions->len; loop1++)
  247. {
  248. mc_search_cond = (mc_search_cond_t *) g_ptr_array_index (lc_mc_search->conditions, loop1);
  249. if (!mc_search_cond->regex_handle)
  250. continue;
  251. ret =
  252. mc_search__regex_found_cond_one (lc_mc_search, mc_search_cond->regex_handle,
  253. search_str);
  254. if (ret != COND__NOT_FOUND)
  255. return ret;
  256. }
  257. return COND__NOT_ALL_FOUND;
  258. }
  259. /* --------------------------------------------------------------------------------------------- */
  260. static int
  261. mc_search_regex__get_max_num_of_replace_tokens (const gchar * str, gsize len)
  262. {
  263. int max_token = 0;
  264. gsize loop;
  265. for (loop = 0; loop < len - 1; loop++)
  266. {
  267. if (str[loop] == '\\' && g_ascii_isdigit (str[loop + 1]))
  268. {
  269. if (strutils_is_char_escaped (str, &str[loop]))
  270. continue;
  271. if (max_token < str[loop + 1] - '0')
  272. max_token = str[loop + 1] - '0';
  273. continue;
  274. }
  275. if (str[loop] == '$' && str[loop + 1] == '{')
  276. {
  277. gsize tmp_len;
  278. char *tmp_str;
  279. int tmp_token;
  280. if (strutils_is_char_escaped (str, &str[loop]))
  281. continue;
  282. for (tmp_len = 0;
  283. loop + tmp_len + 2 < len && (str[loop + 2 + tmp_len] & (char) 0xf0) == 0x30;
  284. tmp_len++);
  285. if (str[loop + 2 + tmp_len] == '}')
  286. {
  287. tmp_str = g_strndup (&str[loop + 2], tmp_len);
  288. tmp_token = atoi (tmp_str);
  289. if (max_token < tmp_token)
  290. max_token = tmp_token;
  291. g_free (tmp_str);
  292. }
  293. }
  294. }
  295. return max_token;
  296. }
  297. /* --------------------------------------------------------------------------------------------- */
  298. static char *
  299. mc_search_regex__get_token_by_num (const mc_search_t * lc_mc_search, gsize lc_index)
  300. {
  301. int fnd_start = 0, fnd_end = 0;
  302. #ifdef SEARCH_TYPE_GLIB
  303. g_match_info_fetch_pos (lc_mc_search->regex_match_info, lc_index, &fnd_start, &fnd_end);
  304. #else /* SEARCH_TYPE_GLIB */
  305. fnd_start = lc_mc_search->iovector[lc_index * 2 + 0];
  306. fnd_end = lc_mc_search->iovector[lc_index * 2 + 1];
  307. #endif /* SEARCH_TYPE_GLIB */
  308. if (fnd_end - fnd_start == 0)
  309. return NULL;
  310. return g_strndup (lc_mc_search->regex_buffer->str + fnd_start, fnd_end - fnd_start);
  311. }
  312. /* --------------------------------------------------------------------------------------------- */
  313. static int
  314. mc_search_regex__process_replace_str (const GString * replace_str, const gsize current_pos,
  315. gsize * skip_len, replace_transform_type_t * replace_flags)
  316. {
  317. int ret = -1;
  318. char *tmp_str;
  319. const char *curr_str = &(replace_str->str[current_pos]);
  320. if (current_pos > replace_str->len)
  321. return -1;
  322. *skip_len = 0;
  323. if (*curr_str == '$' && *(curr_str + 1) == '{' && (*(curr_str + 2) & (char) 0xf0) == 0x30)
  324. {
  325. if (strutils_is_char_escaped (replace_str->str, curr_str))
  326. {
  327. *skip_len = 1;
  328. return -1;
  329. }
  330. for (*skip_len = 0;
  331. current_pos + *skip_len + 2 < replace_str->len
  332. && (*(curr_str + 2 + *skip_len) & (char) 0xf0) == 0x30; (*skip_len)++);
  333. if (*(curr_str + 2 + *skip_len) != '}')
  334. return -1;
  335. tmp_str = g_strndup (curr_str + 2, *skip_len);
  336. if (tmp_str == NULL)
  337. return -1;
  338. ret = atoi (tmp_str);
  339. g_free (tmp_str);
  340. *skip_len += 3; /* ${} */
  341. return ret;
  342. }
  343. if (*curr_str == '\\')
  344. {
  345. if (strutils_is_char_escaped (replace_str->str, curr_str))
  346. {
  347. *skip_len = 1;
  348. return -1;
  349. }
  350. if (g_ascii_isdigit (*(curr_str + 1)))
  351. {
  352. ret = g_ascii_digit_value (*(curr_str + 1));
  353. *skip_len = 2; /* \\ and one digit */
  354. return ret;
  355. }
  356. ret = -2;
  357. *skip_len += 2;
  358. switch (*(curr_str + 1))
  359. {
  360. case 'U':
  361. *replace_flags |= REPLACE_T_UPP_TRANSFORM;
  362. *replace_flags &= ~REPLACE_T_LOW_TRANSFORM;
  363. break;
  364. case 'u':
  365. *replace_flags |= REPLACE_T_UPP_TRANSFORM_CHAR;
  366. break;
  367. case 'L':
  368. *replace_flags |= REPLACE_T_LOW_TRANSFORM;
  369. *replace_flags &= ~REPLACE_T_UPP_TRANSFORM;
  370. break;
  371. case 'l':
  372. *replace_flags |= REPLACE_T_LOW_TRANSFORM_CHAR;
  373. break;
  374. case 'E':
  375. *replace_flags = REPLACE_T_NO_TRANSFORM;
  376. break;
  377. default:
  378. ret = -1;
  379. break;
  380. }
  381. }
  382. return ret;
  383. }
  384. static void
  385. mc_search_regex__process_append_str (GString * dest_str, const char *from, gsize len,
  386. replace_transform_type_t * replace_flags)
  387. {
  388. gsize loop = 0;
  389. gsize char_len;
  390. char *tmp_str;
  391. GString *tmp_string;
  392. if (len == (gsize) - 1)
  393. len = strlen (from);
  394. if (*replace_flags == REPLACE_T_NO_TRANSFORM)
  395. {
  396. g_string_append_len (dest_str, from, len);
  397. return;
  398. }
  399. while (loop < len)
  400. {
  401. tmp_str = mc_search__get_one_symbol (NULL, from + loop, len - loop, NULL);
  402. char_len = strlen (tmp_str);
  403. if (*replace_flags & REPLACE_T_UPP_TRANSFORM_CHAR)
  404. {
  405. *replace_flags &= ~REPLACE_T_UPP_TRANSFORM_CHAR;
  406. tmp_string = mc_search__toupper_case_str (NULL, tmp_str, char_len);
  407. g_string_append (dest_str, tmp_string->str);
  408. g_string_free (tmp_string, TRUE);
  409. }
  410. else if (*replace_flags & REPLACE_T_LOW_TRANSFORM_CHAR)
  411. {
  412. *replace_flags &= ~REPLACE_T_LOW_TRANSFORM_CHAR;
  413. tmp_string = mc_search__toupper_case_str (NULL, tmp_str, char_len);
  414. g_string_append (dest_str, tmp_string->str);
  415. g_string_free (tmp_string, TRUE);
  416. }
  417. else if (*replace_flags & REPLACE_T_UPP_TRANSFORM)
  418. {
  419. tmp_string = mc_search__toupper_case_str (NULL, tmp_str, char_len);
  420. g_string_append (dest_str, tmp_string->str);
  421. g_string_free (tmp_string, TRUE);
  422. }
  423. else if (*replace_flags & REPLACE_T_LOW_TRANSFORM)
  424. {
  425. tmp_string = mc_search__tolower_case_str (NULL, tmp_str, char_len);
  426. g_string_append (dest_str, tmp_string->str);
  427. g_string_free (tmp_string, TRUE);
  428. }
  429. else
  430. {
  431. g_string_append (dest_str, tmp_str);
  432. }
  433. g_free (tmp_str);
  434. loop += char_len;
  435. }
  436. }
  437. /*** public functions ****************************************************************************/
  438. void
  439. mc_search__cond_struct_new_init_regex (const char *charset, mc_search_t * lc_mc_search,
  440. mc_search_cond_t * mc_search_cond)
  441. {
  442. #ifdef SEARCH_TYPE_GLIB
  443. GError *error = NULL;
  444. #else /* SEARCH_TYPE_GLIB */
  445. const char *error;
  446. int erroffset;
  447. #endif /* SEARCH_TYPE_GLIB */
  448. if (!lc_mc_search->is_case_sensitive)
  449. {
  450. GString *tmp;
  451. tmp = mc_search_cond->str;
  452. mc_search_cond->str = mc_search__cond_struct_new_regex_ci_str (charset, tmp);
  453. g_string_free (tmp, TRUE);
  454. }
  455. #ifdef SEARCH_TYPE_GLIB
  456. mc_search_cond->regex_handle =
  457. g_regex_new (mc_search_cond->str->str, G_REGEX_OPTIMIZE | G_REGEX_RAW | G_REGEX_DOTALL, 0,
  458. &error);
  459. if (error != NULL)
  460. {
  461. lc_mc_search->error = MC_SEARCH_E_REGEX_COMPILE;
  462. lc_mc_search->error_str = str_conv_gerror_message (error, _("Regular expression error"));
  463. g_error_free (error);
  464. return;
  465. }
  466. #else /* SEARCH_TYPE_GLIB */
  467. mc_search_cond->regex_handle =
  468. pcre_compile (mc_search_cond->str->str, PCRE_EXTRA, &error, &erroffset, NULL);
  469. if (mc_search_cond->regex_handle == NULL)
  470. {
  471. lc_mc_search->error = MC_SEARCH_E_REGEX_COMPILE;
  472. lc_mc_search->error_str = g_strdup (error);
  473. return;
  474. }
  475. lc_mc_search->regex_match_info = pcre_study (mc_search_cond->regex_handle, 0, &error);
  476. if (lc_mc_search->regex_match_info == NULL)
  477. {
  478. if (error)
  479. {
  480. lc_mc_search->error = MC_SEARCH_E_REGEX_COMPILE;
  481. lc_mc_search->error_str = g_strdup (error);
  482. g_free (mc_search_cond->regex_handle);
  483. mc_search_cond->regex_handle = NULL;
  484. return;
  485. }
  486. }
  487. #endif /* SEARCH_TYPE_GLIB */
  488. }
  489. /* --------------------------------------------------------------------------------------------- */
  490. gboolean
  491. mc_search__run_regex (mc_search_t * lc_mc_search, const void *user_data,
  492. gsize start_search, gsize end_search, gsize * found_len)
  493. {
  494. gsize current_pos, virtual_pos;
  495. int current_chr = 0;
  496. gint start_pos;
  497. gint end_pos;
  498. if (lc_mc_search->regex_buffer != NULL)
  499. g_string_free (lc_mc_search->regex_buffer, TRUE);
  500. lc_mc_search->regex_buffer = g_string_sized_new (64);
  501. virtual_pos = current_pos = start_search;
  502. while (virtual_pos <= end_search)
  503. {
  504. g_string_set_size (lc_mc_search->regex_buffer, 0);
  505. lc_mc_search->start_buffer = current_pos;
  506. while (1)
  507. {
  508. current_chr = mc_search__get_char (lc_mc_search, user_data, current_pos);
  509. if (current_chr == MC_SEARCH_CB_ABORT)
  510. break;
  511. if (current_chr == MC_SEARCH_CB_INVALID)
  512. continue;
  513. current_pos++;
  514. if (current_chr == MC_SEARCH_CB_SKIP)
  515. continue;
  516. virtual_pos++;
  517. g_string_append_c (lc_mc_search->regex_buffer, (char) current_chr);
  518. if (current_chr == 0 || (char) current_chr == '\n')
  519. break;
  520. if (virtual_pos > end_search)
  521. break;
  522. }
  523. switch (mc_search__regex_found_cond (lc_mc_search, lc_mc_search->regex_buffer))
  524. {
  525. case COND__FOUND_OK:
  526. #ifdef SEARCH_TYPE_GLIB
  527. if (lc_mc_search->whole_words)
  528. {
  529. g_match_info_fetch_pos (lc_mc_search->regex_match_info, 2, &start_pos, &end_pos);
  530. }
  531. else
  532. {
  533. g_match_info_fetch_pos (lc_mc_search->regex_match_info, 0, &start_pos, &end_pos);
  534. }
  535. #else /* SEARCH_TYPE_GLIB */
  536. if (lc_mc_search->whole_words)
  537. {
  538. start_pos = lc_mc_search->iovector[4];
  539. end_pos = lc_mc_search->iovector[5];
  540. }
  541. else
  542. {
  543. start_pos = lc_mc_search->iovector[0];
  544. end_pos = lc_mc_search->iovector[1];
  545. }
  546. #endif /* SEARCH_TYPE_GLIB */
  547. if (found_len)
  548. *found_len = end_pos - start_pos;
  549. lc_mc_search->normal_offset = lc_mc_search->start_buffer + start_pos;
  550. return TRUE;
  551. case COND__NOT_ALL_FOUND:
  552. break;
  553. default:
  554. g_string_free (lc_mc_search->regex_buffer, TRUE);
  555. lc_mc_search->regex_buffer = NULL;
  556. return FALSE;
  557. }
  558. if ((lc_mc_search->update_fn != NULL) &&
  559. ((lc_mc_search->update_fn) (user_data, current_pos) == MC_SEARCH_CB_ABORT))
  560. current_chr = MC_SEARCH_CB_ABORT;
  561. if (current_chr == MC_SEARCH_CB_ABORT)
  562. break;
  563. }
  564. g_string_free (lc_mc_search->regex_buffer, TRUE);
  565. lc_mc_search->regex_buffer = NULL;
  566. lc_mc_search->error = MC_SEARCH_E_NOTFOUND;
  567. if (current_chr != MC_SEARCH_CB_ABORT)
  568. lc_mc_search->error_str = g_strdup (_(STR_E_NOTFOUND));
  569. else
  570. lc_mc_search->error_str = NULL;
  571. return FALSE;
  572. }
  573. /* --------------------------------------------------------------------------------------------- */
  574. GString *
  575. mc_search_regex_prepare_replace_str (mc_search_t * lc_mc_search, GString * replace_str)
  576. {
  577. GString *ret;
  578. gchar *tmp_str;
  579. int num_replace_tokens, lc_index;
  580. gsize loop;
  581. gsize len = 0;
  582. gchar *prev_str;
  583. replace_transform_type_t replace_flags = REPLACE_T_NO_TRANSFORM;
  584. num_replace_tokens =
  585. mc_search_regex__get_max_num_of_replace_tokens (replace_str->str, replace_str->len);
  586. if (lc_mc_search->num_results < 0)
  587. return g_string_new_len (replace_str->str, replace_str->len);
  588. if (num_replace_tokens > lc_mc_search->num_results - 1
  589. || num_replace_tokens > MC_SEARCH__NUM_REPLACE_ARGS)
  590. {
  591. lc_mc_search->error = MC_SEARCH_E_REGEX_REPLACE;
  592. lc_mc_search->error_str = g_strdup (_(STR_E_RPL_NOT_EQ_TO_FOUND));
  593. return NULL;
  594. }
  595. ret = g_string_sized_new (64);
  596. prev_str = replace_str->str;
  597. for (loop = 0; loop < replace_str->len - 1; loop++)
  598. {
  599. lc_index = mc_search_regex__process_replace_str (replace_str, loop, &len, &replace_flags);
  600. if (lc_index == -1)
  601. {
  602. if (len != 0)
  603. {
  604. mc_search_regex__process_append_str (ret, prev_str,
  605. replace_str->str - prev_str + loop,
  606. &replace_flags);
  607. mc_search_regex__process_append_str (ret, replace_str->str + loop + 1, len - 1,
  608. &replace_flags);
  609. prev_str = replace_str->str + loop + len;
  610. loop += len - 1;
  611. }
  612. continue;
  613. }
  614. if (lc_index == -2)
  615. {
  616. if (loop)
  617. mc_search_regex__process_append_str (ret, prev_str,
  618. replace_str->str - prev_str + loop,
  619. &replace_flags);
  620. prev_str = replace_str->str + loop + len;
  621. loop += len - 1;
  622. continue;
  623. }
  624. if (lc_index > lc_mc_search->num_results)
  625. {
  626. g_string_free (ret, TRUE);
  627. lc_mc_search->error = MC_SEARCH_E_REGEX_REPLACE;
  628. lc_mc_search->error_str = g_strdup_printf (_(STR_E_RPL_INVALID_TOKEN), lc_index);
  629. return NULL;
  630. }
  631. tmp_str = mc_search_regex__get_token_by_num (lc_mc_search, lc_index);
  632. if (tmp_str == NULL)
  633. continue;
  634. if (loop)
  635. mc_search_regex__process_append_str (ret, prev_str, replace_str->str - prev_str + loop,
  636. &replace_flags);
  637. prev_str = replace_str->str + loop + len;
  638. mc_search_regex__process_append_str (ret, tmp_str, -1, &replace_flags);
  639. g_free (tmp_str);
  640. loop += len - 1;
  641. }
  642. mc_search_regex__process_append_str (ret, prev_str,
  643. replace_str->str - prev_str + replace_str->len,
  644. &replace_flags);
  645. return ret;
  646. }