Home
last modified time | relevance | path

Searched refs:bb (Results 1 – 25 of 533) sorted by relevance

12345678910>>...22

/openbsd/gnu/usr.bin/gcc/gcc/
H A Dtracer.c66 #define seen(bb) (RBI (bb)->visited || RBI (bb)->next) argument
70 ignore_bb_p (bb) in ignore_bb_p() argument
83 count_insns (bb) in count_insns() argument
173 fprintf (rtl_dump_file, ",%i [%i]", bb->index, bb->frequency);
174 bb = bb2;
225 blocks[bb->index] = fibheap_insert (heap, -bb->frequency, in tail_duplicate()
226 bb); in tail_duplicate()
246 if (!bb) in tail_duplicate()
259 traced_insns += bb->frequency * counts [bb->index]; in tail_duplicate()
299 bb = bb2; in tail_duplicate()
[all …]
H A Dcfglayout.c197 if (PREV_INSN (bb->head) && next_insn != bb->head) in record_effective_endpoints()
201 if (NEXT_INSN (bb->end) && bb->end != end) in record_effective_endpoints()
387 bb != 0; in fixup_reorder_chain()
388 bb = RBI (bb)->next, index++) in fixup_reorder_chain()
434 for (bb = ENTRY_BLOCK_PTR->next_bb; bb ; bb = RBI (bb)->next) in fixup_reorder_chain()
573 bb = nb; in fixup_reorder_chain()
582 for (bb = ENTRY_BLOCK_PTR->next_bb, index = 0; bb; bb = RBI (bb)->next, index ++) in fixup_reorder_chain()
600 for (; bb; prev_bb = bb, bb = RBI (bb)->next, index ++) in fixup_reorder_chain()
716 if (bb && RBI (bb)->next) in fixup_fallthru_exit_predecessor()
741 if (bb == EXIT_BLOCK_PTR || bb == ENTRY_BLOCK_PTR)
[all …]
H A Dcfgrtl.c315 BASIC_BLOCK (bb->index) = bb;
320 bb->aux = bb;
1252 for (bb = bb1; bb && bb != bb2; bb = bb->next_bb)
1513 bb->aux = &bb->aux;
1615 bb->index, bb->loop_depth);
1685 start[INSN_UID (bb->head)] = bb;
1686 end[INSN_UID (bb->end)] = bb;
1802 && bb != BASIC_BLOCK (bb->index)) in verify_flow_info()
1892 bb->index, bb->frequency); in verify_flow_info()
2320 bb->succ->count = bb->count;
[all …]
H A Dpredict.c117 maybe_hot_bb_p (bb) in maybe_hot_bb_p() argument
122 && (bb->count
151 basic_block bb; in probably_never_executed_bb_p()
302 if (bb->count)
337 bb->index);
427 basic_block bb; local
452 bb = bbs[j];
629 combine_predictions_for_insn (bb->end, bb);
722 && bb->succ && !bb->succ->succ_next
953 for (bb = head; bb; bb = nextbb)
[all …]
H A Dcfgbuild.c285 basic_block bb; local
454 cached_make_edge (edge_cache, bb, bb->next_bb, EDGE_FALLTHRU);
613 basic_block bb; local
626 bb->aux = NULL;
780 FOR_EACH_BB (bb)
781 SET_STATE (bb,
792 min = max = bb;
793 for (; bb != EXIT_BLOCK_PTR; bb = bb->next_bb)
795 max = bb;
811 bb->count = 0;
[all …]
H A Dcfg.c176 basic_block bb; in clear_edges() local
179 FOR_EACH_BB (bb) in clear_edges()
216 basic_block bb; in alloc_block() local
227 memset (bb, 0, sizeof *bb); in alloc_block()
229 return bb; in alloc_block()
257 basic_block bb; in compact_blocks() local
509 basic_block bb; in clear_bb_flags() local
576 bb->index, INSN_UID (bb->head), INSN_UID (bb->end));
578 bb->prev_bb->index, bb->next_bb->index);
625 if (lsum - bb->count > 100 || lsum - bb->count < -100)
[all …]
H A Dbb-reorder.c107 basic_block next, bb; in make_reorder_chain() local
121 FOR_EACH_BB (bb) in make_reorder_chain()
122 if (! RBI (bb)->visited) in make_reorder_chain()
124 next = bb; in make_reorder_chain()
139 basic_block bb; in maybe_duplicate_computed_goto_succ()
151 e = bb->succ;
187 basic_block bb; in make_reorder_chain_1()
209 RBI (bb)->visited = 1;
210 prev = bb;
212 if (bb->succ == NULL)
[all …]
H A Ddf.c2074 in[bb->index] = DF_BB_INFO (df, bb)->rd_in;
2075 out[bb->index] = DF_BB_INFO (df, bb)->rd_out;
2076 gen[bb->index] = DF_BB_INFO (df, bb)->rd_gen;
2077 kill[bb->index] = DF_BB_INFO (df, bb)->rd_kill;
2110 in[bb->index] = DF_BB_INFO (df, bb)->ru_in;
2111 out[bb->index] = DF_BB_INFO (df, bb)->ru_out;
2112 gen[bb->index] = DF_BB_INFO (df, bb)->ru_gen;
2149 in[bb->index] = DF_BB_INFO (df, bb)->lr_in;
2150 out[bb->index] = DF_BB_INFO (df, bb)->lr_out;
2151 use[bb->index] = DF_BB_INFO (df, bb)->lr_use;
[all …]
H A Dprofile.c115 #define BB_TO_GCOV_INDEX(bb) ((bb) == ENTRY_BLOCK_PTR ? 0 \ argument
180 basic_block bb; local
256 basic_block bb; in get_exec_counts() local
421 basic_block bb; in compute_branch_probabilities() local
608 if (BB_INFO (bb)->succ_count || BB_INFO (bb)->pred_count) in compute_branch_probabilities()
737 basic_block bb; in compute_checksum() local
773 basic_block bb; in branch_prob() local
815 for (insn = bb->head; insn != NEXT_INSN (bb->end); in branch_prob()
1076 find_group (bb) in find_group() argument
1089 bb = bb1;
[all …]
H A Dlcm.c110 basic_block bb; local
130 bb->aux = bb;
166 transp[bb->index], antout[bb->index]))
303 bb->aux = bb;
370 sbitmap_difference (delete[bb->index], antloc[bb->index], laterin[bb->index]);
512 bb->aux = bb;
549 …if (sbitmap_union_of_diff_cg (avout[bb->index], avloc[bb->index], avin[bb->index], kill[bb->index]…
655 bb->aux = bb;
711 sbitmap_difference (delete[bb->index], st_avloc[bb->index], nearerout[bb->index]);
903 int bb;
[all …]
H A Dcfganal.c91 if (bb == EXIT_BLOCK_PTR || bb == ENTRY_BLOCK_PTR
92 || !bb->succ || bb->succ->succ_next)
95 for (insn = bb->head; insn != bb->end; insn = NEXT_INSN (insn))
220 basic_block bb; in set_edge_can_fallthru_flag() local
222 FOR_EACH_BB (bb) in set_edge_can_fallthru_flag()
237 if (!bb->succ || !bb->succ->succ_next || bb->succ->succ_next->succ_next) in set_edge_can_fallthru_flag()
241 if (!invert_jump (bb->end, JUMP_LABEL (bb->end), 0)) in set_edge_can_fallthru_flag()
243 invert_jump (bb->end, JUMP_LABEL (bb->end), 0); in set_edge_can_fallthru_flag()
345 if (!bb)
468 basic_block bb; in create_edge_list() local
[all …]
/openbsd/gnu/gcc/gcc/
H A Dtracer.c69 #define seen(bb) (bb->il.rtl->visited || bb->aux) argument
173 fprintf (dump_file, ",%i [%i]", bb->index, bb->frequency); in find_trace()
174 bb = bb2; in find_trace()
188 fprintf (dump_file, ",%i [%i]", bb->index, bb->frequency); in find_trace()
225 blocks[bb->index] = fibheap_insert (heap, -bb->frequency, in tail_duplicate()
226 bb); in tail_duplicate()
246 if (!bb) in tail_duplicate()
258 traced_insns += bb->frequency * counts [bb->index]; in tail_duplicate()
298 bb = bb2; in tail_duplicate()
348 for (; bb != EXIT_BLOCK_PTR; bb = bb->next_bb) in layout_superblocks()
[all …]
H A Dcfglayout.c603 bb = bb->aux, index++) in fixup_reorder_chain()
649 for (bb = ENTRY_BLOCK_PTR->next_bb; bb ; bb = bb->aux) in fixup_reorder_chain()
769 bb = nb; in fixup_reorder_chain()
791 bb; in fixup_reorder_chain()
792 bb = bb->aux, index++) in fixup_reorder_chain()
811 for (; bb; prev_bb = bb, bb = bb->aux, index ++) in fixup_reorder_chain()
883 if (bb && bb->aux) in fixup_fallthru_exit_predecessor()
891 bb = split_block (bb, NULL)->dest; in fixup_fallthru_exit_predecessor()
1147 bb->il.rtl->header = bb->il.rtl->footer = NULL; in cfg_layout_finalize()
1236 if (bb->loop_father->header == bb && bb->loop_father != base) in copy_bbs()
[all …]
H A Dcfghooks.c88 && bb != BASIC_BLOCK (bb->index)) in verify_flow_info()
97 bb->index, last_bb_seen->index, bb->prev_bb->index); in verify_flow_info()
114 bb->index, (int)bb->count); in verify_flow_info()
120 bb->index, bb->frequency); in verify_flow_info()
149 if (e->src != bb) in verify_flow_info()
152 bb->index); in verify_flow_info()
247 s_indent, bb->index, bb->loop_depth); in dump_bb()
252 if (bb->prev_bb) in dump_bb()
257 if (bb->next_bb) in dump_bb()
681 if (bb == EXIT_BLOCK_PTR || bb == ENTRY_BLOCK_PTR) in can_duplicate_block_p()
[all …]
H A Dtree-cfgcleanup.c163 basic_block bb; local
177 FOR_EACH_BB (bb)
274 || single_succ (bb) == bb in tree_forwarder_block_p()
308 if (bb->loop_father->header == bb) in tree_forwarder_block_p()
394 if (dest == bb) in remove_forwarder_block()
516 basic_block bb; in cleanup_forwarder_blocks() local
521 FOR_EACH_BB (bb) in cleanup_forwarder_blocks()
524 *current++ = bb; in cleanup_forwarder_blocks()
642 if (dest == bb) in remove_forwarder_block_with_phi()
764 basic_block bb; in merge_phi_nodes() local
[all …]
H A Dcfgbuild.c254 basic_block bb; in make_edges() local
413 cached_make_edge (edge_cache, bb, bb->next_bb, EDGE_FALLTHRU); in make_edges()
518 basic_block bb; in find_basic_blocks() local
531 bb->aux = NULL; in find_basic_blocks()
562 FOR_EACH_BB (bb) in find_basic_blocks()
581 basic_block bb; in mark_tablejump_edge() local
588 SET_STATE (bb, FULL_STATE (bb) | BLOCK_USED_BY_TABLEJUMP); in mark_tablejump_edge()
700 if (bb != orig_bb && tablejump_p (BB_END (bb), NULL, &table)) in find_bb_boundaries()
767 min = max = bb; in find_many_sub_basic_blocks()
768 for (; bb != EXIT_BLOCK_PTR; bb = bb->next_bb) in find_many_sub_basic_blocks()
[all …]
H A Dcfgrtl.c305 SET_BASIC_BLOCK (bb->index, bb); in create_basic_block_structure()
311 bb->aux = bb; in create_basic_block_structure()
313 return bb; in create_basic_block_structure()
342 return bb; in rtl_create_basic_block()
1491 bb->aux = &bb->aux; in commit_one_edge_insertion()
1531 gcc_assert (bb->aux == &bb->aux); in commit_edge_insertions()
1576 gcc_assert (bb->aux == &bb->aux); in commit_edge_insertions_watch_calls()
1634 start[INSN_UID (BB_HEAD (bb))] = bb; in print_rtl_with_bb()
1635 end[INSN_UID (BB_END (bb))] = bb; in print_rtl_with_bb()
2255 single_succ_edge (bb)->count = bb->count; in purge_dead_edges()
[all …]
H A Dcfg.c110 basic_block bb; in clear_edges() local
135 basic_block bb; in alloc_block() local
136 bb = ggc_alloc_cleared (sizeof (*bb)); in alloc_block()
137 return bb; in alloc_block()
165 basic_block bb; in compact_blocks() local
418 bb->flags = (BB_PARTITION (bb) | (bb->flags & BB_DISABLE_SCHEDULE) in clear_bb_flags()
449 && (lsum - bb->count > 100 || lsum - bb->count < -100)) in check_bb_profile()
465 if (lsum - bb->count > 100 || lsum - bb->count < -100) in check_bb_profile()
806 return bb; in debug_bb_n()
882 bb->index); in update_bb_profile_for_threading()
[all …]
H A Dprofile.c137 basic_block bb; in instrument_edges() local
232 basic_block bb; in get_exec_counts() local
264 basic_block bb; in compute_branch_probabilities() local
475 FOR_EACH_BB (bb) in compute_branch_probabilities()
496 bb->index, (int)bb->count); in compute_branch_probabilities()
497 bb->count = 0; in compute_branch_probabilities()
672 #define BB_TO_GCOV_INDEX(bb) ((bb)->index - 1) argument
738 basic_block bb; in branch_prob() local
990 if (single_succ_p (bb) && single_succ_edge (bb)->goto_locus) in branch_prob()
1074 bb = bb1; in find_group()
[all …]
H A Dsched-ebb.c335 for (bb = last_block; bb; bb = bb->aux) in earliest_block_with_similiar_load()
339 if (!bb) in earliest_block_with_similiar_load()
367 last_block = bb; in add_deps_for_risky_insns()
380 if (bb) in add_deps_for_risky_insns()
382 bb = bb->aux; in add_deps_for_risky_insns()
383 if (!bb) in add_deps_for_risky_insns()
596 bb = bb->next_bb; in schedule_ebbs()
731 return bb; in advance_target_bb()
743 bb = bb->next_bb; in advance_target_bb()
745 while (bb_note (bb) == BB_END (bb)); in advance_target_bb()
[all …]
H A Dtree-if-conv.c145 basic_block bb; in tree_if_conversion() local
499 basic_block bb; in if_convertible_loop_p() local
580 exit_bb = bb; in if_convertible_loop_p()
605 bb->aux = cond; in add_to_predicate_list()
663 basic_block *bb; in clean_predicate_lists() local
675 free (bb); in clean_predicate_lists()
800 basic_block bb; in replace_phi_with_cond_modify_expr() local
853 basic_block bb; in process_phi_nodes() local
911 exit_bb = bb; in combine_blocks()
962 if (bb == exit_bb || bb == loop->latch) in combine_blocks()
[all …]
H A Dpredict.c121 && (bb->count in maybe_hot_bb_p()
135 && (bb->count in probably_cold_bb_p()
366 if (bb->count) in dump_prediction()
426 bb->index); in combine_predictions_for_insn()
623 if (!bb->count) in combine_predictions_for_bb()
723 bb = bbs[j]; in predict_loops()
890 combine_predictions_for_insn (BB_END (bb), bb); in guess_outgoing_edge_probabilities()
1001 basic_block bb; in strip_builtin_expect() local
1247 basic_block bb; in tree_bb_level_predictions() local
1291 basic_block bb; in tree_estimate_probability() local
[all …]
H A Ddomwalk.c155 if (EDGE_COUNT (bb->preds) > 0 || bb == ENTRY_BLOCK_PTR) in walk_dominator_tree()
162 bb->index); in walk_dominator_tree()
186 walk_data->initialize_block_local_data (walk_data, bb, in walk_dominator_tree()
200 for (bsi = bsi_last (bb); !bsi_end_p (bsi); bsi_prev (&bsi)) in walk_dominator_tree()
204 for (bsi = bsi_start (bb); !bsi_end_p (bsi); bsi_next (&bsi)) in walk_dominator_tree()
216 worklist[sp++] = bb; in walk_dominator_tree()
219 for (dest = first_dom_son (walk_data->dom_direction, bb); in walk_dominator_tree()
227 bb = worklist[--sp]; in walk_dominator_tree()
230 bb->index); in walk_dominator_tree()
240 for (bsi = bsi_last (bb); !bsi_end_p (bsi); bsi_prev (&bsi)) in walk_dominator_tree()
[all …]
H A Dbb-reorder.c280 for (bb = traces[i].first; bb != traces[i].last; bb = bb->aux) in find_traces()
281 fprintf (dump_file, "%d [%d] ", bb->index, bb->frequency); in find_traces()
282 fprintf (dump_file, "%d [%d]\n", bb->index, bb->frequency); in find_traces()
294 basic_block bb; in rotate_loop() local
360 bb = bb->aux; in rotate_loop()
461 bbd[bb->index].node = fibheap_insert (new_heap, key, bb); in find_traces_1_round()
652 bb = copy_bb (best_edge->dest, best_edge, bb, in find_traces_1_round()
1145 for (bb = traces[0].first; bb; bb = bb->aux) in connect_traces()
2018 bb->aux = bb->next_bb; in duplicate_computed_gotos()
2068 || single_succ (bb) == bb->next_bb in duplicate_computed_gotos()
[all …]
H A Dlcm.c101 basic_block bb; in compute_antinout_edge() local
120 *qin++ = bb; in compute_antinout_edge()
121 bb->aux = bb; in compute_antinout_edge()
157 transp[bb->index], antout[bb->index])) in compute_antinout_edge()
293 bb->aux = bb; in compute_laterin()
315 sbitmap_a_and_b (laterin[bb->index], laterin[bb->index], in compute_laterin()
360 sbitmap_difference (delete[bb->index], antloc[bb->index], in compute_insert_delete()
498 bb->aux = bb; in compute_available()
536 avin[bb->index], kill[bb->index])) in compute_available()
639 bb->aux = bb; in compute_nearerout()
[all …]

12345678910>>...22