]>
Commit | Line | Data |
---|---|---|
9ee634e3 | 1 | /* Hooks for cfg representation specific functions. |
7adcbafe | 2 | Copyright (C) 2003-2022 Free Software Foundation, Inc. |
9ee634e3 JH |
3 | Contributed by Sebastian Pop <s.pop@laposte.net> |
4 | ||
5 | This file is part of GCC. | |
6 | ||
7 | GCC is free software; you can redistribute it and/or modify | |
8 | it under the terms of the GNU General Public License as published by | |
9dcd6f09 | 9 | the Free Software Foundation; either version 3, or (at your option) |
9ee634e3 JH |
10 | any later version. |
11 | ||
12 | GCC is distributed in the hope that it will be useful, | |
13 | but WITHOUT ANY WARRANTY; without even the implied warranty of | |
14 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
15 | GNU General Public License for more details. | |
16 | ||
17 | You should have received a copy of the GNU General Public License | |
9dcd6f09 NC |
18 | along with GCC; see the file COPYING3. If not see |
19 | <http://www.gnu.org/licenses/>. */ | |
9ee634e3 JH |
20 | |
21 | #include "config.h" | |
22 | #include "system.h" | |
23 | #include "coretypes.h" | |
c7131fb2 | 24 | #include "backend.h" |
957060b5 | 25 | #include "rtl.h" |
9fdcd34e | 26 | #include "cfghooks.h" |
957060b5 AM |
27 | #include "timevar.h" |
28 | #include "pretty-print.h" | |
29 | #include "diagnostic-core.h" | |
30 | #include "dumpfile.h" | |
60393bbc | 31 | #include "cfganal.h" |
7a300452 | 32 | #include "tree-ssa.h" |
598ec7bd | 33 | #include "cfgloop.h" |
d1471457 JH |
34 | #include "sreal.h" |
35 | #include "profile.h" | |
9ee634e3 | 36 | |
0ecf545c MS |
37 | /* Disable warnings about missing quoting in GCC diagnostics. */ |
38 | #if __GNUC__ >= 10 | |
39 | # pragma GCC diagnostic push | |
40 | # pragma GCC diagnostic ignored "-Wformat-diag" | |
41 | #endif | |
42 | ||
9ee634e3 | 43 | /* A pointer to one of the hooks containers. */ |
f470c378 | 44 | static struct cfg_hooks *cfg_hooks; |
9ee634e3 JH |
45 | |
46 | /* Initialization of functions specific to the rtl IR. */ | |
d329e058 AJ |
47 | void |
48 | rtl_register_cfg_hooks (void) | |
9ee634e3 JH |
49 | { |
50 | cfg_hooks = &rtl_cfg_hooks; | |
51 | } | |
52 | ||
53 | /* Initialization of functions specific to the rtl IR. */ | |
d329e058 AJ |
54 | void |
55 | cfg_layout_rtl_register_cfg_hooks (void) | |
9ee634e3 JH |
56 | { |
57 | cfg_hooks = &cfg_layout_rtl_cfg_hooks; | |
58 | } | |
f470c378 | 59 | |
6de9cd9a DN |
60 | /* Initialization of functions specific to the tree IR. */ |
61 | ||
62 | void | |
726a989a | 63 | gimple_register_cfg_hooks (void) |
6de9cd9a | 64 | { |
726a989a | 65 | cfg_hooks = &gimple_cfg_hooks; |
6de9cd9a DN |
66 | } |
67 | ||
e855c69d AB |
68 | struct cfg_hooks |
69 | get_cfg_hooks (void) | |
70 | { | |
71 | return *cfg_hooks; | |
72 | } | |
73 | ||
74 | void | |
75 | set_cfg_hooks (struct cfg_hooks new_cfg_hooks) | |
76 | { | |
77 | *cfg_hooks = new_cfg_hooks; | |
78 | } | |
79 | ||
52bca999 | 80 | /* Returns current ir type. */ |
6de9cd9a | 81 | |
52bca999 SB |
82 | enum ir_type |
83 | current_ir_type (void) | |
6de9cd9a | 84 | { |
726a989a | 85 | if (cfg_hooks == &gimple_cfg_hooks) |
52bca999 SB |
86 | return IR_GIMPLE; |
87 | else if (cfg_hooks == &rtl_cfg_hooks) | |
88 | return IR_RTL_CFGRTL; | |
89 | else if (cfg_hooks == &cfg_layout_rtl_cfg_hooks) | |
90 | return IR_RTL_CFGLAYOUT; | |
91 | else | |
92 | gcc_unreachable (); | |
6de9cd9a DN |
93 | } |
94 | ||
f470c378 ZD |
95 | /* Verify the CFG consistency. |
96 | ||
97 | Currently it does following: checks edge and basic block list correctness | |
98 | and calls into IL dependent checking then. */ | |
99 | ||
24e47c76 | 100 | DEBUG_FUNCTION void |
f470c378 ZD |
101 | verify_flow_info (void) |
102 | { | |
103 | size_t *edge_checksum; | |
50f63b1a | 104 | int err = 0; |
f470c378 ZD |
105 | basic_block bb, last_bb_seen; |
106 | basic_block *last_visited; | |
107 | ||
108 | timevar_push (TV_CFG_VERIFY); | |
8b1c6fd7 DM |
109 | last_visited = XCNEWVEC (basic_block, last_basic_block_for_fn (cfun)); |
110 | edge_checksum = XCNEWVEC (size_t, last_basic_block_for_fn (cfun)); | |
f470c378 ZD |
111 | |
112 | /* Check bb chain & numbers. */ | |
fefa31b5 DM |
113 | last_bb_seen = ENTRY_BLOCK_PTR_FOR_FN (cfun); |
114 | FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR_FOR_FN (cfun)->next_bb, NULL, next_bb) | |
f470c378 | 115 | { |
fefa31b5 | 116 | if (bb != EXIT_BLOCK_PTR_FOR_FN (cfun) |
06e28de2 | 117 | && bb != BASIC_BLOCK_FOR_FN (cfun, bb->index)) |
f470c378 ZD |
118 | { |
119 | error ("bb %d on wrong place", bb->index); | |
120 | err = 1; | |
121 | } | |
122 | ||
123 | if (bb->prev_bb != last_bb_seen) | |
124 | { | |
125 | error ("prev_bb of %d should be %d, not %d", | |
126 | bb->index, last_bb_seen->index, bb->prev_bb->index); | |
127 | err = 1; | |
128 | } | |
129 | ||
130 | last_bb_seen = bb; | |
131 | } | |
132 | ||
133 | /* Now check the basic blocks (boundaries etc.) */ | |
4f42035e | 134 | FOR_EACH_BB_REVERSE_FN (bb, cfun) |
f470c378 ZD |
135 | { |
136 | int n_fallthru = 0; | |
137 | edge e; | |
628f6a4e | 138 | edge_iterator ei; |
f470c378 | 139 | |
598ec7bd ZD |
140 | if (bb->loop_father != NULL && current_loops == NULL) |
141 | { | |
142 | error ("verify_flow_info: Block %i has loop_father, but there are no loops", | |
143 | bb->index); | |
144 | err = 1; | |
145 | } | |
146 | if (bb->loop_father == NULL && current_loops != NULL) | |
147 | { | |
148 | error ("verify_flow_info: Block %i lacks loop_father", bb->index); | |
149 | err = 1; | |
150 | } | |
151 | ||
3995f3a2 | 152 | if (!bb->count.verify ()) |
f470c378 | 153 | { |
3995f3a2 | 154 | error ("verify_flow_info: Wrong count of block %i", bb->index); |
f470c378 ZD |
155 | err = 1; |
156 | } | |
e7a74006 | 157 | /* FIXME: Graphite and SLJL and target code still tends to produce |
9c3da8cc | 158 | edges with no probability. */ |
e7a74006 JH |
159 | if (profile_status_for_fn (cfun) >= PROFILE_GUESSED |
160 | && !bb->count.initialized_p () && !flag_graphite && 0) | |
f470c378 | 161 | { |
e7a74006 | 162 | error ("verify_flow_info: Missing count of block %i", bb->index); |
f470c378 ZD |
163 | err = 1; |
164 | } | |
9cdc325a | 165 | |
710c6ab4 RB |
166 | if (bb->flags & ~cfun->cfg->bb_flags_allocated) |
167 | { | |
168 | error ("verify_flow_info: unallocated flag set on BB %d", bb->index); | |
169 | err = 1; | |
170 | } | |
171 | ||
628f6a4e | 172 | FOR_EACH_EDGE (e, ei, bb->succs) |
f470c378 | 173 | { |
24bd1a0b | 174 | if (last_visited [e->dest->index] == bb) |
f470c378 ZD |
175 | { |
176 | error ("verify_flow_info: Duplicate edge %i->%i", | |
177 | e->src->index, e->dest->index); | |
178 | err = 1; | |
179 | } | |
5675a2f8 | 180 | /* FIXME: Graphite and SLJL and target code still tends to produce |
9c3da8cc | 181 | edges with no probability. */ |
9cdc325a | 182 | if (profile_status_for_fn (cfun) >= PROFILE_GUESSED |
e7a74006 | 183 | && !e->probability.initialized_p () && !flag_graphite && 0) |
9cdc325a JH |
184 | { |
185 | error ("Uninitialized probability of edge %i->%i", e->src->index, | |
186 | e->dest->index); | |
187 | err = 1; | |
188 | } | |
357067f2 | 189 | if (!e->probability.verify ()) |
f470c378 | 190 | { |
357067f2 JH |
191 | error ("verify_flow_info: Wrong probability of edge %i->%i", |
192 | e->src->index, e->dest->index); | |
f470c378 ZD |
193 | err = 1; |
194 | } | |
f470c378 | 195 | |
24bd1a0b | 196 | last_visited [e->dest->index] = bb; |
f470c378 ZD |
197 | |
198 | if (e->flags & EDGE_FALLTHRU) | |
199 | n_fallthru++; | |
200 | ||
201 | if (e->src != bb) | |
202 | { | |
203 | error ("verify_flow_info: Basic block %d succ edge is corrupted", | |
204 | bb->index); | |
205 | fprintf (stderr, "Predecessor: "); | |
a315c44c | 206 | dump_edge_info (stderr, e, TDF_DETAILS, 0); |
f470c378 | 207 | fprintf (stderr, "\nSuccessor: "); |
a315c44c | 208 | dump_edge_info (stderr, e, TDF_DETAILS, 1); |
f470c378 ZD |
209 | fprintf (stderr, "\n"); |
210 | err = 1; | |
211 | } | |
212 | ||
710c6ab4 RB |
213 | if (e->flags & ~cfun->cfg->edge_flags_allocated) |
214 | { | |
215 | error ("verify_flow_info: unallocated edge flag set on %d -> %d", | |
216 | e->src->index, e->dest->index); | |
217 | err = 1; | |
218 | } | |
219 | ||
24bd1a0b | 220 | edge_checksum[e->dest->index] += (size_t) e; |
f470c378 ZD |
221 | } |
222 | if (n_fallthru > 1) | |
223 | { | |
ab532386 | 224 | error ("wrong amount of branch edges after unconditional jump %i", bb->index); |
f470c378 ZD |
225 | err = 1; |
226 | } | |
227 | ||
628f6a4e | 228 | FOR_EACH_EDGE (e, ei, bb->preds) |
f470c378 ZD |
229 | { |
230 | if (e->dest != bb) | |
231 | { | |
232 | error ("basic block %d pred edge is corrupted", bb->index); | |
233 | fputs ("Predecessor: ", stderr); | |
a315c44c | 234 | dump_edge_info (stderr, e, TDF_DETAILS, 0); |
f470c378 | 235 | fputs ("\nSuccessor: ", stderr); |
a315c44c | 236 | dump_edge_info (stderr, e, TDF_DETAILS, 1); |
f470c378 ZD |
237 | fputc ('\n', stderr); |
238 | err = 1; | |
239 | } | |
73553871 KH |
240 | |
241 | if (ei.index != e->dest_idx) | |
242 | { | |
243 | error ("basic block %d pred edge is corrupted", bb->index); | |
244 | error ("its dest_idx should be %d, not %d", | |
245 | ei.index, e->dest_idx); | |
246 | fputs ("Predecessor: ", stderr); | |
a315c44c | 247 | dump_edge_info (stderr, e, TDF_DETAILS, 0); |
73553871 | 248 | fputs ("\nSuccessor: ", stderr); |
a315c44c | 249 | dump_edge_info (stderr, e, TDF_DETAILS, 1); |
73553871 KH |
250 | fputc ('\n', stderr); |
251 | err = 1; | |
252 | } | |
253 | ||
24bd1a0b | 254 | edge_checksum[e->dest->index] -= (size_t) e; |
f470c378 ZD |
255 | } |
256 | } | |
257 | ||
258 | /* Complete edge checksumming for ENTRY and EXIT. */ | |
259 | { | |
260 | edge e; | |
628f6a4e | 261 | edge_iterator ei; |
f470c378 | 262 | |
fefa31b5 | 263 | FOR_EACH_EDGE (e, ei, ENTRY_BLOCK_PTR_FOR_FN (cfun)->succs) |
24bd1a0b | 264 | edge_checksum[e->dest->index] += (size_t) e; |
f470c378 | 265 | |
fefa31b5 | 266 | FOR_EACH_EDGE (e, ei, EXIT_BLOCK_PTR_FOR_FN (cfun)->preds) |
24bd1a0b | 267 | edge_checksum[e->dest->index] -= (size_t) e; |
f470c378 ZD |
268 | } |
269 | ||
fefa31b5 | 270 | FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR_FOR_FN (cfun), NULL, next_bb) |
24bd1a0b | 271 | if (edge_checksum[bb->index]) |
f470c378 ZD |
272 | { |
273 | error ("basic block %i edge lists are corrupted", bb->index); | |
274 | err = 1; | |
275 | } | |
276 | ||
f470c378 ZD |
277 | /* Clean up. */ |
278 | free (last_visited); | |
279 | free (edge_checksum); | |
280 | ||
281 | if (cfg_hooks->verify_flow_info) | |
282 | err |= cfg_hooks->verify_flow_info (); | |
283 | if (err) | |
284 | internal_error ("verify_flow_info failed"); | |
285 | timevar_pop (TV_CFG_VERIFY); | |
286 | } | |
287 | ||
a315c44c SB |
288 | /* Print out one basic block BB to file OUTF. INDENT is printed at the |
289 | start of each new line. FLAGS are the TDF_* flags in dumpfile.h. | |
290 | ||
291 | This function takes care of the purely graph related information. | |
292 | The cfg hook for the active representation should dump | |
293 | representation-specific information. */ | |
f470c378 ZD |
294 | |
295 | void | |
1a817418 | 296 | dump_bb (FILE *outf, basic_block bb, int indent, dump_flags_t flags) |
f470c378 | 297 | { |
f8923f7e SB |
298 | if (flags & TDF_BLOCKS) |
299 | dump_bb_info (outf, bb, indent, flags, true, false); | |
a315c44c SB |
300 | if (cfg_hooks->dump_bb) |
301 | cfg_hooks->dump_bb (outf, bb, indent, flags); | |
f8923f7e SB |
302 | if (flags & TDF_BLOCKS) |
303 | dump_bb_info (outf, bb, indent, flags, false, true); | |
c4669594 | 304 | fputc ('\n', outf); |
a315c44c SB |
305 | } |
306 | ||
7b3b6ae4 LC |
307 | DEBUG_FUNCTION void |
308 | debug (basic_block_def &ref) | |
309 | { | |
4af78ef8 | 310 | dump_bb (stderr, &ref, 0, TDF_NONE); |
7b3b6ae4 LC |
311 | } |
312 | ||
313 | DEBUG_FUNCTION void | |
314 | debug (basic_block_def *ptr) | |
315 | { | |
316 | if (ptr) | |
317 | debug (*ptr); | |
318 | else | |
319 | fprintf (stderr, "<nil>\n"); | |
320 | } | |
321 | ||
19a30b71 AH |
322 | static void |
323 | debug_slim (basic_block ptr) | |
324 | { | |
325 | fprintf (stderr, "<basic_block %p (%d)>", (void *) ptr, ptr->index); | |
326 | } | |
327 | ||
328 | DEFINE_DEBUG_VEC (basic_block_def *) | |
329 | DEFINE_DEBUG_HASH_SET (basic_block_def *) | |
7b3b6ae4 | 330 | |
2c895bd1 SB |
331 | /* Dumps basic block BB to pretty-printer PP, for use as a label of |
332 | a DOT graph record-node. The implementation of this hook is | |
333 | expected to write the label to the stream that is attached to PP. | |
334 | Field separators between instructions are pipe characters printed | |
335 | verbatim. Instructions should be written with some characters | |
336 | escaped, using pp_write_text_as_dot_label_to_stream(). */ | |
337 | ||
338 | void | |
339 | dump_bb_for_graph (pretty_printer *pp, basic_block bb) | |
340 | { | |
341 | if (!cfg_hooks->dump_bb_for_graph) | |
342 | internal_error ("%s does not support dump_bb_for_graph", | |
343 | cfg_hooks->name); | |
3995f3a2 JH |
344 | /* TODO: Add pretty printer for counter. */ |
345 | if (bb->count.initialized_p ()) | |
346 | pp_printf (pp, "COUNT:" "%" PRId64, bb->count.to_gcov_type ()); | |
473b1e05 | 347 | pp_write_text_to_stream (pp); |
ecd14de9 XDL |
348 | if (!(dump_flags & TDF_SLIM)) |
349 | cfg_hooks->dump_bb_for_graph (pp, bb); | |
2c895bd1 SB |
350 | } |
351 | ||
a315c44c SB |
352 | /* Dump the complete CFG to FILE. FLAGS are the TDF_* flags in dumpfile.h. */ |
353 | void | |
1a817418 | 354 | dump_flow_info (FILE *file, dump_flags_t flags) |
a315c44c SB |
355 | { |
356 | basic_block bb; | |
f470c378 | 357 | |
0cae8d31 | 358 | fprintf (file, "\n%d basic blocks, %d edges.\n", n_basic_blocks_for_fn (cfun), |
dc936fb2 | 359 | n_edges_for_fn (cfun)); |
04a90bec | 360 | FOR_ALL_BB_FN (bb, cfun) |
c4669594 | 361 | dump_bb (file, bb, 0, flags); |
f470c378 | 362 | |
a315c44c SB |
363 | putc ('\n', file); |
364 | } | |
f470c378 | 365 | |
a315c44c SB |
366 | /* Like above, but dump to stderr. To be called from debuggers. */ |
367 | void debug_flow_info (void); | |
368 | DEBUG_FUNCTION void | |
369 | debug_flow_info (void) | |
370 | { | |
371 | dump_flow_info (stderr, TDF_DETAILS); | |
f470c378 ZD |
372 | } |
373 | ||
374 | /* Redirect edge E to the given basic block DEST and update underlying program | |
375 | representation. Returns edge representing redirected branch (that may not | |
376 | be equivalent to E in the case of duplicate edges being removed) or NULL | |
377 | if edge is not easily redirectable for whatever reason. */ | |
378 | ||
6de9cd9a | 379 | edge |
f470c378 ZD |
380 | redirect_edge_and_branch (edge e, basic_block dest) |
381 | { | |
6de9cd9a | 382 | edge ret; |
f470c378 ZD |
383 | |
384 | if (!cfg_hooks->redirect_edge_and_branch) | |
ab532386 | 385 | internal_error ("%s does not support redirect_edge_and_branch", |
f470c378 ZD |
386 | cfg_hooks->name); |
387 | ||
388 | ret = cfg_hooks->redirect_edge_and_branch (e, dest); | |
389 | ||
452ba14d ZD |
390 | /* If RET != E, then either the redirection failed, or the edge E |
391 | was removed since RET already lead to the same destination. */ | |
392 | if (current_loops != NULL && ret == e) | |
393 | rescan_loop_exit (e, false, false); | |
6270df4c | 394 | |
f470c378 ZD |
395 | return ret; |
396 | } | |
397 | ||
14fa2cc0 ZD |
398 | /* Returns true if it is possible to remove the edge E by redirecting it |
399 | to the destination of the other edge going from its source. */ | |
400 | ||
401 | bool | |
9678086d | 402 | can_remove_branch_p (const_edge e) |
14fa2cc0 ZD |
403 | { |
404 | if (!cfg_hooks->can_remove_branch_p) | |
405 | internal_error ("%s does not support can_remove_branch_p", | |
406 | cfg_hooks->name); | |
407 | ||
408 | if (EDGE_COUNT (e->src->succs) != 2) | |
409 | return false; | |
410 | ||
411 | return cfg_hooks->can_remove_branch_p (e); | |
412 | } | |
413 | ||
414 | /* Removes E, by redirecting it to the destination of the other edge going | |
415 | from its source. Can_remove_branch_p must be true for E, hence this | |
416 | operation cannot fail. */ | |
417 | ||
418 | void | |
419 | remove_branch (edge e) | |
420 | { | |
421 | edge other; | |
422 | basic_block src = e->src; | |
423 | int irr; | |
424 | ||
425 | gcc_assert (EDGE_COUNT (e->src->succs) == 2); | |
426 | ||
427 | other = EDGE_SUCC (src, EDGE_SUCC (src, 0) == e); | |
428 | irr = other->flags & EDGE_IRREDUCIBLE_LOOP; | |
429 | ||
14fa2cc0 ZD |
430 | e = redirect_edge_and_branch (e, other->dest); |
431 | gcc_assert (e != NULL); | |
432 | ||
433 | e->flags &= ~EDGE_IRREDUCIBLE_LOOP; | |
434 | e->flags |= irr; | |
435 | } | |
436 | ||
452ba14d ZD |
437 | /* Removes edge E from cfg. Unlike remove_branch, it does not update IL. */ |
438 | ||
439 | void | |
440 | remove_edge (edge e) | |
441 | { | |
442 | if (current_loops != NULL) | |
a84a49b7 RB |
443 | { |
444 | rescan_loop_exit (e, false, true); | |
445 | ||
446 | /* Removal of an edge inside an irreducible region or which leads | |
447 | to an irreducible region can turn the region into a natural loop. | |
448 | In that case, ask for the loop structure fixups. | |
449 | ||
450 | FIXME: Note that LOOPS_HAVE_MARKED_IRREDUCIBLE_REGIONS is not always | |
451 | set, so always ask for fixups when removing an edge in that case. */ | |
452 | if (!loops_state_satisfies_p (LOOPS_HAVE_MARKED_IRREDUCIBLE_REGIONS) | |
453 | || (e->flags & EDGE_IRREDUCIBLE_LOOP) | |
454 | || (e->dest->flags & BB_IRREDUCIBLE_LOOP)) | |
455 | loops_state_set (LOOPS_NEED_FIXUP); | |
456 | } | |
452ba14d | 457 | |
532aafad SB |
458 | /* This is probably not needed, but it doesn't hurt. */ |
459 | /* FIXME: This should be called via a remove_edge hook. */ | |
460 | if (current_ir_type () == IR_GIMPLE) | |
461 | redirect_edge_var_map_clear (e); | |
462 | ||
452ba14d ZD |
463 | remove_edge_raw (e); |
464 | } | |
465 | ||
532aafad SB |
466 | /* Like redirect_edge_succ but avoid possible duplicate edge. */ |
467 | ||
468 | edge | |
469 | redirect_edge_succ_nodup (edge e, basic_block new_succ) | |
470 | { | |
471 | edge s; | |
472 | ||
473 | s = find_edge (e->src, new_succ); | |
474 | if (s && s != e) | |
475 | { | |
476 | s->flags |= e->flags; | |
477 | s->probability += e->probability; | |
532aafad SB |
478 | /* FIXME: This should be called via a hook and only for IR_GIMPLE. */ |
479 | redirect_edge_var_map_dup (s, e); | |
480 | remove_edge (e); | |
481 | e = s; | |
482 | } | |
483 | else | |
484 | redirect_edge_succ (e, new_succ); | |
485 | ||
486 | return e; | |
487 | } | |
488 | ||
f470c378 ZD |
489 | /* Redirect the edge E to basic block DEST even if it requires creating |
490 | of a new basic block; then it returns the newly created basic block. | |
491 | Aborts when redirection is impossible. */ | |
492 | ||
493 | basic_block | |
494 | redirect_edge_and_branch_force (edge e, basic_block dest) | |
495 | { | |
6270df4c | 496 | basic_block ret, src = e->src; |
f470c378 ZD |
497 | |
498 | if (!cfg_hooks->redirect_edge_and_branch_force) | |
ab532386 | 499 | internal_error ("%s does not support redirect_edge_and_branch_force", |
f470c378 ZD |
500 | cfg_hooks->name); |
501 | ||
6270df4c ZD |
502 | if (current_loops != NULL) |
503 | rescan_loop_exit (e, false, true); | |
504 | ||
f470c378 | 505 | ret = cfg_hooks->redirect_edge_and_branch_force (e, dest); |
1e6d1da0 | 506 | |
cf103ca4 | 507 | if (ret != NULL && dom_info_available_p (CDI_DOMINATORS)) |
89f8f30f ZD |
508 | set_immediate_dominator (CDI_DOMINATORS, ret, src); |
509 | ||
6270df4c | 510 | if (current_loops != NULL) |
598ec7bd | 511 | { |
6270df4c ZD |
512 | if (ret != NULL) |
513 | { | |
99b1c316 | 514 | class loop *loop |
1e6d1da0 EB |
515 | = find_common_loop (single_pred (ret)->loop_father, |
516 | single_succ (ret)->loop_father); | |
6270df4c ZD |
517 | add_bb_to_loop (ret, loop); |
518 | } | |
519 | else if (find_edge (src, dest) == e) | |
520 | rescan_loop_exit (e, true, false); | |
598ec7bd | 521 | } |
f470c378 ZD |
522 | |
523 | return ret; | |
524 | } | |
525 | ||
526 | /* Splits basic block BB after the specified instruction I (but at least after | |
527 | the labels). If I is NULL, splits just after labels. The newly created edge | |
528 | is returned. The new basic block is created just after the old one. */ | |
529 | ||
c4d281b2 RB |
530 | static edge |
531 | split_block_1 (basic_block bb, void *i) | |
f470c378 ZD |
532 | { |
533 | basic_block new_bb; | |
ede7cba0 | 534 | edge res; |
f470c378 ZD |
535 | |
536 | if (!cfg_hooks->split_block) | |
ab532386 | 537 | internal_error ("%s does not support split_block", cfg_hooks->name); |
f470c378 ZD |
538 | |
539 | new_bb = cfg_hooks->split_block (bb, i); | |
540 | if (!new_bb) | |
541 | return NULL; | |
542 | ||
543 | new_bb->count = bb->count; | |
cbea518e | 544 | new_bb->discriminator = bb->discriminator; |
f470c378 | 545 | |
fce22de5 | 546 | if (dom_info_available_p (CDI_DOMINATORS)) |
f470c378 ZD |
547 | { |
548 | redirect_immediate_dominators (CDI_DOMINATORS, bb, new_bb); | |
549 | set_immediate_dominator (CDI_DOMINATORS, new_bb, bb); | |
550 | } | |
551 | ||
598ec7bd | 552 | if (current_loops != NULL) |
dbdc7f97 | 553 | { |
1f3388fe RB |
554 | edge_iterator ei; |
555 | edge e; | |
dbdc7f97 | 556 | add_bb_to_loop (new_bb, bb->loop_father); |
1f3388fe RB |
557 | /* Identify all loops bb may have been the latch of and adjust them. */ |
558 | FOR_EACH_EDGE (e, ei, new_bb->succs) | |
559 | if (e->dest->loop_father->latch == bb) | |
560 | e->dest->loop_father->latch = new_bb; | |
dbdc7f97 | 561 | } |
598ec7bd | 562 | |
ede7cba0 SP |
563 | res = make_single_succ_edge (bb, new_bb, EDGE_FALLTHRU); |
564 | ||
565 | if (bb->flags & BB_IRREDUCIBLE_LOOP) | |
566 | { | |
567 | new_bb->flags |= BB_IRREDUCIBLE_LOOP; | |
568 | res->flags |= EDGE_IRREDUCIBLE_LOOP; | |
569 | } | |
570 | ||
571 | return res; | |
f470c378 ZD |
572 | } |
573 | ||
c4d281b2 | 574 | edge |
355fe088 | 575 | split_block (basic_block bb, gimple *i) |
c4d281b2 RB |
576 | { |
577 | return split_block_1 (bb, i); | |
578 | } | |
579 | ||
580 | edge | |
581 | split_block (basic_block bb, rtx i) | |
582 | { | |
583 | return split_block_1 (bb, i); | |
584 | } | |
585 | ||
f470c378 ZD |
586 | /* Splits block BB just after labels. The newly created edge is returned. */ |
587 | ||
588 | edge | |
589 | split_block_after_labels (basic_block bb) | |
590 | { | |
c4d281b2 | 591 | return split_block_1 (bb, NULL); |
f470c378 ZD |
592 | } |
593 | ||
321440fd | 594 | /* Moves block BB immediately after block AFTER. Returns false if the |
f470c378 ZD |
595 | movement was impossible. */ |
596 | ||
597 | bool | |
598 | move_block_after (basic_block bb, basic_block after) | |
599 | { | |
600 | bool ret; | |
601 | ||
602 | if (!cfg_hooks->move_block_after) | |
ab532386 | 603 | internal_error ("%s does not support move_block_after", cfg_hooks->name); |
f470c378 ZD |
604 | |
605 | ret = cfg_hooks->move_block_after (bb, after); | |
606 | ||
607 | return ret; | |
608 | } | |
609 | ||
610 | /* Deletes the basic block BB. */ | |
611 | ||
612 | void | |
613 | delete_basic_block (basic_block bb) | |
614 | { | |
615 | if (!cfg_hooks->delete_basic_block) | |
ab532386 | 616 | internal_error ("%s does not support delete_basic_block", cfg_hooks->name); |
f470c378 ZD |
617 | |
618 | cfg_hooks->delete_basic_block (bb); | |
619 | ||
598ec7bd ZD |
620 | if (current_loops != NULL) |
621 | { | |
99b1c316 | 622 | class loop *loop = bb->loop_father; |
598ec7bd ZD |
623 | |
624 | /* If we remove the header or the latch of a loop, mark the loop for | |
08c13199 | 625 | removal. */ |
598ec7bd ZD |
626 | if (loop->latch == bb |
627 | || loop->header == bb) | |
08c13199 | 628 | mark_loop_for_removal (loop); |
598ec7bd ZD |
629 | |
630 | remove_bb_from_loops (bb); | |
631 | } | |
632 | ||
f470c378 ZD |
633 | /* Remove the edges into and out of this block. Note that there may |
634 | indeed be edges in, if we are removing an unreachable loop. */ | |
628f6a4e BE |
635 | while (EDGE_COUNT (bb->preds) != 0) |
636 | remove_edge (EDGE_PRED (bb, 0)); | |
637 | while (EDGE_COUNT (bb->succs) != 0) | |
638 | remove_edge (EDGE_SUCC (bb, 0)); | |
f470c378 | 639 | |
2b28c07a | 640 | if (dom_info_available_p (CDI_DOMINATORS)) |
f470c378 | 641 | delete_from_dominance_info (CDI_DOMINATORS, bb); |
2b28c07a | 642 | if (dom_info_available_p (CDI_POST_DOMINATORS)) |
f470c378 ZD |
643 | delete_from_dominance_info (CDI_POST_DOMINATORS, bb); |
644 | ||
645 | /* Remove the basic block from the array. */ | |
646 | expunge_block (bb); | |
647 | } | |
648 | ||
649 | /* Splits edge E and returns the newly created basic block. */ | |
650 | ||
651 | basic_block | |
652 | split_edge (edge e) | |
653 | { | |
654 | basic_block ret; | |
ef30ab83 | 655 | profile_count count = e->count (); |
017b3258 | 656 | edge f; |
a746fd8c | 657 | bool irr = (e->flags & EDGE_IRREDUCIBLE_LOOP) != 0; |
5e3c2d4b | 658 | bool back = (e->flags & EDGE_DFS_BACK) != 0; |
99b1c316 | 659 | class loop *loop; |
598ec7bd | 660 | basic_block src = e->src, dest = e->dest; |
f470c378 ZD |
661 | |
662 | if (!cfg_hooks->split_edge) | |
ab532386 | 663 | internal_error ("%s does not support split_edge", cfg_hooks->name); |
f470c378 | 664 | |
6270df4c ZD |
665 | if (current_loops != NULL) |
666 | rescan_loop_exit (e, false, true); | |
667 | ||
f470c378 ZD |
668 | ret = cfg_hooks->split_edge (e); |
669 | ret->count = count; | |
357067f2 | 670 | single_succ_edge (ret)->probability = profile_probability::always (); |
f470c378 | 671 | |
a746fd8c ZD |
672 | if (irr) |
673 | { | |
674 | ret->flags |= BB_IRREDUCIBLE_LOOP; | |
c5cbcccf ZD |
675 | single_pred_edge (ret)->flags |= EDGE_IRREDUCIBLE_LOOP; |
676 | single_succ_edge (ret)->flags |= EDGE_IRREDUCIBLE_LOOP; | |
a746fd8c | 677 | } |
5e3c2d4b RB |
678 | if (back) |
679 | { | |
680 | single_pred_edge (ret)->flags &= ~EDGE_DFS_BACK; | |
681 | single_succ_edge (ret)->flags |= EDGE_DFS_BACK; | |
682 | } | |
a746fd8c | 683 | |
2b28c07a | 684 | if (dom_info_available_p (CDI_DOMINATORS)) |
c5cbcccf | 685 | set_immediate_dominator (CDI_DOMINATORS, ret, single_pred (ret)); |
f470c378 | 686 | |
2b28c07a | 687 | if (dom_info_state (CDI_DOMINATORS) >= DOM_NO_FAST_QUERY) |
017b3258 ZD |
688 | { |
689 | /* There are two cases: | |
690 | ||
691 | If the immediate dominator of e->dest is not e->src, it | |
692 | remains unchanged. | |
693 | ||
694 | If immediate dominator of e->dest is e->src, it may become | |
695 | ret, provided that all other predecessors of e->dest are | |
696 | dominated by e->dest. */ | |
697 | ||
c5cbcccf ZD |
698 | if (get_immediate_dominator (CDI_DOMINATORS, single_succ (ret)) |
699 | == single_pred (ret)) | |
017b3258 | 700 | { |
628f6a4e | 701 | edge_iterator ei; |
c5cbcccf | 702 | FOR_EACH_EDGE (f, ei, single_succ (ret)->preds) |
017b3258 | 703 | { |
c5cbcccf | 704 | if (f == single_succ_edge (ret)) |
017b3258 ZD |
705 | continue; |
706 | ||
707 | if (!dominated_by_p (CDI_DOMINATORS, f->src, | |
c5cbcccf | 708 | single_succ (ret))) |
017b3258 ZD |
709 | break; |
710 | } | |
711 | ||
712 | if (!f) | |
c5cbcccf | 713 | set_immediate_dominator (CDI_DOMINATORS, single_succ (ret), ret); |
017b3258 | 714 | } |
598ec7bd ZD |
715 | } |
716 | ||
717 | if (current_loops != NULL) | |
718 | { | |
719 | loop = find_common_loop (src->loop_father, dest->loop_father); | |
720 | add_bb_to_loop (ret, loop); | |
721 | ||
3551257c RB |
722 | /* If we split the latch edge of loop adjust the latch block. */ |
723 | if (loop->latch == src | |
724 | && loop->header == dest) | |
598ec7bd ZD |
725 | loop->latch = ret; |
726 | } | |
f470c378 ZD |
727 | |
728 | return ret; | |
729 | } | |
730 | ||
731 | /* Creates a new basic block just after the basic block AFTER. | |
732 | HEAD and END are the first and the last statement belonging | |
733 | to the block. If both are NULL, an empty block is created. */ | |
734 | ||
c4d281b2 RB |
735 | static basic_block |
736 | create_basic_block_1 (void *head, void *end, basic_block after) | |
f470c378 ZD |
737 | { |
738 | basic_block ret; | |
739 | ||
740 | if (!cfg_hooks->create_basic_block) | |
ab532386 | 741 | internal_error ("%s does not support create_basic_block", cfg_hooks->name); |
f470c378 ZD |
742 | |
743 | ret = cfg_hooks->create_basic_block (head, end, after); | |
744 | ||
2b28c07a | 745 | if (dom_info_available_p (CDI_DOMINATORS)) |
f470c378 | 746 | add_to_dominance_info (CDI_DOMINATORS, ret); |
2b28c07a | 747 | if (dom_info_available_p (CDI_POST_DOMINATORS)) |
f470c378 ZD |
748 | add_to_dominance_info (CDI_POST_DOMINATORS, ret); |
749 | ||
750 | return ret; | |
751 | } | |
752 | ||
c4d281b2 RB |
753 | basic_block |
754 | create_basic_block (gimple_seq seq, basic_block after) | |
755 | { | |
756 | return create_basic_block_1 (seq, NULL, after); | |
757 | } | |
758 | ||
759 | basic_block | |
760 | create_basic_block (rtx head, rtx end, basic_block after) | |
761 | { | |
762 | return create_basic_block_1 (head, end, after); | |
763 | } | |
764 | ||
765 | ||
f470c378 ZD |
766 | /* Creates an empty basic block just after basic block AFTER. */ |
767 | ||
768 | basic_block | |
769 | create_empty_bb (basic_block after) | |
770 | { | |
c4d281b2 | 771 | return create_basic_block_1 (NULL, NULL, after); |
f470c378 ZD |
772 | } |
773 | ||
774 | /* Checks whether we may merge blocks BB1 and BB2. */ | |
775 | ||
776 | bool | |
b48d0358 | 777 | can_merge_blocks_p (basic_block bb1, basic_block bb2) |
f470c378 ZD |
778 | { |
779 | bool ret; | |
780 | ||
781 | if (!cfg_hooks->can_merge_blocks_p) | |
ab532386 | 782 | internal_error ("%s does not support can_merge_blocks_p", cfg_hooks->name); |
f470c378 ZD |
783 | |
784 | ret = cfg_hooks->can_merge_blocks_p (bb1, bb2); | |
785 | ||
786 | return ret; | |
787 | } | |
788 | ||
6de9cd9a DN |
789 | void |
790 | predict_edge (edge e, enum br_predictor predictor, int probability) | |
791 | { | |
792 | if (!cfg_hooks->predict_edge) | |
ab532386 | 793 | internal_error ("%s does not support predict_edge", cfg_hooks->name); |
6de9cd9a DN |
794 | |
795 | cfg_hooks->predict_edge (e, predictor, probability); | |
796 | } | |
797 | ||
798 | bool | |
9678086d | 799 | predicted_by_p (const_basic_block bb, enum br_predictor predictor) |
6de9cd9a DN |
800 | { |
801 | if (!cfg_hooks->predict_edge) | |
ab532386 | 802 | internal_error ("%s does not support predicted_by_p", cfg_hooks->name); |
6de9cd9a DN |
803 | |
804 | return cfg_hooks->predicted_by_p (bb, predictor); | |
805 | } | |
806 | ||
f470c378 ZD |
807 | /* Merges basic block B into basic block A. */ |
808 | ||
809 | void | |
810 | merge_blocks (basic_block a, basic_block b) | |
811 | { | |
812 | edge e; | |
628f6a4e | 813 | edge_iterator ei; |
f470c378 ZD |
814 | |
815 | if (!cfg_hooks->merge_blocks) | |
ab532386 | 816 | internal_error ("%s does not support merge_blocks", cfg_hooks->name); |
f470c378 | 817 | |
9e824336 ZD |
818 | cfg_hooks->merge_blocks (a, b); |
819 | ||
598ec7bd | 820 | if (current_loops != NULL) |
7d776ee2 | 821 | { |
63f2ff0f RB |
822 | /* If the block we merge into is a loop header do nothing unless ... */ |
823 | if (a->loop_father->header == a) | |
824 | { | |
825 | /* ... we merge two loop headers, in which case we kill | |
826 | the inner loop. */ | |
827 | if (b->loop_father->header == b) | |
08c13199 | 828 | mark_loop_for_removal (b->loop_father); |
63f2ff0f RB |
829 | } |
830 | /* If we merge a loop header into its predecessor, update the loop | |
831 | structure. */ | |
832 | else if (b->loop_father->header == b) | |
7d776ee2 RG |
833 | { |
834 | remove_bb_from_loops (a); | |
835 | add_bb_to_loop (a, b->loop_father); | |
836 | a->loop_father->header = a; | |
837 | } | |
93a95abe RB |
838 | /* If we merge a loop latch into its predecessor, update the loop |
839 | structure. */ | |
840 | if (b->loop_father->latch | |
841 | && b->loop_father->latch == b) | |
842 | b->loop_father->latch = a; | |
7d776ee2 RG |
843 | remove_bb_from_loops (b); |
844 | } | |
598ec7bd | 845 | |
f470c378 ZD |
846 | /* Normally there should only be one successor of A and that is B, but |
847 | partway though the merge of blocks for conditional_execution we'll | |
848 | be merging a TEST block with THEN and ELSE successors. Free the | |
849 | whole lot of them and hope the caller knows what they're doing. */ | |
628f6a4e BE |
850 | |
851 | while (EDGE_COUNT (a->succs) != 0) | |
452ba14d | 852 | remove_edge (EDGE_SUCC (a, 0)); |
f470c378 ZD |
853 | |
854 | /* Adjust the edges out of B for the new owner. */ | |
628f6a4e | 855 | FOR_EACH_EDGE (e, ei, b->succs) |
6270df4c ZD |
856 | { |
857 | e->src = a; | |
858 | if (current_loops != NULL) | |
6aaf596b RB |
859 | { |
860 | /* If b was a latch, a now is. */ | |
861 | if (e->dest->loop_father->latch == b) | |
862 | e->dest->loop_father->latch = a; | |
863 | rescan_loop_exit (e, true, false); | |
864 | } | |
6270df4c | 865 | } |
628f6a4e | 866 | a->succs = b->succs; |
f470c378 ZD |
867 | a->flags |= b->flags; |
868 | ||
869 | /* B hasn't quite yet ceased to exist. Attempt to prevent mishap. */ | |
628f6a4e | 870 | b->preds = b->succs = NULL; |
f470c378 | 871 | |
2b28c07a | 872 | if (dom_info_available_p (CDI_DOMINATORS)) |
f470c378 ZD |
873 | redirect_immediate_dominators (CDI_DOMINATORS, b, a); |
874 | ||
2b28c07a | 875 | if (dom_info_available_p (CDI_DOMINATORS)) |
f470c378 | 876 | delete_from_dominance_info (CDI_DOMINATORS, b); |
2b28c07a | 877 | if (dom_info_available_p (CDI_POST_DOMINATORS)) |
f470c378 ZD |
878 | delete_from_dominance_info (CDI_POST_DOMINATORS, b); |
879 | ||
880 | expunge_block (b); | |
881 | } | |
882 | ||
883 | /* Split BB into entry part and the rest (the rest is the newly created block). | |
884 | Redirect those edges for that REDIRECT_EDGE_P returns true to the entry | |
885 | part. Returns the edge connecting the entry part to the rest. */ | |
886 | ||
887 | edge | |
888 | make_forwarder_block (basic_block bb, bool (*redirect_edge_p) (edge), | |
889 | void (*new_bb_cbk) (basic_block)) | |
890 | { | |
628f6a4e BE |
891 | edge e, fallthru; |
892 | edge_iterator ei; | |
f470c378 | 893 | basic_block dummy, jump; |
99b1c316 | 894 | class loop *loop, *ploop, *cloop; |
f470c378 ZD |
895 | |
896 | if (!cfg_hooks->make_forwarder_block) | |
ab532386 | 897 | internal_error ("%s does not support make_forwarder_block", |
f470c378 ZD |
898 | cfg_hooks->name); |
899 | ||
900 | fallthru = split_block_after_labels (bb); | |
901 | dummy = fallthru->src; | |
3995f3a2 | 902 | dummy->count = profile_count::zero (); |
f470c378 ZD |
903 | bb = fallthru->dest; |
904 | ||
905 | /* Redirect back edges we want to keep. */ | |
628f6a4e | 906 | for (ei = ei_start (dummy->preds); (e = ei_safe_edge (ei)); ) |
f470c378 | 907 | { |
e855c69d AB |
908 | basic_block e_src; |
909 | ||
f470c378 | 910 | if (redirect_edge_p (e)) |
628f6a4e | 911 | { |
ef30ab83 | 912 | dummy->count += e->count (); |
628f6a4e BE |
913 | ei_next (&ei); |
914 | continue; | |
915 | } | |
f470c378 | 916 | |
e855c69d | 917 | e_src = e->src; |
f470c378 | 918 | jump = redirect_edge_and_branch_force (e, bb); |
e855c69d AB |
919 | if (jump != NULL) |
920 | { | |
921 | /* If we redirected the loop latch edge, the JUMP block now acts like | |
922 | the new latch of the loop. */ | |
923 | if (current_loops != NULL | |
924 | && dummy->loop_father != NULL | |
925 | && dummy->loop_father->header == dummy | |
926 | && dummy->loop_father->latch == e_src) | |
927 | dummy->loop_father->latch = jump; | |
b8698a0f | 928 | |
e855c69d AB |
929 | if (new_bb_cbk != NULL) |
930 | new_bb_cbk (jump); | |
931 | } | |
f470c378 ZD |
932 | } |
933 | ||
fce22de5 | 934 | if (dom_info_available_p (CDI_DOMINATORS)) |
f470c378 | 935 | { |
9771b263 DN |
936 | vec<basic_block> doms_to_fix; |
937 | doms_to_fix.create (2); | |
938 | doms_to_fix.quick_push (dummy); | |
939 | doms_to_fix.quick_push (bb); | |
66f97d31 | 940 | iterate_fix_dominators (CDI_DOMINATORS, doms_to_fix, false); |
9771b263 | 941 | doms_to_fix.release (); |
f470c378 ZD |
942 | } |
943 | ||
598ec7bd ZD |
944 | if (current_loops != NULL) |
945 | { | |
946 | /* If we do not split a loop header, then both blocks belong to the | |
947 | same loop. In case we split loop header and do not redirect the | |
948 | latch edge to DUMMY, then DUMMY belongs to the outer loop, and | |
89f8f30f ZD |
949 | BB becomes the new header. If latch is not recorded for the loop, |
950 | we leave this updating on the caller (this may only happen during | |
951 | loop analysis). */ | |
598ec7bd ZD |
952 | loop = dummy->loop_father; |
953 | if (loop->header == dummy | |
89f8f30f | 954 | && loop->latch != NULL |
598ec7bd ZD |
955 | && find_edge (loop->latch, dummy) == NULL) |
956 | { | |
957 | remove_bb_from_loops (dummy); | |
958 | loop->header = bb; | |
959 | ||
960 | cloop = loop; | |
961 | FOR_EACH_EDGE (e, ei, dummy->preds) | |
962 | { | |
963 | cloop = find_common_loop (cloop, e->src->loop_father); | |
964 | } | |
965 | add_bb_to_loop (dummy, cloop); | |
966 | } | |
967 | ||
968 | /* In case we split loop latch, update it. */ | |
9ba025a2 | 969 | for (ploop = loop; ploop; ploop = loop_outer (ploop)) |
598ec7bd ZD |
970 | if (ploop->latch == dummy) |
971 | ploop->latch = bb; | |
972 | } | |
973 | ||
f470c378 ZD |
974 | cfg_hooks->make_forwarder_block (fallthru); |
975 | ||
976 | return fallthru; | |
977 | } | |
978 | ||
cf103ca4 EB |
979 | /* Try to make the edge fallthru. */ |
980 | ||
f470c378 ZD |
981 | void |
982 | tidy_fallthru_edge (edge e) | |
983 | { | |
984 | if (cfg_hooks->tidy_fallthru_edge) | |
985 | cfg_hooks->tidy_fallthru_edge (e); | |
986 | } | |
987 | ||
988 | /* Fix up edges that now fall through, or rather should now fall through | |
989 | but previously required a jump around now deleted blocks. Simplify | |
990 | the search by only examining blocks numerically adjacent, since this | |
8effe856 EB |
991 | is how they were created. |
992 | ||
993 | ??? This routine is currently RTL specific. */ | |
f470c378 ZD |
994 | |
995 | void | |
996 | tidy_fallthru_edges (void) | |
997 | { | |
998 | basic_block b, c; | |
999 | ||
1000 | if (!cfg_hooks->tidy_fallthru_edge) | |
1001 | return; | |
1002 | ||
fefa31b5 | 1003 | if (ENTRY_BLOCK_PTR_FOR_FN (cfun)->next_bb == EXIT_BLOCK_PTR_FOR_FN (cfun)) |
f470c378 ZD |
1004 | return; |
1005 | ||
fefa31b5 DM |
1006 | FOR_BB_BETWEEN (b, ENTRY_BLOCK_PTR_FOR_FN (cfun)->next_bb, |
1007 | EXIT_BLOCK_PTR_FOR_FN (cfun)->prev_bb, next_bb) | |
f470c378 ZD |
1008 | { |
1009 | edge s; | |
1010 | ||
1011 | c = b->next_bb; | |
1012 | ||
1013 | /* We care about simple conditional or unconditional jumps with | |
1014 | a single successor. | |
1015 | ||
1016 | If we had a conditional branch to the next instruction when | |
3cabd6d1 LB |
1017 | CFG was built, then there will only be one out edge for the |
1018 | block which ended with the conditional branch (since we do | |
1019 | not create duplicate edges). | |
f470c378 ZD |
1020 | |
1021 | Furthermore, the edge will be marked as a fallthru because we | |
1022 | merge the flags for the duplicate edges. So we do not want to | |
1023 | check that the edge is not a FALLTHRU edge. */ | |
1024 | ||
c5cbcccf | 1025 | if (single_succ_p (b)) |
628f6a4e | 1026 | { |
c5cbcccf | 1027 | s = single_succ_edge (b); |
628f6a4e BE |
1028 | if (! (s->flags & EDGE_COMPLEX) |
1029 | && s->dest == c | |
339ba33b | 1030 | && !(JUMP_P (BB_END (b)) && CROSSING_JUMP_P (BB_END (b)))) |
628f6a4e BE |
1031 | tidy_fallthru_edge (s); |
1032 | } | |
f470c378 ZD |
1033 | } |
1034 | } | |
6de9cd9a | 1035 | |
cf103ca4 EB |
1036 | /* Edge E is assumed to be fallthru edge. Emit needed jump instruction |
1037 | (and possibly create new basic block) to make edge non-fallthru. | |
1038 | Return newly created BB or NULL if none. */ | |
1039 | ||
1040 | basic_block | |
1041 | force_nonfallthru (edge e) | |
1042 | { | |
1e6d1da0 | 1043 | basic_block ret, src = e->src; |
cf103ca4 EB |
1044 | |
1045 | if (!cfg_hooks->force_nonfallthru) | |
1046 | internal_error ("%s does not support force_nonfallthru", | |
1047 | cfg_hooks->name); | |
1048 | ||
cf103ca4 | 1049 | ret = cfg_hooks->force_nonfallthru (e); |
1e6d1da0 | 1050 | if (ret != NULL) |
cf103ca4 | 1051 | { |
1e6d1da0 EB |
1052 | if (dom_info_available_p (CDI_DOMINATORS)) |
1053 | set_immediate_dominator (CDI_DOMINATORS, ret, src); | |
1054 | ||
1055 | if (current_loops != NULL) | |
cf103ca4 | 1056 | { |
ee281008 RB |
1057 | basic_block pred = single_pred (ret); |
1058 | basic_block succ = single_succ (ret); | |
99b1c316 | 1059 | class loop *loop |
ee281008 | 1060 | = find_common_loop (pred->loop_father, succ->loop_father); |
1e6d1da0 | 1061 | rescan_loop_exit (e, false, true); |
cf103ca4 | 1062 | add_bb_to_loop (ret, loop); |
ee281008 RB |
1063 | |
1064 | /* If we split the latch edge of loop adjust the latch block. */ | |
1065 | if (loop->latch == pred | |
1066 | && loop->header == succ) | |
1067 | loop->latch = ret; | |
cf103ca4 | 1068 | } |
cf103ca4 EB |
1069 | } |
1070 | ||
1071 | return ret; | |
1072 | } | |
1073 | ||
6de9cd9a DN |
1074 | /* Returns true if we can duplicate basic block BB. */ |
1075 | ||
1076 | bool | |
9678086d | 1077 | can_duplicate_block_p (const_basic_block bb) |
6de9cd9a | 1078 | { |
6de9cd9a | 1079 | if (!cfg_hooks->can_duplicate_block_p) |
ab532386 | 1080 | internal_error ("%s does not support can_duplicate_block_p", |
6de9cd9a DN |
1081 | cfg_hooks->name); |
1082 | ||
fefa31b5 | 1083 | if (bb == EXIT_BLOCK_PTR_FOR_FN (cfun) || bb == ENTRY_BLOCK_PTR_FOR_FN (cfun)) |
6de9cd9a DN |
1084 | return false; |
1085 | ||
6de9cd9a DN |
1086 | return cfg_hooks->can_duplicate_block_p (bb); |
1087 | } | |
1088 | ||
1089 | /* Duplicates basic block BB and redirects edge E to it. Returns the | |
b9a66240 ZD |
1090 | new basic block. The new basic block is placed after the basic block |
1091 | AFTER. */ | |
6de9cd9a DN |
1092 | |
1093 | basic_block | |
229d576c | 1094 | duplicate_block (basic_block bb, edge e, basic_block after, copy_bb_data *id) |
6de9cd9a DN |
1095 | { |
1096 | edge s, n; | |
1097 | basic_block new_bb; | |
ef30ab83 | 1098 | profile_count new_count = e ? e->count (): profile_count::uninitialized (); |
628f6a4e | 1099 | edge_iterator ei; |
6de9cd9a DN |
1100 | |
1101 | if (!cfg_hooks->duplicate_block) | |
ab532386 | 1102 | internal_error ("%s does not support duplicate_block", |
6de9cd9a DN |
1103 | cfg_hooks->name); |
1104 | ||
1105 | if (bb->count < new_count) | |
1106 | new_count = bb->count; | |
e376fe58 | 1107 | |
77a74ed7 | 1108 | gcc_checking_assert (can_duplicate_block_p (bb)); |
6de9cd9a | 1109 | |
229d576c | 1110 | new_bb = cfg_hooks->duplicate_block (bb, id); |
b9a66240 ZD |
1111 | if (after) |
1112 | move_block_after (new_bb, after); | |
6de9cd9a | 1113 | |
25853b33 | 1114 | new_bb->flags = (bb->flags & ~BB_DUPLICATED); |
628f6a4e | 1115 | FOR_EACH_EDGE (s, ei, bb->succs) |
6de9cd9a DN |
1116 | { |
1117 | /* Since we are creating edges from a new block to successors | |
1118 | of another block (which therefore are known to be disjoint), there | |
1119 | is no need to actually check for duplicated edges. */ | |
1120 | n = unchecked_make_edge (new_bb, s->dest, s->flags); | |
1121 | n->probability = s->probability; | |
6de9cd9a DN |
1122 | n->aux = s->aux; |
1123 | } | |
1124 | ||
1125 | if (e) | |
1126 | { | |
1127 | new_bb->count = new_count; | |
1128 | bb->count -= new_count; | |
1129 | ||
6de9cd9a | 1130 | redirect_edge_and_branch_force (e, new_bb); |
6de9cd9a DN |
1131 | } |
1132 | else | |
e7a74006 | 1133 | new_bb->count = bb->count; |
6de9cd9a | 1134 | |
6580ee77 JH |
1135 | set_bb_original (new_bb, bb); |
1136 | set_bb_copy (bb, new_bb); | |
6de9cd9a | 1137 | |
b02b9b53 ZD |
1138 | /* Add the new block to the copy of the loop of BB, or directly to the loop |
1139 | of BB if the loop is not being copied. */ | |
598ec7bd | 1140 | if (current_loops != NULL) |
b02b9b53 | 1141 | { |
99b1c316 MS |
1142 | class loop *cloop = bb->loop_father; |
1143 | class loop *copy = get_loop_copy (cloop); | |
07b1bf20 RG |
1144 | /* If we copied the loop header block but not the loop |
1145 | we have created a loop with multiple entries. Ditch the loop, | |
1146 | add the new block to the outer loop and arrange for a fixup. */ | |
7d776ee2 | 1147 | if (!copy |
07b1bf20 | 1148 | && cloop->header == bb) |
7d776ee2 | 1149 | { |
07b1bf20 | 1150 | add_bb_to_loop (new_bb, loop_outer (cloop)); |
08c13199 | 1151 | mark_loop_for_removal (cloop); |
07b1bf20 RG |
1152 | } |
1153 | else | |
1154 | { | |
1155 | add_bb_to_loop (new_bb, copy ? copy : cloop); | |
1156 | /* If we copied the loop latch block but not the loop, adjust | |
1157 | loop state. */ | |
1158 | if (!copy | |
1159 | && cloop->latch == bb) | |
1160 | { | |
1161 | cloop->latch = NULL; | |
1162 | loops_state_set (LOOPS_MAY_HAVE_MULTIPLE_LATCHES); | |
1163 | } | |
7d776ee2 | 1164 | } |
b02b9b53 | 1165 | } |
598ec7bd | 1166 | |
6de9cd9a DN |
1167 | return new_bb; |
1168 | } | |
1169 | ||
1170 | /* Return 1 if BB ends with a call, possibly followed by some | |
1171 | instructions that must stay with the call, 0 otherwise. */ | |
1172 | ||
c22cacf3 | 1173 | bool |
b48d0358 | 1174 | block_ends_with_call_p (basic_block bb) |
6de9cd9a DN |
1175 | { |
1176 | if (!cfg_hooks->block_ends_with_call_p) | |
1177 | internal_error ("%s does not support block_ends_with_call_p", cfg_hooks->name); | |
1178 | ||
1179 | return (cfg_hooks->block_ends_with_call_p) (bb); | |
1180 | } | |
1181 | ||
1182 | /* Return 1 if BB ends with a conditional branch, 0 otherwise. */ | |
1183 | ||
c22cacf3 | 1184 | bool |
9678086d | 1185 | block_ends_with_condjump_p (const_basic_block bb) |
6de9cd9a DN |
1186 | { |
1187 | if (!cfg_hooks->block_ends_with_condjump_p) | |
1188 | internal_error ("%s does not support block_ends_with_condjump_p", | |
1189 | cfg_hooks->name); | |
1190 | ||
1191 | return (cfg_hooks->block_ends_with_condjump_p) (bb); | |
1192 | } | |
1193 | ||
1194 | /* Add fake edges to the function exit for any non constant and non noreturn | |
1195 | calls, volatile inline assembly in the bitmap of blocks specified by | |
1196 | BLOCKS or to the whole CFG if BLOCKS is zero. Return the number of blocks | |
1197 | that were split. | |
1198 | ||
1199 | The goal is to expose cases in which entering a basic block does not imply | |
1200 | that all subsequent instructions must be executed. */ | |
1201 | ||
1202 | int | |
1203 | flow_call_edges_add (sbitmap blocks) | |
1204 | { | |
1205 | if (!cfg_hooks->flow_call_edges_add) | |
c22cacf3 | 1206 | internal_error ("%s does not support flow_call_edges_add", |
6de9cd9a DN |
1207 | cfg_hooks->name); |
1208 | ||
1209 | return (cfg_hooks->flow_call_edges_add) (blocks); | |
1210 | } | |
d9d4706f KH |
1211 | |
1212 | /* This function is called immediately after edge E is added to the | |
1213 | edge vector E->dest->preds. */ | |
1214 | ||
1215 | void | |
1216 | execute_on_growing_pred (edge e) | |
1217 | { | |
25853b33 RB |
1218 | if (! (e->dest->flags & BB_DUPLICATED) |
1219 | && cfg_hooks->execute_on_growing_pred) | |
d9d4706f KH |
1220 | cfg_hooks->execute_on_growing_pred (e); |
1221 | } | |
1222 | ||
1223 | /* This function is called immediately before edge E is removed from | |
1224 | the edge vector E->dest->preds. */ | |
1225 | ||
1226 | void | |
1227 | execute_on_shrinking_pred (edge e) | |
1228 | { | |
25853b33 RB |
1229 | if (! (e->dest->flags & BB_DUPLICATED) |
1230 | && cfg_hooks->execute_on_shrinking_pred) | |
d9d4706f KH |
1231 | cfg_hooks->execute_on_shrinking_pred (e); |
1232 | } | |
1cb7dfc3 | 1233 | |
c22cacf3 MS |
1234 | /* This is used inside loop versioning when we want to insert |
1235 | stmts/insns on the edges, which have a different behavior | |
1cb7dfc3 MH |
1236 | in tree's and in RTL, so we made a CFG hook. */ |
1237 | void | |
1238 | lv_flush_pending_stmts (edge e) | |
1239 | { | |
1240 | if (cfg_hooks->flush_pending_stmts) | |
1241 | cfg_hooks->flush_pending_stmts (e); | |
1242 | } | |
1243 | ||
4851c80c | 1244 | /* Loop versioning uses the duplicate_loop_body_to_header_edge to create |
1cb7dfc3 | 1245 | a new version of the loop basic-blocks, the parameters here are |
4851c80c XL |
1246 | exactly the same as in duplicate_loop_body_to_header_edge or |
1247 | tree_duplicate_loop_body_to_header_edge; while in tree-ssa there is | |
1cb7dfc3 | 1248 | additional work to maintain ssa information that's why there is |
4851c80c XL |
1249 | a need to call the tree_duplicate_loop_body_to_header_edge rather |
1250 | than duplicate_loop_body_to_header_edge when we are in tree mode. */ | |
1cb7dfc3 | 1251 | bool |
4851c80c XL |
1252 | cfg_hook_duplicate_loop_body_to_header_edge (class loop *loop, edge e, |
1253 | unsigned int ndupl, | |
1254 | sbitmap wont_exit, edge orig, | |
1255 | vec<edge> *to_remove, int flags) | |
1cb7dfc3 | 1256 | { |
4851c80c XL |
1257 | gcc_assert (cfg_hooks->cfg_hook_duplicate_loop_body_to_header_edge); |
1258 | return cfg_hooks->cfg_hook_duplicate_loop_body_to_header_edge ( | |
1259 | loop, e, ndupl, wont_exit, orig, to_remove, flags); | |
1cb7dfc3 MH |
1260 | } |
1261 | ||
1262 | /* Conditional jumps are represented differently in trees and RTL, | |
1263 | this hook takes a basic block that is known to have a cond jump | |
fa10beec | 1264 | at its end and extracts the taken and not taken edges out of it |
1cb7dfc3 MH |
1265 | and store it in E1 and E2 respectively. */ |
1266 | void | |
1267 | extract_cond_bb_edges (basic_block b, edge *e1, edge *e2) | |
1268 | { | |
1269 | gcc_assert (cfg_hooks->extract_cond_bb_edges); | |
1270 | cfg_hooks->extract_cond_bb_edges (b, e1, e2); | |
1271 | } | |
1272 | ||
1273 | /* Responsible for updating the ssa info (PHI nodes) on the | |
315682fb | 1274 | new condition basic block that guards the versioned loop. */ |
1cb7dfc3 MH |
1275 | void |
1276 | lv_adjust_loop_header_phi (basic_block first, basic_block second, | |
ae50c0cb | 1277 | basic_block new_block, edge e) |
1cb7dfc3 MH |
1278 | { |
1279 | if (cfg_hooks->lv_adjust_loop_header_phi) | |
ae50c0cb | 1280 | cfg_hooks->lv_adjust_loop_header_phi (first, second, new_block, e); |
1cb7dfc3 MH |
1281 | } |
1282 | ||
1283 | /* Conditions in trees and RTL are different so we need | |
1284 | a different handling when we add the condition to the | |
1285 | versioning code. */ | |
1286 | void | |
1287 | lv_add_condition_to_bb (basic_block first, basic_block second, | |
ae50c0cb | 1288 | basic_block new_block, void *cond) |
1cb7dfc3 MH |
1289 | { |
1290 | gcc_assert (cfg_hooks->lv_add_condition_to_bb); | |
ae50c0cb | 1291 | cfg_hooks->lv_add_condition_to_bb (first, second, new_block, cond); |
c22cacf3 | 1292 | } |
78bde837 SB |
1293 | |
1294 | /* Checks whether all N blocks in BBS array can be copied. */ | |
1295 | bool | |
1296 | can_copy_bbs_p (basic_block *bbs, unsigned n) | |
1297 | { | |
1298 | unsigned i; | |
1299 | edge e; | |
1300 | int ret = true; | |
1301 | ||
1302 | for (i = 0; i < n; i++) | |
1303 | bbs[i]->flags |= BB_DUPLICATED; | |
1304 | ||
1305 | for (i = 0; i < n; i++) | |
1306 | { | |
1307 | /* In case we should redirect abnormal edge during duplication, fail. */ | |
1308 | edge_iterator ei; | |
1309 | FOR_EACH_EDGE (e, ei, bbs[i]->succs) | |
1310 | if ((e->flags & EDGE_ABNORMAL) | |
1311 | && (e->dest->flags & BB_DUPLICATED)) | |
1312 | { | |
1313 | ret = false; | |
1314 | goto end; | |
1315 | } | |
1316 | ||
1317 | if (!can_duplicate_block_p (bbs[i])) | |
1318 | { | |
1319 | ret = false; | |
1320 | break; | |
1321 | } | |
1322 | } | |
1323 | ||
1324 | end: | |
1325 | for (i = 0; i < n; i++) | |
1326 | bbs[i]->flags &= ~BB_DUPLICATED; | |
1327 | ||
1328 | return ret; | |
1329 | } | |
1330 | ||
1331 | /* Duplicates N basic blocks stored in array BBS. Newly created basic blocks | |
1332 | are placed into array NEW_BBS in the same order. Edges from basic blocks | |
f14540b6 SE |
1333 | in BBS are also duplicated and copies of those that lead into BBS are |
1334 | redirected to appropriate newly created block. The function assigns bbs | |
1335 | into loops (copy of basic block bb is assigned to bb->loop_father->copy | |
1336 | loop, so this must be set up correctly in advance) | |
1337 | ||
1338 | If UPDATE_DOMINANCE is true then this function updates dominators locally | |
1339 | (LOOPS structure that contains the information about dominators is passed | |
1340 | to enable this), otherwise it does not update the dominator information | |
1341 | and it assumed that the caller will do this, perhaps by destroying and | |
1342 | recreating it instead of trying to do an incremental update like this | |
1343 | function does when update_dominance is true. | |
78bde837 SB |
1344 | |
1345 | BASE is the superloop to that basic block belongs; if its header or latch | |
1346 | is copied, we do not set the new blocks as header or latch. | |
1347 | ||
1348 | Created copies of N_EDGES edges in array EDGES are stored in array NEW_EDGES, | |
1349 | also in the same order. | |
1350 | ||
1351 | Newly created basic blocks are put after the basic block AFTER in the | |
1352 | instruction stream, and the order of the blocks in BBS array is preserved. */ | |
1353 | ||
1354 | void | |
1355 | copy_bbs (basic_block *bbs, unsigned n, basic_block *new_bbs, | |
1356 | edge *edges, unsigned num_edges, edge *new_edges, | |
99b1c316 | 1357 | class loop *base, basic_block after, bool update_dominance) |
78bde837 SB |
1358 | { |
1359 | unsigned i, j; | |
1360 | basic_block bb, new_bb, dom_bb; | |
1361 | edge e; | |
229d576c | 1362 | copy_bb_data id; |
78bde837 | 1363 | |
25853b33 RB |
1364 | /* Mark the blocks to be copied. This is used by edge creation hooks |
1365 | to decide whether to reallocate PHI nodes capacity to avoid reallocating | |
1366 | PHIs in the set of source BBs. */ | |
1367 | for (i = 0; i < n; i++) | |
1368 | bbs[i]->flags |= BB_DUPLICATED; | |
1369 | ||
78bde837 SB |
1370 | /* Duplicate bbs, update dominators, assign bbs to loops. */ |
1371 | for (i = 0; i < n; i++) | |
1372 | { | |
1373 | /* Duplicate. */ | |
1374 | bb = bbs[i]; | |
229d576c | 1375 | new_bb = new_bbs[i] = duplicate_block (bb, NULL, after, &id); |
78bde837 | 1376 | after = new_bb; |
066b8354 AH |
1377 | if (bb->loop_father) |
1378 | { | |
1379 | /* Possibly set loop header. */ | |
1380 | if (bb->loop_father->header == bb && bb->loop_father != base) | |
1381 | new_bb->loop_father->header = new_bb; | |
1382 | /* Or latch. */ | |
1383 | if (bb->loop_father->latch == bb && bb->loop_father != base) | |
1384 | new_bb->loop_father->latch = new_bb; | |
1385 | } | |
78bde837 SB |
1386 | } |
1387 | ||
1388 | /* Set dominators. */ | |
f14540b6 | 1389 | if (update_dominance) |
78bde837 | 1390 | { |
f14540b6 | 1391 | for (i = 0; i < n; i++) |
78bde837 | 1392 | { |
f14540b6 SE |
1393 | bb = bbs[i]; |
1394 | new_bb = new_bbs[i]; | |
1395 | ||
1396 | dom_bb = get_immediate_dominator (CDI_DOMINATORS, bb); | |
1397 | if (dom_bb->flags & BB_DUPLICATED) | |
1398 | { | |
1399 | dom_bb = get_bb_copy (dom_bb); | |
1400 | set_immediate_dominator (CDI_DOMINATORS, new_bb, dom_bb); | |
1401 | } | |
78bde837 SB |
1402 | } |
1403 | } | |
1404 | ||
1405 | /* Redirect edges. */ | |
78bde837 SB |
1406 | for (i = 0; i < n; i++) |
1407 | { | |
1408 | edge_iterator ei; | |
1409 | new_bb = new_bbs[i]; | |
1410 | bb = bbs[i]; | |
1411 | ||
1412 | FOR_EACH_EDGE (e, ei, new_bb->succs) | |
1413 | { | |
78bde837 SB |
1414 | if (!(e->dest->flags & BB_DUPLICATED)) |
1415 | continue; | |
1416 | redirect_edge_and_branch_force (e, get_bb_copy (e->dest)); | |
1417 | } | |
1418 | } | |
4fa5dc95 RB |
1419 | for (j = 0; j < num_edges; j++) |
1420 | { | |
1421 | if (!edges[j]) | |
1422 | new_edges[j] = NULL; | |
1423 | else | |
1424 | { | |
1425 | basic_block src = edges[j]->src; | |
1426 | basic_block dest = edges[j]->dest; | |
1427 | if (src->flags & BB_DUPLICATED) | |
1428 | src = get_bb_copy (src); | |
1429 | if (dest->flags & BB_DUPLICATED) | |
1430 | dest = get_bb_copy (dest); | |
1431 | new_edges[j] = find_edge (src, dest); | |
1432 | } | |
1433 | } | |
78bde837 SB |
1434 | |
1435 | /* Clear information about duplicates. */ | |
1436 | for (i = 0; i < n; i++) | |
1437 | bbs[i]->flags &= ~BB_DUPLICATED; | |
1438 | } | |
1439 | ||
df92c640 SB |
1440 | /* Return true if BB contains only labels or non-executable |
1441 | instructions */ | |
1442 | bool | |
1443 | empty_block_p (basic_block bb) | |
1444 | { | |
1445 | gcc_assert (cfg_hooks->empty_block_p); | |
1446 | return cfg_hooks->empty_block_p (bb); | |
1447 | } | |
1448 | ||
1449 | /* Split a basic block if it ends with a conditional branch and if | |
1450 | the other part of the block is not empty. */ | |
1451 | basic_block | |
1452 | split_block_before_cond_jump (basic_block bb) | |
1453 | { | |
1454 | gcc_assert (cfg_hooks->split_block_before_cond_jump); | |
1455 | return cfg_hooks->split_block_before_cond_jump (bb); | |
1456 | } | |
1457 | ||
e53b6e56 | 1458 | /* Work-horse for passes.cc:check_profile_consistency. |
aa4723d7 | 1459 | Do book-keeping of the CFG for the profile consistency checker. |
160576e1 | 1460 | Store the counting in RECORD. */ |
aa4723d7 SB |
1461 | |
1462 | void | |
160576e1 | 1463 | profile_record_check_consistency (profile_record *record) |
aa4723d7 SB |
1464 | { |
1465 | basic_block bb; | |
1466 | edge_iterator ei; | |
1467 | edge e; | |
aa4723d7 | 1468 | |
04a90bec | 1469 | FOR_ALL_BB_FN (bb, cfun) |
aa4723d7 | 1470 | { |
fefa31b5 | 1471 | if (bb != EXIT_BLOCK_PTR_FOR_FN (cfun) |
d1471457 JH |
1472 | && profile_status_for_fn (cfun) != PROFILE_ABSENT |
1473 | && EDGE_COUNT (bb->succs)) | |
aa4723d7 | 1474 | { |
d1471457 JH |
1475 | sreal sum = 0; |
1476 | bool found = false; | |
aa4723d7 | 1477 | FOR_EACH_EDGE (e, ei, bb->succs) |
d1471457 JH |
1478 | { |
1479 | if (!(e->flags & (EDGE_EH | EDGE_FAKE))) | |
1480 | found = true; | |
1481 | if (e->probability.initialized_p ()) | |
1482 | sum += e->probability.to_sreal (); | |
1483 | } | |
1484 | double dsum = sum.to_double (); | |
1485 | if (found && (dsum < 0.9 || dsum > 1.1) | |
1486 | && !(bb->count == profile_count::zero ())) | |
1487 | { | |
1488 | record->num_mismatched_prob_out++; | |
1489 | dsum = dsum > 1 ? dsum - 1 : 1 - dsum; | |
1490 | if (profile_info) | |
1491 | { | |
1492 | if (ENTRY_BLOCK_PTR_FOR_FN | |
1493 | (cfun)->count.ipa ().initialized_p () | |
1494 | && ENTRY_BLOCK_PTR_FOR_FN | |
1495 | (cfun)->count.ipa ().nonzero_p () | |
1496 | && bb->count.ipa ().initialized_p ()) | |
1497 | record->dyn_mismatched_prob_out | |
1498 | += dsum * bb->count.ipa ().to_gcov_type (); | |
1499 | } | |
1500 | else if (bb->count.initialized_p ()) | |
1501 | record->dyn_mismatched_prob_out | |
1502 | += dsum * bb->count.to_sreal_scale | |
1503 | (ENTRY_BLOCK_PTR_FOR_FN (cfun)->count).to_double (); | |
1504 | } | |
aa4723d7 | 1505 | } |
fefa31b5 | 1506 | if (bb != ENTRY_BLOCK_PTR_FOR_FN (cfun) |
0a6a6ac9 | 1507 | && profile_status_for_fn (cfun) != PROFILE_ABSENT) |
aa4723d7 | 1508 | { |
3995f3a2 | 1509 | profile_count lsum = profile_count::zero (); |
aa4723d7 | 1510 | FOR_EACH_EDGE (e, ei, bb->preds) |
d1471457 JH |
1511 | lsum += e->count (); |
1512 | if (lsum.differs_from_p (bb->count)) | |
160576e1 | 1513 | { |
d1471457 JH |
1514 | record->num_mismatched_count_in++; |
1515 | profile_count max; | |
1516 | if (lsum < bb->count) | |
1517 | max = bb->count; | |
1518 | else | |
1519 | max = lsum; | |
1520 | if (profile_info) | |
1521 | { | |
1522 | if (ENTRY_BLOCK_PTR_FOR_FN | |
1523 | (cfun)->count.ipa ().initialized_p () | |
1524 | && ENTRY_BLOCK_PTR_FOR_FN | |
1525 | (cfun)->count.ipa ().nonzero_p () | |
1526 | && max.ipa ().initialized_p ()) | |
1527 | record->dyn_mismatched_count_in | |
1528 | += max.ipa ().to_gcov_type (); | |
1529 | } | |
1530 | else if (bb->count.initialized_p ()) | |
1531 | record->dyn_mismatched_prob_out | |
1532 | += max.to_sreal_scale | |
1533 | (ENTRY_BLOCK_PTR_FOR_FN (cfun)->count).to_double (); | |
160576e1 | 1534 | } |
aa4723d7 | 1535 | } |
fefa31b5 DM |
1536 | if (bb == ENTRY_BLOCK_PTR_FOR_FN (cfun) |
1537 | || bb == EXIT_BLOCK_PTR_FOR_FN (cfun)) | |
aa4723d7 | 1538 | continue; |
160576e1 ML |
1539 | } |
1540 | } | |
1541 | ||
e53b6e56 | 1542 | /* Work-horse for passes.cc:acount_profile. |
160576e1 ML |
1543 | Do book-keeping of the CFG for the profile accounting. |
1544 | Store the counting in RECORD. */ | |
1545 | ||
1546 | void | |
1547 | profile_record_account_profile (profile_record *record) | |
1548 | { | |
1549 | basic_block bb; | |
1550 | ||
1551 | FOR_ALL_BB_FN (bb, cfun) | |
1552 | { | |
1553 | gcc_assert (cfg_hooks->account_profile_record); | |
1554 | cfg_hooks->account_profile_record (bb, record); | |
aa4723d7 SB |
1555 | } |
1556 | } | |
0ecf545c MS |
1557 | |
1558 | #if __GNUC__ >= 10 | |
1559 | # pragma GCC diagnostic pop | |
1560 | #endif |