]>
Commit | Line | Data |
---|---|---|
402209ff | 1 | /* Control flow graph manipulation code for GNU compiler. |
aeee4812 | 2 | Copyright (C) 1987-2023 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); | |
d6c1d7c4 | 478 | sum.dump (file, fun); |
e7a74006 | 479 | fprintf (file, ", should be "); |
d6c1d7c4 | 480 | bb->count.dump (file, fun); |
e7a74006 JH |
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); |
d6c1d7c4 | 528 | e->count ().dump (file, cfun); |
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 | } | |
58394373 JJ |
558 | |
559 | if (do_details && LOCATION_LOCUS (e->goto_locus) > BUILTINS_LOCATION) | |
560 | fprintf (file, " %s:%d:%d", LOCATION_FILE (e->goto_locus), | |
561 | LOCATION_LINE (e->goto_locus), LOCATION_COLUMN (e->goto_locus)); | |
402209ff | 562 | } |
7b3b6ae4 LC |
563 | |
564 | DEBUG_FUNCTION void | |
565 | debug (edge_def &ref) | |
566 | { | |
6eb3cadb ML |
567 | fprintf (stderr, "<edge (%d -> %d)>\n", |
568 | ref.src->index, ref.dest->index); | |
569 | dump_edge_info (stderr, &ref, TDF_DETAILS, false); | |
570 | fprintf (stderr, "\n"); | |
7b3b6ae4 LC |
571 | } |
572 | ||
573 | DEBUG_FUNCTION void | |
574 | debug (edge_def *ptr) | |
575 | { | |
576 | if (ptr) | |
577 | debug (*ptr); | |
578 | else | |
579 | fprintf (stderr, "<nil>\n"); | |
580 | } | |
19a30b71 AH |
581 | |
582 | static void | |
583 | debug_slim (edge e) | |
584 | { | |
585 | fprintf (stderr, "<edge 0x%p (%d -> %d)>", (void *) e, | |
586 | e->src->index, e->dest->index); | |
587 | } | |
588 | ||
589 | DEFINE_DEBUG_VEC (edge) | |
590 | DEFINE_DEBUG_HASH_SET (edge) | |
402209ff | 591 | \f |
ff7cc307 | 592 | /* Simple routines to easily allocate AUX fields of basic blocks. */ |
4891442b | 593 | |
ca6c03ca JH |
594 | static struct obstack block_aux_obstack; |
595 | static void *first_block_aux_obj = 0; | |
596 | static struct obstack edge_aux_obstack; | |
597 | static void *first_edge_aux_obj = 0; | |
402209ff | 598 | |
09da1532 | 599 | /* Allocate a memory block of SIZE as BB->aux. The obstack must |
ca6c03ca | 600 | be first initialized by alloc_aux_for_blocks. */ |
402209ff | 601 | |
a398224a | 602 | static void |
d329e058 | 603 | alloc_aux_for_block (basic_block bb, int size) |
402209ff | 604 | { |
ca6c03ca | 605 | /* Verify that aux field is clear. */ |
341c100f | 606 | gcc_assert (!bb->aux && first_block_aux_obj); |
ca6c03ca JH |
607 | bb->aux = obstack_alloc (&block_aux_obstack, size); |
608 | memset (bb->aux, 0, size); | |
402209ff JH |
609 | } |
610 | ||
ca6c03ca JH |
611 | /* Initialize the block_aux_obstack and if SIZE is nonzero, call |
612 | alloc_aux_for_block for each basic block. */ | |
402209ff JH |
613 | |
614 | void | |
d329e058 | 615 | alloc_aux_for_blocks (int size) |
402209ff | 616 | { |
ca6c03ca | 617 | static int initialized; |
402209ff | 618 | |
ca6c03ca | 619 | if (!initialized) |
402209ff | 620 | { |
ca6c03ca JH |
621 | gcc_obstack_init (&block_aux_obstack); |
622 | initialized = 1; | |
402209ff | 623 | } |
341c100f NS |
624 | else |
625 | /* Check whether AUX data are still allocated. */ | |
626 | gcc_assert (!first_block_aux_obj); | |
c22cacf3 | 627 | |
703ad42b | 628 | first_block_aux_obj = obstack_alloc (&block_aux_obstack, 0); |
ca6c03ca | 629 | if (size) |
402209ff | 630 | { |
e0082a72 | 631 | basic_block bb; |
4891442b | 632 | |
04a90bec | 633 | FOR_ALL_BB_FN (bb, cfun) |
e0082a72 | 634 | alloc_aux_for_block (bb, size); |
402209ff JH |
635 | } |
636 | } | |
ca6c03ca | 637 | |
108c1afc | 638 | /* Clear AUX pointers of all blocks. */ |
402209ff JH |
639 | |
640 | void | |
d329e058 | 641 | clear_aux_for_blocks (void) |
402209ff | 642 | { |
e0082a72 | 643 | basic_block bb; |
4891442b | 644 | |
04a90bec | 645 | FOR_ALL_BB_FN (bb, cfun) |
e0082a72 | 646 | bb->aux = NULL; |
108c1afc RH |
647 | } |
648 | ||
649 | /* Free data allocated in block_aux_obstack and clear AUX pointers | |
650 | of all blocks. */ | |
651 | ||
652 | void | |
d329e058 | 653 | free_aux_for_blocks (void) |
108c1afc | 654 | { |
341c100f | 655 | gcc_assert (first_block_aux_obj); |
108c1afc | 656 | obstack_free (&block_aux_obstack, first_block_aux_obj); |
ca6c03ca | 657 | first_block_aux_obj = NULL; |
108c1afc RH |
658 | |
659 | clear_aux_for_blocks (); | |
ca6c03ca | 660 | } |
402209ff | 661 | |
039496da | 662 | /* Allocate a memory edge of SIZE as E->aux. The obstack must |
ca6c03ca | 663 | be first initialized by alloc_aux_for_edges. */ |
402209ff | 664 | |
039496da | 665 | void |
d329e058 | 666 | alloc_aux_for_edge (edge e, int size) |
ca6c03ca JH |
667 | { |
668 | /* Verify that aux field is clear. */ | |
341c100f | 669 | gcc_assert (!e->aux && first_edge_aux_obj); |
ca6c03ca JH |
670 | e->aux = obstack_alloc (&edge_aux_obstack, size); |
671 | memset (e->aux, 0, size); | |
672 | } | |
402209ff | 673 | |
ca6c03ca JH |
674 | /* Initialize the edge_aux_obstack and if SIZE is nonzero, call |
675 | alloc_aux_for_edge for each basic edge. */ | |
402209ff | 676 | |
ca6c03ca | 677 | void |
d329e058 | 678 | alloc_aux_for_edges (int size) |
ca6c03ca JH |
679 | { |
680 | static int initialized; | |
402209ff | 681 | |
ca6c03ca JH |
682 | if (!initialized) |
683 | { | |
684 | gcc_obstack_init (&edge_aux_obstack); | |
685 | initialized = 1; | |
402209ff | 686 | } |
341c100f NS |
687 | else |
688 | /* Check whether AUX data are still allocated. */ | |
689 | gcc_assert (!first_edge_aux_obj); | |
4891442b | 690 | |
703ad42b | 691 | first_edge_aux_obj = obstack_alloc (&edge_aux_obstack, 0); |
ca6c03ca | 692 | if (size) |
402209ff | 693 | { |
e0082a72 ZD |
694 | basic_block bb; |
695 | ||
fefa31b5 DM |
696 | FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR_FOR_FN (cfun), |
697 | EXIT_BLOCK_PTR_FOR_FN (cfun), next_bb) | |
402209ff | 698 | { |
ca6c03ca | 699 | edge e; |
628f6a4e | 700 | edge_iterator ei; |
ca6c03ca | 701 | |
628f6a4e | 702 | FOR_EACH_EDGE (e, ei, bb->succs) |
ca6c03ca | 703 | alloc_aux_for_edge (e, size); |
402209ff | 704 | } |
402209ff | 705 | } |
402209ff | 706 | } |
402209ff | 707 | |
108c1afc | 708 | /* Clear AUX pointers of all edges. */ |
ca6c03ca JH |
709 | |
710 | void | |
d329e058 | 711 | clear_aux_for_edges (void) |
402209ff | 712 | { |
e0082a72 ZD |
713 | basic_block bb; |
714 | edge e; | |
402209ff | 715 | |
fefa31b5 DM |
716 | FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR_FOR_FN (cfun), |
717 | EXIT_BLOCK_PTR_FOR_FN (cfun), next_bb) | |
402209ff | 718 | { |
628f6a4e BE |
719 | edge_iterator ei; |
720 | FOR_EACH_EDGE (e, ei, bb->succs) | |
ca6c03ca | 721 | e->aux = NULL; |
402209ff | 722 | } |
108c1afc RH |
723 | } |
724 | ||
725 | /* Free data allocated in edge_aux_obstack and clear AUX pointers | |
726 | of all edges. */ | |
727 | ||
728 | void | |
d329e058 | 729 | free_aux_for_edges (void) |
108c1afc | 730 | { |
341c100f | 731 | gcc_assert (first_edge_aux_obj); |
108c1afc | 732 | obstack_free (&edge_aux_obstack, first_edge_aux_obj); |
ca6c03ca | 733 | first_edge_aux_obj = NULL; |
108c1afc RH |
734 | |
735 | clear_aux_for_edges (); | |
402209ff | 736 | } |
9ee634e3 | 737 | |
24e47c76 | 738 | DEBUG_FUNCTION void |
d329e058 | 739 | debug_bb (basic_block bb) |
10e9fecc | 740 | { |
a7d153ab | 741 | debug_bb (bb, dump_flags); |
10e9fecc JH |
742 | } |
743 | ||
24e47c76 | 744 | DEBUG_FUNCTION basic_block |
d329e058 | 745 | debug_bb_n (int n) |
10e9fecc | 746 | { |
06e28de2 | 747 | basic_block bb = BASIC_BLOCK_FOR_FN (cfun, n); |
a315c44c | 748 | debug_bb (bb); |
10e9fecc | 749 | return bb; |
9ee634e3 | 750 | } |
6de9cd9a | 751 | |
a7d153ab XL |
752 | /* Print BB with specified FLAGS. */ |
753 | ||
754 | DEBUG_FUNCTION void | |
755 | debug_bb (basic_block bb, dump_flags_t flags) | |
756 | { | |
757 | dump_bb (stderr, bb, 0, flags); | |
758 | } | |
759 | ||
760 | /* Print basic block numbered N with specified FLAGS. */ | |
761 | ||
762 | DEBUG_FUNCTION basic_block | |
763 | debug_bb_n (int n, dump_flags_t flags) | |
764 | { | |
765 | basic_block bb = BASIC_BLOCK_FOR_FN (cfun, n); | |
766 | debug_bb (bb, flags); | |
767 | return bb; | |
768 | } | |
769 | ||
a315c44c SB |
770 | /* Dumps cfg related information about basic block BB to OUTF. |
771 | If HEADER is true, dump things that appear before the instructions | |
772 | contained in BB. If FOOTER is true, dump things that appear after. | |
773 | Flags are the TDF_* masks as documented in dumpfile.h. | |
774 | NB: With TDF_DETAILS, it is assumed that cfun is available, so | |
775 | that maybe_hot_bb_p and probably_never_executed_bb_p don't ICE. */ | |
6de9cd9a | 776 | |
a315c44c | 777 | void |
1a817418 | 778 | dump_bb_info (FILE *outf, basic_block bb, int indent, dump_flags_t flags, |
a315c44c | 779 | bool do_header, bool do_footer) |
6de9cd9a | 780 | { |
628f6a4e | 781 | edge_iterator ei; |
a315c44c | 782 | edge e; |
6de9cd9a DN |
783 | static const char * const bb_bitnames[] = |
784 | { | |
a315c44c SB |
785 | #define DEF_BASIC_BLOCK_FLAG(NAME,IDX) #NAME , |
786 | #include "cfg-flags.def" | |
787 | NULL | |
788 | #undef DEF_BASIC_BLOCK_FLAG | |
6de9cd9a | 789 | }; |
ca32b29e | 790 | const unsigned n_bitnames = ARRAY_SIZE (bb_bitnames); |
c4669594 | 791 | bool first; |
a315c44c SB |
792 | char *s_indent = (char *) alloca ((size_t) indent + 1); |
793 | memset ((void *) s_indent, ' ', (size_t) indent); | |
794 | s_indent[indent] = '\0'; | |
6de9cd9a | 795 | |
a315c44c SB |
796 | gcc_assert (bb->flags <= BB_ALL_FLAGS); |
797 | ||
798 | if (do_header) | |
799 | { | |
800 | unsigned i; | |
801 | ||
9d9573d5 | 802 | fputs (";; ", outf); |
c4669594 | 803 | fprintf (outf, "%sbasic block %d, loop depth %d", |
391886c8 | 804 | s_indent, bb->index, bb_loop_depth (bb)); |
a315c44c SB |
805 | if (flags & TDF_DETAILS) |
806 | { | |
2eb712b4 | 807 | struct function *fun = DECL_STRUCT_FUNCTION (current_function_decl); |
3995f3a2 JH |
808 | if (bb->count.initialized_p ()) |
809 | { | |
810 | fputs (", count ", outf); | |
d6c1d7c4 | 811 | bb->count.dump (outf, cfun); |
3995f3a2 | 812 | } |
2eb712b4 | 813 | if (maybe_hot_bb_p (fun, bb)) |
a315c44c | 814 | fputs (", maybe hot", outf); |
2eb712b4 | 815 | if (probably_never_executed_bb_p (fun, bb)) |
a315c44c SB |
816 | fputs (", probably never executed", outf); |
817 | } | |
818 | fputc ('\n', outf); | |
819 | ||
820 | if (flags & TDF_DETAILS) | |
821 | { | |
9d9573d5 ML |
822 | check_bb_profile (bb, outf, indent); |
823 | fputs (";; ", outf); | |
a315c44c SB |
824 | fprintf (outf, "%s prev block ", s_indent); |
825 | if (bb->prev_bb) | |
826 | fprintf (outf, "%d", bb->prev_bb->index); | |
827 | else | |
828 | fprintf (outf, "(nil)"); | |
829 | fprintf (outf, ", next block "); | |
830 | if (bb->next_bb) | |
831 | fprintf (outf, "%d", bb->next_bb->index); | |
832 | else | |
833 | fprintf (outf, "(nil)"); | |
834 | ||
835 | fputs (", flags:", outf); | |
c4669594 | 836 | first = true; |
a315c44c SB |
837 | for (i = 0; i < n_bitnames; i++) |
838 | if (bb->flags & (1 << i)) | |
839 | { | |
840 | if (first) | |
841 | fputs (" (", outf); | |
842 | else | |
843 | fputs (", ", outf); | |
844 | first = false; | |
845 | fputs (bb_bitnames[i], outf); | |
846 | } | |
847 | if (!first) | |
848 | fputc (')', outf); | |
c4669594 | 849 | fputc ('\n', outf); |
a315c44c | 850 | } |
a315c44c | 851 | |
9d9573d5 | 852 | fputs (";; ", outf); |
a315c44c | 853 | fprintf (outf, "%s pred: ", s_indent); |
c4669594 | 854 | first = true; |
a315c44c | 855 | FOR_EACH_EDGE (e, ei, bb->preds) |
c4669594 SB |
856 | { |
857 | if (! first) | |
858 | { | |
9d9573d5 | 859 | fputs (";; ", outf); |
c4669594 SB |
860 | fprintf (outf, "%s ", s_indent); |
861 | } | |
862 | first = false; | |
863 | dump_edge_info (outf, e, flags, 0); | |
864 | fputc ('\n', outf); | |
865 | } | |
1dd5907e SB |
866 | if (first) |
867 | fputc ('\n', outf); | |
a315c44c SB |
868 | } |
869 | ||
870 | if (do_footer) | |
871 | { | |
9d9573d5 | 872 | fputs (";; ", outf); |
a315c44c | 873 | fprintf (outf, "%s succ: ", s_indent); |
c4669594 | 874 | first = true; |
a315c44c | 875 | FOR_EACH_EDGE (e, ei, bb->succs) |
c4669594 SB |
876 | { |
877 | if (! first) | |
878 | { | |
9d9573d5 | 879 | fputs (";; ", outf); |
c4669594 SB |
880 | fprintf (outf, "%s ", s_indent); |
881 | } | |
882 | first = false; | |
883 | dump_edge_info (outf, e, flags, 1); | |
884 | fputc ('\n', outf); | |
885 | } | |
1dd5907e SB |
886 | if (first) |
887 | fputc ('\n', outf); | |
a315c44c | 888 | } |
6de9cd9a DN |
889 | } |
890 | ||
891 | /* Dumps a brief description of cfg to FILE. */ | |
892 | ||
893 | void | |
1a817418 | 894 | brief_dump_cfg (FILE *file, dump_flags_t flags) |
6de9cd9a DN |
895 | { |
896 | basic_block bb; | |
897 | ||
11cd3bed | 898 | FOR_EACH_BB_FN (bb, cfun) |
6de9cd9a | 899 | { |
9d9573d5 | 900 | dump_bb_info (file, bb, 0, flags & TDF_DETAILS, true, true); |
6de9cd9a DN |
901 | } |
902 | } | |
15db5571 | 903 | |
2e406f07 JH |
904 | /* Set probability of E to NEW_PROB and rescale other edges |
905 | from E->src so their sum remains the same. */ | |
906 | ||
907 | void | |
908 | set_edge_probability_and_rescale_others (edge e, profile_probability new_prob) | |
909 | { | |
910 | edge e2; | |
911 | edge_iterator ei; | |
912 | if (e->probability == new_prob) | |
913 | return; | |
914 | /* If we made E unconditional, drop other frequencies to 0. */ | |
915 | if (new_prob == profile_probability::always ()) | |
916 | { | |
917 | FOR_EACH_EDGE (e2, ei, e->src->succs) | |
918 | if (e2 != e) | |
919 | e2->probability = profile_probability::never (); | |
920 | } | |
921 | else | |
922 | { | |
923 | int n = 0; | |
924 | edge other_e = NULL; | |
925 | ||
926 | /* See how many other edges are leaving exit_edge->src. */ | |
927 | FOR_EACH_EDGE (e2, ei, e->src->succs) | |
928 | if (e2 != e && !(e2->flags & EDGE_FAKE)) | |
929 | { | |
930 | other_e = e2; | |
931 | n++; | |
932 | } | |
933 | /* If there is only one other edge with non-zero probability we do not | |
934 | need to scale which drops quality of profile from precise | |
935 | to adjusted. */ | |
936 | if (n == 1) | |
937 | other_e->probability = new_prob.invert (); | |
938 | /* Nothing to do if there are no other edges. */ | |
939 | else if (!n) | |
940 | ; | |
941 | /* Do scaling if possible. */ | |
942 | else if (e->probability.invert ().nonzero_p ()) | |
943 | { | |
944 | profile_probability num = new_prob.invert (), | |
945 | den = e->probability.invert (); | |
946 | FOR_EACH_EDGE (e2, ei, e->src->succs) | |
947 | if (e2 != e && !(e2->flags & EDGE_FAKE)) | |
948 | e2->probability = e2->probability.apply_scale (num, den); | |
949 | } | |
950 | else | |
951 | { | |
952 | if (dump_file && (dump_flags & TDF_DETAILS)) | |
953 | fprintf (dump_file, | |
954 | ";; probability of edge %i->%i set reduced from 1." | |
955 | " The remaining edges are left inconsistent.\n", | |
956 | e->src->index, e->dest->index); | |
957 | FOR_EACH_EDGE (e2, ei, e->src->succs) | |
958 | if (e2 != e && !(e2->flags & EDGE_FAKE)) | |
959 | e2->probability = new_prob.invert ().guessed () / n; | |
960 | } | |
961 | } | |
962 | e->probability = new_prob; | |
963 | } | |
964 | ||
e7a74006 | 965 | /* An edge originally destinating BB of COUNT has been proved to |
15db5571 | 966 | leave the block by TAKEN_EDGE. Update profile of BB such that edge E can be |
c22cacf3 | 967 | redirected to destination of TAKEN_EDGE. |
15db5571 JH |
968 | |
969 | This function may leave the profile inconsistent in the case TAKEN_EDGE | |
e7a74006 | 970 | frequency or count is believed to be lower than COUNT |
d4a9b3a3 | 971 | respectively. */ |
15db5571 | 972 | void |
e7a74006 | 973 | update_bb_profile_for_threading (basic_block bb, |
3995f3a2 | 974 | profile_count count, edge taken_edge) |
15db5571 | 975 | { |
2e406f07 JH |
976 | gcc_assert (bb == taken_edge->src); |
977 | ||
978 | /* If there is no profile or the threaded path is never executed | |
979 | we don't need to upate. */ | |
980 | if (!bb->count.initialized_p () | |
981 | || count == profile_count::zero ()) | |
982 | return; | |
15db5571 | 983 | |
3995f3a2 | 984 | if (bb->count < count) |
2b151cb2 JH |
985 | { |
986 | if (dump_file) | |
987 | fprintf (dump_file, "bb %i count became negative after threading", | |
988 | bb->index); | |
2e406f07 JH |
989 | /* If probabilities looks very off, scale down and reduce to guesses |
990 | to avoid dropping the other path close to zero. */ | |
991 | if (bb->count < count.apply_scale (7, 8)) | |
992 | count = bb->count.apply_scale (1, 2).guessed (); | |
2b151cb2 | 993 | } |
15db5571 | 994 | |
2e406f07 JH |
995 | /* If bb->count will become zero, the probabilities on the original path |
996 | are not really known, but it is probably better to keep original ones | |
997 | then try to invent something new. */ | |
998 | if (!(bb->count <= count)) | |
15db5571 | 999 | { |
2e406f07 JH |
1000 | profile_probability prob; |
1001 | /* Compute the probability of TAKEN_EDGE being reached via threaded edge. | |
1002 | Watch for overflows. */ | |
1003 | if (bb->count.nonzero_p ()) | |
1004 | prob = count.probability_in (bb->count); | |
1005 | else | |
1006 | prob = taken_edge->probability.apply_scale (1, 2).guessed (); | |
1007 | if (prob > taken_edge->probability) | |
357067f2 | 1008 | { |
2e406f07 JH |
1009 | if (dump_file) |
1010 | { | |
1011 | fprintf (dump_file, "Jump threading proved that the probability " | |
1012 | "of edge %i->%i was originally estimated too small. " | |
1013 | "(it is ", | |
1014 | taken_edge->src->index, taken_edge->dest->index); | |
1015 | taken_edge->probability.dump (dump_file); | |
1016 | fprintf (dump_file, " should be "); | |
1017 | prob.dump (dump_file); | |
1018 | fprintf (dump_file, ")\n"); | |
1019 | } | |
1020 | prob = taken_edge->probability.apply_scale (6, 8).guessed (); | |
357067f2 | 1021 | } |
2e406f07 JH |
1022 | set_edge_probability_and_rescale_others (taken_edge, |
1023 | (taken_edge->probability - prob) | |
1024 | / prob.invert ()); | |
15db5571 | 1025 | } |
02460c0b | 1026 | bb->count -= count; |
15db5571 | 1027 | } |
33156717 | 1028 | |
3995f3a2 JH |
1029 | /* Multiply all frequencies of basic blocks in array BBS of length NBBS |
1030 | by NUM/DEN, in profile_count arithmetic. More accurate than previous | |
1031 | function but considerably slower. */ | |
1032 | void | |
1033 | scale_bbs_frequencies_profile_count (basic_block *bbs, int nbbs, | |
1034 | profile_count num, profile_count den) | |
1035 | { | |
1036 | int i; | |
e7a74006 JH |
1037 | if (num == profile_count::zero () || den.nonzero_p ()) |
1038 | for (i = 0; i < nbbs; i++) | |
3995f3a2 | 1039 | bbs[i]->count = bbs[i]->count.apply_scale (num, den); |
3995f3a2 JH |
1040 | } |
1041 | ||
af2bbc51 JH |
1042 | /* Multiply all frequencies of basic blocks in array BBS of length NBBS |
1043 | by NUM/DEN, in profile_count arithmetic. More accurate than previous | |
1044 | function but considerably slower. */ | |
1045 | void | |
1046 | scale_bbs_frequencies (basic_block *bbs, int nbbs, | |
1047 | profile_probability p) | |
1048 | { | |
1049 | int i; | |
af2bbc51 JH |
1050 | |
1051 | for (i = 0; i < nbbs; i++) | |
e7a74006 | 1052 | bbs[i]->count = bbs[i]->count.apply_probability (p); |
af2bbc51 JH |
1053 | } |
1054 | ||
703c8606 LC |
1055 | /* Data structures used to maintain mapping between basic blocks and |
1056 | copies. */ | |
028a4074 RB |
1057 | typedef hash_map<int_hash<int, -1, -2>, int> copy_map_t; |
1058 | static copy_map_t *bb_original; | |
1059 | static copy_map_t *bb_copy; | |
703c8606 LC |
1060 | |
1061 | /* And between loops and copies. */ | |
028a4074 | 1062 | static copy_map_t *loop_copy; |
703c8606 | 1063 | |
f341de7b KH |
1064 | /* Initialize the data structures to maintain mapping between blocks |
1065 | and its copies. */ | |
6580ee77 JH |
1066 | void |
1067 | initialize_original_copy_tables (void) | |
1068 | { | |
028a4074 RB |
1069 | bb_original = new copy_map_t (10); |
1070 | bb_copy = new copy_map_t (10); | |
1071 | loop_copy = new copy_map_t (10); | |
6580ee77 JH |
1072 | } |
1073 | ||
d96004b8 BC |
1074 | /* Reset the data structures to maintain mapping between blocks and |
1075 | its copies. */ | |
1076 | ||
1077 | void | |
1078 | reset_original_copy_tables (void) | |
1079 | { | |
d96004b8 BC |
1080 | bb_original->empty (); |
1081 | bb_copy->empty (); | |
1082 | loop_copy->empty (); | |
1083 | } | |
1084 | ||
f341de7b KH |
1085 | /* Free the data structures to maintain mapping between blocks and |
1086 | its copies. */ | |
6580ee77 JH |
1087 | void |
1088 | free_original_copy_tables (void) | |
1089 | { | |
c203e8a7 TS |
1090 | delete bb_copy; |
1091 | bb_copy = NULL; | |
1092 | delete bb_original; | |
af711c23 | 1093 | bb_original = NULL; |
c203e8a7 TS |
1094 | delete loop_copy; |
1095 | loop_copy = NULL; | |
6580ee77 JH |
1096 | } |
1097 | ||
c2e84327 DM |
1098 | /* Return true iff we have had a call to initialize_original_copy_tables |
1099 | without a corresponding call to free_original_copy_tables. */ | |
1100 | ||
1101 | bool | |
1102 | original_copy_tables_initialized_p (void) | |
1103 | { | |
028a4074 | 1104 | return bb_copy != NULL; |
c2e84327 DM |
1105 | } |
1106 | ||
561e8a90 ZD |
1107 | /* Removes the value associated with OBJ from table TAB. */ |
1108 | ||
1109 | static void | |
028a4074 | 1110 | copy_original_table_clear (copy_map_t *tab, unsigned obj) |
561e8a90 | 1111 | { |
028a4074 | 1112 | if (!original_copy_tables_initialized_p ()) |
561e8a90 ZD |
1113 | return; |
1114 | ||
028a4074 | 1115 | tab->remove (obj); |
561e8a90 ZD |
1116 | } |
1117 | ||
1118 | /* Sets the value associated with OBJ in table TAB to VAL. | |
1119 | Do nothing when data structures are not initialized. */ | |
1120 | ||
1121 | static void | |
028a4074 | 1122 | copy_original_table_set (copy_map_t *tab, |
703c8606 | 1123 | unsigned obj, unsigned val) |
561e8a90 | 1124 | { |
028a4074 | 1125 | if (!original_copy_tables_initialized_p ()) |
561e8a90 ZD |
1126 | return; |
1127 | ||
028a4074 | 1128 | tab->put (obj, val); |
561e8a90 ZD |
1129 | } |
1130 | ||
f341de7b KH |
1131 | /* Set original for basic block. Do nothing when data structures are not |
1132 | initialized so passes not needing this don't need to care. */ | |
6580ee77 JH |
1133 | void |
1134 | set_bb_original (basic_block bb, basic_block original) | |
1135 | { | |
561e8a90 | 1136 | copy_original_table_set (bb_original, bb->index, original->index); |
6580ee77 JH |
1137 | } |
1138 | ||
1139 | /* Get the original basic block. */ | |
1140 | basic_block | |
1141 | get_bb_original (basic_block bb) | |
1142 | { | |
028a4074 | 1143 | gcc_assert (original_copy_tables_initialized_p ()); |
6580ee77 | 1144 | |
028a4074 | 1145 | int *entry = bb_original->get (bb->index); |
6580ee77 | 1146 | if (entry) |
028a4074 | 1147 | return BASIC_BLOCK_FOR_FN (cfun, *entry); |
6580ee77 JH |
1148 | else |
1149 | return NULL; | |
1150 | } | |
1151 | ||
f341de7b KH |
1152 | /* Set copy for basic block. Do nothing when data structures are not |
1153 | initialized so passes not needing this don't need to care. */ | |
6580ee77 JH |
1154 | void |
1155 | set_bb_copy (basic_block bb, basic_block copy) | |
1156 | { | |
561e8a90 | 1157 | copy_original_table_set (bb_copy, bb->index, copy->index); |
6580ee77 JH |
1158 | } |
1159 | ||
1160 | /* Get the copy of basic block. */ | |
1161 | basic_block | |
1162 | get_bb_copy (basic_block bb) | |
1163 | { | |
028a4074 | 1164 | gcc_assert (original_copy_tables_initialized_p ()); |
6580ee77 | 1165 | |
028a4074 | 1166 | int *entry = bb_copy->get (bb->index); |
6580ee77 | 1167 | if (entry) |
028a4074 | 1168 | return BASIC_BLOCK_FOR_FN (cfun, *entry); |
6580ee77 JH |
1169 | else |
1170 | return NULL; | |
1171 | } | |
561e8a90 ZD |
1172 | |
1173 | /* Set copy for LOOP to COPY. Do nothing when data structures are not | |
1174 | initialized so passes not needing this don't need to care. */ | |
1175 | ||
1176 | void | |
99b1c316 | 1177 | set_loop_copy (class loop *loop, class loop *copy) |
561e8a90 ZD |
1178 | { |
1179 | if (!copy) | |
1180 | copy_original_table_clear (loop_copy, loop->num); | |
1181 | else | |
1182 | copy_original_table_set (loop_copy, loop->num, copy->num); | |
1183 | } | |
1184 | ||
1185 | /* Get the copy of LOOP. */ | |
1186 | ||
99b1c316 MS |
1187 | class loop * |
1188 | get_loop_copy (class loop *loop) | |
561e8a90 | 1189 | { |
028a4074 | 1190 | gcc_assert (original_copy_tables_initialized_p ()); |
561e8a90 | 1191 | |
028a4074 | 1192 | int *entry = loop_copy->get (loop->num); |
561e8a90 | 1193 | if (entry) |
028a4074 | 1194 | return get_loop (cfun, *entry); |
561e8a90 ZD |
1195 | else |
1196 | return NULL; | |
1197 | } |