]>
Commit | Line | Data |
---|---|---|
65f34de5 | 1 | /* Control flow graph manipulation code for GNU compiler. |
711789cc | 2 | Copyright (C) 1987-2013 Free Software Foundation, Inc. |
65f34de5 | 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 | |
8c4c00c1 | 8 | Software Foundation; either version 3, or (at your option) any later |
65f34de5 | 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 | |
8c4c00c1 | 17 | along with GCC; see the file COPYING3. If not see |
18 | <http://www.gnu.org/licenses/>. */ | |
65f34de5 | 19 | |
9b21b64d | 20 | /* This file contains low level functions to manipulate the CFG and |
917bbcab | 21 | analyze it. All other modules should not transform the data structure |
9b21b64d | 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). | |
65f34de5 | 25 | |
26 | Available functionality: | |
27 | - Initialization/deallocation | |
28 | init_flow, clear_edges | |
b36d64df | 29 | - Low level basic block manipulation |
30 | alloc_block, expunge_block | |
65f34de5 | 31 | - Edge manipulation |
7392df29 | 32 | make_edge, make_single_succ_edge, cached_make_edge, remove_edge |
65f34de5 | 33 | - Low level edge redirection (without updating instruction chain) |
34 | redirect_edge_succ, redirect_edge_succ_nodup, redirect_edge_pred | |
4a82352a | 35 | - Dumping and debugging |
b36d64df | 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 | |
308f9b79 | 39 | - clear_bb_flags |
028f8cc7 | 40 | - Consistency checking |
41 | verify_flow_info | |
42 | - Dumping and debugging | |
43 | print_rtl_with_bb, dump_bb, debug_bb, debug_bb_n | |
4a020a8c | 44 | |
45 | TODO: Document these "Available functionality" functions in the files | |
46 | that implement them. | |
65f34de5 | 47 | */ |
48 | \f | |
49 | #include "config.h" | |
50 | #include "system.h" | |
805e22b2 | 51 | #include "coretypes.h" |
7a22afab | 52 | #include "obstack.h" |
4ee9c684 | 53 | #include "ggc.h" |
d1455aa3 | 54 | #include "hash-table.h" |
01020a5f | 55 | #include "alloc-pool.h" |
8d672d12 | 56 | #include "tree.h" |
4a020a8c | 57 | #include "basic-block.h" |
3072d30e | 58 | #include "df.h" |
4a020a8c | 59 | #include "cfgloop.h" /* FIXME: For struct loop. */ |
b9ed1410 | 60 | #include "dumpfile.h" |
65f34de5 | 61 | |
65f34de5 | 62 | \f |
4d6b11ab | 63 | #define RDIV(X,Y) (((X) + (Y) / 2) / (Y)) |
64 | ||
4a82352a | 65 | /* Called once at initialization time. */ |
65f34de5 | 66 | |
67 | void | |
c27baad4 | 68 | init_flow (struct function *the_fun) |
65f34de5 | 69 | { |
c27baad4 | 70 | if (!the_fun->cfg) |
ba72912a | 71 | the_fun->cfg = ggc_alloc_cleared_control_flow_graph (); |
f1955b22 | 72 | n_edges_for_fn (the_fun) = 0; |
34154e27 | 73 | ENTRY_BLOCK_PTR_FOR_FN (the_fun) |
ba72912a | 74 | = ggc_alloc_cleared_basic_block_def (); |
34154e27 | 75 | ENTRY_BLOCK_PTR_FOR_FN (the_fun)->index = ENTRY_BLOCK; |
76 | EXIT_BLOCK_PTR_FOR_FN (the_fun) | |
ba72912a | 77 | = ggc_alloc_cleared_basic_block_def (); |
34154e27 | 78 | EXIT_BLOCK_PTR_FOR_FN (the_fun)->index = EXIT_BLOCK; |
79 | ENTRY_BLOCK_PTR_FOR_FN (the_fun)->next_bb | |
80 | = EXIT_BLOCK_PTR_FOR_FN (the_fun); | |
81 | EXIT_BLOCK_PTR_FOR_FN (the_fun)->prev_bb | |
82 | = ENTRY_BLOCK_PTR_FOR_FN (the_fun); | |
65f34de5 | 83 | } |
84 | \f | |
2fb0fd15 | 85 | /* Helper function for remove_edge and clear_edges. Frees edge structure |
4a020a8c | 86 | without actually removing it from the pred/succ arrays. */ |
2fb0fd15 | 87 | |
88 | static void | |
4a020a8c | 89 | free_edge (edge e) |
2fb0fd15 | 90 | { |
f1955b22 | 91 | n_edges_for_fn (cfun)--; |
ac6db781 | 92 | ggc_free (e); |
2fb0fd15 | 93 | } |
94 | ||
65f34de5 | 95 | /* Free the memory associated with the edge structures. */ |
96 | ||
97 | void | |
4c9e08a4 | 98 | clear_edges (void) |
65f34de5 | 99 | { |
4c26117a | 100 | basic_block bb; |
2fb0fd15 | 101 | edge e; |
cd665a06 | 102 | edge_iterator ei; |
65f34de5 | 103 | |
fc00614f | 104 | FOR_EACH_BB_FN (bb, cfun) |
65f34de5 | 105 | { |
cd665a06 | 106 | FOR_EACH_EDGE (e, ei, bb->succs) |
107 | free_edge (e); | |
f1f41a6c | 108 | vec_safe_truncate (bb->succs, 0); |
109 | vec_safe_truncate (bb->preds, 0); | |
2fb0fd15 | 110 | } |
e4fc8aad | 111 | |
34154e27 | 112 | FOR_EACH_EDGE (e, ei, ENTRY_BLOCK_PTR_FOR_FN (cfun)->succs) |
cd665a06 | 113 | free_edge (e); |
34154e27 | 114 | vec_safe_truncate (EXIT_BLOCK_PTR_FOR_FN (cfun)->preds, 0); |
115 | vec_safe_truncate (ENTRY_BLOCK_PTR_FOR_FN (cfun)->succs, 0); | |
65f34de5 | 116 | |
f1955b22 | 117 | gcc_assert (!n_edges_for_fn (cfun)); |
65f34de5 | 118 | } |
119 | \f | |
b36d64df | 120 | /* Allocate memory for basic_block. */ |
65f34de5 | 121 | |
e76f35e8 | 122 | basic_block |
4c9e08a4 | 123 | alloc_block (void) |
65f34de5 | 124 | { |
125 | basic_block bb; | |
ba72912a | 126 | bb = ggc_alloc_cleared_basic_block_def (); |
e76f35e8 | 127 | return bb; |
65f34de5 | 128 | } |
129 | ||
7fa55aef | 130 | /* Link block B to chain after AFTER. */ |
131 | void | |
4c9e08a4 | 132 | link_block (basic_block b, basic_block after) |
7fa55aef | 133 | { |
134 | b->next_bb = after->next_bb; | |
135 | b->prev_bb = after; | |
136 | after->next_bb = b; | |
137 | b->next_bb->prev_bb = b; | |
138 | } | |
db34a109 | 139 | |
7fa55aef | 140 | /* Unlink block B from chain. */ |
141 | void | |
4c9e08a4 | 142 | unlink_block (basic_block b) |
7fa55aef | 143 | { |
144 | b->next_bb->prev_bb = b->prev_bb; | |
145 | b->prev_bb->next_bb = b->next_bb; | |
4ee9c684 | 146 | b->prev_bb = NULL; |
147 | b->next_bb = NULL; | |
7fa55aef | 148 | } |
db34a109 | 149 | |
3c0a32c9 | 150 | /* Sequentially order blocks and compact the arrays. */ |
151 | void | |
4c9e08a4 | 152 | compact_blocks (void) |
3c0a32c9 | 153 | { |
154 | int i; | |
4c9e08a4 | 155 | |
f64d2ca4 | 156 | SET_BASIC_BLOCK_FOR_FN (cfun, ENTRY_BLOCK, ENTRY_BLOCK_PTR_FOR_FN (cfun)); |
157 | SET_BASIC_BLOCK_FOR_FN (cfun, EXIT_BLOCK, EXIT_BLOCK_PTR_FOR_FN (cfun)); | |
48e1416a | 158 | |
3072d30e | 159 | if (df) |
160 | df_compact_blocks (); | |
48e1416a | 161 | else |
3c0a32c9 | 162 | { |
3072d30e | 163 | basic_block bb; |
48e1416a | 164 | |
3072d30e | 165 | i = NUM_FIXED_BLOCKS; |
fc00614f | 166 | FOR_EACH_BB_FN (bb, cfun) |
3072d30e | 167 | { |
f64d2ca4 | 168 | SET_BASIC_BLOCK_FOR_FN (cfun, i, bb); |
3072d30e | 169 | bb->index = i; |
170 | i++; | |
171 | } | |
a28770e1 | 172 | gcc_assert (i == n_basic_blocks_for_fn (cfun)); |
4ee9c684 | 173 | |
fe672ac0 | 174 | for (; i < last_basic_block_for_fn (cfun); i++) |
f64d2ca4 | 175 | SET_BASIC_BLOCK_FOR_FN (cfun, i, NULL); |
3072d30e | 176 | } |
fe672ac0 | 177 | last_basic_block_for_fn (cfun) = n_basic_blocks_for_fn (cfun); |
3c0a32c9 | 178 | } |
179 | ||
3c0a32c9 | 180 | /* Remove block B from the basic block array. */ |
65f34de5 | 181 | |
8f8dcce4 | 182 | void |
4c9e08a4 | 183 | expunge_block (basic_block b) |
8f8dcce4 | 184 | { |
7fa55aef | 185 | unlink_block (b); |
f64d2ca4 | 186 | SET_BASIC_BLOCK_FOR_FN (cfun, b->index, NULL); |
a28770e1 | 187 | n_basic_blocks_for_fn (cfun)--; |
937f771b | 188 | /* We should be able to ggc_free here, but we are not. |
189 | The dead SSA_NAMES are left pointing to dead statements that are pointing | |
190 | to dead basic blocks making garbage collector to die. | |
191 | We should be able to release all dead SSA_NAMES and at the same time we should | |
192 | clear out BB pointer of dead statements consistently. */ | |
8f8dcce4 | 193 | } |
65f34de5 | 194 | \f |
4dafd3e4 | 195 | /* Connect E to E->src. */ |
196 | ||
197 | static inline void | |
198 | connect_src (edge e) | |
199 | { | |
f1f41a6c | 200 | vec_safe_push (e->src->succs, e); |
3072d30e | 201 | df_mark_solutions_dirty (); |
4dafd3e4 | 202 | } |
203 | ||
204 | /* Connect E to E->dest. */ | |
205 | ||
206 | static inline void | |
207 | connect_dest (edge e) | |
208 | { | |
209 | basic_block dest = e->dest; | |
f1f41a6c | 210 | vec_safe_push (dest->preds, e); |
4dafd3e4 | 211 | e->dest_idx = EDGE_COUNT (dest->preds) - 1; |
3072d30e | 212 | df_mark_solutions_dirty (); |
4dafd3e4 | 213 | } |
214 | ||
215 | /* Disconnect edge E from E->src. */ | |
216 | ||
217 | static inline void | |
218 | disconnect_src (edge e) | |
219 | { | |
220 | basic_block src = e->src; | |
221 | edge_iterator ei; | |
222 | edge tmp; | |
223 | ||
224 | for (ei = ei_start (src->succs); (tmp = ei_safe_edge (ei)); ) | |
225 | { | |
226 | if (tmp == e) | |
227 | { | |
f1f41a6c | 228 | src->succs->unordered_remove (ei.index); |
845b40c8 | 229 | df_mark_solutions_dirty (); |
4dafd3e4 | 230 | return; |
231 | } | |
232 | else | |
233 | ei_next (&ei); | |
234 | } | |
235 | ||
236 | gcc_unreachable (); | |
237 | } | |
238 | ||
239 | /* Disconnect edge E from E->dest. */ | |
240 | ||
241 | static inline void | |
242 | disconnect_dest (edge e) | |
243 | { | |
244 | basic_block dest = e->dest; | |
245 | unsigned int dest_idx = e->dest_idx; | |
246 | ||
f1f41a6c | 247 | dest->preds->unordered_remove (dest_idx); |
4dafd3e4 | 248 | |
249 | /* If we removed an edge in the middle of the edge vector, we need | |
250 | to update dest_idx of the edge that moved into the "hole". */ | |
251 | if (dest_idx < EDGE_COUNT (dest->preds)) | |
252 | EDGE_PRED (dest, dest_idx)->dest_idx = dest_idx; | |
3072d30e | 253 | df_mark_solutions_dirty (); |
4dafd3e4 | 254 | } |
255 | ||
ccad1933 | 256 | /* Create an edge connecting SRC and DEST with flags FLAGS. Return newly |
257 | created edge. Use this only if you are sure that this edge can't | |
258 | possibly already exist. */ | |
259 | ||
260 | edge | |
4c9e08a4 | 261 | unchecked_make_edge (basic_block src, basic_block dst, int flags) |
ccad1933 | 262 | { |
263 | edge e; | |
ba72912a | 264 | e = ggc_alloc_cleared_edge_def (); |
f1955b22 | 265 | n_edges_for_fn (cfun)++; |
ccad1933 | 266 | |
ccad1933 | 267 | e->src = src; |
268 | e->dest = dst; | |
269 | e->flags = flags; | |
4dafd3e4 | 270 | |
271 | connect_src (e); | |
272 | connect_dest (e); | |
ccad1933 | 273 | |
26b12c91 | 274 | execute_on_growing_pred (e); |
ccad1933 | 275 | return e; |
276 | } | |
277 | ||
7392df29 | 278 | /* Create an edge connecting SRC and DST with FLAGS optionally using |
88b5b080 | 279 | edge cache CACHE. Return the new edge, NULL if already exist. */ |
e76f35e8 | 280 | |
7392df29 | 281 | edge |
841999ef | 282 | cached_make_edge (sbitmap edge_cache, basic_block src, basic_block dst, int flags) |
65f34de5 | 283 | { |
59948e03 | 284 | if (edge_cache == NULL |
34154e27 | 285 | || src == ENTRY_BLOCK_PTR_FOR_FN (cfun) |
286 | || dst == EXIT_BLOCK_PTR_FOR_FN (cfun)) | |
59948e03 | 287 | return make_edge (src, dst, flags); |
65f34de5 | 288 | |
59948e03 | 289 | /* Does the requested edge already exist? */ |
08b7917c | 290 | if (! bitmap_bit_p (edge_cache, dst->index)) |
65f34de5 | 291 | { |
59948e03 | 292 | /* The edge does not exist. Create one and update the |
293 | cache. */ | |
08b7917c | 294 | bitmap_set_bit (edge_cache, dst->index); |
59948e03 | 295 | return unchecked_make_edge (src, dst, flags); |
65f34de5 | 296 | } |
4c9e08a4 | 297 | |
59948e03 | 298 | /* At this point, we know that the requested edge exists. Adjust |
299 | flags if necessary. */ | |
300 | if (flags) | |
301 | { | |
302 | edge e = find_edge (src, dst); | |
303 | e->flags |= flags; | |
304 | } | |
7392df29 | 305 | |
59948e03 | 306 | return NULL; |
7392df29 | 307 | } |
308 | ||
309 | /* Create an edge connecting SRC and DEST with flags FLAGS. Return newly | |
310 | created edge or NULL if already exist. */ | |
311 | ||
312 | edge | |
4c9e08a4 | 313 | make_edge (basic_block src, basic_block dest, int flags) |
7392df29 | 314 | { |
59948e03 | 315 | edge e = find_edge (src, dest); |
316 | ||
317 | /* Make sure we don't add duplicate edges. */ | |
318 | if (e) | |
319 | { | |
320 | e->flags |= flags; | |
321 | return NULL; | |
322 | } | |
323 | ||
324 | return unchecked_make_edge (src, dest, flags); | |
7392df29 | 325 | } |
326 | ||
4a82352a | 327 | /* Create an edge connecting SRC to DEST and set probability by knowing |
7392df29 | 328 | that it is the single edge leaving SRC. */ |
329 | ||
330 | edge | |
4c9e08a4 | 331 | make_single_succ_edge (basic_block src, basic_block dest, int flags) |
7392df29 | 332 | { |
333 | edge e = make_edge (src, dest, flags); | |
334 | ||
335 | e->probability = REG_BR_PROB_BASE; | |
336 | e->count = src->count; | |
337 | return e; | |
65f34de5 | 338 | } |
339 | ||
340 | /* This function will remove an edge from the flow graph. */ | |
341 | ||
342 | void | |
c8e41bd9 | 343 | remove_edge_raw (edge e) |
65f34de5 | 344 | { |
631fa7de | 345 | remove_predictions_associated_with_edge (e); |
26b12c91 | 346 | execute_on_shrinking_pred (e); |
347 | ||
4dafd3e4 | 348 | disconnect_src (e); |
349 | disconnect_dest (e); | |
65f34de5 | 350 | |
2fb0fd15 | 351 | free_edge (e); |
65f34de5 | 352 | } |
353 | ||
354 | /* Redirect an edge's successor from one block to another. */ | |
355 | ||
356 | void | |
4c9e08a4 | 357 | redirect_edge_succ (edge e, basic_block new_succ) |
65f34de5 | 358 | { |
26b12c91 | 359 | execute_on_shrinking_pred (e); |
360 | ||
4dafd3e4 | 361 | disconnect_dest (e); |
cd665a06 | 362 | |
4dafd3e4 | 363 | e->dest = new_succ; |
65f34de5 | 364 | |
365 | /* Reconnect the edge to the new successor block. */ | |
4dafd3e4 | 366 | connect_dest (e); |
367 | ||
26b12c91 | 368 | execute_on_growing_pred (e); |
65f34de5 | 369 | } |
370 | ||
65f34de5 | 371 | /* Redirect an edge's predecessor from one block to another. */ |
372 | ||
373 | void | |
4c9e08a4 | 374 | redirect_edge_pred (edge e, basic_block new_pred) |
65f34de5 | 375 | { |
4dafd3e4 | 376 | disconnect_src (e); |
65f34de5 | 377 | |
4dafd3e4 | 378 | e->src = new_pred; |
65f34de5 | 379 | |
380 | /* Reconnect the edge to the new predecessor block. */ | |
4dafd3e4 | 381 | connect_src (e); |
65f34de5 | 382 | } |
308f9b79 | 383 | |
bec2cf98 | 384 | /* Clear all basic block flags that do not have to be preserved. */ |
308f9b79 | 385 | void |
4c9e08a4 | 386 | clear_bb_flags (void) |
308f9b79 | 387 | { |
4c26117a | 388 | basic_block bb; |
389 | ||
34154e27 | 390 | FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR_FOR_FN (cfun), NULL, next_bb) |
bec2cf98 | 391 | bb->flags &= BB_FLAGS_TO_PRESERVE; |
308f9b79 | 392 | } |
65f34de5 | 393 | \f |
020c749b | 394 | /* Check the consistency of profile information. We can't do that |
395 | in verify_flow_info, as the counts may get invalid for incompletely | |
396 | solved graphs, later eliminating of conditionals or roundoff errors. | |
397 | It is still practical to have them reported for debugging of simple | |
398 | testcases. */ | |
bec2cf98 | 399 | static void |
400 | check_bb_profile (basic_block bb, FILE * file, int indent, int flags) | |
020c749b | 401 | { |
402 | edge e; | |
403 | int sum = 0; | |
404 | gcov_type lsum; | |
cd665a06 | 405 | edge_iterator ei; |
8d672d12 | 406 | struct function *fun = DECL_STRUCT_FUNCTION (current_function_decl); |
bec2cf98 | 407 | char *s_indent = (char *) alloca ((size_t) indent + 1); |
408 | memset ((void *) s_indent, ' ', (size_t) indent); | |
409 | s_indent[indent] = '\0'; | |
020c749b | 410 | |
3bedbae3 | 411 | if (profile_status_for_fn (fun) == PROFILE_ABSENT) |
020c749b | 412 | return; |
413 | ||
34154e27 | 414 | if (bb != EXIT_BLOCK_PTR_FOR_FN (fun)) |
020c749b | 415 | { |
cd665a06 | 416 | FOR_EACH_EDGE (e, ei, bb->succs) |
020c749b | 417 | sum += e->probability; |
cd665a06 | 418 | if (EDGE_COUNT (bb->succs) && abs (sum - REG_BR_PROB_BASE) > 100) |
bec2cf98 | 419 | fprintf (file, "%s%sInvalid sum of outgoing probabilities %.1f%%\n", |
420 | (flags & TDF_COMMENT) ? ";; " : "", s_indent, | |
020c749b | 421 | sum * 100.0 / REG_BR_PROB_BASE); |
422 | lsum = 0; | |
cd665a06 | 423 | FOR_EACH_EDGE (e, ei, bb->succs) |
020c749b | 424 | lsum += e->count; |
cd665a06 | 425 | if (EDGE_COUNT (bb->succs) |
426 | && (lsum - bb->count > 100 || lsum - bb->count < -100)) | |
bec2cf98 | 427 | fprintf (file, "%s%sInvalid sum of outgoing counts %i, should be %i\n", |
428 | (flags & TDF_COMMENT) ? ";; " : "", s_indent, | |
020c749b | 429 | (int) lsum, (int) bb->count); |
430 | } | |
34154e27 | 431 | if (bb != ENTRY_BLOCK_PTR_FOR_FN (fun)) |
020c749b | 432 | { |
433 | sum = 0; | |
cd665a06 | 434 | FOR_EACH_EDGE (e, ei, bb->preds) |
020c749b | 435 | sum += EDGE_FREQUENCY (e); |
436 | if (abs (sum - bb->frequency) > 100) | |
437 | fprintf (file, | |
bec2cf98 | 438 | "%s%sInvalid sum of incoming frequencies %i, should be %i\n", |
439 | (flags & TDF_COMMENT) ? ";; " : "", s_indent, | |
020c749b | 440 | sum, bb->frequency); |
441 | lsum = 0; | |
cd665a06 | 442 | FOR_EACH_EDGE (e, ei, bb->preds) |
020c749b | 443 | lsum += e->count; |
444 | if (lsum - bb->count > 100 || lsum - bb->count < -100) | |
bec2cf98 | 445 | fprintf (file, "%s%sInvalid sum of incoming counts %i, should be %i\n", |
446 | (flags & TDF_COMMENT) ? ";; " : "", s_indent, | |
020c749b | 447 | (int) lsum, (int) bb->count); |
448 | } | |
80adc5a6 | 449 | if (BB_PARTITION (bb) == BB_COLD_PARTITION) |
450 | { | |
451 | /* Warn about inconsistencies in the partitioning that are | |
452 | currently caused by profile insanities created via optimization. */ | |
453 | if (!probably_never_executed_bb_p (fun, bb)) | |
454 | fprintf (file, "%s%sBlock in cold partition with hot count\n", | |
455 | (flags & TDF_COMMENT) ? ";; " : "", s_indent); | |
456 | FOR_EACH_EDGE (e, ei, bb->preds) | |
457 | { | |
458 | if (!probably_never_executed_edge_p (fun, e)) | |
459 | fprintf (file, | |
460 | "%s%sBlock in cold partition with incoming hot edge\n", | |
461 | (flags & TDF_COMMENT) ? ";; " : "", s_indent); | |
462 | } | |
463 | } | |
020c749b | 464 | } |
465 | \f | |
65f34de5 | 466 | void |
5147ec07 | 467 | dump_edge_info (FILE *file, edge e, int flags, int do_succ) |
65f34de5 | 468 | { |
b36d64df | 469 | basic_block side = (do_succ ? e->dest : e->src); |
5147ec07 | 470 | bool do_details = false; |
471 | ||
472 | if ((flags & TDF_DETAILS) != 0 | |
473 | && (flags & TDF_SLIM) == 0) | |
474 | do_details = true; | |
475 | ||
4a020a8c | 476 | if (side->index == ENTRY_BLOCK) |
b36d64df | 477 | fputs (" ENTRY", file); |
4a020a8c | 478 | else if (side->index == EXIT_BLOCK) |
b36d64df | 479 | fputs (" EXIT", file); |
480 | else | |
b3d6de89 | 481 | fprintf (file, " %d", side->index); |
b36d64df | 482 | |
5147ec07 | 483 | if (e->probability && do_details) |
b36d64df | 484 | fprintf (file, " [%.1f%%] ", e->probability * 100.0 / REG_BR_PROB_BASE); |
65f34de5 | 485 | |
5147ec07 | 486 | if (e->count && do_details) |
65f34de5 | 487 | { |
609e7ca1 | 488 | fputs (" count:", file); |
e4fc8aad | 489 | fprintf (file, HOST_WIDEST_INT_PRINT_DEC, e->count); |
65f34de5 | 490 | } |
491 | ||
5147ec07 | 492 | if (e->flags && do_details) |
65f34de5 | 493 | { |
5147ec07 | 494 | static const char * const bitnames[] = |
495 | { | |
496 | #define DEF_EDGE_FLAG(NAME,IDX) #NAME , | |
497 | #include "cfg-flags.def" | |
498 | NULL | |
499 | #undef DEF_EDGE_FLAG | |
500 | }; | |
501 | bool comma = false; | |
b36d64df | 502 | int i, flags = e->flags; |
65f34de5 | 503 | |
5147ec07 | 504 | gcc_assert (e->flags <= EDGE_ALL_FLAGS); |
e4fc8aad | 505 | fputs (" (", file); |
65f34de5 | 506 | for (i = 0; flags; i++) |
507 | if (flags & (1 << i)) | |
508 | { | |
509 | flags &= ~(1 << i); | |
510 | ||
511 | if (comma) | |
512 | fputc (',', file); | |
5147ec07 | 513 | fputs (bitnames[i], file); |
514 | comma = true; | |
65f34de5 | 515 | } |
e4fc8aad | 516 | |
65f34de5 | 517 | fputc (')', file); |
518 | } | |
519 | } | |
c7d89805 | 520 | |
521 | DEBUG_FUNCTION void | |
522 | debug (edge_def &ref) | |
523 | { | |
524 | /* FIXME (crowl): Is this desireable? */ | |
525 | dump_edge_info (stderr, &ref, 0, false); | |
526 | dump_edge_info (stderr, &ref, 0, true); | |
527 | } | |
528 | ||
529 | DEBUG_FUNCTION void | |
530 | debug (edge_def *ptr) | |
531 | { | |
532 | if (ptr) | |
533 | debug (*ptr); | |
534 | else | |
535 | fprintf (stderr, "<nil>\n"); | |
536 | } | |
65f34de5 | 537 | \f |
424da949 | 538 | /* Simple routines to easily allocate AUX fields of basic blocks. */ |
e4fc8aad | 539 | |
b36d64df | 540 | static struct obstack block_aux_obstack; |
541 | static void *first_block_aux_obj = 0; | |
542 | static struct obstack edge_aux_obstack; | |
543 | static void *first_edge_aux_obj = 0; | |
65f34de5 | 544 | |
edc2a478 | 545 | /* Allocate a memory block of SIZE as BB->aux. The obstack must |
b36d64df | 546 | be first initialized by alloc_aux_for_blocks. */ |
65f34de5 | 547 | |
ec972558 | 548 | static void |
4c9e08a4 | 549 | alloc_aux_for_block (basic_block bb, int size) |
65f34de5 | 550 | { |
b36d64df | 551 | /* Verify that aux field is clear. */ |
cc636d56 | 552 | gcc_assert (!bb->aux && first_block_aux_obj); |
b36d64df | 553 | bb->aux = obstack_alloc (&block_aux_obstack, size); |
554 | memset (bb->aux, 0, size); | |
65f34de5 | 555 | } |
556 | ||
b36d64df | 557 | /* Initialize the block_aux_obstack and if SIZE is nonzero, call |
558 | alloc_aux_for_block for each basic block. */ | |
65f34de5 | 559 | |
560 | void | |
4c9e08a4 | 561 | alloc_aux_for_blocks (int size) |
65f34de5 | 562 | { |
b36d64df | 563 | static int initialized; |
65f34de5 | 564 | |
b36d64df | 565 | if (!initialized) |
65f34de5 | 566 | { |
b36d64df | 567 | gcc_obstack_init (&block_aux_obstack); |
568 | initialized = 1; | |
65f34de5 | 569 | } |
cc636d56 | 570 | else |
571 | /* Check whether AUX data are still allocated. */ | |
572 | gcc_assert (!first_block_aux_obj); | |
a0c938f0 | 573 | |
f0af5a88 | 574 | first_block_aux_obj = obstack_alloc (&block_aux_obstack, 0); |
b36d64df | 575 | if (size) |
65f34de5 | 576 | { |
4c26117a | 577 | basic_block bb; |
e4fc8aad | 578 | |
ec972558 | 579 | FOR_ALL_BB (bb) |
4c26117a | 580 | alloc_aux_for_block (bb, size); |
65f34de5 | 581 | } |
582 | } | |
b36d64df | 583 | |
82f7392b | 584 | /* Clear AUX pointers of all blocks. */ |
65f34de5 | 585 | |
586 | void | |
4c9e08a4 | 587 | clear_aux_for_blocks (void) |
65f34de5 | 588 | { |
4c26117a | 589 | basic_block bb; |
e4fc8aad | 590 | |
ec972558 | 591 | FOR_ALL_BB (bb) |
4c26117a | 592 | bb->aux = NULL; |
82f7392b | 593 | } |
594 | ||
595 | /* Free data allocated in block_aux_obstack and clear AUX pointers | |
596 | of all blocks. */ | |
597 | ||
598 | void | |
4c9e08a4 | 599 | free_aux_for_blocks (void) |
82f7392b | 600 | { |
cc636d56 | 601 | gcc_assert (first_block_aux_obj); |
82f7392b | 602 | obstack_free (&block_aux_obstack, first_block_aux_obj); |
b36d64df | 603 | first_block_aux_obj = NULL; |
82f7392b | 604 | |
605 | clear_aux_for_blocks (); | |
b36d64df | 606 | } |
65f34de5 | 607 | |
61025ec0 | 608 | /* Allocate a memory edge of SIZE as E->aux. The obstack must |
b36d64df | 609 | be first initialized by alloc_aux_for_edges. */ |
65f34de5 | 610 | |
61025ec0 | 611 | void |
4c9e08a4 | 612 | alloc_aux_for_edge (edge e, int size) |
b36d64df | 613 | { |
614 | /* Verify that aux field is clear. */ | |
cc636d56 | 615 | gcc_assert (!e->aux && first_edge_aux_obj); |
b36d64df | 616 | e->aux = obstack_alloc (&edge_aux_obstack, size); |
617 | memset (e->aux, 0, size); | |
618 | } | |
65f34de5 | 619 | |
b36d64df | 620 | /* Initialize the edge_aux_obstack and if SIZE is nonzero, call |
621 | alloc_aux_for_edge for each basic edge. */ | |
65f34de5 | 622 | |
b36d64df | 623 | void |
4c9e08a4 | 624 | alloc_aux_for_edges (int size) |
b36d64df | 625 | { |
626 | static int initialized; | |
65f34de5 | 627 | |
b36d64df | 628 | if (!initialized) |
629 | { | |
630 | gcc_obstack_init (&edge_aux_obstack); | |
631 | initialized = 1; | |
65f34de5 | 632 | } |
cc636d56 | 633 | else |
634 | /* Check whether AUX data are still allocated. */ | |
635 | gcc_assert (!first_edge_aux_obj); | |
e4fc8aad | 636 | |
f0af5a88 | 637 | first_edge_aux_obj = obstack_alloc (&edge_aux_obstack, 0); |
b36d64df | 638 | if (size) |
65f34de5 | 639 | { |
4c26117a | 640 | basic_block bb; |
641 | ||
34154e27 | 642 | FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR_FOR_FN (cfun), |
643 | EXIT_BLOCK_PTR_FOR_FN (cfun), next_bb) | |
65f34de5 | 644 | { |
b36d64df | 645 | edge e; |
cd665a06 | 646 | edge_iterator ei; |
b36d64df | 647 | |
cd665a06 | 648 | FOR_EACH_EDGE (e, ei, bb->succs) |
b36d64df | 649 | alloc_aux_for_edge (e, size); |
65f34de5 | 650 | } |
65f34de5 | 651 | } |
65f34de5 | 652 | } |
65f34de5 | 653 | |
82f7392b | 654 | /* Clear AUX pointers of all edges. */ |
b36d64df | 655 | |
656 | void | |
4c9e08a4 | 657 | clear_aux_for_edges (void) |
65f34de5 | 658 | { |
4c26117a | 659 | basic_block bb; |
660 | edge e; | |
65f34de5 | 661 | |
34154e27 | 662 | FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR_FOR_FN (cfun), |
663 | EXIT_BLOCK_PTR_FOR_FN (cfun), next_bb) | |
65f34de5 | 664 | { |
cd665a06 | 665 | edge_iterator ei; |
666 | FOR_EACH_EDGE (e, ei, bb->succs) | |
b36d64df | 667 | e->aux = NULL; |
65f34de5 | 668 | } |
82f7392b | 669 | } |
670 | ||
671 | /* Free data allocated in edge_aux_obstack and clear AUX pointers | |
672 | of all edges. */ | |
673 | ||
674 | void | |
4c9e08a4 | 675 | free_aux_for_edges (void) |
82f7392b | 676 | { |
cc636d56 | 677 | gcc_assert (first_edge_aux_obj); |
82f7392b | 678 | obstack_free (&edge_aux_obstack, first_edge_aux_obj); |
b36d64df | 679 | first_edge_aux_obj = NULL; |
82f7392b | 680 | |
681 | clear_aux_for_edges (); | |
65f34de5 | 682 | } |
1026363d | 683 | |
4b987fac | 684 | DEBUG_FUNCTION void |
4c9e08a4 | 685 | debug_bb (basic_block bb) |
028f8cc7 | 686 | { |
5f7f600e | 687 | dump_bb (stderr, bb, 0, dump_flags); |
028f8cc7 | 688 | } |
689 | ||
4b987fac | 690 | DEBUG_FUNCTION basic_block |
4c9e08a4 | 691 | debug_bb_n (int n) |
028f8cc7 | 692 | { |
f5a6b05f | 693 | basic_block bb = BASIC_BLOCK_FOR_FN (cfun, n); |
5147ec07 | 694 | debug_bb (bb); |
028f8cc7 | 695 | return bb; |
1026363d | 696 | } |
4ee9c684 | 697 | |
5147ec07 | 698 | /* Dumps cfg related information about basic block BB to OUTF. |
699 | If HEADER is true, dump things that appear before the instructions | |
700 | contained in BB. If FOOTER is true, dump things that appear after. | |
701 | Flags are the TDF_* masks as documented in dumpfile.h. | |
702 | NB: With TDF_DETAILS, it is assumed that cfun is available, so | |
703 | that maybe_hot_bb_p and probably_never_executed_bb_p don't ICE. */ | |
4ee9c684 | 704 | |
5147ec07 | 705 | void |
706 | dump_bb_info (FILE *outf, basic_block bb, int indent, int flags, | |
707 | bool do_header, bool do_footer) | |
4ee9c684 | 708 | { |
cd665a06 | 709 | edge_iterator ei; |
5147ec07 | 710 | edge e; |
4ee9c684 | 711 | static const char * const bb_bitnames[] = |
712 | { | |
5147ec07 | 713 | #define DEF_BASIC_BLOCK_FLAG(NAME,IDX) #NAME , |
714 | #include "cfg-flags.def" | |
715 | NULL | |
716 | #undef DEF_BASIC_BLOCK_FLAG | |
4ee9c684 | 717 | }; |
718 | const unsigned n_bitnames = sizeof (bb_bitnames) / sizeof (char *); | |
bec2cf98 | 719 | bool first; |
5147ec07 | 720 | char *s_indent = (char *) alloca ((size_t) indent + 1); |
721 | memset ((void *) s_indent, ' ', (size_t) indent); | |
722 | s_indent[indent] = '\0'; | |
4ee9c684 | 723 | |
5147ec07 | 724 | gcc_assert (bb->flags <= BB_ALL_FLAGS); |
725 | ||
726 | if (do_header) | |
727 | { | |
728 | unsigned i; | |
729 | ||
730 | if (flags & TDF_COMMENT) | |
731 | fputs (";; ", outf); | |
bec2cf98 | 732 | fprintf (outf, "%sbasic block %d, loop depth %d", |
6b42039a | 733 | s_indent, bb->index, bb_loop_depth (bb)); |
5147ec07 | 734 | if (flags & TDF_DETAILS) |
735 | { | |
8d672d12 | 736 | struct function *fun = DECL_STRUCT_FUNCTION (current_function_decl); |
bec2cf98 | 737 | fprintf (outf, ", count " HOST_WIDEST_INT_PRINT_DEC, |
738 | (HOST_WIDEST_INT) bb->count); | |
5147ec07 | 739 | fprintf (outf, ", freq %i", bb->frequency); |
8d672d12 | 740 | if (maybe_hot_bb_p (fun, bb)) |
5147ec07 | 741 | fputs (", maybe hot", outf); |
8d672d12 | 742 | if (probably_never_executed_bb_p (fun, bb)) |
5147ec07 | 743 | fputs (", probably never executed", outf); |
744 | } | |
745 | fputc ('\n', outf); | |
bec2cf98 | 746 | if (TDF_DETAILS) |
747 | check_bb_profile (bb, outf, indent, flags); | |
5147ec07 | 748 | |
749 | if (flags & TDF_DETAILS) | |
750 | { | |
5147ec07 | 751 | if (flags & TDF_COMMENT) |
752 | fputs (";; ", outf); | |
753 | fprintf (outf, "%s prev block ", s_indent); | |
754 | if (bb->prev_bb) | |
755 | fprintf (outf, "%d", bb->prev_bb->index); | |
756 | else | |
757 | fprintf (outf, "(nil)"); | |
758 | fprintf (outf, ", next block "); | |
759 | if (bb->next_bb) | |
760 | fprintf (outf, "%d", bb->next_bb->index); | |
761 | else | |
762 | fprintf (outf, "(nil)"); | |
763 | ||
764 | fputs (", flags:", outf); | |
bec2cf98 | 765 | first = true; |
5147ec07 | 766 | for (i = 0; i < n_bitnames; i++) |
767 | if (bb->flags & (1 << i)) | |
768 | { | |
769 | if (first) | |
770 | fputs (" (", outf); | |
771 | else | |
772 | fputs (", ", outf); | |
773 | first = false; | |
774 | fputs (bb_bitnames[i], outf); | |
775 | } | |
776 | if (!first) | |
777 | fputc (')', outf); | |
bec2cf98 | 778 | fputc ('\n', outf); |
5147ec07 | 779 | } |
5147ec07 | 780 | |
781 | if (flags & TDF_COMMENT) | |
782 | fputs (";; ", outf); | |
783 | fprintf (outf, "%s pred: ", s_indent); | |
bec2cf98 | 784 | first = true; |
5147ec07 | 785 | FOR_EACH_EDGE (e, ei, bb->preds) |
bec2cf98 | 786 | { |
787 | if (! first) | |
788 | { | |
789 | if (flags & TDF_COMMENT) | |
790 | fputs (";; ", outf); | |
791 | fprintf (outf, "%s ", s_indent); | |
792 | } | |
793 | first = false; | |
794 | dump_edge_info (outf, e, flags, 0); | |
795 | fputc ('\n', outf); | |
796 | } | |
90e2513f | 797 | if (first) |
798 | fputc ('\n', outf); | |
5147ec07 | 799 | } |
800 | ||
801 | if (do_footer) | |
802 | { | |
5147ec07 | 803 | if (flags & TDF_COMMENT) |
804 | fputs (";; ", outf); | |
805 | fprintf (outf, "%s succ: ", s_indent); | |
bec2cf98 | 806 | first = true; |
5147ec07 | 807 | FOR_EACH_EDGE (e, ei, bb->succs) |
bec2cf98 | 808 | { |
809 | if (! first) | |
810 | { | |
811 | if (flags & TDF_COMMENT) | |
812 | fputs (";; ", outf); | |
813 | fprintf (outf, "%s ", s_indent); | |
814 | } | |
815 | first = false; | |
816 | dump_edge_info (outf, e, flags, 1); | |
817 | fputc ('\n', outf); | |
818 | } | |
90e2513f | 819 | if (first) |
820 | fputc ('\n', outf); | |
5147ec07 | 821 | } |
4ee9c684 | 822 | } |
823 | ||
824 | /* Dumps a brief description of cfg to FILE. */ | |
825 | ||
826 | void | |
bec2cf98 | 827 | brief_dump_cfg (FILE *file, int flags) |
4ee9c684 | 828 | { |
829 | basic_block bb; | |
830 | ||
fc00614f | 831 | FOR_EACH_BB_FN (bb, cfun) |
4ee9c684 | 832 | { |
bec2cf98 | 833 | dump_bb_info (file, bb, 0, |
834 | flags & (TDF_COMMENT | TDF_DETAILS), | |
835 | true, true); | |
4ee9c684 | 836 | } |
837 | } | |
615dd397 | 838 | |
839 | /* An edge originally destinating BB of FREQUENCY and COUNT has been proved to | |
840 | leave the block by TAKEN_EDGE. Update profile of BB such that edge E can be | |
a0c938f0 | 841 | redirected to destination of TAKEN_EDGE. |
615dd397 | 842 | |
843 | This function may leave the profile inconsistent in the case TAKEN_EDGE | |
844 | frequency or count is believed to be lower than FREQUENCY or COUNT | |
7a635e9c | 845 | respectively. */ |
615dd397 | 846 | void |
847 | update_bb_profile_for_threading (basic_block bb, int edge_frequency, | |
848 | gcov_type count, edge taken_edge) | |
849 | { | |
850 | edge c; | |
851 | int prob; | |
cd665a06 | 852 | edge_iterator ei; |
615dd397 | 853 | |
854 | bb->count -= count; | |
855 | if (bb->count < 0) | |
3ec32924 | 856 | { |
857 | if (dump_file) | |
858 | fprintf (dump_file, "bb %i count became negative after threading", | |
859 | bb->index); | |
860 | bb->count = 0; | |
861 | } | |
615dd397 | 862 | |
863 | /* Compute the probability of TAKEN_EDGE being reached via threaded edge. | |
864 | Watch for overflows. */ | |
865 | if (bb->frequency) | |
70074000 | 866 | prob = GCOV_COMPUTE_SCALE (edge_frequency, bb->frequency); |
615dd397 | 867 | else |
868 | prob = 0; | |
869 | if (prob > taken_edge->probability) | |
870 | { | |
871 | if (dump_file) | |
872 | fprintf (dump_file, "Jump threading proved probability of edge " | |
873 | "%i->%i too small (it is %i, should be %i).\n", | |
874 | taken_edge->src->index, taken_edge->dest->index, | |
875 | taken_edge->probability, prob); | |
876 | prob = taken_edge->probability; | |
877 | } | |
878 | ||
879 | /* Now rescale the probabilities. */ | |
880 | taken_edge->probability -= prob; | |
881 | prob = REG_BR_PROB_BASE - prob; | |
882 | bb->frequency -= edge_frequency; | |
883 | if (bb->frequency < 0) | |
884 | bb->frequency = 0; | |
885 | if (prob <= 0) | |
886 | { | |
887 | if (dump_file) | |
888 | fprintf (dump_file, "Edge frequencies of bb %i has been reset, " | |
889 | "frequency of block should end up being 0, it is %i\n", | |
890 | bb->index, bb->frequency); | |
cd665a06 | 891 | EDGE_SUCC (bb, 0)->probability = REG_BR_PROB_BASE; |
892 | ei = ei_start (bb->succs); | |
893 | ei_next (&ei); | |
894 | for (; (c = ei_safe_edge (ei)); ei_next (&ei)) | |
615dd397 | 895 | c->probability = 0; |
896 | } | |
2260bbe1 | 897 | else if (prob != REG_BR_PROB_BASE) |
898 | { | |
f57c928a | 899 | int scale = RDIV (65536 * REG_BR_PROB_BASE, prob); |
2260bbe1 | 900 | |
901 | FOR_EACH_EDGE (c, ei, bb->succs) | |
72ab4a94 | 902 | { |
4701372e | 903 | /* Protect from overflow due to additional scaling. */ |
904 | if (c->probability > prob) | |
72ab4a94 | 905 | c->probability = REG_BR_PROB_BASE; |
4701372e | 906 | else |
907 | { | |
908 | c->probability = RDIV (c->probability * scale, 65536); | |
909 | if (c->probability > REG_BR_PROB_BASE) | |
910 | c->probability = REG_BR_PROB_BASE; | |
911 | } | |
72ab4a94 | 912 | } |
2260bbe1 | 913 | } |
615dd397 | 914 | |
a53ff4c1 | 915 | gcc_assert (bb == taken_edge->src); |
615dd397 | 916 | taken_edge->count -= count; |
917 | if (taken_edge->count < 0) | |
3ec32924 | 918 | { |
919 | if (dump_file) | |
920 | fprintf (dump_file, "edge %i->%i count became negative after threading", | |
921 | taken_edge->src->index, taken_edge->dest->index); | |
922 | taken_edge->count = 0; | |
923 | } | |
615dd397 | 924 | } |
4d6b11ab | 925 | |
926 | /* Multiply all frequencies of basic blocks in array BBS of length NBBS | |
927 | by NUM/DEN, in int arithmetic. May lose some accuracy. */ | |
928 | void | |
929 | scale_bbs_frequencies_int (basic_block *bbs, int nbbs, int num, int den) | |
930 | { | |
931 | int i; | |
932 | edge e; | |
72ab4a94 | 933 | if (num < 0) |
934 | num = 0; | |
7cef6c97 | 935 | |
936 | /* Scale NUM and DEN to avoid overflows. Frequencies are in order of | |
937 | 10^4, if we make DEN <= 10^3, we can afford to upscale by 100 | |
938 | and still safely fit in int during calculations. */ | |
939 | if (den > 1000) | |
940 | { | |
941 | if (num > 1000000) | |
942 | return; | |
943 | ||
944 | num = RDIV (1000 * num, den); | |
945 | den = 1000; | |
946 | } | |
947 | if (num > 100 * den) | |
72ab4a94 | 948 | return; |
7cef6c97 | 949 | |
4d6b11ab | 950 | for (i = 0; i < nbbs; i++) |
951 | { | |
952 | edge_iterator ei; | |
f57c928a | 953 | bbs[i]->frequency = RDIV (bbs[i]->frequency * num, den); |
7cef6c97 | 954 | /* Make sure the frequencies do not grow over BB_FREQ_MAX. */ |
955 | if (bbs[i]->frequency > BB_FREQ_MAX) | |
956 | bbs[i]->frequency = BB_FREQ_MAX; | |
4d6b11ab | 957 | bbs[i]->count = RDIV (bbs[i]->count * num, den); |
958 | FOR_EACH_EDGE (e, ei, bbs[i]->succs) | |
f57c928a | 959 | e->count = RDIV (e->count * num, den); |
4d6b11ab | 960 | } |
961 | } | |
962 | ||
f57c928a | 963 | /* numbers smaller than this value are safe to multiply without getting |
964 | 64bit overflow. */ | |
965 | #define MAX_SAFE_MULTIPLIER (1 << (sizeof (HOST_WIDEST_INT) * 4 - 1)) | |
966 | ||
4d6b11ab | 967 | /* Multiply all frequencies of basic blocks in array BBS of length NBBS |
968 | by NUM/DEN, in gcov_type arithmetic. More accurate than previous | |
969 | function but considerably slower. */ | |
970 | void | |
a0c938f0 | 971 | scale_bbs_frequencies_gcov_type (basic_block *bbs, int nbbs, gcov_type num, |
972 | gcov_type den) | |
4d6b11ab | 973 | { |
974 | int i; | |
975 | edge e; | |
f57c928a | 976 | gcov_type fraction = RDIV (num * 65536, den); |
4d6b11ab | 977 | |
f57c928a | 978 | gcc_assert (fraction >= 0); |
979 | ||
980 | if (num < MAX_SAFE_MULTIPLIER) | |
981 | for (i = 0; i < nbbs; i++) | |
982 | { | |
983 | edge_iterator ei; | |
984 | bbs[i]->frequency = RDIV (bbs[i]->frequency * num, den); | |
985 | if (bbs[i]->count <= MAX_SAFE_MULTIPLIER) | |
986 | bbs[i]->count = RDIV (bbs[i]->count * num, den); | |
987 | else | |
988 | bbs[i]->count = RDIV (bbs[i]->count * fraction, 65536); | |
989 | FOR_EACH_EDGE (e, ei, bbs[i]->succs) | |
990 | if (bbs[i]->count <= MAX_SAFE_MULTIPLIER) | |
991 | e->count = RDIV (e->count * num, den); | |
992 | else | |
993 | e->count = RDIV (e->count * fraction, 65536); | |
994 | } | |
995 | else | |
996 | for (i = 0; i < nbbs; i++) | |
997 | { | |
998 | edge_iterator ei; | |
999 | if (sizeof (gcov_type) > sizeof (int)) | |
1000 | bbs[i]->frequency = RDIV (bbs[i]->frequency * num, den); | |
1001 | else | |
1002 | bbs[i]->frequency = RDIV (bbs[i]->frequency * fraction, 65536); | |
1003 | bbs[i]->count = RDIV (bbs[i]->count * fraction, 65536); | |
1004 | FOR_EACH_EDGE (e, ei, bbs[i]->succs) | |
1005 | e->count = RDIV (e->count * fraction, 65536); | |
1006 | } | |
4d6b11ab | 1007 | } |
01020a5f | 1008 | |
d1455aa3 | 1009 | /* Helper types for hash tables. */ |
01020a5f | 1010 | |
1011 | struct htab_bb_copy_original_entry | |
1012 | { | |
1013 | /* Block we are attaching info to. */ | |
1014 | int index1; | |
1015 | /* Index of original or copy (depending on the hashtable) */ | |
1016 | int index2; | |
1017 | }; | |
1018 | ||
d1455aa3 | 1019 | struct bb_copy_hasher : typed_noop_remove <htab_bb_copy_original_entry> |
01020a5f | 1020 | { |
c580da87 | 1021 | typedef htab_bb_copy_original_entry value_type; |
1022 | typedef htab_bb_copy_original_entry compare_type; | |
1023 | static inline hashval_t hash (const value_type *); | |
1024 | static inline bool equal (const value_type *existing, | |
1025 | const compare_type * candidate); | |
d1455aa3 | 1026 | }; |
01020a5f | 1027 | |
d1455aa3 | 1028 | inline hashval_t |
c580da87 | 1029 | bb_copy_hasher::hash (const value_type *data) |
d1455aa3 | 1030 | { |
01020a5f | 1031 | return data->index1; |
1032 | } | |
01020a5f | 1033 | |
d1455aa3 | 1034 | inline bool |
c580da87 | 1035 | bb_copy_hasher::equal (const value_type *data, const compare_type *data2) |
d1455aa3 | 1036 | { |
01020a5f | 1037 | return data->index1 == data2->index1; |
1038 | } | |
1039 | ||
d1455aa3 | 1040 | /* Data structures used to maintain mapping between basic blocks and |
1041 | copies. */ | |
1042 | static hash_table <bb_copy_hasher> bb_original; | |
1043 | static hash_table <bb_copy_hasher> bb_copy; | |
1044 | ||
1045 | /* And between loops and copies. */ | |
1046 | static hash_table <bb_copy_hasher> loop_copy; | |
1047 | static alloc_pool original_copy_bb_pool; | |
1048 | ||
1049 | ||
a92c20c4 | 1050 | /* Initialize the data structures to maintain mapping between blocks |
1051 | and its copies. */ | |
01020a5f | 1052 | void |
1053 | initialize_original_copy_tables (void) | |
1054 | { | |
1055 | gcc_assert (!original_copy_bb_pool); | |
1056 | original_copy_bb_pool | |
1057 | = create_alloc_pool ("original_copy", | |
1058 | sizeof (struct htab_bb_copy_original_entry), 10); | |
d1455aa3 | 1059 | bb_original.create (10); |
1060 | bb_copy.create (10); | |
1061 | loop_copy.create (10); | |
01020a5f | 1062 | } |
1063 | ||
a92c20c4 | 1064 | /* Free the data structures to maintain mapping between blocks and |
1065 | its copies. */ | |
01020a5f | 1066 | void |
1067 | free_original_copy_tables (void) | |
1068 | { | |
1069 | gcc_assert (original_copy_bb_pool); | |
d1455aa3 | 1070 | bb_copy.dispose (); |
1071 | bb_original.dispose (); | |
1072 | loop_copy.dispose (); | |
01020a5f | 1073 | free_alloc_pool (original_copy_bb_pool); |
01020a5f | 1074 | original_copy_bb_pool = NULL; |
1075 | } | |
1076 | ||
96c90e5e | 1077 | /* Removes the value associated with OBJ from table TAB. */ |
1078 | ||
1079 | static void | |
d1455aa3 | 1080 | copy_original_table_clear (hash_table <bb_copy_hasher> tab, unsigned obj) |
96c90e5e | 1081 | { |
d1455aa3 | 1082 | htab_bb_copy_original_entry **slot; |
96c90e5e | 1083 | struct htab_bb_copy_original_entry key, *elt; |
1084 | ||
1085 | if (!original_copy_bb_pool) | |
1086 | return; | |
1087 | ||
1088 | key.index1 = obj; | |
d1455aa3 | 1089 | slot = tab.find_slot (&key, NO_INSERT); |
96c90e5e | 1090 | if (!slot) |
1091 | return; | |
1092 | ||
d1455aa3 | 1093 | elt = *slot; |
1094 | tab.clear_slot (slot); | |
96c90e5e | 1095 | pool_free (original_copy_bb_pool, elt); |
1096 | } | |
1097 | ||
1098 | /* Sets the value associated with OBJ in table TAB to VAL. | |
1099 | Do nothing when data structures are not initialized. */ | |
1100 | ||
1101 | static void | |
d1455aa3 | 1102 | copy_original_table_set (hash_table <bb_copy_hasher> tab, |
1103 | unsigned obj, unsigned val) | |
96c90e5e | 1104 | { |
1105 | struct htab_bb_copy_original_entry **slot; | |
1106 | struct htab_bb_copy_original_entry key; | |
1107 | ||
1108 | if (!original_copy_bb_pool) | |
1109 | return; | |
1110 | ||
1111 | key.index1 = obj; | |
d1455aa3 | 1112 | slot = tab.find_slot (&key, INSERT); |
96c90e5e | 1113 | if (!*slot) |
1114 | { | |
f780cc25 | 1115 | *slot = (struct htab_bb_copy_original_entry *) |
1116 | pool_alloc (original_copy_bb_pool); | |
96c90e5e | 1117 | (*slot)->index1 = obj; |
1118 | } | |
1119 | (*slot)->index2 = val; | |
1120 | } | |
1121 | ||
a92c20c4 | 1122 | /* Set original for basic block. Do nothing when data structures are not |
1123 | initialized so passes not needing this don't need to care. */ | |
01020a5f | 1124 | void |
1125 | set_bb_original (basic_block bb, basic_block original) | |
1126 | { | |
96c90e5e | 1127 | copy_original_table_set (bb_original, bb->index, original->index); |
01020a5f | 1128 | } |
1129 | ||
1130 | /* Get the original basic block. */ | |
1131 | basic_block | |
1132 | get_bb_original (basic_block bb) | |
1133 | { | |
1134 | struct htab_bb_copy_original_entry *entry; | |
1135 | struct htab_bb_copy_original_entry key; | |
1136 | ||
1137 | gcc_assert (original_copy_bb_pool); | |
1138 | ||
1139 | key.index1 = bb->index; | |
d1455aa3 | 1140 | entry = bb_original.find (&key); |
01020a5f | 1141 | if (entry) |
f5a6b05f | 1142 | return BASIC_BLOCK_FOR_FN (cfun, entry->index2); |
01020a5f | 1143 | else |
1144 | return NULL; | |
1145 | } | |
1146 | ||
a92c20c4 | 1147 | /* Set copy for basic block. Do nothing when data structures are not |
1148 | initialized so passes not needing this don't need to care. */ | |
01020a5f | 1149 | void |
1150 | set_bb_copy (basic_block bb, basic_block copy) | |
1151 | { | |
96c90e5e | 1152 | copy_original_table_set (bb_copy, bb->index, copy->index); |
01020a5f | 1153 | } |
1154 | ||
1155 | /* Get the copy of basic block. */ | |
1156 | basic_block | |
1157 | get_bb_copy (basic_block bb) | |
1158 | { | |
1159 | struct htab_bb_copy_original_entry *entry; | |
1160 | struct htab_bb_copy_original_entry key; | |
1161 | ||
1162 | gcc_assert (original_copy_bb_pool); | |
1163 | ||
1164 | key.index1 = bb->index; | |
d1455aa3 | 1165 | entry = bb_copy.find (&key); |
01020a5f | 1166 | if (entry) |
f5a6b05f | 1167 | return BASIC_BLOCK_FOR_FN (cfun, entry->index2); |
01020a5f | 1168 | else |
1169 | return NULL; | |
1170 | } | |
96c90e5e | 1171 | |
1172 | /* Set copy for LOOP to COPY. Do nothing when data structures are not | |
1173 | initialized so passes not needing this don't need to care. */ | |
1174 | ||
1175 | void | |
1176 | set_loop_copy (struct loop *loop, struct loop *copy) | |
1177 | { | |
1178 | if (!copy) | |
1179 | copy_original_table_clear (loop_copy, loop->num); | |
1180 | else | |
1181 | copy_original_table_set (loop_copy, loop->num, copy->num); | |
1182 | } | |
1183 | ||
1184 | /* Get the copy of LOOP. */ | |
1185 | ||
1186 | struct loop * | |
1187 | get_loop_copy (struct loop *loop) | |
1188 | { | |
1189 | struct htab_bb_copy_original_entry *entry; | |
1190 | struct htab_bb_copy_original_entry key; | |
1191 | ||
1192 | gcc_assert (original_copy_bb_pool); | |
1193 | ||
1194 | key.index1 = loop->num; | |
d1455aa3 | 1195 | entry = loop_copy.find (&key); |
96c90e5e | 1196 | if (entry) |
41f75a99 | 1197 | return get_loop (cfun, entry->index2); |
96c90e5e | 1198 | else |
1199 | return NULL; | |
1200 | } |