Home
last modified time | relevance | path

Searched refs:EXIT_BLOCK_PTR (Results 1 – 25 of 109) sorted by relevance

12345

/openbsd/gnu/gcc/gcc/
H A Dcfganal.c89 if (bb == EXIT_BLOCK_PTR || bb == ENTRY_BLOCK_PTR in forwarder_block_p()
112 if (target == EXIT_BLOCK_PTR) in can_fallthru()
117 if (e->dest == EXIT_BLOCK_PTR in can_fallthru()
138 if (target == EXIT_BLOCK_PTR) in could_fall_through()
141 if (e->dest == EXIT_BLOCK_PTR in could_fall_through()
216 if (dest != EXIT_BLOCK_PTR && src != ENTRY_BLOCK_PTR in mark_dfs_back_edges()
404 if (INDEX_EDGE_SUCC_BB (elist, x) == EXIT_BLOCK_PTR) in print_edge_list()
592 remove_fake_predecessors (EXIT_BLOCK_PTR); in remove_fake_exit_edges()
607 make_single_succ_edge (bb, EXIT_BLOCK_PTR, EDGE_FAKE); in add_noreturn_fake_exit_edges()
624 basic_block unvisited_block = EXIT_BLOCK_PTR; in connect_infinite_loops_to_exit()
[all …]
H A Dcfgbuild.c285 if (e->dest != EXIT_BLOCK_PTR) in make_edges()
350 cached_make_edge (edge_cache, bb, EXIT_BLOCK_PTR, 0); in make_edges()
365 cached_make_edge (edge_cache, bb, EXIT_BLOCK_PTR, in make_edges()
399 e = find_edge (bb, EXIT_BLOCK_PTR); in make_edges()
409 cached_make_edge (edge_cache, bb, EXIT_BLOCK_PTR, EDGE_FALLTHRU); in make_edges()
410 else if (bb->next_bb != EXIT_BLOCK_PTR) in make_edges()
538 ENTRY_BLOCK_PTR->next_bb = EXIT_BLOCK_PTR; in find_basic_blocks()
539 EXIT_BLOCK_PTR->prev_bb = ENTRY_BLOCK_PTR; in find_basic_blocks()
555 SET_BASIC_BLOCK (EXIT_BLOCK, EXIT_BLOCK_PTR); in find_basic_blocks()
566 make_edges (ENTRY_BLOCK_PTR->next_bb, EXIT_BLOCK_PTR->prev_bb, 0); in find_basic_blocks()
[all …]
H A Dprofile.c308 BB_INFO (EXIT_BLOCK_PTR)->succ_count = 2; in compute_branch_probabilities()
377 FOR_BB_BETWEEN (bb, EXIT_BLOCK_PTR, NULL, prev_bb) in compute_branch_probabilities()
507 && e->dest == EXIT_BLOCK_PTR) in compute_branch_probabilities()
509 && e->dest != EXIT_BLOCK_PTR)) in compute_branch_probabilities()
809 && e->dest != EXIT_BLOCK_PTR) in branch_prob()
811 if (e->dest == EXIT_BLOCK_PTR) in branch_prob()
828 make_edge (bb, EXIT_BLOCK_PTR, EDGE_FAKE); in branch_prob()
915 EXIT_BLOCK_PTR->index = last_basic_block; in branch_prob()
1015 EXIT_BLOCK_PTR->index = EXIT_BLOCK; in branch_prob()
1111 union_groups (EXIT_BLOCK_PTR, ENTRY_BLOCK_PTR); in find_spanning_tree()
[all …]
H A Dlcm.c130 FOR_EACH_EDGE (e, ei, EXIT_BLOCK_PTR->preds) in compute_antinout_edge()
131 e->src->aux = EXIT_BLOCK_PTR; in compute_antinout_edge()
143 if (bb->aux == EXIT_BLOCK_PTR) in compute_antinout_edge()
201 if (succ == EXIT_BLOCK_PTR) in compute_earliest()
326 && e->dest != EXIT_BLOCK_PTR && e->dest->aux == 0) in compute_laterin()
340 FOR_EACH_EDGE (e, ei, EXIT_BLOCK_PTR->preds) in compute_laterin()
367 if (b == EXIT_BLOCK_PTR) in compute_insert_delete()
541 if (!e->dest->aux && e->dest != EXIT_BLOCK_PTR) in compute_available()
577 if (succ == EXIT_BLOCK_PTR) in compute_farthest()
631 FOR_EACH_EDGE (e, ei, EXIT_BLOCK_PTR->preds) in compute_nearerout()
H A Dtree-ssa-dce.c145 gcc_assert (bb != EXIT_BLOCK_PTR); in set_control_dependence_map_bit()
177 gcc_assert (INDEX_EDGE_PRED_BB (el, edge_index) != EXIT_BLOCK_PTR); in find_control_dependence()
185 current_block != ending_block && current_block != EXIT_BLOCK_PTR; in find_control_dependence()
208 if (block == EXIT_BLOCK_PTR) in find_pdom()
209 return EXIT_BLOCK_PTR; in find_pdom()
214 return EXIT_BLOCK_PTR; in find_pdom()
444 gcc_assert (bb != EXIT_BLOCK_PTR); in mark_control_dependent_edges_necessary()
751 || post_dom_bb == EXIT_BLOCK_PTR in remove_dead_stmt()
H A Dcfg.c89 EXIT_BLOCK_PTR = ggc_alloc_cleared (sizeof (struct basic_block_def)); in init_flow()
90 EXIT_BLOCK_PTR->index = EXIT_BLOCK; in init_flow()
91 ENTRY_BLOCK_PTR->next_bb = EXIT_BLOCK_PTR; in init_flow()
92 EXIT_BLOCK_PTR->prev_bb = ENTRY_BLOCK_PTR; in init_flow()
124 VEC_truncate (edge, EXIT_BLOCK_PTR->preds, 0); in clear_edges()
168 SET_BASIC_BLOCK (EXIT_BLOCK, EXIT_BLOCK_PTR); in compact_blocks()
289 || dst == EXIT_BLOCK_PTR) in cached_make_edge()
438 if (bb != EXIT_BLOCK_PTR) in check_bb_profile()
608 else if (side == EXIT_BLOCK_PTR) in dump_edge_info()
755 FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR, EXIT_BLOCK_PTR, next_bb) in alloc_aux_for_edges()
[all …]
H A Dcfgexpand.c1321 if (e->dest != EXIT_BLOCK_PTR) in expand_gimple_tailcall()
1505 init_rtl_bb_info (EXIT_BLOCK_PTR); in construct_init_block()
1507 EXIT_BLOCK_PTR->flags |= BB_RTL; in construct_init_block()
1577 EXIT_BLOCK_PTR->prev_bb); in construct_exit_block()
1578 exit_block->frequency = EXIT_BLOCK_PTR->frequency; in construct_exit_block()
1579 exit_block->count = EXIT_BLOCK_PTR->count; in construct_exit_block()
1582 while (ix < EDGE_COUNT (EXIT_BLOCK_PTR->preds)) in construct_exit_block()
1584 e = EDGE_PRED (EXIT_BLOCK_PTR, ix); in construct_exit_block()
1591 e = make_edge (exit_block, EXIT_BLOCK_PTR, EDGE_FALLTHRU); in construct_exit_block()
1593 e->count = EXIT_BLOCK_PTR->count; in construct_exit_block()
[all …]
H A Dcfgrtl.c673 if (block == EXIT_BLOCK_PTR) in block_label()
790 else if (target == EXIT_BLOCK_PTR) in try_redirect_by_replacing_jump()
893 if (target == EXIT_BLOCK_PTR) in redirect_branch_edge()
1133 if (target == EXIT_BLOCK_PTR) in force_nonfallthru_and_redirect()
1280 if (edge_in->dest != EXIT_BLOCK_PTR) in rtl_split_edge()
1840 && e->dest != EXIT_BLOCK_PTR)) in rtl_verify_flow_info_1()
2030 && e->dest != EXIT_BLOCK_PTR) in rtl_verify_flow_info()
2211 else if (e->dest != EXIT_BLOCK_PTR in purge_dead_edges()
2509 if (bb->next_bb != EXIT_BLOCK_PTR) in cfg_layout_delete_block()
2791 e = find_edge (bb, EXIT_BLOCK_PTR); in rtl_flow_call_edges_add()
[all …]
H A Dbb-reorder.c313 if (e->dest != EXIT_BLOCK_PTR in rotate_loop()
501 if (e->dest == EXIT_BLOCK_PTR) in find_traces_1_round()
557 || e->dest == EXIT_BLOCK_PTR in find_traces_1_round()
722 if (e->dest == EXIT_BLOCK_PTR in find_traces_1_round()
1010 if (e->dest != EXIT_BLOCK_PTR in connect_traces()
1046 if (e->dest != EXIT_BLOCK_PTR in connect_traces()
1071 if (e2->dest == EXIT_BLOCK_PTR in connect_traces()
1087 if (e2->dest != EXIT_BLOCK_PTR) in connect_traces()
1250 && e->dest != EXIT_BLOCK_PTR in find_rarely_executed_basic_blocks_and_crossing_edges()
1291 if (dest && (dest != EXIT_BLOCK_PTR)) in add_labels_and_missing_jumps()
[all …]
H A Dcfgloop.c294 if (e->dest == EXIT_BLOCK_PTR) in mark_single_exit_loops()
679 loops->parray[0]->latch = EXIT_BLOCK_PTR; in flow_loops_find()
682 EXIT_BLOCK_PTR->loop_father = loops->parray[0]; in flow_loops_find()
766 if (bb == ENTRY_BLOCK_PTR || bb == EXIT_BLOCK_PTR) in flow_bb_inside_loop_p()
794 if (loop->latch == EXIT_BLOCK_PTR) in get_loop_body()
800 tovisit[tv++] = EXIT_BLOCK_PTR; in get_loop_body()
856 gcc_assert (loop->latch != EXIT_BLOCK_PTR); in get_loop_body_in_dom_order()
878 gcc_assert (loop->latch != EXIT_BLOCK_PTR); in get_loop_body_in_bfs_order()
926 gcc_assert (loop->latch != EXIT_BLOCK_PTR); in get_loop_exit_edges()
954 gcc_assert (loop->latch != EXIT_BLOCK_PTR); in num_loop_branches()
[all …]
H A Dcfglayout.c86 if (bb->next_bb != EXIT_BLOCK_PTR) in skip_insns_after_block()
676 || e_fall->dest == EXIT_BLOCK_PTR) in fixup_reorder_chain()
697 (e_fall->dest == EXIT_BLOCK_PTR in fixup_reorder_chain()
721 (e_fall->dest == EXIT_BLOCK_PTR in fixup_reorder_chain()
757 if (e_fall->dest == EXIT_BLOCK_PTR) in fixup_reorder_chain()
819 prev_bb->next_bb = EXIT_BLOCK_PTR; in fixup_reorder_chain()
820 EXIT_BLOCK_PTR->prev_bb = prev_bb; in fixup_reorder_chain()
879 FOR_EACH_EDGE (e, ei, EXIT_BLOCK_PTR->preds) in fixup_fallthru_exit_predecessor()
1039 EXIT_BLOCK_PTR->prev_bb); in cfg_layout_duplicate_bb()
H A Dcfghooks.c87 if (bb != EXIT_BLOCK_PTR in verify_flow_info()
207 FOR_EACH_EDGE (e, ei, EXIT_BLOCK_PTR->preds) in verify_flow_info()
638 if (ENTRY_BLOCK_PTR->next_bb == EXIT_BLOCK_PTR) in tidy_fallthru_edges()
641 FOR_BB_BETWEEN (b, ENTRY_BLOCK_PTR->next_bb, EXIT_BLOCK_PTR->prev_bb, next_bb) in tidy_fallthru_edges()
681 if (bb == EXIT_BLOCK_PTR || bb == ENTRY_BLOCK_PTR) in can_duplicate_block_p()
686 e = find_edge (bb, EXIT_BLOCK_PTR); in can_duplicate_block_p()
H A Dloop-init.c57 for (ei = ei_start (EXIT_BLOCK_PTR->preds); (e = ei_safe_edge (ei)); ) in loop_optimizer_init()
211 if (bb->next_bb != EXIT_BLOCK_PTR) in rtl_loop_done()
H A Dcfgcleanup.c130 || jump_block->next_bb == EXIT_BLOCK_PTR in try_simplify_condjump()
153 if (cbranch_dest_block == EXIT_BLOCK_PTR in try_simplify_condjump()
459 if (first != EXIT_BLOCK_PTR in try_forward_edges()
471 && single_succ (target) != EXIT_BLOCK_PTR) in try_forward_edges()
541 if (threaded && target != EXIT_BLOCK_PTR) in try_forward_edges()
1836 && bb != EXIT_BLOCK_PTR in try_crossjump_bb()
1989 for (b = ENTRY_BLOCK_PTR->next_bb; b != EXIT_BLOCK_PTR;) in try_optimize_cfg()
2069 && (c = s->dest) != EXIT_BLOCK_PTR in try_optimize_cfg()
2113 && single_succ (b) != EXIT_BLOCK_PTR in try_optimize_cfg()
2142 && try_crossjump_bb (mode, EXIT_BLOCK_PTR)) in try_optimize_cfg()
[all …]
/openbsd/gnu/usr.bin/gcc/gcc/
H A Dcfganal.c91 if (bb == EXIT_BLOCK_PTR || bb == ENTRY_BLOCK_PTR
192 if (dest != EXIT_BLOCK_PTR && src != ENTRY_BLOCK_PTR in mark_dfs_back_edges()
313 basic_block bb = EXIT_BLOCK_PTR->prev_bb;
326 if (e->dest == EXIT_BLOCK_PTR)
374 if (e->dest == EXIT_BLOCK_PTR)
387 make_edge (bb, EXIT_BLOCK_PTR, EDGE_FAKE);
530 if (INDEX_EDGE_SUCC_BB (elist, x) == EXIT_BLOCK_PTR)
708 make_single_succ_edge (bb, EXIT_BLOCK_PTR, EDGE_FAKE); in add_noreturn_fake_exit_edges()
731 flow_dfs_compute_reverse_add_bb (&dfs_ds, EXIT_BLOCK_PTR); in connect_infinite_loops_to_exit()
740 make_edge (unvisited_block, EXIT_BLOCK_PTR, EDGE_FAKE); in connect_infinite_loops_to_exit()
[all …]
H A Dssa-dce.c246 if (INDEX_EDGE_PRED_BB (el, edge_index) == EXIT_BLOCK_PTR)
254 current_block != ending_block && current_block != EXIT_BLOCK_PTR;
279 else if (block == EXIT_BLOCK_PTR)
280 return EXIT_BLOCK_PTR;
285 return EXIT_BLOCK_PTR;
621 if (pdom_bb == EXIT_BLOCK_PTR) in ssa_eliminate_dead_code()
636 if (temp->dest != EXIT_BLOCK_PTR) in ssa_eliminate_dead_code()
674 if (temp->dest != EXIT_BLOCK_PTR) in ssa_eliminate_dead_code()
H A Dcfgbuild.c305 if (e->dest != EXIT_BLOCK_PTR)
396 cached_make_edge (edge_cache, bb, EXIT_BLOCK_PTR, 0);
412 cached_make_edge (edge_cache, bb, EXIT_BLOCK_PTR,
446 if (!insn || (bb->next_bb == EXIT_BLOCK_PTR && force_fallthru))
447 cached_make_edge (edge_cache, bb, EXIT_BLOCK_PTR, EDGE_FALLTHRU);
448 else if (bb->next_bb != EXIT_BLOCK_PTR)
633 ENTRY_BLOCK_PTR->next_bb = EXIT_BLOCK_PTR;
634 EXIT_BLOCK_PTR->prev_bb = ENTRY_BLOCK_PTR;
649 make_edges (label_value_list, ENTRY_BLOCK_PTR->next_bb, EXIT_BLOCK_PTR->prev_bb, 0);
793 for (; bb != EXIT_BLOCK_PTR; bb = bb->next_bb)
H A Dcfgrtl.c657 if (block == EXIT_BLOCK_PTR)
732 if (target == EXIT_BLOCK_PTR)
739 else if (target == EXIT_BLOCK_PTR)
895 if (target == EXIT_BLOCK_PTR)
942 if (target == EXIT_BLOCK_PTR)
1086 if (target == EXIT_BLOCK_PTR)
1322 if (edge_in->dest != EXIT_BLOCK_PTR
1499 if (e->dest != EXIT_BLOCK_PTR
1801 if (bb != EXIT_BLOCK_PTR in verify_flow_info()
1934 && e->dest != EXIT_BLOCK_PTR) in verify_flow_info()
[all …]
H A Dsibcall.c575 basic_block alternate_exit = EXIT_BLOCK_PTR; in optimize_sibling_and_tail_recursive_calls()
602 for (e = EXIT_BLOCK_PTR->pred; in optimize_sibling_and_tail_recursive_calls()
603 e && alternate_exit == EXIT_BLOCK_PTR; in optimize_sibling_and_tail_recursive_calls()
608 if (e->dest != EXIT_BLOCK_PTR || e->succ_next != NULL) in optimize_sibling_and_tail_recursive_calls()
613 for (insn = EXIT_BLOCK_PTR->prev_bb->head; in optimize_sibling_and_tail_recursive_calls()
697 || (call_block->succ->dest != EXIT_BLOCK_PTR in optimize_sibling_and_tail_recursive_calls()
H A Dcfglayout.c86 if (bb->next_bb != EXIT_BLOCK_PTR)
460 && e_fall->dest == EXIT_BLOCK_PTR)) in fixup_reorder_chain()
560 if (!RBI (bb)->next && e_fall->dest == EXIT_BLOCK_PTR) in fixup_reorder_chain()
608 prev_bb->next_bb = EXIT_BLOCK_PTR; in fixup_reorder_chain()
609 EXIT_BLOCK_PTR->prev_bb = prev_bb; in fixup_reorder_chain()
712 for (e = EXIT_BLOCK_PTR->pred; e; e = e->pred_next) in fixup_fallthru_exit_predecessor()
741 if (bb == EXIT_BLOCK_PTR || bb == ENTRY_BLOCK_PTR)
747 if (s->dest == EXIT_BLOCK_PTR && s->flags & EDGE_FALLTHRU)
929 EXIT_BLOCK_PTR->prev_bb);
H A Dprofile.c116 : ((bb) == EXIT_BLOCK_PTR \
448 BB_INFO (EXIT_BLOCK_PTR)->succ_count = 2; in compute_branch_probabilities()
510 FOR_BB_BETWEEN (bb, EXIT_BLOCK_PTR, NULL, prev_bb) in compute_branch_probabilities()
842 && e->dest != EXIT_BLOCK_PTR) in branch_prob()
844 if (e->dest == EXIT_BLOCK_PTR) in branch_prob()
861 make_edge (bb, EXIT_BLOCK_PTR, EDGE_FAKE); in branch_prob()
887 && e->src != ENTRY_BLOCK_PTR && e->dest != EXIT_BLOCK_PTR) in branch_prob()
1011 FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR, EXIT_BLOCK_PTR, next_bb) in branch_prob()
1129 union_groups (EXIT_BLOCK_PTR, ENTRY_BLOCK_PTR);
1138 || e->dest == EXIT_BLOCK_PTR
H A Dlcm.c139 for (e = EXIT_BLOCK_PTR->pred; e; e = e->pred_next)
140 e->src->aux = EXIT_BLOCK_PTR;
152 if (bb->aux == EXIT_BLOCK_PTR)
211 if (succ == EXIT_BLOCK_PTR)
335 && e->dest != EXIT_BLOCK_PTR && e->dest->aux == 0)
349 for (e = EXIT_BLOCK_PTR->pred; e != NULL; e = e->pred_next)
376 if (b == EXIT_BLOCK_PTR)
554 if (!e->dest->aux && e->dest != EXIT_BLOCK_PTR)
592 if (succ == EXIT_BLOCK_PTR)
647 for (e = EXIT_BLOCK_PTR->pred; e; e = e->pred_next)
[all …]
H A Ddominance.c228 en_block = EXIT_BLOCK_PTR;
235 ex_block = EXIT_BLOCK_PTR;
327 basic_block begin = reverse ? EXIT_BLOCK_PTR : ENTRY_BLOCK_PTR;
469 en_block = EXIT_BLOCK_PTR;
573 SET_BB_NODE (info, EXIT_BLOCK_PTR, et_forest_add_node (info->forest,
574 EXIT_BLOCK_PTR));
609 delete_from_dominance_info (info, EXIT_BLOCK_PTR);
H A Dcfg.c101 EXIT_BLOCK_PTR, /* next_bb */
204 EXIT_BLOCK_PTR->pred = NULL; in clear_edges()
340 && src != ENTRY_BLOCK_PTR && dst != EXIT_BLOCK_PTR);
655 else if (side == EXIT_BLOCK_PTR)
809 FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR, EXIT_BLOCK_PTR, next_bb)
827 FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR, EXIT_BLOCK_PTR, next_bb) in clear_aux_for_edges()
H A Dbb-reorder.c275 if (! next || next == EXIT_BLOCK_PTR || RBI (next)->visited)
281 if (e->dest != EXIT_BLOCK_PTR

12345