Home
last modified time | relevance | path

Searched refs:prev_bb (Results 1 – 25 of 51) sorted by relevance

123

/openbsd-src/gnu/usr.bin/gcc/gcc/
H A Dcfglayout.c379 basic_block bb, prev_bb; in fixup_reorder_chain() local
596 prev_bb = ENTRY_BLOCK_PTR; in fixup_reorder_chain()
600 for (; bb; prev_bb = bb, bb = RBI (bb)->next, index ++) in fixup_reorder_chain()
605 bb->prev_bb = prev_bb; in fixup_reorder_chain()
606 prev_bb->next_bb = bb; 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()
663 && bb->prev_bb != ENTRY_BLOCK_PTR) in cleanup_unconditional_jumps()
665 basic_block prev = bb->prev_bb; in cleanup_unconditional_jumps()
929 EXIT_BLOCK_PTR->prev_bb);
H A Dcfg.c238 b->prev_bb = after;
240 b->next_bb->prev_bb = b;
248 b->next_bb->prev_bb = b->prev_bb;
249 b->prev_bb->next_bb = b->next_bb;
578 bb->prev_bb->index, bb->next_bb->index);
H A Dbasic-block.h214 struct basic_block_def *prev_bb, *next_bb; member
266 FOR_BB_BETWEEN (BB, EXIT_BLOCK_PTR->prev_bb, ENTRY_BLOCK_PTR, prev_bb)
H A Dcfgbuild.c634 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);
838 max = next->prev_bb;
H A Dbb-reorder.c206 if (bb->prev_bb != ENTRY_BLOCK_PTR)
H A Dcfganal.c297 check_last_block = TEST_BIT (blocks, EXIT_BLOCK_PTR->prev_bb->index);
313 basic_block bb = EXIT_BLOCK_PTR->prev_bb;
1117 FOR_BB_BETWEEN (bb, EXIT_BLOCK_PTR, NULL, prev_bb)
H A Dcfgcleanup.c749 link_block (a, b->prev_bb);
1635 c = b->prev_bb;
1689 c = b->prev_bb == ENTRY_BLOCK_PTR ? b->next_bb : b->prev_bb;
H A Dhaifa-sched.c2489 insn = EXIT_BLOCK_PTR->prev_bb->end;
2496 emit_note_after (NOTE_INSN_DELETED, EXIT_BLOCK_PTR->prev_bb->end);
2498 EXIT_BLOCK_PTR->prev_bb->end = PREV_INSN (EXIT_BLOCK_PTR->prev_bb->end);
H A Dcfgrtl.c1207 FOR_BB_BETWEEN (b, ENTRY_BLOCK_PTR->next_bb, EXIT_BLOCK_PTR->prev_bb, next_bb) in tidy_fallthru_edges()
1334 bb = create_basic_block (before, NULL, edge_in->dest->prev_bb);
1808 if (bb->prev_bb != last_bb_seen) in verify_flow_info()
1811 bb->index, last_bb_seen->index, bb->prev_bb->index); in verify_flow_info()
H A Dsibcall.c613 for (insn = EXIT_BLOCK_PTR->prev_bb->head; in optimize_sibling_and_tail_recursive_calls()
/openbsd-src/gnu/gcc/gcc/
H A Dbb-reorder.c374 basic_block prev_bb; in rotate_loop() local
376 for (prev_bb = trace->first; in rotate_loop()
377 prev_bb->aux != back_edge->dest; in rotate_loop()
378 prev_bb = prev_bb->aux) in rotate_loop()
380 prev_bb->aux = best_bb->aux; in rotate_loop()
383 if (single_succ_p (prev_bb)) in rotate_loop()
385 basic_block header = single_succ (prev_bb); in rotate_loop()
392 copy_bb (header, single_succ_edge (prev_bb), prev_bb, trace_n); in rotate_loop()
874 else if (e->dest->prev_bb == bb) in better_edge_p()
1526 basic_block prev_bb; in fix_crossing_conditional_branches() local
[all …]
H A Dcfglayout.c586 basic_block bb, prev_bb; in fixup_reorder_chain() local
807 prev_bb = ENTRY_BLOCK_PTR; in fixup_reorder_chain()
811 for (; bb; prev_bb = bb, bb = bb->aux, index ++) in fixup_reorder_chain()
816 bb->prev_bb = prev_bb; in fixup_reorder_chain()
817 prev_bb->next_bb = bb; 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()
1039 EXIT_BLOCK_PTR->prev_bb); in cfg_layout_duplicate_bb()
H A Dcfg.c92 EXIT_BLOCK_PTR->prev_bb = ENTRY_BLOCK_PTR; in init_flow()
145 b->prev_bb = after; in link_block()
147 b->next_bb->prev_bb = b; in link_block()
154 b->next_bb->prev_bb = b->prev_bb; in unlink_block()
155 b->prev_bb->next_bb = b->next_bb; in unlink_block()
156 b->prev_bb = NULL; in unlink_block()
486 if (bb->prev_bb) in dump_bb_info()
487 fprintf (file, ", prev %d", bb->prev_bb->index); in dump_bb_info()
H A Dcfghooks.c94 if (bb->prev_bb != last_bb_seen) in verify_flow_info()
97 bb->index, last_bb_seen->index, bb->prev_bb->index); in verify_flow_info()
252 if (bb->prev_bb) in dump_bb()
253 fprintf (outf, "%d, ", bb->prev_bb->index); in dump_bb()
641 FOR_BB_BETWEEN (b, ENTRY_BLOCK_PTR->next_bb, EXIT_BLOCK_PTR->prev_bb, next_bb) in tidy_fallthru_edges()
H A Dcfgcleanup.c666 link_block (a, b->prev_bb); in merge_blocks_move_predecessor_nojumps()
779 return b->prev_bb == ENTRY_BLOCK_PTR ? b : b->prev_bb; in merge_blocks_move()
814 next = b->prev_bb; in merge_blocks_move()
816 next = next->prev_bb; in merge_blocks_move()
1998 c = b->prev_bb; in try_optimize_cfg()
2058 c = b->prev_bb == ENTRY_BLOCK_PTR ? b->next_bb : b->prev_bb; in try_optimize_cfg()
H A Dbasic-block.h233 struct basic_block_def *prev_bb; member
427 FOR_BB_BETWEEN (BB, (FN)->cfg->x_exit_block_ptr->prev_bb, (FN)->cfg->x_entry_block_ptr, prev_bb)
H A Dcfgbuild.c539 EXIT_BLOCK_PTR->prev_bb = ENTRY_BLOCK_PTR; in find_basic_blocks()
566 make_edges (ENTRY_BLOCK_PTR->next_bb, EXIT_BLOCK_PTR->prev_bb, 0); in find_basic_blocks()
H A Dtree-cfg.c148 EXIT_BLOCK_PTR->prev_bb = ENTRY_BLOCK_PTR; in init_empty_tree_cfg()
2050 new_bb = bb->prev_bb; in remove_bb()
3169 if (dest->prev_bb && find_edge (dest->prev_bb, dest)) in split_edge_bb_loc()
3172 return dest->prev_bb; in split_edge_bb_loc()
4270 if (bb->prev_bb == after) in tree_move_block_after()
4299 new_bb = create_empty_bb (EXIT_BLOCK_PTR->prev_bb); in tree_duplicate_bb()
5307 check_last_block = TEST_BIT (blocks, EXIT_BLOCK_PTR->prev_bb->index); in tree_flow_call_edges_add()
5323 basic_block bb = EXIT_BLOCK_PTR->prev_bb; in tree_flow_call_edges_add()
H A Dloop-unswitch.c443 switch_bb = create_empty_bb (EXIT_BLOCK_PTR->prev_bb); in unswitch_loop()
H A Dsched-ebb.c531 last_bb = last_bb->prev_bb; in schedule_ebb()
H A Dhaifa-sched.c3587 gcc_assert (succ->prev_bb == pred); in find_fallthru_edge()
3618 last = EXIT_BLOCK_PTR->prev_bb; in init_before_recovery()
4168 last = last->prev_bb; in unlink_bb_notes()
4250 insn = BB_END (EXIT_BLOCK_PTR->prev_bb); in extend_bb()
4259 BB_END (EXIT_BLOCK_PTR->prev_bb) = insn; in extend_bb()
H A Dcfganal.c912 FOR_BB_BETWEEN (bb, last_unvisited, NULL, prev_bb) in flow_dfs_compute_reverse_execute()
H A Dcfgrtl.c1295 bb = create_basic_block (before, NULL, edge_in->dest->prev_bb); in rtl_split_edge()
2763 check_last_block = TEST_BIT (blocks, EXIT_BLOCK_PTR->prev_bb->index); in rtl_flow_call_edges_add()
2779 basic_block bb = EXIT_BLOCK_PTR->prev_bb; in rtl_flow_call_edges_add()
H A Dlambda-code.c2468 headerbb = create_empty_bb (EXIT_BLOCK_PTR->prev_bb); in perfect_nestify()
2500 bodybb = create_empty_bb (EXIT_BLOCK_PTR->prev_bb); in perfect_nestify()
2501 latchbb = create_empty_bb (EXIT_BLOCK_PTR->prev_bb); in perfect_nestify()
H A Dprofile.c377 FOR_BB_BETWEEN (bb, EXIT_BLOCK_PTR, NULL, prev_bb) in compute_branch_probabilities()

123