Home
last modified time | relevance | path

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

123

/freebsd-10-stable/contrib/gcc/
Dsbitmap.c538 for (e = NULL, ix = 0; ix < EDGE_COUNT (b->succs); ix++) in sbitmap_intersection_of_succs()
551 for (++ix; ix < EDGE_COUNT (b->succs); ix++) in sbitmap_intersection_of_succs()
578 for (e = NULL, ix = 0; ix < EDGE_COUNT (b->preds); ix++) in sbitmap_intersection_of_preds()
591 for (++ix; ix < EDGE_COUNT (b->preds); ix++) in sbitmap_intersection_of_preds()
618 for (ix = 0; ix < EDGE_COUNT (b->succs); ix++) in sbitmap_union_of_succs()
628 if (ix == EDGE_COUNT (b->succs)) in sbitmap_union_of_succs()
631 for (ix++; ix < EDGE_COUNT (b->succs); ix++) in sbitmap_union_of_succs()
658 for (ix = 0; ix < EDGE_COUNT (b->preds); ix++) in sbitmap_union_of_preds()
668 if (ix == EDGE_COUNT (b->preds)) in sbitmap_union_of_preds()
671 for (ix++; ix < EDGE_COUNT (b->preds); ix++) in sbitmap_union_of_preds()
Dcfganal.c205 if (EDGE_COUNT (dest->succs) > 0) in mark_dfs_back_edges()
262 if (EDGE_COUNT (bb->succs) != 2) in set_edge_can_fallthru_flag()
356 num_edges += EDGE_COUNT (bb->succs); in create_edge_list()
487 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()
692 if (EDGE_COUNT (dest->succs) > 0) in post_order_compute()
786 if (EDGE_COUNT (dest->succs) > 0) in pre_and_rev_post_order_compute()
1045 if (EDGE_COUNT (b->preds) >= 2) in compute_dominance_frontiers_1()
Dbasic-block.h593 #define EDGE_CRITICAL_P(e) (EDGE_COUNT ((e)->src->succs) >= 2 \
594 && EDGE_COUNT ((e)->dest->preds) >= 2)
596 #define EDGE_COUNT(ev) VEC_length (edge, (ev)) macro
606 return EDGE_COUNT (bb->succs) == 1; in single_succ_p()
614 return EDGE_COUNT (bb->preds) == 1; in single_pred_p()
691 i.index = EDGE_COUNT (*ev) - 1; in ei_last_1()
701 return (i.index == EDGE_COUNT (ei_container (i))); in ei_end_p()
709 return (i.index + 1 == EDGE_COUNT (ei_container (i))); in ei_one_before_end_p()
716 gcc_assert (i->index < EDGE_COUNT (ei_container (*i))); in ei_next()
Dcfgcleanup.c113 if (EDGE_COUNT (cbranch_block->succs) != 2) in try_simplify_condjump()
277 if (EDGE_COUNT (e->src->succs) != 2) in thread_jump()
279 if (EDGE_COUNT (b->succs) != 2) in thread_jump()
1317 if (EDGE_COUNT (bb1->succs) == 2 in outgoing_edges_match()
1326 if (EDGE_COUNT (bb2->succs) != 2 in outgoing_edges_match()
1510 if (EDGE_COUNT (bb1->succs) != EDGE_COUNT (bb2->succs)) in outgoing_edges_match()
1652 if (EDGE_COUNT (src1->preds) == 0 || EDGE_COUNT (src2->preds) == 0) in try_crossjump_to_edge()
1830 if (EDGE_COUNT (bb->preds) < 2) in try_crossjump_bb()
1861 if (EDGE_COUNT (bb->preds) > max) in try_crossjump_bb()
1871 for (ix = 0, ev = bb; ix < EDGE_COUNT (ev->preds); ) in try_crossjump_bb()
[all …]
Dbb-reorder.c549 if (best_edge && EDGE_COUNT (best_edge->dest->preds) >= 2 in find_traces_1_round()
1166 if (EDGE_COUNT (bb->preds) < 2) in copy_bb_p()
1172 if (EDGE_COUNT (bb->succs) > 8) in copy_bb_p()
1351 if (EDGE_COUNT (cur_bb->succs) > 0) in fix_up_fall_thru_edges()
1356 if (EDGE_COUNT (cur_bb->succs) > 1) in fix_up_fall_thru_edges()
1543 if (EDGE_COUNT (cur_bb->succs) > 0) in fix_crossing_conditional_branches()
1548 if (EDGE_COUNT (cur_bb->succs) > 1) in fix_crossing_conditional_branches()
1664 if (EDGE_COUNT (new_bb->succs) == 0) in fix_crossing_conditional_branches()
1696 if (EDGE_COUNT (cur_bb->succs) < 1) in fix_crossing_unconditional_branches()
Dtree-ssa-threadupdate.c732 && EDGE_COUNT (bb->preds) > 1 in thread_block()
744 redirection_data = htab_create (EDGE_COUNT (bb->succs), in thread_block()
882 if (EDGE_COUNT (bb->preds) > 0) in thread_through_all_blocks()
Dtree-phinodes.c314 int len = EDGE_COUNT (bb->preds); in reserve_phi_args_for_new_edge()
353 phi = make_phi_node (var, EDGE_COUNT (bb->preds)); in create_phi_node()
Dcfg.c216 e->dest_idx = EDGE_COUNT (dest->preds) - 1; in connect_dest()
254 if (dest_idx < EDGE_COUNT (dest->preds)) in disconnect_dest()
442 if (EDGE_COUNT (bb->succs) && abs (sum - REG_BR_PROB_BASE) > 100) in check_bb_profile()
448 if (EDGE_COUNT (bb->succs) in check_bb_profile()
Dloop-unswitch.c181 if (EDGE_COUNT (bb->succs) != 2) in may_unswitch_on()
413 gcc_assert (EDGE_COUNT (unswitch_on->succs) == 2); in unswitch_loop()
Dcfghooks.c379 while (EDGE_COUNT (bb->preds) != 0) in delete_basic_block()
381 while (EDGE_COUNT (bb->succs) != 0) in delete_basic_block()
537 while (EDGE_COUNT (a->succs) != 0) in merge_blocks()
Ddomwalk.c155 if (EDGE_COUNT (bb->preds) > 0 || bb == ENTRY_BLOCK_PTR) in walk_dominator_tree()
Dtree-ssa-loop-ch.c62 gcc_assert (EDGE_COUNT (header->succs) > 0); in should_duplicate_loop_header_p()
Dtree-ssa-loop-unswitch.c287 gcc_assert (EDGE_COUNT (unswitch_on->succs) == 2); in tree_unswitch_loop()
Dsched-ebb.c526 if (EDGE_COUNT (last_bb->preds) == 0) in schedule_ebb()
530 && EDGE_COUNT (last_bb->succs) == 0); in schedule_ebb()
Difcvt.c2740 if (EDGE_COUNT (combo_bb->succs) == 0) in merge_if_block()
2764 else if (EDGE_COUNT (join_bb->preds) < 2 in merge_if_block()
2805 if (EDGE_COUNT (test_bb->succs) != 2) in find_if_header()
2888 if (EDGE_COUNT (cur_bb->succs) == 0) in block_jumps_and_fallthru_p()
3014 if ((EDGE_COUNT (then_bb->preds) - ce_info->num_or_or_blocks) != 1) in find_if_block()
3031 if (EDGE_COUNT (then_bb->succs) > 0 in find_if_block()
3043 if (EDGE_COUNT (then_bb->succs) == 0) in find_if_block()
3216 if (EDGE_COUNT (trap_bb->preds) == 0) in find_cond_trap()
3261 if (EDGE_COUNT (bb->succs) > 0) in block_has_only_trap()
Dprofile.c528 && EDGE_COUNT (bb->succs) >= 2) in compute_branch_probabilities()
572 total += EDGE_COUNT (bb->succs); in compute_branch_probabilities()
578 && EDGE_COUNT (bb->succs) >= 2) in compute_branch_probabilities()
Dtree-ssa-phiopt.c181 if (EDGE_COUNT (bb1->succs) == 0 in tree_ssa_phiopt()
183 || EDGE_COUNT (bb2->succs) == 0) in tree_ssa_phiopt()
Dtree-ssa-propagate.c206 else if (EDGE_COUNT (bb->preds) in cfg_blocks_add()
207 >= EDGE_COUNT (VEC_index (basic_block, cfg_blocks, in cfg_blocks_add()
Dcfgrtl.c714 if (EDGE_COUNT (src->succs) >= 3 in try_redirect_by_replacing_jump()
717 || (EDGE_COUNT (src->succs) == 2 in try_redirect_by_replacing_jump()
1078 if (EDGE_COUNT (e->src->succs) >= 2 || abnormal_edge_flags) in force_nonfallthru_and_redirect()
1821 && EDGE_COUNT (bb->succs) >= 2 in rtl_verify_flow_info_1()
2242 if (EDGE_COUNT (bb->succs) == 0 || !purged) in purge_dead_edges()
2420 if (EDGE_COUNT (src->succs) == 2) in cfg_layout_redirect_edge_and_branch()
Dtree-cfg.c1409 if (EDGE_COUNT (bb->succs) != 2) in single_noncomplex_succ()
1990 while (EDGE_COUNT (bb->succs) > 0) in remove_phi_nodes_and_edges_for_unreachable_block()
2354 num_edges += EDGE_COUNT (bb->succs); in dump_cfg_stats()
3825 || EDGE_COUNT (bb->succs) >= 3) in tree_verify_flow_info()
4072 if (EDGE_COUNT (src->succs) != 2 in tree_try_redirect_by_replacing_jump()
4890 num_entry_edges = EDGE_COUNT (entry_bb->preds); in move_sese_region_to_fn()
4903 num_exit_edges = EDGE_COUNT (exit_bb->succs); in move_sese_region_to_fn()
5756 && EDGE_COUNT (EXIT_BLOCK_PTR->preds) > 0) in execute_warn_function_return()
5789 && EDGE_COUNT (EXIT_BLOCK_PTR->preds) > 0 in execute_warn_function_return()
5867 && EDGE_COUNT (EXIT_BLOCK_PTR->preds) == 0 in execute_warn_function_noreturn()
Dcfgloopmanip.c84 gcc_assert (EDGE_COUNT (e->dest->preds) <= 1); in find_path()
706 gcc_assert (EDGE_COUNT (src->succs) > 1); in loop_delete_branch_edge()
709 if (EDGE_COUNT (src->succs) > 2) in loop_delete_branch_edge()
Dtree-vectorizer.c747 gcc_assert (EDGE_COUNT (guard_edge->src->preds) == 1); in slpeel_update_phi_nodes_for_guard2()
1010 gcc_assert (EDGE_COUNT (loop1_exit_bb->succs) == 2); in slpeel_verify_cfg_after_peeling()
1018 gcc_assert (EDGE_COUNT (loop2_entry_bb->preds) == 2 in slpeel_verify_cfg_after_peeling()
Dtracer.c275 if (EDGE_COUNT (bb2->preds) > 1 in tail_duplicate()
Ddf-core.c528 if (EDGE_COUNT (bb->preds) > 0) in df_hybrid_search_forward()
580 if (EDGE_COUNT (bb->succs) > 0) in df_hybrid_search_backward()
Dpredict.c274 if ((e->src != ENTRY_BLOCK_PTR && EDGE_COUNT (e->src->succs) > 1) in tree_predict_edge()
313 && EDGE_COUNT (BLOCK_FOR_INSN (insn)->succs) >= 2); in can_predict_insn_p()
1705 if (EDGE_COUNT (loop->latch->succs) > 0) in estimate_loops_at_level()

123