]>
Commit | Line | Data |
---|---|---|
402209ff | 1 | /* Control flow graph manipulation code for GNU compiler. |
7adcbafe | 2 | Copyright (C) 1987-2022 Free Software Foundation, Inc. |
402209ff JH |
3 | |
4 | This file is part of GCC. | |
5 | ||
6 | GCC is free software; you can redistribute it and/or modify it under | |
7 | the terms of the GNU General Public License as published by the Free | |
9dcd6f09 | 8 | Software Foundation; either version 3, or (at your option) any later |
402209ff JH |
9 | version. |
10 | ||
11 | GCC is distributed in the hope that it will be useful, but WITHOUT ANY | |
12 | WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
13 | FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
14 | for more details. | |
15 | ||
16 | You should have received a copy of the GNU General Public License | |
9dcd6f09 NC |
17 | along with GCC; see the file COPYING3. If not see |
18 | <http://www.gnu.org/licenses/>. */ | |
402209ff | 19 | |
9d083c8c | 20 | /* This file contains low level functions to manipulate the CFG and |
4d6922ee | 21 | analyze it. All other modules should not transform the data structure |
9d083c8c RS |
22 | directly and use abstraction instead. The file is supposed to be |
23 | ordered bottom-up and should not contain any code dependent on a | |
24 | particular intermediate language (RTL or trees). | |
402209ff JH |
25 | |
26 | Available functionality: | |
27 | - Initialization/deallocation | |
45281f12 | 28 | init_flow, free_cfg |
ca6c03ca JH |
29 | - Low level basic block manipulation |
30 | alloc_block, expunge_block | |
402209ff | 31 | - Edge manipulation |
7ded4467 | 32 | make_edge, make_single_succ_edge, cached_make_edge, remove_edge |
402209ff JH |
33 | - Low level edge redirection (without updating instruction chain) |
34 | redirect_edge_succ, redirect_edge_succ_nodup, redirect_edge_pred | |
eaec9b3d | 35 | - Dumping and debugging |
ca6c03ca JH |
36 | dump_flow_info, debug_flow_info, dump_edge_info |
37 | - Allocation of AUX fields for basic blocks | |
38 | alloc_aux_for_blocks, free_aux_for_blocks, alloc_aux_for_block | |
38c1593d | 39 | - clear_bb_flags |
10e9fecc JH |
40 | - Consistency checking |
41 | verify_flow_info | |
42 | - Dumping and debugging | |
43 | print_rtl_with_bb, dump_bb, debug_bb, debug_bb_n | |
532aafad SB |
44 | |
45 | TODO: Document these "Available functionality" functions in the files | |
46 | that implement them. | |
402209ff JH |
47 | */ |
48 | \f | |
49 | #include "config.h" | |
50 | #include "system.h" | |
4977bab6 | 51 | #include "coretypes.h" |
5d85afe9 | 52 | #include "backend.h" |
60393bbc | 53 | #include "hard-reg-set.h" |
957060b5 AM |
54 | #include "tree.h" |
55 | #include "cfghooks.h" | |
6fb5fa3c | 56 | #include "df.h" |
c7131fb2 | 57 | #include "cfganal.h" |
532aafad | 58 | #include "cfgloop.h" /* FIXME: For struct loop. */ |
7ee2468b | 59 | #include "dumpfile.h" |
402209ff | 60 | |
402209ff | 61 | \f |
33156717 | 62 | |
eaec9b3d | 63 | /* Called once at initialization time. */ |
402209ff JH |
64 | |
65 | void | |
9defb1fe | 66 | init_flow (struct function *the_fun) |
402209ff | 67 | { |
9defb1fe | 68 | if (!the_fun->cfg) |
766090c2 | 69 | the_fun->cfg = ggc_cleared_alloc<control_flow_graph> (); |
dc936fb2 | 70 | n_edges_for_fn (the_fun) = 0; |
e7a74006 | 71 | the_fun->cfg->count_max = profile_count::uninitialized (); |
fefa31b5 | 72 | ENTRY_BLOCK_PTR_FOR_FN (the_fun) |
3995f3a2 | 73 | = alloc_block (); |
fefa31b5 DM |
74 | ENTRY_BLOCK_PTR_FOR_FN (the_fun)->index = ENTRY_BLOCK; |
75 | EXIT_BLOCK_PTR_FOR_FN (the_fun) | |
3995f3a2 | 76 | = alloc_block (); |
fefa31b5 DM |
77 | EXIT_BLOCK_PTR_FOR_FN (the_fun)->index = EXIT_BLOCK; |
78 | ENTRY_BLOCK_PTR_FOR_FN (the_fun)->next_bb | |
79 | = EXIT_BLOCK_PTR_FOR_FN (the_fun); | |
80 | EXIT_BLOCK_PTR_FOR_FN (the_fun)->prev_bb | |
81 | = ENTRY_BLOCK_PTR_FOR_FN (the_fun); | |
e144a2b3 RB |
82 | the_fun->cfg->edge_flags_allocated = EDGE_ALL_FLAGS; |
83 | the_fun->cfg->bb_flags_allocated = BB_ALL_FLAGS; | |
402209ff JH |
84 | } |
85 | \f | |
45281f12 | 86 | /* Helper function for remove_edge and free_cffg. Frees edge structure |
532aafad | 87 | without actually removing it from the pred/succ arrays. */ |
d39ac0fd JH |
88 | |
89 | static void | |
61183076 | 90 | free_edge (function *fn, edge e) |
d39ac0fd | 91 | { |
61183076 | 92 | n_edges_for_fn (fn)--; |
80d8221e | 93 | ggc_free (e); |
d39ac0fd JH |
94 | } |
95 | ||
45281f12 JH |
96 | /* Free basic block BB. */ |
97 | ||
98 | static void | |
99 | free_block (basic_block bb) | |
100 | { | |
101 | vec_free (bb->succs); | |
102 | bb->succs = NULL; | |
103 | vec_free (bb->preds); | |
104 | bb->preds = NULL; | |
ae99b315 | 105 | ggc_free (bb); |
45281f12 JH |
106 | } |
107 | ||
108 | /* Free the memory associated with the CFG in FN. */ | |
402209ff JH |
109 | |
110 | void | |
45281f12 | 111 | free_cfg (struct function *fn) |
402209ff | 112 | { |
d39ac0fd | 113 | edge e; |
628f6a4e | 114 | edge_iterator ei; |
45281f12 | 115 | basic_block next; |
402209ff | 116 | |
45281f12 | 117 | for (basic_block bb = ENTRY_BLOCK_PTR_FOR_FN (fn); bb; bb = next) |
402209ff | 118 | { |
45281f12 | 119 | next = bb->next_bb; |
628f6a4e | 120 | FOR_EACH_EDGE (e, ei, bb->succs) |
61183076 | 121 | free_edge (fn, e); |
45281f12 | 122 | free_block (bb); |
d39ac0fd | 123 | } |
4891442b | 124 | |
61183076 | 125 | gcc_assert (!n_edges_for_fn (fn)); |
45281f12 JH |
126 | /* Sanity check that dominance tree is freed. */ |
127 | gcc_assert (!fn->cfg->x_dom_computed[0] && !fn->cfg->x_dom_computed[1]); | |
128 | ||
129 | vec_free (fn->cfg->x_label_to_block_map); | |
130 | vec_free (basic_block_info_for_fn (fn)); | |
131 | ggc_free (fn->cfg); | |
132 | fn->cfg = NULL; | |
402209ff JH |
133 | } |
134 | \f | |
ca6c03ca | 135 | /* Allocate memory for basic_block. */ |
402209ff | 136 | |
4262e623 | 137 | basic_block |
d329e058 | 138 | alloc_block (void) |
402209ff JH |
139 | { |
140 | basic_block bb; | |
766090c2 | 141 | bb = ggc_cleared_alloc<basic_block_def> (); |
3995f3a2 | 142 | bb->count = profile_count::uninitialized (); |
4262e623 | 143 | return bb; |
402209ff JH |
144 | } |
145 | ||
918ed612 ZD |
146 | /* Link block B to chain after AFTER. */ |
147 | void | |
d329e058 | 148 | link_block (basic_block b, basic_block after) |
918ed612 ZD |
149 | { |
150 | b->next_bb = after->next_bb; | |
151 | b->prev_bb = after; | |
152 | after->next_bb = b; | |
153 | b->next_bb->prev_bb = b; | |
154 | } | |
f87c27b4 | 155 | |
918ed612 ZD |
156 | /* Unlink block B from chain. */ |
157 | void | |
d329e058 | 158 | unlink_block (basic_block b) |
918ed612 ZD |
159 | { |
160 | b->next_bb->prev_bb = b->prev_bb; | |
161 | b->prev_bb->next_bb = b->next_bb; | |
6de9cd9a DN |
162 | b->prev_bb = NULL; |
163 | b->next_bb = NULL; | |
918ed612 | 164 | } |
f87c27b4 | 165 | |
bf77398c ZD |
166 | /* Sequentially order blocks and compact the arrays. */ |
167 | void | |
d329e058 | 168 | compact_blocks (void) |
bf77398c ZD |
169 | { |
170 | int i; | |
d329e058 | 171 | |
557c4b49 DM |
172 | SET_BASIC_BLOCK_FOR_FN (cfun, ENTRY_BLOCK, ENTRY_BLOCK_PTR_FOR_FN (cfun)); |
173 | SET_BASIC_BLOCK_FOR_FN (cfun, EXIT_BLOCK, EXIT_BLOCK_PTR_FOR_FN (cfun)); | |
b8698a0f | 174 | |
6fb5fa3c DB |
175 | if (df) |
176 | df_compact_blocks (); | |
b8698a0f | 177 | else |
bf77398c | 178 | { |
6fb5fa3c | 179 | basic_block bb; |
b8698a0f | 180 | |
6fb5fa3c | 181 | i = NUM_FIXED_BLOCKS; |
11cd3bed | 182 | FOR_EACH_BB_FN (bb, cfun) |
6fb5fa3c | 183 | { |
557c4b49 | 184 | SET_BASIC_BLOCK_FOR_FN (cfun, i, bb); |
6fb5fa3c DB |
185 | bb->index = i; |
186 | i++; | |
187 | } | |
0cae8d31 | 188 | gcc_assert (i == n_basic_blocks_for_fn (cfun)); |
6de9cd9a | 189 | |
8b1c6fd7 | 190 | for (; i < last_basic_block_for_fn (cfun); i++) |
557c4b49 | 191 | SET_BASIC_BLOCK_FOR_FN (cfun, i, NULL); |
6fb5fa3c | 192 | } |
8b1c6fd7 | 193 | last_basic_block_for_fn (cfun) = n_basic_blocks_for_fn (cfun); |
bf77398c ZD |
194 | } |
195 | ||
bf77398c | 196 | /* Remove block B from the basic block array. */ |
402209ff | 197 | |
6a58eee9 | 198 | void |
d329e058 | 199 | expunge_block (basic_block b) |
6a58eee9 | 200 | { |
918ed612 | 201 | unlink_block (b); |
557c4b49 | 202 | SET_BASIC_BLOCK_FOR_FN (cfun, b->index, NULL); |
0cae8d31 | 203 | n_basic_blocks_for_fn (cfun)--; |
ab3b6795 JH |
204 | /* We should be able to ggc_free here, but we are not. |
205 | The dead SSA_NAMES are left pointing to dead statements that are pointing | |
206 | to dead basic blocks making garbage collector to die. | |
45281f12 JH |
207 | We should be able to release all dead SSA_NAMES and at the same time we |
208 | should clear out BB pointer of dead statements consistently. */ | |
6a58eee9 | 209 | } |
402209ff | 210 | \f |
adf4a335 KH |
211 | /* Connect E to E->src. */ |
212 | ||
213 | static inline void | |
214 | connect_src (edge e) | |
215 | { | |
9771b263 | 216 | vec_safe_push (e->src->succs, e); |
6fb5fa3c | 217 | df_mark_solutions_dirty (); |
adf4a335 KH |
218 | } |
219 | ||
220 | /* Connect E to E->dest. */ | |
221 | ||
222 | static inline void | |
223 | connect_dest (edge e) | |
224 | { | |
225 | basic_block dest = e->dest; | |
9771b263 | 226 | vec_safe_push (dest->preds, e); |
adf4a335 | 227 | e->dest_idx = EDGE_COUNT (dest->preds) - 1; |
6fb5fa3c | 228 | df_mark_solutions_dirty (); |
adf4a335 KH |
229 | } |
230 | ||
231 | /* Disconnect edge E from E->src. */ | |
232 | ||
233 | static inline void | |
234 | disconnect_src (edge e) | |
235 | { | |
236 | basic_block src = e->src; | |
237 | edge_iterator ei; | |
238 | edge tmp; | |
239 | ||
240 | for (ei = ei_start (src->succs); (tmp = ei_safe_edge (ei)); ) | |
241 | { | |
242 | if (tmp == e) | |
243 | { | |
9771b263 | 244 | src->succs->unordered_remove (ei.index); |
c813039d | 245 | df_mark_solutions_dirty (); |
adf4a335 KH |
246 | return; |
247 | } | |
248 | else | |
249 | ei_next (&ei); | |
250 | } | |
251 | ||
252 | gcc_unreachable (); | |
253 | } | |
254 | ||
255 | /* Disconnect edge E from E->dest. */ | |
256 | ||
257 | static inline void | |
258 | disconnect_dest (edge e) | |
259 | { | |
260 | basic_block dest = e->dest; | |
261 | unsigned int dest_idx = e->dest_idx; | |
262 | ||
9771b263 | 263 | dest->preds->unordered_remove (dest_idx); |
adf4a335 KH |
264 | |
265 | /* If we removed an edge in the middle of the edge vector, we need | |
266 | to update dest_idx of the edge that moved into the "hole". */ | |
267 | if (dest_idx < EDGE_COUNT (dest->preds)) | |
268 | EDGE_PRED (dest, dest_idx)->dest_idx = dest_idx; | |
6fb5fa3c | 269 | df_mark_solutions_dirty (); |
adf4a335 KH |
270 | } |
271 | ||
e0fd3e7a MM |
272 | /* Create an edge connecting SRC and DEST with flags FLAGS. Return newly |
273 | created edge. Use this only if you are sure that this edge can't | |
274 | possibly already exist. */ | |
275 | ||
276 | edge | |
d329e058 | 277 | unchecked_make_edge (basic_block src, basic_block dst, int flags) |
e0fd3e7a MM |
278 | { |
279 | edge e; | |
766090c2 | 280 | e = ggc_cleared_alloc<edge_def> (); |
dc936fb2 | 281 | n_edges_for_fn (cfun)++; |
e0fd3e7a | 282 | |
357067f2 | 283 | e->probability = profile_probability::uninitialized (); |
e0fd3e7a MM |
284 | e->src = src; |
285 | e->dest = dst; | |
286 | e->flags = flags; | |
adf4a335 KH |
287 | |
288 | connect_src (e); | |
289 | connect_dest (e); | |
e0fd3e7a | 290 | |
d9d4706f | 291 | execute_on_growing_pred (e); |
e0fd3e7a MM |
292 | return e; |
293 | } | |
294 | ||
7ded4467 | 295 | /* Create an edge connecting SRC and DST with FLAGS optionally using |
2ba84f36 | 296 | edge cache CACHE. Return the new edge, NULL if already exist. */ |
4262e623 | 297 | |
7ded4467 | 298 | edge |
a6ee1a15 | 299 | cached_make_edge (sbitmap edge_cache, basic_block src, basic_block dst, int flags) |
402209ff | 300 | { |
e2c879a1 | 301 | if (edge_cache == NULL |
fefa31b5 DM |
302 | || src == ENTRY_BLOCK_PTR_FOR_FN (cfun) |
303 | || dst == EXIT_BLOCK_PTR_FOR_FN (cfun)) | |
e2c879a1 | 304 | return make_edge (src, dst, flags); |
402209ff | 305 | |
e2c879a1 | 306 | /* Does the requested edge already exist? */ |
d7c028c0 | 307 | if (! bitmap_bit_p (edge_cache, dst->index)) |
402209ff | 308 | { |
e2c879a1 KH |
309 | /* The edge does not exist. Create one and update the |
310 | cache. */ | |
d7c028c0 | 311 | bitmap_set_bit (edge_cache, dst->index); |
e2c879a1 | 312 | return unchecked_make_edge (src, dst, flags); |
402209ff | 313 | } |
d329e058 | 314 | |
e2c879a1 KH |
315 | /* At this point, we know that the requested edge exists. Adjust |
316 | flags if necessary. */ | |
317 | if (flags) | |
318 | { | |
319 | edge e = find_edge (src, dst); | |
320 | e->flags |= flags; | |
321 | } | |
7ded4467 | 322 | |
e2c879a1 | 323 | return NULL; |
7ded4467 JH |
324 | } |
325 | ||
326 | /* Create an edge connecting SRC and DEST with flags FLAGS. Return newly | |
327 | created edge or NULL if already exist. */ | |
328 | ||
329 | edge | |
d329e058 | 330 | make_edge (basic_block src, basic_block dest, int flags) |
7ded4467 | 331 | { |
e2c879a1 KH |
332 | edge e = find_edge (src, dest); |
333 | ||
334 | /* Make sure we don't add duplicate edges. */ | |
335 | if (e) | |
336 | { | |
337 | e->flags |= flags; | |
338 | return NULL; | |
339 | } | |
340 | ||
341 | return unchecked_make_edge (src, dest, flags); | |
7ded4467 JH |
342 | } |
343 | ||
eaec9b3d | 344 | /* Create an edge connecting SRC to DEST and set probability by knowing |
7ded4467 JH |
345 | that it is the single edge leaving SRC. */ |
346 | ||
347 | edge | |
d329e058 | 348 | make_single_succ_edge (basic_block src, basic_block dest, int flags) |
7ded4467 JH |
349 | { |
350 | edge e = make_edge (src, dest, flags); | |
351 | ||
357067f2 | 352 | e->probability = profile_probability::always (); |
7ded4467 | 353 | return e; |
402209ff JH |
354 | } |
355 | ||
356 | /* This function will remove an edge from the flow graph. */ | |
357 | ||
358 | void | |
452ba14d | 359 | remove_edge_raw (edge e) |
402209ff | 360 | { |
3809e990 | 361 | remove_predictions_associated_with_edge (e); |
d9d4706f KH |
362 | execute_on_shrinking_pred (e); |
363 | ||
adf4a335 KH |
364 | disconnect_src (e); |
365 | disconnect_dest (e); | |
402209ff | 366 | |
61183076 | 367 | free_edge (cfun, e); |
402209ff JH |
368 | } |
369 | ||
370 | /* Redirect an edge's successor from one block to another. */ | |
371 | ||
372 | void | |
d329e058 | 373 | redirect_edge_succ (edge e, basic_block new_succ) |
402209ff | 374 | { |
d9d4706f KH |
375 | execute_on_shrinking_pred (e); |
376 | ||
adf4a335 | 377 | disconnect_dest (e); |
628f6a4e | 378 | |
adf4a335 | 379 | e->dest = new_succ; |
402209ff JH |
380 | |
381 | /* Reconnect the edge to the new successor block. */ | |
adf4a335 KH |
382 | connect_dest (e); |
383 | ||
d9d4706f | 384 | execute_on_growing_pred (e); |
402209ff JH |
385 | } |
386 | ||
402209ff JH |
387 | /* Redirect an edge's predecessor from one block to another. */ |
388 | ||
389 | void | |
d329e058 | 390 | redirect_edge_pred (edge e, basic_block new_pred) |
402209ff | 391 | { |
adf4a335 | 392 | disconnect_src (e); |
402209ff | 393 | |
adf4a335 | 394 | e->src = new_pred; |
402209ff JH |
395 | |
396 | /* Reconnect the edge to the new predecessor block. */ | |
adf4a335 | 397 | connect_src (e); |
402209ff | 398 | } |
38c1593d | 399 | |
c4669594 | 400 | /* Clear all basic block flags that do not have to be preserved. */ |
38c1593d | 401 | void |
d329e058 | 402 | clear_bb_flags (void) |
38c1593d | 403 | { |
e0082a72 | 404 | basic_block bb; |
ca98e4c5 RB |
405 | int flags_to_preserve = BB_FLAGS_TO_PRESERVE; |
406 | if (current_loops | |
407 | && loops_state_satisfies_p (cfun, LOOPS_HAVE_MARKED_IRREDUCIBLE_REGIONS)) | |
408 | flags_to_preserve |= BB_IRREDUCIBLE_LOOP; | |
e0082a72 | 409 | |
2300c332 | 410 | FOR_ALL_BB_FN (bb, cfun) |
ca98e4c5 | 411 | bb->flags &= flags_to_preserve; |
38c1593d | 412 | } |
402209ff | 413 | \f |
878f99d2 JH |
414 | /* Check the consistency of profile information. We can't do that |
415 | in verify_flow_info, as the counts may get invalid for incompletely | |
416 | solved graphs, later eliminating of conditionals or roundoff errors. | |
417 | It is still practical to have them reported for debugging of simple | |
418 | testcases. */ | |
c4669594 | 419 | static void |
9d9573d5 | 420 | check_bb_profile (basic_block bb, FILE * file, int indent) |
878f99d2 JH |
421 | { |
422 | edge e; | |
628f6a4e | 423 | edge_iterator ei; |
2eb712b4 | 424 | struct function *fun = DECL_STRUCT_FUNCTION (current_function_decl); |
c4669594 SB |
425 | char *s_indent = (char *) alloca ((size_t) indent + 1); |
426 | memset ((void *) s_indent, ' ', (size_t) indent); | |
427 | s_indent[indent] = '\0'; | |
878f99d2 | 428 | |
ea19eb9f | 429 | if (profile_status_for_fn (fun) == PROFILE_ABSENT) |
878f99d2 JH |
430 | return; |
431 | ||
fefa31b5 | 432 | if (bb != EXIT_BLOCK_PTR_FOR_FN (fun)) |
878f99d2 | 433 | { |
46f1f3c1 | 434 | bool found = false; |
357067f2 JH |
435 | profile_probability sum = profile_probability::never (); |
436 | int isum = 0; | |
437 | ||
628f6a4e | 438 | FOR_EACH_EDGE (e, ei, bb->succs) |
46f1f3c1 | 439 | { |
357067f2 | 440 | if (!(e->flags & (EDGE_EH | EDGE_FAKE))) |
46f1f3c1 JH |
441 | found = true; |
442 | sum += e->probability; | |
357067f2 JH |
443 | if (e->probability.initialized_p ()) |
444 | isum += e->probability.to_reg_br_prob_base (); | |
46f1f3c1 JH |
445 | } |
446 | /* Only report mismatches for non-EH control flow. If there are only EH | |
447 | edges it means that the BB ends by noreturn call. Here the control | |
448 | flow may just terminate. */ | |
449 | if (found) | |
450 | { | |
357067f2 JH |
451 | if (sum.differs_from_p (profile_probability::always ())) |
452 | { | |
453 | fprintf (file, | |
454 | ";; %sInvalid sum of outgoing probabilities ", | |
455 | s_indent); | |
456 | sum.dump (file); | |
457 | fprintf (file, "\n"); | |
458 | } | |
459 | /* Probabilities caps to 100% and thus the previous test will never | |
460 | fire if the sum of probabilities is too large. */ | |
461 | else if (isum > REG_BR_PROB_BASE + 100) | |
462 | { | |
463 | fprintf (file, | |
464 | ";; %sInvalid sum of outgoing probabilities %.1f%%\n", | |
465 | s_indent, isum * 100.0 / REG_BR_PROB_BASE); | |
466 | } | |
46f1f3c1 | 467 | } |
878f99d2 | 468 | } |
357067f2 | 469 | if (bb != ENTRY_BLOCK_PTR_FOR_FN (fun)) |
878f99d2 | 470 | { |
e7a74006 | 471 | profile_count sum = profile_count::zero (); |
628f6a4e | 472 | FOR_EACH_EDGE (e, ei, bb->preds) |
e7a74006 JH |
473 | sum += e->count (); |
474 | if (sum.differs_from_p (bb->count)) | |
475 | { | |
476 | fprintf (file, ";; %sInvalid sum of incoming counts ", | |
477 | s_indent); | |
478 | sum.dump (file); | |
479 | fprintf (file, ", should be "); | |
480 | bb->count.dump (file); | |
481 | fprintf (file, "\n"); | |
482 | } | |
878f99d2 | 483 | } |
600b5b1d TJ |
484 | if (BB_PARTITION (bb) == BB_COLD_PARTITION) |
485 | { | |
486 | /* Warn about inconsistencies in the partitioning that are | |
487 | currently caused by profile insanities created via optimization. */ | |
488 | if (!probably_never_executed_bb_p (fun, bb)) | |
9d9573d5 ML |
489 | fprintf (file, ";; %sBlock in cold partition with hot count\n", |
490 | s_indent); | |
600b5b1d TJ |
491 | FOR_EACH_EDGE (e, ei, bb->preds) |
492 | { | |
493 | if (!probably_never_executed_edge_p (fun, e)) | |
494 | fprintf (file, | |
9d9573d5 ML |
495 | ";; %sBlock in cold partition with incoming hot edge\n", |
496 | s_indent); | |
600b5b1d TJ |
497 | } |
498 | } | |
878f99d2 JH |
499 | } |
500 | \f | |
402209ff | 501 | void |
1a817418 | 502 | dump_edge_info (FILE *file, edge e, dump_flags_t flags, int do_succ) |
402209ff | 503 | { |
ca6c03ca | 504 | basic_block side = (do_succ ? e->dest : e->src); |
a315c44c SB |
505 | bool do_details = false; |
506 | ||
507 | if ((flags & TDF_DETAILS) != 0 | |
508 | && (flags & TDF_SLIM) == 0) | |
509 | do_details = true; | |
510 | ||
532aafad | 511 | if (side->index == ENTRY_BLOCK) |
ca6c03ca | 512 | fputs (" ENTRY", file); |
532aafad | 513 | else if (side->index == EXIT_BLOCK) |
ca6c03ca JH |
514 | fputs (" EXIT", file); |
515 | else | |
0b17ab2f | 516 | fprintf (file, " %d", side->index); |
ca6c03ca | 517 | |
357067f2 JH |
518 | if (e->probability.initialized_p () && do_details) |
519 | { | |
520 | fprintf (file, " ["); | |
521 | e->probability.dump (file); | |
522 | fprintf (file, "] "); | |
523 | } | |
402209ff | 524 | |
ef30ab83 | 525 | if (e->count ().initialized_p () && do_details) |
402209ff | 526 | { |
edb30094 | 527 | fputs (" count:", file); |
ef30ab83 | 528 | e->count ().dump (file); |
402209ff JH |
529 | } |
530 | ||
a315c44c | 531 | if (e->flags && do_details) |
402209ff | 532 | { |
a315c44c SB |
533 | static const char * const bitnames[] = |
534 | { | |
535 | #define DEF_EDGE_FLAG(NAME,IDX) #NAME , | |
536 | #include "cfg-flags.def" | |
537 | NULL | |
538 | #undef DEF_EDGE_FLAG | |
539 | }; | |
540 | bool comma = false; | |
ca6c03ca | 541 | int i, flags = e->flags; |
402209ff | 542 | |
a315c44c | 543 | gcc_assert (e->flags <= EDGE_ALL_FLAGS); |
4891442b | 544 | fputs (" (", file); |
402209ff JH |
545 | for (i = 0; flags; i++) |
546 | if (flags & (1 << i)) | |
547 | { | |
548 | flags &= ~(1 << i); | |
549 | ||
550 | if (comma) | |
551 | fputc (',', file); | |
a315c44c SB |
552 | fputs (bitnames[i], file); |
553 | comma = true; | |
402209ff | 554 | } |
4891442b | 555 | |
402209ff JH |
556 | fputc (')', file); |
557 | } | |
558 | } | |
7b3b6ae4 LC |
559 | |
560 | DEBUG_FUNCTION void | |
561 | debug (edge_def &ref) | |
562 | { | |
6eb3cadb ML |
563 | fprintf (stderr, "<edge (%d -> %d)>\n", |
564 | ref.src->index, ref.dest->index); | |
565 | dump_edge_info (stderr, &ref, TDF_DETAILS, false); | |
566 | fprintf (stderr, "\n"); | |
7b3b6ae4 LC |
567 | } |
568 | ||
569 | DEBUG_FUNCTION void | |
570 | debug (edge_def *ptr) | |
571 | { | |
572 | if (ptr) | |
573 | debug (*ptr); | |
574 | else | |
575 | fprintf (stderr, "<nil>\n"); | |
576 | } | |
19a30b71 AH |
577 | |
578 | static void | |
579 | debug_slim (edge e) | |
580 | { | |
581 | fprintf (stderr, "<edge 0x%p (%d -> %d)>", (void *) e, | |
582 | e->src->index, e->dest->index); | |
583 | } | |
584 | ||
585 | DEFINE_DEBUG_VEC (edge) | |
586 | DEFINE_DEBUG_HASH_SET (edge) | |
402209ff | 587 | \f |
ff7cc307 | 588 | /* Simple routines to easily allocate AUX fields of basic blocks. */ |
4891442b | 589 | |
ca6c03ca JH |
590 | static struct obstack block_aux_obstack; |
591 | static void *first_block_aux_obj = 0; | |
592 | static struct obstack edge_aux_obstack; | |
593 | static void *first_edge_aux_obj = 0; | |
402209ff | 594 | |
09da1532 | 595 | /* Allocate a memory block of SIZE as BB->aux. The obstack must |
ca6c03ca | 596 | be first initialized by alloc_aux_for_blocks. */ |
402209ff | 597 | |
a398224a | 598 | static void |
d329e058 | 599 | alloc_aux_for_block (basic_block bb, int size) |
402209ff | 600 | { |
ca6c03ca | 601 | /* Verify that aux field is clear. */ |
341c100f | 602 | gcc_assert (!bb->aux && first_block_aux_obj); |
ca6c03ca JH |
603 | bb->aux = obstack_alloc (&block_aux_obstack, size); |
604 | memset (bb->aux, 0, size); | |
402209ff JH |
605 | } |
606 | ||
ca6c03ca JH |
607 | /* Initialize the block_aux_obstack and if SIZE is nonzero, call |
608 | alloc_aux_for_block for each basic block. */ | |
402209ff JH |
609 | |
610 | void | |
d329e058 | 611 | alloc_aux_for_blocks (int size) |
402209ff | 612 | { |
ca6c03ca | 613 | static int initialized; |
402209ff | 614 | |
ca6c03ca | 615 | if (!initialized) |
402209ff | 616 | { |
ca6c03ca JH |
617 | gcc_obstack_init (&block_aux_obstack); |
618 | initialized = 1; | |
402209ff | 619 | } |
341c100f NS |
620 | else |
621 | /* Check whether AUX data are still allocated. */ | |
622 | gcc_assert (!first_block_aux_obj); | |
c22cacf3 | 623 | |
703ad42b | 624 | first_block_aux_obj = obstack_alloc (&block_aux_obstack, 0); |
ca6c03ca | 625 | if (size) |
402209ff | 626 | { |
e0082a72 | 627 | basic_block bb; |
4891442b | 628 | |
04a90bec | 629 | FOR_ALL_BB_FN (bb, cfun) |
e0082a72 | 630 | alloc_aux_for_block (bb, size); |
402209ff JH |
631 | } |
632 | } | |
ca6c03ca | 633 | |
108c1afc | 634 | /* Clear AUX pointers of all blocks. */ |
402209ff JH |
635 | |
636 | void | |
d329e058 | 637 | clear_aux_for_blocks (void) |
402209ff | 638 | { |
e0082a72 | 639 | basic_block bb; |
4891442b | 640 | |
04a90bec | 641 | FOR_ALL_BB_FN (bb, cfun) |
e0082a72 | 642 | bb->aux = NULL; |
108c1afc RH |
643 | } |
644 | ||
645 | /* Free data allocated in block_aux_obstack and clear AUX pointers | |
646 | of all blocks. */ | |
647 | ||
648 | void | |
d329e058 | 649 | free_aux_for_blocks (void) |
108c1afc | 650 | { |
341c100f | 651 | gcc_assert (first_block_aux_obj); |
108c1afc | 652 | obstack_free (&block_aux_obstack, first_block_aux_obj); |
ca6c03ca | 653 | first_block_aux_obj = NULL; |
108c1afc RH |
654 | |
655 | clear_aux_for_blocks (); | |
ca6c03ca | 656 | } |
402209ff | 657 | |
039496da | 658 | /* Allocate a memory edge of SIZE as E->aux. The obstack must |
ca6c03ca | 659 | be first initialized by alloc_aux_for_edges. */ |
402209ff | 660 | |
039496da | 661 | void |
d329e058 | 662 | alloc_aux_for_edge (edge e, int size) |
ca6c03ca JH |
663 | { |
664 | /* Verify that aux field is clear. */ | |
341c100f | 665 | gcc_assert (!e->aux && first_edge_aux_obj); |
ca6c03ca JH |
666 | e->aux = obstack_alloc (&edge_aux_obstack, size); |
667 | memset (e->aux, 0, size); | |
668 | } | |
402209ff | 669 | |
ca6c03ca JH |
670 | /* Initialize the edge_aux_obstack and if SIZE is nonzero, call |
671 | alloc_aux_for_edge for each basic edge. */ | |
402209ff | 672 | |
ca6c03ca | 673 | void |
d329e058 | 674 | alloc_aux_for_edges (int size) |
ca6c03ca JH |
675 | { |
676 | static int initialized; | |
402209ff | 677 | |
ca6c03ca JH |
678 | if (!initialized) |
679 | { | |
680 | gcc_obstack_init (&edge_aux_obstack); | |
681 | initialized = 1; | |
402209ff | 682 | } |
341c100f NS |
683 | else |
684 | /* Check whether AUX data are still allocated. */ | |
685 | gcc_assert (!first_edge_aux_obj); | |
4891442b | 686 | |
703ad42b | 687 | first_edge_aux_obj = obstack_alloc (&edge_aux_obstack, 0); |
ca6c03ca | 688 | if (size) |
402209ff | 689 | { |
e0082a72 ZD |
690 | basic_block bb; |
691 | ||
fefa31b5 DM |
692 | FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR_FOR_FN (cfun), |
693 | EXIT_BLOCK_PTR_FOR_FN (cfun), next_bb) | |
402209ff | 694 | { |
ca6c03ca | 695 | edge e; |
628f6a4e | 696 | edge_iterator ei; |
ca6c03ca | 697 | |
628f6a4e | 698 | FOR_EACH_EDGE (e, ei, bb->succs) |
ca6c03ca | 699 | alloc_aux_for_edge (e, size); |
402209ff | 700 | } |
402209ff | 701 | } |
402209ff | 702 | } |
402209ff | 703 | |
108c1afc | 704 | /* Clear AUX pointers of all edges. */ |
ca6c03ca JH |
705 | |
706 | void | |
d329e058 | 707 | clear_aux_for_edges (void) |
402209ff | 708 | { |
e0082a72 ZD |
709 | basic_block bb; |
710 | edge e; | |
402209ff | 711 | |
fefa31b5 DM |
712 | FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR_FOR_FN (cfun), |
713 | EXIT_BLOCK_PTR_FOR_FN (cfun), next_bb) | |
402209ff | 714 | { |
628f6a4e BE |
715 | edge_iterator ei; |
716 | FOR_EACH_EDGE (e, ei, bb->succs) | |
ca6c03ca | 717 | e->aux = NULL; |
402209ff | 718 | } |
108c1afc RH |
719 | } |
720 | ||
721 | /* Free data allocated in edge_aux_obstack and clear AUX pointers | |
722 | of all edges. */ | |
723 | ||
724 | void | |
d329e058 | 725 | free_aux_for_edges (void) |
108c1afc | 726 | { |
341c100f | 727 | gcc_assert (first_edge_aux_obj); |
108c1afc | 728 | obstack_free (&edge_aux_obstack, first_edge_aux_obj); |
ca6c03ca | 729 | first_edge_aux_obj = NULL; |
108c1afc RH |
730 | |
731 | clear_aux_for_edges (); | |
402209ff | 732 | } |
9ee634e3 | 733 | |
24e47c76 | 734 | DEBUG_FUNCTION void |
d329e058 | 735 | debug_bb (basic_block bb) |
10e9fecc | 736 | { |
a7d153ab | 737 | debug_bb (bb, dump_flags); |
10e9fecc JH |
738 | } |
739 | ||
24e47c76 | 740 | DEBUG_FUNCTION basic_block |
d329e058 | 741 | debug_bb_n (int n) |
10e9fecc | 742 | { |
06e28de2 | 743 | basic_block bb = BASIC_BLOCK_FOR_FN (cfun, n); |
a315c44c | 744 | debug_bb (bb); |
10e9fecc | 745 | return bb; |
9ee634e3 | 746 | } |
6de9cd9a | 747 | |
a7d153ab XL |
748 | /* Print BB with specified FLAGS. */ |
749 | ||
750 | DEBUG_FUNCTION void | |
751 | debug_bb (basic_block bb, dump_flags_t flags) | |
752 | { | |
753 | dump_bb (stderr, bb, 0, flags); | |
754 | } | |
755 | ||
756 | /* Print basic block numbered N with specified FLAGS. */ | |
757 | ||
758 | DEBUG_FUNCTION basic_block | |
759 | debug_bb_n (int n, dump_flags_t flags) | |
760 | { | |
761 | basic_block bb = BASIC_BLOCK_FOR_FN (cfun, n); | |
762 | debug_bb (bb, flags); | |
763 | return bb; | |
764 | } | |
765 | ||
a315c44c SB |
766 | /* Dumps cfg related information about basic block BB to OUTF. |
767 | If HEADER is true, dump things that appear before the instructions | |
768 | contained in BB. If FOOTER is true, dump things that appear after. | |
769 | Flags are the TDF_* masks as documented in dumpfile.h. | |
770 | NB: With TDF_DETAILS, it is assumed that cfun is available, so | |
771 | that maybe_hot_bb_p and probably_never_executed_bb_p don't ICE. */ | |
6de9cd9a | 772 | |
a315c44c | 773 | void |
1a817418 | 774 | dump_bb_info (FILE *outf, basic_block bb, int indent, dump_flags_t flags, |
a315c44c | 775 | bool do_header, bool do_footer) |
6de9cd9a | 776 | { |
628f6a4e | 777 | edge_iterator ei; |
a315c44c | 778 | edge e; |
6de9cd9a DN |
779 | static const char * const bb_bitnames[] = |
780 | { | |
a315c44c SB |
781 | #define DEF_BASIC_BLOCK_FLAG(NAME,IDX) #NAME , |
782 | #include "cfg-flags.def" | |
783 | NULL | |
784 | #undef DEF_BASIC_BLOCK_FLAG | |
6de9cd9a DN |
785 | }; |
786 | const unsigned n_bitnames = sizeof (bb_bitnames) / sizeof (char *); | |
c4669594 | 787 | bool first; |
a315c44c SB |
788 | char *s_indent = (char *) alloca ((size_t) indent + 1); |
789 | memset ((void *) s_indent, ' ', (size_t) indent); | |
790 | s_indent[indent] = '\0'; | |
6de9cd9a | 791 | |
a315c44c SB |
792 | gcc_assert (bb->flags <= BB_ALL_FLAGS); |
793 | ||
794 | if (do_header) | |
795 | { | |
796 | unsigned i; | |
797 | ||
9d9573d5 | 798 | fputs (";; ", outf); |
c4669594 | 799 | fprintf (outf, "%sbasic block %d, loop depth %d", |
391886c8 | 800 | s_indent, bb->index, bb_loop_depth (bb)); |
a315c44c SB |
801 | if (flags & TDF_DETAILS) |
802 | { | |
2eb712b4 | 803 | struct function *fun = DECL_STRUCT_FUNCTION (current_function_decl); |
3995f3a2 JH |
804 | if (bb->count.initialized_p ()) |
805 | { | |
806 | fputs (", count ", outf); | |
807 | bb->count.dump (outf); | |
808 | } | |
2eb712b4 | 809 | if (maybe_hot_bb_p (fun, bb)) |
a315c44c | 810 | fputs (", maybe hot", outf); |
2eb712b4 | 811 | if (probably_never_executed_bb_p (fun, bb)) |
a315c44c SB |
812 | fputs (", probably never executed", outf); |
813 | } | |
814 | fputc ('\n', outf); | |
815 | ||
816 | if (flags & TDF_DETAILS) | |
817 | { | |
9d9573d5 ML |
818 | check_bb_profile (bb, outf, indent); |
819 | fputs (";; ", outf); | |
a315c44c SB |
820 | fprintf (outf, "%s prev block ", s_indent); |
821 | if (bb->prev_bb) | |
822 | fprintf (outf, "%d", bb->prev_bb->index); | |
823 | else | |
824 | fprintf (outf, "(nil)"); | |
825 | fprintf (outf, ", next block "); | |
826 | if (bb->next_bb) | |
827 | fprintf (outf, "%d", bb->next_bb->index); | |
828 | else | |
829 | fprintf (outf, "(nil)"); | |
830 | ||
831 | fputs (", flags:", outf); | |
c4669594 | 832 | first = true; |
a315c44c SB |
833 | for (i = 0; i < n_bitnames; i++) |
834 | if (bb->flags & (1 << i)) | |
835 | { | |
836 | if (first) | |
837 | fputs (" (", outf); | |
838 | else | |
839 | fputs (", ", outf); | |
840 | first = false; | |
841 | fputs (bb_bitnames[i], outf); | |
842 | } | |
843 | if (!first) | |
844 | fputc (')', outf); | |
c4669594 | 845 | fputc ('\n', outf); |
a315c44c | 846 | } |
a315c44c | 847 | |
9d9573d5 | 848 | fputs (";; ", outf); |
a315c44c | 849 | fprintf (outf, "%s pred: ", s_indent); |
c4669594 | 850 | first = true; |
a315c44c | 851 | FOR_EACH_EDGE (e, ei, bb->preds) |
c4669594 SB |
852 | { |
853 | if (! first) | |
854 | { | |
9d9573d5 | 855 | fputs (";; ", outf); |
c4669594 SB |
856 | fprintf (outf, "%s ", s_indent); |
857 | } | |
858 | first = false; | |
859 | dump_edge_info (outf, e, flags, 0); | |
860 | fputc ('\n', outf); | |
861 | } | |
1dd5907e SB |
862 | if (first) |
863 | fputc ('\n', outf); | |
a315c44c SB |
864 | } |
865 | ||
866 | if (do_footer) | |
867 | { | |
9d9573d5 | 868 | fputs (";; ", outf); |
a315c44c | 869 | fprintf (outf, "%s succ: ", s_indent); |
c4669594 | 870 | first = true; |
a315c44c | 871 | FOR_EACH_EDGE (e, ei, bb->succs) |
c4669594 SB |
872 | { |
873 | if (! first) | |
874 | { | |
9d9573d5 | 875 | fputs (";; ", outf); |
c4669594 SB |
876 | fprintf (outf, "%s ", s_indent); |
877 | } | |
878 | first = false; | |
879 | dump_edge_info (outf, e, flags, 1); | |
880 | fputc ('\n', outf); | |
881 | } | |
1dd5907e SB |
882 | if (first) |
883 | fputc ('\n', outf); | |
a315c44c | 884 | } |
6de9cd9a DN |
885 | } |
886 | ||
887 | /* Dumps a brief description of cfg to FILE. */ | |
888 | ||
889 | void | |
1a817418 | 890 | brief_dump_cfg (FILE *file, dump_flags_t flags) |
6de9cd9a DN |
891 | { |
892 | basic_block bb; | |
893 | ||
11cd3bed | 894 | FOR_EACH_BB_FN (bb, cfun) |
6de9cd9a | 895 | { |
9d9573d5 | 896 | dump_bb_info (file, bb, 0, flags & TDF_DETAILS, true, true); |
6de9cd9a DN |
897 | } |
898 | } | |
15db5571 | 899 | |
e7a74006 | 900 | /* An edge originally destinating BB of COUNT has been proved to |
15db5571 | 901 | leave the block by TAKEN_EDGE. Update profile of BB such that edge E can be |
c22cacf3 | 902 | redirected to destination of TAKEN_EDGE. |
15db5571 JH |
903 | |
904 | This function may leave the profile inconsistent in the case TAKEN_EDGE | |
e7a74006 | 905 | frequency or count is believed to be lower than COUNT |
d4a9b3a3 | 906 | respectively. */ |
15db5571 | 907 | void |
e7a74006 | 908 | update_bb_profile_for_threading (basic_block bb, |
3995f3a2 | 909 | profile_count count, edge taken_edge) |
15db5571 JH |
910 | { |
911 | edge c; | |
357067f2 | 912 | profile_probability prob; |
628f6a4e | 913 | edge_iterator ei; |
15db5571 | 914 | |
3995f3a2 | 915 | if (bb->count < count) |
2b151cb2 JH |
916 | { |
917 | if (dump_file) | |
918 | fprintf (dump_file, "bb %i count became negative after threading", | |
919 | bb->index); | |
2b151cb2 | 920 | } |
3995f3a2 | 921 | bb->count -= count; |
15db5571 JH |
922 | |
923 | /* Compute the probability of TAKEN_EDGE being reached via threaded edge. | |
924 | Watch for overflows. */ | |
e7a74006 JH |
925 | if (bb->count.nonzero_p ()) |
926 | prob = count.probability_in (bb->count); | |
15db5571 | 927 | else |
357067f2 | 928 | prob = profile_probability::never (); |
15db5571 JH |
929 | if (prob > taken_edge->probability) |
930 | { | |
931 | if (dump_file) | |
357067f2 JH |
932 | { |
933 | fprintf (dump_file, "Jump threading proved probability of edge " | |
934 | "%i->%i too small (it is ", | |
935 | taken_edge->src->index, taken_edge->dest->index); | |
936 | taken_edge->probability.dump (dump_file); | |
937 | fprintf (dump_file, " should be "); | |
938 | prob.dump (dump_file); | |
939 | fprintf (dump_file, ")\n"); | |
940 | } | |
941 | prob = taken_edge->probability.apply_scale (6, 8); | |
15db5571 JH |
942 | } |
943 | ||
944 | /* Now rescale the probabilities. */ | |
945 | taken_edge->probability -= prob; | |
357067f2 JH |
946 | prob = prob.invert (); |
947 | if (prob == profile_probability::never ()) | |
15db5571 JH |
948 | { |
949 | if (dump_file) | |
e7a74006 JH |
950 | fprintf (dump_file, "Edge probabilities of bb %i has been reset, " |
951 | "count of block should end up being 0, it is non-zero\n", | |
952 | bb->index); | |
357067f2 | 953 | EDGE_SUCC (bb, 0)->probability = profile_probability::guessed_always (); |
628f6a4e BE |
954 | ei = ei_start (bb->succs); |
955 | ei_next (&ei); | |
956 | for (; (c = ei_safe_edge (ei)); ei_next (&ei)) | |
357067f2 | 957 | c->probability = profile_probability::guessed_never (); |
15db5571 | 958 | } |
357067f2 | 959 | else if (!(prob == profile_probability::always ())) |
763ea904 | 960 | { |
763ea904 | 961 | FOR_EACH_EDGE (c, ei, bb->succs) |
357067f2 | 962 | c->probability /= prob; |
763ea904 | 963 | } |
15db5571 | 964 | |
41806d92 | 965 | gcc_assert (bb == taken_edge->src); |
15db5571 | 966 | } |
33156717 | 967 | |
3995f3a2 JH |
968 | /* Multiply all frequencies of basic blocks in array BBS of length NBBS |
969 | by NUM/DEN, in profile_count arithmetic. More accurate than previous | |
970 | function but considerably slower. */ | |
971 | void | |
972 | scale_bbs_frequencies_profile_count (basic_block *bbs, int nbbs, | |
973 | profile_count num, profile_count den) | |
974 | { | |
975 | int i; | |
e7a74006 JH |
976 | if (num == profile_count::zero () || den.nonzero_p ()) |
977 | for (i = 0; i < nbbs; i++) | |
3995f3a2 | 978 | bbs[i]->count = bbs[i]->count.apply_scale (num, den); |
3995f3a2 JH |
979 | } |
980 | ||
af2bbc51 JH |
981 | /* Multiply all frequencies of basic blocks in array BBS of length NBBS |
982 | by NUM/DEN, in profile_count arithmetic. More accurate than previous | |
983 | function but considerably slower. */ | |
984 | void | |
985 | scale_bbs_frequencies (basic_block *bbs, int nbbs, | |
986 | profile_probability p) | |
987 | { | |
988 | int i; | |
af2bbc51 JH |
989 | |
990 | for (i = 0; i < nbbs; i++) | |
e7a74006 | 991 | bbs[i]->count = bbs[i]->count.apply_probability (p); |
af2bbc51 JH |
992 | } |
993 | ||
703c8606 LC |
994 | /* Data structures used to maintain mapping between basic blocks and |
995 | copies. */ | |
028a4074 RB |
996 | typedef hash_map<int_hash<int, -1, -2>, int> copy_map_t; |
997 | static copy_map_t *bb_original; | |
998 | static copy_map_t *bb_copy; | |
703c8606 LC |
999 | |
1000 | /* And between loops and copies. */ | |
028a4074 | 1001 | static copy_map_t *loop_copy; |
703c8606 | 1002 | |
f341de7b KH |
1003 | /* Initialize the data structures to maintain mapping between blocks |
1004 | and its copies. */ | |
6580ee77 JH |
1005 | void |
1006 | initialize_original_copy_tables (void) | |
1007 | { | |
028a4074 RB |
1008 | bb_original = new copy_map_t (10); |
1009 | bb_copy = new copy_map_t (10); | |
1010 | loop_copy = new copy_map_t (10); | |
6580ee77 JH |
1011 | } |
1012 | ||
d96004b8 BC |
1013 | /* Reset the data structures to maintain mapping between blocks and |
1014 | its copies. */ | |
1015 | ||
1016 | void | |
1017 | reset_original_copy_tables (void) | |
1018 | { | |
d96004b8 BC |
1019 | bb_original->empty (); |
1020 | bb_copy->empty (); | |
1021 | loop_copy->empty (); | |
1022 | } | |
1023 | ||
f341de7b KH |
1024 | /* Free the data structures to maintain mapping between blocks and |
1025 | its copies. */ | |
6580ee77 JH |
1026 | void |
1027 | free_original_copy_tables (void) | |
1028 | { | |
c203e8a7 TS |
1029 | delete bb_copy; |
1030 | bb_copy = NULL; | |
1031 | delete bb_original; | |
af711c23 | 1032 | bb_original = NULL; |
c203e8a7 TS |
1033 | delete loop_copy; |
1034 | loop_copy = NULL; | |
6580ee77 JH |
1035 | } |
1036 | ||
c2e84327 DM |
1037 | /* Return true iff we have had a call to initialize_original_copy_tables |
1038 | without a corresponding call to free_original_copy_tables. */ | |
1039 | ||
1040 | bool | |
1041 | original_copy_tables_initialized_p (void) | |
1042 | { | |
028a4074 | 1043 | return bb_copy != NULL; |
c2e84327 DM |
1044 | } |
1045 | ||
561e8a90 ZD |
1046 | /* Removes the value associated with OBJ from table TAB. */ |
1047 | ||
1048 | static void | |
028a4074 | 1049 | copy_original_table_clear (copy_map_t *tab, unsigned obj) |
561e8a90 | 1050 | { |
028a4074 | 1051 | if (!original_copy_tables_initialized_p ()) |
561e8a90 ZD |
1052 | return; |
1053 | ||
028a4074 | 1054 | tab->remove (obj); |
561e8a90 ZD |
1055 | } |
1056 | ||
1057 | /* Sets the value associated with OBJ in table TAB to VAL. | |
1058 | Do nothing when data structures are not initialized. */ | |
1059 | ||
1060 | static void | |
028a4074 | 1061 | copy_original_table_set (copy_map_t *tab, |
703c8606 | 1062 | unsigned obj, unsigned val) |
561e8a90 | 1063 | { |
028a4074 | 1064 | if (!original_copy_tables_initialized_p ()) |
561e8a90 ZD |
1065 | return; |
1066 | ||
028a4074 | 1067 | tab->put (obj, val); |
561e8a90 ZD |
1068 | } |
1069 | ||
f341de7b KH |
1070 | /* Set original for basic block. Do nothing when data structures are not |
1071 | initialized so passes not needing this don't need to care. */ | |
6580ee77 JH |
1072 | void |
1073 | set_bb_original (basic_block bb, basic_block original) | |
1074 | { | |
561e8a90 | 1075 | copy_original_table_set (bb_original, bb->index, original->index); |
6580ee77 JH |
1076 | } |
1077 | ||
1078 | /* Get the original basic block. */ | |
1079 | basic_block | |
1080 | get_bb_original (basic_block bb) | |
1081 | { | |
028a4074 | 1082 | gcc_assert (original_copy_tables_initialized_p ()); |
6580ee77 | 1083 | |
028a4074 | 1084 | int *entry = bb_original->get (bb->index); |
6580ee77 | 1085 | if (entry) |
028a4074 | 1086 | return BASIC_BLOCK_FOR_FN (cfun, *entry); |
6580ee77 JH |
1087 | else |
1088 | return NULL; | |
1089 | } | |
1090 | ||
f341de7b KH |
1091 | /* Set copy for basic block. Do nothing when data structures are not |
1092 | initialized so passes not needing this don't need to care. */ | |
6580ee77 JH |
1093 | void |
1094 | set_bb_copy (basic_block bb, basic_block copy) | |
1095 | { | |
561e8a90 | 1096 | copy_original_table_set (bb_copy, bb->index, copy->index); |
6580ee77 JH |
1097 | } |
1098 | ||
1099 | /* Get the copy of basic block. */ | |
1100 | basic_block | |
1101 | get_bb_copy (basic_block bb) | |
1102 | { | |
028a4074 | 1103 | gcc_assert (original_copy_tables_initialized_p ()); |
6580ee77 | 1104 | |
028a4074 | 1105 | int *entry = bb_copy->get (bb->index); |
6580ee77 | 1106 | if (entry) |
028a4074 | 1107 | return BASIC_BLOCK_FOR_FN (cfun, *entry); |
6580ee77 JH |
1108 | else |
1109 | return NULL; | |
1110 | } | |
561e8a90 ZD |
1111 | |
1112 | /* Set copy for LOOP to COPY. Do nothing when data structures are not | |
1113 | initialized so passes not needing this don't need to care. */ | |
1114 | ||
1115 | void | |
99b1c316 | 1116 | set_loop_copy (class loop *loop, class loop *copy) |
561e8a90 ZD |
1117 | { |
1118 | if (!copy) | |
1119 | copy_original_table_clear (loop_copy, loop->num); | |
1120 | else | |
1121 | copy_original_table_set (loop_copy, loop->num, copy->num); | |
1122 | } | |
1123 | ||
1124 | /* Get the copy of LOOP. */ | |
1125 | ||
99b1c316 MS |
1126 | class loop * |
1127 | get_loop_copy (class loop *loop) | |
561e8a90 | 1128 | { |
028a4074 | 1129 | gcc_assert (original_copy_tables_initialized_p ()); |
561e8a90 | 1130 | |
028a4074 | 1131 | int *entry = loop_copy->get (loop->num); |
561e8a90 | 1132 | if (entry) |
028a4074 | 1133 | return get_loop (cfun, *entry); |
561e8a90 ZD |
1134 | else |
1135 | return NULL; | |
1136 | } |