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 "tree-dump.h"
35 #include "tree-pass.h"
36 #include "diagnostic-core.h"
39 #include "tree-ssa-propagate.h"
40 #include "value-prof.h"
41 #include "pointer-set.h"
42 #include "tree-inline.h"
44 #include "tree-ssa-live.h"
46 #include "tree-cfgcleanup.h"
48 /* This file contains functions for building the Control Flow Graph (CFG)
49 for a function tree. */
51 /* Local declarations. */
53 /* Initial capacity for the basic block array. */
54 static const int initial_cfg_capacity
= 20;
56 /* This hash table allows us to efficiently lookup all CASE_LABEL_EXPRs
57 which use a particular edge. The CASE_LABEL_EXPRs are chained together
58 via their CASE_CHAIN field, which we clear after we're done with the
59 hash table to prevent problems with duplication of GIMPLE_SWITCHes.
61 Access to this list of CASE_LABEL_EXPRs allows us to efficiently
62 update the case vector in response to edge redirections.
64 Right now this table is set up and torn down at key points in the
65 compilation process. It would be nice if we could make the table
66 more persistent. The key is getting notification of changes to
67 the CFG (particularly edge removal, creation and redirection). */
69 static struct pointer_map_t
*edge_to_cases
;
71 /* If we record edge_to_cases, this bitmap will hold indexes
72 of basic blocks that end in a GIMPLE_SWITCH which we touched
73 due to edge manipulations. */
75 static bitmap touched_switch_bbs
;
80 long num_merged_labels
;
83 static struct cfg_stats_d cfg_stats
;
85 /* Nonzero if we found a computed goto while building basic blocks. */
86 static bool found_computed_goto
;
88 /* Hash table to store last discriminator assigned for each locus. */
89 struct locus_discrim_map
95 /* Hashtable helpers. */
97 struct locus_discrim_hasher
: typed_free_remove
<locus_discrim_map
>
99 typedef locus_discrim_map value_type
;
100 typedef locus_discrim_map compare_type
;
101 static inline hashval_t
hash (const value_type
*);
102 static inline bool equal (const value_type
*, const compare_type
*);
105 /* Trivial hash function for a location_t. ITEM is a pointer to
106 a hash table entry that maps a location_t to a discriminator. */
109 locus_discrim_hasher::hash (const value_type
*item
)
111 return LOCATION_LINE (item
->locus
);
114 /* Equality function for the locus-to-discriminator map. A and B
115 point to the two hash table entries to compare. */
118 locus_discrim_hasher::equal (const value_type
*a
, const compare_type
*b
)
120 return LOCATION_LINE (a
->locus
) == LOCATION_LINE (b
->locus
);
123 static hash_table
<locus_discrim_hasher
> discriminator_per_locus
;
125 /* Basic blocks and flowgraphs. */
126 static void make_blocks (gimple_seq
);
127 static void factor_computed_gotos (void);
130 static void make_edges (void);
131 static void assign_discriminators (void);
132 static void make_cond_expr_edges (basic_block
);
133 static void make_gimple_switch_edges (basic_block
);
134 static void make_goto_expr_edges (basic_block
);
135 static void make_gimple_asm_edges (basic_block
);
136 static edge
gimple_redirect_edge_and_branch (edge
, basic_block
);
137 static edge
gimple_try_redirect_by_replacing_jump (edge
, basic_block
);
138 static unsigned int split_critical_edges (void);
140 /* Various helpers. */
141 static inline bool stmt_starts_bb_p (gimple
, gimple
);
142 static int gimple_verify_flow_info (void);
143 static void gimple_make_forwarder_block (edge
);
144 static gimple
first_non_label_stmt (basic_block
);
145 static bool verify_gimple_transaction (gimple
);
147 /* Flowgraph optimization and cleanup. */
148 static void gimple_merge_blocks (basic_block
, basic_block
);
149 static bool gimple_can_merge_blocks_p (basic_block
, basic_block
);
150 static void remove_bb (basic_block
);
151 static edge
find_taken_edge_computed_goto (basic_block
, tree
);
152 static edge
find_taken_edge_cond_expr (basic_block
, tree
);
153 static edge
find_taken_edge_switch_expr (basic_block
, tree
);
154 static tree
find_case_label_for_value (gimple
, tree
);
157 init_empty_tree_cfg_for_function (struct function
*fn
)
159 /* Initialize the basic block array. */
161 profile_status_for_function (fn
) = PROFILE_ABSENT
;
162 n_basic_blocks_for_function (fn
) = NUM_FIXED_BLOCKS
;
163 last_basic_block_for_function (fn
) = NUM_FIXED_BLOCKS
;
164 vec_alloc (basic_block_info_for_function (fn
), initial_cfg_capacity
);
165 vec_safe_grow_cleared (basic_block_info_for_function (fn
),
166 initial_cfg_capacity
);
168 /* Build a mapping of labels to their associated blocks. */
169 vec_alloc (label_to_block_map_for_function (fn
), initial_cfg_capacity
);
170 vec_safe_grow_cleared (label_to_block_map_for_function (fn
),
171 initial_cfg_capacity
);
173 SET_BASIC_BLOCK_FOR_FUNCTION (fn
, ENTRY_BLOCK
,
174 ENTRY_BLOCK_PTR_FOR_FUNCTION (fn
));
175 SET_BASIC_BLOCK_FOR_FUNCTION (fn
, EXIT_BLOCK
,
176 EXIT_BLOCK_PTR_FOR_FUNCTION (fn
));
178 ENTRY_BLOCK_PTR_FOR_FUNCTION (fn
)->next_bb
179 = EXIT_BLOCK_PTR_FOR_FUNCTION (fn
);
180 EXIT_BLOCK_PTR_FOR_FUNCTION (fn
)->prev_bb
181 = ENTRY_BLOCK_PTR_FOR_FUNCTION (fn
);
185 init_empty_tree_cfg (void)
187 init_empty_tree_cfg_for_function (cfun
);
190 /*---------------------------------------------------------------------------
192 ---------------------------------------------------------------------------*/
194 /* Entry point to the CFG builder for trees. SEQ is the sequence of
195 statements to be added to the flowgraph. */
198 build_gimple_cfg (gimple_seq seq
)
200 /* Register specific gimple functions. */
201 gimple_register_cfg_hooks ();
203 memset ((void *) &cfg_stats
, 0, sizeof (cfg_stats
));
205 init_empty_tree_cfg ();
207 found_computed_goto
= 0;
210 /* Computed gotos are hell to deal with, especially if there are
211 lots of them with a large number of destinations. So we factor
212 them to a common computed goto location before we build the
213 edge list. After we convert back to normal form, we will un-factor
214 the computed gotos since factoring introduces an unwanted jump. */
215 if (found_computed_goto
)
216 factor_computed_gotos ();
218 /* Make sure there is always at least one block, even if it's empty. */
219 if (n_basic_blocks
== NUM_FIXED_BLOCKS
)
220 create_empty_bb (ENTRY_BLOCK_PTR
);
222 /* Adjust the size of the array. */
223 if (basic_block_info
->length () < (size_t) n_basic_blocks
)
224 vec_safe_grow_cleared (basic_block_info
, n_basic_blocks
);
226 /* To speed up statement iterator walks, we first purge dead labels. */
227 cleanup_dead_labels ();
229 /* Group case nodes to reduce the number of edges.
230 We do this after cleaning up dead labels because otherwise we miss
231 a lot of obvious case merging opportunities. */
232 group_case_labels ();
234 /* Create the edges of the flowgraph. */
235 discriminator_per_locus
.create (13);
237 assign_discriminators ();
238 cleanup_dead_labels ();
239 discriminator_per_locus
.dispose ();
243 execute_build_cfg (void)
245 gimple_seq body
= gimple_body (current_function_decl
);
247 build_gimple_cfg (body
);
248 gimple_set_body (current_function_decl
, NULL
);
249 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
251 fprintf (dump_file
, "Scope blocks:\n");
252 dump_scope_blocks (dump_file
, dump_flags
);
255 loop_optimizer_init (AVOID_CFG_MODIFICATIONS
);
261 const pass_data pass_data_build_cfg
=
263 GIMPLE_PASS
, /* type */
265 OPTGROUP_NONE
, /* optinfo_flags */
266 false, /* has_gate */
267 true, /* has_execute */
268 TV_TREE_CFG
, /* tv_id */
269 PROP_gimple_leh
, /* properties_required */
270 ( PROP_cfg
| PROP_loops
), /* properties_provided */
271 0, /* properties_destroyed */
272 0, /* todo_flags_start */
273 TODO_verify_stmts
, /* todo_flags_finish */
276 class pass_build_cfg
: public gimple_opt_pass
279 pass_build_cfg (gcc::context
*ctxt
)
280 : gimple_opt_pass (pass_data_build_cfg
, ctxt
)
283 /* opt_pass methods: */
284 unsigned int execute () { return execute_build_cfg (); }
286 }; // class pass_build_cfg
291 make_pass_build_cfg (gcc::context
*ctxt
)
293 return new pass_build_cfg (ctxt
);
297 /* Return true if T is a computed goto. */
300 computed_goto_p (gimple t
)
302 return (gimple_code (t
) == GIMPLE_GOTO
303 && TREE_CODE (gimple_goto_dest (t
)) != LABEL_DECL
);
307 /* Search the CFG for any computed gotos. If found, factor them to a
308 common computed goto site. Also record the location of that site so
309 that we can un-factor the gotos after we have converted back to
313 factor_computed_gotos (void)
316 tree factored_label_decl
= NULL
;
318 gimple factored_computed_goto_label
= NULL
;
319 gimple factored_computed_goto
= NULL
;
321 /* We know there are one or more computed gotos in this function.
322 Examine the last statement in each basic block to see if the block
323 ends with a computed goto. */
327 gimple_stmt_iterator gsi
= gsi_last_bb (bb
);
333 last
= gsi_stmt (gsi
);
335 /* Ignore the computed goto we create when we factor the original
337 if (last
== factored_computed_goto
)
340 /* If the last statement is a computed goto, factor it. */
341 if (computed_goto_p (last
))
345 /* The first time we find a computed goto we need to create
346 the factored goto block and the variable each original
347 computed goto will use for their goto destination. */
348 if (!factored_computed_goto
)
350 basic_block new_bb
= create_empty_bb (bb
);
351 gimple_stmt_iterator new_gsi
= gsi_start_bb (new_bb
);
353 /* Create the destination of the factored goto. Each original
354 computed goto will put its desired destination into this
355 variable and jump to the label we create immediately
357 var
= create_tmp_var (ptr_type_node
, "gotovar");
359 /* Build a label for the new block which will contain the
360 factored computed goto. */
361 factored_label_decl
= create_artificial_label (UNKNOWN_LOCATION
);
362 factored_computed_goto_label
363 = gimple_build_label (factored_label_decl
);
364 gsi_insert_after (&new_gsi
, factored_computed_goto_label
,
367 /* Build our new computed goto. */
368 factored_computed_goto
= gimple_build_goto (var
);
369 gsi_insert_after (&new_gsi
, factored_computed_goto
, GSI_NEW_STMT
);
372 /* Copy the original computed goto's destination into VAR. */
373 assignment
= gimple_build_assign (var
, gimple_goto_dest (last
));
374 gsi_insert_before (&gsi
, assignment
, GSI_SAME_STMT
);
376 /* And re-vector the computed goto to the new destination. */
377 gimple_goto_set_dest (last
, factored_label_decl
);
383 /* Build a flowgraph for the sequence of stmts SEQ. */
386 make_blocks (gimple_seq seq
)
388 gimple_stmt_iterator i
= gsi_start (seq
);
390 bool start_new_block
= true;
391 bool first_stmt_of_seq
= true;
392 basic_block bb
= ENTRY_BLOCK_PTR
;
394 while (!gsi_end_p (i
))
401 /* If the statement starts a new basic block or if we have determined
402 in a previous pass that we need to create a new block for STMT, do
404 if (start_new_block
|| stmt_starts_bb_p (stmt
, prev_stmt
))
406 if (!first_stmt_of_seq
)
407 gsi_split_seq_before (&i
, &seq
);
408 bb
= create_basic_block (seq
, NULL
, bb
);
409 start_new_block
= false;
412 /* Now add STMT to BB and create the subgraphs for special statement
414 gimple_set_bb (stmt
, bb
);
416 if (computed_goto_p (stmt
))
417 found_computed_goto
= true;
419 /* If STMT is a basic block terminator, set START_NEW_BLOCK for the
421 if (stmt_ends_bb_p (stmt
))
423 /* If the stmt can make abnormal goto use a new temporary
424 for the assignment to the LHS. This makes sure the old value
425 of the LHS is available on the abnormal edge. Otherwise
426 we will end up with overlapping life-ranges for abnormal
428 if (gimple_has_lhs (stmt
)
429 && stmt_can_make_abnormal_goto (stmt
)
430 && is_gimple_reg_type (TREE_TYPE (gimple_get_lhs (stmt
))))
432 tree lhs
= gimple_get_lhs (stmt
);
433 tree tmp
= create_tmp_var (TREE_TYPE (lhs
), NULL
);
434 gimple s
= gimple_build_assign (lhs
, tmp
);
435 gimple_set_location (s
, gimple_location (stmt
));
436 gimple_set_block (s
, gimple_block (stmt
));
437 gimple_set_lhs (stmt
, tmp
);
438 if (TREE_CODE (TREE_TYPE (tmp
)) == COMPLEX_TYPE
439 || TREE_CODE (TREE_TYPE (tmp
)) == VECTOR_TYPE
)
440 DECL_GIMPLE_REG_P (tmp
) = 1;
441 gsi_insert_after (&i
, s
, GSI_SAME_STMT
);
443 start_new_block
= true;
447 first_stmt_of_seq
= false;
452 /* Create and return a new empty basic block after bb AFTER. */
455 create_bb (void *h
, void *e
, basic_block after
)
461 /* Create and initialize a new basic block. Since alloc_block uses
462 GC allocation that clears memory to allocate a basic block, we do
463 not have to clear the newly allocated basic block here. */
466 bb
->index
= last_basic_block
;
468 set_bb_seq (bb
, h
? (gimple_seq
) h
: NULL
);
470 /* Add the new block to the linked list of blocks. */
471 link_block (bb
, after
);
473 /* Grow the basic block array if needed. */
474 if ((size_t) last_basic_block
== basic_block_info
->length ())
476 size_t new_size
= last_basic_block
+ (last_basic_block
+ 3) / 4;
477 vec_safe_grow_cleared (basic_block_info
, new_size
);
480 /* Add the newly created block to the array. */
481 SET_BASIC_BLOCK (last_basic_block
, bb
);
490 /*---------------------------------------------------------------------------
492 ---------------------------------------------------------------------------*/
494 /* Fold COND_EXPR_COND of each COND_EXPR. */
497 fold_cond_expr_cond (void)
503 gimple stmt
= last_stmt (bb
);
505 if (stmt
&& gimple_code (stmt
) == GIMPLE_COND
)
507 location_t loc
= gimple_location (stmt
);
511 fold_defer_overflow_warnings ();
512 cond
= fold_binary_loc (loc
, gimple_cond_code (stmt
), boolean_type_node
,
513 gimple_cond_lhs (stmt
), gimple_cond_rhs (stmt
));
516 zerop
= integer_zerop (cond
);
517 onep
= integer_onep (cond
);
520 zerop
= onep
= false;
522 fold_undefer_overflow_warnings (zerop
|| onep
,
524 WARN_STRICT_OVERFLOW_CONDITIONAL
);
526 gimple_cond_make_false (stmt
);
528 gimple_cond_make_true (stmt
);
533 /* Join all the blocks in the flowgraph. */
539 struct omp_region
*cur_region
= NULL
;
541 /* Create an edge from entry to the first block with executable
543 make_edge (ENTRY_BLOCK_PTR
, BASIC_BLOCK (NUM_FIXED_BLOCKS
), EDGE_FALLTHRU
);
545 /* Traverse the basic block array placing edges. */
548 gimple last
= last_stmt (bb
);
553 enum gimple_code code
= gimple_code (last
);
557 make_goto_expr_edges (bb
);
561 make_edge (bb
, EXIT_BLOCK_PTR
, 0);
565 make_cond_expr_edges (bb
);
569 make_gimple_switch_edges (bb
);
573 make_eh_edges (last
);
576 case GIMPLE_EH_DISPATCH
:
577 fallthru
= make_eh_dispatch_edges (last
);
581 /* If this function receives a nonlocal goto, then we need to
582 make edges from this call site to all the nonlocal goto
584 if (stmt_can_make_abnormal_goto (last
))
585 make_abnormal_goto_edges (bb
, true);
587 /* If this statement has reachable exception handlers, then
588 create abnormal edges to them. */
589 make_eh_edges (last
);
591 /* BUILTIN_RETURN is really a return statement. */
592 if (gimple_call_builtin_p (last
, BUILT_IN_RETURN
))
593 make_edge (bb
, EXIT_BLOCK_PTR
, 0), fallthru
= false;
594 /* Some calls are known not to return. */
596 fallthru
= !(gimple_call_flags (last
) & ECF_NORETURN
);
600 /* A GIMPLE_ASSIGN may throw internally and thus be considered
602 if (is_ctrl_altering_stmt (last
))
603 make_eh_edges (last
);
608 make_gimple_asm_edges (bb
);
613 fallthru
= make_gimple_omp_edges (bb
, &cur_region
);
616 case GIMPLE_TRANSACTION
:
618 tree abort_label
= gimple_transaction_label (last
);
620 make_edge (bb
, label_to_block (abort_label
), EDGE_TM_ABORT
);
626 gcc_assert (!stmt_ends_bb_p (last
));
634 make_edge (bb
, bb
->next_bb
, EDGE_FALLTHRU
);
639 /* Fold COND_EXPR_COND of each COND_EXPR. */
640 fold_cond_expr_cond ();
643 /* Find the next available discriminator value for LOCUS. The
644 discriminator distinguishes among several basic blocks that
645 share a common locus, allowing for more accurate sample-based
649 next_discriminator_for_locus (location_t locus
)
651 struct locus_discrim_map item
;
652 struct locus_discrim_map
**slot
;
655 item
.discriminator
= 0;
656 slot
= discriminator_per_locus
.find_slot_with_hash (
657 &item
, LOCATION_LINE (locus
), INSERT
);
659 if (*slot
== HTAB_EMPTY_ENTRY
)
661 *slot
= XNEW (struct locus_discrim_map
);
663 (*slot
)->locus
= locus
;
664 (*slot
)->discriminator
= 0;
666 (*slot
)->discriminator
++;
667 return (*slot
)->discriminator
;
670 /* Return TRUE if LOCUS1 and LOCUS2 refer to the same source line. */
673 same_line_p (location_t locus1
, location_t locus2
)
675 expanded_location from
, to
;
677 if (locus1
== locus2
)
680 from
= expand_location (locus1
);
681 to
= expand_location (locus2
);
683 if (from
.line
!= to
.line
)
685 if (from
.file
== to
.file
)
687 return (from
.file
!= NULL
689 && filename_cmp (from
.file
, to
.file
) == 0);
692 /* Assign discriminators to each basic block. */
695 assign_discriminators (void)
703 gimple last
= last_stmt (bb
);
704 location_t locus
= last
? gimple_location (last
) : UNKNOWN_LOCATION
;
706 if (locus
== UNKNOWN_LOCATION
)
709 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
711 gimple first
= first_non_label_stmt (e
->dest
);
712 gimple last
= last_stmt (e
->dest
);
713 if ((first
&& same_line_p (locus
, gimple_location (first
)))
714 || (last
&& same_line_p (locus
, gimple_location (last
))))
716 if (e
->dest
->discriminator
!= 0 && bb
->discriminator
== 0)
717 bb
->discriminator
= next_discriminator_for_locus (locus
);
719 e
->dest
->discriminator
= next_discriminator_for_locus (locus
);
725 /* Create the edges for a GIMPLE_COND starting at block BB. */
728 make_cond_expr_edges (basic_block bb
)
730 gimple entry
= last_stmt (bb
);
731 gimple then_stmt
, else_stmt
;
732 basic_block then_bb
, else_bb
;
733 tree then_label
, else_label
;
737 gcc_assert (gimple_code (entry
) == GIMPLE_COND
);
739 /* Entry basic blocks for each component. */
740 then_label
= gimple_cond_true_label (entry
);
741 else_label
= gimple_cond_false_label (entry
);
742 then_bb
= label_to_block (then_label
);
743 else_bb
= label_to_block (else_label
);
744 then_stmt
= first_stmt (then_bb
);
745 else_stmt
= first_stmt (else_bb
);
747 e
= make_edge (bb
, then_bb
, EDGE_TRUE_VALUE
);
748 e
->goto_locus
= gimple_location (then_stmt
);
749 e
= make_edge (bb
, else_bb
, EDGE_FALSE_VALUE
);
751 e
->goto_locus
= gimple_location (else_stmt
);
753 /* We do not need the labels anymore. */
754 gimple_cond_set_true_label (entry
, NULL_TREE
);
755 gimple_cond_set_false_label (entry
, NULL_TREE
);
759 /* Called for each element in the hash table (P) as we delete the
760 edge to cases hash table.
762 Clear all the TREE_CHAINs to prevent problems with copying of
763 SWITCH_EXPRs and structure sharing rules, then free the hash table
767 edge_to_cases_cleanup (const void *key ATTRIBUTE_UNUSED
, void **value
,
768 void *data ATTRIBUTE_UNUSED
)
772 for (t
= (tree
) *value
; t
; t
= next
)
774 next
= CASE_CHAIN (t
);
775 CASE_CHAIN (t
) = NULL
;
782 /* Start recording information mapping edges to case labels. */
785 start_recording_case_labels (void)
787 gcc_assert (edge_to_cases
== NULL
);
788 edge_to_cases
= pointer_map_create ();
789 touched_switch_bbs
= BITMAP_ALLOC (NULL
);
792 /* Return nonzero if we are recording information for case labels. */
795 recording_case_labels_p (void)
797 return (edge_to_cases
!= NULL
);
800 /* Stop recording information mapping edges to case labels and
801 remove any information we have recorded. */
803 end_recording_case_labels (void)
807 pointer_map_traverse (edge_to_cases
, edge_to_cases_cleanup
, NULL
);
808 pointer_map_destroy (edge_to_cases
);
809 edge_to_cases
= NULL
;
810 EXECUTE_IF_SET_IN_BITMAP (touched_switch_bbs
, 0, i
, bi
)
812 basic_block bb
= BASIC_BLOCK (i
);
815 gimple stmt
= last_stmt (bb
);
816 if (stmt
&& gimple_code (stmt
) == GIMPLE_SWITCH
)
817 group_case_labels_stmt (stmt
);
820 BITMAP_FREE (touched_switch_bbs
);
823 /* If we are inside a {start,end}_recording_cases block, then return
824 a chain of CASE_LABEL_EXPRs from T which reference E.
826 Otherwise return NULL. */
829 get_cases_for_edge (edge e
, gimple t
)
834 /* If we are not recording cases, then we do not have CASE_LABEL_EXPR
835 chains available. Return NULL so the caller can detect this case. */
836 if (!recording_case_labels_p ())
839 slot
= pointer_map_contains (edge_to_cases
, e
);
843 /* If we did not find E in the hash table, then this must be the first
844 time we have been queried for information about E & T. Add all the
845 elements from T to the hash table then perform the query again. */
847 n
= gimple_switch_num_labels (t
);
848 for (i
= 0; i
< n
; i
++)
850 tree elt
= gimple_switch_label (t
, i
);
851 tree lab
= CASE_LABEL (elt
);
852 basic_block label_bb
= label_to_block (lab
);
853 edge this_edge
= find_edge (e
->src
, label_bb
);
855 /* Add it to the chain of CASE_LABEL_EXPRs referencing E, or create
857 slot
= pointer_map_insert (edge_to_cases
, this_edge
);
858 CASE_CHAIN (elt
) = (tree
) *slot
;
862 return (tree
) *pointer_map_contains (edge_to_cases
, e
);
865 /* Create the edges for a GIMPLE_SWITCH starting at block BB. */
868 make_gimple_switch_edges (basic_block bb
)
870 gimple entry
= last_stmt (bb
);
873 n
= gimple_switch_num_labels (entry
);
875 for (i
= 0; i
< n
; ++i
)
877 tree lab
= CASE_LABEL (gimple_switch_label (entry
, i
));
878 basic_block label_bb
= label_to_block (lab
);
879 make_edge (bb
, label_bb
, 0);
884 /* Return the basic block holding label DEST. */
887 label_to_block_fn (struct function
*ifun
, tree dest
)
889 int uid
= LABEL_DECL_UID (dest
);
891 /* We would die hard when faced by an undefined label. Emit a label to
892 the very first basic block. This will hopefully make even the dataflow
893 and undefined variable warnings quite right. */
894 if (seen_error () && uid
< 0)
896 gimple_stmt_iterator gsi
= gsi_start_bb (BASIC_BLOCK (NUM_FIXED_BLOCKS
));
899 stmt
= gimple_build_label (dest
);
900 gsi_insert_before (&gsi
, stmt
, GSI_NEW_STMT
);
901 uid
= LABEL_DECL_UID (dest
);
903 if (vec_safe_length (ifun
->cfg
->x_label_to_block_map
) <= (unsigned int) uid
)
905 return (*ifun
->cfg
->x_label_to_block_map
)[uid
];
908 /* Create edges for an abnormal goto statement at block BB. If FOR_CALL
909 is true, the source statement is a CALL_EXPR instead of a GOTO_EXPR. */
912 make_abnormal_goto_edges (basic_block bb
, bool for_call
)
914 basic_block target_bb
;
915 gimple_stmt_iterator gsi
;
917 FOR_EACH_BB (target_bb
)
919 for (gsi
= gsi_start_bb (target_bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
921 gimple label_stmt
= gsi_stmt (gsi
);
924 if (gimple_code (label_stmt
) != GIMPLE_LABEL
)
927 target
= gimple_label_label (label_stmt
);
929 /* Make an edge to every label block that has been marked as a
930 potential target for a computed goto or a non-local goto. */
931 if ((FORCED_LABEL (target
) && !for_call
)
932 || (DECL_NONLOCAL (target
) && for_call
))
934 make_edge (bb
, target_bb
, EDGE_ABNORMAL
);
939 && is_gimple_debug (gsi_stmt (gsi
)))
940 gsi_next_nondebug (&gsi
);
941 if (!gsi_end_p (gsi
))
943 /* Make an edge to every setjmp-like call. */
944 gimple call_stmt
= gsi_stmt (gsi
);
945 if (is_gimple_call (call_stmt
)
946 && (gimple_call_flags (call_stmt
) & ECF_RETURNS_TWICE
))
947 make_edge (bb
, target_bb
, EDGE_ABNORMAL
);
952 /* Create edges for a goto statement at block BB. */
955 make_goto_expr_edges (basic_block bb
)
957 gimple_stmt_iterator last
= gsi_last_bb (bb
);
958 gimple goto_t
= gsi_stmt (last
);
960 /* A simple GOTO creates normal edges. */
961 if (simple_goto_p (goto_t
))
963 tree dest
= gimple_goto_dest (goto_t
);
964 basic_block label_bb
= label_to_block (dest
);
965 edge e
= make_edge (bb
, label_bb
, EDGE_FALLTHRU
);
966 e
->goto_locus
= gimple_location (goto_t
);
967 gsi_remove (&last
, true);
971 /* A computed GOTO creates abnormal edges. */
972 make_abnormal_goto_edges (bb
, false);
975 /* Create edges for an asm statement with labels at block BB. */
978 make_gimple_asm_edges (basic_block bb
)
980 gimple stmt
= last_stmt (bb
);
981 int i
, n
= gimple_asm_nlabels (stmt
);
983 for (i
= 0; i
< n
; ++i
)
985 tree label
= TREE_VALUE (gimple_asm_label_op (stmt
, i
));
986 basic_block label_bb
= label_to_block (label
);
987 make_edge (bb
, label_bb
, 0);
991 /*---------------------------------------------------------------------------
993 ---------------------------------------------------------------------------*/
995 /* Cleanup useless labels in basic blocks. This is something we wish
996 to do early because it allows us to group case labels before creating
997 the edges for the CFG, and it speeds up block statement iterators in
999 We rerun this pass after CFG is created, to get rid of the labels that
1000 are no longer referenced. After then we do not run it any more, since
1001 (almost) no new labels should be created. */
1003 /* A map from basic block index to the leading label of that block. */
1004 static struct label_record
1009 /* True if the label is referenced from somewhere. */
1013 /* Given LABEL return the first label in the same basic block. */
1016 main_block_label (tree label
)
1018 basic_block bb
= label_to_block (label
);
1019 tree main_label
= label_for_bb
[bb
->index
].label
;
1021 /* label_to_block possibly inserted undefined label into the chain. */
1024 label_for_bb
[bb
->index
].label
= label
;
1028 label_for_bb
[bb
->index
].used
= true;
1032 /* Clean up redundant labels within the exception tree. */
1035 cleanup_dead_labels_eh (void)
1042 if (cfun
->eh
== NULL
)
1045 for (i
= 1; vec_safe_iterate (cfun
->eh
->lp_array
, i
, &lp
); ++i
)
1046 if (lp
&& lp
->post_landing_pad
)
1048 lab
= main_block_label (lp
->post_landing_pad
);
1049 if (lab
!= lp
->post_landing_pad
)
1051 EH_LANDING_PAD_NR (lp
->post_landing_pad
) = 0;
1052 EH_LANDING_PAD_NR (lab
) = lp
->index
;
1056 FOR_ALL_EH_REGION (r
)
1060 case ERT_MUST_NOT_THROW
:
1066 for (c
= r
->u
.eh_try
.first_catch
; c
; c
= c
->next_catch
)
1070 c
->label
= main_block_label (lab
);
1075 case ERT_ALLOWED_EXCEPTIONS
:
1076 lab
= r
->u
.allowed
.label
;
1078 r
->u
.allowed
.label
= main_block_label (lab
);
1084 /* Cleanup redundant labels. This is a three-step process:
1085 1) Find the leading label for each block.
1086 2) Redirect all references to labels to the leading labels.
1087 3) Cleanup all useless labels. */
1090 cleanup_dead_labels (void)
1093 label_for_bb
= XCNEWVEC (struct label_record
, last_basic_block
);
1095 /* Find a suitable label for each block. We use the first user-defined
1096 label if there is one, or otherwise just the first label we see. */
1099 gimple_stmt_iterator i
;
1101 for (i
= gsi_start_bb (bb
); !gsi_end_p (i
); gsi_next (&i
))
1104 gimple stmt
= gsi_stmt (i
);
1106 if (gimple_code (stmt
) != GIMPLE_LABEL
)
1109 label
= gimple_label_label (stmt
);
1111 /* If we have not yet seen a label for the current block,
1112 remember this one and see if there are more labels. */
1113 if (!label_for_bb
[bb
->index
].label
)
1115 label_for_bb
[bb
->index
].label
= label
;
1119 /* If we did see a label for the current block already, but it
1120 is an artificially created label, replace it if the current
1121 label is a user defined label. */
1122 if (!DECL_ARTIFICIAL (label
)
1123 && DECL_ARTIFICIAL (label_for_bb
[bb
->index
].label
))
1125 label_for_bb
[bb
->index
].label
= label
;
1131 /* Now redirect all jumps/branches to the selected label.
1132 First do so for each block ending in a control statement. */
1135 gimple stmt
= last_stmt (bb
);
1136 tree label
, new_label
;
1141 switch (gimple_code (stmt
))
1144 label
= gimple_cond_true_label (stmt
);
1147 new_label
= main_block_label (label
);
1148 if (new_label
!= label
)
1149 gimple_cond_set_true_label (stmt
, new_label
);
1152 label
= gimple_cond_false_label (stmt
);
1155 new_label
= main_block_label (label
);
1156 if (new_label
!= label
)
1157 gimple_cond_set_false_label (stmt
, new_label
);
1163 size_t i
, n
= gimple_switch_num_labels (stmt
);
1165 /* Replace all destination labels. */
1166 for (i
= 0; i
< n
; ++i
)
1168 tree case_label
= gimple_switch_label (stmt
, i
);
1169 label
= CASE_LABEL (case_label
);
1170 new_label
= main_block_label (label
);
1171 if (new_label
!= label
)
1172 CASE_LABEL (case_label
) = new_label
;
1179 int i
, n
= gimple_asm_nlabels (stmt
);
1181 for (i
= 0; i
< n
; ++i
)
1183 tree cons
= gimple_asm_label_op (stmt
, i
);
1184 tree label
= main_block_label (TREE_VALUE (cons
));
1185 TREE_VALUE (cons
) = label
;
1190 /* We have to handle gotos until they're removed, and we don't
1191 remove them until after we've created the CFG edges. */
1193 if (!computed_goto_p (stmt
))
1195 label
= gimple_goto_dest (stmt
);
1196 new_label
= main_block_label (label
);
1197 if (new_label
!= label
)
1198 gimple_goto_set_dest (stmt
, new_label
);
1202 case GIMPLE_TRANSACTION
:
1204 tree label
= gimple_transaction_label (stmt
);
1207 tree new_label
= main_block_label (label
);
1208 if (new_label
!= label
)
1209 gimple_transaction_set_label (stmt
, new_label
);
1219 /* Do the same for the exception region tree labels. */
1220 cleanup_dead_labels_eh ();
1222 /* Finally, purge dead labels. All user-defined labels and labels that
1223 can be the target of non-local gotos and labels which have their
1224 address taken are preserved. */
1227 gimple_stmt_iterator i
;
1228 tree label_for_this_bb
= label_for_bb
[bb
->index
].label
;
1230 if (!label_for_this_bb
)
1233 /* If the main label of the block is unused, we may still remove it. */
1234 if (!label_for_bb
[bb
->index
].used
)
1235 label_for_this_bb
= NULL
;
1237 for (i
= gsi_start_bb (bb
); !gsi_end_p (i
); )
1240 gimple stmt
= gsi_stmt (i
);
1242 if (gimple_code (stmt
) != GIMPLE_LABEL
)
1245 label
= gimple_label_label (stmt
);
1247 if (label
== label_for_this_bb
1248 || !DECL_ARTIFICIAL (label
)
1249 || DECL_NONLOCAL (label
)
1250 || FORCED_LABEL (label
))
1253 gsi_remove (&i
, true);
1257 free (label_for_bb
);
1260 /* Scan the sorted vector of cases in STMT (a GIMPLE_SWITCH) and combine
1261 the ones jumping to the same label.
1262 Eg. three separate entries 1: 2: 3: become one entry 1..3: */
1265 group_case_labels_stmt (gimple stmt
)
1267 int old_size
= gimple_switch_num_labels (stmt
);
1268 int i
, j
, new_size
= old_size
;
1269 basic_block default_bb
= NULL
;
1271 default_bb
= label_to_block (CASE_LABEL (gimple_switch_default_label (stmt
)));
1273 /* Look for possible opportunities to merge cases. */
1275 while (i
< old_size
)
1277 tree base_case
, base_high
;
1278 basic_block base_bb
;
1280 base_case
= gimple_switch_label (stmt
, i
);
1282 gcc_assert (base_case
);
1283 base_bb
= label_to_block (CASE_LABEL (base_case
));
1285 /* Discard cases that have the same destination as the
1287 if (base_bb
== default_bb
)
1289 gimple_switch_set_label (stmt
, i
, NULL_TREE
);
1295 base_high
= CASE_HIGH (base_case
)
1296 ? CASE_HIGH (base_case
)
1297 : CASE_LOW (base_case
);
1300 /* Try to merge case labels. Break out when we reach the end
1301 of the label vector or when we cannot merge the next case
1302 label with the current one. */
1303 while (i
< old_size
)
1305 tree merge_case
= gimple_switch_label (stmt
, i
);
1306 basic_block merge_bb
= label_to_block (CASE_LABEL (merge_case
));
1307 double_int bhp1
= tree_to_double_int (base_high
) + double_int_one
;
1309 /* Merge the cases if they jump to the same place,
1310 and their ranges are consecutive. */
1311 if (merge_bb
== base_bb
1312 && tree_to_double_int (CASE_LOW (merge_case
)) == bhp1
)
1314 base_high
= CASE_HIGH (merge_case
) ?
1315 CASE_HIGH (merge_case
) : CASE_LOW (merge_case
);
1316 CASE_HIGH (base_case
) = base_high
;
1317 gimple_switch_set_label (stmt
, i
, NULL_TREE
);
1326 /* Compress the case labels in the label vector, and adjust the
1327 length of the vector. */
1328 for (i
= 0, j
= 0; i
< new_size
; i
++)
1330 while (! gimple_switch_label (stmt
, j
))
1332 gimple_switch_set_label (stmt
, i
,
1333 gimple_switch_label (stmt
, j
++));
1336 gcc_assert (new_size
<= old_size
);
1337 gimple_switch_set_num_labels (stmt
, new_size
);
1340 /* Look for blocks ending in a multiway branch (a GIMPLE_SWITCH),
1341 and scan the sorted vector of cases. Combine the ones jumping to the
1345 group_case_labels (void)
1351 gimple stmt
= last_stmt (bb
);
1352 if (stmt
&& gimple_code (stmt
) == GIMPLE_SWITCH
)
1353 group_case_labels_stmt (stmt
);
1357 /* Checks whether we can merge block B into block A. */
1360 gimple_can_merge_blocks_p (basic_block a
, basic_block b
)
1363 gimple_stmt_iterator gsi
;
1365 if (!single_succ_p (a
))
1368 if (single_succ_edge (a
)->flags
& EDGE_COMPLEX
)
1371 if (single_succ (a
) != b
)
1374 if (!single_pred_p (b
))
1377 if (b
== EXIT_BLOCK_PTR
)
1380 /* If A ends by a statement causing exceptions or something similar, we
1381 cannot merge the blocks. */
1382 stmt
= last_stmt (a
);
1383 if (stmt
&& stmt_ends_bb_p (stmt
))
1386 /* Do not allow a block with only a non-local label to be merged. */
1388 && gimple_code (stmt
) == GIMPLE_LABEL
1389 && DECL_NONLOCAL (gimple_label_label (stmt
)))
1392 /* Examine the labels at the beginning of B. */
1393 for (gsi
= gsi_start_bb (b
); !gsi_end_p (gsi
); gsi_next (&gsi
))
1396 stmt
= gsi_stmt (gsi
);
1397 if (gimple_code (stmt
) != GIMPLE_LABEL
)
1399 lab
= gimple_label_label (stmt
);
1401 /* Do not remove user forced labels or for -O0 any user labels. */
1402 if (!DECL_ARTIFICIAL (lab
) && (!optimize
|| FORCED_LABEL (lab
)))
1406 /* Protect the loop latches. */
1407 if (current_loops
&& b
->loop_father
->latch
== b
)
1410 /* It must be possible to eliminate all phi nodes in B. If ssa form
1411 is not up-to-date and a name-mapping is registered, we cannot eliminate
1412 any phis. Symbols marked for renaming are never a problem though. */
1413 for (gsi
= gsi_start_phis (b
); !gsi_end_p (gsi
); gsi_next (&gsi
))
1415 gimple phi
= gsi_stmt (gsi
);
1416 /* Technically only new names matter. */
1417 if (name_registered_for_update_p (PHI_RESULT (phi
)))
1421 /* When not optimizing, don't merge if we'd lose goto_locus. */
1423 && single_succ_edge (a
)->goto_locus
!= UNKNOWN_LOCATION
)
1425 location_t goto_locus
= single_succ_edge (a
)->goto_locus
;
1426 gimple_stmt_iterator prev
, next
;
1427 prev
= gsi_last_nondebug_bb (a
);
1428 next
= gsi_after_labels (b
);
1429 if (!gsi_end_p (next
) && is_gimple_debug (gsi_stmt (next
)))
1430 gsi_next_nondebug (&next
);
1431 if ((gsi_end_p (prev
)
1432 || gimple_location (gsi_stmt (prev
)) != goto_locus
)
1433 && (gsi_end_p (next
)
1434 || gimple_location (gsi_stmt (next
)) != goto_locus
))
1441 /* Replaces all uses of NAME by VAL. */
1444 replace_uses_by (tree name
, tree val
)
1446 imm_use_iterator imm_iter
;
1451 FOR_EACH_IMM_USE_STMT (stmt
, imm_iter
, name
)
1453 FOR_EACH_IMM_USE_ON_STMT (use
, imm_iter
)
1455 replace_exp (use
, val
);
1457 if (gimple_code (stmt
) == GIMPLE_PHI
)
1459 e
= gimple_phi_arg_edge (stmt
, PHI_ARG_INDEX_FROM_USE (use
));
1460 if (e
->flags
& EDGE_ABNORMAL
)
1462 /* This can only occur for virtual operands, since
1463 for the real ones SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name))
1464 would prevent replacement. */
1465 gcc_checking_assert (virtual_operand_p (name
));
1466 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (val
) = 1;
1471 if (gimple_code (stmt
) != GIMPLE_PHI
)
1473 gimple_stmt_iterator gsi
= gsi_for_stmt (stmt
);
1474 gimple orig_stmt
= stmt
;
1477 /* Mark the block if we changed the last stmt in it. */
1478 if (cfgcleanup_altered_bbs
1479 && stmt_ends_bb_p (stmt
))
1480 bitmap_set_bit (cfgcleanup_altered_bbs
, gimple_bb (stmt
)->index
);
1482 /* FIXME. It shouldn't be required to keep TREE_CONSTANT
1483 on ADDR_EXPRs up-to-date on GIMPLE. Propagation will
1484 only change sth from non-invariant to invariant, and only
1485 when propagating constants. */
1486 if (is_gimple_min_invariant (val
))
1487 for (i
= 0; i
< gimple_num_ops (stmt
); i
++)
1489 tree op
= gimple_op (stmt
, i
);
1490 /* Operands may be empty here. For example, the labels
1491 of a GIMPLE_COND are nulled out following the creation
1492 of the corresponding CFG edges. */
1493 if (op
&& TREE_CODE (op
) == ADDR_EXPR
)
1494 recompute_tree_invariant_for_addr_expr (op
);
1497 if (fold_stmt (&gsi
))
1498 stmt
= gsi_stmt (gsi
);
1500 if (maybe_clean_or_replace_eh_stmt (orig_stmt
, stmt
))
1501 gimple_purge_dead_eh_edges (gimple_bb (stmt
));
1507 gcc_checking_assert (has_zero_uses (name
));
1509 /* Also update the trees stored in loop structures. */
1515 FOR_EACH_LOOP (li
, loop
, 0)
1517 substitute_in_loop_info (loop
, name
, val
);
1522 /* Merge block B into block A. */
1525 gimple_merge_blocks (basic_block a
, basic_block b
)
1527 gimple_stmt_iterator last
, gsi
, psi
;
1530 fprintf (dump_file
, "Merging blocks %d and %d\n", a
->index
, b
->index
);
1532 /* Remove all single-valued PHI nodes from block B of the form
1533 V_i = PHI <V_j> by propagating V_j to all the uses of V_i. */
1534 gsi
= gsi_last_bb (a
);
1535 for (psi
= gsi_start_phis (b
); !gsi_end_p (psi
); )
1537 gimple phi
= gsi_stmt (psi
);
1538 tree def
= gimple_phi_result (phi
), use
= gimple_phi_arg_def (phi
, 0);
1540 bool may_replace_uses
= (virtual_operand_p (def
)
1541 || may_propagate_copy (def
, use
));
1543 /* In case we maintain loop closed ssa form, do not propagate arguments
1544 of loop exit phi nodes. */
1546 && loops_state_satisfies_p (LOOP_CLOSED_SSA
)
1547 && !virtual_operand_p (def
)
1548 && TREE_CODE (use
) == SSA_NAME
1549 && a
->loop_father
!= b
->loop_father
)
1550 may_replace_uses
= false;
1552 if (!may_replace_uses
)
1554 gcc_assert (!virtual_operand_p (def
));
1556 /* Note that just emitting the copies is fine -- there is no problem
1557 with ordering of phi nodes. This is because A is the single
1558 predecessor of B, therefore results of the phi nodes cannot
1559 appear as arguments of the phi nodes. */
1560 copy
= gimple_build_assign (def
, use
);
1561 gsi_insert_after (&gsi
, copy
, GSI_NEW_STMT
);
1562 remove_phi_node (&psi
, false);
1566 /* If we deal with a PHI for virtual operands, we can simply
1567 propagate these without fussing with folding or updating
1569 if (virtual_operand_p (def
))
1571 imm_use_iterator iter
;
1572 use_operand_p use_p
;
1575 FOR_EACH_IMM_USE_STMT (stmt
, iter
, def
)
1576 FOR_EACH_IMM_USE_ON_STMT (use_p
, iter
)
1577 SET_USE (use_p
, use
);
1579 if (SSA_NAME_OCCURS_IN_ABNORMAL_PHI (def
))
1580 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (use
) = 1;
1583 replace_uses_by (def
, use
);
1585 remove_phi_node (&psi
, true);
1589 /* Ensure that B follows A. */
1590 move_block_after (b
, a
);
1592 gcc_assert (single_succ_edge (a
)->flags
& EDGE_FALLTHRU
);
1593 gcc_assert (!last_stmt (a
) || !stmt_ends_bb_p (last_stmt (a
)));
1595 /* Remove labels from B and set gimple_bb to A for other statements. */
1596 for (gsi
= gsi_start_bb (b
); !gsi_end_p (gsi
);)
1598 gimple stmt
= gsi_stmt (gsi
);
1599 if (gimple_code (stmt
) == GIMPLE_LABEL
)
1601 tree label
= gimple_label_label (stmt
);
1604 gsi_remove (&gsi
, false);
1606 /* Now that we can thread computed gotos, we might have
1607 a situation where we have a forced label in block B
1608 However, the label at the start of block B might still be
1609 used in other ways (think about the runtime checking for
1610 Fortran assigned gotos). So we can not just delete the
1611 label. Instead we move the label to the start of block A. */
1612 if (FORCED_LABEL (label
))
1614 gimple_stmt_iterator dest_gsi
= gsi_start_bb (a
);
1615 gsi_insert_before (&dest_gsi
, stmt
, GSI_NEW_STMT
);
1617 /* Other user labels keep around in a form of a debug stmt. */
1618 else if (!DECL_ARTIFICIAL (label
) && MAY_HAVE_DEBUG_STMTS
)
1620 gimple dbg
= gimple_build_debug_bind (label
,
1623 gimple_debug_bind_reset_value (dbg
);
1624 gsi_insert_before (&gsi
, dbg
, GSI_SAME_STMT
);
1627 lp_nr
= EH_LANDING_PAD_NR (label
);
1630 eh_landing_pad lp
= get_eh_landing_pad_from_number (lp_nr
);
1631 lp
->post_landing_pad
= NULL
;
1636 gimple_set_bb (stmt
, a
);
1641 /* Merge the sequences. */
1642 last
= gsi_last_bb (a
);
1643 gsi_insert_seq_after (&last
, bb_seq (b
), GSI_NEW_STMT
);
1644 set_bb_seq (b
, NULL
);
1646 if (cfgcleanup_altered_bbs
)
1647 bitmap_set_bit (cfgcleanup_altered_bbs
, a
->index
);
1651 /* Return the one of two successors of BB that is not reachable by a
1652 complex edge, if there is one. Else, return BB. We use
1653 this in optimizations that use post-dominators for their heuristics,
1654 to catch the cases in C++ where function calls are involved. */
1657 single_noncomplex_succ (basic_block bb
)
1660 if (EDGE_COUNT (bb
->succs
) != 2)
1663 e0
= EDGE_SUCC (bb
, 0);
1664 e1
= EDGE_SUCC (bb
, 1);
1665 if (e0
->flags
& EDGE_COMPLEX
)
1667 if (e1
->flags
& EDGE_COMPLEX
)
1673 /* T is CALL_EXPR. Set current_function_calls_* flags. */
1676 notice_special_calls (gimple call
)
1678 int flags
= gimple_call_flags (call
);
1680 if (flags
& ECF_MAY_BE_ALLOCA
)
1681 cfun
->calls_alloca
= true;
1682 if (flags
& ECF_RETURNS_TWICE
)
1683 cfun
->calls_setjmp
= true;
1687 /* Clear flags set by notice_special_calls. Used by dead code removal
1688 to update the flags. */
1691 clear_special_calls (void)
1693 cfun
->calls_alloca
= false;
1694 cfun
->calls_setjmp
= false;
1697 /* Remove PHI nodes associated with basic block BB and all edges out of BB. */
1700 remove_phi_nodes_and_edges_for_unreachable_block (basic_block bb
)
1702 /* Since this block is no longer reachable, we can just delete all
1703 of its PHI nodes. */
1704 remove_phi_nodes (bb
);
1706 /* Remove edges to BB's successors. */
1707 while (EDGE_COUNT (bb
->succs
) > 0)
1708 remove_edge (EDGE_SUCC (bb
, 0));
1712 /* Remove statements of basic block BB. */
1715 remove_bb (basic_block bb
)
1717 gimple_stmt_iterator i
;
1721 fprintf (dump_file
, "Removing basic block %d\n", bb
->index
);
1722 if (dump_flags
& TDF_DETAILS
)
1724 dump_bb (dump_file
, bb
, 0, dump_flags
);
1725 fprintf (dump_file
, "\n");
1731 struct loop
*loop
= bb
->loop_father
;
1733 /* If a loop gets removed, clean up the information associated
1735 if (loop
->latch
== bb
1736 || loop
->header
== bb
)
1737 free_numbers_of_iterations_estimates_loop (loop
);
1740 /* Remove all the instructions in the block. */
1741 if (bb_seq (bb
) != NULL
)
1743 /* Walk backwards so as to get a chance to substitute all
1744 released DEFs into debug stmts. See
1745 eliminate_unnecessary_stmts() in tree-ssa-dce.c for more
1747 for (i
= gsi_last_bb (bb
); !gsi_end_p (i
);)
1749 gimple stmt
= gsi_stmt (i
);
1750 if (gimple_code (stmt
) == GIMPLE_LABEL
1751 && (FORCED_LABEL (gimple_label_label (stmt
))
1752 || DECL_NONLOCAL (gimple_label_label (stmt
))))
1755 gimple_stmt_iterator new_gsi
;
1757 /* A non-reachable non-local label may still be referenced.
1758 But it no longer needs to carry the extra semantics of
1760 if (DECL_NONLOCAL (gimple_label_label (stmt
)))
1762 DECL_NONLOCAL (gimple_label_label (stmt
)) = 0;
1763 FORCED_LABEL (gimple_label_label (stmt
)) = 1;
1766 new_bb
= bb
->prev_bb
;
1767 new_gsi
= gsi_start_bb (new_bb
);
1768 gsi_remove (&i
, false);
1769 gsi_insert_before (&new_gsi
, stmt
, GSI_NEW_STMT
);
1773 /* Release SSA definitions if we are in SSA. Note that we
1774 may be called when not in SSA. For example,
1775 final_cleanup calls this function via
1776 cleanup_tree_cfg. */
1777 if (gimple_in_ssa_p (cfun
))
1778 release_defs (stmt
);
1780 gsi_remove (&i
, true);
1784 i
= gsi_last_bb (bb
);
1790 remove_phi_nodes_and_edges_for_unreachable_block (bb
);
1791 bb
->il
.gimple
.seq
= NULL
;
1792 bb
->il
.gimple
.phi_nodes
= NULL
;
1796 /* Given a basic block BB ending with COND_EXPR or SWITCH_EXPR, and a
1797 predicate VAL, return the edge that will be taken out of the block.
1798 If VAL does not match a unique edge, NULL is returned. */
1801 find_taken_edge (basic_block bb
, tree val
)
1805 stmt
= last_stmt (bb
);
1808 gcc_assert (is_ctrl_stmt (stmt
));
1813 if (!is_gimple_min_invariant (val
))
1816 if (gimple_code (stmt
) == GIMPLE_COND
)
1817 return find_taken_edge_cond_expr (bb
, val
);
1819 if (gimple_code (stmt
) == GIMPLE_SWITCH
)
1820 return find_taken_edge_switch_expr (bb
, val
);
1822 if (computed_goto_p (stmt
))
1824 /* Only optimize if the argument is a label, if the argument is
1825 not a label then we can not construct a proper CFG.
1827 It may be the case that we only need to allow the LABEL_REF to
1828 appear inside an ADDR_EXPR, but we also allow the LABEL_REF to
1829 appear inside a LABEL_EXPR just to be safe. */
1830 if ((TREE_CODE (val
) == ADDR_EXPR
|| TREE_CODE (val
) == LABEL_EXPR
)
1831 && TREE_CODE (TREE_OPERAND (val
, 0)) == LABEL_DECL
)
1832 return find_taken_edge_computed_goto (bb
, TREE_OPERAND (val
, 0));
1839 /* Given a constant value VAL and the entry block BB to a GOTO_EXPR
1840 statement, determine which of the outgoing edges will be taken out of the
1841 block. Return NULL if either edge may be taken. */
1844 find_taken_edge_computed_goto (basic_block bb
, tree val
)
1849 dest
= label_to_block (val
);
1852 e
= find_edge (bb
, dest
);
1853 gcc_assert (e
!= NULL
);
1859 /* Given a constant value VAL and the entry block BB to a COND_EXPR
1860 statement, determine which of the two edges will be taken out of the
1861 block. Return NULL if either edge may be taken. */
1864 find_taken_edge_cond_expr (basic_block bb
, tree val
)
1866 edge true_edge
, false_edge
;
1868 extract_true_false_edges_from_block (bb
, &true_edge
, &false_edge
);
1870 gcc_assert (TREE_CODE (val
) == INTEGER_CST
);
1871 return (integer_zerop (val
) ? false_edge
: true_edge
);
1874 /* Given an INTEGER_CST VAL and the entry block BB to a SWITCH_EXPR
1875 statement, determine which edge will be taken out of the block. Return
1876 NULL if any edge may be taken. */
1879 find_taken_edge_switch_expr (basic_block bb
, tree val
)
1881 basic_block dest_bb
;
1886 switch_stmt
= last_stmt (bb
);
1887 taken_case
= find_case_label_for_value (switch_stmt
, val
);
1888 dest_bb
= label_to_block (CASE_LABEL (taken_case
));
1890 e
= find_edge (bb
, dest_bb
);
1896 /* Return the CASE_LABEL_EXPR that SWITCH_STMT will take for VAL.
1897 We can make optimal use here of the fact that the case labels are
1898 sorted: We can do a binary search for a case matching VAL. */
1901 find_case_label_for_value (gimple switch_stmt
, tree val
)
1903 size_t low
, high
, n
= gimple_switch_num_labels (switch_stmt
);
1904 tree default_case
= gimple_switch_default_label (switch_stmt
);
1906 for (low
= 0, high
= n
; high
- low
> 1; )
1908 size_t i
= (high
+ low
) / 2;
1909 tree t
= gimple_switch_label (switch_stmt
, i
);
1912 /* Cache the result of comparing CASE_LOW and val. */
1913 cmp
= tree_int_cst_compare (CASE_LOW (t
), val
);
1920 if (CASE_HIGH (t
) == NULL
)
1922 /* A singe-valued case label. */
1928 /* A case range. We can only handle integer ranges. */
1929 if (cmp
<= 0 && tree_int_cst_compare (CASE_HIGH (t
), val
) >= 0)
1934 return default_case
;
1938 /* Dump a basic block on stderr. */
1941 gimple_debug_bb (basic_block bb
)
1943 dump_bb (stderr
, bb
, 0, TDF_VOPS
|TDF_MEMSYMS
|TDF_BLOCKS
);
1947 /* Dump basic block with index N on stderr. */
1950 gimple_debug_bb_n (int n
)
1952 gimple_debug_bb (BASIC_BLOCK (n
));
1953 return BASIC_BLOCK (n
);
1957 /* Dump the CFG on stderr.
1959 FLAGS are the same used by the tree dumping functions
1960 (see TDF_* in dumpfile.h). */
1963 gimple_debug_cfg (int flags
)
1965 gimple_dump_cfg (stderr
, flags
);
1969 /* Dump the program showing basic block boundaries on the given FILE.
1971 FLAGS are the same used by the tree dumping functions (see TDF_* in
1975 gimple_dump_cfg (FILE *file
, int flags
)
1977 if (flags
& TDF_DETAILS
)
1979 dump_function_header (file
, current_function_decl
, flags
);
1980 fprintf (file
, ";; \n%d basic blocks, %d edges, last basic block %d.\n\n",
1981 n_basic_blocks
, n_edges
, last_basic_block
);
1983 brief_dump_cfg (file
, flags
| TDF_COMMENT
);
1984 fprintf (file
, "\n");
1987 if (flags
& TDF_STATS
)
1988 dump_cfg_stats (file
);
1990 dump_function_to_file (current_function_decl
, file
, flags
| TDF_BLOCKS
);
1994 /* Dump CFG statistics on FILE. */
1997 dump_cfg_stats (FILE *file
)
1999 static long max_num_merged_labels
= 0;
2000 unsigned long size
, total
= 0;
2003 const char * const fmt_str
= "%-30s%-13s%12s\n";
2004 const char * const fmt_str_1
= "%-30s%13d%11lu%c\n";
2005 const char * const fmt_str_2
= "%-30s%13ld%11lu%c\n";
2006 const char * const fmt_str_3
= "%-43s%11lu%c\n";
2007 const char *funcname
= current_function_name ();
2009 fprintf (file
, "\nCFG Statistics for %s\n\n", funcname
);
2011 fprintf (file
, "---------------------------------------------------------\n");
2012 fprintf (file
, fmt_str
, "", " Number of ", "Memory");
2013 fprintf (file
, fmt_str
, "", " instances ", "used ");
2014 fprintf (file
, "---------------------------------------------------------\n");
2016 size
= n_basic_blocks
* sizeof (struct basic_block_def
);
2018 fprintf (file
, fmt_str_1
, "Basic blocks", n_basic_blocks
,
2019 SCALE (size
), LABEL (size
));
2023 num_edges
+= EDGE_COUNT (bb
->succs
);
2024 size
= num_edges
* sizeof (struct edge_def
);
2026 fprintf (file
, fmt_str_2
, "Edges", num_edges
, SCALE (size
), LABEL (size
));
2028 fprintf (file
, "---------------------------------------------------------\n");
2029 fprintf (file
, fmt_str_3
, "Total memory used by CFG data", SCALE (total
),
2031 fprintf (file
, "---------------------------------------------------------\n");
2032 fprintf (file
, "\n");
2034 if (cfg_stats
.num_merged_labels
> max_num_merged_labels
)
2035 max_num_merged_labels
= cfg_stats
.num_merged_labels
;
2037 fprintf (file
, "Coalesced label blocks: %ld (Max so far: %ld)\n",
2038 cfg_stats
.num_merged_labels
, max_num_merged_labels
);
2040 fprintf (file
, "\n");
2044 /* Dump CFG statistics on stderr. Keep extern so that it's always
2045 linked in the final executable. */
2048 debug_cfg_stats (void)
2050 dump_cfg_stats (stderr
);
2053 /*---------------------------------------------------------------------------
2054 Miscellaneous helpers
2055 ---------------------------------------------------------------------------*/
2057 /* Return true if T, a GIMPLE_CALL, can make an abnormal transfer of control
2058 flow. Transfers of control flow associated with EH are excluded. */
2061 call_can_make_abnormal_goto (gimple t
)
2063 /* If the function has no non-local labels, then a call cannot make an
2064 abnormal transfer of control. */
2065 if (!cfun
->has_nonlocal_label
2066 && !cfun
->calls_setjmp
)
2069 /* Likewise if the call has no side effects. */
2070 if (!gimple_has_side_effects (t
))
2073 /* Likewise if the called function is leaf. */
2074 if (gimple_call_flags (t
) & ECF_LEAF
)
2081 /* Return true if T can make an abnormal transfer of control flow.
2082 Transfers of control flow associated with EH are excluded. */
2085 stmt_can_make_abnormal_goto (gimple t
)
2087 if (computed_goto_p (t
))
2089 if (is_gimple_call (t
))
2090 return call_can_make_abnormal_goto (t
);
2095 /* Return true if T represents a stmt that always transfers control. */
2098 is_ctrl_stmt (gimple t
)
2100 switch (gimple_code (t
))
2114 /* Return true if T is a statement that may alter the flow of control
2115 (e.g., a call to a non-returning function). */
2118 is_ctrl_altering_stmt (gimple t
)
2122 switch (gimple_code (t
))
2126 int flags
= gimple_call_flags (t
);
2128 /* A call alters control flow if it can make an abnormal goto. */
2129 if (call_can_make_abnormal_goto (t
))
2132 /* A call also alters control flow if it does not return. */
2133 if (flags
& ECF_NORETURN
)
2136 /* TM ending statements have backedges out of the transaction.
2137 Return true so we split the basic block containing them.
2138 Note that the TM_BUILTIN test is merely an optimization. */
2139 if ((flags
& ECF_TM_BUILTIN
)
2140 && is_tm_ending_fndecl (gimple_call_fndecl (t
)))
2143 /* BUILT_IN_RETURN call is same as return statement. */
2144 if (gimple_call_builtin_p (t
, BUILT_IN_RETURN
))
2149 case GIMPLE_EH_DISPATCH
:
2150 /* EH_DISPATCH branches to the individual catch handlers at
2151 this level of a try or allowed-exceptions region. It can
2152 fallthru to the next statement as well. */
2156 if (gimple_asm_nlabels (t
) > 0)
2161 /* OpenMP directives alter control flow. */
2164 case GIMPLE_TRANSACTION
:
2165 /* A transaction start alters control flow. */
2172 /* If a statement can throw, it alters control flow. */
2173 return stmt_can_throw_internal (t
);
2177 /* Return true if T is a simple local goto. */
2180 simple_goto_p (gimple t
)
2182 return (gimple_code (t
) == GIMPLE_GOTO
2183 && TREE_CODE (gimple_goto_dest (t
)) == LABEL_DECL
);
2187 /* Return true if STMT should start a new basic block. PREV_STMT is
2188 the statement preceding STMT. It is used when STMT is a label or a
2189 case label. Labels should only start a new basic block if their
2190 previous statement wasn't a label. Otherwise, sequence of labels
2191 would generate unnecessary basic blocks that only contain a single
2195 stmt_starts_bb_p (gimple stmt
, gimple prev_stmt
)
2200 /* Labels start a new basic block only if the preceding statement
2201 wasn't a label of the same type. This prevents the creation of
2202 consecutive blocks that have nothing but a single label. */
2203 if (gimple_code (stmt
) == GIMPLE_LABEL
)
2205 /* Nonlocal and computed GOTO targets always start a new block. */
2206 if (DECL_NONLOCAL (gimple_label_label (stmt
))
2207 || FORCED_LABEL (gimple_label_label (stmt
)))
2210 if (prev_stmt
&& gimple_code (prev_stmt
) == GIMPLE_LABEL
)
2212 if (DECL_NONLOCAL (gimple_label_label (prev_stmt
)))
2215 cfg_stats
.num_merged_labels
++;
2221 else if (gimple_code (stmt
) == GIMPLE_CALL
2222 && gimple_call_flags (stmt
) & ECF_RETURNS_TWICE
)
2223 /* setjmp acts similar to a nonlocal GOTO target and thus should
2224 start a new block. */
2231 /* Return true if T should end a basic block. */
2234 stmt_ends_bb_p (gimple t
)
2236 return is_ctrl_stmt (t
) || is_ctrl_altering_stmt (t
);
2239 /* Remove block annotations and other data structures. */
2242 delete_tree_cfg_annotations (void)
2244 vec_free (label_to_block_map
);
2248 /* Return the first statement in basic block BB. */
2251 first_stmt (basic_block bb
)
2253 gimple_stmt_iterator i
= gsi_start_bb (bb
);
2256 while (!gsi_end_p (i
) && is_gimple_debug ((stmt
= gsi_stmt (i
))))
2264 /* Return the first non-label statement in basic block BB. */
2267 first_non_label_stmt (basic_block bb
)
2269 gimple_stmt_iterator i
= gsi_start_bb (bb
);
2270 while (!gsi_end_p (i
) && gimple_code (gsi_stmt (i
)) == GIMPLE_LABEL
)
2272 return !gsi_end_p (i
) ? gsi_stmt (i
) : NULL
;
2275 /* Return the last statement in basic block BB. */
2278 last_stmt (basic_block bb
)
2280 gimple_stmt_iterator i
= gsi_last_bb (bb
);
2283 while (!gsi_end_p (i
) && is_gimple_debug ((stmt
= gsi_stmt (i
))))
2291 /* Return the last statement of an otherwise empty block. Return NULL
2292 if the block is totally empty, or if it contains more than one
2296 last_and_only_stmt (basic_block bb
)
2298 gimple_stmt_iterator i
= gsi_last_nondebug_bb (bb
);
2304 last
= gsi_stmt (i
);
2305 gsi_prev_nondebug (&i
);
2309 /* Empty statements should no longer appear in the instruction stream.
2310 Everything that might have appeared before should be deleted by
2311 remove_useless_stmts, and the optimizers should just gsi_remove
2312 instead of smashing with build_empty_stmt.
2314 Thus the only thing that should appear here in a block containing
2315 one executable statement is a label. */
2316 prev
= gsi_stmt (i
);
2317 if (gimple_code (prev
) == GIMPLE_LABEL
)
2323 /* Reinstall those PHI arguments queued in OLD_EDGE to NEW_EDGE. */
2326 reinstall_phi_args (edge new_edge
, edge old_edge
)
2328 edge_var_map_vector
*v
;
2331 gimple_stmt_iterator phis
;
2333 v
= redirect_edge_var_map_vector (old_edge
);
2337 for (i
= 0, phis
= gsi_start_phis (new_edge
->dest
);
2338 v
->iterate (i
, &vm
) && !gsi_end_p (phis
);
2339 i
++, gsi_next (&phis
))
2341 gimple phi
= gsi_stmt (phis
);
2342 tree result
= redirect_edge_var_map_result (vm
);
2343 tree arg
= redirect_edge_var_map_def (vm
);
2345 gcc_assert (result
== gimple_phi_result (phi
));
2347 add_phi_arg (phi
, arg
, new_edge
, redirect_edge_var_map_location (vm
));
2350 redirect_edge_var_map_clear (old_edge
);
2353 /* Returns the basic block after which the new basic block created
2354 by splitting edge EDGE_IN should be placed. Tries to keep the new block
2355 near its "logical" location. This is of most help to humans looking
2356 at debugging dumps. */
2359 split_edge_bb_loc (edge edge_in
)
2361 basic_block dest
= edge_in
->dest
;
2362 basic_block dest_prev
= dest
->prev_bb
;
2366 edge e
= find_edge (dest_prev
, dest
);
2367 if (e
&& !(e
->flags
& EDGE_COMPLEX
))
2368 return edge_in
->src
;
2373 /* Split a (typically critical) edge EDGE_IN. Return the new block.
2374 Abort on abnormal edges. */
2377 gimple_split_edge (edge edge_in
)
2379 basic_block new_bb
, after_bb
, dest
;
2382 /* Abnormal edges cannot be split. */
2383 gcc_assert (!(edge_in
->flags
& EDGE_ABNORMAL
));
2385 dest
= edge_in
->dest
;
2387 after_bb
= split_edge_bb_loc (edge_in
);
2389 new_bb
= create_empty_bb (after_bb
);
2390 new_bb
->frequency
= EDGE_FREQUENCY (edge_in
);
2391 new_bb
->count
= edge_in
->count
;
2392 new_edge
= make_edge (new_bb
, dest
, EDGE_FALLTHRU
);
2393 new_edge
->probability
= REG_BR_PROB_BASE
;
2394 new_edge
->count
= edge_in
->count
;
2396 e
= redirect_edge_and_branch (edge_in
, new_bb
);
2397 gcc_assert (e
== edge_in
);
2398 reinstall_phi_args (new_edge
, e
);
2404 /* Verify properties of the address expression T with base object BASE. */
2407 verify_address (tree t
, tree base
)
2410 bool old_side_effects
;
2412 bool new_side_effects
;
2414 old_constant
= TREE_CONSTANT (t
);
2415 old_side_effects
= TREE_SIDE_EFFECTS (t
);
2417 recompute_tree_invariant_for_addr_expr (t
);
2418 new_side_effects
= TREE_SIDE_EFFECTS (t
);
2419 new_constant
= TREE_CONSTANT (t
);
2421 if (old_constant
!= new_constant
)
2423 error ("constant not recomputed when ADDR_EXPR changed");
2426 if (old_side_effects
!= new_side_effects
)
2428 error ("side effects not recomputed when ADDR_EXPR changed");
2432 if (!(TREE_CODE (base
) == VAR_DECL
2433 || TREE_CODE (base
) == PARM_DECL
2434 || TREE_CODE (base
) == RESULT_DECL
))
2437 if (DECL_GIMPLE_REG_P (base
))
2439 error ("DECL_GIMPLE_REG_P set on a variable with address taken");
2446 /* Callback for walk_tree, check that all elements with address taken are
2447 properly noticed as such. The DATA is an int* that is 1 if TP was seen
2448 inside a PHI node. */
2451 verify_expr (tree
*tp
, int *walk_subtrees
, void *data ATTRIBUTE_UNUSED
)
2458 /* Check operand N for being valid GIMPLE and give error MSG if not. */
2459 #define CHECK_OP(N, MSG) \
2460 do { if (!is_gimple_val (TREE_OPERAND (t, N))) \
2461 { error (MSG); return TREE_OPERAND (t, N); }} while (0)
2463 switch (TREE_CODE (t
))
2466 if (SSA_NAME_IN_FREE_LIST (t
))
2468 error ("SSA name in freelist but still referenced");
2474 error ("INDIRECT_REF in gimple IL");
2478 x
= TREE_OPERAND (t
, 0);
2479 if (!POINTER_TYPE_P (TREE_TYPE (x
))
2480 || !is_gimple_mem_ref_addr (x
))
2482 error ("invalid first operand of MEM_REF");
2485 if (TREE_CODE (TREE_OPERAND (t
, 1)) != INTEGER_CST
2486 || !POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (t
, 1))))
2488 error ("invalid offset operand of MEM_REF");
2489 return TREE_OPERAND (t
, 1);
2491 if (TREE_CODE (x
) == ADDR_EXPR
2492 && (x
= verify_address (x
, TREE_OPERAND (x
, 0))))
2498 x
= fold (ASSERT_EXPR_COND (t
));
2499 if (x
== boolean_false_node
)
2501 error ("ASSERT_EXPR with an always-false condition");
2507 error ("MODIFY_EXPR not expected while having tuples");
2514 gcc_assert (is_gimple_address (t
));
2516 /* Skip any references (they will be checked when we recurse down the
2517 tree) and ensure that any variable used as a prefix is marked
2519 for (x
= TREE_OPERAND (t
, 0);
2520 handled_component_p (x
);
2521 x
= TREE_OPERAND (x
, 0))
2524 if ((tem
= verify_address (t
, x
)))
2527 if (!(TREE_CODE (x
) == VAR_DECL
2528 || TREE_CODE (x
) == PARM_DECL
2529 || TREE_CODE (x
) == RESULT_DECL
))
2532 if (!TREE_ADDRESSABLE (x
))
2534 error ("address taken, but ADDRESSABLE bit not set");
2542 x
= COND_EXPR_COND (t
);
2543 if (!INTEGRAL_TYPE_P (TREE_TYPE (x
)))
2545 error ("non-integral used in condition");
2548 if (!is_gimple_condexpr (x
))
2550 error ("invalid conditional operand");
2555 case NON_LVALUE_EXPR
:
2556 case TRUTH_NOT_EXPR
:
2560 case FIX_TRUNC_EXPR
:
2565 CHECK_OP (0, "invalid operand to unary operator");
2571 if (!is_gimple_reg_type (TREE_TYPE (t
)))
2573 error ("non-scalar BIT_FIELD_REF, IMAGPART_EXPR or REALPART_EXPR");
2577 if (TREE_CODE (t
) == BIT_FIELD_REF
)
2579 if (!host_integerp (TREE_OPERAND (t
, 1), 1)
2580 || !host_integerp (TREE_OPERAND (t
, 2), 1))
2582 error ("invalid position or size operand to BIT_FIELD_REF");
2585 if (INTEGRAL_TYPE_P (TREE_TYPE (t
))
2586 && (TYPE_PRECISION (TREE_TYPE (t
))
2587 != TREE_INT_CST_LOW (TREE_OPERAND (t
, 1))))
2589 error ("integral result type precision does not match "
2590 "field size of BIT_FIELD_REF");
2593 else if (!INTEGRAL_TYPE_P (TREE_TYPE (t
))
2594 && TYPE_MODE (TREE_TYPE (t
)) != BLKmode
2595 && (GET_MODE_PRECISION (TYPE_MODE (TREE_TYPE (t
)))
2596 != TREE_INT_CST_LOW (TREE_OPERAND (t
, 1))))
2598 error ("mode precision of non-integral result does not "
2599 "match field size of BIT_FIELD_REF");
2603 t
= TREE_OPERAND (t
, 0);
2608 case ARRAY_RANGE_REF
:
2609 case VIEW_CONVERT_EXPR
:
2610 /* We have a nest of references. Verify that each of the operands
2611 that determine where to reference is either a constant or a variable,
2612 verify that the base is valid, and then show we've already checked
2614 while (handled_component_p (t
))
2616 if (TREE_CODE (t
) == COMPONENT_REF
&& TREE_OPERAND (t
, 2))
2617 CHECK_OP (2, "invalid COMPONENT_REF offset operator");
2618 else if (TREE_CODE (t
) == ARRAY_REF
2619 || TREE_CODE (t
) == ARRAY_RANGE_REF
)
2621 CHECK_OP (1, "invalid array index");
2622 if (TREE_OPERAND (t
, 2))
2623 CHECK_OP (2, "invalid array lower bound");
2624 if (TREE_OPERAND (t
, 3))
2625 CHECK_OP (3, "invalid array stride");
2627 else if (TREE_CODE (t
) == BIT_FIELD_REF
2628 || TREE_CODE (t
) == REALPART_EXPR
2629 || TREE_CODE (t
) == IMAGPART_EXPR
)
2631 error ("non-top-level BIT_FIELD_REF, IMAGPART_EXPR or "
2636 t
= TREE_OPERAND (t
, 0);
2639 if (!is_gimple_min_invariant (t
) && !is_gimple_lvalue (t
))
2641 error ("invalid reference prefix");
2648 /* PLUS_EXPR and MINUS_EXPR don't work on pointers, they should be done using
2649 POINTER_PLUS_EXPR. */
2650 if (POINTER_TYPE_P (TREE_TYPE (t
)))
2652 error ("invalid operand to plus/minus, type is a pointer");
2655 CHECK_OP (0, "invalid operand to binary operator");
2656 CHECK_OP (1, "invalid operand to binary operator");
2659 case POINTER_PLUS_EXPR
:
2660 /* Check to make sure the first operand is a pointer or reference type. */
2661 if (!POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (t
, 0))))
2663 error ("invalid operand to pointer plus, first operand is not a pointer");
2666 /* Check to make sure the second operand is a ptrofftype. */
2667 if (!ptrofftype_p (TREE_TYPE (TREE_OPERAND (t
, 1))))
2669 error ("invalid operand to pointer plus, second operand is not an "
2670 "integer type of appropriate width");
2680 case UNORDERED_EXPR
:
2689 case TRUNC_DIV_EXPR
:
2691 case FLOOR_DIV_EXPR
:
2692 case ROUND_DIV_EXPR
:
2693 case TRUNC_MOD_EXPR
:
2695 case FLOOR_MOD_EXPR
:
2696 case ROUND_MOD_EXPR
:
2698 case EXACT_DIV_EXPR
:
2708 CHECK_OP (0, "invalid operand to binary operator");
2709 CHECK_OP (1, "invalid operand to binary operator");
2713 if (TREE_CONSTANT (t
) && TREE_CODE (TREE_TYPE (t
)) == VECTOR_TYPE
)
2717 case CASE_LABEL_EXPR
:
2720 error ("invalid CASE_CHAIN");
2734 /* Verify if EXPR is either a GIMPLE ID or a GIMPLE indirect reference.
2735 Returns true if there is an error, otherwise false. */
2738 verify_types_in_gimple_min_lval (tree expr
)
2742 if (is_gimple_id (expr
))
2745 if (TREE_CODE (expr
) != TARGET_MEM_REF
2746 && TREE_CODE (expr
) != MEM_REF
)
2748 error ("invalid expression for min lvalue");
2752 /* TARGET_MEM_REFs are strange beasts. */
2753 if (TREE_CODE (expr
) == TARGET_MEM_REF
)
2756 op
= TREE_OPERAND (expr
, 0);
2757 if (!is_gimple_val (op
))
2759 error ("invalid operand in indirect reference");
2760 debug_generic_stmt (op
);
2763 /* Memory references now generally can involve a value conversion. */
2768 /* Verify if EXPR is a valid GIMPLE reference expression. If
2769 REQUIRE_LVALUE is true verifies it is an lvalue. Returns true
2770 if there is an error, otherwise false. */
2773 verify_types_in_gimple_reference (tree expr
, bool require_lvalue
)
2775 while (handled_component_p (expr
))
2777 tree op
= TREE_OPERAND (expr
, 0);
2779 if (TREE_CODE (expr
) == ARRAY_REF
2780 || TREE_CODE (expr
) == ARRAY_RANGE_REF
)
2782 if (!is_gimple_val (TREE_OPERAND (expr
, 1))
2783 || (TREE_OPERAND (expr
, 2)
2784 && !is_gimple_val (TREE_OPERAND (expr
, 2)))
2785 || (TREE_OPERAND (expr
, 3)
2786 && !is_gimple_val (TREE_OPERAND (expr
, 3))))
2788 error ("invalid operands to array reference");
2789 debug_generic_stmt (expr
);
2794 /* Verify if the reference array element types are compatible. */
2795 if (TREE_CODE (expr
) == ARRAY_REF
2796 && !useless_type_conversion_p (TREE_TYPE (expr
),
2797 TREE_TYPE (TREE_TYPE (op
))))
2799 error ("type mismatch in array reference");
2800 debug_generic_stmt (TREE_TYPE (expr
));
2801 debug_generic_stmt (TREE_TYPE (TREE_TYPE (op
)));
2804 if (TREE_CODE (expr
) == ARRAY_RANGE_REF
2805 && !useless_type_conversion_p (TREE_TYPE (TREE_TYPE (expr
)),
2806 TREE_TYPE (TREE_TYPE (op
))))
2808 error ("type mismatch in array range reference");
2809 debug_generic_stmt (TREE_TYPE (TREE_TYPE (expr
)));
2810 debug_generic_stmt (TREE_TYPE (TREE_TYPE (op
)));
2814 if ((TREE_CODE (expr
) == REALPART_EXPR
2815 || TREE_CODE (expr
) == IMAGPART_EXPR
)
2816 && !useless_type_conversion_p (TREE_TYPE (expr
),
2817 TREE_TYPE (TREE_TYPE (op
))))
2819 error ("type mismatch in real/imagpart reference");
2820 debug_generic_stmt (TREE_TYPE (expr
));
2821 debug_generic_stmt (TREE_TYPE (TREE_TYPE (op
)));
2825 if (TREE_CODE (expr
) == COMPONENT_REF
2826 && !useless_type_conversion_p (TREE_TYPE (expr
),
2827 TREE_TYPE (TREE_OPERAND (expr
, 1))))
2829 error ("type mismatch in component reference");
2830 debug_generic_stmt (TREE_TYPE (expr
));
2831 debug_generic_stmt (TREE_TYPE (TREE_OPERAND (expr
, 1)));
2835 if (TREE_CODE (expr
) == VIEW_CONVERT_EXPR
)
2837 /* For VIEW_CONVERT_EXPRs which are allowed here too, we only check
2838 that their operand is not an SSA name or an invariant when
2839 requiring an lvalue (this usually means there is a SRA or IPA-SRA
2840 bug). Otherwise there is nothing to verify, gross mismatches at
2841 most invoke undefined behavior. */
2843 && (TREE_CODE (op
) == SSA_NAME
2844 || is_gimple_min_invariant (op
)))
2846 error ("conversion of an SSA_NAME on the left hand side");
2847 debug_generic_stmt (expr
);
2850 else if (TREE_CODE (op
) == SSA_NAME
2851 && TYPE_SIZE (TREE_TYPE (expr
)) != TYPE_SIZE (TREE_TYPE (op
)))
2853 error ("conversion of register to a different size");
2854 debug_generic_stmt (expr
);
2857 else if (!handled_component_p (op
))
2864 if (TREE_CODE (expr
) == MEM_REF
)
2866 if (!is_gimple_mem_ref_addr (TREE_OPERAND (expr
, 0)))
2868 error ("invalid address operand in MEM_REF");
2869 debug_generic_stmt (expr
);
2872 if (TREE_CODE (TREE_OPERAND (expr
, 1)) != INTEGER_CST
2873 || !POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (expr
, 1))))
2875 error ("invalid offset operand in MEM_REF");
2876 debug_generic_stmt (expr
);
2880 else if (TREE_CODE (expr
) == TARGET_MEM_REF
)
2882 if (!TMR_BASE (expr
)
2883 || !is_gimple_mem_ref_addr (TMR_BASE (expr
)))
2885 error ("invalid address operand in TARGET_MEM_REF");
2888 if (!TMR_OFFSET (expr
)
2889 || TREE_CODE (TMR_OFFSET (expr
)) != INTEGER_CST
2890 || !POINTER_TYPE_P (TREE_TYPE (TMR_OFFSET (expr
))))
2892 error ("invalid offset operand in TARGET_MEM_REF");
2893 debug_generic_stmt (expr
);
2898 return ((require_lvalue
|| !is_gimple_min_invariant (expr
))
2899 && verify_types_in_gimple_min_lval (expr
));
2902 /* Returns true if there is one pointer type in TYPE_POINTER_TO (SRC_OBJ)
2903 list of pointer-to types that is trivially convertible to DEST. */
2906 one_pointer_to_useless_type_conversion_p (tree dest
, tree src_obj
)
2910 if (!TYPE_POINTER_TO (src_obj
))
2913 for (src
= TYPE_POINTER_TO (src_obj
); src
; src
= TYPE_NEXT_PTR_TO (src
))
2914 if (useless_type_conversion_p (dest
, src
))
2920 /* Return true if TYPE1 is a fixed-point type and if conversions to and
2921 from TYPE2 can be handled by FIXED_CONVERT_EXPR. */
2924 valid_fixed_convert_types_p (tree type1
, tree type2
)
2926 return (FIXED_POINT_TYPE_P (type1
)
2927 && (INTEGRAL_TYPE_P (type2
)
2928 || SCALAR_FLOAT_TYPE_P (type2
)
2929 || FIXED_POINT_TYPE_P (type2
)));
2932 /* Verify the contents of a GIMPLE_CALL STMT. Returns true when there
2933 is a problem, otherwise false. */
2936 verify_gimple_call (gimple stmt
)
2938 tree fn
= gimple_call_fn (stmt
);
2939 tree fntype
, fndecl
;
2942 if (gimple_call_internal_p (stmt
))
2946 error ("gimple call has two targets");
2947 debug_generic_stmt (fn
);
2955 error ("gimple call has no target");
2960 if (fn
&& !is_gimple_call_addr (fn
))
2962 error ("invalid function in gimple call");
2963 debug_generic_stmt (fn
);
2968 && (!POINTER_TYPE_P (TREE_TYPE (fn
))
2969 || (TREE_CODE (TREE_TYPE (TREE_TYPE (fn
))) != FUNCTION_TYPE
2970 && TREE_CODE (TREE_TYPE (TREE_TYPE (fn
))) != METHOD_TYPE
)))
2972 error ("non-function in gimple call");
2976 fndecl
= gimple_call_fndecl (stmt
);
2978 && TREE_CODE (fndecl
) == FUNCTION_DECL
2979 && DECL_LOOPING_CONST_OR_PURE_P (fndecl
)
2980 && !DECL_PURE_P (fndecl
)
2981 && !TREE_READONLY (fndecl
))
2983 error ("invalid pure const state for function");
2987 if (gimple_call_lhs (stmt
)
2988 && (!is_gimple_lvalue (gimple_call_lhs (stmt
))
2989 || verify_types_in_gimple_reference (gimple_call_lhs (stmt
), true)))
2991 error ("invalid LHS in gimple call");
2995 if (gimple_call_lhs (stmt
) && gimple_call_noreturn_p (stmt
))
2997 error ("LHS in noreturn call");
3001 fntype
= gimple_call_fntype (stmt
);
3003 && gimple_call_lhs (stmt
)
3004 && !useless_type_conversion_p (TREE_TYPE (gimple_call_lhs (stmt
)),
3006 /* ??? At least C++ misses conversions at assignments from
3007 void * call results.
3008 ??? Java is completely off. Especially with functions
3009 returning java.lang.Object.
3010 For now simply allow arbitrary pointer type conversions. */
3011 && !(POINTER_TYPE_P (TREE_TYPE (gimple_call_lhs (stmt
)))
3012 && POINTER_TYPE_P (TREE_TYPE (fntype
))))
3014 error ("invalid conversion in gimple call");
3015 debug_generic_stmt (TREE_TYPE (gimple_call_lhs (stmt
)));
3016 debug_generic_stmt (TREE_TYPE (fntype
));
3020 if (gimple_call_chain (stmt
)
3021 && !is_gimple_val (gimple_call_chain (stmt
)))
3023 error ("invalid static chain in gimple call");
3024 debug_generic_stmt (gimple_call_chain (stmt
));
3028 /* If there is a static chain argument, this should not be an indirect
3029 call, and the decl should have DECL_STATIC_CHAIN set. */
3030 if (gimple_call_chain (stmt
))
3032 if (!gimple_call_fndecl (stmt
))
3034 error ("static chain in indirect gimple call");
3037 fn
= TREE_OPERAND (fn
, 0);
3039 if (!DECL_STATIC_CHAIN (fn
))
3041 error ("static chain with function that doesn%'t use one");
3046 /* ??? The C frontend passes unpromoted arguments in case it
3047 didn't see a function declaration before the call. So for now
3048 leave the call arguments mostly unverified. Once we gimplify
3049 unit-at-a-time we have a chance to fix this. */
3051 for (i
= 0; i
< gimple_call_num_args (stmt
); ++i
)
3053 tree arg
= gimple_call_arg (stmt
, i
);
3054 if ((is_gimple_reg_type (TREE_TYPE (arg
))
3055 && !is_gimple_val (arg
))
3056 || (!is_gimple_reg_type (TREE_TYPE (arg
))
3057 && !is_gimple_lvalue (arg
)))
3059 error ("invalid argument to gimple call");
3060 debug_generic_expr (arg
);
3068 /* Verifies the gimple comparison with the result type TYPE and
3069 the operands OP0 and OP1. */
3072 verify_gimple_comparison (tree type
, tree op0
, tree op1
)
3074 tree op0_type
= TREE_TYPE (op0
);
3075 tree op1_type
= TREE_TYPE (op1
);
3077 if (!is_gimple_val (op0
) || !is_gimple_val (op1
))
3079 error ("invalid operands in gimple comparison");
3083 /* For comparisons we do not have the operations type as the
3084 effective type the comparison is carried out in. Instead
3085 we require that either the first operand is trivially
3086 convertible into the second, or the other way around.
3087 Because we special-case pointers to void we allow
3088 comparisons of pointers with the same mode as well. */
3089 if (!useless_type_conversion_p (op0_type
, op1_type
)
3090 && !useless_type_conversion_p (op1_type
, op0_type
)
3091 && (!POINTER_TYPE_P (op0_type
)
3092 || !POINTER_TYPE_P (op1_type
)
3093 || TYPE_MODE (op0_type
) != TYPE_MODE (op1_type
)))
3095 error ("mismatching comparison operand types");
3096 debug_generic_expr (op0_type
);
3097 debug_generic_expr (op1_type
);
3101 /* The resulting type of a comparison may be an effective boolean type. */
3102 if (INTEGRAL_TYPE_P (type
)
3103 && (TREE_CODE (type
) == BOOLEAN_TYPE
3104 || TYPE_PRECISION (type
) == 1))
3106 if (TREE_CODE (op0_type
) == VECTOR_TYPE
3107 || TREE_CODE (op1_type
) == VECTOR_TYPE
)
3109 error ("vector comparison returning a boolean");
3110 debug_generic_expr (op0_type
);
3111 debug_generic_expr (op1_type
);
3115 /* Or an integer vector type with the same size and element count
3116 as the comparison operand types. */
3117 else if (TREE_CODE (type
) == VECTOR_TYPE
3118 && TREE_CODE (TREE_TYPE (type
)) == INTEGER_TYPE
)
3120 if (TREE_CODE (op0_type
) != VECTOR_TYPE
3121 || TREE_CODE (op1_type
) != VECTOR_TYPE
)
3123 error ("non-vector operands in vector comparison");
3124 debug_generic_expr (op0_type
);
3125 debug_generic_expr (op1_type
);
3129 if (TYPE_VECTOR_SUBPARTS (type
) != TYPE_VECTOR_SUBPARTS (op0_type
)
3130 || (GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (type
)))
3131 != GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (op0_type
))))
3132 /* The result of a vector comparison is of signed
3134 || TYPE_UNSIGNED (TREE_TYPE (type
)))
3136 error ("invalid vector comparison resulting type");
3137 debug_generic_expr (type
);
3143 error ("bogus comparison result type");
3144 debug_generic_expr (type
);
3151 /* Verify a gimple assignment statement STMT with an unary rhs.
3152 Returns true if anything is wrong. */
3155 verify_gimple_assign_unary (gimple stmt
)
3157 enum tree_code rhs_code
= gimple_assign_rhs_code (stmt
);
3158 tree lhs
= gimple_assign_lhs (stmt
);
3159 tree lhs_type
= TREE_TYPE (lhs
);
3160 tree rhs1
= gimple_assign_rhs1 (stmt
);
3161 tree rhs1_type
= TREE_TYPE (rhs1
);
3163 if (!is_gimple_reg (lhs
))
3165 error ("non-register as LHS of unary operation");
3169 if (!is_gimple_val (rhs1
))
3171 error ("invalid operand in unary operation");
3175 /* First handle conversions. */
3180 /* Allow conversions from pointer type to integral type only if
3181 there is no sign or zero extension involved.
3182 For targets were the precision of ptrofftype doesn't match that
3183 of pointers we need to allow arbitrary conversions to ptrofftype. */
3184 if ((POINTER_TYPE_P (lhs_type
)
3185 && INTEGRAL_TYPE_P (rhs1_type
))
3186 || (POINTER_TYPE_P (rhs1_type
)
3187 && INTEGRAL_TYPE_P (lhs_type
)
3188 && (TYPE_PRECISION (rhs1_type
) >= TYPE_PRECISION (lhs_type
)
3189 || ptrofftype_p (sizetype
))))
3192 /* Allow conversion from integral to offset type and vice versa. */
3193 if ((TREE_CODE (lhs_type
) == OFFSET_TYPE
3194 && INTEGRAL_TYPE_P (rhs1_type
))
3195 || (INTEGRAL_TYPE_P (lhs_type
)
3196 && TREE_CODE (rhs1_type
) == OFFSET_TYPE
))
3199 /* Otherwise assert we are converting between types of the
3201 if (INTEGRAL_TYPE_P (lhs_type
) != INTEGRAL_TYPE_P (rhs1_type
))
3203 error ("invalid types in nop conversion");
3204 debug_generic_expr (lhs_type
);
3205 debug_generic_expr (rhs1_type
);
3212 case ADDR_SPACE_CONVERT_EXPR
:
3214 if (!POINTER_TYPE_P (rhs1_type
) || !POINTER_TYPE_P (lhs_type
)
3215 || (TYPE_ADDR_SPACE (TREE_TYPE (rhs1_type
))
3216 == TYPE_ADDR_SPACE (TREE_TYPE (lhs_type
))))
3218 error ("invalid types in address space conversion");
3219 debug_generic_expr (lhs_type
);
3220 debug_generic_expr (rhs1_type
);
3227 case FIXED_CONVERT_EXPR
:
3229 if (!valid_fixed_convert_types_p (lhs_type
, rhs1_type
)
3230 && !valid_fixed_convert_types_p (rhs1_type
, lhs_type
))
3232 error ("invalid types in fixed-point conversion");
3233 debug_generic_expr (lhs_type
);
3234 debug_generic_expr (rhs1_type
);
3243 if ((!INTEGRAL_TYPE_P (rhs1_type
) || !SCALAR_FLOAT_TYPE_P (lhs_type
))
3244 && (!VECTOR_INTEGER_TYPE_P (rhs1_type
)
3245 || !VECTOR_FLOAT_TYPE_P (lhs_type
)))
3247 error ("invalid types in conversion to floating point");
3248 debug_generic_expr (lhs_type
);
3249 debug_generic_expr (rhs1_type
);
3256 case FIX_TRUNC_EXPR
:
3258 if ((!INTEGRAL_TYPE_P (lhs_type
) || !SCALAR_FLOAT_TYPE_P (rhs1_type
))
3259 && (!VECTOR_INTEGER_TYPE_P (lhs_type
)
3260 || !VECTOR_FLOAT_TYPE_P (rhs1_type
)))
3262 error ("invalid types in conversion to integer");
3263 debug_generic_expr (lhs_type
);
3264 debug_generic_expr (rhs1_type
);
3271 case VEC_UNPACK_HI_EXPR
:
3272 case VEC_UNPACK_LO_EXPR
:
3273 case REDUC_MAX_EXPR
:
3274 case REDUC_MIN_EXPR
:
3275 case REDUC_PLUS_EXPR
:
3276 case VEC_UNPACK_FLOAT_HI_EXPR
:
3277 case VEC_UNPACK_FLOAT_LO_EXPR
:
3285 case NON_LVALUE_EXPR
:
3293 /* For the remaining codes assert there is no conversion involved. */
3294 if (!useless_type_conversion_p (lhs_type
, rhs1_type
))
3296 error ("non-trivial conversion in unary operation");
3297 debug_generic_expr (lhs_type
);
3298 debug_generic_expr (rhs1_type
);
3305 /* Verify a gimple assignment statement STMT with a binary rhs.
3306 Returns true if anything is wrong. */
3309 verify_gimple_assign_binary (gimple stmt
)
3311 enum tree_code rhs_code
= gimple_assign_rhs_code (stmt
);
3312 tree lhs
= gimple_assign_lhs (stmt
);
3313 tree lhs_type
= TREE_TYPE (lhs
);
3314 tree rhs1
= gimple_assign_rhs1 (stmt
);
3315 tree rhs1_type
= TREE_TYPE (rhs1
);
3316 tree rhs2
= gimple_assign_rhs2 (stmt
);
3317 tree rhs2_type
= TREE_TYPE (rhs2
);
3319 if (!is_gimple_reg (lhs
))
3321 error ("non-register as LHS of binary operation");
3325 if (!is_gimple_val (rhs1
)
3326 || !is_gimple_val (rhs2
))
3328 error ("invalid operands in binary operation");
3332 /* First handle operations that involve different types. */
3337 if (TREE_CODE (lhs_type
) != COMPLEX_TYPE
3338 || !(INTEGRAL_TYPE_P (rhs1_type
)
3339 || SCALAR_FLOAT_TYPE_P (rhs1_type
))
3340 || !(INTEGRAL_TYPE_P (rhs2_type
)
3341 || SCALAR_FLOAT_TYPE_P (rhs2_type
)))
3343 error ("type mismatch in complex expression");
3344 debug_generic_expr (lhs_type
);
3345 debug_generic_expr (rhs1_type
);
3346 debug_generic_expr (rhs2_type
);
3358 /* Shifts and rotates are ok on integral types, fixed point
3359 types and integer vector types. */
3360 if ((!INTEGRAL_TYPE_P (rhs1_type
)
3361 && !FIXED_POINT_TYPE_P (rhs1_type
)
3362 && !(TREE_CODE (rhs1_type
) == VECTOR_TYPE
3363 && INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type
))))
3364 || (!INTEGRAL_TYPE_P (rhs2_type
)
3365 /* Vector shifts of vectors are also ok. */
3366 && !(TREE_CODE (rhs1_type
) == VECTOR_TYPE
3367 && INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type
))
3368 && TREE_CODE (rhs2_type
) == VECTOR_TYPE
3369 && INTEGRAL_TYPE_P (TREE_TYPE (rhs2_type
))))
3370 || !useless_type_conversion_p (lhs_type
, rhs1_type
))
3372 error ("type mismatch in shift expression");
3373 debug_generic_expr (lhs_type
);
3374 debug_generic_expr (rhs1_type
);
3375 debug_generic_expr (rhs2_type
);
3382 case VEC_LSHIFT_EXPR
:
3383 case VEC_RSHIFT_EXPR
:
3385 if (TREE_CODE (rhs1_type
) != VECTOR_TYPE
3386 || !(INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type
))
3387 || POINTER_TYPE_P (TREE_TYPE (rhs1_type
))
3388 || FIXED_POINT_TYPE_P (TREE_TYPE (rhs1_type
))
3389 || SCALAR_FLOAT_TYPE_P (TREE_TYPE (rhs1_type
)))
3390 || (!INTEGRAL_TYPE_P (rhs2_type
)
3391 && (TREE_CODE (rhs2_type
) != VECTOR_TYPE
3392 || !INTEGRAL_TYPE_P (TREE_TYPE (rhs2_type
))))
3393 || !useless_type_conversion_p (lhs_type
, rhs1_type
))
3395 error ("type mismatch in vector shift expression");
3396 debug_generic_expr (lhs_type
);
3397 debug_generic_expr (rhs1_type
);
3398 debug_generic_expr (rhs2_type
);
3401 /* For shifting a vector of non-integral components we
3402 only allow shifting by a constant multiple of the element size. */
3403 if (!INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type
))
3404 && (TREE_CODE (rhs2
) != INTEGER_CST
3405 || !div_if_zero_remainder (EXACT_DIV_EXPR
, rhs2
,
3406 TYPE_SIZE (TREE_TYPE (rhs1_type
)))))
3408 error ("non-element sized vector shift of floating point vector");
3415 case WIDEN_LSHIFT_EXPR
:
3417 if (!INTEGRAL_TYPE_P (lhs_type
)
3418 || !INTEGRAL_TYPE_P (rhs1_type
)
3419 || TREE_CODE (rhs2
) != INTEGER_CST
3420 || (2 * TYPE_PRECISION (rhs1_type
) > TYPE_PRECISION (lhs_type
)))
3422 error ("type mismatch in widening vector shift expression");
3423 debug_generic_expr (lhs_type
);
3424 debug_generic_expr (rhs1_type
);
3425 debug_generic_expr (rhs2_type
);
3432 case VEC_WIDEN_LSHIFT_HI_EXPR
:
3433 case VEC_WIDEN_LSHIFT_LO_EXPR
:
3435 if (TREE_CODE (rhs1_type
) != VECTOR_TYPE
3436 || TREE_CODE (lhs_type
) != VECTOR_TYPE
3437 || !INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type
))
3438 || !INTEGRAL_TYPE_P (TREE_TYPE (lhs_type
))
3439 || TREE_CODE (rhs2
) != INTEGER_CST
3440 || (2 * TYPE_PRECISION (TREE_TYPE (rhs1_type
))
3441 > TYPE_PRECISION (TREE_TYPE (lhs_type
))))
3443 error ("type mismatch in widening vector shift expression");
3444 debug_generic_expr (lhs_type
);
3445 debug_generic_expr (rhs1_type
);
3446 debug_generic_expr (rhs2_type
);
3456 tree lhs_etype
= lhs_type
;
3457 tree rhs1_etype
= rhs1_type
;
3458 tree rhs2_etype
= rhs2_type
;
3459 if (TREE_CODE (lhs_type
) == VECTOR_TYPE
)
3461 if (TREE_CODE (rhs1_type
) != VECTOR_TYPE
3462 || TREE_CODE (rhs2_type
) != VECTOR_TYPE
)
3464 error ("invalid non-vector operands to vector valued plus");
3467 lhs_etype
= TREE_TYPE (lhs_type
);
3468 rhs1_etype
= TREE_TYPE (rhs1_type
);
3469 rhs2_etype
= TREE_TYPE (rhs2_type
);
3471 if (POINTER_TYPE_P (lhs_etype
)
3472 || POINTER_TYPE_P (rhs1_etype
)
3473 || POINTER_TYPE_P (rhs2_etype
))
3475 error ("invalid (pointer) operands to plus/minus");
3479 /* Continue with generic binary expression handling. */
3483 case POINTER_PLUS_EXPR
:
3485 if (!POINTER_TYPE_P (rhs1_type
)
3486 || !useless_type_conversion_p (lhs_type
, rhs1_type
)
3487 || !ptrofftype_p (rhs2_type
))
3489 error ("type mismatch in pointer plus expression");
3490 debug_generic_stmt (lhs_type
);
3491 debug_generic_stmt (rhs1_type
);
3492 debug_generic_stmt (rhs2_type
);
3499 case TRUTH_ANDIF_EXPR
:
3500 case TRUTH_ORIF_EXPR
:
3501 case TRUTH_AND_EXPR
:
3503 case TRUTH_XOR_EXPR
:
3513 case UNORDERED_EXPR
:
3521 /* Comparisons are also binary, but the result type is not
3522 connected to the operand types. */
3523 return verify_gimple_comparison (lhs_type
, rhs1
, rhs2
);
3525 case WIDEN_MULT_EXPR
:
3526 if (TREE_CODE (lhs_type
) != INTEGER_TYPE
)
3528 return ((2 * TYPE_PRECISION (rhs1_type
) > TYPE_PRECISION (lhs_type
))
3529 || (TYPE_PRECISION (rhs1_type
) != TYPE_PRECISION (rhs2_type
)));
3531 case WIDEN_SUM_EXPR
:
3532 case VEC_WIDEN_MULT_HI_EXPR
:
3533 case VEC_WIDEN_MULT_LO_EXPR
:
3534 case VEC_WIDEN_MULT_EVEN_EXPR
:
3535 case VEC_WIDEN_MULT_ODD_EXPR
:
3536 case VEC_PACK_TRUNC_EXPR
:
3537 case VEC_PACK_SAT_EXPR
:
3538 case VEC_PACK_FIX_TRUNC_EXPR
:
3543 case MULT_HIGHPART_EXPR
:
3544 case TRUNC_DIV_EXPR
:
3546 case FLOOR_DIV_EXPR
:
3547 case ROUND_DIV_EXPR
:
3548 case TRUNC_MOD_EXPR
:
3550 case FLOOR_MOD_EXPR
:
3551 case ROUND_MOD_EXPR
:
3553 case EXACT_DIV_EXPR
:
3559 /* Continue with generic binary expression handling. */
3566 if (!useless_type_conversion_p (lhs_type
, rhs1_type
)
3567 || !useless_type_conversion_p (lhs_type
, rhs2_type
))
3569 error ("type mismatch in binary expression");
3570 debug_generic_stmt (lhs_type
);
3571 debug_generic_stmt (rhs1_type
);
3572 debug_generic_stmt (rhs2_type
);
3579 /* Verify a gimple assignment statement STMT with a ternary rhs.
3580 Returns true if anything is wrong. */
3583 verify_gimple_assign_ternary (gimple stmt
)
3585 enum tree_code rhs_code
= gimple_assign_rhs_code (stmt
);
3586 tree lhs
= gimple_assign_lhs (stmt
);
3587 tree lhs_type
= TREE_TYPE (lhs
);
3588 tree rhs1
= gimple_assign_rhs1 (stmt
);
3589 tree rhs1_type
= TREE_TYPE (rhs1
);
3590 tree rhs2
= gimple_assign_rhs2 (stmt
);
3591 tree rhs2_type
= TREE_TYPE (rhs2
);
3592 tree rhs3
= gimple_assign_rhs3 (stmt
);
3593 tree rhs3_type
= TREE_TYPE (rhs3
);
3595 if (!is_gimple_reg (lhs
))
3597 error ("non-register as LHS of ternary operation");
3601 if (((rhs_code
== VEC_COND_EXPR
|| rhs_code
== COND_EXPR
)
3602 ? !is_gimple_condexpr (rhs1
) : !is_gimple_val (rhs1
))
3603 || !is_gimple_val (rhs2
)
3604 || !is_gimple_val (rhs3
))
3606 error ("invalid operands in ternary operation");
3610 /* First handle operations that involve different types. */
3613 case WIDEN_MULT_PLUS_EXPR
:
3614 case WIDEN_MULT_MINUS_EXPR
:
3615 if ((!INTEGRAL_TYPE_P (rhs1_type
)
3616 && !FIXED_POINT_TYPE_P (rhs1_type
))
3617 || !useless_type_conversion_p (rhs1_type
, rhs2_type
)
3618 || !useless_type_conversion_p (lhs_type
, rhs3_type
)
3619 || 2 * TYPE_PRECISION (rhs1_type
) > TYPE_PRECISION (lhs_type
)
3620 || TYPE_PRECISION (rhs1_type
) != TYPE_PRECISION (rhs2_type
))
3622 error ("type mismatch in widening multiply-accumulate expression");
3623 debug_generic_expr (lhs_type
);
3624 debug_generic_expr (rhs1_type
);
3625 debug_generic_expr (rhs2_type
);
3626 debug_generic_expr (rhs3_type
);
3632 if (!useless_type_conversion_p (lhs_type
, rhs1_type
)
3633 || !useless_type_conversion_p (lhs_type
, rhs2_type
)
3634 || !useless_type_conversion_p (lhs_type
, rhs3_type
))
3636 error ("type mismatch in fused multiply-add expression");
3637 debug_generic_expr (lhs_type
);
3638 debug_generic_expr (rhs1_type
);
3639 debug_generic_expr (rhs2_type
);
3640 debug_generic_expr (rhs3_type
);
3647 if (!useless_type_conversion_p (lhs_type
, rhs2_type
)
3648 || !useless_type_conversion_p (lhs_type
, rhs3_type
))
3650 error ("type mismatch in conditional expression");
3651 debug_generic_expr (lhs_type
);
3652 debug_generic_expr (rhs2_type
);
3653 debug_generic_expr (rhs3_type
);
3659 if (!useless_type_conversion_p (lhs_type
, rhs1_type
)
3660 || !useless_type_conversion_p (lhs_type
, rhs2_type
))
3662 error ("type mismatch in vector permute expression");
3663 debug_generic_expr (lhs_type
);
3664 debug_generic_expr (rhs1_type
);
3665 debug_generic_expr (rhs2_type
);
3666 debug_generic_expr (rhs3_type
);
3670 if (TREE_CODE (rhs1_type
) != VECTOR_TYPE
3671 || TREE_CODE (rhs2_type
) != VECTOR_TYPE
3672 || TREE_CODE (rhs3_type
) != VECTOR_TYPE
)
3674 error ("vector types expected in vector permute expression");
3675 debug_generic_expr (lhs_type
);
3676 debug_generic_expr (rhs1_type
);
3677 debug_generic_expr (rhs2_type
);
3678 debug_generic_expr (rhs3_type
);
3682 if (TYPE_VECTOR_SUBPARTS (rhs1_type
) != TYPE_VECTOR_SUBPARTS (rhs2_type
)
3683 || TYPE_VECTOR_SUBPARTS (rhs2_type
)
3684 != TYPE_VECTOR_SUBPARTS (rhs3_type
)
3685 || TYPE_VECTOR_SUBPARTS (rhs3_type
)
3686 != TYPE_VECTOR_SUBPARTS (lhs_type
))
3688 error ("vectors with different element number found "
3689 "in vector permute expression");
3690 debug_generic_expr (lhs_type
);
3691 debug_generic_expr (rhs1_type
);
3692 debug_generic_expr (rhs2_type
);
3693 debug_generic_expr (rhs3_type
);
3697 if (TREE_CODE (TREE_TYPE (rhs3_type
)) != INTEGER_TYPE
3698 || GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (rhs3_type
)))
3699 != GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (rhs1_type
))))
3701 error ("invalid mask type in vector permute expression");
3702 debug_generic_expr (lhs_type
);
3703 debug_generic_expr (rhs1_type
);
3704 debug_generic_expr (rhs2_type
);
3705 debug_generic_expr (rhs3_type
);
3712 case REALIGN_LOAD_EXPR
:
3722 /* Verify a gimple assignment statement STMT with a single rhs.
3723 Returns true if anything is wrong. */
3726 verify_gimple_assign_single (gimple stmt
)
3728 enum tree_code rhs_code
= gimple_assign_rhs_code (stmt
);
3729 tree lhs
= gimple_assign_lhs (stmt
);
3730 tree lhs_type
= TREE_TYPE (lhs
);
3731 tree rhs1
= gimple_assign_rhs1 (stmt
);
3732 tree rhs1_type
= TREE_TYPE (rhs1
);
3735 if (!useless_type_conversion_p (lhs_type
, rhs1_type
))
3737 error ("non-trivial conversion at assignment");
3738 debug_generic_expr (lhs_type
);
3739 debug_generic_expr (rhs1_type
);
3743 if (gimple_clobber_p (stmt
)
3744 && !(DECL_P (lhs
) || TREE_CODE (lhs
) == MEM_REF
))
3746 error ("non-decl/MEM_REF LHS in clobber statement");
3747 debug_generic_expr (lhs
);
3751 if (handled_component_p (lhs
))
3752 res
|= verify_types_in_gimple_reference (lhs
, true);
3754 /* Special codes we cannot handle via their class. */
3759 tree op
= TREE_OPERAND (rhs1
, 0);
3760 if (!is_gimple_addressable (op
))
3762 error ("invalid operand in unary expression");
3766 /* Technically there is no longer a need for matching types, but
3767 gimple hygiene asks for this check. In LTO we can end up
3768 combining incompatible units and thus end up with addresses
3769 of globals that change their type to a common one. */
3771 && !types_compatible_p (TREE_TYPE (op
),
3772 TREE_TYPE (TREE_TYPE (rhs1
)))
3773 && !one_pointer_to_useless_type_conversion_p (TREE_TYPE (rhs1
),
3776 error ("type mismatch in address expression");
3777 debug_generic_stmt (TREE_TYPE (rhs1
));
3778 debug_generic_stmt (TREE_TYPE (op
));
3782 return verify_types_in_gimple_reference (op
, true);
3787 error ("INDIRECT_REF in gimple IL");
3793 case ARRAY_RANGE_REF
:
3794 case VIEW_CONVERT_EXPR
:
3797 case TARGET_MEM_REF
:
3799 if (!is_gimple_reg (lhs
)
3800 && is_gimple_reg_type (TREE_TYPE (lhs
)))
3802 error ("invalid rhs for gimple memory store");
3803 debug_generic_stmt (lhs
);
3804 debug_generic_stmt (rhs1
);
3807 return res
|| verify_types_in_gimple_reference (rhs1
, false);
3819 /* tcc_declaration */
3824 if (!is_gimple_reg (lhs
)
3825 && !is_gimple_reg (rhs1
)
3826 && is_gimple_reg_type (TREE_TYPE (lhs
)))
3828 error ("invalid rhs for gimple memory store");
3829 debug_generic_stmt (lhs
);
3830 debug_generic_stmt (rhs1
);
3836 if (TREE_CODE (rhs1_type
) == VECTOR_TYPE
)
3839 tree elt_i
, elt_v
, elt_t
= NULL_TREE
;
3841 if (CONSTRUCTOR_NELTS (rhs1
) == 0)
3843 /* For vector CONSTRUCTORs we require that either it is empty
3844 CONSTRUCTOR, or it is a CONSTRUCTOR of smaller vector elements
3845 (then the element count must be correct to cover the whole
3846 outer vector and index must be NULL on all elements, or it is
3847 a CONSTRUCTOR of scalar elements, where we as an exception allow
3848 smaller number of elements (assuming zero filling) and
3849 consecutive indexes as compared to NULL indexes (such
3850 CONSTRUCTORs can appear in the IL from FEs). */
3851 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (rhs1
), i
, elt_i
, elt_v
)
3853 if (elt_t
== NULL_TREE
)
3855 elt_t
= TREE_TYPE (elt_v
);
3856 if (TREE_CODE (elt_t
) == VECTOR_TYPE
)
3858 tree elt_t
= TREE_TYPE (elt_v
);
3859 if (!useless_type_conversion_p (TREE_TYPE (rhs1_type
),
3862 error ("incorrect type of vector CONSTRUCTOR"
3864 debug_generic_stmt (rhs1
);
3867 else if (CONSTRUCTOR_NELTS (rhs1
)
3868 * TYPE_VECTOR_SUBPARTS (elt_t
)
3869 != TYPE_VECTOR_SUBPARTS (rhs1_type
))
3871 error ("incorrect number of vector CONSTRUCTOR"
3873 debug_generic_stmt (rhs1
);
3877 else if (!useless_type_conversion_p (TREE_TYPE (rhs1_type
),
3880 error ("incorrect type of vector CONSTRUCTOR elements");
3881 debug_generic_stmt (rhs1
);
3884 else if (CONSTRUCTOR_NELTS (rhs1
)
3885 > TYPE_VECTOR_SUBPARTS (rhs1_type
))
3887 error ("incorrect number of vector CONSTRUCTOR elements");
3888 debug_generic_stmt (rhs1
);
3892 else if (!useless_type_conversion_p (elt_t
, TREE_TYPE (elt_v
)))
3894 error ("incorrect type of vector CONSTRUCTOR elements");
3895 debug_generic_stmt (rhs1
);
3898 if (elt_i
!= NULL_TREE
3899 && (TREE_CODE (elt_t
) == VECTOR_TYPE
3900 || TREE_CODE (elt_i
) != INTEGER_CST
3901 || compare_tree_int (elt_i
, i
) != 0))
3903 error ("vector CONSTRUCTOR with non-NULL element index");
3904 debug_generic_stmt (rhs1
);
3912 case WITH_SIZE_EXPR
:
3922 /* Verify the contents of a GIMPLE_ASSIGN STMT. Returns true when there
3923 is a problem, otherwise false. */
3926 verify_gimple_assign (gimple stmt
)
3928 switch (gimple_assign_rhs_class (stmt
))
3930 case GIMPLE_SINGLE_RHS
:
3931 return verify_gimple_assign_single (stmt
);
3933 case GIMPLE_UNARY_RHS
:
3934 return verify_gimple_assign_unary (stmt
);
3936 case GIMPLE_BINARY_RHS
:
3937 return verify_gimple_assign_binary (stmt
);
3939 case GIMPLE_TERNARY_RHS
:
3940 return verify_gimple_assign_ternary (stmt
);
3947 /* Verify the contents of a GIMPLE_RETURN STMT. Returns true when there
3948 is a problem, otherwise false. */
3951 verify_gimple_return (gimple stmt
)
3953 tree op
= gimple_return_retval (stmt
);
3954 tree restype
= TREE_TYPE (TREE_TYPE (cfun
->decl
));
3956 /* We cannot test for present return values as we do not fix up missing
3957 return values from the original source. */
3961 if (!is_gimple_val (op
)
3962 && TREE_CODE (op
) != RESULT_DECL
)
3964 error ("invalid operand in return statement");
3965 debug_generic_stmt (op
);
3969 if ((TREE_CODE (op
) == RESULT_DECL
3970 && DECL_BY_REFERENCE (op
))
3971 || (TREE_CODE (op
) == SSA_NAME
3972 && SSA_NAME_VAR (op
)
3973 && TREE_CODE (SSA_NAME_VAR (op
)) == RESULT_DECL
3974 && DECL_BY_REFERENCE (SSA_NAME_VAR (op
))))
3975 op
= TREE_TYPE (op
);
3977 if (!useless_type_conversion_p (restype
, TREE_TYPE (op
)))
3979 error ("invalid conversion in return statement");
3980 debug_generic_stmt (restype
);
3981 debug_generic_stmt (TREE_TYPE (op
));
3989 /* Verify the contents of a GIMPLE_GOTO STMT. Returns true when there
3990 is a problem, otherwise false. */
3993 verify_gimple_goto (gimple stmt
)
3995 tree dest
= gimple_goto_dest (stmt
);
3997 /* ??? We have two canonical forms of direct goto destinations, a
3998 bare LABEL_DECL and an ADDR_EXPR of a LABEL_DECL. */
3999 if (TREE_CODE (dest
) != LABEL_DECL
4000 && (!is_gimple_val (dest
)
4001 || !POINTER_TYPE_P (TREE_TYPE (dest
))))
4003 error ("goto destination is neither a label nor a pointer");
4010 /* Verify the contents of a GIMPLE_SWITCH STMT. Returns true when there
4011 is a problem, otherwise false. */
4014 verify_gimple_switch (gimple stmt
)
4017 tree elt
, prev_upper_bound
= NULL_TREE
;
4018 tree index_type
, elt_type
= NULL_TREE
;
4020 if (!is_gimple_val (gimple_switch_index (stmt
)))
4022 error ("invalid operand to switch statement");
4023 debug_generic_stmt (gimple_switch_index (stmt
));
4027 index_type
= TREE_TYPE (gimple_switch_index (stmt
));
4028 if (! INTEGRAL_TYPE_P (index_type
))
4030 error ("non-integral type switch statement");
4031 debug_generic_expr (index_type
);
4035 elt
= gimple_switch_label (stmt
, 0);
4036 if (CASE_LOW (elt
) != NULL_TREE
|| CASE_HIGH (elt
) != NULL_TREE
)
4038 error ("invalid default case label in switch statement");
4039 debug_generic_expr (elt
);
4043 n
= gimple_switch_num_labels (stmt
);
4044 for (i
= 1; i
< n
; i
++)
4046 elt
= gimple_switch_label (stmt
, i
);
4048 if (! CASE_LOW (elt
))
4050 error ("invalid case label in switch statement");
4051 debug_generic_expr (elt
);
4055 && ! tree_int_cst_lt (CASE_LOW (elt
), CASE_HIGH (elt
)))
4057 error ("invalid case range in switch statement");
4058 debug_generic_expr (elt
);
4064 if (TREE_TYPE (CASE_LOW (elt
)) != elt_type
4065 || (CASE_HIGH (elt
) && TREE_TYPE (CASE_HIGH (elt
)) != elt_type
))
4067 error ("type mismatch for case label in switch statement");
4068 debug_generic_expr (elt
);
4074 elt_type
= TREE_TYPE (CASE_LOW (elt
));
4075 if (TYPE_PRECISION (index_type
) < TYPE_PRECISION (elt_type
))
4077 error ("type precision mismatch in switch statement");
4082 if (prev_upper_bound
)
4084 if (! tree_int_cst_lt (prev_upper_bound
, CASE_LOW (elt
)))
4086 error ("case labels not sorted in switch statement");
4091 prev_upper_bound
= CASE_HIGH (elt
);
4092 if (! prev_upper_bound
)
4093 prev_upper_bound
= CASE_LOW (elt
);
4099 /* Verify a gimple debug statement STMT.
4100 Returns true if anything is wrong. */
4103 verify_gimple_debug (gimple stmt ATTRIBUTE_UNUSED
)
4105 /* There isn't much that could be wrong in a gimple debug stmt. A
4106 gimple debug bind stmt, for example, maps a tree, that's usually
4107 a VAR_DECL or a PARM_DECL, but that could also be some scalarized
4108 component or member of an aggregate type, to another tree, that
4109 can be an arbitrary expression. These stmts expand into debug
4110 insns, and are converted to debug notes by var-tracking.c. */
4114 /* Verify a gimple label statement STMT.
4115 Returns true if anything is wrong. */
4118 verify_gimple_label (gimple stmt
)
4120 tree decl
= gimple_label_label (stmt
);
4124 if (TREE_CODE (decl
) != LABEL_DECL
)
4126 if (!DECL_NONLOCAL (decl
) && !FORCED_LABEL (decl
)
4127 && DECL_CONTEXT (decl
) != current_function_decl
)
4129 error ("label's context is not the current function decl");
4133 uid
= LABEL_DECL_UID (decl
);
4135 && (uid
== -1 || (*label_to_block_map
)[uid
] != gimple_bb (stmt
)))
4137 error ("incorrect entry in label_to_block_map");
4141 uid
= EH_LANDING_PAD_NR (decl
);
4144 eh_landing_pad lp
= get_eh_landing_pad_from_number (uid
);
4145 if (decl
!= lp
->post_landing_pad
)
4147 error ("incorrect setting of landing pad number");
4155 /* Verify the GIMPLE statement STMT. Returns true if there is an
4156 error, otherwise false. */
4159 verify_gimple_stmt (gimple stmt
)
4161 switch (gimple_code (stmt
))
4164 return verify_gimple_assign (stmt
);
4167 return verify_gimple_label (stmt
);
4170 return verify_gimple_call (stmt
);
4173 if (TREE_CODE_CLASS (gimple_cond_code (stmt
)) != tcc_comparison
)
4175 error ("invalid comparison code in gimple cond");
4178 if (!(!gimple_cond_true_label (stmt
)
4179 || TREE_CODE (gimple_cond_true_label (stmt
)) == LABEL_DECL
)
4180 || !(!gimple_cond_false_label (stmt
)
4181 || TREE_CODE (gimple_cond_false_label (stmt
)) == LABEL_DECL
))
4183 error ("invalid labels in gimple cond");
4187 return verify_gimple_comparison (boolean_type_node
,
4188 gimple_cond_lhs (stmt
),
4189 gimple_cond_rhs (stmt
));
4192 return verify_gimple_goto (stmt
);
4195 return verify_gimple_switch (stmt
);
4198 return verify_gimple_return (stmt
);
4203 case GIMPLE_TRANSACTION
:
4204 return verify_gimple_transaction (stmt
);
4206 /* Tuples that do not have tree operands. */
4208 case GIMPLE_PREDICT
:
4210 case GIMPLE_EH_DISPATCH
:
4211 case GIMPLE_EH_MUST_NOT_THROW
:
4215 /* OpenMP directives are validated by the FE and never operated
4216 on by the optimizers. Furthermore, GIMPLE_OMP_FOR may contain
4217 non-gimple expressions when the main index variable has had
4218 its address taken. This does not affect the loop itself
4219 because the header of an GIMPLE_OMP_FOR is merely used to determine
4220 how to setup the parallel iteration. */
4224 return verify_gimple_debug (stmt
);
4231 /* Verify the contents of a GIMPLE_PHI. Returns true if there is a problem,
4232 and false otherwise. */
4235 verify_gimple_phi (gimple phi
)
4239 tree phi_result
= gimple_phi_result (phi
);
4244 error ("invalid PHI result");
4248 virtual_p
= virtual_operand_p (phi_result
);
4249 if (TREE_CODE (phi_result
) != SSA_NAME
4251 && SSA_NAME_VAR (phi_result
) != gimple_vop (cfun
)))
4253 error ("invalid PHI result");
4257 for (i
= 0; i
< gimple_phi_num_args (phi
); i
++)
4259 tree t
= gimple_phi_arg_def (phi
, i
);
4263 error ("missing PHI def");
4267 /* Addressable variables do have SSA_NAMEs but they
4268 are not considered gimple values. */
4269 else if ((TREE_CODE (t
) == SSA_NAME
4270 && virtual_p
!= virtual_operand_p (t
))
4272 && (TREE_CODE (t
) != SSA_NAME
4273 || SSA_NAME_VAR (t
) != gimple_vop (cfun
)))
4275 && !is_gimple_val (t
)))
4277 error ("invalid PHI argument");
4278 debug_generic_expr (t
);
4281 #ifdef ENABLE_TYPES_CHECKING
4282 if (!useless_type_conversion_p (TREE_TYPE (phi_result
), TREE_TYPE (t
)))
4284 error ("incompatible types in PHI argument %u", i
);
4285 debug_generic_stmt (TREE_TYPE (phi_result
));
4286 debug_generic_stmt (TREE_TYPE (t
));
4295 /* Verify the GIMPLE statements inside the sequence STMTS. */
4298 verify_gimple_in_seq_2 (gimple_seq stmts
)
4300 gimple_stmt_iterator ittr
;
4303 for (ittr
= gsi_start (stmts
); !gsi_end_p (ittr
); gsi_next (&ittr
))
4305 gimple stmt
= gsi_stmt (ittr
);
4307 switch (gimple_code (stmt
))
4310 err
|= verify_gimple_in_seq_2 (gimple_bind_body (stmt
));
4314 err
|= verify_gimple_in_seq_2 (gimple_try_eval (stmt
));
4315 err
|= verify_gimple_in_seq_2 (gimple_try_cleanup (stmt
));
4318 case GIMPLE_EH_FILTER
:
4319 err
|= verify_gimple_in_seq_2 (gimple_eh_filter_failure (stmt
));
4322 case GIMPLE_EH_ELSE
:
4323 err
|= verify_gimple_in_seq_2 (gimple_eh_else_n_body (stmt
));
4324 err
|= verify_gimple_in_seq_2 (gimple_eh_else_e_body (stmt
));
4328 err
|= verify_gimple_in_seq_2 (gimple_catch_handler (stmt
));
4331 case GIMPLE_TRANSACTION
:
4332 err
|= verify_gimple_transaction (stmt
);
4337 bool err2
= verify_gimple_stmt (stmt
);
4339 debug_gimple_stmt (stmt
);
4348 /* Verify the contents of a GIMPLE_TRANSACTION. Returns true if there
4349 is a problem, otherwise false. */
4352 verify_gimple_transaction (gimple stmt
)
4354 tree lab
= gimple_transaction_label (stmt
);
4355 if (lab
!= NULL
&& TREE_CODE (lab
) != LABEL_DECL
)
4357 return verify_gimple_in_seq_2 (gimple_transaction_body (stmt
));
4361 /* Verify the GIMPLE statements inside the statement list STMTS. */
4364 verify_gimple_in_seq (gimple_seq stmts
)
4366 timevar_push (TV_TREE_STMT_VERIFY
);
4367 if (verify_gimple_in_seq_2 (stmts
))
4368 internal_error ("verify_gimple failed");
4369 timevar_pop (TV_TREE_STMT_VERIFY
);
4372 /* Return true when the T can be shared. */
4375 tree_node_can_be_shared (tree t
)
4377 if (IS_TYPE_OR_DECL_P (t
)
4378 || is_gimple_min_invariant (t
)
4379 || TREE_CODE (t
) == SSA_NAME
4380 || t
== error_mark_node
4381 || TREE_CODE (t
) == IDENTIFIER_NODE
)
4384 if (TREE_CODE (t
) == CASE_LABEL_EXPR
)
4393 /* Called via walk_tree. Verify tree sharing. */
4396 verify_node_sharing_1 (tree
*tp
, int *walk_subtrees
, void *data
)
4398 struct pointer_set_t
*visited
= (struct pointer_set_t
*) data
;
4400 if (tree_node_can_be_shared (*tp
))
4402 *walk_subtrees
= false;
4406 if (pointer_set_insert (visited
, *tp
))
4412 /* Called via walk_gimple_stmt. Verify tree sharing. */
4415 verify_node_sharing (tree
*tp
, int *walk_subtrees
, void *data
)
4417 struct walk_stmt_info
*wi
= (struct walk_stmt_info
*) data
;
4418 return verify_node_sharing_1 (tp
, walk_subtrees
, wi
->info
);
4421 static bool eh_error_found
;
4423 verify_eh_throw_stmt_node (void **slot
, void *data
)
4425 struct throw_stmt_node
*node
= (struct throw_stmt_node
*)*slot
;
4426 struct pointer_set_t
*visited
= (struct pointer_set_t
*) data
;
4428 if (!pointer_set_contains (visited
, node
->stmt
))
4430 error ("dead STMT in EH table");
4431 debug_gimple_stmt (node
->stmt
);
4432 eh_error_found
= true;
4437 /* Verify if the location LOCs block is in BLOCKS. */
4440 verify_location (pointer_set_t
*blocks
, location_t loc
)
4442 tree block
= LOCATION_BLOCK (loc
);
4443 if (block
!= NULL_TREE
4444 && !pointer_set_contains (blocks
, block
))
4446 error ("location references block not in block tree");
4449 if (block
!= NULL_TREE
)
4450 return verify_location (blocks
, BLOCK_SOURCE_LOCATION (block
));
4454 /* Called via walk_tree. Verify that expressions have no blocks. */
4457 verify_expr_no_block (tree
*tp
, int *walk_subtrees
, void *)
4461 *walk_subtrees
= false;
4465 location_t loc
= EXPR_LOCATION (*tp
);
4466 if (LOCATION_BLOCK (loc
) != NULL
)
4472 /* Called via walk_tree. Verify locations of expressions. */
4475 verify_expr_location_1 (tree
*tp
, int *walk_subtrees
, void *data
)
4477 struct pointer_set_t
*blocks
= (struct pointer_set_t
*) data
;
4479 if (TREE_CODE (*tp
) == VAR_DECL
4480 && DECL_HAS_DEBUG_EXPR_P (*tp
))
4482 tree t
= DECL_DEBUG_EXPR (*tp
);
4483 tree addr
= walk_tree (&t
, verify_expr_no_block
, NULL
, NULL
);
4487 if ((TREE_CODE (*tp
) == VAR_DECL
4488 || TREE_CODE (*tp
) == PARM_DECL
4489 || TREE_CODE (*tp
) == RESULT_DECL
)
4490 && DECL_HAS_VALUE_EXPR_P (*tp
))
4492 tree t
= DECL_VALUE_EXPR (*tp
);
4493 tree addr
= walk_tree (&t
, verify_expr_no_block
, NULL
, NULL
);
4500 *walk_subtrees
= false;
4504 location_t loc
= EXPR_LOCATION (*tp
);
4505 if (verify_location (blocks
, loc
))
4511 /* Called via walk_gimple_op. Verify locations of expressions. */
4514 verify_expr_location (tree
*tp
, int *walk_subtrees
, void *data
)
4516 struct walk_stmt_info
*wi
= (struct walk_stmt_info
*) data
;
4517 return verify_expr_location_1 (tp
, walk_subtrees
, wi
->info
);
4520 /* Insert all subblocks of BLOCK into BLOCKS and recurse. */
4523 collect_subblocks (pointer_set_t
*blocks
, tree block
)
4526 for (t
= BLOCK_SUBBLOCKS (block
); t
; t
= BLOCK_CHAIN (t
))
4528 pointer_set_insert (blocks
, t
);
4529 collect_subblocks (blocks
, t
);
4533 /* Verify the GIMPLE statements in the CFG of FN. */
4536 verify_gimple_in_cfg (struct function
*fn
)
4540 struct pointer_set_t
*visited
, *visited_stmts
, *blocks
;
4542 timevar_push (TV_TREE_STMT_VERIFY
);
4543 visited
= pointer_set_create ();
4544 visited_stmts
= pointer_set_create ();
4546 /* Collect all BLOCKs referenced by the BLOCK tree of FN. */
4547 blocks
= pointer_set_create ();
4548 if (DECL_INITIAL (fn
->decl
))
4550 pointer_set_insert (blocks
, DECL_INITIAL (fn
->decl
));
4551 collect_subblocks (blocks
, DECL_INITIAL (fn
->decl
));
4554 FOR_EACH_BB_FN (bb
, fn
)
4556 gimple_stmt_iterator gsi
;
4558 for (gsi
= gsi_start_phis (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
4560 gimple phi
= gsi_stmt (gsi
);
4564 pointer_set_insert (visited_stmts
, phi
);
4566 if (gimple_bb (phi
) != bb
)
4568 error ("gimple_bb (phi) is set to a wrong basic block");
4572 err2
|= verify_gimple_phi (phi
);
4574 /* Only PHI arguments have locations. */
4575 if (gimple_location (phi
) != UNKNOWN_LOCATION
)
4577 error ("PHI node with location");
4581 for (i
= 0; i
< gimple_phi_num_args (phi
); i
++)
4583 tree arg
= gimple_phi_arg_def (phi
, i
);
4584 tree addr
= walk_tree (&arg
, verify_node_sharing_1
,
4588 error ("incorrect sharing of tree nodes");
4589 debug_generic_expr (addr
);
4592 location_t loc
= gimple_phi_arg_location (phi
, i
);
4593 if (virtual_operand_p (gimple_phi_result (phi
))
4594 && loc
!= UNKNOWN_LOCATION
)
4596 error ("virtual PHI with argument locations");
4599 addr
= walk_tree (&arg
, verify_expr_location_1
, blocks
, NULL
);
4602 debug_generic_expr (addr
);
4605 err2
|= verify_location (blocks
, loc
);
4609 debug_gimple_stmt (phi
);
4613 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
4615 gimple stmt
= gsi_stmt (gsi
);
4617 struct walk_stmt_info wi
;
4621 pointer_set_insert (visited_stmts
, stmt
);
4623 if (gimple_bb (stmt
) != bb
)
4625 error ("gimple_bb (stmt) is set to a wrong basic block");
4629 err2
|= verify_gimple_stmt (stmt
);
4630 err2
|= verify_location (blocks
, gimple_location (stmt
));
4632 memset (&wi
, 0, sizeof (wi
));
4633 wi
.info
= (void *) visited
;
4634 addr
= walk_gimple_op (stmt
, verify_node_sharing
, &wi
);
4637 error ("incorrect sharing of tree nodes");
4638 debug_generic_expr (addr
);
4642 memset (&wi
, 0, sizeof (wi
));
4643 wi
.info
= (void *) blocks
;
4644 addr
= walk_gimple_op (stmt
, verify_expr_location
, &wi
);
4647 debug_generic_expr (addr
);
4651 /* ??? Instead of not checking these stmts at all the walker
4652 should know its context via wi. */
4653 if (!is_gimple_debug (stmt
)
4654 && !is_gimple_omp (stmt
))
4656 memset (&wi
, 0, sizeof (wi
));
4657 addr
= walk_gimple_op (stmt
, verify_expr
, &wi
);
4660 debug_generic_expr (addr
);
4661 inform (gimple_location (stmt
), "in statement");
4666 /* If the statement is marked as part of an EH region, then it is
4667 expected that the statement could throw. Verify that when we
4668 have optimizations that simplify statements such that we prove
4669 that they cannot throw, that we update other data structures
4671 lp_nr
= lookup_stmt_eh_lp (stmt
);
4674 if (!stmt_could_throw_p (stmt
))
4676 error ("statement marked for throw, but doesn%'t");
4680 && !gsi_one_before_end_p (gsi
)
4681 && stmt_can_throw_internal (stmt
))
4683 error ("statement marked for throw in middle of block");
4689 debug_gimple_stmt (stmt
);
4694 eh_error_found
= false;
4695 if (get_eh_throw_stmt_table (cfun
))
4696 htab_traverse (get_eh_throw_stmt_table (cfun
),
4697 verify_eh_throw_stmt_node
,
4700 if (err
|| eh_error_found
)
4701 internal_error ("verify_gimple failed");
4703 pointer_set_destroy (visited
);
4704 pointer_set_destroy (visited_stmts
);
4705 pointer_set_destroy (blocks
);
4706 verify_histograms ();
4707 timevar_pop (TV_TREE_STMT_VERIFY
);
4711 /* Verifies that the flow information is OK. */
4714 gimple_verify_flow_info (void)
4718 gimple_stmt_iterator gsi
;
4723 if (ENTRY_BLOCK_PTR
->il
.gimple
.seq
|| ENTRY_BLOCK_PTR
->il
.gimple
.phi_nodes
)
4725 error ("ENTRY_BLOCK has IL associated with it");
4729 if (EXIT_BLOCK_PTR
->il
.gimple
.seq
|| EXIT_BLOCK_PTR
->il
.gimple
.phi_nodes
)
4731 error ("EXIT_BLOCK has IL associated with it");
4735 FOR_EACH_EDGE (e
, ei
, EXIT_BLOCK_PTR
->preds
)
4736 if (e
->flags
& EDGE_FALLTHRU
)
4738 error ("fallthru to exit from bb %d", e
->src
->index
);
4744 bool found_ctrl_stmt
= false;
4748 /* Skip labels on the start of basic block. */
4749 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
4752 gimple prev_stmt
= stmt
;
4754 stmt
= gsi_stmt (gsi
);
4756 if (gimple_code (stmt
) != GIMPLE_LABEL
)
4759 label
= gimple_label_label (stmt
);
4760 if (prev_stmt
&& DECL_NONLOCAL (label
))
4762 error ("nonlocal label ");
4763 print_generic_expr (stderr
, label
, 0);
4764 fprintf (stderr
, " is not first in a sequence of labels in bb %d",
4769 if (prev_stmt
&& EH_LANDING_PAD_NR (label
) != 0)
4771 error ("EH landing pad label ");
4772 print_generic_expr (stderr
, label
, 0);
4773 fprintf (stderr
, " is not first in a sequence of labels in bb %d",
4778 if (label_to_block (label
) != bb
)
4781 print_generic_expr (stderr
, label
, 0);
4782 fprintf (stderr
, " to block does not match in bb %d",
4787 if (decl_function_context (label
) != current_function_decl
)
4790 print_generic_expr (stderr
, label
, 0);
4791 fprintf (stderr
, " has incorrect context in bb %d",
4797 /* Verify that body of basic block BB is free of control flow. */
4798 for (; !gsi_end_p (gsi
); gsi_next (&gsi
))
4800 gimple stmt
= gsi_stmt (gsi
);
4802 if (found_ctrl_stmt
)
4804 error ("control flow in the middle of basic block %d",
4809 if (stmt_ends_bb_p (stmt
))
4810 found_ctrl_stmt
= true;
4812 if (gimple_code (stmt
) == GIMPLE_LABEL
)
4815 print_generic_expr (stderr
, gimple_label_label (stmt
), 0);
4816 fprintf (stderr
, " in the middle of basic block %d", bb
->index
);
4821 gsi
= gsi_last_bb (bb
);
4822 if (gsi_end_p (gsi
))
4825 stmt
= gsi_stmt (gsi
);
4827 if (gimple_code (stmt
) == GIMPLE_LABEL
)
4830 err
|= verify_eh_edges (stmt
);
4832 if (is_ctrl_stmt (stmt
))
4834 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
4835 if (e
->flags
& EDGE_FALLTHRU
)
4837 error ("fallthru edge after a control statement in bb %d",
4843 if (gimple_code (stmt
) != GIMPLE_COND
)
4845 /* Verify that there are no edges with EDGE_TRUE/FALSE_FLAG set
4846 after anything else but if statement. */
4847 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
4848 if (e
->flags
& (EDGE_TRUE_VALUE
| EDGE_FALSE_VALUE
))
4850 error ("true/false edge after a non-GIMPLE_COND in bb %d",
4856 switch (gimple_code (stmt
))
4863 extract_true_false_edges_from_block (bb
, &true_edge
, &false_edge
);
4867 || !(true_edge
->flags
& EDGE_TRUE_VALUE
)
4868 || !(false_edge
->flags
& EDGE_FALSE_VALUE
)
4869 || (true_edge
->flags
& (EDGE_FALLTHRU
| EDGE_ABNORMAL
))
4870 || (false_edge
->flags
& (EDGE_FALLTHRU
| EDGE_ABNORMAL
))
4871 || EDGE_COUNT (bb
->succs
) >= 3)
4873 error ("wrong outgoing edge flags at end of bb %d",
4881 if (simple_goto_p (stmt
))
4883 error ("explicit goto at end of bb %d", bb
->index
);
4888 /* FIXME. We should double check that the labels in the
4889 destination blocks have their address taken. */
4890 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
4891 if ((e
->flags
& (EDGE_FALLTHRU
| EDGE_TRUE_VALUE
4892 | EDGE_FALSE_VALUE
))
4893 || !(e
->flags
& EDGE_ABNORMAL
))
4895 error ("wrong outgoing edge flags at end of bb %d",
4903 if (!gimple_call_builtin_p (stmt
, BUILT_IN_RETURN
))
4905 /* ... fallthru ... */
4907 if (!single_succ_p (bb
)
4908 || (single_succ_edge (bb
)->flags
4909 & (EDGE_FALLTHRU
| EDGE_ABNORMAL
4910 | EDGE_TRUE_VALUE
| EDGE_FALSE_VALUE
)))
4912 error ("wrong outgoing edge flags at end of bb %d", bb
->index
);
4915 if (single_succ (bb
) != EXIT_BLOCK_PTR
)
4917 error ("return edge does not point to exit in bb %d",
4929 n
= gimple_switch_num_labels (stmt
);
4931 /* Mark all the destination basic blocks. */
4932 for (i
= 0; i
< n
; ++i
)
4934 tree lab
= CASE_LABEL (gimple_switch_label (stmt
, i
));
4935 basic_block label_bb
= label_to_block (lab
);
4936 gcc_assert (!label_bb
->aux
|| label_bb
->aux
== (void *)1);
4937 label_bb
->aux
= (void *)1;
4940 /* Verify that the case labels are sorted. */
4941 prev
= gimple_switch_label (stmt
, 0);
4942 for (i
= 1; i
< n
; ++i
)
4944 tree c
= gimple_switch_label (stmt
, i
);
4947 error ("found default case not at the start of "
4953 && !tree_int_cst_lt (CASE_LOW (prev
), CASE_LOW (c
)))
4955 error ("case labels not sorted: ");
4956 print_generic_expr (stderr
, prev
, 0);
4957 fprintf (stderr
," is greater than ");
4958 print_generic_expr (stderr
, c
, 0);
4959 fprintf (stderr
," but comes before it.\n");
4964 /* VRP will remove the default case if it can prove it will
4965 never be executed. So do not verify there always exists
4966 a default case here. */
4968 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
4972 error ("extra outgoing edge %d->%d",
4973 bb
->index
, e
->dest
->index
);
4977 e
->dest
->aux
= (void *)2;
4978 if ((e
->flags
& (EDGE_FALLTHRU
| EDGE_ABNORMAL
4979 | EDGE_TRUE_VALUE
| EDGE_FALSE_VALUE
)))
4981 error ("wrong outgoing edge flags at end of bb %d",
4987 /* Check that we have all of them. */
4988 for (i
= 0; i
< n
; ++i
)
4990 tree lab
= CASE_LABEL (gimple_switch_label (stmt
, i
));
4991 basic_block label_bb
= label_to_block (lab
);
4993 if (label_bb
->aux
!= (void *)2)
4995 error ("missing edge %i->%i", bb
->index
, label_bb
->index
);
5000 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
5001 e
->dest
->aux
= (void *)0;
5005 case GIMPLE_EH_DISPATCH
:
5006 err
|= verify_eh_dispatch_edge (stmt
);
5014 if (dom_info_state (CDI_DOMINATORS
) >= DOM_NO_FAST_QUERY
)
5015 verify_dominators (CDI_DOMINATORS
);
5021 /* Updates phi nodes after creating a forwarder block joined
5022 by edge FALLTHRU. */
5025 gimple_make_forwarder_block (edge fallthru
)
5029 basic_block dummy
, bb
;
5031 gimple_stmt_iterator gsi
;
5033 dummy
= fallthru
->src
;
5034 bb
= fallthru
->dest
;
5036 if (single_pred_p (bb
))
5039 /* If we redirected a branch we must create new PHI nodes at the
5041 for (gsi
= gsi_start_phis (dummy
); !gsi_end_p (gsi
); gsi_next (&gsi
))
5043 gimple phi
, new_phi
;
5045 phi
= gsi_stmt (gsi
);
5046 var
= gimple_phi_result (phi
);
5047 new_phi
= create_phi_node (var
, bb
);
5048 gimple_phi_set_result (phi
, copy_ssa_name (var
, phi
));
5049 add_phi_arg (new_phi
, gimple_phi_result (phi
), fallthru
,
5053 /* Add the arguments we have stored on edges. */
5054 FOR_EACH_EDGE (e
, ei
, bb
->preds
)
5059 flush_pending_stmts (e
);
5064 /* Return a non-special label in the head of basic block BLOCK.
5065 Create one if it doesn't exist. */
5068 gimple_block_label (basic_block bb
)
5070 gimple_stmt_iterator i
, s
= gsi_start_bb (bb
);
5075 for (i
= s
; !gsi_end_p (i
); first
= false, gsi_next (&i
))
5077 stmt
= gsi_stmt (i
);
5078 if (gimple_code (stmt
) != GIMPLE_LABEL
)
5080 label
= gimple_label_label (stmt
);
5081 if (!DECL_NONLOCAL (label
))
5084 gsi_move_before (&i
, &s
);
5089 label
= create_artificial_label (UNKNOWN_LOCATION
);
5090 stmt
= gimple_build_label (label
);
5091 gsi_insert_before (&s
, stmt
, GSI_NEW_STMT
);
5096 /* Attempt to perform edge redirection by replacing a possibly complex
5097 jump instruction by a goto or by removing the jump completely.
5098 This can apply only if all edges now point to the same block. The
5099 parameters and return values are equivalent to
5100 redirect_edge_and_branch. */
5103 gimple_try_redirect_by_replacing_jump (edge e
, basic_block target
)
5105 basic_block src
= e
->src
;
5106 gimple_stmt_iterator i
;
5109 /* We can replace or remove a complex jump only when we have exactly
5111 if (EDGE_COUNT (src
->succs
) != 2
5112 /* Verify that all targets will be TARGET. Specifically, the
5113 edge that is not E must also go to TARGET. */
5114 || EDGE_SUCC (src
, EDGE_SUCC (src
, 0) == e
)->dest
!= target
)
5117 i
= gsi_last_bb (src
);
5121 stmt
= gsi_stmt (i
);
5123 if (gimple_code (stmt
) == GIMPLE_COND
|| gimple_code (stmt
) == GIMPLE_SWITCH
)
5125 gsi_remove (&i
, true);
5126 e
= ssa_redirect_edge (e
, target
);
5127 e
->flags
= EDGE_FALLTHRU
;
5135 /* Redirect E to DEST. Return NULL on failure. Otherwise, return the
5136 edge representing the redirected branch. */
5139 gimple_redirect_edge_and_branch (edge e
, basic_block dest
)
5141 basic_block bb
= e
->src
;
5142 gimple_stmt_iterator gsi
;
5146 if (e
->flags
& EDGE_ABNORMAL
)
5149 if (e
->dest
== dest
)
5152 if (e
->flags
& EDGE_EH
)
5153 return redirect_eh_edge (e
, dest
);
5155 if (e
->src
!= ENTRY_BLOCK_PTR
)
5157 ret
= gimple_try_redirect_by_replacing_jump (e
, dest
);
5162 gsi
= gsi_last_bb (bb
);
5163 stmt
= gsi_end_p (gsi
) ? NULL
: gsi_stmt (gsi
);
5165 switch (stmt
? gimple_code (stmt
) : GIMPLE_ERROR_MARK
)
5168 /* For COND_EXPR, we only need to redirect the edge. */
5172 /* No non-abnormal edges should lead from a non-simple goto, and
5173 simple ones should be represented implicitly. */
5178 tree label
= gimple_block_label (dest
);
5179 tree cases
= get_cases_for_edge (e
, stmt
);
5181 /* If we have a list of cases associated with E, then use it
5182 as it's a lot faster than walking the entire case vector. */
5185 edge e2
= find_edge (e
->src
, dest
);
5192 CASE_LABEL (cases
) = label
;
5193 cases
= CASE_CHAIN (cases
);
5196 /* If there was already an edge in the CFG, then we need
5197 to move all the cases associated with E to E2. */
5200 tree cases2
= get_cases_for_edge (e2
, stmt
);
5202 CASE_CHAIN (last
) = CASE_CHAIN (cases2
);
5203 CASE_CHAIN (cases2
) = first
;
5205 bitmap_set_bit (touched_switch_bbs
, gimple_bb (stmt
)->index
);
5209 size_t i
, n
= gimple_switch_num_labels (stmt
);
5211 for (i
= 0; i
< n
; i
++)
5213 tree elt
= gimple_switch_label (stmt
, i
);
5214 if (label_to_block (CASE_LABEL (elt
)) == e
->dest
)
5215 CASE_LABEL (elt
) = label
;
5223 int i
, n
= gimple_asm_nlabels (stmt
);
5226 for (i
= 0; i
< n
; ++i
)
5228 tree cons
= gimple_asm_label_op (stmt
, i
);
5229 if (label_to_block (TREE_VALUE (cons
)) == e
->dest
)
5232 label
= gimple_block_label (dest
);
5233 TREE_VALUE (cons
) = label
;
5237 /* If we didn't find any label matching the former edge in the
5238 asm labels, we must be redirecting the fallthrough
5240 gcc_assert (label
|| (e
->flags
& EDGE_FALLTHRU
));
5245 gsi_remove (&gsi
, true);
5246 e
->flags
|= EDGE_FALLTHRU
;
5249 case GIMPLE_OMP_RETURN
:
5250 case GIMPLE_OMP_CONTINUE
:
5251 case GIMPLE_OMP_SECTIONS_SWITCH
:
5252 case GIMPLE_OMP_FOR
:
5253 /* The edges from OMP constructs can be simply redirected. */
5256 case GIMPLE_EH_DISPATCH
:
5257 if (!(e
->flags
& EDGE_FALLTHRU
))
5258 redirect_eh_dispatch_edge (stmt
, e
, dest
);
5261 case GIMPLE_TRANSACTION
:
5262 /* The ABORT edge has a stored label associated with it, otherwise
5263 the edges are simply redirectable. */
5265 gimple_transaction_set_label (stmt
, gimple_block_label (dest
));
5269 /* Otherwise it must be a fallthru edge, and we don't need to
5270 do anything besides redirecting it. */
5271 gcc_assert (e
->flags
& EDGE_FALLTHRU
);
5275 /* Update/insert PHI nodes as necessary. */
5277 /* Now update the edges in the CFG. */
5278 e
= ssa_redirect_edge (e
, dest
);
5283 /* Returns true if it is possible to remove edge E by redirecting
5284 it to the destination of the other edge from E->src. */
5287 gimple_can_remove_branch_p (const_edge e
)
5289 if (e
->flags
& (EDGE_ABNORMAL
| EDGE_EH
))
5295 /* Simple wrapper, as we can always redirect fallthru edges. */
5298 gimple_redirect_edge_and_branch_force (edge e
, basic_block dest
)
5300 e
= gimple_redirect_edge_and_branch (e
, dest
);
5307 /* Splits basic block BB after statement STMT (but at least after the
5308 labels). If STMT is NULL, BB is split just after the labels. */
5311 gimple_split_block (basic_block bb
, void *stmt
)
5313 gimple_stmt_iterator gsi
;
5314 gimple_stmt_iterator gsi_tgt
;
5321 new_bb
= create_empty_bb (bb
);
5323 /* Redirect the outgoing edges. */
5324 new_bb
->succs
= bb
->succs
;
5326 FOR_EACH_EDGE (e
, ei
, new_bb
->succs
)
5329 if (stmt
&& gimple_code ((gimple
) stmt
) == GIMPLE_LABEL
)
5332 /* Move everything from GSI to the new basic block. */
5333 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
5335 act
= gsi_stmt (gsi
);
5336 if (gimple_code (act
) == GIMPLE_LABEL
)
5349 if (gsi_end_p (gsi
))
5352 /* Split the statement list - avoid re-creating new containers as this
5353 brings ugly quadratic memory consumption in the inliner.
5354 (We are still quadratic since we need to update stmt BB pointers,
5356 gsi_split_seq_before (&gsi
, &list
);
5357 set_bb_seq (new_bb
, list
);
5358 for (gsi_tgt
= gsi_start (list
);
5359 !gsi_end_p (gsi_tgt
); gsi_next (&gsi_tgt
))
5360 gimple_set_bb (gsi_stmt (gsi_tgt
), new_bb
);
5366 /* Moves basic block BB after block AFTER. */
5369 gimple_move_block_after (basic_block bb
, basic_block after
)
5371 if (bb
->prev_bb
== after
)
5375 link_block (bb
, after
);
5381 /* Return TRUE if block BB has no executable statements, otherwise return
5385 gimple_empty_block_p (basic_block bb
)
5387 /* BB must have no executable statements. */
5388 gimple_stmt_iterator gsi
= gsi_after_labels (bb
);
5391 if (gsi_end_p (gsi
))
5393 if (is_gimple_debug (gsi_stmt (gsi
)))
5394 gsi_next_nondebug (&gsi
);
5395 return gsi_end_p (gsi
);
5399 /* Split a basic block if it ends with a conditional branch and if the
5400 other part of the block is not empty. */
5403 gimple_split_block_before_cond_jump (basic_block bb
)
5405 gimple last
, split_point
;
5406 gimple_stmt_iterator gsi
= gsi_last_nondebug_bb (bb
);
5407 if (gsi_end_p (gsi
))
5409 last
= gsi_stmt (gsi
);
5410 if (gimple_code (last
) != GIMPLE_COND
5411 && gimple_code (last
) != GIMPLE_SWITCH
)
5413 gsi_prev_nondebug (&gsi
);
5414 split_point
= gsi_stmt (gsi
);
5415 return split_block (bb
, split_point
)->dest
;
5419 /* Return true if basic_block can be duplicated. */
5422 gimple_can_duplicate_bb_p (const_basic_block bb ATTRIBUTE_UNUSED
)
5427 /* Create a duplicate of the basic block BB. NOTE: This does not
5428 preserve SSA form. */
5431 gimple_duplicate_bb (basic_block bb
)
5434 gimple_stmt_iterator gsi
, gsi_tgt
;
5435 gimple_seq phis
= phi_nodes (bb
);
5436 gimple phi
, stmt
, copy
;
5438 new_bb
= create_empty_bb (EXIT_BLOCK_PTR
->prev_bb
);
5440 /* Copy the PHI nodes. We ignore PHI node arguments here because
5441 the incoming edges have not been setup yet. */
5442 for (gsi
= gsi_start (phis
); !gsi_end_p (gsi
); gsi_next (&gsi
))
5444 phi
= gsi_stmt (gsi
);
5445 copy
= create_phi_node (NULL_TREE
, new_bb
);
5446 create_new_def_for (gimple_phi_result (phi
), copy
,
5447 gimple_phi_result_ptr (copy
));
5448 gimple_set_uid (copy
, gimple_uid (phi
));
5451 gsi_tgt
= gsi_start_bb (new_bb
);
5452 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
5454 def_operand_p def_p
;
5455 ssa_op_iter op_iter
;
5458 stmt
= gsi_stmt (gsi
);
5459 if (gimple_code (stmt
) == GIMPLE_LABEL
)
5462 /* Don't duplicate label debug stmts. */
5463 if (gimple_debug_bind_p (stmt
)
5464 && TREE_CODE (gimple_debug_bind_get_var (stmt
))
5468 /* Create a new copy of STMT and duplicate STMT's virtual
5470 copy
= gimple_copy (stmt
);
5471 gsi_insert_after (&gsi_tgt
, copy
, GSI_NEW_STMT
);
5473 maybe_duplicate_eh_stmt (copy
, stmt
);
5474 gimple_duplicate_stmt_histograms (cfun
, copy
, cfun
, stmt
);
5476 /* When copying around a stmt writing into a local non-user
5477 aggregate, make sure it won't share stack slot with other
5479 lhs
= gimple_get_lhs (stmt
);
5480 if (lhs
&& TREE_CODE (lhs
) != SSA_NAME
)
5482 tree base
= get_base_address (lhs
);
5484 && (TREE_CODE (base
) == VAR_DECL
5485 || TREE_CODE (base
) == RESULT_DECL
)
5486 && DECL_IGNORED_P (base
)
5487 && !TREE_STATIC (base
)
5488 && !DECL_EXTERNAL (base
)
5489 && (TREE_CODE (base
) != VAR_DECL
5490 || !DECL_HAS_VALUE_EXPR_P (base
)))
5491 DECL_NONSHAREABLE (base
) = 1;
5494 /* Create new names for all the definitions created by COPY and
5495 add replacement mappings for each new name. */
5496 FOR_EACH_SSA_DEF_OPERAND (def_p
, copy
, op_iter
, SSA_OP_ALL_DEFS
)
5497 create_new_def_for (DEF_FROM_PTR (def_p
), copy
, def_p
);
5503 /* Adds phi node arguments for edge E_COPY after basic block duplication. */
5506 add_phi_args_after_copy_edge (edge e_copy
)
5508 basic_block bb
, bb_copy
= e_copy
->src
, dest
;
5511 gimple phi
, phi_copy
;
5513 gimple_stmt_iterator psi
, psi_copy
;
5515 if (gimple_seq_empty_p (phi_nodes (e_copy
->dest
)))
5518 bb
= bb_copy
->flags
& BB_DUPLICATED
? get_bb_original (bb_copy
) : bb_copy
;
5520 if (e_copy
->dest
->flags
& BB_DUPLICATED
)
5521 dest
= get_bb_original (e_copy
->dest
);
5523 dest
= e_copy
->dest
;
5525 e
= find_edge (bb
, dest
);
5528 /* During loop unrolling the target of the latch edge is copied.
5529 In this case we are not looking for edge to dest, but to
5530 duplicated block whose original was dest. */
5531 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
5533 if ((e
->dest
->flags
& BB_DUPLICATED
)
5534 && get_bb_original (e
->dest
) == dest
)
5538 gcc_assert (e
!= NULL
);
5541 for (psi
= gsi_start_phis (e
->dest
),
5542 psi_copy
= gsi_start_phis (e_copy
->dest
);
5544 gsi_next (&psi
), gsi_next (&psi_copy
))
5546 phi
= gsi_stmt (psi
);
5547 phi_copy
= gsi_stmt (psi_copy
);
5548 def
= PHI_ARG_DEF_FROM_EDGE (phi
, e
);
5549 add_phi_arg (phi_copy
, def
, e_copy
,
5550 gimple_phi_arg_location_from_edge (phi
, e
));
5555 /* Basic block BB_COPY was created by code duplication. Add phi node
5556 arguments for edges going out of BB_COPY. The blocks that were
5557 duplicated have BB_DUPLICATED set. */
5560 add_phi_args_after_copy_bb (basic_block bb_copy
)
5565 FOR_EACH_EDGE (e_copy
, ei
, bb_copy
->succs
)
5567 add_phi_args_after_copy_edge (e_copy
);
5571 /* Blocks in REGION_COPY array of length N_REGION were created by
5572 duplication of basic blocks. Add phi node arguments for edges
5573 going from these blocks. If E_COPY is not NULL, also add
5574 phi node arguments for its destination.*/
5577 add_phi_args_after_copy (basic_block
*region_copy
, unsigned n_region
,
5582 for (i
= 0; i
< n_region
; i
++)
5583 region_copy
[i
]->flags
|= BB_DUPLICATED
;
5585 for (i
= 0; i
< n_region
; i
++)
5586 add_phi_args_after_copy_bb (region_copy
[i
]);
5588 add_phi_args_after_copy_edge (e_copy
);
5590 for (i
= 0; i
< n_region
; i
++)
5591 region_copy
[i
]->flags
&= ~BB_DUPLICATED
;
5594 /* Duplicates a REGION (set of N_REGION basic blocks) with just a single
5595 important exit edge EXIT. By important we mean that no SSA name defined
5596 inside region is live over the other exit edges of the region. All entry
5597 edges to the region must go to ENTRY->dest. The edge ENTRY is redirected
5598 to the duplicate of the region. Dominance and loop information is
5599 updated if UPDATE_DOMINANCE is true, but not the SSA web. If
5600 UPDATE_DOMINANCE is false then we assume that the caller will update the
5601 dominance information after calling this function. The new basic
5602 blocks are stored to REGION_COPY in the same order as they had in REGION,
5603 provided that REGION_COPY is not NULL.
5604 The function returns false if it is unable to copy the region,
5608 gimple_duplicate_sese_region (edge entry
, edge exit
,
5609 basic_block
*region
, unsigned n_region
,
5610 basic_block
*region_copy
,
5611 bool update_dominance
)
5614 bool free_region_copy
= false, copying_header
= false;
5615 struct loop
*loop
= entry
->dest
->loop_father
;
5617 vec
<basic_block
> doms
;
5619 int total_freq
= 0, entry_freq
= 0;
5620 gcov_type total_count
= 0, entry_count
= 0;
5622 if (!can_copy_bbs_p (region
, n_region
))
5625 /* Some sanity checking. Note that we do not check for all possible
5626 missuses of the functions. I.e. if you ask to copy something weird,
5627 it will work, but the state of structures probably will not be
5629 for (i
= 0; i
< n_region
; i
++)
5631 /* We do not handle subloops, i.e. all the blocks must belong to the
5633 if (region
[i
]->loop_father
!= loop
)
5636 if (region
[i
] != entry
->dest
5637 && region
[i
] == loop
->header
)
5641 set_loop_copy (loop
, loop
);
5643 /* In case the function is used for loop header copying (which is the primary
5644 use), ensure that EXIT and its copy will be new latch and entry edges. */
5645 if (loop
->header
== entry
->dest
)
5647 copying_header
= true;
5648 set_loop_copy (loop
, loop_outer (loop
));
5650 if (!dominated_by_p (CDI_DOMINATORS
, loop
->latch
, exit
->src
))
5653 for (i
= 0; i
< n_region
; i
++)
5654 if (region
[i
] != exit
->src
5655 && dominated_by_p (CDI_DOMINATORS
, region
[i
], exit
->src
))
5661 region_copy
= XNEWVEC (basic_block
, n_region
);
5662 free_region_copy
= true;
5665 initialize_original_copy_tables ();
5667 /* Record blocks outside the region that are dominated by something
5669 if (update_dominance
)
5672 doms
= get_dominated_by_region (CDI_DOMINATORS
, region
, n_region
);
5675 if (entry
->dest
->count
)
5677 total_count
= entry
->dest
->count
;
5678 entry_count
= entry
->count
;
5679 /* Fix up corner cases, to avoid division by zero or creation of negative
5681 if (entry_count
> total_count
)
5682 entry_count
= total_count
;
5686 total_freq
= entry
->dest
->frequency
;
5687 entry_freq
= EDGE_FREQUENCY (entry
);
5688 /* Fix up corner cases, to avoid division by zero or creation of negative
5690 if (total_freq
== 0)
5692 else if (entry_freq
> total_freq
)
5693 entry_freq
= total_freq
;
5696 copy_bbs (region
, n_region
, region_copy
, &exit
, 1, &exit_copy
, loop
,
5697 split_edge_bb_loc (entry
), update_dominance
);
5700 scale_bbs_frequencies_gcov_type (region
, n_region
,
5701 total_count
- entry_count
,
5703 scale_bbs_frequencies_gcov_type (region_copy
, n_region
, entry_count
,
5708 scale_bbs_frequencies_int (region
, n_region
, total_freq
- entry_freq
,
5710 scale_bbs_frequencies_int (region_copy
, n_region
, entry_freq
, total_freq
);
5715 loop
->header
= exit
->dest
;
5716 loop
->latch
= exit
->src
;
5719 /* Redirect the entry and add the phi node arguments. */
5720 redirected
= redirect_edge_and_branch (entry
, get_bb_copy (entry
->dest
));
5721 gcc_assert (redirected
!= NULL
);
5722 flush_pending_stmts (entry
);
5724 /* Concerning updating of dominators: We must recount dominators
5725 for entry block and its copy. Anything that is outside of the
5726 region, but was dominated by something inside needs recounting as
5728 if (update_dominance
)
5730 set_immediate_dominator (CDI_DOMINATORS
, entry
->dest
, entry
->src
);
5731 doms
.safe_push (get_bb_original (entry
->dest
));
5732 iterate_fix_dominators (CDI_DOMINATORS
, doms
, false);
5736 /* Add the other PHI node arguments. */
5737 add_phi_args_after_copy (region_copy
, n_region
, NULL
);
5739 if (free_region_copy
)
5742 free_original_copy_tables ();
5746 /* Checks if BB is part of the region defined by N_REGION BBS. */
5748 bb_part_of_region_p (basic_block bb
, basic_block
* bbs
, unsigned n_region
)
5752 for (n
= 0; n
< n_region
; n
++)
5760 /* Duplicates REGION consisting of N_REGION blocks. The new blocks
5761 are stored to REGION_COPY in the same order in that they appear
5762 in REGION, if REGION_COPY is not NULL. ENTRY is the entry to
5763 the region, EXIT an exit from it. The condition guarding EXIT
5764 is moved to ENTRY. Returns true if duplication succeeds, false
5790 gimple_duplicate_sese_tail (edge entry ATTRIBUTE_UNUSED
, edge exit ATTRIBUTE_UNUSED
,
5791 basic_block
*region ATTRIBUTE_UNUSED
, unsigned n_region ATTRIBUTE_UNUSED
,
5792 basic_block
*region_copy ATTRIBUTE_UNUSED
)
5795 bool free_region_copy
= false;
5796 struct loop
*loop
= exit
->dest
->loop_father
;
5797 struct loop
*orig_loop
= entry
->dest
->loop_father
;
5798 basic_block switch_bb
, entry_bb
, nentry_bb
;
5799 vec
<basic_block
> doms
;
5800 int total_freq
= 0, exit_freq
= 0;
5801 gcov_type total_count
= 0, exit_count
= 0;
5802 edge exits
[2], nexits
[2], e
;
5803 gimple_stmt_iterator gsi
;
5806 basic_block exit_bb
;
5807 gimple_stmt_iterator psi
;
5810 struct loop
*target
, *aloop
, *cloop
;
5812 gcc_assert (EDGE_COUNT (exit
->src
->succs
) == 2);
5814 exits
[1] = EDGE_SUCC (exit
->src
, EDGE_SUCC (exit
->src
, 0) == exit
);
5816 if (!can_copy_bbs_p (region
, n_region
))
5819 initialize_original_copy_tables ();
5820 set_loop_copy (orig_loop
, loop
);
5823 for (aloop
= orig_loop
->inner
; aloop
; aloop
= aloop
->next
)
5825 if (bb_part_of_region_p (aloop
->header
, region
, n_region
))
5827 cloop
= duplicate_loop (aloop
, target
);
5828 duplicate_subloops (aloop
, cloop
);
5834 region_copy
= XNEWVEC (basic_block
, n_region
);
5835 free_region_copy
= true;
5838 gcc_assert (!need_ssa_update_p (cfun
));
5840 /* Record blocks outside the region that are dominated by something
5842 doms
= get_dominated_by_region (CDI_DOMINATORS
, region
, n_region
);
5844 if (exit
->src
->count
)
5846 total_count
= exit
->src
->count
;
5847 exit_count
= exit
->count
;
5848 /* Fix up corner cases, to avoid division by zero or creation of negative
5850 if (exit_count
> total_count
)
5851 exit_count
= total_count
;
5855 total_freq
= exit
->src
->frequency
;
5856 exit_freq
= EDGE_FREQUENCY (exit
);
5857 /* Fix up corner cases, to avoid division by zero or creation of negative
5859 if (total_freq
== 0)
5861 if (exit_freq
> total_freq
)
5862 exit_freq
= total_freq
;
5865 copy_bbs (region
, n_region
, region_copy
, exits
, 2, nexits
, orig_loop
,
5866 split_edge_bb_loc (exit
), true);
5869 scale_bbs_frequencies_gcov_type (region
, n_region
,
5870 total_count
- exit_count
,
5872 scale_bbs_frequencies_gcov_type (region_copy
, n_region
, exit_count
,
5877 scale_bbs_frequencies_int (region
, n_region
, total_freq
- exit_freq
,
5879 scale_bbs_frequencies_int (region_copy
, n_region
, exit_freq
, total_freq
);
5882 /* Create the switch block, and put the exit condition to it. */
5883 entry_bb
= entry
->dest
;
5884 nentry_bb
= get_bb_copy (entry_bb
);
5885 if (!last_stmt (entry
->src
)
5886 || !stmt_ends_bb_p (last_stmt (entry
->src
)))
5887 switch_bb
= entry
->src
;
5889 switch_bb
= split_edge (entry
);
5890 set_immediate_dominator (CDI_DOMINATORS
, nentry_bb
, switch_bb
);
5892 gsi
= gsi_last_bb (switch_bb
);
5893 cond_stmt
= last_stmt (exit
->src
);
5894 gcc_assert (gimple_code (cond_stmt
) == GIMPLE_COND
);
5895 cond_stmt
= gimple_copy (cond_stmt
);
5897 gsi_insert_after (&gsi
, cond_stmt
, GSI_NEW_STMT
);
5899 sorig
= single_succ_edge (switch_bb
);
5900 sorig
->flags
= exits
[1]->flags
;
5901 snew
= make_edge (switch_bb
, nentry_bb
, exits
[0]->flags
);
5903 /* Register the new edge from SWITCH_BB in loop exit lists. */
5904 rescan_loop_exit (snew
, true, false);
5906 /* Add the PHI node arguments. */
5907 add_phi_args_after_copy (region_copy
, n_region
, snew
);
5909 /* Get rid of now superfluous conditions and associated edges (and phi node
5911 exit_bb
= exit
->dest
;
5913 e
= redirect_edge_and_branch (exits
[0], exits
[1]->dest
);
5914 PENDING_STMT (e
) = NULL
;
5916 /* The latch of ORIG_LOOP was copied, and so was the backedge
5917 to the original header. We redirect this backedge to EXIT_BB. */
5918 for (i
= 0; i
< n_region
; i
++)
5919 if (get_bb_original (region_copy
[i
]) == orig_loop
->latch
)
5921 gcc_assert (single_succ_edge (region_copy
[i
]));
5922 e
= redirect_edge_and_branch (single_succ_edge (region_copy
[i
]), exit_bb
);
5923 PENDING_STMT (e
) = NULL
;
5924 for (psi
= gsi_start_phis (exit_bb
);
5928 phi
= gsi_stmt (psi
);
5929 def
= PHI_ARG_DEF (phi
, nexits
[0]->dest_idx
);
5930 add_phi_arg (phi
, def
, e
, gimple_phi_arg_location_from_edge (phi
, e
));
5933 e
= redirect_edge_and_branch (nexits
[1], nexits
[0]->dest
);
5934 PENDING_STMT (e
) = NULL
;
5936 /* Anything that is outside of the region, but was dominated by something
5937 inside needs to update dominance info. */
5938 iterate_fix_dominators (CDI_DOMINATORS
, doms
, false);
5940 /* Update the SSA web. */
5941 update_ssa (TODO_update_ssa
);
5943 if (free_region_copy
)
5946 free_original_copy_tables ();
5950 /* Add all the blocks dominated by ENTRY to the array BBS_P. Stop
5951 adding blocks when the dominator traversal reaches EXIT. This
5952 function silently assumes that ENTRY strictly dominates EXIT. */
5955 gather_blocks_in_sese_region (basic_block entry
, basic_block exit
,
5956 vec
<basic_block
> *bbs_p
)
5960 for (son
= first_dom_son (CDI_DOMINATORS
, entry
);
5962 son
= next_dom_son (CDI_DOMINATORS
, son
))
5964 bbs_p
->safe_push (son
);
5966 gather_blocks_in_sese_region (son
, exit
, bbs_p
);
5970 /* Replaces *TP with a duplicate (belonging to function TO_CONTEXT).
5971 The duplicates are recorded in VARS_MAP. */
5974 replace_by_duplicate_decl (tree
*tp
, struct pointer_map_t
*vars_map
,
5977 tree t
= *tp
, new_t
;
5978 struct function
*f
= DECL_STRUCT_FUNCTION (to_context
);
5981 if (DECL_CONTEXT (t
) == to_context
)
5984 loc
= pointer_map_contains (vars_map
, t
);
5988 loc
= pointer_map_insert (vars_map
, t
);
5992 new_t
= copy_var_decl (t
, DECL_NAME (t
), TREE_TYPE (t
));
5993 add_local_decl (f
, new_t
);
5997 gcc_assert (TREE_CODE (t
) == CONST_DECL
);
5998 new_t
= copy_node (t
);
6000 DECL_CONTEXT (new_t
) = to_context
;
6005 new_t
= (tree
) *loc
;
6011 /* Creates an ssa name in TO_CONTEXT equivalent to NAME.
6012 VARS_MAP maps old ssa names and var_decls to the new ones. */
6015 replace_ssa_name (tree name
, struct pointer_map_t
*vars_map
,
6021 gcc_assert (!virtual_operand_p (name
));
6023 loc
= pointer_map_contains (vars_map
, name
);
6027 tree decl
= SSA_NAME_VAR (name
);
6030 replace_by_duplicate_decl (&decl
, vars_map
, to_context
);
6031 new_name
= make_ssa_name_fn (DECL_STRUCT_FUNCTION (to_context
),
6032 decl
, SSA_NAME_DEF_STMT (name
));
6033 if (SSA_NAME_IS_DEFAULT_DEF (name
))
6034 set_ssa_default_def (DECL_STRUCT_FUNCTION (to_context
),
6038 new_name
= copy_ssa_name_fn (DECL_STRUCT_FUNCTION (to_context
),
6039 name
, SSA_NAME_DEF_STMT (name
));
6041 loc
= pointer_map_insert (vars_map
, name
);
6045 new_name
= (tree
) *loc
;
6056 struct pointer_map_t
*vars_map
;
6057 htab_t new_label_map
;
6058 struct pointer_map_t
*eh_map
;
6062 /* Helper for move_block_to_fn. Set TREE_BLOCK in every expression
6063 contained in *TP if it has been ORIG_BLOCK previously and change the
6064 DECL_CONTEXT of every local variable referenced in *TP. */
6067 move_stmt_op (tree
*tp
, int *walk_subtrees
, void *data
)
6069 struct walk_stmt_info
*wi
= (struct walk_stmt_info
*) data
;
6070 struct move_stmt_d
*p
= (struct move_stmt_d
*) wi
->info
;
6075 tree block
= TREE_BLOCK (t
);
6076 if (block
== p
->orig_block
6077 || (p
->orig_block
== NULL_TREE
6078 && block
!= NULL_TREE
))
6079 TREE_SET_BLOCK (t
, p
->new_block
);
6080 #ifdef ENABLE_CHECKING
6081 else if (block
!= NULL_TREE
)
6083 while (block
&& TREE_CODE (block
) == BLOCK
&& block
!= p
->orig_block
)
6084 block
= BLOCK_SUPERCONTEXT (block
);
6085 gcc_assert (block
== p
->orig_block
);
6089 else if (DECL_P (t
) || TREE_CODE (t
) == SSA_NAME
)
6091 if (TREE_CODE (t
) == SSA_NAME
)
6092 *tp
= replace_ssa_name (t
, p
->vars_map
, p
->to_context
);
6093 else if (TREE_CODE (t
) == LABEL_DECL
)
6095 if (p
->new_label_map
)
6097 struct tree_map in
, *out
;
6099 out
= (struct tree_map
*)
6100 htab_find_with_hash (p
->new_label_map
, &in
, DECL_UID (t
));
6105 DECL_CONTEXT (t
) = p
->to_context
;
6107 else if (p
->remap_decls_p
)
6109 /* Replace T with its duplicate. T should no longer appear in the
6110 parent function, so this looks wasteful; however, it may appear
6111 in referenced_vars, and more importantly, as virtual operands of
6112 statements, and in alias lists of other variables. It would be
6113 quite difficult to expunge it from all those places. ??? It might
6114 suffice to do this for addressable variables. */
6115 if ((TREE_CODE (t
) == VAR_DECL
6116 && !is_global_var (t
))
6117 || TREE_CODE (t
) == CONST_DECL
)
6118 replace_by_duplicate_decl (tp
, p
->vars_map
, p
->to_context
);
6122 else if (TYPE_P (t
))
6128 /* Helper for move_stmt_r. Given an EH region number for the source
6129 function, map that to the duplicate EH regio number in the dest. */
6132 move_stmt_eh_region_nr (int old_nr
, struct move_stmt_d
*p
)
6134 eh_region old_r
, new_r
;
6137 old_r
= get_eh_region_from_number (old_nr
);
6138 slot
= pointer_map_contains (p
->eh_map
, old_r
);
6139 new_r
= (eh_region
) *slot
;
6141 return new_r
->index
;
6144 /* Similar, but operate on INTEGER_CSTs. */
6147 move_stmt_eh_region_tree_nr (tree old_t_nr
, struct move_stmt_d
*p
)
6151 old_nr
= tree_low_cst (old_t_nr
, 0);
6152 new_nr
= move_stmt_eh_region_nr (old_nr
, p
);
6154 return build_int_cst (integer_type_node
, new_nr
);
6157 /* Like move_stmt_op, but for gimple statements.
6159 Helper for move_block_to_fn. Set GIMPLE_BLOCK in every expression
6160 contained in the current statement in *GSI_P and change the
6161 DECL_CONTEXT of every local variable referenced in the current
6165 move_stmt_r (gimple_stmt_iterator
*gsi_p
, bool *handled_ops_p
,
6166 struct walk_stmt_info
*wi
)
6168 struct move_stmt_d
*p
= (struct move_stmt_d
*) wi
->info
;
6169 gimple stmt
= gsi_stmt (*gsi_p
);
6170 tree block
= gimple_block (stmt
);
6172 if (block
== p
->orig_block
6173 || (p
->orig_block
== NULL_TREE
6174 && block
!= NULL_TREE
))
6175 gimple_set_block (stmt
, p
->new_block
);
6177 switch (gimple_code (stmt
))
6180 /* Remap the region numbers for __builtin_eh_{pointer,filter}. */
6182 tree r
, fndecl
= gimple_call_fndecl (stmt
);
6183 if (fndecl
&& DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
)
6184 switch (DECL_FUNCTION_CODE (fndecl
))
6186 case BUILT_IN_EH_COPY_VALUES
:
6187 r
= gimple_call_arg (stmt
, 1);
6188 r
= move_stmt_eh_region_tree_nr (r
, p
);
6189 gimple_call_set_arg (stmt
, 1, r
);
6192 case BUILT_IN_EH_POINTER
:
6193 case BUILT_IN_EH_FILTER
:
6194 r
= gimple_call_arg (stmt
, 0);
6195 r
= move_stmt_eh_region_tree_nr (r
, p
);
6196 gimple_call_set_arg (stmt
, 0, r
);
6207 int r
= gimple_resx_region (stmt
);
6208 r
= move_stmt_eh_region_nr (r
, p
);
6209 gimple_resx_set_region (stmt
, r
);
6213 case GIMPLE_EH_DISPATCH
:
6215 int r
= gimple_eh_dispatch_region (stmt
);
6216 r
= move_stmt_eh_region_nr (r
, p
);
6217 gimple_eh_dispatch_set_region (stmt
, r
);
6221 case GIMPLE_OMP_RETURN
:
6222 case GIMPLE_OMP_CONTINUE
:
6225 if (is_gimple_omp (stmt
))
6227 /* Do not remap variables inside OMP directives. Variables
6228 referenced in clauses and directive header belong to the
6229 parent function and should not be moved into the child
6231 bool save_remap_decls_p
= p
->remap_decls_p
;
6232 p
->remap_decls_p
= false;
6233 *handled_ops_p
= true;
6235 walk_gimple_seq_mod (gimple_omp_body_ptr (stmt
), move_stmt_r
,
6238 p
->remap_decls_p
= save_remap_decls_p
;
6246 /* Move basic block BB from function CFUN to function DEST_FN. The
6247 block is moved out of the original linked list and placed after
6248 block AFTER in the new list. Also, the block is removed from the
6249 original array of blocks and placed in DEST_FN's array of blocks.
6250 If UPDATE_EDGE_COUNT_P is true, the edge counts on both CFGs is
6251 updated to reflect the moved edges.
6253 The local variables are remapped to new instances, VARS_MAP is used
6254 to record the mapping. */
6257 move_block_to_fn (struct function
*dest_cfun
, basic_block bb
,
6258 basic_block after
, bool update_edge_count_p
,
6259 struct move_stmt_d
*d
)
6261 struct control_flow_graph
*cfg
;
6264 gimple_stmt_iterator si
;
6265 unsigned old_len
, new_len
;
6267 /* Remove BB from dominance structures. */
6268 delete_from_dominance_info (CDI_DOMINATORS
, bb
);
6270 /* Move BB from its current loop to the copy in the new function. */
6273 struct loop
*new_loop
= (struct loop
*)bb
->loop_father
->aux
;
6275 bb
->loop_father
= new_loop
;
6278 /* Link BB to the new linked list. */
6279 move_block_after (bb
, after
);
6281 /* Update the edge count in the corresponding flowgraphs. */
6282 if (update_edge_count_p
)
6283 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
6285 cfun
->cfg
->x_n_edges
--;
6286 dest_cfun
->cfg
->x_n_edges
++;
6289 /* Remove BB from the original basic block array. */
6290 (*cfun
->cfg
->x_basic_block_info
)[bb
->index
] = NULL
;
6291 cfun
->cfg
->x_n_basic_blocks
--;
6293 /* Grow DEST_CFUN's basic block array if needed. */
6294 cfg
= dest_cfun
->cfg
;
6295 cfg
->x_n_basic_blocks
++;
6296 if (bb
->index
>= cfg
->x_last_basic_block
)
6297 cfg
->x_last_basic_block
= bb
->index
+ 1;
6299 old_len
= vec_safe_length (cfg
->x_basic_block_info
);
6300 if ((unsigned) cfg
->x_last_basic_block
>= old_len
)
6302 new_len
= cfg
->x_last_basic_block
+ (cfg
->x_last_basic_block
+ 3) / 4;
6303 vec_safe_grow_cleared (cfg
->x_basic_block_info
, new_len
);
6306 (*cfg
->x_basic_block_info
)[bb
->index
] = bb
;
6308 /* Remap the variables in phi nodes. */
6309 for (si
= gsi_start_phis (bb
); !gsi_end_p (si
); )
6311 gimple phi
= gsi_stmt (si
);
6313 tree op
= PHI_RESULT (phi
);
6317 if (virtual_operand_p (op
))
6319 /* Remove the phi nodes for virtual operands (alias analysis will be
6320 run for the new function, anyway). */
6321 remove_phi_node (&si
, true);
6325 SET_PHI_RESULT (phi
,
6326 replace_ssa_name (op
, d
->vars_map
, dest_cfun
->decl
));
6327 FOR_EACH_PHI_ARG (use
, phi
, oi
, SSA_OP_USE
)
6329 op
= USE_FROM_PTR (use
);
6330 if (TREE_CODE (op
) == SSA_NAME
)
6331 SET_USE (use
, replace_ssa_name (op
, d
->vars_map
, dest_cfun
->decl
));
6334 for (i
= 0; i
< EDGE_COUNT (bb
->preds
); i
++)
6336 location_t locus
= gimple_phi_arg_location (phi
, i
);
6337 tree block
= LOCATION_BLOCK (locus
);
6339 if (locus
== UNKNOWN_LOCATION
)
6341 if (d
->orig_block
== NULL_TREE
|| block
== d
->orig_block
)
6343 if (d
->new_block
== NULL_TREE
)
6344 locus
= LOCATION_LOCUS (locus
);
6346 locus
= COMBINE_LOCATION_DATA (line_table
, locus
, d
->new_block
);
6347 gimple_phi_arg_set_location (phi
, i
, locus
);
6354 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
6356 gimple stmt
= gsi_stmt (si
);
6357 struct walk_stmt_info wi
;
6359 memset (&wi
, 0, sizeof (wi
));
6361 walk_gimple_stmt (&si
, move_stmt_r
, move_stmt_op
, &wi
);
6363 if (gimple_code (stmt
) == GIMPLE_LABEL
)
6365 tree label
= gimple_label_label (stmt
);
6366 int uid
= LABEL_DECL_UID (label
);
6368 gcc_assert (uid
> -1);
6370 old_len
= vec_safe_length (cfg
->x_label_to_block_map
);
6371 if (old_len
<= (unsigned) uid
)
6373 new_len
= 3 * uid
/ 2 + 1;
6374 vec_safe_grow_cleared (cfg
->x_label_to_block_map
, new_len
);
6377 (*cfg
->x_label_to_block_map
)[uid
] = bb
;
6378 (*cfun
->cfg
->x_label_to_block_map
)[uid
] = NULL
;
6380 gcc_assert (DECL_CONTEXT (label
) == dest_cfun
->decl
);
6382 if (uid
>= dest_cfun
->cfg
->last_label_uid
)
6383 dest_cfun
->cfg
->last_label_uid
= uid
+ 1;
6386 maybe_duplicate_eh_stmt_fn (dest_cfun
, stmt
, cfun
, stmt
, d
->eh_map
, 0);
6387 remove_stmt_from_eh_lp_fn (cfun
, stmt
);
6389 gimple_duplicate_stmt_histograms (dest_cfun
, stmt
, cfun
, stmt
);
6390 gimple_remove_stmt_histograms (cfun
, stmt
);
6392 /* We cannot leave any operands allocated from the operand caches of
6393 the current function. */
6394 free_stmt_operands (stmt
);
6395 push_cfun (dest_cfun
);
6400 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
6401 if (e
->goto_locus
!= UNKNOWN_LOCATION
)
6403 tree block
= LOCATION_BLOCK (e
->goto_locus
);
6404 if (d
->orig_block
== NULL_TREE
6405 || block
== d
->orig_block
)
6406 e
->goto_locus
= d
->new_block
?
6407 COMBINE_LOCATION_DATA (line_table
, e
->goto_locus
, d
->new_block
) :
6408 LOCATION_LOCUS (e
->goto_locus
);
6412 /* Examine the statements in BB (which is in SRC_CFUN); find and return
6413 the outermost EH region. Use REGION as the incoming base EH region. */
6416 find_outermost_region_in_block (struct function
*src_cfun
,
6417 basic_block bb
, eh_region region
)
6419 gimple_stmt_iterator si
;
6421 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
6423 gimple stmt
= gsi_stmt (si
);
6424 eh_region stmt_region
;
6427 lp_nr
= lookup_stmt_eh_lp_fn (src_cfun
, stmt
);
6428 stmt_region
= get_eh_region_from_lp_number_fn (src_cfun
, lp_nr
);
6432 region
= stmt_region
;
6433 else if (stmt_region
!= region
)
6435 region
= eh_region_outermost (src_cfun
, stmt_region
, region
);
6436 gcc_assert (region
!= NULL
);
6445 new_label_mapper (tree decl
, void *data
)
6447 htab_t hash
= (htab_t
) data
;
6451 gcc_assert (TREE_CODE (decl
) == LABEL_DECL
);
6453 m
= XNEW (struct tree_map
);
6454 m
->hash
= DECL_UID (decl
);
6455 m
->base
.from
= decl
;
6456 m
->to
= create_artificial_label (UNKNOWN_LOCATION
);
6457 LABEL_DECL_UID (m
->to
) = LABEL_DECL_UID (decl
);
6458 if (LABEL_DECL_UID (m
->to
) >= cfun
->cfg
->last_label_uid
)
6459 cfun
->cfg
->last_label_uid
= LABEL_DECL_UID (m
->to
) + 1;
6461 slot
= htab_find_slot_with_hash (hash
, m
, m
->hash
, INSERT
);
6462 gcc_assert (*slot
== NULL
);
6469 /* Change DECL_CONTEXT of all BLOCK_VARS in block, including
6473 replace_block_vars_by_duplicates (tree block
, struct pointer_map_t
*vars_map
,
6478 for (tp
= &BLOCK_VARS (block
); *tp
; tp
= &DECL_CHAIN (*tp
))
6481 if (TREE_CODE (t
) != VAR_DECL
&& TREE_CODE (t
) != CONST_DECL
)
6483 replace_by_duplicate_decl (&t
, vars_map
, to_context
);
6486 if (TREE_CODE (*tp
) == VAR_DECL
&& DECL_HAS_VALUE_EXPR_P (*tp
))
6488 SET_DECL_VALUE_EXPR (t
, DECL_VALUE_EXPR (*tp
));
6489 DECL_HAS_VALUE_EXPR_P (t
) = 1;
6491 DECL_CHAIN (t
) = DECL_CHAIN (*tp
);
6496 for (block
= BLOCK_SUBBLOCKS (block
); block
; block
= BLOCK_CHAIN (block
))
6497 replace_block_vars_by_duplicates (block
, vars_map
, to_context
);
6500 /* Fixup the loop arrays and numbers after moving LOOP and its subloops
6504 fixup_loop_arrays_after_move (struct function
*fn1
, struct function
*fn2
,
6507 /* Discard it from the old loop array. */
6508 (*get_loops (fn1
))[loop
->num
] = NULL
;
6510 /* Place it in the new loop array, assigning it a new number. */
6511 loop
->num
= number_of_loops (fn2
);
6512 vec_safe_push (loops_for_fn (fn2
)->larray
, loop
);
6514 /* Recurse to children. */
6515 for (loop
= loop
->inner
; loop
; loop
= loop
->next
)
6516 fixup_loop_arrays_after_move (fn1
, fn2
, loop
);
6519 /* Move a single-entry, single-exit region delimited by ENTRY_BB and
6520 EXIT_BB to function DEST_CFUN. The whole region is replaced by a
6521 single basic block in the original CFG and the new basic block is
6522 returned. DEST_CFUN must not have a CFG yet.
6524 Note that the region need not be a pure SESE region. Blocks inside
6525 the region may contain calls to abort/exit. The only restriction
6526 is that ENTRY_BB should be the only entry point and it must
6529 Change TREE_BLOCK of all statements in ORIG_BLOCK to the new
6530 functions outermost BLOCK, move all subblocks of ORIG_BLOCK
6531 to the new function.
6533 All local variables referenced in the region are assumed to be in
6534 the corresponding BLOCK_VARS and unexpanded variable lists
6535 associated with DEST_CFUN. */
6538 move_sese_region_to_fn (struct function
*dest_cfun
, basic_block entry_bb
,
6539 basic_block exit_bb
, tree orig_block
)
6541 vec
<basic_block
> bbs
, dom_bbs
;
6542 basic_block dom_entry
= get_immediate_dominator (CDI_DOMINATORS
, entry_bb
);
6543 basic_block after
, bb
, *entry_pred
, *exit_succ
, abb
;
6544 struct function
*saved_cfun
= cfun
;
6545 int *entry_flag
, *exit_flag
;
6546 unsigned *entry_prob
, *exit_prob
;
6547 unsigned i
, num_entry_edges
, num_exit_edges
, num_nodes
;
6550 htab_t new_label_map
;
6551 struct pointer_map_t
*vars_map
, *eh_map
;
6552 struct loop
*loop
= entry_bb
->loop_father
;
6553 struct loop
*loop0
= get_loop (saved_cfun
, 0);
6554 struct move_stmt_d d
;
6556 /* If ENTRY does not strictly dominate EXIT, this cannot be an SESE
6558 gcc_assert (entry_bb
!= exit_bb
6560 || dominated_by_p (CDI_DOMINATORS
, exit_bb
, entry_bb
)));
6562 /* Collect all the blocks in the region. Manually add ENTRY_BB
6563 because it won't be added by dfs_enumerate_from. */
6565 bbs
.safe_push (entry_bb
);
6566 gather_blocks_in_sese_region (entry_bb
, exit_bb
, &bbs
);
6568 /* The blocks that used to be dominated by something in BBS will now be
6569 dominated by the new block. */
6570 dom_bbs
= get_dominated_by_region (CDI_DOMINATORS
,
6574 /* Detach ENTRY_BB and EXIT_BB from CFUN->CFG. We need to remember
6575 the predecessor edges to ENTRY_BB and the successor edges to
6576 EXIT_BB so that we can re-attach them to the new basic block that
6577 will replace the region. */
6578 num_entry_edges
= EDGE_COUNT (entry_bb
->preds
);
6579 entry_pred
= XNEWVEC (basic_block
, num_entry_edges
);
6580 entry_flag
= XNEWVEC (int, num_entry_edges
);
6581 entry_prob
= XNEWVEC (unsigned, num_entry_edges
);
6583 for (ei
= ei_start (entry_bb
->preds
); (e
= ei_safe_edge (ei
)) != NULL
;)
6585 entry_prob
[i
] = e
->probability
;
6586 entry_flag
[i
] = e
->flags
;
6587 entry_pred
[i
++] = e
->src
;
6593 num_exit_edges
= EDGE_COUNT (exit_bb
->succs
);
6594 exit_succ
= XNEWVEC (basic_block
, num_exit_edges
);
6595 exit_flag
= XNEWVEC (int, num_exit_edges
);
6596 exit_prob
= XNEWVEC (unsigned, num_exit_edges
);
6598 for (ei
= ei_start (exit_bb
->succs
); (e
= ei_safe_edge (ei
)) != NULL
;)
6600 exit_prob
[i
] = e
->probability
;
6601 exit_flag
[i
] = e
->flags
;
6602 exit_succ
[i
++] = e
->dest
;
6614 /* Switch context to the child function to initialize DEST_FN's CFG. */
6615 gcc_assert (dest_cfun
->cfg
== NULL
);
6616 push_cfun (dest_cfun
);
6618 init_empty_tree_cfg ();
6620 /* Initialize EH information for the new function. */
6622 new_label_map
= NULL
;
6625 eh_region region
= NULL
;
6627 FOR_EACH_VEC_ELT (bbs
, i
, bb
)
6628 region
= find_outermost_region_in_block (saved_cfun
, bb
, region
);
6630 init_eh_for_function ();
6633 new_label_map
= htab_create (17, tree_map_hash
, tree_map_eq
, free
);
6634 eh_map
= duplicate_eh_regions (saved_cfun
, region
, 0,
6635 new_label_mapper
, new_label_map
);
6639 /* Initialize an empty loop tree. */
6640 struct loops
*loops
= ggc_alloc_cleared_loops ();
6641 init_loops_structure (dest_cfun
, loops
, 1);
6642 loops
->state
= LOOPS_MAY_HAVE_MULTIPLE_LATCHES
;
6643 set_loops_for_fn (dest_cfun
, loops
);
6645 /* Move the outlined loop tree part. */
6646 num_nodes
= bbs
.length ();
6647 FOR_EACH_VEC_ELT (bbs
, i
, bb
)
6649 if (bb
->loop_father
->header
== bb
)
6651 struct loop
*this_loop
= bb
->loop_father
;
6652 struct loop
*outer
= loop_outer (this_loop
);
6654 /* If the SESE region contains some bbs ending with
6655 a noreturn call, those are considered to belong
6656 to the outermost loop in saved_cfun, rather than
6657 the entry_bb's loop_father. */
6661 num_nodes
-= this_loop
->num_nodes
;
6662 flow_loop_tree_node_remove (bb
->loop_father
);
6663 flow_loop_tree_node_add (get_loop (dest_cfun
, 0), this_loop
);
6664 fixup_loop_arrays_after_move (saved_cfun
, cfun
, this_loop
);
6667 else if (bb
->loop_father
== loop0
&& loop0
!= loop
)
6670 /* Remove loop exits from the outlined region. */
6671 if (loops_for_fn (saved_cfun
)->exits
)
6672 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
6674 void **slot
= htab_find_slot_with_hash
6675 (loops_for_fn (saved_cfun
)->exits
, e
,
6676 htab_hash_pointer (e
), NO_INSERT
);
6678 htab_clear_slot (loops_for_fn (saved_cfun
)->exits
, slot
);
6683 /* Adjust the number of blocks in the tree root of the outlined part. */
6684 get_loop (dest_cfun
, 0)->num_nodes
= bbs
.length () + 2;
6686 /* Setup a mapping to be used by move_block_to_fn. */
6687 loop
->aux
= current_loops
->tree_root
;
6688 loop0
->aux
= current_loops
->tree_root
;
6692 /* Move blocks from BBS into DEST_CFUN. */
6693 gcc_assert (bbs
.length () >= 2);
6694 after
= dest_cfun
->cfg
->x_entry_block_ptr
;
6695 vars_map
= pointer_map_create ();
6697 memset (&d
, 0, sizeof (d
));
6698 d
.orig_block
= orig_block
;
6699 d
.new_block
= DECL_INITIAL (dest_cfun
->decl
);
6700 d
.from_context
= cfun
->decl
;
6701 d
.to_context
= dest_cfun
->decl
;
6702 d
.vars_map
= vars_map
;
6703 d
.new_label_map
= new_label_map
;
6705 d
.remap_decls_p
= true;
6707 FOR_EACH_VEC_ELT (bbs
, i
, bb
)
6709 /* No need to update edge counts on the last block. It has
6710 already been updated earlier when we detached the region from
6711 the original CFG. */
6712 move_block_to_fn (dest_cfun
, bb
, after
, bb
!= exit_bb
, &d
);
6718 /* Loop sizes are no longer correct, fix them up. */
6719 loop
->num_nodes
-= num_nodes
;
6720 for (struct loop
*outer
= loop_outer (loop
);
6721 outer
; outer
= loop_outer (outer
))
6722 outer
->num_nodes
-= num_nodes
;
6723 loop0
->num_nodes
-= bbs
.length () - num_nodes
;
6725 if (saved_cfun
->has_simduid_loops
|| saved_cfun
->has_force_vect_loops
)
6728 for (i
= 0; vec_safe_iterate (loops
->larray
, i
, &aloop
); i
++)
6733 replace_by_duplicate_decl (&aloop
->simduid
, d
.vars_map
,
6735 dest_cfun
->has_simduid_loops
= true;
6737 if (aloop
->force_vect
)
6738 dest_cfun
->has_force_vect_loops
= true;
6742 /* Rewire BLOCK_SUBBLOCKS of orig_block. */
6746 gcc_assert (BLOCK_SUBBLOCKS (DECL_INITIAL (dest_cfun
->decl
))
6748 BLOCK_SUBBLOCKS (DECL_INITIAL (dest_cfun
->decl
))
6749 = BLOCK_SUBBLOCKS (orig_block
);
6750 for (block
= BLOCK_SUBBLOCKS (orig_block
);
6751 block
; block
= BLOCK_CHAIN (block
))
6752 BLOCK_SUPERCONTEXT (block
) = DECL_INITIAL (dest_cfun
->decl
);
6753 BLOCK_SUBBLOCKS (orig_block
) = NULL_TREE
;
6756 replace_block_vars_by_duplicates (DECL_INITIAL (dest_cfun
->decl
),
6757 vars_map
, dest_cfun
->decl
);
6760 htab_delete (new_label_map
);
6762 pointer_map_destroy (eh_map
);
6763 pointer_map_destroy (vars_map
);
6765 /* Rewire the entry and exit blocks. The successor to the entry
6766 block turns into the successor of DEST_FN's ENTRY_BLOCK_PTR in
6767 the child function. Similarly, the predecessor of DEST_FN's
6768 EXIT_BLOCK_PTR turns into the predecessor of EXIT_BLOCK_PTR. We
6769 need to switch CFUN between DEST_CFUN and SAVED_CFUN so that the
6770 various CFG manipulation function get to the right CFG.
6772 FIXME, this is silly. The CFG ought to become a parameter to
6774 push_cfun (dest_cfun
);
6775 make_edge (ENTRY_BLOCK_PTR
, entry_bb
, EDGE_FALLTHRU
);
6777 make_edge (exit_bb
, EXIT_BLOCK_PTR
, 0);
6780 /* Back in the original function, the SESE region has disappeared,
6781 create a new basic block in its place. */
6782 bb
= create_empty_bb (entry_pred
[0]);
6784 add_bb_to_loop (bb
, loop
);
6785 for (i
= 0; i
< num_entry_edges
; i
++)
6787 e
= make_edge (entry_pred
[i
], bb
, entry_flag
[i
]);
6788 e
->probability
= entry_prob
[i
];
6791 for (i
= 0; i
< num_exit_edges
; i
++)
6793 e
= make_edge (bb
, exit_succ
[i
], exit_flag
[i
]);
6794 e
->probability
= exit_prob
[i
];
6797 set_immediate_dominator (CDI_DOMINATORS
, bb
, dom_entry
);
6798 FOR_EACH_VEC_ELT (dom_bbs
, i
, abb
)
6799 set_immediate_dominator (CDI_DOMINATORS
, abb
, bb
);
6817 /* Dump FUNCTION_DECL FN to file FILE using FLAGS (see TDF_* in dumpfile.h)
6821 dump_function_to_file (tree fndecl
, FILE *file
, int flags
)
6823 tree arg
, var
, old_current_fndecl
= current_function_decl
;
6824 struct function
*dsf
;
6825 bool ignore_topmost_bind
= false, any_var
= false;
6828 bool tmclone
= (TREE_CODE (fndecl
) == FUNCTION_DECL
6829 && decl_is_tm_clone (fndecl
));
6830 struct function
*fun
= DECL_STRUCT_FUNCTION (fndecl
);
6832 current_function_decl
= fndecl
;
6833 fprintf (file
, "%s %s(", function_name (fun
), tmclone
? "[tm-clone] " : "");
6835 arg
= DECL_ARGUMENTS (fndecl
);
6838 print_generic_expr (file
, TREE_TYPE (arg
), dump_flags
);
6839 fprintf (file
, " ");
6840 print_generic_expr (file
, arg
, dump_flags
);
6841 if (flags
& TDF_VERBOSE
)
6842 print_node (file
, "", arg
, 4);
6843 if (DECL_CHAIN (arg
))
6844 fprintf (file
, ", ");
6845 arg
= DECL_CHAIN (arg
);
6847 fprintf (file
, ")\n");
6849 if (flags
& TDF_VERBOSE
)
6850 print_node (file
, "", fndecl
, 2);
6852 dsf
= DECL_STRUCT_FUNCTION (fndecl
);
6853 if (dsf
&& (flags
& TDF_EH
))
6854 dump_eh_tree (file
, dsf
);
6856 if (flags
& TDF_RAW
&& !gimple_has_body_p (fndecl
))
6858 dump_node (fndecl
, TDF_SLIM
| flags
, file
);
6859 current_function_decl
= old_current_fndecl
;
6863 /* When GIMPLE is lowered, the variables are no longer available in
6864 BIND_EXPRs, so display them separately. */
6865 if (fun
&& fun
->decl
== fndecl
&& (fun
->curr_properties
& PROP_gimple_lcf
))
6868 ignore_topmost_bind
= true;
6870 fprintf (file
, "{\n");
6871 if (!vec_safe_is_empty (fun
->local_decls
))
6872 FOR_EACH_LOCAL_DECL (fun
, ix
, var
)
6874 print_generic_decl (file
, var
, flags
);
6875 if (flags
& TDF_VERBOSE
)
6876 print_node (file
, "", var
, 4);
6877 fprintf (file
, "\n");
6881 if (gimple_in_ssa_p (cfun
))
6882 for (ix
= 1; ix
< num_ssa_names
; ++ix
)
6884 tree name
= ssa_name (ix
);
6885 if (name
&& !SSA_NAME_VAR (name
))
6887 fprintf (file
, " ");
6888 print_generic_expr (file
, TREE_TYPE (name
), flags
);
6889 fprintf (file
, " ");
6890 print_generic_expr (file
, name
, flags
);
6891 fprintf (file
, ";\n");
6898 if (fun
&& fun
->decl
== fndecl
6900 && basic_block_info_for_function (fun
))
6902 /* If the CFG has been built, emit a CFG-based dump. */
6903 if (!ignore_topmost_bind
)
6904 fprintf (file
, "{\n");
6906 if (any_var
&& n_basic_blocks_for_function (fun
))
6907 fprintf (file
, "\n");
6909 FOR_EACH_BB_FN (bb
, fun
)
6910 dump_bb (file
, bb
, 2, flags
| TDF_COMMENT
);
6912 fprintf (file
, "}\n");
6914 else if (DECL_SAVED_TREE (fndecl
) == NULL
)
6916 /* The function is now in GIMPLE form but the CFG has not been
6917 built yet. Emit the single sequence of GIMPLE statements
6918 that make up its body. */
6919 gimple_seq body
= gimple_body (fndecl
);
6921 if (gimple_seq_first_stmt (body
)
6922 && gimple_seq_first_stmt (body
) == gimple_seq_last_stmt (body
)
6923 && gimple_code (gimple_seq_first_stmt (body
)) == GIMPLE_BIND
)
6924 print_gimple_seq (file
, body
, 0, flags
);
6927 if (!ignore_topmost_bind
)
6928 fprintf (file
, "{\n");
6931 fprintf (file
, "\n");
6933 print_gimple_seq (file
, body
, 2, flags
);
6934 fprintf (file
, "}\n");
6941 /* Make a tree based dump. */
6942 chain
= DECL_SAVED_TREE (fndecl
);
6943 if (chain
&& TREE_CODE (chain
) == BIND_EXPR
)
6945 if (ignore_topmost_bind
)
6947 chain
= BIND_EXPR_BODY (chain
);
6955 if (!ignore_topmost_bind
)
6956 fprintf (file
, "{\n");
6961 fprintf (file
, "\n");
6963 print_generic_stmt_indented (file
, chain
, flags
, indent
);
6964 if (ignore_topmost_bind
)
6965 fprintf (file
, "}\n");
6968 if (flags
& TDF_ENUMERATE_LOCALS
)
6969 dump_enumerated_decls (file
, flags
);
6970 fprintf (file
, "\n\n");
6972 current_function_decl
= old_current_fndecl
;
6975 /* Dump FUNCTION_DECL FN to stderr using FLAGS (see TDF_* in tree.h) */
6978 debug_function (tree fn
, int flags
)
6980 dump_function_to_file (fn
, stderr
, flags
);
6984 /* Print on FILE the indexes for the predecessors of basic_block BB. */
6987 print_pred_bbs (FILE *file
, basic_block bb
)
6992 FOR_EACH_EDGE (e
, ei
, bb
->preds
)
6993 fprintf (file
, "bb_%d ", e
->src
->index
);
6997 /* Print on FILE the indexes for the successors of basic_block BB. */
7000 print_succ_bbs (FILE *file
, basic_block bb
)
7005 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
7006 fprintf (file
, "bb_%d ", e
->dest
->index
);
7009 /* Print to FILE the basic block BB following the VERBOSITY level. */
7012 print_loops_bb (FILE *file
, basic_block bb
, int indent
, int verbosity
)
7014 char *s_indent
= (char *) alloca ((size_t) indent
+ 1);
7015 memset ((void *) s_indent
, ' ', (size_t) indent
);
7016 s_indent
[indent
] = '\0';
7018 /* Print basic_block's header. */
7021 fprintf (file
, "%s bb_%d (preds = {", s_indent
, bb
->index
);
7022 print_pred_bbs (file
, bb
);
7023 fprintf (file
, "}, succs = {");
7024 print_succ_bbs (file
, bb
);
7025 fprintf (file
, "})\n");
7028 /* Print basic_block's body. */
7031 fprintf (file
, "%s {\n", s_indent
);
7032 dump_bb (file
, bb
, indent
+ 4, TDF_VOPS
|TDF_MEMSYMS
);
7033 fprintf (file
, "%s }\n", s_indent
);
7037 static void print_loop_and_siblings (FILE *, struct loop
*, int, int);
7039 /* Pretty print LOOP on FILE, indented INDENT spaces. Following
7040 VERBOSITY level this outputs the contents of the loop, or just its
7044 print_loop (FILE *file
, struct loop
*loop
, int indent
, int verbosity
)
7052 s_indent
= (char *) alloca ((size_t) indent
+ 1);
7053 memset ((void *) s_indent
, ' ', (size_t) indent
);
7054 s_indent
[indent
] = '\0';
7056 /* Print loop's header. */
7057 fprintf (file
, "%sloop_%d (", s_indent
, loop
->num
);
7059 fprintf (file
, "header = %d", loop
->header
->index
);
7062 fprintf (file
, "deleted)\n");
7066 fprintf (file
, ", latch = %d", loop
->latch
->index
);
7068 fprintf (file
, ", multiple latches");
7069 fprintf (file
, ", niter = ");
7070 print_generic_expr (file
, loop
->nb_iterations
, 0);
7072 if (loop
->any_upper_bound
)
7074 fprintf (file
, ", upper_bound = ");
7075 dump_double_int (file
, loop
->nb_iterations_upper_bound
, true);
7078 if (loop
->any_estimate
)
7080 fprintf (file
, ", estimate = ");
7081 dump_double_int (file
, loop
->nb_iterations_estimate
, true);
7083 fprintf (file
, ")\n");
7085 /* Print loop's body. */
7088 fprintf (file
, "%s{\n", s_indent
);
7090 if (bb
->loop_father
== loop
)
7091 print_loops_bb (file
, bb
, indent
, verbosity
);
7093 print_loop_and_siblings (file
, loop
->inner
, indent
+ 2, verbosity
);
7094 fprintf (file
, "%s}\n", s_indent
);
7098 /* Print the LOOP and its sibling loops on FILE, indented INDENT
7099 spaces. Following VERBOSITY level this outputs the contents of the
7100 loop, or just its structure. */
7103 print_loop_and_siblings (FILE *file
, struct loop
*loop
, int indent
,
7109 print_loop (file
, loop
, indent
, verbosity
);
7110 print_loop_and_siblings (file
, loop
->next
, indent
, verbosity
);
7113 /* Follow a CFG edge from the entry point of the program, and on entry
7114 of a loop, pretty print the loop structure on FILE. */
7117 print_loops (FILE *file
, int verbosity
)
7121 bb
= ENTRY_BLOCK_PTR
;
7122 if (bb
&& bb
->loop_father
)
7123 print_loop_and_siblings (file
, bb
->loop_father
, 0, verbosity
);
7129 debug (struct loop
&ref
)
7131 print_loop (stderr
, &ref
, 0, /*verbosity*/0);
7135 debug (struct loop
*ptr
)
7140 fprintf (stderr
, "<nil>\n");
7143 /* Dump a loop verbosely. */
7146 debug_verbose (struct loop
&ref
)
7148 print_loop (stderr
, &ref
, 0, /*verbosity*/3);
7152 debug_verbose (struct loop
*ptr
)
7157 fprintf (stderr
, "<nil>\n");
7161 /* Debugging loops structure at tree level, at some VERBOSITY level. */
7164 debug_loops (int verbosity
)
7166 print_loops (stderr
, verbosity
);
7169 /* Print on stderr the code of LOOP, at some VERBOSITY level. */
7172 debug_loop (struct loop
*loop
, int verbosity
)
7174 print_loop (stderr
, loop
, 0, verbosity
);
7177 /* Print on stderr the code of loop number NUM, at some VERBOSITY
7181 debug_loop_num (unsigned num
, int verbosity
)
7183 debug_loop (get_loop (cfun
, num
), verbosity
);
7186 /* Return true if BB ends with a call, possibly followed by some
7187 instructions that must stay with the call. Return false,
7191 gimple_block_ends_with_call_p (basic_block bb
)
7193 gimple_stmt_iterator gsi
= gsi_last_nondebug_bb (bb
);
7194 return !gsi_end_p (gsi
) && is_gimple_call (gsi_stmt (gsi
));
7198 /* Return true if BB ends with a conditional branch. Return false,
7202 gimple_block_ends_with_condjump_p (const_basic_block bb
)
7204 gimple stmt
= last_stmt (CONST_CAST_BB (bb
));
7205 return (stmt
&& gimple_code (stmt
) == GIMPLE_COND
);
7209 /* Return true if we need to add fake edge to exit at statement T.
7210 Helper function for gimple_flow_call_edges_add. */
7213 need_fake_edge_p (gimple t
)
7215 tree fndecl
= NULL_TREE
;
7218 /* NORETURN and LONGJMP calls already have an edge to exit.
7219 CONST and PURE calls do not need one.
7220 We don't currently check for CONST and PURE here, although
7221 it would be a good idea, because those attributes are
7222 figured out from the RTL in mark_constant_function, and
7223 the counter incrementation code from -fprofile-arcs
7224 leads to different results from -fbranch-probabilities. */
7225 if (is_gimple_call (t
))
7227 fndecl
= gimple_call_fndecl (t
);
7228 call_flags
= gimple_call_flags (t
);
7231 if (is_gimple_call (t
)
7233 && DECL_BUILT_IN (fndecl
)
7234 && (call_flags
& ECF_NOTHROW
)
7235 && !(call_flags
& ECF_RETURNS_TWICE
)
7236 /* fork() doesn't really return twice, but the effect of
7237 wrapping it in __gcov_fork() which calls __gcov_flush()
7238 and clears the counters before forking has the same
7239 effect as returning twice. Force a fake edge. */
7240 && !(DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
7241 && DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_FORK
))
7244 if (is_gimple_call (t
))
7250 if (!(call_flags
& ECF_NORETURN
))
7254 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
7255 if ((e
->flags
& EDGE_FAKE
) == 0)
7259 if (gimple_code (t
) == GIMPLE_ASM
7260 && (gimple_asm_volatile_p (t
) || gimple_asm_input_p (t
)))
7267 /* Add fake edges to the function exit for any non constant and non
7268 noreturn calls (or noreturn calls with EH/abnormal edges),
7269 volatile inline assembly in the bitmap of blocks specified by BLOCKS
7270 or to the whole CFG if BLOCKS is zero. Return the number of blocks
7273 The goal is to expose cases in which entering a basic block does
7274 not imply that all subsequent instructions must be executed. */
7277 gimple_flow_call_edges_add (sbitmap blocks
)
7280 int blocks_split
= 0;
7281 int last_bb
= last_basic_block
;
7282 bool check_last_block
= false;
7284 if (n_basic_blocks
== NUM_FIXED_BLOCKS
)
7288 check_last_block
= true;
7290 check_last_block
= bitmap_bit_p (blocks
, EXIT_BLOCK_PTR
->prev_bb
->index
);
7292 /* In the last basic block, before epilogue generation, there will be
7293 a fallthru edge to EXIT. Special care is required if the last insn
7294 of the last basic block is a call because make_edge folds duplicate
7295 edges, which would result in the fallthru edge also being marked
7296 fake, which would result in the fallthru edge being removed by
7297 remove_fake_edges, which would result in an invalid CFG.
7299 Moreover, we can't elide the outgoing fake edge, since the block
7300 profiler needs to take this into account in order to solve the minimal
7301 spanning tree in the case that the call doesn't return.
7303 Handle this by adding a dummy instruction in a new last basic block. */
7304 if (check_last_block
)
7306 basic_block bb
= EXIT_BLOCK_PTR
->prev_bb
;
7307 gimple_stmt_iterator gsi
= gsi_last_nondebug_bb (bb
);
7310 if (!gsi_end_p (gsi
))
7313 if (t
&& need_fake_edge_p (t
))
7317 e
= find_edge (bb
, EXIT_BLOCK_PTR
);
7320 gsi_insert_on_edge (e
, gimple_build_nop ());
7321 gsi_commit_edge_inserts ();
7326 /* Now add fake edges to the function exit for any non constant
7327 calls since there is no way that we can determine if they will
7329 for (i
= 0; i
< last_bb
; i
++)
7331 basic_block bb
= BASIC_BLOCK (i
);
7332 gimple_stmt_iterator gsi
;
7333 gimple stmt
, last_stmt
;
7338 if (blocks
&& !bitmap_bit_p (blocks
, i
))
7341 gsi
= gsi_last_nondebug_bb (bb
);
7342 if (!gsi_end_p (gsi
))
7344 last_stmt
= gsi_stmt (gsi
);
7347 stmt
= gsi_stmt (gsi
);
7348 if (need_fake_edge_p (stmt
))
7352 /* The handling above of the final block before the
7353 epilogue should be enough to verify that there is
7354 no edge to the exit block in CFG already.
7355 Calling make_edge in such case would cause us to
7356 mark that edge as fake and remove it later. */
7357 #ifdef ENABLE_CHECKING
7358 if (stmt
== last_stmt
)
7360 e
= find_edge (bb
, EXIT_BLOCK_PTR
);
7361 gcc_assert (e
== NULL
);
7365 /* Note that the following may create a new basic block
7366 and renumber the existing basic blocks. */
7367 if (stmt
!= last_stmt
)
7369 e
= split_block (bb
, stmt
);
7373 make_edge (bb
, EXIT_BLOCK_PTR
, EDGE_FAKE
);
7377 while (!gsi_end_p (gsi
));
7382 verify_flow_info ();
7384 return blocks_split
;
7387 /* Removes edge E and all the blocks dominated by it, and updates dominance
7388 information. The IL in E->src needs to be updated separately.
7389 If dominance info is not available, only the edge E is removed.*/
7392 remove_edge_and_dominated_blocks (edge e
)
7394 vec
<basic_block
> bbs_to_remove
= vNULL
;
7395 vec
<basic_block
> bbs_to_fix_dom
= vNULL
;
7399 bool none_removed
= false;
7401 basic_block bb
, dbb
;
7404 if (!dom_info_available_p (CDI_DOMINATORS
))
7410 /* No updating is needed for edges to exit. */
7411 if (e
->dest
== EXIT_BLOCK_PTR
)
7413 if (cfgcleanup_altered_bbs
)
7414 bitmap_set_bit (cfgcleanup_altered_bbs
, e
->src
->index
);
7419 /* First, we find the basic blocks to remove. If E->dest has a predecessor
7420 that is not dominated by E->dest, then this set is empty. Otherwise,
7421 all the basic blocks dominated by E->dest are removed.
7423 Also, to DF_IDOM we store the immediate dominators of the blocks in
7424 the dominance frontier of E (i.e., of the successors of the
7425 removed blocks, if there are any, and of E->dest otherwise). */
7426 FOR_EACH_EDGE (f
, ei
, e
->dest
->preds
)
7431 if (!dominated_by_p (CDI_DOMINATORS
, f
->src
, e
->dest
))
7433 none_removed
= true;
7438 df
= BITMAP_ALLOC (NULL
);
7439 df_idom
= BITMAP_ALLOC (NULL
);
7442 bitmap_set_bit (df_idom
,
7443 get_immediate_dominator (CDI_DOMINATORS
, e
->dest
)->index
);
7446 bbs_to_remove
= get_all_dominated_blocks (CDI_DOMINATORS
, e
->dest
);
7447 FOR_EACH_VEC_ELT (bbs_to_remove
, i
, bb
)
7449 FOR_EACH_EDGE (f
, ei
, bb
->succs
)
7451 if (f
->dest
!= EXIT_BLOCK_PTR
)
7452 bitmap_set_bit (df
, f
->dest
->index
);
7455 FOR_EACH_VEC_ELT (bbs_to_remove
, i
, bb
)
7456 bitmap_clear_bit (df
, bb
->index
);
7458 EXECUTE_IF_SET_IN_BITMAP (df
, 0, i
, bi
)
7460 bb
= BASIC_BLOCK (i
);
7461 bitmap_set_bit (df_idom
,
7462 get_immediate_dominator (CDI_DOMINATORS
, bb
)->index
);
7466 if (cfgcleanup_altered_bbs
)
7468 /* Record the set of the altered basic blocks. */
7469 bitmap_set_bit (cfgcleanup_altered_bbs
, e
->src
->index
);
7470 bitmap_ior_into (cfgcleanup_altered_bbs
, df
);
7473 /* Remove E and the cancelled blocks. */
7478 /* Walk backwards so as to get a chance to substitute all
7479 released DEFs into debug stmts. See
7480 eliminate_unnecessary_stmts() in tree-ssa-dce.c for more
7482 for (i
= bbs_to_remove
.length (); i
-- > 0; )
7483 delete_basic_block (bbs_to_remove
[i
]);
7486 /* Update the dominance information. The immediate dominator may change only
7487 for blocks whose immediate dominator belongs to DF_IDOM:
7489 Suppose that idom(X) = Y before removal of E and idom(X) != Y after the
7490 removal. Let Z the arbitrary block such that idom(Z) = Y and
7491 Z dominates X after the removal. Before removal, there exists a path P
7492 from Y to X that avoids Z. Let F be the last edge on P that is
7493 removed, and let W = F->dest. Before removal, idom(W) = Y (since Y
7494 dominates W, and because of P, Z does not dominate W), and W belongs to
7495 the dominance frontier of E. Therefore, Y belongs to DF_IDOM. */
7496 EXECUTE_IF_SET_IN_BITMAP (df_idom
, 0, i
, bi
)
7498 bb
= BASIC_BLOCK (i
);
7499 for (dbb
= first_dom_son (CDI_DOMINATORS
, bb
);
7501 dbb
= next_dom_son (CDI_DOMINATORS
, dbb
))
7502 bbs_to_fix_dom
.safe_push (dbb
);
7505 iterate_fix_dominators (CDI_DOMINATORS
, bbs_to_fix_dom
, true);
7508 BITMAP_FREE (df_idom
);
7509 bbs_to_remove
.release ();
7510 bbs_to_fix_dom
.release ();
7513 /* Purge dead EH edges from basic block BB. */
7516 gimple_purge_dead_eh_edges (basic_block bb
)
7518 bool changed
= false;
7521 gimple stmt
= last_stmt (bb
);
7523 if (stmt
&& stmt_can_throw_internal (stmt
))
7526 for (ei
= ei_start (bb
->succs
); (e
= ei_safe_edge (ei
)); )
7528 if (e
->flags
& EDGE_EH
)
7530 remove_edge_and_dominated_blocks (e
);
7540 /* Purge dead EH edges from basic block listed in BLOCKS. */
7543 gimple_purge_all_dead_eh_edges (const_bitmap blocks
)
7545 bool changed
= false;
7549 EXECUTE_IF_SET_IN_BITMAP (blocks
, 0, i
, bi
)
7551 basic_block bb
= BASIC_BLOCK (i
);
7553 /* Earlier gimple_purge_dead_eh_edges could have removed
7554 this basic block already. */
7555 gcc_assert (bb
|| changed
);
7557 changed
|= gimple_purge_dead_eh_edges (bb
);
7563 /* Purge dead abnormal call edges from basic block BB. */
7566 gimple_purge_dead_abnormal_call_edges (basic_block bb
)
7568 bool changed
= false;
7571 gimple stmt
= last_stmt (bb
);
7573 if (!cfun
->has_nonlocal_label
7574 && !cfun
->calls_setjmp
)
7577 if (stmt
&& stmt_can_make_abnormal_goto (stmt
))
7580 for (ei
= ei_start (bb
->succs
); (e
= ei_safe_edge (ei
)); )
7582 if (e
->flags
& EDGE_ABNORMAL
)
7584 if (e
->flags
& EDGE_FALLTHRU
)
7585 e
->flags
&= ~EDGE_ABNORMAL
;
7587 remove_edge_and_dominated_blocks (e
);
7597 /* Purge dead abnormal call edges from basic block listed in BLOCKS. */
7600 gimple_purge_all_dead_abnormal_call_edges (const_bitmap blocks
)
7602 bool changed
= false;
7606 EXECUTE_IF_SET_IN_BITMAP (blocks
, 0, i
, bi
)
7608 basic_block bb
= BASIC_BLOCK (i
);
7610 /* Earlier gimple_purge_dead_abnormal_call_edges could have removed
7611 this basic block already. */
7612 gcc_assert (bb
|| changed
);
7614 changed
|= gimple_purge_dead_abnormal_call_edges (bb
);
7620 /* This function is called whenever a new edge is created or
7624 gimple_execute_on_growing_pred (edge e
)
7626 basic_block bb
= e
->dest
;
7628 if (!gimple_seq_empty_p (phi_nodes (bb
)))
7629 reserve_phi_args_for_new_edge (bb
);
7632 /* This function is called immediately before edge E is removed from
7633 the edge vector E->dest->preds. */
7636 gimple_execute_on_shrinking_pred (edge e
)
7638 if (!gimple_seq_empty_p (phi_nodes (e
->dest
)))
7639 remove_phi_args (e
);
7642 /*---------------------------------------------------------------------------
7643 Helper functions for Loop versioning
7644 ---------------------------------------------------------------------------*/
7646 /* Adjust phi nodes for 'first' basic block. 'second' basic block is a copy
7647 of 'first'. Both of them are dominated by 'new_head' basic block. When
7648 'new_head' was created by 'second's incoming edge it received phi arguments
7649 on the edge by split_edge(). Later, additional edge 'e' was created to
7650 connect 'new_head' and 'first'. Now this routine adds phi args on this
7651 additional edge 'e' that new_head to second edge received as part of edge
7655 gimple_lv_adjust_loop_header_phi (basic_block first
, basic_block second
,
7656 basic_block new_head
, edge e
)
7659 gimple_stmt_iterator psi1
, psi2
;
7661 edge e2
= find_edge (new_head
, second
);
7663 /* Because NEW_HEAD has been created by splitting SECOND's incoming
7664 edge, we should always have an edge from NEW_HEAD to SECOND. */
7665 gcc_assert (e2
!= NULL
);
7667 /* Browse all 'second' basic block phi nodes and add phi args to
7668 edge 'e' for 'first' head. PHI args are always in correct order. */
7670 for (psi2
= gsi_start_phis (second
),
7671 psi1
= gsi_start_phis (first
);
7672 !gsi_end_p (psi2
) && !gsi_end_p (psi1
);
7673 gsi_next (&psi2
), gsi_next (&psi1
))
7675 phi1
= gsi_stmt (psi1
);
7676 phi2
= gsi_stmt (psi2
);
7677 def
= PHI_ARG_DEF (phi2
, e2
->dest_idx
);
7678 add_phi_arg (phi1
, def
, e
, gimple_phi_arg_location_from_edge (phi2
, e2
));
7683 /* Adds a if else statement to COND_BB with condition COND_EXPR.
7684 SECOND_HEAD is the destination of the THEN and FIRST_HEAD is
7685 the destination of the ELSE part. */
7688 gimple_lv_add_condition_to_bb (basic_block first_head ATTRIBUTE_UNUSED
,
7689 basic_block second_head ATTRIBUTE_UNUSED
,
7690 basic_block cond_bb
, void *cond_e
)
7692 gimple_stmt_iterator gsi
;
7693 gimple new_cond_expr
;
7694 tree cond_expr
= (tree
) cond_e
;
7697 /* Build new conditional expr */
7698 new_cond_expr
= gimple_build_cond_from_tree (cond_expr
,
7699 NULL_TREE
, NULL_TREE
);
7701 /* Add new cond in cond_bb. */
7702 gsi
= gsi_last_bb (cond_bb
);
7703 gsi_insert_after (&gsi
, new_cond_expr
, GSI_NEW_STMT
);
7705 /* Adjust edges appropriately to connect new head with first head
7706 as well as second head. */
7707 e0
= single_succ_edge (cond_bb
);
7708 e0
->flags
&= ~EDGE_FALLTHRU
;
7709 e0
->flags
|= EDGE_FALSE_VALUE
;
7713 /* Do book-keeping of basic block BB for the profile consistency checker.
7714 If AFTER_PASS is 0, do pre-pass accounting, or if AFTER_PASS is 1
7715 then do post-pass accounting. Store the counting in RECORD. */
7717 gimple_account_profile_record (basic_block bb
, int after_pass
,
7718 struct profile_record
*record
)
7720 gimple_stmt_iterator i
;
7721 for (i
= gsi_start_bb (bb
); !gsi_end_p (i
); gsi_next (&i
))
7723 record
->size
[after_pass
]
7724 += estimate_num_insns (gsi_stmt (i
), &eni_size_weights
);
7725 if (profile_status
== PROFILE_READ
)
7726 record
->time
[after_pass
]
7727 += estimate_num_insns (gsi_stmt (i
),
7728 &eni_time_weights
) * bb
->count
;
7729 else if (profile_status
== PROFILE_GUESSED
)
7730 record
->time
[after_pass
]
7731 += estimate_num_insns (gsi_stmt (i
),
7732 &eni_time_weights
) * bb
->frequency
;
7736 struct cfg_hooks gimple_cfg_hooks
= {
7738 gimple_verify_flow_info
,
7739 gimple_dump_bb
, /* dump_bb */
7740 gimple_dump_bb_for_graph
, /* dump_bb_for_graph */
7741 create_bb
, /* create_basic_block */
7742 gimple_redirect_edge_and_branch
, /* redirect_edge_and_branch */
7743 gimple_redirect_edge_and_branch_force
, /* redirect_edge_and_branch_force */
7744 gimple_can_remove_branch_p
, /* can_remove_branch_p */
7745 remove_bb
, /* delete_basic_block */
7746 gimple_split_block
, /* split_block */
7747 gimple_move_block_after
, /* move_block_after */
7748 gimple_can_merge_blocks_p
, /* can_merge_blocks_p */
7749 gimple_merge_blocks
, /* merge_blocks */
7750 gimple_predict_edge
, /* predict_edge */
7751 gimple_predicted_by_p
, /* predicted_by_p */
7752 gimple_can_duplicate_bb_p
, /* can_duplicate_block_p */
7753 gimple_duplicate_bb
, /* duplicate_block */
7754 gimple_split_edge
, /* split_edge */
7755 gimple_make_forwarder_block
, /* make_forward_block */
7756 NULL
, /* tidy_fallthru_edge */
7757 NULL
, /* force_nonfallthru */
7758 gimple_block_ends_with_call_p
,/* block_ends_with_call_p */
7759 gimple_block_ends_with_condjump_p
, /* block_ends_with_condjump_p */
7760 gimple_flow_call_edges_add
, /* flow_call_edges_add */
7761 gimple_execute_on_growing_pred
, /* execute_on_growing_pred */
7762 gimple_execute_on_shrinking_pred
, /* execute_on_shrinking_pred */
7763 gimple_duplicate_loop_to_header_edge
, /* duplicate loop for trees */
7764 gimple_lv_add_condition_to_bb
, /* lv_add_condition_to_bb */
7765 gimple_lv_adjust_loop_header_phi
, /* lv_adjust_loop_header_phi*/
7766 extract_true_false_edges_from_block
, /* extract_cond_bb_edges */
7767 flush_pending_stmts
, /* flush_pending_stmts */
7768 gimple_empty_block_p
, /* block_empty_p */
7769 gimple_split_block_before_cond_jump
, /* split_block_before_cond_jump */
7770 gimple_account_profile_record
,
7774 /* Split all critical edges. */
7777 split_critical_edges (void)
7783 /* split_edge can redirect edges out of SWITCH_EXPRs, which can get
7784 expensive. So we want to enable recording of edge to CASE_LABEL_EXPR
7785 mappings around the calls to split_edge. */
7786 start_recording_case_labels ();
7789 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
7791 if (EDGE_CRITICAL_P (e
) && !(e
->flags
& EDGE_ABNORMAL
))
7793 /* PRE inserts statements to edges and expects that
7794 since split_critical_edges was done beforehand, committing edge
7795 insertions will not split more edges. In addition to critical
7796 edges we must split edges that have multiple successors and
7797 end by control flow statements, such as RESX.
7798 Go ahead and split them too. This matches the logic in
7799 gimple_find_edge_insert_loc. */
7800 else if ((!single_pred_p (e
->dest
)
7801 || !gimple_seq_empty_p (phi_nodes (e
->dest
))
7802 || e
->dest
== EXIT_BLOCK_PTR
)
7803 && e
->src
!= ENTRY_BLOCK_PTR
7804 && !(e
->flags
& EDGE_ABNORMAL
))
7806 gimple_stmt_iterator gsi
;
7808 gsi
= gsi_last_bb (e
->src
);
7809 if (!gsi_end_p (gsi
)
7810 && stmt_ends_bb_p (gsi_stmt (gsi
))
7811 && (gimple_code (gsi_stmt (gsi
)) != GIMPLE_RETURN
7812 && !gimple_call_builtin_p (gsi_stmt (gsi
),
7818 end_recording_case_labels ();
7824 const pass_data pass_data_split_crit_edges
=
7826 GIMPLE_PASS
, /* type */
7827 "crited", /* name */
7828 OPTGROUP_NONE
, /* optinfo_flags */
7829 false, /* has_gate */
7830 true, /* has_execute */
7831 TV_TREE_SPLIT_EDGES
, /* tv_id */
7832 PROP_cfg
, /* properties_required */
7833 PROP_no_crit_edges
, /* properties_provided */
7834 0, /* properties_destroyed */
7835 0, /* todo_flags_start */
7836 TODO_verify_flow
, /* todo_flags_finish */
7839 class pass_split_crit_edges
: public gimple_opt_pass
7842 pass_split_crit_edges (gcc::context
*ctxt
)
7843 : gimple_opt_pass (pass_data_split_crit_edges
, ctxt
)
7846 /* opt_pass methods: */
7847 unsigned int execute () { return split_critical_edges (); }
7849 opt_pass
* clone () { return new pass_split_crit_edges (m_ctxt
); }
7850 }; // class pass_split_crit_edges
7855 make_pass_split_crit_edges (gcc::context
*ctxt
)
7857 return new pass_split_crit_edges (ctxt
);
7861 /* Build a ternary operation and gimplify it. Emit code before GSI.
7862 Return the gimple_val holding the result. */
7865 gimplify_build3 (gimple_stmt_iterator
*gsi
, enum tree_code code
,
7866 tree type
, tree a
, tree b
, tree c
)
7869 location_t loc
= gimple_location (gsi_stmt (*gsi
));
7871 ret
= fold_build3_loc (loc
, code
, type
, a
, b
, c
);
7874 return force_gimple_operand_gsi (gsi
, ret
, true, NULL
, true,
7878 /* Build a binary operation and gimplify it. Emit code before GSI.
7879 Return the gimple_val holding the result. */
7882 gimplify_build2 (gimple_stmt_iterator
*gsi
, enum tree_code code
,
7883 tree type
, tree a
, tree b
)
7887 ret
= fold_build2_loc (gimple_location (gsi_stmt (*gsi
)), code
, type
, a
, b
);
7890 return force_gimple_operand_gsi (gsi
, ret
, true, NULL
, true,
7894 /* Build a unary operation and gimplify it. Emit code before GSI.
7895 Return the gimple_val holding the result. */
7898 gimplify_build1 (gimple_stmt_iterator
*gsi
, enum tree_code code
, tree type
,
7903 ret
= fold_build1_loc (gimple_location (gsi_stmt (*gsi
)), code
, type
, a
);
7906 return force_gimple_operand_gsi (gsi
, ret
, true, NULL
, true,
7912 /* Emit return warnings. */
7915 execute_warn_function_return (void)
7917 source_location location
;
7922 if (!targetm
.warn_func_return (cfun
->decl
))
7925 /* If we have a path to EXIT, then we do return. */
7926 if (TREE_THIS_VOLATILE (cfun
->decl
)
7927 && EDGE_COUNT (EXIT_BLOCK_PTR
->preds
) > 0)
7929 location
= UNKNOWN_LOCATION
;
7930 FOR_EACH_EDGE (e
, ei
, EXIT_BLOCK_PTR
->preds
)
7932 last
= last_stmt (e
->src
);
7933 if ((gimple_code (last
) == GIMPLE_RETURN
7934 || gimple_call_builtin_p (last
, BUILT_IN_RETURN
))
7935 && (location
= gimple_location (last
)) != UNKNOWN_LOCATION
)
7938 if (location
== UNKNOWN_LOCATION
)
7939 location
= cfun
->function_end_locus
;
7940 warning_at (location
, 0, "%<noreturn%> function does return");
7943 /* If we see "return;" in some basic block, then we do reach the end
7944 without returning a value. */
7945 else if (warn_return_type
7946 && !TREE_NO_WARNING (cfun
->decl
)
7947 && EDGE_COUNT (EXIT_BLOCK_PTR
->preds
) > 0
7948 && !VOID_TYPE_P (TREE_TYPE (TREE_TYPE (cfun
->decl
))))
7950 FOR_EACH_EDGE (e
, ei
, EXIT_BLOCK_PTR
->preds
)
7952 gimple last
= last_stmt (e
->src
);
7953 if (gimple_code (last
) == GIMPLE_RETURN
7954 && gimple_return_retval (last
) == NULL
7955 && !gimple_no_warning_p (last
))
7957 location
= gimple_location (last
);
7958 if (location
== UNKNOWN_LOCATION
)
7959 location
= cfun
->function_end_locus
;
7960 warning_at (location
, OPT_Wreturn_type
, "control reaches end of non-void function");
7961 TREE_NO_WARNING (cfun
->decl
) = 1;
7970 /* Given a basic block B which ends with a conditional and has
7971 precisely two successors, determine which of the edges is taken if
7972 the conditional is true and which is taken if the conditional is
7973 false. Set TRUE_EDGE and FALSE_EDGE appropriately. */
7976 extract_true_false_edges_from_block (basic_block b
,
7980 edge e
= EDGE_SUCC (b
, 0);
7982 if (e
->flags
& EDGE_TRUE_VALUE
)
7985 *false_edge
= EDGE_SUCC (b
, 1);
7990 *true_edge
= EDGE_SUCC (b
, 1);
7996 const pass_data pass_data_warn_function_return
=
7998 GIMPLE_PASS
, /* type */
7999 "*warn_function_return", /* name */
8000 OPTGROUP_NONE
, /* optinfo_flags */
8001 false, /* has_gate */
8002 true, /* has_execute */
8003 TV_NONE
, /* tv_id */
8004 PROP_cfg
, /* properties_required */
8005 0, /* properties_provided */
8006 0, /* properties_destroyed */
8007 0, /* todo_flags_start */
8008 0, /* todo_flags_finish */
8011 class pass_warn_function_return
: public gimple_opt_pass
8014 pass_warn_function_return (gcc::context
*ctxt
)
8015 : gimple_opt_pass (pass_data_warn_function_return
, ctxt
)
8018 /* opt_pass methods: */
8019 unsigned int execute () { return execute_warn_function_return (); }
8021 }; // class pass_warn_function_return
8026 make_pass_warn_function_return (gcc::context
*ctxt
)
8028 return new pass_warn_function_return (ctxt
);
8031 /* Walk a gimplified function and warn for functions whose return value is
8032 ignored and attribute((warn_unused_result)) is set. This is done before
8033 inlining, so we don't have to worry about that. */
8036 do_warn_unused_result (gimple_seq seq
)
8039 gimple_stmt_iterator i
;
8041 for (i
= gsi_start (seq
); !gsi_end_p (i
); gsi_next (&i
))
8043 gimple g
= gsi_stmt (i
);
8045 switch (gimple_code (g
))
8048 do_warn_unused_result (gimple_bind_body (g
));
8051 do_warn_unused_result (gimple_try_eval (g
));
8052 do_warn_unused_result (gimple_try_cleanup (g
));
8055 do_warn_unused_result (gimple_catch_handler (g
));
8057 case GIMPLE_EH_FILTER
:
8058 do_warn_unused_result (gimple_eh_filter_failure (g
));
8062 if (gimple_call_lhs (g
))
8064 if (gimple_call_internal_p (g
))
8067 /* This is a naked call, as opposed to a GIMPLE_CALL with an
8068 LHS. All calls whose value is ignored should be
8069 represented like this. Look for the attribute. */
8070 fdecl
= gimple_call_fndecl (g
);
8071 ftype
= gimple_call_fntype (g
);
8073 if (lookup_attribute ("warn_unused_result", TYPE_ATTRIBUTES (ftype
)))
8075 location_t loc
= gimple_location (g
);
8078 warning_at (loc
, OPT_Wunused_result
,
8079 "ignoring return value of %qD, "
8080 "declared with attribute warn_unused_result",
8083 warning_at (loc
, OPT_Wunused_result
,
8084 "ignoring return value of function "
8085 "declared with attribute warn_unused_result");
8090 /* Not a container, not a call, or a call whose value is used. */
8097 run_warn_unused_result (void)
8099 do_warn_unused_result (gimple_body (current_function_decl
));
8104 gate_warn_unused_result (void)
8106 return flag_warn_unused_result
;
8111 const pass_data pass_data_warn_unused_result
=
8113 GIMPLE_PASS
, /* type */
8114 "*warn_unused_result", /* name */
8115 OPTGROUP_NONE
, /* optinfo_flags */
8116 true, /* has_gate */
8117 true, /* has_execute */
8118 TV_NONE
, /* tv_id */
8119 PROP_gimple_any
, /* properties_required */
8120 0, /* properties_provided */
8121 0, /* properties_destroyed */
8122 0, /* todo_flags_start */
8123 0, /* todo_flags_finish */
8126 class pass_warn_unused_result
: public gimple_opt_pass
8129 pass_warn_unused_result (gcc::context
*ctxt
)
8130 : gimple_opt_pass (pass_data_warn_unused_result
, ctxt
)
8133 /* opt_pass methods: */
8134 bool gate () { return gate_warn_unused_result (); }
8135 unsigned int execute () { return run_warn_unused_result (); }
8137 }; // class pass_warn_unused_result
8142 make_pass_warn_unused_result (gcc::context
*ctxt
)
8144 return new pass_warn_unused_result (ctxt
);
8147 /* IPA passes, compilation of earlier functions or inlining
8148 might have changed some properties, such as marked functions nothrow,
8149 pure, const or noreturn.
8150 Remove redundant edges and basic blocks, and create new ones if necessary.
8152 This pass can't be executed as stand alone pass from pass manager, because
8153 in between inlining and this fixup the verify_flow_info would fail. */
8156 execute_fixup_cfg (void)
8159 gimple_stmt_iterator gsi
;
8160 int todo
= gimple_in_ssa_p (cfun
) ? TODO_verify_ssa
: 0;
8161 gcov_type count_scale
;
8166 = GCOV_COMPUTE_SCALE (cgraph_get_node (current_function_decl
)->count
,
8167 ENTRY_BLOCK_PTR
->count
);
8169 ENTRY_BLOCK_PTR
->count
= cgraph_get_node (current_function_decl
)->count
;
8170 EXIT_BLOCK_PTR
->count
= apply_scale (EXIT_BLOCK_PTR
->count
,
8173 FOR_EACH_EDGE (e
, ei
, ENTRY_BLOCK_PTR
->succs
)
8174 e
->count
= apply_scale (e
->count
, count_scale
);
8178 bb
->count
= apply_scale (bb
->count
, count_scale
);
8179 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
8181 gimple stmt
= gsi_stmt (gsi
);
8182 tree decl
= is_gimple_call (stmt
)
8183 ? gimple_call_fndecl (stmt
)
8187 int flags
= gimple_call_flags (stmt
);
8188 if (flags
& (ECF_CONST
| ECF_PURE
| ECF_LOOPING_CONST_OR_PURE
))
8190 if (gimple_purge_dead_abnormal_call_edges (bb
))
8191 todo
|= TODO_cleanup_cfg
;
8193 if (gimple_in_ssa_p (cfun
))
8195 todo
|= TODO_update_ssa
| TODO_cleanup_cfg
;
8200 if (flags
& ECF_NORETURN
8201 && fixup_noreturn_call (stmt
))
8202 todo
|= TODO_cleanup_cfg
;
8205 if (maybe_clean_eh_stmt (stmt
)
8206 && gimple_purge_dead_eh_edges (bb
))
8207 todo
|= TODO_cleanup_cfg
;
8210 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
8211 e
->count
= apply_scale (e
->count
, count_scale
);
8213 /* If we have a basic block with no successors that does not
8214 end with a control statement or a noreturn call end it with
8215 a call to __builtin_unreachable. This situation can occur
8216 when inlining a noreturn call that does in fact return. */
8217 if (EDGE_COUNT (bb
->succs
) == 0)
8219 gimple stmt
= last_stmt (bb
);
8221 || (!is_ctrl_stmt (stmt
)
8222 && (!is_gimple_call (stmt
)
8223 || (gimple_call_flags (stmt
) & ECF_NORETURN
) == 0)))
8225 stmt
= gimple_build_call
8226 (builtin_decl_implicit (BUILT_IN_UNREACHABLE
), 0);
8227 gimple_stmt_iterator gsi
= gsi_last_bb (bb
);
8228 gsi_insert_after (&gsi
, stmt
, GSI_NEW_STMT
);
8232 if (count_scale
!= REG_BR_PROB_BASE
)
8233 compute_function_frequency ();
8235 /* We just processed all calls. */
8236 if (cfun
->gimple_df
)
8237 vec_free (MODIFIED_NORETURN_CALLS (cfun
));
8239 /* Dump a textual representation of the flowgraph. */
8241 gimple_dump_cfg (dump_file
, dump_flags
);
8244 && (todo
& TODO_cleanup_cfg
))
8245 loops_state_set (LOOPS_NEED_FIXUP
);
8252 const pass_data pass_data_fixup_cfg
=
8254 GIMPLE_PASS
, /* type */
8255 "*free_cfg_annotations", /* name */
8256 OPTGROUP_NONE
, /* optinfo_flags */
8257 false, /* has_gate */
8258 true, /* has_execute */
8259 TV_NONE
, /* tv_id */
8260 PROP_cfg
, /* properties_required */
8261 0, /* properties_provided */
8262 0, /* properties_destroyed */
8263 0, /* todo_flags_start */
8264 0, /* todo_flags_finish */
8267 class pass_fixup_cfg
: public gimple_opt_pass
8270 pass_fixup_cfg (gcc::context
*ctxt
)
8271 : gimple_opt_pass (pass_data_fixup_cfg
, ctxt
)
8274 /* opt_pass methods: */
8275 opt_pass
* clone () { return new pass_fixup_cfg (m_ctxt
); }
8276 unsigned int execute () { return execute_fixup_cfg (); }
8278 }; // class pass_fixup_cfg
8283 make_pass_fixup_cfg (gcc::context
*ctxt
)
8285 return new pass_fixup_cfg (ctxt
);
8288 /* Garbage collection support for edge_def. */
8290 extern void gt_ggc_mx (tree
&);
8291 extern void gt_ggc_mx (gimple
&);
8292 extern void gt_ggc_mx (rtx
&);
8293 extern void gt_ggc_mx (basic_block
&);
8296 gt_ggc_mx (edge_def
*e
)
8298 tree block
= LOCATION_BLOCK (e
->goto_locus
);
8300 gt_ggc_mx (e
->dest
);
8301 if (current_ir_type () == IR_GIMPLE
)
8302 gt_ggc_mx (e
->insns
.g
);
8304 gt_ggc_mx (e
->insns
.r
);
8308 /* PCH support for edge_def. */
8310 extern void gt_pch_nx (tree
&);
8311 extern void gt_pch_nx (gimple
&);
8312 extern void gt_pch_nx (rtx
&);
8313 extern void gt_pch_nx (basic_block
&);
8316 gt_pch_nx (edge_def
*e
)
8318 tree block
= LOCATION_BLOCK (e
->goto_locus
);
8320 gt_pch_nx (e
->dest
);
8321 if (current_ir_type () == IR_GIMPLE
)
8322 gt_pch_nx (e
->insns
.g
);
8324 gt_pch_nx (e
->insns
.r
);
8329 gt_pch_nx (edge_def
*e
, gt_pointer_operator op
, void *cookie
)
8331 tree block
= LOCATION_BLOCK (e
->goto_locus
);
8332 op (&(e
->src
), cookie
);
8333 op (&(e
->dest
), cookie
);
8334 if (current_ir_type () == IR_GIMPLE
)
8335 op (&(e
->insns
.g
), cookie
);
8337 op (&(e
->insns
.r
), cookie
);
8338 op (&(block
), cookie
);