Searched refs:dest_idx (Results 1 - 18 of 18) sorted by path

/freebsd-11-stable/contrib/gcc/
H A Dbasic-block.h143 unsigned int dest_idx; local
H A Dcfg.c221 e->dest_idx = EDGE_COUNT (dest->preds) - 1;
253 unsigned int dest_idx = e->dest_idx;
255 VEC_unordered_remove (edge, dest->preds, dest_idx);
258 to update dest_idx of the edge that moved into the "hole". */
259 if (dest_idx < EDGE_COUNT (dest->preds))
260 EDGE_PRED (dest, dest_idx)->dest_idx = dest_idx;
248 unsigned int dest_idx = e->dest_idx; local
H A Dcfghooks.c182 if (ei.index != e->dest_idx)
185 error ("its dest_idx should be %d, not %d",
186 ei.index, e->dest_idx);
H A Dtree-cfg.c5557 tree def = PHI_ARG_DEF (phi2, e2->dest_idx);
H A Dtree-cfgcleanup.c357 int n1 = e1->dest_idx;
358 int n2 = e2->dest_idx;
458 add_phi_arg (phi, PHI_ARG_DEF (phi, succ->dest_idx), s);
687 tree def = PHI_ARG_DEF (phi, succ->dest_idx);
797 unsigned int dest_idx = single_succ_edge (bb)->dest_idx; local
819 || PHI_ARG_DEF (use_stmt, dest_idx) != result)
H A Dtree-outof-ssa.c378 Ti = PHI_ARG_DEF (phi, g->e->dest_idx);
605 tmp = PHI_ARG_DEF (phi, e->dest_idx);
H A Dtree-phinodes.c384 gcc_assert (e->dest_idx < (unsigned int) PHI_NUM_ARGS (phi));
394 SET_PHI_ARG_DEF (phi, e->dest_idx, def);
439 remove_phi_arg_num (phi, e->dest_idx);
H A Dtree-ssa-dom.c1238 indx = e->dest_idx;
H A Dtree-ssa-operands.h148 PHI_ARG_DEF ((PHI), (E)->dest_idx)
150 PHI_ARG_DEF_PTR ((PHI), (E)->dest_idx)
H A Dtree-ssa-phiopt.c222 arg0 = PHI_ARG_DEF_TREE (phi, e1->dest_idx);
223 arg1 = PHI_ARG_DEF_TREE (phi, e2->dest_idx);
332 SET_USE (PHI_ARG_DEF_PTR (phi, e->dest_idx), new);
H A Dtree-ssa-pre.c1009 tree def = PHI_ARG_DEF (phi, e->dest_idx);
1377 if (is_undefined_value (PHI_ARG_DEF (phi, e->dest_idx)))
1379 vn_lookup_or_add (PHI_ARG_DEF (phi, e->dest_idx), NULL);
1380 return PHI_ARG_DEF (phi, e->dest_idx);
H A Dtree-ssa-threadupdate.c326 int indx = rd->outgoing_edge->dest_idx;
H A Dtree-ssa-uncprop.c497 tree arg = PHI_ARG_DEF (phi, e->dest_idx);
529 SET_PHI_ARG_DEF (phi, e->dest_idx, equiv);
H A Dtree-ssa.c63 if (PHI_ARG_DEF (phi, e->dest_idx) == NULL_TREE)
66 src = PHI_ARG_DEF (phi, e->dest_idx);
H A Dtree-vect-transform.c857 SET_PHI_ARG_DEF (new_phi, loop->single_exit->dest_idx, vect_def);
2441 SET_USE (use_p, PHI_ARG_DEF (phi, preheader_e->dest_idx));
2569 SET_PHI_ARG_DEF (phi1, update_e->dest_idx, ni_name);
3029 SET_PHI_ARG_DEF (orig_phi, e->dest_idx, PHI_RESULT (new_phi));
H A Dtree-vectorizer.c345 new_loop_exit_e->dest_idx,
557 SET_PHI_ARG_DEF (update_phi, e->dest_idx, PHI_RESULT (new_phi));
572 SET_PHI_ARG_DEF (update_phi2, new_exit_e->dest_idx, PHI_RESULT (new_phi));
703 SET_PHI_ARG_DEF (update_phi, e->dest_idx, PHI_RESULT (new_phi));
718 SET_PHI_ARG_DEF (update_phi2, new_exit_e->dest_idx, PHI_RESULT (new_phi));
754 SET_PHI_ARG_DEF (update_phi2, guard_edge->dest_idx, PHI_RESULT (new_phi));
/freebsd-11-stable/contrib/libgnuregex/
H A Dregcomp.c1035 int dest_idx = dfa->edests[node_idx].elems[0];
1036 if (!re_node_set_contains (&init_nodes, dest_idx))
1040 + dest_idx);
1030 int dest_idx = dfa->edests[node_idx].elems[0]; local
H A Dregexec.c2530 int naccepted, dest_idx;
2554 dest_idx = re_string_cur_idx (&mctx->input) + naccepted;
2557 err = clean_state_log_if_needed (mctx, dest_idx);
2565 dest_state = mctx->state_log[dest_idx];
2575 context = re_string_context_at (&mctx->input, dest_idx - 1,
2577 mctx->state_log[dest_idx]
2581 if (BE (mctx->state_log[dest_idx] == NULL && err != REG_NOERROR, 0))
2526 int naccepted, dest_idx; local

Completed in 226 milliseconds