Lines Matching refs:str_idx
25 Idx str_idx, Idx from, Idx to)
27 static Idx search_cur_bkref_entry (const re_match_context_t *mctx, Idx str_idx)
30 Idx str_idx) internal_function;
32 Idx node, Idx str_idx)
67 Idx str_idx, Idx dest_node, Idx nregs,
81 Idx node_idx, Idx str_idx, Idx max_str_idx)
88 re_sift_context_t *sctx, Idx str_idx,
93 Idx str_idx,
110 Idx node, Idx str_idx,
117 Idx str_idx) internal_function;
120 Idx str_idx, const re_node_set *candidates)
137 Idx str_idx) internal_function;
167 Idx str_idx,
1385 push_fail_stack (struct re_fail_stack_t *fs, Idx str_idx, Idx dest_node,
1400 fs->stack[num].idx = str_idx;
1632 Idx str_idx = sctx->last_str_idx;
1636 assert (mctx->state_log != NULL && mctx->state_log[str_idx] != NULL);
1639 /* Build sifted state_log[str_idx]. It has the nodes which can epsilon
1644 err = update_cur_sifted_state (mctx, sctx, str_idx, &cur_dest);
1649 while (str_idx > 0)
1652 null_cnt = (sctx->sifted_states[str_idx] == NULL) ? null_cnt + 1 : 0;
1656 sizeof (re_dfastate_t *) * str_idx);
1661 --str_idx;
1663 if (mctx->state_log[str_idx])
1665 err = build_sifted_states (mctx, sctx, str_idx, &cur_dest);
1674 err = update_cur_sifted_state (mctx, sctx, str_idx, &cur_dest);
1687 Idx str_idx, re_node_set *cur_dest)
1690 const re_node_set *cur_src = &mctx->state_log[str_idx]->non_eps_nodes;
1695 'sifted_states[str_idx]' with 'cur_dest'.
1697 'cur_dest' is the sifted state from 'state_log[str_idx + 1]'.
1698 'cur_src' points the node_set of the old 'state_log[str_idx]'
1714 str_idx, sctx->last_str_idx);
1720 && check_node_accept (mctx, dfa->nodes + prev_node, str_idx)
1721 && STATE_NODE_CONTAINS (sctx->sifted_states[str_idx + 1],
1730 Idx to_idx = str_idx + naccepted;
1733 prev_node, str_idx))
1802 re_sift_context_t *sctx, Idx str_idx,
1808 candidates = ((mctx->state_log[str_idx] == NULL) ? NULL
1809 : &mctx->state_log[str_idx]->nodes);
1812 sctx->sifted_states[str_idx] = NULL;
1827 mctx->bkref_ents, str_idx);
1833 sctx->sifted_states[str_idx] = re_acquire_state (&err, dfa, dest_nodes);
1838 if (candidates && mctx->state_log[str_idx]->has_backref)
1840 err = sift_states_bkref (mctx, sctx, str_idx, candidates);
2046 Idx subexp_idx, Idx from_node, Idx str_idx,
2053 if (str_idx < lim->subexp_from)
2056 if (lim->subexp_to < str_idx)
2060 boundaries = (str_idx == lim->subexp_from);
2061 boundaries |= (str_idx == lim->subexp_to) << 1;
2077 struct re_backref_cache_entry *bkref_ents, Idx str_idx)
2088 if (str_idx <= ent->subexp_from || ent->str_idx < str_idx)
2092 if (ent->subexp_to == str_idx)
2109 /* Note that (ent->subexp_to = str_idx != ent->subexp_from). */
2138 else /* (ent->subexp_to != str_idx) */
2164 Idx str_idx, const re_node_set *candidates)
2170 Idx first_idx = search_cur_bkref_entry (mctx, str_idx);
2185 if (node == sctx->last_node && str_idx == sctx->last_str_idx)
2203 to_idx = str_idx + subexp_len;
2211 str_idx, dst_node, to_idx))
2222 local_sctx.last_str_idx = str_idx;
2229 cur_state = local_sctx.sifted_states[str_idx];
2237 str_idx + 1);
2241 local_sctx.sifted_states[str_idx] = cur_state;
2264 Idx node_idx, Idx str_idx, Idx max_str_idx)
2269 naccepted = check_node_accept_bytes (dfa, node_idx, &mctx->input, str_idx);
2270 if (naccepted > 0 && str_idx + naccepted <= max_str_idx &&
2271 !STATE_NODE_CONTAINS (sctx->sifted_states[str_idx + naccepted],
2463 Idx str_idx)
2482 err = match_ctx_add_subtop (mctx, node, str_idx);
2651 if (bkref_ent->node != node_idx || bkref_ent->str_idx != cur_str_idx)
2750 sl_str = sub_top->str_idx;
2758 sl_str_diff = sub_last->str_idx - sl_str;
2805 sl_str_off = sl_str - sub_top->str_idx;
2837 sl_str - sub_top->str_idx + 1);
2844 sub_top->str_idx, cls_node, sl_str,
2877 sub_last->str_idx, bkref_node, bkref_str,
2881 err = match_ctx_add_entry (mctx, bkref_node, bkref_str, sub_top->str_idx,
2882 sub_last->str_idx);
2885 to_idx = bkref_str + sub_last->str_idx - sub_top->str_idx;
2926 Idx subexp_num, backup_cur_idx, str_idx, null_cnt;
2954 str_idx = path->next_idx ? path->next_idx : top_str;
2960 mctx->input.cur_idx = str_idx;
2963 context = re_string_context_at (&mctx->input, str_idx - 1, mctx->eflags);
2964 if (str_idx == top_str)
2978 cur_state = mctx->state_log[str_idx];
2988 if (str_idx == top_str || (cur_state && cur_state->has_backref))
2992 err = expand_bkref_cache (mctx, &next_nodes, str_idx,
3006 mctx->state_log[str_idx] = cur_state;
3009 for (null_cnt = 0; str_idx < last_str && null_cnt <= mctx->max_mb_elem_len;)
3012 if (mctx->state_log[str_idx + 1])
3015 &mctx->state_log[str_idx + 1]->nodes);
3024 err = check_arrival_add_next_nodes (mctx, str_idx,
3033 ++str_idx;
3042 err = expand_bkref_cache (mctx, &next_nodes, str_idx,
3050 context = re_string_context_at (&mctx->input, str_idx - 1, mctx->eflags);
3057 mctx->state_log[str_idx] = cur_state;
3063 path->next_idx = str_idx;
3086 check_arrival_add_next_nodes (re_match_context_t *mctx, Idx str_idx,
3110 str_idx);
3115 Idx next_idx = str_idx + naccepted;
3145 || check_node_accept (mctx, dfa->nodes + cur_node, str_idx))
3786 const re_string_t *input, Idx str_idx)
3794 unsigned char c = re_string_byte_at (input, str_idx), d;
3798 if (str_idx + 2 > input->len)
3801 d = re_string_byte_at (input, str_idx + 1);
3831 if (str_idx + char_len > input->len)
3836 d = re_string_byte_at (input, str_idx + i);
3843 char_len = re_string_char_size_at (input, str_idx);
3852 re_string_byte_at (input, str_idx) == '\n') ||
3854 re_string_byte_at (input, str_idx) == '\0'))
3859 elem_len = re_string_elem_size_at (input, str_idx);
3868 = ((const unsigned char *) re_string_get_buffer (input) + str_idx);
3874 ? re_string_wchar_at (input, str_idx) : 0);
4278 match_ctx_add_entry (re_match_context_t *mctx, Idx node, Idx str_idx, Idx from,
4297 && mctx->bkref_ents[mctx->nbkref_ents - 1].str_idx == str_idx)
4301 mctx->bkref_ents[mctx->nbkref_ents].str_idx = str_idx;
4322 /* Return the first entry with the same str_idx, or REG_MISSING if none is
4327 search_cur_bkref_entry (const re_match_context_t *mctx, Idx str_idx)
4334 if (mctx->bkref_ents[mid].str_idx < str_idx)
4339 if (left < last && mctx->bkref_ents[left].str_idx == str_idx)
4350 match_ctx_add_subtop (re_match_context_t *mctx, Idx node, Idx str_idx)
4371 mctx->sub_tops[mctx->nsub_tops++]->str_idx = str_idx;
4380 match_ctx_add_sublast (re_sub_match_top_t *subtop, Idx node, Idx str_idx)
4399 new_entry->str_idx = str_idx;