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 /* This file contains functions for building the Control Flow Graph (CFG)
47 for a function tree. */
49 /* Local declarations. */
51 /* Initial capacity for the basic block array. */
52 static const int initial_cfg_capacity
= 20;
54 /* This hash table allows us to efficiently lookup all CASE_LABEL_EXPRs
55 which use a particular edge. The CASE_LABEL_EXPRs are chained together
56 via their CASE_CHAIN field, which we clear after we're done with the
57 hash table to prevent problems with duplication of GIMPLE_SWITCHes.
59 Access to this list of CASE_LABEL_EXPRs allows us to efficiently
60 update the case vector in response to edge redirections.
62 Right now this table is set up and torn down at key points in the
63 compilation process. It would be nice if we could make the table
64 more persistent. The key is getting notification of changes to
65 the CFG (particularly edge removal, creation and redirection). */
67 static struct pointer_map_t
*edge_to_cases
;
69 /* If we record edge_to_cases, this bitmap will hold indexes
70 of basic blocks that end in a GIMPLE_SWITCH which we touched
71 due to edge manipulations. */
73 static bitmap touched_switch_bbs
;
78 long num_merged_labels
;
81 static struct cfg_stats_d cfg_stats
;
83 /* Nonzero if we found a computed goto while building basic blocks. */
84 static bool found_computed_goto
;
86 /* Hash table to store last discriminator assigned for each locus. */
87 struct locus_discrim_map
93 /* Hashtable helpers. */
95 struct locus_discrim_hasher
: typed_free_remove
<locus_discrim_map
>
97 typedef locus_discrim_map value_type
;
98 typedef locus_discrim_map compare_type
;
99 static inline hashval_t
hash (const value_type
*);
100 static inline bool equal (const value_type
*, const compare_type
*);
103 /* Trivial hash function for a location_t. ITEM is a pointer to
104 a hash table entry that maps a location_t to a discriminator. */
107 locus_discrim_hasher::hash (const value_type
*item
)
109 return LOCATION_LINE (item
->locus
);
112 /* Equality function for the locus-to-discriminator map. A and B
113 point to the two hash table entries to compare. */
116 locus_discrim_hasher::equal (const value_type
*a
, const compare_type
*b
)
118 return LOCATION_LINE (a
->locus
) == LOCATION_LINE (b
->locus
);
121 static hash_table
<locus_discrim_hasher
> discriminator_per_locus
;
123 /* Basic blocks and flowgraphs. */
124 static void make_blocks (gimple_seq
);
125 static void factor_computed_gotos (void);
128 static void make_edges (void);
129 static void assign_discriminators (void);
130 static void make_cond_expr_edges (basic_block
);
131 static void make_gimple_switch_edges (basic_block
);
132 static void make_goto_expr_edges (basic_block
);
133 static void make_gimple_asm_edges (basic_block
);
134 static edge
gimple_redirect_edge_and_branch (edge
, basic_block
);
135 static edge
gimple_try_redirect_by_replacing_jump (edge
, basic_block
);
136 static unsigned int split_critical_edges (void);
138 /* Various helpers. */
139 static inline bool stmt_starts_bb_p (gimple
, gimple
);
140 static int gimple_verify_flow_info (void);
141 static void gimple_make_forwarder_block (edge
);
142 static gimple
first_non_label_stmt (basic_block
);
143 static bool verify_gimple_transaction (gimple
);
145 /* Flowgraph optimization and cleanup. */
146 static void gimple_merge_blocks (basic_block
, basic_block
);
147 static bool gimple_can_merge_blocks_p (basic_block
, basic_block
);
148 static void remove_bb (basic_block
);
149 static edge
find_taken_edge_computed_goto (basic_block
, tree
);
150 static edge
find_taken_edge_cond_expr (basic_block
, tree
);
151 static edge
find_taken_edge_switch_expr (basic_block
, tree
);
152 static tree
find_case_label_for_value (gimple
, tree
);
155 init_empty_tree_cfg_for_function (struct function
*fn
)
157 /* Initialize the basic block array. */
159 profile_status_for_function (fn
) = PROFILE_ABSENT
;
160 n_basic_blocks_for_function (fn
) = NUM_FIXED_BLOCKS
;
161 last_basic_block_for_function (fn
) = NUM_FIXED_BLOCKS
;
162 vec_alloc (basic_block_info_for_function (fn
), initial_cfg_capacity
);
163 vec_safe_grow_cleared (basic_block_info_for_function (fn
),
164 initial_cfg_capacity
);
166 /* Build a mapping of labels to their associated blocks. */
167 vec_alloc (label_to_block_map_for_function (fn
), initial_cfg_capacity
);
168 vec_safe_grow_cleared (label_to_block_map_for_function (fn
),
169 initial_cfg_capacity
);
171 SET_BASIC_BLOCK_FOR_FUNCTION (fn
, ENTRY_BLOCK
,
172 ENTRY_BLOCK_PTR_FOR_FUNCTION (fn
));
173 SET_BASIC_BLOCK_FOR_FUNCTION (fn
, EXIT_BLOCK
,
174 EXIT_BLOCK_PTR_FOR_FUNCTION (fn
));
176 ENTRY_BLOCK_PTR_FOR_FUNCTION (fn
)->next_bb
177 = EXIT_BLOCK_PTR_FOR_FUNCTION (fn
);
178 EXIT_BLOCK_PTR_FOR_FUNCTION (fn
)->prev_bb
179 = ENTRY_BLOCK_PTR_FOR_FUNCTION (fn
);
183 init_empty_tree_cfg (void)
185 init_empty_tree_cfg_for_function (cfun
);
188 /*---------------------------------------------------------------------------
190 ---------------------------------------------------------------------------*/
192 /* Entry point to the CFG builder for trees. SEQ is the sequence of
193 statements to be added to the flowgraph. */
196 build_gimple_cfg (gimple_seq seq
)
198 /* Register specific gimple functions. */
199 gimple_register_cfg_hooks ();
201 memset ((void *) &cfg_stats
, 0, sizeof (cfg_stats
));
203 init_empty_tree_cfg ();
205 found_computed_goto
= 0;
208 /* Computed gotos are hell to deal with, especially if there are
209 lots of them with a large number of destinations. So we factor
210 them to a common computed goto location before we build the
211 edge list. After we convert back to normal form, we will un-factor
212 the computed gotos since factoring introduces an unwanted jump. */
213 if (found_computed_goto
)
214 factor_computed_gotos ();
216 /* Make sure there is always at least one block, even if it's empty. */
217 if (n_basic_blocks
== NUM_FIXED_BLOCKS
)
218 create_empty_bb (ENTRY_BLOCK_PTR
);
220 /* Adjust the size of the array. */
221 if (basic_block_info
->length () < (size_t) n_basic_blocks
)
222 vec_safe_grow_cleared (basic_block_info
, n_basic_blocks
);
224 /* To speed up statement iterator walks, we first purge dead labels. */
225 cleanup_dead_labels ();
227 /* Group case nodes to reduce the number of edges.
228 We do this after cleaning up dead labels because otherwise we miss
229 a lot of obvious case merging opportunities. */
230 group_case_labels ();
232 /* Create the edges of the flowgraph. */
233 discriminator_per_locus
.create (13);
235 assign_discriminators ();
236 cleanup_dead_labels ();
237 discriminator_per_locus
.dispose ();
241 execute_build_cfg (void)
243 gimple_seq body
= gimple_body (current_function_decl
);
245 build_gimple_cfg (body
);
246 gimple_set_body (current_function_decl
, NULL
);
247 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
249 fprintf (dump_file
, "Scope blocks:\n");
250 dump_scope_blocks (dump_file
, dump_flags
);
253 loop_optimizer_init (AVOID_CFG_MODIFICATIONS
);
259 const pass_data pass_data_build_cfg
=
261 GIMPLE_PASS
, /* type */
263 OPTGROUP_NONE
, /* optinfo_flags */
264 false, /* has_gate */
265 true, /* has_execute */
266 TV_TREE_CFG
, /* tv_id */
267 PROP_gimple_leh
, /* properties_required */
268 ( PROP_cfg
| PROP_loops
), /* properties_provided */
269 0, /* properties_destroyed */
270 0, /* todo_flags_start */
271 TODO_verify_stmts
, /* todo_flags_finish */
274 class pass_build_cfg
: public gimple_opt_pass
277 pass_build_cfg (gcc::context
*ctxt
)
278 : gimple_opt_pass (pass_data_build_cfg
, ctxt
)
281 /* opt_pass methods: */
282 unsigned int execute () { return execute_build_cfg (); }
284 }; // class pass_build_cfg
289 make_pass_build_cfg (gcc::context
*ctxt
)
291 return new pass_build_cfg (ctxt
);
295 /* Return true if T is a computed goto. */
298 computed_goto_p (gimple t
)
300 return (gimple_code (t
) == GIMPLE_GOTO
301 && TREE_CODE (gimple_goto_dest (t
)) != LABEL_DECL
);
305 /* Search the CFG for any computed gotos. If found, factor them to a
306 common computed goto site. Also record the location of that site so
307 that we can un-factor the gotos after we have converted back to
311 factor_computed_gotos (void)
314 tree factored_label_decl
= NULL
;
316 gimple factored_computed_goto_label
= NULL
;
317 gimple factored_computed_goto
= NULL
;
319 /* We know there are one or more computed gotos in this function.
320 Examine the last statement in each basic block to see if the block
321 ends with a computed goto. */
325 gimple_stmt_iterator gsi
= gsi_last_bb (bb
);
331 last
= gsi_stmt (gsi
);
333 /* Ignore the computed goto we create when we factor the original
335 if (last
== factored_computed_goto
)
338 /* If the last statement is a computed goto, factor it. */
339 if (computed_goto_p (last
))
343 /* The first time we find a computed goto we need to create
344 the factored goto block and the variable each original
345 computed goto will use for their goto destination. */
346 if (!factored_computed_goto
)
348 basic_block new_bb
= create_empty_bb (bb
);
349 gimple_stmt_iterator new_gsi
= gsi_start_bb (new_bb
);
351 /* Create the destination of the factored goto. Each original
352 computed goto will put its desired destination into this
353 variable and jump to the label we create immediately
355 var
= create_tmp_var (ptr_type_node
, "gotovar");
357 /* Build a label for the new block which will contain the
358 factored computed goto. */
359 factored_label_decl
= create_artificial_label (UNKNOWN_LOCATION
);
360 factored_computed_goto_label
361 = gimple_build_label (factored_label_decl
);
362 gsi_insert_after (&new_gsi
, factored_computed_goto_label
,
365 /* Build our new computed goto. */
366 factored_computed_goto
= gimple_build_goto (var
);
367 gsi_insert_after (&new_gsi
, factored_computed_goto
, GSI_NEW_STMT
);
370 /* Copy the original computed goto's destination into VAR. */
371 assignment
= gimple_build_assign (var
, gimple_goto_dest (last
));
372 gsi_insert_before (&gsi
, assignment
, GSI_SAME_STMT
);
374 /* And re-vector the computed goto to the new destination. */
375 gimple_goto_set_dest (last
, factored_label_decl
);
381 /* Build a flowgraph for the sequence of stmts SEQ. */
384 make_blocks (gimple_seq seq
)
386 gimple_stmt_iterator i
= gsi_start (seq
);
388 bool start_new_block
= true;
389 bool first_stmt_of_seq
= true;
390 basic_block bb
= ENTRY_BLOCK_PTR
;
392 while (!gsi_end_p (i
))
399 /* If the statement starts a new basic block or if we have determined
400 in a previous pass that we need to create a new block for STMT, do
402 if (start_new_block
|| stmt_starts_bb_p (stmt
, prev_stmt
))
404 if (!first_stmt_of_seq
)
405 gsi_split_seq_before (&i
, &seq
);
406 bb
= create_basic_block (seq
, NULL
, bb
);
407 start_new_block
= false;
410 /* Now add STMT to BB and create the subgraphs for special statement
412 gimple_set_bb (stmt
, bb
);
414 if (computed_goto_p (stmt
))
415 found_computed_goto
= true;
417 /* If STMT is a basic block terminator, set START_NEW_BLOCK for the
419 if (stmt_ends_bb_p (stmt
))
421 /* If the stmt can make abnormal goto use a new temporary
422 for the assignment to the LHS. This makes sure the old value
423 of the LHS is available on the abnormal edge. Otherwise
424 we will end up with overlapping life-ranges for abnormal
426 if (gimple_has_lhs (stmt
)
427 && stmt_can_make_abnormal_goto (stmt
)
428 && is_gimple_reg_type (TREE_TYPE (gimple_get_lhs (stmt
))))
430 tree lhs
= gimple_get_lhs (stmt
);
431 tree tmp
= create_tmp_var (TREE_TYPE (lhs
), NULL
);
432 gimple s
= gimple_build_assign (lhs
, tmp
);
433 gimple_set_location (s
, gimple_location (stmt
));
434 gimple_set_block (s
, gimple_block (stmt
));
435 gimple_set_lhs (stmt
, tmp
);
436 if (TREE_CODE (TREE_TYPE (tmp
)) == COMPLEX_TYPE
437 || TREE_CODE (TREE_TYPE (tmp
)) == VECTOR_TYPE
)
438 DECL_GIMPLE_REG_P (tmp
) = 1;
439 gsi_insert_after (&i
, s
, GSI_SAME_STMT
);
441 start_new_block
= true;
445 first_stmt_of_seq
= false;
450 /* Create and return a new empty basic block after bb AFTER. */
453 create_bb (void *h
, void *e
, basic_block after
)
459 /* Create and initialize a new basic block. Since alloc_block uses
460 GC allocation that clears memory to allocate a basic block, we do
461 not have to clear the newly allocated basic block here. */
464 bb
->index
= last_basic_block
;
466 set_bb_seq (bb
, h
? (gimple_seq
) h
: NULL
);
468 /* Add the new block to the linked list of blocks. */
469 link_block (bb
, after
);
471 /* Grow the basic block array if needed. */
472 if ((size_t) last_basic_block
== basic_block_info
->length ())
474 size_t new_size
= last_basic_block
+ (last_basic_block
+ 3) / 4;
475 vec_safe_grow_cleared (basic_block_info
, new_size
);
478 /* Add the newly created block to the array. */
479 SET_BASIC_BLOCK (last_basic_block
, bb
);
488 /*---------------------------------------------------------------------------
490 ---------------------------------------------------------------------------*/
492 /* Fold COND_EXPR_COND of each COND_EXPR. */
495 fold_cond_expr_cond (void)
501 gimple stmt
= last_stmt (bb
);
503 if (stmt
&& gimple_code (stmt
) == GIMPLE_COND
)
505 location_t loc
= gimple_location (stmt
);
509 fold_defer_overflow_warnings ();
510 cond
= fold_binary_loc (loc
, gimple_cond_code (stmt
), boolean_type_node
,
511 gimple_cond_lhs (stmt
), gimple_cond_rhs (stmt
));
514 zerop
= integer_zerop (cond
);
515 onep
= integer_onep (cond
);
518 zerop
= onep
= false;
520 fold_undefer_overflow_warnings (zerop
|| onep
,
522 WARN_STRICT_OVERFLOW_CONDITIONAL
);
524 gimple_cond_make_false (stmt
);
526 gimple_cond_make_true (stmt
);
531 /* Join all the blocks in the flowgraph. */
537 struct omp_region
*cur_region
= NULL
;
539 /* Create an edge from entry to the first block with executable
541 make_edge (ENTRY_BLOCK_PTR
, BASIC_BLOCK (NUM_FIXED_BLOCKS
), EDGE_FALLTHRU
);
543 /* Traverse the basic block array placing edges. */
546 gimple last
= last_stmt (bb
);
551 enum gimple_code code
= gimple_code (last
);
555 make_goto_expr_edges (bb
);
559 make_edge (bb
, EXIT_BLOCK_PTR
, 0);
563 make_cond_expr_edges (bb
);
567 make_gimple_switch_edges (bb
);
571 make_eh_edges (last
);
574 case GIMPLE_EH_DISPATCH
:
575 fallthru
= make_eh_dispatch_edges (last
);
579 /* If this function receives a nonlocal goto, then we need to
580 make edges from this call site to all the nonlocal goto
582 if (stmt_can_make_abnormal_goto (last
))
583 make_abnormal_goto_edges (bb
, true);
585 /* If this statement has reachable exception handlers, then
586 create abnormal edges to them. */
587 make_eh_edges (last
);
589 /* BUILTIN_RETURN is really a return statement. */
590 if (gimple_call_builtin_p (last
, BUILT_IN_RETURN
))
591 make_edge (bb
, EXIT_BLOCK_PTR
, 0), fallthru
= false;
592 /* Some calls are known not to return. */
594 fallthru
= !(gimple_call_flags (last
) & ECF_NORETURN
);
598 /* A GIMPLE_ASSIGN may throw internally and thus be considered
600 if (is_ctrl_altering_stmt (last
))
601 make_eh_edges (last
);
606 make_gimple_asm_edges (bb
);
610 case GIMPLE_OMP_PARALLEL
:
611 case GIMPLE_OMP_TASK
:
613 case GIMPLE_OMP_SINGLE
:
614 case GIMPLE_OMP_TEAMS
:
615 case GIMPLE_OMP_MASTER
:
616 case GIMPLE_OMP_TASKGROUP
:
617 case GIMPLE_OMP_ORDERED
:
618 case GIMPLE_OMP_CRITICAL
:
619 case GIMPLE_OMP_SECTION
:
620 cur_region
= new_omp_region (bb
, code
, cur_region
);
624 case GIMPLE_OMP_TARGET
:
625 cur_region
= new_omp_region (bb
, code
, cur_region
);
627 if (gimple_omp_target_kind (last
) == GF_OMP_TARGET_KIND_UPDATE
)
628 cur_region
= cur_region
->outer
;
631 case GIMPLE_OMP_SECTIONS
:
632 cur_region
= new_omp_region (bb
, code
, cur_region
);
636 case GIMPLE_OMP_SECTIONS_SWITCH
:
640 case GIMPLE_OMP_ATOMIC_LOAD
:
641 case GIMPLE_OMP_ATOMIC_STORE
:
645 case GIMPLE_OMP_RETURN
:
646 /* In the case of a GIMPLE_OMP_SECTION, the edge will go
647 somewhere other than the next block. This will be
649 cur_region
->exit
= bb
;
650 fallthru
= cur_region
->type
!= GIMPLE_OMP_SECTION
;
651 cur_region
= cur_region
->outer
;
654 case GIMPLE_OMP_CONTINUE
:
655 cur_region
->cont
= bb
;
656 switch (cur_region
->type
)
659 /* Mark all GIMPLE_OMP_FOR and GIMPLE_OMP_CONTINUE
660 succs edges as abnormal to prevent splitting
662 single_succ_edge (cur_region
->entry
)->flags
|= EDGE_ABNORMAL
;
663 /* Make the loopback edge. */
664 make_edge (bb
, single_succ (cur_region
->entry
),
667 /* Create an edge from GIMPLE_OMP_FOR to exit, which
668 corresponds to the case that the body of the loop
669 is not executed at all. */
670 make_edge (cur_region
->entry
, bb
->next_bb
, EDGE_ABNORMAL
);
671 make_edge (bb
, bb
->next_bb
, EDGE_FALLTHRU
| EDGE_ABNORMAL
);
675 case GIMPLE_OMP_SECTIONS
:
676 /* Wire up the edges into and out of the nested sections. */
678 basic_block switch_bb
= single_succ (cur_region
->entry
);
680 struct omp_region
*i
;
681 for (i
= cur_region
->inner
; i
; i
= i
->next
)
683 gcc_assert (i
->type
== GIMPLE_OMP_SECTION
);
684 make_edge (switch_bb
, i
->entry
, 0);
685 make_edge (i
->exit
, bb
, EDGE_FALLTHRU
);
688 /* Make the loopback edge to the block with
689 GIMPLE_OMP_SECTIONS_SWITCH. */
690 make_edge (bb
, switch_bb
, 0);
692 /* Make the edge from the switch to exit. */
693 make_edge (switch_bb
, bb
->next_bb
, 0);
703 case GIMPLE_TRANSACTION
:
705 tree abort_label
= gimple_transaction_label (last
);
707 make_edge (bb
, label_to_block (abort_label
), EDGE_TM_ABORT
);
713 gcc_assert (!stmt_ends_bb_p (last
));
721 make_edge (bb
, bb
->next_bb
, EDGE_FALLTHRU
);
727 /* Fold COND_EXPR_COND of each COND_EXPR. */
728 fold_cond_expr_cond ();
731 /* Find the next available discriminator value for LOCUS. The
732 discriminator distinguishes among several basic blocks that
733 share a common locus, allowing for more accurate sample-based
737 next_discriminator_for_locus (location_t locus
)
739 struct locus_discrim_map item
;
740 struct locus_discrim_map
**slot
;
743 item
.discriminator
= 0;
744 slot
= discriminator_per_locus
.find_slot_with_hash (
745 &item
, LOCATION_LINE (locus
), INSERT
);
747 if (*slot
== HTAB_EMPTY_ENTRY
)
749 *slot
= XNEW (struct locus_discrim_map
);
751 (*slot
)->locus
= locus
;
752 (*slot
)->discriminator
= 0;
754 (*slot
)->discriminator
++;
755 return (*slot
)->discriminator
;
758 /* Return TRUE if LOCUS1 and LOCUS2 refer to the same source line. */
761 same_line_p (location_t locus1
, location_t locus2
)
763 expanded_location from
, to
;
765 if (locus1
== locus2
)
768 from
= expand_location (locus1
);
769 to
= expand_location (locus2
);
771 if (from
.line
!= to
.line
)
773 if (from
.file
== to
.file
)
775 return (from
.file
!= NULL
777 && filename_cmp (from
.file
, to
.file
) == 0);
780 /* Assign discriminators to each basic block. */
783 assign_discriminators (void)
791 gimple last
= last_stmt (bb
);
792 location_t locus
= last
? gimple_location (last
) : UNKNOWN_LOCATION
;
794 if (locus
== UNKNOWN_LOCATION
)
797 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
799 gimple first
= first_non_label_stmt (e
->dest
);
800 gimple last
= last_stmt (e
->dest
);
801 if ((first
&& same_line_p (locus
, gimple_location (first
)))
802 || (last
&& same_line_p (locus
, gimple_location (last
))))
804 if (e
->dest
->discriminator
!= 0 && bb
->discriminator
== 0)
805 bb
->discriminator
= next_discriminator_for_locus (locus
);
807 e
->dest
->discriminator
= next_discriminator_for_locus (locus
);
813 /* Create the edges for a GIMPLE_COND starting at block BB. */
816 make_cond_expr_edges (basic_block bb
)
818 gimple entry
= last_stmt (bb
);
819 gimple then_stmt
, else_stmt
;
820 basic_block then_bb
, else_bb
;
821 tree then_label
, else_label
;
825 gcc_assert (gimple_code (entry
) == GIMPLE_COND
);
827 /* Entry basic blocks for each component. */
828 then_label
= gimple_cond_true_label (entry
);
829 else_label
= gimple_cond_false_label (entry
);
830 then_bb
= label_to_block (then_label
);
831 else_bb
= label_to_block (else_label
);
832 then_stmt
= first_stmt (then_bb
);
833 else_stmt
= first_stmt (else_bb
);
835 e
= make_edge (bb
, then_bb
, EDGE_TRUE_VALUE
);
836 e
->goto_locus
= gimple_location (then_stmt
);
837 e
= make_edge (bb
, else_bb
, EDGE_FALSE_VALUE
);
839 e
->goto_locus
= gimple_location (else_stmt
);
841 /* We do not need the labels anymore. */
842 gimple_cond_set_true_label (entry
, NULL_TREE
);
843 gimple_cond_set_false_label (entry
, NULL_TREE
);
847 /* Called for each element in the hash table (P) as we delete the
848 edge to cases hash table.
850 Clear all the TREE_CHAINs to prevent problems with copying of
851 SWITCH_EXPRs and structure sharing rules, then free the hash table
855 edge_to_cases_cleanup (const void *key ATTRIBUTE_UNUSED
, void **value
,
856 void *data ATTRIBUTE_UNUSED
)
860 for (t
= (tree
) *value
; t
; t
= next
)
862 next
= CASE_CHAIN (t
);
863 CASE_CHAIN (t
) = NULL
;
870 /* Start recording information mapping edges to case labels. */
873 start_recording_case_labels (void)
875 gcc_assert (edge_to_cases
== NULL
);
876 edge_to_cases
= pointer_map_create ();
877 touched_switch_bbs
= BITMAP_ALLOC (NULL
);
880 /* Return nonzero if we are recording information for case labels. */
883 recording_case_labels_p (void)
885 return (edge_to_cases
!= NULL
);
888 /* Stop recording information mapping edges to case labels and
889 remove any information we have recorded. */
891 end_recording_case_labels (void)
895 pointer_map_traverse (edge_to_cases
, edge_to_cases_cleanup
, NULL
);
896 pointer_map_destroy (edge_to_cases
);
897 edge_to_cases
= NULL
;
898 EXECUTE_IF_SET_IN_BITMAP (touched_switch_bbs
, 0, i
, bi
)
900 basic_block bb
= BASIC_BLOCK (i
);
903 gimple stmt
= last_stmt (bb
);
904 if (stmt
&& gimple_code (stmt
) == GIMPLE_SWITCH
)
905 group_case_labels_stmt (stmt
);
908 BITMAP_FREE (touched_switch_bbs
);
911 /* If we are inside a {start,end}_recording_cases block, then return
912 a chain of CASE_LABEL_EXPRs from T which reference E.
914 Otherwise return NULL. */
917 get_cases_for_edge (edge e
, gimple t
)
922 /* If we are not recording cases, then we do not have CASE_LABEL_EXPR
923 chains available. Return NULL so the caller can detect this case. */
924 if (!recording_case_labels_p ())
927 slot
= pointer_map_contains (edge_to_cases
, e
);
931 /* If we did not find E in the hash table, then this must be the first
932 time we have been queried for information about E & T. Add all the
933 elements from T to the hash table then perform the query again. */
935 n
= gimple_switch_num_labels (t
);
936 for (i
= 0; i
< n
; i
++)
938 tree elt
= gimple_switch_label (t
, i
);
939 tree lab
= CASE_LABEL (elt
);
940 basic_block label_bb
= label_to_block (lab
);
941 edge this_edge
= find_edge (e
->src
, label_bb
);
943 /* Add it to the chain of CASE_LABEL_EXPRs referencing E, or create
945 slot
= pointer_map_insert (edge_to_cases
, this_edge
);
946 CASE_CHAIN (elt
) = (tree
) *slot
;
950 return (tree
) *pointer_map_contains (edge_to_cases
, e
);
953 /* Create the edges for a GIMPLE_SWITCH starting at block BB. */
956 make_gimple_switch_edges (basic_block bb
)
958 gimple entry
= last_stmt (bb
);
961 n
= gimple_switch_num_labels (entry
);
963 for (i
= 0; i
< n
; ++i
)
965 tree lab
= CASE_LABEL (gimple_switch_label (entry
, i
));
966 basic_block label_bb
= label_to_block (lab
);
967 make_edge (bb
, label_bb
, 0);
972 /* Return the basic block holding label DEST. */
975 label_to_block_fn (struct function
*ifun
, tree dest
)
977 int uid
= LABEL_DECL_UID (dest
);
979 /* We would die hard when faced by an undefined label. Emit a label to
980 the very first basic block. This will hopefully make even the dataflow
981 and undefined variable warnings quite right. */
982 if (seen_error () && uid
< 0)
984 gimple_stmt_iterator gsi
= gsi_start_bb (BASIC_BLOCK (NUM_FIXED_BLOCKS
));
987 stmt
= gimple_build_label (dest
);
988 gsi_insert_before (&gsi
, stmt
, GSI_NEW_STMT
);
989 uid
= LABEL_DECL_UID (dest
);
991 if (vec_safe_length (ifun
->cfg
->x_label_to_block_map
) <= (unsigned int) uid
)
993 return (*ifun
->cfg
->x_label_to_block_map
)[uid
];
996 /* Create edges for an abnormal goto statement at block BB. If FOR_CALL
997 is true, the source statement is a CALL_EXPR instead of a GOTO_EXPR. */
1000 make_abnormal_goto_edges (basic_block bb
, bool for_call
)
1002 basic_block target_bb
;
1003 gimple_stmt_iterator gsi
;
1005 FOR_EACH_BB (target_bb
)
1007 for (gsi
= gsi_start_bb (target_bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
1009 gimple label_stmt
= gsi_stmt (gsi
);
1012 if (gimple_code (label_stmt
) != GIMPLE_LABEL
)
1015 target
= gimple_label_label (label_stmt
);
1017 /* Make an edge to every label block that has been marked as a
1018 potential target for a computed goto or a non-local goto. */
1019 if ((FORCED_LABEL (target
) && !for_call
)
1020 || (DECL_NONLOCAL (target
) && for_call
))
1022 make_edge (bb
, target_bb
, EDGE_ABNORMAL
);
1026 if (!gsi_end_p (gsi
)
1027 && is_gimple_debug (gsi_stmt (gsi
)))
1028 gsi_next_nondebug (&gsi
);
1029 if (!gsi_end_p (gsi
))
1031 /* Make an edge to every setjmp-like call. */
1032 gimple call_stmt
= gsi_stmt (gsi
);
1033 if (is_gimple_call (call_stmt
)
1034 && (gimple_call_flags (call_stmt
) & ECF_RETURNS_TWICE
))
1035 make_edge (bb
, target_bb
, EDGE_ABNORMAL
);
1040 /* Create edges for a goto statement at block BB. */
1043 make_goto_expr_edges (basic_block bb
)
1045 gimple_stmt_iterator last
= gsi_last_bb (bb
);
1046 gimple goto_t
= gsi_stmt (last
);
1048 /* A simple GOTO creates normal edges. */
1049 if (simple_goto_p (goto_t
))
1051 tree dest
= gimple_goto_dest (goto_t
);
1052 basic_block label_bb
= label_to_block (dest
);
1053 edge e
= make_edge (bb
, label_bb
, EDGE_FALLTHRU
);
1054 e
->goto_locus
= gimple_location (goto_t
);
1055 gsi_remove (&last
, true);
1059 /* A computed GOTO creates abnormal edges. */
1060 make_abnormal_goto_edges (bb
, false);
1063 /* Create edges for an asm statement with labels at block BB. */
1066 make_gimple_asm_edges (basic_block bb
)
1068 gimple stmt
= last_stmt (bb
);
1069 int i
, n
= gimple_asm_nlabels (stmt
);
1071 for (i
= 0; i
< n
; ++i
)
1073 tree label
= TREE_VALUE (gimple_asm_label_op (stmt
, i
));
1074 basic_block label_bb
= label_to_block (label
);
1075 make_edge (bb
, label_bb
, 0);
1079 /*---------------------------------------------------------------------------
1081 ---------------------------------------------------------------------------*/
1083 /* Cleanup useless labels in basic blocks. This is something we wish
1084 to do early because it allows us to group case labels before creating
1085 the edges for the CFG, and it speeds up block statement iterators in
1086 all passes later on.
1087 We rerun this pass after CFG is created, to get rid of the labels that
1088 are no longer referenced. After then we do not run it any more, since
1089 (almost) no new labels should be created. */
1091 /* A map from basic block index to the leading label of that block. */
1092 static struct label_record
1097 /* True if the label is referenced from somewhere. */
1101 /* Given LABEL return the first label in the same basic block. */
1104 main_block_label (tree label
)
1106 basic_block bb
= label_to_block (label
);
1107 tree main_label
= label_for_bb
[bb
->index
].label
;
1109 /* label_to_block possibly inserted undefined label into the chain. */
1112 label_for_bb
[bb
->index
].label
= label
;
1116 label_for_bb
[bb
->index
].used
= true;
1120 /* Clean up redundant labels within the exception tree. */
1123 cleanup_dead_labels_eh (void)
1130 if (cfun
->eh
== NULL
)
1133 for (i
= 1; vec_safe_iterate (cfun
->eh
->lp_array
, i
, &lp
); ++i
)
1134 if (lp
&& lp
->post_landing_pad
)
1136 lab
= main_block_label (lp
->post_landing_pad
);
1137 if (lab
!= lp
->post_landing_pad
)
1139 EH_LANDING_PAD_NR (lp
->post_landing_pad
) = 0;
1140 EH_LANDING_PAD_NR (lab
) = lp
->index
;
1144 FOR_ALL_EH_REGION (r
)
1148 case ERT_MUST_NOT_THROW
:
1154 for (c
= r
->u
.eh_try
.first_catch
; c
; c
= c
->next_catch
)
1158 c
->label
= main_block_label (lab
);
1163 case ERT_ALLOWED_EXCEPTIONS
:
1164 lab
= r
->u
.allowed
.label
;
1166 r
->u
.allowed
.label
= main_block_label (lab
);
1172 /* Cleanup redundant labels. This is a three-step process:
1173 1) Find the leading label for each block.
1174 2) Redirect all references to labels to the leading labels.
1175 3) Cleanup all useless labels. */
1178 cleanup_dead_labels (void)
1181 label_for_bb
= XCNEWVEC (struct label_record
, last_basic_block
);
1183 /* Find a suitable label for each block. We use the first user-defined
1184 label if there is one, or otherwise just the first label we see. */
1187 gimple_stmt_iterator i
;
1189 for (i
= gsi_start_bb (bb
); !gsi_end_p (i
); gsi_next (&i
))
1192 gimple stmt
= gsi_stmt (i
);
1194 if (gimple_code (stmt
) != GIMPLE_LABEL
)
1197 label
= gimple_label_label (stmt
);
1199 /* If we have not yet seen a label for the current block,
1200 remember this one and see if there are more labels. */
1201 if (!label_for_bb
[bb
->index
].label
)
1203 label_for_bb
[bb
->index
].label
= label
;
1207 /* If we did see a label for the current block already, but it
1208 is an artificially created label, replace it if the current
1209 label is a user defined label. */
1210 if (!DECL_ARTIFICIAL (label
)
1211 && DECL_ARTIFICIAL (label_for_bb
[bb
->index
].label
))
1213 label_for_bb
[bb
->index
].label
= label
;
1219 /* Now redirect all jumps/branches to the selected label.
1220 First do so for each block ending in a control statement. */
1223 gimple stmt
= last_stmt (bb
);
1224 tree label
, new_label
;
1229 switch (gimple_code (stmt
))
1232 label
= gimple_cond_true_label (stmt
);
1235 new_label
= main_block_label (label
);
1236 if (new_label
!= label
)
1237 gimple_cond_set_true_label (stmt
, new_label
);
1240 label
= gimple_cond_false_label (stmt
);
1243 new_label
= main_block_label (label
);
1244 if (new_label
!= label
)
1245 gimple_cond_set_false_label (stmt
, new_label
);
1251 size_t i
, n
= gimple_switch_num_labels (stmt
);
1253 /* Replace all destination labels. */
1254 for (i
= 0; i
< n
; ++i
)
1256 tree case_label
= gimple_switch_label (stmt
, i
);
1257 label
= CASE_LABEL (case_label
);
1258 new_label
= main_block_label (label
);
1259 if (new_label
!= label
)
1260 CASE_LABEL (case_label
) = new_label
;
1267 int i
, n
= gimple_asm_nlabels (stmt
);
1269 for (i
= 0; i
< n
; ++i
)
1271 tree cons
= gimple_asm_label_op (stmt
, i
);
1272 tree label
= main_block_label (TREE_VALUE (cons
));
1273 TREE_VALUE (cons
) = label
;
1278 /* We have to handle gotos until they're removed, and we don't
1279 remove them until after we've created the CFG edges. */
1281 if (!computed_goto_p (stmt
))
1283 label
= gimple_goto_dest (stmt
);
1284 new_label
= main_block_label (label
);
1285 if (new_label
!= label
)
1286 gimple_goto_set_dest (stmt
, new_label
);
1290 case GIMPLE_TRANSACTION
:
1292 tree label
= gimple_transaction_label (stmt
);
1295 tree new_label
= main_block_label (label
);
1296 if (new_label
!= label
)
1297 gimple_transaction_set_label (stmt
, new_label
);
1307 /* Do the same for the exception region tree labels. */
1308 cleanup_dead_labels_eh ();
1310 /* Finally, purge dead labels. All user-defined labels and labels that
1311 can be the target of non-local gotos and labels which have their
1312 address taken are preserved. */
1315 gimple_stmt_iterator i
;
1316 tree label_for_this_bb
= label_for_bb
[bb
->index
].label
;
1318 if (!label_for_this_bb
)
1321 /* If the main label of the block is unused, we may still remove it. */
1322 if (!label_for_bb
[bb
->index
].used
)
1323 label_for_this_bb
= NULL
;
1325 for (i
= gsi_start_bb (bb
); !gsi_end_p (i
); )
1328 gimple stmt
= gsi_stmt (i
);
1330 if (gimple_code (stmt
) != GIMPLE_LABEL
)
1333 label
= gimple_label_label (stmt
);
1335 if (label
== label_for_this_bb
1336 || !DECL_ARTIFICIAL (label
)
1337 || DECL_NONLOCAL (label
)
1338 || FORCED_LABEL (label
))
1341 gsi_remove (&i
, true);
1345 free (label_for_bb
);
1348 /* Scan the sorted vector of cases in STMT (a GIMPLE_SWITCH) and combine
1349 the ones jumping to the same label.
1350 Eg. three separate entries 1: 2: 3: become one entry 1..3: */
1353 group_case_labels_stmt (gimple stmt
)
1355 int old_size
= gimple_switch_num_labels (stmt
);
1356 int i
, j
, new_size
= old_size
;
1357 basic_block default_bb
= NULL
;
1359 default_bb
= label_to_block (CASE_LABEL (gimple_switch_default_label (stmt
)));
1361 /* Look for possible opportunities to merge cases. */
1363 while (i
< old_size
)
1365 tree base_case
, base_high
;
1366 basic_block base_bb
;
1368 base_case
= gimple_switch_label (stmt
, i
);
1370 gcc_assert (base_case
);
1371 base_bb
= label_to_block (CASE_LABEL (base_case
));
1373 /* Discard cases that have the same destination as the
1375 if (base_bb
== default_bb
)
1377 gimple_switch_set_label (stmt
, i
, NULL_TREE
);
1383 base_high
= CASE_HIGH (base_case
)
1384 ? CASE_HIGH (base_case
)
1385 : CASE_LOW (base_case
);
1388 /* Try to merge case labels. Break out when we reach the end
1389 of the label vector or when we cannot merge the next case
1390 label with the current one. */
1391 while (i
< old_size
)
1393 tree merge_case
= gimple_switch_label (stmt
, i
);
1394 basic_block merge_bb
= label_to_block (CASE_LABEL (merge_case
));
1395 double_int bhp1
= tree_to_double_int (base_high
) + double_int_one
;
1397 /* Merge the cases if they jump to the same place,
1398 and their ranges are consecutive. */
1399 if (merge_bb
== base_bb
1400 && tree_to_double_int (CASE_LOW (merge_case
)) == bhp1
)
1402 base_high
= CASE_HIGH (merge_case
) ?
1403 CASE_HIGH (merge_case
) : CASE_LOW (merge_case
);
1404 CASE_HIGH (base_case
) = base_high
;
1405 gimple_switch_set_label (stmt
, i
, NULL_TREE
);
1414 /* Compress the case labels in the label vector, and adjust the
1415 length of the vector. */
1416 for (i
= 0, j
= 0; i
< new_size
; i
++)
1418 while (! gimple_switch_label (stmt
, j
))
1420 gimple_switch_set_label (stmt
, i
,
1421 gimple_switch_label (stmt
, j
++));
1424 gcc_assert (new_size
<= old_size
);
1425 gimple_switch_set_num_labels (stmt
, new_size
);
1428 /* Look for blocks ending in a multiway branch (a GIMPLE_SWITCH),
1429 and scan the sorted vector of cases. Combine the ones jumping to the
1433 group_case_labels (void)
1439 gimple stmt
= last_stmt (bb
);
1440 if (stmt
&& gimple_code (stmt
) == GIMPLE_SWITCH
)
1441 group_case_labels_stmt (stmt
);
1445 /* Checks whether we can merge block B into block A. */
1448 gimple_can_merge_blocks_p (basic_block a
, basic_block b
)
1451 gimple_stmt_iterator gsi
;
1453 if (!single_succ_p (a
))
1456 if (single_succ_edge (a
)->flags
& EDGE_COMPLEX
)
1459 if (single_succ (a
) != b
)
1462 if (!single_pred_p (b
))
1465 if (b
== EXIT_BLOCK_PTR
)
1468 /* If A ends by a statement causing exceptions or something similar, we
1469 cannot merge the blocks. */
1470 stmt
= last_stmt (a
);
1471 if (stmt
&& stmt_ends_bb_p (stmt
))
1474 /* Do not allow a block with only a non-local label to be merged. */
1476 && gimple_code (stmt
) == GIMPLE_LABEL
1477 && DECL_NONLOCAL (gimple_label_label (stmt
)))
1480 /* Examine the labels at the beginning of B. */
1481 for (gsi
= gsi_start_bb (b
); !gsi_end_p (gsi
); gsi_next (&gsi
))
1484 stmt
= gsi_stmt (gsi
);
1485 if (gimple_code (stmt
) != GIMPLE_LABEL
)
1487 lab
= gimple_label_label (stmt
);
1489 /* Do not remove user forced labels or for -O0 any user labels. */
1490 if (!DECL_ARTIFICIAL (lab
) && (!optimize
|| FORCED_LABEL (lab
)))
1494 /* Protect the loop latches. */
1495 if (current_loops
&& b
->loop_father
->latch
== b
)
1498 /* It must be possible to eliminate all phi nodes in B. If ssa form
1499 is not up-to-date and a name-mapping is registered, we cannot eliminate
1500 any phis. Symbols marked for renaming are never a problem though. */
1501 for (gsi
= gsi_start_phis (b
); !gsi_end_p (gsi
); gsi_next (&gsi
))
1503 gimple phi
= gsi_stmt (gsi
);
1504 /* Technically only new names matter. */
1505 if (name_registered_for_update_p (PHI_RESULT (phi
)))
1509 /* When not optimizing, don't merge if we'd lose goto_locus. */
1511 && single_succ_edge (a
)->goto_locus
!= UNKNOWN_LOCATION
)
1513 location_t goto_locus
= single_succ_edge (a
)->goto_locus
;
1514 gimple_stmt_iterator prev
, next
;
1515 prev
= gsi_last_nondebug_bb (a
);
1516 next
= gsi_after_labels (b
);
1517 if (!gsi_end_p (next
) && is_gimple_debug (gsi_stmt (next
)))
1518 gsi_next_nondebug (&next
);
1519 if ((gsi_end_p (prev
)
1520 || gimple_location (gsi_stmt (prev
)) != goto_locus
)
1521 && (gsi_end_p (next
)
1522 || gimple_location (gsi_stmt (next
)) != goto_locus
))
1529 /* Replaces all uses of NAME by VAL. */
1532 replace_uses_by (tree name
, tree val
)
1534 imm_use_iterator imm_iter
;
1539 FOR_EACH_IMM_USE_STMT (stmt
, imm_iter
, name
)
1541 FOR_EACH_IMM_USE_ON_STMT (use
, imm_iter
)
1543 replace_exp (use
, val
);
1545 if (gimple_code (stmt
) == GIMPLE_PHI
)
1547 e
= gimple_phi_arg_edge (stmt
, PHI_ARG_INDEX_FROM_USE (use
));
1548 if (e
->flags
& EDGE_ABNORMAL
)
1550 /* This can only occur for virtual operands, since
1551 for the real ones SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name))
1552 would prevent replacement. */
1553 gcc_checking_assert (virtual_operand_p (name
));
1554 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (val
) = 1;
1559 if (gimple_code (stmt
) != GIMPLE_PHI
)
1561 gimple_stmt_iterator gsi
= gsi_for_stmt (stmt
);
1562 gimple orig_stmt
= stmt
;
1565 /* Mark the block if we changed the last stmt in it. */
1566 if (cfgcleanup_altered_bbs
1567 && stmt_ends_bb_p (stmt
))
1568 bitmap_set_bit (cfgcleanup_altered_bbs
, gimple_bb (stmt
)->index
);
1570 /* FIXME. It shouldn't be required to keep TREE_CONSTANT
1571 on ADDR_EXPRs up-to-date on GIMPLE. Propagation will
1572 only change sth from non-invariant to invariant, and only
1573 when propagating constants. */
1574 if (is_gimple_min_invariant (val
))
1575 for (i
= 0; i
< gimple_num_ops (stmt
); i
++)
1577 tree op
= gimple_op (stmt
, i
);
1578 /* Operands may be empty here. For example, the labels
1579 of a GIMPLE_COND are nulled out following the creation
1580 of the corresponding CFG edges. */
1581 if (op
&& TREE_CODE (op
) == ADDR_EXPR
)
1582 recompute_tree_invariant_for_addr_expr (op
);
1585 if (fold_stmt (&gsi
))
1586 stmt
= gsi_stmt (gsi
);
1588 if (maybe_clean_or_replace_eh_stmt (orig_stmt
, stmt
))
1589 gimple_purge_dead_eh_edges (gimple_bb (stmt
));
1595 gcc_checking_assert (has_zero_uses (name
));
1597 /* Also update the trees stored in loop structures. */
1603 FOR_EACH_LOOP (li
, loop
, 0)
1605 substitute_in_loop_info (loop
, name
, val
);
1610 /* Merge block B into block A. */
1613 gimple_merge_blocks (basic_block a
, basic_block b
)
1615 gimple_stmt_iterator last
, gsi
, psi
;
1618 fprintf (dump_file
, "Merging blocks %d and %d\n", a
->index
, b
->index
);
1620 /* Remove all single-valued PHI nodes from block B of the form
1621 V_i = PHI <V_j> by propagating V_j to all the uses of V_i. */
1622 gsi
= gsi_last_bb (a
);
1623 for (psi
= gsi_start_phis (b
); !gsi_end_p (psi
); )
1625 gimple phi
= gsi_stmt (psi
);
1626 tree def
= gimple_phi_result (phi
), use
= gimple_phi_arg_def (phi
, 0);
1628 bool may_replace_uses
= (virtual_operand_p (def
)
1629 || may_propagate_copy (def
, use
));
1631 /* In case we maintain loop closed ssa form, do not propagate arguments
1632 of loop exit phi nodes. */
1634 && loops_state_satisfies_p (LOOP_CLOSED_SSA
)
1635 && !virtual_operand_p (def
)
1636 && TREE_CODE (use
) == SSA_NAME
1637 && a
->loop_father
!= b
->loop_father
)
1638 may_replace_uses
= false;
1640 if (!may_replace_uses
)
1642 gcc_assert (!virtual_operand_p (def
));
1644 /* Note that just emitting the copies is fine -- there is no problem
1645 with ordering of phi nodes. This is because A is the single
1646 predecessor of B, therefore results of the phi nodes cannot
1647 appear as arguments of the phi nodes. */
1648 copy
= gimple_build_assign (def
, use
);
1649 gsi_insert_after (&gsi
, copy
, GSI_NEW_STMT
);
1650 remove_phi_node (&psi
, false);
1654 /* If we deal with a PHI for virtual operands, we can simply
1655 propagate these without fussing with folding or updating
1657 if (virtual_operand_p (def
))
1659 imm_use_iterator iter
;
1660 use_operand_p use_p
;
1663 FOR_EACH_IMM_USE_STMT (stmt
, iter
, def
)
1664 FOR_EACH_IMM_USE_ON_STMT (use_p
, iter
)
1665 SET_USE (use_p
, use
);
1667 if (SSA_NAME_OCCURS_IN_ABNORMAL_PHI (def
))
1668 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (use
) = 1;
1671 replace_uses_by (def
, use
);
1673 remove_phi_node (&psi
, true);
1677 /* Ensure that B follows A. */
1678 move_block_after (b
, a
);
1680 gcc_assert (single_succ_edge (a
)->flags
& EDGE_FALLTHRU
);
1681 gcc_assert (!last_stmt (a
) || !stmt_ends_bb_p (last_stmt (a
)));
1683 /* Remove labels from B and set gimple_bb to A for other statements. */
1684 for (gsi
= gsi_start_bb (b
); !gsi_end_p (gsi
);)
1686 gimple stmt
= gsi_stmt (gsi
);
1687 if (gimple_code (stmt
) == GIMPLE_LABEL
)
1689 tree label
= gimple_label_label (stmt
);
1692 gsi_remove (&gsi
, false);
1694 /* Now that we can thread computed gotos, we might have
1695 a situation where we have a forced label in block B
1696 However, the label at the start of block B might still be
1697 used in other ways (think about the runtime checking for
1698 Fortran assigned gotos). So we can not just delete the
1699 label. Instead we move the label to the start of block A. */
1700 if (FORCED_LABEL (label
))
1702 gimple_stmt_iterator dest_gsi
= gsi_start_bb (a
);
1703 gsi_insert_before (&dest_gsi
, stmt
, GSI_NEW_STMT
);
1705 /* Other user labels keep around in a form of a debug stmt. */
1706 else if (!DECL_ARTIFICIAL (label
) && MAY_HAVE_DEBUG_STMTS
)
1708 gimple dbg
= gimple_build_debug_bind (label
,
1711 gimple_debug_bind_reset_value (dbg
);
1712 gsi_insert_before (&gsi
, dbg
, GSI_SAME_STMT
);
1715 lp_nr
= EH_LANDING_PAD_NR (label
);
1718 eh_landing_pad lp
= get_eh_landing_pad_from_number (lp_nr
);
1719 lp
->post_landing_pad
= NULL
;
1724 gimple_set_bb (stmt
, a
);
1729 /* Merge the sequences. */
1730 last
= gsi_last_bb (a
);
1731 gsi_insert_seq_after (&last
, bb_seq (b
), GSI_NEW_STMT
);
1732 set_bb_seq (b
, NULL
);
1734 if (cfgcleanup_altered_bbs
)
1735 bitmap_set_bit (cfgcleanup_altered_bbs
, a
->index
);
1739 /* Return the one of two successors of BB that is not reachable by a
1740 complex edge, if there is one. Else, return BB. We use
1741 this in optimizations that use post-dominators for their heuristics,
1742 to catch the cases in C++ where function calls are involved. */
1745 single_noncomplex_succ (basic_block bb
)
1748 if (EDGE_COUNT (bb
->succs
) != 2)
1751 e0
= EDGE_SUCC (bb
, 0);
1752 e1
= EDGE_SUCC (bb
, 1);
1753 if (e0
->flags
& EDGE_COMPLEX
)
1755 if (e1
->flags
& EDGE_COMPLEX
)
1761 /* T is CALL_EXPR. Set current_function_calls_* flags. */
1764 notice_special_calls (gimple call
)
1766 int flags
= gimple_call_flags (call
);
1768 if (flags
& ECF_MAY_BE_ALLOCA
)
1769 cfun
->calls_alloca
= true;
1770 if (flags
& ECF_RETURNS_TWICE
)
1771 cfun
->calls_setjmp
= true;
1775 /* Clear flags set by notice_special_calls. Used by dead code removal
1776 to update the flags. */
1779 clear_special_calls (void)
1781 cfun
->calls_alloca
= false;
1782 cfun
->calls_setjmp
= false;
1785 /* Remove PHI nodes associated with basic block BB and all edges out of BB. */
1788 remove_phi_nodes_and_edges_for_unreachable_block (basic_block bb
)
1790 /* Since this block is no longer reachable, we can just delete all
1791 of its PHI nodes. */
1792 remove_phi_nodes (bb
);
1794 /* Remove edges to BB's successors. */
1795 while (EDGE_COUNT (bb
->succs
) > 0)
1796 remove_edge (EDGE_SUCC (bb
, 0));
1800 /* Remove statements of basic block BB. */
1803 remove_bb (basic_block bb
)
1805 gimple_stmt_iterator i
;
1809 fprintf (dump_file
, "Removing basic block %d\n", bb
->index
);
1810 if (dump_flags
& TDF_DETAILS
)
1812 dump_bb (dump_file
, bb
, 0, dump_flags
);
1813 fprintf (dump_file
, "\n");
1819 struct loop
*loop
= bb
->loop_father
;
1821 /* If a loop gets removed, clean up the information associated
1823 if (loop
->latch
== bb
1824 || loop
->header
== bb
)
1825 free_numbers_of_iterations_estimates_loop (loop
);
1828 /* Remove all the instructions in the block. */
1829 if (bb_seq (bb
) != NULL
)
1831 /* Walk backwards so as to get a chance to substitute all
1832 released DEFs into debug stmts. See
1833 eliminate_unnecessary_stmts() in tree-ssa-dce.c for more
1835 for (i
= gsi_last_bb (bb
); !gsi_end_p (i
);)
1837 gimple stmt
= gsi_stmt (i
);
1838 if (gimple_code (stmt
) == GIMPLE_LABEL
1839 && (FORCED_LABEL (gimple_label_label (stmt
))
1840 || DECL_NONLOCAL (gimple_label_label (stmt
))))
1843 gimple_stmt_iterator new_gsi
;
1845 /* A non-reachable non-local label may still be referenced.
1846 But it no longer needs to carry the extra semantics of
1848 if (DECL_NONLOCAL (gimple_label_label (stmt
)))
1850 DECL_NONLOCAL (gimple_label_label (stmt
)) = 0;
1851 FORCED_LABEL (gimple_label_label (stmt
)) = 1;
1854 new_bb
= bb
->prev_bb
;
1855 new_gsi
= gsi_start_bb (new_bb
);
1856 gsi_remove (&i
, false);
1857 gsi_insert_before (&new_gsi
, stmt
, GSI_NEW_STMT
);
1861 /* Release SSA definitions if we are in SSA. Note that we
1862 may be called when not in SSA. For example,
1863 final_cleanup calls this function via
1864 cleanup_tree_cfg. */
1865 if (gimple_in_ssa_p (cfun
))
1866 release_defs (stmt
);
1868 gsi_remove (&i
, true);
1872 i
= gsi_last_bb (bb
);
1878 remove_phi_nodes_and_edges_for_unreachable_block (bb
);
1879 bb
->il
.gimple
.seq
= NULL
;
1880 bb
->il
.gimple
.phi_nodes
= NULL
;
1884 /* Given a basic block BB ending with COND_EXPR or SWITCH_EXPR, and a
1885 predicate VAL, return the edge that will be taken out of the block.
1886 If VAL does not match a unique edge, NULL is returned. */
1889 find_taken_edge (basic_block bb
, tree val
)
1893 stmt
= last_stmt (bb
);
1896 gcc_assert (is_ctrl_stmt (stmt
));
1901 if (!is_gimple_min_invariant (val
))
1904 if (gimple_code (stmt
) == GIMPLE_COND
)
1905 return find_taken_edge_cond_expr (bb
, val
);
1907 if (gimple_code (stmt
) == GIMPLE_SWITCH
)
1908 return find_taken_edge_switch_expr (bb
, val
);
1910 if (computed_goto_p (stmt
))
1912 /* Only optimize if the argument is a label, if the argument is
1913 not a label then we can not construct a proper CFG.
1915 It may be the case that we only need to allow the LABEL_REF to
1916 appear inside an ADDR_EXPR, but we also allow the LABEL_REF to
1917 appear inside a LABEL_EXPR just to be safe. */
1918 if ((TREE_CODE (val
) == ADDR_EXPR
|| TREE_CODE (val
) == LABEL_EXPR
)
1919 && TREE_CODE (TREE_OPERAND (val
, 0)) == LABEL_DECL
)
1920 return find_taken_edge_computed_goto (bb
, TREE_OPERAND (val
, 0));
1927 /* Given a constant value VAL and the entry block BB to a GOTO_EXPR
1928 statement, determine which of the outgoing edges will be taken out of the
1929 block. Return NULL if either edge may be taken. */
1932 find_taken_edge_computed_goto (basic_block bb
, tree val
)
1937 dest
= label_to_block (val
);
1940 e
= find_edge (bb
, dest
);
1941 gcc_assert (e
!= NULL
);
1947 /* Given a constant value VAL and the entry block BB to a COND_EXPR
1948 statement, determine which of the two edges will be taken out of the
1949 block. Return NULL if either edge may be taken. */
1952 find_taken_edge_cond_expr (basic_block bb
, tree val
)
1954 edge true_edge
, false_edge
;
1956 extract_true_false_edges_from_block (bb
, &true_edge
, &false_edge
);
1958 gcc_assert (TREE_CODE (val
) == INTEGER_CST
);
1959 return (integer_zerop (val
) ? false_edge
: true_edge
);
1962 /* Given an INTEGER_CST VAL and the entry block BB to a SWITCH_EXPR
1963 statement, determine which edge will be taken out of the block. Return
1964 NULL if any edge may be taken. */
1967 find_taken_edge_switch_expr (basic_block bb
, tree val
)
1969 basic_block dest_bb
;
1974 switch_stmt
= last_stmt (bb
);
1975 taken_case
= find_case_label_for_value (switch_stmt
, val
);
1976 dest_bb
= label_to_block (CASE_LABEL (taken_case
));
1978 e
= find_edge (bb
, dest_bb
);
1984 /* Return the CASE_LABEL_EXPR that SWITCH_STMT will take for VAL.
1985 We can make optimal use here of the fact that the case labels are
1986 sorted: We can do a binary search for a case matching VAL. */
1989 find_case_label_for_value (gimple switch_stmt
, tree val
)
1991 size_t low
, high
, n
= gimple_switch_num_labels (switch_stmt
);
1992 tree default_case
= gimple_switch_default_label (switch_stmt
);
1994 for (low
= 0, high
= n
; high
- low
> 1; )
1996 size_t i
= (high
+ low
) / 2;
1997 tree t
= gimple_switch_label (switch_stmt
, i
);
2000 /* Cache the result of comparing CASE_LOW and val. */
2001 cmp
= tree_int_cst_compare (CASE_LOW (t
), val
);
2008 if (CASE_HIGH (t
) == NULL
)
2010 /* A singe-valued case label. */
2016 /* A case range. We can only handle integer ranges. */
2017 if (cmp
<= 0 && tree_int_cst_compare (CASE_HIGH (t
), val
) >= 0)
2022 return default_case
;
2026 /* Dump a basic block on stderr. */
2029 gimple_debug_bb (basic_block bb
)
2031 dump_bb (stderr
, bb
, 0, TDF_VOPS
|TDF_MEMSYMS
|TDF_BLOCKS
);
2035 /* Dump basic block with index N on stderr. */
2038 gimple_debug_bb_n (int n
)
2040 gimple_debug_bb (BASIC_BLOCK (n
));
2041 return BASIC_BLOCK (n
);
2045 /* Dump the CFG on stderr.
2047 FLAGS are the same used by the tree dumping functions
2048 (see TDF_* in dumpfile.h). */
2051 gimple_debug_cfg (int flags
)
2053 gimple_dump_cfg (stderr
, flags
);
2057 /* Dump the program showing basic block boundaries on the given FILE.
2059 FLAGS are the same used by the tree dumping functions (see TDF_* in
2063 gimple_dump_cfg (FILE *file
, int flags
)
2065 if (flags
& TDF_DETAILS
)
2067 dump_function_header (file
, current_function_decl
, flags
);
2068 fprintf (file
, ";; \n%d basic blocks, %d edges, last basic block %d.\n\n",
2069 n_basic_blocks
, n_edges
, last_basic_block
);
2071 brief_dump_cfg (file
, flags
| TDF_COMMENT
);
2072 fprintf (file
, "\n");
2075 if (flags
& TDF_STATS
)
2076 dump_cfg_stats (file
);
2078 dump_function_to_file (current_function_decl
, file
, flags
| TDF_BLOCKS
);
2082 /* Dump CFG statistics on FILE. */
2085 dump_cfg_stats (FILE *file
)
2087 static long max_num_merged_labels
= 0;
2088 unsigned long size
, total
= 0;
2091 const char * const fmt_str
= "%-30s%-13s%12s\n";
2092 const char * const fmt_str_1
= "%-30s%13d%11lu%c\n";
2093 const char * const fmt_str_2
= "%-30s%13ld%11lu%c\n";
2094 const char * const fmt_str_3
= "%-43s%11lu%c\n";
2095 const char *funcname
= current_function_name ();
2097 fprintf (file
, "\nCFG Statistics for %s\n\n", funcname
);
2099 fprintf (file
, "---------------------------------------------------------\n");
2100 fprintf (file
, fmt_str
, "", " Number of ", "Memory");
2101 fprintf (file
, fmt_str
, "", " instances ", "used ");
2102 fprintf (file
, "---------------------------------------------------------\n");
2104 size
= n_basic_blocks
* sizeof (struct basic_block_def
);
2106 fprintf (file
, fmt_str_1
, "Basic blocks", n_basic_blocks
,
2107 SCALE (size
), LABEL (size
));
2111 num_edges
+= EDGE_COUNT (bb
->succs
);
2112 size
= num_edges
* sizeof (struct edge_def
);
2114 fprintf (file
, fmt_str_2
, "Edges", num_edges
, SCALE (size
), LABEL (size
));
2116 fprintf (file
, "---------------------------------------------------------\n");
2117 fprintf (file
, fmt_str_3
, "Total memory used by CFG data", SCALE (total
),
2119 fprintf (file
, "---------------------------------------------------------\n");
2120 fprintf (file
, "\n");
2122 if (cfg_stats
.num_merged_labels
> max_num_merged_labels
)
2123 max_num_merged_labels
= cfg_stats
.num_merged_labels
;
2125 fprintf (file
, "Coalesced label blocks: %ld (Max so far: %ld)\n",
2126 cfg_stats
.num_merged_labels
, max_num_merged_labels
);
2128 fprintf (file
, "\n");
2132 /* Dump CFG statistics on stderr. Keep extern so that it's always
2133 linked in the final executable. */
2136 debug_cfg_stats (void)
2138 dump_cfg_stats (stderr
);
2141 /*---------------------------------------------------------------------------
2142 Miscellaneous helpers
2143 ---------------------------------------------------------------------------*/
2145 /* Return true if T, a GIMPLE_CALL, can make an abnormal transfer of control
2146 flow. Transfers of control flow associated with EH are excluded. */
2149 call_can_make_abnormal_goto (gimple t
)
2151 /* If the function has no non-local labels, then a call cannot make an
2152 abnormal transfer of control. */
2153 if (!cfun
->has_nonlocal_label
2154 && !cfun
->calls_setjmp
)
2157 /* Likewise if the call has no side effects. */
2158 if (!gimple_has_side_effects (t
))
2161 /* Likewise if the called function is leaf. */
2162 if (gimple_call_flags (t
) & ECF_LEAF
)
2169 /* Return true if T can make an abnormal transfer of control flow.
2170 Transfers of control flow associated with EH are excluded. */
2173 stmt_can_make_abnormal_goto (gimple t
)
2175 if (computed_goto_p (t
))
2177 if (is_gimple_call (t
))
2178 return call_can_make_abnormal_goto (t
);
2183 /* Return true if T represents a stmt that always transfers control. */
2186 is_ctrl_stmt (gimple t
)
2188 switch (gimple_code (t
))
2202 /* Return true if T is a statement that may alter the flow of control
2203 (e.g., a call to a non-returning function). */
2206 is_ctrl_altering_stmt (gimple t
)
2210 switch (gimple_code (t
))
2214 int flags
= gimple_call_flags (t
);
2216 /* A call alters control flow if it can make an abnormal goto. */
2217 if (call_can_make_abnormal_goto (t
))
2220 /* A call also alters control flow if it does not return. */
2221 if (flags
& ECF_NORETURN
)
2224 /* TM ending statements have backedges out of the transaction.
2225 Return true so we split the basic block containing them.
2226 Note that the TM_BUILTIN test is merely an optimization. */
2227 if ((flags
& ECF_TM_BUILTIN
)
2228 && is_tm_ending_fndecl (gimple_call_fndecl (t
)))
2231 /* BUILT_IN_RETURN call is same as return statement. */
2232 if (gimple_call_builtin_p (t
, BUILT_IN_RETURN
))
2237 case GIMPLE_EH_DISPATCH
:
2238 /* EH_DISPATCH branches to the individual catch handlers at
2239 this level of a try or allowed-exceptions region. It can
2240 fallthru to the next statement as well. */
2244 if (gimple_asm_nlabels (t
) > 0)
2249 /* OpenMP directives alter control flow. */
2252 case GIMPLE_TRANSACTION
:
2253 /* A transaction start alters control flow. */
2260 /* If a statement can throw, it alters control flow. */
2261 return stmt_can_throw_internal (t
);
2265 /* Return true if T is a simple local goto. */
2268 simple_goto_p (gimple t
)
2270 return (gimple_code (t
) == GIMPLE_GOTO
2271 && TREE_CODE (gimple_goto_dest (t
)) == LABEL_DECL
);
2275 /* Return true if STMT should start a new basic block. PREV_STMT is
2276 the statement preceding STMT. It is used when STMT is a label or a
2277 case label. Labels should only start a new basic block if their
2278 previous statement wasn't a label. Otherwise, sequence of labels
2279 would generate unnecessary basic blocks that only contain a single
2283 stmt_starts_bb_p (gimple stmt
, gimple prev_stmt
)
2288 /* Labels start a new basic block only if the preceding statement
2289 wasn't a label of the same type. This prevents the creation of
2290 consecutive blocks that have nothing but a single label. */
2291 if (gimple_code (stmt
) == GIMPLE_LABEL
)
2293 /* Nonlocal and computed GOTO targets always start a new block. */
2294 if (DECL_NONLOCAL (gimple_label_label (stmt
))
2295 || FORCED_LABEL (gimple_label_label (stmt
)))
2298 if (prev_stmt
&& gimple_code (prev_stmt
) == GIMPLE_LABEL
)
2300 if (DECL_NONLOCAL (gimple_label_label (prev_stmt
)))
2303 cfg_stats
.num_merged_labels
++;
2309 else if (gimple_code (stmt
) == GIMPLE_CALL
2310 && gimple_call_flags (stmt
) & ECF_RETURNS_TWICE
)
2311 /* setjmp acts similar to a nonlocal GOTO target and thus should
2312 start a new block. */
2319 /* Return true if T should end a basic block. */
2322 stmt_ends_bb_p (gimple t
)
2324 return is_ctrl_stmt (t
) || is_ctrl_altering_stmt (t
);
2327 /* Remove block annotations and other data structures. */
2330 delete_tree_cfg_annotations (void)
2332 vec_free (label_to_block_map
);
2336 /* Return the first statement in basic block BB. */
2339 first_stmt (basic_block bb
)
2341 gimple_stmt_iterator i
= gsi_start_bb (bb
);
2344 while (!gsi_end_p (i
) && is_gimple_debug ((stmt
= gsi_stmt (i
))))
2352 /* Return the first non-label statement in basic block BB. */
2355 first_non_label_stmt (basic_block bb
)
2357 gimple_stmt_iterator i
= gsi_start_bb (bb
);
2358 while (!gsi_end_p (i
) && gimple_code (gsi_stmt (i
)) == GIMPLE_LABEL
)
2360 return !gsi_end_p (i
) ? gsi_stmt (i
) : NULL
;
2363 /* Return the last statement in basic block BB. */
2366 last_stmt (basic_block bb
)
2368 gimple_stmt_iterator i
= gsi_last_bb (bb
);
2371 while (!gsi_end_p (i
) && is_gimple_debug ((stmt
= gsi_stmt (i
))))
2379 /* Return the last statement of an otherwise empty block. Return NULL
2380 if the block is totally empty, or if it contains more than one
2384 last_and_only_stmt (basic_block bb
)
2386 gimple_stmt_iterator i
= gsi_last_nondebug_bb (bb
);
2392 last
= gsi_stmt (i
);
2393 gsi_prev_nondebug (&i
);
2397 /* Empty statements should no longer appear in the instruction stream.
2398 Everything that might have appeared before should be deleted by
2399 remove_useless_stmts, and the optimizers should just gsi_remove
2400 instead of smashing with build_empty_stmt.
2402 Thus the only thing that should appear here in a block containing
2403 one executable statement is a label. */
2404 prev
= gsi_stmt (i
);
2405 if (gimple_code (prev
) == GIMPLE_LABEL
)
2411 /* Reinstall those PHI arguments queued in OLD_EDGE to NEW_EDGE. */
2414 reinstall_phi_args (edge new_edge
, edge old_edge
)
2416 edge_var_map_vector
*v
;
2419 gimple_stmt_iterator phis
;
2421 v
= redirect_edge_var_map_vector (old_edge
);
2425 for (i
= 0, phis
= gsi_start_phis (new_edge
->dest
);
2426 v
->iterate (i
, &vm
) && !gsi_end_p (phis
);
2427 i
++, gsi_next (&phis
))
2429 gimple phi
= gsi_stmt (phis
);
2430 tree result
= redirect_edge_var_map_result (vm
);
2431 tree arg
= redirect_edge_var_map_def (vm
);
2433 gcc_assert (result
== gimple_phi_result (phi
));
2435 add_phi_arg (phi
, arg
, new_edge
, redirect_edge_var_map_location (vm
));
2438 redirect_edge_var_map_clear (old_edge
);
2441 /* Returns the basic block after which the new basic block created
2442 by splitting edge EDGE_IN should be placed. Tries to keep the new block
2443 near its "logical" location. This is of most help to humans looking
2444 at debugging dumps. */
2447 split_edge_bb_loc (edge edge_in
)
2449 basic_block dest
= edge_in
->dest
;
2450 basic_block dest_prev
= dest
->prev_bb
;
2454 edge e
= find_edge (dest_prev
, dest
);
2455 if (e
&& !(e
->flags
& EDGE_COMPLEX
))
2456 return edge_in
->src
;
2461 /* Split a (typically critical) edge EDGE_IN. Return the new block.
2462 Abort on abnormal edges. */
2465 gimple_split_edge (edge edge_in
)
2467 basic_block new_bb
, after_bb
, dest
;
2470 /* Abnormal edges cannot be split. */
2471 gcc_assert (!(edge_in
->flags
& EDGE_ABNORMAL
));
2473 dest
= edge_in
->dest
;
2475 after_bb
= split_edge_bb_loc (edge_in
);
2477 new_bb
= create_empty_bb (after_bb
);
2478 new_bb
->frequency
= EDGE_FREQUENCY (edge_in
);
2479 new_bb
->count
= edge_in
->count
;
2480 new_edge
= make_edge (new_bb
, dest
, EDGE_FALLTHRU
);
2481 new_edge
->probability
= REG_BR_PROB_BASE
;
2482 new_edge
->count
= edge_in
->count
;
2484 e
= redirect_edge_and_branch (edge_in
, new_bb
);
2485 gcc_assert (e
== edge_in
);
2486 reinstall_phi_args (new_edge
, e
);
2492 /* Verify properties of the address expression T with base object BASE. */
2495 verify_address (tree t
, tree base
)
2498 bool old_side_effects
;
2500 bool new_side_effects
;
2502 old_constant
= TREE_CONSTANT (t
);
2503 old_side_effects
= TREE_SIDE_EFFECTS (t
);
2505 recompute_tree_invariant_for_addr_expr (t
);
2506 new_side_effects
= TREE_SIDE_EFFECTS (t
);
2507 new_constant
= TREE_CONSTANT (t
);
2509 if (old_constant
!= new_constant
)
2511 error ("constant not recomputed when ADDR_EXPR changed");
2514 if (old_side_effects
!= new_side_effects
)
2516 error ("side effects not recomputed when ADDR_EXPR changed");
2520 if (!(TREE_CODE (base
) == VAR_DECL
2521 || TREE_CODE (base
) == PARM_DECL
2522 || TREE_CODE (base
) == RESULT_DECL
))
2525 if (DECL_GIMPLE_REG_P (base
))
2527 error ("DECL_GIMPLE_REG_P set on a variable with address taken");
2534 /* Callback for walk_tree, check that all elements with address taken are
2535 properly noticed as such. The DATA is an int* that is 1 if TP was seen
2536 inside a PHI node. */
2539 verify_expr (tree
*tp
, int *walk_subtrees
, void *data ATTRIBUTE_UNUSED
)
2546 /* Check operand N for being valid GIMPLE and give error MSG if not. */
2547 #define CHECK_OP(N, MSG) \
2548 do { if (!is_gimple_val (TREE_OPERAND (t, N))) \
2549 { error (MSG); return TREE_OPERAND (t, N); }} while (0)
2551 switch (TREE_CODE (t
))
2554 if (SSA_NAME_IN_FREE_LIST (t
))
2556 error ("SSA name in freelist but still referenced");
2562 error ("INDIRECT_REF in gimple IL");
2566 x
= TREE_OPERAND (t
, 0);
2567 if (!POINTER_TYPE_P (TREE_TYPE (x
))
2568 || !is_gimple_mem_ref_addr (x
))
2570 error ("invalid first operand of MEM_REF");
2573 if (TREE_CODE (TREE_OPERAND (t
, 1)) != INTEGER_CST
2574 || !POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (t
, 1))))
2576 error ("invalid offset operand of MEM_REF");
2577 return TREE_OPERAND (t
, 1);
2579 if (TREE_CODE (x
) == ADDR_EXPR
2580 && (x
= verify_address (x
, TREE_OPERAND (x
, 0))))
2586 x
= fold (ASSERT_EXPR_COND (t
));
2587 if (x
== boolean_false_node
)
2589 error ("ASSERT_EXPR with an always-false condition");
2595 error ("MODIFY_EXPR not expected while having tuples");
2602 gcc_assert (is_gimple_address (t
));
2604 /* Skip any references (they will be checked when we recurse down the
2605 tree) and ensure that any variable used as a prefix is marked
2607 for (x
= TREE_OPERAND (t
, 0);
2608 handled_component_p (x
);
2609 x
= TREE_OPERAND (x
, 0))
2612 if ((tem
= verify_address (t
, x
)))
2615 if (!(TREE_CODE (x
) == VAR_DECL
2616 || TREE_CODE (x
) == PARM_DECL
2617 || TREE_CODE (x
) == RESULT_DECL
))
2620 if (!TREE_ADDRESSABLE (x
))
2622 error ("address taken, but ADDRESSABLE bit not set");
2630 x
= COND_EXPR_COND (t
);
2631 if (!INTEGRAL_TYPE_P (TREE_TYPE (x
)))
2633 error ("non-integral used in condition");
2636 if (!is_gimple_condexpr (x
))
2638 error ("invalid conditional operand");
2643 case NON_LVALUE_EXPR
:
2644 case TRUTH_NOT_EXPR
:
2648 case FIX_TRUNC_EXPR
:
2653 CHECK_OP (0, "invalid operand to unary operator");
2659 if (!is_gimple_reg_type (TREE_TYPE (t
)))
2661 error ("non-scalar BIT_FIELD_REF, IMAGPART_EXPR or REALPART_EXPR");
2665 if (TREE_CODE (t
) == BIT_FIELD_REF
)
2667 if (!host_integerp (TREE_OPERAND (t
, 1), 1)
2668 || !host_integerp (TREE_OPERAND (t
, 2), 1))
2670 error ("invalid position or size operand to BIT_FIELD_REF");
2673 if (INTEGRAL_TYPE_P (TREE_TYPE (t
))
2674 && (TYPE_PRECISION (TREE_TYPE (t
))
2675 != TREE_INT_CST_LOW (TREE_OPERAND (t
, 1))))
2677 error ("integral result type precision does not match "
2678 "field size of BIT_FIELD_REF");
2681 else if (!INTEGRAL_TYPE_P (TREE_TYPE (t
))
2682 && TYPE_MODE (TREE_TYPE (t
)) != BLKmode
2683 && (GET_MODE_PRECISION (TYPE_MODE (TREE_TYPE (t
)))
2684 != TREE_INT_CST_LOW (TREE_OPERAND (t
, 1))))
2686 error ("mode precision of non-integral result does not "
2687 "match field size of BIT_FIELD_REF");
2691 t
= TREE_OPERAND (t
, 0);
2696 case ARRAY_RANGE_REF
:
2697 case VIEW_CONVERT_EXPR
:
2698 /* We have a nest of references. Verify that each of the operands
2699 that determine where to reference is either a constant or a variable,
2700 verify that the base is valid, and then show we've already checked
2702 while (handled_component_p (t
))
2704 if (TREE_CODE (t
) == COMPONENT_REF
&& TREE_OPERAND (t
, 2))
2705 CHECK_OP (2, "invalid COMPONENT_REF offset operator");
2706 else if (TREE_CODE (t
) == ARRAY_REF
2707 || TREE_CODE (t
) == ARRAY_RANGE_REF
)
2709 CHECK_OP (1, "invalid array index");
2710 if (TREE_OPERAND (t
, 2))
2711 CHECK_OP (2, "invalid array lower bound");
2712 if (TREE_OPERAND (t
, 3))
2713 CHECK_OP (3, "invalid array stride");
2715 else if (TREE_CODE (t
) == BIT_FIELD_REF
2716 || TREE_CODE (t
) == REALPART_EXPR
2717 || TREE_CODE (t
) == IMAGPART_EXPR
)
2719 error ("non-top-level BIT_FIELD_REF, IMAGPART_EXPR or "
2724 t
= TREE_OPERAND (t
, 0);
2727 if (!is_gimple_min_invariant (t
) && !is_gimple_lvalue (t
))
2729 error ("invalid reference prefix");
2736 /* PLUS_EXPR and MINUS_EXPR don't work on pointers, they should be done using
2737 POINTER_PLUS_EXPR. */
2738 if (POINTER_TYPE_P (TREE_TYPE (t
)))
2740 error ("invalid operand to plus/minus, type is a pointer");
2743 CHECK_OP (0, "invalid operand to binary operator");
2744 CHECK_OP (1, "invalid operand to binary operator");
2747 case POINTER_PLUS_EXPR
:
2748 /* Check to make sure the first operand is a pointer or reference type. */
2749 if (!POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (t
, 0))))
2751 error ("invalid operand to pointer plus, first operand is not a pointer");
2754 /* Check to make sure the second operand is a ptrofftype. */
2755 if (!ptrofftype_p (TREE_TYPE (TREE_OPERAND (t
, 1))))
2757 error ("invalid operand to pointer plus, second operand is not an "
2758 "integer type of appropriate width");
2768 case UNORDERED_EXPR
:
2777 case TRUNC_DIV_EXPR
:
2779 case FLOOR_DIV_EXPR
:
2780 case ROUND_DIV_EXPR
:
2781 case TRUNC_MOD_EXPR
:
2783 case FLOOR_MOD_EXPR
:
2784 case ROUND_MOD_EXPR
:
2786 case EXACT_DIV_EXPR
:
2796 CHECK_OP (0, "invalid operand to binary operator");
2797 CHECK_OP (1, "invalid operand to binary operator");
2801 if (TREE_CONSTANT (t
) && TREE_CODE (TREE_TYPE (t
)) == VECTOR_TYPE
)
2805 case CASE_LABEL_EXPR
:
2808 error ("invalid CASE_CHAIN");
2822 /* Verify if EXPR is either a GIMPLE ID or a GIMPLE indirect reference.
2823 Returns true if there is an error, otherwise false. */
2826 verify_types_in_gimple_min_lval (tree expr
)
2830 if (is_gimple_id (expr
))
2833 if (TREE_CODE (expr
) != TARGET_MEM_REF
2834 && TREE_CODE (expr
) != MEM_REF
)
2836 error ("invalid expression for min lvalue");
2840 /* TARGET_MEM_REFs are strange beasts. */
2841 if (TREE_CODE (expr
) == TARGET_MEM_REF
)
2844 op
= TREE_OPERAND (expr
, 0);
2845 if (!is_gimple_val (op
))
2847 error ("invalid operand in indirect reference");
2848 debug_generic_stmt (op
);
2851 /* Memory references now generally can involve a value conversion. */
2856 /* Verify if EXPR is a valid GIMPLE reference expression. If
2857 REQUIRE_LVALUE is true verifies it is an lvalue. Returns true
2858 if there is an error, otherwise false. */
2861 verify_types_in_gimple_reference (tree expr
, bool require_lvalue
)
2863 while (handled_component_p (expr
))
2865 tree op
= TREE_OPERAND (expr
, 0);
2867 if (TREE_CODE (expr
) == ARRAY_REF
2868 || TREE_CODE (expr
) == ARRAY_RANGE_REF
)
2870 if (!is_gimple_val (TREE_OPERAND (expr
, 1))
2871 || (TREE_OPERAND (expr
, 2)
2872 && !is_gimple_val (TREE_OPERAND (expr
, 2)))
2873 || (TREE_OPERAND (expr
, 3)
2874 && !is_gimple_val (TREE_OPERAND (expr
, 3))))
2876 error ("invalid operands to array reference");
2877 debug_generic_stmt (expr
);
2882 /* Verify if the reference array element types are compatible. */
2883 if (TREE_CODE (expr
) == ARRAY_REF
2884 && !useless_type_conversion_p (TREE_TYPE (expr
),
2885 TREE_TYPE (TREE_TYPE (op
))))
2887 error ("type mismatch in array reference");
2888 debug_generic_stmt (TREE_TYPE (expr
));
2889 debug_generic_stmt (TREE_TYPE (TREE_TYPE (op
)));
2892 if (TREE_CODE (expr
) == ARRAY_RANGE_REF
2893 && !useless_type_conversion_p (TREE_TYPE (TREE_TYPE (expr
)),
2894 TREE_TYPE (TREE_TYPE (op
))))
2896 error ("type mismatch in array range reference");
2897 debug_generic_stmt (TREE_TYPE (TREE_TYPE (expr
)));
2898 debug_generic_stmt (TREE_TYPE (TREE_TYPE (op
)));
2902 if ((TREE_CODE (expr
) == REALPART_EXPR
2903 || TREE_CODE (expr
) == IMAGPART_EXPR
)
2904 && !useless_type_conversion_p (TREE_TYPE (expr
),
2905 TREE_TYPE (TREE_TYPE (op
))))
2907 error ("type mismatch in real/imagpart reference");
2908 debug_generic_stmt (TREE_TYPE (expr
));
2909 debug_generic_stmt (TREE_TYPE (TREE_TYPE (op
)));
2913 if (TREE_CODE (expr
) == COMPONENT_REF
2914 && !useless_type_conversion_p (TREE_TYPE (expr
),
2915 TREE_TYPE (TREE_OPERAND (expr
, 1))))
2917 error ("type mismatch in component reference");
2918 debug_generic_stmt (TREE_TYPE (expr
));
2919 debug_generic_stmt (TREE_TYPE (TREE_OPERAND (expr
, 1)));
2923 if (TREE_CODE (expr
) == VIEW_CONVERT_EXPR
)
2925 /* For VIEW_CONVERT_EXPRs which are allowed here too, we only check
2926 that their operand is not an SSA name or an invariant when
2927 requiring an lvalue (this usually means there is a SRA or IPA-SRA
2928 bug). Otherwise there is nothing to verify, gross mismatches at
2929 most invoke undefined behavior. */
2931 && (TREE_CODE (op
) == SSA_NAME
2932 || is_gimple_min_invariant (op
)))
2934 error ("conversion of an SSA_NAME on the left hand side");
2935 debug_generic_stmt (expr
);
2938 else if (TREE_CODE (op
) == SSA_NAME
2939 && TYPE_SIZE (TREE_TYPE (expr
)) != TYPE_SIZE (TREE_TYPE (op
)))
2941 error ("conversion of register to a different size");
2942 debug_generic_stmt (expr
);
2945 else if (!handled_component_p (op
))
2952 if (TREE_CODE (expr
) == MEM_REF
)
2954 if (!is_gimple_mem_ref_addr (TREE_OPERAND (expr
, 0)))
2956 error ("invalid address operand in MEM_REF");
2957 debug_generic_stmt (expr
);
2960 if (TREE_CODE (TREE_OPERAND (expr
, 1)) != INTEGER_CST
2961 || !POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (expr
, 1))))
2963 error ("invalid offset operand in MEM_REF");
2964 debug_generic_stmt (expr
);
2968 else if (TREE_CODE (expr
) == TARGET_MEM_REF
)
2970 if (!TMR_BASE (expr
)
2971 || !is_gimple_mem_ref_addr (TMR_BASE (expr
)))
2973 error ("invalid address operand in TARGET_MEM_REF");
2976 if (!TMR_OFFSET (expr
)
2977 || TREE_CODE (TMR_OFFSET (expr
)) != INTEGER_CST
2978 || !POINTER_TYPE_P (TREE_TYPE (TMR_OFFSET (expr
))))
2980 error ("invalid offset operand in TARGET_MEM_REF");
2981 debug_generic_stmt (expr
);
2986 return ((require_lvalue
|| !is_gimple_min_invariant (expr
))
2987 && verify_types_in_gimple_min_lval (expr
));
2990 /* Returns true if there is one pointer type in TYPE_POINTER_TO (SRC_OBJ)
2991 list of pointer-to types that is trivially convertible to DEST. */
2994 one_pointer_to_useless_type_conversion_p (tree dest
, tree src_obj
)
2998 if (!TYPE_POINTER_TO (src_obj
))
3001 for (src
= TYPE_POINTER_TO (src_obj
); src
; src
= TYPE_NEXT_PTR_TO (src
))
3002 if (useless_type_conversion_p (dest
, src
))
3008 /* Return true if TYPE1 is a fixed-point type and if conversions to and
3009 from TYPE2 can be handled by FIXED_CONVERT_EXPR. */
3012 valid_fixed_convert_types_p (tree type1
, tree type2
)
3014 return (FIXED_POINT_TYPE_P (type1
)
3015 && (INTEGRAL_TYPE_P (type2
)
3016 || SCALAR_FLOAT_TYPE_P (type2
)
3017 || FIXED_POINT_TYPE_P (type2
)));
3020 /* Verify the contents of a GIMPLE_CALL STMT. Returns true when there
3021 is a problem, otherwise false. */
3024 verify_gimple_call (gimple stmt
)
3026 tree fn
= gimple_call_fn (stmt
);
3027 tree fntype
, fndecl
;
3030 if (gimple_call_internal_p (stmt
))
3034 error ("gimple call has two targets");
3035 debug_generic_stmt (fn
);
3043 error ("gimple call has no target");
3048 if (fn
&& !is_gimple_call_addr (fn
))
3050 error ("invalid function in gimple call");
3051 debug_generic_stmt (fn
);
3056 && (!POINTER_TYPE_P (TREE_TYPE (fn
))
3057 || (TREE_CODE (TREE_TYPE (TREE_TYPE (fn
))) != FUNCTION_TYPE
3058 && TREE_CODE (TREE_TYPE (TREE_TYPE (fn
))) != METHOD_TYPE
)))
3060 error ("non-function in gimple call");
3064 fndecl
= gimple_call_fndecl (stmt
);
3066 && TREE_CODE (fndecl
) == FUNCTION_DECL
3067 && DECL_LOOPING_CONST_OR_PURE_P (fndecl
)
3068 && !DECL_PURE_P (fndecl
)
3069 && !TREE_READONLY (fndecl
))
3071 error ("invalid pure const state for function");
3075 if (gimple_call_lhs (stmt
)
3076 && (!is_gimple_lvalue (gimple_call_lhs (stmt
))
3077 || verify_types_in_gimple_reference (gimple_call_lhs (stmt
), true)))
3079 error ("invalid LHS in gimple call");
3083 if (gimple_call_lhs (stmt
) && gimple_call_noreturn_p (stmt
))
3085 error ("LHS in noreturn call");
3089 fntype
= gimple_call_fntype (stmt
);
3091 && gimple_call_lhs (stmt
)
3092 && !useless_type_conversion_p (TREE_TYPE (gimple_call_lhs (stmt
)),
3094 /* ??? At least C++ misses conversions at assignments from
3095 void * call results.
3096 ??? Java is completely off. Especially with functions
3097 returning java.lang.Object.
3098 For now simply allow arbitrary pointer type conversions. */
3099 && !(POINTER_TYPE_P (TREE_TYPE (gimple_call_lhs (stmt
)))
3100 && POINTER_TYPE_P (TREE_TYPE (fntype
))))
3102 error ("invalid conversion in gimple call");
3103 debug_generic_stmt (TREE_TYPE (gimple_call_lhs (stmt
)));
3104 debug_generic_stmt (TREE_TYPE (fntype
));
3108 if (gimple_call_chain (stmt
)
3109 && !is_gimple_val (gimple_call_chain (stmt
)))
3111 error ("invalid static chain in gimple call");
3112 debug_generic_stmt (gimple_call_chain (stmt
));
3116 /* If there is a static chain argument, this should not be an indirect
3117 call, and the decl should have DECL_STATIC_CHAIN set. */
3118 if (gimple_call_chain (stmt
))
3120 if (!gimple_call_fndecl (stmt
))
3122 error ("static chain in indirect gimple call");
3125 fn
= TREE_OPERAND (fn
, 0);
3127 if (!DECL_STATIC_CHAIN (fn
))
3129 error ("static chain with function that doesn%'t use one");
3134 /* ??? The C frontend passes unpromoted arguments in case it
3135 didn't see a function declaration before the call. So for now
3136 leave the call arguments mostly unverified. Once we gimplify
3137 unit-at-a-time we have a chance to fix this. */
3139 for (i
= 0; i
< gimple_call_num_args (stmt
); ++i
)
3141 tree arg
= gimple_call_arg (stmt
, i
);
3142 if ((is_gimple_reg_type (TREE_TYPE (arg
))
3143 && !is_gimple_val (arg
))
3144 || (!is_gimple_reg_type (TREE_TYPE (arg
))
3145 && !is_gimple_lvalue (arg
)))
3147 error ("invalid argument to gimple call");
3148 debug_generic_expr (arg
);
3156 /* Verifies the gimple comparison with the result type TYPE and
3157 the operands OP0 and OP1. */
3160 verify_gimple_comparison (tree type
, tree op0
, tree op1
)
3162 tree op0_type
= TREE_TYPE (op0
);
3163 tree op1_type
= TREE_TYPE (op1
);
3165 if (!is_gimple_val (op0
) || !is_gimple_val (op1
))
3167 error ("invalid operands in gimple comparison");
3171 /* For comparisons we do not have the operations type as the
3172 effective type the comparison is carried out in. Instead
3173 we require that either the first operand is trivially
3174 convertible into the second, or the other way around.
3175 Because we special-case pointers to void we allow
3176 comparisons of pointers with the same mode as well. */
3177 if (!useless_type_conversion_p (op0_type
, op1_type
)
3178 && !useless_type_conversion_p (op1_type
, op0_type
)
3179 && (!POINTER_TYPE_P (op0_type
)
3180 || !POINTER_TYPE_P (op1_type
)
3181 || TYPE_MODE (op0_type
) != TYPE_MODE (op1_type
)))
3183 error ("mismatching comparison operand types");
3184 debug_generic_expr (op0_type
);
3185 debug_generic_expr (op1_type
);
3189 /* The resulting type of a comparison may be an effective boolean type. */
3190 if (INTEGRAL_TYPE_P (type
)
3191 && (TREE_CODE (type
) == BOOLEAN_TYPE
3192 || TYPE_PRECISION (type
) == 1))
3194 if (TREE_CODE (op0_type
) == VECTOR_TYPE
3195 || TREE_CODE (op1_type
) == VECTOR_TYPE
)
3197 error ("vector comparison returning a boolean");
3198 debug_generic_expr (op0_type
);
3199 debug_generic_expr (op1_type
);
3203 /* Or an integer vector type with the same size and element count
3204 as the comparison operand types. */
3205 else if (TREE_CODE (type
) == VECTOR_TYPE
3206 && TREE_CODE (TREE_TYPE (type
)) == INTEGER_TYPE
)
3208 if (TREE_CODE (op0_type
) != VECTOR_TYPE
3209 || TREE_CODE (op1_type
) != VECTOR_TYPE
)
3211 error ("non-vector operands in vector comparison");
3212 debug_generic_expr (op0_type
);
3213 debug_generic_expr (op1_type
);
3217 if (TYPE_VECTOR_SUBPARTS (type
) != TYPE_VECTOR_SUBPARTS (op0_type
)
3218 || (GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (type
)))
3219 != GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (op0_type
))))
3220 /* The result of a vector comparison is of signed
3222 || TYPE_UNSIGNED (TREE_TYPE (type
)))
3224 error ("invalid vector comparison resulting type");
3225 debug_generic_expr (type
);
3231 error ("bogus comparison result type");
3232 debug_generic_expr (type
);
3239 /* Verify a gimple assignment statement STMT with an unary rhs.
3240 Returns true if anything is wrong. */
3243 verify_gimple_assign_unary (gimple stmt
)
3245 enum tree_code rhs_code
= gimple_assign_rhs_code (stmt
);
3246 tree lhs
= gimple_assign_lhs (stmt
);
3247 tree lhs_type
= TREE_TYPE (lhs
);
3248 tree rhs1
= gimple_assign_rhs1 (stmt
);
3249 tree rhs1_type
= TREE_TYPE (rhs1
);
3251 if (!is_gimple_reg (lhs
))
3253 error ("non-register as LHS of unary operation");
3257 if (!is_gimple_val (rhs1
))
3259 error ("invalid operand in unary operation");
3263 /* First handle conversions. */
3268 /* Allow conversions from pointer type to integral type only if
3269 there is no sign or zero extension involved.
3270 For targets were the precision of ptrofftype doesn't match that
3271 of pointers we need to allow arbitrary conversions to ptrofftype. */
3272 if ((POINTER_TYPE_P (lhs_type
)
3273 && INTEGRAL_TYPE_P (rhs1_type
))
3274 || (POINTER_TYPE_P (rhs1_type
)
3275 && INTEGRAL_TYPE_P (lhs_type
)
3276 && (TYPE_PRECISION (rhs1_type
) >= TYPE_PRECISION (lhs_type
)
3277 || ptrofftype_p (sizetype
))))
3280 /* Allow conversion from integral to offset type and vice versa. */
3281 if ((TREE_CODE (lhs_type
) == OFFSET_TYPE
3282 && INTEGRAL_TYPE_P (rhs1_type
))
3283 || (INTEGRAL_TYPE_P (lhs_type
)
3284 && TREE_CODE (rhs1_type
) == OFFSET_TYPE
))
3287 /* Otherwise assert we are converting between types of the
3289 if (INTEGRAL_TYPE_P (lhs_type
) != INTEGRAL_TYPE_P (rhs1_type
))
3291 error ("invalid types in nop conversion");
3292 debug_generic_expr (lhs_type
);
3293 debug_generic_expr (rhs1_type
);
3300 case ADDR_SPACE_CONVERT_EXPR
:
3302 if (!POINTER_TYPE_P (rhs1_type
) || !POINTER_TYPE_P (lhs_type
)
3303 || (TYPE_ADDR_SPACE (TREE_TYPE (rhs1_type
))
3304 == TYPE_ADDR_SPACE (TREE_TYPE (lhs_type
))))
3306 error ("invalid types in address space conversion");
3307 debug_generic_expr (lhs_type
);
3308 debug_generic_expr (rhs1_type
);
3315 case FIXED_CONVERT_EXPR
:
3317 if (!valid_fixed_convert_types_p (lhs_type
, rhs1_type
)
3318 && !valid_fixed_convert_types_p (rhs1_type
, lhs_type
))
3320 error ("invalid types in fixed-point conversion");
3321 debug_generic_expr (lhs_type
);
3322 debug_generic_expr (rhs1_type
);
3331 if ((!INTEGRAL_TYPE_P (rhs1_type
) || !SCALAR_FLOAT_TYPE_P (lhs_type
))
3332 && (!VECTOR_INTEGER_TYPE_P (rhs1_type
)
3333 || !VECTOR_FLOAT_TYPE_P (lhs_type
)))
3335 error ("invalid types in conversion to floating point");
3336 debug_generic_expr (lhs_type
);
3337 debug_generic_expr (rhs1_type
);
3344 case FIX_TRUNC_EXPR
:
3346 if ((!INTEGRAL_TYPE_P (lhs_type
) || !SCALAR_FLOAT_TYPE_P (rhs1_type
))
3347 && (!VECTOR_INTEGER_TYPE_P (lhs_type
)
3348 || !VECTOR_FLOAT_TYPE_P (rhs1_type
)))
3350 error ("invalid types in conversion to integer");
3351 debug_generic_expr (lhs_type
);
3352 debug_generic_expr (rhs1_type
);
3359 case VEC_UNPACK_HI_EXPR
:
3360 case VEC_UNPACK_LO_EXPR
:
3361 case REDUC_MAX_EXPR
:
3362 case REDUC_MIN_EXPR
:
3363 case REDUC_PLUS_EXPR
:
3364 case VEC_UNPACK_FLOAT_HI_EXPR
:
3365 case VEC_UNPACK_FLOAT_LO_EXPR
:
3373 case NON_LVALUE_EXPR
:
3381 /* For the remaining codes assert there is no conversion involved. */
3382 if (!useless_type_conversion_p (lhs_type
, rhs1_type
))
3384 error ("non-trivial conversion in unary operation");
3385 debug_generic_expr (lhs_type
);
3386 debug_generic_expr (rhs1_type
);
3393 /* Verify a gimple assignment statement STMT with a binary rhs.
3394 Returns true if anything is wrong. */
3397 verify_gimple_assign_binary (gimple stmt
)
3399 enum tree_code rhs_code
= gimple_assign_rhs_code (stmt
);
3400 tree lhs
= gimple_assign_lhs (stmt
);
3401 tree lhs_type
= TREE_TYPE (lhs
);
3402 tree rhs1
= gimple_assign_rhs1 (stmt
);
3403 tree rhs1_type
= TREE_TYPE (rhs1
);
3404 tree rhs2
= gimple_assign_rhs2 (stmt
);
3405 tree rhs2_type
= TREE_TYPE (rhs2
);
3407 if (!is_gimple_reg (lhs
))
3409 error ("non-register as LHS of binary operation");
3413 if (!is_gimple_val (rhs1
)
3414 || !is_gimple_val (rhs2
))
3416 error ("invalid operands in binary operation");
3420 /* First handle operations that involve different types. */
3425 if (TREE_CODE (lhs_type
) != COMPLEX_TYPE
3426 || !(INTEGRAL_TYPE_P (rhs1_type
)
3427 || SCALAR_FLOAT_TYPE_P (rhs1_type
))
3428 || !(INTEGRAL_TYPE_P (rhs2_type
)
3429 || SCALAR_FLOAT_TYPE_P (rhs2_type
)))
3431 error ("type mismatch in complex expression");
3432 debug_generic_expr (lhs_type
);
3433 debug_generic_expr (rhs1_type
);
3434 debug_generic_expr (rhs2_type
);
3446 /* Shifts and rotates are ok on integral types, fixed point
3447 types and integer vector types. */
3448 if ((!INTEGRAL_TYPE_P (rhs1_type
)
3449 && !FIXED_POINT_TYPE_P (rhs1_type
)
3450 && !(TREE_CODE (rhs1_type
) == VECTOR_TYPE
3451 && INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type
))))
3452 || (!INTEGRAL_TYPE_P (rhs2_type
)
3453 /* Vector shifts of vectors are also ok. */
3454 && !(TREE_CODE (rhs1_type
) == VECTOR_TYPE
3455 && INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type
))
3456 && TREE_CODE (rhs2_type
) == VECTOR_TYPE
3457 && INTEGRAL_TYPE_P (TREE_TYPE (rhs2_type
))))
3458 || !useless_type_conversion_p (lhs_type
, rhs1_type
))
3460 error ("type mismatch in shift expression");
3461 debug_generic_expr (lhs_type
);
3462 debug_generic_expr (rhs1_type
);
3463 debug_generic_expr (rhs2_type
);
3470 case VEC_LSHIFT_EXPR
:
3471 case VEC_RSHIFT_EXPR
:
3473 if (TREE_CODE (rhs1_type
) != VECTOR_TYPE
3474 || !(INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type
))
3475 || POINTER_TYPE_P (TREE_TYPE (rhs1_type
))
3476 || FIXED_POINT_TYPE_P (TREE_TYPE (rhs1_type
))
3477 || SCALAR_FLOAT_TYPE_P (TREE_TYPE (rhs1_type
)))
3478 || (!INTEGRAL_TYPE_P (rhs2_type
)
3479 && (TREE_CODE (rhs2_type
) != VECTOR_TYPE
3480 || !INTEGRAL_TYPE_P (TREE_TYPE (rhs2_type
))))
3481 || !useless_type_conversion_p (lhs_type
, rhs1_type
))
3483 error ("type mismatch in vector shift expression");
3484 debug_generic_expr (lhs_type
);
3485 debug_generic_expr (rhs1_type
);
3486 debug_generic_expr (rhs2_type
);
3489 /* For shifting a vector of non-integral components we
3490 only allow shifting by a constant multiple of the element size. */
3491 if (!INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type
))
3492 && (TREE_CODE (rhs2
) != INTEGER_CST
3493 || !div_if_zero_remainder (EXACT_DIV_EXPR
, rhs2
,
3494 TYPE_SIZE (TREE_TYPE (rhs1_type
)))))
3496 error ("non-element sized vector shift of floating point vector");
3503 case WIDEN_LSHIFT_EXPR
:
3505 if (!INTEGRAL_TYPE_P (lhs_type
)
3506 || !INTEGRAL_TYPE_P (rhs1_type
)
3507 || TREE_CODE (rhs2
) != INTEGER_CST
3508 || (2 * TYPE_PRECISION (rhs1_type
) > TYPE_PRECISION (lhs_type
)))
3510 error ("type mismatch in widening vector shift expression");
3511 debug_generic_expr (lhs_type
);
3512 debug_generic_expr (rhs1_type
);
3513 debug_generic_expr (rhs2_type
);
3520 case VEC_WIDEN_LSHIFT_HI_EXPR
:
3521 case VEC_WIDEN_LSHIFT_LO_EXPR
:
3523 if (TREE_CODE (rhs1_type
) != VECTOR_TYPE
3524 || TREE_CODE (lhs_type
) != VECTOR_TYPE
3525 || !INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type
))
3526 || !INTEGRAL_TYPE_P (TREE_TYPE (lhs_type
))
3527 || TREE_CODE (rhs2
) != INTEGER_CST
3528 || (2 * TYPE_PRECISION (TREE_TYPE (rhs1_type
))
3529 > TYPE_PRECISION (TREE_TYPE (lhs_type
))))
3531 error ("type mismatch in widening vector shift expression");
3532 debug_generic_expr (lhs_type
);
3533 debug_generic_expr (rhs1_type
);
3534 debug_generic_expr (rhs2_type
);
3544 tree lhs_etype
= lhs_type
;
3545 tree rhs1_etype
= rhs1_type
;
3546 tree rhs2_etype
= rhs2_type
;
3547 if (TREE_CODE (lhs_type
) == VECTOR_TYPE
)
3549 if (TREE_CODE (rhs1_type
) != VECTOR_TYPE
3550 || TREE_CODE (rhs2_type
) != VECTOR_TYPE
)
3552 error ("invalid non-vector operands to vector valued plus");
3555 lhs_etype
= TREE_TYPE (lhs_type
);
3556 rhs1_etype
= TREE_TYPE (rhs1_type
);
3557 rhs2_etype
= TREE_TYPE (rhs2_type
);
3559 if (POINTER_TYPE_P (lhs_etype
)
3560 || POINTER_TYPE_P (rhs1_etype
)
3561 || POINTER_TYPE_P (rhs2_etype
))
3563 error ("invalid (pointer) operands to plus/minus");
3567 /* Continue with generic binary expression handling. */
3571 case POINTER_PLUS_EXPR
:
3573 if (!POINTER_TYPE_P (rhs1_type
)
3574 || !useless_type_conversion_p (lhs_type
, rhs1_type
)
3575 || !ptrofftype_p (rhs2_type
))
3577 error ("type mismatch in pointer plus expression");
3578 debug_generic_stmt (lhs_type
);
3579 debug_generic_stmt (rhs1_type
);
3580 debug_generic_stmt (rhs2_type
);
3587 case TRUTH_ANDIF_EXPR
:
3588 case TRUTH_ORIF_EXPR
:
3589 case TRUTH_AND_EXPR
:
3591 case TRUTH_XOR_EXPR
:
3601 case UNORDERED_EXPR
:
3609 /* Comparisons are also binary, but the result type is not
3610 connected to the operand types. */
3611 return verify_gimple_comparison (lhs_type
, rhs1
, rhs2
);
3613 case WIDEN_MULT_EXPR
:
3614 if (TREE_CODE (lhs_type
) != INTEGER_TYPE
)
3616 return ((2 * TYPE_PRECISION (rhs1_type
) > TYPE_PRECISION (lhs_type
))
3617 || (TYPE_PRECISION (rhs1_type
) != TYPE_PRECISION (rhs2_type
)));
3619 case WIDEN_SUM_EXPR
:
3620 case VEC_WIDEN_MULT_HI_EXPR
:
3621 case VEC_WIDEN_MULT_LO_EXPR
:
3622 case VEC_WIDEN_MULT_EVEN_EXPR
:
3623 case VEC_WIDEN_MULT_ODD_EXPR
:
3624 case VEC_PACK_TRUNC_EXPR
:
3625 case VEC_PACK_SAT_EXPR
:
3626 case VEC_PACK_FIX_TRUNC_EXPR
:
3631 case MULT_HIGHPART_EXPR
:
3632 case TRUNC_DIV_EXPR
:
3634 case FLOOR_DIV_EXPR
:
3635 case ROUND_DIV_EXPR
:
3636 case TRUNC_MOD_EXPR
:
3638 case FLOOR_MOD_EXPR
:
3639 case ROUND_MOD_EXPR
:
3641 case EXACT_DIV_EXPR
:
3647 /* Continue with generic binary expression handling. */
3654 if (!useless_type_conversion_p (lhs_type
, rhs1_type
)
3655 || !useless_type_conversion_p (lhs_type
, rhs2_type
))
3657 error ("type mismatch in binary expression");
3658 debug_generic_stmt (lhs_type
);
3659 debug_generic_stmt (rhs1_type
);
3660 debug_generic_stmt (rhs2_type
);
3667 /* Verify a gimple assignment statement STMT with a ternary rhs.
3668 Returns true if anything is wrong. */
3671 verify_gimple_assign_ternary (gimple stmt
)
3673 enum tree_code rhs_code
= gimple_assign_rhs_code (stmt
);
3674 tree lhs
= gimple_assign_lhs (stmt
);
3675 tree lhs_type
= TREE_TYPE (lhs
);
3676 tree rhs1
= gimple_assign_rhs1 (stmt
);
3677 tree rhs1_type
= TREE_TYPE (rhs1
);
3678 tree rhs2
= gimple_assign_rhs2 (stmt
);
3679 tree rhs2_type
= TREE_TYPE (rhs2
);
3680 tree rhs3
= gimple_assign_rhs3 (stmt
);
3681 tree rhs3_type
= TREE_TYPE (rhs3
);
3683 if (!is_gimple_reg (lhs
))
3685 error ("non-register as LHS of ternary operation");
3689 if (((rhs_code
== VEC_COND_EXPR
|| rhs_code
== COND_EXPR
)
3690 ? !is_gimple_condexpr (rhs1
) : !is_gimple_val (rhs1
))
3691 || !is_gimple_val (rhs2
)
3692 || !is_gimple_val (rhs3
))
3694 error ("invalid operands in ternary operation");
3698 /* First handle operations that involve different types. */
3701 case WIDEN_MULT_PLUS_EXPR
:
3702 case WIDEN_MULT_MINUS_EXPR
:
3703 if ((!INTEGRAL_TYPE_P (rhs1_type
)
3704 && !FIXED_POINT_TYPE_P (rhs1_type
))
3705 || !useless_type_conversion_p (rhs1_type
, rhs2_type
)
3706 || !useless_type_conversion_p (lhs_type
, rhs3_type
)
3707 || 2 * TYPE_PRECISION (rhs1_type
) > TYPE_PRECISION (lhs_type
)
3708 || TYPE_PRECISION (rhs1_type
) != TYPE_PRECISION (rhs2_type
))
3710 error ("type mismatch in widening multiply-accumulate expression");
3711 debug_generic_expr (lhs_type
);
3712 debug_generic_expr (rhs1_type
);
3713 debug_generic_expr (rhs2_type
);
3714 debug_generic_expr (rhs3_type
);
3720 if (!useless_type_conversion_p (lhs_type
, rhs1_type
)
3721 || !useless_type_conversion_p (lhs_type
, rhs2_type
)
3722 || !useless_type_conversion_p (lhs_type
, rhs3_type
))
3724 error ("type mismatch in fused multiply-add expression");
3725 debug_generic_expr (lhs_type
);
3726 debug_generic_expr (rhs1_type
);
3727 debug_generic_expr (rhs2_type
);
3728 debug_generic_expr (rhs3_type
);
3735 if (!useless_type_conversion_p (lhs_type
, rhs2_type
)
3736 || !useless_type_conversion_p (lhs_type
, rhs3_type
))
3738 error ("type mismatch in conditional expression");
3739 debug_generic_expr (lhs_type
);
3740 debug_generic_expr (rhs2_type
);
3741 debug_generic_expr (rhs3_type
);
3747 if (!useless_type_conversion_p (lhs_type
, rhs1_type
)
3748 || !useless_type_conversion_p (lhs_type
, rhs2_type
))
3750 error ("type mismatch in vector permute expression");
3751 debug_generic_expr (lhs_type
);
3752 debug_generic_expr (rhs1_type
);
3753 debug_generic_expr (rhs2_type
);
3754 debug_generic_expr (rhs3_type
);
3758 if (TREE_CODE (rhs1_type
) != VECTOR_TYPE
3759 || TREE_CODE (rhs2_type
) != VECTOR_TYPE
3760 || TREE_CODE (rhs3_type
) != VECTOR_TYPE
)
3762 error ("vector types expected in vector permute expression");
3763 debug_generic_expr (lhs_type
);
3764 debug_generic_expr (rhs1_type
);
3765 debug_generic_expr (rhs2_type
);
3766 debug_generic_expr (rhs3_type
);
3770 if (TYPE_VECTOR_SUBPARTS (rhs1_type
) != TYPE_VECTOR_SUBPARTS (rhs2_type
)
3771 || TYPE_VECTOR_SUBPARTS (rhs2_type
)
3772 != TYPE_VECTOR_SUBPARTS (rhs3_type
)
3773 || TYPE_VECTOR_SUBPARTS (rhs3_type
)
3774 != TYPE_VECTOR_SUBPARTS (lhs_type
))
3776 error ("vectors with different element number found "
3777 "in vector permute expression");
3778 debug_generic_expr (lhs_type
);
3779 debug_generic_expr (rhs1_type
);
3780 debug_generic_expr (rhs2_type
);
3781 debug_generic_expr (rhs3_type
);
3785 if (TREE_CODE (TREE_TYPE (rhs3_type
)) != INTEGER_TYPE
3786 || GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (rhs3_type
)))
3787 != GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (rhs1_type
))))
3789 error ("invalid mask type in vector permute expression");
3790 debug_generic_expr (lhs_type
);
3791 debug_generic_expr (rhs1_type
);
3792 debug_generic_expr (rhs2_type
);
3793 debug_generic_expr (rhs3_type
);
3800 case REALIGN_LOAD_EXPR
:
3810 /* Verify a gimple assignment statement STMT with a single rhs.
3811 Returns true if anything is wrong. */
3814 verify_gimple_assign_single (gimple stmt
)
3816 enum tree_code rhs_code
= gimple_assign_rhs_code (stmt
);
3817 tree lhs
= gimple_assign_lhs (stmt
);
3818 tree lhs_type
= TREE_TYPE (lhs
);
3819 tree rhs1
= gimple_assign_rhs1 (stmt
);
3820 tree rhs1_type
= TREE_TYPE (rhs1
);
3823 if (!useless_type_conversion_p (lhs_type
, rhs1_type
))
3825 error ("non-trivial conversion at assignment");
3826 debug_generic_expr (lhs_type
);
3827 debug_generic_expr (rhs1_type
);
3831 if (gimple_clobber_p (stmt
)
3832 && !(DECL_P (lhs
) || TREE_CODE (lhs
) == MEM_REF
))
3834 error ("non-decl/MEM_REF LHS in clobber statement");
3835 debug_generic_expr (lhs
);
3839 if (handled_component_p (lhs
))
3840 res
|= verify_types_in_gimple_reference (lhs
, true);
3842 /* Special codes we cannot handle via their class. */
3847 tree op
= TREE_OPERAND (rhs1
, 0);
3848 if (!is_gimple_addressable (op
))
3850 error ("invalid operand in unary expression");
3854 /* Technically there is no longer a need for matching types, but
3855 gimple hygiene asks for this check. In LTO we can end up
3856 combining incompatible units and thus end up with addresses
3857 of globals that change their type to a common one. */
3859 && !types_compatible_p (TREE_TYPE (op
),
3860 TREE_TYPE (TREE_TYPE (rhs1
)))
3861 && !one_pointer_to_useless_type_conversion_p (TREE_TYPE (rhs1
),
3864 error ("type mismatch in address expression");
3865 debug_generic_stmt (TREE_TYPE (rhs1
));
3866 debug_generic_stmt (TREE_TYPE (op
));
3870 return verify_types_in_gimple_reference (op
, true);
3875 error ("INDIRECT_REF in gimple IL");
3881 case ARRAY_RANGE_REF
:
3882 case VIEW_CONVERT_EXPR
:
3885 case TARGET_MEM_REF
:
3887 if (!is_gimple_reg (lhs
)
3888 && is_gimple_reg_type (TREE_TYPE (lhs
)))
3890 error ("invalid rhs for gimple memory store");
3891 debug_generic_stmt (lhs
);
3892 debug_generic_stmt (rhs1
);
3895 return res
|| verify_types_in_gimple_reference (rhs1
, false);
3907 /* tcc_declaration */
3912 if (!is_gimple_reg (lhs
)
3913 && !is_gimple_reg (rhs1
)
3914 && is_gimple_reg_type (TREE_TYPE (lhs
)))
3916 error ("invalid rhs for gimple memory store");
3917 debug_generic_stmt (lhs
);
3918 debug_generic_stmt (rhs1
);
3924 if (TREE_CODE (rhs1_type
) == VECTOR_TYPE
)
3927 tree elt_i
, elt_v
, elt_t
= NULL_TREE
;
3929 if (CONSTRUCTOR_NELTS (rhs1
) == 0)
3931 /* For vector CONSTRUCTORs we require that either it is empty
3932 CONSTRUCTOR, or it is a CONSTRUCTOR of smaller vector elements
3933 (then the element count must be correct to cover the whole
3934 outer vector and index must be NULL on all elements, or it is
3935 a CONSTRUCTOR of scalar elements, where we as an exception allow
3936 smaller number of elements (assuming zero filling) and
3937 consecutive indexes as compared to NULL indexes (such
3938 CONSTRUCTORs can appear in the IL from FEs). */
3939 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (rhs1
), i
, elt_i
, elt_v
)
3941 if (elt_t
== NULL_TREE
)
3943 elt_t
= TREE_TYPE (elt_v
);
3944 if (TREE_CODE (elt_t
) == VECTOR_TYPE
)
3946 tree elt_t
= TREE_TYPE (elt_v
);
3947 if (!useless_type_conversion_p (TREE_TYPE (rhs1_type
),
3950 error ("incorrect type of vector CONSTRUCTOR"
3952 debug_generic_stmt (rhs1
);
3955 else if (CONSTRUCTOR_NELTS (rhs1
)
3956 * TYPE_VECTOR_SUBPARTS (elt_t
)
3957 != TYPE_VECTOR_SUBPARTS (rhs1_type
))
3959 error ("incorrect number of vector CONSTRUCTOR"
3961 debug_generic_stmt (rhs1
);
3965 else if (!useless_type_conversion_p (TREE_TYPE (rhs1_type
),
3968 error ("incorrect type of vector CONSTRUCTOR elements");
3969 debug_generic_stmt (rhs1
);
3972 else if (CONSTRUCTOR_NELTS (rhs1
)
3973 > TYPE_VECTOR_SUBPARTS (rhs1_type
))
3975 error ("incorrect number of vector CONSTRUCTOR elements");
3976 debug_generic_stmt (rhs1
);
3980 else if (!useless_type_conversion_p (elt_t
, TREE_TYPE (elt_v
)))
3982 error ("incorrect type of vector CONSTRUCTOR elements");
3983 debug_generic_stmt (rhs1
);
3986 if (elt_i
!= NULL_TREE
3987 && (TREE_CODE (elt_t
) == VECTOR_TYPE
3988 || TREE_CODE (elt_i
) != INTEGER_CST
3989 || compare_tree_int (elt_i
, i
) != 0))
3991 error ("vector CONSTRUCTOR with non-NULL element index");
3992 debug_generic_stmt (rhs1
);
4000 case WITH_SIZE_EXPR
:
4010 /* Verify the contents of a GIMPLE_ASSIGN STMT. Returns true when there
4011 is a problem, otherwise false. */
4014 verify_gimple_assign (gimple stmt
)
4016 switch (gimple_assign_rhs_class (stmt
))
4018 case GIMPLE_SINGLE_RHS
:
4019 return verify_gimple_assign_single (stmt
);
4021 case GIMPLE_UNARY_RHS
:
4022 return verify_gimple_assign_unary (stmt
);
4024 case GIMPLE_BINARY_RHS
:
4025 return verify_gimple_assign_binary (stmt
);
4027 case GIMPLE_TERNARY_RHS
:
4028 return verify_gimple_assign_ternary (stmt
);
4035 /* Verify the contents of a GIMPLE_RETURN STMT. Returns true when there
4036 is a problem, otherwise false. */
4039 verify_gimple_return (gimple stmt
)
4041 tree op
= gimple_return_retval (stmt
);
4042 tree restype
= TREE_TYPE (TREE_TYPE (cfun
->decl
));
4044 /* We cannot test for present return values as we do not fix up missing
4045 return values from the original source. */
4049 if (!is_gimple_val (op
)
4050 && TREE_CODE (op
) != RESULT_DECL
)
4052 error ("invalid operand in return statement");
4053 debug_generic_stmt (op
);
4057 if ((TREE_CODE (op
) == RESULT_DECL
4058 && DECL_BY_REFERENCE (op
))
4059 || (TREE_CODE (op
) == SSA_NAME
4060 && SSA_NAME_VAR (op
)
4061 && TREE_CODE (SSA_NAME_VAR (op
)) == RESULT_DECL
4062 && DECL_BY_REFERENCE (SSA_NAME_VAR (op
))))
4063 op
= TREE_TYPE (op
);
4065 if (!useless_type_conversion_p (restype
, TREE_TYPE (op
)))
4067 error ("invalid conversion in return statement");
4068 debug_generic_stmt (restype
);
4069 debug_generic_stmt (TREE_TYPE (op
));
4077 /* Verify the contents of a GIMPLE_GOTO STMT. Returns true when there
4078 is a problem, otherwise false. */
4081 verify_gimple_goto (gimple stmt
)
4083 tree dest
= gimple_goto_dest (stmt
);
4085 /* ??? We have two canonical forms of direct goto destinations, a
4086 bare LABEL_DECL and an ADDR_EXPR of a LABEL_DECL. */
4087 if (TREE_CODE (dest
) != LABEL_DECL
4088 && (!is_gimple_val (dest
)
4089 || !POINTER_TYPE_P (TREE_TYPE (dest
))))
4091 error ("goto destination is neither a label nor a pointer");
4098 /* Verify the contents of a GIMPLE_SWITCH STMT. Returns true when there
4099 is a problem, otherwise false. */
4102 verify_gimple_switch (gimple stmt
)
4105 tree elt
, prev_upper_bound
= NULL_TREE
;
4106 tree index_type
, elt_type
= NULL_TREE
;
4108 if (!is_gimple_val (gimple_switch_index (stmt
)))
4110 error ("invalid operand to switch statement");
4111 debug_generic_stmt (gimple_switch_index (stmt
));
4115 index_type
= TREE_TYPE (gimple_switch_index (stmt
));
4116 if (! INTEGRAL_TYPE_P (index_type
))
4118 error ("non-integral type switch statement");
4119 debug_generic_expr (index_type
);
4123 elt
= gimple_switch_label (stmt
, 0);
4124 if (CASE_LOW (elt
) != NULL_TREE
|| CASE_HIGH (elt
) != NULL_TREE
)
4126 error ("invalid default case label in switch statement");
4127 debug_generic_expr (elt
);
4131 n
= gimple_switch_num_labels (stmt
);
4132 for (i
= 1; i
< n
; i
++)
4134 elt
= gimple_switch_label (stmt
, i
);
4136 if (! CASE_LOW (elt
))
4138 error ("invalid case label in switch statement");
4139 debug_generic_expr (elt
);
4143 && ! tree_int_cst_lt (CASE_LOW (elt
), CASE_HIGH (elt
)))
4145 error ("invalid case range in switch statement");
4146 debug_generic_expr (elt
);
4152 if (TREE_TYPE (CASE_LOW (elt
)) != elt_type
4153 || (CASE_HIGH (elt
) && TREE_TYPE (CASE_HIGH (elt
)) != elt_type
))
4155 error ("type mismatch for case label in switch statement");
4156 debug_generic_expr (elt
);
4162 elt_type
= TREE_TYPE (CASE_LOW (elt
));
4163 if (TYPE_PRECISION (index_type
) < TYPE_PRECISION (elt_type
))
4165 error ("type precision mismatch in switch statement");
4170 if (prev_upper_bound
)
4172 if (! tree_int_cst_lt (prev_upper_bound
, CASE_LOW (elt
)))
4174 error ("case labels not sorted in switch statement");
4179 prev_upper_bound
= CASE_HIGH (elt
);
4180 if (! prev_upper_bound
)
4181 prev_upper_bound
= CASE_LOW (elt
);
4187 /* Verify a gimple debug statement STMT.
4188 Returns true if anything is wrong. */
4191 verify_gimple_debug (gimple stmt ATTRIBUTE_UNUSED
)
4193 /* There isn't much that could be wrong in a gimple debug stmt. A
4194 gimple debug bind stmt, for example, maps a tree, that's usually
4195 a VAR_DECL or a PARM_DECL, but that could also be some scalarized
4196 component or member of an aggregate type, to another tree, that
4197 can be an arbitrary expression. These stmts expand into debug
4198 insns, and are converted to debug notes by var-tracking.c. */
4202 /* Verify a gimple label statement STMT.
4203 Returns true if anything is wrong. */
4206 verify_gimple_label (gimple stmt
)
4208 tree decl
= gimple_label_label (stmt
);
4212 if (TREE_CODE (decl
) != LABEL_DECL
)
4214 if (!DECL_NONLOCAL (decl
) && !FORCED_LABEL (decl
)
4215 && DECL_CONTEXT (decl
) != current_function_decl
)
4217 error ("label's context is not the current function decl");
4221 uid
= LABEL_DECL_UID (decl
);
4223 && (uid
== -1 || (*label_to_block_map
)[uid
] != gimple_bb (stmt
)))
4225 error ("incorrect entry in label_to_block_map");
4229 uid
= EH_LANDING_PAD_NR (decl
);
4232 eh_landing_pad lp
= get_eh_landing_pad_from_number (uid
);
4233 if (decl
!= lp
->post_landing_pad
)
4235 error ("incorrect setting of landing pad number");
4243 /* Verify the GIMPLE statement STMT. Returns true if there is an
4244 error, otherwise false. */
4247 verify_gimple_stmt (gimple stmt
)
4249 switch (gimple_code (stmt
))
4252 return verify_gimple_assign (stmt
);
4255 return verify_gimple_label (stmt
);
4258 return verify_gimple_call (stmt
);
4261 if (TREE_CODE_CLASS (gimple_cond_code (stmt
)) != tcc_comparison
)
4263 error ("invalid comparison code in gimple cond");
4266 if (!(!gimple_cond_true_label (stmt
)
4267 || TREE_CODE (gimple_cond_true_label (stmt
)) == LABEL_DECL
)
4268 || !(!gimple_cond_false_label (stmt
)
4269 || TREE_CODE (gimple_cond_false_label (stmt
)) == LABEL_DECL
))
4271 error ("invalid labels in gimple cond");
4275 return verify_gimple_comparison (boolean_type_node
,
4276 gimple_cond_lhs (stmt
),
4277 gimple_cond_rhs (stmt
));
4280 return verify_gimple_goto (stmt
);
4283 return verify_gimple_switch (stmt
);
4286 return verify_gimple_return (stmt
);
4291 case GIMPLE_TRANSACTION
:
4292 return verify_gimple_transaction (stmt
);
4294 /* Tuples that do not have tree operands. */
4296 case GIMPLE_PREDICT
:
4298 case GIMPLE_EH_DISPATCH
:
4299 case GIMPLE_EH_MUST_NOT_THROW
:
4303 /* OpenMP directives are validated by the FE and never operated
4304 on by the optimizers. Furthermore, GIMPLE_OMP_FOR may contain
4305 non-gimple expressions when the main index variable has had
4306 its address taken. This does not affect the loop itself
4307 because the header of an GIMPLE_OMP_FOR is merely used to determine
4308 how to setup the parallel iteration. */
4312 return verify_gimple_debug (stmt
);
4319 /* Verify the contents of a GIMPLE_PHI. Returns true if there is a problem,
4320 and false otherwise. */
4323 verify_gimple_phi (gimple phi
)
4327 tree phi_result
= gimple_phi_result (phi
);
4332 error ("invalid PHI result");
4336 virtual_p
= virtual_operand_p (phi_result
);
4337 if (TREE_CODE (phi_result
) != SSA_NAME
4339 && SSA_NAME_VAR (phi_result
) != gimple_vop (cfun
)))
4341 error ("invalid PHI result");
4345 for (i
= 0; i
< gimple_phi_num_args (phi
); i
++)
4347 tree t
= gimple_phi_arg_def (phi
, i
);
4351 error ("missing PHI def");
4355 /* Addressable variables do have SSA_NAMEs but they
4356 are not considered gimple values. */
4357 else if ((TREE_CODE (t
) == SSA_NAME
4358 && virtual_p
!= virtual_operand_p (t
))
4360 && (TREE_CODE (t
) != SSA_NAME
4361 || SSA_NAME_VAR (t
) != gimple_vop (cfun
)))
4363 && !is_gimple_val (t
)))
4365 error ("invalid PHI argument");
4366 debug_generic_expr (t
);
4369 #ifdef ENABLE_TYPES_CHECKING
4370 if (!useless_type_conversion_p (TREE_TYPE (phi_result
), TREE_TYPE (t
)))
4372 error ("incompatible types in PHI argument %u", i
);
4373 debug_generic_stmt (TREE_TYPE (phi_result
));
4374 debug_generic_stmt (TREE_TYPE (t
));
4383 /* Verify the GIMPLE statements inside the sequence STMTS. */
4386 verify_gimple_in_seq_2 (gimple_seq stmts
)
4388 gimple_stmt_iterator ittr
;
4391 for (ittr
= gsi_start (stmts
); !gsi_end_p (ittr
); gsi_next (&ittr
))
4393 gimple stmt
= gsi_stmt (ittr
);
4395 switch (gimple_code (stmt
))
4398 err
|= verify_gimple_in_seq_2 (gimple_bind_body (stmt
));
4402 err
|= verify_gimple_in_seq_2 (gimple_try_eval (stmt
));
4403 err
|= verify_gimple_in_seq_2 (gimple_try_cleanup (stmt
));
4406 case GIMPLE_EH_FILTER
:
4407 err
|= verify_gimple_in_seq_2 (gimple_eh_filter_failure (stmt
));
4410 case GIMPLE_EH_ELSE
:
4411 err
|= verify_gimple_in_seq_2 (gimple_eh_else_n_body (stmt
));
4412 err
|= verify_gimple_in_seq_2 (gimple_eh_else_e_body (stmt
));
4416 err
|= verify_gimple_in_seq_2 (gimple_catch_handler (stmt
));
4419 case GIMPLE_TRANSACTION
:
4420 err
|= verify_gimple_transaction (stmt
);
4425 bool err2
= verify_gimple_stmt (stmt
);
4427 debug_gimple_stmt (stmt
);
4436 /* Verify the contents of a GIMPLE_TRANSACTION. Returns true if there
4437 is a problem, otherwise false. */
4440 verify_gimple_transaction (gimple stmt
)
4442 tree lab
= gimple_transaction_label (stmt
);
4443 if (lab
!= NULL
&& TREE_CODE (lab
) != LABEL_DECL
)
4445 return verify_gimple_in_seq_2 (gimple_transaction_body (stmt
));
4449 /* Verify the GIMPLE statements inside the statement list STMTS. */
4452 verify_gimple_in_seq (gimple_seq stmts
)
4454 timevar_push (TV_TREE_STMT_VERIFY
);
4455 if (verify_gimple_in_seq_2 (stmts
))
4456 internal_error ("verify_gimple failed");
4457 timevar_pop (TV_TREE_STMT_VERIFY
);
4460 /* Return true when the T can be shared. */
4463 tree_node_can_be_shared (tree t
)
4465 if (IS_TYPE_OR_DECL_P (t
)
4466 || is_gimple_min_invariant (t
)
4467 || TREE_CODE (t
) == SSA_NAME
4468 || t
== error_mark_node
4469 || TREE_CODE (t
) == IDENTIFIER_NODE
)
4472 if (TREE_CODE (t
) == CASE_LABEL_EXPR
)
4481 /* Called via walk_tree. Verify tree sharing. */
4484 verify_node_sharing_1 (tree
*tp
, int *walk_subtrees
, void *data
)
4486 struct pointer_set_t
*visited
= (struct pointer_set_t
*) data
;
4488 if (tree_node_can_be_shared (*tp
))
4490 *walk_subtrees
= false;
4494 if (pointer_set_insert (visited
, *tp
))
4500 /* Called via walk_gimple_stmt. Verify tree sharing. */
4503 verify_node_sharing (tree
*tp
, int *walk_subtrees
, void *data
)
4505 struct walk_stmt_info
*wi
= (struct walk_stmt_info
*) data
;
4506 return verify_node_sharing_1 (tp
, walk_subtrees
, wi
->info
);
4509 static bool eh_error_found
;
4511 verify_eh_throw_stmt_node (void **slot
, void *data
)
4513 struct throw_stmt_node
*node
= (struct throw_stmt_node
*)*slot
;
4514 struct pointer_set_t
*visited
= (struct pointer_set_t
*) data
;
4516 if (!pointer_set_contains (visited
, node
->stmt
))
4518 error ("dead STMT in EH table");
4519 debug_gimple_stmt (node
->stmt
);
4520 eh_error_found
= true;
4525 /* Verify if the location LOCs block is in BLOCKS. */
4528 verify_location (pointer_set_t
*blocks
, location_t loc
)
4530 tree block
= LOCATION_BLOCK (loc
);
4531 if (block
!= NULL_TREE
4532 && !pointer_set_contains (blocks
, block
))
4534 error ("location references block not in block tree");
4537 if (block
!= NULL_TREE
)
4538 return verify_location (blocks
, BLOCK_SOURCE_LOCATION (block
));
4542 /* Called via walk_tree. Verify that expressions have no blocks. */
4545 verify_expr_no_block (tree
*tp
, int *walk_subtrees
, void *)
4549 *walk_subtrees
= false;
4553 location_t loc
= EXPR_LOCATION (*tp
);
4554 if (LOCATION_BLOCK (loc
) != NULL
)
4560 /* Called via walk_tree. Verify locations of expressions. */
4563 verify_expr_location_1 (tree
*tp
, int *walk_subtrees
, void *data
)
4565 struct pointer_set_t
*blocks
= (struct pointer_set_t
*) data
;
4567 if (TREE_CODE (*tp
) == VAR_DECL
4568 && DECL_HAS_DEBUG_EXPR_P (*tp
))
4570 tree t
= DECL_DEBUG_EXPR (*tp
);
4571 tree addr
= walk_tree (&t
, verify_expr_no_block
, NULL
, NULL
);
4575 if ((TREE_CODE (*tp
) == VAR_DECL
4576 || TREE_CODE (*tp
) == PARM_DECL
4577 || TREE_CODE (*tp
) == RESULT_DECL
)
4578 && DECL_HAS_VALUE_EXPR_P (*tp
))
4580 tree t
= DECL_VALUE_EXPR (*tp
);
4581 tree addr
= walk_tree (&t
, verify_expr_no_block
, NULL
, NULL
);
4588 *walk_subtrees
= false;
4592 location_t loc
= EXPR_LOCATION (*tp
);
4593 if (verify_location (blocks
, loc
))
4599 /* Called via walk_gimple_op. Verify locations of expressions. */
4602 verify_expr_location (tree
*tp
, int *walk_subtrees
, void *data
)
4604 struct walk_stmt_info
*wi
= (struct walk_stmt_info
*) data
;
4605 return verify_expr_location_1 (tp
, walk_subtrees
, wi
->info
);
4608 /* Insert all subblocks of BLOCK into BLOCKS and recurse. */
4611 collect_subblocks (pointer_set_t
*blocks
, tree block
)
4614 for (t
= BLOCK_SUBBLOCKS (block
); t
; t
= BLOCK_CHAIN (t
))
4616 pointer_set_insert (blocks
, t
);
4617 collect_subblocks (blocks
, t
);
4621 /* Verify the GIMPLE statements in the CFG of FN. */
4624 verify_gimple_in_cfg (struct function
*fn
)
4628 struct pointer_set_t
*visited
, *visited_stmts
, *blocks
;
4630 timevar_push (TV_TREE_STMT_VERIFY
);
4631 visited
= pointer_set_create ();
4632 visited_stmts
= pointer_set_create ();
4634 /* Collect all BLOCKs referenced by the BLOCK tree of FN. */
4635 blocks
= pointer_set_create ();
4636 if (DECL_INITIAL (fn
->decl
))
4638 pointer_set_insert (blocks
, DECL_INITIAL (fn
->decl
));
4639 collect_subblocks (blocks
, DECL_INITIAL (fn
->decl
));
4642 FOR_EACH_BB_FN (bb
, fn
)
4644 gimple_stmt_iterator gsi
;
4646 for (gsi
= gsi_start_phis (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
4648 gimple phi
= gsi_stmt (gsi
);
4652 pointer_set_insert (visited_stmts
, phi
);
4654 if (gimple_bb (phi
) != bb
)
4656 error ("gimple_bb (phi) is set to a wrong basic block");
4660 err2
|= verify_gimple_phi (phi
);
4662 /* Only PHI arguments have locations. */
4663 if (gimple_location (phi
) != UNKNOWN_LOCATION
)
4665 error ("PHI node with location");
4669 for (i
= 0; i
< gimple_phi_num_args (phi
); i
++)
4671 tree arg
= gimple_phi_arg_def (phi
, i
);
4672 tree addr
= walk_tree (&arg
, verify_node_sharing_1
,
4676 error ("incorrect sharing of tree nodes");
4677 debug_generic_expr (addr
);
4680 location_t loc
= gimple_phi_arg_location (phi
, i
);
4681 if (virtual_operand_p (gimple_phi_result (phi
))
4682 && loc
!= UNKNOWN_LOCATION
)
4684 error ("virtual PHI with argument locations");
4687 addr
= walk_tree (&arg
, verify_expr_location_1
, blocks
, NULL
);
4690 debug_generic_expr (addr
);
4693 err2
|= verify_location (blocks
, loc
);
4697 debug_gimple_stmt (phi
);
4701 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
4703 gimple stmt
= gsi_stmt (gsi
);
4705 struct walk_stmt_info wi
;
4709 pointer_set_insert (visited_stmts
, stmt
);
4711 if (gimple_bb (stmt
) != bb
)
4713 error ("gimple_bb (stmt) is set to a wrong basic block");
4717 err2
|= verify_gimple_stmt (stmt
);
4718 err2
|= verify_location (blocks
, gimple_location (stmt
));
4720 memset (&wi
, 0, sizeof (wi
));
4721 wi
.info
= (void *) visited
;
4722 addr
= walk_gimple_op (stmt
, verify_node_sharing
, &wi
);
4725 error ("incorrect sharing of tree nodes");
4726 debug_generic_expr (addr
);
4730 memset (&wi
, 0, sizeof (wi
));
4731 wi
.info
= (void *) blocks
;
4732 addr
= walk_gimple_op (stmt
, verify_expr_location
, &wi
);
4735 debug_generic_expr (addr
);
4739 /* ??? Instead of not checking these stmts at all the walker
4740 should know its context via wi. */
4741 if (!is_gimple_debug (stmt
)
4742 && !is_gimple_omp (stmt
))
4744 memset (&wi
, 0, sizeof (wi
));
4745 addr
= walk_gimple_op (stmt
, verify_expr
, &wi
);
4748 debug_generic_expr (addr
);
4749 inform (gimple_location (stmt
), "in statement");
4754 /* If the statement is marked as part of an EH region, then it is
4755 expected that the statement could throw. Verify that when we
4756 have optimizations that simplify statements such that we prove
4757 that they cannot throw, that we update other data structures
4759 lp_nr
= lookup_stmt_eh_lp (stmt
);
4762 if (!stmt_could_throw_p (stmt
))
4764 error ("statement marked for throw, but doesn%'t");
4768 && !gsi_one_before_end_p (gsi
)
4769 && stmt_can_throw_internal (stmt
))
4771 error ("statement marked for throw in middle of block");
4777 debug_gimple_stmt (stmt
);
4782 eh_error_found
= false;
4783 if (get_eh_throw_stmt_table (cfun
))
4784 htab_traverse (get_eh_throw_stmt_table (cfun
),
4785 verify_eh_throw_stmt_node
,
4788 if (err
|| eh_error_found
)
4789 internal_error ("verify_gimple failed");
4791 pointer_set_destroy (visited
);
4792 pointer_set_destroy (visited_stmts
);
4793 pointer_set_destroy (blocks
);
4794 verify_histograms ();
4795 timevar_pop (TV_TREE_STMT_VERIFY
);
4799 /* Verifies that the flow information is OK. */
4802 gimple_verify_flow_info (void)
4806 gimple_stmt_iterator gsi
;
4811 if (ENTRY_BLOCK_PTR
->il
.gimple
.seq
|| ENTRY_BLOCK_PTR
->il
.gimple
.phi_nodes
)
4813 error ("ENTRY_BLOCK has IL associated with it");
4817 if (EXIT_BLOCK_PTR
->il
.gimple
.seq
|| EXIT_BLOCK_PTR
->il
.gimple
.phi_nodes
)
4819 error ("EXIT_BLOCK has IL associated with it");
4823 FOR_EACH_EDGE (e
, ei
, EXIT_BLOCK_PTR
->preds
)
4824 if (e
->flags
& EDGE_FALLTHRU
)
4826 error ("fallthru to exit from bb %d", e
->src
->index
);
4832 bool found_ctrl_stmt
= false;
4836 /* Skip labels on the start of basic block. */
4837 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
4840 gimple prev_stmt
= stmt
;
4842 stmt
= gsi_stmt (gsi
);
4844 if (gimple_code (stmt
) != GIMPLE_LABEL
)
4847 label
= gimple_label_label (stmt
);
4848 if (prev_stmt
&& DECL_NONLOCAL (label
))
4850 error ("nonlocal label ");
4851 print_generic_expr (stderr
, label
, 0);
4852 fprintf (stderr
, " is not first in a sequence of labels in bb %d",
4857 if (prev_stmt
&& EH_LANDING_PAD_NR (label
) != 0)
4859 error ("EH landing pad label ");
4860 print_generic_expr (stderr
, label
, 0);
4861 fprintf (stderr
, " is not first in a sequence of labels in bb %d",
4866 if (label_to_block (label
) != bb
)
4869 print_generic_expr (stderr
, label
, 0);
4870 fprintf (stderr
, " to block does not match in bb %d",
4875 if (decl_function_context (label
) != current_function_decl
)
4878 print_generic_expr (stderr
, label
, 0);
4879 fprintf (stderr
, " has incorrect context in bb %d",
4885 /* Verify that body of basic block BB is free of control flow. */
4886 for (; !gsi_end_p (gsi
); gsi_next (&gsi
))
4888 gimple stmt
= gsi_stmt (gsi
);
4890 if (found_ctrl_stmt
)
4892 error ("control flow in the middle of basic block %d",
4897 if (stmt_ends_bb_p (stmt
))
4898 found_ctrl_stmt
= true;
4900 if (gimple_code (stmt
) == GIMPLE_LABEL
)
4903 print_generic_expr (stderr
, gimple_label_label (stmt
), 0);
4904 fprintf (stderr
, " in the middle of basic block %d", bb
->index
);
4909 gsi
= gsi_last_bb (bb
);
4910 if (gsi_end_p (gsi
))
4913 stmt
= gsi_stmt (gsi
);
4915 if (gimple_code (stmt
) == GIMPLE_LABEL
)
4918 err
|= verify_eh_edges (stmt
);
4920 if (is_ctrl_stmt (stmt
))
4922 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
4923 if (e
->flags
& EDGE_FALLTHRU
)
4925 error ("fallthru edge after a control statement in bb %d",
4931 if (gimple_code (stmt
) != GIMPLE_COND
)
4933 /* Verify that there are no edges with EDGE_TRUE/FALSE_FLAG set
4934 after anything else but if statement. */
4935 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
4936 if (e
->flags
& (EDGE_TRUE_VALUE
| EDGE_FALSE_VALUE
))
4938 error ("true/false edge after a non-GIMPLE_COND in bb %d",
4944 switch (gimple_code (stmt
))
4951 extract_true_false_edges_from_block (bb
, &true_edge
, &false_edge
);
4955 || !(true_edge
->flags
& EDGE_TRUE_VALUE
)
4956 || !(false_edge
->flags
& EDGE_FALSE_VALUE
)
4957 || (true_edge
->flags
& (EDGE_FALLTHRU
| EDGE_ABNORMAL
))
4958 || (false_edge
->flags
& (EDGE_FALLTHRU
| EDGE_ABNORMAL
))
4959 || EDGE_COUNT (bb
->succs
) >= 3)
4961 error ("wrong outgoing edge flags at end of bb %d",
4969 if (simple_goto_p (stmt
))
4971 error ("explicit goto at end of bb %d", bb
->index
);
4976 /* FIXME. We should double check that the labels in the
4977 destination blocks have their address taken. */
4978 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
4979 if ((e
->flags
& (EDGE_FALLTHRU
| EDGE_TRUE_VALUE
4980 | EDGE_FALSE_VALUE
))
4981 || !(e
->flags
& EDGE_ABNORMAL
))
4983 error ("wrong outgoing edge flags at end of bb %d",
4991 if (!gimple_call_builtin_p (stmt
, BUILT_IN_RETURN
))
4993 /* ... fallthru ... */
4995 if (!single_succ_p (bb
)
4996 || (single_succ_edge (bb
)->flags
4997 & (EDGE_FALLTHRU
| EDGE_ABNORMAL
4998 | EDGE_TRUE_VALUE
| EDGE_FALSE_VALUE
)))
5000 error ("wrong outgoing edge flags at end of bb %d", bb
->index
);
5003 if (single_succ (bb
) != EXIT_BLOCK_PTR
)
5005 error ("return edge does not point to exit in bb %d",
5017 n
= gimple_switch_num_labels (stmt
);
5019 /* Mark all the destination basic blocks. */
5020 for (i
= 0; i
< n
; ++i
)
5022 tree lab
= CASE_LABEL (gimple_switch_label (stmt
, i
));
5023 basic_block label_bb
= label_to_block (lab
);
5024 gcc_assert (!label_bb
->aux
|| label_bb
->aux
== (void *)1);
5025 label_bb
->aux
= (void *)1;
5028 /* Verify that the case labels are sorted. */
5029 prev
= gimple_switch_label (stmt
, 0);
5030 for (i
= 1; i
< n
; ++i
)
5032 tree c
= gimple_switch_label (stmt
, i
);
5035 error ("found default case not at the start of "
5041 && !tree_int_cst_lt (CASE_LOW (prev
), CASE_LOW (c
)))
5043 error ("case labels not sorted: ");
5044 print_generic_expr (stderr
, prev
, 0);
5045 fprintf (stderr
," is greater than ");
5046 print_generic_expr (stderr
, c
, 0);
5047 fprintf (stderr
," but comes before it.\n");
5052 /* VRP will remove the default case if it can prove it will
5053 never be executed. So do not verify there always exists
5054 a default case here. */
5056 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
5060 error ("extra outgoing edge %d->%d",
5061 bb
->index
, e
->dest
->index
);
5065 e
->dest
->aux
= (void *)2;
5066 if ((e
->flags
& (EDGE_FALLTHRU
| EDGE_ABNORMAL
5067 | EDGE_TRUE_VALUE
| EDGE_FALSE_VALUE
)))
5069 error ("wrong outgoing edge flags at end of bb %d",
5075 /* Check that we have all of them. */
5076 for (i
= 0; i
< n
; ++i
)
5078 tree lab
= CASE_LABEL (gimple_switch_label (stmt
, i
));
5079 basic_block label_bb
= label_to_block (lab
);
5081 if (label_bb
->aux
!= (void *)2)
5083 error ("missing edge %i->%i", bb
->index
, label_bb
->index
);
5088 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
5089 e
->dest
->aux
= (void *)0;
5093 case GIMPLE_EH_DISPATCH
:
5094 err
|= verify_eh_dispatch_edge (stmt
);
5102 if (dom_info_state (CDI_DOMINATORS
) >= DOM_NO_FAST_QUERY
)
5103 verify_dominators (CDI_DOMINATORS
);
5109 /* Updates phi nodes after creating a forwarder block joined
5110 by edge FALLTHRU. */
5113 gimple_make_forwarder_block (edge fallthru
)
5117 basic_block dummy
, bb
;
5119 gimple_stmt_iterator gsi
;
5121 dummy
= fallthru
->src
;
5122 bb
= fallthru
->dest
;
5124 if (single_pred_p (bb
))
5127 /* If we redirected a branch we must create new PHI nodes at the
5129 for (gsi
= gsi_start_phis (dummy
); !gsi_end_p (gsi
); gsi_next (&gsi
))
5131 gimple phi
, new_phi
;
5133 phi
= gsi_stmt (gsi
);
5134 var
= gimple_phi_result (phi
);
5135 new_phi
= create_phi_node (var
, bb
);
5136 gimple_phi_set_result (phi
, copy_ssa_name (var
, phi
));
5137 add_phi_arg (new_phi
, gimple_phi_result (phi
), fallthru
,
5141 /* Add the arguments we have stored on edges. */
5142 FOR_EACH_EDGE (e
, ei
, bb
->preds
)
5147 flush_pending_stmts (e
);
5152 /* Return a non-special label in the head of basic block BLOCK.
5153 Create one if it doesn't exist. */
5156 gimple_block_label (basic_block bb
)
5158 gimple_stmt_iterator i
, s
= gsi_start_bb (bb
);
5163 for (i
= s
; !gsi_end_p (i
); first
= false, gsi_next (&i
))
5165 stmt
= gsi_stmt (i
);
5166 if (gimple_code (stmt
) != GIMPLE_LABEL
)
5168 label
= gimple_label_label (stmt
);
5169 if (!DECL_NONLOCAL (label
))
5172 gsi_move_before (&i
, &s
);
5177 label
= create_artificial_label (UNKNOWN_LOCATION
);
5178 stmt
= gimple_build_label (label
);
5179 gsi_insert_before (&s
, stmt
, GSI_NEW_STMT
);
5184 /* Attempt to perform edge redirection by replacing a possibly complex
5185 jump instruction by a goto or by removing the jump completely.
5186 This can apply only if all edges now point to the same block. The
5187 parameters and return values are equivalent to
5188 redirect_edge_and_branch. */
5191 gimple_try_redirect_by_replacing_jump (edge e
, basic_block target
)
5193 basic_block src
= e
->src
;
5194 gimple_stmt_iterator i
;
5197 /* We can replace or remove a complex jump only when we have exactly
5199 if (EDGE_COUNT (src
->succs
) != 2
5200 /* Verify that all targets will be TARGET. Specifically, the
5201 edge that is not E must also go to TARGET. */
5202 || EDGE_SUCC (src
, EDGE_SUCC (src
, 0) == e
)->dest
!= target
)
5205 i
= gsi_last_bb (src
);
5209 stmt
= gsi_stmt (i
);
5211 if (gimple_code (stmt
) == GIMPLE_COND
|| gimple_code (stmt
) == GIMPLE_SWITCH
)
5213 gsi_remove (&i
, true);
5214 e
= ssa_redirect_edge (e
, target
);
5215 e
->flags
= EDGE_FALLTHRU
;
5223 /* Redirect E to DEST. Return NULL on failure. Otherwise, return the
5224 edge representing the redirected branch. */
5227 gimple_redirect_edge_and_branch (edge e
, basic_block dest
)
5229 basic_block bb
= e
->src
;
5230 gimple_stmt_iterator gsi
;
5234 if (e
->flags
& EDGE_ABNORMAL
)
5237 if (e
->dest
== dest
)
5240 if (e
->flags
& EDGE_EH
)
5241 return redirect_eh_edge (e
, dest
);
5243 if (e
->src
!= ENTRY_BLOCK_PTR
)
5245 ret
= gimple_try_redirect_by_replacing_jump (e
, dest
);
5250 gsi
= gsi_last_bb (bb
);
5251 stmt
= gsi_end_p (gsi
) ? NULL
: gsi_stmt (gsi
);
5253 switch (stmt
? gimple_code (stmt
) : GIMPLE_ERROR_MARK
)
5256 /* For COND_EXPR, we only need to redirect the edge. */
5260 /* No non-abnormal edges should lead from a non-simple goto, and
5261 simple ones should be represented implicitly. */
5266 tree label
= gimple_block_label (dest
);
5267 tree cases
= get_cases_for_edge (e
, stmt
);
5269 /* If we have a list of cases associated with E, then use it
5270 as it's a lot faster than walking the entire case vector. */
5273 edge e2
= find_edge (e
->src
, dest
);
5280 CASE_LABEL (cases
) = label
;
5281 cases
= CASE_CHAIN (cases
);
5284 /* If there was already an edge in the CFG, then we need
5285 to move all the cases associated with E to E2. */
5288 tree cases2
= get_cases_for_edge (e2
, stmt
);
5290 CASE_CHAIN (last
) = CASE_CHAIN (cases2
);
5291 CASE_CHAIN (cases2
) = first
;
5293 bitmap_set_bit (touched_switch_bbs
, gimple_bb (stmt
)->index
);
5297 size_t i
, n
= gimple_switch_num_labels (stmt
);
5299 for (i
= 0; i
< n
; i
++)
5301 tree elt
= gimple_switch_label (stmt
, i
);
5302 if (label_to_block (CASE_LABEL (elt
)) == e
->dest
)
5303 CASE_LABEL (elt
) = label
;
5311 int i
, n
= gimple_asm_nlabels (stmt
);
5314 for (i
= 0; i
< n
; ++i
)
5316 tree cons
= gimple_asm_label_op (stmt
, i
);
5317 if (label_to_block (TREE_VALUE (cons
)) == e
->dest
)
5320 label
= gimple_block_label (dest
);
5321 TREE_VALUE (cons
) = label
;
5325 /* If we didn't find any label matching the former edge in the
5326 asm labels, we must be redirecting the fallthrough
5328 gcc_assert (label
|| (e
->flags
& EDGE_FALLTHRU
));
5333 gsi_remove (&gsi
, true);
5334 e
->flags
|= EDGE_FALLTHRU
;
5337 case GIMPLE_OMP_RETURN
:
5338 case GIMPLE_OMP_CONTINUE
:
5339 case GIMPLE_OMP_SECTIONS_SWITCH
:
5340 case GIMPLE_OMP_FOR
:
5341 /* The edges from OMP constructs can be simply redirected. */
5344 case GIMPLE_EH_DISPATCH
:
5345 if (!(e
->flags
& EDGE_FALLTHRU
))
5346 redirect_eh_dispatch_edge (stmt
, e
, dest
);
5349 case GIMPLE_TRANSACTION
:
5350 /* The ABORT edge has a stored label associated with it, otherwise
5351 the edges are simply redirectable. */
5353 gimple_transaction_set_label (stmt
, gimple_block_label (dest
));
5357 /* Otherwise it must be a fallthru edge, and we don't need to
5358 do anything besides redirecting it. */
5359 gcc_assert (e
->flags
& EDGE_FALLTHRU
);
5363 /* Update/insert PHI nodes as necessary. */
5365 /* Now update the edges in the CFG. */
5366 e
= ssa_redirect_edge (e
, dest
);
5371 /* Returns true if it is possible to remove edge E by redirecting
5372 it to the destination of the other edge from E->src. */
5375 gimple_can_remove_branch_p (const_edge e
)
5377 if (e
->flags
& (EDGE_ABNORMAL
| EDGE_EH
))
5383 /* Simple wrapper, as we can always redirect fallthru edges. */
5386 gimple_redirect_edge_and_branch_force (edge e
, basic_block dest
)
5388 e
= gimple_redirect_edge_and_branch (e
, dest
);
5395 /* Splits basic block BB after statement STMT (but at least after the
5396 labels). If STMT is NULL, BB is split just after the labels. */
5399 gimple_split_block (basic_block bb
, void *stmt
)
5401 gimple_stmt_iterator gsi
;
5402 gimple_stmt_iterator gsi_tgt
;
5409 new_bb
= create_empty_bb (bb
);
5411 /* Redirect the outgoing edges. */
5412 new_bb
->succs
= bb
->succs
;
5414 FOR_EACH_EDGE (e
, ei
, new_bb
->succs
)
5417 if (stmt
&& gimple_code ((gimple
) stmt
) == GIMPLE_LABEL
)
5420 /* Move everything from GSI to the new basic block. */
5421 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
5423 act
= gsi_stmt (gsi
);
5424 if (gimple_code (act
) == GIMPLE_LABEL
)
5437 if (gsi_end_p (gsi
))
5440 /* Split the statement list - avoid re-creating new containers as this
5441 brings ugly quadratic memory consumption in the inliner.
5442 (We are still quadratic since we need to update stmt BB pointers,
5444 gsi_split_seq_before (&gsi
, &list
);
5445 set_bb_seq (new_bb
, list
);
5446 for (gsi_tgt
= gsi_start (list
);
5447 !gsi_end_p (gsi_tgt
); gsi_next (&gsi_tgt
))
5448 gimple_set_bb (gsi_stmt (gsi_tgt
), new_bb
);
5454 /* Moves basic block BB after block AFTER. */
5457 gimple_move_block_after (basic_block bb
, basic_block after
)
5459 if (bb
->prev_bb
== after
)
5463 link_block (bb
, after
);
5469 /* Return TRUE if block BB has no executable statements, otherwise return
5473 gimple_empty_block_p (basic_block bb
)
5475 /* BB must have no executable statements. */
5476 gimple_stmt_iterator gsi
= gsi_after_labels (bb
);
5479 if (gsi_end_p (gsi
))
5481 if (is_gimple_debug (gsi_stmt (gsi
)))
5482 gsi_next_nondebug (&gsi
);
5483 return gsi_end_p (gsi
);
5487 /* Split a basic block if it ends with a conditional branch and if the
5488 other part of the block is not empty. */
5491 gimple_split_block_before_cond_jump (basic_block bb
)
5493 gimple last
, split_point
;
5494 gimple_stmt_iterator gsi
= gsi_last_nondebug_bb (bb
);
5495 if (gsi_end_p (gsi
))
5497 last
= gsi_stmt (gsi
);
5498 if (gimple_code (last
) != GIMPLE_COND
5499 && gimple_code (last
) != GIMPLE_SWITCH
)
5501 gsi_prev_nondebug (&gsi
);
5502 split_point
= gsi_stmt (gsi
);
5503 return split_block (bb
, split_point
)->dest
;
5507 /* Return true if basic_block can be duplicated. */
5510 gimple_can_duplicate_bb_p (const_basic_block bb ATTRIBUTE_UNUSED
)
5515 /* Create a duplicate of the basic block BB. NOTE: This does not
5516 preserve SSA form. */
5519 gimple_duplicate_bb (basic_block bb
)
5522 gimple_stmt_iterator gsi
, gsi_tgt
;
5523 gimple_seq phis
= phi_nodes (bb
);
5524 gimple phi
, stmt
, copy
;
5526 new_bb
= create_empty_bb (EXIT_BLOCK_PTR
->prev_bb
);
5528 /* Copy the PHI nodes. We ignore PHI node arguments here because
5529 the incoming edges have not been setup yet. */
5530 for (gsi
= gsi_start (phis
); !gsi_end_p (gsi
); gsi_next (&gsi
))
5532 phi
= gsi_stmt (gsi
);
5533 copy
= create_phi_node (NULL_TREE
, new_bb
);
5534 create_new_def_for (gimple_phi_result (phi
), copy
,
5535 gimple_phi_result_ptr (copy
));
5536 gimple_set_uid (copy
, gimple_uid (phi
));
5539 gsi_tgt
= gsi_start_bb (new_bb
);
5540 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
5542 def_operand_p def_p
;
5543 ssa_op_iter op_iter
;
5546 stmt
= gsi_stmt (gsi
);
5547 if (gimple_code (stmt
) == GIMPLE_LABEL
)
5550 /* Don't duplicate label debug stmts. */
5551 if (gimple_debug_bind_p (stmt
)
5552 && TREE_CODE (gimple_debug_bind_get_var (stmt
))
5556 /* Create a new copy of STMT and duplicate STMT's virtual
5558 copy
= gimple_copy (stmt
);
5559 gsi_insert_after (&gsi_tgt
, copy
, GSI_NEW_STMT
);
5561 maybe_duplicate_eh_stmt (copy
, stmt
);
5562 gimple_duplicate_stmt_histograms (cfun
, copy
, cfun
, stmt
);
5564 /* When copying around a stmt writing into a local non-user
5565 aggregate, make sure it won't share stack slot with other
5567 lhs
= gimple_get_lhs (stmt
);
5568 if (lhs
&& TREE_CODE (lhs
) != SSA_NAME
)
5570 tree base
= get_base_address (lhs
);
5572 && (TREE_CODE (base
) == VAR_DECL
5573 || TREE_CODE (base
) == RESULT_DECL
)
5574 && DECL_IGNORED_P (base
)
5575 && !TREE_STATIC (base
)
5576 && !DECL_EXTERNAL (base
)
5577 && (TREE_CODE (base
) != VAR_DECL
5578 || !DECL_HAS_VALUE_EXPR_P (base
)))
5579 DECL_NONSHAREABLE (base
) = 1;
5582 /* Create new names for all the definitions created by COPY and
5583 add replacement mappings for each new name. */
5584 FOR_EACH_SSA_DEF_OPERAND (def_p
, copy
, op_iter
, SSA_OP_ALL_DEFS
)
5585 create_new_def_for (DEF_FROM_PTR (def_p
), copy
, def_p
);
5591 /* Adds phi node arguments for edge E_COPY after basic block duplication. */
5594 add_phi_args_after_copy_edge (edge e_copy
)
5596 basic_block bb
, bb_copy
= e_copy
->src
, dest
;
5599 gimple phi
, phi_copy
;
5601 gimple_stmt_iterator psi
, psi_copy
;
5603 if (gimple_seq_empty_p (phi_nodes (e_copy
->dest
)))
5606 bb
= bb_copy
->flags
& BB_DUPLICATED
? get_bb_original (bb_copy
) : bb_copy
;
5608 if (e_copy
->dest
->flags
& BB_DUPLICATED
)
5609 dest
= get_bb_original (e_copy
->dest
);
5611 dest
= e_copy
->dest
;
5613 e
= find_edge (bb
, dest
);
5616 /* During loop unrolling the target of the latch edge is copied.
5617 In this case we are not looking for edge to dest, but to
5618 duplicated block whose original was dest. */
5619 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
5621 if ((e
->dest
->flags
& BB_DUPLICATED
)
5622 && get_bb_original (e
->dest
) == dest
)
5626 gcc_assert (e
!= NULL
);
5629 for (psi
= gsi_start_phis (e
->dest
),
5630 psi_copy
= gsi_start_phis (e_copy
->dest
);
5632 gsi_next (&psi
), gsi_next (&psi_copy
))
5634 phi
= gsi_stmt (psi
);
5635 phi_copy
= gsi_stmt (psi_copy
);
5636 def
= PHI_ARG_DEF_FROM_EDGE (phi
, e
);
5637 add_phi_arg (phi_copy
, def
, e_copy
,
5638 gimple_phi_arg_location_from_edge (phi
, e
));
5643 /* Basic block BB_COPY was created by code duplication. Add phi node
5644 arguments for edges going out of BB_COPY. The blocks that were
5645 duplicated have BB_DUPLICATED set. */
5648 add_phi_args_after_copy_bb (basic_block bb_copy
)
5653 FOR_EACH_EDGE (e_copy
, ei
, bb_copy
->succs
)
5655 add_phi_args_after_copy_edge (e_copy
);
5659 /* Blocks in REGION_COPY array of length N_REGION were created by
5660 duplication of basic blocks. Add phi node arguments for edges
5661 going from these blocks. If E_COPY is not NULL, also add
5662 phi node arguments for its destination.*/
5665 add_phi_args_after_copy (basic_block
*region_copy
, unsigned n_region
,
5670 for (i
= 0; i
< n_region
; i
++)
5671 region_copy
[i
]->flags
|= BB_DUPLICATED
;
5673 for (i
= 0; i
< n_region
; i
++)
5674 add_phi_args_after_copy_bb (region_copy
[i
]);
5676 add_phi_args_after_copy_edge (e_copy
);
5678 for (i
= 0; i
< n_region
; i
++)
5679 region_copy
[i
]->flags
&= ~BB_DUPLICATED
;
5682 /* Duplicates a REGION (set of N_REGION basic blocks) with just a single
5683 important exit edge EXIT. By important we mean that no SSA name defined
5684 inside region is live over the other exit edges of the region. All entry
5685 edges to the region must go to ENTRY->dest. The edge ENTRY is redirected
5686 to the duplicate of the region. Dominance and loop information is
5687 updated if UPDATE_DOMINANCE is true, but not the SSA web. If
5688 UPDATE_DOMINANCE is false then we assume that the caller will update the
5689 dominance information after calling this function. The new basic
5690 blocks are stored to REGION_COPY in the same order as they had in REGION,
5691 provided that REGION_COPY is not NULL.
5692 The function returns false if it is unable to copy the region,
5696 gimple_duplicate_sese_region (edge entry
, edge exit
,
5697 basic_block
*region
, unsigned n_region
,
5698 basic_block
*region_copy
,
5699 bool update_dominance
)
5702 bool free_region_copy
= false, copying_header
= false;
5703 struct loop
*loop
= entry
->dest
->loop_father
;
5705 vec
<basic_block
> doms
;
5707 int total_freq
= 0, entry_freq
= 0;
5708 gcov_type total_count
= 0, entry_count
= 0;
5710 if (!can_copy_bbs_p (region
, n_region
))
5713 /* Some sanity checking. Note that we do not check for all possible
5714 missuses of the functions. I.e. if you ask to copy something weird,
5715 it will work, but the state of structures probably will not be
5717 for (i
= 0; i
< n_region
; i
++)
5719 /* We do not handle subloops, i.e. all the blocks must belong to the
5721 if (region
[i
]->loop_father
!= loop
)
5724 if (region
[i
] != entry
->dest
5725 && region
[i
] == loop
->header
)
5729 set_loop_copy (loop
, loop
);
5731 /* In case the function is used for loop header copying (which is the primary
5732 use), ensure that EXIT and its copy will be new latch and entry edges. */
5733 if (loop
->header
== entry
->dest
)
5735 copying_header
= true;
5736 set_loop_copy (loop
, loop_outer (loop
));
5738 if (!dominated_by_p (CDI_DOMINATORS
, loop
->latch
, exit
->src
))
5741 for (i
= 0; i
< n_region
; i
++)
5742 if (region
[i
] != exit
->src
5743 && dominated_by_p (CDI_DOMINATORS
, region
[i
], exit
->src
))
5749 region_copy
= XNEWVEC (basic_block
, n_region
);
5750 free_region_copy
= true;
5753 initialize_original_copy_tables ();
5755 /* Record blocks outside the region that are dominated by something
5757 if (update_dominance
)
5760 doms
= get_dominated_by_region (CDI_DOMINATORS
, region
, n_region
);
5763 if (entry
->dest
->count
)
5765 total_count
= entry
->dest
->count
;
5766 entry_count
= entry
->count
;
5767 /* Fix up corner cases, to avoid division by zero or creation of negative
5769 if (entry_count
> total_count
)
5770 entry_count
= total_count
;
5774 total_freq
= entry
->dest
->frequency
;
5775 entry_freq
= EDGE_FREQUENCY (entry
);
5776 /* Fix up corner cases, to avoid division by zero or creation of negative
5778 if (total_freq
== 0)
5780 else if (entry_freq
> total_freq
)
5781 entry_freq
= total_freq
;
5784 copy_bbs (region
, n_region
, region_copy
, &exit
, 1, &exit_copy
, loop
,
5785 split_edge_bb_loc (entry
), update_dominance
);
5788 scale_bbs_frequencies_gcov_type (region
, n_region
,
5789 total_count
- entry_count
,
5791 scale_bbs_frequencies_gcov_type (region_copy
, n_region
, entry_count
,
5796 scale_bbs_frequencies_int (region
, n_region
, total_freq
- entry_freq
,
5798 scale_bbs_frequencies_int (region_copy
, n_region
, entry_freq
, total_freq
);
5803 loop
->header
= exit
->dest
;
5804 loop
->latch
= exit
->src
;
5807 /* Redirect the entry and add the phi node arguments. */
5808 redirected
= redirect_edge_and_branch (entry
, get_bb_copy (entry
->dest
));
5809 gcc_assert (redirected
!= NULL
);
5810 flush_pending_stmts (entry
);
5812 /* Concerning updating of dominators: We must recount dominators
5813 for entry block and its copy. Anything that is outside of the
5814 region, but was dominated by something inside needs recounting as
5816 if (update_dominance
)
5818 set_immediate_dominator (CDI_DOMINATORS
, entry
->dest
, entry
->src
);
5819 doms
.safe_push (get_bb_original (entry
->dest
));
5820 iterate_fix_dominators (CDI_DOMINATORS
, doms
, false);
5824 /* Add the other PHI node arguments. */
5825 add_phi_args_after_copy (region_copy
, n_region
, NULL
);
5827 if (free_region_copy
)
5830 free_original_copy_tables ();
5834 /* Checks if BB is part of the region defined by N_REGION BBS. */
5836 bb_part_of_region_p (basic_block bb
, basic_block
* bbs
, unsigned n_region
)
5840 for (n
= 0; n
< n_region
; n
++)
5848 /* Duplicates REGION consisting of N_REGION blocks. The new blocks
5849 are stored to REGION_COPY in the same order in that they appear
5850 in REGION, if REGION_COPY is not NULL. ENTRY is the entry to
5851 the region, EXIT an exit from it. The condition guarding EXIT
5852 is moved to ENTRY. Returns true if duplication succeeds, false
5878 gimple_duplicate_sese_tail (edge entry ATTRIBUTE_UNUSED
, edge exit ATTRIBUTE_UNUSED
,
5879 basic_block
*region ATTRIBUTE_UNUSED
, unsigned n_region ATTRIBUTE_UNUSED
,
5880 basic_block
*region_copy ATTRIBUTE_UNUSED
)
5883 bool free_region_copy
= false;
5884 struct loop
*loop
= exit
->dest
->loop_father
;
5885 struct loop
*orig_loop
= entry
->dest
->loop_father
;
5886 basic_block switch_bb
, entry_bb
, nentry_bb
;
5887 vec
<basic_block
> doms
;
5888 int total_freq
= 0, exit_freq
= 0;
5889 gcov_type total_count
= 0, exit_count
= 0;
5890 edge exits
[2], nexits
[2], e
;
5891 gimple_stmt_iterator gsi
;
5894 basic_block exit_bb
;
5895 gimple_stmt_iterator psi
;
5898 struct loop
*target
, *aloop
, *cloop
;
5900 gcc_assert (EDGE_COUNT (exit
->src
->succs
) == 2);
5902 exits
[1] = EDGE_SUCC (exit
->src
, EDGE_SUCC (exit
->src
, 0) == exit
);
5904 if (!can_copy_bbs_p (region
, n_region
))
5907 initialize_original_copy_tables ();
5908 set_loop_copy (orig_loop
, loop
);
5911 for (aloop
= orig_loop
->inner
; aloop
; aloop
= aloop
->next
)
5913 if (bb_part_of_region_p (aloop
->header
, region
, n_region
))
5915 cloop
= duplicate_loop (aloop
, target
);
5916 duplicate_subloops (aloop
, cloop
);
5922 region_copy
= XNEWVEC (basic_block
, n_region
);
5923 free_region_copy
= true;
5926 gcc_assert (!need_ssa_update_p (cfun
));
5928 /* Record blocks outside the region that are dominated by something
5930 doms
= get_dominated_by_region (CDI_DOMINATORS
, region
, n_region
);
5932 if (exit
->src
->count
)
5934 total_count
= exit
->src
->count
;
5935 exit_count
= exit
->count
;
5936 /* Fix up corner cases, to avoid division by zero or creation of negative
5938 if (exit_count
> total_count
)
5939 exit_count
= total_count
;
5943 total_freq
= exit
->src
->frequency
;
5944 exit_freq
= EDGE_FREQUENCY (exit
);
5945 /* Fix up corner cases, to avoid division by zero or creation of negative
5947 if (total_freq
== 0)
5949 if (exit_freq
> total_freq
)
5950 exit_freq
= total_freq
;
5953 copy_bbs (region
, n_region
, region_copy
, exits
, 2, nexits
, orig_loop
,
5954 split_edge_bb_loc (exit
), true);
5957 scale_bbs_frequencies_gcov_type (region
, n_region
,
5958 total_count
- exit_count
,
5960 scale_bbs_frequencies_gcov_type (region_copy
, n_region
, exit_count
,
5965 scale_bbs_frequencies_int (region
, n_region
, total_freq
- exit_freq
,
5967 scale_bbs_frequencies_int (region_copy
, n_region
, exit_freq
, total_freq
);
5970 /* Create the switch block, and put the exit condition to it. */
5971 entry_bb
= entry
->dest
;
5972 nentry_bb
= get_bb_copy (entry_bb
);
5973 if (!last_stmt (entry
->src
)
5974 || !stmt_ends_bb_p (last_stmt (entry
->src
)))
5975 switch_bb
= entry
->src
;
5977 switch_bb
= split_edge (entry
);
5978 set_immediate_dominator (CDI_DOMINATORS
, nentry_bb
, switch_bb
);
5980 gsi
= gsi_last_bb (switch_bb
);
5981 cond_stmt
= last_stmt (exit
->src
);
5982 gcc_assert (gimple_code (cond_stmt
) == GIMPLE_COND
);
5983 cond_stmt
= gimple_copy (cond_stmt
);
5985 gsi_insert_after (&gsi
, cond_stmt
, GSI_NEW_STMT
);
5987 sorig
= single_succ_edge (switch_bb
);
5988 sorig
->flags
= exits
[1]->flags
;
5989 snew
= make_edge (switch_bb
, nentry_bb
, exits
[0]->flags
);
5991 /* Register the new edge from SWITCH_BB in loop exit lists. */
5992 rescan_loop_exit (snew
, true, false);
5994 /* Add the PHI node arguments. */
5995 add_phi_args_after_copy (region_copy
, n_region
, snew
);
5997 /* Get rid of now superfluous conditions and associated edges (and phi node
5999 exit_bb
= exit
->dest
;
6001 e
= redirect_edge_and_branch (exits
[0], exits
[1]->dest
);
6002 PENDING_STMT (e
) = NULL
;
6004 /* The latch of ORIG_LOOP was copied, and so was the backedge
6005 to the original header. We redirect this backedge to EXIT_BB. */
6006 for (i
= 0; i
< n_region
; i
++)
6007 if (get_bb_original (region_copy
[i
]) == orig_loop
->latch
)
6009 gcc_assert (single_succ_edge (region_copy
[i
]));
6010 e
= redirect_edge_and_branch (single_succ_edge (region_copy
[i
]), exit_bb
);
6011 PENDING_STMT (e
) = NULL
;
6012 for (psi
= gsi_start_phis (exit_bb
);
6016 phi
= gsi_stmt (psi
);
6017 def
= PHI_ARG_DEF (phi
, nexits
[0]->dest_idx
);
6018 add_phi_arg (phi
, def
, e
, gimple_phi_arg_location_from_edge (phi
, e
));
6021 e
= redirect_edge_and_branch (nexits
[1], nexits
[0]->dest
);
6022 PENDING_STMT (e
) = NULL
;
6024 /* Anything that is outside of the region, but was dominated by something
6025 inside needs to update dominance info. */
6026 iterate_fix_dominators (CDI_DOMINATORS
, doms
, false);
6028 /* Update the SSA web. */
6029 update_ssa (TODO_update_ssa
);
6031 if (free_region_copy
)
6034 free_original_copy_tables ();
6038 /* Add all the blocks dominated by ENTRY to the array BBS_P. Stop
6039 adding blocks when the dominator traversal reaches EXIT. This
6040 function silently assumes that ENTRY strictly dominates EXIT. */
6043 gather_blocks_in_sese_region (basic_block entry
, basic_block exit
,
6044 vec
<basic_block
> *bbs_p
)
6048 for (son
= first_dom_son (CDI_DOMINATORS
, entry
);
6050 son
= next_dom_son (CDI_DOMINATORS
, son
))
6052 bbs_p
->safe_push (son
);
6054 gather_blocks_in_sese_region (son
, exit
, bbs_p
);
6058 /* Replaces *TP with a duplicate (belonging to function TO_CONTEXT).
6059 The duplicates are recorded in VARS_MAP. */
6062 replace_by_duplicate_decl (tree
*tp
, struct pointer_map_t
*vars_map
,
6065 tree t
= *tp
, new_t
;
6066 struct function
*f
= DECL_STRUCT_FUNCTION (to_context
);
6069 if (DECL_CONTEXT (t
) == to_context
)
6072 loc
= pointer_map_contains (vars_map
, t
);
6076 loc
= pointer_map_insert (vars_map
, t
);
6080 new_t
= copy_var_decl (t
, DECL_NAME (t
), TREE_TYPE (t
));
6081 add_local_decl (f
, new_t
);
6085 gcc_assert (TREE_CODE (t
) == CONST_DECL
);
6086 new_t
= copy_node (t
);
6088 DECL_CONTEXT (new_t
) = to_context
;
6093 new_t
= (tree
) *loc
;
6099 /* Creates an ssa name in TO_CONTEXT equivalent to NAME.
6100 VARS_MAP maps old ssa names and var_decls to the new ones. */
6103 replace_ssa_name (tree name
, struct pointer_map_t
*vars_map
,
6109 gcc_assert (!virtual_operand_p (name
));
6111 loc
= pointer_map_contains (vars_map
, name
);
6115 tree decl
= SSA_NAME_VAR (name
);
6118 replace_by_duplicate_decl (&decl
, vars_map
, to_context
);
6119 new_name
= make_ssa_name_fn (DECL_STRUCT_FUNCTION (to_context
),
6120 decl
, SSA_NAME_DEF_STMT (name
));
6121 if (SSA_NAME_IS_DEFAULT_DEF (name
))
6122 set_ssa_default_def (DECL_STRUCT_FUNCTION (to_context
),
6126 new_name
= copy_ssa_name_fn (DECL_STRUCT_FUNCTION (to_context
),
6127 name
, SSA_NAME_DEF_STMT (name
));
6129 loc
= pointer_map_insert (vars_map
, name
);
6133 new_name
= (tree
) *loc
;
6144 struct pointer_map_t
*vars_map
;
6145 htab_t new_label_map
;
6146 struct pointer_map_t
*eh_map
;
6150 /* Helper for move_block_to_fn. Set TREE_BLOCK in every expression
6151 contained in *TP if it has been ORIG_BLOCK previously and change the
6152 DECL_CONTEXT of every local variable referenced in *TP. */
6155 move_stmt_op (tree
*tp
, int *walk_subtrees
, void *data
)
6157 struct walk_stmt_info
*wi
= (struct walk_stmt_info
*) data
;
6158 struct move_stmt_d
*p
= (struct move_stmt_d
*) wi
->info
;
6163 tree block
= TREE_BLOCK (t
);
6164 if (block
== p
->orig_block
6165 || (p
->orig_block
== NULL_TREE
6166 && block
!= NULL_TREE
))
6167 TREE_SET_BLOCK (t
, p
->new_block
);
6168 #ifdef ENABLE_CHECKING
6169 else if (block
!= NULL_TREE
)
6171 while (block
&& TREE_CODE (block
) == BLOCK
&& block
!= p
->orig_block
)
6172 block
= BLOCK_SUPERCONTEXT (block
);
6173 gcc_assert (block
== p
->orig_block
);
6177 else if (DECL_P (t
) || TREE_CODE (t
) == SSA_NAME
)
6179 if (TREE_CODE (t
) == SSA_NAME
)
6180 *tp
= replace_ssa_name (t
, p
->vars_map
, p
->to_context
);
6181 else if (TREE_CODE (t
) == LABEL_DECL
)
6183 if (p
->new_label_map
)
6185 struct tree_map in
, *out
;
6187 out
= (struct tree_map
*)
6188 htab_find_with_hash (p
->new_label_map
, &in
, DECL_UID (t
));
6193 DECL_CONTEXT (t
) = p
->to_context
;
6195 else if (p
->remap_decls_p
)
6197 /* Replace T with its duplicate. T should no longer appear in the
6198 parent function, so this looks wasteful; however, it may appear
6199 in referenced_vars, and more importantly, as virtual operands of
6200 statements, and in alias lists of other variables. It would be
6201 quite difficult to expunge it from all those places. ??? It might
6202 suffice to do this for addressable variables. */
6203 if ((TREE_CODE (t
) == VAR_DECL
6204 && !is_global_var (t
))
6205 || TREE_CODE (t
) == CONST_DECL
)
6206 replace_by_duplicate_decl (tp
, p
->vars_map
, p
->to_context
);
6210 else if (TYPE_P (t
))
6216 /* Helper for move_stmt_r. Given an EH region number for the source
6217 function, map that to the duplicate EH regio number in the dest. */
6220 move_stmt_eh_region_nr (int old_nr
, struct move_stmt_d
*p
)
6222 eh_region old_r
, new_r
;
6225 old_r
= get_eh_region_from_number (old_nr
);
6226 slot
= pointer_map_contains (p
->eh_map
, old_r
);
6227 new_r
= (eh_region
) *slot
;
6229 return new_r
->index
;
6232 /* Similar, but operate on INTEGER_CSTs. */
6235 move_stmt_eh_region_tree_nr (tree old_t_nr
, struct move_stmt_d
*p
)
6239 old_nr
= tree_low_cst (old_t_nr
, 0);
6240 new_nr
= move_stmt_eh_region_nr (old_nr
, p
);
6242 return build_int_cst (integer_type_node
, new_nr
);
6245 /* Like move_stmt_op, but for gimple statements.
6247 Helper for move_block_to_fn. Set GIMPLE_BLOCK in every expression
6248 contained in the current statement in *GSI_P and change the
6249 DECL_CONTEXT of every local variable referenced in the current
6253 move_stmt_r (gimple_stmt_iterator
*gsi_p
, bool *handled_ops_p
,
6254 struct walk_stmt_info
*wi
)
6256 struct move_stmt_d
*p
= (struct move_stmt_d
*) wi
->info
;
6257 gimple stmt
= gsi_stmt (*gsi_p
);
6258 tree block
= gimple_block (stmt
);
6260 if (block
== p
->orig_block
6261 || (p
->orig_block
== NULL_TREE
6262 && block
!= NULL_TREE
))
6263 gimple_set_block (stmt
, p
->new_block
);
6265 switch (gimple_code (stmt
))
6268 /* Remap the region numbers for __builtin_eh_{pointer,filter}. */
6270 tree r
, fndecl
= gimple_call_fndecl (stmt
);
6271 if (fndecl
&& DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
)
6272 switch (DECL_FUNCTION_CODE (fndecl
))
6274 case BUILT_IN_EH_COPY_VALUES
:
6275 r
= gimple_call_arg (stmt
, 1);
6276 r
= move_stmt_eh_region_tree_nr (r
, p
);
6277 gimple_call_set_arg (stmt
, 1, r
);
6280 case BUILT_IN_EH_POINTER
:
6281 case BUILT_IN_EH_FILTER
:
6282 r
= gimple_call_arg (stmt
, 0);
6283 r
= move_stmt_eh_region_tree_nr (r
, p
);
6284 gimple_call_set_arg (stmt
, 0, r
);
6295 int r
= gimple_resx_region (stmt
);
6296 r
= move_stmt_eh_region_nr (r
, p
);
6297 gimple_resx_set_region (stmt
, r
);
6301 case GIMPLE_EH_DISPATCH
:
6303 int r
= gimple_eh_dispatch_region (stmt
);
6304 r
= move_stmt_eh_region_nr (r
, p
);
6305 gimple_eh_dispatch_set_region (stmt
, r
);
6309 case GIMPLE_OMP_RETURN
:
6310 case GIMPLE_OMP_CONTINUE
:
6313 if (is_gimple_omp (stmt
))
6315 /* Do not remap variables inside OMP directives. Variables
6316 referenced in clauses and directive header belong to the
6317 parent function and should not be moved into the child
6319 bool save_remap_decls_p
= p
->remap_decls_p
;
6320 p
->remap_decls_p
= false;
6321 *handled_ops_p
= true;
6323 walk_gimple_seq_mod (gimple_omp_body_ptr (stmt
), move_stmt_r
,
6326 p
->remap_decls_p
= save_remap_decls_p
;
6334 /* Move basic block BB from function CFUN to function DEST_FN. The
6335 block is moved out of the original linked list and placed after
6336 block AFTER in the new list. Also, the block is removed from the
6337 original array of blocks and placed in DEST_FN's array of blocks.
6338 If UPDATE_EDGE_COUNT_P is true, the edge counts on both CFGs is
6339 updated to reflect the moved edges.
6341 The local variables are remapped to new instances, VARS_MAP is used
6342 to record the mapping. */
6345 move_block_to_fn (struct function
*dest_cfun
, basic_block bb
,
6346 basic_block after
, bool update_edge_count_p
,
6347 struct move_stmt_d
*d
)
6349 struct control_flow_graph
*cfg
;
6352 gimple_stmt_iterator si
;
6353 unsigned old_len
, new_len
;
6355 /* Remove BB from dominance structures. */
6356 delete_from_dominance_info (CDI_DOMINATORS
, bb
);
6358 /* Move BB from its current loop to the copy in the new function. */
6361 struct loop
*new_loop
= (struct loop
*)bb
->loop_father
->aux
;
6363 bb
->loop_father
= new_loop
;
6366 /* Link BB to the new linked list. */
6367 move_block_after (bb
, after
);
6369 /* Update the edge count in the corresponding flowgraphs. */
6370 if (update_edge_count_p
)
6371 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
6373 cfun
->cfg
->x_n_edges
--;
6374 dest_cfun
->cfg
->x_n_edges
++;
6377 /* Remove BB from the original basic block array. */
6378 (*cfun
->cfg
->x_basic_block_info
)[bb
->index
] = NULL
;
6379 cfun
->cfg
->x_n_basic_blocks
--;
6381 /* Grow DEST_CFUN's basic block array if needed. */
6382 cfg
= dest_cfun
->cfg
;
6383 cfg
->x_n_basic_blocks
++;
6384 if (bb
->index
>= cfg
->x_last_basic_block
)
6385 cfg
->x_last_basic_block
= bb
->index
+ 1;
6387 old_len
= vec_safe_length (cfg
->x_basic_block_info
);
6388 if ((unsigned) cfg
->x_last_basic_block
>= old_len
)
6390 new_len
= cfg
->x_last_basic_block
+ (cfg
->x_last_basic_block
+ 3) / 4;
6391 vec_safe_grow_cleared (cfg
->x_basic_block_info
, new_len
);
6394 (*cfg
->x_basic_block_info
)[bb
->index
] = bb
;
6396 /* Remap the variables in phi nodes. */
6397 for (si
= gsi_start_phis (bb
); !gsi_end_p (si
); )
6399 gimple phi
= gsi_stmt (si
);
6401 tree op
= PHI_RESULT (phi
);
6405 if (virtual_operand_p (op
))
6407 /* Remove the phi nodes for virtual operands (alias analysis will be
6408 run for the new function, anyway). */
6409 remove_phi_node (&si
, true);
6413 SET_PHI_RESULT (phi
,
6414 replace_ssa_name (op
, d
->vars_map
, dest_cfun
->decl
));
6415 FOR_EACH_PHI_ARG (use
, phi
, oi
, SSA_OP_USE
)
6417 op
= USE_FROM_PTR (use
);
6418 if (TREE_CODE (op
) == SSA_NAME
)
6419 SET_USE (use
, replace_ssa_name (op
, d
->vars_map
, dest_cfun
->decl
));
6422 for (i
= 0; i
< EDGE_COUNT (bb
->preds
); i
++)
6424 location_t locus
= gimple_phi_arg_location (phi
, i
);
6425 tree block
= LOCATION_BLOCK (locus
);
6427 if (locus
== UNKNOWN_LOCATION
)
6429 if (d
->orig_block
== NULL_TREE
|| block
== d
->orig_block
)
6431 if (d
->new_block
== NULL_TREE
)
6432 locus
= LOCATION_LOCUS (locus
);
6434 locus
= COMBINE_LOCATION_DATA (line_table
, locus
, d
->new_block
);
6435 gimple_phi_arg_set_location (phi
, i
, locus
);
6442 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
6444 gimple stmt
= gsi_stmt (si
);
6445 struct walk_stmt_info wi
;
6447 memset (&wi
, 0, sizeof (wi
));
6449 walk_gimple_stmt (&si
, move_stmt_r
, move_stmt_op
, &wi
);
6451 if (gimple_code (stmt
) == GIMPLE_LABEL
)
6453 tree label
= gimple_label_label (stmt
);
6454 int uid
= LABEL_DECL_UID (label
);
6456 gcc_assert (uid
> -1);
6458 old_len
= vec_safe_length (cfg
->x_label_to_block_map
);
6459 if (old_len
<= (unsigned) uid
)
6461 new_len
= 3 * uid
/ 2 + 1;
6462 vec_safe_grow_cleared (cfg
->x_label_to_block_map
, new_len
);
6465 (*cfg
->x_label_to_block_map
)[uid
] = bb
;
6466 (*cfun
->cfg
->x_label_to_block_map
)[uid
] = NULL
;
6468 gcc_assert (DECL_CONTEXT (label
) == dest_cfun
->decl
);
6470 if (uid
>= dest_cfun
->cfg
->last_label_uid
)
6471 dest_cfun
->cfg
->last_label_uid
= uid
+ 1;
6474 maybe_duplicate_eh_stmt_fn (dest_cfun
, stmt
, cfun
, stmt
, d
->eh_map
, 0);
6475 remove_stmt_from_eh_lp_fn (cfun
, stmt
);
6477 gimple_duplicate_stmt_histograms (dest_cfun
, stmt
, cfun
, stmt
);
6478 gimple_remove_stmt_histograms (cfun
, stmt
);
6480 /* We cannot leave any operands allocated from the operand caches of
6481 the current function. */
6482 free_stmt_operands (stmt
);
6483 push_cfun (dest_cfun
);
6488 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
6489 if (e
->goto_locus
!= UNKNOWN_LOCATION
)
6491 tree block
= LOCATION_BLOCK (e
->goto_locus
);
6492 if (d
->orig_block
== NULL_TREE
6493 || block
== d
->orig_block
)
6494 e
->goto_locus
= d
->new_block
?
6495 COMBINE_LOCATION_DATA (line_table
, e
->goto_locus
, d
->new_block
) :
6496 LOCATION_LOCUS (e
->goto_locus
);
6500 /* Examine the statements in BB (which is in SRC_CFUN); find and return
6501 the outermost EH region. Use REGION as the incoming base EH region. */
6504 find_outermost_region_in_block (struct function
*src_cfun
,
6505 basic_block bb
, eh_region region
)
6507 gimple_stmt_iterator si
;
6509 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
6511 gimple stmt
= gsi_stmt (si
);
6512 eh_region stmt_region
;
6515 lp_nr
= lookup_stmt_eh_lp_fn (src_cfun
, stmt
);
6516 stmt_region
= get_eh_region_from_lp_number_fn (src_cfun
, lp_nr
);
6520 region
= stmt_region
;
6521 else if (stmt_region
!= region
)
6523 region
= eh_region_outermost (src_cfun
, stmt_region
, region
);
6524 gcc_assert (region
!= NULL
);
6533 new_label_mapper (tree decl
, void *data
)
6535 htab_t hash
= (htab_t
) data
;
6539 gcc_assert (TREE_CODE (decl
) == LABEL_DECL
);
6541 m
= XNEW (struct tree_map
);
6542 m
->hash
= DECL_UID (decl
);
6543 m
->base
.from
= decl
;
6544 m
->to
= create_artificial_label (UNKNOWN_LOCATION
);
6545 LABEL_DECL_UID (m
->to
) = LABEL_DECL_UID (decl
);
6546 if (LABEL_DECL_UID (m
->to
) >= cfun
->cfg
->last_label_uid
)
6547 cfun
->cfg
->last_label_uid
= LABEL_DECL_UID (m
->to
) + 1;
6549 slot
= htab_find_slot_with_hash (hash
, m
, m
->hash
, INSERT
);
6550 gcc_assert (*slot
== NULL
);
6557 /* Change DECL_CONTEXT of all BLOCK_VARS in block, including
6561 replace_block_vars_by_duplicates (tree block
, struct pointer_map_t
*vars_map
,
6566 for (tp
= &BLOCK_VARS (block
); *tp
; tp
= &DECL_CHAIN (*tp
))
6569 if (TREE_CODE (t
) != VAR_DECL
&& TREE_CODE (t
) != CONST_DECL
)
6571 replace_by_duplicate_decl (&t
, vars_map
, to_context
);
6574 if (TREE_CODE (*tp
) == VAR_DECL
&& DECL_HAS_VALUE_EXPR_P (*tp
))
6576 SET_DECL_VALUE_EXPR (t
, DECL_VALUE_EXPR (*tp
));
6577 DECL_HAS_VALUE_EXPR_P (t
) = 1;
6579 DECL_CHAIN (t
) = DECL_CHAIN (*tp
);
6584 for (block
= BLOCK_SUBBLOCKS (block
); block
; block
= BLOCK_CHAIN (block
))
6585 replace_block_vars_by_duplicates (block
, vars_map
, to_context
);
6588 /* Fixup the loop arrays and numbers after moving LOOP and its subloops
6592 fixup_loop_arrays_after_move (struct function
*fn1
, struct function
*fn2
,
6595 /* Discard it from the old loop array. */
6596 (*get_loops (fn1
))[loop
->num
] = NULL
;
6598 /* Place it in the new loop array, assigning it a new number. */
6599 loop
->num
= number_of_loops (fn2
);
6600 vec_safe_push (loops_for_fn (fn2
)->larray
, loop
);
6602 /* Recurse to children. */
6603 for (loop
= loop
->inner
; loop
; loop
= loop
->next
)
6604 fixup_loop_arrays_after_move (fn1
, fn2
, loop
);
6607 /* Move a single-entry, single-exit region delimited by ENTRY_BB and
6608 EXIT_BB to function DEST_CFUN. The whole region is replaced by a
6609 single basic block in the original CFG and the new basic block is
6610 returned. DEST_CFUN must not have a CFG yet.
6612 Note that the region need not be a pure SESE region. Blocks inside
6613 the region may contain calls to abort/exit. The only restriction
6614 is that ENTRY_BB should be the only entry point and it must
6617 Change TREE_BLOCK of all statements in ORIG_BLOCK to the new
6618 functions outermost BLOCK, move all subblocks of ORIG_BLOCK
6619 to the new function.
6621 All local variables referenced in the region are assumed to be in
6622 the corresponding BLOCK_VARS and unexpanded variable lists
6623 associated with DEST_CFUN. */
6626 move_sese_region_to_fn (struct function
*dest_cfun
, basic_block entry_bb
,
6627 basic_block exit_bb
, tree orig_block
)
6629 vec
<basic_block
> bbs
, dom_bbs
;
6630 basic_block dom_entry
= get_immediate_dominator (CDI_DOMINATORS
, entry_bb
);
6631 basic_block after
, bb
, *entry_pred
, *exit_succ
, abb
;
6632 struct function
*saved_cfun
= cfun
;
6633 int *entry_flag
, *exit_flag
;
6634 unsigned *entry_prob
, *exit_prob
;
6635 unsigned i
, num_entry_edges
, num_exit_edges
, num_nodes
;
6638 htab_t new_label_map
;
6639 struct pointer_map_t
*vars_map
, *eh_map
;
6640 struct loop
*loop
= entry_bb
->loop_father
;
6641 struct loop
*loop0
= get_loop (saved_cfun
, 0);
6642 struct move_stmt_d d
;
6644 /* If ENTRY does not strictly dominate EXIT, this cannot be an SESE
6646 gcc_assert (entry_bb
!= exit_bb
6648 || dominated_by_p (CDI_DOMINATORS
, exit_bb
, entry_bb
)));
6650 /* Collect all the blocks in the region. Manually add ENTRY_BB
6651 because it won't be added by dfs_enumerate_from. */
6653 bbs
.safe_push (entry_bb
);
6654 gather_blocks_in_sese_region (entry_bb
, exit_bb
, &bbs
);
6656 /* The blocks that used to be dominated by something in BBS will now be
6657 dominated by the new block. */
6658 dom_bbs
= get_dominated_by_region (CDI_DOMINATORS
,
6662 /* Detach ENTRY_BB and EXIT_BB from CFUN->CFG. We need to remember
6663 the predecessor edges to ENTRY_BB and the successor edges to
6664 EXIT_BB so that we can re-attach them to the new basic block that
6665 will replace the region. */
6666 num_entry_edges
= EDGE_COUNT (entry_bb
->preds
);
6667 entry_pred
= XNEWVEC (basic_block
, num_entry_edges
);
6668 entry_flag
= XNEWVEC (int, num_entry_edges
);
6669 entry_prob
= XNEWVEC (unsigned, num_entry_edges
);
6671 for (ei
= ei_start (entry_bb
->preds
); (e
= ei_safe_edge (ei
)) != NULL
;)
6673 entry_prob
[i
] = e
->probability
;
6674 entry_flag
[i
] = e
->flags
;
6675 entry_pred
[i
++] = e
->src
;
6681 num_exit_edges
= EDGE_COUNT (exit_bb
->succs
);
6682 exit_succ
= XNEWVEC (basic_block
, num_exit_edges
);
6683 exit_flag
= XNEWVEC (int, num_exit_edges
);
6684 exit_prob
= XNEWVEC (unsigned, num_exit_edges
);
6686 for (ei
= ei_start (exit_bb
->succs
); (e
= ei_safe_edge (ei
)) != NULL
;)
6688 exit_prob
[i
] = e
->probability
;
6689 exit_flag
[i
] = e
->flags
;
6690 exit_succ
[i
++] = e
->dest
;
6702 /* Switch context to the child function to initialize DEST_FN's CFG. */
6703 gcc_assert (dest_cfun
->cfg
== NULL
);
6704 push_cfun (dest_cfun
);
6706 init_empty_tree_cfg ();
6708 /* Initialize EH information for the new function. */
6710 new_label_map
= NULL
;
6713 eh_region region
= NULL
;
6715 FOR_EACH_VEC_ELT (bbs
, i
, bb
)
6716 region
= find_outermost_region_in_block (saved_cfun
, bb
, region
);
6718 init_eh_for_function ();
6721 new_label_map
= htab_create (17, tree_map_hash
, tree_map_eq
, free
);
6722 eh_map
= duplicate_eh_regions (saved_cfun
, region
, 0,
6723 new_label_mapper
, new_label_map
);
6727 /* Initialize an empty loop tree. */
6728 struct loops
*loops
= ggc_alloc_cleared_loops ();
6729 init_loops_structure (dest_cfun
, loops
, 1);
6730 loops
->state
= LOOPS_MAY_HAVE_MULTIPLE_LATCHES
;
6731 set_loops_for_fn (dest_cfun
, loops
);
6733 /* Move the outlined loop tree part. */
6734 num_nodes
= bbs
.length ();
6735 FOR_EACH_VEC_ELT (bbs
, i
, bb
)
6737 if (bb
->loop_father
->header
== bb
)
6739 struct loop
*this_loop
= bb
->loop_father
;
6740 struct loop
*outer
= loop_outer (this_loop
);
6742 /* If the SESE region contains some bbs ending with
6743 a noreturn call, those are considered to belong
6744 to the outermost loop in saved_cfun, rather than
6745 the entry_bb's loop_father. */
6749 num_nodes
-= this_loop
->num_nodes
;
6750 flow_loop_tree_node_remove (bb
->loop_father
);
6751 flow_loop_tree_node_add (get_loop (dest_cfun
, 0), this_loop
);
6752 fixup_loop_arrays_after_move (saved_cfun
, cfun
, this_loop
);
6755 else if (bb
->loop_father
== loop0
&& loop0
!= loop
)
6758 /* Remove loop exits from the outlined region. */
6759 if (loops_for_fn (saved_cfun
)->exits
)
6760 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
6762 void **slot
= htab_find_slot_with_hash
6763 (loops_for_fn (saved_cfun
)->exits
, e
,
6764 htab_hash_pointer (e
), NO_INSERT
);
6766 htab_clear_slot (loops_for_fn (saved_cfun
)->exits
, slot
);
6771 /* Adjust the number of blocks in the tree root of the outlined part. */
6772 get_loop (dest_cfun
, 0)->num_nodes
= bbs
.length () + 2;
6774 /* Setup a mapping to be used by move_block_to_fn. */
6775 loop
->aux
= current_loops
->tree_root
;
6776 loop0
->aux
= current_loops
->tree_root
;
6780 /* Move blocks from BBS into DEST_CFUN. */
6781 gcc_assert (bbs
.length () >= 2);
6782 after
= dest_cfun
->cfg
->x_entry_block_ptr
;
6783 vars_map
= pointer_map_create ();
6785 memset (&d
, 0, sizeof (d
));
6786 d
.orig_block
= orig_block
;
6787 d
.new_block
= DECL_INITIAL (dest_cfun
->decl
);
6788 d
.from_context
= cfun
->decl
;
6789 d
.to_context
= dest_cfun
->decl
;
6790 d
.vars_map
= vars_map
;
6791 d
.new_label_map
= new_label_map
;
6793 d
.remap_decls_p
= true;
6795 FOR_EACH_VEC_ELT (bbs
, i
, bb
)
6797 /* No need to update edge counts on the last block. It has
6798 already been updated earlier when we detached the region from
6799 the original CFG. */
6800 move_block_to_fn (dest_cfun
, bb
, after
, bb
!= exit_bb
, &d
);
6806 /* Loop sizes are no longer correct, fix them up. */
6807 loop
->num_nodes
-= num_nodes
;
6808 for (struct loop
*outer
= loop_outer (loop
);
6809 outer
; outer
= loop_outer (outer
))
6810 outer
->num_nodes
-= num_nodes
;
6811 loop0
->num_nodes
-= bbs
.length () - num_nodes
;
6813 if (saved_cfun
->has_simduid_loops
|| saved_cfun
->has_force_vect_loops
)
6816 for (i
= 0; vec_safe_iterate (loops
->larray
, i
, &aloop
); i
++)
6821 replace_by_duplicate_decl (&aloop
->simduid
, d
.vars_map
,
6823 dest_cfun
->has_simduid_loops
= true;
6825 if (aloop
->force_vect
)
6826 dest_cfun
->has_force_vect_loops
= true;
6830 /* Rewire BLOCK_SUBBLOCKS of orig_block. */
6834 gcc_assert (BLOCK_SUBBLOCKS (DECL_INITIAL (dest_cfun
->decl
))
6836 BLOCK_SUBBLOCKS (DECL_INITIAL (dest_cfun
->decl
))
6837 = BLOCK_SUBBLOCKS (orig_block
);
6838 for (block
= BLOCK_SUBBLOCKS (orig_block
);
6839 block
; block
= BLOCK_CHAIN (block
))
6840 BLOCK_SUPERCONTEXT (block
) = DECL_INITIAL (dest_cfun
->decl
);
6841 BLOCK_SUBBLOCKS (orig_block
) = NULL_TREE
;
6844 replace_block_vars_by_duplicates (DECL_INITIAL (dest_cfun
->decl
),
6845 vars_map
, dest_cfun
->decl
);
6848 htab_delete (new_label_map
);
6850 pointer_map_destroy (eh_map
);
6851 pointer_map_destroy (vars_map
);
6853 /* Rewire the entry and exit blocks. The successor to the entry
6854 block turns into the successor of DEST_FN's ENTRY_BLOCK_PTR in
6855 the child function. Similarly, the predecessor of DEST_FN's
6856 EXIT_BLOCK_PTR turns into the predecessor of EXIT_BLOCK_PTR. We
6857 need to switch CFUN between DEST_CFUN and SAVED_CFUN so that the
6858 various CFG manipulation function get to the right CFG.
6860 FIXME, this is silly. The CFG ought to become a parameter to
6862 push_cfun (dest_cfun
);
6863 make_edge (ENTRY_BLOCK_PTR
, entry_bb
, EDGE_FALLTHRU
);
6865 make_edge (exit_bb
, EXIT_BLOCK_PTR
, 0);
6868 /* Back in the original function, the SESE region has disappeared,
6869 create a new basic block in its place. */
6870 bb
= create_empty_bb (entry_pred
[0]);
6872 add_bb_to_loop (bb
, loop
);
6873 for (i
= 0; i
< num_entry_edges
; i
++)
6875 e
= make_edge (entry_pred
[i
], bb
, entry_flag
[i
]);
6876 e
->probability
= entry_prob
[i
];
6879 for (i
= 0; i
< num_exit_edges
; i
++)
6881 e
= make_edge (bb
, exit_succ
[i
], exit_flag
[i
]);
6882 e
->probability
= exit_prob
[i
];
6885 set_immediate_dominator (CDI_DOMINATORS
, bb
, dom_entry
);
6886 FOR_EACH_VEC_ELT (dom_bbs
, i
, abb
)
6887 set_immediate_dominator (CDI_DOMINATORS
, abb
, bb
);
6905 /* Dump FUNCTION_DECL FN to file FILE using FLAGS (see TDF_* in dumpfile.h)
6909 dump_function_to_file (tree fndecl
, FILE *file
, int flags
)
6911 tree arg
, var
, old_current_fndecl
= current_function_decl
;
6912 struct function
*dsf
;
6913 bool ignore_topmost_bind
= false, any_var
= false;
6916 bool tmclone
= (TREE_CODE (fndecl
) == FUNCTION_DECL
6917 && decl_is_tm_clone (fndecl
));
6918 struct function
*fun
= DECL_STRUCT_FUNCTION (fndecl
);
6920 current_function_decl
= fndecl
;
6921 fprintf (file
, "%s %s(", function_name (fun
), tmclone
? "[tm-clone] " : "");
6923 arg
= DECL_ARGUMENTS (fndecl
);
6926 print_generic_expr (file
, TREE_TYPE (arg
), dump_flags
);
6927 fprintf (file
, " ");
6928 print_generic_expr (file
, arg
, dump_flags
);
6929 if (flags
& TDF_VERBOSE
)
6930 print_node (file
, "", arg
, 4);
6931 if (DECL_CHAIN (arg
))
6932 fprintf (file
, ", ");
6933 arg
= DECL_CHAIN (arg
);
6935 fprintf (file
, ")\n");
6937 if (flags
& TDF_VERBOSE
)
6938 print_node (file
, "", fndecl
, 2);
6940 dsf
= DECL_STRUCT_FUNCTION (fndecl
);
6941 if (dsf
&& (flags
& TDF_EH
))
6942 dump_eh_tree (file
, dsf
);
6944 if (flags
& TDF_RAW
&& !gimple_has_body_p (fndecl
))
6946 dump_node (fndecl
, TDF_SLIM
| flags
, file
);
6947 current_function_decl
= old_current_fndecl
;
6951 /* When GIMPLE is lowered, the variables are no longer available in
6952 BIND_EXPRs, so display them separately. */
6953 if (fun
&& fun
->decl
== fndecl
&& (fun
->curr_properties
& PROP_gimple_lcf
))
6956 ignore_topmost_bind
= true;
6958 fprintf (file
, "{\n");
6959 if (!vec_safe_is_empty (fun
->local_decls
))
6960 FOR_EACH_LOCAL_DECL (fun
, ix
, var
)
6962 print_generic_decl (file
, var
, flags
);
6963 if (flags
& TDF_VERBOSE
)
6964 print_node (file
, "", var
, 4);
6965 fprintf (file
, "\n");
6969 if (gimple_in_ssa_p (cfun
))
6970 for (ix
= 1; ix
< num_ssa_names
; ++ix
)
6972 tree name
= ssa_name (ix
);
6973 if (name
&& !SSA_NAME_VAR (name
))
6975 fprintf (file
, " ");
6976 print_generic_expr (file
, TREE_TYPE (name
), flags
);
6977 fprintf (file
, " ");
6978 print_generic_expr (file
, name
, flags
);
6979 fprintf (file
, ";\n");
6986 if (fun
&& fun
->decl
== fndecl
6988 && basic_block_info_for_function (fun
))
6990 /* If the CFG has been built, emit a CFG-based dump. */
6991 if (!ignore_topmost_bind
)
6992 fprintf (file
, "{\n");
6994 if (any_var
&& n_basic_blocks_for_function (fun
))
6995 fprintf (file
, "\n");
6997 FOR_EACH_BB_FN (bb
, fun
)
6998 dump_bb (file
, bb
, 2, flags
| TDF_COMMENT
);
7000 fprintf (file
, "}\n");
7002 else if (DECL_SAVED_TREE (fndecl
) == NULL
)
7004 /* The function is now in GIMPLE form but the CFG has not been
7005 built yet. Emit the single sequence of GIMPLE statements
7006 that make up its body. */
7007 gimple_seq body
= gimple_body (fndecl
);
7009 if (gimple_seq_first_stmt (body
)
7010 && gimple_seq_first_stmt (body
) == gimple_seq_last_stmt (body
)
7011 && gimple_code (gimple_seq_first_stmt (body
)) == GIMPLE_BIND
)
7012 print_gimple_seq (file
, body
, 0, flags
);
7015 if (!ignore_topmost_bind
)
7016 fprintf (file
, "{\n");
7019 fprintf (file
, "\n");
7021 print_gimple_seq (file
, body
, 2, flags
);
7022 fprintf (file
, "}\n");
7029 /* Make a tree based dump. */
7030 chain
= DECL_SAVED_TREE (fndecl
);
7031 if (chain
&& TREE_CODE (chain
) == BIND_EXPR
)
7033 if (ignore_topmost_bind
)
7035 chain
= BIND_EXPR_BODY (chain
);
7043 if (!ignore_topmost_bind
)
7044 fprintf (file
, "{\n");
7049 fprintf (file
, "\n");
7051 print_generic_stmt_indented (file
, chain
, flags
, indent
);
7052 if (ignore_topmost_bind
)
7053 fprintf (file
, "}\n");
7056 if (flags
& TDF_ENUMERATE_LOCALS
)
7057 dump_enumerated_decls (file
, flags
);
7058 fprintf (file
, "\n\n");
7060 current_function_decl
= old_current_fndecl
;
7063 /* Dump FUNCTION_DECL FN to stderr using FLAGS (see TDF_* in tree.h) */
7066 debug_function (tree fn
, int flags
)
7068 dump_function_to_file (fn
, stderr
, flags
);
7072 /* Print on FILE the indexes for the predecessors of basic_block BB. */
7075 print_pred_bbs (FILE *file
, basic_block bb
)
7080 FOR_EACH_EDGE (e
, ei
, bb
->preds
)
7081 fprintf (file
, "bb_%d ", e
->src
->index
);
7085 /* Print on FILE the indexes for the successors of basic_block BB. */
7088 print_succ_bbs (FILE *file
, basic_block bb
)
7093 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
7094 fprintf (file
, "bb_%d ", e
->dest
->index
);
7097 /* Print to FILE the basic block BB following the VERBOSITY level. */
7100 print_loops_bb (FILE *file
, basic_block bb
, int indent
, int verbosity
)
7102 char *s_indent
= (char *) alloca ((size_t) indent
+ 1);
7103 memset ((void *) s_indent
, ' ', (size_t) indent
);
7104 s_indent
[indent
] = '\0';
7106 /* Print basic_block's header. */
7109 fprintf (file
, "%s bb_%d (preds = {", s_indent
, bb
->index
);
7110 print_pred_bbs (file
, bb
);
7111 fprintf (file
, "}, succs = {");
7112 print_succ_bbs (file
, bb
);
7113 fprintf (file
, "})\n");
7116 /* Print basic_block's body. */
7119 fprintf (file
, "%s {\n", s_indent
);
7120 dump_bb (file
, bb
, indent
+ 4, TDF_VOPS
|TDF_MEMSYMS
);
7121 fprintf (file
, "%s }\n", s_indent
);
7125 static void print_loop_and_siblings (FILE *, struct loop
*, int, int);
7127 /* Pretty print LOOP on FILE, indented INDENT spaces. Following
7128 VERBOSITY level this outputs the contents of the loop, or just its
7132 print_loop (FILE *file
, struct loop
*loop
, int indent
, int verbosity
)
7140 s_indent
= (char *) alloca ((size_t) indent
+ 1);
7141 memset ((void *) s_indent
, ' ', (size_t) indent
);
7142 s_indent
[indent
] = '\0';
7144 /* Print loop's header. */
7145 fprintf (file
, "%sloop_%d (", s_indent
, loop
->num
);
7147 fprintf (file
, "header = %d", loop
->header
->index
);
7150 fprintf (file
, "deleted)\n");
7154 fprintf (file
, ", latch = %d", loop
->latch
->index
);
7156 fprintf (file
, ", multiple latches");
7157 fprintf (file
, ", niter = ");
7158 print_generic_expr (file
, loop
->nb_iterations
, 0);
7160 if (loop
->any_upper_bound
)
7162 fprintf (file
, ", upper_bound = ");
7163 dump_double_int (file
, loop
->nb_iterations_upper_bound
, true);
7166 if (loop
->any_estimate
)
7168 fprintf (file
, ", estimate = ");
7169 dump_double_int (file
, loop
->nb_iterations_estimate
, true);
7171 fprintf (file
, ")\n");
7173 /* Print loop's body. */
7176 fprintf (file
, "%s{\n", s_indent
);
7178 if (bb
->loop_father
== loop
)
7179 print_loops_bb (file
, bb
, indent
, verbosity
);
7181 print_loop_and_siblings (file
, loop
->inner
, indent
+ 2, verbosity
);
7182 fprintf (file
, "%s}\n", s_indent
);
7186 /* Print the LOOP and its sibling loops on FILE, indented INDENT
7187 spaces. Following VERBOSITY level this outputs the contents of the
7188 loop, or just its structure. */
7191 print_loop_and_siblings (FILE *file
, struct loop
*loop
, int indent
,
7197 print_loop (file
, loop
, indent
, verbosity
);
7198 print_loop_and_siblings (file
, loop
->next
, indent
, verbosity
);
7201 /* Follow a CFG edge from the entry point of the program, and on entry
7202 of a loop, pretty print the loop structure on FILE. */
7205 print_loops (FILE *file
, int verbosity
)
7209 bb
= ENTRY_BLOCK_PTR
;
7210 if (bb
&& bb
->loop_father
)
7211 print_loop_and_siblings (file
, bb
->loop_father
, 0, verbosity
);
7217 debug (struct loop
&ref
)
7219 print_loop (stderr
, &ref
, 0, /*verbosity*/0);
7223 debug (struct loop
*ptr
)
7228 fprintf (stderr
, "<nil>\n");
7231 /* Dump a loop verbosely. */
7234 debug_verbose (struct loop
&ref
)
7236 print_loop (stderr
, &ref
, 0, /*verbosity*/3);
7240 debug_verbose (struct loop
*ptr
)
7245 fprintf (stderr
, "<nil>\n");
7249 /* Debugging loops structure at tree level, at some VERBOSITY level. */
7252 debug_loops (int verbosity
)
7254 print_loops (stderr
, verbosity
);
7257 /* Print on stderr the code of LOOP, at some VERBOSITY level. */
7260 debug_loop (struct loop
*loop
, int verbosity
)
7262 print_loop (stderr
, loop
, 0, verbosity
);
7265 /* Print on stderr the code of loop number NUM, at some VERBOSITY
7269 debug_loop_num (unsigned num
, int verbosity
)
7271 debug_loop (get_loop (cfun
, num
), verbosity
);
7274 /* Return true if BB ends with a call, possibly followed by some
7275 instructions that must stay with the call. Return false,
7279 gimple_block_ends_with_call_p (basic_block bb
)
7281 gimple_stmt_iterator gsi
= gsi_last_nondebug_bb (bb
);
7282 return !gsi_end_p (gsi
) && is_gimple_call (gsi_stmt (gsi
));
7286 /* Return true if BB ends with a conditional branch. Return false,
7290 gimple_block_ends_with_condjump_p (const_basic_block bb
)
7292 gimple stmt
= last_stmt (CONST_CAST_BB (bb
));
7293 return (stmt
&& gimple_code (stmt
) == GIMPLE_COND
);
7297 /* Return true if we need to add fake edge to exit at statement T.
7298 Helper function for gimple_flow_call_edges_add. */
7301 need_fake_edge_p (gimple t
)
7303 tree fndecl
= NULL_TREE
;
7306 /* NORETURN and LONGJMP calls already have an edge to exit.
7307 CONST and PURE calls do not need one.
7308 We don't currently check for CONST and PURE here, although
7309 it would be a good idea, because those attributes are
7310 figured out from the RTL in mark_constant_function, and
7311 the counter incrementation code from -fprofile-arcs
7312 leads to different results from -fbranch-probabilities. */
7313 if (is_gimple_call (t
))
7315 fndecl
= gimple_call_fndecl (t
);
7316 call_flags
= gimple_call_flags (t
);
7319 if (is_gimple_call (t
)
7321 && DECL_BUILT_IN (fndecl
)
7322 && (call_flags
& ECF_NOTHROW
)
7323 && !(call_flags
& ECF_RETURNS_TWICE
)
7324 /* fork() doesn't really return twice, but the effect of
7325 wrapping it in __gcov_fork() which calls __gcov_flush()
7326 and clears the counters before forking has the same
7327 effect as returning twice. Force a fake edge. */
7328 && !(DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
7329 && DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_FORK
))
7332 if (is_gimple_call (t
))
7338 if (!(call_flags
& ECF_NORETURN
))
7342 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
7343 if ((e
->flags
& EDGE_FAKE
) == 0)
7347 if (gimple_code (t
) == GIMPLE_ASM
7348 && (gimple_asm_volatile_p (t
) || gimple_asm_input_p (t
)))
7355 /* Add fake edges to the function exit for any non constant and non
7356 noreturn calls (or noreturn calls with EH/abnormal edges),
7357 volatile inline assembly in the bitmap of blocks specified by BLOCKS
7358 or to the whole CFG if BLOCKS is zero. Return the number of blocks
7361 The goal is to expose cases in which entering a basic block does
7362 not imply that all subsequent instructions must be executed. */
7365 gimple_flow_call_edges_add (sbitmap blocks
)
7368 int blocks_split
= 0;
7369 int last_bb
= last_basic_block
;
7370 bool check_last_block
= false;
7372 if (n_basic_blocks
== NUM_FIXED_BLOCKS
)
7376 check_last_block
= true;
7378 check_last_block
= bitmap_bit_p (blocks
, EXIT_BLOCK_PTR
->prev_bb
->index
);
7380 /* In the last basic block, before epilogue generation, there will be
7381 a fallthru edge to EXIT. Special care is required if the last insn
7382 of the last basic block is a call because make_edge folds duplicate
7383 edges, which would result in the fallthru edge also being marked
7384 fake, which would result in the fallthru edge being removed by
7385 remove_fake_edges, which would result in an invalid CFG.
7387 Moreover, we can't elide the outgoing fake edge, since the block
7388 profiler needs to take this into account in order to solve the minimal
7389 spanning tree in the case that the call doesn't return.
7391 Handle this by adding a dummy instruction in a new last basic block. */
7392 if (check_last_block
)
7394 basic_block bb
= EXIT_BLOCK_PTR
->prev_bb
;
7395 gimple_stmt_iterator gsi
= gsi_last_nondebug_bb (bb
);
7398 if (!gsi_end_p (gsi
))
7401 if (t
&& need_fake_edge_p (t
))
7405 e
= find_edge (bb
, EXIT_BLOCK_PTR
);
7408 gsi_insert_on_edge (e
, gimple_build_nop ());
7409 gsi_commit_edge_inserts ();
7414 /* Now add fake edges to the function exit for any non constant
7415 calls since there is no way that we can determine if they will
7417 for (i
= 0; i
< last_bb
; i
++)
7419 basic_block bb
= BASIC_BLOCK (i
);
7420 gimple_stmt_iterator gsi
;
7421 gimple stmt
, last_stmt
;
7426 if (blocks
&& !bitmap_bit_p (blocks
, i
))
7429 gsi
= gsi_last_nondebug_bb (bb
);
7430 if (!gsi_end_p (gsi
))
7432 last_stmt
= gsi_stmt (gsi
);
7435 stmt
= gsi_stmt (gsi
);
7436 if (need_fake_edge_p (stmt
))
7440 /* The handling above of the final block before the
7441 epilogue should be enough to verify that there is
7442 no edge to the exit block in CFG already.
7443 Calling make_edge in such case would cause us to
7444 mark that edge as fake and remove it later. */
7445 #ifdef ENABLE_CHECKING
7446 if (stmt
== last_stmt
)
7448 e
= find_edge (bb
, EXIT_BLOCK_PTR
);
7449 gcc_assert (e
== NULL
);
7453 /* Note that the following may create a new basic block
7454 and renumber the existing basic blocks. */
7455 if (stmt
!= last_stmt
)
7457 e
= split_block (bb
, stmt
);
7461 make_edge (bb
, EXIT_BLOCK_PTR
, EDGE_FAKE
);
7465 while (!gsi_end_p (gsi
));
7470 verify_flow_info ();
7472 return blocks_split
;
7475 /* Removes edge E and all the blocks dominated by it, and updates dominance
7476 information. The IL in E->src needs to be updated separately.
7477 If dominance info is not available, only the edge E is removed.*/
7480 remove_edge_and_dominated_blocks (edge e
)
7482 vec
<basic_block
> bbs_to_remove
= vNULL
;
7483 vec
<basic_block
> bbs_to_fix_dom
= vNULL
;
7487 bool none_removed
= false;
7489 basic_block bb
, dbb
;
7492 if (!dom_info_available_p (CDI_DOMINATORS
))
7498 /* No updating is needed for edges to exit. */
7499 if (e
->dest
== EXIT_BLOCK_PTR
)
7501 if (cfgcleanup_altered_bbs
)
7502 bitmap_set_bit (cfgcleanup_altered_bbs
, e
->src
->index
);
7507 /* First, we find the basic blocks to remove. If E->dest has a predecessor
7508 that is not dominated by E->dest, then this set is empty. Otherwise,
7509 all the basic blocks dominated by E->dest are removed.
7511 Also, to DF_IDOM we store the immediate dominators of the blocks in
7512 the dominance frontier of E (i.e., of the successors of the
7513 removed blocks, if there are any, and of E->dest otherwise). */
7514 FOR_EACH_EDGE (f
, ei
, e
->dest
->preds
)
7519 if (!dominated_by_p (CDI_DOMINATORS
, f
->src
, e
->dest
))
7521 none_removed
= true;
7526 df
= BITMAP_ALLOC (NULL
);
7527 df_idom
= BITMAP_ALLOC (NULL
);
7530 bitmap_set_bit (df_idom
,
7531 get_immediate_dominator (CDI_DOMINATORS
, e
->dest
)->index
);
7534 bbs_to_remove
= get_all_dominated_blocks (CDI_DOMINATORS
, e
->dest
);
7535 FOR_EACH_VEC_ELT (bbs_to_remove
, i
, bb
)
7537 FOR_EACH_EDGE (f
, ei
, bb
->succs
)
7539 if (f
->dest
!= EXIT_BLOCK_PTR
)
7540 bitmap_set_bit (df
, f
->dest
->index
);
7543 FOR_EACH_VEC_ELT (bbs_to_remove
, i
, bb
)
7544 bitmap_clear_bit (df
, bb
->index
);
7546 EXECUTE_IF_SET_IN_BITMAP (df
, 0, i
, bi
)
7548 bb
= BASIC_BLOCK (i
);
7549 bitmap_set_bit (df_idom
,
7550 get_immediate_dominator (CDI_DOMINATORS
, bb
)->index
);
7554 if (cfgcleanup_altered_bbs
)
7556 /* Record the set of the altered basic blocks. */
7557 bitmap_set_bit (cfgcleanup_altered_bbs
, e
->src
->index
);
7558 bitmap_ior_into (cfgcleanup_altered_bbs
, df
);
7561 /* Remove E and the cancelled blocks. */
7566 /* Walk backwards so as to get a chance to substitute all
7567 released DEFs into debug stmts. See
7568 eliminate_unnecessary_stmts() in tree-ssa-dce.c for more
7570 for (i
= bbs_to_remove
.length (); i
-- > 0; )
7571 delete_basic_block (bbs_to_remove
[i
]);
7574 /* Update the dominance information. The immediate dominator may change only
7575 for blocks whose immediate dominator belongs to DF_IDOM:
7577 Suppose that idom(X) = Y before removal of E and idom(X) != Y after the
7578 removal. Let Z the arbitrary block such that idom(Z) = Y and
7579 Z dominates X after the removal. Before removal, there exists a path P
7580 from Y to X that avoids Z. Let F be the last edge on P that is
7581 removed, and let W = F->dest. Before removal, idom(W) = Y (since Y
7582 dominates W, and because of P, Z does not dominate W), and W belongs to
7583 the dominance frontier of E. Therefore, Y belongs to DF_IDOM. */
7584 EXECUTE_IF_SET_IN_BITMAP (df_idom
, 0, i
, bi
)
7586 bb
= BASIC_BLOCK (i
);
7587 for (dbb
= first_dom_son (CDI_DOMINATORS
, bb
);
7589 dbb
= next_dom_son (CDI_DOMINATORS
, dbb
))
7590 bbs_to_fix_dom
.safe_push (dbb
);
7593 iterate_fix_dominators (CDI_DOMINATORS
, bbs_to_fix_dom
, true);
7596 BITMAP_FREE (df_idom
);
7597 bbs_to_remove
.release ();
7598 bbs_to_fix_dom
.release ();
7601 /* Purge dead EH edges from basic block BB. */
7604 gimple_purge_dead_eh_edges (basic_block bb
)
7606 bool changed
= false;
7609 gimple stmt
= last_stmt (bb
);
7611 if (stmt
&& stmt_can_throw_internal (stmt
))
7614 for (ei
= ei_start (bb
->succs
); (e
= ei_safe_edge (ei
)); )
7616 if (e
->flags
& EDGE_EH
)
7618 remove_edge_and_dominated_blocks (e
);
7628 /* Purge dead EH edges from basic block listed in BLOCKS. */
7631 gimple_purge_all_dead_eh_edges (const_bitmap blocks
)
7633 bool changed
= false;
7637 EXECUTE_IF_SET_IN_BITMAP (blocks
, 0, i
, bi
)
7639 basic_block bb
= BASIC_BLOCK (i
);
7641 /* Earlier gimple_purge_dead_eh_edges could have removed
7642 this basic block already. */
7643 gcc_assert (bb
|| changed
);
7645 changed
|= gimple_purge_dead_eh_edges (bb
);
7651 /* Purge dead abnormal call edges from basic block BB. */
7654 gimple_purge_dead_abnormal_call_edges (basic_block bb
)
7656 bool changed
= false;
7659 gimple stmt
= last_stmt (bb
);
7661 if (!cfun
->has_nonlocal_label
7662 && !cfun
->calls_setjmp
)
7665 if (stmt
&& stmt_can_make_abnormal_goto (stmt
))
7668 for (ei
= ei_start (bb
->succs
); (e
= ei_safe_edge (ei
)); )
7670 if (e
->flags
& EDGE_ABNORMAL
)
7672 if (e
->flags
& EDGE_FALLTHRU
)
7673 e
->flags
&= ~EDGE_ABNORMAL
;
7675 remove_edge_and_dominated_blocks (e
);
7685 /* Purge dead abnormal call edges from basic block listed in BLOCKS. */
7688 gimple_purge_all_dead_abnormal_call_edges (const_bitmap blocks
)
7690 bool changed
= false;
7694 EXECUTE_IF_SET_IN_BITMAP (blocks
, 0, i
, bi
)
7696 basic_block bb
= BASIC_BLOCK (i
);
7698 /* Earlier gimple_purge_dead_abnormal_call_edges could have removed
7699 this basic block already. */
7700 gcc_assert (bb
|| changed
);
7702 changed
|= gimple_purge_dead_abnormal_call_edges (bb
);
7708 /* This function is called whenever a new edge is created or
7712 gimple_execute_on_growing_pred (edge e
)
7714 basic_block bb
= e
->dest
;
7716 if (!gimple_seq_empty_p (phi_nodes (bb
)))
7717 reserve_phi_args_for_new_edge (bb
);
7720 /* This function is called immediately before edge E is removed from
7721 the edge vector E->dest->preds. */
7724 gimple_execute_on_shrinking_pred (edge e
)
7726 if (!gimple_seq_empty_p (phi_nodes (e
->dest
)))
7727 remove_phi_args (e
);
7730 /*---------------------------------------------------------------------------
7731 Helper functions for Loop versioning
7732 ---------------------------------------------------------------------------*/
7734 /* Adjust phi nodes for 'first' basic block. 'second' basic block is a copy
7735 of 'first'. Both of them are dominated by 'new_head' basic block. When
7736 'new_head' was created by 'second's incoming edge it received phi arguments
7737 on the edge by split_edge(). Later, additional edge 'e' was created to
7738 connect 'new_head' and 'first'. Now this routine adds phi args on this
7739 additional edge 'e' that new_head to second edge received as part of edge
7743 gimple_lv_adjust_loop_header_phi (basic_block first
, basic_block second
,
7744 basic_block new_head
, edge e
)
7747 gimple_stmt_iterator psi1
, psi2
;
7749 edge e2
= find_edge (new_head
, second
);
7751 /* Because NEW_HEAD has been created by splitting SECOND's incoming
7752 edge, we should always have an edge from NEW_HEAD to SECOND. */
7753 gcc_assert (e2
!= NULL
);
7755 /* Browse all 'second' basic block phi nodes and add phi args to
7756 edge 'e' for 'first' head. PHI args are always in correct order. */
7758 for (psi2
= gsi_start_phis (second
),
7759 psi1
= gsi_start_phis (first
);
7760 !gsi_end_p (psi2
) && !gsi_end_p (psi1
);
7761 gsi_next (&psi2
), gsi_next (&psi1
))
7763 phi1
= gsi_stmt (psi1
);
7764 phi2
= gsi_stmt (psi2
);
7765 def
= PHI_ARG_DEF (phi2
, e2
->dest_idx
);
7766 add_phi_arg (phi1
, def
, e
, gimple_phi_arg_location_from_edge (phi2
, e2
));
7771 /* Adds a if else statement to COND_BB with condition COND_EXPR.
7772 SECOND_HEAD is the destination of the THEN and FIRST_HEAD is
7773 the destination of the ELSE part. */
7776 gimple_lv_add_condition_to_bb (basic_block first_head ATTRIBUTE_UNUSED
,
7777 basic_block second_head ATTRIBUTE_UNUSED
,
7778 basic_block cond_bb
, void *cond_e
)
7780 gimple_stmt_iterator gsi
;
7781 gimple new_cond_expr
;
7782 tree cond_expr
= (tree
) cond_e
;
7785 /* Build new conditional expr */
7786 new_cond_expr
= gimple_build_cond_from_tree (cond_expr
,
7787 NULL_TREE
, NULL_TREE
);
7789 /* Add new cond in cond_bb. */
7790 gsi
= gsi_last_bb (cond_bb
);
7791 gsi_insert_after (&gsi
, new_cond_expr
, GSI_NEW_STMT
);
7793 /* Adjust edges appropriately to connect new head with first head
7794 as well as second head. */
7795 e0
= single_succ_edge (cond_bb
);
7796 e0
->flags
&= ~EDGE_FALLTHRU
;
7797 e0
->flags
|= EDGE_FALSE_VALUE
;
7801 /* Do book-keeping of basic block BB for the profile consistency checker.
7802 If AFTER_PASS is 0, do pre-pass accounting, or if AFTER_PASS is 1
7803 then do post-pass accounting. Store the counting in RECORD. */
7805 gimple_account_profile_record (basic_block bb
, int after_pass
,
7806 struct profile_record
*record
)
7808 gimple_stmt_iterator i
;
7809 for (i
= gsi_start_bb (bb
); !gsi_end_p (i
); gsi_next (&i
))
7811 record
->size
[after_pass
]
7812 += estimate_num_insns (gsi_stmt (i
), &eni_size_weights
);
7813 if (profile_status
== PROFILE_READ
)
7814 record
->time
[after_pass
]
7815 += estimate_num_insns (gsi_stmt (i
),
7816 &eni_time_weights
) * bb
->count
;
7817 else if (profile_status
== PROFILE_GUESSED
)
7818 record
->time
[after_pass
]
7819 += estimate_num_insns (gsi_stmt (i
),
7820 &eni_time_weights
) * bb
->frequency
;
7824 struct cfg_hooks gimple_cfg_hooks
= {
7826 gimple_verify_flow_info
,
7827 gimple_dump_bb
, /* dump_bb */
7828 gimple_dump_bb_for_graph
, /* dump_bb_for_graph */
7829 create_bb
, /* create_basic_block */
7830 gimple_redirect_edge_and_branch
, /* redirect_edge_and_branch */
7831 gimple_redirect_edge_and_branch_force
, /* redirect_edge_and_branch_force */
7832 gimple_can_remove_branch_p
, /* can_remove_branch_p */
7833 remove_bb
, /* delete_basic_block */
7834 gimple_split_block
, /* split_block */
7835 gimple_move_block_after
, /* move_block_after */
7836 gimple_can_merge_blocks_p
, /* can_merge_blocks_p */
7837 gimple_merge_blocks
, /* merge_blocks */
7838 gimple_predict_edge
, /* predict_edge */
7839 gimple_predicted_by_p
, /* predicted_by_p */
7840 gimple_can_duplicate_bb_p
, /* can_duplicate_block_p */
7841 gimple_duplicate_bb
, /* duplicate_block */
7842 gimple_split_edge
, /* split_edge */
7843 gimple_make_forwarder_block
, /* make_forward_block */
7844 NULL
, /* tidy_fallthru_edge */
7845 NULL
, /* force_nonfallthru */
7846 gimple_block_ends_with_call_p
,/* block_ends_with_call_p */
7847 gimple_block_ends_with_condjump_p
, /* block_ends_with_condjump_p */
7848 gimple_flow_call_edges_add
, /* flow_call_edges_add */
7849 gimple_execute_on_growing_pred
, /* execute_on_growing_pred */
7850 gimple_execute_on_shrinking_pred
, /* execute_on_shrinking_pred */
7851 gimple_duplicate_loop_to_header_edge
, /* duplicate loop for trees */
7852 gimple_lv_add_condition_to_bb
, /* lv_add_condition_to_bb */
7853 gimple_lv_adjust_loop_header_phi
, /* lv_adjust_loop_header_phi*/
7854 extract_true_false_edges_from_block
, /* extract_cond_bb_edges */
7855 flush_pending_stmts
, /* flush_pending_stmts */
7856 gimple_empty_block_p
, /* block_empty_p */
7857 gimple_split_block_before_cond_jump
, /* split_block_before_cond_jump */
7858 gimple_account_profile_record
,
7862 /* Split all critical edges. */
7865 split_critical_edges (void)
7871 /* split_edge can redirect edges out of SWITCH_EXPRs, which can get
7872 expensive. So we want to enable recording of edge to CASE_LABEL_EXPR
7873 mappings around the calls to split_edge. */
7874 start_recording_case_labels ();
7877 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
7879 if (EDGE_CRITICAL_P (e
) && !(e
->flags
& EDGE_ABNORMAL
))
7881 /* PRE inserts statements to edges and expects that
7882 since split_critical_edges was done beforehand, committing edge
7883 insertions will not split more edges. In addition to critical
7884 edges we must split edges that have multiple successors and
7885 end by control flow statements, such as RESX.
7886 Go ahead and split them too. This matches the logic in
7887 gimple_find_edge_insert_loc. */
7888 else if ((!single_pred_p (e
->dest
)
7889 || !gimple_seq_empty_p (phi_nodes (e
->dest
))
7890 || e
->dest
== EXIT_BLOCK_PTR
)
7891 && e
->src
!= ENTRY_BLOCK_PTR
7892 && !(e
->flags
& EDGE_ABNORMAL
))
7894 gimple_stmt_iterator gsi
;
7896 gsi
= gsi_last_bb (e
->src
);
7897 if (!gsi_end_p (gsi
)
7898 && stmt_ends_bb_p (gsi_stmt (gsi
))
7899 && (gimple_code (gsi_stmt (gsi
)) != GIMPLE_RETURN
7900 && !gimple_call_builtin_p (gsi_stmt (gsi
),
7906 end_recording_case_labels ();
7912 const pass_data pass_data_split_crit_edges
=
7914 GIMPLE_PASS
, /* type */
7915 "crited", /* name */
7916 OPTGROUP_NONE
, /* optinfo_flags */
7917 false, /* has_gate */
7918 true, /* has_execute */
7919 TV_TREE_SPLIT_EDGES
, /* tv_id */
7920 PROP_cfg
, /* properties_required */
7921 PROP_no_crit_edges
, /* properties_provided */
7922 0, /* properties_destroyed */
7923 0, /* todo_flags_start */
7924 TODO_verify_flow
, /* todo_flags_finish */
7927 class pass_split_crit_edges
: public gimple_opt_pass
7930 pass_split_crit_edges (gcc::context
*ctxt
)
7931 : gimple_opt_pass (pass_data_split_crit_edges
, ctxt
)
7934 /* opt_pass methods: */
7935 unsigned int execute () { return split_critical_edges (); }
7937 opt_pass
* clone () { return new pass_split_crit_edges (m_ctxt
); }
7938 }; // class pass_split_crit_edges
7943 make_pass_split_crit_edges (gcc::context
*ctxt
)
7945 return new pass_split_crit_edges (ctxt
);
7949 /* Build a ternary operation and gimplify it. Emit code before GSI.
7950 Return the gimple_val holding the result. */
7953 gimplify_build3 (gimple_stmt_iterator
*gsi
, enum tree_code code
,
7954 tree type
, tree a
, tree b
, tree c
)
7957 location_t loc
= gimple_location (gsi_stmt (*gsi
));
7959 ret
= fold_build3_loc (loc
, code
, type
, a
, b
, c
);
7962 return force_gimple_operand_gsi (gsi
, ret
, true, NULL
, true,
7966 /* Build a binary operation and gimplify it. Emit code before GSI.
7967 Return the gimple_val holding the result. */
7970 gimplify_build2 (gimple_stmt_iterator
*gsi
, enum tree_code code
,
7971 tree type
, tree a
, tree b
)
7975 ret
= fold_build2_loc (gimple_location (gsi_stmt (*gsi
)), code
, type
, a
, b
);
7978 return force_gimple_operand_gsi (gsi
, ret
, true, NULL
, true,
7982 /* Build a unary operation and gimplify it. Emit code before GSI.
7983 Return the gimple_val holding the result. */
7986 gimplify_build1 (gimple_stmt_iterator
*gsi
, enum tree_code code
, tree type
,
7991 ret
= fold_build1_loc (gimple_location (gsi_stmt (*gsi
)), code
, type
, a
);
7994 return force_gimple_operand_gsi (gsi
, ret
, true, NULL
, true,
8000 /* Emit return warnings. */
8003 execute_warn_function_return (void)
8005 source_location location
;
8010 if (!targetm
.warn_func_return (cfun
->decl
))
8013 /* If we have a path to EXIT, then we do return. */
8014 if (TREE_THIS_VOLATILE (cfun
->decl
)
8015 && EDGE_COUNT (EXIT_BLOCK_PTR
->preds
) > 0)
8017 location
= UNKNOWN_LOCATION
;
8018 FOR_EACH_EDGE (e
, ei
, EXIT_BLOCK_PTR
->preds
)
8020 last
= last_stmt (e
->src
);
8021 if ((gimple_code (last
) == GIMPLE_RETURN
8022 || gimple_call_builtin_p (last
, BUILT_IN_RETURN
))
8023 && (location
= gimple_location (last
)) != UNKNOWN_LOCATION
)
8026 if (location
== UNKNOWN_LOCATION
)
8027 location
= cfun
->function_end_locus
;
8028 warning_at (location
, 0, "%<noreturn%> function does return");
8031 /* If we see "return;" in some basic block, then we do reach the end
8032 without returning a value. */
8033 else if (warn_return_type
8034 && !TREE_NO_WARNING (cfun
->decl
)
8035 && EDGE_COUNT (EXIT_BLOCK_PTR
->preds
) > 0
8036 && !VOID_TYPE_P (TREE_TYPE (TREE_TYPE (cfun
->decl
))))
8038 FOR_EACH_EDGE (e
, ei
, EXIT_BLOCK_PTR
->preds
)
8040 gimple last
= last_stmt (e
->src
);
8041 if (gimple_code (last
) == GIMPLE_RETURN
8042 && gimple_return_retval (last
) == NULL
8043 && !gimple_no_warning_p (last
))
8045 location
= gimple_location (last
);
8046 if (location
== UNKNOWN_LOCATION
)
8047 location
= cfun
->function_end_locus
;
8048 warning_at (location
, OPT_Wreturn_type
, "control reaches end of non-void function");
8049 TREE_NO_WARNING (cfun
->decl
) = 1;
8058 /* Given a basic block B which ends with a conditional and has
8059 precisely two successors, determine which of the edges is taken if
8060 the conditional is true and which is taken if the conditional is
8061 false. Set TRUE_EDGE and FALSE_EDGE appropriately. */
8064 extract_true_false_edges_from_block (basic_block b
,
8068 edge e
= EDGE_SUCC (b
, 0);
8070 if (e
->flags
& EDGE_TRUE_VALUE
)
8073 *false_edge
= EDGE_SUCC (b
, 1);
8078 *true_edge
= EDGE_SUCC (b
, 1);
8084 const pass_data pass_data_warn_function_return
=
8086 GIMPLE_PASS
, /* type */
8087 "*warn_function_return", /* name */
8088 OPTGROUP_NONE
, /* optinfo_flags */
8089 false, /* has_gate */
8090 true, /* has_execute */
8091 TV_NONE
, /* tv_id */
8092 PROP_cfg
, /* properties_required */
8093 0, /* properties_provided */
8094 0, /* properties_destroyed */
8095 0, /* todo_flags_start */
8096 0, /* todo_flags_finish */
8099 class pass_warn_function_return
: public gimple_opt_pass
8102 pass_warn_function_return (gcc::context
*ctxt
)
8103 : gimple_opt_pass (pass_data_warn_function_return
, ctxt
)
8106 /* opt_pass methods: */
8107 unsigned int execute () { return execute_warn_function_return (); }
8109 }; // class pass_warn_function_return
8114 make_pass_warn_function_return (gcc::context
*ctxt
)
8116 return new pass_warn_function_return (ctxt
);
8119 /* Walk a gimplified function and warn for functions whose return value is
8120 ignored and attribute((warn_unused_result)) is set. This is done before
8121 inlining, so we don't have to worry about that. */
8124 do_warn_unused_result (gimple_seq seq
)
8127 gimple_stmt_iterator i
;
8129 for (i
= gsi_start (seq
); !gsi_end_p (i
); gsi_next (&i
))
8131 gimple g
= gsi_stmt (i
);
8133 switch (gimple_code (g
))
8136 do_warn_unused_result (gimple_bind_body (g
));
8139 do_warn_unused_result (gimple_try_eval (g
));
8140 do_warn_unused_result (gimple_try_cleanup (g
));
8143 do_warn_unused_result (gimple_catch_handler (g
));
8145 case GIMPLE_EH_FILTER
:
8146 do_warn_unused_result (gimple_eh_filter_failure (g
));
8150 if (gimple_call_lhs (g
))
8152 if (gimple_call_internal_p (g
))
8155 /* This is a naked call, as opposed to a GIMPLE_CALL with an
8156 LHS. All calls whose value is ignored should be
8157 represented like this. Look for the attribute. */
8158 fdecl
= gimple_call_fndecl (g
);
8159 ftype
= gimple_call_fntype (g
);
8161 if (lookup_attribute ("warn_unused_result", TYPE_ATTRIBUTES (ftype
)))
8163 location_t loc
= gimple_location (g
);
8166 warning_at (loc
, OPT_Wunused_result
,
8167 "ignoring return value of %qD, "
8168 "declared with attribute warn_unused_result",
8171 warning_at (loc
, OPT_Wunused_result
,
8172 "ignoring return value of function "
8173 "declared with attribute warn_unused_result");
8178 /* Not a container, not a call, or a call whose value is used. */
8185 run_warn_unused_result (void)
8187 do_warn_unused_result (gimple_body (current_function_decl
));
8192 gate_warn_unused_result (void)
8194 return flag_warn_unused_result
;
8199 const pass_data pass_data_warn_unused_result
=
8201 GIMPLE_PASS
, /* type */
8202 "*warn_unused_result", /* name */
8203 OPTGROUP_NONE
, /* optinfo_flags */
8204 true, /* has_gate */
8205 true, /* has_execute */
8206 TV_NONE
, /* tv_id */
8207 PROP_gimple_any
, /* properties_required */
8208 0, /* properties_provided */
8209 0, /* properties_destroyed */
8210 0, /* todo_flags_start */
8211 0, /* todo_flags_finish */
8214 class pass_warn_unused_result
: public gimple_opt_pass
8217 pass_warn_unused_result (gcc::context
*ctxt
)
8218 : gimple_opt_pass (pass_data_warn_unused_result
, ctxt
)
8221 /* opt_pass methods: */
8222 bool gate () { return gate_warn_unused_result (); }
8223 unsigned int execute () { return run_warn_unused_result (); }
8225 }; // class pass_warn_unused_result
8230 make_pass_warn_unused_result (gcc::context
*ctxt
)
8232 return new pass_warn_unused_result (ctxt
);
8235 /* IPA passes, compilation of earlier functions or inlining
8236 might have changed some properties, such as marked functions nothrow,
8237 pure, const or noreturn.
8238 Remove redundant edges and basic blocks, and create new ones if necessary.
8240 This pass can't be executed as stand alone pass from pass manager, because
8241 in between inlining and this fixup the verify_flow_info would fail. */
8244 execute_fixup_cfg (void)
8247 gimple_stmt_iterator gsi
;
8248 int todo
= gimple_in_ssa_p (cfun
) ? TODO_verify_ssa
: 0;
8249 gcov_type count_scale
;
8254 = GCOV_COMPUTE_SCALE (cgraph_get_node (current_function_decl
)->count
,
8255 ENTRY_BLOCK_PTR
->count
);
8257 ENTRY_BLOCK_PTR
->count
= cgraph_get_node (current_function_decl
)->count
;
8258 EXIT_BLOCK_PTR
->count
= apply_scale (EXIT_BLOCK_PTR
->count
,
8261 FOR_EACH_EDGE (e
, ei
, ENTRY_BLOCK_PTR
->succs
)
8262 e
->count
= apply_scale (e
->count
, count_scale
);
8266 bb
->count
= apply_scale (bb
->count
, count_scale
);
8267 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
8269 gimple stmt
= gsi_stmt (gsi
);
8270 tree decl
= is_gimple_call (stmt
)
8271 ? gimple_call_fndecl (stmt
)
8275 int flags
= gimple_call_flags (stmt
);
8276 if (flags
& (ECF_CONST
| ECF_PURE
| ECF_LOOPING_CONST_OR_PURE
))
8278 if (gimple_purge_dead_abnormal_call_edges (bb
))
8279 todo
|= TODO_cleanup_cfg
;
8281 if (gimple_in_ssa_p (cfun
))
8283 todo
|= TODO_update_ssa
| TODO_cleanup_cfg
;
8288 if (flags
& ECF_NORETURN
8289 && fixup_noreturn_call (stmt
))
8290 todo
|= TODO_cleanup_cfg
;
8293 if (maybe_clean_eh_stmt (stmt
)
8294 && gimple_purge_dead_eh_edges (bb
))
8295 todo
|= TODO_cleanup_cfg
;
8298 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
8299 e
->count
= apply_scale (e
->count
, count_scale
);
8301 /* If we have a basic block with no successors that does not
8302 end with a control statement or a noreturn call end it with
8303 a call to __builtin_unreachable. This situation can occur
8304 when inlining a noreturn call that does in fact return. */
8305 if (EDGE_COUNT (bb
->succs
) == 0)
8307 gimple stmt
= last_stmt (bb
);
8309 || (!is_ctrl_stmt (stmt
)
8310 && (!is_gimple_call (stmt
)
8311 || (gimple_call_flags (stmt
) & ECF_NORETURN
) == 0)))
8313 stmt
= gimple_build_call
8314 (builtin_decl_implicit (BUILT_IN_UNREACHABLE
), 0);
8315 gimple_stmt_iterator gsi
= gsi_last_bb (bb
);
8316 gsi_insert_after (&gsi
, stmt
, GSI_NEW_STMT
);
8320 if (count_scale
!= REG_BR_PROB_BASE
)
8321 compute_function_frequency ();
8323 /* We just processed all calls. */
8324 if (cfun
->gimple_df
)
8325 vec_free (MODIFIED_NORETURN_CALLS (cfun
));
8327 /* Dump a textual representation of the flowgraph. */
8329 gimple_dump_cfg (dump_file
, dump_flags
);
8332 && (todo
& TODO_cleanup_cfg
))
8333 loops_state_set (LOOPS_NEED_FIXUP
);
8340 const pass_data pass_data_fixup_cfg
=
8342 GIMPLE_PASS
, /* type */
8343 "*free_cfg_annotations", /* name */
8344 OPTGROUP_NONE
, /* optinfo_flags */
8345 false, /* has_gate */
8346 true, /* has_execute */
8347 TV_NONE
, /* tv_id */
8348 PROP_cfg
, /* properties_required */
8349 0, /* properties_provided */
8350 0, /* properties_destroyed */
8351 0, /* todo_flags_start */
8352 0, /* todo_flags_finish */
8355 class pass_fixup_cfg
: public gimple_opt_pass
8358 pass_fixup_cfg (gcc::context
*ctxt
)
8359 : gimple_opt_pass (pass_data_fixup_cfg
, ctxt
)
8362 /* opt_pass methods: */
8363 opt_pass
* clone () { return new pass_fixup_cfg (m_ctxt
); }
8364 unsigned int execute () { return execute_fixup_cfg (); }
8366 }; // class pass_fixup_cfg
8371 make_pass_fixup_cfg (gcc::context
*ctxt
)
8373 return new pass_fixup_cfg (ctxt
);
8376 /* Garbage collection support for edge_def. */
8378 extern void gt_ggc_mx (tree
&);
8379 extern void gt_ggc_mx (gimple
&);
8380 extern void gt_ggc_mx (rtx
&);
8381 extern void gt_ggc_mx (basic_block
&);
8384 gt_ggc_mx (edge_def
*e
)
8386 tree block
= LOCATION_BLOCK (e
->goto_locus
);
8388 gt_ggc_mx (e
->dest
);
8389 if (current_ir_type () == IR_GIMPLE
)
8390 gt_ggc_mx (e
->insns
.g
);
8392 gt_ggc_mx (e
->insns
.r
);
8396 /* PCH support for edge_def. */
8398 extern void gt_pch_nx (tree
&);
8399 extern void gt_pch_nx (gimple
&);
8400 extern void gt_pch_nx (rtx
&);
8401 extern void gt_pch_nx (basic_block
&);
8404 gt_pch_nx (edge_def
*e
)
8406 tree block
= LOCATION_BLOCK (e
->goto_locus
);
8408 gt_pch_nx (e
->dest
);
8409 if (current_ir_type () == IR_GIMPLE
)
8410 gt_pch_nx (e
->insns
.g
);
8412 gt_pch_nx (e
->insns
.r
);
8417 gt_pch_nx (edge_def
*e
, gt_pointer_operator op
, void *cookie
)
8419 tree block
= LOCATION_BLOCK (e
->goto_locus
);
8420 op (&(e
->src
), cookie
);
8421 op (&(e
->dest
), cookie
);
8422 if (current_ir_type () == IR_GIMPLE
)
8423 op (&(e
->insns
.g
), cookie
);
8425 op (&(e
->insns
.r
), cookie
);
8426 op (&(block
), cookie
);