Searched refs:EDGE_SUCC (Results 1 - 25 of 31) sorted by relevance

12

/freebsd-10.1-release/contrib/gcc/
H A Dtree-ssa-loop-ch.c65 if (flow_bb_inside_loop_p (loop, EDGE_SUCC (header, 0)->dest)
66 && flow_bb_inside_loop_p (loop, EDGE_SUCC (header, 1)->dest))
177 if (flow_bb_inside_loop_p (loop, EDGE_SUCC (header, 0)->dest))
178 exit = EDGE_SUCC (header, 0);
180 exit = EDGE_SUCC (header, 1);
H A Dtree-ssa-phiopt.c170 e1 = EDGE_SUCC (bb, 0);
172 e2 = EDGE_SUCC (bb, 1);
187 if (EDGE_SUCC (bb1, 0)->dest == bb2)
189 else if (EDGE_SUCC (bb2, 0)->dest == bb1)
201 e1 = EDGE_SUCC (bb1, 0);
335 if (EDGE_SUCC (cond_block, 0)->dest == bb)
337 EDGE_SUCC (cond_block, 0)->flags |= EDGE_FALLTHRU;
338 EDGE_SUCC (cond_block, 0)->flags &= ~(EDGE_TRUE_VALUE | EDGE_FALSE_VALUE);
339 EDGE_SUCC (cond_block, 0)->probability = REG_BR_PROB_BASE;
340 EDGE_SUCC (cond_bloc
[all...]
H A Dloop-unswitch.c187 if (!flow_bb_inside_loop_p (loop, EDGE_SUCC (bb, 0)->dest)
188 || !flow_bb_inside_loop_p (loop, EDGE_SUCC (bb, 1)->dest))
416 gcc_assert (flow_bb_inside_loop_p (loop, EDGE_SUCC (unswitch_on, 0)->dest));
417 gcc_assert (flow_bb_inside_loop_p (loop, EDGE_SUCC (unswitch_on, 1)->dest));
458 EDGE_SUCC (switch_bb, 0)->flags |= EDGE_IRREDUCIBLE_LOOP;
459 EDGE_SUCC (switch_bb, 1)->flags |= EDGE_IRREDUCIBLE_LOOP;
464 EDGE_SUCC (switch_bb, 0)->flags &= ~EDGE_IRREDUCIBLE_LOOP;
465 EDGE_SUCC (switch_bb, 1)->flags &= ~EDGE_IRREDUCIBLE_LOOP;
H A Dtree-ssa-loop-ivcanon.c88 in = EDGE_SUCC (exit->src, 0);
90 in = EDGE_SUCC (exit->src, 1);
503 non_exit = EDGE_SUCC (exit->src, 0);
505 non_exit = EDGE_SUCC (exit->src, 1);
H A Dtree-ssa-dce.c767 redirect_edge_and_branch (EDGE_SUCC (bb, 0), post_dom_bb);
768 PENDING_STMT (EDGE_SUCC (bb, 0)) = NULL;
770 EDGE_SUCC (bb, 0)->probability = REG_BR_PROB_BASE;
771 EDGE_SUCC (bb, 0)->count = bb->count;
775 EDGE_SUCC (bb, 0)->flags &= ~(EDGE_TRUE_VALUE | EDGE_FALSE_VALUE);
778 EDGE_SUCC (bb, 0)->flags |= EDGE_FALLTHRU;
789 remove_edge (EDGE_SUCC (bb, 1));
H A Dtree-vectorizer.c514 edge e = EDGE_SUCC (new_merge_bb, 0);
525 new_exit_e = EDGE_SUCC (*new_exit_bb, 0);
548 loop_arg = PHI_ARG_DEF_FROM_EDGE (orig_phi, EDGE_SUCC (loop->latch, 0));
640 edge e = EDGE_SUCC (new_merge_bb, 0);
651 new_exit_e = EDGE_SUCC (*new_exit_bb, 0);
879 if (EDGE_SUCC (new_loop->header, 0)->dest == new_loop->latch)
880 new_loop_exit_edge = EDGE_SUCC (new_loop->header, 1);
882 new_loop_exit_edge = EDGE_SUCC (new_loop->header, 0);
902 EDGE_SUCC (new_loop->header, 0)->dest))
903 new_exit_e = EDGE_SUCC (new_loo
[all...]
H A Dbasic-block.h580 #define FALLTHRU_EDGE(bb) (EDGE_SUCC ((bb), 0)->flags & EDGE_FALLTHRU \
581 ? EDGE_SUCC ((bb), 0) : EDGE_SUCC ((bb), 1))
584 #define BRANCH_EDGE(bb) (EDGE_SUCC ((bb), 0)->flags & EDGE_FALLTHRU \
585 ? EDGE_SUCC ((bb), 1) : EDGE_SUCC ((bb), 0))
600 #define EDGE_SUCC(bb,i) VEC_index (edge, (bb)->succs, (i))
625 return EDGE_SUCC (bb, 0);
599 #define EDGE_SUCC macro
H A Dloop-unroll.c796 if (EDGE_SUCC (exit_block, 0)->dest == desc->out_edge->dest)
798 desc->out_edge = EDGE_SUCC (exit_block, 0);
799 desc->in_edge = EDGE_SUCC (exit_block, 1);
803 desc->out_edge = EDGE_SUCC (exit_block, 1);
804 desc->in_edge = EDGE_SUCC (exit_block, 0);
1120 if (EDGE_SUCC (exit_block, 0)->dest == desc->out_edge->dest)
1122 desc->out_edge = EDGE_SUCC (exit_block, 0);
1123 desc->in_edge = EDGE_SUCC (exit_block, 1);
1127 desc->out_edge = EDGE_SUCC (exit_block, 1);
1128 desc->in_edge = EDGE_SUCC (exit_bloc
[all...]
H A Dtree-ssa-loop-manip.c528 exit = EDGE_SUCC (bb, 0);
530 exit = EDGE_SUCC (bb, 1);
871 if (exit == EDGE_SUCC (exit->src, 0))
872 nonexit = EDGE_SUCC (exit->src, 1);
874 nonexit = EDGE_SUCC (exit->src, 0);
H A Dsbitmap.c540 e = EDGE_SUCC (b, ix);
556 e = EDGE_SUCC (b, ix);
620 e = EDGE_SUCC (b, ix);
636 e = EDGE_SUCC (b, ix);
H A Dcfgloopmanip.c432 prob = EDGE_SUCC (switch_bb, 0)->probability;
433 tot_prob = prob + EDGE_SUCC (switch_bb, 1)->probability;
715 snd = e == EDGE_SUCC (src, 0) ? EDGE_SUCC (src, 1) : EDGE_SUCC (src, 0);
H A Dcfgrtl.c725 && EDGE_SUCC (src, EDGE_SUCC (src, 0) == e)->dest != target))
1118 && (EDGE_SUCC (jump_block, 0)->flags & EDGE_CROSSING))
2437 edge s = EDGE_SUCC (src, EDGE_SUCC (src, 0) == e);
2606 try_redirect_by_replacing_jump (EDGE_SUCC (a, 0), b, true);
2926 edge e = EDGE_SUCC (b, 0);
2931 *branch_edge = EDGE_SUCC (b, 1);
2936 *fallthru_edge = EDGE_SUCC (b, 1);
H A Dbb-reorder.c1353 succ1 = EDGE_SUCC (cur_bb, 0);
1358 succ2 = EDGE_SUCC (cur_bb, 1);
1545 succ1 = EDGE_SUCC (cur_bb, 0);
1550 succ2 = EDGE_SUCC (cur_bb, 1);
1668 new_edge = EDGE_SUCC (new_bb, 0);
1700 succ = EDGE_SUCC (cur_bb, 0);
H A Dcfganal.c271 EDGE_SUCC (bb, 0)->flags |= EDGE_CAN_FALLTHRU;
272 EDGE_SUCC (bb, 1)->flags |= EDGE_CAN_FALLTHRU;
H A Dcfghooks.c382 remove_edge (EDGE_SUCC (bb, 0));
538 remove_edge (EDGE_SUCC (a, 0));
H A Dcfgcleanup.c1522 e2 = EDGE_SUCC (bb2, ei.index);
1574 d1 = EDGE_SUCC (d1, 0)->dest;
1580 d2 = EDGE_SUCC (d2, 0)->dest;
1918 if (EDGE_SUCC (e->src, 0) != e)
H A Dtree-cfgcleanup.c310 dest = EDGE_SUCC (bb, 0)->dest;
H A Dtree-ssa-threadupdate.c620 EDGE_SUCC (rd->dup_block, 0)->count += e->count;
H A Dtree-cfg.c1412 e0 = EDGE_SUCC (bb, 0);
1413 e1 = EDGE_SUCC (bb, 1);
1991 remove_edge (EDGE_SUCC (bb, 0));
4075 || EDGE_SUCC (src, EDGE_SUCC (src, 0) == e)->dest != target)
5831 edge e = EDGE_SUCC (b, 0);
5836 *false_edge = EDGE_SUCC (b, 1);
5841 *true_edge = EDGE_SUCC (b, 1);
H A Dtree-ssa-dom.c602 && (EDGE_SUCC (bb, 0)->flags & EDGE_ABNORMAL) == 0
603 && (EDGE_SUCC (bb, 1)->flags & EDGE_ABNORMAL) == 0)
H A Dcfg.c922 EDGE_SUCC (bb, 0)->probability = REG_BR_PROB_BASE;
H A Dcfglayout.c785 && (EDGE_SUCC (bb, 0)->flags & EDGE_CROSSING))
H A Dflow.c2017 bb_true = EDGE_SUCC (bb, 0)->dest;
2020 bb_false = EDGE_SUCC (bb, 1)->dest;
2022 if (EDGE_SUCC (bb, 0)->flags & EDGE_FALLTHRU)
2029 gcc_assert (EDGE_SUCC (bb, 1)->flags & EDGE_FALLTHRU);
H A Difcvt.c2755 || (EDGE_SUCC (combo_bb, 0)->dest == EXIT_BLOCK_PTR
2758 || ((EDGE_SUCC (combo_bb, 0)->flags & EDGE_EH)
2813 then_edge = EDGE_SUCC (test_bb, 0);
2814 else_edge = EDGE_SUCC (test_bb, 1);
H A Drtl-factoring.c1013 remove_edge (EDGE_SUCC (bb, 0));

Completed in 905 milliseconds

12