diff options
author | Paul Eggert <eggert@cs.ucla.edu> | 2021-08-26 10:08:00 -0700 |
---|---|---|
committer | Paul Eggert <eggert@cs.ucla.edu> | 2021-08-26 15:44:40 -0700 |
commit | 56b322516f8471584c8c67d2f749ae635560eeca (patch) | |
tree | bf63b196435c09a51e448097fcb41be365f71d2f /lib/regexec.c | |
parent | 8fb3a827a2635915a9baa3926e6be6fad7b9ab2d (diff) | |
download | gnulib-56b322516f8471584c8c67d2f749ae635560eeca.tar.gz |
regex: use C99-style array arg syntax
This should help with some static checking.
Derived from a suggestion by Martin Sebor in:
https://sourceware.org/pipermail/libc-alpha/2021-August/130336.html
This also ports recent and relevant Glibc changes to Gnulib
and prepares to copy back.
* lib/cdefs.h (__ARG_NELTS): New macro.
* lib/regex.c: Ignore -Wvla for the whole file.
* lib/regex.h (_ARG_NELTS_, _Attr_access_): New macros.
Ignore -Wvla when declaring regexec.
* lib/regex.h (re_compile_pattern, re_search, re_search_2)
(re_match, re_match_2, regcomp, regerror):
Use _Attr_access_ where that could help static checking.
* lib/regexec.c (regexec, __compat_regexec, re_copy_regs)
(re_search_internal, proceed_next_node, push_fail_stack)
(pop_fail_stack, set_regs, update_regs):
Use __ARG_NELTS for each array parameter whose size is another arg,
but which might be null.
Diffstat (limited to 'lib/regexec.c')
-rw-r--r-- | lib/regexec.c | 78 |
1 files changed, 44 insertions, 34 deletions
diff --git a/lib/regexec.c b/lib/regexec.c index 5e4eb497a6..da1fb7fafa 100644 --- a/lib/regexec.c +++ b/lib/regexec.c @@ -31,11 +31,11 @@ static re_sub_match_last_t * match_ctx_add_sublast (re_sub_match_top_t *subtop, static void sift_ctx_init (re_sift_context_t *sctx, re_dfastate_t **sifted_sts, re_dfastate_t **limited_sts, Idx last_node, Idx last_str_idx); -static reg_errcode_t re_search_internal (const regex_t *preg, - const char *string, Idx length, - Idx start, Idx last_start, Idx stop, - size_t nmatch, regmatch_t pmatch[], - int eflags); +static reg_errcode_t +re_search_internal (const regex_t *preg, const char *string, Idx length, + Idx start, Idx last_start, Idx stop, size_t nmatch, + regmatch_t pmatch[__ARG_NELTS (static nmatch)], + int eflags); static regoff_t re_search_2_stub (struct re_pattern_buffer *bufp, const char *string1, Idx length1, const char *string2, Idx length2, @@ -47,23 +47,29 @@ static regoff_t re_search_stub (struct re_pattern_buffer *bufp, regoff_t range, Idx stop, struct re_registers *regs, bool ret_len); -static unsigned re_copy_regs (struct re_registers *regs, regmatch_t *pmatch, - Idx nregs, int regs_allocated); +static unsigned re_copy_regs (struct re_registers *regs, Idx nregs, + regmatch_t pmatch[__ARG_NELTS (static nregs)], + int regs_allocated); static reg_errcode_t prune_impossible_nodes (re_match_context_t *mctx); static Idx check_matching (re_match_context_t *mctx, bool fl_longest_match, Idx *p_match_first); static Idx check_halt_state_context (const re_match_context_t *mctx, const re_dfastate_t *state, Idx idx); -static void update_regs (const re_dfa_t *dfa, regmatch_t *pmatch, - regmatch_t *prev_idx_match, Idx cur_node, - Idx cur_idx, Idx nmatch); -static reg_errcode_t push_fail_stack (struct re_fail_stack_t *fs, - Idx str_idx, Idx dest_node, Idx nregs, - regmatch_t *regs, regmatch_t *prevregs, - re_node_set *eps_via_nodes); +static void +update_regs (const re_dfa_t *dfa, Idx nmatch, + regmatch_t pmatch[__ARG_NELTS (static nmatch)], + regmatch_t prev_idx_match[__ARG_NELTS (static nmatch)], + Idx cur_node, Idx cur_idx); +static reg_errcode_t +push_fail_stack (struct re_fail_stack_t *fs, + Idx str_idx, Idx dest_node, Idx nregs, + regmatch_t regs[__ARG_NELTS (static nregs)], + regmatch_t prevregs[__ARG_NELTS (static nregs)], + re_node_set *eps_via_nodes); static reg_errcode_t set_regs (const regex_t *preg, const re_match_context_t *mctx, - size_t nmatch, regmatch_t *pmatch, + size_t nmatch, + regmatch_t pmatch[__ARG_NELTS (static nmatch)], bool fl_backtrack); static reg_errcode_t free_fail_stack_return (struct re_fail_stack_t *fs); @@ -191,7 +197,7 @@ static reg_errcode_t extend_buffers (re_match_context_t *mctx, int min_len); int regexec (const regex_t *__restrict preg, const char *__restrict string, - size_t nmatch, regmatch_t pmatch[], int eflags) + size_t nmatch, regmatch_t pmatch[__ARG_NELTS (nmatch)], int eflags) { reg_errcode_t err; Idx start, length; @@ -212,12 +218,8 @@ regexec (const regex_t *__restrict preg, const char *__restrict string, } lock_lock (dfa->lock); - if (preg->no_sub) - err = re_search_internal (preg, string, length, start, length, - length, 0, NULL, eflags); - else - err = re_search_internal (preg, string, length, start, length, - length, nmatch, pmatch, eflags); + err = re_search_internal (preg, string, length, start, length, + length, preg->no_sub ? 0 : nmatch, pmatch, eflags); lock_unlock (dfa->lock); return err != REG_NOERROR; } @@ -235,7 +237,7 @@ int attribute_compat_text_section __compat_regexec (const regex_t *__restrict preg, const char *__restrict string, size_t nmatch, - regmatch_t pmatch[], int eflags) + regmatch_t pmatch[__ARG_NELTS (nmatch)], int eflags) { return regexec (preg, string, nmatch, pmatch, eflags & (REG_NOTBOL | REG_NOTEOL)); @@ -434,7 +436,7 @@ re_search_stub (struct re_pattern_buffer *bufp, const char *string, Idx length, else if (regs != NULL) { /* If caller wants register contents data back, copy them. */ - bufp->regs_allocated = re_copy_regs (regs, pmatch, nregs, + bufp->regs_allocated = re_copy_regs (regs, nregs, pmatch, bufp->regs_allocated); if (__glibc_unlikely (bufp->regs_allocated == REGS_UNALLOCATED)) rval = -2; @@ -457,7 +459,8 @@ re_search_stub (struct re_pattern_buffer *bufp, const char *string, Idx length, } static unsigned -re_copy_regs (struct re_registers *regs, regmatch_t *pmatch, Idx nregs, +re_copy_regs (struct re_registers *regs, Idx nregs, + regmatch_t pmatch[__ARG_NELTS (static nregs)], int regs_allocated) { int rval = REGS_REALLOCATE; @@ -585,7 +588,8 @@ static reg_errcode_t __attribute_warn_unused_result__ re_search_internal (const regex_t *preg, const char *string, Idx length, Idx start, Idx last_start, Idx stop, size_t nmatch, - regmatch_t pmatch[], int eflags) + regmatch_t pmatch[__ARG_NELTS (static nmatch)], + int eflags) { reg_errcode_t err; const re_dfa_t *dfa = preg->buffer; @@ -1210,8 +1214,9 @@ check_halt_state_context (const re_match_context_t *mctx, return -1 on match failure, -2 on error. */ static Idx -proceed_next_node (const re_match_context_t *mctx, Idx nregs, regmatch_t *regs, - regmatch_t *prevregs, +proceed_next_node (const re_match_context_t *mctx, Idx nregs, + regmatch_t regs[__ARG_NELTS (static nregs)], + regmatch_t prevregs[__ARG_NELTS (static nregs)], Idx *pidx, Idx node, re_node_set *eps_via_nodes, struct re_fail_stack_t *fs) { @@ -1321,7 +1326,9 @@ proceed_next_node (const re_match_context_t *mctx, Idx nregs, regmatch_t *regs, static reg_errcode_t __attribute_warn_unused_result__ push_fail_stack (struct re_fail_stack_t *fs, Idx str_idx, Idx dest_node, - Idx nregs, regmatch_t *regs, regmatch_t *prevregs, + Idx nregs, + regmatch_t regs[__ARG_NELTS (static nregs)], + regmatch_t prevregs[__ARG_NELTS (static nregs)], re_node_set *eps_via_nodes) { reg_errcode_t err; @@ -1349,7 +1356,8 @@ push_fail_stack (struct re_fail_stack_t *fs, Idx str_idx, Idx dest_node, static Idx pop_fail_stack (struct re_fail_stack_t *fs, Idx *pidx, Idx nregs, - regmatch_t *regs, regmatch_t *prevregs, + regmatch_t regs[__ARG_NELTS (static nregs)], + regmatch_t prevregs[__ARG_NELTS (static nregs)], re_node_set *eps_via_nodes) { if (fs == NULL || fs->num == 0) @@ -1379,7 +1387,7 @@ pop_fail_stack (struct re_fail_stack_t *fs, Idx *pidx, Idx nregs, static reg_errcode_t __attribute_warn_unused_result__ set_regs (const regex_t *preg, const re_match_context_t *mctx, size_t nmatch, - regmatch_t *pmatch, bool fl_backtrack) + regmatch_t pmatch[__ARG_NELTS (static nmatch)], bool fl_backtrack) { const re_dfa_t *dfa = preg->buffer; Idx idx, cur_node; @@ -1415,7 +1423,7 @@ set_regs (const regex_t *preg, const re_match_context_t *mctx, size_t nmatch, for (idx = pmatch[0].rm_so; idx <= pmatch[0].rm_eo ;) { - update_regs (dfa, pmatch, prev_idx_match, cur_node, idx, nmatch); + update_regs (dfa, nmatch, pmatch, prev_idx_match, cur_node, idx); if ((idx == pmatch[0].rm_eo && cur_node == mctx->last_node) || (fs && re_node_set_contains (&eps_via_nodes, cur_node))) @@ -1487,8 +1495,10 @@ free_fail_stack_return (struct re_fail_stack_t *fs) } static void -update_regs (const re_dfa_t *dfa, regmatch_t *pmatch, - regmatch_t *prev_idx_match, Idx cur_node, Idx cur_idx, Idx nmatch) +update_regs (const re_dfa_t *dfa, Idx nmatch, + regmatch_t pmatch[__ARG_NELTS (static nmatch)], + regmatch_t prev_idx_match[__ARG_NELTS (static nmatch)], + Idx cur_node, Idx cur_idx) { int type = dfa->nodes[cur_node].type; if (type == OP_OPEN_SUBEXP) |