Home
last modified time | relevance | path

Searched refs:EDGE_COUNT (Results 1 – 25 of 285) sorted by relevance

12345678910>>...12

/netbsd/external/gpl3/gcc/dist/gcc/
H A Dcfganal.c104 if (EDGE_COUNT (dest->succs) > 0) in mark_dfs_back_edges()
436 num_edges += EDGE_COUNT (bb->succs); in control_dependences()
498 if (EDGE_COUNT (pred->succs) <= EDGE_COUNT (succ->preds)) in find_edge()
581 if (EDGE_COUNT (bb->succs) == 0) in add_noreturn_fake_exit_edges()
664 if (EDGE_COUNT (dest->succs) > 0) in post_order_compute()
819 && EDGE_COUNT (bb->preds) > 0) in inverted_post_order_compute()
833 if (EDGE_COUNT (bb->succs) == 0) in inverted_post_order_compute()
998 if (EDGE_COUNT (dest->succs) > 0) in pre_and_rev_post_order_compute_fn()
1618 if (EDGE_COUNT (b->preds) >= 2) in compute_dominance_frontiers()
1801 if (ix == EDGE_COUNT (b->succs)) in bitmap_union_of_succs()
[all …]
H A Dcfganal.cc105 if (EDGE_COUNT (dest->succs) > 0) in mark_dfs_back_edges()
450 num_edges += EDGE_COUNT (bb->succs); in control_dependences()
523 if (EDGE_COUNT (pred->succs) <= EDGE_COUNT (succ->preds)) in find_edge()
606 if (EDGE_COUNT (bb->succs) == 0) in add_noreturn_fake_exit_edges()
693 if (EDGE_COUNT (dest->succs) > 0) in post_order_compute()
846 && EDGE_COUNT (bb->preds) > 0) in inverted_post_order_compute()
860 if (EDGE_COUNT (bb->succs) == 0) in inverted_post_order_compute()
1025 if (EDGE_COUNT (dest->succs) > 0) in pre_and_rev_post_order_compute_fn()
1645 if (EDGE_COUNT (b->preds) >= 2) in compute_dominance_frontiers()
1828 if (ix == EDGE_COUNT (b->succs)) in bitmap_union_of_succs()
[all …]
H A Dbasic-block.h310 #define EDGE_CRITICAL_P(e) (EDGE_COUNT ((e)->src->succs) >= 2 \
311 && EDGE_COUNT ((e)->dest->preds) >= 2)
313 #define EDGE_COUNT(ev) vec_safe_length (ev) macro
323 return EDGE_COUNT (bb->succs) == 1; in single_succ_p()
331 return EDGE_COUNT (bb->preds) == 1; in single_pred_p()
408 i.index = EDGE_COUNT (*ev) - 1; in ei_last_1()
418 return (i.index == EDGE_COUNT (ei_container (i))); in ei_end_p()
426 return (i.index + 1 == EDGE_COUNT (ei_container (i))); in ei_one_before_end_p()
433 gcc_checking_assert (i->index < EDGE_COUNT (ei_container (*i))); in ei_next()
H A Dgimple-ssa-split-paths.c72 if (EDGE_COUNT (bb->preds) == 2 in find_block_to_duplicate_for_splitting_paths()
75 && EDGE_COUNT (bb->succs) == 2 in find_block_to_duplicate_for_splitting_paths()
165 = EDGE_COUNT (pred1->succs) == 1 ? count_stmts_in_block (pred1) : 0; in is_feasible_trace()
167 = EDGE_COUNT (pred2->succs) == 1 ? count_stmts_in_block (pred2) : 0; in is_feasible_trace()
467 if (EDGE_COUNT (pred0->succs) != 1) in split_paths()
H A Dcfgcleanup.c270 if (EDGE_COUNT (e->src->succs) != 2) in thread_jump()
272 if (EDGE_COUNT (b->succs) != 2) in thread_jump()
1629 if (EDGE_COUNT (bb1->succs) == 2 in outgoing_edges_match()
1834 if (EDGE_COUNT (bb1->succs) != EDGE_COUNT (bb2->succs)) in outgoing_edges_match()
1985 if (EDGE_COUNT (src1->preds) == 0 || EDGE_COUNT (src2->preds) == 0) in try_crossjump_to_edge()
2009 if (EDGE_COUNT (src1->preds) == 0 || EDGE_COUNT (src2->preds) == 0) in try_crossjump_to_edge()
2188 if (EDGE_COUNT (bb->preds) < 2) in try_crossjump_bb()
2219 if (EDGE_COUNT (bb->preds) > max) in try_crossjump_bb()
2400 if (EDGE_COUNT (bb->preds) != 1) in try_head_merge_bb()
2710 || (EDGE_COUNT (b->succs) == 0 in try_optimize_cfg()
[all …]
H A Dcfgcleanup.cc269 if (EDGE_COUNT (e->src->succs) != 2) in thread_jump()
271 if (EDGE_COUNT (b->succs) != 2) in thread_jump()
1616 if (EDGE_COUNT (bb1->succs) == 2 in outgoing_edges_match()
1821 if (EDGE_COUNT (bb1->succs) != EDGE_COUNT (bb2->succs)) in outgoing_edges_match()
1972 if (EDGE_COUNT (src1->preds) == 0 || EDGE_COUNT (src2->preds) == 0) in try_crossjump_to_edge()
1996 if (EDGE_COUNT (src1->preds) == 0 || EDGE_COUNT (src2->preds) == 0) in try_crossjump_to_edge()
2179 if (EDGE_COUNT (bb->preds) < 2) in try_crossjump_bb()
2210 if (EDGE_COUNT (bb->preds) > max) in try_crossjump_bb()
2386 if (EDGE_COUNT (bb->preds) != 1) in try_head_merge_bb()
2681 || (EDGE_COUNT (b->succs) == 0 in try_optimize_cfg()
[all …]
H A Dgimple-ssa-split-paths.cc73 if (EDGE_COUNT (bb->preds) == 2 in find_block_to_duplicate_for_splitting_paths()
76 && EDGE_COUNT (bb->succs) == 2 in find_block_to_duplicate_for_splitting_paths()
166 = EDGE_COUNT (pred1->succs) == 1 ? count_stmts_in_block (pred1) : 0; in is_feasible_trace()
168 = EDGE_COUNT (pred2->succs) == 1 ? count_stmts_in_block (pred2) : 0; in is_feasible_trace()
505 if (EDGE_COUNT (pred0->succs) != 1) in split_paths()
H A Dcfgbuild.c652 if (EDGE_COUNT (b->succs) == 2) in compute_outgoing_frequencies()
716 unsigned int ns = EDGE_COUNT (bb->succs); in find_many_sub_basic_blocks()
719 if (n == last_basic_block_for_fn (cfun) && ns == EDGE_COUNT (bb->succs)) in find_many_sub_basic_blocks()
720 n_succs[bb->index] = EDGE_COUNT (bb->succs); in find_many_sub_basic_blocks()
780 else if (EDGE_COUNT (bb->succs) == n_succs[bb->index]) in find_many_sub_basic_blocks()
787 && EDGE_COUNT (bb->succs) >= 2) in find_many_sub_basic_blocks()
H A Dcfgbuild.cc652 if (EDGE_COUNT (b->succs) == 2) in compute_outgoing_frequencies()
716 unsigned int ns = EDGE_COUNT (bb->succs); in find_many_sub_basic_blocks()
719 if (n == last_basic_block_for_fn (cfun) && ns == EDGE_COUNT (bb->succs)) in find_many_sub_basic_blocks()
720 n_succs[bb->index] = EDGE_COUNT (bb->succs); in find_many_sub_basic_blocks()
780 else if (EDGE_COUNT (bb->succs) == n_succs[bb->index]) in find_many_sub_basic_blocks()
787 && EDGE_COUNT (bb->succs) >= 2) in find_many_sub_basic_blocks()
H A Dbb-reorder.c613 || EDGE_COUNT (best_edge->dest->preds) > 1)) in find_traces_1_round()
1201 int count = EDGE_COUNT (best->dest->preds); in connect_traces()
1364 if (EDGE_COUNT (bb->preds) < 2) in copy_bb_p()
1370 if (EDGE_COUNT (bb->succs) > 8) in copy_bb_p()
1821 if (EDGE_COUNT (bb->succs) != 2) in set_edge_can_fallthru_flag()
1906 if (EDGE_COUNT (cur_bb->succs) > 0) in fix_up_fall_thru_edges()
1911 if (EDGE_COUNT (cur_bb->succs) > 1) in fix_up_fall_thru_edges()
2116 if (EDGE_COUNT (cur_bb->succs) > 0) in fix_crossing_conditional_branches()
2121 if (EDGE_COUNT (cur_bb->succs) > 1) in fix_crossing_conditional_branches()
2221 if (EDGE_COUNT (new_bb->succs) == 0) in fix_crossing_conditional_branches()
[all …]
H A Dbb-reorder.cc613 || EDGE_COUNT (best_edge->dest->preds) > 1)) in find_traces_1_round()
1201 int count = EDGE_COUNT (best->dest->preds); in connect_traces()
1364 if (EDGE_COUNT (bb->preds) < 2) in copy_bb_p()
1370 if (EDGE_COUNT (bb->succs) > 8) in copy_bb_p()
1821 if (EDGE_COUNT (bb->succs) != 2) in set_edge_can_fallthru_flag()
1906 if (EDGE_COUNT (cur_bb->succs) > 0) in fix_up_fall_thru_edges()
1911 if (EDGE_COUNT (cur_bb->succs) > 1) in fix_up_fall_thru_edges()
2116 if (EDGE_COUNT (cur_bb->succs) > 0) in fix_crossing_conditional_branches()
2121 if (EDGE_COUNT (cur_bb->succs) > 1) in fix_crossing_conditional_branches()
2221 if (EDGE_COUNT (new_bb->succs) == 0) in fix_crossing_conditional_branches()
[all …]
H A Dipa-utils.c583 if (EDGE_COUNT (srcbb->succs) != EDGE_COUNT (dstbb->succs)) in ipa_merge_profiles()
592 for (i = 0; i < EDGE_COUNT (srcbb->succs); i++) in ipa_merge_profiles()
639 for (i = 0; i < EDGE_COUNT (srcbb->succs); i++) in ipa_merge_profiles()
649 for (i = 0; i < EDGE_COUNT (srcbb->succs); i++) in ipa_merge_profiles()
H A Dipa-utils.cc583 if (EDGE_COUNT (srcbb->succs) != EDGE_COUNT (dstbb->succs)) in ipa_merge_profiles()
592 for (i = 0; i < EDGE_COUNT (srcbb->succs); i++) in ipa_merge_profiles()
639 for (i = 0; i < EDGE_COUNT (srcbb->succs); i++) in ipa_merge_profiles()
649 for (i = 0; i < EDGE_COUNT (srcbb->succs); i++) in ipa_merge_profiles()
H A Dcfghooks.c393 if (EDGE_COUNT (e->src->succs) != 2) in can_remove_branch_p()
410 gcc_assert (EDGE_COUNT (e->src->succs) == 2); in remove_branch()
620 while (EDGE_COUNT (bb->preds) != 0) in delete_basic_block()
622 while (EDGE_COUNT (bb->succs) != 0) in delete_basic_block()
830 while (EDGE_COUNT (a->succs) != 0) in merge_blocks()
1450 if (EDGE_COUNT (bb->succs) in profile_record_check_consistency()
1456 if (EDGE_COUNT (bb->succs) && (lsum.differs_from_p (bb->count))) in profile_record_check_consistency()
1469 if (EDGE_COUNT (bb->preds) in profile_record_check_consistency()
H A Dtree-ssa-threadbackward.c236 if (EDGE_COUNT (bb->succs) > 1 && EDGE_COUNT (bb->preds) > 1) in profitable_jump_thread_path()
822 if (EDGE_COUNT (bb->succs) > 1) in execute()
883 if (EDGE_COUNT (bb->succs) > 1) in execute()
H A Dshrink-wrap.c140 if (EDGE_COUNT (live_edge->dest->preds) > 2) in live_edge_for_reg()
279 if (EDGE_COUNT (next_block->preds) == 2) in move_insn_for_shrink_wrap()
282 if (EDGE_COUNT (bb->succs) == 1) in move_insn_for_shrink_wrap()
386 if (!live_edge || EDGE_COUNT (live_edge->dest->preds) > 1) in move_insn_for_shrink_wrap()
561 if (EDGE_COUNT (e->src->succs) > 1) in handle_simple_exit()
926 if (EDGE_COUNT (dup->succs) == 0) in try_shrink_wrapping()
1126 if (EDGE_COUNT (bb->succs) == 0) in init_separate_shrink_wrap()
1592 if (EDGE_COUNT (bb->succs) == 0) in emit_common_tails_for_components()
/netbsd/external/gpl3/gcc.old/dist/gcc/
H A Dcfganal.c104 if (EDGE_COUNT (dest->succs) > 0) in mark_dfs_back_edges()
436 num_edges += EDGE_COUNT (bb->succs); in control_dependences()
498 if (EDGE_COUNT (pred->succs) <= EDGE_COUNT (succ->preds)) in find_edge()
581 if (EDGE_COUNT (bb->succs) == 0) in add_noreturn_fake_exit_edges()
664 if (EDGE_COUNT (dest->succs) > 0) in post_order_compute()
819 && EDGE_COUNT (bb->preds) > 0) in inverted_post_order_compute()
833 if (EDGE_COUNT (bb->succs) == 0) in inverted_post_order_compute()
998 if (EDGE_COUNT (dest->succs) > 0) in pre_and_rev_post_order_compute_fn()
1618 if (EDGE_COUNT (b->preds) >= 2) in compute_dominance_frontiers()
1801 if (ix == EDGE_COUNT (b->succs)) in bitmap_union_of_succs()
[all …]
H A Dbasic-block.h310 #define EDGE_CRITICAL_P(e) (EDGE_COUNT ((e)->src->succs) >= 2 \
311 && EDGE_COUNT ((e)->dest->preds) >= 2)
313 #define EDGE_COUNT(ev) vec_safe_length (ev) macro
323 return EDGE_COUNT (bb->succs) == 1; in single_succ_p()
331 return EDGE_COUNT (bb->preds) == 1; in single_pred_p()
408 i.index = EDGE_COUNT (*ev) - 1; in ei_last_1()
418 return (i.index == EDGE_COUNT (ei_container (i))); in ei_end_p()
426 return (i.index + 1 == EDGE_COUNT (ei_container (i))); in ei_one_before_end_p()
433 gcc_checking_assert (i->index < EDGE_COUNT (ei_container (*i))); in ei_next()
H A Dgimple-ssa-split-paths.c72 if (EDGE_COUNT (bb->preds) == 2 in find_block_to_duplicate_for_splitting_paths()
75 && EDGE_COUNT (bb->succs) == 2 in find_block_to_duplicate_for_splitting_paths()
165 = EDGE_COUNT (pred1->succs) == 1 ? count_stmts_in_block (pred1) : 0; in is_feasible_trace()
167 = EDGE_COUNT (pred2->succs) == 1 ? count_stmts_in_block (pred2) : 0; in is_feasible_trace()
467 if (EDGE_COUNT (pred0->succs) != 1) in split_paths()
H A Dcfgcleanup.c270 if (EDGE_COUNT (e->src->succs) != 2) in thread_jump()
272 if (EDGE_COUNT (b->succs) != 2) in thread_jump()
1629 if (EDGE_COUNT (bb1->succs) == 2 in outgoing_edges_match()
1834 if (EDGE_COUNT (bb1->succs) != EDGE_COUNT (bb2->succs)) in outgoing_edges_match()
1985 if (EDGE_COUNT (src1->preds) == 0 || EDGE_COUNT (src2->preds) == 0) in try_crossjump_to_edge()
2009 if (EDGE_COUNT (src1->preds) == 0 || EDGE_COUNT (src2->preds) == 0) in try_crossjump_to_edge()
2188 if (EDGE_COUNT (bb->preds) < 2) in try_crossjump_bb()
2219 if (EDGE_COUNT (bb->preds) > max) in try_crossjump_bb()
2400 if (EDGE_COUNT (bb->preds) != 1) in try_head_merge_bb()
2710 || (EDGE_COUNT (b->succs) == 0 in try_optimize_cfg()
[all …]
H A Dcfgbuild.c652 if (EDGE_COUNT (b->succs) == 2) in compute_outgoing_frequencies()
716 unsigned int ns = EDGE_COUNT (bb->succs); in find_many_sub_basic_blocks()
719 if (n == last_basic_block_for_fn (cfun) && ns == EDGE_COUNT (bb->succs)) in find_many_sub_basic_blocks()
720 n_succs[bb->index] = EDGE_COUNT (bb->succs); in find_many_sub_basic_blocks()
780 else if (EDGE_COUNT (bb->succs) == n_succs[bb->index]) in find_many_sub_basic_blocks()
787 && EDGE_COUNT (bb->succs) >= 2) in find_many_sub_basic_blocks()
H A Dbb-reorder.c613 || EDGE_COUNT (best_edge->dest->preds) > 1)) in find_traces_1_round()
1201 int count = EDGE_COUNT (best->dest->preds); in connect_traces()
1364 if (EDGE_COUNT (bb->preds) < 2) in copy_bb_p()
1370 if (EDGE_COUNT (bb->succs) > 8) in copy_bb_p()
1821 if (EDGE_COUNT (bb->succs) != 2) in set_edge_can_fallthru_flag()
1906 if (EDGE_COUNT (cur_bb->succs) > 0) in fix_up_fall_thru_edges()
1911 if (EDGE_COUNT (cur_bb->succs) > 1) in fix_up_fall_thru_edges()
2116 if (EDGE_COUNT (cur_bb->succs) > 0) in fix_crossing_conditional_branches()
2121 if (EDGE_COUNT (cur_bb->succs) > 1) in fix_crossing_conditional_branches()
2221 if (EDGE_COUNT (new_bb->succs) == 0) in fix_crossing_conditional_branches()
[all …]
H A Dipa-utils.c583 if (EDGE_COUNT (srcbb->succs) != EDGE_COUNT (dstbb->succs)) in ipa_merge_profiles()
592 for (i = 0; i < EDGE_COUNT (srcbb->succs); i++) in ipa_merge_profiles()
639 for (i = 0; i < EDGE_COUNT (srcbb->succs); i++) in ipa_merge_profiles()
649 for (i = 0; i < EDGE_COUNT (srcbb->succs); i++) in ipa_merge_profiles()
H A Dcfghooks.c393 if (EDGE_COUNT (e->src->succs) != 2) in can_remove_branch_p()
410 gcc_assert (EDGE_COUNT (e->src->succs) == 2); in remove_branch()
620 while (EDGE_COUNT (bb->preds) != 0) in delete_basic_block()
622 while (EDGE_COUNT (bb->succs) != 0) in delete_basic_block()
830 while (EDGE_COUNT (a->succs) != 0) in merge_blocks()
1450 if (EDGE_COUNT (bb->succs) in profile_record_check_consistency()
1456 if (EDGE_COUNT (bb->succs) && (lsum.differs_from_p (bb->count))) in profile_record_check_consistency()
1469 if (EDGE_COUNT (bb->preds) in profile_record_check_consistency()
H A Dtree-ssa-threadbackward.c236 if (EDGE_COUNT (bb->succs) > 1 && EDGE_COUNT (bb->preds) > 1) in profitable_jump_thread_path()
822 if (EDGE_COUNT (bb->succs) > 1) in execute()
883 if (EDGE_COUNT (bb->succs) > 1) in execute()

12345678910>>...12