Home
last modified time | relevance | path

Searched refs:find_edge (Results 1 – 25 of 107) sorted by relevance

12345

/netbsd-src/external/gpl3/gcc.old/dist/gcc/
H A Dcfganal.h58 edge find_edge (basic_block, basic_block);
H A Dgimple-ssa-split-paths.c89 || find_edge (bb_idom, EDGE_PRED (bb, 0)->src)) in find_block_to_duplicate_for_splitting_paths()
91 || find_edge (bb_idom, EDGE_PRED (bb, 1)->src))) in find_block_to_duplicate_for_splitting_paths()
H A Dtree-ssa-ifcombine.c160 edge e1 = find_edge (bb1, dest); in same_phi_args_p()
161 edge e2 = find_edge (bb2, dest); in same_phi_args_p()
343 edge outer_to_inner = find_edge (outer_cond_bb, inner_cond_bb); in update_profile_after_ifcombine()
H A Dtree-cfgcleanup.c117 edge case_edge = find_edge (bb, case_bb); in convert_single_case_switch()
118 edge default_edge = find_edge (bb, default_bb); in convert_single_case_switch()
537 s = find_edge (e->src, dest); in remove_forwarder_block()
1217 s = find_edge (e->src, dest); in remove_forwarder_block_with_phi()
H A Domp-expand.c3383 find_edge (entry_bb, l0_bb)->flags = EDGE_TRUE_VALUE; in expand_omp_for_generic()
3384 find_edge (entry_bb, l3_bb)->flags = EDGE_FALSE_VALUE; in expand_omp_for_generic()
3390 e = find_edge (cont_bb, l3_bb); in expand_omp_for_generic()
3403 e = find_edge (cont_bb, l1_bb); in expand_omp_for_generic()
3424 find_edge (cont_bb, l2_bb)->probability = e->probability.invert (); in expand_omp_for_generic()
3428 e = find_edge (cont_bb, l2_bb); in expand_omp_for_generic()
3448 edge l2_to_l3 = find_edge (l2_bb, l3_bb); in expand_omp_for_generic()
3452 edge latch_to_l1 = find_edge (latch, l1_bb); in expand_omp_for_generic()
3460 edge l0_to_l1 = find_edge (l0_bb, l1_bb); in expand_omp_for_generic()
3463 edge entry_to_l0 = find_edge (entry_bb, l0_bb); in expand_omp_for_generic()
[all …]
H A Dtree-ssa-tail-merge.c517 int n = find_edge (bb, BASIC_BLOCK_FOR_FN (cfun, s))->dest_idx; in same_succ_hash()
1390 e1 = find_edge (bb1, succ); in same_phi_alternatives()
1391 e2 = find_edge (bb2, succ); in same_phi_alternatives()
1591 e2 = find_edge (bb2, e1->dest); in replace_block_by()
H A Dtree-switch-conversion.c206 edge e, e_default = find_edge (m_switch_bb, m_default_bb); in check_all_empty_except_final()
349 e = find_edge (m_switch_bb, bb); in gather_default_values()
385 e = find_edge (m_switch_bb, bb); in build_constructors()
876 edge e_default = find_edge (bb1, bb2); in gen_inbound_check()
1146 edge case_edge = find_edge (m_case_bb, sc->m_case_bb); in emit()
1162 edge case_edge = find_edge (m_case_bb, sc->m_case_bb); in emit()
1738 edge case_edge = find_edge (bb, case_bb); in analyze_switch_statement()
H A Dtree-ssa-threadupdate.c545 edge e2 = find_edge (new_bb, e->dest); in update_destination_phis()
998 victim = find_edge (rd->dup_blocks[count], (*path)[i]->e->dest); in ssa_fix_duplicate_block_edges()
2062 edge e2 = find_edge (joiner, final_dest); in mark_threaded_blocks()
2181 edge new_edge = find_edge (src_copy, e->dest); in rewire_first_differing_edge()
2438 edge fix_e = find_edge (region_copy[n_region - 1], exit->dest); in duplicate_thread_path()
H A Dcprop.c1419 dest = split_edge (find_edge (bb, dest)); in find_implicit_sets()
1629 edest = find_edge (bb, dest); in bypass_block()
1640 && find_edge (e->src, dest)) in bypass_block()
H A Dcfghooks.c458 s = find_edge (e->src, new_succ); in redirect_edge_succ_nodup()
504 else if (find_edge (src, dest) == e) in redirect_edge_and_branch_force()
934 && find_edge (loop->latch, dummy) == NULL) in make_forwarder_block()
H A Dtree-ssa-uncprop.c214 find_edge (bb, BASIC_BLOCK_FOR_FN (cfun, i))->aux = in associate_equivalences_with_edges()
/netbsd-src/external/gpl3/gcc/dist/gcc/
H A Dcfganal.h61 edge find_edge (basic_block, basic_block);
H A Dtree-ssa-ifcombine.cc162 edge e1 = find_edge (bb1, dest); in same_phi_args_p()
163 edge e2 = find_edge (bb2, dest); in same_phi_args_p()
345 edge outer_to_inner = find_edge (outer_cond_bb, inner_cond_bb); in update_profile_after_ifcombine()
H A Dgimple-ssa-split-paths.cc90 || find_edge (bb_idom, EDGE_PRED (bb, 0)->src)) in find_block_to_duplicate_for_splitting_paths()
92 || find_edge (bb_idom, EDGE_PRED (bb, 1)->src))) in find_block_to_duplicate_for_splitting_paths()
H A Dgimple-range-path.cc303 edge e_in = find_edge (prev, bb); in ssa_range_in_phi()
458 edge e = find_edge (bb, next); in compute_ranges_in_block()
817 edge e_in = find_edge (prev, bb); in compute_phi_relations()
H A Dtree-cfgcleanup.cc117 edge case_edge = find_edge (bb, case_bb); in convert_single_case_switch()
118 edge default_edge = find_edge (bb, default_bb); in convert_single_case_switch()
559 s = find_edge (e->src, dest); in remove_forwarder_block()
1235 s = find_edge (e->src, dest); in remove_forwarder_block_with_phi()
H A Dtree-ssa-tail-merge.cc517 int n = find_edge (bb, BASIC_BLOCK_FOR_FN (cfun, s))->dest_idx; in same_succ_hash()
1402 e1 = find_edge (bb1, succ); in same_phi_alternatives()
1403 e2 = find_edge (bb2, succ); in same_phi_alternatives()
1603 e2 = find_edge (bb2, e1->dest); in replace_block_by()
H A Dcfghooks.cc474 s = find_edge (e->src, new_succ); in redirect_edge_succ_nodup()
520 else if (find_edge (src, dest) == e) in redirect_edge_and_branch_force()
956 && find_edge (loop->latch, dummy) == NULL) in make_forwarder_block()
1432 new_edges[j] = find_edge (src, dest); in copy_bbs()
H A Dtree-switch-conversion.cc207 edge e, e_default = find_edge (m_switch_bb, m_default_bb); in check_all_empty_except_final()
350 e = find_edge (m_switch_bb, bb); in gather_default_values()
386 e = find_edge (m_switch_bb, bb); in build_constructors()
877 edge e_default = find_edge (bb1, bb2); in gen_inbound_check()
1144 edge case_edge = find_edge (m_case_bb, sc->m_case_bb); in emit()
1160 edge case_edge = find_edge (m_case_bb, sc->m_case_bb); in emit()
1780 edge case_edge = find_edge (bb, case_bb); in analyze_switch_statement()
H A Domp-expand.cc2369 e3 = find_edge (ne->dest, next_bb); in expand_omp_for_init_counts()
2925 e3 = find_edge (ne->dest, next_bb); in expand_omp_for_init_vars()
4564 find_edge (entry_bb, l0_bb)->flags = EDGE_TRUE_VALUE; in expand_omp_for_generic()
4565 find_edge (entry_bb, l3_bb)->flags = EDGE_FALSE_VALUE; in expand_omp_for_generic()
4571 e = find_edge (cont_bb, l3_bb); in expand_omp_for_generic()
4584 e = find_edge (cont_bb, l1_bb); in expand_omp_for_generic()
4605 find_edge (cont_bb, l2_bb)->probability = e->probability.invert (); in expand_omp_for_generic()
4609 e = find_edge (cont_bb, l2_bb); in expand_omp_for_generic()
4629 edge l2_to_l3 = find_edge (l2_bb, l3_bb); in expand_omp_for_generic()
4633 edge latch_to_l1 = find_edge (latch, l1_bb); in expand_omp_for_generic()
[all …]
H A Dtree-ssa-threadupdate.cc627 edge e2 = find_edge (new_bb, e->dest); in update_destination_phis()
1080 victim = find_edge (rd->dup_blocks[count], (*path)[i]->e->dest); in ssa_fix_duplicate_block_edges()
2144 edge e2 = find_edge (joiner, final_dest); in mark_threaded_blocks()
2266 edge new_edge = find_edge (src_copy, e->dest); in rewire_first_differing_edge()
2513 edge fix_e = find_edge (region_copy[n_region - 1], exit->dest); in duplicate_thread_path()
H A Dtree-ssa-threadbackward.cc308 return find_edge (gimple_bb (sw), label_to_block (cfun, CASE_LABEL (label))); in find_taken_edge_switch()
881 edge e = find_edge (bb1, bb2); in register_path()
H A Dcprop.cc1417 dest = split_edge (find_edge (bb, dest)); in find_implicit_sets()
1629 edest = find_edge (bb, dest); in bypass_block()
1640 if (dest && setcc && find_edge (e->src, dest)) in bypass_block()
H A Dtree-ssa-uncprop.cc214 find_edge (bb, BASIC_BLOCK_FOR_FN (cfun, i))->aux = in associate_equivalences_with_edges()
H A Dcfg.cc319 edge e = find_edge (src, dst); in cached_make_edge()
332 edge e = find_edge (src, dest); in make_edge()

12345