]>
Commit | Line | Data |
---|---|---|
6de9cd9a | 1 | /* Control flow functions for trees. |
cbe34bb5 | 2 | Copyright (C) 2001-2017 Free Software Foundation, Inc. |
6de9cd9a DN |
3 | Contributed by Diego Novillo <dnovillo@redhat.com> |
4 | ||
5 | This file is part of GCC. | |
6 | ||
7 | GCC is free software; you can redistribute it and/or modify | |
8 | it under the terms of the GNU General Public License as published by | |
9dcd6f09 | 9 | the Free Software Foundation; either version 3, or (at your option) |
6de9cd9a DN |
10 | any later version. |
11 | ||
12 | GCC is distributed in the hope that it will be useful, | |
13 | but WITHOUT ANY WARRANTY; without even the implied warranty of | |
14 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
15 | GNU General Public License for more details. | |
16 | ||
17 | You should have received a copy of the GNU General Public License | |
9dcd6f09 NC |
18 | along with GCC; see the file COPYING3. If not see |
19 | <http://www.gnu.org/licenses/>. */ | |
6de9cd9a DN |
20 | |
21 | #include "config.h" | |
22 | #include "system.h" | |
23 | #include "coretypes.h" | |
c7131fb2 | 24 | #include "backend.h" |
957060b5 AM |
25 | #include "target.h" |
26 | #include "rtl.h" | |
6de9cd9a | 27 | #include "tree.h" |
c7131fb2 | 28 | #include "gimple.h" |
957060b5 AM |
29 | #include "cfghooks.h" |
30 | #include "tree-pass.h" | |
c7131fb2 | 31 | #include "ssa.h" |
957060b5 AM |
32 | #include "cgraph.h" |
33 | #include "gimple-pretty-print.h" | |
34 | #include "diagnostic-core.h" | |
40e23961 | 35 | #include "fold-const.h" |
d8a2d370 DN |
36 | #include "trans-mem.h" |
37 | #include "stor-layout.h" | |
38 | #include "print-tree.h" | |
60393bbc | 39 | #include "cfganal.h" |
2fb9a547 AM |
40 | #include "gimple-fold.h" |
41 | #include "tree-eh.h" | |
5be5c238 | 42 | #include "gimple-iterator.h" |
18f429e2 | 43 | #include "gimplify-me.h" |
5be5c238 | 44 | #include "gimple-walk.h" |
442b4905 | 45 | #include "tree-cfg.h" |
e28030cf AM |
46 | #include "tree-ssa-loop-manip.h" |
47 | #include "tree-ssa-loop-niter.h" | |
442b4905 AM |
48 | #include "tree-into-ssa.h" |
49 | #include "tree-dfa.h" | |
7a300452 | 50 | #include "tree-ssa.h" |
6de9cd9a DN |
51 | #include "except.h" |
52 | #include "cfgloop.h" | |
9af0df6b | 53 | #include "tree-ssa-propagate.h" |
6946b3f7 | 54 | #include "value-prof.h" |
917948d3 | 55 | #include "tree-inline.h" |
c1bf2a39 | 56 | #include "tree-ssa-live.h" |
629b3d75 MJ |
57 | #include "omp-general.h" |
58 | #include "omp-expand.h" | |
4484a35a | 59 | #include "tree-cfgcleanup.h" |
710ee218 | 60 | #include "gimplify.h" |
26e5d47d | 61 | #include "attribs.h" |
d9b950dd | 62 | #include "selftest.h" |
45b2222a | 63 | #include "opts.h" |
6de9cd9a DN |
64 | |
65 | /* This file contains functions for building the Control Flow Graph (CFG) | |
66 | for a function tree. */ | |
67 | ||
68 | /* Local declarations. */ | |
69 | ||
70 | /* Initial capacity for the basic block array. */ | |
71 | static const int initial_cfg_capacity = 20; | |
72 | ||
d6be0d7f JL |
73 | /* This hash table allows us to efficiently lookup all CASE_LABEL_EXPRs |
74 | which use a particular edge. The CASE_LABEL_EXPRs are chained together | |
308e3ba6 | 75 | via their CASE_CHAIN field, which we clear after we're done with the |
726a989a | 76 | hash table to prevent problems with duplication of GIMPLE_SWITCHes. |
92b6dff3 | 77 | |
d6be0d7f JL |
78 | Access to this list of CASE_LABEL_EXPRs allows us to efficiently |
79 | update the case vector in response to edge redirections. | |
92b6dff3 | 80 | |
d6be0d7f JL |
81 | Right now this table is set up and torn down at key points in the |
82 | compilation process. It would be nice if we could make the table | |
83 | more persistent. The key is getting notification of changes to | |
84 | the CFG (particularly edge removal, creation and redirection). */ | |
85 | ||
b787e7a2 | 86 | static hash_map<edge, tree> *edge_to_cases; |
92b6dff3 | 87 | |
fc249fe5 MM |
88 | /* If we record edge_to_cases, this bitmap will hold indexes |
89 | of basic blocks that end in a GIMPLE_SWITCH which we touched | |
90 | due to edge manipulations. */ | |
91 | ||
92 | static bitmap touched_switch_bbs; | |
93 | ||
6de9cd9a DN |
94 | /* CFG statistics. */ |
95 | struct cfg_stats_d | |
96 | { | |
97 | long num_merged_labels; | |
98 | }; | |
99 | ||
100 | static struct cfg_stats_d cfg_stats; | |
101 | ||
710ee218 CP |
102 | /* Data to pass to replace_block_vars_by_duplicates_1. */ |
103 | struct replace_decls_d | |
104 | { | |
105 | hash_map<tree, tree> *vars_map; | |
106 | tree to_context; | |
107 | }; | |
108 | ||
6c52e687 CC |
109 | /* Hash table to store last discriminator assigned for each locus. */ |
110 | struct locus_discrim_map | |
111 | { | |
112 | location_t locus; | |
113 | int discriminator; | |
114 | }; | |
4a8fb1a1 LC |
115 | |
116 | /* Hashtable helpers. */ | |
117 | ||
95fbe13e | 118 | struct locus_discrim_hasher : free_ptr_hash <locus_discrim_map> |
4a8fb1a1 | 119 | { |
67f58944 TS |
120 | static inline hashval_t hash (const locus_discrim_map *); |
121 | static inline bool equal (const locus_discrim_map *, | |
122 | const locus_discrim_map *); | |
4a8fb1a1 LC |
123 | }; |
124 | ||
125 | /* Trivial hash function for a location_t. ITEM is a pointer to | |
126 | a hash table entry that maps a location_t to a discriminator. */ | |
127 | ||
128 | inline hashval_t | |
67f58944 | 129 | locus_discrim_hasher::hash (const locus_discrim_map *item) |
4a8fb1a1 | 130 | { |
25e25c73 | 131 | return LOCATION_LINE (item->locus); |
4a8fb1a1 LC |
132 | } |
133 | ||
134 | /* Equality function for the locus-to-discriminator map. A and B | |
135 | point to the two hash table entries to compare. */ | |
136 | ||
137 | inline bool | |
67f58944 TS |
138 | locus_discrim_hasher::equal (const locus_discrim_map *a, |
139 | const locus_discrim_map *b) | |
4a8fb1a1 | 140 | { |
25e25c73 | 141 | return LOCATION_LINE (a->locus) == LOCATION_LINE (b->locus); |
4a8fb1a1 LC |
142 | } |
143 | ||
c203e8a7 | 144 | static hash_table<locus_discrim_hasher> *discriminator_per_locus; |
6c52e687 | 145 | |
6de9cd9a | 146 | /* Basic blocks and flowgraphs. */ |
726a989a | 147 | static void make_blocks (gimple_seq); |
6de9cd9a DN |
148 | |
149 | /* Edges. */ | |
150 | static void make_edges (void); | |
25e25c73 | 151 | static void assign_discriminators (void); |
6de9cd9a | 152 | static void make_cond_expr_edges (basic_block); |
538dd0b7 | 153 | static void make_gimple_switch_edges (gswitch *, basic_block); |
09b22f48 | 154 | static bool make_goto_expr_edges (basic_block); |
1c384bf1 | 155 | static void make_gimple_asm_edges (basic_block); |
726a989a RB |
156 | static edge gimple_redirect_edge_and_branch (edge, basic_block); |
157 | static edge gimple_try_redirect_by_replacing_jump (edge, basic_block); | |
6de9cd9a DN |
158 | |
159 | /* Various helpers. */ | |
355fe088 | 160 | static inline bool stmt_starts_bb_p (gimple *, gimple *); |
726a989a RB |
161 | static int gimple_verify_flow_info (void); |
162 | static void gimple_make_forwarder_block (edge); | |
355fe088 | 163 | static gimple *first_non_label_stmt (basic_block); |
538dd0b7 | 164 | static bool verify_gimple_transaction (gtransaction *); |
355fe088 | 165 | static bool call_can_make_abnormal_goto (gimple *); |
6de9cd9a DN |
166 | |
167 | /* Flowgraph optimization and cleanup. */ | |
726a989a RB |
168 | static void gimple_merge_blocks (basic_block, basic_block); |
169 | static bool gimple_can_merge_blocks_p (basic_block, basic_block); | |
6de9cd9a | 170 | static void remove_bb (basic_block); |
be477406 | 171 | static edge find_taken_edge_computed_goto (basic_block, tree); |
6de9cd9a | 172 | static edge find_taken_edge_cond_expr (basic_block, tree); |
538dd0b7 DM |
173 | static edge find_taken_edge_switch_expr (gswitch *, basic_block, tree); |
174 | static tree find_case_label_for_value (gswitch *, tree); | |
1ee62b92 | 175 | static void lower_phi_internal_fn (); |
6de9cd9a | 176 | |
a930a4ef | 177 | void |
9defb1fe | 178 | init_empty_tree_cfg_for_function (struct function *fn) |
a930a4ef JH |
179 | { |
180 | /* Initialize the basic block array. */ | |
9defb1fe | 181 | init_flow (fn); |
ea19eb9f | 182 | profile_status_for_fn (fn) = PROFILE_ABSENT; |
0cae8d31 | 183 | n_basic_blocks_for_fn (fn) = NUM_FIXED_BLOCKS; |
3986e690 | 184 | last_basic_block_for_fn (fn) = NUM_FIXED_BLOCKS; |
bbd79259 DM |
185 | vec_alloc (basic_block_info_for_fn (fn), initial_cfg_capacity); |
186 | vec_safe_grow_cleared (basic_block_info_for_fn (fn), | |
a590ac65 | 187 | initial_cfg_capacity); |
a930a4ef JH |
188 | |
189 | /* Build a mapping of labels to their associated blocks. */ | |
3e248e06 DM |
190 | vec_alloc (label_to_block_map_for_fn (fn), initial_cfg_capacity); |
191 | vec_safe_grow_cleared (label_to_block_map_for_fn (fn), | |
a590ac65 | 192 | initial_cfg_capacity); |
a930a4ef | 193 | |
bbd79259 DM |
194 | SET_BASIC_BLOCK_FOR_FN (fn, ENTRY_BLOCK, ENTRY_BLOCK_PTR_FOR_FN (fn)); |
195 | SET_BASIC_BLOCK_FOR_FN (fn, EXIT_BLOCK, EXIT_BLOCK_PTR_FOR_FN (fn)); | |
9defb1fe | 196 | |
fefa31b5 DM |
197 | ENTRY_BLOCK_PTR_FOR_FN (fn)->next_bb |
198 | = EXIT_BLOCK_PTR_FOR_FN (fn); | |
199 | EXIT_BLOCK_PTR_FOR_FN (fn)->prev_bb | |
200 | = ENTRY_BLOCK_PTR_FOR_FN (fn); | |
9defb1fe DN |
201 | } |
202 | ||
203 | void | |
204 | init_empty_tree_cfg (void) | |
205 | { | |
206 | init_empty_tree_cfg_for_function (cfun); | |
a930a4ef | 207 | } |
6de9cd9a DN |
208 | |
209 | /*--------------------------------------------------------------------------- | |
210 | Create basic blocks | |
211 | ---------------------------------------------------------------------------*/ | |
212 | ||
726a989a | 213 | /* Entry point to the CFG builder for trees. SEQ is the sequence of |
6de9cd9a DN |
214 | statements to be added to the flowgraph. */ |
215 | ||
216 | static void | |
726a989a | 217 | build_gimple_cfg (gimple_seq seq) |
6de9cd9a | 218 | { |
726a989a RB |
219 | /* Register specific gimple functions. */ |
220 | gimple_register_cfg_hooks (); | |
6de9cd9a | 221 | |
6de9cd9a DN |
222 | memset ((void *) &cfg_stats, 0, sizeof (cfg_stats)); |
223 | ||
a930a4ef | 224 | init_empty_tree_cfg (); |
6de9cd9a | 225 | |
726a989a | 226 | make_blocks (seq); |
6de9cd9a | 227 | |
f0b698c1 | 228 | /* Make sure there is always at least one block, even if it's empty. */ |
0cae8d31 | 229 | if (n_basic_blocks_for_fn (cfun) == NUM_FIXED_BLOCKS) |
fefa31b5 | 230 | create_empty_bb (ENTRY_BLOCK_PTR_FOR_FN (cfun)); |
6de9cd9a | 231 | |
6de9cd9a | 232 | /* Adjust the size of the array. */ |
c5f05f68 DM |
233 | if (basic_block_info_for_fn (cfun)->length () |
234 | < (size_t) n_basic_blocks_for_fn (cfun)) | |
235 | vec_safe_grow_cleared (basic_block_info_for_fn (cfun), | |
236 | n_basic_blocks_for_fn (cfun)); | |
6de9cd9a | 237 | |
f667741c SB |
238 | /* To speed up statement iterator walks, we first purge dead labels. */ |
239 | cleanup_dead_labels (); | |
240 | ||
241 | /* Group case nodes to reduce the number of edges. | |
242 | We do this after cleaning up dead labels because otherwise we miss | |
243 | a lot of obvious case merging opportunities. */ | |
244 | group_case_labels (); | |
245 | ||
6de9cd9a | 246 | /* Create the edges of the flowgraph. */ |
c203e8a7 | 247 | discriminator_per_locus = new hash_table<locus_discrim_hasher> (13); |
6de9cd9a | 248 | make_edges (); |
25e25c73 | 249 | assign_discriminators (); |
1ee62b92 | 250 | lower_phi_internal_fn (); |
8b11009b | 251 | cleanup_dead_labels (); |
c203e8a7 TS |
252 | delete discriminator_per_locus; |
253 | discriminator_per_locus = NULL; | |
6de9cd9a DN |
254 | } |
255 | ||
8a9b4fa1 EB |
256 | /* Look for ANNOTATE calls with loop annotation kind in BB; if found, remove |
257 | them and propagate the information to LOOP. We assume that the annotations | |
258 | come immediately before the condition in BB, if any. */ | |
259 | ||
260 | static void | |
261 | replace_loop_annotate_in_block (basic_block bb, struct loop *loop) | |
262 | { | |
263 | gimple_stmt_iterator gsi = gsi_last_bb (bb); | |
355fe088 | 264 | gimple *stmt = gsi_stmt (gsi); |
8a9b4fa1 EB |
265 | |
266 | if (!(stmt && gimple_code (stmt) == GIMPLE_COND)) | |
267 | return; | |
268 | ||
269 | for (gsi_prev_nondebug (&gsi); !gsi_end_p (gsi); gsi_prev (&gsi)) | |
270 | { | |
271 | stmt = gsi_stmt (gsi); | |
272 | if (gimple_code (stmt) != GIMPLE_CALL) | |
273 | break; | |
274 | if (!gimple_call_internal_p (stmt) | |
275 | || gimple_call_internal_fn (stmt) != IFN_ANNOTATE) | |
276 | break; | |
277 | ||
278 | switch ((annot_expr_kind) tree_to_shwi (gimple_call_arg (stmt, 1))) | |
279 | { | |
280 | case annot_expr_ivdep_kind: | |
281 | loop->safelen = INT_MAX; | |
282 | break; | |
283 | case annot_expr_no_vector_kind: | |
284 | loop->dont_vectorize = true; | |
285 | break; | |
286 | case annot_expr_vector_kind: | |
287 | loop->force_vectorize = true; | |
288 | cfun->has_force_vectorize_loops = true; | |
289 | break; | |
290 | default: | |
291 | gcc_unreachable (); | |
292 | } | |
293 | ||
294 | stmt = gimple_build_assign (gimple_call_lhs (stmt), | |
295 | gimple_call_arg (stmt, 0)); | |
296 | gsi_replace (&gsi, stmt, true); | |
297 | } | |
298 | } | |
8170608b | 299 | |
718c4601 EB |
300 | /* Look for ANNOTATE calls with loop annotation kind; if found, remove |
301 | them and propagate the information to the loop. We assume that the | |
302 | annotations come immediately before the condition of the loop. */ | |
8170608b TB |
303 | |
304 | static void | |
8a9b4fa1 | 305 | replace_loop_annotate (void) |
8170608b TB |
306 | { |
307 | struct loop *loop; | |
8170608b TB |
308 | basic_block bb; |
309 | gimple_stmt_iterator gsi; | |
355fe088 | 310 | gimple *stmt; |
8170608b | 311 | |
f0bd40b1 | 312 | FOR_EACH_LOOP (loop, 0) |
8170608b | 313 | { |
8a9b4fa1 EB |
314 | /* First look into the header. */ |
315 | replace_loop_annotate_in_block (loop->header, loop); | |
316 | ||
317 | /* Then look into the latch, if any. */ | |
318 | if (loop->latch) | |
319 | replace_loop_annotate_in_block (loop->latch, loop); | |
8170608b TB |
320 | } |
321 | ||
718c4601 | 322 | /* Remove IFN_ANNOTATE. Safeguard for the case loop->latch == NULL. */ |
11cd3bed | 323 | FOR_EACH_BB_FN (bb, cfun) |
8170608b | 324 | { |
718c4601 EB |
325 | for (gsi = gsi_last_bb (bb); !gsi_end_p (gsi); gsi_prev (&gsi)) |
326 | { | |
327 | stmt = gsi_stmt (gsi); | |
328 | if (gimple_code (stmt) != GIMPLE_CALL) | |
8a9b4fa1 | 329 | continue; |
718c4601 EB |
330 | if (!gimple_call_internal_p (stmt) |
331 | || gimple_call_internal_fn (stmt) != IFN_ANNOTATE) | |
8a9b4fa1 EB |
332 | continue; |
333 | ||
718c4601 EB |
334 | switch ((annot_expr_kind) tree_to_shwi (gimple_call_arg (stmt, 1))) |
335 | { | |
336 | case annot_expr_ivdep_kind: | |
337 | case annot_expr_no_vector_kind: | |
338 | case annot_expr_vector_kind: | |
339 | break; | |
340 | default: | |
341 | gcc_unreachable (); | |
342 | } | |
8a9b4fa1 | 343 | |
718c4601 EB |
344 | warning_at (gimple_location (stmt), 0, "ignoring loop annotation"); |
345 | stmt = gimple_build_assign (gimple_call_lhs (stmt), | |
346 | gimple_call_arg (stmt, 0)); | |
347 | gsi_replace (&gsi, stmt, true); | |
348 | } | |
8170608b TB |
349 | } |
350 | } | |
351 | ||
1ee62b92 PG |
352 | /* Lower internal PHI function from GIMPLE FE. */ |
353 | ||
354 | static void | |
355 | lower_phi_internal_fn () | |
356 | { | |
357 | basic_block bb, pred = NULL; | |
358 | gimple_stmt_iterator gsi; | |
359 | tree lhs; | |
360 | gphi *phi_node; | |
361 | gimple *stmt; | |
362 | ||
363 | /* After edge creation, handle __PHI function from GIMPLE FE. */ | |
364 | FOR_EACH_BB_FN (bb, cfun) | |
365 | { | |
00738904 | 366 | for (gsi = gsi_after_labels (bb); !gsi_end_p (gsi);) |
1ee62b92 PG |
367 | { |
368 | stmt = gsi_stmt (gsi); | |
369 | if (! gimple_call_internal_p (stmt, IFN_PHI)) | |
00738904 | 370 | break; |
1ee62b92 PG |
371 | |
372 | lhs = gimple_call_lhs (stmt); | |
373 | phi_node = create_phi_node (lhs, bb); | |
374 | ||
375 | /* Add arguments to the PHI node. */ | |
376 | for (unsigned i = 0; i < gimple_call_num_args (stmt); ++i) | |
377 | { | |
378 | tree arg = gimple_call_arg (stmt, i); | |
379 | if (TREE_CODE (arg) == LABEL_DECL) | |
380 | pred = label_to_block (arg); | |
381 | else | |
382 | { | |
383 | edge e = find_edge (pred, bb); | |
384 | add_phi_arg (phi_node, arg, e, UNKNOWN_LOCATION); | |
385 | } | |
386 | } | |
387 | ||
388 | gsi_remove (&gsi, true); | |
389 | } | |
390 | } | |
391 | } | |
8170608b | 392 | |
c2924966 | 393 | static unsigned int |
6de9cd9a DN |
394 | execute_build_cfg (void) |
395 | { | |
39ecc018 JH |
396 | gimple_seq body = gimple_body (current_function_decl); |
397 | ||
398 | build_gimple_cfg (body); | |
399 | gimple_set_body (current_function_decl, NULL); | |
cff7525f JH |
400 | if (dump_file && (dump_flags & TDF_DETAILS)) |
401 | { | |
402 | fprintf (dump_file, "Scope blocks:\n"); | |
403 | dump_scope_blocks (dump_file, dump_flags); | |
404 | } | |
a9e0d843 RB |
405 | cleanup_tree_cfg (); |
406 | loop_optimizer_init (AVOID_CFG_MODIFICATIONS); | |
8170608b | 407 | replace_loop_annotate (); |
c2924966 | 408 | return 0; |
6de9cd9a DN |
409 | } |
410 | ||
27a4cd48 DM |
411 | namespace { |
412 | ||
413 | const pass_data pass_data_build_cfg = | |
414 | { | |
415 | GIMPLE_PASS, /* type */ | |
416 | "cfg", /* name */ | |
417 | OPTGROUP_NONE, /* optinfo_flags */ | |
27a4cd48 DM |
418 | TV_TREE_CFG, /* tv_id */ |
419 | PROP_gimple_leh, /* properties_required */ | |
420 | ( PROP_cfg | PROP_loops ), /* properties_provided */ | |
421 | 0, /* properties_destroyed */ | |
422 | 0, /* todo_flags_start */ | |
3bea341f | 423 | 0, /* todo_flags_finish */ |
6de9cd9a DN |
424 | }; |
425 | ||
27a4cd48 DM |
426 | class pass_build_cfg : public gimple_opt_pass |
427 | { | |
428 | public: | |
c3284718 RS |
429 | pass_build_cfg (gcc::context *ctxt) |
430 | : gimple_opt_pass (pass_data_build_cfg, ctxt) | |
27a4cd48 DM |
431 | {} |
432 | ||
433 | /* opt_pass methods: */ | |
be55bfe6 | 434 | virtual unsigned int execute (function *) { return execute_build_cfg (); } |
27a4cd48 DM |
435 | |
436 | }; // class pass_build_cfg | |
437 | ||
438 | } // anon namespace | |
439 | ||
440 | gimple_opt_pass * | |
441 | make_pass_build_cfg (gcc::context *ctxt) | |
442 | { | |
443 | return new pass_build_cfg (ctxt); | |
444 | } | |
445 | ||
726a989a RB |
446 | |
447 | /* Return true if T is a computed goto. */ | |
448 | ||
09b22f48 | 449 | bool |
355fe088 | 450 | computed_goto_p (gimple *t) |
726a989a RB |
451 | { |
452 | return (gimple_code (t) == GIMPLE_GOTO | |
453 | && TREE_CODE (gimple_goto_dest (t)) != LABEL_DECL); | |
454 | } | |
455 | ||
ca4d2851 PB |
456 | /* Returns true if the sequence of statements STMTS only contains |
457 | a call to __builtin_unreachable (). */ | |
458 | ||
459 | bool | |
460 | gimple_seq_unreachable_p (gimple_seq stmts) | |
461 | { | |
462 | if (stmts == NULL) | |
463 | return false; | |
464 | ||
465 | gimple_stmt_iterator gsi = gsi_last (stmts); | |
466 | ||
467 | if (!gimple_call_builtin_p (gsi_stmt (gsi), BUILT_IN_UNREACHABLE)) | |
468 | return false; | |
469 | ||
470 | for (gsi_prev (&gsi); !gsi_end_p (gsi); gsi_prev (&gsi)) | |
471 | { | |
472 | gimple *stmt = gsi_stmt (gsi); | |
473 | if (gimple_code (stmt) != GIMPLE_LABEL | |
474 | && !is_gimple_debug (stmt) | |
475 | && !gimple_clobber_p (stmt)) | |
476 | return false; | |
477 | } | |
478 | return true; | |
479 | } | |
480 | ||
d8202b84 JJ |
481 | /* Returns true for edge E where e->src ends with a GIMPLE_COND and |
482 | the other edge points to a bb with just __builtin_unreachable (). | |
483 | I.e. return true for C->M edge in: | |
484 | <bb C>: | |
485 | ... | |
486 | if (something) | |
487 | goto <bb N>; | |
488 | else | |
489 | goto <bb M>; | |
490 | <bb N>: | |
491 | __builtin_unreachable (); | |
492 | <bb M>: */ | |
493 | ||
494 | bool | |
495 | assert_unreachable_fallthru_edge_p (edge e) | |
496 | { | |
497 | basic_block pred_bb = e->src; | |
355fe088 | 498 | gimple *last = last_stmt (pred_bb); |
d8202b84 JJ |
499 | if (last && gimple_code (last) == GIMPLE_COND) |
500 | { | |
501 | basic_block other_bb = EDGE_SUCC (pred_bb, 0)->dest; | |
502 | if (other_bb == e->dest) | |
503 | other_bb = EDGE_SUCC (pred_bb, 1)->dest; | |
504 | if (EDGE_COUNT (other_bb->succs) == 0) | |
ca4d2851 | 505 | return gimple_seq_unreachable_p (bb_seq (other_bb)); |
d8202b84 JJ |
506 | } |
507 | return false; | |
508 | } | |
509 | ||
726a989a | 510 | |
58041fe6 MJ |
511 | /* Initialize GF_CALL_CTRL_ALTERING flag, which indicates the call |
512 | could alter control flow except via eh. We initialize the flag at | |
513 | CFG build time and only ever clear it later. */ | |
514 | ||
515 | static void | |
355fe088 | 516 | gimple_call_initialize_ctrl_altering (gimple *stmt) |
58041fe6 MJ |
517 | { |
518 | int flags = gimple_call_flags (stmt); | |
519 | ||
520 | /* A call alters control flow if it can make an abnormal goto. */ | |
521 | if (call_can_make_abnormal_goto (stmt) | |
522 | /* A call also alters control flow if it does not return. */ | |
523 | || flags & ECF_NORETURN | |
524 | /* TM ending statements have backedges out of the transaction. | |
525 | Return true so we split the basic block containing them. | |
526 | Note that the TM_BUILTIN test is merely an optimization. */ | |
527 | || ((flags & ECF_TM_BUILTIN) | |
528 | && is_tm_ending_fndecl (gimple_call_fndecl (stmt))) | |
529 | /* BUILT_IN_RETURN call is same as return statement. */ | |
8ab78162 NS |
530 | || gimple_call_builtin_p (stmt, BUILT_IN_RETURN) |
531 | /* IFN_UNIQUE should be the last insn, to make checking for it | |
532 | as cheap as possible. */ | |
533 | || (gimple_call_internal_p (stmt) | |
534 | && gimple_call_internal_unique_p (stmt))) | |
58041fe6 MJ |
535 | gimple_call_set_ctrl_altering (stmt, true); |
536 | else | |
537 | gimple_call_set_ctrl_altering (stmt, false); | |
538 | } | |
539 | ||
540 | ||
8926e325 | 541 | /* Insert SEQ after BB and build a flowgraph. */ |
6de9cd9a | 542 | |
8926e325 TV |
543 | static basic_block |
544 | make_blocks_1 (gimple_seq seq, basic_block bb) | |
6de9cd9a | 545 | { |
726a989a | 546 | gimple_stmt_iterator i = gsi_start (seq); |
355fe088 | 547 | gimple *stmt = NULL; |
6de9cd9a | 548 | bool start_new_block = true; |
726a989a | 549 | bool first_stmt_of_seq = true; |
6de9cd9a | 550 | |
726a989a | 551 | while (!gsi_end_p (i)) |
6de9cd9a | 552 | { |
355fe088 | 553 | gimple *prev_stmt; |
6de9cd9a DN |
554 | |
555 | prev_stmt = stmt; | |
726a989a | 556 | stmt = gsi_stmt (i); |
6de9cd9a | 557 | |
58041fe6 MJ |
558 | if (stmt && is_gimple_call (stmt)) |
559 | gimple_call_initialize_ctrl_altering (stmt); | |
560 | ||
6de9cd9a DN |
561 | /* If the statement starts a new basic block or if we have determined |
562 | in a previous pass that we need to create a new block for STMT, do | |
563 | so now. */ | |
564 | if (start_new_block || stmt_starts_bb_p (stmt, prev_stmt)) | |
565 | { | |
726a989a | 566 | if (!first_stmt_of_seq) |
355a7673 | 567 | gsi_split_seq_before (&i, &seq); |
c4d281b2 | 568 | bb = create_basic_block (seq, bb); |
6de9cd9a DN |
569 | start_new_block = false; |
570 | } | |
571 | ||
572 | /* Now add STMT to BB and create the subgraphs for special statement | |
573 | codes. */ | |
726a989a | 574 | gimple_set_bb (stmt, bb); |
6de9cd9a | 575 | |
6de9cd9a DN |
576 | /* If STMT is a basic block terminator, set START_NEW_BLOCK for the |
577 | next iteration. */ | |
578 | if (stmt_ends_bb_p (stmt)) | |
54634841 RG |
579 | { |
580 | /* If the stmt can make abnormal goto use a new temporary | |
581 | for the assignment to the LHS. This makes sure the old value | |
582 | of the LHS is available on the abnormal edge. Otherwise | |
583 | we will end up with overlapping life-ranges for abnormal | |
584 | SSA names. */ | |
585 | if (gimple_has_lhs (stmt) | |
586 | && stmt_can_make_abnormal_goto (stmt) | |
587 | && is_gimple_reg_type (TREE_TYPE (gimple_get_lhs (stmt)))) | |
588 | { | |
589 | tree lhs = gimple_get_lhs (stmt); | |
b731b390 | 590 | tree tmp = create_tmp_var (TREE_TYPE (lhs)); |
355fe088 | 591 | gimple *s = gimple_build_assign (lhs, tmp); |
54634841 RG |
592 | gimple_set_location (s, gimple_location (stmt)); |
593 | gimple_set_block (s, gimple_block (stmt)); | |
594 | gimple_set_lhs (stmt, tmp); | |
595 | if (TREE_CODE (TREE_TYPE (tmp)) == COMPLEX_TYPE | |
596 | || TREE_CODE (TREE_TYPE (tmp)) == VECTOR_TYPE) | |
597 | DECL_GIMPLE_REG_P (tmp) = 1; | |
598 | gsi_insert_after (&i, s, GSI_SAME_STMT); | |
599 | } | |
600 | start_new_block = true; | |
601 | } | |
6de9cd9a | 602 | |
726a989a RB |
603 | gsi_next (&i); |
604 | first_stmt_of_seq = false; | |
6de9cd9a | 605 | } |
8926e325 | 606 | return bb; |
6de9cd9a DN |
607 | } |
608 | ||
8926e325 TV |
609 | /* Build a flowgraph for the sequence of stmts SEQ. */ |
610 | ||
611 | static void | |
612 | make_blocks (gimple_seq seq) | |
613 | { | |
614 | make_blocks_1 (seq, ENTRY_BLOCK_PTR_FOR_FN (cfun)); | |
615 | } | |
6de9cd9a DN |
616 | |
617 | /* Create and return a new empty basic block after bb AFTER. */ | |
618 | ||
619 | static basic_block | |
620 | create_bb (void *h, void *e, basic_block after) | |
621 | { | |
622 | basic_block bb; | |
623 | ||
1e128c5f | 624 | gcc_assert (!e); |
6de9cd9a | 625 | |
27fd69fa | 626 | /* Create and initialize a new basic block. Since alloc_block uses |
a9429e29 LB |
627 | GC allocation that clears memory to allocate a basic block, we do |
628 | not have to clear the newly allocated basic block here. */ | |
6de9cd9a | 629 | bb = alloc_block (); |
6de9cd9a | 630 | |
8b1c6fd7 | 631 | bb->index = last_basic_block_for_fn (cfun); |
6de9cd9a | 632 | bb->flags = BB_NEW; |
355a7673 | 633 | set_bb_seq (bb, h ? (gimple_seq) h : NULL); |
6de9cd9a DN |
634 | |
635 | /* Add the new block to the linked list of blocks. */ | |
636 | link_block (bb, after); | |
637 | ||
638 | /* Grow the basic block array if needed. */ | |
8b1c6fd7 DM |
639 | if ((size_t) last_basic_block_for_fn (cfun) |
640 | == basic_block_info_for_fn (cfun)->length ()) | |
6de9cd9a | 641 | { |
8b1c6fd7 DM |
642 | size_t new_size = |
643 | (last_basic_block_for_fn (cfun) | |
644 | + (last_basic_block_for_fn (cfun) + 3) / 4); | |
c5f05f68 | 645 | vec_safe_grow_cleared (basic_block_info_for_fn (cfun), new_size); |
6de9cd9a DN |
646 | } |
647 | ||
648 | /* Add the newly created block to the array. */ | |
8b1c6fd7 | 649 | SET_BASIC_BLOCK_FOR_FN (cfun, last_basic_block_for_fn (cfun), bb); |
6de9cd9a | 650 | |
0cae8d31 | 651 | n_basic_blocks_for_fn (cfun)++; |
8b1c6fd7 | 652 | last_basic_block_for_fn (cfun)++; |
6de9cd9a | 653 | |
6de9cd9a DN |
654 | return bb; |
655 | } | |
656 | ||
657 | ||
658 | /*--------------------------------------------------------------------------- | |
659 | Edge creation | |
660 | ---------------------------------------------------------------------------*/ | |
661 | ||
09b22f48 JJ |
662 | /* If basic block BB has an abnormal edge to a basic block |
663 | containing IFN_ABNORMAL_DISPATCHER internal call, return | |
664 | that the dispatcher's basic block, otherwise return NULL. */ | |
665 | ||
666 | basic_block | |
667 | get_abnormal_succ_dispatcher (basic_block bb) | |
668 | { | |
669 | edge e; | |
670 | edge_iterator ei; | |
671 | ||
672 | FOR_EACH_EDGE (e, ei, bb->succs) | |
673 | if ((e->flags & (EDGE_ABNORMAL | EDGE_EH)) == EDGE_ABNORMAL) | |
674 | { | |
675 | gimple_stmt_iterator gsi | |
676 | = gsi_start_nondebug_after_labels_bb (e->dest); | |
355fe088 | 677 | gimple *g = gsi_stmt (gsi); |
8e4284d0 | 678 | if (g && gimple_call_internal_p (g, IFN_ABNORMAL_DISPATCHER)) |
09b22f48 JJ |
679 | return e->dest; |
680 | } | |
681 | return NULL; | |
682 | } | |
683 | ||
684 | /* Helper function for make_edges. Create a basic block with | |
685 | with ABNORMAL_DISPATCHER internal call in it if needed, and | |
686 | create abnormal edges from BBS to it and from it to FOR_BB | |
687 | if COMPUTED_GOTO is false, otherwise factor the computed gotos. */ | |
688 | ||
689 | static void | |
690 | handle_abnormal_edges (basic_block *dispatcher_bbs, | |
691 | basic_block for_bb, int *bb_to_omp_idx, | |
692 | auto_vec<basic_block> *bbs, bool computed_goto) | |
693 | { | |
694 | basic_block *dispatcher = dispatcher_bbs + (computed_goto ? 1 : 0); | |
695 | unsigned int idx = 0; | |
696 | basic_block bb; | |
697 | bool inner = false; | |
698 | ||
699 | if (bb_to_omp_idx) | |
700 | { | |
701 | dispatcher = dispatcher_bbs + 2 * bb_to_omp_idx[for_bb->index]; | |
702 | if (bb_to_omp_idx[for_bb->index] != 0) | |
703 | inner = true; | |
704 | } | |
705 | ||
706 | /* If the dispatcher has been created already, then there are basic | |
707 | blocks with abnormal edges to it, so just make a new edge to | |
708 | for_bb. */ | |
709 | if (*dispatcher == NULL) | |
710 | { | |
711 | /* Check if there are any basic blocks that need to have | |
712 | abnormal edges to this dispatcher. If there are none, return | |
713 | early. */ | |
714 | if (bb_to_omp_idx == NULL) | |
715 | { | |
716 | if (bbs->is_empty ()) | |
717 | return; | |
718 | } | |
719 | else | |
720 | { | |
721 | FOR_EACH_VEC_ELT (*bbs, idx, bb) | |
722 | if (bb_to_omp_idx[bb->index] == bb_to_omp_idx[for_bb->index]) | |
723 | break; | |
724 | if (bb == NULL) | |
725 | return; | |
726 | } | |
727 | ||
728 | /* Create the dispatcher bb. */ | |
c4d281b2 | 729 | *dispatcher = create_basic_block (NULL, for_bb); |
09b22f48 JJ |
730 | if (computed_goto) |
731 | { | |
732 | /* Factor computed gotos into a common computed goto site. Also | |
733 | record the location of that site so that we can un-factor the | |
734 | gotos after we have converted back to normal form. */ | |
735 | gimple_stmt_iterator gsi = gsi_start_bb (*dispatcher); | |
736 | ||
737 | /* Create the destination of the factored goto. Each original | |
738 | computed goto will put its desired destination into this | |
739 | variable and jump to the label we create immediately below. */ | |
740 | tree var = create_tmp_var (ptr_type_node, "gotovar"); | |
741 | ||
742 | /* Build a label for the new block which will contain the | |
743 | factored computed goto. */ | |
744 | tree factored_label_decl | |
745 | = create_artificial_label (UNKNOWN_LOCATION); | |
355fe088 | 746 | gimple *factored_computed_goto_label |
09b22f48 JJ |
747 | = gimple_build_label (factored_label_decl); |
748 | gsi_insert_after (&gsi, factored_computed_goto_label, GSI_NEW_STMT); | |
749 | ||
750 | /* Build our new computed goto. */ | |
355fe088 | 751 | gimple *factored_computed_goto = gimple_build_goto (var); |
09b22f48 JJ |
752 | gsi_insert_after (&gsi, factored_computed_goto, GSI_NEW_STMT); |
753 | ||
754 | FOR_EACH_VEC_ELT (*bbs, idx, bb) | |
755 | { | |
756 | if (bb_to_omp_idx | |
757 | && bb_to_omp_idx[bb->index] != bb_to_omp_idx[for_bb->index]) | |
758 | continue; | |
759 | ||
760 | gsi = gsi_last_bb (bb); | |
355fe088 | 761 | gimple *last = gsi_stmt (gsi); |
09b22f48 JJ |
762 | |
763 | gcc_assert (computed_goto_p (last)); | |
764 | ||
765 | /* Copy the original computed goto's destination into VAR. */ | |
355fe088 | 766 | gimple *assignment |
09b22f48 JJ |
767 | = gimple_build_assign (var, gimple_goto_dest (last)); |
768 | gsi_insert_before (&gsi, assignment, GSI_SAME_STMT); | |
769 | ||
770 | edge e = make_edge (bb, *dispatcher, EDGE_FALLTHRU); | |
771 | e->goto_locus = gimple_location (last); | |
772 | gsi_remove (&gsi, true); | |
773 | } | |
774 | } | |
775 | else | |
776 | { | |
777 | tree arg = inner ? boolean_true_node : boolean_false_node; | |
355fe088 | 778 | gimple *g = gimple_build_call_internal (IFN_ABNORMAL_DISPATCHER, |
09b22f48 JJ |
779 | 1, arg); |
780 | gimple_stmt_iterator gsi = gsi_after_labels (*dispatcher); | |
781 | gsi_insert_after (&gsi, g, GSI_NEW_STMT); | |
782 | ||
783 | /* Create predecessor edges of the dispatcher. */ | |
784 | FOR_EACH_VEC_ELT (*bbs, idx, bb) | |
785 | { | |
786 | if (bb_to_omp_idx | |
787 | && bb_to_omp_idx[bb->index] != bb_to_omp_idx[for_bb->index]) | |
788 | continue; | |
789 | make_edge (bb, *dispatcher, EDGE_ABNORMAL); | |
790 | } | |
791 | } | |
792 | } | |
793 | ||
794 | make_edge (*dispatcher, for_bb, EDGE_ABNORMAL); | |
795 | } | |
796 | ||
8926e325 TV |
797 | /* Creates outgoing edges for BB. Returns 1 when it ends with an |
798 | computed goto, returns 2 when it ends with a statement that | |
799 | might return to this function via an nonlocal goto, otherwise | |
800 | return 0. Updates *PCUR_REGION with the OMP region this BB is in. */ | |
801 | ||
802 | static int | |
803 | make_edges_bb (basic_block bb, struct omp_region **pcur_region, int *pomp_index) | |
804 | { | |
355fe088 | 805 | gimple *last = last_stmt (bb); |
8926e325 TV |
806 | bool fallthru = false; |
807 | int ret = 0; | |
808 | ||
809 | if (!last) | |
810 | return ret; | |
811 | ||
812 | switch (gimple_code (last)) | |
813 | { | |
814 | case GIMPLE_GOTO: | |
815 | if (make_goto_expr_edges (bb)) | |
816 | ret = 1; | |
817 | fallthru = false; | |
818 | break; | |
819 | case GIMPLE_RETURN: | |
820 | { | |
821 | edge e = make_edge (bb, EXIT_BLOCK_PTR_FOR_FN (cfun), 0); | |
822 | e->goto_locus = gimple_location (last); | |
823 | fallthru = false; | |
824 | } | |
825 | break; | |
826 | case GIMPLE_COND: | |
827 | make_cond_expr_edges (bb); | |
828 | fallthru = false; | |
829 | break; | |
830 | case GIMPLE_SWITCH: | |
831 | make_gimple_switch_edges (as_a <gswitch *> (last), bb); | |
832 | fallthru = false; | |
833 | break; | |
834 | case GIMPLE_RESX: | |
835 | make_eh_edges (last); | |
836 | fallthru = false; | |
837 | break; | |
838 | case GIMPLE_EH_DISPATCH: | |
839 | fallthru = make_eh_dispatch_edges (as_a <geh_dispatch *> (last)); | |
840 | break; | |
841 | ||
842 | case GIMPLE_CALL: | |
843 | /* If this function receives a nonlocal goto, then we need to | |
844 | make edges from this call site to all the nonlocal goto | |
845 | handlers. */ | |
846 | if (stmt_can_make_abnormal_goto (last)) | |
847 | ret = 2; | |
848 | ||
849 | /* If this statement has reachable exception handlers, then | |
850 | create abnormal edges to them. */ | |
851 | make_eh_edges (last); | |
852 | ||
853 | /* BUILTIN_RETURN is really a return statement. */ | |
854 | if (gimple_call_builtin_p (last, BUILT_IN_RETURN)) | |
855 | { | |
856 | make_edge (bb, EXIT_BLOCK_PTR_FOR_FN (cfun), 0); | |
857 | fallthru = false; | |
858 | } | |
859 | /* Some calls are known not to return. */ | |
860 | else | |
865f7046 | 861 | fallthru = !gimple_call_noreturn_p (last); |
8926e325 TV |
862 | break; |
863 | ||
864 | case GIMPLE_ASSIGN: | |
865 | /* A GIMPLE_ASSIGN may throw internally and thus be considered | |
866 | control-altering. */ | |
867 | if (is_ctrl_altering_stmt (last)) | |
868 | make_eh_edges (last); | |
869 | fallthru = true; | |
870 | break; | |
871 | ||
872 | case GIMPLE_ASM: | |
873 | make_gimple_asm_edges (bb); | |
874 | fallthru = true; | |
875 | break; | |
876 | ||
877 | CASE_GIMPLE_OMP: | |
629b3d75 | 878 | fallthru = omp_make_gimple_edges (bb, pcur_region, pomp_index); |
8926e325 TV |
879 | break; |
880 | ||
881 | case GIMPLE_TRANSACTION: | |
882 | { | |
7c11b0fe RH |
883 | gtransaction *txn = as_a <gtransaction *> (last); |
884 | tree label1 = gimple_transaction_label_norm (txn); | |
885 | tree label2 = gimple_transaction_label_uninst (txn); | |
886 | ||
887 | if (label1) | |
888 | make_edge (bb, label_to_block (label1), EDGE_FALLTHRU); | |
889 | if (label2) | |
890 | make_edge (bb, label_to_block (label2), | |
891 | EDGE_TM_UNINSTRUMENTED | (label1 ? 0 : EDGE_FALLTHRU)); | |
892 | ||
893 | tree label3 = gimple_transaction_label_over (txn); | |
6549bdc6 RH |
894 | if (gimple_transaction_subcode (txn) |
895 | & (GTMA_HAVE_ABORT | GTMA_IS_OUTER)) | |
7c11b0fe RH |
896 | make_edge (bb, label_to_block (label3), EDGE_TM_ABORT); |
897 | ||
898 | fallthru = false; | |
8926e325 TV |
899 | } |
900 | break; | |
901 | ||
902 | default: | |
903 | gcc_assert (!stmt_ends_bb_p (last)); | |
904 | fallthru = true; | |
905 | break; | |
906 | } | |
907 | ||
908 | if (fallthru) | |
909 | make_edge (bb, bb->next_bb, EDGE_FALLTHRU); | |
910 | ||
911 | return ret; | |
912 | } | |
913 | ||
6de9cd9a DN |
914 | /* Join all the blocks in the flowgraph. */ |
915 | ||
916 | static void | |
917 | make_edges (void) | |
918 | { | |
919 | basic_block bb; | |
bed575d5 | 920 | struct omp_region *cur_region = NULL; |
09b22f48 JJ |
921 | auto_vec<basic_block> ab_edge_goto; |
922 | auto_vec<basic_block> ab_edge_call; | |
923 | int *bb_to_omp_idx = NULL; | |
924 | int cur_omp_region_idx = 0; | |
6de9cd9a DN |
925 | |
926 | /* Create an edge from entry to the first block with executable | |
927 | statements in it. */ | |
06e28de2 DM |
928 | make_edge (ENTRY_BLOCK_PTR_FOR_FN (cfun), |
929 | BASIC_BLOCK_FOR_FN (cfun, NUM_FIXED_BLOCKS), | |
fefa31b5 | 930 | EDGE_FALLTHRU); |
6de9cd9a | 931 | |
adb35797 | 932 | /* Traverse the basic block array placing edges. */ |
11cd3bed | 933 | FOR_EACH_BB_FN (bb, cfun) |
6de9cd9a | 934 | { |
8926e325 | 935 | int mer; |
6de9cd9a | 936 | |
09b22f48 JJ |
937 | if (bb_to_omp_idx) |
938 | bb_to_omp_idx[bb->index] = cur_omp_region_idx; | |
939 | ||
8926e325 TV |
940 | mer = make_edges_bb (bb, &cur_region, &cur_omp_region_idx); |
941 | if (mer == 1) | |
942 | ab_edge_goto.safe_push (bb); | |
943 | else if (mer == 2) | |
944 | ab_edge_call.safe_push (bb); | |
bed575d5 | 945 | |
8926e325 TV |
946 | if (cur_region && bb_to_omp_idx == NULL) |
947 | bb_to_omp_idx = XCNEWVEC (int, n_basic_blocks_for_fn (cfun)); | |
6de9cd9a DN |
948 | } |
949 | ||
09b22f48 JJ |
950 | /* Computed gotos are hell to deal with, especially if there are |
951 | lots of them with a large number of destinations. So we factor | |
952 | them to a common computed goto location before we build the | |
953 | edge list. After we convert back to normal form, we will un-factor | |
954 | the computed gotos since factoring introduces an unwanted jump. | |
955 | For non-local gotos and abnormal edges from calls to calls that return | |
956 | twice or forced labels, factor the abnormal edges too, by having all | |
957 | abnormal edges from the calls go to a common artificial basic block | |
958 | with ABNORMAL_DISPATCHER internal call and abnormal edges from that | |
959 | basic block to all forced labels and calls returning twice. | |
960 | We do this per-OpenMP structured block, because those regions | |
961 | are guaranteed to be single entry single exit by the standard, | |
962 | so it is not allowed to enter or exit such regions abnormally this way, | |
963 | thus all computed gotos, non-local gotos and setjmp/longjmp calls | |
964 | must not transfer control across SESE region boundaries. */ | |
965 | if (!ab_edge_goto.is_empty () || !ab_edge_call.is_empty ()) | |
966 | { | |
967 | gimple_stmt_iterator gsi; | |
968 | basic_block dispatcher_bb_array[2] = { NULL, NULL }; | |
969 | basic_block *dispatcher_bbs = dispatcher_bb_array; | |
970 | int count = n_basic_blocks_for_fn (cfun); | |
971 | ||
972 | if (bb_to_omp_idx) | |
973 | dispatcher_bbs = XCNEWVEC (basic_block, 2 * count); | |
974 | ||
975 | FOR_EACH_BB_FN (bb, cfun) | |
976 | { | |
977 | for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi)) | |
978 | { | |
538dd0b7 | 979 | glabel *label_stmt = dyn_cast <glabel *> (gsi_stmt (gsi)); |
09b22f48 JJ |
980 | tree target; |
981 | ||
538dd0b7 | 982 | if (!label_stmt) |
09b22f48 JJ |
983 | break; |
984 | ||
985 | target = gimple_label_label (label_stmt); | |
986 | ||
987 | /* Make an edge to every label block that has been marked as a | |
988 | potential target for a computed goto or a non-local goto. */ | |
989 | if (FORCED_LABEL (target)) | |
990 | handle_abnormal_edges (dispatcher_bbs, bb, bb_to_omp_idx, | |
991 | &ab_edge_goto, true); | |
992 | if (DECL_NONLOCAL (target)) | |
993 | { | |
994 | handle_abnormal_edges (dispatcher_bbs, bb, bb_to_omp_idx, | |
995 | &ab_edge_call, false); | |
996 | break; | |
997 | } | |
998 | } | |
999 | ||
1000 | if (!gsi_end_p (gsi) && is_gimple_debug (gsi_stmt (gsi))) | |
1001 | gsi_next_nondebug (&gsi); | |
1002 | if (!gsi_end_p (gsi)) | |
1003 | { | |
1004 | /* Make an edge to every setjmp-like call. */ | |
355fe088 | 1005 | gimple *call_stmt = gsi_stmt (gsi); |
09b22f48 JJ |
1006 | if (is_gimple_call (call_stmt) |
1007 | && ((gimple_call_flags (call_stmt) & ECF_RETURNS_TWICE) | |
1008 | || gimple_call_builtin_p (call_stmt, | |
1009 | BUILT_IN_SETJMP_RECEIVER))) | |
1010 | handle_abnormal_edges (dispatcher_bbs, bb, bb_to_omp_idx, | |
1011 | &ab_edge_call, false); | |
1012 | } | |
1013 | } | |
1014 | ||
1015 | if (bb_to_omp_idx) | |
1016 | XDELETE (dispatcher_bbs); | |
1017 | } | |
1018 | ||
1019 | XDELETE (bb_to_omp_idx); | |
1020 | ||
629b3d75 | 1021 | omp_free_regions (); |
6de9cd9a DN |
1022 | } |
1023 | ||
8926e325 TV |
1024 | /* Add SEQ after GSI. Start new bb after GSI, and created further bbs as |
1025 | needed. Returns true if new bbs were created. | |
1026 | Note: This is transitional code, and should not be used for new code. We | |
1027 | should be able to get rid of this by rewriting all target va-arg | |
1028 | gimplification hooks to use an interface gimple_build_cond_value as described | |
1029 | in https://gcc.gnu.org/ml/gcc-patches/2015-02/msg01194.html. */ | |
1030 | ||
1031 | bool | |
1032 | gimple_find_sub_bbs (gimple_seq seq, gimple_stmt_iterator *gsi) | |
1033 | { | |
355fe088 | 1034 | gimple *stmt = gsi_stmt (*gsi); |
8926e325 TV |
1035 | basic_block bb = gimple_bb (stmt); |
1036 | basic_block lastbb, afterbb; | |
1037 | int old_num_bbs = n_basic_blocks_for_fn (cfun); | |
1038 | edge e; | |
1039 | lastbb = make_blocks_1 (seq, bb); | |
1040 | if (old_num_bbs == n_basic_blocks_for_fn (cfun)) | |
1041 | return false; | |
1042 | e = split_block (bb, stmt); | |
1043 | /* Move e->dest to come after the new basic blocks. */ | |
1044 | afterbb = e->dest; | |
1045 | unlink_block (afterbb); | |
1046 | link_block (afterbb, lastbb); | |
1047 | redirect_edge_succ (e, bb->next_bb); | |
1048 | bb = bb->next_bb; | |
1049 | while (bb != afterbb) | |
1050 | { | |
1051 | struct omp_region *cur_region = NULL; | |
52261a21 JH |
1052 | profile_count cnt = profile_count::zero (); |
1053 | int freq = 0; | |
1054 | ||
8926e325 TV |
1055 | int cur_omp_region_idx = 0; |
1056 | int mer = make_edges_bb (bb, &cur_region, &cur_omp_region_idx); | |
1057 | gcc_assert (!mer && !cur_region); | |
1058 | add_bb_to_loop (bb, afterbb->loop_father); | |
52261a21 JH |
1059 | |
1060 | edge e; | |
1061 | edge_iterator ei; | |
1062 | FOR_EACH_EDGE (e, ei, bb->preds) | |
1063 | { | |
1064 | cnt += e->count; | |
1065 | freq += EDGE_FREQUENCY (e); | |
1066 | } | |
1067 | bb->count = cnt; | |
1068 | bb->frequency = freq; | |
1069 | tree_guess_outgoing_edge_probabilities (bb); | |
1070 | FOR_EACH_EDGE (e, ei, bb->succs) | |
1071 | e->count = bb->count.apply_probability (e->probability); | |
1072 | ||
8926e325 TV |
1073 | bb = bb->next_bb; |
1074 | } | |
1075 | return true; | |
1076 | } | |
1077 | ||
6c52e687 CC |
1078 | /* Find the next available discriminator value for LOCUS. The |
1079 | discriminator distinguishes among several basic blocks that | |
1080 | share a common locus, allowing for more accurate sample-based | |
1081 | profiling. */ | |
1082 | ||
1083 | static int | |
1084 | next_discriminator_for_locus (location_t locus) | |
1085 | { | |
1086 | struct locus_discrim_map item; | |
1087 | struct locus_discrim_map **slot; | |
1088 | ||
1089 | item.locus = locus; | |
1090 | item.discriminator = 0; | |
c203e8a7 | 1091 | slot = discriminator_per_locus->find_slot_with_hash ( |
25e25c73 | 1092 | &item, LOCATION_LINE (locus), INSERT); |
6c52e687 CC |
1093 | gcc_assert (slot); |
1094 | if (*slot == HTAB_EMPTY_ENTRY) | |
1095 | { | |
1096 | *slot = XNEW (struct locus_discrim_map); | |
1097 | gcc_assert (*slot); | |
1098 | (*slot)->locus = locus; | |
1099 | (*slot)->discriminator = 0; | |
1100 | } | |
1101 | (*slot)->discriminator++; | |
1102 | return (*slot)->discriminator; | |
1103 | } | |
1104 | ||
1105 | /* Return TRUE if LOCUS1 and LOCUS2 refer to the same source line. */ | |
1106 | ||
1107 | static bool | |
1108 | same_line_p (location_t locus1, location_t locus2) | |
1109 | { | |
1110 | expanded_location from, to; | |
1111 | ||
1112 | if (locus1 == locus2) | |
1113 | return true; | |
1114 | ||
1115 | from = expand_location (locus1); | |
1116 | to = expand_location (locus2); | |
1117 | ||
1118 | if (from.line != to.line) | |
1119 | return false; | |
1120 | if (from.file == to.file) | |
1121 | return true; | |
1122 | return (from.file != NULL | |
1123 | && to.file != NULL | |
ba78087b | 1124 | && filename_cmp (from.file, to.file) == 0); |
6c52e687 CC |
1125 | } |
1126 | ||
25e25c73 | 1127 | /* Assign discriminators to each basic block. */ |
6c52e687 CC |
1128 | |
1129 | static void | |
25e25c73 | 1130 | assign_discriminators (void) |
6c52e687 | 1131 | { |
25e25c73 | 1132 | basic_block bb; |
6c52e687 | 1133 | |
11cd3bed | 1134 | FOR_EACH_BB_FN (bb, cfun) |
25e25c73 DC |
1135 | { |
1136 | edge e; | |
1137 | edge_iterator ei; | |
355fe088 | 1138 | gimple *last = last_stmt (bb); |
25e25c73 | 1139 | location_t locus = last ? gimple_location (last) : UNKNOWN_LOCATION; |
6c52e687 | 1140 | |
25e25c73 DC |
1141 | if (locus == UNKNOWN_LOCATION) |
1142 | continue; | |
1143 | ||
1144 | FOR_EACH_EDGE (e, ei, bb->succs) | |
1145 | { | |
355fe088 TS |
1146 | gimple *first = first_non_label_stmt (e->dest); |
1147 | gimple *last = last_stmt (e->dest); | |
25e25c73 DC |
1148 | if ((first && same_line_p (locus, gimple_location (first))) |
1149 | || (last && same_line_p (locus, gimple_location (last)))) | |
1150 | { | |
1151 | if (e->dest->discriminator != 0 && bb->discriminator == 0) | |
1152 | bb->discriminator = next_discriminator_for_locus (locus); | |
1153 | else | |
1154 | e->dest->discriminator = next_discriminator_for_locus (locus); | |
1155 | } | |
1156 | } | |
1157 | } | |
6c52e687 | 1158 | } |
6de9cd9a | 1159 | |
726a989a | 1160 | /* Create the edges for a GIMPLE_COND starting at block BB. */ |
6de9cd9a DN |
1161 | |
1162 | static void | |
1163 | make_cond_expr_edges (basic_block bb) | |
1164 | { | |
538dd0b7 | 1165 | gcond *entry = as_a <gcond *> (last_stmt (bb)); |
355fe088 | 1166 | gimple *then_stmt, *else_stmt; |
6de9cd9a DN |
1167 | basic_block then_bb, else_bb; |
1168 | tree then_label, else_label; | |
d783b2a2 | 1169 | edge e; |
6de9cd9a | 1170 | |
1e128c5f | 1171 | gcc_assert (entry); |
726a989a | 1172 | gcc_assert (gimple_code (entry) == GIMPLE_COND); |
6de9cd9a DN |
1173 | |
1174 | /* Entry basic blocks for each component. */ | |
726a989a RB |
1175 | then_label = gimple_cond_true_label (entry); |
1176 | else_label = gimple_cond_false_label (entry); | |
6de9cd9a DN |
1177 | then_bb = label_to_block (then_label); |
1178 | else_bb = label_to_block (else_label); | |
726a989a RB |
1179 | then_stmt = first_stmt (then_bb); |
1180 | else_stmt = first_stmt (else_bb); | |
6de9cd9a | 1181 | |
d783b2a2 | 1182 | e = make_edge (bb, then_bb, EDGE_TRUE_VALUE); |
726a989a | 1183 | e->goto_locus = gimple_location (then_stmt); |
d783b2a2 JH |
1184 | e = make_edge (bb, else_bb, EDGE_FALSE_VALUE); |
1185 | if (e) | |
25e25c73 | 1186 | e->goto_locus = gimple_location (else_stmt); |
a9b77cd1 | 1187 | |
726a989a RB |
1188 | /* We do not need the labels anymore. */ |
1189 | gimple_cond_set_true_label (entry, NULL_TREE); | |
1190 | gimple_cond_set_false_label (entry, NULL_TREE); | |
6de9cd9a DN |
1191 | } |
1192 | ||
92b6dff3 | 1193 | |
d6be0d7f JL |
1194 | /* Called for each element in the hash table (P) as we delete the |
1195 | edge to cases hash table. | |
1196 | ||
1a0c3c34 | 1197 | Clear all the CASE_CHAINs to prevent problems with copying of |
d6be0d7f JL |
1198 | SWITCH_EXPRs and structure sharing rules, then free the hash table |
1199 | element. */ | |
1200 | ||
b787e7a2 TS |
1201 | bool |
1202 | edge_to_cases_cleanup (edge const &, tree const &value, void *) | |
d6be0d7f | 1203 | { |
d6be0d7f JL |
1204 | tree t, next; |
1205 | ||
b787e7a2 | 1206 | for (t = value; t; t = next) |
d6be0d7f | 1207 | { |
1290e54c NF |
1208 | next = CASE_CHAIN (t); |
1209 | CASE_CHAIN (t) = NULL; | |
d6be0d7f | 1210 | } |
15814ba0 | 1211 | |
eb9f9259 | 1212 | return true; |
d6be0d7f JL |
1213 | } |
1214 | ||
1215 | /* Start recording information mapping edges to case labels. */ | |
1216 | ||
c9784e6d | 1217 | void |
d6be0d7f JL |
1218 | start_recording_case_labels (void) |
1219 | { | |
1220 | gcc_assert (edge_to_cases == NULL); | |
b787e7a2 | 1221 | edge_to_cases = new hash_map<edge, tree>; |
fc249fe5 | 1222 | touched_switch_bbs = BITMAP_ALLOC (NULL); |
d6be0d7f JL |
1223 | } |
1224 | ||
1225 | /* Return nonzero if we are recording information for case labels. */ | |
1226 | ||
1227 | static bool | |
1228 | recording_case_labels_p (void) | |
1229 | { | |
1230 | return (edge_to_cases != NULL); | |
1231 | } | |
1232 | ||
1233 | /* Stop recording information mapping edges to case labels and | |
1234 | remove any information we have recorded. */ | |
c9784e6d | 1235 | void |
d6be0d7f JL |
1236 | end_recording_case_labels (void) |
1237 | { | |
fc249fe5 MM |
1238 | bitmap_iterator bi; |
1239 | unsigned i; | |
b787e7a2 TS |
1240 | edge_to_cases->traverse<void *, edge_to_cases_cleanup> (NULL); |
1241 | delete edge_to_cases; | |
d6be0d7f | 1242 | edge_to_cases = NULL; |
fc249fe5 MM |
1243 | EXECUTE_IF_SET_IN_BITMAP (touched_switch_bbs, 0, i, bi) |
1244 | { | |
06e28de2 | 1245 | basic_block bb = BASIC_BLOCK_FOR_FN (cfun, i); |
fc249fe5 MM |
1246 | if (bb) |
1247 | { | |
355fe088 | 1248 | gimple *stmt = last_stmt (bb); |
fc249fe5 | 1249 | if (stmt && gimple_code (stmt) == GIMPLE_SWITCH) |
538dd0b7 | 1250 | group_case_labels_stmt (as_a <gswitch *> (stmt)); |
fc249fe5 MM |
1251 | } |
1252 | } | |
1253 | BITMAP_FREE (touched_switch_bbs); | |
d6be0d7f JL |
1254 | } |
1255 | ||
d6be0d7f JL |
1256 | /* If we are inside a {start,end}_recording_cases block, then return |
1257 | a chain of CASE_LABEL_EXPRs from T which reference E. | |
1258 | ||
1259 | Otherwise return NULL. */ | |
92b6dff3 JL |
1260 | |
1261 | static tree | |
538dd0b7 | 1262 | get_cases_for_edge (edge e, gswitch *t) |
92b6dff3 | 1263 | { |
b787e7a2 | 1264 | tree *slot; |
d6be0d7f | 1265 | size_t i, n; |
92b6dff3 | 1266 | |
d6be0d7f JL |
1267 | /* If we are not recording cases, then we do not have CASE_LABEL_EXPR |
1268 | chains available. Return NULL so the caller can detect this case. */ | |
1269 | if (!recording_case_labels_p ()) | |
1270 | return NULL; | |
6531d1be | 1271 | |
b787e7a2 | 1272 | slot = edge_to_cases->get (e); |
92b6dff3 | 1273 | if (slot) |
b787e7a2 | 1274 | return *slot; |
92b6dff3 | 1275 | |
d6be0d7f JL |
1276 | /* If we did not find E in the hash table, then this must be the first |
1277 | time we have been queried for information about E & T. Add all the | |
1278 | elements from T to the hash table then perform the query again. */ | |
92b6dff3 | 1279 | |
726a989a | 1280 | n = gimple_switch_num_labels (t); |
92b6dff3 JL |
1281 | for (i = 0; i < n; i++) |
1282 | { | |
726a989a | 1283 | tree elt = gimple_switch_label (t, i); |
15814ba0 | 1284 | tree lab = CASE_LABEL (elt); |
d6be0d7f | 1285 | basic_block label_bb = label_to_block (lab); |
15814ba0 PB |
1286 | edge this_edge = find_edge (e->src, label_bb); |
1287 | ||
1288 | /* Add it to the chain of CASE_LABEL_EXPRs referencing E, or create | |
1289 | a new chain. */ | |
b787e7a2 TS |
1290 | tree &s = edge_to_cases->get_or_insert (this_edge); |
1291 | CASE_CHAIN (elt) = s; | |
1292 | s = elt; | |
92b6dff3 | 1293 | } |
15814ba0 | 1294 | |
b787e7a2 | 1295 | return *edge_to_cases->get (e); |
92b6dff3 | 1296 | } |
6de9cd9a | 1297 | |
726a989a | 1298 | /* Create the edges for a GIMPLE_SWITCH starting at block BB. */ |
6de9cd9a DN |
1299 | |
1300 | static void | |
538dd0b7 | 1301 | make_gimple_switch_edges (gswitch *entry, basic_block bb) |
6de9cd9a | 1302 | { |
6de9cd9a | 1303 | size_t i, n; |
6de9cd9a | 1304 | |
726a989a | 1305 | n = gimple_switch_num_labels (entry); |
6de9cd9a DN |
1306 | |
1307 | for (i = 0; i < n; ++i) | |
1308 | { | |
726a989a | 1309 | tree lab = CASE_LABEL (gimple_switch_label (entry, i)); |
6de9cd9a | 1310 | basic_block label_bb = label_to_block (lab); |
d6be0d7f | 1311 | make_edge (bb, label_bb, 0); |
6de9cd9a DN |
1312 | } |
1313 | } | |
1314 | ||
1315 | ||
1316 | /* Return the basic block holding label DEST. */ | |
1317 | ||
1318 | basic_block | |
997de8ed | 1319 | label_to_block_fn (struct function *ifun, tree dest) |
6de9cd9a | 1320 | { |
242229bb JH |
1321 | int uid = LABEL_DECL_UID (dest); |
1322 | ||
f0b698c1 KH |
1323 | /* We would die hard when faced by an undefined label. Emit a label to |
1324 | the very first basic block. This will hopefully make even the dataflow | |
242229bb | 1325 | and undefined variable warnings quite right. */ |
1da2ed5f | 1326 | if (seen_error () && uid < 0) |
242229bb | 1327 | { |
06e28de2 DM |
1328 | gimple_stmt_iterator gsi = |
1329 | gsi_start_bb (BASIC_BLOCK_FOR_FN (cfun, NUM_FIXED_BLOCKS)); | |
355fe088 | 1330 | gimple *stmt; |
242229bb | 1331 | |
726a989a RB |
1332 | stmt = gimple_build_label (dest); |
1333 | gsi_insert_before (&gsi, stmt, GSI_NEW_STMT); | |
242229bb JH |
1334 | uid = LABEL_DECL_UID (dest); |
1335 | } | |
9771b263 | 1336 | if (vec_safe_length (ifun->cfg->x_label_to_block_map) <= (unsigned int) uid) |
98f464e0 | 1337 | return NULL; |
9771b263 | 1338 | return (*ifun->cfg->x_label_to_block_map)[uid]; |
6de9cd9a DN |
1339 | } |
1340 | ||
09b22f48 JJ |
1341 | /* Create edges for a goto statement at block BB. Returns true |
1342 | if abnormal edges should be created. */ | |
4f6c2131 | 1343 | |
09b22f48 | 1344 | static bool |
6de9cd9a DN |
1345 | make_goto_expr_edges (basic_block bb) |
1346 | { | |
726a989a | 1347 | gimple_stmt_iterator last = gsi_last_bb (bb); |
355fe088 | 1348 | gimple *goto_t = gsi_stmt (last); |
6de9cd9a | 1349 | |
4f6c2131 EB |
1350 | /* A simple GOTO creates normal edges. */ |
1351 | if (simple_goto_p (goto_t)) | |
6de9cd9a | 1352 | { |
726a989a | 1353 | tree dest = gimple_goto_dest (goto_t); |
6c52e687 CC |
1354 | basic_block label_bb = label_to_block (dest); |
1355 | edge e = make_edge (bb, label_bb, EDGE_FALLTHRU); | |
726a989a RB |
1356 | e->goto_locus = gimple_location (goto_t); |
1357 | gsi_remove (&last, true); | |
09b22f48 | 1358 | return false; |
6de9cd9a DN |
1359 | } |
1360 | ||
4f6c2131 | 1361 | /* A computed GOTO creates abnormal edges. */ |
09b22f48 | 1362 | return true; |
6de9cd9a DN |
1363 | } |
1364 | ||
1c384bf1 RH |
1365 | /* Create edges for an asm statement with labels at block BB. */ |
1366 | ||
1367 | static void | |
1368 | make_gimple_asm_edges (basic_block bb) | |
1369 | { | |
538dd0b7 | 1370 | gasm *stmt = as_a <gasm *> (last_stmt (bb)); |
1c384bf1 RH |
1371 | int i, n = gimple_asm_nlabels (stmt); |
1372 | ||
1373 | for (i = 0; i < n; ++i) | |
1374 | { | |
1375 | tree label = TREE_VALUE (gimple_asm_label_op (stmt, i)); | |
1376 | basic_block label_bb = label_to_block (label); | |
1377 | make_edge (bb, label_bb, 0); | |
1c384bf1 RH |
1378 | } |
1379 | } | |
6de9cd9a DN |
1380 | |
1381 | /*--------------------------------------------------------------------------- | |
1382 | Flowgraph analysis | |
1383 | ---------------------------------------------------------------------------*/ | |
1384 | ||
f698d217 SB |
1385 | /* Cleanup useless labels in basic blocks. This is something we wish |
1386 | to do early because it allows us to group case labels before creating | |
1387 | the edges for the CFG, and it speeds up block statement iterators in | |
1388 | all passes later on. | |
8b11009b ZD |
1389 | We rerun this pass after CFG is created, to get rid of the labels that |
1390 | are no longer referenced. After then we do not run it any more, since | |
1391 | (almost) no new labels should be created. */ | |
f698d217 SB |
1392 | |
1393 | /* A map from basic block index to the leading label of that block. */ | |
8b11009b ZD |
1394 | static struct label_record |
1395 | { | |
1396 | /* The label. */ | |
1397 | tree label; | |
1398 | ||
1399 | /* True if the label is referenced from somewhere. */ | |
1400 | bool used; | |
1401 | } *label_for_bb; | |
f698d217 | 1402 | |
242229bb | 1403 | /* Given LABEL return the first label in the same basic block. */ |
726a989a | 1404 | |
242229bb JH |
1405 | static tree |
1406 | main_block_label (tree label) | |
1407 | { | |
1408 | basic_block bb = label_to_block (label); | |
8b11009b | 1409 | tree main_label = label_for_bb[bb->index].label; |
242229bb JH |
1410 | |
1411 | /* label_to_block possibly inserted undefined label into the chain. */ | |
8b11009b ZD |
1412 | if (!main_label) |
1413 | { | |
1414 | label_for_bb[bb->index].label = label; | |
1415 | main_label = label; | |
1416 | } | |
1417 | ||
1418 | label_for_bb[bb->index].used = true; | |
1419 | return main_label; | |
242229bb JH |
1420 | } |
1421 | ||
1d65f45c RH |
1422 | /* Clean up redundant labels within the exception tree. */ |
1423 | ||
1424 | static void | |
1425 | cleanup_dead_labels_eh (void) | |
1426 | { | |
1427 | eh_landing_pad lp; | |
1428 | eh_region r; | |
1429 | tree lab; | |
1430 | int i; | |
1431 | ||
1432 | if (cfun->eh == NULL) | |
1433 | return; | |
1434 | ||
9771b263 | 1435 | for (i = 1; vec_safe_iterate (cfun->eh->lp_array, i, &lp); ++i) |
1d65f45c RH |
1436 | if (lp && lp->post_landing_pad) |
1437 | { | |
1438 | lab = main_block_label (lp->post_landing_pad); | |
1439 | if (lab != lp->post_landing_pad) | |
1440 | { | |
1441 | EH_LANDING_PAD_NR (lp->post_landing_pad) = 0; | |
1442 | EH_LANDING_PAD_NR (lab) = lp->index; | |
1443 | } | |
1444 | } | |
1445 | ||
1446 | FOR_ALL_EH_REGION (r) | |
1447 | switch (r->type) | |
1448 | { | |
1449 | case ERT_CLEANUP: | |
1450 | case ERT_MUST_NOT_THROW: | |
1451 | break; | |
1452 | ||
1453 | case ERT_TRY: | |
1454 | { | |
1455 | eh_catch c; | |
1456 | for (c = r->u.eh_try.first_catch; c ; c = c->next_catch) | |
1457 | { | |
1458 | lab = c->label; | |
1459 | if (lab) | |
1460 | c->label = main_block_label (lab); | |
1461 | } | |
1462 | } | |
1463 | break; | |
1464 | ||
1465 | case ERT_ALLOWED_EXCEPTIONS: | |
1466 | lab = r->u.allowed.label; | |
1467 | if (lab) | |
1468 | r->u.allowed.label = main_block_label (lab); | |
1469 | break; | |
1470 | } | |
1471 | } | |
1472 | ||
1473 | ||
b986ebf3 | 1474 | /* Cleanup redundant labels. This is a three-step process: |
f698d217 SB |
1475 | 1) Find the leading label for each block. |
1476 | 2) Redirect all references to labels to the leading labels. | |
1477 | 3) Cleanup all useless labels. */ | |
6de9cd9a | 1478 | |
165b54c3 | 1479 | void |
6de9cd9a DN |
1480 | cleanup_dead_labels (void) |
1481 | { | |
1482 | basic_block bb; | |
8b1c6fd7 | 1483 | label_for_bb = XCNEWVEC (struct label_record, last_basic_block_for_fn (cfun)); |
6de9cd9a DN |
1484 | |
1485 | /* Find a suitable label for each block. We use the first user-defined | |
f0b698c1 | 1486 | label if there is one, or otherwise just the first label we see. */ |
11cd3bed | 1487 | FOR_EACH_BB_FN (bb, cfun) |
6de9cd9a | 1488 | { |
726a989a | 1489 | gimple_stmt_iterator i; |
6de9cd9a | 1490 | |
726a989a | 1491 | for (i = gsi_start_bb (bb); !gsi_end_p (i); gsi_next (&i)) |
6de9cd9a | 1492 | { |
726a989a | 1493 | tree label; |
538dd0b7 | 1494 | glabel *label_stmt = dyn_cast <glabel *> (gsi_stmt (i)); |
6de9cd9a | 1495 | |
538dd0b7 | 1496 | if (!label_stmt) |
6de9cd9a DN |
1497 | break; |
1498 | ||
538dd0b7 | 1499 | label = gimple_label_label (label_stmt); |
6de9cd9a DN |
1500 | |
1501 | /* If we have not yet seen a label for the current block, | |
1502 | remember this one and see if there are more labels. */ | |
8b11009b | 1503 | if (!label_for_bb[bb->index].label) |
6de9cd9a | 1504 | { |
8b11009b | 1505 | label_for_bb[bb->index].label = label; |
6de9cd9a DN |
1506 | continue; |
1507 | } | |
1508 | ||
1509 | /* If we did see a label for the current block already, but it | |
1510 | is an artificially created label, replace it if the current | |
1511 | label is a user defined label. */ | |
8b11009b ZD |
1512 | if (!DECL_ARTIFICIAL (label) |
1513 | && DECL_ARTIFICIAL (label_for_bb[bb->index].label)) | |
6de9cd9a | 1514 | { |
8b11009b | 1515 | label_for_bb[bb->index].label = label; |
6de9cd9a DN |
1516 | break; |
1517 | } | |
1518 | } | |
1519 | } | |
1520 | ||
f698d217 SB |
1521 | /* Now redirect all jumps/branches to the selected label. |
1522 | First do so for each block ending in a control statement. */ | |
11cd3bed | 1523 | FOR_EACH_BB_FN (bb, cfun) |
6de9cd9a | 1524 | { |
355fe088 | 1525 | gimple *stmt = last_stmt (bb); |
0a35513e AH |
1526 | tree label, new_label; |
1527 | ||
6de9cd9a DN |
1528 | if (!stmt) |
1529 | continue; | |
1530 | ||
726a989a | 1531 | switch (gimple_code (stmt)) |
6de9cd9a | 1532 | { |
726a989a | 1533 | case GIMPLE_COND: |
538dd0b7 DM |
1534 | { |
1535 | gcond *cond_stmt = as_a <gcond *> (stmt); | |
1536 | label = gimple_cond_true_label (cond_stmt); | |
1537 | if (label) | |
1538 | { | |
1539 | new_label = main_block_label (label); | |
1540 | if (new_label != label) | |
1541 | gimple_cond_set_true_label (cond_stmt, new_label); | |
1542 | } | |
6de9cd9a | 1543 | |
538dd0b7 DM |
1544 | label = gimple_cond_false_label (cond_stmt); |
1545 | if (label) | |
1546 | { | |
1547 | new_label = main_block_label (label); | |
1548 | if (new_label != label) | |
1549 | gimple_cond_set_false_label (cond_stmt, new_label); | |
1550 | } | |
1551 | } | |
0a35513e | 1552 | break; |
6531d1be | 1553 | |
726a989a | 1554 | case GIMPLE_SWITCH: |
6de9cd9a | 1555 | { |
538dd0b7 DM |
1556 | gswitch *switch_stmt = as_a <gswitch *> (stmt); |
1557 | size_t i, n = gimple_switch_num_labels (switch_stmt); | |
6531d1be | 1558 | |
6de9cd9a DN |
1559 | /* Replace all destination labels. */ |
1560 | for (i = 0; i < n; ++i) | |
92b6dff3 | 1561 | { |
538dd0b7 | 1562 | tree case_label = gimple_switch_label (switch_stmt, i); |
0a35513e AH |
1563 | label = CASE_LABEL (case_label); |
1564 | new_label = main_block_label (label); | |
1565 | if (new_label != label) | |
1566 | CASE_LABEL (case_label) = new_label; | |
92b6dff3 | 1567 | } |
6de9cd9a DN |
1568 | break; |
1569 | } | |
1570 | ||
1c384bf1 RH |
1571 | case GIMPLE_ASM: |
1572 | { | |
538dd0b7 DM |
1573 | gasm *asm_stmt = as_a <gasm *> (stmt); |
1574 | int i, n = gimple_asm_nlabels (asm_stmt); | |
1c384bf1 RH |
1575 | |
1576 | for (i = 0; i < n; ++i) | |
1577 | { | |
538dd0b7 | 1578 | tree cons = gimple_asm_label_op (asm_stmt, i); |
1c384bf1 RH |
1579 | tree label = main_block_label (TREE_VALUE (cons)); |
1580 | TREE_VALUE (cons) = label; | |
1581 | } | |
1582 | break; | |
1583 | } | |
1584 | ||
726a989a | 1585 | /* We have to handle gotos until they're removed, and we don't |
f667741c | 1586 | remove them until after we've created the CFG edges. */ |
726a989a | 1587 | case GIMPLE_GOTO: |
0a35513e | 1588 | if (!computed_goto_p (stmt)) |
242229bb | 1589 | { |
538dd0b7 DM |
1590 | ggoto *goto_stmt = as_a <ggoto *> (stmt); |
1591 | label = gimple_goto_dest (goto_stmt); | |
0a35513e AH |
1592 | new_label = main_block_label (label); |
1593 | if (new_label != label) | |
538dd0b7 | 1594 | gimple_goto_set_dest (goto_stmt, new_label); |
242229bb | 1595 | } |
1c384bf1 | 1596 | break; |
f667741c | 1597 | |
0a35513e AH |
1598 | case GIMPLE_TRANSACTION: |
1599 | { | |
7c11b0fe RH |
1600 | gtransaction *txn = as_a <gtransaction *> (stmt); |
1601 | ||
1602 | label = gimple_transaction_label_norm (txn); | |
1603 | if (label) | |
1604 | { | |
1605 | new_label = main_block_label (label); | |
1606 | if (new_label != label) | |
1607 | gimple_transaction_set_label_norm (txn, new_label); | |
1608 | } | |
1609 | ||
1610 | label = gimple_transaction_label_uninst (txn); | |
1611 | if (label) | |
1612 | { | |
1613 | new_label = main_block_label (label); | |
1614 | if (new_label != label) | |
1615 | gimple_transaction_set_label_uninst (txn, new_label); | |
1616 | } | |
1617 | ||
1618 | label = gimple_transaction_label_over (txn); | |
0a35513e AH |
1619 | if (label) |
1620 | { | |
7c11b0fe | 1621 | new_label = main_block_label (label); |
0a35513e | 1622 | if (new_label != label) |
7c11b0fe | 1623 | gimple_transaction_set_label_over (txn, new_label); |
0a35513e AH |
1624 | } |
1625 | } | |
1626 | break; | |
1627 | ||
6de9cd9a DN |
1628 | default: |
1629 | break; | |
1630 | } | |
1631 | } | |
1632 | ||
1d65f45c RH |
1633 | /* Do the same for the exception region tree labels. */ |
1634 | cleanup_dead_labels_eh (); | |
f698d217 | 1635 | |
6de9cd9a | 1636 | /* Finally, purge dead labels. All user-defined labels and labels that |
cea0f4f1 AP |
1637 | can be the target of non-local gotos and labels which have their |
1638 | address taken are preserved. */ | |
11cd3bed | 1639 | FOR_EACH_BB_FN (bb, cfun) |
6de9cd9a | 1640 | { |
726a989a | 1641 | gimple_stmt_iterator i; |
8b11009b | 1642 | tree label_for_this_bb = label_for_bb[bb->index].label; |
6de9cd9a | 1643 | |
8b11009b | 1644 | if (!label_for_this_bb) |
6de9cd9a DN |
1645 | continue; |
1646 | ||
8b11009b ZD |
1647 | /* If the main label of the block is unused, we may still remove it. */ |
1648 | if (!label_for_bb[bb->index].used) | |
1649 | label_for_this_bb = NULL; | |
1650 | ||
726a989a | 1651 | for (i = gsi_start_bb (bb); !gsi_end_p (i); ) |
6de9cd9a | 1652 | { |
726a989a | 1653 | tree label; |
538dd0b7 | 1654 | glabel *label_stmt = dyn_cast <glabel *> (gsi_stmt (i)); |
6de9cd9a | 1655 | |
538dd0b7 | 1656 | if (!label_stmt) |
6de9cd9a DN |
1657 | break; |
1658 | ||
538dd0b7 | 1659 | label = gimple_label_label (label_stmt); |
6de9cd9a DN |
1660 | |
1661 | if (label == label_for_this_bb | |
726a989a | 1662 | || !DECL_ARTIFICIAL (label) |
cea0f4f1 AP |
1663 | || DECL_NONLOCAL (label) |
1664 | || FORCED_LABEL (label)) | |
726a989a | 1665 | gsi_next (&i); |
6de9cd9a | 1666 | else |
726a989a | 1667 | gsi_remove (&i, true); |
6de9cd9a DN |
1668 | } |
1669 | } | |
1670 | ||
1671 | free (label_for_bb); | |
1672 | } | |
1673 | ||
fc249fe5 MM |
1674 | /* Scan the sorted vector of cases in STMT (a GIMPLE_SWITCH) and combine |
1675 | the ones jumping to the same label. | |
f667741c SB |
1676 | Eg. three separate entries 1: 2: 3: become one entry 1..3: */ |
1677 | ||
238065a7 | 1678 | void |
538dd0b7 | 1679 | group_case_labels_stmt (gswitch *stmt) |
f667741c | 1680 | { |
fc249fe5 | 1681 | int old_size = gimple_switch_num_labels (stmt); |
9853cb28 | 1682 | int i, j, base_index, new_size = old_size; |
25632d2e | 1683 | basic_block default_bb = NULL; |
fc249fe5 | 1684 | |
fd8d363e | 1685 | default_bb = label_to_block (CASE_LABEL (gimple_switch_default_label (stmt))); |
f667741c | 1686 | |
fc249fe5 | 1687 | /* Look for possible opportunities to merge cases. */ |
fd8d363e | 1688 | i = 1; |
fc249fe5 | 1689 | while (i < old_size) |
f667741c | 1690 | { |
25632d2e SB |
1691 | tree base_case, base_high; |
1692 | basic_block base_bb; | |
1693 | ||
fc249fe5 MM |
1694 | base_case = gimple_switch_label (stmt, i); |
1695 | ||
1696 | gcc_assert (base_case); | |
25632d2e | 1697 | base_bb = label_to_block (CASE_LABEL (base_case)); |
fc249fe5 | 1698 | |
9853cb28 PB |
1699 | /* Discard cases that have the same destination as the default case. */ |
1700 | if (base_bb == default_bb) | |
fc249fe5 MM |
1701 | { |
1702 | gimple_switch_set_label (stmt, i, NULL_TREE); | |
1703 | i++; | |
1704 | new_size--; | |
1705 | continue; | |
1706 | } | |
1707 | ||
1708 | base_high = CASE_HIGH (base_case) | |
1709 | ? CASE_HIGH (base_case) | |
1710 | : CASE_LOW (base_case); | |
9853cb28 | 1711 | base_index = i++; |
fc249fe5 MM |
1712 | |
1713 | /* Try to merge case labels. Break out when we reach the end | |
1714 | of the label vector or when we cannot merge the next case | |
1715 | label with the current one. */ | |
1716 | while (i < old_size) | |
f667741c | 1717 | { |
fc249fe5 | 1718 | tree merge_case = gimple_switch_label (stmt, i); |
25632d2e | 1719 | basic_block merge_bb = label_to_block (CASE_LABEL (merge_case)); |
807e902e | 1720 | wide_int bhp1 = wi::add (base_high, 1); |
fc249fe5 MM |
1721 | |
1722 | /* Merge the cases if they jump to the same place, | |
1723 | and their ranges are consecutive. */ | |
25632d2e | 1724 | if (merge_bb == base_bb |
807e902e | 1725 | && wi::eq_p (CASE_LOW (merge_case), bhp1)) |
b7814a18 | 1726 | { |
fc249fe5 MM |
1727 | base_high = CASE_HIGH (merge_case) ? |
1728 | CASE_HIGH (merge_case) : CASE_LOW (merge_case); | |
1729 | CASE_HIGH (base_case) = base_high; | |
1730 | gimple_switch_set_label (stmt, i, NULL_TREE); | |
1731 | new_size--; | |
1732 | i++; | |
b7814a18 | 1733 | } |
726a989a | 1734 | else |
fc249fe5 MM |
1735 | break; |
1736 | } | |
9853cb28 PB |
1737 | |
1738 | /* Discard cases that have an unreachable destination block. */ | |
1739 | if (EDGE_COUNT (base_bb->succs) == 0 | |
1740 | && gimple_seq_unreachable_p (bb_seq (base_bb))) | |
1741 | { | |
1742 | edge base_edge = find_edge (gimple_bb (stmt), base_bb); | |
1743 | if (base_edge != NULL) | |
1744 | remove_edge_and_dominated_blocks (base_edge); | |
1745 | gimple_switch_set_label (stmt, base_index, NULL_TREE); | |
1746 | new_size--; | |
9853cb28 | 1747 | } |
fc249fe5 | 1748 | } |
31e9eea2 | 1749 | |
fc249fe5 MM |
1750 | /* Compress the case labels in the label vector, and adjust the |
1751 | length of the vector. */ | |
1752 | for (i = 0, j = 0; i < new_size; i++) | |
1753 | { | |
1754 | while (! gimple_switch_label (stmt, j)) | |
1755 | j++; | |
1756 | gimple_switch_set_label (stmt, i, | |
1757 | gimple_switch_label (stmt, j++)); | |
1758 | } | |
31e9eea2 | 1759 | |
fc249fe5 MM |
1760 | gcc_assert (new_size <= old_size); |
1761 | gimple_switch_set_num_labels (stmt, new_size); | |
1762 | } | |
726a989a | 1763 | |
fc249fe5 MM |
1764 | /* Look for blocks ending in a multiway branch (a GIMPLE_SWITCH), |
1765 | and scan the sorted vector of cases. Combine the ones jumping to the | |
1766 | same label. */ | |
f667741c | 1767 | |
fc249fe5 MM |
1768 | void |
1769 | group_case_labels (void) | |
1770 | { | |
1771 | basic_block bb; | |
726a989a | 1772 | |
11cd3bed | 1773 | FOR_EACH_BB_FN (bb, cfun) |
fc249fe5 | 1774 | { |
355fe088 | 1775 | gimple *stmt = last_stmt (bb); |
fc249fe5 | 1776 | if (stmt && gimple_code (stmt) == GIMPLE_SWITCH) |
538dd0b7 | 1777 | group_case_labels_stmt (as_a <gswitch *> (stmt)); |
f667741c SB |
1778 | } |
1779 | } | |
6de9cd9a DN |
1780 | |
1781 | /* Checks whether we can merge block B into block A. */ | |
1782 | ||
1783 | static bool | |
726a989a | 1784 | gimple_can_merge_blocks_p (basic_block a, basic_block b) |
6de9cd9a | 1785 | { |
355fe088 | 1786 | gimple *stmt; |
6de9cd9a | 1787 | |
c5cbcccf | 1788 | if (!single_succ_p (a)) |
6de9cd9a DN |
1789 | return false; |
1790 | ||
a315c44c | 1791 | if (single_succ_edge (a)->flags & EDGE_COMPLEX) |
6de9cd9a DN |
1792 | return false; |
1793 | ||
c5cbcccf | 1794 | if (single_succ (a) != b) |
6de9cd9a DN |
1795 | return false; |
1796 | ||
c5cbcccf | 1797 | if (!single_pred_p (b)) |
6de9cd9a DN |
1798 | return false; |
1799 | ||
2aa26a55 RB |
1800 | if (a == ENTRY_BLOCK_PTR_FOR_FN (cfun) |
1801 | || b == EXIT_BLOCK_PTR_FOR_FN (cfun)) | |
26e75214 | 1802 | return false; |
6531d1be | 1803 | |
6de9cd9a DN |
1804 | /* If A ends by a statement causing exceptions or something similar, we |
1805 | cannot merge the blocks. */ | |
726a989a | 1806 | stmt = last_stmt (a); |
6de9cd9a DN |
1807 | if (stmt && stmt_ends_bb_p (stmt)) |
1808 | return false; | |
1809 | ||
1810 | /* Do not allow a block with only a non-local label to be merged. */ | |
538dd0b7 DM |
1811 | if (stmt) |
1812 | if (glabel *label_stmt = dyn_cast <glabel *> (stmt)) | |
1813 | if (DECL_NONLOCAL (gimple_label_label (label_stmt))) | |
1814 | return false; | |
6de9cd9a | 1815 | |
8e7c5fdd | 1816 | /* Examine the labels at the beginning of B. */ |
538dd0b7 DM |
1817 | for (gimple_stmt_iterator gsi = gsi_start_bb (b); !gsi_end_p (gsi); |
1818 | gsi_next (&gsi)) | |
8e7c5fdd RH |
1819 | { |
1820 | tree lab; | |
538dd0b7 DM |
1821 | glabel *label_stmt = dyn_cast <glabel *> (gsi_stmt (gsi)); |
1822 | if (!label_stmt) | |
8e7c5fdd | 1823 | break; |
538dd0b7 | 1824 | lab = gimple_label_label (label_stmt); |
8e7c5fdd | 1825 | |
4a7ab00c JJ |
1826 | /* Do not remove user forced labels or for -O0 any user labels. */ |
1827 | if (!DECL_ARTIFICIAL (lab) && (!optimize || FORCED_LABEL (lab))) | |
8e7c5fdd RH |
1828 | return false; |
1829 | } | |
1830 | ||
93a95abe | 1831 | /* Protect simple loop latches. We only want to avoid merging |
2a58c802 RB |
1832 | the latch with the loop header or with a block in another |
1833 | loop in this case. */ | |
93a95abe RB |
1834 | if (current_loops |
1835 | && b->loop_father->latch == b | |
1836 | && loops_state_satisfies_p (LOOPS_HAVE_SIMPLE_LATCHES) | |
2a58c802 RB |
1837 | && (b->loop_father->header == a |
1838 | || b->loop_father != a->loop_father)) | |
8e7c5fdd RH |
1839 | return false; |
1840 | ||
38965eb2 | 1841 | /* It must be possible to eliminate all phi nodes in B. If ssa form |
610b64e2 RG |
1842 | is not up-to-date and a name-mapping is registered, we cannot eliminate |
1843 | any phis. Symbols marked for renaming are never a problem though. */ | |
538dd0b7 DM |
1844 | for (gphi_iterator gsi = gsi_start_phis (b); !gsi_end_p (gsi); |
1845 | gsi_next (&gsi)) | |
891f2df6 | 1846 | { |
538dd0b7 | 1847 | gphi *phi = gsi.phi (); |
891f2df6 RG |
1848 | /* Technically only new names matter. */ |
1849 | if (name_registered_for_update_p (PHI_RESULT (phi))) | |
1850 | return false; | |
1851 | } | |
6de9cd9a | 1852 | |
c87d6057 JJ |
1853 | /* When not optimizing, don't merge if we'd lose goto_locus. */ |
1854 | if (!optimize | |
1855 | && single_succ_edge (a)->goto_locus != UNKNOWN_LOCATION) | |
1856 | { | |
1857 | location_t goto_locus = single_succ_edge (a)->goto_locus; | |
1858 | gimple_stmt_iterator prev, next; | |
1859 | prev = gsi_last_nondebug_bb (a); | |
1860 | next = gsi_after_labels (b); | |
1861 | if (!gsi_end_p (next) && is_gimple_debug (gsi_stmt (next))) | |
1862 | gsi_next_nondebug (&next); | |
1863 | if ((gsi_end_p (prev) | |
1864 | || gimple_location (gsi_stmt (prev)) != goto_locus) | |
1865 | && (gsi_end_p (next) | |
1866 | || gimple_location (gsi_stmt (next)) != goto_locus)) | |
1867 | return false; | |
1868 | } | |
1869 | ||
6de9cd9a DN |
1870 | return true; |
1871 | } | |
1872 | ||
38965eb2 ZD |
1873 | /* Replaces all uses of NAME by VAL. */ |
1874 | ||
684aaf29 | 1875 | void |
38965eb2 ZD |
1876 | replace_uses_by (tree name, tree val) |
1877 | { | |
1878 | imm_use_iterator imm_iter; | |
1879 | use_operand_p use; | |
355fe088 | 1880 | gimple *stmt; |
38965eb2 | 1881 | edge e; |
38965eb2 | 1882 | |
6c00f606 | 1883 | FOR_EACH_IMM_USE_STMT (stmt, imm_iter, name) |
38965eb2 | 1884 | { |
efd2d3c8 RB |
1885 | /* Mark the block if we change the last stmt in it. */ |
1886 | if (cfgcleanup_altered_bbs | |
1887 | && stmt_ends_bb_p (stmt)) | |
1888 | bitmap_set_bit (cfgcleanup_altered_bbs, gimple_bb (stmt)->index); | |
1889 | ||
6c00f606 AM |
1890 | FOR_EACH_IMM_USE_ON_STMT (use, imm_iter) |
1891 | { | |
1892 | replace_exp (use, val); | |
38965eb2 | 1893 | |
726a989a | 1894 | if (gimple_code (stmt) == GIMPLE_PHI) |
38965eb2 | 1895 | { |
538dd0b7 DM |
1896 | e = gimple_phi_arg_edge (as_a <gphi *> (stmt), |
1897 | PHI_ARG_INDEX_FROM_USE (use)); | |
8c7b9094 RB |
1898 | if (e->flags & EDGE_ABNORMAL |
1899 | && !SSA_NAME_OCCURS_IN_ABNORMAL_PHI (val)) | |
6c00f606 AM |
1900 | { |
1901 | /* This can only occur for virtual operands, since | |
1902 | for the real ones SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name)) | |
1903 | would prevent replacement. */ | |
ea057359 | 1904 | gcc_checking_assert (virtual_operand_p (name)); |
6c00f606 AM |
1905 | SSA_NAME_OCCURS_IN_ABNORMAL_PHI (val) = 1; |
1906 | } | |
38965eb2 ZD |
1907 | } |
1908 | } | |
cfaab3a9 | 1909 | |
726a989a | 1910 | if (gimple_code (stmt) != GIMPLE_PHI) |
6c00f606 | 1911 | { |
e1ab3876 | 1912 | gimple_stmt_iterator gsi = gsi_for_stmt (stmt); |
355fe088 | 1913 | gimple *orig_stmt = stmt; |
726a989a | 1914 | size_t i; |
9af0df6b | 1915 | |
552d2db5 RG |
1916 | /* FIXME. It shouldn't be required to keep TREE_CONSTANT |
1917 | on ADDR_EXPRs up-to-date on GIMPLE. Propagation will | |
1918 | only change sth from non-invariant to invariant, and only | |
ef0d4c4d RG |
1919 | when propagating constants. */ |
1920 | if (is_gimple_min_invariant (val)) | |
552d2db5 RG |
1921 | for (i = 0; i < gimple_num_ops (stmt); i++) |
1922 | { | |
1923 | tree op = gimple_op (stmt, i); | |
1924 | /* Operands may be empty here. For example, the labels | |
1925 | of a GIMPLE_COND are nulled out following the creation | |
1926 | of the corresponding CFG edges. */ | |
1927 | if (op && TREE_CODE (op) == ADDR_EXPR) | |
1928 | recompute_tree_invariant_for_addr_expr (op); | |
1929 | } | |
1930 | ||
1931 | if (fold_stmt (&gsi)) | |
511b4436 JJ |
1932 | stmt = gsi_stmt (gsi); |
1933 | ||
77753f4d JJ |
1934 | if (maybe_clean_or_replace_eh_stmt (orig_stmt, stmt)) |
1935 | gimple_purge_dead_eh_edges (gimple_bb (stmt)); | |
9af0df6b | 1936 | |
cff4e50d | 1937 | update_stmt (stmt); |
6c00f606 | 1938 | } |
38965eb2 | 1939 | } |
6531d1be | 1940 | |
552d2db5 | 1941 | gcc_checking_assert (has_zero_uses (name)); |
d5ab5675 ZD |
1942 | |
1943 | /* Also update the trees stored in loop structures. */ | |
1944 | if (current_loops) | |
1945 | { | |
1946 | struct loop *loop; | |
1947 | ||
f0bd40b1 | 1948 | FOR_EACH_LOOP (loop, 0) |
d5ab5675 | 1949 | { |
42fd6772 | 1950 | substitute_in_loop_info (loop, name, val); |
d5ab5675 ZD |
1951 | } |
1952 | } | |
38965eb2 | 1953 | } |
6de9cd9a DN |
1954 | |
1955 | /* Merge block B into block A. */ | |
1956 | ||
1957 | static void | |
726a989a | 1958 | gimple_merge_blocks (basic_block a, basic_block b) |
6de9cd9a | 1959 | { |
538dd0b7 DM |
1960 | gimple_stmt_iterator last, gsi; |
1961 | gphi_iterator psi; | |
6de9cd9a DN |
1962 | |
1963 | if (dump_file) | |
1964 | fprintf (dump_file, "Merging blocks %d and %d\n", a->index, b->index); | |
1965 | ||
c4f548b8 DN |
1966 | /* Remove all single-valued PHI nodes from block B of the form |
1967 | V_i = PHI <V_j> by propagating V_j to all the uses of V_i. */ | |
726a989a | 1968 | gsi = gsi_last_bb (a); |
355a7673 | 1969 | for (psi = gsi_start_phis (b); !gsi_end_p (psi); ) |
38965eb2 | 1970 | { |
355fe088 | 1971 | gimple *phi = gsi_stmt (psi); |
726a989a | 1972 | tree def = gimple_phi_result (phi), use = gimple_phi_arg_def (phi, 0); |
355fe088 | 1973 | gimple *copy; |
ea057359 RG |
1974 | bool may_replace_uses = (virtual_operand_p (def) |
1975 | || may_propagate_copy (def, use)); | |
d7f0e25c | 1976 | |
7c8eb293 ZD |
1977 | /* In case we maintain loop closed ssa form, do not propagate arguments |
1978 | of loop exit phi nodes. */ | |
d7f0e25c | 1979 | if (current_loops |
f87000d0 | 1980 | && loops_state_satisfies_p (LOOP_CLOSED_SSA) |
ea057359 | 1981 | && !virtual_operand_p (def) |
d7f0e25c ZD |
1982 | && TREE_CODE (use) == SSA_NAME |
1983 | && a->loop_father != b->loop_father) | |
1984 | may_replace_uses = false; | |
1985 | ||
1986 | if (!may_replace_uses) | |
38965eb2 | 1987 | { |
ea057359 | 1988 | gcc_assert (!virtual_operand_p (def)); |
38965eb2 | 1989 | |
128a79fb | 1990 | /* Note that just emitting the copies is fine -- there is no problem |
38965eb2 ZD |
1991 | with ordering of phi nodes. This is because A is the single |
1992 | predecessor of B, therefore results of the phi nodes cannot | |
1993 | appear as arguments of the phi nodes. */ | |
726a989a RB |
1994 | copy = gimple_build_assign (def, use); |
1995 | gsi_insert_after (&gsi, copy, GSI_NEW_STMT); | |
1996 | remove_phi_node (&psi, false); | |
38965eb2 ZD |
1997 | } |
1998 | else | |
611021e1 | 1999 | { |
d0f76c4b RG |
2000 | /* If we deal with a PHI for virtual operands, we can simply |
2001 | propagate these without fussing with folding or updating | |
2002 | the stmt. */ | |
ea057359 | 2003 | if (virtual_operand_p (def)) |
d0f76c4b RG |
2004 | { |
2005 | imm_use_iterator iter; | |
2006 | use_operand_p use_p; | |
355fe088 | 2007 | gimple *stmt; |
d0f76c4b RG |
2008 | |
2009 | FOR_EACH_IMM_USE_STMT (stmt, iter, def) | |
2010 | FOR_EACH_IMM_USE_ON_STMT (use_p, iter) | |
2011 | SET_USE (use_p, use); | |
7686fb74 RG |
2012 | |
2013 | if (SSA_NAME_OCCURS_IN_ABNORMAL_PHI (def)) | |
2014 | SSA_NAME_OCCURS_IN_ABNORMAL_PHI (use) = 1; | |
d0f76c4b RG |
2015 | } |
2016 | else | |
2017 | replace_uses_by (def, use); | |
726a989a RB |
2018 | |
2019 | remove_phi_node (&psi, true); | |
611021e1 | 2020 | } |
38965eb2 ZD |
2021 | } |
2022 | ||
6de9cd9a DN |
2023 | /* Ensure that B follows A. */ |
2024 | move_block_after (b, a); | |
2025 | ||
c5cbcccf | 2026 | gcc_assert (single_succ_edge (a)->flags & EDGE_FALLTHRU); |
1e128c5f | 2027 | gcc_assert (!last_stmt (a) || !stmt_ends_bb_p (last_stmt (a))); |
6de9cd9a | 2028 | |
726a989a RB |
2029 | /* Remove labels from B and set gimple_bb to A for other statements. */ |
2030 | for (gsi = gsi_start_bb (b); !gsi_end_p (gsi);) | |
6de9cd9a | 2031 | { |
355fe088 | 2032 | gimple *stmt = gsi_stmt (gsi); |
538dd0b7 | 2033 | if (glabel *label_stmt = dyn_cast <glabel *> (stmt)) |
be477406 | 2034 | { |
538dd0b7 | 2035 | tree label = gimple_label_label (label_stmt); |
1d65f45c | 2036 | int lp_nr; |
726a989a RB |
2037 | |
2038 | gsi_remove (&gsi, false); | |
be477406 | 2039 | |
be477406 JL |
2040 | /* Now that we can thread computed gotos, we might have |
2041 | a situation where we have a forced label in block B | |
2042 | However, the label at the start of block B might still be | |
2043 | used in other ways (think about the runtime checking for | |
2044 | Fortran assigned gotos). So we can not just delete the | |
2045 | label. Instead we move the label to the start of block A. */ | |
1d65f45c | 2046 | if (FORCED_LABEL (label)) |
be477406 | 2047 | { |
726a989a | 2048 | gimple_stmt_iterator dest_gsi = gsi_start_bb (a); |
1d65f45c RH |
2049 | gsi_insert_before (&dest_gsi, stmt, GSI_NEW_STMT); |
2050 | } | |
5619e52c JJ |
2051 | /* Other user labels keep around in a form of a debug stmt. */ |
2052 | else if (!DECL_ARTIFICIAL (label) && MAY_HAVE_DEBUG_STMTS) | |
2053 | { | |
355fe088 TS |
2054 | gimple *dbg = gimple_build_debug_bind (label, |
2055 | integer_zero_node, | |
2056 | stmt); | |
5619e52c JJ |
2057 | gimple_debug_bind_reset_value (dbg); |
2058 | gsi_insert_before (&gsi, dbg, GSI_SAME_STMT); | |
2059 | } | |
1d65f45c RH |
2060 | |
2061 | lp_nr = EH_LANDING_PAD_NR (label); | |
2062 | if (lp_nr) | |
2063 | { | |
2064 | eh_landing_pad lp = get_eh_landing_pad_from_number (lp_nr); | |
2065 | lp->post_landing_pad = NULL; | |
be477406 JL |
2066 | } |
2067 | } | |
6de9cd9a DN |
2068 | else |
2069 | { | |
1d65f45c | 2070 | gimple_set_bb (stmt, a); |
726a989a | 2071 | gsi_next (&gsi); |
6de9cd9a DN |
2072 | } |
2073 | } | |
2074 | ||
2f6eed01 DC |
2075 | /* When merging two BBs, if their counts are different, the larger count |
2076 | is selected as the new bb count. This is to handle inconsistent | |
2077 | profiles. */ | |
47e78f98 DC |
2078 | if (a->loop_father == b->loop_father) |
2079 | { | |
2080 | a->count = MAX (a->count, b->count); | |
2081 | a->frequency = MAX (a->frequency, b->frequency); | |
2082 | } | |
2f6eed01 | 2083 | |
726a989a RB |
2084 | /* Merge the sequences. */ |
2085 | last = gsi_last_bb (a); | |
2086 | gsi_insert_seq_after (&last, bb_seq (b), GSI_NEW_STMT); | |
2087 | set_bb_seq (b, NULL); | |
672987e8 ZD |
2088 | |
2089 | if (cfgcleanup_altered_bbs) | |
2090 | bitmap_set_bit (cfgcleanup_altered_bbs, a->index); | |
6de9cd9a DN |
2091 | } |
2092 | ||
2093 | ||
bc23502b | 2094 | /* Return the one of two successors of BB that is not reachable by a |
2cd713a0 | 2095 | complex edge, if there is one. Else, return BB. We use |
bc23502b PB |
2096 | this in optimizations that use post-dominators for their heuristics, |
2097 | to catch the cases in C++ where function calls are involved. */ | |
6531d1be | 2098 | |
bc23502b | 2099 | basic_block |
6531d1be | 2100 | single_noncomplex_succ (basic_block bb) |
bc23502b PB |
2101 | { |
2102 | edge e0, e1; | |
2103 | if (EDGE_COUNT (bb->succs) != 2) | |
2104 | return bb; | |
6531d1be | 2105 | |
bc23502b PB |
2106 | e0 = EDGE_SUCC (bb, 0); |
2107 | e1 = EDGE_SUCC (bb, 1); | |
2108 | if (e0->flags & EDGE_COMPLEX) | |
2109 | return e1->dest; | |
2110 | if (e1->flags & EDGE_COMPLEX) | |
2111 | return e0->dest; | |
6531d1be | 2112 | |
bc23502b | 2113 | return bb; |
6531d1be | 2114 | } |
bc23502b | 2115 | |
6de9cd9a DN |
2116 | /* T is CALL_EXPR. Set current_function_calls_* flags. */ |
2117 | ||
2118 | void | |
538dd0b7 | 2119 | notice_special_calls (gcall *call) |
6de9cd9a | 2120 | { |
726a989a | 2121 | int flags = gimple_call_flags (call); |
6de9cd9a DN |
2122 | |
2123 | if (flags & ECF_MAY_BE_ALLOCA) | |
e3b5732b | 2124 | cfun->calls_alloca = true; |
6de9cd9a | 2125 | if (flags & ECF_RETURNS_TWICE) |
e3b5732b | 2126 | cfun->calls_setjmp = true; |
6de9cd9a DN |
2127 | } |
2128 | ||
2129 | ||
2130 | /* Clear flags set by notice_special_calls. Used by dead code removal | |
2131 | to update the flags. */ | |
2132 | ||
2133 | void | |
2134 | clear_special_calls (void) | |
2135 | { | |
e3b5732b JH |
2136 | cfun->calls_alloca = false; |
2137 | cfun->calls_setjmp = false; | |
6de9cd9a DN |
2138 | } |
2139 | ||
6de9cd9a DN |
2140 | /* Remove PHI nodes associated with basic block BB and all edges out of BB. */ |
2141 | ||
2142 | static void | |
2143 | remove_phi_nodes_and_edges_for_unreachable_block (basic_block bb) | |
2144 | { | |
6de9cd9a DN |
2145 | /* Since this block is no longer reachable, we can just delete all |
2146 | of its PHI nodes. */ | |
81b822d5 | 2147 | remove_phi_nodes (bb); |
6de9cd9a DN |
2148 | |
2149 | /* Remove edges to BB's successors. */ | |
628f6a4e | 2150 | while (EDGE_COUNT (bb->succs) > 0) |
d0d2cc21 | 2151 | remove_edge (EDGE_SUCC (bb, 0)); |
6de9cd9a DN |
2152 | } |
2153 | ||
2154 | ||
2155 | /* Remove statements of basic block BB. */ | |
2156 | ||
2157 | static void | |
2158 | remove_bb (basic_block bb) | |
2159 | { | |
726a989a | 2160 | gimple_stmt_iterator i; |
6de9cd9a DN |
2161 | |
2162 | if (dump_file) | |
2163 | { | |
2164 | fprintf (dump_file, "Removing basic block %d\n", bb->index); | |
2165 | if (dump_flags & TDF_DETAILS) | |
2166 | { | |
d00e4baa | 2167 | dump_bb (dump_file, bb, 0, TDF_BLOCKS); |
6de9cd9a DN |
2168 | fprintf (dump_file, "\n"); |
2169 | } | |
2170 | } | |
2171 | ||
2b271002 ZD |
2172 | if (current_loops) |
2173 | { | |
2174 | struct loop *loop = bb->loop_father; | |
2175 | ||
598ec7bd ZD |
2176 | /* If a loop gets removed, clean up the information associated |
2177 | with it. */ | |
2b271002 ZD |
2178 | if (loop->latch == bb |
2179 | || loop->header == bb) | |
adb7eaa2 | 2180 | free_numbers_of_iterations_estimates (loop); |
2b271002 ZD |
2181 | } |
2182 | ||
6de9cd9a | 2183 | /* Remove all the instructions in the block. */ |
726a989a | 2184 | if (bb_seq (bb) != NULL) |
6de9cd9a | 2185 | { |
b5b8b0ac AO |
2186 | /* Walk backwards so as to get a chance to substitute all |
2187 | released DEFs into debug stmts. See | |
2188 | eliminate_unnecessary_stmts() in tree-ssa-dce.c for more | |
2189 | details. */ | |
2190 | for (i = gsi_last_bb (bb); !gsi_end_p (i);) | |
77568960 | 2191 | { |
355fe088 | 2192 | gimple *stmt = gsi_stmt (i); |
538dd0b7 DM |
2193 | glabel *label_stmt = dyn_cast <glabel *> (stmt); |
2194 | if (label_stmt | |
2195 | && (FORCED_LABEL (gimple_label_label (label_stmt)) | |
2196 | || DECL_NONLOCAL (gimple_label_label (label_stmt)))) | |
7506e1cb ZD |
2197 | { |
2198 | basic_block new_bb; | |
726a989a | 2199 | gimple_stmt_iterator new_gsi; |
7506e1cb ZD |
2200 | |
2201 | /* A non-reachable non-local label may still be referenced. | |
2202 | But it no longer needs to carry the extra semantics of | |
2203 | non-locality. */ | |
538dd0b7 | 2204 | if (DECL_NONLOCAL (gimple_label_label (label_stmt))) |
7506e1cb | 2205 | { |
538dd0b7 DM |
2206 | DECL_NONLOCAL (gimple_label_label (label_stmt)) = 0; |
2207 | FORCED_LABEL (gimple_label_label (label_stmt)) = 1; | |
7506e1cb | 2208 | } |
bb1ecfe8 | 2209 | |
7506e1cb | 2210 | new_bb = bb->prev_bb; |
726a989a RB |
2211 | new_gsi = gsi_start_bb (new_bb); |
2212 | gsi_remove (&i, false); | |
2213 | gsi_insert_before (&new_gsi, stmt, GSI_NEW_STMT); | |
7506e1cb ZD |
2214 | } |
2215 | else | |
bb1ecfe8 | 2216 | { |
381cdae4 RB |
2217 | /* Release SSA definitions. */ |
2218 | release_defs (stmt); | |
726a989a | 2219 | gsi_remove (&i, true); |
bb1ecfe8 | 2220 | } |
6531d1be | 2221 | |
b5b8b0ac AO |
2222 | if (gsi_end_p (i)) |
2223 | i = gsi_last_bb (bb); | |
2224 | else | |
2225 | gsi_prev (&i); | |
43e05e45 | 2226 | } |
6de9cd9a DN |
2227 | } |
2228 | ||
6de9cd9a | 2229 | remove_phi_nodes_and_edges_for_unreachable_block (bb); |
3e8b732e MM |
2230 | bb->il.gimple.seq = NULL; |
2231 | bb->il.gimple.phi_nodes = NULL; | |
6de9cd9a DN |
2232 | } |
2233 | ||
6de9cd9a | 2234 | |
35920270 KH |
2235 | /* Given a basic block BB ending with COND_EXPR or SWITCH_EXPR, and a |
2236 | predicate VAL, return the edge that will be taken out of the block. | |
2237 | If VAL does not match a unique edge, NULL is returned. */ | |
6de9cd9a DN |
2238 | |
2239 | edge | |
2240 | find_taken_edge (basic_block bb, tree val) | |
2241 | { | |
355fe088 | 2242 | gimple *stmt; |
6de9cd9a DN |
2243 | |
2244 | stmt = last_stmt (bb); | |
2245 | ||
1e128c5f GB |
2246 | gcc_assert (stmt); |
2247 | gcc_assert (is_ctrl_stmt (stmt)); | |
6de9cd9a | 2248 | |
726a989a RB |
2249 | if (val == NULL) |
2250 | return NULL; | |
2251 | ||
2252 | if (!is_gimple_min_invariant (val)) | |
6de9cd9a DN |
2253 | return NULL; |
2254 | ||
726a989a | 2255 | if (gimple_code (stmt) == GIMPLE_COND) |
6de9cd9a DN |
2256 | return find_taken_edge_cond_expr (bb, val); |
2257 | ||
726a989a | 2258 | if (gimple_code (stmt) == GIMPLE_SWITCH) |
538dd0b7 | 2259 | return find_taken_edge_switch_expr (as_a <gswitch *> (stmt), bb, val); |
6de9cd9a | 2260 | |
be477406 | 2261 | if (computed_goto_p (stmt)) |
1799efef JL |
2262 | { |
2263 | /* Only optimize if the argument is a label, if the argument is | |
2264 | not a label then we can not construct a proper CFG. | |
2265 | ||
2266 | It may be the case that we only need to allow the LABEL_REF to | |
2267 | appear inside an ADDR_EXPR, but we also allow the LABEL_REF to | |
2268 | appear inside a LABEL_EXPR just to be safe. */ | |
2269 | if ((TREE_CODE (val) == ADDR_EXPR || TREE_CODE (val) == LABEL_EXPR) | |
2270 | && TREE_CODE (TREE_OPERAND (val, 0)) == LABEL_DECL) | |
2271 | return find_taken_edge_computed_goto (bb, TREE_OPERAND (val, 0)); | |
2272 | return NULL; | |
2273 | } | |
be477406 | 2274 | |
35920270 | 2275 | gcc_unreachable (); |
6de9cd9a DN |
2276 | } |
2277 | ||
be477406 JL |
2278 | /* Given a constant value VAL and the entry block BB to a GOTO_EXPR |
2279 | statement, determine which of the outgoing edges will be taken out of the | |
2280 | block. Return NULL if either edge may be taken. */ | |
2281 | ||
2282 | static edge | |
2283 | find_taken_edge_computed_goto (basic_block bb, tree val) | |
2284 | { | |
2285 | basic_block dest; | |
2286 | edge e = NULL; | |
2287 | ||
2288 | dest = label_to_block (val); | |
2289 | if (dest) | |
2290 | { | |
2291 | e = find_edge (bb, dest); | |
2292 | gcc_assert (e != NULL); | |
2293 | } | |
2294 | ||
2295 | return e; | |
2296 | } | |
6de9cd9a DN |
2297 | |
2298 | /* Given a constant value VAL and the entry block BB to a COND_EXPR | |
2299 | statement, determine which of the two edges will be taken out of the | |
2300 | block. Return NULL if either edge may be taken. */ | |
2301 | ||
2302 | static edge | |
2303 | find_taken_edge_cond_expr (basic_block bb, tree val) | |
2304 | { | |
2305 | edge true_edge, false_edge; | |
2306 | ||
2307 | extract_true_false_edges_from_block (bb, &true_edge, &false_edge); | |
6531d1be | 2308 | |
f1b19062 | 2309 | gcc_assert (TREE_CODE (val) == INTEGER_CST); |
6e682d7e | 2310 | return (integer_zerop (val) ? false_edge : true_edge); |
6de9cd9a DN |
2311 | } |
2312 | ||
fca01525 | 2313 | /* Given an INTEGER_CST VAL and the entry block BB to a SWITCH_EXPR |
6de9cd9a DN |
2314 | statement, determine which edge will be taken out of the block. Return |
2315 | NULL if any edge may be taken. */ | |
2316 | ||
2317 | static edge | |
538dd0b7 DM |
2318 | find_taken_edge_switch_expr (gswitch *switch_stmt, basic_block bb, |
2319 | tree val) | |
6de9cd9a | 2320 | { |
6de9cd9a DN |
2321 | basic_block dest_bb; |
2322 | edge e; | |
726a989a | 2323 | tree taken_case; |
6de9cd9a | 2324 | |
726a989a | 2325 | taken_case = find_case_label_for_value (switch_stmt, val); |
6de9cd9a DN |
2326 | dest_bb = label_to_block (CASE_LABEL (taken_case)); |
2327 | ||
2328 | e = find_edge (bb, dest_bb); | |
1e128c5f | 2329 | gcc_assert (e); |
6de9cd9a DN |
2330 | return e; |
2331 | } | |
2332 | ||
2333 | ||
726a989a | 2334 | /* Return the CASE_LABEL_EXPR that SWITCH_STMT will take for VAL. |
f667741c SB |
2335 | We can make optimal use here of the fact that the case labels are |
2336 | sorted: We can do a binary search for a case matching VAL. */ | |
6de9cd9a DN |
2337 | |
2338 | static tree | |
538dd0b7 | 2339 | find_case_label_for_value (gswitch *switch_stmt, tree val) |
6de9cd9a | 2340 | { |
726a989a RB |
2341 | size_t low, high, n = gimple_switch_num_labels (switch_stmt); |
2342 | tree default_case = gimple_switch_default_label (switch_stmt); | |
6de9cd9a | 2343 | |
726a989a | 2344 | for (low = 0, high = n; high - low > 1; ) |
6de9cd9a | 2345 | { |
f667741c | 2346 | size_t i = (high + low) / 2; |
726a989a | 2347 | tree t = gimple_switch_label (switch_stmt, i); |
f667741c SB |
2348 | int cmp; |
2349 | ||
2350 | /* Cache the result of comparing CASE_LOW and val. */ | |
2351 | cmp = tree_int_cst_compare (CASE_LOW (t), val); | |
6de9cd9a | 2352 | |
f667741c SB |
2353 | if (cmp > 0) |
2354 | high = i; | |
2355 | else | |
2356 | low = i; | |
2357 | ||
2358 | if (CASE_HIGH (t) == NULL) | |
6de9cd9a | 2359 | { |
f667741c SB |
2360 | /* A singe-valued case label. */ |
2361 | if (cmp == 0) | |
6de9cd9a DN |
2362 | return t; |
2363 | } | |
2364 | else | |
2365 | { | |
2366 | /* A case range. We can only handle integer ranges. */ | |
f667741c | 2367 | if (cmp <= 0 && tree_int_cst_compare (CASE_HIGH (t), val) >= 0) |
6de9cd9a DN |
2368 | return t; |
2369 | } | |
2370 | } | |
2371 | ||
6de9cd9a DN |
2372 | return default_case; |
2373 | } | |
2374 | ||
2375 | ||
6de9cd9a DN |
2376 | /* Dump a basic block on stderr. */ |
2377 | ||
2378 | void | |
726a989a | 2379 | gimple_debug_bb (basic_block bb) |
6de9cd9a | 2380 | { |
c4669594 | 2381 | dump_bb (stderr, bb, 0, TDF_VOPS|TDF_MEMSYMS|TDF_BLOCKS); |
6de9cd9a DN |
2382 | } |
2383 | ||
2384 | ||
2385 | /* Dump basic block with index N on stderr. */ | |
2386 | ||
2387 | basic_block | |
726a989a | 2388 | gimple_debug_bb_n (int n) |
6de9cd9a | 2389 | { |
06e28de2 DM |
2390 | gimple_debug_bb (BASIC_BLOCK_FOR_FN (cfun, n)); |
2391 | return BASIC_BLOCK_FOR_FN (cfun, n); | |
6531d1be | 2392 | } |
6de9cd9a DN |
2393 | |
2394 | ||
2395 | /* Dump the CFG on stderr. | |
2396 | ||
2397 | FLAGS are the same used by the tree dumping functions | |
398b1daa | 2398 | (see TDF_* in dumpfile.h). */ |
6de9cd9a DN |
2399 | |
2400 | void | |
1a817418 | 2401 | gimple_debug_cfg (dump_flags_t flags) |
6de9cd9a | 2402 | { |
726a989a | 2403 | gimple_dump_cfg (stderr, flags); |
6de9cd9a DN |
2404 | } |
2405 | ||
2406 | ||
2407 | /* Dump the program showing basic block boundaries on the given FILE. | |
2408 | ||
2409 | FLAGS are the same used by the tree dumping functions (see TDF_* in | |
2410 | tree.h). */ | |
2411 | ||
2412 | void | |
1a817418 | 2413 | gimple_dump_cfg (FILE *file, dump_flags_t flags) |
6de9cd9a DN |
2414 | { |
2415 | if (flags & TDF_DETAILS) | |
2416 | { | |
6d8402ac | 2417 | dump_function_header (file, current_function_decl, flags); |
6de9cd9a | 2418 | fprintf (file, ";; \n%d basic blocks, %d edges, last basic block %d.\n\n", |
dc936fb2 | 2419 | n_basic_blocks_for_fn (cfun), n_edges_for_fn (cfun), |
8b1c6fd7 | 2420 | last_basic_block_for_fn (cfun)); |
6de9cd9a | 2421 | |
9d9573d5 | 2422 | brief_dump_cfg (file, flags); |
6de9cd9a DN |
2423 | fprintf (file, "\n"); |
2424 | } | |
2425 | ||
2426 | if (flags & TDF_STATS) | |
2427 | dump_cfg_stats (file); | |
2428 | ||
2429 | dump_function_to_file (current_function_decl, file, flags | TDF_BLOCKS); | |
2430 | } | |
2431 | ||
2432 | ||
2433 | /* Dump CFG statistics on FILE. */ | |
2434 | ||
2435 | void | |
2436 | dump_cfg_stats (FILE *file) | |
2437 | { | |
2438 | static long max_num_merged_labels = 0; | |
2439 | unsigned long size, total = 0; | |
7b0cab99 | 2440 | long num_edges; |
6de9cd9a DN |
2441 | basic_block bb; |
2442 | const char * const fmt_str = "%-30s%-13s%12s\n"; | |
f7fda749 | 2443 | const char * const fmt_str_1 = "%-30s%13d%11lu%c\n"; |
cac50d94 | 2444 | const char * const fmt_str_2 = "%-30s%13ld%11lu%c\n"; |
6de9cd9a | 2445 | const char * const fmt_str_3 = "%-43s%11lu%c\n"; |
7ee2468b | 2446 | const char *funcname = current_function_name (); |
6de9cd9a DN |
2447 | |
2448 | fprintf (file, "\nCFG Statistics for %s\n\n", funcname); | |
2449 | ||
2450 | fprintf (file, "---------------------------------------------------------\n"); | |
2451 | fprintf (file, fmt_str, "", " Number of ", "Memory"); | |
2452 | fprintf (file, fmt_str, "", " instances ", "used "); | |
2453 | fprintf (file, "---------------------------------------------------------\n"); | |
2454 | ||
0cae8d31 | 2455 | size = n_basic_blocks_for_fn (cfun) * sizeof (struct basic_block_def); |
6de9cd9a | 2456 | total += size; |
0cae8d31 | 2457 | fprintf (file, fmt_str_1, "Basic blocks", n_basic_blocks_for_fn (cfun), |
f7fda749 | 2458 | SCALE (size), LABEL (size)); |
6de9cd9a | 2459 | |
7b0cab99 | 2460 | num_edges = 0; |
11cd3bed | 2461 | FOR_EACH_BB_FN (bb, cfun) |
7b0cab99 JH |
2462 | num_edges += EDGE_COUNT (bb->succs); |
2463 | size = num_edges * sizeof (struct edge_def); | |
6de9cd9a | 2464 | total += size; |
cac50d94 | 2465 | fprintf (file, fmt_str_2, "Edges", num_edges, SCALE (size), LABEL (size)); |
6de9cd9a | 2466 | |
6de9cd9a DN |
2467 | fprintf (file, "---------------------------------------------------------\n"); |
2468 | fprintf (file, fmt_str_3, "Total memory used by CFG data", SCALE (total), | |
2469 | LABEL (total)); | |
2470 | fprintf (file, "---------------------------------------------------------\n"); | |
2471 | fprintf (file, "\n"); | |
2472 | ||
2473 | if (cfg_stats.num_merged_labels > max_num_merged_labels) | |
2474 | max_num_merged_labels = cfg_stats.num_merged_labels; | |
2475 | ||
2476 | fprintf (file, "Coalesced label blocks: %ld (Max so far: %ld)\n", | |
2477 | cfg_stats.num_merged_labels, max_num_merged_labels); | |
2478 | ||
2479 | fprintf (file, "\n"); | |
2480 | } | |
2481 | ||
2482 | ||
2483 | /* Dump CFG statistics on stderr. Keep extern so that it's always | |
2484 | linked in the final executable. */ | |
2485 | ||
24e47c76 | 2486 | DEBUG_FUNCTION void |
6de9cd9a DN |
2487 | debug_cfg_stats (void) |
2488 | { | |
2489 | dump_cfg_stats (stderr); | |
2490 | } | |
2491 | ||
6de9cd9a DN |
2492 | /*--------------------------------------------------------------------------- |
2493 | Miscellaneous helpers | |
2494 | ---------------------------------------------------------------------------*/ | |
2495 | ||
8d960eda EB |
2496 | /* Return true if T, a GIMPLE_CALL, can make an abnormal transfer of control |
2497 | flow. Transfers of control flow associated with EH are excluded. */ | |
2498 | ||
2499 | static bool | |
355fe088 | 2500 | call_can_make_abnormal_goto (gimple *t) |
8d960eda EB |
2501 | { |
2502 | /* If the function has no non-local labels, then a call cannot make an | |
2503 | abnormal transfer of control. */ | |
f6b64c35 RB |
2504 | if (!cfun->has_nonlocal_label |
2505 | && !cfun->calls_setjmp) | |
8d960eda EB |
2506 | return false; |
2507 | ||
2508 | /* Likewise if the call has no side effects. */ | |
2509 | if (!gimple_has_side_effects (t)) | |
2510 | return false; | |
2511 | ||
2512 | /* Likewise if the called function is leaf. */ | |
2513 | if (gimple_call_flags (t) & ECF_LEAF) | |
2514 | return false; | |
2515 | ||
2516 | return true; | |
2517 | } | |
2518 | ||
2519 | ||
2520 | /* Return true if T can make an abnormal transfer of control flow. | |
2521 | Transfers of control flow associated with EH are excluded. */ | |
2522 | ||
2523 | bool | |
355fe088 | 2524 | stmt_can_make_abnormal_goto (gimple *t) |
8d960eda EB |
2525 | { |
2526 | if (computed_goto_p (t)) | |
2527 | return true; | |
2528 | if (is_gimple_call (t)) | |
2529 | return call_can_make_abnormal_goto (t); | |
2530 | return false; | |
2531 | } | |
2532 | ||
2533 | ||
6de9cd9a DN |
2534 | /* Return true if T represents a stmt that always transfers control. */ |
2535 | ||
2536 | bool | |
355fe088 | 2537 | is_ctrl_stmt (gimple *t) |
6de9cd9a | 2538 | { |
40a32862 RH |
2539 | switch (gimple_code (t)) |
2540 | { | |
2541 | case GIMPLE_COND: | |
2542 | case GIMPLE_SWITCH: | |
2543 | case GIMPLE_GOTO: | |
2544 | case GIMPLE_RETURN: | |
2545 | case GIMPLE_RESX: | |
2546 | return true; | |
2547 | default: | |
2548 | return false; | |
2549 | } | |
6de9cd9a DN |
2550 | } |
2551 | ||
2552 | ||
2553 | /* Return true if T is a statement that may alter the flow of control | |
2554 | (e.g., a call to a non-returning function). */ | |
2555 | ||
2556 | bool | |
355fe088 | 2557 | is_ctrl_altering_stmt (gimple *t) |
6de9cd9a | 2558 | { |
1e128c5f | 2559 | gcc_assert (t); |
726a989a | 2560 | |
8b9db065 | 2561 | switch (gimple_code (t)) |
6de9cd9a | 2562 | { |
8b9db065 | 2563 | case GIMPLE_CALL: |
58041fe6 MJ |
2564 | /* Per stmt call flag indicates whether the call could alter |
2565 | controlflow. */ | |
2566 | if (gimple_call_ctrl_altering_p (t)) | |
2567 | return true; | |
8b9db065 | 2568 | break; |
6de9cd9a | 2569 | |
1d65f45c RH |
2570 | case GIMPLE_EH_DISPATCH: |
2571 | /* EH_DISPATCH branches to the individual catch handlers at | |
2572 | this level of a try or allowed-exceptions region. It can | |
2573 | fallthru to the next statement as well. */ | |
2574 | return true; | |
2575 | ||
1c384bf1 | 2576 | case GIMPLE_ASM: |
538dd0b7 | 2577 | if (gimple_asm_nlabels (as_a <gasm *> (t)) > 0) |
1c384bf1 RH |
2578 | return true; |
2579 | break; | |
2580 | ||
8b9db065 RH |
2581 | CASE_GIMPLE_OMP: |
2582 | /* OpenMP directives alter control flow. */ | |
2583 | return true; | |
2584 | ||
0a35513e AH |
2585 | case GIMPLE_TRANSACTION: |
2586 | /* A transaction start alters control flow. */ | |
2587 | return true; | |
2588 | ||
8b9db065 RH |
2589 | default: |
2590 | break; | |
2591 | } | |
50674e96 | 2592 | |
6de9cd9a | 2593 | /* If a statement can throw, it alters control flow. */ |
726a989a | 2594 | return stmt_can_throw_internal (t); |
6de9cd9a DN |
2595 | } |
2596 | ||
2597 | ||
4f6c2131 | 2598 | /* Return true if T is a simple local goto. */ |
6de9cd9a DN |
2599 | |
2600 | bool | |
355fe088 | 2601 | simple_goto_p (gimple *t) |
6de9cd9a | 2602 | { |
726a989a RB |
2603 | return (gimple_code (t) == GIMPLE_GOTO |
2604 | && TREE_CODE (gimple_goto_dest (t)) == LABEL_DECL); | |
4f6c2131 EB |
2605 | } |
2606 | ||
2607 | ||
726a989a RB |
2608 | /* Return true if STMT should start a new basic block. PREV_STMT is |
2609 | the statement preceding STMT. It is used when STMT is a label or a | |
2610 | case label. Labels should only start a new basic block if their | |
2611 | previous statement wasn't a label. Otherwise, sequence of labels | |
2612 | would generate unnecessary basic blocks that only contain a single | |
2613 | label. */ | |
6de9cd9a DN |
2614 | |
2615 | static inline bool | |
355fe088 | 2616 | stmt_starts_bb_p (gimple *stmt, gimple *prev_stmt) |
6de9cd9a | 2617 | { |
726a989a | 2618 | if (stmt == NULL) |
6de9cd9a DN |
2619 | return false; |
2620 | ||
726a989a RB |
2621 | /* Labels start a new basic block only if the preceding statement |
2622 | wasn't a label of the same type. This prevents the creation of | |
2623 | consecutive blocks that have nothing but a single label. */ | |
538dd0b7 | 2624 | if (glabel *label_stmt = dyn_cast <glabel *> (stmt)) |
6de9cd9a DN |
2625 | { |
2626 | /* Nonlocal and computed GOTO targets always start a new block. */ | |
538dd0b7 DM |
2627 | if (DECL_NONLOCAL (gimple_label_label (label_stmt)) |
2628 | || FORCED_LABEL (gimple_label_label (label_stmt))) | |
6de9cd9a DN |
2629 | return true; |
2630 | ||
726a989a | 2631 | if (prev_stmt && gimple_code (prev_stmt) == GIMPLE_LABEL) |
6de9cd9a | 2632 | { |
538dd0b7 DM |
2633 | if (DECL_NONLOCAL (gimple_label_label ( |
2634 | as_a <glabel *> (prev_stmt)))) | |
6de9cd9a DN |
2635 | return true; |
2636 | ||
2637 | cfg_stats.num_merged_labels++; | |
2638 | return false; | |
2639 | } | |
2640 | else | |
2641 | return true; | |
2642 | } | |
00738904 RB |
2643 | else if (gimple_code (stmt) == GIMPLE_CALL) |
2644 | { | |
2645 | if (gimple_call_flags (stmt) & ECF_RETURNS_TWICE) | |
2646 | /* setjmp acts similar to a nonlocal GOTO target and thus should | |
2647 | start a new block. */ | |
2648 | return true; | |
2649 | if (gimple_call_internal_p (stmt, IFN_PHI) | |
2650 | && prev_stmt | |
2651 | && gimple_code (prev_stmt) != GIMPLE_LABEL | |
2652 | && (gimple_code (prev_stmt) != GIMPLE_CALL | |
2653 | || ! gimple_call_internal_p (prev_stmt, IFN_PHI))) | |
2654 | /* PHI nodes start a new block unless preceeded by a label | |
2655 | or another PHI. */ | |
2656 | return true; | |
2657 | } | |
6de9cd9a DN |
2658 | |
2659 | return false; | |
2660 | } | |
2661 | ||
2662 | ||
2663 | /* Return true if T should end a basic block. */ | |
2664 | ||
2665 | bool | |
355fe088 | 2666 | stmt_ends_bb_p (gimple *t) |
6de9cd9a DN |
2667 | { |
2668 | return is_ctrl_stmt (t) || is_ctrl_altering_stmt (t); | |
2669 | } | |
2670 | ||
726a989a | 2671 | /* Remove block annotations and other data structures. */ |
6de9cd9a DN |
2672 | |
2673 | void | |
61183076 | 2674 | delete_tree_cfg_annotations (struct function *fn) |
6de9cd9a | 2675 | { |
61183076 | 2676 | vec_free (label_to_block_map_for_fn (fn)); |
6de9cd9a DN |
2677 | } |
2678 | ||
338392ed TV |
2679 | /* Return the virtual phi in BB. */ |
2680 | ||
2681 | gphi * | |
2682 | get_virtual_phi (basic_block bb) | |
2683 | { | |
2684 | for (gphi_iterator gsi = gsi_start_phis (bb); | |
2685 | !gsi_end_p (gsi); | |
2686 | gsi_next (&gsi)) | |
2687 | { | |
2688 | gphi *phi = gsi.phi (); | |
2689 | ||
2690 | if (virtual_operand_p (PHI_RESULT (phi))) | |
2691 | return phi; | |
2692 | } | |
2693 | ||
2694 | return NULL; | |
2695 | } | |
6de9cd9a DN |
2696 | |
2697 | /* Return the first statement in basic block BB. */ | |
2698 | ||
355fe088 | 2699 | gimple * |
6de9cd9a DN |
2700 | first_stmt (basic_block bb) |
2701 | { | |
726a989a | 2702 | gimple_stmt_iterator i = gsi_start_bb (bb); |
355fe088 | 2703 | gimple *stmt = NULL; |
b5b8b0ac AO |
2704 | |
2705 | while (!gsi_end_p (i) && is_gimple_debug ((stmt = gsi_stmt (i)))) | |
2706 | { | |
2707 | gsi_next (&i); | |
2708 | stmt = NULL; | |
2709 | } | |
2710 | return stmt; | |
6de9cd9a DN |
2711 | } |
2712 | ||
6c52e687 CC |
2713 | /* Return the first non-label statement in basic block BB. */ |
2714 | ||
355fe088 | 2715 | static gimple * |
6c52e687 CC |
2716 | first_non_label_stmt (basic_block bb) |
2717 | { | |
2718 | gimple_stmt_iterator i = gsi_start_bb (bb); | |
2719 | while (!gsi_end_p (i) && gimple_code (gsi_stmt (i)) == GIMPLE_LABEL) | |
2720 | gsi_next (&i); | |
2721 | return !gsi_end_p (i) ? gsi_stmt (i) : NULL; | |
2722 | } | |
2723 | ||
6de9cd9a DN |
2724 | /* Return the last statement in basic block BB. */ |
2725 | ||
355fe088 | 2726 | gimple * |
6de9cd9a DN |
2727 | last_stmt (basic_block bb) |
2728 | { | |
b5b8b0ac | 2729 | gimple_stmt_iterator i = gsi_last_bb (bb); |
355fe088 | 2730 | gimple *stmt = NULL; |
b5b8b0ac AO |
2731 | |
2732 | while (!gsi_end_p (i) && is_gimple_debug ((stmt = gsi_stmt (i)))) | |
2733 | { | |
2734 | gsi_prev (&i); | |
2735 | stmt = NULL; | |
2736 | } | |
2737 | return stmt; | |
6de9cd9a DN |
2738 | } |
2739 | ||
6de9cd9a DN |
2740 | /* Return the last statement of an otherwise empty block. Return NULL |
2741 | if the block is totally empty, or if it contains more than one | |
2742 | statement. */ | |
2743 | ||
355fe088 | 2744 | gimple * |
6de9cd9a DN |
2745 | last_and_only_stmt (basic_block bb) |
2746 | { | |
b5b8b0ac | 2747 | gimple_stmt_iterator i = gsi_last_nondebug_bb (bb); |
355fe088 | 2748 | gimple *last, *prev; |
6de9cd9a | 2749 | |
726a989a RB |
2750 | if (gsi_end_p (i)) |
2751 | return NULL; | |
6de9cd9a | 2752 | |
726a989a | 2753 | last = gsi_stmt (i); |
b5b8b0ac | 2754 | gsi_prev_nondebug (&i); |
726a989a | 2755 | if (gsi_end_p (i)) |
6de9cd9a DN |
2756 | return last; |
2757 | ||
2758 | /* Empty statements should no longer appear in the instruction stream. | |
2759 | Everything that might have appeared before should be deleted by | |
726a989a | 2760 | remove_useless_stmts, and the optimizers should just gsi_remove |
6de9cd9a DN |
2761 | instead of smashing with build_empty_stmt. |
2762 | ||
2763 | Thus the only thing that should appear here in a block containing | |
2764 | one executable statement is a label. */ | |
726a989a RB |
2765 | prev = gsi_stmt (i); |
2766 | if (gimple_code (prev) == GIMPLE_LABEL) | |
6de9cd9a DN |
2767 | return last; |
2768 | else | |
726a989a | 2769 | return NULL; |
82b85a85 | 2770 | } |
6de9cd9a | 2771 | |
4f7db7f7 KH |
2772 | /* Reinstall those PHI arguments queued in OLD_EDGE to NEW_EDGE. */ |
2773 | ||
2774 | static void | |
2775 | reinstall_phi_args (edge new_edge, edge old_edge) | |
2776 | { | |
ea7e6d5a AH |
2777 | edge_var_map *vm; |
2778 | int i; | |
538dd0b7 | 2779 | gphi_iterator phis; |
b8698a0f | 2780 | |
b787e7a2 | 2781 | vec<edge_var_map> *v = redirect_edge_var_map_vector (old_edge); |
ea7e6d5a | 2782 | if (!v) |
4f7db7f7 | 2783 | return; |
b8698a0f | 2784 | |
726a989a | 2785 | for (i = 0, phis = gsi_start_phis (new_edge->dest); |
9771b263 | 2786 | v->iterate (i, &vm) && !gsi_end_p (phis); |
726a989a | 2787 | i++, gsi_next (&phis)) |
4f7db7f7 | 2788 | { |
538dd0b7 | 2789 | gphi *phi = phis.phi (); |
ea7e6d5a AH |
2790 | tree result = redirect_edge_var_map_result (vm); |
2791 | tree arg = redirect_edge_var_map_def (vm); | |
b8698a0f | 2792 | |
726a989a | 2793 | gcc_assert (result == gimple_phi_result (phi)); |
b8698a0f | 2794 | |
9e227d60 | 2795 | add_phi_arg (phi, arg, new_edge, redirect_edge_var_map_location (vm)); |
4f7db7f7 | 2796 | } |
b8698a0f | 2797 | |
ea7e6d5a | 2798 | redirect_edge_var_map_clear (old_edge); |
4f7db7f7 KH |
2799 | } |
2800 | ||
2a8a8292 | 2801 | /* Returns the basic block after which the new basic block created |
b9a66240 ZD |
2802 | by splitting edge EDGE_IN should be placed. Tries to keep the new block |
2803 | near its "logical" location. This is of most help to humans looking | |
2804 | at debugging dumps. */ | |
2805 | ||
50e9ff83 | 2806 | basic_block |
b9a66240 ZD |
2807 | split_edge_bb_loc (edge edge_in) |
2808 | { | |
2809 | basic_block dest = edge_in->dest; | |
88e24a5a | 2810 | basic_block dest_prev = dest->prev_bb; |
b9a66240 | 2811 | |
88e24a5a RH |
2812 | if (dest_prev) |
2813 | { | |
2814 | edge e = find_edge (dest_prev, dest); | |
2815 | if (e && !(e->flags & EDGE_COMPLEX)) | |
2816 | return edge_in->src; | |
2817 | } | |
2818 | return dest_prev; | |
b9a66240 ZD |
2819 | } |
2820 | ||
6de9cd9a DN |
2821 | /* Split a (typically critical) edge EDGE_IN. Return the new block. |
2822 | Abort on abnormal edges. */ | |
2823 | ||
2824 | static basic_block | |
726a989a | 2825 | gimple_split_edge (edge edge_in) |
6de9cd9a | 2826 | { |
4741d956 | 2827 | basic_block new_bb, after_bb, dest; |
6de9cd9a | 2828 | edge new_edge, e; |
6de9cd9a DN |
2829 | |
2830 | /* Abnormal edges cannot be split. */ | |
1e128c5f | 2831 | gcc_assert (!(edge_in->flags & EDGE_ABNORMAL)); |
6de9cd9a | 2832 | |
6de9cd9a DN |
2833 | dest = edge_in->dest; |
2834 | ||
b9a66240 | 2835 | after_bb = split_edge_bb_loc (edge_in); |
6de9cd9a DN |
2836 | |
2837 | new_bb = create_empty_bb (after_bb); | |
b829f3fa JH |
2838 | new_bb->frequency = EDGE_FREQUENCY (edge_in); |
2839 | new_bb->count = edge_in->count; | |
6de9cd9a | 2840 | new_edge = make_edge (new_bb, dest, EDGE_FALLTHRU); |
b829f3fa JH |
2841 | new_edge->probability = REG_BR_PROB_BASE; |
2842 | new_edge->count = edge_in->count; | |
6de9cd9a | 2843 | |
1e128c5f | 2844 | e = redirect_edge_and_branch (edge_in, new_bb); |
c7b852c8 | 2845 | gcc_assert (e == edge_in); |
4f7db7f7 | 2846 | reinstall_phi_args (new_edge, e); |
6de9cd9a DN |
2847 | |
2848 | return new_bb; | |
2849 | } | |
2850 | ||
70f34814 RG |
2851 | |
2852 | /* Verify properties of the address expression T with base object BASE. */ | |
2853 | ||
2854 | static tree | |
2855 | verify_address (tree t, tree base) | |
2856 | { | |
2857 | bool old_constant; | |
2858 | bool old_side_effects; | |
2859 | bool new_constant; | |
2860 | bool new_side_effects; | |
2861 | ||
2862 | old_constant = TREE_CONSTANT (t); | |
2863 | old_side_effects = TREE_SIDE_EFFECTS (t); | |
2864 | ||
2865 | recompute_tree_invariant_for_addr_expr (t); | |
2866 | new_side_effects = TREE_SIDE_EFFECTS (t); | |
2867 | new_constant = TREE_CONSTANT (t); | |
2868 | ||
2869 | if (old_constant != new_constant) | |
2870 | { | |
2871 | error ("constant not recomputed when ADDR_EXPR changed"); | |
2872 | return t; | |
2873 | } | |
2874 | if (old_side_effects != new_side_effects) | |
2875 | { | |
2876 | error ("side effects not recomputed when ADDR_EXPR changed"); | |
2877 | return t; | |
2878 | } | |
2879 | ||
8813a647 | 2880 | if (!(VAR_P (base) |
70f34814 RG |
2881 | || TREE_CODE (base) == PARM_DECL |
2882 | || TREE_CODE (base) == RESULT_DECL)) | |
2883 | return NULL_TREE; | |
2884 | ||
2885 | if (DECL_GIMPLE_REG_P (base)) | |
2886 | { | |
2887 | error ("DECL_GIMPLE_REG_P set on a variable with address taken"); | |
2888 | return base; | |
2889 | } | |
2890 | ||
2891 | return NULL_TREE; | |
2892 | } | |
2893 | ||
6de9cd9a | 2894 | /* Callback for walk_tree, check that all elements with address taken are |
7a442a1d SB |
2895 | properly noticed as such. The DATA is an int* that is 1 if TP was seen |
2896 | inside a PHI node. */ | |
6de9cd9a DN |
2897 | |
2898 | static tree | |
2fbe90f2 | 2899 | verify_expr (tree *tp, int *walk_subtrees, void *data ATTRIBUTE_UNUSED) |
6de9cd9a DN |
2900 | { |
2901 | tree t = *tp, x; | |
2902 | ||
2903 | if (TYPE_P (t)) | |
2904 | *walk_subtrees = 0; | |
6531d1be | 2905 | |
e8ca4159 | 2906 | /* Check operand N for being valid GIMPLE and give error MSG if not. */ |
2fbe90f2 | 2907 | #define CHECK_OP(N, MSG) \ |
e8ca4159 | 2908 | do { if (!is_gimple_val (TREE_OPERAND (t, N))) \ |
2fbe90f2 | 2909 | { error (MSG); return TREE_OPERAND (t, N); }} while (0) |
6de9cd9a DN |
2910 | |
2911 | switch (TREE_CODE (t)) | |
2912 | { | |
2913 | case SSA_NAME: | |
2914 | if (SSA_NAME_IN_FREE_LIST (t)) | |
2915 | { | |
2916 | error ("SSA name in freelist but still referenced"); | |
2917 | return *tp; | |
2918 | } | |
2919 | break; | |
2920 | ||
a6bf99f0 MJ |
2921 | case PARM_DECL: |
2922 | case VAR_DECL: | |
2923 | case RESULT_DECL: | |
2924 | { | |
2925 | tree context = decl_function_context (t); | |
2926 | if (context != cfun->decl | |
2927 | && !SCOPE_FILE_SCOPE_P (context) | |
2928 | && !TREE_STATIC (t) | |
2929 | && !DECL_EXTERNAL (t)) | |
2930 | { | |
2931 | error ("Local declaration from a different function"); | |
2932 | return t; | |
2933 | } | |
2934 | } | |
2935 | break; | |
2936 | ||
26de0bcb | 2937 | case INDIRECT_REF: |
70f34814 RG |
2938 | error ("INDIRECT_REF in gimple IL"); |
2939 | return t; | |
2940 | ||
2941 | case MEM_REF: | |
26de0bcb | 2942 | x = TREE_OPERAND (t, 0); |
38a178dd RG |
2943 | if (!POINTER_TYPE_P (TREE_TYPE (x)) |
2944 | || !is_gimple_mem_ref_addr (x)) | |
26de0bcb | 2945 | { |
d8a07487 | 2946 | error ("invalid first operand of MEM_REF"); |
26de0bcb AP |
2947 | return x; |
2948 | } | |
70f34814 RG |
2949 | if (TREE_CODE (TREE_OPERAND (t, 1)) != INTEGER_CST |
2950 | || !POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (t, 1)))) | |
2951 | { | |
d8a07487 | 2952 | error ("invalid offset operand of MEM_REF"); |
70f34814 RG |
2953 | return TREE_OPERAND (t, 1); |
2954 | } | |
a6bf99f0 MJ |
2955 | if (TREE_CODE (x) == ADDR_EXPR) |
2956 | { | |
2957 | tree va = verify_address (x, TREE_OPERAND (x, 0)); | |
2958 | if (va) | |
2959 | return va; | |
2960 | x = TREE_OPERAND (x, 0); | |
2961 | } | |
2962 | walk_tree (&x, verify_expr, data, NULL); | |
70f34814 | 2963 | *walk_subtrees = 0; |
26de0bcb AP |
2964 | break; |
2965 | ||
0bca51f0 DN |
2966 | case ASSERT_EXPR: |
2967 | x = fold (ASSERT_EXPR_COND (t)); | |
2968 | if (x == boolean_false_node) | |
2969 | { | |
2970 | error ("ASSERT_EXPR with an always-false condition"); | |
2971 | return *tp; | |
2972 | } | |
2973 | break; | |
2974 | ||
6de9cd9a | 2975 | case MODIFY_EXPR: |
d8a07487 | 2976 | error ("MODIFY_EXPR not expected while having tuples"); |
e57fcb68 | 2977 | return *tp; |
6de9cd9a DN |
2978 | |
2979 | case ADDR_EXPR: | |
81fc3052 | 2980 | { |
70f34814 | 2981 | tree tem; |
81fc3052 | 2982 | |
51eed280 PB |
2983 | gcc_assert (is_gimple_address (t)); |
2984 | ||
81fc3052 DB |
2985 | /* Skip any references (they will be checked when we recurse down the |
2986 | tree) and ensure that any variable used as a prefix is marked | |
2987 | addressable. */ | |
2988 | for (x = TREE_OPERAND (t, 0); | |
2989 | handled_component_p (x); | |
2990 | x = TREE_OPERAND (x, 0)) | |
2991 | ; | |
2992 | ||
70f34814 RG |
2993 | if ((tem = verify_address (t, x))) |
2994 | return tem; | |
2995 | ||
8813a647 | 2996 | if (!(VAR_P (x) |
5006671f RG |
2997 | || TREE_CODE (x) == PARM_DECL |
2998 | || TREE_CODE (x) == RESULT_DECL)) | |
81fc3052 | 2999 | return NULL; |
70f34814 | 3000 | |
81fc3052 DB |
3001 | if (!TREE_ADDRESSABLE (x)) |
3002 | { | |
3003 | error ("address taken, but ADDRESSABLE bit not set"); | |
3004 | return x; | |
3005 | } | |
bdb69bee | 3006 | |
81fc3052 DB |
3007 | break; |
3008 | } | |
6de9cd9a DN |
3009 | |
3010 | case COND_EXPR: | |
a6234684 | 3011 | x = COND_EXPR_COND (t); |
d40055ab | 3012 | if (!INTEGRAL_TYPE_P (TREE_TYPE (x))) |
6de9cd9a | 3013 | { |
d40055ab | 3014 | error ("non-integral used in condition"); |
6de9cd9a DN |
3015 | return x; |
3016 | } | |
9c691961 AP |
3017 | if (!is_gimple_condexpr (x)) |
3018 | { | |
ab532386 | 3019 | error ("invalid conditional operand"); |
9c691961 AP |
3020 | return x; |
3021 | } | |
6de9cd9a DN |
3022 | break; |
3023 | ||
a134e5f3 | 3024 | case NON_LVALUE_EXPR: |
53020648 RG |
3025 | case TRUTH_NOT_EXPR: |
3026 | gcc_unreachable (); | |
a134e5f3 | 3027 | |
1043771b | 3028 | CASE_CONVERT: |
6de9cd9a | 3029 | case FIX_TRUNC_EXPR: |
6de9cd9a DN |
3030 | case FLOAT_EXPR: |
3031 | case NEGATE_EXPR: | |
3032 | case ABS_EXPR: | |
3033 | case BIT_NOT_EXPR: | |
ab532386 | 3034 | CHECK_OP (0, "invalid operand to unary operator"); |
6de9cd9a DN |
3035 | break; |
3036 | ||
3037 | case REALPART_EXPR: | |
3038 | case IMAGPART_EXPR: | |
bbba1117 MJ |
3039 | case BIT_FIELD_REF: |
3040 | if (!is_gimple_reg_type (TREE_TYPE (t))) | |
3041 | { | |
3042 | error ("non-scalar BIT_FIELD_REF, IMAGPART_EXPR or REALPART_EXPR"); | |
3043 | return t; | |
3044 | } | |
3045 | ||
d20188f3 MJ |
3046 | if (TREE_CODE (t) == BIT_FIELD_REF) |
3047 | { | |
e934916c TV |
3048 | tree t0 = TREE_OPERAND (t, 0); |
3049 | tree t1 = TREE_OPERAND (t, 1); | |
3050 | tree t2 = TREE_OPERAND (t, 2); | |
e934916c TV |
3051 | if (!tree_fits_uhwi_p (t1) |
3052 | || !tree_fits_uhwi_p (t2)) | |
d20188f3 MJ |
3053 | { |
3054 | error ("invalid position or size operand to BIT_FIELD_REF"); | |
3055 | return t; | |
3056 | } | |
3057 | if (INTEGRAL_TYPE_P (TREE_TYPE (t)) | |
3058 | && (TYPE_PRECISION (TREE_TYPE (t)) | |
e934916c | 3059 | != tree_to_uhwi (t1))) |
d20188f3 MJ |
3060 | { |
3061 | error ("integral result type precision does not match " | |
3062 | "field size of BIT_FIELD_REF"); | |
3063 | return t; | |
3064 | } | |
3065 | else if (!INTEGRAL_TYPE_P (TREE_TYPE (t)) | |
3066 | && TYPE_MODE (TREE_TYPE (t)) != BLKmode | |
218db463 | 3067 | && (GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (t))) |
e934916c | 3068 | != tree_to_uhwi (t1))) |
d20188f3 | 3069 | { |
218db463 | 3070 | error ("mode size of non-integral result does not " |
d20188f3 MJ |
3071 | "match field size of BIT_FIELD_REF"); |
3072 | return t; | |
3073 | } | |
b8815bd3 RB |
3074 | if (!AGGREGATE_TYPE_P (TREE_TYPE (t0)) |
3075 | && (tree_to_uhwi (t1) + tree_to_uhwi (t2) | |
3076 | > tree_to_uhwi (TYPE_SIZE (TREE_TYPE (t0))))) | |
e934916c TV |
3077 | { |
3078 | error ("position plus size exceeds size of referenced object in " | |
3079 | "BIT_FIELD_REF"); | |
3080 | return t; | |
3081 | } | |
d20188f3 MJ |
3082 | } |
3083 | t = TREE_OPERAND (t, 0); | |
3084 | ||
bbba1117 | 3085 | /* Fall-through. */ |
2fbe90f2 RK |
3086 | case COMPONENT_REF: |
3087 | case ARRAY_REF: | |
3088 | case ARRAY_RANGE_REF: | |
2fbe90f2 RK |
3089 | case VIEW_CONVERT_EXPR: |
3090 | /* We have a nest of references. Verify that each of the operands | |
3091 | that determine where to reference is either a constant or a variable, | |
3092 | verify that the base is valid, and then show we've already checked | |
3093 | the subtrees. */ | |
afe84921 | 3094 | while (handled_component_p (t)) |
2fbe90f2 RK |
3095 | { |
3096 | if (TREE_CODE (t) == COMPONENT_REF && TREE_OPERAND (t, 2)) | |
ab532386 | 3097 | CHECK_OP (2, "invalid COMPONENT_REF offset operator"); |
2fbe90f2 RK |
3098 | else if (TREE_CODE (t) == ARRAY_REF |
3099 | || TREE_CODE (t) == ARRAY_RANGE_REF) | |
3100 | { | |
ab532386 | 3101 | CHECK_OP (1, "invalid array index"); |
2fbe90f2 | 3102 | if (TREE_OPERAND (t, 2)) |
ab532386 | 3103 | CHECK_OP (2, "invalid array lower bound"); |
2fbe90f2 | 3104 | if (TREE_OPERAND (t, 3)) |
ab532386 | 3105 | CHECK_OP (3, "invalid array stride"); |
2fbe90f2 | 3106 | } |
d20188f3 MJ |
3107 | else if (TREE_CODE (t) == BIT_FIELD_REF |
3108 | || TREE_CODE (t) == REALPART_EXPR | |
3109 | || TREE_CODE (t) == IMAGPART_EXPR) | |
2fbe90f2 | 3110 | { |
d20188f3 MJ |
3111 | error ("non-top-level BIT_FIELD_REF, IMAGPART_EXPR or " |
3112 | "REALPART_EXPR"); | |
3113 | return t; | |
2fbe90f2 RK |
3114 | } |
3115 | ||
3116 | t = TREE_OPERAND (t, 0); | |
3117 | } | |
3118 | ||
bb0c55f6 | 3119 | if (!is_gimple_min_invariant (t) && !is_gimple_lvalue (t)) |
2fbe90f2 | 3120 | { |
ab532386 | 3121 | error ("invalid reference prefix"); |
2fbe90f2 RK |
3122 | return t; |
3123 | } | |
a6bf99f0 | 3124 | walk_tree (&t, verify_expr, data, NULL); |
2fbe90f2 | 3125 | *walk_subtrees = 0; |
6de9cd9a | 3126 | break; |
5be014d5 AP |
3127 | case PLUS_EXPR: |
3128 | case MINUS_EXPR: | |
3129 | /* PLUS_EXPR and MINUS_EXPR don't work on pointers, they should be done using | |
3130 | POINTER_PLUS_EXPR. */ | |
3131 | if (POINTER_TYPE_P (TREE_TYPE (t))) | |
3132 | { | |
3133 | error ("invalid operand to plus/minus, type is a pointer"); | |
3134 | return t; | |
3135 | } | |
3136 | CHECK_OP (0, "invalid operand to binary operator"); | |
3137 | CHECK_OP (1, "invalid operand to binary operator"); | |
3138 | break; | |
6de9cd9a | 3139 | |
5be014d5 AP |
3140 | case POINTER_PLUS_EXPR: |
3141 | /* Check to make sure the first operand is a pointer or reference type. */ | |
3142 | if (!POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (t, 0)))) | |
3143 | { | |
3144 | error ("invalid operand to pointer plus, first operand is not a pointer"); | |
3145 | return t; | |
3146 | } | |
370f4759 RG |
3147 | /* Check to make sure the second operand is a ptrofftype. */ |
3148 | if (!ptrofftype_p (TREE_TYPE (TREE_OPERAND (t, 1)))) | |
5be014d5 AP |
3149 | { |
3150 | error ("invalid operand to pointer plus, second operand is not an " | |
370f4759 | 3151 | "integer type of appropriate width"); |
5be014d5 AP |
3152 | return t; |
3153 | } | |
3154 | /* FALLTHROUGH */ | |
6de9cd9a DN |
3155 | case LT_EXPR: |
3156 | case LE_EXPR: | |
3157 | case GT_EXPR: | |
3158 | case GE_EXPR: | |
3159 | case EQ_EXPR: | |
3160 | case NE_EXPR: | |
3161 | case UNORDERED_EXPR: | |
3162 | case ORDERED_EXPR: | |
3163 | case UNLT_EXPR: | |
3164 | case UNLE_EXPR: | |
3165 | case UNGT_EXPR: | |
3166 | case UNGE_EXPR: | |
3167 | case UNEQ_EXPR: | |
d1a7edaf | 3168 | case LTGT_EXPR: |
6de9cd9a DN |
3169 | case MULT_EXPR: |
3170 | case TRUNC_DIV_EXPR: | |
3171 | case CEIL_DIV_EXPR: | |
3172 | case FLOOR_DIV_EXPR: | |
3173 | case ROUND_DIV_EXPR: | |
3174 | case TRUNC_MOD_EXPR: | |
3175 | case CEIL_MOD_EXPR: | |
3176 | case FLOOR_MOD_EXPR: | |
3177 | case ROUND_MOD_EXPR: | |
3178 | case RDIV_EXPR: | |
3179 | case EXACT_DIV_EXPR: | |
3180 | case MIN_EXPR: | |
3181 | case MAX_EXPR: | |
3182 | case LSHIFT_EXPR: | |
3183 | case RSHIFT_EXPR: | |
3184 | case LROTATE_EXPR: | |
3185 | case RROTATE_EXPR: | |
3186 | case BIT_IOR_EXPR: | |
3187 | case BIT_XOR_EXPR: | |
3188 | case BIT_AND_EXPR: | |
ab532386 JM |
3189 | CHECK_OP (0, "invalid operand to binary operator"); |
3190 | CHECK_OP (1, "invalid operand to binary operator"); | |
6de9cd9a DN |
3191 | break; |
3192 | ||
84816907 JM |
3193 | case CONSTRUCTOR: |
3194 | if (TREE_CONSTANT (t) && TREE_CODE (TREE_TYPE (t)) == VECTOR_TYPE) | |
3195 | *walk_subtrees = 0; | |
3196 | break; | |
3197 | ||
eb9f9259 NF |
3198 | case CASE_LABEL_EXPR: |
3199 | if (CASE_CHAIN (t)) | |
3200 | { | |
3201 | error ("invalid CASE_CHAIN"); | |
3202 | return t; | |
3203 | } | |
3204 | break; | |
3205 | ||
6de9cd9a DN |
3206 | default: |
3207 | break; | |
3208 | } | |
3209 | return NULL; | |
2fbe90f2 RK |
3210 | |
3211 | #undef CHECK_OP | |
6de9cd9a DN |
3212 | } |
3213 | ||
7e98624c RG |
3214 | |
3215 | /* Verify if EXPR is either a GIMPLE ID or a GIMPLE indirect reference. | |
3216 | Returns true if there is an error, otherwise false. */ | |
3217 | ||
3218 | static bool | |
726a989a | 3219 | verify_types_in_gimple_min_lval (tree expr) |
7e98624c RG |
3220 | { |
3221 | tree op; | |
3222 | ||
3223 | if (is_gimple_id (expr)) | |
3224 | return false; | |
3225 | ||
be1ac4ec | 3226 | if (TREE_CODE (expr) != TARGET_MEM_REF |
70f34814 | 3227 | && TREE_CODE (expr) != MEM_REF) |
7e98624c RG |
3228 | { |
3229 | error ("invalid expression for min lvalue"); | |
3230 | return true; | |
3231 | } | |
3232 | ||
9f509004 RG |
3233 | /* TARGET_MEM_REFs are strange beasts. */ |
3234 | if (TREE_CODE (expr) == TARGET_MEM_REF) | |
3235 | return false; | |
3236 | ||
7e98624c RG |
3237 | op = TREE_OPERAND (expr, 0); |
3238 | if (!is_gimple_val (op)) | |
3239 | { | |
3240 | error ("invalid operand in indirect reference"); | |
3241 | debug_generic_stmt (op); | |
3242 | return true; | |
3243 | } | |
70f34814 | 3244 | /* Memory references now generally can involve a value conversion. */ |
7e98624c RG |
3245 | |
3246 | return false; | |
3247 | } | |
3248 | ||
3a19701a RG |
3249 | /* Verify if EXPR is a valid GIMPLE reference expression. If |
3250 | REQUIRE_LVALUE is true verifies it is an lvalue. Returns true | |
7e98624c RG |
3251 | if there is an error, otherwise false. */ |
3252 | ||
3253 | static bool | |
3a19701a | 3254 | verify_types_in_gimple_reference (tree expr, bool require_lvalue) |
7e98624c RG |
3255 | { |
3256 | while (handled_component_p (expr)) | |
3257 | { | |
3258 | tree op = TREE_OPERAND (expr, 0); | |
3259 | ||
3260 | if (TREE_CODE (expr) == ARRAY_REF | |
3261 | || TREE_CODE (expr) == ARRAY_RANGE_REF) | |
3262 | { | |
3263 | if (!is_gimple_val (TREE_OPERAND (expr, 1)) | |
3264 | || (TREE_OPERAND (expr, 2) | |
3265 | && !is_gimple_val (TREE_OPERAND (expr, 2))) | |
3266 | || (TREE_OPERAND (expr, 3) | |
3267 | && !is_gimple_val (TREE_OPERAND (expr, 3)))) | |
3268 | { | |
3269 | error ("invalid operands to array reference"); | |
3270 | debug_generic_stmt (expr); | |
3271 | return true; | |
3272 | } | |
3273 | } | |
3274 | ||
3275 | /* Verify if the reference array element types are compatible. */ | |
3276 | if (TREE_CODE (expr) == ARRAY_REF | |
3277 | && !useless_type_conversion_p (TREE_TYPE (expr), | |
3278 | TREE_TYPE (TREE_TYPE (op)))) | |
3279 | { | |
3280 | error ("type mismatch in array reference"); | |
3281 | debug_generic_stmt (TREE_TYPE (expr)); | |
3282 | debug_generic_stmt (TREE_TYPE (TREE_TYPE (op))); | |
3283 | return true; | |
3284 | } | |
3285 | if (TREE_CODE (expr) == ARRAY_RANGE_REF | |
3286 | && !useless_type_conversion_p (TREE_TYPE (TREE_TYPE (expr)), | |
3287 | TREE_TYPE (TREE_TYPE (op)))) | |
3288 | { | |
3289 | error ("type mismatch in array range reference"); | |
3290 | debug_generic_stmt (TREE_TYPE (TREE_TYPE (expr))); | |
3291 | debug_generic_stmt (TREE_TYPE (TREE_TYPE (op))); | |
3292 | return true; | |
3293 | } | |
3294 | ||
3295 | if ((TREE_CODE (expr) == REALPART_EXPR | |
3296 | || TREE_CODE (expr) == IMAGPART_EXPR) | |
3297 | && !useless_type_conversion_p (TREE_TYPE (expr), | |
3298 | TREE_TYPE (TREE_TYPE (op)))) | |
3299 | { | |
3300 | error ("type mismatch in real/imagpart reference"); | |
3301 | debug_generic_stmt (TREE_TYPE (expr)); | |
3302 | debug_generic_stmt (TREE_TYPE (TREE_TYPE (op))); | |
3303 | return true; | |
3304 | } | |
3305 | ||
3306 | if (TREE_CODE (expr) == COMPONENT_REF | |
3307 | && !useless_type_conversion_p (TREE_TYPE (expr), | |
3308 | TREE_TYPE (TREE_OPERAND (expr, 1)))) | |
3309 | { | |
3310 | error ("type mismatch in component reference"); | |
3311 | debug_generic_stmt (TREE_TYPE (expr)); | |
3312 | debug_generic_stmt (TREE_TYPE (TREE_OPERAND (expr, 1))); | |
3313 | return true; | |
3314 | } | |
3315 | ||
cc12e760 MJ |
3316 | if (TREE_CODE (expr) == VIEW_CONVERT_EXPR) |
3317 | { | |
3318 | /* For VIEW_CONVERT_EXPRs which are allowed here too, we only check | |
3319 | that their operand is not an SSA name or an invariant when | |
3320 | requiring an lvalue (this usually means there is a SRA or IPA-SRA | |
3321 | bug). Otherwise there is nothing to verify, gross mismatches at | |
3322 | most invoke undefined behavior. */ | |
3323 | if (require_lvalue | |
3324 | && (TREE_CODE (op) == SSA_NAME | |
3325 | || is_gimple_min_invariant (op))) | |
3326 | { | |
d8a07487 | 3327 | error ("conversion of an SSA_NAME on the left hand side"); |
cc12e760 MJ |
3328 | debug_generic_stmt (expr); |
3329 | return true; | |
3330 | } | |
70f34814 RG |
3331 | else if (TREE_CODE (op) == SSA_NAME |
3332 | && TYPE_SIZE (TREE_TYPE (expr)) != TYPE_SIZE (TREE_TYPE (op))) | |
3333 | { | |
d8a07487 | 3334 | error ("conversion of register to a different size"); |
70f34814 RG |
3335 | debug_generic_stmt (expr); |
3336 | return true; | |
3337 | } | |
cc12e760 MJ |
3338 | else if (!handled_component_p (op)) |
3339 | return false; | |
3340 | } | |
7e98624c RG |
3341 | |
3342 | expr = op; | |
3343 | } | |
3344 | ||
70f34814 RG |
3345 | if (TREE_CODE (expr) == MEM_REF) |
3346 | { | |
3347 | if (!is_gimple_mem_ref_addr (TREE_OPERAND (expr, 0))) | |
3348 | { | |
d8a07487 | 3349 | error ("invalid address operand in MEM_REF"); |
70f34814 RG |
3350 | debug_generic_stmt (expr); |
3351 | return true; | |
3352 | } | |
3353 | if (TREE_CODE (TREE_OPERAND (expr, 1)) != INTEGER_CST | |
3354 | || !POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (expr, 1)))) | |
3355 | { | |
d8a07487 | 3356 | error ("invalid offset operand in MEM_REF"); |
70f34814 RG |
3357 | debug_generic_stmt (expr); |
3358 | return true; | |
3359 | } | |
3360 | } | |
4b228e61 RG |
3361 | else if (TREE_CODE (expr) == TARGET_MEM_REF) |
3362 | { | |
4d948885 RG |
3363 | if (!TMR_BASE (expr) |
3364 | || !is_gimple_mem_ref_addr (TMR_BASE (expr))) | |
23a534a1 | 3365 | { |
cff41484 | 3366 | error ("invalid address operand in TARGET_MEM_REF"); |
23a534a1 RG |
3367 | return true; |
3368 | } | |
4b228e61 RG |
3369 | if (!TMR_OFFSET (expr) |
3370 | || TREE_CODE (TMR_OFFSET (expr)) != INTEGER_CST | |
3371 | || !POINTER_TYPE_P (TREE_TYPE (TMR_OFFSET (expr)))) | |
3372 | { | |
d8a07487 | 3373 | error ("invalid offset operand in TARGET_MEM_REF"); |
4b228e61 RG |
3374 | debug_generic_stmt (expr); |
3375 | return true; | |
3376 | } | |
3377 | } | |
70f34814 | 3378 | |
3a19701a RG |
3379 | return ((require_lvalue || !is_gimple_min_invariant (expr)) |
3380 | && verify_types_in_gimple_min_lval (expr)); | |
7e98624c RG |
3381 | } |
3382 | ||
20dcff2a RG |
3383 | /* Returns true if there is one pointer type in TYPE_POINTER_TO (SRC_OBJ) |
3384 | list of pointer-to types that is trivially convertible to DEST. */ | |
3385 | ||
3386 | static bool | |
3387 | one_pointer_to_useless_type_conversion_p (tree dest, tree src_obj) | |
3388 | { | |
3389 | tree src; | |
3390 | ||
3391 | if (!TYPE_POINTER_TO (src_obj)) | |
3392 | return true; | |
3393 | ||
3394 | for (src = TYPE_POINTER_TO (src_obj); src; src = TYPE_NEXT_PTR_TO (src)) | |
3395 | if (useless_type_conversion_p (dest, src)) | |
3396 | return true; | |
3397 | ||
3398 | return false; | |
3399 | } | |
3400 | ||
726a989a RB |
3401 | /* Return true if TYPE1 is a fixed-point type and if conversions to and |
3402 | from TYPE2 can be handled by FIXED_CONVERT_EXPR. */ | |
3403 | ||
3404 | static bool | |
3405 | valid_fixed_convert_types_p (tree type1, tree type2) | |
3406 | { | |
3407 | return (FIXED_POINT_TYPE_P (type1) | |
3408 | && (INTEGRAL_TYPE_P (type2) | |
3409 | || SCALAR_FLOAT_TYPE_P (type2) | |
3410 | || FIXED_POINT_TYPE_P (type2))); | |
3411 | } | |
3412 | ||
726a989a RB |
3413 | /* Verify the contents of a GIMPLE_CALL STMT. Returns true when there |
3414 | is a problem, otherwise false. */ | |
3415 | ||
3416 | static bool | |
538dd0b7 | 3417 | verify_gimple_call (gcall *stmt) |
726a989a | 3418 | { |
b59d3976 | 3419 | tree fn = gimple_call_fn (stmt); |
34019e28 | 3420 | tree fntype, fndecl; |
f68a75df RG |
3421 | unsigned i; |
3422 | ||
25583c4f RS |
3423 | if (gimple_call_internal_p (stmt)) |
3424 | { | |
3425 | if (fn) | |
3426 | { | |
3427 | error ("gimple call has two targets"); | |
3428 | debug_generic_stmt (fn); | |
3429 | return true; | |
3430 | } | |
1ee62b92 PG |
3431 | /* FIXME : for passing label as arg in internal fn PHI from GIMPLE FE*/ |
3432 | else if (gimple_call_internal_fn (stmt) == IFN_PHI) | |
3433 | { | |
3434 | return false; | |
3435 | } | |
25583c4f RS |
3436 | } |
3437 | else | |
3438 | { | |
3439 | if (!fn) | |
3440 | { | |
3441 | error ("gimple call has no target"); | |
3442 | return true; | |
3443 | } | |
3444 | } | |
3445 | ||
3446 | if (fn && !is_gimple_call_addr (fn)) | |
f68a75df RG |
3447 | { |
3448 | error ("invalid function in gimple call"); | |
3449 | debug_generic_stmt (fn); | |
3450 | return true; | |
3451 | } | |
726a989a | 3452 | |
25583c4f RS |
3453 | if (fn |
3454 | && (!POINTER_TYPE_P (TREE_TYPE (fn)) | |
3455 | || (TREE_CODE (TREE_TYPE (TREE_TYPE (fn))) != FUNCTION_TYPE | |
3456 | && TREE_CODE (TREE_TYPE (TREE_TYPE (fn))) != METHOD_TYPE))) | |
b59d3976 RG |
3457 | { |
3458 | error ("non-function in gimple call"); | |
3459 | return true; | |
3460 | } | |
726a989a | 3461 | |
34019e28 RG |
3462 | fndecl = gimple_call_fndecl (stmt); |
3463 | if (fndecl | |
3464 | && TREE_CODE (fndecl) == FUNCTION_DECL | |
3465 | && DECL_LOOPING_CONST_OR_PURE_P (fndecl) | |
3466 | && !DECL_PURE_P (fndecl) | |
3467 | && !TREE_READONLY (fndecl)) | |
3468 | { | |
3469 | error ("invalid pure const state for function"); | |
3470 | return true; | |
3471 | } | |
3472 | ||
e6a54b01 EB |
3473 | tree lhs = gimple_call_lhs (stmt); |
3474 | if (lhs | |
3475 | && (!is_gimple_lvalue (lhs) | |
3476 | || verify_types_in_gimple_reference (lhs, true))) | |
b59d3976 RG |
3477 | { |
3478 | error ("invalid LHS in gimple call"); | |
3479 | return true; | |
3480 | } | |
726a989a | 3481 | |
abd3a68c | 3482 | if (gimple_call_ctrl_altering_p (stmt) |
e6a54b01 | 3483 | && gimple_call_noreturn_p (stmt) |
abd3a68c | 3484 | && should_remove_lhs_p (lhs)) |
5de8da9b AO |
3485 | { |
3486 | error ("LHS in noreturn call"); | |
3487 | return true; | |
3488 | } | |
3489 | ||
9bfc434b | 3490 | fntype = gimple_call_fntype (stmt); |
25583c4f | 3491 | if (fntype |
e6a54b01 EB |
3492 | && lhs |
3493 | && !useless_type_conversion_p (TREE_TYPE (lhs), TREE_TYPE (fntype)) | |
b59d3976 RG |
3494 | /* ??? At least C++ misses conversions at assignments from |
3495 | void * call results. | |
3496 | ??? Java is completely off. Especially with functions | |
3497 | returning java.lang.Object. | |
3498 | For now simply allow arbitrary pointer type conversions. */ | |
e6a54b01 | 3499 | && !(POINTER_TYPE_P (TREE_TYPE (lhs)) |
b59d3976 RG |
3500 | && POINTER_TYPE_P (TREE_TYPE (fntype)))) |
3501 | { | |
3502 | error ("invalid conversion in gimple call"); | |
e6a54b01 | 3503 | debug_generic_stmt (TREE_TYPE (lhs)); |
b59d3976 RG |
3504 | debug_generic_stmt (TREE_TYPE (fntype)); |
3505 | return true; | |
3506 | } | |
726a989a | 3507 | |
f68a75df RG |
3508 | if (gimple_call_chain (stmt) |
3509 | && !is_gimple_val (gimple_call_chain (stmt))) | |
3510 | { | |
3511 | error ("invalid static chain in gimple call"); | |
3512 | debug_generic_stmt (gimple_call_chain (stmt)); | |
3513 | return true; | |
3514 | } | |
3515 | ||
f2d3d07e RH |
3516 | /* If there is a static chain argument, the call should either be |
3517 | indirect, or the decl should have DECL_STATIC_CHAIN set. */ | |
3518 | if (gimple_call_chain (stmt) | |
3519 | && fndecl | |
3520 | && !DECL_STATIC_CHAIN (fndecl)) | |
fe663f4e | 3521 | { |
f2d3d07e RH |
3522 | error ("static chain with function that doesn%'t use one"); |
3523 | return true; | |
fe663f4e RH |
3524 | } |
3525 | ||
83f5f27d MJ |
3526 | if (fndecl && DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_NORMAL) |
3527 | { | |
3528 | switch (DECL_FUNCTION_CODE (fndecl)) | |
3529 | { | |
3530 | case BUILT_IN_UNREACHABLE: | |
3531 | case BUILT_IN_TRAP: | |
3532 | if (gimple_call_num_args (stmt) > 0) | |
3533 | { | |
3534 | /* Built-in unreachable with parameters might not be caught by | |
3535 | undefined behavior sanitizer. Front-ends do check users do not | |
3536 | call them that way but we also produce calls to | |
3537 | __builtin_unreachable internally, for example when IPA figures | |
3538 | out a call cannot happen in a legal program. In such cases, | |
3539 | we must make sure arguments are stripped off. */ | |
3540 | error ("__builtin_unreachable or __builtin_trap call with " | |
3541 | "arguments"); | |
3542 | return true; | |
3543 | } | |
3544 | break; | |
3545 | default: | |
3546 | break; | |
3547 | } | |
3548 | } | |
3549 | ||
b59d3976 RG |
3550 | /* ??? The C frontend passes unpromoted arguments in case it |
3551 | didn't see a function declaration before the call. So for now | |
f68a75df | 3552 | leave the call arguments mostly unverified. Once we gimplify |
b59d3976 | 3553 | unit-at-a-time we have a chance to fix this. */ |
726a989a | 3554 | |
f68a75df RG |
3555 | for (i = 0; i < gimple_call_num_args (stmt); ++i) |
3556 | { | |
3557 | tree arg = gimple_call_arg (stmt, i); | |
523968bf RG |
3558 | if ((is_gimple_reg_type (TREE_TYPE (arg)) |
3559 | && !is_gimple_val (arg)) | |
3560 | || (!is_gimple_reg_type (TREE_TYPE (arg)) | |
3561 | && !is_gimple_lvalue (arg))) | |
f68a75df RG |
3562 | { |
3563 | error ("invalid argument to gimple call"); | |
3564 | debug_generic_expr (arg); | |
8957a0ec | 3565 | return true; |
f68a75df RG |
3566 | } |
3567 | } | |
3568 | ||
b59d3976 | 3569 | return false; |
726a989a RB |
3570 | } |
3571 | ||
b59d3976 | 3572 | /* Verifies the gimple comparison with the result type TYPE and |
305708ce | 3573 | the operands OP0 and OP1, comparison code is CODE. */ |
17d23165 RS |
3574 | |
3575 | static bool | |
305708ce | 3576 | verify_gimple_comparison (tree type, tree op0, tree op1, enum tree_code code) |
17d23165 | 3577 | { |
b59d3976 RG |
3578 | tree op0_type = TREE_TYPE (op0); |
3579 | tree op1_type = TREE_TYPE (op1); | |
726a989a | 3580 | |
b59d3976 RG |
3581 | if (!is_gimple_val (op0) || !is_gimple_val (op1)) |
3582 | { | |
3583 | error ("invalid operands in gimple comparison"); | |
3584 | return true; | |
3585 | } | |
17d23165 | 3586 | |
b59d3976 RG |
3587 | /* For comparisons we do not have the operations type as the |
3588 | effective type the comparison is carried out in. Instead | |
3589 | we require that either the first operand is trivially | |
3590 | convertible into the second, or the other way around. | |
b59d3976 RG |
3591 | Because we special-case pointers to void we allow |
3592 | comparisons of pointers with the same mode as well. */ | |
544d960a AS |
3593 | if (!useless_type_conversion_p (op0_type, op1_type) |
3594 | && !useless_type_conversion_p (op1_type, op0_type) | |
3595 | && (!POINTER_TYPE_P (op0_type) | |
3596 | || !POINTER_TYPE_P (op1_type) | |
3597 | || TYPE_MODE (op0_type) != TYPE_MODE (op1_type))) | |
3598 | { | |
3599 | error ("mismatching comparison operand types"); | |
b59d3976 RG |
3600 | debug_generic_expr (op0_type); |
3601 | debug_generic_expr (op1_type); | |
3602 | return true; | |
3603 | } | |
3604 | ||
544d960a AS |
3605 | /* The resulting type of a comparison may be an effective boolean type. */ |
3606 | if (INTEGRAL_TYPE_P (type) | |
3607 | && (TREE_CODE (type) == BOOLEAN_TYPE | |
3608 | || TYPE_PRECISION (type) == 1)) | |
d8d638d9 | 3609 | { |
305708ce YR |
3610 | if ((TREE_CODE (op0_type) == VECTOR_TYPE |
3611 | || TREE_CODE (op1_type) == VECTOR_TYPE) | |
3612 | && code != EQ_EXPR && code != NE_EXPR | |
3613 | && !VECTOR_BOOLEAN_TYPE_P (op0_type) | |
3614 | && !VECTOR_INTEGER_TYPE_P (op0_type)) | |
3615 | { | |
3616 | error ("unsupported operation or type for vector comparison" | |
3617 | " returning a boolean"); | |
3618 | debug_generic_expr (op0_type); | |
3619 | debug_generic_expr (op1_type); | |
3620 | return true; | |
d8d638d9 MG |
3621 | } |
3622 | } | |
9f47c7e5 | 3623 | /* Or a boolean vector type with the same element count |
544d960a AS |
3624 | as the comparison operand types. */ |
3625 | else if (TREE_CODE (type) == VECTOR_TYPE | |
9f47c7e5 | 3626 | && TREE_CODE (TREE_TYPE (type)) == BOOLEAN_TYPE) |
544d960a AS |
3627 | { |
3628 | if (TREE_CODE (op0_type) != VECTOR_TYPE | |
3629 | || TREE_CODE (op1_type) != VECTOR_TYPE) | |
3630 | { | |
3631 | error ("non-vector operands in vector comparison"); | |
3632 | debug_generic_expr (op0_type); | |
3633 | debug_generic_expr (op1_type); | |
3634 | return true; | |
3635 | } | |
3636 | ||
9f47c7e5 | 3637 | if (TYPE_VECTOR_SUBPARTS (type) != TYPE_VECTOR_SUBPARTS (op0_type)) |
544d960a AS |
3638 | { |
3639 | error ("invalid vector comparison resulting type"); | |
3640 | debug_generic_expr (type); | |
3641 | return true; | |
3642 | } | |
3643 | } | |
3644 | else | |
3645 | { | |
3646 | error ("bogus comparison result type"); | |
3647 | debug_generic_expr (type); | |
3648 | return true; | |
3649 | } | |
3650 | ||
b59d3976 RG |
3651 | return false; |
3652 | } | |
726a989a | 3653 | |
9f509004 RG |
3654 | /* Verify a gimple assignment statement STMT with an unary rhs. |
3655 | Returns true if anything is wrong. */ | |
7e98624c RG |
3656 | |
3657 | static bool | |
538dd0b7 | 3658 | verify_gimple_assign_unary (gassign *stmt) |
7e98624c | 3659 | { |
726a989a RB |
3660 | enum tree_code rhs_code = gimple_assign_rhs_code (stmt); |
3661 | tree lhs = gimple_assign_lhs (stmt); | |
726a989a | 3662 | tree lhs_type = TREE_TYPE (lhs); |
9f509004 | 3663 | tree rhs1 = gimple_assign_rhs1 (stmt); |
726a989a | 3664 | tree rhs1_type = TREE_TYPE (rhs1); |
7e98624c | 3665 | |
afdac116 | 3666 | if (!is_gimple_reg (lhs)) |
9f509004 RG |
3667 | { |
3668 | error ("non-register as LHS of unary operation"); | |
3669 | return true; | |
3670 | } | |
3671 | ||
3672 | if (!is_gimple_val (rhs1)) | |
3673 | { | |
3674 | error ("invalid operand in unary operation"); | |
3675 | return true; | |
3676 | } | |
3677 | ||
3678 | /* First handle conversions. */ | |
726a989a | 3679 | switch (rhs_code) |
7e98624c | 3680 | { |
1043771b | 3681 | CASE_CONVERT: |
7e98624c | 3682 | { |
c1d9cb02 | 3683 | /* Allow conversions from pointer type to integral type only if |
9f509004 | 3684 | there is no sign or zero extension involved. |
0d82a1c8 | 3685 | For targets were the precision of ptrofftype doesn't match that |
c1d9cb02 | 3686 | of pointers we need to allow arbitrary conversions to ptrofftype. */ |
9f509004 | 3687 | if ((POINTER_TYPE_P (lhs_type) |
c1d9cb02 | 3688 | && INTEGRAL_TYPE_P (rhs1_type)) |
9f509004 RG |
3689 | || (POINTER_TYPE_P (rhs1_type) |
3690 | && INTEGRAL_TYPE_P (lhs_type) | |
3691 | && (TYPE_PRECISION (rhs1_type) >= TYPE_PRECISION (lhs_type) | |
0d82a1c8 | 3692 | || ptrofftype_p (sizetype)))) |
7e98624c RG |
3693 | return false; |
3694 | ||
819f3b2c | 3695 | /* Allow conversion from integral to offset type and vice versa. */ |
726a989a | 3696 | if ((TREE_CODE (lhs_type) == OFFSET_TYPE |
819f3b2c | 3697 | && INTEGRAL_TYPE_P (rhs1_type)) |
72d5c6c1 RG |
3698 | || (INTEGRAL_TYPE_P (lhs_type) |
3699 | && TREE_CODE (rhs1_type) == OFFSET_TYPE)) | |
7e98624c RG |
3700 | return false; |
3701 | ||
3702 | /* Otherwise assert we are converting between types of the | |
3703 | same kind. */ | |
726a989a | 3704 | if (INTEGRAL_TYPE_P (lhs_type) != INTEGRAL_TYPE_P (rhs1_type)) |
7e98624c RG |
3705 | { |
3706 | error ("invalid types in nop conversion"); | |
726a989a RB |
3707 | debug_generic_expr (lhs_type); |
3708 | debug_generic_expr (rhs1_type); | |
7e98624c RG |
3709 | return true; |
3710 | } | |
3711 | ||
3712 | return false; | |
3713 | } | |
3714 | ||
09e881c9 BE |
3715 | case ADDR_SPACE_CONVERT_EXPR: |
3716 | { | |
3717 | if (!POINTER_TYPE_P (rhs1_type) || !POINTER_TYPE_P (lhs_type) | |
3718 | || (TYPE_ADDR_SPACE (TREE_TYPE (rhs1_type)) | |
3719 | == TYPE_ADDR_SPACE (TREE_TYPE (lhs_type)))) | |
3720 | { | |
3721 | error ("invalid types in address space conversion"); | |
3722 | debug_generic_expr (lhs_type); | |
3723 | debug_generic_expr (rhs1_type); | |
3724 | return true; | |
3725 | } | |
3726 | ||
3727 | return false; | |
3728 | } | |
3729 | ||
17d23165 RS |
3730 | case FIXED_CONVERT_EXPR: |
3731 | { | |
726a989a RB |
3732 | if (!valid_fixed_convert_types_p (lhs_type, rhs1_type) |
3733 | && !valid_fixed_convert_types_p (rhs1_type, lhs_type)) | |
17d23165 RS |
3734 | { |
3735 | error ("invalid types in fixed-point conversion"); | |
726a989a RB |
3736 | debug_generic_expr (lhs_type); |
3737 | debug_generic_expr (rhs1_type); | |
17d23165 RS |
3738 | return true; |
3739 | } | |
3740 | ||
3741 | return false; | |
3742 | } | |
3743 | ||
7e98624c RG |
3744 | case FLOAT_EXPR: |
3745 | { | |
9db8f45d DP |
3746 | if ((!INTEGRAL_TYPE_P (rhs1_type) || !SCALAR_FLOAT_TYPE_P (lhs_type)) |
3747 | && (!VECTOR_INTEGER_TYPE_P (rhs1_type) | |
c3284718 | 3748 | || !VECTOR_FLOAT_TYPE_P (lhs_type))) |
7e98624c RG |
3749 | { |
3750 | error ("invalid types in conversion to floating point"); | |
726a989a RB |
3751 | debug_generic_expr (lhs_type); |
3752 | debug_generic_expr (rhs1_type); | |
7e98624c RG |
3753 | return true; |
3754 | } | |
726a989a | 3755 | |
7e98624c RG |
3756 | return false; |
3757 | } | |
3758 | ||
3759 | case FIX_TRUNC_EXPR: | |
3760 | { | |
9db8f45d DP |
3761 | if ((!INTEGRAL_TYPE_P (lhs_type) || !SCALAR_FLOAT_TYPE_P (rhs1_type)) |
3762 | && (!VECTOR_INTEGER_TYPE_P (lhs_type) | |
c3284718 | 3763 | || !VECTOR_FLOAT_TYPE_P (rhs1_type))) |
7e98624c RG |
3764 | { |
3765 | error ("invalid types in conversion to integer"); | |
726a989a RB |
3766 | debug_generic_expr (lhs_type); |
3767 | debug_generic_expr (rhs1_type); | |
7e98624c RG |
3768 | return true; |
3769 | } | |
726a989a | 3770 | |
7e98624c RG |
3771 | return false; |
3772 | } | |
587aa063 RG |
3773 | case REDUC_MAX_EXPR: |
3774 | case REDUC_MIN_EXPR: | |
3775 | case REDUC_PLUS_EXPR: | |
99f76d9b AL |
3776 | if (!VECTOR_TYPE_P (rhs1_type) |
3777 | || !useless_type_conversion_p (lhs_type, TREE_TYPE (rhs1_type))) | |
3778 | { | |
3779 | error ("reduction should convert from vector to element type"); | |
3780 | debug_generic_expr (lhs_type); | |
3781 | debug_generic_expr (rhs1_type); | |
3782 | return true; | |
3783 | } | |
3784 | return false; | |
3785 | ||
3786 | case VEC_UNPACK_HI_EXPR: | |
3787 | case VEC_UNPACK_LO_EXPR: | |
587aa063 RG |
3788 | case VEC_UNPACK_FLOAT_HI_EXPR: |
3789 | case VEC_UNPACK_FLOAT_LO_EXPR: | |
3790 | /* FIXME. */ | |
3791 | return false; | |
9f509004 RG |
3792 | |
3793 | case NEGATE_EXPR: | |
3794 | case ABS_EXPR: | |
3795 | case BIT_NOT_EXPR: | |
3796 | case PAREN_EXPR: | |
9f509004 | 3797 | case CONJ_EXPR: |
9f509004 RG |
3798 | break; |
3799 | ||
3800 | default: | |
3801 | gcc_unreachable (); | |
3802 | } | |
3803 | ||
3804 | /* For the remaining codes assert there is no conversion involved. */ | |
3805 | if (!useless_type_conversion_p (lhs_type, rhs1_type)) | |
3806 | { | |
3807 | error ("non-trivial conversion in unary operation"); | |
3808 | debug_generic_expr (lhs_type); | |
3809 | debug_generic_expr (rhs1_type); | |
3810 | return true; | |
3811 | } | |
3812 | ||
3813 | return false; | |
3814 | } | |
3815 | ||
3816 | /* Verify a gimple assignment statement STMT with a binary rhs. | |
3817 | Returns true if anything is wrong. */ | |
3818 | ||
3819 | static bool | |
538dd0b7 | 3820 | verify_gimple_assign_binary (gassign *stmt) |
9f509004 RG |
3821 | { |
3822 | enum tree_code rhs_code = gimple_assign_rhs_code (stmt); | |
3823 | tree lhs = gimple_assign_lhs (stmt); | |
3824 | tree lhs_type = TREE_TYPE (lhs); | |
3825 | tree rhs1 = gimple_assign_rhs1 (stmt); | |
3826 | tree rhs1_type = TREE_TYPE (rhs1); | |
3827 | tree rhs2 = gimple_assign_rhs2 (stmt); | |
3828 | tree rhs2_type = TREE_TYPE (rhs2); | |
3829 | ||
afdac116 | 3830 | if (!is_gimple_reg (lhs)) |
9f509004 RG |
3831 | { |
3832 | error ("non-register as LHS of binary operation"); | |
3833 | return true; | |
3834 | } | |
726a989a | 3835 | |
9f509004 RG |
3836 | if (!is_gimple_val (rhs1) |
3837 | || !is_gimple_val (rhs2)) | |
3838 | { | |
3839 | error ("invalid operands in binary operation"); | |
3840 | return true; | |
3841 | } | |
3842 | ||
3843 | /* First handle operations that involve different types. */ | |
3844 | switch (rhs_code) | |
3845 | { | |
3846 | case COMPLEX_EXPR: | |
3847 | { | |
3848 | if (TREE_CODE (lhs_type) != COMPLEX_TYPE | |
3849 | || !(INTEGRAL_TYPE_P (rhs1_type) | |
726a989a | 3850 | || SCALAR_FLOAT_TYPE_P (rhs1_type)) |
9f509004 | 3851 | || !(INTEGRAL_TYPE_P (rhs2_type) |
726a989a | 3852 | || SCALAR_FLOAT_TYPE_P (rhs2_type))) |
7e98624c RG |
3853 | { |
3854 | error ("type mismatch in complex expression"); | |
726a989a RB |
3855 | debug_generic_expr (lhs_type); |
3856 | debug_generic_expr (rhs1_type); | |
3857 | debug_generic_expr (rhs2_type); | |
7e98624c RG |
3858 | return true; |
3859 | } | |
726a989a | 3860 | |
7e98624c RG |
3861 | return false; |
3862 | } | |
3863 | ||
7e98624c RG |
3864 | case LSHIFT_EXPR: |
3865 | case RSHIFT_EXPR: | |
3866 | case LROTATE_EXPR: | |
3867 | case RROTATE_EXPR: | |
3868 | { | |
587aa063 RG |
3869 | /* Shifts and rotates are ok on integral types, fixed point |
3870 | types and integer vector types. */ | |
3871 | if ((!INTEGRAL_TYPE_P (rhs1_type) | |
3872 | && !FIXED_POINT_TYPE_P (rhs1_type) | |
3873 | && !(TREE_CODE (rhs1_type) == VECTOR_TYPE | |
bf8e3b77 | 3874 | && INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type)))) |
587aa063 RG |
3875 | || (!INTEGRAL_TYPE_P (rhs2_type) |
3876 | /* Vector shifts of vectors are also ok. */ | |
3877 | && !(TREE_CODE (rhs1_type) == VECTOR_TYPE | |
bf8e3b77 | 3878 | && INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type)) |
587aa063 | 3879 | && TREE_CODE (rhs2_type) == VECTOR_TYPE |
bf8e3b77 | 3880 | && INTEGRAL_TYPE_P (TREE_TYPE (rhs2_type)))) |
726a989a | 3881 | || !useless_type_conversion_p (lhs_type, rhs1_type)) |
7e98624c RG |
3882 | { |
3883 | error ("type mismatch in shift expression"); | |
726a989a RB |
3884 | debug_generic_expr (lhs_type); |
3885 | debug_generic_expr (rhs1_type); | |
3886 | debug_generic_expr (rhs2_type); | |
7e98624c RG |
3887 | return true; |
3888 | } | |
726a989a | 3889 | |
7e98624c RG |
3890 | return false; |
3891 | } | |
3892 | ||
36ba4aae IR |
3893 | case WIDEN_LSHIFT_EXPR: |
3894 | { | |
3895 | if (!INTEGRAL_TYPE_P (lhs_type) | |
3896 | || !INTEGRAL_TYPE_P (rhs1_type) | |
3897 | || TREE_CODE (rhs2) != INTEGER_CST | |
3898 | || (2 * TYPE_PRECISION (rhs1_type) > TYPE_PRECISION (lhs_type))) | |
3899 | { | |
3900 | error ("type mismatch in widening vector shift expression"); | |
3901 | debug_generic_expr (lhs_type); | |
3902 | debug_generic_expr (rhs1_type); | |
3903 | debug_generic_expr (rhs2_type); | |
3904 | return true; | |
3905 | } | |
3906 | ||
3907 | return false; | |
3908 | } | |
3909 | ||
3910 | case VEC_WIDEN_LSHIFT_HI_EXPR: | |
3911 | case VEC_WIDEN_LSHIFT_LO_EXPR: | |
3912 | { | |
3913 | if (TREE_CODE (rhs1_type) != VECTOR_TYPE | |
3914 | || TREE_CODE (lhs_type) != VECTOR_TYPE | |
3915 | || !INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type)) | |
3916 | || !INTEGRAL_TYPE_P (TREE_TYPE (lhs_type)) | |
3917 | || TREE_CODE (rhs2) != INTEGER_CST | |
3918 | || (2 * TYPE_PRECISION (TREE_TYPE (rhs1_type)) | |
3919 | > TYPE_PRECISION (TREE_TYPE (lhs_type)))) | |
3920 | { | |
3921 | error ("type mismatch in widening vector shift expression"); | |
3922 | debug_generic_expr (lhs_type); | |
3923 | debug_generic_expr (rhs1_type); | |
3924 | debug_generic_expr (rhs2_type); | |
3925 | return true; | |
3926 | } | |
3927 | ||
3928 | return false; | |
3929 | } | |
3930 | ||
646bea10 | 3931 | case PLUS_EXPR: |
cc99c5fe | 3932 | case MINUS_EXPR: |
646bea10 | 3933 | { |
e67f39f7 RB |
3934 | tree lhs_etype = lhs_type; |
3935 | tree rhs1_etype = rhs1_type; | |
3936 | tree rhs2_etype = rhs2_type; | |
3937 | if (TREE_CODE (lhs_type) == VECTOR_TYPE) | |
646bea10 RG |
3938 | { |
3939 | if (TREE_CODE (rhs1_type) != VECTOR_TYPE | |
3940 | || TREE_CODE (rhs2_type) != VECTOR_TYPE) | |
3941 | { | |
3942 | error ("invalid non-vector operands to vector valued plus"); | |
3943 | return true; | |
3944 | } | |
e67f39f7 RB |
3945 | lhs_etype = TREE_TYPE (lhs_type); |
3946 | rhs1_etype = TREE_TYPE (rhs1_type); | |
3947 | rhs2_etype = TREE_TYPE (rhs2_type); | |
646bea10 | 3948 | } |
e67f39f7 RB |
3949 | if (POINTER_TYPE_P (lhs_etype) |
3950 | || POINTER_TYPE_P (rhs1_etype) | |
3951 | || POINTER_TYPE_P (rhs2_etype)) | |
646bea10 RG |
3952 | { |
3953 | error ("invalid (pointer) operands to plus/minus"); | |
3954 | return true; | |
3955 | } | |
3956 | ||
3957 | /* Continue with generic binary expression handling. */ | |
3958 | break; | |
3959 | } | |
3960 | ||
7e98624c RG |
3961 | case POINTER_PLUS_EXPR: |
3962 | { | |
726a989a RB |
3963 | if (!POINTER_TYPE_P (rhs1_type) |
3964 | || !useless_type_conversion_p (lhs_type, rhs1_type) | |
370f4759 | 3965 | || !ptrofftype_p (rhs2_type)) |
7e98624c RG |
3966 | { |
3967 | error ("type mismatch in pointer plus expression"); | |
726a989a RB |
3968 | debug_generic_stmt (lhs_type); |
3969 | debug_generic_stmt (rhs1_type); | |
3970 | debug_generic_stmt (rhs2_type); | |
7e98624c RG |
3971 | return true; |
3972 | } | |
7e98624c | 3973 | |
726a989a | 3974 | return false; |
b8698a0f | 3975 | } |
7e98624c | 3976 | |
7e98624c RG |
3977 | case TRUTH_ANDIF_EXPR: |
3978 | case TRUTH_ORIF_EXPR: | |
3979 | case TRUTH_AND_EXPR: | |
3980 | case TRUTH_OR_EXPR: | |
3981 | case TRUTH_XOR_EXPR: | |
7e98624c | 3982 | |
da5fb469 | 3983 | gcc_unreachable (); |
7e98624c | 3984 | |
9f509004 RG |
3985 | case LT_EXPR: |
3986 | case LE_EXPR: | |
3987 | case GT_EXPR: | |
3988 | case GE_EXPR: | |
3989 | case EQ_EXPR: | |
3990 | case NE_EXPR: | |
3991 | case UNORDERED_EXPR: | |
3992 | case ORDERED_EXPR: | |
3993 | case UNLT_EXPR: | |
3994 | case UNLE_EXPR: | |
3995 | case UNGT_EXPR: | |
3996 | case UNGE_EXPR: | |
3997 | case UNEQ_EXPR: | |
3998 | case LTGT_EXPR: | |
3999 | /* Comparisons are also binary, but the result type is not | |
4000 | connected to the operand types. */ | |
305708ce | 4001 | return verify_gimple_comparison (lhs_type, rhs1, rhs2, rhs_code); |
7e98624c | 4002 | |
587aa063 | 4003 | case WIDEN_MULT_EXPR: |
5b58b39b BS |
4004 | if (TREE_CODE (lhs_type) != INTEGER_TYPE) |
4005 | return true; | |
5dfe80ba | 4006 | return ((2 * TYPE_PRECISION (rhs1_type) > TYPE_PRECISION (lhs_type)) |
5b58b39b BS |
4007 | || (TYPE_PRECISION (rhs1_type) != TYPE_PRECISION (rhs2_type))); |
4008 | ||
4009 | case WIDEN_SUM_EXPR: | |
587aa063 RG |
4010 | case VEC_WIDEN_MULT_HI_EXPR: |
4011 | case VEC_WIDEN_MULT_LO_EXPR: | |
3f30a9a6 RH |
4012 | case VEC_WIDEN_MULT_EVEN_EXPR: |
4013 | case VEC_WIDEN_MULT_ODD_EXPR: | |
587aa063 RG |
4014 | case VEC_PACK_TRUNC_EXPR: |
4015 | case VEC_PACK_SAT_EXPR: | |
4016 | case VEC_PACK_FIX_TRUNC_EXPR: | |
587aa063 RG |
4017 | /* FIXME. */ |
4018 | return false; | |
4019 | ||
9f509004 | 4020 | case MULT_EXPR: |
98449720 | 4021 | case MULT_HIGHPART_EXPR: |
9f509004 RG |
4022 | case TRUNC_DIV_EXPR: |
4023 | case CEIL_DIV_EXPR: | |
4024 | case FLOOR_DIV_EXPR: | |
4025 | case ROUND_DIV_EXPR: | |
4026 | case TRUNC_MOD_EXPR: | |
4027 | case CEIL_MOD_EXPR: | |
4028 | case FLOOR_MOD_EXPR: | |
4029 | case ROUND_MOD_EXPR: | |
4030 | case RDIV_EXPR: | |
4031 | case EXACT_DIV_EXPR: | |
4032 | case MIN_EXPR: | |
4033 | case MAX_EXPR: | |
4034 | case BIT_IOR_EXPR: | |
4035 | case BIT_XOR_EXPR: | |
4036 | case BIT_AND_EXPR: | |
9f509004 RG |
4037 | /* Continue with generic binary expression handling. */ |
4038 | break; | |
7e98624c | 4039 | |
9f509004 RG |
4040 | default: |
4041 | gcc_unreachable (); | |
4042 | } | |
b691d4b0 | 4043 | |
9f509004 RG |
4044 | if (!useless_type_conversion_p (lhs_type, rhs1_type) |
4045 | || !useless_type_conversion_p (lhs_type, rhs2_type)) | |
4046 | { | |
4047 | error ("type mismatch in binary expression"); | |
4048 | debug_generic_stmt (lhs_type); | |
4049 | debug_generic_stmt (rhs1_type); | |
4050 | debug_generic_stmt (rhs2_type); | |
4051 | return true; | |
4052 | } | |
4053 | ||
4054 | return false; | |
4055 | } | |
4056 | ||
0354c0c7 BS |
4057 | /* Verify a gimple assignment statement STMT with a ternary rhs. |
4058 | Returns true if anything is wrong. */ | |
4059 | ||
4060 | static bool | |
538dd0b7 | 4061 | verify_gimple_assign_ternary (gassign *stmt) |
0354c0c7 BS |
4062 | { |
4063 | enum tree_code rhs_code = gimple_assign_rhs_code (stmt); | |
4064 | tree lhs = gimple_assign_lhs (stmt); | |
4065 | tree lhs_type = TREE_TYPE (lhs); | |
4066 | tree rhs1 = gimple_assign_rhs1 (stmt); | |
4067 | tree rhs1_type = TREE_TYPE (rhs1); | |
4068 | tree rhs2 = gimple_assign_rhs2 (stmt); | |
4069 | tree rhs2_type = TREE_TYPE (rhs2); | |
4070 | tree rhs3 = gimple_assign_rhs3 (stmt); | |
4071 | tree rhs3_type = TREE_TYPE (rhs3); | |
4072 | ||
afdac116 | 4073 | if (!is_gimple_reg (lhs)) |
0354c0c7 BS |
4074 | { |
4075 | error ("non-register as LHS of ternary operation"); | |
4076 | return true; | |
4077 | } | |
4078 | ||
4e71066d RG |
4079 | if (((rhs_code == VEC_COND_EXPR || rhs_code == COND_EXPR) |
4080 | ? !is_gimple_condexpr (rhs1) : !is_gimple_val (rhs1)) | |
0354c0c7 BS |
4081 | || !is_gimple_val (rhs2) |
4082 | || !is_gimple_val (rhs3)) | |
4083 | { | |
4084 | error ("invalid operands in ternary operation"); | |
4085 | return true; | |
4086 | } | |
4087 | ||
4088 | /* First handle operations that involve different types. */ | |
4089 | switch (rhs_code) | |
4090 | { | |
4091 | case WIDEN_MULT_PLUS_EXPR: | |
4092 | case WIDEN_MULT_MINUS_EXPR: | |
4093 | if ((!INTEGRAL_TYPE_P (rhs1_type) | |
4094 | && !FIXED_POINT_TYPE_P (rhs1_type)) | |
4095 | || !useless_type_conversion_p (rhs1_type, rhs2_type) | |
4096 | || !useless_type_conversion_p (lhs_type, rhs3_type) | |
5dfe80ba | 4097 | || 2 * TYPE_PRECISION (rhs1_type) > TYPE_PRECISION (lhs_type) |
0354c0c7 BS |
4098 | || TYPE_PRECISION (rhs1_type) != TYPE_PRECISION (rhs2_type)) |
4099 | { | |
4100 | error ("type mismatch in widening multiply-accumulate expression"); | |
4101 | debug_generic_expr (lhs_type); | |
4102 | debug_generic_expr (rhs1_type); | |
4103 | debug_generic_expr (rhs2_type); | |
4104 | debug_generic_expr (rhs3_type); | |
4105 | return true; | |
4106 | } | |
4107 | break; | |
4108 | ||
16949072 RG |
4109 | case FMA_EXPR: |
4110 | if (!useless_type_conversion_p (lhs_type, rhs1_type) | |
4111 | || !useless_type_conversion_p (lhs_type, rhs2_type) | |
4112 | || !useless_type_conversion_p (lhs_type, rhs3_type)) | |
4113 | { | |
4114 | error ("type mismatch in fused multiply-add expression"); | |
4115 | debug_generic_expr (lhs_type); | |
4116 | debug_generic_expr (rhs1_type); | |
4117 | debug_generic_expr (rhs2_type); | |
4118 | debug_generic_expr (rhs3_type); | |
4119 | return true; | |
4120 | } | |
4121 | break; | |
4122 | ||
4e71066d | 4123 | case VEC_COND_EXPR: |
9f47c7e5 | 4124 | if (!VECTOR_BOOLEAN_TYPE_P (rhs1_type) |
3958eee1 MG |
4125 | || TYPE_VECTOR_SUBPARTS (rhs1_type) |
4126 | != TYPE_VECTOR_SUBPARTS (lhs_type)) | |
4127 | { | |
9f47c7e5 IE |
4128 | error ("the first argument of a VEC_COND_EXPR must be of a " |
4129 | "boolean vector type of the same number of elements " | |
4130 | "as the result"); | |
3958eee1 MG |
4131 | debug_generic_expr (lhs_type); |
4132 | debug_generic_expr (rhs1_type); | |
4133 | return true; | |
4134 | } | |
4135 | /* Fallthrough. */ | |
4136 | case COND_EXPR: | |
4e71066d RG |
4137 | if (!useless_type_conversion_p (lhs_type, rhs2_type) |
4138 | || !useless_type_conversion_p (lhs_type, rhs3_type)) | |
4139 | { | |
4140 | error ("type mismatch in conditional expression"); | |
4141 | debug_generic_expr (lhs_type); | |
4142 | debug_generic_expr (rhs2_type); | |
4143 | debug_generic_expr (rhs3_type); | |
4144 | return true; | |
4145 | } | |
4146 | break; | |
4147 | ||
2205ed25 | 4148 | case VEC_PERM_EXPR: |
f90e8e2e AS |
4149 | if (!useless_type_conversion_p (lhs_type, rhs1_type) |
4150 | || !useless_type_conversion_p (lhs_type, rhs2_type)) | |
4151 | { | |
2205ed25 | 4152 | error ("type mismatch in vector permute expression"); |
f90e8e2e AS |
4153 | debug_generic_expr (lhs_type); |
4154 | debug_generic_expr (rhs1_type); | |
4155 | debug_generic_expr (rhs2_type); | |
4156 | debug_generic_expr (rhs3_type); | |
4157 | return true; | |
4158 | } | |
4159 | ||
4160 | if (TREE_CODE (rhs1_type) != VECTOR_TYPE | |
4161 | || TREE_CODE (rhs2_type) != VECTOR_TYPE | |
4162 | || TREE_CODE (rhs3_type) != VECTOR_TYPE) | |
4163 | { | |
2205ed25 | 4164 | error ("vector types expected in vector permute expression"); |
f90e8e2e AS |
4165 | debug_generic_expr (lhs_type); |
4166 | debug_generic_expr (rhs1_type); | |
4167 | debug_generic_expr (rhs2_type); | |
4168 | debug_generic_expr (rhs3_type); | |
4169 | return true; | |
4170 | } | |
4171 | ||
4172 | if (TYPE_VECTOR_SUBPARTS (rhs1_type) != TYPE_VECTOR_SUBPARTS (rhs2_type) | |
4173 | || TYPE_VECTOR_SUBPARTS (rhs2_type) | |
4174 | != TYPE_VECTOR_SUBPARTS (rhs3_type) | |
4175 | || TYPE_VECTOR_SUBPARTS (rhs3_type) | |
4176 | != TYPE_VECTOR_SUBPARTS (lhs_type)) | |
4177 | { | |
4178 | error ("vectors with different element number found " | |
2205ed25 | 4179 | "in vector permute expression"); |
f90e8e2e AS |
4180 | debug_generic_expr (lhs_type); |
4181 | debug_generic_expr (rhs1_type); | |
4182 | debug_generic_expr (rhs2_type); | |
4183 | debug_generic_expr (rhs3_type); | |
4184 | return true; | |
4185 | } | |
4186 | ||
4187 | if (TREE_CODE (TREE_TYPE (rhs3_type)) != INTEGER_TYPE | |
4188 | || GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (rhs3_type))) | |
4189 | != GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (rhs1_type)))) | |
4190 | { | |
2205ed25 | 4191 | error ("invalid mask type in vector permute expression"); |
f90e8e2e AS |
4192 | debug_generic_expr (lhs_type); |
4193 | debug_generic_expr (rhs1_type); | |
4194 | debug_generic_expr (rhs2_type); | |
4195 | debug_generic_expr (rhs3_type); | |
4196 | return true; | |
4197 | } | |
4198 | ||
4199 | return false; | |
4200 | ||
79d652a5 CH |
4201 | case SAD_EXPR: |
4202 | if (!useless_type_conversion_p (rhs1_type, rhs2_type) | |
4203 | || !useless_type_conversion_p (lhs_type, rhs3_type) | |
6c825cd4 DS |
4204 | || 2 * GET_MODE_UNIT_BITSIZE (TYPE_MODE (TREE_TYPE (rhs1_type))) |
4205 | > GET_MODE_UNIT_BITSIZE (TYPE_MODE (TREE_TYPE (lhs_type)))) | |
79d652a5 CH |
4206 | { |
4207 | error ("type mismatch in sad expression"); | |
4208 | debug_generic_expr (lhs_type); | |
4209 | debug_generic_expr (rhs1_type); | |
4210 | debug_generic_expr (rhs2_type); | |
4211 | debug_generic_expr (rhs3_type); | |
4212 | return true; | |
4213 | } | |
4214 | ||
4215 | if (TREE_CODE (rhs1_type) != VECTOR_TYPE | |
4216 | || TREE_CODE (rhs2_type) != VECTOR_TYPE | |
4217 | || TREE_CODE (rhs3_type) != VECTOR_TYPE) | |
4218 | { | |
4219 | error ("vector types expected in sad expression"); | |
4220 | debug_generic_expr (lhs_type); | |
4221 | debug_generic_expr (rhs1_type); | |
4222 | debug_generic_expr (rhs2_type); | |
4223 | debug_generic_expr (rhs3_type); | |
4224 | return true; | |
4225 | } | |
4226 | ||
4227 | return false; | |
4228 | ||
483c6429 RG |
4229 | case BIT_INSERT_EXPR: |
4230 | if (! useless_type_conversion_p (lhs_type, rhs1_type)) | |
4231 | { | |
4232 | error ("type mismatch in BIT_INSERT_EXPR"); | |
4233 | debug_generic_expr (lhs_type); | |
4234 | debug_generic_expr (rhs1_type); | |
4235 | return true; | |
4236 | } | |
4237 | if (! ((INTEGRAL_TYPE_P (rhs1_type) | |
4238 | && INTEGRAL_TYPE_P (rhs2_type)) | |
4239 | || (VECTOR_TYPE_P (rhs1_type) | |
4240 | && types_compatible_p (TREE_TYPE (rhs1_type), rhs2_type)))) | |
4241 | { | |
4242 | error ("not allowed type combination in BIT_INSERT_EXPR"); | |
4243 | debug_generic_expr (rhs1_type); | |
4244 | debug_generic_expr (rhs2_type); | |
4245 | return true; | |
4246 | } | |
4247 | if (! tree_fits_uhwi_p (rhs3) | |
4248 | || ! tree_fits_uhwi_p (TYPE_SIZE (rhs2_type))) | |
4249 | { | |
4250 | error ("invalid position or size in BIT_INSERT_EXPR"); | |
4251 | return true; | |
4252 | } | |
4253 | if (INTEGRAL_TYPE_P (rhs1_type)) | |
4254 | { | |
4255 | unsigned HOST_WIDE_INT bitpos = tree_to_uhwi (rhs3); | |
4256 | if (bitpos >= TYPE_PRECISION (rhs1_type) | |
4257 | || (bitpos + TYPE_PRECISION (rhs2_type) | |
4258 | > TYPE_PRECISION (rhs1_type))) | |
4259 | { | |
4260 | error ("insertion out of range in BIT_INSERT_EXPR"); | |
4261 | return true; | |
4262 | } | |
4263 | } | |
4264 | else if (VECTOR_TYPE_P (rhs1_type)) | |
4265 | { | |
4266 | unsigned HOST_WIDE_INT bitpos = tree_to_uhwi (rhs3); | |
4267 | unsigned HOST_WIDE_INT bitsize = tree_to_uhwi (TYPE_SIZE (rhs2_type)); | |
4268 | if (bitpos % bitsize != 0) | |
4269 | { | |
4270 | error ("vector insertion not at element boundary"); | |
4271 | return true; | |
4272 | } | |
4273 | } | |
4274 | return false; | |
4275 | ||
f471fe72 RG |
4276 | case DOT_PROD_EXPR: |
4277 | case REALIGN_LOAD_EXPR: | |
4278 | /* FIXME. */ | |
4279 | return false; | |
4280 | ||
0354c0c7 BS |
4281 | default: |
4282 | gcc_unreachable (); | |
4283 | } | |
4284 | return false; | |
4285 | } | |
4286 | ||
9f509004 RG |
4287 | /* Verify a gimple assignment statement STMT with a single rhs. |
4288 | Returns true if anything is wrong. */ | |
4289 | ||
4290 | static bool | |
538dd0b7 | 4291 | verify_gimple_assign_single (gassign *stmt) |
9f509004 RG |
4292 | { |
4293 | enum tree_code rhs_code = gimple_assign_rhs_code (stmt); | |
4294 | tree lhs = gimple_assign_lhs (stmt); | |
4295 | tree lhs_type = TREE_TYPE (lhs); | |
4296 | tree rhs1 = gimple_assign_rhs1 (stmt); | |
4297 | tree rhs1_type = TREE_TYPE (rhs1); | |
4298 | bool res = false; | |
4299 | ||
4300 | if (!useless_type_conversion_p (lhs_type, rhs1_type)) | |
4301 | { | |
4302 | error ("non-trivial conversion at assignment"); | |
4303 | debug_generic_expr (lhs_type); | |
4304 | debug_generic_expr (rhs1_type); | |
4305 | return true; | |
7e98624c RG |
4306 | } |
4307 | ||
5f33a4fc | 4308 | if (gimple_clobber_p (stmt) |
5d751b0c | 4309 | && !(DECL_P (lhs) || TREE_CODE (lhs) == MEM_REF)) |
5f33a4fc | 4310 | { |
5d751b0c | 4311 | error ("non-decl/MEM_REF LHS in clobber statement"); |
5f33a4fc RG |
4312 | debug_generic_expr (lhs); |
4313 | return true; | |
4314 | } | |
4315 | ||
efd2d3c8 RB |
4316 | if (handled_component_p (lhs) |
4317 | || TREE_CODE (lhs) == MEM_REF | |
4318 | || TREE_CODE (lhs) == TARGET_MEM_REF) | |
3a19701a | 4319 | res |= verify_types_in_gimple_reference (lhs, true); |
9f509004 RG |
4320 | |
4321 | /* Special codes we cannot handle via their class. */ | |
4322 | switch (rhs_code) | |
7e98624c | 4323 | { |
9f509004 RG |
4324 | case ADDR_EXPR: |
4325 | { | |
4326 | tree op = TREE_OPERAND (rhs1, 0); | |
4327 | if (!is_gimple_addressable (op)) | |
4328 | { | |
4329 | error ("invalid operand in unary expression"); | |
4330 | return true; | |
4331 | } | |
f5e85907 | 4332 | |
1b0e3802 RG |
4333 | /* Technically there is no longer a need for matching types, but |
4334 | gimple hygiene asks for this check. In LTO we can end up | |
4335 | combining incompatible units and thus end up with addresses | |
4336 | of globals that change their type to a common one. */ | |
4337 | if (!in_lto_p | |
4338 | && !types_compatible_p (TREE_TYPE (op), | |
4339 | TREE_TYPE (TREE_TYPE (rhs1))) | |
6b8b9e42 RG |
4340 | && !one_pointer_to_useless_type_conversion_p (TREE_TYPE (rhs1), |
4341 | TREE_TYPE (op))) | |
9f509004 RG |
4342 | { |
4343 | error ("type mismatch in address expression"); | |
6b8b9e42 RG |
4344 | debug_generic_stmt (TREE_TYPE (rhs1)); |
4345 | debug_generic_stmt (TREE_TYPE (op)); | |
9f509004 RG |
4346 | return true; |
4347 | } | |
4348 | ||
3a19701a | 4349 | return verify_types_in_gimple_reference (op, true); |
9f509004 RG |
4350 | } |
4351 | ||
4352 | /* tcc_reference */ | |
70f34814 RG |
4353 | case INDIRECT_REF: |
4354 | error ("INDIRECT_REF in gimple IL"); | |
4355 | return true; | |
4356 | ||
9f509004 RG |
4357 | case COMPONENT_REF: |
4358 | case BIT_FIELD_REF: | |
9f509004 RG |
4359 | case ARRAY_REF: |
4360 | case ARRAY_RANGE_REF: | |
4361 | case VIEW_CONVERT_EXPR: | |
4362 | case REALPART_EXPR: | |
4363 | case IMAGPART_EXPR: | |
4364 | case TARGET_MEM_REF: | |
70f34814 | 4365 | case MEM_REF: |
9f509004 RG |
4366 | if (!is_gimple_reg (lhs) |
4367 | && is_gimple_reg_type (TREE_TYPE (lhs))) | |
f5e85907 | 4368 | { |
9f509004 RG |
4369 | error ("invalid rhs for gimple memory store"); |
4370 | debug_generic_stmt (lhs); | |
4371 | debug_generic_stmt (rhs1); | |
726a989a RB |
4372 | return true; |
4373 | } | |
3a19701a | 4374 | return res || verify_types_in_gimple_reference (rhs1, false); |
7e98624c | 4375 | |
9f509004 RG |
4376 | /* tcc_constant */ |
4377 | case SSA_NAME: | |
4378 | case INTEGER_CST: | |
4379 | case REAL_CST: | |
4380 | case FIXED_CST: | |
4381 | case COMPLEX_CST: | |
4382 | case VECTOR_CST: | |
4383 | case STRING_CST: | |
4384 | return res; | |
4385 | ||
4386 | /* tcc_declaration */ | |
4387 | case CONST_DECL: | |
4388 | return res; | |
4389 | case VAR_DECL: | |
4390 | case PARM_DECL: | |
4391 | if (!is_gimple_reg (lhs) | |
4392 | && !is_gimple_reg (rhs1) | |
4393 | && is_gimple_reg_type (TREE_TYPE (lhs))) | |
2f9864e6 | 4394 | { |
9f509004 RG |
4395 | error ("invalid rhs for gimple memory store"); |
4396 | debug_generic_stmt (lhs); | |
4397 | debug_generic_stmt (rhs1); | |
2f9864e6 RG |
4398 | return true; |
4399 | } | |
9f509004 | 4400 | return res; |
7e98624c | 4401 | |
9f509004 | 4402 | case CONSTRUCTOR: |
13396b6e JJ |
4403 | if (TREE_CODE (rhs1_type) == VECTOR_TYPE) |
4404 | { | |
4405 | unsigned int i; | |
4406 | tree elt_i, elt_v, elt_t = NULL_TREE; | |
4407 | ||
4408 | if (CONSTRUCTOR_NELTS (rhs1) == 0) | |
4409 | return res; | |
4410 | /* For vector CONSTRUCTORs we require that either it is empty | |
4411 | CONSTRUCTOR, or it is a CONSTRUCTOR of smaller vector elements | |
4412 | (then the element count must be correct to cover the whole | |
4413 | outer vector and index must be NULL on all elements, or it is | |
4414 | a CONSTRUCTOR of scalar elements, where we as an exception allow | |
4415 | smaller number of elements (assuming zero filling) and | |
4416 | consecutive indexes as compared to NULL indexes (such | |
4417 | CONSTRUCTORs can appear in the IL from FEs). */ | |
4418 | FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (rhs1), i, elt_i, elt_v) | |
4419 | { | |
4420 | if (elt_t == NULL_TREE) | |
4421 | { | |
4422 | elt_t = TREE_TYPE (elt_v); | |
4423 | if (TREE_CODE (elt_t) == VECTOR_TYPE) | |
4424 | { | |
4425 | tree elt_t = TREE_TYPE (elt_v); | |
4426 | if (!useless_type_conversion_p (TREE_TYPE (rhs1_type), | |
4427 | TREE_TYPE (elt_t))) | |
4428 | { | |
4429 | error ("incorrect type of vector CONSTRUCTOR" | |
4430 | " elements"); | |
4431 | debug_generic_stmt (rhs1); | |
4432 | return true; | |
4433 | } | |
4434 | else if (CONSTRUCTOR_NELTS (rhs1) | |
4435 | * TYPE_VECTOR_SUBPARTS (elt_t) | |
4436 | != TYPE_VECTOR_SUBPARTS (rhs1_type)) | |
4437 | { | |
4438 | error ("incorrect number of vector CONSTRUCTOR" | |
4439 | " elements"); | |
4440 | debug_generic_stmt (rhs1); | |
4441 | return true; | |
4442 | } | |
4443 | } | |
4444 | else if (!useless_type_conversion_p (TREE_TYPE (rhs1_type), | |
4445 | elt_t)) | |
4446 | { | |
4447 | error ("incorrect type of vector CONSTRUCTOR elements"); | |
4448 | debug_generic_stmt (rhs1); | |
4449 | return true; | |
4450 | } | |
4451 | else if (CONSTRUCTOR_NELTS (rhs1) | |
4452 | > TYPE_VECTOR_SUBPARTS (rhs1_type)) | |
4453 | { | |
4454 | error ("incorrect number of vector CONSTRUCTOR elements"); | |
4455 | debug_generic_stmt (rhs1); | |
4456 | return true; | |
4457 | } | |
4458 | } | |
4459 | else if (!useless_type_conversion_p (elt_t, TREE_TYPE (elt_v))) | |
4460 | { | |
4461 | error ("incorrect type of vector CONSTRUCTOR elements"); | |
4462 | debug_generic_stmt (rhs1); | |
4463 | return true; | |
4464 | } | |
4465 | if (elt_i != NULL_TREE | |
4466 | && (TREE_CODE (elt_t) == VECTOR_TYPE | |
4467 | || TREE_CODE (elt_i) != INTEGER_CST | |
4468 | || compare_tree_int (elt_i, i) != 0)) | |
4469 | { | |
4470 | error ("vector CONSTRUCTOR with non-NULL element index"); | |
4471 | debug_generic_stmt (rhs1); | |
4472 | return true; | |
4473 | } | |
931002b2 RB |
4474 | if (!is_gimple_val (elt_v)) |
4475 | { | |
4476 | error ("vector CONSTRUCTOR element is not a GIMPLE value"); | |
4477 | debug_generic_stmt (rhs1); | |
4478 | return true; | |
4479 | } | |
13396b6e JJ |
4480 | } |
4481 | } | |
931002b2 RB |
4482 | else if (CONSTRUCTOR_NELTS (rhs1) != 0) |
4483 | { | |
4484 | error ("non-vector CONSTRUCTOR with elements"); | |
4485 | debug_generic_stmt (rhs1); | |
4486 | return true; | |
4487 | } | |
13396b6e | 4488 | return res; |
9f509004 RG |
4489 | case OBJ_TYPE_REF: |
4490 | case ASSERT_EXPR: | |
4491 | case WITH_SIZE_EXPR: | |
9f509004 RG |
4492 | /* FIXME. */ |
4493 | return res; | |
7e98624c | 4494 | |
726a989a | 4495 | default:; |
7e98624c RG |
4496 | } |
4497 | ||
9f509004 | 4498 | return res; |
7e98624c RG |
4499 | } |
4500 | ||
9f509004 RG |
4501 | /* Verify the contents of a GIMPLE_ASSIGN STMT. Returns true when there |
4502 | is a problem, otherwise false. */ | |
4503 | ||
4504 | static bool | |
538dd0b7 | 4505 | verify_gimple_assign (gassign *stmt) |
9f509004 RG |
4506 | { |
4507 | switch (gimple_assign_rhs_class (stmt)) | |
4508 | { | |
4509 | case GIMPLE_SINGLE_RHS: | |
4510 | return verify_gimple_assign_single (stmt); | |
4511 | ||
4512 | case GIMPLE_UNARY_RHS: | |
4513 | return verify_gimple_assign_unary (stmt); | |
4514 | ||
4515 | case GIMPLE_BINARY_RHS: | |
4516 | return verify_gimple_assign_binary (stmt); | |
4517 | ||
0354c0c7 BS |
4518 | case GIMPLE_TERNARY_RHS: |
4519 | return verify_gimple_assign_ternary (stmt); | |
4520 | ||
9f509004 RG |
4521 | default: |
4522 | gcc_unreachable (); | |
4523 | } | |
4524 | } | |
726a989a RB |
4525 | |
4526 | /* Verify the contents of a GIMPLE_RETURN STMT. Returns true when there | |
4527 | is a problem, otherwise false. */ | |
7e98624c RG |
4528 | |
4529 | static bool | |
538dd0b7 | 4530 | verify_gimple_return (greturn *stmt) |
7e98624c | 4531 | { |
726a989a | 4532 | tree op = gimple_return_retval (stmt); |
b59d3976 | 4533 | tree restype = TREE_TYPE (TREE_TYPE (cfun->decl)); |
726a989a | 4534 | |
b59d3976 RG |
4535 | /* We cannot test for present return values as we do not fix up missing |
4536 | return values from the original source. */ | |
726a989a RB |
4537 | if (op == NULL) |
4538 | return false; | |
b8698a0f | 4539 | |
b59d3976 RG |
4540 | if (!is_gimple_val (op) |
4541 | && TREE_CODE (op) != RESULT_DECL) | |
4542 | { | |
4543 | error ("invalid operand in return statement"); | |
4544 | debug_generic_stmt (op); | |
4545 | return true; | |
4546 | } | |
4547 | ||
e3061843 RB |
4548 | if ((TREE_CODE (op) == RESULT_DECL |
4549 | && DECL_BY_REFERENCE (op)) | |
4550 | || (TREE_CODE (op) == SSA_NAME | |
70b5e7dc | 4551 | && SSA_NAME_VAR (op) |
e3061843 RB |
4552 | && TREE_CODE (SSA_NAME_VAR (op)) == RESULT_DECL |
4553 | && DECL_BY_REFERENCE (SSA_NAME_VAR (op)))) | |
4554 | op = TREE_TYPE (op); | |
4555 | ||
4556 | if (!useless_type_conversion_p (restype, TREE_TYPE (op))) | |
b59d3976 RG |
4557 | { |
4558 | error ("invalid conversion in return statement"); | |
4559 | debug_generic_stmt (restype); | |
4560 | debug_generic_stmt (TREE_TYPE (op)); | |
4561 | return true; | |
4562 | } | |
4563 | ||
4564 | return false; | |
726a989a | 4565 | } |
7e98624c | 4566 | |
7e98624c | 4567 | |
b59d3976 RG |
4568 | /* Verify the contents of a GIMPLE_GOTO STMT. Returns true when there |
4569 | is a problem, otherwise false. */ | |
4570 | ||
4571 | static bool | |
538dd0b7 | 4572 | verify_gimple_goto (ggoto *stmt) |
b59d3976 RG |
4573 | { |
4574 | tree dest = gimple_goto_dest (stmt); | |
4575 | ||
4576 | /* ??? We have two canonical forms of direct goto destinations, a | |
4577 | bare LABEL_DECL and an ADDR_EXPR of a LABEL_DECL. */ | |
4578 | if (TREE_CODE (dest) != LABEL_DECL | |
4579 | && (!is_gimple_val (dest) | |
4580 | || !POINTER_TYPE_P (TREE_TYPE (dest)))) | |
4581 | { | |
4582 | error ("goto destination is neither a label nor a pointer"); | |
4583 | return true; | |
4584 | } | |
4585 | ||
4586 | return false; | |
4587 | } | |
4588 | ||
726a989a RB |
4589 | /* Verify the contents of a GIMPLE_SWITCH STMT. Returns true when there |
4590 | is a problem, otherwise false. */ | |
4591 | ||
4592 | static bool | |
538dd0b7 | 4593 | verify_gimple_switch (gswitch *stmt) |
726a989a | 4594 | { |
198fc9f1 SB |
4595 | unsigned int i, n; |
4596 | tree elt, prev_upper_bound = NULL_TREE; | |
4597 | tree index_type, elt_type = NULL_TREE; | |
4598 | ||
726a989a | 4599 | if (!is_gimple_val (gimple_switch_index (stmt))) |
7e98624c | 4600 | { |
726a989a | 4601 | error ("invalid operand to switch statement"); |
b59d3976 | 4602 | debug_generic_stmt (gimple_switch_index (stmt)); |
7e98624c RG |
4603 | return true; |
4604 | } | |
4605 | ||
198fc9f1 SB |
4606 | index_type = TREE_TYPE (gimple_switch_index (stmt)); |
4607 | if (! INTEGRAL_TYPE_P (index_type)) | |
4608 | { | |
4609 | error ("non-integral type switch statement"); | |
4610 | debug_generic_expr (index_type); | |
4611 | return true; | |
4612 | } | |
4613 | ||
fd8d363e | 4614 | elt = gimple_switch_label (stmt, 0); |
198fc9f1 SB |
4615 | if (CASE_LOW (elt) != NULL_TREE || CASE_HIGH (elt) != NULL_TREE) |
4616 | { | |
4617 | error ("invalid default case label in switch statement"); | |
4618 | debug_generic_expr (elt); | |
4619 | return true; | |
4620 | } | |
4621 | ||
4622 | n = gimple_switch_num_labels (stmt); | |
4623 | for (i = 1; i < n; i++) | |
4624 | { | |
4625 | elt = gimple_switch_label (stmt, i); | |
4626 | ||
4627 | if (! CASE_LOW (elt)) | |
4628 | { | |
4629 | error ("invalid case label in switch statement"); | |
4630 | debug_generic_expr (elt); | |
4631 | return true; | |
4632 | } | |
4633 | if (CASE_HIGH (elt) | |
4634 | && ! tree_int_cst_lt (CASE_LOW (elt), CASE_HIGH (elt))) | |
4635 | { | |
4636 | error ("invalid case range in switch statement"); | |
4637 | debug_generic_expr (elt); | |
4638 | return true; | |
4639 | } | |
4640 | ||
4641 | if (elt_type) | |
4642 | { | |
4643 | if (TREE_TYPE (CASE_LOW (elt)) != elt_type | |
4644 | || (CASE_HIGH (elt) && TREE_TYPE (CASE_HIGH (elt)) != elt_type)) | |
4645 | { | |
4646 | error ("type mismatch for case label in switch statement"); | |
4647 | debug_generic_expr (elt); | |
4648 | return true; | |
4649 | } | |
4650 | } | |
4651 | else | |
4652 | { | |
4653 | elt_type = TREE_TYPE (CASE_LOW (elt)); | |
4654 | if (TYPE_PRECISION (index_type) < TYPE_PRECISION (elt_type)) | |
4655 | { | |
4656 | error ("type precision mismatch in switch statement"); | |
4657 | return true; | |
4658 | } | |
4659 | } | |
4660 | ||
4661 | if (prev_upper_bound) | |
4662 | { | |
4663 | if (! tree_int_cst_lt (prev_upper_bound, CASE_LOW (elt))) | |
4664 | { | |
4665 | error ("case labels not sorted in switch statement"); | |
4666 | return true; | |
4667 | } | |
4668 | } | |
4669 | ||
4670 | prev_upper_bound = CASE_HIGH (elt); | |
4671 | if (! prev_upper_bound) | |
4672 | prev_upper_bound = CASE_LOW (elt); | |
4673 | } | |
4674 | ||
726a989a RB |
4675 | return false; |
4676 | } | |
7e98624c | 4677 | |
b5b8b0ac AO |
4678 | /* Verify a gimple debug statement STMT. |
4679 | Returns true if anything is wrong. */ | |
4680 | ||
4681 | static bool | |
355fe088 | 4682 | verify_gimple_debug (gimple *stmt ATTRIBUTE_UNUSED) |
b5b8b0ac AO |
4683 | { |
4684 | /* There isn't much that could be wrong in a gimple debug stmt. A | |
4685 | gimple debug bind stmt, for example, maps a tree, that's usually | |
4686 | a VAR_DECL or a PARM_DECL, but that could also be some scalarized | |
4687 | component or member of an aggregate type, to another tree, that | |
4688 | can be an arbitrary expression. These stmts expand into debug | |
4689 | insns, and are converted to debug notes by var-tracking.c. */ | |
4690 | return false; | |
4691 | } | |
4692 | ||
34019e28 RG |
4693 | /* Verify a gimple label statement STMT. |
4694 | Returns true if anything is wrong. */ | |
4695 | ||
4696 | static bool | |
538dd0b7 | 4697 | verify_gimple_label (glabel *stmt) |
34019e28 RG |
4698 | { |
4699 | tree decl = gimple_label_label (stmt); | |
4700 | int uid; | |
4701 | bool err = false; | |
4702 | ||
4703 | if (TREE_CODE (decl) != LABEL_DECL) | |
4704 | return true; | |
5e581212 JH |
4705 | if (!DECL_NONLOCAL (decl) && !FORCED_LABEL (decl) |
4706 | && DECL_CONTEXT (decl) != current_function_decl) | |
4707 | { | |
4708 | error ("label's context is not the current function decl"); | |
4709 | err |= true; | |
4710 | } | |
34019e28 RG |
4711 | |
4712 | uid = LABEL_DECL_UID (decl); | |
4713 | if (cfun->cfg | |
99729d91 DM |
4714 | && (uid == -1 |
4715 | || (*label_to_block_map_for_fn (cfun))[uid] != gimple_bb (stmt))) | |
34019e28 RG |
4716 | { |
4717 | error ("incorrect entry in label_to_block_map"); | |
4718 | err |= true; | |
4719 | } | |
4720 | ||
4721 | uid = EH_LANDING_PAD_NR (decl); | |
4722 | if (uid) | |
4723 | { | |
4724 | eh_landing_pad lp = get_eh_landing_pad_from_number (uid); | |
4725 | if (decl != lp->post_landing_pad) | |
4726 | { | |
4727 | error ("incorrect setting of landing pad number"); | |
4728 | err |= true; | |
4729 | } | |
4730 | } | |
4731 | ||
4732 | return err; | |
4733 | } | |
b5b8b0ac | 4734 | |
538dd0b7 DM |
4735 | /* Verify a gimple cond statement STMT. |
4736 | Returns true if anything is wrong. */ | |
4737 | ||
4738 | static bool | |
4739 | verify_gimple_cond (gcond *stmt) | |
4740 | { | |
4741 | if (TREE_CODE_CLASS (gimple_cond_code (stmt)) != tcc_comparison) | |
4742 | { | |
4743 | error ("invalid comparison code in gimple cond"); | |
4744 | return true; | |
4745 | } | |
4746 | if (!(!gimple_cond_true_label (stmt) | |
4747 | || TREE_CODE (gimple_cond_true_label (stmt)) == LABEL_DECL) | |
4748 | || !(!gimple_cond_false_label (stmt) | |
4749 | || TREE_CODE (gimple_cond_false_label (stmt)) == LABEL_DECL)) | |
4750 | { | |
4751 | error ("invalid labels in gimple cond"); | |
4752 | return true; | |
4753 | } | |
4754 | ||
4755 | return verify_gimple_comparison (boolean_type_node, | |
4756 | gimple_cond_lhs (stmt), | |
305708ce YR |
4757 | gimple_cond_rhs (stmt), |
4758 | gimple_cond_code (stmt)); | |
538dd0b7 DM |
4759 | } |
4760 | ||
7e98624c RG |
4761 | /* Verify the GIMPLE statement STMT. Returns true if there is an |
4762 | error, otherwise false. */ | |
4763 | ||
4764 | static bool | |
355fe088 | 4765 | verify_gimple_stmt (gimple *stmt) |
7e98624c | 4766 | { |
726a989a | 4767 | switch (gimple_code (stmt)) |
7e98624c | 4768 | { |
726a989a | 4769 | case GIMPLE_ASSIGN: |
538dd0b7 | 4770 | return verify_gimple_assign (as_a <gassign *> (stmt)); |
7e98624c | 4771 | |
726a989a | 4772 | case GIMPLE_LABEL: |
538dd0b7 | 4773 | return verify_gimple_label (as_a <glabel *> (stmt)); |
7e98624c | 4774 | |
726a989a | 4775 | case GIMPLE_CALL: |
538dd0b7 | 4776 | return verify_gimple_call (as_a <gcall *> (stmt)); |
7e98624c | 4777 | |
726a989a | 4778 | case GIMPLE_COND: |
538dd0b7 | 4779 | return verify_gimple_cond (as_a <gcond *> (stmt)); |
7e98624c | 4780 | |
726a989a | 4781 | case GIMPLE_GOTO: |
538dd0b7 | 4782 | return verify_gimple_goto (as_a <ggoto *> (stmt)); |
7e98624c | 4783 | |
726a989a | 4784 | case GIMPLE_SWITCH: |
538dd0b7 | 4785 | return verify_gimple_switch (as_a <gswitch *> (stmt)); |
7e98624c | 4786 | |
726a989a | 4787 | case GIMPLE_RETURN: |
538dd0b7 | 4788 | return verify_gimple_return (as_a <greturn *> (stmt)); |
7e98624c | 4789 | |
726a989a | 4790 | case GIMPLE_ASM: |
7e98624c RG |
4791 | return false; |
4792 | ||
0a35513e | 4793 | case GIMPLE_TRANSACTION: |
538dd0b7 | 4794 | return verify_gimple_transaction (as_a <gtransaction *> (stmt)); |
0a35513e | 4795 | |
b59d3976 RG |
4796 | /* Tuples that do not have tree operands. */ |
4797 | case GIMPLE_NOP: | |
b59d3976 | 4798 | case GIMPLE_PREDICT: |
1d65f45c RH |
4799 | case GIMPLE_RESX: |
4800 | case GIMPLE_EH_DISPATCH: | |
40742b42 | 4801 | case GIMPLE_EH_MUST_NOT_THROW: |
b59d3976 | 4802 | return false; |
726a989a | 4803 | |
8b9db065 RH |
4804 | CASE_GIMPLE_OMP: |
4805 | /* OpenMP directives are validated by the FE and never operated | |
4806 | on by the optimizers. Furthermore, GIMPLE_OMP_FOR may contain | |
4807 | non-gimple expressions when the main index variable has had | |
4808 | its address taken. This does not affect the loop itself | |
4809 | because the header of an GIMPLE_OMP_FOR is merely used to determine | |
4810 | how to setup the parallel iteration. */ | |
4811 | return false; | |
4812 | ||
b5b8b0ac AO |
4813 | case GIMPLE_DEBUG: |
4814 | return verify_gimple_debug (stmt); | |
4815 | ||
7e98624c RG |
4816 | default: |
4817 | gcc_unreachable (); | |
4818 | } | |
4819 | } | |
4820 | ||
34019e28 RG |
4821 | /* Verify the contents of a GIMPLE_PHI. Returns true if there is a problem, |
4822 | and false otherwise. */ | |
4823 | ||
4824 | static bool | |
355fe088 | 4825 | verify_gimple_phi (gimple *phi) |
34019e28 RG |
4826 | { |
4827 | bool err = false; | |
4828 | unsigned i; | |
4829 | tree phi_result = gimple_phi_result (phi); | |
4830 | bool virtual_p; | |
4831 | ||
4832 | if (!phi_result) | |
4833 | { | |
4834 | error ("invalid PHI result"); | |
4835 | return true; | |
4836 | } | |
4837 | ||
ea057359 | 4838 | virtual_p = virtual_operand_p (phi_result); |
34019e28 RG |
4839 | if (TREE_CODE (phi_result) != SSA_NAME |
4840 | || (virtual_p | |
4841 | && SSA_NAME_VAR (phi_result) != gimple_vop (cfun))) | |
4842 | { | |
4843 | error ("invalid PHI result"); | |
4844 | err = true; | |
4845 | } | |
4846 | ||
4847 | for (i = 0; i < gimple_phi_num_args (phi); i++) | |
4848 | { | |
4849 | tree t = gimple_phi_arg_def (phi, i); | |
4850 | ||
4851 | if (!t) | |
4852 | { | |
4853 | error ("missing PHI def"); | |
4854 | err |= true; | |
4855 | continue; | |
4856 | } | |
4857 | /* Addressable variables do have SSA_NAMEs but they | |
4858 | are not considered gimple values. */ | |
4859 | else if ((TREE_CODE (t) == SSA_NAME | |
ea057359 | 4860 | && virtual_p != virtual_operand_p (t)) |
34019e28 RG |
4861 | || (virtual_p |
4862 | && (TREE_CODE (t) != SSA_NAME | |
4863 | || SSA_NAME_VAR (t) != gimple_vop (cfun))) | |
4864 | || (!virtual_p | |
4865 | && !is_gimple_val (t))) | |
4866 | { | |
4867 | error ("invalid PHI argument"); | |
4868 | debug_generic_expr (t); | |
4869 | err |= true; | |
4870 | } | |
4871 | #ifdef ENABLE_TYPES_CHECKING | |
4872 | if (!useless_type_conversion_p (TREE_TYPE (phi_result), TREE_TYPE (t))) | |
4873 | { | |
4874 | error ("incompatible types in PHI argument %u", i); | |
4875 | debug_generic_stmt (TREE_TYPE (phi_result)); | |
4876 | debug_generic_stmt (TREE_TYPE (t)); | |
4877 | err |= true; | |
4878 | } | |
4879 | #endif | |
4880 | } | |
4881 | ||
4882 | return err; | |
4883 | } | |
4884 | ||
726a989a | 4885 | /* Verify the GIMPLE statements inside the sequence STMTS. */ |
7e98624c | 4886 | |
7dc83ebc | 4887 | static bool |
34019e28 | 4888 | verify_gimple_in_seq_2 (gimple_seq stmts) |
7e98624c | 4889 | { |
726a989a | 4890 | gimple_stmt_iterator ittr; |
7dc83ebc | 4891 | bool err = false; |
7e98624c | 4892 | |
726a989a | 4893 | for (ittr = gsi_start (stmts); !gsi_end_p (ittr); gsi_next (&ittr)) |
7e98624c | 4894 | { |
355fe088 | 4895 | gimple *stmt = gsi_stmt (ittr); |
7e98624c | 4896 | |
726a989a RB |
4897 | switch (gimple_code (stmt)) |
4898 | { | |
b59d3976 | 4899 | case GIMPLE_BIND: |
538dd0b7 DM |
4900 | err |= verify_gimple_in_seq_2 ( |
4901 | gimple_bind_body (as_a <gbind *> (stmt))); | |
b59d3976 RG |
4902 | break; |
4903 | ||
4904 | case GIMPLE_TRY: | |
34019e28 RG |
4905 | err |= verify_gimple_in_seq_2 (gimple_try_eval (stmt)); |
4906 | err |= verify_gimple_in_seq_2 (gimple_try_cleanup (stmt)); | |
b59d3976 RG |
4907 | break; |
4908 | ||
4909 | case GIMPLE_EH_FILTER: | |
34019e28 | 4910 | err |= verify_gimple_in_seq_2 (gimple_eh_filter_failure (stmt)); |
b59d3976 RG |
4911 | break; |
4912 | ||
0a35513e | 4913 | case GIMPLE_EH_ELSE: |
538dd0b7 DM |
4914 | { |
4915 | geh_else *eh_else = as_a <geh_else *> (stmt); | |
4916 | err |= verify_gimple_in_seq_2 (gimple_eh_else_n_body (eh_else)); | |
4917 | err |= verify_gimple_in_seq_2 (gimple_eh_else_e_body (eh_else)); | |
4918 | } | |
0a35513e AH |
4919 | break; |
4920 | ||
b59d3976 | 4921 | case GIMPLE_CATCH: |
538dd0b7 DM |
4922 | err |= verify_gimple_in_seq_2 (gimple_catch_handler ( |
4923 | as_a <gcatch *> (stmt))); | |
b59d3976 | 4924 | break; |
7e98624c | 4925 | |
0a35513e | 4926 | case GIMPLE_TRANSACTION: |
538dd0b7 | 4927 | err |= verify_gimple_transaction (as_a <gtransaction *> (stmt)); |
0a35513e AH |
4928 | break; |
4929 | ||
7e98624c | 4930 | default: |
7dc83ebc | 4931 | { |
34019e28 | 4932 | bool err2 = verify_gimple_stmt (stmt); |
7dc83ebc | 4933 | if (err2) |
726a989a | 4934 | debug_gimple_stmt (stmt); |
7dc83ebc RG |
4935 | err |= err2; |
4936 | } | |
7e98624c RG |
4937 | } |
4938 | } | |
7dc83ebc RG |
4939 | |
4940 | return err; | |
4941 | } | |
4942 | ||
0a35513e AH |
4943 | /* Verify the contents of a GIMPLE_TRANSACTION. Returns true if there |
4944 | is a problem, otherwise false. */ | |
4945 | ||
4946 | static bool | |
538dd0b7 | 4947 | verify_gimple_transaction (gtransaction *stmt) |
0a35513e | 4948 | { |
7c11b0fe RH |
4949 | tree lab; |
4950 | ||
4951 | lab = gimple_transaction_label_norm (stmt); | |
0a35513e AH |
4952 | if (lab != NULL && TREE_CODE (lab) != LABEL_DECL) |
4953 | return true; | |
7c11b0fe RH |
4954 | lab = gimple_transaction_label_uninst (stmt); |
4955 | if (lab != NULL && TREE_CODE (lab) != LABEL_DECL) | |
4956 | return true; | |
4957 | lab = gimple_transaction_label_over (stmt); | |
4958 | if (lab != NULL && TREE_CODE (lab) != LABEL_DECL) | |
4959 | return true; | |
4960 | ||
0a35513e AH |
4961 | return verify_gimple_in_seq_2 (gimple_transaction_body (stmt)); |
4962 | } | |
4963 | ||
7dc83ebc RG |
4964 | |
4965 | /* Verify the GIMPLE statements inside the statement list STMTS. */ | |
4966 | ||
34019e28 RG |
4967 | DEBUG_FUNCTION void |
4968 | verify_gimple_in_seq (gimple_seq stmts) | |
7dc83ebc | 4969 | { |
34019e28 RG |
4970 | timevar_push (TV_TREE_STMT_VERIFY); |
4971 | if (verify_gimple_in_seq_2 (stmts)) | |
7dc83ebc | 4972 | internal_error ("verify_gimple failed"); |
34019e28 | 4973 | timevar_pop (TV_TREE_STMT_VERIFY); |
7e98624c RG |
4974 | } |
4975 | ||
6de9cd9a DN |
4976 | /* Return true when the T can be shared. */ |
4977 | ||
c1bf2a39 | 4978 | static bool |
6de9cd9a DN |
4979 | tree_node_can_be_shared (tree t) |
4980 | { | |
6615c446 | 4981 | if (IS_TYPE_OR_DECL_P (t) |
6de9cd9a | 4982 | || is_gimple_min_invariant (t) |
5e23162d | 4983 | || TREE_CODE (t) == SSA_NAME |
953ff289 DN |
4984 | || t == error_mark_node |
4985 | || TREE_CODE (t) == IDENTIFIER_NODE) | |
6de9cd9a DN |
4986 | return true; |
4987 | ||
92b6dff3 JL |
4988 | if (TREE_CODE (t) == CASE_LABEL_EXPR) |
4989 | return true; | |
4990 | ||
6de9cd9a DN |
4991 | if (DECL_P (t)) |
4992 | return true; | |
4993 | ||
4994 | return false; | |
4995 | } | |
4996 | ||
980d0812 | 4997 | /* Called via walk_tree. Verify tree sharing. */ |
6de9cd9a DN |
4998 | |
4999 | static tree | |
980d0812 | 5000 | verify_node_sharing_1 (tree *tp, int *walk_subtrees, void *data) |
6de9cd9a | 5001 | { |
6e2830c3 | 5002 | hash_set<void *> *visited = (hash_set<void *> *) data; |
6de9cd9a DN |
5003 | |
5004 | if (tree_node_can_be_shared (*tp)) | |
5005 | { | |
5006 | *walk_subtrees = false; | |
5007 | return NULL; | |
5008 | } | |
5009 | ||
6e2830c3 | 5010 | if (visited->add (*tp)) |
4437b50d | 5011 | return *tp; |
6de9cd9a DN |
5012 | |
5013 | return NULL; | |
5014 | } | |
5015 | ||
980d0812 RB |
5016 | /* Called via walk_gimple_stmt. Verify tree sharing. */ |
5017 | ||
5018 | static tree | |
5019 | verify_node_sharing (tree *tp, int *walk_subtrees, void *data) | |
5020 | { | |
5021 | struct walk_stmt_info *wi = (struct walk_stmt_info *) data; | |
5022 | return verify_node_sharing_1 (tp, walk_subtrees, wi->info); | |
5023 | } | |
5024 | ||
4437b50d | 5025 | static bool eh_error_found; |
b086d530 | 5026 | bool |
355fe088 TS |
5027 | verify_eh_throw_stmt_node (gimple *const &stmt, const int &, |
5028 | hash_set<gimple *> *visited) | |
4437b50d | 5029 | { |
b086d530 | 5030 | if (!visited->contains (stmt)) |
4437b50d | 5031 | { |
d8a07487 | 5032 | error ("dead STMT in EH table"); |
b086d530 | 5033 | debug_gimple_stmt (stmt); |
4437b50d JH |
5034 | eh_error_found = true; |
5035 | } | |
b086d530 | 5036 | return true; |
4437b50d JH |
5037 | } |
5038 | ||
7bb01996 RB |
5039 | /* Verify if the location LOCs block is in BLOCKS. */ |
5040 | ||
5041 | static bool | |
6e2830c3 | 5042 | verify_location (hash_set<tree> *blocks, location_t loc) |
7bb01996 RB |
5043 | { |
5044 | tree block = LOCATION_BLOCK (loc); | |
5045 | if (block != NULL_TREE | |
6e2830c3 | 5046 | && !blocks->contains (block)) |
7bb01996 RB |
5047 | { |
5048 | error ("location references block not in block tree"); | |
5049 | return true; | |
5050 | } | |
a9d5a059 RB |
5051 | if (block != NULL_TREE) |
5052 | return verify_location (blocks, BLOCK_SOURCE_LOCATION (block)); | |
7bb01996 RB |
5053 | return false; |
5054 | } | |
5055 | ||
50d4421c RB |
5056 | /* Called via walk_tree. Verify that expressions have no blocks. */ |
5057 | ||
5058 | static tree | |
5059 | verify_expr_no_block (tree *tp, int *walk_subtrees, void *) | |
5060 | { | |
5061 | if (!EXPR_P (*tp)) | |
5062 | { | |
5063 | *walk_subtrees = false; | |
5064 | return NULL; | |
5065 | } | |
5066 | ||
5067 | location_t loc = EXPR_LOCATION (*tp); | |
5068 | if (LOCATION_BLOCK (loc) != NULL) | |
5069 | return *tp; | |
5070 | ||
5071 | return NULL; | |
5072 | } | |
5073 | ||
7bb01996 RB |
5074 | /* Called via walk_tree. Verify locations of expressions. */ |
5075 | ||
5076 | static tree | |
5077 | verify_expr_location_1 (tree *tp, int *walk_subtrees, void *data) | |
5078 | { | |
6e2830c3 | 5079 | hash_set<tree> *blocks = (hash_set<tree> *) data; |
7bb01996 | 5080 | |
8813a647 | 5081 | if (VAR_P (*tp) && DECL_HAS_DEBUG_EXPR_P (*tp)) |
64366d35 RB |
5082 | { |
5083 | tree t = DECL_DEBUG_EXPR (*tp); | |
50d4421c RB |
5084 | tree addr = walk_tree (&t, verify_expr_no_block, NULL, NULL); |
5085 | if (addr) | |
5086 | return addr; | |
5087 | } | |
8813a647 | 5088 | if ((VAR_P (*tp) |
50d4421c RB |
5089 | || TREE_CODE (*tp) == PARM_DECL |
5090 | || TREE_CODE (*tp) == RESULT_DECL) | |
5091 | && DECL_HAS_VALUE_EXPR_P (*tp)) | |
5092 | { | |
5093 | tree t = DECL_VALUE_EXPR (*tp); | |
5094 | tree addr = walk_tree (&t, verify_expr_no_block, NULL, NULL); | |
64366d35 RB |
5095 | if (addr) |
5096 | return addr; | |
5097 | } | |
5098 | ||
7bb01996 RB |
5099 | if (!EXPR_P (*tp)) |
5100 | { | |
5101 | *walk_subtrees = false; | |
5102 | return NULL; | |
5103 | } | |
5104 | ||
5105 | location_t loc = EXPR_LOCATION (*tp); | |
5106 | if (verify_location (blocks, loc)) | |
5107 | return *tp; | |
5108 | ||
5109 | return NULL; | |
5110 | } | |
5111 | ||
5112 | /* Called via walk_gimple_op. Verify locations of expressions. */ | |
5113 | ||
5114 | static tree | |
5115 | verify_expr_location (tree *tp, int *walk_subtrees, void *data) | |
5116 | { | |
5117 | struct walk_stmt_info *wi = (struct walk_stmt_info *) data; | |
5118 | return verify_expr_location_1 (tp, walk_subtrees, wi->info); | |
5119 | } | |
5120 | ||
5121 | /* Insert all subblocks of BLOCK into BLOCKS and recurse. */ | |
5122 | ||
5123 | static void | |
6e2830c3 | 5124 | collect_subblocks (hash_set<tree> *blocks, tree block) |
7bb01996 RB |
5125 | { |
5126 | tree t; | |
5127 | for (t = BLOCK_SUBBLOCKS (block); t; t = BLOCK_CHAIN (t)) | |
5128 | { | |
6e2830c3 | 5129 | blocks->add (t); |
7bb01996 RB |
5130 | collect_subblocks (blocks, t); |
5131 | } | |
5132 | } | |
5133 | ||
34019e28 | 5134 | /* Verify the GIMPLE statements in the CFG of FN. */ |
6de9cd9a | 5135 | |
24e47c76 | 5136 | DEBUG_FUNCTION void |
e9ff9caf | 5137 | verify_gimple_in_cfg (struct function *fn, bool verify_nothrow) |
6de9cd9a DN |
5138 | { |
5139 | basic_block bb; | |
6de9cd9a | 5140 | bool err = false; |
6de9cd9a DN |
5141 | |
5142 | timevar_push (TV_TREE_STMT_VERIFY); | |
6e2830c3 | 5143 | hash_set<void *> visited; |
355fe088 | 5144 | hash_set<gimple *> visited_stmts; |
6de9cd9a | 5145 | |
7bb01996 | 5146 | /* Collect all BLOCKs referenced by the BLOCK tree of FN. */ |
6e2830c3 | 5147 | hash_set<tree> blocks; |
7bb01996 RB |
5148 | if (DECL_INITIAL (fn->decl)) |
5149 | { | |
6e2830c3 TS |
5150 | blocks.add (DECL_INITIAL (fn->decl)); |
5151 | collect_subblocks (&blocks, DECL_INITIAL (fn->decl)); | |
7bb01996 RB |
5152 | } |
5153 | ||
34019e28 | 5154 | FOR_EACH_BB_FN (bb, fn) |
6de9cd9a | 5155 | { |
34019e28 | 5156 | gimple_stmt_iterator gsi; |
6de9cd9a | 5157 | |
538dd0b7 DM |
5158 | for (gphi_iterator gpi = gsi_start_phis (bb); |
5159 | !gsi_end_p (gpi); | |
5160 | gsi_next (&gpi)) | |
6de9cd9a | 5161 | { |
538dd0b7 | 5162 | gphi *phi = gpi.phi (); |
34019e28 RG |
5163 | bool err2 = false; |
5164 | unsigned i; | |
5165 | ||
6e2830c3 | 5166 | visited_stmts.add (phi); |
34019e28 | 5167 | |
726a989a | 5168 | if (gimple_bb (phi) != bb) |
8de1fc1b | 5169 | { |
726a989a | 5170 | error ("gimple_bb (phi) is set to a wrong basic block"); |
34019e28 | 5171 | err2 = true; |
8de1fc1b KH |
5172 | } |
5173 | ||
34019e28 RG |
5174 | err2 |= verify_gimple_phi (phi); |
5175 | ||
7bb01996 RB |
5176 | /* Only PHI arguments have locations. */ |
5177 | if (gimple_location (phi) != UNKNOWN_LOCATION) | |
5178 | { | |
5179 | error ("PHI node with location"); | |
5180 | err2 = true; | |
5181 | } | |
5182 | ||
726a989a | 5183 | for (i = 0; i < gimple_phi_num_args (phi); i++) |
6de9cd9a | 5184 | { |
34019e28 | 5185 | tree arg = gimple_phi_arg_def (phi, i); |
980d0812 | 5186 | tree addr = walk_tree (&arg, verify_node_sharing_1, |
6e2830c3 | 5187 | &visited, NULL); |
6de9cd9a DN |
5188 | if (addr) |
5189 | { | |
ab532386 | 5190 | error ("incorrect sharing of tree nodes"); |
726a989a | 5191 | debug_generic_expr (addr); |
34019e28 | 5192 | err2 |= true; |
6de9cd9a | 5193 | } |
7bb01996 RB |
5194 | location_t loc = gimple_phi_arg_location (phi, i); |
5195 | if (virtual_operand_p (gimple_phi_result (phi)) | |
5196 | && loc != UNKNOWN_LOCATION) | |
5197 | { | |
5198 | error ("virtual PHI with argument locations"); | |
5199 | err2 = true; | |
5200 | } | |
6e2830c3 | 5201 | addr = walk_tree (&arg, verify_expr_location_1, &blocks, NULL); |
7bb01996 RB |
5202 | if (addr) |
5203 | { | |
5204 | debug_generic_expr (addr); | |
5205 | err2 = true; | |
5206 | } | |
6e2830c3 | 5207 | err2 |= verify_location (&blocks, loc); |
6de9cd9a | 5208 | } |
211ca15c | 5209 | |
34019e28 RG |
5210 | if (err2) |
5211 | debug_gimple_stmt (phi); | |
5212 | err |= err2; | |
6de9cd9a DN |
5213 | } |
5214 | ||
34019e28 | 5215 | for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi)) |
6de9cd9a | 5216 | { |
355fe088 | 5217 | gimple *stmt = gsi_stmt (gsi); |
34019e28 RG |
5218 | bool err2 = false; |
5219 | struct walk_stmt_info wi; | |
5220 | tree addr; | |
5221 | int lp_nr; | |
8de1fc1b | 5222 | |
6e2830c3 | 5223 | visited_stmts.add (stmt); |
07beea0d | 5224 | |
726a989a | 5225 | if (gimple_bb (stmt) != bb) |
8de1fc1b | 5226 | { |
726a989a | 5227 | error ("gimple_bb (stmt) is set to a wrong basic block"); |
34019e28 | 5228 | err2 = true; |
8de1fc1b KH |
5229 | } |
5230 | ||
34019e28 | 5231 | err2 |= verify_gimple_stmt (stmt); |
6e2830c3 | 5232 | err2 |= verify_location (&blocks, gimple_location (stmt)); |
34019e28 RG |
5233 | |
5234 | memset (&wi, 0, sizeof (wi)); | |
6e2830c3 | 5235 | wi.info = (void *) &visited; |
34019e28 RG |
5236 | addr = walk_gimple_op (stmt, verify_node_sharing, &wi); |
5237 | if (addr) | |
726a989a | 5238 | { |
34019e28 RG |
5239 | error ("incorrect sharing of tree nodes"); |
5240 | debug_generic_expr (addr); | |
5241 | err2 |= true; | |
5242 | } | |
726a989a | 5243 | |
7bb01996 | 5244 | memset (&wi, 0, sizeof (wi)); |
6e2830c3 | 5245 | wi.info = (void *) &blocks; |
7bb01996 RB |
5246 | addr = walk_gimple_op (stmt, verify_expr_location, &wi); |
5247 | if (addr) | |
5248 | { | |
5249 | debug_generic_expr (addr); | |
5250 | err2 |= true; | |
5251 | } | |
5252 | ||
34019e28 RG |
5253 | /* ??? Instead of not checking these stmts at all the walker |
5254 | should know its context via wi. */ | |
5255 | if (!is_gimple_debug (stmt) | |
5256 | && !is_gimple_omp (stmt)) | |
5257 | { | |
5258 | memset (&wi, 0, sizeof (wi)); | |
5259 | addr = walk_gimple_op (stmt, verify_expr, &wi); | |
5260 | if (addr) | |
726a989a | 5261 | { |
34019e28 RG |
5262 | debug_generic_expr (addr); |
5263 | inform (gimple_location (stmt), "in statement"); | |
5264 | err2 |= true; | |
726a989a | 5265 | } |
34019e28 | 5266 | } |
1d65f45c | 5267 | |
34019e28 RG |
5268 | /* If the statement is marked as part of an EH region, then it is |
5269 | expected that the statement could throw. Verify that when we | |
5270 | have optimizations that simplify statements such that we prove | |
5271 | that they cannot throw, that we update other data structures | |
5272 | to match. */ | |
5273 | lp_nr = lookup_stmt_eh_lp (stmt); | |
e9ff9caf | 5274 | if (lp_nr > 0) |
34019e28 RG |
5275 | { |
5276 | if (!stmt_could_throw_p (stmt)) | |
1d65f45c | 5277 | { |
e9ff9caf RB |
5278 | if (verify_nothrow) |
5279 | { | |
5280 | error ("statement marked for throw, but doesn%'t"); | |
5281 | err2 |= true; | |
5282 | } | |
34019e28 | 5283 | } |
e9ff9caf | 5284 | else if (!gsi_one_before_end_p (gsi)) |
34019e28 RG |
5285 | { |
5286 | error ("statement marked for throw in middle of block"); | |
5287 | err2 |= true; | |
1d65f45c | 5288 | } |
726a989a RB |
5289 | } |
5290 | ||
34019e28 RG |
5291 | if (err2) |
5292 | debug_gimple_stmt (stmt); | |
5293 | err |= err2; | |
6de9cd9a DN |
5294 | } |
5295 | } | |
726a989a | 5296 | |
4437b50d | 5297 | eh_error_found = false; |
355fe088 | 5298 | hash_map<gimple *, int> *eh_table = get_eh_throw_stmt_table (cfun); |
b086d530 | 5299 | if (eh_table) |
355fe088 | 5300 | eh_table->traverse<hash_set<gimple *> *, verify_eh_throw_stmt_node> |
b086d530 | 5301 | (&visited_stmts); |
6de9cd9a | 5302 | |
34019e28 RG |
5303 | if (err || eh_error_found) |
5304 | internal_error ("verify_gimple failed"); | |
6de9cd9a | 5305 | |
6946b3f7 | 5306 | verify_histograms (); |
6de9cd9a DN |
5307 | timevar_pop (TV_TREE_STMT_VERIFY); |
5308 | } | |
5309 | ||
5310 | ||
5311 | /* Verifies that the flow information is OK. */ | |
5312 | ||
5313 | static int | |
726a989a | 5314 | gimple_verify_flow_info (void) |
6de9cd9a DN |
5315 | { |
5316 | int err = 0; | |
5317 | basic_block bb; | |
726a989a | 5318 | gimple_stmt_iterator gsi; |
355fe088 | 5319 | gimple *stmt; |
6de9cd9a | 5320 | edge e; |
628f6a4e | 5321 | edge_iterator ei; |
6de9cd9a | 5322 | |
fefa31b5 DM |
5323 | if (ENTRY_BLOCK_PTR_FOR_FN (cfun)->il.gimple.seq |
5324 | || ENTRY_BLOCK_PTR_FOR_FN (cfun)->il.gimple.phi_nodes) | |
6de9cd9a | 5325 | { |
7506e1cb | 5326 | error ("ENTRY_BLOCK has IL associated with it"); |
6de9cd9a DN |
5327 | err = 1; |
5328 | } | |
5329 | ||
fefa31b5 DM |
5330 | if (EXIT_BLOCK_PTR_FOR_FN (cfun)->il.gimple.seq |
5331 | || EXIT_BLOCK_PTR_FOR_FN (cfun)->il.gimple.phi_nodes) | |
6de9cd9a | 5332 | { |
7506e1cb | 5333 | error ("EXIT_BLOCK has IL associated with it"); |
6de9cd9a DN |
5334 | err = 1; |
5335 | } | |
5336 | ||
fefa31b5 | 5337 | FOR_EACH_EDGE (e, ei, EXIT_BLOCK_PTR_FOR_FN (cfun)->preds) |
6de9cd9a DN |
5338 | if (e->flags & EDGE_FALLTHRU) |
5339 | { | |
ab532386 | 5340 | error ("fallthru to exit from bb %d", e->src->index); |
6de9cd9a DN |
5341 | err = 1; |
5342 | } | |
5343 | ||
11cd3bed | 5344 | FOR_EACH_BB_FN (bb, cfun) |
6de9cd9a DN |
5345 | { |
5346 | bool found_ctrl_stmt = false; | |
5347 | ||
726a989a | 5348 | stmt = NULL; |
548414c6 | 5349 | |
6de9cd9a | 5350 | /* Skip labels on the start of basic block. */ |
726a989a | 5351 | for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi)) |
6de9cd9a | 5352 | { |
726a989a | 5353 | tree label; |
355fe088 | 5354 | gimple *prev_stmt = stmt; |
548414c6 | 5355 | |
726a989a | 5356 | stmt = gsi_stmt (gsi); |
548414c6 | 5357 | |
726a989a | 5358 | if (gimple_code (stmt) != GIMPLE_LABEL) |
6de9cd9a DN |
5359 | break; |
5360 | ||
538dd0b7 | 5361 | label = gimple_label_label (as_a <glabel *> (stmt)); |
726a989a | 5362 | if (prev_stmt && DECL_NONLOCAL (label)) |
548414c6 | 5363 | { |
953ff289 | 5364 | error ("nonlocal label "); |
ef6cb4c7 | 5365 | print_generic_expr (stderr, label); |
953ff289 DN |
5366 | fprintf (stderr, " is not first in a sequence of labels in bb %d", |
5367 | bb->index); | |
548414c6 KH |
5368 | err = 1; |
5369 | } | |
5370 | ||
1197e789 RG |
5371 | if (prev_stmt && EH_LANDING_PAD_NR (label) != 0) |
5372 | { | |
5373 | error ("EH landing pad label "); | |
ef6cb4c7 | 5374 | print_generic_expr (stderr, label); |
1197e789 RG |
5375 | fprintf (stderr, " is not first in a sequence of labels in bb %d", |
5376 | bb->index); | |
5377 | err = 1; | |
5378 | } | |
5379 | ||
726a989a | 5380 | if (label_to_block (label) != bb) |
6de9cd9a | 5381 | { |
953ff289 | 5382 | error ("label "); |
ef6cb4c7 | 5383 | print_generic_expr (stderr, label); |
953ff289 DN |
5384 | fprintf (stderr, " to block does not match in bb %d", |
5385 | bb->index); | |
6de9cd9a DN |
5386 | err = 1; |
5387 | } | |
5388 | ||
726a989a | 5389 | if (decl_function_context (label) != current_function_decl) |
6de9cd9a | 5390 | { |
953ff289 | 5391 | error ("label "); |
ef6cb4c7 | 5392 | print_generic_expr (stderr, label); |
953ff289 DN |
5393 | fprintf (stderr, " has incorrect context in bb %d", |
5394 | bb->index); | |
6de9cd9a DN |
5395 | err = 1; |
5396 | } | |
5397 | } | |
5398 | ||
5399 | /* Verify that body of basic block BB is free of control flow. */ | |
726a989a | 5400 | for (; !gsi_end_p (gsi); gsi_next (&gsi)) |
6de9cd9a | 5401 | { |
355fe088 | 5402 | gimple *stmt = gsi_stmt (gsi); |
6de9cd9a DN |
5403 | |
5404 | if (found_ctrl_stmt) | |
5405 | { | |
ab532386 | 5406 | error ("control flow in the middle of basic block %d", |
6de9cd9a DN |
5407 | bb->index); |
5408 | err = 1; | |
5409 | } | |
5410 | ||
5411 | if (stmt_ends_bb_p (stmt)) | |
5412 | found_ctrl_stmt = true; | |
5413 | ||
538dd0b7 | 5414 | if (glabel *label_stmt = dyn_cast <glabel *> (stmt)) |
6de9cd9a | 5415 | { |
953ff289 | 5416 | error ("label "); |
ef6cb4c7 | 5417 | print_generic_expr (stderr, gimple_label_label (label_stmt)); |
953ff289 | 5418 | fprintf (stderr, " in the middle of basic block %d", bb->index); |
6de9cd9a DN |
5419 | err = 1; |
5420 | } | |
5421 | } | |
953ff289 | 5422 | |
726a989a RB |
5423 | gsi = gsi_last_bb (bb); |
5424 | if (gsi_end_p (gsi)) | |
6de9cd9a DN |
5425 | continue; |
5426 | ||
726a989a | 5427 | stmt = gsi_stmt (gsi); |
6de9cd9a | 5428 | |
1d65f45c RH |
5429 | if (gimple_code (stmt) == GIMPLE_LABEL) |
5430 | continue; | |
5431 | ||
cc7220fd JH |
5432 | err |= verify_eh_edges (stmt); |
5433 | ||
6de9cd9a DN |
5434 | if (is_ctrl_stmt (stmt)) |
5435 | { | |
628f6a4e | 5436 | FOR_EACH_EDGE (e, ei, bb->succs) |
6de9cd9a DN |
5437 | if (e->flags & EDGE_FALLTHRU) |
5438 | { | |
ab532386 | 5439 | error ("fallthru edge after a control statement in bb %d", |
6de9cd9a DN |
5440 | bb->index); |
5441 | err = 1; | |
5442 | } | |
5443 | } | |
5444 | ||
726a989a | 5445 | if (gimple_code (stmt) != GIMPLE_COND) |
36b24193 ZD |
5446 | { |
5447 | /* Verify that there are no edges with EDGE_TRUE/FALSE_FLAG set | |
5448 | after anything else but if statement. */ | |
5449 | FOR_EACH_EDGE (e, ei, bb->succs) | |
5450 | if (e->flags & (EDGE_TRUE_VALUE | EDGE_FALSE_VALUE)) | |
5451 | { | |
726a989a | 5452 | error ("true/false edge after a non-GIMPLE_COND in bb %d", |
36b24193 ZD |
5453 | bb->index); |
5454 | err = 1; | |
5455 | } | |
5456 | } | |
5457 | ||
726a989a | 5458 | switch (gimple_code (stmt)) |
6de9cd9a | 5459 | { |
726a989a | 5460 | case GIMPLE_COND: |
6de9cd9a DN |
5461 | { |
5462 | edge true_edge; | |
5463 | edge false_edge; | |
b8698a0f | 5464 | |
6de9cd9a DN |
5465 | extract_true_false_edges_from_block (bb, &true_edge, &false_edge); |
5466 | ||
726a989a RB |
5467 | if (!true_edge |
5468 | || !false_edge | |
6de9cd9a DN |
5469 | || !(true_edge->flags & EDGE_TRUE_VALUE) |
5470 | || !(false_edge->flags & EDGE_FALSE_VALUE) | |
5471 | || (true_edge->flags & (EDGE_FALLTHRU | EDGE_ABNORMAL)) | |
5472 | || (false_edge->flags & (EDGE_FALLTHRU | EDGE_ABNORMAL)) | |
628f6a4e | 5473 | || EDGE_COUNT (bb->succs) >= 3) |
6de9cd9a | 5474 | { |
ab532386 | 5475 | error ("wrong outgoing edge flags at end of bb %d", |
6de9cd9a DN |
5476 | bb->index); |
5477 | err = 1; | |
5478 | } | |
6de9cd9a DN |
5479 | } |
5480 | break; | |
5481 | ||
726a989a | 5482 | case GIMPLE_GOTO: |
6de9cd9a DN |
5483 | if (simple_goto_p (stmt)) |
5484 | { | |
ab532386 | 5485 | error ("explicit goto at end of bb %d", bb->index); |
6531d1be | 5486 | err = 1; |
6de9cd9a DN |
5487 | } |
5488 | else | |
5489 | { | |
6531d1be | 5490 | /* FIXME. We should double check that the labels in the |
6de9cd9a | 5491 | destination blocks have their address taken. */ |
628f6a4e | 5492 | FOR_EACH_EDGE (e, ei, bb->succs) |
6de9cd9a DN |
5493 | if ((e->flags & (EDGE_FALLTHRU | EDGE_TRUE_VALUE |
5494 | | EDGE_FALSE_VALUE)) | |
5495 | || !(e->flags & EDGE_ABNORMAL)) | |
5496 | { | |
ab532386 | 5497 | error ("wrong outgoing edge flags at end of bb %d", |
6de9cd9a DN |
5498 | bb->index); |
5499 | err = 1; | |
5500 | } | |
5501 | } | |
5502 | break; | |
5503 | ||
c54c785d JH |
5504 | case GIMPLE_CALL: |
5505 | if (!gimple_call_builtin_p (stmt, BUILT_IN_RETURN)) | |
5506 | break; | |
191816a3 | 5507 | /* fallthru */ |
726a989a | 5508 | case GIMPLE_RETURN: |
c5cbcccf ZD |
5509 | if (!single_succ_p (bb) |
5510 | || (single_succ_edge (bb)->flags | |
5511 | & (EDGE_FALLTHRU | EDGE_ABNORMAL | |
5512 | | EDGE_TRUE_VALUE | EDGE_FALSE_VALUE))) | |
6de9cd9a | 5513 | { |
ab532386 | 5514 | error ("wrong outgoing edge flags at end of bb %d", bb->index); |
6de9cd9a DN |
5515 | err = 1; |
5516 | } | |
fefa31b5 | 5517 | if (single_succ (bb) != EXIT_BLOCK_PTR_FOR_FN (cfun)) |
6de9cd9a | 5518 | { |
ab532386 | 5519 | error ("return edge does not point to exit in bb %d", |
6de9cd9a DN |
5520 | bb->index); |
5521 | err = 1; | |
5522 | } | |
5523 | break; | |
5524 | ||
726a989a | 5525 | case GIMPLE_SWITCH: |
6de9cd9a | 5526 | { |
538dd0b7 | 5527 | gswitch *switch_stmt = as_a <gswitch *> (stmt); |
7853504d | 5528 | tree prev; |
6de9cd9a DN |
5529 | edge e; |
5530 | size_t i, n; | |
6de9cd9a | 5531 | |
538dd0b7 | 5532 | n = gimple_switch_num_labels (switch_stmt); |
6de9cd9a DN |
5533 | |
5534 | /* Mark all the destination basic blocks. */ | |
5535 | for (i = 0; i < n; ++i) | |
5536 | { | |
538dd0b7 | 5537 | tree lab = CASE_LABEL (gimple_switch_label (switch_stmt, i)); |
6de9cd9a | 5538 | basic_block label_bb = label_to_block (lab); |
1e128c5f | 5539 | gcc_assert (!label_bb->aux || label_bb->aux == (void *)1); |
6de9cd9a DN |
5540 | label_bb->aux = (void *)1; |
5541 | } | |
5542 | ||
7853504d | 5543 | /* Verify that the case labels are sorted. */ |
538dd0b7 | 5544 | prev = gimple_switch_label (switch_stmt, 0); |
b7814a18 | 5545 | for (i = 1; i < n; ++i) |
7853504d | 5546 | { |
538dd0b7 | 5547 | tree c = gimple_switch_label (switch_stmt, i); |
726a989a | 5548 | if (!CASE_LOW (c)) |
7853504d | 5549 | { |
726a989a RB |
5550 | error ("found default case not at the start of " |
5551 | "case vector"); | |
5552 | err = 1; | |
7853504d SB |
5553 | continue; |
5554 | } | |
726a989a RB |
5555 | if (CASE_LOW (prev) |
5556 | && !tree_int_cst_lt (CASE_LOW (prev), CASE_LOW (c))) | |
7853504d | 5557 | { |
953ff289 | 5558 | error ("case labels not sorted: "); |
ef6cb4c7 | 5559 | print_generic_expr (stderr, prev); |
7853504d | 5560 | fprintf (stderr," is greater than "); |
ef6cb4c7 | 5561 | print_generic_expr (stderr, c); |
7853504d SB |
5562 | fprintf (stderr," but comes before it.\n"); |
5563 | err = 1; | |
5564 | } | |
5565 | prev = c; | |
5566 | } | |
b7814a18 RG |
5567 | /* VRP will remove the default case if it can prove it will |
5568 | never be executed. So do not verify there always exists | |
5569 | a default case here. */ | |
7853504d | 5570 | |
628f6a4e | 5571 | FOR_EACH_EDGE (e, ei, bb->succs) |
6de9cd9a DN |
5572 | { |
5573 | if (!e->dest->aux) | |
5574 | { | |
ab532386 | 5575 | error ("extra outgoing edge %d->%d", |
6de9cd9a DN |
5576 | bb->index, e->dest->index); |
5577 | err = 1; | |
5578 | } | |
726a989a | 5579 | |
6de9cd9a DN |
5580 | e->dest->aux = (void *)2; |
5581 | if ((e->flags & (EDGE_FALLTHRU | EDGE_ABNORMAL | |
5582 | | EDGE_TRUE_VALUE | EDGE_FALSE_VALUE))) | |
5583 | { | |
ab532386 | 5584 | error ("wrong outgoing edge flags at end of bb %d", |
6de9cd9a DN |
5585 | bb->index); |
5586 | err = 1; | |
5587 | } | |
5588 | } | |
5589 | ||
5590 | /* Check that we have all of them. */ | |
5591 | for (i = 0; i < n; ++i) | |
5592 | { | |
538dd0b7 | 5593 | tree lab = CASE_LABEL (gimple_switch_label (switch_stmt, i)); |
6de9cd9a DN |
5594 | basic_block label_bb = label_to_block (lab); |
5595 | ||
5596 | if (label_bb->aux != (void *)2) | |
5597 | { | |
726a989a | 5598 | error ("missing edge %i->%i", bb->index, label_bb->index); |
6de9cd9a DN |
5599 | err = 1; |
5600 | } | |
5601 | } | |
5602 | ||
628f6a4e | 5603 | FOR_EACH_EDGE (e, ei, bb->succs) |
6de9cd9a DN |
5604 | e->dest->aux = (void *)0; |
5605 | } | |
1d65f45c RH |
5606 | break; |
5607 | ||
5608 | case GIMPLE_EH_DISPATCH: | |
538dd0b7 | 5609 | err |= verify_eh_dispatch_edge (as_a <geh_dispatch *> (stmt)); |
1d65f45c | 5610 | break; |
6de9cd9a | 5611 | |
1d65f45c RH |
5612 | default: |
5613 | break; | |
6de9cd9a DN |
5614 | } |
5615 | } | |
5616 | ||
2b28c07a | 5617 | if (dom_info_state (CDI_DOMINATORS) >= DOM_NO_FAST_QUERY) |
6de9cd9a DN |
5618 | verify_dominators (CDI_DOMINATORS); |
5619 | ||
5620 | return err; | |
5621 | } | |
5622 | ||
5623 | ||
f0b698c1 | 5624 | /* Updates phi nodes after creating a forwarder block joined |
6de9cd9a DN |
5625 | by edge FALLTHRU. */ |
5626 | ||
5627 | static void | |
726a989a | 5628 | gimple_make_forwarder_block (edge fallthru) |
6de9cd9a DN |
5629 | { |
5630 | edge e; | |
628f6a4e | 5631 | edge_iterator ei; |
6de9cd9a | 5632 | basic_block dummy, bb; |
726a989a | 5633 | tree var; |
538dd0b7 | 5634 | gphi_iterator gsi; |
6de9cd9a DN |
5635 | |
5636 | dummy = fallthru->src; | |
5637 | bb = fallthru->dest; | |
5638 | ||
c5cbcccf | 5639 | if (single_pred_p (bb)) |
6de9cd9a DN |
5640 | return; |
5641 | ||
cfaab3a9 | 5642 | /* If we redirected a branch we must create new PHI nodes at the |
6de9cd9a | 5643 | start of BB. */ |
726a989a | 5644 | for (gsi = gsi_start_phis (dummy); !gsi_end_p (gsi); gsi_next (&gsi)) |
6de9cd9a | 5645 | { |
538dd0b7 | 5646 | gphi *phi, *new_phi; |
b8698a0f | 5647 | |
538dd0b7 | 5648 | phi = gsi.phi (); |
726a989a | 5649 | var = gimple_phi_result (phi); |
6de9cd9a | 5650 | new_phi = create_phi_node (var, bb); |
070ecdfd | 5651 | gimple_phi_set_result (phi, copy_ssa_name (var, phi)); |
b8698a0f | 5652 | add_phi_arg (new_phi, gimple_phi_result (phi), fallthru, |
9e227d60 | 5653 | UNKNOWN_LOCATION); |
6de9cd9a DN |
5654 | } |
5655 | ||
6de9cd9a | 5656 | /* Add the arguments we have stored on edges. */ |
628f6a4e | 5657 | FOR_EACH_EDGE (e, ei, bb->preds) |
6de9cd9a DN |
5658 | { |
5659 | if (e == fallthru) | |
5660 | continue; | |
5661 | ||
71882046 | 5662 | flush_pending_stmts (e); |
6de9cd9a DN |
5663 | } |
5664 | } | |
5665 | ||
5666 | ||
6de9cd9a DN |
5667 | /* Return a non-special label in the head of basic block BLOCK. |
5668 | Create one if it doesn't exist. */ | |
5669 | ||
d7621d3c | 5670 | tree |
726a989a | 5671 | gimple_block_label (basic_block bb) |
6de9cd9a | 5672 | { |
726a989a | 5673 | gimple_stmt_iterator i, s = gsi_start_bb (bb); |
6de9cd9a | 5674 | bool first = true; |
726a989a | 5675 | tree label; |
538dd0b7 | 5676 | glabel *stmt; |
6de9cd9a | 5677 | |
726a989a | 5678 | for (i = s; !gsi_end_p (i); first = false, gsi_next (&i)) |
6de9cd9a | 5679 | { |
538dd0b7 DM |
5680 | stmt = dyn_cast <glabel *> (gsi_stmt (i)); |
5681 | if (!stmt) | |
6de9cd9a | 5682 | break; |
726a989a | 5683 | label = gimple_label_label (stmt); |
6de9cd9a DN |
5684 | if (!DECL_NONLOCAL (label)) |
5685 | { | |
5686 | if (!first) | |
726a989a | 5687 | gsi_move_before (&i, &s); |
6de9cd9a DN |
5688 | return label; |
5689 | } | |
5690 | } | |
5691 | ||
c2255bc4 | 5692 | label = create_artificial_label (UNKNOWN_LOCATION); |
726a989a RB |
5693 | stmt = gimple_build_label (label); |
5694 | gsi_insert_before (&s, stmt, GSI_NEW_STMT); | |
6de9cd9a DN |
5695 | return label; |
5696 | } | |
5697 | ||
5698 | ||
5699 | /* Attempt to perform edge redirection by replacing a possibly complex | |
5700 | jump instruction by a goto or by removing the jump completely. | |
5701 | This can apply only if all edges now point to the same block. The | |
5702 | parameters and return values are equivalent to | |
5703 | redirect_edge_and_branch. */ | |
5704 | ||
5705 | static edge | |
726a989a | 5706 | gimple_try_redirect_by_replacing_jump (edge e, basic_block target) |
6de9cd9a DN |
5707 | { |
5708 | basic_block src = e->src; | |
726a989a | 5709 | gimple_stmt_iterator i; |
355fe088 | 5710 | gimple *stmt; |
6de9cd9a | 5711 | |
07b43a87 KH |
5712 | /* We can replace or remove a complex jump only when we have exactly |
5713 | two edges. */ | |
5714 | if (EDGE_COUNT (src->succs) != 2 | |
5715 | /* Verify that all targets will be TARGET. Specifically, the | |
5716 | edge that is not E must also go to TARGET. */ | |
5717 | || EDGE_SUCC (src, EDGE_SUCC (src, 0) == e)->dest != target) | |
6de9cd9a DN |
5718 | return NULL; |
5719 | ||
726a989a RB |
5720 | i = gsi_last_bb (src); |
5721 | if (gsi_end_p (i)) | |
6de9cd9a | 5722 | return NULL; |
6de9cd9a | 5723 | |
726a989a RB |
5724 | stmt = gsi_stmt (i); |
5725 | ||
5726 | if (gimple_code (stmt) == GIMPLE_COND || gimple_code (stmt) == GIMPLE_SWITCH) | |
6de9cd9a | 5727 | { |
726a989a | 5728 | gsi_remove (&i, true); |
6de9cd9a DN |
5729 | e = ssa_redirect_edge (e, target); |
5730 | e->flags = EDGE_FALLTHRU; | |
5731 | return e; | |
5732 | } | |
5733 | ||
5734 | return NULL; | |
5735 | } | |
5736 | ||
5737 | ||
5738 | /* Redirect E to DEST. Return NULL on failure. Otherwise, return the | |
5739 | edge representing the redirected branch. */ | |
5740 | ||
5741 | static edge | |
726a989a | 5742 | gimple_redirect_edge_and_branch (edge e, basic_block dest) |
6de9cd9a DN |
5743 | { |
5744 | basic_block bb = e->src; | |
726a989a | 5745 | gimple_stmt_iterator gsi; |
6de9cd9a | 5746 | edge ret; |
355fe088 | 5747 | gimple *stmt; |
6de9cd9a | 5748 | |
4f6c2131 | 5749 | if (e->flags & EDGE_ABNORMAL) |
6de9cd9a DN |
5750 | return NULL; |
5751 | ||
6de9cd9a DN |
5752 | if (e->dest == dest) |
5753 | return NULL; | |
5754 | ||
a3710436 JH |
5755 | if (e->flags & EDGE_EH) |
5756 | return redirect_eh_edge (e, dest); | |
5757 | ||
fefa31b5 | 5758 | if (e->src != ENTRY_BLOCK_PTR_FOR_FN (cfun)) |
1c061be5 RH |
5759 | { |
5760 | ret = gimple_try_redirect_by_replacing_jump (e, dest); | |
5761 | if (ret) | |
5762 | return ret; | |
5763 | } | |
5764 | ||
726a989a RB |
5765 | gsi = gsi_last_bb (bb); |
5766 | stmt = gsi_end_p (gsi) ? NULL : gsi_stmt (gsi); | |
6de9cd9a | 5767 | |
d130ae11 | 5768 | switch (stmt ? gimple_code (stmt) : GIMPLE_ERROR_MARK) |
6de9cd9a | 5769 | { |
726a989a | 5770 | case GIMPLE_COND: |
a9b77cd1 | 5771 | /* For COND_EXPR, we only need to redirect the edge. */ |
6de9cd9a DN |
5772 | break; |
5773 | ||
726a989a | 5774 | case GIMPLE_GOTO: |
6de9cd9a DN |
5775 | /* No non-abnormal edges should lead from a non-simple goto, and |
5776 | simple ones should be represented implicitly. */ | |
1e128c5f | 5777 | gcc_unreachable (); |
6de9cd9a | 5778 | |
726a989a | 5779 | case GIMPLE_SWITCH: |
6de9cd9a | 5780 | { |
538dd0b7 | 5781 | gswitch *switch_stmt = as_a <gswitch *> (stmt); |
726a989a | 5782 | tree label = gimple_block_label (dest); |
538dd0b7 | 5783 | tree cases = get_cases_for_edge (e, switch_stmt); |
6de9cd9a | 5784 | |
d6be0d7f JL |
5785 | /* If we have a list of cases associated with E, then use it |
5786 | as it's a lot faster than walking the entire case vector. */ | |
5787 | if (cases) | |
6de9cd9a | 5788 | { |
4edbbd3f | 5789 | edge e2 = find_edge (e->src, dest); |
d6be0d7f JL |
5790 | tree last, first; |
5791 | ||
5792 | first = cases; | |
5793 | while (cases) | |
5794 | { | |
5795 | last = cases; | |
5796 | CASE_LABEL (cases) = label; | |
1290e54c | 5797 | cases = CASE_CHAIN (cases); |
d6be0d7f JL |
5798 | } |
5799 | ||
5800 | /* If there was already an edge in the CFG, then we need | |
5801 | to move all the cases associated with E to E2. */ | |
5802 | if (e2) | |
5803 | { | |
538dd0b7 | 5804 | tree cases2 = get_cases_for_edge (e2, switch_stmt); |
d6be0d7f | 5805 | |
1290e54c NF |
5806 | CASE_CHAIN (last) = CASE_CHAIN (cases2); |
5807 | CASE_CHAIN (cases2) = first; | |
d6be0d7f | 5808 | } |
fc249fe5 | 5809 | bitmap_set_bit (touched_switch_bbs, gimple_bb (stmt)->index); |
6de9cd9a | 5810 | } |
92b6dff3 JL |
5811 | else |
5812 | { | |
538dd0b7 | 5813 | size_t i, n = gimple_switch_num_labels (switch_stmt); |
d6be0d7f JL |
5814 | |
5815 | for (i = 0; i < n; i++) | |
5816 | { | |
538dd0b7 | 5817 | tree elt = gimple_switch_label (switch_stmt, i); |
d6be0d7f JL |
5818 | if (label_to_block (CASE_LABEL (elt)) == e->dest) |
5819 | CASE_LABEL (elt) = label; | |
5820 | } | |
92b6dff3 | 5821 | } |
1c384bf1 RH |
5822 | } |
5823 | break; | |
d6be0d7f | 5824 | |
1c384bf1 RH |
5825 | case GIMPLE_ASM: |
5826 | { | |
538dd0b7 DM |
5827 | gasm *asm_stmt = as_a <gasm *> (stmt); |
5828 | int i, n = gimple_asm_nlabels (asm_stmt); | |
f8981d1c | 5829 | tree label = NULL; |
1c384bf1 RH |
5830 | |
5831 | for (i = 0; i < n; ++i) | |
5832 | { | |
538dd0b7 | 5833 | tree cons = gimple_asm_label_op (asm_stmt, i); |
1c384bf1 | 5834 | if (label_to_block (TREE_VALUE (cons)) == e->dest) |
f8981d1c AO |
5835 | { |
5836 | if (!label) | |
5837 | label = gimple_block_label (dest); | |
5838 | TREE_VALUE (cons) = label; | |
5839 | } | |
1c384bf1 | 5840 | } |
f8981d1c AO |
5841 | |
5842 | /* If we didn't find any label matching the former edge in the | |
5843 | asm labels, we must be redirecting the fallthrough | |
5844 | edge. */ | |
5845 | gcc_assert (label || (e->flags & EDGE_FALLTHRU)); | |
6de9cd9a | 5846 | } |
1c384bf1 | 5847 | break; |
6de9cd9a | 5848 | |
726a989a RB |
5849 | case GIMPLE_RETURN: |
5850 | gsi_remove (&gsi, true); | |
6de9cd9a DN |
5851 | e->flags |= EDGE_FALLTHRU; |
5852 | break; | |
5853 | ||
726a989a RB |
5854 | case GIMPLE_OMP_RETURN: |
5855 | case GIMPLE_OMP_CONTINUE: | |
5856 | case GIMPLE_OMP_SECTIONS_SWITCH: | |
5857 | case GIMPLE_OMP_FOR: | |
e5c95afe ZD |
5858 | /* The edges from OMP constructs can be simply redirected. */ |
5859 | break; | |
5860 | ||
1d65f45c RH |
5861 | case GIMPLE_EH_DISPATCH: |
5862 | if (!(e->flags & EDGE_FALLTHRU)) | |
538dd0b7 | 5863 | redirect_eh_dispatch_edge (as_a <geh_dispatch *> (stmt), e, dest); |
1d65f45c RH |
5864 | break; |
5865 | ||
0a35513e | 5866 | case GIMPLE_TRANSACTION: |
7c11b0fe RH |
5867 | if (e->flags & EDGE_TM_ABORT) |
5868 | gimple_transaction_set_label_over (as_a <gtransaction *> (stmt), | |
5869 | gimple_block_label (dest)); | |
5870 | else if (e->flags & EDGE_TM_UNINSTRUMENTED) | |
5871 | gimple_transaction_set_label_uninst (as_a <gtransaction *> (stmt), | |
5872 | gimple_block_label (dest)); | |
5873 | else | |
5874 | gimple_transaction_set_label_norm (as_a <gtransaction *> (stmt), | |
5875 | gimple_block_label (dest)); | |
0a35513e AH |
5876 | break; |
5877 | ||
6de9cd9a DN |
5878 | default: |
5879 | /* Otherwise it must be a fallthru edge, and we don't need to | |
5880 | do anything besides redirecting it. */ | |
1e128c5f | 5881 | gcc_assert (e->flags & EDGE_FALLTHRU); |
6de9cd9a DN |
5882 | break; |
5883 | } | |
5884 | ||
5885 | /* Update/insert PHI nodes as necessary. */ | |
5886 | ||
5887 | /* Now update the edges in the CFG. */ | |
5888 | e = ssa_redirect_edge (e, dest); | |
5889 | ||
5890 | return e; | |
5891 | } | |
5892 | ||
14fa2cc0 ZD |
5893 | /* Returns true if it is possible to remove edge E by redirecting |
5894 | it to the destination of the other edge from E->src. */ | |
5895 | ||
5896 | static bool | |
726a989a | 5897 | gimple_can_remove_branch_p (const_edge e) |
14fa2cc0 | 5898 | { |
496a4ef5 | 5899 | if (e->flags & (EDGE_ABNORMAL | EDGE_EH)) |
14fa2cc0 ZD |
5900 | return false; |
5901 | ||
5902 | return true; | |
5903 | } | |
6de9cd9a DN |
5904 | |
5905 | /* Simple wrapper, as we can always redirect fallthru edges. */ | |
5906 | ||
5907 | static basic_block | |
726a989a | 5908 | gimple_redirect_edge_and_branch_force (edge e, basic_block dest) |
6de9cd9a | 5909 | { |
726a989a | 5910 | e = gimple_redirect_edge_and_branch (e, dest); |
1e128c5f | 5911 | gcc_assert (e); |
6de9cd9a DN |
5912 | |
5913 | return NULL; | |
5914 | } | |
5915 | ||
5916 | ||
5917 | /* Splits basic block BB after statement STMT (but at least after the | |
5918 | labels). If STMT is NULL, BB is split just after the labels. */ | |
5919 | ||
5920 | static basic_block | |
726a989a | 5921 | gimple_split_block (basic_block bb, void *stmt) |
6de9cd9a | 5922 | { |
726a989a RB |
5923 | gimple_stmt_iterator gsi; |
5924 | gimple_stmt_iterator gsi_tgt; | |
726a989a | 5925 | gimple_seq list; |
6de9cd9a DN |
5926 | basic_block new_bb; |
5927 | edge e; | |
628f6a4e | 5928 | edge_iterator ei; |
6de9cd9a DN |
5929 | |
5930 | new_bb = create_empty_bb (bb); | |
5931 | ||
5932 | /* Redirect the outgoing edges. */ | |
628f6a4e BE |
5933 | new_bb->succs = bb->succs; |
5934 | bb->succs = NULL; | |
5935 | FOR_EACH_EDGE (e, ei, new_bb->succs) | |
6de9cd9a DN |
5936 | e->src = new_bb; |
5937 | ||
b13c907a | 5938 | /* Get a stmt iterator pointing to the first stmt to move. */ |
355fe088 | 5939 | if (!stmt || gimple_code ((gimple *) stmt) == GIMPLE_LABEL) |
b13c907a RB |
5940 | gsi = gsi_after_labels (bb); |
5941 | else | |
6de9cd9a | 5942 | { |
355fe088 | 5943 | gsi = gsi_for_stmt ((gimple *) stmt); |
b13c907a | 5944 | gsi_next (&gsi); |
6de9cd9a | 5945 | } |
b13c907a RB |
5946 | |
5947 | /* Move everything from GSI to the new basic block. */ | |
726a989a | 5948 | if (gsi_end_p (gsi)) |
597ae074 JH |
5949 | return new_bb; |
5950 | ||
5951 | /* Split the statement list - avoid re-creating new containers as this | |
b8698a0f | 5952 | brings ugly quadratic memory consumption in the inliner. |
597ae074 JH |
5953 | (We are still quadratic since we need to update stmt BB pointers, |
5954 | sadly.) */ | |
355a7673 | 5955 | gsi_split_seq_before (&gsi, &list); |
726a989a RB |
5956 | set_bb_seq (new_bb, list); |
5957 | for (gsi_tgt = gsi_start (list); | |
5958 | !gsi_end_p (gsi_tgt); gsi_next (&gsi_tgt)) | |
5959 | gimple_set_bb (gsi_stmt (gsi_tgt), new_bb); | |
6de9cd9a DN |
5960 | |
5961 | return new_bb; | |
5962 | } | |
5963 | ||
5964 | ||
5965 | /* Moves basic block BB after block AFTER. */ | |
5966 | ||
5967 | static bool | |
726a989a | 5968 | gimple_move_block_after (basic_block bb, basic_block after) |
6de9cd9a DN |
5969 | { |
5970 | if (bb->prev_bb == after) | |
5971 | return true; | |
5972 | ||
5973 | unlink_block (bb); | |
5974 | link_block (bb, after); | |
5975 | ||
5976 | return true; | |
5977 | } | |
5978 | ||
5979 | ||
df92c640 SB |
5980 | /* Return TRUE if block BB has no executable statements, otherwise return |
5981 | FALSE. */ | |
5982 | ||
c1bf2a39 | 5983 | static bool |
df92c640 SB |
5984 | gimple_empty_block_p (basic_block bb) |
5985 | { | |
5986 | /* BB must have no executable statements. */ | |
5987 | gimple_stmt_iterator gsi = gsi_after_labels (bb); | |
5988 | if (phi_nodes (bb)) | |
5989 | return false; | |
5990 | if (gsi_end_p (gsi)) | |
5991 | return true; | |
5992 | if (is_gimple_debug (gsi_stmt (gsi))) | |
5993 | gsi_next_nondebug (&gsi); | |
5994 | return gsi_end_p (gsi); | |
5995 | } | |
5996 | ||
5997 | ||
5998 | /* Split a basic block if it ends with a conditional branch and if the | |
5999 | other part of the block is not empty. */ | |
6000 | ||
6001 | static basic_block | |
6002 | gimple_split_block_before_cond_jump (basic_block bb) | |
6003 | { | |
355fe088 | 6004 | gimple *last, *split_point; |
df92c640 SB |
6005 | gimple_stmt_iterator gsi = gsi_last_nondebug_bb (bb); |
6006 | if (gsi_end_p (gsi)) | |
6007 | return NULL; | |
6008 | last = gsi_stmt (gsi); | |
6009 | if (gimple_code (last) != GIMPLE_COND | |
6010 | && gimple_code (last) != GIMPLE_SWITCH) | |
6011 | return NULL; | |
4a4b6c4c | 6012 | gsi_prev (&gsi); |
df92c640 SB |
6013 | split_point = gsi_stmt (gsi); |
6014 | return split_block (bb, split_point)->dest; | |
6015 | } | |
6016 | ||
6017 | ||
6de9cd9a DN |
6018 | /* Return true if basic_block can be duplicated. */ |
6019 | ||
6020 | static bool | |
ca89096d | 6021 | gimple_can_duplicate_bb_p (const_basic_block bb ATTRIBUTE_UNUSED) |
6de9cd9a DN |
6022 | { |
6023 | return true; | |
6024 | } | |
6025 | ||
6de9cd9a DN |
6026 | /* Create a duplicate of the basic block BB. NOTE: This does not |
6027 | preserve SSA form. */ | |
6028 | ||
6029 | static basic_block | |
726a989a | 6030 | gimple_duplicate_bb (basic_block bb) |
6de9cd9a DN |
6031 | { |
6032 | basic_block new_bb; | |
538dd0b7 | 6033 | gimple_stmt_iterator gsi_tgt; |
6de9cd9a | 6034 | |
fefa31b5 | 6035 | new_bb = create_empty_bb (EXIT_BLOCK_PTR_FOR_FN (cfun)->prev_bb); |
b0382c67 | 6036 | |
84d65814 DN |
6037 | /* Copy the PHI nodes. We ignore PHI node arguments here because |
6038 | the incoming edges have not been setup yet. */ | |
538dd0b7 DM |
6039 | for (gphi_iterator gpi = gsi_start_phis (bb); |
6040 | !gsi_end_p (gpi); | |
6041 | gsi_next (&gpi)) | |
b0382c67 | 6042 | { |
538dd0b7 DM |
6043 | gphi *phi, *copy; |
6044 | phi = gpi.phi (); | |
dcc748dd RG |
6045 | copy = create_phi_node (NULL_TREE, new_bb); |
6046 | create_new_def_for (gimple_phi_result (phi), copy, | |
726a989a | 6047 | gimple_phi_result_ptr (copy)); |
2fd5894f | 6048 | gimple_set_uid (copy, gimple_uid (phi)); |
b0382c67 | 6049 | } |
84d65814 | 6050 | |
726a989a | 6051 | gsi_tgt = gsi_start_bb (new_bb); |
538dd0b7 DM |
6052 | for (gimple_stmt_iterator gsi = gsi_start_bb (bb); |
6053 | !gsi_end_p (gsi); | |
6054 | gsi_next (&gsi)) | |
6de9cd9a | 6055 | { |
84d65814 DN |
6056 | def_operand_p def_p; |
6057 | ssa_op_iter op_iter; | |
1ace6185 | 6058 | tree lhs; |
355fe088 | 6059 | gimple *stmt, *copy; |
6de9cd9a | 6060 | |
726a989a RB |
6061 | stmt = gsi_stmt (gsi); |
6062 | if (gimple_code (stmt) == GIMPLE_LABEL) | |
6de9cd9a DN |
6063 | continue; |
6064 | ||
5619e52c JJ |
6065 | /* Don't duplicate label debug stmts. */ |
6066 | if (gimple_debug_bind_p (stmt) | |
6067 | && TREE_CODE (gimple_debug_bind_get_var (stmt)) | |
6068 | == LABEL_DECL) | |
6069 | continue; | |
6070 | ||
84d65814 DN |
6071 | /* Create a new copy of STMT and duplicate STMT's virtual |
6072 | operands. */ | |
726a989a RB |
6073 | copy = gimple_copy (stmt); |
6074 | gsi_insert_after (&gsi_tgt, copy, GSI_NEW_STMT); | |
1d65f45c RH |
6075 | |
6076 | maybe_duplicate_eh_stmt (copy, stmt); | |
6946b3f7 | 6077 | gimple_duplicate_stmt_histograms (cfun, copy, cfun, stmt); |
84d65814 | 6078 | |
1ace6185 JJ |
6079 | /* When copying around a stmt writing into a local non-user |
6080 | aggregate, make sure it won't share stack slot with other | |
6081 | vars. */ | |
6082 | lhs = gimple_get_lhs (stmt); | |
6083 | if (lhs && TREE_CODE (lhs) != SSA_NAME) | |
6084 | { | |
6085 | tree base = get_base_address (lhs); | |
6086 | if (base | |
8813a647 | 6087 | && (VAR_P (base) || TREE_CODE (base) == RESULT_DECL) |
1ace6185 JJ |
6088 | && DECL_IGNORED_P (base) |
6089 | && !TREE_STATIC (base) | |
6090 | && !DECL_EXTERNAL (base) | |
8813a647 | 6091 | && (!VAR_P (base) || !DECL_HAS_VALUE_EXPR_P (base))) |
1ace6185 JJ |
6092 | DECL_NONSHAREABLE (base) = 1; |
6093 | } | |
6094 | ||
84d65814 DN |
6095 | /* Create new names for all the definitions created by COPY and |
6096 | add replacement mappings for each new name. */ | |
6097 | FOR_EACH_SSA_DEF_OPERAND (def_p, copy, op_iter, SSA_OP_ALL_DEFS) | |
6098 | create_new_def_for (DEF_FROM_PTR (def_p), copy, def_p); | |
6de9cd9a DN |
6099 | } |
6100 | ||
6101 | return new_bb; | |
6102 | } | |
6103 | ||
5f40b3cb ZD |
6104 | /* Adds phi node arguments for edge E_COPY after basic block duplication. */ |
6105 | ||
6106 | static void | |
6107 | add_phi_args_after_copy_edge (edge e_copy) | |
6108 | { | |
6109 | basic_block bb, bb_copy = e_copy->src, dest; | |
6110 | edge e; | |
6111 | edge_iterator ei; | |
538dd0b7 | 6112 | gphi *phi, *phi_copy; |
726a989a | 6113 | tree def; |
538dd0b7 | 6114 | gphi_iterator psi, psi_copy; |
5f40b3cb | 6115 | |
726a989a | 6116 | if (gimple_seq_empty_p (phi_nodes (e_copy->dest))) |
5f40b3cb ZD |
6117 | return; |
6118 | ||
6119 | bb = bb_copy->flags & BB_DUPLICATED ? get_bb_original (bb_copy) : bb_copy; | |
6120 | ||
6121 | if (e_copy->dest->flags & BB_DUPLICATED) | |
6122 | dest = get_bb_original (e_copy->dest); | |
6123 | else | |
6124 | dest = e_copy->dest; | |
6125 | ||
6126 | e = find_edge (bb, dest); | |
6127 | if (!e) | |
6128 | { | |
6129 | /* During loop unrolling the target of the latch edge is copied. | |
6130 | In this case we are not looking for edge to dest, but to | |
6131 | duplicated block whose original was dest. */ | |
6132 | FOR_EACH_EDGE (e, ei, bb->succs) | |
6133 | { | |
6134 | if ((e->dest->flags & BB_DUPLICATED) | |
6135 | && get_bb_original (e->dest) == dest) | |
6136 | break; | |
6137 | } | |
6138 | ||
6139 | gcc_assert (e != NULL); | |
6140 | } | |
6141 | ||
726a989a RB |
6142 | for (psi = gsi_start_phis (e->dest), |
6143 | psi_copy = gsi_start_phis (e_copy->dest); | |
6144 | !gsi_end_p (psi); | |
6145 | gsi_next (&psi), gsi_next (&psi_copy)) | |
5f40b3cb | 6146 | { |
538dd0b7 DM |
6147 | phi = psi.phi (); |
6148 | phi_copy = psi_copy.phi (); | |
5f40b3cb | 6149 | def = PHI_ARG_DEF_FROM_EDGE (phi, e); |
b8698a0f | 6150 | add_phi_arg (phi_copy, def, e_copy, |
9e227d60 | 6151 | gimple_phi_arg_location_from_edge (phi, e)); |
5f40b3cb ZD |
6152 | } |
6153 | } | |
6154 | ||
84d65814 | 6155 | |
42759f1e ZD |
6156 | /* Basic block BB_COPY was created by code duplication. Add phi node |
6157 | arguments for edges going out of BB_COPY. The blocks that were | |
6580ee77 | 6158 | duplicated have BB_DUPLICATED set. */ |
42759f1e ZD |
6159 | |
6160 | void | |
6161 | add_phi_args_after_copy_bb (basic_block bb_copy) | |
6162 | { | |
5f40b3cb | 6163 | edge e_copy; |
726a989a | 6164 | edge_iterator ei; |
42759f1e | 6165 | |
628f6a4e | 6166 | FOR_EACH_EDGE (e_copy, ei, bb_copy->succs) |
42759f1e | 6167 | { |
5f40b3cb | 6168 | add_phi_args_after_copy_edge (e_copy); |
42759f1e ZD |
6169 | } |
6170 | } | |
6171 | ||
6172 | /* Blocks in REGION_COPY array of length N_REGION were created by | |
6173 | duplication of basic blocks. Add phi node arguments for edges | |
5f40b3cb ZD |
6174 | going from these blocks. If E_COPY is not NULL, also add |
6175 | phi node arguments for its destination.*/ | |
42759f1e ZD |
6176 | |
6177 | void | |
5f40b3cb ZD |
6178 | add_phi_args_after_copy (basic_block *region_copy, unsigned n_region, |
6179 | edge e_copy) | |
42759f1e ZD |
6180 | { |
6181 | unsigned i; | |
6182 | ||
6183 | for (i = 0; i < n_region; i++) | |
6580ee77 | 6184 | region_copy[i]->flags |= BB_DUPLICATED; |
42759f1e ZD |
6185 | |
6186 | for (i = 0; i < n_region; i++) | |
6187 | add_phi_args_after_copy_bb (region_copy[i]); | |
5f40b3cb ZD |
6188 | if (e_copy) |
6189 | add_phi_args_after_copy_edge (e_copy); | |
42759f1e ZD |
6190 | |
6191 | for (i = 0; i < n_region; i++) | |
6580ee77 | 6192 | region_copy[i]->flags &= ~BB_DUPLICATED; |
42759f1e ZD |
6193 | } |
6194 | ||
42759f1e ZD |
6195 | /* Duplicates a REGION (set of N_REGION basic blocks) with just a single |
6196 | important exit edge EXIT. By important we mean that no SSA name defined | |
6197 | inside region is live over the other exit edges of the region. All entry | |
6198 | edges to the region must go to ENTRY->dest. The edge ENTRY is redirected | |
197ce793 | 6199 | to the duplicate of the region. Dominance and loop information is |
f14540b6 SE |
6200 | updated if UPDATE_DOMINANCE is true, but not the SSA web. If |
6201 | UPDATE_DOMINANCE is false then we assume that the caller will update the | |
6202 | dominance information after calling this function. The new basic | |
6203 | blocks are stored to REGION_COPY in the same order as they had in REGION, | |
6204 | provided that REGION_COPY is not NULL. | |
42759f1e ZD |
6205 | The function returns false if it is unable to copy the region, |
6206 | true otherwise. */ | |
6207 | ||
6208 | bool | |
726a989a | 6209 | gimple_duplicate_sese_region (edge entry, edge exit, |
42759f1e | 6210 | basic_block *region, unsigned n_region, |
f14540b6 SE |
6211 | basic_block *region_copy, |
6212 | bool update_dominance) | |
42759f1e | 6213 | { |
66f97d31 | 6214 | unsigned i; |
42759f1e ZD |
6215 | bool free_region_copy = false, copying_header = false; |
6216 | struct loop *loop = entry->dest->loop_father; | |
6217 | edge exit_copy; | |
9771b263 | 6218 | vec<basic_block> doms; |
42759f1e | 6219 | edge redirected; |
09bac500 | 6220 | int total_freq = 0, entry_freq = 0; |
3995f3a2 JH |
6221 | profile_count total_count = profile_count::uninitialized (); |
6222 | profile_count entry_count = profile_count::uninitialized (); | |
42759f1e ZD |
6223 | |
6224 | if (!can_copy_bbs_p (region, n_region)) | |
6225 | return false; | |
6226 | ||
6227 | /* Some sanity checking. Note that we do not check for all possible | |
6228 | missuses of the functions. I.e. if you ask to copy something weird, | |
6229 | it will work, but the state of structures probably will not be | |
6230 | correct. */ | |
42759f1e ZD |
6231 | for (i = 0; i < n_region; i++) |
6232 | { | |
6233 | /* We do not handle subloops, i.e. all the blocks must belong to the | |
6234 | same loop. */ | |
6235 | if (region[i]->loop_father != loop) | |
6236 | return false; | |
6237 | ||
6238 | if (region[i] != entry->dest | |
6239 | && region[i] == loop->header) | |
6240 | return false; | |
6241 | } | |
6242 | ||
42759f1e ZD |
6243 | /* In case the function is used for loop header copying (which is the primary |
6244 | use), ensure that EXIT and its copy will be new latch and entry edges. */ | |
6245 | if (loop->header == entry->dest) | |
6246 | { | |
6247 | copying_header = true; | |
42759f1e ZD |
6248 | |
6249 | if (!dominated_by_p (CDI_DOMINATORS, loop->latch, exit->src)) | |
6250 | return false; | |
6251 | ||
6252 | for (i = 0; i < n_region; i++) | |
6253 | if (region[i] != exit->src | |
6254 | && dominated_by_p (CDI_DOMINATORS, region[i], exit->src)) | |
6255 | return false; | |
6256 | } | |
6257 | ||
d50f7b84 RB |
6258 | initialize_original_copy_tables (); |
6259 | ||
6260 | if (copying_header) | |
6261 | set_loop_copy (loop, loop_outer (loop)); | |
6262 | else | |
6263 | set_loop_copy (loop, loop); | |
6264 | ||
42759f1e ZD |
6265 | if (!region_copy) |
6266 | { | |
858904db | 6267 | region_copy = XNEWVEC (basic_block, n_region); |
42759f1e ZD |
6268 | free_region_copy = true; |
6269 | } | |
6270 | ||
f14540b6 SE |
6271 | /* Record blocks outside the region that are dominated by something |
6272 | inside. */ | |
6273 | if (update_dominance) | |
6274 | { | |
6275 | doms.create (0); | |
6276 | doms = get_dominated_by_region (CDI_DOMINATORS, region, n_region); | |
6277 | } | |
42759f1e | 6278 | |
3995f3a2 | 6279 | if (entry->dest->count.initialized_p ()) |
09bac500 JH |
6280 | { |
6281 | total_count = entry->dest->count; | |
6282 | entry_count = entry->count; | |
6283 | /* Fix up corner cases, to avoid division by zero or creation of negative | |
6284 | frequencies. */ | |
6285 | if (entry_count > total_count) | |
6286 | entry_count = total_count; | |
6287 | } | |
3995f3a2 | 6288 | if (!(total_count > 0) || !(entry_count > 0)) |
09bac500 JH |
6289 | { |
6290 | total_freq = entry->dest->frequency; | |
6291 | entry_freq = EDGE_FREQUENCY (entry); | |
6292 | /* Fix up corner cases, to avoid division by zero or creation of negative | |
6293 | frequencies. */ | |
6294 | if (total_freq == 0) | |
6295 | total_freq = 1; | |
6296 | else if (entry_freq > total_freq) | |
6297 | entry_freq = total_freq; | |
6298 | } | |
5deaef19 | 6299 | |
b9a66240 | 6300 | copy_bbs (region, n_region, region_copy, &exit, 1, &exit_copy, loop, |
f14540b6 | 6301 | split_edge_bb_loc (entry), update_dominance); |
3995f3a2 | 6302 | if (total_count > 0 && entry_count > 0) |
09bac500 | 6303 | { |
3995f3a2 JH |
6304 | scale_bbs_frequencies_profile_count (region, n_region, |
6305 | total_count - entry_count, | |
6306 | total_count); | |
6307 | scale_bbs_frequencies_profile_count (region_copy, n_region, entry_count, | |
6308 | total_count); | |
09bac500 JH |
6309 | } |
6310 | else | |
6311 | { | |
6312 | scale_bbs_frequencies_int (region, n_region, total_freq - entry_freq, | |
6313 | total_freq); | |
6314 | scale_bbs_frequencies_int (region_copy, n_region, entry_freq, total_freq); | |
6315 | } | |
42759f1e ZD |
6316 | |
6317 | if (copying_header) | |
6318 | { | |
6319 | loop->header = exit->dest; | |
6320 | loop->latch = exit->src; | |
6321 | } | |
6322 | ||
6323 | /* Redirect the entry and add the phi node arguments. */ | |
6580ee77 | 6324 | redirected = redirect_edge_and_branch (entry, get_bb_copy (entry->dest)); |
42759f1e | 6325 | gcc_assert (redirected != NULL); |
71882046 | 6326 | flush_pending_stmts (entry); |
42759f1e ZD |
6327 | |
6328 | /* Concerning updating of dominators: We must recount dominators | |
84d65814 DN |
6329 | for entry block and its copy. Anything that is outside of the |
6330 | region, but was dominated by something inside needs recounting as | |
6331 | well. */ | |
f14540b6 SE |
6332 | if (update_dominance) |
6333 | { | |
6334 | set_immediate_dominator (CDI_DOMINATORS, entry->dest, entry->src); | |
6335 | doms.safe_push (get_bb_original (entry->dest)); | |
6336 | iterate_fix_dominators (CDI_DOMINATORS, doms, false); | |
6337 | doms.release (); | |
6338 | } | |
42759f1e | 6339 | |
84d65814 | 6340 | /* Add the other PHI node arguments. */ |
5f40b3cb ZD |
6341 | add_phi_args_after_copy (region_copy, n_region, NULL); |
6342 | ||
5f40b3cb ZD |
6343 | if (free_region_copy) |
6344 | free (region_copy); | |
6345 | ||
6346 | free_original_copy_tables (); | |
6347 | return true; | |
6348 | } | |
6349 | ||
69958396 RL |
6350 | /* Checks if BB is part of the region defined by N_REGION BBS. */ |
6351 | static bool | |
6352 | bb_part_of_region_p (basic_block bb, basic_block* bbs, unsigned n_region) | |
6353 | { | |
6354 | unsigned int n; | |
6355 | ||
6356 | for (n = 0; n < n_region; n++) | |
6357 | { | |
6358 | if (bb == bbs[n]) | |
6359 | return true; | |
6360 | } | |
6361 | return false; | |
6362 | } | |
6363 | ||
5f40b3cb ZD |
6364 | /* Duplicates REGION consisting of N_REGION blocks. The new blocks |
6365 | are stored to REGION_COPY in the same order in that they appear | |
6366 | in REGION, if REGION_COPY is not NULL. ENTRY is the entry to | |
6367 | the region, EXIT an exit from it. The condition guarding EXIT | |
6368 | is moved to ENTRY. Returns true if duplication succeeds, false | |
6369 | otherwise. | |
6370 | ||
b8698a0f L |
6371 | For example, |
6372 | ||
5f40b3cb ZD |
6373 | some_code; |
6374 | if (cond) | |
6375 | A; | |
6376 | else | |
6377 | B; | |
6378 | ||
6379 | is transformed to | |
6380 | ||
6381 | if (cond) | |
6382 | { | |
6383 | some_code; | |
6384 | A; | |
6385 | } | |
6386 | else | |
6387 | { | |
6388 | some_code; | |
6389 | B; | |
6390 | } | |
6391 | */ | |
6392 | ||
6393 | bool | |
726a989a RB |
6394 | gimple_duplicate_sese_tail (edge entry ATTRIBUTE_UNUSED, edge exit ATTRIBUTE_UNUSED, |
6395 | basic_block *region ATTRIBUTE_UNUSED, unsigned n_region ATTRIBUTE_UNUSED, | |
6396 | basic_block *region_copy ATTRIBUTE_UNUSED) | |
5f40b3cb ZD |
6397 | { |
6398 | unsigned i; | |
6399 | bool free_region_copy = false; | |
6400 | struct loop *loop = exit->dest->loop_father; | |
6401 | struct loop *orig_loop = entry->dest->loop_father; | |
6402 | basic_block switch_bb, entry_bb, nentry_bb; | |
9771b263 | 6403 | vec<basic_block> doms; |
5f40b3cb | 6404 | int total_freq = 0, exit_freq = 0; |
3995f3a2 JH |
6405 | profile_count total_count = profile_count::uninitialized (), |
6406 | exit_count = profile_count::uninitialized (); | |
5f40b3cb | 6407 | edge exits[2], nexits[2], e; |
12037899 | 6408 | gimple_stmt_iterator gsi; |
355fe088 | 6409 | gimple *cond_stmt; |
8adfe01d | 6410 | edge sorig, snew; |
48710229 | 6411 | basic_block exit_bb; |
538dd0b7 DM |
6412 | gphi_iterator psi; |
6413 | gphi *phi; | |
8adfe01d | 6414 | tree def; |
69958396 | 6415 | struct loop *target, *aloop, *cloop; |
5f40b3cb ZD |
6416 | |
6417 | gcc_assert (EDGE_COUNT (exit->src->succs) == 2); | |
6418 | exits[0] = exit; | |
6419 | exits[1] = EDGE_SUCC (exit->src, EDGE_SUCC (exit->src, 0) == exit); | |
6420 | ||
6421 | if (!can_copy_bbs_p (region, n_region)) | |
6422 | return false; | |
6423 | ||
5f40b3cb ZD |
6424 | initialize_original_copy_tables (); |
6425 | set_loop_copy (orig_loop, loop); | |
69958396 RL |
6426 | |
6427 | target= loop; | |
6428 | for (aloop = orig_loop->inner; aloop; aloop = aloop->next) | |
6429 | { | |
6430 | if (bb_part_of_region_p (aloop->header, region, n_region)) | |
6431 | { | |
6432 | cloop = duplicate_loop (aloop, target); | |
6433 | duplicate_subloops (aloop, cloop); | |
6434 | } | |
6435 | } | |
5f40b3cb ZD |
6436 | |
6437 | if (!region_copy) | |
6438 | { | |
6439 | region_copy = XNEWVEC (basic_block, n_region); | |
6440 | free_region_copy = true; | |
6441 | } | |
6442 | ||
5006671f | 6443 | gcc_assert (!need_ssa_update_p (cfun)); |
5f40b3cb ZD |
6444 | |
6445 | /* Record blocks outside the region that are dominated by something | |
6446 | inside. */ | |
6447 | doms = get_dominated_by_region (CDI_DOMINATORS, region, n_region); | |
6448 | ||
3995f3a2 | 6449 | if (exit->src->count > 0) |
5f40b3cb ZD |
6450 | { |
6451 | total_count = exit->src->count; | |
6452 | exit_count = exit->count; | |
6453 | /* Fix up corner cases, to avoid division by zero or creation of negative | |
6454 | frequencies. */ | |
6455 | if (exit_count > total_count) | |
6456 | exit_count = total_count; | |
6457 | } | |
6458 | else | |
6459 | { | |
6460 | total_freq = exit->src->frequency; | |
6461 | exit_freq = EDGE_FREQUENCY (exit); | |
6462 | /* Fix up corner cases, to avoid division by zero or creation of negative | |
6463 | frequencies. */ | |
6464 | if (total_freq == 0) | |
6465 | total_freq = 1; | |
6466 | if (exit_freq > total_freq) | |
6467 | exit_freq = total_freq; | |
6468 | } | |
6469 | ||
6470 | copy_bbs (region, n_region, region_copy, exits, 2, nexits, orig_loop, | |
f14540b6 | 6471 | split_edge_bb_loc (exit), true); |
3995f3a2 | 6472 | if (total_count.initialized_p ()) |
5f40b3cb | 6473 | { |
3995f3a2 JH |
6474 | scale_bbs_frequencies_profile_count (region, n_region, |
6475 | total_count - exit_count, | |
6476 | total_count); | |
6477 | scale_bbs_frequencies_profile_count (region_copy, n_region, exit_count, | |
6478 | total_count); | |
5f40b3cb ZD |
6479 | } |
6480 | else | |
6481 | { | |
6482 | scale_bbs_frequencies_int (region, n_region, total_freq - exit_freq, | |
6483 | total_freq); | |
6484 | scale_bbs_frequencies_int (region_copy, n_region, exit_freq, total_freq); | |
6485 | } | |
6486 | ||
6487 | /* Create the switch block, and put the exit condition to it. */ | |
6488 | entry_bb = entry->dest; | |
6489 | nentry_bb = get_bb_copy (entry_bb); | |
6490 | if (!last_stmt (entry->src) | |
6491 | || !stmt_ends_bb_p (last_stmt (entry->src))) | |
6492 | switch_bb = entry->src; | |
6493 | else | |
6494 | switch_bb = split_edge (entry); | |
6495 | set_immediate_dominator (CDI_DOMINATORS, nentry_bb, switch_bb); | |
6496 | ||
726a989a RB |
6497 | gsi = gsi_last_bb (switch_bb); |
6498 | cond_stmt = last_stmt (exit->src); | |
6499 | gcc_assert (gimple_code (cond_stmt) == GIMPLE_COND); | |
6500 | cond_stmt = gimple_copy (cond_stmt); | |
b8698a0f | 6501 | |
726a989a | 6502 | gsi_insert_after (&gsi, cond_stmt, GSI_NEW_STMT); |
5f40b3cb ZD |
6503 | |
6504 | sorig = single_succ_edge (switch_bb); | |
6505 | sorig->flags = exits[1]->flags; | |
6506 | snew = make_edge (switch_bb, nentry_bb, exits[0]->flags); | |
6507 | ||
6508 | /* Register the new edge from SWITCH_BB in loop exit lists. */ | |
6509 | rescan_loop_exit (snew, true, false); | |
6510 | ||
6511 | /* Add the PHI node arguments. */ | |
6512 | add_phi_args_after_copy (region_copy, n_region, snew); | |
b8698a0f | 6513 | |
5f40b3cb ZD |
6514 | /* Get rid of now superfluous conditions and associated edges (and phi node |
6515 | arguments). */ | |
48710229 | 6516 | exit_bb = exit->dest; |
b8698a0f | 6517 | |
5f40b3cb | 6518 | e = redirect_edge_and_branch (exits[0], exits[1]->dest); |
726a989a | 6519 | PENDING_STMT (e) = NULL; |
b8698a0f | 6520 | |
8adfe01d RL |
6521 | /* The latch of ORIG_LOOP was copied, and so was the backedge |
6522 | to the original header. We redirect this backedge to EXIT_BB. */ | |
48710229 | 6523 | for (i = 0; i < n_region; i++) |
8adfe01d RL |
6524 | if (get_bb_original (region_copy[i]) == orig_loop->latch) |
6525 | { | |
6526 | gcc_assert (single_succ_edge (region_copy[i])); | |
6527 | e = redirect_edge_and_branch (single_succ_edge (region_copy[i]), exit_bb); | |
6528 | PENDING_STMT (e) = NULL; | |
6529 | for (psi = gsi_start_phis (exit_bb); | |
6530 | !gsi_end_p (psi); | |
6531 | gsi_next (&psi)) | |
6532 | { | |
538dd0b7 | 6533 | phi = psi.phi (); |
8adfe01d | 6534 | def = PHI_ARG_DEF (phi, nexits[0]->dest_idx); |
9e227d60 | 6535 | add_phi_arg (phi, def, e, gimple_phi_arg_location_from_edge (phi, e)); |
8adfe01d RL |
6536 | } |
6537 | } | |
69958396 | 6538 | e = redirect_edge_and_branch (nexits[1], nexits[0]->dest); |
8adfe01d RL |
6539 | PENDING_STMT (e) = NULL; |
6540 | ||
5f40b3cb ZD |
6541 | /* Anything that is outside of the region, but was dominated by something |
6542 | inside needs to update dominance info. */ | |
6543 | iterate_fix_dominators (CDI_DOMINATORS, doms, false); | |
9771b263 | 6544 | doms.release (); |
84d65814 DN |
6545 | /* Update the SSA web. */ |
6546 | update_ssa (TODO_update_ssa); | |
6d8752c4 | 6547 | |
42759f1e ZD |
6548 | if (free_region_copy) |
6549 | free (region_copy); | |
6d8752c4 | 6550 | |
6580ee77 | 6551 | free_original_copy_tables (); |
42759f1e ZD |
6552 | return true; |
6553 | } | |
6de9cd9a | 6554 | |
50674e96 DN |
6555 | /* Add all the blocks dominated by ENTRY to the array BBS_P. Stop |
6556 | adding blocks when the dominator traversal reaches EXIT. This | |
6557 | function silently assumes that ENTRY strictly dominates EXIT. */ | |
6558 | ||
9f9f72aa | 6559 | void |
50674e96 | 6560 | gather_blocks_in_sese_region (basic_block entry, basic_block exit, |
9771b263 | 6561 | vec<basic_block> *bbs_p) |
50674e96 DN |
6562 | { |
6563 | basic_block son; | |
6564 | ||
6565 | for (son = first_dom_son (CDI_DOMINATORS, entry); | |
6566 | son; | |
6567 | son = next_dom_son (CDI_DOMINATORS, son)) | |
6568 | { | |
9771b263 | 6569 | bbs_p->safe_push (son); |
50674e96 DN |
6570 | if (son != exit) |
6571 | gather_blocks_in_sese_region (son, exit, bbs_p); | |
6572 | } | |
6573 | } | |
6574 | ||
917948d3 ZD |
6575 | /* Replaces *TP with a duplicate (belonging to function TO_CONTEXT). |
6576 | The duplicates are recorded in VARS_MAP. */ | |
6577 | ||
6578 | static void | |
b787e7a2 | 6579 | replace_by_duplicate_decl (tree *tp, hash_map<tree, tree> *vars_map, |
917948d3 ZD |
6580 | tree to_context) |
6581 | { | |
6582 | tree t = *tp, new_t; | |
6583 | struct function *f = DECL_STRUCT_FUNCTION (to_context); | |
917948d3 ZD |
6584 | |
6585 | if (DECL_CONTEXT (t) == to_context) | |
6586 | return; | |
6587 | ||
b787e7a2 TS |
6588 | bool existed; |
6589 | tree &loc = vars_map->get_or_insert (t, &existed); | |
917948d3 | 6590 | |
b787e7a2 | 6591 | if (!existed) |
917948d3 | 6592 | { |
917948d3 ZD |
6593 | if (SSA_VAR_P (t)) |
6594 | { | |
6595 | new_t = copy_var_decl (t, DECL_NAME (t), TREE_TYPE (t)); | |
c021f10b | 6596 | add_local_decl (f, new_t); |
917948d3 ZD |
6597 | } |
6598 | else | |
6599 | { | |
6600 | gcc_assert (TREE_CODE (t) == CONST_DECL); | |
6601 | new_t = copy_node (t); | |
6602 | } | |
6603 | DECL_CONTEXT (new_t) = to_context; | |
6604 | ||
b787e7a2 | 6605 | loc = new_t; |
917948d3 ZD |
6606 | } |
6607 | else | |
b787e7a2 | 6608 | new_t = loc; |
917948d3 ZD |
6609 | |
6610 | *tp = new_t; | |
6611 | } | |
6612 | ||
726a989a | 6613 | |
917948d3 ZD |
6614 | /* Creates an ssa name in TO_CONTEXT equivalent to NAME. |
6615 | VARS_MAP maps old ssa names and var_decls to the new ones. */ | |
6616 | ||
6617 | static tree | |
b787e7a2 | 6618 | replace_ssa_name (tree name, hash_map<tree, tree> *vars_map, |
917948d3 ZD |
6619 | tree to_context) |
6620 | { | |
70b5e7dc | 6621 | tree new_name; |
917948d3 | 6622 | |
ea057359 | 6623 | gcc_assert (!virtual_operand_p (name)); |
917948d3 | 6624 | |
b787e7a2 | 6625 | tree *loc = vars_map->get (name); |
917948d3 ZD |
6626 | |
6627 | if (!loc) | |
6628 | { | |
70b5e7dc RG |
6629 | tree decl = SSA_NAME_VAR (name); |
6630 | if (decl) | |
6631 | { | |
2eddac76 | 6632 | gcc_assert (!SSA_NAME_IS_DEFAULT_DEF (name)); |
70b5e7dc RG |
6633 | replace_by_duplicate_decl (&decl, vars_map, to_context); |
6634 | new_name = make_ssa_name_fn (DECL_STRUCT_FUNCTION (to_context), | |
6635 | decl, SSA_NAME_DEF_STMT (name)); | |
70b5e7dc RG |
6636 | } |
6637 | else | |
6638 | new_name = copy_ssa_name_fn (DECL_STRUCT_FUNCTION (to_context), | |
6639 | name, SSA_NAME_DEF_STMT (name)); | |
917948d3 | 6640 | |
2eddac76 TV |
6641 | /* Now that we've used the def stmt to define new_name, make sure it |
6642 | doesn't define name anymore. */ | |
6643 | SSA_NAME_DEF_STMT (name) = NULL; | |
6644 | ||
b787e7a2 | 6645 | vars_map->put (name, new_name); |
917948d3 ZD |
6646 | } |
6647 | else | |
b787e7a2 | 6648 | new_name = *loc; |
917948d3 ZD |
6649 | |
6650 | return new_name; | |
6651 | } | |
50674e96 DN |
6652 | |
6653 | struct move_stmt_d | |
6654 | { | |
b357f682 JJ |
6655 | tree orig_block; |
6656 | tree new_block; | |
50674e96 DN |
6657 | tree from_context; |
6658 | tree to_context; | |
b787e7a2 | 6659 | hash_map<tree, tree> *vars_map; |
fad41cd7 | 6660 | htab_t new_label_map; |
b787e7a2 | 6661 | hash_map<void *, void *> *eh_map; |
50674e96 DN |
6662 | bool remap_decls_p; |
6663 | }; | |
6664 | ||
6665 | /* Helper for move_block_to_fn. Set TREE_BLOCK in every expression | |
b357f682 JJ |
6666 | contained in *TP if it has been ORIG_BLOCK previously and change the |
6667 | DECL_CONTEXT of every local variable referenced in *TP. */ | |
50674e96 DN |
6668 | |
6669 | static tree | |
726a989a | 6670 | move_stmt_op (tree *tp, int *walk_subtrees, void *data) |
50674e96 | 6671 | { |
726a989a RB |
6672 | struct walk_stmt_info *wi = (struct walk_stmt_info *) data; |
6673 | struct move_stmt_d *p = (struct move_stmt_d *) wi->info; | |
fad41cd7 | 6674 | tree t = *tp; |
50674e96 | 6675 | |
726a989a | 6676 | if (EXPR_P (t)) |
5368224f | 6677 | { |
0c2b2040 | 6678 | tree block = TREE_BLOCK (t); |
1e7ef862 RB |
6679 | if (block == NULL_TREE) |
6680 | ; | |
6681 | else if (block == p->orig_block | |
6682 | || p->orig_block == NULL_TREE) | |
5368224f | 6683 | TREE_SET_BLOCK (t, p->new_block); |
1e7ef862 | 6684 | else if (flag_checking) |
0c2b2040 RB |
6685 | { |
6686 | while (block && TREE_CODE (block) == BLOCK && block != p->orig_block) | |
6687 | block = BLOCK_SUPERCONTEXT (block); | |
6688 | gcc_assert (block == p->orig_block); | |
6689 | } | |
5368224f | 6690 | } |
917948d3 | 6691 | else if (DECL_P (t) || TREE_CODE (t) == SSA_NAME) |
50674e96 | 6692 | { |
917948d3 ZD |
6693 | if (TREE_CODE (t) == SSA_NAME) |
6694 | *tp = replace_ssa_name (t, p->vars_map, p->to_context); | |
2eddac76 TV |
6695 | else if (TREE_CODE (t) == PARM_DECL |
6696 | && gimple_in_ssa_p (cfun)) | |
6697 | *tp = *(p->vars_map->get (t)); | |
917948d3 | 6698 | else if (TREE_CODE (t) == LABEL_DECL) |
fad41cd7 RH |
6699 | { |
6700 | if (p->new_label_map) | |
6701 | { | |
6702 | struct tree_map in, *out; | |
fc8600f9 | 6703 | in.base.from = t; |
3d9a9f94 KG |
6704 | out = (struct tree_map *) |
6705 | htab_find_with_hash (p->new_label_map, &in, DECL_UID (t)); | |
fad41cd7 RH |
6706 | if (out) |
6707 | *tp = t = out->to; | |
6708 | } | |
50674e96 | 6709 | |
fad41cd7 RH |
6710 | DECL_CONTEXT (t) = p->to_context; |
6711 | } | |
6712 | else if (p->remap_decls_p) | |
50674e96 | 6713 | { |
917948d3 ZD |
6714 | /* Replace T with its duplicate. T should no longer appear in the |
6715 | parent function, so this looks wasteful; however, it may appear | |
6716 | in referenced_vars, and more importantly, as virtual operands of | |
6717 | statements, and in alias lists of other variables. It would be | |
6718 | quite difficult to expunge it from all those places. ??? It might | |
6719 | suffice to do this for addressable variables. */ | |
8813a647 | 6720 | if ((VAR_P (t) && !is_global_var (t)) |
917948d3 | 6721 | || TREE_CODE (t) == CONST_DECL) |
46eb666a | 6722 | replace_by_duplicate_decl (tp, p->vars_map, p->to_context); |
50674e96 | 6723 | } |
917948d3 | 6724 | *walk_subtrees = 0; |
50674e96 | 6725 | } |
fad41cd7 RH |
6726 | else if (TYPE_P (t)) |
6727 | *walk_subtrees = 0; | |
50674e96 DN |
6728 | |
6729 | return NULL_TREE; | |
6730 | } | |
6731 | ||
1d65f45c RH |
6732 | /* Helper for move_stmt_r. Given an EH region number for the source |
6733 | function, map that to the duplicate EH regio number in the dest. */ | |
6734 | ||
6735 | static int | |
6736 | move_stmt_eh_region_nr (int old_nr, struct move_stmt_d *p) | |
6737 | { | |
6738 | eh_region old_r, new_r; | |
1d65f45c RH |
6739 | |
6740 | old_r = get_eh_region_from_number (old_nr); | |
b787e7a2 | 6741 | new_r = static_cast<eh_region> (*p->eh_map->get (old_r)); |
1d65f45c RH |
6742 | |
6743 | return new_r->index; | |
6744 | } | |
6745 | ||
6746 | /* Similar, but operate on INTEGER_CSTs. */ | |
6747 | ||
6748 | static tree | |
6749 | move_stmt_eh_region_tree_nr (tree old_t_nr, struct move_stmt_d *p) | |
6750 | { | |
6751 | int old_nr, new_nr; | |
6752 | ||
9439e9a1 | 6753 | old_nr = tree_to_shwi (old_t_nr); |
1d65f45c RH |
6754 | new_nr = move_stmt_eh_region_nr (old_nr, p); |
6755 | ||
45a2c477 | 6756 | return build_int_cst (integer_type_node, new_nr); |
1d65f45c RH |
6757 | } |
6758 | ||
726a989a RB |
6759 | /* Like move_stmt_op, but for gimple statements. |
6760 | ||
6761 | Helper for move_block_to_fn. Set GIMPLE_BLOCK in every expression | |
6762 | contained in the current statement in *GSI_P and change the | |
6763 | DECL_CONTEXT of every local variable referenced in the current | |
6764 | statement. */ | |
6765 | ||
6766 | static tree | |
6767 | move_stmt_r (gimple_stmt_iterator *gsi_p, bool *handled_ops_p, | |
6768 | struct walk_stmt_info *wi) | |
6769 | { | |
6770 | struct move_stmt_d *p = (struct move_stmt_d *) wi->info; | |
355fe088 | 6771 | gimple *stmt = gsi_stmt (*gsi_p); |
726a989a RB |
6772 | tree block = gimple_block (stmt); |
6773 | ||
0c2b2040 RB |
6774 | if (block == p->orig_block |
6775 | || (p->orig_block == NULL_TREE | |
6776 | && block != NULL_TREE)) | |
726a989a | 6777 | gimple_set_block (stmt, p->new_block); |
726a989a | 6778 | |
1d65f45c | 6779 | switch (gimple_code (stmt)) |
726a989a | 6780 | { |
1d65f45c RH |
6781 | case GIMPLE_CALL: |
6782 | /* Remap the region numbers for __builtin_eh_{pointer,filter}. */ | |
6783 | { | |
6784 | tree r, fndecl = gimple_call_fndecl (stmt); | |
6785 | if (fndecl && DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_NORMAL) | |
6786 | switch (DECL_FUNCTION_CODE (fndecl)) | |
6787 | { | |
6788 | case BUILT_IN_EH_COPY_VALUES: | |
6789 | r = gimple_call_arg (stmt, 1); | |
6790 | r = move_stmt_eh_region_tree_nr (r, p); | |
6791 | gimple_call_set_arg (stmt, 1, r); | |
6792 | /* FALLTHRU */ | |
6793 | ||
6794 | case BUILT_IN_EH_POINTER: | |
6795 | case BUILT_IN_EH_FILTER: | |
6796 | r = gimple_call_arg (stmt, 0); | |
6797 | r = move_stmt_eh_region_tree_nr (r, p); | |
6798 | gimple_call_set_arg (stmt, 0, r); | |
6799 | break; | |
726a989a | 6800 | |
1d65f45c RH |
6801 | default: |
6802 | break; | |
6803 | } | |
6804 | } | |
6805 | break; | |
6806 | ||
6807 | case GIMPLE_RESX: | |
6808 | { | |
538dd0b7 DM |
6809 | gresx *resx_stmt = as_a <gresx *> (stmt); |
6810 | int r = gimple_resx_region (resx_stmt); | |
1d65f45c | 6811 | r = move_stmt_eh_region_nr (r, p); |
538dd0b7 | 6812 | gimple_resx_set_region (resx_stmt, r); |
1d65f45c RH |
6813 | } |
6814 | break; | |
726a989a | 6815 | |
1d65f45c RH |
6816 | case GIMPLE_EH_DISPATCH: |
6817 | { | |
538dd0b7 DM |
6818 | geh_dispatch *eh_dispatch_stmt = as_a <geh_dispatch *> (stmt); |
6819 | int r = gimple_eh_dispatch_region (eh_dispatch_stmt); | |
1d65f45c | 6820 | r = move_stmt_eh_region_nr (r, p); |
538dd0b7 | 6821 | gimple_eh_dispatch_set_region (eh_dispatch_stmt, r); |
1d65f45c RH |
6822 | } |
6823 | break; | |
6824 | ||
6825 | case GIMPLE_OMP_RETURN: | |
6826 | case GIMPLE_OMP_CONTINUE: | |
6827 | break; | |
6828 | default: | |
6829 | if (is_gimple_omp (stmt)) | |
6830 | { | |
6831 | /* Do not remap variables inside OMP directives. Variables | |
6832 | referenced in clauses and directive header belong to the | |
6833 | parent function and should not be moved into the child | |
6834 | function. */ | |
6835 | bool save_remap_decls_p = p->remap_decls_p; | |
6836 | p->remap_decls_p = false; | |
6837 | *handled_ops_p = true; | |
6838 | ||
355a7673 MM |
6839 | walk_gimple_seq_mod (gimple_omp_body_ptr (stmt), move_stmt_r, |
6840 | move_stmt_op, wi); | |
1d65f45c RH |
6841 | |
6842 | p->remap_decls_p = save_remap_decls_p; | |
6843 | } | |
6844 | break; | |
726a989a RB |
6845 | } |
6846 | ||
6847 | return NULL_TREE; | |
6848 | } | |
6849 | ||
50674e96 DN |
6850 | /* Move basic block BB from function CFUN to function DEST_FN. The |
6851 | block is moved out of the original linked list and placed after | |
6852 | block AFTER in the new list. Also, the block is removed from the | |
6853 | original array of blocks and placed in DEST_FN's array of blocks. | |
6854 | If UPDATE_EDGE_COUNT_P is true, the edge counts on both CFGs is | |
6855 | updated to reflect the moved edges. | |
6531d1be | 6856 | |
917948d3 ZD |
6857 | The local variables are remapped to new instances, VARS_MAP is used |
6858 | to record the mapping. */ | |
50674e96 DN |
6859 | |
6860 | static void | |
6861 | move_block_to_fn (struct function *dest_cfun, basic_block bb, | |
6862 | basic_block after, bool update_edge_count_p, | |
1d65f45c | 6863 | struct move_stmt_d *d) |
50674e96 DN |
6864 | { |
6865 | struct control_flow_graph *cfg; | |
6866 | edge_iterator ei; | |
6867 | edge e; | |
726a989a | 6868 | gimple_stmt_iterator si; |
728b26bb | 6869 | unsigned old_len, new_len; |
50674e96 | 6870 | |
3722506a ZD |
6871 | /* Remove BB from dominance structures. */ |
6872 | delete_from_dominance_info (CDI_DOMINATORS, bb); | |
d7ed20db RB |
6873 | |
6874 | /* Move BB from its current loop to the copy in the new function. */ | |
5f40b3cb | 6875 | if (current_loops) |
d7ed20db RB |
6876 | { |
6877 | struct loop *new_loop = (struct loop *)bb->loop_father->aux; | |
6878 | if (new_loop) | |
6879 | bb->loop_father = new_loop; | |
6880 | } | |
3722506a | 6881 | |
50674e96 DN |
6882 | /* Link BB to the new linked list. */ |
6883 | move_block_after (bb, after); | |
6884 | ||
6885 | /* Update the edge count in the corresponding flowgraphs. */ | |
6886 | if (update_edge_count_p) | |
6887 | FOR_EACH_EDGE (e, ei, bb->succs) | |
6888 | { | |
6889 | cfun->cfg->x_n_edges--; | |
6890 | dest_cfun->cfg->x_n_edges++; | |
6891 | } | |
6892 | ||
6893 | /* Remove BB from the original basic block array. */ | |
9771b263 | 6894 | (*cfun->cfg->x_basic_block_info)[bb->index] = NULL; |
50674e96 DN |
6895 | cfun->cfg->x_n_basic_blocks--; |
6896 | ||
6897 | /* Grow DEST_CFUN's basic block array if needed. */ | |
6898 | cfg = dest_cfun->cfg; | |
6899 | cfg->x_n_basic_blocks++; | |
3722506a ZD |
6900 | if (bb->index >= cfg->x_last_basic_block) |
6901 | cfg->x_last_basic_block = bb->index + 1; | |
50674e96 | 6902 | |
9771b263 | 6903 | old_len = vec_safe_length (cfg->x_basic_block_info); |
728b26bb | 6904 | if ((unsigned) cfg->x_last_basic_block >= old_len) |
50674e96 | 6905 | { |
728b26bb | 6906 | new_len = cfg->x_last_basic_block + (cfg->x_last_basic_block + 3) / 4; |
9771b263 | 6907 | vec_safe_grow_cleared (cfg->x_basic_block_info, new_len); |
50674e96 DN |
6908 | } |
6909 | ||
9771b263 | 6910 | (*cfg->x_basic_block_info)[bb->index] = bb; |
50674e96 | 6911 | |
917948d3 | 6912 | /* Remap the variables in phi nodes. */ |
538dd0b7 DM |
6913 | for (gphi_iterator psi = gsi_start_phis (bb); |
6914 | !gsi_end_p (psi); ) | |
917948d3 | 6915 | { |
538dd0b7 | 6916 | gphi *phi = psi.phi (); |
917948d3 ZD |
6917 | use_operand_p use; |
6918 | tree op = PHI_RESULT (phi); | |
6919 | ssa_op_iter oi; | |
846b158c | 6920 | unsigned i; |
917948d3 | 6921 | |
ea057359 | 6922 | if (virtual_operand_p (op)) |
5f40b3cb ZD |
6923 | { |
6924 | /* Remove the phi nodes for virtual operands (alias analysis will be | |
6925 | run for the new function, anyway). */ | |
538dd0b7 | 6926 | remove_phi_node (&psi, true); |
5f40b3cb ZD |
6927 | continue; |
6928 | } | |
917948d3 | 6929 | |
b357f682 JJ |
6930 | SET_PHI_RESULT (phi, |
6931 | replace_ssa_name (op, d->vars_map, dest_cfun->decl)); | |
917948d3 ZD |
6932 | FOR_EACH_PHI_ARG (use, phi, oi, SSA_OP_USE) |
6933 | { | |
6934 | op = USE_FROM_PTR (use); | |
6935 | if (TREE_CODE (op) == SSA_NAME) | |
b357f682 | 6936 | SET_USE (use, replace_ssa_name (op, d->vars_map, dest_cfun->decl)); |
917948d3 | 6937 | } |
726a989a | 6938 | |
846b158c DC |
6939 | for (i = 0; i < EDGE_COUNT (bb->preds); i++) |
6940 | { | |
6941 | location_t locus = gimple_phi_arg_location (phi, i); | |
6942 | tree block = LOCATION_BLOCK (locus); | |
6943 | ||
6944 | if (locus == UNKNOWN_LOCATION) | |
6945 | continue; | |
6946 | if (d->orig_block == NULL_TREE || block == d->orig_block) | |
6947 | { | |
ebedc9a3 | 6948 | locus = set_block (locus, d->new_block); |
846b158c DC |
6949 | gimple_phi_arg_set_location (phi, i, locus); |
6950 | } | |
6951 | } | |
6952 | ||
538dd0b7 | 6953 | gsi_next (&psi); |
917948d3 ZD |
6954 | } |
6955 | ||
726a989a | 6956 | for (si = gsi_start_bb (bb); !gsi_end_p (si); gsi_next (&si)) |
50674e96 | 6957 | { |
355fe088 | 6958 | gimple *stmt = gsi_stmt (si); |
726a989a | 6959 | struct walk_stmt_info wi; |
50674e96 | 6960 | |
726a989a RB |
6961 | memset (&wi, 0, sizeof (wi)); |
6962 | wi.info = d; | |
6963 | walk_gimple_stmt (&si, move_stmt_r, move_stmt_op, &wi); | |
50674e96 | 6964 | |
538dd0b7 | 6965 | if (glabel *label_stmt = dyn_cast <glabel *> (stmt)) |
50674e96 | 6966 | { |
538dd0b7 | 6967 | tree label = gimple_label_label (label_stmt); |
50674e96 DN |
6968 | int uid = LABEL_DECL_UID (label); |
6969 | ||
6970 | gcc_assert (uid > -1); | |
6971 | ||
9771b263 | 6972 | old_len = vec_safe_length (cfg->x_label_to_block_map); |
50674e96 DN |
6973 | if (old_len <= (unsigned) uid) |
6974 | { | |
5006671f | 6975 | new_len = 3 * uid / 2 + 1; |
9771b263 | 6976 | vec_safe_grow_cleared (cfg->x_label_to_block_map, new_len); |
50674e96 DN |
6977 | } |
6978 | ||
9771b263 DN |
6979 | (*cfg->x_label_to_block_map)[uid] = bb; |
6980 | (*cfun->cfg->x_label_to_block_map)[uid] = NULL; | |
50674e96 DN |
6981 | |
6982 | gcc_assert (DECL_CONTEXT (label) == dest_cfun->decl); | |
6983 | ||
cb91fab0 JH |
6984 | if (uid >= dest_cfun->cfg->last_label_uid) |
6985 | dest_cfun->cfg->last_label_uid = uid + 1; | |
50674e96 | 6986 | } |
fad41cd7 | 6987 | |
1d65f45c RH |
6988 | maybe_duplicate_eh_stmt_fn (dest_cfun, stmt, cfun, stmt, d->eh_map, 0); |
6989 | remove_stmt_from_eh_lp_fn (cfun, stmt); | |
6990 | ||
6991 | gimple_duplicate_stmt_histograms (dest_cfun, stmt, cfun, stmt); | |
6992 | gimple_remove_stmt_histograms (cfun, stmt); | |
917948d3 | 6993 | |
5f40b3cb ZD |
6994 | /* We cannot leave any operands allocated from the operand caches of |
6995 | the current function. */ | |
6a58ccca | 6996 | free_stmt_operands (cfun, stmt); |
5f40b3cb | 6997 | push_cfun (dest_cfun); |
917948d3 | 6998 | update_stmt (stmt); |
5f40b3cb | 6999 | pop_cfun (); |
fad41cd7 | 7000 | } |
7241571e JJ |
7001 | |
7002 | FOR_EACH_EDGE (e, ei, bb->succs) | |
60478b9c | 7003 | if (e->goto_locus != UNKNOWN_LOCATION) |
7241571e | 7004 | { |
5368224f | 7005 | tree block = LOCATION_BLOCK (e->goto_locus); |
7241571e JJ |
7006 | if (d->orig_block == NULL_TREE |
7007 | || block == d->orig_block) | |
ebedc9a3 | 7008 | e->goto_locus = set_block (e->goto_locus, d->new_block); |
7241571e | 7009 | } |
fad41cd7 RH |
7010 | } |
7011 | ||
7012 | /* Examine the statements in BB (which is in SRC_CFUN); find and return | |
7013 | the outermost EH region. Use REGION as the incoming base EH region. */ | |
7014 | ||
1d65f45c | 7015 | static eh_region |
fad41cd7 | 7016 | find_outermost_region_in_block (struct function *src_cfun, |
1d65f45c | 7017 | basic_block bb, eh_region region) |
fad41cd7 | 7018 | { |
726a989a | 7019 | gimple_stmt_iterator si; |
6531d1be | 7020 | |
726a989a | 7021 | for (si = gsi_start_bb (bb); !gsi_end_p (si); gsi_next (&si)) |
fad41cd7 | 7022 | { |
355fe088 | 7023 | gimple *stmt = gsi_stmt (si); |
1d65f45c RH |
7024 | eh_region stmt_region; |
7025 | int lp_nr; | |
1799e5d5 | 7026 | |
1d65f45c RH |
7027 | lp_nr = lookup_stmt_eh_lp_fn (src_cfun, stmt); |
7028 | stmt_region = get_eh_region_from_lp_number_fn (src_cfun, lp_nr); | |
7029 | if (stmt_region) | |
7e2df4a1 | 7030 | { |
1d65f45c | 7031 | if (region == NULL) |
7e2df4a1 JJ |
7032 | region = stmt_region; |
7033 | else if (stmt_region != region) | |
7034 | { | |
7035 | region = eh_region_outermost (src_cfun, stmt_region, region); | |
1d65f45c | 7036 | gcc_assert (region != NULL); |
7e2df4a1 JJ |
7037 | } |
7038 | } | |
50674e96 | 7039 | } |
fad41cd7 RH |
7040 | |
7041 | return region; | |
50674e96 DN |
7042 | } |
7043 | ||
fad41cd7 RH |
7044 | static tree |
7045 | new_label_mapper (tree decl, void *data) | |
7046 | { | |
7047 | htab_t hash = (htab_t) data; | |
7048 | struct tree_map *m; | |
7049 | void **slot; | |
7050 | ||
7051 | gcc_assert (TREE_CODE (decl) == LABEL_DECL); | |
7052 | ||
3d9a9f94 | 7053 | m = XNEW (struct tree_map); |
fad41cd7 | 7054 | m->hash = DECL_UID (decl); |
fc8600f9 | 7055 | m->base.from = decl; |
c2255bc4 | 7056 | m->to = create_artificial_label (UNKNOWN_LOCATION); |
fad41cd7 | 7057 | LABEL_DECL_UID (m->to) = LABEL_DECL_UID (decl); |
cb91fab0 JH |
7058 | if (LABEL_DECL_UID (m->to) >= cfun->cfg->last_label_uid) |
7059 | cfun->cfg->last_label_uid = LABEL_DECL_UID (m->to) + 1; | |
fad41cd7 RH |
7060 | |
7061 | slot = htab_find_slot_with_hash (hash, m, m->hash, INSERT); | |
7062 | gcc_assert (*slot == NULL); | |
7063 | ||
7064 | *slot = m; | |
7065 | ||
7066 | return m->to; | |
7067 | } | |
50674e96 | 7068 | |
710ee218 CP |
7069 | /* Tree walker to replace the decls used inside value expressions by |
7070 | duplicates. */ | |
7071 | ||
7072 | static tree | |
7073 | replace_block_vars_by_duplicates_1 (tree *tp, int *walk_subtrees, void *data) | |
7074 | { | |
7075 | struct replace_decls_d *rd = (struct replace_decls_d *)data; | |
7076 | ||
7077 | switch (TREE_CODE (*tp)) | |
7078 | { | |
7079 | case VAR_DECL: | |
7080 | case PARM_DECL: | |
7081 | case RESULT_DECL: | |
7082 | replace_by_duplicate_decl (tp, rd->vars_map, rd->to_context); | |
7083 | break; | |
7084 | default: | |
7085 | break; | |
7086 | } | |
7087 | ||
7088 | if (IS_TYPE_OR_DECL_P (*tp)) | |
7089 | *walk_subtrees = false; | |
7090 | ||
7091 | return NULL; | |
7092 | } | |
7093 | ||
b357f682 JJ |
7094 | /* Change DECL_CONTEXT of all BLOCK_VARS in block, including |
7095 | subblocks. */ | |
7096 | ||
7097 | static void | |
b787e7a2 | 7098 | replace_block_vars_by_duplicates (tree block, hash_map<tree, tree> *vars_map, |
b357f682 JJ |
7099 | tree to_context) |
7100 | { | |
7101 | tree *tp, t; | |
7102 | ||
910ad8de | 7103 | for (tp = &BLOCK_VARS (block); *tp; tp = &DECL_CHAIN (*tp)) |
b357f682 JJ |
7104 | { |
7105 | t = *tp; | |
8813a647 | 7106 | if (!VAR_P (t) && TREE_CODE (t) != CONST_DECL) |
e1e2bac4 | 7107 | continue; |
b357f682 JJ |
7108 | replace_by_duplicate_decl (&t, vars_map, to_context); |
7109 | if (t != *tp) | |
7110 | { | |
8813a647 | 7111 | if (VAR_P (*tp) && DECL_HAS_VALUE_EXPR_P (*tp)) |
b357f682 | 7112 | { |
710ee218 CP |
7113 | tree x = DECL_VALUE_EXPR (*tp); |
7114 | struct replace_decls_d rd = { vars_map, to_context }; | |
7115 | unshare_expr (x); | |
7116 | walk_tree (&x, replace_block_vars_by_duplicates_1, &rd, NULL); | |
7117 | SET_DECL_VALUE_EXPR (t, x); | |
b357f682 JJ |
7118 | DECL_HAS_VALUE_EXPR_P (t) = 1; |
7119 | } | |
910ad8de | 7120 | DECL_CHAIN (t) = DECL_CHAIN (*tp); |
b357f682 JJ |
7121 | *tp = t; |
7122 | } | |
7123 | } | |
7124 | ||
7125 | for (block = BLOCK_SUBBLOCKS (block); block; block = BLOCK_CHAIN (block)) | |
7126 | replace_block_vars_by_duplicates (block, vars_map, to_context); | |
7127 | } | |
7128 | ||
d7ed20db RB |
7129 | /* Fixup the loop arrays and numbers after moving LOOP and its subloops |
7130 | from FN1 to FN2. */ | |
7131 | ||
7132 | static void | |
7133 | fixup_loop_arrays_after_move (struct function *fn1, struct function *fn2, | |
7134 | struct loop *loop) | |
7135 | { | |
7136 | /* Discard it from the old loop array. */ | |
0fc822d0 | 7137 | (*get_loops (fn1))[loop->num] = NULL; |
d7ed20db RB |
7138 | |
7139 | /* Place it in the new loop array, assigning it a new number. */ | |
0fc822d0 RB |
7140 | loop->num = number_of_loops (fn2); |
7141 | vec_safe_push (loops_for_fn (fn2)->larray, loop); | |
d7ed20db RB |
7142 | |
7143 | /* Recurse to children. */ | |
7144 | for (loop = loop->inner; loop; loop = loop->next) | |
7145 | fixup_loop_arrays_after_move (fn1, fn2, loop); | |
7146 | } | |
7147 | ||
1a2a3360 TV |
7148 | /* Verify that the blocks in BBS_P are a single-entry, single-exit region |
7149 | delimited by ENTRY_BB and EXIT_BB, possibly containing noreturn blocks. */ | |
7150 | ||
7151 | DEBUG_FUNCTION void | |
7152 | verify_sese (basic_block entry, basic_block exit, vec<basic_block> *bbs_p) | |
7153 | { | |
7154 | basic_block bb; | |
7155 | edge_iterator ei; | |
7156 | edge e; | |
7157 | bitmap bbs = BITMAP_ALLOC (NULL); | |
7158 | int i; | |
7159 | ||
7160 | gcc_assert (entry != NULL); | |
7161 | gcc_assert (entry != exit); | |
7162 | gcc_assert (bbs_p != NULL); | |
7163 | ||
7164 | gcc_assert (bbs_p->length () > 0); | |
7165 | ||
7166 | FOR_EACH_VEC_ELT (*bbs_p, i, bb) | |
7167 | bitmap_set_bit (bbs, bb->index); | |
7168 | ||
7169 | gcc_assert (bitmap_bit_p (bbs, entry->index)); | |
7170 | gcc_assert (exit == NULL || bitmap_bit_p (bbs, exit->index)); | |
7171 | ||
7172 | FOR_EACH_VEC_ELT (*bbs_p, i, bb) | |
7173 | { | |
7174 | if (bb == entry) | |
7175 | { | |
7176 | gcc_assert (single_pred_p (entry)); | |
7177 | gcc_assert (!bitmap_bit_p (bbs, single_pred (entry)->index)); | |
7178 | } | |
7179 | else | |
7180 | for (ei = ei_start (bb->preds); !ei_end_p (ei); ei_next (&ei)) | |
7181 | { | |
7182 | e = ei_edge (ei); | |
7183 | gcc_assert (bitmap_bit_p (bbs, e->src->index)); | |
7184 | } | |
7185 | ||
7186 | if (bb == exit) | |
7187 | { | |
7188 | gcc_assert (single_succ_p (exit)); | |
7189 | gcc_assert (!bitmap_bit_p (bbs, single_succ (exit)->index)); | |
7190 | } | |
7191 | else | |
7192 | for (ei = ei_start (bb->succs); !ei_end_p (ei); ei_next (&ei)) | |
7193 | { | |
7194 | e = ei_edge (ei); | |
7195 | gcc_assert (bitmap_bit_p (bbs, e->dest->index)); | |
7196 | } | |
7197 | } | |
7198 | ||
7199 | BITMAP_FREE (bbs); | |
7200 | } | |
7201 | ||
2eddac76 TV |
7202 | /* If FROM is an SSA_NAME, mark the version in bitmap DATA. */ |
7203 | ||
7204 | bool | |
7205 | gather_ssa_name_hash_map_from (tree const &from, tree const &, void *data) | |
7206 | { | |
7207 | bitmap release_names = (bitmap)data; | |
7208 | ||
7209 | if (TREE_CODE (from) != SSA_NAME) | |
7210 | return true; | |
7211 | ||
7212 | bitmap_set_bit (release_names, SSA_NAME_VERSION (from)); | |
7213 | return true; | |
7214 | } | |
1a2a3360 | 7215 | |
50674e96 DN |
7216 | /* Move a single-entry, single-exit region delimited by ENTRY_BB and |
7217 | EXIT_BB to function DEST_CFUN. The whole region is replaced by a | |
7218 | single basic block in the original CFG and the new basic block is | |
7219 | returned. DEST_CFUN must not have a CFG yet. | |
7220 | ||
7221 | Note that the region need not be a pure SESE region. Blocks inside | |
7222 | the region may contain calls to abort/exit. The only restriction | |
7223 | is that ENTRY_BB should be the only entry point and it must | |
7224 | dominate EXIT_BB. | |
7225 | ||
b357f682 JJ |
7226 | Change TREE_BLOCK of all statements in ORIG_BLOCK to the new |
7227 | functions outermost BLOCK, move all subblocks of ORIG_BLOCK | |
7228 | to the new function. | |
7229 | ||
50674e96 DN |
7230 | All local variables referenced in the region are assumed to be in |
7231 | the corresponding BLOCK_VARS and unexpanded variable lists | |
8b70d6d6 TV |
7232 | associated with DEST_CFUN. |
7233 | ||
7234 | TODO: investigate whether we can reuse gimple_duplicate_sese_region to | |
7235 | reimplement move_sese_region_to_fn by duplicating the region rather than | |
7236 | moving it. */ | |
50674e96 DN |
7237 | |
7238 | basic_block | |
7239 | move_sese_region_to_fn (struct function *dest_cfun, basic_block entry_bb, | |
b357f682 | 7240 | basic_block exit_bb, tree orig_block) |
50674e96 | 7241 | { |
9771b263 | 7242 | vec<basic_block> bbs, dom_bbs; |
917948d3 ZD |
7243 | basic_block dom_entry = get_immediate_dominator (CDI_DOMINATORS, entry_bb); |
7244 | basic_block after, bb, *entry_pred, *exit_succ, abb; | |
7245 | struct function *saved_cfun = cfun; | |
1d65f45c | 7246 | int *entry_flag, *exit_flag; |
917948d3 | 7247 | unsigned *entry_prob, *exit_prob; |
09dc585e | 7248 | unsigned i, num_entry_edges, num_exit_edges, num_nodes; |
50674e96 DN |
7249 | edge e; |
7250 | edge_iterator ei; | |
fad41cd7 | 7251 | htab_t new_label_map; |
b787e7a2 | 7252 | hash_map<void *, void *> *eh_map; |
5f40b3cb | 7253 | struct loop *loop = entry_bb->loop_father; |
09dc585e | 7254 | struct loop *loop0 = get_loop (saved_cfun, 0); |
b357f682 | 7255 | struct move_stmt_d d; |
50674e96 DN |
7256 | |
7257 | /* If ENTRY does not strictly dominate EXIT, this cannot be an SESE | |
7258 | region. */ | |
7259 | gcc_assert (entry_bb != exit_bb | |
2aee3e57 JJ |
7260 | && (!exit_bb |
7261 | || dominated_by_p (CDI_DOMINATORS, exit_bb, entry_bb))); | |
50674e96 | 7262 | |
917948d3 ZD |
7263 | /* Collect all the blocks in the region. Manually add ENTRY_BB |
7264 | because it won't be added by dfs_enumerate_from. */ | |
9771b263 DN |
7265 | bbs.create (0); |
7266 | bbs.safe_push (entry_bb); | |
50674e96 | 7267 | gather_blocks_in_sese_region (entry_bb, exit_bb, &bbs); |
b2b29377 MM |
7268 | |
7269 | if (flag_checking) | |
7270 | verify_sese (entry_bb, exit_bb, &bbs); | |
50674e96 | 7271 | |
917948d3 ZD |
7272 | /* The blocks that used to be dominated by something in BBS will now be |
7273 | dominated by the new block. */ | |
7274 | dom_bbs = get_dominated_by_region (CDI_DOMINATORS, | |
9771b263 DN |
7275 | bbs.address (), |
7276 | bbs.length ()); | |
917948d3 | 7277 | |
50674e96 DN |
7278 | /* Detach ENTRY_BB and EXIT_BB from CFUN->CFG. We need to remember |
7279 | the predecessor edges to ENTRY_BB and the successor edges to | |
7280 | EXIT_BB so that we can re-attach them to the new basic block that | |
7281 | will replace the region. */ | |
7282 | num_entry_edges = EDGE_COUNT (entry_bb->preds); | |
c302207e SB |
7283 | entry_pred = XNEWVEC (basic_block, num_entry_edges); |
7284 | entry_flag = XNEWVEC (int, num_entry_edges); | |
917948d3 | 7285 | entry_prob = XNEWVEC (unsigned, num_entry_edges); |
50674e96 DN |
7286 | i = 0; |
7287 | for (ei = ei_start (entry_bb->preds); (e = ei_safe_edge (ei)) != NULL;) | |
7288 | { | |
917948d3 | 7289 | entry_prob[i] = e->probability; |
50674e96 DN |
7290 | entry_flag[i] = e->flags; |
7291 | entry_pred[i++] = e->src; | |
7292 | remove_edge (e); | |
7293 | } | |
7294 | ||
2aee3e57 | 7295 | if (exit_bb) |
50674e96 | 7296 | { |
2aee3e57 | 7297 | num_exit_edges = EDGE_COUNT (exit_bb->succs); |
c302207e SB |
7298 | exit_succ = XNEWVEC (basic_block, num_exit_edges); |
7299 | exit_flag = XNEWVEC (int, num_exit_edges); | |
917948d3 | 7300 | exit_prob = XNEWVEC (unsigned, num_exit_edges); |
2aee3e57 JJ |
7301 | i = 0; |
7302 | for (ei = ei_start (exit_bb->succs); (e = ei_safe_edge (ei)) != NULL;) | |
7303 | { | |
917948d3 | 7304 | exit_prob[i] = e->probability; |
2aee3e57 JJ |
7305 | exit_flag[i] = e->flags; |
7306 | exit_succ[i++] = e->dest; | |
7307 | remove_edge (e); | |
7308 | } | |
7309 | } | |
7310 | else | |
7311 | { | |
7312 | num_exit_edges = 0; | |
7313 | exit_succ = NULL; | |
7314 | exit_flag = NULL; | |
917948d3 | 7315 | exit_prob = NULL; |
50674e96 DN |
7316 | } |
7317 | ||
7318 | /* Switch context to the child function to initialize DEST_FN's CFG. */ | |
7319 | gcc_assert (dest_cfun->cfg == NULL); | |
917948d3 | 7320 | push_cfun (dest_cfun); |
fad41cd7 | 7321 | |
50674e96 | 7322 | init_empty_tree_cfg (); |
fad41cd7 RH |
7323 | |
7324 | /* Initialize EH information for the new function. */ | |
1d65f45c | 7325 | eh_map = NULL; |
fad41cd7 RH |
7326 | new_label_map = NULL; |
7327 | if (saved_cfun->eh) | |
7328 | { | |
1d65f45c | 7329 | eh_region region = NULL; |
fad41cd7 | 7330 | |
9771b263 | 7331 | FOR_EACH_VEC_ELT (bbs, i, bb) |
fad41cd7 RH |
7332 | region = find_outermost_region_in_block (saved_cfun, bb, region); |
7333 | ||
7334 | init_eh_for_function (); | |
1d65f45c | 7335 | if (region != NULL) |
fad41cd7 RH |
7336 | { |
7337 | new_label_map = htab_create (17, tree_map_hash, tree_map_eq, free); | |
1d65f45c RH |
7338 | eh_map = duplicate_eh_regions (saved_cfun, region, 0, |
7339 | new_label_mapper, new_label_map); | |
fad41cd7 RH |
7340 | } |
7341 | } | |
7342 | ||
d7ed20db | 7343 | /* Initialize an empty loop tree. */ |
766090c2 | 7344 | struct loops *loops = ggc_cleared_alloc<struct loops> (); |
0fc822d0 RB |
7345 | init_loops_structure (dest_cfun, loops, 1); |
7346 | loops->state = LOOPS_MAY_HAVE_MULTIPLE_LATCHES; | |
7347 | set_loops_for_fn (dest_cfun, loops); | |
d7ed20db RB |
7348 | |
7349 | /* Move the outlined loop tree part. */ | |
09dc585e | 7350 | num_nodes = bbs.length (); |
d7ed20db RB |
7351 | FOR_EACH_VEC_ELT (bbs, i, bb) |
7352 | { | |
09dc585e | 7353 | if (bb->loop_father->header == bb) |
d7ed20db | 7354 | { |
f3b331d1 | 7355 | struct loop *this_loop = bb->loop_father; |
09dc585e JJ |
7356 | struct loop *outer = loop_outer (this_loop); |
7357 | if (outer == loop | |
7358 | /* If the SESE region contains some bbs ending with | |
7359 | a noreturn call, those are considered to belong | |
7360 | to the outermost loop in saved_cfun, rather than | |
7361 | the entry_bb's loop_father. */ | |
7362 | || outer == loop0) | |
7363 | { | |
7364 | if (outer != loop) | |
7365 | num_nodes -= this_loop->num_nodes; | |
7366 | flow_loop_tree_node_remove (bb->loop_father); | |
7367 | flow_loop_tree_node_add (get_loop (dest_cfun, 0), this_loop); | |
7368 | fixup_loop_arrays_after_move (saved_cfun, cfun, this_loop); | |
7369 | } | |
d7ed20db | 7370 | } |
09dc585e JJ |
7371 | else if (bb->loop_father == loop0 && loop0 != loop) |
7372 | num_nodes--; | |
d7ed20db RB |
7373 | |
7374 | /* Remove loop exits from the outlined region. */ | |
0fc822d0 | 7375 | if (loops_for_fn (saved_cfun)->exits) |
d7ed20db RB |
7376 | FOR_EACH_EDGE (e, ei, bb->succs) |
7377 | { | |
2a22f99c TS |
7378 | struct loops *l = loops_for_fn (saved_cfun); |
7379 | loop_exit **slot | |
7380 | = l->exits->find_slot_with_hash (e, htab_hash_pointer (e), | |
7381 | NO_INSERT); | |
d7ed20db | 7382 | if (slot) |
2a22f99c | 7383 | l->exits->clear_slot (slot); |
d7ed20db RB |
7384 | } |
7385 | } | |
7386 | ||
7387 | ||
7388 | /* Adjust the number of blocks in the tree root of the outlined part. */ | |
0fc822d0 | 7389 | get_loop (dest_cfun, 0)->num_nodes = bbs.length () + 2; |
d7ed20db RB |
7390 | |
7391 | /* Setup a mapping to be used by move_block_to_fn. */ | |
7392 | loop->aux = current_loops->tree_root; | |
09dc585e | 7393 | loop0->aux = current_loops->tree_root; |
d7ed20db | 7394 | |
917948d3 ZD |
7395 | pop_cfun (); |
7396 | ||
50674e96 | 7397 | /* Move blocks from BBS into DEST_CFUN. */ |
9771b263 | 7398 | gcc_assert (bbs.length () >= 2); |
50674e96 | 7399 | after = dest_cfun->cfg->x_entry_block_ptr; |
b787e7a2 | 7400 | hash_map<tree, tree> vars_map; |
b357f682 JJ |
7401 | |
7402 | memset (&d, 0, sizeof (d)); | |
1d65f45c RH |
7403 | d.orig_block = orig_block; |
7404 | d.new_block = DECL_INITIAL (dest_cfun->decl); | |
b357f682 JJ |
7405 | d.from_context = cfun->decl; |
7406 | d.to_context = dest_cfun->decl; | |
b787e7a2 | 7407 | d.vars_map = &vars_map; |
b357f682 | 7408 | d.new_label_map = new_label_map; |
1d65f45c | 7409 | d.eh_map = eh_map; |
b357f682 | 7410 | d.remap_decls_p = true; |
b357f682 | 7411 | |
2eddac76 TV |
7412 | if (gimple_in_ssa_p (cfun)) |
7413 | for (tree arg = DECL_ARGUMENTS (d.to_context); arg; arg = DECL_CHAIN (arg)) | |
7414 | { | |
7415 | tree narg = make_ssa_name_fn (dest_cfun, arg, gimple_build_nop ()); | |
7416 | set_ssa_default_def (dest_cfun, arg, narg); | |
7417 | vars_map.put (arg, narg); | |
7418 | } | |
7419 | ||
9771b263 | 7420 | FOR_EACH_VEC_ELT (bbs, i, bb) |
50674e96 DN |
7421 | { |
7422 | /* No need to update edge counts on the last block. It has | |
7423 | already been updated earlier when we detached the region from | |
7424 | the original CFG. */ | |
1d65f45c | 7425 | move_block_to_fn (dest_cfun, bb, after, bb != exit_bb, &d); |
50674e96 DN |
7426 | after = bb; |
7427 | } | |
7428 | ||
d7ed20db | 7429 | loop->aux = NULL; |
09dc585e | 7430 | loop0->aux = NULL; |
d7ed20db | 7431 | /* Loop sizes are no longer correct, fix them up. */ |
09dc585e | 7432 | loop->num_nodes -= num_nodes; |
d7ed20db RB |
7433 | for (struct loop *outer = loop_outer (loop); |
7434 | outer; outer = loop_outer (outer)) | |
09dc585e JJ |
7435 | outer->num_nodes -= num_nodes; |
7436 | loop0->num_nodes -= bbs.length () - num_nodes; | |
d7ed20db | 7437 | |
b15b5979 | 7438 | if (saved_cfun->has_simduid_loops || saved_cfun->has_force_vectorize_loops) |
f3b331d1 JJ |
7439 | { |
7440 | struct loop *aloop; | |
7441 | for (i = 0; vec_safe_iterate (loops->larray, i, &aloop); i++) | |
7442 | if (aloop != NULL) | |
7443 | { | |
7444 | if (aloop->simduid) | |
7445 | { | |
7446 | replace_by_duplicate_decl (&aloop->simduid, d.vars_map, | |
7447 | d.to_context); | |
7448 | dest_cfun->has_simduid_loops = true; | |
7449 | } | |
b15b5979 EB |
7450 | if (aloop->force_vectorize) |
7451 | dest_cfun->has_force_vectorize_loops = true; | |
f3b331d1 JJ |
7452 | } |
7453 | } | |
7454 | ||
b357f682 JJ |
7455 | /* Rewire BLOCK_SUBBLOCKS of orig_block. */ |
7456 | if (orig_block) | |
7457 | { | |
7458 | tree block; | |
7459 | gcc_assert (BLOCK_SUBBLOCKS (DECL_INITIAL (dest_cfun->decl)) | |
7460 | == NULL_TREE); | |
7461 | BLOCK_SUBBLOCKS (DECL_INITIAL (dest_cfun->decl)) | |
7462 | = BLOCK_SUBBLOCKS (orig_block); | |
7463 | for (block = BLOCK_SUBBLOCKS (orig_block); | |
7464 | block; block = BLOCK_CHAIN (block)) | |
7465 | BLOCK_SUPERCONTEXT (block) = DECL_INITIAL (dest_cfun->decl); | |
7466 | BLOCK_SUBBLOCKS (orig_block) = NULL_TREE; | |
7467 | } | |
7468 | ||
7469 | replace_block_vars_by_duplicates (DECL_INITIAL (dest_cfun->decl), | |
b787e7a2 | 7470 | &vars_map, dest_cfun->decl); |
b357f682 | 7471 | |
fad41cd7 RH |
7472 | if (new_label_map) |
7473 | htab_delete (new_label_map); | |
1d65f45c | 7474 | if (eh_map) |
b787e7a2 | 7475 | delete eh_map; |
50674e96 | 7476 | |
2eddac76 TV |
7477 | if (gimple_in_ssa_p (cfun)) |
7478 | { | |
7479 | /* We need to release ssa-names in a defined order, so first find them, | |
7480 | and then iterate in ascending version order. */ | |
7481 | bitmap release_names = BITMAP_ALLOC (NULL); | |
7482 | vars_map.traverse<void *, gather_ssa_name_hash_map_from> (release_names); | |
7483 | bitmap_iterator bi; | |
7484 | unsigned i; | |
7485 | EXECUTE_IF_SET_IN_BITMAP (release_names, 0, i, bi) | |
7486 | release_ssa_name (ssa_name (i)); | |
7487 | BITMAP_FREE (release_names); | |
7488 | } | |
7489 | ||
50674e96 DN |
7490 | /* Rewire the entry and exit blocks. The successor to the entry |
7491 | block turns into the successor of DEST_FN's ENTRY_BLOCK_PTR in | |
7492 | the child function. Similarly, the predecessor of DEST_FN's | |
7493 | EXIT_BLOCK_PTR turns into the predecessor of EXIT_BLOCK_PTR. We | |
7494 | need to switch CFUN between DEST_CFUN and SAVED_CFUN so that the | |
7495 | various CFG manipulation function get to the right CFG. | |
7496 | ||
7497 | FIXME, this is silly. The CFG ought to become a parameter to | |
7498 | these helpers. */ | |
917948d3 | 7499 | push_cfun (dest_cfun); |
fefa31b5 | 7500 | make_edge (ENTRY_BLOCK_PTR_FOR_FN (cfun), entry_bb, EDGE_FALLTHRU); |
2aee3e57 | 7501 | if (exit_bb) |
fefa31b5 | 7502 | make_edge (exit_bb, EXIT_BLOCK_PTR_FOR_FN (cfun), 0); |
917948d3 | 7503 | pop_cfun (); |
50674e96 DN |
7504 | |
7505 | /* Back in the original function, the SESE region has disappeared, | |
7506 | create a new basic block in its place. */ | |
7507 | bb = create_empty_bb (entry_pred[0]); | |
5f40b3cb ZD |
7508 | if (current_loops) |
7509 | add_bb_to_loop (bb, loop); | |
50674e96 | 7510 | for (i = 0; i < num_entry_edges; i++) |
917948d3 ZD |
7511 | { |
7512 | e = make_edge (entry_pred[i], bb, entry_flag[i]); | |
7513 | e->probability = entry_prob[i]; | |
7514 | } | |
50674e96 DN |
7515 | |
7516 | for (i = 0; i < num_exit_edges; i++) | |
917948d3 ZD |
7517 | { |
7518 | e = make_edge (bb, exit_succ[i], exit_flag[i]); | |
7519 | e->probability = exit_prob[i]; | |
7520 | } | |
7521 | ||
7522 | set_immediate_dominator (CDI_DOMINATORS, bb, dom_entry); | |
9771b263 | 7523 | FOR_EACH_VEC_ELT (dom_bbs, i, abb) |
917948d3 | 7524 | set_immediate_dominator (CDI_DOMINATORS, abb, bb); |
9771b263 | 7525 | dom_bbs.release (); |
50674e96 | 7526 | |
2aee3e57 JJ |
7527 | if (exit_bb) |
7528 | { | |
917948d3 | 7529 | free (exit_prob); |
2aee3e57 JJ |
7530 | free (exit_flag); |
7531 | free (exit_succ); | |
7532 | } | |
917948d3 | 7533 | free (entry_prob); |
50674e96 DN |
7534 | free (entry_flag); |
7535 | free (entry_pred); | |
9771b263 | 7536 | bbs.release (); |
50674e96 DN |
7537 | |
7538 | return bb; | |
7539 | } | |
7540 | ||
0482b001 TV |
7541 | /* Dump default def DEF to file FILE using FLAGS and indentation |
7542 | SPC. */ | |
7543 | ||
7544 | static void | |
1a817418 | 7545 | dump_default_def (FILE *file, tree def, int spc, dump_flags_t flags) |
0482b001 TV |
7546 | { |
7547 | for (int i = 0; i < spc; ++i) | |
7548 | fprintf (file, " "); | |
7549 | dump_ssaname_info_to_file (file, def, spc); | |
7550 | ||
7551 | print_generic_expr (file, TREE_TYPE (def), flags); | |
7552 | fprintf (file, " "); | |
7553 | print_generic_expr (file, def, flags); | |
7554 | fprintf (file, " = "); | |
7555 | print_generic_expr (file, SSA_NAME_VAR (def), flags); | |
7556 | fprintf (file, ";\n"); | |
7557 | } | |
84d65814 | 7558 | |
45b2222a ML |
7559 | /* Print no_sanitize attribute to FILE for a given attribute VALUE. */ |
7560 | ||
7561 | static void | |
7562 | print_no_sanitize_attr_value (FILE *file, tree value) | |
7563 | { | |
7564 | unsigned int flags = tree_to_uhwi (value); | |
7565 | bool first = true; | |
7566 | for (int i = 0; sanitizer_opts[i].name != NULL; ++i) | |
7567 | { | |
7568 | if ((sanitizer_opts[i].flag & flags) == sanitizer_opts[i].flag) | |
7569 | { | |
7570 | if (!first) | |
7571 | fprintf (file, " | "); | |
7572 | fprintf (file, "%s", sanitizer_opts[i].name); | |
7573 | first = false; | |
7574 | } | |
7575 | } | |
7576 | } | |
7577 | ||
398b1daa | 7578 | /* Dump FUNCTION_DECL FN to file FILE using FLAGS (see TDF_* in dumpfile.h) |
726a989a | 7579 | */ |
6de9cd9a DN |
7580 | |
7581 | void | |
1a817418 | 7582 | dump_function_to_file (tree fndecl, FILE *file, dump_flags_t flags) |
6de9cd9a | 7583 | { |
2eb712b4 | 7584 | tree arg, var, old_current_fndecl = current_function_decl; |
459ffad3 | 7585 | struct function *dsf; |
6de9cd9a DN |
7586 | bool ignore_topmost_bind = false, any_var = false; |
7587 | basic_block bb; | |
7588 | tree chain; | |
2eb712b4 MJ |
7589 | bool tmclone = (TREE_CODE (fndecl) == FUNCTION_DECL |
7590 | && decl_is_tm_clone (fndecl)); | |
7591 | struct function *fun = DECL_STRUCT_FUNCTION (fndecl); | |
6531d1be | 7592 | |
26e5d47d TV |
7593 | if (DECL_ATTRIBUTES (fndecl) != NULL_TREE) |
7594 | { | |
7595 | fprintf (file, "__attribute__(("); | |
7596 | ||
7597 | bool first = true; | |
7598 | tree chain; | |
7599 | for (chain = DECL_ATTRIBUTES (fndecl); chain; | |
7600 | first = false, chain = TREE_CHAIN (chain)) | |
7601 | { | |
7602 | if (!first) | |
7603 | fprintf (file, ", "); | |
7604 | ||
45b2222a ML |
7605 | tree name = get_attribute_name (chain); |
7606 | print_generic_expr (file, name, dump_flags); | |
26e5d47d TV |
7607 | if (TREE_VALUE (chain) != NULL_TREE) |
7608 | { | |
7609 | fprintf (file, " ("); | |
45b2222a ML |
7610 | |
7611 | if (strstr (IDENTIFIER_POINTER (name), "no_sanitize")) | |
7612 | print_no_sanitize_attr_value (file, TREE_VALUE (chain)); | |
7613 | else | |
7614 | print_generic_expr (file, TREE_VALUE (chain), dump_flags); | |
26e5d47d TV |
7615 | fprintf (file, ")"); |
7616 | } | |
7617 | } | |
7618 | ||
7619 | fprintf (file, "))\n"); | |
7620 | } | |
7621 | ||
2eb712b4 | 7622 | current_function_decl = fndecl; |
1ee62b92 PG |
7623 | if (flags & TDF_GIMPLE) |
7624 | { | |
7625 | print_generic_expr (file, TREE_TYPE (TREE_TYPE (fndecl)), | |
7626 | dump_flags | TDF_SLIM); | |
7627 | fprintf (file, " __GIMPLE ()\n%s (", function_name (fun)); | |
7628 | } | |
7629 | else | |
7630 | fprintf (file, "%s %s(", function_name (fun), tmclone ? "[tm-clone] " : ""); | |
6de9cd9a | 7631 | |
2eb712b4 | 7632 | arg = DECL_ARGUMENTS (fndecl); |
6de9cd9a DN |
7633 | while (arg) |
7634 | { | |
2f9ea521 RG |
7635 | print_generic_expr (file, TREE_TYPE (arg), dump_flags); |
7636 | fprintf (file, " "); | |
6de9cd9a | 7637 | print_generic_expr (file, arg, dump_flags); |
910ad8de | 7638 | if (DECL_CHAIN (arg)) |
6de9cd9a | 7639 | fprintf (file, ", "); |
910ad8de | 7640 | arg = DECL_CHAIN (arg); |
6de9cd9a DN |
7641 | } |
7642 | fprintf (file, ")\n"); | |
7643 | ||
2eb712b4 | 7644 | dsf = DECL_STRUCT_FUNCTION (fndecl); |
feb4e5ba | 7645 | if (dsf && (flags & TDF_EH)) |
459ffad3 EB |
7646 | dump_eh_tree (file, dsf); |
7647 | ||
2eb712b4 | 7648 | if (flags & TDF_RAW && !gimple_has_body_p (fndecl)) |
6de9cd9a | 7649 | { |
2eb712b4 MJ |
7650 | dump_node (fndecl, TDF_SLIM | flags, file); |
7651 | current_function_decl = old_current_fndecl; | |
6de9cd9a DN |
7652 | return; |
7653 | } | |
7654 | ||
7655 | /* When GIMPLE is lowered, the variables are no longer available in | |
7656 | BIND_EXPRs, so display them separately. */ | |
2eb712b4 | 7657 | if (fun && fun->decl == fndecl && (fun->curr_properties & PROP_gimple_lcf)) |
6de9cd9a | 7658 | { |
c021f10b | 7659 | unsigned ix; |
6de9cd9a DN |
7660 | ignore_topmost_bind = true; |
7661 | ||
7662 | fprintf (file, "{\n"); | |
0482b001 TV |
7663 | if (gimple_in_ssa_p (fun) |
7664 | && (flags & TDF_ALIAS)) | |
7665 | { | |
7666 | for (arg = DECL_ARGUMENTS (fndecl); arg != NULL; | |
7667 | arg = DECL_CHAIN (arg)) | |
7668 | { | |
7669 | tree def = ssa_default_def (fun, arg); | |
7670 | if (def) | |
7671 | dump_default_def (file, def, 2, flags); | |
7672 | } | |
7673 | ||
7674 | tree res = DECL_RESULT (fun->decl); | |
7675 | if (res != NULL_TREE | |
7676 | && DECL_BY_REFERENCE (res)) | |
7677 | { | |
7678 | tree def = ssa_default_def (fun, res); | |
7679 | if (def) | |
7680 | dump_default_def (file, def, 2, flags); | |
7681 | } | |
7682 | ||
7683 | tree static_chain = fun->static_chain_decl; | |
7684 | if (static_chain != NULL_TREE) | |
7685 | { | |
7686 | tree def = ssa_default_def (fun, static_chain); | |
7687 | if (def) | |
7688 | dump_default_def (file, def, 2, flags); | |
7689 | } | |
7690 | } | |
7691 | ||
9771b263 | 7692 | if (!vec_safe_is_empty (fun->local_decls)) |
2eb712b4 | 7693 | FOR_EACH_LOCAL_DECL (fun, ix, var) |
e28b8a60 RG |
7694 | { |
7695 | print_generic_decl (file, var, flags); | |
e28b8a60 | 7696 | fprintf (file, "\n"); |
6de9cd9a | 7697 | |
e28b8a60 RG |
7698 | any_var = true; |
7699 | } | |
46aa019a KV |
7700 | |
7701 | tree name; | |
7702 | ||
70b5e7dc | 7703 | if (gimple_in_ssa_p (cfun)) |
46aa019a | 7704 | FOR_EACH_SSA_NAME (ix, name, cfun) |
70b5e7dc | 7705 | { |
46aa019a | 7706 | if (!SSA_NAME_VAR (name)) |
70b5e7dc RG |
7707 | { |
7708 | fprintf (file, " "); | |
7709 | print_generic_expr (file, TREE_TYPE (name), flags); | |
7710 | fprintf (file, " "); | |
7711 | print_generic_expr (file, name, flags); | |
7712 | fprintf (file, ";\n"); | |
e28b8a60 RG |
7713 | |
7714 | any_var = true; | |
70b5e7dc RG |
7715 | } |
7716 | } | |
6de9cd9a DN |
7717 | } |
7718 | ||
9771b263 DN |
7719 | if (fun && fun->decl == fndecl |
7720 | && fun->cfg | |
bbd79259 | 7721 | && basic_block_info_for_fn (fun)) |
6de9cd9a | 7722 | { |
726a989a | 7723 | /* If the CFG has been built, emit a CFG-based dump. */ |
6de9cd9a DN |
7724 | if (!ignore_topmost_bind) |
7725 | fprintf (file, "{\n"); | |
7726 | ||
0cae8d31 | 7727 | if (any_var && n_basic_blocks_for_fn (fun)) |
6de9cd9a DN |
7728 | fprintf (file, "\n"); |
7729 | ||
2eb712b4 | 7730 | FOR_EACH_BB_FN (bb, fun) |
9d9573d5 | 7731 | dump_bb (file, bb, 2, flags); |
6531d1be | 7732 | |
6de9cd9a DN |
7733 | fprintf (file, "}\n"); |
7734 | } | |
1ee62b92 | 7735 | else if (fun->curr_properties & PROP_gimple_any) |
726a989a RB |
7736 | { |
7737 | /* The function is now in GIMPLE form but the CFG has not been | |
7738 | built yet. Emit the single sequence of GIMPLE statements | |
7739 | that make up its body. */ | |
2eb712b4 | 7740 | gimple_seq body = gimple_body (fndecl); |
726a989a RB |
7741 | |
7742 | if (gimple_seq_first_stmt (body) | |
7743 | && gimple_seq_first_stmt (body) == gimple_seq_last_stmt (body) | |
7744 | && gimple_code (gimple_seq_first_stmt (body)) == GIMPLE_BIND) | |
7745 | print_gimple_seq (file, body, 0, flags); | |
7746 | else | |
7747 | { | |
7748 | if (!ignore_topmost_bind) | |
7749 | fprintf (file, "{\n"); | |
7750 | ||
7751 | if (any_var) | |
7752 | fprintf (file, "\n"); | |
7753 | ||
7754 | print_gimple_seq (file, body, 2, flags); | |
7755 | fprintf (file, "}\n"); | |
7756 | } | |
7757 | } | |
6de9cd9a DN |
7758 | else |
7759 | { | |
7760 | int indent; | |
7761 | ||
7762 | /* Make a tree based dump. */ | |
2eb712b4 | 7763 | chain = DECL_SAVED_TREE (fndecl); |
953ff289 | 7764 | if (chain && TREE_CODE (chain) == BIND_EXPR) |
6de9cd9a DN |
7765 | { |
7766 | if (ignore_topmost_bind) | |
7767 | { | |
7768 | chain = BIND_EXPR_BODY (chain); | |
7769 | indent = 2; | |
7770 | } | |
7771 | else | |
7772 | indent = 0; | |
7773 | } | |
7774 | else | |
7775 | { | |
7776 | if (!ignore_topmost_bind) | |
232f1f97 EB |
7777 | { |
7778 | fprintf (file, "{\n"); | |
7779 | /* No topmost bind, pretend it's ignored for later. */ | |
7780 | ignore_topmost_bind = true; | |
7781 | } | |
6de9cd9a DN |
7782 | indent = 2; |
7783 | } | |
7784 | ||
7785 | if (any_var) | |
7786 | fprintf (file, "\n"); | |
7787 | ||
7788 | print_generic_stmt_indented (file, chain, flags, indent); | |
7789 | if (ignore_topmost_bind) | |
7790 | fprintf (file, "}\n"); | |
7791 | } | |
7792 | ||
c31c32f9 JR |
7793 | if (flags & TDF_ENUMERATE_LOCALS) |
7794 | dump_enumerated_decls (file, flags); | |
6de9cd9a | 7795 | fprintf (file, "\n\n"); |
953ff289 | 7796 | |
2eb712b4 | 7797 | current_function_decl = old_current_fndecl; |
953ff289 DN |
7798 | } |
7799 | ||
953ff289 DN |
7800 | /* Dump FUNCTION_DECL FN to stderr using FLAGS (see TDF_* in tree.h) */ |
7801 | ||
24e47c76 | 7802 | DEBUG_FUNCTION void |
1a817418 | 7803 | debug_function (tree fn, dump_flags_t flags) |
953ff289 DN |
7804 | { |
7805 | dump_function_to_file (fn, stderr, flags); | |
6de9cd9a DN |
7806 | } |
7807 | ||
7808 | ||
d7770457 | 7809 | /* Print on FILE the indexes for the predecessors of basic_block BB. */ |
6de9cd9a DN |
7810 | |
7811 | static void | |
628f6a4e | 7812 | print_pred_bbs (FILE *file, basic_block bb) |
6de9cd9a | 7813 | { |
628f6a4e BE |
7814 | edge e; |
7815 | edge_iterator ei; | |
7816 | ||
7817 | FOR_EACH_EDGE (e, ei, bb->preds) | |
d7770457 | 7818 | fprintf (file, "bb_%d ", e->src->index); |
6de9cd9a DN |
7819 | } |
7820 | ||
7821 | ||
d7770457 | 7822 | /* Print on FILE the indexes for the successors of basic_block BB. */ |
6de9cd9a DN |
7823 | |
7824 | static void | |
628f6a4e | 7825 | print_succ_bbs (FILE *file, basic_block bb) |
6de9cd9a | 7826 | { |
628f6a4e BE |
7827 | edge e; |
7828 | edge_iterator ei; | |
7829 | ||
7830 | FOR_EACH_EDGE (e, ei, bb->succs) | |
d7770457 | 7831 | fprintf (file, "bb_%d ", e->dest->index); |
6de9cd9a DN |
7832 | } |
7833 | ||
0c8efed8 SP |
7834 | /* Print to FILE the basic block BB following the VERBOSITY level. */ |
7835 | ||
b8698a0f | 7836 | void |
0c8efed8 SP |
7837 | print_loops_bb (FILE *file, basic_block bb, int indent, int verbosity) |
7838 | { | |
7839 | char *s_indent = (char *) alloca ((size_t) indent + 1); | |
7840 | memset ((void *) s_indent, ' ', (size_t) indent); | |
7841 | s_indent[indent] = '\0'; | |
7842 | ||
7843 | /* Print basic_block's header. */ | |
7844 | if (verbosity >= 2) | |
7845 | { | |
7846 | fprintf (file, "%s bb_%d (preds = {", s_indent, bb->index); | |
7847 | print_pred_bbs (file, bb); | |
7848 | fprintf (file, "}, succs = {"); | |
7849 | print_succ_bbs (file, bb); | |
7850 | fprintf (file, "})\n"); | |
7851 | } | |
7852 | ||
7853 | /* Print basic_block's body. */ | |
7854 | if (verbosity >= 3) | |
7855 | { | |
7856 | fprintf (file, "%s {\n", s_indent); | |
c4669594 | 7857 | dump_bb (file, bb, indent + 4, TDF_VOPS|TDF_MEMSYMS); |
0c8efed8 SP |
7858 | fprintf (file, "%s }\n", s_indent); |
7859 | } | |
7860 | } | |
7861 | ||
7862 | static void print_loop_and_siblings (FILE *, struct loop *, int, int); | |
6de9cd9a | 7863 | |
0c8efed8 SP |
7864 | /* Pretty print LOOP on FILE, indented INDENT spaces. Following |
7865 | VERBOSITY level this outputs the contents of the loop, or just its | |
7866 | structure. */ | |
6de9cd9a DN |
7867 | |
7868 | static void | |
0c8efed8 | 7869 | print_loop (FILE *file, struct loop *loop, int indent, int verbosity) |
6de9cd9a DN |
7870 | { |
7871 | char *s_indent; | |
7872 | basic_block bb; | |
6531d1be | 7873 | |
6de9cd9a DN |
7874 | if (loop == NULL) |
7875 | return; | |
7876 | ||
7877 | s_indent = (char *) alloca ((size_t) indent + 1); | |
7878 | memset ((void *) s_indent, ' ', (size_t) indent); | |
7879 | s_indent[indent] = '\0'; | |
7880 | ||
0c8efed8 | 7881 | /* Print loop's header. */ |
755a1ca5 RG |
7882 | fprintf (file, "%sloop_%d (", s_indent, loop->num); |
7883 | if (loop->header) | |
7884 | fprintf (file, "header = %d", loop->header->index); | |
7885 | else | |
7886 | { | |
7887 | fprintf (file, "deleted)\n"); | |
7888 | return; | |
7889 | } | |
7890 | if (loop->latch) | |
7891 | fprintf (file, ", latch = %d", loop->latch->index); | |
7892 | else | |
7893 | fprintf (file, ", multiple latches"); | |
0c8efed8 | 7894 | fprintf (file, ", niter = "); |
ef6cb4c7 | 7895 | print_generic_expr (file, loop->nb_iterations); |
6531d1be | 7896 | |
0c8efed8 SP |
7897 | if (loop->any_upper_bound) |
7898 | { | |
7899 | fprintf (file, ", upper_bound = "); | |
807e902e | 7900 | print_decu (loop->nb_iterations_upper_bound, file); |
0c8efed8 | 7901 | } |
53803093 JH |
7902 | if (loop->any_likely_upper_bound) |
7903 | { | |
7904 | fprintf (file, ", likely_upper_bound = "); | |
7905 | print_decu (loop->nb_iterations_likely_upper_bound, file); | |
7906 | } | |
6531d1be | 7907 | |
0c8efed8 SP |
7908 | if (loop->any_estimate) |
7909 | { | |
7910 | fprintf (file, ", estimate = "); | |
807e902e | 7911 | print_decu (loop->nb_iterations_estimate, file); |
0c8efed8 SP |
7912 | } |
7913 | fprintf (file, ")\n"); | |
7914 | ||
7915 | /* Print loop's body. */ | |
7916 | if (verbosity >= 1) | |
7917 | { | |
7918 | fprintf (file, "%s{\n", s_indent); | |
11cd3bed | 7919 | FOR_EACH_BB_FN (bb, cfun) |
0c8efed8 SP |
7920 | if (bb->loop_father == loop) |
7921 | print_loops_bb (file, bb, indent, verbosity); | |
7922 | ||
7923 | print_loop_and_siblings (file, loop->inner, indent + 2, verbosity); | |
7924 | fprintf (file, "%s}\n", s_indent); | |
7925 | } | |
6de9cd9a DN |
7926 | } |
7927 | ||
0c8efed8 SP |
7928 | /* Print the LOOP and its sibling loops on FILE, indented INDENT |
7929 | spaces. Following VERBOSITY level this outputs the contents of the | |
7930 | loop, or just its structure. */ | |
7931 | ||
7932 | static void | |
7b3b6ae4 LC |
7933 | print_loop_and_siblings (FILE *file, struct loop *loop, int indent, |
7934 | int verbosity) | |
0c8efed8 SP |
7935 | { |
7936 | if (loop == NULL) | |
7937 | return; | |
7938 | ||
7939 | print_loop (file, loop, indent, verbosity); | |
7940 | print_loop_and_siblings (file, loop->next, indent, verbosity); | |
7941 | } | |
6de9cd9a DN |
7942 | |
7943 | /* Follow a CFG edge from the entry point of the program, and on entry | |
7944 | of a loop, pretty print the loop structure on FILE. */ | |
7945 | ||
6531d1be | 7946 | void |
0c8efed8 | 7947 | print_loops (FILE *file, int verbosity) |
6de9cd9a DN |
7948 | { |
7949 | basic_block bb; | |
6531d1be | 7950 | |
fefa31b5 | 7951 | bb = ENTRY_BLOCK_PTR_FOR_FN (cfun); |
7009b073 | 7952 | fprintf (file, "\nLoops in function: %s\n", current_function_name ()); |
6de9cd9a | 7953 | if (bb && bb->loop_father) |
0c8efed8 | 7954 | print_loop_and_siblings (file, bb->loop_father, 0, verbosity); |
6de9cd9a DN |
7955 | } |
7956 | ||
7b3b6ae4 LC |
7957 | /* Dump a loop. */ |
7958 | ||
7959 | DEBUG_FUNCTION void | |
7960 | debug (struct loop &ref) | |
7961 | { | |
7962 | print_loop (stderr, &ref, 0, /*verbosity*/0); | |
7963 | } | |
7964 | ||
7965 | DEBUG_FUNCTION void | |
7966 | debug (struct loop *ptr) | |
7967 | { | |
7968 | if (ptr) | |
7969 | debug (*ptr); | |
7970 | else | |
7971 | fprintf (stderr, "<nil>\n"); | |
7972 | } | |
7973 | ||
7974 | /* Dump a loop verbosely. */ | |
7975 | ||
7976 | DEBUG_FUNCTION void | |
7977 | debug_verbose (struct loop &ref) | |
7978 | { | |
7979 | print_loop (stderr, &ref, 0, /*verbosity*/3); | |
7980 | } | |
7981 | ||
7982 | DEBUG_FUNCTION void | |
7983 | debug_verbose (struct loop *ptr) | |
7984 | { | |
7985 | if (ptr) | |
7986 | debug (*ptr); | |
7987 | else | |
7988 | fprintf (stderr, "<nil>\n"); | |
7989 | } | |
7990 | ||
6de9cd9a | 7991 | |
0c8efed8 SP |
7992 | /* Debugging loops structure at tree level, at some VERBOSITY level. */ |
7993 | ||
24e47c76 | 7994 | DEBUG_FUNCTION void |
0c8efed8 SP |
7995 | debug_loops (int verbosity) |
7996 | { | |
7997 | print_loops (stderr, verbosity); | |
7998 | } | |
7999 | ||
8000 | /* Print on stderr the code of LOOP, at some VERBOSITY level. */ | |
6de9cd9a | 8001 | |
24e47c76 | 8002 | DEBUG_FUNCTION void |
0c8efed8 | 8003 | debug_loop (struct loop *loop, int verbosity) |
6de9cd9a | 8004 | { |
0c8efed8 | 8005 | print_loop (stderr, loop, 0, verbosity); |
6de9cd9a DN |
8006 | } |
8007 | ||
0c8efed8 SP |
8008 | /* Print on stderr the code of loop number NUM, at some VERBOSITY |
8009 | level. */ | |
8010 | ||
24e47c76 | 8011 | DEBUG_FUNCTION void |
0c8efed8 SP |
8012 | debug_loop_num (unsigned num, int verbosity) |
8013 | { | |
0fc822d0 | 8014 | debug_loop (get_loop (cfun, num), verbosity); |
0c8efed8 | 8015 | } |
6de9cd9a DN |
8016 | |
8017 | /* Return true if BB ends with a call, possibly followed by some | |
8018 | instructions that must stay with the call. Return false, | |
8019 | otherwise. */ | |
8020 | ||
8021 | static bool | |
726a989a | 8022 | gimple_block_ends_with_call_p (basic_block bb) |
6de9cd9a | 8023 | { |
b5b8b0ac | 8024 | gimple_stmt_iterator gsi = gsi_last_nondebug_bb (bb); |
7dd536f1 | 8025 | return !gsi_end_p (gsi) && is_gimple_call (gsi_stmt (gsi)); |
6de9cd9a DN |
8026 | } |
8027 | ||
8028 | ||
8029 | /* Return true if BB ends with a conditional branch. Return false, | |
8030 | otherwise. */ | |
8031 | ||
8032 | static bool | |
726a989a | 8033 | gimple_block_ends_with_condjump_p (const_basic_block bb) |
6de9cd9a | 8034 | { |
355fe088 | 8035 | gimple *stmt = last_stmt (CONST_CAST_BB (bb)); |
726a989a | 8036 | return (stmt && gimple_code (stmt) == GIMPLE_COND); |
6de9cd9a DN |
8037 | } |
8038 | ||
8039 | ||
21bcd7be JH |
8040 | /* Return true if statement T may terminate execution of BB in ways not |
8041 | explicitly represtented in the CFG. */ | |
6de9cd9a | 8042 | |
21bcd7be JH |
8043 | bool |
8044 | stmt_can_terminate_bb_p (gimple *t) | |
6de9cd9a | 8045 | { |
726a989a RB |
8046 | tree fndecl = NULL_TREE; |
8047 | int call_flags = 0; | |
6de9cd9a | 8048 | |
21bcd7be JH |
8049 | /* Eh exception not handled internally terminates execution of the whole |
8050 | function. */ | |
8051 | if (stmt_can_throw_external (t)) | |
8052 | return true; | |
8053 | ||
6de9cd9a | 8054 | /* NORETURN and LONGJMP calls already have an edge to exit. |
321cf1f2 | 8055 | CONST and PURE calls do not need one. |
6de9cd9a DN |
8056 | We don't currently check for CONST and PURE here, although |
8057 | it would be a good idea, because those attributes are | |
8058 | figured out from the RTL in mark_constant_function, and | |
8059 | the counter incrementation code from -fprofile-arcs | |
8060 | leads to different results from -fbranch-probabilities. */ | |
726a989a | 8061 | if (is_gimple_call (t)) |
23ef6d21 | 8062 | { |
726a989a RB |
8063 | fndecl = gimple_call_fndecl (t); |
8064 | call_flags = gimple_call_flags (t); | |
23ef6d21 BE |
8065 | } |
8066 | ||
726a989a RB |
8067 | if (is_gimple_call (t) |
8068 | && fndecl | |
8069 | && DECL_BUILT_IN (fndecl) | |
23ef6d21 | 8070 | && (call_flags & ECF_NOTHROW) |
3cfa762b RG |
8071 | && !(call_flags & ECF_RETURNS_TWICE) |
8072 | /* fork() doesn't really return twice, but the effect of | |
8073 | wrapping it in __gcov_fork() which calls __gcov_flush() | |
8074 | and clears the counters before forking has the same | |
8075 | effect as returning twice. Force a fake edge. */ | |
8076 | && !(DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_NORMAL | |
8077 | && DECL_FUNCTION_CODE (fndecl) == BUILT_IN_FORK)) | |
8078 | return false; | |
23ef6d21 | 8079 | |
bfeb0869 JJ |
8080 | if (is_gimple_call (t)) |
8081 | { | |
8082 | edge_iterator ei; | |
8083 | edge e; | |
8084 | basic_block bb; | |
8085 | ||
21bcd7be JH |
8086 | if (call_flags & (ECF_PURE | ECF_CONST) |
8087 | && !(call_flags & ECF_LOOPING_CONST_OR_PURE)) | |
8088 | return false; | |
8089 | ||
8090 | /* Function call may do longjmp, terminate program or do other things. | |
8091 | Special case noreturn that have non-abnormal edges out as in this case | |
8092 | the fact is sufficiently represented by lack of edges out of T. */ | |
bfeb0869 JJ |
8093 | if (!(call_flags & ECF_NORETURN)) |
8094 | return true; | |
8095 | ||
8096 | bb = gimple_bb (t); | |
8097 | FOR_EACH_EDGE (e, ei, bb->succs) | |
8098 | if ((e->flags & EDGE_FAKE) == 0) | |
8099 | return true; | |
8100 | } | |
6de9cd9a | 8101 | |
538dd0b7 DM |
8102 | if (gasm *asm_stmt = dyn_cast <gasm *> (t)) |
8103 | if (gimple_asm_volatile_p (asm_stmt) || gimple_asm_input_p (asm_stmt)) | |
8104 | return true; | |
6de9cd9a DN |
8105 | |
8106 | return false; | |
8107 | } | |
8108 | ||
8109 | ||
8110 | /* Add fake edges to the function exit for any non constant and non | |
bfeb0869 JJ |
8111 | noreturn calls (or noreturn calls with EH/abnormal edges), |
8112 | volatile inline assembly in the bitmap of blocks specified by BLOCKS | |
8113 | or to the whole CFG if BLOCKS is zero. Return the number of blocks | |
8114 | that were split. | |
6de9cd9a DN |
8115 | |
8116 | The goal is to expose cases in which entering a basic block does | |
8117 | not imply that all subsequent instructions must be executed. */ | |
8118 | ||
8119 | static int | |
726a989a | 8120 | gimple_flow_call_edges_add (sbitmap blocks) |
6de9cd9a DN |
8121 | { |
8122 | int i; | |
8123 | int blocks_split = 0; | |
8b1c6fd7 | 8124 | int last_bb = last_basic_block_for_fn (cfun); |
6de9cd9a DN |
8125 | bool check_last_block = false; |
8126 | ||
0cae8d31 | 8127 | if (n_basic_blocks_for_fn (cfun) == NUM_FIXED_BLOCKS) |
6de9cd9a DN |
8128 | return 0; |
8129 | ||
8130 | if (! blocks) | |
8131 | check_last_block = true; | |
8132 | else | |
fefa31b5 DM |
8133 | check_last_block = bitmap_bit_p (blocks, |
8134 | EXIT_BLOCK_PTR_FOR_FN (cfun)->prev_bb->index); | |
6de9cd9a DN |
8135 | |
8136 | /* In the last basic block, before epilogue generation, there will be | |
8137 | a fallthru edge to EXIT. Special care is required if the last insn | |
8138 | of the last basic block is a call because make_edge folds duplicate | |
8139 | edges, which would result in the fallthru edge also being marked | |
8140 | fake, which would result in the fallthru edge being removed by | |
8141 | remove_fake_edges, which would result in an invalid CFG. | |
8142 | ||
8143 | Moreover, we can't elide the outgoing fake edge, since the block | |
8144 | profiler needs to take this into account in order to solve the minimal | |
8145 | spanning tree in the case that the call doesn't return. | |
8146 | ||
8147 | Handle this by adding a dummy instruction in a new last basic block. */ | |
8148 | if (check_last_block) | |
8149 | { | |
fefa31b5 | 8150 | basic_block bb = EXIT_BLOCK_PTR_FOR_FN (cfun)->prev_bb; |
f6f2ca8f | 8151 | gimple_stmt_iterator gsi = gsi_last_nondebug_bb (bb); |
355fe088 | 8152 | gimple *t = NULL; |
726a989a RB |
8153 | |
8154 | if (!gsi_end_p (gsi)) | |
8155 | t = gsi_stmt (gsi); | |
6de9cd9a | 8156 | |
21bcd7be | 8157 | if (t && stmt_can_terminate_bb_p (t)) |
6de9cd9a DN |
8158 | { |
8159 | edge e; | |
8160 | ||
fefa31b5 | 8161 | e = find_edge (bb, EXIT_BLOCK_PTR_FOR_FN (cfun)); |
9ff3d2de JL |
8162 | if (e) |
8163 | { | |
726a989a RB |
8164 | gsi_insert_on_edge (e, gimple_build_nop ()); |
8165 | gsi_commit_edge_inserts (); | |
9ff3d2de | 8166 | } |
6de9cd9a DN |
8167 | } |
8168 | } | |
8169 | ||
8170 | /* Now add fake edges to the function exit for any non constant | |
8171 | calls since there is no way that we can determine if they will | |
8172 | return or not... */ | |
8173 | for (i = 0; i < last_bb; i++) | |
8174 | { | |
06e28de2 | 8175 | basic_block bb = BASIC_BLOCK_FOR_FN (cfun, i); |
726a989a | 8176 | gimple_stmt_iterator gsi; |
355fe088 | 8177 | gimple *stmt, *last_stmt; |
6de9cd9a DN |
8178 | |
8179 | if (!bb) | |
8180 | continue; | |
8181 | ||
d7c028c0 | 8182 | if (blocks && !bitmap_bit_p (blocks, i)) |
6de9cd9a DN |
8183 | continue; |
8184 | ||
f6f2ca8f | 8185 | gsi = gsi_last_nondebug_bb (bb); |
726a989a | 8186 | if (!gsi_end_p (gsi)) |
6de9cd9a | 8187 | { |
726a989a | 8188 | last_stmt = gsi_stmt (gsi); |
6de9cd9a DN |
8189 | do |
8190 | { | |
726a989a | 8191 | stmt = gsi_stmt (gsi); |
21bcd7be | 8192 | if (stmt_can_terminate_bb_p (stmt)) |
6de9cd9a DN |
8193 | { |
8194 | edge e; | |
726a989a | 8195 | |
6de9cd9a DN |
8196 | /* The handling above of the final block before the |
8197 | epilogue should be enough to verify that there is | |
8198 | no edge to the exit block in CFG already. | |
8199 | Calling make_edge in such case would cause us to | |
8200 | mark that edge as fake and remove it later. */ | |
b2b29377 | 8201 | if (flag_checking && stmt == last_stmt) |
628f6a4e | 8202 | { |
fefa31b5 | 8203 | e = find_edge (bb, EXIT_BLOCK_PTR_FOR_FN (cfun)); |
9ff3d2de | 8204 | gcc_assert (e == NULL); |
628f6a4e | 8205 | } |
6de9cd9a DN |
8206 | |
8207 | /* Note that the following may create a new basic block | |
8208 | and renumber the existing basic blocks. */ | |
8209 | if (stmt != last_stmt) | |
8210 | { | |
8211 | e = split_block (bb, stmt); | |
8212 | if (e) | |
8213 | blocks_split++; | |
8214 | } | |
fefa31b5 | 8215 | make_edge (bb, EXIT_BLOCK_PTR_FOR_FN (cfun), EDGE_FAKE); |
6de9cd9a | 8216 | } |
726a989a | 8217 | gsi_prev (&gsi); |
6de9cd9a | 8218 | } |
726a989a | 8219 | while (!gsi_end_p (gsi)); |
6de9cd9a DN |
8220 | } |
8221 | } | |
8222 | ||
8223 | if (blocks_split) | |
8224 | verify_flow_info (); | |
8225 | ||
8226 | return blocks_split; | |
8227 | } | |
8228 | ||
672987e8 ZD |
8229 | /* Removes edge E and all the blocks dominated by it, and updates dominance |
8230 | information. The IL in E->src needs to be updated separately. | |
8231 | If dominance info is not available, only the edge E is removed.*/ | |
8232 | ||
8233 | void | |
8234 | remove_edge_and_dominated_blocks (edge e) | |
8235 | { | |
6e1aa848 DN |
8236 | vec<basic_block> bbs_to_remove = vNULL; |
8237 | vec<basic_block> bbs_to_fix_dom = vNULL; | |
672987e8 ZD |
8238 | edge f; |
8239 | edge_iterator ei; | |
8240 | bool none_removed = false; | |
8241 | unsigned i; | |
8242 | basic_block bb, dbb; | |
8243 | bitmap_iterator bi; | |
8244 | ||
bdb37448 RB |
8245 | /* If we are removing a path inside a non-root loop that may change |
8246 | loop ownership of blocks or remove loops. Mark loops for fixup. */ | |
8247 | if (current_loops | |
8248 | && loop_outer (e->src->loop_father) != NULL | |
8249 | && e->src->loop_father == e->dest->loop_father) | |
8250 | loops_state_set (LOOPS_NEED_FIXUP); | |
8251 | ||
2b28c07a | 8252 | if (!dom_info_available_p (CDI_DOMINATORS)) |
672987e8 ZD |
8253 | { |
8254 | remove_edge (e); | |
8255 | return; | |
8256 | } | |
8257 | ||
8258 | /* No updating is needed for edges to exit. */ | |
fefa31b5 | 8259 | if (e->dest == EXIT_BLOCK_PTR_FOR_FN (cfun)) |
672987e8 ZD |
8260 | { |
8261 | if (cfgcleanup_altered_bbs) | |
8262 | bitmap_set_bit (cfgcleanup_altered_bbs, e->src->index); | |
8263 | remove_edge (e); | |
8264 | return; | |
8265 | } | |
8266 | ||
8267 | /* First, we find the basic blocks to remove. If E->dest has a predecessor | |
8268 | that is not dominated by E->dest, then this set is empty. Otherwise, | |
8269 | all the basic blocks dominated by E->dest are removed. | |
8270 | ||
8271 | Also, to DF_IDOM we store the immediate dominators of the blocks in | |
8272 | the dominance frontier of E (i.e., of the successors of the | |
8273 | removed blocks, if there are any, and of E->dest otherwise). */ | |
8274 | FOR_EACH_EDGE (f, ei, e->dest->preds) | |
8275 | { | |
8276 | if (f == e) | |
8277 | continue; | |
8278 | ||
8279 | if (!dominated_by_p (CDI_DOMINATORS, f->src, e->dest)) | |
8280 | { | |
8281 | none_removed = true; | |
8282 | break; | |
8283 | } | |
8284 | } | |
8285 | ||
0e3de1d4 | 8286 | auto_bitmap df, df_idom; |
672987e8 ZD |
8287 | if (none_removed) |
8288 | bitmap_set_bit (df_idom, | |
8289 | get_immediate_dominator (CDI_DOMINATORS, e->dest)->index); | |
8290 | else | |
8291 | { | |
438c239d | 8292 | bbs_to_remove = get_all_dominated_blocks (CDI_DOMINATORS, e->dest); |
9771b263 | 8293 | FOR_EACH_VEC_ELT (bbs_to_remove, i, bb) |
672987e8 ZD |
8294 | { |
8295 | FOR_EACH_EDGE (f, ei, bb->succs) | |
8296 | { | |
fefa31b5 | 8297 | if (f->dest != EXIT_BLOCK_PTR_FOR_FN (cfun)) |
672987e8 ZD |
8298 | bitmap_set_bit (df, f->dest->index); |
8299 | } | |
8300 | } | |
9771b263 | 8301 | FOR_EACH_VEC_ELT (bbs_to_remove, i, bb) |
672987e8 ZD |
8302 | bitmap_clear_bit (df, bb->index); |
8303 | ||
8304 | EXECUTE_IF_SET_IN_BITMAP (df, 0, i, bi) | |
8305 | { | |
06e28de2 | 8306 | bb = BASIC_BLOCK_FOR_FN (cfun, i); |
672987e8 ZD |
8307 | bitmap_set_bit (df_idom, |
8308 | get_immediate_dominator (CDI_DOMINATORS, bb)->index); | |
8309 | } | |
8310 | } | |
8311 | ||
8312 | if (cfgcleanup_altered_bbs) | |
8313 | { | |
8314 | /* Record the set of the altered basic blocks. */ | |
8315 | bitmap_set_bit (cfgcleanup_altered_bbs, e->src->index); | |
8316 | bitmap_ior_into (cfgcleanup_altered_bbs, df); | |
8317 | } | |
8318 | ||
8319 | /* Remove E and the cancelled blocks. */ | |
8320 | if (none_removed) | |
8321 | remove_edge (e); | |
8322 | else | |
8323 | { | |
b5b8b0ac AO |
8324 | /* Walk backwards so as to get a chance to substitute all |
8325 | released DEFs into debug stmts. See | |
8326 | eliminate_unnecessary_stmts() in tree-ssa-dce.c for more | |
8327 | details. */ | |
9771b263 DN |
8328 | for (i = bbs_to_remove.length (); i-- > 0; ) |
8329 | delete_basic_block (bbs_to_remove[i]); | |
672987e8 ZD |
8330 | } |
8331 | ||
8332 | /* Update the dominance information. The immediate dominator may change only | |
8333 | for blocks whose immediate dominator belongs to DF_IDOM: | |
b8698a0f | 8334 | |
672987e8 ZD |
8335 | Suppose that idom(X) = Y before removal of E and idom(X) != Y after the |
8336 | removal. Let Z the arbitrary block such that idom(Z) = Y and | |
8337 | Z dominates X after the removal. Before removal, there exists a path P | |
8338 | from Y to X that avoids Z. Let F be the last edge on P that is | |
8339 | removed, and let W = F->dest. Before removal, idom(W) = Y (since Y | |
8340 | dominates W, and because of P, Z does not dominate W), and W belongs to | |
b8698a0f | 8341 | the dominance frontier of E. Therefore, Y belongs to DF_IDOM. */ |
672987e8 ZD |
8342 | EXECUTE_IF_SET_IN_BITMAP (df_idom, 0, i, bi) |
8343 | { | |
06e28de2 | 8344 | bb = BASIC_BLOCK_FOR_FN (cfun, i); |
672987e8 ZD |
8345 | for (dbb = first_dom_son (CDI_DOMINATORS, bb); |
8346 | dbb; | |
8347 | dbb = next_dom_son (CDI_DOMINATORS, dbb)) | |
9771b263 | 8348 | bbs_to_fix_dom.safe_push (dbb); |
672987e8 ZD |
8349 | } |
8350 | ||
66f97d31 | 8351 | iterate_fix_dominators (CDI_DOMINATORS, bbs_to_fix_dom, true); |
672987e8 | 8352 | |
9771b263 DN |
8353 | bbs_to_remove.release (); |
8354 | bbs_to_fix_dom.release (); | |
672987e8 ZD |
8355 | } |
8356 | ||
4f6c2131 EB |
8357 | /* Purge dead EH edges from basic block BB. */ |
8358 | ||
1eaba2f2 | 8359 | bool |
726a989a | 8360 | gimple_purge_dead_eh_edges (basic_block bb) |
1eaba2f2 RH |
8361 | { |
8362 | bool changed = false; | |
628f6a4e BE |
8363 | edge e; |
8364 | edge_iterator ei; | |
355fe088 | 8365 | gimple *stmt = last_stmt (bb); |
1eaba2f2 | 8366 | |
726a989a | 8367 | if (stmt && stmt_can_throw_internal (stmt)) |
1eaba2f2 RH |
8368 | return false; |
8369 | ||
628f6a4e | 8370 | for (ei = ei_start (bb->succs); (e = ei_safe_edge (ei)); ) |
1eaba2f2 | 8371 | { |
1eaba2f2 RH |
8372 | if (e->flags & EDGE_EH) |
8373 | { | |
672987e8 | 8374 | remove_edge_and_dominated_blocks (e); |
1eaba2f2 RH |
8375 | changed = true; |
8376 | } | |
628f6a4e BE |
8377 | else |
8378 | ei_next (&ei); | |
1eaba2f2 RH |
8379 | } |
8380 | ||
8381 | return changed; | |
8382 | } | |
8383 | ||
30fd5881 EB |
8384 | /* Purge dead EH edges from basic block listed in BLOCKS. */ |
8385 | ||
1eaba2f2 | 8386 | bool |
726a989a | 8387 | gimple_purge_all_dead_eh_edges (const_bitmap blocks) |
1eaba2f2 RH |
8388 | { |
8389 | bool changed = false; | |
3cd8c58a | 8390 | unsigned i; |
87c476a2 | 8391 | bitmap_iterator bi; |
1eaba2f2 | 8392 | |
87c476a2 ZD |
8393 | EXECUTE_IF_SET_IN_BITMAP (blocks, 0, i, bi) |
8394 | { | |
06e28de2 | 8395 | basic_block bb = BASIC_BLOCK_FOR_FN (cfun, i); |
833ee764 JJ |
8396 | |
8397 | /* Earlier gimple_purge_dead_eh_edges could have removed | |
8398 | this basic block already. */ | |
8399 | gcc_assert (bb || changed); | |
8400 | if (bb != NULL) | |
8401 | changed |= gimple_purge_dead_eh_edges (bb); | |
87c476a2 | 8402 | } |
1eaba2f2 RH |
8403 | |
8404 | return changed; | |
8405 | } | |
6de9cd9a | 8406 | |
30fd5881 EB |
8407 | /* Purge dead abnormal call edges from basic block BB. */ |
8408 | ||
8409 | bool | |
8410 | gimple_purge_dead_abnormal_call_edges (basic_block bb) | |
8411 | { | |
8412 | bool changed = false; | |
8413 | edge e; | |
8414 | edge_iterator ei; | |
355fe088 | 8415 | gimple *stmt = last_stmt (bb); |
30fd5881 | 8416 | |
f6b64c35 RB |
8417 | if (!cfun->has_nonlocal_label |
8418 | && !cfun->calls_setjmp) | |
30fd5881 EB |
8419 | return false; |
8420 | ||
8421 | if (stmt && stmt_can_make_abnormal_goto (stmt)) | |
8422 | return false; | |
8423 | ||
8424 | for (ei = ei_start (bb->succs); (e = ei_safe_edge (ei)); ) | |
8425 | { | |
8426 | if (e->flags & EDGE_ABNORMAL) | |
8427 | { | |
0107dca2 RB |
8428 | if (e->flags & EDGE_FALLTHRU) |
8429 | e->flags &= ~EDGE_ABNORMAL; | |
8430 | else | |
8431 | remove_edge_and_dominated_blocks (e); | |
30fd5881 EB |
8432 | changed = true; |
8433 | } | |
8434 | else | |
8435 | ei_next (&ei); | |
8436 | } | |
8437 | ||
8438 | return changed; | |
8439 | } | |
8440 | ||
8441 | /* Purge dead abnormal call edges from basic block listed in BLOCKS. */ | |
8442 | ||
8443 | bool | |
8444 | gimple_purge_all_dead_abnormal_call_edges (const_bitmap blocks) | |
8445 | { | |
8446 | bool changed = false; | |
8447 | unsigned i; | |
8448 | bitmap_iterator bi; | |
8449 | ||
8450 | EXECUTE_IF_SET_IN_BITMAP (blocks, 0, i, bi) | |
8451 | { | |
06e28de2 | 8452 | basic_block bb = BASIC_BLOCK_FOR_FN (cfun, i); |
30fd5881 EB |
8453 | |
8454 | /* Earlier gimple_purge_dead_abnormal_call_edges could have removed | |
8455 | this basic block already. */ | |
8456 | gcc_assert (bb || changed); | |
8457 | if (bb != NULL) | |
8458 | changed |= gimple_purge_dead_abnormal_call_edges (bb); | |
8459 | } | |
8460 | ||
8461 | return changed; | |
8462 | } | |
8463 | ||
a100ac1e KH |
8464 | /* This function is called whenever a new edge is created or |
8465 | redirected. */ | |
8466 | ||
8467 | static void | |
726a989a | 8468 | gimple_execute_on_growing_pred (edge e) |
a100ac1e KH |
8469 | { |
8470 | basic_block bb = e->dest; | |
8471 | ||
8eacd016 | 8472 | if (!gimple_seq_empty_p (phi_nodes (bb))) |
a100ac1e KH |
8473 | reserve_phi_args_for_new_edge (bb); |
8474 | } | |
8475 | ||
e51546f8 KH |
8476 | /* This function is called immediately before edge E is removed from |
8477 | the edge vector E->dest->preds. */ | |
8478 | ||
8479 | static void | |
726a989a | 8480 | gimple_execute_on_shrinking_pred (edge e) |
e51546f8 | 8481 | { |
8eacd016 | 8482 | if (!gimple_seq_empty_p (phi_nodes (e->dest))) |
e51546f8 KH |
8483 | remove_phi_args (e); |
8484 | } | |
8485 | ||
1cb7dfc3 MH |
8486 | /*--------------------------------------------------------------------------- |
8487 | Helper functions for Loop versioning | |
8488 | ---------------------------------------------------------------------------*/ | |
8489 | ||
8490 | /* Adjust phi nodes for 'first' basic block. 'second' basic block is a copy | |
8491 | of 'first'. Both of them are dominated by 'new_head' basic block. When | |
8492 | 'new_head' was created by 'second's incoming edge it received phi arguments | |
8493 | on the edge by split_edge(). Later, additional edge 'e' was created to | |
6531d1be BF |
8494 | connect 'new_head' and 'first'. Now this routine adds phi args on this |
8495 | additional edge 'e' that new_head to second edge received as part of edge | |
726a989a | 8496 | splitting. */ |
1cb7dfc3 MH |
8497 | |
8498 | static void | |
726a989a RB |
8499 | gimple_lv_adjust_loop_header_phi (basic_block first, basic_block second, |
8500 | basic_block new_head, edge e) | |
1cb7dfc3 | 8501 | { |
538dd0b7 DM |
8502 | gphi *phi1, *phi2; |
8503 | gphi_iterator psi1, psi2; | |
726a989a | 8504 | tree def; |
d0e12fc6 KH |
8505 | edge e2 = find_edge (new_head, second); |
8506 | ||
8507 | /* Because NEW_HEAD has been created by splitting SECOND's incoming | |
8508 | edge, we should always have an edge from NEW_HEAD to SECOND. */ | |
8509 | gcc_assert (e2 != NULL); | |
1cb7dfc3 MH |
8510 | |
8511 | /* Browse all 'second' basic block phi nodes and add phi args to | |
8512 | edge 'e' for 'first' head. PHI args are always in correct order. */ | |
8513 | ||
726a989a RB |
8514 | for (psi2 = gsi_start_phis (second), |
8515 | psi1 = gsi_start_phis (first); | |
8516 | !gsi_end_p (psi2) && !gsi_end_p (psi1); | |
8517 | gsi_next (&psi2), gsi_next (&psi1)) | |
1cb7dfc3 | 8518 | { |
538dd0b7 DM |
8519 | phi1 = psi1.phi (); |
8520 | phi2 = psi2.phi (); | |
726a989a | 8521 | def = PHI_ARG_DEF (phi2, e2->dest_idx); |
9e227d60 | 8522 | add_phi_arg (phi1, def, e, gimple_phi_arg_location_from_edge (phi2, e2)); |
1cb7dfc3 MH |
8523 | } |
8524 | } | |
8525 | ||
726a989a | 8526 | |
6531d1be BF |
8527 | /* Adds a if else statement to COND_BB with condition COND_EXPR. |
8528 | SECOND_HEAD is the destination of the THEN and FIRST_HEAD is | |
1cb7dfc3 | 8529 | the destination of the ELSE part. */ |
726a989a | 8530 | |
1cb7dfc3 | 8531 | static void |
726a989a RB |
8532 | gimple_lv_add_condition_to_bb (basic_block first_head ATTRIBUTE_UNUSED, |
8533 | basic_block second_head ATTRIBUTE_UNUSED, | |
8534 | basic_block cond_bb, void *cond_e) | |
1cb7dfc3 | 8535 | { |
726a989a | 8536 | gimple_stmt_iterator gsi; |
355fe088 | 8537 | gimple *new_cond_expr; |
1cb7dfc3 MH |
8538 | tree cond_expr = (tree) cond_e; |
8539 | edge e0; | |
8540 | ||
8541 | /* Build new conditional expr */ | |
726a989a RB |
8542 | new_cond_expr = gimple_build_cond_from_tree (cond_expr, |
8543 | NULL_TREE, NULL_TREE); | |
1cb7dfc3 | 8544 | |
6531d1be | 8545 | /* Add new cond in cond_bb. */ |
726a989a RB |
8546 | gsi = gsi_last_bb (cond_bb); |
8547 | gsi_insert_after (&gsi, new_cond_expr, GSI_NEW_STMT); | |
8548 | ||
1cb7dfc3 MH |
8549 | /* Adjust edges appropriately to connect new head with first head |
8550 | as well as second head. */ | |
8551 | e0 = single_succ_edge (cond_bb); | |
8552 | e0->flags &= ~EDGE_FALLTHRU; | |
8553 | e0->flags |= EDGE_FALSE_VALUE; | |
8554 | } | |
8555 | ||
aa4723d7 SB |
8556 | |
8557 | /* Do book-keeping of basic block BB for the profile consistency checker. | |
8558 | If AFTER_PASS is 0, do pre-pass accounting, or if AFTER_PASS is 1 | |
8559 | then do post-pass accounting. Store the counting in RECORD. */ | |
8560 | static void | |
8561 | gimple_account_profile_record (basic_block bb, int after_pass, | |
8562 | struct profile_record *record) | |
8563 | { | |
8564 | gimple_stmt_iterator i; | |
8565 | for (i = gsi_start_bb (bb); !gsi_end_p (i); gsi_next (&i)) | |
8566 | { | |
8567 | record->size[after_pass] | |
8568 | += estimate_num_insns (gsi_stmt (i), &eni_size_weights); | |
3995f3a2 | 8569 | if (bb->count.initialized_p ()) |
aa4723d7 SB |
8570 | record->time[after_pass] |
8571 | += estimate_num_insns (gsi_stmt (i), | |
3995f3a2 | 8572 | &eni_time_weights) * bb->count.to_gcov_type (); |
0a6a6ac9 | 8573 | else if (profile_status_for_fn (cfun) == PROFILE_GUESSED) |
aa4723d7 SB |
8574 | record->time[after_pass] |
8575 | += estimate_num_insns (gsi_stmt (i), | |
8576 | &eni_time_weights) * bb->frequency; | |
8577 | } | |
8578 | } | |
8579 | ||
726a989a RB |
8580 | struct cfg_hooks gimple_cfg_hooks = { |
8581 | "gimple", | |
8582 | gimple_verify_flow_info, | |
8583 | gimple_dump_bb, /* dump_bb */ | |
2c895bd1 | 8584 | gimple_dump_bb_for_graph, /* dump_bb_for_graph */ |
6de9cd9a | 8585 | create_bb, /* create_basic_block */ |
726a989a RB |
8586 | gimple_redirect_edge_and_branch, /* redirect_edge_and_branch */ |
8587 | gimple_redirect_edge_and_branch_force, /* redirect_edge_and_branch_force */ | |
8588 | gimple_can_remove_branch_p, /* can_remove_branch_p */ | |
6de9cd9a | 8589 | remove_bb, /* delete_basic_block */ |
726a989a RB |
8590 | gimple_split_block, /* split_block */ |
8591 | gimple_move_block_after, /* move_block_after */ | |
8592 | gimple_can_merge_blocks_p, /* can_merge_blocks_p */ | |
8593 | gimple_merge_blocks, /* merge_blocks */ | |
8594 | gimple_predict_edge, /* predict_edge */ | |
10817317 | 8595 | gimple_predicted_by_p, /* predicted_by_p */ |
726a989a RB |
8596 | gimple_can_duplicate_bb_p, /* can_duplicate_block_p */ |
8597 | gimple_duplicate_bb, /* duplicate_block */ | |
8598 | gimple_split_edge, /* split_edge */ | |
8599 | gimple_make_forwarder_block, /* make_forward_block */ | |
6de9cd9a | 8600 | NULL, /* tidy_fallthru_edge */ |
cf103ca4 | 8601 | NULL, /* force_nonfallthru */ |
726a989a RB |
8602 | gimple_block_ends_with_call_p,/* block_ends_with_call_p */ |
8603 | gimple_block_ends_with_condjump_p, /* block_ends_with_condjump_p */ | |
10817317 | 8604 | gimple_flow_call_edges_add, /* flow_call_edges_add */ |
726a989a RB |
8605 | gimple_execute_on_growing_pred, /* execute_on_growing_pred */ |
8606 | gimple_execute_on_shrinking_pred, /* execute_on_shrinking_pred */ | |
8607 | gimple_duplicate_loop_to_header_edge, /* duplicate loop for trees */ | |
8608 | gimple_lv_add_condition_to_bb, /* lv_add_condition_to_bb */ | |
8609 | gimple_lv_adjust_loop_header_phi, /* lv_adjust_loop_header_phi*/ | |
1cb7dfc3 | 8610 | extract_true_false_edges_from_block, /* extract_cond_bb_edges */ |
df92c640 SB |
8611 | flush_pending_stmts, /* flush_pending_stmts */ |
8612 | gimple_empty_block_p, /* block_empty_p */ | |
8613 | gimple_split_block_before_cond_jump, /* split_block_before_cond_jump */ | |
aa4723d7 | 8614 | gimple_account_profile_record, |
6de9cd9a DN |
8615 | }; |
8616 | ||
8617 | ||
8618 | /* Split all critical edges. */ | |
8619 | ||
2aaed0f3 | 8620 | unsigned int |
6de9cd9a DN |
8621 | split_critical_edges (void) |
8622 | { | |
8623 | basic_block bb; | |
8624 | edge e; | |
628f6a4e | 8625 | edge_iterator ei; |
6de9cd9a | 8626 | |
d6be0d7f JL |
8627 | /* split_edge can redirect edges out of SWITCH_EXPRs, which can get |
8628 | expensive. So we want to enable recording of edge to CASE_LABEL_EXPR | |
8629 | mappings around the calls to split_edge. */ | |
8630 | start_recording_case_labels (); | |
04a90bec | 8631 | FOR_ALL_BB_FN (bb, cfun) |
6de9cd9a | 8632 | { |
628f6a4e | 8633 | FOR_EACH_EDGE (e, ei, bb->succs) |
496a4ef5 JH |
8634 | { |
8635 | if (EDGE_CRITICAL_P (e) && !(e->flags & EDGE_ABNORMAL)) | |
6de9cd9a | 8636 | split_edge (e); |
b8698a0f | 8637 | /* PRE inserts statements to edges and expects that |
496a4ef5 JH |
8638 | since split_critical_edges was done beforehand, committing edge |
8639 | insertions will not split more edges. In addition to critical | |
8640 | edges we must split edges that have multiple successors and | |
b8698a0f | 8641 | end by control flow statements, such as RESX. |
496a4ef5 JH |
8642 | Go ahead and split them too. This matches the logic in |
8643 | gimple_find_edge_insert_loc. */ | |
8644 | else if ((!single_pred_p (e->dest) | |
671f9f30 | 8645 | || !gimple_seq_empty_p (phi_nodes (e->dest)) |
fefa31b5 DM |
8646 | || e->dest == EXIT_BLOCK_PTR_FOR_FN (cfun)) |
8647 | && e->src != ENTRY_BLOCK_PTR_FOR_FN (cfun) | |
496a4ef5 JH |
8648 | && !(e->flags & EDGE_ABNORMAL)) |
8649 | { | |
8650 | gimple_stmt_iterator gsi; | |
8651 | ||
8652 | gsi = gsi_last_bb (e->src); | |
8653 | if (!gsi_end_p (gsi) | |
8654 | && stmt_ends_bb_p (gsi_stmt (gsi)) | |
c54c785d JH |
8655 | && (gimple_code (gsi_stmt (gsi)) != GIMPLE_RETURN |
8656 | && !gimple_call_builtin_p (gsi_stmt (gsi), | |
8657 | BUILT_IN_RETURN))) | |
496a4ef5 JH |
8658 | split_edge (e); |
8659 | } | |
8660 | } | |
6de9cd9a | 8661 | } |
d6be0d7f | 8662 | end_recording_case_labels (); |
c2924966 | 8663 | return 0; |
6de9cd9a DN |
8664 | } |
8665 | ||
27a4cd48 DM |
8666 | namespace { |
8667 | ||
8668 | const pass_data pass_data_split_crit_edges = | |
8669 | { | |
8670 | GIMPLE_PASS, /* type */ | |
8671 | "crited", /* name */ | |
8672 | OPTGROUP_NONE, /* optinfo_flags */ | |
27a4cd48 DM |
8673 | TV_TREE_SPLIT_EDGES, /* tv_id */ |
8674 | PROP_cfg, /* properties_required */ | |
8675 | PROP_no_crit_edges, /* properties_provided */ | |
8676 | 0, /* properties_destroyed */ | |
8677 | 0, /* todo_flags_start */ | |
3bea341f | 8678 | 0, /* todo_flags_finish */ |
6de9cd9a | 8679 | }; |
26277d41 | 8680 | |
27a4cd48 DM |
8681 | class pass_split_crit_edges : public gimple_opt_pass |
8682 | { | |
8683 | public: | |
c3284718 RS |
8684 | pass_split_crit_edges (gcc::context *ctxt) |
8685 | : gimple_opt_pass (pass_data_split_crit_edges, ctxt) | |
27a4cd48 DM |
8686 | {} |
8687 | ||
8688 | /* opt_pass methods: */ | |
be55bfe6 | 8689 | virtual unsigned int execute (function *) { return split_critical_edges (); } |
27a4cd48 | 8690 | |
65d3284b | 8691 | opt_pass * clone () { return new pass_split_crit_edges (m_ctxt); } |
27a4cd48 DM |
8692 | }; // class pass_split_crit_edges |
8693 | ||
8694 | } // anon namespace | |
8695 | ||
8696 | gimple_opt_pass * | |
8697 | make_pass_split_crit_edges (gcc::context *ctxt) | |
8698 | { | |
8699 | return new pass_split_crit_edges (ctxt); | |
8700 | } | |
8701 | ||
26277d41 | 8702 | |
e4727812 IE |
8703 | /* Insert COND expression which is GIMPLE_COND after STMT |
8704 | in basic block BB with appropriate basic block split | |
8705 | and creation of a new conditionally executed basic block. | |
8706 | Return created basic block. */ | |
8707 | basic_block | |
355fe088 | 8708 | insert_cond_bb (basic_block bb, gimple *stmt, gimple *cond) |
e4727812 IE |
8709 | { |
8710 | edge fall = split_block (bb, stmt); | |
8711 | gimple_stmt_iterator iter = gsi_last_bb (bb); | |
8712 | basic_block new_bb; | |
8713 | ||
8714 | /* Insert cond statement. */ | |
8715 | gcc_assert (gimple_code (cond) == GIMPLE_COND); | |
8716 | if (gsi_end_p (iter)) | |
8717 | gsi_insert_before (&iter, cond, GSI_CONTINUE_LINKING); | |
8718 | else | |
8719 | gsi_insert_after (&iter, cond, GSI_CONTINUE_LINKING); | |
8720 | ||
8721 | /* Create conditionally executed block. */ | |
8722 | new_bb = create_empty_bb (bb); | |
8723 | make_edge (bb, new_bb, EDGE_TRUE_VALUE); | |
8724 | make_single_succ_edge (new_bb, fall->dest, EDGE_FALLTHRU); | |
8725 | ||
8726 | /* Fix edge for split bb. */ | |
8727 | fall->flags = EDGE_FALSE_VALUE; | |
8728 | ||
8729 | /* Update dominance info. */ | |
8730 | if (dom_info_available_p (CDI_DOMINATORS)) | |
8731 | { | |
8732 | set_immediate_dominator (CDI_DOMINATORS, new_bb, bb); | |
8733 | set_immediate_dominator (CDI_DOMINATORS, fall->dest, bb); | |
8734 | } | |
8735 | ||
8736 | /* Update loop info. */ | |
8737 | if (current_loops) | |
8738 | add_bb_to_loop (new_bb, bb->loop_father); | |
8739 | ||
8740 | return new_bb; | |
8741 | } | |
8742 | ||
726a989a | 8743 | /* Build a ternary operation and gimplify it. Emit code before GSI. |
26277d41 PB |
8744 | Return the gimple_val holding the result. */ |
8745 | ||
8746 | tree | |
726a989a | 8747 | gimplify_build3 (gimple_stmt_iterator *gsi, enum tree_code code, |
26277d41 PB |
8748 | tree type, tree a, tree b, tree c) |
8749 | { | |
8750 | tree ret; | |
db3927fb | 8751 | location_t loc = gimple_location (gsi_stmt (*gsi)); |
26277d41 | 8752 | |
db3927fb | 8753 | ret = fold_build3_loc (loc, code, type, a, b, c); |
26277d41 PB |
8754 | STRIP_NOPS (ret); |
8755 | ||
726a989a RB |
8756 | return force_gimple_operand_gsi (gsi, ret, true, NULL, true, |
8757 | GSI_SAME_STMT); | |
26277d41 PB |
8758 | } |
8759 | ||
726a989a | 8760 | /* Build a binary operation and gimplify it. Emit code before GSI. |
26277d41 PB |
8761 | Return the gimple_val holding the result. */ |
8762 | ||
8763 | tree | |
726a989a | 8764 | gimplify_build2 (gimple_stmt_iterator *gsi, enum tree_code code, |
26277d41 PB |
8765 | tree type, tree a, tree b) |
8766 | { | |
8767 | tree ret; | |
8768 | ||
db3927fb | 8769 | ret = fold_build2_loc (gimple_location (gsi_stmt (*gsi)), code, type, a, b); |
26277d41 PB |
8770 | STRIP_NOPS (ret); |
8771 | ||
726a989a RB |
8772 | return force_gimple_operand_gsi (gsi, ret, true, NULL, true, |
8773 | GSI_SAME_STMT); | |
26277d41 PB |
8774 | } |
8775 | ||
726a989a | 8776 | /* Build a unary operation and gimplify it. Emit code before GSI. |
26277d41 PB |
8777 | Return the gimple_val holding the result. */ |
8778 | ||
8779 | tree | |
726a989a | 8780 | gimplify_build1 (gimple_stmt_iterator *gsi, enum tree_code code, tree type, |
26277d41 PB |
8781 | tree a) |
8782 | { | |
8783 | tree ret; | |
8784 | ||
db3927fb | 8785 | ret = fold_build1_loc (gimple_location (gsi_stmt (*gsi)), code, type, a); |
26277d41 PB |
8786 | STRIP_NOPS (ret); |
8787 | ||
726a989a RB |
8788 | return force_gimple_operand_gsi (gsi, ret, true, NULL, true, |
8789 | GSI_SAME_STMT); | |
26277d41 PB |
8790 | } |
8791 | ||
8792 | ||
6de9cd9a | 8793 | \f |
6de9cd9a DN |
8794 | /* Given a basic block B which ends with a conditional and has |
8795 | precisely two successors, determine which of the edges is taken if | |
8796 | the conditional is true and which is taken if the conditional is | |
8797 | false. Set TRUE_EDGE and FALSE_EDGE appropriately. */ | |
8798 | ||
8799 | void | |
8800 | extract_true_false_edges_from_block (basic_block b, | |
8801 | edge *true_edge, | |
8802 | edge *false_edge) | |
8803 | { | |
628f6a4e | 8804 | edge e = EDGE_SUCC (b, 0); |
6de9cd9a DN |
8805 | |
8806 | if (e->flags & EDGE_TRUE_VALUE) | |
8807 | { | |
8808 | *true_edge = e; | |
628f6a4e | 8809 | *false_edge = EDGE_SUCC (b, 1); |
6de9cd9a DN |
8810 | } |
8811 | else | |
8812 | { | |
8813 | *false_edge = e; | |
628f6a4e | 8814 | *true_edge = EDGE_SUCC (b, 1); |
6de9cd9a DN |
8815 | } |
8816 | } | |
8817 | ||
e6503e0a RB |
8818 | |
8819 | /* From a controlling predicate in the immediate dominator DOM of | |
8820 | PHIBLOCK determine the edges into PHIBLOCK that are chosen if the | |
8821 | predicate evaluates to true and false and store them to | |
8822 | *TRUE_CONTROLLED_EDGE and *FALSE_CONTROLLED_EDGE if | |
8823 | they are non-NULL. Returns true if the edges can be determined, | |
8824 | else return false. */ | |
8825 | ||
8826 | bool | |
8827 | extract_true_false_controlled_edges (basic_block dom, basic_block phiblock, | |
8828 | edge *true_controlled_edge, | |
8829 | edge *false_controlled_edge) | |
8830 | { | |
8831 | basic_block bb = phiblock; | |
8832 | edge true_edge, false_edge, tem; | |
8833 | edge e0 = NULL, e1 = NULL; | |
8834 | ||
8835 | /* We have to verify that one edge into the PHI node is dominated | |
8836 | by the true edge of the predicate block and the other edge | |
8837 | dominated by the false edge. This ensures that the PHI argument | |
8838 | we are going to take is completely determined by the path we | |
8839 | take from the predicate block. | |
8840 | We can only use BB dominance checks below if the destination of | |
8841 | the true/false edges are dominated by their edge, thus only | |
8842 | have a single predecessor. */ | |
8843 | extract_true_false_edges_from_block (dom, &true_edge, &false_edge); | |
8844 | tem = EDGE_PRED (bb, 0); | |
8845 | if (tem == true_edge | |
8846 | || (single_pred_p (true_edge->dest) | |
8847 | && (tem->src == true_edge->dest | |
8848 | || dominated_by_p (CDI_DOMINATORS, | |
8849 | tem->src, true_edge->dest)))) | |
8850 | e0 = tem; | |
8851 | else if (tem == false_edge | |
8852 | || (single_pred_p (false_edge->dest) | |
8853 | && (tem->src == false_edge->dest | |
8854 | || dominated_by_p (CDI_DOMINATORS, | |
8855 | tem->src, false_edge->dest)))) | |
8856 | e1 = tem; | |
8857 | else | |
8858 | return false; | |
8859 | tem = EDGE_PRED (bb, 1); | |
8860 | if (tem == true_edge | |
8861 | || (single_pred_p (true_edge->dest) | |
8862 | && (tem->src == true_edge->dest | |
8863 | || dominated_by_p (CDI_DOMINATORS, | |
8864 | tem->src, true_edge->dest)))) | |
8865 | e0 = tem; | |
8866 | else if (tem == false_edge | |
8867 | || (single_pred_p (false_edge->dest) | |
8868 | && (tem->src == false_edge->dest | |
8869 | || dominated_by_p (CDI_DOMINATORS, | |
8870 | tem->src, false_edge->dest)))) | |
8871 | e1 = tem; | |
8872 | else | |
8873 | return false; | |
8874 | if (!e0 || !e1) | |
8875 | return false; | |
8876 | ||
8877 | if (true_controlled_edge) | |
8878 | *true_controlled_edge = e0; | |
8879 | if (false_controlled_edge) | |
8880 | *false_controlled_edge = e1; | |
8881 | ||
8882 | return true; | |
8883 | } | |
8884 | ||
8885 | ||
8886 | ||
be55bfe6 TS |
8887 | /* Emit return warnings. */ |
8888 | ||
27a4cd48 DM |
8889 | namespace { |
8890 | ||
8891 | const pass_data pass_data_warn_function_return = | |
8892 | { | |
8893 | GIMPLE_PASS, /* type */ | |
8894 | "*warn_function_return", /* name */ | |
8895 | OPTGROUP_NONE, /* optinfo_flags */ | |
27a4cd48 DM |
8896 | TV_NONE, /* tv_id */ |
8897 | PROP_cfg, /* properties_required */ | |
8898 | 0, /* properties_provided */ | |
8899 | 0, /* properties_destroyed */ | |
8900 | 0, /* todo_flags_start */ | |
8901 | 0, /* todo_flags_finish */ | |
6de9cd9a | 8902 | }; |
aa313ed4 | 8903 | |
27a4cd48 DM |
8904 | class pass_warn_function_return : public gimple_opt_pass |
8905 | { | |
8906 | public: | |
c3284718 RS |
8907 | pass_warn_function_return (gcc::context *ctxt) |
8908 | : gimple_opt_pass (pass_data_warn_function_return, ctxt) | |
27a4cd48 DM |
8909 | {} |
8910 | ||
8911 | /* opt_pass methods: */ | |
be55bfe6 | 8912 | virtual unsigned int execute (function *); |
27a4cd48 DM |
8913 | |
8914 | }; // class pass_warn_function_return | |
8915 | ||
be55bfe6 TS |
8916 | unsigned int |
8917 | pass_warn_function_return::execute (function *fun) | |
8918 | { | |
8919 | source_location location; | |
355fe088 | 8920 | gimple *last; |
be55bfe6 TS |
8921 | edge e; |
8922 | edge_iterator ei; | |
8923 | ||
8924 | if (!targetm.warn_func_return (fun->decl)) | |
8925 | return 0; | |
8926 | ||
8927 | /* If we have a path to EXIT, then we do return. */ | |
8928 | if (TREE_THIS_VOLATILE (fun->decl) | |
8929 | && EDGE_COUNT (EXIT_BLOCK_PTR_FOR_FN (fun)->preds) > 0) | |
8930 | { | |
8931 | location = UNKNOWN_LOCATION; | |
8932 | FOR_EACH_EDGE (e, ei, EXIT_BLOCK_PTR_FOR_FN (fun)->preds) | |
8933 | { | |
8934 | last = last_stmt (e->src); | |
8935 | if ((gimple_code (last) == GIMPLE_RETURN | |
8936 | || gimple_call_builtin_p (last, BUILT_IN_RETURN)) | |
8937 | && (location = gimple_location (last)) != UNKNOWN_LOCATION) | |
8938 | break; | |
8939 | } | |
8940 | if (location == UNKNOWN_LOCATION) | |
8941 | location = cfun->function_end_locus; | |
8942 | warning_at (location, 0, "%<noreturn%> function does return"); | |
8943 | } | |
8944 | ||
8945 | /* If we see "return;" in some basic block, then we do reach the end | |
8946 | without returning a value. */ | |
8947 | else if (warn_return_type | |
8948 | && !TREE_NO_WARNING (fun->decl) | |
8949 | && EDGE_COUNT (EXIT_BLOCK_PTR_FOR_FN (fun)->preds) > 0 | |
8950 | && !VOID_TYPE_P (TREE_TYPE (TREE_TYPE (fun->decl)))) | |
8951 | { | |
8952 | FOR_EACH_EDGE (e, ei, EXIT_BLOCK_PTR_FOR_FN (fun)->preds) | |
8953 | { | |
355fe088 | 8954 | gimple *last = last_stmt (e->src); |
538dd0b7 DM |
8955 | greturn *return_stmt = dyn_cast <greturn *> (last); |
8956 | if (return_stmt | |
8957 | && gimple_return_retval (return_stmt) == NULL | |
be55bfe6 TS |
8958 | && !gimple_no_warning_p (last)) |
8959 | { | |
8960 | location = gimple_location (last); | |
8961 | if (location == UNKNOWN_LOCATION) | |
8962 | location = fun->function_end_locus; | |
8963 | warning_at (location, OPT_Wreturn_type, "control reaches end of non-void function"); | |
8964 | TREE_NO_WARNING (fun->decl) = 1; | |
8965 | break; | |
8966 | } | |
8967 | } | |
8968 | } | |
8969 | return 0; | |
8970 | } | |
8971 | ||
27a4cd48 DM |
8972 | } // anon namespace |
8973 | ||
8974 | gimple_opt_pass * | |
8975 | make_pass_warn_function_return (gcc::context *ctxt) | |
8976 | { | |
8977 | return new pass_warn_function_return (ctxt); | |
8978 | } | |
8979 | ||
a406865a RG |
8980 | /* Walk a gimplified function and warn for functions whose return value is |
8981 | ignored and attribute((warn_unused_result)) is set. This is done before | |
8982 | inlining, so we don't have to worry about that. */ | |
8983 | ||
8984 | static void | |
8985 | do_warn_unused_result (gimple_seq seq) | |
8986 | { | |
8987 | tree fdecl, ftype; | |
8988 | gimple_stmt_iterator i; | |
8989 | ||
8990 | for (i = gsi_start (seq); !gsi_end_p (i); gsi_next (&i)) | |
8991 | { | |
355fe088 | 8992 | gimple *g = gsi_stmt (i); |
a406865a RG |
8993 | |
8994 | switch (gimple_code (g)) | |
8995 | { | |
8996 | case GIMPLE_BIND: | |
538dd0b7 | 8997 | do_warn_unused_result (gimple_bind_body (as_a <gbind *>(g))); |
a406865a RG |
8998 | break; |
8999 | case GIMPLE_TRY: | |
9000 | do_warn_unused_result (gimple_try_eval (g)); | |
9001 | do_warn_unused_result (gimple_try_cleanup (g)); | |
9002 | break; | |
9003 | case GIMPLE_CATCH: | |
538dd0b7 DM |
9004 | do_warn_unused_result (gimple_catch_handler ( |
9005 | as_a <gcatch *> (g))); | |
a406865a RG |
9006 | break; |
9007 | case GIMPLE_EH_FILTER: | |
9008 | do_warn_unused_result (gimple_eh_filter_failure (g)); | |
9009 | break; | |
9010 | ||
9011 | case GIMPLE_CALL: | |
9012 | if (gimple_call_lhs (g)) | |
9013 | break; | |
25583c4f RS |
9014 | if (gimple_call_internal_p (g)) |
9015 | break; | |
a406865a RG |
9016 | |
9017 | /* This is a naked call, as opposed to a GIMPLE_CALL with an | |
9018 | LHS. All calls whose value is ignored should be | |
9019 | represented like this. Look for the attribute. */ | |
9020 | fdecl = gimple_call_fndecl (g); | |
9bfc434b | 9021 | ftype = gimple_call_fntype (g); |
a406865a RG |
9022 | |
9023 | if (lookup_attribute ("warn_unused_result", TYPE_ATTRIBUTES (ftype))) | |
9024 | { | |
9025 | location_t loc = gimple_location (g); | |
9026 | ||
9027 | if (fdecl) | |
9028 | warning_at (loc, OPT_Wunused_result, | |
9029 | "ignoring return value of %qD, " | |
9030 | "declared with attribute warn_unused_result", | |
9031 | fdecl); | |
9032 | else | |
9033 | warning_at (loc, OPT_Wunused_result, | |
9034 | "ignoring return value of function " | |
9035 | "declared with attribute warn_unused_result"); | |
9036 | } | |
9037 | break; | |
9038 | ||
9039 | default: | |
9040 | /* Not a container, not a call, or a call whose value is used. */ | |
9041 | break; | |
9042 | } | |
9043 | } | |
9044 | } | |
9045 | ||
27a4cd48 DM |
9046 | namespace { |
9047 | ||
9048 | const pass_data pass_data_warn_unused_result = | |
9049 | { | |
9050 | GIMPLE_PASS, /* type */ | |
9051 | "*warn_unused_result", /* name */ | |
9052 | OPTGROUP_NONE, /* optinfo_flags */ | |
27a4cd48 DM |
9053 | TV_NONE, /* tv_id */ |
9054 | PROP_gimple_any, /* properties_required */ | |
9055 | 0, /* properties_provided */ | |
9056 | 0, /* properties_destroyed */ | |
9057 | 0, /* todo_flags_start */ | |
9058 | 0, /* todo_flags_finish */ | |
a406865a | 9059 | }; |
0823efed | 9060 | |
27a4cd48 DM |
9061 | class pass_warn_unused_result : public gimple_opt_pass |
9062 | { | |
9063 | public: | |
c3284718 RS |
9064 | pass_warn_unused_result (gcc::context *ctxt) |
9065 | : gimple_opt_pass (pass_data_warn_unused_result, ctxt) | |
27a4cd48 DM |
9066 | {} |
9067 | ||
9068 | /* opt_pass methods: */ | |
1a3d085c | 9069 | virtual bool gate (function *) { return flag_warn_unused_result; } |
be55bfe6 TS |
9070 | virtual unsigned int execute (function *) |
9071 | { | |
9072 | do_warn_unused_result (gimple_body (current_function_decl)); | |
9073 | return 0; | |
9074 | } | |
27a4cd48 DM |
9075 | |
9076 | }; // class pass_warn_unused_result | |
9077 | ||
9078 | } // anon namespace | |
9079 | ||
9080 | gimple_opt_pass * | |
9081 | make_pass_warn_unused_result (gcc::context *ctxt) | |
9082 | { | |
9083 | return new pass_warn_unused_result (ctxt); | |
9084 | } | |
9085 | ||
c1bf2a39 AM |
9086 | /* IPA passes, compilation of earlier functions or inlining |
9087 | might have changed some properties, such as marked functions nothrow, | |
9088 | pure, const or noreturn. | |
9089 | Remove redundant edges and basic blocks, and create new ones if necessary. | |
9090 | ||
9091 | This pass can't be executed as stand alone pass from pass manager, because | |
9092 | in between inlining and this fixup the verify_flow_info would fail. */ | |
9093 | ||
9094 | unsigned int | |
9095 | execute_fixup_cfg (void) | |
9096 | { | |
9097 | basic_block bb; | |
9098 | gimple_stmt_iterator gsi; | |
3bea341f | 9099 | int todo = 0; |
c1bf2a39 AM |
9100 | edge e; |
9101 | edge_iterator ei; | |
7841800f | 9102 | cgraph_node *node = cgraph_node::get (current_function_decl); |
3995f3a2 JH |
9103 | profile_count num = node->count; |
9104 | profile_count den = ENTRY_BLOCK_PTR_FOR_FN (cfun)->count; | |
86fdda05 JH |
9105 | bool scale = num.initialized_p () |
9106 | && (den > 0 || num == profile_count::zero ()) | |
9107 | && !(num == den); | |
c1bf2a39 | 9108 | |
3995f3a2 JH |
9109 | if (scale) |
9110 | { | |
9111 | ENTRY_BLOCK_PTR_FOR_FN (cfun)->count = node->count; | |
9112 | EXIT_BLOCK_PTR_FOR_FN (cfun)->count | |
9113 | = EXIT_BLOCK_PTR_FOR_FN (cfun)->count.apply_scale (num, den); | |
c1bf2a39 | 9114 | |
3995f3a2 JH |
9115 | FOR_EACH_EDGE (e, ei, ENTRY_BLOCK_PTR_FOR_FN (cfun)->succs) |
9116 | e->count = e->count.apply_scale (num, den); | |
9117 | } | |
c1bf2a39 | 9118 | |
11cd3bed | 9119 | FOR_EACH_BB_FN (bb, cfun) |
c1bf2a39 | 9120 | { |
3995f3a2 JH |
9121 | if (scale) |
9122 | bb->count = bb->count.apply_scale (num, den); | |
6de88c6a | 9123 | for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi);) |
c1bf2a39 | 9124 | { |
355fe088 | 9125 | gimple *stmt = gsi_stmt (gsi); |
c1bf2a39 AM |
9126 | tree decl = is_gimple_call (stmt) |
9127 | ? gimple_call_fndecl (stmt) | |
9128 | : NULL; | |
9129 | if (decl) | |
9130 | { | |
9131 | int flags = gimple_call_flags (stmt); | |
9132 | if (flags & (ECF_CONST | ECF_PURE | ECF_LOOPING_CONST_OR_PURE)) | |
9133 | { | |
9134 | if (gimple_purge_dead_abnormal_call_edges (bb)) | |
9135 | todo |= TODO_cleanup_cfg; | |
9136 | ||
9137 | if (gimple_in_ssa_p (cfun)) | |
9138 | { | |
9139 | todo |= TODO_update_ssa | TODO_cleanup_cfg; | |
9140 | update_stmt (stmt); | |
9141 | } | |
9142 | } | |
9143 | ||
9144 | if (flags & ECF_NORETURN | |
9145 | && fixup_noreturn_call (stmt)) | |
9146 | todo |= TODO_cleanup_cfg; | |
9147 | } | |
9148 | ||
6de88c6a JH |
9149 | /* Remove stores to variables we marked write-only. |
9150 | Keep access when store has side effect, i.e. in case when source | |
9151 | is volatile. */ | |
9152 | if (gimple_store_p (stmt) | |
9153 | && !gimple_has_side_effects (stmt)) | |
9154 | { | |
9155 | tree lhs = get_base_address (gimple_get_lhs (stmt)); | |
9156 | ||
8813a647 | 9157 | if (VAR_P (lhs) |
6de88c6a | 9158 | && (TREE_STATIC (lhs) || DECL_EXTERNAL (lhs)) |
9041d2e6 | 9159 | && varpool_node::get (lhs)->writeonly) |
6de88c6a JH |
9160 | { |
9161 | unlink_stmt_vdef (stmt); | |
9162 | gsi_remove (&gsi, true); | |
9163 | release_defs (stmt); | |
9164 | todo |= TODO_update_ssa | TODO_cleanup_cfg; | |
9165 | continue; | |
9166 | } | |
9167 | } | |
9168 | /* For calls we can simply remove LHS when it is known | |
9169 | to be write-only. */ | |
9170 | if (is_gimple_call (stmt) | |
9171 | && gimple_get_lhs (stmt)) | |
9172 | { | |
9173 | tree lhs = get_base_address (gimple_get_lhs (stmt)); | |
9174 | ||
8813a647 | 9175 | if (VAR_P (lhs) |
6de88c6a | 9176 | && (TREE_STATIC (lhs) || DECL_EXTERNAL (lhs)) |
9041d2e6 | 9177 | && varpool_node::get (lhs)->writeonly) |
6de88c6a JH |
9178 | { |
9179 | gimple_call_set_lhs (stmt, NULL); | |
9180 | update_stmt (stmt); | |
9181 | todo |= TODO_update_ssa | TODO_cleanup_cfg; | |
9182 | } | |
9183 | } | |
9184 | ||
c1bf2a39 AM |
9185 | if (maybe_clean_eh_stmt (stmt) |
9186 | && gimple_purge_dead_eh_edges (bb)) | |
9187 | todo |= TODO_cleanup_cfg; | |
6de88c6a | 9188 | gsi_next (&gsi); |
c1bf2a39 AM |
9189 | } |
9190 | ||
3995f3a2 JH |
9191 | if (scale) |
9192 | FOR_EACH_EDGE (e, ei, bb->succs) | |
9193 | e->count = e->count.apply_scale (num, den); | |
c1bf2a39 AM |
9194 | |
9195 | /* If we have a basic block with no successors that does not | |
9196 | end with a control statement or a noreturn call end it with | |
9197 | a call to __builtin_unreachable. This situation can occur | |
9198 | when inlining a noreturn call that does in fact return. */ | |
9199 | if (EDGE_COUNT (bb->succs) == 0) | |
9200 | { | |
355fe088 | 9201 | gimple *stmt = last_stmt (bb); |
c1bf2a39 AM |
9202 | if (!stmt |
9203 | || (!is_ctrl_stmt (stmt) | |
9204 | && (!is_gimple_call (stmt) | |
865f7046 | 9205 | || !gimple_call_noreturn_p (stmt)))) |
c1bf2a39 | 9206 | { |
58041fe6 MJ |
9207 | if (stmt && is_gimple_call (stmt)) |
9208 | gimple_call_set_ctrl_altering (stmt, false); | |
7841800f JJ |
9209 | tree fndecl = builtin_decl_implicit (BUILT_IN_UNREACHABLE); |
9210 | stmt = gimple_build_call (fndecl, 0); | |
c1bf2a39 AM |
9211 | gimple_stmt_iterator gsi = gsi_last_bb (bb); |
9212 | gsi_insert_after (&gsi, stmt, GSI_NEW_STMT); | |
7841800f JJ |
9213 | if (!cfun->after_inlining) |
9214 | { | |
9215 | gcall *call_stmt = dyn_cast <gcall *> (stmt); | |
9216 | int freq | |
9217 | = compute_call_stmt_bb_frequency (current_function_decl, | |
9218 | bb); | |
9219 | node->create_edge (cgraph_node::get_create (fndecl), | |
9220 | call_stmt, bb->count, freq); | |
9221 | } | |
c1bf2a39 AM |
9222 | } |
9223 | } | |
9224 | } | |
3995f3a2 | 9225 | if (scale) |
c1bf2a39 AM |
9226 | compute_function_frequency (); |
9227 | ||
c1bf2a39 AM |
9228 | if (current_loops |
9229 | && (todo & TODO_cleanup_cfg)) | |
9230 | loops_state_set (LOOPS_NEED_FIXUP); | |
9231 | ||
9232 | return todo; | |
9233 | } | |
9234 | ||
9235 | namespace { | |
9236 | ||
9237 | const pass_data pass_data_fixup_cfg = | |
9238 | { | |
9239 | GIMPLE_PASS, /* type */ | |
2a5671ee | 9240 | "fixup_cfg", /* name */ |
c1bf2a39 | 9241 | OPTGROUP_NONE, /* optinfo_flags */ |
c1bf2a39 AM |
9242 | TV_NONE, /* tv_id */ |
9243 | PROP_cfg, /* properties_required */ | |
9244 | 0, /* properties_provided */ | |
9245 | 0, /* properties_destroyed */ | |
fb0653ab | 9246 | 0, /* todo_flags_start */ |
c1bf2a39 AM |
9247 | 0, /* todo_flags_finish */ |
9248 | }; | |
9249 | ||
9250 | class pass_fixup_cfg : public gimple_opt_pass | |
9251 | { | |
9252 | public: | |
9253 | pass_fixup_cfg (gcc::context *ctxt) | |
9254 | : gimple_opt_pass (pass_data_fixup_cfg, ctxt) | |
9255 | {} | |
9256 | ||
9257 | /* opt_pass methods: */ | |
9258 | opt_pass * clone () { return new pass_fixup_cfg (m_ctxt); } | |
be55bfe6 | 9259 | virtual unsigned int execute (function *) { return execute_fixup_cfg (); } |
c1bf2a39 AM |
9260 | |
9261 | }; // class pass_fixup_cfg | |
9262 | ||
9263 | } // anon namespace | |
9264 | ||
9265 | gimple_opt_pass * | |
9266 | make_pass_fixup_cfg (gcc::context *ctxt) | |
9267 | { | |
9268 | return new pass_fixup_cfg (ctxt); | |
9269 | } | |
0823efed DN |
9270 | |
9271 | /* Garbage collection support for edge_def. */ | |
9272 | ||
9273 | extern void gt_ggc_mx (tree&); | |
355fe088 | 9274 | extern void gt_ggc_mx (gimple *&); |
0823efed DN |
9275 | extern void gt_ggc_mx (rtx&); |
9276 | extern void gt_ggc_mx (basic_block&); | |
9277 | ||
3ffa95c2 DM |
9278 | static void |
9279 | gt_ggc_mx (rtx_insn *& x) | |
9280 | { | |
9281 | if (x) | |
9282 | gt_ggc_mx_rtx_def ((void *) x); | |
9283 | } | |
9284 | ||
0823efed DN |
9285 | void |
9286 | gt_ggc_mx (edge_def *e) | |
9287 | { | |
5368224f | 9288 | tree block = LOCATION_BLOCK (e->goto_locus); |
0823efed DN |
9289 | gt_ggc_mx (e->src); |
9290 | gt_ggc_mx (e->dest); | |
9291 | if (current_ir_type () == IR_GIMPLE) | |
9292 | gt_ggc_mx (e->insns.g); | |
9293 | else | |
9294 | gt_ggc_mx (e->insns.r); | |
5368224f | 9295 | gt_ggc_mx (block); |
0823efed DN |
9296 | } |
9297 | ||
9298 | /* PCH support for edge_def. */ | |
9299 | ||
9300 | extern void gt_pch_nx (tree&); | |
355fe088 | 9301 | extern void gt_pch_nx (gimple *&); |
0823efed DN |
9302 | extern void gt_pch_nx (rtx&); |
9303 | extern void gt_pch_nx (basic_block&); | |
9304 | ||
3ffa95c2 DM |
9305 | static void |
9306 | gt_pch_nx (rtx_insn *& x) | |
9307 | { | |
9308 | if (x) | |
9309 | gt_pch_nx_rtx_def ((void *) x); | |
9310 | } | |
9311 | ||
0823efed DN |
9312 | void |
9313 | gt_pch_nx (edge_def *e) | |
9314 | { | |
5368224f | 9315 | tree block = LOCATION_BLOCK (e->goto_locus); |
0823efed DN |
9316 | gt_pch_nx (e->src); |
9317 | gt_pch_nx (e->dest); | |
9318 | if (current_ir_type () == IR_GIMPLE) | |
9319 | gt_pch_nx (e->insns.g); | |
9320 | else | |
9321 | gt_pch_nx (e->insns.r); | |
5368224f | 9322 | gt_pch_nx (block); |
0823efed DN |
9323 | } |
9324 | ||
9325 | void | |
9326 | gt_pch_nx (edge_def *e, gt_pointer_operator op, void *cookie) | |
9327 | { | |
5368224f | 9328 | tree block = LOCATION_BLOCK (e->goto_locus); |
0823efed DN |
9329 | op (&(e->src), cookie); |
9330 | op (&(e->dest), cookie); | |
9331 | if (current_ir_type () == IR_GIMPLE) | |
9332 | op (&(e->insns.g), cookie); | |
9333 | else | |
9334 | op (&(e->insns.r), cookie); | |
5368224f | 9335 | op (&(block), cookie); |
0823efed | 9336 | } |
d9b950dd DM |
9337 | |
9338 | #if CHECKING_P | |
9339 | ||
9340 | namespace selftest { | |
9341 | ||
9342 | /* Helper function for CFG selftests: create a dummy function decl | |
9343 | and push it as cfun. */ | |
9344 | ||
9345 | static tree | |
9346 | push_fndecl (const char *name) | |
9347 | { | |
9348 | tree fn_type = build_function_type_array (integer_type_node, 0, NULL); | |
9349 | /* FIXME: this uses input_location: */ | |
9350 | tree fndecl = build_fn_decl (name, fn_type); | |
9351 | tree retval = build_decl (UNKNOWN_LOCATION, RESULT_DECL, | |
9352 | NULL_TREE, integer_type_node); | |
9353 | DECL_RESULT (fndecl) = retval; | |
9354 | push_struct_function (fndecl); | |
9355 | function *fun = DECL_STRUCT_FUNCTION (fndecl); | |
9356 | ASSERT_TRUE (fun != NULL); | |
9357 | init_empty_tree_cfg_for_function (fun); | |
9358 | ASSERT_EQ (2, n_basic_blocks_for_fn (fun)); | |
9359 | ASSERT_EQ (0, n_edges_for_fn (fun)); | |
9360 | return fndecl; | |
9361 | } | |
9362 | ||
9363 | /* These tests directly create CFGs. | |
9364 | Compare with the static fns within tree-cfg.c: | |
9365 | - build_gimple_cfg | |
9366 | - make_blocks: calls create_basic_block (seq, bb); | |
9367 | - make_edges. */ | |
9368 | ||
9369 | /* Verify a simple cfg of the form: | |
9370 | ENTRY -> A -> B -> C -> EXIT. */ | |
9371 | ||
9372 | static void | |
9373 | test_linear_chain () | |
9374 | { | |
9375 | gimple_register_cfg_hooks (); | |
9376 | ||
9377 | tree fndecl = push_fndecl ("cfg_test_linear_chain"); | |
9378 | function *fun = DECL_STRUCT_FUNCTION (fndecl); | |
9379 | ||
9380 | /* Create some empty blocks. */ | |
9381 | basic_block bb_a = create_empty_bb (ENTRY_BLOCK_PTR_FOR_FN (fun)); | |
9382 | basic_block bb_b = create_empty_bb (bb_a); | |
9383 | basic_block bb_c = create_empty_bb (bb_b); | |
9384 | ||
9385 | ASSERT_EQ (5, n_basic_blocks_for_fn (fun)); | |
9386 | ASSERT_EQ (0, n_edges_for_fn (fun)); | |
9387 | ||
9388 | /* Create some edges: a simple linear chain of BBs. */ | |
9389 | make_edge (ENTRY_BLOCK_PTR_FOR_FN (fun), bb_a, EDGE_FALLTHRU); | |
9390 | make_edge (bb_a, bb_b, 0); | |
9391 | make_edge (bb_b, bb_c, 0); | |
9392 | make_edge (bb_c, EXIT_BLOCK_PTR_FOR_FN (fun), 0); | |
9393 | ||
9394 | /* Verify the edges. */ | |
9395 | ASSERT_EQ (4, n_edges_for_fn (fun)); | |
9396 | ASSERT_EQ (NULL, ENTRY_BLOCK_PTR_FOR_FN (fun)->preds); | |
9397 | ASSERT_EQ (1, ENTRY_BLOCK_PTR_FOR_FN (fun)->succs->length ()); | |
9398 | ASSERT_EQ (1, bb_a->preds->length ()); | |
9399 | ASSERT_EQ (1, bb_a->succs->length ()); | |
9400 | ASSERT_EQ (1, bb_b->preds->length ()); | |
9401 | ASSERT_EQ (1, bb_b->succs->length ()); | |
9402 | ASSERT_EQ (1, bb_c->preds->length ()); | |
9403 | ASSERT_EQ (1, bb_c->succs->length ()); | |
9404 | ASSERT_EQ (1, EXIT_BLOCK_PTR_FOR_FN (fun)->preds->length ()); | |
9405 | ASSERT_EQ (NULL, EXIT_BLOCK_PTR_FOR_FN (fun)->succs); | |
9406 | ||
9407 | /* Verify the dominance information | |
9408 | Each BB in our simple chain should be dominated by the one before | |
9409 | it. */ | |
9410 | calculate_dominance_info (CDI_DOMINATORS); | |
9411 | ASSERT_EQ (bb_a, get_immediate_dominator (CDI_DOMINATORS, bb_b)); | |
9412 | ASSERT_EQ (bb_b, get_immediate_dominator (CDI_DOMINATORS, bb_c)); | |
9413 | vec<basic_block> dom_by_b = get_dominated_by (CDI_DOMINATORS, bb_b); | |
9414 | ASSERT_EQ (1, dom_by_b.length ()); | |
9415 | ASSERT_EQ (bb_c, dom_by_b[0]); | |
9416 | free_dominance_info (CDI_DOMINATORS); | |
9e34db2e | 9417 | dom_by_b.release (); |
d9b950dd DM |
9418 | |
9419 | /* Similarly for post-dominance: each BB in our chain is post-dominated | |
9420 | by the one after it. */ | |
9421 | calculate_dominance_info (CDI_POST_DOMINATORS); | |
9422 | ASSERT_EQ (bb_b, get_immediate_dominator (CDI_POST_DOMINATORS, bb_a)); | |
9423 | ASSERT_EQ (bb_c, get_immediate_dominator (CDI_POST_DOMINATORS, bb_b)); | |
9424 | vec<basic_block> postdom_by_b = get_dominated_by (CDI_POST_DOMINATORS, bb_b); | |
9425 | ASSERT_EQ (1, postdom_by_b.length ()); | |
9426 | ASSERT_EQ (bb_a, postdom_by_b[0]); | |
9427 | free_dominance_info (CDI_POST_DOMINATORS); | |
9e34db2e | 9428 | postdom_by_b.release (); |
d9b950dd DM |
9429 | |
9430 | pop_cfun (); | |
9431 | } | |
9432 | ||
9433 | /* Verify a simple CFG of the form: | |
9434 | ENTRY | |
9435 | | | |
9436 | A | |
9437 | / \ | |
9438 | /t \f | |
9439 | B C | |
9440 | \ / | |
9441 | \ / | |
9442 | D | |
9443 | | | |
9444 | EXIT. */ | |
9445 | ||
9446 | static void | |
9447 | test_diamond () | |
9448 | { | |
9449 | gimple_register_cfg_hooks (); | |
9450 | ||
9451 | tree fndecl = push_fndecl ("cfg_test_diamond"); | |
9452 | function *fun = DECL_STRUCT_FUNCTION (fndecl); | |
9453 | ||
9454 | /* Create some empty blocks. */ | |
9455 | basic_block bb_a = create_empty_bb (ENTRY_BLOCK_PTR_FOR_FN (fun)); | |
9456 | basic_block bb_b = create_empty_bb (bb_a); | |
9457 | basic_block bb_c = create_empty_bb (bb_a); | |
9458 | basic_block bb_d = create_empty_bb (bb_b); | |
9459 | ||
9460 | ASSERT_EQ (6, n_basic_blocks_for_fn (fun)); | |
9461 | ASSERT_EQ (0, n_edges_for_fn (fun)); | |
9462 | ||
9463 | /* Create the edges. */ | |
9464 | make_edge (ENTRY_BLOCK_PTR_FOR_FN (fun), bb_a, EDGE_FALLTHRU); | |
9465 | make_edge (bb_a, bb_b, EDGE_TRUE_VALUE); | |
9466 | make_edge (bb_a, bb_c, EDGE_FALSE_VALUE); | |
9467 | make_edge (bb_b, bb_d, 0); | |
9468 | make_edge (bb_c, bb_d, 0); | |
9469 | make_edge (bb_d, EXIT_BLOCK_PTR_FOR_FN (fun), 0); | |
9470 | ||
9471 | /* Verify the edges. */ | |
9472 | ASSERT_EQ (6, n_edges_for_fn (fun)); | |
9473 | ASSERT_EQ (1, bb_a->preds->length ()); | |
9474 | ASSERT_EQ (2, bb_a->succs->length ()); | |
9475 | ASSERT_EQ (1, bb_b->preds->length ()); | |
9476 | ASSERT_EQ (1, bb_b->succs->length ()); | |
9477 | ASSERT_EQ (1, bb_c->preds->length ()); | |
9478 | ASSERT_EQ (1, bb_c->succs->length ()); | |
9479 | ASSERT_EQ (2, bb_d->preds->length ()); | |
9480 | ASSERT_EQ (1, bb_d->succs->length ()); | |
9481 | ||
9482 | /* Verify the dominance information. */ | |
9483 | calculate_dominance_info (CDI_DOMINATORS); | |
9484 | ASSERT_EQ (bb_a, get_immediate_dominator (CDI_DOMINATORS, bb_b)); | |
9485 | ASSERT_EQ (bb_a, get_immediate_dominator (CDI_DOMINATORS, bb_c)); | |
9486 | ASSERT_EQ (bb_a, get_immediate_dominator (CDI_DOMINATORS, bb_d)); | |
9487 | vec<basic_block> dom_by_a = get_dominated_by (CDI_DOMINATORS, bb_a); | |
9488 | ASSERT_EQ (3, dom_by_a.length ()); /* B, C, D, in some order. */ | |
9e34db2e | 9489 | dom_by_a.release (); |
d9b950dd DM |
9490 | vec<basic_block> dom_by_b = get_dominated_by (CDI_DOMINATORS, bb_b); |
9491 | ASSERT_EQ (0, dom_by_b.length ()); | |
9e34db2e | 9492 | dom_by_b.release (); |
d9b950dd DM |
9493 | free_dominance_info (CDI_DOMINATORS); |
9494 | ||
9495 | /* Similarly for post-dominance. */ | |
9496 | calculate_dominance_info (CDI_POST_DOMINATORS); | |
9497 | ASSERT_EQ (bb_d, get_immediate_dominator (CDI_POST_DOMINATORS, bb_a)); | |
9498 | ASSERT_EQ (bb_d, get_immediate_dominator (CDI_POST_DOMINATORS, bb_b)); | |
9499 | ASSERT_EQ (bb_d, get_immediate_dominator (CDI_POST_DOMINATORS, bb_c)); | |
9500 | vec<basic_block> postdom_by_d = get_dominated_by (CDI_POST_DOMINATORS, bb_d); | |
9501 | ASSERT_EQ (3, postdom_by_d.length ()); /* A, B, C in some order. */ | |
9e34db2e | 9502 | postdom_by_d.release (); |
d9b950dd DM |
9503 | vec<basic_block> postdom_by_b = get_dominated_by (CDI_POST_DOMINATORS, bb_b); |
9504 | ASSERT_EQ (0, postdom_by_b.length ()); | |
9e34db2e | 9505 | postdom_by_b.release (); |
d9b950dd DM |
9506 | free_dominance_info (CDI_POST_DOMINATORS); |
9507 | ||
9508 | pop_cfun (); | |
9509 | } | |
9510 | ||
9511 | /* Verify that we can handle a CFG containing a "complete" aka | |
9512 | fully-connected subgraph (where A B C D below all have edges | |
9513 | pointing to each other node, also to themselves). | |
9514 | e.g.: | |
9515 | ENTRY EXIT | |
9516 | | ^ | |
9517 | | / | |
9518 | | / | |
9519 | | / | |
9520 | V/ | |
9521 | A<--->B | |
9522 | ^^ ^^ | |
9523 | | \ / | | |
9524 | | X | | |
9525 | | / \ | | |
9526 | VV VV | |
9527 | C<--->D | |
9528 | */ | |
9529 | ||
9530 | static void | |
9531 | test_fully_connected () | |
9532 | { | |
9533 | gimple_register_cfg_hooks (); | |
9534 | ||
9535 | tree fndecl = push_fndecl ("cfg_fully_connected"); | |
9536 | function *fun = DECL_STRUCT_FUNCTION (fndecl); | |
9537 | ||
9538 | const int n = 4; | |
9539 | ||
9540 | /* Create some empty blocks. */ | |
9541 | auto_vec <basic_block> subgraph_nodes; | |
9542 | for (int i = 0; i < n; i++) | |
9543 | subgraph_nodes.safe_push (create_empty_bb (ENTRY_BLOCK_PTR_FOR_FN (fun))); | |
9544 | ||
9545 | ASSERT_EQ (n + 2, n_basic_blocks_for_fn (fun)); | |
9546 | ASSERT_EQ (0, n_edges_for_fn (fun)); | |
9547 | ||
9548 | /* Create the edges. */ | |
9549 | make_edge (ENTRY_BLOCK_PTR_FOR_FN (fun), subgraph_nodes[0], EDGE_FALLTHRU); | |
9550 | make_edge (subgraph_nodes[0], EXIT_BLOCK_PTR_FOR_FN (fun), 0); | |
9551 | for (int i = 0; i < n; i++) | |
9552 | for (int j = 0; j < n; j++) | |
9553 | make_edge (subgraph_nodes[i], subgraph_nodes[j], 0); | |
9554 | ||
9555 | /* Verify the edges. */ | |
9556 | ASSERT_EQ (2 + (n * n), n_edges_for_fn (fun)); | |
9557 | /* The first one is linked to ENTRY/EXIT as well as itself and | |
9558 | everything else. */ | |
9559 | ASSERT_EQ (n + 1, subgraph_nodes[0]->preds->length ()); | |
9560 | ASSERT_EQ (n + 1, subgraph_nodes[0]->succs->length ()); | |
9561 | /* The other ones in the subgraph are linked to everything in | |
9562 | the subgraph (including themselves). */ | |
9563 | for (int i = 1; i < n; i++) | |
9564 | { | |
9565 | ASSERT_EQ (n, subgraph_nodes[i]->preds->length ()); | |
9566 | ASSERT_EQ (n, subgraph_nodes[i]->succs->length ()); | |
9567 | } | |
9568 | ||
9569 | /* Verify the dominance information. */ | |
9570 | calculate_dominance_info (CDI_DOMINATORS); | |
9571 | /* The initial block in the subgraph should be dominated by ENTRY. */ | |
9572 | ASSERT_EQ (ENTRY_BLOCK_PTR_FOR_FN (fun), | |
9573 | get_immediate_dominator (CDI_DOMINATORS, | |
9574 | subgraph_nodes[0])); | |
9575 | /* Every other block in the subgraph should be dominated by the | |
9576 | initial block. */ | |
9577 | for (int i = 1; i < n; i++) | |
9578 | ASSERT_EQ (subgraph_nodes[0], | |
9579 | get_immediate_dominator (CDI_DOMINATORS, | |
9580 | subgraph_nodes[i])); | |
9581 | free_dominance_info (CDI_DOMINATORS); | |
9582 | ||
9583 | /* Similarly for post-dominance. */ | |
9584 | calculate_dominance_info (CDI_POST_DOMINATORS); | |
9585 | /* The initial block in the subgraph should be postdominated by EXIT. */ | |
9586 | ASSERT_EQ (EXIT_BLOCK_PTR_FOR_FN (fun), | |
9587 | get_immediate_dominator (CDI_POST_DOMINATORS, | |
9588 | subgraph_nodes[0])); | |
9589 | /* Every other block in the subgraph should be postdominated by the | |
9590 | initial block, since that leads to EXIT. */ | |
9591 | for (int i = 1; i < n; i++) | |
9592 | ASSERT_EQ (subgraph_nodes[0], | |
9593 | get_immediate_dominator (CDI_POST_DOMINATORS, | |
9594 | subgraph_nodes[i])); | |
9595 | free_dominance_info (CDI_POST_DOMINATORS); | |
9596 | ||
9597 | pop_cfun (); | |
9598 | } | |
9599 | ||
9600 | /* Run all of the selftests within this file. */ | |
9601 | ||
9602 | void | |
9603 | tree_cfg_c_tests () | |
9604 | { | |
9605 | test_linear_chain (); | |
9606 | test_diamond (); | |
9607 | test_fully_connected (); | |
9608 | } | |
9609 | ||
9610 | } // namespace selftest | |
9611 | ||
9612 | /* TODO: test the dominator/postdominator logic with various graphs/nodes: | |
9613 | - loop | |
9614 | - nested loops | |
9615 | - switch statement (a block with many out-edges) | |
9616 | - something that jumps to itself | |
9617 | - etc */ | |
9618 | ||
9619 | #endif /* CHECKING_P */ |