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 "tree-ssa-propagate.h"
43 #include "value-prof.h"
44 #include "pointer-set.h"
45 #include "tree-inline.h"
47 /* This file contains functions for building the Control Flow Graph (CFG)
48 for a function tree. */
50 /* Local declarations. */
52 /* Initial capacity for the basic block array. */
53 static const int initial_cfg_capacity
= 20;
55 /* This hash table allows us to efficiently lookup all CASE_LABEL_EXPRs
56 which use a particular edge. The CASE_LABEL_EXPRs are chained together
57 via their CASE_CHAIN field, which we clear after we're done with the
58 hash table to prevent problems with duplication of GIMPLE_SWITCHes.
60 Access to this list of CASE_LABEL_EXPRs allows us to efficiently
61 update the case vector in response to edge redirections.
63 Right now this table is set up and torn down at key points in the
64 compilation process. It would be nice if we could make the table
65 more persistent. The key is getting notification of changes to
66 the CFG (particularly edge removal, creation and redirection). */
68 static struct pointer_map_t
*edge_to_cases
;
70 /* If we record edge_to_cases, this bitmap will hold indexes
71 of basic blocks that end in a GIMPLE_SWITCH which we touched
72 due to edge manipulations. */
74 static bitmap touched_switch_bbs
;
79 long num_merged_labels
;
82 static struct cfg_stats_d cfg_stats
;
84 /* Nonzero if we found a computed goto while building basic blocks. */
85 static bool found_computed_goto
;
87 /* Hash table to store last discriminator assigned for each locus. */
88 struct locus_discrim_map
93 static htab_t discriminator_per_locus
;
95 /* Basic blocks and flowgraphs. */
96 static void make_blocks (gimple_seq
);
97 static void factor_computed_gotos (void);
100 static void make_edges (void);
101 static void make_cond_expr_edges (basic_block
);
102 static void make_gimple_switch_edges (basic_block
);
103 static void make_goto_expr_edges (basic_block
);
104 static void make_gimple_asm_edges (basic_block
);
105 static unsigned int locus_map_hash (const void *);
106 static int locus_map_eq (const void *, const void *);
107 static void assign_discriminator (location_t
, basic_block
);
108 static edge
gimple_redirect_edge_and_branch (edge
, basic_block
);
109 static edge
gimple_try_redirect_by_replacing_jump (edge
, basic_block
);
110 static unsigned int split_critical_edges (void);
112 /* Various helpers. */
113 static inline bool stmt_starts_bb_p (gimple
, gimple
);
114 static int gimple_verify_flow_info (void);
115 static void gimple_make_forwarder_block (edge
);
116 static void gimple_cfg2vcg (FILE *);
117 static gimple
first_non_label_stmt (basic_block
);
118 static bool verify_gimple_transaction (gimple
);
120 /* Flowgraph optimization and cleanup. */
121 static void gimple_merge_blocks (basic_block
, basic_block
);
122 static bool gimple_can_merge_blocks_p (basic_block
, basic_block
);
123 static void remove_bb (basic_block
);
124 static edge
find_taken_edge_computed_goto (basic_block
, tree
);
125 static edge
find_taken_edge_cond_expr (basic_block
, tree
);
126 static edge
find_taken_edge_switch_expr (basic_block
, tree
);
127 static tree
find_case_label_for_value (gimple
, tree
);
128 static void group_case_labels_stmt (gimple
);
131 init_empty_tree_cfg_for_function (struct function
*fn
)
133 /* Initialize the basic block array. */
135 profile_status_for_function (fn
) = PROFILE_ABSENT
;
136 n_basic_blocks_for_function (fn
) = NUM_FIXED_BLOCKS
;
137 last_basic_block_for_function (fn
) = NUM_FIXED_BLOCKS
;
138 basic_block_info_for_function (fn
)
139 = VEC_alloc (basic_block
, gc
, initial_cfg_capacity
);
140 VEC_safe_grow_cleared (basic_block
, gc
,
141 basic_block_info_for_function (fn
),
142 initial_cfg_capacity
);
144 /* Build a mapping of labels to their associated blocks. */
145 label_to_block_map_for_function (fn
)
146 = VEC_alloc (basic_block
, gc
, initial_cfg_capacity
);
147 VEC_safe_grow_cleared (basic_block
, gc
,
148 label_to_block_map_for_function (fn
),
149 initial_cfg_capacity
);
151 SET_BASIC_BLOCK_FOR_FUNCTION (fn
, ENTRY_BLOCK
,
152 ENTRY_BLOCK_PTR_FOR_FUNCTION (fn
));
153 SET_BASIC_BLOCK_FOR_FUNCTION (fn
, EXIT_BLOCK
,
154 EXIT_BLOCK_PTR_FOR_FUNCTION (fn
));
156 ENTRY_BLOCK_PTR_FOR_FUNCTION (fn
)->next_bb
157 = EXIT_BLOCK_PTR_FOR_FUNCTION (fn
);
158 EXIT_BLOCK_PTR_FOR_FUNCTION (fn
)->prev_bb
159 = ENTRY_BLOCK_PTR_FOR_FUNCTION (fn
);
163 init_empty_tree_cfg (void)
165 init_empty_tree_cfg_for_function (cfun
);
168 /*---------------------------------------------------------------------------
170 ---------------------------------------------------------------------------*/
172 /* Entry point to the CFG builder for trees. SEQ is the sequence of
173 statements to be added to the flowgraph. */
176 build_gimple_cfg (gimple_seq seq
)
178 /* Register specific gimple functions. */
179 gimple_register_cfg_hooks ();
181 memset ((void *) &cfg_stats
, 0, sizeof (cfg_stats
));
183 init_empty_tree_cfg ();
185 found_computed_goto
= 0;
188 /* Computed gotos are hell to deal with, especially if there are
189 lots of them with a large number of destinations. So we factor
190 them to a common computed goto location before we build the
191 edge list. After we convert back to normal form, we will un-factor
192 the computed gotos since factoring introduces an unwanted jump. */
193 if (found_computed_goto
)
194 factor_computed_gotos ();
196 /* Make sure there is always at least one block, even if it's empty. */
197 if (n_basic_blocks
== NUM_FIXED_BLOCKS
)
198 create_empty_bb (ENTRY_BLOCK_PTR
);
200 /* Adjust the size of the array. */
201 if (VEC_length (basic_block
, basic_block_info
) < (size_t) n_basic_blocks
)
202 VEC_safe_grow_cleared (basic_block
, gc
, basic_block_info
, n_basic_blocks
);
204 /* To speed up statement iterator walks, we first purge dead labels. */
205 cleanup_dead_labels ();
207 /* Group case nodes to reduce the number of edges.
208 We do this after cleaning up dead labels because otherwise we miss
209 a lot of obvious case merging opportunities. */
210 group_case_labels ();
212 /* Create the edges of the flowgraph. */
213 discriminator_per_locus
= htab_create (13, locus_map_hash
, locus_map_eq
,
216 cleanup_dead_labels ();
217 htab_delete (discriminator_per_locus
);
219 /* Debugging dumps. */
221 /* Write the flowgraph to a VCG file. */
223 int local_dump_flags
;
224 FILE *vcg_file
= dump_begin (TDI_vcg
, &local_dump_flags
);
227 gimple_cfg2vcg (vcg_file
);
228 dump_end (TDI_vcg
, vcg_file
);
234 execute_build_cfg (void)
236 gimple_seq body
= gimple_body (current_function_decl
);
238 build_gimple_cfg (body
);
239 gimple_set_body (current_function_decl
, NULL
);
240 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
242 fprintf (dump_file
, "Scope blocks:\n");
243 dump_scope_blocks (dump_file
, dump_flags
);
248 struct gimple_opt_pass pass_build_cfg
=
254 execute_build_cfg
, /* execute */
257 0, /* static_pass_number */
258 TV_TREE_CFG
, /* tv_id */
259 PROP_gimple_leh
, /* properties_required */
260 PROP_cfg
, /* properties_provided */
261 0, /* properties_destroyed */
262 0, /* todo_flags_start */
263 TODO_verify_stmts
| TODO_cleanup_cfg
/* todo_flags_finish */
268 /* Return true if T is a computed goto. */
271 computed_goto_p (gimple t
)
273 return (gimple_code (t
) == GIMPLE_GOTO
274 && TREE_CODE (gimple_goto_dest (t
)) != LABEL_DECL
);
278 /* Search the CFG for any computed gotos. If found, factor them to a
279 common computed goto site. Also record the location of that site so
280 that we can un-factor the gotos after we have converted back to
284 factor_computed_gotos (void)
287 tree factored_label_decl
= NULL
;
289 gimple factored_computed_goto_label
= NULL
;
290 gimple factored_computed_goto
= NULL
;
292 /* We know there are one or more computed gotos in this function.
293 Examine the last statement in each basic block to see if the block
294 ends with a computed goto. */
298 gimple_stmt_iterator gsi
= gsi_last_bb (bb
);
304 last
= gsi_stmt (gsi
);
306 /* Ignore the computed goto we create when we factor the original
308 if (last
== factored_computed_goto
)
311 /* If the last statement is a computed goto, factor it. */
312 if (computed_goto_p (last
))
316 /* The first time we find a computed goto we need to create
317 the factored goto block and the variable each original
318 computed goto will use for their goto destination. */
319 if (!factored_computed_goto
)
321 basic_block new_bb
= create_empty_bb (bb
);
322 gimple_stmt_iterator new_gsi
= gsi_start_bb (new_bb
);
324 /* Create the destination of the factored goto. Each original
325 computed goto will put its desired destination into this
326 variable and jump to the label we create immediately
328 var
= create_tmp_var (ptr_type_node
, "gotovar");
330 /* Build a label for the new block which will contain the
331 factored computed goto. */
332 factored_label_decl
= create_artificial_label (UNKNOWN_LOCATION
);
333 factored_computed_goto_label
334 = gimple_build_label (factored_label_decl
);
335 gsi_insert_after (&new_gsi
, factored_computed_goto_label
,
338 /* Build our new computed goto. */
339 factored_computed_goto
= gimple_build_goto (var
);
340 gsi_insert_after (&new_gsi
, factored_computed_goto
, GSI_NEW_STMT
);
343 /* Copy the original computed goto's destination into VAR. */
344 assignment
= gimple_build_assign (var
, gimple_goto_dest (last
));
345 gsi_insert_before (&gsi
, assignment
, GSI_SAME_STMT
);
347 /* And re-vector the computed goto to the new destination. */
348 gimple_goto_set_dest (last
, factored_label_decl
);
354 /* Build a flowgraph for the sequence of stmts SEQ. */
357 make_blocks (gimple_seq seq
)
359 gimple_stmt_iterator i
= gsi_start (seq
);
361 bool start_new_block
= true;
362 bool first_stmt_of_seq
= true;
363 basic_block bb
= ENTRY_BLOCK_PTR
;
365 while (!gsi_end_p (i
))
372 /* If the statement starts a new basic block or if we have determined
373 in a previous pass that we need to create a new block for STMT, do
375 if (start_new_block
|| stmt_starts_bb_p (stmt
, prev_stmt
))
377 if (!first_stmt_of_seq
)
378 gsi_split_seq_before (&i
, &seq
);
379 bb
= create_basic_block (seq
, NULL
, bb
);
380 start_new_block
= false;
383 /* Now add STMT to BB and create the subgraphs for special statement
385 gimple_set_bb (stmt
, bb
);
387 if (computed_goto_p (stmt
))
388 found_computed_goto
= true;
390 /* If STMT is a basic block terminator, set START_NEW_BLOCK for the
392 if (stmt_ends_bb_p (stmt
))
394 /* If the stmt can make abnormal goto use a new temporary
395 for the assignment to the LHS. This makes sure the old value
396 of the LHS is available on the abnormal edge. Otherwise
397 we will end up with overlapping life-ranges for abnormal
399 if (gimple_has_lhs (stmt
)
400 && stmt_can_make_abnormal_goto (stmt
)
401 && is_gimple_reg_type (TREE_TYPE (gimple_get_lhs (stmt
))))
403 tree lhs
= gimple_get_lhs (stmt
);
404 tree tmp
= create_tmp_var (TREE_TYPE (lhs
), NULL
);
405 gimple s
= gimple_build_assign (lhs
, tmp
);
406 gimple_set_location (s
, gimple_location (stmt
));
407 gimple_set_block (s
, gimple_block (stmt
));
408 gimple_set_lhs (stmt
, tmp
);
409 if (TREE_CODE (TREE_TYPE (tmp
)) == COMPLEX_TYPE
410 || TREE_CODE (TREE_TYPE (tmp
)) == VECTOR_TYPE
)
411 DECL_GIMPLE_REG_P (tmp
) = 1;
412 gsi_insert_after (&i
, s
, GSI_SAME_STMT
);
414 start_new_block
= true;
418 first_stmt_of_seq
= false;
423 /* Create and return a new empty basic block after bb AFTER. */
426 create_bb (void *h
, void *e
, basic_block after
)
432 /* Create and initialize a new basic block. Since alloc_block uses
433 GC allocation that clears memory to allocate a basic block, we do
434 not have to clear the newly allocated basic block here. */
437 bb
->index
= last_basic_block
;
439 set_bb_seq (bb
, h
? (gimple_seq
) h
: NULL
);
441 /* Add the new block to the linked list of blocks. */
442 link_block (bb
, after
);
444 /* Grow the basic block array if needed. */
445 if ((size_t) last_basic_block
== VEC_length (basic_block
, basic_block_info
))
447 size_t new_size
= last_basic_block
+ (last_basic_block
+ 3) / 4;
448 VEC_safe_grow_cleared (basic_block
, gc
, basic_block_info
, new_size
);
451 /* Add the newly created block to the array. */
452 SET_BASIC_BLOCK (last_basic_block
, bb
);
461 /*---------------------------------------------------------------------------
463 ---------------------------------------------------------------------------*/
465 /* Fold COND_EXPR_COND of each COND_EXPR. */
468 fold_cond_expr_cond (void)
474 gimple stmt
= last_stmt (bb
);
476 if (stmt
&& gimple_code (stmt
) == GIMPLE_COND
)
478 location_t loc
= gimple_location (stmt
);
482 fold_defer_overflow_warnings ();
483 cond
= fold_binary_loc (loc
, gimple_cond_code (stmt
), boolean_type_node
,
484 gimple_cond_lhs (stmt
), gimple_cond_rhs (stmt
));
487 zerop
= integer_zerop (cond
);
488 onep
= integer_onep (cond
);
491 zerop
= onep
= false;
493 fold_undefer_overflow_warnings (zerop
|| onep
,
495 WARN_STRICT_OVERFLOW_CONDITIONAL
);
497 gimple_cond_make_false (stmt
);
499 gimple_cond_make_true (stmt
);
504 /* Join all the blocks in the flowgraph. */
510 struct omp_region
*cur_region
= NULL
;
512 /* Create an edge from entry to the first block with executable
514 make_edge (ENTRY_BLOCK_PTR
, BASIC_BLOCK (NUM_FIXED_BLOCKS
), EDGE_FALLTHRU
);
516 /* Traverse the basic block array placing edges. */
519 gimple last
= last_stmt (bb
);
524 enum gimple_code code
= gimple_code (last
);
528 make_goto_expr_edges (bb
);
532 make_edge (bb
, EXIT_BLOCK_PTR
, 0);
536 make_cond_expr_edges (bb
);
540 make_gimple_switch_edges (bb
);
544 make_eh_edges (last
);
547 case GIMPLE_EH_DISPATCH
:
548 fallthru
= make_eh_dispatch_edges (last
);
552 /* If this function receives a nonlocal goto, then we need to
553 make edges from this call site to all the nonlocal goto
555 if (stmt_can_make_abnormal_goto (last
))
556 make_abnormal_goto_edges (bb
, true);
558 /* If this statement has reachable exception handlers, then
559 create abnormal edges to them. */
560 make_eh_edges (last
);
562 /* BUILTIN_RETURN is really a return statement. */
563 if (gimple_call_builtin_p (last
, BUILT_IN_RETURN
))
564 make_edge (bb
, EXIT_BLOCK_PTR
, 0), fallthru
= false;
565 /* Some calls are known not to return. */
567 fallthru
= !(gimple_call_flags (last
) & ECF_NORETURN
);
571 /* A GIMPLE_ASSIGN may throw internally and thus be considered
573 if (is_ctrl_altering_stmt (last
))
574 make_eh_edges (last
);
579 make_gimple_asm_edges (bb
);
583 case GIMPLE_OMP_PARALLEL
:
584 case GIMPLE_OMP_TASK
:
586 case GIMPLE_OMP_SINGLE
:
587 case GIMPLE_OMP_MASTER
:
588 case GIMPLE_OMP_ORDERED
:
589 case GIMPLE_OMP_CRITICAL
:
590 case GIMPLE_OMP_SECTION
:
591 cur_region
= new_omp_region (bb
, code
, cur_region
);
595 case GIMPLE_OMP_SECTIONS
:
596 cur_region
= new_omp_region (bb
, code
, cur_region
);
600 case GIMPLE_OMP_SECTIONS_SWITCH
:
604 case GIMPLE_OMP_ATOMIC_LOAD
:
605 case GIMPLE_OMP_ATOMIC_STORE
:
609 case GIMPLE_OMP_RETURN
:
610 /* In the case of a GIMPLE_OMP_SECTION, the edge will go
611 somewhere other than the next block. This will be
613 cur_region
->exit
= bb
;
614 fallthru
= cur_region
->type
!= GIMPLE_OMP_SECTION
;
615 cur_region
= cur_region
->outer
;
618 case GIMPLE_OMP_CONTINUE
:
619 cur_region
->cont
= bb
;
620 switch (cur_region
->type
)
623 /* Mark all GIMPLE_OMP_FOR and GIMPLE_OMP_CONTINUE
624 succs edges as abnormal to prevent splitting
626 single_succ_edge (cur_region
->entry
)->flags
|= EDGE_ABNORMAL
;
627 /* Make the loopback edge. */
628 make_edge (bb
, single_succ (cur_region
->entry
),
631 /* Create an edge from GIMPLE_OMP_FOR to exit, which
632 corresponds to the case that the body of the loop
633 is not executed at all. */
634 make_edge (cur_region
->entry
, bb
->next_bb
, EDGE_ABNORMAL
);
635 make_edge (bb
, bb
->next_bb
, EDGE_FALLTHRU
| EDGE_ABNORMAL
);
639 case GIMPLE_OMP_SECTIONS
:
640 /* Wire up the edges into and out of the nested sections. */
642 basic_block switch_bb
= single_succ (cur_region
->entry
);
644 struct omp_region
*i
;
645 for (i
= cur_region
->inner
; i
; i
= i
->next
)
647 gcc_assert (i
->type
== GIMPLE_OMP_SECTION
);
648 make_edge (switch_bb
, i
->entry
, 0);
649 make_edge (i
->exit
, bb
, EDGE_FALLTHRU
);
652 /* Make the loopback edge to the block with
653 GIMPLE_OMP_SECTIONS_SWITCH. */
654 make_edge (bb
, switch_bb
, 0);
656 /* Make the edge from the switch to exit. */
657 make_edge (switch_bb
, bb
->next_bb
, 0);
667 case GIMPLE_TRANSACTION
:
669 tree abort_label
= gimple_transaction_label (last
);
671 make_edge (bb
, label_to_block (abort_label
), 0);
677 gcc_assert (!stmt_ends_bb_p (last
));
686 make_edge (bb
, bb
->next_bb
, EDGE_FALLTHRU
);
688 assign_discriminator (gimple_location (last
), bb
->next_bb
);
695 /* Fold COND_EXPR_COND of each COND_EXPR. */
696 fold_cond_expr_cond ();
699 /* Trivial hash function for a location_t. ITEM is a pointer to
700 a hash table entry that maps a location_t to a discriminator. */
703 locus_map_hash (const void *item
)
705 return ((const struct locus_discrim_map
*) item
)->locus
;
708 /* Equality function for the locus-to-discriminator map. VA and VB
709 point to the two hash table entries to compare. */
712 locus_map_eq (const void *va
, const void *vb
)
714 const struct locus_discrim_map
*a
= (const struct locus_discrim_map
*) va
;
715 const struct locus_discrim_map
*b
= (const struct locus_discrim_map
*) vb
;
716 return a
->locus
== b
->locus
;
719 /* Find the next available discriminator value for LOCUS. The
720 discriminator distinguishes among several basic blocks that
721 share a common locus, allowing for more accurate sample-based
725 next_discriminator_for_locus (location_t locus
)
727 struct locus_discrim_map item
;
728 struct locus_discrim_map
**slot
;
731 item
.discriminator
= 0;
732 slot
= (struct locus_discrim_map
**)
733 htab_find_slot_with_hash (discriminator_per_locus
, (void *) &item
,
734 (hashval_t
) locus
, INSERT
);
736 if (*slot
== HTAB_EMPTY_ENTRY
)
738 *slot
= XNEW (struct locus_discrim_map
);
740 (*slot
)->locus
= locus
;
741 (*slot
)->discriminator
= 0;
743 (*slot
)->discriminator
++;
744 return (*slot
)->discriminator
;
747 /* Return TRUE if LOCUS1 and LOCUS2 refer to the same source line. */
750 same_line_p (location_t locus1
, location_t locus2
)
752 expanded_location from
, to
;
754 if (locus1
== locus2
)
757 from
= expand_location (locus1
);
758 to
= expand_location (locus2
);
760 if (from
.line
!= to
.line
)
762 if (from
.file
== to
.file
)
764 return (from
.file
!= NULL
766 && filename_cmp (from
.file
, to
.file
) == 0);
769 /* Assign a unique discriminator value to block BB if it begins at the same
770 LOCUS as its predecessor block. */
773 assign_discriminator (location_t locus
, basic_block bb
)
775 gimple first_in_to_bb
, last_in_to_bb
;
777 if (locus
== 0 || bb
->discriminator
!= 0)
780 first_in_to_bb
= first_non_label_stmt (bb
);
781 last_in_to_bb
= last_stmt (bb
);
782 if ((first_in_to_bb
&& same_line_p (locus
, gimple_location (first_in_to_bb
)))
783 || (last_in_to_bb
&& same_line_p (locus
, gimple_location (last_in_to_bb
))))
784 bb
->discriminator
= next_discriminator_for_locus (locus
);
787 /* Create the edges for a GIMPLE_COND starting at block BB. */
790 make_cond_expr_edges (basic_block bb
)
792 gimple entry
= last_stmt (bb
);
793 gimple then_stmt
, else_stmt
;
794 basic_block then_bb
, else_bb
;
795 tree then_label
, else_label
;
797 location_t entry_locus
;
800 gcc_assert (gimple_code (entry
) == GIMPLE_COND
);
802 entry_locus
= gimple_location (entry
);
804 /* Entry basic blocks for each component. */
805 then_label
= gimple_cond_true_label (entry
);
806 else_label
= gimple_cond_false_label (entry
);
807 then_bb
= label_to_block (then_label
);
808 else_bb
= label_to_block (else_label
);
809 then_stmt
= first_stmt (then_bb
);
810 else_stmt
= first_stmt (else_bb
);
812 e
= make_edge (bb
, then_bb
, EDGE_TRUE_VALUE
);
813 assign_discriminator (entry_locus
, then_bb
);
814 e
->goto_locus
= gimple_location (then_stmt
);
816 e
->goto_block
= gimple_block (then_stmt
);
817 e
= make_edge (bb
, else_bb
, EDGE_FALSE_VALUE
);
820 assign_discriminator (entry_locus
, else_bb
);
821 e
->goto_locus
= gimple_location (else_stmt
);
823 e
->goto_block
= gimple_block (else_stmt
);
826 /* We do not need the labels anymore. */
827 gimple_cond_set_true_label (entry
, NULL_TREE
);
828 gimple_cond_set_false_label (entry
, NULL_TREE
);
832 /* Called for each element in the hash table (P) as we delete the
833 edge to cases hash table.
835 Clear all the TREE_CHAINs to prevent problems with copying of
836 SWITCH_EXPRs and structure sharing rules, then free the hash table
840 edge_to_cases_cleanup (const void *key ATTRIBUTE_UNUSED
, void **value
,
841 void *data ATTRIBUTE_UNUSED
)
845 for (t
= (tree
) *value
; t
; t
= next
)
847 next
= CASE_CHAIN (t
);
848 CASE_CHAIN (t
) = NULL
;
855 /* Start recording information mapping edges to case labels. */
858 start_recording_case_labels (void)
860 gcc_assert (edge_to_cases
== NULL
);
861 edge_to_cases
= pointer_map_create ();
862 touched_switch_bbs
= BITMAP_ALLOC (NULL
);
865 /* Return nonzero if we are recording information for case labels. */
868 recording_case_labels_p (void)
870 return (edge_to_cases
!= NULL
);
873 /* Stop recording information mapping edges to case labels and
874 remove any information we have recorded. */
876 end_recording_case_labels (void)
880 pointer_map_traverse (edge_to_cases
, edge_to_cases_cleanup
, NULL
);
881 pointer_map_destroy (edge_to_cases
);
882 edge_to_cases
= NULL
;
883 EXECUTE_IF_SET_IN_BITMAP (touched_switch_bbs
, 0, i
, bi
)
885 basic_block bb
= BASIC_BLOCK (i
);
888 gimple stmt
= last_stmt (bb
);
889 if (stmt
&& gimple_code (stmt
) == GIMPLE_SWITCH
)
890 group_case_labels_stmt (stmt
);
893 BITMAP_FREE (touched_switch_bbs
);
896 /* If we are inside a {start,end}_recording_cases block, then return
897 a chain of CASE_LABEL_EXPRs from T which reference E.
899 Otherwise return NULL. */
902 get_cases_for_edge (edge e
, gimple t
)
907 /* If we are not recording cases, then we do not have CASE_LABEL_EXPR
908 chains available. Return NULL so the caller can detect this case. */
909 if (!recording_case_labels_p ())
912 slot
= pointer_map_contains (edge_to_cases
, e
);
916 /* If we did not find E in the hash table, then this must be the first
917 time we have been queried for information about E & T. Add all the
918 elements from T to the hash table then perform the query again. */
920 n
= gimple_switch_num_labels (t
);
921 for (i
= 0; i
< n
; i
++)
923 tree elt
= gimple_switch_label (t
, i
);
924 tree lab
= CASE_LABEL (elt
);
925 basic_block label_bb
= label_to_block (lab
);
926 edge this_edge
= find_edge (e
->src
, label_bb
);
928 /* Add it to the chain of CASE_LABEL_EXPRs referencing E, or create
930 slot
= pointer_map_insert (edge_to_cases
, this_edge
);
931 CASE_CHAIN (elt
) = (tree
) *slot
;
935 return (tree
) *pointer_map_contains (edge_to_cases
, e
);
938 /* Create the edges for a GIMPLE_SWITCH starting at block BB. */
941 make_gimple_switch_edges (basic_block bb
)
943 gimple entry
= last_stmt (bb
);
944 location_t entry_locus
;
947 entry_locus
= gimple_location (entry
);
949 n
= gimple_switch_num_labels (entry
);
951 for (i
= 0; i
< n
; ++i
)
953 tree lab
= CASE_LABEL (gimple_switch_label (entry
, i
));
954 basic_block label_bb
= label_to_block (lab
);
955 make_edge (bb
, label_bb
, 0);
956 assign_discriminator (entry_locus
, label_bb
);
961 /* Return the basic block holding label DEST. */
964 label_to_block_fn (struct function
*ifun
, tree dest
)
966 int uid
= LABEL_DECL_UID (dest
);
968 /* We would die hard when faced by an undefined label. Emit a label to
969 the very first basic block. This will hopefully make even the dataflow
970 and undefined variable warnings quite right. */
971 if (seen_error () && uid
< 0)
973 gimple_stmt_iterator gsi
= gsi_start_bb (BASIC_BLOCK (NUM_FIXED_BLOCKS
));
976 stmt
= gimple_build_label (dest
);
977 gsi_insert_before (&gsi
, stmt
, GSI_NEW_STMT
);
978 uid
= LABEL_DECL_UID (dest
);
980 if (VEC_length (basic_block
, ifun
->cfg
->x_label_to_block_map
)
981 <= (unsigned int) uid
)
983 return VEC_index (basic_block
, ifun
->cfg
->x_label_to_block_map
, uid
);
986 /* Create edges for an abnormal goto statement at block BB. If FOR_CALL
987 is true, the source statement is a CALL_EXPR instead of a GOTO_EXPR. */
990 make_abnormal_goto_edges (basic_block bb
, bool for_call
)
992 basic_block target_bb
;
993 gimple_stmt_iterator gsi
;
995 FOR_EACH_BB (target_bb
)
996 for (gsi
= gsi_start_bb (target_bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
998 gimple label_stmt
= gsi_stmt (gsi
);
1001 if (gimple_code (label_stmt
) != GIMPLE_LABEL
)
1004 target
= gimple_label_label (label_stmt
);
1006 /* Make an edge to every label block that has been marked as a
1007 potential target for a computed goto or a non-local goto. */
1008 if ((FORCED_LABEL (target
) && !for_call
)
1009 || (DECL_NONLOCAL (target
) && for_call
))
1011 make_edge (bb
, target_bb
, EDGE_ABNORMAL
);
1017 /* Create edges for a goto statement at block BB. */
1020 make_goto_expr_edges (basic_block bb
)
1022 gimple_stmt_iterator last
= gsi_last_bb (bb
);
1023 gimple goto_t
= gsi_stmt (last
);
1025 /* A simple GOTO creates normal edges. */
1026 if (simple_goto_p (goto_t
))
1028 tree dest
= gimple_goto_dest (goto_t
);
1029 basic_block label_bb
= label_to_block (dest
);
1030 edge e
= make_edge (bb
, label_bb
, EDGE_FALLTHRU
);
1031 e
->goto_locus
= gimple_location (goto_t
);
1032 assign_discriminator (e
->goto_locus
, label_bb
);
1034 e
->goto_block
= gimple_block (goto_t
);
1035 gsi_remove (&last
, true);
1039 /* A computed GOTO creates abnormal edges. */
1040 make_abnormal_goto_edges (bb
, false);
1043 /* Create edges for an asm statement with labels at block BB. */
1046 make_gimple_asm_edges (basic_block bb
)
1048 gimple stmt
= last_stmt (bb
);
1049 location_t stmt_loc
= gimple_location (stmt
);
1050 int i
, n
= gimple_asm_nlabels (stmt
);
1052 for (i
= 0; i
< n
; ++i
)
1054 tree label
= TREE_VALUE (gimple_asm_label_op (stmt
, i
));
1055 basic_block label_bb
= label_to_block (label
);
1056 make_edge (bb
, label_bb
, 0);
1057 assign_discriminator (stmt_loc
, label_bb
);
1061 /*---------------------------------------------------------------------------
1063 ---------------------------------------------------------------------------*/
1065 /* Cleanup useless labels in basic blocks. This is something we wish
1066 to do early because it allows us to group case labels before creating
1067 the edges for the CFG, and it speeds up block statement iterators in
1068 all passes later on.
1069 We rerun this pass after CFG is created, to get rid of the labels that
1070 are no longer referenced. After then we do not run it any more, since
1071 (almost) no new labels should be created. */
1073 /* A map from basic block index to the leading label of that block. */
1074 static struct label_record
1079 /* True if the label is referenced from somewhere. */
1083 /* Given LABEL return the first label in the same basic block. */
1086 main_block_label (tree label
)
1088 basic_block bb
= label_to_block (label
);
1089 tree main_label
= label_for_bb
[bb
->index
].label
;
1091 /* label_to_block possibly inserted undefined label into the chain. */
1094 label_for_bb
[bb
->index
].label
= label
;
1098 label_for_bb
[bb
->index
].used
= true;
1102 /* Clean up redundant labels within the exception tree. */
1105 cleanup_dead_labels_eh (void)
1112 if (cfun
->eh
== NULL
)
1115 for (i
= 1; VEC_iterate (eh_landing_pad
, cfun
->eh
->lp_array
, i
, lp
); ++i
)
1116 if (lp
&& lp
->post_landing_pad
)
1118 lab
= main_block_label (lp
->post_landing_pad
);
1119 if (lab
!= lp
->post_landing_pad
)
1121 EH_LANDING_PAD_NR (lp
->post_landing_pad
) = 0;
1122 EH_LANDING_PAD_NR (lab
) = lp
->index
;
1126 FOR_ALL_EH_REGION (r
)
1130 case ERT_MUST_NOT_THROW
:
1136 for (c
= r
->u
.eh_try
.first_catch
; c
; c
= c
->next_catch
)
1140 c
->label
= main_block_label (lab
);
1145 case ERT_ALLOWED_EXCEPTIONS
:
1146 lab
= r
->u
.allowed
.label
;
1148 r
->u
.allowed
.label
= main_block_label (lab
);
1154 /* Cleanup redundant labels. This is a three-step process:
1155 1) Find the leading label for each block.
1156 2) Redirect all references to labels to the leading labels.
1157 3) Cleanup all useless labels. */
1160 cleanup_dead_labels (void)
1163 label_for_bb
= XCNEWVEC (struct label_record
, last_basic_block
);
1165 /* Find a suitable label for each block. We use the first user-defined
1166 label if there is one, or otherwise just the first label we see. */
1169 gimple_stmt_iterator i
;
1171 for (i
= gsi_start_bb (bb
); !gsi_end_p (i
); gsi_next (&i
))
1174 gimple stmt
= gsi_stmt (i
);
1176 if (gimple_code (stmt
) != GIMPLE_LABEL
)
1179 label
= gimple_label_label (stmt
);
1181 /* If we have not yet seen a label for the current block,
1182 remember this one and see if there are more labels. */
1183 if (!label_for_bb
[bb
->index
].label
)
1185 label_for_bb
[bb
->index
].label
= label
;
1189 /* If we did see a label for the current block already, but it
1190 is an artificially created label, replace it if the current
1191 label is a user defined label. */
1192 if (!DECL_ARTIFICIAL (label
)
1193 && DECL_ARTIFICIAL (label_for_bb
[bb
->index
].label
))
1195 label_for_bb
[bb
->index
].label
= label
;
1201 /* Now redirect all jumps/branches to the selected label.
1202 First do so for each block ending in a control statement. */
1205 gimple stmt
= last_stmt (bb
);
1206 tree label
, new_label
;
1211 switch (gimple_code (stmt
))
1214 label
= gimple_cond_true_label (stmt
);
1217 new_label
= main_block_label (label
);
1218 if (new_label
!= label
)
1219 gimple_cond_set_true_label (stmt
, new_label
);
1222 label
= gimple_cond_false_label (stmt
);
1225 new_label
= main_block_label (label
);
1226 if (new_label
!= label
)
1227 gimple_cond_set_false_label (stmt
, new_label
);
1233 size_t i
, n
= gimple_switch_num_labels (stmt
);
1235 /* Replace all destination labels. */
1236 for (i
= 0; i
< n
; ++i
)
1238 tree case_label
= gimple_switch_label (stmt
, i
);
1239 label
= CASE_LABEL (case_label
);
1240 new_label
= main_block_label (label
);
1241 if (new_label
!= label
)
1242 CASE_LABEL (case_label
) = new_label
;
1249 int i
, n
= gimple_asm_nlabels (stmt
);
1251 for (i
= 0; i
< n
; ++i
)
1253 tree cons
= gimple_asm_label_op (stmt
, i
);
1254 tree label
= main_block_label (TREE_VALUE (cons
));
1255 TREE_VALUE (cons
) = label
;
1260 /* We have to handle gotos until they're removed, and we don't
1261 remove them until after we've created the CFG edges. */
1263 if (!computed_goto_p (stmt
))
1265 label
= gimple_goto_dest (stmt
);
1266 new_label
= main_block_label (label
);
1267 if (new_label
!= label
)
1268 gimple_goto_set_dest (stmt
, new_label
);
1272 case GIMPLE_TRANSACTION
:
1274 tree label
= gimple_transaction_label (stmt
);
1277 tree new_label
= main_block_label (label
);
1278 if (new_label
!= label
)
1279 gimple_transaction_set_label (stmt
, new_label
);
1289 /* Do the same for the exception region tree labels. */
1290 cleanup_dead_labels_eh ();
1292 /* Finally, purge dead labels. All user-defined labels and labels that
1293 can be the target of non-local gotos and labels which have their
1294 address taken are preserved. */
1297 gimple_stmt_iterator i
;
1298 tree label_for_this_bb
= label_for_bb
[bb
->index
].label
;
1300 if (!label_for_this_bb
)
1303 /* If the main label of the block is unused, we may still remove it. */
1304 if (!label_for_bb
[bb
->index
].used
)
1305 label_for_this_bb
= NULL
;
1307 for (i
= gsi_start_bb (bb
); !gsi_end_p (i
); )
1310 gimple stmt
= gsi_stmt (i
);
1312 if (gimple_code (stmt
) != GIMPLE_LABEL
)
1315 label
= gimple_label_label (stmt
);
1317 if (label
== label_for_this_bb
1318 || !DECL_ARTIFICIAL (label
)
1319 || DECL_NONLOCAL (label
)
1320 || FORCED_LABEL (label
))
1323 gsi_remove (&i
, true);
1327 free (label_for_bb
);
1330 /* Scan the sorted vector of cases in STMT (a GIMPLE_SWITCH) and combine
1331 the ones jumping to the same label.
1332 Eg. three separate entries 1: 2: 3: become one entry 1..3: */
1335 group_case_labels_stmt (gimple stmt
)
1337 int old_size
= gimple_switch_num_labels (stmt
);
1338 int i
, j
, new_size
= old_size
;
1339 tree default_case
= NULL_TREE
;
1340 tree default_label
= NULL_TREE
;
1343 /* The default label is always the first case in a switch
1344 statement after gimplification if it was not optimized
1346 if (!CASE_LOW (gimple_switch_default_label (stmt
))
1347 && !CASE_HIGH (gimple_switch_default_label (stmt
)))
1349 default_case
= gimple_switch_default_label (stmt
);
1350 default_label
= CASE_LABEL (default_case
);
1354 has_default
= false;
1356 /* Look for possible opportunities to merge cases. */
1361 while (i
< old_size
)
1363 tree base_case
, base_label
, base_high
;
1364 base_case
= gimple_switch_label (stmt
, i
);
1366 gcc_assert (base_case
);
1367 base_label
= CASE_LABEL (base_case
);
1369 /* Discard cases that have the same destination as the
1371 if (base_label
== default_label
)
1373 gimple_switch_set_label (stmt
, i
, NULL_TREE
);
1379 base_high
= CASE_HIGH (base_case
)
1380 ? CASE_HIGH (base_case
)
1381 : CASE_LOW (base_case
);
1384 /* Try to merge case labels. Break out when we reach the end
1385 of the label vector or when we cannot merge the next case
1386 label with the current one. */
1387 while (i
< old_size
)
1389 tree merge_case
= gimple_switch_label (stmt
, i
);
1390 tree merge_label
= CASE_LABEL (merge_case
);
1391 double_int bhp1
= double_int_add (tree_to_double_int (base_high
),
1394 /* Merge the cases if they jump to the same place,
1395 and their ranges are consecutive. */
1396 if (merge_label
== base_label
1397 && double_int_equal_p (tree_to_double_int (CASE_LOW (merge_case
)),
1400 base_high
= CASE_HIGH (merge_case
) ?
1401 CASE_HIGH (merge_case
) : CASE_LOW (merge_case
);
1402 CASE_HIGH (base_case
) = base_high
;
1403 gimple_switch_set_label (stmt
, i
, NULL_TREE
);
1412 /* Compress the case labels in the label vector, and adjust the
1413 length of the vector. */
1414 for (i
= 0, j
= 0; i
< new_size
; i
++)
1416 while (! gimple_switch_label (stmt
, j
))
1418 gimple_switch_set_label (stmt
, i
,
1419 gimple_switch_label (stmt
, j
++));
1422 gcc_assert (new_size
<= old_size
);
1423 gimple_switch_set_num_labels (stmt
, new_size
);
1426 /* Look for blocks ending in a multiway branch (a GIMPLE_SWITCH),
1427 and scan the sorted vector of cases. Combine the ones jumping to the
1431 group_case_labels (void)
1437 gimple stmt
= last_stmt (bb
);
1438 if (stmt
&& gimple_code (stmt
) == GIMPLE_SWITCH
)
1439 group_case_labels_stmt (stmt
);
1443 /* Checks whether we can merge block B into block A. */
1446 gimple_can_merge_blocks_p (basic_block a
, basic_block b
)
1449 gimple_stmt_iterator gsi
;
1452 if (!single_succ_p (a
))
1455 if (single_succ_edge (a
)->flags
& (EDGE_ABNORMAL
| EDGE_EH
| EDGE_PRESERVE
))
1458 if (single_succ (a
) != b
)
1461 if (!single_pred_p (b
))
1464 if (b
== EXIT_BLOCK_PTR
)
1467 /* If A ends by a statement causing exceptions or something similar, we
1468 cannot merge the blocks. */
1469 stmt
= last_stmt (a
);
1470 if (stmt
&& stmt_ends_bb_p (stmt
))
1473 /* Do not allow a block with only a non-local label to be merged. */
1475 && gimple_code (stmt
) == GIMPLE_LABEL
1476 && DECL_NONLOCAL (gimple_label_label (stmt
)))
1479 /* Examine the labels at the beginning of B. */
1480 for (gsi
= gsi_start_bb (b
); !gsi_end_p (gsi
); gsi_next (&gsi
))
1483 stmt
= gsi_stmt (gsi
);
1484 if (gimple_code (stmt
) != GIMPLE_LABEL
)
1486 lab
= gimple_label_label (stmt
);
1488 /* Do not remove user forced labels or for -O0 any user labels. */
1489 if (!DECL_ARTIFICIAL (lab
) && (!optimize
|| FORCED_LABEL (lab
)))
1493 /* Protect the loop latches. */
1494 if (current_loops
&& b
->loop_father
->latch
== b
)
1497 /* It must be possible to eliminate all phi nodes in B. If ssa form
1498 is not up-to-date and a name-mapping is registered, we cannot eliminate
1499 any phis. Symbols marked for renaming are never a problem though. */
1500 phis
= phi_nodes (b
);
1501 if (!gimple_seq_empty_p (phis
)
1502 && name_mappings_registered_p ())
1505 /* When not optimizing, don't merge if we'd lose goto_locus. */
1507 && single_succ_edge (a
)->goto_locus
!= UNKNOWN_LOCATION
)
1509 location_t goto_locus
= single_succ_edge (a
)->goto_locus
;
1510 gimple_stmt_iterator prev
, next
;
1511 prev
= gsi_last_nondebug_bb (a
);
1512 next
= gsi_after_labels (b
);
1513 if (!gsi_end_p (next
) && is_gimple_debug (gsi_stmt (next
)))
1514 gsi_next_nondebug (&next
);
1515 if ((gsi_end_p (prev
)
1516 || gimple_location (gsi_stmt (prev
)) != goto_locus
)
1517 && (gsi_end_p (next
)
1518 || gimple_location (gsi_stmt (next
)) != goto_locus
))
1525 /* Return true if the var whose chain of uses starts at PTR has no
1528 has_zero_uses_1 (const ssa_use_operand_t
*head
)
1530 const ssa_use_operand_t
*ptr
;
1532 for (ptr
= head
->next
; ptr
!= head
; ptr
= ptr
->next
)
1533 if (!is_gimple_debug (USE_STMT (ptr
)))
1539 /* Return true if the var whose chain of uses starts at PTR has a
1540 single nondebug use. Set USE_P and STMT to that single nondebug
1541 use, if so, or to NULL otherwise. */
1543 single_imm_use_1 (const ssa_use_operand_t
*head
,
1544 use_operand_p
*use_p
, gimple
*stmt
)
1546 ssa_use_operand_t
*ptr
, *single_use
= 0;
1548 for (ptr
= head
->next
; ptr
!= head
; ptr
= ptr
->next
)
1549 if (!is_gimple_debug (USE_STMT (ptr
)))
1560 *use_p
= single_use
;
1563 *stmt
= single_use
? single_use
->loc
.stmt
: NULL
;
1565 return !!single_use
;
1568 /* Replaces all uses of NAME by VAL. */
1571 replace_uses_by (tree name
, tree val
)
1573 imm_use_iterator imm_iter
;
1578 FOR_EACH_IMM_USE_STMT (stmt
, imm_iter
, name
)
1580 FOR_EACH_IMM_USE_ON_STMT (use
, imm_iter
)
1582 replace_exp (use
, val
);
1584 if (gimple_code (stmt
) == GIMPLE_PHI
)
1586 e
= gimple_phi_arg_edge (stmt
, PHI_ARG_INDEX_FROM_USE (use
));
1587 if (e
->flags
& EDGE_ABNORMAL
)
1589 /* This can only occur for virtual operands, since
1590 for the real ones SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name))
1591 would prevent replacement. */
1592 gcc_checking_assert (!is_gimple_reg (name
));
1593 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (val
) = 1;
1598 if (gimple_code (stmt
) != GIMPLE_PHI
)
1600 gimple_stmt_iterator gsi
= gsi_for_stmt (stmt
);
1601 gimple orig_stmt
= stmt
;
1604 /* Mark the block if we changed the last stmt in it. */
1605 if (cfgcleanup_altered_bbs
1606 && stmt_ends_bb_p (stmt
))
1607 bitmap_set_bit (cfgcleanup_altered_bbs
, gimple_bb (stmt
)->index
);
1609 /* FIXME. It shouldn't be required to keep TREE_CONSTANT
1610 on ADDR_EXPRs up-to-date on GIMPLE. Propagation will
1611 only change sth from non-invariant to invariant, and only
1612 when propagating constants. */
1613 if (is_gimple_min_invariant (val
))
1614 for (i
= 0; i
< gimple_num_ops (stmt
); i
++)
1616 tree op
= gimple_op (stmt
, i
);
1617 /* Operands may be empty here. For example, the labels
1618 of a GIMPLE_COND are nulled out following the creation
1619 of the corresponding CFG edges. */
1620 if (op
&& TREE_CODE (op
) == ADDR_EXPR
)
1621 recompute_tree_invariant_for_addr_expr (op
);
1624 if (fold_stmt (&gsi
))
1625 stmt
= gsi_stmt (gsi
);
1627 if (maybe_clean_or_replace_eh_stmt (orig_stmt
, stmt
))
1628 gimple_purge_dead_eh_edges (gimple_bb (stmt
));
1634 gcc_checking_assert (has_zero_uses (name
));
1636 /* Also update the trees stored in loop structures. */
1642 FOR_EACH_LOOP (li
, loop
, 0)
1644 substitute_in_loop_info (loop
, name
, val
);
1649 /* Merge block B into block A. */
1652 gimple_merge_blocks (basic_block a
, basic_block b
)
1654 gimple_stmt_iterator last
, gsi
, psi
;
1657 fprintf (dump_file
, "Merging blocks %d and %d\n", a
->index
, b
->index
);
1659 /* Remove all single-valued PHI nodes from block B of the form
1660 V_i = PHI <V_j> by propagating V_j to all the uses of V_i. */
1661 gsi
= gsi_last_bb (a
);
1662 for (psi
= gsi_start_phis (b
); !gsi_end_p (psi
); )
1664 gimple phi
= gsi_stmt (psi
);
1665 tree def
= gimple_phi_result (phi
), use
= gimple_phi_arg_def (phi
, 0);
1667 bool may_replace_uses
= !is_gimple_reg (def
)
1668 || may_propagate_copy (def
, use
);
1670 /* In case we maintain loop closed ssa form, do not propagate arguments
1671 of loop exit phi nodes. */
1673 && loops_state_satisfies_p (LOOP_CLOSED_SSA
)
1674 && is_gimple_reg (def
)
1675 && TREE_CODE (use
) == SSA_NAME
1676 && a
->loop_father
!= b
->loop_father
)
1677 may_replace_uses
= false;
1679 if (!may_replace_uses
)
1681 gcc_assert (is_gimple_reg (def
));
1683 /* Note that just emitting the copies is fine -- there is no problem
1684 with ordering of phi nodes. This is because A is the single
1685 predecessor of B, therefore results of the phi nodes cannot
1686 appear as arguments of the phi nodes. */
1687 copy
= gimple_build_assign (def
, use
);
1688 gsi_insert_after (&gsi
, copy
, GSI_NEW_STMT
);
1689 remove_phi_node (&psi
, false);
1693 /* If we deal with a PHI for virtual operands, we can simply
1694 propagate these without fussing with folding or updating
1696 if (!is_gimple_reg (def
))
1698 imm_use_iterator iter
;
1699 use_operand_p use_p
;
1702 FOR_EACH_IMM_USE_STMT (stmt
, iter
, def
)
1703 FOR_EACH_IMM_USE_ON_STMT (use_p
, iter
)
1704 SET_USE (use_p
, use
);
1706 if (SSA_NAME_OCCURS_IN_ABNORMAL_PHI (def
))
1707 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (use
) = 1;
1710 replace_uses_by (def
, use
);
1712 remove_phi_node (&psi
, true);
1716 /* Ensure that B follows A. */
1717 move_block_after (b
, a
);
1719 gcc_assert (single_succ_edge (a
)->flags
& EDGE_FALLTHRU
);
1720 gcc_assert (!last_stmt (a
) || !stmt_ends_bb_p (last_stmt (a
)));
1722 /* Remove labels from B and set gimple_bb to A for other statements. */
1723 for (gsi
= gsi_start_bb (b
); !gsi_end_p (gsi
);)
1725 gimple stmt
= gsi_stmt (gsi
);
1726 if (gimple_code (stmt
) == GIMPLE_LABEL
)
1728 tree label
= gimple_label_label (stmt
);
1731 gsi_remove (&gsi
, false);
1733 /* Now that we can thread computed gotos, we might have
1734 a situation where we have a forced label in block B
1735 However, the label at the start of block B might still be
1736 used in other ways (think about the runtime checking for
1737 Fortran assigned gotos). So we can not just delete the
1738 label. Instead we move the label to the start of block A. */
1739 if (FORCED_LABEL (label
))
1741 gimple_stmt_iterator dest_gsi
= gsi_start_bb (a
);
1742 gsi_insert_before (&dest_gsi
, stmt
, GSI_NEW_STMT
);
1744 /* Other user labels keep around in a form of a debug stmt. */
1745 else if (!DECL_ARTIFICIAL (label
) && MAY_HAVE_DEBUG_STMTS
)
1747 gimple dbg
= gimple_build_debug_bind (label
,
1750 gimple_debug_bind_reset_value (dbg
);
1751 gsi_insert_before (&gsi
, dbg
, GSI_SAME_STMT
);
1754 lp_nr
= EH_LANDING_PAD_NR (label
);
1757 eh_landing_pad lp
= get_eh_landing_pad_from_number (lp_nr
);
1758 lp
->post_landing_pad
= NULL
;
1763 gimple_set_bb (stmt
, a
);
1768 /* Merge the sequences. */
1769 last
= gsi_last_bb (a
);
1770 gsi_insert_seq_after (&last
, bb_seq (b
), GSI_NEW_STMT
);
1771 set_bb_seq (b
, NULL
);
1773 if (cfgcleanup_altered_bbs
)
1774 bitmap_set_bit (cfgcleanup_altered_bbs
, a
->index
);
1778 /* Return the one of two successors of BB that is not reachable by a
1779 complex edge, if there is one. Else, return BB. We use
1780 this in optimizations that use post-dominators for their heuristics,
1781 to catch the cases in C++ where function calls are involved. */
1784 single_noncomplex_succ (basic_block bb
)
1787 if (EDGE_COUNT (bb
->succs
) != 2)
1790 e0
= EDGE_SUCC (bb
, 0);
1791 e1
= EDGE_SUCC (bb
, 1);
1792 if (e0
->flags
& EDGE_COMPLEX
)
1794 if (e1
->flags
& EDGE_COMPLEX
)
1800 /* T is CALL_EXPR. Set current_function_calls_* flags. */
1803 notice_special_calls (gimple call
)
1805 int flags
= gimple_call_flags (call
);
1807 if (flags
& ECF_MAY_BE_ALLOCA
)
1808 cfun
->calls_alloca
= true;
1809 if (flags
& ECF_RETURNS_TWICE
)
1810 cfun
->calls_setjmp
= true;
1814 /* Clear flags set by notice_special_calls. Used by dead code removal
1815 to update the flags. */
1818 clear_special_calls (void)
1820 cfun
->calls_alloca
= false;
1821 cfun
->calls_setjmp
= false;
1824 /* Remove PHI nodes associated with basic block BB and all edges out of BB. */
1827 remove_phi_nodes_and_edges_for_unreachable_block (basic_block bb
)
1829 /* Since this block is no longer reachable, we can just delete all
1830 of its PHI nodes. */
1831 remove_phi_nodes (bb
);
1833 /* Remove edges to BB's successors. */
1834 while (EDGE_COUNT (bb
->succs
) > 0)
1835 remove_edge (EDGE_SUCC (bb
, 0));
1839 /* Remove statements of basic block BB. */
1842 remove_bb (basic_block bb
)
1844 gimple_stmt_iterator i
;
1848 fprintf (dump_file
, "Removing basic block %d\n", bb
->index
);
1849 if (dump_flags
& TDF_DETAILS
)
1851 dump_bb (bb
, dump_file
, 0);
1852 fprintf (dump_file
, "\n");
1858 struct loop
*loop
= bb
->loop_father
;
1860 /* If a loop gets removed, clean up the information associated
1862 if (loop
->latch
== bb
1863 || loop
->header
== bb
)
1864 free_numbers_of_iterations_estimates_loop (loop
);
1867 /* Remove all the instructions in the block. */
1868 if (bb_seq (bb
) != NULL
)
1870 /* Walk backwards so as to get a chance to substitute all
1871 released DEFs into debug stmts. See
1872 eliminate_unnecessary_stmts() in tree-ssa-dce.c for more
1874 for (i
= gsi_last_bb (bb
); !gsi_end_p (i
);)
1876 gimple stmt
= gsi_stmt (i
);
1877 if (gimple_code (stmt
) == GIMPLE_LABEL
1878 && (FORCED_LABEL (gimple_label_label (stmt
))
1879 || DECL_NONLOCAL (gimple_label_label (stmt
))))
1882 gimple_stmt_iterator new_gsi
;
1884 /* A non-reachable non-local label may still be referenced.
1885 But it no longer needs to carry the extra semantics of
1887 if (DECL_NONLOCAL (gimple_label_label (stmt
)))
1889 DECL_NONLOCAL (gimple_label_label (stmt
)) = 0;
1890 FORCED_LABEL (gimple_label_label (stmt
)) = 1;
1893 new_bb
= bb
->prev_bb
;
1894 new_gsi
= gsi_start_bb (new_bb
);
1895 gsi_remove (&i
, false);
1896 gsi_insert_before (&new_gsi
, stmt
, GSI_NEW_STMT
);
1900 /* Release SSA definitions if we are in SSA. Note that we
1901 may be called when not in SSA. For example,
1902 final_cleanup calls this function via
1903 cleanup_tree_cfg. */
1904 if (gimple_in_ssa_p (cfun
))
1905 release_defs (stmt
);
1907 gsi_remove (&i
, true);
1911 i
= gsi_last_bb (bb
);
1917 remove_phi_nodes_and_edges_for_unreachable_block (bb
);
1918 bb
->il
.gimple
.seq
= NULL
;
1919 bb
->il
.gimple
.phi_nodes
= NULL
;
1923 /* Given a basic block BB ending with COND_EXPR or SWITCH_EXPR, and a
1924 predicate VAL, return the edge that will be taken out of the block.
1925 If VAL does not match a unique edge, NULL is returned. */
1928 find_taken_edge (basic_block bb
, tree val
)
1932 stmt
= last_stmt (bb
);
1935 gcc_assert (is_ctrl_stmt (stmt
));
1940 if (!is_gimple_min_invariant (val
))
1943 if (gimple_code (stmt
) == GIMPLE_COND
)
1944 return find_taken_edge_cond_expr (bb
, val
);
1946 if (gimple_code (stmt
) == GIMPLE_SWITCH
)
1947 return find_taken_edge_switch_expr (bb
, val
);
1949 if (computed_goto_p (stmt
))
1951 /* Only optimize if the argument is a label, if the argument is
1952 not a label then we can not construct a proper CFG.
1954 It may be the case that we only need to allow the LABEL_REF to
1955 appear inside an ADDR_EXPR, but we also allow the LABEL_REF to
1956 appear inside a LABEL_EXPR just to be safe. */
1957 if ((TREE_CODE (val
) == ADDR_EXPR
|| TREE_CODE (val
) == LABEL_EXPR
)
1958 && TREE_CODE (TREE_OPERAND (val
, 0)) == LABEL_DECL
)
1959 return find_taken_edge_computed_goto (bb
, TREE_OPERAND (val
, 0));
1966 /* Given a constant value VAL and the entry block BB to a GOTO_EXPR
1967 statement, determine which of the outgoing edges will be taken out of the
1968 block. Return NULL if either edge may be taken. */
1971 find_taken_edge_computed_goto (basic_block bb
, tree val
)
1976 dest
= label_to_block (val
);
1979 e
= find_edge (bb
, dest
);
1980 gcc_assert (e
!= NULL
);
1986 /* Given a constant value VAL and the entry block BB to a COND_EXPR
1987 statement, determine which of the two edges will be taken out of the
1988 block. Return NULL if either edge may be taken. */
1991 find_taken_edge_cond_expr (basic_block bb
, tree val
)
1993 edge true_edge
, false_edge
;
1995 extract_true_false_edges_from_block (bb
, &true_edge
, &false_edge
);
1997 gcc_assert (TREE_CODE (val
) == INTEGER_CST
);
1998 return (integer_zerop (val
) ? false_edge
: true_edge
);
2001 /* Given an INTEGER_CST VAL and the entry block BB to a SWITCH_EXPR
2002 statement, determine which edge will be taken out of the block. Return
2003 NULL if any edge may be taken. */
2006 find_taken_edge_switch_expr (basic_block bb
, tree val
)
2008 basic_block dest_bb
;
2013 switch_stmt
= last_stmt (bb
);
2014 taken_case
= find_case_label_for_value (switch_stmt
, val
);
2015 dest_bb
= label_to_block (CASE_LABEL (taken_case
));
2017 e
= find_edge (bb
, dest_bb
);
2023 /* Return the CASE_LABEL_EXPR that SWITCH_STMT will take for VAL.
2024 We can make optimal use here of the fact that the case labels are
2025 sorted: We can do a binary search for a case matching VAL. */
2028 find_case_label_for_value (gimple switch_stmt
, tree val
)
2030 size_t low
, high
, n
= gimple_switch_num_labels (switch_stmt
);
2031 tree default_case
= gimple_switch_default_label (switch_stmt
);
2033 for (low
= 0, high
= n
; high
- low
> 1; )
2035 size_t i
= (high
+ low
) / 2;
2036 tree t
= gimple_switch_label (switch_stmt
, i
);
2039 /* Cache the result of comparing CASE_LOW and val. */
2040 cmp
= tree_int_cst_compare (CASE_LOW (t
), val
);
2047 if (CASE_HIGH (t
) == NULL
)
2049 /* A singe-valued case label. */
2055 /* A case range. We can only handle integer ranges. */
2056 if (cmp
<= 0 && tree_int_cst_compare (CASE_HIGH (t
), val
) >= 0)
2061 return default_case
;
2065 /* Dump a basic block on stderr. */
2068 gimple_debug_bb (basic_block bb
)
2070 gimple_dump_bb (bb
, stderr
, 0, TDF_VOPS
|TDF_MEMSYMS
);
2074 /* Dump basic block with index N on stderr. */
2077 gimple_debug_bb_n (int n
)
2079 gimple_debug_bb (BASIC_BLOCK (n
));
2080 return BASIC_BLOCK (n
);
2084 /* Dump the CFG on stderr.
2086 FLAGS are the same used by the tree dumping functions
2087 (see TDF_* in tree-pass.h). */
2090 gimple_debug_cfg (int flags
)
2092 gimple_dump_cfg (stderr
, flags
);
2096 /* Dump the program showing basic block boundaries on the given FILE.
2098 FLAGS are the same used by the tree dumping functions (see TDF_* in
2102 gimple_dump_cfg (FILE *file
, int flags
)
2104 if (flags
& TDF_DETAILS
)
2106 dump_function_header (file
, current_function_decl
, flags
);
2107 fprintf (file
, ";; \n%d basic blocks, %d edges, last basic block %d.\n\n",
2108 n_basic_blocks
, n_edges
, last_basic_block
);
2110 brief_dump_cfg (file
);
2111 fprintf (file
, "\n");
2114 if (flags
& TDF_STATS
)
2115 dump_cfg_stats (file
);
2117 dump_function_to_file (current_function_decl
, file
, flags
| TDF_BLOCKS
);
2121 /* Dump CFG statistics on FILE. */
2124 dump_cfg_stats (FILE *file
)
2126 static long max_num_merged_labels
= 0;
2127 unsigned long size
, total
= 0;
2130 const char * const fmt_str
= "%-30s%-13s%12s\n";
2131 const char * const fmt_str_1
= "%-30s%13d%11lu%c\n";
2132 const char * const fmt_str_2
= "%-30s%13ld%11lu%c\n";
2133 const char * const fmt_str_3
= "%-43s%11lu%c\n";
2134 const char *funcname
2135 = lang_hooks
.decl_printable_name (current_function_decl
, 2);
2138 fprintf (file
, "\nCFG Statistics for %s\n\n", funcname
);
2140 fprintf (file
, "---------------------------------------------------------\n");
2141 fprintf (file
, fmt_str
, "", " Number of ", "Memory");
2142 fprintf (file
, fmt_str
, "", " instances ", "used ");
2143 fprintf (file
, "---------------------------------------------------------\n");
2145 size
= n_basic_blocks
* sizeof (struct basic_block_def
);
2147 fprintf (file
, fmt_str_1
, "Basic blocks", n_basic_blocks
,
2148 SCALE (size
), LABEL (size
));
2152 num_edges
+= EDGE_COUNT (bb
->succs
);
2153 size
= num_edges
* sizeof (struct edge_def
);
2155 fprintf (file
, fmt_str_2
, "Edges", num_edges
, SCALE (size
), LABEL (size
));
2157 fprintf (file
, "---------------------------------------------------------\n");
2158 fprintf (file
, fmt_str_3
, "Total memory used by CFG data", SCALE (total
),
2160 fprintf (file
, "---------------------------------------------------------\n");
2161 fprintf (file
, "\n");
2163 if (cfg_stats
.num_merged_labels
> max_num_merged_labels
)
2164 max_num_merged_labels
= cfg_stats
.num_merged_labels
;
2166 fprintf (file
, "Coalesced label blocks: %ld (Max so far: %ld)\n",
2167 cfg_stats
.num_merged_labels
, max_num_merged_labels
);
2169 fprintf (file
, "\n");
2173 /* Dump CFG statistics on stderr. Keep extern so that it's always
2174 linked in the final executable. */
2177 debug_cfg_stats (void)
2179 dump_cfg_stats (stderr
);
2183 /* Dump the flowgraph to a .vcg FILE. */
2186 gimple_cfg2vcg (FILE *file
)
2191 const char *funcname
2192 = lang_hooks
.decl_printable_name (current_function_decl
, 2);
2194 /* Write the file header. */
2195 fprintf (file
, "graph: { title: \"%s\"\n", funcname
);
2196 fprintf (file
, "node: { title: \"ENTRY\" label: \"ENTRY\" }\n");
2197 fprintf (file
, "node: { title: \"EXIT\" label: \"EXIT\" }\n");
2199 /* Write blocks and edges. */
2200 FOR_EACH_EDGE (e
, ei
, ENTRY_BLOCK_PTR
->succs
)
2202 fprintf (file
, "edge: { sourcename: \"ENTRY\" targetname: \"%d\"",
2205 if (e
->flags
& EDGE_FAKE
)
2206 fprintf (file
, " linestyle: dotted priority: 10");
2208 fprintf (file
, " linestyle: solid priority: 100");
2210 fprintf (file
, " }\n");
2216 enum gimple_code head_code
, end_code
;
2217 const char *head_name
, *end_name
;
2220 gimple first
= first_stmt (bb
);
2221 gimple last
= last_stmt (bb
);
2225 head_code
= gimple_code (first
);
2226 head_name
= gimple_code_name
[head_code
];
2227 head_line
= get_lineno (first
);
2230 head_name
= "no-statement";
2234 end_code
= gimple_code (last
);
2235 end_name
= gimple_code_name
[end_code
];
2236 end_line
= get_lineno (last
);
2239 end_name
= "no-statement";
2241 fprintf (file
, "node: { title: \"%d\" label: \"#%d\\n%s (%d)\\n%s (%d)\"}\n",
2242 bb
->index
, bb
->index
, head_name
, head_line
, end_name
,
2245 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
2247 if (e
->dest
== EXIT_BLOCK_PTR
)
2248 fprintf (file
, "edge: { sourcename: \"%d\" targetname: \"EXIT\"", bb
->index
);
2250 fprintf (file
, "edge: { sourcename: \"%d\" targetname: \"%d\"", bb
->index
, e
->dest
->index
);
2252 if (e
->flags
& EDGE_FAKE
)
2253 fprintf (file
, " priority: 10 linestyle: dotted");
2255 fprintf (file
, " priority: 100 linestyle: solid");
2257 fprintf (file
, " }\n");
2260 if (bb
->next_bb
!= EXIT_BLOCK_PTR
)
2264 fputs ("}\n\n", file
);
2269 /*---------------------------------------------------------------------------
2270 Miscellaneous helpers
2271 ---------------------------------------------------------------------------*/
2273 /* Return true if T, a GIMPLE_CALL, can make an abnormal transfer of control
2274 flow. Transfers of control flow associated with EH are excluded. */
2277 call_can_make_abnormal_goto (gimple t
)
2279 /* If the function has no non-local labels, then a call cannot make an
2280 abnormal transfer of control. */
2281 if (!cfun
->has_nonlocal_label
)
2284 /* Likewise if the call has no side effects. */
2285 if (!gimple_has_side_effects (t
))
2288 /* Likewise if the called function is leaf. */
2289 if (gimple_call_flags (t
) & ECF_LEAF
)
2296 /* Return true if T can make an abnormal transfer of control flow.
2297 Transfers of control flow associated with EH are excluded. */
2300 stmt_can_make_abnormal_goto (gimple t
)
2302 if (computed_goto_p (t
))
2304 if (is_gimple_call (t
))
2305 return call_can_make_abnormal_goto (t
);
2310 /* Return true if T represents a stmt that always transfers control. */
2313 is_ctrl_stmt (gimple t
)
2315 switch (gimple_code (t
))
2329 /* Return true if T is a statement that may alter the flow of control
2330 (e.g., a call to a non-returning function). */
2333 is_ctrl_altering_stmt (gimple t
)
2337 switch (gimple_code (t
))
2341 int flags
= gimple_call_flags (t
);
2343 /* A call alters control flow if it can make an abnormal goto. */
2344 if (call_can_make_abnormal_goto (t
))
2347 /* A call also alters control flow if it does not return. */
2348 if (flags
& ECF_NORETURN
)
2351 /* TM ending statements have backedges out of the transaction.
2352 Return true so we split the basic block containing them.
2353 Note that the TM_BUILTIN test is merely an optimization. */
2354 if ((flags
& ECF_TM_BUILTIN
)
2355 && is_tm_ending_fndecl (gimple_call_fndecl (t
)))
2358 /* BUILT_IN_RETURN call is same as return statement. */
2359 if (gimple_call_builtin_p (t
, BUILT_IN_RETURN
))
2364 case GIMPLE_EH_DISPATCH
:
2365 /* EH_DISPATCH branches to the individual catch handlers at
2366 this level of a try or allowed-exceptions region. It can
2367 fallthru to the next statement as well. */
2371 if (gimple_asm_nlabels (t
) > 0)
2376 /* OpenMP directives alter control flow. */
2379 case GIMPLE_TRANSACTION
:
2380 /* A transaction start alters control flow. */
2387 /* If a statement can throw, it alters control flow. */
2388 return stmt_can_throw_internal (t
);
2392 /* Return true if T is a simple local goto. */
2395 simple_goto_p (gimple t
)
2397 return (gimple_code (t
) == GIMPLE_GOTO
2398 && TREE_CODE (gimple_goto_dest (t
)) == LABEL_DECL
);
2402 /* Return true if STMT should start a new basic block. PREV_STMT is
2403 the statement preceding STMT. It is used when STMT is a label or a
2404 case label. Labels should only start a new basic block if their
2405 previous statement wasn't a label. Otherwise, sequence of labels
2406 would generate unnecessary basic blocks that only contain a single
2410 stmt_starts_bb_p (gimple stmt
, gimple prev_stmt
)
2415 /* Labels start a new basic block only if the preceding statement
2416 wasn't a label of the same type. This prevents the creation of
2417 consecutive blocks that have nothing but a single label. */
2418 if (gimple_code (stmt
) == GIMPLE_LABEL
)
2420 /* Nonlocal and computed GOTO targets always start a new block. */
2421 if (DECL_NONLOCAL (gimple_label_label (stmt
))
2422 || FORCED_LABEL (gimple_label_label (stmt
)))
2425 if (prev_stmt
&& gimple_code (prev_stmt
) == GIMPLE_LABEL
)
2427 if (DECL_NONLOCAL (gimple_label_label (prev_stmt
)))
2430 cfg_stats
.num_merged_labels
++;
2441 /* Return true if T should end a basic block. */
2444 stmt_ends_bb_p (gimple t
)
2446 return is_ctrl_stmt (t
) || is_ctrl_altering_stmt (t
);
2449 /* Remove block annotations and other data structures. */
2452 delete_tree_cfg_annotations (void)
2454 label_to_block_map
= NULL
;
2458 /* Return the first statement in basic block BB. */
2461 first_stmt (basic_block bb
)
2463 gimple_stmt_iterator i
= gsi_start_bb (bb
);
2466 while (!gsi_end_p (i
) && is_gimple_debug ((stmt
= gsi_stmt (i
))))
2474 /* Return the first non-label statement in basic block BB. */
2477 first_non_label_stmt (basic_block bb
)
2479 gimple_stmt_iterator i
= gsi_start_bb (bb
);
2480 while (!gsi_end_p (i
) && gimple_code (gsi_stmt (i
)) == GIMPLE_LABEL
)
2482 return !gsi_end_p (i
) ? gsi_stmt (i
) : NULL
;
2485 /* Return the last statement in basic block BB. */
2488 last_stmt (basic_block bb
)
2490 gimple_stmt_iterator i
= gsi_last_bb (bb
);
2493 while (!gsi_end_p (i
) && is_gimple_debug ((stmt
= gsi_stmt (i
))))
2501 /* Return the last statement of an otherwise empty block. Return NULL
2502 if the block is totally empty, or if it contains more than one
2506 last_and_only_stmt (basic_block bb
)
2508 gimple_stmt_iterator i
= gsi_last_nondebug_bb (bb
);
2514 last
= gsi_stmt (i
);
2515 gsi_prev_nondebug (&i
);
2519 /* Empty statements should no longer appear in the instruction stream.
2520 Everything that might have appeared before should be deleted by
2521 remove_useless_stmts, and the optimizers should just gsi_remove
2522 instead of smashing with build_empty_stmt.
2524 Thus the only thing that should appear here in a block containing
2525 one executable statement is a label. */
2526 prev
= gsi_stmt (i
);
2527 if (gimple_code (prev
) == GIMPLE_LABEL
)
2533 /* Reinstall those PHI arguments queued in OLD_EDGE to NEW_EDGE. */
2536 reinstall_phi_args (edge new_edge
, edge old_edge
)
2538 edge_var_map_vector v
;
2541 gimple_stmt_iterator phis
;
2543 v
= redirect_edge_var_map_vector (old_edge
);
2547 for (i
= 0, phis
= gsi_start_phis (new_edge
->dest
);
2548 VEC_iterate (edge_var_map
, v
, i
, vm
) && !gsi_end_p (phis
);
2549 i
++, gsi_next (&phis
))
2551 gimple phi
= gsi_stmt (phis
);
2552 tree result
= redirect_edge_var_map_result (vm
);
2553 tree arg
= redirect_edge_var_map_def (vm
);
2555 gcc_assert (result
== gimple_phi_result (phi
));
2557 add_phi_arg (phi
, arg
, new_edge
, redirect_edge_var_map_location (vm
));
2560 redirect_edge_var_map_clear (old_edge
);
2563 /* Returns the basic block after which the new basic block created
2564 by splitting edge EDGE_IN should be placed. Tries to keep the new block
2565 near its "logical" location. This is of most help to humans looking
2566 at debugging dumps. */
2569 split_edge_bb_loc (edge edge_in
)
2571 basic_block dest
= edge_in
->dest
;
2572 basic_block dest_prev
= dest
->prev_bb
;
2576 edge e
= find_edge (dest_prev
, dest
);
2577 if (e
&& !(e
->flags
& EDGE_COMPLEX
))
2578 return edge_in
->src
;
2583 /* Split a (typically critical) edge EDGE_IN. Return the new block.
2584 Abort on abnormal edges. */
2587 gimple_split_edge (edge edge_in
)
2589 basic_block new_bb
, after_bb
, dest
;
2592 /* Abnormal edges cannot be split. */
2593 gcc_assert (!(edge_in
->flags
& EDGE_ABNORMAL
));
2595 dest
= edge_in
->dest
;
2597 after_bb
= split_edge_bb_loc (edge_in
);
2599 new_bb
= create_empty_bb (after_bb
);
2600 new_bb
->frequency
= EDGE_FREQUENCY (edge_in
);
2601 new_bb
->count
= edge_in
->count
;
2602 new_edge
= make_edge (new_bb
, dest
, EDGE_FALLTHRU
);
2603 new_edge
->probability
= REG_BR_PROB_BASE
;
2604 new_edge
->count
= edge_in
->count
;
2606 e
= redirect_edge_and_branch (edge_in
, new_bb
);
2607 gcc_assert (e
== edge_in
);
2608 reinstall_phi_args (new_edge
, e
);
2614 /* Verify properties of the address expression T with base object BASE. */
2617 verify_address (tree t
, tree base
)
2620 bool old_side_effects
;
2622 bool new_side_effects
;
2624 old_constant
= TREE_CONSTANT (t
);
2625 old_side_effects
= TREE_SIDE_EFFECTS (t
);
2627 recompute_tree_invariant_for_addr_expr (t
);
2628 new_side_effects
= TREE_SIDE_EFFECTS (t
);
2629 new_constant
= TREE_CONSTANT (t
);
2631 if (old_constant
!= new_constant
)
2633 error ("constant not recomputed when ADDR_EXPR changed");
2636 if (old_side_effects
!= new_side_effects
)
2638 error ("side effects not recomputed when ADDR_EXPR changed");
2642 if (!(TREE_CODE (base
) == VAR_DECL
2643 || TREE_CODE (base
) == PARM_DECL
2644 || TREE_CODE (base
) == RESULT_DECL
))
2647 if (DECL_GIMPLE_REG_P (base
))
2649 error ("DECL_GIMPLE_REG_P set on a variable with address taken");
2656 /* Callback for walk_tree, check that all elements with address taken are
2657 properly noticed as such. The DATA is an int* that is 1 if TP was seen
2658 inside a PHI node. */
2661 verify_expr (tree
*tp
, int *walk_subtrees
, void *data ATTRIBUTE_UNUSED
)
2668 /* Check operand N for being valid GIMPLE and give error MSG if not. */
2669 #define CHECK_OP(N, MSG) \
2670 do { if (!is_gimple_val (TREE_OPERAND (t, N))) \
2671 { error (MSG); return TREE_OPERAND (t, N); }} while (0)
2673 switch (TREE_CODE (t
))
2676 if (SSA_NAME_IN_FREE_LIST (t
))
2678 error ("SSA name in freelist but still referenced");
2684 error ("INDIRECT_REF in gimple IL");
2688 x
= TREE_OPERAND (t
, 0);
2689 if (!POINTER_TYPE_P (TREE_TYPE (x
))
2690 || !is_gimple_mem_ref_addr (x
))
2692 error ("invalid first operand of MEM_REF");
2695 if (TREE_CODE (TREE_OPERAND (t
, 1)) != INTEGER_CST
2696 || !POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (t
, 1))))
2698 error ("invalid offset operand of MEM_REF");
2699 return TREE_OPERAND (t
, 1);
2701 if (TREE_CODE (x
) == ADDR_EXPR
2702 && (x
= verify_address (x
, TREE_OPERAND (x
, 0))))
2708 x
= fold (ASSERT_EXPR_COND (t
));
2709 if (x
== boolean_false_node
)
2711 error ("ASSERT_EXPR with an always-false condition");
2717 error ("MODIFY_EXPR not expected while having tuples");
2724 gcc_assert (is_gimple_address (t
));
2726 /* Skip any references (they will be checked when we recurse down the
2727 tree) and ensure that any variable used as a prefix is marked
2729 for (x
= TREE_OPERAND (t
, 0);
2730 handled_component_p (x
);
2731 x
= TREE_OPERAND (x
, 0))
2734 if ((tem
= verify_address (t
, x
)))
2737 if (!(TREE_CODE (x
) == VAR_DECL
2738 || TREE_CODE (x
) == PARM_DECL
2739 || TREE_CODE (x
) == RESULT_DECL
))
2742 if (!TREE_ADDRESSABLE (x
))
2744 error ("address taken, but ADDRESSABLE bit not set");
2752 x
= COND_EXPR_COND (t
);
2753 if (!INTEGRAL_TYPE_P (TREE_TYPE (x
)))
2755 error ("non-integral used in condition");
2758 if (!is_gimple_condexpr (x
))
2760 error ("invalid conditional operand");
2765 case NON_LVALUE_EXPR
:
2766 case TRUTH_NOT_EXPR
:
2770 case FIX_TRUNC_EXPR
:
2775 CHECK_OP (0, "invalid operand to unary operator");
2782 case ARRAY_RANGE_REF
:
2784 case VIEW_CONVERT_EXPR
:
2785 /* We have a nest of references. Verify that each of the operands
2786 that determine where to reference is either a constant or a variable,
2787 verify that the base is valid, and then show we've already checked
2789 while (handled_component_p (t
))
2791 if (TREE_CODE (t
) == COMPONENT_REF
&& TREE_OPERAND (t
, 2))
2792 CHECK_OP (2, "invalid COMPONENT_REF offset operator");
2793 else if (TREE_CODE (t
) == ARRAY_REF
2794 || TREE_CODE (t
) == ARRAY_RANGE_REF
)
2796 CHECK_OP (1, "invalid array index");
2797 if (TREE_OPERAND (t
, 2))
2798 CHECK_OP (2, "invalid array lower bound");
2799 if (TREE_OPERAND (t
, 3))
2800 CHECK_OP (3, "invalid array stride");
2802 else if (TREE_CODE (t
) == BIT_FIELD_REF
)
2804 if (!host_integerp (TREE_OPERAND (t
, 1), 1)
2805 || !host_integerp (TREE_OPERAND (t
, 2), 1))
2807 error ("invalid position or size operand to BIT_FIELD_REF");
2810 if (INTEGRAL_TYPE_P (TREE_TYPE (t
))
2811 && (TYPE_PRECISION (TREE_TYPE (t
))
2812 != TREE_INT_CST_LOW (TREE_OPERAND (t
, 1))))
2814 error ("integral result type precision does not match "
2815 "field size of BIT_FIELD_REF");
2818 else if (!INTEGRAL_TYPE_P (TREE_TYPE (t
))
2819 && !AGGREGATE_TYPE_P (TREE_TYPE (t
))
2820 && TYPE_MODE (TREE_TYPE (t
)) != BLKmode
2821 && (GET_MODE_PRECISION (TYPE_MODE (TREE_TYPE (t
)))
2822 != TREE_INT_CST_LOW (TREE_OPERAND (t
, 1))))
2824 error ("mode precision of non-integral result does not "
2825 "match field size of BIT_FIELD_REF");
2830 t
= TREE_OPERAND (t
, 0);
2833 if (!is_gimple_min_invariant (t
) && !is_gimple_lvalue (t
))
2835 error ("invalid reference prefix");
2842 /* PLUS_EXPR and MINUS_EXPR don't work on pointers, they should be done using
2843 POINTER_PLUS_EXPR. */
2844 if (POINTER_TYPE_P (TREE_TYPE (t
)))
2846 error ("invalid operand to plus/minus, type is a pointer");
2849 CHECK_OP (0, "invalid operand to binary operator");
2850 CHECK_OP (1, "invalid operand to binary operator");
2853 case POINTER_PLUS_EXPR
:
2854 /* Check to make sure the first operand is a pointer or reference type. */
2855 if (!POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (t
, 0))))
2857 error ("invalid operand to pointer plus, first operand is not a pointer");
2860 /* Check to make sure the second operand is a ptrofftype. */
2861 if (!ptrofftype_p (TREE_TYPE (TREE_OPERAND (t
, 1))))
2863 error ("invalid operand to pointer plus, second operand is not an "
2864 "integer type of appropriate width");
2874 case UNORDERED_EXPR
:
2883 case TRUNC_DIV_EXPR
:
2885 case FLOOR_DIV_EXPR
:
2886 case ROUND_DIV_EXPR
:
2887 case TRUNC_MOD_EXPR
:
2889 case FLOOR_MOD_EXPR
:
2890 case ROUND_MOD_EXPR
:
2892 case EXACT_DIV_EXPR
:
2902 CHECK_OP (0, "invalid operand to binary operator");
2903 CHECK_OP (1, "invalid operand to binary operator");
2907 if (TREE_CONSTANT (t
) && TREE_CODE (TREE_TYPE (t
)) == VECTOR_TYPE
)
2911 case CASE_LABEL_EXPR
:
2914 error ("invalid CASE_CHAIN");
2928 /* Verify if EXPR is either a GIMPLE ID or a GIMPLE indirect reference.
2929 Returns true if there is an error, otherwise false. */
2932 verify_types_in_gimple_min_lval (tree expr
)
2936 if (is_gimple_id (expr
))
2939 if (TREE_CODE (expr
) != TARGET_MEM_REF
2940 && TREE_CODE (expr
) != MEM_REF
)
2942 error ("invalid expression for min lvalue");
2946 /* TARGET_MEM_REFs are strange beasts. */
2947 if (TREE_CODE (expr
) == TARGET_MEM_REF
)
2950 op
= TREE_OPERAND (expr
, 0);
2951 if (!is_gimple_val (op
))
2953 error ("invalid operand in indirect reference");
2954 debug_generic_stmt (op
);
2957 /* Memory references now generally can involve a value conversion. */
2962 /* Verify if EXPR is a valid GIMPLE reference expression. If
2963 REQUIRE_LVALUE is true verifies it is an lvalue. Returns true
2964 if there is an error, otherwise false. */
2967 verify_types_in_gimple_reference (tree expr
, bool require_lvalue
)
2969 while (handled_component_p (expr
))
2971 tree op
= TREE_OPERAND (expr
, 0);
2973 if (TREE_CODE (expr
) == ARRAY_REF
2974 || TREE_CODE (expr
) == ARRAY_RANGE_REF
)
2976 if (!is_gimple_val (TREE_OPERAND (expr
, 1))
2977 || (TREE_OPERAND (expr
, 2)
2978 && !is_gimple_val (TREE_OPERAND (expr
, 2)))
2979 || (TREE_OPERAND (expr
, 3)
2980 && !is_gimple_val (TREE_OPERAND (expr
, 3))))
2982 error ("invalid operands to array reference");
2983 debug_generic_stmt (expr
);
2988 /* Verify if the reference array element types are compatible. */
2989 if (TREE_CODE (expr
) == ARRAY_REF
2990 && !useless_type_conversion_p (TREE_TYPE (expr
),
2991 TREE_TYPE (TREE_TYPE (op
))))
2993 error ("type mismatch in array reference");
2994 debug_generic_stmt (TREE_TYPE (expr
));
2995 debug_generic_stmt (TREE_TYPE (TREE_TYPE (op
)));
2998 if (TREE_CODE (expr
) == ARRAY_RANGE_REF
2999 && !useless_type_conversion_p (TREE_TYPE (TREE_TYPE (expr
)),
3000 TREE_TYPE (TREE_TYPE (op
))))
3002 error ("type mismatch in array range reference");
3003 debug_generic_stmt (TREE_TYPE (TREE_TYPE (expr
)));
3004 debug_generic_stmt (TREE_TYPE (TREE_TYPE (op
)));
3008 if ((TREE_CODE (expr
) == REALPART_EXPR
3009 || TREE_CODE (expr
) == IMAGPART_EXPR
)
3010 && !useless_type_conversion_p (TREE_TYPE (expr
),
3011 TREE_TYPE (TREE_TYPE (op
))))
3013 error ("type mismatch in real/imagpart reference");
3014 debug_generic_stmt (TREE_TYPE (expr
));
3015 debug_generic_stmt (TREE_TYPE (TREE_TYPE (op
)));
3019 if (TREE_CODE (expr
) == COMPONENT_REF
3020 && !useless_type_conversion_p (TREE_TYPE (expr
),
3021 TREE_TYPE (TREE_OPERAND (expr
, 1))))
3023 error ("type mismatch in component reference");
3024 debug_generic_stmt (TREE_TYPE (expr
));
3025 debug_generic_stmt (TREE_TYPE (TREE_OPERAND (expr
, 1)));
3029 if (TREE_CODE (expr
) == VIEW_CONVERT_EXPR
)
3031 /* For VIEW_CONVERT_EXPRs which are allowed here too, we only check
3032 that their operand is not an SSA name or an invariant when
3033 requiring an lvalue (this usually means there is a SRA or IPA-SRA
3034 bug). Otherwise there is nothing to verify, gross mismatches at
3035 most invoke undefined behavior. */
3037 && (TREE_CODE (op
) == SSA_NAME
3038 || is_gimple_min_invariant (op
)))
3040 error ("conversion of an SSA_NAME on the left hand side");
3041 debug_generic_stmt (expr
);
3044 else if (TREE_CODE (op
) == SSA_NAME
3045 && TYPE_SIZE (TREE_TYPE (expr
)) != TYPE_SIZE (TREE_TYPE (op
)))
3047 error ("conversion of register to a different size");
3048 debug_generic_stmt (expr
);
3051 else if (!handled_component_p (op
))
3058 if (TREE_CODE (expr
) == MEM_REF
)
3060 if (!is_gimple_mem_ref_addr (TREE_OPERAND (expr
, 0)))
3062 error ("invalid address operand in MEM_REF");
3063 debug_generic_stmt (expr
);
3066 if (TREE_CODE (TREE_OPERAND (expr
, 1)) != INTEGER_CST
3067 || !POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (expr
, 1))))
3069 error ("invalid offset operand in MEM_REF");
3070 debug_generic_stmt (expr
);
3074 else if (TREE_CODE (expr
) == TARGET_MEM_REF
)
3076 if (!TMR_BASE (expr
)
3077 || !is_gimple_mem_ref_addr (TMR_BASE (expr
)))
3079 error ("invalid address operand in TARGET_MEM_REF");
3082 if (!TMR_OFFSET (expr
)
3083 || TREE_CODE (TMR_OFFSET (expr
)) != INTEGER_CST
3084 || !POINTER_TYPE_P (TREE_TYPE (TMR_OFFSET (expr
))))
3086 error ("invalid offset operand in TARGET_MEM_REF");
3087 debug_generic_stmt (expr
);
3092 return ((require_lvalue
|| !is_gimple_min_invariant (expr
))
3093 && verify_types_in_gimple_min_lval (expr
));
3096 /* Returns true if there is one pointer type in TYPE_POINTER_TO (SRC_OBJ)
3097 list of pointer-to types that is trivially convertible to DEST. */
3100 one_pointer_to_useless_type_conversion_p (tree dest
, tree src_obj
)
3104 if (!TYPE_POINTER_TO (src_obj
))
3107 for (src
= TYPE_POINTER_TO (src_obj
); src
; src
= TYPE_NEXT_PTR_TO (src
))
3108 if (useless_type_conversion_p (dest
, src
))
3114 /* Return true if TYPE1 is a fixed-point type and if conversions to and
3115 from TYPE2 can be handled by FIXED_CONVERT_EXPR. */
3118 valid_fixed_convert_types_p (tree type1
, tree type2
)
3120 return (FIXED_POINT_TYPE_P (type1
)
3121 && (INTEGRAL_TYPE_P (type2
)
3122 || SCALAR_FLOAT_TYPE_P (type2
)
3123 || FIXED_POINT_TYPE_P (type2
)));
3126 /* Verify the contents of a GIMPLE_CALL STMT. Returns true when there
3127 is a problem, otherwise false. */
3130 verify_gimple_call (gimple stmt
)
3132 tree fn
= gimple_call_fn (stmt
);
3133 tree fntype
, fndecl
;
3136 if (gimple_call_internal_p (stmt
))
3140 error ("gimple call has two targets");
3141 debug_generic_stmt (fn
);
3149 error ("gimple call has no target");
3154 if (fn
&& !is_gimple_call_addr (fn
))
3156 error ("invalid function in gimple call");
3157 debug_generic_stmt (fn
);
3162 && (!POINTER_TYPE_P (TREE_TYPE (fn
))
3163 || (TREE_CODE (TREE_TYPE (TREE_TYPE (fn
))) != FUNCTION_TYPE
3164 && TREE_CODE (TREE_TYPE (TREE_TYPE (fn
))) != METHOD_TYPE
)))
3166 error ("non-function in gimple call");
3170 fndecl
= gimple_call_fndecl (stmt
);
3172 && TREE_CODE (fndecl
) == FUNCTION_DECL
3173 && DECL_LOOPING_CONST_OR_PURE_P (fndecl
)
3174 && !DECL_PURE_P (fndecl
)
3175 && !TREE_READONLY (fndecl
))
3177 error ("invalid pure const state for function");
3181 if (gimple_call_lhs (stmt
)
3182 && (!is_gimple_lvalue (gimple_call_lhs (stmt
))
3183 || verify_types_in_gimple_reference (gimple_call_lhs (stmt
), true)))
3185 error ("invalid LHS in gimple call");
3189 if (gimple_call_lhs (stmt
) && gimple_call_noreturn_p (stmt
))
3191 error ("LHS in noreturn call");
3195 fntype
= gimple_call_fntype (stmt
);
3197 && gimple_call_lhs (stmt
)
3198 && !useless_type_conversion_p (TREE_TYPE (gimple_call_lhs (stmt
)),
3200 /* ??? At least C++ misses conversions at assignments from
3201 void * call results.
3202 ??? Java is completely off. Especially with functions
3203 returning java.lang.Object.
3204 For now simply allow arbitrary pointer type conversions. */
3205 && !(POINTER_TYPE_P (TREE_TYPE (gimple_call_lhs (stmt
)))
3206 && POINTER_TYPE_P (TREE_TYPE (fntype
))))
3208 error ("invalid conversion in gimple call");
3209 debug_generic_stmt (TREE_TYPE (gimple_call_lhs (stmt
)));
3210 debug_generic_stmt (TREE_TYPE (fntype
));
3214 if (gimple_call_chain (stmt
)
3215 && !is_gimple_val (gimple_call_chain (stmt
)))
3217 error ("invalid static chain in gimple call");
3218 debug_generic_stmt (gimple_call_chain (stmt
));
3222 /* If there is a static chain argument, this should not be an indirect
3223 call, and the decl should have DECL_STATIC_CHAIN set. */
3224 if (gimple_call_chain (stmt
))
3226 if (!gimple_call_fndecl (stmt
))
3228 error ("static chain in indirect gimple call");
3231 fn
= TREE_OPERAND (fn
, 0);
3233 if (!DECL_STATIC_CHAIN (fn
))
3235 error ("static chain with function that doesn%'t use one");
3240 /* ??? The C frontend passes unpromoted arguments in case it
3241 didn't see a function declaration before the call. So for now
3242 leave the call arguments mostly unverified. Once we gimplify
3243 unit-at-a-time we have a chance to fix this. */
3245 for (i
= 0; i
< gimple_call_num_args (stmt
); ++i
)
3247 tree arg
= gimple_call_arg (stmt
, i
);
3248 if ((is_gimple_reg_type (TREE_TYPE (arg
))
3249 && !is_gimple_val (arg
))
3250 || (!is_gimple_reg_type (TREE_TYPE (arg
))
3251 && !is_gimple_lvalue (arg
)))
3253 error ("invalid argument to gimple call");
3254 debug_generic_expr (arg
);
3262 /* Verifies the gimple comparison with the result type TYPE and
3263 the operands OP0 and OP1. */
3266 verify_gimple_comparison (tree type
, tree op0
, tree op1
)
3268 tree op0_type
= TREE_TYPE (op0
);
3269 tree op1_type
= TREE_TYPE (op1
);
3271 if (!is_gimple_val (op0
) || !is_gimple_val (op1
))
3273 error ("invalid operands in gimple comparison");
3277 /* For comparisons we do not have the operations type as the
3278 effective type the comparison is carried out in. Instead
3279 we require that either the first operand is trivially
3280 convertible into the second, or the other way around.
3281 Because we special-case pointers to void we allow
3282 comparisons of pointers with the same mode as well. */
3283 if (!useless_type_conversion_p (op0_type
, op1_type
)
3284 && !useless_type_conversion_p (op1_type
, op0_type
)
3285 && (!POINTER_TYPE_P (op0_type
)
3286 || !POINTER_TYPE_P (op1_type
)
3287 || TYPE_MODE (op0_type
) != TYPE_MODE (op1_type
)))
3289 error ("mismatching comparison operand types");
3290 debug_generic_expr (op0_type
);
3291 debug_generic_expr (op1_type
);
3295 /* The resulting type of a comparison may be an effective boolean type. */
3296 if (INTEGRAL_TYPE_P (type
)
3297 && (TREE_CODE (type
) == BOOLEAN_TYPE
3298 || TYPE_PRECISION (type
) == 1))
3300 /* Or an integer vector type with the same size and element count
3301 as the comparison operand types. */
3302 else if (TREE_CODE (type
) == VECTOR_TYPE
3303 && TREE_CODE (TREE_TYPE (type
)) == INTEGER_TYPE
)
3305 if (TREE_CODE (op0_type
) != VECTOR_TYPE
3306 || TREE_CODE (op1_type
) != VECTOR_TYPE
)
3308 error ("non-vector operands in vector comparison");
3309 debug_generic_expr (op0_type
);
3310 debug_generic_expr (op1_type
);
3314 if (TYPE_VECTOR_SUBPARTS (type
) != TYPE_VECTOR_SUBPARTS (op0_type
)
3315 || (GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (type
)))
3316 != GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (op0_type
)))))
3318 error ("invalid vector comparison resulting type");
3319 debug_generic_expr (type
);
3325 error ("bogus comparison result type");
3326 debug_generic_expr (type
);
3333 /* Verify a gimple assignment statement STMT with an unary rhs.
3334 Returns true if anything is wrong. */
3337 verify_gimple_assign_unary (gimple stmt
)
3339 enum tree_code rhs_code
= gimple_assign_rhs_code (stmt
);
3340 tree lhs
= gimple_assign_lhs (stmt
);
3341 tree lhs_type
= TREE_TYPE (lhs
);
3342 tree rhs1
= gimple_assign_rhs1 (stmt
);
3343 tree rhs1_type
= TREE_TYPE (rhs1
);
3345 if (!is_gimple_reg (lhs
))
3347 error ("non-register as LHS of unary operation");
3351 if (!is_gimple_val (rhs1
))
3353 error ("invalid operand in unary operation");
3357 /* First handle conversions. */
3362 /* Allow conversions from pointer type to integral type only if
3363 there is no sign or zero extension involved.
3364 For targets were the precision of ptrofftype doesn't match that
3365 of pointers we need to allow arbitrary conversions to ptrofftype. */
3366 if ((POINTER_TYPE_P (lhs_type
)
3367 && INTEGRAL_TYPE_P (rhs1_type
))
3368 || (POINTER_TYPE_P (rhs1_type
)
3369 && INTEGRAL_TYPE_P (lhs_type
)
3370 && (TYPE_PRECISION (rhs1_type
) >= TYPE_PRECISION (lhs_type
)
3371 || ptrofftype_p (sizetype
))))
3374 /* Allow conversion from integral to offset type and vice versa. */
3375 if ((TREE_CODE (lhs_type
) == OFFSET_TYPE
3376 && INTEGRAL_TYPE_P (rhs1_type
))
3377 || (INTEGRAL_TYPE_P (lhs_type
)
3378 && TREE_CODE (rhs1_type
) == OFFSET_TYPE
))
3381 /* Otherwise assert we are converting between types of the
3383 if (INTEGRAL_TYPE_P (lhs_type
) != INTEGRAL_TYPE_P (rhs1_type
))
3385 error ("invalid types in nop conversion");
3386 debug_generic_expr (lhs_type
);
3387 debug_generic_expr (rhs1_type
);
3394 case ADDR_SPACE_CONVERT_EXPR
:
3396 if (!POINTER_TYPE_P (rhs1_type
) || !POINTER_TYPE_P (lhs_type
)
3397 || (TYPE_ADDR_SPACE (TREE_TYPE (rhs1_type
))
3398 == TYPE_ADDR_SPACE (TREE_TYPE (lhs_type
))))
3400 error ("invalid types in address space conversion");
3401 debug_generic_expr (lhs_type
);
3402 debug_generic_expr (rhs1_type
);
3409 case FIXED_CONVERT_EXPR
:
3411 if (!valid_fixed_convert_types_p (lhs_type
, rhs1_type
)
3412 && !valid_fixed_convert_types_p (rhs1_type
, lhs_type
))
3414 error ("invalid types in fixed-point conversion");
3415 debug_generic_expr (lhs_type
);
3416 debug_generic_expr (rhs1_type
);
3425 if ((!INTEGRAL_TYPE_P (rhs1_type
) || !SCALAR_FLOAT_TYPE_P (lhs_type
))
3426 && (!VECTOR_INTEGER_TYPE_P (rhs1_type
)
3427 || !VECTOR_FLOAT_TYPE_P(lhs_type
)))
3429 error ("invalid types in conversion to floating point");
3430 debug_generic_expr (lhs_type
);
3431 debug_generic_expr (rhs1_type
);
3438 case FIX_TRUNC_EXPR
:
3440 if ((!INTEGRAL_TYPE_P (lhs_type
) || !SCALAR_FLOAT_TYPE_P (rhs1_type
))
3441 && (!VECTOR_INTEGER_TYPE_P (lhs_type
)
3442 || !VECTOR_FLOAT_TYPE_P(rhs1_type
)))
3444 error ("invalid types in conversion to integer");
3445 debug_generic_expr (lhs_type
);
3446 debug_generic_expr (rhs1_type
);
3453 case VEC_UNPACK_HI_EXPR
:
3454 case VEC_UNPACK_LO_EXPR
:
3455 case REDUC_MAX_EXPR
:
3456 case REDUC_MIN_EXPR
:
3457 case REDUC_PLUS_EXPR
:
3458 case VEC_UNPACK_FLOAT_HI_EXPR
:
3459 case VEC_UNPACK_FLOAT_LO_EXPR
:
3467 case NON_LVALUE_EXPR
:
3475 /* For the remaining codes assert there is no conversion involved. */
3476 if (!useless_type_conversion_p (lhs_type
, rhs1_type
))
3478 error ("non-trivial conversion in unary operation");
3479 debug_generic_expr (lhs_type
);
3480 debug_generic_expr (rhs1_type
);
3487 /* Verify a gimple assignment statement STMT with a binary rhs.
3488 Returns true if anything is wrong. */
3491 verify_gimple_assign_binary (gimple stmt
)
3493 enum tree_code rhs_code
= gimple_assign_rhs_code (stmt
);
3494 tree lhs
= gimple_assign_lhs (stmt
);
3495 tree lhs_type
= TREE_TYPE (lhs
);
3496 tree rhs1
= gimple_assign_rhs1 (stmt
);
3497 tree rhs1_type
= TREE_TYPE (rhs1
);
3498 tree rhs2
= gimple_assign_rhs2 (stmt
);
3499 tree rhs2_type
= TREE_TYPE (rhs2
);
3501 if (!is_gimple_reg (lhs
))
3503 error ("non-register as LHS of binary operation");
3507 if (!is_gimple_val (rhs1
)
3508 || !is_gimple_val (rhs2
))
3510 error ("invalid operands in binary operation");
3514 /* First handle operations that involve different types. */
3519 if (TREE_CODE (lhs_type
) != COMPLEX_TYPE
3520 || !(INTEGRAL_TYPE_P (rhs1_type
)
3521 || SCALAR_FLOAT_TYPE_P (rhs1_type
))
3522 || !(INTEGRAL_TYPE_P (rhs2_type
)
3523 || SCALAR_FLOAT_TYPE_P (rhs2_type
)))
3525 error ("type mismatch in complex expression");
3526 debug_generic_expr (lhs_type
);
3527 debug_generic_expr (rhs1_type
);
3528 debug_generic_expr (rhs2_type
);
3540 /* Shifts and rotates are ok on integral types, fixed point
3541 types and integer vector types. */
3542 if ((!INTEGRAL_TYPE_P (rhs1_type
)
3543 && !FIXED_POINT_TYPE_P (rhs1_type
)
3544 && !(TREE_CODE (rhs1_type
) == VECTOR_TYPE
3545 && INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type
))))
3546 || (!INTEGRAL_TYPE_P (rhs2_type
)
3547 /* Vector shifts of vectors are also ok. */
3548 && !(TREE_CODE (rhs1_type
) == VECTOR_TYPE
3549 && INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type
))
3550 && TREE_CODE (rhs2_type
) == VECTOR_TYPE
3551 && INTEGRAL_TYPE_P (TREE_TYPE (rhs2_type
))))
3552 || !useless_type_conversion_p (lhs_type
, rhs1_type
))
3554 error ("type mismatch in shift expression");
3555 debug_generic_expr (lhs_type
);
3556 debug_generic_expr (rhs1_type
);
3557 debug_generic_expr (rhs2_type
);
3564 case VEC_LSHIFT_EXPR
:
3565 case VEC_RSHIFT_EXPR
:
3567 if (TREE_CODE (rhs1_type
) != VECTOR_TYPE
3568 || !(INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type
))
3569 || POINTER_TYPE_P (TREE_TYPE (rhs1_type
))
3570 || FIXED_POINT_TYPE_P (TREE_TYPE (rhs1_type
))
3571 || SCALAR_FLOAT_TYPE_P (TREE_TYPE (rhs1_type
)))
3572 || (!INTEGRAL_TYPE_P (rhs2_type
)
3573 && (TREE_CODE (rhs2_type
) != VECTOR_TYPE
3574 || !INTEGRAL_TYPE_P (TREE_TYPE (rhs2_type
))))
3575 || !useless_type_conversion_p (lhs_type
, rhs1_type
))
3577 error ("type mismatch in vector shift expression");
3578 debug_generic_expr (lhs_type
);
3579 debug_generic_expr (rhs1_type
);
3580 debug_generic_expr (rhs2_type
);
3583 /* For shifting a vector of non-integral components we
3584 only allow shifting by a constant multiple of the element size. */
3585 if (!INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type
))
3586 && (TREE_CODE (rhs2
) != INTEGER_CST
3587 || !div_if_zero_remainder (EXACT_DIV_EXPR
, rhs2
,
3588 TYPE_SIZE (TREE_TYPE (rhs1_type
)))))
3590 error ("non-element sized vector shift of floating point vector");
3597 case WIDEN_LSHIFT_EXPR
:
3599 if (!INTEGRAL_TYPE_P (lhs_type
)
3600 || !INTEGRAL_TYPE_P (rhs1_type
)
3601 || TREE_CODE (rhs2
) != INTEGER_CST
3602 || (2 * TYPE_PRECISION (rhs1_type
) > TYPE_PRECISION (lhs_type
)))
3604 error ("type mismatch in widening vector shift expression");
3605 debug_generic_expr (lhs_type
);
3606 debug_generic_expr (rhs1_type
);
3607 debug_generic_expr (rhs2_type
);
3614 case VEC_WIDEN_LSHIFT_HI_EXPR
:
3615 case VEC_WIDEN_LSHIFT_LO_EXPR
:
3617 if (TREE_CODE (rhs1_type
) != VECTOR_TYPE
3618 || TREE_CODE (lhs_type
) != VECTOR_TYPE
3619 || !INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type
))
3620 || !INTEGRAL_TYPE_P (TREE_TYPE (lhs_type
))
3621 || TREE_CODE (rhs2
) != INTEGER_CST
3622 || (2 * TYPE_PRECISION (TREE_TYPE (rhs1_type
))
3623 > TYPE_PRECISION (TREE_TYPE (lhs_type
))))
3625 error ("type mismatch in widening vector shift expression");
3626 debug_generic_expr (lhs_type
);
3627 debug_generic_expr (rhs1_type
);
3628 debug_generic_expr (rhs2_type
);
3638 /* We use regular PLUS_EXPR and MINUS_EXPR for vectors.
3639 ??? This just makes the checker happy and may not be what is
3641 if (TREE_CODE (lhs_type
) == VECTOR_TYPE
3642 && POINTER_TYPE_P (TREE_TYPE (lhs_type
)))
3644 if (TREE_CODE (rhs1_type
) != VECTOR_TYPE
3645 || TREE_CODE (rhs2_type
) != VECTOR_TYPE
)
3647 error ("invalid non-vector operands to vector valued plus");
3650 lhs_type
= TREE_TYPE (lhs_type
);
3651 rhs1_type
= TREE_TYPE (rhs1_type
);
3652 rhs2_type
= TREE_TYPE (rhs2_type
);
3653 /* PLUS_EXPR is commutative, so we might end up canonicalizing
3654 the pointer to 2nd place. */
3655 if (POINTER_TYPE_P (rhs2_type
))
3657 tree tem
= rhs1_type
;
3658 rhs1_type
= rhs2_type
;
3661 goto do_pointer_plus_expr_check
;
3663 if (POINTER_TYPE_P (lhs_type
)
3664 || POINTER_TYPE_P (rhs1_type
)
3665 || POINTER_TYPE_P (rhs2_type
))
3667 error ("invalid (pointer) operands to plus/minus");
3671 /* Continue with generic binary expression handling. */
3675 case POINTER_PLUS_EXPR
:
3677 do_pointer_plus_expr_check
:
3678 if (!POINTER_TYPE_P (rhs1_type
)
3679 || !useless_type_conversion_p (lhs_type
, rhs1_type
)
3680 || !ptrofftype_p (rhs2_type
))
3682 error ("type mismatch in pointer plus expression");
3683 debug_generic_stmt (lhs_type
);
3684 debug_generic_stmt (rhs1_type
);
3685 debug_generic_stmt (rhs2_type
);
3692 case TRUTH_ANDIF_EXPR
:
3693 case TRUTH_ORIF_EXPR
:
3694 case TRUTH_AND_EXPR
:
3696 case TRUTH_XOR_EXPR
:
3706 case UNORDERED_EXPR
:
3714 /* Comparisons are also binary, but the result type is not
3715 connected to the operand types. */
3716 return verify_gimple_comparison (lhs_type
, rhs1
, rhs2
);
3718 case WIDEN_MULT_EXPR
:
3719 if (TREE_CODE (lhs_type
) != INTEGER_TYPE
)
3721 return ((2 * TYPE_PRECISION (rhs1_type
) > TYPE_PRECISION (lhs_type
))
3722 || (TYPE_PRECISION (rhs1_type
) != TYPE_PRECISION (rhs2_type
)));
3724 case WIDEN_SUM_EXPR
:
3725 case VEC_WIDEN_MULT_HI_EXPR
:
3726 case VEC_WIDEN_MULT_LO_EXPR
:
3727 case VEC_PACK_TRUNC_EXPR
:
3728 case VEC_PACK_SAT_EXPR
:
3729 case VEC_PACK_FIX_TRUNC_EXPR
:
3734 case TRUNC_DIV_EXPR
:
3736 case FLOOR_DIV_EXPR
:
3737 case ROUND_DIV_EXPR
:
3738 case TRUNC_MOD_EXPR
:
3740 case FLOOR_MOD_EXPR
:
3741 case ROUND_MOD_EXPR
:
3743 case EXACT_DIV_EXPR
:
3749 /* Continue with generic binary expression handling. */
3756 if (!useless_type_conversion_p (lhs_type
, rhs1_type
)
3757 || !useless_type_conversion_p (lhs_type
, rhs2_type
))
3759 error ("type mismatch in binary expression");
3760 debug_generic_stmt (lhs_type
);
3761 debug_generic_stmt (rhs1_type
);
3762 debug_generic_stmt (rhs2_type
);
3769 /* Verify a gimple assignment statement STMT with a ternary rhs.
3770 Returns true if anything is wrong. */
3773 verify_gimple_assign_ternary (gimple stmt
)
3775 enum tree_code rhs_code
= gimple_assign_rhs_code (stmt
);
3776 tree lhs
= gimple_assign_lhs (stmt
);
3777 tree lhs_type
= TREE_TYPE (lhs
);
3778 tree rhs1
= gimple_assign_rhs1 (stmt
);
3779 tree rhs1_type
= TREE_TYPE (rhs1
);
3780 tree rhs2
= gimple_assign_rhs2 (stmt
);
3781 tree rhs2_type
= TREE_TYPE (rhs2
);
3782 tree rhs3
= gimple_assign_rhs3 (stmt
);
3783 tree rhs3_type
= TREE_TYPE (rhs3
);
3785 if (!is_gimple_reg (lhs
))
3787 error ("non-register as LHS of ternary operation");
3791 if (((rhs_code
== VEC_COND_EXPR
|| rhs_code
== COND_EXPR
)
3792 ? !is_gimple_condexpr (rhs1
) : !is_gimple_val (rhs1
))
3793 || !is_gimple_val (rhs2
)
3794 || !is_gimple_val (rhs3
))
3796 error ("invalid operands in ternary operation");
3800 /* First handle operations that involve different types. */
3803 case WIDEN_MULT_PLUS_EXPR
:
3804 case WIDEN_MULT_MINUS_EXPR
:
3805 if ((!INTEGRAL_TYPE_P (rhs1_type
)
3806 && !FIXED_POINT_TYPE_P (rhs1_type
))
3807 || !useless_type_conversion_p (rhs1_type
, rhs2_type
)
3808 || !useless_type_conversion_p (lhs_type
, rhs3_type
)
3809 || 2 * TYPE_PRECISION (rhs1_type
) > TYPE_PRECISION (lhs_type
)
3810 || TYPE_PRECISION (rhs1_type
) != TYPE_PRECISION (rhs2_type
))
3812 error ("type mismatch in widening multiply-accumulate expression");
3813 debug_generic_expr (lhs_type
);
3814 debug_generic_expr (rhs1_type
);
3815 debug_generic_expr (rhs2_type
);
3816 debug_generic_expr (rhs3_type
);
3822 if (!useless_type_conversion_p (lhs_type
, rhs1_type
)
3823 || !useless_type_conversion_p (lhs_type
, rhs2_type
)
3824 || !useless_type_conversion_p (lhs_type
, rhs3_type
))
3826 error ("type mismatch in fused multiply-add expression");
3827 debug_generic_expr (lhs_type
);
3828 debug_generic_expr (rhs1_type
);
3829 debug_generic_expr (rhs2_type
);
3830 debug_generic_expr (rhs3_type
);
3837 if (!useless_type_conversion_p (lhs_type
, rhs2_type
)
3838 || !useless_type_conversion_p (lhs_type
, rhs3_type
))
3840 error ("type mismatch in conditional expression");
3841 debug_generic_expr (lhs_type
);
3842 debug_generic_expr (rhs2_type
);
3843 debug_generic_expr (rhs3_type
);
3849 if (!useless_type_conversion_p (lhs_type
, rhs1_type
)
3850 || !useless_type_conversion_p (lhs_type
, rhs2_type
))
3852 error ("type mismatch in vector permute expression");
3853 debug_generic_expr (lhs_type
);
3854 debug_generic_expr (rhs1_type
);
3855 debug_generic_expr (rhs2_type
);
3856 debug_generic_expr (rhs3_type
);
3860 if (TREE_CODE (rhs1_type
) != VECTOR_TYPE
3861 || TREE_CODE (rhs2_type
) != VECTOR_TYPE
3862 || TREE_CODE (rhs3_type
) != VECTOR_TYPE
)
3864 error ("vector types expected in vector permute expression");
3865 debug_generic_expr (lhs_type
);
3866 debug_generic_expr (rhs1_type
);
3867 debug_generic_expr (rhs2_type
);
3868 debug_generic_expr (rhs3_type
);
3872 if (TYPE_VECTOR_SUBPARTS (rhs1_type
) != TYPE_VECTOR_SUBPARTS (rhs2_type
)
3873 || TYPE_VECTOR_SUBPARTS (rhs2_type
)
3874 != TYPE_VECTOR_SUBPARTS (rhs3_type
)
3875 || TYPE_VECTOR_SUBPARTS (rhs3_type
)
3876 != TYPE_VECTOR_SUBPARTS (lhs_type
))
3878 error ("vectors with different element number found "
3879 "in vector permute expression");
3880 debug_generic_expr (lhs_type
);
3881 debug_generic_expr (rhs1_type
);
3882 debug_generic_expr (rhs2_type
);
3883 debug_generic_expr (rhs3_type
);
3887 if (TREE_CODE (TREE_TYPE (rhs3_type
)) != INTEGER_TYPE
3888 || GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (rhs3_type
)))
3889 != GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (rhs1_type
))))
3891 error ("invalid mask type in vector permute expression");
3892 debug_generic_expr (lhs_type
);
3893 debug_generic_expr (rhs1_type
);
3894 debug_generic_expr (rhs2_type
);
3895 debug_generic_expr (rhs3_type
);
3902 case REALIGN_LOAD_EXPR
:
3912 /* Verify a gimple assignment statement STMT with a single rhs.
3913 Returns true if anything is wrong. */
3916 verify_gimple_assign_single (gimple stmt
)
3918 enum tree_code rhs_code
= gimple_assign_rhs_code (stmt
);
3919 tree lhs
= gimple_assign_lhs (stmt
);
3920 tree lhs_type
= TREE_TYPE (lhs
);
3921 tree rhs1
= gimple_assign_rhs1 (stmt
);
3922 tree rhs1_type
= TREE_TYPE (rhs1
);
3925 if (!useless_type_conversion_p (lhs_type
, rhs1_type
))
3927 error ("non-trivial conversion at assignment");
3928 debug_generic_expr (lhs_type
);
3929 debug_generic_expr (rhs1_type
);
3933 if (handled_component_p (lhs
))
3934 res
|= verify_types_in_gimple_reference (lhs
, true);
3936 /* Special codes we cannot handle via their class. */
3941 tree op
= TREE_OPERAND (rhs1
, 0);
3942 if (!is_gimple_addressable (op
))
3944 error ("invalid operand in unary expression");
3948 /* Technically there is no longer a need for matching types, but
3949 gimple hygiene asks for this check. In LTO we can end up
3950 combining incompatible units and thus end up with addresses
3951 of globals that change their type to a common one. */
3953 && !types_compatible_p (TREE_TYPE (op
),
3954 TREE_TYPE (TREE_TYPE (rhs1
)))
3955 && !one_pointer_to_useless_type_conversion_p (TREE_TYPE (rhs1
),
3958 error ("type mismatch in address expression");
3959 debug_generic_stmt (TREE_TYPE (rhs1
));
3960 debug_generic_stmt (TREE_TYPE (op
));
3964 return verify_types_in_gimple_reference (op
, true);
3969 error ("INDIRECT_REF in gimple IL");
3975 case ARRAY_RANGE_REF
:
3976 case VIEW_CONVERT_EXPR
:
3979 case TARGET_MEM_REF
:
3981 if (!is_gimple_reg (lhs
)
3982 && is_gimple_reg_type (TREE_TYPE (lhs
)))
3984 error ("invalid rhs for gimple memory store");
3985 debug_generic_stmt (lhs
);
3986 debug_generic_stmt (rhs1
);
3989 return res
|| verify_types_in_gimple_reference (rhs1
, false);
4001 /* tcc_declaration */
4006 if (!is_gimple_reg (lhs
)
4007 && !is_gimple_reg (rhs1
)
4008 && is_gimple_reg_type (TREE_TYPE (lhs
)))
4010 error ("invalid rhs for gimple memory store");
4011 debug_generic_stmt (lhs
);
4012 debug_generic_stmt (rhs1
);
4020 case WITH_SIZE_EXPR
:
4030 /* Verify the contents of a GIMPLE_ASSIGN STMT. Returns true when there
4031 is a problem, otherwise false. */
4034 verify_gimple_assign (gimple stmt
)
4036 switch (gimple_assign_rhs_class (stmt
))
4038 case GIMPLE_SINGLE_RHS
:
4039 return verify_gimple_assign_single (stmt
);
4041 case GIMPLE_UNARY_RHS
:
4042 return verify_gimple_assign_unary (stmt
);
4044 case GIMPLE_BINARY_RHS
:
4045 return verify_gimple_assign_binary (stmt
);
4047 case GIMPLE_TERNARY_RHS
:
4048 return verify_gimple_assign_ternary (stmt
);
4055 /* Verify the contents of a GIMPLE_RETURN STMT. Returns true when there
4056 is a problem, otherwise false. */
4059 verify_gimple_return (gimple stmt
)
4061 tree op
= gimple_return_retval (stmt
);
4062 tree restype
= TREE_TYPE (TREE_TYPE (cfun
->decl
));
4064 /* We cannot test for present return values as we do not fix up missing
4065 return values from the original source. */
4069 if (!is_gimple_val (op
)
4070 && TREE_CODE (op
) != RESULT_DECL
)
4072 error ("invalid operand in return statement");
4073 debug_generic_stmt (op
);
4077 if ((TREE_CODE (op
) == RESULT_DECL
4078 && DECL_BY_REFERENCE (op
))
4079 || (TREE_CODE (op
) == SSA_NAME
4080 && TREE_CODE (SSA_NAME_VAR (op
)) == RESULT_DECL
4081 && DECL_BY_REFERENCE (SSA_NAME_VAR (op
))))
4082 op
= TREE_TYPE (op
);
4084 if (!useless_type_conversion_p (restype
, TREE_TYPE (op
)))
4086 error ("invalid conversion in return statement");
4087 debug_generic_stmt (restype
);
4088 debug_generic_stmt (TREE_TYPE (op
));
4096 /* Verify the contents of a GIMPLE_GOTO STMT. Returns true when there
4097 is a problem, otherwise false. */
4100 verify_gimple_goto (gimple stmt
)
4102 tree dest
= gimple_goto_dest (stmt
);
4104 /* ??? We have two canonical forms of direct goto destinations, a
4105 bare LABEL_DECL and an ADDR_EXPR of a LABEL_DECL. */
4106 if (TREE_CODE (dest
) != LABEL_DECL
4107 && (!is_gimple_val (dest
)
4108 || !POINTER_TYPE_P (TREE_TYPE (dest
))))
4110 error ("goto destination is neither a label nor a pointer");
4117 /* Verify the contents of a GIMPLE_SWITCH STMT. Returns true when there
4118 is a problem, otherwise false. */
4121 verify_gimple_switch (gimple stmt
)
4124 tree elt
, prev_upper_bound
= NULL_TREE
;
4125 tree index_type
, elt_type
= NULL_TREE
;
4127 if (!is_gimple_val (gimple_switch_index (stmt
)))
4129 error ("invalid operand to switch statement");
4130 debug_generic_stmt (gimple_switch_index (stmt
));
4134 index_type
= TREE_TYPE (gimple_switch_index (stmt
));
4135 if (! INTEGRAL_TYPE_P (index_type
))
4137 error ("non-integral type switch statement");
4138 debug_generic_expr (index_type
);
4142 elt
= gimple_switch_default_label (stmt
);
4143 if (CASE_LOW (elt
) != NULL_TREE
|| CASE_HIGH (elt
) != NULL_TREE
)
4145 error ("invalid default case label in switch statement");
4146 debug_generic_expr (elt
);
4150 n
= gimple_switch_num_labels (stmt
);
4151 for (i
= 1; i
< n
; i
++)
4153 elt
= gimple_switch_label (stmt
, i
);
4155 if (! CASE_LOW (elt
))
4157 error ("invalid case label in switch statement");
4158 debug_generic_expr (elt
);
4162 && ! tree_int_cst_lt (CASE_LOW (elt
), CASE_HIGH (elt
)))
4164 error ("invalid case range in switch statement");
4165 debug_generic_expr (elt
);
4171 if (TREE_TYPE (CASE_LOW (elt
)) != elt_type
4172 || (CASE_HIGH (elt
) && TREE_TYPE (CASE_HIGH (elt
)) != elt_type
))
4174 error ("type mismatch for case label in switch statement");
4175 debug_generic_expr (elt
);
4181 elt_type
= TREE_TYPE (CASE_LOW (elt
));
4182 if (TYPE_PRECISION (index_type
) < TYPE_PRECISION (elt_type
))
4184 error ("type precision mismatch in switch statement");
4189 if (prev_upper_bound
)
4191 if (! tree_int_cst_lt (prev_upper_bound
, CASE_LOW (elt
)))
4193 error ("case labels not sorted in switch statement");
4198 prev_upper_bound
= CASE_HIGH (elt
);
4199 if (! prev_upper_bound
)
4200 prev_upper_bound
= CASE_LOW (elt
);
4206 /* Verify a gimple debug statement STMT.
4207 Returns true if anything is wrong. */
4210 verify_gimple_debug (gimple stmt ATTRIBUTE_UNUSED
)
4212 /* There isn't much that could be wrong in a gimple debug stmt. A
4213 gimple debug bind stmt, for example, maps a tree, that's usually
4214 a VAR_DECL or a PARM_DECL, but that could also be some scalarized
4215 component or member of an aggregate type, to another tree, that
4216 can be an arbitrary expression. These stmts expand into debug
4217 insns, and are converted to debug notes by var-tracking.c. */
4221 /* Verify a gimple label statement STMT.
4222 Returns true if anything is wrong. */
4225 verify_gimple_label (gimple stmt
)
4227 tree decl
= gimple_label_label (stmt
);
4231 if (TREE_CODE (decl
) != LABEL_DECL
)
4234 uid
= LABEL_DECL_UID (decl
);
4237 || VEC_index (basic_block
,
4238 label_to_block_map
, uid
) != gimple_bb (stmt
)))
4240 error ("incorrect entry in label_to_block_map");
4244 uid
= EH_LANDING_PAD_NR (decl
);
4247 eh_landing_pad lp
= get_eh_landing_pad_from_number (uid
);
4248 if (decl
!= lp
->post_landing_pad
)
4250 error ("incorrect setting of landing pad number");
4258 /* Verify the GIMPLE statement STMT. Returns true if there is an
4259 error, otherwise false. */
4262 verify_gimple_stmt (gimple stmt
)
4264 switch (gimple_code (stmt
))
4267 return verify_gimple_assign (stmt
);
4270 return verify_gimple_label (stmt
);
4273 return verify_gimple_call (stmt
);
4276 if (TREE_CODE_CLASS (gimple_cond_code (stmt
)) != tcc_comparison
)
4278 error ("invalid comparison code in gimple cond");
4281 if (!(!gimple_cond_true_label (stmt
)
4282 || TREE_CODE (gimple_cond_true_label (stmt
)) == LABEL_DECL
)
4283 || !(!gimple_cond_false_label (stmt
)
4284 || TREE_CODE (gimple_cond_false_label (stmt
)) == LABEL_DECL
))
4286 error ("invalid labels in gimple cond");
4290 return verify_gimple_comparison (boolean_type_node
,
4291 gimple_cond_lhs (stmt
),
4292 gimple_cond_rhs (stmt
));
4295 return verify_gimple_goto (stmt
);
4298 return verify_gimple_switch (stmt
);
4301 return verify_gimple_return (stmt
);
4306 case GIMPLE_TRANSACTION
:
4307 return verify_gimple_transaction (stmt
);
4309 /* Tuples that do not have tree operands. */
4311 case GIMPLE_PREDICT
:
4313 case GIMPLE_EH_DISPATCH
:
4314 case GIMPLE_EH_MUST_NOT_THROW
:
4318 /* OpenMP directives are validated by the FE and never operated
4319 on by the optimizers. Furthermore, GIMPLE_OMP_FOR may contain
4320 non-gimple expressions when the main index variable has had
4321 its address taken. This does not affect the loop itself
4322 because the header of an GIMPLE_OMP_FOR is merely used to determine
4323 how to setup the parallel iteration. */
4327 return verify_gimple_debug (stmt
);
4334 /* Verify the contents of a GIMPLE_PHI. Returns true if there is a problem,
4335 and false otherwise. */
4338 verify_gimple_phi (gimple phi
)
4342 tree phi_result
= gimple_phi_result (phi
);
4347 error ("invalid PHI result");
4351 virtual_p
= !is_gimple_reg (phi_result
);
4352 if (TREE_CODE (phi_result
) != SSA_NAME
4354 && SSA_NAME_VAR (phi_result
) != gimple_vop (cfun
)))
4356 error ("invalid PHI result");
4360 for (i
= 0; i
< gimple_phi_num_args (phi
); i
++)
4362 tree t
= gimple_phi_arg_def (phi
, i
);
4366 error ("missing PHI def");
4370 /* Addressable variables do have SSA_NAMEs but they
4371 are not considered gimple values. */
4372 else if ((TREE_CODE (t
) == SSA_NAME
4373 && virtual_p
!= !is_gimple_reg (t
))
4375 && (TREE_CODE (t
) != SSA_NAME
4376 || SSA_NAME_VAR (t
) != gimple_vop (cfun
)))
4378 && !is_gimple_val (t
)))
4380 error ("invalid PHI argument");
4381 debug_generic_expr (t
);
4384 #ifdef ENABLE_TYPES_CHECKING
4385 if (!useless_type_conversion_p (TREE_TYPE (phi_result
), TREE_TYPE (t
)))
4387 error ("incompatible types in PHI argument %u", i
);
4388 debug_generic_stmt (TREE_TYPE (phi_result
));
4389 debug_generic_stmt (TREE_TYPE (t
));
4398 /* Verify the GIMPLE statements inside the sequence STMTS. */
4401 verify_gimple_in_seq_2 (gimple_seq stmts
)
4403 gimple_stmt_iterator ittr
;
4406 for (ittr
= gsi_start (stmts
); !gsi_end_p (ittr
); gsi_next (&ittr
))
4408 gimple stmt
= gsi_stmt (ittr
);
4410 switch (gimple_code (stmt
))
4413 err
|= verify_gimple_in_seq_2 (gimple_bind_body (stmt
));
4417 err
|= verify_gimple_in_seq_2 (gimple_try_eval (stmt
));
4418 err
|= verify_gimple_in_seq_2 (gimple_try_cleanup (stmt
));
4421 case GIMPLE_EH_FILTER
:
4422 err
|= verify_gimple_in_seq_2 (gimple_eh_filter_failure (stmt
));
4425 case GIMPLE_EH_ELSE
:
4426 err
|= verify_gimple_in_seq_2 (gimple_eh_else_n_body (stmt
));
4427 err
|= verify_gimple_in_seq_2 (gimple_eh_else_e_body (stmt
));
4431 err
|= verify_gimple_in_seq_2 (gimple_catch_handler (stmt
));
4434 case GIMPLE_TRANSACTION
:
4435 err
|= verify_gimple_transaction (stmt
);
4440 bool err2
= verify_gimple_stmt (stmt
);
4442 debug_gimple_stmt (stmt
);
4451 /* Verify the contents of a GIMPLE_TRANSACTION. Returns true if there
4452 is a problem, otherwise false. */
4455 verify_gimple_transaction (gimple stmt
)
4457 tree lab
= gimple_transaction_label (stmt
);
4458 if (lab
!= NULL
&& TREE_CODE (lab
) != LABEL_DECL
)
4460 return verify_gimple_in_seq_2 (gimple_transaction_body (stmt
));
4464 /* Verify the GIMPLE statements inside the statement list STMTS. */
4467 verify_gimple_in_seq (gimple_seq stmts
)
4469 timevar_push (TV_TREE_STMT_VERIFY
);
4470 if (verify_gimple_in_seq_2 (stmts
))
4471 internal_error ("verify_gimple failed");
4472 timevar_pop (TV_TREE_STMT_VERIFY
);
4475 /* Return true when the T can be shared. */
4478 tree_node_can_be_shared (tree t
)
4480 if (IS_TYPE_OR_DECL_P (t
)
4481 || is_gimple_min_invariant (t
)
4482 || TREE_CODE (t
) == SSA_NAME
4483 || t
== error_mark_node
4484 || TREE_CODE (t
) == IDENTIFIER_NODE
)
4487 if (TREE_CODE (t
) == CASE_LABEL_EXPR
)
4490 while (((TREE_CODE (t
) == ARRAY_REF
|| TREE_CODE (t
) == ARRAY_RANGE_REF
)
4491 && is_gimple_min_invariant (TREE_OPERAND (t
, 1)))
4492 || TREE_CODE (t
) == COMPONENT_REF
4493 || TREE_CODE (t
) == REALPART_EXPR
4494 || TREE_CODE (t
) == IMAGPART_EXPR
)
4495 t
= TREE_OPERAND (t
, 0);
4503 /* Called via walk_gimple_stmt. Verify tree sharing. */
4506 verify_node_sharing (tree
*tp
, int *walk_subtrees
, void *data
)
4508 struct walk_stmt_info
*wi
= (struct walk_stmt_info
*) data
;
4509 struct pointer_set_t
*visited
= (struct pointer_set_t
*) wi
->info
;
4511 if (tree_node_can_be_shared (*tp
))
4513 *walk_subtrees
= false;
4517 if (pointer_set_insert (visited
, *tp
))
4523 static bool eh_error_found
;
4525 verify_eh_throw_stmt_node (void **slot
, void *data
)
4527 struct throw_stmt_node
*node
= (struct throw_stmt_node
*)*slot
;
4528 struct pointer_set_t
*visited
= (struct pointer_set_t
*) data
;
4530 if (!pointer_set_contains (visited
, node
->stmt
))
4532 error ("dead STMT in EH table");
4533 debug_gimple_stmt (node
->stmt
);
4534 eh_error_found
= true;
4539 /* Verify the GIMPLE statements in the CFG of FN. */
4542 verify_gimple_in_cfg (struct function
*fn
)
4546 struct pointer_set_t
*visited
, *visited_stmts
;
4548 timevar_push (TV_TREE_STMT_VERIFY
);
4549 visited
= pointer_set_create ();
4550 visited_stmts
= pointer_set_create ();
4552 FOR_EACH_BB_FN (bb
, fn
)
4554 gimple_stmt_iterator gsi
;
4556 for (gsi
= gsi_start_phis (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
4558 gimple phi
= gsi_stmt (gsi
);
4562 pointer_set_insert (visited_stmts
, phi
);
4564 if (gimple_bb (phi
) != bb
)
4566 error ("gimple_bb (phi) is set to a wrong basic block");
4570 err2
|= verify_gimple_phi (phi
);
4572 for (i
= 0; i
< gimple_phi_num_args (phi
); i
++)
4574 tree arg
= gimple_phi_arg_def (phi
, i
);
4575 tree addr
= walk_tree (&arg
, verify_node_sharing
, visited
, NULL
);
4578 error ("incorrect sharing of tree nodes");
4579 debug_generic_expr (addr
);
4585 debug_gimple_stmt (phi
);
4589 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
4591 gimple stmt
= gsi_stmt (gsi
);
4593 struct walk_stmt_info wi
;
4597 pointer_set_insert (visited_stmts
, stmt
);
4599 if (gimple_bb (stmt
) != bb
)
4601 error ("gimple_bb (stmt) is set to a wrong basic block");
4605 err2
|= verify_gimple_stmt (stmt
);
4607 memset (&wi
, 0, sizeof (wi
));
4608 wi
.info
= (void *) visited
;
4609 addr
= walk_gimple_op (stmt
, verify_node_sharing
, &wi
);
4612 error ("incorrect sharing of tree nodes");
4613 debug_generic_expr (addr
);
4617 /* ??? Instead of not checking these stmts at all the walker
4618 should know its context via wi. */
4619 if (!is_gimple_debug (stmt
)
4620 && !is_gimple_omp (stmt
))
4622 memset (&wi
, 0, sizeof (wi
));
4623 addr
= walk_gimple_op (stmt
, verify_expr
, &wi
);
4626 debug_generic_expr (addr
);
4627 inform (gimple_location (stmt
), "in statement");
4632 /* If the statement is marked as part of an EH region, then it is
4633 expected that the statement could throw. Verify that when we
4634 have optimizations that simplify statements such that we prove
4635 that they cannot throw, that we update other data structures
4637 lp_nr
= lookup_stmt_eh_lp (stmt
);
4640 if (!stmt_could_throw_p (stmt
))
4642 error ("statement marked for throw, but doesn%'t");
4646 && !gsi_one_before_end_p (gsi
)
4647 && stmt_can_throw_internal (stmt
))
4649 error ("statement marked for throw in middle of block");
4655 debug_gimple_stmt (stmt
);
4660 eh_error_found
= false;
4661 if (get_eh_throw_stmt_table (cfun
))
4662 htab_traverse (get_eh_throw_stmt_table (cfun
),
4663 verify_eh_throw_stmt_node
,
4666 if (err
|| eh_error_found
)
4667 internal_error ("verify_gimple failed");
4669 pointer_set_destroy (visited
);
4670 pointer_set_destroy (visited_stmts
);
4671 verify_histograms ();
4672 timevar_pop (TV_TREE_STMT_VERIFY
);
4676 /* Verifies that the flow information is OK. */
4679 gimple_verify_flow_info (void)
4683 gimple_stmt_iterator gsi
;
4688 if (ENTRY_BLOCK_PTR
->il
.gimple
.seq
|| ENTRY_BLOCK_PTR
->il
.gimple
.phi_nodes
)
4690 error ("ENTRY_BLOCK has IL associated with it");
4694 if (EXIT_BLOCK_PTR
->il
.gimple
.seq
|| EXIT_BLOCK_PTR
->il
.gimple
.phi_nodes
)
4696 error ("EXIT_BLOCK has IL associated with it");
4700 FOR_EACH_EDGE (e
, ei
, EXIT_BLOCK_PTR
->preds
)
4701 if (e
->flags
& EDGE_FALLTHRU
)
4703 error ("fallthru to exit from bb %d", e
->src
->index
);
4709 bool found_ctrl_stmt
= false;
4713 /* Skip labels on the start of basic block. */
4714 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
4717 gimple prev_stmt
= stmt
;
4719 stmt
= gsi_stmt (gsi
);
4721 if (gimple_code (stmt
) != GIMPLE_LABEL
)
4724 label
= gimple_label_label (stmt
);
4725 if (prev_stmt
&& DECL_NONLOCAL (label
))
4727 error ("nonlocal label ");
4728 print_generic_expr (stderr
, label
, 0);
4729 fprintf (stderr
, " is not first in a sequence of labels in bb %d",
4734 if (prev_stmt
&& EH_LANDING_PAD_NR (label
) != 0)
4736 error ("EH landing pad label ");
4737 print_generic_expr (stderr
, label
, 0);
4738 fprintf (stderr
, " is not first in a sequence of labels in bb %d",
4743 if (label_to_block (label
) != bb
)
4746 print_generic_expr (stderr
, label
, 0);
4747 fprintf (stderr
, " to block does not match in bb %d",
4752 if (decl_function_context (label
) != current_function_decl
)
4755 print_generic_expr (stderr
, label
, 0);
4756 fprintf (stderr
, " has incorrect context in bb %d",
4762 /* Verify that body of basic block BB is free of control flow. */
4763 for (; !gsi_end_p (gsi
); gsi_next (&gsi
))
4765 gimple stmt
= gsi_stmt (gsi
);
4767 if (found_ctrl_stmt
)
4769 error ("control flow in the middle of basic block %d",
4774 if (stmt_ends_bb_p (stmt
))
4775 found_ctrl_stmt
= true;
4777 if (gimple_code (stmt
) == GIMPLE_LABEL
)
4780 print_generic_expr (stderr
, gimple_label_label (stmt
), 0);
4781 fprintf (stderr
, " in the middle of basic block %d", bb
->index
);
4786 gsi
= gsi_last_bb (bb
);
4787 if (gsi_end_p (gsi
))
4790 stmt
= gsi_stmt (gsi
);
4792 if (gimple_code (stmt
) == GIMPLE_LABEL
)
4795 err
|= verify_eh_edges (stmt
);
4797 if (is_ctrl_stmt (stmt
))
4799 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
4800 if (e
->flags
& EDGE_FALLTHRU
)
4802 error ("fallthru edge after a control statement in bb %d",
4808 if (gimple_code (stmt
) != GIMPLE_COND
)
4810 /* Verify that there are no edges with EDGE_TRUE/FALSE_FLAG set
4811 after anything else but if statement. */
4812 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
4813 if (e
->flags
& (EDGE_TRUE_VALUE
| EDGE_FALSE_VALUE
))
4815 error ("true/false edge after a non-GIMPLE_COND in bb %d",
4821 switch (gimple_code (stmt
))
4828 extract_true_false_edges_from_block (bb
, &true_edge
, &false_edge
);
4832 || !(true_edge
->flags
& EDGE_TRUE_VALUE
)
4833 || !(false_edge
->flags
& EDGE_FALSE_VALUE
)
4834 || (true_edge
->flags
& (EDGE_FALLTHRU
| EDGE_ABNORMAL
))
4835 || (false_edge
->flags
& (EDGE_FALLTHRU
| EDGE_ABNORMAL
))
4836 || EDGE_COUNT (bb
->succs
) >= 3)
4838 error ("wrong outgoing edge flags at end of bb %d",
4846 if (simple_goto_p (stmt
))
4848 error ("explicit goto at end of bb %d", bb
->index
);
4853 /* FIXME. We should double check that the labels in the
4854 destination blocks have their address taken. */
4855 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
4856 if ((e
->flags
& (EDGE_FALLTHRU
| EDGE_TRUE_VALUE
4857 | EDGE_FALSE_VALUE
))
4858 || !(e
->flags
& EDGE_ABNORMAL
))
4860 error ("wrong outgoing edge flags at end of bb %d",
4868 if (!gimple_call_builtin_p (stmt
, BUILT_IN_RETURN
))
4870 /* ... fallthru ... */
4872 if (!single_succ_p (bb
)
4873 || (single_succ_edge (bb
)->flags
4874 & (EDGE_FALLTHRU
| EDGE_ABNORMAL
4875 | EDGE_TRUE_VALUE
| EDGE_FALSE_VALUE
)))
4877 error ("wrong outgoing edge flags at end of bb %d", bb
->index
);
4880 if (single_succ (bb
) != EXIT_BLOCK_PTR
)
4882 error ("return edge does not point to exit in bb %d",
4894 n
= gimple_switch_num_labels (stmt
);
4896 /* Mark all the destination basic blocks. */
4897 for (i
= 0; i
< n
; ++i
)
4899 tree lab
= CASE_LABEL (gimple_switch_label (stmt
, i
));
4900 basic_block label_bb
= label_to_block (lab
);
4901 gcc_assert (!label_bb
->aux
|| label_bb
->aux
== (void *)1);
4902 label_bb
->aux
= (void *)1;
4905 /* Verify that the case labels are sorted. */
4906 prev
= gimple_switch_label (stmt
, 0);
4907 for (i
= 1; i
< n
; ++i
)
4909 tree c
= gimple_switch_label (stmt
, i
);
4912 error ("found default case not at the start of "
4918 && !tree_int_cst_lt (CASE_LOW (prev
), CASE_LOW (c
)))
4920 error ("case labels not sorted: ");
4921 print_generic_expr (stderr
, prev
, 0);
4922 fprintf (stderr
," is greater than ");
4923 print_generic_expr (stderr
, c
, 0);
4924 fprintf (stderr
," but comes before it.\n");
4929 /* VRP will remove the default case if it can prove it will
4930 never be executed. So do not verify there always exists
4931 a default case here. */
4933 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
4937 error ("extra outgoing edge %d->%d",
4938 bb
->index
, e
->dest
->index
);
4942 e
->dest
->aux
= (void *)2;
4943 if ((e
->flags
& (EDGE_FALLTHRU
| EDGE_ABNORMAL
4944 | EDGE_TRUE_VALUE
| EDGE_FALSE_VALUE
)))
4946 error ("wrong outgoing edge flags at end of bb %d",
4952 /* Check that we have all of them. */
4953 for (i
= 0; i
< n
; ++i
)
4955 tree lab
= CASE_LABEL (gimple_switch_label (stmt
, i
));
4956 basic_block label_bb
= label_to_block (lab
);
4958 if (label_bb
->aux
!= (void *)2)
4960 error ("missing edge %i->%i", bb
->index
, label_bb
->index
);
4965 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
4966 e
->dest
->aux
= (void *)0;
4970 case GIMPLE_EH_DISPATCH
:
4971 err
|= verify_eh_dispatch_edge (stmt
);
4979 if (dom_info_state (CDI_DOMINATORS
) >= DOM_NO_FAST_QUERY
)
4980 verify_dominators (CDI_DOMINATORS
);
4986 /* Updates phi nodes after creating a forwarder block joined
4987 by edge FALLTHRU. */
4990 gimple_make_forwarder_block (edge fallthru
)
4994 basic_block dummy
, bb
;
4996 gimple_stmt_iterator gsi
;
4998 dummy
= fallthru
->src
;
4999 bb
= fallthru
->dest
;
5001 if (single_pred_p (bb
))
5004 /* If we redirected a branch we must create new PHI nodes at the
5006 for (gsi
= gsi_start_phis (dummy
); !gsi_end_p (gsi
); gsi_next (&gsi
))
5008 gimple phi
, new_phi
;
5010 phi
= gsi_stmt (gsi
);
5011 var
= gimple_phi_result (phi
);
5012 new_phi
= create_phi_node (var
, bb
);
5013 SSA_NAME_DEF_STMT (var
) = new_phi
;
5014 gimple_phi_set_result (phi
, make_ssa_name (SSA_NAME_VAR (var
), phi
));
5015 add_phi_arg (new_phi
, gimple_phi_result (phi
), fallthru
,
5019 /* Add the arguments we have stored on edges. */
5020 FOR_EACH_EDGE (e
, ei
, bb
->preds
)
5025 flush_pending_stmts (e
);
5030 /* Return a non-special label in the head of basic block BLOCK.
5031 Create one if it doesn't exist. */
5034 gimple_block_label (basic_block bb
)
5036 gimple_stmt_iterator i
, s
= gsi_start_bb (bb
);
5041 for (i
= s
; !gsi_end_p (i
); first
= false, gsi_next (&i
))
5043 stmt
= gsi_stmt (i
);
5044 if (gimple_code (stmt
) != GIMPLE_LABEL
)
5046 label
= gimple_label_label (stmt
);
5047 if (!DECL_NONLOCAL (label
))
5050 gsi_move_before (&i
, &s
);
5055 label
= create_artificial_label (UNKNOWN_LOCATION
);
5056 stmt
= gimple_build_label (label
);
5057 gsi_insert_before (&s
, stmt
, GSI_NEW_STMT
);
5062 /* Attempt to perform edge redirection by replacing a possibly complex
5063 jump instruction by a goto or by removing the jump completely.
5064 This can apply only if all edges now point to the same block. The
5065 parameters and return values are equivalent to
5066 redirect_edge_and_branch. */
5069 gimple_try_redirect_by_replacing_jump (edge e
, basic_block target
)
5071 basic_block src
= e
->src
;
5072 gimple_stmt_iterator i
;
5075 /* We can replace or remove a complex jump only when we have exactly
5077 if (EDGE_COUNT (src
->succs
) != 2
5078 /* Verify that all targets will be TARGET. Specifically, the
5079 edge that is not E must also go to TARGET. */
5080 || EDGE_SUCC (src
, EDGE_SUCC (src
, 0) == e
)->dest
!= target
)
5083 i
= gsi_last_bb (src
);
5087 stmt
= gsi_stmt (i
);
5089 if (gimple_code (stmt
) == GIMPLE_COND
|| gimple_code (stmt
) == GIMPLE_SWITCH
)
5091 gsi_remove (&i
, true);
5092 e
= ssa_redirect_edge (e
, target
);
5093 e
->flags
= EDGE_FALLTHRU
;
5101 /* Redirect E to DEST. Return NULL on failure. Otherwise, return the
5102 edge representing the redirected branch. */
5105 gimple_redirect_edge_and_branch (edge e
, basic_block dest
)
5107 basic_block bb
= e
->src
;
5108 gimple_stmt_iterator gsi
;
5112 if (e
->flags
& EDGE_ABNORMAL
)
5115 if (e
->dest
== dest
)
5118 if (e
->flags
& EDGE_EH
)
5119 return redirect_eh_edge (e
, dest
);
5121 if (e
->src
!= ENTRY_BLOCK_PTR
)
5123 ret
= gimple_try_redirect_by_replacing_jump (e
, dest
);
5128 gsi
= gsi_last_bb (bb
);
5129 stmt
= gsi_end_p (gsi
) ? NULL
: gsi_stmt (gsi
);
5131 switch (stmt
? gimple_code (stmt
) : GIMPLE_ERROR_MARK
)
5134 /* For COND_EXPR, we only need to redirect the edge. */
5138 /* No non-abnormal edges should lead from a non-simple goto, and
5139 simple ones should be represented implicitly. */
5144 tree label
= gimple_block_label (dest
);
5145 tree cases
= get_cases_for_edge (e
, stmt
);
5147 /* If we have a list of cases associated with E, then use it
5148 as it's a lot faster than walking the entire case vector. */
5151 edge e2
= find_edge (e
->src
, dest
);
5158 CASE_LABEL (cases
) = label
;
5159 cases
= CASE_CHAIN (cases
);
5162 /* If there was already an edge in the CFG, then we need
5163 to move all the cases associated with E to E2. */
5166 tree cases2
= get_cases_for_edge (e2
, stmt
);
5168 CASE_CHAIN (last
) = CASE_CHAIN (cases2
);
5169 CASE_CHAIN (cases2
) = first
;
5171 bitmap_set_bit (touched_switch_bbs
, gimple_bb (stmt
)->index
);
5175 size_t i
, n
= gimple_switch_num_labels (stmt
);
5177 for (i
= 0; i
< n
; i
++)
5179 tree elt
= gimple_switch_label (stmt
, i
);
5180 if (label_to_block (CASE_LABEL (elt
)) == e
->dest
)
5181 CASE_LABEL (elt
) = label
;
5189 int i
, n
= gimple_asm_nlabels (stmt
);
5192 for (i
= 0; i
< n
; ++i
)
5194 tree cons
= gimple_asm_label_op (stmt
, i
);
5195 if (label_to_block (TREE_VALUE (cons
)) == e
->dest
)
5198 label
= gimple_block_label (dest
);
5199 TREE_VALUE (cons
) = label
;
5203 /* If we didn't find any label matching the former edge in the
5204 asm labels, we must be redirecting the fallthrough
5206 gcc_assert (label
|| (e
->flags
& EDGE_FALLTHRU
));
5211 gsi_remove (&gsi
, true);
5212 e
->flags
|= EDGE_FALLTHRU
;
5215 case GIMPLE_OMP_RETURN
:
5216 case GIMPLE_OMP_CONTINUE
:
5217 case GIMPLE_OMP_SECTIONS_SWITCH
:
5218 case GIMPLE_OMP_FOR
:
5219 /* The edges from OMP constructs can be simply redirected. */
5222 case GIMPLE_EH_DISPATCH
:
5223 if (!(e
->flags
& EDGE_FALLTHRU
))
5224 redirect_eh_dispatch_edge (stmt
, e
, dest
);
5227 case GIMPLE_TRANSACTION
:
5228 /* The ABORT edge has a stored label associated with it, otherwise
5229 the edges are simply redirectable. */
5231 gimple_transaction_set_label (stmt
, gimple_block_label (dest
));
5235 /* Otherwise it must be a fallthru edge, and we don't need to
5236 do anything besides redirecting it. */
5237 gcc_assert (e
->flags
& EDGE_FALLTHRU
);
5241 /* Update/insert PHI nodes as necessary. */
5243 /* Now update the edges in the CFG. */
5244 e
= ssa_redirect_edge (e
, dest
);
5249 /* Returns true if it is possible to remove edge E by redirecting
5250 it to the destination of the other edge from E->src. */
5253 gimple_can_remove_branch_p (const_edge e
)
5255 if (e
->flags
& (EDGE_ABNORMAL
| EDGE_EH
))
5261 /* Simple wrapper, as we can always redirect fallthru edges. */
5264 gimple_redirect_edge_and_branch_force (edge e
, basic_block dest
)
5266 e
= gimple_redirect_edge_and_branch (e
, dest
);
5273 /* Splits basic block BB after statement STMT (but at least after the
5274 labels). If STMT is NULL, BB is split just after the labels. */
5277 gimple_split_block (basic_block bb
, void *stmt
)
5279 gimple_stmt_iterator gsi
;
5280 gimple_stmt_iterator gsi_tgt
;
5287 new_bb
= create_empty_bb (bb
);
5289 /* Redirect the outgoing edges. */
5290 new_bb
->succs
= bb
->succs
;
5292 FOR_EACH_EDGE (e
, ei
, new_bb
->succs
)
5295 if (stmt
&& gimple_code ((gimple
) stmt
) == GIMPLE_LABEL
)
5298 /* Move everything from GSI to the new basic block. */
5299 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
5301 act
= gsi_stmt (gsi
);
5302 if (gimple_code (act
) == GIMPLE_LABEL
)
5315 if (gsi_end_p (gsi
))
5318 /* Split the statement list - avoid re-creating new containers as this
5319 brings ugly quadratic memory consumption in the inliner.
5320 (We are still quadratic since we need to update stmt BB pointers,
5322 gsi_split_seq_before (&gsi
, &list
);
5323 set_bb_seq (new_bb
, list
);
5324 for (gsi_tgt
= gsi_start (list
);
5325 !gsi_end_p (gsi_tgt
); gsi_next (&gsi_tgt
))
5326 gimple_set_bb (gsi_stmt (gsi_tgt
), new_bb
);
5332 /* Moves basic block BB after block AFTER. */
5335 gimple_move_block_after (basic_block bb
, basic_block after
)
5337 if (bb
->prev_bb
== after
)
5341 link_block (bb
, after
);
5347 /* Return true if basic_block can be duplicated. */
5350 gimple_can_duplicate_bb_p (const_basic_block bb ATTRIBUTE_UNUSED
)
5355 /* Create a duplicate of the basic block BB. NOTE: This does not
5356 preserve SSA form. */
5359 gimple_duplicate_bb (basic_block bb
)
5362 gimple_stmt_iterator gsi
, gsi_tgt
;
5363 gimple_seq phis
= phi_nodes (bb
);
5364 gimple phi
, stmt
, copy
;
5366 new_bb
= create_empty_bb (EXIT_BLOCK_PTR
->prev_bb
);
5368 /* Copy the PHI nodes. We ignore PHI node arguments here because
5369 the incoming edges have not been setup yet. */
5370 for (gsi
= gsi_start (phis
); !gsi_end_p (gsi
); gsi_next (&gsi
))
5372 phi
= gsi_stmt (gsi
);
5373 copy
= create_phi_node (gimple_phi_result (phi
), new_bb
);
5374 create_new_def_for (gimple_phi_result (copy
), copy
,
5375 gimple_phi_result_ptr (copy
));
5378 gsi_tgt
= gsi_start_bb (new_bb
);
5379 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
5381 def_operand_p def_p
;
5382 ssa_op_iter op_iter
;
5385 stmt
= gsi_stmt (gsi
);
5386 if (gimple_code (stmt
) == GIMPLE_LABEL
)
5389 /* Don't duplicate label debug stmts. */
5390 if (gimple_debug_bind_p (stmt
)
5391 && TREE_CODE (gimple_debug_bind_get_var (stmt
))
5395 /* Create a new copy of STMT and duplicate STMT's virtual
5397 copy
= gimple_copy (stmt
);
5398 gsi_insert_after (&gsi_tgt
, copy
, GSI_NEW_STMT
);
5400 maybe_duplicate_eh_stmt (copy
, stmt
);
5401 gimple_duplicate_stmt_histograms (cfun
, copy
, cfun
, stmt
);
5403 /* When copying around a stmt writing into a local non-user
5404 aggregate, make sure it won't share stack slot with other
5406 lhs
= gimple_get_lhs (stmt
);
5407 if (lhs
&& TREE_CODE (lhs
) != SSA_NAME
)
5409 tree base
= get_base_address (lhs
);
5411 && (TREE_CODE (base
) == VAR_DECL
5412 || TREE_CODE (base
) == RESULT_DECL
)
5413 && DECL_IGNORED_P (base
)
5414 && !TREE_STATIC (base
)
5415 && !DECL_EXTERNAL (base
)
5416 && (TREE_CODE (base
) != VAR_DECL
5417 || !DECL_HAS_VALUE_EXPR_P (base
)))
5418 DECL_NONSHAREABLE (base
) = 1;
5421 /* Create new names for all the definitions created by COPY and
5422 add replacement mappings for each new name. */
5423 FOR_EACH_SSA_DEF_OPERAND (def_p
, copy
, op_iter
, SSA_OP_ALL_DEFS
)
5424 create_new_def_for (DEF_FROM_PTR (def_p
), copy
, def_p
);
5430 /* Adds phi node arguments for edge E_COPY after basic block duplication. */
5433 add_phi_args_after_copy_edge (edge e_copy
)
5435 basic_block bb
, bb_copy
= e_copy
->src
, dest
;
5438 gimple phi
, phi_copy
;
5440 gimple_stmt_iterator psi
, psi_copy
;
5442 if (gimple_seq_empty_p (phi_nodes (e_copy
->dest
)))
5445 bb
= bb_copy
->flags
& BB_DUPLICATED
? get_bb_original (bb_copy
) : bb_copy
;
5447 if (e_copy
->dest
->flags
& BB_DUPLICATED
)
5448 dest
= get_bb_original (e_copy
->dest
);
5450 dest
= e_copy
->dest
;
5452 e
= find_edge (bb
, dest
);
5455 /* During loop unrolling the target of the latch edge is copied.
5456 In this case we are not looking for edge to dest, but to
5457 duplicated block whose original was dest. */
5458 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
5460 if ((e
->dest
->flags
& BB_DUPLICATED
)
5461 && get_bb_original (e
->dest
) == dest
)
5465 gcc_assert (e
!= NULL
);
5468 for (psi
= gsi_start_phis (e
->dest
),
5469 psi_copy
= gsi_start_phis (e_copy
->dest
);
5471 gsi_next (&psi
), gsi_next (&psi_copy
))
5473 phi
= gsi_stmt (psi
);
5474 phi_copy
= gsi_stmt (psi_copy
);
5475 def
= PHI_ARG_DEF_FROM_EDGE (phi
, e
);
5476 add_phi_arg (phi_copy
, def
, e_copy
,
5477 gimple_phi_arg_location_from_edge (phi
, e
));
5482 /* Basic block BB_COPY was created by code duplication. Add phi node
5483 arguments for edges going out of BB_COPY. The blocks that were
5484 duplicated have BB_DUPLICATED set. */
5487 add_phi_args_after_copy_bb (basic_block bb_copy
)
5492 FOR_EACH_EDGE (e_copy
, ei
, bb_copy
->succs
)
5494 add_phi_args_after_copy_edge (e_copy
);
5498 /* Blocks in REGION_COPY array of length N_REGION were created by
5499 duplication of basic blocks. Add phi node arguments for edges
5500 going from these blocks. If E_COPY is not NULL, also add
5501 phi node arguments for its destination.*/
5504 add_phi_args_after_copy (basic_block
*region_copy
, unsigned n_region
,
5509 for (i
= 0; i
< n_region
; i
++)
5510 region_copy
[i
]->flags
|= BB_DUPLICATED
;
5512 for (i
= 0; i
< n_region
; i
++)
5513 add_phi_args_after_copy_bb (region_copy
[i
]);
5515 add_phi_args_after_copy_edge (e_copy
);
5517 for (i
= 0; i
< n_region
; i
++)
5518 region_copy
[i
]->flags
&= ~BB_DUPLICATED
;
5521 /* Duplicates a REGION (set of N_REGION basic blocks) with just a single
5522 important exit edge EXIT. By important we mean that no SSA name defined
5523 inside region is live over the other exit edges of the region. All entry
5524 edges to the region must go to ENTRY->dest. The edge ENTRY is redirected
5525 to the duplicate of the region. SSA form, dominance and loop information
5526 is updated. The new basic blocks are stored to REGION_COPY in the same
5527 order as they had in REGION, provided that REGION_COPY is not NULL.
5528 The function returns false if it is unable to copy the region,
5532 gimple_duplicate_sese_region (edge entry
, edge exit
,
5533 basic_block
*region
, unsigned n_region
,
5534 basic_block
*region_copy
)
5537 bool free_region_copy
= false, copying_header
= false;
5538 struct loop
*loop
= entry
->dest
->loop_father
;
5540 VEC (basic_block
, heap
) *doms
;
5542 int total_freq
= 0, entry_freq
= 0;
5543 gcov_type total_count
= 0, entry_count
= 0;
5545 if (!can_copy_bbs_p (region
, n_region
))
5548 /* Some sanity checking. Note that we do not check for all possible
5549 missuses of the functions. I.e. if you ask to copy something weird,
5550 it will work, but the state of structures probably will not be
5552 for (i
= 0; i
< n_region
; i
++)
5554 /* We do not handle subloops, i.e. all the blocks must belong to the
5556 if (region
[i
]->loop_father
!= loop
)
5559 if (region
[i
] != entry
->dest
5560 && region
[i
] == loop
->header
)
5564 set_loop_copy (loop
, loop
);
5566 /* In case the function is used for loop header copying (which is the primary
5567 use), ensure that EXIT and its copy will be new latch and entry edges. */
5568 if (loop
->header
== entry
->dest
)
5570 copying_header
= true;
5571 set_loop_copy (loop
, loop_outer (loop
));
5573 if (!dominated_by_p (CDI_DOMINATORS
, loop
->latch
, exit
->src
))
5576 for (i
= 0; i
< n_region
; i
++)
5577 if (region
[i
] != exit
->src
5578 && dominated_by_p (CDI_DOMINATORS
, region
[i
], exit
->src
))
5584 region_copy
= XNEWVEC (basic_block
, n_region
);
5585 free_region_copy
= true;
5588 gcc_assert (!need_ssa_update_p (cfun
));
5590 /* Record blocks outside the region that are dominated by something
5593 initialize_original_copy_tables ();
5595 doms
= get_dominated_by_region (CDI_DOMINATORS
, region
, n_region
);
5597 if (entry
->dest
->count
)
5599 total_count
= entry
->dest
->count
;
5600 entry_count
= entry
->count
;
5601 /* Fix up corner cases, to avoid division by zero or creation of negative
5603 if (entry_count
> total_count
)
5604 entry_count
= total_count
;
5608 total_freq
= entry
->dest
->frequency
;
5609 entry_freq
= EDGE_FREQUENCY (entry
);
5610 /* Fix up corner cases, to avoid division by zero or creation of negative
5612 if (total_freq
== 0)
5614 else if (entry_freq
> total_freq
)
5615 entry_freq
= total_freq
;
5618 copy_bbs (region
, n_region
, region_copy
, &exit
, 1, &exit_copy
, loop
,
5619 split_edge_bb_loc (entry
));
5622 scale_bbs_frequencies_gcov_type (region
, n_region
,
5623 total_count
- entry_count
,
5625 scale_bbs_frequencies_gcov_type (region_copy
, n_region
, entry_count
,
5630 scale_bbs_frequencies_int (region
, n_region
, total_freq
- entry_freq
,
5632 scale_bbs_frequencies_int (region_copy
, n_region
, entry_freq
, total_freq
);
5637 loop
->header
= exit
->dest
;
5638 loop
->latch
= exit
->src
;
5641 /* Redirect the entry and add the phi node arguments. */
5642 redirected
= redirect_edge_and_branch (entry
, get_bb_copy (entry
->dest
));
5643 gcc_assert (redirected
!= NULL
);
5644 flush_pending_stmts (entry
);
5646 /* Concerning updating of dominators: We must recount dominators
5647 for entry block and its copy. Anything that is outside of the
5648 region, but was dominated by something inside needs recounting as
5650 set_immediate_dominator (CDI_DOMINATORS
, entry
->dest
, entry
->src
);
5651 VEC_safe_push (basic_block
, heap
, doms
, get_bb_original (entry
->dest
));
5652 iterate_fix_dominators (CDI_DOMINATORS
, doms
, false);
5653 VEC_free (basic_block
, heap
, doms
);
5655 /* Add the other PHI node arguments. */
5656 add_phi_args_after_copy (region_copy
, n_region
, NULL
);
5658 /* Update the SSA web. */
5659 update_ssa (TODO_update_ssa
);
5661 if (free_region_copy
)
5664 free_original_copy_tables ();
5668 /* Checks if BB is part of the region defined by N_REGION BBS. */
5670 bb_part_of_region_p (basic_block bb
, basic_block
* bbs
, unsigned n_region
)
5674 for (n
= 0; n
< n_region
; n
++)
5682 /* Duplicates REGION consisting of N_REGION blocks. The new blocks
5683 are stored to REGION_COPY in the same order in that they appear
5684 in REGION, if REGION_COPY is not NULL. ENTRY is the entry to
5685 the region, EXIT an exit from it. The condition guarding EXIT
5686 is moved to ENTRY. Returns true if duplication succeeds, false
5712 gimple_duplicate_sese_tail (edge entry ATTRIBUTE_UNUSED
, edge exit ATTRIBUTE_UNUSED
,
5713 basic_block
*region ATTRIBUTE_UNUSED
, unsigned n_region ATTRIBUTE_UNUSED
,
5714 basic_block
*region_copy ATTRIBUTE_UNUSED
)
5717 bool free_region_copy
= false;
5718 struct loop
*loop
= exit
->dest
->loop_father
;
5719 struct loop
*orig_loop
= entry
->dest
->loop_father
;
5720 basic_block switch_bb
, entry_bb
, nentry_bb
;
5721 VEC (basic_block
, heap
) *doms
;
5722 int total_freq
= 0, exit_freq
= 0;
5723 gcov_type total_count
= 0, exit_count
= 0;
5724 edge exits
[2], nexits
[2], e
;
5725 gimple_stmt_iterator gsi
;
5728 basic_block exit_bb
;
5729 gimple_stmt_iterator psi
;
5732 struct loop
*target
, *aloop
, *cloop
;
5734 gcc_assert (EDGE_COUNT (exit
->src
->succs
) == 2);
5736 exits
[1] = EDGE_SUCC (exit
->src
, EDGE_SUCC (exit
->src
, 0) == exit
);
5738 if (!can_copy_bbs_p (region
, n_region
))
5741 initialize_original_copy_tables ();
5742 set_loop_copy (orig_loop
, loop
);
5745 for (aloop
= orig_loop
->inner
; aloop
; aloop
= aloop
->next
)
5747 if (bb_part_of_region_p (aloop
->header
, region
, n_region
))
5749 cloop
= duplicate_loop (aloop
, target
);
5750 duplicate_subloops (aloop
, cloop
);
5756 region_copy
= XNEWVEC (basic_block
, n_region
);
5757 free_region_copy
= true;
5760 gcc_assert (!need_ssa_update_p (cfun
));
5762 /* Record blocks outside the region that are dominated by something
5764 doms
= get_dominated_by_region (CDI_DOMINATORS
, region
, n_region
);
5766 if (exit
->src
->count
)
5768 total_count
= exit
->src
->count
;
5769 exit_count
= exit
->count
;
5770 /* Fix up corner cases, to avoid division by zero or creation of negative
5772 if (exit_count
> total_count
)
5773 exit_count
= total_count
;
5777 total_freq
= exit
->src
->frequency
;
5778 exit_freq
= EDGE_FREQUENCY (exit
);
5779 /* Fix up corner cases, to avoid division by zero or creation of negative
5781 if (total_freq
== 0)
5783 if (exit_freq
> total_freq
)
5784 exit_freq
= total_freq
;
5787 copy_bbs (region
, n_region
, region_copy
, exits
, 2, nexits
, orig_loop
,
5788 split_edge_bb_loc (exit
));
5791 scale_bbs_frequencies_gcov_type (region
, n_region
,
5792 total_count
- exit_count
,
5794 scale_bbs_frequencies_gcov_type (region_copy
, n_region
, exit_count
,
5799 scale_bbs_frequencies_int (region
, n_region
, total_freq
- exit_freq
,
5801 scale_bbs_frequencies_int (region_copy
, n_region
, exit_freq
, total_freq
);
5804 /* Create the switch block, and put the exit condition to it. */
5805 entry_bb
= entry
->dest
;
5806 nentry_bb
= get_bb_copy (entry_bb
);
5807 if (!last_stmt (entry
->src
)
5808 || !stmt_ends_bb_p (last_stmt (entry
->src
)))
5809 switch_bb
= entry
->src
;
5811 switch_bb
= split_edge (entry
);
5812 set_immediate_dominator (CDI_DOMINATORS
, nentry_bb
, switch_bb
);
5814 gsi
= gsi_last_bb (switch_bb
);
5815 cond_stmt
= last_stmt (exit
->src
);
5816 gcc_assert (gimple_code (cond_stmt
) == GIMPLE_COND
);
5817 cond_stmt
= gimple_copy (cond_stmt
);
5819 gsi_insert_after (&gsi
, cond_stmt
, GSI_NEW_STMT
);
5821 sorig
= single_succ_edge (switch_bb
);
5822 sorig
->flags
= exits
[1]->flags
;
5823 snew
= make_edge (switch_bb
, nentry_bb
, exits
[0]->flags
);
5825 /* Register the new edge from SWITCH_BB in loop exit lists. */
5826 rescan_loop_exit (snew
, true, false);
5828 /* Add the PHI node arguments. */
5829 add_phi_args_after_copy (region_copy
, n_region
, snew
);
5831 /* Get rid of now superfluous conditions and associated edges (and phi node
5833 exit_bb
= exit
->dest
;
5835 e
= redirect_edge_and_branch (exits
[0], exits
[1]->dest
);
5836 PENDING_STMT (e
) = NULL
;
5838 /* The latch of ORIG_LOOP was copied, and so was the backedge
5839 to the original header. We redirect this backedge to EXIT_BB. */
5840 for (i
= 0; i
< n_region
; i
++)
5841 if (get_bb_original (region_copy
[i
]) == orig_loop
->latch
)
5843 gcc_assert (single_succ_edge (region_copy
[i
]));
5844 e
= redirect_edge_and_branch (single_succ_edge (region_copy
[i
]), exit_bb
);
5845 PENDING_STMT (e
) = NULL
;
5846 for (psi
= gsi_start_phis (exit_bb
);
5850 phi
= gsi_stmt (psi
);
5851 def
= PHI_ARG_DEF (phi
, nexits
[0]->dest_idx
);
5852 add_phi_arg (phi
, def
, e
, gimple_phi_arg_location_from_edge (phi
, e
));
5855 e
= redirect_edge_and_branch (nexits
[1], nexits
[0]->dest
);
5856 PENDING_STMT (e
) = NULL
;
5858 /* Anything that is outside of the region, but was dominated by something
5859 inside needs to update dominance info. */
5860 iterate_fix_dominators (CDI_DOMINATORS
, doms
, false);
5861 VEC_free (basic_block
, heap
, doms
);
5862 /* Update the SSA web. */
5863 update_ssa (TODO_update_ssa
);
5865 if (free_region_copy
)
5868 free_original_copy_tables ();
5872 /* Add all the blocks dominated by ENTRY to the array BBS_P. Stop
5873 adding blocks when the dominator traversal reaches EXIT. This
5874 function silently assumes that ENTRY strictly dominates EXIT. */
5877 gather_blocks_in_sese_region (basic_block entry
, basic_block exit
,
5878 VEC(basic_block
,heap
) **bbs_p
)
5882 for (son
= first_dom_son (CDI_DOMINATORS
, entry
);
5884 son
= next_dom_son (CDI_DOMINATORS
, son
))
5886 VEC_safe_push (basic_block
, heap
, *bbs_p
, son
);
5888 gather_blocks_in_sese_region (son
, exit
, bbs_p
);
5892 /* Replaces *TP with a duplicate (belonging to function TO_CONTEXT).
5893 The duplicates are recorded in VARS_MAP. */
5896 replace_by_duplicate_decl (tree
*tp
, struct pointer_map_t
*vars_map
,
5899 tree t
= *tp
, new_t
;
5900 struct function
*f
= DECL_STRUCT_FUNCTION (to_context
);
5903 if (DECL_CONTEXT (t
) == to_context
)
5906 loc
= pointer_map_contains (vars_map
, t
);
5910 loc
= pointer_map_insert (vars_map
, t
);
5914 new_t
= copy_var_decl (t
, DECL_NAME (t
), TREE_TYPE (t
));
5915 add_local_decl (f
, new_t
);
5919 gcc_assert (TREE_CODE (t
) == CONST_DECL
);
5920 new_t
= copy_node (t
);
5922 DECL_CONTEXT (new_t
) = to_context
;
5927 new_t
= (tree
) *loc
;
5933 /* Creates an ssa name in TO_CONTEXT equivalent to NAME.
5934 VARS_MAP maps old ssa names and var_decls to the new ones. */
5937 replace_ssa_name (tree name
, struct pointer_map_t
*vars_map
,
5941 tree new_name
, decl
= SSA_NAME_VAR (name
);
5943 gcc_assert (is_gimple_reg (name
));
5945 loc
= pointer_map_contains (vars_map
, name
);
5949 replace_by_duplicate_decl (&decl
, vars_map
, to_context
);
5951 push_cfun (DECL_STRUCT_FUNCTION (to_context
));
5952 if (gimple_in_ssa_p (cfun
))
5953 add_referenced_var (decl
);
5955 new_name
= make_ssa_name (decl
, SSA_NAME_DEF_STMT (name
));
5956 if (SSA_NAME_IS_DEFAULT_DEF (name
))
5957 set_default_def (decl
, new_name
);
5960 loc
= pointer_map_insert (vars_map
, name
);
5964 new_name
= (tree
) *loc
;
5975 struct pointer_map_t
*vars_map
;
5976 htab_t new_label_map
;
5977 struct pointer_map_t
*eh_map
;
5981 /* Helper for move_block_to_fn. Set TREE_BLOCK in every expression
5982 contained in *TP if it has been ORIG_BLOCK previously and change the
5983 DECL_CONTEXT of every local variable referenced in *TP. */
5986 move_stmt_op (tree
*tp
, int *walk_subtrees
, void *data
)
5988 struct walk_stmt_info
*wi
= (struct walk_stmt_info
*) data
;
5989 struct move_stmt_d
*p
= (struct move_stmt_d
*) wi
->info
;
5993 /* We should never have TREE_BLOCK set on non-statements. */
5994 gcc_assert (!TREE_BLOCK (t
));
5996 else if (DECL_P (t
) || TREE_CODE (t
) == SSA_NAME
)
5998 if (TREE_CODE (t
) == SSA_NAME
)
5999 *tp
= replace_ssa_name (t
, p
->vars_map
, p
->to_context
);
6000 else if (TREE_CODE (t
) == LABEL_DECL
)
6002 if (p
->new_label_map
)
6004 struct tree_map in
, *out
;
6006 out
= (struct tree_map
*)
6007 htab_find_with_hash (p
->new_label_map
, &in
, DECL_UID (t
));
6012 DECL_CONTEXT (t
) = p
->to_context
;
6014 else if (p
->remap_decls_p
)
6016 /* Replace T with its duplicate. T should no longer appear in the
6017 parent function, so this looks wasteful; however, it may appear
6018 in referenced_vars, and more importantly, as virtual operands of
6019 statements, and in alias lists of other variables. It would be
6020 quite difficult to expunge it from all those places. ??? It might
6021 suffice to do this for addressable variables. */
6022 if ((TREE_CODE (t
) == VAR_DECL
6023 && !is_global_var (t
))
6024 || TREE_CODE (t
) == CONST_DECL
)
6025 replace_by_duplicate_decl (tp
, p
->vars_map
, p
->to_context
);
6028 && gimple_in_ssa_p (cfun
))
6030 push_cfun (DECL_STRUCT_FUNCTION (p
->to_context
));
6031 add_referenced_var (*tp
);
6037 else if (TYPE_P (t
))
6043 /* Helper for move_stmt_r. Given an EH region number for the source
6044 function, map that to the duplicate EH regio number in the dest. */
6047 move_stmt_eh_region_nr (int old_nr
, struct move_stmt_d
*p
)
6049 eh_region old_r
, new_r
;
6052 old_r
= get_eh_region_from_number (old_nr
);
6053 slot
= pointer_map_contains (p
->eh_map
, old_r
);
6054 new_r
= (eh_region
) *slot
;
6056 return new_r
->index
;
6059 /* Similar, but operate on INTEGER_CSTs. */
6062 move_stmt_eh_region_tree_nr (tree old_t_nr
, struct move_stmt_d
*p
)
6066 old_nr
= tree_low_cst (old_t_nr
, 0);
6067 new_nr
= move_stmt_eh_region_nr (old_nr
, p
);
6069 return build_int_cst (integer_type_node
, new_nr
);
6072 /* Like move_stmt_op, but for gimple statements.
6074 Helper for move_block_to_fn. Set GIMPLE_BLOCK in every expression
6075 contained in the current statement in *GSI_P and change the
6076 DECL_CONTEXT of every local variable referenced in the current
6080 move_stmt_r (gimple_stmt_iterator
*gsi_p
, bool *handled_ops_p
,
6081 struct walk_stmt_info
*wi
)
6083 struct move_stmt_d
*p
= (struct move_stmt_d
*) wi
->info
;
6084 gimple stmt
= gsi_stmt (*gsi_p
);
6085 tree block
= gimple_block (stmt
);
6087 if (p
->orig_block
== NULL_TREE
6088 || block
== p
->orig_block
6089 || block
== NULL_TREE
)
6090 gimple_set_block (stmt
, p
->new_block
);
6091 #ifdef ENABLE_CHECKING
6092 else if (block
!= p
->new_block
)
6094 while (block
&& block
!= p
->orig_block
)
6095 block
= BLOCK_SUPERCONTEXT (block
);
6100 switch (gimple_code (stmt
))
6103 /* Remap the region numbers for __builtin_eh_{pointer,filter}. */
6105 tree r
, fndecl
= gimple_call_fndecl (stmt
);
6106 if (fndecl
&& DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
)
6107 switch (DECL_FUNCTION_CODE (fndecl
))
6109 case BUILT_IN_EH_COPY_VALUES
:
6110 r
= gimple_call_arg (stmt
, 1);
6111 r
= move_stmt_eh_region_tree_nr (r
, p
);
6112 gimple_call_set_arg (stmt
, 1, r
);
6115 case BUILT_IN_EH_POINTER
:
6116 case BUILT_IN_EH_FILTER
:
6117 r
= gimple_call_arg (stmt
, 0);
6118 r
= move_stmt_eh_region_tree_nr (r
, p
);
6119 gimple_call_set_arg (stmt
, 0, r
);
6130 int r
= gimple_resx_region (stmt
);
6131 r
= move_stmt_eh_region_nr (r
, p
);
6132 gimple_resx_set_region (stmt
, r
);
6136 case GIMPLE_EH_DISPATCH
:
6138 int r
= gimple_eh_dispatch_region (stmt
);
6139 r
= move_stmt_eh_region_nr (r
, p
);
6140 gimple_eh_dispatch_set_region (stmt
, r
);
6144 case GIMPLE_OMP_RETURN
:
6145 case GIMPLE_OMP_CONTINUE
:
6148 if (is_gimple_omp (stmt
))
6150 /* Do not remap variables inside OMP directives. Variables
6151 referenced in clauses and directive header belong to the
6152 parent function and should not be moved into the child
6154 bool save_remap_decls_p
= p
->remap_decls_p
;
6155 p
->remap_decls_p
= false;
6156 *handled_ops_p
= true;
6158 walk_gimple_seq_mod (gimple_omp_body_ptr (stmt
), move_stmt_r
,
6161 p
->remap_decls_p
= save_remap_decls_p
;
6169 /* Move basic block BB from function CFUN to function DEST_FN. The
6170 block is moved out of the original linked list and placed after
6171 block AFTER in the new list. Also, the block is removed from the
6172 original array of blocks and placed in DEST_FN's array of blocks.
6173 If UPDATE_EDGE_COUNT_P is true, the edge counts on both CFGs is
6174 updated to reflect the moved edges.
6176 The local variables are remapped to new instances, VARS_MAP is used
6177 to record the mapping. */
6180 move_block_to_fn (struct function
*dest_cfun
, basic_block bb
,
6181 basic_block after
, bool update_edge_count_p
,
6182 struct move_stmt_d
*d
)
6184 struct control_flow_graph
*cfg
;
6187 gimple_stmt_iterator si
;
6188 unsigned old_len
, new_len
;
6190 /* Remove BB from dominance structures. */
6191 delete_from_dominance_info (CDI_DOMINATORS
, bb
);
6193 remove_bb_from_loops (bb
);
6195 /* Link BB to the new linked list. */
6196 move_block_after (bb
, after
);
6198 /* Update the edge count in the corresponding flowgraphs. */
6199 if (update_edge_count_p
)
6200 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
6202 cfun
->cfg
->x_n_edges
--;
6203 dest_cfun
->cfg
->x_n_edges
++;
6206 /* Remove BB from the original basic block array. */
6207 VEC_replace (basic_block
, cfun
->cfg
->x_basic_block_info
, bb
->index
, NULL
);
6208 cfun
->cfg
->x_n_basic_blocks
--;
6210 /* Grow DEST_CFUN's basic block array if needed. */
6211 cfg
= dest_cfun
->cfg
;
6212 cfg
->x_n_basic_blocks
++;
6213 if (bb
->index
>= cfg
->x_last_basic_block
)
6214 cfg
->x_last_basic_block
= bb
->index
+ 1;
6216 old_len
= VEC_length (basic_block
, cfg
->x_basic_block_info
);
6217 if ((unsigned) cfg
->x_last_basic_block
>= old_len
)
6219 new_len
= cfg
->x_last_basic_block
+ (cfg
->x_last_basic_block
+ 3) / 4;
6220 VEC_safe_grow_cleared (basic_block
, gc
, cfg
->x_basic_block_info
,
6224 VEC_replace (basic_block
, cfg
->x_basic_block_info
,
6227 /* Remap the variables in phi nodes. */
6228 for (si
= gsi_start_phis (bb
); !gsi_end_p (si
); )
6230 gimple phi
= gsi_stmt (si
);
6232 tree op
= PHI_RESULT (phi
);
6235 if (!is_gimple_reg (op
))
6237 /* Remove the phi nodes for virtual operands (alias analysis will be
6238 run for the new function, anyway). */
6239 remove_phi_node (&si
, true);
6243 SET_PHI_RESULT (phi
,
6244 replace_ssa_name (op
, d
->vars_map
, dest_cfun
->decl
));
6245 FOR_EACH_PHI_ARG (use
, phi
, oi
, SSA_OP_USE
)
6247 op
= USE_FROM_PTR (use
);
6248 if (TREE_CODE (op
) == SSA_NAME
)
6249 SET_USE (use
, replace_ssa_name (op
, d
->vars_map
, dest_cfun
->decl
));
6255 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
6257 gimple stmt
= gsi_stmt (si
);
6258 struct walk_stmt_info wi
;
6260 memset (&wi
, 0, sizeof (wi
));
6262 walk_gimple_stmt (&si
, move_stmt_r
, move_stmt_op
, &wi
);
6264 if (gimple_code (stmt
) == GIMPLE_LABEL
)
6266 tree label
= gimple_label_label (stmt
);
6267 int uid
= LABEL_DECL_UID (label
);
6269 gcc_assert (uid
> -1);
6271 old_len
= VEC_length (basic_block
, cfg
->x_label_to_block_map
);
6272 if (old_len
<= (unsigned) uid
)
6274 new_len
= 3 * uid
/ 2 + 1;
6275 VEC_safe_grow_cleared (basic_block
, gc
,
6276 cfg
->x_label_to_block_map
, new_len
);
6279 VEC_replace (basic_block
, cfg
->x_label_to_block_map
, uid
, bb
);
6280 VEC_replace (basic_block
, cfun
->cfg
->x_label_to_block_map
, uid
, NULL
);
6282 gcc_assert (DECL_CONTEXT (label
) == dest_cfun
->decl
);
6284 if (uid
>= dest_cfun
->cfg
->last_label_uid
)
6285 dest_cfun
->cfg
->last_label_uid
= uid
+ 1;
6288 maybe_duplicate_eh_stmt_fn (dest_cfun
, stmt
, cfun
, stmt
, d
->eh_map
, 0);
6289 remove_stmt_from_eh_lp_fn (cfun
, stmt
);
6291 gimple_duplicate_stmt_histograms (dest_cfun
, stmt
, cfun
, stmt
);
6292 gimple_remove_stmt_histograms (cfun
, stmt
);
6294 /* We cannot leave any operands allocated from the operand caches of
6295 the current function. */
6296 free_stmt_operands (stmt
);
6297 push_cfun (dest_cfun
);
6302 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
6305 tree block
= e
->goto_block
;
6306 if (d
->orig_block
== NULL_TREE
6307 || block
== d
->orig_block
)
6308 e
->goto_block
= d
->new_block
;
6309 #ifdef ENABLE_CHECKING
6310 else if (block
!= d
->new_block
)
6312 while (block
&& block
!= d
->orig_block
)
6313 block
= BLOCK_SUPERCONTEXT (block
);
6320 /* Examine the statements in BB (which is in SRC_CFUN); find and return
6321 the outermost EH region. Use REGION as the incoming base EH region. */
6324 find_outermost_region_in_block (struct function
*src_cfun
,
6325 basic_block bb
, eh_region region
)
6327 gimple_stmt_iterator si
;
6329 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
6331 gimple stmt
= gsi_stmt (si
);
6332 eh_region stmt_region
;
6335 lp_nr
= lookup_stmt_eh_lp_fn (src_cfun
, stmt
);
6336 stmt_region
= get_eh_region_from_lp_number_fn (src_cfun
, lp_nr
);
6340 region
= stmt_region
;
6341 else if (stmt_region
!= region
)
6343 region
= eh_region_outermost (src_cfun
, stmt_region
, region
);
6344 gcc_assert (region
!= NULL
);
6353 new_label_mapper (tree decl
, void *data
)
6355 htab_t hash
= (htab_t
) data
;
6359 gcc_assert (TREE_CODE (decl
) == LABEL_DECL
);
6361 m
= XNEW (struct tree_map
);
6362 m
->hash
= DECL_UID (decl
);
6363 m
->base
.from
= decl
;
6364 m
->to
= create_artificial_label (UNKNOWN_LOCATION
);
6365 LABEL_DECL_UID (m
->to
) = LABEL_DECL_UID (decl
);
6366 if (LABEL_DECL_UID (m
->to
) >= cfun
->cfg
->last_label_uid
)
6367 cfun
->cfg
->last_label_uid
= LABEL_DECL_UID (m
->to
) + 1;
6369 slot
= htab_find_slot_with_hash (hash
, m
, m
->hash
, INSERT
);
6370 gcc_assert (*slot
== NULL
);
6377 /* Change DECL_CONTEXT of all BLOCK_VARS in block, including
6381 replace_block_vars_by_duplicates (tree block
, struct pointer_map_t
*vars_map
,
6386 for (tp
= &BLOCK_VARS (block
); *tp
; tp
= &DECL_CHAIN (*tp
))
6389 if (TREE_CODE (t
) != VAR_DECL
&& TREE_CODE (t
) != CONST_DECL
)
6391 replace_by_duplicate_decl (&t
, vars_map
, to_context
);
6394 if (TREE_CODE (*tp
) == VAR_DECL
&& DECL_HAS_VALUE_EXPR_P (*tp
))
6396 SET_DECL_VALUE_EXPR (t
, DECL_VALUE_EXPR (*tp
));
6397 DECL_HAS_VALUE_EXPR_P (t
) = 1;
6399 DECL_CHAIN (t
) = DECL_CHAIN (*tp
);
6404 for (block
= BLOCK_SUBBLOCKS (block
); block
; block
= BLOCK_CHAIN (block
))
6405 replace_block_vars_by_duplicates (block
, vars_map
, to_context
);
6408 /* Move a single-entry, single-exit region delimited by ENTRY_BB and
6409 EXIT_BB to function DEST_CFUN. The whole region is replaced by a
6410 single basic block in the original CFG and the new basic block is
6411 returned. DEST_CFUN must not have a CFG yet.
6413 Note that the region need not be a pure SESE region. Blocks inside
6414 the region may contain calls to abort/exit. The only restriction
6415 is that ENTRY_BB should be the only entry point and it must
6418 Change TREE_BLOCK of all statements in ORIG_BLOCK to the new
6419 functions outermost BLOCK, move all subblocks of ORIG_BLOCK
6420 to the new function.
6422 All local variables referenced in the region are assumed to be in
6423 the corresponding BLOCK_VARS and unexpanded variable lists
6424 associated with DEST_CFUN. */
6427 move_sese_region_to_fn (struct function
*dest_cfun
, basic_block entry_bb
,
6428 basic_block exit_bb
, tree orig_block
)
6430 VEC(basic_block
,heap
) *bbs
, *dom_bbs
;
6431 basic_block dom_entry
= get_immediate_dominator (CDI_DOMINATORS
, entry_bb
);
6432 basic_block after
, bb
, *entry_pred
, *exit_succ
, abb
;
6433 struct function
*saved_cfun
= cfun
;
6434 int *entry_flag
, *exit_flag
;
6435 unsigned *entry_prob
, *exit_prob
;
6436 unsigned i
, num_entry_edges
, num_exit_edges
;
6439 htab_t new_label_map
;
6440 struct pointer_map_t
*vars_map
, *eh_map
;
6441 struct loop
*loop
= entry_bb
->loop_father
;
6442 struct move_stmt_d d
;
6444 /* If ENTRY does not strictly dominate EXIT, this cannot be an SESE
6446 gcc_assert (entry_bb
!= exit_bb
6448 || dominated_by_p (CDI_DOMINATORS
, exit_bb
, entry_bb
)));
6450 /* Collect all the blocks in the region. Manually add ENTRY_BB
6451 because it won't be added by dfs_enumerate_from. */
6453 VEC_safe_push (basic_block
, heap
, bbs
, entry_bb
);
6454 gather_blocks_in_sese_region (entry_bb
, exit_bb
, &bbs
);
6456 /* The blocks that used to be dominated by something in BBS will now be
6457 dominated by the new block. */
6458 dom_bbs
= get_dominated_by_region (CDI_DOMINATORS
,
6459 VEC_address (basic_block
, bbs
),
6460 VEC_length (basic_block
, bbs
));
6462 /* Detach ENTRY_BB and EXIT_BB from CFUN->CFG. We need to remember
6463 the predecessor edges to ENTRY_BB and the successor edges to
6464 EXIT_BB so that we can re-attach them to the new basic block that
6465 will replace the region. */
6466 num_entry_edges
= EDGE_COUNT (entry_bb
->preds
);
6467 entry_pred
= (basic_block
*) xcalloc (num_entry_edges
, sizeof (basic_block
));
6468 entry_flag
= (int *) xcalloc (num_entry_edges
, sizeof (int));
6469 entry_prob
= XNEWVEC (unsigned, num_entry_edges
);
6471 for (ei
= ei_start (entry_bb
->preds
); (e
= ei_safe_edge (ei
)) != NULL
;)
6473 entry_prob
[i
] = e
->probability
;
6474 entry_flag
[i
] = e
->flags
;
6475 entry_pred
[i
++] = e
->src
;
6481 num_exit_edges
= EDGE_COUNT (exit_bb
->succs
);
6482 exit_succ
= (basic_block
*) xcalloc (num_exit_edges
,
6483 sizeof (basic_block
));
6484 exit_flag
= (int *) xcalloc (num_exit_edges
, sizeof (int));
6485 exit_prob
= XNEWVEC (unsigned, num_exit_edges
);
6487 for (ei
= ei_start (exit_bb
->succs
); (e
= ei_safe_edge (ei
)) != NULL
;)
6489 exit_prob
[i
] = e
->probability
;
6490 exit_flag
[i
] = e
->flags
;
6491 exit_succ
[i
++] = e
->dest
;
6503 /* Switch context to the child function to initialize DEST_FN's CFG. */
6504 gcc_assert (dest_cfun
->cfg
== NULL
);
6505 push_cfun (dest_cfun
);
6507 init_empty_tree_cfg ();
6509 /* Initialize EH information for the new function. */
6511 new_label_map
= NULL
;
6514 eh_region region
= NULL
;
6516 FOR_EACH_VEC_ELT (basic_block
, bbs
, i
, bb
)
6517 region
= find_outermost_region_in_block (saved_cfun
, bb
, region
);
6519 init_eh_for_function ();
6522 new_label_map
= htab_create (17, tree_map_hash
, tree_map_eq
, free
);
6523 eh_map
= duplicate_eh_regions (saved_cfun
, region
, 0,
6524 new_label_mapper
, new_label_map
);
6530 /* Move blocks from BBS into DEST_CFUN. */
6531 gcc_assert (VEC_length (basic_block
, bbs
) >= 2);
6532 after
= dest_cfun
->cfg
->x_entry_block_ptr
;
6533 vars_map
= pointer_map_create ();
6535 memset (&d
, 0, sizeof (d
));
6536 d
.orig_block
= orig_block
;
6537 d
.new_block
= DECL_INITIAL (dest_cfun
->decl
);
6538 d
.from_context
= cfun
->decl
;
6539 d
.to_context
= dest_cfun
->decl
;
6540 d
.vars_map
= vars_map
;
6541 d
.new_label_map
= new_label_map
;
6543 d
.remap_decls_p
= true;
6545 FOR_EACH_VEC_ELT (basic_block
, bbs
, i
, bb
)
6547 /* No need to update edge counts on the last block. It has
6548 already been updated earlier when we detached the region from
6549 the original CFG. */
6550 move_block_to_fn (dest_cfun
, bb
, after
, bb
!= exit_bb
, &d
);
6554 /* Rewire BLOCK_SUBBLOCKS of orig_block. */
6558 gcc_assert (BLOCK_SUBBLOCKS (DECL_INITIAL (dest_cfun
->decl
))
6560 BLOCK_SUBBLOCKS (DECL_INITIAL (dest_cfun
->decl
))
6561 = BLOCK_SUBBLOCKS (orig_block
);
6562 for (block
= BLOCK_SUBBLOCKS (orig_block
);
6563 block
; block
= BLOCK_CHAIN (block
))
6564 BLOCK_SUPERCONTEXT (block
) = DECL_INITIAL (dest_cfun
->decl
);
6565 BLOCK_SUBBLOCKS (orig_block
) = NULL_TREE
;
6568 replace_block_vars_by_duplicates (DECL_INITIAL (dest_cfun
->decl
),
6569 vars_map
, dest_cfun
->decl
);
6572 htab_delete (new_label_map
);
6574 pointer_map_destroy (eh_map
);
6575 pointer_map_destroy (vars_map
);
6577 /* Rewire the entry and exit blocks. The successor to the entry
6578 block turns into the successor of DEST_FN's ENTRY_BLOCK_PTR in
6579 the child function. Similarly, the predecessor of DEST_FN's
6580 EXIT_BLOCK_PTR turns into the predecessor of EXIT_BLOCK_PTR. We
6581 need to switch CFUN between DEST_CFUN and SAVED_CFUN so that the
6582 various CFG manipulation function get to the right CFG.
6584 FIXME, this is silly. The CFG ought to become a parameter to
6586 push_cfun (dest_cfun
);
6587 make_edge (ENTRY_BLOCK_PTR
, entry_bb
, EDGE_FALLTHRU
);
6589 make_edge (exit_bb
, EXIT_BLOCK_PTR
, 0);
6592 /* Back in the original function, the SESE region has disappeared,
6593 create a new basic block in its place. */
6594 bb
= create_empty_bb (entry_pred
[0]);
6596 add_bb_to_loop (bb
, loop
);
6597 for (i
= 0; i
< num_entry_edges
; i
++)
6599 e
= make_edge (entry_pred
[i
], bb
, entry_flag
[i
]);
6600 e
->probability
= entry_prob
[i
];
6603 for (i
= 0; i
< num_exit_edges
; i
++)
6605 e
= make_edge (bb
, exit_succ
[i
], exit_flag
[i
]);
6606 e
->probability
= exit_prob
[i
];
6609 set_immediate_dominator (CDI_DOMINATORS
, bb
, dom_entry
);
6610 FOR_EACH_VEC_ELT (basic_block
, dom_bbs
, i
, abb
)
6611 set_immediate_dominator (CDI_DOMINATORS
, abb
, bb
);
6612 VEC_free (basic_block
, heap
, dom_bbs
);
6623 VEC_free (basic_block
, heap
, bbs
);
6629 /* Dump FUNCTION_DECL FN to file FILE using FLAGS (see TDF_* in tree-pass.h)
6633 dump_function_to_file (tree fn
, FILE *file
, int flags
)
6636 struct function
*dsf
;
6637 bool ignore_topmost_bind
= false, any_var
= false;
6640 bool tmclone
= TREE_CODE (fn
) == FUNCTION_DECL
&& decl_is_tm_clone (fn
);
6642 fprintf (file
, "%s %s(", lang_hooks
.decl_printable_name (fn
, 2),
6643 tmclone
? "[tm-clone] " : "");
6645 arg
= DECL_ARGUMENTS (fn
);
6648 print_generic_expr (file
, TREE_TYPE (arg
), dump_flags
);
6649 fprintf (file
, " ");
6650 print_generic_expr (file
, arg
, dump_flags
);
6651 if (flags
& TDF_VERBOSE
)
6652 print_node (file
, "", arg
, 4);
6653 if (DECL_CHAIN (arg
))
6654 fprintf (file
, ", ");
6655 arg
= DECL_CHAIN (arg
);
6657 fprintf (file
, ")\n");
6659 if (flags
& TDF_VERBOSE
)
6660 print_node (file
, "", fn
, 2);
6662 dsf
= DECL_STRUCT_FUNCTION (fn
);
6663 if (dsf
&& (flags
& TDF_EH
))
6664 dump_eh_tree (file
, dsf
);
6666 if (flags
& TDF_RAW
&& !gimple_has_body_p (fn
))
6668 dump_node (fn
, TDF_SLIM
| flags
, file
);
6672 /* Switch CFUN to point to FN. */
6673 push_cfun (DECL_STRUCT_FUNCTION (fn
));
6675 /* When GIMPLE is lowered, the variables are no longer available in
6676 BIND_EXPRs, so display them separately. */
6677 if (cfun
&& cfun
->decl
== fn
&& !VEC_empty (tree
, cfun
->local_decls
))
6680 ignore_topmost_bind
= true;
6682 fprintf (file
, "{\n");
6683 FOR_EACH_LOCAL_DECL (cfun
, ix
, var
)
6685 print_generic_decl (file
, var
, flags
);
6686 if (flags
& TDF_VERBOSE
)
6687 print_node (file
, "", var
, 4);
6688 fprintf (file
, "\n");
6694 if (cfun
&& cfun
->decl
== fn
&& cfun
->cfg
&& basic_block_info
)
6696 /* If the CFG has been built, emit a CFG-based dump. */
6697 check_bb_profile (ENTRY_BLOCK_PTR
, file
);
6698 if (!ignore_topmost_bind
)
6699 fprintf (file
, "{\n");
6701 if (any_var
&& n_basic_blocks
)
6702 fprintf (file
, "\n");
6705 gimple_dump_bb (bb
, file
, 2, flags
);
6707 fprintf (file
, "}\n");
6708 check_bb_profile (EXIT_BLOCK_PTR
, file
);
6710 else if (DECL_SAVED_TREE (fn
) == NULL
)
6712 /* The function is now in GIMPLE form but the CFG has not been
6713 built yet. Emit the single sequence of GIMPLE statements
6714 that make up its body. */
6715 gimple_seq body
= gimple_body (fn
);
6717 if (gimple_seq_first_stmt (body
)
6718 && gimple_seq_first_stmt (body
) == gimple_seq_last_stmt (body
)
6719 && gimple_code (gimple_seq_first_stmt (body
)) == GIMPLE_BIND
)
6720 print_gimple_seq (file
, body
, 0, flags
);
6723 if (!ignore_topmost_bind
)
6724 fprintf (file
, "{\n");
6727 fprintf (file
, "\n");
6729 print_gimple_seq (file
, body
, 2, flags
);
6730 fprintf (file
, "}\n");
6737 /* Make a tree based dump. */
6738 chain
= DECL_SAVED_TREE (fn
);
6740 if (chain
&& TREE_CODE (chain
) == BIND_EXPR
)
6742 if (ignore_topmost_bind
)
6744 chain
= BIND_EXPR_BODY (chain
);
6752 if (!ignore_topmost_bind
)
6753 fprintf (file
, "{\n");
6758 fprintf (file
, "\n");
6760 print_generic_stmt_indented (file
, chain
, flags
, indent
);
6761 if (ignore_topmost_bind
)
6762 fprintf (file
, "}\n");
6765 if (flags
& TDF_ENUMERATE_LOCALS
)
6766 dump_enumerated_decls (file
, flags
);
6767 fprintf (file
, "\n\n");
6774 /* Dump FUNCTION_DECL FN to stderr using FLAGS (see TDF_* in tree.h) */
6777 debug_function (tree fn
, int flags
)
6779 dump_function_to_file (fn
, stderr
, flags
);
6783 /* Print on FILE the indexes for the predecessors of basic_block BB. */
6786 print_pred_bbs (FILE *file
, basic_block bb
)
6791 FOR_EACH_EDGE (e
, ei
, bb
->preds
)
6792 fprintf (file
, "bb_%d ", e
->src
->index
);
6796 /* Print on FILE the indexes for the successors of basic_block BB. */
6799 print_succ_bbs (FILE *file
, basic_block bb
)
6804 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
6805 fprintf (file
, "bb_%d ", e
->dest
->index
);
6808 /* Print to FILE the basic block BB following the VERBOSITY level. */
6811 print_loops_bb (FILE *file
, basic_block bb
, int indent
, int verbosity
)
6813 char *s_indent
= (char *) alloca ((size_t) indent
+ 1);
6814 memset ((void *) s_indent
, ' ', (size_t) indent
);
6815 s_indent
[indent
] = '\0';
6817 /* Print basic_block's header. */
6820 fprintf (file
, "%s bb_%d (preds = {", s_indent
, bb
->index
);
6821 print_pred_bbs (file
, bb
);
6822 fprintf (file
, "}, succs = {");
6823 print_succ_bbs (file
, bb
);
6824 fprintf (file
, "})\n");
6827 /* Print basic_block's body. */
6830 fprintf (file
, "%s {\n", s_indent
);
6831 gimple_dump_bb (bb
, file
, indent
+ 4, TDF_VOPS
|TDF_MEMSYMS
);
6832 fprintf (file
, "%s }\n", s_indent
);
6836 static void print_loop_and_siblings (FILE *, struct loop
*, int, int);
6838 /* Pretty print LOOP on FILE, indented INDENT spaces. Following
6839 VERBOSITY level this outputs the contents of the loop, or just its
6843 print_loop (FILE *file
, struct loop
*loop
, int indent
, int verbosity
)
6851 s_indent
= (char *) alloca ((size_t) indent
+ 1);
6852 memset ((void *) s_indent
, ' ', (size_t) indent
);
6853 s_indent
[indent
] = '\0';
6855 /* Print loop's header. */
6856 fprintf (file
, "%sloop_%d (header = %d, latch = %d", s_indent
,
6857 loop
->num
, loop
->header
->index
, loop
->latch
->index
);
6858 fprintf (file
, ", niter = ");
6859 print_generic_expr (file
, loop
->nb_iterations
, 0);
6861 if (loop
->any_upper_bound
)
6863 fprintf (file
, ", upper_bound = ");
6864 dump_double_int (file
, loop
->nb_iterations_upper_bound
, true);
6867 if (loop
->any_estimate
)
6869 fprintf (file
, ", estimate = ");
6870 dump_double_int (file
, loop
->nb_iterations_estimate
, true);
6872 fprintf (file
, ")\n");
6874 /* Print loop's body. */
6877 fprintf (file
, "%s{\n", s_indent
);
6879 if (bb
->loop_father
== loop
)
6880 print_loops_bb (file
, bb
, indent
, verbosity
);
6882 print_loop_and_siblings (file
, loop
->inner
, indent
+ 2, verbosity
);
6883 fprintf (file
, "%s}\n", s_indent
);
6887 /* Print the LOOP and its sibling loops on FILE, indented INDENT
6888 spaces. Following VERBOSITY level this outputs the contents of the
6889 loop, or just its structure. */
6892 print_loop_and_siblings (FILE *file
, struct loop
*loop
, int indent
, int verbosity
)
6897 print_loop (file
, loop
, indent
, verbosity
);
6898 print_loop_and_siblings (file
, loop
->next
, indent
, verbosity
);
6901 /* Follow a CFG edge from the entry point of the program, and on entry
6902 of a loop, pretty print the loop structure on FILE. */
6905 print_loops (FILE *file
, int verbosity
)
6909 bb
= ENTRY_BLOCK_PTR
;
6910 if (bb
&& bb
->loop_father
)
6911 print_loop_and_siblings (file
, bb
->loop_father
, 0, verbosity
);
6915 /* Debugging loops structure at tree level, at some VERBOSITY level. */
6918 debug_loops (int verbosity
)
6920 print_loops (stderr
, verbosity
);
6923 /* Print on stderr the code of LOOP, at some VERBOSITY level. */
6926 debug_loop (struct loop
*loop
, int verbosity
)
6928 print_loop (stderr
, loop
, 0, verbosity
);
6931 /* Print on stderr the code of loop number NUM, at some VERBOSITY
6935 debug_loop_num (unsigned num
, int verbosity
)
6937 debug_loop (get_loop (num
), verbosity
);
6940 /* Return true if BB ends with a call, possibly followed by some
6941 instructions that must stay with the call. Return false,
6945 gimple_block_ends_with_call_p (basic_block bb
)
6947 gimple_stmt_iterator gsi
= gsi_last_nondebug_bb (bb
);
6948 return !gsi_end_p (gsi
) && is_gimple_call (gsi_stmt (gsi
));
6952 /* Return true if BB ends with a conditional branch. Return false,
6956 gimple_block_ends_with_condjump_p (const_basic_block bb
)
6958 gimple stmt
= last_stmt (CONST_CAST_BB (bb
));
6959 return (stmt
&& gimple_code (stmt
) == GIMPLE_COND
);
6963 /* Return true if we need to add fake edge to exit at statement T.
6964 Helper function for gimple_flow_call_edges_add. */
6967 need_fake_edge_p (gimple t
)
6969 tree fndecl
= NULL_TREE
;
6972 /* NORETURN and LONGJMP calls already have an edge to exit.
6973 CONST and PURE calls do not need one.
6974 We don't currently check for CONST and PURE here, although
6975 it would be a good idea, because those attributes are
6976 figured out from the RTL in mark_constant_function, and
6977 the counter incrementation code from -fprofile-arcs
6978 leads to different results from -fbranch-probabilities. */
6979 if (is_gimple_call (t
))
6981 fndecl
= gimple_call_fndecl (t
);
6982 call_flags
= gimple_call_flags (t
);
6985 if (is_gimple_call (t
)
6987 && DECL_BUILT_IN (fndecl
)
6988 && (call_flags
& ECF_NOTHROW
)
6989 && !(call_flags
& ECF_RETURNS_TWICE
)
6990 /* fork() doesn't really return twice, but the effect of
6991 wrapping it in __gcov_fork() which calls __gcov_flush()
6992 and clears the counters before forking has the same
6993 effect as returning twice. Force a fake edge. */
6994 && !(DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
6995 && DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_FORK
))
6998 if (is_gimple_call (t
))
7004 if (!(call_flags
& ECF_NORETURN
))
7008 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
7009 if ((e
->flags
& EDGE_FAKE
) == 0)
7013 if (gimple_code (t
) == GIMPLE_ASM
7014 && (gimple_asm_volatile_p (t
) || gimple_asm_input_p (t
)))
7021 /* Add fake edges to the function exit for any non constant and non
7022 noreturn calls (or noreturn calls with EH/abnormal edges),
7023 volatile inline assembly in the bitmap of blocks specified by BLOCKS
7024 or to the whole CFG if BLOCKS is zero. Return the number of blocks
7027 The goal is to expose cases in which entering a basic block does
7028 not imply that all subsequent instructions must be executed. */
7031 gimple_flow_call_edges_add (sbitmap blocks
)
7034 int blocks_split
= 0;
7035 int last_bb
= last_basic_block
;
7036 bool check_last_block
= false;
7038 if (n_basic_blocks
== NUM_FIXED_BLOCKS
)
7042 check_last_block
= true;
7044 check_last_block
= TEST_BIT (blocks
, EXIT_BLOCK_PTR
->prev_bb
->index
);
7046 /* In the last basic block, before epilogue generation, there will be
7047 a fallthru edge to EXIT. Special care is required if the last insn
7048 of the last basic block is a call because make_edge folds duplicate
7049 edges, which would result in the fallthru edge also being marked
7050 fake, which would result in the fallthru edge being removed by
7051 remove_fake_edges, which would result in an invalid CFG.
7053 Moreover, we can't elide the outgoing fake edge, since the block
7054 profiler needs to take this into account in order to solve the minimal
7055 spanning tree in the case that the call doesn't return.
7057 Handle this by adding a dummy instruction in a new last basic block. */
7058 if (check_last_block
)
7060 basic_block bb
= EXIT_BLOCK_PTR
->prev_bb
;
7061 gimple_stmt_iterator gsi
= gsi_last_nondebug_bb (bb
);
7064 if (!gsi_end_p (gsi
))
7067 if (t
&& need_fake_edge_p (t
))
7071 e
= find_edge (bb
, EXIT_BLOCK_PTR
);
7074 gsi_insert_on_edge (e
, gimple_build_nop ());
7075 gsi_commit_edge_inserts ();
7080 /* Now add fake edges to the function exit for any non constant
7081 calls since there is no way that we can determine if they will
7083 for (i
= 0; i
< last_bb
; i
++)
7085 basic_block bb
= BASIC_BLOCK (i
);
7086 gimple_stmt_iterator gsi
;
7087 gimple stmt
, last_stmt
;
7092 if (blocks
&& !TEST_BIT (blocks
, i
))
7095 gsi
= gsi_last_nondebug_bb (bb
);
7096 if (!gsi_end_p (gsi
))
7098 last_stmt
= gsi_stmt (gsi
);
7101 stmt
= gsi_stmt (gsi
);
7102 if (need_fake_edge_p (stmt
))
7106 /* The handling above of the final block before the
7107 epilogue should be enough to verify that there is
7108 no edge to the exit block in CFG already.
7109 Calling make_edge in such case would cause us to
7110 mark that edge as fake and remove it later. */
7111 #ifdef ENABLE_CHECKING
7112 if (stmt
== last_stmt
)
7114 e
= find_edge (bb
, EXIT_BLOCK_PTR
);
7115 gcc_assert (e
== NULL
);
7119 /* Note that the following may create a new basic block
7120 and renumber the existing basic blocks. */
7121 if (stmt
!= last_stmt
)
7123 e
= split_block (bb
, stmt
);
7127 make_edge (bb
, EXIT_BLOCK_PTR
, EDGE_FAKE
);
7131 while (!gsi_end_p (gsi
));
7136 verify_flow_info ();
7138 return blocks_split
;
7141 /* Removes edge E and all the blocks dominated by it, and updates dominance
7142 information. The IL in E->src needs to be updated separately.
7143 If dominance info is not available, only the edge E is removed.*/
7146 remove_edge_and_dominated_blocks (edge e
)
7148 VEC (basic_block
, heap
) *bbs_to_remove
= NULL
;
7149 VEC (basic_block
, heap
) *bbs_to_fix_dom
= NULL
;
7153 bool none_removed
= false;
7155 basic_block bb
, dbb
;
7158 if (!dom_info_available_p (CDI_DOMINATORS
))
7164 /* No updating is needed for edges to exit. */
7165 if (e
->dest
== EXIT_BLOCK_PTR
)
7167 if (cfgcleanup_altered_bbs
)
7168 bitmap_set_bit (cfgcleanup_altered_bbs
, e
->src
->index
);
7173 /* First, we find the basic blocks to remove. If E->dest has a predecessor
7174 that is not dominated by E->dest, then this set is empty. Otherwise,
7175 all the basic blocks dominated by E->dest are removed.
7177 Also, to DF_IDOM we store the immediate dominators of the blocks in
7178 the dominance frontier of E (i.e., of the successors of the
7179 removed blocks, if there are any, and of E->dest otherwise). */
7180 FOR_EACH_EDGE (f
, ei
, e
->dest
->preds
)
7185 if (!dominated_by_p (CDI_DOMINATORS
, f
->src
, e
->dest
))
7187 none_removed
= true;
7192 df
= BITMAP_ALLOC (NULL
);
7193 df_idom
= BITMAP_ALLOC (NULL
);
7196 bitmap_set_bit (df_idom
,
7197 get_immediate_dominator (CDI_DOMINATORS
, e
->dest
)->index
);
7200 bbs_to_remove
= get_all_dominated_blocks (CDI_DOMINATORS
, e
->dest
);
7201 FOR_EACH_VEC_ELT (basic_block
, bbs_to_remove
, i
, bb
)
7203 FOR_EACH_EDGE (f
, ei
, bb
->succs
)
7205 if (f
->dest
!= EXIT_BLOCK_PTR
)
7206 bitmap_set_bit (df
, f
->dest
->index
);
7209 FOR_EACH_VEC_ELT (basic_block
, bbs_to_remove
, i
, bb
)
7210 bitmap_clear_bit (df
, bb
->index
);
7212 EXECUTE_IF_SET_IN_BITMAP (df
, 0, i
, bi
)
7214 bb
= BASIC_BLOCK (i
);
7215 bitmap_set_bit (df_idom
,
7216 get_immediate_dominator (CDI_DOMINATORS
, bb
)->index
);
7220 if (cfgcleanup_altered_bbs
)
7222 /* Record the set of the altered basic blocks. */
7223 bitmap_set_bit (cfgcleanup_altered_bbs
, e
->src
->index
);
7224 bitmap_ior_into (cfgcleanup_altered_bbs
, df
);
7227 /* Remove E and the cancelled blocks. */
7232 /* Walk backwards so as to get a chance to substitute all
7233 released DEFs into debug stmts. See
7234 eliminate_unnecessary_stmts() in tree-ssa-dce.c for more
7236 for (i
= VEC_length (basic_block
, bbs_to_remove
); i
-- > 0; )
7237 delete_basic_block (VEC_index (basic_block
, bbs_to_remove
, i
));
7240 /* Update the dominance information. The immediate dominator may change only
7241 for blocks whose immediate dominator belongs to DF_IDOM:
7243 Suppose that idom(X) = Y before removal of E and idom(X) != Y after the
7244 removal. Let Z the arbitrary block such that idom(Z) = Y and
7245 Z dominates X after the removal. Before removal, there exists a path P
7246 from Y to X that avoids Z. Let F be the last edge on P that is
7247 removed, and let W = F->dest. Before removal, idom(W) = Y (since Y
7248 dominates W, and because of P, Z does not dominate W), and W belongs to
7249 the dominance frontier of E. Therefore, Y belongs to DF_IDOM. */
7250 EXECUTE_IF_SET_IN_BITMAP (df_idom
, 0, i
, bi
)
7252 bb
= BASIC_BLOCK (i
);
7253 for (dbb
= first_dom_son (CDI_DOMINATORS
, bb
);
7255 dbb
= next_dom_son (CDI_DOMINATORS
, dbb
))
7256 VEC_safe_push (basic_block
, heap
, bbs_to_fix_dom
, dbb
);
7259 iterate_fix_dominators (CDI_DOMINATORS
, bbs_to_fix_dom
, true);
7262 BITMAP_FREE (df_idom
);
7263 VEC_free (basic_block
, heap
, bbs_to_remove
);
7264 VEC_free (basic_block
, heap
, bbs_to_fix_dom
);
7267 /* Purge dead EH edges from basic block BB. */
7270 gimple_purge_dead_eh_edges (basic_block bb
)
7272 bool changed
= false;
7275 gimple stmt
= last_stmt (bb
);
7277 if (stmt
&& stmt_can_throw_internal (stmt
))
7280 for (ei
= ei_start (bb
->succs
); (e
= ei_safe_edge (ei
)); )
7282 if (e
->flags
& EDGE_EH
)
7284 remove_edge_and_dominated_blocks (e
);
7294 /* Purge dead EH edges from basic block listed in BLOCKS. */
7297 gimple_purge_all_dead_eh_edges (const_bitmap blocks
)
7299 bool changed
= false;
7303 EXECUTE_IF_SET_IN_BITMAP (blocks
, 0, i
, bi
)
7305 basic_block bb
= BASIC_BLOCK (i
);
7307 /* Earlier gimple_purge_dead_eh_edges could have removed
7308 this basic block already. */
7309 gcc_assert (bb
|| changed
);
7311 changed
|= gimple_purge_dead_eh_edges (bb
);
7317 /* Purge dead abnormal call edges from basic block BB. */
7320 gimple_purge_dead_abnormal_call_edges (basic_block bb
)
7322 bool changed
= false;
7325 gimple stmt
= last_stmt (bb
);
7327 if (!cfun
->has_nonlocal_label
)
7330 if (stmt
&& stmt_can_make_abnormal_goto (stmt
))
7333 for (ei
= ei_start (bb
->succs
); (e
= ei_safe_edge (ei
)); )
7335 if (e
->flags
& EDGE_ABNORMAL
)
7337 remove_edge_and_dominated_blocks (e
);
7347 /* Purge dead abnormal call edges from basic block listed in BLOCKS. */
7350 gimple_purge_all_dead_abnormal_call_edges (const_bitmap blocks
)
7352 bool changed
= false;
7356 EXECUTE_IF_SET_IN_BITMAP (blocks
, 0, i
, bi
)
7358 basic_block bb
= BASIC_BLOCK (i
);
7360 /* Earlier gimple_purge_dead_abnormal_call_edges could have removed
7361 this basic block already. */
7362 gcc_assert (bb
|| changed
);
7364 changed
|= gimple_purge_dead_abnormal_call_edges (bb
);
7370 /* This function is called whenever a new edge is created or
7374 gimple_execute_on_growing_pred (edge e
)
7376 basic_block bb
= e
->dest
;
7378 if (!gimple_seq_empty_p (phi_nodes (bb
)))
7379 reserve_phi_args_for_new_edge (bb
);
7382 /* This function is called immediately before edge E is removed from
7383 the edge vector E->dest->preds. */
7386 gimple_execute_on_shrinking_pred (edge e
)
7388 if (!gimple_seq_empty_p (phi_nodes (e
->dest
)))
7389 remove_phi_args (e
);
7392 /*---------------------------------------------------------------------------
7393 Helper functions for Loop versioning
7394 ---------------------------------------------------------------------------*/
7396 /* Adjust phi nodes for 'first' basic block. 'second' basic block is a copy
7397 of 'first'. Both of them are dominated by 'new_head' basic block. When
7398 'new_head' was created by 'second's incoming edge it received phi arguments
7399 on the edge by split_edge(). Later, additional edge 'e' was created to
7400 connect 'new_head' and 'first'. Now this routine adds phi args on this
7401 additional edge 'e' that new_head to second edge received as part of edge
7405 gimple_lv_adjust_loop_header_phi (basic_block first
, basic_block second
,
7406 basic_block new_head
, edge e
)
7409 gimple_stmt_iterator psi1
, psi2
;
7411 edge e2
= find_edge (new_head
, second
);
7413 /* Because NEW_HEAD has been created by splitting SECOND's incoming
7414 edge, we should always have an edge from NEW_HEAD to SECOND. */
7415 gcc_assert (e2
!= NULL
);
7417 /* Browse all 'second' basic block phi nodes and add phi args to
7418 edge 'e' for 'first' head. PHI args are always in correct order. */
7420 for (psi2
= gsi_start_phis (second
),
7421 psi1
= gsi_start_phis (first
);
7422 !gsi_end_p (psi2
) && !gsi_end_p (psi1
);
7423 gsi_next (&psi2
), gsi_next (&psi1
))
7425 phi1
= gsi_stmt (psi1
);
7426 phi2
= gsi_stmt (psi2
);
7427 def
= PHI_ARG_DEF (phi2
, e2
->dest_idx
);
7428 add_phi_arg (phi1
, def
, e
, gimple_phi_arg_location_from_edge (phi2
, e2
));
7433 /* Adds a if else statement to COND_BB with condition COND_EXPR.
7434 SECOND_HEAD is the destination of the THEN and FIRST_HEAD is
7435 the destination of the ELSE part. */
7438 gimple_lv_add_condition_to_bb (basic_block first_head ATTRIBUTE_UNUSED
,
7439 basic_block second_head ATTRIBUTE_UNUSED
,
7440 basic_block cond_bb
, void *cond_e
)
7442 gimple_stmt_iterator gsi
;
7443 gimple new_cond_expr
;
7444 tree cond_expr
= (tree
) cond_e
;
7447 /* Build new conditional expr */
7448 new_cond_expr
= gimple_build_cond_from_tree (cond_expr
,
7449 NULL_TREE
, NULL_TREE
);
7451 /* Add new cond in cond_bb. */
7452 gsi
= gsi_last_bb (cond_bb
);
7453 gsi_insert_after (&gsi
, new_cond_expr
, GSI_NEW_STMT
);
7455 /* Adjust edges appropriately to connect new head with first head
7456 as well as second head. */
7457 e0
= single_succ_edge (cond_bb
);
7458 e0
->flags
&= ~EDGE_FALLTHRU
;
7459 e0
->flags
|= EDGE_FALSE_VALUE
;
7462 struct cfg_hooks gimple_cfg_hooks
= {
7464 gimple_verify_flow_info
,
7465 gimple_dump_bb
, /* dump_bb */
7466 create_bb
, /* create_basic_block */
7467 gimple_redirect_edge_and_branch
, /* redirect_edge_and_branch */
7468 gimple_redirect_edge_and_branch_force
, /* redirect_edge_and_branch_force */
7469 gimple_can_remove_branch_p
, /* can_remove_branch_p */
7470 remove_bb
, /* delete_basic_block */
7471 gimple_split_block
, /* split_block */
7472 gimple_move_block_after
, /* move_block_after */
7473 gimple_can_merge_blocks_p
, /* can_merge_blocks_p */
7474 gimple_merge_blocks
, /* merge_blocks */
7475 gimple_predict_edge
, /* predict_edge */
7476 gimple_predicted_by_p
, /* predicted_by_p */
7477 gimple_can_duplicate_bb_p
, /* can_duplicate_block_p */
7478 gimple_duplicate_bb
, /* duplicate_block */
7479 gimple_split_edge
, /* split_edge */
7480 gimple_make_forwarder_block
, /* make_forward_block */
7481 NULL
, /* tidy_fallthru_edge */
7482 NULL
, /* force_nonfallthru */
7483 gimple_block_ends_with_call_p
,/* block_ends_with_call_p */
7484 gimple_block_ends_with_condjump_p
, /* block_ends_with_condjump_p */
7485 gimple_flow_call_edges_add
, /* flow_call_edges_add */
7486 gimple_execute_on_growing_pred
, /* execute_on_growing_pred */
7487 gimple_execute_on_shrinking_pred
, /* execute_on_shrinking_pred */
7488 gimple_duplicate_loop_to_header_edge
, /* duplicate loop for trees */
7489 gimple_lv_add_condition_to_bb
, /* lv_add_condition_to_bb */
7490 gimple_lv_adjust_loop_header_phi
, /* lv_adjust_loop_header_phi*/
7491 extract_true_false_edges_from_block
, /* extract_cond_bb_edges */
7492 flush_pending_stmts
/* flush_pending_stmts */
7496 /* Split all critical edges. */
7499 split_critical_edges (void)
7505 /* split_edge can redirect edges out of SWITCH_EXPRs, which can get
7506 expensive. So we want to enable recording of edge to CASE_LABEL_EXPR
7507 mappings around the calls to split_edge. */
7508 start_recording_case_labels ();
7511 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
7513 if (EDGE_CRITICAL_P (e
) && !(e
->flags
& EDGE_ABNORMAL
))
7515 /* PRE inserts statements to edges and expects that
7516 since split_critical_edges was done beforehand, committing edge
7517 insertions will not split more edges. In addition to critical
7518 edges we must split edges that have multiple successors and
7519 end by control flow statements, such as RESX.
7520 Go ahead and split them too. This matches the logic in
7521 gimple_find_edge_insert_loc. */
7522 else if ((!single_pred_p (e
->dest
)
7523 || !gimple_seq_empty_p (phi_nodes (e
->dest
))
7524 || e
->dest
== EXIT_BLOCK_PTR
)
7525 && e
->src
!= ENTRY_BLOCK_PTR
7526 && !(e
->flags
& EDGE_ABNORMAL
))
7528 gimple_stmt_iterator gsi
;
7530 gsi
= gsi_last_bb (e
->src
);
7531 if (!gsi_end_p (gsi
)
7532 && stmt_ends_bb_p (gsi_stmt (gsi
))
7533 && (gimple_code (gsi_stmt (gsi
)) != GIMPLE_RETURN
7534 && !gimple_call_builtin_p (gsi_stmt (gsi
),
7540 end_recording_case_labels ();
7544 struct gimple_opt_pass pass_split_crit_edges
=
7548 "crited", /* name */
7550 split_critical_edges
, /* execute */
7553 0, /* static_pass_number */
7554 TV_TREE_SPLIT_EDGES
, /* tv_id */
7555 PROP_cfg
, /* properties required */
7556 PROP_no_crit_edges
, /* properties_provided */
7557 0, /* properties_destroyed */
7558 0, /* todo_flags_start */
7559 TODO_verify_flow
/* todo_flags_finish */
7564 /* Build a ternary operation and gimplify it. Emit code before GSI.
7565 Return the gimple_val holding the result. */
7568 gimplify_build3 (gimple_stmt_iterator
*gsi
, enum tree_code code
,
7569 tree type
, tree a
, tree b
, tree c
)
7572 location_t loc
= gimple_location (gsi_stmt (*gsi
));
7574 ret
= fold_build3_loc (loc
, code
, type
, a
, b
, c
);
7577 return force_gimple_operand_gsi (gsi
, ret
, true, NULL
, true,
7581 /* Build a binary operation and gimplify it. Emit code before GSI.
7582 Return the gimple_val holding the result. */
7585 gimplify_build2 (gimple_stmt_iterator
*gsi
, enum tree_code code
,
7586 tree type
, tree a
, tree b
)
7590 ret
= fold_build2_loc (gimple_location (gsi_stmt (*gsi
)), code
, type
, a
, b
);
7593 return force_gimple_operand_gsi (gsi
, ret
, true, NULL
, true,
7597 /* Build a unary operation and gimplify it. Emit code before GSI.
7598 Return the gimple_val holding the result. */
7601 gimplify_build1 (gimple_stmt_iterator
*gsi
, enum tree_code code
, tree type
,
7606 ret
= fold_build1_loc (gimple_location (gsi_stmt (*gsi
)), code
, type
, a
);
7609 return force_gimple_operand_gsi (gsi
, ret
, true, NULL
, true,
7615 /* Emit return warnings. */
7618 execute_warn_function_return (void)
7620 source_location location
;
7625 /* If we have a path to EXIT, then we do return. */
7626 if (TREE_THIS_VOLATILE (cfun
->decl
)
7627 && EDGE_COUNT (EXIT_BLOCK_PTR
->preds
) > 0)
7629 location
= UNKNOWN_LOCATION
;
7630 FOR_EACH_EDGE (e
, ei
, EXIT_BLOCK_PTR
->preds
)
7632 last
= last_stmt (e
->src
);
7633 if ((gimple_code (last
) == GIMPLE_RETURN
7634 || gimple_call_builtin_p (last
, BUILT_IN_RETURN
))
7635 && (location
= gimple_location (last
)) != UNKNOWN_LOCATION
)
7638 if (location
== UNKNOWN_LOCATION
)
7639 location
= cfun
->function_end_locus
;
7640 warning_at (location
, 0, "%<noreturn%> function does return");
7643 /* If we see "return;" in some basic block, then we do reach the end
7644 without returning a value. */
7645 else if (warn_return_type
7646 && !TREE_NO_WARNING (cfun
->decl
)
7647 && EDGE_COUNT (EXIT_BLOCK_PTR
->preds
) > 0
7648 && !VOID_TYPE_P (TREE_TYPE (TREE_TYPE (cfun
->decl
))))
7650 FOR_EACH_EDGE (e
, ei
, EXIT_BLOCK_PTR
->preds
)
7652 gimple last
= last_stmt (e
->src
);
7653 if (gimple_code (last
) == GIMPLE_RETURN
7654 && gimple_return_retval (last
) == NULL
7655 && !gimple_no_warning_p (last
))
7657 location
= gimple_location (last
);
7658 if (location
== UNKNOWN_LOCATION
)
7659 location
= cfun
->function_end_locus
;
7660 warning_at (location
, OPT_Wreturn_type
, "control reaches end of non-void function");
7661 TREE_NO_WARNING (cfun
->decl
) = 1;
7670 /* Given a basic block B which ends with a conditional and has
7671 precisely two successors, determine which of the edges is taken if
7672 the conditional is true and which is taken if the conditional is
7673 false. Set TRUE_EDGE and FALSE_EDGE appropriately. */
7676 extract_true_false_edges_from_block (basic_block b
,
7680 edge e
= EDGE_SUCC (b
, 0);
7682 if (e
->flags
& EDGE_TRUE_VALUE
)
7685 *false_edge
= EDGE_SUCC (b
, 1);
7690 *true_edge
= EDGE_SUCC (b
, 1);
7694 struct gimple_opt_pass pass_warn_function_return
=
7698 "*warn_function_return", /* name */
7700 execute_warn_function_return
, /* execute */
7703 0, /* static_pass_number */
7704 TV_NONE
, /* tv_id */
7705 PROP_cfg
, /* properties_required */
7706 0, /* properties_provided */
7707 0, /* properties_destroyed */
7708 0, /* todo_flags_start */
7709 0 /* todo_flags_finish */
7713 /* Emit noreturn warnings. */
7716 execute_warn_function_noreturn (void)
7718 if (!TREE_THIS_VOLATILE (current_function_decl
)
7719 && EDGE_COUNT (EXIT_BLOCK_PTR
->preds
) == 0)
7720 warn_function_noreturn (current_function_decl
);
7725 gate_warn_function_noreturn (void)
7727 return warn_suggest_attribute_noreturn
;
7730 struct gimple_opt_pass pass_warn_function_noreturn
=
7734 "*warn_function_noreturn", /* name */
7735 gate_warn_function_noreturn
, /* gate */
7736 execute_warn_function_noreturn
, /* execute */
7739 0, /* static_pass_number */
7740 TV_NONE
, /* tv_id */
7741 PROP_cfg
, /* properties_required */
7742 0, /* properties_provided */
7743 0, /* properties_destroyed */
7744 0, /* todo_flags_start */
7745 0 /* todo_flags_finish */
7750 /* Walk a gimplified function and warn for functions whose return value is
7751 ignored and attribute((warn_unused_result)) is set. This is done before
7752 inlining, so we don't have to worry about that. */
7755 do_warn_unused_result (gimple_seq seq
)
7758 gimple_stmt_iterator i
;
7760 for (i
= gsi_start (seq
); !gsi_end_p (i
); gsi_next (&i
))
7762 gimple g
= gsi_stmt (i
);
7764 switch (gimple_code (g
))
7767 do_warn_unused_result (gimple_bind_body (g
));
7770 do_warn_unused_result (gimple_try_eval (g
));
7771 do_warn_unused_result (gimple_try_cleanup (g
));
7774 do_warn_unused_result (gimple_catch_handler (g
));
7776 case GIMPLE_EH_FILTER
:
7777 do_warn_unused_result (gimple_eh_filter_failure (g
));
7781 if (gimple_call_lhs (g
))
7783 if (gimple_call_internal_p (g
))
7786 /* This is a naked call, as opposed to a GIMPLE_CALL with an
7787 LHS. All calls whose value is ignored should be
7788 represented like this. Look for the attribute. */
7789 fdecl
= gimple_call_fndecl (g
);
7790 ftype
= gimple_call_fntype (g
);
7792 if (lookup_attribute ("warn_unused_result", TYPE_ATTRIBUTES (ftype
)))
7794 location_t loc
= gimple_location (g
);
7797 warning_at (loc
, OPT_Wunused_result
,
7798 "ignoring return value of %qD, "
7799 "declared with attribute warn_unused_result",
7802 warning_at (loc
, OPT_Wunused_result
,
7803 "ignoring return value of function "
7804 "declared with attribute warn_unused_result");
7809 /* Not a container, not a call, or a call whose value is used. */
7816 run_warn_unused_result (void)
7818 do_warn_unused_result (gimple_body (current_function_decl
));
7823 gate_warn_unused_result (void)
7825 return flag_warn_unused_result
;
7828 struct gimple_opt_pass pass_warn_unused_result
=
7832 "*warn_unused_result", /* name */
7833 gate_warn_unused_result
, /* gate */
7834 run_warn_unused_result
, /* execute */
7837 0, /* static_pass_number */
7838 TV_NONE
, /* tv_id */
7839 PROP_gimple_any
, /* properties_required */
7840 0, /* properties_provided */
7841 0, /* properties_destroyed */
7842 0, /* todo_flags_start */
7843 0, /* todo_flags_finish */