Home
last modified time | relevance | path

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

12345678910>>...63

/netbsd-src/external/gpl3/gcc/dist/gcc/
H A Dtracer.cc71 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()
91 cache_can_duplicate_bb_p (const_basic_block bb, bool val) in cache_can_duplicate_bb_p() argument
94 bitmap_set_bit (can_duplicate_bb, bb->index); in cache_can_duplicate_bb_p()
99 cached_can_duplicate_bb_p (const_basic_block bb) in cached_can_duplicate_bb_p() argument
104 if ((unsigned int)bb->index < size) in cached_can_duplicate_bb_p()
105 return bitmap_bit_p (can_duplicate_bb, bb->index); in cached_can_duplicate_bb_p()
[all …]
H A Dcfgrtl.cc102 static bool rtl_bb_info_initialized_p (basic_block bb);
150 basic_block bb = BLOCK_FOR_INSN (insn); in delete_insn() local
162 && bb != NULL in delete_insn()
163 && bb == BLOCK_FOR_INSN (bb_note)) in delete_insn()
166 BB_HEAD (bb) = bb_note; in delete_insn()
167 if (BB_END (bb) == bb_note) in delete_insn()
168 BB_END (bb) = insn; in delete_insn()
240 basic_block bb = BLOCK_FOR_INSN (insn); in delete_insn_and_edges() local
241 if (BB_END (bb) == insn) in delete_insn_and_edges()
243 else if (DEBUG_INSN_P (BB_END (bb))) in delete_insn_and_edges()
[all …]
H A Dcfgbuild.cc202 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 Dshrink-wrap.cc106 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 Dcfghooks.cc106 basic_block bb, last_bb_seen; in verify_flow_info() local
115 FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR_FOR_FN (cfun)->next_bb, NULL, next_bb) in verify_flow_info()
117 if (bb != EXIT_BLOCK_PTR_FOR_FN (cfun) in verify_flow_info()
118 && bb != BASIC_BLOCK_FOR_FN (cfun, bb->index)) in verify_flow_info()
120 error ("bb %d on wrong place", bb->index); in verify_flow_info()
124 if (bb->prev_bb != last_bb_seen) in verify_flow_info()
127 bb->index, last_bb_seen->index, bb->prev_bb->index); in verify_flow_info()
131 last_bb_seen = bb; in verify_flow_info()
135 FOR_EACH_BB_REVERSE_FN (bb, cfun) in verify_flow_info()
141 if (bb->loop_father != NULL && current_loops == NULL) in verify_flow_info()
[all …]
H A Dgimple-range-cache.cc62 non_null_ref::set_nonnull (basic_block bb, tree name) in set_nonnull() argument
67 if (non_null_deref_p (name, bb, false)) in set_nonnull()
69 bitmap_set_bit (m_nn[SSA_NAME_VERSION (name)], bb->index); in set_nonnull()
78 non_null_ref::non_null_deref_p (tree name, basic_block bb, bool search_dom) in non_null_deref_p() argument
90 if (bitmap_bit_p (m_nn[v], bb->index)) in non_null_deref_p()
102 bb && bb != def_dom; in non_null_deref_p()
103 bb = get_immediate_dominator (CDI_DOMINATORS, bb)) in non_null_deref_p()
104 if (bitmap_bit_p (m_nn[v], bb->index)) in non_null_deref_p()
161 virtual bool set_bb_range (const_basic_block bb, const irange &r) = 0;
162 virtual bool get_bb_range (irange &r, const_basic_block bb) = 0;
[all …]
H A Dcfg.cc99 free_block (basic_block bb) in free_block() argument
101 vec_free (bb->succs); in free_block()
102 bb->succs = NULL; in free_block()
103 vec_free (bb->preds); in free_block()
104 bb->preds = NULL; in free_block()
105 ggc_free (bb); in free_block()
117 for (basic_block bb = ENTRY_BLOCK_PTR_FOR_FN (fn); bb; bb = next) in free_cfg() local
119 next = bb->next_bb; in free_cfg()
120 FOR_EACH_EDGE (e, ei, bb->succs) in free_cfg()
122 free_block (bb); in free_cfg()
[all …]
H A Dgimple-ssa-split-paths.cc54 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()
73 if (EDGE_COUNT (bb->preds) == 2 in find_block_to_duplicate_for_splitting_paths()
74 && !(EDGE_PRED (bb, 0)->flags & EDGE_COMPLEX) in find_block_to_duplicate_for_splitting_paths()
75 && !(EDGE_PRED (bb, 1)->flags & EDGE_COMPLEX) in find_block_to_duplicate_for_splitting_paths()
76 && EDGE_COUNT (bb->succs) == 2 in find_block_to_duplicate_for_splitting_paths()
77 && !(EDGE_SUCC (bb, 0)->flags & EDGE_COMPLEX) in find_block_to_duplicate_for_splitting_paths()
78 && !(EDGE_SUCC (bb, 1)->flags & EDGE_COMPLEX)) in find_block_to_duplicate_for_splitting_paths()
[all …]
H A Dprofile.cc117 basic_block bb; in instrument_edges() local
119 FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR_FOR_FN (cfun), NULL, next_bb) in instrument_edges()
124 FOR_EACH_EDGE (e, ei, bb->succs) in instrument_edges()
207 basic_block bb; in get_exec_counts() local
211 FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR_FOR_FN (cfun), NULL, next_bb) in get_exec_counts()
216 FOR_EACH_EDGE (e, ei, bb->succs) in get_exec_counts()
260 basic_block bb; in correct_negative_edge_counts() local
264 FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR_FOR_FN (cfun), NULL, next_bb) in correct_negative_edge_counts()
266 FOR_EACH_EDGE (e, ei, bb->succs) in correct_negative_edge_counts()
279 basic_block bb; in is_inconsistent() local
[all …]
H A Dtree-cfgcleanup.cc97 basic_block bb = gimple_bb (swtch); in convert_single_case_switch() local
106 generate_range_test (bb, index, low, high, &lhs, &rhs); in convert_single_case_switch()
117 edge case_edge = find_edge (bb, case_bb); in convert_single_case_switch()
118 edge default_edge = find_edge (bb, default_bb); in convert_single_case_switch()
129 cleanup_control_expr_graph (basic_block bb, gimple_stmt_iterator gsi) in cleanup_control_expr_graph() argument
135 if (!single_succ_p (bb)) in cleanup_control_expr_graph()
168 taken_edge = find_taken_edge (bb, val); in cleanup_control_expr_graph()
177 for (ei = ei_start (bb->succs); (e = ei_safe_edge (ei)); ) in cleanup_control_expr_graph()
199 taken_edge = single_succ_edge (bb); in cleanup_control_expr_graph()
201 bitmap_set_bit (cfgcleanup_altered_bbs, bb->index); in cleanup_control_expr_graph()
[all …]
H A Dsched-rgn.cc197 #define IS_RGN_ENTRY(bb) (!bb) argument
371 int rgn, bb; in debug_regions() local
384 for (bb = 0; bb < rgn_table[rgn].rgn_nr_blocks; bb++) in debug_regions()
385 fprintf (sched_dump, " %d/%d ", bb, rgn_bb_table[current_blocks + bb]); in debug_regions()
396 int bb; in debug_region() local
407 for (bb = 0; bb < rgn_table[rgn].rgn_nr_blocks; bb++) in debug_region()
408 fprintf (stderr, " %d/%d ", bb, rgn_bb_table[current_blocks + bb]); in debug_region()
412 for (bb = 0; bb < rgn_table[rgn].rgn_nr_blocks; bb++) in debug_region()
415 BASIC_BLOCK_FOR_FN (cfun, rgn_bb_table[current_blocks + bb]), in debug_region()
454 basic_block bb = BASIC_BLOCK_FOR_FN (cfun, src_bb_num); in dump_region_dot() local
[all …]
H A Dsched-ebb.cc153 basic_block bb; in begin_move_insn() local
179 bb = split_edge (e); in begin_move_insn()
180 gcc_assert (NOTE_INSN_BASIC_BLOCK_P (BB_END (bb))); in begin_move_insn()
188 bb = create_basic_block (next, NULL_RTX, last_bb); in begin_move_insn()
195 current_sched_info->next_tail = NEXT_INSN (BB_END (bb)); in begin_move_insn()
199 sched_init_only_bb (bb, last_bb); in begin_move_insn()
200 gcc_assert (last_bb == bb); in begin_move_insn()
328 basic_block bb, earliest_block = NULL; in earliest_block_with_similiar_load() local
356 for (bb = last_block; bb; bb = (basic_block) bb->aux) in earliest_block_with_similiar_load()
357 if (insn2_block == bb) in earliest_block_with_similiar_load()
[all …]
/netbsd-src/external/gpl3/gcc.old/dist/gcc/
H A Dcfgrtl.c145 basic_block bb = BLOCK_FOR_INSN (insn); in delete_insn() local
157 && bb != NULL in delete_insn()
158 && bb == BLOCK_FOR_INSN (bb_note)) in delete_insn()
161 BB_HEAD (bb) = bb_note; in delete_insn()
162 if (BB_END (bb) == bb_note) in delete_insn()
163 BB_END (bb) = insn; in delete_insn()
235 basic_block bb = BLOCK_FOR_INSN (insn); in delete_insn_and_edges() local
236 if (BB_END (bb) == insn) in delete_insn_and_edges()
238 else if (DEBUG_INSN_P (BB_END (bb))) in delete_insn_and_edges()
241 if (BB_END (bb) == dinsn) in delete_insn_and_edges()
[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 Dshrink-wrap.c105 live_edge_for_reg (basic_block bb, int regno, int end_regno) in live_edge_for_reg() argument
113 FOR_EACH_EDGE (e, ei, bb->succs) in live_edge_for_reg()
152 move_insn_for_shrink_wrap (basic_block bb, rtx_insn *insn, in move_insn_for_shrink_wrap() argument
273 live_edge = live_edge_for_reg (bb, dregno, end_dregno); in move_insn_for_shrink_wrap()
282 if (EDGE_COUNT (bb->succs) == 1) in move_insn_for_shrink_wrap()
296 bitmap_and (df_get_live_in (next_block), df_get_live_out (bb), in move_insn_for_shrink_wrap()
313 FOR_BB_INSNS_REVERSE (bb, dinsn) in move_insn_for_shrink_wrap()
325 live_out = df_get_live_out (bb); in move_insn_for_shrink_wrap()
327 bb = next_block; in move_insn_for_shrink_wrap()
334 bb_uses = &DF_LR_BB_INFO (bb)->use; in move_insn_for_shrink_wrap()
[all …]
H A Dcfghooks.c103 basic_block bb, last_bb_seen; in verify_flow_info() local
112 FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR_FOR_FN (cfun)->next_bb, NULL, next_bb) in verify_flow_info()
114 if (bb != EXIT_BLOCK_PTR_FOR_FN (cfun) in verify_flow_info()
115 && bb != BASIC_BLOCK_FOR_FN (cfun, bb->index)) in verify_flow_info()
117 error ("bb %d on wrong place", bb->index); in verify_flow_info()
121 if (bb->prev_bb != last_bb_seen) in verify_flow_info()
124 bb->index, last_bb_seen->index, bb->prev_bb->index); in verify_flow_info()
128 last_bb_seen = bb; in verify_flow_info()
132 FOR_EACH_BB_REVERSE_FN (bb, cfun) in verify_flow_info()
138 if (bb->loop_father != NULL && current_loops == NULL) in verify_flow_info()
[all …]
H A Dprofile.c115 basic_block bb; in instrument_edges() local
117 FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR_FOR_FN (cfun), NULL, next_bb) in instrument_edges()
122 FOR_EACH_EDGE (e, ei, bb->succs) in instrument_edges()
205 basic_block bb; in get_exec_counts() local
209 FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR_FOR_FN (cfun), NULL, next_bb) in get_exec_counts()
214 FOR_EACH_EDGE (e, ei, bb->succs) in get_exec_counts()
258 basic_block bb; in correct_negative_edge_counts() local
262 FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR_FOR_FN (cfun), NULL, next_bb) in correct_negative_edge_counts()
264 FOR_EACH_EDGE (e, ei, bb->succs) in correct_negative_edge_counts()
277 basic_block bb; in is_inconsistent() local
[all …]
H A Dgimple-ssa-split-paths.c53 basic_block bb = get_immediate_dominator (CDI_DOMINATORS, latch); in find_block_to_duplicate_for_splitting_paths() local
54 gcc_assert (single_pred_edge (latch)->src == bb); in find_block_to_duplicate_for_splitting_paths()
58 if (ignore_bb_p (bb)) in find_block_to_duplicate_for_splitting_paths()
61 gimple *last = gsi_stmt (gsi_last_nondebug_bb (bb)); in find_block_to_duplicate_for_splitting_paths()
72 if (EDGE_COUNT (bb->preds) == 2 in find_block_to_duplicate_for_splitting_paths()
73 && !(EDGE_PRED (bb, 0)->flags & EDGE_COMPLEX) in find_block_to_duplicate_for_splitting_paths()
74 && !(EDGE_PRED (bb, 1)->flags & EDGE_COMPLEX) in find_block_to_duplicate_for_splitting_paths()
75 && EDGE_COUNT (bb->succs) == 2 in find_block_to_duplicate_for_splitting_paths()
76 && !(EDGE_SUCC (bb, 0)->flags & EDGE_COMPLEX) in find_block_to_duplicate_for_splitting_paths()
77 && !(EDGE_SUCC (bb, 1)->flags & EDGE_COMPLEX)) in find_block_to_duplicate_for_splitting_paths()
[all …]
H A Dtree-cfgcleanup.c97 basic_block bb = gimple_bb (swtch); in convert_single_case_switch() local
106 generate_range_test (bb, index, low, high, &lhs, &rhs); in convert_single_case_switch()
117 edge case_edge = find_edge (bb, case_bb); in convert_single_case_switch()
118 edge default_edge = find_edge (bb, default_bb); in convert_single_case_switch()
129 cleanup_control_expr_graph (basic_block bb, gimple_stmt_iterator gsi) in cleanup_control_expr_graph() argument
135 if (!single_succ_p (bb)) in cleanup_control_expr_graph()
168 taken_edge = find_taken_edge (bb, val); in cleanup_control_expr_graph()
177 for (ei = ei_start (bb->succs); (e = ei_safe_edge (ei)); ) in cleanup_control_expr_graph()
199 taken_edge = single_succ_edge (bb); in cleanup_control_expr_graph()
201 bitmap_set_bit (cfgcleanup_altered_bbs, bb->index); in cleanup_control_expr_graph()
[all …]
H A Dcfg.c101 basic_block bb; in clear_edges() local
105 FOR_EACH_BB_FN (bb, fn) in clear_edges()
107 FOR_EACH_EDGE (e, ei, bb->succs) in clear_edges()
109 vec_safe_truncate (bb->succs, 0); in clear_edges()
110 vec_safe_truncate (bb->preds, 0); in clear_edges()
126 basic_block bb; in alloc_block() local
127 bb = ggc_cleared_alloc<basic_block_def> (); in alloc_block()
128 bb->count = profile_count::uninitialized (); in alloc_block()
129 return bb; in alloc_block()
165 basic_block bb; in compact_blocks() local
[all …]
H A Dsched-rgn.c197 #define IS_RGN_ENTRY(bb) (!bb) argument
371 int rgn, bb; in debug_regions() local
384 for (bb = 0; bb < rgn_table[rgn].rgn_nr_blocks; bb++) in debug_regions()
385 fprintf (sched_dump, " %d/%d ", bb, rgn_bb_table[current_blocks + bb]); in debug_regions()
396 int bb; in debug_region() local
407 for (bb = 0; bb < rgn_table[rgn].rgn_nr_blocks; bb++) in debug_region()
408 fprintf (stderr, " %d/%d ", bb, rgn_bb_table[current_blocks + bb]); in debug_region()
412 for (bb = 0; bb < rgn_table[rgn].rgn_nr_blocks; bb++) in debug_region()
415 BASIC_BLOCK_FOR_FN (cfun, rgn_bb_table[current_blocks + bb]), in debug_region()
454 basic_block bb = BASIC_BLOCK_FOR_FN (cfun, src_bb_num); in dump_region_dot() local
[all …]
H A Dsched-ebb.c153 basic_block bb; in begin_move_insn() local
179 bb = split_edge (e); in begin_move_insn()
180 gcc_assert (NOTE_INSN_BASIC_BLOCK_P (BB_END (bb))); in begin_move_insn()
188 bb = create_basic_block (next, NULL_RTX, last_bb); in begin_move_insn()
195 current_sched_info->next_tail = NEXT_INSN (BB_END (bb)); in begin_move_insn()
199 sched_init_only_bb (bb, last_bb); in begin_move_insn()
200 gcc_assert (last_bb == bb); in begin_move_insn()
328 basic_block bb, earliest_block = NULL; in earliest_block_with_similiar_load() local
356 for (bb = last_block; bb; bb = (basic_block) bb->aux) in earliest_block_with_similiar_load()
357 if (insn2_block == bb) in earliest_block_with_similiar_load()
[all …]
/netbsd-src/usr.sbin/installboot/arch/
H A Dalpha.c115 static void resum(ib_params *, struct alpha_boot_block * const bb,
136 struct alpha_boot_block bb; in alpha_clearboot() local
150 rv = pread(params->fsfd, &bb, sizeof(bb), ALPHA_BOOT_BLOCK_OFFSET); in alpha_clearboot()
154 } else if (rv != sizeof(bb)) { in alpha_clearboot()
158 ALPHA_BOOT_BLOCK_CKSUM(&bb, &cksum); in alpha_clearboot()
159 if (cksum != bb.bb_cksum) { // XXX check bb_cksum endian? in alpha_clearboot()
162 (unsigned long long)le64toh(bb.bb_cksum), in alpha_clearboot()
170 (unsigned long long)le64toh(bb.bb_secstart)); in alpha_clearboot()
172 (unsigned long long)le64toh(bb.bb_secsize)); in alpha_clearboot()
174 (unsigned long long)le64toh(bb.bb_cksum)); in alpha_clearboot()
[all …]
/netbsd-src/external/bsd/pcc/dist/pcc/mip/
H A Doptim2.c47 #define CHADD(bb,c) { if (bb->ch[0] == 0) bb->ch[0] = c; \ argument
48 else if (bb->ch[1] == 0) bb->ch[1] = c; \
68 void cfg_dfs(struct basicblock *bb, unsigned int parent,
713 struct basicblock *bb = NULL; in bblocks_build() local
729 if (bb == NULL || (ip->type == IP_EPILOG) || in bblocks_build()
731 bb = tmpalloc(sizeof(struct basicblock)); in bblocks_build()
732 bb->first = ip; in bblocks_build()
733 SLIST_INIT(&bb->parents); in bblocks_build()
734 SLIST_INIT(&bb->child); in bblocks_build()
735 bb->dfnum = 0; in bblocks_build()
[all …]

12345678910>>...63