Lines Matching refs:opr
1298 Idx subexp_idx = dfa->nodes[node].opr.idx + 1;
1526 Idx reg_num = dfa->nodes[cur_node].opr.idx + 1;
1537 Idx reg_num = dfa->nodes[cur_node].opr.idx + 1;
1898 subexp_idx = dfa->nodes[ent->node].opr.idx;
1984 if ((boundaries & 1) && subexp_idx == dfa->nodes[node].opr.idx)
1989 if ((boundaries & 2) && subexp_idx == dfa->nodes[node].opr.idx)
2049 subexp_idx = dfa->nodes[ent->node].opr.idx;
2059 && subexp_idx == dfa->nodes[node].opr.idx)
2062 && subexp_idx == dfa->nodes[node].opr.idx)
2104 if (subexp_idx != dfa->nodes[node].opr.idx)
2434 && dfa->nodes[node].opr.idx < BITSET_WORD_BITS
2436 & ((bitset_word) 1 << dfa->nodes[node].opr.idx)))
2691 subexp_num = dfa->nodes[bkref_node].opr.idx;
2701 if (dfa->nodes[sub_top->node].opr.idx != subexp_num)
2858 && node->opr.idx == subexp_idx)
2883 subexp_num = dfa->nodes[top_node].opr.idx;
3174 && dfa->nodes[cur_node].opr.idx == ex_subexp)
3554 bitset_set (accepts, node->opr.c);
3557 bitset_merge (accepts, node->opr.sbcset);
3657 if (type == CHARACTER && !bitset_contain (dests_ch[j], node->opr.c))
3806 const re_charset_t *cset = node->opr.mbcset;
4033 if (node->opr.c != ch)
4038 if (!bitset_contain (node->opr.sbcset, ch))