2 tre_regexec.c - TRE POSIX compatible matching functions (and more).
4 This software is released under a BSD-style license.
5 See the file LICENSE for details and copyright.
11 #endif /* HAVE_CONFIG_H */
14 /* AIX requires this to be the first thing in the file. */
22 # ifndef alloca /* predefined by HP cc +Olibcalls */
28 #endif /* TRE_USE_ALLOCA */
35 #endif /* HAVE_WCHAR_H */
38 #endif /* HAVE_WCTYPE_H */
41 #endif /* !TRE_WCHAR */
44 #endif /* HAVE_MALLOC_H */
47 #include "tre-internal.h"
48 #include "tre-match-utils.h"
53 /* For each tre_last_matched_t in the lm array, find the last matched branch by
54 comparing the touch value of the cmp_tag's. For all other branches, reset
55 the corresponding tags. If reset_all is non-zero, reset all tags in all
56 branches. Recurse into the nested last matched structures, clearing tags as
59 tre_reset_last_matched_branches(tre_tag_t *tags, const tre_last_matched_t *lm,
60 int n, int start_tag, int reset_all)
63 tre_last_matched_branch_t *b;
65 DPRINT(("tre_reset_last_matched_branches: n=%d start_tag=%d reset_all=%d\n",
66 n, start_tag, reset_all));
69 if (lm->n_branches == 1)
74 DPRINT((" b->cmp_tag=%d %d <? %d\n", b->cmp_tag,
75 tre_tag_touch_get(tags, b->cmp_tag),
76 tre_tag_touch_get(tags, start_tag)));
77 reset = (reset_all || tre_tag_touch_get(tags, b->cmp_tag) <
78 tre_tag_touch_get(tags, start_tag));
87 for (i = b->n_tags, t = b->tags; i > 0; i--, t++)
89 DPRINT((" Resetting t%d\n", *t));
90 tre_tag_reset(tags, *t);
93 if (b->n_last_matched > 0)
94 tre_reset_last_matched_branches(tags, b->last_matched,
96 lm->start_tag, reset);
104 #endif /* TRE_DEBUG */
106 for (i = lm->n_branches, b = lm->branches; i > 0; i--, b++)
109 int touch = tre_tag_touch_get(tags, t);
115 #endif /* TRE_DEBUG */
118 DPRINT((" Last touched end tag t%d=%d\n", last, max));
121 for (i = lm->n_branches, b = lm->branches; i > 0; i--, b++)
123 reset = (reset_all || tre_tag_touch_get(tags, b->cmp_tag) < max);
129 for (j = b->n_tags, t = b->tags; j > 0; j--, t++)
131 DPRINT((" Resetting t%d\n", *t));
132 tre_tag_reset(tags, *t);
135 if (b->n_last_matched > 0)
136 tre_reset_last_matched_branches(tags, b->last_matched,
138 lm->start_tag, reset);
145 /* Fills the POSIX.2 regmatch_t array according to the TNFA tag and match
148 tre_fill_pmatch(size_t nmatch, regmatch_t pmatch[], int cflags,
149 const tre_tnfa_t *tnfa, const tre_tag_t *intags, int match_eo)
153 if (cflags & REG_NOSUB) return REG_OK;
156 if (match_eo >= 0 && intags)
158 const tre_tag_t *tags = intags;
159 tre_submatch_data_t *submatch_data;
161 if (tnfa->last_matched_branch &&
162 tnfa->last_matched_branch->n_last_matched > 0)
165 #ifdef TRE_USE_ALLOCA
166 t = alloca(sizeof(*t) * tnfa->num_tags);
167 #else /* !TRE_USE_ALLOCA */
168 t = xmalloc(sizeof(*t) * tnfa->num_tags);
169 #endif /* !TRE_USE_ALLOCA */
170 if (!t) return REG_ESPACE;
171 memcpy(t, intags, tnfa->num_tags * sizeof(tre_tag_t));
172 tre_reset_last_matched_branches(t,
173 tnfa->last_matched_branch->last_matched,
174 tnfa->last_matched_branch->n_last_matched,
178 /* Construct submatch offsets from the tags. */
179 DPRINT(("end tag = t%d = %d\n", tnfa->end_tag, match_eo));
180 submatch_data = tnfa->submatch_data;
181 while (i < tnfa->num_submatches && i < nmatch)
183 if (submatch_data[i].so_tag == tnfa->end_tag)
184 pmatch[i].rm_so = match_eo;
186 pmatch[i].rm_so = tre_tag_get(tags, submatch_data[i].so_tag);
188 if (submatch_data[i].eo_tag == tnfa->end_tag)
189 pmatch[i].rm_eo = match_eo;
191 pmatch[i].rm_eo = tre_tag_get(tags, submatch_data[i].eo_tag);
193 /* If either of the endpoints were not used, this submatch
194 was not part of the match. */
195 if (pmatch[i].rm_so == -1 || pmatch[i].rm_eo == -1)
196 pmatch[i].rm_so = pmatch[i].rm_eo = -1;
198 DPRINT(("pmatch[%d] = {t%d = %qd, t%d = %qd}\n", i,
199 submatch_data[i].so_tag, pmatch[i].rm_so,
200 submatch_data[i].eo_tag, pmatch[i].rm_eo));
203 #ifndef TRE_USE_ALLOCA
204 #pragma GCC diagnostic push
205 #pragma GCC diagnostic ignored "-Wdiscarded-qualifiers"
206 if (tags != intags) xfree(tags);
207 #pragma GCC diagnostic pop
208 #endif /* !TRE_USE_ALLOCA */
213 pmatch[i].rm_so = -1;
214 pmatch[i].rm_eo = -1;
223 Wrapper functions for POSIX compatible regexp matching.
227 tre_have_backrefs(const regex_t *preg)
229 tre_tnfa_t *tnfa = (void *)preg->TRE_REGEX_T_FIELD;
230 return tnfa->have_backrefs;
235 tre_have_approx(const regex_t *preg)
237 tre_tnfa_t *tnfa = (void *)preg->TRE_REGEX_T_FIELD;
238 return tnfa->have_approx;
240 #endif /* TRE_APPROX */
243 tre_match(const tre_tnfa_t *tnfa, const void *string, size_t len,
244 tre_str_type_t type, size_t nmatch, regmatch_t pmatch[],
247 reg_errcode_t status;
248 tre_tag_t *tags = NULL;
250 size_t offset = 0, count = 0;
251 if (tnfa->num_tags > 0 && nmatch > 0)
253 #ifdef TRE_USE_ALLOCA
254 tags = alloca(sizeof(*tags) * tnfa->num_tags);
255 #else /* !TRE_USE_ALLOCA */
256 tags = xmalloc(sizeof(*tags) * tnfa->num_tags);
257 #endif /* !TRE_USE_ALLOCA */
263 (eflags & REG_STARTEND) && pmatch)
265 if (pmatch->rm_so < 0)
267 if (len == (size_t)-1)
269 if (pmatch->rm_eo < 0 || pmatch->rm_so > pmatch->rm_eo)
271 len = pmatch->rm_eo - pmatch->rm_so;
273 count = offset = pmatch->rm_so;
274 if (type == STR_WIDE) offset *= sizeof(wchar_t);
277 /* Dispatch to the appropriate matcher. */
278 if (tnfa->have_backrefs || eflags & REG_BACKTRACKING_MATCHER)
280 /* The regex has back references, use the backtracking matcher. */
281 status = tre_tnfa_run_backtrack(tnfa, string + offset, (int)len, type,
285 else if (tnfa->have_approx || eflags & REG_APPROX_MATCHER)
287 /* The regex uses approximate matching, use the approximate matcher. */
290 tre_regaparams_default(¶ms);
293 status = tre_tnfa_run_approx(tnfa, string + offset, (int)len, type, tags,
294 &match, params, eflags, &eo);
296 #endif /* TRE_APPROX */
299 /* Exact matching, no back references, use the parallel matcher. */
300 status = tre_tnfa_run_parallel(tnfa, string + offset, (int)len, type,
304 if (status == REG_OK)
306 /* A match was found, so fill the submatch registers. */
307 status = tre_fill_pmatch(nmatch, pmatch, tnfa->cflags, tnfa, tags, eo);
308 /* If doing REG_STARTEND, adjust the pmatch array (we can't build
309 this into tre_fill_pmatch, because tre_tnfa_run_backtrack calls
310 tre_fill_pmatch itself). */
311 if (status == REG_OK && !(tnfa->cflags & REG_NOSUB) &&
312 (eflags & REG_STARTEND) && pmatch && nmatch > 0)
316 for (i = nmatch, p = pmatch; i > 0; p++, i--)
318 if (p->rm_so >= 0) p->rm_so += count;
319 if (p->rm_eo >= 0) p->rm_eo += count;
323 #ifndef TRE_USE_ALLOCA
326 #endif /* !TRE_USE_ALLOCA */
331 tre_regnexec(const regex_t *preg, const char *str, size_t len,
332 size_t nmatch, regmatch_t pmatch[], int eflags)
334 tre_tnfa_t *tnfa = (void *)preg->TRE_REGEX_T_FIELD;
335 tre_str_type_t type = (TRE_MB_CUR_MAX_L(tnfa->loc) == 1) ? STR_BYTE : STR_MBS;
337 #ifdef TRE_USE_SYSTEM_REGEX_H
338 if (preg->re_magic != RE_MAGIC) return REG_BADPAT;
339 #endif /* TRE_USE_SYSTEM_REGEX_H */
341 return tre_match(tnfa, str, len, type, nmatch, pmatch, eflags);
345 tre_regexec(const regex_t *preg, const char *str,
346 size_t nmatch, regmatch_t pmatch[], int eflags)
348 return tre_regnexec(preg, str, (size_t)-1, nmatch, pmatch, eflags);
355 tre_regwnexec(const regex_t *preg, const wchar_t *str, size_t len,
356 size_t nmatch, regmatch_t pmatch[], int eflags)
358 tre_tnfa_t *tnfa = (void *)preg->TRE_REGEX_T_FIELD;
360 #ifdef TRE_USE_SYSTEM_REGEX_H
361 if (preg->re_magic != RE_MAGIC) return REG_BADPAT;
362 #endif /* TRE_USE_SYSTEM_REGEX_H */
364 return tre_match(tnfa, str, len, STR_WIDE, nmatch, pmatch, eflags);
368 tre_regwexec(const regex_t *preg, const wchar_t *str,
369 size_t nmatch, regmatch_t pmatch[], int eflags)
371 return tre_regwnexec(preg, str, (size_t)-1, nmatch, pmatch, eflags);
374 #endif /* TRE_WCHAR */
379 Wrapper functions for approximate regexp matching.
383 tre_match_approx(const tre_tnfa_t *tnfa, const void *string, size_t len,
384 tre_str_type_t type, regamatch_t *match, regaparams_t params,
387 reg_errcode_t status;
388 tre_tag_t *tags = NULL;
390 size_t offset = 0, count = 0;
392 /* If the regexp does not use approximate matching features, the
393 maximum cost is zero, and the approximate matcher isn't forced,
394 use the exact matcher instead. */
395 if (params.max_cost == 0 && !tnfa->have_approx
396 && !(eflags & REG_APPROX_MATCHER))
397 return tre_match(tnfa, string, len, type, match->nmatch, match->pmatch,
400 /* Back references are not supported by the approximate matcher. */
401 if (tnfa->have_backrefs)
404 if (tnfa->num_tags > 0 && match->nmatch > 0)
407 tags = alloca(sizeof(*tags) * tnfa->num_tags);
408 #else /* !TRE_USE_ALLOCA */
409 tags = xmalloc(sizeof(*tags) * tnfa->num_tags);
410 #endif /* !TRE_USE_ALLOCA */
416 (eflags & REG_STARTEND) && match->pmatch)
418 if (match->pmatch->rm_so < 0)
420 if (len == (size_t)-1)
422 if (match->pmatch->rm_eo < 0 || match->pmatch->rm_so >
423 match->pmatch->rm_eo)
425 len = match->pmatch->rm_eo - match->pmatch->rm_so;
427 count = offset = match->pmatch->rm_so;
428 if (type == STR_WIDE) offset *= sizeof(wchar_t);
431 status = tre_tnfa_run_approx(tnfa, string, (int)len, type, tags,
432 match, params, eflags, &eo);
433 if (status == REG_OK)
435 status = tre_fill_pmatch(match->nmatch, match->pmatch, tnfa->cflags,
437 /* If doing REG_STARTEND, adjust the pmatch array (we can't build
438 this into tre_fill_pmatch, because tre_tnfa_run_backtrack call
439 tre_fill_pmatch itself). */
440 if (status == REG_OK && !(tnfa->cflags & REG_NOSUB) &&
441 (eflags & REG_STARTEND) && match->pmatch && match->nmatch > 0)
445 for (i = match->nmatch, p = match->pmatch; i > 0; p++, i--)
447 if (p->rm_so >= 0) p->rm_so += count;
448 if (p->rm_eo >= 0) p->rm_eo += count;
452 #ifndef TRE_USE_ALLOCA
455 #endif /* !TRE_USE_ALLOCA */
460 tre_reganexec(const regex_t *preg, const char *str, size_t len,
461 regamatch_t *match, regaparams_t params, int eflags)
463 tre_tnfa_t *tnfa = (void *)preg->TRE_REGEX_T_FIELD;
464 tre_str_type_t type = (TRE_MB_CUR_MAX_L(tnfa->loc) == 1) ? STR_BYTE : STR_MBS;
466 #ifdef TRE_USE_SYSTEM_REGEX_H
467 if (preg->re_magic != RE_MAGIC) return REG_BADPAT;
468 #endif /* TRE_USE_SYSTEM_REGEX_H */
470 return tre_match_approx(tnfa, str, len, type, match, params, eflags);
474 tre_regaexec(const regex_t *preg, const char *str,
475 regamatch_t *match, regaparams_t params, int eflags)
477 return tre_reganexec(preg, str, (size_t)-1, match, params, eflags);
483 tre_regawnexec(const regex_t *preg, const wchar_t *str, size_t len,
484 regamatch_t *match, regaparams_t params, int eflags)
486 tre_tnfa_t *tnfa = (void *)preg->TRE_REGEX_T_FIELD;
488 #ifdef TRE_USE_SYSTEM_REGEX_H
489 if (preg->re_magic != RE_MAGIC) return REG_BADPAT;
490 #endif /* TRE_USE_SYSTEM_REGEX_H */
492 return tre_match_approx(tnfa, str, len, STR_WIDE,
493 match, params, eflags);
497 tre_regawexec(const regex_t *preg, const wchar_t *str,
498 regamatch_t *match, regaparams_t params, int eflags)
500 return tre_regawnexec(preg, str, (size_t)-1, match, params, eflags);
503 #endif /* TRE_WCHAR */
506 tre_regaparams_default(regaparams_t *params)
508 memset(params, 0, sizeof(*params));
509 params->cost_ins = 1;
510 params->cost_del = 1;
511 params->cost_subst = 1;
512 params->max_cost = INT_MAX;
513 params->max_ins = INT_MAX;
514 params->max_del = INT_MAX;
515 params->max_subst = INT_MAX;
516 params->max_err = INT_MAX;
519 #endif /* TRE_APPROX */