1 /* Control flow functions for trees.
2 Copyright (C) 2001-2013 Free Software Foundation, Inc.
3 Contributed by Diego Novillo <dnovillo@redhat.com>
5 This file is part of GCC.
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
9 the Free Software Foundation; either version 3, or (at your option)
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.
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
23 #include "coretypes.h"
24 #include "hash-table.h"
28 #include "basic-block.h"
32 #include "gimple-pretty-print.h"
34 #include "gimple-ssa.h"
37 #include "tree-phinodes.h"
38 #include "ssa-iterators.h"
39 #include "tree-ssanames.h"
40 #include "tree-ssa-loop-manip.h"
41 #include "tree-ssa-loop-niter.h"
42 #include "tree-into-ssa.h"
45 #include "tree-dump.h"
46 #include "tree-pass.h"
47 #include "diagnostic-core.h"
50 #include "tree-ssa-propagate.h"
51 #include "value-prof.h"
52 #include "pointer-set.h"
53 #include "tree-inline.h"
55 #include "tree-ssa-live.h"
57 #include "tree-cfgcleanup.h"
59 /* This file contains functions for building the Control Flow Graph (CFG)
60 for a function tree. */
62 /* Local declarations. */
64 /* Initial capacity for the basic block array. */
65 static const int initial_cfg_capacity
= 20;
67 /* This hash table allows us to efficiently lookup all CASE_LABEL_EXPRs
68 which use a particular edge. The CASE_LABEL_EXPRs are chained together
69 via their CASE_CHAIN field, which we clear after we're done with the
70 hash table to prevent problems with duplication of GIMPLE_SWITCHes.
72 Access to this list of CASE_LABEL_EXPRs allows us to efficiently
73 update the case vector in response to edge redirections.
75 Right now this table is set up and torn down at key points in the
76 compilation process. It would be nice if we could make the table
77 more persistent. The key is getting notification of changes to
78 the CFG (particularly edge removal, creation and redirection). */
80 static struct pointer_map_t
*edge_to_cases
;
82 /* If we record edge_to_cases, this bitmap will hold indexes
83 of basic blocks that end in a GIMPLE_SWITCH which we touched
84 due to edge manipulations. */
86 static bitmap touched_switch_bbs
;
91 long num_merged_labels
;
94 static struct cfg_stats_d cfg_stats
;
96 /* Nonzero if we found a computed goto while building basic blocks. */
97 static bool found_computed_goto
;
99 /* Hash table to store last discriminator assigned for each locus. */
100 struct locus_discrim_map
106 /* Hashtable helpers. */
108 struct locus_discrim_hasher
: typed_free_remove
<locus_discrim_map
>
110 typedef locus_discrim_map value_type
;
111 typedef locus_discrim_map compare_type
;
112 static inline hashval_t
hash (const value_type
*);
113 static inline bool equal (const value_type
*, const compare_type
*);
116 /* Trivial hash function for a location_t. ITEM is a pointer to
117 a hash table entry that maps a location_t to a discriminator. */
120 locus_discrim_hasher::hash (const value_type
*item
)
122 return LOCATION_LINE (item
->locus
);
125 /* Equality function for the locus-to-discriminator map. A and B
126 point to the two hash table entries to compare. */
129 locus_discrim_hasher::equal (const value_type
*a
, const compare_type
*b
)
131 return LOCATION_LINE (a
->locus
) == LOCATION_LINE (b
->locus
);
134 static hash_table
<locus_discrim_hasher
> discriminator_per_locus
;
136 /* Basic blocks and flowgraphs. */
137 static void make_blocks (gimple_seq
);
138 static void factor_computed_gotos (void);
141 static void make_edges (void);
142 static void assign_discriminators (void);
143 static void make_cond_expr_edges (basic_block
);
144 static void make_gimple_switch_edges (basic_block
);
145 static void make_goto_expr_edges (basic_block
);
146 static void make_gimple_asm_edges (basic_block
);
147 static edge
gimple_redirect_edge_and_branch (edge
, basic_block
);
148 static edge
gimple_try_redirect_by_replacing_jump (edge
, basic_block
);
149 static unsigned int split_critical_edges (void);
151 /* Various helpers. */
152 static inline bool stmt_starts_bb_p (gimple
, gimple
);
153 static int gimple_verify_flow_info (void);
154 static void gimple_make_forwarder_block (edge
);
155 static gimple
first_non_label_stmt (basic_block
);
156 static bool verify_gimple_transaction (gimple
);
158 /* Flowgraph optimization and cleanup. */
159 static void gimple_merge_blocks (basic_block
, basic_block
);
160 static bool gimple_can_merge_blocks_p (basic_block
, basic_block
);
161 static void remove_bb (basic_block
);
162 static edge
find_taken_edge_computed_goto (basic_block
, tree
);
163 static edge
find_taken_edge_cond_expr (basic_block
, tree
);
164 static edge
find_taken_edge_switch_expr (basic_block
, tree
);
165 static tree
find_case_label_for_value (gimple
, tree
);
168 init_empty_tree_cfg_for_function (struct function
*fn
)
170 /* Initialize the basic block array. */
172 profile_status_for_function (fn
) = PROFILE_ABSENT
;
173 n_basic_blocks_for_function (fn
) = NUM_FIXED_BLOCKS
;
174 last_basic_block_for_function (fn
) = NUM_FIXED_BLOCKS
;
175 vec_alloc (basic_block_info_for_function (fn
), initial_cfg_capacity
);
176 vec_safe_grow_cleared (basic_block_info_for_function (fn
),
177 initial_cfg_capacity
);
179 /* Build a mapping of labels to their associated blocks. */
180 vec_alloc (label_to_block_map_for_function (fn
), initial_cfg_capacity
);
181 vec_safe_grow_cleared (label_to_block_map_for_function (fn
),
182 initial_cfg_capacity
);
184 SET_BASIC_BLOCK_FOR_FUNCTION (fn
, ENTRY_BLOCK
,
185 ENTRY_BLOCK_PTR_FOR_FUNCTION (fn
));
186 SET_BASIC_BLOCK_FOR_FUNCTION (fn
, EXIT_BLOCK
,
187 EXIT_BLOCK_PTR_FOR_FUNCTION (fn
));
189 ENTRY_BLOCK_PTR_FOR_FUNCTION (fn
)->next_bb
190 = EXIT_BLOCK_PTR_FOR_FUNCTION (fn
);
191 EXIT_BLOCK_PTR_FOR_FUNCTION (fn
)->prev_bb
192 = ENTRY_BLOCK_PTR_FOR_FUNCTION (fn
);
196 init_empty_tree_cfg (void)
198 init_empty_tree_cfg_for_function (cfun
);
201 /*---------------------------------------------------------------------------
203 ---------------------------------------------------------------------------*/
205 /* Entry point to the CFG builder for trees. SEQ is the sequence of
206 statements to be added to the flowgraph. */
209 build_gimple_cfg (gimple_seq seq
)
211 /* Register specific gimple functions. */
212 gimple_register_cfg_hooks ();
214 memset ((void *) &cfg_stats
, 0, sizeof (cfg_stats
));
216 init_empty_tree_cfg ();
218 found_computed_goto
= 0;
221 /* Computed gotos are hell to deal with, especially if there are
222 lots of them with a large number of destinations. So we factor
223 them to a common computed goto location before we build the
224 edge list. After we convert back to normal form, we will un-factor
225 the computed gotos since factoring introduces an unwanted jump. */
226 if (found_computed_goto
)
227 factor_computed_gotos ();
229 /* Make sure there is always at least one block, even if it's empty. */
230 if (n_basic_blocks
== NUM_FIXED_BLOCKS
)
231 create_empty_bb (ENTRY_BLOCK_PTR
);
233 /* Adjust the size of the array. */
234 if (basic_block_info
->length () < (size_t) n_basic_blocks
)
235 vec_safe_grow_cleared (basic_block_info
, n_basic_blocks
);
237 /* To speed up statement iterator walks, we first purge dead labels. */
238 cleanup_dead_labels ();
240 /* Group case nodes to reduce the number of edges.
241 We do this after cleaning up dead labels because otherwise we miss
242 a lot of obvious case merging opportunities. */
243 group_case_labels ();
245 /* Create the edges of the flowgraph. */
246 discriminator_per_locus
.create (13);
248 assign_discriminators ();
249 cleanup_dead_labels ();
250 discriminator_per_locus
.dispose ();
254 execute_build_cfg (void)
256 gimple_seq body
= gimple_body (current_function_decl
);
258 build_gimple_cfg (body
);
259 gimple_set_body (current_function_decl
, NULL
);
260 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
262 fprintf (dump_file
, "Scope blocks:\n");
263 dump_scope_blocks (dump_file
, dump_flags
);
266 loop_optimizer_init (AVOID_CFG_MODIFICATIONS
);
272 const pass_data pass_data_build_cfg
=
274 GIMPLE_PASS
, /* type */
276 OPTGROUP_NONE
, /* optinfo_flags */
277 false, /* has_gate */
278 true, /* has_execute */
279 TV_TREE_CFG
, /* tv_id */
280 PROP_gimple_leh
, /* properties_required */
281 ( PROP_cfg
| PROP_loops
), /* properties_provided */
282 0, /* properties_destroyed */
283 0, /* todo_flags_start */
284 TODO_verify_stmts
, /* todo_flags_finish */
287 class pass_build_cfg
: public gimple_opt_pass
290 pass_build_cfg (gcc::context
*ctxt
)
291 : gimple_opt_pass (pass_data_build_cfg
, ctxt
)
294 /* opt_pass methods: */
295 unsigned int execute () { return execute_build_cfg (); }
297 }; // class pass_build_cfg
302 make_pass_build_cfg (gcc::context
*ctxt
)
304 return new pass_build_cfg (ctxt
);
308 /* Return true if T is a computed goto. */
311 computed_goto_p (gimple t
)
313 return (gimple_code (t
) == GIMPLE_GOTO
314 && TREE_CODE (gimple_goto_dest (t
)) != LABEL_DECL
);
318 /* Search the CFG for any computed gotos. If found, factor them to a
319 common computed goto site. Also record the location of that site so
320 that we can un-factor the gotos after we have converted back to
324 factor_computed_gotos (void)
327 tree factored_label_decl
= NULL
;
329 gimple factored_computed_goto_label
= NULL
;
330 gimple factored_computed_goto
= NULL
;
332 /* We know there are one or more computed gotos in this function.
333 Examine the last statement in each basic block to see if the block
334 ends with a computed goto. */
338 gimple_stmt_iterator gsi
= gsi_last_bb (bb
);
344 last
= gsi_stmt (gsi
);
346 /* Ignore the computed goto we create when we factor the original
348 if (last
== factored_computed_goto
)
351 /* If the last statement is a computed goto, factor it. */
352 if (computed_goto_p (last
))
356 /* The first time we find a computed goto we need to create
357 the factored goto block and the variable each original
358 computed goto will use for their goto destination. */
359 if (!factored_computed_goto
)
361 basic_block new_bb
= create_empty_bb (bb
);
362 gimple_stmt_iterator new_gsi
= gsi_start_bb (new_bb
);
364 /* Create the destination of the factored goto. Each original
365 computed goto will put its desired destination into this
366 variable and jump to the label we create immediately
368 var
= create_tmp_var (ptr_type_node
, "gotovar");
370 /* Build a label for the new block which will contain the
371 factored computed goto. */
372 factored_label_decl
= create_artificial_label (UNKNOWN_LOCATION
);
373 factored_computed_goto_label
374 = gimple_build_label (factored_label_decl
);
375 gsi_insert_after (&new_gsi
, factored_computed_goto_label
,
378 /* Build our new computed goto. */
379 factored_computed_goto
= gimple_build_goto (var
);
380 gsi_insert_after (&new_gsi
, factored_computed_goto
, GSI_NEW_STMT
);
383 /* Copy the original computed goto's destination into VAR. */
384 assignment
= gimple_build_assign (var
, gimple_goto_dest (last
));
385 gsi_insert_before (&gsi
, assignment
, GSI_SAME_STMT
);
387 /* And re-vector the computed goto to the new destination. */
388 gimple_goto_set_dest (last
, factored_label_decl
);
394 /* Build a flowgraph for the sequence of stmts SEQ. */
397 make_blocks (gimple_seq seq
)
399 gimple_stmt_iterator i
= gsi_start (seq
);
401 bool start_new_block
= true;
402 bool first_stmt_of_seq
= true;
403 basic_block bb
= ENTRY_BLOCK_PTR
;
405 while (!gsi_end_p (i
))
412 /* If the statement starts a new basic block or if we have determined
413 in a previous pass that we need to create a new block for STMT, do
415 if (start_new_block
|| stmt_starts_bb_p (stmt
, prev_stmt
))
417 if (!first_stmt_of_seq
)
418 gsi_split_seq_before (&i
, &seq
);
419 bb
= create_basic_block (seq
, NULL
, bb
);
420 start_new_block
= false;
423 /* Now add STMT to BB and create the subgraphs for special statement
425 gimple_set_bb (stmt
, bb
);
427 if (computed_goto_p (stmt
))
428 found_computed_goto
= true;
430 /* If STMT is a basic block terminator, set START_NEW_BLOCK for the
432 if (stmt_ends_bb_p (stmt
))
434 /* If the stmt can make abnormal goto use a new temporary
435 for the assignment to the LHS. This makes sure the old value
436 of the LHS is available on the abnormal edge. Otherwise
437 we will end up with overlapping life-ranges for abnormal
439 if (gimple_has_lhs (stmt
)
440 && stmt_can_make_abnormal_goto (stmt
)
441 && is_gimple_reg_type (TREE_TYPE (gimple_get_lhs (stmt
))))
443 tree lhs
= gimple_get_lhs (stmt
);
444 tree tmp
= create_tmp_var (TREE_TYPE (lhs
), NULL
);
445 gimple s
= gimple_build_assign (lhs
, tmp
);
446 gimple_set_location (s
, gimple_location (stmt
));
447 gimple_set_block (s
, gimple_block (stmt
));
448 gimple_set_lhs (stmt
, tmp
);
449 if (TREE_CODE (TREE_TYPE (tmp
)) == COMPLEX_TYPE
450 || TREE_CODE (TREE_TYPE (tmp
)) == VECTOR_TYPE
)
451 DECL_GIMPLE_REG_P (tmp
) = 1;
452 gsi_insert_after (&i
, s
, GSI_SAME_STMT
);
454 start_new_block
= true;
458 first_stmt_of_seq
= false;
463 /* Create and return a new empty basic block after bb AFTER. */
466 create_bb (void *h
, void *e
, basic_block after
)
472 /* Create and initialize a new basic block. Since alloc_block uses
473 GC allocation that clears memory to allocate a basic block, we do
474 not have to clear the newly allocated basic block here. */
477 bb
->index
= last_basic_block
;
479 set_bb_seq (bb
, h
? (gimple_seq
) h
: NULL
);
481 /* Add the new block to the linked list of blocks. */
482 link_block (bb
, after
);
484 /* Grow the basic block array if needed. */
485 if ((size_t) last_basic_block
== basic_block_info
->length ())
487 size_t new_size
= last_basic_block
+ (last_basic_block
+ 3) / 4;
488 vec_safe_grow_cleared (basic_block_info
, new_size
);
491 /* Add the newly created block to the array. */
492 SET_BASIC_BLOCK (last_basic_block
, bb
);
501 /*---------------------------------------------------------------------------
503 ---------------------------------------------------------------------------*/
505 /* Fold COND_EXPR_COND of each COND_EXPR. */
508 fold_cond_expr_cond (void)
514 gimple stmt
= last_stmt (bb
);
516 if (stmt
&& gimple_code (stmt
) == GIMPLE_COND
)
518 location_t loc
= gimple_location (stmt
);
522 fold_defer_overflow_warnings ();
523 cond
= fold_binary_loc (loc
, gimple_cond_code (stmt
), boolean_type_node
,
524 gimple_cond_lhs (stmt
), gimple_cond_rhs (stmt
));
527 zerop
= integer_zerop (cond
);
528 onep
= integer_onep (cond
);
531 zerop
= onep
= false;
533 fold_undefer_overflow_warnings (zerop
|| onep
,
535 WARN_STRICT_OVERFLOW_CONDITIONAL
);
537 gimple_cond_make_false (stmt
);
539 gimple_cond_make_true (stmt
);
544 /* Join all the blocks in the flowgraph. */
550 struct omp_region
*cur_region
= NULL
;
552 /* Create an edge from entry to the first block with executable
554 make_edge (ENTRY_BLOCK_PTR
, BASIC_BLOCK (NUM_FIXED_BLOCKS
), EDGE_FALLTHRU
);
556 /* Traverse the basic block array placing edges. */
559 gimple last
= last_stmt (bb
);
564 enum gimple_code code
= gimple_code (last
);
568 make_goto_expr_edges (bb
);
572 make_edge (bb
, EXIT_BLOCK_PTR
, 0);
576 make_cond_expr_edges (bb
);
580 make_gimple_switch_edges (bb
);
584 make_eh_edges (last
);
587 case GIMPLE_EH_DISPATCH
:
588 fallthru
= make_eh_dispatch_edges (last
);
592 /* If this function receives a nonlocal goto, then we need to
593 make edges from this call site to all the nonlocal goto
595 if (stmt_can_make_abnormal_goto (last
))
596 make_abnormal_goto_edges (bb
, true);
598 /* If this statement has reachable exception handlers, then
599 create abnormal edges to them. */
600 make_eh_edges (last
);
602 /* BUILTIN_RETURN is really a return statement. */
603 if (gimple_call_builtin_p (last
, BUILT_IN_RETURN
))
604 make_edge (bb
, EXIT_BLOCK_PTR
, 0), fallthru
= false;
605 /* Some calls are known not to return. */
607 fallthru
= !(gimple_call_flags (last
) & ECF_NORETURN
);
611 /* A GIMPLE_ASSIGN may throw internally and thus be considered
613 if (is_ctrl_altering_stmt (last
))
614 make_eh_edges (last
);
619 make_gimple_asm_edges (bb
);
624 fallthru
= make_gimple_omp_edges (bb
, &cur_region
);
627 case GIMPLE_TRANSACTION
:
629 tree abort_label
= gimple_transaction_label (last
);
631 make_edge (bb
, label_to_block (abort_label
), EDGE_TM_ABORT
);
637 gcc_assert (!stmt_ends_bb_p (last
));
645 make_edge (bb
, bb
->next_bb
, EDGE_FALLTHRU
);
650 /* Fold COND_EXPR_COND of each COND_EXPR. */
651 fold_cond_expr_cond ();
654 /* Find the next available discriminator value for LOCUS. The
655 discriminator distinguishes among several basic blocks that
656 share a common locus, allowing for more accurate sample-based
660 next_discriminator_for_locus (location_t locus
)
662 struct locus_discrim_map item
;
663 struct locus_discrim_map
**slot
;
666 item
.discriminator
= 0;
667 slot
= discriminator_per_locus
.find_slot_with_hash (
668 &item
, LOCATION_LINE (locus
), INSERT
);
670 if (*slot
== HTAB_EMPTY_ENTRY
)
672 *slot
= XNEW (struct locus_discrim_map
);
674 (*slot
)->locus
= locus
;
675 (*slot
)->discriminator
= 0;
677 (*slot
)->discriminator
++;
678 return (*slot
)->discriminator
;
681 /* Return TRUE if LOCUS1 and LOCUS2 refer to the same source line. */
684 same_line_p (location_t locus1
, location_t locus2
)
686 expanded_location from
, to
;
688 if (locus1
== locus2
)
691 from
= expand_location (locus1
);
692 to
= expand_location (locus2
);
694 if (from
.line
!= to
.line
)
696 if (from
.file
== to
.file
)
698 return (from
.file
!= NULL
700 && filename_cmp (from
.file
, to
.file
) == 0);
703 /* Assign discriminators to each basic block. */
706 assign_discriminators (void)
714 gimple last
= last_stmt (bb
);
715 location_t locus
= last
? gimple_location (last
) : UNKNOWN_LOCATION
;
717 if (locus
== UNKNOWN_LOCATION
)
720 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
722 gimple first
= first_non_label_stmt (e
->dest
);
723 gimple last
= last_stmt (e
->dest
);
724 if ((first
&& same_line_p (locus
, gimple_location (first
)))
725 || (last
&& same_line_p (locus
, gimple_location (last
))))
727 if (e
->dest
->discriminator
!= 0 && bb
->discriminator
== 0)
728 bb
->discriminator
= next_discriminator_for_locus (locus
);
730 e
->dest
->discriminator
= next_discriminator_for_locus (locus
);
736 /* Create the edges for a GIMPLE_COND starting at block BB. */
739 make_cond_expr_edges (basic_block bb
)
741 gimple entry
= last_stmt (bb
);
742 gimple then_stmt
, else_stmt
;
743 basic_block then_bb
, else_bb
;
744 tree then_label
, else_label
;
748 gcc_assert (gimple_code (entry
) == GIMPLE_COND
);
750 /* Entry basic blocks for each component. */
751 then_label
= gimple_cond_true_label (entry
);
752 else_label
= gimple_cond_false_label (entry
);
753 then_bb
= label_to_block (then_label
);
754 else_bb
= label_to_block (else_label
);
755 then_stmt
= first_stmt (then_bb
);
756 else_stmt
= first_stmt (else_bb
);
758 e
= make_edge (bb
, then_bb
, EDGE_TRUE_VALUE
);
759 e
->goto_locus
= gimple_location (then_stmt
);
760 e
= make_edge (bb
, else_bb
, EDGE_FALSE_VALUE
);
762 e
->goto_locus
= gimple_location (else_stmt
);
764 /* We do not need the labels anymore. */
765 gimple_cond_set_true_label (entry
, NULL_TREE
);
766 gimple_cond_set_false_label (entry
, NULL_TREE
);
770 /* Called for each element in the hash table (P) as we delete the
771 edge to cases hash table.
773 Clear all the TREE_CHAINs to prevent problems with copying of
774 SWITCH_EXPRs and structure sharing rules, then free the hash table
778 edge_to_cases_cleanup (const void *key ATTRIBUTE_UNUSED
, void **value
,
779 void *data ATTRIBUTE_UNUSED
)
783 for (t
= (tree
) *value
; t
; t
= next
)
785 next
= CASE_CHAIN (t
);
786 CASE_CHAIN (t
) = NULL
;
793 /* Start recording information mapping edges to case labels. */
796 start_recording_case_labels (void)
798 gcc_assert (edge_to_cases
== NULL
);
799 edge_to_cases
= pointer_map_create ();
800 touched_switch_bbs
= BITMAP_ALLOC (NULL
);
803 /* Return nonzero if we are recording information for case labels. */
806 recording_case_labels_p (void)
808 return (edge_to_cases
!= NULL
);
811 /* Stop recording information mapping edges to case labels and
812 remove any information we have recorded. */
814 end_recording_case_labels (void)
818 pointer_map_traverse (edge_to_cases
, edge_to_cases_cleanup
, NULL
);
819 pointer_map_destroy (edge_to_cases
);
820 edge_to_cases
= NULL
;
821 EXECUTE_IF_SET_IN_BITMAP (touched_switch_bbs
, 0, i
, bi
)
823 basic_block bb
= BASIC_BLOCK (i
);
826 gimple stmt
= last_stmt (bb
);
827 if (stmt
&& gimple_code (stmt
) == GIMPLE_SWITCH
)
828 group_case_labels_stmt (stmt
);
831 BITMAP_FREE (touched_switch_bbs
);
834 /* If we are inside a {start,end}_recording_cases block, then return
835 a chain of CASE_LABEL_EXPRs from T which reference E.
837 Otherwise return NULL. */
840 get_cases_for_edge (edge e
, gimple t
)
845 /* If we are not recording cases, then we do not have CASE_LABEL_EXPR
846 chains available. Return NULL so the caller can detect this case. */
847 if (!recording_case_labels_p ())
850 slot
= pointer_map_contains (edge_to_cases
, e
);
854 /* If we did not find E in the hash table, then this must be the first
855 time we have been queried for information about E & T. Add all the
856 elements from T to the hash table then perform the query again. */
858 n
= gimple_switch_num_labels (t
);
859 for (i
= 0; i
< n
; i
++)
861 tree elt
= gimple_switch_label (t
, i
);
862 tree lab
= CASE_LABEL (elt
);
863 basic_block label_bb
= label_to_block (lab
);
864 edge this_edge
= find_edge (e
->src
, label_bb
);
866 /* Add it to the chain of CASE_LABEL_EXPRs referencing E, or create
868 slot
= pointer_map_insert (edge_to_cases
, this_edge
);
869 CASE_CHAIN (elt
) = (tree
) *slot
;
873 return (tree
) *pointer_map_contains (edge_to_cases
, e
);
876 /* Create the edges for a GIMPLE_SWITCH starting at block BB. */
879 make_gimple_switch_edges (basic_block bb
)
881 gimple entry
= last_stmt (bb
);
884 n
= gimple_switch_num_labels (entry
);
886 for (i
= 0; i
< n
; ++i
)
888 tree lab
= CASE_LABEL (gimple_switch_label (entry
, i
));
889 basic_block label_bb
= label_to_block (lab
);
890 make_edge (bb
, label_bb
, 0);
895 /* Return the basic block holding label DEST. */
898 label_to_block_fn (struct function
*ifun
, tree dest
)
900 int uid
= LABEL_DECL_UID (dest
);
902 /* We would die hard when faced by an undefined label. Emit a label to
903 the very first basic block. This will hopefully make even the dataflow
904 and undefined variable warnings quite right. */
905 if (seen_error () && uid
< 0)
907 gimple_stmt_iterator gsi
= gsi_start_bb (BASIC_BLOCK (NUM_FIXED_BLOCKS
));
910 stmt
= gimple_build_label (dest
);
911 gsi_insert_before (&gsi
, stmt
, GSI_NEW_STMT
);
912 uid
= LABEL_DECL_UID (dest
);
914 if (vec_safe_length (ifun
->cfg
->x_label_to_block_map
) <= (unsigned int) uid
)
916 return (*ifun
->cfg
->x_label_to_block_map
)[uid
];
919 /* Create edges for an abnormal goto statement at block BB. If FOR_CALL
920 is true, the source statement is a CALL_EXPR instead of a GOTO_EXPR. */
923 make_abnormal_goto_edges (basic_block bb
, bool for_call
)
925 basic_block target_bb
;
926 gimple_stmt_iterator gsi
;
928 FOR_EACH_BB (target_bb
)
930 for (gsi
= gsi_start_bb (target_bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
932 gimple label_stmt
= gsi_stmt (gsi
);
935 if (gimple_code (label_stmt
) != GIMPLE_LABEL
)
938 target
= gimple_label_label (label_stmt
);
940 /* Make an edge to every label block that has been marked as a
941 potential target for a computed goto or a non-local goto. */
942 if ((FORCED_LABEL (target
) && !for_call
)
943 || (DECL_NONLOCAL (target
) && for_call
))
945 make_edge (bb
, target_bb
, EDGE_ABNORMAL
);
950 && is_gimple_debug (gsi_stmt (gsi
)))
951 gsi_next_nondebug (&gsi
);
952 if (!gsi_end_p (gsi
))
954 /* Make an edge to every setjmp-like call. */
955 gimple call_stmt
= gsi_stmt (gsi
);
956 if (is_gimple_call (call_stmt
)
957 && (gimple_call_flags (call_stmt
) & ECF_RETURNS_TWICE
))
958 make_edge (bb
, target_bb
, EDGE_ABNORMAL
);
963 /* Create edges for a goto statement at block BB. */
966 make_goto_expr_edges (basic_block bb
)
968 gimple_stmt_iterator last
= gsi_last_bb (bb
);
969 gimple goto_t
= gsi_stmt (last
);
971 /* A simple GOTO creates normal edges. */
972 if (simple_goto_p (goto_t
))
974 tree dest
= gimple_goto_dest (goto_t
);
975 basic_block label_bb
= label_to_block (dest
);
976 edge e
= make_edge (bb
, label_bb
, EDGE_FALLTHRU
);
977 e
->goto_locus
= gimple_location (goto_t
);
978 gsi_remove (&last
, true);
982 /* A computed GOTO creates abnormal edges. */
983 make_abnormal_goto_edges (bb
, false);
986 /* Create edges for an asm statement with labels at block BB. */
989 make_gimple_asm_edges (basic_block bb
)
991 gimple stmt
= last_stmt (bb
);
992 int i
, n
= gimple_asm_nlabels (stmt
);
994 for (i
= 0; i
< n
; ++i
)
996 tree label
= TREE_VALUE (gimple_asm_label_op (stmt
, i
));
997 basic_block label_bb
= label_to_block (label
);
998 make_edge (bb
, label_bb
, 0);
1002 /*---------------------------------------------------------------------------
1004 ---------------------------------------------------------------------------*/
1006 /* Cleanup useless labels in basic blocks. This is something we wish
1007 to do early because it allows us to group case labels before creating
1008 the edges for the CFG, and it speeds up block statement iterators in
1009 all passes later on.
1010 We rerun this pass after CFG is created, to get rid of the labels that
1011 are no longer referenced. After then we do not run it any more, since
1012 (almost) no new labels should be created. */
1014 /* A map from basic block index to the leading label of that block. */
1015 static struct label_record
1020 /* True if the label is referenced from somewhere. */
1024 /* Given LABEL return the first label in the same basic block. */
1027 main_block_label (tree label
)
1029 basic_block bb
= label_to_block (label
);
1030 tree main_label
= label_for_bb
[bb
->index
].label
;
1032 /* label_to_block possibly inserted undefined label into the chain. */
1035 label_for_bb
[bb
->index
].label
= label
;
1039 label_for_bb
[bb
->index
].used
= true;
1043 /* Clean up redundant labels within the exception tree. */
1046 cleanup_dead_labels_eh (void)
1053 if (cfun
->eh
== NULL
)
1056 for (i
= 1; vec_safe_iterate (cfun
->eh
->lp_array
, i
, &lp
); ++i
)
1057 if (lp
&& lp
->post_landing_pad
)
1059 lab
= main_block_label (lp
->post_landing_pad
);
1060 if (lab
!= lp
->post_landing_pad
)
1062 EH_LANDING_PAD_NR (lp
->post_landing_pad
) = 0;
1063 EH_LANDING_PAD_NR (lab
) = lp
->index
;
1067 FOR_ALL_EH_REGION (r
)
1071 case ERT_MUST_NOT_THROW
:
1077 for (c
= r
->u
.eh_try
.first_catch
; c
; c
= c
->next_catch
)
1081 c
->label
= main_block_label (lab
);
1086 case ERT_ALLOWED_EXCEPTIONS
:
1087 lab
= r
->u
.allowed
.label
;
1089 r
->u
.allowed
.label
= main_block_label (lab
);
1095 /* Cleanup redundant labels. This is a three-step process:
1096 1) Find the leading label for each block.
1097 2) Redirect all references to labels to the leading labels.
1098 3) Cleanup all useless labels. */
1101 cleanup_dead_labels (void)
1104 label_for_bb
= XCNEWVEC (struct label_record
, last_basic_block
);
1106 /* Find a suitable label for each block. We use the first user-defined
1107 label if there is one, or otherwise just the first label we see. */
1110 gimple_stmt_iterator i
;
1112 for (i
= gsi_start_bb (bb
); !gsi_end_p (i
); gsi_next (&i
))
1115 gimple stmt
= gsi_stmt (i
);
1117 if (gimple_code (stmt
) != GIMPLE_LABEL
)
1120 label
= gimple_label_label (stmt
);
1122 /* If we have not yet seen a label for the current block,
1123 remember this one and see if there are more labels. */
1124 if (!label_for_bb
[bb
->index
].label
)
1126 label_for_bb
[bb
->index
].label
= label
;
1130 /* If we did see a label for the current block already, but it
1131 is an artificially created label, replace it if the current
1132 label is a user defined label. */
1133 if (!DECL_ARTIFICIAL (label
)
1134 && DECL_ARTIFICIAL (label_for_bb
[bb
->index
].label
))
1136 label_for_bb
[bb
->index
].label
= label
;
1142 /* Now redirect all jumps/branches to the selected label.
1143 First do so for each block ending in a control statement. */
1146 gimple stmt
= last_stmt (bb
);
1147 tree label
, new_label
;
1152 switch (gimple_code (stmt
))
1155 label
= gimple_cond_true_label (stmt
);
1158 new_label
= main_block_label (label
);
1159 if (new_label
!= label
)
1160 gimple_cond_set_true_label (stmt
, new_label
);
1163 label
= gimple_cond_false_label (stmt
);
1166 new_label
= main_block_label (label
);
1167 if (new_label
!= label
)
1168 gimple_cond_set_false_label (stmt
, new_label
);
1174 size_t i
, n
= gimple_switch_num_labels (stmt
);
1176 /* Replace all destination labels. */
1177 for (i
= 0; i
< n
; ++i
)
1179 tree case_label
= gimple_switch_label (stmt
, i
);
1180 label
= CASE_LABEL (case_label
);
1181 new_label
= main_block_label (label
);
1182 if (new_label
!= label
)
1183 CASE_LABEL (case_label
) = new_label
;
1190 int i
, n
= gimple_asm_nlabels (stmt
);
1192 for (i
= 0; i
< n
; ++i
)
1194 tree cons
= gimple_asm_label_op (stmt
, i
);
1195 tree label
= main_block_label (TREE_VALUE (cons
));
1196 TREE_VALUE (cons
) = label
;
1201 /* We have to handle gotos until they're removed, and we don't
1202 remove them until after we've created the CFG edges. */
1204 if (!computed_goto_p (stmt
))
1206 label
= gimple_goto_dest (stmt
);
1207 new_label
= main_block_label (label
);
1208 if (new_label
!= label
)
1209 gimple_goto_set_dest (stmt
, new_label
);
1213 case GIMPLE_TRANSACTION
:
1215 tree label
= gimple_transaction_label (stmt
);
1218 tree new_label
= main_block_label (label
);
1219 if (new_label
!= label
)
1220 gimple_transaction_set_label (stmt
, new_label
);
1230 /* Do the same for the exception region tree labels. */
1231 cleanup_dead_labels_eh ();
1233 /* Finally, purge dead labels. All user-defined labels and labels that
1234 can be the target of non-local gotos and labels which have their
1235 address taken are preserved. */
1238 gimple_stmt_iterator i
;
1239 tree label_for_this_bb
= label_for_bb
[bb
->index
].label
;
1241 if (!label_for_this_bb
)
1244 /* If the main label of the block is unused, we may still remove it. */
1245 if (!label_for_bb
[bb
->index
].used
)
1246 label_for_this_bb
= NULL
;
1248 for (i
= gsi_start_bb (bb
); !gsi_end_p (i
); )
1251 gimple stmt
= gsi_stmt (i
);
1253 if (gimple_code (stmt
) != GIMPLE_LABEL
)
1256 label
= gimple_label_label (stmt
);
1258 if (label
== label_for_this_bb
1259 || !DECL_ARTIFICIAL (label
)
1260 || DECL_NONLOCAL (label
)
1261 || FORCED_LABEL (label
))
1264 gsi_remove (&i
, true);
1268 free (label_for_bb
);
1271 /* Scan the sorted vector of cases in STMT (a GIMPLE_SWITCH) and combine
1272 the ones jumping to the same label.
1273 Eg. three separate entries 1: 2: 3: become one entry 1..3: */
1276 group_case_labels_stmt (gimple stmt
)
1278 int old_size
= gimple_switch_num_labels (stmt
);
1279 int i
, j
, new_size
= old_size
;
1280 basic_block default_bb
= NULL
;
1282 default_bb
= label_to_block (CASE_LABEL (gimple_switch_default_label (stmt
)));
1284 /* Look for possible opportunities to merge cases. */
1286 while (i
< old_size
)
1288 tree base_case
, base_high
;
1289 basic_block base_bb
;
1291 base_case
= gimple_switch_label (stmt
, i
);
1293 gcc_assert (base_case
);
1294 base_bb
= label_to_block (CASE_LABEL (base_case
));
1296 /* Discard cases that have the same destination as the
1298 if (base_bb
== default_bb
)
1300 gimple_switch_set_label (stmt
, i
, NULL_TREE
);
1306 base_high
= CASE_HIGH (base_case
)
1307 ? CASE_HIGH (base_case
)
1308 : CASE_LOW (base_case
);
1311 /* Try to merge case labels. Break out when we reach the end
1312 of the label vector or when we cannot merge the next case
1313 label with the current one. */
1314 while (i
< old_size
)
1316 tree merge_case
= gimple_switch_label (stmt
, i
);
1317 basic_block merge_bb
= label_to_block (CASE_LABEL (merge_case
));
1318 double_int bhp1
= tree_to_double_int (base_high
) + double_int_one
;
1320 /* Merge the cases if they jump to the same place,
1321 and their ranges are consecutive. */
1322 if (merge_bb
== base_bb
1323 && tree_to_double_int (CASE_LOW (merge_case
)) == bhp1
)
1325 base_high
= CASE_HIGH (merge_case
) ?
1326 CASE_HIGH (merge_case
) : CASE_LOW (merge_case
);
1327 CASE_HIGH (base_case
) = base_high
;
1328 gimple_switch_set_label (stmt
, i
, NULL_TREE
);
1337 /* Compress the case labels in the label vector, and adjust the
1338 length of the vector. */
1339 for (i
= 0, j
= 0; i
< new_size
; i
++)
1341 while (! gimple_switch_label (stmt
, j
))
1343 gimple_switch_set_label (stmt
, i
,
1344 gimple_switch_label (stmt
, j
++));
1347 gcc_assert (new_size
<= old_size
);
1348 gimple_switch_set_num_labels (stmt
, new_size
);
1351 /* Look for blocks ending in a multiway branch (a GIMPLE_SWITCH),
1352 and scan the sorted vector of cases. Combine the ones jumping to the
1356 group_case_labels (void)
1362 gimple stmt
= last_stmt (bb
);
1363 if (stmt
&& gimple_code (stmt
) == GIMPLE_SWITCH
)
1364 group_case_labels_stmt (stmt
);
1368 /* Checks whether we can merge block B into block A. */
1371 gimple_can_merge_blocks_p (basic_block a
, basic_block b
)
1374 gimple_stmt_iterator gsi
;
1376 if (!single_succ_p (a
))
1379 if (single_succ_edge (a
)->flags
& EDGE_COMPLEX
)
1382 if (single_succ (a
) != b
)
1385 if (!single_pred_p (b
))
1388 if (b
== EXIT_BLOCK_PTR
)
1391 /* If A ends by a statement causing exceptions or something similar, we
1392 cannot merge the blocks. */
1393 stmt
= last_stmt (a
);
1394 if (stmt
&& stmt_ends_bb_p (stmt
))
1397 /* Do not allow a block with only a non-local label to be merged. */
1399 && gimple_code (stmt
) == GIMPLE_LABEL
1400 && DECL_NONLOCAL (gimple_label_label (stmt
)))
1403 /* Examine the labels at the beginning of B. */
1404 for (gsi
= gsi_start_bb (b
); !gsi_end_p (gsi
); gsi_next (&gsi
))
1407 stmt
= gsi_stmt (gsi
);
1408 if (gimple_code (stmt
) != GIMPLE_LABEL
)
1410 lab
= gimple_label_label (stmt
);
1412 /* Do not remove user forced labels or for -O0 any user labels. */
1413 if (!DECL_ARTIFICIAL (lab
) && (!optimize
|| FORCED_LABEL (lab
)))
1417 /* Protect the loop latches. */
1418 if (current_loops
&& b
->loop_father
->latch
== b
)
1421 /* It must be possible to eliminate all phi nodes in B. If ssa form
1422 is not up-to-date and a name-mapping is registered, we cannot eliminate
1423 any phis. Symbols marked for renaming are never a problem though. */
1424 for (gsi
= gsi_start_phis (b
); !gsi_end_p (gsi
); gsi_next (&gsi
))
1426 gimple phi
= gsi_stmt (gsi
);
1427 /* Technically only new names matter. */
1428 if (name_registered_for_update_p (PHI_RESULT (phi
)))
1432 /* When not optimizing, don't merge if we'd lose goto_locus. */
1434 && single_succ_edge (a
)->goto_locus
!= UNKNOWN_LOCATION
)
1436 location_t goto_locus
= single_succ_edge (a
)->goto_locus
;
1437 gimple_stmt_iterator prev
, next
;
1438 prev
= gsi_last_nondebug_bb (a
);
1439 next
= gsi_after_labels (b
);
1440 if (!gsi_end_p (next
) && is_gimple_debug (gsi_stmt (next
)))
1441 gsi_next_nondebug (&next
);
1442 if ((gsi_end_p (prev
)
1443 || gimple_location (gsi_stmt (prev
)) != goto_locus
)
1444 && (gsi_end_p (next
)
1445 || gimple_location (gsi_stmt (next
)) != goto_locus
))
1452 /* Replaces all uses of NAME by VAL. */
1455 replace_uses_by (tree name
, tree val
)
1457 imm_use_iterator imm_iter
;
1462 FOR_EACH_IMM_USE_STMT (stmt
, imm_iter
, name
)
1464 FOR_EACH_IMM_USE_ON_STMT (use
, imm_iter
)
1466 replace_exp (use
, val
);
1468 if (gimple_code (stmt
) == GIMPLE_PHI
)
1470 e
= gimple_phi_arg_edge (stmt
, PHI_ARG_INDEX_FROM_USE (use
));
1471 if (e
->flags
& EDGE_ABNORMAL
)
1473 /* This can only occur for virtual operands, since
1474 for the real ones SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name))
1475 would prevent replacement. */
1476 gcc_checking_assert (virtual_operand_p (name
));
1477 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (val
) = 1;
1482 if (gimple_code (stmt
) != GIMPLE_PHI
)
1484 gimple_stmt_iterator gsi
= gsi_for_stmt (stmt
);
1485 gimple orig_stmt
= stmt
;
1488 /* Mark the block if we changed the last stmt in it. */
1489 if (cfgcleanup_altered_bbs
1490 && stmt_ends_bb_p (stmt
))
1491 bitmap_set_bit (cfgcleanup_altered_bbs
, gimple_bb (stmt
)->index
);
1493 /* FIXME. It shouldn't be required to keep TREE_CONSTANT
1494 on ADDR_EXPRs up-to-date on GIMPLE. Propagation will
1495 only change sth from non-invariant to invariant, and only
1496 when propagating constants. */
1497 if (is_gimple_min_invariant (val
))
1498 for (i
= 0; i
< gimple_num_ops (stmt
); i
++)
1500 tree op
= gimple_op (stmt
, i
);
1501 /* Operands may be empty here. For example, the labels
1502 of a GIMPLE_COND are nulled out following the creation
1503 of the corresponding CFG edges. */
1504 if (op
&& TREE_CODE (op
) == ADDR_EXPR
)
1505 recompute_tree_invariant_for_addr_expr (op
);
1508 if (fold_stmt (&gsi
))
1509 stmt
= gsi_stmt (gsi
);
1511 if (maybe_clean_or_replace_eh_stmt (orig_stmt
, stmt
))
1512 gimple_purge_dead_eh_edges (gimple_bb (stmt
));
1518 gcc_checking_assert (has_zero_uses (name
));
1520 /* Also update the trees stored in loop structures. */
1526 FOR_EACH_LOOP (li
, loop
, 0)
1528 substitute_in_loop_info (loop
, name
, val
);
1533 /* Merge block B into block A. */
1536 gimple_merge_blocks (basic_block a
, basic_block b
)
1538 gimple_stmt_iterator last
, gsi
, psi
;
1541 fprintf (dump_file
, "Merging blocks %d and %d\n", a
->index
, b
->index
);
1543 /* Remove all single-valued PHI nodes from block B of the form
1544 V_i = PHI <V_j> by propagating V_j to all the uses of V_i. */
1545 gsi
= gsi_last_bb (a
);
1546 for (psi
= gsi_start_phis (b
); !gsi_end_p (psi
); )
1548 gimple phi
= gsi_stmt (psi
);
1549 tree def
= gimple_phi_result (phi
), use
= gimple_phi_arg_def (phi
, 0);
1551 bool may_replace_uses
= (virtual_operand_p (def
)
1552 || may_propagate_copy (def
, use
));
1554 /* In case we maintain loop closed ssa form, do not propagate arguments
1555 of loop exit phi nodes. */
1557 && loops_state_satisfies_p (LOOP_CLOSED_SSA
)
1558 && !virtual_operand_p (def
)
1559 && TREE_CODE (use
) == SSA_NAME
1560 && a
->loop_father
!= b
->loop_father
)
1561 may_replace_uses
= false;
1563 if (!may_replace_uses
)
1565 gcc_assert (!virtual_operand_p (def
));
1567 /* Note that just emitting the copies is fine -- there is no problem
1568 with ordering of phi nodes. This is because A is the single
1569 predecessor of B, therefore results of the phi nodes cannot
1570 appear as arguments of the phi nodes. */
1571 copy
= gimple_build_assign (def
, use
);
1572 gsi_insert_after (&gsi
, copy
, GSI_NEW_STMT
);
1573 remove_phi_node (&psi
, false);
1577 /* If we deal with a PHI for virtual operands, we can simply
1578 propagate these without fussing with folding or updating
1580 if (virtual_operand_p (def
))
1582 imm_use_iterator iter
;
1583 use_operand_p use_p
;
1586 FOR_EACH_IMM_USE_STMT (stmt
, iter
, def
)
1587 FOR_EACH_IMM_USE_ON_STMT (use_p
, iter
)
1588 SET_USE (use_p
, use
);
1590 if (SSA_NAME_OCCURS_IN_ABNORMAL_PHI (def
))
1591 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (use
) = 1;
1594 replace_uses_by (def
, use
);
1596 remove_phi_node (&psi
, true);
1600 /* Ensure that B follows A. */
1601 move_block_after (b
, a
);
1603 gcc_assert (single_succ_edge (a
)->flags
& EDGE_FALLTHRU
);
1604 gcc_assert (!last_stmt (a
) || !stmt_ends_bb_p (last_stmt (a
)));
1606 /* Remove labels from B and set gimple_bb to A for other statements. */
1607 for (gsi
= gsi_start_bb (b
); !gsi_end_p (gsi
);)
1609 gimple stmt
= gsi_stmt (gsi
);
1610 if (gimple_code (stmt
) == GIMPLE_LABEL
)
1612 tree label
= gimple_label_label (stmt
);
1615 gsi_remove (&gsi
, false);
1617 /* Now that we can thread computed gotos, we might have
1618 a situation where we have a forced label in block B
1619 However, the label at the start of block B might still be
1620 used in other ways (think about the runtime checking for
1621 Fortran assigned gotos). So we can not just delete the
1622 label. Instead we move the label to the start of block A. */
1623 if (FORCED_LABEL (label
))
1625 gimple_stmt_iterator dest_gsi
= gsi_start_bb (a
);
1626 gsi_insert_before (&dest_gsi
, stmt
, GSI_NEW_STMT
);
1628 /* Other user labels keep around in a form of a debug stmt. */
1629 else if (!DECL_ARTIFICIAL (label
) && MAY_HAVE_DEBUG_STMTS
)
1631 gimple dbg
= gimple_build_debug_bind (label
,
1634 gimple_debug_bind_reset_value (dbg
);
1635 gsi_insert_before (&gsi
, dbg
, GSI_SAME_STMT
);
1638 lp_nr
= EH_LANDING_PAD_NR (label
);
1641 eh_landing_pad lp
= get_eh_landing_pad_from_number (lp_nr
);
1642 lp
->post_landing_pad
= NULL
;
1647 gimple_set_bb (stmt
, a
);
1652 /* Merge the sequences. */
1653 last
= gsi_last_bb (a
);
1654 gsi_insert_seq_after (&last
, bb_seq (b
), GSI_NEW_STMT
);
1655 set_bb_seq (b
, NULL
);
1657 if (cfgcleanup_altered_bbs
)
1658 bitmap_set_bit (cfgcleanup_altered_bbs
, a
->index
);
1662 /* Return the one of two successors of BB that is not reachable by a
1663 complex edge, if there is one. Else, return BB. We use
1664 this in optimizations that use post-dominators for their heuristics,
1665 to catch the cases in C++ where function calls are involved. */
1668 single_noncomplex_succ (basic_block bb
)
1671 if (EDGE_COUNT (bb
->succs
) != 2)
1674 e0
= EDGE_SUCC (bb
, 0);
1675 e1
= EDGE_SUCC (bb
, 1);
1676 if (e0
->flags
& EDGE_COMPLEX
)
1678 if (e1
->flags
& EDGE_COMPLEX
)
1684 /* T is CALL_EXPR. Set current_function_calls_* flags. */
1687 notice_special_calls (gimple call
)
1689 int flags
= gimple_call_flags (call
);
1691 if (flags
& ECF_MAY_BE_ALLOCA
)
1692 cfun
->calls_alloca
= true;
1693 if (flags
& ECF_RETURNS_TWICE
)
1694 cfun
->calls_setjmp
= true;
1698 /* Clear flags set by notice_special_calls. Used by dead code removal
1699 to update the flags. */
1702 clear_special_calls (void)
1704 cfun
->calls_alloca
= false;
1705 cfun
->calls_setjmp
= false;
1708 /* Remove PHI nodes associated with basic block BB and all edges out of BB. */
1711 remove_phi_nodes_and_edges_for_unreachable_block (basic_block bb
)
1713 /* Since this block is no longer reachable, we can just delete all
1714 of its PHI nodes. */
1715 remove_phi_nodes (bb
);
1717 /* Remove edges to BB's successors. */
1718 while (EDGE_COUNT (bb
->succs
) > 0)
1719 remove_edge (EDGE_SUCC (bb
, 0));
1723 /* Remove statements of basic block BB. */
1726 remove_bb (basic_block bb
)
1728 gimple_stmt_iterator i
;
1732 fprintf (dump_file
, "Removing basic block %d\n", bb
->index
);
1733 if (dump_flags
& TDF_DETAILS
)
1735 dump_bb (dump_file
, bb
, 0, dump_flags
);
1736 fprintf (dump_file
, "\n");
1742 struct loop
*loop
= bb
->loop_father
;
1744 /* If a loop gets removed, clean up the information associated
1746 if (loop
->latch
== bb
1747 || loop
->header
== bb
)
1748 free_numbers_of_iterations_estimates_loop (loop
);
1751 /* Remove all the instructions in the block. */
1752 if (bb_seq (bb
) != NULL
)
1754 /* Walk backwards so as to get a chance to substitute all
1755 released DEFs into debug stmts. See
1756 eliminate_unnecessary_stmts() in tree-ssa-dce.c for more
1758 for (i
= gsi_last_bb (bb
); !gsi_end_p (i
);)
1760 gimple stmt
= gsi_stmt (i
);
1761 if (gimple_code (stmt
) == GIMPLE_LABEL
1762 && (FORCED_LABEL (gimple_label_label (stmt
))
1763 || DECL_NONLOCAL (gimple_label_label (stmt
))))
1766 gimple_stmt_iterator new_gsi
;
1768 /* A non-reachable non-local label may still be referenced.
1769 But it no longer needs to carry the extra semantics of
1771 if (DECL_NONLOCAL (gimple_label_label (stmt
)))
1773 DECL_NONLOCAL (gimple_label_label (stmt
)) = 0;
1774 FORCED_LABEL (gimple_label_label (stmt
)) = 1;
1777 new_bb
= bb
->prev_bb
;
1778 new_gsi
= gsi_start_bb (new_bb
);
1779 gsi_remove (&i
, false);
1780 gsi_insert_before (&new_gsi
, stmt
, GSI_NEW_STMT
);
1784 /* Release SSA definitions if we are in SSA. Note that we
1785 may be called when not in SSA. For example,
1786 final_cleanup calls this function via
1787 cleanup_tree_cfg. */
1788 if (gimple_in_ssa_p (cfun
))
1789 release_defs (stmt
);
1791 gsi_remove (&i
, true);
1795 i
= gsi_last_bb (bb
);
1801 remove_phi_nodes_and_edges_for_unreachable_block (bb
);
1802 bb
->il
.gimple
.seq
= NULL
;
1803 bb
->il
.gimple
.phi_nodes
= NULL
;
1807 /* Given a basic block BB ending with COND_EXPR or SWITCH_EXPR, and a
1808 predicate VAL, return the edge that will be taken out of the block.
1809 If VAL does not match a unique edge, NULL is returned. */
1812 find_taken_edge (basic_block bb
, tree val
)
1816 stmt
= last_stmt (bb
);
1819 gcc_assert (is_ctrl_stmt (stmt
));
1824 if (!is_gimple_min_invariant (val
))
1827 if (gimple_code (stmt
) == GIMPLE_COND
)
1828 return find_taken_edge_cond_expr (bb
, val
);
1830 if (gimple_code (stmt
) == GIMPLE_SWITCH
)
1831 return find_taken_edge_switch_expr (bb
, val
);
1833 if (computed_goto_p (stmt
))
1835 /* Only optimize if the argument is a label, if the argument is
1836 not a label then we can not construct a proper CFG.
1838 It may be the case that we only need to allow the LABEL_REF to
1839 appear inside an ADDR_EXPR, but we also allow the LABEL_REF to
1840 appear inside a LABEL_EXPR just to be safe. */
1841 if ((TREE_CODE (val
) == ADDR_EXPR
|| TREE_CODE (val
) == LABEL_EXPR
)
1842 && TREE_CODE (TREE_OPERAND (val
, 0)) == LABEL_DECL
)
1843 return find_taken_edge_computed_goto (bb
, TREE_OPERAND (val
, 0));
1850 /* Given a constant value VAL and the entry block BB to a GOTO_EXPR
1851 statement, determine which of the outgoing edges will be taken out of the
1852 block. Return NULL if either edge may be taken. */
1855 find_taken_edge_computed_goto (basic_block bb
, tree val
)
1860 dest
= label_to_block (val
);
1863 e
= find_edge (bb
, dest
);
1864 gcc_assert (e
!= NULL
);
1870 /* Given a constant value VAL and the entry block BB to a COND_EXPR
1871 statement, determine which of the two edges will be taken out of the
1872 block. Return NULL if either edge may be taken. */
1875 find_taken_edge_cond_expr (basic_block bb
, tree val
)
1877 edge true_edge
, false_edge
;
1879 extract_true_false_edges_from_block (bb
, &true_edge
, &false_edge
);
1881 gcc_assert (TREE_CODE (val
) == INTEGER_CST
);
1882 return (integer_zerop (val
) ? false_edge
: true_edge
);
1885 /* Given an INTEGER_CST VAL and the entry block BB to a SWITCH_EXPR
1886 statement, determine which edge will be taken out of the block. Return
1887 NULL if any edge may be taken. */
1890 find_taken_edge_switch_expr (basic_block bb
, tree val
)
1892 basic_block dest_bb
;
1897 switch_stmt
= last_stmt (bb
);
1898 taken_case
= find_case_label_for_value (switch_stmt
, val
);
1899 dest_bb
= label_to_block (CASE_LABEL (taken_case
));
1901 e
= find_edge (bb
, dest_bb
);
1907 /* Return the CASE_LABEL_EXPR that SWITCH_STMT will take for VAL.
1908 We can make optimal use here of the fact that the case labels are
1909 sorted: We can do a binary search for a case matching VAL. */
1912 find_case_label_for_value (gimple switch_stmt
, tree val
)
1914 size_t low
, high
, n
= gimple_switch_num_labels (switch_stmt
);
1915 tree default_case
= gimple_switch_default_label (switch_stmt
);
1917 for (low
= 0, high
= n
; high
- low
> 1; )
1919 size_t i
= (high
+ low
) / 2;
1920 tree t
= gimple_switch_label (switch_stmt
, i
);
1923 /* Cache the result of comparing CASE_LOW and val. */
1924 cmp
= tree_int_cst_compare (CASE_LOW (t
), val
);
1931 if (CASE_HIGH (t
) == NULL
)
1933 /* A singe-valued case label. */
1939 /* A case range. We can only handle integer ranges. */
1940 if (cmp
<= 0 && tree_int_cst_compare (CASE_HIGH (t
), val
) >= 0)
1945 return default_case
;
1949 /* Dump a basic block on stderr. */
1952 gimple_debug_bb (basic_block bb
)
1954 dump_bb (stderr
, bb
, 0, TDF_VOPS
|TDF_MEMSYMS
|TDF_BLOCKS
);
1958 /* Dump basic block with index N on stderr. */
1961 gimple_debug_bb_n (int n
)
1963 gimple_debug_bb (BASIC_BLOCK (n
));
1964 return BASIC_BLOCK (n
);
1968 /* Dump the CFG on stderr.
1970 FLAGS are the same used by the tree dumping functions
1971 (see TDF_* in dumpfile.h). */
1974 gimple_debug_cfg (int flags
)
1976 gimple_dump_cfg (stderr
, flags
);
1980 /* Dump the program showing basic block boundaries on the given FILE.
1982 FLAGS are the same used by the tree dumping functions (see TDF_* in
1986 gimple_dump_cfg (FILE *file
, int flags
)
1988 if (flags
& TDF_DETAILS
)
1990 dump_function_header (file
, current_function_decl
, flags
);
1991 fprintf (file
, ";; \n%d basic blocks, %d edges, last basic block %d.\n\n",
1992 n_basic_blocks
, n_edges
, last_basic_block
);
1994 brief_dump_cfg (file
, flags
| TDF_COMMENT
);
1995 fprintf (file
, "\n");
1998 if (flags
& TDF_STATS
)
1999 dump_cfg_stats (file
);
2001 dump_function_to_file (current_function_decl
, file
, flags
| TDF_BLOCKS
);
2005 /* Dump CFG statistics on FILE. */
2008 dump_cfg_stats (FILE *file
)
2010 static long max_num_merged_labels
= 0;
2011 unsigned long size
, total
= 0;
2014 const char * const fmt_str
= "%-30s%-13s%12s\n";
2015 const char * const fmt_str_1
= "%-30s%13d%11lu%c\n";
2016 const char * const fmt_str_2
= "%-30s%13ld%11lu%c\n";
2017 const char * const fmt_str_3
= "%-43s%11lu%c\n";
2018 const char *funcname
= current_function_name ();
2020 fprintf (file
, "\nCFG Statistics for %s\n\n", funcname
);
2022 fprintf (file
, "---------------------------------------------------------\n");
2023 fprintf (file
, fmt_str
, "", " Number of ", "Memory");
2024 fprintf (file
, fmt_str
, "", " instances ", "used ");
2025 fprintf (file
, "---------------------------------------------------------\n");
2027 size
= n_basic_blocks
* sizeof (struct basic_block_def
);
2029 fprintf (file
, fmt_str_1
, "Basic blocks", n_basic_blocks
,
2030 SCALE (size
), LABEL (size
));
2034 num_edges
+= EDGE_COUNT (bb
->succs
);
2035 size
= num_edges
* sizeof (struct edge_def
);
2037 fprintf (file
, fmt_str_2
, "Edges", num_edges
, SCALE (size
), LABEL (size
));
2039 fprintf (file
, "---------------------------------------------------------\n");
2040 fprintf (file
, fmt_str_3
, "Total memory used by CFG data", SCALE (total
),
2042 fprintf (file
, "---------------------------------------------------------\n");
2043 fprintf (file
, "\n");
2045 if (cfg_stats
.num_merged_labels
> max_num_merged_labels
)
2046 max_num_merged_labels
= cfg_stats
.num_merged_labels
;
2048 fprintf (file
, "Coalesced label blocks: %ld (Max so far: %ld)\n",
2049 cfg_stats
.num_merged_labels
, max_num_merged_labels
);
2051 fprintf (file
, "\n");
2055 /* Dump CFG statistics on stderr. Keep extern so that it's always
2056 linked in the final executable. */
2059 debug_cfg_stats (void)
2061 dump_cfg_stats (stderr
);
2064 /*---------------------------------------------------------------------------
2065 Miscellaneous helpers
2066 ---------------------------------------------------------------------------*/
2068 /* Return true if T, a GIMPLE_CALL, can make an abnormal transfer of control
2069 flow. Transfers of control flow associated with EH are excluded. */
2072 call_can_make_abnormal_goto (gimple t
)
2074 /* If the function has no non-local labels, then a call cannot make an
2075 abnormal transfer of control. */
2076 if (!cfun
->has_nonlocal_label
2077 && !cfun
->calls_setjmp
)
2080 /* Likewise if the call has no side effects. */
2081 if (!gimple_has_side_effects (t
))
2084 /* Likewise if the called function is leaf. */
2085 if (gimple_call_flags (t
) & ECF_LEAF
)
2092 /* Return true if T can make an abnormal transfer of control flow.
2093 Transfers of control flow associated with EH are excluded. */
2096 stmt_can_make_abnormal_goto (gimple t
)
2098 if (computed_goto_p (t
))
2100 if (is_gimple_call (t
))
2101 return call_can_make_abnormal_goto (t
);
2106 /* Return true if T represents a stmt that always transfers control. */
2109 is_ctrl_stmt (gimple t
)
2111 switch (gimple_code (t
))
2125 /* Return true if T is a statement that may alter the flow of control
2126 (e.g., a call to a non-returning function). */
2129 is_ctrl_altering_stmt (gimple t
)
2133 switch (gimple_code (t
))
2137 int flags
= gimple_call_flags (t
);
2139 /* A call alters control flow if it can make an abnormal goto. */
2140 if (call_can_make_abnormal_goto (t
))
2143 /* A call also alters control flow if it does not return. */
2144 if (flags
& ECF_NORETURN
)
2147 /* TM ending statements have backedges out of the transaction.
2148 Return true so we split the basic block containing them.
2149 Note that the TM_BUILTIN test is merely an optimization. */
2150 if ((flags
& ECF_TM_BUILTIN
)
2151 && is_tm_ending_fndecl (gimple_call_fndecl (t
)))
2154 /* BUILT_IN_RETURN call is same as return statement. */
2155 if (gimple_call_builtin_p (t
, BUILT_IN_RETURN
))
2160 case GIMPLE_EH_DISPATCH
:
2161 /* EH_DISPATCH branches to the individual catch handlers at
2162 this level of a try or allowed-exceptions region. It can
2163 fallthru to the next statement as well. */
2167 if (gimple_asm_nlabels (t
) > 0)
2172 /* OpenMP directives alter control flow. */
2175 case GIMPLE_TRANSACTION
:
2176 /* A transaction start alters control flow. */
2183 /* If a statement can throw, it alters control flow. */
2184 return stmt_can_throw_internal (t
);
2188 /* Return true if T is a simple local goto. */
2191 simple_goto_p (gimple t
)
2193 return (gimple_code (t
) == GIMPLE_GOTO
2194 && TREE_CODE (gimple_goto_dest (t
)) == LABEL_DECL
);
2198 /* Return true if STMT should start a new basic block. PREV_STMT is
2199 the statement preceding STMT. It is used when STMT is a label or a
2200 case label. Labels should only start a new basic block if their
2201 previous statement wasn't a label. Otherwise, sequence of labels
2202 would generate unnecessary basic blocks that only contain a single
2206 stmt_starts_bb_p (gimple stmt
, gimple prev_stmt
)
2211 /* Labels start a new basic block only if the preceding statement
2212 wasn't a label of the same type. This prevents the creation of
2213 consecutive blocks that have nothing but a single label. */
2214 if (gimple_code (stmt
) == GIMPLE_LABEL
)
2216 /* Nonlocal and computed GOTO targets always start a new block. */
2217 if (DECL_NONLOCAL (gimple_label_label (stmt
))
2218 || FORCED_LABEL (gimple_label_label (stmt
)))
2221 if (prev_stmt
&& gimple_code (prev_stmt
) == GIMPLE_LABEL
)
2223 if (DECL_NONLOCAL (gimple_label_label (prev_stmt
)))
2226 cfg_stats
.num_merged_labels
++;
2232 else if (gimple_code (stmt
) == GIMPLE_CALL
2233 && gimple_call_flags (stmt
) & ECF_RETURNS_TWICE
)
2234 /* setjmp acts similar to a nonlocal GOTO target and thus should
2235 start a new block. */
2242 /* Return true if T should end a basic block. */
2245 stmt_ends_bb_p (gimple t
)
2247 return is_ctrl_stmt (t
) || is_ctrl_altering_stmt (t
);
2250 /* Remove block annotations and other data structures. */
2253 delete_tree_cfg_annotations (void)
2255 vec_free (label_to_block_map
);
2259 /* Return the first statement in basic block BB. */
2262 first_stmt (basic_block bb
)
2264 gimple_stmt_iterator i
= gsi_start_bb (bb
);
2267 while (!gsi_end_p (i
) && is_gimple_debug ((stmt
= gsi_stmt (i
))))
2275 /* Return the first non-label statement in basic block BB. */
2278 first_non_label_stmt (basic_block bb
)
2280 gimple_stmt_iterator i
= gsi_start_bb (bb
);
2281 while (!gsi_end_p (i
) && gimple_code (gsi_stmt (i
)) == GIMPLE_LABEL
)
2283 return !gsi_end_p (i
) ? gsi_stmt (i
) : NULL
;
2286 /* Return the last statement in basic block BB. */
2289 last_stmt (basic_block bb
)
2291 gimple_stmt_iterator i
= gsi_last_bb (bb
);
2294 while (!gsi_end_p (i
) && is_gimple_debug ((stmt
= gsi_stmt (i
))))
2302 /* Return the last statement of an otherwise empty block. Return NULL
2303 if the block is totally empty, or if it contains more than one
2307 last_and_only_stmt (basic_block bb
)
2309 gimple_stmt_iterator i
= gsi_last_nondebug_bb (bb
);
2315 last
= gsi_stmt (i
);
2316 gsi_prev_nondebug (&i
);
2320 /* Empty statements should no longer appear in the instruction stream.
2321 Everything that might have appeared before should be deleted by
2322 remove_useless_stmts, and the optimizers should just gsi_remove
2323 instead of smashing with build_empty_stmt.
2325 Thus the only thing that should appear here in a block containing
2326 one executable statement is a label. */
2327 prev
= gsi_stmt (i
);
2328 if (gimple_code (prev
) == GIMPLE_LABEL
)
2334 /* Reinstall those PHI arguments queued in OLD_EDGE to NEW_EDGE. */
2337 reinstall_phi_args (edge new_edge
, edge old_edge
)
2339 edge_var_map_vector
*v
;
2342 gimple_stmt_iterator phis
;
2344 v
= redirect_edge_var_map_vector (old_edge
);
2348 for (i
= 0, phis
= gsi_start_phis (new_edge
->dest
);
2349 v
->iterate (i
, &vm
) && !gsi_end_p (phis
);
2350 i
++, gsi_next (&phis
))
2352 gimple phi
= gsi_stmt (phis
);
2353 tree result
= redirect_edge_var_map_result (vm
);
2354 tree arg
= redirect_edge_var_map_def (vm
);
2356 gcc_assert (result
== gimple_phi_result (phi
));
2358 add_phi_arg (phi
, arg
, new_edge
, redirect_edge_var_map_location (vm
));
2361 redirect_edge_var_map_clear (old_edge
);
2364 /* Returns the basic block after which the new basic block created
2365 by splitting edge EDGE_IN should be placed. Tries to keep the new block
2366 near its "logical" location. This is of most help to humans looking
2367 at debugging dumps. */
2370 split_edge_bb_loc (edge edge_in
)
2372 basic_block dest
= edge_in
->dest
;
2373 basic_block dest_prev
= dest
->prev_bb
;
2377 edge e
= find_edge (dest_prev
, dest
);
2378 if (e
&& !(e
->flags
& EDGE_COMPLEX
))
2379 return edge_in
->src
;
2384 /* Split a (typically critical) edge EDGE_IN. Return the new block.
2385 Abort on abnormal edges. */
2388 gimple_split_edge (edge edge_in
)
2390 basic_block new_bb
, after_bb
, dest
;
2393 /* Abnormal edges cannot be split. */
2394 gcc_assert (!(edge_in
->flags
& EDGE_ABNORMAL
));
2396 dest
= edge_in
->dest
;
2398 after_bb
= split_edge_bb_loc (edge_in
);
2400 new_bb
= create_empty_bb (after_bb
);
2401 new_bb
->frequency
= EDGE_FREQUENCY (edge_in
);
2402 new_bb
->count
= edge_in
->count
;
2403 new_edge
= make_edge (new_bb
, dest
, EDGE_FALLTHRU
);
2404 new_edge
->probability
= REG_BR_PROB_BASE
;
2405 new_edge
->count
= edge_in
->count
;
2407 e
= redirect_edge_and_branch (edge_in
, new_bb
);
2408 gcc_assert (e
== edge_in
);
2409 reinstall_phi_args (new_edge
, e
);
2415 /* Verify properties of the address expression T with base object BASE. */
2418 verify_address (tree t
, tree base
)
2421 bool old_side_effects
;
2423 bool new_side_effects
;
2425 old_constant
= TREE_CONSTANT (t
);
2426 old_side_effects
= TREE_SIDE_EFFECTS (t
);
2428 recompute_tree_invariant_for_addr_expr (t
);
2429 new_side_effects
= TREE_SIDE_EFFECTS (t
);
2430 new_constant
= TREE_CONSTANT (t
);
2432 if (old_constant
!= new_constant
)
2434 error ("constant not recomputed when ADDR_EXPR changed");
2437 if (old_side_effects
!= new_side_effects
)
2439 error ("side effects not recomputed when ADDR_EXPR changed");
2443 if (!(TREE_CODE (base
) == VAR_DECL
2444 || TREE_CODE (base
) == PARM_DECL
2445 || TREE_CODE (base
) == RESULT_DECL
))
2448 if (DECL_GIMPLE_REG_P (base
))
2450 error ("DECL_GIMPLE_REG_P set on a variable with address taken");
2457 /* Callback for walk_tree, check that all elements with address taken are
2458 properly noticed as such. The DATA is an int* that is 1 if TP was seen
2459 inside a PHI node. */
2462 verify_expr (tree
*tp
, int *walk_subtrees
, void *data ATTRIBUTE_UNUSED
)
2469 /* Check operand N for being valid GIMPLE and give error MSG if not. */
2470 #define CHECK_OP(N, MSG) \
2471 do { if (!is_gimple_val (TREE_OPERAND (t, N))) \
2472 { error (MSG); return TREE_OPERAND (t, N); }} while (0)
2474 switch (TREE_CODE (t
))
2477 if (SSA_NAME_IN_FREE_LIST (t
))
2479 error ("SSA name in freelist but still referenced");
2485 error ("INDIRECT_REF in gimple IL");
2489 x
= TREE_OPERAND (t
, 0);
2490 if (!POINTER_TYPE_P (TREE_TYPE (x
))
2491 || !is_gimple_mem_ref_addr (x
))
2493 error ("invalid first operand of MEM_REF");
2496 if (TREE_CODE (TREE_OPERAND (t
, 1)) != INTEGER_CST
2497 || !POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (t
, 1))))
2499 error ("invalid offset operand of MEM_REF");
2500 return TREE_OPERAND (t
, 1);
2502 if (TREE_CODE (x
) == ADDR_EXPR
2503 && (x
= verify_address (x
, TREE_OPERAND (x
, 0))))
2509 x
= fold (ASSERT_EXPR_COND (t
));
2510 if (x
== boolean_false_node
)
2512 error ("ASSERT_EXPR with an always-false condition");
2518 error ("MODIFY_EXPR not expected while having tuples");
2525 gcc_assert (is_gimple_address (t
));
2527 /* Skip any references (they will be checked when we recurse down the
2528 tree) and ensure that any variable used as a prefix is marked
2530 for (x
= TREE_OPERAND (t
, 0);
2531 handled_component_p (x
);
2532 x
= TREE_OPERAND (x
, 0))
2535 if ((tem
= verify_address (t
, x
)))
2538 if (!(TREE_CODE (x
) == VAR_DECL
2539 || TREE_CODE (x
) == PARM_DECL
2540 || TREE_CODE (x
) == RESULT_DECL
))
2543 if (!TREE_ADDRESSABLE (x
))
2545 error ("address taken, but ADDRESSABLE bit not set");
2553 x
= COND_EXPR_COND (t
);
2554 if (!INTEGRAL_TYPE_P (TREE_TYPE (x
)))
2556 error ("non-integral used in condition");
2559 if (!is_gimple_condexpr (x
))
2561 error ("invalid conditional operand");
2566 case NON_LVALUE_EXPR
:
2567 case TRUTH_NOT_EXPR
:
2571 case FIX_TRUNC_EXPR
:
2576 CHECK_OP (0, "invalid operand to unary operator");
2582 if (!is_gimple_reg_type (TREE_TYPE (t
)))
2584 error ("non-scalar BIT_FIELD_REF, IMAGPART_EXPR or REALPART_EXPR");
2588 if (TREE_CODE (t
) == BIT_FIELD_REF
)
2590 if (!host_integerp (TREE_OPERAND (t
, 1), 1)
2591 || !host_integerp (TREE_OPERAND (t
, 2), 1))
2593 error ("invalid position or size operand to BIT_FIELD_REF");
2596 if (INTEGRAL_TYPE_P (TREE_TYPE (t
))
2597 && (TYPE_PRECISION (TREE_TYPE (t
))
2598 != TREE_INT_CST_LOW (TREE_OPERAND (t
, 1))))
2600 error ("integral result type precision does not match "
2601 "field size of BIT_FIELD_REF");
2604 else if (!INTEGRAL_TYPE_P (TREE_TYPE (t
))
2605 && TYPE_MODE (TREE_TYPE (t
)) != BLKmode
2606 && (GET_MODE_PRECISION (TYPE_MODE (TREE_TYPE (t
)))
2607 != TREE_INT_CST_LOW (TREE_OPERAND (t
, 1))))
2609 error ("mode precision of non-integral result does not "
2610 "match field size of BIT_FIELD_REF");
2614 t
= TREE_OPERAND (t
, 0);
2619 case ARRAY_RANGE_REF
:
2620 case VIEW_CONVERT_EXPR
:
2621 /* We have a nest of references. Verify that each of the operands
2622 that determine where to reference is either a constant or a variable,
2623 verify that the base is valid, and then show we've already checked
2625 while (handled_component_p (t
))
2627 if (TREE_CODE (t
) == COMPONENT_REF
&& TREE_OPERAND (t
, 2))
2628 CHECK_OP (2, "invalid COMPONENT_REF offset operator");
2629 else if (TREE_CODE (t
) == ARRAY_REF
2630 || TREE_CODE (t
) == ARRAY_RANGE_REF
)
2632 CHECK_OP (1, "invalid array index");
2633 if (TREE_OPERAND (t
, 2))
2634 CHECK_OP (2, "invalid array lower bound");
2635 if (TREE_OPERAND (t
, 3))
2636 CHECK_OP (3, "invalid array stride");
2638 else if (TREE_CODE (t
) == BIT_FIELD_REF
2639 || TREE_CODE (t
) == REALPART_EXPR
2640 || TREE_CODE (t
) == IMAGPART_EXPR
)
2642 error ("non-top-level BIT_FIELD_REF, IMAGPART_EXPR or "
2647 t
= TREE_OPERAND (t
, 0);
2650 if (!is_gimple_min_invariant (t
) && !is_gimple_lvalue (t
))
2652 error ("invalid reference prefix");
2659 /* PLUS_EXPR and MINUS_EXPR don't work on pointers, they should be done using
2660 POINTER_PLUS_EXPR. */
2661 if (POINTER_TYPE_P (TREE_TYPE (t
)))
2663 error ("invalid operand to plus/minus, type is a pointer");
2666 CHECK_OP (0, "invalid operand to binary operator");
2667 CHECK_OP (1, "invalid operand to binary operator");
2670 case POINTER_PLUS_EXPR
:
2671 /* Check to make sure the first operand is a pointer or reference type. */
2672 if (!POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (t
, 0))))
2674 error ("invalid operand to pointer plus, first operand is not a pointer");
2677 /* Check to make sure the second operand is a ptrofftype. */
2678 if (!ptrofftype_p (TREE_TYPE (TREE_OPERAND (t
, 1))))
2680 error ("invalid operand to pointer plus, second operand is not an "
2681 "integer type of appropriate width");
2691 case UNORDERED_EXPR
:
2700 case TRUNC_DIV_EXPR
:
2702 case FLOOR_DIV_EXPR
:
2703 case ROUND_DIV_EXPR
:
2704 case TRUNC_MOD_EXPR
:
2706 case FLOOR_MOD_EXPR
:
2707 case ROUND_MOD_EXPR
:
2709 case EXACT_DIV_EXPR
:
2719 CHECK_OP (0, "invalid operand to binary operator");
2720 CHECK_OP (1, "invalid operand to binary operator");
2724 if (TREE_CONSTANT (t
) && TREE_CODE (TREE_TYPE (t
)) == VECTOR_TYPE
)
2728 case CASE_LABEL_EXPR
:
2731 error ("invalid CASE_CHAIN");
2745 /* Verify if EXPR is either a GIMPLE ID or a GIMPLE indirect reference.
2746 Returns true if there is an error, otherwise false. */
2749 verify_types_in_gimple_min_lval (tree expr
)
2753 if (is_gimple_id (expr
))
2756 if (TREE_CODE (expr
) != TARGET_MEM_REF
2757 && TREE_CODE (expr
) != MEM_REF
)
2759 error ("invalid expression for min lvalue");
2763 /* TARGET_MEM_REFs are strange beasts. */
2764 if (TREE_CODE (expr
) == TARGET_MEM_REF
)
2767 op
= TREE_OPERAND (expr
, 0);
2768 if (!is_gimple_val (op
))
2770 error ("invalid operand in indirect reference");
2771 debug_generic_stmt (op
);
2774 /* Memory references now generally can involve a value conversion. */
2779 /* Verify if EXPR is a valid GIMPLE reference expression. If
2780 REQUIRE_LVALUE is true verifies it is an lvalue. Returns true
2781 if there is an error, otherwise false. */
2784 verify_types_in_gimple_reference (tree expr
, bool require_lvalue
)
2786 while (handled_component_p (expr
))
2788 tree op
= TREE_OPERAND (expr
, 0);
2790 if (TREE_CODE (expr
) == ARRAY_REF
2791 || TREE_CODE (expr
) == ARRAY_RANGE_REF
)
2793 if (!is_gimple_val (TREE_OPERAND (expr
, 1))
2794 || (TREE_OPERAND (expr
, 2)
2795 && !is_gimple_val (TREE_OPERAND (expr
, 2)))
2796 || (TREE_OPERAND (expr
, 3)
2797 && !is_gimple_val (TREE_OPERAND (expr
, 3))))
2799 error ("invalid operands to array reference");
2800 debug_generic_stmt (expr
);
2805 /* Verify if the reference array element types are compatible. */
2806 if (TREE_CODE (expr
) == ARRAY_REF
2807 && !useless_type_conversion_p (TREE_TYPE (expr
),
2808 TREE_TYPE (TREE_TYPE (op
))))
2810 error ("type mismatch in array reference");
2811 debug_generic_stmt (TREE_TYPE (expr
));
2812 debug_generic_stmt (TREE_TYPE (TREE_TYPE (op
)));
2815 if (TREE_CODE (expr
) == ARRAY_RANGE_REF
2816 && !useless_type_conversion_p (TREE_TYPE (TREE_TYPE (expr
)),
2817 TREE_TYPE (TREE_TYPE (op
))))
2819 error ("type mismatch in array range reference");
2820 debug_generic_stmt (TREE_TYPE (TREE_TYPE (expr
)));
2821 debug_generic_stmt (TREE_TYPE (TREE_TYPE (op
)));
2825 if ((TREE_CODE (expr
) == REALPART_EXPR
2826 || TREE_CODE (expr
) == IMAGPART_EXPR
)
2827 && !useless_type_conversion_p (TREE_TYPE (expr
),
2828 TREE_TYPE (TREE_TYPE (op
))))
2830 error ("type mismatch in real/imagpart reference");
2831 debug_generic_stmt (TREE_TYPE (expr
));
2832 debug_generic_stmt (TREE_TYPE (TREE_TYPE (op
)));
2836 if (TREE_CODE (expr
) == COMPONENT_REF
2837 && !useless_type_conversion_p (TREE_TYPE (expr
),
2838 TREE_TYPE (TREE_OPERAND (expr
, 1))))
2840 error ("type mismatch in component reference");
2841 debug_generic_stmt (TREE_TYPE (expr
));
2842 debug_generic_stmt (TREE_TYPE (TREE_OPERAND (expr
, 1)));
2846 if (TREE_CODE (expr
) == VIEW_CONVERT_EXPR
)
2848 /* For VIEW_CONVERT_EXPRs which are allowed here too, we only check
2849 that their operand is not an SSA name or an invariant when
2850 requiring an lvalue (this usually means there is a SRA or IPA-SRA
2851 bug). Otherwise there is nothing to verify, gross mismatches at
2852 most invoke undefined behavior. */
2854 && (TREE_CODE (op
) == SSA_NAME
2855 || is_gimple_min_invariant (op
)))
2857 error ("conversion of an SSA_NAME on the left hand side");
2858 debug_generic_stmt (expr
);
2861 else if (TREE_CODE (op
) == SSA_NAME
2862 && TYPE_SIZE (TREE_TYPE (expr
)) != TYPE_SIZE (TREE_TYPE (op
)))
2864 error ("conversion of register to a different size");
2865 debug_generic_stmt (expr
);
2868 else if (!handled_component_p (op
))
2875 if (TREE_CODE (expr
) == MEM_REF
)
2877 if (!is_gimple_mem_ref_addr (TREE_OPERAND (expr
, 0)))
2879 error ("invalid address operand in MEM_REF");
2880 debug_generic_stmt (expr
);
2883 if (TREE_CODE (TREE_OPERAND (expr
, 1)) != INTEGER_CST
2884 || !POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (expr
, 1))))
2886 error ("invalid offset operand in MEM_REF");
2887 debug_generic_stmt (expr
);
2891 else if (TREE_CODE (expr
) == TARGET_MEM_REF
)
2893 if (!TMR_BASE (expr
)
2894 || !is_gimple_mem_ref_addr (TMR_BASE (expr
)))
2896 error ("invalid address operand in TARGET_MEM_REF");
2899 if (!TMR_OFFSET (expr
)
2900 || TREE_CODE (TMR_OFFSET (expr
)) != INTEGER_CST
2901 || !POINTER_TYPE_P (TREE_TYPE (TMR_OFFSET (expr
))))
2903 error ("invalid offset operand in TARGET_MEM_REF");
2904 debug_generic_stmt (expr
);
2909 return ((require_lvalue
|| !is_gimple_min_invariant (expr
))
2910 && verify_types_in_gimple_min_lval (expr
));
2913 /* Returns true if there is one pointer type in TYPE_POINTER_TO (SRC_OBJ)
2914 list of pointer-to types that is trivially convertible to DEST. */
2917 one_pointer_to_useless_type_conversion_p (tree dest
, tree src_obj
)
2921 if (!TYPE_POINTER_TO (src_obj
))
2924 for (src
= TYPE_POINTER_TO (src_obj
); src
; src
= TYPE_NEXT_PTR_TO (src
))
2925 if (useless_type_conversion_p (dest
, src
))
2931 /* Return true if TYPE1 is a fixed-point type and if conversions to and
2932 from TYPE2 can be handled by FIXED_CONVERT_EXPR. */
2935 valid_fixed_convert_types_p (tree type1
, tree type2
)
2937 return (FIXED_POINT_TYPE_P (type1
)
2938 && (INTEGRAL_TYPE_P (type2
)
2939 || SCALAR_FLOAT_TYPE_P (type2
)
2940 || FIXED_POINT_TYPE_P (type2
)));
2943 /* Verify the contents of a GIMPLE_CALL STMT. Returns true when there
2944 is a problem, otherwise false. */
2947 verify_gimple_call (gimple stmt
)
2949 tree fn
= gimple_call_fn (stmt
);
2950 tree fntype
, fndecl
;
2953 if (gimple_call_internal_p (stmt
))
2957 error ("gimple call has two targets");
2958 debug_generic_stmt (fn
);
2966 error ("gimple call has no target");
2971 if (fn
&& !is_gimple_call_addr (fn
))
2973 error ("invalid function in gimple call");
2974 debug_generic_stmt (fn
);
2979 && (!POINTER_TYPE_P (TREE_TYPE (fn
))
2980 || (TREE_CODE (TREE_TYPE (TREE_TYPE (fn
))) != FUNCTION_TYPE
2981 && TREE_CODE (TREE_TYPE (TREE_TYPE (fn
))) != METHOD_TYPE
)))
2983 error ("non-function in gimple call");
2987 fndecl
= gimple_call_fndecl (stmt
);
2989 && TREE_CODE (fndecl
) == FUNCTION_DECL
2990 && DECL_LOOPING_CONST_OR_PURE_P (fndecl
)
2991 && !DECL_PURE_P (fndecl
)
2992 && !TREE_READONLY (fndecl
))
2994 error ("invalid pure const state for function");
2998 if (gimple_call_lhs (stmt
)
2999 && (!is_gimple_lvalue (gimple_call_lhs (stmt
))
3000 || verify_types_in_gimple_reference (gimple_call_lhs (stmt
), true)))
3002 error ("invalid LHS in gimple call");
3006 if (gimple_call_lhs (stmt
) && gimple_call_noreturn_p (stmt
))
3008 error ("LHS in noreturn call");
3012 fntype
= gimple_call_fntype (stmt
);
3014 && gimple_call_lhs (stmt
)
3015 && !useless_type_conversion_p (TREE_TYPE (gimple_call_lhs (stmt
)),
3017 /* ??? At least C++ misses conversions at assignments from
3018 void * call results.
3019 ??? Java is completely off. Especially with functions
3020 returning java.lang.Object.
3021 For now simply allow arbitrary pointer type conversions. */
3022 && !(POINTER_TYPE_P (TREE_TYPE (gimple_call_lhs (stmt
)))
3023 && POINTER_TYPE_P (TREE_TYPE (fntype
))))
3025 error ("invalid conversion in gimple call");
3026 debug_generic_stmt (TREE_TYPE (gimple_call_lhs (stmt
)));
3027 debug_generic_stmt (TREE_TYPE (fntype
));
3031 if (gimple_call_chain (stmt
)
3032 && !is_gimple_val (gimple_call_chain (stmt
)))
3034 error ("invalid static chain in gimple call");
3035 debug_generic_stmt (gimple_call_chain (stmt
));
3039 /* If there is a static chain argument, this should not be an indirect
3040 call, and the decl should have DECL_STATIC_CHAIN set. */
3041 if (gimple_call_chain (stmt
))
3043 if (!gimple_call_fndecl (stmt
))
3045 error ("static chain in indirect gimple call");
3048 fn
= TREE_OPERAND (fn
, 0);
3050 if (!DECL_STATIC_CHAIN (fn
))
3052 error ("static chain with function that doesn%'t use one");
3057 /* ??? The C frontend passes unpromoted arguments in case it
3058 didn't see a function declaration before the call. So for now
3059 leave the call arguments mostly unverified. Once we gimplify
3060 unit-at-a-time we have a chance to fix this. */
3062 for (i
= 0; i
< gimple_call_num_args (stmt
); ++i
)
3064 tree arg
= gimple_call_arg (stmt
, i
);
3065 if ((is_gimple_reg_type (TREE_TYPE (arg
))
3066 && !is_gimple_val (arg
))
3067 || (!is_gimple_reg_type (TREE_TYPE (arg
))
3068 && !is_gimple_lvalue (arg
)))
3070 error ("invalid argument to gimple call");
3071 debug_generic_expr (arg
);
3079 /* Verifies the gimple comparison with the result type TYPE and
3080 the operands OP0 and OP1. */
3083 verify_gimple_comparison (tree type
, tree op0
, tree op1
)
3085 tree op0_type
= TREE_TYPE (op0
);
3086 tree op1_type
= TREE_TYPE (op1
);
3088 if (!is_gimple_val (op0
) || !is_gimple_val (op1
))
3090 error ("invalid operands in gimple comparison");
3094 /* For comparisons we do not have the operations type as the
3095 effective type the comparison is carried out in. Instead
3096 we require that either the first operand is trivially
3097 convertible into the second, or the other way around.
3098 Because we special-case pointers to void we allow
3099 comparisons of pointers with the same mode as well. */
3100 if (!useless_type_conversion_p (op0_type
, op1_type
)
3101 && !useless_type_conversion_p (op1_type
, op0_type
)
3102 && (!POINTER_TYPE_P (op0_type
)
3103 || !POINTER_TYPE_P (op1_type
)
3104 || TYPE_MODE (op0_type
) != TYPE_MODE (op1_type
)))
3106 error ("mismatching comparison operand types");
3107 debug_generic_expr (op0_type
);
3108 debug_generic_expr (op1_type
);
3112 /* The resulting type of a comparison may be an effective boolean type. */
3113 if (INTEGRAL_TYPE_P (type
)
3114 && (TREE_CODE (type
) == BOOLEAN_TYPE
3115 || TYPE_PRECISION (type
) == 1))
3117 if (TREE_CODE (op0_type
) == VECTOR_TYPE
3118 || TREE_CODE (op1_type
) == VECTOR_TYPE
)
3120 error ("vector comparison returning a boolean");
3121 debug_generic_expr (op0_type
);
3122 debug_generic_expr (op1_type
);
3126 /* Or an integer vector type with the same size and element count
3127 as the comparison operand types. */
3128 else if (TREE_CODE (type
) == VECTOR_TYPE
3129 && TREE_CODE (TREE_TYPE (type
)) == INTEGER_TYPE
)
3131 if (TREE_CODE (op0_type
) != VECTOR_TYPE
3132 || TREE_CODE (op1_type
) != VECTOR_TYPE
)
3134 error ("non-vector operands in vector comparison");
3135 debug_generic_expr (op0_type
);
3136 debug_generic_expr (op1_type
);
3140 if (TYPE_VECTOR_SUBPARTS (type
) != TYPE_VECTOR_SUBPARTS (op0_type
)
3141 || (GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (type
)))
3142 != GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (op0_type
))))
3143 /* The result of a vector comparison is of signed
3145 || TYPE_UNSIGNED (TREE_TYPE (type
)))
3147 error ("invalid vector comparison resulting type");
3148 debug_generic_expr (type
);
3154 error ("bogus comparison result type");
3155 debug_generic_expr (type
);
3162 /* Verify a gimple assignment statement STMT with an unary rhs.
3163 Returns true if anything is wrong. */
3166 verify_gimple_assign_unary (gimple stmt
)
3168 enum tree_code rhs_code
= gimple_assign_rhs_code (stmt
);
3169 tree lhs
= gimple_assign_lhs (stmt
);
3170 tree lhs_type
= TREE_TYPE (lhs
);
3171 tree rhs1
= gimple_assign_rhs1 (stmt
);
3172 tree rhs1_type
= TREE_TYPE (rhs1
);
3174 if (!is_gimple_reg (lhs
))
3176 error ("non-register as LHS of unary operation");
3180 if (!is_gimple_val (rhs1
))
3182 error ("invalid operand in unary operation");
3186 /* First handle conversions. */
3191 /* Allow conversions from pointer type to integral type only if
3192 there is no sign or zero extension involved.
3193 For targets were the precision of ptrofftype doesn't match that
3194 of pointers we need to allow arbitrary conversions to ptrofftype. */
3195 if ((POINTER_TYPE_P (lhs_type
)
3196 && INTEGRAL_TYPE_P (rhs1_type
))
3197 || (POINTER_TYPE_P (rhs1_type
)
3198 && INTEGRAL_TYPE_P (lhs_type
)
3199 && (TYPE_PRECISION (rhs1_type
) >= TYPE_PRECISION (lhs_type
)
3200 || ptrofftype_p (sizetype
))))
3203 /* Allow conversion from integral to offset type and vice versa. */
3204 if ((TREE_CODE (lhs_type
) == OFFSET_TYPE
3205 && INTEGRAL_TYPE_P (rhs1_type
))
3206 || (INTEGRAL_TYPE_P (lhs_type
)
3207 && TREE_CODE (rhs1_type
) == OFFSET_TYPE
))
3210 /* Otherwise assert we are converting between types of the
3212 if (INTEGRAL_TYPE_P (lhs_type
) != INTEGRAL_TYPE_P (rhs1_type
))
3214 error ("invalid types in nop conversion");
3215 debug_generic_expr (lhs_type
);
3216 debug_generic_expr (rhs1_type
);
3223 case ADDR_SPACE_CONVERT_EXPR
:
3225 if (!POINTER_TYPE_P (rhs1_type
) || !POINTER_TYPE_P (lhs_type
)
3226 || (TYPE_ADDR_SPACE (TREE_TYPE (rhs1_type
))
3227 == TYPE_ADDR_SPACE (TREE_TYPE (lhs_type
))))
3229 error ("invalid types in address space conversion");
3230 debug_generic_expr (lhs_type
);
3231 debug_generic_expr (rhs1_type
);
3238 case FIXED_CONVERT_EXPR
:
3240 if (!valid_fixed_convert_types_p (lhs_type
, rhs1_type
)
3241 && !valid_fixed_convert_types_p (rhs1_type
, lhs_type
))
3243 error ("invalid types in fixed-point conversion");
3244 debug_generic_expr (lhs_type
);
3245 debug_generic_expr (rhs1_type
);
3254 if ((!INTEGRAL_TYPE_P (rhs1_type
) || !SCALAR_FLOAT_TYPE_P (lhs_type
))
3255 && (!VECTOR_INTEGER_TYPE_P (rhs1_type
)
3256 || !VECTOR_FLOAT_TYPE_P (lhs_type
)))
3258 error ("invalid types in conversion to floating point");
3259 debug_generic_expr (lhs_type
);
3260 debug_generic_expr (rhs1_type
);
3267 case FIX_TRUNC_EXPR
:
3269 if ((!INTEGRAL_TYPE_P (lhs_type
) || !SCALAR_FLOAT_TYPE_P (rhs1_type
))
3270 && (!VECTOR_INTEGER_TYPE_P (lhs_type
)
3271 || !VECTOR_FLOAT_TYPE_P (rhs1_type
)))
3273 error ("invalid types in conversion to integer");
3274 debug_generic_expr (lhs_type
);
3275 debug_generic_expr (rhs1_type
);
3282 case VEC_UNPACK_HI_EXPR
:
3283 case VEC_UNPACK_LO_EXPR
:
3284 case REDUC_MAX_EXPR
:
3285 case REDUC_MIN_EXPR
:
3286 case REDUC_PLUS_EXPR
:
3287 case VEC_UNPACK_FLOAT_HI_EXPR
:
3288 case VEC_UNPACK_FLOAT_LO_EXPR
:
3296 case NON_LVALUE_EXPR
:
3304 /* For the remaining codes assert there is no conversion involved. */
3305 if (!useless_type_conversion_p (lhs_type
, rhs1_type
))
3307 error ("non-trivial conversion in unary operation");
3308 debug_generic_expr (lhs_type
);
3309 debug_generic_expr (rhs1_type
);
3316 /* Verify a gimple assignment statement STMT with a binary rhs.
3317 Returns true if anything is wrong. */
3320 verify_gimple_assign_binary (gimple stmt
)
3322 enum tree_code rhs_code
= gimple_assign_rhs_code (stmt
);
3323 tree lhs
= gimple_assign_lhs (stmt
);
3324 tree lhs_type
= TREE_TYPE (lhs
);
3325 tree rhs1
= gimple_assign_rhs1 (stmt
);
3326 tree rhs1_type
= TREE_TYPE (rhs1
);
3327 tree rhs2
= gimple_assign_rhs2 (stmt
);
3328 tree rhs2_type
= TREE_TYPE (rhs2
);
3330 if (!is_gimple_reg (lhs
))
3332 error ("non-register as LHS of binary operation");
3336 if (!is_gimple_val (rhs1
)
3337 || !is_gimple_val (rhs2
))
3339 error ("invalid operands in binary operation");
3343 /* First handle operations that involve different types. */
3348 if (TREE_CODE (lhs_type
) != COMPLEX_TYPE
3349 || !(INTEGRAL_TYPE_P (rhs1_type
)
3350 || SCALAR_FLOAT_TYPE_P (rhs1_type
))
3351 || !(INTEGRAL_TYPE_P (rhs2_type
)
3352 || SCALAR_FLOAT_TYPE_P (rhs2_type
)))
3354 error ("type mismatch in complex expression");
3355 debug_generic_expr (lhs_type
);
3356 debug_generic_expr (rhs1_type
);
3357 debug_generic_expr (rhs2_type
);
3369 /* Shifts and rotates are ok on integral types, fixed point
3370 types and integer vector types. */
3371 if ((!INTEGRAL_TYPE_P (rhs1_type
)
3372 && !FIXED_POINT_TYPE_P (rhs1_type
)
3373 && !(TREE_CODE (rhs1_type
) == VECTOR_TYPE
3374 && INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type
))))
3375 || (!INTEGRAL_TYPE_P (rhs2_type
)
3376 /* Vector shifts of vectors are also ok. */
3377 && !(TREE_CODE (rhs1_type
) == VECTOR_TYPE
3378 && INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type
))
3379 && TREE_CODE (rhs2_type
) == VECTOR_TYPE
3380 && INTEGRAL_TYPE_P (TREE_TYPE (rhs2_type
))))
3381 || !useless_type_conversion_p (lhs_type
, rhs1_type
))
3383 error ("type mismatch in shift expression");
3384 debug_generic_expr (lhs_type
);
3385 debug_generic_expr (rhs1_type
);
3386 debug_generic_expr (rhs2_type
);
3393 case VEC_LSHIFT_EXPR
:
3394 case VEC_RSHIFT_EXPR
:
3396 if (TREE_CODE (rhs1_type
) != VECTOR_TYPE
3397 || !(INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type
))
3398 || POINTER_TYPE_P (TREE_TYPE (rhs1_type
))
3399 || FIXED_POINT_TYPE_P (TREE_TYPE (rhs1_type
))
3400 || SCALAR_FLOAT_TYPE_P (TREE_TYPE (rhs1_type
)))
3401 || (!INTEGRAL_TYPE_P (rhs2_type
)
3402 && (TREE_CODE (rhs2_type
) != VECTOR_TYPE
3403 || !INTEGRAL_TYPE_P (TREE_TYPE (rhs2_type
))))
3404 || !useless_type_conversion_p (lhs_type
, rhs1_type
))
3406 error ("type mismatch in vector shift expression");
3407 debug_generic_expr (lhs_type
);
3408 debug_generic_expr (rhs1_type
);
3409 debug_generic_expr (rhs2_type
);
3412 /* For shifting a vector of non-integral components we
3413 only allow shifting by a constant multiple of the element size. */
3414 if (!INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type
))
3415 && (TREE_CODE (rhs2
) != INTEGER_CST
3416 || !div_if_zero_remainder (EXACT_DIV_EXPR
, rhs2
,
3417 TYPE_SIZE (TREE_TYPE (rhs1_type
)))))
3419 error ("non-element sized vector shift of floating point vector");
3426 case WIDEN_LSHIFT_EXPR
:
3428 if (!INTEGRAL_TYPE_P (lhs_type
)
3429 || !INTEGRAL_TYPE_P (rhs1_type
)
3430 || TREE_CODE (rhs2
) != INTEGER_CST
3431 || (2 * TYPE_PRECISION (rhs1_type
) > TYPE_PRECISION (lhs_type
)))
3433 error ("type mismatch in widening vector shift expression");
3434 debug_generic_expr (lhs_type
);
3435 debug_generic_expr (rhs1_type
);
3436 debug_generic_expr (rhs2_type
);
3443 case VEC_WIDEN_LSHIFT_HI_EXPR
:
3444 case VEC_WIDEN_LSHIFT_LO_EXPR
:
3446 if (TREE_CODE (rhs1_type
) != VECTOR_TYPE
3447 || TREE_CODE (lhs_type
) != VECTOR_TYPE
3448 || !INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type
))
3449 || !INTEGRAL_TYPE_P (TREE_TYPE (lhs_type
))
3450 || TREE_CODE (rhs2
) != INTEGER_CST
3451 || (2 * TYPE_PRECISION (TREE_TYPE (rhs1_type
))
3452 > TYPE_PRECISION (TREE_TYPE (lhs_type
))))
3454 error ("type mismatch in widening vector shift expression");
3455 debug_generic_expr (lhs_type
);
3456 debug_generic_expr (rhs1_type
);
3457 debug_generic_expr (rhs2_type
);
3467 tree lhs_etype
= lhs_type
;
3468 tree rhs1_etype
= rhs1_type
;
3469 tree rhs2_etype
= rhs2_type
;
3470 if (TREE_CODE (lhs_type
) == VECTOR_TYPE
)
3472 if (TREE_CODE (rhs1_type
) != VECTOR_TYPE
3473 || TREE_CODE (rhs2_type
) != VECTOR_TYPE
)
3475 error ("invalid non-vector operands to vector valued plus");
3478 lhs_etype
= TREE_TYPE (lhs_type
);
3479 rhs1_etype
= TREE_TYPE (rhs1_type
);
3480 rhs2_etype
= TREE_TYPE (rhs2_type
);
3482 if (POINTER_TYPE_P (lhs_etype
)
3483 || POINTER_TYPE_P (rhs1_etype
)
3484 || POINTER_TYPE_P (rhs2_etype
))
3486 error ("invalid (pointer) operands to plus/minus");
3490 /* Continue with generic binary expression handling. */
3494 case POINTER_PLUS_EXPR
:
3496 if (!POINTER_TYPE_P (rhs1_type
)
3497 || !useless_type_conversion_p (lhs_type
, rhs1_type
)
3498 || !ptrofftype_p (rhs2_type
))
3500 error ("type mismatch in pointer plus expression");
3501 debug_generic_stmt (lhs_type
);
3502 debug_generic_stmt (rhs1_type
);
3503 debug_generic_stmt (rhs2_type
);
3510 case TRUTH_ANDIF_EXPR
:
3511 case TRUTH_ORIF_EXPR
:
3512 case TRUTH_AND_EXPR
:
3514 case TRUTH_XOR_EXPR
:
3524 case UNORDERED_EXPR
:
3532 /* Comparisons are also binary, but the result type is not
3533 connected to the operand types. */
3534 return verify_gimple_comparison (lhs_type
, rhs1
, rhs2
);
3536 case WIDEN_MULT_EXPR
:
3537 if (TREE_CODE (lhs_type
) != INTEGER_TYPE
)
3539 return ((2 * TYPE_PRECISION (rhs1_type
) > TYPE_PRECISION (lhs_type
))
3540 || (TYPE_PRECISION (rhs1_type
) != TYPE_PRECISION (rhs2_type
)));
3542 case WIDEN_SUM_EXPR
:
3543 case VEC_WIDEN_MULT_HI_EXPR
:
3544 case VEC_WIDEN_MULT_LO_EXPR
:
3545 case VEC_WIDEN_MULT_EVEN_EXPR
:
3546 case VEC_WIDEN_MULT_ODD_EXPR
:
3547 case VEC_PACK_TRUNC_EXPR
:
3548 case VEC_PACK_SAT_EXPR
:
3549 case VEC_PACK_FIX_TRUNC_EXPR
:
3554 case MULT_HIGHPART_EXPR
:
3555 case TRUNC_DIV_EXPR
:
3557 case FLOOR_DIV_EXPR
:
3558 case ROUND_DIV_EXPR
:
3559 case TRUNC_MOD_EXPR
:
3561 case FLOOR_MOD_EXPR
:
3562 case ROUND_MOD_EXPR
:
3564 case EXACT_DIV_EXPR
:
3570 /* Continue with generic binary expression handling. */
3577 if (!useless_type_conversion_p (lhs_type
, rhs1_type
)
3578 || !useless_type_conversion_p (lhs_type
, rhs2_type
))
3580 error ("type mismatch in binary expression");
3581 debug_generic_stmt (lhs_type
);
3582 debug_generic_stmt (rhs1_type
);
3583 debug_generic_stmt (rhs2_type
);
3590 /* Verify a gimple assignment statement STMT with a ternary rhs.
3591 Returns true if anything is wrong. */
3594 verify_gimple_assign_ternary (gimple stmt
)
3596 enum tree_code rhs_code
= gimple_assign_rhs_code (stmt
);
3597 tree lhs
= gimple_assign_lhs (stmt
);
3598 tree lhs_type
= TREE_TYPE (lhs
);
3599 tree rhs1
= gimple_assign_rhs1 (stmt
);
3600 tree rhs1_type
= TREE_TYPE (rhs1
);
3601 tree rhs2
= gimple_assign_rhs2 (stmt
);
3602 tree rhs2_type
= TREE_TYPE (rhs2
);
3603 tree rhs3
= gimple_assign_rhs3 (stmt
);
3604 tree rhs3_type
= TREE_TYPE (rhs3
);
3606 if (!is_gimple_reg (lhs
))
3608 error ("non-register as LHS of ternary operation");
3612 if (((rhs_code
== VEC_COND_EXPR
|| rhs_code
== COND_EXPR
)
3613 ? !is_gimple_condexpr (rhs1
) : !is_gimple_val (rhs1
))
3614 || !is_gimple_val (rhs2
)
3615 || !is_gimple_val (rhs3
))
3617 error ("invalid operands in ternary operation");
3621 /* First handle operations that involve different types. */
3624 case WIDEN_MULT_PLUS_EXPR
:
3625 case WIDEN_MULT_MINUS_EXPR
:
3626 if ((!INTEGRAL_TYPE_P (rhs1_type
)
3627 && !FIXED_POINT_TYPE_P (rhs1_type
))
3628 || !useless_type_conversion_p (rhs1_type
, rhs2_type
)
3629 || !useless_type_conversion_p (lhs_type
, rhs3_type
)
3630 || 2 * TYPE_PRECISION (rhs1_type
) > TYPE_PRECISION (lhs_type
)
3631 || TYPE_PRECISION (rhs1_type
) != TYPE_PRECISION (rhs2_type
))
3633 error ("type mismatch in widening multiply-accumulate expression");
3634 debug_generic_expr (lhs_type
);
3635 debug_generic_expr (rhs1_type
);
3636 debug_generic_expr (rhs2_type
);
3637 debug_generic_expr (rhs3_type
);
3643 if (!useless_type_conversion_p (lhs_type
, rhs1_type
)
3644 || !useless_type_conversion_p (lhs_type
, rhs2_type
)
3645 || !useless_type_conversion_p (lhs_type
, rhs3_type
))
3647 error ("type mismatch in fused multiply-add expression");
3648 debug_generic_expr (lhs_type
);
3649 debug_generic_expr (rhs1_type
);
3650 debug_generic_expr (rhs2_type
);
3651 debug_generic_expr (rhs3_type
);
3658 if (!useless_type_conversion_p (lhs_type
, rhs2_type
)
3659 || !useless_type_conversion_p (lhs_type
, rhs3_type
))
3661 error ("type mismatch in conditional expression");
3662 debug_generic_expr (lhs_type
);
3663 debug_generic_expr (rhs2_type
);
3664 debug_generic_expr (rhs3_type
);
3670 if (!useless_type_conversion_p (lhs_type
, rhs1_type
)
3671 || !useless_type_conversion_p (lhs_type
, rhs2_type
))
3673 error ("type mismatch in vector permute expression");
3674 debug_generic_expr (lhs_type
);
3675 debug_generic_expr (rhs1_type
);
3676 debug_generic_expr (rhs2_type
);
3677 debug_generic_expr (rhs3_type
);
3681 if (TREE_CODE (rhs1_type
) != VECTOR_TYPE
3682 || TREE_CODE (rhs2_type
) != VECTOR_TYPE
3683 || TREE_CODE (rhs3_type
) != VECTOR_TYPE
)
3685 error ("vector types expected in vector permute expression");
3686 debug_generic_expr (lhs_type
);
3687 debug_generic_expr (rhs1_type
);
3688 debug_generic_expr (rhs2_type
);
3689 debug_generic_expr (rhs3_type
);
3693 if (TYPE_VECTOR_SUBPARTS (rhs1_type
) != TYPE_VECTOR_SUBPARTS (rhs2_type
)
3694 || TYPE_VECTOR_SUBPARTS (rhs2_type
)
3695 != TYPE_VECTOR_SUBPARTS (rhs3_type
)
3696 || TYPE_VECTOR_SUBPARTS (rhs3_type
)
3697 != TYPE_VECTOR_SUBPARTS (lhs_type
))
3699 error ("vectors with different element number found "
3700 "in vector permute expression");
3701 debug_generic_expr (lhs_type
);
3702 debug_generic_expr (rhs1_type
);
3703 debug_generic_expr (rhs2_type
);
3704 debug_generic_expr (rhs3_type
);
3708 if (TREE_CODE (TREE_TYPE (rhs3_type
)) != INTEGER_TYPE
3709 || GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (rhs3_type
)))
3710 != GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (rhs1_type
))))
3712 error ("invalid mask type in vector permute expression");
3713 debug_generic_expr (lhs_type
);
3714 debug_generic_expr (rhs1_type
);
3715 debug_generic_expr (rhs2_type
);
3716 debug_generic_expr (rhs3_type
);
3723 case REALIGN_LOAD_EXPR
:
3733 /* Verify a gimple assignment statement STMT with a single rhs.
3734 Returns true if anything is wrong. */
3737 verify_gimple_assign_single (gimple stmt
)
3739 enum tree_code rhs_code
= gimple_assign_rhs_code (stmt
);
3740 tree lhs
= gimple_assign_lhs (stmt
);
3741 tree lhs_type
= TREE_TYPE (lhs
);
3742 tree rhs1
= gimple_assign_rhs1 (stmt
);
3743 tree rhs1_type
= TREE_TYPE (rhs1
);
3746 if (!useless_type_conversion_p (lhs_type
, rhs1_type
))
3748 error ("non-trivial conversion at assignment");
3749 debug_generic_expr (lhs_type
);
3750 debug_generic_expr (rhs1_type
);
3754 if (gimple_clobber_p (stmt
)
3755 && !(DECL_P (lhs
) || TREE_CODE (lhs
) == MEM_REF
))
3757 error ("non-decl/MEM_REF LHS in clobber statement");
3758 debug_generic_expr (lhs
);
3762 if (handled_component_p (lhs
))
3763 res
|= verify_types_in_gimple_reference (lhs
, true);
3765 /* Special codes we cannot handle via their class. */
3770 tree op
= TREE_OPERAND (rhs1
, 0);
3771 if (!is_gimple_addressable (op
))
3773 error ("invalid operand in unary expression");
3777 /* Technically there is no longer a need for matching types, but
3778 gimple hygiene asks for this check. In LTO we can end up
3779 combining incompatible units and thus end up with addresses
3780 of globals that change their type to a common one. */
3782 && !types_compatible_p (TREE_TYPE (op
),
3783 TREE_TYPE (TREE_TYPE (rhs1
)))
3784 && !one_pointer_to_useless_type_conversion_p (TREE_TYPE (rhs1
),
3787 error ("type mismatch in address expression");
3788 debug_generic_stmt (TREE_TYPE (rhs1
));
3789 debug_generic_stmt (TREE_TYPE (op
));
3793 return verify_types_in_gimple_reference (op
, true);
3798 error ("INDIRECT_REF in gimple IL");
3804 case ARRAY_RANGE_REF
:
3805 case VIEW_CONVERT_EXPR
:
3808 case TARGET_MEM_REF
:
3810 if (!is_gimple_reg (lhs
)
3811 && is_gimple_reg_type (TREE_TYPE (lhs
)))
3813 error ("invalid rhs for gimple memory store");
3814 debug_generic_stmt (lhs
);
3815 debug_generic_stmt (rhs1
);
3818 return res
|| verify_types_in_gimple_reference (rhs1
, false);
3830 /* tcc_declaration */
3835 if (!is_gimple_reg (lhs
)
3836 && !is_gimple_reg (rhs1
)
3837 && is_gimple_reg_type (TREE_TYPE (lhs
)))
3839 error ("invalid rhs for gimple memory store");
3840 debug_generic_stmt (lhs
);
3841 debug_generic_stmt (rhs1
);
3847 if (TREE_CODE (rhs1_type
) == VECTOR_TYPE
)
3850 tree elt_i
, elt_v
, elt_t
= NULL_TREE
;
3852 if (CONSTRUCTOR_NELTS (rhs1
) == 0)
3854 /* For vector CONSTRUCTORs we require that either it is empty
3855 CONSTRUCTOR, or it is a CONSTRUCTOR of smaller vector elements
3856 (then the element count must be correct to cover the whole
3857 outer vector and index must be NULL on all elements, or it is
3858 a CONSTRUCTOR of scalar elements, where we as an exception allow
3859 smaller number of elements (assuming zero filling) and
3860 consecutive indexes as compared to NULL indexes (such
3861 CONSTRUCTORs can appear in the IL from FEs). */
3862 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (rhs1
), i
, elt_i
, elt_v
)
3864 if (elt_t
== NULL_TREE
)
3866 elt_t
= TREE_TYPE (elt_v
);
3867 if (TREE_CODE (elt_t
) == VECTOR_TYPE
)
3869 tree elt_t
= TREE_TYPE (elt_v
);
3870 if (!useless_type_conversion_p (TREE_TYPE (rhs1_type
),
3873 error ("incorrect type of vector CONSTRUCTOR"
3875 debug_generic_stmt (rhs1
);
3878 else if (CONSTRUCTOR_NELTS (rhs1
)
3879 * TYPE_VECTOR_SUBPARTS (elt_t
)
3880 != TYPE_VECTOR_SUBPARTS (rhs1_type
))
3882 error ("incorrect number of vector CONSTRUCTOR"
3884 debug_generic_stmt (rhs1
);
3888 else if (!useless_type_conversion_p (TREE_TYPE (rhs1_type
),
3891 error ("incorrect type of vector CONSTRUCTOR elements");
3892 debug_generic_stmt (rhs1
);
3895 else if (CONSTRUCTOR_NELTS (rhs1
)
3896 > TYPE_VECTOR_SUBPARTS (rhs1_type
))
3898 error ("incorrect number of vector CONSTRUCTOR elements");
3899 debug_generic_stmt (rhs1
);
3903 else if (!useless_type_conversion_p (elt_t
, TREE_TYPE (elt_v
)))
3905 error ("incorrect type of vector CONSTRUCTOR elements");
3906 debug_generic_stmt (rhs1
);
3909 if (elt_i
!= NULL_TREE
3910 && (TREE_CODE (elt_t
) == VECTOR_TYPE
3911 || TREE_CODE (elt_i
) != INTEGER_CST
3912 || compare_tree_int (elt_i
, i
) != 0))
3914 error ("vector CONSTRUCTOR with non-NULL element index");
3915 debug_generic_stmt (rhs1
);
3923 case WITH_SIZE_EXPR
:
3933 /* Verify the contents of a GIMPLE_ASSIGN STMT. Returns true when there
3934 is a problem, otherwise false. */
3937 verify_gimple_assign (gimple stmt
)
3939 switch (gimple_assign_rhs_class (stmt
))
3941 case GIMPLE_SINGLE_RHS
:
3942 return verify_gimple_assign_single (stmt
);
3944 case GIMPLE_UNARY_RHS
:
3945 return verify_gimple_assign_unary (stmt
);
3947 case GIMPLE_BINARY_RHS
:
3948 return verify_gimple_assign_binary (stmt
);
3950 case GIMPLE_TERNARY_RHS
:
3951 return verify_gimple_assign_ternary (stmt
);
3958 /* Verify the contents of a GIMPLE_RETURN STMT. Returns true when there
3959 is a problem, otherwise false. */
3962 verify_gimple_return (gimple stmt
)
3964 tree op
= gimple_return_retval (stmt
);
3965 tree restype
= TREE_TYPE (TREE_TYPE (cfun
->decl
));
3967 /* We cannot test for present return values as we do not fix up missing
3968 return values from the original source. */
3972 if (!is_gimple_val (op
)
3973 && TREE_CODE (op
) != RESULT_DECL
)
3975 error ("invalid operand in return statement");
3976 debug_generic_stmt (op
);
3980 if ((TREE_CODE (op
) == RESULT_DECL
3981 && DECL_BY_REFERENCE (op
))
3982 || (TREE_CODE (op
) == SSA_NAME
3983 && SSA_NAME_VAR (op
)
3984 && TREE_CODE (SSA_NAME_VAR (op
)) == RESULT_DECL
3985 && DECL_BY_REFERENCE (SSA_NAME_VAR (op
))))
3986 op
= TREE_TYPE (op
);
3988 if (!useless_type_conversion_p (restype
, TREE_TYPE (op
)))
3990 error ("invalid conversion in return statement");
3991 debug_generic_stmt (restype
);
3992 debug_generic_stmt (TREE_TYPE (op
));
4000 /* Verify the contents of a GIMPLE_GOTO STMT. Returns true when there
4001 is a problem, otherwise false. */
4004 verify_gimple_goto (gimple stmt
)
4006 tree dest
= gimple_goto_dest (stmt
);
4008 /* ??? We have two canonical forms of direct goto destinations, a
4009 bare LABEL_DECL and an ADDR_EXPR of a LABEL_DECL. */
4010 if (TREE_CODE (dest
) != LABEL_DECL
4011 && (!is_gimple_val (dest
)
4012 || !POINTER_TYPE_P (TREE_TYPE (dest
))))
4014 error ("goto destination is neither a label nor a pointer");
4021 /* Verify the contents of a GIMPLE_SWITCH STMT. Returns true when there
4022 is a problem, otherwise false. */
4025 verify_gimple_switch (gimple stmt
)
4028 tree elt
, prev_upper_bound
= NULL_TREE
;
4029 tree index_type
, elt_type
= NULL_TREE
;
4031 if (!is_gimple_val (gimple_switch_index (stmt
)))
4033 error ("invalid operand to switch statement");
4034 debug_generic_stmt (gimple_switch_index (stmt
));
4038 index_type
= TREE_TYPE (gimple_switch_index (stmt
));
4039 if (! INTEGRAL_TYPE_P (index_type
))
4041 error ("non-integral type switch statement");
4042 debug_generic_expr (index_type
);
4046 elt
= gimple_switch_label (stmt
, 0);
4047 if (CASE_LOW (elt
) != NULL_TREE
|| CASE_HIGH (elt
) != NULL_TREE
)
4049 error ("invalid default case label in switch statement");
4050 debug_generic_expr (elt
);
4054 n
= gimple_switch_num_labels (stmt
);
4055 for (i
= 1; i
< n
; i
++)
4057 elt
= gimple_switch_label (stmt
, i
);
4059 if (! CASE_LOW (elt
))
4061 error ("invalid case label in switch statement");
4062 debug_generic_expr (elt
);
4066 && ! tree_int_cst_lt (CASE_LOW (elt
), CASE_HIGH (elt
)))
4068 error ("invalid case range in switch statement");
4069 debug_generic_expr (elt
);
4075 if (TREE_TYPE (CASE_LOW (elt
)) != elt_type
4076 || (CASE_HIGH (elt
) && TREE_TYPE (CASE_HIGH (elt
)) != elt_type
))
4078 error ("type mismatch for case label in switch statement");
4079 debug_generic_expr (elt
);
4085 elt_type
= TREE_TYPE (CASE_LOW (elt
));
4086 if (TYPE_PRECISION (index_type
) < TYPE_PRECISION (elt_type
))
4088 error ("type precision mismatch in switch statement");
4093 if (prev_upper_bound
)
4095 if (! tree_int_cst_lt (prev_upper_bound
, CASE_LOW (elt
)))
4097 error ("case labels not sorted in switch statement");
4102 prev_upper_bound
= CASE_HIGH (elt
);
4103 if (! prev_upper_bound
)
4104 prev_upper_bound
= CASE_LOW (elt
);
4110 /* Verify a gimple debug statement STMT.
4111 Returns true if anything is wrong. */
4114 verify_gimple_debug (gimple stmt ATTRIBUTE_UNUSED
)
4116 /* There isn't much that could be wrong in a gimple debug stmt. A
4117 gimple debug bind stmt, for example, maps a tree, that's usually
4118 a VAR_DECL or a PARM_DECL, but that could also be some scalarized
4119 component or member of an aggregate type, to another tree, that
4120 can be an arbitrary expression. These stmts expand into debug
4121 insns, and are converted to debug notes by var-tracking.c. */
4125 /* Verify a gimple label statement STMT.
4126 Returns true if anything is wrong. */
4129 verify_gimple_label (gimple stmt
)
4131 tree decl
= gimple_label_label (stmt
);
4135 if (TREE_CODE (decl
) != LABEL_DECL
)
4137 if (!DECL_NONLOCAL (decl
) && !FORCED_LABEL (decl
)
4138 && DECL_CONTEXT (decl
) != current_function_decl
)
4140 error ("label's context is not the current function decl");
4144 uid
= LABEL_DECL_UID (decl
);
4146 && (uid
== -1 || (*label_to_block_map
)[uid
] != gimple_bb (stmt
)))
4148 error ("incorrect entry in label_to_block_map");
4152 uid
= EH_LANDING_PAD_NR (decl
);
4155 eh_landing_pad lp
= get_eh_landing_pad_from_number (uid
);
4156 if (decl
!= lp
->post_landing_pad
)
4158 error ("incorrect setting of landing pad number");
4166 /* Verify the GIMPLE statement STMT. Returns true if there is an
4167 error, otherwise false. */
4170 verify_gimple_stmt (gimple stmt
)
4172 switch (gimple_code (stmt
))
4175 return verify_gimple_assign (stmt
);
4178 return verify_gimple_label (stmt
);
4181 return verify_gimple_call (stmt
);
4184 if (TREE_CODE_CLASS (gimple_cond_code (stmt
)) != tcc_comparison
)
4186 error ("invalid comparison code in gimple cond");
4189 if (!(!gimple_cond_true_label (stmt
)
4190 || TREE_CODE (gimple_cond_true_label (stmt
)) == LABEL_DECL
)
4191 || !(!gimple_cond_false_label (stmt
)
4192 || TREE_CODE (gimple_cond_false_label (stmt
)) == LABEL_DECL
))
4194 error ("invalid labels in gimple cond");
4198 return verify_gimple_comparison (boolean_type_node
,
4199 gimple_cond_lhs (stmt
),
4200 gimple_cond_rhs (stmt
));
4203 return verify_gimple_goto (stmt
);
4206 return verify_gimple_switch (stmt
);
4209 return verify_gimple_return (stmt
);
4214 case GIMPLE_TRANSACTION
:
4215 return verify_gimple_transaction (stmt
);
4217 /* Tuples that do not have tree operands. */
4219 case GIMPLE_PREDICT
:
4221 case GIMPLE_EH_DISPATCH
:
4222 case GIMPLE_EH_MUST_NOT_THROW
:
4226 /* OpenMP directives are validated by the FE and never operated
4227 on by the optimizers. Furthermore, GIMPLE_OMP_FOR may contain
4228 non-gimple expressions when the main index variable has had
4229 its address taken. This does not affect the loop itself
4230 because the header of an GIMPLE_OMP_FOR is merely used to determine
4231 how to setup the parallel iteration. */
4235 return verify_gimple_debug (stmt
);
4242 /* Verify the contents of a GIMPLE_PHI. Returns true if there is a problem,
4243 and false otherwise. */
4246 verify_gimple_phi (gimple phi
)
4250 tree phi_result
= gimple_phi_result (phi
);
4255 error ("invalid PHI result");
4259 virtual_p
= virtual_operand_p (phi_result
);
4260 if (TREE_CODE (phi_result
) != SSA_NAME
4262 && SSA_NAME_VAR (phi_result
) != gimple_vop (cfun
)))
4264 error ("invalid PHI result");
4268 for (i
= 0; i
< gimple_phi_num_args (phi
); i
++)
4270 tree t
= gimple_phi_arg_def (phi
, i
);
4274 error ("missing PHI def");
4278 /* Addressable variables do have SSA_NAMEs but they
4279 are not considered gimple values. */
4280 else if ((TREE_CODE (t
) == SSA_NAME
4281 && virtual_p
!= virtual_operand_p (t
))
4283 && (TREE_CODE (t
) != SSA_NAME
4284 || SSA_NAME_VAR (t
) != gimple_vop (cfun
)))
4286 && !is_gimple_val (t
)))
4288 error ("invalid PHI argument");
4289 debug_generic_expr (t
);
4292 #ifdef ENABLE_TYPES_CHECKING
4293 if (!useless_type_conversion_p (TREE_TYPE (phi_result
), TREE_TYPE (t
)))
4295 error ("incompatible types in PHI argument %u", i
);
4296 debug_generic_stmt (TREE_TYPE (phi_result
));
4297 debug_generic_stmt (TREE_TYPE (t
));
4306 /* Verify the GIMPLE statements inside the sequence STMTS. */
4309 verify_gimple_in_seq_2 (gimple_seq stmts
)
4311 gimple_stmt_iterator ittr
;
4314 for (ittr
= gsi_start (stmts
); !gsi_end_p (ittr
); gsi_next (&ittr
))
4316 gimple stmt
= gsi_stmt (ittr
);
4318 switch (gimple_code (stmt
))
4321 err
|= verify_gimple_in_seq_2 (gimple_bind_body (stmt
));
4325 err
|= verify_gimple_in_seq_2 (gimple_try_eval (stmt
));
4326 err
|= verify_gimple_in_seq_2 (gimple_try_cleanup (stmt
));
4329 case GIMPLE_EH_FILTER
:
4330 err
|= verify_gimple_in_seq_2 (gimple_eh_filter_failure (stmt
));
4333 case GIMPLE_EH_ELSE
:
4334 err
|= verify_gimple_in_seq_2 (gimple_eh_else_n_body (stmt
));
4335 err
|= verify_gimple_in_seq_2 (gimple_eh_else_e_body (stmt
));
4339 err
|= verify_gimple_in_seq_2 (gimple_catch_handler (stmt
));
4342 case GIMPLE_TRANSACTION
:
4343 err
|= verify_gimple_transaction (stmt
);
4348 bool err2
= verify_gimple_stmt (stmt
);
4350 debug_gimple_stmt (stmt
);
4359 /* Verify the contents of a GIMPLE_TRANSACTION. Returns true if there
4360 is a problem, otherwise false. */
4363 verify_gimple_transaction (gimple stmt
)
4365 tree lab
= gimple_transaction_label (stmt
);
4366 if (lab
!= NULL
&& TREE_CODE (lab
) != LABEL_DECL
)
4368 return verify_gimple_in_seq_2 (gimple_transaction_body (stmt
));
4372 /* Verify the GIMPLE statements inside the statement list STMTS. */
4375 verify_gimple_in_seq (gimple_seq stmts
)
4377 timevar_push (TV_TREE_STMT_VERIFY
);
4378 if (verify_gimple_in_seq_2 (stmts
))
4379 internal_error ("verify_gimple failed");
4380 timevar_pop (TV_TREE_STMT_VERIFY
);
4383 /* Return true when the T can be shared. */
4386 tree_node_can_be_shared (tree t
)
4388 if (IS_TYPE_OR_DECL_P (t
)
4389 || is_gimple_min_invariant (t
)
4390 || TREE_CODE (t
) == SSA_NAME
4391 || t
== error_mark_node
4392 || TREE_CODE (t
) == IDENTIFIER_NODE
)
4395 if (TREE_CODE (t
) == CASE_LABEL_EXPR
)
4404 /* Called via walk_tree. Verify tree sharing. */
4407 verify_node_sharing_1 (tree
*tp
, int *walk_subtrees
, void *data
)
4409 struct pointer_set_t
*visited
= (struct pointer_set_t
*) data
;
4411 if (tree_node_can_be_shared (*tp
))
4413 *walk_subtrees
= false;
4417 if (pointer_set_insert (visited
, *tp
))
4423 /* Called via walk_gimple_stmt. Verify tree sharing. */
4426 verify_node_sharing (tree
*tp
, int *walk_subtrees
, void *data
)
4428 struct walk_stmt_info
*wi
= (struct walk_stmt_info
*) data
;
4429 return verify_node_sharing_1 (tp
, walk_subtrees
, wi
->info
);
4432 static bool eh_error_found
;
4434 verify_eh_throw_stmt_node (void **slot
, void *data
)
4436 struct throw_stmt_node
*node
= (struct throw_stmt_node
*)*slot
;
4437 struct pointer_set_t
*visited
= (struct pointer_set_t
*) data
;
4439 if (!pointer_set_contains (visited
, node
->stmt
))
4441 error ("dead STMT in EH table");
4442 debug_gimple_stmt (node
->stmt
);
4443 eh_error_found
= true;
4448 /* Verify if the location LOCs block is in BLOCKS. */
4451 verify_location (pointer_set_t
*blocks
, location_t loc
)
4453 tree block
= LOCATION_BLOCK (loc
);
4454 if (block
!= NULL_TREE
4455 && !pointer_set_contains (blocks
, block
))
4457 error ("location references block not in block tree");
4460 if (block
!= NULL_TREE
)
4461 return verify_location (blocks
, BLOCK_SOURCE_LOCATION (block
));
4465 /* Called via walk_tree. Verify that expressions have no blocks. */
4468 verify_expr_no_block (tree
*tp
, int *walk_subtrees
, void *)
4472 *walk_subtrees
= false;
4476 location_t loc
= EXPR_LOCATION (*tp
);
4477 if (LOCATION_BLOCK (loc
) != NULL
)
4483 /* Called via walk_tree. Verify locations of expressions. */
4486 verify_expr_location_1 (tree
*tp
, int *walk_subtrees
, void *data
)
4488 struct pointer_set_t
*blocks
= (struct pointer_set_t
*) data
;
4490 if (TREE_CODE (*tp
) == VAR_DECL
4491 && DECL_HAS_DEBUG_EXPR_P (*tp
))
4493 tree t
= DECL_DEBUG_EXPR (*tp
);
4494 tree addr
= walk_tree (&t
, verify_expr_no_block
, NULL
, NULL
);
4498 if ((TREE_CODE (*tp
) == VAR_DECL
4499 || TREE_CODE (*tp
) == PARM_DECL
4500 || TREE_CODE (*tp
) == RESULT_DECL
)
4501 && DECL_HAS_VALUE_EXPR_P (*tp
))
4503 tree t
= DECL_VALUE_EXPR (*tp
);
4504 tree addr
= walk_tree (&t
, verify_expr_no_block
, NULL
, NULL
);
4511 *walk_subtrees
= false;
4515 location_t loc
= EXPR_LOCATION (*tp
);
4516 if (verify_location (blocks
, loc
))
4522 /* Called via walk_gimple_op. Verify locations of expressions. */
4525 verify_expr_location (tree
*tp
, int *walk_subtrees
, void *data
)
4527 struct walk_stmt_info
*wi
= (struct walk_stmt_info
*) data
;
4528 return verify_expr_location_1 (tp
, walk_subtrees
, wi
->info
);
4531 /* Insert all subblocks of BLOCK into BLOCKS and recurse. */
4534 collect_subblocks (pointer_set_t
*blocks
, tree block
)
4537 for (t
= BLOCK_SUBBLOCKS (block
); t
; t
= BLOCK_CHAIN (t
))
4539 pointer_set_insert (blocks
, t
);
4540 collect_subblocks (blocks
, t
);
4544 /* Verify the GIMPLE statements in the CFG of FN. */
4547 verify_gimple_in_cfg (struct function
*fn
)
4551 struct pointer_set_t
*visited
, *visited_stmts
, *blocks
;
4553 timevar_push (TV_TREE_STMT_VERIFY
);
4554 visited
= pointer_set_create ();
4555 visited_stmts
= pointer_set_create ();
4557 /* Collect all BLOCKs referenced by the BLOCK tree of FN. */
4558 blocks
= pointer_set_create ();
4559 if (DECL_INITIAL (fn
->decl
))
4561 pointer_set_insert (blocks
, DECL_INITIAL (fn
->decl
));
4562 collect_subblocks (blocks
, DECL_INITIAL (fn
->decl
));
4565 FOR_EACH_BB_FN (bb
, fn
)
4567 gimple_stmt_iterator gsi
;
4569 for (gsi
= gsi_start_phis (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
4571 gimple phi
= gsi_stmt (gsi
);
4575 pointer_set_insert (visited_stmts
, phi
);
4577 if (gimple_bb (phi
) != bb
)
4579 error ("gimple_bb (phi) is set to a wrong basic block");
4583 err2
|= verify_gimple_phi (phi
);
4585 /* Only PHI arguments have locations. */
4586 if (gimple_location (phi
) != UNKNOWN_LOCATION
)
4588 error ("PHI node with location");
4592 for (i
= 0; i
< gimple_phi_num_args (phi
); i
++)
4594 tree arg
= gimple_phi_arg_def (phi
, i
);
4595 tree addr
= walk_tree (&arg
, verify_node_sharing_1
,
4599 error ("incorrect sharing of tree nodes");
4600 debug_generic_expr (addr
);
4603 location_t loc
= gimple_phi_arg_location (phi
, i
);
4604 if (virtual_operand_p (gimple_phi_result (phi
))
4605 && loc
!= UNKNOWN_LOCATION
)
4607 error ("virtual PHI with argument locations");
4610 addr
= walk_tree (&arg
, verify_expr_location_1
, blocks
, NULL
);
4613 debug_generic_expr (addr
);
4616 err2
|= verify_location (blocks
, loc
);
4620 debug_gimple_stmt (phi
);
4624 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
4626 gimple stmt
= gsi_stmt (gsi
);
4628 struct walk_stmt_info wi
;
4632 pointer_set_insert (visited_stmts
, stmt
);
4634 if (gimple_bb (stmt
) != bb
)
4636 error ("gimple_bb (stmt) is set to a wrong basic block");
4640 err2
|= verify_gimple_stmt (stmt
);
4641 err2
|= verify_location (blocks
, gimple_location (stmt
));
4643 memset (&wi
, 0, sizeof (wi
));
4644 wi
.info
= (void *) visited
;
4645 addr
= walk_gimple_op (stmt
, verify_node_sharing
, &wi
);
4648 error ("incorrect sharing of tree nodes");
4649 debug_generic_expr (addr
);
4653 memset (&wi
, 0, sizeof (wi
));
4654 wi
.info
= (void *) blocks
;
4655 addr
= walk_gimple_op (stmt
, verify_expr_location
, &wi
);
4658 debug_generic_expr (addr
);
4662 /* ??? Instead of not checking these stmts at all the walker
4663 should know its context via wi. */
4664 if (!is_gimple_debug (stmt
)
4665 && !is_gimple_omp (stmt
))
4667 memset (&wi
, 0, sizeof (wi
));
4668 addr
= walk_gimple_op (stmt
, verify_expr
, &wi
);
4671 debug_generic_expr (addr
);
4672 inform (gimple_location (stmt
), "in statement");
4677 /* If the statement is marked as part of an EH region, then it is
4678 expected that the statement could throw. Verify that when we
4679 have optimizations that simplify statements such that we prove
4680 that they cannot throw, that we update other data structures
4682 lp_nr
= lookup_stmt_eh_lp (stmt
);
4685 if (!stmt_could_throw_p (stmt
))
4687 error ("statement marked for throw, but doesn%'t");
4691 && !gsi_one_before_end_p (gsi
)
4692 && stmt_can_throw_internal (stmt
))
4694 error ("statement marked for throw in middle of block");
4700 debug_gimple_stmt (stmt
);
4705 eh_error_found
= false;
4706 if (get_eh_throw_stmt_table (cfun
))
4707 htab_traverse (get_eh_throw_stmt_table (cfun
),
4708 verify_eh_throw_stmt_node
,
4711 if (err
|| eh_error_found
)
4712 internal_error ("verify_gimple failed");
4714 pointer_set_destroy (visited
);
4715 pointer_set_destroy (visited_stmts
);
4716 pointer_set_destroy (blocks
);
4717 verify_histograms ();
4718 timevar_pop (TV_TREE_STMT_VERIFY
);
4722 /* Verifies that the flow information is OK. */
4725 gimple_verify_flow_info (void)
4729 gimple_stmt_iterator gsi
;
4734 if (ENTRY_BLOCK_PTR
->il
.gimple
.seq
|| ENTRY_BLOCK_PTR
->il
.gimple
.phi_nodes
)
4736 error ("ENTRY_BLOCK has IL associated with it");
4740 if (EXIT_BLOCK_PTR
->il
.gimple
.seq
|| EXIT_BLOCK_PTR
->il
.gimple
.phi_nodes
)
4742 error ("EXIT_BLOCK has IL associated with it");
4746 FOR_EACH_EDGE (e
, ei
, EXIT_BLOCK_PTR
->preds
)
4747 if (e
->flags
& EDGE_FALLTHRU
)
4749 error ("fallthru to exit from bb %d", e
->src
->index
);
4755 bool found_ctrl_stmt
= false;
4759 /* Skip labels on the start of basic block. */
4760 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
4763 gimple prev_stmt
= stmt
;
4765 stmt
= gsi_stmt (gsi
);
4767 if (gimple_code (stmt
) != GIMPLE_LABEL
)
4770 label
= gimple_label_label (stmt
);
4771 if (prev_stmt
&& DECL_NONLOCAL (label
))
4773 error ("nonlocal label ");
4774 print_generic_expr (stderr
, label
, 0);
4775 fprintf (stderr
, " is not first in a sequence of labels in bb %d",
4780 if (prev_stmt
&& EH_LANDING_PAD_NR (label
) != 0)
4782 error ("EH landing pad label ");
4783 print_generic_expr (stderr
, label
, 0);
4784 fprintf (stderr
, " is not first in a sequence of labels in bb %d",
4789 if (label_to_block (label
) != bb
)
4792 print_generic_expr (stderr
, label
, 0);
4793 fprintf (stderr
, " to block does not match in bb %d",
4798 if (decl_function_context (label
) != current_function_decl
)
4801 print_generic_expr (stderr
, label
, 0);
4802 fprintf (stderr
, " has incorrect context in bb %d",
4808 /* Verify that body of basic block BB is free of control flow. */
4809 for (; !gsi_end_p (gsi
); gsi_next (&gsi
))
4811 gimple stmt
= gsi_stmt (gsi
);
4813 if (found_ctrl_stmt
)
4815 error ("control flow in the middle of basic block %d",
4820 if (stmt_ends_bb_p (stmt
))
4821 found_ctrl_stmt
= true;
4823 if (gimple_code (stmt
) == GIMPLE_LABEL
)
4826 print_generic_expr (stderr
, gimple_label_label (stmt
), 0);
4827 fprintf (stderr
, " in the middle of basic block %d", bb
->index
);
4832 gsi
= gsi_last_bb (bb
);
4833 if (gsi_end_p (gsi
))
4836 stmt
= gsi_stmt (gsi
);
4838 if (gimple_code (stmt
) == GIMPLE_LABEL
)
4841 err
|= verify_eh_edges (stmt
);
4843 if (is_ctrl_stmt (stmt
))
4845 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
4846 if (e
->flags
& EDGE_FALLTHRU
)
4848 error ("fallthru edge after a control statement in bb %d",
4854 if (gimple_code (stmt
) != GIMPLE_COND
)
4856 /* Verify that there are no edges with EDGE_TRUE/FALSE_FLAG set
4857 after anything else but if statement. */
4858 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
4859 if (e
->flags
& (EDGE_TRUE_VALUE
| EDGE_FALSE_VALUE
))
4861 error ("true/false edge after a non-GIMPLE_COND in bb %d",
4867 switch (gimple_code (stmt
))
4874 extract_true_false_edges_from_block (bb
, &true_edge
, &false_edge
);
4878 || !(true_edge
->flags
& EDGE_TRUE_VALUE
)
4879 || !(false_edge
->flags
& EDGE_FALSE_VALUE
)
4880 || (true_edge
->flags
& (EDGE_FALLTHRU
| EDGE_ABNORMAL
))
4881 || (false_edge
->flags
& (EDGE_FALLTHRU
| EDGE_ABNORMAL
))
4882 || EDGE_COUNT (bb
->succs
) >= 3)
4884 error ("wrong outgoing edge flags at end of bb %d",
4892 if (simple_goto_p (stmt
))
4894 error ("explicit goto at end of bb %d", bb
->index
);
4899 /* FIXME. We should double check that the labels in the
4900 destination blocks have their address taken. */
4901 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
4902 if ((e
->flags
& (EDGE_FALLTHRU
| EDGE_TRUE_VALUE
4903 | EDGE_FALSE_VALUE
))
4904 || !(e
->flags
& EDGE_ABNORMAL
))
4906 error ("wrong outgoing edge flags at end of bb %d",
4914 if (!gimple_call_builtin_p (stmt
, BUILT_IN_RETURN
))
4916 /* ... fallthru ... */
4918 if (!single_succ_p (bb
)
4919 || (single_succ_edge (bb
)->flags
4920 & (EDGE_FALLTHRU
| EDGE_ABNORMAL
4921 | EDGE_TRUE_VALUE
| EDGE_FALSE_VALUE
)))
4923 error ("wrong outgoing edge flags at end of bb %d", bb
->index
);
4926 if (single_succ (bb
) != EXIT_BLOCK_PTR
)
4928 error ("return edge does not point to exit in bb %d",
4940 n
= gimple_switch_num_labels (stmt
);
4942 /* Mark all the destination basic blocks. */
4943 for (i
= 0; i
< n
; ++i
)
4945 tree lab
= CASE_LABEL (gimple_switch_label (stmt
, i
));
4946 basic_block label_bb
= label_to_block (lab
);
4947 gcc_assert (!label_bb
->aux
|| label_bb
->aux
== (void *)1);
4948 label_bb
->aux
= (void *)1;
4951 /* Verify that the case labels are sorted. */
4952 prev
= gimple_switch_label (stmt
, 0);
4953 for (i
= 1; i
< n
; ++i
)
4955 tree c
= gimple_switch_label (stmt
, i
);
4958 error ("found default case not at the start of "
4964 && !tree_int_cst_lt (CASE_LOW (prev
), CASE_LOW (c
)))
4966 error ("case labels not sorted: ");
4967 print_generic_expr (stderr
, prev
, 0);
4968 fprintf (stderr
," is greater than ");
4969 print_generic_expr (stderr
, c
, 0);
4970 fprintf (stderr
," but comes before it.\n");
4975 /* VRP will remove the default case if it can prove it will
4976 never be executed. So do not verify there always exists
4977 a default case here. */
4979 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
4983 error ("extra outgoing edge %d->%d",
4984 bb
->index
, e
->dest
->index
);
4988 e
->dest
->aux
= (void *)2;
4989 if ((e
->flags
& (EDGE_FALLTHRU
| EDGE_ABNORMAL
4990 | EDGE_TRUE_VALUE
| EDGE_FALSE_VALUE
)))
4992 error ("wrong outgoing edge flags at end of bb %d",
4998 /* Check that we have all of them. */
4999 for (i
= 0; i
< n
; ++i
)
5001 tree lab
= CASE_LABEL (gimple_switch_label (stmt
, i
));
5002 basic_block label_bb
= label_to_block (lab
);
5004 if (label_bb
->aux
!= (void *)2)
5006 error ("missing edge %i->%i", bb
->index
, label_bb
->index
);
5011 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
5012 e
->dest
->aux
= (void *)0;
5016 case GIMPLE_EH_DISPATCH
:
5017 err
|= verify_eh_dispatch_edge (stmt
);
5025 if (dom_info_state (CDI_DOMINATORS
) >= DOM_NO_FAST_QUERY
)
5026 verify_dominators (CDI_DOMINATORS
);
5032 /* Updates phi nodes after creating a forwarder block joined
5033 by edge FALLTHRU. */
5036 gimple_make_forwarder_block (edge fallthru
)
5040 basic_block dummy
, bb
;
5042 gimple_stmt_iterator gsi
;
5044 dummy
= fallthru
->src
;
5045 bb
= fallthru
->dest
;
5047 if (single_pred_p (bb
))
5050 /* If we redirected a branch we must create new PHI nodes at the
5052 for (gsi
= gsi_start_phis (dummy
); !gsi_end_p (gsi
); gsi_next (&gsi
))
5054 gimple phi
, new_phi
;
5056 phi
= gsi_stmt (gsi
);
5057 var
= gimple_phi_result (phi
);
5058 new_phi
= create_phi_node (var
, bb
);
5059 gimple_phi_set_result (phi
, copy_ssa_name (var
, phi
));
5060 add_phi_arg (new_phi
, gimple_phi_result (phi
), fallthru
,
5064 /* Add the arguments we have stored on edges. */
5065 FOR_EACH_EDGE (e
, ei
, bb
->preds
)
5070 flush_pending_stmts (e
);
5075 /* Return a non-special label in the head of basic block BLOCK.
5076 Create one if it doesn't exist. */
5079 gimple_block_label (basic_block bb
)
5081 gimple_stmt_iterator i
, s
= gsi_start_bb (bb
);
5086 for (i
= s
; !gsi_end_p (i
); first
= false, gsi_next (&i
))
5088 stmt
= gsi_stmt (i
);
5089 if (gimple_code (stmt
) != GIMPLE_LABEL
)
5091 label
= gimple_label_label (stmt
);
5092 if (!DECL_NONLOCAL (label
))
5095 gsi_move_before (&i
, &s
);
5100 label
= create_artificial_label (UNKNOWN_LOCATION
);
5101 stmt
= gimple_build_label (label
);
5102 gsi_insert_before (&s
, stmt
, GSI_NEW_STMT
);
5107 /* Attempt to perform edge redirection by replacing a possibly complex
5108 jump instruction by a goto or by removing the jump completely.
5109 This can apply only if all edges now point to the same block. The
5110 parameters and return values are equivalent to
5111 redirect_edge_and_branch. */
5114 gimple_try_redirect_by_replacing_jump (edge e
, basic_block target
)
5116 basic_block src
= e
->src
;
5117 gimple_stmt_iterator i
;
5120 /* We can replace or remove a complex jump only when we have exactly
5122 if (EDGE_COUNT (src
->succs
) != 2
5123 /* Verify that all targets will be TARGET. Specifically, the
5124 edge that is not E must also go to TARGET. */
5125 || EDGE_SUCC (src
, EDGE_SUCC (src
, 0) == e
)->dest
!= target
)
5128 i
= gsi_last_bb (src
);
5132 stmt
= gsi_stmt (i
);
5134 if (gimple_code (stmt
) == GIMPLE_COND
|| gimple_code (stmt
) == GIMPLE_SWITCH
)
5136 gsi_remove (&i
, true);
5137 e
= ssa_redirect_edge (e
, target
);
5138 e
->flags
= EDGE_FALLTHRU
;
5146 /* Redirect E to DEST. Return NULL on failure. Otherwise, return the
5147 edge representing the redirected branch. */
5150 gimple_redirect_edge_and_branch (edge e
, basic_block dest
)
5152 basic_block bb
= e
->src
;
5153 gimple_stmt_iterator gsi
;
5157 if (e
->flags
& EDGE_ABNORMAL
)
5160 if (e
->dest
== dest
)
5163 if (e
->flags
& EDGE_EH
)
5164 return redirect_eh_edge (e
, dest
);
5166 if (e
->src
!= ENTRY_BLOCK_PTR
)
5168 ret
= gimple_try_redirect_by_replacing_jump (e
, dest
);
5173 gsi
= gsi_last_bb (bb
);
5174 stmt
= gsi_end_p (gsi
) ? NULL
: gsi_stmt (gsi
);
5176 switch (stmt
? gimple_code (stmt
) : GIMPLE_ERROR_MARK
)
5179 /* For COND_EXPR, we only need to redirect the edge. */
5183 /* No non-abnormal edges should lead from a non-simple goto, and
5184 simple ones should be represented implicitly. */
5189 tree label
= gimple_block_label (dest
);
5190 tree cases
= get_cases_for_edge (e
, stmt
);
5192 /* If we have a list of cases associated with E, then use it
5193 as it's a lot faster than walking the entire case vector. */
5196 edge e2
= find_edge (e
->src
, dest
);
5203 CASE_LABEL (cases
) = label
;
5204 cases
= CASE_CHAIN (cases
);
5207 /* If there was already an edge in the CFG, then we need
5208 to move all the cases associated with E to E2. */
5211 tree cases2
= get_cases_for_edge (e2
, stmt
);
5213 CASE_CHAIN (last
) = CASE_CHAIN (cases2
);
5214 CASE_CHAIN (cases2
) = first
;
5216 bitmap_set_bit (touched_switch_bbs
, gimple_bb (stmt
)->index
);
5220 size_t i
, n
= gimple_switch_num_labels (stmt
);
5222 for (i
= 0; i
< n
; i
++)
5224 tree elt
= gimple_switch_label (stmt
, i
);
5225 if (label_to_block (CASE_LABEL (elt
)) == e
->dest
)
5226 CASE_LABEL (elt
) = label
;
5234 int i
, n
= gimple_asm_nlabels (stmt
);
5237 for (i
= 0; i
< n
; ++i
)
5239 tree cons
= gimple_asm_label_op (stmt
, i
);
5240 if (label_to_block (TREE_VALUE (cons
)) == e
->dest
)
5243 label
= gimple_block_label (dest
);
5244 TREE_VALUE (cons
) = label
;
5248 /* If we didn't find any label matching the former edge in the
5249 asm labels, we must be redirecting the fallthrough
5251 gcc_assert (label
|| (e
->flags
& EDGE_FALLTHRU
));
5256 gsi_remove (&gsi
, true);
5257 e
->flags
|= EDGE_FALLTHRU
;
5260 case GIMPLE_OMP_RETURN
:
5261 case GIMPLE_OMP_CONTINUE
:
5262 case GIMPLE_OMP_SECTIONS_SWITCH
:
5263 case GIMPLE_OMP_FOR
:
5264 /* The edges from OMP constructs can be simply redirected. */
5267 case GIMPLE_EH_DISPATCH
:
5268 if (!(e
->flags
& EDGE_FALLTHRU
))
5269 redirect_eh_dispatch_edge (stmt
, e
, dest
);
5272 case GIMPLE_TRANSACTION
:
5273 /* The ABORT edge has a stored label associated with it, otherwise
5274 the edges are simply redirectable. */
5276 gimple_transaction_set_label (stmt
, gimple_block_label (dest
));
5280 /* Otherwise it must be a fallthru edge, and we don't need to
5281 do anything besides redirecting it. */
5282 gcc_assert (e
->flags
& EDGE_FALLTHRU
);
5286 /* Update/insert PHI nodes as necessary. */
5288 /* Now update the edges in the CFG. */
5289 e
= ssa_redirect_edge (e
, dest
);
5294 /* Returns true if it is possible to remove edge E by redirecting
5295 it to the destination of the other edge from E->src. */
5298 gimple_can_remove_branch_p (const_edge e
)
5300 if (e
->flags
& (EDGE_ABNORMAL
| EDGE_EH
))
5306 /* Simple wrapper, as we can always redirect fallthru edges. */
5309 gimple_redirect_edge_and_branch_force (edge e
, basic_block dest
)
5311 e
= gimple_redirect_edge_and_branch (e
, dest
);
5318 /* Splits basic block BB after statement STMT (but at least after the
5319 labels). If STMT is NULL, BB is split just after the labels. */
5322 gimple_split_block (basic_block bb
, void *stmt
)
5324 gimple_stmt_iterator gsi
;
5325 gimple_stmt_iterator gsi_tgt
;
5332 new_bb
= create_empty_bb (bb
);
5334 /* Redirect the outgoing edges. */
5335 new_bb
->succs
= bb
->succs
;
5337 FOR_EACH_EDGE (e
, ei
, new_bb
->succs
)
5340 if (stmt
&& gimple_code ((gimple
) stmt
) == GIMPLE_LABEL
)
5343 /* Move everything from GSI to the new basic block. */
5344 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
5346 act
= gsi_stmt (gsi
);
5347 if (gimple_code (act
) == GIMPLE_LABEL
)
5360 if (gsi_end_p (gsi
))
5363 /* Split the statement list - avoid re-creating new containers as this
5364 brings ugly quadratic memory consumption in the inliner.
5365 (We are still quadratic since we need to update stmt BB pointers,
5367 gsi_split_seq_before (&gsi
, &list
);
5368 set_bb_seq (new_bb
, list
);
5369 for (gsi_tgt
= gsi_start (list
);
5370 !gsi_end_p (gsi_tgt
); gsi_next (&gsi_tgt
))
5371 gimple_set_bb (gsi_stmt (gsi_tgt
), new_bb
);
5377 /* Moves basic block BB after block AFTER. */
5380 gimple_move_block_after (basic_block bb
, basic_block after
)
5382 if (bb
->prev_bb
== after
)
5386 link_block (bb
, after
);
5392 /* Return TRUE if block BB has no executable statements, otherwise return
5396 gimple_empty_block_p (basic_block bb
)
5398 /* BB must have no executable statements. */
5399 gimple_stmt_iterator gsi
= gsi_after_labels (bb
);
5402 if (gsi_end_p (gsi
))
5404 if (is_gimple_debug (gsi_stmt (gsi
)))
5405 gsi_next_nondebug (&gsi
);
5406 return gsi_end_p (gsi
);
5410 /* Split a basic block if it ends with a conditional branch and if the
5411 other part of the block is not empty. */
5414 gimple_split_block_before_cond_jump (basic_block bb
)
5416 gimple last
, split_point
;
5417 gimple_stmt_iterator gsi
= gsi_last_nondebug_bb (bb
);
5418 if (gsi_end_p (gsi
))
5420 last
= gsi_stmt (gsi
);
5421 if (gimple_code (last
) != GIMPLE_COND
5422 && gimple_code (last
) != GIMPLE_SWITCH
)
5424 gsi_prev_nondebug (&gsi
);
5425 split_point
= gsi_stmt (gsi
);
5426 return split_block (bb
, split_point
)->dest
;
5430 /* Return true if basic_block can be duplicated. */
5433 gimple_can_duplicate_bb_p (const_basic_block bb ATTRIBUTE_UNUSED
)
5438 /* Create a duplicate of the basic block BB. NOTE: This does not
5439 preserve SSA form. */
5442 gimple_duplicate_bb (basic_block bb
)
5445 gimple_stmt_iterator gsi
, gsi_tgt
;
5446 gimple_seq phis
= phi_nodes (bb
);
5447 gimple phi
, stmt
, copy
;
5449 new_bb
= create_empty_bb (EXIT_BLOCK_PTR
->prev_bb
);
5451 /* Copy the PHI nodes. We ignore PHI node arguments here because
5452 the incoming edges have not been setup yet. */
5453 for (gsi
= gsi_start (phis
); !gsi_end_p (gsi
); gsi_next (&gsi
))
5455 phi
= gsi_stmt (gsi
);
5456 copy
= create_phi_node (NULL_TREE
, new_bb
);
5457 create_new_def_for (gimple_phi_result (phi
), copy
,
5458 gimple_phi_result_ptr (copy
));
5459 gimple_set_uid (copy
, gimple_uid (phi
));
5462 gsi_tgt
= gsi_start_bb (new_bb
);
5463 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
5465 def_operand_p def_p
;
5466 ssa_op_iter op_iter
;
5469 stmt
= gsi_stmt (gsi
);
5470 if (gimple_code (stmt
) == GIMPLE_LABEL
)
5473 /* Don't duplicate label debug stmts. */
5474 if (gimple_debug_bind_p (stmt
)
5475 && TREE_CODE (gimple_debug_bind_get_var (stmt
))
5479 /* Create a new copy of STMT and duplicate STMT's virtual
5481 copy
= gimple_copy (stmt
);
5482 gsi_insert_after (&gsi_tgt
, copy
, GSI_NEW_STMT
);
5484 maybe_duplicate_eh_stmt (copy
, stmt
);
5485 gimple_duplicate_stmt_histograms (cfun
, copy
, cfun
, stmt
);
5487 /* When copying around a stmt writing into a local non-user
5488 aggregate, make sure it won't share stack slot with other
5490 lhs
= gimple_get_lhs (stmt
);
5491 if (lhs
&& TREE_CODE (lhs
) != SSA_NAME
)
5493 tree base
= get_base_address (lhs
);
5495 && (TREE_CODE (base
) == VAR_DECL
5496 || TREE_CODE (base
) == RESULT_DECL
)
5497 && DECL_IGNORED_P (base
)
5498 && !TREE_STATIC (base
)
5499 && !DECL_EXTERNAL (base
)
5500 && (TREE_CODE (base
) != VAR_DECL
5501 || !DECL_HAS_VALUE_EXPR_P (base
)))
5502 DECL_NONSHAREABLE (base
) = 1;
5505 /* Create new names for all the definitions created by COPY and
5506 add replacement mappings for each new name. */
5507 FOR_EACH_SSA_DEF_OPERAND (def_p
, copy
, op_iter
, SSA_OP_ALL_DEFS
)
5508 create_new_def_for (DEF_FROM_PTR (def_p
), copy
, def_p
);
5514 /* Adds phi node arguments for edge E_COPY after basic block duplication. */
5517 add_phi_args_after_copy_edge (edge e_copy
)
5519 basic_block bb
, bb_copy
= e_copy
->src
, dest
;
5522 gimple phi
, phi_copy
;
5524 gimple_stmt_iterator psi
, psi_copy
;
5526 if (gimple_seq_empty_p (phi_nodes (e_copy
->dest
)))
5529 bb
= bb_copy
->flags
& BB_DUPLICATED
? get_bb_original (bb_copy
) : bb_copy
;
5531 if (e_copy
->dest
->flags
& BB_DUPLICATED
)
5532 dest
= get_bb_original (e_copy
->dest
);
5534 dest
= e_copy
->dest
;
5536 e
= find_edge (bb
, dest
);
5539 /* During loop unrolling the target of the latch edge is copied.
5540 In this case we are not looking for edge to dest, but to
5541 duplicated block whose original was dest. */
5542 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
5544 if ((e
->dest
->flags
& BB_DUPLICATED
)
5545 && get_bb_original (e
->dest
) == dest
)
5549 gcc_assert (e
!= NULL
);
5552 for (psi
= gsi_start_phis (e
->dest
),
5553 psi_copy
= gsi_start_phis (e_copy
->dest
);
5555 gsi_next (&psi
), gsi_next (&psi_copy
))
5557 phi
= gsi_stmt (psi
);
5558 phi_copy
= gsi_stmt (psi_copy
);
5559 def
= PHI_ARG_DEF_FROM_EDGE (phi
, e
);
5560 add_phi_arg (phi_copy
, def
, e_copy
,
5561 gimple_phi_arg_location_from_edge (phi
, e
));
5566 /* Basic block BB_COPY was created by code duplication. Add phi node
5567 arguments for edges going out of BB_COPY. The blocks that were
5568 duplicated have BB_DUPLICATED set. */
5571 add_phi_args_after_copy_bb (basic_block bb_copy
)
5576 FOR_EACH_EDGE (e_copy
, ei
, bb_copy
->succs
)
5578 add_phi_args_after_copy_edge (e_copy
);
5582 /* Blocks in REGION_COPY array of length N_REGION were created by
5583 duplication of basic blocks. Add phi node arguments for edges
5584 going from these blocks. If E_COPY is not NULL, also add
5585 phi node arguments for its destination.*/
5588 add_phi_args_after_copy (basic_block
*region_copy
, unsigned n_region
,
5593 for (i
= 0; i
< n_region
; i
++)
5594 region_copy
[i
]->flags
|= BB_DUPLICATED
;
5596 for (i
= 0; i
< n_region
; i
++)
5597 add_phi_args_after_copy_bb (region_copy
[i
]);
5599 add_phi_args_after_copy_edge (e_copy
);
5601 for (i
= 0; i
< n_region
; i
++)
5602 region_copy
[i
]->flags
&= ~BB_DUPLICATED
;
5605 /* Duplicates a REGION (set of N_REGION basic blocks) with just a single
5606 important exit edge EXIT. By important we mean that no SSA name defined
5607 inside region is live over the other exit edges of the region. All entry
5608 edges to the region must go to ENTRY->dest. The edge ENTRY is redirected
5609 to the duplicate of the region. Dominance and loop information is
5610 updated if UPDATE_DOMINANCE is true, but not the SSA web. If
5611 UPDATE_DOMINANCE is false then we assume that the caller will update the
5612 dominance information after calling this function. The new basic
5613 blocks are stored to REGION_COPY in the same order as they had in REGION,
5614 provided that REGION_COPY is not NULL.
5615 The function returns false if it is unable to copy the region,
5619 gimple_duplicate_sese_region (edge entry
, edge exit
,
5620 basic_block
*region
, unsigned n_region
,
5621 basic_block
*region_copy
,
5622 bool update_dominance
)
5625 bool free_region_copy
= false, copying_header
= false;
5626 struct loop
*loop
= entry
->dest
->loop_father
;
5628 vec
<basic_block
> doms
;
5630 int total_freq
= 0, entry_freq
= 0;
5631 gcov_type total_count
= 0, entry_count
= 0;
5633 if (!can_copy_bbs_p (region
, n_region
))
5636 /* Some sanity checking. Note that we do not check for all possible
5637 missuses of the functions. I.e. if you ask to copy something weird,
5638 it will work, but the state of structures probably will not be
5640 for (i
= 0; i
< n_region
; i
++)
5642 /* We do not handle subloops, i.e. all the blocks must belong to the
5644 if (region
[i
]->loop_father
!= loop
)
5647 if (region
[i
] != entry
->dest
5648 && region
[i
] == loop
->header
)
5652 set_loop_copy (loop
, loop
);
5654 /* In case the function is used for loop header copying (which is the primary
5655 use), ensure that EXIT and its copy will be new latch and entry edges. */
5656 if (loop
->header
== entry
->dest
)
5658 copying_header
= true;
5659 set_loop_copy (loop
, loop_outer (loop
));
5661 if (!dominated_by_p (CDI_DOMINATORS
, loop
->latch
, exit
->src
))
5664 for (i
= 0; i
< n_region
; i
++)
5665 if (region
[i
] != exit
->src
5666 && dominated_by_p (CDI_DOMINATORS
, region
[i
], exit
->src
))
5672 region_copy
= XNEWVEC (basic_block
, n_region
);
5673 free_region_copy
= true;
5676 initialize_original_copy_tables ();
5678 /* Record blocks outside the region that are dominated by something
5680 if (update_dominance
)
5683 doms
= get_dominated_by_region (CDI_DOMINATORS
, region
, n_region
);
5686 if (entry
->dest
->count
)
5688 total_count
= entry
->dest
->count
;
5689 entry_count
= entry
->count
;
5690 /* Fix up corner cases, to avoid division by zero or creation of negative
5692 if (entry_count
> total_count
)
5693 entry_count
= total_count
;
5697 total_freq
= entry
->dest
->frequency
;
5698 entry_freq
= EDGE_FREQUENCY (entry
);
5699 /* Fix up corner cases, to avoid division by zero or creation of negative
5701 if (total_freq
== 0)
5703 else if (entry_freq
> total_freq
)
5704 entry_freq
= total_freq
;
5707 copy_bbs (region
, n_region
, region_copy
, &exit
, 1, &exit_copy
, loop
,
5708 split_edge_bb_loc (entry
), update_dominance
);
5711 scale_bbs_frequencies_gcov_type (region
, n_region
,
5712 total_count
- entry_count
,
5714 scale_bbs_frequencies_gcov_type (region_copy
, n_region
, entry_count
,
5719 scale_bbs_frequencies_int (region
, n_region
, total_freq
- entry_freq
,
5721 scale_bbs_frequencies_int (region_copy
, n_region
, entry_freq
, total_freq
);
5726 loop
->header
= exit
->dest
;
5727 loop
->latch
= exit
->src
;
5730 /* Redirect the entry and add the phi node arguments. */
5731 redirected
= redirect_edge_and_branch (entry
, get_bb_copy (entry
->dest
));
5732 gcc_assert (redirected
!= NULL
);
5733 flush_pending_stmts (entry
);
5735 /* Concerning updating of dominators: We must recount dominators
5736 for entry block and its copy. Anything that is outside of the
5737 region, but was dominated by something inside needs recounting as
5739 if (update_dominance
)
5741 set_immediate_dominator (CDI_DOMINATORS
, entry
->dest
, entry
->src
);
5742 doms
.safe_push (get_bb_original (entry
->dest
));
5743 iterate_fix_dominators (CDI_DOMINATORS
, doms
, false);
5747 /* Add the other PHI node arguments. */
5748 add_phi_args_after_copy (region_copy
, n_region
, NULL
);
5750 if (free_region_copy
)
5753 free_original_copy_tables ();
5757 /* Checks if BB is part of the region defined by N_REGION BBS. */
5759 bb_part_of_region_p (basic_block bb
, basic_block
* bbs
, unsigned n_region
)
5763 for (n
= 0; n
< n_region
; n
++)
5771 /* Duplicates REGION consisting of N_REGION blocks. The new blocks
5772 are stored to REGION_COPY in the same order in that they appear
5773 in REGION, if REGION_COPY is not NULL. ENTRY is the entry to
5774 the region, EXIT an exit from it. The condition guarding EXIT
5775 is moved to ENTRY. Returns true if duplication succeeds, false
5801 gimple_duplicate_sese_tail (edge entry ATTRIBUTE_UNUSED
, edge exit ATTRIBUTE_UNUSED
,
5802 basic_block
*region ATTRIBUTE_UNUSED
, unsigned n_region ATTRIBUTE_UNUSED
,
5803 basic_block
*region_copy ATTRIBUTE_UNUSED
)
5806 bool free_region_copy
= false;
5807 struct loop
*loop
= exit
->dest
->loop_father
;
5808 struct loop
*orig_loop
= entry
->dest
->loop_father
;
5809 basic_block switch_bb
, entry_bb
, nentry_bb
;
5810 vec
<basic_block
> doms
;
5811 int total_freq
= 0, exit_freq
= 0;
5812 gcov_type total_count
= 0, exit_count
= 0;
5813 edge exits
[2], nexits
[2], e
;
5814 gimple_stmt_iterator gsi
;
5817 basic_block exit_bb
;
5818 gimple_stmt_iterator psi
;
5821 struct loop
*target
, *aloop
, *cloop
;
5823 gcc_assert (EDGE_COUNT (exit
->src
->succs
) == 2);
5825 exits
[1] = EDGE_SUCC (exit
->src
, EDGE_SUCC (exit
->src
, 0) == exit
);
5827 if (!can_copy_bbs_p (region
, n_region
))
5830 initialize_original_copy_tables ();
5831 set_loop_copy (orig_loop
, loop
);
5834 for (aloop
= orig_loop
->inner
; aloop
; aloop
= aloop
->next
)
5836 if (bb_part_of_region_p (aloop
->header
, region
, n_region
))
5838 cloop
= duplicate_loop (aloop
, target
);
5839 duplicate_subloops (aloop
, cloop
);
5845 region_copy
= XNEWVEC (basic_block
, n_region
);
5846 free_region_copy
= true;
5849 gcc_assert (!need_ssa_update_p (cfun
));
5851 /* Record blocks outside the region that are dominated by something
5853 doms
= get_dominated_by_region (CDI_DOMINATORS
, region
, n_region
);
5855 if (exit
->src
->count
)
5857 total_count
= exit
->src
->count
;
5858 exit_count
= exit
->count
;
5859 /* Fix up corner cases, to avoid division by zero or creation of negative
5861 if (exit_count
> total_count
)
5862 exit_count
= total_count
;
5866 total_freq
= exit
->src
->frequency
;
5867 exit_freq
= EDGE_FREQUENCY (exit
);
5868 /* Fix up corner cases, to avoid division by zero or creation of negative
5870 if (total_freq
== 0)
5872 if (exit_freq
> total_freq
)
5873 exit_freq
= total_freq
;
5876 copy_bbs (region
, n_region
, region_copy
, exits
, 2, nexits
, orig_loop
,
5877 split_edge_bb_loc (exit
), true);
5880 scale_bbs_frequencies_gcov_type (region
, n_region
,
5881 total_count
- exit_count
,
5883 scale_bbs_frequencies_gcov_type (region_copy
, n_region
, exit_count
,
5888 scale_bbs_frequencies_int (region
, n_region
, total_freq
- exit_freq
,
5890 scale_bbs_frequencies_int (region_copy
, n_region
, exit_freq
, total_freq
);
5893 /* Create the switch block, and put the exit condition to it. */
5894 entry_bb
= entry
->dest
;
5895 nentry_bb
= get_bb_copy (entry_bb
);
5896 if (!last_stmt (entry
->src
)
5897 || !stmt_ends_bb_p (last_stmt (entry
->src
)))
5898 switch_bb
= entry
->src
;
5900 switch_bb
= split_edge (entry
);
5901 set_immediate_dominator (CDI_DOMINATORS
, nentry_bb
, switch_bb
);
5903 gsi
= gsi_last_bb (switch_bb
);
5904 cond_stmt
= last_stmt (exit
->src
);
5905 gcc_assert (gimple_code (cond_stmt
) == GIMPLE_COND
);
5906 cond_stmt
= gimple_copy (cond_stmt
);
5908 gsi_insert_after (&gsi
, cond_stmt
, GSI_NEW_STMT
);
5910 sorig
= single_succ_edge (switch_bb
);
5911 sorig
->flags
= exits
[1]->flags
;
5912 snew
= make_edge (switch_bb
, nentry_bb
, exits
[0]->flags
);
5914 /* Register the new edge from SWITCH_BB in loop exit lists. */
5915 rescan_loop_exit (snew
, true, false);
5917 /* Add the PHI node arguments. */
5918 add_phi_args_after_copy (region_copy
, n_region
, snew
);
5920 /* Get rid of now superfluous conditions and associated edges (and phi node
5922 exit_bb
= exit
->dest
;
5924 e
= redirect_edge_and_branch (exits
[0], exits
[1]->dest
);
5925 PENDING_STMT (e
) = NULL
;
5927 /* The latch of ORIG_LOOP was copied, and so was the backedge
5928 to the original header. We redirect this backedge to EXIT_BB. */
5929 for (i
= 0; i
< n_region
; i
++)
5930 if (get_bb_original (region_copy
[i
]) == orig_loop
->latch
)
5932 gcc_assert (single_succ_edge (region_copy
[i
]));
5933 e
= redirect_edge_and_branch (single_succ_edge (region_copy
[i
]), exit_bb
);
5934 PENDING_STMT (e
) = NULL
;
5935 for (psi
= gsi_start_phis (exit_bb
);
5939 phi
= gsi_stmt (psi
);
5940 def
= PHI_ARG_DEF (phi
, nexits
[0]->dest_idx
);
5941 add_phi_arg (phi
, def
, e
, gimple_phi_arg_location_from_edge (phi
, e
));
5944 e
= redirect_edge_and_branch (nexits
[1], nexits
[0]->dest
);
5945 PENDING_STMT (e
) = NULL
;
5947 /* Anything that is outside of the region, but was dominated by something
5948 inside needs to update dominance info. */
5949 iterate_fix_dominators (CDI_DOMINATORS
, doms
, false);
5951 /* Update the SSA web. */
5952 update_ssa (TODO_update_ssa
);
5954 if (free_region_copy
)
5957 free_original_copy_tables ();
5961 /* Add all the blocks dominated by ENTRY to the array BBS_P. Stop
5962 adding blocks when the dominator traversal reaches EXIT. This
5963 function silently assumes that ENTRY strictly dominates EXIT. */
5966 gather_blocks_in_sese_region (basic_block entry
, basic_block exit
,
5967 vec
<basic_block
> *bbs_p
)
5971 for (son
= first_dom_son (CDI_DOMINATORS
, entry
);
5973 son
= next_dom_son (CDI_DOMINATORS
, son
))
5975 bbs_p
->safe_push (son
);
5977 gather_blocks_in_sese_region (son
, exit
, bbs_p
);
5981 /* Replaces *TP with a duplicate (belonging to function TO_CONTEXT).
5982 The duplicates are recorded in VARS_MAP. */
5985 replace_by_duplicate_decl (tree
*tp
, struct pointer_map_t
*vars_map
,
5988 tree t
= *tp
, new_t
;
5989 struct function
*f
= DECL_STRUCT_FUNCTION (to_context
);
5992 if (DECL_CONTEXT (t
) == to_context
)
5995 loc
= pointer_map_contains (vars_map
, t
);
5999 loc
= pointer_map_insert (vars_map
, t
);
6003 new_t
= copy_var_decl (t
, DECL_NAME (t
), TREE_TYPE (t
));
6004 add_local_decl (f
, new_t
);
6008 gcc_assert (TREE_CODE (t
) == CONST_DECL
);
6009 new_t
= copy_node (t
);
6011 DECL_CONTEXT (new_t
) = to_context
;
6016 new_t
= (tree
) *loc
;
6022 /* Creates an ssa name in TO_CONTEXT equivalent to NAME.
6023 VARS_MAP maps old ssa names and var_decls to the new ones. */
6026 replace_ssa_name (tree name
, struct pointer_map_t
*vars_map
,
6032 gcc_assert (!virtual_operand_p (name
));
6034 loc
= pointer_map_contains (vars_map
, name
);
6038 tree decl
= SSA_NAME_VAR (name
);
6041 replace_by_duplicate_decl (&decl
, vars_map
, to_context
);
6042 new_name
= make_ssa_name_fn (DECL_STRUCT_FUNCTION (to_context
),
6043 decl
, SSA_NAME_DEF_STMT (name
));
6044 if (SSA_NAME_IS_DEFAULT_DEF (name
))
6045 set_ssa_default_def (DECL_STRUCT_FUNCTION (to_context
),
6049 new_name
= copy_ssa_name_fn (DECL_STRUCT_FUNCTION (to_context
),
6050 name
, SSA_NAME_DEF_STMT (name
));
6052 loc
= pointer_map_insert (vars_map
, name
);
6056 new_name
= (tree
) *loc
;
6067 struct pointer_map_t
*vars_map
;
6068 htab_t new_label_map
;
6069 struct pointer_map_t
*eh_map
;
6073 /* Helper for move_block_to_fn. Set TREE_BLOCK in every expression
6074 contained in *TP if it has been ORIG_BLOCK previously and change the
6075 DECL_CONTEXT of every local variable referenced in *TP. */
6078 move_stmt_op (tree
*tp
, int *walk_subtrees
, void *data
)
6080 struct walk_stmt_info
*wi
= (struct walk_stmt_info
*) data
;
6081 struct move_stmt_d
*p
= (struct move_stmt_d
*) wi
->info
;
6086 tree block
= TREE_BLOCK (t
);
6087 if (block
== p
->orig_block
6088 || (p
->orig_block
== NULL_TREE
6089 && block
!= NULL_TREE
))
6090 TREE_SET_BLOCK (t
, p
->new_block
);
6091 #ifdef ENABLE_CHECKING
6092 else if (block
!= NULL_TREE
)
6094 while (block
&& TREE_CODE (block
) == BLOCK
&& block
!= p
->orig_block
)
6095 block
= BLOCK_SUPERCONTEXT (block
);
6096 gcc_assert (block
== p
->orig_block
);
6100 else if (DECL_P (t
) || TREE_CODE (t
) == SSA_NAME
)
6102 if (TREE_CODE (t
) == SSA_NAME
)
6103 *tp
= replace_ssa_name (t
, p
->vars_map
, p
->to_context
);
6104 else if (TREE_CODE (t
) == LABEL_DECL
)
6106 if (p
->new_label_map
)
6108 struct tree_map in
, *out
;
6110 out
= (struct tree_map
*)
6111 htab_find_with_hash (p
->new_label_map
, &in
, DECL_UID (t
));
6116 DECL_CONTEXT (t
) = p
->to_context
;
6118 else if (p
->remap_decls_p
)
6120 /* Replace T with its duplicate. T should no longer appear in the
6121 parent function, so this looks wasteful; however, it may appear
6122 in referenced_vars, and more importantly, as virtual operands of
6123 statements, and in alias lists of other variables. It would be
6124 quite difficult to expunge it from all those places. ??? It might
6125 suffice to do this for addressable variables. */
6126 if ((TREE_CODE (t
) == VAR_DECL
6127 && !is_global_var (t
))
6128 || TREE_CODE (t
) == CONST_DECL
)
6129 replace_by_duplicate_decl (tp
, p
->vars_map
, p
->to_context
);
6133 else if (TYPE_P (t
))
6139 /* Helper for move_stmt_r. Given an EH region number for the source
6140 function, map that to the duplicate EH regio number in the dest. */
6143 move_stmt_eh_region_nr (int old_nr
, struct move_stmt_d
*p
)
6145 eh_region old_r
, new_r
;
6148 old_r
= get_eh_region_from_number (old_nr
);
6149 slot
= pointer_map_contains (p
->eh_map
, old_r
);
6150 new_r
= (eh_region
) *slot
;
6152 return new_r
->index
;
6155 /* Similar, but operate on INTEGER_CSTs. */
6158 move_stmt_eh_region_tree_nr (tree old_t_nr
, struct move_stmt_d
*p
)
6162 old_nr
= tree_low_cst (old_t_nr
, 0);
6163 new_nr
= move_stmt_eh_region_nr (old_nr
, p
);
6165 return build_int_cst (integer_type_node
, new_nr
);
6168 /* Like move_stmt_op, but for gimple statements.
6170 Helper for move_block_to_fn. Set GIMPLE_BLOCK in every expression
6171 contained in the current statement in *GSI_P and change the
6172 DECL_CONTEXT of every local variable referenced in the current
6176 move_stmt_r (gimple_stmt_iterator
*gsi_p
, bool *handled_ops_p
,
6177 struct walk_stmt_info
*wi
)
6179 struct move_stmt_d
*p
= (struct move_stmt_d
*) wi
->info
;
6180 gimple stmt
= gsi_stmt (*gsi_p
);
6181 tree block
= gimple_block (stmt
);
6183 if (block
== p
->orig_block
6184 || (p
->orig_block
== NULL_TREE
6185 && block
!= NULL_TREE
))
6186 gimple_set_block (stmt
, p
->new_block
);
6188 switch (gimple_code (stmt
))
6191 /* Remap the region numbers for __builtin_eh_{pointer,filter}. */
6193 tree r
, fndecl
= gimple_call_fndecl (stmt
);
6194 if (fndecl
&& DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
)
6195 switch (DECL_FUNCTION_CODE (fndecl
))
6197 case BUILT_IN_EH_COPY_VALUES
:
6198 r
= gimple_call_arg (stmt
, 1);
6199 r
= move_stmt_eh_region_tree_nr (r
, p
);
6200 gimple_call_set_arg (stmt
, 1, r
);
6203 case BUILT_IN_EH_POINTER
:
6204 case BUILT_IN_EH_FILTER
:
6205 r
= gimple_call_arg (stmt
, 0);
6206 r
= move_stmt_eh_region_tree_nr (r
, p
);
6207 gimple_call_set_arg (stmt
, 0, r
);
6218 int r
= gimple_resx_region (stmt
);
6219 r
= move_stmt_eh_region_nr (r
, p
);
6220 gimple_resx_set_region (stmt
, r
);
6224 case GIMPLE_EH_DISPATCH
:
6226 int r
= gimple_eh_dispatch_region (stmt
);
6227 r
= move_stmt_eh_region_nr (r
, p
);
6228 gimple_eh_dispatch_set_region (stmt
, r
);
6232 case GIMPLE_OMP_RETURN
:
6233 case GIMPLE_OMP_CONTINUE
:
6236 if (is_gimple_omp (stmt
))
6238 /* Do not remap variables inside OMP directives. Variables
6239 referenced in clauses and directive header belong to the
6240 parent function and should not be moved into the child
6242 bool save_remap_decls_p
= p
->remap_decls_p
;
6243 p
->remap_decls_p
= false;
6244 *handled_ops_p
= true;
6246 walk_gimple_seq_mod (gimple_omp_body_ptr (stmt
), move_stmt_r
,
6249 p
->remap_decls_p
= save_remap_decls_p
;
6257 /* Move basic block BB from function CFUN to function DEST_FN. The
6258 block is moved out of the original linked list and placed after
6259 block AFTER in the new list. Also, the block is removed from the
6260 original array of blocks and placed in DEST_FN's array of blocks.
6261 If UPDATE_EDGE_COUNT_P is true, the edge counts on both CFGs is
6262 updated to reflect the moved edges.
6264 The local variables are remapped to new instances, VARS_MAP is used
6265 to record the mapping. */
6268 move_block_to_fn (struct function
*dest_cfun
, basic_block bb
,
6269 basic_block after
, bool update_edge_count_p
,
6270 struct move_stmt_d
*d
)
6272 struct control_flow_graph
*cfg
;
6275 gimple_stmt_iterator si
;
6276 unsigned old_len
, new_len
;
6278 /* Remove BB from dominance structures. */
6279 delete_from_dominance_info (CDI_DOMINATORS
, bb
);
6281 /* Move BB from its current loop to the copy in the new function. */
6284 struct loop
*new_loop
= (struct loop
*)bb
->loop_father
->aux
;
6286 bb
->loop_father
= new_loop
;
6289 /* Link BB to the new linked list. */
6290 move_block_after (bb
, after
);
6292 /* Update the edge count in the corresponding flowgraphs. */
6293 if (update_edge_count_p
)
6294 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
6296 cfun
->cfg
->x_n_edges
--;
6297 dest_cfun
->cfg
->x_n_edges
++;
6300 /* Remove BB from the original basic block array. */
6301 (*cfun
->cfg
->x_basic_block_info
)[bb
->index
] = NULL
;
6302 cfun
->cfg
->x_n_basic_blocks
--;
6304 /* Grow DEST_CFUN's basic block array if needed. */
6305 cfg
= dest_cfun
->cfg
;
6306 cfg
->x_n_basic_blocks
++;
6307 if (bb
->index
>= cfg
->x_last_basic_block
)
6308 cfg
->x_last_basic_block
= bb
->index
+ 1;
6310 old_len
= vec_safe_length (cfg
->x_basic_block_info
);
6311 if ((unsigned) cfg
->x_last_basic_block
>= old_len
)
6313 new_len
= cfg
->x_last_basic_block
+ (cfg
->x_last_basic_block
+ 3) / 4;
6314 vec_safe_grow_cleared (cfg
->x_basic_block_info
, new_len
);
6317 (*cfg
->x_basic_block_info
)[bb
->index
] = bb
;
6319 /* Remap the variables in phi nodes. */
6320 for (si
= gsi_start_phis (bb
); !gsi_end_p (si
); )
6322 gimple phi
= gsi_stmt (si
);
6324 tree op
= PHI_RESULT (phi
);
6328 if (virtual_operand_p (op
))
6330 /* Remove the phi nodes for virtual operands (alias analysis will be
6331 run for the new function, anyway). */
6332 remove_phi_node (&si
, true);
6336 SET_PHI_RESULT (phi
,
6337 replace_ssa_name (op
, d
->vars_map
, dest_cfun
->decl
));
6338 FOR_EACH_PHI_ARG (use
, phi
, oi
, SSA_OP_USE
)
6340 op
= USE_FROM_PTR (use
);
6341 if (TREE_CODE (op
) == SSA_NAME
)
6342 SET_USE (use
, replace_ssa_name (op
, d
->vars_map
, dest_cfun
->decl
));
6345 for (i
= 0; i
< EDGE_COUNT (bb
->preds
); i
++)
6347 location_t locus
= gimple_phi_arg_location (phi
, i
);
6348 tree block
= LOCATION_BLOCK (locus
);
6350 if (locus
== UNKNOWN_LOCATION
)
6352 if (d
->orig_block
== NULL_TREE
|| block
== d
->orig_block
)
6354 if (d
->new_block
== NULL_TREE
)
6355 locus
= LOCATION_LOCUS (locus
);
6357 locus
= COMBINE_LOCATION_DATA (line_table
, locus
, d
->new_block
);
6358 gimple_phi_arg_set_location (phi
, i
, locus
);
6365 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
6367 gimple stmt
= gsi_stmt (si
);
6368 struct walk_stmt_info wi
;
6370 memset (&wi
, 0, sizeof (wi
));
6372 walk_gimple_stmt (&si
, move_stmt_r
, move_stmt_op
, &wi
);
6374 if (gimple_code (stmt
) == GIMPLE_LABEL
)
6376 tree label
= gimple_label_label (stmt
);
6377 int uid
= LABEL_DECL_UID (label
);
6379 gcc_assert (uid
> -1);
6381 old_len
= vec_safe_length (cfg
->x_label_to_block_map
);
6382 if (old_len
<= (unsigned) uid
)
6384 new_len
= 3 * uid
/ 2 + 1;
6385 vec_safe_grow_cleared (cfg
->x_label_to_block_map
, new_len
);
6388 (*cfg
->x_label_to_block_map
)[uid
] = bb
;
6389 (*cfun
->cfg
->x_label_to_block_map
)[uid
] = NULL
;
6391 gcc_assert (DECL_CONTEXT (label
) == dest_cfun
->decl
);
6393 if (uid
>= dest_cfun
->cfg
->last_label_uid
)
6394 dest_cfun
->cfg
->last_label_uid
= uid
+ 1;
6397 maybe_duplicate_eh_stmt_fn (dest_cfun
, stmt
, cfun
, stmt
, d
->eh_map
, 0);
6398 remove_stmt_from_eh_lp_fn (cfun
, stmt
);
6400 gimple_duplicate_stmt_histograms (dest_cfun
, stmt
, cfun
, stmt
);
6401 gimple_remove_stmt_histograms (cfun
, stmt
);
6403 /* We cannot leave any operands allocated from the operand caches of
6404 the current function. */
6405 free_stmt_operands (stmt
);
6406 push_cfun (dest_cfun
);
6411 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
6412 if (e
->goto_locus
!= UNKNOWN_LOCATION
)
6414 tree block
= LOCATION_BLOCK (e
->goto_locus
);
6415 if (d
->orig_block
== NULL_TREE
6416 || block
== d
->orig_block
)
6417 e
->goto_locus
= d
->new_block
?
6418 COMBINE_LOCATION_DATA (line_table
, e
->goto_locus
, d
->new_block
) :
6419 LOCATION_LOCUS (e
->goto_locus
);
6423 /* Examine the statements in BB (which is in SRC_CFUN); find and return
6424 the outermost EH region. Use REGION as the incoming base EH region. */
6427 find_outermost_region_in_block (struct function
*src_cfun
,
6428 basic_block bb
, eh_region region
)
6430 gimple_stmt_iterator si
;
6432 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
6434 gimple stmt
= gsi_stmt (si
);
6435 eh_region stmt_region
;
6438 lp_nr
= lookup_stmt_eh_lp_fn (src_cfun
, stmt
);
6439 stmt_region
= get_eh_region_from_lp_number_fn (src_cfun
, lp_nr
);
6443 region
= stmt_region
;
6444 else if (stmt_region
!= region
)
6446 region
= eh_region_outermost (src_cfun
, stmt_region
, region
);
6447 gcc_assert (region
!= NULL
);
6456 new_label_mapper (tree decl
, void *data
)
6458 htab_t hash
= (htab_t
) data
;
6462 gcc_assert (TREE_CODE (decl
) == LABEL_DECL
);
6464 m
= XNEW (struct tree_map
);
6465 m
->hash
= DECL_UID (decl
);
6466 m
->base
.from
= decl
;
6467 m
->to
= create_artificial_label (UNKNOWN_LOCATION
);
6468 LABEL_DECL_UID (m
->to
) = LABEL_DECL_UID (decl
);
6469 if (LABEL_DECL_UID (m
->to
) >= cfun
->cfg
->last_label_uid
)
6470 cfun
->cfg
->last_label_uid
= LABEL_DECL_UID (m
->to
) + 1;
6472 slot
= htab_find_slot_with_hash (hash
, m
, m
->hash
, INSERT
);
6473 gcc_assert (*slot
== NULL
);
6480 /* Change DECL_CONTEXT of all BLOCK_VARS in block, including
6484 replace_block_vars_by_duplicates (tree block
, struct pointer_map_t
*vars_map
,
6489 for (tp
= &BLOCK_VARS (block
); *tp
; tp
= &DECL_CHAIN (*tp
))
6492 if (TREE_CODE (t
) != VAR_DECL
&& TREE_CODE (t
) != CONST_DECL
)
6494 replace_by_duplicate_decl (&t
, vars_map
, to_context
);
6497 if (TREE_CODE (*tp
) == VAR_DECL
&& DECL_HAS_VALUE_EXPR_P (*tp
))
6499 SET_DECL_VALUE_EXPR (t
, DECL_VALUE_EXPR (*tp
));
6500 DECL_HAS_VALUE_EXPR_P (t
) = 1;
6502 DECL_CHAIN (t
) = DECL_CHAIN (*tp
);
6507 for (block
= BLOCK_SUBBLOCKS (block
); block
; block
= BLOCK_CHAIN (block
))
6508 replace_block_vars_by_duplicates (block
, vars_map
, to_context
);
6511 /* Fixup the loop arrays and numbers after moving LOOP and its subloops
6515 fixup_loop_arrays_after_move (struct function
*fn1
, struct function
*fn2
,
6518 /* Discard it from the old loop array. */
6519 (*get_loops (fn1
))[loop
->num
] = NULL
;
6521 /* Place it in the new loop array, assigning it a new number. */
6522 loop
->num
= number_of_loops (fn2
);
6523 vec_safe_push (loops_for_fn (fn2
)->larray
, loop
);
6525 /* Recurse to children. */
6526 for (loop
= loop
->inner
; loop
; loop
= loop
->next
)
6527 fixup_loop_arrays_after_move (fn1
, fn2
, loop
);
6530 /* Move a single-entry, single-exit region delimited by ENTRY_BB and
6531 EXIT_BB to function DEST_CFUN. The whole region is replaced by a
6532 single basic block in the original CFG and the new basic block is
6533 returned. DEST_CFUN must not have a CFG yet.
6535 Note that the region need not be a pure SESE region. Blocks inside
6536 the region may contain calls to abort/exit. The only restriction
6537 is that ENTRY_BB should be the only entry point and it must
6540 Change TREE_BLOCK of all statements in ORIG_BLOCK to the new
6541 functions outermost BLOCK, move all subblocks of ORIG_BLOCK
6542 to the new function.
6544 All local variables referenced in the region are assumed to be in
6545 the corresponding BLOCK_VARS and unexpanded variable lists
6546 associated with DEST_CFUN. */
6549 move_sese_region_to_fn (struct function
*dest_cfun
, basic_block entry_bb
,
6550 basic_block exit_bb
, tree orig_block
)
6552 vec
<basic_block
> bbs
, dom_bbs
;
6553 basic_block dom_entry
= get_immediate_dominator (CDI_DOMINATORS
, entry_bb
);
6554 basic_block after
, bb
, *entry_pred
, *exit_succ
, abb
;
6555 struct function
*saved_cfun
= cfun
;
6556 int *entry_flag
, *exit_flag
;
6557 unsigned *entry_prob
, *exit_prob
;
6558 unsigned i
, num_entry_edges
, num_exit_edges
, num_nodes
;
6561 htab_t new_label_map
;
6562 struct pointer_map_t
*vars_map
, *eh_map
;
6563 struct loop
*loop
= entry_bb
->loop_father
;
6564 struct loop
*loop0
= get_loop (saved_cfun
, 0);
6565 struct move_stmt_d d
;
6567 /* If ENTRY does not strictly dominate EXIT, this cannot be an SESE
6569 gcc_assert (entry_bb
!= exit_bb
6571 || dominated_by_p (CDI_DOMINATORS
, exit_bb
, entry_bb
)));
6573 /* Collect all the blocks in the region. Manually add ENTRY_BB
6574 because it won't be added by dfs_enumerate_from. */
6576 bbs
.safe_push (entry_bb
);
6577 gather_blocks_in_sese_region (entry_bb
, exit_bb
, &bbs
);
6579 /* The blocks that used to be dominated by something in BBS will now be
6580 dominated by the new block. */
6581 dom_bbs
= get_dominated_by_region (CDI_DOMINATORS
,
6585 /* Detach ENTRY_BB and EXIT_BB from CFUN->CFG. We need to remember
6586 the predecessor edges to ENTRY_BB and the successor edges to
6587 EXIT_BB so that we can re-attach them to the new basic block that
6588 will replace the region. */
6589 num_entry_edges
= EDGE_COUNT (entry_bb
->preds
);
6590 entry_pred
= XNEWVEC (basic_block
, num_entry_edges
);
6591 entry_flag
= XNEWVEC (int, num_entry_edges
);
6592 entry_prob
= XNEWVEC (unsigned, num_entry_edges
);
6594 for (ei
= ei_start (entry_bb
->preds
); (e
= ei_safe_edge (ei
)) != NULL
;)
6596 entry_prob
[i
] = e
->probability
;
6597 entry_flag
[i
] = e
->flags
;
6598 entry_pred
[i
++] = e
->src
;
6604 num_exit_edges
= EDGE_COUNT (exit_bb
->succs
);
6605 exit_succ
= XNEWVEC (basic_block
, num_exit_edges
);
6606 exit_flag
= XNEWVEC (int, num_exit_edges
);
6607 exit_prob
= XNEWVEC (unsigned, num_exit_edges
);
6609 for (ei
= ei_start (exit_bb
->succs
); (e
= ei_safe_edge (ei
)) != NULL
;)
6611 exit_prob
[i
] = e
->probability
;
6612 exit_flag
[i
] = e
->flags
;
6613 exit_succ
[i
++] = e
->dest
;
6625 /* Switch context to the child function to initialize DEST_FN's CFG. */
6626 gcc_assert (dest_cfun
->cfg
== NULL
);
6627 push_cfun (dest_cfun
);
6629 init_empty_tree_cfg ();
6631 /* Initialize EH information for the new function. */
6633 new_label_map
= NULL
;
6636 eh_region region
= NULL
;
6638 FOR_EACH_VEC_ELT (bbs
, i
, bb
)
6639 region
= find_outermost_region_in_block (saved_cfun
, bb
, region
);
6641 init_eh_for_function ();
6644 new_label_map
= htab_create (17, tree_map_hash
, tree_map_eq
, free
);
6645 eh_map
= duplicate_eh_regions (saved_cfun
, region
, 0,
6646 new_label_mapper
, new_label_map
);
6650 /* Initialize an empty loop tree. */
6651 struct loops
*loops
= ggc_alloc_cleared_loops ();
6652 init_loops_structure (dest_cfun
, loops
, 1);
6653 loops
->state
= LOOPS_MAY_HAVE_MULTIPLE_LATCHES
;
6654 set_loops_for_fn (dest_cfun
, loops
);
6656 /* Move the outlined loop tree part. */
6657 num_nodes
= bbs
.length ();
6658 FOR_EACH_VEC_ELT (bbs
, i
, bb
)
6660 if (bb
->loop_father
->header
== bb
)
6662 struct loop
*this_loop
= bb
->loop_father
;
6663 struct loop
*outer
= loop_outer (this_loop
);
6665 /* If the SESE region contains some bbs ending with
6666 a noreturn call, those are considered to belong
6667 to the outermost loop in saved_cfun, rather than
6668 the entry_bb's loop_father. */
6672 num_nodes
-= this_loop
->num_nodes
;
6673 flow_loop_tree_node_remove (bb
->loop_father
);
6674 flow_loop_tree_node_add (get_loop (dest_cfun
, 0), this_loop
);
6675 fixup_loop_arrays_after_move (saved_cfun
, cfun
, this_loop
);
6678 else if (bb
->loop_father
== loop0
&& loop0
!= loop
)
6681 /* Remove loop exits from the outlined region. */
6682 if (loops_for_fn (saved_cfun
)->exits
)
6683 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
6685 void **slot
= htab_find_slot_with_hash
6686 (loops_for_fn (saved_cfun
)->exits
, e
,
6687 htab_hash_pointer (e
), NO_INSERT
);
6689 htab_clear_slot (loops_for_fn (saved_cfun
)->exits
, slot
);
6694 /* Adjust the number of blocks in the tree root of the outlined part. */
6695 get_loop (dest_cfun
, 0)->num_nodes
= bbs
.length () + 2;
6697 /* Setup a mapping to be used by move_block_to_fn. */
6698 loop
->aux
= current_loops
->tree_root
;
6699 loop0
->aux
= current_loops
->tree_root
;
6703 /* Move blocks from BBS into DEST_CFUN. */
6704 gcc_assert (bbs
.length () >= 2);
6705 after
= dest_cfun
->cfg
->x_entry_block_ptr
;
6706 vars_map
= pointer_map_create ();
6708 memset (&d
, 0, sizeof (d
));
6709 d
.orig_block
= orig_block
;
6710 d
.new_block
= DECL_INITIAL (dest_cfun
->decl
);
6711 d
.from_context
= cfun
->decl
;
6712 d
.to_context
= dest_cfun
->decl
;
6713 d
.vars_map
= vars_map
;
6714 d
.new_label_map
= new_label_map
;
6716 d
.remap_decls_p
= true;
6718 FOR_EACH_VEC_ELT (bbs
, i
, bb
)
6720 /* No need to update edge counts on the last block. It has
6721 already been updated earlier when we detached the region from
6722 the original CFG. */
6723 move_block_to_fn (dest_cfun
, bb
, after
, bb
!= exit_bb
, &d
);
6729 /* Loop sizes are no longer correct, fix them up. */
6730 loop
->num_nodes
-= num_nodes
;
6731 for (struct loop
*outer
= loop_outer (loop
);
6732 outer
; outer
= loop_outer (outer
))
6733 outer
->num_nodes
-= num_nodes
;
6734 loop0
->num_nodes
-= bbs
.length () - num_nodes
;
6736 if (saved_cfun
->has_simduid_loops
|| saved_cfun
->has_force_vect_loops
)
6739 for (i
= 0; vec_safe_iterate (loops
->larray
, i
, &aloop
); i
++)
6744 replace_by_duplicate_decl (&aloop
->simduid
, d
.vars_map
,
6746 dest_cfun
->has_simduid_loops
= true;
6748 if (aloop
->force_vect
)
6749 dest_cfun
->has_force_vect_loops
= true;
6753 /* Rewire BLOCK_SUBBLOCKS of orig_block. */
6757 gcc_assert (BLOCK_SUBBLOCKS (DECL_INITIAL (dest_cfun
->decl
))
6759 BLOCK_SUBBLOCKS (DECL_INITIAL (dest_cfun
->decl
))
6760 = BLOCK_SUBBLOCKS (orig_block
);
6761 for (block
= BLOCK_SUBBLOCKS (orig_block
);
6762 block
; block
= BLOCK_CHAIN (block
))
6763 BLOCK_SUPERCONTEXT (block
) = DECL_INITIAL (dest_cfun
->decl
);
6764 BLOCK_SUBBLOCKS (orig_block
) = NULL_TREE
;
6767 replace_block_vars_by_duplicates (DECL_INITIAL (dest_cfun
->decl
),
6768 vars_map
, dest_cfun
->decl
);
6771 htab_delete (new_label_map
);
6773 pointer_map_destroy (eh_map
);
6774 pointer_map_destroy (vars_map
);
6776 /* Rewire the entry and exit blocks. The successor to the entry
6777 block turns into the successor of DEST_FN's ENTRY_BLOCK_PTR in
6778 the child function. Similarly, the predecessor of DEST_FN's
6779 EXIT_BLOCK_PTR turns into the predecessor of EXIT_BLOCK_PTR. We
6780 need to switch CFUN between DEST_CFUN and SAVED_CFUN so that the
6781 various CFG manipulation function get to the right CFG.
6783 FIXME, this is silly. The CFG ought to become a parameter to
6785 push_cfun (dest_cfun
);
6786 make_edge (ENTRY_BLOCK_PTR
, entry_bb
, EDGE_FALLTHRU
);
6788 make_edge (exit_bb
, EXIT_BLOCK_PTR
, 0);
6791 /* Back in the original function, the SESE region has disappeared,
6792 create a new basic block in its place. */
6793 bb
= create_empty_bb (entry_pred
[0]);
6795 add_bb_to_loop (bb
, loop
);
6796 for (i
= 0; i
< num_entry_edges
; i
++)
6798 e
= make_edge (entry_pred
[i
], bb
, entry_flag
[i
]);
6799 e
->probability
= entry_prob
[i
];
6802 for (i
= 0; i
< num_exit_edges
; i
++)
6804 e
= make_edge (bb
, exit_succ
[i
], exit_flag
[i
]);
6805 e
->probability
= exit_prob
[i
];
6808 set_immediate_dominator (CDI_DOMINATORS
, bb
, dom_entry
);
6809 FOR_EACH_VEC_ELT (dom_bbs
, i
, abb
)
6810 set_immediate_dominator (CDI_DOMINATORS
, abb
, bb
);
6828 /* Dump FUNCTION_DECL FN to file FILE using FLAGS (see TDF_* in dumpfile.h)
6832 dump_function_to_file (tree fndecl
, FILE *file
, int flags
)
6834 tree arg
, var
, old_current_fndecl
= current_function_decl
;
6835 struct function
*dsf
;
6836 bool ignore_topmost_bind
= false, any_var
= false;
6839 bool tmclone
= (TREE_CODE (fndecl
) == FUNCTION_DECL
6840 && decl_is_tm_clone (fndecl
));
6841 struct function
*fun
= DECL_STRUCT_FUNCTION (fndecl
);
6843 current_function_decl
= fndecl
;
6844 fprintf (file
, "%s %s(", function_name (fun
), tmclone
? "[tm-clone] " : "");
6846 arg
= DECL_ARGUMENTS (fndecl
);
6849 print_generic_expr (file
, TREE_TYPE (arg
), dump_flags
);
6850 fprintf (file
, " ");
6851 print_generic_expr (file
, arg
, dump_flags
);
6852 if (flags
& TDF_VERBOSE
)
6853 print_node (file
, "", arg
, 4);
6854 if (DECL_CHAIN (arg
))
6855 fprintf (file
, ", ");
6856 arg
= DECL_CHAIN (arg
);
6858 fprintf (file
, ")\n");
6860 if (flags
& TDF_VERBOSE
)
6861 print_node (file
, "", fndecl
, 2);
6863 dsf
= DECL_STRUCT_FUNCTION (fndecl
);
6864 if (dsf
&& (flags
& TDF_EH
))
6865 dump_eh_tree (file
, dsf
);
6867 if (flags
& TDF_RAW
&& !gimple_has_body_p (fndecl
))
6869 dump_node (fndecl
, TDF_SLIM
| flags
, file
);
6870 current_function_decl
= old_current_fndecl
;
6874 /* When GIMPLE is lowered, the variables are no longer available in
6875 BIND_EXPRs, so display them separately. */
6876 if (fun
&& fun
->decl
== fndecl
&& (fun
->curr_properties
& PROP_gimple_lcf
))
6879 ignore_topmost_bind
= true;
6881 fprintf (file
, "{\n");
6882 if (!vec_safe_is_empty (fun
->local_decls
))
6883 FOR_EACH_LOCAL_DECL (fun
, ix
, var
)
6885 print_generic_decl (file
, var
, flags
);
6886 if (flags
& TDF_VERBOSE
)
6887 print_node (file
, "", var
, 4);
6888 fprintf (file
, "\n");
6892 if (gimple_in_ssa_p (cfun
))
6893 for (ix
= 1; ix
< num_ssa_names
; ++ix
)
6895 tree name
= ssa_name (ix
);
6896 if (name
&& !SSA_NAME_VAR (name
))
6898 fprintf (file
, " ");
6899 print_generic_expr (file
, TREE_TYPE (name
), flags
);
6900 fprintf (file
, " ");
6901 print_generic_expr (file
, name
, flags
);
6902 fprintf (file
, ";\n");
6909 if (fun
&& fun
->decl
== fndecl
6911 && basic_block_info_for_function (fun
))
6913 /* If the CFG has been built, emit a CFG-based dump. */
6914 if (!ignore_topmost_bind
)
6915 fprintf (file
, "{\n");
6917 if (any_var
&& n_basic_blocks_for_function (fun
))
6918 fprintf (file
, "\n");
6920 FOR_EACH_BB_FN (bb
, fun
)
6921 dump_bb (file
, bb
, 2, flags
| TDF_COMMENT
);
6923 fprintf (file
, "}\n");
6925 else if (DECL_SAVED_TREE (fndecl
) == NULL
)
6927 /* The function is now in GIMPLE form but the CFG has not been
6928 built yet. Emit the single sequence of GIMPLE statements
6929 that make up its body. */
6930 gimple_seq body
= gimple_body (fndecl
);
6932 if (gimple_seq_first_stmt (body
)
6933 && gimple_seq_first_stmt (body
) == gimple_seq_last_stmt (body
)
6934 && gimple_code (gimple_seq_first_stmt (body
)) == GIMPLE_BIND
)
6935 print_gimple_seq (file
, body
, 0, flags
);
6938 if (!ignore_topmost_bind
)
6939 fprintf (file
, "{\n");
6942 fprintf (file
, "\n");
6944 print_gimple_seq (file
, body
, 2, flags
);
6945 fprintf (file
, "}\n");
6952 /* Make a tree based dump. */
6953 chain
= DECL_SAVED_TREE (fndecl
);
6954 if (chain
&& TREE_CODE (chain
) == BIND_EXPR
)
6956 if (ignore_topmost_bind
)
6958 chain
= BIND_EXPR_BODY (chain
);
6966 if (!ignore_topmost_bind
)
6967 fprintf (file
, "{\n");
6972 fprintf (file
, "\n");
6974 print_generic_stmt_indented (file
, chain
, flags
, indent
);
6975 if (ignore_topmost_bind
)
6976 fprintf (file
, "}\n");
6979 if (flags
& TDF_ENUMERATE_LOCALS
)
6980 dump_enumerated_decls (file
, flags
);
6981 fprintf (file
, "\n\n");
6983 current_function_decl
= old_current_fndecl
;
6986 /* Dump FUNCTION_DECL FN to stderr using FLAGS (see TDF_* in tree.h) */
6989 debug_function (tree fn
, int flags
)
6991 dump_function_to_file (fn
, stderr
, flags
);
6995 /* Print on FILE the indexes for the predecessors of basic_block BB. */
6998 print_pred_bbs (FILE *file
, basic_block bb
)
7003 FOR_EACH_EDGE (e
, ei
, bb
->preds
)
7004 fprintf (file
, "bb_%d ", e
->src
->index
);
7008 /* Print on FILE the indexes for the successors of basic_block BB. */
7011 print_succ_bbs (FILE *file
, basic_block bb
)
7016 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
7017 fprintf (file
, "bb_%d ", e
->dest
->index
);
7020 /* Print to FILE the basic block BB following the VERBOSITY level. */
7023 print_loops_bb (FILE *file
, basic_block bb
, int indent
, int verbosity
)
7025 char *s_indent
= (char *) alloca ((size_t) indent
+ 1);
7026 memset ((void *) s_indent
, ' ', (size_t) indent
);
7027 s_indent
[indent
] = '\0';
7029 /* Print basic_block's header. */
7032 fprintf (file
, "%s bb_%d (preds = {", s_indent
, bb
->index
);
7033 print_pred_bbs (file
, bb
);
7034 fprintf (file
, "}, succs = {");
7035 print_succ_bbs (file
, bb
);
7036 fprintf (file
, "})\n");
7039 /* Print basic_block's body. */
7042 fprintf (file
, "%s {\n", s_indent
);
7043 dump_bb (file
, bb
, indent
+ 4, TDF_VOPS
|TDF_MEMSYMS
);
7044 fprintf (file
, "%s }\n", s_indent
);
7048 static void print_loop_and_siblings (FILE *, struct loop
*, int, int);
7050 /* Pretty print LOOP on FILE, indented INDENT spaces. Following
7051 VERBOSITY level this outputs the contents of the loop, or just its
7055 print_loop (FILE *file
, struct loop
*loop
, int indent
, int verbosity
)
7063 s_indent
= (char *) alloca ((size_t) indent
+ 1);
7064 memset ((void *) s_indent
, ' ', (size_t) indent
);
7065 s_indent
[indent
] = '\0';
7067 /* Print loop's header. */
7068 fprintf (file
, "%sloop_%d (", s_indent
, loop
->num
);
7070 fprintf (file
, "header = %d", loop
->header
->index
);
7073 fprintf (file
, "deleted)\n");
7077 fprintf (file
, ", latch = %d", loop
->latch
->index
);
7079 fprintf (file
, ", multiple latches");
7080 fprintf (file
, ", niter = ");
7081 print_generic_expr (file
, loop
->nb_iterations
, 0);
7083 if (loop
->any_upper_bound
)
7085 fprintf (file
, ", upper_bound = ");
7086 dump_double_int (file
, loop
->nb_iterations_upper_bound
, true);
7089 if (loop
->any_estimate
)
7091 fprintf (file
, ", estimate = ");
7092 dump_double_int (file
, loop
->nb_iterations_estimate
, true);
7094 fprintf (file
, ")\n");
7096 /* Print loop's body. */
7099 fprintf (file
, "%s{\n", s_indent
);
7101 if (bb
->loop_father
== loop
)
7102 print_loops_bb (file
, bb
, indent
, verbosity
);
7104 print_loop_and_siblings (file
, loop
->inner
, indent
+ 2, verbosity
);
7105 fprintf (file
, "%s}\n", s_indent
);
7109 /* Print the LOOP and its sibling loops on FILE, indented INDENT
7110 spaces. Following VERBOSITY level this outputs the contents of the
7111 loop, or just its structure. */
7114 print_loop_and_siblings (FILE *file
, struct loop
*loop
, int indent
,
7120 print_loop (file
, loop
, indent
, verbosity
);
7121 print_loop_and_siblings (file
, loop
->next
, indent
, verbosity
);
7124 /* Follow a CFG edge from the entry point of the program, and on entry
7125 of a loop, pretty print the loop structure on FILE. */
7128 print_loops (FILE *file
, int verbosity
)
7132 bb
= ENTRY_BLOCK_PTR
;
7133 if (bb
&& bb
->loop_father
)
7134 print_loop_and_siblings (file
, bb
->loop_father
, 0, verbosity
);
7140 debug (struct loop
&ref
)
7142 print_loop (stderr
, &ref
, 0, /*verbosity*/0);
7146 debug (struct loop
*ptr
)
7151 fprintf (stderr
, "<nil>\n");
7154 /* Dump a loop verbosely. */
7157 debug_verbose (struct loop
&ref
)
7159 print_loop (stderr
, &ref
, 0, /*verbosity*/3);
7163 debug_verbose (struct loop
*ptr
)
7168 fprintf (stderr
, "<nil>\n");
7172 /* Debugging loops structure at tree level, at some VERBOSITY level. */
7175 debug_loops (int verbosity
)
7177 print_loops (stderr
, verbosity
);
7180 /* Print on stderr the code of LOOP, at some VERBOSITY level. */
7183 debug_loop (struct loop
*loop
, int verbosity
)
7185 print_loop (stderr
, loop
, 0, verbosity
);
7188 /* Print on stderr the code of loop number NUM, at some VERBOSITY
7192 debug_loop_num (unsigned num
, int verbosity
)
7194 debug_loop (get_loop (cfun
, num
), verbosity
);
7197 /* Return true if BB ends with a call, possibly followed by some
7198 instructions that must stay with the call. Return false,
7202 gimple_block_ends_with_call_p (basic_block bb
)
7204 gimple_stmt_iterator gsi
= gsi_last_nondebug_bb (bb
);
7205 return !gsi_end_p (gsi
) && is_gimple_call (gsi_stmt (gsi
));
7209 /* Return true if BB ends with a conditional branch. Return false,
7213 gimple_block_ends_with_condjump_p (const_basic_block bb
)
7215 gimple stmt
= last_stmt (CONST_CAST_BB (bb
));
7216 return (stmt
&& gimple_code (stmt
) == GIMPLE_COND
);
7220 /* Return true if we need to add fake edge to exit at statement T.
7221 Helper function for gimple_flow_call_edges_add. */
7224 need_fake_edge_p (gimple t
)
7226 tree fndecl
= NULL_TREE
;
7229 /* NORETURN and LONGJMP calls already have an edge to exit.
7230 CONST and PURE calls do not need one.
7231 We don't currently check for CONST and PURE here, although
7232 it would be a good idea, because those attributes are
7233 figured out from the RTL in mark_constant_function, and
7234 the counter incrementation code from -fprofile-arcs
7235 leads to different results from -fbranch-probabilities. */
7236 if (is_gimple_call (t
))
7238 fndecl
= gimple_call_fndecl (t
);
7239 call_flags
= gimple_call_flags (t
);
7242 if (is_gimple_call (t
)
7244 && DECL_BUILT_IN (fndecl
)
7245 && (call_flags
& ECF_NOTHROW
)
7246 && !(call_flags
& ECF_RETURNS_TWICE
)
7247 /* fork() doesn't really return twice, but the effect of
7248 wrapping it in __gcov_fork() which calls __gcov_flush()
7249 and clears the counters before forking has the same
7250 effect as returning twice. Force a fake edge. */
7251 && !(DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
7252 && DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_FORK
))
7255 if (is_gimple_call (t
))
7261 if (!(call_flags
& ECF_NORETURN
))
7265 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
7266 if ((e
->flags
& EDGE_FAKE
) == 0)
7270 if (gimple_code (t
) == GIMPLE_ASM
7271 && (gimple_asm_volatile_p (t
) || gimple_asm_input_p (t
)))
7278 /* Add fake edges to the function exit for any non constant and non
7279 noreturn calls (or noreturn calls with EH/abnormal edges),
7280 volatile inline assembly in the bitmap of blocks specified by BLOCKS
7281 or to the whole CFG if BLOCKS is zero. Return the number of blocks
7284 The goal is to expose cases in which entering a basic block does
7285 not imply that all subsequent instructions must be executed. */
7288 gimple_flow_call_edges_add (sbitmap blocks
)
7291 int blocks_split
= 0;
7292 int last_bb
= last_basic_block
;
7293 bool check_last_block
= false;
7295 if (n_basic_blocks
== NUM_FIXED_BLOCKS
)
7299 check_last_block
= true;
7301 check_last_block
= bitmap_bit_p (blocks
, EXIT_BLOCK_PTR
->prev_bb
->index
);
7303 /* In the last basic block, before epilogue generation, there will be
7304 a fallthru edge to EXIT. Special care is required if the last insn
7305 of the last basic block is a call because make_edge folds duplicate
7306 edges, which would result in the fallthru edge also being marked
7307 fake, which would result in the fallthru edge being removed by
7308 remove_fake_edges, which would result in an invalid CFG.
7310 Moreover, we can't elide the outgoing fake edge, since the block
7311 profiler needs to take this into account in order to solve the minimal
7312 spanning tree in the case that the call doesn't return.
7314 Handle this by adding a dummy instruction in a new last basic block. */
7315 if (check_last_block
)
7317 basic_block bb
= EXIT_BLOCK_PTR
->prev_bb
;
7318 gimple_stmt_iterator gsi
= gsi_last_nondebug_bb (bb
);
7321 if (!gsi_end_p (gsi
))
7324 if (t
&& need_fake_edge_p (t
))
7328 e
= find_edge (bb
, EXIT_BLOCK_PTR
);
7331 gsi_insert_on_edge (e
, gimple_build_nop ());
7332 gsi_commit_edge_inserts ();
7337 /* Now add fake edges to the function exit for any non constant
7338 calls since there is no way that we can determine if they will
7340 for (i
= 0; i
< last_bb
; i
++)
7342 basic_block bb
= BASIC_BLOCK (i
);
7343 gimple_stmt_iterator gsi
;
7344 gimple stmt
, last_stmt
;
7349 if (blocks
&& !bitmap_bit_p (blocks
, i
))
7352 gsi
= gsi_last_nondebug_bb (bb
);
7353 if (!gsi_end_p (gsi
))
7355 last_stmt
= gsi_stmt (gsi
);
7358 stmt
= gsi_stmt (gsi
);
7359 if (need_fake_edge_p (stmt
))
7363 /* The handling above of the final block before the
7364 epilogue should be enough to verify that there is
7365 no edge to the exit block in CFG already.
7366 Calling make_edge in such case would cause us to
7367 mark that edge as fake and remove it later. */
7368 #ifdef ENABLE_CHECKING
7369 if (stmt
== last_stmt
)
7371 e
= find_edge (bb
, EXIT_BLOCK_PTR
);
7372 gcc_assert (e
== NULL
);
7376 /* Note that the following may create a new basic block
7377 and renumber the existing basic blocks. */
7378 if (stmt
!= last_stmt
)
7380 e
= split_block (bb
, stmt
);
7384 make_edge (bb
, EXIT_BLOCK_PTR
, EDGE_FAKE
);
7388 while (!gsi_end_p (gsi
));
7393 verify_flow_info ();
7395 return blocks_split
;
7398 /* Removes edge E and all the blocks dominated by it, and updates dominance
7399 information. The IL in E->src needs to be updated separately.
7400 If dominance info is not available, only the edge E is removed.*/
7403 remove_edge_and_dominated_blocks (edge e
)
7405 vec
<basic_block
> bbs_to_remove
= vNULL
;
7406 vec
<basic_block
> bbs_to_fix_dom
= vNULL
;
7410 bool none_removed
= false;
7412 basic_block bb
, dbb
;
7415 if (!dom_info_available_p (CDI_DOMINATORS
))
7421 /* No updating is needed for edges to exit. */
7422 if (e
->dest
== EXIT_BLOCK_PTR
)
7424 if (cfgcleanup_altered_bbs
)
7425 bitmap_set_bit (cfgcleanup_altered_bbs
, e
->src
->index
);
7430 /* First, we find the basic blocks to remove. If E->dest has a predecessor
7431 that is not dominated by E->dest, then this set is empty. Otherwise,
7432 all the basic blocks dominated by E->dest are removed.
7434 Also, to DF_IDOM we store the immediate dominators of the blocks in
7435 the dominance frontier of E (i.e., of the successors of the
7436 removed blocks, if there are any, and of E->dest otherwise). */
7437 FOR_EACH_EDGE (f
, ei
, e
->dest
->preds
)
7442 if (!dominated_by_p (CDI_DOMINATORS
, f
->src
, e
->dest
))
7444 none_removed
= true;
7449 df
= BITMAP_ALLOC (NULL
);
7450 df_idom
= BITMAP_ALLOC (NULL
);
7453 bitmap_set_bit (df_idom
,
7454 get_immediate_dominator (CDI_DOMINATORS
, e
->dest
)->index
);
7457 bbs_to_remove
= get_all_dominated_blocks (CDI_DOMINATORS
, e
->dest
);
7458 FOR_EACH_VEC_ELT (bbs_to_remove
, i
, bb
)
7460 FOR_EACH_EDGE (f
, ei
, bb
->succs
)
7462 if (f
->dest
!= EXIT_BLOCK_PTR
)
7463 bitmap_set_bit (df
, f
->dest
->index
);
7466 FOR_EACH_VEC_ELT (bbs_to_remove
, i
, bb
)
7467 bitmap_clear_bit (df
, bb
->index
);
7469 EXECUTE_IF_SET_IN_BITMAP (df
, 0, i
, bi
)
7471 bb
= BASIC_BLOCK (i
);
7472 bitmap_set_bit (df_idom
,
7473 get_immediate_dominator (CDI_DOMINATORS
, bb
)->index
);
7477 if (cfgcleanup_altered_bbs
)
7479 /* Record the set of the altered basic blocks. */
7480 bitmap_set_bit (cfgcleanup_altered_bbs
, e
->src
->index
);
7481 bitmap_ior_into (cfgcleanup_altered_bbs
, df
);
7484 /* Remove E and the cancelled blocks. */
7489 /* Walk backwards so as to get a chance to substitute all
7490 released DEFs into debug stmts. See
7491 eliminate_unnecessary_stmts() in tree-ssa-dce.c for more
7493 for (i
= bbs_to_remove
.length (); i
-- > 0; )
7494 delete_basic_block (bbs_to_remove
[i
]);
7497 /* Update the dominance information. The immediate dominator may change only
7498 for blocks whose immediate dominator belongs to DF_IDOM:
7500 Suppose that idom(X) = Y before removal of E and idom(X) != Y after the
7501 removal. Let Z the arbitrary block such that idom(Z) = Y and
7502 Z dominates X after the removal. Before removal, there exists a path P
7503 from Y to X that avoids Z. Let F be the last edge on P that is
7504 removed, and let W = F->dest. Before removal, idom(W) = Y (since Y
7505 dominates W, and because of P, Z does not dominate W), and W belongs to
7506 the dominance frontier of E. Therefore, Y belongs to DF_IDOM. */
7507 EXECUTE_IF_SET_IN_BITMAP (df_idom
, 0, i
, bi
)
7509 bb
= BASIC_BLOCK (i
);
7510 for (dbb
= first_dom_son (CDI_DOMINATORS
, bb
);
7512 dbb
= next_dom_son (CDI_DOMINATORS
, dbb
))
7513 bbs_to_fix_dom
.safe_push (dbb
);
7516 iterate_fix_dominators (CDI_DOMINATORS
, bbs_to_fix_dom
, true);
7519 BITMAP_FREE (df_idom
);
7520 bbs_to_remove
.release ();
7521 bbs_to_fix_dom
.release ();
7524 /* Purge dead EH edges from basic block BB. */
7527 gimple_purge_dead_eh_edges (basic_block bb
)
7529 bool changed
= false;
7532 gimple stmt
= last_stmt (bb
);
7534 if (stmt
&& stmt_can_throw_internal (stmt
))
7537 for (ei
= ei_start (bb
->succs
); (e
= ei_safe_edge (ei
)); )
7539 if (e
->flags
& EDGE_EH
)
7541 remove_edge_and_dominated_blocks (e
);
7551 /* Purge dead EH edges from basic block listed in BLOCKS. */
7554 gimple_purge_all_dead_eh_edges (const_bitmap blocks
)
7556 bool changed
= false;
7560 EXECUTE_IF_SET_IN_BITMAP (blocks
, 0, i
, bi
)
7562 basic_block bb
= BASIC_BLOCK (i
);
7564 /* Earlier gimple_purge_dead_eh_edges could have removed
7565 this basic block already. */
7566 gcc_assert (bb
|| changed
);
7568 changed
|= gimple_purge_dead_eh_edges (bb
);
7574 /* Purge dead abnormal call edges from basic block BB. */
7577 gimple_purge_dead_abnormal_call_edges (basic_block bb
)
7579 bool changed
= false;
7582 gimple stmt
= last_stmt (bb
);
7584 if (!cfun
->has_nonlocal_label
7585 && !cfun
->calls_setjmp
)
7588 if (stmt
&& stmt_can_make_abnormal_goto (stmt
))
7591 for (ei
= ei_start (bb
->succs
); (e
= ei_safe_edge (ei
)); )
7593 if (e
->flags
& EDGE_ABNORMAL
)
7595 if (e
->flags
& EDGE_FALLTHRU
)
7596 e
->flags
&= ~EDGE_ABNORMAL
;
7598 remove_edge_and_dominated_blocks (e
);
7608 /* Purge dead abnormal call edges from basic block listed in BLOCKS. */
7611 gimple_purge_all_dead_abnormal_call_edges (const_bitmap blocks
)
7613 bool changed
= false;
7617 EXECUTE_IF_SET_IN_BITMAP (blocks
, 0, i
, bi
)
7619 basic_block bb
= BASIC_BLOCK (i
);
7621 /* Earlier gimple_purge_dead_abnormal_call_edges could have removed
7622 this basic block already. */
7623 gcc_assert (bb
|| changed
);
7625 changed
|= gimple_purge_dead_abnormal_call_edges (bb
);
7631 /* This function is called whenever a new edge is created or
7635 gimple_execute_on_growing_pred (edge e
)
7637 basic_block bb
= e
->dest
;
7639 if (!gimple_seq_empty_p (phi_nodes (bb
)))
7640 reserve_phi_args_for_new_edge (bb
);
7643 /* This function is called immediately before edge E is removed from
7644 the edge vector E->dest->preds. */
7647 gimple_execute_on_shrinking_pred (edge e
)
7649 if (!gimple_seq_empty_p (phi_nodes (e
->dest
)))
7650 remove_phi_args (e
);
7653 /*---------------------------------------------------------------------------
7654 Helper functions for Loop versioning
7655 ---------------------------------------------------------------------------*/
7657 /* Adjust phi nodes for 'first' basic block. 'second' basic block is a copy
7658 of 'first'. Both of them are dominated by 'new_head' basic block. When
7659 'new_head' was created by 'second's incoming edge it received phi arguments
7660 on the edge by split_edge(). Later, additional edge 'e' was created to
7661 connect 'new_head' and 'first'. Now this routine adds phi args on this
7662 additional edge 'e' that new_head to second edge received as part of edge
7666 gimple_lv_adjust_loop_header_phi (basic_block first
, basic_block second
,
7667 basic_block new_head
, edge e
)
7670 gimple_stmt_iterator psi1
, psi2
;
7672 edge e2
= find_edge (new_head
, second
);
7674 /* Because NEW_HEAD has been created by splitting SECOND's incoming
7675 edge, we should always have an edge from NEW_HEAD to SECOND. */
7676 gcc_assert (e2
!= NULL
);
7678 /* Browse all 'second' basic block phi nodes and add phi args to
7679 edge 'e' for 'first' head. PHI args are always in correct order. */
7681 for (psi2
= gsi_start_phis (second
),
7682 psi1
= gsi_start_phis (first
);
7683 !gsi_end_p (psi2
) && !gsi_end_p (psi1
);
7684 gsi_next (&psi2
), gsi_next (&psi1
))
7686 phi1
= gsi_stmt (psi1
);
7687 phi2
= gsi_stmt (psi2
);
7688 def
= PHI_ARG_DEF (phi2
, e2
->dest_idx
);
7689 add_phi_arg (phi1
, def
, e
, gimple_phi_arg_location_from_edge (phi2
, e2
));
7694 /* Adds a if else statement to COND_BB with condition COND_EXPR.
7695 SECOND_HEAD is the destination of the THEN and FIRST_HEAD is
7696 the destination of the ELSE part. */
7699 gimple_lv_add_condition_to_bb (basic_block first_head ATTRIBUTE_UNUSED
,
7700 basic_block second_head ATTRIBUTE_UNUSED
,
7701 basic_block cond_bb
, void *cond_e
)
7703 gimple_stmt_iterator gsi
;
7704 gimple new_cond_expr
;
7705 tree cond_expr
= (tree
) cond_e
;
7708 /* Build new conditional expr */
7709 new_cond_expr
= gimple_build_cond_from_tree (cond_expr
,
7710 NULL_TREE
, NULL_TREE
);
7712 /* Add new cond in cond_bb. */
7713 gsi
= gsi_last_bb (cond_bb
);
7714 gsi_insert_after (&gsi
, new_cond_expr
, GSI_NEW_STMT
);
7716 /* Adjust edges appropriately to connect new head with first head
7717 as well as second head. */
7718 e0
= single_succ_edge (cond_bb
);
7719 e0
->flags
&= ~EDGE_FALLTHRU
;
7720 e0
->flags
|= EDGE_FALSE_VALUE
;
7724 /* Do book-keeping of basic block BB for the profile consistency checker.
7725 If AFTER_PASS is 0, do pre-pass accounting, or if AFTER_PASS is 1
7726 then do post-pass accounting. Store the counting in RECORD. */
7728 gimple_account_profile_record (basic_block bb
, int after_pass
,
7729 struct profile_record
*record
)
7731 gimple_stmt_iterator i
;
7732 for (i
= gsi_start_bb (bb
); !gsi_end_p (i
); gsi_next (&i
))
7734 record
->size
[after_pass
]
7735 += estimate_num_insns (gsi_stmt (i
), &eni_size_weights
);
7736 if (profile_status
== PROFILE_READ
)
7737 record
->time
[after_pass
]
7738 += estimate_num_insns (gsi_stmt (i
),
7739 &eni_time_weights
) * bb
->count
;
7740 else if (profile_status
== PROFILE_GUESSED
)
7741 record
->time
[after_pass
]
7742 += estimate_num_insns (gsi_stmt (i
),
7743 &eni_time_weights
) * bb
->frequency
;
7747 struct cfg_hooks gimple_cfg_hooks
= {
7749 gimple_verify_flow_info
,
7750 gimple_dump_bb
, /* dump_bb */
7751 gimple_dump_bb_for_graph
, /* dump_bb_for_graph */
7752 create_bb
, /* create_basic_block */
7753 gimple_redirect_edge_and_branch
, /* redirect_edge_and_branch */
7754 gimple_redirect_edge_and_branch_force
, /* redirect_edge_and_branch_force */
7755 gimple_can_remove_branch_p
, /* can_remove_branch_p */
7756 remove_bb
, /* delete_basic_block */
7757 gimple_split_block
, /* split_block */
7758 gimple_move_block_after
, /* move_block_after */
7759 gimple_can_merge_blocks_p
, /* can_merge_blocks_p */
7760 gimple_merge_blocks
, /* merge_blocks */
7761 gimple_predict_edge
, /* predict_edge */
7762 gimple_predicted_by_p
, /* predicted_by_p */
7763 gimple_can_duplicate_bb_p
, /* can_duplicate_block_p */
7764 gimple_duplicate_bb
, /* duplicate_block */
7765 gimple_split_edge
, /* split_edge */
7766 gimple_make_forwarder_block
, /* make_forward_block */
7767 NULL
, /* tidy_fallthru_edge */
7768 NULL
, /* force_nonfallthru */
7769 gimple_block_ends_with_call_p
,/* block_ends_with_call_p */
7770 gimple_block_ends_with_condjump_p
, /* block_ends_with_condjump_p */
7771 gimple_flow_call_edges_add
, /* flow_call_edges_add */
7772 gimple_execute_on_growing_pred
, /* execute_on_growing_pred */
7773 gimple_execute_on_shrinking_pred
, /* execute_on_shrinking_pred */
7774 gimple_duplicate_loop_to_header_edge
, /* duplicate loop for trees */
7775 gimple_lv_add_condition_to_bb
, /* lv_add_condition_to_bb */
7776 gimple_lv_adjust_loop_header_phi
, /* lv_adjust_loop_header_phi*/
7777 extract_true_false_edges_from_block
, /* extract_cond_bb_edges */
7778 flush_pending_stmts
, /* flush_pending_stmts */
7779 gimple_empty_block_p
, /* block_empty_p */
7780 gimple_split_block_before_cond_jump
, /* split_block_before_cond_jump */
7781 gimple_account_profile_record
,
7785 /* Split all critical edges. */
7788 split_critical_edges (void)
7794 /* split_edge can redirect edges out of SWITCH_EXPRs, which can get
7795 expensive. So we want to enable recording of edge to CASE_LABEL_EXPR
7796 mappings around the calls to split_edge. */
7797 start_recording_case_labels ();
7800 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
7802 if (EDGE_CRITICAL_P (e
) && !(e
->flags
& EDGE_ABNORMAL
))
7804 /* PRE inserts statements to edges and expects that
7805 since split_critical_edges was done beforehand, committing edge
7806 insertions will not split more edges. In addition to critical
7807 edges we must split edges that have multiple successors and
7808 end by control flow statements, such as RESX.
7809 Go ahead and split them too. This matches the logic in
7810 gimple_find_edge_insert_loc. */
7811 else if ((!single_pred_p (e
->dest
)
7812 || !gimple_seq_empty_p (phi_nodes (e
->dest
))
7813 || e
->dest
== EXIT_BLOCK_PTR
)
7814 && e
->src
!= ENTRY_BLOCK_PTR
7815 && !(e
->flags
& EDGE_ABNORMAL
))
7817 gimple_stmt_iterator gsi
;
7819 gsi
= gsi_last_bb (e
->src
);
7820 if (!gsi_end_p (gsi
)
7821 && stmt_ends_bb_p (gsi_stmt (gsi
))
7822 && (gimple_code (gsi_stmt (gsi
)) != GIMPLE_RETURN
7823 && !gimple_call_builtin_p (gsi_stmt (gsi
),
7829 end_recording_case_labels ();
7835 const pass_data pass_data_split_crit_edges
=
7837 GIMPLE_PASS
, /* type */
7838 "crited", /* name */
7839 OPTGROUP_NONE
, /* optinfo_flags */
7840 false, /* has_gate */
7841 true, /* has_execute */
7842 TV_TREE_SPLIT_EDGES
, /* tv_id */
7843 PROP_cfg
, /* properties_required */
7844 PROP_no_crit_edges
, /* properties_provided */
7845 0, /* properties_destroyed */
7846 0, /* todo_flags_start */
7847 TODO_verify_flow
, /* todo_flags_finish */
7850 class pass_split_crit_edges
: public gimple_opt_pass
7853 pass_split_crit_edges (gcc::context
*ctxt
)
7854 : gimple_opt_pass (pass_data_split_crit_edges
, ctxt
)
7857 /* opt_pass methods: */
7858 unsigned int execute () { return split_critical_edges (); }
7860 opt_pass
* clone () { return new pass_split_crit_edges (m_ctxt
); }
7861 }; // class pass_split_crit_edges
7866 make_pass_split_crit_edges (gcc::context
*ctxt
)
7868 return new pass_split_crit_edges (ctxt
);
7872 /* Build a ternary operation and gimplify it. Emit code before GSI.
7873 Return the gimple_val holding the result. */
7876 gimplify_build3 (gimple_stmt_iterator
*gsi
, enum tree_code code
,
7877 tree type
, tree a
, tree b
, tree c
)
7880 location_t loc
= gimple_location (gsi_stmt (*gsi
));
7882 ret
= fold_build3_loc (loc
, code
, type
, a
, b
, c
);
7885 return force_gimple_operand_gsi (gsi
, ret
, true, NULL
, true,
7889 /* Build a binary operation and gimplify it. Emit code before GSI.
7890 Return the gimple_val holding the result. */
7893 gimplify_build2 (gimple_stmt_iterator
*gsi
, enum tree_code code
,
7894 tree type
, tree a
, tree b
)
7898 ret
= fold_build2_loc (gimple_location (gsi_stmt (*gsi
)), code
, type
, a
, b
);
7901 return force_gimple_operand_gsi (gsi
, ret
, true, NULL
, true,
7905 /* Build a unary operation and gimplify it. Emit code before GSI.
7906 Return the gimple_val holding the result. */
7909 gimplify_build1 (gimple_stmt_iterator
*gsi
, enum tree_code code
, tree type
,
7914 ret
= fold_build1_loc (gimple_location (gsi_stmt (*gsi
)), code
, type
, a
);
7917 return force_gimple_operand_gsi (gsi
, ret
, true, NULL
, true,
7923 /* Emit return warnings. */
7926 execute_warn_function_return (void)
7928 source_location location
;
7933 if (!targetm
.warn_func_return (cfun
->decl
))
7936 /* If we have a path to EXIT, then we do return. */
7937 if (TREE_THIS_VOLATILE (cfun
->decl
)
7938 && EDGE_COUNT (EXIT_BLOCK_PTR
->preds
) > 0)
7940 location
= UNKNOWN_LOCATION
;
7941 FOR_EACH_EDGE (e
, ei
, EXIT_BLOCK_PTR
->preds
)
7943 last
= last_stmt (e
->src
);
7944 if ((gimple_code (last
) == GIMPLE_RETURN
7945 || gimple_call_builtin_p (last
, BUILT_IN_RETURN
))
7946 && (location
= gimple_location (last
)) != UNKNOWN_LOCATION
)
7949 if (location
== UNKNOWN_LOCATION
)
7950 location
= cfun
->function_end_locus
;
7951 warning_at (location
, 0, "%<noreturn%> function does return");
7954 /* If we see "return;" in some basic block, then we do reach the end
7955 without returning a value. */
7956 else if (warn_return_type
7957 && !TREE_NO_WARNING (cfun
->decl
)
7958 && EDGE_COUNT (EXIT_BLOCK_PTR
->preds
) > 0
7959 && !VOID_TYPE_P (TREE_TYPE (TREE_TYPE (cfun
->decl
))))
7961 FOR_EACH_EDGE (e
, ei
, EXIT_BLOCK_PTR
->preds
)
7963 gimple last
= last_stmt (e
->src
);
7964 if (gimple_code (last
) == GIMPLE_RETURN
7965 && gimple_return_retval (last
) == NULL
7966 && !gimple_no_warning_p (last
))
7968 location
= gimple_location (last
);
7969 if (location
== UNKNOWN_LOCATION
)
7970 location
= cfun
->function_end_locus
;
7971 warning_at (location
, OPT_Wreturn_type
, "control reaches end of non-void function");
7972 TREE_NO_WARNING (cfun
->decl
) = 1;
7981 /* Given a basic block B which ends with a conditional and has
7982 precisely two successors, determine which of the edges is taken if
7983 the conditional is true and which is taken if the conditional is
7984 false. Set TRUE_EDGE and FALSE_EDGE appropriately. */
7987 extract_true_false_edges_from_block (basic_block b
,
7991 edge e
= EDGE_SUCC (b
, 0);
7993 if (e
->flags
& EDGE_TRUE_VALUE
)
7996 *false_edge
= EDGE_SUCC (b
, 1);
8001 *true_edge
= EDGE_SUCC (b
, 1);
8007 const pass_data pass_data_warn_function_return
=
8009 GIMPLE_PASS
, /* type */
8010 "*warn_function_return", /* name */
8011 OPTGROUP_NONE
, /* optinfo_flags */
8012 false, /* has_gate */
8013 true, /* has_execute */
8014 TV_NONE
, /* tv_id */
8015 PROP_cfg
, /* properties_required */
8016 0, /* properties_provided */
8017 0, /* properties_destroyed */
8018 0, /* todo_flags_start */
8019 0, /* todo_flags_finish */
8022 class pass_warn_function_return
: public gimple_opt_pass
8025 pass_warn_function_return (gcc::context
*ctxt
)
8026 : gimple_opt_pass (pass_data_warn_function_return
, ctxt
)
8029 /* opt_pass methods: */
8030 unsigned int execute () { return execute_warn_function_return (); }
8032 }; // class pass_warn_function_return
8037 make_pass_warn_function_return (gcc::context
*ctxt
)
8039 return new pass_warn_function_return (ctxt
);
8042 /* Walk a gimplified function and warn for functions whose return value is
8043 ignored and attribute((warn_unused_result)) is set. This is done before
8044 inlining, so we don't have to worry about that. */
8047 do_warn_unused_result (gimple_seq seq
)
8050 gimple_stmt_iterator i
;
8052 for (i
= gsi_start (seq
); !gsi_end_p (i
); gsi_next (&i
))
8054 gimple g
= gsi_stmt (i
);
8056 switch (gimple_code (g
))
8059 do_warn_unused_result (gimple_bind_body (g
));
8062 do_warn_unused_result (gimple_try_eval (g
));
8063 do_warn_unused_result (gimple_try_cleanup (g
));
8066 do_warn_unused_result (gimple_catch_handler (g
));
8068 case GIMPLE_EH_FILTER
:
8069 do_warn_unused_result (gimple_eh_filter_failure (g
));
8073 if (gimple_call_lhs (g
))
8075 if (gimple_call_internal_p (g
))
8078 /* This is a naked call, as opposed to a GIMPLE_CALL with an
8079 LHS. All calls whose value is ignored should be
8080 represented like this. Look for the attribute. */
8081 fdecl
= gimple_call_fndecl (g
);
8082 ftype
= gimple_call_fntype (g
);
8084 if (lookup_attribute ("warn_unused_result", TYPE_ATTRIBUTES (ftype
)))
8086 location_t loc
= gimple_location (g
);
8089 warning_at (loc
, OPT_Wunused_result
,
8090 "ignoring return value of %qD, "
8091 "declared with attribute warn_unused_result",
8094 warning_at (loc
, OPT_Wunused_result
,
8095 "ignoring return value of function "
8096 "declared with attribute warn_unused_result");
8101 /* Not a container, not a call, or a call whose value is used. */
8108 run_warn_unused_result (void)
8110 do_warn_unused_result (gimple_body (current_function_decl
));
8115 gate_warn_unused_result (void)
8117 return flag_warn_unused_result
;
8122 const pass_data pass_data_warn_unused_result
=
8124 GIMPLE_PASS
, /* type */
8125 "*warn_unused_result", /* name */
8126 OPTGROUP_NONE
, /* optinfo_flags */
8127 true, /* has_gate */
8128 true, /* has_execute */
8129 TV_NONE
, /* tv_id */
8130 PROP_gimple_any
, /* properties_required */
8131 0, /* properties_provided */
8132 0, /* properties_destroyed */
8133 0, /* todo_flags_start */
8134 0, /* todo_flags_finish */
8137 class pass_warn_unused_result
: public gimple_opt_pass
8140 pass_warn_unused_result (gcc::context
*ctxt
)
8141 : gimple_opt_pass (pass_data_warn_unused_result
, ctxt
)
8144 /* opt_pass methods: */
8145 bool gate () { return gate_warn_unused_result (); }
8146 unsigned int execute () { return run_warn_unused_result (); }
8148 }; // class pass_warn_unused_result
8153 make_pass_warn_unused_result (gcc::context
*ctxt
)
8155 return new pass_warn_unused_result (ctxt
);
8158 /* IPA passes, compilation of earlier functions or inlining
8159 might have changed some properties, such as marked functions nothrow,
8160 pure, const or noreturn.
8161 Remove redundant edges and basic blocks, and create new ones if necessary.
8163 This pass can't be executed as stand alone pass from pass manager, because
8164 in between inlining and this fixup the verify_flow_info would fail. */
8167 execute_fixup_cfg (void)
8170 gimple_stmt_iterator gsi
;
8171 int todo
= gimple_in_ssa_p (cfun
) ? TODO_verify_ssa
: 0;
8172 gcov_type count_scale
;
8177 = GCOV_COMPUTE_SCALE (cgraph_get_node (current_function_decl
)->count
,
8178 ENTRY_BLOCK_PTR
->count
);
8180 ENTRY_BLOCK_PTR
->count
= cgraph_get_node (current_function_decl
)->count
;
8181 EXIT_BLOCK_PTR
->count
= apply_scale (EXIT_BLOCK_PTR
->count
,
8184 FOR_EACH_EDGE (e
, ei
, ENTRY_BLOCK_PTR
->succs
)
8185 e
->count
= apply_scale (e
->count
, count_scale
);
8189 bb
->count
= apply_scale (bb
->count
, count_scale
);
8190 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
8192 gimple stmt
= gsi_stmt (gsi
);
8193 tree decl
= is_gimple_call (stmt
)
8194 ? gimple_call_fndecl (stmt
)
8198 int flags
= gimple_call_flags (stmt
);
8199 if (flags
& (ECF_CONST
| ECF_PURE
| ECF_LOOPING_CONST_OR_PURE
))
8201 if (gimple_purge_dead_abnormal_call_edges (bb
))
8202 todo
|= TODO_cleanup_cfg
;
8204 if (gimple_in_ssa_p (cfun
))
8206 todo
|= TODO_update_ssa
| TODO_cleanup_cfg
;
8211 if (flags
& ECF_NORETURN
8212 && fixup_noreturn_call (stmt
))
8213 todo
|= TODO_cleanup_cfg
;
8216 if (maybe_clean_eh_stmt (stmt
)
8217 && gimple_purge_dead_eh_edges (bb
))
8218 todo
|= TODO_cleanup_cfg
;
8221 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
8222 e
->count
= apply_scale (e
->count
, count_scale
);
8224 /* If we have a basic block with no successors that does not
8225 end with a control statement or a noreturn call end it with
8226 a call to __builtin_unreachable. This situation can occur
8227 when inlining a noreturn call that does in fact return. */
8228 if (EDGE_COUNT (bb
->succs
) == 0)
8230 gimple stmt
= last_stmt (bb
);
8232 || (!is_ctrl_stmt (stmt
)
8233 && (!is_gimple_call (stmt
)
8234 || (gimple_call_flags (stmt
) & ECF_NORETURN
) == 0)))
8236 stmt
= gimple_build_call
8237 (builtin_decl_implicit (BUILT_IN_UNREACHABLE
), 0);
8238 gimple_stmt_iterator gsi
= gsi_last_bb (bb
);
8239 gsi_insert_after (&gsi
, stmt
, GSI_NEW_STMT
);
8243 if (count_scale
!= REG_BR_PROB_BASE
)
8244 compute_function_frequency ();
8246 /* We just processed all calls. */
8247 if (cfun
->gimple_df
)
8248 vec_free (MODIFIED_NORETURN_CALLS (cfun
));
8250 /* Dump a textual representation of the flowgraph. */
8252 gimple_dump_cfg (dump_file
, dump_flags
);
8255 && (todo
& TODO_cleanup_cfg
))
8256 loops_state_set (LOOPS_NEED_FIXUP
);
8263 const pass_data pass_data_fixup_cfg
=
8265 GIMPLE_PASS
, /* type */
8266 "*free_cfg_annotations", /* name */
8267 OPTGROUP_NONE
, /* optinfo_flags */
8268 false, /* has_gate */
8269 true, /* has_execute */
8270 TV_NONE
, /* tv_id */
8271 PROP_cfg
, /* properties_required */
8272 0, /* properties_provided */
8273 0, /* properties_destroyed */
8274 0, /* todo_flags_start */
8275 0, /* todo_flags_finish */
8278 class pass_fixup_cfg
: public gimple_opt_pass
8281 pass_fixup_cfg (gcc::context
*ctxt
)
8282 : gimple_opt_pass (pass_data_fixup_cfg
, ctxt
)
8285 /* opt_pass methods: */
8286 opt_pass
* clone () { return new pass_fixup_cfg (m_ctxt
); }
8287 unsigned int execute () { return execute_fixup_cfg (); }
8289 }; // class pass_fixup_cfg
8294 make_pass_fixup_cfg (gcc::context
*ctxt
)
8296 return new pass_fixup_cfg (ctxt
);
8299 /* Garbage collection support for edge_def. */
8301 extern void gt_ggc_mx (tree
&);
8302 extern void gt_ggc_mx (gimple
&);
8303 extern void gt_ggc_mx (rtx
&);
8304 extern void gt_ggc_mx (basic_block
&);
8307 gt_ggc_mx (edge_def
*e
)
8309 tree block
= LOCATION_BLOCK (e
->goto_locus
);
8311 gt_ggc_mx (e
->dest
);
8312 if (current_ir_type () == IR_GIMPLE
)
8313 gt_ggc_mx (e
->insns
.g
);
8315 gt_ggc_mx (e
->insns
.r
);
8319 /* PCH support for edge_def. */
8321 extern void gt_pch_nx (tree
&);
8322 extern void gt_pch_nx (gimple
&);
8323 extern void gt_pch_nx (rtx
&);
8324 extern void gt_pch_nx (basic_block
&);
8327 gt_pch_nx (edge_def
*e
)
8329 tree block
= LOCATION_BLOCK (e
->goto_locus
);
8331 gt_pch_nx (e
->dest
);
8332 if (current_ir_type () == IR_GIMPLE
)
8333 gt_pch_nx (e
->insns
.g
);
8335 gt_pch_nx (e
->insns
.r
);
8340 gt_pch_nx (edge_def
*e
, gt_pointer_operator op
, void *cookie
)
8342 tree block
= LOCATION_BLOCK (e
->goto_locus
);
8343 op (&(e
->src
), cookie
);
8344 op (&(e
->dest
), cookie
);
8345 if (current_ir_type () == IR_GIMPLE
)
8346 op (&(e
->insns
.g
), cookie
);
8348 op (&(e
->insns
.r
), cookie
);
8349 op (&(block
), cookie
);