Home
last modified time | relevance | path

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

1234

/netbsd-src/external/gpl3/binutils/dist/gas/
H A Dginsn.c679 add_bb_at_ginsn (const symbolS *func, gcfgS *gcfg, ginsnS *ginsn, gbbS *prev_bb,
709 find_or_make_bb (const symbolS *func, gcfgS *gcfg, ginsnS *ginsn, gbbS *prev_bb, in find_or_make_bb() argument
718 return add_bb_at_ginsn (func, gcfg, ginsn, prev_bb, errp); in find_or_make_bb()
728 add_bb_at_ginsn (const symbolS *func, gcfgS *gcfg, ginsnS *ginsn, gbbS *prev_bb, in add_bb_at_ginsn() argument
750 prev_bb = current_bb; in add_bb_at_ginsn()
754 if (prev_bb) in add_bb_at_ginsn()
755 bb_add_edge (prev_bb, current_bb); in add_bb_at_ginsn()
761 prev_bb = current_bb; in add_bb_at_ginsn()
762 find_or_make_bb (func, gcfg, ginsn, prev_bb, errp); in add_bb_at_ginsn()
772 if (prev_bb) in add_bb_at_ginsn()
[all …]
H A Dscfi.c926 gbbS *prev_bb; in forward_flow_scfi_state() local
958 prev_bb = gbb; in forward_flow_scfi_state()
977 memcpy (state, prev_bb->exit_state, sizeof (scfi_stateS)); in forward_flow_scfi_state()
1000 gbbS *prev_bb; in backward_flow_scfi_state() local
1020 prev_bb = prog_order_bbs[i-1]; in backward_flow_scfi_state()
1021 if (cmp_scfi_state (prev_bb->exit_state, current_bb->entry_state)) in backward_flow_scfi_state()
/netbsd-src/external/gpl3/gcc/dist/gcc/
H A Dcfg.cc80 EXIT_BLOCK_PTR_FOR_FN (the_fun)->prev_bb in init_flow()
151 b->prev_bb = after; in link_block()
153 b->next_bb->prev_bb = b; in link_block()
160 b->next_bb->prev_bb = b->prev_bb; in unlink_block()
161 b->prev_bb->next_bb = b->next_bb; in unlink_block()
162 b->prev_bb = NULL; in unlink_block()
825 if (bb->prev_bb) in dump_bb_info()
826 fprintf (outf, "%d", bb->prev_bb->index); in dump_bb_info()
H A Dhw-doloop.cc517 basic_block start_prev_bb = start_bb->prev_bb; in reorder_loops()
522 loop->head->prev_bb->next_bb = loop->head->next_bb; in reorder_loops()
523 loop->head->next_bb->prev_bb = loop->head->prev_bb; in reorder_loops()
525 loop->head->prev_bb = start_prev_bb; in reorder_loops()
527 start_prev_bb->next_bb = start_bb->prev_bb = loop->head; in reorder_loops()
H A Dcfgcleanup.cc652 link_block (a, b->prev_bb); in merge_blocks_move_predecessor_nojumps()
758 return b->prev_bb == ENTRY_BLOCK_PTR_FOR_FN (cfun) ? b : b->prev_bb; in merge_blocks_move()
786 next = b->prev_bb; in merge_blocks_move()
788 next = next->prev_bb; in merge_blocks_move()
2686 c = b->prev_bb; in try_optimize_cfg()
2768 c = ((b->prev_bb == ENTRY_BLOCK_PTR_FOR_FN (cfun)) in try_optimize_cfg()
2769 ? b->next_bb : b->prev_bb); in try_optimize_cfg()
3002 basic_block b, prev_bb; in delete_unreachable_blocks() local
3015 for (b = EXIT_BLOCK_PTR_FOR_FN (cfun)->prev_bb; in delete_unreachable_blocks()
3016 b != ENTRY_BLOCK_PTR_FOR_FN (cfun); b = prev_bb) in delete_unreachable_blocks()
[all …]
H A Dsel-sched-ir.cc686 gcc_assert (BLOCK_FOR_INSN (insn)->prev_bb); in merge_fences()
687 candidate = find_fallthru_edge_from (BLOCK_FOR_INSN (insn)->prev_bb); in merge_fences()
721 gcc_assert (BLOCK_FOR_INSN (insn)->prev_bb in merge_fences()
3745 gcc_assert (can_merge_blocks_p (bb->prev_bb, bb)); in maybe_tidy_empty_bb()
3746 sel_merge_blocks (bb->prev_bb, bb); in maybe_tidy_empty_bb()
3811 if (can_merge_blocks_p (bb->prev_bb, bb)) in maybe_tidy_empty_bb()
3812 sel_merge_blocks (bb->prev_bb, bb); in maybe_tidy_empty_bb()
3890 && in_current_region_p (xbb->prev_bb) in tidy_control_flow()
3891 && bb_has_removable_jump_to_p (xbb->prev_bb, xbb->next_bb) in tidy_control_flow()
3892 && INSN_SCHED_TIMES (BB_END (xbb->prev_bb)) == 0 in tidy_control_flow()
[all …]
H A Dgimple-range-cache.cc1422 basic_block prev_bb = start_bb; in range_from_dom() local
1436 prev_bb = bb, bb = get_immediate_dominator (CDI_DOMINATORS, bb)) in range_from_dom()
1446 edge e = find_edge (bb, prev_bb); in range_from_dom()
1447 if (e && single_pred_p (prev_bb)) in range_from_dom()
1448 m_workback.quick_push (prev_bb); in range_from_dom()
1472 prev_bb = m_workback.pop (); in range_from_dom()
1473 edge e = single_pred_edge (prev_bb); in range_from_dom()
1490 bb->index, prev_bb->index); in range_from_dom()
H A Dbb-reorder.cc410 basic_block prev_bb; in rotate_loop() local
412 for (prev_bb = trace->first; in rotate_loop()
413 prev_bb->aux != back_edge->dest; in rotate_loop()
414 prev_bb = (basic_block) prev_bb->aux) in rotate_loop()
416 prev_bb->aux = best_bb->aux; in rotate_loop()
419 if (single_succ_p (prev_bb)) in rotate_loop()
421 basic_block header = single_succ (prev_bb); in rotate_loop()
427 copy_bb (header, single_succ_edge (prev_bb), prev_bb, trace_n); in rotate_loop()
981 else if (e->dest->prev_bb == bb) in better_edge_p()
1433 basic_block last_bb = EXIT_BLOCK_PTR_FOR_FN (cfun)->prev_bb; in create_eh_forwarder_block()
[all …]
H A Dcfgrtl.cc1849 return bb->prev_bb; in last_bb_in_partition()
1897 bb = create_basic_block (before, NULL, edge_in->dest->prev_bb); in rtl_split_edge()
1902 basic_block after = edge_in->dest->prev_bb; in rtl_split_edge()
2486 basic_block prev_first = first->prev_bb; in fixup_partitions()
2487 basic_block prev_second = second->prev_bb; in fixup_partitions()
2488 basic_block prev_bb = bb->prev_bb; in fixup_partitions() local
2490 second->prev_bb = prev_first; in fixup_partitions()
2492 bb->prev_bb = prev_second; in fixup_partitions()
2493 prev_bb->next_bb = first; in fixup_partitions()
2494 first->prev_bb = prev_bb; in fixup_partitions()
[all …]
H A Dbasic-block.h132 basic_block prev_bb; member
224 FOR_BB_BETWEEN (BB, (FN)->cfg->x_exit_block_ptr->prev_bb, (FN)->cfg->x_entry_block_ptr, prev_bb)
H A Dtree-ssa-dce.cc1504 basic_block prev_bb; in eliminate_unnecessary_stmts() local
1515 for (bb = EXIT_BLOCK_PTR_FOR_FN (cfun)->prev_bb; in eliminate_unnecessary_stmts()
1516 bb != ENTRY_BLOCK_PTR_FOR_FN (cfun); bb = prev_bb) in eliminate_unnecessary_stmts()
1518 prev_bb = bb->prev_bb; in eliminate_unnecessary_stmts()
1561 prev_bb = bb->prev_bb; in eliminate_unnecessary_stmts()
H A Dgimple-range-path.h77 basic_block prev_bb () { return m_path[m_pos + 1]; } in prev_bb() function
H A Ddominance.cc420 FOR_BB_BETWEEN (b, m_start_block->prev_bb, m_end_block, prev_bb) in calc_dfs_tree()
438 FOR_BB_BETWEEN (b, m_start_block->prev_bb, m_end_block, prev_bb) in calc_dfs_tree()
H A Dgimple-range-path.cc302 basic_block prev = prev_bb (); in ssa_range_in_phi()
430 compute_phi_relations (bb, prev_bb ()); in compute_ranges_in_block()
/netbsd-src/external/gpl3/gcc.old/dist/gcc/
H A Dcfg.c80 EXIT_BLOCK_PTR_FOR_FN (the_fun)->prev_bb in init_flow()
137 b->prev_bb = after; in link_block()
139 b->next_bb->prev_bb = b; in link_block()
146 b->next_bb->prev_bb = b->prev_bb; in unlink_block()
147 b->prev_bb->next_bb = b->next_bb; in unlink_block()
148 b->prev_bb = NULL; in unlink_block()
789 if (bb->prev_bb) in dump_bb_info()
790 fprintf (outf, "%d", bb->prev_bb->index); in dump_bb_info()
H A Dhw-doloop.c517 basic_block start_prev_bb = start_bb->prev_bb; in reorder_loops()
522 loop->head->prev_bb->next_bb = loop->head->next_bb; in reorder_loops()
523 loop->head->next_bb->prev_bb = loop->head->prev_bb; in reorder_loops()
525 loop->head->prev_bb = start_prev_bb; in reorder_loops()
527 start_prev_bb->next_bb = start_bb->prev_bb = loop->head; in reorder_loops()
H A Dcfgcleanup.c653 link_block (a, b->prev_bb); in merge_blocks_move_predecessor_nojumps()
759 return b->prev_bb == ENTRY_BLOCK_PTR_FOR_FN (cfun) ? b : b->prev_bb; in merge_blocks_move()
787 next = b->prev_bb; in merge_blocks_move()
789 next = next->prev_bb; in merge_blocks_move()
2715 c = b->prev_bb; in try_optimize_cfg()
2797 c = ((b->prev_bb == ENTRY_BLOCK_PTR_FOR_FN (cfun)) in try_optimize_cfg()
2798 ? b->next_bb : b->prev_bb); in try_optimize_cfg()
3031 basic_block b, prev_bb; in delete_unreachable_blocks() local
3044 for (b = EXIT_BLOCK_PTR_FOR_FN (cfun)->prev_bb; in delete_unreachable_blocks()
3045 b != ENTRY_BLOCK_PTR_FOR_FN (cfun); b = prev_bb) in delete_unreachable_blocks()
[all …]
H A Dsel-sched-ir.c686 gcc_assert (BLOCK_FOR_INSN (insn)->prev_bb); in merge_fences()
687 candidate = find_fallthru_edge_from (BLOCK_FOR_INSN (insn)->prev_bb); in merge_fences()
721 gcc_assert (BLOCK_FOR_INSN (insn)->prev_bb in merge_fences()
3745 gcc_assert (can_merge_blocks_p (bb->prev_bb, bb)); in maybe_tidy_empty_bb()
3746 sel_merge_blocks (bb->prev_bb, bb); in maybe_tidy_empty_bb()
3810 if (can_merge_blocks_p (bb->prev_bb, bb)) in maybe_tidy_empty_bb()
3811 sel_merge_blocks (bb->prev_bb, bb); in maybe_tidy_empty_bb()
3889 && in_current_region_p (xbb->prev_bb) in tidy_control_flow()
3890 && bb_has_removable_jump_to_p (xbb->prev_bb, xbb->next_bb) in tidy_control_flow()
3891 && INSN_SCHED_TIMES (BB_END (xbb->prev_bb)) == 0 in tidy_control_flow()
[all …]
H A Dcfgrtl.c1850 return bb->prev_bb; in last_bb_in_partition()
1898 bb = create_basic_block (before, NULL, edge_in->dest->prev_bb); in rtl_split_edge()
1903 basic_block after = edge_in->dest->prev_bb; in rtl_split_edge()
2466 basic_block prev_first = first->prev_bb; in fixup_partitions()
2467 basic_block prev_second = second->prev_bb; in fixup_partitions()
2468 basic_block prev_bb = bb->prev_bb; in fixup_partitions() local
2470 second->prev_bb = prev_first; in fixup_partitions()
2472 bb->prev_bb = prev_second; in fixup_partitions()
2473 prev_bb->next_bb = first; in fixup_partitions()
2474 first->prev_bb = prev_bb; in fixup_partitions()
[all …]
H A Dbb-reorder.c410 basic_block prev_bb; in rotate_loop() local
412 for (prev_bb = trace->first; in rotate_loop()
413 prev_bb->aux != back_edge->dest; in rotate_loop()
414 prev_bb = (basic_block) prev_bb->aux) in rotate_loop()
416 prev_bb->aux = best_bb->aux; in rotate_loop()
419 if (single_succ_p (prev_bb)) in rotate_loop()
421 basic_block header = single_succ (prev_bb); in rotate_loop()
427 copy_bb (header, single_succ_edge (prev_bb), prev_bb, trace_n); in rotate_loop()
981 else if (e->dest->prev_bb == bb) in better_edge_p()
1433 basic_block last_bb = EXIT_BLOCK_PTR_FOR_FN (cfun)->prev_bb; in create_eh_forwarder_block()
[all …]
H A Dtree-ssa-dce.c1536 basic_block prev_bb; in eliminate_unnecessary_stmts() local
1547 for (bb = EXIT_BLOCK_PTR_FOR_FN (cfun)->prev_bb; in eliminate_unnecessary_stmts()
1548 bb != ENTRY_BLOCK_PTR_FOR_FN (cfun); bb = prev_bb) in eliminate_unnecessary_stmts()
1550 prev_bb = bb->prev_bb; in eliminate_unnecessary_stmts()
1593 prev_bb = bb->prev_bb; in eliminate_unnecessary_stmts()
H A Dbasic-block.h132 basic_block prev_bb; member
224 FOR_BB_BETWEEN (BB, (FN)->cfg->x_exit_block_ptr->prev_bb, (FN)->cfg->x_entry_block_ptr, prev_bb)
H A Ddominance.c420 FOR_BB_BETWEEN (b, m_start_block->prev_bb, m_end_block, prev_bb) in calc_dfs_tree()
438 FOR_BB_BETWEEN (b, m_start_block->prev_bb, m_end_block, prev_bb) in calc_dfs_tree()
/netbsd-src/external/gpl3/gcc/dist/gcc/rtl-ssa/
H A Dblocks.h50 bb_info *prev_bb () const { return m_prev_bb; } in prev_bb() function
145 using reverse_bb_iterator = list_iterator<bb_info, &bb_info::prev_bb>;
H A Dmember-fns.inl745 if (bb_info *prev_bb = m_first_bb->prev_bb ()) local
746 return prev_bb->ebb ();
773 return { m_last_bb, m_first_bb->prev_bb () };

1234