| /src/external/gpl3/gcc/dist/gcc/ |
| tree-phinodes.h | 43 return &gimple_phi_arg (gs, e->dest_idx)->imm_use;
|
| tree-phinodes.cc | 374 gcc_assert (e->dest_idx < gimple_phi_num_args (phi));
384 SET_PHI_ARG_DEF (phi, e->dest_idx, def);
385 gimple_phi_arg_set_location (phi, e->dest_idx, locus);
435 e->dest_idx);
|
| cfg.cc | 233 e->dest_idx = EDGE_COUNT (dest->preds) - 1;
267 unsigned int dest_idx = e->dest_idx;
269 dest->preds->unordered_remove (dest_idx);
272 to update dest_idx of the edge that moved into the "hole". */
273 if (dest_idx < EDGE_COUNT (dest->preds))
274 EDGE_PRED (dest, dest_idx)->dest_idx = dest_idx;
262 unsigned int dest_idx = e->dest_idx; local
|
| tree-ssa-uncprop.cc | 361 tree arg = PHI_ARG_DEF (phi, e->dest_idx);
386 SET_PHI_ARG_DEF (phi, e->dest_idx, equiv);
|
| tree-cfgcleanup.cc | 456 int n1 = e1->dest_idx;
457 int n2 = e2->dest_idx;
1301 tree def = gimple_phi_arg_def (phi, succ->dest_idx);
1454 unsigned int dest_idx = single_succ_edge (bb)->dest_idx; local
1478 || gimple_phi_arg_def (use_stmt, dest_idx) != result)
|
| tree-ssa-dce.cc | 1718 else if (a->first->dest_idx < b->first->dest_idx)
1720 else if (a->first->dest_idx > b->first->dest_idx)
1787 second from hash value to smallest dest_idx of the edges which have
1792 args[0].second = args[0].first->dest_idx;
1805 args[i].second = args[i].first->dest_idx;
1902 (vphi, single_succ_edge (forwarder)->dest_idx, def);
|
| gimple-streamer-in.cc | 73 location_t *arg_locp = gimple_phi_arg_location_ptr (result, e->dest_idx);
|
| tree-ssa-phiopt.cc | 78 if (operand_equal_for_phi_arg_p (gimple_phi_arg_def (p, e0->dest_idx),
79 gimple_phi_arg_def (p, e1->dest_idx)))
137 SET_USE (PHI_ARG_DEF_PTR (phi, e->dest_idx), new_tree);
1439 SET_PHI_ARG_DEF (phi, e0->dest_idx, arg);
1440 SET_PHI_ARG_DEF (phi, e1->dest_idx, arg);
2530 tree arg2 = gimple_phi_arg_def (phi, cond2_phi_edge->dest_idx);
2649 arg3 = gimple_phi_arg_def (phi, cond3_phi_edge->dest_idx);
4304 arg0 = gimple_phi_arg_def (phi, e1->dest_idx);
4305 arg1 = gimple_phi_arg_def (phi, e2->dest_idx);
4321 arg0 = gimple_phi_arg_def (phi, e1->dest_idx);
[all...] |
| tree-vect-loop-manip.cc | 258 SET_PHI_ARG_DEF (update_phi, e->dest_idx, new_def);
1558 if (single_succ_edge (preheader)->dest_idx
1559 != single_succ_edge (new_bbs[0])->dest_idx)
1564 EDGE_PRED (swap_bb, 0)->dest_idx = 0;
1565 EDGE_PRED (swap_bb, 1)->dest_idx = 1;
1570 if (loop_preheader_edge (scalar_loop)->dest_idx
1571 != loop_preheader_edge (new_inner_loop)->dest_idx)
1576 EDGE_PRED (swap_bb, 0)->dest_idx = 0;
1577 EDGE_PRED (swap_bb, 1)->dest_idx = 1;
4192 unsigned orig_pe_idx = loop_preheader_edge (loop)->dest_idx;
[all...] |
| tree-ssa-threadupdate.cc | 546 arg = gimple_phi_arg_def (def_phi, e->dest_idx);
549 *locus = gimple_phi_arg_location (def_phi, e->dest_idx);
569 int src_indx = src_e->dest_idx;
1900 int indx1 = e1->dest_idx;
1901 int indx2 = e2->dest_idx;
|
| tree-ssa-pre.cc | 1279 return PHI_ARG_DEF (phi, e->dest_idx);
1692 tree def = PHI_ARG_DEF (def_stmt, e->dest_idx);
3168 eprime = avail[pred->dest_idx];
3186 avail[pred->dest_idx] = get_or_alloc_expr_for_constant (builtexpr);
3188 avail[pred->dest_idx] = get_or_alloc_expr_for_name (builtexpr);
3211 pre_expr ae = avail[pred->dest_idx];
3372 avail[pred->dest_idx] = NULL;
3382 avail[pred->dest_idx] = eprime;
3388 avail[pred->dest_idx] = edoubleprime;
3541 avail[pred->dest_idx] = NULL
[all...] |
| tree-ssa-loop-niter.cc | 2109 loop_latch_edge (loop)->dest_idx))
2113 iv_2 = gimple_phi_arg_def (iv_2_stmt, loop_latch_edge (loop)->dest_idx);
2140 || (iv_2 != gimple_phi_arg_def (phi, loop_latch_edge (loop)->dest_idx)))
2144 tree src = gimple_phi_arg_def (phi, loop_preheader_edge (loop)->dest_idx);
2377 loop_latch_edge (loop)->dest_idx))
2381 iv_2 = gimple_phi_arg_def (iv_2_stmt, loop_latch_edge (loop)->dest_idx);
2403 || (iv_2 != gimple_phi_arg_def (phi, loop_latch_edge (loop)->dest_idx)))
2407 tree src = gimple_phi_arg_def (phi, loop_preheader_edge (loop)->dest_idx);
2493 loop_latch_edge (loop)->dest_idx))
2497 iv_2 = gimple_phi_arg_def (iv_2_stmt, loop_latch_edge (loop)->dest_idx);
[all...] |
| tree-ssa-tail-merge.cc | 528 int n = find_edge (bb, BASIC_BLOCK_FOR_FN (cfun, s))->dest_idx;
1375 int n1 = e1->dest_idx, n2 = e2->dest_idx;
|
| /src/external/gpl3/gcc.old/dist/gcc/ |
| tree-ssa-operands.h | 86 PHI_ARG_DEF ((PHI), (E)->dest_idx)
88 PHI_ARG_DEF_PTR ((PHI), (E)->dest_idx)
|
| tree-phinodes.cc | 367 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);
|
| cfg.cc | 232 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
|
| tree-cfgcleanup.cc | 451 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)
|
| tree-ssa-uncprop.cc | 361 tree arg = PHI_ARG_DEF (phi, e->dest_idx);
386 SET_PHI_ARG_DEF (phi, e->dest_idx, equiv);
|
| tree-ssa-dce.cc | 1660 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);
|
| gimple-streamer-in.cc | 73 location_t *arg_locp = gimple_phi_arg_location_ptr (result, e->dest_idx);
|
| tree-ssa-threadupdate.cc | 520 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;
|
| tree-ssa-phiopt.cc | 152 if (operand_equal_for_phi_arg_p (gimple_phi_arg_def (p, e0->dest_idx),
153 gimple_phi_arg_def (p, e1->dest_idx)))
308 arg0 = gimple_phi_arg_def (phi, e1->dest_idx);
309 arg1 = gimple_phi_arg_def (phi, e2->dest_idx);
325 arg0 = gimple_phi_arg_def (phi, e1->dest_idx);
326 arg1 = gimple_phi_arg_def (phi, e2->dest_idx);
342 arg0 = gimple_phi_arg_def (phi, e1->dest_idx);
343 arg1 = gimple_phi_arg_def (phi, e2->dest_idx);
425 SET_USE (PHI_ARG_DEF_PTR (phi, e->dest_idx), new_tree);
1535 SET_PHI_ARG_DEF (phi, e0->dest_idx, arg)
[all...] |
| tree-vect-loop-manip.cc | 252 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...] |
| tree-ssa-pre.cc | 1291 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] = NULL
[all...] |
| tree-ssa-tail-merge.cc | 517 int n = find_edge (bb, BASIC_BLOCK_FOR_FN (cfun, s))->dest_idx;
1364 int n1 = e1->dest_idx, n2 = e2->dest_idx;
|
