Home
last modified time | relevance | path

Searched refs:EDGE_SUCC (Results 1 – 25 of 33) sorted by relevance

12

/openbsd/gnu/gcc/gcc/
H A Dtree-ssa-phiopt.c170 e1 = EDGE_SUCC (bb, 0); in tree_ssa_phiopt()
172 e2 = EDGE_SUCC (bb, 1); in tree_ssa_phiopt()
187 if (EDGE_SUCC (bb1, 0)->dest == bb2) in tree_ssa_phiopt()
189 else if (EDGE_SUCC (bb2, 0)->dest == bb1) in tree_ssa_phiopt()
201 e1 = EDGE_SUCC (bb1, 0); in tree_ssa_phiopt()
335 if (EDGE_SUCC (cond_block, 0)->dest == bb) in replace_phi_edge_with_variable()
340 EDGE_SUCC (cond_block, 0)->count += EDGE_SUCC (cond_block, 1)->count; in replace_phi_edge_with_variable()
347 EDGE_SUCC (cond_block, 1)->flags in replace_phi_edge_with_variable()
350 EDGE_SUCC (cond_block, 1)->count += EDGE_SUCC (cond_block, 0)->count; in replace_phi_edge_with_variable()
664 true_edge = EDGE_SUCC (true_edge->dest, 0); in minmax_replacement()
[all …]
H A Dtree-ssa-loop-ch.c65 if (flow_bb_inside_loop_p (loop, EDGE_SUCC (header, 0)->dest) in should_duplicate_loop_header_p()
66 && flow_bb_inside_loop_p (loop, EDGE_SUCC (header, 1)->dest)) in should_duplicate_loop_header_p()
177 if (flow_bb_inside_loop_p (loop, EDGE_SUCC (header, 0)->dest)) in copy_loop_headers()
178 exit = EDGE_SUCC (header, 0); in copy_loop_headers()
180 exit = EDGE_SUCC (header, 1); in copy_loop_headers()
H A Dloop-unswitch.c187 if (!flow_bb_inside_loop_p (loop, EDGE_SUCC (bb, 0)->dest) in may_unswitch_on()
188 || !flow_bb_inside_loop_p (loop, EDGE_SUCC (bb, 1)->dest)) in may_unswitch_on()
416 gcc_assert (flow_bb_inside_loop_p (loop, EDGE_SUCC (unswitch_on, 0)->dest)); in unswitch_loop()
417 gcc_assert (flow_bb_inside_loop_p (loop, EDGE_SUCC (unswitch_on, 1)->dest)); in unswitch_loop()
458 EDGE_SUCC (switch_bb, 0)->flags |= EDGE_IRREDUCIBLE_LOOP; in unswitch_loop()
459 EDGE_SUCC (switch_bb, 1)->flags |= EDGE_IRREDUCIBLE_LOOP; in unswitch_loop()
464 EDGE_SUCC (switch_bb, 0)->flags &= ~EDGE_IRREDUCIBLE_LOOP; in unswitch_loop()
465 EDGE_SUCC (switch_bb, 1)->flags &= ~EDGE_IRREDUCIBLE_LOOP; in unswitch_loop()
H A Dtree-ssa-dce.c757 redirect_edge_and_branch (EDGE_SUCC (bb, 0), post_dom_bb); in remove_dead_stmt()
758 PENDING_STMT (EDGE_SUCC (bb, 0)) = NULL; in remove_dead_stmt()
760 EDGE_SUCC (bb, 0)->probability = REG_BR_PROB_BASE; in remove_dead_stmt()
761 EDGE_SUCC (bb, 0)->count = bb->count; in remove_dead_stmt()
765 EDGE_SUCC (bb, 0)->flags &= ~(EDGE_TRUE_VALUE | EDGE_FALSE_VALUE); in remove_dead_stmt()
768 EDGE_SUCC (bb, 0)->flags |= EDGE_FALLTHRU; in remove_dead_stmt()
779 remove_edge (EDGE_SUCC (bb, 1)); in remove_dead_stmt()
H A Dtree-vectorizer.c513 edge e = EDGE_SUCC (new_merge_bb, 0); in slpeel_update_phi_nodes_for_guard1()
524 new_exit_e = EDGE_SUCC (*new_exit_bb, 0); in slpeel_update_phi_nodes_for_guard1()
639 edge e = EDGE_SUCC (new_merge_bb, 0); in slpeel_update_phi_nodes_for_guard2()
650 new_exit_e = EDGE_SUCC (*new_exit_bb, 0); in slpeel_update_phi_nodes_for_guard2()
878 if (EDGE_SUCC (new_loop->header, 0)->dest == new_loop->latch) in slpeel_tree_duplicate_loop_to_edge_cfg()
879 new_loop_exit_edge = EDGE_SUCC (new_loop->header, 1); in slpeel_tree_duplicate_loop_to_edge_cfg()
881 new_loop_exit_edge = EDGE_SUCC (new_loop->header, 0); in slpeel_tree_duplicate_loop_to_edge_cfg()
901 EDGE_SUCC (new_loop->header, 0)->dest)) in slpeel_tree_duplicate_loop_to_edge_cfg()
902 new_exit_e = EDGE_SUCC (new_loop->header, 0); in slpeel_tree_duplicate_loop_to_edge_cfg()
904 new_exit_e = EDGE_SUCC (new_loop->header, 1); in slpeel_tree_duplicate_loop_to_edge_cfg()
[all …]
H A Dbasic-block.h579 #define FALLTHRU_EDGE(bb) (EDGE_SUCC ((bb), 0)->flags & EDGE_FALLTHRU \
580 ? EDGE_SUCC ((bb), 0) : EDGE_SUCC ((bb), 1))
583 #define BRANCH_EDGE(bb) (EDGE_SUCC ((bb), 0)->flags & EDGE_FALLTHRU \
584 ? EDGE_SUCC ((bb), 1) : EDGE_SUCC ((bb), 0))
599 #define EDGE_SUCC(bb,i) VEC_index (edge, (bb)->succs, (i)) macro
624 return EDGE_SUCC (bb, 0); in single_succ_edge()
H A Dtree-ssa-loop-ivcanon.c88 in = EDGE_SUCC (exit->src, 0); in create_canonical_iv()
90 in = EDGE_SUCC (exit->src, 1); in create_canonical_iv()
503 non_exit = EDGE_SUCC (exit->src, 0); in remove_empty_loop()
505 non_exit = EDGE_SUCC (exit->src, 1); in remove_empty_loop()
H A Dloop-unroll.c796 if (EDGE_SUCC (exit_block, 0)->dest == desc->out_edge->dest) in unroll_loop_constant_iterations()
798 desc->out_edge = EDGE_SUCC (exit_block, 0); in unroll_loop_constant_iterations()
799 desc->in_edge = EDGE_SUCC (exit_block, 1); in unroll_loop_constant_iterations()
803 desc->out_edge = EDGE_SUCC (exit_block, 1); in unroll_loop_constant_iterations()
804 desc->in_edge = EDGE_SUCC (exit_block, 0); in unroll_loop_constant_iterations()
1120 if (EDGE_SUCC (exit_block, 0)->dest == desc->out_edge->dest) in unroll_loop_runtime_iterations()
1122 desc->out_edge = EDGE_SUCC (exit_block, 0); in unroll_loop_runtime_iterations()
1123 desc->in_edge = EDGE_SUCC (exit_block, 1); in unroll_loop_runtime_iterations()
1127 desc->out_edge = EDGE_SUCC (exit_block, 1); in unroll_loop_runtime_iterations()
1128 desc->in_edge = EDGE_SUCC (exit_block, 0); in unroll_loop_runtime_iterations()
H A Dtree-ssa-loop-manip.c528 exit = EDGE_SUCC (bb, 0); in ip_normal_pos()
530 exit = EDGE_SUCC (bb, 1); in ip_normal_pos()
871 if (exit == EDGE_SUCC (exit->src, 0)) in tree_unroll_loop()
872 nonexit = EDGE_SUCC (exit->src, 1); in tree_unroll_loop()
874 nonexit = EDGE_SUCC (exit->src, 0); in tree_unroll_loop()
H A Dsbitmap.c540 e = EDGE_SUCC (b, ix); in sbitmap_intersection_of_succs()
556 e = EDGE_SUCC (b, ix); in sbitmap_intersection_of_succs()
620 e = EDGE_SUCC (b, ix); in sbitmap_union_of_succs()
636 e = EDGE_SUCC (b, ix); in sbitmap_union_of_succs()
H A Dcfgloopmanip.c432 prob = EDGE_SUCC (switch_bb, 0)->probability; in loopify()
433 tot_prob = prob + EDGE_SUCC (switch_bb, 1)->probability; in loopify()
715 snd = e == EDGE_SUCC (src, 0) ? EDGE_SUCC (src, 1) : EDGE_SUCC (src, 0); in loop_delete_branch_edge()
H A Dbb-reorder.c1352 succ1 = EDGE_SUCC (cur_bb, 0); in fix_up_fall_thru_edges()
1357 succ2 = EDGE_SUCC (cur_bb, 1); in fix_up_fall_thru_edges()
1544 succ1 = EDGE_SUCC (cur_bb, 0); in fix_crossing_conditional_branches()
1549 succ2 = EDGE_SUCC (cur_bb, 1); in fix_crossing_conditional_branches()
1667 new_edge = EDGE_SUCC (new_bb, 0); in fix_crossing_conditional_branches()
1699 succ = EDGE_SUCC (cur_bb, 0); in fix_crossing_unconditional_branches()
H A Dcfgrtl.c718 && EDGE_SUCC (src, EDGE_SUCC (src, 0) == e)->dest != target)) in try_redirect_by_replacing_jump()
1111 && (EDGE_SUCC (jump_block, 0)->flags & EDGE_CROSSING)) in force_nonfallthru_and_redirect()
2423 edge s = EDGE_SUCC (src, EDGE_SUCC (src, 0) == e); in cfg_layout_redirect_edge_and_branch()
2592 try_redirect_by_replacing_jump (EDGE_SUCC (a, 0), b, true); in cfg_layout_merge_blocks()
2912 edge e = EDGE_SUCC (b, 0); in rtl_extract_cond_bb_edges()
2917 *branch_edge = EDGE_SUCC (b, 1); in rtl_extract_cond_bb_edges()
2922 *fallthru_edge = EDGE_SUCC (b, 1); in rtl_extract_cond_bb_edges()
H A Dcfganal.c269 EDGE_SUCC (bb, 0)->flags |= EDGE_CAN_FALLTHRU; in set_edge_can_fallthru_flag()
270 EDGE_SUCC (bb, 1)->flags |= EDGE_CAN_FALLTHRU; in set_edge_can_fallthru_flag()
H A Dcfghooks.c382 remove_edge (EDGE_SUCC (bb, 0)); in delete_basic_block()
538 remove_edge (EDGE_SUCC (a, 0)); in merge_blocks()
H A Dcfgcleanup.c1515 e2 = EDGE_SUCC (bb2, ei.index); in outgoing_edges_match()
1567 d1 = EDGE_SUCC (d1, 0)->dest; in outgoing_edges_match()
1573 d2 = EDGE_SUCC (d2, 0)->dest; in outgoing_edges_match()
1911 if (EDGE_SUCC (e->src, 0) != e) in try_crossjump_bb()
H A Dtree-cfg.c1405 e0 = EDGE_SUCC (bb, 0); in single_noncomplex_succ()
1406 e1 = EDGE_SUCC (bb, 1); in single_noncomplex_succ()
1984 remove_edge (EDGE_SUCC (bb, 0)); in remove_phi_nodes_and_edges_for_unreachable_block()
4068 || EDGE_SUCC (src, EDGE_SUCC (src, 0) == e)->dest != target) in tree_try_redirect_by_replacing_jump()
5822 edge e = EDGE_SUCC (b, 0); in extract_true_false_edges_from_block()
5827 *false_edge = EDGE_SUCC (b, 1); in extract_true_false_edges_from_block()
5832 *true_edge = EDGE_SUCC (b, 1); in extract_true_false_edges_from_block()
H A Dtree-ssa-threadupdate.c620 EDGE_SUCC (rd->dup_block, 0)->count += e->count; in redirect_edges()
H A Dtree-cfgcleanup.c310 dest = EDGE_SUCC (bb, 0)->dest; in tree_forwarder_block_p()
H A Difcvt.c2751 || (EDGE_SUCC (combo_bb, 0)->dest == EXIT_BLOCK_PTR in merge_if_block()
2754 || ((EDGE_SUCC (combo_bb, 0)->flags & EDGE_EH) in merge_if_block()
2808 then_edge = EDGE_SUCC (test_bb, 0); in find_if_header()
2809 else_edge = EDGE_SUCC (test_bb, 1); in find_if_header()
H A Dflow.c2012 bb_true = EDGE_SUCC (bb, 0)->dest; in init_propagate_block_info()
2015 bb_false = EDGE_SUCC (bb, 1)->dest; in init_propagate_block_info()
2017 if (EDGE_SUCC (bb, 0)->flags & EDGE_FALLTHRU) in init_propagate_block_info()
2024 gcc_assert (EDGE_SUCC (bb, 1)->flags & EDGE_FALLTHRU); in init_propagate_block_info()
H A Dtree-ssa-dom.c602 && (EDGE_SUCC (bb, 0)->flags & EDGE_ABNORMAL) == 0 in dom_opt_finalize_block()
603 && (EDGE_SUCC (bb, 1)->flags & EDGE_ABNORMAL) == 0) in dom_opt_finalize_block()
H A Drtl-factoring.c1013 remove_edge (EDGE_SUCC (bb, 0)); in split_pattern_seq()
H A Dcfg.c914 EDGE_SUCC (bb, 0)->probability = REG_BR_PROB_BASE; in update_bb_profile_for_threading()
/openbsd/gnu/gcc/gcc/config/mt/
H A Dmt.c1753 || !(EDGE_SUCC (loop->predecessor, 0)->flags & EDGE_FALLTHRU)) in mt_loop_nesting()
1985 work->block = EDGE_SUCC (bb, ei.index)->dest; in mt_reorg_loops()

12