1 /* Control flow functions for trees.
2 Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009
3 Free Software Foundation, Inc.
4 Contributed by Diego Novillo <dnovillo@redhat.com>
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 3, or (at your option)
13 GCC is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
24 #include "coretypes.h"
29 #include "hard-reg-set.h"
30 #include "basic-block.h"
36 #include "langhooks.h"
37 #include "diagnostic.h"
38 #include "tree-flow.h"
40 #include "tree-dump.h"
41 #include "tree-pass.h"
45 #include "cfglayout.h"
46 #include "tree-ssa-propagate.h"
47 #include "value-prof.h"
48 #include "pointer-set.h"
49 #include "tree-inline.h"
51 /* This file contains functions for building the Control Flow Graph (CFG)
52 for a function tree. */
54 /* Local declarations. */
56 /* Initial capacity for the basic block array. */
57 static const int initial_cfg_capacity
= 20;
59 /* This hash table allows us to efficiently lookup all CASE_LABEL_EXPRs
60 which use a particular edge. The CASE_LABEL_EXPRs are chained together
61 via their TREE_CHAIN field, which we clear after we're done with the
62 hash table to prevent problems with duplication of GIMPLE_SWITCHes.
64 Access to this list of CASE_LABEL_EXPRs allows us to efficiently
65 update the case vector in response to edge redirections.
67 Right now this table is set up and torn down at key points in the
68 compilation process. It would be nice if we could make the table
69 more persistent. The key is getting notification of changes to
70 the CFG (particularly edge removal, creation and redirection). */
72 static struct pointer_map_t
*edge_to_cases
;
77 long num_merged_labels
;
80 static struct cfg_stats_d cfg_stats
;
82 /* Nonzero if we found a computed goto while building basic blocks. */
83 static bool found_computed_goto
;
85 /* Hash table to store last discriminator assigned for each locus. */
86 struct locus_discrim_map
91 static htab_t discriminator_per_locus
;
93 /* Basic blocks and flowgraphs. */
94 static void make_blocks (gimple_seq
);
95 static void factor_computed_gotos (void);
98 static void make_edges (void);
99 static void make_cond_expr_edges (basic_block
);
100 static void make_gimple_switch_edges (basic_block
);
101 static void make_goto_expr_edges (basic_block
);
102 static unsigned int locus_map_hash (const void *);
103 static int locus_map_eq (const void *, const void *);
104 static void assign_discriminator (location_t
, basic_block
);
105 static edge
gimple_redirect_edge_and_branch (edge
, basic_block
);
106 static edge
gimple_try_redirect_by_replacing_jump (edge
, basic_block
);
107 static unsigned int split_critical_edges (void);
109 /* Various helpers. */
110 static inline bool stmt_starts_bb_p (gimple
, gimple
);
111 static int gimple_verify_flow_info (void);
112 static void gimple_make_forwarder_block (edge
);
113 static void gimple_cfg2vcg (FILE *);
114 static gimple
first_non_label_stmt (basic_block
);
116 /* Flowgraph optimization and cleanup. */
117 static void gimple_merge_blocks (basic_block
, basic_block
);
118 static bool gimple_can_merge_blocks_p (basic_block
, basic_block
);
119 static void remove_bb (basic_block
);
120 static edge
find_taken_edge_computed_goto (basic_block
, tree
);
121 static edge
find_taken_edge_cond_expr (basic_block
, tree
);
122 static edge
find_taken_edge_switch_expr (basic_block
, tree
);
123 static tree
find_case_label_for_value (gimple
, tree
);
126 init_empty_tree_cfg_for_function (struct function
*fn
)
128 /* Initialize the basic block array. */
130 profile_status_for_function (fn
) = PROFILE_ABSENT
;
131 n_basic_blocks_for_function (fn
) = NUM_FIXED_BLOCKS
;
132 last_basic_block_for_function (fn
) = NUM_FIXED_BLOCKS
;
133 basic_block_info_for_function (fn
)
134 = VEC_alloc (basic_block
, gc
, initial_cfg_capacity
);
135 VEC_safe_grow_cleared (basic_block
, gc
,
136 basic_block_info_for_function (fn
),
137 initial_cfg_capacity
);
139 /* Build a mapping of labels to their associated blocks. */
140 label_to_block_map_for_function (fn
)
141 = VEC_alloc (basic_block
, gc
, initial_cfg_capacity
);
142 VEC_safe_grow_cleared (basic_block
, gc
,
143 label_to_block_map_for_function (fn
),
144 initial_cfg_capacity
);
146 SET_BASIC_BLOCK_FOR_FUNCTION (fn
, ENTRY_BLOCK
,
147 ENTRY_BLOCK_PTR_FOR_FUNCTION (fn
));
148 SET_BASIC_BLOCK_FOR_FUNCTION (fn
, EXIT_BLOCK
,
149 EXIT_BLOCK_PTR_FOR_FUNCTION (fn
));
151 ENTRY_BLOCK_PTR_FOR_FUNCTION (fn
)->next_bb
152 = EXIT_BLOCK_PTR_FOR_FUNCTION (fn
);
153 EXIT_BLOCK_PTR_FOR_FUNCTION (fn
)->prev_bb
154 = ENTRY_BLOCK_PTR_FOR_FUNCTION (fn
);
158 init_empty_tree_cfg (void)
160 init_empty_tree_cfg_for_function (cfun
);
163 /*---------------------------------------------------------------------------
165 ---------------------------------------------------------------------------*/
167 /* Entry point to the CFG builder for trees. SEQ is the sequence of
168 statements to be added to the flowgraph. */
171 build_gimple_cfg (gimple_seq seq
)
173 /* Register specific gimple functions. */
174 gimple_register_cfg_hooks ();
176 memset ((void *) &cfg_stats
, 0, sizeof (cfg_stats
));
178 init_empty_tree_cfg ();
180 found_computed_goto
= 0;
183 /* Computed gotos are hell to deal with, especially if there are
184 lots of them with a large number of destinations. So we factor
185 them to a common computed goto location before we build the
186 edge list. After we convert back to normal form, we will un-factor
187 the computed gotos since factoring introduces an unwanted jump. */
188 if (found_computed_goto
)
189 factor_computed_gotos ();
191 /* Make sure there is always at least one block, even if it's empty. */
192 if (n_basic_blocks
== NUM_FIXED_BLOCKS
)
193 create_empty_bb (ENTRY_BLOCK_PTR
);
195 /* Adjust the size of the array. */
196 if (VEC_length (basic_block
, basic_block_info
) < (size_t) n_basic_blocks
)
197 VEC_safe_grow_cleared (basic_block
, gc
, basic_block_info
, n_basic_blocks
);
199 /* To speed up statement iterator walks, we first purge dead labels. */
200 cleanup_dead_labels ();
202 /* Group case nodes to reduce the number of edges.
203 We do this after cleaning up dead labels because otherwise we miss
204 a lot of obvious case merging opportunities. */
205 group_case_labels ();
207 /* Create the edges of the flowgraph. */
208 discriminator_per_locus
= htab_create (13, locus_map_hash
, locus_map_eq
,
211 cleanup_dead_labels ();
212 htab_delete (discriminator_per_locus
);
214 /* Debugging dumps. */
216 /* Write the flowgraph to a VCG file. */
218 int local_dump_flags
;
219 FILE *vcg_file
= dump_begin (TDI_vcg
, &local_dump_flags
);
222 gimple_cfg2vcg (vcg_file
);
223 dump_end (TDI_vcg
, vcg_file
);
227 #ifdef ENABLE_CHECKING
233 execute_build_cfg (void)
235 gimple_seq body
= gimple_body (current_function_decl
);
237 build_gimple_cfg (body
);
238 gimple_set_body (current_function_decl
, NULL
);
239 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
241 fprintf (dump_file
, "Scope blocks:\n");
242 dump_scope_blocks (dump_file
, dump_flags
);
247 struct gimple_opt_pass pass_build_cfg
=
253 execute_build_cfg
, /* execute */
256 0, /* static_pass_number */
257 TV_TREE_CFG
, /* tv_id */
258 PROP_gimple_leh
, /* properties_required */
259 PROP_cfg
, /* properties_provided */
260 0, /* properties_destroyed */
261 0, /* todo_flags_start */
262 TODO_verify_stmts
| TODO_cleanup_cfg
263 | TODO_dump_func
/* todo_flags_finish */
268 /* Return true if T is a computed goto. */
271 computed_goto_p (gimple t
)
273 return (gimple_code (t
) == GIMPLE_GOTO
274 && TREE_CODE (gimple_goto_dest (t
)) != LABEL_DECL
);
278 /* Search the CFG for any computed gotos. If found, factor them to a
279 common computed goto site. Also record the location of that site so
280 that we can un-factor the gotos after we have converted back to
284 factor_computed_gotos (void)
287 tree factored_label_decl
= NULL
;
289 gimple factored_computed_goto_label
= NULL
;
290 gimple factored_computed_goto
= NULL
;
292 /* We know there are one or more computed gotos in this function.
293 Examine the last statement in each basic block to see if the block
294 ends with a computed goto. */
298 gimple_stmt_iterator gsi
= gsi_last_bb (bb
);
304 last
= gsi_stmt (gsi
);
306 /* Ignore the computed goto we create when we factor the original
308 if (last
== factored_computed_goto
)
311 /* If the last statement is a computed goto, factor it. */
312 if (computed_goto_p (last
))
316 /* The first time we find a computed goto we need to create
317 the factored goto block and the variable each original
318 computed goto will use for their goto destination. */
319 if (!factored_computed_goto
)
321 basic_block new_bb
= create_empty_bb (bb
);
322 gimple_stmt_iterator new_gsi
= gsi_start_bb (new_bb
);
324 /* Create the destination of the factored goto. Each original
325 computed goto will put its desired destination into this
326 variable and jump to the label we create immediately
328 var
= create_tmp_var (ptr_type_node
, "gotovar");
330 /* Build a label for the new block which will contain the
331 factored computed goto. */
332 factored_label_decl
= create_artificial_label (UNKNOWN_LOCATION
);
333 factored_computed_goto_label
334 = gimple_build_label (factored_label_decl
);
335 gsi_insert_after (&new_gsi
, factored_computed_goto_label
,
338 /* Build our new computed goto. */
339 factored_computed_goto
= gimple_build_goto (var
);
340 gsi_insert_after (&new_gsi
, factored_computed_goto
, GSI_NEW_STMT
);
343 /* Copy the original computed goto's destination into VAR. */
344 assignment
= gimple_build_assign (var
, gimple_goto_dest (last
));
345 gsi_insert_before (&gsi
, assignment
, GSI_SAME_STMT
);
347 /* And re-vector the computed goto to the new destination. */
348 gimple_goto_set_dest (last
, factored_label_decl
);
354 /* Build a flowgraph for the sequence of stmts SEQ. */
357 make_blocks (gimple_seq seq
)
359 gimple_stmt_iterator i
= gsi_start (seq
);
361 bool start_new_block
= true;
362 bool first_stmt_of_seq
= true;
363 basic_block bb
= ENTRY_BLOCK_PTR
;
365 while (!gsi_end_p (i
))
372 /* If the statement starts a new basic block or if we have determined
373 in a previous pass that we need to create a new block for STMT, do
375 if (start_new_block
|| stmt_starts_bb_p (stmt
, prev_stmt
))
377 if (!first_stmt_of_seq
)
378 seq
= gsi_split_seq_before (&i
);
379 bb
= create_basic_block (seq
, NULL
, bb
);
380 start_new_block
= false;
383 /* Now add STMT to BB and create the subgraphs for special statement
385 gimple_set_bb (stmt
, bb
);
387 if (computed_goto_p (stmt
))
388 found_computed_goto
= true;
390 /* If STMT is a basic block terminator, set START_NEW_BLOCK for the
392 if (stmt_ends_bb_p (stmt
))
394 /* If the stmt can make abnormal goto use a new temporary
395 for the assignment to the LHS. This makes sure the old value
396 of the LHS is available on the abnormal edge. Otherwise
397 we will end up with overlapping life-ranges for abnormal
399 if (gimple_has_lhs (stmt
)
400 && stmt_can_make_abnormal_goto (stmt
)
401 && is_gimple_reg_type (TREE_TYPE (gimple_get_lhs (stmt
))))
403 tree lhs
= gimple_get_lhs (stmt
);
404 tree tmp
= create_tmp_var (TREE_TYPE (lhs
), NULL
);
405 gimple s
= gimple_build_assign (lhs
, tmp
);
406 gimple_set_location (s
, gimple_location (stmt
));
407 gimple_set_block (s
, gimple_block (stmt
));
408 gimple_set_lhs (stmt
, tmp
);
409 if (TREE_CODE (TREE_TYPE (tmp
)) == COMPLEX_TYPE
410 || TREE_CODE (TREE_TYPE (tmp
)) == VECTOR_TYPE
)
411 DECL_GIMPLE_REG_P (tmp
) = 1;
412 gsi_insert_after (&i
, s
, GSI_SAME_STMT
);
414 start_new_block
= true;
418 first_stmt_of_seq
= false;
423 /* Create and return a new empty basic block after bb AFTER. */
426 create_bb (void *h
, void *e
, basic_block after
)
432 /* Create and initialize a new basic block. Since alloc_block uses
433 ggc_alloc_cleared to allocate a basic block, we do not have to
434 clear the newly allocated basic block here. */
437 bb
->index
= last_basic_block
;
439 bb
->il
.gimple
= GGC_CNEW (struct gimple_bb_info
);
440 set_bb_seq (bb
, h
? (gimple_seq
) h
: gimple_seq_alloc ());
442 /* Add the new block to the linked list of blocks. */
443 link_block (bb
, after
);
445 /* Grow the basic block array if needed. */
446 if ((size_t) last_basic_block
== VEC_length (basic_block
, basic_block_info
))
448 size_t new_size
= last_basic_block
+ (last_basic_block
+ 3) / 4;
449 VEC_safe_grow_cleared (basic_block
, gc
, basic_block_info
, new_size
);
452 /* Add the newly created block to the array. */
453 SET_BASIC_BLOCK (last_basic_block
, bb
);
462 /*---------------------------------------------------------------------------
464 ---------------------------------------------------------------------------*/
466 /* Fold COND_EXPR_COND of each COND_EXPR. */
469 fold_cond_expr_cond (void)
475 gimple stmt
= last_stmt (bb
);
477 if (stmt
&& gimple_code (stmt
) == GIMPLE_COND
)
479 location_t loc
= gimple_location (stmt
);
483 fold_defer_overflow_warnings ();
484 cond
= fold_binary_loc (loc
, gimple_cond_code (stmt
), boolean_type_node
,
485 gimple_cond_lhs (stmt
), gimple_cond_rhs (stmt
));
488 zerop
= integer_zerop (cond
);
489 onep
= integer_onep (cond
);
492 zerop
= onep
= false;
494 fold_undefer_overflow_warnings (zerop
|| onep
,
496 WARN_STRICT_OVERFLOW_CONDITIONAL
);
498 gimple_cond_make_false (stmt
);
500 gimple_cond_make_true (stmt
);
505 /* Join all the blocks in the flowgraph. */
511 struct omp_region
*cur_region
= NULL
;
513 /* Create an edge from entry to the first block with executable
515 make_edge (ENTRY_BLOCK_PTR
, BASIC_BLOCK (NUM_FIXED_BLOCKS
), EDGE_FALLTHRU
);
517 /* Traverse the basic block array placing edges. */
520 gimple last
= last_stmt (bb
);
525 enum gimple_code code
= gimple_code (last
);
529 make_goto_expr_edges (bb
);
533 make_edge (bb
, EXIT_BLOCK_PTR
, 0);
537 make_cond_expr_edges (bb
);
541 make_gimple_switch_edges (bb
);
545 make_eh_edges (last
);
548 case GIMPLE_EH_DISPATCH
:
549 fallthru
= make_eh_dispatch_edges (last
);
553 /* If this function receives a nonlocal goto, then we need to
554 make edges from this call site to all the nonlocal goto
556 if (stmt_can_make_abnormal_goto (last
))
557 make_abnormal_goto_edges (bb
, true);
559 /* If this statement has reachable exception handlers, then
560 create abnormal edges to them. */
561 make_eh_edges (last
);
563 /* Some calls are known not to return. */
564 fallthru
= !(gimple_call_flags (last
) & ECF_NORETURN
);
568 /* A GIMPLE_ASSIGN may throw internally and thus be considered
570 if (is_ctrl_altering_stmt (last
))
571 make_eh_edges (last
);
575 case GIMPLE_OMP_PARALLEL
:
576 case GIMPLE_OMP_TASK
:
578 case GIMPLE_OMP_SINGLE
:
579 case GIMPLE_OMP_MASTER
:
580 case GIMPLE_OMP_ORDERED
:
581 case GIMPLE_OMP_CRITICAL
:
582 case GIMPLE_OMP_SECTION
:
583 cur_region
= new_omp_region (bb
, code
, cur_region
);
587 case GIMPLE_OMP_SECTIONS
:
588 cur_region
= new_omp_region (bb
, code
, cur_region
);
592 case GIMPLE_OMP_SECTIONS_SWITCH
:
597 case GIMPLE_OMP_ATOMIC_LOAD
:
598 case GIMPLE_OMP_ATOMIC_STORE
:
603 case GIMPLE_OMP_RETURN
:
604 /* In the case of a GIMPLE_OMP_SECTION, the edge will go
605 somewhere other than the next block. This will be
607 cur_region
->exit
= bb
;
608 fallthru
= cur_region
->type
!= GIMPLE_OMP_SECTION
;
609 cur_region
= cur_region
->outer
;
612 case GIMPLE_OMP_CONTINUE
:
613 cur_region
->cont
= bb
;
614 switch (cur_region
->type
)
617 /* Mark all GIMPLE_OMP_FOR and GIMPLE_OMP_CONTINUE
618 succs edges as abnormal to prevent splitting
620 single_succ_edge (cur_region
->entry
)->flags
|= EDGE_ABNORMAL
;
621 /* Make the loopback edge. */
622 make_edge (bb
, single_succ (cur_region
->entry
),
625 /* Create an edge from GIMPLE_OMP_FOR to exit, which
626 corresponds to the case that the body of the loop
627 is not executed at all. */
628 make_edge (cur_region
->entry
, bb
->next_bb
, EDGE_ABNORMAL
);
629 make_edge (bb
, bb
->next_bb
, EDGE_FALLTHRU
| EDGE_ABNORMAL
);
633 case GIMPLE_OMP_SECTIONS
:
634 /* Wire up the edges into and out of the nested sections. */
636 basic_block switch_bb
= single_succ (cur_region
->entry
);
638 struct omp_region
*i
;
639 for (i
= cur_region
->inner
; i
; i
= i
->next
)
641 gcc_assert (i
->type
== GIMPLE_OMP_SECTION
);
642 make_edge (switch_bb
, i
->entry
, 0);
643 make_edge (i
->exit
, bb
, EDGE_FALLTHRU
);
646 /* Make the loopback edge to the block with
647 GIMPLE_OMP_SECTIONS_SWITCH. */
648 make_edge (bb
, switch_bb
, 0);
650 /* Make the edge from the switch to exit. */
651 make_edge (switch_bb
, bb
->next_bb
, 0);
662 gcc_assert (!stmt_ends_bb_p (last
));
671 make_edge (bb
, bb
->next_bb
, EDGE_FALLTHRU
);
673 assign_discriminator (gimple_location (last
), bb
->next_bb
);
680 /* Fold COND_EXPR_COND of each COND_EXPR. */
681 fold_cond_expr_cond ();
684 /* Trivial hash function for a location_t. ITEM is a pointer to
685 a hash table entry that maps a location_t to a discriminator. */
688 locus_map_hash (const void *item
)
690 return ((const struct locus_discrim_map
*) item
)->locus
;
693 /* Equality function for the locus-to-discriminator map. VA and VB
694 point to the two hash table entries to compare. */
697 locus_map_eq (const void *va
, const void *vb
)
699 const struct locus_discrim_map
*a
= (const struct locus_discrim_map
*) va
;
700 const struct locus_discrim_map
*b
= (const struct locus_discrim_map
*) vb
;
701 return a
->locus
== b
->locus
;
704 /* Find the next available discriminator value for LOCUS. The
705 discriminator distinguishes among several basic blocks that
706 share a common locus, allowing for more accurate sample-based
710 next_discriminator_for_locus (location_t locus
)
712 struct locus_discrim_map item
;
713 struct locus_discrim_map
**slot
;
716 item
.discriminator
= 0;
717 slot
= (struct locus_discrim_map
**)
718 htab_find_slot_with_hash (discriminator_per_locus
, (void *) &item
,
719 (hashval_t
) locus
, INSERT
);
721 if (*slot
== HTAB_EMPTY_ENTRY
)
723 *slot
= XNEW (struct locus_discrim_map
);
725 (*slot
)->locus
= locus
;
726 (*slot
)->discriminator
= 0;
728 (*slot
)->discriminator
++;
729 return (*slot
)->discriminator
;
732 /* Return TRUE if LOCUS1 and LOCUS2 refer to the same source line. */
735 same_line_p (location_t locus1
, location_t locus2
)
737 expanded_location from
, to
;
739 if (locus1
== locus2
)
742 from
= expand_location (locus1
);
743 to
= expand_location (locus2
);
745 if (from
.line
!= to
.line
)
747 if (from
.file
== to
.file
)
749 return (from
.file
!= NULL
751 && strcmp (from
.file
, to
.file
) == 0);
754 /* Assign a unique discriminator value to block BB if it begins at the same
755 LOCUS as its predecessor block. */
758 assign_discriminator (location_t locus
, basic_block bb
)
760 gimple first_in_to_bb
, last_in_to_bb
;
762 if (locus
== 0 || bb
->discriminator
!= 0)
765 first_in_to_bb
= first_non_label_stmt (bb
);
766 last_in_to_bb
= last_stmt (bb
);
767 if ((first_in_to_bb
&& same_line_p (locus
, gimple_location (first_in_to_bb
)))
768 || (last_in_to_bb
&& same_line_p (locus
, gimple_location (last_in_to_bb
))))
769 bb
->discriminator
= next_discriminator_for_locus (locus
);
772 /* Create the edges for a GIMPLE_COND starting at block BB. */
775 make_cond_expr_edges (basic_block bb
)
777 gimple entry
= last_stmt (bb
);
778 gimple then_stmt
, else_stmt
;
779 basic_block then_bb
, else_bb
;
780 tree then_label
, else_label
;
782 location_t entry_locus
;
785 gcc_assert (gimple_code (entry
) == GIMPLE_COND
);
787 entry_locus
= gimple_location (entry
);
789 /* Entry basic blocks for each component. */
790 then_label
= gimple_cond_true_label (entry
);
791 else_label
= gimple_cond_false_label (entry
);
792 then_bb
= label_to_block (then_label
);
793 else_bb
= label_to_block (else_label
);
794 then_stmt
= first_stmt (then_bb
);
795 else_stmt
= first_stmt (else_bb
);
797 e
= make_edge (bb
, then_bb
, EDGE_TRUE_VALUE
);
798 assign_discriminator (entry_locus
, then_bb
);
799 e
->goto_locus
= gimple_location (then_stmt
);
801 e
->goto_block
= gimple_block (then_stmt
);
802 e
= make_edge (bb
, else_bb
, EDGE_FALSE_VALUE
);
805 assign_discriminator (entry_locus
, else_bb
);
806 e
->goto_locus
= gimple_location (else_stmt
);
808 e
->goto_block
= gimple_block (else_stmt
);
811 /* We do not need the labels anymore. */
812 gimple_cond_set_true_label (entry
, NULL_TREE
);
813 gimple_cond_set_false_label (entry
, NULL_TREE
);
817 /* Called for each element in the hash table (P) as we delete the
818 edge to cases hash table.
820 Clear all the TREE_CHAINs to prevent problems with copying of
821 SWITCH_EXPRs and structure sharing rules, then free the hash table
825 edge_to_cases_cleanup (const void *key ATTRIBUTE_UNUSED
, void **value
,
826 void *data ATTRIBUTE_UNUSED
)
830 for (t
= (tree
) *value
; t
; t
= next
)
832 next
= TREE_CHAIN (t
);
833 TREE_CHAIN (t
) = NULL
;
840 /* Start recording information mapping edges to case labels. */
843 start_recording_case_labels (void)
845 gcc_assert (edge_to_cases
== NULL
);
846 edge_to_cases
= pointer_map_create ();
849 /* Return nonzero if we are recording information for case labels. */
852 recording_case_labels_p (void)
854 return (edge_to_cases
!= NULL
);
857 /* Stop recording information mapping edges to case labels and
858 remove any information we have recorded. */
860 end_recording_case_labels (void)
862 pointer_map_traverse (edge_to_cases
, edge_to_cases_cleanup
, NULL
);
863 pointer_map_destroy (edge_to_cases
);
864 edge_to_cases
= NULL
;
867 /* If we are inside a {start,end}_recording_cases block, then return
868 a chain of CASE_LABEL_EXPRs from T which reference E.
870 Otherwise return NULL. */
873 get_cases_for_edge (edge e
, gimple t
)
878 /* If we are not recording cases, then we do not have CASE_LABEL_EXPR
879 chains available. Return NULL so the caller can detect this case. */
880 if (!recording_case_labels_p ())
883 slot
= pointer_map_contains (edge_to_cases
, e
);
887 /* If we did not find E in the hash table, then this must be the first
888 time we have been queried for information about E & T. Add all the
889 elements from T to the hash table then perform the query again. */
891 n
= gimple_switch_num_labels (t
);
892 for (i
= 0; i
< n
; i
++)
894 tree elt
= gimple_switch_label (t
, i
);
895 tree lab
= CASE_LABEL (elt
);
896 basic_block label_bb
= label_to_block (lab
);
897 edge this_edge
= find_edge (e
->src
, label_bb
);
899 /* Add it to the chain of CASE_LABEL_EXPRs referencing E, or create
901 slot
= pointer_map_insert (edge_to_cases
, this_edge
);
902 TREE_CHAIN (elt
) = (tree
) *slot
;
906 return (tree
) *pointer_map_contains (edge_to_cases
, e
);
909 /* Create the edges for a GIMPLE_SWITCH starting at block BB. */
912 make_gimple_switch_edges (basic_block bb
)
914 gimple entry
= last_stmt (bb
);
915 location_t entry_locus
;
918 entry_locus
= gimple_location (entry
);
920 n
= gimple_switch_num_labels (entry
);
922 for (i
= 0; i
< n
; ++i
)
924 tree lab
= CASE_LABEL (gimple_switch_label (entry
, i
));
925 basic_block label_bb
= label_to_block (lab
);
926 make_edge (bb
, label_bb
, 0);
927 assign_discriminator (entry_locus
, label_bb
);
932 /* Return the basic block holding label DEST. */
935 label_to_block_fn (struct function
*ifun
, tree dest
)
937 int uid
= LABEL_DECL_UID (dest
);
939 /* We would die hard when faced by an undefined label. Emit a label to
940 the very first basic block. This will hopefully make even the dataflow
941 and undefined variable warnings quite right. */
942 if ((errorcount
|| sorrycount
) && uid
< 0)
944 gimple_stmt_iterator gsi
= gsi_start_bb (BASIC_BLOCK (NUM_FIXED_BLOCKS
));
947 stmt
= gimple_build_label (dest
);
948 gsi_insert_before (&gsi
, stmt
, GSI_NEW_STMT
);
949 uid
= LABEL_DECL_UID (dest
);
951 if (VEC_length (basic_block
, ifun
->cfg
->x_label_to_block_map
)
952 <= (unsigned int) uid
)
954 return VEC_index (basic_block
, ifun
->cfg
->x_label_to_block_map
, uid
);
957 /* Create edges for an abnormal goto statement at block BB. If FOR_CALL
958 is true, the source statement is a CALL_EXPR instead of a GOTO_EXPR. */
961 make_abnormal_goto_edges (basic_block bb
, bool for_call
)
963 basic_block target_bb
;
964 gimple_stmt_iterator gsi
;
966 FOR_EACH_BB (target_bb
)
967 for (gsi
= gsi_start_bb (target_bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
969 gimple label_stmt
= gsi_stmt (gsi
);
972 if (gimple_code (label_stmt
) != GIMPLE_LABEL
)
975 target
= gimple_label_label (label_stmt
);
977 /* Make an edge to every label block that has been marked as a
978 potential target for a computed goto or a non-local goto. */
979 if ((FORCED_LABEL (target
) && !for_call
)
980 || (DECL_NONLOCAL (target
) && for_call
))
982 make_edge (bb
, target_bb
, EDGE_ABNORMAL
);
988 /* Create edges for a goto statement at block BB. */
991 make_goto_expr_edges (basic_block bb
)
993 gimple_stmt_iterator last
= gsi_last_bb (bb
);
994 gimple goto_t
= gsi_stmt (last
);
996 /* A simple GOTO creates normal edges. */
997 if (simple_goto_p (goto_t
))
999 tree dest
= gimple_goto_dest (goto_t
);
1000 basic_block label_bb
= label_to_block (dest
);
1001 edge e
= make_edge (bb
, label_bb
, EDGE_FALLTHRU
);
1002 e
->goto_locus
= gimple_location (goto_t
);
1003 assign_discriminator (e
->goto_locus
, label_bb
);
1005 e
->goto_block
= gimple_block (goto_t
);
1006 gsi_remove (&last
, true);
1010 /* A computed GOTO creates abnormal edges. */
1011 make_abnormal_goto_edges (bb
, false);
1015 /*---------------------------------------------------------------------------
1017 ---------------------------------------------------------------------------*/
1019 /* Cleanup useless labels in basic blocks. This is something we wish
1020 to do early because it allows us to group case labels before creating
1021 the edges for the CFG, and it speeds up block statement iterators in
1022 all passes later on.
1023 We rerun this pass after CFG is created, to get rid of the labels that
1024 are no longer referenced. After then we do not run it any more, since
1025 (almost) no new labels should be created. */
1027 /* A map from basic block index to the leading label of that block. */
1028 static struct label_record
1033 /* True if the label is referenced from somewhere. */
1037 /* Given LABEL return the first label in the same basic block. */
1040 main_block_label (tree label
)
1042 basic_block bb
= label_to_block (label
);
1043 tree main_label
= label_for_bb
[bb
->index
].label
;
1045 /* label_to_block possibly inserted undefined label into the chain. */
1048 label_for_bb
[bb
->index
].label
= label
;
1052 label_for_bb
[bb
->index
].used
= true;
1056 /* Clean up redundant labels within the exception tree. */
1059 cleanup_dead_labels_eh (void)
1066 if (cfun
->eh
== NULL
)
1069 for (i
= 1; VEC_iterate (eh_landing_pad
, cfun
->eh
->lp_array
, i
, lp
); ++i
)
1070 if (lp
&& lp
->post_landing_pad
)
1072 lab
= main_block_label (lp
->post_landing_pad
);
1073 if (lab
!= lp
->post_landing_pad
)
1075 EH_LANDING_PAD_NR (lp
->post_landing_pad
) = 0;
1076 EH_LANDING_PAD_NR (lab
) = lp
->index
;
1080 FOR_ALL_EH_REGION (r
)
1084 case ERT_MUST_NOT_THROW
:
1090 for (c
= r
->u
.eh_try
.first_catch
; c
; c
= c
->next_catch
)
1094 c
->label
= main_block_label (lab
);
1099 case ERT_ALLOWED_EXCEPTIONS
:
1100 lab
= r
->u
.allowed
.label
;
1102 r
->u
.allowed
.label
= main_block_label (lab
);
1108 /* Cleanup redundant labels. This is a three-step process:
1109 1) Find the leading label for each block.
1110 2) Redirect all references to labels to the leading labels.
1111 3) Cleanup all useless labels. */
1114 cleanup_dead_labels (void)
1117 label_for_bb
= XCNEWVEC (struct label_record
, last_basic_block
);
1119 /* Find a suitable label for each block. We use the first user-defined
1120 label if there is one, or otherwise just the first label we see. */
1123 gimple_stmt_iterator i
;
1125 for (i
= gsi_start_bb (bb
); !gsi_end_p (i
); gsi_next (&i
))
1128 gimple stmt
= gsi_stmt (i
);
1130 if (gimple_code (stmt
) != GIMPLE_LABEL
)
1133 label
= gimple_label_label (stmt
);
1135 /* If we have not yet seen a label for the current block,
1136 remember this one and see if there are more labels. */
1137 if (!label_for_bb
[bb
->index
].label
)
1139 label_for_bb
[bb
->index
].label
= label
;
1143 /* If we did see a label for the current block already, but it
1144 is an artificially created label, replace it if the current
1145 label is a user defined label. */
1146 if (!DECL_ARTIFICIAL (label
)
1147 && DECL_ARTIFICIAL (label_for_bb
[bb
->index
].label
))
1149 label_for_bb
[bb
->index
].label
= label
;
1155 /* Now redirect all jumps/branches to the selected label.
1156 First do so for each block ending in a control statement. */
1159 gimple stmt
= last_stmt (bb
);
1163 switch (gimple_code (stmt
))
1167 tree true_label
= gimple_cond_true_label (stmt
);
1168 tree false_label
= gimple_cond_false_label (stmt
);
1171 gimple_cond_set_true_label (stmt
, main_block_label (true_label
));
1173 gimple_cond_set_false_label (stmt
, main_block_label (false_label
));
1179 size_t i
, n
= gimple_switch_num_labels (stmt
);
1181 /* Replace all destination labels. */
1182 for (i
= 0; i
< n
; ++i
)
1184 tree case_label
= gimple_switch_label (stmt
, i
);
1185 tree label
= main_block_label (CASE_LABEL (case_label
));
1186 CASE_LABEL (case_label
) = label
;
1191 /* We have to handle gotos until they're removed, and we don't
1192 remove them until after we've created the CFG edges. */
1194 if (!computed_goto_p (stmt
))
1196 tree new_dest
= main_block_label (gimple_goto_dest (stmt
));
1197 gimple_goto_set_dest (stmt
, new_dest
);
1206 /* Do the same for the exception region tree labels. */
1207 cleanup_dead_labels_eh ();
1209 /* Finally, purge dead labels. All user-defined labels and labels that
1210 can be the target of non-local gotos and labels which have their
1211 address taken are preserved. */
1214 gimple_stmt_iterator i
;
1215 tree label_for_this_bb
= label_for_bb
[bb
->index
].label
;
1217 if (!label_for_this_bb
)
1220 /* If the main label of the block is unused, we may still remove it. */
1221 if (!label_for_bb
[bb
->index
].used
)
1222 label_for_this_bb
= NULL
;
1224 for (i
= gsi_start_bb (bb
); !gsi_end_p (i
); )
1227 gimple stmt
= gsi_stmt (i
);
1229 if (gimple_code (stmt
) != GIMPLE_LABEL
)
1232 label
= gimple_label_label (stmt
);
1234 if (label
== label_for_this_bb
1235 || !DECL_ARTIFICIAL (label
)
1236 || DECL_NONLOCAL (label
)
1237 || FORCED_LABEL (label
))
1240 gsi_remove (&i
, true);
1244 free (label_for_bb
);
1247 /* Look for blocks ending in a multiway branch (a SWITCH_EXPR in GIMPLE),
1248 and scan the sorted vector of cases. Combine the ones jumping to the
1250 Eg. three separate entries 1: 2: 3: become one entry 1..3: */
1253 group_case_labels (void)
1259 gimple stmt
= last_stmt (bb
);
1260 if (stmt
&& gimple_code (stmt
) == GIMPLE_SWITCH
)
1262 int old_size
= gimple_switch_num_labels (stmt
);
1263 int i
, j
, new_size
= old_size
;
1264 tree default_case
= NULL_TREE
;
1265 tree default_label
= NULL_TREE
;
1268 /* The default label is always the first case in a switch
1269 statement after gimplification if it was not optimized
1271 if (!CASE_LOW (gimple_switch_default_label (stmt
))
1272 && !CASE_HIGH (gimple_switch_default_label (stmt
)))
1274 default_case
= gimple_switch_default_label (stmt
);
1275 default_label
= CASE_LABEL (default_case
);
1279 has_default
= false;
1281 /* Look for possible opportunities to merge cases. */
1286 while (i
< old_size
)
1288 tree base_case
, base_label
, base_high
;
1289 base_case
= gimple_switch_label (stmt
, i
);
1291 gcc_assert (base_case
);
1292 base_label
= CASE_LABEL (base_case
);
1294 /* Discard cases that have the same destination as the
1296 if (base_label
== default_label
)
1298 gimple_switch_set_label (stmt
, i
, NULL_TREE
);
1304 base_high
= CASE_HIGH (base_case
)
1305 ? CASE_HIGH (base_case
)
1306 : CASE_LOW (base_case
);
1309 /* Try to merge case labels. Break out when we reach the end
1310 of the label vector or when we cannot merge the next case
1311 label with the current one. */
1312 while (i
< old_size
)
1314 tree merge_case
= gimple_switch_label (stmt
, i
);
1315 tree merge_label
= CASE_LABEL (merge_case
);
1316 tree t
= int_const_binop (PLUS_EXPR
, base_high
,
1317 integer_one_node
, 1);
1319 /* Merge the cases if they jump to the same place,
1320 and their ranges are consecutive. */
1321 if (merge_label
== base_label
1322 && tree_int_cst_equal (CASE_LOW (merge_case
), t
))
1324 base_high
= CASE_HIGH (merge_case
) ?
1325 CASE_HIGH (merge_case
) : CASE_LOW (merge_case
);
1326 CASE_HIGH (base_case
) = base_high
;
1327 gimple_switch_set_label (stmt
, i
, NULL_TREE
);
1336 /* Compress the case labels in the label vector, and adjust the
1337 length of the vector. */
1338 for (i
= 0, j
= 0; i
< new_size
; i
++)
1340 while (! gimple_switch_label (stmt
, j
))
1342 gimple_switch_set_label (stmt
, i
,
1343 gimple_switch_label (stmt
, j
++));
1346 gcc_assert (new_size
<= old_size
);
1347 gimple_switch_set_num_labels (stmt
, new_size
);
1352 /* Checks whether we can merge block B into block A. */
1355 gimple_can_merge_blocks_p (basic_block a
, basic_block b
)
1358 gimple_stmt_iterator gsi
;
1361 if (!single_succ_p (a
))
1364 if (single_succ_edge (a
)->flags
& (EDGE_ABNORMAL
| EDGE_EH
))
1367 if (single_succ (a
) != b
)
1370 if (!single_pred_p (b
))
1373 if (b
== EXIT_BLOCK_PTR
)
1376 /* If A ends by a statement causing exceptions or something similar, we
1377 cannot merge the blocks. */
1378 stmt
= last_stmt (a
);
1379 if (stmt
&& stmt_ends_bb_p (stmt
))
1382 /* Do not allow a block with only a non-local label to be merged. */
1384 && gimple_code (stmt
) == GIMPLE_LABEL
1385 && DECL_NONLOCAL (gimple_label_label (stmt
)))
1388 /* Examine the labels at the beginning of B. */
1389 for (gsi
= gsi_start_bb (b
); !gsi_end_p (gsi
); gsi_next (&gsi
))
1392 stmt
= gsi_stmt (gsi
);
1393 if (gimple_code (stmt
) != GIMPLE_LABEL
)
1395 lab
= gimple_label_label (stmt
);
1397 /* Do not remove user labels. */
1398 if (!DECL_ARTIFICIAL (lab
))
1402 /* Protect the loop latches. */
1403 if (current_loops
&& b
->loop_father
->latch
== b
)
1406 /* It must be possible to eliminate all phi nodes in B. If ssa form
1407 is not up-to-date, we cannot eliminate any phis; however, if only
1408 some symbols as whole are marked for renaming, this is not a problem,
1409 as phi nodes for those symbols are irrelevant in updating anyway. */
1410 phis
= phi_nodes (b
);
1411 if (!gimple_seq_empty_p (phis
))
1413 gimple_stmt_iterator i
;
1415 if (name_mappings_registered_p ())
1418 for (i
= gsi_start (phis
); !gsi_end_p (i
); gsi_next (&i
))
1420 gimple phi
= gsi_stmt (i
);
1422 if (!is_gimple_reg (gimple_phi_result (phi
))
1423 && !may_propagate_copy (gimple_phi_result (phi
),
1424 gimple_phi_arg_def (phi
, 0)))
1432 /* Return true if the var whose chain of uses starts at PTR has no
1435 has_zero_uses_1 (const ssa_use_operand_t
*head
)
1437 const ssa_use_operand_t
*ptr
;
1439 for (ptr
= head
->next
; ptr
!= head
; ptr
= ptr
->next
)
1440 if (!is_gimple_debug (USE_STMT (ptr
)))
1446 /* Return true if the var whose chain of uses starts at PTR has a
1447 single nondebug use. Set USE_P and STMT to that single nondebug
1448 use, if so, or to NULL otherwise. */
1450 single_imm_use_1 (const ssa_use_operand_t
*head
,
1451 use_operand_p
*use_p
, gimple
*stmt
)
1453 ssa_use_operand_t
*ptr
, *single_use
= 0;
1455 for (ptr
= head
->next
; ptr
!= head
; ptr
= ptr
->next
)
1456 if (!is_gimple_debug (USE_STMT (ptr
)))
1467 *use_p
= single_use
;
1470 *stmt
= single_use
? single_use
->loc
.stmt
: NULL
;
1472 return !!single_use
;
1475 /* Replaces all uses of NAME by VAL. */
1478 replace_uses_by (tree name
, tree val
)
1480 imm_use_iterator imm_iter
;
1485 FOR_EACH_IMM_USE_STMT (stmt
, imm_iter
, name
)
1487 FOR_EACH_IMM_USE_ON_STMT (use
, imm_iter
)
1489 replace_exp (use
, val
);
1491 if (gimple_code (stmt
) == GIMPLE_PHI
)
1493 e
= gimple_phi_arg_edge (stmt
, PHI_ARG_INDEX_FROM_USE (use
));
1494 if (e
->flags
& EDGE_ABNORMAL
)
1496 /* This can only occur for virtual operands, since
1497 for the real ones SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name))
1498 would prevent replacement. */
1499 gcc_assert (!is_gimple_reg (name
));
1500 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (val
) = 1;
1505 if (gimple_code (stmt
) != GIMPLE_PHI
)
1509 fold_stmt_inplace (stmt
);
1510 if (cfgcleanup_altered_bbs
)
1511 bitmap_set_bit (cfgcleanup_altered_bbs
, gimple_bb (stmt
)->index
);
1513 /* FIXME. This should go in update_stmt. */
1514 for (i
= 0; i
< gimple_num_ops (stmt
); i
++)
1516 tree op
= gimple_op (stmt
, i
);
1517 /* Operands may be empty here. For example, the labels
1518 of a GIMPLE_COND are nulled out following the creation
1519 of the corresponding CFG edges. */
1520 if (op
&& TREE_CODE (op
) == ADDR_EXPR
)
1521 recompute_tree_invariant_for_addr_expr (op
);
1524 maybe_clean_or_replace_eh_stmt (stmt
, stmt
);
1529 gcc_assert (has_zero_uses (name
));
1531 /* Also update the trees stored in loop structures. */
1537 FOR_EACH_LOOP (li
, loop
, 0)
1539 substitute_in_loop_info (loop
, name
, val
);
1544 /* Merge block B into block A. */
1547 gimple_merge_blocks (basic_block a
, basic_block b
)
1549 gimple_stmt_iterator last
, gsi
, psi
;
1550 gimple_seq phis
= phi_nodes (b
);
1553 fprintf (dump_file
, "Merging blocks %d and %d\n", a
->index
, b
->index
);
1555 /* Remove all single-valued PHI nodes from block B of the form
1556 V_i = PHI <V_j> by propagating V_j to all the uses of V_i. */
1557 gsi
= gsi_last_bb (a
);
1558 for (psi
= gsi_start (phis
); !gsi_end_p (psi
); )
1560 gimple phi
= gsi_stmt (psi
);
1561 tree def
= gimple_phi_result (phi
), use
= gimple_phi_arg_def (phi
, 0);
1563 bool may_replace_uses
= !is_gimple_reg (def
)
1564 || may_propagate_copy (def
, use
);
1566 /* In case we maintain loop closed ssa form, do not propagate arguments
1567 of loop exit phi nodes. */
1569 && loops_state_satisfies_p (LOOP_CLOSED_SSA
)
1570 && is_gimple_reg (def
)
1571 && TREE_CODE (use
) == SSA_NAME
1572 && a
->loop_father
!= b
->loop_father
)
1573 may_replace_uses
= false;
1575 if (!may_replace_uses
)
1577 gcc_assert (is_gimple_reg (def
));
1579 /* Note that just emitting the copies is fine -- there is no problem
1580 with ordering of phi nodes. This is because A is the single
1581 predecessor of B, therefore results of the phi nodes cannot
1582 appear as arguments of the phi nodes. */
1583 copy
= gimple_build_assign (def
, use
);
1584 gsi_insert_after (&gsi
, copy
, GSI_NEW_STMT
);
1585 remove_phi_node (&psi
, false);
1589 /* If we deal with a PHI for virtual operands, we can simply
1590 propagate these without fussing with folding or updating
1592 if (!is_gimple_reg (def
))
1594 imm_use_iterator iter
;
1595 use_operand_p use_p
;
1598 FOR_EACH_IMM_USE_STMT (stmt
, iter
, def
)
1599 FOR_EACH_IMM_USE_ON_STMT (use_p
, iter
)
1600 SET_USE (use_p
, use
);
1603 replace_uses_by (def
, use
);
1605 remove_phi_node (&psi
, true);
1609 /* Ensure that B follows A. */
1610 move_block_after (b
, a
);
1612 gcc_assert (single_succ_edge (a
)->flags
& EDGE_FALLTHRU
);
1613 gcc_assert (!last_stmt (a
) || !stmt_ends_bb_p (last_stmt (a
)));
1615 /* Remove labels from B and set gimple_bb to A for other statements. */
1616 for (gsi
= gsi_start_bb (b
); !gsi_end_p (gsi
);)
1618 gimple stmt
= gsi_stmt (gsi
);
1619 if (gimple_code (stmt
) == GIMPLE_LABEL
)
1621 tree label
= gimple_label_label (stmt
);
1624 gsi_remove (&gsi
, false);
1626 /* Now that we can thread computed gotos, we might have
1627 a situation where we have a forced label in block B
1628 However, the label at the start of block B might still be
1629 used in other ways (think about the runtime checking for
1630 Fortran assigned gotos). So we can not just delete the
1631 label. Instead we move the label to the start of block A. */
1632 if (FORCED_LABEL (label
))
1634 gimple_stmt_iterator dest_gsi
= gsi_start_bb (a
);
1635 gsi_insert_before (&dest_gsi
, stmt
, GSI_NEW_STMT
);
1638 lp_nr
= EH_LANDING_PAD_NR (label
);
1641 eh_landing_pad lp
= get_eh_landing_pad_from_number (lp_nr
);
1642 lp
->post_landing_pad
= NULL
;
1647 gimple_set_bb (stmt
, a
);
1652 /* Merge the sequences. */
1653 last
= gsi_last_bb (a
);
1654 gsi_insert_seq_after (&last
, bb_seq (b
), GSI_NEW_STMT
);
1655 set_bb_seq (b
, NULL
);
1657 if (cfgcleanup_altered_bbs
)
1658 bitmap_set_bit (cfgcleanup_altered_bbs
, a
->index
);
1662 /* Return the one of two successors of BB that is not reachable by a
1663 complex edge, if there is one. Else, return BB. We use
1664 this in optimizations that use post-dominators for their heuristics,
1665 to catch the cases in C++ where function calls are involved. */
1668 single_noncomplex_succ (basic_block bb
)
1671 if (EDGE_COUNT (bb
->succs
) != 2)
1674 e0
= EDGE_SUCC (bb
, 0);
1675 e1
= EDGE_SUCC (bb
, 1);
1676 if (e0
->flags
& EDGE_COMPLEX
)
1678 if (e1
->flags
& EDGE_COMPLEX
)
1685 /* Walk the function tree removing unnecessary statements.
1687 * Empty statement nodes are removed
1689 * Unnecessary TRY_FINALLY and TRY_CATCH blocks are removed
1691 * Unnecessary COND_EXPRs are removed
1693 * Some unnecessary BIND_EXPRs are removed
1695 * GOTO_EXPRs immediately preceding destination are removed.
1697 Clearly more work could be done. The trick is doing the analysis
1698 and removal fast enough to be a net improvement in compile times.
1700 Note that when we remove a control structure such as a COND_EXPR
1701 BIND_EXPR, or TRY block, we will need to repeat this optimization pass
1702 to ensure we eliminate all the useless code. */
1711 gimple_stmt_iterator last_goto_gsi
;
1715 static void remove_useless_stmts_1 (gimple_stmt_iterator
*gsi
, struct rus_data
*);
1717 /* Given a statement sequence, find the first executable statement with
1718 location information, and warn that it is unreachable. When searching,
1719 descend into containers in execution order. */
1722 remove_useless_stmts_warn_notreached (gimple_seq stmts
)
1724 gimple_stmt_iterator gsi
;
1726 for (gsi
= gsi_start (stmts
); !gsi_end_p (gsi
); gsi_next (&gsi
))
1728 gimple stmt
= gsi_stmt (gsi
);
1730 if (gimple_no_warning_p (stmt
)) return false;
1732 if (gimple_has_location (stmt
))
1734 location_t loc
= gimple_location (stmt
);
1735 if (LOCATION_LINE (loc
) > 0)
1737 warning_at (loc
, OPT_Wunreachable_code
, "will never be executed");
1742 switch (gimple_code (stmt
))
1744 /* Unfortunately, we need the CFG now to detect unreachable
1745 branches in a conditional, so conditionals are not handled here. */
1748 if (remove_useless_stmts_warn_notreached (gimple_try_eval (stmt
)))
1750 if (remove_useless_stmts_warn_notreached (gimple_try_cleanup (stmt
)))
1755 return remove_useless_stmts_warn_notreached (gimple_catch_handler (stmt
));
1757 case GIMPLE_EH_FILTER
:
1758 return remove_useless_stmts_warn_notreached (gimple_eh_filter_failure (stmt
));
1761 return remove_useless_stmts_warn_notreached (gimple_bind_body (stmt
));
1771 /* Helper for remove_useless_stmts_1. Handle GIMPLE_COND statements. */
1774 remove_useless_stmts_cond (gimple_stmt_iterator
*gsi
, struct rus_data
*data
)
1776 gimple stmt
= gsi_stmt (*gsi
);
1778 /* The folded result must still be a conditional statement. */
1780 gcc_assert (gsi_stmt (*gsi
) == stmt
);
1782 data
->may_branch
= true;
1784 /* Replace trivial conditionals with gotos. */
1785 if (gimple_cond_true_p (stmt
))
1787 /* Goto THEN label. */
1788 tree then_label
= gimple_cond_true_label (stmt
);
1790 gsi_replace (gsi
, gimple_build_goto (then_label
), false);
1791 data
->last_goto_gsi
= *gsi
;
1792 data
->last_was_goto
= true;
1793 data
->repeat
= true;
1795 else if (gimple_cond_false_p (stmt
))
1797 /* Goto ELSE label. */
1798 tree else_label
= gimple_cond_false_label (stmt
);
1800 gsi_replace (gsi
, gimple_build_goto (else_label
), false);
1801 data
->last_goto_gsi
= *gsi
;
1802 data
->last_was_goto
= true;
1803 data
->repeat
= true;
1807 tree then_label
= gimple_cond_true_label (stmt
);
1808 tree else_label
= gimple_cond_false_label (stmt
);
1810 if (then_label
== else_label
)
1812 /* Goto common destination. */
1813 gsi_replace (gsi
, gimple_build_goto (then_label
), false);
1814 data
->last_goto_gsi
= *gsi
;
1815 data
->last_was_goto
= true;
1816 data
->repeat
= true;
1822 data
->last_was_goto
= false;
1825 /* Helper for remove_useless_stmts_1.
1826 Handle the try-finally case for GIMPLE_TRY statements. */
1829 remove_useless_stmts_tf (gimple_stmt_iterator
*gsi
, struct rus_data
*data
)
1831 bool save_may_branch
, save_may_throw
;
1832 bool this_may_branch
, this_may_throw
;
1834 gimple_seq eval_seq
, cleanup_seq
;
1835 gimple_stmt_iterator eval_gsi
, cleanup_gsi
;
1837 gimple stmt
= gsi_stmt (*gsi
);
1839 /* Collect may_branch and may_throw information for the body only. */
1840 save_may_branch
= data
->may_branch
;
1841 save_may_throw
= data
->may_throw
;
1842 data
->may_branch
= false;
1843 data
->may_throw
= false;
1844 data
->last_was_goto
= false;
1846 eval_seq
= gimple_try_eval (stmt
);
1847 eval_gsi
= gsi_start (eval_seq
);
1848 remove_useless_stmts_1 (&eval_gsi
, data
);
1850 this_may_branch
= data
->may_branch
;
1851 this_may_throw
= data
->may_throw
;
1852 data
->may_branch
|= save_may_branch
;
1853 data
->may_throw
|= save_may_throw
;
1854 data
->last_was_goto
= false;
1856 cleanup_seq
= gimple_try_cleanup (stmt
);
1857 cleanup_gsi
= gsi_start (cleanup_seq
);
1858 remove_useless_stmts_1 (&cleanup_gsi
, data
);
1860 /* If the body is empty, then we can emit the FINALLY block without
1861 the enclosing TRY_FINALLY_EXPR. */
1862 if (gimple_seq_empty_p (eval_seq
))
1864 gsi_insert_seq_before (gsi
, cleanup_seq
, GSI_SAME_STMT
);
1865 gsi_remove (gsi
, false);
1866 data
->repeat
= true;
1869 /* If the handler is empty, then we can emit the TRY block without
1870 the enclosing TRY_FINALLY_EXPR. */
1871 else if (gimple_seq_empty_p (cleanup_seq
))
1873 gsi_insert_seq_before (gsi
, eval_seq
, GSI_SAME_STMT
);
1874 gsi_remove (gsi
, false);
1875 data
->repeat
= true;
1878 /* If the body neither throws, nor branches, then we can safely
1879 string the TRY and FINALLY blocks together. */
1880 else if (!this_may_branch
&& !this_may_throw
)
1882 gsi_insert_seq_before (gsi
, eval_seq
, GSI_SAME_STMT
);
1883 gsi_insert_seq_before (gsi
, cleanup_seq
, GSI_SAME_STMT
);
1884 gsi_remove (gsi
, false);
1885 data
->repeat
= true;
1891 /* Helper for remove_useless_stmts_1.
1892 Handle the try-catch case for GIMPLE_TRY statements. */
1895 remove_useless_stmts_tc (gimple_stmt_iterator
*gsi
, struct rus_data
*data
)
1897 bool save_may_throw
, this_may_throw
;
1899 gimple_seq eval_seq
, cleanup_seq
, handler_seq
, failure_seq
;
1900 gimple_stmt_iterator eval_gsi
, cleanup_gsi
, handler_gsi
, failure_gsi
;
1902 gimple stmt
= gsi_stmt (*gsi
);
1904 /* Collect may_throw information for the body only. */
1905 save_may_throw
= data
->may_throw
;
1906 data
->may_throw
= false;
1907 data
->last_was_goto
= false;
1909 eval_seq
= gimple_try_eval (stmt
);
1910 eval_gsi
= gsi_start (eval_seq
);
1911 remove_useless_stmts_1 (&eval_gsi
, data
);
1913 this_may_throw
= data
->may_throw
;
1914 data
->may_throw
= save_may_throw
;
1916 cleanup_seq
= gimple_try_cleanup (stmt
);
1918 /* If the body cannot throw, then we can drop the entire TRY_CATCH_EXPR. */
1919 if (!this_may_throw
)
1921 if (warn_notreached
)
1923 remove_useless_stmts_warn_notreached (cleanup_seq
);
1925 gsi_insert_seq_before (gsi
, eval_seq
, GSI_SAME_STMT
);
1926 gsi_remove (gsi
, false);
1927 data
->repeat
= true;
1931 /* Process the catch clause specially. We may be able to tell that
1932 no exceptions propagate past this point. */
1934 this_may_throw
= true;
1935 cleanup_gsi
= gsi_start (cleanup_seq
);
1936 stmt
= gsi_stmt (cleanup_gsi
);
1937 data
->last_was_goto
= false;
1939 switch (gimple_code (stmt
))
1942 /* If the first element is a catch, they all must be. */
1943 while (!gsi_end_p (cleanup_gsi
))
1945 stmt
= gsi_stmt (cleanup_gsi
);
1946 /* If we catch all exceptions, then the body does not
1947 propagate exceptions past this point. */
1948 if (gimple_catch_types (stmt
) == NULL
)
1949 this_may_throw
= false;
1950 data
->last_was_goto
= false;
1951 handler_seq
= gimple_catch_handler (stmt
);
1952 handler_gsi
= gsi_start (handler_seq
);
1953 remove_useless_stmts_1 (&handler_gsi
, data
);
1954 gsi_next (&cleanup_gsi
);
1959 case GIMPLE_EH_FILTER
:
1960 if (gimple_eh_filter_types (stmt
) == NULL
)
1961 this_may_throw
= false;
1962 failure_seq
= gimple_eh_filter_failure (stmt
);
1963 failure_gsi
= gsi_start (failure_seq
);
1964 remove_useless_stmts_1 (&failure_gsi
, data
);
1968 case GIMPLE_EH_MUST_NOT_THROW
:
1969 this_may_throw
= false;
1973 /* Otherwise this is a list of cleanup statements. */
1974 remove_useless_stmts_1 (&cleanup_gsi
, data
);
1976 /* If the cleanup is empty, then we can emit the TRY block without
1977 the enclosing TRY_CATCH_EXPR. */
1978 if (gimple_seq_empty_p (cleanup_seq
))
1980 gsi_insert_seq_before (gsi
, eval_seq
, GSI_SAME_STMT
);
1981 gsi_remove(gsi
, false);
1982 data
->repeat
= true;
1989 data
->may_throw
|= this_may_throw
;
1992 /* Helper for remove_useless_stmts_1. Handle GIMPLE_BIND statements. */
1995 remove_useless_stmts_bind (gimple_stmt_iterator
*gsi
, struct rus_data
*data ATTRIBUTE_UNUSED
)
1998 gimple_seq body_seq
, fn_body_seq
;
1999 gimple_stmt_iterator body_gsi
;
2001 gimple stmt
= gsi_stmt (*gsi
);
2003 /* First remove anything underneath the BIND_EXPR. */
2005 body_seq
= gimple_bind_body (stmt
);
2006 body_gsi
= gsi_start (body_seq
);
2007 remove_useless_stmts_1 (&body_gsi
, data
);
2009 /* If the GIMPLE_BIND has no variables, then we can pull everything
2010 up one level and remove the GIMPLE_BIND, unless this is the toplevel
2011 GIMPLE_BIND for the current function or an inlined function.
2013 When this situation occurs we will want to apply this
2014 optimization again. */
2015 block
= gimple_bind_block (stmt
);
2016 fn_body_seq
= gimple_body (current_function_decl
);
2017 if (gimple_bind_vars (stmt
) == NULL_TREE
2018 && (gimple_seq_empty_p (fn_body_seq
)
2019 || stmt
!= gimple_seq_first_stmt (fn_body_seq
))
2021 || ! BLOCK_ABSTRACT_ORIGIN (block
)
2022 || (TREE_CODE (BLOCK_ABSTRACT_ORIGIN (block
))
2025 tree var
= NULL_TREE
;
2026 /* Even if there are no gimple_bind_vars, there might be other
2027 decls in BLOCK_VARS rendering the GIMPLE_BIND not useless. */
2028 if (block
&& !BLOCK_NUM_NONLOCALIZED_VARS (block
))
2029 for (var
= BLOCK_VARS (block
); var
; var
= TREE_CHAIN (var
))
2030 if (TREE_CODE (var
) == IMPORTED_DECL
)
2032 if (var
|| (block
&& BLOCK_NUM_NONLOCALIZED_VARS (block
)))
2036 gsi_insert_seq_before (gsi
, body_seq
, GSI_SAME_STMT
);
2037 gsi_remove (gsi
, false);
2038 data
->repeat
= true;
2045 /* Helper for remove_useless_stmts_1. Handle GIMPLE_GOTO statements. */
2048 remove_useless_stmts_goto (gimple_stmt_iterator
*gsi
, struct rus_data
*data
)
2050 gimple stmt
= gsi_stmt (*gsi
);
2052 tree dest
= gimple_goto_dest (stmt
);
2054 data
->may_branch
= true;
2055 data
->last_was_goto
= false;
2057 /* Record iterator for last goto expr, so that we can delete it if unnecessary. */
2058 if (TREE_CODE (dest
) == LABEL_DECL
)
2060 data
->last_goto_gsi
= *gsi
;
2061 data
->last_was_goto
= true;
2067 /* Helper for remove_useless_stmts_1. Handle GIMPLE_LABEL statements. */
2070 remove_useless_stmts_label (gimple_stmt_iterator
*gsi
, struct rus_data
*data
)
2072 gimple stmt
= gsi_stmt (*gsi
);
2074 tree label
= gimple_label_label (stmt
);
2076 data
->has_label
= true;
2078 /* We do want to jump across non-local label receiver code. */
2079 if (DECL_NONLOCAL (label
))
2080 data
->last_was_goto
= false;
2082 else if (data
->last_was_goto
2083 && gimple_goto_dest (gsi_stmt (data
->last_goto_gsi
)) == label
)
2085 /* Replace the preceding GIMPLE_GOTO statement with
2086 a GIMPLE_NOP, which will be subsequently removed.
2087 In this way, we avoid invalidating other iterators
2088 active on the statement sequence. */
2089 gsi_replace(&data
->last_goto_gsi
, gimple_build_nop(), false);
2090 data
->last_was_goto
= false;
2091 data
->repeat
= true;
2094 /* ??? Add something here to delete unused labels. */
2100 /* T is CALL_EXPR. Set current_function_calls_* flags. */
2103 notice_special_calls (gimple call
)
2105 int flags
= gimple_call_flags (call
);
2107 if (flags
& ECF_MAY_BE_ALLOCA
)
2108 cfun
->calls_alloca
= true;
2109 if (flags
& ECF_RETURNS_TWICE
)
2110 cfun
->calls_setjmp
= true;
2114 /* Clear flags set by notice_special_calls. Used by dead code removal
2115 to update the flags. */
2118 clear_special_calls (void)
2120 cfun
->calls_alloca
= false;
2121 cfun
->calls_setjmp
= false;
2124 /* Remove useless statements from a statement sequence, and perform
2125 some preliminary simplifications. */
2128 remove_useless_stmts_1 (gimple_stmt_iterator
*gsi
, struct rus_data
*data
)
2130 while (!gsi_end_p (*gsi
))
2132 gimple stmt
= gsi_stmt (*gsi
);
2134 switch (gimple_code (stmt
))
2137 remove_useless_stmts_cond (gsi
, data
);
2141 remove_useless_stmts_goto (gsi
, data
);
2145 remove_useless_stmts_label (gsi
, data
);
2150 stmt
= gsi_stmt (*gsi
);
2151 data
->last_was_goto
= false;
2152 if (stmt_could_throw_p (stmt
))
2153 data
->may_throw
= true;
2159 data
->last_was_goto
= false;
2165 stmt
= gsi_stmt (*gsi
);
2166 data
->last_was_goto
= false;
2167 if (is_gimple_call (stmt
))
2168 notice_special_calls (stmt
);
2170 /* We used to call update_gimple_call_flags here,
2171 which copied side-effects and nothrows status
2172 from the function decl to the call. In the new
2173 tuplified GIMPLE, the accessors for this information
2174 always consult the function decl, so this copying
2175 is no longer necessary. */
2176 if (stmt_could_throw_p (stmt
))
2177 data
->may_throw
= true;
2183 data
->last_was_goto
= false;
2184 data
->may_branch
= true;
2189 remove_useless_stmts_bind (gsi
, data
);
2193 if (gimple_try_kind (stmt
) == GIMPLE_TRY_CATCH
)
2194 remove_useless_stmts_tc (gsi
, data
);
2195 else if (gimple_try_kind (stmt
) == GIMPLE_TRY_FINALLY
)
2196 remove_useless_stmts_tf (gsi
, data
);
2206 gsi_remove (gsi
, false);
2209 case GIMPLE_OMP_FOR
:
2211 gimple_seq pre_body_seq
= gimple_omp_for_pre_body (stmt
);
2212 gimple_stmt_iterator pre_body_gsi
= gsi_start (pre_body_seq
);
2214 remove_useless_stmts_1 (&pre_body_gsi
, data
);
2215 data
->last_was_goto
= false;
2218 case GIMPLE_OMP_CRITICAL
:
2219 case GIMPLE_OMP_CONTINUE
:
2220 case GIMPLE_OMP_MASTER
:
2221 case GIMPLE_OMP_ORDERED
:
2222 case GIMPLE_OMP_SECTION
:
2223 case GIMPLE_OMP_SECTIONS
:
2224 case GIMPLE_OMP_SINGLE
:
2226 gimple_seq body_seq
= gimple_omp_body (stmt
);
2227 gimple_stmt_iterator body_gsi
= gsi_start (body_seq
);
2229 remove_useless_stmts_1 (&body_gsi
, data
);
2230 data
->last_was_goto
= false;
2235 case GIMPLE_OMP_PARALLEL
:
2236 case GIMPLE_OMP_TASK
:
2238 /* Make sure the outermost GIMPLE_BIND isn't removed
2240 gimple_seq body_seq
= gimple_omp_body (stmt
);
2241 gimple bind
= gimple_seq_first_stmt (body_seq
);
2242 gimple_seq bind_seq
= gimple_bind_body (bind
);
2243 gimple_stmt_iterator bind_gsi
= gsi_start (bind_seq
);
2245 remove_useless_stmts_1 (&bind_gsi
, data
);
2246 data
->last_was_goto
= false;
2252 data
->last_was_goto
= false;
2259 /* Walk the function tree, removing useless statements and performing
2260 some preliminary simplifications. */
2263 remove_useless_stmts (void)
2265 struct rus_data data
;
2267 clear_special_calls ();
2271 gimple_stmt_iterator gsi
;
2273 gsi
= gsi_start (gimple_body (current_function_decl
));
2274 memset (&data
, 0, sizeof (data
));
2275 remove_useless_stmts_1 (&gsi
, &data
);
2277 while (data
.repeat
);
2279 #ifdef ENABLE_TYPES_CHECKING
2280 verify_types_in_gimple_seq (gimple_body (current_function_decl
));
2287 struct gimple_opt_pass pass_remove_useless_stmts
=
2291 "useless", /* name */
2293 remove_useless_stmts
, /* execute */
2296 0, /* static_pass_number */
2297 TV_NONE
, /* tv_id */
2298 PROP_gimple_any
, /* properties_required */
2299 0, /* properties_provided */
2300 0, /* properties_destroyed */
2301 0, /* todo_flags_start */
2302 TODO_dump_func
/* todo_flags_finish */
2306 /* Remove PHI nodes associated with basic block BB and all edges out of BB. */
2309 remove_phi_nodes_and_edges_for_unreachable_block (basic_block bb
)
2311 /* Since this block is no longer reachable, we can just delete all
2312 of its PHI nodes. */
2313 remove_phi_nodes (bb
);
2315 /* Remove edges to BB's successors. */
2316 while (EDGE_COUNT (bb
->succs
) > 0)
2317 remove_edge (EDGE_SUCC (bb
, 0));
2321 /* Remove statements of basic block BB. */
2324 remove_bb (basic_block bb
)
2326 gimple_stmt_iterator i
;
2327 source_location loc
= UNKNOWN_LOCATION
;
2331 fprintf (dump_file
, "Removing basic block %d\n", bb
->index
);
2332 if (dump_flags
& TDF_DETAILS
)
2334 dump_bb (bb
, dump_file
, 0);
2335 fprintf (dump_file
, "\n");
2341 struct loop
*loop
= bb
->loop_father
;
2343 /* If a loop gets removed, clean up the information associated
2345 if (loop
->latch
== bb
2346 || loop
->header
== bb
)
2347 free_numbers_of_iterations_estimates_loop (loop
);
2350 /* Remove all the instructions in the block. */
2351 if (bb_seq (bb
) != NULL
)
2353 /* Walk backwards so as to get a chance to substitute all
2354 released DEFs into debug stmts. See
2355 eliminate_unnecessary_stmts() in tree-ssa-dce.c for more
2357 for (i
= gsi_last_bb (bb
); !gsi_end_p (i
);)
2359 gimple stmt
= gsi_stmt (i
);
2360 if (gimple_code (stmt
) == GIMPLE_LABEL
2361 && (FORCED_LABEL (gimple_label_label (stmt
))
2362 || DECL_NONLOCAL (gimple_label_label (stmt
))))
2365 gimple_stmt_iterator new_gsi
;
2367 /* A non-reachable non-local label may still be referenced.
2368 But it no longer needs to carry the extra semantics of
2370 if (DECL_NONLOCAL (gimple_label_label (stmt
)))
2372 DECL_NONLOCAL (gimple_label_label (stmt
)) = 0;
2373 FORCED_LABEL (gimple_label_label (stmt
)) = 1;
2376 new_bb
= bb
->prev_bb
;
2377 new_gsi
= gsi_start_bb (new_bb
);
2378 gsi_remove (&i
, false);
2379 gsi_insert_before (&new_gsi
, stmt
, GSI_NEW_STMT
);
2383 /* Release SSA definitions if we are in SSA. Note that we
2384 may be called when not in SSA. For example,
2385 final_cleanup calls this function via
2386 cleanup_tree_cfg. */
2387 if (gimple_in_ssa_p (cfun
))
2388 release_defs (stmt
);
2390 gsi_remove (&i
, true);
2394 i
= gsi_last_bb (bb
);
2398 /* Don't warn for removed gotos. Gotos are often removed due to
2399 jump threading, thus resulting in bogus warnings. Not great,
2400 since this way we lose warnings for gotos in the original
2401 program that are indeed unreachable. */
2402 if (gimple_code (stmt
) != GIMPLE_GOTO
2403 && gimple_has_location (stmt
))
2404 loc
= gimple_location (stmt
);
2408 /* If requested, give a warning that the first statement in the
2409 block is unreachable. We walk statements backwards in the
2410 loop above, so the last statement we process is the first statement
2412 if (loc
> BUILTINS_LOCATION
&& LOCATION_LINE (loc
) > 0)
2413 warning_at (loc
, OPT_Wunreachable_code
, "will never be executed");
2415 remove_phi_nodes_and_edges_for_unreachable_block (bb
);
2416 bb
->il
.gimple
= NULL
;
2420 /* Given a basic block BB ending with COND_EXPR or SWITCH_EXPR, and a
2421 predicate VAL, return the edge that will be taken out of the block.
2422 If VAL does not match a unique edge, NULL is returned. */
2425 find_taken_edge (basic_block bb
, tree val
)
2429 stmt
= last_stmt (bb
);
2432 gcc_assert (is_ctrl_stmt (stmt
));
2437 if (!is_gimple_min_invariant (val
))
2440 if (gimple_code (stmt
) == GIMPLE_COND
)
2441 return find_taken_edge_cond_expr (bb
, val
);
2443 if (gimple_code (stmt
) == GIMPLE_SWITCH
)
2444 return find_taken_edge_switch_expr (bb
, val
);
2446 if (computed_goto_p (stmt
))
2448 /* Only optimize if the argument is a label, if the argument is
2449 not a label then we can not construct a proper CFG.
2451 It may be the case that we only need to allow the LABEL_REF to
2452 appear inside an ADDR_EXPR, but we also allow the LABEL_REF to
2453 appear inside a LABEL_EXPR just to be safe. */
2454 if ((TREE_CODE (val
) == ADDR_EXPR
|| TREE_CODE (val
) == LABEL_EXPR
)
2455 && TREE_CODE (TREE_OPERAND (val
, 0)) == LABEL_DECL
)
2456 return find_taken_edge_computed_goto (bb
, TREE_OPERAND (val
, 0));
2463 /* Given a constant value VAL and the entry block BB to a GOTO_EXPR
2464 statement, determine which of the outgoing edges will be taken out of the
2465 block. Return NULL if either edge may be taken. */
2468 find_taken_edge_computed_goto (basic_block bb
, tree val
)
2473 dest
= label_to_block (val
);
2476 e
= find_edge (bb
, dest
);
2477 gcc_assert (e
!= NULL
);
2483 /* Given a constant value VAL and the entry block BB to a COND_EXPR
2484 statement, determine which of the two edges will be taken out of the
2485 block. Return NULL if either edge may be taken. */
2488 find_taken_edge_cond_expr (basic_block bb
, tree val
)
2490 edge true_edge
, false_edge
;
2492 extract_true_false_edges_from_block (bb
, &true_edge
, &false_edge
);
2494 gcc_assert (TREE_CODE (val
) == INTEGER_CST
);
2495 return (integer_zerop (val
) ? false_edge
: true_edge
);
2498 /* Given an INTEGER_CST VAL and the entry block BB to a SWITCH_EXPR
2499 statement, determine which edge will be taken out of the block. Return
2500 NULL if any edge may be taken. */
2503 find_taken_edge_switch_expr (basic_block bb
, tree val
)
2505 basic_block dest_bb
;
2510 switch_stmt
= last_stmt (bb
);
2511 taken_case
= find_case_label_for_value (switch_stmt
, val
);
2512 dest_bb
= label_to_block (CASE_LABEL (taken_case
));
2514 e
= find_edge (bb
, dest_bb
);
2520 /* Return the CASE_LABEL_EXPR that SWITCH_STMT will take for VAL.
2521 We can make optimal use here of the fact that the case labels are
2522 sorted: We can do a binary search for a case matching VAL. */
2525 find_case_label_for_value (gimple switch_stmt
, tree val
)
2527 size_t low
, high
, n
= gimple_switch_num_labels (switch_stmt
);
2528 tree default_case
= gimple_switch_default_label (switch_stmt
);
2530 for (low
= 0, high
= n
; high
- low
> 1; )
2532 size_t i
= (high
+ low
) / 2;
2533 tree t
= gimple_switch_label (switch_stmt
, i
);
2536 /* Cache the result of comparing CASE_LOW and val. */
2537 cmp
= tree_int_cst_compare (CASE_LOW (t
), val
);
2544 if (CASE_HIGH (t
) == NULL
)
2546 /* A singe-valued case label. */
2552 /* A case range. We can only handle integer ranges. */
2553 if (cmp
<= 0 && tree_int_cst_compare (CASE_HIGH (t
), val
) >= 0)
2558 return default_case
;
2562 /* Dump a basic block on stderr. */
2565 gimple_debug_bb (basic_block bb
)
2567 gimple_dump_bb (bb
, stderr
, 0, TDF_VOPS
|TDF_MEMSYMS
);
2571 /* Dump basic block with index N on stderr. */
2574 gimple_debug_bb_n (int n
)
2576 gimple_debug_bb (BASIC_BLOCK (n
));
2577 return BASIC_BLOCK (n
);
2581 /* Dump the CFG on stderr.
2583 FLAGS are the same used by the tree dumping functions
2584 (see TDF_* in tree-pass.h). */
2587 gimple_debug_cfg (int flags
)
2589 gimple_dump_cfg (stderr
, flags
);
2593 /* Dump the program showing basic block boundaries on the given FILE.
2595 FLAGS are the same used by the tree dumping functions (see TDF_* in
2599 gimple_dump_cfg (FILE *file
, int flags
)
2601 if (flags
& TDF_DETAILS
)
2603 const char *funcname
2604 = lang_hooks
.decl_printable_name (current_function_decl
, 2);
2607 fprintf (file
, ";; Function %s\n\n", funcname
);
2608 fprintf (file
, ";; \n%d basic blocks, %d edges, last basic block %d.\n\n",
2609 n_basic_blocks
, n_edges
, last_basic_block
);
2611 brief_dump_cfg (file
);
2612 fprintf (file
, "\n");
2615 if (flags
& TDF_STATS
)
2616 dump_cfg_stats (file
);
2618 dump_function_to_file (current_function_decl
, file
, flags
| TDF_BLOCKS
);
2622 /* Dump CFG statistics on FILE. */
2625 dump_cfg_stats (FILE *file
)
2627 static long max_num_merged_labels
= 0;
2628 unsigned long size
, total
= 0;
2631 const char * const fmt_str
= "%-30s%-13s%12s\n";
2632 const char * const fmt_str_1
= "%-30s%13d%11lu%c\n";
2633 const char * const fmt_str_2
= "%-30s%13ld%11lu%c\n";
2634 const char * const fmt_str_3
= "%-43s%11lu%c\n";
2635 const char *funcname
2636 = lang_hooks
.decl_printable_name (current_function_decl
, 2);
2639 fprintf (file
, "\nCFG Statistics for %s\n\n", funcname
);
2641 fprintf (file
, "---------------------------------------------------------\n");
2642 fprintf (file
, fmt_str
, "", " Number of ", "Memory");
2643 fprintf (file
, fmt_str
, "", " instances ", "used ");
2644 fprintf (file
, "---------------------------------------------------------\n");
2646 size
= n_basic_blocks
* sizeof (struct basic_block_def
);
2648 fprintf (file
, fmt_str_1
, "Basic blocks", n_basic_blocks
,
2649 SCALE (size
), LABEL (size
));
2653 num_edges
+= EDGE_COUNT (bb
->succs
);
2654 size
= num_edges
* sizeof (struct edge_def
);
2656 fprintf (file
, fmt_str_2
, "Edges", num_edges
, SCALE (size
), LABEL (size
));
2658 fprintf (file
, "---------------------------------------------------------\n");
2659 fprintf (file
, fmt_str_3
, "Total memory used by CFG data", SCALE (total
),
2661 fprintf (file
, "---------------------------------------------------------\n");
2662 fprintf (file
, "\n");
2664 if (cfg_stats
.num_merged_labels
> max_num_merged_labels
)
2665 max_num_merged_labels
= cfg_stats
.num_merged_labels
;
2667 fprintf (file
, "Coalesced label blocks: %ld (Max so far: %ld)\n",
2668 cfg_stats
.num_merged_labels
, max_num_merged_labels
);
2670 fprintf (file
, "\n");
2674 /* Dump CFG statistics on stderr. Keep extern so that it's always
2675 linked in the final executable. */
2678 debug_cfg_stats (void)
2680 dump_cfg_stats (stderr
);
2684 /* Dump the flowgraph to a .vcg FILE. */
2687 gimple_cfg2vcg (FILE *file
)
2692 const char *funcname
2693 = lang_hooks
.decl_printable_name (current_function_decl
, 2);
2695 /* Write the file header. */
2696 fprintf (file
, "graph: { title: \"%s\"\n", funcname
);
2697 fprintf (file
, "node: { title: \"ENTRY\" label: \"ENTRY\" }\n");
2698 fprintf (file
, "node: { title: \"EXIT\" label: \"EXIT\" }\n");
2700 /* Write blocks and edges. */
2701 FOR_EACH_EDGE (e
, ei
, ENTRY_BLOCK_PTR
->succs
)
2703 fprintf (file
, "edge: { sourcename: \"ENTRY\" targetname: \"%d\"",
2706 if (e
->flags
& EDGE_FAKE
)
2707 fprintf (file
, " linestyle: dotted priority: 10");
2709 fprintf (file
, " linestyle: solid priority: 100");
2711 fprintf (file
, " }\n");
2717 enum gimple_code head_code
, end_code
;
2718 const char *head_name
, *end_name
;
2721 gimple first
= first_stmt (bb
);
2722 gimple last
= last_stmt (bb
);
2726 head_code
= gimple_code (first
);
2727 head_name
= gimple_code_name
[head_code
];
2728 head_line
= get_lineno (first
);
2731 head_name
= "no-statement";
2735 end_code
= gimple_code (last
);
2736 end_name
= gimple_code_name
[end_code
];
2737 end_line
= get_lineno (last
);
2740 end_name
= "no-statement";
2742 fprintf (file
, "node: { title: \"%d\" label: \"#%d\\n%s (%d)\\n%s (%d)\"}\n",
2743 bb
->index
, bb
->index
, head_name
, head_line
, end_name
,
2746 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
2748 if (e
->dest
== EXIT_BLOCK_PTR
)
2749 fprintf (file
, "edge: { sourcename: \"%d\" targetname: \"EXIT\"", bb
->index
);
2751 fprintf (file
, "edge: { sourcename: \"%d\" targetname: \"%d\"", bb
->index
, e
->dest
->index
);
2753 if (e
->flags
& EDGE_FAKE
)
2754 fprintf (file
, " priority: 10 linestyle: dotted");
2756 fprintf (file
, " priority: 100 linestyle: solid");
2758 fprintf (file
, " }\n");
2761 if (bb
->next_bb
!= EXIT_BLOCK_PTR
)
2765 fputs ("}\n\n", file
);
2770 /*---------------------------------------------------------------------------
2771 Miscellaneous helpers
2772 ---------------------------------------------------------------------------*/
2774 /* Return true if T represents a stmt that always transfers control. */
2777 is_ctrl_stmt (gimple t
)
2779 switch (gimple_code (t
))
2793 /* Return true if T is a statement that may alter the flow of control
2794 (e.g., a call to a non-returning function). */
2797 is_ctrl_altering_stmt (gimple t
)
2801 switch (gimple_code (t
))
2805 int flags
= gimple_call_flags (t
);
2807 /* A non-pure/const call alters flow control if the current
2808 function has nonlocal labels. */
2809 if (!(flags
& (ECF_CONST
| ECF_PURE
)) && cfun
->has_nonlocal_label
)
2812 /* A call also alters control flow if it does not return. */
2813 if (gimple_call_flags (t
) & ECF_NORETURN
)
2818 case GIMPLE_EH_DISPATCH
:
2819 /* EH_DISPATCH branches to the individual catch handlers at
2820 this level of a try or allowed-exceptions region. It can
2821 fallthru to the next statement as well. */
2825 /* OpenMP directives alter control flow. */
2832 /* If a statement can throw, it alters control flow. */
2833 return stmt_can_throw_internal (t
);
2837 /* Return true if T is a simple local goto. */
2840 simple_goto_p (gimple t
)
2842 return (gimple_code (t
) == GIMPLE_GOTO
2843 && TREE_CODE (gimple_goto_dest (t
)) == LABEL_DECL
);
2847 /* Return true if T can make an abnormal transfer of control flow.
2848 Transfers of control flow associated with EH are excluded. */
2851 stmt_can_make_abnormal_goto (gimple t
)
2853 if (computed_goto_p (t
))
2855 if (is_gimple_call (t
))
2856 return gimple_has_side_effects (t
) && cfun
->has_nonlocal_label
;
2861 /* Return true if STMT should start a new basic block. PREV_STMT is
2862 the statement preceding STMT. It is used when STMT is a label or a
2863 case label. Labels should only start a new basic block if their
2864 previous statement wasn't a label. Otherwise, sequence of labels
2865 would generate unnecessary basic blocks that only contain a single
2869 stmt_starts_bb_p (gimple stmt
, gimple prev_stmt
)
2874 /* Labels start a new basic block only if the preceding statement
2875 wasn't a label of the same type. This prevents the creation of
2876 consecutive blocks that have nothing but a single label. */
2877 if (gimple_code (stmt
) == GIMPLE_LABEL
)
2879 /* Nonlocal and computed GOTO targets always start a new block. */
2880 if (DECL_NONLOCAL (gimple_label_label (stmt
))
2881 || FORCED_LABEL (gimple_label_label (stmt
)))
2884 if (prev_stmt
&& gimple_code (prev_stmt
) == GIMPLE_LABEL
)
2886 if (DECL_NONLOCAL (gimple_label_label (prev_stmt
)))
2889 cfg_stats
.num_merged_labels
++;
2900 /* Return true if T should end a basic block. */
2903 stmt_ends_bb_p (gimple t
)
2905 return is_ctrl_stmt (t
) || is_ctrl_altering_stmt (t
);
2908 /* Remove block annotations and other data structures. */
2911 delete_tree_cfg_annotations (void)
2913 label_to_block_map
= NULL
;
2917 /* Return the first statement in basic block BB. */
2920 first_stmt (basic_block bb
)
2922 gimple_stmt_iterator i
= gsi_start_bb (bb
);
2925 while (!gsi_end_p (i
) && is_gimple_debug ((stmt
= gsi_stmt (i
))))
2933 /* Return the first non-label statement in basic block BB. */
2936 first_non_label_stmt (basic_block bb
)
2938 gimple_stmt_iterator i
= gsi_start_bb (bb
);
2939 while (!gsi_end_p (i
) && gimple_code (gsi_stmt (i
)) == GIMPLE_LABEL
)
2941 return !gsi_end_p (i
) ? gsi_stmt (i
) : NULL
;
2944 /* Return the last statement in basic block BB. */
2947 last_stmt (basic_block bb
)
2949 gimple_stmt_iterator i
= gsi_last_bb (bb
);
2952 while (!gsi_end_p (i
) && is_gimple_debug ((stmt
= gsi_stmt (i
))))
2960 /* Return the last statement of an otherwise empty block. Return NULL
2961 if the block is totally empty, or if it contains more than one
2965 last_and_only_stmt (basic_block bb
)
2967 gimple_stmt_iterator i
= gsi_last_nondebug_bb (bb
);
2973 last
= gsi_stmt (i
);
2974 gsi_prev_nondebug (&i
);
2978 /* Empty statements should no longer appear in the instruction stream.
2979 Everything that might have appeared before should be deleted by
2980 remove_useless_stmts, and the optimizers should just gsi_remove
2981 instead of smashing with build_empty_stmt.
2983 Thus the only thing that should appear here in a block containing
2984 one executable statement is a label. */
2985 prev
= gsi_stmt (i
);
2986 if (gimple_code (prev
) == GIMPLE_LABEL
)
2992 /* Reinstall those PHI arguments queued in OLD_EDGE to NEW_EDGE. */
2995 reinstall_phi_args (edge new_edge
, edge old_edge
)
2997 edge_var_map_vector v
;
3000 gimple_stmt_iterator phis
;
3002 v
= redirect_edge_var_map_vector (old_edge
);
3006 for (i
= 0, phis
= gsi_start_phis (new_edge
->dest
);
3007 VEC_iterate (edge_var_map
, v
, i
, vm
) && !gsi_end_p (phis
);
3008 i
++, gsi_next (&phis
))
3010 gimple phi
= gsi_stmt (phis
);
3011 tree result
= redirect_edge_var_map_result (vm
);
3012 tree arg
= redirect_edge_var_map_def (vm
);
3014 gcc_assert (result
== gimple_phi_result (phi
));
3016 add_phi_arg (phi
, arg
, new_edge
, redirect_edge_var_map_location (vm
));
3019 redirect_edge_var_map_clear (old_edge
);
3022 /* Returns the basic block after which the new basic block created
3023 by splitting edge EDGE_IN should be placed. Tries to keep the new block
3024 near its "logical" location. This is of most help to humans looking
3025 at debugging dumps. */
3028 split_edge_bb_loc (edge edge_in
)
3030 basic_block dest
= edge_in
->dest
;
3031 basic_block dest_prev
= dest
->prev_bb
;
3035 edge e
= find_edge (dest_prev
, dest
);
3036 if (e
&& !(e
->flags
& EDGE_COMPLEX
))
3037 return edge_in
->src
;
3042 /* Split a (typically critical) edge EDGE_IN. Return the new block.
3043 Abort on abnormal edges. */
3046 gimple_split_edge (edge edge_in
)
3048 basic_block new_bb
, after_bb
, dest
;
3051 /* Abnormal edges cannot be split. */
3052 gcc_assert (!(edge_in
->flags
& EDGE_ABNORMAL
));
3054 dest
= edge_in
->dest
;
3056 after_bb
= split_edge_bb_loc (edge_in
);
3058 new_bb
= create_empty_bb (after_bb
);
3059 new_bb
->frequency
= EDGE_FREQUENCY (edge_in
);
3060 new_bb
->count
= edge_in
->count
;
3061 new_edge
= make_edge (new_bb
, dest
, EDGE_FALLTHRU
);
3062 new_edge
->probability
= REG_BR_PROB_BASE
;
3063 new_edge
->count
= edge_in
->count
;
3065 e
= redirect_edge_and_branch (edge_in
, new_bb
);
3066 gcc_assert (e
== edge_in
);
3067 reinstall_phi_args (new_edge
, e
);
3072 /* Callback for walk_tree, check that all elements with address taken are
3073 properly noticed as such. The DATA is an int* that is 1 if TP was seen
3074 inside a PHI node. */
3077 verify_expr (tree
*tp
, int *walk_subtrees
, void *data ATTRIBUTE_UNUSED
)
3084 /* Check operand N for being valid GIMPLE and give error MSG if not. */
3085 #define CHECK_OP(N, MSG) \
3086 do { if (!is_gimple_val (TREE_OPERAND (t, N))) \
3087 { error (MSG); return TREE_OPERAND (t, N); }} while (0)
3089 switch (TREE_CODE (t
))
3092 if (SSA_NAME_IN_FREE_LIST (t
))
3094 error ("SSA name in freelist but still referenced");
3100 x
= TREE_OPERAND (t
, 0);
3101 if (!is_gimple_reg (x
) && !is_gimple_min_invariant (x
))
3103 error ("Indirect reference's operand is not a register or a constant.");
3109 x
= fold (ASSERT_EXPR_COND (t
));
3110 if (x
== boolean_false_node
)
3112 error ("ASSERT_EXPR with an always-false condition");
3118 error ("MODIFY_EXPR not expected while having tuples.");
3124 bool old_side_effects
;
3126 bool new_side_effects
;
3128 gcc_assert (is_gimple_address (t
));
3130 old_constant
= TREE_CONSTANT (t
);
3131 old_side_effects
= TREE_SIDE_EFFECTS (t
);
3133 recompute_tree_invariant_for_addr_expr (t
);
3134 new_side_effects
= TREE_SIDE_EFFECTS (t
);
3135 new_constant
= TREE_CONSTANT (t
);
3137 if (old_constant
!= new_constant
)
3139 error ("constant not recomputed when ADDR_EXPR changed");
3142 if (old_side_effects
!= new_side_effects
)
3144 error ("side effects not recomputed when ADDR_EXPR changed");
3148 /* Skip any references (they will be checked when we recurse down the
3149 tree) and ensure that any variable used as a prefix is marked
3151 for (x
= TREE_OPERAND (t
, 0);
3152 handled_component_p (x
);
3153 x
= TREE_OPERAND (x
, 0))
3156 if (!(TREE_CODE (x
) == VAR_DECL
3157 || TREE_CODE (x
) == PARM_DECL
3158 || TREE_CODE (x
) == RESULT_DECL
))
3160 if (!TREE_ADDRESSABLE (x
))
3162 error ("address taken, but ADDRESSABLE bit not set");
3165 if (DECL_GIMPLE_REG_P (x
))
3167 error ("DECL_GIMPLE_REG_P set on a variable with address taken");
3175 x
= COND_EXPR_COND (t
);
3176 if (!INTEGRAL_TYPE_P (TREE_TYPE (x
)))
3178 error ("non-integral used in condition");
3181 if (!is_gimple_condexpr (x
))
3183 error ("invalid conditional operand");
3188 case NON_LVALUE_EXPR
:
3192 case FIX_TRUNC_EXPR
:
3197 case TRUTH_NOT_EXPR
:
3198 CHECK_OP (0, "invalid operand to unary operator");
3205 case ARRAY_RANGE_REF
:
3207 case VIEW_CONVERT_EXPR
:
3208 /* We have a nest of references. Verify that each of the operands
3209 that determine where to reference is either a constant or a variable,
3210 verify that the base is valid, and then show we've already checked
3212 while (handled_component_p (t
))
3214 if (TREE_CODE (t
) == COMPONENT_REF
&& TREE_OPERAND (t
, 2))
3215 CHECK_OP (2, "invalid COMPONENT_REF offset operator");
3216 else if (TREE_CODE (t
) == ARRAY_REF
3217 || TREE_CODE (t
) == ARRAY_RANGE_REF
)
3219 CHECK_OP (1, "invalid array index");
3220 if (TREE_OPERAND (t
, 2))
3221 CHECK_OP (2, "invalid array lower bound");
3222 if (TREE_OPERAND (t
, 3))
3223 CHECK_OP (3, "invalid array stride");
3225 else if (TREE_CODE (t
) == BIT_FIELD_REF
)
3227 if (!host_integerp (TREE_OPERAND (t
, 1), 1)
3228 || !host_integerp (TREE_OPERAND (t
, 2), 1))
3230 error ("invalid position or size operand to BIT_FIELD_REF");
3233 else if (INTEGRAL_TYPE_P (TREE_TYPE (t
))
3234 && (TYPE_PRECISION (TREE_TYPE (t
))
3235 != TREE_INT_CST_LOW (TREE_OPERAND (t
, 1))))
3237 error ("integral result type precision does not match "
3238 "field size of BIT_FIELD_REF");
3241 if (!INTEGRAL_TYPE_P (TREE_TYPE (t
))
3242 && (GET_MODE_PRECISION (TYPE_MODE (TREE_TYPE (t
)))
3243 != TREE_INT_CST_LOW (TREE_OPERAND (t
, 1))))
3245 error ("mode precision of non-integral result does not "
3246 "match field size of BIT_FIELD_REF");
3251 t
= TREE_OPERAND (t
, 0);
3254 if (!is_gimple_min_invariant (t
) && !is_gimple_lvalue (t
))
3256 error ("invalid reference prefix");
3263 /* PLUS_EXPR and MINUS_EXPR don't work on pointers, they should be done using
3264 POINTER_PLUS_EXPR. */
3265 if (POINTER_TYPE_P (TREE_TYPE (t
)))
3267 error ("invalid operand to plus/minus, type is a pointer");
3270 CHECK_OP (0, "invalid operand to binary operator");
3271 CHECK_OP (1, "invalid operand to binary operator");
3274 case POINTER_PLUS_EXPR
:
3275 /* Check to make sure the first operand is a pointer or reference type. */
3276 if (!POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (t
, 0))))
3278 error ("invalid operand to pointer plus, first operand is not a pointer");
3281 /* Check to make sure the second operand is an integer with type of
3283 if (!useless_type_conversion_p (sizetype
,
3284 TREE_TYPE (TREE_OPERAND (t
, 1))))
3286 error ("invalid operand to pointer plus, second operand is not an "
3287 "integer with type of sizetype.");
3297 case UNORDERED_EXPR
:
3306 case TRUNC_DIV_EXPR
:
3308 case FLOOR_DIV_EXPR
:
3309 case ROUND_DIV_EXPR
:
3310 case TRUNC_MOD_EXPR
:
3312 case FLOOR_MOD_EXPR
:
3313 case ROUND_MOD_EXPR
:
3315 case EXACT_DIV_EXPR
:
3325 CHECK_OP (0, "invalid operand to binary operator");
3326 CHECK_OP (1, "invalid operand to binary operator");
3330 if (TREE_CONSTANT (t
) && TREE_CODE (TREE_TYPE (t
)) == VECTOR_TYPE
)
3343 /* Verify if EXPR is either a GIMPLE ID or a GIMPLE indirect reference.
3344 Returns true if there is an error, otherwise false. */
3347 verify_types_in_gimple_min_lval (tree expr
)
3351 if (is_gimple_id (expr
))
3354 if (!INDIRECT_REF_P (expr
)
3355 && TREE_CODE (expr
) != TARGET_MEM_REF
)
3357 error ("invalid expression for min lvalue");
3361 /* TARGET_MEM_REFs are strange beasts. */
3362 if (TREE_CODE (expr
) == TARGET_MEM_REF
)
3365 op
= TREE_OPERAND (expr
, 0);
3366 if (!is_gimple_val (op
))
3368 error ("invalid operand in indirect reference");
3369 debug_generic_stmt (op
);
3372 if (!useless_type_conversion_p (TREE_TYPE (expr
),
3373 TREE_TYPE (TREE_TYPE (op
))))
3375 error ("type mismatch in indirect reference");
3376 debug_generic_stmt (TREE_TYPE (expr
));
3377 debug_generic_stmt (TREE_TYPE (TREE_TYPE (op
)));
3384 /* Verify if EXPR is a valid GIMPLE reference expression. If
3385 REQUIRE_LVALUE is true verifies it is an lvalue. Returns true
3386 if there is an error, otherwise false. */
3389 verify_types_in_gimple_reference (tree expr
, bool require_lvalue
)
3391 while (handled_component_p (expr
))
3393 tree op
= TREE_OPERAND (expr
, 0);
3395 if (TREE_CODE (expr
) == ARRAY_REF
3396 || TREE_CODE (expr
) == ARRAY_RANGE_REF
)
3398 if (!is_gimple_val (TREE_OPERAND (expr
, 1))
3399 || (TREE_OPERAND (expr
, 2)
3400 && !is_gimple_val (TREE_OPERAND (expr
, 2)))
3401 || (TREE_OPERAND (expr
, 3)
3402 && !is_gimple_val (TREE_OPERAND (expr
, 3))))
3404 error ("invalid operands to array reference");
3405 debug_generic_stmt (expr
);
3410 /* Verify if the reference array element types are compatible. */
3411 if (TREE_CODE (expr
) == ARRAY_REF
3412 && !useless_type_conversion_p (TREE_TYPE (expr
),
3413 TREE_TYPE (TREE_TYPE (op
))))
3415 error ("type mismatch in array reference");
3416 debug_generic_stmt (TREE_TYPE (expr
));
3417 debug_generic_stmt (TREE_TYPE (TREE_TYPE (op
)));
3420 if (TREE_CODE (expr
) == ARRAY_RANGE_REF
3421 && !useless_type_conversion_p (TREE_TYPE (TREE_TYPE (expr
)),
3422 TREE_TYPE (TREE_TYPE (op
))))
3424 error ("type mismatch in array range reference");
3425 debug_generic_stmt (TREE_TYPE (TREE_TYPE (expr
)));
3426 debug_generic_stmt (TREE_TYPE (TREE_TYPE (op
)));
3430 if ((TREE_CODE (expr
) == REALPART_EXPR
3431 || TREE_CODE (expr
) == IMAGPART_EXPR
)
3432 && !useless_type_conversion_p (TREE_TYPE (expr
),
3433 TREE_TYPE (TREE_TYPE (op
))))
3435 error ("type mismatch in real/imagpart reference");
3436 debug_generic_stmt (TREE_TYPE (expr
));
3437 debug_generic_stmt (TREE_TYPE (TREE_TYPE (op
)));
3441 if (TREE_CODE (expr
) == COMPONENT_REF
3442 && !useless_type_conversion_p (TREE_TYPE (expr
),
3443 TREE_TYPE (TREE_OPERAND (expr
, 1))))
3445 error ("type mismatch in component reference");
3446 debug_generic_stmt (TREE_TYPE (expr
));
3447 debug_generic_stmt (TREE_TYPE (TREE_OPERAND (expr
, 1)));
3451 /* For VIEW_CONVERT_EXPRs which are allowed here, too, there
3452 is nothing to verify. Gross mismatches at most invoke
3453 undefined behavior. */
3454 if (TREE_CODE (expr
) == VIEW_CONVERT_EXPR
3455 && !handled_component_p (op
))
3461 return ((require_lvalue
|| !is_gimple_min_invariant (expr
))
3462 && verify_types_in_gimple_min_lval (expr
));
3465 /* Returns true if there is one pointer type in TYPE_POINTER_TO (SRC_OBJ)
3466 list of pointer-to types that is trivially convertible to DEST. */
3469 one_pointer_to_useless_type_conversion_p (tree dest
, tree src_obj
)
3473 if (!TYPE_POINTER_TO (src_obj
))
3476 for (src
= TYPE_POINTER_TO (src_obj
); src
; src
= TYPE_NEXT_PTR_TO (src
))
3477 if (useless_type_conversion_p (dest
, src
))
3483 /* Return true if TYPE1 is a fixed-point type and if conversions to and
3484 from TYPE2 can be handled by FIXED_CONVERT_EXPR. */
3487 valid_fixed_convert_types_p (tree type1
, tree type2
)
3489 return (FIXED_POINT_TYPE_P (type1
)
3490 && (INTEGRAL_TYPE_P (type2
)
3491 || SCALAR_FLOAT_TYPE_P (type2
)
3492 || FIXED_POINT_TYPE_P (type2
)));
3495 /* Verify the contents of a GIMPLE_CALL STMT. Returns true when there
3496 is a problem, otherwise false. */
3499 verify_gimple_call (gimple stmt
)
3501 tree fn
= gimple_call_fn (stmt
);
3504 if (!POINTER_TYPE_P (TREE_TYPE (fn
))
3505 || (TREE_CODE (TREE_TYPE (TREE_TYPE (fn
))) != FUNCTION_TYPE
3506 && TREE_CODE (TREE_TYPE (TREE_TYPE (fn
))) != METHOD_TYPE
))
3508 error ("non-function in gimple call");
3512 if (gimple_call_lhs (stmt
)
3513 && !is_gimple_lvalue (gimple_call_lhs (stmt
)))
3515 error ("invalid LHS in gimple call");
3519 fntype
= TREE_TYPE (TREE_TYPE (fn
));
3520 if (gimple_call_lhs (stmt
)
3521 && !useless_type_conversion_p (TREE_TYPE (gimple_call_lhs (stmt
)),
3523 /* ??? At least C++ misses conversions at assignments from
3524 void * call results.
3525 ??? Java is completely off. Especially with functions
3526 returning java.lang.Object.
3527 For now simply allow arbitrary pointer type conversions. */
3528 && !(POINTER_TYPE_P (TREE_TYPE (gimple_call_lhs (stmt
)))
3529 && POINTER_TYPE_P (TREE_TYPE (fntype
))))
3531 error ("invalid conversion in gimple call");
3532 debug_generic_stmt (TREE_TYPE (gimple_call_lhs (stmt
)));
3533 debug_generic_stmt (TREE_TYPE (fntype
));
3537 /* ??? The C frontend passes unpromoted arguments in case it
3538 didn't see a function declaration before the call. So for now
3539 leave the call arguments unverified. Once we gimplify
3540 unit-at-a-time we have a chance to fix this. */
3545 /* Verifies the gimple comparison with the result type TYPE and
3546 the operands OP0 and OP1. */
3549 verify_gimple_comparison (tree type
, tree op0
, tree op1
)
3551 tree op0_type
= TREE_TYPE (op0
);
3552 tree op1_type
= TREE_TYPE (op1
);
3554 if (!is_gimple_val (op0
) || !is_gimple_val (op1
))
3556 error ("invalid operands in gimple comparison");
3560 /* For comparisons we do not have the operations type as the
3561 effective type the comparison is carried out in. Instead
3562 we require that either the first operand is trivially
3563 convertible into the second, or the other way around.
3564 The resulting type of a comparison may be any integral type.
3565 Because we special-case pointers to void we allow
3566 comparisons of pointers with the same mode as well. */
3567 if ((!useless_type_conversion_p (op0_type
, op1_type
)
3568 && !useless_type_conversion_p (op1_type
, op0_type
)
3569 && (!POINTER_TYPE_P (op0_type
)
3570 || !POINTER_TYPE_P (op1_type
)
3571 || TYPE_MODE (op0_type
) != TYPE_MODE (op1_type
)))
3572 || !INTEGRAL_TYPE_P (type
))
3574 error ("type mismatch in comparison expression");
3575 debug_generic_expr (type
);
3576 debug_generic_expr (op0_type
);
3577 debug_generic_expr (op1_type
);
3584 /* Verify a gimple assignment statement STMT with an unary rhs.
3585 Returns true if anything is wrong. */
3588 verify_gimple_assign_unary (gimple stmt
)
3590 enum tree_code rhs_code
= gimple_assign_rhs_code (stmt
);
3591 tree lhs
= gimple_assign_lhs (stmt
);
3592 tree lhs_type
= TREE_TYPE (lhs
);
3593 tree rhs1
= gimple_assign_rhs1 (stmt
);
3594 tree rhs1_type
= TREE_TYPE (rhs1
);
3596 if (!is_gimple_reg (lhs
)
3598 && TREE_CODE (lhs_type
) == COMPLEX_TYPE
))
3600 error ("non-register as LHS of unary operation");
3604 if (!is_gimple_val (rhs1
))
3606 error ("invalid operand in unary operation");
3610 /* First handle conversions. */
3615 /* Allow conversions between integral types and pointers only if
3616 there is no sign or zero extension involved.
3617 For targets were the precision of sizetype doesn't match that
3618 of pointers we need to allow arbitrary conversions from and
3620 if ((POINTER_TYPE_P (lhs_type
)
3621 && INTEGRAL_TYPE_P (rhs1_type
)
3622 && (TYPE_PRECISION (lhs_type
) >= TYPE_PRECISION (rhs1_type
)
3623 || rhs1_type
== sizetype
))
3624 || (POINTER_TYPE_P (rhs1_type
)
3625 && INTEGRAL_TYPE_P (lhs_type
)
3626 && (TYPE_PRECISION (rhs1_type
) >= TYPE_PRECISION (lhs_type
)
3627 || lhs_type
== sizetype
)))
3630 /* Allow conversion from integer to offset type and vice versa. */
3631 if ((TREE_CODE (lhs_type
) == OFFSET_TYPE
3632 && TREE_CODE (rhs1_type
) == INTEGER_TYPE
)
3633 || (TREE_CODE (lhs_type
) == INTEGER_TYPE
3634 && TREE_CODE (rhs1_type
) == OFFSET_TYPE
))
3637 /* Otherwise assert we are converting between types of the
3639 if (INTEGRAL_TYPE_P (lhs_type
) != INTEGRAL_TYPE_P (rhs1_type
))
3641 error ("invalid types in nop conversion");
3642 debug_generic_expr (lhs_type
);
3643 debug_generic_expr (rhs1_type
);
3650 case FIXED_CONVERT_EXPR
:
3652 if (!valid_fixed_convert_types_p (lhs_type
, rhs1_type
)
3653 && !valid_fixed_convert_types_p (rhs1_type
, lhs_type
))
3655 error ("invalid types in fixed-point conversion");
3656 debug_generic_expr (lhs_type
);
3657 debug_generic_expr (rhs1_type
);
3666 if (!INTEGRAL_TYPE_P (rhs1_type
) || !SCALAR_FLOAT_TYPE_P (lhs_type
))
3668 error ("invalid types in conversion to floating point");
3669 debug_generic_expr (lhs_type
);
3670 debug_generic_expr (rhs1_type
);
3677 case FIX_TRUNC_EXPR
:
3679 if (!INTEGRAL_TYPE_P (lhs_type
) || !SCALAR_FLOAT_TYPE_P (rhs1_type
))
3681 error ("invalid types in conversion to integer");
3682 debug_generic_expr (lhs_type
);
3683 debug_generic_expr (rhs1_type
);
3690 case VEC_UNPACK_HI_EXPR
:
3691 case VEC_UNPACK_LO_EXPR
:
3692 case REDUC_MAX_EXPR
:
3693 case REDUC_MIN_EXPR
:
3694 case REDUC_PLUS_EXPR
:
3695 case VEC_UNPACK_FLOAT_HI_EXPR
:
3696 case VEC_UNPACK_FLOAT_LO_EXPR
:
3700 case TRUTH_NOT_EXPR
:
3705 case NON_LVALUE_EXPR
:
3713 /* For the remaining codes assert there is no conversion involved. */
3714 if (!useless_type_conversion_p (lhs_type
, rhs1_type
))
3716 error ("non-trivial conversion in unary operation");
3717 debug_generic_expr (lhs_type
);
3718 debug_generic_expr (rhs1_type
);
3725 /* Verify a gimple assignment statement STMT with a binary rhs.
3726 Returns true if anything is wrong. */
3729 verify_gimple_assign_binary (gimple stmt
)
3731 enum tree_code rhs_code
= gimple_assign_rhs_code (stmt
);
3732 tree lhs
= gimple_assign_lhs (stmt
);
3733 tree lhs_type
= TREE_TYPE (lhs
);
3734 tree rhs1
= gimple_assign_rhs1 (stmt
);
3735 tree rhs1_type
= TREE_TYPE (rhs1
);
3736 tree rhs2
= gimple_assign_rhs2 (stmt
);
3737 tree rhs2_type
= TREE_TYPE (rhs2
);
3739 if (!is_gimple_reg (lhs
)
3741 && TREE_CODE (lhs_type
) == COMPLEX_TYPE
))
3743 error ("non-register as LHS of binary operation");
3747 if (!is_gimple_val (rhs1
)
3748 || !is_gimple_val (rhs2
))
3750 error ("invalid operands in binary operation");
3754 /* First handle operations that involve different types. */
3759 if (TREE_CODE (lhs_type
) != COMPLEX_TYPE
3760 || !(INTEGRAL_TYPE_P (rhs1_type
)
3761 || SCALAR_FLOAT_TYPE_P (rhs1_type
))
3762 || !(INTEGRAL_TYPE_P (rhs2_type
)
3763 || SCALAR_FLOAT_TYPE_P (rhs2_type
)))
3765 error ("type mismatch in complex expression");
3766 debug_generic_expr (lhs_type
);
3767 debug_generic_expr (rhs1_type
);
3768 debug_generic_expr (rhs2_type
);
3780 /* Shifts and rotates are ok on integral types, fixed point
3781 types and integer vector types. */
3782 if ((!INTEGRAL_TYPE_P (rhs1_type
)
3783 && !FIXED_POINT_TYPE_P (rhs1_type
)
3784 && !(TREE_CODE (rhs1_type
) == VECTOR_TYPE
3785 && TREE_CODE (TREE_TYPE (rhs1_type
)) == INTEGER_TYPE
))
3786 || (!INTEGRAL_TYPE_P (rhs2_type
)
3787 /* Vector shifts of vectors are also ok. */
3788 && !(TREE_CODE (rhs1_type
) == VECTOR_TYPE
3789 && TREE_CODE (TREE_TYPE (rhs1_type
)) == INTEGER_TYPE
3790 && TREE_CODE (rhs2_type
) == VECTOR_TYPE
3791 && TREE_CODE (TREE_TYPE (rhs2_type
)) == INTEGER_TYPE
))
3792 || !useless_type_conversion_p (lhs_type
, rhs1_type
))
3794 error ("type mismatch in shift expression");
3795 debug_generic_expr (lhs_type
);
3796 debug_generic_expr (rhs1_type
);
3797 debug_generic_expr (rhs2_type
);
3804 case VEC_LSHIFT_EXPR
:
3805 case VEC_RSHIFT_EXPR
:
3807 if (TREE_CODE (rhs1_type
) != VECTOR_TYPE
3808 || !(INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type
))
3809 || FIXED_POINT_TYPE_P (TREE_TYPE (rhs1_type
))
3810 || SCALAR_FLOAT_TYPE_P (TREE_TYPE (rhs1_type
)))
3811 || (!INTEGRAL_TYPE_P (rhs2_type
)
3812 && (TREE_CODE (rhs2_type
) != VECTOR_TYPE
3813 || !INTEGRAL_TYPE_P (TREE_TYPE (rhs2_type
))))
3814 || !useless_type_conversion_p (lhs_type
, rhs1_type
))
3816 error ("type mismatch in vector shift expression");
3817 debug_generic_expr (lhs_type
);
3818 debug_generic_expr (rhs1_type
);
3819 debug_generic_expr (rhs2_type
);
3822 /* For shifting a vector of floating point components we
3823 only allow shifting by a constant multiple of the element size. */
3824 if (SCALAR_FLOAT_TYPE_P (TREE_TYPE (rhs1_type
))
3825 && (TREE_CODE (rhs2
) != INTEGER_CST
3826 || !div_if_zero_remainder (EXACT_DIV_EXPR
, rhs2
,
3827 TYPE_SIZE (TREE_TYPE (rhs1_type
)))))
3829 error ("non-element sized vector shift of floating point vector");
3838 /* We use regular PLUS_EXPR for vectors.
3839 ??? This just makes the checker happy and may not be what is
3841 if (TREE_CODE (lhs_type
) == VECTOR_TYPE
3842 && POINTER_TYPE_P (TREE_TYPE (lhs_type
)))
3844 if (TREE_CODE (rhs1_type
) != VECTOR_TYPE
3845 || TREE_CODE (rhs2_type
) != VECTOR_TYPE
)
3847 error ("invalid non-vector operands to vector valued plus");
3850 lhs_type
= TREE_TYPE (lhs_type
);
3851 rhs1_type
= TREE_TYPE (rhs1_type
);
3852 rhs2_type
= TREE_TYPE (rhs2_type
);
3853 /* PLUS_EXPR is commutative, so we might end up canonicalizing
3854 the pointer to 2nd place. */
3855 if (POINTER_TYPE_P (rhs2_type
))
3857 tree tem
= rhs1_type
;
3858 rhs1_type
= rhs2_type
;
3861 goto do_pointer_plus_expr_check
;
3867 if (POINTER_TYPE_P (lhs_type
)
3868 || POINTER_TYPE_P (rhs1_type
)
3869 || POINTER_TYPE_P (rhs2_type
))
3871 error ("invalid (pointer) operands to plus/minus");
3875 /* Continue with generic binary expression handling. */
3879 case POINTER_PLUS_EXPR
:
3881 do_pointer_plus_expr_check
:
3882 if (!POINTER_TYPE_P (rhs1_type
)
3883 || !useless_type_conversion_p (lhs_type
, rhs1_type
)
3884 || !useless_type_conversion_p (sizetype
, rhs2_type
))
3886 error ("type mismatch in pointer plus expression");
3887 debug_generic_stmt (lhs_type
);
3888 debug_generic_stmt (rhs1_type
);
3889 debug_generic_stmt (rhs2_type
);
3896 case TRUTH_ANDIF_EXPR
:
3897 case TRUTH_ORIF_EXPR
:
3900 case TRUTH_AND_EXPR
:
3902 case TRUTH_XOR_EXPR
:
3904 /* We allow any kind of integral typed argument and result. */
3905 if (!INTEGRAL_TYPE_P (rhs1_type
)
3906 || !INTEGRAL_TYPE_P (rhs2_type
)
3907 || !INTEGRAL_TYPE_P (lhs_type
))
3909 error ("type mismatch in binary truth expression");
3910 debug_generic_expr (lhs_type
);
3911 debug_generic_expr (rhs1_type
);
3912 debug_generic_expr (rhs2_type
);
3925 case UNORDERED_EXPR
:
3933 /* Comparisons are also binary, but the result type is not
3934 connected to the operand types. */
3935 return verify_gimple_comparison (lhs_type
, rhs1
, rhs2
);
3937 case WIDEN_SUM_EXPR
:
3938 case WIDEN_MULT_EXPR
:
3939 case VEC_WIDEN_MULT_HI_EXPR
:
3940 case VEC_WIDEN_MULT_LO_EXPR
:
3941 case VEC_PACK_TRUNC_EXPR
:
3942 case VEC_PACK_SAT_EXPR
:
3943 case VEC_PACK_FIX_TRUNC_EXPR
:
3944 case VEC_EXTRACT_EVEN_EXPR
:
3945 case VEC_EXTRACT_ODD_EXPR
:
3946 case VEC_INTERLEAVE_HIGH_EXPR
:
3947 case VEC_INTERLEAVE_LOW_EXPR
:
3952 case TRUNC_DIV_EXPR
:
3954 case FLOOR_DIV_EXPR
:
3955 case ROUND_DIV_EXPR
:
3956 case TRUNC_MOD_EXPR
:
3958 case FLOOR_MOD_EXPR
:
3959 case ROUND_MOD_EXPR
:
3961 case EXACT_DIV_EXPR
:
3967 /* Continue with generic binary expression handling. */
3974 if (!useless_type_conversion_p (lhs_type
, rhs1_type
)
3975 || !useless_type_conversion_p (lhs_type
, rhs2_type
))
3977 error ("type mismatch in binary expression");
3978 debug_generic_stmt (lhs_type
);
3979 debug_generic_stmt (rhs1_type
);
3980 debug_generic_stmt (rhs2_type
);
3987 /* Verify a gimple assignment statement STMT with a single rhs.
3988 Returns true if anything is wrong. */
3991 verify_gimple_assign_single (gimple stmt
)
3993 enum tree_code rhs_code
= gimple_assign_rhs_code (stmt
);
3994 tree lhs
= gimple_assign_lhs (stmt
);
3995 tree lhs_type
= TREE_TYPE (lhs
);
3996 tree rhs1
= gimple_assign_rhs1 (stmt
);
3997 tree rhs1_type
= TREE_TYPE (rhs1
);
4000 if (!useless_type_conversion_p (lhs_type
, rhs1_type
))
4002 error ("non-trivial conversion at assignment");
4003 debug_generic_expr (lhs_type
);
4004 debug_generic_expr (rhs1_type
);
4008 if (handled_component_p (lhs
))
4009 res
|= verify_types_in_gimple_reference (lhs
, true);
4011 /* Special codes we cannot handle via their class. */
4016 tree op
= TREE_OPERAND (rhs1
, 0);
4017 if (!is_gimple_addressable (op
))
4019 error ("invalid operand in unary expression");
4023 if (!types_compatible_p (TREE_TYPE (op
), TREE_TYPE (TREE_TYPE (rhs1
)))
4024 && !one_pointer_to_useless_type_conversion_p (TREE_TYPE (rhs1
),
4027 error ("type mismatch in address expression");
4028 debug_generic_stmt (TREE_TYPE (rhs1
));
4029 debug_generic_stmt (TREE_TYPE (op
));
4033 return verify_types_in_gimple_reference (op
, true);
4040 case ALIGN_INDIRECT_REF
:
4041 case MISALIGNED_INDIRECT_REF
:
4043 case ARRAY_RANGE_REF
:
4044 case VIEW_CONVERT_EXPR
:
4047 case TARGET_MEM_REF
:
4048 if (!is_gimple_reg (lhs
)
4049 && is_gimple_reg_type (TREE_TYPE (lhs
)))
4051 error ("invalid rhs for gimple memory store");
4052 debug_generic_stmt (lhs
);
4053 debug_generic_stmt (rhs1
);
4056 return res
|| verify_types_in_gimple_reference (rhs1
, false);
4068 /* tcc_declaration */
4073 if (!is_gimple_reg (lhs
)
4074 && !is_gimple_reg (rhs1
)
4075 && is_gimple_reg_type (TREE_TYPE (lhs
)))
4077 error ("invalid rhs for gimple memory store");
4078 debug_generic_stmt (lhs
);
4079 debug_generic_stmt (rhs1
);
4088 case WITH_SIZE_EXPR
:
4089 case POLYNOMIAL_CHREC
:
4092 case REALIGN_LOAD_EXPR
:
4102 /* Verify the contents of a GIMPLE_ASSIGN STMT. Returns true when there
4103 is a problem, otherwise false. */
4106 verify_gimple_assign (gimple stmt
)
4108 switch (gimple_assign_rhs_class (stmt
))
4110 case GIMPLE_SINGLE_RHS
:
4111 return verify_gimple_assign_single (stmt
);
4113 case GIMPLE_UNARY_RHS
:
4114 return verify_gimple_assign_unary (stmt
);
4116 case GIMPLE_BINARY_RHS
:
4117 return verify_gimple_assign_binary (stmt
);
4124 /* Verify the contents of a GIMPLE_RETURN STMT. Returns true when there
4125 is a problem, otherwise false. */
4128 verify_gimple_return (gimple stmt
)
4130 tree op
= gimple_return_retval (stmt
);
4131 tree restype
= TREE_TYPE (TREE_TYPE (cfun
->decl
));
4133 /* We cannot test for present return values as we do not fix up missing
4134 return values from the original source. */
4138 if (!is_gimple_val (op
)
4139 && TREE_CODE (op
) != RESULT_DECL
)
4141 error ("invalid operand in return statement");
4142 debug_generic_stmt (op
);
4146 if (!useless_type_conversion_p (restype
, TREE_TYPE (op
))
4147 /* ??? With C++ we can have the situation that the result
4148 decl is a reference type while the return type is an aggregate. */
4149 && !(TREE_CODE (op
) == RESULT_DECL
4150 && TREE_CODE (TREE_TYPE (op
)) == REFERENCE_TYPE
4151 && useless_type_conversion_p (restype
, TREE_TYPE (TREE_TYPE (op
)))))
4153 error ("invalid conversion in return statement");
4154 debug_generic_stmt (restype
);
4155 debug_generic_stmt (TREE_TYPE (op
));
4163 /* Verify the contents of a GIMPLE_GOTO STMT. Returns true when there
4164 is a problem, otherwise false. */
4167 verify_gimple_goto (gimple stmt
)
4169 tree dest
= gimple_goto_dest (stmt
);
4171 /* ??? We have two canonical forms of direct goto destinations, a
4172 bare LABEL_DECL and an ADDR_EXPR of a LABEL_DECL. */
4173 if (TREE_CODE (dest
) != LABEL_DECL
4174 && (!is_gimple_val (dest
)
4175 || !POINTER_TYPE_P (TREE_TYPE (dest
))))
4177 error ("goto destination is neither a label nor a pointer");
4184 /* Verify the contents of a GIMPLE_SWITCH STMT. Returns true when there
4185 is a problem, otherwise false. */
4188 verify_gimple_switch (gimple stmt
)
4190 if (!is_gimple_val (gimple_switch_index (stmt
)))
4192 error ("invalid operand to switch statement");
4193 debug_generic_stmt (gimple_switch_index (stmt
));
4201 /* Verify the contents of a GIMPLE_PHI. Returns true if there is a problem,
4202 and false otherwise. */
4205 verify_gimple_phi (gimple stmt
)
4207 tree type
= TREE_TYPE (gimple_phi_result (stmt
));
4210 if (TREE_CODE (gimple_phi_result (stmt
)) != SSA_NAME
)
4212 error ("Invalid PHI result");
4216 for (i
= 0; i
< gimple_phi_num_args (stmt
); i
++)
4218 tree arg
= gimple_phi_arg_def (stmt
, i
);
4219 if ((is_gimple_reg (gimple_phi_result (stmt
))
4220 && !is_gimple_val (arg
))
4221 || (!is_gimple_reg (gimple_phi_result (stmt
))
4222 && !is_gimple_addressable (arg
)))
4224 error ("Invalid PHI argument");
4225 debug_generic_stmt (arg
);
4228 if (!useless_type_conversion_p (type
, TREE_TYPE (arg
)))
4230 error ("Incompatible types in PHI argument %u", i
);
4231 debug_generic_stmt (type
);
4232 debug_generic_stmt (TREE_TYPE (arg
));
4241 /* Verify a gimple debug statement STMT.
4242 Returns true if anything is wrong. */
4245 verify_gimple_debug (gimple stmt ATTRIBUTE_UNUSED
)
4247 /* There isn't much that could be wrong in a gimple debug stmt. A
4248 gimple debug bind stmt, for example, maps a tree, that's usually
4249 a VAR_DECL or a PARM_DECL, but that could also be some scalarized
4250 component or member of an aggregate type, to another tree, that
4251 can be an arbitrary expression. These stmts expand into debug
4252 insns, and are converted to debug notes by var-tracking.c. */
4257 /* Verify the GIMPLE statement STMT. Returns true if there is an
4258 error, otherwise false. */
4261 verify_types_in_gimple_stmt (gimple stmt
)
4263 switch (gimple_code (stmt
))
4266 return verify_gimple_assign (stmt
);
4269 return TREE_CODE (gimple_label_label (stmt
)) != LABEL_DECL
;
4272 return verify_gimple_call (stmt
);
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
);
4292 return verify_gimple_phi (stmt
);
4294 /* Tuples that do not have tree operands. */
4296 case GIMPLE_PREDICT
:
4298 case GIMPLE_EH_DISPATCH
:
4302 /* OpenMP directives are validated by the FE and never operated
4303 on by the optimizers. Furthermore, GIMPLE_OMP_FOR may contain
4304 non-gimple expressions when the main index variable has had
4305 its address taken. This does not affect the loop itself
4306 because the header of an GIMPLE_OMP_FOR is merely used to determine
4307 how to setup the parallel iteration. */
4311 return verify_gimple_debug (stmt
);
4318 /* Verify the GIMPLE statements inside the sequence STMTS. */
4321 verify_types_in_gimple_seq_2 (gimple_seq stmts
)
4323 gimple_stmt_iterator ittr
;
4326 for (ittr
= gsi_start (stmts
); !gsi_end_p (ittr
); gsi_next (&ittr
))
4328 gimple stmt
= gsi_stmt (ittr
);
4330 switch (gimple_code (stmt
))
4333 err
|= verify_types_in_gimple_seq_2 (gimple_bind_body (stmt
));
4337 err
|= verify_types_in_gimple_seq_2 (gimple_try_eval (stmt
));
4338 err
|= verify_types_in_gimple_seq_2 (gimple_try_cleanup (stmt
));
4341 case GIMPLE_EH_FILTER
:
4342 err
|= verify_types_in_gimple_seq_2 (gimple_eh_filter_failure (stmt
));
4346 err
|= verify_types_in_gimple_seq_2 (gimple_catch_handler (stmt
));
4351 bool err2
= verify_types_in_gimple_stmt (stmt
);
4353 debug_gimple_stmt (stmt
);
4363 /* Verify the GIMPLE statements inside the statement list STMTS. */
4366 verify_types_in_gimple_seq (gimple_seq stmts
)
4368 if (verify_types_in_gimple_seq_2 (stmts
))
4369 internal_error ("verify_gimple failed");
4373 /* Verify STMT, return true if STMT is not in GIMPLE form.
4374 TODO: Implement type checking. */
4377 verify_stmt (gimple_stmt_iterator
*gsi
)
4380 struct walk_stmt_info wi
;
4381 bool last_in_block
= gsi_one_before_end_p (*gsi
);
4382 gimple stmt
= gsi_stmt (*gsi
);
4385 if (is_gimple_omp (stmt
))
4387 /* OpenMP directives are validated by the FE and never operated
4388 on by the optimizers. Furthermore, GIMPLE_OMP_FOR may contain
4389 non-gimple expressions when the main index variable has had
4390 its address taken. This does not affect the loop itself
4391 because the header of an GIMPLE_OMP_FOR is merely used to determine
4392 how to setup the parallel iteration. */
4396 /* FIXME. The C frontend passes unpromoted arguments in case it
4397 didn't see a function declaration before the call. */
4398 if (is_gimple_call (stmt
))
4402 if (!is_gimple_call_addr (gimple_call_fn (stmt
)))
4404 error ("invalid function in call statement");
4408 decl
= gimple_call_fndecl (stmt
);
4410 && TREE_CODE (decl
) == FUNCTION_DECL
4411 && DECL_LOOPING_CONST_OR_PURE_P (decl
)
4412 && (!DECL_PURE_P (decl
))
4413 && (!TREE_READONLY (decl
)))
4415 error ("invalid pure const state for function");
4420 if (is_gimple_debug (stmt
))
4423 memset (&wi
, 0, sizeof (wi
));
4424 addr
= walk_gimple_op (gsi_stmt (*gsi
), verify_expr
, &wi
);
4427 debug_generic_expr (addr
);
4428 inform (gimple_location (gsi_stmt (*gsi
)), "in statement");
4429 debug_gimple_stmt (stmt
);
4433 /* If the statement is marked as part of an EH region, then it is
4434 expected that the statement could throw. Verify that when we
4435 have optimizations that simplify statements such that we prove
4436 that they cannot throw, that we update other data structures
4438 lp_nr
= lookup_stmt_eh_lp (stmt
);
4441 if (!stmt_could_throw_p (stmt
))
4443 /* During IPA passes, ipa-pure-const sets nothrow flags on calls
4444 and they are updated on statements only after fixup_cfg
4445 is executed at beggining of expansion stage. */
4446 if (cgraph_state
!= CGRAPH_STATE_IPA_SSA
)
4448 error ("statement marked for throw, but doesn%'t");
4452 else if (lp_nr
> 0 && !last_in_block
&& stmt_can_throw_internal (stmt
))
4454 error ("statement marked for throw in middle of block");
4462 debug_gimple_stmt (stmt
);
4467 /* Return true when the T can be shared. */
4470 tree_node_can_be_shared (tree t
)
4472 if (IS_TYPE_OR_DECL_P (t
)
4473 || is_gimple_min_invariant (t
)
4474 || TREE_CODE (t
) == SSA_NAME
4475 || t
== error_mark_node
4476 || TREE_CODE (t
) == IDENTIFIER_NODE
)
4479 if (TREE_CODE (t
) == CASE_LABEL_EXPR
)
4482 while (((TREE_CODE (t
) == ARRAY_REF
|| TREE_CODE (t
) == ARRAY_RANGE_REF
)
4483 && is_gimple_min_invariant (TREE_OPERAND (t
, 1)))
4484 || TREE_CODE (t
) == COMPONENT_REF
4485 || TREE_CODE (t
) == REALPART_EXPR
4486 || TREE_CODE (t
) == IMAGPART_EXPR
)
4487 t
= TREE_OPERAND (t
, 0);
4496 /* Called via walk_gimple_stmt. Verify tree sharing. */
4499 verify_node_sharing (tree
*tp
, int *walk_subtrees
, void *data
)
4501 struct walk_stmt_info
*wi
= (struct walk_stmt_info
*) data
;
4502 struct pointer_set_t
*visited
= (struct pointer_set_t
*) wi
->info
;
4504 if (tree_node_can_be_shared (*tp
))
4506 *walk_subtrees
= false;
4510 if (pointer_set_insert (visited
, *tp
))
4517 static bool eh_error_found
;
4519 verify_eh_throw_stmt_node (void **slot
, void *data
)
4521 struct throw_stmt_node
*node
= (struct throw_stmt_node
*)*slot
;
4522 struct pointer_set_t
*visited
= (struct pointer_set_t
*) data
;
4524 if (!pointer_set_contains (visited
, node
->stmt
))
4526 error ("Dead STMT in EH table");
4527 debug_gimple_stmt (node
->stmt
);
4528 eh_error_found
= true;
4534 /* Verify the GIMPLE statements in every basic block. */
4540 gimple_stmt_iterator gsi
;
4542 struct pointer_set_t
*visited
, *visited_stmts
;
4544 struct walk_stmt_info wi
;
4546 timevar_push (TV_TREE_STMT_VERIFY
);
4547 visited
= pointer_set_create ();
4548 visited_stmts
= pointer_set_create ();
4550 memset (&wi
, 0, sizeof (wi
));
4551 wi
.info
= (void *) visited
;
4558 for (gsi
= gsi_start_phis (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
4560 phi
= gsi_stmt (gsi
);
4561 pointer_set_insert (visited_stmts
, phi
);
4562 if (gimple_bb (phi
) != bb
)
4564 error ("gimple_bb (phi) is set to a wrong basic block");
4568 for (i
= 0; i
< gimple_phi_num_args (phi
); i
++)
4570 tree t
= gimple_phi_arg_def (phi
, i
);
4575 error ("missing PHI def");
4576 debug_gimple_stmt (phi
);
4580 /* Addressable variables do have SSA_NAMEs but they
4581 are not considered gimple values. */
4582 else if (TREE_CODE (t
) != SSA_NAME
4583 && TREE_CODE (t
) != FUNCTION_DECL
4584 && !is_gimple_min_invariant (t
))
4586 error ("PHI argument is not a GIMPLE value");
4587 debug_gimple_stmt (phi
);
4588 debug_generic_expr (t
);
4592 addr
= walk_tree (&t
, verify_node_sharing
, visited
, NULL
);
4595 error ("incorrect sharing of tree nodes");
4596 debug_gimple_stmt (phi
);
4597 debug_generic_expr (addr
);
4602 #ifdef ENABLE_TYPES_CHECKING
4603 if (verify_gimple_phi (phi
))
4605 debug_gimple_stmt (phi
);
4611 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); )
4613 gimple stmt
= gsi_stmt (gsi
);
4615 if (gimple_code (stmt
) == GIMPLE_WITH_CLEANUP_EXPR
4616 || gimple_code (stmt
) == GIMPLE_BIND
)
4618 error ("invalid GIMPLE statement");
4619 debug_gimple_stmt (stmt
);
4623 pointer_set_insert (visited_stmts
, stmt
);
4625 if (gimple_bb (stmt
) != bb
)
4627 error ("gimple_bb (stmt) is set to a wrong basic block");
4628 debug_gimple_stmt (stmt
);
4632 if (gimple_code (stmt
) == GIMPLE_LABEL
)
4634 tree decl
= gimple_label_label (stmt
);
4635 int uid
= LABEL_DECL_UID (decl
);
4638 || VEC_index (basic_block
, label_to_block_map
, uid
) != bb
)
4640 error ("incorrect entry in label_to_block_map");
4644 uid
= EH_LANDING_PAD_NR (decl
);
4647 eh_landing_pad lp
= get_eh_landing_pad_from_number (uid
);
4648 if (decl
!= lp
->post_landing_pad
)
4650 error ("incorrect setting of landing pad number");
4656 err
|= verify_stmt (&gsi
);
4658 #ifdef ENABLE_TYPES_CHECKING
4659 if (verify_types_in_gimple_stmt (gsi_stmt (gsi
)))
4661 debug_gimple_stmt (stmt
);
4665 addr
= walk_gimple_op (gsi_stmt (gsi
), verify_node_sharing
, &wi
);
4668 error ("incorrect sharing of tree nodes");
4669 debug_gimple_stmt (stmt
);
4670 debug_generic_expr (addr
);
4677 eh_error_found
= false;
4678 if (get_eh_throw_stmt_table (cfun
))
4679 htab_traverse (get_eh_throw_stmt_table (cfun
),
4680 verify_eh_throw_stmt_node
,
4683 if (err
| eh_error_found
)
4684 internal_error ("verify_stmts failed");
4686 pointer_set_destroy (visited
);
4687 pointer_set_destroy (visited_stmts
);
4688 verify_histograms ();
4689 timevar_pop (TV_TREE_STMT_VERIFY
);
4693 /* Verifies that the flow information is OK. */
4696 gimple_verify_flow_info (void)
4700 gimple_stmt_iterator gsi
;
4705 if (ENTRY_BLOCK_PTR
->il
.gimple
)
4707 error ("ENTRY_BLOCK has IL associated with it");
4711 if (EXIT_BLOCK_PTR
->il
.gimple
)
4713 error ("EXIT_BLOCK has IL associated with it");
4717 FOR_EACH_EDGE (e
, ei
, EXIT_BLOCK_PTR
->preds
)
4718 if (e
->flags
& EDGE_FALLTHRU
)
4720 error ("fallthru to exit from bb %d", e
->src
->index
);
4726 bool found_ctrl_stmt
= false;
4730 /* Skip labels on the start of basic block. */
4731 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
4734 gimple prev_stmt
= stmt
;
4736 stmt
= gsi_stmt (gsi
);
4738 if (gimple_code (stmt
) != GIMPLE_LABEL
)
4741 label
= gimple_label_label (stmt
);
4742 if (prev_stmt
&& DECL_NONLOCAL (label
))
4744 error ("nonlocal label ");
4745 print_generic_expr (stderr
, label
, 0);
4746 fprintf (stderr
, " is not first in a sequence of labels in bb %d",
4751 if (label_to_block (label
) != bb
)
4754 print_generic_expr (stderr
, label
, 0);
4755 fprintf (stderr
, " to block does not match in bb %d",
4760 if (decl_function_context (label
) != current_function_decl
)
4763 print_generic_expr (stderr
, label
, 0);
4764 fprintf (stderr
, " has incorrect context in bb %d",
4770 /* Verify that body of basic block BB is free of control flow. */
4771 for (; !gsi_end_p (gsi
); gsi_next (&gsi
))
4773 gimple stmt
= gsi_stmt (gsi
);
4775 if (found_ctrl_stmt
)
4777 error ("control flow in the middle of basic block %d",
4782 if (stmt_ends_bb_p (stmt
))
4783 found_ctrl_stmt
= true;
4785 if (gimple_code (stmt
) == GIMPLE_LABEL
)
4788 print_generic_expr (stderr
, gimple_label_label (stmt
), 0);
4789 fprintf (stderr
, " in the middle of basic block %d", bb
->index
);
4794 gsi
= gsi_last_bb (bb
);
4795 if (gsi_end_p (gsi
))
4798 stmt
= gsi_stmt (gsi
);
4800 if (gimple_code (stmt
) == GIMPLE_LABEL
)
4803 err
|= verify_eh_edges (stmt
);
4805 if (is_ctrl_stmt (stmt
))
4807 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
4808 if (e
->flags
& EDGE_FALLTHRU
)
4810 error ("fallthru edge after a control statement in bb %d",
4816 if (gimple_code (stmt
) != GIMPLE_COND
)
4818 /* Verify that there are no edges with EDGE_TRUE/FALSE_FLAG set
4819 after anything else but if statement. */
4820 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
4821 if (e
->flags
& (EDGE_TRUE_VALUE
| EDGE_FALSE_VALUE
))
4823 error ("true/false edge after a non-GIMPLE_COND in bb %d",
4829 switch (gimple_code (stmt
))
4836 extract_true_false_edges_from_block (bb
, &true_edge
, &false_edge
);
4840 || !(true_edge
->flags
& EDGE_TRUE_VALUE
)
4841 || !(false_edge
->flags
& EDGE_FALSE_VALUE
)
4842 || (true_edge
->flags
& (EDGE_FALLTHRU
| EDGE_ABNORMAL
))
4843 || (false_edge
->flags
& (EDGE_FALLTHRU
| EDGE_ABNORMAL
))
4844 || EDGE_COUNT (bb
->succs
) >= 3)
4846 error ("wrong outgoing edge flags at end of bb %d",
4854 if (simple_goto_p (stmt
))
4856 error ("explicit goto at end of bb %d", bb
->index
);
4861 /* FIXME. We should double check that the labels in the
4862 destination blocks have their address taken. */
4863 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
4864 if ((e
->flags
& (EDGE_FALLTHRU
| EDGE_TRUE_VALUE
4865 | EDGE_FALSE_VALUE
))
4866 || !(e
->flags
& EDGE_ABNORMAL
))
4868 error ("wrong outgoing edge flags at end of bb %d",
4876 if (!single_succ_p (bb
)
4877 || (single_succ_edge (bb
)->flags
4878 & (EDGE_FALLTHRU
| EDGE_ABNORMAL
4879 | EDGE_TRUE_VALUE
| EDGE_FALSE_VALUE
)))
4881 error ("wrong outgoing edge flags at end of bb %d", bb
->index
);
4884 if (single_succ (bb
) != EXIT_BLOCK_PTR
)
4886 error ("return edge does not point to exit in bb %d",
4898 n
= gimple_switch_num_labels (stmt
);
4900 /* Mark all the destination basic blocks. */
4901 for (i
= 0; i
< n
; ++i
)
4903 tree lab
= CASE_LABEL (gimple_switch_label (stmt
, i
));
4904 basic_block label_bb
= label_to_block (lab
);
4905 gcc_assert (!label_bb
->aux
|| label_bb
->aux
== (void *)1);
4906 label_bb
->aux
= (void *)1;
4909 /* Verify that the case labels are sorted. */
4910 prev
= gimple_switch_label (stmt
, 0);
4911 for (i
= 1; i
< n
; ++i
)
4913 tree c
= gimple_switch_label (stmt
, i
);
4916 error ("found default case not at the start of "
4922 && !tree_int_cst_lt (CASE_LOW (prev
), CASE_LOW (c
)))
4924 error ("case labels not sorted: ");
4925 print_generic_expr (stderr
, prev
, 0);
4926 fprintf (stderr
," is greater than ");
4927 print_generic_expr (stderr
, c
, 0);
4928 fprintf (stderr
," but comes before it.\n");
4933 /* VRP will remove the default case if it can prove it will
4934 never be executed. So do not verify there always exists
4935 a default case here. */
4937 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
4941 error ("extra outgoing edge %d->%d",
4942 bb
->index
, e
->dest
->index
);
4946 e
->dest
->aux
= (void *)2;
4947 if ((e
->flags
& (EDGE_FALLTHRU
| EDGE_ABNORMAL
4948 | EDGE_TRUE_VALUE
| EDGE_FALSE_VALUE
)))
4950 error ("wrong outgoing edge flags at end of bb %d",
4956 /* Check that we have all of them. */
4957 for (i
= 0; i
< n
; ++i
)
4959 tree lab
= CASE_LABEL (gimple_switch_label (stmt
, i
));
4960 basic_block label_bb
= label_to_block (lab
);
4962 if (label_bb
->aux
!= (void *)2)
4964 error ("missing edge %i->%i", bb
->index
, label_bb
->index
);
4969 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
4970 e
->dest
->aux
= (void *)0;
4974 case GIMPLE_EH_DISPATCH
:
4975 err
|= verify_eh_dispatch_edge (stmt
);
4983 if (dom_info_state (CDI_DOMINATORS
) >= DOM_NO_FAST_QUERY
)
4984 verify_dominators (CDI_DOMINATORS
);
4990 /* Updates phi nodes after creating a forwarder block joined
4991 by edge FALLTHRU. */
4994 gimple_make_forwarder_block (edge fallthru
)
4998 basic_block dummy
, bb
;
5000 gimple_stmt_iterator gsi
;
5002 dummy
= fallthru
->src
;
5003 bb
= fallthru
->dest
;
5005 if (single_pred_p (bb
))
5008 /* If we redirected a branch we must create new PHI nodes at the
5010 for (gsi
= gsi_start_phis (dummy
); !gsi_end_p (gsi
); gsi_next (&gsi
))
5012 gimple phi
, new_phi
;
5014 phi
= gsi_stmt (gsi
);
5015 var
= gimple_phi_result (phi
);
5016 new_phi
= create_phi_node (var
, bb
);
5017 SSA_NAME_DEF_STMT (var
) = new_phi
;
5018 gimple_phi_set_result (phi
, make_ssa_name (SSA_NAME_VAR (var
), phi
));
5019 add_phi_arg (new_phi
, gimple_phi_result (phi
), fallthru
,
5023 /* Add the arguments we have stored on edges. */
5024 FOR_EACH_EDGE (e
, ei
, bb
->preds
)
5029 flush_pending_stmts (e
);
5034 /* Return a non-special label in the head of basic block BLOCK.
5035 Create one if it doesn't exist. */
5038 gimple_block_label (basic_block bb
)
5040 gimple_stmt_iterator i
, s
= gsi_start_bb (bb
);
5045 for (i
= s
; !gsi_end_p (i
); first
= false, gsi_next (&i
))
5047 stmt
= gsi_stmt (i
);
5048 if (gimple_code (stmt
) != GIMPLE_LABEL
)
5050 label
= gimple_label_label (stmt
);
5051 if (!DECL_NONLOCAL (label
))
5054 gsi_move_before (&i
, &s
);
5059 label
= create_artificial_label (UNKNOWN_LOCATION
);
5060 stmt
= gimple_build_label (label
);
5061 gsi_insert_before (&s
, stmt
, GSI_NEW_STMT
);
5066 /* Attempt to perform edge redirection by replacing a possibly complex
5067 jump instruction by a goto or by removing the jump completely.
5068 This can apply only if all edges now point to the same block. The
5069 parameters and return values are equivalent to
5070 redirect_edge_and_branch. */
5073 gimple_try_redirect_by_replacing_jump (edge e
, basic_block target
)
5075 basic_block src
= e
->src
;
5076 gimple_stmt_iterator i
;
5079 /* We can replace or remove a complex jump only when we have exactly
5081 if (EDGE_COUNT (src
->succs
) != 2
5082 /* Verify that all targets will be TARGET. Specifically, the
5083 edge that is not E must also go to TARGET. */
5084 || EDGE_SUCC (src
, EDGE_SUCC (src
, 0) == e
)->dest
!= target
)
5087 i
= gsi_last_bb (src
);
5091 stmt
= gsi_stmt (i
);
5093 if (gimple_code (stmt
) == GIMPLE_COND
|| gimple_code (stmt
) == GIMPLE_SWITCH
)
5095 gsi_remove (&i
, true);
5096 e
= ssa_redirect_edge (e
, target
);
5097 e
->flags
= EDGE_FALLTHRU
;
5105 /* Redirect E to DEST. Return NULL on failure. Otherwise, return the
5106 edge representing the redirected branch. */
5109 gimple_redirect_edge_and_branch (edge e
, basic_block dest
)
5111 basic_block bb
= e
->src
;
5112 gimple_stmt_iterator gsi
;
5116 if (e
->flags
& EDGE_ABNORMAL
)
5119 if (e
->dest
== dest
)
5122 if (e
->flags
& EDGE_EH
)
5123 return redirect_eh_edge (e
, dest
);
5125 if (e
->src
!= ENTRY_BLOCK_PTR
)
5127 ret
= gimple_try_redirect_by_replacing_jump (e
, dest
);
5132 gsi
= gsi_last_bb (bb
);
5133 stmt
= gsi_end_p (gsi
) ? NULL
: gsi_stmt (gsi
);
5135 switch (stmt
? gimple_code (stmt
) : GIMPLE_ERROR_MARK
)
5138 /* For COND_EXPR, we only need to redirect the edge. */
5142 /* No non-abnormal edges should lead from a non-simple goto, and
5143 simple ones should be represented implicitly. */
5148 tree label
= gimple_block_label (dest
);
5149 tree cases
= get_cases_for_edge (e
, stmt
);
5151 /* If we have a list of cases associated with E, then use it
5152 as it's a lot faster than walking the entire case vector. */
5155 edge e2
= find_edge (e
->src
, dest
);
5162 CASE_LABEL (cases
) = label
;
5163 cases
= TREE_CHAIN (cases
);
5166 /* If there was already an edge in the CFG, then we need
5167 to move all the cases associated with E to E2. */
5170 tree cases2
= get_cases_for_edge (e2
, stmt
);
5172 TREE_CHAIN (last
) = TREE_CHAIN (cases2
);
5173 TREE_CHAIN (cases2
) = first
;
5178 size_t i
, n
= gimple_switch_num_labels (stmt
);
5180 for (i
= 0; i
< n
; i
++)
5182 tree elt
= gimple_switch_label (stmt
, i
);
5183 if (label_to_block (CASE_LABEL (elt
)) == e
->dest
)
5184 CASE_LABEL (elt
) = label
;
5192 gsi_remove (&gsi
, true);
5193 e
->flags
|= EDGE_FALLTHRU
;
5196 case GIMPLE_OMP_RETURN
:
5197 case GIMPLE_OMP_CONTINUE
:
5198 case GIMPLE_OMP_SECTIONS_SWITCH
:
5199 case GIMPLE_OMP_FOR
:
5200 /* The edges from OMP constructs can be simply redirected. */
5203 case GIMPLE_EH_DISPATCH
:
5204 if (!(e
->flags
& EDGE_FALLTHRU
))
5205 redirect_eh_dispatch_edge (stmt
, e
, dest
);
5209 /* Otherwise it must be a fallthru edge, and we don't need to
5210 do anything besides redirecting it. */
5211 gcc_assert (e
->flags
& EDGE_FALLTHRU
);
5215 /* Update/insert PHI nodes as necessary. */
5217 /* Now update the edges in the CFG. */
5218 e
= ssa_redirect_edge (e
, dest
);
5223 /* Returns true if it is possible to remove edge E by redirecting
5224 it to the destination of the other edge from E->src. */
5227 gimple_can_remove_branch_p (const_edge e
)
5229 if (e
->flags
& (EDGE_ABNORMAL
| EDGE_EH
))
5235 /* Simple wrapper, as we can always redirect fallthru edges. */
5238 gimple_redirect_edge_and_branch_force (edge e
, basic_block dest
)
5240 e
= gimple_redirect_edge_and_branch (e
, dest
);
5247 /* Splits basic block BB after statement STMT (but at least after the
5248 labels). If STMT is NULL, BB is split just after the labels. */
5251 gimple_split_block (basic_block bb
, void *stmt
)
5253 gimple_stmt_iterator gsi
;
5254 gimple_stmt_iterator gsi_tgt
;
5261 new_bb
= create_empty_bb (bb
);
5263 /* Redirect the outgoing edges. */
5264 new_bb
->succs
= bb
->succs
;
5266 FOR_EACH_EDGE (e
, ei
, new_bb
->succs
)
5269 if (stmt
&& gimple_code ((gimple
) stmt
) == GIMPLE_LABEL
)
5272 /* Move everything from GSI to the new basic block. */
5273 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
5275 act
= gsi_stmt (gsi
);
5276 if (gimple_code (act
) == GIMPLE_LABEL
)
5289 if (gsi_end_p (gsi
))
5292 /* Split the statement list - avoid re-creating new containers as this
5293 brings ugly quadratic memory consumption in the inliner.
5294 (We are still quadratic since we need to update stmt BB pointers,
5296 list
= gsi_split_seq_before (&gsi
);
5297 set_bb_seq (new_bb
, list
);
5298 for (gsi_tgt
= gsi_start (list
);
5299 !gsi_end_p (gsi_tgt
); gsi_next (&gsi_tgt
))
5300 gimple_set_bb (gsi_stmt (gsi_tgt
), new_bb
);
5306 /* Moves basic block BB after block AFTER. */
5309 gimple_move_block_after (basic_block bb
, basic_block after
)
5311 if (bb
->prev_bb
== after
)
5315 link_block (bb
, after
);
5321 /* Return true if basic_block can be duplicated. */
5324 gimple_can_duplicate_bb_p (const_basic_block bb ATTRIBUTE_UNUSED
)
5329 /* Create a duplicate of the basic block BB. NOTE: This does not
5330 preserve SSA form. */
5333 gimple_duplicate_bb (basic_block bb
)
5336 gimple_stmt_iterator gsi
, gsi_tgt
;
5337 gimple_seq phis
= phi_nodes (bb
);
5338 gimple phi
, stmt
, copy
;
5340 new_bb
= create_empty_bb (EXIT_BLOCK_PTR
->prev_bb
);
5342 /* Copy the PHI nodes. We ignore PHI node arguments here because
5343 the incoming edges have not been setup yet. */
5344 for (gsi
= gsi_start (phis
); !gsi_end_p (gsi
); gsi_next (&gsi
))
5346 phi
= gsi_stmt (gsi
);
5347 copy
= create_phi_node (gimple_phi_result (phi
), new_bb
);
5348 create_new_def_for (gimple_phi_result (copy
), copy
,
5349 gimple_phi_result_ptr (copy
));
5352 gsi_tgt
= gsi_start_bb (new_bb
);
5353 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
5355 def_operand_p def_p
;
5356 ssa_op_iter op_iter
;
5358 stmt
= gsi_stmt (gsi
);
5359 if (gimple_code (stmt
) == GIMPLE_LABEL
)
5362 /* Create a new copy of STMT and duplicate STMT's virtual
5364 copy
= gimple_copy (stmt
);
5365 gsi_insert_after (&gsi_tgt
, copy
, GSI_NEW_STMT
);
5367 maybe_duplicate_eh_stmt (copy
, stmt
);
5368 gimple_duplicate_stmt_histograms (cfun
, copy
, cfun
, stmt
);
5370 /* Create new names for all the definitions created by COPY and
5371 add replacement mappings for each new name. */
5372 FOR_EACH_SSA_DEF_OPERAND (def_p
, copy
, op_iter
, SSA_OP_ALL_DEFS
)
5373 create_new_def_for (DEF_FROM_PTR (def_p
), copy
, def_p
);
5379 /* Adds phi node arguments for edge E_COPY after basic block duplication. */
5382 add_phi_args_after_copy_edge (edge e_copy
)
5384 basic_block bb
, bb_copy
= e_copy
->src
, dest
;
5387 gimple phi
, phi_copy
;
5389 gimple_stmt_iterator psi
, psi_copy
;
5391 if (gimple_seq_empty_p (phi_nodes (e_copy
->dest
)))
5394 bb
= bb_copy
->flags
& BB_DUPLICATED
? get_bb_original (bb_copy
) : bb_copy
;
5396 if (e_copy
->dest
->flags
& BB_DUPLICATED
)
5397 dest
= get_bb_original (e_copy
->dest
);
5399 dest
= e_copy
->dest
;
5401 e
= find_edge (bb
, dest
);
5404 /* During loop unrolling the target of the latch edge is copied.
5405 In this case we are not looking for edge to dest, but to
5406 duplicated block whose original was dest. */
5407 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
5409 if ((e
->dest
->flags
& BB_DUPLICATED
)
5410 && get_bb_original (e
->dest
) == dest
)
5414 gcc_assert (e
!= NULL
);
5417 for (psi
= gsi_start_phis (e
->dest
),
5418 psi_copy
= gsi_start_phis (e_copy
->dest
);
5420 gsi_next (&psi
), gsi_next (&psi_copy
))
5422 phi
= gsi_stmt (psi
);
5423 phi_copy
= gsi_stmt (psi_copy
);
5424 def
= PHI_ARG_DEF_FROM_EDGE (phi
, e
);
5425 add_phi_arg (phi_copy
, def
, e_copy
,
5426 gimple_phi_arg_location_from_edge (phi
, e
));
5431 /* Basic block BB_COPY was created by code duplication. Add phi node
5432 arguments for edges going out of BB_COPY. The blocks that were
5433 duplicated have BB_DUPLICATED set. */
5436 add_phi_args_after_copy_bb (basic_block bb_copy
)
5441 FOR_EACH_EDGE (e_copy
, ei
, bb_copy
->succs
)
5443 add_phi_args_after_copy_edge (e_copy
);
5447 /* Blocks in REGION_COPY array of length N_REGION were created by
5448 duplication of basic blocks. Add phi node arguments for edges
5449 going from these blocks. If E_COPY is not NULL, also add
5450 phi node arguments for its destination.*/
5453 add_phi_args_after_copy (basic_block
*region_copy
, unsigned n_region
,
5458 for (i
= 0; i
< n_region
; i
++)
5459 region_copy
[i
]->flags
|= BB_DUPLICATED
;
5461 for (i
= 0; i
< n_region
; i
++)
5462 add_phi_args_after_copy_bb (region_copy
[i
]);
5464 add_phi_args_after_copy_edge (e_copy
);
5466 for (i
= 0; i
< n_region
; i
++)
5467 region_copy
[i
]->flags
&= ~BB_DUPLICATED
;
5470 /* Duplicates a REGION (set of N_REGION basic blocks) with just a single
5471 important exit edge EXIT. By important we mean that no SSA name defined
5472 inside region is live over the other exit edges of the region. All entry
5473 edges to the region must go to ENTRY->dest. The edge ENTRY is redirected
5474 to the duplicate of the region. SSA form, dominance and loop information
5475 is updated. The new basic blocks are stored to REGION_COPY in the same
5476 order as they had in REGION, provided that REGION_COPY is not NULL.
5477 The function returns false if it is unable to copy the region,
5481 gimple_duplicate_sese_region (edge entry
, edge exit
,
5482 basic_block
*region
, unsigned n_region
,
5483 basic_block
*region_copy
)
5486 bool free_region_copy
= false, copying_header
= false;
5487 struct loop
*loop
= entry
->dest
->loop_father
;
5489 VEC (basic_block
, heap
) *doms
;
5491 int total_freq
= 0, entry_freq
= 0;
5492 gcov_type total_count
= 0, entry_count
= 0;
5494 if (!can_copy_bbs_p (region
, n_region
))
5497 /* Some sanity checking. Note that we do not check for all possible
5498 missuses of the functions. I.e. if you ask to copy something weird,
5499 it will work, but the state of structures probably will not be
5501 for (i
= 0; i
< n_region
; i
++)
5503 /* We do not handle subloops, i.e. all the blocks must belong to the
5505 if (region
[i
]->loop_father
!= loop
)
5508 if (region
[i
] != entry
->dest
5509 && region
[i
] == loop
->header
)
5513 set_loop_copy (loop
, loop
);
5515 /* In case the function is used for loop header copying (which is the primary
5516 use), ensure that EXIT and its copy will be new latch and entry edges. */
5517 if (loop
->header
== entry
->dest
)
5519 copying_header
= true;
5520 set_loop_copy (loop
, loop_outer (loop
));
5522 if (!dominated_by_p (CDI_DOMINATORS
, loop
->latch
, exit
->src
))
5525 for (i
= 0; i
< n_region
; i
++)
5526 if (region
[i
] != exit
->src
5527 && dominated_by_p (CDI_DOMINATORS
, region
[i
], exit
->src
))
5533 region_copy
= XNEWVEC (basic_block
, n_region
);
5534 free_region_copy
= true;
5537 gcc_assert (!need_ssa_update_p (cfun
));
5539 /* Record blocks outside the region that are dominated by something
5542 initialize_original_copy_tables ();
5544 doms
= get_dominated_by_region (CDI_DOMINATORS
, region
, n_region
);
5546 if (entry
->dest
->count
)
5548 total_count
= entry
->dest
->count
;
5549 entry_count
= entry
->count
;
5550 /* Fix up corner cases, to avoid division by zero or creation of negative
5552 if (entry_count
> total_count
)
5553 entry_count
= total_count
;
5557 total_freq
= entry
->dest
->frequency
;
5558 entry_freq
= EDGE_FREQUENCY (entry
);
5559 /* Fix up corner cases, to avoid division by zero or creation of negative
5561 if (total_freq
== 0)
5563 else if (entry_freq
> total_freq
)
5564 entry_freq
= total_freq
;
5567 copy_bbs (region
, n_region
, region_copy
, &exit
, 1, &exit_copy
, loop
,
5568 split_edge_bb_loc (entry
));
5571 scale_bbs_frequencies_gcov_type (region
, n_region
,
5572 total_count
- entry_count
,
5574 scale_bbs_frequencies_gcov_type (region_copy
, n_region
, entry_count
,
5579 scale_bbs_frequencies_int (region
, n_region
, total_freq
- entry_freq
,
5581 scale_bbs_frequencies_int (region_copy
, n_region
, entry_freq
, total_freq
);
5586 loop
->header
= exit
->dest
;
5587 loop
->latch
= exit
->src
;
5590 /* Redirect the entry and add the phi node arguments. */
5591 redirected
= redirect_edge_and_branch (entry
, get_bb_copy (entry
->dest
));
5592 gcc_assert (redirected
!= NULL
);
5593 flush_pending_stmts (entry
);
5595 /* Concerning updating of dominators: We must recount dominators
5596 for entry block and its copy. Anything that is outside of the
5597 region, but was dominated by something inside needs recounting as
5599 set_immediate_dominator (CDI_DOMINATORS
, entry
->dest
, entry
->src
);
5600 VEC_safe_push (basic_block
, heap
, doms
, get_bb_original (entry
->dest
));
5601 iterate_fix_dominators (CDI_DOMINATORS
, doms
, false);
5602 VEC_free (basic_block
, heap
, doms
);
5604 /* Add the other PHI node arguments. */
5605 add_phi_args_after_copy (region_copy
, n_region
, NULL
);
5607 /* Update the SSA web. */
5608 update_ssa (TODO_update_ssa
);
5610 if (free_region_copy
)
5613 free_original_copy_tables ();
5617 /* Duplicates REGION consisting of N_REGION blocks. The new blocks
5618 are stored to REGION_COPY in the same order in that they appear
5619 in REGION, if REGION_COPY is not NULL. ENTRY is the entry to
5620 the region, EXIT an exit from it. The condition guarding EXIT
5621 is moved to ENTRY. Returns true if duplication succeeds, false
5647 gimple_duplicate_sese_tail (edge entry ATTRIBUTE_UNUSED
, edge exit ATTRIBUTE_UNUSED
,
5648 basic_block
*region ATTRIBUTE_UNUSED
, unsigned n_region ATTRIBUTE_UNUSED
,
5649 basic_block
*region_copy ATTRIBUTE_UNUSED
)
5652 bool free_region_copy
= false;
5653 struct loop
*loop
= exit
->dest
->loop_father
;
5654 struct loop
*orig_loop
= entry
->dest
->loop_father
;
5655 basic_block switch_bb
, entry_bb
, nentry_bb
;
5656 VEC (basic_block
, heap
) *doms
;
5657 int total_freq
= 0, exit_freq
= 0;
5658 gcov_type total_count
= 0, exit_count
= 0;
5659 edge exits
[2], nexits
[2], e
;
5660 gimple_stmt_iterator gsi
;
5664 gcc_assert (EDGE_COUNT (exit
->src
->succs
) == 2);
5666 exits
[1] = EDGE_SUCC (exit
->src
, EDGE_SUCC (exit
->src
, 0) == exit
);
5668 if (!can_copy_bbs_p (region
, n_region
))
5671 /* Some sanity checking. Note that we do not check for all possible
5672 missuses of the functions. I.e. if you ask to copy something weird
5673 (e.g., in the example, if there is a jump from inside to the middle
5674 of some_code, or come_code defines some of the values used in cond)
5675 it will work, but the resulting code will not be correct. */
5676 for (i
= 0; i
< n_region
; i
++)
5678 /* We do not handle subloops, i.e. all the blocks must belong to the
5680 if (region
[i
]->loop_father
!= orig_loop
)
5683 if (region
[i
] == orig_loop
->latch
)
5687 initialize_original_copy_tables ();
5688 set_loop_copy (orig_loop
, loop
);
5692 region_copy
= XNEWVEC (basic_block
, n_region
);
5693 free_region_copy
= true;
5696 gcc_assert (!need_ssa_update_p (cfun
));
5698 /* Record blocks outside the region that are dominated by something
5700 doms
= get_dominated_by_region (CDI_DOMINATORS
, region
, n_region
);
5702 if (exit
->src
->count
)
5704 total_count
= exit
->src
->count
;
5705 exit_count
= exit
->count
;
5706 /* Fix up corner cases, to avoid division by zero or creation of negative
5708 if (exit_count
> total_count
)
5709 exit_count
= total_count
;
5713 total_freq
= exit
->src
->frequency
;
5714 exit_freq
= EDGE_FREQUENCY (exit
);
5715 /* Fix up corner cases, to avoid division by zero or creation of negative
5717 if (total_freq
== 0)
5719 if (exit_freq
> total_freq
)
5720 exit_freq
= total_freq
;
5723 copy_bbs (region
, n_region
, region_copy
, exits
, 2, nexits
, orig_loop
,
5724 split_edge_bb_loc (exit
));
5727 scale_bbs_frequencies_gcov_type (region
, n_region
,
5728 total_count
- exit_count
,
5730 scale_bbs_frequencies_gcov_type (region_copy
, n_region
, exit_count
,
5735 scale_bbs_frequencies_int (region
, n_region
, total_freq
- exit_freq
,
5737 scale_bbs_frequencies_int (region_copy
, n_region
, exit_freq
, total_freq
);
5740 /* Create the switch block, and put the exit condition to it. */
5741 entry_bb
= entry
->dest
;
5742 nentry_bb
= get_bb_copy (entry_bb
);
5743 if (!last_stmt (entry
->src
)
5744 || !stmt_ends_bb_p (last_stmt (entry
->src
)))
5745 switch_bb
= entry
->src
;
5747 switch_bb
= split_edge (entry
);
5748 set_immediate_dominator (CDI_DOMINATORS
, nentry_bb
, switch_bb
);
5750 gsi
= gsi_last_bb (switch_bb
);
5751 cond_stmt
= last_stmt (exit
->src
);
5752 gcc_assert (gimple_code (cond_stmt
) == GIMPLE_COND
);
5753 cond_stmt
= gimple_copy (cond_stmt
);
5754 gimple_cond_set_lhs (cond_stmt
, unshare_expr (gimple_cond_lhs (cond_stmt
)));
5755 gimple_cond_set_rhs (cond_stmt
, unshare_expr (gimple_cond_rhs (cond_stmt
)));
5756 gsi_insert_after (&gsi
, cond_stmt
, GSI_NEW_STMT
);
5758 sorig
= single_succ_edge (switch_bb
);
5759 sorig
->flags
= exits
[1]->flags
;
5760 snew
= make_edge (switch_bb
, nentry_bb
, exits
[0]->flags
);
5762 /* Register the new edge from SWITCH_BB in loop exit lists. */
5763 rescan_loop_exit (snew
, true, false);
5765 /* Add the PHI node arguments. */
5766 add_phi_args_after_copy (region_copy
, n_region
, snew
);
5768 /* Get rid of now superfluous conditions and associated edges (and phi node
5770 e
= redirect_edge_and_branch (exits
[0], exits
[1]->dest
);
5771 PENDING_STMT (e
) = NULL
;
5772 e
= redirect_edge_and_branch (nexits
[1], nexits
[0]->dest
);
5773 PENDING_STMT (e
) = NULL
;
5775 /* Anything that is outside of the region, but was dominated by something
5776 inside needs to update dominance info. */
5777 iterate_fix_dominators (CDI_DOMINATORS
, doms
, false);
5778 VEC_free (basic_block
, heap
, doms
);
5780 /* Update the SSA web. */
5781 update_ssa (TODO_update_ssa
);
5783 if (free_region_copy
)
5786 free_original_copy_tables ();
5790 /* Add all the blocks dominated by ENTRY to the array BBS_P. Stop
5791 adding blocks when the dominator traversal reaches EXIT. This
5792 function silently assumes that ENTRY strictly dominates EXIT. */
5795 gather_blocks_in_sese_region (basic_block entry
, basic_block exit
,
5796 VEC(basic_block
,heap
) **bbs_p
)
5800 for (son
= first_dom_son (CDI_DOMINATORS
, entry
);
5802 son
= next_dom_son (CDI_DOMINATORS
, son
))
5804 VEC_safe_push (basic_block
, heap
, *bbs_p
, son
);
5806 gather_blocks_in_sese_region (son
, exit
, bbs_p
);
5810 /* Replaces *TP with a duplicate (belonging to function TO_CONTEXT).
5811 The duplicates are recorded in VARS_MAP. */
5814 replace_by_duplicate_decl (tree
*tp
, struct pointer_map_t
*vars_map
,
5817 tree t
= *tp
, new_t
;
5818 struct function
*f
= DECL_STRUCT_FUNCTION (to_context
);
5821 if (DECL_CONTEXT (t
) == to_context
)
5824 loc
= pointer_map_contains (vars_map
, t
);
5828 loc
= pointer_map_insert (vars_map
, t
);
5832 new_t
= copy_var_decl (t
, DECL_NAME (t
), TREE_TYPE (t
));
5833 f
->local_decls
= tree_cons (NULL_TREE
, new_t
, f
->local_decls
);
5837 gcc_assert (TREE_CODE (t
) == CONST_DECL
);
5838 new_t
= copy_node (t
);
5840 DECL_CONTEXT (new_t
) = to_context
;
5845 new_t
= (tree
) *loc
;
5851 /* Creates an ssa name in TO_CONTEXT equivalent to NAME.
5852 VARS_MAP maps old ssa names and var_decls to the new ones. */
5855 replace_ssa_name (tree name
, struct pointer_map_t
*vars_map
,
5859 tree new_name
, decl
= SSA_NAME_VAR (name
);
5861 gcc_assert (is_gimple_reg (name
));
5863 loc
= pointer_map_contains (vars_map
, name
);
5867 replace_by_duplicate_decl (&decl
, vars_map
, to_context
);
5869 push_cfun (DECL_STRUCT_FUNCTION (to_context
));
5870 if (gimple_in_ssa_p (cfun
))
5871 add_referenced_var (decl
);
5873 new_name
= make_ssa_name (decl
, SSA_NAME_DEF_STMT (name
));
5874 if (SSA_NAME_IS_DEFAULT_DEF (name
))
5875 set_default_def (decl
, new_name
);
5878 loc
= pointer_map_insert (vars_map
, name
);
5882 new_name
= (tree
) *loc
;
5893 struct pointer_map_t
*vars_map
;
5894 htab_t new_label_map
;
5895 struct pointer_map_t
*eh_map
;
5899 /* Helper for move_block_to_fn. Set TREE_BLOCK in every expression
5900 contained in *TP if it has been ORIG_BLOCK previously and change the
5901 DECL_CONTEXT of every local variable referenced in *TP. */
5904 move_stmt_op (tree
*tp
, int *walk_subtrees
, void *data
)
5906 struct walk_stmt_info
*wi
= (struct walk_stmt_info
*) data
;
5907 struct move_stmt_d
*p
= (struct move_stmt_d
*) wi
->info
;
5911 /* We should never have TREE_BLOCK set on non-statements. */
5912 gcc_assert (!TREE_BLOCK (t
));
5914 else if (DECL_P (t
) || TREE_CODE (t
) == SSA_NAME
)
5916 if (TREE_CODE (t
) == SSA_NAME
)
5917 *tp
= replace_ssa_name (t
, p
->vars_map
, p
->to_context
);
5918 else if (TREE_CODE (t
) == LABEL_DECL
)
5920 if (p
->new_label_map
)
5922 struct tree_map in
, *out
;
5924 out
= (struct tree_map
*)
5925 htab_find_with_hash (p
->new_label_map
, &in
, DECL_UID (t
));
5930 DECL_CONTEXT (t
) = p
->to_context
;
5932 else if (p
->remap_decls_p
)
5934 /* Replace T with its duplicate. T should no longer appear in the
5935 parent function, so this looks wasteful; however, it may appear
5936 in referenced_vars, and more importantly, as virtual operands of
5937 statements, and in alias lists of other variables. It would be
5938 quite difficult to expunge it from all those places. ??? It might
5939 suffice to do this for addressable variables. */
5940 if ((TREE_CODE (t
) == VAR_DECL
5941 && !is_global_var (t
))
5942 || TREE_CODE (t
) == CONST_DECL
)
5943 replace_by_duplicate_decl (tp
, p
->vars_map
, p
->to_context
);
5946 && gimple_in_ssa_p (cfun
))
5948 push_cfun (DECL_STRUCT_FUNCTION (p
->to_context
));
5949 add_referenced_var (*tp
);
5955 else if (TYPE_P (t
))
5961 /* Helper for move_stmt_r. Given an EH region number for the source
5962 function, map that to the duplicate EH regio number in the dest. */
5965 move_stmt_eh_region_nr (int old_nr
, struct move_stmt_d
*p
)
5967 eh_region old_r
, new_r
;
5970 old_r
= get_eh_region_from_number (old_nr
);
5971 slot
= pointer_map_contains (p
->eh_map
, old_r
);
5972 new_r
= (eh_region
) *slot
;
5974 return new_r
->index
;
5977 /* Similar, but operate on INTEGER_CSTs. */
5980 move_stmt_eh_region_tree_nr (tree old_t_nr
, struct move_stmt_d
*p
)
5984 old_nr
= tree_low_cst (old_t_nr
, 0);
5985 new_nr
= move_stmt_eh_region_nr (old_nr
, p
);
5987 return build_int_cst (NULL
, new_nr
);
5990 /* Like move_stmt_op, but for gimple statements.
5992 Helper for move_block_to_fn. Set GIMPLE_BLOCK in every expression
5993 contained in the current statement in *GSI_P and change the
5994 DECL_CONTEXT of every local variable referenced in the current
5998 move_stmt_r (gimple_stmt_iterator
*gsi_p
, bool *handled_ops_p
,
5999 struct walk_stmt_info
*wi
)
6001 struct move_stmt_d
*p
= (struct move_stmt_d
*) wi
->info
;
6002 gimple stmt
= gsi_stmt (*gsi_p
);
6003 tree block
= gimple_block (stmt
);
6005 if (p
->orig_block
== NULL_TREE
6006 || block
== p
->orig_block
6007 || block
== NULL_TREE
)
6008 gimple_set_block (stmt
, p
->new_block
);
6009 #ifdef ENABLE_CHECKING
6010 else if (block
!= p
->new_block
)
6012 while (block
&& block
!= p
->orig_block
)
6013 block
= BLOCK_SUPERCONTEXT (block
);
6018 switch (gimple_code (stmt
))
6021 /* Remap the region numbers for __builtin_eh_{pointer,filter}. */
6023 tree r
, fndecl
= gimple_call_fndecl (stmt
);
6024 if (fndecl
&& DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
)
6025 switch (DECL_FUNCTION_CODE (fndecl
))
6027 case BUILT_IN_EH_COPY_VALUES
:
6028 r
= gimple_call_arg (stmt
, 1);
6029 r
= move_stmt_eh_region_tree_nr (r
, p
);
6030 gimple_call_set_arg (stmt
, 1, r
);
6033 case BUILT_IN_EH_POINTER
:
6034 case BUILT_IN_EH_FILTER
:
6035 r
= gimple_call_arg (stmt
, 0);
6036 r
= move_stmt_eh_region_tree_nr (r
, p
);
6037 gimple_call_set_arg (stmt
, 0, r
);
6048 int r
= gimple_resx_region (stmt
);
6049 r
= move_stmt_eh_region_nr (r
, p
);
6050 gimple_resx_set_region (stmt
, r
);
6054 case GIMPLE_EH_DISPATCH
:
6056 int r
= gimple_eh_dispatch_region (stmt
);
6057 r
= move_stmt_eh_region_nr (r
, p
);
6058 gimple_eh_dispatch_set_region (stmt
, r
);
6062 case GIMPLE_OMP_RETURN
:
6063 case GIMPLE_OMP_CONTINUE
:
6066 if (is_gimple_omp (stmt
))
6068 /* Do not remap variables inside OMP directives. Variables
6069 referenced in clauses and directive header belong to the
6070 parent function and should not be moved into the child
6072 bool save_remap_decls_p
= p
->remap_decls_p
;
6073 p
->remap_decls_p
= false;
6074 *handled_ops_p
= true;
6076 walk_gimple_seq (gimple_omp_body (stmt
), move_stmt_r
,
6079 p
->remap_decls_p
= save_remap_decls_p
;
6087 /* Marks virtual operands of all statements in basic blocks BBS for
6091 mark_virtual_ops_in_bb (basic_block bb
)
6093 gimple_stmt_iterator gsi
;
6095 for (gsi
= gsi_start_phis (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
6096 mark_virtual_ops_for_renaming (gsi_stmt (gsi
));
6098 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
6099 mark_virtual_ops_for_renaming (gsi_stmt (gsi
));
6102 /* Move basic block BB from function CFUN to function DEST_FN. The
6103 block is moved out of the original linked list and placed after
6104 block AFTER in the new list. Also, the block is removed from the
6105 original array of blocks and placed in DEST_FN's array of blocks.
6106 If UPDATE_EDGE_COUNT_P is true, the edge counts on both CFGs is
6107 updated to reflect the moved edges.
6109 The local variables are remapped to new instances, VARS_MAP is used
6110 to record the mapping. */
6113 move_block_to_fn (struct function
*dest_cfun
, basic_block bb
,
6114 basic_block after
, bool update_edge_count_p
,
6115 struct move_stmt_d
*d
)
6117 struct control_flow_graph
*cfg
;
6120 gimple_stmt_iterator si
;
6121 unsigned old_len
, new_len
;
6123 /* Remove BB from dominance structures. */
6124 delete_from_dominance_info (CDI_DOMINATORS
, bb
);
6126 remove_bb_from_loops (bb
);
6128 /* Link BB to the new linked list. */
6129 move_block_after (bb
, after
);
6131 /* Update the edge count in the corresponding flowgraphs. */
6132 if (update_edge_count_p
)
6133 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
6135 cfun
->cfg
->x_n_edges
--;
6136 dest_cfun
->cfg
->x_n_edges
++;
6139 /* Remove BB from the original basic block array. */
6140 VEC_replace (basic_block
, cfun
->cfg
->x_basic_block_info
, bb
->index
, NULL
);
6141 cfun
->cfg
->x_n_basic_blocks
--;
6143 /* Grow DEST_CFUN's basic block array if needed. */
6144 cfg
= dest_cfun
->cfg
;
6145 cfg
->x_n_basic_blocks
++;
6146 if (bb
->index
>= cfg
->x_last_basic_block
)
6147 cfg
->x_last_basic_block
= bb
->index
+ 1;
6149 old_len
= VEC_length (basic_block
, cfg
->x_basic_block_info
);
6150 if ((unsigned) cfg
->x_last_basic_block
>= old_len
)
6152 new_len
= cfg
->x_last_basic_block
+ (cfg
->x_last_basic_block
+ 3) / 4;
6153 VEC_safe_grow_cleared (basic_block
, gc
, cfg
->x_basic_block_info
,
6157 VEC_replace (basic_block
, cfg
->x_basic_block_info
,
6160 /* Remap the variables in phi nodes. */
6161 for (si
= gsi_start_phis (bb
); !gsi_end_p (si
); )
6163 gimple phi
= gsi_stmt (si
);
6165 tree op
= PHI_RESULT (phi
);
6168 if (!is_gimple_reg (op
))
6170 /* Remove the phi nodes for virtual operands (alias analysis will be
6171 run for the new function, anyway). */
6172 remove_phi_node (&si
, true);
6176 SET_PHI_RESULT (phi
,
6177 replace_ssa_name (op
, d
->vars_map
, dest_cfun
->decl
));
6178 FOR_EACH_PHI_ARG (use
, phi
, oi
, SSA_OP_USE
)
6180 op
= USE_FROM_PTR (use
);
6181 if (TREE_CODE (op
) == SSA_NAME
)
6182 SET_USE (use
, replace_ssa_name (op
, d
->vars_map
, dest_cfun
->decl
));
6188 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
6190 gimple stmt
= gsi_stmt (si
);
6191 struct walk_stmt_info wi
;
6193 memset (&wi
, 0, sizeof (wi
));
6195 walk_gimple_stmt (&si
, move_stmt_r
, move_stmt_op
, &wi
);
6197 if (gimple_code (stmt
) == GIMPLE_LABEL
)
6199 tree label
= gimple_label_label (stmt
);
6200 int uid
= LABEL_DECL_UID (label
);
6202 gcc_assert (uid
> -1);
6204 old_len
= VEC_length (basic_block
, cfg
->x_label_to_block_map
);
6205 if (old_len
<= (unsigned) uid
)
6207 new_len
= 3 * uid
/ 2 + 1;
6208 VEC_safe_grow_cleared (basic_block
, gc
,
6209 cfg
->x_label_to_block_map
, new_len
);
6212 VEC_replace (basic_block
, cfg
->x_label_to_block_map
, uid
, bb
);
6213 VEC_replace (basic_block
, cfun
->cfg
->x_label_to_block_map
, uid
, NULL
);
6215 gcc_assert (DECL_CONTEXT (label
) == dest_cfun
->decl
);
6217 if (uid
>= dest_cfun
->cfg
->last_label_uid
)
6218 dest_cfun
->cfg
->last_label_uid
= uid
+ 1;
6221 maybe_duplicate_eh_stmt_fn (dest_cfun
, stmt
, cfun
, stmt
, d
->eh_map
, 0);
6222 remove_stmt_from_eh_lp_fn (cfun
, stmt
);
6224 gimple_duplicate_stmt_histograms (dest_cfun
, stmt
, cfun
, stmt
);
6225 gimple_remove_stmt_histograms (cfun
, stmt
);
6227 /* We cannot leave any operands allocated from the operand caches of
6228 the current function. */
6229 free_stmt_operands (stmt
);
6230 push_cfun (dest_cfun
);
6235 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
6238 tree block
= e
->goto_block
;
6239 if (d
->orig_block
== NULL_TREE
6240 || block
== d
->orig_block
)
6241 e
->goto_block
= d
->new_block
;
6242 #ifdef ENABLE_CHECKING
6243 else if (block
!= d
->new_block
)
6245 while (block
&& block
!= d
->orig_block
)
6246 block
= BLOCK_SUPERCONTEXT (block
);
6253 /* Examine the statements in BB (which is in SRC_CFUN); find and return
6254 the outermost EH region. Use REGION as the incoming base EH region. */
6257 find_outermost_region_in_block (struct function
*src_cfun
,
6258 basic_block bb
, eh_region region
)
6260 gimple_stmt_iterator si
;
6262 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
6264 gimple stmt
= gsi_stmt (si
);
6265 eh_region stmt_region
;
6268 lp_nr
= lookup_stmt_eh_lp_fn (src_cfun
, stmt
);
6269 stmt_region
= get_eh_region_from_lp_number_fn (src_cfun
, lp_nr
);
6273 region
= stmt_region
;
6274 else if (stmt_region
!= region
)
6276 region
= eh_region_outermost (src_cfun
, stmt_region
, region
);
6277 gcc_assert (region
!= NULL
);
6286 new_label_mapper (tree decl
, void *data
)
6288 htab_t hash
= (htab_t
) data
;
6292 gcc_assert (TREE_CODE (decl
) == LABEL_DECL
);
6294 m
= XNEW (struct tree_map
);
6295 m
->hash
= DECL_UID (decl
);
6296 m
->base
.from
= decl
;
6297 m
->to
= create_artificial_label (UNKNOWN_LOCATION
);
6298 LABEL_DECL_UID (m
->to
) = LABEL_DECL_UID (decl
);
6299 if (LABEL_DECL_UID (m
->to
) >= cfun
->cfg
->last_label_uid
)
6300 cfun
->cfg
->last_label_uid
= LABEL_DECL_UID (m
->to
) + 1;
6302 slot
= htab_find_slot_with_hash (hash
, m
, m
->hash
, INSERT
);
6303 gcc_assert (*slot
== NULL
);
6310 /* Change DECL_CONTEXT of all BLOCK_VARS in block, including
6314 replace_block_vars_by_duplicates (tree block
, struct pointer_map_t
*vars_map
,
6319 for (tp
= &BLOCK_VARS (block
); *tp
; tp
= &TREE_CHAIN (*tp
))
6322 if (TREE_CODE (t
) != VAR_DECL
&& TREE_CODE (t
) != CONST_DECL
)
6324 replace_by_duplicate_decl (&t
, vars_map
, to_context
);
6327 if (TREE_CODE (*tp
) == VAR_DECL
&& DECL_HAS_VALUE_EXPR_P (*tp
))
6329 SET_DECL_VALUE_EXPR (t
, DECL_VALUE_EXPR (*tp
));
6330 DECL_HAS_VALUE_EXPR_P (t
) = 1;
6332 TREE_CHAIN (t
) = TREE_CHAIN (*tp
);
6337 for (block
= BLOCK_SUBBLOCKS (block
); block
; block
= BLOCK_CHAIN (block
))
6338 replace_block_vars_by_duplicates (block
, vars_map
, to_context
);
6341 /* Move a single-entry, single-exit region delimited by ENTRY_BB and
6342 EXIT_BB to function DEST_CFUN. The whole region is replaced by a
6343 single basic block in the original CFG and the new basic block is
6344 returned. DEST_CFUN must not have a CFG yet.
6346 Note that the region need not be a pure SESE region. Blocks inside
6347 the region may contain calls to abort/exit. The only restriction
6348 is that ENTRY_BB should be the only entry point and it must
6351 Change TREE_BLOCK of all statements in ORIG_BLOCK to the new
6352 functions outermost BLOCK, move all subblocks of ORIG_BLOCK
6353 to the new function.
6355 All local variables referenced in the region are assumed to be in
6356 the corresponding BLOCK_VARS and unexpanded variable lists
6357 associated with DEST_CFUN. */
6360 move_sese_region_to_fn (struct function
*dest_cfun
, basic_block entry_bb
,
6361 basic_block exit_bb
, tree orig_block
)
6363 VEC(basic_block
,heap
) *bbs
, *dom_bbs
;
6364 basic_block dom_entry
= get_immediate_dominator (CDI_DOMINATORS
, entry_bb
);
6365 basic_block after
, bb
, *entry_pred
, *exit_succ
, abb
;
6366 struct function
*saved_cfun
= cfun
;
6367 int *entry_flag
, *exit_flag
;
6368 unsigned *entry_prob
, *exit_prob
;
6369 unsigned i
, num_entry_edges
, num_exit_edges
;
6372 htab_t new_label_map
;
6373 struct pointer_map_t
*vars_map
, *eh_map
;
6374 struct loop
*loop
= entry_bb
->loop_father
;
6375 struct move_stmt_d d
;
6377 /* If ENTRY does not strictly dominate EXIT, this cannot be an SESE
6379 gcc_assert (entry_bb
!= exit_bb
6381 || dominated_by_p (CDI_DOMINATORS
, exit_bb
, entry_bb
)));
6383 /* Collect all the blocks in the region. Manually add ENTRY_BB
6384 because it won't be added by dfs_enumerate_from. */
6386 VEC_safe_push (basic_block
, heap
, bbs
, entry_bb
);
6387 gather_blocks_in_sese_region (entry_bb
, exit_bb
, &bbs
);
6389 /* The blocks that used to be dominated by something in BBS will now be
6390 dominated by the new block. */
6391 dom_bbs
= get_dominated_by_region (CDI_DOMINATORS
,
6392 VEC_address (basic_block
, bbs
),
6393 VEC_length (basic_block
, bbs
));
6395 /* Detach ENTRY_BB and EXIT_BB from CFUN->CFG. We need to remember
6396 the predecessor edges to ENTRY_BB and the successor edges to
6397 EXIT_BB so that we can re-attach them to the new basic block that
6398 will replace the region. */
6399 num_entry_edges
= EDGE_COUNT (entry_bb
->preds
);
6400 entry_pred
= (basic_block
*) xcalloc (num_entry_edges
, sizeof (basic_block
));
6401 entry_flag
= (int *) xcalloc (num_entry_edges
, sizeof (int));
6402 entry_prob
= XNEWVEC (unsigned, num_entry_edges
);
6404 for (ei
= ei_start (entry_bb
->preds
); (e
= ei_safe_edge (ei
)) != NULL
;)
6406 entry_prob
[i
] = e
->probability
;
6407 entry_flag
[i
] = e
->flags
;
6408 entry_pred
[i
++] = e
->src
;
6414 num_exit_edges
= EDGE_COUNT (exit_bb
->succs
);
6415 exit_succ
= (basic_block
*) xcalloc (num_exit_edges
,
6416 sizeof (basic_block
));
6417 exit_flag
= (int *) xcalloc (num_exit_edges
, sizeof (int));
6418 exit_prob
= XNEWVEC (unsigned, num_exit_edges
);
6420 for (ei
= ei_start (exit_bb
->succs
); (e
= ei_safe_edge (ei
)) != NULL
;)
6422 exit_prob
[i
] = e
->probability
;
6423 exit_flag
[i
] = e
->flags
;
6424 exit_succ
[i
++] = e
->dest
;
6436 /* Switch context to the child function to initialize DEST_FN's CFG. */
6437 gcc_assert (dest_cfun
->cfg
== NULL
);
6438 push_cfun (dest_cfun
);
6440 init_empty_tree_cfg ();
6442 /* Initialize EH information for the new function. */
6444 new_label_map
= NULL
;
6447 eh_region region
= NULL
;
6449 for (i
= 0; VEC_iterate (basic_block
, bbs
, i
, bb
); i
++)
6450 region
= find_outermost_region_in_block (saved_cfun
, bb
, region
);
6452 init_eh_for_function ();
6455 new_label_map
= htab_create (17, tree_map_hash
, tree_map_eq
, free
);
6456 eh_map
= duplicate_eh_regions (saved_cfun
, region
, 0,
6457 new_label_mapper
, new_label_map
);
6463 /* Move blocks from BBS into DEST_CFUN. */
6464 gcc_assert (VEC_length (basic_block
, bbs
) >= 2);
6465 after
= dest_cfun
->cfg
->x_entry_block_ptr
;
6466 vars_map
= pointer_map_create ();
6468 memset (&d
, 0, sizeof (d
));
6469 d
.orig_block
= orig_block
;
6470 d
.new_block
= DECL_INITIAL (dest_cfun
->decl
);
6471 d
.from_context
= cfun
->decl
;
6472 d
.to_context
= dest_cfun
->decl
;
6473 d
.vars_map
= vars_map
;
6474 d
.new_label_map
= new_label_map
;
6476 d
.remap_decls_p
= true;
6478 for (i
= 0; VEC_iterate (basic_block
, bbs
, i
, bb
); i
++)
6480 /* No need to update edge counts on the last block. It has
6481 already been updated earlier when we detached the region from
6482 the original CFG. */
6483 move_block_to_fn (dest_cfun
, bb
, after
, bb
!= exit_bb
, &d
);
6487 /* Rewire BLOCK_SUBBLOCKS of orig_block. */
6491 gcc_assert (BLOCK_SUBBLOCKS (DECL_INITIAL (dest_cfun
->decl
))
6493 BLOCK_SUBBLOCKS (DECL_INITIAL (dest_cfun
->decl
))
6494 = BLOCK_SUBBLOCKS (orig_block
);
6495 for (block
= BLOCK_SUBBLOCKS (orig_block
);
6496 block
; block
= BLOCK_CHAIN (block
))
6497 BLOCK_SUPERCONTEXT (block
) = DECL_INITIAL (dest_cfun
->decl
);
6498 BLOCK_SUBBLOCKS (orig_block
) = NULL_TREE
;
6501 replace_block_vars_by_duplicates (DECL_INITIAL (dest_cfun
->decl
),
6502 vars_map
, dest_cfun
->decl
);
6505 htab_delete (new_label_map
);
6507 pointer_map_destroy (eh_map
);
6508 pointer_map_destroy (vars_map
);
6510 /* Rewire the entry and exit blocks. The successor to the entry
6511 block turns into the successor of DEST_FN's ENTRY_BLOCK_PTR in
6512 the child function. Similarly, the predecessor of DEST_FN's
6513 EXIT_BLOCK_PTR turns into the predecessor of EXIT_BLOCK_PTR. We
6514 need to switch CFUN between DEST_CFUN and SAVED_CFUN so that the
6515 various CFG manipulation function get to the right CFG.
6517 FIXME, this is silly. The CFG ought to become a parameter to
6519 push_cfun (dest_cfun
);
6520 make_edge (ENTRY_BLOCK_PTR
, entry_bb
, EDGE_FALLTHRU
);
6522 make_edge (exit_bb
, EXIT_BLOCK_PTR
, 0);
6525 /* Back in the original function, the SESE region has disappeared,
6526 create a new basic block in its place. */
6527 bb
= create_empty_bb (entry_pred
[0]);
6529 add_bb_to_loop (bb
, loop
);
6530 for (i
= 0; i
< num_entry_edges
; i
++)
6532 e
= make_edge (entry_pred
[i
], bb
, entry_flag
[i
]);
6533 e
->probability
= entry_prob
[i
];
6536 for (i
= 0; i
< num_exit_edges
; i
++)
6538 e
= make_edge (bb
, exit_succ
[i
], exit_flag
[i
]);
6539 e
->probability
= exit_prob
[i
];
6542 set_immediate_dominator (CDI_DOMINATORS
, bb
, dom_entry
);
6543 for (i
= 0; VEC_iterate (basic_block
, dom_bbs
, i
, abb
); i
++)
6544 set_immediate_dominator (CDI_DOMINATORS
, abb
, bb
);
6545 VEC_free (basic_block
, heap
, dom_bbs
);
6556 VEC_free (basic_block
, heap
, bbs
);
6562 /* Dump FUNCTION_DECL FN to file FILE using FLAGS (see TDF_* in tree-pass.h)
6566 dump_function_to_file (tree fn
, FILE *file
, int flags
)
6568 tree arg
, vars
, var
;
6569 struct function
*dsf
;
6570 bool ignore_topmost_bind
= false, any_var
= false;
6574 fprintf (file
, "%s (", lang_hooks
.decl_printable_name (fn
, 2));
6576 arg
= DECL_ARGUMENTS (fn
);
6579 print_generic_expr (file
, TREE_TYPE (arg
), dump_flags
);
6580 fprintf (file
, " ");
6581 print_generic_expr (file
, arg
, dump_flags
);
6582 if (flags
& TDF_VERBOSE
)
6583 print_node (file
, "", arg
, 4);
6584 if (TREE_CHAIN (arg
))
6585 fprintf (file
, ", ");
6586 arg
= TREE_CHAIN (arg
);
6588 fprintf (file
, ")\n");
6590 if (flags
& TDF_VERBOSE
)
6591 print_node (file
, "", fn
, 2);
6593 dsf
= DECL_STRUCT_FUNCTION (fn
);
6594 if (dsf
&& (flags
& TDF_EH
))
6595 dump_eh_tree (file
, dsf
);
6597 if (flags
& TDF_RAW
&& !gimple_has_body_p (fn
))
6599 dump_node (fn
, TDF_SLIM
| flags
, file
);
6603 /* Switch CFUN to point to FN. */
6604 push_cfun (DECL_STRUCT_FUNCTION (fn
));
6606 /* When GIMPLE is lowered, the variables are no longer available in
6607 BIND_EXPRs, so display them separately. */
6608 if (cfun
&& cfun
->decl
== fn
&& cfun
->local_decls
)
6610 ignore_topmost_bind
= true;
6612 fprintf (file
, "{\n");
6613 for (vars
= cfun
->local_decls
; vars
; vars
= TREE_CHAIN (vars
))
6615 var
= TREE_VALUE (vars
);
6617 print_generic_decl (file
, var
, flags
);
6618 if (flags
& TDF_VERBOSE
)
6619 print_node (file
, "", var
, 4);
6620 fprintf (file
, "\n");
6626 if (cfun
&& cfun
->decl
== fn
&& cfun
->cfg
&& basic_block_info
)
6628 /* If the CFG has been built, emit a CFG-based dump. */
6629 check_bb_profile (ENTRY_BLOCK_PTR
, file
);
6630 if (!ignore_topmost_bind
)
6631 fprintf (file
, "{\n");
6633 if (any_var
&& n_basic_blocks
)
6634 fprintf (file
, "\n");
6637 gimple_dump_bb (bb
, file
, 2, flags
);
6639 fprintf (file
, "}\n");
6640 check_bb_profile (EXIT_BLOCK_PTR
, file
);
6642 else if (DECL_SAVED_TREE (fn
) == NULL
)
6644 /* The function is now in GIMPLE form but the CFG has not been
6645 built yet. Emit the single sequence of GIMPLE statements
6646 that make up its body. */
6647 gimple_seq body
= gimple_body (fn
);
6649 if (gimple_seq_first_stmt (body
)
6650 && gimple_seq_first_stmt (body
) == gimple_seq_last_stmt (body
)
6651 && gimple_code (gimple_seq_first_stmt (body
)) == GIMPLE_BIND
)
6652 print_gimple_seq (file
, body
, 0, flags
);
6655 if (!ignore_topmost_bind
)
6656 fprintf (file
, "{\n");
6659 fprintf (file
, "\n");
6661 print_gimple_seq (file
, body
, 2, flags
);
6662 fprintf (file
, "}\n");
6669 /* Make a tree based dump. */
6670 chain
= DECL_SAVED_TREE (fn
);
6672 if (chain
&& TREE_CODE (chain
) == BIND_EXPR
)
6674 if (ignore_topmost_bind
)
6676 chain
= BIND_EXPR_BODY (chain
);
6684 if (!ignore_topmost_bind
)
6685 fprintf (file
, "{\n");
6690 fprintf (file
, "\n");
6692 print_generic_stmt_indented (file
, chain
, flags
, indent
);
6693 if (ignore_topmost_bind
)
6694 fprintf (file
, "}\n");
6697 fprintf (file
, "\n\n");
6704 /* Dump FUNCTION_DECL FN to stderr using FLAGS (see TDF_* in tree.h) */
6707 debug_function (tree fn
, int flags
)
6709 dump_function_to_file (fn
, stderr
, flags
);
6713 /* Print on FILE the indexes for the predecessors of basic_block BB. */
6716 print_pred_bbs (FILE *file
, basic_block bb
)
6721 FOR_EACH_EDGE (e
, ei
, bb
->preds
)
6722 fprintf (file
, "bb_%d ", e
->src
->index
);
6726 /* Print on FILE the indexes for the successors of basic_block BB. */
6729 print_succ_bbs (FILE *file
, basic_block bb
)
6734 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
6735 fprintf (file
, "bb_%d ", e
->dest
->index
);
6738 /* Print to FILE the basic block BB following the VERBOSITY level. */
6741 print_loops_bb (FILE *file
, basic_block bb
, int indent
, int verbosity
)
6743 char *s_indent
= (char *) alloca ((size_t) indent
+ 1);
6744 memset ((void *) s_indent
, ' ', (size_t) indent
);
6745 s_indent
[indent
] = '\0';
6747 /* Print basic_block's header. */
6750 fprintf (file
, "%s bb_%d (preds = {", s_indent
, bb
->index
);
6751 print_pred_bbs (file
, bb
);
6752 fprintf (file
, "}, succs = {");
6753 print_succ_bbs (file
, bb
);
6754 fprintf (file
, "})\n");
6757 /* Print basic_block's body. */
6760 fprintf (file
, "%s {\n", s_indent
);
6761 gimple_dump_bb (bb
, file
, indent
+ 4, TDF_VOPS
|TDF_MEMSYMS
);
6762 fprintf (file
, "%s }\n", s_indent
);
6766 static void print_loop_and_siblings (FILE *, struct loop
*, int, int);
6768 /* Pretty print LOOP on FILE, indented INDENT spaces. Following
6769 VERBOSITY level this outputs the contents of the loop, or just its
6773 print_loop (FILE *file
, struct loop
*loop
, int indent
, int verbosity
)
6781 s_indent
= (char *) alloca ((size_t) indent
+ 1);
6782 memset ((void *) s_indent
, ' ', (size_t) indent
);
6783 s_indent
[indent
] = '\0';
6785 /* Print loop's header. */
6786 fprintf (file
, "%sloop_%d (header = %d, latch = %d", s_indent
,
6787 loop
->num
, loop
->header
->index
, loop
->latch
->index
);
6788 fprintf (file
, ", niter = ");
6789 print_generic_expr (file
, loop
->nb_iterations
, 0);
6791 if (loop
->any_upper_bound
)
6793 fprintf (file
, ", upper_bound = ");
6794 dump_double_int (file
, loop
->nb_iterations_upper_bound
, true);
6797 if (loop
->any_estimate
)
6799 fprintf (file
, ", estimate = ");
6800 dump_double_int (file
, loop
->nb_iterations_estimate
, true);
6802 fprintf (file
, ")\n");
6804 /* Print loop's body. */
6807 fprintf (file
, "%s{\n", s_indent
);
6809 if (bb
->loop_father
== loop
)
6810 print_loops_bb (file
, bb
, indent
, verbosity
);
6812 print_loop_and_siblings (file
, loop
->inner
, indent
+ 2, verbosity
);
6813 fprintf (file
, "%s}\n", s_indent
);
6817 /* Print the LOOP and its sibling loops on FILE, indented INDENT
6818 spaces. Following VERBOSITY level this outputs the contents of the
6819 loop, or just its structure. */
6822 print_loop_and_siblings (FILE *file
, struct loop
*loop
, int indent
, int verbosity
)
6827 print_loop (file
, loop
, indent
, verbosity
);
6828 print_loop_and_siblings (file
, loop
->next
, indent
, verbosity
);
6831 /* Follow a CFG edge from the entry point of the program, and on entry
6832 of a loop, pretty print the loop structure on FILE. */
6835 print_loops (FILE *file
, int verbosity
)
6839 bb
= ENTRY_BLOCK_PTR
;
6840 if (bb
&& bb
->loop_father
)
6841 print_loop_and_siblings (file
, bb
->loop_father
, 0, verbosity
);
6845 /* Debugging loops structure at tree level, at some VERBOSITY level. */
6848 debug_loops (int verbosity
)
6850 print_loops (stderr
, verbosity
);
6853 /* Print on stderr the code of LOOP, at some VERBOSITY level. */
6856 debug_loop (struct loop
*loop
, int verbosity
)
6858 print_loop (stderr
, loop
, 0, verbosity
);
6861 /* Print on stderr the code of loop number NUM, at some VERBOSITY
6865 debug_loop_num (unsigned num
, int verbosity
)
6867 debug_loop (get_loop (num
), verbosity
);
6870 /* Return true if BB ends with a call, possibly followed by some
6871 instructions that must stay with the call. Return false,
6875 gimple_block_ends_with_call_p (basic_block bb
)
6877 gimple_stmt_iterator gsi
= gsi_last_nondebug_bb (bb
);
6878 return is_gimple_call (gsi_stmt (gsi
));
6882 /* Return true if BB ends with a conditional branch. Return false,
6886 gimple_block_ends_with_condjump_p (const_basic_block bb
)
6888 gimple stmt
= last_stmt (CONST_CAST_BB (bb
));
6889 return (stmt
&& gimple_code (stmt
) == GIMPLE_COND
);
6893 /* Return true if we need to add fake edge to exit at statement T.
6894 Helper function for gimple_flow_call_edges_add. */
6897 need_fake_edge_p (gimple t
)
6899 tree fndecl
= NULL_TREE
;
6902 /* NORETURN and LONGJMP calls already have an edge to exit.
6903 CONST and PURE calls do not need one.
6904 We don't currently check for CONST and PURE here, although
6905 it would be a good idea, because those attributes are
6906 figured out from the RTL in mark_constant_function, and
6907 the counter incrementation code from -fprofile-arcs
6908 leads to different results from -fbranch-probabilities. */
6909 if (is_gimple_call (t
))
6911 fndecl
= gimple_call_fndecl (t
);
6912 call_flags
= gimple_call_flags (t
);
6915 if (is_gimple_call (t
)
6917 && DECL_BUILT_IN (fndecl
)
6918 && (call_flags
& ECF_NOTHROW
)
6919 && !(call_flags
& ECF_RETURNS_TWICE
)
6920 /* fork() doesn't really return twice, but the effect of
6921 wrapping it in __gcov_fork() which calls __gcov_flush()
6922 and clears the counters before forking has the same
6923 effect as returning twice. Force a fake edge. */
6924 && !(DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
6925 && DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_FORK
))
6928 if (is_gimple_call (t
)
6929 && !(call_flags
& ECF_NORETURN
))
6932 if (gimple_code (t
) == GIMPLE_ASM
6933 && (gimple_asm_volatile_p (t
) || gimple_asm_input_p (t
)))
6940 /* Add fake edges to the function exit for any non constant and non
6941 noreturn calls, volatile inline assembly in the bitmap of blocks
6942 specified by BLOCKS or to the whole CFG if BLOCKS is zero. Return
6943 the number of blocks that were split.
6945 The goal is to expose cases in which entering a basic block does
6946 not imply that all subsequent instructions must be executed. */
6949 gimple_flow_call_edges_add (sbitmap blocks
)
6952 int blocks_split
= 0;
6953 int last_bb
= last_basic_block
;
6954 bool check_last_block
= false;
6956 if (n_basic_blocks
== NUM_FIXED_BLOCKS
)
6960 check_last_block
= true;
6962 check_last_block
= TEST_BIT (blocks
, EXIT_BLOCK_PTR
->prev_bb
->index
);
6964 /* In the last basic block, before epilogue generation, there will be
6965 a fallthru edge to EXIT. Special care is required if the last insn
6966 of the last basic block is a call because make_edge folds duplicate
6967 edges, which would result in the fallthru edge also being marked
6968 fake, which would result in the fallthru edge being removed by
6969 remove_fake_edges, which would result in an invalid CFG.
6971 Moreover, we can't elide the outgoing fake edge, since the block
6972 profiler needs to take this into account in order to solve the minimal
6973 spanning tree in the case that the call doesn't return.
6975 Handle this by adding a dummy instruction in a new last basic block. */
6976 if (check_last_block
)
6978 basic_block bb
= EXIT_BLOCK_PTR
->prev_bb
;
6979 gimple_stmt_iterator gsi
= gsi_last_bb (bb
);
6982 if (!gsi_end_p (gsi
))
6985 if (t
&& need_fake_edge_p (t
))
6989 e
= find_edge (bb
, EXIT_BLOCK_PTR
);
6992 gsi_insert_on_edge (e
, gimple_build_nop ());
6993 gsi_commit_edge_inserts ();
6998 /* Now add fake edges to the function exit for any non constant
6999 calls since there is no way that we can determine if they will
7001 for (i
= 0; i
< last_bb
; i
++)
7003 basic_block bb
= BASIC_BLOCK (i
);
7004 gimple_stmt_iterator gsi
;
7005 gimple stmt
, last_stmt
;
7010 if (blocks
&& !TEST_BIT (blocks
, i
))
7013 gsi
= gsi_last_bb (bb
);
7014 if (!gsi_end_p (gsi
))
7016 last_stmt
= gsi_stmt (gsi
);
7019 stmt
= gsi_stmt (gsi
);
7020 if (need_fake_edge_p (stmt
))
7024 /* The handling above of the final block before the
7025 epilogue should be enough to verify that there is
7026 no edge to the exit block in CFG already.
7027 Calling make_edge in such case would cause us to
7028 mark that edge as fake and remove it later. */
7029 #ifdef ENABLE_CHECKING
7030 if (stmt
== last_stmt
)
7032 e
= find_edge (bb
, EXIT_BLOCK_PTR
);
7033 gcc_assert (e
== NULL
);
7037 /* Note that the following may create a new basic block
7038 and renumber the existing basic blocks. */
7039 if (stmt
!= last_stmt
)
7041 e
= split_block (bb
, stmt
);
7045 make_edge (bb
, EXIT_BLOCK_PTR
, EDGE_FAKE
);
7049 while (!gsi_end_p (gsi
));
7054 verify_flow_info ();
7056 return blocks_split
;
7059 /* Purge dead abnormal call edges from basic block BB. */
7062 gimple_purge_dead_abnormal_call_edges (basic_block bb
)
7064 bool changed
= gimple_purge_dead_eh_edges (bb
);
7066 if (cfun
->has_nonlocal_label
)
7068 gimple stmt
= last_stmt (bb
);
7072 if (!(stmt
&& stmt_can_make_abnormal_goto (stmt
)))
7073 for (ei
= ei_start (bb
->succs
); (e
= ei_safe_edge (ei
)); )
7075 if (e
->flags
& EDGE_ABNORMAL
)
7084 /* See gimple_purge_dead_eh_edges below. */
7086 free_dominance_info (CDI_DOMINATORS
);
7092 /* Removes edge E and all the blocks dominated by it, and updates dominance
7093 information. The IL in E->src needs to be updated separately.
7094 If dominance info is not available, only the edge E is removed.*/
7097 remove_edge_and_dominated_blocks (edge e
)
7099 VEC (basic_block
, heap
) *bbs_to_remove
= NULL
;
7100 VEC (basic_block
, heap
) *bbs_to_fix_dom
= NULL
;
7104 bool none_removed
= false;
7106 basic_block bb
, dbb
;
7109 if (!dom_info_available_p (CDI_DOMINATORS
))
7115 /* No updating is needed for edges to exit. */
7116 if (e
->dest
== EXIT_BLOCK_PTR
)
7118 if (cfgcleanup_altered_bbs
)
7119 bitmap_set_bit (cfgcleanup_altered_bbs
, e
->src
->index
);
7124 /* First, we find the basic blocks to remove. If E->dest has a predecessor
7125 that is not dominated by E->dest, then this set is empty. Otherwise,
7126 all the basic blocks dominated by E->dest are removed.
7128 Also, to DF_IDOM we store the immediate dominators of the blocks in
7129 the dominance frontier of E (i.e., of the successors of the
7130 removed blocks, if there are any, and of E->dest otherwise). */
7131 FOR_EACH_EDGE (f
, ei
, e
->dest
->preds
)
7136 if (!dominated_by_p (CDI_DOMINATORS
, f
->src
, e
->dest
))
7138 none_removed
= true;
7143 df
= BITMAP_ALLOC (NULL
);
7144 df_idom
= BITMAP_ALLOC (NULL
);
7147 bitmap_set_bit (df_idom
,
7148 get_immediate_dominator (CDI_DOMINATORS
, e
->dest
)->index
);
7151 bbs_to_remove
= get_all_dominated_blocks (CDI_DOMINATORS
, e
->dest
);
7152 for (i
= 0; VEC_iterate (basic_block
, bbs_to_remove
, i
, bb
); i
++)
7154 FOR_EACH_EDGE (f
, ei
, bb
->succs
)
7156 if (f
->dest
!= EXIT_BLOCK_PTR
)
7157 bitmap_set_bit (df
, f
->dest
->index
);
7160 for (i
= 0; VEC_iterate (basic_block
, bbs_to_remove
, i
, bb
); i
++)
7161 bitmap_clear_bit (df
, bb
->index
);
7163 EXECUTE_IF_SET_IN_BITMAP (df
, 0, i
, bi
)
7165 bb
= BASIC_BLOCK (i
);
7166 bitmap_set_bit (df_idom
,
7167 get_immediate_dominator (CDI_DOMINATORS
, bb
)->index
);
7171 if (cfgcleanup_altered_bbs
)
7173 /* Record the set of the altered basic blocks. */
7174 bitmap_set_bit (cfgcleanup_altered_bbs
, e
->src
->index
);
7175 bitmap_ior_into (cfgcleanup_altered_bbs
, df
);
7178 /* Remove E and the cancelled blocks. */
7183 /* Walk backwards so as to get a chance to substitute all
7184 released DEFs into debug stmts. See
7185 eliminate_unnecessary_stmts() in tree-ssa-dce.c for more
7187 for (i
= VEC_length (basic_block
, bbs_to_remove
); i
-- > 0; )
7188 delete_basic_block (VEC_index (basic_block
, bbs_to_remove
, i
));
7191 /* Update the dominance information. The immediate dominator may change only
7192 for blocks whose immediate dominator belongs to DF_IDOM:
7194 Suppose that idom(X) = Y before removal of E and idom(X) != Y after the
7195 removal. Let Z the arbitrary block such that idom(Z) = Y and
7196 Z dominates X after the removal. Before removal, there exists a path P
7197 from Y to X that avoids Z. Let F be the last edge on P that is
7198 removed, and let W = F->dest. Before removal, idom(W) = Y (since Y
7199 dominates W, and because of P, Z does not dominate W), and W belongs to
7200 the dominance frontier of E. Therefore, Y belongs to DF_IDOM. */
7201 EXECUTE_IF_SET_IN_BITMAP (df_idom
, 0, i
, bi
)
7203 bb
= BASIC_BLOCK (i
);
7204 for (dbb
= first_dom_son (CDI_DOMINATORS
, bb
);
7206 dbb
= next_dom_son (CDI_DOMINATORS
, dbb
))
7207 VEC_safe_push (basic_block
, heap
, bbs_to_fix_dom
, dbb
);
7210 iterate_fix_dominators (CDI_DOMINATORS
, bbs_to_fix_dom
, true);
7213 BITMAP_FREE (df_idom
);
7214 VEC_free (basic_block
, heap
, bbs_to_remove
);
7215 VEC_free (basic_block
, heap
, bbs_to_fix_dom
);
7218 /* Purge dead EH edges from basic block BB. */
7221 gimple_purge_dead_eh_edges (basic_block bb
)
7223 bool changed
= false;
7226 gimple stmt
= last_stmt (bb
);
7228 if (stmt
&& stmt_can_throw_internal (stmt
))
7231 for (ei
= ei_start (bb
->succs
); (e
= ei_safe_edge (ei
)); )
7233 if (e
->flags
& EDGE_EH
)
7235 remove_edge_and_dominated_blocks (e
);
7246 gimple_purge_all_dead_eh_edges (const_bitmap blocks
)
7248 bool changed
= false;
7252 EXECUTE_IF_SET_IN_BITMAP (blocks
, 0, i
, bi
)
7254 basic_block bb
= BASIC_BLOCK (i
);
7256 /* Earlier gimple_purge_dead_eh_edges could have removed
7257 this basic block already. */
7258 gcc_assert (bb
|| changed
);
7260 changed
|= gimple_purge_dead_eh_edges (bb
);
7266 /* This function is called whenever a new edge is created or
7270 gimple_execute_on_growing_pred (edge e
)
7272 basic_block bb
= e
->dest
;
7275 reserve_phi_args_for_new_edge (bb
);
7278 /* This function is called immediately before edge E is removed from
7279 the edge vector E->dest->preds. */
7282 gimple_execute_on_shrinking_pred (edge e
)
7284 if (phi_nodes (e
->dest
))
7285 remove_phi_args (e
);
7288 /*---------------------------------------------------------------------------
7289 Helper functions for Loop versioning
7290 ---------------------------------------------------------------------------*/
7292 /* Adjust phi nodes for 'first' basic block. 'second' basic block is a copy
7293 of 'first'. Both of them are dominated by 'new_head' basic block. When
7294 'new_head' was created by 'second's incoming edge it received phi arguments
7295 on the edge by split_edge(). Later, additional edge 'e' was created to
7296 connect 'new_head' and 'first'. Now this routine adds phi args on this
7297 additional edge 'e' that new_head to second edge received as part of edge
7301 gimple_lv_adjust_loop_header_phi (basic_block first
, basic_block second
,
7302 basic_block new_head
, edge e
)
7305 gimple_stmt_iterator psi1
, psi2
;
7307 edge e2
= find_edge (new_head
, second
);
7309 /* Because NEW_HEAD has been created by splitting SECOND's incoming
7310 edge, we should always have an edge from NEW_HEAD to SECOND. */
7311 gcc_assert (e2
!= NULL
);
7313 /* Browse all 'second' basic block phi nodes and add phi args to
7314 edge 'e' for 'first' head. PHI args are always in correct order. */
7316 for (psi2
= gsi_start_phis (second
),
7317 psi1
= gsi_start_phis (first
);
7318 !gsi_end_p (psi2
) && !gsi_end_p (psi1
);
7319 gsi_next (&psi2
), gsi_next (&psi1
))
7321 phi1
= gsi_stmt (psi1
);
7322 phi2
= gsi_stmt (psi2
);
7323 def
= PHI_ARG_DEF (phi2
, e2
->dest_idx
);
7324 add_phi_arg (phi1
, def
, e
, gimple_phi_arg_location_from_edge (phi2
, e2
));
7329 /* Adds a if else statement to COND_BB with condition COND_EXPR.
7330 SECOND_HEAD is the destination of the THEN and FIRST_HEAD is
7331 the destination of the ELSE part. */
7334 gimple_lv_add_condition_to_bb (basic_block first_head ATTRIBUTE_UNUSED
,
7335 basic_block second_head ATTRIBUTE_UNUSED
,
7336 basic_block cond_bb
, void *cond_e
)
7338 gimple_stmt_iterator gsi
;
7339 gimple new_cond_expr
;
7340 tree cond_expr
= (tree
) cond_e
;
7343 /* Build new conditional expr */
7344 new_cond_expr
= gimple_build_cond_from_tree (cond_expr
,
7345 NULL_TREE
, NULL_TREE
);
7347 /* Add new cond in cond_bb. */
7348 gsi
= gsi_last_bb (cond_bb
);
7349 gsi_insert_after (&gsi
, new_cond_expr
, GSI_NEW_STMT
);
7351 /* Adjust edges appropriately to connect new head with first head
7352 as well as second head. */
7353 e0
= single_succ_edge (cond_bb
);
7354 e0
->flags
&= ~EDGE_FALLTHRU
;
7355 e0
->flags
|= EDGE_FALSE_VALUE
;
7358 struct cfg_hooks gimple_cfg_hooks
= {
7360 gimple_verify_flow_info
,
7361 gimple_dump_bb
, /* dump_bb */
7362 create_bb
, /* create_basic_block */
7363 gimple_redirect_edge_and_branch
, /* redirect_edge_and_branch */
7364 gimple_redirect_edge_and_branch_force
, /* redirect_edge_and_branch_force */
7365 gimple_can_remove_branch_p
, /* can_remove_branch_p */
7366 remove_bb
, /* delete_basic_block */
7367 gimple_split_block
, /* split_block */
7368 gimple_move_block_after
, /* move_block_after */
7369 gimple_can_merge_blocks_p
, /* can_merge_blocks_p */
7370 gimple_merge_blocks
, /* merge_blocks */
7371 gimple_predict_edge
, /* predict_edge */
7372 gimple_predicted_by_p
, /* predicted_by_p */
7373 gimple_can_duplicate_bb_p
, /* can_duplicate_block_p */
7374 gimple_duplicate_bb
, /* duplicate_block */
7375 gimple_split_edge
, /* split_edge */
7376 gimple_make_forwarder_block
, /* make_forward_block */
7377 NULL
, /* tidy_fallthru_edge */
7378 gimple_block_ends_with_call_p
,/* block_ends_with_call_p */
7379 gimple_block_ends_with_condjump_p
, /* block_ends_with_condjump_p */
7380 gimple_flow_call_edges_add
, /* flow_call_edges_add */
7381 gimple_execute_on_growing_pred
, /* execute_on_growing_pred */
7382 gimple_execute_on_shrinking_pred
, /* execute_on_shrinking_pred */
7383 gimple_duplicate_loop_to_header_edge
, /* duplicate loop for trees */
7384 gimple_lv_add_condition_to_bb
, /* lv_add_condition_to_bb */
7385 gimple_lv_adjust_loop_header_phi
, /* lv_adjust_loop_header_phi*/
7386 extract_true_false_edges_from_block
, /* extract_cond_bb_edges */
7387 flush_pending_stmts
/* flush_pending_stmts */
7391 /* Split all critical edges. */
7394 split_critical_edges (void)
7400 /* split_edge can redirect edges out of SWITCH_EXPRs, which can get
7401 expensive. So we want to enable recording of edge to CASE_LABEL_EXPR
7402 mappings around the calls to split_edge. */
7403 start_recording_case_labels ();
7406 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
7408 if (EDGE_CRITICAL_P (e
) && !(e
->flags
& EDGE_ABNORMAL
))
7410 /* PRE inserts statements to edges and expects that
7411 since split_critical_edges was done beforehand, committing edge
7412 insertions will not split more edges. In addition to critical
7413 edges we must split edges that have multiple successors and
7414 end by control flow statements, such as RESX.
7415 Go ahead and split them too. This matches the logic in
7416 gimple_find_edge_insert_loc. */
7417 else if ((!single_pred_p (e
->dest
)
7418 || !gimple_seq_empty_p (phi_nodes (e
->dest
))
7419 || e
->dest
== EXIT_BLOCK_PTR
)
7420 && e
->src
!= ENTRY_BLOCK_PTR
7421 && !(e
->flags
& EDGE_ABNORMAL
))
7423 gimple_stmt_iterator gsi
;
7425 gsi
= gsi_last_bb (e
->src
);
7426 if (!gsi_end_p (gsi
)
7427 && stmt_ends_bb_p (gsi_stmt (gsi
))
7428 && gimple_code (gsi_stmt (gsi
)) != GIMPLE_RETURN
)
7433 end_recording_case_labels ();
7437 struct gimple_opt_pass pass_split_crit_edges
=
7441 "crited", /* name */
7443 split_critical_edges
, /* execute */
7446 0, /* static_pass_number */
7447 TV_TREE_SPLIT_EDGES
, /* tv_id */
7448 PROP_cfg
, /* properties required */
7449 PROP_no_crit_edges
, /* properties_provided */
7450 0, /* properties_destroyed */
7451 0, /* todo_flags_start */
7452 TODO_dump_func
| TODO_verify_flow
/* todo_flags_finish */
7457 /* Build a ternary operation and gimplify it. Emit code before GSI.
7458 Return the gimple_val holding the result. */
7461 gimplify_build3 (gimple_stmt_iterator
*gsi
, enum tree_code code
,
7462 tree type
, tree a
, tree b
, tree c
)
7465 location_t loc
= gimple_location (gsi_stmt (*gsi
));
7467 ret
= fold_build3_loc (loc
, code
, type
, a
, b
, c
);
7470 return force_gimple_operand_gsi (gsi
, ret
, true, NULL
, true,
7474 /* Build a binary operation and gimplify it. Emit code before GSI.
7475 Return the gimple_val holding the result. */
7478 gimplify_build2 (gimple_stmt_iterator
*gsi
, enum tree_code code
,
7479 tree type
, tree a
, tree b
)
7483 ret
= fold_build2_loc (gimple_location (gsi_stmt (*gsi
)), code
, type
, a
, b
);
7486 return force_gimple_operand_gsi (gsi
, ret
, true, NULL
, true,
7490 /* Build a unary operation and gimplify it. Emit code before GSI.
7491 Return the gimple_val holding the result. */
7494 gimplify_build1 (gimple_stmt_iterator
*gsi
, enum tree_code code
, tree type
,
7499 ret
= fold_build1_loc (gimple_location (gsi_stmt (*gsi
)), code
, type
, a
);
7502 return force_gimple_operand_gsi (gsi
, ret
, true, NULL
, true,
7508 /* Emit return warnings. */
7511 execute_warn_function_return (void)
7513 source_location location
;
7518 /* If we have a path to EXIT, then we do return. */
7519 if (TREE_THIS_VOLATILE (cfun
->decl
)
7520 && EDGE_COUNT (EXIT_BLOCK_PTR
->preds
) > 0)
7522 location
= UNKNOWN_LOCATION
;
7523 FOR_EACH_EDGE (e
, ei
, EXIT_BLOCK_PTR
->preds
)
7525 last
= last_stmt (e
->src
);
7526 if (gimple_code (last
) == GIMPLE_RETURN
7527 && (location
= gimple_location (last
)) != UNKNOWN_LOCATION
)
7530 if (location
== UNKNOWN_LOCATION
)
7531 location
= cfun
->function_end_locus
;
7532 warning_at (location
, 0, "%<noreturn%> function does return");
7535 /* If we see "return;" in some basic block, then we do reach the end
7536 without returning a value. */
7537 else if (warn_return_type
7538 && !TREE_NO_WARNING (cfun
->decl
)
7539 && EDGE_COUNT (EXIT_BLOCK_PTR
->preds
) > 0
7540 && !VOID_TYPE_P (TREE_TYPE (TREE_TYPE (cfun
->decl
))))
7542 FOR_EACH_EDGE (e
, ei
, EXIT_BLOCK_PTR
->preds
)
7544 gimple last
= last_stmt (e
->src
);
7545 if (gimple_code (last
) == GIMPLE_RETURN
7546 && gimple_return_retval (last
) == NULL
7547 && !gimple_no_warning_p (last
))
7549 location
= gimple_location (last
);
7550 if (location
== UNKNOWN_LOCATION
)
7551 location
= cfun
->function_end_locus
;
7552 warning_at (location
, OPT_Wreturn_type
, "control reaches end of non-void function");
7553 TREE_NO_WARNING (cfun
->decl
) = 1;
7562 /* Given a basic block B which ends with a conditional and has
7563 precisely two successors, determine which of the edges is taken if
7564 the conditional is true and which is taken if the conditional is
7565 false. Set TRUE_EDGE and FALSE_EDGE appropriately. */
7568 extract_true_false_edges_from_block (basic_block b
,
7572 edge e
= EDGE_SUCC (b
, 0);
7574 if (e
->flags
& EDGE_TRUE_VALUE
)
7577 *false_edge
= EDGE_SUCC (b
, 1);
7582 *true_edge
= EDGE_SUCC (b
, 1);
7586 struct gimple_opt_pass pass_warn_function_return
=
7592 execute_warn_function_return
, /* execute */
7595 0, /* static_pass_number */
7596 TV_NONE
, /* tv_id */
7597 PROP_cfg
, /* properties_required */
7598 0, /* properties_provided */
7599 0, /* properties_destroyed */
7600 0, /* todo_flags_start */
7601 0 /* todo_flags_finish */
7605 /* Emit noreturn warnings. */
7608 execute_warn_function_noreturn (void)
7610 if (warn_missing_noreturn
7611 && !TREE_THIS_VOLATILE (cfun
->decl
)
7612 && EDGE_COUNT (EXIT_BLOCK_PTR
->preds
) == 0
7613 && !lang_hooks
.missing_noreturn_ok_p (cfun
->decl
))
7614 warning_at (DECL_SOURCE_LOCATION (cfun
->decl
), OPT_Wmissing_noreturn
,
7615 "function might be possible candidate "
7616 "for attribute %<noreturn%>");
7620 struct gimple_opt_pass pass_warn_function_noreturn
=
7626 execute_warn_function_noreturn
, /* execute */
7629 0, /* static_pass_number */
7630 TV_NONE
, /* tv_id */
7631 PROP_cfg
, /* properties_required */
7632 0, /* properties_provided */
7633 0, /* properties_destroyed */
7634 0, /* todo_flags_start */
7635 0 /* todo_flags_finish */
7640 /* Walk a gimplified function and warn for functions whose return value is
7641 ignored and attribute((warn_unused_result)) is set. This is done before
7642 inlining, so we don't have to worry about that. */
7645 do_warn_unused_result (gimple_seq seq
)
7648 gimple_stmt_iterator i
;
7650 for (i
= gsi_start (seq
); !gsi_end_p (i
); gsi_next (&i
))
7652 gimple g
= gsi_stmt (i
);
7654 switch (gimple_code (g
))
7657 do_warn_unused_result (gimple_bind_body (g
));
7660 do_warn_unused_result (gimple_try_eval (g
));
7661 do_warn_unused_result (gimple_try_cleanup (g
));
7664 do_warn_unused_result (gimple_catch_handler (g
));
7666 case GIMPLE_EH_FILTER
:
7667 do_warn_unused_result (gimple_eh_filter_failure (g
));
7671 if (gimple_call_lhs (g
))
7674 /* This is a naked call, as opposed to a GIMPLE_CALL with an
7675 LHS. All calls whose value is ignored should be
7676 represented like this. Look for the attribute. */
7677 fdecl
= gimple_call_fndecl (g
);
7678 ftype
= TREE_TYPE (TREE_TYPE (gimple_call_fn (g
)));
7680 if (lookup_attribute ("warn_unused_result", TYPE_ATTRIBUTES (ftype
)))
7682 location_t loc
= gimple_location (g
);
7685 warning_at (loc
, OPT_Wunused_result
,
7686 "ignoring return value of %qD, "
7687 "declared with attribute warn_unused_result",
7690 warning_at (loc
, OPT_Wunused_result
,
7691 "ignoring return value of function "
7692 "declared with attribute warn_unused_result");
7697 /* Not a container, not a call, or a call whose value is used. */
7704 run_warn_unused_result (void)
7706 do_warn_unused_result (gimple_body (current_function_decl
));
7711 gate_warn_unused_result (void)
7713 return flag_warn_unused_result
;
7716 struct gimple_opt_pass pass_warn_unused_result
=
7720 "*warn_unused_result", /* name */
7721 gate_warn_unused_result
, /* gate */
7722 run_warn_unused_result
, /* execute */
7725 0, /* static_pass_number */
7726 TV_NONE
, /* tv_id */
7727 PROP_gimple_any
, /* properties_required */
7728 0, /* properties_provided */
7729 0, /* properties_destroyed */
7730 0, /* todo_flags_start */
7731 0, /* todo_flags_finish */