Home
last modified time | relevance | path

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

12345678910>>...22

/trueos/contrib/gcc/
HDtracer.c69 #define seen(bb) (bb->il.rtl->visited || bb->aux) argument
73 ignore_bb_p (basic_block bb) in ignore_bb_p() argument
75 if (bb->index < NUM_FIXED_BLOCKS) in ignore_bb_p()
77 if (!maybe_hot_bb_p (bb)) in ignore_bb_p()
85 count_insns (basic_block bb) in count_insns() argument
90 for (insn = BB_HEAD (bb); in count_insns()
91 insn != NEXT_INSN (BB_END (bb)); in count_insns()
118 find_best_successor (basic_block bb) in find_best_successor() argument
124 FOR_EACH_EDGE (e, ei, bb->succs) in find_best_successor()
137 find_best_predecessor (basic_block bb) in find_best_predecessor() argument
[all …]
HDcfglayout.c81 skip_insns_after_block (basic_block bb) in skip_insns_after_block() argument
86 if (bb->next_bb != EXIT_BLOCK_PTR) in skip_insns_after_block()
87 next_head = BB_HEAD (bb->next_bb); in skip_insns_after_block()
89 for (last_insn = insn = BB_END (bb); (insn = NEXT_INSN (insn)) != 0; ) in skip_insns_after_block()
145 for (insn = last_insn; insn != BB_END (bb); insn = prev) in skip_insns_after_block()
166 label_for_bb (basic_block bb) in label_for_bb() argument
168 rtx label = BB_HEAD (bb); in label_for_bb()
173 fprintf (dump_file, "Emitting label for block %d\n", bb->index); in label_for_bb()
175 label = block_label (bb); in label_for_bb()
188 basic_block bb; in record_effective_endpoints() local
[all …]
HDcfghooks.c76 basic_block bb, last_bb_seen; in verify_flow_info() local
85 FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR->next_bb, NULL, next_bb) in verify_flow_info()
87 if (bb != EXIT_BLOCK_PTR in verify_flow_info()
88 && bb != BASIC_BLOCK (bb->index)) in verify_flow_info()
90 error ("bb %d on wrong place", bb->index); in verify_flow_info()
94 if (bb->prev_bb != last_bb_seen) in verify_flow_info()
97 bb->index, last_bb_seen->index, bb->prev_bb->index); in verify_flow_info()
101 last_bb_seen = bb; in verify_flow_info()
105 FOR_EACH_BB_REVERSE (bb) in verify_flow_info()
111 if (bb->count < 0) in verify_flow_info()
[all …]
HDtree-cfgcleanup.c72 cleanup_control_expr_graph (basic_block bb, block_stmt_iterator bsi) in cleanup_control_expr_graph() argument
78 if (!single_succ_p (bb)) in cleanup_control_expr_graph()
105 taken_edge = find_taken_edge (bb, val); in cleanup_control_expr_graph()
114 for (ei = ei_start (bb->succs); (e = ei_safe_edge (ei)); ) in cleanup_control_expr_graph()
139 taken_edge = single_succ_edge (bb); in cleanup_control_expr_graph()
163 basic_block bb; local
172 bb = bb_for_stmt (stmt);
173 if (bb != NULL && last_stmt (bb) != stmt && noreturn_call_p (stmt))
174 split_block (bb, stmt);
177 FOR_EACH_BB (bb)
[all …]
HDcfgrtl.c248 basic_block bb; in create_basic_block_structure() local
251 && (bb = NOTE_BASIC_BLOCK (bb_note)) != NULL in create_basic_block_structure()
252 && bb->aux == NULL) in create_basic_block_structure()
273 bb = alloc_block (); in create_basic_block_structure()
275 init_rtl_bb_info (bb); in create_basic_block_structure()
293 NOTE_BASIC_BLOCK (bb_note) = bb; in create_basic_block_structure()
300 BB_HEAD (bb) = head; in create_basic_block_structure()
301 BB_END (bb) = end; in create_basic_block_structure()
302 bb->index = last_basic_block++; in create_basic_block_structure()
303 bb->flags = BB_NEW | BB_RTL; in create_basic_block_structure()
[all …]
HDcfgbuild.c254 basic_block bb; in make_edges() local
268 FOR_BB_BETWEEN (bb, min, max->next_bb, next_bb) in make_edges()
275 if (STATE (bb) == BLOCK_ORIGINAL) in make_edges()
284 FOR_EACH_EDGE (e, ei, bb->succs) in make_edges()
290 if (LABEL_P (BB_HEAD (bb)) in make_edges()
291 && LABEL_ALT_ENTRY_P (BB_HEAD (bb))) in make_edges()
292 cached_make_edge (NULL, ENTRY_BLOCK_PTR, bb, 0); in make_edges()
297 insn = BB_END (bb); in make_edges()
307 rtl_make_eh_edge (edge_cache, bb, insn); in make_edges()
326 make_label_edge (edge_cache, bb, in make_edges()
[all …]
HDcfg.c110 basic_block bb; in clear_edges() local
114 FOR_EACH_BB (bb) in clear_edges()
116 FOR_EACH_EDGE (e, ei, bb->succs) in clear_edges()
118 VEC_truncate (edge, bb->succs, 0); in clear_edges()
119 VEC_truncate (edge, bb->preds, 0); in clear_edges()
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
171 FOR_EACH_BB (bb) in compact_blocks()
[all …]
HDprofile.c137 basic_block bb; in instrument_edges() local
139 FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR, NULL, next_bb) in instrument_edges()
144 FOR_EACH_EDGE (e, ei, bb->succs) in instrument_edges()
232 basic_block bb; in get_exec_counts() local
236 FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR, NULL, next_bb) in get_exec_counts()
241 FOR_EACH_EDGE (e, ei, bb->succs) in get_exec_counts()
264 basic_block bb; in compute_branch_probabilities() local
294 FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR, NULL, next_bb) in compute_branch_probabilities()
299 FOR_EACH_EDGE (e, ei, bb->succs) in compute_branch_probabilities()
301 BB_INFO (bb)->succ_count++; in compute_branch_probabilities()
[all …]
HDsched-ebb.c133 basic_block bb; in begin_schedule_ready() local
165 bb = split_edge (e); in begin_schedule_ready()
166 gcc_assert (NOTE_INSN_BASIC_BLOCK_P (BB_END (bb))); in begin_schedule_ready()
170 bb = create_basic_block (NEXT_INSN (insn), NULL_RTX, last_bb); in begin_schedule_ready()
176 current_sched_info->next_tail = NEXT_INSN (BB_END (bb)); in begin_schedule_ready()
179 add_block (bb, last_bb); in begin_schedule_ready()
180 gcc_assert (last_bb == bb); in begin_schedule_ready()
304 basic_block bb, earliest_block = NULL; in earliest_block_with_similiar_load() local
335 for (bb = last_block; bb; bb = bb->aux) in earliest_block_with_similiar_load()
336 if (insn2_block == bb) in earliest_block_with_similiar_load()
[all …]
HDtree-if-conv.c145 basic_block bb; in tree_if_conversion() local
171 bb = ifc_bbs [i]; in tree_if_conversion()
174 cond = bb->aux; in tree_if_conversion()
179 for (itr = bsi_start (bb); !bsi_end_p (itr); /* empty */) in tree_if_conversion()
189 if (single_succ_p (bb)) in tree_if_conversion()
191 basic_block bb_n = single_succ (bb); in tree_if_conversion()
302 if_convertible_phi_p (struct loop *loop, basic_block bb, tree phi) in if_convertible_phi_p() argument
310 if (bb != loop->header && PHI_NUM_ARGS (phi) != 2) in if_convertible_phi_p()
344 if_convertible_modify_expr_p (struct loop *loop, basic_block bb, tree m_expr) in if_convertible_modify_expr_p() argument
361 if (bb != loop->header in if_convertible_modify_expr_p()
[all …]
HDpredict.c118 maybe_hot_bb_p (basic_block bb) in maybe_hot_bb_p() argument
121 && (bb->count in maybe_hot_bb_p()
124 if (bb->frequency < BB_FREQ_MAX / PARAM_VALUE (HOT_BB_FREQUENCY_FRACTION)) in maybe_hot_bb_p()
132 probably_cold_bb_p (basic_block bb) in probably_cold_bb_p() argument
135 && (bb->count in probably_cold_bb_p()
138 if (bb->frequency < BB_FREQ_MAX / PARAM_VALUE (HOT_BB_FREQUENCY_FRACTION)) in probably_cold_bb_p()
145 probably_never_executed_bb_p (basic_block bb) in probably_never_executed_bb_p() argument
148 return ((bb->count + profile_info->runs / 2) / profile_info->runs) == 0; in probably_never_executed_bb_p()
156 rtl_predicted_by_p (basic_block bb, enum br_predictor predictor) in rtl_predicted_by_p() argument
159 if (!INSN_P (BB_END (bb))) in rtl_predicted_by_p()
[all …]
HDbb-reorder.c200 push_to_next_round_p (basic_block bb, int round, int number_of_rounds, in push_to_next_round_p() argument
208 block_not_hot_enough = (bb->frequency < exec_th in push_to_next_round_p()
209 || bb->count < count_th in push_to_next_round_p()
210 || probably_never_executed_bb_p (bb)); in push_to_next_round_p()
277 basic_block bb; in find_traces() local
280 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
306 bb = back_edge->dest; in rotate_loop()
[all …]
HDdomwalk.c143 walk_dominator_tree (struct dom_walk_data *walk_data, basic_block bb) in walk_dominator_tree() argument
155 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()
194 (*walk_data->before_dom_children_before_stmts) (walk_data, bb); in walk_dominator_tree()
200 for (bsi = bsi_last (bb); !bsi_end_p (bsi); bsi_prev (&bsi)) in walk_dominator_tree()
201 (*walk_data->before_dom_children_walk_stmts) (walk_data, bb, in walk_dominator_tree()
204 for (bsi = bsi_start (bb); !bsi_end_p (bsi); bsi_next (&bsi)) in walk_dominator_tree()
205 (*walk_data->before_dom_children_walk_stmts) (walk_data, bb, in walk_dominator_tree()
212 (*walk_data->before_dom_children_after_stmts) (walk_data, bb); in walk_dominator_tree()
[all …]
HDlcm.c101 basic_block bb; in compute_antinout_edge() local
118 FOR_EACH_BB_REVERSE (bb) in compute_antinout_edge()
120 *qin++ = bb; in compute_antinout_edge()
121 bb->aux = bb; in compute_antinout_edge()
137 bb = *qout++; in compute_antinout_edge()
143 if (bb->aux == EXIT_BLOCK_PTR) in compute_antinout_edge()
147 sbitmap_zero (antout[bb->index]); in compute_antinout_edge()
152 bb->aux = NULL; in compute_antinout_edge()
153 sbitmap_intersection_of_succs (antout[bb->index], antin, bb->index); in compute_antinout_edge()
156 if (sbitmap_a_or_b_and_c_cg (antin[bb->index], antloc[bb->index], in compute_antinout_edge()
[all …]
HDtree-ssa-math-opts.c108 basic_block bb; member
150 occ_new (basic_block bb, struct occurrence *children) in occ_new() argument
154 occ = bb->aux = pool_alloc (occ_pool); in occ_new()
157 occ->bb = bb; in occ_new()
179 basic_block bb = new_occ->bb, occ_bb = occ->bb; in insert_bb() local
180 basic_block dom = nearest_common_dominator (CDI_DOMINATORS, occ_bb, bb); in insert_bb()
181 if (dom == bb) in insert_bb()
231 register_division_in (basic_block bb) in register_division_in() argument
235 occ = (struct occurrence *) bb->aux; in register_division_in()
238 occ = occ_new (bb, NULL); in register_division_in()
[all …]
HDsched-rgn.c229 #define IS_RGN_ENTRY(bb) (!bb) argument
397 int rgn, bb; in debug_regions() local
410 for (bb = 0; bb < rgn_table[rgn].rgn_nr_blocks; bb++) in debug_regions()
411 fprintf (sched_dump, " %d/%d ", bb, rgn_bb_table[current_blocks + bb]); in debug_regions()
424 basic_block bb; in find_single_block_region() local
428 FOR_EACH_BB (bb) in find_single_block_region()
430 rgn_bb_table[nr_regions] = bb->index; in find_single_block_region()
435 CONTAINING_RGN (bb->index) = nr_regions; in find_single_block_region()
436 BLOCK_TO_BB (bb->index) = 0; in find_single_block_region()
513 basic_block bb; in find_rgns() local
[all …]
HDtree-ssa-dce.c141 set_control_dependence_map_bit (basic_block bb, int edge_index) in set_control_dependence_map_bit() argument
143 if (bb == ENTRY_BLOCK_PTR) in set_control_dependence_map_bit()
145 gcc_assert (bb != EXIT_BLOCK_PTR); in set_control_dependence_map_bit()
146 bitmap_set_bit (control_dependence_map[bb->index], edge_index); in set_control_dependence_map_bit()
151 clear_control_dependence_bitmap (basic_block bb) in clear_control_dependence_bitmap() argument
153 bitmap_clear (control_dependence_map[bb->index]); in clear_control_dependence_bitmap()
212 basic_block bb = get_immediate_dominator (CDI_POST_DOMINATORS, block); in find_pdom() local
213 if (! bb) in find_pdom()
215 return bb; in find_pdom()
388 basic_block bb; in find_obviously_necessary_stmts() local
[all …]
HDtree-cfg.c115 static inline void change_bb_for_stmt (tree t, basic_block bb);
259 basic_block bb; in factor_computed_gotos() local
269 FOR_EACH_BB (bb) in factor_computed_gotos()
271 block_stmt_iterator bsi = bsi_last (bb); in factor_computed_gotos()
293 basic_block new_bb = create_empty_bb (bb); in factor_computed_gotos()
337 basic_block bb = ENTRY_BLOCK_PTR; in make_blocks() local
353 bb = create_basic_block (stmt_list, NULL, bb); in make_blocks()
359 set_bb_for_stmt (stmt, bb); in make_blocks()
380 basic_block bb; in create_bb() local
387 bb = alloc_block (); in create_bb()
[all …]
HDdominance.c202 calc_dfs_tree_nonrec (struct dom_info *di, basic_block bb, in calc_dfs_tree_nonrec() argument
223 ei = ei_start (bb->preds); in calc_dfs_tree_nonrec()
229 ei = ei_start (bb->succs); in calc_dfs_tree_nonrec()
259 bb = e->dest; in calc_dfs_tree_nonrec()
270 bb = e->src; in calc_dfs_tree_nonrec()
277 if (bb != en_block) in calc_dfs_tree_nonrec()
278 my_i = di->dfs_order[bb->index]; in calc_dfs_tree_nonrec()
489 basic_block bb = di->dfs_to_bb[v]; in calc_idoms() local
495 ei = (reverse) ? ei_start (bb->succs) : ei_start (bb->preds); in calc_idoms()
500 if (bitmap_bit_p (di->fake_exit_edge, bb->index)) in calc_idoms()
[all …]
HDbt-load.c53 basic_block bb; member
79 basic_block bb; member
181 basic_block_freq (basic_block bb) in basic_block_freq() argument
183 return bb->frequency; in basic_block_freq()
303 add_btr_def (fibheap_t all_btr_defs, basic_block bb, int insn_luid, rtx insn, in add_btr_def() argument
309 this->bb = bb; in add_btr_def()
313 this->cost = basic_block_freq (bb); in add_btr_def()
328 dest_reg, bb->index, INSN_UID (insn), (this->group ? "" : ":not const"), in add_btr_def()
337 new_btr_user (basic_block bb, int insn_luid, rtx insn) in new_btr_user() argument
360 user->bb = bb; in new_btr_user()
[all …]
HDcfganal.c85 forwarder_block_p (basic_block bb) in forwarder_block_p() argument
89 if (bb == EXIT_BLOCK_PTR || bb == ENTRY_BLOCK_PTR in forwarder_block_p()
90 || !single_succ_p (bb)) in forwarder_block_p()
93 for (insn = BB_HEAD (bb); insn != BB_END (bb); insn = NEXT_INSN (insn)) 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()
251 FOR_EACH_EDGE (e, ei, bb->succs) in set_edge_can_fallthru_flag()
262 if (EDGE_COUNT (bb->succs) != 2) in set_edge_can_fallthru_flag()
264 if (!any_condjump_p (BB_END (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()
[all …]
HDtree-ssa-threadupdate.c138 basic_block bb; member
171 remove_ctrl_stmt_and_useless_edges (basic_block bb, basic_block dest_bb) in remove_ctrl_stmt_and_useless_edges() argument
177 bsi = bsi_last (bb); in remove_ctrl_stmt_and_useless_edges()
191 for (ei = ei_start (bb->succs); (e = ei_safe_edge (ei)); ) in remove_ctrl_stmt_and_useless_edges()
204 create_block_for_threading (basic_block bb, struct redirection_data *rd) in create_block_for_threading() argument
208 rd->dup_block = duplicate_block (bb, NULL, NULL); in create_block_for_threading()
348 create_block_for_threading (local_info->bb, rd); in create_duplicates()
398 prune_undesirable_thread_requests (basic_block bb) in prune_undesirable_thread_requests() argument
407 FOR_EACH_EDGE (e, ei, bb->succs) in prune_undesirable_thread_requests()
449 FOR_EACH_EDGE (e, ei, bb->preds) in prune_undesirable_thread_requests()
[all …]
HDcfgloop.c56 basic_block bb; in flow_loops_cfg_dump() local
61 FOR_EACH_BB (bb) in flow_loops_cfg_dump()
66 fprintf (file, ";; %d succs { ", bb->index); in flow_loops_cfg_dump()
67 FOR_EACH_EDGE (succ, ei, bb->succs) 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()
290 if (bb->loop_father == loops->tree_root) in mark_single_exit_loops()
292 FOR_EACH_EDGE (e, ei, bb->succs) in mark_single_exit_loops()
297 if (flow_bb_inside_loop_p (bb->loop_father, e->dest)) in mark_single_exit_loops()
300 for (loop = bb->loop_father; in mark_single_exit_loops()
[all …]
HDmode-switching.c104 new_seginfo (int mode, rtx insn, int bb, HARD_REG_SET regs_live) in new_seginfo() argument
110 ptr->bbnum = bb; in new_seginfo()
390 basic_block bb; in optimize_mode_switching() local
451 FOR_EACH_BB (bb) in optimize_mode_switching()
458 bb->il.rtl->global_live_at_start); in optimize_mode_switching()
464 FOR_EACH_EDGE (e, ei, bb->preds) in optimize_mode_switching()
469 ptr = new_seginfo (no_mode, BB_HEAD (bb), bb->index, live_now); in optimize_mode_switching()
470 add_seginfo (info + bb->index, ptr); in optimize_mode_switching()
471 RESET_BIT (transp[bb->index], j); in optimize_mode_switching()
475 for (insn = BB_HEAD (bb); in optimize_mode_switching()
[all …]
/trueos/contrib/apr-util/test/
HDtestbuckets.c25 apr_bucket_brigade *bb; in test_create() local
28 bb = apr_brigade_create(p, ba); in test_create()
30 ABTS_ASSERT(tc, "new brigade not NULL", bb != NULL); in test_create()
31 ABTS_ASSERT(tc, "new brigade is empty", APR_BRIGADE_EMPTY(bb)); in test_create()
33 apr_brigade_destroy(bb); in test_create()
40 apr_bucket_brigade *bb; in test_simple() local
44 bb = apr_brigade_create(p, ba); in test_simple()
46 fb = APR_BRIGADE_FIRST(bb); in test_simple()
48 fb == APR_BRIGADE_SENTINEL(bb)); in test_simple()
51 APR_BRIGADE_INSERT_HEAD(bb, fb); in test_simple()
[all …]

12345678910>>...22