Searched refs:EDGE_PRED (Results 1 - 25 of 77) sorted by relevance

1234

/netbsd-current/external/gpl3/gcc.old/dist/gcc/
H A Dgimple-ssa-split-paths.c73 && !(EDGE_PRED (bb, 0)->flags & EDGE_COMPLEX)
74 && !(EDGE_PRED (bb, 1)->flags & EDGE_COMPLEX)
88 if (!(EDGE_PRED (bb, 0)->src == bb_idom
89 || find_edge (bb_idom, EDGE_PRED (bb, 0)->src))
90 || !(EDGE_PRED (bb, 1)->src == bb_idom
91 || find_edge (bb_idom, EDGE_PRED (bb, 1)->src)))
96 if (!(EDGE_PRED (bb, 0)->src == bb_idom
97 || single_succ_p (EDGE_PRED (bb, 0)->src))
98 || !(EDGE_PRED (bb, 1)->src == bb_idom
99 || single_succ_p (EDGE_PRED (b
[all...]
H A Dgimple-streamer-in.c65 if (EDGE_PRED (bb, j)->src == sbb)
67 e = EDGE_PRED (bb, j);
H A Dtree-cfgcleanup.c840 || (EDGE_PRED (recv_bb, 0)->flags
842 || (EDGE_SUCC (bb, 0)->dest != EDGE_PRED (recv_bb, 0)->src
843 && EDGE_SUCC (bb, 1)->dest != EDGE_PRED (recv_bb, 0)->src))
846 /* EDGE_PRED (recv_bb, 0)->src should be the .ABNORMAL_DISPATCHER bb. */
847 return EDGE_PRED (recv_bb, 0);
1214 edge e = EDGE_PRED (bb, 0), s;
H A Dbasic-block.h316 #define EDGE_PRED(bb,i) (*(bb)->preds)[(i)]
352 return EDGE_PRED (bb, 0);
315 #define EDGE_PRED macro
H A Dcfganal.c1758 e = EDGE_PRED (b, ix);
1774 e = EDGE_PRED (b, ix);
1836 e = EDGE_PRED (b, ix);
1852 e = EDGE_PRED (b, ix);
H A Dtree-ssa-sink.c391 bb = EDGE_PRED (bb, PHI_ARG_INDEX_FROM_USE (use_p))->src;
H A Dcfgcleanup.c2071 && !(EDGE_PRED (src2, 0)->flags & EDGE_EH))
2215 if (BB_PARTITION (EDGE_PRED (bb, 0)->src) !=
2216 BB_PARTITION (EDGE_PRED (bb, 1)->src)
2217 || (EDGE_PRED (bb, 0)->flags & EDGE_CROSSING))
2234 e = EDGE_PRED (bb, ix);
2277 e2 = EDGE_PRED (bb, ix2);
2409 incoming_edge = EDGE_PRED (bb, 0);
H A Dtree-vect-loop-manip.c2366 edge e = EDGE_PRED (exit_bb, 0);
2748 e = EDGE_PRED (guard_to, 0);
2749 e = (e != guard_e ? e : EDGE_PRED (guard_to, 1));
2848 e = EDGE_PRED (guard_to, 0);
2849 e = (e != guard_e ? e : EDGE_PRED (guard_to, 1));
H A Dsel-sched-ir.c4887 gcc_assert (EDGE_PRED (bb, 0)->dest == bb);
4888 bb = EDGE_PRED (bb, 0)->src;
5131 pred_bbi = EDGE_PRED (bb, 0)->src->index;
5333 e = EDGE_PRED (empty_bb, 0);
5354 edge e = EDGE_PRED (empty_bb, 0);
5359 sel_redirect_edge_and_branch (EDGE_PRED (empty_bb, 0), succ);
5613 && EDGE_PRED (b, 0)->src == b->prev_bb);
H A Dtree-emutls.c651 edge e = EDGE_PRED (d.bb, i);
H A Dgimple-ssa-backprop.c857 if (EDGE_PRED (bb, index)->flags & EDGE_ABNORMAL)
H A Dhsa-regalloc.c99 predecessors.safe_push (EDGE_PRED (bb, i));
H A Dtree-ssa-tail-merge.c348 && EDGE_PRED (bb, PHI_ARG_INDEX_FROM_USE (use_p))->src == def_bb)
1568 pred_edge = EDGE_PRED (bb1, i - 1);
/netbsd-current/external/gpl3/gcc/dist/gcc/
H A Dgimple-ssa-split-paths.cc74 && !(EDGE_PRED (bb, 0)->flags & EDGE_COMPLEX)
75 && !(EDGE_PRED (bb, 1)->flags & EDGE_COMPLEX)
89 if (!(EDGE_PRED (bb, 0)->src == bb_idom
90 || find_edge (bb_idom, EDGE_PRED (bb, 0)->src))
91 || !(EDGE_PRED (bb, 1)->src == bb_idom
92 || find_edge (bb_idom, EDGE_PRED (bb, 1)->src)))
97 if (!(EDGE_PRED (bb, 0)->src == bb_idom
98 || single_succ_p (EDGE_PRED (bb, 0)->src))
99 || !(EDGE_PRED (bb, 1)->src == bb_idom
100 || single_succ_p (EDGE_PRED (b
[all...]
H A Dgimple-streamer-in.cc65 if (EDGE_PRED (bb, j)->src == sbb)
67 e = EDGE_PRED (bb, j);
H A Dtree-cfgcleanup.cc862 || (EDGE_PRED (recv_bb, 0)->flags
864 || (EDGE_SUCC (bb, 0)->dest != EDGE_PRED (recv_bb, 0)->src
865 && EDGE_SUCC (bb, 1)->dest != EDGE_PRED (recv_bb, 0)->src))
868 /* EDGE_PRED (recv_bb, 0)->src should be the .ABNORMAL_DISPATCHER bb. */
869 return EDGE_PRED (recv_bb, 0);
1232 edge e = EDGE_PRED (bb, 0), s;
H A Dbasic-block.h316 #define EDGE_PRED(bb,i) (*(bb)->preds)[(i)]
352 return EDGE_PRED (bb, 0);
315 #define EDGE_PRED macro
H A Dtree-ssa-sink.cc413 bb = EDGE_PRED (bb, PHI_ARG_INDEX_FROM_USE (use_p))->src;
615 EDGE_PRED (bb, i), UNKNOWN_LOCATION);
H A Dtree-vect-loop-manip.cc1109 std::swap (EDGE_PRED (swap_bb, 0), EDGE_PRED (swap_bb, 1));
1110 EDGE_PRED (swap_bb, 0)->dest_idx = 0;
1111 EDGE_PRED (swap_bb, 1)->dest_idx = 1;
1121 std::swap (EDGE_PRED (swap_bb, 0), EDGE_PRED (swap_bb, 1));
1122 EDGE_PRED (swap_bb, 0)->dest_idx = 0;
1123 EDGE_PRED (swap_bb, 1)->dest_idx = 1;
2445 edge e = EDGE_PRED (exit_bb, 0);
2872 e = EDGE_PRED (guard_t
[all...]
H A Dcfganal.cc1785 e = EDGE_PRED (b, ix);
1801 e = EDGE_PRED (b, ix);
1863 e = EDGE_PRED (b, ix);
1879 e = EDGE_PRED (b, ix);
H A Dcfgcleanup.cc2058 && !(EDGE_PRED (src2, 0)->flags & EDGE_EH))
2206 if (BB_PARTITION (EDGE_PRED (bb, 0)->src) !=
2207 BB_PARTITION (EDGE_PRED (bb, 1)->src)
2208 || (EDGE_PRED (bb, 0)->flags & EDGE_CROSSING))
2225 e = EDGE_PRED (bb, ix);
2268 e2 = EDGE_PRED (bb, ix2);
2395 incoming_edge = EDGE_PRED (bb, 0);
H A Dsel-sched-ir.cc4888 gcc_assert (EDGE_PRED (bb, 0)->dest == bb);
4889 bb = EDGE_PRED (bb, 0)->src;
5129 pred_bbi = EDGE_PRED (bb, 0)->src->index;
5331 e = EDGE_PRED (empty_bb, 0);
5352 edge e = EDGE_PRED (empty_bb, 0);
5357 sel_redirect_edge_and_branch (EDGE_PRED (empty_bb, 0), succ);
5611 && EDGE_PRED (b, 0)->src == b->prev_bb);
H A Dtree-emutls.cc660 edge e = EDGE_PRED (d.bb, i);
H A Dgimple-range-path.cc176 edge e = EDGE_PRED (entry, i);
H A Dgimple-ssa-backprop.cc856 if (EDGE_PRED (bb, index)->flags & EDGE_ABNORMAL)

Completed in 685 milliseconds

1234