Idx 50 lib/regcomp.c static Idx duplicate_node (re_dfa_t *dfa, Idx org_idx, unsigned int constraint); Idx 51 lib/regcomp.c static Idx search_duplicated_node (const re_dfa_t *dfa, Idx org_node, Idx 57 lib/regcomp.c static Idx fetch_number (re_string_t *input, re_token_t *token, Idx 313 lib/regcomp.c Idx node_cnt; Idx 317 lib/regcomp.c Idx node = init_state->nodes.elems[node_cnt]; Idx 362 lib/regcomp.c Idx i; Idx 611 lib/regcomp.c Idx i, j; Idx 984 lib/regcomp.c Idx first, i; Idx 1003 lib/regcomp.c Idx node_idx = init_nodes.elems[i]; Idx 1006 lib/regcomp.c Idx clexp_idx; Idx 1022 lib/regcomp.c Idx dest_idx = dfa->edests[node_idx].elems[0]; Idx 1069 lib/regcomp.c Idx node; Idx 1153 lib/regcomp.c dfa->nexts = re_malloc (Idx, dfa->nodes_alloc); Idx 1154 lib/regcomp.c dfa->org_indices = re_malloc (Idx, dfa->nodes_alloc); Idx 1161 lib/regcomp.c dfa->subexp_map = re_malloc (Idx, preg->re_nsub); Idx 1164 lib/regcomp.c Idx i; Idx 1289 lib/regcomp.c Idx other_idx = node->left->token.opr.idx; Idx 1413 lib/regcomp.c Idx idx = node->node_idx; Idx 1428 lib/regcomp.c Idx left, right; Idx 1474 lib/regcomp.c Idx org_node, clone_node; Idx 1479 lib/regcomp.c Idx org_dest, clone_dest; Idx 1577 lib/regcomp.c static Idx Idx 1581 lib/regcomp.c Idx idx; Idx 1595 lib/regcomp.c static Idx Idx 1598 lib/regcomp.c Idx dup_idx = re_dfa_add_node (dfa, dfa->nodes[org_idx]); Idx 1614 lib/regcomp.c Idx src, idx; Idx 1621 lib/regcomp.c Idx *elems = dfa->eclosures[src].elems; Idx 1638 lib/regcomp.c Idx node_idx; Idx 1684 lib/regcomp.c Idx i; Idx 1713 lib/regcomp.c Idx edest = dfa->edests[node].elems[i]; Idx 2481 lib/regcomp.c Idx i, start, end, start_idx = re_string_cur_idx (regexp); Idx 2588 lib/regcomp.c if (TYPE_SIGNED (Idx) || end != REG_MISSING) Idx 2692 lib/regcomp.c Idx new_nranges; Idx 2902 lib/regcomp.c Idx *range_alloc; Idx 2937 lib/regcomp.c Idx new_nranges; Idx 2985 lib/regcomp.c Idx *coll_sym_alloc; Idx 3017 lib/regcomp.c Idx new_coll_sym_alloc = 2 * mbcset->ncoll_syms + 1; Idx 3047 lib/regcomp.c Idx coll_sym_alloc = 0, range_alloc = 0, mbchar_alloc = 0; Idx 3048 lib/regcomp.c Idx equiv_class_alloc = 0, char_class_alloc = 0; Idx 3491 lib/regcomp.c Idx new_equiv_class_alloc = 2 * mbcset->nequiv_classes + 1; Idx 3544 lib/regcomp.c Idx new_char_class_alloc = 2 * mbcset->nchar_classes + 1; Idx 3611 lib/regcomp.c Idx alloc = 0; Idx 3715 lib/regcomp.c static Idx Idx 3718 lib/regcomp.c Idx num = REG_MISSING; Idx 3806 lib/regcomp.c Idx idx = (Idx) (long) extra; Idx 47 lib/regex_internal.c Idx init_buf_len; Idx 142 lib/regex_internal.c 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 215 lib/regex_internal.c Idx byte_idx, end_idx, remain_len; Idx 277 lib/regex_internal.c Idx src_idx, byte_idx, end_idx, remain_len; Idx 406 lib/regex_internal.c pstr->offsets = re_malloc (Idx, pstr->bufs_len); Idx 488 lib/regex_internal.c static Idx Idx 493 lib/regex_internal.c Idx rawbuf_idx; Idx 502 lib/regex_internal.c Idx remain_len; Idx 534 lib/regex_internal.c Idx char_idx, end_idx; Idx 557 lib/regex_internal.c Idx buf_idx, end_idx; Idx 578 lib/regex_internal.c Idx offset; Idx 611 lib/regex_internal.c Idx low = 0, high = pstr->valid_len, mid; Idx 695 lib/regex_internal.c Idx prev_valid_len = pstr->valid_len; Idx 708 lib/regex_internal.c Idx wcs_idx; Idx 738 lib/regex_internal.c Idx mlen = raw + pstr->len - p; Idx 842 lib/regex_internal.c Idx off; Idx 884 lib/regex_internal.c Idx off; Idx 942 lib/regex_internal.c Idx wc_idx = idx; Idx 977 lib/regex_internal.c set->elems = re_malloc (Idx, size); Idx 989 lib/regex_internal.c set->elems = re_malloc (Idx, 1); Idx 1004 lib/regex_internal.c set->elems = re_malloc (Idx, 2); Idx 1037 lib/regex_internal.c dest->elems = re_malloc (Idx, dest->alloc); Idx 1043 lib/regex_internal.c memcpy (dest->elems, src->elems, src->nelem * sizeof (Idx)); Idx 1059 lib/regex_internal.c Idx i1, i2, is, id, delta, sbase; Idx 1067 lib/regex_internal.c Idx new_alloc = src1->nelem + src2->nelem + dest->alloc; Idx 1068 lib/regex_internal.c Idx *new_elems = re_realloc (dest->elems, Idx, new_alloc); Idx 1137 lib/regex_internal.c memcpy (dest->elems, dest->elems + sbase, delta * sizeof (Idx)); Idx 1150 lib/regex_internal.c Idx i1, i2, id; Idx 1154 lib/regex_internal.c dest->elems = re_malloc (Idx, dest->alloc); Idx 1182 lib/regex_internal.c (src1->nelem - i1) * sizeof (Idx)); Idx 1188 lib/regex_internal.c (src2->nelem - i2) * sizeof (Idx)); Idx 1202 lib/regex_internal.c Idx is, id, sbase, delta; Idx 1207 lib/regex_internal.c Idx new_alloc = 2 * (src->nelem + dest->alloc); Idx 1208 lib/regex_internal.c Idx *new_buffer = re_realloc (dest->elems, Idx, new_alloc); Idx 1218 lib/regex_internal.c memcpy (dest->elems, src->elems, src->nelem * sizeof (Idx)); Idx 1240 lib/regex_internal.c memcpy (dest->elems + sbase, src->elems, (is + 1) * sizeof (Idx)); Idx 1269 lib/regex_internal.c delta * sizeof (Idx)); Idx 1286 lib/regex_internal.c Idx idx; Idx 1302 lib/regex_internal.c Idx *new_elems; Idx 1304 lib/regex_internal.c new_elems = re_realloc (set->elems, Idx, set->alloc); Idx 1341 lib/regex_internal.c Idx *new_elems; Idx 1343 lib/regex_internal.c new_elems = re_realloc (set->elems, Idx, set->alloc); Idx 1361 lib/regex_internal.c Idx i; Idx 1372 lib/regex_internal.c static Idx Idx 1398 lib/regex_internal.c verify (! TYPE_SIGNED (Idx)); Idx 1412 lib/regex_internal.c static Idx Idx 1419 lib/regex_internal.c Idx *new_nexts, *new_indices; Idx 1425 lib/regex_internal.c sizeof (Idx))); Idx 1435 lib/regex_internal.c new_nexts = re_realloc (dfa->nexts, Idx, new_nodes_alloc); Idx 1436 lib/regex_internal.c new_indices = re_realloc (dfa->org_indices, Idx, new_nodes_alloc); Idx 1468 lib/regex_internal.c Idx i; Idx 1491 lib/regex_internal.c Idx i; Idx 1539 lib/regex_internal.c Idx i; Idx 1579 lib/regex_internal.c Idx i; Idx 1587 lib/regex_internal.c Idx elem = newstate->nodes.elems[i]; Idx 1596 lib/regex_internal.c Idx new_alloc = 2 * spot->num + 2; Idx 1632 lib/regex_internal.c Idx i; Idx 1682 lib/regex_internal.c Idx i, nctx_nodes = 0; Idx 131 lib/regex_internal.h #define REG_MISSING ((Idx) -1) Idx 134 lib/regex_internal.h #define REG_ERROR ((Idx) -2) Idx 138 lib/regex_internal.h # define REG_VALID_INDEX(n) ((Idx) (n) < REG_ERROR) Idx 145 lib/regex_internal.h # define REG_VALID_NONZERO_INDEX(n) ((Idx) ((n) - 1) < (Idx) (REG_ERROR - 1)) Idx 223 lib/regex_internal.h Idx alloc; Idx 224 lib/regex_internal.h Idx nelem; Idx 225 lib/regex_internal.h Idx *elems; Idx 311 lib/regex_internal.h Idx nmbchars; Idx 314 lib/regex_internal.h Idx ncoll_syms; Idx 317 lib/regex_internal.h Idx nequiv_classes; Idx 320 lib/regex_internal.h Idx nranges; Idx 323 lib/regex_internal.h Idx nchar_classes; Idx 336 lib/regex_internal.h Idx idx; /* for BACK_REF */ Idx 370 lib/regex_internal.h Idx *offsets; Idx 375 lib/regex_internal.h Idx raw_mbs_idx; Idx 377 lib/regex_internal.h Idx valid_len; Idx 379 lib/regex_internal.h Idx valid_raw_len; Idx 381 lib/regex_internal.h Idx bufs_len; Idx 383 lib/regex_internal.h Idx cur_idx; Idx 385 lib/regex_internal.h Idx raw_len; Idx 387 lib/regex_internal.h Idx len; Idx 391 lib/regex_internal.h Idx raw_stop; Idx 393 lib/regex_internal.h Idx stop; Idx 490 lib/regex_internal.h Idx node_idx; Idx 554 lib/regex_internal.h Idx num; Idx 555 lib/regex_internal.h Idx alloc; Idx 563 lib/regex_internal.h Idx next_idx; Idx 564 lib/regex_internal.h Idx alloc; Idx 572 lib/regex_internal.h Idx node; Idx 573 lib/regex_internal.h Idx str_idx; /* The position NODE match at. */ Idx 583 lib/regex_internal.h Idx str_idx; Idx 584 lib/regex_internal.h Idx node; Idx 586 lib/regex_internal.h Idx alasts; /* Allocation size of LASTS. */ Idx 587 lib/regex_internal.h Idx nlasts; /* The number of LASTS. */ Idx 593 lib/regex_internal.h Idx node; Idx 594 lib/regex_internal.h Idx str_idx; Idx 595 lib/regex_internal.h Idx subexp_from; Idx 596 lib/regex_internal.h Idx subexp_to; Idx 614 lib/regex_internal.h Idx match_last; Idx 615 lib/regex_internal.h Idx last_node; Idx 618 lib/regex_internal.h Idx state_log_top; Idx 620 lib/regex_internal.h Idx nbkref_ents; Idx 621 lib/regex_internal.h Idx abkref_ents; Idx 624 lib/regex_internal.h Idx nsub_tops; Idx 625 lib/regex_internal.h Idx asub_tops; Idx 633 lib/regex_internal.h Idx last_node; Idx 634 lib/regex_internal.h Idx last_str_idx; Idx 640 lib/regex_internal.h Idx idx; Idx 641 lib/regex_internal.h Idx node; Idx 648 lib/regex_internal.h Idx num; Idx 649 lib/regex_internal.h Idx alloc; Idx 658 lib/regex_internal.h Idx *nexts; Idx 659 lib/regex_internal.h Idx *org_indices; Idx 675 lib/regex_internal.h Idx init_node; Idx 676 lib/regex_internal.h Idx nbackref; /* The number of backreference in this dfa. */ Idx 693 lib/regex_internal.h Idx *subexp_map; Idx 235 lib/regexec.c Idx start, length; Idx 381 lib/regexec.c Idx len = length1 + length2; Idx 384 lib/regexec.c verify (! TYPE_SIGNED (Idx)); Idx 431 lib/regexec.c Idx nregs; Idx 437 lib/regexec.c Idx last_start = start + range; Idx 440 lib/regexec.c verify (! TYPE_SIGNED (Idx)); Idx 524 lib/regexec.c Idx i; Idx 525 lib/regexec.c Idx need_regs = nregs + 1; Idx 658 lib/regexec.c Idx left_lim, right_lim; Idx 662 lib/regexec.c Idx match_first; Idx 663 lib/regexec.c Idx match_last = REG_MISSING; Idx 664 lib/regexec.c Idx extra_nmatch; Idx 913 lib/regexec.c Idx reg_idx; Idx 988 lib/regexec.c Idx halt_node, match_last; Idx 1121 lib/regexec.c static Idx Idx 1128 lib/regexec.c Idx match = 0; Idx 1129 lib/regexec.c Idx match_last = REG_MISSING; Idx 1130 lib/regexec.c Idx cur_str_idx = re_string_cur_idx (&mctx->input); Idx 1133 lib/regexec.c Idx next_start_idx = cur_str_idx; Idx 1185 lib/regexec.c Idx next_char_idx = re_string_cur_idx (&mctx->input) + 1; Idx 1272 lib/regexec.c static Idx Idx 1277 lib/regexec.c Idx i; Idx 1294 lib/regexec.c static Idx Idx 1301 lib/regexec.c Idx i; Idx 1307 lib/regexec.c Idx dest_node; Idx 1315 lib/regexec.c Idx candidate = edests->elems[i]; Idx 1342 lib/regexec.c Idx naccepted = 0; Idx 1352 lib/regexec.c Idx subexp_idx = dfa->nodes[node].opr.idx + 1; Idx 1369 lib/regexec.c Idx dest_node; Idx 1383 lib/regexec.c Idx dest_node = dfa->nexts[node]; Idx 1402 lib/regexec.c Idx num = fs->num++; Idx 1423 lib/regexec.c static Idx Idx 1428 lib/regexec.c Idx num = --fs->num; Idx 1449 lib/regexec.c Idx idx, cur_node; Idx 1493 lib/regexec.c Idx reg_idx; Idx 1556 lib/regexec.c Idx fs_idx; Idx 1575 lib/regexec.c Idx reg_num = dfa->nodes[cur_node].opr.idx + 1; Idx 1586 lib/regexec.c Idx reg_num = dfa->nodes[cur_node].opr.idx + 1; Idx 1645 lib/regexec.c Idx str_idx = sctx->last_str_idx; Idx 1704 lib/regexec.c Idx i; Idx 1715 lib/regexec.c Idx prev_node = cur_src->elems[i]; Idx 1743 lib/regexec.c Idx to_idx = str_idx + naccepted; Idx 1763 lib/regexec.c Idx top = mctx->state_log_top; Idx 1789 lib/regexec.c Idx st_idx; Idx 1865 lib/regexec.c Idx i; Idx 1893 lib/regexec.c Idx ecl_idx; Idx 1900 lib/regexec.c Idx cur_node = inv_eclosure->elems[ecl_idx]; Idx 1905 lib/regexec.c Idx edst1 = dfa->edests[cur_node].elems[0]; Idx 1906 lib/regexec.c Idx edst2 = ((dfa->edests[cur_node].nelem > 1) Idx 1926 lib/regexec.c Idx cur_node = inv_eclosure->elems[ecl_idx]; Idx 1929 lib/regexec.c Idx idx = re_node_set_contains (dest_nodes, cur_node) - 1; Idx 1943 lib/regexec.c Idx lim_idx, src_pos, dst_pos; Idx 1945 lib/regexec.c Idx dst_bkref_idx = search_cur_bkref_entry (mctx, dst_idx); Idx 1946 lib/regexec.c Idx src_bkref_idx = search_cur_bkref_entry (mctx, src_idx); Idx 1949 lib/regexec.c Idx subexp_idx; Idx 1980 lib/regexec.c Idx node_idx; Idx 1986 lib/regexec.c Idx node = eclosures->elems[node_idx]; Idx 1995 lib/regexec.c Idx dst; Idx 2092 lib/regexec.c Idx node_idx, lim_idx; Idx 2096 lib/regexec.c Idx subexp_idx; Idx 2106 lib/regexec.c Idx ops_node = REG_MISSING; Idx 2107 lib/regexec.c Idx cls_node = REG_MISSING; Idx 2110 lib/regexec.c Idx node = dest_nodes->elems[node_idx]; Idx 2134 lib/regexec.c Idx node = dest_nodes->elems[node_idx]; Idx 2154 lib/regexec.c Idx node = dest_nodes->elems[node_idx]; Idx 2180 lib/regexec.c Idx node_idx, node; Idx 2182 lib/regexec.c Idx first_idx = search_cur_bkref_entry (mctx, str_idx); Idx 2191 lib/regexec.c Idx enabled_idx; Idx 2206 lib/regexec.c Idx subexp_len; Idx 2207 lib/regexec.c Idx to_idx; Idx 2208 lib/regexec.c Idx dst_node; Idx 2367 lib/regexec.c Idx cur_idx = re_string_cur_idx (&mctx->input); Idx 2447 lib/regexec.c Idx max = mctx->state_log_top; Idx 2448 lib/regexec.c Idx cur_str_idx = re_string_cur_idx (&mctx->input); Idx 2477 lib/regexec.c Idx node_idx; Idx 2487 lib/regexec.c Idx node = cur_nodes->elems[node_idx]; Idx 2512 lib/regexec.c Idx node_cnt, cur_str_idx = re_string_cur_idx (&mctx->input); Idx 2520 lib/regexec.c Idx cur_node = state->nodes.elems[node_cnt]; Idx 2550 lib/regexec.c Idx i; Idx 2555 lib/regexec.c Idx cur_node_idx = pstate->nodes.elems[i]; Idx 2557 lib/regexec.c Idx dest_idx; Idx 2621 lib/regexec.c Idx i; Idx 2622 lib/regexec.c Idx cur_str_idx = re_string_cur_idx (&mctx->input); Idx 2626 lib/regexec.c Idx dest_str_idx, prev_nelem, bkc_idx; Idx 2627 lib/regexec.c Idx node_idx = nodes->elems[i]; Idx 2658 lib/regexec.c Idx subexp_len; Idx 2734 lib/regexec.c Idx subexp_num, sub_top_idx; Idx 2737 lib/regexec.c Idx cache_idx = search_cur_bkref_entry (mctx, bkref_str_idx); Idx 2756 lib/regexec.c Idx sub_last_idx, sl_str, bkref_str_off; Idx 2813 lib/regexec.c Idx cls_node; Idx 2885 lib/regexec.c Idx to_idx; Idx 2908 lib/regexec.c static Idx Idx 2913 lib/regexec.c Idx cls_idx; Idx 2916 lib/regexec.c Idx cls_node = nodes->elems[cls_idx]; Idx 2937 lib/regexec.c Idx subexp_num, backup_cur_idx, str_idx, null_cnt; Idx 2948 lib/regexec.c Idx old_alloc = path->alloc; Idx 2949 lib/regexec.c Idx new_alloc = old_alloc + last_str + mctx->max_mb_elem_len + 1; Idx 3099 lib/regexec.c Idx cur_idx; Idx 3108 lib/regexec.c Idx cur_node = cur_nodes->elems[cur_idx]; Idx 3122 lib/regexec.c Idx next_node = dfa->nexts[cur_node]; Idx 3123 lib/regexec.c Idx next_idx = str_idx + naccepted; Idx 3179 lib/regexec.c Idx idx, outside_node; Idx 3192 lib/regexec.c Idx cur_node = cur_nodes->elems[idx]; Idx 3231 lib/regexec.c Idx cur_node; Idx 3278 lib/regexec.c Idx cache_idx_start = search_cur_bkref_entry (mctx, cur_str); Idx 3288 lib/regexec.c Idx to_idx, next_node; Idx 3365 lib/regexec.c Idx i, j; Idx 3371 lib/regexec.c Idx ndests; /* Number of the destination states from `state'. */ Idx 3461 lib/regexec.c Idx next_node; Idx 3597 lib/regexec.c static Idx Idx 3604 lib/regexec.c Idx i, j, k; Idx 3605 lib/regexec.c Idx ndests; /* Number of the destinations from `state'. */ Idx 3797 lib/regexec.c Idx i; Idx 3876 lib/regexec.c Idx j; Idx 3976 lib/regexec.c Idx cnt = 0; Idx 4247 lib/regexec.c Idx st_idx; Idx 4250 lib/regexec.c Idx sl_idx; Idx 4337 lib/regexec.c static Idx Idx 4341 lib/regexec.c Idx left, right, mid, last; Idx 4370 lib/regexec.c Idx new_asub_tops = mctx->asub_tops * 2; Idx 4397 lib/regexec.c Idx new_alasts = 2 * subtop->alasts + 1;