Lines Matching defs:idx
63 const re_dfastate_t *state, Idx idx)
189 const re_string_t *input, Idx idx)
202 const re_token_t *node, Idx idx)
1076 Idx idx)
1082 context = re_string_context_at (&mctx->input, idx - 1, mctx->eflags);
1269 const re_dfastate_t *state, Idx idx)
1276 context = re_string_context_at (&mctx->input, idx, mctx->eflags);
1346 Idx subexp_idx = dfa->nodes[node].opr.idx + 1;
1407 fs->stack[num].idx = str_idx;
1424 *pidx = fs->stack[num].idx;
1443 Idx idx, cur_node;
1481 for (idx = pmatch[0].rm_so; idx <= pmatch[0].rm_eo ;)
1483 update_regs (dfa, pmatch, prev_idx_match, cur_node, idx, nmatch);
1485 if (idx == pmatch[0].rm_eo && cur_node == mctx->last_node)
1500 cur_node = pop_fail_stack (fs, &idx, nmatch, pmatch,
1513 cur_node = proceed_next_node (mctx, nmatch, pmatch, &idx, cur_node,
1527 cur_node = pop_fail_stack (fs, &idx, nmatch, pmatch,
1569 Idx reg_num = dfa->nodes[cur_node].opr.idx + 1;
1580 Idx reg_num = dfa->nodes[cur_node].opr.idx + 1;
1923 Idx idx = re_node_set_contains (dest_nodes, cur_node) - 1;
1924 re_node_set_remove_at (dest_nodes, idx);
1946 subexp_idx = dfa->nodes[ent->node].opr.idx;
2032 if ((boundaries & 1) && subexp_idx == dfa->nodes[node].opr.idx)
2037 if ((boundaries & 2) && subexp_idx == dfa->nodes[node].opr.idx)
2097 subexp_idx = dfa->nodes[ent->node].opr.idx;
2107 && subexp_idx == dfa->nodes[node].opr.idx)
2110 && subexp_idx == dfa->nodes[node].opr.idx)
2152 if (subexp_idx != dfa->nodes[node].opr.idx)
2484 && dfa->nodes[node].opr.idx < BITSET_WORD_BITS
2486 & ((bitset_word_t) 1 << dfa->nodes[node].opr.idx)))
2743 subexp_num = dfa->nodes[bkref_node].opr.idx;
2753 if (dfa->nodes[sub_top->node].opr.idx != subexp_num)
2914 && node->opr.idx == subexp_idx)
2938 subexp_num = dfa->nodes[top_node].opr.idx;
3174 Idx idx, outside_node;
3185 for (idx = 0; idx < cur_nodes->nelem; ++idx)
3187 Idx cur_node = cur_nodes->elems[idx];
3232 && dfa->nodes[cur_node].opr.idx == ex_subexp)
3902 int32_t idx;
3960 int32_t idx = findidx (&cp);
3961 if (idx > 0)
3965 size_t weight_len = weights[idx & 0xffffff];
3967 && (idx >> 24) == (equiv_class_idx >> 24))
3971 idx &= 0xffffff;
3976 == weights[idx + 1 + cnt]))
4042 int32_t idx;
4048 for (idx = 0; idx < extrasize;)
4054 idx = idx + extra[idx] + 1;
4055 elem_mbs_len = extra[idx++];
4059 if (extra[idx + mbs_cnt] != mbs[mbs_cnt])
4066 idx += elem_mbs_len;
4068 idx = (idx + 3) & ~3;
4070 idx += sizeof (uint32_t);
4072 idx = idx + sizeof (uint32_t) * (extra[idx] + 1);
4075 return *(uint32_t *) (extra + idx);
4077 idx += sizeof (uint32_t);
4091 Idx idx)
4094 ch = re_string_byte_at (&mctx->input, idx);
4127 unsigned int context = re_string_context_at (&mctx->input, idx,