Idx 48 lib/regcomp.c static Idx duplicate_node (re_dfa_t *dfa, Idx org_idx, unsigned int constraint); Idx 49 lib/regcomp.c static Idx search_duplicated_node (const re_dfa_t *dfa, Idx org_node, Idx 53 lib/regcomp.c Idx node, bool root); Idx 55 lib/regcomp.c static Idx fetch_number (re_string_t *input, re_token_t *token, Idx 63 lib/regcomp.c Idx nest, reg_errcode_t *err); Idx 66 lib/regcomp.c Idx nest, reg_errcode_t *err); Idx 69 lib/regcomp.c Idx nest, reg_errcode_t *err); Idx 72 lib/regcomp.c Idx nest, reg_errcode_t *err); Idx 90 lib/regcomp.c Idx *equiv_class_alloc, Idx 95 lib/regcomp.c Idx *char_class_alloc, Idx 285 lib/regcomp.c Idx node_cnt; Idx 289 lib/regcomp.c Idx node = init_state->nodes.elems[node_cnt]; Idx 331 lib/regcomp.c Idx i; Idx 561 lib/regcomp.c Idx i, j; Idx 963 lib/regcomp.c Idx first, i; Idx 982 lib/regcomp.c Idx node_idx = init_nodes.elems[i]; Idx 985 lib/regcomp.c Idx clexp_idx; Idx 1001 lib/regcomp.c Idx dest_idx = dfa->edests[node_idx].elems[0]; Idx 1048 lib/regcomp.c Idx node; Idx 1131 lib/regcomp.c dfa->nexts = re_malloc (Idx, dfa->nodes_alloc); Idx 1132 lib/regcomp.c dfa->org_indices = re_malloc (Idx, dfa->nodes_alloc); Idx 1139 lib/regcomp.c dfa->subexp_map = re_malloc (Idx, preg->re_nsub); Idx 1142 lib/regcomp.c Idx i; Idx 1267 lib/regcomp.c Idx other_idx = node->left->token.opr.idx; Idx 1392 lib/regcomp.c Idx idx = node->node_idx; Idx 1407 lib/regcomp.c Idx left, right; Idx 1449 lib/regcomp.c duplicate_node_closure (re_dfa_t *dfa, Idx top_org_node, Idx top_clone_node, Idx 1450 lib/regcomp.c Idx root_node, unsigned int init_constraint) Idx 1452 lib/regcomp.c Idx org_node, clone_node; Idx 1457 lib/regcomp.c Idx org_dest, clone_dest; Idx 1555 lib/regcomp.c static Idx Idx 1556 lib/regcomp.c search_duplicated_node (const re_dfa_t *dfa, Idx org_node, Idx 1559 lib/regcomp.c Idx idx; Idx 1573 lib/regcomp.c static Idx Idx 1574 lib/regcomp.c duplicate_node (re_dfa_t *dfa, Idx org_idx, unsigned int constraint) Idx 1576 lib/regcomp.c Idx dup_idx = re_dfa_add_node (dfa, dfa->nodes[org_idx]); Idx 1592 lib/regcomp.c Idx src, idx; Idx 1599 lib/regcomp.c Idx *elems = dfa->eclosures[src].elems; Idx 1616 lib/regcomp.c Idx node_idx; Idx 1655 lib/regcomp.c calc_eclosure_iter (re_node_set *new_set, re_dfa_t *dfa, Idx node, bool root) Idx 1658 lib/regcomp.c Idx i; Idx 1689 lib/regcomp.c Idx edest = dfa->edests[node].elems[i]; Idx 2116 lib/regcomp.c reg_syntax_t syntax, Idx nest, reg_errcode_t *err) Idx 2165 lib/regcomp.c reg_syntax_t syntax, Idx nest, reg_errcode_t *err) Idx 2210 lib/regcomp.c reg_syntax_t syntax, Idx nest, reg_errcode_t *err) Idx 2442 lib/regcomp.c reg_syntax_t syntax, Idx nest, reg_errcode_t *err) Idx 2488 lib/regcomp.c Idx i, start, end, start_idx = re_string_cur_idx (regexp); Idx 2602 lib/regcomp.c if (TYPE_SIGNED (Idx) || end != -1) Idx 2648 lib/regcomp.c build_range_exp (bitset_t sbcset, re_charset_t *mbcset, Idx *range_alloc, Idx 2701 lib/regcomp.c Idx new_nranges; Idx 2749 lib/regcomp.c Idx *coll_sym_alloc, const unsigned char *name, Idx 2871 lib/regcomp.c build_range_exp (bitset_t sbcset, re_charset_t *mbcset, Idx *range_alloc, Idx 2960 lib/regcomp.c Idx *coll_sym_alloc, const unsigned char *name, Idx 3036 lib/regcomp.c Idx coll_sym_alloc = 0, range_alloc = 0, mbchar_alloc = 0; Idx 3037 lib/regcomp.c Idx equiv_class_alloc = 0, char_class_alloc = 0; Idx 3384 lib/regcomp.c Idx *equiv_class_alloc, const unsigned char *name) Idx 3435 lib/regcomp.c Idx new_equiv_class_alloc = 2 * mbcset->nequiv_classes + 1; Idx 3465 lib/regcomp.c re_charset_t *mbcset, Idx *char_class_alloc, Idx 3482 lib/regcomp.c Idx new_char_class_alloc = 2 * mbcset->nchar_classes + 1; Idx 3547 lib/regcomp.c Idx alloc = 0; Idx 3628 lib/regcomp.c static Idx Idx 3631 lib/regcomp.c Idx num = -1; Idx 3716 lib/regcomp.c Idx idx = (uintptr_t) extra; Idx 20 lib/regex_internal.c static void re_string_construct_common (const char *str, Idx len, Idx 32 lib/regex_internal.c Idx new_buf_len); Idx 37 lib/regex_internal.c static unsigned int re_string_context_at (const re_string_t *input, Idx idx, Idx 47 lib/regex_internal.c re_string_allocate (re_string_t *pstr, const char *str, Idx len, Idx init_len, Idx 51 lib/regex_internal.c Idx init_buf_len; Idx 75 lib/regex_internal.c re_string_construct (re_string_t *pstr, const char *str, Idx len, Idx 134 lib/regex_internal.c re_string_realloc_buffers (re_string_t *pstr, Idx new_buf_len) Idx 141 lib/regex_internal.c const size_t max_object_size = MAX (sizeof (wint_t), sizeof (Idx)); Idx 152 lib/regex_internal.c Idx *new_offsets = re_realloc (pstr->offsets, Idx, new_buf_len); Idx 172 lib/regex_internal.c re_string_construct_common (const char *str, Idx len, re_string_t *pstr, Idx 211 lib/regex_internal.c Idx byte_idx, end_idx, remain_len; Idx 275 lib/regex_internal.c Idx src_idx, byte_idx, end_idx, remain_len; Idx 405 lib/regex_internal.c pstr->offsets = re_malloc (Idx, pstr->bufs_len); Idx 488 lib/regex_internal.c static Idx Idx 489 lib/regex_internal.c re_string_skip_chars (re_string_t *pstr, Idx new_raw_idx, wint_t *last_wc) Idx 492 lib/regex_internal.c Idx rawbuf_idx; Idx 501 lib/regex_internal.c Idx remain_len = pstr->raw_len - rawbuf_idx; Idx 531 lib/regex_internal.c Idx char_idx, end_idx; Idx 550 lib/regex_internal.c Idx buf_idx, end_idx; Idx 569 lib/regex_internal.c re_string_reconstruct (re_string_t *pstr, Idx idx, int eflags) Idx 571 lib/regex_internal.c Idx offset; Idx 601 lib/regex_internal.c Idx low = 0, high = pstr->valid_len, mid; Idx 679 lib/regex_internal.c Idx prev_valid_len = pstr->valid_len; Idx 690 lib/regex_internal.c Idx wcs_idx; Idx 720 lib/regex_internal.c Idx mlen = raw + pstr->len - p; Idx 818 lib/regex_internal.c re_string_peek_byte_case (const re_string_t *pstr, Idx idx) Idx 821 lib/regex_internal.c Idx off; Idx 855 lib/regex_internal.c Idx off; Idx 894 lib/regex_internal.c re_string_context_at (const re_string_t *input, Idx idx, int eflags) Idx 907 lib/regex_internal.c Idx wc_idx = idx; Idx 935 lib/regex_internal.c re_node_set_alloc (re_node_set *set, Idx size) Idx 939 lib/regex_internal.c set->elems = re_malloc (Idx, size); Idx 948 lib/regex_internal.c re_node_set_init_1 (re_node_set *set, Idx elem) Idx 952 lib/regex_internal.c set->elems = re_malloc (Idx, 1); Idx 964 lib/regex_internal.c re_node_set_init_2 (re_node_set *set, Idx elem1, Idx elem2) Idx 967 lib/regex_internal.c set->elems = re_malloc (Idx, 2); Idx 1000 lib/regex_internal.c dest->elems = re_malloc (Idx, dest->alloc); Idx 1006 lib/regex_internal.c memcpy (dest->elems, src->elems, src->nelem * sizeof (Idx)); Idx 1022 lib/regex_internal.c Idx i1, i2, is, id, delta, sbase; Idx 1030 lib/regex_internal.c Idx new_alloc = src1->nelem + src2->nelem + dest->alloc; Idx 1031 lib/regex_internal.c Idx *new_elems = re_realloc (dest->elems, Idx, new_alloc); Idx 1100 lib/regex_internal.c memcpy (dest->elems, dest->elems + sbase, delta * sizeof (Idx)); Idx 1113 lib/regex_internal.c Idx i1, i2, id; Idx 1117 lib/regex_internal.c dest->elems = re_malloc (Idx, dest->alloc); Idx 1145 lib/regex_internal.c (src1->nelem - i1) * sizeof (Idx)); Idx 1151 lib/regex_internal.c (src2->nelem - i2) * sizeof (Idx)); Idx 1165 lib/regex_internal.c Idx is, id, sbase, delta; Idx 1170 lib/regex_internal.c Idx new_alloc = 2 * (src->nelem + dest->alloc); Idx 1171 lib/regex_internal.c Idx *new_buffer = re_realloc (dest->elems, Idx, new_alloc); Idx 1185 lib/regex_internal.c memcpy (dest->elems, src->elems, src->nelem * sizeof (Idx)); Idx 1206 lib/regex_internal.c memcpy (dest->elems + sbase, src->elems, (is + 1) * sizeof (Idx)); Idx 1235 lib/regex_internal.c delta * sizeof (Idx)); Idx 1250 lib/regex_internal.c re_node_set_insert (re_node_set *set, Idx elem) Idx 1252 lib/regex_internal.c Idx idx; Idx 1271 lib/regex_internal.c Idx *new_elems; Idx 1273 lib/regex_internal.c new_elems = re_realloc (set->elems, Idx, set->alloc); Idx 1305 lib/regex_internal.c re_node_set_insert_last (re_node_set *set, Idx elem) Idx 1310 lib/regex_internal.c Idx *new_elems; Idx 1312 lib/regex_internal.c new_elems = re_realloc (set->elems, Idx, set->alloc); Idx 1330 lib/regex_internal.c Idx i; Idx 1341 lib/regex_internal.c static Idx Idx 1343 lib/regex_internal.c re_node_set_contains (const re_node_set *set, Idx elem) Idx 1364 lib/regex_internal.c re_node_set_remove_at (re_node_set *set, Idx idx) Idx 1377 lib/regex_internal.c static Idx Idx 1383 lib/regex_internal.c Idx *new_nexts, *new_indices; Idx 1390 lib/regex_internal.c sizeof (Idx))); Idx 1400 lib/regex_internal.c new_nexts = re_realloc (dfa->nexts, Idx, new_nodes_alloc); Idx 1403 lib/regex_internal.c new_indices = re_realloc (dfa->org_indices, Idx, new_nodes_alloc); Idx 1431 lib/regex_internal.c Idx i; Idx 1454 lib/regex_internal.c Idx i; Idx 1502 lib/regex_internal.c Idx i; Idx 1542 lib/regex_internal.c Idx i; Idx 1550 lib/regex_internal.c Idx elem = newstate->nodes.elems[i]; Idx 1559 lib/regex_internal.c Idx new_alloc = 2 * spot->num + 2; Idx 1595 lib/regex_internal.c Idx i; Idx 1643 lib/regex_internal.c Idx i, nctx_nodes = 0; Idx 232 lib/regex_internal.h Idx alloc; Idx 233 lib/regex_internal.h Idx nelem; Idx 234 lib/regex_internal.h Idx *elems; Idx 317 lib/regex_internal.h Idx nmbchars; Idx 320 lib/regex_internal.h Idx ncoll_syms; Idx 323 lib/regex_internal.h Idx nequiv_classes; Idx 326 lib/regex_internal.h Idx nranges; Idx 329 lib/regex_internal.h Idx nchar_classes; Idx 339 lib/regex_internal.h Idx idx; /* for BACK_REF */ Idx 370 lib/regex_internal.h Idx *offsets; Idx 374 lib/regex_internal.h Idx raw_mbs_idx; Idx 376 lib/regex_internal.h Idx valid_len; Idx 378 lib/regex_internal.h Idx valid_raw_len; Idx 380 lib/regex_internal.h Idx bufs_len; Idx 382 lib/regex_internal.h Idx cur_idx; Idx 384 lib/regex_internal.h Idx raw_len; Idx 386 lib/regex_internal.h Idx len; Idx 390 lib/regex_internal.h Idx raw_stop; Idx 392 lib/regex_internal.h Idx stop; Idx 468 lib/regex_internal.h Idx node_idx; Idx 532 lib/regex_internal.h Idx num; Idx 533 lib/regex_internal.h Idx alloc; Idx 541 lib/regex_internal.h Idx next_idx; Idx 542 lib/regex_internal.h Idx alloc; Idx 550 lib/regex_internal.h Idx node; Idx 551 lib/regex_internal.h Idx str_idx; /* The position NODE match at. */ Idx 561 lib/regex_internal.h Idx str_idx; Idx 562 lib/regex_internal.h Idx node; Idx 564 lib/regex_internal.h Idx alasts; /* Allocation size of LASTS. */ Idx 565 lib/regex_internal.h Idx nlasts; /* The number of LASTS. */ Idx 571 lib/regex_internal.h Idx node; Idx 572 lib/regex_internal.h Idx str_idx; Idx 573 lib/regex_internal.h Idx subexp_from; Idx 574 lib/regex_internal.h Idx subexp_to; Idx 587 lib/regex_internal.h Idx match_last; Idx 588 lib/regex_internal.h Idx last_node; Idx 591 lib/regex_internal.h Idx state_log_top; Idx 593 lib/regex_internal.h Idx nbkref_ents; Idx 594 lib/regex_internal.h Idx abkref_ents; Idx 597 lib/regex_internal.h Idx nsub_tops; Idx 598 lib/regex_internal.h Idx asub_tops; Idx 606 lib/regex_internal.h Idx last_node; Idx 607 lib/regex_internal.h Idx last_str_idx; Idx 613 lib/regex_internal.h Idx idx; Idx 614 lib/regex_internal.h Idx node; Idx 621 lib/regex_internal.h Idx num; Idx 622 lib/regex_internal.h Idx alloc; Idx 631 lib/regex_internal.h Idx *nexts; Idx 632 lib/regex_internal.h Idx *org_indices; Idx 648 lib/regex_internal.h Idx init_node; Idx 649 lib/regex_internal.h Idx nbackref; /* The number of backreference in this dfa. */ Idx 666 lib/regex_internal.h Idx *subexp_map; Idx 704 lib/regex_internal.h bitset_set (bitset_t set, Idx i) Idx 710 lib/regex_internal.h bitset_clear (bitset_t set, Idx i) Idx 716 lib/regex_internal.h bitset_contain (const bitset_t set, Idx i) Idx 773 lib/regex_internal.h re_string_char_size_at (const re_string_t *pstr, Idx idx) Idx 786 lib/regex_internal.h re_string_wchar_at (const re_string_t *pstr, Idx idx) Idx 799 lib/regex_internal.h re_string_elem_size_at (const re_string_t *pstr, Idx idx) Idx 21 lib/regexec.c Idx n); Idx 24 lib/regexec.c static reg_errcode_t match_ctx_add_entry (re_match_context_t *cache, Idx node, Idx 25 lib/regexec.c Idx str_idx, Idx from, Idx to); Idx 26 lib/regexec.c static Idx search_cur_bkref_entry (const re_match_context_t *mctx, Idx str_idx); Idx 27 lib/regexec.c static reg_errcode_t match_ctx_add_subtop (re_match_context_t *mctx, Idx node, Idx 28 lib/regexec.c Idx str_idx); Idx 30 lib/regexec.c Idx node, Idx str_idx); Idx 32 lib/regexec.c re_dfastate_t **limited_sts, Idx last_node, Idx 33 lib/regexec.c Idx last_str_idx); Idx 35 lib/regexec.c const char *string, Idx length, Idx 36 lib/regexec.c Idx start, Idx last_start, Idx stop, Idx 40 lib/regexec.c const char *string1, Idx length1, Idx 41 lib/regexec.c const char *string2, Idx length2, Idx 42 lib/regexec.c Idx start, regoff_t range, Idx 44 lib/regexec.c Idx stop, bool ret_len); Idx 46 lib/regexec.c const char *string, Idx length, Idx start, Idx 47 lib/regexec.c regoff_t range, Idx stop, Idx 51 lib/regexec.c Idx nregs, int regs_allocated); Idx 53 lib/regexec.c static Idx check_matching (re_match_context_t *mctx, bool fl_longest_match, Idx 54 lib/regexec.c Idx *p_match_first); Idx 55 lib/regexec.c static Idx check_halt_state_context (const re_match_context_t *mctx, Idx 56 lib/regexec.c const re_dfastate_t *state, Idx idx); Idx 58 lib/regexec.c regmatch_t *prev_idx_match, Idx cur_node, Idx 59 lib/regexec.c Idx cur_idx, Idx nmatch); Idx 61 lib/regexec.c Idx str_idx, Idx dest_node, Idx nregs, Idx 72 lib/regexec.c Idx node_idx, Idx str_idx, Idx max_str_idx); Idx 76 lib/regexec.c re_sift_context_t *sctx, Idx str_idx, Idx 80 lib/regexec.c Idx str_idx, Idx 87 lib/regexec.c Idx dst_node, Idx dst_idx, Idx src_node, Idx 88 lib/regexec.c Idx src_idx); Idx 90 lib/regexec.c int boundaries, Idx subexp_idx, Idx 91 lib/regexec.c Idx from_node, Idx bkref_idx); Idx 93 lib/regexec.c Idx limit, Idx subexp_idx, Idx 94 lib/regexec.c Idx node, Idx str_idx, Idx 95 lib/regexec.c Idx bkref_idx); Idx 101 lib/regexec.c Idx str_idx); Idx 104 lib/regexec.c Idx str_idx, const re_node_set *candidates); Idx 107 lib/regexec.c re_dfastate_t **src, Idx num); Idx 118 lib/regexec.c Idx str_idx); Idx 129 lib/regexec.c Idx bkref_node, Idx bkref_str_idx); Idx 133 lib/regexec.c Idx bkref_node, Idx bkref_str); Idx 134 lib/regexec.c static Idx find_subexp_node (const re_dfa_t *dfa, const re_node_set *nodes, Idx 135 lib/regexec.c Idx subexp_idx, int type); Idx 137 lib/regexec.c state_array_t *path, Idx top_node, Idx 138 lib/regexec.c Idx top_str, Idx last_node, Idx last_str, Idx 141 lib/regexec.c Idx str_idx, Idx 146 lib/regexec.c Idx ex_subexp, int type); Idx 149 lib/regexec.c Idx target, Idx ex_subexp, Idx 152 lib/regexec.c re_node_set *cur_nodes, Idx cur_str, Idx 153 lib/regexec.c Idx subexp_num, int type); Idx 155 lib/regexec.c static int check_node_accept_bytes (const re_dfa_t *dfa, Idx node_idx, Idx 156 lib/regexec.c const re_string_t *input, Idx idx); Idx 161 lib/regexec.c static Idx group_nodes_into_DFAstates (const re_dfa_t *dfa, Idx 166 lib/regexec.c const re_token_t *node, Idx idx); Idx 191 lib/regexec.c Idx start, length; Idx 271 lib/regexec.c re_match (struct re_pattern_buffer *bufp, const char *string, Idx length, Idx 272 lib/regexec.c Idx start, struct re_registers *regs) Idx 281 lib/regexec.c re_search (struct re_pattern_buffer *bufp, const char *string, Idx length, Idx 282 lib/regexec.c Idx start, regoff_t range, struct re_registers *regs) Idx 292 lib/regexec.c re_match_2 (struct re_pattern_buffer *bufp, const char *string1, Idx length1, Idx 293 lib/regexec.c const char *string2, Idx length2, Idx start, Idx 294 lib/regexec.c struct re_registers *regs, Idx stop) Idx 304 lib/regexec.c re_search_2 (struct re_pattern_buffer *bufp, const char *string1, Idx length1, Idx 305 lib/regexec.c const char *string2, Idx length2, Idx start, regoff_t range, Idx 306 lib/regexec.c struct re_registers *regs, Idx stop) Idx 317 lib/regexec.c Idx length1, const char *string2, Idx length2, Idx start, Idx 319 lib/regexec.c Idx stop, bool ret_len) Idx 323 lib/regexec.c Idx len; Idx 363 lib/regexec.c re_search_stub (struct re_pattern_buffer *bufp, const char *string, Idx length, Idx 364 lib/regexec.c Idx start, regoff_t range, Idx stop, struct re_registers *regs, Idx 369 lib/regexec.c Idx nregs; Idx 373 lib/regexec.c Idx last_start = start + range; Idx 454 lib/regexec.c re_copy_regs (struct re_registers *regs, regmatch_t *pmatch, Idx nregs, Idx 458 lib/regexec.c Idx i; Idx 459 lib/regexec.c Idx need_regs = nregs + 1; Idx 580 lib/regexec.c re_search_internal (const regex_t *preg, const char *string, Idx length, Idx 581 lib/regexec.c Idx start, Idx last_start, Idx stop, size_t nmatch, Idx 586 lib/regexec.c Idx left_lim, right_lim; Idx 590 lib/regexec.c Idx match_first; Idx 591 lib/regexec.c Idx match_last = -1; Idx 592 lib/regexec.c Idx extra_nmatch; Idx 826 lib/regexec.c Idx reg_idx; Idx 897 lib/regexec.c Idx halt_node, match_last; Idx 989 lib/regexec.c Idx idx) Idx 1028 lib/regexec.c static Idx Idx 1031 lib/regexec.c Idx *p_match_first) Idx 1035 lib/regexec.c Idx match = 0; Idx 1036 lib/regexec.c Idx match_last = -1; Idx 1037 lib/regexec.c Idx cur_str_idx = re_string_cur_idx (&mctx->input); Idx 1040 lib/regexec.c Idx next_start_idx = cur_str_idx; Idx 1092 lib/regexec.c Idx next_char_idx = re_string_cur_idx (&mctx->input) + 1; Idx 1162 lib/regexec.c check_halt_node_context (const re_dfa_t *dfa, Idx node, unsigned int context) Idx 1179 lib/regexec.c static Idx Idx 1181 lib/regexec.c const re_dfastate_t *state, Idx idx) Idx 1183 lib/regexec.c Idx i; Idx 1198 lib/regexec.c static Idx Idx 1199 lib/regexec.c proceed_next_node (const re_match_context_t *mctx, Idx nregs, regmatch_t *regs, Idx 1201 lib/regexec.c Idx *pidx, Idx node, re_node_set *eps_via_nodes, Idx 1218 lib/regexec.c Idx dest_node = -1; Idx 1219 lib/regexec.c for (Idx i = 0; i < edests->nelem; i++) Idx 1221 lib/regexec.c Idx candidate = edests->elems[i]; Idx 1248 lib/regexec.c Idx naccepted = 0; Idx 1255 lib/regexec.c Idx subexp_idx = dfa->nodes[node].opr.idx + 1; Idx 1277 lib/regexec.c Idx dest_node; Idx 1291 lib/regexec.c Idx dest_node = dfa->nexts[node]; Idx 1306 lib/regexec.c push_fail_stack (struct re_fail_stack_t *fs, Idx str_idx, Idx dest_node, Idx 1307 lib/regexec.c Idx nregs, regmatch_t *regs, regmatch_t *prevregs, Idx 1311 lib/regexec.c Idx num = fs->num; Idx 1334 lib/regexec.c static Idx Idx 1335 lib/regexec.c pop_fail_stack (struct re_fail_stack_t *fs, Idx *pidx, Idx nregs, Idx 1341 lib/regexec.c Idx num = --fs->num; Idx 1369 lib/regexec.c Idx idx, cur_node; Idx 1407 lib/regexec.c Idx reg_idx; Idx 1462 lib/regexec.c Idx fs_idx; Idx 1475 lib/regexec.c regmatch_t *prev_idx_match, Idx cur_node, Idx cur_idx, Idx nmatch) Idx 1480 lib/regexec.c Idx reg_num = dfa->nodes[cur_node].opr.idx + 1; Idx 1492 lib/regexec.c Idx reg_num = dfa->nodes[cur_node].opr.idx + 1; Idx 1549 lib/regexec.c Idx str_idx = sctx->last_str_idx; Idx 1602 lib/regexec.c Idx str_idx, re_node_set *cur_dest) Idx 1606 lib/regexec.c Idx i; Idx 1617 lib/regexec.c Idx prev_node = cur_src->elems[i]; Idx 1640 lib/regexec.c Idx to_idx = str_idx + naccepted; Idx 1657 lib/regexec.c clean_state_log_if_needed (re_match_context_t *mctx, Idx next_state_log_idx) Idx 1659 lib/regexec.c Idx top = mctx->state_log_top; Idx 1684 lib/regexec.c re_dfastate_t **src, Idx num) Idx 1686 lib/regexec.c Idx st_idx; Idx 1710 lib/regexec.c re_sift_context_t *sctx, Idx str_idx, Idx 1761 lib/regexec.c Idx i; Idx 1785 lib/regexec.c sub_epsilon_src_nodes (const re_dfa_t *dfa, Idx node, re_node_set *dest_nodes, Idx 1788 lib/regexec.c Idx ecl_idx; Idx 1795 lib/regexec.c Idx cur_node = inv_eclosure->elems[ecl_idx]; Idx 1800 lib/regexec.c Idx edst1 = dfa->edests[cur_node].elems[0]; Idx 1801 lib/regexec.c Idx edst2 = ((dfa->edests[cur_node].nelem > 1) Idx 1821 lib/regexec.c Idx cur_node = inv_eclosure->elems[ecl_idx]; Idx 1824 lib/regexec.c Idx idx = re_node_set_contains (dest_nodes, cur_node) - 1; Idx 1834 lib/regexec.c Idx dst_node, Idx dst_idx, Idx src_node, Idx src_idx) Idx 1837 lib/regexec.c Idx lim_idx, src_pos, dst_pos; Idx 1839 lib/regexec.c Idx dst_bkref_idx = search_cur_bkref_entry (mctx, dst_idx); Idx 1840 lib/regexec.c Idx src_bkref_idx = search_cur_bkref_entry (mctx, src_idx); Idx 1843 lib/regexec.c Idx subexp_idx; Idx 1869 lib/regexec.c Idx subexp_idx, Idx from_node, Idx bkref_idx) Idx 1873 lib/regexec.c Idx node_idx; Idx 1879 lib/regexec.c Idx node = eclosures->elems[node_idx]; Idx 1888 lib/regexec.c Idx dst; Idx 1949 lib/regexec.c check_dst_limits_calc_pos (const re_match_context_t *mctx, Idx limit, Idx 1950 lib/regexec.c Idx subexp_idx, Idx from_node, Idx str_idx, Idx 1951 lib/regexec.c Idx bkref_idx) Idx 1980 lib/regexec.c struct re_backref_cache_entry *bkref_ents, Idx str_idx) Idx 1983 lib/regexec.c Idx node_idx, lim_idx; Idx 1987 lib/regexec.c Idx subexp_idx; Idx 1997 lib/regexec.c Idx ops_node = -1; Idx 1998 lib/regexec.c Idx cls_node = -1; Idx 2001 lib/regexec.c Idx node = dest_nodes->elems[node_idx]; Idx 2025 lib/regexec.c Idx node = dest_nodes->elems[node_idx]; Idx 2045 lib/regexec.c Idx node = dest_nodes->elems[node_idx]; Idx 2067 lib/regexec.c Idx str_idx, const re_node_set *candidates) Idx 2071 lib/regexec.c Idx node_idx, node; Idx 2073 lib/regexec.c Idx first_idx = search_cur_bkref_entry (mctx, str_idx); Idx 2082 lib/regexec.c Idx enabled_idx; Idx 2097 lib/regexec.c Idx subexp_len; Idx 2098 lib/regexec.c Idx to_idx; Idx 2099 lib/regexec.c Idx dst_node; Idx 2165 lib/regexec.c Idx node_idx, Idx str_idx, Idx max_str_idx) Idx 2252 lib/regexec.c Idx cur_idx = re_string_cur_idx (&mctx->input); Idx 2331 lib/regexec.c Idx max = mctx->state_log_top; Idx 2332 lib/regexec.c Idx cur_str_idx = re_string_cur_idx (&mctx->input); Idx 2357 lib/regexec.c Idx str_idx) Idx 2360 lib/regexec.c Idx node_idx; Idx 2370 lib/regexec.c Idx node = cur_nodes->elems[node_idx]; Idx 2395 lib/regexec.c Idx node_cnt, cur_str_idx = re_string_cur_idx (&mctx->input); Idx 2403 lib/regexec.c Idx cur_node = state->nodes.elems[node_cnt]; Idx 2431 lib/regexec.c Idx i; Idx 2436 lib/regexec.c Idx cur_node_idx = pstate->nodes.elems[i]; Idx 2438 lib/regexec.c Idx dest_idx; Idx 2499 lib/regexec.c Idx i; Idx 2500 lib/regexec.c Idx cur_str_idx = re_string_cur_idx (&mctx->input); Idx 2504 lib/regexec.c Idx dest_str_idx, prev_nelem, bkc_idx; Idx 2505 lib/regexec.c Idx node_idx = nodes->elems[i]; Idx 2534 lib/regexec.c Idx subexp_len; Idx 2607 lib/regexec.c get_subexp (re_match_context_t *mctx, Idx bkref_node, Idx bkref_str_idx) Idx 2610 lib/regexec.c Idx subexp_num, sub_top_idx; Idx 2613 lib/regexec.c Idx cache_idx = search_cur_bkref_entry (mctx, bkref_str_idx); Idx 2632 lib/regexec.c Idx sub_last_idx, sl_str, bkref_str_off; Idx 2690 lib/regexec.c Idx cls_node; Idx 2761 lib/regexec.c re_sub_match_last_t *sub_last, Idx bkref_node, Idx bkref_str) Idx 2764 lib/regexec.c Idx to_idx; Idx 2787 lib/regexec.c static Idx Idx 2789 lib/regexec.c Idx subexp_idx, int type) Idx 2791 lib/regexec.c Idx cls_idx; Idx 2794 lib/regexec.c Idx cls_node = nodes->elems[cls_idx]; Idx 2811 lib/regexec.c check_arrival (re_match_context_t *mctx, state_array_t *path, Idx top_node, Idx 2812 lib/regexec.c Idx top_str, Idx last_node, Idx last_str, int type) Idx 2816 lib/regexec.c Idx subexp_num, backup_cur_idx, str_idx, null_cnt; Idx 2827 lib/regexec.c Idx old_alloc = path->alloc; Idx 2828 lib/regexec.c Idx incr_alloc = last_str + mctx->max_mb_elem_len + 1; Idx 2829 lib/regexec.c Idx new_alloc; Idx 2976 lib/regexec.c check_arrival_add_next_nodes (re_match_context_t *mctx, Idx str_idx, Idx 2981 lib/regexec.c Idx cur_idx; Idx 2988 lib/regexec.c Idx cur_node = cur_nodes->elems[cur_idx]; Idx 2999 lib/regexec.c Idx next_node = dfa->nexts[cur_node]; Idx 3000 lib/regexec.c Idx next_idx = str_idx + naccepted; Idx 3052 lib/regexec.c Idx ex_subexp, int type) Idx 3055 lib/regexec.c Idx idx, outside_node; Idx 3066 lib/regexec.c Idx cur_node = cur_nodes->elems[idx]; Idx 3103 lib/regexec.c Idx target, Idx ex_subexp, int type) Idx 3105 lib/regexec.c Idx cur_node; Idx 3148 lib/regexec.c Idx cur_str, Idx subexp_num, int type) Idx 3152 lib/regexec.c Idx cache_idx_start = search_cur_bkref_entry (mctx, cur_str); Idx 3162 lib/regexec.c Idx to_idx, next_node; Idx 3238 lib/regexec.c Idx i, j; Idx 3242 lib/regexec.c Idx ndests; /* Number of the destination states from 'state'. */ Idx 3292 lib/regexec.c Idx next_node; Idx 3423 lib/regexec.c static Idx Idx 3429 lib/regexec.c Idx i, j, k; Idx 3430 lib/regexec.c Idx ndests; /* Number of the destinations from 'state'. */ Idx 3612 lib/regexec.c check_node_accept_bytes (const re_dfa_t *dfa, Idx node_idx, Idx 3613 lib/regexec.c const re_string_t *input, Idx str_idx) Idx 3617 lib/regexec.c Idx i; Idx 3696 lib/regexec.c Idx j; Idx 3901 lib/regexec.c Idx idx) Idx 4010 lib/regexec.c match_ctx_init (re_match_context_t *mctx, int eflags, Idx n) Idx 4046 lib/regexec.c Idx st_idx; Idx 4049 lib/regexec.c Idx sl_idx; Idx 4088 lib/regexec.c match_ctx_add_entry (re_match_context_t *mctx, Idx node, Idx str_idx, Idx from, Idx 4089 lib/regexec.c Idx to) Idx 4135 lib/regexec.c static Idx Idx 4136 lib/regexec.c search_cur_bkref_entry (const re_match_context_t *mctx, Idx str_idx) Idx 4138 lib/regexec.c Idx left, right, mid, last; Idx 4159 lib/regexec.c match_ctx_add_subtop (re_match_context_t *mctx, Idx node, Idx str_idx) Idx 4165 lib/regexec.c Idx new_asub_tops = mctx->asub_tops * 2; Idx 4187 lib/regexec.c match_ctx_add_sublast (re_sub_match_top_t *subtop, Idx node, Idx str_idx) Idx 4192 lib/regexec.c Idx new_alasts = 2 * subtop->alasts + 1; Idx 4214 lib/regexec.c re_dfastate_t **limited_sts, Idx last_node, Idx last_str_idx)