Searched refs:dest_idx (Results 1 - 25 of 74) sorted by relevance

123

/netbsd-current/external/gpl3/gcc.old/dist/gcc/
H A Dtree-ssa-operands.h86 PHI_ARG_DEF ((PHI), (E)->dest_idx)
88 PHI_ARG_DEF_PTR ((PHI), (E)->dest_idx)
H A Dtree-phinodes.c367 gcc_assert (e->dest_idx < gimple_phi_num_args (phi));
377 SET_PHI_ARG_DEF (phi, e->dest_idx, def);
378 gimple_phi_arg_set_location (phi, e->dest_idx, locus);
428 e->dest_idx);
H A Dcfg.c218 e->dest_idx = EDGE_COUNT (dest->preds) - 1;
252 unsigned int dest_idx = e->dest_idx;
254 dest->preds->unordered_remove (dest_idx);
257 to update dest_idx of the edge that moved into the "hole". */
258 if (dest_idx < EDGE_COUNT (dest->preds))
259 EDGE_PRED (dest, dest_idx)->dest_idx = dest_idx;
247 unsigned int dest_idx = e->dest_idx; local
H A Dtree-cfgcleanup.c429 int n1 = e1->dest_idx;
430 int n2 = e2->dest_idx;
575 tree def = gimple_phi_arg_def (phi, succ->dest_idx);
1261 tree def = gimple_phi_arg_def (phi, succ->dest_idx);
1413 unsigned int dest_idx = single_succ_edge (bb)->dest_idx; local
1437 || gimple_phi_arg_def (use_stmt, dest_idx) != result)
H A Dtree-ssa-uncprop.c361 tree arg = PHI_ARG_DEF (phi, e->dest_idx);
386 SET_PHI_ARG_DEF (phi, e->dest_idx, equiv);
H A Dtree-ssa-phiopt.c143 if (operand_equal_for_phi_arg_p (gimple_phi_arg_def (p, e0->dest_idx),
144 gimple_phi_arg_def (p, e1->dest_idx)))
298 arg0 = gimple_phi_arg_def (phi, e1->dest_idx);
299 arg1 = gimple_phi_arg_def (phi, e2->dest_idx);
315 arg0 = gimple_phi_arg_def (phi, e1->dest_idx);
316 arg1 = gimple_phi_arg_def (phi, e2->dest_idx);
331 arg0 = gimple_phi_arg_def (phi, e1->dest_idx);
332 arg1 = gimple_phi_arg_def (phi, e2->dest_idx);
384 SET_USE (PHI_ARG_DEF_PTR (phi, e->dest_idx), new_tree);
1161 SET_PHI_ARG_DEF (phi, e0->dest_idx, ar
[all...]
H A Dgimple-streamer-in.c73 location_t *arg_locp = gimple_phi_arg_location_ptr (result, e->dest_idx);
H A Dtree-ssa-threadupdate.c438 int src_idx = src_e->dest_idx;
439 int tgt_idx = tgt_e->dest_idx;
489 arg = gimple_phi_arg_def (def_phi, e->dest_idx);
492 *locus = gimple_phi_arg_location (def_phi, e->dest_idx);
512 int src_indx = src_e->dest_idx;
1819 int indx1 = e1->dest_idx;
1820 int indx2 = e2->dest_idx;
H A Dtree-ssa-pre.c1208 return PHI_ARG_DEF (phi, e->dest_idx);
1638 tree def = PHI_ARG_DEF (def_stmt, e->dest_idx);
3057 eprime = avail[pred->dest_idx];
3075 avail[pred->dest_idx] = get_or_alloc_expr_for_constant (builtexpr);
3077 avail[pred->dest_idx] = get_or_alloc_expr_for_name (builtexpr);
3099 pre_expr ae = avail[pred->dest_idx];
3259 avail[pred->dest_idx] = NULL;
3269 avail[pred->dest_idx] = eprime;
3274 avail[pred->dest_idx] = edoubleprime;
3419 avail[pred->dest_idx]
[all...]
H A Dtree-ssa-tail-merge.c517 int n = find_edge (bb, BASIC_BLOCK_FOR_FN (cfun, s))->dest_idx;
1352 int n1 = e1->dest_idx, n2 = e2->dest_idx;
H A Dbasic-block.h46 unsigned int dest_idx; variable
/netbsd-current/external/gpl3/gcc/dist/gcc/
H A Dtree-ssa-operands.h86 PHI_ARG_DEF ((PHI), (E)->dest_idx)
88 PHI_ARG_DEF_PTR ((PHI), (E)->dest_idx)
H A Dtree-phinodes.cc367 gcc_assert (e->dest_idx < gimple_phi_num_args (phi));
377 SET_PHI_ARG_DEF (phi, e->dest_idx, def);
378 gimple_phi_arg_set_location (phi, e->dest_idx, locus);
428 e->dest_idx);
H A Dcfg.cc232 e->dest_idx = EDGE_COUNT (dest->preds) - 1;
266 unsigned int dest_idx = e->dest_idx;
268 dest->preds->unordered_remove (dest_idx);
271 to update dest_idx of the edge that moved into the "hole". */
272 if (dest_idx < EDGE_COUNT (dest->preds))
273 EDGE_PRED (dest, dest_idx)->dest_idx = dest_idx;
261 unsigned int dest_idx = e->dest_idx; local
H A Dtree-cfgcleanup.cc451 int n1 = e1->dest_idx;
452 int n2 = e2->dest_idx;
597 tree def = gimple_phi_arg_def (phi, succ->dest_idx);
1279 tree def = gimple_phi_arg_def (phi, succ->dest_idx);
1431 unsigned int dest_idx = single_succ_edge (bb)->dest_idx; local
1455 || gimple_phi_arg_def (use_stmt, dest_idx) != result)
H A Dtree-ssa-uncprop.cc361 tree arg = PHI_ARG_DEF (phi, e->dest_idx);
386 SET_PHI_ARG_DEF (phi, e->dest_idx, equiv);
H A Dtree-ssa-dce.cc1660 else if (a->first->dest_idx < b->first->dest_idx)
1662 else if (a->first->dest_idx > b->first->dest_idx)
1729 second from hash value to smallest dest_idx of the edges which have
1734 args[0].second = args[0].first->dest_idx;
1747 args[i].second = args[i].first->dest_idx;
1831 (vphi, single_succ_edge (forwarder)->dest_idx, def);
H A Dgimple-streamer-in.cc73 location_t *arg_locp = gimple_phi_arg_location_ptr (result, e->dest_idx);
H A Dtree-ssa-threadupdate.cc520 int src_idx = src_e->dest_idx;
521 int tgt_idx = tgt_e->dest_idx;
571 arg = gimple_phi_arg_def (def_phi, e->dest_idx);
574 *locus = gimple_phi_arg_location (def_phi, e->dest_idx);
594 int src_indx = src_e->dest_idx;
1907 int indx1 = e1->dest_idx;
1908 int indx2 = e2->dest_idx;
H A Dtree-ssa-phiopt.cc151 if (operand_equal_for_phi_arg_p (gimple_phi_arg_def (p, e0->dest_idx),
152 gimple_phi_arg_def (p, e1->dest_idx)))
307 arg0 = gimple_phi_arg_def (phi, e1->dest_idx);
308 arg1 = gimple_phi_arg_def (phi, e2->dest_idx);
324 arg0 = gimple_phi_arg_def (phi, e1->dest_idx);
325 arg1 = gimple_phi_arg_def (phi, e2->dest_idx);
341 arg0 = gimple_phi_arg_def (phi, e1->dest_idx);
342 arg1 = gimple_phi_arg_def (phi, e2->dest_idx);
424 SET_USE (PHI_ARG_DEF_PTR (phi, e->dest_idx), new_tree);
1520 SET_PHI_ARG_DEF (phi, e0->dest_idx, ar
[all...]
H A Dtree-vect-loop-manip.cc252 SET_PHI_ARG_DEF (update_phi, e->dest_idx, new_def);
1104 if (single_succ_edge (preheader)->dest_idx
1105 != single_succ_edge (new_bbs[0])->dest_idx)
1110 EDGE_PRED (swap_bb, 0)->dest_idx = 0;
1111 EDGE_PRED (swap_bb, 1)->dest_idx = 1;
1116 if (loop_preheader_edge (scalar_loop)->dest_idx
1117 != loop_preheader_edge (new_inner_loop)->dest_idx)
1122 EDGE_PRED (swap_bb, 0)->dest_idx = 0;
1123 EDGE_PRED (swap_bb, 1)->dest_idx = 1;
3604 unsigned orig_pe_idx = loop_preheader_edge (loop)->dest_idx;
[all...]
H A Dtree-ssa-pre.cc1291 return PHI_ARG_DEF (phi, e->dest_idx);
1703 tree def = PHI_ARG_DEF (def_stmt, e->dest_idx);
3160 eprime = avail[pred->dest_idx];
3178 avail[pred->dest_idx] = get_or_alloc_expr_for_constant (builtexpr);
3180 avail[pred->dest_idx] = get_or_alloc_expr_for_name (builtexpr);
3203 pre_expr ae = avail[pred->dest_idx];
3364 avail[pred->dest_idx] = NULL;
3374 avail[pred->dest_idx] = eprime;
3379 avail[pred->dest_idx] = edoubleprime;
3524 avail[pred->dest_idx]
[all...]
H A Dtree-ssa-tail-merge.cc517 int n = find_edge (bb, BASIC_BLOCK_FOR_FN (cfun, s))->dest_idx;
1352 int n1 = e1->dest_idx, n2 = e2->dest_idx;
H A Dbasic-block.h46 unsigned int dest_idx; variable
/netbsd-current/external/gpl3/gcc/dist/gcc/rtl-ssa/
H A Dblocks.cc949 unsigned int input_i = e->dest_idx * phis.num_phis;
1134 use_info *use = mem_phi->input_use (e->dest_idx);

Completed in 493 milliseconds

123