Lines Matching refs:idx
1029 && clexp_node->opr.idx == dfa->nodes[node_idx].opr.idx) in create_initial_state()
1297 int idx = node->token.opr.idx; in optimize_subexps() local
1298 node->token.opr.idx = dfa->subexp_map[idx]; in optimize_subexps()
1299 dfa->used_bkref_map |= 1 << node->token.opr.idx; in optimize_subexps()
1305 Idx other_idx = node->left->token.opr.idx; in optimize_subexps()
1311 dfa->subexp_map[other_idx] = dfa->subexp_map[node->token.opr.idx]; in optimize_subexps()
1356 && (node->token.opr.idx >= BITSET_WORD_BITS in lower_subexp()
1358 & ((bitset_word_t) 1 << node->token.opr.idx)))) in lower_subexp()
1374 op->token.opr.idx = cls->token.opr.idx = node->token.opr.idx; in lower_subexp()
1430 Idx idx = node->node_idx; in link_nfa_nodes() local
1457 err = re_node_set_init_2 (dfa->edests + idx, left, right); in link_nfa_nodes()
1464 err = re_node_set_init_1 (dfa->edests + idx, node->next->node_idx); in link_nfa_nodes()
1468 dfa->nexts[idx] = node->next->node_idx; in link_nfa_nodes()
1470 err = re_node_set_init_1 (dfa->edests + idx, dfa->nexts[idx]); in link_nfa_nodes()
1475 dfa->nexts[idx] = node->next->node_idx; in link_nfa_nodes()
1597 Idx idx; in search_duplicated_node() local
1598 for (idx = dfa->nodes_len - 1; dfa->nodes[idx].duplicated && idx > 0; --idx) in search_duplicated_node()
1600 if (org_node == dfa->org_indices[idx] in search_duplicated_node()
1601 && constraint == dfa->nodes[idx].constraint) in search_duplicated_node()
1602 return idx; /* Found. */ in search_duplicated_node()
1630 Idx src, idx; in calc_inveclosure() local
1632 for (idx = 0; idx < dfa->nodes_len; ++idx) in calc_inveclosure()
1633 re_node_set_init_empty (dfa->inveclosures + idx); in calc_inveclosure()
1638 for (idx = 0; idx < dfa->eclosures[src].nelem; ++idx) in calc_inveclosure()
1640 ok = re_node_set_insert_last (dfa->inveclosures + elems[idx], src); in calc_inveclosure()
1839 token->opr.idx = c2 - '1'; in peek_token()
2292 if (!__glibc_likely (dfa->completed_bkref_map & (1 << token->opr.idx))) in parse_expression()
2297 dfa->used_bkref_map |= 1 << token->opr.idx; in parse_expression()
2515 tree->token.opr.idx = cur_nsub; in parse_sub_exp()
2628 uintptr_t subidx = elem->token.opr.idx; in parse_dup_op()
2851 int32_t idx = symb_table[2 * elem + 1]; in seek_collating_symbol_entry() local
2853 idx += 1 + extra[idx]; in seek_collating_symbol_entry()
2855 name_len == extra[idx] in seek_collating_symbol_entry()
2857 && memcmp (name, &extra[idx + 1], name_len) == 0) in seek_collating_symbol_entry()
2897 int32_t elem, idx; in lookup_collation_sequence_value() local
2905 idx = symb_table[2 * elem + 1]; in lookup_collation_sequence_value()
2907 idx += 1 + extra[idx]; in lookup_collation_sequence_value()
2909 idx += 1 + extra[idx]; in lookup_collation_sequence_value()
2911 idx = (idx + 3) & ~3; in lookup_collation_sequence_value()
2913 idx += sizeof (unsigned int); in lookup_collation_sequence_value()
2915 idx += sizeof (unsigned int) * in lookup_collation_sequence_value()
2916 (1 + *(unsigned int *) (extra + idx)); in lookup_collation_sequence_value()
2918 return *(unsigned int *) (extra + idx); in lookup_collation_sequence_value()
3036 int32_t elem, idx; in build_collating_symbol() local
3045 idx = symb_table[2 * elem + 1]; in build_collating_symbol()
3047 idx += 1 + extra[idx]; in build_collating_symbol()
3075 mbcset->coll_syms[mbcset->ncoll_syms++] = idx; in build_collating_symbol()
3860 Idx idx = (uintptr_t) extra; in mark_opt_subexp() local
3861 if (node->token.type == SUBEXP && node->token.opr.idx == idx) in mark_opt_subexp()