]>
Commit | Line | Data |
---|---|---|
6de9cd9a | 1 | /* Control flow functions for trees. |
611021e1 | 2 | Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007 |
56e84019 | 3 | Free Software Foundation, Inc. |
6de9cd9a DN |
4 | Contributed by Diego Novillo <dnovillo@redhat.com> |
5 | ||
6 | This file is part of GCC. | |
7 | ||
8 | GCC is free software; you can redistribute it and/or modify | |
9 | it under the terms of the GNU General Public License as published by | |
10 | the Free Software Foundation; either version 2, or (at your option) | |
11 | any later version. | |
12 | ||
13 | GCC is distributed in the hope that it will be useful, | |
14 | but WITHOUT ANY WARRANTY; without even the implied warranty of | |
15 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
16 | GNU General Public License 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 | |
366ccddb KC |
20 | the Free Software Foundation, 51 Franklin Street, Fifth Floor, |
21 | Boston, MA 02110-1301, USA. */ | |
6de9cd9a DN |
22 | |
23 | #include "config.h" | |
24 | #include "system.h" | |
25 | #include "coretypes.h" | |
26 | #include "tm.h" | |
27 | #include "tree.h" | |
28 | #include "rtl.h" | |
29 | #include "tm_p.h" | |
30 | #include "hard-reg-set.h" | |
31 | #include "basic-block.h" | |
32 | #include "output.h" | |
6de9cd9a DN |
33 | #include "flags.h" |
34 | #include "function.h" | |
35 | #include "expr.h" | |
36 | #include "ggc.h" | |
37 | #include "langhooks.h" | |
38 | #include "diagnostic.h" | |
39 | #include "tree-flow.h" | |
40 | #include "timevar.h" | |
41 | #include "tree-dump.h" | |
42 | #include "tree-pass.h" | |
43 | #include "toplev.h" | |
44 | #include "except.h" | |
45 | #include "cfgloop.h" | |
42759f1e | 46 | #include "cfglayout.h" |
9af0df6b | 47 | #include "tree-ssa-propagate.h" |
6946b3f7 | 48 | #include "value-prof.h" |
4437b50d | 49 | #include "pointer-set.h" |
6de9cd9a DN |
50 | |
51 | /* This file contains functions for building the Control Flow Graph (CFG) | |
52 | for a function tree. */ | |
53 | ||
54 | /* Local declarations. */ | |
55 | ||
56 | /* Initial capacity for the basic block array. */ | |
57 | static const int initial_cfg_capacity = 20; | |
58 | ||
d6be0d7f JL |
59 | /* This hash table allows us to efficiently lookup all CASE_LABEL_EXPRs |
60 | which use a particular edge. The CASE_LABEL_EXPRs are chained together | |
61 | via their TREE_CHAIN field, which we clear after we're done with the | |
62 | hash table to prevent problems with duplication of SWITCH_EXPRs. | |
92b6dff3 | 63 | |
d6be0d7f JL |
64 | Access to this list of CASE_LABEL_EXPRs allows us to efficiently |
65 | update the case vector in response to edge redirections. | |
92b6dff3 | 66 | |
d6be0d7f JL |
67 | Right now this table is set up and torn down at key points in the |
68 | compilation process. It would be nice if we could make the table | |
69 | more persistent. The key is getting notification of changes to | |
70 | the CFG (particularly edge removal, creation and redirection). */ | |
71 | ||
15814ba0 | 72 | static struct pointer_map_t *edge_to_cases; |
92b6dff3 | 73 | |
6de9cd9a DN |
74 | /* CFG statistics. */ |
75 | struct cfg_stats_d | |
76 | { | |
77 | long num_merged_labels; | |
78 | }; | |
79 | ||
80 | static struct cfg_stats_d cfg_stats; | |
81 | ||
82 | /* Nonzero if we found a computed goto while building basic blocks. */ | |
83 | static bool found_computed_goto; | |
84 | ||
85 | /* Basic blocks and flowgraphs. */ | |
86 | static basic_block create_bb (void *, void *, basic_block); | |
6de9cd9a DN |
87 | static void make_blocks (tree); |
88 | static void factor_computed_gotos (void); | |
6de9cd9a DN |
89 | |
90 | /* Edges. */ | |
91 | static void make_edges (void); | |
6de9cd9a DN |
92 | static void make_cond_expr_edges (basic_block); |
93 | static void make_switch_expr_edges (basic_block); | |
94 | static void make_goto_expr_edges (basic_block); | |
95 | static edge tree_redirect_edge_and_branch (edge, basic_block); | |
96 | static edge tree_try_redirect_by_replacing_jump (edge, basic_block); | |
c2924966 | 97 | static unsigned int split_critical_edges (void); |
6de9cd9a DN |
98 | |
99 | /* Various helpers. */ | |
100 | static inline bool stmt_starts_bb_p (tree, tree); | |
101 | static int tree_verify_flow_info (void); | |
102 | static void tree_make_forwarder_block (edge); | |
6de9cd9a | 103 | static void tree_cfg2vcg (FILE *); |
0a4fe58f | 104 | static inline void change_bb_for_stmt (tree t, basic_block bb); |
6de9cd9a DN |
105 | |
106 | /* Flowgraph optimization and cleanup. */ | |
107 | static void tree_merge_blocks (basic_block, basic_block); | |
108 | static bool tree_can_merge_blocks_p (basic_block, basic_block); | |
109 | static void remove_bb (basic_block); | |
be477406 | 110 | static edge find_taken_edge_computed_goto (basic_block, tree); |
6de9cd9a DN |
111 | static edge find_taken_edge_cond_expr (basic_block, tree); |
112 | static edge find_taken_edge_switch_expr (basic_block, tree); | |
113 | static tree find_case_label_for_value (tree, tree); | |
6de9cd9a | 114 | |
a930a4ef JH |
115 | void |
116 | init_empty_tree_cfg (void) | |
117 | { | |
118 | /* Initialize the basic block array. */ | |
119 | init_flow (); | |
120 | profile_status = PROFILE_ABSENT; | |
24bd1a0b DB |
121 | n_basic_blocks = NUM_FIXED_BLOCKS; |
122 | last_basic_block = NUM_FIXED_BLOCKS; | |
68f9b844 | 123 | basic_block_info = VEC_alloc (basic_block, gc, initial_cfg_capacity); |
a590ac65 KH |
124 | VEC_safe_grow_cleared (basic_block, gc, basic_block_info, |
125 | initial_cfg_capacity); | |
a930a4ef JH |
126 | |
127 | /* Build a mapping of labels to their associated blocks. */ | |
e597f337 | 128 | label_to_block_map = VEC_alloc (basic_block, gc, initial_cfg_capacity); |
a590ac65 KH |
129 | VEC_safe_grow_cleared (basic_block, gc, label_to_block_map, |
130 | initial_cfg_capacity); | |
a930a4ef | 131 | |
68f9b844 KH |
132 | SET_BASIC_BLOCK (ENTRY_BLOCK, ENTRY_BLOCK_PTR); |
133 | SET_BASIC_BLOCK (EXIT_BLOCK, EXIT_BLOCK_PTR); | |
a930a4ef JH |
134 | ENTRY_BLOCK_PTR->next_bb = EXIT_BLOCK_PTR; |
135 | EXIT_BLOCK_PTR->prev_bb = ENTRY_BLOCK_PTR; | |
a930a4ef | 136 | } |
6de9cd9a DN |
137 | |
138 | /*--------------------------------------------------------------------------- | |
139 | Create basic blocks | |
140 | ---------------------------------------------------------------------------*/ | |
141 | ||
142 | /* Entry point to the CFG builder for trees. TP points to the list of | |
143 | statements to be added to the flowgraph. */ | |
144 | ||
145 | static void | |
146 | build_tree_cfg (tree *tp) | |
147 | { | |
148 | /* Register specific tree functions. */ | |
149 | tree_register_cfg_hooks (); | |
150 | ||
6de9cd9a DN |
151 | memset ((void *) &cfg_stats, 0, sizeof (cfg_stats)); |
152 | ||
a930a4ef | 153 | init_empty_tree_cfg (); |
6de9cd9a DN |
154 | |
155 | found_computed_goto = 0; | |
156 | make_blocks (*tp); | |
157 | ||
158 | /* Computed gotos are hell to deal with, especially if there are | |
159 | lots of them with a large number of destinations. So we factor | |
160 | them to a common computed goto location before we build the | |
161 | edge list. After we convert back to normal form, we will un-factor | |
162 | the computed gotos since factoring introduces an unwanted jump. */ | |
163 | if (found_computed_goto) | |
164 | factor_computed_gotos (); | |
165 | ||
f0b698c1 | 166 | /* Make sure there is always at least one block, even if it's empty. */ |
24bd1a0b | 167 | if (n_basic_blocks == NUM_FIXED_BLOCKS) |
6de9cd9a DN |
168 | create_empty_bb (ENTRY_BLOCK_PTR); |
169 | ||
6de9cd9a | 170 | /* Adjust the size of the array. */ |
68f9b844 | 171 | if (VEC_length (basic_block, basic_block_info) < (size_t) n_basic_blocks) |
a590ac65 | 172 | VEC_safe_grow_cleared (basic_block, gc, basic_block_info, n_basic_blocks); |
6de9cd9a | 173 | |
f667741c SB |
174 | /* To speed up statement iterator walks, we first purge dead labels. */ |
175 | cleanup_dead_labels (); | |
176 | ||
177 | /* Group case nodes to reduce the number of edges. | |
178 | We do this after cleaning up dead labels because otherwise we miss | |
179 | a lot of obvious case merging opportunities. */ | |
180 | group_case_labels (); | |
181 | ||
6de9cd9a DN |
182 | /* Create the edges of the flowgraph. */ |
183 | make_edges (); | |
8b11009b | 184 | cleanup_dead_labels (); |
6de9cd9a DN |
185 | |
186 | /* Debugging dumps. */ | |
187 | ||
188 | /* Write the flowgraph to a VCG file. */ | |
189 | { | |
190 | int local_dump_flags; | |
10d22567 ZD |
191 | FILE *vcg_file = dump_begin (TDI_vcg, &local_dump_flags); |
192 | if (vcg_file) | |
6de9cd9a | 193 | { |
10d22567 ZD |
194 | tree_cfg2vcg (vcg_file); |
195 | dump_end (TDI_vcg, vcg_file); | |
6de9cd9a DN |
196 | } |
197 | } | |
198 | ||
81cfbbc2 JH |
199 | #ifdef ENABLE_CHECKING |
200 | verify_stmts (); | |
201 | #endif | |
202 | ||
6de9cd9a DN |
203 | /* Dump a textual representation of the flowgraph. */ |
204 | if (dump_file) | |
205 | dump_tree_cfg (dump_file, dump_flags); | |
206 | } | |
207 | ||
c2924966 | 208 | static unsigned int |
6de9cd9a DN |
209 | execute_build_cfg (void) |
210 | { | |
211 | build_tree_cfg (&DECL_SAVED_TREE (current_function_decl)); | |
c2924966 | 212 | return 0; |
6de9cd9a DN |
213 | } |
214 | ||
215 | struct tree_opt_pass pass_build_cfg = | |
216 | { | |
217 | "cfg", /* name */ | |
218 | NULL, /* gate */ | |
219 | execute_build_cfg, /* execute */ | |
220 | NULL, /* sub */ | |
221 | NULL, /* next */ | |
222 | 0, /* static_pass_number */ | |
223 | TV_TREE_CFG, /* tv_id */ | |
224 | PROP_gimple_leh, /* properties_required */ | |
225 | PROP_cfg, /* properties_provided */ | |
226 | 0, /* properties_destroyed */ | |
227 | 0, /* todo_flags_start */ | |
1994bfea | 228 | TODO_verify_stmts | TODO_cleanup_cfg, /* todo_flags_finish */ |
9f8628ba | 229 | 0 /* letter */ |
6de9cd9a DN |
230 | }; |
231 | ||
6531d1be | 232 | /* Search the CFG for any computed gotos. If found, factor them to a |
6de9cd9a | 233 | common computed goto site. Also record the location of that site so |
6531d1be | 234 | that we can un-factor the gotos after we have converted back to |
6de9cd9a DN |
235 | normal form. */ |
236 | ||
237 | static void | |
238 | factor_computed_gotos (void) | |
239 | { | |
240 | basic_block bb; | |
241 | tree factored_label_decl = NULL; | |
242 | tree var = NULL; | |
243 | tree factored_computed_goto_label = NULL; | |
244 | tree factored_computed_goto = NULL; | |
245 | ||
246 | /* We know there are one or more computed gotos in this function. | |
247 | Examine the last statement in each basic block to see if the block | |
248 | ends with a computed goto. */ | |
6531d1be | 249 | |
6de9cd9a DN |
250 | FOR_EACH_BB (bb) |
251 | { | |
252 | block_stmt_iterator bsi = bsi_last (bb); | |
253 | tree last; | |
254 | ||
255 | if (bsi_end_p (bsi)) | |
256 | continue; | |
257 | last = bsi_stmt (bsi); | |
258 | ||
259 | /* Ignore the computed goto we create when we factor the original | |
260 | computed gotos. */ | |
261 | if (last == factored_computed_goto) | |
262 | continue; | |
263 | ||
264 | /* If the last statement is a computed goto, factor it. */ | |
265 | if (computed_goto_p (last)) | |
266 | { | |
267 | tree assignment; | |
268 | ||
269 | /* The first time we find a computed goto we need to create | |
270 | the factored goto block and the variable each original | |
271 | computed goto will use for their goto destination. */ | |
272 | if (! factored_computed_goto) | |
273 | { | |
274 | basic_block new_bb = create_empty_bb (bb); | |
275 | block_stmt_iterator new_bsi = bsi_start (new_bb); | |
276 | ||
277 | /* Create the destination of the factored goto. Each original | |
278 | computed goto will put its desired destination into this | |
279 | variable and jump to the label we create immediately | |
280 | below. */ | |
281 | var = create_tmp_var (ptr_type_node, "gotovar"); | |
282 | ||
283 | /* Build a label for the new block which will contain the | |
284 | factored computed goto. */ | |
285 | factored_label_decl = create_artificial_label (); | |
286 | factored_computed_goto_label | |
287 | = build1 (LABEL_EXPR, void_type_node, factored_label_decl); | |
288 | bsi_insert_after (&new_bsi, factored_computed_goto_label, | |
289 | BSI_NEW_STMT); | |
290 | ||
291 | /* Build our new computed goto. */ | |
292 | factored_computed_goto = build1 (GOTO_EXPR, void_type_node, var); | |
293 | bsi_insert_after (&new_bsi, factored_computed_goto, | |
294 | BSI_NEW_STMT); | |
295 | } | |
296 | ||
297 | /* Copy the original computed goto's destination into VAR. */ | |
939409af RS |
298 | assignment = build_gimple_modify_stmt (var, |
299 | GOTO_DESTINATION (last)); | |
6de9cd9a DN |
300 | bsi_insert_before (&bsi, assignment, BSI_SAME_STMT); |
301 | ||
302 | /* And re-vector the computed goto to the new destination. */ | |
303 | GOTO_DESTINATION (last) = factored_label_decl; | |
304 | } | |
305 | } | |
306 | } | |
307 | ||
308 | ||
6de9cd9a DN |
309 | /* Build a flowgraph for the statement_list STMT_LIST. */ |
310 | ||
311 | static void | |
312 | make_blocks (tree stmt_list) | |
313 | { | |
314 | tree_stmt_iterator i = tsi_start (stmt_list); | |
315 | tree stmt = NULL; | |
316 | bool start_new_block = true; | |
317 | bool first_stmt_of_list = true; | |
318 | basic_block bb = ENTRY_BLOCK_PTR; | |
319 | ||
320 | while (!tsi_end_p (i)) | |
321 | { | |
322 | tree prev_stmt; | |
323 | ||
324 | prev_stmt = stmt; | |
325 | stmt = tsi_stmt (i); | |
326 | ||
327 | /* If the statement starts a new basic block or if we have determined | |
328 | in a previous pass that we need to create a new block for STMT, do | |
329 | so now. */ | |
330 | if (start_new_block || stmt_starts_bb_p (stmt, prev_stmt)) | |
331 | { | |
332 | if (!first_stmt_of_list) | |
333 | stmt_list = tsi_split_statement_list_before (&i); | |
334 | bb = create_basic_block (stmt_list, NULL, bb); | |
335 | start_new_block = false; | |
336 | } | |
337 | ||
338 | /* Now add STMT to BB and create the subgraphs for special statement | |
339 | codes. */ | |
340 | set_bb_for_stmt (stmt, bb); | |
341 | ||
342 | if (computed_goto_p (stmt)) | |
343 | found_computed_goto = true; | |
344 | ||
345 | /* If STMT is a basic block terminator, set START_NEW_BLOCK for the | |
346 | next iteration. */ | |
347 | if (stmt_ends_bb_p (stmt)) | |
348 | start_new_block = true; | |
349 | ||
350 | tsi_next (&i); | |
351 | first_stmt_of_list = false; | |
352 | } | |
353 | } | |
354 | ||
355 | ||
356 | /* Create and return a new empty basic block after bb AFTER. */ | |
357 | ||
358 | static basic_block | |
359 | create_bb (void *h, void *e, basic_block after) | |
360 | { | |
361 | basic_block bb; | |
362 | ||
1e128c5f | 363 | gcc_assert (!e); |
6de9cd9a | 364 | |
27fd69fa KH |
365 | /* Create and initialize a new basic block. Since alloc_block uses |
366 | ggc_alloc_cleared to allocate a basic block, we do not have to | |
367 | clear the newly allocated basic block here. */ | |
6de9cd9a | 368 | bb = alloc_block (); |
6de9cd9a DN |
369 | |
370 | bb->index = last_basic_block; | |
371 | bb->flags = BB_NEW; | |
7506e1cb ZD |
372 | bb->il.tree = GGC_CNEW (struct tree_bb_info); |
373 | set_bb_stmt_list (bb, h ? (tree) h : alloc_stmt_list ()); | |
6de9cd9a DN |
374 | |
375 | /* Add the new block to the linked list of blocks. */ | |
376 | link_block (bb, after); | |
377 | ||
378 | /* Grow the basic block array if needed. */ | |
68f9b844 | 379 | if ((size_t) last_basic_block == VEC_length (basic_block, basic_block_info)) |
6de9cd9a DN |
380 | { |
381 | size_t new_size = last_basic_block + (last_basic_block + 3) / 4; | |
a590ac65 | 382 | VEC_safe_grow_cleared (basic_block, gc, basic_block_info, new_size); |
6de9cd9a DN |
383 | } |
384 | ||
385 | /* Add the newly created block to the array. */ | |
68f9b844 | 386 | SET_BASIC_BLOCK (last_basic_block, bb); |
6de9cd9a | 387 | |
6de9cd9a DN |
388 | n_basic_blocks++; |
389 | last_basic_block++; | |
390 | ||
6de9cd9a DN |
391 | return bb; |
392 | } | |
393 | ||
394 | ||
395 | /*--------------------------------------------------------------------------- | |
396 | Edge creation | |
397 | ---------------------------------------------------------------------------*/ | |
398 | ||
fca01525 KH |
399 | /* Fold COND_EXPR_COND of each COND_EXPR. */ |
400 | ||
e21aff8a | 401 | void |
fca01525 KH |
402 | fold_cond_expr_cond (void) |
403 | { | |
404 | basic_block bb; | |
405 | ||
406 | FOR_EACH_BB (bb) | |
407 | { | |
408 | tree stmt = last_stmt (bb); | |
409 | ||
410 | if (stmt | |
411 | && TREE_CODE (stmt) == COND_EXPR) | |
412 | { | |
6ac01510 ILT |
413 | tree cond; |
414 | bool zerop, onep; | |
415 | ||
416 | fold_defer_overflow_warnings (); | |
417 | cond = fold (COND_EXPR_COND (stmt)); | |
418 | zerop = integer_zerop (cond); | |
419 | onep = integer_onep (cond); | |
4df28528 ILT |
420 | fold_undefer_overflow_warnings (((zerop || onep) |
421 | && !TREE_NO_WARNING (stmt)), | |
422 | stmt, | |
6ac01510 ILT |
423 | WARN_STRICT_OVERFLOW_CONDITIONAL); |
424 | if (zerop) | |
4bafe847 | 425 | COND_EXPR_COND (stmt) = boolean_false_node; |
6ac01510 | 426 | else if (onep) |
4bafe847 | 427 | COND_EXPR_COND (stmt) = boolean_true_node; |
fca01525 KH |
428 | } |
429 | } | |
430 | } | |
431 | ||
6de9cd9a DN |
432 | /* Join all the blocks in the flowgraph. */ |
433 | ||
434 | static void | |
435 | make_edges (void) | |
436 | { | |
437 | basic_block bb; | |
bed575d5 | 438 | struct omp_region *cur_region = NULL; |
6de9cd9a DN |
439 | |
440 | /* Create an edge from entry to the first block with executable | |
441 | statements in it. */ | |
24bd1a0b | 442 | make_edge (ENTRY_BLOCK_PTR, BASIC_BLOCK (NUM_FIXED_BLOCKS), EDGE_FALLTHRU); |
6de9cd9a | 443 | |
adb35797 | 444 | /* Traverse the basic block array placing edges. */ |
6de9cd9a DN |
445 | FOR_EACH_BB (bb) |
446 | { | |
6de9cd9a | 447 | tree last = last_stmt (bb); |
56e84019 | 448 | bool fallthru; |
6de9cd9a | 449 | |
56e84019 | 450 | if (last) |
6de9cd9a | 451 | { |
bed575d5 RS |
452 | enum tree_code code = TREE_CODE (last); |
453 | switch (code) | |
56e84019 RH |
454 | { |
455 | case GOTO_EXPR: | |
456 | make_goto_expr_edges (bb); | |
457 | fallthru = false; | |
458 | break; | |
459 | case RETURN_EXPR: | |
460 | make_edge (bb, EXIT_BLOCK_PTR, 0); | |
461 | fallthru = false; | |
462 | break; | |
463 | case COND_EXPR: | |
464 | make_cond_expr_edges (bb); | |
465 | fallthru = false; | |
466 | break; | |
467 | case SWITCH_EXPR: | |
468 | make_switch_expr_edges (bb); | |
469 | fallthru = false; | |
470 | break; | |
471 | case RESX_EXPR: | |
472 | make_eh_edges (last); | |
473 | fallthru = false; | |
474 | break; | |
475 | ||
476 | case CALL_EXPR: | |
477 | /* If this function receives a nonlocal goto, then we need to | |
478 | make edges from this call site to all the nonlocal goto | |
479 | handlers. */ | |
4f6c2131 EB |
480 | if (tree_can_make_abnormal_goto (last)) |
481 | make_abnormal_goto_edges (bb, true); | |
6de9cd9a | 482 | |
56e84019 RH |
483 | /* If this statement has reachable exception handlers, then |
484 | create abnormal edges to them. */ | |
485 | make_eh_edges (last); | |
486 | ||
487 | /* Some calls are known not to return. */ | |
488 | fallthru = !(call_expr_flags (last) & ECF_NORETURN); | |
489 | break; | |
490 | ||
491 | case MODIFY_EXPR: | |
07beea0d AH |
492 | gcc_unreachable (); |
493 | ||
494 | case GIMPLE_MODIFY_STMT: | |
56e84019 RH |
495 | if (is_ctrl_altering_stmt (last)) |
496 | { | |
07beea0d AH |
497 | /* A GIMPLE_MODIFY_STMT may have a CALL_EXPR on its RHS and |
498 | the CALL_EXPR may have an abnormal edge. Search the RHS | |
499 | for this case and create any required edges. */ | |
4f6c2131 EB |
500 | if (tree_can_make_abnormal_goto (last)) |
501 | make_abnormal_goto_edges (bb, true); | |
56e84019 RH |
502 | |
503 | make_eh_edges (last); | |
504 | } | |
505 | fallthru = true; | |
506 | break; | |
507 | ||
508 | case OMP_PARALLEL: | |
509 | case OMP_FOR: | |
510 | case OMP_SINGLE: | |
511 | case OMP_MASTER: | |
512 | case OMP_ORDERED: | |
513 | case OMP_CRITICAL: | |
514 | case OMP_SECTION: | |
bed575d5 | 515 | cur_region = new_omp_region (bb, code, cur_region); |
56e84019 RH |
516 | fallthru = true; |
517 | break; | |
518 | ||
7e2df4a1 | 519 | case OMP_SECTIONS: |
bed575d5 | 520 | cur_region = new_omp_region (bb, code, cur_region); |
7e2df4a1 | 521 | fallthru = false; |
777f7f9a RH |
522 | break; |
523 | ||
bed575d5 RS |
524 | case OMP_RETURN: |
525 | /* In the case of an OMP_SECTION, the edge will go somewhere | |
526 | other than the next block. This will be created later. */ | |
527 | cur_region->exit = bb; | |
528 | fallthru = cur_region->type != OMP_SECTION; | |
529 | cur_region = cur_region->outer; | |
530 | break; | |
531 | ||
532 | case OMP_CONTINUE: | |
533 | cur_region->cont = bb; | |
534 | switch (cur_region->type) | |
535 | { | |
536 | case OMP_FOR: | |
537 | /* ??? Technically there should be a some sort of loopback | |
538 | edge here, but it goes to a block that doesn't exist yet, | |
539 | and without it, updating the ssa form would be a real | |
540 | bear. Fortunately, we don't yet do ssa before expanding | |
541 | these nodes. */ | |
542 | break; | |
543 | ||
544 | case OMP_SECTIONS: | |
545 | /* Wire up the edges into and out of the nested sections. */ | |
546 | /* ??? Similarly wrt loopback. */ | |
547 | { | |
548 | struct omp_region *i; | |
549 | for (i = cur_region->inner; i ; i = i->next) | |
550 | { | |
551 | gcc_assert (i->type == OMP_SECTION); | |
552 | make_edge (cur_region->entry, i->entry, 0); | |
553 | make_edge (i->exit, bb, EDGE_FALLTHRU); | |
554 | } | |
555 | } | |
556 | break; | |
6531d1be | 557 | |
bed575d5 RS |
558 | default: |
559 | gcc_unreachable (); | |
560 | } | |
561 | fallthru = true; | |
562 | break; | |
563 | ||
56e84019 RH |
564 | default: |
565 | gcc_assert (!stmt_ends_bb_p (last)); | |
566 | fallthru = true; | |
567 | } | |
6de9cd9a | 568 | } |
56e84019 RH |
569 | else |
570 | fallthru = true; | |
6de9cd9a | 571 | |
56e84019 | 572 | if (fallthru) |
6de9cd9a DN |
573 | make_edge (bb, bb->next_bb, EDGE_FALLTHRU); |
574 | } | |
575 | ||
bed575d5 RS |
576 | if (root_omp_region) |
577 | free_omp_regions (); | |
578 | ||
fca01525 KH |
579 | /* Fold COND_EXPR_COND of each COND_EXPR. */ |
580 | fold_cond_expr_cond (); | |
6de9cd9a DN |
581 | } |
582 | ||
583 | ||
6de9cd9a DN |
584 | /* Create the edges for a COND_EXPR starting at block BB. |
585 | At this point, both clauses must contain only simple gotos. */ | |
586 | ||
587 | static void | |
588 | make_cond_expr_edges (basic_block bb) | |
589 | { | |
590 | tree entry = last_stmt (bb); | |
591 | basic_block then_bb, else_bb; | |
592 | tree then_label, else_label; | |
d783b2a2 | 593 | edge e; |
6de9cd9a | 594 | |
1e128c5f GB |
595 | gcc_assert (entry); |
596 | gcc_assert (TREE_CODE (entry) == COND_EXPR); | |
6de9cd9a DN |
597 | |
598 | /* Entry basic blocks for each component. */ | |
599 | then_label = GOTO_DESTINATION (COND_EXPR_THEN (entry)); | |
600 | else_label = GOTO_DESTINATION (COND_EXPR_ELSE (entry)); | |
601 | then_bb = label_to_block (then_label); | |
602 | else_bb = label_to_block (else_label); | |
603 | ||
d783b2a2 JH |
604 | e = make_edge (bb, then_bb, EDGE_TRUE_VALUE); |
605 | #ifdef USE_MAPPED_LOCATION | |
606 | e->goto_locus = EXPR_LOCATION (COND_EXPR_THEN (entry)); | |
607 | #else | |
608 | e->goto_locus = EXPR_LOCUS (COND_EXPR_THEN (entry)); | |
609 | #endif | |
610 | e = make_edge (bb, else_bb, EDGE_FALSE_VALUE); | |
611 | if (e) | |
612 | { | |
613 | #ifdef USE_MAPPED_LOCATION | |
614 | e->goto_locus = EXPR_LOCATION (COND_EXPR_ELSE (entry)); | |
615 | #else | |
616 | e->goto_locus = EXPR_LOCUS (COND_EXPR_ELSE (entry)); | |
617 | #endif | |
618 | } | |
a9b77cd1 ZD |
619 | |
620 | /* We do not need the gotos anymore. */ | |
621 | COND_EXPR_THEN (entry) = NULL_TREE; | |
622 | COND_EXPR_ELSE (entry) = NULL_TREE; | |
6de9cd9a DN |
623 | } |
624 | ||
92b6dff3 | 625 | |
d6be0d7f JL |
626 | /* Called for each element in the hash table (P) as we delete the |
627 | edge to cases hash table. | |
628 | ||
6531d1be | 629 | Clear all the TREE_CHAINs to prevent problems with copying of |
d6be0d7f JL |
630 | SWITCH_EXPRs and structure sharing rules, then free the hash table |
631 | element. */ | |
632 | ||
15814ba0 PB |
633 | static bool |
634 | edge_to_cases_cleanup (void *key ATTRIBUTE_UNUSED, void **value, | |
635 | void *data ATTRIBUTE_UNUSED) | |
d6be0d7f | 636 | { |
d6be0d7f JL |
637 | tree t, next; |
638 | ||
15814ba0 | 639 | for (t = (tree) *value; t; t = next) |
d6be0d7f JL |
640 | { |
641 | next = TREE_CHAIN (t); | |
642 | TREE_CHAIN (t) = NULL; | |
643 | } | |
15814ba0 PB |
644 | |
645 | *value = NULL; | |
646 | return false; | |
d6be0d7f JL |
647 | } |
648 | ||
649 | /* Start recording information mapping edges to case labels. */ | |
650 | ||
c9784e6d | 651 | void |
d6be0d7f JL |
652 | start_recording_case_labels (void) |
653 | { | |
654 | gcc_assert (edge_to_cases == NULL); | |
15814ba0 | 655 | edge_to_cases = pointer_map_create (); |
d6be0d7f JL |
656 | } |
657 | ||
658 | /* Return nonzero if we are recording information for case labels. */ | |
659 | ||
660 | static bool | |
661 | recording_case_labels_p (void) | |
662 | { | |
663 | return (edge_to_cases != NULL); | |
664 | } | |
665 | ||
666 | /* Stop recording information mapping edges to case labels and | |
667 | remove any information we have recorded. */ | |
c9784e6d | 668 | void |
d6be0d7f JL |
669 | end_recording_case_labels (void) |
670 | { | |
15814ba0 PB |
671 | pointer_map_traverse (edge_to_cases, edge_to_cases_cleanup, NULL); |
672 | pointer_map_destroy (edge_to_cases); | |
d6be0d7f JL |
673 | edge_to_cases = NULL; |
674 | } | |
675 | ||
d6be0d7f JL |
676 | /* If we are inside a {start,end}_recording_cases block, then return |
677 | a chain of CASE_LABEL_EXPRs from T which reference E. | |
678 | ||
679 | Otherwise return NULL. */ | |
92b6dff3 JL |
680 | |
681 | static tree | |
d6be0d7f | 682 | get_cases_for_edge (edge e, tree t) |
92b6dff3 | 683 | { |
92b6dff3 | 684 | void **slot; |
d6be0d7f JL |
685 | size_t i, n; |
686 | tree vec; | |
92b6dff3 | 687 | |
d6be0d7f JL |
688 | /* If we are not recording cases, then we do not have CASE_LABEL_EXPR |
689 | chains available. Return NULL so the caller can detect this case. */ | |
690 | if (!recording_case_labels_p ()) | |
691 | return NULL; | |
6531d1be | 692 | |
15814ba0 | 693 | slot = pointer_map_contains (edge_to_cases, e); |
92b6dff3 | 694 | if (slot) |
15814ba0 | 695 | return (tree) *slot; |
92b6dff3 | 696 | |
d6be0d7f JL |
697 | /* If we did not find E in the hash table, then this must be the first |
698 | time we have been queried for information about E & T. Add all the | |
699 | elements from T to the hash table then perform the query again. */ | |
92b6dff3 | 700 | |
d6be0d7f | 701 | vec = SWITCH_LABELS (t); |
92b6dff3 | 702 | n = TREE_VEC_LENGTH (vec); |
92b6dff3 JL |
703 | for (i = 0; i < n; i++) |
704 | { | |
15814ba0 PB |
705 | tree elt = TREE_VEC_ELT (vec, i); |
706 | tree lab = CASE_LABEL (elt); | |
d6be0d7f | 707 | basic_block label_bb = label_to_block (lab); |
15814ba0 PB |
708 | edge this_edge = find_edge (e->src, label_bb); |
709 | ||
710 | /* Add it to the chain of CASE_LABEL_EXPRs referencing E, or create | |
711 | a new chain. */ | |
712 | slot = pointer_map_insert (edge_to_cases, this_edge); | |
713 | TREE_CHAIN (elt) = (tree) *slot; | |
714 | *slot = elt; | |
92b6dff3 | 715 | } |
15814ba0 PB |
716 | |
717 | return (tree) *pointer_map_contains (edge_to_cases, e); | |
92b6dff3 | 718 | } |
6de9cd9a DN |
719 | |
720 | /* Create the edges for a SWITCH_EXPR starting at block BB. | |
721 | At this point, the switch body has been lowered and the | |
722 | SWITCH_LABELS filled in, so this is in effect a multi-way branch. */ | |
723 | ||
724 | static void | |
725 | make_switch_expr_edges (basic_block bb) | |
726 | { | |
727 | tree entry = last_stmt (bb); | |
728 | size_t i, n; | |
729 | tree vec; | |
730 | ||
731 | vec = SWITCH_LABELS (entry); | |
732 | n = TREE_VEC_LENGTH (vec); | |
733 | ||
734 | for (i = 0; i < n; ++i) | |
735 | { | |
736 | tree lab = CASE_LABEL (TREE_VEC_ELT (vec, i)); | |
737 | basic_block label_bb = label_to_block (lab); | |
d6be0d7f | 738 | make_edge (bb, label_bb, 0); |
6de9cd9a DN |
739 | } |
740 | } | |
741 | ||
742 | ||
743 | /* Return the basic block holding label DEST. */ | |
744 | ||
745 | basic_block | |
997de8ed | 746 | label_to_block_fn (struct function *ifun, tree dest) |
6de9cd9a | 747 | { |
242229bb JH |
748 | int uid = LABEL_DECL_UID (dest); |
749 | ||
f0b698c1 KH |
750 | /* We would die hard when faced by an undefined label. Emit a label to |
751 | the very first basic block. This will hopefully make even the dataflow | |
242229bb JH |
752 | and undefined variable warnings quite right. */ |
753 | if ((errorcount || sorrycount) && uid < 0) | |
754 | { | |
6531d1be | 755 | block_stmt_iterator bsi = |
24bd1a0b | 756 | bsi_start (BASIC_BLOCK (NUM_FIXED_BLOCKS)); |
242229bb JH |
757 | tree stmt; |
758 | ||
759 | stmt = build1 (LABEL_EXPR, void_type_node, dest); | |
760 | bsi_insert_before (&bsi, stmt, BSI_NEW_STMT); | |
761 | uid = LABEL_DECL_UID (dest); | |
762 | } | |
e597f337 KH |
763 | if (VEC_length (basic_block, ifun->cfg->x_label_to_block_map) |
764 | <= (unsigned int) uid) | |
98f464e0 | 765 | return NULL; |
e597f337 | 766 | return VEC_index (basic_block, ifun->cfg->x_label_to_block_map, uid); |
6de9cd9a DN |
767 | } |
768 | ||
4f6c2131 EB |
769 | /* Create edges for an abnormal goto statement at block BB. If FOR_CALL |
770 | is true, the source statement is a CALL_EXPR instead of a GOTO_EXPR. */ | |
771 | ||
772 | void | |
773 | make_abnormal_goto_edges (basic_block bb, bool for_call) | |
774 | { | |
775 | basic_block target_bb; | |
776 | block_stmt_iterator bsi; | |
777 | ||
778 | FOR_EACH_BB (target_bb) | |
779 | for (bsi = bsi_start (target_bb); !bsi_end_p (bsi); bsi_next (&bsi)) | |
780 | { | |
781 | tree target = bsi_stmt (bsi); | |
782 | ||
783 | if (TREE_CODE (target) != LABEL_EXPR) | |
784 | break; | |
785 | ||
786 | target = LABEL_EXPR_LABEL (target); | |
787 | ||
788 | /* Make an edge to every label block that has been marked as a | |
789 | potential target for a computed goto or a non-local goto. */ | |
790 | if ((FORCED_LABEL (target) && !for_call) | |
791 | || (DECL_NONLOCAL (target) && for_call)) | |
792 | { | |
793 | make_edge (bb, target_bb, EDGE_ABNORMAL); | |
794 | break; | |
795 | } | |
796 | } | |
797 | } | |
798 | ||
6de9cd9a DN |
799 | /* Create edges for a goto statement at block BB. */ |
800 | ||
801 | static void | |
802 | make_goto_expr_edges (basic_block bb) | |
803 | { | |
6de9cd9a | 804 | block_stmt_iterator last = bsi_last (bb); |
4f6c2131 | 805 | tree goto_t = bsi_stmt (last); |
6de9cd9a | 806 | |
4f6c2131 EB |
807 | /* A simple GOTO creates normal edges. */ |
808 | if (simple_goto_p (goto_t)) | |
6de9cd9a | 809 | { |
7d3bf067 | 810 | tree dest = GOTO_DESTINATION (goto_t); |
4f6c2131 | 811 | edge e = make_edge (bb, label_to_block (dest), EDGE_FALLTHRU); |
9506ac2b | 812 | #ifdef USE_MAPPED_LOCATION |
4f6c2131 | 813 | e->goto_locus = EXPR_LOCATION (goto_t); |
9506ac2b | 814 | #else |
4f6c2131 | 815 | e->goto_locus = EXPR_LOCUS (goto_t); |
9506ac2b | 816 | #endif |
4f6c2131 EB |
817 | bsi_remove (&last, true); |
818 | return; | |
6de9cd9a DN |
819 | } |
820 | ||
4f6c2131 EB |
821 | /* A computed GOTO creates abnormal edges. */ |
822 | make_abnormal_goto_edges (bb, false); | |
6de9cd9a DN |
823 | } |
824 | ||
825 | ||
826 | /*--------------------------------------------------------------------------- | |
827 | Flowgraph analysis | |
828 | ---------------------------------------------------------------------------*/ | |
829 | ||
f698d217 SB |
830 | /* Cleanup useless labels in basic blocks. This is something we wish |
831 | to do early because it allows us to group case labels before creating | |
832 | the edges for the CFG, and it speeds up block statement iterators in | |
833 | all passes later on. | |
8b11009b ZD |
834 | We rerun this pass after CFG is created, to get rid of the labels that |
835 | are no longer referenced. After then we do not run it any more, since | |
836 | (almost) no new labels should be created. */ | |
f698d217 SB |
837 | |
838 | /* A map from basic block index to the leading label of that block. */ | |
8b11009b ZD |
839 | static struct label_record |
840 | { | |
841 | /* The label. */ | |
842 | tree label; | |
843 | ||
844 | /* True if the label is referenced from somewhere. */ | |
845 | bool used; | |
846 | } *label_for_bb; | |
f698d217 SB |
847 | |
848 | /* Callback for for_each_eh_region. Helper for cleanup_dead_labels. */ | |
849 | static void | |
850 | update_eh_label (struct eh_region *region) | |
851 | { | |
852 | tree old_label = get_eh_region_tree_label (region); | |
853 | if (old_label) | |
854 | { | |
165b54c3 SB |
855 | tree new_label; |
856 | basic_block bb = label_to_block (old_label); | |
857 | ||
858 | /* ??? After optimizing, there may be EH regions with labels | |
859 | that have already been removed from the function body, so | |
860 | there is no basic block for them. */ | |
861 | if (! bb) | |
862 | return; | |
863 | ||
8b11009b ZD |
864 | new_label = label_for_bb[bb->index].label; |
865 | label_for_bb[bb->index].used = true; | |
f698d217 SB |
866 | set_eh_region_tree_label (region, new_label); |
867 | } | |
868 | } | |
869 | ||
242229bb JH |
870 | /* Given LABEL return the first label in the same basic block. */ |
871 | static tree | |
872 | main_block_label (tree label) | |
873 | { | |
874 | basic_block bb = label_to_block (label); | |
8b11009b | 875 | tree main_label = label_for_bb[bb->index].label; |
242229bb JH |
876 | |
877 | /* label_to_block possibly inserted undefined label into the chain. */ | |
8b11009b ZD |
878 | if (!main_label) |
879 | { | |
880 | label_for_bb[bb->index].label = label; | |
881 | main_label = label; | |
882 | } | |
883 | ||
884 | label_for_bb[bb->index].used = true; | |
885 | return main_label; | |
242229bb JH |
886 | } |
887 | ||
b986ebf3 | 888 | /* Cleanup redundant labels. This is a three-step process: |
f698d217 SB |
889 | 1) Find the leading label for each block. |
890 | 2) Redirect all references to labels to the leading labels. | |
891 | 3) Cleanup all useless labels. */ | |
6de9cd9a | 892 | |
165b54c3 | 893 | void |
6de9cd9a DN |
894 | cleanup_dead_labels (void) |
895 | { | |
896 | basic_block bb; | |
8b11009b | 897 | label_for_bb = XCNEWVEC (struct label_record, last_basic_block); |
6de9cd9a DN |
898 | |
899 | /* Find a suitable label for each block. We use the first user-defined | |
f0b698c1 | 900 | label if there is one, or otherwise just the first label we see. */ |
6de9cd9a DN |
901 | FOR_EACH_BB (bb) |
902 | { | |
903 | block_stmt_iterator i; | |
904 | ||
905 | for (i = bsi_start (bb); !bsi_end_p (i); bsi_next (&i)) | |
906 | { | |
907 | tree label, stmt = bsi_stmt (i); | |
908 | ||
909 | if (TREE_CODE (stmt) != LABEL_EXPR) | |
910 | break; | |
911 | ||
912 | label = LABEL_EXPR_LABEL (stmt); | |
913 | ||
914 | /* If we have not yet seen a label for the current block, | |
915 | remember this one and see if there are more labels. */ | |
8b11009b | 916 | if (!label_for_bb[bb->index].label) |
6de9cd9a | 917 | { |
8b11009b | 918 | label_for_bb[bb->index].label = label; |
6de9cd9a DN |
919 | continue; |
920 | } | |
921 | ||
922 | /* If we did see a label for the current block already, but it | |
923 | is an artificially created label, replace it if the current | |
924 | label is a user defined label. */ | |
8b11009b ZD |
925 | if (!DECL_ARTIFICIAL (label) |
926 | && DECL_ARTIFICIAL (label_for_bb[bb->index].label)) | |
6de9cd9a | 927 | { |
8b11009b | 928 | label_for_bb[bb->index].label = label; |
6de9cd9a DN |
929 | break; |
930 | } | |
931 | } | |
932 | } | |
933 | ||
f698d217 SB |
934 | /* Now redirect all jumps/branches to the selected label. |
935 | First do so for each block ending in a control statement. */ | |
6de9cd9a DN |
936 | FOR_EACH_BB (bb) |
937 | { | |
938 | tree stmt = last_stmt (bb); | |
939 | if (!stmt) | |
940 | continue; | |
941 | ||
942 | switch (TREE_CODE (stmt)) | |
943 | { | |
944 | case COND_EXPR: | |
945 | { | |
946 | tree true_branch, false_branch; | |
6de9cd9a DN |
947 | |
948 | true_branch = COND_EXPR_THEN (stmt); | |
949 | false_branch = COND_EXPR_ELSE (stmt); | |
6de9cd9a | 950 | |
a9b77cd1 ZD |
951 | if (true_branch) |
952 | GOTO_DESTINATION (true_branch) | |
953 | = main_block_label (GOTO_DESTINATION (true_branch)); | |
954 | if (false_branch) | |
955 | GOTO_DESTINATION (false_branch) | |
956 | = main_block_label (GOTO_DESTINATION (false_branch)); | |
6de9cd9a DN |
957 | |
958 | break; | |
959 | } | |
6531d1be | 960 | |
6de9cd9a DN |
961 | case SWITCH_EXPR: |
962 | { | |
963 | size_t i; | |
964 | tree vec = SWITCH_LABELS (stmt); | |
965 | size_t n = TREE_VEC_LENGTH (vec); | |
6531d1be | 966 | |
6de9cd9a DN |
967 | /* Replace all destination labels. */ |
968 | for (i = 0; i < n; ++i) | |
92b6dff3 JL |
969 | { |
970 | tree elt = TREE_VEC_ELT (vec, i); | |
971 | tree label = main_block_label (CASE_LABEL (elt)); | |
d6be0d7f | 972 | CASE_LABEL (elt) = label; |
92b6dff3 | 973 | } |
6de9cd9a DN |
974 | break; |
975 | } | |
976 | ||
f667741c SB |
977 | /* We have to handle GOTO_EXPRs until they're removed, and we don't |
978 | remove them until after we've created the CFG edges. */ | |
979 | case GOTO_EXPR: | |
242229bb JH |
980 | if (! computed_goto_p (stmt)) |
981 | { | |
982 | GOTO_DESTINATION (stmt) | |
983 | = main_block_label (GOTO_DESTINATION (stmt)); | |
984 | break; | |
985 | } | |
f667741c | 986 | |
6de9cd9a DN |
987 | default: |
988 | break; | |
989 | } | |
990 | } | |
991 | ||
f698d217 SB |
992 | for_each_eh_region (update_eh_label); |
993 | ||
6de9cd9a | 994 | /* Finally, purge dead labels. All user-defined labels and labels that |
cea0f4f1 AP |
995 | can be the target of non-local gotos and labels which have their |
996 | address taken are preserved. */ | |
6de9cd9a DN |
997 | FOR_EACH_BB (bb) |
998 | { | |
999 | block_stmt_iterator i; | |
8b11009b | 1000 | tree label_for_this_bb = label_for_bb[bb->index].label; |
6de9cd9a | 1001 | |
8b11009b | 1002 | if (!label_for_this_bb) |
6de9cd9a DN |
1003 | continue; |
1004 | ||
8b11009b ZD |
1005 | /* If the main label of the block is unused, we may still remove it. */ |
1006 | if (!label_for_bb[bb->index].used) | |
1007 | label_for_this_bb = NULL; | |
1008 | ||
6de9cd9a DN |
1009 | for (i = bsi_start (bb); !bsi_end_p (i); ) |
1010 | { | |
1011 | tree label, stmt = bsi_stmt (i); | |
1012 | ||
1013 | if (TREE_CODE (stmt) != LABEL_EXPR) | |
1014 | break; | |
1015 | ||
1016 | label = LABEL_EXPR_LABEL (stmt); | |
1017 | ||
1018 | if (label == label_for_this_bb | |
1019 | || ! DECL_ARTIFICIAL (label) | |
cea0f4f1 AP |
1020 | || DECL_NONLOCAL (label) |
1021 | || FORCED_LABEL (label)) | |
6de9cd9a DN |
1022 | bsi_next (&i); |
1023 | else | |
736432ee | 1024 | bsi_remove (&i, true); |
6de9cd9a DN |
1025 | } |
1026 | } | |
1027 | ||
1028 | free (label_for_bb); | |
1029 | } | |
1030 | ||
f667741c SB |
1031 | /* Look for blocks ending in a multiway branch (a SWITCH_EXPR in GIMPLE), |
1032 | and scan the sorted vector of cases. Combine the ones jumping to the | |
1033 | same label. | |
1034 | Eg. three separate entries 1: 2: 3: become one entry 1..3: */ | |
1035 | ||
165b54c3 | 1036 | void |
f667741c SB |
1037 | group_case_labels (void) |
1038 | { | |
1039 | basic_block bb; | |
1040 | ||
1041 | FOR_EACH_BB (bb) | |
1042 | { | |
1043 | tree stmt = last_stmt (bb); | |
1044 | if (stmt && TREE_CODE (stmt) == SWITCH_EXPR) | |
1045 | { | |
1046 | tree labels = SWITCH_LABELS (stmt); | |
1047 | int old_size = TREE_VEC_LENGTH (labels); | |
1048 | int i, j, new_size = old_size; | |
29c4d22b | 1049 | tree default_case = TREE_VEC_ELT (labels, old_size - 1); |
6531d1be | 1050 | tree default_label; |
29c4d22b | 1051 | |
66efeafc | 1052 | /* The default label is always the last case in a switch |
29c4d22b AP |
1053 | statement after gimplification. */ |
1054 | default_label = CASE_LABEL (default_case); | |
f667741c SB |
1055 | |
1056 | /* Look for possible opportunities to merge cases. | |
1057 | Ignore the last element of the label vector because it | |
1058 | must be the default case. */ | |
1059 | i = 0; | |
d717e500 | 1060 | while (i < old_size - 1) |
f667741c | 1061 | { |
ed9cef22 | 1062 | tree base_case, base_label, base_high; |
f667741c SB |
1063 | base_case = TREE_VEC_ELT (labels, i); |
1064 | ||
1e128c5f | 1065 | gcc_assert (base_case); |
f667741c | 1066 | base_label = CASE_LABEL (base_case); |
31e9eea2 SB |
1067 | |
1068 | /* Discard cases that have the same destination as the | |
1069 | default case. */ | |
1070 | if (base_label == default_label) | |
1071 | { | |
1072 | TREE_VEC_ELT (labels, i) = NULL_TREE; | |
1073 | i++; | |
29c4d22b | 1074 | new_size--; |
31e9eea2 SB |
1075 | continue; |
1076 | } | |
1077 | ||
f667741c SB |
1078 | base_high = CASE_HIGH (base_case) ? |
1079 | CASE_HIGH (base_case) : CASE_LOW (base_case); | |
d717e500 | 1080 | i++; |
f667741c SB |
1081 | /* Try to merge case labels. Break out when we reach the end |
1082 | of the label vector or when we cannot merge the next case | |
1083 | label with the current one. */ | |
d717e500 | 1084 | while (i < old_size - 1) |
f667741c | 1085 | { |
d717e500 | 1086 | tree merge_case = TREE_VEC_ELT (labels, i); |
f667741c SB |
1087 | tree merge_label = CASE_LABEL (merge_case); |
1088 | tree t = int_const_binop (PLUS_EXPR, base_high, | |
1089 | integer_one_node, 1); | |
1090 | ||
1091 | /* Merge the cases if they jump to the same place, | |
1092 | and their ranges are consecutive. */ | |
1093 | if (merge_label == base_label | |
1094 | && tree_int_cst_equal (CASE_LOW (merge_case), t)) | |
1095 | { | |
1096 | base_high = CASE_HIGH (merge_case) ? | |
1097 | CASE_HIGH (merge_case) : CASE_LOW (merge_case); | |
1098 | CASE_HIGH (base_case) = base_high; | |
1099 | TREE_VEC_ELT (labels, i) = NULL_TREE; | |
1100 | new_size--; | |
d717e500 | 1101 | i++; |
f667741c SB |
1102 | } |
1103 | else | |
1104 | break; | |
1105 | } | |
1106 | } | |
1107 | ||
1108 | /* Compress the case labels in the label vector, and adjust the | |
1109 | length of the vector. */ | |
1110 | for (i = 0, j = 0; i < new_size; i++) | |
1111 | { | |
1112 | while (! TREE_VEC_ELT (labels, j)) | |
1113 | j++; | |
1114 | TREE_VEC_ELT (labels, i) = TREE_VEC_ELT (labels, j++); | |
1115 | } | |
1116 | TREE_VEC_LENGTH (labels) = new_size; | |
1117 | } | |
1118 | } | |
1119 | } | |
6de9cd9a DN |
1120 | |
1121 | /* Checks whether we can merge block B into block A. */ | |
1122 | ||
1123 | static bool | |
1124 | tree_can_merge_blocks_p (basic_block a, basic_block b) | |
1125 | { | |
1126 | tree stmt; | |
1127 | block_stmt_iterator bsi; | |
38965eb2 | 1128 | tree phi; |
6de9cd9a | 1129 | |
c5cbcccf | 1130 | if (!single_succ_p (a)) |
6de9cd9a DN |
1131 | return false; |
1132 | ||
c5cbcccf | 1133 | if (single_succ_edge (a)->flags & EDGE_ABNORMAL) |
6de9cd9a DN |
1134 | return false; |
1135 | ||
c5cbcccf | 1136 | if (single_succ (a) != b) |
6de9cd9a DN |
1137 | return false; |
1138 | ||
c5cbcccf | 1139 | if (!single_pred_p (b)) |
6de9cd9a DN |
1140 | return false; |
1141 | ||
26e75214 KH |
1142 | if (b == EXIT_BLOCK_PTR) |
1143 | return false; | |
6531d1be | 1144 | |
6de9cd9a DN |
1145 | /* If A ends by a statement causing exceptions or something similar, we |
1146 | cannot merge the blocks. */ | |
1147 | stmt = last_stmt (a); | |
1148 | if (stmt && stmt_ends_bb_p (stmt)) | |
1149 | return false; | |
1150 | ||
1151 | /* Do not allow a block with only a non-local label to be merged. */ | |
1152 | if (stmt && TREE_CODE (stmt) == LABEL_EXPR | |
1153 | && DECL_NONLOCAL (LABEL_EXPR_LABEL (stmt))) | |
1154 | return false; | |
1155 | ||
38965eb2 | 1156 | /* It must be possible to eliminate all phi nodes in B. If ssa form |
8f8bb1d2 ZD |
1157 | is not up-to-date, we cannot eliminate any phis; however, if only |
1158 | some symbols as whole are marked for renaming, this is not a problem, | |
1159 | as phi nodes for those symbols are irrelevant in updating anyway. */ | |
38965eb2 ZD |
1160 | phi = phi_nodes (b); |
1161 | if (phi) | |
1162 | { | |
8f8bb1d2 | 1163 | if (name_mappings_registered_p ()) |
38965eb2 ZD |
1164 | return false; |
1165 | ||
1166 | for (; phi; phi = PHI_CHAIN (phi)) | |
1167 | if (!is_gimple_reg (PHI_RESULT (phi)) | |
1168 | && !may_propagate_copy (PHI_RESULT (phi), PHI_ARG_DEF (phi, 0))) | |
1169 | return false; | |
1170 | } | |
6de9cd9a DN |
1171 | |
1172 | /* Do not remove user labels. */ | |
1173 | for (bsi = bsi_start (b); !bsi_end_p (bsi); bsi_next (&bsi)) | |
1174 | { | |
1175 | stmt = bsi_stmt (bsi); | |
1176 | if (TREE_CODE (stmt) != LABEL_EXPR) | |
1177 | break; | |
1178 | if (!DECL_ARTIFICIAL (LABEL_EXPR_LABEL (stmt))) | |
1179 | return false; | |
1180 | } | |
1181 | ||
2b271002 ZD |
1182 | /* Protect the loop latches. */ |
1183 | if (current_loops | |
1184 | && b->loop_father->latch == b) | |
1185 | return false; | |
1186 | ||
6de9cd9a DN |
1187 | return true; |
1188 | } | |
1189 | ||
38965eb2 ZD |
1190 | /* Replaces all uses of NAME by VAL. */ |
1191 | ||
684aaf29 | 1192 | void |
38965eb2 ZD |
1193 | replace_uses_by (tree name, tree val) |
1194 | { | |
1195 | imm_use_iterator imm_iter; | |
1196 | use_operand_p use; | |
1197 | tree stmt; | |
1198 | edge e; | |
38965eb2 | 1199 | |
6c00f606 | 1200 | FOR_EACH_IMM_USE_STMT (stmt, imm_iter, name) |
38965eb2 | 1201 | { |
cfaab3a9 DN |
1202 | if (TREE_CODE (stmt) != PHI_NODE) |
1203 | push_stmt_changes (&stmt); | |
1204 | ||
6c00f606 AM |
1205 | FOR_EACH_IMM_USE_ON_STMT (use, imm_iter) |
1206 | { | |
1207 | replace_exp (use, val); | |
38965eb2 | 1208 | |
6c00f606 | 1209 | if (TREE_CODE (stmt) == PHI_NODE) |
38965eb2 | 1210 | { |
6c00f606 AM |
1211 | e = PHI_ARG_EDGE (stmt, PHI_ARG_INDEX_FROM_USE (use)); |
1212 | if (e->flags & EDGE_ABNORMAL) | |
1213 | { | |
1214 | /* This can only occur for virtual operands, since | |
1215 | for the real ones SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name)) | |
1216 | would prevent replacement. */ | |
1217 | gcc_assert (!is_gimple_reg (name)); | |
1218 | SSA_NAME_OCCURS_IN_ABNORMAL_PHI (val) = 1; | |
1219 | } | |
38965eb2 ZD |
1220 | } |
1221 | } | |
cfaab3a9 | 1222 | |
6c00f606 AM |
1223 | if (TREE_CODE (stmt) != PHI_NODE) |
1224 | { | |
1225 | tree rhs; | |
9af0df6b | 1226 | |
6c00f606 | 1227 | fold_stmt_inplace (stmt); |
672987e8 ZD |
1228 | if (cfgcleanup_altered_bbs) |
1229 | bitmap_set_bit (cfgcleanup_altered_bbs, bb_for_stmt (stmt)->index); | |
cfaab3a9 DN |
1230 | |
1231 | /* FIXME. This should go in pop_stmt_changes. */ | |
6c00f606 AM |
1232 | rhs = get_rhs (stmt); |
1233 | if (TREE_CODE (rhs) == ADDR_EXPR) | |
1234 | recompute_tree_invariant_for_addr_expr (rhs); | |
9af0df6b | 1235 | |
6c00f606 | 1236 | maybe_clean_or_replace_eh_stmt (stmt, stmt); |
cfaab3a9 DN |
1237 | |
1238 | pop_stmt_changes (&stmt); | |
6c00f606 | 1239 | } |
38965eb2 | 1240 | } |
6531d1be | 1241 | |
40b448ef | 1242 | gcc_assert (has_zero_uses (name)); |
d5ab5675 ZD |
1243 | |
1244 | /* Also update the trees stored in loop structures. */ | |
1245 | if (current_loops) | |
1246 | { | |
1247 | struct loop *loop; | |
42fd6772 | 1248 | loop_iterator li; |
d5ab5675 | 1249 | |
42fd6772 | 1250 | FOR_EACH_LOOP (li, loop, 0) |
d5ab5675 | 1251 | { |
42fd6772 | 1252 | substitute_in_loop_info (loop, name, val); |
d5ab5675 ZD |
1253 | } |
1254 | } | |
38965eb2 | 1255 | } |
6de9cd9a DN |
1256 | |
1257 | /* Merge block B into block A. */ | |
1258 | ||
1259 | static void | |
1260 | tree_merge_blocks (basic_block a, basic_block b) | |
1261 | { | |
1262 | block_stmt_iterator bsi; | |
1263 | tree_stmt_iterator last; | |
38965eb2 | 1264 | tree phi; |
6de9cd9a DN |
1265 | |
1266 | if (dump_file) | |
1267 | fprintf (dump_file, "Merging blocks %d and %d\n", a->index, b->index); | |
1268 | ||
c4f548b8 DN |
1269 | /* Remove all single-valued PHI nodes from block B of the form |
1270 | V_i = PHI <V_j> by propagating V_j to all the uses of V_i. */ | |
38965eb2 ZD |
1271 | bsi = bsi_last (a); |
1272 | for (phi = phi_nodes (b); phi; phi = phi_nodes (b)) | |
1273 | { | |
1274 | tree def = PHI_RESULT (phi), use = PHI_ARG_DEF (phi, 0); | |
1275 | tree copy; | |
d7f0e25c ZD |
1276 | bool may_replace_uses = may_propagate_copy (def, use); |
1277 | ||
1278 | /* In case we have loops to care about, do not propagate arguments of | |
1279 | loop closed ssa phi nodes. */ | |
1280 | if (current_loops | |
1281 | && is_gimple_reg (def) | |
1282 | && TREE_CODE (use) == SSA_NAME | |
1283 | && a->loop_father != b->loop_father) | |
1284 | may_replace_uses = false; | |
1285 | ||
1286 | if (!may_replace_uses) | |
38965eb2 ZD |
1287 | { |
1288 | gcc_assert (is_gimple_reg (def)); | |
1289 | ||
128a79fb | 1290 | /* Note that just emitting the copies is fine -- there is no problem |
38965eb2 ZD |
1291 | with ordering of phi nodes. This is because A is the single |
1292 | predecessor of B, therefore results of the phi nodes cannot | |
1293 | appear as arguments of the phi nodes. */ | |
939409af | 1294 | copy = build_gimple_modify_stmt (def, use); |
38965eb2 | 1295 | bsi_insert_after (&bsi, copy, BSI_NEW_STMT); |
38965eb2 | 1296 | SSA_NAME_DEF_STMT (def) = copy; |
611021e1 | 1297 | remove_phi_node (phi, NULL, false); |
38965eb2 ZD |
1298 | } |
1299 | else | |
611021e1 RK |
1300 | { |
1301 | replace_uses_by (def, use); | |
1302 | remove_phi_node (phi, NULL, true); | |
1303 | } | |
38965eb2 ZD |
1304 | } |
1305 | ||
6de9cd9a DN |
1306 | /* Ensure that B follows A. */ |
1307 | move_block_after (b, a); | |
1308 | ||
c5cbcccf | 1309 | gcc_assert (single_succ_edge (a)->flags & EDGE_FALLTHRU); |
1e128c5f | 1310 | gcc_assert (!last_stmt (a) || !stmt_ends_bb_p (last_stmt (a))); |
6de9cd9a DN |
1311 | |
1312 | /* Remove labels from B and set bb_for_stmt to A for other statements. */ | |
1313 | for (bsi = bsi_start (b); !bsi_end_p (bsi);) | |
1314 | { | |
1315 | if (TREE_CODE (bsi_stmt (bsi)) == LABEL_EXPR) | |
be477406 JL |
1316 | { |
1317 | tree label = bsi_stmt (bsi); | |
1318 | ||
736432ee | 1319 | bsi_remove (&bsi, false); |
be477406 JL |
1320 | /* Now that we can thread computed gotos, we might have |
1321 | a situation where we have a forced label in block B | |
1322 | However, the label at the start of block B might still be | |
1323 | used in other ways (think about the runtime checking for | |
1324 | Fortran assigned gotos). So we can not just delete the | |
1325 | label. Instead we move the label to the start of block A. */ | |
1326 | if (FORCED_LABEL (LABEL_EXPR_LABEL (label))) | |
1327 | { | |
1328 | block_stmt_iterator dest_bsi = bsi_start (a); | |
1329 | bsi_insert_before (&dest_bsi, label, BSI_NEW_STMT); | |
1330 | } | |
1331 | } | |
6de9cd9a DN |
1332 | else |
1333 | { | |
0a4fe58f | 1334 | change_bb_for_stmt (bsi_stmt (bsi), a); |
6de9cd9a DN |
1335 | bsi_next (&bsi); |
1336 | } | |
1337 | } | |
1338 | ||
1339 | /* Merge the chains. */ | |
7506e1cb ZD |
1340 | last = tsi_last (bb_stmt_list (a)); |
1341 | tsi_link_after (&last, bb_stmt_list (b), TSI_NEW_STMT); | |
1342 | set_bb_stmt_list (b, NULL_TREE); | |
672987e8 ZD |
1343 | |
1344 | if (cfgcleanup_altered_bbs) | |
1345 | bitmap_set_bit (cfgcleanup_altered_bbs, a->index); | |
6de9cd9a DN |
1346 | } |
1347 | ||
1348 | ||
bc23502b PB |
1349 | /* Return the one of two successors of BB that is not reachable by a |
1350 | reached by a complex edge, if there is one. Else, return BB. We use | |
1351 | this in optimizations that use post-dominators for their heuristics, | |
1352 | to catch the cases in C++ where function calls are involved. */ | |
6531d1be | 1353 | |
bc23502b | 1354 | basic_block |
6531d1be | 1355 | single_noncomplex_succ (basic_block bb) |
bc23502b PB |
1356 | { |
1357 | edge e0, e1; | |
1358 | if (EDGE_COUNT (bb->succs) != 2) | |
1359 | return bb; | |
6531d1be | 1360 | |
bc23502b PB |
1361 | e0 = EDGE_SUCC (bb, 0); |
1362 | e1 = EDGE_SUCC (bb, 1); | |
1363 | if (e0->flags & EDGE_COMPLEX) | |
1364 | return e1->dest; | |
1365 | if (e1->flags & EDGE_COMPLEX) | |
1366 | return e0->dest; | |
6531d1be | 1367 | |
bc23502b | 1368 | return bb; |
6531d1be | 1369 | } |
bc23502b PB |
1370 | |
1371 | ||
6de9cd9a DN |
1372 | /* Walk the function tree removing unnecessary statements. |
1373 | ||
1374 | * Empty statement nodes are removed | |
1375 | ||
1376 | * Unnecessary TRY_FINALLY and TRY_CATCH blocks are removed | |
1377 | ||
1378 | * Unnecessary COND_EXPRs are removed | |
1379 | ||
1380 | * Some unnecessary BIND_EXPRs are removed | |
1381 | ||
1382 | Clearly more work could be done. The trick is doing the analysis | |
1383 | and removal fast enough to be a net improvement in compile times. | |
1384 | ||
1385 | Note that when we remove a control structure such as a COND_EXPR | |
1386 | BIND_EXPR, or TRY block, we will need to repeat this optimization pass | |
1387 | to ensure we eliminate all the useless code. */ | |
1388 | ||
1389 | struct rus_data | |
1390 | { | |
1391 | tree *last_goto; | |
1392 | bool repeat; | |
1393 | bool may_throw; | |
1394 | bool may_branch; | |
1395 | bool has_label; | |
1396 | }; | |
1397 | ||
1398 | static void remove_useless_stmts_1 (tree *, struct rus_data *); | |
1399 | ||
1400 | static bool | |
1401 | remove_useless_stmts_warn_notreached (tree stmt) | |
1402 | { | |
9506ac2b | 1403 | if (EXPR_HAS_LOCATION (stmt)) |
6de9cd9a | 1404 | { |
9506ac2b | 1405 | location_t loc = EXPR_LOCATION (stmt); |
43e05e45 SB |
1406 | if (LOCATION_LINE (loc) > 0) |
1407 | { | |
d4ee4d25 | 1408 | warning (0, "%Hwill never be executed", &loc); |
43e05e45 SB |
1409 | return true; |
1410 | } | |
6de9cd9a DN |
1411 | } |
1412 | ||
1413 | switch (TREE_CODE (stmt)) | |
1414 | { | |
1415 | case STATEMENT_LIST: | |
1416 | { | |
1417 | tree_stmt_iterator i; | |
1418 | for (i = tsi_start (stmt); !tsi_end_p (i); tsi_next (&i)) | |
1419 | if (remove_useless_stmts_warn_notreached (tsi_stmt (i))) | |
1420 | return true; | |
1421 | } | |
1422 | break; | |
1423 | ||
1424 | case COND_EXPR: | |
1425 | if (remove_useless_stmts_warn_notreached (COND_EXPR_COND (stmt))) | |
1426 | return true; | |
1427 | if (remove_useless_stmts_warn_notreached (COND_EXPR_THEN (stmt))) | |
1428 | return true; | |
1429 | if (remove_useless_stmts_warn_notreached (COND_EXPR_ELSE (stmt))) | |
1430 | return true; | |
1431 | break; | |
1432 | ||
1433 | case TRY_FINALLY_EXPR: | |
1434 | case TRY_CATCH_EXPR: | |
1435 | if (remove_useless_stmts_warn_notreached (TREE_OPERAND (stmt, 0))) | |
1436 | return true; | |
1437 | if (remove_useless_stmts_warn_notreached (TREE_OPERAND (stmt, 1))) | |
1438 | return true; | |
1439 | break; | |
1440 | ||
1441 | case CATCH_EXPR: | |
1442 | return remove_useless_stmts_warn_notreached (CATCH_BODY (stmt)); | |
1443 | case EH_FILTER_EXPR: | |
1444 | return remove_useless_stmts_warn_notreached (EH_FILTER_FAILURE (stmt)); | |
1445 | case BIND_EXPR: | |
1446 | return remove_useless_stmts_warn_notreached (BIND_EXPR_BLOCK (stmt)); | |
1447 | ||
1448 | default: | |
1449 | /* Not a live container. */ | |
1450 | break; | |
1451 | } | |
1452 | ||
1453 | return false; | |
1454 | } | |
1455 | ||
1456 | static void | |
1457 | remove_useless_stmts_cond (tree *stmt_p, struct rus_data *data) | |
1458 | { | |
1459 | tree then_clause, else_clause, cond; | |
1460 | bool save_has_label, then_has_label, else_has_label; | |
1461 | ||
1462 | save_has_label = data->has_label; | |
1463 | data->has_label = false; | |
1464 | data->last_goto = NULL; | |
1465 | ||
1466 | remove_useless_stmts_1 (&COND_EXPR_THEN (*stmt_p), data); | |
1467 | ||
1468 | then_has_label = data->has_label; | |
1469 | data->has_label = false; | |
1470 | data->last_goto = NULL; | |
1471 | ||
1472 | remove_useless_stmts_1 (&COND_EXPR_ELSE (*stmt_p), data); | |
1473 | ||
1474 | else_has_label = data->has_label; | |
1475 | data->has_label = save_has_label | then_has_label | else_has_label; | |
1476 | ||
6de9cd9a DN |
1477 | then_clause = COND_EXPR_THEN (*stmt_p); |
1478 | else_clause = COND_EXPR_ELSE (*stmt_p); | |
18faa5da | 1479 | cond = fold (COND_EXPR_COND (*stmt_p)); |
6de9cd9a DN |
1480 | |
1481 | /* If neither arm does anything at all, we can remove the whole IF. */ | |
1482 | if (!TREE_SIDE_EFFECTS (then_clause) && !TREE_SIDE_EFFECTS (else_clause)) | |
1483 | { | |
1484 | *stmt_p = build_empty_stmt (); | |
1485 | data->repeat = true; | |
1486 | } | |
1487 | ||
1488 | /* If there are no reachable statements in an arm, then we can | |
1489 | zap the entire conditional. */ | |
1490 | else if (integer_nonzerop (cond) && !else_has_label) | |
1491 | { | |
1492 | if (warn_notreached) | |
1493 | remove_useless_stmts_warn_notreached (else_clause); | |
1494 | *stmt_p = then_clause; | |
1495 | data->repeat = true; | |
1496 | } | |
1497 | else if (integer_zerop (cond) && !then_has_label) | |
1498 | { | |
1499 | if (warn_notreached) | |
1500 | remove_useless_stmts_warn_notreached (then_clause); | |
1501 | *stmt_p = else_clause; | |
1502 | data->repeat = true; | |
1503 | } | |
1504 | ||
1505 | /* Check a couple of simple things on then/else with single stmts. */ | |
1506 | else | |
1507 | { | |
1508 | tree then_stmt = expr_only (then_clause); | |
1509 | tree else_stmt = expr_only (else_clause); | |
1510 | ||
1511 | /* Notice branches to a common destination. */ | |
1512 | if (then_stmt && else_stmt | |
1513 | && TREE_CODE (then_stmt) == GOTO_EXPR | |
1514 | && TREE_CODE (else_stmt) == GOTO_EXPR | |
1515 | && (GOTO_DESTINATION (then_stmt) == GOTO_DESTINATION (else_stmt))) | |
1516 | { | |
1517 | *stmt_p = then_stmt; | |
1518 | data->repeat = true; | |
1519 | } | |
1520 | ||
1521 | /* If the THEN/ELSE clause merely assigns a value to a variable or | |
1522 | parameter which is already known to contain that value, then | |
1523 | remove the useless THEN/ELSE clause. */ | |
1524 | else if (TREE_CODE (cond) == VAR_DECL || TREE_CODE (cond) == PARM_DECL) | |
1525 | { | |
1526 | if (else_stmt | |
07beea0d AH |
1527 | && TREE_CODE (else_stmt) == GIMPLE_MODIFY_STMT |
1528 | && GIMPLE_STMT_OPERAND (else_stmt, 0) == cond | |
1529 | && integer_zerop (GIMPLE_STMT_OPERAND (else_stmt, 1))) | |
6de9cd9a DN |
1530 | COND_EXPR_ELSE (*stmt_p) = alloc_stmt_list (); |
1531 | } | |
1532 | else if ((TREE_CODE (cond) == EQ_EXPR || TREE_CODE (cond) == NE_EXPR) | |
1533 | && (TREE_CODE (TREE_OPERAND (cond, 0)) == VAR_DECL | |
1534 | || TREE_CODE (TREE_OPERAND (cond, 0)) == PARM_DECL) | |
1535 | && TREE_CONSTANT (TREE_OPERAND (cond, 1))) | |
1536 | { | |
1537 | tree stmt = (TREE_CODE (cond) == EQ_EXPR | |
1538 | ? then_stmt : else_stmt); | |
1539 | tree *location = (TREE_CODE (cond) == EQ_EXPR | |
1540 | ? &COND_EXPR_THEN (*stmt_p) | |
1541 | : &COND_EXPR_ELSE (*stmt_p)); | |
1542 | ||
1543 | if (stmt | |
07beea0d AH |
1544 | && TREE_CODE (stmt) == GIMPLE_MODIFY_STMT |
1545 | && GIMPLE_STMT_OPERAND (stmt, 0) == TREE_OPERAND (cond, 0) | |
1546 | && GIMPLE_STMT_OPERAND (stmt, 1) == TREE_OPERAND (cond, 1)) | |
6de9cd9a DN |
1547 | *location = alloc_stmt_list (); |
1548 | } | |
1549 | } | |
1550 | ||
1551 | /* Protect GOTOs in the arm of COND_EXPRs from being removed. They | |
1552 | would be re-introduced during lowering. */ | |
1553 | data->last_goto = NULL; | |
1554 | } | |
1555 | ||
1556 | ||
1557 | static void | |
1558 | remove_useless_stmts_tf (tree *stmt_p, struct rus_data *data) | |
1559 | { | |
1560 | bool save_may_branch, save_may_throw; | |
1561 | bool this_may_branch, this_may_throw; | |
1562 | ||
1563 | /* Collect may_branch and may_throw information for the body only. */ | |
1564 | save_may_branch = data->may_branch; | |
1565 | save_may_throw = data->may_throw; | |
1566 | data->may_branch = false; | |
1567 | data->may_throw = false; | |
1568 | data->last_goto = NULL; | |
1569 | ||
1570 | remove_useless_stmts_1 (&TREE_OPERAND (*stmt_p, 0), data); | |
1571 | ||
1572 | this_may_branch = data->may_branch; | |
1573 | this_may_throw = data->may_throw; | |
1574 | data->may_branch |= save_may_branch; | |
1575 | data->may_throw |= save_may_throw; | |
1576 | data->last_goto = NULL; | |
1577 | ||
1578 | remove_useless_stmts_1 (&TREE_OPERAND (*stmt_p, 1), data); | |
1579 | ||
1580 | /* If the body is empty, then we can emit the FINALLY block without | |
1581 | the enclosing TRY_FINALLY_EXPR. */ | |
1582 | if (!TREE_SIDE_EFFECTS (TREE_OPERAND (*stmt_p, 0))) | |
1583 | { | |
1584 | *stmt_p = TREE_OPERAND (*stmt_p, 1); | |
1585 | data->repeat = true; | |
1586 | } | |
1587 | ||
1588 | /* If the handler is empty, then we can emit the TRY block without | |
1589 | the enclosing TRY_FINALLY_EXPR. */ | |
1590 | else if (!TREE_SIDE_EFFECTS (TREE_OPERAND (*stmt_p, 1))) | |
1591 | { | |
1592 | *stmt_p = TREE_OPERAND (*stmt_p, 0); | |
1593 | data->repeat = true; | |
1594 | } | |
1595 | ||
1596 | /* If the body neither throws, nor branches, then we can safely | |
1597 | string the TRY and FINALLY blocks together. */ | |
1598 | else if (!this_may_branch && !this_may_throw) | |
1599 | { | |
1600 | tree stmt = *stmt_p; | |
1601 | *stmt_p = TREE_OPERAND (stmt, 0); | |
1602 | append_to_statement_list (TREE_OPERAND (stmt, 1), stmt_p); | |
1603 | data->repeat = true; | |
1604 | } | |
1605 | } | |
1606 | ||
1607 | ||
1608 | static void | |
1609 | remove_useless_stmts_tc (tree *stmt_p, struct rus_data *data) | |
1610 | { | |
1611 | bool save_may_throw, this_may_throw; | |
1612 | tree_stmt_iterator i; | |
1613 | tree stmt; | |
1614 | ||
1615 | /* Collect may_throw information for the body only. */ | |
1616 | save_may_throw = data->may_throw; | |
1617 | data->may_throw = false; | |
1618 | data->last_goto = NULL; | |
1619 | ||
1620 | remove_useless_stmts_1 (&TREE_OPERAND (*stmt_p, 0), data); | |
1621 | ||
1622 | this_may_throw = data->may_throw; | |
1623 | data->may_throw = save_may_throw; | |
1624 | ||
1625 | /* If the body cannot throw, then we can drop the entire TRY_CATCH_EXPR. */ | |
1626 | if (!this_may_throw) | |
1627 | { | |
1628 | if (warn_notreached) | |
1629 | remove_useless_stmts_warn_notreached (TREE_OPERAND (*stmt_p, 1)); | |
1630 | *stmt_p = TREE_OPERAND (*stmt_p, 0); | |
1631 | data->repeat = true; | |
1632 | return; | |
1633 | } | |
1634 | ||
1635 | /* Process the catch clause specially. We may be able to tell that | |
1636 | no exceptions propagate past this point. */ | |
1637 | ||
1638 | this_may_throw = true; | |
1639 | i = tsi_start (TREE_OPERAND (*stmt_p, 1)); | |
1640 | stmt = tsi_stmt (i); | |
1641 | data->last_goto = NULL; | |
1642 | ||
1643 | switch (TREE_CODE (stmt)) | |
1644 | { | |
1645 | case CATCH_EXPR: | |
1646 | for (; !tsi_end_p (i); tsi_next (&i)) | |
1647 | { | |
1648 | stmt = tsi_stmt (i); | |
1649 | /* If we catch all exceptions, then the body does not | |
1650 | propagate exceptions past this point. */ | |
1651 | if (CATCH_TYPES (stmt) == NULL) | |
1652 | this_may_throw = false; | |
1653 | data->last_goto = NULL; | |
1654 | remove_useless_stmts_1 (&CATCH_BODY (stmt), data); | |
1655 | } | |
1656 | break; | |
1657 | ||
1658 | case EH_FILTER_EXPR: | |
1659 | if (EH_FILTER_MUST_NOT_THROW (stmt)) | |
1660 | this_may_throw = false; | |
1661 | else if (EH_FILTER_TYPES (stmt) == NULL) | |
1662 | this_may_throw = false; | |
1663 | remove_useless_stmts_1 (&EH_FILTER_FAILURE (stmt), data); | |
1664 | break; | |
1665 | ||
1666 | default: | |
1667 | /* Otherwise this is a cleanup. */ | |
1668 | remove_useless_stmts_1 (&TREE_OPERAND (*stmt_p, 1), data); | |
1669 | ||
1670 | /* If the cleanup is empty, then we can emit the TRY block without | |
1671 | the enclosing TRY_CATCH_EXPR. */ | |
1672 | if (!TREE_SIDE_EFFECTS (TREE_OPERAND (*stmt_p, 1))) | |
1673 | { | |
1674 | *stmt_p = TREE_OPERAND (*stmt_p, 0); | |
1675 | data->repeat = true; | |
1676 | } | |
1677 | break; | |
1678 | } | |
1679 | data->may_throw |= this_may_throw; | |
1680 | } | |
1681 | ||
1682 | ||
1683 | static void | |
1684 | remove_useless_stmts_bind (tree *stmt_p, struct rus_data *data) | |
1685 | { | |
1686 | tree block; | |
1687 | ||
1688 | /* First remove anything underneath the BIND_EXPR. */ | |
1689 | remove_useless_stmts_1 (&BIND_EXPR_BODY (*stmt_p), data); | |
1690 | ||
1691 | /* If the BIND_EXPR has no variables, then we can pull everything | |
1692 | up one level and remove the BIND_EXPR, unless this is the toplevel | |
1693 | BIND_EXPR for the current function or an inlined function. | |
1694 | ||
1695 | When this situation occurs we will want to apply this | |
1696 | optimization again. */ | |
1697 | block = BIND_EXPR_BLOCK (*stmt_p); | |
1698 | if (BIND_EXPR_VARS (*stmt_p) == NULL_TREE | |
1699 | && *stmt_p != DECL_SAVED_TREE (current_function_decl) | |
1700 | && (! block | |
1701 | || ! BLOCK_ABSTRACT_ORIGIN (block) | |
1702 | || (TREE_CODE (BLOCK_ABSTRACT_ORIGIN (block)) | |
1703 | != FUNCTION_DECL))) | |
1704 | { | |
1705 | *stmt_p = BIND_EXPR_BODY (*stmt_p); | |
1706 | data->repeat = true; | |
1707 | } | |
1708 | } | |
1709 | ||
1710 | ||
1711 | static void | |
1712 | remove_useless_stmts_goto (tree *stmt_p, struct rus_data *data) | |
1713 | { | |
1714 | tree dest = GOTO_DESTINATION (*stmt_p); | |
1715 | ||
1716 | data->may_branch = true; | |
1717 | data->last_goto = NULL; | |
1718 | ||
1719 | /* Record the last goto expr, so that we can delete it if unnecessary. */ | |
1720 | if (TREE_CODE (dest) == LABEL_DECL) | |
1721 | data->last_goto = stmt_p; | |
1722 | } | |
1723 | ||
1724 | ||
1725 | static void | |
1726 | remove_useless_stmts_label (tree *stmt_p, struct rus_data *data) | |
1727 | { | |
1728 | tree label = LABEL_EXPR_LABEL (*stmt_p); | |
1729 | ||
1730 | data->has_label = true; | |
1731 | ||
1732 | /* We do want to jump across non-local label receiver code. */ | |
1733 | if (DECL_NONLOCAL (label)) | |
1734 | data->last_goto = NULL; | |
1735 | ||
1736 | else if (data->last_goto && GOTO_DESTINATION (*data->last_goto) == label) | |
1737 | { | |
1738 | *data->last_goto = build_empty_stmt (); | |
1739 | data->repeat = true; | |
1740 | } | |
1741 | ||
1742 | /* ??? Add something here to delete unused labels. */ | |
1743 | } | |
1744 | ||
1745 | ||
1746 | /* If the function is "const" or "pure", then clear TREE_SIDE_EFFECTS on its | |
1747 | decl. This allows us to eliminate redundant or useless | |
6531d1be | 1748 | calls to "const" functions. |
6de9cd9a DN |
1749 | |
1750 | Gimplifier already does the same operation, but we may notice functions | |
1751 | being const and pure once their calls has been gimplified, so we need | |
1752 | to update the flag. */ | |
1753 | ||
1754 | static void | |
1755 | update_call_expr_flags (tree call) | |
1756 | { | |
1757 | tree decl = get_callee_fndecl (call); | |
1758 | if (!decl) | |
1759 | return; | |
1760 | if (call_expr_flags (call) & (ECF_CONST | ECF_PURE)) | |
1761 | TREE_SIDE_EFFECTS (call) = 0; | |
1762 | if (TREE_NOTHROW (decl)) | |
1763 | TREE_NOTHROW (call) = 1; | |
1764 | } | |
1765 | ||
1766 | ||
1767 | /* T is CALL_EXPR. Set current_function_calls_* flags. */ | |
1768 | ||
1769 | void | |
1770 | notice_special_calls (tree t) | |
1771 | { | |
1772 | int flags = call_expr_flags (t); | |
1773 | ||
1774 | if (flags & ECF_MAY_BE_ALLOCA) | |
1775 | current_function_calls_alloca = true; | |
1776 | if (flags & ECF_RETURNS_TWICE) | |
1777 | current_function_calls_setjmp = true; | |
1778 | } | |
1779 | ||
1780 | ||
1781 | /* Clear flags set by notice_special_calls. Used by dead code removal | |
1782 | to update the flags. */ | |
1783 | ||
1784 | void | |
1785 | clear_special_calls (void) | |
1786 | { | |
1787 | current_function_calls_alloca = false; | |
1788 | current_function_calls_setjmp = false; | |
1789 | } | |
1790 | ||
1791 | ||
1792 | static void | |
1793 | remove_useless_stmts_1 (tree *tp, struct rus_data *data) | |
1794 | { | |
cd709752 | 1795 | tree t = *tp, op; |
6de9cd9a DN |
1796 | |
1797 | switch (TREE_CODE (t)) | |
1798 | { | |
1799 | case COND_EXPR: | |
1800 | remove_useless_stmts_cond (tp, data); | |
1801 | break; | |
1802 | ||
1803 | case TRY_FINALLY_EXPR: | |
1804 | remove_useless_stmts_tf (tp, data); | |
1805 | break; | |
1806 | ||
1807 | case TRY_CATCH_EXPR: | |
1808 | remove_useless_stmts_tc (tp, data); | |
1809 | break; | |
1810 | ||
1811 | case BIND_EXPR: | |
1812 | remove_useless_stmts_bind (tp, data); | |
1813 | break; | |
1814 | ||
1815 | case GOTO_EXPR: | |
1816 | remove_useless_stmts_goto (tp, data); | |
1817 | break; | |
1818 | ||
1819 | case LABEL_EXPR: | |
1820 | remove_useless_stmts_label (tp, data); | |
1821 | break; | |
1822 | ||
1823 | case RETURN_EXPR: | |
53e782e5 | 1824 | fold_stmt (tp); |
6de9cd9a DN |
1825 | data->last_goto = NULL; |
1826 | data->may_branch = true; | |
1827 | break; | |
1828 | ||
1829 | case CALL_EXPR: | |
53e782e5 | 1830 | fold_stmt (tp); |
6de9cd9a DN |
1831 | data->last_goto = NULL; |
1832 | notice_special_calls (t); | |
1833 | update_call_expr_flags (t); | |
1834 | if (tree_could_throw_p (t)) | |
1835 | data->may_throw = true; | |
1836 | break; | |
1837 | ||
1838 | case MODIFY_EXPR: | |
07beea0d AH |
1839 | gcc_unreachable (); |
1840 | ||
1841 | case GIMPLE_MODIFY_STMT: | |
6de9cd9a | 1842 | data->last_goto = NULL; |
53e782e5 | 1843 | fold_stmt (tp); |
cd709752 RH |
1844 | op = get_call_expr_in (t); |
1845 | if (op) | |
6de9cd9a | 1846 | { |
cd709752 RH |
1847 | update_call_expr_flags (op); |
1848 | notice_special_calls (op); | |
6de9cd9a DN |
1849 | } |
1850 | if (tree_could_throw_p (t)) | |
1851 | data->may_throw = true; | |
1852 | break; | |
1853 | ||
1854 | case STATEMENT_LIST: | |
1855 | { | |
1856 | tree_stmt_iterator i = tsi_start (t); | |
1857 | while (!tsi_end_p (i)) | |
1858 | { | |
1859 | t = tsi_stmt (i); | |
1860 | if (IS_EMPTY_STMT (t)) | |
1861 | { | |
1862 | tsi_delink (&i); | |
1863 | continue; | |
1864 | } | |
6531d1be | 1865 | |
6de9cd9a DN |
1866 | remove_useless_stmts_1 (tsi_stmt_ptr (i), data); |
1867 | ||
1868 | t = tsi_stmt (i); | |
1869 | if (TREE_CODE (t) == STATEMENT_LIST) | |
1870 | { | |
1871 | tsi_link_before (&i, t, TSI_SAME_STMT); | |
1872 | tsi_delink (&i); | |
1873 | } | |
1874 | else | |
1875 | tsi_next (&i); | |
1876 | } | |
1877 | } | |
1878 | break; | |
8e14584d | 1879 | case ASM_EXPR: |
53e782e5 AP |
1880 | fold_stmt (tp); |
1881 | data->last_goto = NULL; | |
1882 | break; | |
6de9cd9a DN |
1883 | |
1884 | default: | |
1885 | data->last_goto = NULL; | |
1886 | break; | |
1887 | } | |
1888 | } | |
1889 | ||
c2924966 | 1890 | static unsigned int |
6de9cd9a DN |
1891 | remove_useless_stmts (void) |
1892 | { | |
1893 | struct rus_data data; | |
1894 | ||
1895 | clear_special_calls (); | |
1896 | ||
1897 | do | |
1898 | { | |
1899 | memset (&data, 0, sizeof (data)); | |
1900 | remove_useless_stmts_1 (&DECL_SAVED_TREE (current_function_decl), &data); | |
1901 | } | |
1902 | while (data.repeat); | |
c2924966 | 1903 | return 0; |
6de9cd9a DN |
1904 | } |
1905 | ||
1906 | ||
6531d1be | 1907 | struct tree_opt_pass pass_remove_useless_stmts = |
6de9cd9a DN |
1908 | { |
1909 | "useless", /* name */ | |
1910 | NULL, /* gate */ | |
1911 | remove_useless_stmts, /* execute */ | |
1912 | NULL, /* sub */ | |
1913 | NULL, /* next */ | |
1914 | 0, /* static_pass_number */ | |
1915 | 0, /* tv_id */ | |
9e5a3e6c RH |
1916 | PROP_gimple_any, /* properties_required */ |
1917 | 0, /* properties_provided */ | |
6de9cd9a DN |
1918 | 0, /* properties_destroyed */ |
1919 | 0, /* todo_flags_start */ | |
9f8628ba PB |
1920 | TODO_dump_func, /* todo_flags_finish */ |
1921 | 0 /* letter */ | |
6de9cd9a DN |
1922 | }; |
1923 | ||
6de9cd9a DN |
1924 | /* Remove PHI nodes associated with basic block BB and all edges out of BB. */ |
1925 | ||
1926 | static void | |
1927 | remove_phi_nodes_and_edges_for_unreachable_block (basic_block bb) | |
1928 | { | |
1929 | tree phi; | |
1930 | ||
1931 | /* Since this block is no longer reachable, we can just delete all | |
1932 | of its PHI nodes. */ | |
1933 | phi = phi_nodes (bb); | |
1934 | while (phi) | |
1935 | { | |
17192884 | 1936 | tree next = PHI_CHAIN (phi); |
9b3b55a1 | 1937 | remove_phi_node (phi, NULL_TREE, true); |
6de9cd9a DN |
1938 | phi = next; |
1939 | } | |
1940 | ||
1941 | /* Remove edges to BB's successors. */ | |
628f6a4e | 1942 | while (EDGE_COUNT (bb->succs) > 0) |
d0d2cc21 | 1943 | remove_edge (EDGE_SUCC (bb, 0)); |
6de9cd9a DN |
1944 | } |
1945 | ||
1946 | ||
1947 | /* Remove statements of basic block BB. */ | |
1948 | ||
1949 | static void | |
1950 | remove_bb (basic_block bb) | |
1951 | { | |
1952 | block_stmt_iterator i; | |
dbce1570 PB |
1953 | #ifdef USE_MAPPED_LOCATION |
1954 | source_location loc = UNKNOWN_LOCATION; | |
1955 | #else | |
9506ac2b | 1956 | source_locus loc = 0; |
dbce1570 | 1957 | #endif |
6de9cd9a DN |
1958 | |
1959 | if (dump_file) | |
1960 | { | |
1961 | fprintf (dump_file, "Removing basic block %d\n", bb->index); | |
1962 | if (dump_flags & TDF_DETAILS) | |
1963 | { | |
1964 | dump_bb (bb, dump_file, 0); | |
1965 | fprintf (dump_file, "\n"); | |
1966 | } | |
1967 | } | |
1968 | ||
2b271002 ZD |
1969 | if (current_loops) |
1970 | { | |
1971 | struct loop *loop = bb->loop_father; | |
1972 | ||
598ec7bd ZD |
1973 | /* If a loop gets removed, clean up the information associated |
1974 | with it. */ | |
2b271002 ZD |
1975 | if (loop->latch == bb |
1976 | || loop->header == bb) | |
598ec7bd | 1977 | free_numbers_of_iterations_estimates_loop (loop); |
2b271002 ZD |
1978 | } |
1979 | ||
6de9cd9a | 1980 | /* Remove all the instructions in the block. */ |
7506e1cb | 1981 | if (bb_stmt_list (bb) != NULL_TREE) |
6de9cd9a | 1982 | { |
7506e1cb | 1983 | for (i = bsi_start (bb); !bsi_end_p (i);) |
77568960 | 1984 | { |
7506e1cb ZD |
1985 | tree stmt = bsi_stmt (i); |
1986 | if (TREE_CODE (stmt) == LABEL_EXPR | |
1987 | && (FORCED_LABEL (LABEL_EXPR_LABEL (stmt)) | |
1988 | || DECL_NONLOCAL (LABEL_EXPR_LABEL (stmt)))) | |
1989 | { | |
1990 | basic_block new_bb; | |
1991 | block_stmt_iterator new_bsi; | |
1992 | ||
1993 | /* A non-reachable non-local label may still be referenced. | |
1994 | But it no longer needs to carry the extra semantics of | |
1995 | non-locality. */ | |
1996 | if (DECL_NONLOCAL (LABEL_EXPR_LABEL (stmt))) | |
1997 | { | |
1998 | DECL_NONLOCAL (LABEL_EXPR_LABEL (stmt)) = 0; | |
1999 | FORCED_LABEL (LABEL_EXPR_LABEL (stmt)) = 1; | |
2000 | } | |
bb1ecfe8 | 2001 | |
7506e1cb ZD |
2002 | new_bb = bb->prev_bb; |
2003 | new_bsi = bsi_start (new_bb); | |
2004 | bsi_remove (&i, false); | |
2005 | bsi_insert_before (&new_bsi, stmt, BSI_NEW_STMT); | |
2006 | } | |
2007 | else | |
bb1ecfe8 | 2008 | { |
7506e1cb ZD |
2009 | /* Release SSA definitions if we are in SSA. Note that we |
2010 | may be called when not in SSA. For example, | |
2011 | final_cleanup calls this function via | |
2012 | cleanup_tree_cfg. */ | |
2013 | if (gimple_in_ssa_p (cfun)) | |
2014 | release_defs (stmt); | |
2015 | ||
2016 | bsi_remove (&i, true); | |
bb1ecfe8 | 2017 | } |
6531d1be | 2018 | |
7506e1cb ZD |
2019 | /* Don't warn for removed gotos. Gotos are often removed due to |
2020 | jump threading, thus resulting in bogus warnings. Not great, | |
2021 | since this way we lose warnings for gotos in the original | |
2022 | program that are indeed unreachable. */ | |
2023 | if (TREE_CODE (stmt) != GOTO_EXPR && EXPR_HAS_LOCATION (stmt) && !loc) | |
2024 | { | |
9506ac2b | 2025 | #ifdef USE_MAPPED_LOCATION |
7506e1cb ZD |
2026 | if (EXPR_HAS_LOCATION (stmt)) |
2027 | loc = EXPR_LOCATION (stmt); | |
9506ac2b | 2028 | #else |
7506e1cb ZD |
2029 | source_locus t; |
2030 | t = EXPR_LOCUS (stmt); | |
2031 | if (t && LOCATION_LINE (*t) > 0) | |
2032 | loc = t; | |
dbce1570 | 2033 | #endif |
7506e1cb | 2034 | } |
43e05e45 | 2035 | } |
6de9cd9a DN |
2036 | } |
2037 | ||
2038 | /* If requested, give a warning that the first statement in the | |
2039 | block is unreachable. We walk statements backwards in the | |
2040 | loop above, so the last statement we process is the first statement | |
2041 | in the block. */ | |
9506ac2b | 2042 | #ifdef USE_MAPPED_LOCATION |
44c21c7f DD |
2043 | if (loc > BUILTINS_LOCATION) |
2044 | warning (OPT_Wunreachable_code, "%Hwill never be executed", &loc); | |
9506ac2b | 2045 | #else |
44c21c7f DD |
2046 | if (loc) |
2047 | warning (OPT_Wunreachable_code, "%Hwill never be executed", loc); | |
9506ac2b | 2048 | #endif |
6de9cd9a DN |
2049 | |
2050 | remove_phi_nodes_and_edges_for_unreachable_block (bb); | |
7506e1cb | 2051 | bb->il.tree = NULL; |
6de9cd9a DN |
2052 | } |
2053 | ||
6de9cd9a | 2054 | |
35920270 KH |
2055 | /* Given a basic block BB ending with COND_EXPR or SWITCH_EXPR, and a |
2056 | predicate VAL, return the edge that will be taken out of the block. | |
2057 | If VAL does not match a unique edge, NULL is returned. */ | |
6de9cd9a DN |
2058 | |
2059 | edge | |
2060 | find_taken_edge (basic_block bb, tree val) | |
2061 | { | |
2062 | tree stmt; | |
2063 | ||
2064 | stmt = last_stmt (bb); | |
2065 | ||
1e128c5f GB |
2066 | gcc_assert (stmt); |
2067 | gcc_assert (is_ctrl_stmt (stmt)); | |
65f4323d | 2068 | gcc_assert (val); |
6de9cd9a | 2069 | |
be477406 | 2070 | if (! is_gimple_min_invariant (val)) |
6de9cd9a DN |
2071 | return NULL; |
2072 | ||
2073 | if (TREE_CODE (stmt) == COND_EXPR) | |
2074 | return find_taken_edge_cond_expr (bb, val); | |
2075 | ||
2076 | if (TREE_CODE (stmt) == SWITCH_EXPR) | |
2077 | return find_taken_edge_switch_expr (bb, val); | |
2078 | ||
be477406 | 2079 | if (computed_goto_p (stmt)) |
1799efef JL |
2080 | { |
2081 | /* Only optimize if the argument is a label, if the argument is | |
2082 | not a label then we can not construct a proper CFG. | |
2083 | ||
2084 | It may be the case that we only need to allow the LABEL_REF to | |
2085 | appear inside an ADDR_EXPR, but we also allow the LABEL_REF to | |
2086 | appear inside a LABEL_EXPR just to be safe. */ | |
2087 | if ((TREE_CODE (val) == ADDR_EXPR || TREE_CODE (val) == LABEL_EXPR) | |
2088 | && TREE_CODE (TREE_OPERAND (val, 0)) == LABEL_DECL) | |
2089 | return find_taken_edge_computed_goto (bb, TREE_OPERAND (val, 0)); | |
2090 | return NULL; | |
2091 | } | |
be477406 | 2092 | |
35920270 | 2093 | gcc_unreachable (); |
6de9cd9a DN |
2094 | } |
2095 | ||
be477406 JL |
2096 | /* Given a constant value VAL and the entry block BB to a GOTO_EXPR |
2097 | statement, determine which of the outgoing edges will be taken out of the | |
2098 | block. Return NULL if either edge may be taken. */ | |
2099 | ||
2100 | static edge | |
2101 | find_taken_edge_computed_goto (basic_block bb, tree val) | |
2102 | { | |
2103 | basic_block dest; | |
2104 | edge e = NULL; | |
2105 | ||
2106 | dest = label_to_block (val); | |
2107 | if (dest) | |
2108 | { | |
2109 | e = find_edge (bb, dest); | |
2110 | gcc_assert (e != NULL); | |
2111 | } | |
2112 | ||
2113 | return e; | |
2114 | } | |
6de9cd9a DN |
2115 | |
2116 | /* Given a constant value VAL and the entry block BB to a COND_EXPR | |
2117 | statement, determine which of the two edges will be taken out of the | |
2118 | block. Return NULL if either edge may be taken. */ | |
2119 | ||
2120 | static edge | |
2121 | find_taken_edge_cond_expr (basic_block bb, tree val) | |
2122 | { | |
2123 | edge true_edge, false_edge; | |
2124 | ||
2125 | extract_true_false_edges_from_block (bb, &true_edge, &false_edge); | |
6531d1be | 2126 | |
f1b19062 | 2127 | gcc_assert (TREE_CODE (val) == INTEGER_CST); |
6e682d7e | 2128 | return (integer_zerop (val) ? false_edge : true_edge); |
6de9cd9a DN |
2129 | } |
2130 | ||
fca01525 | 2131 | /* Given an INTEGER_CST VAL and the entry block BB to a SWITCH_EXPR |
6de9cd9a DN |
2132 | statement, determine which edge will be taken out of the block. Return |
2133 | NULL if any edge may be taken. */ | |
2134 | ||
2135 | static edge | |
2136 | find_taken_edge_switch_expr (basic_block bb, tree val) | |
2137 | { | |
2138 | tree switch_expr, taken_case; | |
2139 | basic_block dest_bb; | |
2140 | edge e; | |
2141 | ||
6de9cd9a DN |
2142 | switch_expr = last_stmt (bb); |
2143 | taken_case = find_case_label_for_value (switch_expr, val); | |
2144 | dest_bb = label_to_block (CASE_LABEL (taken_case)); | |
2145 | ||
2146 | e = find_edge (bb, dest_bb); | |
1e128c5f | 2147 | gcc_assert (e); |
6de9cd9a DN |
2148 | return e; |
2149 | } | |
2150 | ||
2151 | ||
f667741c SB |
2152 | /* Return the CASE_LABEL_EXPR that SWITCH_EXPR will take for VAL. |
2153 | We can make optimal use here of the fact that the case labels are | |
2154 | sorted: We can do a binary search for a case matching VAL. */ | |
6de9cd9a DN |
2155 | |
2156 | static tree | |
2157 | find_case_label_for_value (tree switch_expr, tree val) | |
2158 | { | |
2159 | tree vec = SWITCH_LABELS (switch_expr); | |
f667741c SB |
2160 | size_t low, high, n = TREE_VEC_LENGTH (vec); |
2161 | tree default_case = TREE_VEC_ELT (vec, n - 1); | |
6de9cd9a | 2162 | |
f667741c | 2163 | for (low = -1, high = n - 1; high - low > 1; ) |
6de9cd9a | 2164 | { |
f667741c | 2165 | size_t i = (high + low) / 2; |
6de9cd9a | 2166 | tree t = TREE_VEC_ELT (vec, i); |
f667741c SB |
2167 | int cmp; |
2168 | ||
2169 | /* Cache the result of comparing CASE_LOW and val. */ | |
2170 | cmp = tree_int_cst_compare (CASE_LOW (t), val); | |
6de9cd9a | 2171 | |
f667741c SB |
2172 | if (cmp > 0) |
2173 | high = i; | |
2174 | else | |
2175 | low = i; | |
2176 | ||
2177 | if (CASE_HIGH (t) == NULL) | |
6de9cd9a | 2178 | { |
f667741c SB |
2179 | /* A singe-valued case label. */ |
2180 | if (cmp == 0) | |
6de9cd9a DN |
2181 | return t; |
2182 | } | |
2183 | else | |
2184 | { | |
2185 | /* A case range. We can only handle integer ranges. */ | |
f667741c | 2186 | if (cmp <= 0 && tree_int_cst_compare (CASE_HIGH (t), val) >= 0) |
6de9cd9a DN |
2187 | return t; |
2188 | } | |
2189 | } | |
2190 | ||
6de9cd9a DN |
2191 | return default_case; |
2192 | } | |
2193 | ||
2194 | ||
6de9cd9a DN |
2195 | |
2196 | ||
6de9cd9a DN |
2197 | /*--------------------------------------------------------------------------- |
2198 | Debugging functions | |
2199 | ---------------------------------------------------------------------------*/ | |
2200 | ||
2201 | /* Dump tree-specific information of block BB to file OUTF. */ | |
2202 | ||
2203 | void | |
2204 | tree_dump_bb (basic_block bb, FILE *outf, int indent) | |
2205 | { | |
38635499 | 2206 | dump_generic_bb (outf, bb, indent, TDF_VOPS|TDF_MEMSYMS); |
6de9cd9a DN |
2207 | } |
2208 | ||
2209 | ||
2210 | /* Dump a basic block on stderr. */ | |
2211 | ||
2212 | void | |
2213 | debug_tree_bb (basic_block bb) | |
2214 | { | |
2215 | dump_bb (bb, stderr, 0); | |
2216 | } | |
2217 | ||
2218 | ||
2219 | /* Dump basic block with index N on stderr. */ | |
2220 | ||
2221 | basic_block | |
2222 | debug_tree_bb_n (int n) | |
2223 | { | |
2224 | debug_tree_bb (BASIC_BLOCK (n)); | |
2225 | return BASIC_BLOCK (n); | |
6531d1be | 2226 | } |
6de9cd9a DN |
2227 | |
2228 | ||
2229 | /* Dump the CFG on stderr. | |
2230 | ||
2231 | FLAGS are the same used by the tree dumping functions | |
6531d1be | 2232 | (see TDF_* in tree-pass.h). */ |
6de9cd9a DN |
2233 | |
2234 | void | |
2235 | debug_tree_cfg (int flags) | |
2236 | { | |
2237 | dump_tree_cfg (stderr, flags); | |
2238 | } | |
2239 | ||
2240 | ||
2241 | /* Dump the program showing basic block boundaries on the given FILE. | |
2242 | ||
2243 | FLAGS are the same used by the tree dumping functions (see TDF_* in | |
2244 | tree.h). */ | |
2245 | ||
2246 | void | |
2247 | dump_tree_cfg (FILE *file, int flags) | |
2248 | { | |
2249 | if (flags & TDF_DETAILS) | |
2250 | { | |
2251 | const char *funcname | |
673fda6b | 2252 | = lang_hooks.decl_printable_name (current_function_decl, 2); |
6de9cd9a DN |
2253 | |
2254 | fputc ('\n', file); | |
2255 | fprintf (file, ";; Function %s\n\n", funcname); | |
2256 | fprintf (file, ";; \n%d basic blocks, %d edges, last basic block %d.\n\n", | |
2257 | n_basic_blocks, n_edges, last_basic_block); | |
2258 | ||
2259 | brief_dump_cfg (file); | |
2260 | fprintf (file, "\n"); | |
2261 | } | |
2262 | ||
2263 | if (flags & TDF_STATS) | |
2264 | dump_cfg_stats (file); | |
2265 | ||
2266 | dump_function_to_file (current_function_decl, file, flags | TDF_BLOCKS); | |
2267 | } | |
2268 | ||
2269 | ||
2270 | /* Dump CFG statistics on FILE. */ | |
2271 | ||
2272 | void | |
2273 | dump_cfg_stats (FILE *file) | |
2274 | { | |
2275 | static long max_num_merged_labels = 0; | |
2276 | unsigned long size, total = 0; | |
7b0cab99 | 2277 | long num_edges; |
6de9cd9a DN |
2278 | basic_block bb; |
2279 | const char * const fmt_str = "%-30s%-13s%12s\n"; | |
f7fda749 | 2280 | const char * const fmt_str_1 = "%-30s%13d%11lu%c\n"; |
cac50d94 | 2281 | const char * const fmt_str_2 = "%-30s%13ld%11lu%c\n"; |
6de9cd9a DN |
2282 | const char * const fmt_str_3 = "%-43s%11lu%c\n"; |
2283 | const char *funcname | |
673fda6b | 2284 | = lang_hooks.decl_printable_name (current_function_decl, 2); |
6de9cd9a DN |
2285 | |
2286 | ||
2287 | fprintf (file, "\nCFG Statistics for %s\n\n", funcname); | |
2288 | ||
2289 | fprintf (file, "---------------------------------------------------------\n"); | |
2290 | fprintf (file, fmt_str, "", " Number of ", "Memory"); | |
2291 | fprintf (file, fmt_str, "", " instances ", "used "); | |
2292 | fprintf (file, "---------------------------------------------------------\n"); | |
2293 | ||
2294 | size = n_basic_blocks * sizeof (struct basic_block_def); | |
2295 | total += size; | |
f7fda749 RH |
2296 | fprintf (file, fmt_str_1, "Basic blocks", n_basic_blocks, |
2297 | SCALE (size), LABEL (size)); | |
6de9cd9a | 2298 | |
7b0cab99 | 2299 | num_edges = 0; |
6de9cd9a | 2300 | FOR_EACH_BB (bb) |
7b0cab99 JH |
2301 | num_edges += EDGE_COUNT (bb->succs); |
2302 | size = num_edges * sizeof (struct edge_def); | |
6de9cd9a | 2303 | total += size; |
cac50d94 | 2304 | fprintf (file, fmt_str_2, "Edges", num_edges, SCALE (size), LABEL (size)); |
6de9cd9a | 2305 | |
6de9cd9a DN |
2306 | fprintf (file, "---------------------------------------------------------\n"); |
2307 | fprintf (file, fmt_str_3, "Total memory used by CFG data", SCALE (total), | |
2308 | LABEL (total)); | |
2309 | fprintf (file, "---------------------------------------------------------\n"); | |
2310 | fprintf (file, "\n"); | |
2311 | ||
2312 | if (cfg_stats.num_merged_labels > max_num_merged_labels) | |
2313 | max_num_merged_labels = cfg_stats.num_merged_labels; | |
2314 | ||
2315 | fprintf (file, "Coalesced label blocks: %ld (Max so far: %ld)\n", | |
2316 | cfg_stats.num_merged_labels, max_num_merged_labels); | |
2317 | ||
2318 | fprintf (file, "\n"); | |
2319 | } | |
2320 | ||
2321 | ||
2322 | /* Dump CFG statistics on stderr. Keep extern so that it's always | |
2323 | linked in the final executable. */ | |
2324 | ||
2325 | void | |
2326 | debug_cfg_stats (void) | |
2327 | { | |
2328 | dump_cfg_stats (stderr); | |
2329 | } | |
2330 | ||
2331 | ||
2332 | /* Dump the flowgraph to a .vcg FILE. */ | |
2333 | ||
2334 | static void | |
2335 | tree_cfg2vcg (FILE *file) | |
2336 | { | |
2337 | edge e; | |
628f6a4e | 2338 | edge_iterator ei; |
6de9cd9a DN |
2339 | basic_block bb; |
2340 | const char *funcname | |
673fda6b | 2341 | = lang_hooks.decl_printable_name (current_function_decl, 2); |
6de9cd9a DN |
2342 | |
2343 | /* Write the file header. */ | |
2344 | fprintf (file, "graph: { title: \"%s\"\n", funcname); | |
2345 | fprintf (file, "node: { title: \"ENTRY\" label: \"ENTRY\" }\n"); | |
2346 | fprintf (file, "node: { title: \"EXIT\" label: \"EXIT\" }\n"); | |
2347 | ||
2348 | /* Write blocks and edges. */ | |
628f6a4e | 2349 | FOR_EACH_EDGE (e, ei, ENTRY_BLOCK_PTR->succs) |
6de9cd9a DN |
2350 | { |
2351 | fprintf (file, "edge: { sourcename: \"ENTRY\" targetname: \"%d\"", | |
2352 | e->dest->index); | |
2353 | ||
2354 | if (e->flags & EDGE_FAKE) | |
2355 | fprintf (file, " linestyle: dotted priority: 10"); | |
2356 | else | |
2357 | fprintf (file, " linestyle: solid priority: 100"); | |
2358 | ||
2359 | fprintf (file, " }\n"); | |
2360 | } | |
2361 | fputc ('\n', file); | |
2362 | ||
2363 | FOR_EACH_BB (bb) | |
2364 | { | |
2365 | enum tree_code head_code, end_code; | |
2366 | const char *head_name, *end_name; | |
2367 | int head_line = 0; | |
2368 | int end_line = 0; | |
2369 | tree first = first_stmt (bb); | |
2370 | tree last = last_stmt (bb); | |
2371 | ||
2372 | if (first) | |
2373 | { | |
2374 | head_code = TREE_CODE (first); | |
2375 | head_name = tree_code_name[head_code]; | |
2376 | head_line = get_lineno (first); | |
2377 | } | |
2378 | else | |
2379 | head_name = "no-statement"; | |
2380 | ||
2381 | if (last) | |
2382 | { | |
2383 | end_code = TREE_CODE (last); | |
2384 | end_name = tree_code_name[end_code]; | |
2385 | end_line = get_lineno (last); | |
2386 | } | |
2387 | else | |
2388 | end_name = "no-statement"; | |
2389 | ||
2390 | fprintf (file, "node: { title: \"%d\" label: \"#%d\\n%s (%d)\\n%s (%d)\"}\n", | |
2391 | bb->index, bb->index, head_name, head_line, end_name, | |
2392 | end_line); | |
2393 | ||
628f6a4e | 2394 | FOR_EACH_EDGE (e, ei, bb->succs) |
6de9cd9a DN |
2395 | { |
2396 | if (e->dest == EXIT_BLOCK_PTR) | |
2397 | fprintf (file, "edge: { sourcename: \"%d\" targetname: \"EXIT\"", bb->index); | |
2398 | else | |
2399 | fprintf (file, "edge: { sourcename: \"%d\" targetname: \"%d\"", bb->index, e->dest->index); | |
2400 | ||
2401 | if (e->flags & EDGE_FAKE) | |
2402 | fprintf (file, " priority: 10 linestyle: dotted"); | |
2403 | else | |
2404 | fprintf (file, " priority: 100 linestyle: solid"); | |
2405 | ||
2406 | fprintf (file, " }\n"); | |
2407 | } | |
2408 | ||
2409 | if (bb->next_bb != EXIT_BLOCK_PTR) | |
2410 | fputc ('\n', file); | |
2411 | } | |
2412 | ||
2413 | fputs ("}\n\n", file); | |
2414 | } | |
2415 | ||
2416 | ||
2417 | ||
2418 | /*--------------------------------------------------------------------------- | |
2419 | Miscellaneous helpers | |
2420 | ---------------------------------------------------------------------------*/ | |
2421 | ||
2422 | /* Return true if T represents a stmt that always transfers control. */ | |
2423 | ||
2424 | bool | |
2425 | is_ctrl_stmt (tree t) | |
2426 | { | |
2427 | return (TREE_CODE (t) == COND_EXPR | |
2428 | || TREE_CODE (t) == SWITCH_EXPR | |
2429 | || TREE_CODE (t) == GOTO_EXPR | |
2430 | || TREE_CODE (t) == RETURN_EXPR | |
2431 | || TREE_CODE (t) == RESX_EXPR); | |
2432 | } | |
2433 | ||
2434 | ||
2435 | /* Return true if T is a statement that may alter the flow of control | |
2436 | (e.g., a call to a non-returning function). */ | |
2437 | ||
2438 | bool | |
2439 | is_ctrl_altering_stmt (tree t) | |
2440 | { | |
cd709752 | 2441 | tree call; |
6de9cd9a | 2442 | |
1e128c5f | 2443 | gcc_assert (t); |
cd709752 RH |
2444 | call = get_call_expr_in (t); |
2445 | if (call) | |
6de9cd9a | 2446 | { |
6de9cd9a DN |
2447 | /* A non-pure/const CALL_EXPR alters flow control if the current |
2448 | function has nonlocal labels. */ | |
cd709752 | 2449 | if (TREE_SIDE_EFFECTS (call) && current_function_has_nonlocal_label) |
6de9cd9a DN |
2450 | return true; |
2451 | ||
2452 | /* A CALL_EXPR also alters control flow if it does not return. */ | |
6e14af16 | 2453 | if (call_expr_flags (call) & ECF_NORETURN) |
6de9cd9a | 2454 | return true; |
6de9cd9a DN |
2455 | } |
2456 | ||
50674e96 | 2457 | /* OpenMP directives alter control flow. */ |
bed575d5 | 2458 | if (OMP_DIRECTIVE_P (t)) |
50674e96 DN |
2459 | return true; |
2460 | ||
6de9cd9a DN |
2461 | /* If a statement can throw, it alters control flow. */ |
2462 | return tree_can_throw_internal (t); | |
2463 | } | |
2464 | ||
2465 | ||
2466 | /* Return true if T is a computed goto. */ | |
2467 | ||
2468 | bool | |
2469 | computed_goto_p (tree t) | |
2470 | { | |
2471 | return (TREE_CODE (t) == GOTO_EXPR | |
2472 | && TREE_CODE (GOTO_DESTINATION (t)) != LABEL_DECL); | |
2473 | } | |
2474 | ||
2475 | ||
4f6c2131 | 2476 | /* Return true if T is a simple local goto. */ |
6de9cd9a DN |
2477 | |
2478 | bool | |
4f6c2131 | 2479 | simple_goto_p (tree t) |
6de9cd9a | 2480 | { |
4f6c2131 EB |
2481 | return (TREE_CODE (t) == GOTO_EXPR |
2482 | && TREE_CODE (GOTO_DESTINATION (t)) == LABEL_DECL); | |
2483 | } | |
2484 | ||
2485 | ||
2486 | /* Return true if T can make an abnormal transfer of control flow. | |
2487 | Transfers of control flow associated with EH are excluded. */ | |
2488 | ||
2489 | bool | |
2490 | tree_can_make_abnormal_goto (tree t) | |
2491 | { | |
2492 | if (computed_goto_p (t)) | |
2493 | return true; | |
07beea0d AH |
2494 | if (TREE_CODE (t) == GIMPLE_MODIFY_STMT) |
2495 | t = GIMPLE_STMT_OPERAND (t, 1); | |
4f6c2131 EB |
2496 | if (TREE_CODE (t) == WITH_SIZE_EXPR) |
2497 | t = TREE_OPERAND (t, 0); | |
2498 | if (TREE_CODE (t) == CALL_EXPR) | |
2499 | return TREE_SIDE_EFFECTS (t) && current_function_has_nonlocal_label; | |
2500 | return false; | |
6de9cd9a DN |
2501 | } |
2502 | ||
2503 | ||
2504 | /* Return true if T should start a new basic block. PREV_T is the | |
2505 | statement preceding T. It is used when T is a label or a case label. | |
2506 | Labels should only start a new basic block if their previous statement | |
2507 | wasn't a label. Otherwise, sequence of labels would generate | |
2508 | unnecessary basic blocks that only contain a single label. */ | |
2509 | ||
2510 | static inline bool | |
2511 | stmt_starts_bb_p (tree t, tree prev_t) | |
2512 | { | |
6de9cd9a DN |
2513 | if (t == NULL_TREE) |
2514 | return false; | |
2515 | ||
2516 | /* LABEL_EXPRs start a new basic block only if the preceding | |
2517 | statement wasn't a label of the same type. This prevents the | |
2518 | creation of consecutive blocks that have nothing but a single | |
2519 | label. */ | |
229cc11f | 2520 | if (TREE_CODE (t) == LABEL_EXPR) |
6de9cd9a DN |
2521 | { |
2522 | /* Nonlocal and computed GOTO targets always start a new block. */ | |
229cc11f KH |
2523 | if (DECL_NONLOCAL (LABEL_EXPR_LABEL (t)) |
2524 | || FORCED_LABEL (LABEL_EXPR_LABEL (t))) | |
6de9cd9a DN |
2525 | return true; |
2526 | ||
229cc11f | 2527 | if (prev_t && TREE_CODE (prev_t) == LABEL_EXPR) |
6de9cd9a DN |
2528 | { |
2529 | if (DECL_NONLOCAL (LABEL_EXPR_LABEL (prev_t))) | |
2530 | return true; | |
2531 | ||
2532 | cfg_stats.num_merged_labels++; | |
2533 | return false; | |
2534 | } | |
2535 | else | |
2536 | return true; | |
2537 | } | |
2538 | ||
2539 | return false; | |
2540 | } | |
2541 | ||
2542 | ||
2543 | /* Return true if T should end a basic block. */ | |
2544 | ||
2545 | bool | |
2546 | stmt_ends_bb_p (tree t) | |
2547 | { | |
2548 | return is_ctrl_stmt (t) || is_ctrl_altering_stmt (t); | |
2549 | } | |
2550 | ||
242229bb | 2551 | /* Remove block annotations and other datastructures. */ |
6de9cd9a DN |
2552 | |
2553 | void | |
242229bb | 2554 | delete_tree_cfg_annotations (void) |
6de9cd9a | 2555 | { |
3a40c18a JH |
2556 | basic_block bb; |
2557 | block_stmt_iterator bsi; | |
2558 | ||
2559 | /* Remove annotations from every tree in the function. */ | |
2560 | FOR_EACH_BB (bb) | |
2561 | for (bsi = bsi_start (bb); !bsi_end_p (bsi); bsi_next (&bsi)) | |
2562 | { | |
2563 | tree stmt = bsi_stmt (bsi); | |
2564 | ggc_free (stmt->base.ann); | |
2565 | stmt->base.ann = NULL; | |
2566 | } | |
6de9cd9a | 2567 | label_to_block_map = NULL; |
6de9cd9a DN |
2568 | } |
2569 | ||
2570 | ||
2571 | /* Return the first statement in basic block BB. */ | |
2572 | ||
2573 | tree | |
2574 | first_stmt (basic_block bb) | |
2575 | { | |
2576 | block_stmt_iterator i = bsi_start (bb); | |
2577 | return !bsi_end_p (i) ? bsi_stmt (i) : NULL_TREE; | |
2578 | } | |
2579 | ||
2580 | ||
2581 | /* Return the last statement in basic block BB. */ | |
2582 | ||
2583 | tree | |
2584 | last_stmt (basic_block bb) | |
2585 | { | |
2586 | block_stmt_iterator b = bsi_last (bb); | |
2587 | return !bsi_end_p (b) ? bsi_stmt (b) : NULL_TREE; | |
2588 | } | |
2589 | ||
2590 | ||
6de9cd9a DN |
2591 | /* Return the last statement of an otherwise empty block. Return NULL |
2592 | if the block is totally empty, or if it contains more than one | |
2593 | statement. */ | |
2594 | ||
2595 | tree | |
2596 | last_and_only_stmt (basic_block bb) | |
2597 | { | |
2598 | block_stmt_iterator i = bsi_last (bb); | |
2599 | tree last, prev; | |
2600 | ||
2601 | if (bsi_end_p (i)) | |
2602 | return NULL_TREE; | |
2603 | ||
2604 | last = bsi_stmt (i); | |
2605 | bsi_prev (&i); | |
2606 | if (bsi_end_p (i)) | |
2607 | return last; | |
2608 | ||
2609 | /* Empty statements should no longer appear in the instruction stream. | |
2610 | Everything that might have appeared before should be deleted by | |
2611 | remove_useless_stmts, and the optimizers should just bsi_remove | |
2612 | instead of smashing with build_empty_stmt. | |
2613 | ||
2614 | Thus the only thing that should appear here in a block containing | |
2615 | one executable statement is a label. */ | |
2616 | prev = bsi_stmt (i); | |
2617 | if (TREE_CODE (prev) == LABEL_EXPR) | |
2618 | return last; | |
2619 | else | |
2620 | return NULL_TREE; | |
2621 | } | |
2622 | ||
2623 | ||
2624 | /* Mark BB as the basic block holding statement T. */ | |
2625 | ||
2626 | void | |
2627 | set_bb_for_stmt (tree t, basic_block bb) | |
2628 | { | |
30d396e3 ZD |
2629 | if (TREE_CODE (t) == PHI_NODE) |
2630 | PHI_BB (t) = bb; | |
2631 | else if (TREE_CODE (t) == STATEMENT_LIST) | |
6de9cd9a DN |
2632 | { |
2633 | tree_stmt_iterator i; | |
2634 | for (i = tsi_start (t); !tsi_end_p (i); tsi_next (&i)) | |
2635 | set_bb_for_stmt (tsi_stmt (i), bb); | |
2636 | } | |
2637 | else | |
2638 | { | |
2639 | stmt_ann_t ann = get_stmt_ann (t); | |
2640 | ann->bb = bb; | |
2641 | ||
50674e96 DN |
2642 | /* If the statement is a label, add the label to block-to-labels map |
2643 | so that we can speed up edge creation for GOTO_EXPRs. */ | |
2644 | if (TREE_CODE (t) == LABEL_EXPR) | |
6de9cd9a DN |
2645 | { |
2646 | int uid; | |
2647 | ||
2648 | t = LABEL_EXPR_LABEL (t); | |
2649 | uid = LABEL_DECL_UID (t); | |
2650 | if (uid == -1) | |
2651 | { | |
e597f337 | 2652 | unsigned old_len = VEC_length (basic_block, label_to_block_map); |
6de9cd9a | 2653 | LABEL_DECL_UID (t) = uid = cfun->last_label_uid++; |
e597f337 KH |
2654 | if (old_len <= (unsigned) uid) |
2655 | { | |
e597f337 KH |
2656 | unsigned new_len = 3 * uid / 2; |
2657 | ||
a590ac65 KH |
2658 | VEC_safe_grow_cleared (basic_block, gc, label_to_block_map, |
2659 | new_len); | |
e597f337 | 2660 | } |
6de9cd9a DN |
2661 | } |
2662 | else | |
1e128c5f GB |
2663 | /* We're moving an existing label. Make sure that we've |
2664 | removed it from the old block. */ | |
e597f337 KH |
2665 | gcc_assert (!bb |
2666 | || !VEC_index (basic_block, label_to_block_map, uid)); | |
2667 | VEC_replace (basic_block, label_to_block_map, uid, bb); | |
6de9cd9a DN |
2668 | } |
2669 | } | |
2670 | } | |
2671 | ||
0a4fe58f JH |
2672 | /* Faster version of set_bb_for_stmt that assume that statement is being moved |
2673 | from one basic block to another. | |
2674 | For BB splitting we can run into quadratic case, so performance is quite | |
de1e45c3 | 2675 | important and knowing that the tables are big enough, change_bb_for_stmt |
0a4fe58f JH |
2676 | can inline as leaf function. */ |
2677 | static inline void | |
2678 | change_bb_for_stmt (tree t, basic_block bb) | |
2679 | { | |
2680 | get_stmt_ann (t)->bb = bb; | |
2681 | if (TREE_CODE (t) == LABEL_EXPR) | |
2682 | VEC_replace (basic_block, label_to_block_map, | |
2683 | LABEL_DECL_UID (LABEL_EXPR_LABEL (t)), bb); | |
2684 | } | |
2685 | ||
8b11a64c ZD |
2686 | /* Finds iterator for STMT. */ |
2687 | ||
2688 | extern block_stmt_iterator | |
1a1804c2 | 2689 | bsi_for_stmt (tree stmt) |
8b11a64c ZD |
2690 | { |
2691 | block_stmt_iterator bsi; | |
2692 | ||
2693 | for (bsi = bsi_start (bb_for_stmt (stmt)); !bsi_end_p (bsi); bsi_next (&bsi)) | |
2694 | if (bsi_stmt (bsi) == stmt) | |
2695 | return bsi; | |
2696 | ||
1e128c5f | 2697 | gcc_unreachable (); |
8b11a64c | 2698 | } |
6de9cd9a | 2699 | |
f430bae8 AM |
2700 | /* Mark statement T as modified, and update it. */ |
2701 | static inline void | |
2702 | update_modified_stmts (tree t) | |
2703 | { | |
ed1a2abd JH |
2704 | if (!ssa_operands_active ()) |
2705 | return; | |
f430bae8 AM |
2706 | if (TREE_CODE (t) == STATEMENT_LIST) |
2707 | { | |
2708 | tree_stmt_iterator i; | |
2709 | tree stmt; | |
2710 | for (i = tsi_start (t); !tsi_end_p (i); tsi_next (&i)) | |
2711 | { | |
2712 | stmt = tsi_stmt (i); | |
2713 | update_stmt_if_modified (stmt); | |
2714 | } | |
2715 | } | |
2716 | else | |
2717 | update_stmt_if_modified (t); | |
2718 | } | |
2719 | ||
6de9cd9a DN |
2720 | /* Insert statement (or statement list) T before the statement |
2721 | pointed-to by iterator I. M specifies how to update iterator I | |
2722 | after insertion (see enum bsi_iterator_update). */ | |
2723 | ||
2724 | void | |
2725 | bsi_insert_before (block_stmt_iterator *i, tree t, enum bsi_iterator_update m) | |
2726 | { | |
2727 | set_bb_for_stmt (t, i->bb); | |
f430bae8 | 2728 | update_modified_stmts (t); |
6de9cd9a DN |
2729 | tsi_link_before (&i->tsi, t, m); |
2730 | } | |
2731 | ||
2732 | ||
2733 | /* Insert statement (or statement list) T after the statement | |
2734 | pointed-to by iterator I. M specifies how to update iterator I | |
2735 | after insertion (see enum bsi_iterator_update). */ | |
2736 | ||
2737 | void | |
2738 | bsi_insert_after (block_stmt_iterator *i, tree t, enum bsi_iterator_update m) | |
2739 | { | |
2740 | set_bb_for_stmt (t, i->bb); | |
f430bae8 | 2741 | update_modified_stmts (t); |
6de9cd9a DN |
2742 | tsi_link_after (&i->tsi, t, m); |
2743 | } | |
2744 | ||
2745 | ||
2746 | /* Remove the statement pointed to by iterator I. The iterator is updated | |
6531d1be | 2747 | to the next statement. |
736432ee JL |
2748 | |
2749 | When REMOVE_EH_INFO is true we remove the statement pointed to by | |
2750 | iterator I from the EH tables. Otherwise we do not modify the EH | |
2751 | tables. | |
2752 | ||
2753 | Generally, REMOVE_EH_INFO should be true when the statement is going to | |
2754 | be removed from the IL and not reinserted elsewhere. */ | |
6de9cd9a DN |
2755 | |
2756 | void | |
736432ee | 2757 | bsi_remove (block_stmt_iterator *i, bool remove_eh_info) |
6de9cd9a DN |
2758 | { |
2759 | tree t = bsi_stmt (*i); | |
2760 | set_bb_for_stmt (t, NULL); | |
f430bae8 | 2761 | delink_stmt_imm_use (t); |
6de9cd9a | 2762 | tsi_delink (&i->tsi); |
f430bae8 | 2763 | mark_stmt_modified (t); |
736432ee | 2764 | if (remove_eh_info) |
6946b3f7 JH |
2765 | { |
2766 | remove_stmt_from_eh_region (t); | |
2767 | gimple_remove_stmt_histograms (cfun, t); | |
2768 | } | |
6de9cd9a DN |
2769 | } |
2770 | ||
2771 | ||
2772 | /* Move the statement at FROM so it comes right after the statement at TO. */ | |
2773 | ||
6531d1be | 2774 | void |
6de9cd9a DN |
2775 | bsi_move_after (block_stmt_iterator *from, block_stmt_iterator *to) |
2776 | { | |
2777 | tree stmt = bsi_stmt (*from); | |
736432ee | 2778 | bsi_remove (from, false); |
18965703 ZD |
2779 | /* We must have BSI_NEW_STMT here, as bsi_move_after is sometimes used to |
2780 | move statements to an empty block. */ | |
2781 | bsi_insert_after (to, stmt, BSI_NEW_STMT); | |
6531d1be | 2782 | } |
6de9cd9a DN |
2783 | |
2784 | ||
2785 | /* Move the statement at FROM so it comes right before the statement at TO. */ | |
2786 | ||
6531d1be | 2787 | void |
6de9cd9a DN |
2788 | bsi_move_before (block_stmt_iterator *from, block_stmt_iterator *to) |
2789 | { | |
2790 | tree stmt = bsi_stmt (*from); | |
736432ee | 2791 | bsi_remove (from, false); |
18965703 ZD |
2792 | /* For consistency with bsi_move_after, it might be better to have |
2793 | BSI_NEW_STMT here; however, that breaks several places that expect | |
2794 | that TO does not change. */ | |
6de9cd9a DN |
2795 | bsi_insert_before (to, stmt, BSI_SAME_STMT); |
2796 | } | |
2797 | ||
2798 | ||
2799 | /* Move the statement at FROM to the end of basic block BB. */ | |
2800 | ||
2801 | void | |
2802 | bsi_move_to_bb_end (block_stmt_iterator *from, basic_block bb) | |
2803 | { | |
2804 | block_stmt_iterator last = bsi_last (bb); | |
6531d1be | 2805 | |
6de9cd9a DN |
2806 | /* Have to check bsi_end_p because it could be an empty block. */ |
2807 | if (!bsi_end_p (last) && is_ctrl_stmt (bsi_stmt (last))) | |
2808 | bsi_move_before (from, &last); | |
2809 | else | |
2810 | bsi_move_after (from, &last); | |
2811 | } | |
2812 | ||
2813 | ||
2814 | /* Replace the contents of the statement pointed to by iterator BSI | |
736432ee JL |
2815 | with STMT. If UPDATE_EH_INFO is true, the exception handling |
2816 | information of the original statement is moved to the new statement. */ | |
6de9cd9a DN |
2817 | |
2818 | void | |
736432ee | 2819 | bsi_replace (const block_stmt_iterator *bsi, tree stmt, bool update_eh_info) |
6de9cd9a DN |
2820 | { |
2821 | int eh_region; | |
2822 | tree orig_stmt = bsi_stmt (*bsi); | |
2823 | ||
ff39b79b JH |
2824 | if (stmt == orig_stmt) |
2825 | return; | |
6de9cd9a DN |
2826 | SET_EXPR_LOCUS (stmt, EXPR_LOCUS (orig_stmt)); |
2827 | set_bb_for_stmt (stmt, bsi->bb); | |
2828 | ||
2829 | /* Preserve EH region information from the original statement, if | |
2830 | requested by the caller. */ | |
736432ee | 2831 | if (update_eh_info) |
6de9cd9a DN |
2832 | { |
2833 | eh_region = lookup_stmt_eh_region (orig_stmt); | |
2834 | if (eh_region >= 0) | |
59bb84ef | 2835 | { |
736432ee | 2836 | remove_stmt_from_eh_region (orig_stmt); |
59bb84ef JL |
2837 | add_stmt_to_eh_region (stmt, eh_region); |
2838 | } | |
6de9cd9a DN |
2839 | } |
2840 | ||
ff39b79b JH |
2841 | gimple_duplicate_stmt_histograms (cfun, stmt, cfun, orig_stmt); |
2842 | gimple_remove_stmt_histograms (cfun, orig_stmt); | |
b1ca239f | 2843 | delink_stmt_imm_use (orig_stmt); |
6de9cd9a | 2844 | *bsi_stmt_ptr (*bsi) = stmt; |
f430bae8 AM |
2845 | mark_stmt_modified (stmt); |
2846 | update_modified_stmts (stmt); | |
6de9cd9a DN |
2847 | } |
2848 | ||
2849 | ||
2850 | /* Insert the statement pointed-to by BSI into edge E. Every attempt | |
2851 | is made to place the statement in an existing basic block, but | |
2852 | sometimes that isn't possible. When it isn't possible, the edge is | |
2853 | split and the statement is added to the new block. | |
2854 | ||
2855 | In all cases, the returned *BSI points to the correct location. The | |
2856 | return value is true if insertion should be done after the location, | |
82b85a85 ZD |
2857 | or false if it should be done before the location. If new basic block |
2858 | has to be created, it is stored in *NEW_BB. */ | |
6de9cd9a DN |
2859 | |
2860 | static bool | |
82b85a85 ZD |
2861 | tree_find_edge_insert_loc (edge e, block_stmt_iterator *bsi, |
2862 | basic_block *new_bb) | |
6de9cd9a DN |
2863 | { |
2864 | basic_block dest, src; | |
2865 | tree tmp; | |
2866 | ||
2867 | dest = e->dest; | |
2868 | restart: | |
2869 | ||
2870 | /* If the destination has one predecessor which has no PHI nodes, | |
6531d1be | 2871 | insert there. Except for the exit block. |
6de9cd9a DN |
2872 | |
2873 | The requirement for no PHI nodes could be relaxed. Basically we | |
2874 | would have to examine the PHIs to prove that none of them used | |
e28d0cfb | 2875 | the value set by the statement we want to insert on E. That |
6de9cd9a | 2876 | hardly seems worth the effort. */ |
c5cbcccf | 2877 | if (single_pred_p (dest) |
6de9cd9a DN |
2878 | && ! phi_nodes (dest) |
2879 | && dest != EXIT_BLOCK_PTR) | |
2880 | { | |
2881 | *bsi = bsi_start (dest); | |
2882 | if (bsi_end_p (*bsi)) | |
2883 | return true; | |
2884 | ||
2885 | /* Make sure we insert after any leading labels. */ | |
2886 | tmp = bsi_stmt (*bsi); | |
2887 | while (TREE_CODE (tmp) == LABEL_EXPR) | |
2888 | { | |
2889 | bsi_next (bsi); | |
2890 | if (bsi_end_p (*bsi)) | |
2891 | break; | |
2892 | tmp = bsi_stmt (*bsi); | |
2893 | } | |
2894 | ||
2895 | if (bsi_end_p (*bsi)) | |
2896 | { | |
2897 | *bsi = bsi_last (dest); | |
2898 | return true; | |
2899 | } | |
2900 | else | |
2901 | return false; | |
2902 | } | |
2903 | ||
2904 | /* If the source has one successor, the edge is not abnormal and | |
2905 | the last statement does not end a basic block, insert there. | |
2906 | Except for the entry block. */ | |
2907 | src = e->src; | |
2908 | if ((e->flags & EDGE_ABNORMAL) == 0 | |
c5cbcccf | 2909 | && single_succ_p (src) |
6de9cd9a DN |
2910 | && src != ENTRY_BLOCK_PTR) |
2911 | { | |
2912 | *bsi = bsi_last (src); | |
2913 | if (bsi_end_p (*bsi)) | |
2914 | return true; | |
2915 | ||
2916 | tmp = bsi_stmt (*bsi); | |
2917 | if (!stmt_ends_bb_p (tmp)) | |
2918 | return true; | |
ce068299 JH |
2919 | |
2920 | /* Insert code just before returning the value. We may need to decompose | |
2921 | the return in the case it contains non-trivial operand. */ | |
2922 | if (TREE_CODE (tmp) == RETURN_EXPR) | |
2923 | { | |
2924 | tree op = TREE_OPERAND (tmp, 0); | |
7802250d | 2925 | if (op && !is_gimple_val (op)) |
ce068299 | 2926 | { |
07beea0d | 2927 | gcc_assert (TREE_CODE (op) == GIMPLE_MODIFY_STMT); |
ce068299 | 2928 | bsi_insert_before (bsi, op, BSI_NEW_STMT); |
07beea0d | 2929 | TREE_OPERAND (tmp, 0) = GIMPLE_STMT_OPERAND (op, 0); |
ce068299 JH |
2930 | } |
2931 | bsi_prev (bsi); | |
2932 | return true; | |
2933 | } | |
6de9cd9a DN |
2934 | } |
2935 | ||
2936 | /* Otherwise, create a new basic block, and split this edge. */ | |
2937 | dest = split_edge (e); | |
82b85a85 ZD |
2938 | if (new_bb) |
2939 | *new_bb = dest; | |
c5cbcccf | 2940 | e = single_pred_edge (dest); |
6de9cd9a DN |
2941 | goto restart; |
2942 | } | |
2943 | ||
2944 | ||
2945 | /* This routine will commit all pending edge insertions, creating any new | |
8e731e4e | 2946 | basic blocks which are necessary. */ |
6de9cd9a DN |
2947 | |
2948 | void | |
8e731e4e | 2949 | bsi_commit_edge_inserts (void) |
6de9cd9a DN |
2950 | { |
2951 | basic_block bb; | |
2952 | edge e; | |
628f6a4e | 2953 | edge_iterator ei; |
6de9cd9a | 2954 | |
c5cbcccf | 2955 | bsi_commit_one_edge_insert (single_succ_edge (ENTRY_BLOCK_PTR), NULL); |
6de9cd9a DN |
2956 | |
2957 | FOR_EACH_BB (bb) | |
628f6a4e | 2958 | FOR_EACH_EDGE (e, ei, bb->succs) |
edfaf675 | 2959 | bsi_commit_one_edge_insert (e, NULL); |
6de9cd9a DN |
2960 | } |
2961 | ||
2962 | ||
edfaf675 AM |
2963 | /* Commit insertions pending at edge E. If a new block is created, set NEW_BB |
2964 | to this block, otherwise set it to NULL. */ | |
6de9cd9a | 2965 | |
edfaf675 AM |
2966 | void |
2967 | bsi_commit_one_edge_insert (edge e, basic_block *new_bb) | |
6de9cd9a | 2968 | { |
edfaf675 AM |
2969 | if (new_bb) |
2970 | *new_bb = NULL; | |
6de9cd9a DN |
2971 | if (PENDING_STMT (e)) |
2972 | { | |
2973 | block_stmt_iterator bsi; | |
2974 | tree stmt = PENDING_STMT (e); | |
2975 | ||
2976 | PENDING_STMT (e) = NULL_TREE; | |
2977 | ||
edfaf675 | 2978 | if (tree_find_edge_insert_loc (e, &bsi, new_bb)) |
6de9cd9a DN |
2979 | bsi_insert_after (&bsi, stmt, BSI_NEW_STMT); |
2980 | else | |
2981 | bsi_insert_before (&bsi, stmt, BSI_NEW_STMT); | |
2982 | } | |
2983 | } | |
2984 | ||
2985 | ||
2986 | /* Add STMT to the pending list of edge E. No actual insertion is | |
2987 | made until a call to bsi_commit_edge_inserts () is made. */ | |
2988 | ||
2989 | void | |
2990 | bsi_insert_on_edge (edge e, tree stmt) | |
2991 | { | |
2992 | append_to_statement_list (stmt, &PENDING_STMT (e)); | |
2993 | } | |
2994 | ||
adb35797 KH |
2995 | /* Similar to bsi_insert_on_edge+bsi_commit_edge_inserts. If a new |
2996 | block has to be created, it is returned. */ | |
82b85a85 ZD |
2997 | |
2998 | basic_block | |
2999 | bsi_insert_on_edge_immediate (edge e, tree stmt) | |
3000 | { | |
3001 | block_stmt_iterator bsi; | |
3002 | basic_block new_bb = NULL; | |
3003 | ||
1e128c5f | 3004 | gcc_assert (!PENDING_STMT (e)); |
82b85a85 ZD |
3005 | |
3006 | if (tree_find_edge_insert_loc (e, &bsi, &new_bb)) | |
3007 | bsi_insert_after (&bsi, stmt, BSI_NEW_STMT); | |
3008 | else | |
3009 | bsi_insert_before (&bsi, stmt, BSI_NEW_STMT); | |
3010 | ||
3011 | return new_bb; | |
3012 | } | |
6de9cd9a | 3013 | |
6de9cd9a DN |
3014 | /*--------------------------------------------------------------------------- |
3015 | Tree specific functions for CFG manipulation | |
3016 | ---------------------------------------------------------------------------*/ | |
3017 | ||
4f7db7f7 KH |
3018 | /* Reinstall those PHI arguments queued in OLD_EDGE to NEW_EDGE. */ |
3019 | ||
3020 | static void | |
3021 | reinstall_phi_args (edge new_edge, edge old_edge) | |
3022 | { | |
3023 | tree var, phi; | |
3024 | ||
3025 | if (!PENDING_STMT (old_edge)) | |
3026 | return; | |
6531d1be | 3027 | |
4f7db7f7 KH |
3028 | for (var = PENDING_STMT (old_edge), phi = phi_nodes (new_edge->dest); |
3029 | var && phi; | |
3030 | var = TREE_CHAIN (var), phi = PHI_CHAIN (phi)) | |
3031 | { | |
3032 | tree result = TREE_PURPOSE (var); | |
3033 | tree arg = TREE_VALUE (var); | |
3034 | ||
3035 | gcc_assert (result == PHI_RESULT (phi)); | |
3036 | ||
d2e398df | 3037 | add_phi_arg (phi, arg, new_edge); |
4f7db7f7 KH |
3038 | } |
3039 | ||
3040 | PENDING_STMT (old_edge) = NULL; | |
3041 | } | |
3042 | ||
2a8a8292 | 3043 | /* Returns the basic block after which the new basic block created |
b9a66240 ZD |
3044 | by splitting edge EDGE_IN should be placed. Tries to keep the new block |
3045 | near its "logical" location. This is of most help to humans looking | |
3046 | at debugging dumps. */ | |
3047 | ||
3048 | static basic_block | |
3049 | split_edge_bb_loc (edge edge_in) | |
3050 | { | |
3051 | basic_block dest = edge_in->dest; | |
3052 | ||
3053 | if (dest->prev_bb && find_edge (dest->prev_bb, dest)) | |
3054 | return edge_in->src; | |
3055 | else | |
3056 | return dest->prev_bb; | |
3057 | } | |
3058 | ||
6de9cd9a DN |
3059 | /* Split a (typically critical) edge EDGE_IN. Return the new block. |
3060 | Abort on abnormal edges. */ | |
3061 | ||
3062 | static basic_block | |
3063 | tree_split_edge (edge edge_in) | |
3064 | { | |
4741d956 | 3065 | basic_block new_bb, after_bb, dest; |
6de9cd9a | 3066 | edge new_edge, e; |
6de9cd9a DN |
3067 | |
3068 | /* Abnormal edges cannot be split. */ | |
1e128c5f | 3069 | gcc_assert (!(edge_in->flags & EDGE_ABNORMAL)); |
6de9cd9a | 3070 | |
6de9cd9a DN |
3071 | dest = edge_in->dest; |
3072 | ||
b9a66240 | 3073 | after_bb = split_edge_bb_loc (edge_in); |
6de9cd9a DN |
3074 | |
3075 | new_bb = create_empty_bb (after_bb); | |
b829f3fa JH |
3076 | new_bb->frequency = EDGE_FREQUENCY (edge_in); |
3077 | new_bb->count = edge_in->count; | |
6de9cd9a | 3078 | new_edge = make_edge (new_bb, dest, EDGE_FALLTHRU); |
b829f3fa JH |
3079 | new_edge->probability = REG_BR_PROB_BASE; |
3080 | new_edge->count = edge_in->count; | |
6de9cd9a | 3081 | |
1e128c5f | 3082 | e = redirect_edge_and_branch (edge_in, new_bb); |
c7b852c8 | 3083 | gcc_assert (e == edge_in); |
4f7db7f7 | 3084 | reinstall_phi_args (new_edge, e); |
6de9cd9a DN |
3085 | |
3086 | return new_bb; | |
3087 | } | |
3088 | ||
6de9cd9a | 3089 | /* Callback for walk_tree, check that all elements with address taken are |
7a442a1d SB |
3090 | properly noticed as such. The DATA is an int* that is 1 if TP was seen |
3091 | inside a PHI node. */ | |
6de9cd9a DN |
3092 | |
3093 | static tree | |
2fbe90f2 | 3094 | verify_expr (tree *tp, int *walk_subtrees, void *data ATTRIBUTE_UNUSED) |
6de9cd9a DN |
3095 | { |
3096 | tree t = *tp, x; | |
7a442a1d | 3097 | bool in_phi = (data != NULL); |
6de9cd9a DN |
3098 | |
3099 | if (TYPE_P (t)) | |
3100 | *walk_subtrees = 0; | |
6531d1be | 3101 | |
e8ca4159 | 3102 | /* Check operand N for being valid GIMPLE and give error MSG if not. */ |
2fbe90f2 | 3103 | #define CHECK_OP(N, MSG) \ |
e8ca4159 | 3104 | do { if (!is_gimple_val (TREE_OPERAND (t, N))) \ |
2fbe90f2 | 3105 | { error (MSG); return TREE_OPERAND (t, N); }} while (0) |
6de9cd9a DN |
3106 | |
3107 | switch (TREE_CODE (t)) | |
3108 | { | |
3109 | case SSA_NAME: | |
3110 | if (SSA_NAME_IN_FREE_LIST (t)) | |
3111 | { | |
3112 | error ("SSA name in freelist but still referenced"); | |
3113 | return *tp; | |
3114 | } | |
3115 | break; | |
3116 | ||
0bca51f0 DN |
3117 | case ASSERT_EXPR: |
3118 | x = fold (ASSERT_EXPR_COND (t)); | |
3119 | if (x == boolean_false_node) | |
3120 | { | |
3121 | error ("ASSERT_EXPR with an always-false condition"); | |
3122 | return *tp; | |
3123 | } | |
3124 | break; | |
3125 | ||
6de9cd9a | 3126 | case MODIFY_EXPR: |
07beea0d AH |
3127 | gcc_unreachable (); |
3128 | ||
3129 | case GIMPLE_MODIFY_STMT: | |
3130 | x = GIMPLE_STMT_OPERAND (t, 0); | |
6de9cd9a DN |
3131 | if (TREE_CODE (x) == BIT_FIELD_REF |
3132 | && is_gimple_reg (TREE_OPERAND (x, 0))) | |
3133 | { | |
3134 | error ("GIMPLE register modified with BIT_FIELD_REF"); | |
2fbe90f2 | 3135 | return t; |
6de9cd9a DN |
3136 | } |
3137 | break; | |
3138 | ||
3139 | case ADDR_EXPR: | |
81fc3052 DB |
3140 | { |
3141 | bool old_invariant; | |
3142 | bool old_constant; | |
3143 | bool old_side_effects; | |
3144 | bool new_invariant; | |
3145 | bool new_constant; | |
3146 | bool new_side_effects; | |
3147 | ||
3148 | /* ??? tree-ssa-alias.c may have overlooked dead PHI nodes, missing | |
3149 | dead PHIs that take the address of something. But if the PHI | |
3150 | result is dead, the fact that it takes the address of anything | |
3151 | is irrelevant. Because we can not tell from here if a PHI result | |
3152 | is dead, we just skip this check for PHIs altogether. This means | |
3153 | we may be missing "valid" checks, but what can you do? | |
3154 | This was PR19217. */ | |
3155 | if (in_phi) | |
3156 | break; | |
7a442a1d | 3157 | |
81fc3052 DB |
3158 | old_invariant = TREE_INVARIANT (t); |
3159 | old_constant = TREE_CONSTANT (t); | |
3160 | old_side_effects = TREE_SIDE_EFFECTS (t); | |
3161 | ||
127203ac | 3162 | recompute_tree_invariant_for_addr_expr (t); |
81fc3052 DB |
3163 | new_invariant = TREE_INVARIANT (t); |
3164 | new_side_effects = TREE_SIDE_EFFECTS (t); | |
3165 | new_constant = TREE_CONSTANT (t); | |
3166 | ||
3167 | if (old_invariant != new_invariant) | |
3168 | { | |
3169 | error ("invariant not recomputed when ADDR_EXPR changed"); | |
3170 | return t; | |
3171 | } | |
3172 | ||
3173 | if (old_constant != new_constant) | |
3174 | { | |
3175 | error ("constant not recomputed when ADDR_EXPR changed"); | |
3176 | return t; | |
3177 | } | |
3178 | if (old_side_effects != new_side_effects) | |
3179 | { | |
3180 | error ("side effects not recomputed when ADDR_EXPR changed"); | |
3181 | return t; | |
3182 | } | |
3183 | ||
3184 | /* Skip any references (they will be checked when we recurse down the | |
3185 | tree) and ensure that any variable used as a prefix is marked | |
3186 | addressable. */ | |
3187 | for (x = TREE_OPERAND (t, 0); | |
3188 | handled_component_p (x); | |
3189 | x = TREE_OPERAND (x, 0)) | |
3190 | ; | |
3191 | ||
3192 | if (TREE_CODE (x) != VAR_DECL && TREE_CODE (x) != PARM_DECL) | |
3193 | return NULL; | |
3194 | if (!TREE_ADDRESSABLE (x)) | |
3195 | { | |
3196 | error ("address taken, but ADDRESSABLE bit not set"); | |
3197 | return x; | |
3198 | } | |
3199 | break; | |
3200 | } | |
6de9cd9a DN |
3201 | |
3202 | case COND_EXPR: | |
a6234684 | 3203 | x = COND_EXPR_COND (t); |
6de9cd9a DN |
3204 | if (TREE_CODE (TREE_TYPE (x)) != BOOLEAN_TYPE) |
3205 | { | |
3206 | error ("non-boolean used in condition"); | |
3207 | return x; | |
3208 | } | |
9c691961 AP |
3209 | if (!is_gimple_condexpr (x)) |
3210 | { | |
ab532386 | 3211 | error ("invalid conditional operand"); |
9c691961 AP |
3212 | return x; |
3213 | } | |
6de9cd9a DN |
3214 | break; |
3215 | ||
3216 | case NOP_EXPR: | |
3217 | case CONVERT_EXPR: | |
3218 | case FIX_TRUNC_EXPR: | |
6de9cd9a DN |
3219 | case FLOAT_EXPR: |
3220 | case NEGATE_EXPR: | |
3221 | case ABS_EXPR: | |
3222 | case BIT_NOT_EXPR: | |
3223 | case NON_LVALUE_EXPR: | |
3224 | case TRUTH_NOT_EXPR: | |
ab532386 | 3225 | CHECK_OP (0, "invalid operand to unary operator"); |
6de9cd9a DN |
3226 | break; |
3227 | ||
3228 | case REALPART_EXPR: | |
3229 | case IMAGPART_EXPR: | |
2fbe90f2 RK |
3230 | case COMPONENT_REF: |
3231 | case ARRAY_REF: | |
3232 | case ARRAY_RANGE_REF: | |
3233 | case BIT_FIELD_REF: | |
3234 | case VIEW_CONVERT_EXPR: | |
3235 | /* We have a nest of references. Verify that each of the operands | |
3236 | that determine where to reference is either a constant or a variable, | |
3237 | verify that the base is valid, and then show we've already checked | |
3238 | the subtrees. */ | |
afe84921 | 3239 | while (handled_component_p (t)) |
2fbe90f2 RK |
3240 | { |
3241 | if (TREE_CODE (t) == COMPONENT_REF && TREE_OPERAND (t, 2)) | |
ab532386 | 3242 | CHECK_OP (2, "invalid COMPONENT_REF offset operator"); |
2fbe90f2 RK |
3243 | else if (TREE_CODE (t) == ARRAY_REF |
3244 | || TREE_CODE (t) == ARRAY_RANGE_REF) | |
3245 | { | |
ab532386 | 3246 | CHECK_OP (1, "invalid array index"); |
2fbe90f2 | 3247 | if (TREE_OPERAND (t, 2)) |
ab532386 | 3248 | CHECK_OP (2, "invalid array lower bound"); |
2fbe90f2 | 3249 | if (TREE_OPERAND (t, 3)) |
ab532386 | 3250 | CHECK_OP (3, "invalid array stride"); |
2fbe90f2 RK |
3251 | } |
3252 | else if (TREE_CODE (t) == BIT_FIELD_REF) | |
3253 | { | |
ab532386 JM |
3254 | CHECK_OP (1, "invalid operand to BIT_FIELD_REF"); |
3255 | CHECK_OP (2, "invalid operand to BIT_FIELD_REF"); | |
2fbe90f2 RK |
3256 | } |
3257 | ||
3258 | t = TREE_OPERAND (t, 0); | |
3259 | } | |
3260 | ||
6615c446 | 3261 | if (!CONSTANT_CLASS_P (t) && !is_gimple_lvalue (t)) |
2fbe90f2 | 3262 | { |
ab532386 | 3263 | error ("invalid reference prefix"); |
2fbe90f2 RK |
3264 | return t; |
3265 | } | |
3266 | *walk_subtrees = 0; | |
6de9cd9a | 3267 | break; |
5be014d5 AP |
3268 | case PLUS_EXPR: |
3269 | case MINUS_EXPR: | |
3270 | /* PLUS_EXPR and MINUS_EXPR don't work on pointers, they should be done using | |
3271 | POINTER_PLUS_EXPR. */ | |
3272 | if (POINTER_TYPE_P (TREE_TYPE (t))) | |
3273 | { | |
3274 | error ("invalid operand to plus/minus, type is a pointer"); | |
3275 | return t; | |
3276 | } | |
3277 | CHECK_OP (0, "invalid operand to binary operator"); | |
3278 | CHECK_OP (1, "invalid operand to binary operator"); | |
3279 | break; | |
6de9cd9a | 3280 | |
5be014d5 AP |
3281 | case POINTER_PLUS_EXPR: |
3282 | /* Check to make sure the first operand is a pointer or reference type. */ | |
3283 | if (!POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (t, 0)))) | |
3284 | { | |
3285 | error ("invalid operand to pointer plus, first operand is not a pointer"); | |
3286 | return t; | |
3287 | } | |
3288 | /* Check to make sure the second operand is an integer with type of | |
3289 | sizetype. */ | |
3290 | if (!tree_ssa_useless_type_conversion_1 (sizetype, | |
3291 | TREE_TYPE (TREE_OPERAND (t, 1)))) | |
3292 | { | |
3293 | error ("invalid operand to pointer plus, second operand is not an " | |
3294 | "integer with type of sizetype."); | |
3295 | return t; | |
3296 | } | |
3297 | /* FALLTHROUGH */ | |
6de9cd9a DN |
3298 | case LT_EXPR: |
3299 | case LE_EXPR: | |
3300 | case GT_EXPR: | |
3301 | case GE_EXPR: | |
3302 | case EQ_EXPR: | |
3303 | case NE_EXPR: | |
3304 | case UNORDERED_EXPR: | |
3305 | case ORDERED_EXPR: | |
3306 | case UNLT_EXPR: | |
3307 | case UNLE_EXPR: | |
3308 | case UNGT_EXPR: | |
3309 | case UNGE_EXPR: | |
3310 | case UNEQ_EXPR: | |
d1a7edaf | 3311 | case LTGT_EXPR: |
6de9cd9a DN |
3312 | case MULT_EXPR: |
3313 | case TRUNC_DIV_EXPR: | |
3314 | case CEIL_DIV_EXPR: | |
3315 | case FLOOR_DIV_EXPR: | |
3316 | case ROUND_DIV_EXPR: | |
3317 | case TRUNC_MOD_EXPR: | |
3318 | case CEIL_MOD_EXPR: | |
3319 | case FLOOR_MOD_EXPR: | |
3320 | case ROUND_MOD_EXPR: | |
3321 | case RDIV_EXPR: | |
3322 | case EXACT_DIV_EXPR: | |
3323 | case MIN_EXPR: | |
3324 | case MAX_EXPR: | |
3325 | case LSHIFT_EXPR: | |
3326 | case RSHIFT_EXPR: | |
3327 | case LROTATE_EXPR: | |
3328 | case RROTATE_EXPR: | |
3329 | case BIT_IOR_EXPR: | |
3330 | case BIT_XOR_EXPR: | |
3331 | case BIT_AND_EXPR: | |
ab532386 JM |
3332 | CHECK_OP (0, "invalid operand to binary operator"); |
3333 | CHECK_OP (1, "invalid operand to binary operator"); | |
6de9cd9a DN |
3334 | break; |
3335 | ||
84816907 JM |
3336 | case CONSTRUCTOR: |
3337 | if (TREE_CONSTANT (t) && TREE_CODE (TREE_TYPE (t)) == VECTOR_TYPE) | |
3338 | *walk_subtrees = 0; | |
3339 | break; | |
3340 | ||
6de9cd9a DN |
3341 | default: |
3342 | break; | |
3343 | } | |
3344 | return NULL; | |
2fbe90f2 RK |
3345 | |
3346 | #undef CHECK_OP | |
6de9cd9a DN |
3347 | } |
3348 | ||
3349 | ||
3350 | /* Verify STMT, return true if STMT is not in GIMPLE form. | |
3351 | TODO: Implement type checking. */ | |
3352 | ||
3353 | static bool | |
1eaba2f2 | 3354 | verify_stmt (tree stmt, bool last_in_block) |
6de9cd9a DN |
3355 | { |
3356 | tree addr; | |
3357 | ||
50674e96 DN |
3358 | if (OMP_DIRECTIVE_P (stmt)) |
3359 | { | |
3360 | /* OpenMP directives are validated by the FE and never operated | |
3361 | on by the optimizers. Furthermore, OMP_FOR may contain | |
3362 | non-gimple expressions when the main index variable has had | |
3363 | its address taken. This does not affect the loop itself | |
3364 | because the header of an OMP_FOR is merely used to determine | |
3365 | how to setup the parallel iteration. */ | |
3366 | return false; | |
3367 | } | |
3368 | ||
6de9cd9a DN |
3369 | if (!is_gimple_stmt (stmt)) |
3370 | { | |
ab532386 | 3371 | error ("is not a valid GIMPLE statement"); |
1eaba2f2 | 3372 | goto fail; |
6de9cd9a DN |
3373 | } |
3374 | ||
3375 | addr = walk_tree (&stmt, verify_expr, NULL, NULL); | |
3376 | if (addr) | |
3377 | { | |
3378 | debug_generic_stmt (addr); | |
3379 | return true; | |
3380 | } | |
3381 | ||
1eaba2f2 RH |
3382 | /* If the statement is marked as part of an EH region, then it is |
3383 | expected that the statement could throw. Verify that when we | |
3384 | have optimizations that simplify statements such that we prove | |
3385 | that they cannot throw, that we update other data structures | |
3386 | to match. */ | |
3387 | if (lookup_stmt_eh_region (stmt) >= 0) | |
3388 | { | |
3389 | if (!tree_could_throw_p (stmt)) | |
3390 | { | |
ab532386 | 3391 | error ("statement marked for throw, but doesn%'t"); |
1eaba2f2 RH |
3392 | goto fail; |
3393 | } | |
3394 | if (!last_in_block && tree_can_throw_internal (stmt)) | |
3395 | { | |
ab532386 | 3396 | error ("statement marked for throw in middle of block"); |
1eaba2f2 RH |
3397 | goto fail; |
3398 | } | |
3399 | } | |
3400 | ||
6de9cd9a | 3401 | return false; |
1eaba2f2 RH |
3402 | |
3403 | fail: | |
3404 | debug_generic_stmt (stmt); | |
3405 | return true; | |
6de9cd9a DN |
3406 | } |
3407 | ||
3408 | ||
3409 | /* Return true when the T can be shared. */ | |
3410 | ||
3411 | static bool | |
3412 | tree_node_can_be_shared (tree t) | |
3413 | { | |
6615c446 | 3414 | if (IS_TYPE_OR_DECL_P (t) |
6de9cd9a | 3415 | || is_gimple_min_invariant (t) |
5e23162d | 3416 | || TREE_CODE (t) == SSA_NAME |
953ff289 DN |
3417 | || t == error_mark_node |
3418 | || TREE_CODE (t) == IDENTIFIER_NODE) | |
6de9cd9a DN |
3419 | return true; |
3420 | ||
92b6dff3 JL |
3421 | if (TREE_CODE (t) == CASE_LABEL_EXPR) |
3422 | return true; | |
3423 | ||
44de5aeb | 3424 | while (((TREE_CODE (t) == ARRAY_REF || TREE_CODE (t) == ARRAY_RANGE_REF) |
953ff289 DN |
3425 | && is_gimple_min_invariant (TREE_OPERAND (t, 1))) |
3426 | || TREE_CODE (t) == COMPONENT_REF | |
3427 | || TREE_CODE (t) == REALPART_EXPR | |
3428 | || TREE_CODE (t) == IMAGPART_EXPR) | |
6de9cd9a DN |
3429 | t = TREE_OPERAND (t, 0); |
3430 | ||
3431 | if (DECL_P (t)) | |
3432 | return true; | |
3433 | ||
3434 | return false; | |
3435 | } | |
3436 | ||
3437 | ||
3438 | /* Called via walk_trees. Verify tree sharing. */ | |
3439 | ||
3440 | static tree | |
3441 | verify_node_sharing (tree * tp, int *walk_subtrees, void *data) | |
3442 | { | |
4437b50d | 3443 | struct pointer_set_t *visited = (struct pointer_set_t *) data; |
6de9cd9a DN |
3444 | |
3445 | if (tree_node_can_be_shared (*tp)) | |
3446 | { | |
3447 | *walk_subtrees = false; | |
3448 | return NULL; | |
3449 | } | |
3450 | ||
4437b50d JH |
3451 | if (pointer_set_insert (visited, *tp)) |
3452 | return *tp; | |
6de9cd9a DN |
3453 | |
3454 | return NULL; | |
3455 | } | |
3456 | ||
3457 | ||
07beea0d AH |
3458 | /* Helper function for verify_gimple_tuples. */ |
3459 | ||
3460 | static tree | |
3461 | verify_gimple_tuples_1 (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED, | |
3462 | void *data ATTRIBUTE_UNUSED) | |
3463 | { | |
3464 | switch (TREE_CODE (*tp)) | |
3465 | { | |
3466 | case MODIFY_EXPR: | |
3467 | error ("unexpected non-tuple"); | |
3468 | debug_tree (*tp); | |
3469 | gcc_unreachable (); | |
3470 | return NULL_TREE; | |
3471 | ||
3472 | default: | |
3473 | return NULL_TREE; | |
3474 | } | |
3475 | } | |
3476 | ||
3477 | /* Verify that there are no trees that should have been converted to | |
3478 | gimple tuples. Return true if T contains a node that should have | |
3479 | been converted to a gimple tuple, but hasn't. */ | |
3480 | ||
3481 | static bool | |
3482 | verify_gimple_tuples (tree t) | |
3483 | { | |
3484 | return walk_tree (&t, verify_gimple_tuples_1, NULL, NULL) != NULL; | |
3485 | } | |
3486 | ||
4437b50d JH |
3487 | static bool eh_error_found; |
3488 | static int | |
3489 | verify_eh_throw_stmt_node (void **slot, void *data) | |
3490 | { | |
3491 | struct throw_stmt_node *node = (struct throw_stmt_node *)*slot; | |
3492 | struct pointer_set_t *visited = (struct pointer_set_t *) data; | |
3493 | ||
3494 | if (!pointer_set_contains (visited, node->stmt)) | |
3495 | { | |
3496 | error ("Dead STMT in EH table"); | |
3497 | debug_generic_stmt (node->stmt); | |
3498 | eh_error_found = true; | |
3499 | } | |
3500 | return 0; | |
3501 | } | |
3502 | ||
6de9cd9a DN |
3503 | /* Verify the GIMPLE statement chain. */ |
3504 | ||
3505 | void | |
3506 | verify_stmts (void) | |
3507 | { | |
3508 | basic_block bb; | |
3509 | block_stmt_iterator bsi; | |
3510 | bool err = false; | |
4437b50d | 3511 | struct pointer_set_t *visited, *visited_stmts; |
6de9cd9a DN |
3512 | tree addr; |
3513 | ||
3514 | timevar_push (TV_TREE_STMT_VERIFY); | |
4437b50d JH |
3515 | visited = pointer_set_create (); |
3516 | visited_stmts = pointer_set_create (); | |
6de9cd9a DN |
3517 | |
3518 | FOR_EACH_BB (bb) | |
3519 | { | |
3520 | tree phi; | |
3521 | int i; | |
3522 | ||
17192884 | 3523 | for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) |
6de9cd9a DN |
3524 | { |
3525 | int phi_num_args = PHI_NUM_ARGS (phi); | |
3526 | ||
4437b50d | 3527 | pointer_set_insert (visited_stmts, phi); |
8de1fc1b KH |
3528 | if (bb_for_stmt (phi) != bb) |
3529 | { | |
ab532386 | 3530 | error ("bb_for_stmt (phi) is set to a wrong basic block"); |
8de1fc1b KH |
3531 | err |= true; |
3532 | } | |
3533 | ||
6de9cd9a DN |
3534 | for (i = 0; i < phi_num_args; i++) |
3535 | { | |
3536 | tree t = PHI_ARG_DEF (phi, i); | |
3537 | tree addr; | |
3538 | ||
3539 | /* Addressable variables do have SSA_NAMEs but they | |
3540 | are not considered gimple values. */ | |
3541 | if (TREE_CODE (t) != SSA_NAME | |
3542 | && TREE_CODE (t) != FUNCTION_DECL | |
3543 | && !is_gimple_val (t)) | |
3544 | { | |
3545 | error ("PHI def is not a GIMPLE value"); | |
3546 | debug_generic_stmt (phi); | |
3547 | debug_generic_stmt (t); | |
3548 | err |= true; | |
3549 | } | |
3550 | ||
7a442a1d | 3551 | addr = walk_tree (&t, verify_expr, (void *) 1, NULL); |
6de9cd9a DN |
3552 | if (addr) |
3553 | { | |
3554 | debug_generic_stmt (addr); | |
3555 | err |= true; | |
3556 | } | |
3557 | ||
4437b50d | 3558 | addr = walk_tree (&t, verify_node_sharing, visited, NULL); |
6de9cd9a DN |
3559 | if (addr) |
3560 | { | |
ab532386 | 3561 | error ("incorrect sharing of tree nodes"); |
6de9cd9a DN |
3562 | debug_generic_stmt (phi); |
3563 | debug_generic_stmt (addr); | |
3564 | err |= true; | |
3565 | } | |
3566 | } | |
3567 | } | |
3568 | ||
1eaba2f2 | 3569 | for (bsi = bsi_start (bb); !bsi_end_p (bsi); ) |
6de9cd9a DN |
3570 | { |
3571 | tree stmt = bsi_stmt (bsi); | |
8de1fc1b | 3572 | |
4437b50d | 3573 | pointer_set_insert (visited_stmts, stmt); |
07beea0d AH |
3574 | err |= verify_gimple_tuples (stmt); |
3575 | ||
8de1fc1b KH |
3576 | if (bb_for_stmt (stmt) != bb) |
3577 | { | |
ab532386 | 3578 | error ("bb_for_stmt (stmt) is set to a wrong basic block"); |
8de1fc1b KH |
3579 | err |= true; |
3580 | } | |
3581 | ||
1eaba2f2 RH |
3582 | bsi_next (&bsi); |
3583 | err |= verify_stmt (stmt, bsi_end_p (bsi)); | |
4437b50d | 3584 | addr = walk_tree (&stmt, verify_node_sharing, visited, NULL); |
6de9cd9a DN |
3585 | if (addr) |
3586 | { | |
ab532386 | 3587 | error ("incorrect sharing of tree nodes"); |
6de9cd9a DN |
3588 | debug_generic_stmt (stmt); |
3589 | debug_generic_stmt (addr); | |
3590 | err |= true; | |
3591 | } | |
3592 | } | |
3593 | } | |
4437b50d JH |
3594 | eh_error_found = false; |
3595 | if (get_eh_throw_stmt_table (cfun)) | |
3596 | htab_traverse (get_eh_throw_stmt_table (cfun), | |
3597 | verify_eh_throw_stmt_node, | |
3598 | visited_stmts); | |
6de9cd9a | 3599 | |
4437b50d | 3600 | if (err | eh_error_found) |
ab532386 | 3601 | internal_error ("verify_stmts failed"); |
6de9cd9a | 3602 | |
4437b50d JH |
3603 | pointer_set_destroy (visited); |
3604 | pointer_set_destroy (visited_stmts); | |
6946b3f7 | 3605 | verify_histograms (); |
6de9cd9a DN |
3606 | timevar_pop (TV_TREE_STMT_VERIFY); |
3607 | } | |
3608 | ||
3609 | ||
3610 | /* Verifies that the flow information is OK. */ | |
3611 | ||
3612 | static int | |
3613 | tree_verify_flow_info (void) | |
3614 | { | |
3615 | int err = 0; | |
3616 | basic_block bb; | |
3617 | block_stmt_iterator bsi; | |
3618 | tree stmt; | |
3619 | edge e; | |
628f6a4e | 3620 | edge_iterator ei; |
6de9cd9a | 3621 | |
7506e1cb | 3622 | if (ENTRY_BLOCK_PTR->il.tree) |
6de9cd9a | 3623 | { |
7506e1cb | 3624 | error ("ENTRY_BLOCK has IL associated with it"); |
6de9cd9a DN |
3625 | err = 1; |
3626 | } | |
3627 | ||
7506e1cb | 3628 | if (EXIT_BLOCK_PTR->il.tree) |
6de9cd9a | 3629 | { |
7506e1cb | 3630 | error ("EXIT_BLOCK has IL associated with it"); |
6de9cd9a DN |
3631 | err = 1; |
3632 | } | |
3633 | ||
628f6a4e | 3634 | FOR_EACH_EDGE (e, ei, EXIT_BLOCK_PTR->preds) |
6de9cd9a DN |
3635 | if (e->flags & EDGE_FALLTHRU) |
3636 | { | |
ab532386 | 3637 | error ("fallthru to exit from bb %d", e->src->index); |
6de9cd9a DN |
3638 | err = 1; |
3639 | } | |
3640 | ||
3641 | FOR_EACH_BB (bb) | |
3642 | { | |
3643 | bool found_ctrl_stmt = false; | |
3644 | ||
548414c6 KH |
3645 | stmt = NULL_TREE; |
3646 | ||
6de9cd9a DN |
3647 | /* Skip labels on the start of basic block. */ |
3648 | for (bsi = bsi_start (bb); !bsi_end_p (bsi); bsi_next (&bsi)) | |
3649 | { | |
548414c6 KH |
3650 | tree prev_stmt = stmt; |
3651 | ||
3652 | stmt = bsi_stmt (bsi); | |
3653 | ||
3654 | if (TREE_CODE (stmt) != LABEL_EXPR) | |
6de9cd9a DN |
3655 | break; |
3656 | ||
548414c6 KH |
3657 | if (prev_stmt && DECL_NONLOCAL (LABEL_EXPR_LABEL (stmt))) |
3658 | { | |
953ff289 DN |
3659 | error ("nonlocal label "); |
3660 | print_generic_expr (stderr, LABEL_EXPR_LABEL (stmt), 0); | |
3661 | fprintf (stderr, " is not first in a sequence of labels in bb %d", | |
3662 | bb->index); | |
548414c6 KH |
3663 | err = 1; |
3664 | } | |
3665 | ||
3666 | if (label_to_block (LABEL_EXPR_LABEL (stmt)) != bb) | |
6de9cd9a | 3667 | { |
953ff289 DN |
3668 | error ("label "); |
3669 | print_generic_expr (stderr, LABEL_EXPR_LABEL (stmt), 0); | |
3670 | fprintf (stderr, " to block does not match in bb %d", | |
3671 | bb->index); | |
6de9cd9a DN |
3672 | err = 1; |
3673 | } | |
3674 | ||
548414c6 | 3675 | if (decl_function_context (LABEL_EXPR_LABEL (stmt)) |
6de9cd9a DN |
3676 | != current_function_decl) |
3677 | { | |
953ff289 DN |
3678 | error ("label "); |
3679 | print_generic_expr (stderr, LABEL_EXPR_LABEL (stmt), 0); | |
3680 | fprintf (stderr, " has incorrect context in bb %d", | |
3681 | bb->index); | |
6de9cd9a DN |
3682 | err = 1; |
3683 | } | |
3684 | } | |
3685 | ||
3686 | /* Verify that body of basic block BB is free of control flow. */ | |
3687 | for (; !bsi_end_p (bsi); bsi_next (&bsi)) | |
3688 | { | |
3689 | tree stmt = bsi_stmt (bsi); | |
3690 | ||
3691 | if (found_ctrl_stmt) | |
3692 | { | |
ab532386 | 3693 | error ("control flow in the middle of basic block %d", |
6de9cd9a DN |
3694 | bb->index); |
3695 | err = 1; | |
3696 | } | |
3697 | ||
3698 | if (stmt_ends_bb_p (stmt)) | |
3699 | found_ctrl_stmt = true; | |
3700 | ||
3701 | if (TREE_CODE (stmt) == LABEL_EXPR) | |
3702 | { | |
953ff289 DN |
3703 | error ("label "); |
3704 | print_generic_expr (stderr, LABEL_EXPR_LABEL (stmt), 0); | |
3705 | fprintf (stderr, " in the middle of basic block %d", bb->index); | |
6de9cd9a DN |
3706 | err = 1; |
3707 | } | |
3708 | } | |
953ff289 | 3709 | |
6de9cd9a DN |
3710 | bsi = bsi_last (bb); |
3711 | if (bsi_end_p (bsi)) | |
3712 | continue; | |
3713 | ||
3714 | stmt = bsi_stmt (bsi); | |
3715 | ||
cc7220fd JH |
3716 | err |= verify_eh_edges (stmt); |
3717 | ||
6de9cd9a DN |
3718 | if (is_ctrl_stmt (stmt)) |
3719 | { | |
628f6a4e | 3720 | FOR_EACH_EDGE (e, ei, bb->succs) |
6de9cd9a DN |
3721 | if (e->flags & EDGE_FALLTHRU) |
3722 | { | |
ab532386 | 3723 | error ("fallthru edge after a control statement in bb %d", |
6de9cd9a DN |
3724 | bb->index); |
3725 | err = 1; | |
3726 | } | |
3727 | } | |
3728 | ||
36b24193 ZD |
3729 | if (TREE_CODE (stmt) != COND_EXPR) |
3730 | { | |
3731 | /* Verify that there are no edges with EDGE_TRUE/FALSE_FLAG set | |
3732 | after anything else but if statement. */ | |
3733 | FOR_EACH_EDGE (e, ei, bb->succs) | |
3734 | if (e->flags & (EDGE_TRUE_VALUE | EDGE_FALSE_VALUE)) | |
3735 | { | |
3736 | error ("true/false edge after a non-COND_EXPR in bb %d", | |
3737 | bb->index); | |
3738 | err = 1; | |
3739 | } | |
3740 | } | |
3741 | ||
6de9cd9a DN |
3742 | switch (TREE_CODE (stmt)) |
3743 | { | |
3744 | case COND_EXPR: | |
3745 | { | |
3746 | edge true_edge; | |
3747 | edge false_edge; | |
a9b77cd1 ZD |
3748 | |
3749 | if (COND_EXPR_THEN (stmt) != NULL_TREE | |
3750 | || COND_EXPR_ELSE (stmt) != NULL_TREE) | |
6de9cd9a | 3751 | { |
a9b77cd1 ZD |
3752 | error ("COND_EXPR with code in branches at the end of bb %d", |
3753 | bb->index); | |
6de9cd9a DN |
3754 | err = 1; |
3755 | } | |
3756 | ||
3757 | extract_true_false_edges_from_block (bb, &true_edge, &false_edge); | |
3758 | ||
3759 | if (!true_edge || !false_edge | |
3760 | || !(true_edge->flags & EDGE_TRUE_VALUE) | |
3761 | || !(false_edge->flags & EDGE_FALSE_VALUE) | |
3762 | || (true_edge->flags & (EDGE_FALLTHRU | EDGE_ABNORMAL)) | |
3763 | || (false_edge->flags & (EDGE_FALLTHRU | EDGE_ABNORMAL)) | |
628f6a4e | 3764 | || EDGE_COUNT (bb->succs) >= 3) |
6de9cd9a | 3765 | { |
ab532386 | 3766 | error ("wrong outgoing edge flags at end of bb %d", |
6de9cd9a DN |
3767 | bb->index); |
3768 | err = 1; | |
3769 | } | |
6de9cd9a DN |
3770 | } |
3771 | break; | |
3772 | ||
3773 | case GOTO_EXPR: | |
3774 | if (simple_goto_p (stmt)) | |
3775 | { | |
ab532386 | 3776 | error ("explicit goto at end of bb %d", bb->index); |
6531d1be | 3777 | err = 1; |
6de9cd9a DN |
3778 | } |
3779 | else | |
3780 | { | |
6531d1be | 3781 | /* FIXME. We should double check that the labels in the |
6de9cd9a | 3782 | destination blocks have their address taken. */ |
628f6a4e | 3783 | FOR_EACH_EDGE (e, ei, bb->succs) |
6de9cd9a DN |
3784 | if ((e->flags & (EDGE_FALLTHRU | EDGE_TRUE_VALUE |
3785 | | EDGE_FALSE_VALUE)) | |
3786 | || !(e->flags & EDGE_ABNORMAL)) | |
3787 | { | |
ab532386 | 3788 | error ("wrong outgoing edge flags at end of bb %d", |
6de9cd9a DN |
3789 | bb->index); |
3790 | err = 1; | |
3791 | } | |
3792 | } | |
3793 | break; | |
3794 | ||
3795 | case RETURN_EXPR: | |
c5cbcccf ZD |
3796 | if (!single_succ_p (bb) |
3797 | || (single_succ_edge (bb)->flags | |
3798 | & (EDGE_FALLTHRU | EDGE_ABNORMAL | |
3799 | | EDGE_TRUE_VALUE | EDGE_FALSE_VALUE))) | |
6de9cd9a | 3800 | { |
ab532386 | 3801 | error ("wrong outgoing edge flags at end of bb %d", bb->index); |
6de9cd9a DN |
3802 | err = 1; |
3803 | } | |
c5cbcccf | 3804 | if (single_succ (bb) != EXIT_BLOCK_PTR) |
6de9cd9a | 3805 | { |
ab532386 | 3806 | error ("return edge does not point to exit in bb %d", |
6de9cd9a DN |
3807 | bb->index); |
3808 | err = 1; | |
3809 | } | |
3810 | break; | |
3811 | ||
3812 | case SWITCH_EXPR: | |
3813 | { | |
7853504d | 3814 | tree prev; |
6de9cd9a DN |
3815 | edge e; |
3816 | size_t i, n; | |
3817 | tree vec; | |
3818 | ||
3819 | vec = SWITCH_LABELS (stmt); | |
3820 | n = TREE_VEC_LENGTH (vec); | |
3821 | ||
3822 | /* Mark all the destination basic blocks. */ | |
3823 | for (i = 0; i < n; ++i) | |
3824 | { | |
3825 | tree lab = CASE_LABEL (TREE_VEC_ELT (vec, i)); | |
3826 | basic_block label_bb = label_to_block (lab); | |
3827 | ||
1e128c5f | 3828 | gcc_assert (!label_bb->aux || label_bb->aux == (void *)1); |
6de9cd9a DN |
3829 | label_bb->aux = (void *)1; |
3830 | } | |
3831 | ||
7853504d SB |
3832 | /* Verify that the case labels are sorted. */ |
3833 | prev = TREE_VEC_ELT (vec, 0); | |
3834 | for (i = 1; i < n - 1; ++i) | |
3835 | { | |
3836 | tree c = TREE_VEC_ELT (vec, i); | |
3837 | if (! CASE_LOW (c)) | |
3838 | { | |
ab532386 | 3839 | error ("found default case not at end of case vector"); |
7853504d SB |
3840 | err = 1; |
3841 | continue; | |
3842 | } | |
3843 | if (! tree_int_cst_lt (CASE_LOW (prev), CASE_LOW (c))) | |
3844 | { | |
953ff289 | 3845 | error ("case labels not sorted: "); |
7853504d SB |
3846 | print_generic_expr (stderr, prev, 0); |
3847 | fprintf (stderr," is greater than "); | |
3848 | print_generic_expr (stderr, c, 0); | |
3849 | fprintf (stderr," but comes before it.\n"); | |
3850 | err = 1; | |
3851 | } | |
3852 | prev = c; | |
3853 | } | |
3854 | if (CASE_LOW (TREE_VEC_ELT (vec, n - 1))) | |
3855 | { | |
ab532386 | 3856 | error ("no default case found at end of case vector"); |
7853504d SB |
3857 | err = 1; |
3858 | } | |
3859 | ||
628f6a4e | 3860 | FOR_EACH_EDGE (e, ei, bb->succs) |
6de9cd9a DN |
3861 | { |
3862 | if (!e->dest->aux) | |
3863 | { | |
ab532386 | 3864 | error ("extra outgoing edge %d->%d", |
6de9cd9a DN |
3865 | bb->index, e->dest->index); |
3866 | err = 1; | |
3867 | } | |
3868 | e->dest->aux = (void *)2; | |
3869 | if ((e->flags & (EDGE_FALLTHRU | EDGE_ABNORMAL | |
3870 | | EDGE_TRUE_VALUE | EDGE_FALSE_VALUE))) | |
3871 | { | |
ab532386 | 3872 | error ("wrong outgoing edge flags at end of bb %d", |
6de9cd9a DN |
3873 | bb->index); |
3874 | err = 1; | |
3875 | } | |
3876 | } | |
3877 | ||
3878 | /* Check that we have all of them. */ | |
3879 | for (i = 0; i < n; ++i) | |
3880 | { | |
3881 | tree lab = CASE_LABEL (TREE_VEC_ELT (vec, i)); | |
3882 | basic_block label_bb = label_to_block (lab); | |
3883 | ||
3884 | if (label_bb->aux != (void *)2) | |
3885 | { | |
ab532386 | 3886 | error ("missing edge %i->%i", |
6de9cd9a DN |
3887 | bb->index, label_bb->index); |
3888 | err = 1; | |
3889 | } | |
3890 | } | |
3891 | ||
628f6a4e | 3892 | FOR_EACH_EDGE (e, ei, bb->succs) |
6de9cd9a DN |
3893 | e->dest->aux = (void *)0; |
3894 | } | |
3895 | ||
3896 | default: ; | |
3897 | } | |
3898 | } | |
3899 | ||
2b28c07a | 3900 | if (dom_info_state (CDI_DOMINATORS) >= DOM_NO_FAST_QUERY) |
6de9cd9a DN |
3901 | verify_dominators (CDI_DOMINATORS); |
3902 | ||
3903 | return err; | |
3904 | } | |
3905 | ||
3906 | ||
f0b698c1 | 3907 | /* Updates phi nodes after creating a forwarder block joined |
6de9cd9a DN |
3908 | by edge FALLTHRU. */ |
3909 | ||
3910 | static void | |
3911 | tree_make_forwarder_block (edge fallthru) | |
3912 | { | |
3913 | edge e; | |
628f6a4e | 3914 | edge_iterator ei; |
6de9cd9a | 3915 | basic_block dummy, bb; |
5ae71719 | 3916 | tree phi, new_phi, var; |
6de9cd9a DN |
3917 | |
3918 | dummy = fallthru->src; | |
3919 | bb = fallthru->dest; | |
3920 | ||
c5cbcccf | 3921 | if (single_pred_p (bb)) |
6de9cd9a DN |
3922 | return; |
3923 | ||
cfaab3a9 | 3924 | /* If we redirected a branch we must create new PHI nodes at the |
6de9cd9a | 3925 | start of BB. */ |
17192884 | 3926 | for (phi = phi_nodes (dummy); phi; phi = PHI_CHAIN (phi)) |
6de9cd9a DN |
3927 | { |
3928 | var = PHI_RESULT (phi); | |
3929 | new_phi = create_phi_node (var, bb); | |
3930 | SSA_NAME_DEF_STMT (var) = new_phi; | |
d00ad49b | 3931 | SET_PHI_RESULT (phi, make_ssa_name (SSA_NAME_VAR (var), phi)); |
d2e398df | 3932 | add_phi_arg (new_phi, PHI_RESULT (phi), fallthru); |
6de9cd9a DN |
3933 | } |
3934 | ||
17192884 | 3935 | /* Ensure that the PHI node chain is in the same order. */ |
5ae71719 | 3936 | set_phi_nodes (bb, phi_reverse (phi_nodes (bb))); |
6de9cd9a DN |
3937 | |
3938 | /* Add the arguments we have stored on edges. */ | |
628f6a4e | 3939 | FOR_EACH_EDGE (e, ei, bb->preds) |
6de9cd9a DN |
3940 | { |
3941 | if (e == fallthru) | |
3942 | continue; | |
3943 | ||
71882046 | 3944 | flush_pending_stmts (e); |
6de9cd9a DN |
3945 | } |
3946 | } | |
3947 | ||
3948 | ||
6de9cd9a DN |
3949 | /* Return a non-special label in the head of basic block BLOCK. |
3950 | Create one if it doesn't exist. */ | |
3951 | ||
d7621d3c | 3952 | tree |
6de9cd9a DN |
3953 | tree_block_label (basic_block bb) |
3954 | { | |
3955 | block_stmt_iterator i, s = bsi_start (bb); | |
3956 | bool first = true; | |
3957 | tree label, stmt; | |
3958 | ||
3959 | for (i = s; !bsi_end_p (i); first = false, bsi_next (&i)) | |
3960 | { | |
3961 | stmt = bsi_stmt (i); | |
3962 | if (TREE_CODE (stmt) != LABEL_EXPR) | |
3963 | break; | |
3964 | label = LABEL_EXPR_LABEL (stmt); | |
3965 | if (!DECL_NONLOCAL (label)) | |
3966 | { | |
3967 | if (!first) | |
3968 | bsi_move_before (&i, &s); | |
3969 | return label; | |
3970 | } | |
3971 | } | |
3972 | ||
3973 | label = create_artificial_label (); | |
3974 | stmt = build1 (LABEL_EXPR, void_type_node, label); | |
3975 | bsi_insert_before (&s, stmt, BSI_NEW_STMT); | |
3976 | return label; | |
3977 | } | |
3978 | ||
3979 | ||
3980 | /* Attempt to perform edge redirection by replacing a possibly complex | |
3981 | jump instruction by a goto or by removing the jump completely. | |
3982 | This can apply only if all edges now point to the same block. The | |
3983 | parameters and return values are equivalent to | |
3984 | redirect_edge_and_branch. */ | |
3985 | ||
3986 | static edge | |
3987 | tree_try_redirect_by_replacing_jump (edge e, basic_block target) | |
3988 | { | |
3989 | basic_block src = e->src; | |
6de9cd9a DN |
3990 | block_stmt_iterator b; |
3991 | tree stmt; | |
6de9cd9a | 3992 | |
07b43a87 KH |
3993 | /* We can replace or remove a complex jump only when we have exactly |
3994 | two edges. */ | |
3995 | if (EDGE_COUNT (src->succs) != 2 | |
3996 | /* Verify that all targets will be TARGET. Specifically, the | |
3997 | edge that is not E must also go to TARGET. */ | |
3998 | || EDGE_SUCC (src, EDGE_SUCC (src, 0) == e)->dest != target) | |
6de9cd9a DN |
3999 | return NULL; |
4000 | ||
4001 | b = bsi_last (src); | |
4002 | if (bsi_end_p (b)) | |
4003 | return NULL; | |
4004 | stmt = bsi_stmt (b); | |
4005 | ||
4006 | if (TREE_CODE (stmt) == COND_EXPR | |
4007 | || TREE_CODE (stmt) == SWITCH_EXPR) | |
4008 | { | |
736432ee | 4009 | bsi_remove (&b, true); |
6de9cd9a DN |
4010 | e = ssa_redirect_edge (e, target); |
4011 | e->flags = EDGE_FALLTHRU; | |
4012 | return e; | |
4013 | } | |
4014 | ||
4015 | return NULL; | |
4016 | } | |
4017 | ||
4018 | ||
4019 | /* Redirect E to DEST. Return NULL on failure. Otherwise, return the | |
4020 | edge representing the redirected branch. */ | |
4021 | ||
4022 | static edge | |
4023 | tree_redirect_edge_and_branch (edge e, basic_block dest) | |
4024 | { | |
4025 | basic_block bb = e->src; | |
4026 | block_stmt_iterator bsi; | |
4027 | edge ret; | |
18965703 | 4028 | tree stmt; |
6de9cd9a | 4029 | |
4f6c2131 | 4030 | if (e->flags & EDGE_ABNORMAL) |
6de9cd9a DN |
4031 | return NULL; |
4032 | ||
6531d1be | 4033 | if (e->src != ENTRY_BLOCK_PTR |
6de9cd9a DN |
4034 | && (ret = tree_try_redirect_by_replacing_jump (e, dest))) |
4035 | return ret; | |
4036 | ||
4037 | if (e->dest == dest) | |
4038 | return NULL; | |
4039 | ||
6de9cd9a DN |
4040 | bsi = bsi_last (bb); |
4041 | stmt = bsi_end_p (bsi) ? NULL : bsi_stmt (bsi); | |
4042 | ||
4043 | switch (stmt ? TREE_CODE (stmt) : ERROR_MARK) | |
4044 | { | |
4045 | case COND_EXPR: | |
a9b77cd1 | 4046 | /* For COND_EXPR, we only need to redirect the edge. */ |
6de9cd9a DN |
4047 | break; |
4048 | ||
4049 | case GOTO_EXPR: | |
4050 | /* No non-abnormal edges should lead from a non-simple goto, and | |
4051 | simple ones should be represented implicitly. */ | |
1e128c5f | 4052 | gcc_unreachable (); |
6de9cd9a DN |
4053 | |
4054 | case SWITCH_EXPR: | |
4055 | { | |
d6be0d7f | 4056 | tree cases = get_cases_for_edge (e, stmt); |
18965703 | 4057 | tree label = tree_block_label (dest); |
6de9cd9a | 4058 | |
d6be0d7f JL |
4059 | /* If we have a list of cases associated with E, then use it |
4060 | as it's a lot faster than walking the entire case vector. */ | |
4061 | if (cases) | |
6de9cd9a | 4062 | { |
4edbbd3f | 4063 | edge e2 = find_edge (e->src, dest); |
d6be0d7f JL |
4064 | tree last, first; |
4065 | ||
4066 | first = cases; | |
4067 | while (cases) | |
4068 | { | |
4069 | last = cases; | |
4070 | CASE_LABEL (cases) = label; | |
4071 | cases = TREE_CHAIN (cases); | |
4072 | } | |
4073 | ||
4074 | /* If there was already an edge in the CFG, then we need | |
4075 | to move all the cases associated with E to E2. */ | |
4076 | if (e2) | |
4077 | { | |
4078 | tree cases2 = get_cases_for_edge (e2, stmt); | |
4079 | ||
4080 | TREE_CHAIN (last) = TREE_CHAIN (cases2); | |
4081 | TREE_CHAIN (cases2) = first; | |
4082 | } | |
6de9cd9a | 4083 | } |
92b6dff3 JL |
4084 | else |
4085 | { | |
d6be0d7f JL |
4086 | tree vec = SWITCH_LABELS (stmt); |
4087 | size_t i, n = TREE_VEC_LENGTH (vec); | |
4088 | ||
4089 | for (i = 0; i < n; i++) | |
4090 | { | |
4091 | tree elt = TREE_VEC_ELT (vec, i); | |
4092 | ||
4093 | if (label_to_block (CASE_LABEL (elt)) == e->dest) | |
4094 | CASE_LABEL (elt) = label; | |
4095 | } | |
92b6dff3 | 4096 | } |
d6be0d7f | 4097 | |
92b6dff3 | 4098 | break; |
6de9cd9a | 4099 | } |
6de9cd9a DN |
4100 | |
4101 | case RETURN_EXPR: | |
736432ee | 4102 | bsi_remove (&bsi, true); |
6de9cd9a DN |
4103 | e->flags |= EDGE_FALLTHRU; |
4104 | break; | |
4105 | ||
4106 | default: | |
4107 | /* Otherwise it must be a fallthru edge, and we don't need to | |
4108 | do anything besides redirecting it. */ | |
1e128c5f | 4109 | gcc_assert (e->flags & EDGE_FALLTHRU); |
6de9cd9a DN |
4110 | break; |
4111 | } | |
4112 | ||
4113 | /* Update/insert PHI nodes as necessary. */ | |
4114 | ||
4115 | /* Now update the edges in the CFG. */ | |
4116 | e = ssa_redirect_edge (e, dest); | |
4117 | ||
4118 | return e; | |
4119 | } | |
4120 | ||
14fa2cc0 ZD |
4121 | /* Returns true if it is possible to remove edge E by redirecting |
4122 | it to the destination of the other edge from E->src. */ | |
4123 | ||
4124 | static bool | |
4125 | tree_can_remove_branch_p (edge e) | |
4126 | { | |
4127 | if (e->flags & EDGE_ABNORMAL) | |
4128 | return false; | |
4129 | ||
4130 | return true; | |
4131 | } | |
6de9cd9a DN |
4132 | |
4133 | /* Simple wrapper, as we can always redirect fallthru edges. */ | |
4134 | ||
4135 | static basic_block | |
4136 | tree_redirect_edge_and_branch_force (edge e, basic_block dest) | |
4137 | { | |
4138 | e = tree_redirect_edge_and_branch (e, dest); | |
1e128c5f | 4139 | gcc_assert (e); |
6de9cd9a DN |
4140 | |
4141 | return NULL; | |
4142 | } | |
4143 | ||
4144 | ||
4145 | /* Splits basic block BB after statement STMT (but at least after the | |
4146 | labels). If STMT is NULL, BB is split just after the labels. */ | |
4147 | ||
4148 | static basic_block | |
4149 | tree_split_block (basic_block bb, void *stmt) | |
4150 | { | |
597ae074 JH |
4151 | block_stmt_iterator bsi; |
4152 | tree_stmt_iterator tsi_tgt; | |
7506e1cb | 4153 | tree act, list; |
6de9cd9a DN |
4154 | basic_block new_bb; |
4155 | edge e; | |
628f6a4e | 4156 | edge_iterator ei; |
6de9cd9a DN |
4157 | |
4158 | new_bb = create_empty_bb (bb); | |
4159 | ||
4160 | /* Redirect the outgoing edges. */ | |
628f6a4e BE |
4161 | new_bb->succs = bb->succs; |
4162 | bb->succs = NULL; | |
4163 | FOR_EACH_EDGE (e, ei, new_bb->succs) | |
6de9cd9a DN |
4164 | e->src = new_bb; |
4165 | ||
4166 | if (stmt && TREE_CODE ((tree) stmt) == LABEL_EXPR) | |
4167 | stmt = NULL; | |
4168 | ||
4169 | /* Move everything from BSI to the new basic block. */ | |
4170 | for (bsi = bsi_start (bb); !bsi_end_p (bsi); bsi_next (&bsi)) | |
4171 | { | |
4172 | act = bsi_stmt (bsi); | |
4173 | if (TREE_CODE (act) == LABEL_EXPR) | |
4174 | continue; | |
4175 | ||
4176 | if (!stmt) | |
4177 | break; | |
4178 | ||
4179 | if (stmt == act) | |
4180 | { | |
4181 | bsi_next (&bsi); | |
4182 | break; | |
4183 | } | |
4184 | } | |
4185 | ||
597ae074 JH |
4186 | if (bsi_end_p (bsi)) |
4187 | return new_bb; | |
4188 | ||
4189 | /* Split the statement list - avoid re-creating new containers as this | |
4190 | brings ugly quadratic memory consumption in the inliner. | |
4191 | (We are still quadratic since we need to update stmt BB pointers, | |
4192 | sadly.) */ | |
7506e1cb ZD |
4193 | list = tsi_split_statement_list_before (&bsi.tsi); |
4194 | set_bb_stmt_list (new_bb, list); | |
4195 | for (tsi_tgt = tsi_start (list); | |
597ae074 | 4196 | !tsi_end_p (tsi_tgt); tsi_next (&tsi_tgt)) |
0a4fe58f | 4197 | change_bb_for_stmt (tsi_stmt (tsi_tgt), new_bb); |
6de9cd9a DN |
4198 | |
4199 | return new_bb; | |
4200 | } | |
4201 | ||
4202 | ||
4203 | /* Moves basic block BB after block AFTER. */ | |
4204 | ||
4205 | static bool | |
4206 | tree_move_block_after (basic_block bb, basic_block after) | |
4207 | { | |
4208 | if (bb->prev_bb == after) | |
4209 | return true; | |
4210 | ||
4211 | unlink_block (bb); | |
4212 | link_block (bb, after); | |
4213 | ||
4214 | return true; | |
4215 | } | |
4216 | ||
4217 | ||
4218 | /* Return true if basic_block can be duplicated. */ | |
4219 | ||
4220 | static bool | |
4221 | tree_can_duplicate_bb_p (basic_block bb ATTRIBUTE_UNUSED) | |
4222 | { | |
4223 | return true; | |
4224 | } | |
4225 | ||
84d65814 | 4226 | |
6de9cd9a DN |
4227 | /* Create a duplicate of the basic block BB. NOTE: This does not |
4228 | preserve SSA form. */ | |
4229 | ||
4230 | static basic_block | |
4231 | tree_duplicate_bb (basic_block bb) | |
4232 | { | |
4233 | basic_block new_bb; | |
4234 | block_stmt_iterator bsi, bsi_tgt; | |
84d65814 | 4235 | tree phi; |
6de9cd9a DN |
4236 | |
4237 | new_bb = create_empty_bb (EXIT_BLOCK_PTR->prev_bb); | |
b0382c67 | 4238 | |
84d65814 DN |
4239 | /* Copy the PHI nodes. We ignore PHI node arguments here because |
4240 | the incoming edges have not been setup yet. */ | |
bb29d951 | 4241 | for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi)) |
b0382c67 | 4242 | { |
84d65814 DN |
4243 | tree copy = create_phi_node (PHI_RESULT (phi), new_bb); |
4244 | create_new_def_for (PHI_RESULT (copy), copy, PHI_RESULT_PTR (copy)); | |
b0382c67 | 4245 | } |
84d65814 DN |
4246 | |
4247 | /* Keep the chain of PHI nodes in the same order so that they can be | |
4248 | updated by ssa_redirect_edge. */ | |
5ae71719 | 4249 | set_phi_nodes (new_bb, phi_reverse (phi_nodes (new_bb))); |
b0382c67 | 4250 | |
6de9cd9a DN |
4251 | bsi_tgt = bsi_start (new_bb); |
4252 | for (bsi = bsi_start (bb); !bsi_end_p (bsi); bsi_next (&bsi)) | |
4253 | { | |
84d65814 DN |
4254 | def_operand_p def_p; |
4255 | ssa_op_iter op_iter; | |
4256 | tree stmt, copy; | |
cc7220fd | 4257 | int region; |
6de9cd9a | 4258 | |
84d65814 | 4259 | stmt = bsi_stmt (bsi); |
6de9cd9a DN |
4260 | if (TREE_CODE (stmt) == LABEL_EXPR) |
4261 | continue; | |
4262 | ||
84d65814 DN |
4263 | /* Create a new copy of STMT and duplicate STMT's virtual |
4264 | operands. */ | |
5f240ec4 | 4265 | copy = unshare_expr (stmt); |
5f240ec4 | 4266 | bsi_insert_after (&bsi_tgt, copy, BSI_NEW_STMT); |
84d65814 | 4267 | copy_virtual_operands (copy, stmt); |
cc7220fd JH |
4268 | region = lookup_stmt_eh_region (stmt); |
4269 | if (region >= 0) | |
4270 | add_stmt_to_eh_region (copy, region); | |
6946b3f7 | 4271 | gimple_duplicate_stmt_histograms (cfun, copy, cfun, stmt); |
84d65814 DN |
4272 | |
4273 | /* Create new names for all the definitions created by COPY and | |
4274 | add replacement mappings for each new name. */ | |
4275 | FOR_EACH_SSA_DEF_OPERAND (def_p, copy, op_iter, SSA_OP_ALL_DEFS) | |
4276 | create_new_def_for (DEF_FROM_PTR (def_p), copy, def_p); | |
6de9cd9a DN |
4277 | } |
4278 | ||
4279 | return new_bb; | |
4280 | } | |
4281 | ||
84d65814 | 4282 | |
42759f1e ZD |
4283 | /* Basic block BB_COPY was created by code duplication. Add phi node |
4284 | arguments for edges going out of BB_COPY. The blocks that were | |
6580ee77 | 4285 | duplicated have BB_DUPLICATED set. */ |
42759f1e ZD |
4286 | |
4287 | void | |
4288 | add_phi_args_after_copy_bb (basic_block bb_copy) | |
4289 | { | |
4290 | basic_block bb, dest; | |
4291 | edge e, e_copy; | |
628f6a4e | 4292 | edge_iterator ei; |
42759f1e | 4293 | tree phi, phi_copy, phi_next, def; |
6531d1be | 4294 | |
6580ee77 | 4295 | bb = get_bb_original (bb_copy); |
42759f1e | 4296 | |
628f6a4e | 4297 | FOR_EACH_EDGE (e_copy, ei, bb_copy->succs) |
42759f1e ZD |
4298 | { |
4299 | if (!phi_nodes (e_copy->dest)) | |
4300 | continue; | |
4301 | ||
6580ee77 JH |
4302 | if (e_copy->dest->flags & BB_DUPLICATED) |
4303 | dest = get_bb_original (e_copy->dest); | |
42759f1e ZD |
4304 | else |
4305 | dest = e_copy->dest; | |
4306 | ||
4307 | e = find_edge (bb, dest); | |
4308 | if (!e) | |
4309 | { | |
4310 | /* During loop unrolling the target of the latch edge is copied. | |
4311 | In this case we are not looking for edge to dest, but to | |
4312 | duplicated block whose original was dest. */ | |
628f6a4e | 4313 | FOR_EACH_EDGE (e, ei, bb->succs) |
6580ee77 JH |
4314 | if ((e->dest->flags & BB_DUPLICATED) |
4315 | && get_bb_original (e->dest) == dest) | |
42759f1e ZD |
4316 | break; |
4317 | ||
4318 | gcc_assert (e != NULL); | |
4319 | } | |
4320 | ||
4321 | for (phi = phi_nodes (e->dest), phi_copy = phi_nodes (e_copy->dest); | |
4322 | phi; | |
eaf0dc02 | 4323 | phi = phi_next, phi_copy = PHI_CHAIN (phi_copy)) |
42759f1e | 4324 | { |
eaf0dc02 | 4325 | phi_next = PHI_CHAIN (phi); |
42759f1e | 4326 | def = PHI_ARG_DEF_FROM_EDGE (phi, e); |
d2e398df | 4327 | add_phi_arg (phi_copy, def, e_copy); |
42759f1e ZD |
4328 | } |
4329 | } | |
4330 | } | |
4331 | ||
4332 | /* Blocks in REGION_COPY array of length N_REGION were created by | |
4333 | duplication of basic blocks. Add phi node arguments for edges | |
4334 | going from these blocks. */ | |
4335 | ||
4336 | void | |
4337 | add_phi_args_after_copy (basic_block *region_copy, unsigned n_region) | |
4338 | { | |
4339 | unsigned i; | |
4340 | ||
4341 | for (i = 0; i < n_region; i++) | |
6580ee77 | 4342 | region_copy[i]->flags |= BB_DUPLICATED; |
42759f1e ZD |
4343 | |
4344 | for (i = 0; i < n_region; i++) | |
4345 | add_phi_args_after_copy_bb (region_copy[i]); | |
4346 | ||
4347 | for (i = 0; i < n_region; i++) | |
6580ee77 | 4348 | region_copy[i]->flags &= ~BB_DUPLICATED; |
42759f1e ZD |
4349 | } |
4350 | ||
42759f1e ZD |
4351 | /* Duplicates a REGION (set of N_REGION basic blocks) with just a single |
4352 | important exit edge EXIT. By important we mean that no SSA name defined | |
4353 | inside region is live over the other exit edges of the region. All entry | |
4354 | edges to the region must go to ENTRY->dest. The edge ENTRY is redirected | |
4355 | to the duplicate of the region. SSA form, dominance and loop information | |
4356 | is updated. The new basic blocks are stored to REGION_COPY in the same | |
4357 | order as they had in REGION, provided that REGION_COPY is not NULL. | |
4358 | The function returns false if it is unable to copy the region, | |
4359 | true otherwise. */ | |
4360 | ||
4361 | bool | |
4362 | tree_duplicate_sese_region (edge entry, edge exit, | |
4363 | basic_block *region, unsigned n_region, | |
4364 | basic_block *region_copy) | |
4365 | { | |
66f97d31 | 4366 | unsigned i; |
42759f1e ZD |
4367 | bool free_region_copy = false, copying_header = false; |
4368 | struct loop *loop = entry->dest->loop_father; | |
4369 | edge exit_copy; | |
66f97d31 | 4370 | VEC (basic_block, heap) *doms; |
42759f1e | 4371 | edge redirected; |
09bac500 JH |
4372 | int total_freq = 0, entry_freq = 0; |
4373 | gcov_type total_count = 0, entry_count = 0; | |
42759f1e ZD |
4374 | |
4375 | if (!can_copy_bbs_p (region, n_region)) | |
4376 | return false; | |
4377 | ||
4378 | /* Some sanity checking. Note that we do not check for all possible | |
4379 | missuses of the functions. I.e. if you ask to copy something weird, | |
4380 | it will work, but the state of structures probably will not be | |
4381 | correct. */ | |
42759f1e ZD |
4382 | for (i = 0; i < n_region; i++) |
4383 | { | |
4384 | /* We do not handle subloops, i.e. all the blocks must belong to the | |
4385 | same loop. */ | |
4386 | if (region[i]->loop_father != loop) | |
4387 | return false; | |
4388 | ||
4389 | if (region[i] != entry->dest | |
4390 | && region[i] == loop->header) | |
4391 | return false; | |
4392 | } | |
4393 | ||
561e8a90 | 4394 | set_loop_copy (loop, loop); |
42759f1e ZD |
4395 | |
4396 | /* In case the function is used for loop header copying (which is the primary | |
4397 | use), ensure that EXIT and its copy will be new latch and entry edges. */ | |
4398 | if (loop->header == entry->dest) | |
4399 | { | |
4400 | copying_header = true; | |
561e8a90 | 4401 | set_loop_copy (loop, loop_outer (loop)); |
42759f1e ZD |
4402 | |
4403 | if (!dominated_by_p (CDI_DOMINATORS, loop->latch, exit->src)) | |
4404 | return false; | |
4405 | ||
4406 | for (i = 0; i < n_region; i++) | |
4407 | if (region[i] != exit->src | |
4408 | && dominated_by_p (CDI_DOMINATORS, region[i], exit->src)) | |
4409 | return false; | |
4410 | } | |
4411 | ||
4412 | if (!region_copy) | |
4413 | { | |
858904db | 4414 | region_copy = XNEWVEC (basic_block, n_region); |
42759f1e ZD |
4415 | free_region_copy = true; |
4416 | } | |
4417 | ||
84d65814 | 4418 | gcc_assert (!need_ssa_update_p ()); |
42759f1e | 4419 | |
5deaef19 | 4420 | /* Record blocks outside the region that are dominated by something |
42759f1e | 4421 | inside. */ |
66f97d31 | 4422 | doms = NULL; |
6580ee77 JH |
4423 | initialize_original_copy_tables (); |
4424 | ||
66f97d31 | 4425 | doms = get_dominated_by_region (CDI_DOMINATORS, region, n_region); |
42759f1e | 4426 | |
09bac500 JH |
4427 | if (entry->dest->count) |
4428 | { | |
4429 | total_count = entry->dest->count; | |
4430 | entry_count = entry->count; | |
4431 | /* Fix up corner cases, to avoid division by zero or creation of negative | |
4432 | frequencies. */ | |
4433 | if (entry_count > total_count) | |
4434 | entry_count = total_count; | |
4435 | } | |
4436 | else | |
4437 | { | |
4438 | total_freq = entry->dest->frequency; | |
4439 | entry_freq = EDGE_FREQUENCY (entry); | |
4440 | /* Fix up corner cases, to avoid division by zero or creation of negative | |
4441 | frequencies. */ | |
4442 | if (total_freq == 0) | |
4443 | total_freq = 1; | |
4444 | else if (entry_freq > total_freq) | |
4445 | entry_freq = total_freq; | |
4446 | } | |
5deaef19 | 4447 | |
b9a66240 ZD |
4448 | copy_bbs (region, n_region, region_copy, &exit, 1, &exit_copy, loop, |
4449 | split_edge_bb_loc (entry)); | |
09bac500 JH |
4450 | if (total_count) |
4451 | { | |
4452 | scale_bbs_frequencies_gcov_type (region, n_region, | |
4453 | total_count - entry_count, | |
4454 | total_count); | |
4455 | scale_bbs_frequencies_gcov_type (region_copy, n_region, entry_count, | |
6531d1be | 4456 | total_count); |
09bac500 JH |
4457 | } |
4458 | else | |
4459 | { | |
4460 | scale_bbs_frequencies_int (region, n_region, total_freq - entry_freq, | |
4461 | total_freq); | |
4462 | scale_bbs_frequencies_int (region_copy, n_region, entry_freq, total_freq); | |
4463 | } | |
42759f1e ZD |
4464 | |
4465 | if (copying_header) | |
4466 | { | |
4467 | loop->header = exit->dest; | |
4468 | loop->latch = exit->src; | |
4469 | } | |
4470 | ||
4471 | /* Redirect the entry and add the phi node arguments. */ | |
6580ee77 | 4472 | redirected = redirect_edge_and_branch (entry, get_bb_copy (entry->dest)); |
42759f1e | 4473 | gcc_assert (redirected != NULL); |
71882046 | 4474 | flush_pending_stmts (entry); |
42759f1e ZD |
4475 | |
4476 | /* Concerning updating of dominators: We must recount dominators | |
84d65814 DN |
4477 | for entry block and its copy. Anything that is outside of the |
4478 | region, but was dominated by something inside needs recounting as | |
4479 | well. */ | |
42759f1e | 4480 | set_immediate_dominator (CDI_DOMINATORS, entry->dest, entry->src); |
66f97d31 ZD |
4481 | VEC_safe_push (basic_block, heap, doms, get_bb_original (entry->dest)); |
4482 | iterate_fix_dominators (CDI_DOMINATORS, doms, false); | |
42759f1e ZD |
4483 | free (doms); |
4484 | ||
84d65814 | 4485 | /* Add the other PHI node arguments. */ |
42759f1e ZD |
4486 | add_phi_args_after_copy (region_copy, n_region); |
4487 | ||
84d65814 DN |
4488 | /* Update the SSA web. */ |
4489 | update_ssa (TODO_update_ssa); | |
42759f1e ZD |
4490 | |
4491 | if (free_region_copy) | |
4492 | free (region_copy); | |
4493 | ||
6580ee77 | 4494 | free_original_copy_tables (); |
42759f1e ZD |
4495 | return true; |
4496 | } | |
6de9cd9a | 4497 | |
50674e96 DN |
4498 | /* |
4499 | DEF_VEC_P(basic_block); | |
4500 | DEF_VEC_ALLOC_P(basic_block,heap); | |
4501 | */ | |
4502 | ||
4503 | /* Add all the blocks dominated by ENTRY to the array BBS_P. Stop | |
4504 | adding blocks when the dominator traversal reaches EXIT. This | |
4505 | function silently assumes that ENTRY strictly dominates EXIT. */ | |
4506 | ||
4507 | static void | |
4508 | gather_blocks_in_sese_region (basic_block entry, basic_block exit, | |
4509 | VEC(basic_block,heap) **bbs_p) | |
4510 | { | |
4511 | basic_block son; | |
4512 | ||
4513 | for (son = first_dom_son (CDI_DOMINATORS, entry); | |
4514 | son; | |
4515 | son = next_dom_son (CDI_DOMINATORS, son)) | |
4516 | { | |
4517 | VEC_safe_push (basic_block, heap, *bbs_p, son); | |
4518 | if (son != exit) | |
4519 | gather_blocks_in_sese_region (son, exit, bbs_p); | |
4520 | } | |
4521 | } | |
4522 | ||
4523 | ||
4524 | struct move_stmt_d | |
4525 | { | |
4526 | tree block; | |
4527 | tree from_context; | |
4528 | tree to_context; | |
4529 | bitmap vars_to_remove; | |
fad41cd7 | 4530 | htab_t new_label_map; |
50674e96 DN |
4531 | bool remap_decls_p; |
4532 | }; | |
4533 | ||
4534 | /* Helper for move_block_to_fn. Set TREE_BLOCK in every expression | |
4535 | contained in *TP and change the DECL_CONTEXT of every local | |
4536 | variable referenced in *TP. */ | |
4537 | ||
4538 | static tree | |
fad41cd7 | 4539 | move_stmt_r (tree *tp, int *walk_subtrees, void *data) |
50674e96 DN |
4540 | { |
4541 | struct move_stmt_d *p = (struct move_stmt_d *) data; | |
fad41cd7 | 4542 | tree t = *tp; |
50674e96 | 4543 | |
07beea0d AH |
4544 | if (p->block |
4545 | && (EXPR_P (t) || GIMPLE_STMT_P (t))) | |
fad41cd7 | 4546 | TREE_BLOCK (t) = p->block; |
50674e96 | 4547 | |
bed575d5 RS |
4548 | if (OMP_DIRECTIVE_P (t) |
4549 | && TREE_CODE (t) != OMP_RETURN | |
4550 | && TREE_CODE (t) != OMP_CONTINUE) | |
50674e96 DN |
4551 | { |
4552 | /* Do not remap variables inside OMP directives. Variables | |
4553 | referenced in clauses and directive header belong to the | |
4554 | parent function and should not be moved into the child | |
4555 | function. */ | |
fad41cd7 | 4556 | bool save_remap_decls_p = p->remap_decls_p; |
50674e96 | 4557 | p->remap_decls_p = false; |
fad41cd7 RH |
4558 | *walk_subtrees = 0; |
4559 | ||
4560 | walk_tree (&OMP_BODY (t), move_stmt_r, p, NULL); | |
50674e96 | 4561 | |
fad41cd7 RH |
4562 | p->remap_decls_p = save_remap_decls_p; |
4563 | } | |
4564 | else if (DECL_P (t) && DECL_CONTEXT (t) == p->from_context) | |
50674e96 | 4565 | { |
fad41cd7 RH |
4566 | if (TREE_CODE (t) == LABEL_DECL) |
4567 | { | |
4568 | if (p->new_label_map) | |
4569 | { | |
4570 | struct tree_map in, *out; | |
fc8600f9 | 4571 | in.base.from = t; |
fad41cd7 RH |
4572 | out = htab_find_with_hash (p->new_label_map, &in, DECL_UID (t)); |
4573 | if (out) | |
4574 | *tp = t = out->to; | |
4575 | } | |
50674e96 | 4576 | |
fad41cd7 RH |
4577 | DECL_CONTEXT (t) = p->to_context; |
4578 | } | |
4579 | else if (p->remap_decls_p) | |
50674e96 | 4580 | { |
fad41cd7 | 4581 | DECL_CONTEXT (t) = p->to_context; |
50674e96 | 4582 | |
fad41cd7 RH |
4583 | if (TREE_CODE (t) == VAR_DECL) |
4584 | { | |
4585 | struct function *f = DECL_STRUCT_FUNCTION (p->to_context); | |
4586 | f->unexpanded_var_list | |
4587 | = tree_cons (0, t, f->unexpanded_var_list); | |
4588 | ||
4589 | /* Mark T to be removed from the original function, | |
4590 | otherwise it will be given a DECL_RTL when the | |
4591 | original function is expanded. */ | |
4592 | bitmap_set_bit (p->vars_to_remove, DECL_UID (t)); | |
4593 | } | |
50674e96 DN |
4594 | } |
4595 | } | |
fad41cd7 RH |
4596 | else if (TYPE_P (t)) |
4597 | *walk_subtrees = 0; | |
50674e96 DN |
4598 | |
4599 | return NULL_TREE; | |
4600 | } | |
4601 | ||
4602 | ||
4603 | /* Move basic block BB from function CFUN to function DEST_FN. The | |
4604 | block is moved out of the original linked list and placed after | |
4605 | block AFTER in the new list. Also, the block is removed from the | |
4606 | original array of blocks and placed in DEST_FN's array of blocks. | |
4607 | If UPDATE_EDGE_COUNT_P is true, the edge counts on both CFGs is | |
4608 | updated to reflect the moved edges. | |
6531d1be | 4609 | |
50674e96 DN |
4610 | On exit, local variables that need to be removed from |
4611 | CFUN->UNEXPANDED_VAR_LIST will have been added to VARS_TO_REMOVE. */ | |
4612 | ||
4613 | static void | |
4614 | move_block_to_fn (struct function *dest_cfun, basic_block bb, | |
4615 | basic_block after, bool update_edge_count_p, | |
fad41cd7 | 4616 | bitmap vars_to_remove, htab_t new_label_map, int eh_offset) |
50674e96 DN |
4617 | { |
4618 | struct control_flow_graph *cfg; | |
4619 | edge_iterator ei; | |
4620 | edge e; | |
4621 | block_stmt_iterator si; | |
4622 | struct move_stmt_d d; | |
728b26bb | 4623 | unsigned old_len, new_len; |
50674e96 | 4624 | |
3722506a ZD |
4625 | /* Remove BB from dominance structures. */ |
4626 | delete_from_dominance_info (CDI_DOMINATORS, bb); | |
4627 | ||
50674e96 DN |
4628 | /* Link BB to the new linked list. */ |
4629 | move_block_after (bb, after); | |
4630 | ||
4631 | /* Update the edge count in the corresponding flowgraphs. */ | |
4632 | if (update_edge_count_p) | |
4633 | FOR_EACH_EDGE (e, ei, bb->succs) | |
4634 | { | |
4635 | cfun->cfg->x_n_edges--; | |
4636 | dest_cfun->cfg->x_n_edges++; | |
4637 | } | |
4638 | ||
4639 | /* Remove BB from the original basic block array. */ | |
4640 | VEC_replace (basic_block, cfun->cfg->x_basic_block_info, bb->index, NULL); | |
4641 | cfun->cfg->x_n_basic_blocks--; | |
4642 | ||
4643 | /* Grow DEST_CFUN's basic block array if needed. */ | |
4644 | cfg = dest_cfun->cfg; | |
4645 | cfg->x_n_basic_blocks++; | |
3722506a ZD |
4646 | if (bb->index >= cfg->x_last_basic_block) |
4647 | cfg->x_last_basic_block = bb->index + 1; | |
50674e96 | 4648 | |
728b26bb DN |
4649 | old_len = VEC_length (basic_block, cfg->x_basic_block_info); |
4650 | if ((unsigned) cfg->x_last_basic_block >= old_len) | |
50674e96 | 4651 | { |
728b26bb | 4652 | new_len = cfg->x_last_basic_block + (cfg->x_last_basic_block + 3) / 4; |
a590ac65 KH |
4653 | VEC_safe_grow_cleared (basic_block, gc, cfg->x_basic_block_info, |
4654 | new_len); | |
50674e96 DN |
4655 | } |
4656 | ||
4657 | VEC_replace (basic_block, cfg->x_basic_block_info, | |
e0310afb | 4658 | bb->index, bb); |
50674e96 DN |
4659 | |
4660 | /* The statements in BB need to be associated with a new TREE_BLOCK. | |
4661 | Labels need to be associated with a new label-to-block map. */ | |
4662 | memset (&d, 0, sizeof (d)); | |
4663 | d.vars_to_remove = vars_to_remove; | |
4664 | ||
4665 | for (si = bsi_start (bb); !bsi_end_p (si); bsi_next (&si)) | |
4666 | { | |
4667 | tree stmt = bsi_stmt (si); | |
fad41cd7 | 4668 | int region; |
50674e96 DN |
4669 | |
4670 | d.from_context = cfun->decl; | |
4671 | d.to_context = dest_cfun->decl; | |
4672 | d.remap_decls_p = true; | |
fad41cd7 | 4673 | d.new_label_map = new_label_map; |
50674e96 DN |
4674 | if (TREE_BLOCK (stmt)) |
4675 | d.block = DECL_INITIAL (dest_cfun->decl); | |
4676 | ||
4677 | walk_tree (&stmt, move_stmt_r, &d, NULL); | |
4678 | ||
4679 | if (TREE_CODE (stmt) == LABEL_EXPR) | |
4680 | { | |
50674e96 DN |
4681 | tree label = LABEL_EXPR_LABEL (stmt); |
4682 | int uid = LABEL_DECL_UID (label); | |
4683 | ||
4684 | gcc_assert (uid > -1); | |
4685 | ||
4686 | old_len = VEC_length (basic_block, cfg->x_label_to_block_map); | |
4687 | if (old_len <= (unsigned) uid) | |
4688 | { | |
728b26bb | 4689 | new_len = 3 * uid / 2; |
a590ac65 KH |
4690 | VEC_safe_grow_cleared (basic_block, gc, |
4691 | cfg->x_label_to_block_map, new_len); | |
50674e96 DN |
4692 | } |
4693 | ||
4694 | VEC_replace (basic_block, cfg->x_label_to_block_map, uid, bb); | |
4695 | VEC_replace (basic_block, cfun->cfg->x_label_to_block_map, uid, NULL); | |
4696 | ||
4697 | gcc_assert (DECL_CONTEXT (label) == dest_cfun->decl); | |
4698 | ||
4699 | if (uid >= dest_cfun->last_label_uid) | |
4700 | dest_cfun->last_label_uid = uid + 1; | |
4701 | } | |
fad41cd7 RH |
4702 | else if (TREE_CODE (stmt) == RESX_EXPR && eh_offset != 0) |
4703 | TREE_OPERAND (stmt, 0) = | |
4704 | build_int_cst (NULL_TREE, | |
4705 | TREE_INT_CST_LOW (TREE_OPERAND (stmt, 0)) | |
4706 | + eh_offset); | |
4707 | ||
4708 | region = lookup_stmt_eh_region (stmt); | |
4709 | if (region >= 0) | |
4710 | { | |
4711 | add_stmt_to_eh_region_fn (dest_cfun, stmt, region + eh_offset); | |
4712 | remove_stmt_from_eh_region (stmt); | |
6946b3f7 JH |
4713 | gimple_duplicate_stmt_histograms (dest_cfun, stmt, cfun, stmt); |
4714 | gimple_remove_stmt_histograms (cfun, stmt); | |
fad41cd7 RH |
4715 | } |
4716 | } | |
4717 | } | |
4718 | ||
4719 | /* Examine the statements in BB (which is in SRC_CFUN); find and return | |
4720 | the outermost EH region. Use REGION as the incoming base EH region. */ | |
4721 | ||
4722 | static int | |
4723 | find_outermost_region_in_block (struct function *src_cfun, | |
4724 | basic_block bb, int region) | |
4725 | { | |
4726 | block_stmt_iterator si; | |
6531d1be | 4727 | |
fad41cd7 RH |
4728 | for (si = bsi_start (bb); !bsi_end_p (si); bsi_next (&si)) |
4729 | { | |
4730 | tree stmt = bsi_stmt (si); | |
4731 | int stmt_region; | |
1799e5d5 | 4732 | |
07ed51c9 JJ |
4733 | if (TREE_CODE (stmt) == RESX_EXPR) |
4734 | stmt_region = TREE_INT_CST_LOW (TREE_OPERAND (stmt, 0)); | |
4735 | else | |
4736 | stmt_region = lookup_stmt_eh_region_fn (src_cfun, stmt); | |
7e2df4a1 JJ |
4737 | if (stmt_region > 0) |
4738 | { | |
4739 | if (region < 0) | |
4740 | region = stmt_region; | |
4741 | else if (stmt_region != region) | |
4742 | { | |
4743 | region = eh_region_outermost (src_cfun, stmt_region, region); | |
4744 | gcc_assert (region != -1); | |
4745 | } | |
4746 | } | |
50674e96 | 4747 | } |
fad41cd7 RH |
4748 | |
4749 | return region; | |
50674e96 DN |
4750 | } |
4751 | ||
fad41cd7 RH |
4752 | static tree |
4753 | new_label_mapper (tree decl, void *data) | |
4754 | { | |
4755 | htab_t hash = (htab_t) data; | |
4756 | struct tree_map *m; | |
4757 | void **slot; | |
4758 | ||
4759 | gcc_assert (TREE_CODE (decl) == LABEL_DECL); | |
4760 | ||
4761 | m = xmalloc (sizeof (struct tree_map)); | |
4762 | m->hash = DECL_UID (decl); | |
fc8600f9 | 4763 | m->base.from = decl; |
fad41cd7 RH |
4764 | m->to = create_artificial_label (); |
4765 | LABEL_DECL_UID (m->to) = LABEL_DECL_UID (decl); | |
4766 | ||
4767 | slot = htab_find_slot_with_hash (hash, m, m->hash, INSERT); | |
4768 | gcc_assert (*slot == NULL); | |
4769 | ||
4770 | *slot = m; | |
4771 | ||
4772 | return m->to; | |
4773 | } | |
50674e96 DN |
4774 | |
4775 | /* Move a single-entry, single-exit region delimited by ENTRY_BB and | |
4776 | EXIT_BB to function DEST_CFUN. The whole region is replaced by a | |
4777 | single basic block in the original CFG and the new basic block is | |
4778 | returned. DEST_CFUN must not have a CFG yet. | |
4779 | ||
4780 | Note that the region need not be a pure SESE region. Blocks inside | |
4781 | the region may contain calls to abort/exit. The only restriction | |
4782 | is that ENTRY_BB should be the only entry point and it must | |
4783 | dominate EXIT_BB. | |
4784 | ||
4785 | All local variables referenced in the region are assumed to be in | |
4786 | the corresponding BLOCK_VARS and unexpanded variable lists | |
4787 | associated with DEST_CFUN. */ | |
4788 | ||
4789 | basic_block | |
4790 | move_sese_region_to_fn (struct function *dest_cfun, basic_block entry_bb, | |
4791 | basic_block exit_bb) | |
4792 | { | |
4793 | VEC(basic_block,heap) *bbs; | |
4794 | basic_block after, bb, *entry_pred, *exit_succ; | |
4795 | struct function *saved_cfun; | |
fad41cd7 | 4796 | int *entry_flag, *exit_flag, eh_offset; |
50674e96 DN |
4797 | unsigned i, num_entry_edges, num_exit_edges; |
4798 | edge e; | |
4799 | edge_iterator ei; | |
4800 | bitmap vars_to_remove; | |
fad41cd7 | 4801 | htab_t new_label_map; |
50674e96 DN |
4802 | |
4803 | saved_cfun = cfun; | |
4804 | ||
4805 | /* Collect all the blocks in the region. Manually add ENTRY_BB | |
4806 | because it won't be added by dfs_enumerate_from. */ | |
4807 | calculate_dominance_info (CDI_DOMINATORS); | |
4808 | ||
4809 | /* If ENTRY does not strictly dominate EXIT, this cannot be an SESE | |
4810 | region. */ | |
4811 | gcc_assert (entry_bb != exit_bb | |
2aee3e57 JJ |
4812 | && (!exit_bb |
4813 | || dominated_by_p (CDI_DOMINATORS, exit_bb, entry_bb))); | |
50674e96 DN |
4814 | |
4815 | bbs = NULL; | |
4816 | VEC_safe_push (basic_block, heap, bbs, entry_bb); | |
4817 | gather_blocks_in_sese_region (entry_bb, exit_bb, &bbs); | |
4818 | ||
4819 | /* Detach ENTRY_BB and EXIT_BB from CFUN->CFG. We need to remember | |
4820 | the predecessor edges to ENTRY_BB and the successor edges to | |
4821 | EXIT_BB so that we can re-attach them to the new basic block that | |
4822 | will replace the region. */ | |
4823 | num_entry_edges = EDGE_COUNT (entry_bb->preds); | |
4824 | entry_pred = (basic_block *) xcalloc (num_entry_edges, sizeof (basic_block)); | |
4825 | entry_flag = (int *) xcalloc (num_entry_edges, sizeof (int)); | |
4826 | i = 0; | |
4827 | for (ei = ei_start (entry_bb->preds); (e = ei_safe_edge (ei)) != NULL;) | |
4828 | { | |
4829 | entry_flag[i] = e->flags; | |
4830 | entry_pred[i++] = e->src; | |
4831 | remove_edge (e); | |
4832 | } | |
4833 | ||
2aee3e57 | 4834 | if (exit_bb) |
50674e96 | 4835 | { |
2aee3e57 JJ |
4836 | num_exit_edges = EDGE_COUNT (exit_bb->succs); |
4837 | exit_succ = (basic_block *) xcalloc (num_exit_edges, | |
4838 | sizeof (basic_block)); | |
4839 | exit_flag = (int *) xcalloc (num_exit_edges, sizeof (int)); | |
4840 | i = 0; | |
4841 | for (ei = ei_start (exit_bb->succs); (e = ei_safe_edge (ei)) != NULL;) | |
4842 | { | |
4843 | exit_flag[i] = e->flags; | |
4844 | exit_succ[i++] = e->dest; | |
4845 | remove_edge (e); | |
4846 | } | |
4847 | } | |
4848 | else | |
4849 | { | |
4850 | num_exit_edges = 0; | |
4851 | exit_succ = NULL; | |
4852 | exit_flag = NULL; | |
50674e96 DN |
4853 | } |
4854 | ||
4855 | /* Switch context to the child function to initialize DEST_FN's CFG. */ | |
4856 | gcc_assert (dest_cfun->cfg == NULL); | |
4857 | cfun = dest_cfun; | |
fad41cd7 | 4858 | |
50674e96 | 4859 | init_empty_tree_cfg (); |
fad41cd7 RH |
4860 | |
4861 | /* Initialize EH information for the new function. */ | |
4862 | eh_offset = 0; | |
4863 | new_label_map = NULL; | |
4864 | if (saved_cfun->eh) | |
4865 | { | |
4866 | int region = -1; | |
4867 | ||
4868 | for (i = 0; VEC_iterate (basic_block, bbs, i, bb); i++) | |
4869 | region = find_outermost_region_in_block (saved_cfun, bb, region); | |
4870 | ||
4871 | init_eh_for_function (); | |
4872 | if (region != -1) | |
4873 | { | |
4874 | new_label_map = htab_create (17, tree_map_hash, tree_map_eq, free); | |
4875 | eh_offset = duplicate_eh_regions (saved_cfun, new_label_mapper, | |
4876 | new_label_map, region, 0); | |
4877 | } | |
4878 | } | |
4879 | ||
50674e96 DN |
4880 | cfun = saved_cfun; |
4881 | ||
4882 | /* Move blocks from BBS into DEST_CFUN. */ | |
4883 | gcc_assert (VEC_length (basic_block, bbs) >= 2); | |
4884 | after = dest_cfun->cfg->x_entry_block_ptr; | |
4885 | vars_to_remove = BITMAP_ALLOC (NULL); | |
4886 | for (i = 0; VEC_iterate (basic_block, bbs, i, bb); i++) | |
4887 | { | |
4888 | /* No need to update edge counts on the last block. It has | |
4889 | already been updated earlier when we detached the region from | |
4890 | the original CFG. */ | |
fad41cd7 RH |
4891 | move_block_to_fn (dest_cfun, bb, after, bb != exit_bb, vars_to_remove, |
4892 | new_label_map, eh_offset); | |
50674e96 DN |
4893 | after = bb; |
4894 | } | |
4895 | ||
fad41cd7 RH |
4896 | if (new_label_map) |
4897 | htab_delete (new_label_map); | |
4898 | ||
50674e96 DN |
4899 | /* Remove the variables marked in VARS_TO_REMOVE from |
4900 | CFUN->UNEXPANDED_VAR_LIST. Otherwise, they will be given a | |
4901 | DECL_RTL in the context of CFUN. */ | |
4902 | if (!bitmap_empty_p (vars_to_remove)) | |
4903 | { | |
4904 | tree *p; | |
4905 | ||
4906 | for (p = &cfun->unexpanded_var_list; *p; ) | |
4907 | { | |
4908 | tree var = TREE_VALUE (*p); | |
4909 | if (bitmap_bit_p (vars_to_remove, DECL_UID (var))) | |
4910 | { | |
4911 | *p = TREE_CHAIN (*p); | |
4912 | continue; | |
4913 | } | |
4914 | ||
4915 | p = &TREE_CHAIN (*p); | |
4916 | } | |
4917 | } | |
4918 | ||
4919 | BITMAP_FREE (vars_to_remove); | |
4920 | ||
4921 | /* Rewire the entry and exit blocks. The successor to the entry | |
4922 | block turns into the successor of DEST_FN's ENTRY_BLOCK_PTR in | |
4923 | the child function. Similarly, the predecessor of DEST_FN's | |
4924 | EXIT_BLOCK_PTR turns into the predecessor of EXIT_BLOCK_PTR. We | |
4925 | need to switch CFUN between DEST_CFUN and SAVED_CFUN so that the | |
4926 | various CFG manipulation function get to the right CFG. | |
4927 | ||
4928 | FIXME, this is silly. The CFG ought to become a parameter to | |
4929 | these helpers. */ | |
4930 | cfun = dest_cfun; | |
4931 | make_edge (ENTRY_BLOCK_PTR, entry_bb, EDGE_FALLTHRU); | |
2aee3e57 JJ |
4932 | if (exit_bb) |
4933 | make_edge (exit_bb, EXIT_BLOCK_PTR, 0); | |
50674e96 DN |
4934 | cfun = saved_cfun; |
4935 | ||
4936 | /* Back in the original function, the SESE region has disappeared, | |
4937 | create a new basic block in its place. */ | |
4938 | bb = create_empty_bb (entry_pred[0]); | |
4939 | for (i = 0; i < num_entry_edges; i++) | |
4940 | make_edge (entry_pred[i], bb, entry_flag[i]); | |
4941 | ||
4942 | for (i = 0; i < num_exit_edges; i++) | |
4943 | make_edge (bb, exit_succ[i], exit_flag[i]); | |
4944 | ||
2aee3e57 JJ |
4945 | if (exit_bb) |
4946 | { | |
4947 | free (exit_flag); | |
4948 | free (exit_succ); | |
4949 | } | |
50674e96 DN |
4950 | free (entry_flag); |
4951 | free (entry_pred); | |
50674e96 DN |
4952 | free_dominance_info (CDI_DOMINATORS); |
4953 | free_dominance_info (CDI_POST_DOMINATORS); | |
4954 | VEC_free (basic_block, heap, bbs); | |
4955 | ||
4956 | return bb; | |
4957 | } | |
4958 | ||
84d65814 | 4959 | |
6de9cd9a DN |
4960 | /* Dump FUNCTION_DECL FN to file FILE using FLAGS (see TDF_* in tree.h) */ |
4961 | ||
4962 | void | |
4963 | dump_function_to_file (tree fn, FILE *file, int flags) | |
4964 | { | |
4965 | tree arg, vars, var; | |
459ffad3 | 4966 | struct function *dsf; |
6de9cd9a DN |
4967 | bool ignore_topmost_bind = false, any_var = false; |
4968 | basic_block bb; | |
4969 | tree chain; | |
953ff289 | 4970 | struct function *saved_cfun; |
6531d1be | 4971 | |
673fda6b | 4972 | fprintf (file, "%s (", lang_hooks.decl_printable_name (fn, 2)); |
6de9cd9a DN |
4973 | |
4974 | arg = DECL_ARGUMENTS (fn); | |
4975 | while (arg) | |
4976 | { | |
4977 | print_generic_expr (file, arg, dump_flags); | |
4978 | if (TREE_CHAIN (arg)) | |
4979 | fprintf (file, ", "); | |
4980 | arg = TREE_CHAIN (arg); | |
4981 | } | |
4982 | fprintf (file, ")\n"); | |
4983 | ||
459ffad3 EB |
4984 | dsf = DECL_STRUCT_FUNCTION (fn); |
4985 | if (dsf && (flags & TDF_DETAILS)) | |
4986 | dump_eh_tree (file, dsf); | |
4987 | ||
6de9cd9a DN |
4988 | if (flags & TDF_RAW) |
4989 | { | |
4990 | dump_node (fn, TDF_SLIM | flags, file); | |
4991 | return; | |
4992 | } | |
4993 | ||
953ff289 DN |
4994 | /* Switch CFUN to point to FN. */ |
4995 | saved_cfun = cfun; | |
4996 | cfun = DECL_STRUCT_FUNCTION (fn); | |
4997 | ||
6de9cd9a DN |
4998 | /* When GIMPLE is lowered, the variables are no longer available in |
4999 | BIND_EXPRs, so display them separately. */ | |
32a87d45 | 5000 | if (cfun && cfun->decl == fn && cfun->unexpanded_var_list) |
6de9cd9a DN |
5001 | { |
5002 | ignore_topmost_bind = true; | |
5003 | ||
5004 | fprintf (file, "{\n"); | |
5005 | for (vars = cfun->unexpanded_var_list; vars; vars = TREE_CHAIN (vars)) | |
5006 | { | |
5007 | var = TREE_VALUE (vars); | |
5008 | ||
5009 | print_generic_decl (file, var, flags); | |
5010 | fprintf (file, "\n"); | |
5011 | ||
5012 | any_var = true; | |
5013 | } | |
5014 | } | |
5015 | ||
32a87d45 | 5016 | if (cfun && cfun->decl == fn && cfun->cfg && basic_block_info) |
6de9cd9a DN |
5017 | { |
5018 | /* Make a CFG based dump. */ | |
878f99d2 | 5019 | check_bb_profile (ENTRY_BLOCK_PTR, file); |
6de9cd9a DN |
5020 | if (!ignore_topmost_bind) |
5021 | fprintf (file, "{\n"); | |
5022 | ||
5023 | if (any_var && n_basic_blocks) | |
5024 | fprintf (file, "\n"); | |
5025 | ||
5026 | FOR_EACH_BB (bb) | |
5027 | dump_generic_bb (file, bb, 2, flags); | |
6531d1be | 5028 | |
6de9cd9a | 5029 | fprintf (file, "}\n"); |
878f99d2 | 5030 | check_bb_profile (EXIT_BLOCK_PTR, file); |
6de9cd9a DN |
5031 | } |
5032 | else | |
5033 | { | |
5034 | int indent; | |
5035 | ||
5036 | /* Make a tree based dump. */ | |
5037 | chain = DECL_SAVED_TREE (fn); | |
5038 | ||
953ff289 | 5039 | if (chain && TREE_CODE (chain) == BIND_EXPR) |
6de9cd9a DN |
5040 | { |
5041 | if (ignore_topmost_bind) | |
5042 | { | |
5043 | chain = BIND_EXPR_BODY (chain); | |
5044 | indent = 2; | |
5045 | } | |
5046 | else | |
5047 | indent = 0; | |
5048 | } | |
5049 | else | |
5050 | { | |
5051 | if (!ignore_topmost_bind) | |
5052 | fprintf (file, "{\n"); | |
5053 | indent = 2; | |
5054 | } | |
5055 | ||
5056 | if (any_var) | |
5057 | fprintf (file, "\n"); | |
5058 | ||
5059 | print_generic_stmt_indented (file, chain, flags, indent); | |
5060 | if (ignore_topmost_bind) | |
5061 | fprintf (file, "}\n"); | |
5062 | } | |
5063 | ||
5064 | fprintf (file, "\n\n"); | |
953ff289 DN |
5065 | |
5066 | /* Restore CFUN. */ | |
5067 | cfun = saved_cfun; | |
5068 | } | |
5069 | ||
5070 | ||
5071 | /* Dump FUNCTION_DECL FN to stderr using FLAGS (see TDF_* in tree.h) */ | |
5072 | ||
5073 | void | |
5074 | debug_function (tree fn, int flags) | |
5075 | { | |
5076 | dump_function_to_file (fn, stderr, flags); | |
6de9cd9a DN |
5077 | } |
5078 | ||
5079 | ||
5080 | /* Pretty print of the loops intermediate representation. */ | |
5081 | static void print_loop (FILE *, struct loop *, int); | |
628f6a4e BE |
5082 | static void print_pred_bbs (FILE *, basic_block bb); |
5083 | static void print_succ_bbs (FILE *, basic_block bb); | |
6de9cd9a DN |
5084 | |
5085 | ||
d7770457 | 5086 | /* Print on FILE the indexes for the predecessors of basic_block BB. */ |
6de9cd9a DN |
5087 | |
5088 | static void | |
628f6a4e | 5089 | print_pred_bbs (FILE *file, basic_block bb) |
6de9cd9a | 5090 | { |
628f6a4e BE |
5091 | edge e; |
5092 | edge_iterator ei; | |
5093 | ||
5094 | FOR_EACH_EDGE (e, ei, bb->preds) | |
d7770457 | 5095 | fprintf (file, "bb_%d ", e->src->index); |
6de9cd9a DN |
5096 | } |
5097 | ||
5098 | ||
d7770457 | 5099 | /* Print on FILE the indexes for the successors of basic_block BB. */ |
6de9cd9a DN |
5100 | |
5101 | static void | |
628f6a4e | 5102 | print_succ_bbs (FILE *file, basic_block bb) |
6de9cd9a | 5103 | { |
628f6a4e BE |
5104 | edge e; |
5105 | edge_iterator ei; | |
5106 | ||
5107 | FOR_EACH_EDGE (e, ei, bb->succs) | |
d7770457 | 5108 | fprintf (file, "bb_%d ", e->dest->index); |
6de9cd9a DN |
5109 | } |
5110 | ||
5111 | ||
5112 | /* Pretty print LOOP on FILE, indented INDENT spaces. */ | |
5113 | ||
5114 | static void | |
5115 | print_loop (FILE *file, struct loop *loop, int indent) | |
5116 | { | |
5117 | char *s_indent; | |
5118 | basic_block bb; | |
6531d1be | 5119 | |
6de9cd9a DN |
5120 | if (loop == NULL) |
5121 | return; | |
5122 | ||
5123 | s_indent = (char *) alloca ((size_t) indent + 1); | |
5124 | memset ((void *) s_indent, ' ', (size_t) indent); | |
5125 | s_indent[indent] = '\0'; | |
5126 | ||
5127 | /* Print the loop's header. */ | |
5128 | fprintf (file, "%sloop_%d\n", s_indent, loop->num); | |
6531d1be | 5129 | |
6de9cd9a DN |
5130 | /* Print the loop's body. */ |
5131 | fprintf (file, "%s{\n", s_indent); | |
5132 | FOR_EACH_BB (bb) | |
5133 | if (bb->loop_father == loop) | |
5134 | { | |
5135 | /* Print the basic_block's header. */ | |
5136 | fprintf (file, "%s bb_%d (preds = {", s_indent, bb->index); | |
628f6a4e | 5137 | print_pred_bbs (file, bb); |
6de9cd9a | 5138 | fprintf (file, "}, succs = {"); |
628f6a4e | 5139 | print_succ_bbs (file, bb); |
6de9cd9a | 5140 | fprintf (file, "})\n"); |
6531d1be | 5141 | |
6de9cd9a DN |
5142 | /* Print the basic_block's body. */ |
5143 | fprintf (file, "%s {\n", s_indent); | |
5144 | tree_dump_bb (bb, file, indent + 4); | |
5145 | fprintf (file, "%s }\n", s_indent); | |
5146 | } | |
6531d1be | 5147 | |
6de9cd9a DN |
5148 | print_loop (file, loop->inner, indent + 2); |
5149 | fprintf (file, "%s}\n", s_indent); | |
5150 | print_loop (file, loop->next, indent); | |
5151 | } | |
5152 | ||
5153 | ||
5154 | /* Follow a CFG edge from the entry point of the program, and on entry | |
5155 | of a loop, pretty print the loop structure on FILE. */ | |
5156 | ||
6531d1be | 5157 | void |
6de9cd9a DN |
5158 | print_loop_ir (FILE *file) |
5159 | { | |
5160 | basic_block bb; | |
6531d1be | 5161 | |
24bd1a0b | 5162 | bb = BASIC_BLOCK (NUM_FIXED_BLOCKS); |
6de9cd9a DN |
5163 | if (bb && bb->loop_father) |
5164 | print_loop (file, bb->loop_father, 0); | |
5165 | } | |
5166 | ||
5167 | ||
5168 | /* Debugging loops structure at tree level. */ | |
5169 | ||
6531d1be | 5170 | void |
6de9cd9a DN |
5171 | debug_loop_ir (void) |
5172 | { | |
5173 | print_loop_ir (stderr); | |
5174 | } | |
5175 | ||
5176 | ||
5177 | /* Return true if BB ends with a call, possibly followed by some | |
5178 | instructions that must stay with the call. Return false, | |
5179 | otherwise. */ | |
5180 | ||
5181 | static bool | |
5182 | tree_block_ends_with_call_p (basic_block bb) | |
5183 | { | |
5184 | block_stmt_iterator bsi = bsi_last (bb); | |
cd709752 | 5185 | return get_call_expr_in (bsi_stmt (bsi)) != NULL; |
6de9cd9a DN |
5186 | } |
5187 | ||
5188 | ||
5189 | /* Return true if BB ends with a conditional branch. Return false, | |
5190 | otherwise. */ | |
5191 | ||
5192 | static bool | |
5193 | tree_block_ends_with_condjump_p (basic_block bb) | |
5194 | { | |
9885da8e ZD |
5195 | tree stmt = last_stmt (bb); |
5196 | return (stmt && TREE_CODE (stmt) == COND_EXPR); | |
6de9cd9a DN |
5197 | } |
5198 | ||
5199 | ||
5200 | /* Return true if we need to add fake edge to exit at statement T. | |
5201 | Helper function for tree_flow_call_edges_add. */ | |
5202 | ||
5203 | static bool | |
5204 | need_fake_edge_p (tree t) | |
5205 | { | |
cd709752 | 5206 | tree call; |
6de9cd9a DN |
5207 | |
5208 | /* NORETURN and LONGJMP calls already have an edge to exit. | |
321cf1f2 | 5209 | CONST and PURE calls do not need one. |
6de9cd9a DN |
5210 | We don't currently check for CONST and PURE here, although |
5211 | it would be a good idea, because those attributes are | |
5212 | figured out from the RTL in mark_constant_function, and | |
5213 | the counter incrementation code from -fprofile-arcs | |
5214 | leads to different results from -fbranch-probabilities. */ | |
cd709752 RH |
5215 | call = get_call_expr_in (t); |
5216 | if (call | |
321cf1f2 | 5217 | && !(call_expr_flags (call) & ECF_NORETURN)) |
6de9cd9a DN |
5218 | return true; |
5219 | ||
5220 | if (TREE_CODE (t) == ASM_EXPR | |
5221 | && (ASM_VOLATILE_P (t) || ASM_INPUT_P (t))) | |
5222 | return true; | |
5223 | ||
5224 | return false; | |
5225 | } | |
5226 | ||
5227 | ||
5228 | /* Add fake edges to the function exit for any non constant and non | |
5229 | noreturn calls, volatile inline assembly in the bitmap of blocks | |
5230 | specified by BLOCKS or to the whole CFG if BLOCKS is zero. Return | |
5231 | the number of blocks that were split. | |
5232 | ||
5233 | The goal is to expose cases in which entering a basic block does | |
5234 | not imply that all subsequent instructions must be executed. */ | |
5235 | ||
5236 | static int | |
5237 | tree_flow_call_edges_add (sbitmap blocks) | |
5238 | { | |
5239 | int i; | |
5240 | int blocks_split = 0; | |
5241 | int last_bb = last_basic_block; | |
5242 | bool check_last_block = false; | |
5243 | ||
24bd1a0b | 5244 | if (n_basic_blocks == NUM_FIXED_BLOCKS) |
6de9cd9a DN |
5245 | return 0; |
5246 | ||
5247 | if (! blocks) | |
5248 | check_last_block = true; | |
5249 | else | |
5250 | check_last_block = TEST_BIT (blocks, EXIT_BLOCK_PTR->prev_bb->index); | |
5251 | ||
5252 | /* In the last basic block, before epilogue generation, there will be | |
5253 | a fallthru edge to EXIT. Special care is required if the last insn | |
5254 | of the last basic block is a call because make_edge folds duplicate | |
5255 | edges, which would result in the fallthru edge also being marked | |
5256 | fake, which would result in the fallthru edge being removed by | |
5257 | remove_fake_edges, which would result in an invalid CFG. | |
5258 | ||
5259 | Moreover, we can't elide the outgoing fake edge, since the block | |
5260 | profiler needs to take this into account in order to solve the minimal | |
5261 | spanning tree in the case that the call doesn't return. | |
5262 | ||
5263 | Handle this by adding a dummy instruction in a new last basic block. */ | |
5264 | if (check_last_block) | |
5265 | { | |
5266 | basic_block bb = EXIT_BLOCK_PTR->prev_bb; | |
5267 | block_stmt_iterator bsi = bsi_last (bb); | |
5268 | tree t = NULL_TREE; | |
5269 | if (!bsi_end_p (bsi)) | |
5270 | t = bsi_stmt (bsi); | |
5271 | ||
6a60530d | 5272 | if (t && need_fake_edge_p (t)) |
6de9cd9a DN |
5273 | { |
5274 | edge e; | |
5275 | ||
9ff3d2de JL |
5276 | e = find_edge (bb, EXIT_BLOCK_PTR); |
5277 | if (e) | |
5278 | { | |
5279 | bsi_insert_on_edge (e, build_empty_stmt ()); | |
5280 | bsi_commit_edge_inserts (); | |
5281 | } | |
6de9cd9a DN |
5282 | } |
5283 | } | |
5284 | ||
5285 | /* Now add fake edges to the function exit for any non constant | |
5286 | calls since there is no way that we can determine if they will | |
5287 | return or not... */ | |
5288 | for (i = 0; i < last_bb; i++) | |
5289 | { | |
5290 | basic_block bb = BASIC_BLOCK (i); | |
5291 | block_stmt_iterator bsi; | |
5292 | tree stmt, last_stmt; | |
5293 | ||
5294 | if (!bb) | |
5295 | continue; | |
5296 | ||
5297 | if (blocks && !TEST_BIT (blocks, i)) | |
5298 | continue; | |
5299 | ||
5300 | bsi = bsi_last (bb); | |
5301 | if (!bsi_end_p (bsi)) | |
5302 | { | |
5303 | last_stmt = bsi_stmt (bsi); | |
5304 | do | |
5305 | { | |
5306 | stmt = bsi_stmt (bsi); | |
5307 | if (need_fake_edge_p (stmt)) | |
5308 | { | |
5309 | edge e; | |
5310 | /* The handling above of the final block before the | |
5311 | epilogue should be enough to verify that there is | |
5312 | no edge to the exit block in CFG already. | |
5313 | Calling make_edge in such case would cause us to | |
5314 | mark that edge as fake and remove it later. */ | |
5315 | #ifdef ENABLE_CHECKING | |
5316 | if (stmt == last_stmt) | |
628f6a4e | 5317 | { |
9ff3d2de JL |
5318 | e = find_edge (bb, EXIT_BLOCK_PTR); |
5319 | gcc_assert (e == NULL); | |
628f6a4e | 5320 | } |
6de9cd9a DN |
5321 | #endif |
5322 | ||
5323 | /* Note that the following may create a new basic block | |
5324 | and renumber the existing basic blocks. */ | |
5325 | if (stmt != last_stmt) | |
5326 | { | |
5327 | e = split_block (bb, stmt); | |
5328 | if (e) | |
5329 | blocks_split++; | |
5330 | } | |
5331 | make_edge (bb, EXIT_BLOCK_PTR, EDGE_FAKE); | |
5332 | } | |
5333 | bsi_prev (&bsi); | |
5334 | } | |
5335 | while (!bsi_end_p (bsi)); | |
5336 | } | |
5337 | } | |
5338 | ||
5339 | if (blocks_split) | |
5340 | verify_flow_info (); | |
5341 | ||
5342 | return blocks_split; | |
5343 | } | |
5344 | ||
4f6c2131 EB |
5345 | /* Purge dead abnormal call edges from basic block BB. */ |
5346 | ||
5347 | bool | |
5348 | tree_purge_dead_abnormal_call_edges (basic_block bb) | |
5349 | { | |
5350 | bool changed = tree_purge_dead_eh_edges (bb); | |
5351 | ||
5352 | if (current_function_has_nonlocal_label) | |
5353 | { | |
5354 | tree stmt = last_stmt (bb); | |
5355 | edge_iterator ei; | |
5356 | edge e; | |
5357 | ||
5358 | if (!(stmt && tree_can_make_abnormal_goto (stmt))) | |
5359 | for (ei = ei_start (bb->succs); (e = ei_safe_edge (ei)); ) | |
5360 | { | |
5361 | if (e->flags & EDGE_ABNORMAL) | |
5362 | { | |
5363 | remove_edge (e); | |
5364 | changed = true; | |
5365 | } | |
5366 | else | |
5367 | ei_next (&ei); | |
5368 | } | |
5369 | ||
5370 | /* See tree_purge_dead_eh_edges below. */ | |
5371 | if (changed) | |
5372 | free_dominance_info (CDI_DOMINATORS); | |
5373 | } | |
5374 | ||
5375 | return changed; | |
5376 | } | |
5377 | ||
672987e8 ZD |
5378 | /* Stores all basic blocks dominated by BB to DOM_BBS. */ |
5379 | ||
5380 | static void | |
5381 | get_all_dominated_blocks (basic_block bb, VEC (basic_block, heap) **dom_bbs) | |
5382 | { | |
5383 | basic_block son; | |
5384 | ||
5385 | VEC_safe_push (basic_block, heap, *dom_bbs, bb); | |
5386 | for (son = first_dom_son (CDI_DOMINATORS, bb); | |
5387 | son; | |
5388 | son = next_dom_son (CDI_DOMINATORS, son)) | |
5389 | get_all_dominated_blocks (son, dom_bbs); | |
5390 | } | |
5391 | ||
5392 | /* Removes edge E and all the blocks dominated by it, and updates dominance | |
5393 | information. The IL in E->src needs to be updated separately. | |
5394 | If dominance info is not available, only the edge E is removed.*/ | |
5395 | ||
5396 | void | |
5397 | remove_edge_and_dominated_blocks (edge e) | |
5398 | { | |
5399 | VEC (basic_block, heap) *bbs_to_remove = NULL; | |
5400 | VEC (basic_block, heap) *bbs_to_fix_dom = NULL; | |
5401 | bitmap df, df_idom; | |
5402 | edge f; | |
5403 | edge_iterator ei; | |
5404 | bool none_removed = false; | |
5405 | unsigned i; | |
5406 | basic_block bb, dbb; | |
5407 | bitmap_iterator bi; | |
5408 | ||
2b28c07a | 5409 | if (!dom_info_available_p (CDI_DOMINATORS)) |
672987e8 ZD |
5410 | { |
5411 | remove_edge (e); | |
5412 | return; | |
5413 | } | |
5414 | ||
5415 | /* No updating is needed for edges to exit. */ | |
5416 | if (e->dest == EXIT_BLOCK_PTR) | |
5417 | { | |
5418 | if (cfgcleanup_altered_bbs) | |
5419 | bitmap_set_bit (cfgcleanup_altered_bbs, e->src->index); | |
5420 | remove_edge (e); | |
5421 | return; | |
5422 | } | |
5423 | ||
5424 | /* First, we find the basic blocks to remove. If E->dest has a predecessor | |
5425 | that is not dominated by E->dest, then this set is empty. Otherwise, | |
5426 | all the basic blocks dominated by E->dest are removed. | |
5427 | ||
5428 | Also, to DF_IDOM we store the immediate dominators of the blocks in | |
5429 | the dominance frontier of E (i.e., of the successors of the | |
5430 | removed blocks, if there are any, and of E->dest otherwise). */ | |
5431 | FOR_EACH_EDGE (f, ei, e->dest->preds) | |
5432 | { | |
5433 | if (f == e) | |
5434 | continue; | |
5435 | ||
5436 | if (!dominated_by_p (CDI_DOMINATORS, f->src, e->dest)) | |
5437 | { | |
5438 | none_removed = true; | |
5439 | break; | |
5440 | } | |
5441 | } | |
5442 | ||
5443 | df = BITMAP_ALLOC (NULL); | |
5444 | df_idom = BITMAP_ALLOC (NULL); | |
5445 | ||
5446 | if (none_removed) | |
5447 | bitmap_set_bit (df_idom, | |
5448 | get_immediate_dominator (CDI_DOMINATORS, e->dest)->index); | |
5449 | else | |
5450 | { | |
5451 | get_all_dominated_blocks (e->dest, &bbs_to_remove); | |
5452 | for (i = 0; VEC_iterate (basic_block, bbs_to_remove, i, bb); i++) | |
5453 | { | |
5454 | FOR_EACH_EDGE (f, ei, bb->succs) | |
5455 | { | |
5456 | if (f->dest != EXIT_BLOCK_PTR) | |
5457 | bitmap_set_bit (df, f->dest->index); | |
5458 | } | |
5459 | } | |
5460 | for (i = 0; VEC_iterate (basic_block, bbs_to_remove, i, bb); i++) | |
5461 | bitmap_clear_bit (df, bb->index); | |
5462 | ||
5463 | EXECUTE_IF_SET_IN_BITMAP (df, 0, i, bi) | |
5464 | { | |
5465 | bb = BASIC_BLOCK (i); | |
5466 | bitmap_set_bit (df_idom, | |
5467 | get_immediate_dominator (CDI_DOMINATORS, bb)->index); | |
5468 | } | |
5469 | } | |
5470 | ||
5471 | if (cfgcleanup_altered_bbs) | |
5472 | { | |
5473 | /* Record the set of the altered basic blocks. */ | |
5474 | bitmap_set_bit (cfgcleanup_altered_bbs, e->src->index); | |
5475 | bitmap_ior_into (cfgcleanup_altered_bbs, df); | |
5476 | } | |
5477 | ||
5478 | /* Remove E and the cancelled blocks. */ | |
5479 | if (none_removed) | |
5480 | remove_edge (e); | |
5481 | else | |
5482 | { | |
5483 | for (i = 0; VEC_iterate (basic_block, bbs_to_remove, i, bb); i++) | |
5484 | delete_basic_block (bb); | |
5485 | } | |
5486 | ||
5487 | /* Update the dominance information. The immediate dominator may change only | |
5488 | for blocks whose immediate dominator belongs to DF_IDOM: | |
5489 | ||
5490 | Suppose that idom(X) = Y before removal of E and idom(X) != Y after the | |
5491 | removal. Let Z the arbitrary block such that idom(Z) = Y and | |
5492 | Z dominates X after the removal. Before removal, there exists a path P | |
5493 | from Y to X that avoids Z. Let F be the last edge on P that is | |
5494 | removed, and let W = F->dest. Before removal, idom(W) = Y (since Y | |
5495 | dominates W, and because of P, Z does not dominate W), and W belongs to | |
5496 | the dominance frontier of E. Therefore, Y belongs to DF_IDOM. */ | |
5497 | EXECUTE_IF_SET_IN_BITMAP (df_idom, 0, i, bi) | |
5498 | { | |
5499 | bb = BASIC_BLOCK (i); | |
5500 | for (dbb = first_dom_son (CDI_DOMINATORS, bb); | |
5501 | dbb; | |
5502 | dbb = next_dom_son (CDI_DOMINATORS, dbb)) | |
5503 | VEC_safe_push (basic_block, heap, bbs_to_fix_dom, dbb); | |
5504 | } | |
5505 | ||
66f97d31 | 5506 | iterate_fix_dominators (CDI_DOMINATORS, bbs_to_fix_dom, true); |
672987e8 ZD |
5507 | |
5508 | BITMAP_FREE (df); | |
5509 | BITMAP_FREE (df_idom); | |
5510 | VEC_free (basic_block, heap, bbs_to_remove); | |
5511 | VEC_free (basic_block, heap, bbs_to_fix_dom); | |
5512 | } | |
5513 | ||
4f6c2131 EB |
5514 | /* Purge dead EH edges from basic block BB. */ |
5515 | ||
1eaba2f2 RH |
5516 | bool |
5517 | tree_purge_dead_eh_edges (basic_block bb) | |
5518 | { | |
5519 | bool changed = false; | |
628f6a4e BE |
5520 | edge e; |
5521 | edge_iterator ei; | |
1eaba2f2 RH |
5522 | tree stmt = last_stmt (bb); |
5523 | ||
5524 | if (stmt && tree_can_throw_internal (stmt)) | |
5525 | return false; | |
5526 | ||
628f6a4e | 5527 | for (ei = ei_start (bb->succs); (e = ei_safe_edge (ei)); ) |
1eaba2f2 | 5528 | { |
1eaba2f2 RH |
5529 | if (e->flags & EDGE_EH) |
5530 | { | |
672987e8 | 5531 | remove_edge_and_dominated_blocks (e); |
1eaba2f2 RH |
5532 | changed = true; |
5533 | } | |
628f6a4e BE |
5534 | else |
5535 | ei_next (&ei); | |
1eaba2f2 RH |
5536 | } |
5537 | ||
5538 | return changed; | |
5539 | } | |
5540 | ||
5541 | bool | |
5542 | tree_purge_all_dead_eh_edges (bitmap blocks) | |
5543 | { | |
5544 | bool changed = false; | |
3cd8c58a | 5545 | unsigned i; |
87c476a2 | 5546 | bitmap_iterator bi; |
1eaba2f2 | 5547 | |
87c476a2 ZD |
5548 | EXECUTE_IF_SET_IN_BITMAP (blocks, 0, i, bi) |
5549 | { | |
5550 | changed |= tree_purge_dead_eh_edges (BASIC_BLOCK (i)); | |
5551 | } | |
1eaba2f2 RH |
5552 | |
5553 | return changed; | |
5554 | } | |
6de9cd9a | 5555 | |
a100ac1e KH |
5556 | /* This function is called whenever a new edge is created or |
5557 | redirected. */ | |
5558 | ||
5559 | static void | |
5560 | tree_execute_on_growing_pred (edge e) | |
5561 | { | |
5562 | basic_block bb = e->dest; | |
5563 | ||
5564 | if (phi_nodes (bb)) | |
5565 | reserve_phi_args_for_new_edge (bb); | |
5566 | } | |
5567 | ||
e51546f8 KH |
5568 | /* This function is called immediately before edge E is removed from |
5569 | the edge vector E->dest->preds. */ | |
5570 | ||
5571 | static void | |
5572 | tree_execute_on_shrinking_pred (edge e) | |
5573 | { | |
5574 | if (phi_nodes (e->dest)) | |
5575 | remove_phi_args (e); | |
5576 | } | |
5577 | ||
1cb7dfc3 MH |
5578 | /*--------------------------------------------------------------------------- |
5579 | Helper functions for Loop versioning | |
5580 | ---------------------------------------------------------------------------*/ | |
5581 | ||
5582 | /* Adjust phi nodes for 'first' basic block. 'second' basic block is a copy | |
5583 | of 'first'. Both of them are dominated by 'new_head' basic block. When | |
5584 | 'new_head' was created by 'second's incoming edge it received phi arguments | |
5585 | on the edge by split_edge(). Later, additional edge 'e' was created to | |
6531d1be BF |
5586 | connect 'new_head' and 'first'. Now this routine adds phi args on this |
5587 | additional edge 'e' that new_head to second edge received as part of edge | |
1cb7dfc3 MH |
5588 | splitting. |
5589 | */ | |
5590 | ||
5591 | static void | |
5592 | tree_lv_adjust_loop_header_phi (basic_block first, basic_block second, | |
5593 | basic_block new_head, edge e) | |
5594 | { | |
5595 | tree phi1, phi2; | |
d0e12fc6 KH |
5596 | edge e2 = find_edge (new_head, second); |
5597 | ||
5598 | /* Because NEW_HEAD has been created by splitting SECOND's incoming | |
5599 | edge, we should always have an edge from NEW_HEAD to SECOND. */ | |
5600 | gcc_assert (e2 != NULL); | |
1cb7dfc3 MH |
5601 | |
5602 | /* Browse all 'second' basic block phi nodes and add phi args to | |
5603 | edge 'e' for 'first' head. PHI args are always in correct order. */ | |
5604 | ||
6531d1be BF |
5605 | for (phi2 = phi_nodes (second), phi1 = phi_nodes (first); |
5606 | phi2 && phi1; | |
1cb7dfc3 MH |
5607 | phi2 = PHI_CHAIN (phi2), phi1 = PHI_CHAIN (phi1)) |
5608 | { | |
d0e12fc6 KH |
5609 | tree def = PHI_ARG_DEF (phi2, e2->dest_idx); |
5610 | add_phi_arg (phi1, def, e); | |
1cb7dfc3 MH |
5611 | } |
5612 | } | |
5613 | ||
6531d1be BF |
5614 | /* Adds a if else statement to COND_BB with condition COND_EXPR. |
5615 | SECOND_HEAD is the destination of the THEN and FIRST_HEAD is | |
1cb7dfc3 MH |
5616 | the destination of the ELSE part. */ |
5617 | static void | |
a9b77cd1 ZD |
5618 | tree_lv_add_condition_to_bb (basic_block first_head ATTRIBUTE_UNUSED, |
5619 | basic_block second_head ATTRIBUTE_UNUSED, | |
5620 | basic_block cond_bb, void *cond_e) | |
1cb7dfc3 MH |
5621 | { |
5622 | block_stmt_iterator bsi; | |
1cb7dfc3 MH |
5623 | tree new_cond_expr = NULL_TREE; |
5624 | tree cond_expr = (tree) cond_e; | |
5625 | edge e0; | |
5626 | ||
5627 | /* Build new conditional expr */ | |
a9b77cd1 ZD |
5628 | new_cond_expr = build3 (COND_EXPR, void_type_node, cond_expr, |
5629 | NULL_TREE, NULL_TREE); | |
1cb7dfc3 | 5630 | |
6531d1be BF |
5631 | /* Add new cond in cond_bb. */ |
5632 | bsi = bsi_start (cond_bb); | |
1cb7dfc3 MH |
5633 | bsi_insert_after (&bsi, new_cond_expr, BSI_NEW_STMT); |
5634 | /* Adjust edges appropriately to connect new head with first head | |
5635 | as well as second head. */ | |
5636 | e0 = single_succ_edge (cond_bb); | |
5637 | e0->flags &= ~EDGE_FALLTHRU; | |
5638 | e0->flags |= EDGE_FALSE_VALUE; | |
5639 | } | |
5640 | ||
6de9cd9a DN |
5641 | struct cfg_hooks tree_cfg_hooks = { |
5642 | "tree", | |
5643 | tree_verify_flow_info, | |
5644 | tree_dump_bb, /* dump_bb */ | |
5645 | create_bb, /* create_basic_block */ | |
5646 | tree_redirect_edge_and_branch,/* redirect_edge_and_branch */ | |
5647 | tree_redirect_edge_and_branch_force,/* redirect_edge_and_branch_force */ | |
14fa2cc0 | 5648 | tree_can_remove_branch_p, /* can_remove_branch_p */ |
6de9cd9a DN |
5649 | remove_bb, /* delete_basic_block */ |
5650 | tree_split_block, /* split_block */ | |
5651 | tree_move_block_after, /* move_block_after */ | |
5652 | tree_can_merge_blocks_p, /* can_merge_blocks_p */ | |
5653 | tree_merge_blocks, /* merge_blocks */ | |
5654 | tree_predict_edge, /* predict_edge */ | |
5655 | tree_predicted_by_p, /* predicted_by_p */ | |
5656 | tree_can_duplicate_bb_p, /* can_duplicate_block_p */ | |
5657 | tree_duplicate_bb, /* duplicate_block */ | |
5658 | tree_split_edge, /* split_edge */ | |
5659 | tree_make_forwarder_block, /* make_forward_block */ | |
5660 | NULL, /* tidy_fallthru_edge */ | |
5661 | tree_block_ends_with_call_p, /* block_ends_with_call_p */ | |
5662 | tree_block_ends_with_condjump_p, /* block_ends_with_condjump_p */ | |
d9d4706f | 5663 | tree_flow_call_edges_add, /* flow_call_edges_add */ |
a100ac1e | 5664 | tree_execute_on_growing_pred, /* execute_on_growing_pred */ |
e51546f8 | 5665 | tree_execute_on_shrinking_pred, /* execute_on_shrinking_pred */ |
1cb7dfc3 MH |
5666 | tree_duplicate_loop_to_header_edge, /* duplicate loop for trees */ |
5667 | tree_lv_add_condition_to_bb, /* lv_add_condition_to_bb */ | |
5668 | tree_lv_adjust_loop_header_phi, /* lv_adjust_loop_header_phi*/ | |
5669 | extract_true_false_edges_from_block, /* extract_cond_bb_edges */ | |
6531d1be | 5670 | flush_pending_stmts /* flush_pending_stmts */ |
6de9cd9a DN |
5671 | }; |
5672 | ||
5673 | ||
5674 | /* Split all critical edges. */ | |
5675 | ||
c2924966 | 5676 | static unsigned int |
6de9cd9a DN |
5677 | split_critical_edges (void) |
5678 | { | |
5679 | basic_block bb; | |
5680 | edge e; | |
628f6a4e | 5681 | edge_iterator ei; |
6de9cd9a | 5682 | |
d6be0d7f JL |
5683 | /* split_edge can redirect edges out of SWITCH_EXPRs, which can get |
5684 | expensive. So we want to enable recording of edge to CASE_LABEL_EXPR | |
5685 | mappings around the calls to split_edge. */ | |
5686 | start_recording_case_labels (); | |
6de9cd9a DN |
5687 | FOR_ALL_BB (bb) |
5688 | { | |
628f6a4e | 5689 | FOR_EACH_EDGE (e, ei, bb->succs) |
6de9cd9a DN |
5690 | if (EDGE_CRITICAL_P (e) && !(e->flags & EDGE_ABNORMAL)) |
5691 | { | |
5692 | split_edge (e); | |
5693 | } | |
5694 | } | |
d6be0d7f | 5695 | end_recording_case_labels (); |
c2924966 | 5696 | return 0; |
6de9cd9a DN |
5697 | } |
5698 | ||
6531d1be | 5699 | struct tree_opt_pass pass_split_crit_edges = |
6de9cd9a | 5700 | { |
5d44aeed | 5701 | "crited", /* name */ |
6de9cd9a DN |
5702 | NULL, /* gate */ |
5703 | split_critical_edges, /* execute */ | |
5704 | NULL, /* sub */ | |
5705 | NULL, /* next */ | |
5706 | 0, /* static_pass_number */ | |
5707 | TV_TREE_SPLIT_EDGES, /* tv_id */ | |
5708 | PROP_cfg, /* properties required */ | |
5709 | PROP_no_crit_edges, /* properties_provided */ | |
5710 | 0, /* properties_destroyed */ | |
5711 | 0, /* todo_flags_start */ | |
9f8628ba PB |
5712 | TODO_dump_func, /* todo_flags_finish */ |
5713 | 0 /* letter */ | |
6de9cd9a | 5714 | }; |
26277d41 PB |
5715 | |
5716 | \f | |
5717 | /* Return EXP if it is a valid GIMPLE rvalue, else gimplify it into | |
5718 | a temporary, make sure and register it to be renamed if necessary, | |
5719 | and finally return the temporary. Put the statements to compute | |
5720 | EXP before the current statement in BSI. */ | |
5721 | ||
5722 | tree | |
5723 | gimplify_val (block_stmt_iterator *bsi, tree type, tree exp) | |
5724 | { | |
5725 | tree t, new_stmt, orig_stmt; | |
5726 | ||
5727 | if (is_gimple_val (exp)) | |
5728 | return exp; | |
5729 | ||
5730 | t = make_rename_temp (type, NULL); | |
939409af | 5731 | new_stmt = build_gimple_modify_stmt (t, exp); |
26277d41 PB |
5732 | |
5733 | orig_stmt = bsi_stmt (*bsi); | |
5734 | SET_EXPR_LOCUS (new_stmt, EXPR_LOCUS (orig_stmt)); | |
5735 | TREE_BLOCK (new_stmt) = TREE_BLOCK (orig_stmt); | |
5736 | ||
5737 | bsi_insert_before (bsi, new_stmt, BSI_SAME_STMT); | |
5cd4ec7f | 5738 | if (gimple_in_ssa_p (cfun)) |
cfaab3a9 | 5739 | mark_symbols_for_renaming (new_stmt); |
26277d41 PB |
5740 | |
5741 | return t; | |
5742 | } | |
5743 | ||
5744 | /* Build a ternary operation and gimplify it. Emit code before BSI. | |
5745 | Return the gimple_val holding the result. */ | |
5746 | ||
5747 | tree | |
5748 | gimplify_build3 (block_stmt_iterator *bsi, enum tree_code code, | |
5749 | tree type, tree a, tree b, tree c) | |
5750 | { | |
5751 | tree ret; | |
5752 | ||
987b67bc | 5753 | ret = fold_build3 (code, type, a, b, c); |
26277d41 PB |
5754 | STRIP_NOPS (ret); |
5755 | ||
5756 | return gimplify_val (bsi, type, ret); | |
5757 | } | |
5758 | ||
5759 | /* Build a binary operation and gimplify it. Emit code before BSI. | |
5760 | Return the gimple_val holding the result. */ | |
5761 | ||
5762 | tree | |
5763 | gimplify_build2 (block_stmt_iterator *bsi, enum tree_code code, | |
5764 | tree type, tree a, tree b) | |
5765 | { | |
5766 | tree ret; | |
5767 | ||
987b67bc | 5768 | ret = fold_build2 (code, type, a, b); |
26277d41 PB |
5769 | STRIP_NOPS (ret); |
5770 | ||
5771 | return gimplify_val (bsi, type, ret); | |
5772 | } | |
5773 | ||
5774 | /* Build a unary operation and gimplify it. Emit code before BSI. | |
5775 | Return the gimple_val holding the result. */ | |
5776 | ||
5777 | tree | |
5778 | gimplify_build1 (block_stmt_iterator *bsi, enum tree_code code, tree type, | |
5779 | tree a) | |
5780 | { | |
5781 | tree ret; | |
5782 | ||
987b67bc | 5783 | ret = fold_build1 (code, type, a); |
26277d41 PB |
5784 | STRIP_NOPS (ret); |
5785 | ||
5786 | return gimplify_val (bsi, type, ret); | |
5787 | } | |
5788 | ||
5789 | ||
6de9cd9a DN |
5790 | \f |
5791 | /* Emit return warnings. */ | |
5792 | ||
c2924966 | 5793 | static unsigned int |
6de9cd9a DN |
5794 | execute_warn_function_return (void) |
5795 | { | |
9506ac2b PB |
5796 | #ifdef USE_MAPPED_LOCATION |
5797 | source_location location; | |
5798 | #else | |
6de9cd9a | 5799 | location_t *locus; |
9506ac2b | 5800 | #endif |
6de9cd9a DN |
5801 | tree last; |
5802 | edge e; | |
628f6a4e | 5803 | edge_iterator ei; |
6de9cd9a | 5804 | |
6de9cd9a DN |
5805 | /* If we have a path to EXIT, then we do return. */ |
5806 | if (TREE_THIS_VOLATILE (cfun->decl) | |
628f6a4e | 5807 | && EDGE_COUNT (EXIT_BLOCK_PTR->preds) > 0) |
6de9cd9a | 5808 | { |
9506ac2b PB |
5809 | #ifdef USE_MAPPED_LOCATION |
5810 | location = UNKNOWN_LOCATION; | |
5811 | #else | |
6de9cd9a | 5812 | locus = NULL; |
9506ac2b | 5813 | #endif |
628f6a4e | 5814 | FOR_EACH_EDGE (e, ei, EXIT_BLOCK_PTR->preds) |
6de9cd9a DN |
5815 | { |
5816 | last = last_stmt (e->src); | |
5817 | if (TREE_CODE (last) == RETURN_EXPR | |
9506ac2b PB |
5818 | #ifdef USE_MAPPED_LOCATION |
5819 | && (location = EXPR_LOCATION (last)) != UNKNOWN_LOCATION) | |
5820 | #else | |
6de9cd9a | 5821 | && (locus = EXPR_LOCUS (last)) != NULL) |
9506ac2b | 5822 | #endif |
6de9cd9a DN |
5823 | break; |
5824 | } | |
9506ac2b PB |
5825 | #ifdef USE_MAPPED_LOCATION |
5826 | if (location == UNKNOWN_LOCATION) | |
5827 | location = cfun->function_end_locus; | |
d4ee4d25 | 5828 | warning (0, "%H%<noreturn%> function does return", &location); |
9506ac2b | 5829 | #else |
6de9cd9a DN |
5830 | if (!locus) |
5831 | locus = &cfun->function_end_locus; | |
d4ee4d25 | 5832 | warning (0, "%H%<noreturn%> function does return", locus); |
9506ac2b | 5833 | #endif |
6de9cd9a DN |
5834 | } |
5835 | ||
5836 | /* If we see "return;" in some basic block, then we do reach the end | |
5837 | without returning a value. */ | |
5838 | else if (warn_return_type | |
089efaa4 | 5839 | && !TREE_NO_WARNING (cfun->decl) |
628f6a4e | 5840 | && EDGE_COUNT (EXIT_BLOCK_PTR->preds) > 0 |
6de9cd9a DN |
5841 | && !VOID_TYPE_P (TREE_TYPE (TREE_TYPE (cfun->decl)))) |
5842 | { | |
628f6a4e | 5843 | FOR_EACH_EDGE (e, ei, EXIT_BLOCK_PTR->preds) |
6de9cd9a DN |
5844 | { |
5845 | tree last = last_stmt (e->src); | |
5846 | if (TREE_CODE (last) == RETURN_EXPR | |
0c9b182b JJ |
5847 | && TREE_OPERAND (last, 0) == NULL |
5848 | && !TREE_NO_WARNING (last)) | |
6de9cd9a | 5849 | { |
9506ac2b PB |
5850 | #ifdef USE_MAPPED_LOCATION |
5851 | location = EXPR_LOCATION (last); | |
5852 | if (location == UNKNOWN_LOCATION) | |
5853 | location = cfun->function_end_locus; | |
d4ee4d25 | 5854 | warning (0, "%Hcontrol reaches end of non-void function", &location); |
9506ac2b | 5855 | #else |
6de9cd9a DN |
5856 | locus = EXPR_LOCUS (last); |
5857 | if (!locus) | |
5858 | locus = &cfun->function_end_locus; | |
d4ee4d25 | 5859 | warning (0, "%Hcontrol reaches end of non-void function", locus); |
9506ac2b | 5860 | #endif |
089efaa4 | 5861 | TREE_NO_WARNING (cfun->decl) = 1; |
6de9cd9a DN |
5862 | break; |
5863 | } | |
5864 | } | |
5865 | } | |
c2924966 | 5866 | return 0; |
6de9cd9a DN |
5867 | } |
5868 | ||
5869 | ||
5870 | /* Given a basic block B which ends with a conditional and has | |
5871 | precisely two successors, determine which of the edges is taken if | |
5872 | the conditional is true and which is taken if the conditional is | |
5873 | false. Set TRUE_EDGE and FALSE_EDGE appropriately. */ | |
5874 | ||
5875 | void | |
5876 | extract_true_false_edges_from_block (basic_block b, | |
5877 | edge *true_edge, | |
5878 | edge *false_edge) | |
5879 | { | |
628f6a4e | 5880 | edge e = EDGE_SUCC (b, 0); |
6de9cd9a DN |
5881 | |
5882 | if (e->flags & EDGE_TRUE_VALUE) | |
5883 | { | |
5884 | *true_edge = e; | |
628f6a4e | 5885 | *false_edge = EDGE_SUCC (b, 1); |
6de9cd9a DN |
5886 | } |
5887 | else | |
5888 | { | |
5889 | *false_edge = e; | |
628f6a4e | 5890 | *true_edge = EDGE_SUCC (b, 1); |
6de9cd9a DN |
5891 | } |
5892 | } | |
5893 | ||
5894 | struct tree_opt_pass pass_warn_function_return = | |
5895 | { | |
5896 | NULL, /* name */ | |
5897 | NULL, /* gate */ | |
5898 | execute_warn_function_return, /* execute */ | |
5899 | NULL, /* sub */ | |
5900 | NULL, /* next */ | |
5901 | 0, /* static_pass_number */ | |
5902 | 0, /* tv_id */ | |
00bfee6f | 5903 | PROP_cfg, /* properties_required */ |
6de9cd9a DN |
5904 | 0, /* properties_provided */ |
5905 | 0, /* properties_destroyed */ | |
5906 | 0, /* todo_flags_start */ | |
9f8628ba PB |
5907 | 0, /* todo_flags_finish */ |
5908 | 0 /* letter */ | |
6de9cd9a | 5909 | }; |
aa313ed4 JH |
5910 | |
5911 | /* Emit noreturn warnings. */ | |
5912 | ||
c2924966 | 5913 | static unsigned int |
aa313ed4 JH |
5914 | execute_warn_function_noreturn (void) |
5915 | { | |
5916 | if (warn_missing_noreturn | |
5917 | && !TREE_THIS_VOLATILE (cfun->decl) | |
5918 | && EDGE_COUNT (EXIT_BLOCK_PTR->preds) == 0 | |
5919 | && !lang_hooks.function.missing_noreturn_ok_p (cfun->decl)) | |
3176a0c2 DD |
5920 | warning (OPT_Wmissing_noreturn, "%Jfunction might be possible candidate " |
5921 | "for attribute %<noreturn%>", | |
aa313ed4 | 5922 | cfun->decl); |
c2924966 | 5923 | return 0; |
aa313ed4 JH |
5924 | } |
5925 | ||
5926 | struct tree_opt_pass pass_warn_function_noreturn = | |
5927 | { | |
5928 | NULL, /* name */ | |
5929 | NULL, /* gate */ | |
5930 | execute_warn_function_noreturn, /* execute */ | |
5931 | NULL, /* sub */ | |
5932 | NULL, /* next */ | |
5933 | 0, /* static_pass_number */ | |
5934 | 0, /* tv_id */ | |
5935 | PROP_cfg, /* properties_required */ | |
5936 | 0, /* properties_provided */ | |
5937 | 0, /* properties_destroyed */ | |
5938 | 0, /* todo_flags_start */ | |
5939 | 0, /* todo_flags_finish */ | |
5940 | 0 /* letter */ | |
5941 | }; |