• Home
  • Raw
  • Download

Lines Matching refs:Idx

51 static Idx duplicate_node (re_dfa_t *dfa, Idx org_idx, unsigned int constraint);
52 static Idx search_duplicated_node (const re_dfa_t *dfa, Idx org_node,
56 Idx node, bool root);
58 static Idx fetch_number (re_string_t *input, re_token_t *token,
66 Idx nest, reg_errcode_t *err);
69 Idx nest, reg_errcode_t *err);
72 Idx nest, reg_errcode_t *err);
75 Idx nest, reg_errcode_t *err);
94 Idx *equiv_class_alloc,
99 Idx *char_class_alloc,
314 Idx node_cnt; in re_compile_fastmap_iter()
318 Idx node = init_state->nodes.elems[node_cnt]; in re_compile_fastmap_iter()
363 Idx i; in re_compile_fastmap_iter()
612 Idx i, j; in free_dfa_content()
980 Idx first, i; in create_initial_state()
999 Idx node_idx = init_nodes.elems[i]; in create_initial_state()
1002 Idx clexp_idx; in create_initial_state()
1018 Idx dest_idx = dfa->edests[node_idx].elems[0]; in create_initial_state()
1062 Idx node; in optimize_utf8()
1146 dfa->nexts = re_malloc (Idx, dfa->nodes_alloc); in analyze()
1147 dfa->org_indices = re_malloc (Idx, dfa->nodes_alloc); in analyze()
1154 dfa->subexp_map = re_malloc (Idx, preg->re_nsub); in analyze()
1157 Idx i; in analyze()
1282 Idx other_idx = node->left->token.opr.idx; in optimize_subexps()
1406 Idx idx = node->node_idx; in link_nfa_nodes()
1421 Idx left, right; in link_nfa_nodes()
1464 duplicate_node_closure (re_dfa_t *dfa, Idx top_org_node, Idx top_clone_node, in duplicate_node_closure()
1465 Idx root_node, unsigned int init_constraint) in duplicate_node_closure()
1467 Idx org_node, clone_node; in duplicate_node_closure()
1472 Idx org_dest, clone_dest; in duplicate_node_closure()
1571 static Idx
1572 search_duplicated_node (const re_dfa_t *dfa, Idx org_node, in search_duplicated_node()
1575 Idx idx; in search_duplicated_node()
1589 static Idx
1590 duplicate_node (re_dfa_t *dfa, Idx org_idx, unsigned int constraint) in duplicate_node()
1592 Idx dup_idx = re_dfa_add_node (dfa, dfa->nodes[org_idx]); in duplicate_node()
1608 Idx src, idx; in calc_inveclosure()
1615 Idx *elems = dfa->eclosures[src].elems; in calc_inveclosure()
1632 Idx node_idx; in calc_eclosure()
1675 calc_eclosure_iter (re_node_set *new_set, re_dfa_t *dfa, Idx node, bool root) in calc_eclosure_iter()
1678 Idx i; in calc_eclosure_iter()
1708 Idx edest = dfa->edests[node].elems[i]; in calc_eclosure_iter()
2136 reg_syntax_t syntax, Idx nest, reg_errcode_t *err) in parse_reg_exp()
2177 reg_syntax_t syntax, Idx nest, reg_errcode_t *err) in parse_branch()
2217 reg_syntax_t syntax, Idx nest, reg_errcode_t *err) in parse_expression()
2433 reg_syntax_t syntax, Idx nest, reg_errcode_t *err) in parse_sub_exp()
2474 Idx i, start, end, start_idx = re_string_cur_idx (regexp); in parse_dup_op()
2576 if ((Idx) -1 < 0 || end != REG_MISSING) in parse_dup_op()
2614 build_range_exp (bitset_t sbcset, re_charset_t *mbcset, Idx *range_alloc, in build_range_exp()
2672 Idx new_nranges; in build_range_exp()
2736 re_charset_t *mbcset, Idx *coll_sym_alloc, in build_collating_symbol()
2880 Idx *range_alloc; in parse_bracket_exp()
2915 Idx new_nranges; in parse_bracket_exp()
2963 Idx *coll_sym_alloc; in parse_bracket_exp()
2995 Idx new_coll_sym_alloc = 2 * mbcset->ncoll_syms + 1; in parse_bracket_exp()
3025 Idx coll_sym_alloc = 0, range_alloc = 0, mbchar_alloc = 0; in parse_bracket_exp()
3026 Idx equiv_class_alloc = 0, char_class_alloc = 0; in parse_bracket_exp()
3402 Idx *equiv_class_alloc, const unsigned char *name) in build_equiv_class()
3463 Idx new_equiv_class_alloc = 2 * mbcset->nequiv_classes + 1; in build_equiv_class()
3494 re_charset_t *mbcset, Idx *char_class_alloc, in build_charclass()
3516 Idx new_char_class_alloc = 2 * mbcset->nchar_classes + 1; in build_charclass()
3583 Idx alloc = 0; in build_charclass_op()
3687 static Idx
3690 Idx num = REG_MISSING; in fetch_number()
3778 Idx idx = (Idx) (intptr_t) extra; in mark_opt_subexp()
3779 assert(sizeof(void*) >= sizeof(Idx)); in mark_opt_subexp()