HomeSort by: relevance | last modified time | path
    Searched refs:last_bb (Results 1 - 25 of 36) sorted by relevancy

1 2

  /src/external/gpl3/gcc/dist/gcc/
sched-ebb.cc 51 static basic_block last_bb;
148 if (BLOCK_FOR_INSN (insn) == last_bb
162 e = find_fallthru_edge (last_bb->succs);
166 gcc_checking_assert (BLOCK_FOR_INSN (insn) == last_bb
168 && BB_HEAD (last_bb) != insn
169 && BB_END (last_bb) == insn);
190 bb = create_basic_block (next, NULL_RTX, last_bb);
201 sched_init_only_bb (bb, last_bb);
202 gcc_assert (last_bb == bb);
495 last_bb = BLOCK_FOR_INSN (tail)
49 static basic_block last_bb; variable
    [all...]
sanopt.cc 651 basic_block last_bb = bb; local
682 while (last_bb != gbb)
684 /* Paths from last_bb to bb have been checked before.
685 gbb is necessarily a dominator of last_bb, but not necessarily
687 if (((sanopt_info *) last_bb->aux)->freeing_call_events)
690 basic_block imm = get_immediate_dominator (CDI_DOMINATORS, last_bb);
692 if (imm_dom_path_with_freeing_call (last_bb, imm))
695 last_bb = imm;
697 if (last_bb != gbb)
sched-rgn.cc 3094 /* If LAST_BB falls through to another block B, record that B should
3098 save_state_for_fallthru_edge (basic_block last_bb, state_t state)
3100 edge f = find_fallthru_edge (last_bb->succs);
3157 basic_block first_bb, last_bb;
3161 last_bb = EBB_LAST_BB (bb);
3163 get_ebb_head_tail (first_bb, last_bb, &head, &tail);
3167 gcc_assert (first_bb == last_bb);
3177 basic_block first_bb, last_bb, curr_bb;
3181 last_bb = EBB_LAST_BB (bb);
3183 get_ebb_head_tail (first_bb, last_bb, &head, &tail)
3153 basic_block first_bb, last_bb; local
3173 basic_block first_bb, last_bb, curr_bb; local
    [all...]
bb-reorder.cc 1434 basic_block last_bb = EXIT_BLOCK_PTR_FOR_FN (cfun)->prev_bb;
1435 basic_block new_bb = create_basic_block (label, jump, last_bb);
1436 new_bb->aux = last_bb->aux;
1438 last_bb->aux = new_bb;
2179 basic_block last_bb;
2197 last_bb = EXIT_BLOCK_PTR_FOR_FN (cfun)->prev_bb;
2198 new_bb = create_basic_block (new_label, new_jump, last_bb);
2199 new_bb->aux = last_bb->aux;
2200 last_bb->aux = new_bb;
function.h 730 extern vec<edge> convert_jumps_to_returns (basic_block last_bb, bool simple_p,
tree-ssa-reassoc.cc 4541 /* For last_bb, handle also:
4739 basic_block last_bb = first_bb; local
4751 but the last bb in the first_bb .. last_bb range
4779 /* If first_bb is last_bb, other_bb hasn't been computed yet.
4780 Before starting forward search in last_bb successors, find
4782 if (first_bb == last_bb)
4821 /* Now do the forward search, moving last_bb to successor bbs
4823 while (EDGE_COUNT (last_bb->succs) == 2)
4825 FOR_EACH_EDGE (e, ei, last_bb->succs)
4832 if (!suitable_cond_bb (e->dest, last_bb, &other_bb, NULL, false)
    [all...]
gcse.cc 745 basic_block last_bb;
914 if (info->last_bb != current_bb)
1448 last_bb records the block for which first_set and last_set are
1458 if (info->last_bb != current_bb)
1460 info->last_bb = current_bb;
1523 reg_avail_info[i].last_bb = NULL;
736 basic_block last_bb; member in struct:reg_avail_info
omp-expand.cc 3095 basic_block last_bb, bb, collapse_bb = NULL; local
3102 last_bb = cont_bb;
3107 bb = create_empty_bb (last_bb);
3108 add_bb_to_loop (bb, last_bb->loop_father);
3113 e = make_edge (last_bb, bb, EDGE_FALSE_VALUE);
3145 set_immediate_dominator (CDI_DOMINATORS, bb, last_bb);
3166 basic_block this_bb = create_empty_bb (last_bb);
3167 add_bb_to_loop (this_bb, last_bb->loop_father);
3265 set_immediate_dominator (CDI_DOMINATORS, bb, last_bb);
3266 last_bb = bb
6915 basic_block last_bb = l1_bb; local
    [all...]
lra-constraints.cc 5234 basic_block last_bb;
5341 last_bb = NULL;
5349 if (curr_bb != last_bb)
5351 last_bb = curr_bb;
6514 basic_block last_bb, prev_bb, curr_bb;
6520 last_bb = BLOCK_FOR_INSN (tail);
6543 if (curr_bb != last_bb)
asan.cc 3100 basic_block bb, last_bb = NULL; local
3121 if (prev_bb != last_bb)
3123 last_bb = bb;
  /src/external/gpl3/gcc.old/dist/gcc/
sched-ebb.cc 51 static basic_block last_bb;
148 if (BLOCK_FOR_INSN (insn) == last_bb
162 e = find_fallthru_edge (last_bb->succs);
166 gcc_checking_assert (BLOCK_FOR_INSN (insn) == last_bb
168 && BB_HEAD (last_bb) != insn
169 && BB_END (last_bb) == insn);
190 bb = create_basic_block (next, NULL_RTX, last_bb);
201 sched_init_only_bb (bb, last_bb);
202 gcc_assert (last_bb == bb);
495 last_bb = BLOCK_FOR_INSN (tail)
49 static basic_block last_bb; variable
    [all...]
sanopt.cc 631 basic_block last_bb = bb; local
662 while (last_bb != gbb)
664 /* Paths from last_bb to bb have been checked before.
665 gbb is necessarily a dominator of last_bb, but not necessarily
667 if (((sanopt_info *) last_bb->aux)->freeing_call_events)
670 basic_block imm = get_immediate_dominator (CDI_DOMINATORS, last_bb);
672 if (imm_dom_path_with_freeing_call (last_bb, imm))
675 last_bb = imm;
677 if (last_bb == gbb)
sched-rgn.cc 3131 basic_block first_bb, last_bb;
3135 last_bb = EBB_LAST_BB (bb);
3137 get_ebb_head_tail (first_bb, last_bb, &head, &tail);
3141 gcc_assert (first_bb == last_bb);
3151 basic_block first_bb, last_bb, curr_bb;
3155 last_bb = EBB_LAST_BB (bb);
3157 get_ebb_head_tail (first_bb, last_bb, &head, &tail);
3161 gcc_assert (first_bb == last_bb);
3170 unlink_bb_notes (first_bb, last_bb);
3187 f = find_fallthru_edge (last_bb->succs)
3127 basic_block first_bb, last_bb; local
3147 basic_block first_bb, last_bb, curr_bb; local
    [all...]
bb-reorder.cc 1434 basic_block last_bb = EXIT_BLOCK_PTR_FOR_FN (cfun)->prev_bb;
1435 basic_block new_bb = create_basic_block (label, jump, last_bb);
1436 new_bb->aux = last_bb->aux;
1438 last_bb->aux = new_bb;
2178 basic_block last_bb;
2196 last_bb = EXIT_BLOCK_PTR_FOR_FN (cfun)->prev_bb;
2197 new_bb = create_basic_block (new_label, new_jump, last_bb);
2198 new_bb->aux = last_bb->aux;
2199 last_bb->aux = new_bb;
function.h 711 extern vec<edge> convert_jumps_to_returns (basic_block last_bb, bool simple_p,
tree-ssa-reassoc.cc 4496 /* For last_bb, handle also:
4694 basic_block last_bb = first_bb; local
4706 but the last bb in the first_bb .. last_bb range
4734 /* If first_bb is last_bb, other_bb hasn't been computed yet.
4735 Before starting forward search in last_bb successors, find
4737 if (first_bb == last_bb)
4776 /* Now do the forward search, moving last_bb to successor bbs
4778 while (EDGE_COUNT (last_bb->succs) == 2)
4780 FOR_EACH_EDGE (e, ei, last_bb->succs)
4787 if (!suitable_cond_bb (e->dest, last_bb, &other_bb, NULL, false)
    [all...]
gcse.cc 745 basic_block last_bb;
913 if (info->last_bb != current_bb)
1447 last_bb records the block for which first_set and last_set are
1457 if (info->last_bb != current_bb)
1459 info->last_bb = current_bb;
1522 reg_avail_info[i].last_bb = NULL;
736 basic_block last_bb; member in struct:reg_avail_info
omp-expand.cc 3103 basic_block last_bb, bb, collapse_bb = NULL; local
3110 last_bb = cont_bb;
3115 bb = create_empty_bb (last_bb);
3116 add_bb_to_loop (bb, last_bb->loop_father);
3121 e = make_edge (last_bb, bb, EDGE_FALSE_VALUE);
3154 set_immediate_dominator (CDI_DOMINATORS, bb, last_bb);
3175 basic_block this_bb = create_empty_bb (last_bb);
3176 add_bb_to_loop (this_bb, last_bb->loop_father);
3279 set_immediate_dominator (CDI_DOMINATORS, bb, last_bb);
3280 last_bb = bb
6823 basic_block last_bb = l1_bb; local
    [all...]
lra-constraints.cc 5004 basic_block last_bb;
5110 last_bb = NULL;
5117 if (curr_bb != last_bb)
5119 last_bb = curr_bb;
6262 basic_block last_bb, prev_bb, curr_bb;
6268 last_bb = BLOCK_FOR_INSN (tail);
6291 if (curr_bb != last_bb)
  /src/external/gpl3/gcc/dist/gcc/rtl-ssa/
blocks.h 220 bb_info *last_bb () const { return m_last_bb; } function in class:rtl_ssa::ebb_info
blocks.cc 355 if (bb == bb->ebb ()->last_bb () && all_uses_are_live_out_uses (phi))
1002 if (bb == ebb->last_bb ())
1076 if (bi.ebb_live_in_for_debug && bb == ebb->last_bb ())
  /src/external/gpl3/gcc.old/dist/gcc/rtl-ssa/
blocks.h 220 bb_info *last_bb () const { return m_last_bb; } function in class:rtl_ssa::ebb_info
blocks.cc 367 if (bb == bb->ebb ()->last_bb () && all_uses_are_live_out_uses (phi))
983 if (bb == ebb->last_bb ())
1057 if (bi.ebb_live_in_for_debug && bb == ebb->last_bb ())
  /src/external/gpl3/binutils/dist/gas/
ginsn.c 693 gbbS *last_bb = NULL; local
699 last_bb = gcfg->root_bb;
700 while (last_bb->next)
701 last_bb = last_bb->next;
703 last_bb->next = gbb;
  /src/external/gpl3/binutils.old/dist/gas/
ginsn.c 693 gbbS *last_bb = NULL; local
699 last_bb = gcfg->root_bb;
700 while (last_bb->next)
701 last_bb = last_bb->next;
703 last_bb->next = gbb;

Completed in 93 milliseconds

1 2