dist/lib/regexec.c

1230     if (check_halt_node_context (mctx->dfa, state->nodes.elems[i], context))
1231       return state->nodes.elems[i];
1261 	  Idx candidate = edests->elems[i];
1319 	      dest_node = dfa->edests[node].elems[0];
1666       Idx prev_node = cur_src->elems[i];
1828 			   dfa->inveclosures + dest_nodes->elems[i]);
1846 	Idx cur_node = inv_eclosure->elems[ecl_idx];
1851 	    Idx edst1 = dfa->edests[cur_node].elems[0];
1853 			 ? dfa->edests[cur_node].elems[1] : REG_MISSING);
1872 	Idx cur_node = inv_eclosure->elems[ecl_idx];
1897       ent = mctx->bkref_ents + limits->elems[lim_idx];
1900       dst_pos = check_dst_limits_calc_pos (mctx, limits->elems[lim_idx],
1903       src_pos = check_dst_limits_calc_pos (mctx, limits->elems[lim_idx],
1932       Idx node = eclosures->elems[node_idx];
1958 		  dst = dfa->edests[node].elems[0];
2044       ent = bkref_ents + limits->elems[lim_idx];
2056 	      Idx node = dest_nodes->elems[node_idx];
2080 		Idx node = dest_nodes->elems[node_idx];
2100 	      Idx node = dest_nodes->elems[node_idx];
2140       node = candidates->elems[node_idx];
2161 		      : dfa->edests[node].elems[0]);
2432       Idx node = cur_nodes->elems[node_idx];
2465       Idx cur_node = state->nodes.elems[node_cnt];
2500       Idx cur_node_idx = pstate->nodes.elems[i];
2571       Idx node_idx = nodes->elems[i];
2610 			    ? dfa->eclosures + dfa->edests[node_idx].elems[0]
2855       Idx cls_node = nodes->elems[cls_idx];
3045       Idx cur_node = cur_nodes->elems[cur_idx];
3129       Idx cur_node = cur_nodes->elems[idx];
3193 					  dfa->edests[cur_node].elems[1],
3198       cur_node = dfa->edests[cur_node].elems[0];
3240 	  next_node = dfa->edests[ent->node].elems[0];
3402 	  next_node = dfa->nexts[dests_node[i].elems[j]];
3548       re_token_t *node = &dfa->nodes[cur_nodes->elems[i]];
3689 	  ok = re_node_set_insert (&dests_node[j], cur_nodes->elems[i]);
3701 	  err = re_node_set_init_1 (dests_node + ndests, cur_nodes->elems[i]);