Searched refs:last_bb (Results 1 - 16 of 16) sorted by relevance

/haiku-buildtools/gcc/gcc/
H A Dsched-ebb.c68 static basic_block last_bb;
165 if (BLOCK_FOR_INSN (insn) == last_bb
179 e = find_fallthru_edge (last_bb->succs);
183 gcc_checking_assert (BLOCK_FOR_INSN (insn) == last_bb
185 && BB_HEAD (last_bb) != insn
186 && BB_END (last_bb) == insn);
209 bb = create_basic_block (next, NULL_RTX, last_bb);
220 sched_init_only_bb (bb, last_bb);
221 gcc_assert (last_bb == bb);
516 last_bb
66 static basic_block last_bb; variable
[all...]
H A Dsanopt.c408 basic_block last_bb = bb; variable
439 while (last_bb != gbb)
441 /* Paths from last_bb to bb have been checked before.
442 gbb is necessarily a dominator of last_bb, but not necessarily
444 if (((sanopt_info *) last_bb->aux)->freeing_call_events)
447 basic_block imm = get_immediate_dominator (CDI_DOMINATORS, last_bb);
449 if (imm_dom_path_with_freeing_call (last_bb, imm))
452 last_bb = imm;
454 if (last_bb == gbb)
H A Dbb-reorder.c1447 basic_block new_bb, last_bb, post_bb;
1472 last_bb = EXIT_BLOCK_PTR_FOR_FN (cfun)->prev_bb;
1473 new_bb = create_basic_block (new_label, jump, last_bb);
1474 new_bb->aux = last_bb->aux;
1475 last_bb->aux = new_bb;
2109 basic_block last_bb;
2125 last_bb = EXIT_BLOCK_PTR_FOR_FN (cfun)->prev_bb;
2126 new_bb = create_basic_block (new_label, new_jump, last_bb);
2127 new_bb->aux = last_bb->aux;
2128 last_bb
1446 basic_block new_bb, last_bb, post_bb; local
2108 basic_block last_bb; local
[all...]
H A Dfunction.c5731 convert_jumps_to_returns (basic_block last_bb, bool simple_p,
5739 auto_vec<basic_block> src_bbs (EDGE_COUNT (last_bb->preds));
5741 FOR_EACH_EDGE (e, ei, last_bb->preds)
5745 label = BB_HEAD (last_bb);
5754 e = find_edge (bb, last_bb);
5833 basic_block last_bb = exit_fallthru_edge->src;
5835 if (JUMP_P (BB_END (last_bb)))
5837 last_bb = split_edge (exit_fallthru_edge);
5838 exit_fallthru_edge = single_succ_edge (last_bb);
5840 emit_barrier_after (BB_END (last_bb));
5711 convert_jumps_to_returns(basic_block last_bb, bool simple_p, vec<edge> unconverted ATTRIBUTE_UNUSED) argument
5813 basic_block last_bb = exit_fallthru_edge->src; local
6002 basic_block last_bb = exit_fallthru_edge->src; local
[all...]
H A Dsched-rgn.c3046 basic_block first_bb, last_bb;
3050 last_bb = EBB_LAST_BB (bb);
3052 get_ebb_head_tail (first_bb, last_bb, &head, &tail);
3056 gcc_assert (first_bb == last_bb);
3066 basic_block first_bb, last_bb, curr_bb;
3070 last_bb = EBB_LAST_BB (bb);
3072 get_ebb_head_tail (first_bb, last_bb, &head, &tail);
3076 gcc_assert (first_bb == last_bb);
3085 unlink_bb_notes (first_bb, last_bb);
3102 f = find_fallthru_edge (last_bb
3042 basic_block first_bb, last_bb; local
3062 basic_block first_bb, last_bb, curr_bb; local
[all...]
H A Dtree-ssa-reassoc.c3097 basic_block last_bb = first_bb; local
3108 but the last bb in the first_bb .. last_bb range
3136 /* If first_bb is last_bb, other_bb hasn't been computed yet.
3137 Before starting forward search in last_bb successors, find
3139 if (first_bb == last_bb)
3177 /* Now do the forward search, moving last_bb to successor bbs
3179 while (EDGE_COUNT (last_bb->succs) == 2)
3181 FOR_EACH_EDGE (e, ei, last_bb->succs)
3188 if (!suitable_cond_bb (e->dest, last_bb, &other_bb, false))
3192 last_bb
[all...]
H A Dshrink-wrap.c961 basic_block last_bb; local
963 last_bb = emit_return_for_exit (exit_fallthru_edge, true);
964 *returnjump = BB_END (last_bb);
H A Dfunction.h925 extern vec<edge> convert_jumps_to_returns (basic_block last_bb, bool simple_p,
H A Dgcse.c777 basic_block last_bb;
945 if (info->last_bb != current_bb)
1479 last_bb records the block for which first_set and last_set are
1489 if (info->last_bb != current_bb)
1491 info->last_bb = current_bb;
1554 reg_avail_info[i].last_bb = NULL;
768 basic_block last_bb; member in struct:reg_avail_info
H A Dlra-constraints.c4252 basic_block last_bb;
4354 last_bb = NULL;
4361 if (curr_bb != last_bb)
4363 last_bb = curr_bb;
5115 basic_block last_bb, prev_bb, curr_bb;
5121 last_bb = BLOCK_FOR_INSN (tail);
5144 if (curr_bb != last_bb)
4248 basic_block last_bb; local
5110 basic_block last_bb, prev_bb, curr_bb; local
H A Dasan.c2066 basic_block bb, last_bb = NULL; local
2087 if (prev_bb != last_bb)
2089 last_bb = bb;
H A Dcfgrtl.c4869 int last_bb = last_basic_block_for_fn (cfun);
4920 for (i = NUM_FIXED_BLOCKS; i < last_bb; i++)
4846 int last_bb = last_basic_block_for_fn (cfun); local
H A Dcombine.c1176 basic_block last_bb;
1220 last_bb = ENTRY_BLOCK_PTR_FOR_FN (cfun);
1231 || single_pred (this_basic_block) != last_bb)
1233 last_bb = this_basic_block;
1272 last_bb = ENTRY_BLOCK_PTR_FOR_FN (cfun);
1284 || single_pred (this_basic_block) != last_bb)
1286 last_bb = this_basic_block;
1167 basic_block last_bb; local
H A Domp-low.c5942 basic_block last_bb, bb, collapse_bb = NULL;
5949 last_bb = cont_bb;
5954 bb = create_empty_bb (last_bb);
5955 add_bb_to_loop (bb, last_bb->loop_father);
5960 e = make_edge (last_bb, bb, EDGE_FALSE_VALUE);
5976 set_immediate_dominator (CDI_DOMINATORS, bb, last_bb);
6006 last_bb = bb;
5941 basic_block last_bb, bb, collapse_bb = NULL; local
H A Dvar-tracking.c10070 basic_block first_bb, last_bb; local
10092 last_bb = bb;
10095 FOR_BB_BETWEEN (bb, first_bb, last_bb->next_bb, next_bb)
10176 bb = last_bb;
H A Dtree-cfg.c7705 int last_bb = last_basic_block_for_fn (cfun); local
7754 for (i = 0; i < last_bb; i++)

Completed in 502 milliseconds