Home
last modified time | relevance | path

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

12345678910>>...22

/dflybsd-src/contrib/gcc-4.7/gcc/
H A Dcfglayout.c83 skip_insns_after_block (basic_block bb) in skip_insns_after_block() argument
88 if (bb->next_bb != EXIT_BLOCK_PTR) in skip_insns_after_block()
89 next_head = BB_HEAD (bb->next_bb); in skip_insns_after_block()
91 for (last_insn = insn = BB_END (bb); (insn = NEXT_INSN (insn)) != 0; ) in skip_insns_after_block()
141 for (insn = last_insn; insn != BB_END (bb); insn = prev) in skip_insns_after_block()
165 label_for_bb (basic_block bb) in label_for_bb() argument
167 rtx label = BB_HEAD (bb); in label_for_bb()
172 fprintf (dump_file, "Emitting label for block %d\n", bb->index); in label_for_bb()
174 label = block_label (bb); in label_for_bb()
187 basic_block bb; in record_effective_endpoints() local
[all …]
H A Dtracer.c73 mark_bb_seen (basic_block bb) in mark_bb_seen() argument
77 if ((unsigned int)bb->index >= size) in mark_bb_seen()
80 SET_BIT (bb_seen, bb->index); in mark_bb_seen()
84 bb_seen_p (basic_block bb) in bb_seen_p() argument
86 return TEST_BIT (bb_seen, bb->index); in bb_seen_p()
91 ignore_bb_p (const_basic_block bb) in ignore_bb_p() argument
95 if (bb->index < NUM_FIXED_BLOCKS) in ignore_bb_p()
97 if (optimize_bb_for_size_p (bb)) in ignore_bb_p()
102 g = last_stmt (CONST_CAST_BB (bb)); in ignore_bb_p()
112 count_insns (basic_block bb) in count_insns() argument
[all …]
H A Dcfghooks.c96 basic_block bb, last_bb_seen; in verify_flow_info() local
105 FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR->next_bb, NULL, next_bb) in verify_flow_info()
107 if (bb != EXIT_BLOCK_PTR in verify_flow_info()
108 && bb != BASIC_BLOCK (bb->index)) in verify_flow_info()
110 error ("bb %d on wrong place", bb->index); in verify_flow_info()
114 if (bb->prev_bb != last_bb_seen) in verify_flow_info()
117 bb->index, last_bb_seen->index, bb->prev_bb->index); in verify_flow_info()
121 last_bb_seen = bb; in verify_flow_info()
125 FOR_EACH_BB_REVERSE (bb) in verify_flow_info()
131 if (bb->loop_father != NULL && current_loops == NULL) in verify_flow_info()
[all …]
H A Dcfgbuild.c213 basic_block bb; in make_edges() local
227 FOR_BB_BETWEEN (bb, min, max->next_bb, next_bb) in make_edges()
234 if (STATE (bb) == BLOCK_ORIGINAL) in make_edges()
243 FOR_EACH_EDGE (e, ei, bb->succs) in make_edges()
249 if (LABEL_P (BB_HEAD (bb)) in make_edges()
250 && LABEL_ALT_ENTRY_P (BB_HEAD (bb))) in make_edges()
251 cached_make_edge (NULL, ENTRY_BLOCK_PTR, bb, 0); in make_edges()
256 insn = BB_END (bb); in make_edges()
281 make_label_edge (edge_cache, bb, in make_edges()
291 make_label_edge (edge_cache, bb, in make_edges()
[all …]
H A Dprofile.c116 basic_block bb; in instrument_edges() local
118 FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR, NULL, next_bb) in instrument_edges()
123 FOR_EACH_EDGE (e, ei, bb->succs) in instrument_edges()
237 basic_block bb; in get_exec_counts() local
241 FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR, NULL, next_bb) in get_exec_counts()
246 FOR_EACH_EDGE (e, ei, bb->succs) in get_exec_counts()
295 basic_block bb; in correct_negative_edge_counts() local
299 FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR, NULL, next_bb) in correct_negative_edge_counts()
301 FOR_EACH_EDGE (e, ei, bb->succs) in correct_negative_edge_counts()
314 basic_block bb; in is_inconsistent() local
[all …]
H A Dtree-cfgcleanup.c76 cleanup_control_expr_graph (basic_block bb, gimple_stmt_iterator gsi) in cleanup_control_expr_graph() argument
83 if (!single_succ_p (bb)) in cleanup_control_expr_graph()
137 taken_edge = find_taken_edge (bb, val); in cleanup_control_expr_graph()
146 for (ei = ei_start (bb->succs); (e = ei_safe_edge (ei)); ) in cleanup_control_expr_graph()
171 taken_edge = single_succ_edge (bb); in cleanup_control_expr_graph()
173 bitmap_set_bit (cfgcleanup_altered_bbs, bb->index); in cleanup_control_expr_graph()
184 cleanup_control_flow_bb (basic_block bb) in cleanup_control_flow_bb() argument
192 retval |= gimple_purge_dead_eh_edges (bb); in cleanup_control_flow_bb()
194 gsi = gsi_last_bb (bb); in cleanup_control_flow_bb()
202 retval |= cleanup_control_expr_graph (bb, gsi); in cleanup_control_flow_bb()
[all …]
H A Dcfg.c116 basic_block bb; in clear_edges() local
120 FOR_EACH_BB (bb) in clear_edges()
122 FOR_EACH_EDGE (e, ei, bb->succs) in clear_edges()
124 VEC_truncate (edge, bb->succs, 0); in clear_edges()
125 VEC_truncate (edge, bb->preds, 0); in clear_edges()
141 basic_block bb; in alloc_block() local
142 bb = ggc_alloc_cleared_basic_block_def (); in alloc_block()
143 return bb; in alloc_block()
179 basic_block bb; in compact_blocks() local
182 FOR_EACH_BB (bb) in compact_blocks()
[all …]
H A Dcfgrtl.c255 basic_block bb; in create_basic_block_structure() local
258 && (bb = NOTE_BASIC_BLOCK (bb_note)) != NULL in create_basic_block_structure()
259 && bb->aux == NULL) in create_basic_block_structure()
280 bb = alloc_block (); in create_basic_block_structure()
282 init_rtl_bb_info (bb); in create_basic_block_structure()
300 NOTE_BASIC_BLOCK (bb_note) = bb; in create_basic_block_structure()
307 BB_HEAD (bb) = head; in create_basic_block_structure()
308 BB_END (bb) = end; in create_basic_block_structure()
309 bb->index = last_basic_block++; in create_basic_block_structure()
310 bb->flags = BB_NEW | BB_RTL; in create_basic_block_structure()
[all …]
H A Dtree-if-conv.c122 bb_has_predicate (basic_block bb) in bb_has_predicate() argument
124 return bb->aux != NULL; in bb_has_predicate()
130 bb_predicate (basic_block bb) in bb_predicate() argument
132 return ((bb_predicate_p) bb->aux)->predicate; in bb_predicate()
138 set_bb_predicate (basic_block bb, tree cond) in set_bb_predicate() argument
143 ((bb_predicate_p) bb->aux)->predicate = cond; in set_bb_predicate()
150 bb_predicate_gimplified_stmts (basic_block bb) in bb_predicate_gimplified_stmts() argument
152 return ((bb_predicate_p) bb->aux)->predicate_gimplified_stmts; in bb_predicate_gimplified_stmts()
159 set_bb_predicate_gimplified_stmts (basic_block bb, gimple_seq stmts) in set_bb_predicate_gimplified_stmts() argument
161 ((bb_predicate_p) bb->aux)->predicate_gimplified_stmts = stmts; in set_bb_predicate_gimplified_stmts()
[all …]
H A Dpredict.c152 maybe_hot_bb_p (const_basic_block bb) in maybe_hot_bb_p() argument
155 return maybe_hot_count_p (bb->count); in maybe_hot_bb_p()
156 return maybe_hot_frequency_p (bb->frequency); in maybe_hot_bb_p()
203 probably_never_executed_bb_p (const_basic_block bb) in probably_never_executed_bb_p() argument
206 return ((bb->count + profile_info->runs / 2) / profile_info->runs) == 0; in probably_never_executed_bb_p()
250 optimize_bb_for_size_p (const_basic_block bb) in optimize_bb_for_size_p() argument
252 return optimize_function_for_size_p (cfun) || !maybe_hot_bb_p (bb); in optimize_bb_for_size_p()
258 optimize_bb_for_speed_p (const_basic_block bb) in optimize_bb_for_speed_p() argument
260 return !optimize_bb_for_size_p (bb); in optimize_bb_for_speed_p()
367 rtl_profile_for_bb (basic_block bb) in rtl_profile_for_bb() argument
[all …]
H A Dsched-rgn.c186 #define IS_RGN_ENTRY(bb) (!bb) argument
358 int rgn, bb; in debug_regions() local
371 for (bb = 0; bb < rgn_table[rgn].rgn_nr_blocks; bb++) in debug_regions()
372 fprintf (sched_dump, " %d/%d ", bb, rgn_bb_table[current_blocks + bb]); in debug_regions()
383 int bb; in debug_region() local
394 for (bb = 0; bb < rgn_table[rgn].rgn_nr_blocks; bb++) in debug_region()
395 fprintf (stderr, " %d/%d ", bb, rgn_bb_table[current_blocks + bb]); in debug_region()
399 for (bb = 0; bb < rgn_table[rgn].rgn_nr_blocks; bb++) in debug_region()
401 debug_bb_n_slim (rgn_bb_table[current_blocks + bb]); in debug_region()
439 struct basic_block_def *bb = BASIC_BLOCK (src_bb_num); in dump_region_dot() local
[all …]
H A Dsched-ebb.c162 basic_block bb; in begin_move_insn() local
190 bb = split_edge (e); in begin_move_insn()
191 gcc_assert (NOTE_INSN_BASIC_BLOCK_P (BB_END (bb))); in begin_move_insn()
199 bb = create_basic_block (next, NULL_RTX, last_bb); in begin_move_insn()
206 current_sched_info->next_tail = NEXT_INSN (BB_END (bb)); in begin_move_insn()
210 sched_init_only_bb (bb, last_bb); in begin_move_insn()
211 gcc_assert (last_bb == bb); in begin_move_insn()
341 basic_block bb, earliest_block = NULL; in earliest_block_with_similiar_load() local
369 for (bb = last_block; bb; bb = (basic_block) bb->aux) in earliest_block_with_similiar_load()
370 if (insn2_block == bb) in earliest_block_with_similiar_load()
[all …]
H A Dbb-reorder.c195 push_to_next_round_p (const_basic_block bb, int round, int number_of_rounds, in push_to_next_round_p() argument
203 block_not_hot_enough = (bb->frequency < exec_th in push_to_next_round_p()
204 || bb->count < count_th in push_to_next_round_p()
205 || probably_never_executed_bb_p (bb)); in push_to_next_round_p()
272 basic_block bb; in find_traces() local
275 for (bb = traces[i].first; bb != traces[i].last; bb = (basic_block) bb->aux) in find_traces()
276 fprintf (dump_file, "%d [%d] ", bb->index, bb->frequency); in find_traces()
277 fprintf (dump_file, "%d [%d]\n", bb->index, bb->frequency); in find_traces()
289 basic_block bb; in rotate_loop() local
301 bb = back_edge->dest; in rotate_loop()
[all …]
/dflybsd-src/contrib/gcc-8.0/gcc/
H A Dcfgrtl.c139 basic_block bb = BLOCK_FOR_INSN (insn); in delete_insn() local
151 && bb != NULL in delete_insn()
152 && bb == BLOCK_FOR_INSN (bb_note)) in delete_insn()
155 BB_HEAD (bb) = bb_note; in delete_insn()
156 if (BB_END (bb) == bb_note) in delete_insn()
157 BB_END (bb) = insn; in delete_insn()
277 basic_block bb; in create_basic_block_structure() local
280 && (bb = NOTE_BASIC_BLOCK (bb_note)) != NULL in create_basic_block_structure()
281 && bb->aux == NULL) in create_basic_block_structure()
302 bb = alloc_block (); in create_basic_block_structure()
[all …]
H A Dtracer.c71 mark_bb_seen (basic_block bb) in mark_bb_seen() argument
75 if ((unsigned int)bb->index >= size) in mark_bb_seen()
78 bitmap_set_bit (bb_seen, bb->index); in mark_bb_seen()
82 bb_seen_p (basic_block bb) in bb_seen_p() argument
84 return bitmap_bit_p (bb_seen, bb->index); in bb_seen_p()
89 ignore_bb_p (const_basic_block bb) in ignore_bb_p() argument
91 if (bb->index < NUM_FIXED_BLOCKS) in ignore_bb_p()
93 if (optimize_bb_for_size_p (bb)) in ignore_bb_p()
96 if (gimple *g = last_stmt (CONST_CAST_BB (bb))) in ignore_bb_p()
117 count_insns (basic_block bb) in count_insns() argument
[all …]
H A Dcfgbuild.c202 basic_block bb; in make_edges() local
217 FOR_BB_BETWEEN (bb, min, max->next_bb, next_bb) in make_edges()
224 if (STATE (bb) == BLOCK_ORIGINAL) in make_edges()
233 FOR_EACH_EDGE (e, ei, bb->succs) in make_edges()
239 if (LABEL_P (BB_HEAD (bb)) in make_edges()
240 && LABEL_ALT_ENTRY_P (BB_HEAD (bb))) in make_edges()
241 cached_make_edge (NULL, ENTRY_BLOCK_PTR_FOR_FN (cfun), bb, 0); in make_edges()
246 insn = BB_END (bb); in make_edges()
267 make_label_edge (edge_cache, bb, in make_edges()
277 make_label_edge (edge_cache, bb, in make_edges()
[all …]
H A Dcfghooks.c97 basic_block bb, last_bb_seen; in verify_flow_info() local
106 FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR_FOR_FN (cfun)->next_bb, NULL, next_bb) in verify_flow_info()
108 if (bb != EXIT_BLOCK_PTR_FOR_FN (cfun) in verify_flow_info()
109 && bb != BASIC_BLOCK_FOR_FN (cfun, bb->index)) in verify_flow_info()
111 error ("bb %d on wrong place", bb->index); in verify_flow_info()
115 if (bb->prev_bb != last_bb_seen) in verify_flow_info()
118 bb->index, last_bb_seen->index, bb->prev_bb->index); in verify_flow_info()
122 last_bb_seen = bb; in verify_flow_info()
126 FOR_EACH_BB_REVERSE_FN (bb, cfun) in verify_flow_info()
132 if (bb->loop_father != NULL && current_loops == NULL) in verify_flow_info()
[all …]
H A Dshrink-wrap.c106 live_edge_for_reg (basic_block bb, int regno, int end_regno) in live_edge_for_reg() argument
114 FOR_EACH_EDGE (e, ei, bb->succs) in live_edge_for_reg()
153 move_insn_for_shrink_wrap (basic_block bb, rtx_insn *insn, in move_insn_for_shrink_wrap() argument
274 live_edge = live_edge_for_reg (bb, dregno, end_dregno); in move_insn_for_shrink_wrap()
283 if (EDGE_COUNT (bb->succs) == 1) in move_insn_for_shrink_wrap()
297 bitmap_and (df_get_live_in (next_block), df_get_live_out (bb), in move_insn_for_shrink_wrap()
314 FOR_BB_INSNS_REVERSE (bb, dinsn) in move_insn_for_shrink_wrap()
326 live_out = df_get_live_out (bb); in move_insn_for_shrink_wrap()
328 bb = next_block; in move_insn_for_shrink_wrap()
335 bb_uses = &DF_LR_BB_INFO (bb)->use; in move_insn_for_shrink_wrap()
[all …]
H A Dtree-cfgcleanup.c97 basic_block bb = gimple_bb (swtch); in convert_single_case_switch() local
104 generate_range_test (bb, index, low, high, &lhs, &rhs); in convert_single_case_switch()
115 edge case_edge = find_edge (bb, case_bb); in convert_single_case_switch()
116 edge default_edge = find_edge (bb, default_bb); in convert_single_case_switch()
127 cleanup_control_expr_graph (basic_block bb, gimple_stmt_iterator gsi) in cleanup_control_expr_graph() argument
133 if (!single_succ_p (bb)) in cleanup_control_expr_graph()
167 taken_edge = find_taken_edge (bb, val); in cleanup_control_expr_graph()
176 for (ei = ei_start (bb->succs); (e = ei_safe_edge (ei)); ) in cleanup_control_expr_graph()
198 taken_edge = single_succ_edge (bb); in cleanup_control_expr_graph()
200 bitmap_set_bit (cfgcleanup_altered_bbs, bb->index); in cleanup_control_expr_graph()
[all …]
H A Dprofile.c127 basic_block bb; in instrument_edges() local
129 FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR_FOR_FN (cfun), NULL, next_bb) in instrument_edges()
134 FOR_EACH_EDGE (e, ei, bb->succs) in instrument_edges()
272 basic_block bb; in get_exec_counts() local
276 FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR_FOR_FN (cfun), NULL, next_bb) in get_exec_counts()
281 FOR_EACH_EDGE (e, ei, bb->succs) in get_exec_counts()
332 basic_block bb; in correct_negative_edge_counts() local
336 FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR_FOR_FN (cfun), NULL, next_bb) in correct_negative_edge_counts()
338 FOR_EACH_EDGE (e, ei, bb->succs) in correct_negative_edge_counts()
351 basic_block bb; in is_inconsistent() local
[all …]
H A Dgimple-ssa-split-paths.c54 basic_block bb = get_immediate_dominator (CDI_DOMINATORS, latch); in find_block_to_duplicate_for_splitting_paths() local
55 gcc_assert (single_pred_edge (latch)->src == bb); in find_block_to_duplicate_for_splitting_paths()
59 if (ignore_bb_p (bb)) in find_block_to_duplicate_for_splitting_paths()
62 gimple *last = gsi_stmt (gsi_last_nondebug_bb (bb)); in find_block_to_duplicate_for_splitting_paths()
72 if (EDGE_COUNT (bb->preds) == 2 && EDGE_COUNT (bb->succs) == 2) in find_block_to_duplicate_for_splitting_paths()
76 basic_block bb_idom = get_immediate_dominator (CDI_DOMINATORS, bb); in find_block_to_duplicate_for_splitting_paths()
83 if (!(EDGE_PRED (bb, 0)->src == bb_idom in find_block_to_duplicate_for_splitting_paths()
84 || find_edge (bb_idom, EDGE_PRED (bb, 0)->src)) in find_block_to_duplicate_for_splitting_paths()
85 || !(EDGE_PRED (bb, 1)->src == bb_idom in find_block_to_duplicate_for_splitting_paths()
86 || find_edge (bb_idom, EDGE_PRED (bb, 1)->src))) in find_block_to_duplicate_for_splitting_paths()
[all …]
H A Dcfg.c99 basic_block bb; in clear_edges() local
103 FOR_EACH_BB_FN (bb, fn) in clear_edges()
105 FOR_EACH_EDGE (e, ei, bb->succs) in clear_edges()
107 vec_safe_truncate (bb->succs, 0); in clear_edges()
108 vec_safe_truncate (bb->preds, 0); in clear_edges()
124 basic_block bb; in alloc_block() local
125 bb = ggc_cleared_alloc<basic_block_def> (); in alloc_block()
126 bb->count = profile_count::uninitialized (); in alloc_block()
127 return bb; in alloc_block()
163 basic_block bb; in compact_blocks() local
[all …]
H A Dsched-rgn.c191 #define IS_RGN_ENTRY(bb) (!bb) argument
365 int rgn, bb; in debug_regions() local
378 for (bb = 0; bb < rgn_table[rgn].rgn_nr_blocks; bb++) in debug_regions()
379 fprintf (sched_dump, " %d/%d ", bb, rgn_bb_table[current_blocks + bb]); in debug_regions()
390 int bb; in debug_region() local
401 for (bb = 0; bb < rgn_table[rgn].rgn_nr_blocks; bb++) in debug_region()
402 fprintf (stderr, " %d/%d ", bb, rgn_bb_table[current_blocks + bb]); in debug_region()
406 for (bb = 0; bb < rgn_table[rgn].rgn_nr_blocks; bb++) in debug_region()
409 BASIC_BLOCK_FOR_FN (cfun, rgn_bb_table[current_blocks + bb]), in debug_region()
448 basic_block bb = BASIC_BLOCK_FOR_FN (cfun, src_bb_num); in dump_region_dot() local
[all …]
H A Dsched-ebb.c154 basic_block bb; in begin_move_insn() local
180 bb = split_edge (e); in begin_move_insn()
181 gcc_assert (NOTE_INSN_BASIC_BLOCK_P (BB_END (bb))); in begin_move_insn()
189 bb = create_basic_block (next, NULL_RTX, last_bb); in begin_move_insn()
196 current_sched_info->next_tail = NEXT_INSN (BB_END (bb)); in begin_move_insn()
200 sched_init_only_bb (bb, last_bb); in begin_move_insn()
201 gcc_assert (last_bb == bb); in begin_move_insn()
329 basic_block bb, earliest_block = NULL; in earliest_block_with_similiar_load() local
357 for (bb = last_block; bb; bb = (basic_block) bb->aux) in earliest_block_with_similiar_load()
358 if (insn2_block == bb) in earliest_block_with_similiar_load()
[all …]
H A Ddominance.c259 dom_info::get_idom (basic_block bb) in get_idom() argument
261 TBB d = m_dom[m_dfs_order[bb->index]]; in get_idom()
302 dom_info::calc_dfs_tree_nonrec (basic_block bb) in calc_dfs_tree_nonrec() argument
310 edge_iterator ei = m_reverse ? ei_start (bb->preds) in calc_dfs_tree_nonrec()
311 : ei_start (bb->succs); in calc_dfs_tree_nonrec()
340 bb = e->dest; in calc_dfs_tree_nonrec()
352 bb = e->src; in calc_dfs_tree_nonrec()
360 if (bb != m_start_block) in calc_dfs_tree_nonrec()
361 my_i = m_dfs_order[bb->index]; in calc_dfs_tree_nonrec()
559 basic_block bb = m_dfs_to_bb[v]; in calc_idoms() local
[all …]

12345678910>>...22