]>
Commit | Line | Data |
---|---|---|
402209ff JH |
1 | /* Control flow graph manipulation code for GNU compiler. |
2 | Copyright (C) 1987, 1988, 1992, 1993, 1994, 1995, 1996, 1997, 1998, | |
778f72f2 RS |
3 | 1999, 2000, 2001, 2002, 2003, 2004, 2005 |
4 | Free Software Foundation, Inc. | |
402209ff JH |
5 | |
6 | This file is part of GCC. | |
7 | ||
8 | GCC is free software; you can redistribute it and/or modify it under | |
9 | the terms of the GNU General Public License as published by the Free | |
10 | Software Foundation; either version 2, or (at your option) any later | |
11 | version. | |
12 | ||
13 | GCC is distributed in the hope that it will be useful, but WITHOUT ANY | |
14 | WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
15 | FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
16 | for more details. | |
17 | ||
18 | You should have received a copy of the GNU General Public License | |
19 | along with GCC; see the file COPYING. If not, write to the Free | |
20 | Software Foundation, 59 Temple Place - Suite 330, Boston, MA | |
21 | 02111-1307, USA. */ | |
22 | ||
9d083c8c | 23 | /* This file contains low level functions to manipulate the CFG and |
4d6922ee | 24 | analyze it. All other modules should not transform the data structure |
9d083c8c RS |
25 | directly and use abstraction instead. The file is supposed to be |
26 | ordered bottom-up and should not contain any code dependent on a | |
27 | particular intermediate language (RTL or trees). | |
402209ff JH |
28 | |
29 | Available functionality: | |
30 | - Initialization/deallocation | |
31 | init_flow, clear_edges | |
ca6c03ca JH |
32 | - Low level basic block manipulation |
33 | alloc_block, expunge_block | |
402209ff | 34 | - Edge manipulation |
7ded4467 | 35 | make_edge, make_single_succ_edge, cached_make_edge, remove_edge |
402209ff JH |
36 | - Low level edge redirection (without updating instruction chain) |
37 | redirect_edge_succ, redirect_edge_succ_nodup, redirect_edge_pred | |
eaec9b3d | 38 | - Dumping and debugging |
ca6c03ca JH |
39 | dump_flow_info, debug_flow_info, dump_edge_info |
40 | - Allocation of AUX fields for basic blocks | |
41 | alloc_aux_for_blocks, free_aux_for_blocks, alloc_aux_for_block | |
38c1593d | 42 | - clear_bb_flags |
10e9fecc JH |
43 | - Consistency checking |
44 | verify_flow_info | |
45 | - Dumping and debugging | |
46 | print_rtl_with_bb, dump_bb, debug_bb, debug_bb_n | |
402209ff JH |
47 | */ |
48 | \f | |
49 | #include "config.h" | |
50 | #include "system.h" | |
4977bab6 ZW |
51 | #include "coretypes.h" |
52 | #include "tm.h" | |
402209ff JH |
53 | #include "tree.h" |
54 | #include "rtl.h" | |
55 | #include "hard-reg-set.h" | |
402209ff JH |
56 | #include "regs.h" |
57 | #include "flags.h" | |
58 | #include "output.h" | |
59 | #include "function.h" | |
60 | #include "except.h" | |
61 | #include "toplev.h" | |
3d9339a9 | 62 | #include "tm_p.h" |
997de8ed | 63 | #include "obstack.h" |
6de9cd9a DN |
64 | #include "timevar.h" |
65 | #include "ggc.h" | |
402209ff JH |
66 | |
67 | /* The obstack on which the flow graph components are allocated. */ | |
68 | ||
7932a3db | 69 | struct bitmap_obstack reg_obstack; |
402209ff | 70 | |
d329e058 AJ |
71 | void debug_flow_info (void); |
72 | static void free_edge (edge); | |
402209ff | 73 | \f |
33156717 JH |
74 | #define RDIV(X,Y) (((X) + (Y) / 2) / (Y)) |
75 | ||
eaec9b3d | 76 | /* Called once at initialization time. */ |
402209ff JH |
77 | |
78 | void | |
d329e058 | 79 | init_flow (void) |
402209ff | 80 | { |
a930a4ef JH |
81 | if (!cfun->cfg) |
82 | cfun->cfg = ggc_alloc_cleared (sizeof (struct control_flow_graph)); | |
83 | n_edges = 0; | |
997de8ed | 84 | ENTRY_BLOCK_PTR = ggc_alloc_cleared (sizeof (struct basic_block_def)); |
6de9cd9a | 85 | ENTRY_BLOCK_PTR->index = ENTRY_BLOCK; |
997de8ed | 86 | EXIT_BLOCK_PTR = ggc_alloc_cleared (sizeof (struct basic_block_def)); |
6de9cd9a DN |
87 | EXIT_BLOCK_PTR->index = EXIT_BLOCK; |
88 | ENTRY_BLOCK_PTR->next_bb = EXIT_BLOCK_PTR; | |
89 | EXIT_BLOCK_PTR->prev_bb = ENTRY_BLOCK_PTR; | |
402209ff JH |
90 | } |
91 | \f | |
d39ac0fd JH |
92 | /* Helper function for remove_edge and clear_edges. Frees edge structure |
93 | without actually unlinking it from the pred/succ lists. */ | |
94 | ||
95 | static void | |
6de9cd9a | 96 | free_edge (edge e ATTRIBUTE_UNUSED) |
d39ac0fd JH |
97 | { |
98 | n_edges--; | |
80d8221e | 99 | ggc_free (e); |
d39ac0fd JH |
100 | } |
101 | ||
402209ff JH |
102 | /* Free the memory associated with the edge structures. */ |
103 | ||
104 | void | |
d329e058 | 105 | clear_edges (void) |
402209ff | 106 | { |
e0082a72 | 107 | basic_block bb; |
d39ac0fd | 108 | edge e; |
628f6a4e | 109 | edge_iterator ei; |
402209ff | 110 | |
e0082a72 | 111 | FOR_EACH_BB (bb) |
402209ff | 112 | { |
628f6a4e BE |
113 | FOR_EACH_EDGE (e, ei, bb->succs) |
114 | free_edge (e); | |
115 | VEC_truncate (edge, bb->succs, 0); | |
116 | VEC_truncate (edge, bb->preds, 0); | |
d39ac0fd | 117 | } |
4891442b | 118 | |
628f6a4e BE |
119 | FOR_EACH_EDGE (e, ei, ENTRY_BLOCK_PTR->succs) |
120 | free_edge (e); | |
121 | VEC_truncate (edge, EXIT_BLOCK_PTR->preds, 0); | |
122 | VEC_truncate (edge, ENTRY_BLOCK_PTR->succs, 0); | |
402209ff | 123 | |
341c100f | 124 | gcc_assert (!n_edges); |
402209ff JH |
125 | } |
126 | \f | |
ca6c03ca | 127 | /* Allocate memory for basic_block. */ |
402209ff | 128 | |
4262e623 | 129 | basic_block |
d329e058 | 130 | alloc_block (void) |
402209ff JH |
131 | { |
132 | basic_block bb; | |
6de9cd9a | 133 | bb = ggc_alloc_cleared (sizeof (*bb)); |
4262e623 | 134 | return bb; |
402209ff JH |
135 | } |
136 | ||
6de9cd9a DN |
137 | /* Initialize rbi (the structure containing data used by basic block |
138 | duplication and reordering) for the given basic block. */ | |
139 | ||
140 | void | |
141 | initialize_bb_rbi (basic_block bb) | |
142 | { | |
341c100f | 143 | gcc_assert (!bb->rbi); |
997de8ed | 144 | bb->rbi = ggc_alloc_cleared (sizeof (struct reorder_block_def)); |
6de9cd9a DN |
145 | } |
146 | ||
918ed612 ZD |
147 | /* Link block B to chain after AFTER. */ |
148 | void | |
d329e058 | 149 | link_block (basic_block b, basic_block after) |
918ed612 ZD |
150 | { |
151 | b->next_bb = after->next_bb; | |
152 | b->prev_bb = after; | |
153 | after->next_bb = b; | |
154 | b->next_bb->prev_bb = b; | |
155 | } | |
f87c27b4 | 156 | |
918ed612 ZD |
157 | /* Unlink block B from chain. */ |
158 | void | |
d329e058 | 159 | unlink_block (basic_block b) |
918ed612 ZD |
160 | { |
161 | b->next_bb->prev_bb = b->prev_bb; | |
162 | b->prev_bb->next_bb = b->next_bb; | |
6de9cd9a DN |
163 | b->prev_bb = NULL; |
164 | b->next_bb = NULL; | |
918ed612 | 165 | } |
f87c27b4 | 166 | |
bf77398c ZD |
167 | /* Sequentially order blocks and compact the arrays. */ |
168 | void | |
d329e058 | 169 | compact_blocks (void) |
bf77398c ZD |
170 | { |
171 | int i; | |
172 | basic_block bb; | |
d329e058 | 173 | |
bf77398c ZD |
174 | i = 0; |
175 | FOR_EACH_BB (bb) | |
176 | { | |
177 | BASIC_BLOCK (i) = bb; | |
178 | bb->index = i; | |
179 | i++; | |
180 | } | |
181 | ||
341c100f | 182 | gcc_assert (i == n_basic_blocks); |
bf77398c | 183 | |
6de9cd9a DN |
184 | for (; i < last_basic_block; i++) |
185 | BASIC_BLOCK (i) = NULL; | |
186 | ||
bf77398c ZD |
187 | last_basic_block = n_basic_blocks; |
188 | } | |
189 | ||
bf77398c | 190 | /* Remove block B from the basic block array. */ |
402209ff | 191 | |
6a58eee9 | 192 | void |
d329e058 | 193 | expunge_block (basic_block b) |
6a58eee9 | 194 | { |
918ed612 | 195 | unlink_block (b); |
bf77398c ZD |
196 | BASIC_BLOCK (b->index) = NULL; |
197 | n_basic_blocks--; | |
ab3b6795 JH |
198 | /* We should be able to ggc_free here, but we are not. |
199 | The dead SSA_NAMES are left pointing to dead statements that are pointing | |
200 | to dead basic blocks making garbage collector to die. | |
201 | We should be able to release all dead SSA_NAMES and at the same time we should | |
202 | clear out BB pointer of dead statements consistently. */ | |
6a58eee9 | 203 | } |
402209ff | 204 | \f |
adf4a335 KH |
205 | /* Connect E to E->src. */ |
206 | ||
207 | static inline void | |
208 | connect_src (edge e) | |
209 | { | |
d4e6fecb | 210 | VEC_safe_push (edge, gc, e->src->succs, e); |
adf4a335 KH |
211 | } |
212 | ||
213 | /* Connect E to E->dest. */ | |
214 | ||
215 | static inline void | |
216 | connect_dest (edge e) | |
217 | { | |
218 | basic_block dest = e->dest; | |
d4e6fecb | 219 | VEC_safe_push (edge, gc, dest->preds, e); |
adf4a335 KH |
220 | e->dest_idx = EDGE_COUNT (dest->preds) - 1; |
221 | } | |
222 | ||
223 | /* Disconnect edge E from E->src. */ | |
224 | ||
225 | static inline void | |
226 | disconnect_src (edge e) | |
227 | { | |
228 | basic_block src = e->src; | |
229 | edge_iterator ei; | |
230 | edge tmp; | |
231 | ||
232 | for (ei = ei_start (src->succs); (tmp = ei_safe_edge (ei)); ) | |
233 | { | |
234 | if (tmp == e) | |
235 | { | |
236 | VEC_unordered_remove (edge, src->succs, ei.index); | |
237 | return; | |
238 | } | |
239 | else | |
240 | ei_next (&ei); | |
241 | } | |
242 | ||
243 | gcc_unreachable (); | |
244 | } | |
245 | ||
246 | /* Disconnect edge E from E->dest. */ | |
247 | ||
248 | static inline void | |
249 | disconnect_dest (edge e) | |
250 | { | |
251 | basic_block dest = e->dest; | |
252 | unsigned int dest_idx = e->dest_idx; | |
253 | ||
254 | VEC_unordered_remove (edge, dest->preds, dest_idx); | |
255 | ||
256 | /* If we removed an edge in the middle of the edge vector, we need | |
257 | to update dest_idx of the edge that moved into the "hole". */ | |
258 | if (dest_idx < EDGE_COUNT (dest->preds)) | |
259 | EDGE_PRED (dest, dest_idx)->dest_idx = dest_idx; | |
260 | } | |
261 | ||
e0fd3e7a MM |
262 | /* Create an edge connecting SRC and DEST with flags FLAGS. Return newly |
263 | created edge. Use this only if you are sure that this edge can't | |
264 | possibly already exist. */ | |
265 | ||
266 | edge | |
d329e058 | 267 | unchecked_make_edge (basic_block src, basic_block dst, int flags) |
e0fd3e7a MM |
268 | { |
269 | edge e; | |
6de9cd9a | 270 | e = ggc_alloc_cleared (sizeof (*e)); |
e0fd3e7a MM |
271 | n_edges++; |
272 | ||
e0fd3e7a MM |
273 | e->src = src; |
274 | e->dest = dst; | |
275 | e->flags = flags; | |
adf4a335 KH |
276 | |
277 | connect_src (e); | |
278 | connect_dest (e); | |
e0fd3e7a | 279 | |
d9d4706f KH |
280 | execute_on_growing_pred (e); |
281 | ||
e0fd3e7a MM |
282 | return e; |
283 | } | |
284 | ||
7ded4467 | 285 | /* Create an edge connecting SRC and DST with FLAGS optionally using |
2ba84f36 | 286 | edge cache CACHE. Return the new edge, NULL if already exist. */ |
4262e623 | 287 | |
7ded4467 | 288 | edge |
a6ee1a15 | 289 | cached_make_edge (sbitmap edge_cache, basic_block src, basic_block dst, int flags) |
402209ff | 290 | { |
e2c879a1 KH |
291 | if (edge_cache == NULL |
292 | || src == ENTRY_BLOCK_PTR | |
293 | || dst == EXIT_BLOCK_PTR) | |
294 | return make_edge (src, dst, flags); | |
402209ff | 295 | |
e2c879a1 | 296 | /* Does the requested edge already exist? */ |
a6ee1a15 | 297 | if (! TEST_BIT (edge_cache, dst->index)) |
402209ff | 298 | { |
e2c879a1 KH |
299 | /* The edge does not exist. Create one and update the |
300 | cache. */ | |
a6ee1a15 | 301 | SET_BIT (edge_cache, dst->index); |
e2c879a1 | 302 | return unchecked_make_edge (src, dst, flags); |
402209ff | 303 | } |
d329e058 | 304 | |
e2c879a1 KH |
305 | /* At this point, we know that the requested edge exists. Adjust |
306 | flags if necessary. */ | |
307 | if (flags) | |
308 | { | |
309 | edge e = find_edge (src, dst); | |
310 | e->flags |= flags; | |
311 | } | |
7ded4467 | 312 | |
e2c879a1 | 313 | return NULL; |
7ded4467 JH |
314 | } |
315 | ||
316 | /* Create an edge connecting SRC and DEST with flags FLAGS. Return newly | |
317 | created edge or NULL if already exist. */ | |
318 | ||
319 | edge | |
d329e058 | 320 | make_edge (basic_block src, basic_block dest, int flags) |
7ded4467 | 321 | { |
e2c879a1 KH |
322 | edge e = find_edge (src, dest); |
323 | ||
324 | /* Make sure we don't add duplicate edges. */ | |
325 | if (e) | |
326 | { | |
327 | e->flags |= flags; | |
328 | return NULL; | |
329 | } | |
330 | ||
331 | return unchecked_make_edge (src, dest, flags); | |
7ded4467 JH |
332 | } |
333 | ||
eaec9b3d | 334 | /* Create an edge connecting SRC to DEST and set probability by knowing |
7ded4467 JH |
335 | that it is the single edge leaving SRC. */ |
336 | ||
337 | edge | |
d329e058 | 338 | make_single_succ_edge (basic_block src, basic_block dest, int flags) |
7ded4467 JH |
339 | { |
340 | edge e = make_edge (src, dest, flags); | |
341 | ||
342 | e->probability = REG_BR_PROB_BASE; | |
343 | e->count = src->count; | |
344 | return e; | |
402209ff JH |
345 | } |
346 | ||
347 | /* This function will remove an edge from the flow graph. */ | |
348 | ||
349 | void | |
d329e058 | 350 | remove_edge (edge e) |
402209ff | 351 | { |
3809e990 | 352 | remove_predictions_associated_with_edge (e); |
d9d4706f KH |
353 | execute_on_shrinking_pred (e); |
354 | ||
adf4a335 KH |
355 | disconnect_src (e); |
356 | disconnect_dest (e); | |
402209ff | 357 | |
d39ac0fd | 358 | free_edge (e); |
402209ff JH |
359 | } |
360 | ||
361 | /* Redirect an edge's successor from one block to another. */ | |
362 | ||
363 | void | |
d329e058 | 364 | redirect_edge_succ (edge e, basic_block new_succ) |
402209ff | 365 | { |
d9d4706f KH |
366 | execute_on_shrinking_pred (e); |
367 | ||
adf4a335 | 368 | disconnect_dest (e); |
628f6a4e | 369 | |
adf4a335 | 370 | e->dest = new_succ; |
402209ff JH |
371 | |
372 | /* Reconnect the edge to the new successor block. */ | |
adf4a335 KH |
373 | connect_dest (e); |
374 | ||
d9d4706f | 375 | execute_on_growing_pred (e); |
402209ff JH |
376 | } |
377 | ||
eaec9b3d | 378 | /* Like previous but avoid possible duplicate edge. */ |
402209ff JH |
379 | |
380 | edge | |
d329e058 | 381 | redirect_edge_succ_nodup (edge e, basic_block new_succ) |
402209ff JH |
382 | { |
383 | edge s; | |
4891442b | 384 | |
df95526b JL |
385 | s = find_edge (e->src, new_succ); |
386 | if (s && s != e) | |
402209ff JH |
387 | { |
388 | s->flags |= e->flags; | |
389 | s->probability += e->probability; | |
77abb5d8 JH |
390 | if (s->probability > REG_BR_PROB_BASE) |
391 | s->probability = REG_BR_PROB_BASE; | |
402209ff JH |
392 | s->count += e->count; |
393 | remove_edge (e); | |
394 | e = s; | |
395 | } | |
396 | else | |
397 | redirect_edge_succ (e, new_succ); | |
4891442b | 398 | |
402209ff JH |
399 | return e; |
400 | } | |
401 | ||
402 | /* Redirect an edge's predecessor from one block to another. */ | |
403 | ||
404 | void | |
d329e058 | 405 | redirect_edge_pred (edge e, basic_block new_pred) |
402209ff | 406 | { |
adf4a335 | 407 | disconnect_src (e); |
402209ff | 408 | |
adf4a335 | 409 | e->src = new_pred; |
402209ff JH |
410 | |
411 | /* Reconnect the edge to the new predecessor block. */ | |
adf4a335 | 412 | connect_src (e); |
402209ff | 413 | } |
38c1593d | 414 | |
51a904c9 | 415 | /* Clear all basic block flags, with the exception of partitioning. */ |
38c1593d | 416 | void |
d329e058 | 417 | clear_bb_flags (void) |
38c1593d | 418 | { |
e0082a72 ZD |
419 | basic_block bb; |
420 | ||
421 | FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR, NULL, next_bb) | |
f73d5666 | 422 | bb->flags = BB_PARTITION (bb) | (bb->flags & BB_DISABLE_SCHEDULE); |
38c1593d | 423 | } |
402209ff | 424 | \f |
878f99d2 JH |
425 | /* Check the consistency of profile information. We can't do that |
426 | in verify_flow_info, as the counts may get invalid for incompletely | |
427 | solved graphs, later eliminating of conditionals or roundoff errors. | |
428 | It is still practical to have them reported for debugging of simple | |
429 | testcases. */ | |
430 | void | |
431 | check_bb_profile (basic_block bb, FILE * file) | |
432 | { | |
433 | edge e; | |
434 | int sum = 0; | |
435 | gcov_type lsum; | |
628f6a4e | 436 | edge_iterator ei; |
878f99d2 JH |
437 | |
438 | if (profile_status == PROFILE_ABSENT) | |
439 | return; | |
440 | ||
441 | if (bb != EXIT_BLOCK_PTR) | |
442 | { | |
628f6a4e | 443 | FOR_EACH_EDGE (e, ei, bb->succs) |
878f99d2 | 444 | sum += e->probability; |
628f6a4e | 445 | if (EDGE_COUNT (bb->succs) && abs (sum - REG_BR_PROB_BASE) > 100) |
878f99d2 JH |
446 | fprintf (file, "Invalid sum of outgoing probabilities %.1f%%\n", |
447 | sum * 100.0 / REG_BR_PROB_BASE); | |
448 | lsum = 0; | |
628f6a4e | 449 | FOR_EACH_EDGE (e, ei, bb->succs) |
878f99d2 | 450 | lsum += e->count; |
628f6a4e BE |
451 | if (EDGE_COUNT (bb->succs) |
452 | && (lsum - bb->count > 100 || lsum - bb->count < -100)) | |
878f99d2 JH |
453 | fprintf (file, "Invalid sum of outgoing counts %i, should be %i\n", |
454 | (int) lsum, (int) bb->count); | |
455 | } | |
456 | if (bb != ENTRY_BLOCK_PTR) | |
457 | { | |
458 | sum = 0; | |
628f6a4e | 459 | FOR_EACH_EDGE (e, ei, bb->preds) |
878f99d2 JH |
460 | sum += EDGE_FREQUENCY (e); |
461 | if (abs (sum - bb->frequency) > 100) | |
462 | fprintf (file, | |
2e6ae27f | 463 | "Invalid sum of incoming frequencies %i, should be %i\n", |
878f99d2 JH |
464 | sum, bb->frequency); |
465 | lsum = 0; | |
628f6a4e | 466 | FOR_EACH_EDGE (e, ei, bb->preds) |
878f99d2 JH |
467 | lsum += e->count; |
468 | if (lsum - bb->count > 100 || lsum - bb->count < -100) | |
2e6ae27f | 469 | fprintf (file, "Invalid sum of incoming counts %i, should be %i\n", |
878f99d2 JH |
470 | (int) lsum, (int) bb->count); |
471 | } | |
472 | } | |
473 | \f | |
ca6c03ca | 474 | void |
d329e058 | 475 | dump_flow_info (FILE *file) |
402209ff | 476 | { |
e0082a72 | 477 | basic_block bb; |
ca6c03ca | 478 | |
57d52c81 RH |
479 | /* There are no pseudo registers after reload. Don't dump them. */ |
480 | if (reg_n_info && !reload_completed) | |
6de9cd9a | 481 | { |
f34ac626 RH |
482 | unsigned int i, max = max_reg_num (); |
483 | fprintf (file, "%d registers.\n", max); | |
484 | for (i = FIRST_PSEUDO_REGISTER; i < max; i++) | |
6de9cd9a DN |
485 | if (REG_N_REFS (i)) |
486 | { | |
487 | enum reg_class class, altclass; | |
488 | ||
489 | fprintf (file, "\nRegister %d used %d times across %d insns", | |
490 | i, REG_N_REFS (i), REG_LIVE_LENGTH (i)); | |
491 | if (REG_BASIC_BLOCK (i) >= 0) | |
492 | fprintf (file, " in block %d", REG_BASIC_BLOCK (i)); | |
493 | if (REG_N_SETS (i)) | |
494 | fprintf (file, "; set %d time%s", REG_N_SETS (i), | |
495 | (REG_N_SETS (i) == 1) ? "" : "s"); | |
496 | if (regno_reg_rtx[i] != NULL && REG_USERVAR_P (regno_reg_rtx[i])) | |
497 | fprintf (file, "; user var"); | |
498 | if (REG_N_DEATHS (i) != 1) | |
499 | fprintf (file, "; dies in %d places", REG_N_DEATHS (i)); | |
500 | if (REG_N_CALLS_CROSSED (i) == 1) | |
501 | fprintf (file, "; crosses 1 call"); | |
502 | else if (REG_N_CALLS_CROSSED (i)) | |
503 | fprintf (file, "; crosses %d calls", REG_N_CALLS_CROSSED (i)); | |
504 | if (regno_reg_rtx[i] != NULL | |
505 | && PSEUDO_REGNO_BYTES (i) != UNITS_PER_WORD) | |
506 | fprintf (file, "; %d bytes", PSEUDO_REGNO_BYTES (i)); | |
507 | ||
508 | class = reg_preferred_class (i); | |
509 | altclass = reg_alternate_class (i); | |
510 | if (class != GENERAL_REGS || altclass != ALL_REGS) | |
511 | { | |
512 | if (altclass == ALL_REGS || class == ALL_REGS) | |
513 | fprintf (file, "; pref %s", reg_class_names[(int) class]); | |
514 | else if (altclass == NO_REGS) | |
515 | fprintf (file, "; %s or none", reg_class_names[(int) class]); | |
516 | else | |
517 | fprintf (file, "; pref %s, else %s", | |
518 | reg_class_names[(int) class], | |
519 | reg_class_names[(int) altclass]); | |
520 | } | |
521 | ||
522 | if (regno_reg_rtx[i] != NULL && REG_POINTER (regno_reg_rtx[i])) | |
523 | fprintf (file, "; pointer"); | |
524 | fprintf (file, ".\n"); | |
525 | } | |
526 | } | |
ca6c03ca | 527 | |
0b17ab2f | 528 | fprintf (file, "\n%d basic blocks, %d edges.\n", n_basic_blocks, n_edges); |
e0082a72 | 529 | FOR_EACH_BB (bb) |
ca6c03ca | 530 | { |
b3694847 | 531 | edge e; |
628f6a4e | 532 | edge_iterator ei; |
ca6c03ca | 533 | |
6de9cd9a | 534 | fprintf (file, "\nBasic block %d ", bb->index); |
918ed612 ZD |
535 | fprintf (file, "prev %d, next %d, ", |
536 | bb->prev_bb->index, bb->next_bb->index); | |
4891442b RK |
537 | fprintf (file, "loop_depth %d, count ", bb->loop_depth); |
538 | fprintf (file, HOST_WIDEST_INT_PRINT_DEC, bb->count); | |
0f72964f JH |
539 | fprintf (file, ", freq %i", bb->frequency); |
540 | if (maybe_hot_bb_p (bb)) | |
541 | fprintf (file, ", maybe hot"); | |
542 | if (probably_never_executed_bb_p (bb)) | |
543 | fprintf (file, ", probably never executed"); | |
291cc0fe | 544 | fprintf (file, ".\n"); |
402209ff | 545 | |
ca6c03ca | 546 | fprintf (file, "Predecessors: "); |
628f6a4e | 547 | FOR_EACH_EDGE (e, ei, bb->preds) |
ca6c03ca | 548 | dump_edge_info (file, e, 0); |
402209ff | 549 | |
ca6c03ca | 550 | fprintf (file, "\nSuccessors: "); |
628f6a4e | 551 | FOR_EACH_EDGE (e, ei, bb->succs) |
ca6c03ca | 552 | dump_edge_info (file, e, 1); |
402209ff | 553 | |
878f99d2 JH |
554 | if (bb->global_live_at_start) |
555 | { | |
556 | fprintf (file, "\nRegisters live at start:"); | |
557 | dump_regset (bb->global_live_at_start, file); | |
558 | } | |
559 | ||
560 | if (bb->global_live_at_end) | |
561 | { | |
562 | fprintf (file, "\nRegisters live at end:"); | |
563 | dump_regset (bb->global_live_at_end, file); | |
564 | } | |
565 | ||
566 | putc ('\n', file); | |
567 | check_bb_profile (bb, file); | |
402209ff JH |
568 | } |
569 | ||
ca6c03ca | 570 | putc ('\n', file); |
402209ff JH |
571 | } |
572 | ||
ca6c03ca | 573 | void |
d329e058 | 574 | debug_flow_info (void) |
ca6c03ca JH |
575 | { |
576 | dump_flow_info (stderr); | |
577 | } | |
402209ff JH |
578 | |
579 | void | |
d329e058 | 580 | dump_edge_info (FILE *file, edge e, int do_succ) |
402209ff | 581 | { |
ca6c03ca JH |
582 | basic_block side = (do_succ ? e->dest : e->src); |
583 | ||
584 | if (side == ENTRY_BLOCK_PTR) | |
585 | fputs (" ENTRY", file); | |
586 | else if (side == EXIT_BLOCK_PTR) | |
587 | fputs (" EXIT", file); | |
588 | else | |
0b17ab2f | 589 | fprintf (file, " %d", side->index); |
ca6c03ca JH |
590 | |
591 | if (e->probability) | |
592 | fprintf (file, " [%.1f%%] ", e->probability * 100.0 / REG_BR_PROB_BASE); | |
402209ff | 593 | |
ca6c03ca | 594 | if (e->count) |
402209ff | 595 | { |
ca6c03ca | 596 | fprintf (file, " count:"); |
4891442b | 597 | fprintf (file, HOST_WIDEST_INT_PRINT_DEC, e->count); |
402209ff JH |
598 | } |
599 | ||
ca6c03ca | 600 | if (e->flags) |
402209ff | 601 | { |
1722c2c8 RH |
602 | static const char * const bitnames[] = { |
603 | "fallthru", "ab", "abcall", "eh", "fake", "dfs_back", | |
6de9cd9a DN |
604 | "can_fallthru", "irreducible", "sibcall", "loop_exit", |
605 | "true", "false", "exec" | |
1722c2c8 | 606 | }; |
ca6c03ca JH |
607 | int comma = 0; |
608 | int i, flags = e->flags; | |
402209ff | 609 | |
4891442b | 610 | fputs (" (", file); |
402209ff JH |
611 | for (i = 0; flags; i++) |
612 | if (flags & (1 << i)) | |
613 | { | |
614 | flags &= ~(1 << i); | |
615 | ||
616 | if (comma) | |
617 | fputc (',', file); | |
618 | if (i < (int) ARRAY_SIZE (bitnames)) | |
619 | fputs (bitnames[i], file); | |
620 | else | |
621 | fprintf (file, "%d", i); | |
622 | comma = 1; | |
623 | } | |
4891442b | 624 | |
402209ff JH |
625 | fputc (')', file); |
626 | } | |
627 | } | |
628 | \f | |
ff7cc307 | 629 | /* Simple routines to easily allocate AUX fields of basic blocks. */ |
4891442b | 630 | |
ca6c03ca JH |
631 | static struct obstack block_aux_obstack; |
632 | static void *first_block_aux_obj = 0; | |
633 | static struct obstack edge_aux_obstack; | |
634 | static void *first_edge_aux_obj = 0; | |
402209ff | 635 | |
09da1532 | 636 | /* Allocate a memory block of SIZE as BB->aux. The obstack must |
ca6c03ca | 637 | be first initialized by alloc_aux_for_blocks. */ |
402209ff | 638 | |
ca6c03ca | 639 | inline void |
d329e058 | 640 | alloc_aux_for_block (basic_block bb, int size) |
402209ff | 641 | { |
ca6c03ca | 642 | /* Verify that aux field is clear. */ |
341c100f | 643 | gcc_assert (!bb->aux && first_block_aux_obj); |
ca6c03ca JH |
644 | bb->aux = obstack_alloc (&block_aux_obstack, size); |
645 | memset (bb->aux, 0, size); | |
402209ff JH |
646 | } |
647 | ||
ca6c03ca JH |
648 | /* Initialize the block_aux_obstack and if SIZE is nonzero, call |
649 | alloc_aux_for_block for each basic block. */ | |
402209ff JH |
650 | |
651 | void | |
d329e058 | 652 | alloc_aux_for_blocks (int size) |
402209ff | 653 | { |
ca6c03ca | 654 | static int initialized; |
402209ff | 655 | |
ca6c03ca | 656 | if (!initialized) |
402209ff | 657 | { |
ca6c03ca JH |
658 | gcc_obstack_init (&block_aux_obstack); |
659 | initialized = 1; | |
402209ff | 660 | } |
341c100f NS |
661 | else |
662 | /* Check whether AUX data are still allocated. */ | |
663 | gcc_assert (!first_block_aux_obj); | |
664 | ||
703ad42b | 665 | first_block_aux_obj = obstack_alloc (&block_aux_obstack, 0); |
ca6c03ca | 666 | if (size) |
402209ff | 667 | { |
e0082a72 | 668 | basic_block bb; |
4891442b | 669 | |
e0082a72 ZD |
670 | FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR, NULL, next_bb) |
671 | alloc_aux_for_block (bb, size); | |
402209ff JH |
672 | } |
673 | } | |
ca6c03ca | 674 | |
108c1afc | 675 | /* Clear AUX pointers of all blocks. */ |
402209ff JH |
676 | |
677 | void | |
d329e058 | 678 | clear_aux_for_blocks (void) |
402209ff | 679 | { |
e0082a72 | 680 | basic_block bb; |
4891442b | 681 | |
e0082a72 ZD |
682 | FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR, NULL, next_bb) |
683 | bb->aux = NULL; | |
108c1afc RH |
684 | } |
685 | ||
686 | /* Free data allocated in block_aux_obstack and clear AUX pointers | |
687 | of all blocks. */ | |
688 | ||
689 | void | |
d329e058 | 690 | free_aux_for_blocks (void) |
108c1afc | 691 | { |
341c100f | 692 | gcc_assert (first_block_aux_obj); |
108c1afc | 693 | obstack_free (&block_aux_obstack, first_block_aux_obj); |
ca6c03ca | 694 | first_block_aux_obj = NULL; |
108c1afc RH |
695 | |
696 | clear_aux_for_blocks (); | |
ca6c03ca | 697 | } |
402209ff | 698 | |
09da1532 | 699 | /* Allocate a memory edge of SIZE as BB->aux. The obstack must |
ca6c03ca | 700 | be first initialized by alloc_aux_for_edges. */ |
402209ff | 701 | |
ca6c03ca | 702 | inline void |
d329e058 | 703 | alloc_aux_for_edge (edge e, int size) |
ca6c03ca JH |
704 | { |
705 | /* Verify that aux field is clear. */ | |
341c100f | 706 | gcc_assert (!e->aux && first_edge_aux_obj); |
ca6c03ca JH |
707 | e->aux = obstack_alloc (&edge_aux_obstack, size); |
708 | memset (e->aux, 0, size); | |
709 | } | |
402209ff | 710 | |
ca6c03ca JH |
711 | /* Initialize the edge_aux_obstack and if SIZE is nonzero, call |
712 | alloc_aux_for_edge for each basic edge. */ | |
402209ff | 713 | |
ca6c03ca | 714 | void |
d329e058 | 715 | alloc_aux_for_edges (int size) |
ca6c03ca JH |
716 | { |
717 | static int initialized; | |
402209ff | 718 | |
ca6c03ca JH |
719 | if (!initialized) |
720 | { | |
721 | gcc_obstack_init (&edge_aux_obstack); | |
722 | initialized = 1; | |
402209ff | 723 | } |
341c100f NS |
724 | else |
725 | /* Check whether AUX data are still allocated. */ | |
726 | gcc_assert (!first_edge_aux_obj); | |
4891442b | 727 | |
703ad42b | 728 | first_edge_aux_obj = obstack_alloc (&edge_aux_obstack, 0); |
ca6c03ca | 729 | if (size) |
402209ff | 730 | { |
e0082a72 ZD |
731 | basic_block bb; |
732 | ||
733 | FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR, EXIT_BLOCK_PTR, next_bb) | |
402209ff | 734 | { |
ca6c03ca | 735 | edge e; |
628f6a4e | 736 | edge_iterator ei; |
ca6c03ca | 737 | |
628f6a4e | 738 | FOR_EACH_EDGE (e, ei, bb->succs) |
ca6c03ca | 739 | alloc_aux_for_edge (e, size); |
402209ff | 740 | } |
402209ff | 741 | } |
402209ff | 742 | } |
402209ff | 743 | |
108c1afc | 744 | /* Clear AUX pointers of all edges. */ |
ca6c03ca JH |
745 | |
746 | void | |
d329e058 | 747 | clear_aux_for_edges (void) |
402209ff | 748 | { |
e0082a72 ZD |
749 | basic_block bb; |
750 | edge e; | |
402209ff | 751 | |
e0082a72 | 752 | FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR, EXIT_BLOCK_PTR, next_bb) |
402209ff | 753 | { |
628f6a4e BE |
754 | edge_iterator ei; |
755 | FOR_EACH_EDGE (e, ei, bb->succs) | |
ca6c03ca | 756 | e->aux = NULL; |
402209ff | 757 | } |
108c1afc RH |
758 | } |
759 | ||
760 | /* Free data allocated in edge_aux_obstack and clear AUX pointers | |
761 | of all edges. */ | |
762 | ||
763 | void | |
d329e058 | 764 | free_aux_for_edges (void) |
108c1afc | 765 | { |
341c100f | 766 | gcc_assert (first_edge_aux_obj); |
108c1afc | 767 | obstack_free (&edge_aux_obstack, first_edge_aux_obj); |
ca6c03ca | 768 | first_edge_aux_obj = NULL; |
108c1afc RH |
769 | |
770 | clear_aux_for_edges (); | |
402209ff | 771 | } |
9ee634e3 | 772 | |
10e9fecc | 773 | void |
d329e058 | 774 | debug_bb (basic_block bb) |
10e9fecc | 775 | { |
f470c378 | 776 | dump_bb (bb, stderr, 0); |
10e9fecc JH |
777 | } |
778 | ||
779 | basic_block | |
d329e058 | 780 | debug_bb_n (int n) |
10e9fecc JH |
781 | { |
782 | basic_block bb = BASIC_BLOCK (n); | |
f470c378 | 783 | dump_bb (bb, stderr, 0); |
10e9fecc | 784 | return bb; |
9ee634e3 | 785 | } |
6de9cd9a DN |
786 | |
787 | /* Dumps cfg related information about basic block BB to FILE. */ | |
788 | ||
789 | static void | |
790 | dump_cfg_bb_info (FILE *file, basic_block bb) | |
791 | { | |
792 | unsigned i; | |
628f6a4e | 793 | edge_iterator ei; |
6de9cd9a DN |
794 | bool first = true; |
795 | static const char * const bb_bitnames[] = | |
796 | { | |
797 | "dirty", "new", "reachable", "visited", "irreducible_loop", "superblock" | |
798 | }; | |
799 | const unsigned n_bitnames = sizeof (bb_bitnames) / sizeof (char *); | |
800 | edge e; | |
801 | ||
802 | fprintf (file, "Basic block %d", bb->index); | |
803 | for (i = 0; i < n_bitnames; i++) | |
804 | if (bb->flags & (1 << i)) | |
805 | { | |
806 | if (first) | |
807 | fprintf (file, " ("); | |
808 | else | |
809 | fprintf (file, ", "); | |
810 | first = false; | |
811 | fprintf (file, bb_bitnames[i]); | |
812 | } | |
813 | if (!first) | |
814 | fprintf (file, ")"); | |
815 | fprintf (file, "\n"); | |
816 | ||
817 | fprintf (file, "Predecessors: "); | |
628f6a4e | 818 | FOR_EACH_EDGE (e, ei, bb->preds) |
6de9cd9a DN |
819 | dump_edge_info (file, e, 0); |
820 | ||
821 | fprintf (file, "\nSuccessors: "); | |
628f6a4e | 822 | FOR_EACH_EDGE (e, ei, bb->succs) |
6de9cd9a DN |
823 | dump_edge_info (file, e, 1); |
824 | fprintf (file, "\n\n"); | |
825 | } | |
826 | ||
827 | /* Dumps a brief description of cfg to FILE. */ | |
828 | ||
829 | void | |
830 | brief_dump_cfg (FILE *file) | |
831 | { | |
832 | basic_block bb; | |
833 | ||
834 | FOR_EACH_BB (bb) | |
835 | { | |
836 | dump_cfg_bb_info (file, bb); | |
837 | } | |
838 | } | |
15db5571 JH |
839 | |
840 | /* An edge originally destinating BB of FREQUENCY and COUNT has been proved to | |
841 | leave the block by TAKEN_EDGE. Update profile of BB such that edge E can be | |
d4a9b3a3 | 842 | redirected to destination of TAKEN_EDGE. |
15db5571 JH |
843 | |
844 | This function may leave the profile inconsistent in the case TAKEN_EDGE | |
845 | frequency or count is believed to be lower than FREQUENCY or COUNT | |
d4a9b3a3 | 846 | respectively. */ |
15db5571 JH |
847 | void |
848 | update_bb_profile_for_threading (basic_block bb, int edge_frequency, | |
849 | gcov_type count, edge taken_edge) | |
850 | { | |
851 | edge c; | |
852 | int prob; | |
628f6a4e | 853 | edge_iterator ei; |
15db5571 JH |
854 | |
855 | bb->count -= count; | |
856 | if (bb->count < 0) | |
857 | bb->count = 0; | |
858 | ||
859 | /* Compute the probability of TAKEN_EDGE being reached via threaded edge. | |
860 | Watch for overflows. */ | |
861 | if (bb->frequency) | |
862 | prob = edge_frequency * REG_BR_PROB_BASE / bb->frequency; | |
863 | else | |
864 | prob = 0; | |
865 | if (prob > taken_edge->probability) | |
866 | { | |
867 | if (dump_file) | |
868 | fprintf (dump_file, "Jump threading proved probability of edge " | |
869 | "%i->%i too small (it is %i, should be %i).\n", | |
870 | taken_edge->src->index, taken_edge->dest->index, | |
871 | taken_edge->probability, prob); | |
872 | prob = taken_edge->probability; | |
873 | } | |
874 | ||
875 | /* Now rescale the probabilities. */ | |
876 | taken_edge->probability -= prob; | |
877 | prob = REG_BR_PROB_BASE - prob; | |
878 | bb->frequency -= edge_frequency; | |
879 | if (bb->frequency < 0) | |
880 | bb->frequency = 0; | |
881 | if (prob <= 0) | |
882 | { | |
883 | if (dump_file) | |
884 | fprintf (dump_file, "Edge frequencies of bb %i has been reset, " | |
885 | "frequency of block should end up being 0, it is %i\n", | |
886 | bb->index, bb->frequency); | |
628f6a4e BE |
887 | EDGE_SUCC (bb, 0)->probability = REG_BR_PROB_BASE; |
888 | ei = ei_start (bb->succs); | |
889 | ei_next (&ei); | |
890 | for (; (c = ei_safe_edge (ei)); ei_next (&ei)) | |
15db5571 JH |
891 | c->probability = 0; |
892 | } | |
763ea904 JL |
893 | else if (prob != REG_BR_PROB_BASE) |
894 | { | |
33156717 | 895 | int scale = 65536 * REG_BR_PROB_BASE / prob; |
763ea904 JL |
896 | |
897 | FOR_EACH_EDGE (c, ei, bb->succs) | |
33156717 | 898 | c->probability *= scale / 65536; |
763ea904 | 899 | } |
15db5571 | 900 | |
41806d92 | 901 | gcc_assert (bb == taken_edge->src); |
15db5571 JH |
902 | taken_edge->count -= count; |
903 | if (taken_edge->count < 0) | |
904 | taken_edge->count = 0; | |
905 | } | |
33156717 JH |
906 | |
907 | /* Multiply all frequencies of basic blocks in array BBS of length NBBS | |
908 | by NUM/DEN, in int arithmetic. May lose some accuracy. */ | |
909 | void | |
910 | scale_bbs_frequencies_int (basic_block *bbs, int nbbs, int num, int den) | |
911 | { | |
912 | int i; | |
913 | edge e; | |
914 | for (i = 0; i < nbbs; i++) | |
915 | { | |
916 | edge_iterator ei; | |
917 | bbs[i]->frequency = (bbs[i]->frequency * num) / den; | |
918 | bbs[i]->count = RDIV (bbs[i]->count * num, den); | |
919 | FOR_EACH_EDGE (e, ei, bbs[i]->succs) | |
920 | e->count = (e->count * num) /den; | |
921 | } | |
922 | } | |
923 | ||
924 | /* Multiply all frequencies of basic blocks in array BBS of length NBBS | |
925 | by NUM/DEN, in gcov_type arithmetic. More accurate than previous | |
926 | function but considerably slower. */ | |
927 | void | |
928 | scale_bbs_frequencies_gcov_type (basic_block *bbs, int nbbs, gcov_type num, | |
929 | gcov_type den) | |
930 | { | |
931 | int i; | |
932 | edge e; | |
933 | ||
934 | for (i = 0; i < nbbs; i++) | |
935 | { | |
936 | edge_iterator ei; | |
937 | bbs[i]->frequency = (bbs[i]->frequency * num) / den; | |
938 | bbs[i]->count = RDIV (bbs[i]->count * num, den); | |
939 | FOR_EACH_EDGE (e, ei, bbs[i]->succs) | |
940 | e->count = (e->count * num) /den; | |
941 | } | |
942 | } |