1 /* Control flow functions for trees.
2 Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009,
3 2010, 2011, 2012 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"
28 #include "basic-block.h"
32 #include "langhooks.h"
33 #include "tree-pretty-print.h"
34 #include "gimple-pretty-print.h"
35 #include "tree-flow.h"
37 #include "tree-dump.h"
38 #include "tree-pass.h"
39 #include "diagnostic-core.h"
42 #include "cfglayout.h" /* for can_copy_bbs_p and copy_bbs */
43 #include "tree-ssa-propagate.h"
44 #include "value-prof.h"
45 #include "pointer-set.h"
46 #include "tree-inline.h"
48 /* This file contains functions for building the Control Flow Graph (CFG)
49 for a function tree. */
51 /* Local declarations. */
53 /* Initial capacity for the basic block array. */
54 static const int initial_cfg_capacity
= 20;
56 /* This hash table allows us to efficiently lookup all CASE_LABEL_EXPRs
57 which use a particular edge. The CASE_LABEL_EXPRs are chained together
58 via their CASE_CHAIN field, which we clear after we're done with the
59 hash table to prevent problems with duplication of GIMPLE_SWITCHes.
61 Access to this list of CASE_LABEL_EXPRs allows us to efficiently
62 update the case vector in response to edge redirections.
64 Right now this table is set up and torn down at key points in the
65 compilation process. It would be nice if we could make the table
66 more persistent. The key is getting notification of changes to
67 the CFG (particularly edge removal, creation and redirection). */
69 static struct pointer_map_t
*edge_to_cases
;
71 /* If we record edge_to_cases, this bitmap will hold indexes
72 of basic blocks that end in a GIMPLE_SWITCH which we touched
73 due to edge manipulations. */
75 static bitmap touched_switch_bbs
;
80 long num_merged_labels
;
83 static struct cfg_stats_d cfg_stats
;
85 /* Nonzero if we found a computed goto while building basic blocks. */
86 static bool found_computed_goto
;
88 /* Hash table to store last discriminator assigned for each locus. */
89 struct locus_discrim_map
94 static htab_t discriminator_per_locus
;
96 /* Basic blocks and flowgraphs. */
97 static void make_blocks (gimple_seq
);
98 static void factor_computed_gotos (void);
101 static void make_edges (void);
102 static void make_cond_expr_edges (basic_block
);
103 static void make_gimple_switch_edges (basic_block
);
104 static void make_goto_expr_edges (basic_block
);
105 static void make_gimple_asm_edges (basic_block
);
106 static unsigned int locus_map_hash (const void *);
107 static int locus_map_eq (const void *, const void *);
108 static void assign_discriminator (location_t
, basic_block
);
109 static edge
gimple_redirect_edge_and_branch (edge
, basic_block
);
110 static edge
gimple_try_redirect_by_replacing_jump (edge
, basic_block
);
111 static unsigned int split_critical_edges (void);
113 /* Various helpers. */
114 static inline bool stmt_starts_bb_p (gimple
, gimple
);
115 static int gimple_verify_flow_info (void);
116 static void gimple_make_forwarder_block (edge
);
117 static void gimple_cfg2vcg (FILE *);
118 static gimple
first_non_label_stmt (basic_block
);
119 static bool verify_gimple_transaction (gimple
);
121 /* Flowgraph optimization and cleanup. */
122 static void gimple_merge_blocks (basic_block
, basic_block
);
123 static bool gimple_can_merge_blocks_p (basic_block
, basic_block
);
124 static void remove_bb (basic_block
);
125 static edge
find_taken_edge_computed_goto (basic_block
, tree
);
126 static edge
find_taken_edge_cond_expr (basic_block
, tree
);
127 static edge
find_taken_edge_switch_expr (basic_block
, tree
);
128 static tree
find_case_label_for_value (gimple
, tree
);
129 static void group_case_labels_stmt (gimple
);
132 init_empty_tree_cfg_for_function (struct function
*fn
)
134 /* Initialize the basic block array. */
136 profile_status_for_function (fn
) = PROFILE_ABSENT
;
137 n_basic_blocks_for_function (fn
) = NUM_FIXED_BLOCKS
;
138 last_basic_block_for_function (fn
) = NUM_FIXED_BLOCKS
;
139 basic_block_info_for_function (fn
)
140 = VEC_alloc (basic_block
, gc
, initial_cfg_capacity
);
141 VEC_safe_grow_cleared (basic_block
, gc
,
142 basic_block_info_for_function (fn
),
143 initial_cfg_capacity
);
145 /* Build a mapping of labels to their associated blocks. */
146 label_to_block_map_for_function (fn
)
147 = VEC_alloc (basic_block
, gc
, initial_cfg_capacity
);
148 VEC_safe_grow_cleared (basic_block
, gc
,
149 label_to_block_map_for_function (fn
),
150 initial_cfg_capacity
);
152 SET_BASIC_BLOCK_FOR_FUNCTION (fn
, ENTRY_BLOCK
,
153 ENTRY_BLOCK_PTR_FOR_FUNCTION (fn
));
154 SET_BASIC_BLOCK_FOR_FUNCTION (fn
, EXIT_BLOCK
,
155 EXIT_BLOCK_PTR_FOR_FUNCTION (fn
));
157 ENTRY_BLOCK_PTR_FOR_FUNCTION (fn
)->next_bb
158 = EXIT_BLOCK_PTR_FOR_FUNCTION (fn
);
159 EXIT_BLOCK_PTR_FOR_FUNCTION (fn
)->prev_bb
160 = ENTRY_BLOCK_PTR_FOR_FUNCTION (fn
);
164 init_empty_tree_cfg (void)
166 init_empty_tree_cfg_for_function (cfun
);
169 /*---------------------------------------------------------------------------
171 ---------------------------------------------------------------------------*/
173 /* Entry point to the CFG builder for trees. SEQ is the sequence of
174 statements to be added to the flowgraph. */
177 build_gimple_cfg (gimple_seq seq
)
179 /* Register specific gimple functions. */
180 gimple_register_cfg_hooks ();
182 memset ((void *) &cfg_stats
, 0, sizeof (cfg_stats
));
184 init_empty_tree_cfg ();
186 found_computed_goto
= 0;
189 /* Computed gotos are hell to deal with, especially if there are
190 lots of them with a large number of destinations. So we factor
191 them to a common computed goto location before we build the
192 edge list. After we convert back to normal form, we will un-factor
193 the computed gotos since factoring introduces an unwanted jump. */
194 if (found_computed_goto
)
195 factor_computed_gotos ();
197 /* Make sure there is always at least one block, even if it's empty. */
198 if (n_basic_blocks
== NUM_FIXED_BLOCKS
)
199 create_empty_bb (ENTRY_BLOCK_PTR
);
201 /* Adjust the size of the array. */
202 if (VEC_length (basic_block
, basic_block_info
) < (size_t) n_basic_blocks
)
203 VEC_safe_grow_cleared (basic_block
, gc
, basic_block_info
, n_basic_blocks
);
205 /* To speed up statement iterator walks, we first purge dead labels. */
206 cleanup_dead_labels ();
208 /* Group case nodes to reduce the number of edges.
209 We do this after cleaning up dead labels because otherwise we miss
210 a lot of obvious case merging opportunities. */
211 group_case_labels ();
213 /* Create the edges of the flowgraph. */
214 discriminator_per_locus
= htab_create (13, locus_map_hash
, locus_map_eq
,
217 cleanup_dead_labels ();
218 htab_delete (discriminator_per_locus
);
220 /* Debugging dumps. */
222 /* Write the flowgraph to a VCG file. */
224 int local_dump_flags
;
225 FILE *vcg_file
= dump_begin (TDI_vcg
, &local_dump_flags
);
228 gimple_cfg2vcg (vcg_file
);
229 dump_end (TDI_vcg
, vcg_file
);
235 execute_build_cfg (void)
237 gimple_seq body
= gimple_body (current_function_decl
);
239 build_gimple_cfg (body
);
240 gimple_set_body (current_function_decl
, NULL
);
241 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
243 fprintf (dump_file
, "Scope blocks:\n");
244 dump_scope_blocks (dump_file
, dump_flags
);
249 struct gimple_opt_pass pass_build_cfg
=
255 execute_build_cfg
, /* execute */
258 0, /* static_pass_number */
259 TV_TREE_CFG
, /* tv_id */
260 PROP_gimple_leh
, /* properties_required */
261 PROP_cfg
, /* properties_provided */
262 0, /* properties_destroyed */
263 0, /* todo_flags_start */
264 TODO_verify_stmts
| TODO_cleanup_cfg
/* todo_flags_finish */
269 /* Return true if T is a computed goto. */
272 computed_goto_p (gimple t
)
274 return (gimple_code (t
) == GIMPLE_GOTO
275 && TREE_CODE (gimple_goto_dest (t
)) != LABEL_DECL
);
279 /* Search the CFG for any computed gotos. If found, factor them to a
280 common computed goto site. Also record the location of that site so
281 that we can un-factor the gotos after we have converted back to
285 factor_computed_gotos (void)
288 tree factored_label_decl
= NULL
;
290 gimple factored_computed_goto_label
= NULL
;
291 gimple factored_computed_goto
= NULL
;
293 /* We know there are one or more computed gotos in this function.
294 Examine the last statement in each basic block to see if the block
295 ends with a computed goto. */
299 gimple_stmt_iterator gsi
= gsi_last_bb (bb
);
305 last
= gsi_stmt (gsi
);
307 /* Ignore the computed goto we create when we factor the original
309 if (last
== factored_computed_goto
)
312 /* If the last statement is a computed goto, factor it. */
313 if (computed_goto_p (last
))
317 /* The first time we find a computed goto we need to create
318 the factored goto block and the variable each original
319 computed goto will use for their goto destination. */
320 if (!factored_computed_goto
)
322 basic_block new_bb
= create_empty_bb (bb
);
323 gimple_stmt_iterator new_gsi
= gsi_start_bb (new_bb
);
325 /* Create the destination of the factored goto. Each original
326 computed goto will put its desired destination into this
327 variable and jump to the label we create immediately
329 var
= create_tmp_var (ptr_type_node
, "gotovar");
331 /* Build a label for the new block which will contain the
332 factored computed goto. */
333 factored_label_decl
= create_artificial_label (UNKNOWN_LOCATION
);
334 factored_computed_goto_label
335 = gimple_build_label (factored_label_decl
);
336 gsi_insert_after (&new_gsi
, factored_computed_goto_label
,
339 /* Build our new computed goto. */
340 factored_computed_goto
= gimple_build_goto (var
);
341 gsi_insert_after (&new_gsi
, factored_computed_goto
, GSI_NEW_STMT
);
344 /* Copy the original computed goto's destination into VAR. */
345 assignment
= gimple_build_assign (var
, gimple_goto_dest (last
));
346 gsi_insert_before (&gsi
, assignment
, GSI_SAME_STMT
);
348 /* And re-vector the computed goto to the new destination. */
349 gimple_goto_set_dest (last
, factored_label_decl
);
355 /* Build a flowgraph for the sequence of stmts SEQ. */
358 make_blocks (gimple_seq seq
)
360 gimple_stmt_iterator i
= gsi_start (seq
);
362 bool start_new_block
= true;
363 bool first_stmt_of_seq
= true;
364 basic_block bb
= ENTRY_BLOCK_PTR
;
366 while (!gsi_end_p (i
))
373 /* If the statement starts a new basic block or if we have determined
374 in a previous pass that we need to create a new block for STMT, do
376 if (start_new_block
|| stmt_starts_bb_p (stmt
, prev_stmt
))
378 if (!first_stmt_of_seq
)
379 gsi_split_seq_before (&i
, &seq
);
380 bb
= create_basic_block (seq
, NULL
, bb
);
381 start_new_block
= false;
384 /* Now add STMT to BB and create the subgraphs for special statement
386 gimple_set_bb (stmt
, bb
);
388 if (computed_goto_p (stmt
))
389 found_computed_goto
= true;
391 /* If STMT is a basic block terminator, set START_NEW_BLOCK for the
393 if (stmt_ends_bb_p (stmt
))
395 /* If the stmt can make abnormal goto use a new temporary
396 for the assignment to the LHS. This makes sure the old value
397 of the LHS is available on the abnormal edge. Otherwise
398 we will end up with overlapping life-ranges for abnormal
400 if (gimple_has_lhs (stmt
)
401 && stmt_can_make_abnormal_goto (stmt
)
402 && is_gimple_reg_type (TREE_TYPE (gimple_get_lhs (stmt
))))
404 tree lhs
= gimple_get_lhs (stmt
);
405 tree tmp
= create_tmp_var (TREE_TYPE (lhs
), NULL
);
406 gimple s
= gimple_build_assign (lhs
, tmp
);
407 gimple_set_location (s
, gimple_location (stmt
));
408 gimple_set_block (s
, gimple_block (stmt
));
409 gimple_set_lhs (stmt
, tmp
);
410 if (TREE_CODE (TREE_TYPE (tmp
)) == COMPLEX_TYPE
411 || TREE_CODE (TREE_TYPE (tmp
)) == VECTOR_TYPE
)
412 DECL_GIMPLE_REG_P (tmp
) = 1;
413 gsi_insert_after (&i
, s
, GSI_SAME_STMT
);
415 start_new_block
= true;
419 first_stmt_of_seq
= false;
424 /* Create and return a new empty basic block after bb AFTER. */
427 create_bb (void *h
, void *e
, basic_block after
)
433 /* Create and initialize a new basic block. Since alloc_block uses
434 GC allocation that clears memory to allocate a basic block, we do
435 not have to clear the newly allocated basic block here. */
438 bb
->index
= last_basic_block
;
440 set_bb_seq (bb
, h
? (gimple_seq
) h
: NULL
);
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 /* BUILTIN_RETURN is really a return statement. */
564 if (gimple_call_builtin_p (last
, BUILT_IN_RETURN
))
565 make_edge (bb
, EXIT_BLOCK_PTR
, 0), fallthru
= false;
566 /* Some calls are known not to return. */
568 fallthru
= !(gimple_call_flags (last
) & ECF_NORETURN
);
572 /* A GIMPLE_ASSIGN may throw internally and thus be considered
574 if (is_ctrl_altering_stmt (last
))
575 make_eh_edges (last
);
580 make_gimple_asm_edges (bb
);
584 case GIMPLE_OMP_PARALLEL
:
585 case GIMPLE_OMP_TASK
:
587 case GIMPLE_OMP_SINGLE
:
588 case GIMPLE_OMP_MASTER
:
589 case GIMPLE_OMP_ORDERED
:
590 case GIMPLE_OMP_CRITICAL
:
591 case GIMPLE_OMP_SECTION
:
592 cur_region
= new_omp_region (bb
, code
, cur_region
);
596 case GIMPLE_OMP_SECTIONS
:
597 cur_region
= new_omp_region (bb
, code
, cur_region
);
601 case GIMPLE_OMP_SECTIONS_SWITCH
:
605 case GIMPLE_OMP_ATOMIC_LOAD
:
606 case GIMPLE_OMP_ATOMIC_STORE
:
610 case GIMPLE_OMP_RETURN
:
611 /* In the case of a GIMPLE_OMP_SECTION, the edge will go
612 somewhere other than the next block. This will be
614 cur_region
->exit
= bb
;
615 fallthru
= cur_region
->type
!= GIMPLE_OMP_SECTION
;
616 cur_region
= cur_region
->outer
;
619 case GIMPLE_OMP_CONTINUE
:
620 cur_region
->cont
= bb
;
621 switch (cur_region
->type
)
624 /* Mark all GIMPLE_OMP_FOR and GIMPLE_OMP_CONTINUE
625 succs edges as abnormal to prevent splitting
627 single_succ_edge (cur_region
->entry
)->flags
|= EDGE_ABNORMAL
;
628 /* Make the loopback edge. */
629 make_edge (bb
, single_succ (cur_region
->entry
),
632 /* Create an edge from GIMPLE_OMP_FOR to exit, which
633 corresponds to the case that the body of the loop
634 is not executed at all. */
635 make_edge (cur_region
->entry
, bb
->next_bb
, EDGE_ABNORMAL
);
636 make_edge (bb
, bb
->next_bb
, EDGE_FALLTHRU
| EDGE_ABNORMAL
);
640 case GIMPLE_OMP_SECTIONS
:
641 /* Wire up the edges into and out of the nested sections. */
643 basic_block switch_bb
= single_succ (cur_region
->entry
);
645 struct omp_region
*i
;
646 for (i
= cur_region
->inner
; i
; i
= i
->next
)
648 gcc_assert (i
->type
== GIMPLE_OMP_SECTION
);
649 make_edge (switch_bb
, i
->entry
, 0);
650 make_edge (i
->exit
, bb
, EDGE_FALLTHRU
);
653 /* Make the loopback edge to the block with
654 GIMPLE_OMP_SECTIONS_SWITCH. */
655 make_edge (bb
, switch_bb
, 0);
657 /* Make the edge from the switch to exit. */
658 make_edge (switch_bb
, bb
->next_bb
, 0);
668 case GIMPLE_TRANSACTION
:
670 tree abort_label
= gimple_transaction_label (last
);
672 make_edge (bb
, label_to_block (abort_label
), 0);
678 gcc_assert (!stmt_ends_bb_p (last
));
687 make_edge (bb
, bb
->next_bb
, EDGE_FALLTHRU
);
689 assign_discriminator (gimple_location (last
), bb
->next_bb
);
696 /* Fold COND_EXPR_COND of each COND_EXPR. */
697 fold_cond_expr_cond ();
700 /* Trivial hash function for a location_t. ITEM is a pointer to
701 a hash table entry that maps a location_t to a discriminator. */
704 locus_map_hash (const void *item
)
706 return ((const struct locus_discrim_map
*) item
)->locus
;
709 /* Equality function for the locus-to-discriminator map. VA and VB
710 point to the two hash table entries to compare. */
713 locus_map_eq (const void *va
, const void *vb
)
715 const struct locus_discrim_map
*a
= (const struct locus_discrim_map
*) va
;
716 const struct locus_discrim_map
*b
= (const struct locus_discrim_map
*) vb
;
717 return a
->locus
== b
->locus
;
720 /* Find the next available discriminator value for LOCUS. The
721 discriminator distinguishes among several basic blocks that
722 share a common locus, allowing for more accurate sample-based
726 next_discriminator_for_locus (location_t locus
)
728 struct locus_discrim_map item
;
729 struct locus_discrim_map
**slot
;
732 item
.discriminator
= 0;
733 slot
= (struct locus_discrim_map
**)
734 htab_find_slot_with_hash (discriminator_per_locus
, (void *) &item
,
735 (hashval_t
) locus
, INSERT
);
737 if (*slot
== HTAB_EMPTY_ENTRY
)
739 *slot
= XNEW (struct locus_discrim_map
);
741 (*slot
)->locus
= locus
;
742 (*slot
)->discriminator
= 0;
744 (*slot
)->discriminator
++;
745 return (*slot
)->discriminator
;
748 /* Return TRUE if LOCUS1 and LOCUS2 refer to the same source line. */
751 same_line_p (location_t locus1
, location_t locus2
)
753 expanded_location from
, to
;
755 if (locus1
== locus2
)
758 from
= expand_location (locus1
);
759 to
= expand_location (locus2
);
761 if (from
.line
!= to
.line
)
763 if (from
.file
== to
.file
)
765 return (from
.file
!= NULL
767 && filename_cmp (from
.file
, to
.file
) == 0);
770 /* Assign a unique discriminator value to block BB if it begins at the same
771 LOCUS as its predecessor block. */
774 assign_discriminator (location_t locus
, basic_block bb
)
776 gimple first_in_to_bb
, last_in_to_bb
;
778 if (locus
== 0 || bb
->discriminator
!= 0)
781 first_in_to_bb
= first_non_label_stmt (bb
);
782 last_in_to_bb
= last_stmt (bb
);
783 if ((first_in_to_bb
&& same_line_p (locus
, gimple_location (first_in_to_bb
)))
784 || (last_in_to_bb
&& same_line_p (locus
, gimple_location (last_in_to_bb
))))
785 bb
->discriminator
= next_discriminator_for_locus (locus
);
788 /* Create the edges for a GIMPLE_COND starting at block BB. */
791 make_cond_expr_edges (basic_block bb
)
793 gimple entry
= last_stmt (bb
);
794 gimple then_stmt
, else_stmt
;
795 basic_block then_bb
, else_bb
;
796 tree then_label
, else_label
;
798 location_t entry_locus
;
801 gcc_assert (gimple_code (entry
) == GIMPLE_COND
);
803 entry_locus
= gimple_location (entry
);
805 /* Entry basic blocks for each component. */
806 then_label
= gimple_cond_true_label (entry
);
807 else_label
= gimple_cond_false_label (entry
);
808 then_bb
= label_to_block (then_label
);
809 else_bb
= label_to_block (else_label
);
810 then_stmt
= first_stmt (then_bb
);
811 else_stmt
= first_stmt (else_bb
);
813 e
= make_edge (bb
, then_bb
, EDGE_TRUE_VALUE
);
814 assign_discriminator (entry_locus
, then_bb
);
815 e
->goto_locus
= gimple_location (then_stmt
);
817 e
->goto_block
= gimple_block (then_stmt
);
818 e
= make_edge (bb
, else_bb
, EDGE_FALSE_VALUE
);
821 assign_discriminator (entry_locus
, else_bb
);
822 e
->goto_locus
= gimple_location (else_stmt
);
824 e
->goto_block
= gimple_block (else_stmt
);
827 /* We do not need the labels anymore. */
828 gimple_cond_set_true_label (entry
, NULL_TREE
);
829 gimple_cond_set_false_label (entry
, NULL_TREE
);
833 /* Called for each element in the hash table (P) as we delete the
834 edge to cases hash table.
836 Clear all the TREE_CHAINs to prevent problems with copying of
837 SWITCH_EXPRs and structure sharing rules, then free the hash table
841 edge_to_cases_cleanup (const void *key ATTRIBUTE_UNUSED
, void **value
,
842 void *data ATTRIBUTE_UNUSED
)
846 for (t
= (tree
) *value
; t
; t
= next
)
848 next
= CASE_CHAIN (t
);
849 CASE_CHAIN (t
) = NULL
;
856 /* Start recording information mapping edges to case labels. */
859 start_recording_case_labels (void)
861 gcc_assert (edge_to_cases
== NULL
);
862 edge_to_cases
= pointer_map_create ();
863 touched_switch_bbs
= BITMAP_ALLOC (NULL
);
866 /* Return nonzero if we are recording information for case labels. */
869 recording_case_labels_p (void)
871 return (edge_to_cases
!= NULL
);
874 /* Stop recording information mapping edges to case labels and
875 remove any information we have recorded. */
877 end_recording_case_labels (void)
881 pointer_map_traverse (edge_to_cases
, edge_to_cases_cleanup
, NULL
);
882 pointer_map_destroy (edge_to_cases
);
883 edge_to_cases
= NULL
;
884 EXECUTE_IF_SET_IN_BITMAP (touched_switch_bbs
, 0, i
, bi
)
886 basic_block bb
= BASIC_BLOCK (i
);
889 gimple stmt
= last_stmt (bb
);
890 if (stmt
&& gimple_code (stmt
) == GIMPLE_SWITCH
)
891 group_case_labels_stmt (stmt
);
894 BITMAP_FREE (touched_switch_bbs
);
897 /* If we are inside a {start,end}_recording_cases block, then return
898 a chain of CASE_LABEL_EXPRs from T which reference E.
900 Otherwise return NULL. */
903 get_cases_for_edge (edge e
, gimple t
)
908 /* If we are not recording cases, then we do not have CASE_LABEL_EXPR
909 chains available. Return NULL so the caller can detect this case. */
910 if (!recording_case_labels_p ())
913 slot
= pointer_map_contains (edge_to_cases
, e
);
917 /* If we did not find E in the hash table, then this must be the first
918 time we have been queried for information about E & T. Add all the
919 elements from T to the hash table then perform the query again. */
921 n
= gimple_switch_num_labels (t
);
922 for (i
= 0; i
< n
; i
++)
924 tree elt
= gimple_switch_label (t
, i
);
925 tree lab
= CASE_LABEL (elt
);
926 basic_block label_bb
= label_to_block (lab
);
927 edge this_edge
= find_edge (e
->src
, label_bb
);
929 /* Add it to the chain of CASE_LABEL_EXPRs referencing E, or create
931 slot
= pointer_map_insert (edge_to_cases
, this_edge
);
932 CASE_CHAIN (elt
) = (tree
) *slot
;
936 return (tree
) *pointer_map_contains (edge_to_cases
, e
);
939 /* Create the edges for a GIMPLE_SWITCH starting at block BB. */
942 make_gimple_switch_edges (basic_block bb
)
944 gimple entry
= last_stmt (bb
);
945 location_t entry_locus
;
948 entry_locus
= gimple_location (entry
);
950 n
= gimple_switch_num_labels (entry
);
952 for (i
= 0; i
< n
; ++i
)
954 tree lab
= CASE_LABEL (gimple_switch_label (entry
, i
));
955 basic_block label_bb
= label_to_block (lab
);
956 make_edge (bb
, label_bb
, 0);
957 assign_discriminator (entry_locus
, label_bb
);
962 /* Return the basic block holding label DEST. */
965 label_to_block_fn (struct function
*ifun
, tree dest
)
967 int uid
= LABEL_DECL_UID (dest
);
969 /* We would die hard when faced by an undefined label. Emit a label to
970 the very first basic block. This will hopefully make even the dataflow
971 and undefined variable warnings quite right. */
972 if (seen_error () && uid
< 0)
974 gimple_stmt_iterator gsi
= gsi_start_bb (BASIC_BLOCK (NUM_FIXED_BLOCKS
));
977 stmt
= gimple_build_label (dest
);
978 gsi_insert_before (&gsi
, stmt
, GSI_NEW_STMT
);
979 uid
= LABEL_DECL_UID (dest
);
981 if (VEC_length (basic_block
, ifun
->cfg
->x_label_to_block_map
)
982 <= (unsigned int) uid
)
984 return VEC_index (basic_block
, ifun
->cfg
->x_label_to_block_map
, uid
);
987 /* Create edges for an abnormal goto statement at block BB. If FOR_CALL
988 is true, the source statement is a CALL_EXPR instead of a GOTO_EXPR. */
991 make_abnormal_goto_edges (basic_block bb
, bool for_call
)
993 basic_block target_bb
;
994 gimple_stmt_iterator gsi
;
996 FOR_EACH_BB (target_bb
)
997 for (gsi
= gsi_start_bb (target_bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
999 gimple label_stmt
= gsi_stmt (gsi
);
1002 if (gimple_code (label_stmt
) != GIMPLE_LABEL
)
1005 target
= gimple_label_label (label_stmt
);
1007 /* Make an edge to every label block that has been marked as a
1008 potential target for a computed goto or a non-local goto. */
1009 if ((FORCED_LABEL (target
) && !for_call
)
1010 || (DECL_NONLOCAL (target
) && for_call
))
1012 make_edge (bb
, target_bb
, EDGE_ABNORMAL
);
1018 /* Create edges for a goto statement at block BB. */
1021 make_goto_expr_edges (basic_block bb
)
1023 gimple_stmt_iterator last
= gsi_last_bb (bb
);
1024 gimple goto_t
= gsi_stmt (last
);
1026 /* A simple GOTO creates normal edges. */
1027 if (simple_goto_p (goto_t
))
1029 tree dest
= gimple_goto_dest (goto_t
);
1030 basic_block label_bb
= label_to_block (dest
);
1031 edge e
= make_edge (bb
, label_bb
, EDGE_FALLTHRU
);
1032 e
->goto_locus
= gimple_location (goto_t
);
1033 assign_discriminator (e
->goto_locus
, label_bb
);
1035 e
->goto_block
= gimple_block (goto_t
);
1036 gsi_remove (&last
, true);
1040 /* A computed GOTO creates abnormal edges. */
1041 make_abnormal_goto_edges (bb
, false);
1044 /* Create edges for an asm statement with labels at block BB. */
1047 make_gimple_asm_edges (basic_block bb
)
1049 gimple stmt
= last_stmt (bb
);
1050 location_t stmt_loc
= gimple_location (stmt
);
1051 int i
, n
= gimple_asm_nlabels (stmt
);
1053 for (i
= 0; i
< n
; ++i
)
1055 tree label
= TREE_VALUE (gimple_asm_label_op (stmt
, i
));
1056 basic_block label_bb
= label_to_block (label
);
1057 make_edge (bb
, label_bb
, 0);
1058 assign_discriminator (stmt_loc
, label_bb
);
1062 /*---------------------------------------------------------------------------
1064 ---------------------------------------------------------------------------*/
1066 /* Cleanup useless labels in basic blocks. This is something we wish
1067 to do early because it allows us to group case labels before creating
1068 the edges for the CFG, and it speeds up block statement iterators in
1069 all passes later on.
1070 We rerun this pass after CFG is created, to get rid of the labels that
1071 are no longer referenced. After then we do not run it any more, since
1072 (almost) no new labels should be created. */
1074 /* A map from basic block index to the leading label of that block. */
1075 static struct label_record
1080 /* True if the label is referenced from somewhere. */
1084 /* Given LABEL return the first label in the same basic block. */
1087 main_block_label (tree label
)
1089 basic_block bb
= label_to_block (label
);
1090 tree main_label
= label_for_bb
[bb
->index
].label
;
1092 /* label_to_block possibly inserted undefined label into the chain. */
1095 label_for_bb
[bb
->index
].label
= label
;
1099 label_for_bb
[bb
->index
].used
= true;
1103 /* Clean up redundant labels within the exception tree. */
1106 cleanup_dead_labels_eh (void)
1113 if (cfun
->eh
== NULL
)
1116 for (i
= 1; VEC_iterate (eh_landing_pad
, cfun
->eh
->lp_array
, i
, lp
); ++i
)
1117 if (lp
&& lp
->post_landing_pad
)
1119 lab
= main_block_label (lp
->post_landing_pad
);
1120 if (lab
!= lp
->post_landing_pad
)
1122 EH_LANDING_PAD_NR (lp
->post_landing_pad
) = 0;
1123 EH_LANDING_PAD_NR (lab
) = lp
->index
;
1127 FOR_ALL_EH_REGION (r
)
1131 case ERT_MUST_NOT_THROW
:
1137 for (c
= r
->u
.eh_try
.first_catch
; c
; c
= c
->next_catch
)
1141 c
->label
= main_block_label (lab
);
1146 case ERT_ALLOWED_EXCEPTIONS
:
1147 lab
= r
->u
.allowed
.label
;
1149 r
->u
.allowed
.label
= main_block_label (lab
);
1155 /* Cleanup redundant labels. This is a three-step process:
1156 1) Find the leading label for each block.
1157 2) Redirect all references to labels to the leading labels.
1158 3) Cleanup all useless labels. */
1161 cleanup_dead_labels (void)
1164 label_for_bb
= XCNEWVEC (struct label_record
, last_basic_block
);
1166 /* Find a suitable label for each block. We use the first user-defined
1167 label if there is one, or otherwise just the first label we see. */
1170 gimple_stmt_iterator i
;
1172 for (i
= gsi_start_bb (bb
); !gsi_end_p (i
); gsi_next (&i
))
1175 gimple stmt
= gsi_stmt (i
);
1177 if (gimple_code (stmt
) != GIMPLE_LABEL
)
1180 label
= gimple_label_label (stmt
);
1182 /* If we have not yet seen a label for the current block,
1183 remember this one and see if there are more labels. */
1184 if (!label_for_bb
[bb
->index
].label
)
1186 label_for_bb
[bb
->index
].label
= label
;
1190 /* If we did see a label for the current block already, but it
1191 is an artificially created label, replace it if the current
1192 label is a user defined label. */
1193 if (!DECL_ARTIFICIAL (label
)
1194 && DECL_ARTIFICIAL (label_for_bb
[bb
->index
].label
))
1196 label_for_bb
[bb
->index
].label
= label
;
1202 /* Now redirect all jumps/branches to the selected label.
1203 First do so for each block ending in a control statement. */
1206 gimple stmt
= last_stmt (bb
);
1207 tree label
, new_label
;
1212 switch (gimple_code (stmt
))
1215 label
= gimple_cond_true_label (stmt
);
1218 new_label
= main_block_label (label
);
1219 if (new_label
!= label
)
1220 gimple_cond_set_true_label (stmt
, new_label
);
1223 label
= gimple_cond_false_label (stmt
);
1226 new_label
= main_block_label (label
);
1227 if (new_label
!= label
)
1228 gimple_cond_set_false_label (stmt
, new_label
);
1234 size_t i
, n
= gimple_switch_num_labels (stmt
);
1236 /* Replace all destination labels. */
1237 for (i
= 0; i
< n
; ++i
)
1239 tree case_label
= gimple_switch_label (stmt
, i
);
1240 label
= CASE_LABEL (case_label
);
1241 new_label
= main_block_label (label
);
1242 if (new_label
!= label
)
1243 CASE_LABEL (case_label
) = new_label
;
1250 int i
, n
= gimple_asm_nlabels (stmt
);
1252 for (i
= 0; i
< n
; ++i
)
1254 tree cons
= gimple_asm_label_op (stmt
, i
);
1255 tree label
= main_block_label (TREE_VALUE (cons
));
1256 TREE_VALUE (cons
) = label
;
1261 /* We have to handle gotos until they're removed, and we don't
1262 remove them until after we've created the CFG edges. */
1264 if (!computed_goto_p (stmt
))
1266 label
= gimple_goto_dest (stmt
);
1267 new_label
= main_block_label (label
);
1268 if (new_label
!= label
)
1269 gimple_goto_set_dest (stmt
, new_label
);
1273 case GIMPLE_TRANSACTION
:
1275 tree label
= gimple_transaction_label (stmt
);
1278 tree new_label
= main_block_label (label
);
1279 if (new_label
!= label
)
1280 gimple_transaction_set_label (stmt
, new_label
);
1290 /* Do the same for the exception region tree labels. */
1291 cleanup_dead_labels_eh ();
1293 /* Finally, purge dead labels. All user-defined labels and labels that
1294 can be the target of non-local gotos and labels which have their
1295 address taken are preserved. */
1298 gimple_stmt_iterator i
;
1299 tree label_for_this_bb
= label_for_bb
[bb
->index
].label
;
1301 if (!label_for_this_bb
)
1304 /* If the main label of the block is unused, we may still remove it. */
1305 if (!label_for_bb
[bb
->index
].used
)
1306 label_for_this_bb
= NULL
;
1308 for (i
= gsi_start_bb (bb
); !gsi_end_p (i
); )
1311 gimple stmt
= gsi_stmt (i
);
1313 if (gimple_code (stmt
) != GIMPLE_LABEL
)
1316 label
= gimple_label_label (stmt
);
1318 if (label
== label_for_this_bb
1319 || !DECL_ARTIFICIAL (label
)
1320 || DECL_NONLOCAL (label
)
1321 || FORCED_LABEL (label
))
1324 gsi_remove (&i
, true);
1328 free (label_for_bb
);
1331 /* Scan the sorted vector of cases in STMT (a GIMPLE_SWITCH) and combine
1332 the ones jumping to the same label.
1333 Eg. three separate entries 1: 2: 3: become one entry 1..3: */
1336 group_case_labels_stmt (gimple stmt
)
1338 int old_size
= gimple_switch_num_labels (stmt
);
1339 int i
, j
, new_size
= old_size
;
1340 tree default_case
= NULL_TREE
;
1341 tree default_label
= NULL_TREE
;
1344 /* The default label is always the first case in a switch
1345 statement after gimplification if it was not optimized
1347 if (!CASE_LOW (gimple_switch_default_label (stmt
))
1348 && !CASE_HIGH (gimple_switch_default_label (stmt
)))
1350 default_case
= gimple_switch_default_label (stmt
);
1351 default_label
= CASE_LABEL (default_case
);
1355 has_default
= false;
1357 /* Look for possible opportunities to merge cases. */
1362 while (i
< old_size
)
1364 tree base_case
, base_label
, base_high
;
1365 base_case
= gimple_switch_label (stmt
, i
);
1367 gcc_assert (base_case
);
1368 base_label
= CASE_LABEL (base_case
);
1370 /* Discard cases that have the same destination as the
1372 if (base_label
== default_label
)
1374 gimple_switch_set_label (stmt
, i
, NULL_TREE
);
1380 base_high
= CASE_HIGH (base_case
)
1381 ? CASE_HIGH (base_case
)
1382 : CASE_LOW (base_case
);
1385 /* Try to merge case labels. Break out when we reach the end
1386 of the label vector or when we cannot merge the next case
1387 label with the current one. */
1388 while (i
< old_size
)
1390 tree merge_case
= gimple_switch_label (stmt
, i
);
1391 tree merge_label
= CASE_LABEL (merge_case
);
1392 double_int bhp1
= double_int_add (tree_to_double_int (base_high
),
1395 /* Merge the cases if they jump to the same place,
1396 and their ranges are consecutive. */
1397 if (merge_label
== base_label
1398 && double_int_equal_p (tree_to_double_int (CASE_LOW (merge_case
)),
1401 base_high
= CASE_HIGH (merge_case
) ?
1402 CASE_HIGH (merge_case
) : CASE_LOW (merge_case
);
1403 CASE_HIGH (base_case
) = base_high
;
1404 gimple_switch_set_label (stmt
, i
, NULL_TREE
);
1413 /* Compress the case labels in the label vector, and adjust the
1414 length of the vector. */
1415 for (i
= 0, j
= 0; i
< new_size
; i
++)
1417 while (! gimple_switch_label (stmt
, j
))
1419 gimple_switch_set_label (stmt
, i
,
1420 gimple_switch_label (stmt
, j
++));
1423 gcc_assert (new_size
<= old_size
);
1424 gimple_switch_set_num_labels (stmt
, new_size
);
1427 /* Look for blocks ending in a multiway branch (a GIMPLE_SWITCH),
1428 and scan the sorted vector of cases. Combine the ones jumping to the
1432 group_case_labels (void)
1438 gimple stmt
= last_stmt (bb
);
1439 if (stmt
&& gimple_code (stmt
) == GIMPLE_SWITCH
)
1440 group_case_labels_stmt (stmt
);
1444 /* Checks whether we can merge block B into block A. */
1447 gimple_can_merge_blocks_p (basic_block a
, basic_block b
)
1450 gimple_stmt_iterator gsi
;
1453 if (!single_succ_p (a
))
1456 if (single_succ_edge (a
)->flags
& (EDGE_ABNORMAL
| EDGE_EH
| EDGE_PRESERVE
))
1459 if (single_succ (a
) != b
)
1462 if (!single_pred_p (b
))
1465 if (b
== EXIT_BLOCK_PTR
)
1468 /* If A ends by a statement causing exceptions or something similar, we
1469 cannot merge the blocks. */
1470 stmt
= last_stmt (a
);
1471 if (stmt
&& stmt_ends_bb_p (stmt
))
1474 /* Do not allow a block with only a non-local label to be merged. */
1476 && gimple_code (stmt
) == GIMPLE_LABEL
1477 && DECL_NONLOCAL (gimple_label_label (stmt
)))
1480 /* Examine the labels at the beginning of B. */
1481 for (gsi
= gsi_start_bb (b
); !gsi_end_p (gsi
); gsi_next (&gsi
))
1484 stmt
= gsi_stmt (gsi
);
1485 if (gimple_code (stmt
) != GIMPLE_LABEL
)
1487 lab
= gimple_label_label (stmt
);
1489 /* Do not remove user forced labels or for -O0 any user labels. */
1490 if (!DECL_ARTIFICIAL (lab
) && (!optimize
|| FORCED_LABEL (lab
)))
1494 /* Protect the loop latches. */
1495 if (current_loops
&& b
->loop_father
->latch
== b
)
1498 /* It must be possible to eliminate all phi nodes in B. If ssa form
1499 is not up-to-date and a name-mapping is registered, we cannot eliminate
1500 any phis. Symbols marked for renaming are never a problem though. */
1501 phis
= phi_nodes (b
);
1502 if (!gimple_seq_empty_p (phis
)
1503 && name_mappings_registered_p ())
1506 /* When not optimizing, don't merge if we'd lose goto_locus. */
1508 && single_succ_edge (a
)->goto_locus
!= UNKNOWN_LOCATION
)
1510 location_t goto_locus
= single_succ_edge (a
)->goto_locus
;
1511 gimple_stmt_iterator prev
, next
;
1512 prev
= gsi_last_nondebug_bb (a
);
1513 next
= gsi_after_labels (b
);
1514 if (!gsi_end_p (next
) && is_gimple_debug (gsi_stmt (next
)))
1515 gsi_next_nondebug (&next
);
1516 if ((gsi_end_p (prev
)
1517 || gimple_location (gsi_stmt (prev
)) != goto_locus
)
1518 && (gsi_end_p (next
)
1519 || gimple_location (gsi_stmt (next
)) != goto_locus
))
1526 /* Return true if the var whose chain of uses starts at PTR has no
1529 has_zero_uses_1 (const ssa_use_operand_t
*head
)
1531 const ssa_use_operand_t
*ptr
;
1533 for (ptr
= head
->next
; ptr
!= head
; ptr
= ptr
->next
)
1534 if (!is_gimple_debug (USE_STMT (ptr
)))
1540 /* Return true if the var whose chain of uses starts at PTR has a
1541 single nondebug use. Set USE_P and STMT to that single nondebug
1542 use, if so, or to NULL otherwise. */
1544 single_imm_use_1 (const ssa_use_operand_t
*head
,
1545 use_operand_p
*use_p
, gimple
*stmt
)
1547 ssa_use_operand_t
*ptr
, *single_use
= 0;
1549 for (ptr
= head
->next
; ptr
!= head
; ptr
= ptr
->next
)
1550 if (!is_gimple_debug (USE_STMT (ptr
)))
1561 *use_p
= single_use
;
1564 *stmt
= single_use
? single_use
->loc
.stmt
: NULL
;
1566 return !!single_use
;
1569 /* Replaces all uses of NAME by VAL. */
1572 replace_uses_by (tree name
, tree val
)
1574 imm_use_iterator imm_iter
;
1579 FOR_EACH_IMM_USE_STMT (stmt
, imm_iter
, name
)
1581 FOR_EACH_IMM_USE_ON_STMT (use
, imm_iter
)
1583 replace_exp (use
, val
);
1585 if (gimple_code (stmt
) == GIMPLE_PHI
)
1587 e
= gimple_phi_arg_edge (stmt
, PHI_ARG_INDEX_FROM_USE (use
));
1588 if (e
->flags
& EDGE_ABNORMAL
)
1590 /* This can only occur for virtual operands, since
1591 for the real ones SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name))
1592 would prevent replacement. */
1593 gcc_checking_assert (!is_gimple_reg (name
));
1594 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (val
) = 1;
1599 if (gimple_code (stmt
) != GIMPLE_PHI
)
1601 gimple_stmt_iterator gsi
= gsi_for_stmt (stmt
);
1602 gimple orig_stmt
= stmt
;
1605 /* Mark the block if we changed the last stmt in it. */
1606 if (cfgcleanup_altered_bbs
1607 && stmt_ends_bb_p (stmt
))
1608 bitmap_set_bit (cfgcleanup_altered_bbs
, gimple_bb (stmt
)->index
);
1610 /* FIXME. It shouldn't be required to keep TREE_CONSTANT
1611 on ADDR_EXPRs up-to-date on GIMPLE. Propagation will
1612 only change sth from non-invariant to invariant, and only
1613 when propagating constants. */
1614 if (is_gimple_min_invariant (val
))
1615 for (i
= 0; i
< gimple_num_ops (stmt
); i
++)
1617 tree op
= gimple_op (stmt
, i
);
1618 /* Operands may be empty here. For example, the labels
1619 of a GIMPLE_COND are nulled out following the creation
1620 of the corresponding CFG edges. */
1621 if (op
&& TREE_CODE (op
) == ADDR_EXPR
)
1622 recompute_tree_invariant_for_addr_expr (op
);
1625 if (fold_stmt (&gsi
))
1626 stmt
= gsi_stmt (gsi
);
1628 if (maybe_clean_or_replace_eh_stmt (orig_stmt
, stmt
))
1629 gimple_purge_dead_eh_edges (gimple_bb (stmt
));
1635 gcc_checking_assert (has_zero_uses (name
));
1637 /* Also update the trees stored in loop structures. */
1643 FOR_EACH_LOOP (li
, loop
, 0)
1645 substitute_in_loop_info (loop
, name
, val
);
1650 /* Merge block B into block A. */
1653 gimple_merge_blocks (basic_block a
, basic_block b
)
1655 gimple_stmt_iterator last
, gsi
, psi
;
1658 fprintf (dump_file
, "Merging blocks %d and %d\n", a
->index
, b
->index
);
1660 /* Remove all single-valued PHI nodes from block B of the form
1661 V_i = PHI <V_j> by propagating V_j to all the uses of V_i. */
1662 gsi
= gsi_last_bb (a
);
1663 for (psi
= gsi_start_phis (b
); !gsi_end_p (psi
); )
1665 gimple phi
= gsi_stmt (psi
);
1666 tree def
= gimple_phi_result (phi
), use
= gimple_phi_arg_def (phi
, 0);
1668 bool may_replace_uses
= !is_gimple_reg (def
)
1669 || may_propagate_copy (def
, use
);
1671 /* In case we maintain loop closed ssa form, do not propagate arguments
1672 of loop exit phi nodes. */
1674 && loops_state_satisfies_p (LOOP_CLOSED_SSA
)
1675 && is_gimple_reg (def
)
1676 && TREE_CODE (use
) == SSA_NAME
1677 && a
->loop_father
!= b
->loop_father
)
1678 may_replace_uses
= false;
1680 if (!may_replace_uses
)
1682 gcc_assert (is_gimple_reg (def
));
1684 /* Note that just emitting the copies is fine -- there is no problem
1685 with ordering of phi nodes. This is because A is the single
1686 predecessor of B, therefore results of the phi nodes cannot
1687 appear as arguments of the phi nodes. */
1688 copy
= gimple_build_assign (def
, use
);
1689 gsi_insert_after (&gsi
, copy
, GSI_NEW_STMT
);
1690 remove_phi_node (&psi
, false);
1694 /* If we deal with a PHI for virtual operands, we can simply
1695 propagate these without fussing with folding or updating
1697 if (!is_gimple_reg (def
))
1699 imm_use_iterator iter
;
1700 use_operand_p use_p
;
1703 FOR_EACH_IMM_USE_STMT (stmt
, iter
, def
)
1704 FOR_EACH_IMM_USE_ON_STMT (use_p
, iter
)
1705 SET_USE (use_p
, use
);
1707 if (SSA_NAME_OCCURS_IN_ABNORMAL_PHI (def
))
1708 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (use
) = 1;
1711 replace_uses_by (def
, use
);
1713 remove_phi_node (&psi
, true);
1717 /* Ensure that B follows A. */
1718 move_block_after (b
, a
);
1720 gcc_assert (single_succ_edge (a
)->flags
& EDGE_FALLTHRU
);
1721 gcc_assert (!last_stmt (a
) || !stmt_ends_bb_p (last_stmt (a
)));
1723 /* Remove labels from B and set gimple_bb to A for other statements. */
1724 for (gsi
= gsi_start_bb (b
); !gsi_end_p (gsi
);)
1726 gimple stmt
= gsi_stmt (gsi
);
1727 if (gimple_code (stmt
) == GIMPLE_LABEL
)
1729 tree label
= gimple_label_label (stmt
);
1732 gsi_remove (&gsi
, false);
1734 /* Now that we can thread computed gotos, we might have
1735 a situation where we have a forced label in block B
1736 However, the label at the start of block B might still be
1737 used in other ways (think about the runtime checking for
1738 Fortran assigned gotos). So we can not just delete the
1739 label. Instead we move the label to the start of block A. */
1740 if (FORCED_LABEL (label
))
1742 gimple_stmt_iterator dest_gsi
= gsi_start_bb (a
);
1743 gsi_insert_before (&dest_gsi
, stmt
, GSI_NEW_STMT
);
1745 /* Other user labels keep around in a form of a debug stmt. */
1746 else if (!DECL_ARTIFICIAL (label
) && MAY_HAVE_DEBUG_STMTS
)
1748 gimple dbg
= gimple_build_debug_bind (label
,
1751 gimple_debug_bind_reset_value (dbg
);
1752 gsi_insert_before (&gsi
, dbg
, GSI_SAME_STMT
);
1755 lp_nr
= EH_LANDING_PAD_NR (label
);
1758 eh_landing_pad lp
= get_eh_landing_pad_from_number (lp_nr
);
1759 lp
->post_landing_pad
= NULL
;
1764 gimple_set_bb (stmt
, a
);
1769 /* Merge the sequences. */
1770 last
= gsi_last_bb (a
);
1771 gsi_insert_seq_after (&last
, bb_seq (b
), GSI_NEW_STMT
);
1772 set_bb_seq (b
, NULL
);
1774 if (cfgcleanup_altered_bbs
)
1775 bitmap_set_bit (cfgcleanup_altered_bbs
, a
->index
);
1779 /* Return the one of two successors of BB that is not reachable by a
1780 complex edge, if there is one. Else, return BB. We use
1781 this in optimizations that use post-dominators for their heuristics,
1782 to catch the cases in C++ where function calls are involved. */
1785 single_noncomplex_succ (basic_block bb
)
1788 if (EDGE_COUNT (bb
->succs
) != 2)
1791 e0
= EDGE_SUCC (bb
, 0);
1792 e1
= EDGE_SUCC (bb
, 1);
1793 if (e0
->flags
& EDGE_COMPLEX
)
1795 if (e1
->flags
& EDGE_COMPLEX
)
1801 /* T is CALL_EXPR. Set current_function_calls_* flags. */
1804 notice_special_calls (gimple call
)
1806 int flags
= gimple_call_flags (call
);
1808 if (flags
& ECF_MAY_BE_ALLOCA
)
1809 cfun
->calls_alloca
= true;
1810 if (flags
& ECF_RETURNS_TWICE
)
1811 cfun
->calls_setjmp
= true;
1815 /* Clear flags set by notice_special_calls. Used by dead code removal
1816 to update the flags. */
1819 clear_special_calls (void)
1821 cfun
->calls_alloca
= false;
1822 cfun
->calls_setjmp
= false;
1825 /* Remove PHI nodes associated with basic block BB and all edges out of BB. */
1828 remove_phi_nodes_and_edges_for_unreachable_block (basic_block bb
)
1830 /* Since this block is no longer reachable, we can just delete all
1831 of its PHI nodes. */
1832 remove_phi_nodes (bb
);
1834 /* Remove edges to BB's successors. */
1835 while (EDGE_COUNT (bb
->succs
) > 0)
1836 remove_edge (EDGE_SUCC (bb
, 0));
1840 /* Remove statements of basic block BB. */
1843 remove_bb (basic_block bb
)
1845 gimple_stmt_iterator i
;
1849 fprintf (dump_file
, "Removing basic block %d\n", bb
->index
);
1850 if (dump_flags
& TDF_DETAILS
)
1852 dump_bb (bb
, dump_file
, 0);
1853 fprintf (dump_file
, "\n");
1859 struct loop
*loop
= bb
->loop_father
;
1861 /* If a loop gets removed, clean up the information associated
1863 if (loop
->latch
== bb
1864 || loop
->header
== bb
)
1865 free_numbers_of_iterations_estimates_loop (loop
);
1868 /* Remove all the instructions in the block. */
1869 if (bb_seq (bb
) != NULL
)
1871 /* Walk backwards so as to get a chance to substitute all
1872 released DEFs into debug stmts. See
1873 eliminate_unnecessary_stmts() in tree-ssa-dce.c for more
1875 for (i
= gsi_last_bb (bb
); !gsi_end_p (i
);)
1877 gimple stmt
= gsi_stmt (i
);
1878 if (gimple_code (stmt
) == GIMPLE_LABEL
1879 && (FORCED_LABEL (gimple_label_label (stmt
))
1880 || DECL_NONLOCAL (gimple_label_label (stmt
))))
1883 gimple_stmt_iterator new_gsi
;
1885 /* A non-reachable non-local label may still be referenced.
1886 But it no longer needs to carry the extra semantics of
1888 if (DECL_NONLOCAL (gimple_label_label (stmt
)))
1890 DECL_NONLOCAL (gimple_label_label (stmt
)) = 0;
1891 FORCED_LABEL (gimple_label_label (stmt
)) = 1;
1894 new_bb
= bb
->prev_bb
;
1895 new_gsi
= gsi_start_bb (new_bb
);
1896 gsi_remove (&i
, false);
1897 gsi_insert_before (&new_gsi
, stmt
, GSI_NEW_STMT
);
1901 /* Release SSA definitions if we are in SSA. Note that we
1902 may be called when not in SSA. For example,
1903 final_cleanup calls this function via
1904 cleanup_tree_cfg. */
1905 if (gimple_in_ssa_p (cfun
))
1906 release_defs (stmt
);
1908 gsi_remove (&i
, true);
1912 i
= gsi_last_bb (bb
);
1918 remove_phi_nodes_and_edges_for_unreachable_block (bb
);
1919 bb
->il
.gimple
.seq
= NULL
;
1920 bb
->il
.gimple
.phi_nodes
= NULL
;
1924 /* Given a basic block BB ending with COND_EXPR or SWITCH_EXPR, and a
1925 predicate VAL, return the edge that will be taken out of the block.
1926 If VAL does not match a unique edge, NULL is returned. */
1929 find_taken_edge (basic_block bb
, tree val
)
1933 stmt
= last_stmt (bb
);
1936 gcc_assert (is_ctrl_stmt (stmt
));
1941 if (!is_gimple_min_invariant (val
))
1944 if (gimple_code (stmt
) == GIMPLE_COND
)
1945 return find_taken_edge_cond_expr (bb
, val
);
1947 if (gimple_code (stmt
) == GIMPLE_SWITCH
)
1948 return find_taken_edge_switch_expr (bb
, val
);
1950 if (computed_goto_p (stmt
))
1952 /* Only optimize if the argument is a label, if the argument is
1953 not a label then we can not construct a proper CFG.
1955 It may be the case that we only need to allow the LABEL_REF to
1956 appear inside an ADDR_EXPR, but we also allow the LABEL_REF to
1957 appear inside a LABEL_EXPR just to be safe. */
1958 if ((TREE_CODE (val
) == ADDR_EXPR
|| TREE_CODE (val
) == LABEL_EXPR
)
1959 && TREE_CODE (TREE_OPERAND (val
, 0)) == LABEL_DECL
)
1960 return find_taken_edge_computed_goto (bb
, TREE_OPERAND (val
, 0));
1967 /* Given a constant value VAL and the entry block BB to a GOTO_EXPR
1968 statement, determine which of the outgoing edges will be taken out of the
1969 block. Return NULL if either edge may be taken. */
1972 find_taken_edge_computed_goto (basic_block bb
, tree val
)
1977 dest
= label_to_block (val
);
1980 e
= find_edge (bb
, dest
);
1981 gcc_assert (e
!= NULL
);
1987 /* Given a constant value VAL and the entry block BB to a COND_EXPR
1988 statement, determine which of the two edges will be taken out of the
1989 block. Return NULL if either edge may be taken. */
1992 find_taken_edge_cond_expr (basic_block bb
, tree val
)
1994 edge true_edge
, false_edge
;
1996 extract_true_false_edges_from_block (bb
, &true_edge
, &false_edge
);
1998 gcc_assert (TREE_CODE (val
) == INTEGER_CST
);
1999 return (integer_zerop (val
) ? false_edge
: true_edge
);
2002 /* Given an INTEGER_CST VAL and the entry block BB to a SWITCH_EXPR
2003 statement, determine which edge will be taken out of the block. Return
2004 NULL if any edge may be taken. */
2007 find_taken_edge_switch_expr (basic_block bb
, tree val
)
2009 basic_block dest_bb
;
2014 switch_stmt
= last_stmt (bb
);
2015 taken_case
= find_case_label_for_value (switch_stmt
, val
);
2016 dest_bb
= label_to_block (CASE_LABEL (taken_case
));
2018 e
= find_edge (bb
, dest_bb
);
2024 /* Return the CASE_LABEL_EXPR that SWITCH_STMT will take for VAL.
2025 We can make optimal use here of the fact that the case labels are
2026 sorted: We can do a binary search for a case matching VAL. */
2029 find_case_label_for_value (gimple switch_stmt
, tree val
)
2031 size_t low
, high
, n
= gimple_switch_num_labels (switch_stmt
);
2032 tree default_case
= gimple_switch_default_label (switch_stmt
);
2034 for (low
= 0, high
= n
; high
- low
> 1; )
2036 size_t i
= (high
+ low
) / 2;
2037 tree t
= gimple_switch_label (switch_stmt
, i
);
2040 /* Cache the result of comparing CASE_LOW and val. */
2041 cmp
= tree_int_cst_compare (CASE_LOW (t
), val
);
2048 if (CASE_HIGH (t
) == NULL
)
2050 /* A singe-valued case label. */
2056 /* A case range. We can only handle integer ranges. */
2057 if (cmp
<= 0 && tree_int_cst_compare (CASE_HIGH (t
), val
) >= 0)
2062 return default_case
;
2066 /* Dump a basic block on stderr. */
2069 gimple_debug_bb (basic_block bb
)
2071 gimple_dump_bb (bb
, stderr
, 0, TDF_VOPS
|TDF_MEMSYMS
);
2075 /* Dump basic block with index N on stderr. */
2078 gimple_debug_bb_n (int n
)
2080 gimple_debug_bb (BASIC_BLOCK (n
));
2081 return BASIC_BLOCK (n
);
2085 /* Dump the CFG on stderr.
2087 FLAGS are the same used by the tree dumping functions
2088 (see TDF_* in tree-pass.h). */
2091 gimple_debug_cfg (int flags
)
2093 gimple_dump_cfg (stderr
, flags
);
2097 /* Dump the program showing basic block boundaries on the given FILE.
2099 FLAGS are the same used by the tree dumping functions (see TDF_* in
2103 gimple_dump_cfg (FILE *file
, int flags
)
2105 if (flags
& TDF_DETAILS
)
2107 dump_function_header (file
, current_function_decl
, flags
);
2108 fprintf (file
, ";; \n%d basic blocks, %d edges, last basic block %d.\n\n",
2109 n_basic_blocks
, n_edges
, last_basic_block
);
2111 brief_dump_cfg (file
);
2112 fprintf (file
, "\n");
2115 if (flags
& TDF_STATS
)
2116 dump_cfg_stats (file
);
2118 dump_function_to_file (current_function_decl
, file
, flags
| TDF_BLOCKS
);
2122 /* Dump CFG statistics on FILE. */
2125 dump_cfg_stats (FILE *file
)
2127 static long max_num_merged_labels
= 0;
2128 unsigned long size
, total
= 0;
2131 const char * const fmt_str
= "%-30s%-13s%12s\n";
2132 const char * const fmt_str_1
= "%-30s%13d%11lu%c\n";
2133 const char * const fmt_str_2
= "%-30s%13ld%11lu%c\n";
2134 const char * const fmt_str_3
= "%-43s%11lu%c\n";
2135 const char *funcname
2136 = lang_hooks
.decl_printable_name (current_function_decl
, 2);
2139 fprintf (file
, "\nCFG Statistics for %s\n\n", funcname
);
2141 fprintf (file
, "---------------------------------------------------------\n");
2142 fprintf (file
, fmt_str
, "", " Number of ", "Memory");
2143 fprintf (file
, fmt_str
, "", " instances ", "used ");
2144 fprintf (file
, "---------------------------------------------------------\n");
2146 size
= n_basic_blocks
* sizeof (struct basic_block_def
);
2148 fprintf (file
, fmt_str_1
, "Basic blocks", n_basic_blocks
,
2149 SCALE (size
), LABEL (size
));
2153 num_edges
+= EDGE_COUNT (bb
->succs
);
2154 size
= num_edges
* sizeof (struct edge_def
);
2156 fprintf (file
, fmt_str_2
, "Edges", num_edges
, SCALE (size
), LABEL (size
));
2158 fprintf (file
, "---------------------------------------------------------\n");
2159 fprintf (file
, fmt_str_3
, "Total memory used by CFG data", SCALE (total
),
2161 fprintf (file
, "---------------------------------------------------------\n");
2162 fprintf (file
, "\n");
2164 if (cfg_stats
.num_merged_labels
> max_num_merged_labels
)
2165 max_num_merged_labels
= cfg_stats
.num_merged_labels
;
2167 fprintf (file
, "Coalesced label blocks: %ld (Max so far: %ld)\n",
2168 cfg_stats
.num_merged_labels
, max_num_merged_labels
);
2170 fprintf (file
, "\n");
2174 /* Dump CFG statistics on stderr. Keep extern so that it's always
2175 linked in the final executable. */
2178 debug_cfg_stats (void)
2180 dump_cfg_stats (stderr
);
2184 /* Dump the flowgraph to a .vcg FILE. */
2187 gimple_cfg2vcg (FILE *file
)
2192 const char *funcname
2193 = lang_hooks
.decl_printable_name (current_function_decl
, 2);
2195 /* Write the file header. */
2196 fprintf (file
, "graph: { title: \"%s\"\n", funcname
);
2197 fprintf (file
, "node: { title: \"ENTRY\" label: \"ENTRY\" }\n");
2198 fprintf (file
, "node: { title: \"EXIT\" label: \"EXIT\" }\n");
2200 /* Write blocks and edges. */
2201 FOR_EACH_EDGE (e
, ei
, ENTRY_BLOCK_PTR
->succs
)
2203 fprintf (file
, "edge: { sourcename: \"ENTRY\" targetname: \"%d\"",
2206 if (e
->flags
& EDGE_FAKE
)
2207 fprintf (file
, " linestyle: dotted priority: 10");
2209 fprintf (file
, " linestyle: solid priority: 100");
2211 fprintf (file
, " }\n");
2217 enum gimple_code head_code
, end_code
;
2218 const char *head_name
, *end_name
;
2221 gimple first
= first_stmt (bb
);
2222 gimple last
= last_stmt (bb
);
2226 head_code
= gimple_code (first
);
2227 head_name
= gimple_code_name
[head_code
];
2228 head_line
= get_lineno (first
);
2231 head_name
= "no-statement";
2235 end_code
= gimple_code (last
);
2236 end_name
= gimple_code_name
[end_code
];
2237 end_line
= get_lineno (last
);
2240 end_name
= "no-statement";
2242 fprintf (file
, "node: { title: \"%d\" label: \"#%d\\n%s (%d)\\n%s (%d)\"}\n",
2243 bb
->index
, bb
->index
, head_name
, head_line
, end_name
,
2246 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
2248 if (e
->dest
== EXIT_BLOCK_PTR
)
2249 fprintf (file
, "edge: { sourcename: \"%d\" targetname: \"EXIT\"", bb
->index
);
2251 fprintf (file
, "edge: { sourcename: \"%d\" targetname: \"%d\"", bb
->index
, e
->dest
->index
);
2253 if (e
->flags
& EDGE_FAKE
)
2254 fprintf (file
, " priority: 10 linestyle: dotted");
2256 fprintf (file
, " priority: 100 linestyle: solid");
2258 fprintf (file
, " }\n");
2261 if (bb
->next_bb
!= EXIT_BLOCK_PTR
)
2265 fputs ("}\n\n", file
);
2270 /*---------------------------------------------------------------------------
2271 Miscellaneous helpers
2272 ---------------------------------------------------------------------------*/
2274 /* Return true if T, a GIMPLE_CALL, can make an abnormal transfer of control
2275 flow. Transfers of control flow associated with EH are excluded. */
2278 call_can_make_abnormal_goto (gimple t
)
2280 /* If the function has no non-local labels, then a call cannot make an
2281 abnormal transfer of control. */
2282 if (!cfun
->has_nonlocal_label
)
2285 /* Likewise if the call has no side effects. */
2286 if (!gimple_has_side_effects (t
))
2289 /* Likewise if the called function is leaf. */
2290 if (gimple_call_flags (t
) & ECF_LEAF
)
2297 /* Return true if T can make an abnormal transfer of control flow.
2298 Transfers of control flow associated with EH are excluded. */
2301 stmt_can_make_abnormal_goto (gimple t
)
2303 if (computed_goto_p (t
))
2305 if (is_gimple_call (t
))
2306 return call_can_make_abnormal_goto (t
);
2311 /* Return true if T represents a stmt that always transfers control. */
2314 is_ctrl_stmt (gimple t
)
2316 switch (gimple_code (t
))
2330 /* Return true if T is a statement that may alter the flow of control
2331 (e.g., a call to a non-returning function). */
2334 is_ctrl_altering_stmt (gimple t
)
2338 switch (gimple_code (t
))
2342 int flags
= gimple_call_flags (t
);
2344 /* A call alters control flow if it can make an abnormal goto. */
2345 if (call_can_make_abnormal_goto (t
))
2348 /* A call also alters control flow if it does not return. */
2349 if (flags
& ECF_NORETURN
)
2352 /* TM ending statements have backedges out of the transaction.
2353 Return true so we split the basic block containing them.
2354 Note that the TM_BUILTIN test is merely an optimization. */
2355 if ((flags
& ECF_TM_BUILTIN
)
2356 && is_tm_ending_fndecl (gimple_call_fndecl (t
)))
2359 /* BUILT_IN_RETURN call is same as return statement. */
2360 if (gimple_call_builtin_p (t
, BUILT_IN_RETURN
))
2365 case GIMPLE_EH_DISPATCH
:
2366 /* EH_DISPATCH branches to the individual catch handlers at
2367 this level of a try or allowed-exceptions region. It can
2368 fallthru to the next statement as well. */
2372 if (gimple_asm_nlabels (t
) > 0)
2377 /* OpenMP directives alter control flow. */
2380 case GIMPLE_TRANSACTION
:
2381 /* A transaction start alters control flow. */
2388 /* If a statement can throw, it alters control flow. */
2389 return stmt_can_throw_internal (t
);
2393 /* Return true if T is a simple local goto. */
2396 simple_goto_p (gimple t
)
2398 return (gimple_code (t
) == GIMPLE_GOTO
2399 && TREE_CODE (gimple_goto_dest (t
)) == LABEL_DECL
);
2403 /* Return true if STMT should start a new basic block. PREV_STMT is
2404 the statement preceding STMT. It is used when STMT is a label or a
2405 case label. Labels should only start a new basic block if their
2406 previous statement wasn't a label. Otherwise, sequence of labels
2407 would generate unnecessary basic blocks that only contain a single
2411 stmt_starts_bb_p (gimple stmt
, gimple prev_stmt
)
2416 /* Labels start a new basic block only if the preceding statement
2417 wasn't a label of the same type. This prevents the creation of
2418 consecutive blocks that have nothing but a single label. */
2419 if (gimple_code (stmt
) == GIMPLE_LABEL
)
2421 /* Nonlocal and computed GOTO targets always start a new block. */
2422 if (DECL_NONLOCAL (gimple_label_label (stmt
))
2423 || FORCED_LABEL (gimple_label_label (stmt
)))
2426 if (prev_stmt
&& gimple_code (prev_stmt
) == GIMPLE_LABEL
)
2428 if (DECL_NONLOCAL (gimple_label_label (prev_stmt
)))
2431 cfg_stats
.num_merged_labels
++;
2442 /* Return true if T should end a basic block. */
2445 stmt_ends_bb_p (gimple t
)
2447 return is_ctrl_stmt (t
) || is_ctrl_altering_stmt (t
);
2450 /* Remove block annotations and other data structures. */
2453 delete_tree_cfg_annotations (void)
2455 label_to_block_map
= NULL
;
2459 /* Return the first statement in basic block BB. */
2462 first_stmt (basic_block bb
)
2464 gimple_stmt_iterator i
= gsi_start_bb (bb
);
2467 while (!gsi_end_p (i
) && is_gimple_debug ((stmt
= gsi_stmt (i
))))
2475 /* Return the first non-label statement in basic block BB. */
2478 first_non_label_stmt (basic_block bb
)
2480 gimple_stmt_iterator i
= gsi_start_bb (bb
);
2481 while (!gsi_end_p (i
) && gimple_code (gsi_stmt (i
)) == GIMPLE_LABEL
)
2483 return !gsi_end_p (i
) ? gsi_stmt (i
) : NULL
;
2486 /* Return the last statement in basic block BB. */
2489 last_stmt (basic_block bb
)
2491 gimple_stmt_iterator i
= gsi_last_bb (bb
);
2494 while (!gsi_end_p (i
) && is_gimple_debug ((stmt
= gsi_stmt (i
))))
2502 /* Return the last statement of an otherwise empty block. Return NULL
2503 if the block is totally empty, or if it contains more than one
2507 last_and_only_stmt (basic_block bb
)
2509 gimple_stmt_iterator i
= gsi_last_nondebug_bb (bb
);
2515 last
= gsi_stmt (i
);
2516 gsi_prev_nondebug (&i
);
2520 /* Empty statements should no longer appear in the instruction stream.
2521 Everything that might have appeared before should be deleted by
2522 remove_useless_stmts, and the optimizers should just gsi_remove
2523 instead of smashing with build_empty_stmt.
2525 Thus the only thing that should appear here in a block containing
2526 one executable statement is a label. */
2527 prev
= gsi_stmt (i
);
2528 if (gimple_code (prev
) == GIMPLE_LABEL
)
2534 /* Reinstall those PHI arguments queued in OLD_EDGE to NEW_EDGE. */
2537 reinstall_phi_args (edge new_edge
, edge old_edge
)
2539 edge_var_map_vector v
;
2542 gimple_stmt_iterator phis
;
2544 v
= redirect_edge_var_map_vector (old_edge
);
2548 for (i
= 0, phis
= gsi_start_phis (new_edge
->dest
);
2549 VEC_iterate (edge_var_map
, v
, i
, vm
) && !gsi_end_p (phis
);
2550 i
++, gsi_next (&phis
))
2552 gimple phi
= gsi_stmt (phis
);
2553 tree result
= redirect_edge_var_map_result (vm
);
2554 tree arg
= redirect_edge_var_map_def (vm
);
2556 gcc_assert (result
== gimple_phi_result (phi
));
2558 add_phi_arg (phi
, arg
, new_edge
, redirect_edge_var_map_location (vm
));
2561 redirect_edge_var_map_clear (old_edge
);
2564 /* Returns the basic block after which the new basic block created
2565 by splitting edge EDGE_IN should be placed. Tries to keep the new block
2566 near its "logical" location. This is of most help to humans looking
2567 at debugging dumps. */
2570 split_edge_bb_loc (edge edge_in
)
2572 basic_block dest
= edge_in
->dest
;
2573 basic_block dest_prev
= dest
->prev_bb
;
2577 edge e
= find_edge (dest_prev
, dest
);
2578 if (e
&& !(e
->flags
& EDGE_COMPLEX
))
2579 return edge_in
->src
;
2584 /* Split a (typically critical) edge EDGE_IN. Return the new block.
2585 Abort on abnormal edges. */
2588 gimple_split_edge (edge edge_in
)
2590 basic_block new_bb
, after_bb
, dest
;
2593 /* Abnormal edges cannot be split. */
2594 gcc_assert (!(edge_in
->flags
& EDGE_ABNORMAL
));
2596 dest
= edge_in
->dest
;
2598 after_bb
= split_edge_bb_loc (edge_in
);
2600 new_bb
= create_empty_bb (after_bb
);
2601 new_bb
->frequency
= EDGE_FREQUENCY (edge_in
);
2602 new_bb
->count
= edge_in
->count
;
2603 new_edge
= make_edge (new_bb
, dest
, EDGE_FALLTHRU
);
2604 new_edge
->probability
= REG_BR_PROB_BASE
;
2605 new_edge
->count
= edge_in
->count
;
2607 e
= redirect_edge_and_branch (edge_in
, new_bb
);
2608 gcc_assert (e
== edge_in
);
2609 reinstall_phi_args (new_edge
, e
);
2615 /* Verify properties of the address expression T with base object BASE. */
2618 verify_address (tree t
, tree base
)
2621 bool old_side_effects
;
2623 bool new_side_effects
;
2625 old_constant
= TREE_CONSTANT (t
);
2626 old_side_effects
= TREE_SIDE_EFFECTS (t
);
2628 recompute_tree_invariant_for_addr_expr (t
);
2629 new_side_effects
= TREE_SIDE_EFFECTS (t
);
2630 new_constant
= TREE_CONSTANT (t
);
2632 if (old_constant
!= new_constant
)
2634 error ("constant not recomputed when ADDR_EXPR changed");
2637 if (old_side_effects
!= new_side_effects
)
2639 error ("side effects not recomputed when ADDR_EXPR changed");
2643 if (!(TREE_CODE (base
) == VAR_DECL
2644 || TREE_CODE (base
) == PARM_DECL
2645 || TREE_CODE (base
) == RESULT_DECL
))
2648 if (DECL_GIMPLE_REG_P (base
))
2650 error ("DECL_GIMPLE_REG_P set on a variable with address taken");
2657 /* Callback for walk_tree, check that all elements with address taken are
2658 properly noticed as such. The DATA is an int* that is 1 if TP was seen
2659 inside a PHI node. */
2662 verify_expr (tree
*tp
, int *walk_subtrees
, void *data ATTRIBUTE_UNUSED
)
2669 /* Check operand N for being valid GIMPLE and give error MSG if not. */
2670 #define CHECK_OP(N, MSG) \
2671 do { if (!is_gimple_val (TREE_OPERAND (t, N))) \
2672 { error (MSG); return TREE_OPERAND (t, N); }} while (0)
2674 switch (TREE_CODE (t
))
2677 if (SSA_NAME_IN_FREE_LIST (t
))
2679 error ("SSA name in freelist but still referenced");
2685 error ("INDIRECT_REF in gimple IL");
2689 x
= TREE_OPERAND (t
, 0);
2690 if (!POINTER_TYPE_P (TREE_TYPE (x
))
2691 || !is_gimple_mem_ref_addr (x
))
2693 error ("invalid first operand of MEM_REF");
2696 if (TREE_CODE (TREE_OPERAND (t
, 1)) != INTEGER_CST
2697 || !POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (t
, 1))))
2699 error ("invalid offset operand of MEM_REF");
2700 return TREE_OPERAND (t
, 1);
2702 if (TREE_CODE (x
) == ADDR_EXPR
2703 && (x
= verify_address (x
, TREE_OPERAND (x
, 0))))
2709 x
= fold (ASSERT_EXPR_COND (t
));
2710 if (x
== boolean_false_node
)
2712 error ("ASSERT_EXPR with an always-false condition");
2718 error ("MODIFY_EXPR not expected while having tuples");
2725 gcc_assert (is_gimple_address (t
));
2727 /* Skip any references (they will be checked when we recurse down the
2728 tree) and ensure that any variable used as a prefix is marked
2730 for (x
= TREE_OPERAND (t
, 0);
2731 handled_component_p (x
);
2732 x
= TREE_OPERAND (x
, 0))
2735 if ((tem
= verify_address (t
, x
)))
2738 if (!(TREE_CODE (x
) == VAR_DECL
2739 || TREE_CODE (x
) == PARM_DECL
2740 || TREE_CODE (x
) == RESULT_DECL
))
2743 if (!TREE_ADDRESSABLE (x
))
2745 error ("address taken, but ADDRESSABLE bit not set");
2753 x
= COND_EXPR_COND (t
);
2754 if (!INTEGRAL_TYPE_P (TREE_TYPE (x
)))
2756 error ("non-integral used in condition");
2759 if (!is_gimple_condexpr (x
))
2761 error ("invalid conditional operand");
2766 case NON_LVALUE_EXPR
:
2767 case TRUTH_NOT_EXPR
:
2771 case FIX_TRUNC_EXPR
:
2776 CHECK_OP (0, "invalid operand to unary operator");
2783 case ARRAY_RANGE_REF
:
2785 case VIEW_CONVERT_EXPR
:
2786 /* We have a nest of references. Verify that each of the operands
2787 that determine where to reference is either a constant or a variable,
2788 verify that the base is valid, and then show we've already checked
2790 while (handled_component_p (t
))
2792 if (TREE_CODE (t
) == COMPONENT_REF
&& TREE_OPERAND (t
, 2))
2793 CHECK_OP (2, "invalid COMPONENT_REF offset operator");
2794 else if (TREE_CODE (t
) == ARRAY_REF
2795 || TREE_CODE (t
) == ARRAY_RANGE_REF
)
2797 CHECK_OP (1, "invalid array index");
2798 if (TREE_OPERAND (t
, 2))
2799 CHECK_OP (2, "invalid array lower bound");
2800 if (TREE_OPERAND (t
, 3))
2801 CHECK_OP (3, "invalid array stride");
2803 else if (TREE_CODE (t
) == BIT_FIELD_REF
)
2805 if (!host_integerp (TREE_OPERAND (t
, 1), 1)
2806 || !host_integerp (TREE_OPERAND (t
, 2), 1))
2808 error ("invalid position or size operand to BIT_FIELD_REF");
2811 if (INTEGRAL_TYPE_P (TREE_TYPE (t
))
2812 && (TYPE_PRECISION (TREE_TYPE (t
))
2813 != TREE_INT_CST_LOW (TREE_OPERAND (t
, 1))))
2815 error ("integral result type precision does not match "
2816 "field size of BIT_FIELD_REF");
2819 else if (!INTEGRAL_TYPE_P (TREE_TYPE (t
))
2820 && !AGGREGATE_TYPE_P (TREE_TYPE (t
))
2821 && TYPE_MODE (TREE_TYPE (t
)) != BLKmode
2822 && (GET_MODE_PRECISION (TYPE_MODE (TREE_TYPE (t
)))
2823 != TREE_INT_CST_LOW (TREE_OPERAND (t
, 1))))
2825 error ("mode precision of non-integral result does not "
2826 "match field size of BIT_FIELD_REF");
2831 t
= TREE_OPERAND (t
, 0);
2834 if (!is_gimple_min_invariant (t
) && !is_gimple_lvalue (t
))
2836 error ("invalid reference prefix");
2843 /* PLUS_EXPR and MINUS_EXPR don't work on pointers, they should be done using
2844 POINTER_PLUS_EXPR. */
2845 if (POINTER_TYPE_P (TREE_TYPE (t
)))
2847 error ("invalid operand to plus/minus, type is a pointer");
2850 CHECK_OP (0, "invalid operand to binary operator");
2851 CHECK_OP (1, "invalid operand to binary operator");
2854 case POINTER_PLUS_EXPR
:
2855 /* Check to make sure the first operand is a pointer or reference type. */
2856 if (!POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (t
, 0))))
2858 error ("invalid operand to pointer plus, first operand is not a pointer");
2861 /* Check to make sure the second operand is a ptrofftype. */
2862 if (!ptrofftype_p (TREE_TYPE (TREE_OPERAND (t
, 1))))
2864 error ("invalid operand to pointer plus, second operand is not an "
2865 "integer type of appropriate width");
2875 case UNORDERED_EXPR
:
2884 case TRUNC_DIV_EXPR
:
2886 case FLOOR_DIV_EXPR
:
2887 case ROUND_DIV_EXPR
:
2888 case TRUNC_MOD_EXPR
:
2890 case FLOOR_MOD_EXPR
:
2891 case ROUND_MOD_EXPR
:
2893 case EXACT_DIV_EXPR
:
2903 CHECK_OP (0, "invalid operand to binary operator");
2904 CHECK_OP (1, "invalid operand to binary operator");
2908 if (TREE_CONSTANT (t
) && TREE_CODE (TREE_TYPE (t
)) == VECTOR_TYPE
)
2912 case CASE_LABEL_EXPR
:
2915 error ("invalid CASE_CHAIN");
2929 /* Verify if EXPR is either a GIMPLE ID or a GIMPLE indirect reference.
2930 Returns true if there is an error, otherwise false. */
2933 verify_types_in_gimple_min_lval (tree expr
)
2937 if (is_gimple_id (expr
))
2940 if (TREE_CODE (expr
) != TARGET_MEM_REF
2941 && TREE_CODE (expr
) != MEM_REF
)
2943 error ("invalid expression for min lvalue");
2947 /* TARGET_MEM_REFs are strange beasts. */
2948 if (TREE_CODE (expr
) == TARGET_MEM_REF
)
2951 op
= TREE_OPERAND (expr
, 0);
2952 if (!is_gimple_val (op
))
2954 error ("invalid operand in indirect reference");
2955 debug_generic_stmt (op
);
2958 /* Memory references now generally can involve a value conversion. */
2963 /* Verify if EXPR is a valid GIMPLE reference expression. If
2964 REQUIRE_LVALUE is true verifies it is an lvalue. Returns true
2965 if there is an error, otherwise false. */
2968 verify_types_in_gimple_reference (tree expr
, bool require_lvalue
)
2970 while (handled_component_p (expr
))
2972 tree op
= TREE_OPERAND (expr
, 0);
2974 if (TREE_CODE (expr
) == ARRAY_REF
2975 || TREE_CODE (expr
) == ARRAY_RANGE_REF
)
2977 if (!is_gimple_val (TREE_OPERAND (expr
, 1))
2978 || (TREE_OPERAND (expr
, 2)
2979 && !is_gimple_val (TREE_OPERAND (expr
, 2)))
2980 || (TREE_OPERAND (expr
, 3)
2981 && !is_gimple_val (TREE_OPERAND (expr
, 3))))
2983 error ("invalid operands to array reference");
2984 debug_generic_stmt (expr
);
2989 /* Verify if the reference array element types are compatible. */
2990 if (TREE_CODE (expr
) == ARRAY_REF
2991 && !useless_type_conversion_p (TREE_TYPE (expr
),
2992 TREE_TYPE (TREE_TYPE (op
))))
2994 error ("type mismatch in array reference");
2995 debug_generic_stmt (TREE_TYPE (expr
));
2996 debug_generic_stmt (TREE_TYPE (TREE_TYPE (op
)));
2999 if (TREE_CODE (expr
) == ARRAY_RANGE_REF
3000 && !useless_type_conversion_p (TREE_TYPE (TREE_TYPE (expr
)),
3001 TREE_TYPE (TREE_TYPE (op
))))
3003 error ("type mismatch in array range reference");
3004 debug_generic_stmt (TREE_TYPE (TREE_TYPE (expr
)));
3005 debug_generic_stmt (TREE_TYPE (TREE_TYPE (op
)));
3009 if ((TREE_CODE (expr
) == REALPART_EXPR
3010 || TREE_CODE (expr
) == IMAGPART_EXPR
)
3011 && !useless_type_conversion_p (TREE_TYPE (expr
),
3012 TREE_TYPE (TREE_TYPE (op
))))
3014 error ("type mismatch in real/imagpart reference");
3015 debug_generic_stmt (TREE_TYPE (expr
));
3016 debug_generic_stmt (TREE_TYPE (TREE_TYPE (op
)));
3020 if (TREE_CODE (expr
) == COMPONENT_REF
3021 && !useless_type_conversion_p (TREE_TYPE (expr
),
3022 TREE_TYPE (TREE_OPERAND (expr
, 1))))
3024 error ("type mismatch in component reference");
3025 debug_generic_stmt (TREE_TYPE (expr
));
3026 debug_generic_stmt (TREE_TYPE (TREE_OPERAND (expr
, 1)));
3030 if (TREE_CODE (expr
) == VIEW_CONVERT_EXPR
)
3032 /* For VIEW_CONVERT_EXPRs which are allowed here too, we only check
3033 that their operand is not an SSA name or an invariant when
3034 requiring an lvalue (this usually means there is a SRA or IPA-SRA
3035 bug). Otherwise there is nothing to verify, gross mismatches at
3036 most invoke undefined behavior. */
3038 && (TREE_CODE (op
) == SSA_NAME
3039 || is_gimple_min_invariant (op
)))
3041 error ("conversion of an SSA_NAME on the left hand side");
3042 debug_generic_stmt (expr
);
3045 else if (TREE_CODE (op
) == SSA_NAME
3046 && TYPE_SIZE (TREE_TYPE (expr
)) != TYPE_SIZE (TREE_TYPE (op
)))
3048 error ("conversion of register to a different size");
3049 debug_generic_stmt (expr
);
3052 else if (!handled_component_p (op
))
3059 if (TREE_CODE (expr
) == MEM_REF
)
3061 if (!is_gimple_mem_ref_addr (TREE_OPERAND (expr
, 0)))
3063 error ("invalid address operand in MEM_REF");
3064 debug_generic_stmt (expr
);
3067 if (TREE_CODE (TREE_OPERAND (expr
, 1)) != INTEGER_CST
3068 || !POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (expr
, 1))))
3070 error ("invalid offset operand in MEM_REF");
3071 debug_generic_stmt (expr
);
3075 else if (TREE_CODE (expr
) == TARGET_MEM_REF
)
3077 if (!TMR_BASE (expr
)
3078 || !is_gimple_mem_ref_addr (TMR_BASE (expr
)))
3080 error ("invalid address operand in TARGET_MEM_REF");
3083 if (!TMR_OFFSET (expr
)
3084 || TREE_CODE (TMR_OFFSET (expr
)) != INTEGER_CST
3085 || !POINTER_TYPE_P (TREE_TYPE (TMR_OFFSET (expr
))))
3087 error ("invalid offset operand in TARGET_MEM_REF");
3088 debug_generic_stmt (expr
);
3093 return ((require_lvalue
|| !is_gimple_min_invariant (expr
))
3094 && verify_types_in_gimple_min_lval (expr
));
3097 /* Returns true if there is one pointer type in TYPE_POINTER_TO (SRC_OBJ)
3098 list of pointer-to types that is trivially convertible to DEST. */
3101 one_pointer_to_useless_type_conversion_p (tree dest
, tree src_obj
)
3105 if (!TYPE_POINTER_TO (src_obj
))
3108 for (src
= TYPE_POINTER_TO (src_obj
); src
; src
= TYPE_NEXT_PTR_TO (src
))
3109 if (useless_type_conversion_p (dest
, src
))
3115 /* Return true if TYPE1 is a fixed-point type and if conversions to and
3116 from TYPE2 can be handled by FIXED_CONVERT_EXPR. */
3119 valid_fixed_convert_types_p (tree type1
, tree type2
)
3121 return (FIXED_POINT_TYPE_P (type1
)
3122 && (INTEGRAL_TYPE_P (type2
)
3123 || SCALAR_FLOAT_TYPE_P (type2
)
3124 || FIXED_POINT_TYPE_P (type2
)));
3127 /* Verify the contents of a GIMPLE_CALL STMT. Returns true when there
3128 is a problem, otherwise false. */
3131 verify_gimple_call (gimple stmt
)
3133 tree fn
= gimple_call_fn (stmt
);
3134 tree fntype
, fndecl
;
3137 if (gimple_call_internal_p (stmt
))
3141 error ("gimple call has two targets");
3142 debug_generic_stmt (fn
);
3150 error ("gimple call has no target");
3155 if (fn
&& !is_gimple_call_addr (fn
))
3157 error ("invalid function in gimple call");
3158 debug_generic_stmt (fn
);
3163 && (!POINTER_TYPE_P (TREE_TYPE (fn
))
3164 || (TREE_CODE (TREE_TYPE (TREE_TYPE (fn
))) != FUNCTION_TYPE
3165 && TREE_CODE (TREE_TYPE (TREE_TYPE (fn
))) != METHOD_TYPE
)))
3167 error ("non-function in gimple call");
3171 fndecl
= gimple_call_fndecl (stmt
);
3173 && TREE_CODE (fndecl
) == FUNCTION_DECL
3174 && DECL_LOOPING_CONST_OR_PURE_P (fndecl
)
3175 && !DECL_PURE_P (fndecl
)
3176 && !TREE_READONLY (fndecl
))
3178 error ("invalid pure const state for function");
3182 if (gimple_call_lhs (stmt
)
3183 && (!is_gimple_lvalue (gimple_call_lhs (stmt
))
3184 || verify_types_in_gimple_reference (gimple_call_lhs (stmt
), true)))
3186 error ("invalid LHS in gimple call");
3190 if (gimple_call_lhs (stmt
) && gimple_call_noreturn_p (stmt
))
3192 error ("LHS in noreturn call");
3196 fntype
= gimple_call_fntype (stmt
);
3198 && gimple_call_lhs (stmt
)
3199 && !useless_type_conversion_p (TREE_TYPE (gimple_call_lhs (stmt
)),
3201 /* ??? At least C++ misses conversions at assignments from
3202 void * call results.
3203 ??? Java is completely off. Especially with functions
3204 returning java.lang.Object.
3205 For now simply allow arbitrary pointer type conversions. */
3206 && !(POINTER_TYPE_P (TREE_TYPE (gimple_call_lhs (stmt
)))
3207 && POINTER_TYPE_P (TREE_TYPE (fntype
))))
3209 error ("invalid conversion in gimple call");
3210 debug_generic_stmt (TREE_TYPE (gimple_call_lhs (stmt
)));
3211 debug_generic_stmt (TREE_TYPE (fntype
));
3215 if (gimple_call_chain (stmt
)
3216 && !is_gimple_val (gimple_call_chain (stmt
)))
3218 error ("invalid static chain in gimple call");
3219 debug_generic_stmt (gimple_call_chain (stmt
));
3223 /* If there is a static chain argument, this should not be an indirect
3224 call, and the decl should have DECL_STATIC_CHAIN set. */
3225 if (gimple_call_chain (stmt
))
3227 if (!gimple_call_fndecl (stmt
))
3229 error ("static chain in indirect gimple call");
3232 fn
= TREE_OPERAND (fn
, 0);
3234 if (!DECL_STATIC_CHAIN (fn
))
3236 error ("static chain with function that doesn%'t use one");
3241 /* ??? The C frontend passes unpromoted arguments in case it
3242 didn't see a function declaration before the call. So for now
3243 leave the call arguments mostly unverified. Once we gimplify
3244 unit-at-a-time we have a chance to fix this. */
3246 for (i
= 0; i
< gimple_call_num_args (stmt
); ++i
)
3248 tree arg
= gimple_call_arg (stmt
, i
);
3249 if ((is_gimple_reg_type (TREE_TYPE (arg
))
3250 && !is_gimple_val (arg
))
3251 || (!is_gimple_reg_type (TREE_TYPE (arg
))
3252 && !is_gimple_lvalue (arg
)))
3254 error ("invalid argument to gimple call");
3255 debug_generic_expr (arg
);
3263 /* Verifies the gimple comparison with the result type TYPE and
3264 the operands OP0 and OP1. */
3267 verify_gimple_comparison (tree type
, tree op0
, tree op1
)
3269 tree op0_type
= TREE_TYPE (op0
);
3270 tree op1_type
= TREE_TYPE (op1
);
3272 if (!is_gimple_val (op0
) || !is_gimple_val (op1
))
3274 error ("invalid operands in gimple comparison");
3278 /* For comparisons we do not have the operations type as the
3279 effective type the comparison is carried out in. Instead
3280 we require that either the first operand is trivially
3281 convertible into the second, or the other way around.
3282 Because we special-case pointers to void we allow
3283 comparisons of pointers with the same mode as well. */
3284 if (!useless_type_conversion_p (op0_type
, op1_type
)
3285 && !useless_type_conversion_p (op1_type
, op0_type
)
3286 && (!POINTER_TYPE_P (op0_type
)
3287 || !POINTER_TYPE_P (op1_type
)
3288 || TYPE_MODE (op0_type
) != TYPE_MODE (op1_type
)))
3290 error ("mismatching comparison operand types");
3291 debug_generic_expr (op0_type
);
3292 debug_generic_expr (op1_type
);
3296 /* The resulting type of a comparison may be an effective boolean type. */
3297 if (INTEGRAL_TYPE_P (type
)
3298 && (TREE_CODE (type
) == BOOLEAN_TYPE
3299 || TYPE_PRECISION (type
) == 1))
3301 /* Or an integer vector type with the same size and element count
3302 as the comparison operand types. */
3303 else if (TREE_CODE (type
) == VECTOR_TYPE
3304 && TREE_CODE (TREE_TYPE (type
)) == INTEGER_TYPE
)
3306 if (TREE_CODE (op0_type
) != VECTOR_TYPE
3307 || TREE_CODE (op1_type
) != VECTOR_TYPE
)
3309 error ("non-vector operands in vector comparison");
3310 debug_generic_expr (op0_type
);
3311 debug_generic_expr (op1_type
);
3315 if (TYPE_VECTOR_SUBPARTS (type
) != TYPE_VECTOR_SUBPARTS (op0_type
)
3316 || (GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (type
)))
3317 != GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (op0_type
)))))
3319 error ("invalid vector comparison resulting type");
3320 debug_generic_expr (type
);
3326 error ("bogus comparison result type");
3327 debug_generic_expr (type
);
3334 /* Verify a gimple assignment statement STMT with an unary rhs.
3335 Returns true if anything is wrong. */
3338 verify_gimple_assign_unary (gimple stmt
)
3340 enum tree_code rhs_code
= gimple_assign_rhs_code (stmt
);
3341 tree lhs
= gimple_assign_lhs (stmt
);
3342 tree lhs_type
= TREE_TYPE (lhs
);
3343 tree rhs1
= gimple_assign_rhs1 (stmt
);
3344 tree rhs1_type
= TREE_TYPE (rhs1
);
3346 if (!is_gimple_reg (lhs
))
3348 error ("non-register as LHS of unary operation");
3352 if (!is_gimple_val (rhs1
))
3354 error ("invalid operand in unary operation");
3358 /* First handle conversions. */
3363 /* Allow conversions from pointer type to integral type only if
3364 there is no sign or zero extension involved.
3365 For targets were the precision of ptrofftype doesn't match that
3366 of pointers we need to allow arbitrary conversions to ptrofftype. */
3367 if ((POINTER_TYPE_P (lhs_type
)
3368 && INTEGRAL_TYPE_P (rhs1_type
))
3369 || (POINTER_TYPE_P (rhs1_type
)
3370 && INTEGRAL_TYPE_P (lhs_type
)
3371 && (TYPE_PRECISION (rhs1_type
) >= TYPE_PRECISION (lhs_type
)
3372 || ptrofftype_p (sizetype
))))
3375 /* Allow conversion from integral to offset type and vice versa. */
3376 if ((TREE_CODE (lhs_type
) == OFFSET_TYPE
3377 && INTEGRAL_TYPE_P (rhs1_type
))
3378 || (INTEGRAL_TYPE_P (lhs_type
)
3379 && TREE_CODE (rhs1_type
) == OFFSET_TYPE
))
3382 /* Otherwise assert we are converting between types of the
3384 if (INTEGRAL_TYPE_P (lhs_type
) != INTEGRAL_TYPE_P (rhs1_type
))
3386 error ("invalid types in nop conversion");
3387 debug_generic_expr (lhs_type
);
3388 debug_generic_expr (rhs1_type
);
3395 case ADDR_SPACE_CONVERT_EXPR
:
3397 if (!POINTER_TYPE_P (rhs1_type
) || !POINTER_TYPE_P (lhs_type
)
3398 || (TYPE_ADDR_SPACE (TREE_TYPE (rhs1_type
))
3399 == TYPE_ADDR_SPACE (TREE_TYPE (lhs_type
))))
3401 error ("invalid types in address space conversion");
3402 debug_generic_expr (lhs_type
);
3403 debug_generic_expr (rhs1_type
);
3410 case FIXED_CONVERT_EXPR
:
3412 if (!valid_fixed_convert_types_p (lhs_type
, rhs1_type
)
3413 && !valid_fixed_convert_types_p (rhs1_type
, lhs_type
))
3415 error ("invalid types in fixed-point conversion");
3416 debug_generic_expr (lhs_type
);
3417 debug_generic_expr (rhs1_type
);
3426 if ((!INTEGRAL_TYPE_P (rhs1_type
) || !SCALAR_FLOAT_TYPE_P (lhs_type
))
3427 && (!VECTOR_INTEGER_TYPE_P (rhs1_type
)
3428 || !VECTOR_FLOAT_TYPE_P(lhs_type
)))
3430 error ("invalid types in conversion to floating point");
3431 debug_generic_expr (lhs_type
);
3432 debug_generic_expr (rhs1_type
);
3439 case FIX_TRUNC_EXPR
:
3441 if ((!INTEGRAL_TYPE_P (lhs_type
) || !SCALAR_FLOAT_TYPE_P (rhs1_type
))
3442 && (!VECTOR_INTEGER_TYPE_P (lhs_type
)
3443 || !VECTOR_FLOAT_TYPE_P(rhs1_type
)))
3445 error ("invalid types in conversion to integer");
3446 debug_generic_expr (lhs_type
);
3447 debug_generic_expr (rhs1_type
);
3454 case VEC_UNPACK_HI_EXPR
:
3455 case VEC_UNPACK_LO_EXPR
:
3456 case REDUC_MAX_EXPR
:
3457 case REDUC_MIN_EXPR
:
3458 case REDUC_PLUS_EXPR
:
3459 case VEC_UNPACK_FLOAT_HI_EXPR
:
3460 case VEC_UNPACK_FLOAT_LO_EXPR
:
3468 case NON_LVALUE_EXPR
:
3476 /* For the remaining codes assert there is no conversion involved. */
3477 if (!useless_type_conversion_p (lhs_type
, rhs1_type
))
3479 error ("non-trivial conversion in unary operation");
3480 debug_generic_expr (lhs_type
);
3481 debug_generic_expr (rhs1_type
);
3488 /* Verify a gimple assignment statement STMT with a binary rhs.
3489 Returns true if anything is wrong. */
3492 verify_gimple_assign_binary (gimple stmt
)
3494 enum tree_code rhs_code
= gimple_assign_rhs_code (stmt
);
3495 tree lhs
= gimple_assign_lhs (stmt
);
3496 tree lhs_type
= TREE_TYPE (lhs
);
3497 tree rhs1
= gimple_assign_rhs1 (stmt
);
3498 tree rhs1_type
= TREE_TYPE (rhs1
);
3499 tree rhs2
= gimple_assign_rhs2 (stmt
);
3500 tree rhs2_type
= TREE_TYPE (rhs2
);
3502 if (!is_gimple_reg (lhs
))
3504 error ("non-register as LHS of binary operation");
3508 if (!is_gimple_val (rhs1
)
3509 || !is_gimple_val (rhs2
))
3511 error ("invalid operands in binary operation");
3515 /* First handle operations that involve different types. */
3520 if (TREE_CODE (lhs_type
) != COMPLEX_TYPE
3521 || !(INTEGRAL_TYPE_P (rhs1_type
)
3522 || SCALAR_FLOAT_TYPE_P (rhs1_type
))
3523 || !(INTEGRAL_TYPE_P (rhs2_type
)
3524 || SCALAR_FLOAT_TYPE_P (rhs2_type
)))
3526 error ("type mismatch in complex expression");
3527 debug_generic_expr (lhs_type
);
3528 debug_generic_expr (rhs1_type
);
3529 debug_generic_expr (rhs2_type
);
3541 /* Shifts and rotates are ok on integral types, fixed point
3542 types and integer vector types. */
3543 if ((!INTEGRAL_TYPE_P (rhs1_type
)
3544 && !FIXED_POINT_TYPE_P (rhs1_type
)
3545 && !(TREE_CODE (rhs1_type
) == VECTOR_TYPE
3546 && INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type
))))
3547 || (!INTEGRAL_TYPE_P (rhs2_type
)
3548 /* Vector shifts of vectors are also ok. */
3549 && !(TREE_CODE (rhs1_type
) == VECTOR_TYPE
3550 && INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type
))
3551 && TREE_CODE (rhs2_type
) == VECTOR_TYPE
3552 && INTEGRAL_TYPE_P (TREE_TYPE (rhs2_type
))))
3553 || !useless_type_conversion_p (lhs_type
, rhs1_type
))
3555 error ("type mismatch in shift expression");
3556 debug_generic_expr (lhs_type
);
3557 debug_generic_expr (rhs1_type
);
3558 debug_generic_expr (rhs2_type
);
3565 case VEC_LSHIFT_EXPR
:
3566 case VEC_RSHIFT_EXPR
:
3568 if (TREE_CODE (rhs1_type
) != VECTOR_TYPE
3569 || !(INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type
))
3570 || POINTER_TYPE_P (TREE_TYPE (rhs1_type
))
3571 || FIXED_POINT_TYPE_P (TREE_TYPE (rhs1_type
))
3572 || SCALAR_FLOAT_TYPE_P (TREE_TYPE (rhs1_type
)))
3573 || (!INTEGRAL_TYPE_P (rhs2_type
)
3574 && (TREE_CODE (rhs2_type
) != VECTOR_TYPE
3575 || !INTEGRAL_TYPE_P (TREE_TYPE (rhs2_type
))))
3576 || !useless_type_conversion_p (lhs_type
, rhs1_type
))
3578 error ("type mismatch in vector shift expression");
3579 debug_generic_expr (lhs_type
);
3580 debug_generic_expr (rhs1_type
);
3581 debug_generic_expr (rhs2_type
);
3584 /* For shifting a vector of non-integral components we
3585 only allow shifting by a constant multiple of the element size. */
3586 if (!INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type
))
3587 && (TREE_CODE (rhs2
) != INTEGER_CST
3588 || !div_if_zero_remainder (EXACT_DIV_EXPR
, rhs2
,
3589 TYPE_SIZE (TREE_TYPE (rhs1_type
)))))
3591 error ("non-element sized vector shift of floating point vector");
3598 case WIDEN_LSHIFT_EXPR
:
3600 if (!INTEGRAL_TYPE_P (lhs_type
)
3601 || !INTEGRAL_TYPE_P (rhs1_type
)
3602 || TREE_CODE (rhs2
) != INTEGER_CST
3603 || (2 * TYPE_PRECISION (rhs1_type
) > TYPE_PRECISION (lhs_type
)))
3605 error ("type mismatch in widening vector shift expression");
3606 debug_generic_expr (lhs_type
);
3607 debug_generic_expr (rhs1_type
);
3608 debug_generic_expr (rhs2_type
);
3615 case VEC_WIDEN_LSHIFT_HI_EXPR
:
3616 case VEC_WIDEN_LSHIFT_LO_EXPR
:
3618 if (TREE_CODE (rhs1_type
) != VECTOR_TYPE
3619 || TREE_CODE (lhs_type
) != VECTOR_TYPE
3620 || !INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type
))
3621 || !INTEGRAL_TYPE_P (TREE_TYPE (lhs_type
))
3622 || TREE_CODE (rhs2
) != INTEGER_CST
3623 || (2 * TYPE_PRECISION (TREE_TYPE (rhs1_type
))
3624 > TYPE_PRECISION (TREE_TYPE (lhs_type
))))
3626 error ("type mismatch in widening vector shift expression");
3627 debug_generic_expr (lhs_type
);
3628 debug_generic_expr (rhs1_type
);
3629 debug_generic_expr (rhs2_type
);
3639 /* We use regular PLUS_EXPR and MINUS_EXPR for vectors.
3640 ??? This just makes the checker happy and may not be what is
3642 if (TREE_CODE (lhs_type
) == VECTOR_TYPE
3643 && POINTER_TYPE_P (TREE_TYPE (lhs_type
)))
3645 if (TREE_CODE (rhs1_type
) != VECTOR_TYPE
3646 || TREE_CODE (rhs2_type
) != VECTOR_TYPE
)
3648 error ("invalid non-vector operands to vector valued plus");
3651 lhs_type
= TREE_TYPE (lhs_type
);
3652 rhs1_type
= TREE_TYPE (rhs1_type
);
3653 rhs2_type
= TREE_TYPE (rhs2_type
);
3654 /* PLUS_EXPR is commutative, so we might end up canonicalizing
3655 the pointer to 2nd place. */
3656 if (POINTER_TYPE_P (rhs2_type
))
3658 tree tem
= rhs1_type
;
3659 rhs1_type
= rhs2_type
;
3662 goto do_pointer_plus_expr_check
;
3664 if (POINTER_TYPE_P (lhs_type
)
3665 || POINTER_TYPE_P (rhs1_type
)
3666 || POINTER_TYPE_P (rhs2_type
))
3668 error ("invalid (pointer) operands to plus/minus");
3672 /* Continue with generic binary expression handling. */
3676 case POINTER_PLUS_EXPR
:
3678 do_pointer_plus_expr_check
:
3679 if (!POINTER_TYPE_P (rhs1_type
)
3680 || !useless_type_conversion_p (lhs_type
, rhs1_type
)
3681 || !ptrofftype_p (rhs2_type
))
3683 error ("type mismatch in pointer plus expression");
3684 debug_generic_stmt (lhs_type
);
3685 debug_generic_stmt (rhs1_type
);
3686 debug_generic_stmt (rhs2_type
);
3693 case TRUTH_ANDIF_EXPR
:
3694 case TRUTH_ORIF_EXPR
:
3695 case TRUTH_AND_EXPR
:
3697 case TRUTH_XOR_EXPR
:
3707 case UNORDERED_EXPR
:
3715 /* Comparisons are also binary, but the result type is not
3716 connected to the operand types. */
3717 return verify_gimple_comparison (lhs_type
, rhs1
, rhs2
);
3719 case WIDEN_MULT_EXPR
:
3720 if (TREE_CODE (lhs_type
) != INTEGER_TYPE
)
3722 return ((2 * TYPE_PRECISION (rhs1_type
) > TYPE_PRECISION (lhs_type
))
3723 || (TYPE_PRECISION (rhs1_type
) != TYPE_PRECISION (rhs2_type
)));
3725 case WIDEN_SUM_EXPR
:
3726 case VEC_WIDEN_MULT_HI_EXPR
:
3727 case VEC_WIDEN_MULT_LO_EXPR
:
3728 case VEC_PACK_TRUNC_EXPR
:
3729 case VEC_PACK_SAT_EXPR
:
3730 case VEC_PACK_FIX_TRUNC_EXPR
:
3735 case TRUNC_DIV_EXPR
:
3737 case FLOOR_DIV_EXPR
:
3738 case ROUND_DIV_EXPR
:
3739 case TRUNC_MOD_EXPR
:
3741 case FLOOR_MOD_EXPR
:
3742 case ROUND_MOD_EXPR
:
3744 case EXACT_DIV_EXPR
:
3750 /* Continue with generic binary expression handling. */
3757 if (!useless_type_conversion_p (lhs_type
, rhs1_type
)
3758 || !useless_type_conversion_p (lhs_type
, rhs2_type
))
3760 error ("type mismatch in binary expression");
3761 debug_generic_stmt (lhs_type
);
3762 debug_generic_stmt (rhs1_type
);
3763 debug_generic_stmt (rhs2_type
);
3770 /* Verify a gimple assignment statement STMT with a ternary rhs.
3771 Returns true if anything is wrong. */
3774 verify_gimple_assign_ternary (gimple stmt
)
3776 enum tree_code rhs_code
= gimple_assign_rhs_code (stmt
);
3777 tree lhs
= gimple_assign_lhs (stmt
);
3778 tree lhs_type
= TREE_TYPE (lhs
);
3779 tree rhs1
= gimple_assign_rhs1 (stmt
);
3780 tree rhs1_type
= TREE_TYPE (rhs1
);
3781 tree rhs2
= gimple_assign_rhs2 (stmt
);
3782 tree rhs2_type
= TREE_TYPE (rhs2
);
3783 tree rhs3
= gimple_assign_rhs3 (stmt
);
3784 tree rhs3_type
= TREE_TYPE (rhs3
);
3786 if (!is_gimple_reg (lhs
))
3788 error ("non-register as LHS of ternary operation");
3792 if (((rhs_code
== VEC_COND_EXPR
|| rhs_code
== COND_EXPR
)
3793 ? !is_gimple_condexpr (rhs1
) : !is_gimple_val (rhs1
))
3794 || !is_gimple_val (rhs2
)
3795 || !is_gimple_val (rhs3
))
3797 error ("invalid operands in ternary operation");
3801 /* First handle operations that involve different types. */
3804 case WIDEN_MULT_PLUS_EXPR
:
3805 case WIDEN_MULT_MINUS_EXPR
:
3806 if ((!INTEGRAL_TYPE_P (rhs1_type
)
3807 && !FIXED_POINT_TYPE_P (rhs1_type
))
3808 || !useless_type_conversion_p (rhs1_type
, rhs2_type
)
3809 || !useless_type_conversion_p (lhs_type
, rhs3_type
)
3810 || 2 * TYPE_PRECISION (rhs1_type
) > TYPE_PRECISION (lhs_type
)
3811 || TYPE_PRECISION (rhs1_type
) != TYPE_PRECISION (rhs2_type
))
3813 error ("type mismatch in widening multiply-accumulate expression");
3814 debug_generic_expr (lhs_type
);
3815 debug_generic_expr (rhs1_type
);
3816 debug_generic_expr (rhs2_type
);
3817 debug_generic_expr (rhs3_type
);
3823 if (!useless_type_conversion_p (lhs_type
, rhs1_type
)
3824 || !useless_type_conversion_p (lhs_type
, rhs2_type
)
3825 || !useless_type_conversion_p (lhs_type
, rhs3_type
))
3827 error ("type mismatch in fused multiply-add expression");
3828 debug_generic_expr (lhs_type
);
3829 debug_generic_expr (rhs1_type
);
3830 debug_generic_expr (rhs2_type
);
3831 debug_generic_expr (rhs3_type
);
3838 if (!useless_type_conversion_p (lhs_type
, rhs2_type
)
3839 || !useless_type_conversion_p (lhs_type
, rhs3_type
))
3841 error ("type mismatch in conditional expression");
3842 debug_generic_expr (lhs_type
);
3843 debug_generic_expr (rhs2_type
);
3844 debug_generic_expr (rhs3_type
);
3850 if (!useless_type_conversion_p (lhs_type
, rhs1_type
)
3851 || !useless_type_conversion_p (lhs_type
, rhs2_type
))
3853 error ("type mismatch in vector permute expression");
3854 debug_generic_expr (lhs_type
);
3855 debug_generic_expr (rhs1_type
);
3856 debug_generic_expr (rhs2_type
);
3857 debug_generic_expr (rhs3_type
);
3861 if (TREE_CODE (rhs1_type
) != VECTOR_TYPE
3862 || TREE_CODE (rhs2_type
) != VECTOR_TYPE
3863 || TREE_CODE (rhs3_type
) != VECTOR_TYPE
)
3865 error ("vector types expected in vector permute expression");
3866 debug_generic_expr (lhs_type
);
3867 debug_generic_expr (rhs1_type
);
3868 debug_generic_expr (rhs2_type
);
3869 debug_generic_expr (rhs3_type
);
3873 if (TYPE_VECTOR_SUBPARTS (rhs1_type
) != TYPE_VECTOR_SUBPARTS (rhs2_type
)
3874 || TYPE_VECTOR_SUBPARTS (rhs2_type
)
3875 != TYPE_VECTOR_SUBPARTS (rhs3_type
)
3876 || TYPE_VECTOR_SUBPARTS (rhs3_type
)
3877 != TYPE_VECTOR_SUBPARTS (lhs_type
))
3879 error ("vectors with different element number found "
3880 "in vector permute expression");
3881 debug_generic_expr (lhs_type
);
3882 debug_generic_expr (rhs1_type
);
3883 debug_generic_expr (rhs2_type
);
3884 debug_generic_expr (rhs3_type
);
3888 if (TREE_CODE (TREE_TYPE (rhs3_type
)) != INTEGER_TYPE
3889 || GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (rhs3_type
)))
3890 != GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (rhs1_type
))))
3892 error ("invalid mask type in vector permute expression");
3893 debug_generic_expr (lhs_type
);
3894 debug_generic_expr (rhs1_type
);
3895 debug_generic_expr (rhs2_type
);
3896 debug_generic_expr (rhs3_type
);
3903 case REALIGN_LOAD_EXPR
:
3913 /* Verify a gimple assignment statement STMT with a single rhs.
3914 Returns true if anything is wrong. */
3917 verify_gimple_assign_single (gimple stmt
)
3919 enum tree_code rhs_code
= gimple_assign_rhs_code (stmt
);
3920 tree lhs
= gimple_assign_lhs (stmt
);
3921 tree lhs_type
= TREE_TYPE (lhs
);
3922 tree rhs1
= gimple_assign_rhs1 (stmt
);
3923 tree rhs1_type
= TREE_TYPE (rhs1
);
3926 if (!useless_type_conversion_p (lhs_type
, rhs1_type
))
3928 error ("non-trivial conversion at assignment");
3929 debug_generic_expr (lhs_type
);
3930 debug_generic_expr (rhs1_type
);
3934 if (handled_component_p (lhs
))
3935 res
|= verify_types_in_gimple_reference (lhs
, true);
3937 /* Special codes we cannot handle via their class. */
3942 tree op
= TREE_OPERAND (rhs1
, 0);
3943 if (!is_gimple_addressable (op
))
3945 error ("invalid operand in unary expression");
3949 /* Technically there is no longer a need for matching types, but
3950 gimple hygiene asks for this check. In LTO we can end up
3951 combining incompatible units and thus end up with addresses
3952 of globals that change their type to a common one. */
3954 && !types_compatible_p (TREE_TYPE (op
),
3955 TREE_TYPE (TREE_TYPE (rhs1
)))
3956 && !one_pointer_to_useless_type_conversion_p (TREE_TYPE (rhs1
),
3959 error ("type mismatch in address expression");
3960 debug_generic_stmt (TREE_TYPE (rhs1
));
3961 debug_generic_stmt (TREE_TYPE (op
));
3965 return verify_types_in_gimple_reference (op
, true);
3970 error ("INDIRECT_REF in gimple IL");
3976 case ARRAY_RANGE_REF
:
3977 case VIEW_CONVERT_EXPR
:
3980 case TARGET_MEM_REF
:
3982 if (!is_gimple_reg (lhs
)
3983 && is_gimple_reg_type (TREE_TYPE (lhs
)))
3985 error ("invalid rhs for gimple memory store");
3986 debug_generic_stmt (lhs
);
3987 debug_generic_stmt (rhs1
);
3990 return res
|| verify_types_in_gimple_reference (rhs1
, false);
4002 /* tcc_declaration */
4007 if (!is_gimple_reg (lhs
)
4008 && !is_gimple_reg (rhs1
)
4009 && is_gimple_reg_type (TREE_TYPE (lhs
)))
4011 error ("invalid rhs for gimple memory store");
4012 debug_generic_stmt (lhs
);
4013 debug_generic_stmt (rhs1
);
4021 case WITH_SIZE_EXPR
:
4031 /* Verify the contents of a GIMPLE_ASSIGN STMT. Returns true when there
4032 is a problem, otherwise false. */
4035 verify_gimple_assign (gimple stmt
)
4037 switch (gimple_assign_rhs_class (stmt
))
4039 case GIMPLE_SINGLE_RHS
:
4040 return verify_gimple_assign_single (stmt
);
4042 case GIMPLE_UNARY_RHS
:
4043 return verify_gimple_assign_unary (stmt
);
4045 case GIMPLE_BINARY_RHS
:
4046 return verify_gimple_assign_binary (stmt
);
4048 case GIMPLE_TERNARY_RHS
:
4049 return verify_gimple_assign_ternary (stmt
);
4056 /* Verify the contents of a GIMPLE_RETURN STMT. Returns true when there
4057 is a problem, otherwise false. */
4060 verify_gimple_return (gimple stmt
)
4062 tree op
= gimple_return_retval (stmt
);
4063 tree restype
= TREE_TYPE (TREE_TYPE (cfun
->decl
));
4065 /* We cannot test for present return values as we do not fix up missing
4066 return values from the original source. */
4070 if (!is_gimple_val (op
)
4071 && TREE_CODE (op
) != RESULT_DECL
)
4073 error ("invalid operand in return statement");
4074 debug_generic_stmt (op
);
4078 if ((TREE_CODE (op
) == RESULT_DECL
4079 && DECL_BY_REFERENCE (op
))
4080 || (TREE_CODE (op
) == SSA_NAME
4081 && TREE_CODE (SSA_NAME_VAR (op
)) == RESULT_DECL
4082 && DECL_BY_REFERENCE (SSA_NAME_VAR (op
))))
4083 op
= TREE_TYPE (op
);
4085 if (!useless_type_conversion_p (restype
, TREE_TYPE (op
)))
4087 error ("invalid conversion in return statement");
4088 debug_generic_stmt (restype
);
4089 debug_generic_stmt (TREE_TYPE (op
));
4097 /* Verify the contents of a GIMPLE_GOTO STMT. Returns true when there
4098 is a problem, otherwise false. */
4101 verify_gimple_goto (gimple stmt
)
4103 tree dest
= gimple_goto_dest (stmt
);
4105 /* ??? We have two canonical forms of direct goto destinations, a
4106 bare LABEL_DECL and an ADDR_EXPR of a LABEL_DECL. */
4107 if (TREE_CODE (dest
) != LABEL_DECL
4108 && (!is_gimple_val (dest
)
4109 || !POINTER_TYPE_P (TREE_TYPE (dest
))))
4111 error ("goto destination is neither a label nor a pointer");
4118 /* Verify the contents of a GIMPLE_SWITCH STMT. Returns true when there
4119 is a problem, otherwise false. */
4122 verify_gimple_switch (gimple stmt
)
4125 tree elt
, prev_upper_bound
= NULL_TREE
;
4126 tree index_type
, elt_type
= NULL_TREE
;
4128 if (!is_gimple_val (gimple_switch_index (stmt
)))
4130 error ("invalid operand to switch statement");
4131 debug_generic_stmt (gimple_switch_index (stmt
));
4135 index_type
= TREE_TYPE (gimple_switch_index (stmt
));
4136 if (! INTEGRAL_TYPE_P (index_type
))
4138 error ("non-integral type switch statement");
4139 debug_generic_expr (index_type
);
4143 elt
= gimple_switch_default_label (stmt
);
4144 if (CASE_LOW (elt
) != NULL_TREE
|| CASE_HIGH (elt
) != NULL_TREE
)
4146 error ("invalid default case label in switch statement");
4147 debug_generic_expr (elt
);
4151 n
= gimple_switch_num_labels (stmt
);
4152 for (i
= 1; i
< n
; i
++)
4154 elt
= gimple_switch_label (stmt
, i
);
4156 if (! CASE_LOW (elt
))
4158 error ("invalid case label in switch statement");
4159 debug_generic_expr (elt
);
4163 && ! tree_int_cst_lt (CASE_LOW (elt
), CASE_HIGH (elt
)))
4165 error ("invalid case range in switch statement");
4166 debug_generic_expr (elt
);
4172 if (TREE_TYPE (CASE_LOW (elt
)) != elt_type
4173 || (CASE_HIGH (elt
) && TREE_TYPE (CASE_HIGH (elt
)) != elt_type
))
4175 error ("type mismatch for case label in switch statement");
4176 debug_generic_expr (elt
);
4182 elt_type
= TREE_TYPE (CASE_LOW (elt
));
4183 if (TYPE_PRECISION (index_type
) < TYPE_PRECISION (elt_type
))
4185 error ("type precision mismatch in switch statement");
4190 if (prev_upper_bound
)
4192 if (! tree_int_cst_lt (prev_upper_bound
, CASE_LOW (elt
)))
4194 error ("case labels not sorted in switch statement");
4199 prev_upper_bound
= CASE_HIGH (elt
);
4200 if (! prev_upper_bound
)
4201 prev_upper_bound
= CASE_LOW (elt
);
4207 /* Verify a gimple debug statement STMT.
4208 Returns true if anything is wrong. */
4211 verify_gimple_debug (gimple stmt ATTRIBUTE_UNUSED
)
4213 /* There isn't much that could be wrong in a gimple debug stmt. A
4214 gimple debug bind stmt, for example, maps a tree, that's usually
4215 a VAR_DECL or a PARM_DECL, but that could also be some scalarized
4216 component or member of an aggregate type, to another tree, that
4217 can be an arbitrary expression. These stmts expand into debug
4218 insns, and are converted to debug notes by var-tracking.c. */
4222 /* Verify a gimple label statement STMT.
4223 Returns true if anything is wrong. */
4226 verify_gimple_label (gimple stmt
)
4228 tree decl
= gimple_label_label (stmt
);
4232 if (TREE_CODE (decl
) != LABEL_DECL
)
4235 uid
= LABEL_DECL_UID (decl
);
4238 || VEC_index (basic_block
,
4239 label_to_block_map
, uid
) != gimple_bb (stmt
)))
4241 error ("incorrect entry in label_to_block_map");
4245 uid
= EH_LANDING_PAD_NR (decl
);
4248 eh_landing_pad lp
= get_eh_landing_pad_from_number (uid
);
4249 if (decl
!= lp
->post_landing_pad
)
4251 error ("incorrect setting of landing pad number");
4259 /* Verify the GIMPLE statement STMT. Returns true if there is an
4260 error, otherwise false. */
4263 verify_gimple_stmt (gimple stmt
)
4265 switch (gimple_code (stmt
))
4268 return verify_gimple_assign (stmt
);
4271 return verify_gimple_label (stmt
);
4274 return verify_gimple_call (stmt
);
4277 if (TREE_CODE_CLASS (gimple_cond_code (stmt
)) != tcc_comparison
)
4279 error ("invalid comparison code in gimple cond");
4282 if (!(!gimple_cond_true_label (stmt
)
4283 || TREE_CODE (gimple_cond_true_label (stmt
)) == LABEL_DECL
)
4284 || !(!gimple_cond_false_label (stmt
)
4285 || TREE_CODE (gimple_cond_false_label (stmt
)) == LABEL_DECL
))
4287 error ("invalid labels in gimple cond");
4291 return verify_gimple_comparison (boolean_type_node
,
4292 gimple_cond_lhs (stmt
),
4293 gimple_cond_rhs (stmt
));
4296 return verify_gimple_goto (stmt
);
4299 return verify_gimple_switch (stmt
);
4302 return verify_gimple_return (stmt
);
4307 case GIMPLE_TRANSACTION
:
4308 return verify_gimple_transaction (stmt
);
4310 /* Tuples that do not have tree operands. */
4312 case GIMPLE_PREDICT
:
4314 case GIMPLE_EH_DISPATCH
:
4315 case GIMPLE_EH_MUST_NOT_THROW
:
4319 /* OpenMP directives are validated by the FE and never operated
4320 on by the optimizers. Furthermore, GIMPLE_OMP_FOR may contain
4321 non-gimple expressions when the main index variable has had
4322 its address taken. This does not affect the loop itself
4323 because the header of an GIMPLE_OMP_FOR is merely used to determine
4324 how to setup the parallel iteration. */
4328 return verify_gimple_debug (stmt
);
4335 /* Verify the contents of a GIMPLE_PHI. Returns true if there is a problem,
4336 and false otherwise. */
4339 verify_gimple_phi (gimple phi
)
4343 tree phi_result
= gimple_phi_result (phi
);
4348 error ("invalid PHI result");
4352 virtual_p
= !is_gimple_reg (phi_result
);
4353 if (TREE_CODE (phi_result
) != SSA_NAME
4355 && SSA_NAME_VAR (phi_result
) != gimple_vop (cfun
)))
4357 error ("invalid PHI result");
4361 for (i
= 0; i
< gimple_phi_num_args (phi
); i
++)
4363 tree t
= gimple_phi_arg_def (phi
, i
);
4367 error ("missing PHI def");
4371 /* Addressable variables do have SSA_NAMEs but they
4372 are not considered gimple values. */
4373 else if ((TREE_CODE (t
) == SSA_NAME
4374 && virtual_p
!= !is_gimple_reg (t
))
4376 && (TREE_CODE (t
) != SSA_NAME
4377 || SSA_NAME_VAR (t
) != gimple_vop (cfun
)))
4379 && !is_gimple_val (t
)))
4381 error ("invalid PHI argument");
4382 debug_generic_expr (t
);
4385 #ifdef ENABLE_TYPES_CHECKING
4386 if (!useless_type_conversion_p (TREE_TYPE (phi_result
), TREE_TYPE (t
)))
4388 error ("incompatible types in PHI argument %u", i
);
4389 debug_generic_stmt (TREE_TYPE (phi_result
));
4390 debug_generic_stmt (TREE_TYPE (t
));
4399 /* Verify the GIMPLE statements inside the sequence STMTS. */
4402 verify_gimple_in_seq_2 (gimple_seq stmts
)
4404 gimple_stmt_iterator ittr
;
4407 for (ittr
= gsi_start (stmts
); !gsi_end_p (ittr
); gsi_next (&ittr
))
4409 gimple stmt
= gsi_stmt (ittr
);
4411 switch (gimple_code (stmt
))
4414 err
|= verify_gimple_in_seq_2 (gimple_bind_body (stmt
));
4418 err
|= verify_gimple_in_seq_2 (gimple_try_eval (stmt
));
4419 err
|= verify_gimple_in_seq_2 (gimple_try_cleanup (stmt
));
4422 case GIMPLE_EH_FILTER
:
4423 err
|= verify_gimple_in_seq_2 (gimple_eh_filter_failure (stmt
));
4426 case GIMPLE_EH_ELSE
:
4427 err
|= verify_gimple_in_seq_2 (gimple_eh_else_n_body (stmt
));
4428 err
|= verify_gimple_in_seq_2 (gimple_eh_else_e_body (stmt
));
4432 err
|= verify_gimple_in_seq_2 (gimple_catch_handler (stmt
));
4435 case GIMPLE_TRANSACTION
:
4436 err
|= verify_gimple_transaction (stmt
);
4441 bool err2
= verify_gimple_stmt (stmt
);
4443 debug_gimple_stmt (stmt
);
4452 /* Verify the contents of a GIMPLE_TRANSACTION. Returns true if there
4453 is a problem, otherwise false. */
4456 verify_gimple_transaction (gimple stmt
)
4458 tree lab
= gimple_transaction_label (stmt
);
4459 if (lab
!= NULL
&& TREE_CODE (lab
) != LABEL_DECL
)
4461 return verify_gimple_in_seq_2 (gimple_transaction_body (stmt
));
4465 /* Verify the GIMPLE statements inside the statement list STMTS. */
4468 verify_gimple_in_seq (gimple_seq stmts
)
4470 timevar_push (TV_TREE_STMT_VERIFY
);
4471 if (verify_gimple_in_seq_2 (stmts
))
4472 internal_error ("verify_gimple failed");
4473 timevar_pop (TV_TREE_STMT_VERIFY
);
4476 /* Return true when the T can be shared. */
4479 tree_node_can_be_shared (tree t
)
4481 if (IS_TYPE_OR_DECL_P (t
)
4482 || is_gimple_min_invariant (t
)
4483 || TREE_CODE (t
) == SSA_NAME
4484 || t
== error_mark_node
4485 || TREE_CODE (t
) == IDENTIFIER_NODE
)
4488 if (TREE_CODE (t
) == CASE_LABEL_EXPR
)
4491 while (((TREE_CODE (t
) == ARRAY_REF
|| TREE_CODE (t
) == ARRAY_RANGE_REF
)
4492 && is_gimple_min_invariant (TREE_OPERAND (t
, 1)))
4493 || TREE_CODE (t
) == COMPONENT_REF
4494 || TREE_CODE (t
) == REALPART_EXPR
4495 || TREE_CODE (t
) == IMAGPART_EXPR
)
4496 t
= TREE_OPERAND (t
, 0);
4504 /* Called via walk_gimple_stmt. Verify tree sharing. */
4507 verify_node_sharing (tree
*tp
, int *walk_subtrees
, void *data
)
4509 struct walk_stmt_info
*wi
= (struct walk_stmt_info
*) data
;
4510 struct pointer_set_t
*visited
= (struct pointer_set_t
*) wi
->info
;
4512 if (tree_node_can_be_shared (*tp
))
4514 *walk_subtrees
= false;
4518 if (pointer_set_insert (visited
, *tp
))
4524 static bool eh_error_found
;
4526 verify_eh_throw_stmt_node (void **slot
, void *data
)
4528 struct throw_stmt_node
*node
= (struct throw_stmt_node
*)*slot
;
4529 struct pointer_set_t
*visited
= (struct pointer_set_t
*) data
;
4531 if (!pointer_set_contains (visited
, node
->stmt
))
4533 error ("dead STMT in EH table");
4534 debug_gimple_stmt (node
->stmt
);
4535 eh_error_found
= true;
4540 /* Verify the GIMPLE statements in the CFG of FN. */
4543 verify_gimple_in_cfg (struct function
*fn
)
4547 struct pointer_set_t
*visited
, *visited_stmts
;
4549 timevar_push (TV_TREE_STMT_VERIFY
);
4550 visited
= pointer_set_create ();
4551 visited_stmts
= pointer_set_create ();
4553 FOR_EACH_BB_FN (bb
, fn
)
4555 gimple_stmt_iterator gsi
;
4557 for (gsi
= gsi_start_phis (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
4559 gimple phi
= gsi_stmt (gsi
);
4563 pointer_set_insert (visited_stmts
, phi
);
4565 if (gimple_bb (phi
) != bb
)
4567 error ("gimple_bb (phi) is set to a wrong basic block");
4571 err2
|= verify_gimple_phi (phi
);
4573 for (i
= 0; i
< gimple_phi_num_args (phi
); i
++)
4575 tree arg
= gimple_phi_arg_def (phi
, i
);
4576 tree addr
= walk_tree (&arg
, verify_node_sharing
, visited
, NULL
);
4579 error ("incorrect sharing of tree nodes");
4580 debug_generic_expr (addr
);
4586 debug_gimple_stmt (phi
);
4590 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
4592 gimple stmt
= gsi_stmt (gsi
);
4594 struct walk_stmt_info wi
;
4598 pointer_set_insert (visited_stmts
, stmt
);
4600 if (gimple_bb (stmt
) != bb
)
4602 error ("gimple_bb (stmt) is set to a wrong basic block");
4606 err2
|= verify_gimple_stmt (stmt
);
4608 memset (&wi
, 0, sizeof (wi
));
4609 wi
.info
= (void *) visited
;
4610 addr
= walk_gimple_op (stmt
, verify_node_sharing
, &wi
);
4613 error ("incorrect sharing of tree nodes");
4614 debug_generic_expr (addr
);
4618 /* ??? Instead of not checking these stmts at all the walker
4619 should know its context via wi. */
4620 if (!is_gimple_debug (stmt
)
4621 && !is_gimple_omp (stmt
))
4623 memset (&wi
, 0, sizeof (wi
));
4624 addr
= walk_gimple_op (stmt
, verify_expr
, &wi
);
4627 debug_generic_expr (addr
);
4628 inform (gimple_location (stmt
), "in statement");
4633 /* If the statement is marked as part of an EH region, then it is
4634 expected that the statement could throw. Verify that when we
4635 have optimizations that simplify statements such that we prove
4636 that they cannot throw, that we update other data structures
4638 lp_nr
= lookup_stmt_eh_lp (stmt
);
4641 if (!stmt_could_throw_p (stmt
))
4643 error ("statement marked for throw, but doesn%'t");
4647 && !gsi_one_before_end_p (gsi
)
4648 && stmt_can_throw_internal (stmt
))
4650 error ("statement marked for throw in middle of block");
4656 debug_gimple_stmt (stmt
);
4661 eh_error_found
= false;
4662 if (get_eh_throw_stmt_table (cfun
))
4663 htab_traverse (get_eh_throw_stmt_table (cfun
),
4664 verify_eh_throw_stmt_node
,
4667 if (err
|| eh_error_found
)
4668 internal_error ("verify_gimple failed");
4670 pointer_set_destroy (visited
);
4671 pointer_set_destroy (visited_stmts
);
4672 verify_histograms ();
4673 timevar_pop (TV_TREE_STMT_VERIFY
);
4677 /* Verifies that the flow information is OK. */
4680 gimple_verify_flow_info (void)
4684 gimple_stmt_iterator gsi
;
4689 if (ENTRY_BLOCK_PTR
->il
.gimple
.seq
|| ENTRY_BLOCK_PTR
->il
.gimple
.phi_nodes
)
4691 error ("ENTRY_BLOCK has IL associated with it");
4695 if (EXIT_BLOCK_PTR
->il
.gimple
.seq
|| EXIT_BLOCK_PTR
->il
.gimple
.phi_nodes
)
4697 error ("EXIT_BLOCK has IL associated with it");
4701 FOR_EACH_EDGE (e
, ei
, EXIT_BLOCK_PTR
->preds
)
4702 if (e
->flags
& EDGE_FALLTHRU
)
4704 error ("fallthru to exit from bb %d", e
->src
->index
);
4710 bool found_ctrl_stmt
= false;
4714 /* Skip labels on the start of basic block. */
4715 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
4718 gimple prev_stmt
= stmt
;
4720 stmt
= gsi_stmt (gsi
);
4722 if (gimple_code (stmt
) != GIMPLE_LABEL
)
4725 label
= gimple_label_label (stmt
);
4726 if (prev_stmt
&& DECL_NONLOCAL (label
))
4728 error ("nonlocal label ");
4729 print_generic_expr (stderr
, label
, 0);
4730 fprintf (stderr
, " is not first in a sequence of labels in bb %d",
4735 if (prev_stmt
&& EH_LANDING_PAD_NR (label
) != 0)
4737 error ("EH landing pad label ");
4738 print_generic_expr (stderr
, label
, 0);
4739 fprintf (stderr
, " is not first in a sequence of labels in bb %d",
4744 if (label_to_block (label
) != bb
)
4747 print_generic_expr (stderr
, label
, 0);
4748 fprintf (stderr
, " to block does not match in bb %d",
4753 if (decl_function_context (label
) != current_function_decl
)
4756 print_generic_expr (stderr
, label
, 0);
4757 fprintf (stderr
, " has incorrect context in bb %d",
4763 /* Verify that body of basic block BB is free of control flow. */
4764 for (; !gsi_end_p (gsi
); gsi_next (&gsi
))
4766 gimple stmt
= gsi_stmt (gsi
);
4768 if (found_ctrl_stmt
)
4770 error ("control flow in the middle of basic block %d",
4775 if (stmt_ends_bb_p (stmt
))
4776 found_ctrl_stmt
= true;
4778 if (gimple_code (stmt
) == GIMPLE_LABEL
)
4781 print_generic_expr (stderr
, gimple_label_label (stmt
), 0);
4782 fprintf (stderr
, " in the middle of basic block %d", bb
->index
);
4787 gsi
= gsi_last_bb (bb
);
4788 if (gsi_end_p (gsi
))
4791 stmt
= gsi_stmt (gsi
);
4793 if (gimple_code (stmt
) == GIMPLE_LABEL
)
4796 err
|= verify_eh_edges (stmt
);
4798 if (is_ctrl_stmt (stmt
))
4800 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
4801 if (e
->flags
& EDGE_FALLTHRU
)
4803 error ("fallthru edge after a control statement in bb %d",
4809 if (gimple_code (stmt
) != GIMPLE_COND
)
4811 /* Verify that there are no edges with EDGE_TRUE/FALSE_FLAG set
4812 after anything else but if statement. */
4813 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
4814 if (e
->flags
& (EDGE_TRUE_VALUE
| EDGE_FALSE_VALUE
))
4816 error ("true/false edge after a non-GIMPLE_COND in bb %d",
4822 switch (gimple_code (stmt
))
4829 extract_true_false_edges_from_block (bb
, &true_edge
, &false_edge
);
4833 || !(true_edge
->flags
& EDGE_TRUE_VALUE
)
4834 || !(false_edge
->flags
& EDGE_FALSE_VALUE
)
4835 || (true_edge
->flags
& (EDGE_FALLTHRU
| EDGE_ABNORMAL
))
4836 || (false_edge
->flags
& (EDGE_FALLTHRU
| EDGE_ABNORMAL
))
4837 || EDGE_COUNT (bb
->succs
) >= 3)
4839 error ("wrong outgoing edge flags at end of bb %d",
4847 if (simple_goto_p (stmt
))
4849 error ("explicit goto at end of bb %d", bb
->index
);
4854 /* FIXME. We should double check that the labels in the
4855 destination blocks have their address taken. */
4856 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
4857 if ((e
->flags
& (EDGE_FALLTHRU
| EDGE_TRUE_VALUE
4858 | EDGE_FALSE_VALUE
))
4859 || !(e
->flags
& EDGE_ABNORMAL
))
4861 error ("wrong outgoing edge flags at end of bb %d",
4869 if (!gimple_call_builtin_p (stmt
, BUILT_IN_RETURN
))
4871 /* ... fallthru ... */
4873 if (!single_succ_p (bb
)
4874 || (single_succ_edge (bb
)->flags
4875 & (EDGE_FALLTHRU
| EDGE_ABNORMAL
4876 | EDGE_TRUE_VALUE
| EDGE_FALSE_VALUE
)))
4878 error ("wrong outgoing edge flags at end of bb %d", bb
->index
);
4881 if (single_succ (bb
) != EXIT_BLOCK_PTR
)
4883 error ("return edge does not point to exit in bb %d",
4895 n
= gimple_switch_num_labels (stmt
);
4897 /* Mark all the destination basic blocks. */
4898 for (i
= 0; i
< n
; ++i
)
4900 tree lab
= CASE_LABEL (gimple_switch_label (stmt
, i
));
4901 basic_block label_bb
= label_to_block (lab
);
4902 gcc_assert (!label_bb
->aux
|| label_bb
->aux
== (void *)1);
4903 label_bb
->aux
= (void *)1;
4906 /* Verify that the case labels are sorted. */
4907 prev
= gimple_switch_label (stmt
, 0);
4908 for (i
= 1; i
< n
; ++i
)
4910 tree c
= gimple_switch_label (stmt
, i
);
4913 error ("found default case not at the start of "
4919 && !tree_int_cst_lt (CASE_LOW (prev
), CASE_LOW (c
)))
4921 error ("case labels not sorted: ");
4922 print_generic_expr (stderr
, prev
, 0);
4923 fprintf (stderr
," is greater than ");
4924 print_generic_expr (stderr
, c
, 0);
4925 fprintf (stderr
," but comes before it.\n");
4930 /* VRP will remove the default case if it can prove it will
4931 never be executed. So do not verify there always exists
4932 a default case here. */
4934 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
4938 error ("extra outgoing edge %d->%d",
4939 bb
->index
, e
->dest
->index
);
4943 e
->dest
->aux
= (void *)2;
4944 if ((e
->flags
& (EDGE_FALLTHRU
| EDGE_ABNORMAL
4945 | EDGE_TRUE_VALUE
| EDGE_FALSE_VALUE
)))
4947 error ("wrong outgoing edge flags at end of bb %d",
4953 /* Check that we have all of them. */
4954 for (i
= 0; i
< n
; ++i
)
4956 tree lab
= CASE_LABEL (gimple_switch_label (stmt
, i
));
4957 basic_block label_bb
= label_to_block (lab
);
4959 if (label_bb
->aux
!= (void *)2)
4961 error ("missing edge %i->%i", bb
->index
, label_bb
->index
);
4966 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
4967 e
->dest
->aux
= (void *)0;
4971 case GIMPLE_EH_DISPATCH
:
4972 err
|= verify_eh_dispatch_edge (stmt
);
4980 if (dom_info_state (CDI_DOMINATORS
) >= DOM_NO_FAST_QUERY
)
4981 verify_dominators (CDI_DOMINATORS
);
4987 /* Updates phi nodes after creating a forwarder block joined
4988 by edge FALLTHRU. */
4991 gimple_make_forwarder_block (edge fallthru
)
4995 basic_block dummy
, bb
;
4997 gimple_stmt_iterator gsi
;
4999 dummy
= fallthru
->src
;
5000 bb
= fallthru
->dest
;
5002 if (single_pred_p (bb
))
5005 /* If we redirected a branch we must create new PHI nodes at the
5007 for (gsi
= gsi_start_phis (dummy
); !gsi_end_p (gsi
); gsi_next (&gsi
))
5009 gimple phi
, new_phi
;
5011 phi
= gsi_stmt (gsi
);
5012 var
= gimple_phi_result (phi
);
5013 new_phi
= create_phi_node (var
, bb
);
5014 SSA_NAME_DEF_STMT (var
) = new_phi
;
5015 gimple_phi_set_result (phi
, make_ssa_name (SSA_NAME_VAR (var
), phi
));
5016 add_phi_arg (new_phi
, gimple_phi_result (phi
), fallthru
,
5020 /* Add the arguments we have stored on edges. */
5021 FOR_EACH_EDGE (e
, ei
, bb
->preds
)
5026 flush_pending_stmts (e
);
5031 /* Return a non-special label in the head of basic block BLOCK.
5032 Create one if it doesn't exist. */
5035 gimple_block_label (basic_block bb
)
5037 gimple_stmt_iterator i
, s
= gsi_start_bb (bb
);
5042 for (i
= s
; !gsi_end_p (i
); first
= false, gsi_next (&i
))
5044 stmt
= gsi_stmt (i
);
5045 if (gimple_code (stmt
) != GIMPLE_LABEL
)
5047 label
= gimple_label_label (stmt
);
5048 if (!DECL_NONLOCAL (label
))
5051 gsi_move_before (&i
, &s
);
5056 label
= create_artificial_label (UNKNOWN_LOCATION
);
5057 stmt
= gimple_build_label (label
);
5058 gsi_insert_before (&s
, stmt
, GSI_NEW_STMT
);
5063 /* Attempt to perform edge redirection by replacing a possibly complex
5064 jump instruction by a goto or by removing the jump completely.
5065 This can apply only if all edges now point to the same block. The
5066 parameters and return values are equivalent to
5067 redirect_edge_and_branch. */
5070 gimple_try_redirect_by_replacing_jump (edge e
, basic_block target
)
5072 basic_block src
= e
->src
;
5073 gimple_stmt_iterator i
;
5076 /* We can replace or remove a complex jump only when we have exactly
5078 if (EDGE_COUNT (src
->succs
) != 2
5079 /* Verify that all targets will be TARGET. Specifically, the
5080 edge that is not E must also go to TARGET. */
5081 || EDGE_SUCC (src
, EDGE_SUCC (src
, 0) == e
)->dest
!= target
)
5084 i
= gsi_last_bb (src
);
5088 stmt
= gsi_stmt (i
);
5090 if (gimple_code (stmt
) == GIMPLE_COND
|| gimple_code (stmt
) == GIMPLE_SWITCH
)
5092 gsi_remove (&i
, true);
5093 e
= ssa_redirect_edge (e
, target
);
5094 e
->flags
= EDGE_FALLTHRU
;
5102 /* Redirect E to DEST. Return NULL on failure. Otherwise, return the
5103 edge representing the redirected branch. */
5106 gimple_redirect_edge_and_branch (edge e
, basic_block dest
)
5108 basic_block bb
= e
->src
;
5109 gimple_stmt_iterator gsi
;
5113 if (e
->flags
& EDGE_ABNORMAL
)
5116 if (e
->dest
== dest
)
5119 if (e
->flags
& EDGE_EH
)
5120 return redirect_eh_edge (e
, dest
);
5122 if (e
->src
!= ENTRY_BLOCK_PTR
)
5124 ret
= gimple_try_redirect_by_replacing_jump (e
, dest
);
5129 gsi
= gsi_last_bb (bb
);
5130 stmt
= gsi_end_p (gsi
) ? NULL
: gsi_stmt (gsi
);
5132 switch (stmt
? gimple_code (stmt
) : GIMPLE_ERROR_MARK
)
5135 /* For COND_EXPR, we only need to redirect the edge. */
5139 /* No non-abnormal edges should lead from a non-simple goto, and
5140 simple ones should be represented implicitly. */
5145 tree label
= gimple_block_label (dest
);
5146 tree cases
= get_cases_for_edge (e
, stmt
);
5148 /* If we have a list of cases associated with E, then use it
5149 as it's a lot faster than walking the entire case vector. */
5152 edge e2
= find_edge (e
->src
, dest
);
5159 CASE_LABEL (cases
) = label
;
5160 cases
= CASE_CHAIN (cases
);
5163 /* If there was already an edge in the CFG, then we need
5164 to move all the cases associated with E to E2. */
5167 tree cases2
= get_cases_for_edge (e2
, stmt
);
5169 CASE_CHAIN (last
) = CASE_CHAIN (cases2
);
5170 CASE_CHAIN (cases2
) = first
;
5172 bitmap_set_bit (touched_switch_bbs
, gimple_bb (stmt
)->index
);
5176 size_t i
, n
= gimple_switch_num_labels (stmt
);
5178 for (i
= 0; i
< n
; i
++)
5180 tree elt
= gimple_switch_label (stmt
, i
);
5181 if (label_to_block (CASE_LABEL (elt
)) == e
->dest
)
5182 CASE_LABEL (elt
) = label
;
5190 int i
, n
= gimple_asm_nlabels (stmt
);
5193 for (i
= 0; i
< n
; ++i
)
5195 tree cons
= gimple_asm_label_op (stmt
, i
);
5196 if (label_to_block (TREE_VALUE (cons
)) == e
->dest
)
5199 label
= gimple_block_label (dest
);
5200 TREE_VALUE (cons
) = label
;
5204 /* If we didn't find any label matching the former edge in the
5205 asm labels, we must be redirecting the fallthrough
5207 gcc_assert (label
|| (e
->flags
& EDGE_FALLTHRU
));
5212 gsi_remove (&gsi
, true);
5213 e
->flags
|= EDGE_FALLTHRU
;
5216 case GIMPLE_OMP_RETURN
:
5217 case GIMPLE_OMP_CONTINUE
:
5218 case GIMPLE_OMP_SECTIONS_SWITCH
:
5219 case GIMPLE_OMP_FOR
:
5220 /* The edges from OMP constructs can be simply redirected. */
5223 case GIMPLE_EH_DISPATCH
:
5224 if (!(e
->flags
& EDGE_FALLTHRU
))
5225 redirect_eh_dispatch_edge (stmt
, e
, dest
);
5228 case GIMPLE_TRANSACTION
:
5229 /* The ABORT edge has a stored label associated with it, otherwise
5230 the edges are simply redirectable. */
5232 gimple_transaction_set_label (stmt
, gimple_block_label (dest
));
5236 /* Otherwise it must be a fallthru edge, and we don't need to
5237 do anything besides redirecting it. */
5238 gcc_assert (e
->flags
& EDGE_FALLTHRU
);
5242 /* Update/insert PHI nodes as necessary. */
5244 /* Now update the edges in the CFG. */
5245 e
= ssa_redirect_edge (e
, dest
);
5250 /* Returns true if it is possible to remove edge E by redirecting
5251 it to the destination of the other edge from E->src. */
5254 gimple_can_remove_branch_p (const_edge e
)
5256 if (e
->flags
& (EDGE_ABNORMAL
| EDGE_EH
))
5262 /* Simple wrapper, as we can always redirect fallthru edges. */
5265 gimple_redirect_edge_and_branch_force (edge e
, basic_block dest
)
5267 e
= gimple_redirect_edge_and_branch (e
, dest
);
5274 /* Splits basic block BB after statement STMT (but at least after the
5275 labels). If STMT is NULL, BB is split just after the labels. */
5278 gimple_split_block (basic_block bb
, void *stmt
)
5280 gimple_stmt_iterator gsi
;
5281 gimple_stmt_iterator gsi_tgt
;
5288 new_bb
= create_empty_bb (bb
);
5290 /* Redirect the outgoing edges. */
5291 new_bb
->succs
= bb
->succs
;
5293 FOR_EACH_EDGE (e
, ei
, new_bb
->succs
)
5296 if (stmt
&& gimple_code ((gimple
) stmt
) == GIMPLE_LABEL
)
5299 /* Move everything from GSI to the new basic block. */
5300 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
5302 act
= gsi_stmt (gsi
);
5303 if (gimple_code (act
) == GIMPLE_LABEL
)
5316 if (gsi_end_p (gsi
))
5319 /* Split the statement list - avoid re-creating new containers as this
5320 brings ugly quadratic memory consumption in the inliner.
5321 (We are still quadratic since we need to update stmt BB pointers,
5323 gsi_split_seq_before (&gsi
, &list
);
5324 set_bb_seq (new_bb
, list
);
5325 for (gsi_tgt
= gsi_start (list
);
5326 !gsi_end_p (gsi_tgt
); gsi_next (&gsi_tgt
))
5327 gimple_set_bb (gsi_stmt (gsi_tgt
), new_bb
);
5333 /* Moves basic block BB after block AFTER. */
5336 gimple_move_block_after (basic_block bb
, basic_block after
)
5338 if (bb
->prev_bb
== after
)
5342 link_block (bb
, after
);
5348 /* Return true if basic_block can be duplicated. */
5351 gimple_can_duplicate_bb_p (const_basic_block bb ATTRIBUTE_UNUSED
)
5356 /* Create a duplicate of the basic block BB. NOTE: This does not
5357 preserve SSA form. */
5360 gimple_duplicate_bb (basic_block bb
)
5363 gimple_stmt_iterator gsi
, gsi_tgt
;
5364 gimple_seq phis
= phi_nodes (bb
);
5365 gimple phi
, stmt
, copy
;
5367 new_bb
= create_empty_bb (EXIT_BLOCK_PTR
->prev_bb
);
5369 /* Copy the PHI nodes. We ignore PHI node arguments here because
5370 the incoming edges have not been setup yet. */
5371 for (gsi
= gsi_start (phis
); !gsi_end_p (gsi
); gsi_next (&gsi
))
5373 phi
= gsi_stmt (gsi
);
5374 copy
= create_phi_node (gimple_phi_result (phi
), new_bb
);
5375 create_new_def_for (gimple_phi_result (copy
), copy
,
5376 gimple_phi_result_ptr (copy
));
5379 gsi_tgt
= gsi_start_bb (new_bb
);
5380 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
5382 def_operand_p def_p
;
5383 ssa_op_iter op_iter
;
5386 stmt
= gsi_stmt (gsi
);
5387 if (gimple_code (stmt
) == GIMPLE_LABEL
)
5390 /* Don't duplicate label debug stmts. */
5391 if (gimple_debug_bind_p (stmt
)
5392 && TREE_CODE (gimple_debug_bind_get_var (stmt
))
5396 /* Create a new copy of STMT and duplicate STMT's virtual
5398 copy
= gimple_copy (stmt
);
5399 gsi_insert_after (&gsi_tgt
, copy
, GSI_NEW_STMT
);
5401 maybe_duplicate_eh_stmt (copy
, stmt
);
5402 gimple_duplicate_stmt_histograms (cfun
, copy
, cfun
, stmt
);
5404 /* When copying around a stmt writing into a local non-user
5405 aggregate, make sure it won't share stack slot with other
5407 lhs
= gimple_get_lhs (stmt
);
5408 if (lhs
&& TREE_CODE (lhs
) != SSA_NAME
)
5410 tree base
= get_base_address (lhs
);
5412 && (TREE_CODE (base
) == VAR_DECL
5413 || TREE_CODE (base
) == RESULT_DECL
)
5414 && DECL_IGNORED_P (base
)
5415 && !TREE_STATIC (base
)
5416 && !DECL_EXTERNAL (base
)
5417 && (TREE_CODE (base
) != VAR_DECL
5418 || !DECL_HAS_VALUE_EXPR_P (base
)))
5419 DECL_NONSHAREABLE (base
) = 1;
5422 /* Create new names for all the definitions created by COPY and
5423 add replacement mappings for each new name. */
5424 FOR_EACH_SSA_DEF_OPERAND (def_p
, copy
, op_iter
, SSA_OP_ALL_DEFS
)
5425 create_new_def_for (DEF_FROM_PTR (def_p
), copy
, def_p
);
5431 /* Adds phi node arguments for edge E_COPY after basic block duplication. */
5434 add_phi_args_after_copy_edge (edge e_copy
)
5436 basic_block bb
, bb_copy
= e_copy
->src
, dest
;
5439 gimple phi
, phi_copy
;
5441 gimple_stmt_iterator psi
, psi_copy
;
5443 if (gimple_seq_empty_p (phi_nodes (e_copy
->dest
)))
5446 bb
= bb_copy
->flags
& BB_DUPLICATED
? get_bb_original (bb_copy
) : bb_copy
;
5448 if (e_copy
->dest
->flags
& BB_DUPLICATED
)
5449 dest
= get_bb_original (e_copy
->dest
);
5451 dest
= e_copy
->dest
;
5453 e
= find_edge (bb
, dest
);
5456 /* During loop unrolling the target of the latch edge is copied.
5457 In this case we are not looking for edge to dest, but to
5458 duplicated block whose original was dest. */
5459 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
5461 if ((e
->dest
->flags
& BB_DUPLICATED
)
5462 && get_bb_original (e
->dest
) == dest
)
5466 gcc_assert (e
!= NULL
);
5469 for (psi
= gsi_start_phis (e
->dest
),
5470 psi_copy
= gsi_start_phis (e_copy
->dest
);
5472 gsi_next (&psi
), gsi_next (&psi_copy
))
5474 phi
= gsi_stmt (psi
);
5475 phi_copy
= gsi_stmt (psi_copy
);
5476 def
= PHI_ARG_DEF_FROM_EDGE (phi
, e
);
5477 add_phi_arg (phi_copy
, def
, e_copy
,
5478 gimple_phi_arg_location_from_edge (phi
, e
));
5483 /* Basic block BB_COPY was created by code duplication. Add phi node
5484 arguments for edges going out of BB_COPY. The blocks that were
5485 duplicated have BB_DUPLICATED set. */
5488 add_phi_args_after_copy_bb (basic_block bb_copy
)
5493 FOR_EACH_EDGE (e_copy
, ei
, bb_copy
->succs
)
5495 add_phi_args_after_copy_edge (e_copy
);
5499 /* Blocks in REGION_COPY array of length N_REGION were created by
5500 duplication of basic blocks. Add phi node arguments for edges
5501 going from these blocks. If E_COPY is not NULL, also add
5502 phi node arguments for its destination.*/
5505 add_phi_args_after_copy (basic_block
*region_copy
, unsigned n_region
,
5510 for (i
= 0; i
< n_region
; i
++)
5511 region_copy
[i
]->flags
|= BB_DUPLICATED
;
5513 for (i
= 0; i
< n_region
; i
++)
5514 add_phi_args_after_copy_bb (region_copy
[i
]);
5516 add_phi_args_after_copy_edge (e_copy
);
5518 for (i
= 0; i
< n_region
; i
++)
5519 region_copy
[i
]->flags
&= ~BB_DUPLICATED
;
5522 /* Duplicates a REGION (set of N_REGION basic blocks) with just a single
5523 important exit edge EXIT. By important we mean that no SSA name defined
5524 inside region is live over the other exit edges of the region. All entry
5525 edges to the region must go to ENTRY->dest. The edge ENTRY is redirected
5526 to the duplicate of the region. SSA form, dominance and loop information
5527 is updated. The new basic blocks are stored to REGION_COPY in the same
5528 order as they had in REGION, provided that REGION_COPY is not NULL.
5529 The function returns false if it is unable to copy the region,
5533 gimple_duplicate_sese_region (edge entry
, edge exit
,
5534 basic_block
*region
, unsigned n_region
,
5535 basic_block
*region_copy
)
5538 bool free_region_copy
= false, copying_header
= false;
5539 struct loop
*loop
= entry
->dest
->loop_father
;
5541 VEC (basic_block
, heap
) *doms
;
5543 int total_freq
= 0, entry_freq
= 0;
5544 gcov_type total_count
= 0, entry_count
= 0;
5546 if (!can_copy_bbs_p (region
, n_region
))
5549 /* Some sanity checking. Note that we do not check for all possible
5550 missuses of the functions. I.e. if you ask to copy something weird,
5551 it will work, but the state of structures probably will not be
5553 for (i
= 0; i
< n_region
; i
++)
5555 /* We do not handle subloops, i.e. all the blocks must belong to the
5557 if (region
[i
]->loop_father
!= loop
)
5560 if (region
[i
] != entry
->dest
5561 && region
[i
] == loop
->header
)
5565 set_loop_copy (loop
, loop
);
5567 /* In case the function is used for loop header copying (which is the primary
5568 use), ensure that EXIT and its copy will be new latch and entry edges. */
5569 if (loop
->header
== entry
->dest
)
5571 copying_header
= true;
5572 set_loop_copy (loop
, loop_outer (loop
));
5574 if (!dominated_by_p (CDI_DOMINATORS
, loop
->latch
, exit
->src
))
5577 for (i
= 0; i
< n_region
; i
++)
5578 if (region
[i
] != exit
->src
5579 && dominated_by_p (CDI_DOMINATORS
, region
[i
], exit
->src
))
5585 region_copy
= XNEWVEC (basic_block
, n_region
);
5586 free_region_copy
= true;
5589 gcc_assert (!need_ssa_update_p (cfun
));
5591 /* Record blocks outside the region that are dominated by something
5594 initialize_original_copy_tables ();
5596 doms
= get_dominated_by_region (CDI_DOMINATORS
, region
, n_region
);
5598 if (entry
->dest
->count
)
5600 total_count
= entry
->dest
->count
;
5601 entry_count
= entry
->count
;
5602 /* Fix up corner cases, to avoid division by zero or creation of negative
5604 if (entry_count
> total_count
)
5605 entry_count
= total_count
;
5609 total_freq
= entry
->dest
->frequency
;
5610 entry_freq
= EDGE_FREQUENCY (entry
);
5611 /* Fix up corner cases, to avoid division by zero or creation of negative
5613 if (total_freq
== 0)
5615 else if (entry_freq
> total_freq
)
5616 entry_freq
= total_freq
;
5619 copy_bbs (region
, n_region
, region_copy
, &exit
, 1, &exit_copy
, loop
,
5620 split_edge_bb_loc (entry
));
5623 scale_bbs_frequencies_gcov_type (region
, n_region
,
5624 total_count
- entry_count
,
5626 scale_bbs_frequencies_gcov_type (region_copy
, n_region
, entry_count
,
5631 scale_bbs_frequencies_int (region
, n_region
, total_freq
- entry_freq
,
5633 scale_bbs_frequencies_int (region_copy
, n_region
, entry_freq
, total_freq
);
5638 loop
->header
= exit
->dest
;
5639 loop
->latch
= exit
->src
;
5642 /* Redirect the entry and add the phi node arguments. */
5643 redirected
= redirect_edge_and_branch (entry
, get_bb_copy (entry
->dest
));
5644 gcc_assert (redirected
!= NULL
);
5645 flush_pending_stmts (entry
);
5647 /* Concerning updating of dominators: We must recount dominators
5648 for entry block and its copy. Anything that is outside of the
5649 region, but was dominated by something inside needs recounting as
5651 set_immediate_dominator (CDI_DOMINATORS
, entry
->dest
, entry
->src
);
5652 VEC_safe_push (basic_block
, heap
, doms
, get_bb_original (entry
->dest
));
5653 iterate_fix_dominators (CDI_DOMINATORS
, doms
, false);
5654 VEC_free (basic_block
, heap
, doms
);
5656 /* Add the other PHI node arguments. */
5657 add_phi_args_after_copy (region_copy
, n_region
, NULL
);
5659 /* Update the SSA web. */
5660 update_ssa (TODO_update_ssa
);
5662 if (free_region_copy
)
5665 free_original_copy_tables ();
5669 /* Checks if BB is part of the region defined by N_REGION BBS. */
5671 bb_part_of_region_p (basic_block bb
, basic_block
* bbs
, unsigned n_region
)
5675 for (n
= 0; n
< n_region
; n
++)
5683 /* Duplicates REGION consisting of N_REGION blocks. The new blocks
5684 are stored to REGION_COPY in the same order in that they appear
5685 in REGION, if REGION_COPY is not NULL. ENTRY is the entry to
5686 the region, EXIT an exit from it. The condition guarding EXIT
5687 is moved to ENTRY. Returns true if duplication succeeds, false
5713 gimple_duplicate_sese_tail (edge entry ATTRIBUTE_UNUSED
, edge exit ATTRIBUTE_UNUSED
,
5714 basic_block
*region ATTRIBUTE_UNUSED
, unsigned n_region ATTRIBUTE_UNUSED
,
5715 basic_block
*region_copy ATTRIBUTE_UNUSED
)
5718 bool free_region_copy
= false;
5719 struct loop
*loop
= exit
->dest
->loop_father
;
5720 struct loop
*orig_loop
= entry
->dest
->loop_father
;
5721 basic_block switch_bb
, entry_bb
, nentry_bb
;
5722 VEC (basic_block
, heap
) *doms
;
5723 int total_freq
= 0, exit_freq
= 0;
5724 gcov_type total_count
= 0, exit_count
= 0;
5725 edge exits
[2], nexits
[2], e
;
5726 gimple_stmt_iterator gsi
;
5729 basic_block exit_bb
;
5730 gimple_stmt_iterator psi
;
5733 struct loop
*target
, *aloop
, *cloop
;
5735 gcc_assert (EDGE_COUNT (exit
->src
->succs
) == 2);
5737 exits
[1] = EDGE_SUCC (exit
->src
, EDGE_SUCC (exit
->src
, 0) == exit
);
5739 if (!can_copy_bbs_p (region
, n_region
))
5742 initialize_original_copy_tables ();
5743 set_loop_copy (orig_loop
, loop
);
5746 for (aloop
= orig_loop
->inner
; aloop
; aloop
= aloop
->next
)
5748 if (bb_part_of_region_p (aloop
->header
, region
, n_region
))
5750 cloop
= duplicate_loop (aloop
, target
);
5751 duplicate_subloops (aloop
, cloop
);
5757 region_copy
= XNEWVEC (basic_block
, n_region
);
5758 free_region_copy
= true;
5761 gcc_assert (!need_ssa_update_p (cfun
));
5763 /* Record blocks outside the region that are dominated by something
5765 doms
= get_dominated_by_region (CDI_DOMINATORS
, region
, n_region
);
5767 if (exit
->src
->count
)
5769 total_count
= exit
->src
->count
;
5770 exit_count
= exit
->count
;
5771 /* Fix up corner cases, to avoid division by zero or creation of negative
5773 if (exit_count
> total_count
)
5774 exit_count
= total_count
;
5778 total_freq
= exit
->src
->frequency
;
5779 exit_freq
= EDGE_FREQUENCY (exit
);
5780 /* Fix up corner cases, to avoid division by zero or creation of negative
5782 if (total_freq
== 0)
5784 if (exit_freq
> total_freq
)
5785 exit_freq
= total_freq
;
5788 copy_bbs (region
, n_region
, region_copy
, exits
, 2, nexits
, orig_loop
,
5789 split_edge_bb_loc (exit
));
5792 scale_bbs_frequencies_gcov_type (region
, n_region
,
5793 total_count
- exit_count
,
5795 scale_bbs_frequencies_gcov_type (region_copy
, n_region
, exit_count
,
5800 scale_bbs_frequencies_int (region
, n_region
, total_freq
- exit_freq
,
5802 scale_bbs_frequencies_int (region_copy
, n_region
, exit_freq
, total_freq
);
5805 /* Create the switch block, and put the exit condition to it. */
5806 entry_bb
= entry
->dest
;
5807 nentry_bb
= get_bb_copy (entry_bb
);
5808 if (!last_stmt (entry
->src
)
5809 || !stmt_ends_bb_p (last_stmt (entry
->src
)))
5810 switch_bb
= entry
->src
;
5812 switch_bb
= split_edge (entry
);
5813 set_immediate_dominator (CDI_DOMINATORS
, nentry_bb
, switch_bb
);
5815 gsi
= gsi_last_bb (switch_bb
);
5816 cond_stmt
= last_stmt (exit
->src
);
5817 gcc_assert (gimple_code (cond_stmt
) == GIMPLE_COND
);
5818 cond_stmt
= gimple_copy (cond_stmt
);
5820 gsi_insert_after (&gsi
, cond_stmt
, GSI_NEW_STMT
);
5822 sorig
= single_succ_edge (switch_bb
);
5823 sorig
->flags
= exits
[1]->flags
;
5824 snew
= make_edge (switch_bb
, nentry_bb
, exits
[0]->flags
);
5826 /* Register the new edge from SWITCH_BB in loop exit lists. */
5827 rescan_loop_exit (snew
, true, false);
5829 /* Add the PHI node arguments. */
5830 add_phi_args_after_copy (region_copy
, n_region
, snew
);
5832 /* Get rid of now superfluous conditions and associated edges (and phi node
5834 exit_bb
= exit
->dest
;
5836 e
= redirect_edge_and_branch (exits
[0], exits
[1]->dest
);
5837 PENDING_STMT (e
) = NULL
;
5839 /* The latch of ORIG_LOOP was copied, and so was the backedge
5840 to the original header. We redirect this backedge to EXIT_BB. */
5841 for (i
= 0; i
< n_region
; i
++)
5842 if (get_bb_original (region_copy
[i
]) == orig_loop
->latch
)
5844 gcc_assert (single_succ_edge (region_copy
[i
]));
5845 e
= redirect_edge_and_branch (single_succ_edge (region_copy
[i
]), exit_bb
);
5846 PENDING_STMT (e
) = NULL
;
5847 for (psi
= gsi_start_phis (exit_bb
);
5851 phi
= gsi_stmt (psi
);
5852 def
= PHI_ARG_DEF (phi
, nexits
[0]->dest_idx
);
5853 add_phi_arg (phi
, def
, e
, gimple_phi_arg_location_from_edge (phi
, e
));
5856 e
= redirect_edge_and_branch (nexits
[1], nexits
[0]->dest
);
5857 PENDING_STMT (e
) = NULL
;
5859 /* Anything that is outside of the region, but was dominated by something
5860 inside needs to update dominance info. */
5861 iterate_fix_dominators (CDI_DOMINATORS
, doms
, false);
5862 VEC_free (basic_block
, heap
, doms
);
5863 /* Update the SSA web. */
5864 update_ssa (TODO_update_ssa
);
5866 if (free_region_copy
)
5869 free_original_copy_tables ();
5873 /* Add all the blocks dominated by ENTRY to the array BBS_P. Stop
5874 adding blocks when the dominator traversal reaches EXIT. This
5875 function silently assumes that ENTRY strictly dominates EXIT. */
5878 gather_blocks_in_sese_region (basic_block entry
, basic_block exit
,
5879 VEC(basic_block
,heap
) **bbs_p
)
5883 for (son
= first_dom_son (CDI_DOMINATORS
, entry
);
5885 son
= next_dom_son (CDI_DOMINATORS
, son
))
5887 VEC_safe_push (basic_block
, heap
, *bbs_p
, son
);
5889 gather_blocks_in_sese_region (son
, exit
, bbs_p
);
5893 /* Replaces *TP with a duplicate (belonging to function TO_CONTEXT).
5894 The duplicates are recorded in VARS_MAP. */
5897 replace_by_duplicate_decl (tree
*tp
, struct pointer_map_t
*vars_map
,
5900 tree t
= *tp
, new_t
;
5901 struct function
*f
= DECL_STRUCT_FUNCTION (to_context
);
5904 if (DECL_CONTEXT (t
) == to_context
)
5907 loc
= pointer_map_contains (vars_map
, t
);
5911 loc
= pointer_map_insert (vars_map
, t
);
5915 new_t
= copy_var_decl (t
, DECL_NAME (t
), TREE_TYPE (t
));
5916 add_local_decl (f
, new_t
);
5920 gcc_assert (TREE_CODE (t
) == CONST_DECL
);
5921 new_t
= copy_node (t
);
5923 DECL_CONTEXT (new_t
) = to_context
;
5928 new_t
= (tree
) *loc
;
5934 /* Creates an ssa name in TO_CONTEXT equivalent to NAME.
5935 VARS_MAP maps old ssa names and var_decls to the new ones. */
5938 replace_ssa_name (tree name
, struct pointer_map_t
*vars_map
,
5942 tree new_name
, decl
= SSA_NAME_VAR (name
);
5944 gcc_assert (is_gimple_reg (name
));
5946 loc
= pointer_map_contains (vars_map
, name
);
5950 replace_by_duplicate_decl (&decl
, vars_map
, to_context
);
5952 push_cfun (DECL_STRUCT_FUNCTION (to_context
));
5953 if (gimple_in_ssa_p (cfun
))
5954 add_referenced_var (decl
);
5956 new_name
= make_ssa_name (decl
, SSA_NAME_DEF_STMT (name
));
5957 if (SSA_NAME_IS_DEFAULT_DEF (name
))
5958 set_default_def (decl
, new_name
);
5961 loc
= pointer_map_insert (vars_map
, name
);
5965 new_name
= (tree
) *loc
;
5976 struct pointer_map_t
*vars_map
;
5977 htab_t new_label_map
;
5978 struct pointer_map_t
*eh_map
;
5982 /* Helper for move_block_to_fn. Set TREE_BLOCK in every expression
5983 contained in *TP if it has been ORIG_BLOCK previously and change the
5984 DECL_CONTEXT of every local variable referenced in *TP. */
5987 move_stmt_op (tree
*tp
, int *walk_subtrees
, void *data
)
5989 struct walk_stmt_info
*wi
= (struct walk_stmt_info
*) data
;
5990 struct move_stmt_d
*p
= (struct move_stmt_d
*) wi
->info
;
5994 /* We should never have TREE_BLOCK set on non-statements. */
5995 gcc_assert (!TREE_BLOCK (t
));
5997 else if (DECL_P (t
) || TREE_CODE (t
) == SSA_NAME
)
5999 if (TREE_CODE (t
) == SSA_NAME
)
6000 *tp
= replace_ssa_name (t
, p
->vars_map
, p
->to_context
);
6001 else if (TREE_CODE (t
) == LABEL_DECL
)
6003 if (p
->new_label_map
)
6005 struct tree_map in
, *out
;
6007 out
= (struct tree_map
*)
6008 htab_find_with_hash (p
->new_label_map
, &in
, DECL_UID (t
));
6013 DECL_CONTEXT (t
) = p
->to_context
;
6015 else if (p
->remap_decls_p
)
6017 /* Replace T with its duplicate. T should no longer appear in the
6018 parent function, so this looks wasteful; however, it may appear
6019 in referenced_vars, and more importantly, as virtual operands of
6020 statements, and in alias lists of other variables. It would be
6021 quite difficult to expunge it from all those places. ??? It might
6022 suffice to do this for addressable variables. */
6023 if ((TREE_CODE (t
) == VAR_DECL
6024 && !is_global_var (t
))
6025 || TREE_CODE (t
) == CONST_DECL
)
6026 replace_by_duplicate_decl (tp
, p
->vars_map
, p
->to_context
);
6029 && gimple_in_ssa_p (cfun
))
6031 push_cfun (DECL_STRUCT_FUNCTION (p
->to_context
));
6032 add_referenced_var (*tp
);
6038 else if (TYPE_P (t
))
6044 /* Helper for move_stmt_r. Given an EH region number for the source
6045 function, map that to the duplicate EH regio number in the dest. */
6048 move_stmt_eh_region_nr (int old_nr
, struct move_stmt_d
*p
)
6050 eh_region old_r
, new_r
;
6053 old_r
= get_eh_region_from_number (old_nr
);
6054 slot
= pointer_map_contains (p
->eh_map
, old_r
);
6055 new_r
= (eh_region
) *slot
;
6057 return new_r
->index
;
6060 /* Similar, but operate on INTEGER_CSTs. */
6063 move_stmt_eh_region_tree_nr (tree old_t_nr
, struct move_stmt_d
*p
)
6067 old_nr
= tree_low_cst (old_t_nr
, 0);
6068 new_nr
= move_stmt_eh_region_nr (old_nr
, p
);
6070 return build_int_cst (integer_type_node
, new_nr
);
6073 /* Like move_stmt_op, but for gimple statements.
6075 Helper for move_block_to_fn. Set GIMPLE_BLOCK in every expression
6076 contained in the current statement in *GSI_P and change the
6077 DECL_CONTEXT of every local variable referenced in the current
6081 move_stmt_r (gimple_stmt_iterator
*gsi_p
, bool *handled_ops_p
,
6082 struct walk_stmt_info
*wi
)
6084 struct move_stmt_d
*p
= (struct move_stmt_d
*) wi
->info
;
6085 gimple stmt
= gsi_stmt (*gsi_p
);
6086 tree block
= gimple_block (stmt
);
6088 if (p
->orig_block
== NULL_TREE
6089 || block
== p
->orig_block
6090 || block
== NULL_TREE
)
6091 gimple_set_block (stmt
, p
->new_block
);
6092 #ifdef ENABLE_CHECKING
6093 else if (block
!= p
->new_block
)
6095 while (block
&& block
!= p
->orig_block
)
6096 block
= BLOCK_SUPERCONTEXT (block
);
6101 switch (gimple_code (stmt
))
6104 /* Remap the region numbers for __builtin_eh_{pointer,filter}. */
6106 tree r
, fndecl
= gimple_call_fndecl (stmt
);
6107 if (fndecl
&& DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
)
6108 switch (DECL_FUNCTION_CODE (fndecl
))
6110 case BUILT_IN_EH_COPY_VALUES
:
6111 r
= gimple_call_arg (stmt
, 1);
6112 r
= move_stmt_eh_region_tree_nr (r
, p
);
6113 gimple_call_set_arg (stmt
, 1, r
);
6116 case BUILT_IN_EH_POINTER
:
6117 case BUILT_IN_EH_FILTER
:
6118 r
= gimple_call_arg (stmt
, 0);
6119 r
= move_stmt_eh_region_tree_nr (r
, p
);
6120 gimple_call_set_arg (stmt
, 0, r
);
6131 int r
= gimple_resx_region (stmt
);
6132 r
= move_stmt_eh_region_nr (r
, p
);
6133 gimple_resx_set_region (stmt
, r
);
6137 case GIMPLE_EH_DISPATCH
:
6139 int r
= gimple_eh_dispatch_region (stmt
);
6140 r
= move_stmt_eh_region_nr (r
, p
);
6141 gimple_eh_dispatch_set_region (stmt
, r
);
6145 case GIMPLE_OMP_RETURN
:
6146 case GIMPLE_OMP_CONTINUE
:
6149 if (is_gimple_omp (stmt
))
6151 /* Do not remap variables inside OMP directives. Variables
6152 referenced in clauses and directive header belong to the
6153 parent function and should not be moved into the child
6155 bool save_remap_decls_p
= p
->remap_decls_p
;
6156 p
->remap_decls_p
= false;
6157 *handled_ops_p
= true;
6159 walk_gimple_seq_mod (gimple_omp_body_ptr (stmt
), move_stmt_r
,
6162 p
->remap_decls_p
= save_remap_decls_p
;
6170 /* Move basic block BB from function CFUN to function DEST_FN. The
6171 block is moved out of the original linked list and placed after
6172 block AFTER in the new list. Also, the block is removed from the
6173 original array of blocks and placed in DEST_FN's array of blocks.
6174 If UPDATE_EDGE_COUNT_P is true, the edge counts on both CFGs is
6175 updated to reflect the moved edges.
6177 The local variables are remapped to new instances, VARS_MAP is used
6178 to record the mapping. */
6181 move_block_to_fn (struct function
*dest_cfun
, basic_block bb
,
6182 basic_block after
, bool update_edge_count_p
,
6183 struct move_stmt_d
*d
)
6185 struct control_flow_graph
*cfg
;
6188 gimple_stmt_iterator si
;
6189 unsigned old_len
, new_len
;
6191 /* Remove BB from dominance structures. */
6192 delete_from_dominance_info (CDI_DOMINATORS
, bb
);
6194 remove_bb_from_loops (bb
);
6196 /* Link BB to the new linked list. */
6197 move_block_after (bb
, after
);
6199 /* Update the edge count in the corresponding flowgraphs. */
6200 if (update_edge_count_p
)
6201 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
6203 cfun
->cfg
->x_n_edges
--;
6204 dest_cfun
->cfg
->x_n_edges
++;
6207 /* Remove BB from the original basic block array. */
6208 VEC_replace (basic_block
, cfun
->cfg
->x_basic_block_info
, bb
->index
, NULL
);
6209 cfun
->cfg
->x_n_basic_blocks
--;
6211 /* Grow DEST_CFUN's basic block array if needed. */
6212 cfg
= dest_cfun
->cfg
;
6213 cfg
->x_n_basic_blocks
++;
6214 if (bb
->index
>= cfg
->x_last_basic_block
)
6215 cfg
->x_last_basic_block
= bb
->index
+ 1;
6217 old_len
= VEC_length (basic_block
, cfg
->x_basic_block_info
);
6218 if ((unsigned) cfg
->x_last_basic_block
>= old_len
)
6220 new_len
= cfg
->x_last_basic_block
+ (cfg
->x_last_basic_block
+ 3) / 4;
6221 VEC_safe_grow_cleared (basic_block
, gc
, cfg
->x_basic_block_info
,
6225 VEC_replace (basic_block
, cfg
->x_basic_block_info
,
6228 /* Remap the variables in phi nodes. */
6229 for (si
= gsi_start_phis (bb
); !gsi_end_p (si
); )
6231 gimple phi
= gsi_stmt (si
);
6233 tree op
= PHI_RESULT (phi
);
6236 if (!is_gimple_reg (op
))
6238 /* Remove the phi nodes for virtual operands (alias analysis will be
6239 run for the new function, anyway). */
6240 remove_phi_node (&si
, true);
6244 SET_PHI_RESULT (phi
,
6245 replace_ssa_name (op
, d
->vars_map
, dest_cfun
->decl
));
6246 FOR_EACH_PHI_ARG (use
, phi
, oi
, SSA_OP_USE
)
6248 op
= USE_FROM_PTR (use
);
6249 if (TREE_CODE (op
) == SSA_NAME
)
6250 SET_USE (use
, replace_ssa_name (op
, d
->vars_map
, dest_cfun
->decl
));
6256 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
6258 gimple stmt
= gsi_stmt (si
);
6259 struct walk_stmt_info wi
;
6261 memset (&wi
, 0, sizeof (wi
));
6263 walk_gimple_stmt (&si
, move_stmt_r
, move_stmt_op
, &wi
);
6265 if (gimple_code (stmt
) == GIMPLE_LABEL
)
6267 tree label
= gimple_label_label (stmt
);
6268 int uid
= LABEL_DECL_UID (label
);
6270 gcc_assert (uid
> -1);
6272 old_len
= VEC_length (basic_block
, cfg
->x_label_to_block_map
);
6273 if (old_len
<= (unsigned) uid
)
6275 new_len
= 3 * uid
/ 2 + 1;
6276 VEC_safe_grow_cleared (basic_block
, gc
,
6277 cfg
->x_label_to_block_map
, new_len
);
6280 VEC_replace (basic_block
, cfg
->x_label_to_block_map
, uid
, bb
);
6281 VEC_replace (basic_block
, cfun
->cfg
->x_label_to_block_map
, uid
, NULL
);
6283 gcc_assert (DECL_CONTEXT (label
) == dest_cfun
->decl
);
6285 if (uid
>= dest_cfun
->cfg
->last_label_uid
)
6286 dest_cfun
->cfg
->last_label_uid
= uid
+ 1;
6289 maybe_duplicate_eh_stmt_fn (dest_cfun
, stmt
, cfun
, stmt
, d
->eh_map
, 0);
6290 remove_stmt_from_eh_lp_fn (cfun
, stmt
);
6292 gimple_duplicate_stmt_histograms (dest_cfun
, stmt
, cfun
, stmt
);
6293 gimple_remove_stmt_histograms (cfun
, stmt
);
6295 /* We cannot leave any operands allocated from the operand caches of
6296 the current function. */
6297 free_stmt_operands (stmt
);
6298 push_cfun (dest_cfun
);
6303 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
6306 tree block
= e
->goto_block
;
6307 if (d
->orig_block
== NULL_TREE
6308 || block
== d
->orig_block
)
6309 e
->goto_block
= d
->new_block
;
6310 #ifdef ENABLE_CHECKING
6311 else if (block
!= d
->new_block
)
6313 while (block
&& block
!= d
->orig_block
)
6314 block
= BLOCK_SUPERCONTEXT (block
);
6321 /* Examine the statements in BB (which is in SRC_CFUN); find and return
6322 the outermost EH region. Use REGION as the incoming base EH region. */
6325 find_outermost_region_in_block (struct function
*src_cfun
,
6326 basic_block bb
, eh_region region
)
6328 gimple_stmt_iterator si
;
6330 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
6332 gimple stmt
= gsi_stmt (si
);
6333 eh_region stmt_region
;
6336 lp_nr
= lookup_stmt_eh_lp_fn (src_cfun
, stmt
);
6337 stmt_region
= get_eh_region_from_lp_number_fn (src_cfun
, lp_nr
);
6341 region
= stmt_region
;
6342 else if (stmt_region
!= region
)
6344 region
= eh_region_outermost (src_cfun
, stmt_region
, region
);
6345 gcc_assert (region
!= NULL
);
6354 new_label_mapper (tree decl
, void *data
)
6356 htab_t hash
= (htab_t
) data
;
6360 gcc_assert (TREE_CODE (decl
) == LABEL_DECL
);
6362 m
= XNEW (struct tree_map
);
6363 m
->hash
= DECL_UID (decl
);
6364 m
->base
.from
= decl
;
6365 m
->to
= create_artificial_label (UNKNOWN_LOCATION
);
6366 LABEL_DECL_UID (m
->to
) = LABEL_DECL_UID (decl
);
6367 if (LABEL_DECL_UID (m
->to
) >= cfun
->cfg
->last_label_uid
)
6368 cfun
->cfg
->last_label_uid
= LABEL_DECL_UID (m
->to
) + 1;
6370 slot
= htab_find_slot_with_hash (hash
, m
, m
->hash
, INSERT
);
6371 gcc_assert (*slot
== NULL
);
6378 /* Change DECL_CONTEXT of all BLOCK_VARS in block, including
6382 replace_block_vars_by_duplicates (tree block
, struct pointer_map_t
*vars_map
,
6387 for (tp
= &BLOCK_VARS (block
); *tp
; tp
= &DECL_CHAIN (*tp
))
6390 if (TREE_CODE (t
) != VAR_DECL
&& TREE_CODE (t
) != CONST_DECL
)
6392 replace_by_duplicate_decl (&t
, vars_map
, to_context
);
6395 if (TREE_CODE (*tp
) == VAR_DECL
&& DECL_HAS_VALUE_EXPR_P (*tp
))
6397 SET_DECL_VALUE_EXPR (t
, DECL_VALUE_EXPR (*tp
));
6398 DECL_HAS_VALUE_EXPR_P (t
) = 1;
6400 DECL_CHAIN (t
) = DECL_CHAIN (*tp
);
6405 for (block
= BLOCK_SUBBLOCKS (block
); block
; block
= BLOCK_CHAIN (block
))
6406 replace_block_vars_by_duplicates (block
, vars_map
, to_context
);
6409 /* Move a single-entry, single-exit region delimited by ENTRY_BB and
6410 EXIT_BB to function DEST_CFUN. The whole region is replaced by a
6411 single basic block in the original CFG and the new basic block is
6412 returned. DEST_CFUN must not have a CFG yet.
6414 Note that the region need not be a pure SESE region. Blocks inside
6415 the region may contain calls to abort/exit. The only restriction
6416 is that ENTRY_BB should be the only entry point and it must
6419 Change TREE_BLOCK of all statements in ORIG_BLOCK to the new
6420 functions outermost BLOCK, move all subblocks of ORIG_BLOCK
6421 to the new function.
6423 All local variables referenced in the region are assumed to be in
6424 the corresponding BLOCK_VARS and unexpanded variable lists
6425 associated with DEST_CFUN. */
6428 move_sese_region_to_fn (struct function
*dest_cfun
, basic_block entry_bb
,
6429 basic_block exit_bb
, tree orig_block
)
6431 VEC(basic_block
,heap
) *bbs
, *dom_bbs
;
6432 basic_block dom_entry
= get_immediate_dominator (CDI_DOMINATORS
, entry_bb
);
6433 basic_block after
, bb
, *entry_pred
, *exit_succ
, abb
;
6434 struct function
*saved_cfun
= cfun
;
6435 int *entry_flag
, *exit_flag
;
6436 unsigned *entry_prob
, *exit_prob
;
6437 unsigned i
, num_entry_edges
, num_exit_edges
;
6440 htab_t new_label_map
;
6441 struct pointer_map_t
*vars_map
, *eh_map
;
6442 struct loop
*loop
= entry_bb
->loop_father
;
6443 struct move_stmt_d d
;
6445 /* If ENTRY does not strictly dominate EXIT, this cannot be an SESE
6447 gcc_assert (entry_bb
!= exit_bb
6449 || dominated_by_p (CDI_DOMINATORS
, exit_bb
, entry_bb
)));
6451 /* Collect all the blocks in the region. Manually add ENTRY_BB
6452 because it won't be added by dfs_enumerate_from. */
6454 VEC_safe_push (basic_block
, heap
, bbs
, entry_bb
);
6455 gather_blocks_in_sese_region (entry_bb
, exit_bb
, &bbs
);
6457 /* The blocks that used to be dominated by something in BBS will now be
6458 dominated by the new block. */
6459 dom_bbs
= get_dominated_by_region (CDI_DOMINATORS
,
6460 VEC_address (basic_block
, bbs
),
6461 VEC_length (basic_block
, bbs
));
6463 /* Detach ENTRY_BB and EXIT_BB from CFUN->CFG. We need to remember
6464 the predecessor edges to ENTRY_BB and the successor edges to
6465 EXIT_BB so that we can re-attach them to the new basic block that
6466 will replace the region. */
6467 num_entry_edges
= EDGE_COUNT (entry_bb
->preds
);
6468 entry_pred
= (basic_block
*) xcalloc (num_entry_edges
, sizeof (basic_block
));
6469 entry_flag
= (int *) xcalloc (num_entry_edges
, sizeof (int));
6470 entry_prob
= XNEWVEC (unsigned, num_entry_edges
);
6472 for (ei
= ei_start (entry_bb
->preds
); (e
= ei_safe_edge (ei
)) != NULL
;)
6474 entry_prob
[i
] = e
->probability
;
6475 entry_flag
[i
] = e
->flags
;
6476 entry_pred
[i
++] = e
->src
;
6482 num_exit_edges
= EDGE_COUNT (exit_bb
->succs
);
6483 exit_succ
= (basic_block
*) xcalloc (num_exit_edges
,
6484 sizeof (basic_block
));
6485 exit_flag
= (int *) xcalloc (num_exit_edges
, sizeof (int));
6486 exit_prob
= XNEWVEC (unsigned, num_exit_edges
);
6488 for (ei
= ei_start (exit_bb
->succs
); (e
= ei_safe_edge (ei
)) != NULL
;)
6490 exit_prob
[i
] = e
->probability
;
6491 exit_flag
[i
] = e
->flags
;
6492 exit_succ
[i
++] = e
->dest
;
6504 /* Switch context to the child function to initialize DEST_FN's CFG. */
6505 gcc_assert (dest_cfun
->cfg
== NULL
);
6506 push_cfun (dest_cfun
);
6508 init_empty_tree_cfg ();
6510 /* Initialize EH information for the new function. */
6512 new_label_map
= NULL
;
6515 eh_region region
= NULL
;
6517 FOR_EACH_VEC_ELT (basic_block
, bbs
, i
, bb
)
6518 region
= find_outermost_region_in_block (saved_cfun
, bb
, region
);
6520 init_eh_for_function ();
6523 new_label_map
= htab_create (17, tree_map_hash
, tree_map_eq
, free
);
6524 eh_map
= duplicate_eh_regions (saved_cfun
, region
, 0,
6525 new_label_mapper
, new_label_map
);
6531 /* Move blocks from BBS into DEST_CFUN. */
6532 gcc_assert (VEC_length (basic_block
, bbs
) >= 2);
6533 after
= dest_cfun
->cfg
->x_entry_block_ptr
;
6534 vars_map
= pointer_map_create ();
6536 memset (&d
, 0, sizeof (d
));
6537 d
.orig_block
= orig_block
;
6538 d
.new_block
= DECL_INITIAL (dest_cfun
->decl
);
6539 d
.from_context
= cfun
->decl
;
6540 d
.to_context
= dest_cfun
->decl
;
6541 d
.vars_map
= vars_map
;
6542 d
.new_label_map
= new_label_map
;
6544 d
.remap_decls_p
= true;
6546 FOR_EACH_VEC_ELT (basic_block
, bbs
, i
, bb
)
6548 /* No need to update edge counts on the last block. It has
6549 already been updated earlier when we detached the region from
6550 the original CFG. */
6551 move_block_to_fn (dest_cfun
, bb
, after
, bb
!= exit_bb
, &d
);
6555 /* Rewire BLOCK_SUBBLOCKS of orig_block. */
6559 gcc_assert (BLOCK_SUBBLOCKS (DECL_INITIAL (dest_cfun
->decl
))
6561 BLOCK_SUBBLOCKS (DECL_INITIAL (dest_cfun
->decl
))
6562 = BLOCK_SUBBLOCKS (orig_block
);
6563 for (block
= BLOCK_SUBBLOCKS (orig_block
);
6564 block
; block
= BLOCK_CHAIN (block
))
6565 BLOCK_SUPERCONTEXT (block
) = DECL_INITIAL (dest_cfun
->decl
);
6566 BLOCK_SUBBLOCKS (orig_block
) = NULL_TREE
;
6569 replace_block_vars_by_duplicates (DECL_INITIAL (dest_cfun
->decl
),
6570 vars_map
, dest_cfun
->decl
);
6573 htab_delete (new_label_map
);
6575 pointer_map_destroy (eh_map
);
6576 pointer_map_destroy (vars_map
);
6578 /* Rewire the entry and exit blocks. The successor to the entry
6579 block turns into the successor of DEST_FN's ENTRY_BLOCK_PTR in
6580 the child function. Similarly, the predecessor of DEST_FN's
6581 EXIT_BLOCK_PTR turns into the predecessor of EXIT_BLOCK_PTR. We
6582 need to switch CFUN between DEST_CFUN and SAVED_CFUN so that the
6583 various CFG manipulation function get to the right CFG.
6585 FIXME, this is silly. The CFG ought to become a parameter to
6587 push_cfun (dest_cfun
);
6588 make_edge (ENTRY_BLOCK_PTR
, entry_bb
, EDGE_FALLTHRU
);
6590 make_edge (exit_bb
, EXIT_BLOCK_PTR
, 0);
6593 /* Back in the original function, the SESE region has disappeared,
6594 create a new basic block in its place. */
6595 bb
= create_empty_bb (entry_pred
[0]);
6597 add_bb_to_loop (bb
, loop
);
6598 for (i
= 0; i
< num_entry_edges
; i
++)
6600 e
= make_edge (entry_pred
[i
], bb
, entry_flag
[i
]);
6601 e
->probability
= entry_prob
[i
];
6604 for (i
= 0; i
< num_exit_edges
; i
++)
6606 e
= make_edge (bb
, exit_succ
[i
], exit_flag
[i
]);
6607 e
->probability
= exit_prob
[i
];
6610 set_immediate_dominator (CDI_DOMINATORS
, bb
, dom_entry
);
6611 FOR_EACH_VEC_ELT (basic_block
, dom_bbs
, i
, abb
)
6612 set_immediate_dominator (CDI_DOMINATORS
, abb
, bb
);
6613 VEC_free (basic_block
, heap
, dom_bbs
);
6624 VEC_free (basic_block
, heap
, bbs
);
6630 /* Dump FUNCTION_DECL FN to file FILE using FLAGS (see TDF_* in tree-pass.h)
6634 dump_function_to_file (tree fn
, FILE *file
, int flags
)
6637 struct function
*dsf
;
6638 bool ignore_topmost_bind
= false, any_var
= false;
6641 bool tmclone
= TREE_CODE (fn
) == FUNCTION_DECL
&& decl_is_tm_clone (fn
);
6643 fprintf (file
, "%s %s(", lang_hooks
.decl_printable_name (fn
, 2),
6644 tmclone
? "[tm-clone] " : "");
6646 arg
= DECL_ARGUMENTS (fn
);
6649 print_generic_expr (file
, TREE_TYPE (arg
), dump_flags
);
6650 fprintf (file
, " ");
6651 print_generic_expr (file
, arg
, dump_flags
);
6652 if (flags
& TDF_VERBOSE
)
6653 print_node (file
, "", arg
, 4);
6654 if (DECL_CHAIN (arg
))
6655 fprintf (file
, ", ");
6656 arg
= DECL_CHAIN (arg
);
6658 fprintf (file
, ")\n");
6660 if (flags
& TDF_VERBOSE
)
6661 print_node (file
, "", fn
, 2);
6663 dsf
= DECL_STRUCT_FUNCTION (fn
);
6664 if (dsf
&& (flags
& TDF_EH
))
6665 dump_eh_tree (file
, dsf
);
6667 if (flags
& TDF_RAW
&& !gimple_has_body_p (fn
))
6669 dump_node (fn
, TDF_SLIM
| flags
, file
);
6673 /* Switch CFUN to point to FN. */
6674 push_cfun (DECL_STRUCT_FUNCTION (fn
));
6676 /* When GIMPLE is lowered, the variables are no longer available in
6677 BIND_EXPRs, so display them separately. */
6678 if (cfun
&& cfun
->decl
== fn
&& !VEC_empty (tree
, cfun
->local_decls
))
6681 ignore_topmost_bind
= true;
6683 fprintf (file
, "{\n");
6684 FOR_EACH_LOCAL_DECL (cfun
, ix
, var
)
6686 print_generic_decl (file
, var
, flags
);
6687 if (flags
& TDF_VERBOSE
)
6688 print_node (file
, "", var
, 4);
6689 fprintf (file
, "\n");
6695 if (cfun
&& cfun
->decl
== fn
&& cfun
->cfg
&& basic_block_info
)
6697 /* If the CFG has been built, emit a CFG-based dump. */
6698 check_bb_profile (ENTRY_BLOCK_PTR
, file
);
6699 if (!ignore_topmost_bind
)
6700 fprintf (file
, "{\n");
6702 if (any_var
&& n_basic_blocks
)
6703 fprintf (file
, "\n");
6706 gimple_dump_bb (bb
, file
, 2, flags
);
6708 fprintf (file
, "}\n");
6709 check_bb_profile (EXIT_BLOCK_PTR
, file
);
6711 else if (DECL_SAVED_TREE (fn
) == NULL
)
6713 /* The function is now in GIMPLE form but the CFG has not been
6714 built yet. Emit the single sequence of GIMPLE statements
6715 that make up its body. */
6716 gimple_seq body
= gimple_body (fn
);
6718 if (gimple_seq_first_stmt (body
)
6719 && gimple_seq_first_stmt (body
) == gimple_seq_last_stmt (body
)
6720 && gimple_code (gimple_seq_first_stmt (body
)) == GIMPLE_BIND
)
6721 print_gimple_seq (file
, body
, 0, flags
);
6724 if (!ignore_topmost_bind
)
6725 fprintf (file
, "{\n");
6728 fprintf (file
, "\n");
6730 print_gimple_seq (file
, body
, 2, flags
);
6731 fprintf (file
, "}\n");
6738 /* Make a tree based dump. */
6739 chain
= DECL_SAVED_TREE (fn
);
6741 if (chain
&& TREE_CODE (chain
) == BIND_EXPR
)
6743 if (ignore_topmost_bind
)
6745 chain
= BIND_EXPR_BODY (chain
);
6753 if (!ignore_topmost_bind
)
6754 fprintf (file
, "{\n");
6759 fprintf (file
, "\n");
6761 print_generic_stmt_indented (file
, chain
, flags
, indent
);
6762 if (ignore_topmost_bind
)
6763 fprintf (file
, "}\n");
6766 if (flags
& TDF_ENUMERATE_LOCALS
)
6767 dump_enumerated_decls (file
, flags
);
6768 fprintf (file
, "\n\n");
6775 /* Dump FUNCTION_DECL FN to stderr using FLAGS (see TDF_* in tree.h) */
6778 debug_function (tree fn
, int flags
)
6780 dump_function_to_file (fn
, stderr
, flags
);
6784 /* Print on FILE the indexes for the predecessors of basic_block BB. */
6787 print_pred_bbs (FILE *file
, basic_block bb
)
6792 FOR_EACH_EDGE (e
, ei
, bb
->preds
)
6793 fprintf (file
, "bb_%d ", e
->src
->index
);
6797 /* Print on FILE the indexes for the successors of basic_block BB. */
6800 print_succ_bbs (FILE *file
, basic_block bb
)
6805 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
6806 fprintf (file
, "bb_%d ", e
->dest
->index
);
6809 /* Print to FILE the basic block BB following the VERBOSITY level. */
6812 print_loops_bb (FILE *file
, basic_block bb
, int indent
, int verbosity
)
6814 char *s_indent
= (char *) alloca ((size_t) indent
+ 1);
6815 memset ((void *) s_indent
, ' ', (size_t) indent
);
6816 s_indent
[indent
] = '\0';
6818 /* Print basic_block's header. */
6821 fprintf (file
, "%s bb_%d (preds = {", s_indent
, bb
->index
);
6822 print_pred_bbs (file
, bb
);
6823 fprintf (file
, "}, succs = {");
6824 print_succ_bbs (file
, bb
);
6825 fprintf (file
, "})\n");
6828 /* Print basic_block's body. */
6831 fprintf (file
, "%s {\n", s_indent
);
6832 gimple_dump_bb (bb
, file
, indent
+ 4, TDF_VOPS
|TDF_MEMSYMS
);
6833 fprintf (file
, "%s }\n", s_indent
);
6837 static void print_loop_and_siblings (FILE *, struct loop
*, int, int);
6839 /* Pretty print LOOP on FILE, indented INDENT spaces. Following
6840 VERBOSITY level this outputs the contents of the loop, or just its
6844 print_loop (FILE *file
, struct loop
*loop
, int indent
, int verbosity
)
6852 s_indent
= (char *) alloca ((size_t) indent
+ 1);
6853 memset ((void *) s_indent
, ' ', (size_t) indent
);
6854 s_indent
[indent
] = '\0';
6856 /* Print loop's header. */
6857 fprintf (file
, "%sloop_%d (header = %d, latch = %d", s_indent
,
6858 loop
->num
, loop
->header
->index
, loop
->latch
->index
);
6859 fprintf (file
, ", niter = ");
6860 print_generic_expr (file
, loop
->nb_iterations
, 0);
6862 if (loop
->any_upper_bound
)
6864 fprintf (file
, ", upper_bound = ");
6865 dump_double_int (file
, loop
->nb_iterations_upper_bound
, true);
6868 if (loop
->any_estimate
)
6870 fprintf (file
, ", estimate = ");
6871 dump_double_int (file
, loop
->nb_iterations_estimate
, true);
6873 fprintf (file
, ")\n");
6875 /* Print loop's body. */
6878 fprintf (file
, "%s{\n", s_indent
);
6880 if (bb
->loop_father
== loop
)
6881 print_loops_bb (file
, bb
, indent
, verbosity
);
6883 print_loop_and_siblings (file
, loop
->inner
, indent
+ 2, verbosity
);
6884 fprintf (file
, "%s}\n", s_indent
);
6888 /* Print the LOOP and its sibling loops on FILE, indented INDENT
6889 spaces. Following VERBOSITY level this outputs the contents of the
6890 loop, or just its structure. */
6893 print_loop_and_siblings (FILE *file
, struct loop
*loop
, int indent
, int verbosity
)
6898 print_loop (file
, loop
, indent
, verbosity
);
6899 print_loop_and_siblings (file
, loop
->next
, indent
, verbosity
);
6902 /* Follow a CFG edge from the entry point of the program, and on entry
6903 of a loop, pretty print the loop structure on FILE. */
6906 print_loops (FILE *file
, int verbosity
)
6910 bb
= ENTRY_BLOCK_PTR
;
6911 if (bb
&& bb
->loop_father
)
6912 print_loop_and_siblings (file
, bb
->loop_father
, 0, verbosity
);
6916 /* Debugging loops structure at tree level, at some VERBOSITY level. */
6919 debug_loops (int verbosity
)
6921 print_loops (stderr
, verbosity
);
6924 /* Print on stderr the code of LOOP, at some VERBOSITY level. */
6927 debug_loop (struct loop
*loop
, int verbosity
)
6929 print_loop (stderr
, loop
, 0, verbosity
);
6932 /* Print on stderr the code of loop number NUM, at some VERBOSITY
6936 debug_loop_num (unsigned num
, int verbosity
)
6938 debug_loop (get_loop (num
), verbosity
);
6941 /* Return true if BB ends with a call, possibly followed by some
6942 instructions that must stay with the call. Return false,
6946 gimple_block_ends_with_call_p (basic_block bb
)
6948 gimple_stmt_iterator gsi
= gsi_last_nondebug_bb (bb
);
6949 return !gsi_end_p (gsi
) && is_gimple_call (gsi_stmt (gsi
));
6953 /* Return true if BB ends with a conditional branch. Return false,
6957 gimple_block_ends_with_condjump_p (const_basic_block bb
)
6959 gimple stmt
= last_stmt (CONST_CAST_BB (bb
));
6960 return (stmt
&& gimple_code (stmt
) == GIMPLE_COND
);
6964 /* Return true if we need to add fake edge to exit at statement T.
6965 Helper function for gimple_flow_call_edges_add. */
6968 need_fake_edge_p (gimple t
)
6970 tree fndecl
= NULL_TREE
;
6973 /* NORETURN and LONGJMP calls already have an edge to exit.
6974 CONST and PURE calls do not need one.
6975 We don't currently check for CONST and PURE here, although
6976 it would be a good idea, because those attributes are
6977 figured out from the RTL in mark_constant_function, and
6978 the counter incrementation code from -fprofile-arcs
6979 leads to different results from -fbranch-probabilities. */
6980 if (is_gimple_call (t
))
6982 fndecl
= gimple_call_fndecl (t
);
6983 call_flags
= gimple_call_flags (t
);
6986 if (is_gimple_call (t
)
6988 && DECL_BUILT_IN (fndecl
)
6989 && (call_flags
& ECF_NOTHROW
)
6990 && !(call_flags
& ECF_RETURNS_TWICE
)
6991 /* fork() doesn't really return twice, but the effect of
6992 wrapping it in __gcov_fork() which calls __gcov_flush()
6993 and clears the counters before forking has the same
6994 effect as returning twice. Force a fake edge. */
6995 && !(DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
6996 && DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_FORK
))
6999 if (is_gimple_call (t
))
7005 if (!(call_flags
& ECF_NORETURN
))
7009 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
7010 if ((e
->flags
& EDGE_FAKE
) == 0)
7014 if (gimple_code (t
) == GIMPLE_ASM
7015 && (gimple_asm_volatile_p (t
) || gimple_asm_input_p (t
)))
7022 /* Add fake edges to the function exit for any non constant and non
7023 noreturn calls (or noreturn calls with EH/abnormal edges),
7024 volatile inline assembly in the bitmap of blocks specified by BLOCKS
7025 or to the whole CFG if BLOCKS is zero. Return the number of blocks
7028 The goal is to expose cases in which entering a basic block does
7029 not imply that all subsequent instructions must be executed. */
7032 gimple_flow_call_edges_add (sbitmap blocks
)
7035 int blocks_split
= 0;
7036 int last_bb
= last_basic_block
;
7037 bool check_last_block
= false;
7039 if (n_basic_blocks
== NUM_FIXED_BLOCKS
)
7043 check_last_block
= true;
7045 check_last_block
= TEST_BIT (blocks
, EXIT_BLOCK_PTR
->prev_bb
->index
);
7047 /* In the last basic block, before epilogue generation, there will be
7048 a fallthru edge to EXIT. Special care is required if the last insn
7049 of the last basic block is a call because make_edge folds duplicate
7050 edges, which would result in the fallthru edge also being marked
7051 fake, which would result in the fallthru edge being removed by
7052 remove_fake_edges, which would result in an invalid CFG.
7054 Moreover, we can't elide the outgoing fake edge, since the block
7055 profiler needs to take this into account in order to solve the minimal
7056 spanning tree in the case that the call doesn't return.
7058 Handle this by adding a dummy instruction in a new last basic block. */
7059 if (check_last_block
)
7061 basic_block bb
= EXIT_BLOCK_PTR
->prev_bb
;
7062 gimple_stmt_iterator gsi
= gsi_last_nondebug_bb (bb
);
7065 if (!gsi_end_p (gsi
))
7068 if (t
&& need_fake_edge_p (t
))
7072 e
= find_edge (bb
, EXIT_BLOCK_PTR
);
7075 gsi_insert_on_edge (e
, gimple_build_nop ());
7076 gsi_commit_edge_inserts ();
7081 /* Now add fake edges to the function exit for any non constant
7082 calls since there is no way that we can determine if they will
7084 for (i
= 0; i
< last_bb
; i
++)
7086 basic_block bb
= BASIC_BLOCK (i
);
7087 gimple_stmt_iterator gsi
;
7088 gimple stmt
, last_stmt
;
7093 if (blocks
&& !TEST_BIT (blocks
, i
))
7096 gsi
= gsi_last_nondebug_bb (bb
);
7097 if (!gsi_end_p (gsi
))
7099 last_stmt
= gsi_stmt (gsi
);
7102 stmt
= gsi_stmt (gsi
);
7103 if (need_fake_edge_p (stmt
))
7107 /* The handling above of the final block before the
7108 epilogue should be enough to verify that there is
7109 no edge to the exit block in CFG already.
7110 Calling make_edge in such case would cause us to
7111 mark that edge as fake and remove it later. */
7112 #ifdef ENABLE_CHECKING
7113 if (stmt
== last_stmt
)
7115 e
= find_edge (bb
, EXIT_BLOCK_PTR
);
7116 gcc_assert (e
== NULL
);
7120 /* Note that the following may create a new basic block
7121 and renumber the existing basic blocks. */
7122 if (stmt
!= last_stmt
)
7124 e
= split_block (bb
, stmt
);
7128 make_edge (bb
, EXIT_BLOCK_PTR
, EDGE_FAKE
);
7132 while (!gsi_end_p (gsi
));
7137 verify_flow_info ();
7139 return blocks_split
;
7142 /* Removes edge E and all the blocks dominated by it, and updates dominance
7143 information. The IL in E->src needs to be updated separately.
7144 If dominance info is not available, only the edge E is removed.*/
7147 remove_edge_and_dominated_blocks (edge e
)
7149 VEC (basic_block
, heap
) *bbs_to_remove
= NULL
;
7150 VEC (basic_block
, heap
) *bbs_to_fix_dom
= NULL
;
7154 bool none_removed
= false;
7156 basic_block bb
, dbb
;
7159 if (!dom_info_available_p (CDI_DOMINATORS
))
7165 /* No updating is needed for edges to exit. */
7166 if (e
->dest
== EXIT_BLOCK_PTR
)
7168 if (cfgcleanup_altered_bbs
)
7169 bitmap_set_bit (cfgcleanup_altered_bbs
, e
->src
->index
);
7174 /* First, we find the basic blocks to remove. If E->dest has a predecessor
7175 that is not dominated by E->dest, then this set is empty. Otherwise,
7176 all the basic blocks dominated by E->dest are removed.
7178 Also, to DF_IDOM we store the immediate dominators of the blocks in
7179 the dominance frontier of E (i.e., of the successors of the
7180 removed blocks, if there are any, and of E->dest otherwise). */
7181 FOR_EACH_EDGE (f
, ei
, e
->dest
->preds
)
7186 if (!dominated_by_p (CDI_DOMINATORS
, f
->src
, e
->dest
))
7188 none_removed
= true;
7193 df
= BITMAP_ALLOC (NULL
);
7194 df_idom
= BITMAP_ALLOC (NULL
);
7197 bitmap_set_bit (df_idom
,
7198 get_immediate_dominator (CDI_DOMINATORS
, e
->dest
)->index
);
7201 bbs_to_remove
= get_all_dominated_blocks (CDI_DOMINATORS
, e
->dest
);
7202 FOR_EACH_VEC_ELT (basic_block
, bbs_to_remove
, i
, bb
)
7204 FOR_EACH_EDGE (f
, ei
, bb
->succs
)
7206 if (f
->dest
!= EXIT_BLOCK_PTR
)
7207 bitmap_set_bit (df
, f
->dest
->index
);
7210 FOR_EACH_VEC_ELT (basic_block
, bbs_to_remove
, i
, bb
)
7211 bitmap_clear_bit (df
, bb
->index
);
7213 EXECUTE_IF_SET_IN_BITMAP (df
, 0, i
, bi
)
7215 bb
= BASIC_BLOCK (i
);
7216 bitmap_set_bit (df_idom
,
7217 get_immediate_dominator (CDI_DOMINATORS
, bb
)->index
);
7221 if (cfgcleanup_altered_bbs
)
7223 /* Record the set of the altered basic blocks. */
7224 bitmap_set_bit (cfgcleanup_altered_bbs
, e
->src
->index
);
7225 bitmap_ior_into (cfgcleanup_altered_bbs
, df
);
7228 /* Remove E and the cancelled blocks. */
7233 /* Walk backwards so as to get a chance to substitute all
7234 released DEFs into debug stmts. See
7235 eliminate_unnecessary_stmts() in tree-ssa-dce.c for more
7237 for (i
= VEC_length (basic_block
, bbs_to_remove
); i
-- > 0; )
7238 delete_basic_block (VEC_index (basic_block
, bbs_to_remove
, i
));
7241 /* Update the dominance information. The immediate dominator may change only
7242 for blocks whose immediate dominator belongs to DF_IDOM:
7244 Suppose that idom(X) = Y before removal of E and idom(X) != Y after the
7245 removal. Let Z the arbitrary block such that idom(Z) = Y and
7246 Z dominates X after the removal. Before removal, there exists a path P
7247 from Y to X that avoids Z. Let F be the last edge on P that is
7248 removed, and let W = F->dest. Before removal, idom(W) = Y (since Y
7249 dominates W, and because of P, Z does not dominate W), and W belongs to
7250 the dominance frontier of E. Therefore, Y belongs to DF_IDOM. */
7251 EXECUTE_IF_SET_IN_BITMAP (df_idom
, 0, i
, bi
)
7253 bb
= BASIC_BLOCK (i
);
7254 for (dbb
= first_dom_son (CDI_DOMINATORS
, bb
);
7256 dbb
= next_dom_son (CDI_DOMINATORS
, dbb
))
7257 VEC_safe_push (basic_block
, heap
, bbs_to_fix_dom
, dbb
);
7260 iterate_fix_dominators (CDI_DOMINATORS
, bbs_to_fix_dom
, true);
7263 BITMAP_FREE (df_idom
);
7264 VEC_free (basic_block
, heap
, bbs_to_remove
);
7265 VEC_free (basic_block
, heap
, bbs_to_fix_dom
);
7268 /* Purge dead EH edges from basic block BB. */
7271 gimple_purge_dead_eh_edges (basic_block bb
)
7273 bool changed
= false;
7276 gimple stmt
= last_stmt (bb
);
7278 if (stmt
&& stmt_can_throw_internal (stmt
))
7281 for (ei
= ei_start (bb
->succs
); (e
= ei_safe_edge (ei
)); )
7283 if (e
->flags
& EDGE_EH
)
7285 remove_edge_and_dominated_blocks (e
);
7295 /* Purge dead EH edges from basic block listed in BLOCKS. */
7298 gimple_purge_all_dead_eh_edges (const_bitmap blocks
)
7300 bool changed
= false;
7304 EXECUTE_IF_SET_IN_BITMAP (blocks
, 0, i
, bi
)
7306 basic_block bb
= BASIC_BLOCK (i
);
7308 /* Earlier gimple_purge_dead_eh_edges could have removed
7309 this basic block already. */
7310 gcc_assert (bb
|| changed
);
7312 changed
|= gimple_purge_dead_eh_edges (bb
);
7318 /* Purge dead abnormal call edges from basic block BB. */
7321 gimple_purge_dead_abnormal_call_edges (basic_block bb
)
7323 bool changed
= false;
7326 gimple stmt
= last_stmt (bb
);
7328 if (!cfun
->has_nonlocal_label
)
7331 if (stmt
&& stmt_can_make_abnormal_goto (stmt
))
7334 for (ei
= ei_start (bb
->succs
); (e
= ei_safe_edge (ei
)); )
7336 if (e
->flags
& EDGE_ABNORMAL
)
7338 remove_edge_and_dominated_blocks (e
);
7348 /* Purge dead abnormal call edges from basic block listed in BLOCKS. */
7351 gimple_purge_all_dead_abnormal_call_edges (const_bitmap blocks
)
7353 bool changed
= false;
7357 EXECUTE_IF_SET_IN_BITMAP (blocks
, 0, i
, bi
)
7359 basic_block bb
= BASIC_BLOCK (i
);
7361 /* Earlier gimple_purge_dead_abnormal_call_edges could have removed
7362 this basic block already. */
7363 gcc_assert (bb
|| changed
);
7365 changed
|= gimple_purge_dead_abnormal_call_edges (bb
);
7371 /* This function is called whenever a new edge is created or
7375 gimple_execute_on_growing_pred (edge e
)
7377 basic_block bb
= e
->dest
;
7379 if (!gimple_seq_empty_p (phi_nodes (bb
)))
7380 reserve_phi_args_for_new_edge (bb
);
7383 /* This function is called immediately before edge E is removed from
7384 the edge vector E->dest->preds. */
7387 gimple_execute_on_shrinking_pred (edge e
)
7389 if (!gimple_seq_empty_p (phi_nodes (e
->dest
)))
7390 remove_phi_args (e
);
7393 /*---------------------------------------------------------------------------
7394 Helper functions for Loop versioning
7395 ---------------------------------------------------------------------------*/
7397 /* Adjust phi nodes for 'first' basic block. 'second' basic block is a copy
7398 of 'first'. Both of them are dominated by 'new_head' basic block. When
7399 'new_head' was created by 'second's incoming edge it received phi arguments
7400 on the edge by split_edge(). Later, additional edge 'e' was created to
7401 connect 'new_head' and 'first'. Now this routine adds phi args on this
7402 additional edge 'e' that new_head to second edge received as part of edge
7406 gimple_lv_adjust_loop_header_phi (basic_block first
, basic_block second
,
7407 basic_block new_head
, edge e
)
7410 gimple_stmt_iterator psi1
, psi2
;
7412 edge e2
= find_edge (new_head
, second
);
7414 /* Because NEW_HEAD has been created by splitting SECOND's incoming
7415 edge, we should always have an edge from NEW_HEAD to SECOND. */
7416 gcc_assert (e2
!= NULL
);
7418 /* Browse all 'second' basic block phi nodes and add phi args to
7419 edge 'e' for 'first' head. PHI args are always in correct order. */
7421 for (psi2
= gsi_start_phis (second
),
7422 psi1
= gsi_start_phis (first
);
7423 !gsi_end_p (psi2
) && !gsi_end_p (psi1
);
7424 gsi_next (&psi2
), gsi_next (&psi1
))
7426 phi1
= gsi_stmt (psi1
);
7427 phi2
= gsi_stmt (psi2
);
7428 def
= PHI_ARG_DEF (phi2
, e2
->dest_idx
);
7429 add_phi_arg (phi1
, def
, e
, gimple_phi_arg_location_from_edge (phi2
, e2
));
7434 /* Adds a if else statement to COND_BB with condition COND_EXPR.
7435 SECOND_HEAD is the destination of the THEN and FIRST_HEAD is
7436 the destination of the ELSE part. */
7439 gimple_lv_add_condition_to_bb (basic_block first_head ATTRIBUTE_UNUSED
,
7440 basic_block second_head ATTRIBUTE_UNUSED
,
7441 basic_block cond_bb
, void *cond_e
)
7443 gimple_stmt_iterator gsi
;
7444 gimple new_cond_expr
;
7445 tree cond_expr
= (tree
) cond_e
;
7448 /* Build new conditional expr */
7449 new_cond_expr
= gimple_build_cond_from_tree (cond_expr
,
7450 NULL_TREE
, NULL_TREE
);
7452 /* Add new cond in cond_bb. */
7453 gsi
= gsi_last_bb (cond_bb
);
7454 gsi_insert_after (&gsi
, new_cond_expr
, GSI_NEW_STMT
);
7456 /* Adjust edges appropriately to connect new head with first head
7457 as well as second head. */
7458 e0
= single_succ_edge (cond_bb
);
7459 e0
->flags
&= ~EDGE_FALLTHRU
;
7460 e0
->flags
|= EDGE_FALSE_VALUE
;
7463 struct cfg_hooks gimple_cfg_hooks
= {
7465 gimple_verify_flow_info
,
7466 gimple_dump_bb
, /* dump_bb */
7467 create_bb
, /* create_basic_block */
7468 gimple_redirect_edge_and_branch
, /* redirect_edge_and_branch */
7469 gimple_redirect_edge_and_branch_force
, /* redirect_edge_and_branch_force */
7470 gimple_can_remove_branch_p
, /* can_remove_branch_p */
7471 remove_bb
, /* delete_basic_block */
7472 gimple_split_block
, /* split_block */
7473 gimple_move_block_after
, /* move_block_after */
7474 gimple_can_merge_blocks_p
, /* can_merge_blocks_p */
7475 gimple_merge_blocks
, /* merge_blocks */
7476 gimple_predict_edge
, /* predict_edge */
7477 gimple_predicted_by_p
, /* predicted_by_p */
7478 gimple_can_duplicate_bb_p
, /* can_duplicate_block_p */
7479 gimple_duplicate_bb
, /* duplicate_block */
7480 gimple_split_edge
, /* split_edge */
7481 gimple_make_forwarder_block
, /* make_forward_block */
7482 NULL
, /* tidy_fallthru_edge */
7483 NULL
, /* force_nonfallthru */
7484 gimple_block_ends_with_call_p
,/* block_ends_with_call_p */
7485 gimple_block_ends_with_condjump_p
, /* block_ends_with_condjump_p */
7486 gimple_flow_call_edges_add
, /* flow_call_edges_add */
7487 gimple_execute_on_growing_pred
, /* execute_on_growing_pred */
7488 gimple_execute_on_shrinking_pred
, /* execute_on_shrinking_pred */
7489 gimple_duplicate_loop_to_header_edge
, /* duplicate loop for trees */
7490 gimple_lv_add_condition_to_bb
, /* lv_add_condition_to_bb */
7491 gimple_lv_adjust_loop_header_phi
, /* lv_adjust_loop_header_phi*/
7492 extract_true_false_edges_from_block
, /* extract_cond_bb_edges */
7493 flush_pending_stmts
/* flush_pending_stmts */
7497 /* Split all critical edges. */
7500 split_critical_edges (void)
7506 /* split_edge can redirect edges out of SWITCH_EXPRs, which can get
7507 expensive. So we want to enable recording of edge to CASE_LABEL_EXPR
7508 mappings around the calls to split_edge. */
7509 start_recording_case_labels ();
7512 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
7514 if (EDGE_CRITICAL_P (e
) && !(e
->flags
& EDGE_ABNORMAL
))
7516 /* PRE inserts statements to edges and expects that
7517 since split_critical_edges was done beforehand, committing edge
7518 insertions will not split more edges. In addition to critical
7519 edges we must split edges that have multiple successors and
7520 end by control flow statements, such as RESX.
7521 Go ahead and split them too. This matches the logic in
7522 gimple_find_edge_insert_loc. */
7523 else if ((!single_pred_p (e
->dest
)
7524 || !gimple_seq_empty_p (phi_nodes (e
->dest
))
7525 || e
->dest
== EXIT_BLOCK_PTR
)
7526 && e
->src
!= ENTRY_BLOCK_PTR
7527 && !(e
->flags
& EDGE_ABNORMAL
))
7529 gimple_stmt_iterator gsi
;
7531 gsi
= gsi_last_bb (e
->src
);
7532 if (!gsi_end_p (gsi
)
7533 && stmt_ends_bb_p (gsi_stmt (gsi
))
7534 && (gimple_code (gsi_stmt (gsi
)) != GIMPLE_RETURN
7535 && !gimple_call_builtin_p (gsi_stmt (gsi
),
7541 end_recording_case_labels ();
7545 struct gimple_opt_pass pass_split_crit_edges
=
7549 "crited", /* name */
7551 split_critical_edges
, /* execute */
7554 0, /* static_pass_number */
7555 TV_TREE_SPLIT_EDGES
, /* tv_id */
7556 PROP_cfg
, /* properties required */
7557 PROP_no_crit_edges
, /* properties_provided */
7558 0, /* properties_destroyed */
7559 0, /* todo_flags_start */
7560 TODO_verify_flow
/* todo_flags_finish */
7565 /* Build a ternary operation and gimplify it. Emit code before GSI.
7566 Return the gimple_val holding the result. */
7569 gimplify_build3 (gimple_stmt_iterator
*gsi
, enum tree_code code
,
7570 tree type
, tree a
, tree b
, tree c
)
7573 location_t loc
= gimple_location (gsi_stmt (*gsi
));
7575 ret
= fold_build3_loc (loc
, code
, type
, a
, b
, c
);
7578 return force_gimple_operand_gsi (gsi
, ret
, true, NULL
, true,
7582 /* Build a binary operation and gimplify it. Emit code before GSI.
7583 Return the gimple_val holding the result. */
7586 gimplify_build2 (gimple_stmt_iterator
*gsi
, enum tree_code code
,
7587 tree type
, tree a
, tree b
)
7591 ret
= fold_build2_loc (gimple_location (gsi_stmt (*gsi
)), code
, type
, a
, b
);
7594 return force_gimple_operand_gsi (gsi
, ret
, true, NULL
, true,
7598 /* Build a unary operation and gimplify it. Emit code before GSI.
7599 Return the gimple_val holding the result. */
7602 gimplify_build1 (gimple_stmt_iterator
*gsi
, enum tree_code code
, tree type
,
7607 ret
= fold_build1_loc (gimple_location (gsi_stmt (*gsi
)), code
, type
, a
);
7610 return force_gimple_operand_gsi (gsi
, ret
, true, NULL
, true,
7616 /* Emit return warnings. */
7619 execute_warn_function_return (void)
7621 source_location location
;
7626 /* If we have a path to EXIT, then we do return. */
7627 if (TREE_THIS_VOLATILE (cfun
->decl
)
7628 && EDGE_COUNT (EXIT_BLOCK_PTR
->preds
) > 0)
7630 location
= UNKNOWN_LOCATION
;
7631 FOR_EACH_EDGE (e
, ei
, EXIT_BLOCK_PTR
->preds
)
7633 last
= last_stmt (e
->src
);
7634 if ((gimple_code (last
) == GIMPLE_RETURN
7635 || gimple_call_builtin_p (last
, BUILT_IN_RETURN
))
7636 && (location
= gimple_location (last
)) != UNKNOWN_LOCATION
)
7639 if (location
== UNKNOWN_LOCATION
)
7640 location
= cfun
->function_end_locus
;
7641 warning_at (location
, 0, "%<noreturn%> function does return");
7644 /* If we see "return;" in some basic block, then we do reach the end
7645 without returning a value. */
7646 else if (warn_return_type
7647 && !TREE_NO_WARNING (cfun
->decl
)
7648 && EDGE_COUNT (EXIT_BLOCK_PTR
->preds
) > 0
7649 && !VOID_TYPE_P (TREE_TYPE (TREE_TYPE (cfun
->decl
))))
7651 FOR_EACH_EDGE (e
, ei
, EXIT_BLOCK_PTR
->preds
)
7653 gimple last
= last_stmt (e
->src
);
7654 if (gimple_code (last
) == GIMPLE_RETURN
7655 && gimple_return_retval (last
) == NULL
7656 && !gimple_no_warning_p (last
))
7658 location
= gimple_location (last
);
7659 if (location
== UNKNOWN_LOCATION
)
7660 location
= cfun
->function_end_locus
;
7661 warning_at (location
, OPT_Wreturn_type
, "control reaches end of non-void function");
7662 TREE_NO_WARNING (cfun
->decl
) = 1;
7671 /* Given a basic block B which ends with a conditional and has
7672 precisely two successors, determine which of the edges is taken if
7673 the conditional is true and which is taken if the conditional is
7674 false. Set TRUE_EDGE and FALSE_EDGE appropriately. */
7677 extract_true_false_edges_from_block (basic_block b
,
7681 edge e
= EDGE_SUCC (b
, 0);
7683 if (e
->flags
& EDGE_TRUE_VALUE
)
7686 *false_edge
= EDGE_SUCC (b
, 1);
7691 *true_edge
= EDGE_SUCC (b
, 1);
7695 struct gimple_opt_pass pass_warn_function_return
=
7699 "*warn_function_return", /* name */
7701 execute_warn_function_return
, /* execute */
7704 0, /* static_pass_number */
7705 TV_NONE
, /* tv_id */
7706 PROP_cfg
, /* properties_required */
7707 0, /* properties_provided */
7708 0, /* properties_destroyed */
7709 0, /* todo_flags_start */
7710 0 /* todo_flags_finish */
7714 /* Emit noreturn warnings. */
7717 execute_warn_function_noreturn (void)
7719 if (!TREE_THIS_VOLATILE (current_function_decl
)
7720 && EDGE_COUNT (EXIT_BLOCK_PTR
->preds
) == 0)
7721 warn_function_noreturn (current_function_decl
);
7726 gate_warn_function_noreturn (void)
7728 return warn_suggest_attribute_noreturn
;
7731 struct gimple_opt_pass pass_warn_function_noreturn
=
7735 "*warn_function_noreturn", /* name */
7736 gate_warn_function_noreturn
, /* gate */
7737 execute_warn_function_noreturn
, /* execute */
7740 0, /* static_pass_number */
7741 TV_NONE
, /* tv_id */
7742 PROP_cfg
, /* properties_required */
7743 0, /* properties_provided */
7744 0, /* properties_destroyed */
7745 0, /* todo_flags_start */
7746 0 /* todo_flags_finish */
7751 /* Walk a gimplified function and warn for functions whose return value is
7752 ignored and attribute((warn_unused_result)) is set. This is done before
7753 inlining, so we don't have to worry about that. */
7756 do_warn_unused_result (gimple_seq seq
)
7759 gimple_stmt_iterator i
;
7761 for (i
= gsi_start (seq
); !gsi_end_p (i
); gsi_next (&i
))
7763 gimple g
= gsi_stmt (i
);
7765 switch (gimple_code (g
))
7768 do_warn_unused_result (gimple_bind_body (g
));
7771 do_warn_unused_result (gimple_try_eval (g
));
7772 do_warn_unused_result (gimple_try_cleanup (g
));
7775 do_warn_unused_result (gimple_catch_handler (g
));
7777 case GIMPLE_EH_FILTER
:
7778 do_warn_unused_result (gimple_eh_filter_failure (g
));
7782 if (gimple_call_lhs (g
))
7784 if (gimple_call_internal_p (g
))
7787 /* This is a naked call, as opposed to a GIMPLE_CALL with an
7788 LHS. All calls whose value is ignored should be
7789 represented like this. Look for the attribute. */
7790 fdecl
= gimple_call_fndecl (g
);
7791 ftype
= gimple_call_fntype (g
);
7793 if (lookup_attribute ("warn_unused_result", TYPE_ATTRIBUTES (ftype
)))
7795 location_t loc
= gimple_location (g
);
7798 warning_at (loc
, OPT_Wunused_result
,
7799 "ignoring return value of %qD, "
7800 "declared with attribute warn_unused_result",
7803 warning_at (loc
, OPT_Wunused_result
,
7804 "ignoring return value of function "
7805 "declared with attribute warn_unused_result");
7810 /* Not a container, not a call, or a call whose value is used. */
7817 run_warn_unused_result (void)
7819 do_warn_unused_result (gimple_body (current_function_decl
));
7824 gate_warn_unused_result (void)
7826 return flag_warn_unused_result
;
7829 struct gimple_opt_pass pass_warn_unused_result
=
7833 "*warn_unused_result", /* name */
7834 gate_warn_unused_result
, /* gate */
7835 run_warn_unused_result
, /* execute */
7838 0, /* static_pass_number */
7839 TV_NONE
, /* tv_id */
7840 PROP_gimple_any
, /* properties_required */
7841 0, /* properties_provided */
7842 0, /* properties_destroyed */
7843 0, /* todo_flags_start */
7844 0, /* todo_flags_finish */