Lines Matching defs:cur_idx
63 int cur_idx, int nmatch) internal_function;
1543 regmatch_t *prev_idx_match, int cur_node, int cur_idx, int nmatch)
1553 pmatch[reg_num].rm_so = cur_idx;
1563 if (pmatch[reg_num].rm_so < cur_idx)
1565 pmatch[reg_num].rm_eo = cur_idx;
1583 pmatch[reg_num].rm_eo = cur_idx;
2341 int cur_idx = re_string_cur_idx (&mctx->input);
2343 if (cur_idx > mctx->state_log_top)
2345 mctx->state_log[cur_idx] = next_state;
2346 mctx->state_log_top = cur_idx;
2348 else if (mctx->state_log[cur_idx] == 0)
2350 mctx->state_log[cur_idx] = next_state;
2357 /* If (state_log[cur_idx] != 0), it implies that cur_idx is
2361 pstate = mctx->state_log[cur_idx];
2379 next_state = mctx->state_log[cur_idx]
2394 cur_idx);
2404 next_state = mctx->state_log[cur_idx];
2937 backup_cur_idx = mctx->input.cur_idx;
2939 mctx->input.cur_idx = str_idx;
3046 mctx->input.cur_idx = backup_cur_idx;
3070 int cur_idx;
3074 for (cur_idx = 0; cur_idx < cur_nodes->nelem; ++cur_idx)
3077 int cur_node = cur_nodes->elems[cur_idx];