Home
last modified time | relevance | path

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

12345678910>>...17

/freebsd-12.1/contrib/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 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 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 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()
802 basic_block bb; in replace_phi_with_cond_modify_expr() local
855 basic_block bb; in process_phi_nodes() local
913 exit_bb = bb; in combine_blocks()
964 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 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 …]
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 Dsched-rgn.c1327 SET_BIT (dom[bb], bb); in compute_dom_prob_ps()
2538 for (bb = 0; bb < current_nr_blocks; bb++) in free_pending_lists()
2555 for (bb = 0; bb < current_nr_blocks; bb++) in debug_dependencies()
2631 for (bb = 0; bb < current_nr_blocks; bb++) in sched_is_disabled_for_current_region_p()
2658 for (bb = 0; bb <= current_nr_blocks; bb++) in schedule_region()
2672 for (bb = 0; bb < current_nr_blocks; bb++) in schedule_region()
2676 for (bb = 0; bb < current_nr_blocks; bb++) in schedule_region()
2705 for (bb = 0; bb < current_nr_blocks; bb++) in schedule_region()
2751 for (bb = 0; bb < current_nr_blocks; bb++) in schedule_region()
2767 for (bb = 0; bb < current_nr_blocks; bb++) in schedule_region()
[all …]
H A Dtree-ssa-math-opts.c108 basic_block bb; member
157 occ->bb = bb; in occ_new()
179 basic_block bb = new_occ->bb, occ_bb = occ->bb; in insert_bb() local
181 if (dom == bb) in insert_bb()
258 basic_block bb; in compute_merit() local
265 bb = dom; in compute_merit()
267 if (dominated_by_p (CDI_POST_DOMINATORS, bb, occ_child->bb)) in compute_merit()
320 else if (def_bsi && occ->bb == def_bsi->bb) in insert_reciprocals()
456 basic_block bb; in execute_cse_reciprocals() local
467 FOR_EACH_BB (bb) in execute_cse_reciprocals()
[all …]
H A Dtree-cfg.c353 bb = create_basic_block (stmt_list, NULL, bb); in make_blocks()
413 return bb; in create_bb()
592 make_edge (bb, bb->next_bb, EDGE_FALLTHRU); in make_edges()
1410 return bb; in single_noncomplex_succ()
1419 return bb; in single_noncomplex_succ()
2627 e = find_edge (bb, bb->next_bb); in disband_implicit_edges()
2773 ann->bb = bb; in set_bb_for_stmt()
2817 get_stmt_ann (t)->bb = bb; in change_bb_for_stmt()
4013 set_phi_nodes (bb, phi_reverse (phi_nodes (bb))); in tree_make_forwarder_block()
5023 return bb; in move_sese_region_to_fn()
[all …]
H A Dtree-ssa-dce.c213 if (! bb) in find_pdom()
215 return bb; in find_pdom()
388 basic_block bb; in find_obviously_necessary_stmts() local
392 FOR_EACH_BB (bb) in find_obviously_necessary_stmts()
425 FOR_EACH_BB (bb) in find_obviously_necessary_stmts()
570 basic_block bb; in mark_really_necessary_kill_operand_phis() local
575 FOR_EACH_BB (bb) in mark_really_necessary_kill_operand_phis()
627 basic_block bb; in eliminate_unnecessary_stmts() local
634 FOR_EACH_BB (bb) in eliminate_unnecessary_stmts()
640 FOR_EACH_BB (bb) in eliminate_unnecessary_stmts()
[all …]
H A Ddominance.c259 bb = e->dest; in calc_dfs_tree_nonrec()
270 bb = e->src; in calc_dfs_tree_nonrec()
495 ei = (reverse) ? ei_start (bb->succs) : ei_start (bb->preds); in calc_idoms()
592 basic_block bb; in compute_dom_fast_query() local
599 FOR_ALL_BB (bb) in compute_dom_fast_query()
656 basic_block bb; in free_dominance_info() local
661 FOR_ALL_BB (bb) in free_dominance_info()
939 basic_block bb; in verify_dominators() local
943 FOR_EACH_BB (bb) in verify_dominators()
1055 bb->dom[dir] = et_new_tree (bb); in add_to_dominance_info()
[all …]
H A Dbt-load.c53 basic_block bb; member
79 basic_block bb; member
309 this->bb = bb; in add_btr_def()
360 user->bb = bb; in new_btr_user()
827 if (BASIC_BLOCK (bb) == user->bb) in block_at_edge_of_live_range_p()
844 unsigned bb; in clear_btr_from_live_range() local
872 unsigned bb; in add_btr_to_live_range() local
1029 def->bb, user->bb, in btr_def_live_range()
1093 def->bb, user->bb, in combine_btr_defs()
1322 if (user->bb == def->bb in migrate_btr_def()
[all …]
H A Dcfganal.c89 if (bb == EXIT_BLOCK_PTR || bb == ENTRY_BLOCK_PTR in forwarder_block_p()
244 basic_block bb; in set_edge_can_fallthru_flag() local
246 FOR_EACH_BB (bb) in set_edge_can_fallthru_flag()
266 if (!invert_jump (BB_END (bb), JUMP_LABEL (BB_END (bb)), 0)) in set_edge_can_fallthru_flag()
268 invert_jump (BB_END (bb), JUMP_LABEL (BB_END (bb)), 0); in set_edge_can_fallthru_flag()
289 FOR_EACH_BB (bb) in find_unreachable_blocks()
345 basic_block bb; in create_edge_list() local
581 basic_block bb; in remove_fake_edges() local
603 basic_block bb; in add_noreturn_fake_exit_edges() local
897 basic_block bb; in flow_dfs_compute_reverse_execute() local
[all …]
H A Dtree-ssa-threadupdate.c138 basic_block bb; member
177 bsi = bsi_last (bb); in remove_ctrl_stmt_and_useless_edges()
407 FOR_EACH_EDGE (e, ei, bb->succs) in prune_undesirable_thread_requests()
665 bsi = bsi_start (bb); in redirection_block_p()
712 thread_block (basic_block bb) in thread_block() argument
732 && EDGE_COUNT (bb->preds) > 1 in thread_block()
733 && !redirection_block_p (bb)) in thread_block()
749 FOR_EACH_EDGE (e, ei, bb->preds) in thread_block()
762 FOR_EACH_EDGE (e, ei, bb->preds) in thread_block()
800 local_info.bb = bb; in thread_block()
[all …]
H A Dcfgloop.c56 basic_block bb; in flow_loops_cfg_dump() local
61 FOR_EACH_BB (bb) in flow_loops_cfg_dump()
275 basic_block bb; in mark_single_exit_loops() local
287 FOR_EACH_BB (bb) in mark_single_exit_loops()
602 basic_block bb; in flow_loops_find() local
689 FOR_EACH_BB (bb) in flow_loops_find()
766 if (bb == ENTRY_BLOCK_PTR || bb == EXIT_BLOCK_PTR) in flow_bb_inside_loop_p()
799 tovisit[tv++] = bb; in get_loop_body()
872 basic_block bb; in get_loop_body_in_bfs_order() local
883 bb = loop->header; in get_loop_body_in_bfs_order()
[all …]
H A Dmode-switching.c110 ptr->bbnum = bb; in new_seginfo()
390 basic_block bb; in optimize_mode_switching() local
451 FOR_EACH_BB (bb) in optimize_mode_switching()
469 ptr = new_seginfo (no_mode, BB_HEAD (bb), bb->index, live_now); in optimize_mode_switching()
475 for (insn = BB_HEAD (bb); in optimize_mode_switching()
510 ptr = new_seginfo (no_mode, BB_END (bb), bb->index, live_now); in optimize_mode_switching()
520 bb = post_entry; in optimize_mode_switching()
555 FOR_EACH_BB (bb) in optimize_mode_switching()
568 FOR_EACH_BB (bb) in optimize_mode_switching()
569 sbitmap_not (kill[bb->index], transp[bb->index]); in optimize_mode_switching()
[all …]
/freebsd-12.1/contrib/apr-util/test/
H A Dtestbuckets.c25 apr_bucket_brigade *bb; in test_create() local
33 apr_brigade_destroy(bb); in test_create()
40 apr_bucket_brigade *bb; in test_simple() local
69 apr_brigade_cleanup(bb); in test_simple()
73 apr_brigade_destroy(bb); in test_simple()
90 return bb; in make_simple_brigade()
116 apr_bucket_brigade *bb; in test_flatten() local
122 apr_brigade_destroy(bb); in test_flatten()
161 apr_brigade_destroy(bb); in test_split()
232 apr_bucket_brigade *bb; in test_splits() local
[all …]

12345678910>>...17