Home
last modified time | relevance | path

Searched refs:succs (Results 1 – 25 of 75) sorted by relevance

123

/trueos/contrib/gcc/
HDcfganal.c116 FOR_EACH_EDGE (e, ei, src->succs) in can_fallthru()
140 FOR_EACH_EDGE (e, ei, src->succs) in could_fall_through()
184 stack[sp++] = ei_start (ENTRY_BLOCK_PTR->succs); in mark_dfs_back_edges()
205 if (EDGE_COUNT (dest->succs) > 0) in mark_dfs_back_edges()
209 stack[sp++] = ei_start (dest->succs); in mark_dfs_back_edges()
251 FOR_EACH_EDGE (e, ei, bb->succs) in set_edge_can_fallthru_flag()
262 if (EDGE_COUNT (bb->succs) != 2) in set_edge_can_fallthru_flag()
296 FOR_EACH_EDGE (e, ei, ENTRY_BLOCK_PTR->succs) in find_unreachable_blocks()
310 FOR_EACH_EDGE (e, ei, b->succs) in find_unreachable_blocks()
356 num_edges += EDGE_COUNT (bb->succs); in create_edge_list()
[all …]
HDcfg.c116 FOR_EACH_EDGE (e, ei, bb->succs) in clear_edges()
118 VEC_truncate (edge, bb->succs, 0); in clear_edges()
122 FOR_EACH_EDGE (e, ei, ENTRY_BLOCK_PTR->succs) in clear_edges()
125 VEC_truncate (edge, ENTRY_BLOCK_PTR->succs, 0); in clear_edges()
206 VEC_safe_push (edge, gc, e->src->succs, e); in connect_src()
228 for (ei = ei_start (src->succs); (tmp = ei_safe_edge (ei)); ) in disconnect_src()
232 VEC_unordered_remove (edge, src->succs, ei.index); in disconnect_src()
440 FOR_EACH_EDGE (e, ei, bb->succs) in check_bb_profile()
442 if (EDGE_COUNT (bb->succs) && abs (sum - REG_BR_PROB_BASE) > 100) in check_bb_profile()
446 FOR_EACH_EDGE (e, ei, bb->succs) in check_bb_profile()
[all …]
HDprofile.c144 FOR_EACH_EDGE (e, ei, bb->succs) in instrument_edges()
241 FOR_EACH_EDGE (e, ei, bb->succs) in get_exec_counts()
299 FOR_EACH_EDGE (e, ei, bb->succs) in compute_branch_probabilities()
322 FOR_EACH_EDGE (e, ei, bb->succs) in compute_branch_probabilities()
388 FOR_EACH_EDGE (e, ei, bb->succs) in compute_branch_probabilities()
417 FOR_EACH_EDGE (e, ei, bb->succs) in compute_branch_probabilities()
421 FOR_EACH_EDGE (e, ei, bb->succs) in compute_branch_probabilities()
499 FOR_EACH_EDGE (e, ei, bb->succs) in compute_branch_probabilities()
524 FOR_EACH_EDGE (e, ei, bb->succs) in compute_branch_probabilities()
528 && EDGE_COUNT (bb->succs) >= 2) in compute_branch_probabilities()
[all …]
HDcfghooks.c123 FOR_EACH_EDGE (e, ei, bb->succs) in verify_flow_info()
204 FOR_EACH_EDGE (e, ei, ENTRY_BLOCK_PTR->succs) in verify_flow_info()
269 FOR_EACH_EDGE (e, ei, bb->succs) in dump_bb()
381 while (EDGE_COUNT (bb->succs) != 0) in delete_basic_block()
537 while (EDGE_COUNT (a->succs) != 0) in merge_blocks()
541 FOR_EACH_EDGE (e, ei, b->succs) in merge_blocks()
543 a->succs = b->succs; in merge_blocks()
547 b->preds = b->succs = NULL; in merge_blocks()
722 FOR_EACH_EDGE (s, ei, bb->succs) in duplicate_block()
HDbb-reorder.c242 FOR_EACH_EDGE (e, ei, ENTRY_BLOCK_PTR->succs) in find_traces()
312 FOR_EACH_EDGE (e, ei, bb->succs) in rotate_loop()
497 FOR_EACH_EDGE (e, ei, bb->succs) in find_traces_1_round()
554 FOR_EACH_EDGE (e, ei, bb->succs) in find_traces_1_round()
685 FOR_EACH_EDGE (e, ei, bb->succs) in find_traces_1_round()
720 FOR_EACH_EDGE (e, ei, bb->succs) in find_traces_1_round()
1006 FOR_EACH_EDGE (e, ei, traces[t].last->succs) in connect_traces()
1045 FOR_EACH_EDGE (e, ei, traces[t].last->succs) in connect_traces()
1067 FOR_EACH_EDGE (e2, ei, e->dest->succs) in connect_traces()
1172 if (EDGE_COUNT (bb->succs) > 8) in copy_bb_p()
[all …]
HDcfgrtl.c450 edge_iterator ei = ei_start (ENTRY_BLOCK_PTR->succs); in emit_insn_at_entry()
507 new_bb->succs = bb->succs; in rtl_split_block()
508 bb->succs = NULL; in rtl_split_block()
509 FOR_EACH_EDGE (e, ei, new_bb->succs) in rtl_split_block()
714 if (EDGE_COUNT (src->succs) >= 3 in try_redirect_by_replacing_jump()
717 || (EDGE_COUNT (src->succs) == 2 in try_redirect_by_replacing_jump()
1059 for (ei = ei_start (ENTRY_BLOCK_PTR->succs); (tmp = ei_safe_edge (ei)); ) in force_nonfallthru_and_redirect()
1063 VEC_unordered_remove (edge, ENTRY_BLOCK_PTR->succs, ei.index); in force_nonfallthru_and_redirect()
1073 VEC_safe_push (edge, gc, bb->succs, e); in force_nonfallthru_and_redirect()
1078 if (EDGE_COUNT (e->src->succs) >= 2 || abnormal_edge_flags) in force_nonfallthru_and_redirect()
[all …]
HDpredict.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()
358 FOR_EACH_EDGE (e, ei, bb->succs) in dump_prediction()
390 FOR_EACH_EDGE (e, ei, bb->succs) in set_even_probabilities()
393 FOR_EACH_EDGE (e, ei, bb->succs) in set_even_probabilities()
533 FOR_EACH_EDGE (e, ei, bb->succs) in combine_predictions_for_bb()
768 FOR_EACH_EDGE (e, ei, bb->succs) in predict_loops()
1041 FOR_EACH_EDGE (then_edge, ei, bb->succs) in tree_predict_by_opcode()
1313 FOR_EACH_EDGE (e, ei, bb->succs) in tree_estimate_probability()
1514 FOR_EACH_EDGE (e, ei, BASIC_BLOCK (y)->succs) in predict_paths_leading_to()
[all …]
HDcfgcleanup.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()
427 for (ei = ei_start (b->succs); (e = ei_safe_edge (ei)); ) in try_forward_edges()
802 FOR_EACH_EDGE (tmp_edge, ei, c->succs) in merge_blocks_move()
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()
1513 FOR_EACH_EDGE (e1, ei, bb1->succs) in outgoing_edges_match()
1560 FOR_EACH_EDGE (e1, ei, bb2->succs) in outgoing_edges_match()
[all …]
HDcfgloop.c67 FOR_EACH_EDGE (succ, ei, bb->succs) in flow_loops_cfg_dump()
292 FOR_EACH_EDGE (e, ei, bb->succs) in mark_single_exit_loops()
896 FOR_EACH_EDGE (e, ei, bb->succs) in get_loop_body_in_bfs_order()
931 FOR_EACH_EDGE (e, ei, body[i]->succs) in get_loop_exit_edges()
938 FOR_EACH_EDGE (e, ei, body[i]->succs) in get_loop_exit_edges()
959 if (EDGE_COUNT (body[i]->succs) >= 2) in num_loop_branches()
1159 FOR_EACH_EDGE (e, ei, bb->succs) in verify_loop_structure()
1184 FOR_EACH_EDGE (e, ei, bb->succs) in verify_loop_structure()
1215 FOR_EACH_EDGE (e, ei, bb->succs) in verify_loop_structure()
HDlcm.c285 FOR_EACH_EDGE (e, ei, ENTRY_BLOCK_PTR->succs) in compute_laterin()
319 FOR_EACH_EDGE (e, ei, bb->succs) in compute_laterin()
507 FOR_EACH_EDGE (e, ei, ENTRY_BLOCK_PTR->succs) in compute_available()
540 FOR_EACH_EDGE (e, ei, bb->succs) in compute_available()
651 FOR_EACH_EDGE (e, ei, bb->succs) in compute_nearerout()
674 FOR_EACH_EDGE (e, ei, ENTRY_BLOCK_PTR->succs) in compute_nearerout()
HDtree-ssa-structalias.c445 bitmap *succs; member
832 if (graph->succs[node]) in clear_edges_for_node()
833 BITMAP_FREE (graph->succs[node]); in clear_edges_for_node()
865 if (graph->succs[from]) in merge_graph_nodes()
867 if (!graph->succs[to]) in merge_graph_nodes()
868 graph->succs[to] = BITMAP_ALLOC (&pta_obstack); in merge_graph_nodes()
869 bitmap_ior_into (graph->succs[to], in merge_graph_nodes()
870 graph->succs[from]); in merge_graph_nodes()
927 if (!graph->succs[from]) in add_graph_edge()
928 graph->succs[from] = BITMAP_ALLOC (&pta_obstack); in add_graph_edge()
[all …]
HDsched-rgn.c561 current_edge = ei_start (single_succ (ENTRY_BLOCK_PTR)->succs); in find_rgns()
636 current_edge = ei_start (ei_edge (current_edge)->dest->succs); in find_rgns()
644 FOR_EACH_EDGE (e, ei, bb->succs) in find_rgns()
753 FOR_EACH_EDGE (e, ei, bb->succs) in find_rgns()
902 FOR_EACH_EDGE (e, ei, BASIC_BLOCK (child)->succs) in find_rgns()
922 FOR_EACH_EDGE (e, ei, bb->succs) in find_rgns()
1187 FOR_EACH_EDGE (e, ei, BASIC_BLOCK (bbn)->succs) in extend_rgns()
1244 FOR_EACH_EDGE (e, ei, BASIC_BLOCK (succn)->succs) in extend_rgns()
1321 FOR_EACH_EDGE (out_edge, out_ei, in_edge->src->succs) in compute_dom_prob_ps()
1418 FOR_EACH_EDGE (e, ei, block->succs) in compute_trg_info()
[all …]
HDtree-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()
2402 FOR_EACH_EDGE (e, ei, ENTRY_BLOCK_PTR->succs) in tree_cfg2vcg()
2447 FOR_EACH_EDGE (e, ei, bb->succs) in tree_cfg2vcg()
2664 FOR_EACH_EDGE (e, ei, bb->succs) in disband_implicit_edges()
3081 FOR_EACH_EDGE (e, ei, bb->succs) in bsi_commit_edge_inserts()
3783 FOR_EACH_EDGE (e, ei, bb->succs) in tree_verify_flow_info()
3796 FOR_EACH_EDGE (e, ei, bb->succs) in tree_verify_flow_info()
3825 || EDGE_COUNT (bb->succs) >= 3) in tree_verify_flow_info()
[all …]
HDsched-ebb.c140 FOR_EACH_EDGE (e, ei, last_bb->succs) in begin_schedule_ready()
241 FOR_EACH_EDGE (e, ei, b->succs) in compute_jump_reg_dependencies()
530 && EDGE_COUNT (last_bb->succs) == 0); in schedule_ebb()
589 FOR_EACH_EDGE (e, ei, bb->succs) in schedule_ebbs()
HDcfgloopmanip.c106 FOR_EACH_EDGE (e, ei, bb->succs) in fix_bb_placement()
194 FOR_EACH_EDGE (e, ei, from->succs) in fix_bb_placements()
296 FOR_EACH_EDGE (ae, ei, rem_bbs[i]->succs) in remove_path()
465 FOR_EACH_EDGE (e, ei, switch_bb->succs) in loopify()
574 FOR_EACH_EDGE (e, ei, body[i]->succs) in fix_loop_placement()
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()
972 FOR_EACH_EDGE (ae, ei, new_bb->succs) in duplicate_loop_to_header_edge()
HDipa-cp.c453 if (ENTRY_BLOCK_PTR_FOR_FUNCTION (func)->succs) in constant_val_insert()
454 FOR_EACH_EDGE (e_step, ei, ENTRY_BLOCK_PTR_FOR_FUNCTION (func)->succs) in constant_val_insert()
748 if (bb->succs) in ipcp_profile_edge_print()
749 FOR_EACH_EDGE (e, ei, bb->succs) in ipcp_profile_edge_print()
766 FOR_EACH_EDGE (e, ei, bb->succs) in ipcp_profile_edge_print()
965 FOR_EACH_EDGE (e, ei, bb->succs) in ipcp_update_edges_counts()
HDcfgbuild.c284 FOR_EACH_EDGE (e, ei, bb->succs) in make_edges()
617 for (ei = ei_start (bb->succs); (e = ei_safe_edge (ei)); ) in purge_dead_tablejump_edges()
713 if (EDGE_COUNT (b->succs) == 2) in compute_outgoing_frequencies()
741 FOR_EACH_EDGE (e, ei, b->succs) in compute_outgoing_frequencies()
HDsbitmap.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()
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()
HDtree-if-conv.c472 FOR_EACH_EDGE (e, ei, bb->succs) in if_convertible_bb_p()
534 FOR_EACH_EDGE (e, ei, loop->header->succs) in if_convertible_loop_p()
672 FOR_EACH_EDGE (e, ei, bb[i]->succs) in clean_predicate_lists()
942 FOR_EACH_EDGE (e, ei, exit_bb->succs) in combine_blocks()
1118 FOR_EACH_EDGE (e, ei, bb->succs) in bb_with_exit_edge_p()
HDtree-ssa-threadupdate.c191 for (ei = ei_start (bb->succs); (e = ei_safe_edge (ei)); ) in remove_ctrl_stmt_and_useless_edges()
407 FOR_EACH_EDGE (e, ei, bb->succs) in prune_undesirable_thread_requests()
744 redirection_data = htab_create (EDGE_COUNT (bb->succs), in thread_block()
HDdominance.c229 ei = ei_start (bb->succs); in calc_dfs_tree_nonrec()
271 einext = ei_start (bn->succs); in calc_dfs_tree_nonrec()
341 if (EDGE_COUNT (b->succs) > 0) in calc_dfs_tree()
495 ei = (reverse) ? ei_start (bb->succs) : ei_start (bb->preds); in calc_idoms()
1005 FOR_EACH_EDGE (e, ei, bb->succs) in recount_dominator()
HDtree-cfgcleanup.c114 for (ei = ei_start (bb->succs); (e = ei_safe_edge (ei)); ) in cleanup_control_expr_graph()
211 for (ei = ei_start (bb->succs); (e = ei_safe_edge (ei)); )
242 else if (noreturn_call_p (stmt) && remove_fallthru_edge (bb->succs))
HDtree-ssa-propagate.c340 FOR_EACH_EDGE (e, ei, bb->succs) in simulate_stmt()
457 FOR_EACH_EDGE (e, ei, block->succs) in simulate_block()
514 FOR_EACH_EDGE (e, ei, bb->succs) in ssa_prop_init()
520 FOR_EACH_EDGE (e, ei, ENTRY_BLOCK_PTR->succs) in ssa_prop_init()
HDcfgloopanal.c285 FOR_EACH_EDGE (e, ei, act->succs) in mark_irreducible_loops()
293 FOR_EACH_EDGE (e, ei, act->succs) in mark_irreducible_loops()
585 FOR_EACH_EDGE (e, ei, bb->succs) in mark_loop_exit_edges()
HDcfglayout.c656 if (EDGE_COUNT (bb->succs) == 0) in fixup_reorder_chain()
663 FOR_EACH_EDGE (e, ei, bb->succs) in fixup_reorder_chain()
828 FOR_EACH_EDGE (e, ei, bb->succs) in fixup_reorder_chain()
1176 FOR_EACH_EDGE (e, ei, bbs[i]->succs) in can_copy_bbs_p()
1266 FOR_EACH_EDGE (e, ei, new_bb->succs) in copy_bbs()

123