1 /* Control flow functions for trees.
2 Copyright (C) 2001-2014 Free Software Foundation, Inc.
3 Contributed by Diego Novillo <dnovillo@redhat.com>
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3, or (at your option)
12 GCC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
23 #include "coretypes.h"
24 #include "hash-table.h"
28 #include "trans-mem.h"
29 #include "stor-layout.h"
30 #include "print-tree.h"
37 #include "hard-reg-set.h"
40 #include "dominance.h"
43 #include "basic-block.h"
45 #include "gimple-pretty-print.h"
46 #include "tree-ssa-alias.h"
47 #include "internal-fn.h"
48 #include "gimple-fold.h"
50 #include "gimple-expr.h"
53 #include "gimple-iterator.h"
54 #include "gimplify-me.h"
55 #include "gimple-walk.h"
56 #include "gimple-ssa.h"
59 #include "tree-phinodes.h"
60 #include "ssa-iterators.h"
61 #include "stringpool.h"
62 #include "tree-ssanames.h"
63 #include "tree-ssa-loop-manip.h"
64 #include "tree-ssa-loop-niter.h"
65 #include "tree-into-ssa.h"
69 #include "tree-dump.h"
70 #include "tree-pass.h"
71 #include "diagnostic-core.h"
74 #include "tree-ssa-propagate.h"
75 #include "value-prof.h"
76 #include "tree-inline.h"
78 #include "tree-ssa-live.h"
80 #include "tree-cfgcleanup.h"
82 #include "wide-int-print.h"
84 /* This file contains functions for building the Control Flow Graph (CFG)
85 for a function tree. */
87 /* Local declarations. */
89 /* Initial capacity for the basic block array. */
90 static const int initial_cfg_capacity
= 20;
92 /* This hash table allows us to efficiently lookup all CASE_LABEL_EXPRs
93 which use a particular edge. The CASE_LABEL_EXPRs are chained together
94 via their CASE_CHAIN field, which we clear after we're done with the
95 hash table to prevent problems with duplication of GIMPLE_SWITCHes.
97 Access to this list of CASE_LABEL_EXPRs allows us to efficiently
98 update the case vector in response to edge redirections.
100 Right now this table is set up and torn down at key points in the
101 compilation process. It would be nice if we could make the table
102 more persistent. The key is getting notification of changes to
103 the CFG (particularly edge removal, creation and redirection). */
105 static hash_map
<edge
, tree
> *edge_to_cases
;
107 /* If we record edge_to_cases, this bitmap will hold indexes
108 of basic blocks that end in a GIMPLE_SWITCH which we touched
109 due to edge manipulations. */
111 static bitmap touched_switch_bbs
;
113 /* CFG statistics. */
116 long num_merged_labels
;
119 static struct cfg_stats_d cfg_stats
;
121 /* Hash table to store last discriminator assigned for each locus. */
122 struct locus_discrim_map
128 /* Hashtable helpers. */
130 struct locus_discrim_hasher
: typed_free_remove
<locus_discrim_map
>
132 typedef locus_discrim_map value_type
;
133 typedef locus_discrim_map compare_type
;
134 static inline hashval_t
hash (const value_type
*);
135 static inline bool equal (const value_type
*, const compare_type
*);
138 /* Trivial hash function for a location_t. ITEM is a pointer to
139 a hash table entry that maps a location_t to a discriminator. */
142 locus_discrim_hasher::hash (const value_type
*item
)
144 return LOCATION_LINE (item
->locus
);
147 /* Equality function for the locus-to-discriminator map. A and B
148 point to the two hash table entries to compare. */
151 locus_discrim_hasher::equal (const value_type
*a
, const compare_type
*b
)
153 return LOCATION_LINE (a
->locus
) == LOCATION_LINE (b
->locus
);
156 static hash_table
<locus_discrim_hasher
> *discriminator_per_locus
;
158 /* Basic blocks and flowgraphs. */
159 static void make_blocks (gimple_seq
);
162 static void make_edges (void);
163 static void assign_discriminators (void);
164 static void make_cond_expr_edges (basic_block
);
165 static void make_gimple_switch_edges (basic_block
);
166 static bool make_goto_expr_edges (basic_block
);
167 static void make_gimple_asm_edges (basic_block
);
168 static edge
gimple_redirect_edge_and_branch (edge
, basic_block
);
169 static edge
gimple_try_redirect_by_replacing_jump (edge
, basic_block
);
171 /* Various helpers. */
172 static inline bool stmt_starts_bb_p (gimple
, gimple
);
173 static int gimple_verify_flow_info (void);
174 static void gimple_make_forwarder_block (edge
);
175 static gimple
first_non_label_stmt (basic_block
);
176 static bool verify_gimple_transaction (gimple
);
177 static bool call_can_make_abnormal_goto (gimple
);
179 /* Flowgraph optimization and cleanup. */
180 static void gimple_merge_blocks (basic_block
, basic_block
);
181 static bool gimple_can_merge_blocks_p (basic_block
, basic_block
);
182 static void remove_bb (basic_block
);
183 static edge
find_taken_edge_computed_goto (basic_block
, tree
);
184 static edge
find_taken_edge_cond_expr (basic_block
, tree
);
185 static edge
find_taken_edge_switch_expr (basic_block
, tree
);
186 static tree
find_case_label_for_value (gimple
, tree
);
189 init_empty_tree_cfg_for_function (struct function
*fn
)
191 /* Initialize the basic block array. */
193 profile_status_for_fn (fn
) = PROFILE_ABSENT
;
194 n_basic_blocks_for_fn (fn
) = NUM_FIXED_BLOCKS
;
195 last_basic_block_for_fn (fn
) = NUM_FIXED_BLOCKS
;
196 vec_alloc (basic_block_info_for_fn (fn
), initial_cfg_capacity
);
197 vec_safe_grow_cleared (basic_block_info_for_fn (fn
),
198 initial_cfg_capacity
);
200 /* Build a mapping of labels to their associated blocks. */
201 vec_alloc (label_to_block_map_for_fn (fn
), initial_cfg_capacity
);
202 vec_safe_grow_cleared (label_to_block_map_for_fn (fn
),
203 initial_cfg_capacity
);
205 SET_BASIC_BLOCK_FOR_FN (fn
, ENTRY_BLOCK
, ENTRY_BLOCK_PTR_FOR_FN (fn
));
206 SET_BASIC_BLOCK_FOR_FN (fn
, EXIT_BLOCK
, EXIT_BLOCK_PTR_FOR_FN (fn
));
208 ENTRY_BLOCK_PTR_FOR_FN (fn
)->next_bb
209 = EXIT_BLOCK_PTR_FOR_FN (fn
);
210 EXIT_BLOCK_PTR_FOR_FN (fn
)->prev_bb
211 = ENTRY_BLOCK_PTR_FOR_FN (fn
);
215 init_empty_tree_cfg (void)
217 init_empty_tree_cfg_for_function (cfun
);
220 /*---------------------------------------------------------------------------
222 ---------------------------------------------------------------------------*/
224 /* Entry point to the CFG builder for trees. SEQ is the sequence of
225 statements to be added to the flowgraph. */
228 build_gimple_cfg (gimple_seq seq
)
230 /* Register specific gimple functions. */
231 gimple_register_cfg_hooks ();
233 memset ((void *) &cfg_stats
, 0, sizeof (cfg_stats
));
235 init_empty_tree_cfg ();
239 /* Make sure there is always at least one block, even if it's empty. */
240 if (n_basic_blocks_for_fn (cfun
) == NUM_FIXED_BLOCKS
)
241 create_empty_bb (ENTRY_BLOCK_PTR_FOR_FN (cfun
));
243 /* Adjust the size of the array. */
244 if (basic_block_info_for_fn (cfun
)->length ()
245 < (size_t) n_basic_blocks_for_fn (cfun
))
246 vec_safe_grow_cleared (basic_block_info_for_fn (cfun
),
247 n_basic_blocks_for_fn (cfun
));
249 /* To speed up statement iterator walks, we first purge dead labels. */
250 cleanup_dead_labels ();
252 /* Group case nodes to reduce the number of edges.
253 We do this after cleaning up dead labels because otherwise we miss
254 a lot of obvious case merging opportunities. */
255 group_case_labels ();
257 /* Create the edges of the flowgraph. */
258 discriminator_per_locus
= new hash_table
<locus_discrim_hasher
> (13);
260 assign_discriminators ();
261 cleanup_dead_labels ();
262 delete discriminator_per_locus
;
263 discriminator_per_locus
= NULL
;
267 /* Look for ANNOTATE calls with loop annotation kind; if found, remove
268 them and propagate the information to the loop. We assume that the
269 annotations come immediately before the condition of the loop. */
272 replace_loop_annotate ()
276 gimple_stmt_iterator gsi
;
279 FOR_EACH_LOOP (loop
, 0)
281 gsi
= gsi_last_bb (loop
->header
);
282 stmt
= gsi_stmt (gsi
);
283 if (!(stmt
&& gimple_code (stmt
) == GIMPLE_COND
))
285 for (gsi_prev_nondebug (&gsi
); !gsi_end_p (gsi
); gsi_prev (&gsi
))
287 stmt
= gsi_stmt (gsi
);
288 if (gimple_code (stmt
) != GIMPLE_CALL
)
290 if (!gimple_call_internal_p (stmt
)
291 || gimple_call_internal_fn (stmt
) != IFN_ANNOTATE
)
293 switch ((annot_expr_kind
) tree_to_shwi (gimple_call_arg (stmt
, 1)))
295 case annot_expr_ivdep_kind
:
296 loop
->safelen
= INT_MAX
;
298 case annot_expr_no_vector_kind
:
299 loop
->dont_vectorize
= true;
301 case annot_expr_vector_kind
:
302 loop
->force_vectorize
= true;
303 cfun
->has_force_vectorize_loops
= true;
308 stmt
= gimple_build_assign (gimple_call_lhs (stmt
),
309 gimple_call_arg (stmt
, 0));
310 gsi_replace (&gsi
, stmt
, true);
314 /* Remove IFN_ANNOTATE. Safeguard for the case loop->latch == NULL. */
315 FOR_EACH_BB_FN (bb
, cfun
)
317 for (gsi
= gsi_last_bb (bb
); !gsi_end_p (gsi
); gsi_prev (&gsi
))
319 stmt
= gsi_stmt (gsi
);
320 if (gimple_code (stmt
) != GIMPLE_CALL
)
322 if (!gimple_call_internal_p (stmt
)
323 || gimple_call_internal_fn (stmt
) != IFN_ANNOTATE
)
325 switch ((annot_expr_kind
) tree_to_shwi (gimple_call_arg (stmt
, 1)))
327 case annot_expr_ivdep_kind
:
328 case annot_expr_no_vector_kind
:
329 case annot_expr_vector_kind
:
334 warning_at (gimple_location (stmt
), 0, "ignoring loop annotation");
335 stmt
= gimple_build_assign (gimple_call_lhs (stmt
),
336 gimple_call_arg (stmt
, 0));
337 gsi_replace (&gsi
, stmt
, true);
344 execute_build_cfg (void)
346 gimple_seq body
= gimple_body (current_function_decl
);
348 build_gimple_cfg (body
);
349 gimple_set_body (current_function_decl
, NULL
);
350 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
352 fprintf (dump_file
, "Scope blocks:\n");
353 dump_scope_blocks (dump_file
, dump_flags
);
356 loop_optimizer_init (AVOID_CFG_MODIFICATIONS
);
357 replace_loop_annotate ();
363 const pass_data pass_data_build_cfg
=
365 GIMPLE_PASS
, /* type */
367 OPTGROUP_NONE
, /* optinfo_flags */
368 TV_TREE_CFG
, /* tv_id */
369 PROP_gimple_leh
, /* properties_required */
370 ( PROP_cfg
| PROP_loops
), /* properties_provided */
371 0, /* properties_destroyed */
372 0, /* todo_flags_start */
373 0, /* todo_flags_finish */
376 class pass_build_cfg
: public gimple_opt_pass
379 pass_build_cfg (gcc::context
*ctxt
)
380 : gimple_opt_pass (pass_data_build_cfg
, ctxt
)
383 /* opt_pass methods: */
384 virtual unsigned int execute (function
*) { return execute_build_cfg (); }
386 }; // class pass_build_cfg
391 make_pass_build_cfg (gcc::context
*ctxt
)
393 return new pass_build_cfg (ctxt
);
397 /* Return true if T is a computed goto. */
400 computed_goto_p (gimple t
)
402 return (gimple_code (t
) == GIMPLE_GOTO
403 && TREE_CODE (gimple_goto_dest (t
)) != LABEL_DECL
);
406 /* Returns true for edge E where e->src ends with a GIMPLE_COND and
407 the other edge points to a bb with just __builtin_unreachable ().
408 I.e. return true for C->M edge in:
416 __builtin_unreachable ();
420 assert_unreachable_fallthru_edge_p (edge e
)
422 basic_block pred_bb
= e
->src
;
423 gimple last
= last_stmt (pred_bb
);
424 if (last
&& gimple_code (last
) == GIMPLE_COND
)
426 basic_block other_bb
= EDGE_SUCC (pred_bb
, 0)->dest
;
427 if (other_bb
== e
->dest
)
428 other_bb
= EDGE_SUCC (pred_bb
, 1)->dest
;
429 if (EDGE_COUNT (other_bb
->succs
) == 0)
431 gimple_stmt_iterator gsi
= gsi_after_labels (other_bb
);
436 stmt
= gsi_stmt (gsi
);
437 while (is_gimple_debug (stmt
) || gimple_clobber_p (stmt
))
442 stmt
= gsi_stmt (gsi
);
444 return gimple_call_builtin_p (stmt
, BUILT_IN_UNREACHABLE
);
451 /* Initialize GF_CALL_CTRL_ALTERING flag, which indicates the call
452 could alter control flow except via eh. We initialize the flag at
453 CFG build time and only ever clear it later. */
456 gimple_call_initialize_ctrl_altering (gimple stmt
)
458 int flags
= gimple_call_flags (stmt
);
460 /* A call alters control flow if it can make an abnormal goto. */
461 if (call_can_make_abnormal_goto (stmt
)
462 /* A call also alters control flow if it does not return. */
463 || flags
& ECF_NORETURN
464 /* TM ending statements have backedges out of the transaction.
465 Return true so we split the basic block containing them.
466 Note that the TM_BUILTIN test is merely an optimization. */
467 || ((flags
& ECF_TM_BUILTIN
)
468 && is_tm_ending_fndecl (gimple_call_fndecl (stmt
)))
469 /* BUILT_IN_RETURN call is same as return statement. */
470 || gimple_call_builtin_p (stmt
, BUILT_IN_RETURN
))
471 gimple_call_set_ctrl_altering (stmt
, true);
473 gimple_call_set_ctrl_altering (stmt
, false);
477 /* Build a flowgraph for the sequence of stmts SEQ. */
480 make_blocks (gimple_seq seq
)
482 gimple_stmt_iterator i
= gsi_start (seq
);
484 bool start_new_block
= true;
485 bool first_stmt_of_seq
= true;
486 basic_block bb
= ENTRY_BLOCK_PTR_FOR_FN (cfun
);
488 while (!gsi_end_p (i
))
495 if (stmt
&& is_gimple_call (stmt
))
496 gimple_call_initialize_ctrl_altering (stmt
);
498 /* If the statement starts a new basic block or if we have determined
499 in a previous pass that we need to create a new block for STMT, do
501 if (start_new_block
|| stmt_starts_bb_p (stmt
, prev_stmt
))
503 if (!first_stmt_of_seq
)
504 gsi_split_seq_before (&i
, &seq
);
505 bb
= create_basic_block (seq
, NULL
, bb
);
506 start_new_block
= false;
509 /* Now add STMT to BB and create the subgraphs for special statement
511 gimple_set_bb (stmt
, bb
);
513 /* If STMT is a basic block terminator, set START_NEW_BLOCK for the
515 if (stmt_ends_bb_p (stmt
))
517 /* If the stmt can make abnormal goto use a new temporary
518 for the assignment to the LHS. This makes sure the old value
519 of the LHS is available on the abnormal edge. Otherwise
520 we will end up with overlapping life-ranges for abnormal
522 if (gimple_has_lhs (stmt
)
523 && stmt_can_make_abnormal_goto (stmt
)
524 && is_gimple_reg_type (TREE_TYPE (gimple_get_lhs (stmt
))))
526 tree lhs
= gimple_get_lhs (stmt
);
527 tree tmp
= create_tmp_var (TREE_TYPE (lhs
), NULL
);
528 gimple s
= gimple_build_assign (lhs
, tmp
);
529 gimple_set_location (s
, gimple_location (stmt
));
530 gimple_set_block (s
, gimple_block (stmt
));
531 gimple_set_lhs (stmt
, tmp
);
532 if (TREE_CODE (TREE_TYPE (tmp
)) == COMPLEX_TYPE
533 || TREE_CODE (TREE_TYPE (tmp
)) == VECTOR_TYPE
)
534 DECL_GIMPLE_REG_P (tmp
) = 1;
535 gsi_insert_after (&i
, s
, GSI_SAME_STMT
);
537 start_new_block
= true;
541 first_stmt_of_seq
= false;
546 /* Create and return a new empty basic block after bb AFTER. */
549 create_bb (void *h
, void *e
, basic_block after
)
555 /* Create and initialize a new basic block. Since alloc_block uses
556 GC allocation that clears memory to allocate a basic block, we do
557 not have to clear the newly allocated basic block here. */
560 bb
->index
= last_basic_block_for_fn (cfun
);
562 set_bb_seq (bb
, h
? (gimple_seq
) h
: NULL
);
564 /* Add the new block to the linked list of blocks. */
565 link_block (bb
, after
);
567 /* Grow the basic block array if needed. */
568 if ((size_t) last_basic_block_for_fn (cfun
)
569 == basic_block_info_for_fn (cfun
)->length ())
572 (last_basic_block_for_fn (cfun
)
573 + (last_basic_block_for_fn (cfun
) + 3) / 4);
574 vec_safe_grow_cleared (basic_block_info_for_fn (cfun
), new_size
);
577 /* Add the newly created block to the array. */
578 SET_BASIC_BLOCK_FOR_FN (cfun
, last_basic_block_for_fn (cfun
), bb
);
580 n_basic_blocks_for_fn (cfun
)++;
581 last_basic_block_for_fn (cfun
)++;
587 /*---------------------------------------------------------------------------
589 ---------------------------------------------------------------------------*/
591 /* Fold COND_EXPR_COND of each COND_EXPR. */
594 fold_cond_expr_cond (void)
598 FOR_EACH_BB_FN (bb
, cfun
)
600 gimple stmt
= last_stmt (bb
);
602 if (stmt
&& gimple_code (stmt
) == GIMPLE_COND
)
604 location_t loc
= gimple_location (stmt
);
608 fold_defer_overflow_warnings ();
609 cond
= fold_binary_loc (loc
, gimple_cond_code (stmt
), boolean_type_node
,
610 gimple_cond_lhs (stmt
), gimple_cond_rhs (stmt
));
613 zerop
= integer_zerop (cond
);
614 onep
= integer_onep (cond
);
617 zerop
= onep
= false;
619 fold_undefer_overflow_warnings (zerop
|| onep
,
621 WARN_STRICT_OVERFLOW_CONDITIONAL
);
623 gimple_cond_make_false (stmt
);
625 gimple_cond_make_true (stmt
);
630 /* If basic block BB has an abnormal edge to a basic block
631 containing IFN_ABNORMAL_DISPATCHER internal call, return
632 that the dispatcher's basic block, otherwise return NULL. */
635 get_abnormal_succ_dispatcher (basic_block bb
)
640 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
641 if ((e
->flags
& (EDGE_ABNORMAL
| EDGE_EH
)) == EDGE_ABNORMAL
)
643 gimple_stmt_iterator gsi
644 = gsi_start_nondebug_after_labels_bb (e
->dest
);
645 gimple g
= gsi_stmt (gsi
);
647 && is_gimple_call (g
)
648 && gimple_call_internal_p (g
)
649 && gimple_call_internal_fn (g
) == IFN_ABNORMAL_DISPATCHER
)
655 /* Helper function for make_edges. Create a basic block with
656 with ABNORMAL_DISPATCHER internal call in it if needed, and
657 create abnormal edges from BBS to it and from it to FOR_BB
658 if COMPUTED_GOTO is false, otherwise factor the computed gotos. */
661 handle_abnormal_edges (basic_block
*dispatcher_bbs
,
662 basic_block for_bb
, int *bb_to_omp_idx
,
663 auto_vec
<basic_block
> *bbs
, bool computed_goto
)
665 basic_block
*dispatcher
= dispatcher_bbs
+ (computed_goto
? 1 : 0);
666 unsigned int idx
= 0;
672 dispatcher
= dispatcher_bbs
+ 2 * bb_to_omp_idx
[for_bb
->index
];
673 if (bb_to_omp_idx
[for_bb
->index
] != 0)
677 /* If the dispatcher has been created already, then there are basic
678 blocks with abnormal edges to it, so just make a new edge to
680 if (*dispatcher
== NULL
)
682 /* Check if there are any basic blocks that need to have
683 abnormal edges to this dispatcher. If there are none, return
685 if (bb_to_omp_idx
== NULL
)
687 if (bbs
->is_empty ())
692 FOR_EACH_VEC_ELT (*bbs
, idx
, bb
)
693 if (bb_to_omp_idx
[bb
->index
] == bb_to_omp_idx
[for_bb
->index
])
699 /* Create the dispatcher bb. */
700 *dispatcher
= create_basic_block (NULL
, NULL
, for_bb
);
703 /* Factor computed gotos into a common computed goto site. Also
704 record the location of that site so that we can un-factor the
705 gotos after we have converted back to normal form. */
706 gimple_stmt_iterator gsi
= gsi_start_bb (*dispatcher
);
708 /* Create the destination of the factored goto. Each original
709 computed goto will put its desired destination into this
710 variable and jump to the label we create immediately below. */
711 tree var
= create_tmp_var (ptr_type_node
, "gotovar");
713 /* Build a label for the new block which will contain the
714 factored computed goto. */
715 tree factored_label_decl
716 = create_artificial_label (UNKNOWN_LOCATION
);
717 gimple factored_computed_goto_label
718 = gimple_build_label (factored_label_decl
);
719 gsi_insert_after (&gsi
, factored_computed_goto_label
, GSI_NEW_STMT
);
721 /* Build our new computed goto. */
722 gimple factored_computed_goto
= gimple_build_goto (var
);
723 gsi_insert_after (&gsi
, factored_computed_goto
, GSI_NEW_STMT
);
725 FOR_EACH_VEC_ELT (*bbs
, idx
, bb
)
728 && bb_to_omp_idx
[bb
->index
] != bb_to_omp_idx
[for_bb
->index
])
731 gsi
= gsi_last_bb (bb
);
732 gimple last
= gsi_stmt (gsi
);
734 gcc_assert (computed_goto_p (last
));
736 /* Copy the original computed goto's destination into VAR. */
738 = gimple_build_assign (var
, gimple_goto_dest (last
));
739 gsi_insert_before (&gsi
, assignment
, GSI_SAME_STMT
);
741 edge e
= make_edge (bb
, *dispatcher
, EDGE_FALLTHRU
);
742 e
->goto_locus
= gimple_location (last
);
743 gsi_remove (&gsi
, true);
748 tree arg
= inner
? boolean_true_node
: boolean_false_node
;
749 gimple g
= gimple_build_call_internal (IFN_ABNORMAL_DISPATCHER
,
751 gimple_stmt_iterator gsi
= gsi_after_labels (*dispatcher
);
752 gsi_insert_after (&gsi
, g
, GSI_NEW_STMT
);
754 /* Create predecessor edges of the dispatcher. */
755 FOR_EACH_VEC_ELT (*bbs
, idx
, bb
)
758 && bb_to_omp_idx
[bb
->index
] != bb_to_omp_idx
[for_bb
->index
])
760 make_edge (bb
, *dispatcher
, EDGE_ABNORMAL
);
765 make_edge (*dispatcher
, for_bb
, EDGE_ABNORMAL
);
768 /* Join all the blocks in the flowgraph. */
774 struct omp_region
*cur_region
= NULL
;
775 auto_vec
<basic_block
> ab_edge_goto
;
776 auto_vec
<basic_block
> ab_edge_call
;
777 int *bb_to_omp_idx
= NULL
;
778 int cur_omp_region_idx
= 0;
780 /* Create an edge from entry to the first block with executable
782 make_edge (ENTRY_BLOCK_PTR_FOR_FN (cfun
),
783 BASIC_BLOCK_FOR_FN (cfun
, NUM_FIXED_BLOCKS
),
786 /* Traverse the basic block array placing edges. */
787 FOR_EACH_BB_FN (bb
, cfun
)
789 gimple last
= last_stmt (bb
);
793 bb_to_omp_idx
[bb
->index
] = cur_omp_region_idx
;
797 enum gimple_code code
= gimple_code (last
);
801 if (make_goto_expr_edges (bb
))
802 ab_edge_goto
.safe_push (bb
);
807 edge e
= make_edge (bb
, EXIT_BLOCK_PTR_FOR_FN (cfun
), 0);
808 e
->goto_locus
= gimple_location (last
);
813 make_cond_expr_edges (bb
);
817 make_gimple_switch_edges (bb
);
821 make_eh_edges (last
);
824 case GIMPLE_EH_DISPATCH
:
825 fallthru
= make_eh_dispatch_edges (last
);
829 /* If this function receives a nonlocal goto, then we need to
830 make edges from this call site to all the nonlocal goto
832 if (stmt_can_make_abnormal_goto (last
))
833 ab_edge_call
.safe_push (bb
);
835 /* If this statement has reachable exception handlers, then
836 create abnormal edges to them. */
837 make_eh_edges (last
);
839 /* BUILTIN_RETURN is really a return statement. */
840 if (gimple_call_builtin_p (last
, BUILT_IN_RETURN
))
842 make_edge (bb
, EXIT_BLOCK_PTR_FOR_FN (cfun
), 0);
845 /* Some calls are known not to return. */
847 fallthru
= !(gimple_call_flags (last
) & ECF_NORETURN
);
851 /* A GIMPLE_ASSIGN may throw internally and thus be considered
853 if (is_ctrl_altering_stmt (last
))
854 make_eh_edges (last
);
859 make_gimple_asm_edges (bb
);
864 fallthru
= make_gimple_omp_edges (bb
, &cur_region
,
865 &cur_omp_region_idx
);
866 if (cur_region
&& bb_to_omp_idx
== NULL
)
867 bb_to_omp_idx
= XCNEWVEC (int, n_basic_blocks_for_fn (cfun
));
870 case GIMPLE_TRANSACTION
:
872 tree abort_label
= gimple_transaction_label (last
);
874 make_edge (bb
, label_to_block (abort_label
), EDGE_TM_ABORT
);
880 gcc_assert (!stmt_ends_bb_p (last
));
888 make_edge (bb
, bb
->next_bb
, EDGE_FALLTHRU
);
891 /* Computed gotos are hell to deal with, especially if there are
892 lots of them with a large number of destinations. So we factor
893 them to a common computed goto location before we build the
894 edge list. After we convert back to normal form, we will un-factor
895 the computed gotos since factoring introduces an unwanted jump.
896 For non-local gotos and abnormal edges from calls to calls that return
897 twice or forced labels, factor the abnormal edges too, by having all
898 abnormal edges from the calls go to a common artificial basic block
899 with ABNORMAL_DISPATCHER internal call and abnormal edges from that
900 basic block to all forced labels and calls returning twice.
901 We do this per-OpenMP structured block, because those regions
902 are guaranteed to be single entry single exit by the standard,
903 so it is not allowed to enter or exit such regions abnormally this way,
904 thus all computed gotos, non-local gotos and setjmp/longjmp calls
905 must not transfer control across SESE region boundaries. */
906 if (!ab_edge_goto
.is_empty () || !ab_edge_call
.is_empty ())
908 gimple_stmt_iterator gsi
;
909 basic_block dispatcher_bb_array
[2] = { NULL
, NULL
};
910 basic_block
*dispatcher_bbs
= dispatcher_bb_array
;
911 int count
= n_basic_blocks_for_fn (cfun
);
914 dispatcher_bbs
= XCNEWVEC (basic_block
, 2 * count
);
916 FOR_EACH_BB_FN (bb
, cfun
)
918 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
920 gimple label_stmt
= gsi_stmt (gsi
);
923 if (gimple_code (label_stmt
) != GIMPLE_LABEL
)
926 target
= gimple_label_label (label_stmt
);
928 /* Make an edge to every label block that has been marked as a
929 potential target for a computed goto or a non-local goto. */
930 if (FORCED_LABEL (target
))
931 handle_abnormal_edges (dispatcher_bbs
, bb
, bb_to_omp_idx
,
932 &ab_edge_goto
, true);
933 if (DECL_NONLOCAL (target
))
935 handle_abnormal_edges (dispatcher_bbs
, bb
, bb_to_omp_idx
,
936 &ab_edge_call
, false);
941 if (!gsi_end_p (gsi
) && is_gimple_debug (gsi_stmt (gsi
)))
942 gsi_next_nondebug (&gsi
);
943 if (!gsi_end_p (gsi
))
945 /* Make an edge to every setjmp-like call. */
946 gimple call_stmt
= gsi_stmt (gsi
);
947 if (is_gimple_call (call_stmt
)
948 && ((gimple_call_flags (call_stmt
) & ECF_RETURNS_TWICE
)
949 || gimple_call_builtin_p (call_stmt
,
950 BUILT_IN_SETJMP_RECEIVER
)))
951 handle_abnormal_edges (dispatcher_bbs
, bb
, bb_to_omp_idx
,
952 &ab_edge_call
, false);
957 XDELETE (dispatcher_bbs
);
960 XDELETE (bb_to_omp_idx
);
964 /* Fold COND_EXPR_COND of each COND_EXPR. */
965 fold_cond_expr_cond ();
968 /* Find the next available discriminator value for LOCUS. The
969 discriminator distinguishes among several basic blocks that
970 share a common locus, allowing for more accurate sample-based
974 next_discriminator_for_locus (location_t locus
)
976 struct locus_discrim_map item
;
977 struct locus_discrim_map
**slot
;
980 item
.discriminator
= 0;
981 slot
= discriminator_per_locus
->find_slot_with_hash (
982 &item
, LOCATION_LINE (locus
), INSERT
);
984 if (*slot
== HTAB_EMPTY_ENTRY
)
986 *slot
= XNEW (struct locus_discrim_map
);
988 (*slot
)->locus
= locus
;
989 (*slot
)->discriminator
= 0;
991 (*slot
)->discriminator
++;
992 return (*slot
)->discriminator
;
995 /* Return TRUE if LOCUS1 and LOCUS2 refer to the same source line. */
998 same_line_p (location_t locus1
, location_t locus2
)
1000 expanded_location from
, to
;
1002 if (locus1
== locus2
)
1005 from
= expand_location (locus1
);
1006 to
= expand_location (locus2
);
1008 if (from
.line
!= to
.line
)
1010 if (from
.file
== to
.file
)
1012 return (from
.file
!= NULL
1014 && filename_cmp (from
.file
, to
.file
) == 0);
1017 /* Assign discriminators to each basic block. */
1020 assign_discriminators (void)
1024 FOR_EACH_BB_FN (bb
, cfun
)
1028 gimple last
= last_stmt (bb
);
1029 location_t locus
= last
? gimple_location (last
) : UNKNOWN_LOCATION
;
1031 if (locus
== UNKNOWN_LOCATION
)
1034 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
1036 gimple first
= first_non_label_stmt (e
->dest
);
1037 gimple last
= last_stmt (e
->dest
);
1038 if ((first
&& same_line_p (locus
, gimple_location (first
)))
1039 || (last
&& same_line_p (locus
, gimple_location (last
))))
1041 if (e
->dest
->discriminator
!= 0 && bb
->discriminator
== 0)
1042 bb
->discriminator
= next_discriminator_for_locus (locus
);
1044 e
->dest
->discriminator
= next_discriminator_for_locus (locus
);
1050 /* Create the edges for a GIMPLE_COND starting at block BB. */
1053 make_cond_expr_edges (basic_block bb
)
1055 gimple entry
= last_stmt (bb
);
1056 gimple then_stmt
, else_stmt
;
1057 basic_block then_bb
, else_bb
;
1058 tree then_label
, else_label
;
1062 gcc_assert (gimple_code (entry
) == GIMPLE_COND
);
1064 /* Entry basic blocks for each component. */
1065 then_label
= gimple_cond_true_label (entry
);
1066 else_label
= gimple_cond_false_label (entry
);
1067 then_bb
= label_to_block (then_label
);
1068 else_bb
= label_to_block (else_label
);
1069 then_stmt
= first_stmt (then_bb
);
1070 else_stmt
= first_stmt (else_bb
);
1072 e
= make_edge (bb
, then_bb
, EDGE_TRUE_VALUE
);
1073 e
->goto_locus
= gimple_location (then_stmt
);
1074 e
= make_edge (bb
, else_bb
, EDGE_FALSE_VALUE
);
1076 e
->goto_locus
= gimple_location (else_stmt
);
1078 /* We do not need the labels anymore. */
1079 gimple_cond_set_true_label (entry
, NULL_TREE
);
1080 gimple_cond_set_false_label (entry
, NULL_TREE
);
1084 /* Called for each element in the hash table (P) as we delete the
1085 edge to cases hash table.
1087 Clear all the TREE_CHAINs to prevent problems with copying of
1088 SWITCH_EXPRs and structure sharing rules, then free the hash table
1092 edge_to_cases_cleanup (edge
const &, tree
const &value
, void *)
1096 for (t
= value
; t
; t
= next
)
1098 next
= CASE_CHAIN (t
);
1099 CASE_CHAIN (t
) = NULL
;
1105 /* Start recording information mapping edges to case labels. */
1108 start_recording_case_labels (void)
1110 gcc_assert (edge_to_cases
== NULL
);
1111 edge_to_cases
= new hash_map
<edge
, tree
>;
1112 touched_switch_bbs
= BITMAP_ALLOC (NULL
);
1115 /* Return nonzero if we are recording information for case labels. */
1118 recording_case_labels_p (void)
1120 return (edge_to_cases
!= NULL
);
1123 /* Stop recording information mapping edges to case labels and
1124 remove any information we have recorded. */
1126 end_recording_case_labels (void)
1130 edge_to_cases
->traverse
<void *, edge_to_cases_cleanup
> (NULL
);
1131 delete edge_to_cases
;
1132 edge_to_cases
= NULL
;
1133 EXECUTE_IF_SET_IN_BITMAP (touched_switch_bbs
, 0, i
, bi
)
1135 basic_block bb
= BASIC_BLOCK_FOR_FN (cfun
, i
);
1138 gimple stmt
= last_stmt (bb
);
1139 if (stmt
&& gimple_code (stmt
) == GIMPLE_SWITCH
)
1140 group_case_labels_stmt (stmt
);
1143 BITMAP_FREE (touched_switch_bbs
);
1146 /* If we are inside a {start,end}_recording_cases block, then return
1147 a chain of CASE_LABEL_EXPRs from T which reference E.
1149 Otherwise return NULL. */
1152 get_cases_for_edge (edge e
, gimple t
)
1157 /* If we are not recording cases, then we do not have CASE_LABEL_EXPR
1158 chains available. Return NULL so the caller can detect this case. */
1159 if (!recording_case_labels_p ())
1162 slot
= edge_to_cases
->get (e
);
1166 /* If we did not find E in the hash table, then this must be the first
1167 time we have been queried for information about E & T. Add all the
1168 elements from T to the hash table then perform the query again. */
1170 n
= gimple_switch_num_labels (t
);
1171 for (i
= 0; i
< n
; i
++)
1173 tree elt
= gimple_switch_label (t
, i
);
1174 tree lab
= CASE_LABEL (elt
);
1175 basic_block label_bb
= label_to_block (lab
);
1176 edge this_edge
= find_edge (e
->src
, label_bb
);
1178 /* Add it to the chain of CASE_LABEL_EXPRs referencing E, or create
1180 tree
&s
= edge_to_cases
->get_or_insert (this_edge
);
1181 CASE_CHAIN (elt
) = s
;
1185 return *edge_to_cases
->get (e
);
1188 /* Create the edges for a GIMPLE_SWITCH starting at block BB. */
1191 make_gimple_switch_edges (basic_block bb
)
1193 gimple entry
= last_stmt (bb
);
1196 n
= gimple_switch_num_labels (entry
);
1198 for (i
= 0; i
< n
; ++i
)
1200 tree lab
= CASE_LABEL (gimple_switch_label (entry
, i
));
1201 basic_block label_bb
= label_to_block (lab
);
1202 make_edge (bb
, label_bb
, 0);
1207 /* Return the basic block holding label DEST. */
1210 label_to_block_fn (struct function
*ifun
, tree dest
)
1212 int uid
= LABEL_DECL_UID (dest
);
1214 /* We would die hard when faced by an undefined label. Emit a label to
1215 the very first basic block. This will hopefully make even the dataflow
1216 and undefined variable warnings quite right. */
1217 if (seen_error () && uid
< 0)
1219 gimple_stmt_iterator gsi
=
1220 gsi_start_bb (BASIC_BLOCK_FOR_FN (cfun
, NUM_FIXED_BLOCKS
));
1223 stmt
= gimple_build_label (dest
);
1224 gsi_insert_before (&gsi
, stmt
, GSI_NEW_STMT
);
1225 uid
= LABEL_DECL_UID (dest
);
1227 if (vec_safe_length (ifun
->cfg
->x_label_to_block_map
) <= (unsigned int) uid
)
1229 return (*ifun
->cfg
->x_label_to_block_map
)[uid
];
1232 /* Create edges for a goto statement at block BB. Returns true
1233 if abnormal edges should be created. */
1236 make_goto_expr_edges (basic_block bb
)
1238 gimple_stmt_iterator last
= gsi_last_bb (bb
);
1239 gimple goto_t
= gsi_stmt (last
);
1241 /* A simple GOTO creates normal edges. */
1242 if (simple_goto_p (goto_t
))
1244 tree dest
= gimple_goto_dest (goto_t
);
1245 basic_block label_bb
= label_to_block (dest
);
1246 edge e
= make_edge (bb
, label_bb
, EDGE_FALLTHRU
);
1247 e
->goto_locus
= gimple_location (goto_t
);
1248 gsi_remove (&last
, true);
1252 /* A computed GOTO creates abnormal edges. */
1256 /* Create edges for an asm statement with labels at block BB. */
1259 make_gimple_asm_edges (basic_block bb
)
1261 gimple stmt
= last_stmt (bb
);
1262 int i
, n
= gimple_asm_nlabels (stmt
);
1264 for (i
= 0; i
< n
; ++i
)
1266 tree label
= TREE_VALUE (gimple_asm_label_op (stmt
, i
));
1267 basic_block label_bb
= label_to_block (label
);
1268 make_edge (bb
, label_bb
, 0);
1272 /*---------------------------------------------------------------------------
1274 ---------------------------------------------------------------------------*/
1276 /* Cleanup useless labels in basic blocks. This is something we wish
1277 to do early because it allows us to group case labels before creating
1278 the edges for the CFG, and it speeds up block statement iterators in
1279 all passes later on.
1280 We rerun this pass after CFG is created, to get rid of the labels that
1281 are no longer referenced. After then we do not run it any more, since
1282 (almost) no new labels should be created. */
1284 /* A map from basic block index to the leading label of that block. */
1285 static struct label_record
1290 /* True if the label is referenced from somewhere. */
1294 /* Given LABEL return the first label in the same basic block. */
1297 main_block_label (tree label
)
1299 basic_block bb
= label_to_block (label
);
1300 tree main_label
= label_for_bb
[bb
->index
].label
;
1302 /* label_to_block possibly inserted undefined label into the chain. */
1305 label_for_bb
[bb
->index
].label
= label
;
1309 label_for_bb
[bb
->index
].used
= true;
1313 /* Clean up redundant labels within the exception tree. */
1316 cleanup_dead_labels_eh (void)
1323 if (cfun
->eh
== NULL
)
1326 for (i
= 1; vec_safe_iterate (cfun
->eh
->lp_array
, i
, &lp
); ++i
)
1327 if (lp
&& lp
->post_landing_pad
)
1329 lab
= main_block_label (lp
->post_landing_pad
);
1330 if (lab
!= lp
->post_landing_pad
)
1332 EH_LANDING_PAD_NR (lp
->post_landing_pad
) = 0;
1333 EH_LANDING_PAD_NR (lab
) = lp
->index
;
1337 FOR_ALL_EH_REGION (r
)
1341 case ERT_MUST_NOT_THROW
:
1347 for (c
= r
->u
.eh_try
.first_catch
; c
; c
= c
->next_catch
)
1351 c
->label
= main_block_label (lab
);
1356 case ERT_ALLOWED_EXCEPTIONS
:
1357 lab
= r
->u
.allowed
.label
;
1359 r
->u
.allowed
.label
= main_block_label (lab
);
1365 /* Cleanup redundant labels. This is a three-step process:
1366 1) Find the leading label for each block.
1367 2) Redirect all references to labels to the leading labels.
1368 3) Cleanup all useless labels. */
1371 cleanup_dead_labels (void)
1374 label_for_bb
= XCNEWVEC (struct label_record
, last_basic_block_for_fn (cfun
));
1376 /* Find a suitable label for each block. We use the first user-defined
1377 label if there is one, or otherwise just the first label we see. */
1378 FOR_EACH_BB_FN (bb
, cfun
)
1380 gimple_stmt_iterator i
;
1382 for (i
= gsi_start_bb (bb
); !gsi_end_p (i
); gsi_next (&i
))
1385 gimple stmt
= gsi_stmt (i
);
1387 if (gimple_code (stmt
) != GIMPLE_LABEL
)
1390 label
= gimple_label_label (stmt
);
1392 /* If we have not yet seen a label for the current block,
1393 remember this one and see if there are more labels. */
1394 if (!label_for_bb
[bb
->index
].label
)
1396 label_for_bb
[bb
->index
].label
= label
;
1400 /* If we did see a label for the current block already, but it
1401 is an artificially created label, replace it if the current
1402 label is a user defined label. */
1403 if (!DECL_ARTIFICIAL (label
)
1404 && DECL_ARTIFICIAL (label_for_bb
[bb
->index
].label
))
1406 label_for_bb
[bb
->index
].label
= label
;
1412 /* Now redirect all jumps/branches to the selected label.
1413 First do so for each block ending in a control statement. */
1414 FOR_EACH_BB_FN (bb
, cfun
)
1416 gimple stmt
= last_stmt (bb
);
1417 tree label
, new_label
;
1422 switch (gimple_code (stmt
))
1425 label
= gimple_cond_true_label (stmt
);
1428 new_label
= main_block_label (label
);
1429 if (new_label
!= label
)
1430 gimple_cond_set_true_label (stmt
, new_label
);
1433 label
= gimple_cond_false_label (stmt
);
1436 new_label
= main_block_label (label
);
1437 if (new_label
!= label
)
1438 gimple_cond_set_false_label (stmt
, new_label
);
1444 size_t i
, n
= gimple_switch_num_labels (stmt
);
1446 /* Replace all destination labels. */
1447 for (i
= 0; i
< n
; ++i
)
1449 tree case_label
= gimple_switch_label (stmt
, i
);
1450 label
= CASE_LABEL (case_label
);
1451 new_label
= main_block_label (label
);
1452 if (new_label
!= label
)
1453 CASE_LABEL (case_label
) = new_label
;
1460 int i
, n
= gimple_asm_nlabels (stmt
);
1462 for (i
= 0; i
< n
; ++i
)
1464 tree cons
= gimple_asm_label_op (stmt
, i
);
1465 tree label
= main_block_label (TREE_VALUE (cons
));
1466 TREE_VALUE (cons
) = label
;
1471 /* We have to handle gotos until they're removed, and we don't
1472 remove them until after we've created the CFG edges. */
1474 if (!computed_goto_p (stmt
))
1476 label
= gimple_goto_dest (stmt
);
1477 new_label
= main_block_label (label
);
1478 if (new_label
!= label
)
1479 gimple_goto_set_dest (stmt
, new_label
);
1483 case GIMPLE_TRANSACTION
:
1485 tree label
= gimple_transaction_label (stmt
);
1488 tree new_label
= main_block_label (label
);
1489 if (new_label
!= label
)
1490 gimple_transaction_set_label (stmt
, new_label
);
1500 /* Do the same for the exception region tree labels. */
1501 cleanup_dead_labels_eh ();
1503 /* Finally, purge dead labels. All user-defined labels and labels that
1504 can be the target of non-local gotos and labels which have their
1505 address taken are preserved. */
1506 FOR_EACH_BB_FN (bb
, cfun
)
1508 gimple_stmt_iterator i
;
1509 tree label_for_this_bb
= label_for_bb
[bb
->index
].label
;
1511 if (!label_for_this_bb
)
1514 /* If the main label of the block is unused, we may still remove it. */
1515 if (!label_for_bb
[bb
->index
].used
)
1516 label_for_this_bb
= NULL
;
1518 for (i
= gsi_start_bb (bb
); !gsi_end_p (i
); )
1521 gimple stmt
= gsi_stmt (i
);
1523 if (gimple_code (stmt
) != GIMPLE_LABEL
)
1526 label
= gimple_label_label (stmt
);
1528 if (label
== label_for_this_bb
1529 || !DECL_ARTIFICIAL (label
)
1530 || DECL_NONLOCAL (label
)
1531 || FORCED_LABEL (label
))
1534 gsi_remove (&i
, true);
1538 free (label_for_bb
);
1541 /* Scan the sorted vector of cases in STMT (a GIMPLE_SWITCH) and combine
1542 the ones jumping to the same label.
1543 Eg. three separate entries 1: 2: 3: become one entry 1..3: */
1546 group_case_labels_stmt (gimple stmt
)
1548 int old_size
= gimple_switch_num_labels (stmt
);
1549 int i
, j
, new_size
= old_size
;
1550 basic_block default_bb
= NULL
;
1552 default_bb
= label_to_block (CASE_LABEL (gimple_switch_default_label (stmt
)));
1554 /* Look for possible opportunities to merge cases. */
1556 while (i
< old_size
)
1558 tree base_case
, base_high
;
1559 basic_block base_bb
;
1561 base_case
= gimple_switch_label (stmt
, i
);
1563 gcc_assert (base_case
);
1564 base_bb
= label_to_block (CASE_LABEL (base_case
));
1566 /* Discard cases that have the same destination as the
1568 if (base_bb
== default_bb
)
1570 gimple_switch_set_label (stmt
, i
, NULL_TREE
);
1576 base_high
= CASE_HIGH (base_case
)
1577 ? CASE_HIGH (base_case
)
1578 : CASE_LOW (base_case
);
1581 /* Try to merge case labels. Break out when we reach the end
1582 of the label vector or when we cannot merge the next case
1583 label with the current one. */
1584 while (i
< old_size
)
1586 tree merge_case
= gimple_switch_label (stmt
, i
);
1587 basic_block merge_bb
= label_to_block (CASE_LABEL (merge_case
));
1588 wide_int bhp1
= wi::add (base_high
, 1);
1590 /* Merge the cases if they jump to the same place,
1591 and their ranges are consecutive. */
1592 if (merge_bb
== base_bb
1593 && wi::eq_p (CASE_LOW (merge_case
), bhp1
))
1595 base_high
= CASE_HIGH (merge_case
) ?
1596 CASE_HIGH (merge_case
) : CASE_LOW (merge_case
);
1597 CASE_HIGH (base_case
) = base_high
;
1598 gimple_switch_set_label (stmt
, i
, NULL_TREE
);
1607 /* Compress the case labels in the label vector, and adjust the
1608 length of the vector. */
1609 for (i
= 0, j
= 0; i
< new_size
; i
++)
1611 while (! gimple_switch_label (stmt
, j
))
1613 gimple_switch_set_label (stmt
, i
,
1614 gimple_switch_label (stmt
, j
++));
1617 gcc_assert (new_size
<= old_size
);
1618 gimple_switch_set_num_labels (stmt
, new_size
);
1621 /* Look for blocks ending in a multiway branch (a GIMPLE_SWITCH),
1622 and scan the sorted vector of cases. Combine the ones jumping to the
1626 group_case_labels (void)
1630 FOR_EACH_BB_FN (bb
, cfun
)
1632 gimple stmt
= last_stmt (bb
);
1633 if (stmt
&& gimple_code (stmt
) == GIMPLE_SWITCH
)
1634 group_case_labels_stmt (stmt
);
1638 /* Checks whether we can merge block B into block A. */
1641 gimple_can_merge_blocks_p (basic_block a
, basic_block b
)
1644 gimple_stmt_iterator gsi
;
1646 if (!single_succ_p (a
))
1649 if (single_succ_edge (a
)->flags
& EDGE_COMPLEX
)
1652 if (single_succ (a
) != b
)
1655 if (!single_pred_p (b
))
1658 if (b
== EXIT_BLOCK_PTR_FOR_FN (cfun
))
1661 /* If A ends by a statement causing exceptions or something similar, we
1662 cannot merge the blocks. */
1663 stmt
= last_stmt (a
);
1664 if (stmt
&& stmt_ends_bb_p (stmt
))
1667 /* Do not allow a block with only a non-local label to be merged. */
1669 && gimple_code (stmt
) == GIMPLE_LABEL
1670 && DECL_NONLOCAL (gimple_label_label (stmt
)))
1673 /* Examine the labels at the beginning of B. */
1674 for (gsi
= gsi_start_bb (b
); !gsi_end_p (gsi
); gsi_next (&gsi
))
1677 stmt
= gsi_stmt (gsi
);
1678 if (gimple_code (stmt
) != GIMPLE_LABEL
)
1680 lab
= gimple_label_label (stmt
);
1682 /* Do not remove user forced labels or for -O0 any user labels. */
1683 if (!DECL_ARTIFICIAL (lab
) && (!optimize
|| FORCED_LABEL (lab
)))
1687 /* Protect simple loop latches. We only want to avoid merging
1688 the latch with the loop header in this case. */
1690 && b
->loop_father
->latch
== b
1691 && loops_state_satisfies_p (LOOPS_HAVE_SIMPLE_LATCHES
)
1692 && b
->loop_father
->header
== a
)
1695 /* It must be possible to eliminate all phi nodes in B. If ssa form
1696 is not up-to-date and a name-mapping is registered, we cannot eliminate
1697 any phis. Symbols marked for renaming are never a problem though. */
1698 for (gsi
= gsi_start_phis (b
); !gsi_end_p (gsi
); gsi_next (&gsi
))
1700 gimple phi
= gsi_stmt (gsi
);
1701 /* Technically only new names matter. */
1702 if (name_registered_for_update_p (PHI_RESULT (phi
)))
1706 /* When not optimizing, don't merge if we'd lose goto_locus. */
1708 && single_succ_edge (a
)->goto_locus
!= UNKNOWN_LOCATION
)
1710 location_t goto_locus
= single_succ_edge (a
)->goto_locus
;
1711 gimple_stmt_iterator prev
, next
;
1712 prev
= gsi_last_nondebug_bb (a
);
1713 next
= gsi_after_labels (b
);
1714 if (!gsi_end_p (next
) && is_gimple_debug (gsi_stmt (next
)))
1715 gsi_next_nondebug (&next
);
1716 if ((gsi_end_p (prev
)
1717 || gimple_location (gsi_stmt (prev
)) != goto_locus
)
1718 && (gsi_end_p (next
)
1719 || gimple_location (gsi_stmt (next
)) != goto_locus
))
1726 /* Replaces all uses of NAME by VAL. */
1729 replace_uses_by (tree name
, tree val
)
1731 imm_use_iterator imm_iter
;
1736 FOR_EACH_IMM_USE_STMT (stmt
, imm_iter
, name
)
1738 /* Mark the block if we change the last stmt in it. */
1739 if (cfgcleanup_altered_bbs
1740 && stmt_ends_bb_p (stmt
))
1741 bitmap_set_bit (cfgcleanup_altered_bbs
, gimple_bb (stmt
)->index
);
1743 FOR_EACH_IMM_USE_ON_STMT (use
, imm_iter
)
1745 replace_exp (use
, val
);
1747 if (gimple_code (stmt
) == GIMPLE_PHI
)
1749 e
= gimple_phi_arg_edge (stmt
, PHI_ARG_INDEX_FROM_USE (use
));
1750 if (e
->flags
& EDGE_ABNORMAL
)
1752 /* This can only occur for virtual operands, since
1753 for the real ones SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name))
1754 would prevent replacement. */
1755 gcc_checking_assert (virtual_operand_p (name
));
1756 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (val
) = 1;
1761 if (gimple_code (stmt
) != GIMPLE_PHI
)
1763 gimple_stmt_iterator gsi
= gsi_for_stmt (stmt
);
1764 gimple orig_stmt
= stmt
;
1767 /* FIXME. It shouldn't be required to keep TREE_CONSTANT
1768 on ADDR_EXPRs up-to-date on GIMPLE. Propagation will
1769 only change sth from non-invariant to invariant, and only
1770 when propagating constants. */
1771 if (is_gimple_min_invariant (val
))
1772 for (i
= 0; i
< gimple_num_ops (stmt
); i
++)
1774 tree op
= gimple_op (stmt
, i
);
1775 /* Operands may be empty here. For example, the labels
1776 of a GIMPLE_COND are nulled out following the creation
1777 of the corresponding CFG edges. */
1778 if (op
&& TREE_CODE (op
) == ADDR_EXPR
)
1779 recompute_tree_invariant_for_addr_expr (op
);
1782 if (fold_stmt (&gsi
))
1783 stmt
= gsi_stmt (gsi
);
1785 if (maybe_clean_or_replace_eh_stmt (orig_stmt
, stmt
))
1786 gimple_purge_dead_eh_edges (gimple_bb (stmt
));
1792 gcc_checking_assert (has_zero_uses (name
));
1794 /* Also update the trees stored in loop structures. */
1799 FOR_EACH_LOOP (loop
, 0)
1801 substitute_in_loop_info (loop
, name
, val
);
1806 /* Merge block B into block A. */
1809 gimple_merge_blocks (basic_block a
, basic_block b
)
1811 gimple_stmt_iterator last
, gsi
, psi
;
1814 fprintf (dump_file
, "Merging blocks %d and %d\n", a
->index
, b
->index
);
1816 /* Remove all single-valued PHI nodes from block B of the form
1817 V_i = PHI <V_j> by propagating V_j to all the uses of V_i. */
1818 gsi
= gsi_last_bb (a
);
1819 for (psi
= gsi_start_phis (b
); !gsi_end_p (psi
); )
1821 gimple phi
= gsi_stmt (psi
);
1822 tree def
= gimple_phi_result (phi
), use
= gimple_phi_arg_def (phi
, 0);
1824 bool may_replace_uses
= (virtual_operand_p (def
)
1825 || may_propagate_copy (def
, use
));
1827 /* In case we maintain loop closed ssa form, do not propagate arguments
1828 of loop exit phi nodes. */
1830 && loops_state_satisfies_p (LOOP_CLOSED_SSA
)
1831 && !virtual_operand_p (def
)
1832 && TREE_CODE (use
) == SSA_NAME
1833 && a
->loop_father
!= b
->loop_father
)
1834 may_replace_uses
= false;
1836 if (!may_replace_uses
)
1838 gcc_assert (!virtual_operand_p (def
));
1840 /* Note that just emitting the copies is fine -- there is no problem
1841 with ordering of phi nodes. This is because A is the single
1842 predecessor of B, therefore results of the phi nodes cannot
1843 appear as arguments of the phi nodes. */
1844 copy
= gimple_build_assign (def
, use
);
1845 gsi_insert_after (&gsi
, copy
, GSI_NEW_STMT
);
1846 remove_phi_node (&psi
, false);
1850 /* If we deal with a PHI for virtual operands, we can simply
1851 propagate these without fussing with folding or updating
1853 if (virtual_operand_p (def
))
1855 imm_use_iterator iter
;
1856 use_operand_p use_p
;
1859 FOR_EACH_IMM_USE_STMT (stmt
, iter
, def
)
1860 FOR_EACH_IMM_USE_ON_STMT (use_p
, iter
)
1861 SET_USE (use_p
, use
);
1863 if (SSA_NAME_OCCURS_IN_ABNORMAL_PHI (def
))
1864 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (use
) = 1;
1867 replace_uses_by (def
, use
);
1869 remove_phi_node (&psi
, true);
1873 /* Ensure that B follows A. */
1874 move_block_after (b
, a
);
1876 gcc_assert (single_succ_edge (a
)->flags
& EDGE_FALLTHRU
);
1877 gcc_assert (!last_stmt (a
) || !stmt_ends_bb_p (last_stmt (a
)));
1879 /* Remove labels from B and set gimple_bb to A for other statements. */
1880 for (gsi
= gsi_start_bb (b
); !gsi_end_p (gsi
);)
1882 gimple stmt
= gsi_stmt (gsi
);
1883 if (gimple_code (stmt
) == GIMPLE_LABEL
)
1885 tree label
= gimple_label_label (stmt
);
1888 gsi_remove (&gsi
, false);
1890 /* Now that we can thread computed gotos, we might have
1891 a situation where we have a forced label in block B
1892 However, the label at the start of block B might still be
1893 used in other ways (think about the runtime checking for
1894 Fortran assigned gotos). So we can not just delete the
1895 label. Instead we move the label to the start of block A. */
1896 if (FORCED_LABEL (label
))
1898 gimple_stmt_iterator dest_gsi
= gsi_start_bb (a
);
1899 gsi_insert_before (&dest_gsi
, stmt
, GSI_NEW_STMT
);
1901 /* Other user labels keep around in a form of a debug stmt. */
1902 else if (!DECL_ARTIFICIAL (label
) && MAY_HAVE_DEBUG_STMTS
)
1904 gimple dbg
= gimple_build_debug_bind (label
,
1907 gimple_debug_bind_reset_value (dbg
);
1908 gsi_insert_before (&gsi
, dbg
, GSI_SAME_STMT
);
1911 lp_nr
= EH_LANDING_PAD_NR (label
);
1914 eh_landing_pad lp
= get_eh_landing_pad_from_number (lp_nr
);
1915 lp
->post_landing_pad
= NULL
;
1920 gimple_set_bb (stmt
, a
);
1925 /* When merging two BBs, if their counts are different, the larger count
1926 is selected as the new bb count. This is to handle inconsistent
1928 if (a
->loop_father
== b
->loop_father
)
1930 a
->count
= MAX (a
->count
, b
->count
);
1931 a
->frequency
= MAX (a
->frequency
, b
->frequency
);
1934 /* Merge the sequences. */
1935 last
= gsi_last_bb (a
);
1936 gsi_insert_seq_after (&last
, bb_seq (b
), GSI_NEW_STMT
);
1937 set_bb_seq (b
, NULL
);
1939 if (cfgcleanup_altered_bbs
)
1940 bitmap_set_bit (cfgcleanup_altered_bbs
, a
->index
);
1944 /* Return the one of two successors of BB that is not reachable by a
1945 complex edge, if there is one. Else, return BB. We use
1946 this in optimizations that use post-dominators for their heuristics,
1947 to catch the cases in C++ where function calls are involved. */
1950 single_noncomplex_succ (basic_block bb
)
1953 if (EDGE_COUNT (bb
->succs
) != 2)
1956 e0
= EDGE_SUCC (bb
, 0);
1957 e1
= EDGE_SUCC (bb
, 1);
1958 if (e0
->flags
& EDGE_COMPLEX
)
1960 if (e1
->flags
& EDGE_COMPLEX
)
1966 /* T is CALL_EXPR. Set current_function_calls_* flags. */
1969 notice_special_calls (gimple call
)
1971 int flags
= gimple_call_flags (call
);
1973 if (flags
& ECF_MAY_BE_ALLOCA
)
1974 cfun
->calls_alloca
= true;
1975 if (flags
& ECF_RETURNS_TWICE
)
1976 cfun
->calls_setjmp
= true;
1980 /* Clear flags set by notice_special_calls. Used by dead code removal
1981 to update the flags. */
1984 clear_special_calls (void)
1986 cfun
->calls_alloca
= false;
1987 cfun
->calls_setjmp
= false;
1990 /* Remove PHI nodes associated with basic block BB and all edges out of BB. */
1993 remove_phi_nodes_and_edges_for_unreachable_block (basic_block bb
)
1995 /* Since this block is no longer reachable, we can just delete all
1996 of its PHI nodes. */
1997 remove_phi_nodes (bb
);
1999 /* Remove edges to BB's successors. */
2000 while (EDGE_COUNT (bb
->succs
) > 0)
2001 remove_edge (EDGE_SUCC (bb
, 0));
2005 /* Remove statements of basic block BB. */
2008 remove_bb (basic_block bb
)
2010 gimple_stmt_iterator i
;
2014 fprintf (dump_file
, "Removing basic block %d\n", bb
->index
);
2015 if (dump_flags
& TDF_DETAILS
)
2017 dump_bb (dump_file
, bb
, 0, TDF_BLOCKS
);
2018 fprintf (dump_file
, "\n");
2024 struct loop
*loop
= bb
->loop_father
;
2026 /* If a loop gets removed, clean up the information associated
2028 if (loop
->latch
== bb
2029 || loop
->header
== bb
)
2030 free_numbers_of_iterations_estimates_loop (loop
);
2033 /* Remove all the instructions in the block. */
2034 if (bb_seq (bb
) != NULL
)
2036 /* Walk backwards so as to get a chance to substitute all
2037 released DEFs into debug stmts. See
2038 eliminate_unnecessary_stmts() in tree-ssa-dce.c for more
2040 for (i
= gsi_last_bb (bb
); !gsi_end_p (i
);)
2042 gimple stmt
= gsi_stmt (i
);
2043 if (gimple_code (stmt
) == GIMPLE_LABEL
2044 && (FORCED_LABEL (gimple_label_label (stmt
))
2045 || DECL_NONLOCAL (gimple_label_label (stmt
))))
2048 gimple_stmt_iterator new_gsi
;
2050 /* A non-reachable non-local label may still be referenced.
2051 But it no longer needs to carry the extra semantics of
2053 if (DECL_NONLOCAL (gimple_label_label (stmt
)))
2055 DECL_NONLOCAL (gimple_label_label (stmt
)) = 0;
2056 FORCED_LABEL (gimple_label_label (stmt
)) = 1;
2059 new_bb
= bb
->prev_bb
;
2060 new_gsi
= gsi_start_bb (new_bb
);
2061 gsi_remove (&i
, false);
2062 gsi_insert_before (&new_gsi
, stmt
, GSI_NEW_STMT
);
2066 /* Release SSA definitions if we are in SSA. Note that we
2067 may be called when not in SSA. For example,
2068 final_cleanup calls this function via
2069 cleanup_tree_cfg. */
2070 if (gimple_in_ssa_p (cfun
))
2071 release_defs (stmt
);
2073 gsi_remove (&i
, true);
2077 i
= gsi_last_bb (bb
);
2083 remove_phi_nodes_and_edges_for_unreachable_block (bb
);
2084 bb
->il
.gimple
.seq
= NULL
;
2085 bb
->il
.gimple
.phi_nodes
= NULL
;
2089 /* Given a basic block BB ending with COND_EXPR or SWITCH_EXPR, and a
2090 predicate VAL, return the edge that will be taken out of the block.
2091 If VAL does not match a unique edge, NULL is returned. */
2094 find_taken_edge (basic_block bb
, tree val
)
2098 stmt
= last_stmt (bb
);
2101 gcc_assert (is_ctrl_stmt (stmt
));
2106 if (!is_gimple_min_invariant (val
))
2109 if (gimple_code (stmt
) == GIMPLE_COND
)
2110 return find_taken_edge_cond_expr (bb
, val
);
2112 if (gimple_code (stmt
) == GIMPLE_SWITCH
)
2113 return find_taken_edge_switch_expr (bb
, val
);
2115 if (computed_goto_p (stmt
))
2117 /* Only optimize if the argument is a label, if the argument is
2118 not a label then we can not construct a proper CFG.
2120 It may be the case that we only need to allow the LABEL_REF to
2121 appear inside an ADDR_EXPR, but we also allow the LABEL_REF to
2122 appear inside a LABEL_EXPR just to be safe. */
2123 if ((TREE_CODE (val
) == ADDR_EXPR
|| TREE_CODE (val
) == LABEL_EXPR
)
2124 && TREE_CODE (TREE_OPERAND (val
, 0)) == LABEL_DECL
)
2125 return find_taken_edge_computed_goto (bb
, TREE_OPERAND (val
, 0));
2132 /* Given a constant value VAL and the entry block BB to a GOTO_EXPR
2133 statement, determine which of the outgoing edges will be taken out of the
2134 block. Return NULL if either edge may be taken. */
2137 find_taken_edge_computed_goto (basic_block bb
, tree val
)
2142 dest
= label_to_block (val
);
2145 e
= find_edge (bb
, dest
);
2146 gcc_assert (e
!= NULL
);
2152 /* Given a constant value VAL and the entry block BB to a COND_EXPR
2153 statement, determine which of the two edges will be taken out of the
2154 block. Return NULL if either edge may be taken. */
2157 find_taken_edge_cond_expr (basic_block bb
, tree val
)
2159 edge true_edge
, false_edge
;
2161 extract_true_false_edges_from_block (bb
, &true_edge
, &false_edge
);
2163 gcc_assert (TREE_CODE (val
) == INTEGER_CST
);
2164 return (integer_zerop (val
) ? false_edge
: true_edge
);
2167 /* Given an INTEGER_CST VAL and the entry block BB to a SWITCH_EXPR
2168 statement, determine which edge will be taken out of the block. Return
2169 NULL if any edge may be taken. */
2172 find_taken_edge_switch_expr (basic_block bb
, tree val
)
2174 basic_block dest_bb
;
2179 switch_stmt
= last_stmt (bb
);
2180 taken_case
= find_case_label_for_value (switch_stmt
, val
);
2181 dest_bb
= label_to_block (CASE_LABEL (taken_case
));
2183 e
= find_edge (bb
, dest_bb
);
2189 /* Return the CASE_LABEL_EXPR that SWITCH_STMT will take for VAL.
2190 We can make optimal use here of the fact that the case labels are
2191 sorted: We can do a binary search for a case matching VAL. */
2194 find_case_label_for_value (gimple switch_stmt
, tree val
)
2196 size_t low
, high
, n
= gimple_switch_num_labels (switch_stmt
);
2197 tree default_case
= gimple_switch_default_label (switch_stmt
);
2199 for (low
= 0, high
= n
; high
- low
> 1; )
2201 size_t i
= (high
+ low
) / 2;
2202 tree t
= gimple_switch_label (switch_stmt
, i
);
2205 /* Cache the result of comparing CASE_LOW and val. */
2206 cmp
= tree_int_cst_compare (CASE_LOW (t
), val
);
2213 if (CASE_HIGH (t
) == NULL
)
2215 /* A singe-valued case label. */
2221 /* A case range. We can only handle integer ranges. */
2222 if (cmp
<= 0 && tree_int_cst_compare (CASE_HIGH (t
), val
) >= 0)
2227 return default_case
;
2231 /* Dump a basic block on stderr. */
2234 gimple_debug_bb (basic_block bb
)
2236 dump_bb (stderr
, bb
, 0, TDF_VOPS
|TDF_MEMSYMS
|TDF_BLOCKS
);
2240 /* Dump basic block with index N on stderr. */
2243 gimple_debug_bb_n (int n
)
2245 gimple_debug_bb (BASIC_BLOCK_FOR_FN (cfun
, n
));
2246 return BASIC_BLOCK_FOR_FN (cfun
, n
);
2250 /* Dump the CFG on stderr.
2252 FLAGS are the same used by the tree dumping functions
2253 (see TDF_* in dumpfile.h). */
2256 gimple_debug_cfg (int flags
)
2258 gimple_dump_cfg (stderr
, flags
);
2262 /* Dump the program showing basic block boundaries on the given FILE.
2264 FLAGS are the same used by the tree dumping functions (see TDF_* in
2268 gimple_dump_cfg (FILE *file
, int flags
)
2270 if (flags
& TDF_DETAILS
)
2272 dump_function_header (file
, current_function_decl
, flags
);
2273 fprintf (file
, ";; \n%d basic blocks, %d edges, last basic block %d.\n\n",
2274 n_basic_blocks_for_fn (cfun
), n_edges_for_fn (cfun
),
2275 last_basic_block_for_fn (cfun
));
2277 brief_dump_cfg (file
, flags
| TDF_COMMENT
);
2278 fprintf (file
, "\n");
2281 if (flags
& TDF_STATS
)
2282 dump_cfg_stats (file
);
2284 dump_function_to_file (current_function_decl
, file
, flags
| TDF_BLOCKS
);
2288 /* Dump CFG statistics on FILE. */
2291 dump_cfg_stats (FILE *file
)
2293 static long max_num_merged_labels
= 0;
2294 unsigned long size
, total
= 0;
2297 const char * const fmt_str
= "%-30s%-13s%12s\n";
2298 const char * const fmt_str_1
= "%-30s%13d%11lu%c\n";
2299 const char * const fmt_str_2
= "%-30s%13ld%11lu%c\n";
2300 const char * const fmt_str_3
= "%-43s%11lu%c\n";
2301 const char *funcname
= current_function_name ();
2303 fprintf (file
, "\nCFG Statistics for %s\n\n", funcname
);
2305 fprintf (file
, "---------------------------------------------------------\n");
2306 fprintf (file
, fmt_str
, "", " Number of ", "Memory");
2307 fprintf (file
, fmt_str
, "", " instances ", "used ");
2308 fprintf (file
, "---------------------------------------------------------\n");
2310 size
= n_basic_blocks_for_fn (cfun
) * sizeof (struct basic_block_def
);
2312 fprintf (file
, fmt_str_1
, "Basic blocks", n_basic_blocks_for_fn (cfun
),
2313 SCALE (size
), LABEL (size
));
2316 FOR_EACH_BB_FN (bb
, cfun
)
2317 num_edges
+= EDGE_COUNT (bb
->succs
);
2318 size
= num_edges
* sizeof (struct edge_def
);
2320 fprintf (file
, fmt_str_2
, "Edges", num_edges
, SCALE (size
), LABEL (size
));
2322 fprintf (file
, "---------------------------------------------------------\n");
2323 fprintf (file
, fmt_str_3
, "Total memory used by CFG data", SCALE (total
),
2325 fprintf (file
, "---------------------------------------------------------\n");
2326 fprintf (file
, "\n");
2328 if (cfg_stats
.num_merged_labels
> max_num_merged_labels
)
2329 max_num_merged_labels
= cfg_stats
.num_merged_labels
;
2331 fprintf (file
, "Coalesced label blocks: %ld (Max so far: %ld)\n",
2332 cfg_stats
.num_merged_labels
, max_num_merged_labels
);
2334 fprintf (file
, "\n");
2338 /* Dump CFG statistics on stderr. Keep extern so that it's always
2339 linked in the final executable. */
2342 debug_cfg_stats (void)
2344 dump_cfg_stats (stderr
);
2347 /*---------------------------------------------------------------------------
2348 Miscellaneous helpers
2349 ---------------------------------------------------------------------------*/
2351 /* Return true if T, a GIMPLE_CALL, can make an abnormal transfer of control
2352 flow. Transfers of control flow associated with EH are excluded. */
2355 call_can_make_abnormal_goto (gimple t
)
2357 /* If the function has no non-local labels, then a call cannot make an
2358 abnormal transfer of control. */
2359 if (!cfun
->has_nonlocal_label
2360 && !cfun
->calls_setjmp
)
2363 /* Likewise if the call has no side effects. */
2364 if (!gimple_has_side_effects (t
))
2367 /* Likewise if the called function is leaf. */
2368 if (gimple_call_flags (t
) & ECF_LEAF
)
2375 /* Return true if T can make an abnormal transfer of control flow.
2376 Transfers of control flow associated with EH are excluded. */
2379 stmt_can_make_abnormal_goto (gimple t
)
2381 if (computed_goto_p (t
))
2383 if (is_gimple_call (t
))
2384 return call_can_make_abnormal_goto (t
);
2389 /* Return true if T represents a stmt that always transfers control. */
2392 is_ctrl_stmt (gimple t
)
2394 switch (gimple_code (t
))
2408 /* Return true if T is a statement that may alter the flow of control
2409 (e.g., a call to a non-returning function). */
2412 is_ctrl_altering_stmt (gimple t
)
2416 switch (gimple_code (t
))
2419 /* Per stmt call flag indicates whether the call could alter
2421 if (gimple_call_ctrl_altering_p (t
))
2425 case GIMPLE_EH_DISPATCH
:
2426 /* EH_DISPATCH branches to the individual catch handlers at
2427 this level of a try or allowed-exceptions region. It can
2428 fallthru to the next statement as well. */
2432 if (gimple_asm_nlabels (t
) > 0)
2437 /* OpenMP directives alter control flow. */
2440 case GIMPLE_TRANSACTION
:
2441 /* A transaction start alters control flow. */
2448 /* If a statement can throw, it alters control flow. */
2449 return stmt_can_throw_internal (t
);
2453 /* Return true if T is a simple local goto. */
2456 simple_goto_p (gimple t
)
2458 return (gimple_code (t
) == GIMPLE_GOTO
2459 && TREE_CODE (gimple_goto_dest (t
)) == LABEL_DECL
);
2463 /* Return true if STMT should start a new basic block. PREV_STMT is
2464 the statement preceding STMT. It is used when STMT is a label or a
2465 case label. Labels should only start a new basic block if their
2466 previous statement wasn't a label. Otherwise, sequence of labels
2467 would generate unnecessary basic blocks that only contain a single
2471 stmt_starts_bb_p (gimple stmt
, gimple prev_stmt
)
2476 /* Labels start a new basic block only if the preceding statement
2477 wasn't a label of the same type. This prevents the creation of
2478 consecutive blocks that have nothing but a single label. */
2479 if (gimple_code (stmt
) == GIMPLE_LABEL
)
2481 /* Nonlocal and computed GOTO targets always start a new block. */
2482 if (DECL_NONLOCAL (gimple_label_label (stmt
))
2483 || FORCED_LABEL (gimple_label_label (stmt
)))
2486 if (prev_stmt
&& gimple_code (prev_stmt
) == GIMPLE_LABEL
)
2488 if (DECL_NONLOCAL (gimple_label_label (prev_stmt
)))
2491 cfg_stats
.num_merged_labels
++;
2497 else if (gimple_code (stmt
) == GIMPLE_CALL
2498 && gimple_call_flags (stmt
) & ECF_RETURNS_TWICE
)
2499 /* setjmp acts similar to a nonlocal GOTO target and thus should
2500 start a new block. */
2507 /* Return true if T should end a basic block. */
2510 stmt_ends_bb_p (gimple t
)
2512 return is_ctrl_stmt (t
) || is_ctrl_altering_stmt (t
);
2515 /* Remove block annotations and other data structures. */
2518 delete_tree_cfg_annotations (void)
2520 vec_free (label_to_block_map_for_fn (cfun
));
2524 /* Return the first statement in basic block BB. */
2527 first_stmt (basic_block bb
)
2529 gimple_stmt_iterator i
= gsi_start_bb (bb
);
2532 while (!gsi_end_p (i
) && is_gimple_debug ((stmt
= gsi_stmt (i
))))
2540 /* Return the first non-label statement in basic block BB. */
2543 first_non_label_stmt (basic_block bb
)
2545 gimple_stmt_iterator i
= gsi_start_bb (bb
);
2546 while (!gsi_end_p (i
) && gimple_code (gsi_stmt (i
)) == GIMPLE_LABEL
)
2548 return !gsi_end_p (i
) ? gsi_stmt (i
) : NULL
;
2551 /* Return the last statement in basic block BB. */
2554 last_stmt (basic_block bb
)
2556 gimple_stmt_iterator i
= gsi_last_bb (bb
);
2559 while (!gsi_end_p (i
) && is_gimple_debug ((stmt
= gsi_stmt (i
))))
2567 /* Return the last statement of an otherwise empty block. Return NULL
2568 if the block is totally empty, or if it contains more than one
2572 last_and_only_stmt (basic_block bb
)
2574 gimple_stmt_iterator i
= gsi_last_nondebug_bb (bb
);
2580 last
= gsi_stmt (i
);
2581 gsi_prev_nondebug (&i
);
2585 /* Empty statements should no longer appear in the instruction stream.
2586 Everything that might have appeared before should be deleted by
2587 remove_useless_stmts, and the optimizers should just gsi_remove
2588 instead of smashing with build_empty_stmt.
2590 Thus the only thing that should appear here in a block containing
2591 one executable statement is a label. */
2592 prev
= gsi_stmt (i
);
2593 if (gimple_code (prev
) == GIMPLE_LABEL
)
2599 /* Reinstall those PHI arguments queued in OLD_EDGE to NEW_EDGE. */
2602 reinstall_phi_args (edge new_edge
, edge old_edge
)
2606 gimple_stmt_iterator phis
;
2608 vec
<edge_var_map
> *v
= redirect_edge_var_map_vector (old_edge
);
2612 for (i
= 0, phis
= gsi_start_phis (new_edge
->dest
);
2613 v
->iterate (i
, &vm
) && !gsi_end_p (phis
);
2614 i
++, gsi_next (&phis
))
2616 gimple phi
= gsi_stmt (phis
);
2617 tree result
= redirect_edge_var_map_result (vm
);
2618 tree arg
= redirect_edge_var_map_def (vm
);
2620 gcc_assert (result
== gimple_phi_result (phi
));
2622 add_phi_arg (phi
, arg
, new_edge
, redirect_edge_var_map_location (vm
));
2625 redirect_edge_var_map_clear (old_edge
);
2628 /* Returns the basic block after which the new basic block created
2629 by splitting edge EDGE_IN should be placed. Tries to keep the new block
2630 near its "logical" location. This is of most help to humans looking
2631 at debugging dumps. */
2634 split_edge_bb_loc (edge edge_in
)
2636 basic_block dest
= edge_in
->dest
;
2637 basic_block dest_prev
= dest
->prev_bb
;
2641 edge e
= find_edge (dest_prev
, dest
);
2642 if (e
&& !(e
->flags
& EDGE_COMPLEX
))
2643 return edge_in
->src
;
2648 /* Split a (typically critical) edge EDGE_IN. Return the new block.
2649 Abort on abnormal edges. */
2652 gimple_split_edge (edge edge_in
)
2654 basic_block new_bb
, after_bb
, dest
;
2657 /* Abnormal edges cannot be split. */
2658 gcc_assert (!(edge_in
->flags
& EDGE_ABNORMAL
));
2660 dest
= edge_in
->dest
;
2662 after_bb
= split_edge_bb_loc (edge_in
);
2664 new_bb
= create_empty_bb (after_bb
);
2665 new_bb
->frequency
= EDGE_FREQUENCY (edge_in
);
2666 new_bb
->count
= edge_in
->count
;
2667 new_edge
= make_edge (new_bb
, dest
, EDGE_FALLTHRU
);
2668 new_edge
->probability
= REG_BR_PROB_BASE
;
2669 new_edge
->count
= edge_in
->count
;
2671 e
= redirect_edge_and_branch (edge_in
, new_bb
);
2672 gcc_assert (e
== edge_in
);
2673 reinstall_phi_args (new_edge
, e
);
2679 /* Verify properties of the address expression T with base object BASE. */
2682 verify_address (tree t
, tree base
)
2685 bool old_side_effects
;
2687 bool new_side_effects
;
2689 old_constant
= TREE_CONSTANT (t
);
2690 old_side_effects
= TREE_SIDE_EFFECTS (t
);
2692 recompute_tree_invariant_for_addr_expr (t
);
2693 new_side_effects
= TREE_SIDE_EFFECTS (t
);
2694 new_constant
= TREE_CONSTANT (t
);
2696 if (old_constant
!= new_constant
)
2698 error ("constant not recomputed when ADDR_EXPR changed");
2701 if (old_side_effects
!= new_side_effects
)
2703 error ("side effects not recomputed when ADDR_EXPR changed");
2707 if (!(TREE_CODE (base
) == VAR_DECL
2708 || TREE_CODE (base
) == PARM_DECL
2709 || TREE_CODE (base
) == RESULT_DECL
))
2712 if (DECL_GIMPLE_REG_P (base
))
2714 error ("DECL_GIMPLE_REG_P set on a variable with address taken");
2721 /* Callback for walk_tree, check that all elements with address taken are
2722 properly noticed as such. The DATA is an int* that is 1 if TP was seen
2723 inside a PHI node. */
2726 verify_expr (tree
*tp
, int *walk_subtrees
, void *data ATTRIBUTE_UNUSED
)
2733 /* Check operand N for being valid GIMPLE and give error MSG if not. */
2734 #define CHECK_OP(N, MSG) \
2735 do { if (!is_gimple_val (TREE_OPERAND (t, N))) \
2736 { error (MSG); return TREE_OPERAND (t, N); }} while (0)
2738 switch (TREE_CODE (t
))
2741 if (SSA_NAME_IN_FREE_LIST (t
))
2743 error ("SSA name in freelist but still referenced");
2749 error ("INDIRECT_REF in gimple IL");
2753 x
= TREE_OPERAND (t
, 0);
2754 if (!POINTER_TYPE_P (TREE_TYPE (x
))
2755 || !is_gimple_mem_ref_addr (x
))
2757 error ("invalid first operand of MEM_REF");
2760 if (TREE_CODE (TREE_OPERAND (t
, 1)) != INTEGER_CST
2761 || !POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (t
, 1))))
2763 error ("invalid offset operand of MEM_REF");
2764 return TREE_OPERAND (t
, 1);
2766 if (TREE_CODE (x
) == ADDR_EXPR
2767 && (x
= verify_address (x
, TREE_OPERAND (x
, 0))))
2773 x
= fold (ASSERT_EXPR_COND (t
));
2774 if (x
== boolean_false_node
)
2776 error ("ASSERT_EXPR with an always-false condition");
2782 error ("MODIFY_EXPR not expected while having tuples");
2789 gcc_assert (is_gimple_address (t
));
2791 /* Skip any references (they will be checked when we recurse down the
2792 tree) and ensure that any variable used as a prefix is marked
2794 for (x
= TREE_OPERAND (t
, 0);
2795 handled_component_p (x
);
2796 x
= TREE_OPERAND (x
, 0))
2799 if ((tem
= verify_address (t
, x
)))
2802 if (!(TREE_CODE (x
) == VAR_DECL
2803 || TREE_CODE (x
) == PARM_DECL
2804 || TREE_CODE (x
) == RESULT_DECL
))
2807 if (!TREE_ADDRESSABLE (x
))
2809 error ("address taken, but ADDRESSABLE bit not set");
2817 x
= COND_EXPR_COND (t
);
2818 if (!INTEGRAL_TYPE_P (TREE_TYPE (x
)))
2820 error ("non-integral used in condition");
2823 if (!is_gimple_condexpr (x
))
2825 error ("invalid conditional operand");
2830 case NON_LVALUE_EXPR
:
2831 case TRUTH_NOT_EXPR
:
2835 case FIX_TRUNC_EXPR
:
2840 CHECK_OP (0, "invalid operand to unary operator");
2846 if (!is_gimple_reg_type (TREE_TYPE (t
)))
2848 error ("non-scalar BIT_FIELD_REF, IMAGPART_EXPR or REALPART_EXPR");
2852 if (TREE_CODE (t
) == BIT_FIELD_REF
)
2854 tree t0
= TREE_OPERAND (t
, 0);
2855 tree t1
= TREE_OPERAND (t
, 1);
2856 tree t2
= TREE_OPERAND (t
, 2);
2857 if (!tree_fits_uhwi_p (t1
)
2858 || !tree_fits_uhwi_p (t2
))
2860 error ("invalid position or size operand to BIT_FIELD_REF");
2863 if (INTEGRAL_TYPE_P (TREE_TYPE (t
))
2864 && (TYPE_PRECISION (TREE_TYPE (t
))
2865 != tree_to_uhwi (t1
)))
2867 error ("integral result type precision does not match "
2868 "field size of BIT_FIELD_REF");
2871 else if (!INTEGRAL_TYPE_P (TREE_TYPE (t
))
2872 && TYPE_MODE (TREE_TYPE (t
)) != BLKmode
2873 && (GET_MODE_PRECISION (TYPE_MODE (TREE_TYPE (t
)))
2874 != tree_to_uhwi (t1
)))
2876 error ("mode precision of non-integral result does not "
2877 "match field size of BIT_FIELD_REF");
2880 if (!AGGREGATE_TYPE_P (TREE_TYPE (t0
))
2881 && (tree_to_uhwi (t1
) + tree_to_uhwi (t2
)
2882 > tree_to_uhwi (TYPE_SIZE (TREE_TYPE (t0
)))))
2884 error ("position plus size exceeds size of referenced object in "
2889 t
= TREE_OPERAND (t
, 0);
2894 case ARRAY_RANGE_REF
:
2895 case VIEW_CONVERT_EXPR
:
2896 /* We have a nest of references. Verify that each of the operands
2897 that determine where to reference is either a constant or a variable,
2898 verify that the base is valid, and then show we've already checked
2900 while (handled_component_p (t
))
2902 if (TREE_CODE (t
) == COMPONENT_REF
&& TREE_OPERAND (t
, 2))
2903 CHECK_OP (2, "invalid COMPONENT_REF offset operator");
2904 else if (TREE_CODE (t
) == ARRAY_REF
2905 || TREE_CODE (t
) == ARRAY_RANGE_REF
)
2907 CHECK_OP (1, "invalid array index");
2908 if (TREE_OPERAND (t
, 2))
2909 CHECK_OP (2, "invalid array lower bound");
2910 if (TREE_OPERAND (t
, 3))
2911 CHECK_OP (3, "invalid array stride");
2913 else if (TREE_CODE (t
) == BIT_FIELD_REF
2914 || TREE_CODE (t
) == REALPART_EXPR
2915 || TREE_CODE (t
) == IMAGPART_EXPR
)
2917 error ("non-top-level BIT_FIELD_REF, IMAGPART_EXPR or "
2922 t
= TREE_OPERAND (t
, 0);
2925 if (!is_gimple_min_invariant (t
) && !is_gimple_lvalue (t
))
2927 error ("invalid reference prefix");
2934 /* PLUS_EXPR and MINUS_EXPR don't work on pointers, they should be done using
2935 POINTER_PLUS_EXPR. */
2936 if (POINTER_TYPE_P (TREE_TYPE (t
)))
2938 error ("invalid operand to plus/minus, type is a pointer");
2941 CHECK_OP (0, "invalid operand to binary operator");
2942 CHECK_OP (1, "invalid operand to binary operator");
2945 case POINTER_PLUS_EXPR
:
2946 /* Check to make sure the first operand is a pointer or reference type. */
2947 if (!POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (t
, 0))))
2949 error ("invalid operand to pointer plus, first operand is not a pointer");
2952 /* Check to make sure the second operand is a ptrofftype. */
2953 if (!ptrofftype_p (TREE_TYPE (TREE_OPERAND (t
, 1))))
2955 error ("invalid operand to pointer plus, second operand is not an "
2956 "integer type of appropriate width");
2966 case UNORDERED_EXPR
:
2975 case TRUNC_DIV_EXPR
:
2977 case FLOOR_DIV_EXPR
:
2978 case ROUND_DIV_EXPR
:
2979 case TRUNC_MOD_EXPR
:
2981 case FLOOR_MOD_EXPR
:
2982 case ROUND_MOD_EXPR
:
2984 case EXACT_DIV_EXPR
:
2994 CHECK_OP (0, "invalid operand to binary operator");
2995 CHECK_OP (1, "invalid operand to binary operator");
2999 if (TREE_CONSTANT (t
) && TREE_CODE (TREE_TYPE (t
)) == VECTOR_TYPE
)
3003 case CASE_LABEL_EXPR
:
3006 error ("invalid CASE_CHAIN");
3020 /* Verify if EXPR is either a GIMPLE ID or a GIMPLE indirect reference.
3021 Returns true if there is an error, otherwise false. */
3024 verify_types_in_gimple_min_lval (tree expr
)
3028 if (is_gimple_id (expr
))
3031 if (TREE_CODE (expr
) != TARGET_MEM_REF
3032 && TREE_CODE (expr
) != MEM_REF
)
3034 error ("invalid expression for min lvalue");
3038 /* TARGET_MEM_REFs are strange beasts. */
3039 if (TREE_CODE (expr
) == TARGET_MEM_REF
)
3042 op
= TREE_OPERAND (expr
, 0);
3043 if (!is_gimple_val (op
))
3045 error ("invalid operand in indirect reference");
3046 debug_generic_stmt (op
);
3049 /* Memory references now generally can involve a value conversion. */
3054 /* Verify if EXPR is a valid GIMPLE reference expression. If
3055 REQUIRE_LVALUE is true verifies it is an lvalue. Returns true
3056 if there is an error, otherwise false. */
3059 verify_types_in_gimple_reference (tree expr
, bool require_lvalue
)
3061 while (handled_component_p (expr
))
3063 tree op
= TREE_OPERAND (expr
, 0);
3065 if (TREE_CODE (expr
) == ARRAY_REF
3066 || TREE_CODE (expr
) == ARRAY_RANGE_REF
)
3068 if (!is_gimple_val (TREE_OPERAND (expr
, 1))
3069 || (TREE_OPERAND (expr
, 2)
3070 && !is_gimple_val (TREE_OPERAND (expr
, 2)))
3071 || (TREE_OPERAND (expr
, 3)
3072 && !is_gimple_val (TREE_OPERAND (expr
, 3))))
3074 error ("invalid operands to array reference");
3075 debug_generic_stmt (expr
);
3080 /* Verify if the reference array element types are compatible. */
3081 if (TREE_CODE (expr
) == ARRAY_REF
3082 && !useless_type_conversion_p (TREE_TYPE (expr
),
3083 TREE_TYPE (TREE_TYPE (op
))))
3085 error ("type mismatch in array reference");
3086 debug_generic_stmt (TREE_TYPE (expr
));
3087 debug_generic_stmt (TREE_TYPE (TREE_TYPE (op
)));
3090 if (TREE_CODE (expr
) == ARRAY_RANGE_REF
3091 && !useless_type_conversion_p (TREE_TYPE (TREE_TYPE (expr
)),
3092 TREE_TYPE (TREE_TYPE (op
))))
3094 error ("type mismatch in array range reference");
3095 debug_generic_stmt (TREE_TYPE (TREE_TYPE (expr
)));
3096 debug_generic_stmt (TREE_TYPE (TREE_TYPE (op
)));
3100 if ((TREE_CODE (expr
) == REALPART_EXPR
3101 || TREE_CODE (expr
) == IMAGPART_EXPR
)
3102 && !useless_type_conversion_p (TREE_TYPE (expr
),
3103 TREE_TYPE (TREE_TYPE (op
))))
3105 error ("type mismatch in real/imagpart reference");
3106 debug_generic_stmt (TREE_TYPE (expr
));
3107 debug_generic_stmt (TREE_TYPE (TREE_TYPE (op
)));
3111 if (TREE_CODE (expr
) == COMPONENT_REF
3112 && !useless_type_conversion_p (TREE_TYPE (expr
),
3113 TREE_TYPE (TREE_OPERAND (expr
, 1))))
3115 error ("type mismatch in component reference");
3116 debug_generic_stmt (TREE_TYPE (expr
));
3117 debug_generic_stmt (TREE_TYPE (TREE_OPERAND (expr
, 1)));
3121 if (TREE_CODE (expr
) == VIEW_CONVERT_EXPR
)
3123 /* For VIEW_CONVERT_EXPRs which are allowed here too, we only check
3124 that their operand is not an SSA name or an invariant when
3125 requiring an lvalue (this usually means there is a SRA or IPA-SRA
3126 bug). Otherwise there is nothing to verify, gross mismatches at
3127 most invoke undefined behavior. */
3129 && (TREE_CODE (op
) == SSA_NAME
3130 || is_gimple_min_invariant (op
)))
3132 error ("conversion of an SSA_NAME on the left hand side");
3133 debug_generic_stmt (expr
);
3136 else if (TREE_CODE (op
) == SSA_NAME
3137 && TYPE_SIZE (TREE_TYPE (expr
)) != TYPE_SIZE (TREE_TYPE (op
)))
3139 error ("conversion of register to a different size");
3140 debug_generic_stmt (expr
);
3143 else if (!handled_component_p (op
))
3150 if (TREE_CODE (expr
) == MEM_REF
)
3152 if (!is_gimple_mem_ref_addr (TREE_OPERAND (expr
, 0)))
3154 error ("invalid address operand in MEM_REF");
3155 debug_generic_stmt (expr
);
3158 if (TREE_CODE (TREE_OPERAND (expr
, 1)) != INTEGER_CST
3159 || !POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (expr
, 1))))
3161 error ("invalid offset operand in MEM_REF");
3162 debug_generic_stmt (expr
);
3166 else if (TREE_CODE (expr
) == TARGET_MEM_REF
)
3168 if (!TMR_BASE (expr
)
3169 || !is_gimple_mem_ref_addr (TMR_BASE (expr
)))
3171 error ("invalid address operand in TARGET_MEM_REF");
3174 if (!TMR_OFFSET (expr
)
3175 || TREE_CODE (TMR_OFFSET (expr
)) != INTEGER_CST
3176 || !POINTER_TYPE_P (TREE_TYPE (TMR_OFFSET (expr
))))
3178 error ("invalid offset operand in TARGET_MEM_REF");
3179 debug_generic_stmt (expr
);
3184 return ((require_lvalue
|| !is_gimple_min_invariant (expr
))
3185 && verify_types_in_gimple_min_lval (expr
));
3188 /* Returns true if there is one pointer type in TYPE_POINTER_TO (SRC_OBJ)
3189 list of pointer-to types that is trivially convertible to DEST. */
3192 one_pointer_to_useless_type_conversion_p (tree dest
, tree src_obj
)
3196 if (!TYPE_POINTER_TO (src_obj
))
3199 for (src
= TYPE_POINTER_TO (src_obj
); src
; src
= TYPE_NEXT_PTR_TO (src
))
3200 if (useless_type_conversion_p (dest
, src
))
3206 /* Return true if TYPE1 is a fixed-point type and if conversions to and
3207 from TYPE2 can be handled by FIXED_CONVERT_EXPR. */
3210 valid_fixed_convert_types_p (tree type1
, tree type2
)
3212 return (FIXED_POINT_TYPE_P (type1
)
3213 && (INTEGRAL_TYPE_P (type2
)
3214 || SCALAR_FLOAT_TYPE_P (type2
)
3215 || FIXED_POINT_TYPE_P (type2
)));
3218 /* Verify the contents of a GIMPLE_CALL STMT. Returns true when there
3219 is a problem, otherwise false. */
3222 verify_gimple_call (gimple stmt
)
3224 tree fn
= gimple_call_fn (stmt
);
3225 tree fntype
, fndecl
;
3228 if (gimple_call_internal_p (stmt
))
3232 error ("gimple call has two targets");
3233 debug_generic_stmt (fn
);
3241 error ("gimple call has no target");
3246 if (fn
&& !is_gimple_call_addr (fn
))
3248 error ("invalid function in gimple call");
3249 debug_generic_stmt (fn
);
3254 && (!POINTER_TYPE_P (TREE_TYPE (fn
))
3255 || (TREE_CODE (TREE_TYPE (TREE_TYPE (fn
))) != FUNCTION_TYPE
3256 && TREE_CODE (TREE_TYPE (TREE_TYPE (fn
))) != METHOD_TYPE
)))
3258 error ("non-function in gimple call");
3262 fndecl
= gimple_call_fndecl (stmt
);
3264 && TREE_CODE (fndecl
) == FUNCTION_DECL
3265 && DECL_LOOPING_CONST_OR_PURE_P (fndecl
)
3266 && !DECL_PURE_P (fndecl
)
3267 && !TREE_READONLY (fndecl
))
3269 error ("invalid pure const state for function");
3273 if (gimple_call_lhs (stmt
)
3274 && (!is_gimple_lvalue (gimple_call_lhs (stmt
))
3275 || verify_types_in_gimple_reference (gimple_call_lhs (stmt
), true)))
3277 error ("invalid LHS in gimple call");
3281 if (gimple_call_lhs (stmt
) && gimple_call_noreturn_p (stmt
))
3283 error ("LHS in noreturn call");
3287 fntype
= gimple_call_fntype (stmt
);
3289 && gimple_call_lhs (stmt
)
3290 && !useless_type_conversion_p (TREE_TYPE (gimple_call_lhs (stmt
)),
3292 /* ??? At least C++ misses conversions at assignments from
3293 void * call results.
3294 ??? Java is completely off. Especially with functions
3295 returning java.lang.Object.
3296 For now simply allow arbitrary pointer type conversions. */
3297 && !(POINTER_TYPE_P (TREE_TYPE (gimple_call_lhs (stmt
)))
3298 && POINTER_TYPE_P (TREE_TYPE (fntype
))))
3300 error ("invalid conversion in gimple call");
3301 debug_generic_stmt (TREE_TYPE (gimple_call_lhs (stmt
)));
3302 debug_generic_stmt (TREE_TYPE (fntype
));
3306 if (gimple_call_chain (stmt
)
3307 && !is_gimple_val (gimple_call_chain (stmt
)))
3309 error ("invalid static chain in gimple call");
3310 debug_generic_stmt (gimple_call_chain (stmt
));
3314 /* If there is a static chain argument, this should not be an indirect
3315 call, and the decl should have DECL_STATIC_CHAIN set. */
3316 if (gimple_call_chain (stmt
))
3318 if (!gimple_call_fndecl (stmt
))
3320 error ("static chain in indirect gimple call");
3323 fn
= TREE_OPERAND (fn
, 0);
3325 if (!DECL_STATIC_CHAIN (fn
))
3327 error ("static chain with function that doesn%'t use one");
3332 /* ??? The C frontend passes unpromoted arguments in case it
3333 didn't see a function declaration before the call. So for now
3334 leave the call arguments mostly unverified. Once we gimplify
3335 unit-at-a-time we have a chance to fix this. */
3337 for (i
= 0; i
< gimple_call_num_args (stmt
); ++i
)
3339 tree arg
= gimple_call_arg (stmt
, i
);
3340 if ((is_gimple_reg_type (TREE_TYPE (arg
))
3341 && !is_gimple_val (arg
))
3342 || (!is_gimple_reg_type (TREE_TYPE (arg
))
3343 && !is_gimple_lvalue (arg
)))
3345 error ("invalid argument to gimple call");
3346 debug_generic_expr (arg
);
3354 /* Verifies the gimple comparison with the result type TYPE and
3355 the operands OP0 and OP1. */
3358 verify_gimple_comparison (tree type
, tree op0
, tree op1
)
3360 tree op0_type
= TREE_TYPE (op0
);
3361 tree op1_type
= TREE_TYPE (op1
);
3363 if (!is_gimple_val (op0
) || !is_gimple_val (op1
))
3365 error ("invalid operands in gimple comparison");
3369 /* For comparisons we do not have the operations type as the
3370 effective type the comparison is carried out in. Instead
3371 we require that either the first operand is trivially
3372 convertible into the second, or the other way around.
3373 Because we special-case pointers to void we allow
3374 comparisons of pointers with the same mode as well. */
3375 if (!useless_type_conversion_p (op0_type
, op1_type
)
3376 && !useless_type_conversion_p (op1_type
, op0_type
)
3377 && (!POINTER_TYPE_P (op0_type
)
3378 || !POINTER_TYPE_P (op1_type
)
3379 || TYPE_MODE (op0_type
) != TYPE_MODE (op1_type
)))
3381 error ("mismatching comparison operand types");
3382 debug_generic_expr (op0_type
);
3383 debug_generic_expr (op1_type
);
3387 /* The resulting type of a comparison may be an effective boolean type. */
3388 if (INTEGRAL_TYPE_P (type
)
3389 && (TREE_CODE (type
) == BOOLEAN_TYPE
3390 || TYPE_PRECISION (type
) == 1))
3392 if (TREE_CODE (op0_type
) == VECTOR_TYPE
3393 || TREE_CODE (op1_type
) == VECTOR_TYPE
)
3395 error ("vector comparison returning a boolean");
3396 debug_generic_expr (op0_type
);
3397 debug_generic_expr (op1_type
);
3401 /* Or an integer vector type with the same size and element count
3402 as the comparison operand types. */
3403 else if (TREE_CODE (type
) == VECTOR_TYPE
3404 && TREE_CODE (TREE_TYPE (type
)) == INTEGER_TYPE
)
3406 if (TREE_CODE (op0_type
) != VECTOR_TYPE
3407 || TREE_CODE (op1_type
) != VECTOR_TYPE
)
3409 error ("non-vector operands in vector comparison");
3410 debug_generic_expr (op0_type
);
3411 debug_generic_expr (op1_type
);
3415 if (TYPE_VECTOR_SUBPARTS (type
) != TYPE_VECTOR_SUBPARTS (op0_type
)
3416 || (GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (type
)))
3417 != GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (op0_type
))))
3418 /* The result of a vector comparison is of signed
3420 || TYPE_UNSIGNED (TREE_TYPE (type
)))
3422 error ("invalid vector comparison resulting type");
3423 debug_generic_expr (type
);
3429 error ("bogus comparison result type");
3430 debug_generic_expr (type
);
3437 /* Verify a gimple assignment statement STMT with an unary rhs.
3438 Returns true if anything is wrong. */
3441 verify_gimple_assign_unary (gimple stmt
)
3443 enum tree_code rhs_code
= gimple_assign_rhs_code (stmt
);
3444 tree lhs
= gimple_assign_lhs (stmt
);
3445 tree lhs_type
= TREE_TYPE (lhs
);
3446 tree rhs1
= gimple_assign_rhs1 (stmt
);
3447 tree rhs1_type
= TREE_TYPE (rhs1
);
3449 if (!is_gimple_reg (lhs
))
3451 error ("non-register as LHS of unary operation");
3455 if (!is_gimple_val (rhs1
))
3457 error ("invalid operand in unary operation");
3461 /* First handle conversions. */
3466 /* Allow conversions from pointer type to integral type only if
3467 there is no sign or zero extension involved.
3468 For targets were the precision of ptrofftype doesn't match that
3469 of pointers we need to allow arbitrary conversions to ptrofftype. */
3470 if ((POINTER_TYPE_P (lhs_type
)
3471 && INTEGRAL_TYPE_P (rhs1_type
))
3472 || (POINTER_TYPE_P (rhs1_type
)
3473 && INTEGRAL_TYPE_P (lhs_type
)
3474 && (TYPE_PRECISION (rhs1_type
) >= TYPE_PRECISION (lhs_type
)
3475 || ptrofftype_p (sizetype
))))
3478 /* Allow conversion from integral to offset type and vice versa. */
3479 if ((TREE_CODE (lhs_type
) == OFFSET_TYPE
3480 && INTEGRAL_TYPE_P (rhs1_type
))
3481 || (INTEGRAL_TYPE_P (lhs_type
)
3482 && TREE_CODE (rhs1_type
) == OFFSET_TYPE
))
3485 /* Otherwise assert we are converting between types of the
3487 if (INTEGRAL_TYPE_P (lhs_type
) != INTEGRAL_TYPE_P (rhs1_type
))
3489 error ("invalid types in nop conversion");
3490 debug_generic_expr (lhs_type
);
3491 debug_generic_expr (rhs1_type
);
3498 case ADDR_SPACE_CONVERT_EXPR
:
3500 if (!POINTER_TYPE_P (rhs1_type
) || !POINTER_TYPE_P (lhs_type
)
3501 || (TYPE_ADDR_SPACE (TREE_TYPE (rhs1_type
))
3502 == TYPE_ADDR_SPACE (TREE_TYPE (lhs_type
))))
3504 error ("invalid types in address space conversion");
3505 debug_generic_expr (lhs_type
);
3506 debug_generic_expr (rhs1_type
);
3513 case FIXED_CONVERT_EXPR
:
3515 if (!valid_fixed_convert_types_p (lhs_type
, rhs1_type
)
3516 && !valid_fixed_convert_types_p (rhs1_type
, lhs_type
))
3518 error ("invalid types in fixed-point conversion");
3519 debug_generic_expr (lhs_type
);
3520 debug_generic_expr (rhs1_type
);
3529 if ((!INTEGRAL_TYPE_P (rhs1_type
) || !SCALAR_FLOAT_TYPE_P (lhs_type
))
3530 && (!VECTOR_INTEGER_TYPE_P (rhs1_type
)
3531 || !VECTOR_FLOAT_TYPE_P (lhs_type
)))
3533 error ("invalid types in conversion to floating point");
3534 debug_generic_expr (lhs_type
);
3535 debug_generic_expr (rhs1_type
);
3542 case FIX_TRUNC_EXPR
:
3544 if ((!INTEGRAL_TYPE_P (lhs_type
) || !SCALAR_FLOAT_TYPE_P (rhs1_type
))
3545 && (!VECTOR_INTEGER_TYPE_P (lhs_type
)
3546 || !VECTOR_FLOAT_TYPE_P (rhs1_type
)))
3548 error ("invalid types in conversion to integer");
3549 debug_generic_expr (lhs_type
);
3550 debug_generic_expr (rhs1_type
);
3556 case REDUC_MAX_EXPR
:
3557 case REDUC_MIN_EXPR
:
3558 case REDUC_PLUS_EXPR
:
3559 if (!VECTOR_TYPE_P (rhs1_type
)
3560 || !useless_type_conversion_p (lhs_type
, TREE_TYPE (rhs1_type
)))
3562 error ("reduction should convert from vector to element type");
3563 debug_generic_expr (lhs_type
);
3564 debug_generic_expr (rhs1_type
);
3569 case VEC_UNPACK_HI_EXPR
:
3570 case VEC_UNPACK_LO_EXPR
:
3571 case VEC_UNPACK_FLOAT_HI_EXPR
:
3572 case VEC_UNPACK_FLOAT_LO_EXPR
:
3587 /* For the remaining codes assert there is no conversion involved. */
3588 if (!useless_type_conversion_p (lhs_type
, rhs1_type
))
3590 error ("non-trivial conversion in unary operation");
3591 debug_generic_expr (lhs_type
);
3592 debug_generic_expr (rhs1_type
);
3599 /* Verify a gimple assignment statement STMT with a binary rhs.
3600 Returns true if anything is wrong. */
3603 verify_gimple_assign_binary (gimple stmt
)
3605 enum tree_code rhs_code
= gimple_assign_rhs_code (stmt
);
3606 tree lhs
= gimple_assign_lhs (stmt
);
3607 tree lhs_type
= TREE_TYPE (lhs
);
3608 tree rhs1
= gimple_assign_rhs1 (stmt
);
3609 tree rhs1_type
= TREE_TYPE (rhs1
);
3610 tree rhs2
= gimple_assign_rhs2 (stmt
);
3611 tree rhs2_type
= TREE_TYPE (rhs2
);
3613 if (!is_gimple_reg (lhs
))
3615 error ("non-register as LHS of binary operation");
3619 if (!is_gimple_val (rhs1
)
3620 || !is_gimple_val (rhs2
))
3622 error ("invalid operands in binary operation");
3626 /* First handle operations that involve different types. */
3631 if (TREE_CODE (lhs_type
) != COMPLEX_TYPE
3632 || !(INTEGRAL_TYPE_P (rhs1_type
)
3633 || SCALAR_FLOAT_TYPE_P (rhs1_type
))
3634 || !(INTEGRAL_TYPE_P (rhs2_type
)
3635 || SCALAR_FLOAT_TYPE_P (rhs2_type
)))
3637 error ("type mismatch in complex expression");
3638 debug_generic_expr (lhs_type
);
3639 debug_generic_expr (rhs1_type
);
3640 debug_generic_expr (rhs2_type
);
3652 /* Shifts and rotates are ok on integral types, fixed point
3653 types and integer vector types. */
3654 if ((!INTEGRAL_TYPE_P (rhs1_type
)
3655 && !FIXED_POINT_TYPE_P (rhs1_type
)
3656 && !(TREE_CODE (rhs1_type
) == VECTOR_TYPE
3657 && INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type
))))
3658 || (!INTEGRAL_TYPE_P (rhs2_type
)
3659 /* Vector shifts of vectors are also ok. */
3660 && !(TREE_CODE (rhs1_type
) == VECTOR_TYPE
3661 && INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type
))
3662 && TREE_CODE (rhs2_type
) == VECTOR_TYPE
3663 && INTEGRAL_TYPE_P (TREE_TYPE (rhs2_type
))))
3664 || !useless_type_conversion_p (lhs_type
, rhs1_type
))
3666 error ("type mismatch in shift expression");
3667 debug_generic_expr (lhs_type
);
3668 debug_generic_expr (rhs1_type
);
3669 debug_generic_expr (rhs2_type
);
3676 case VEC_LSHIFT_EXPR
:
3677 case VEC_RSHIFT_EXPR
:
3679 if (TREE_CODE (rhs1_type
) != VECTOR_TYPE
3680 || !(INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type
))
3681 || POINTER_TYPE_P (TREE_TYPE (rhs1_type
))
3682 || FIXED_POINT_TYPE_P (TREE_TYPE (rhs1_type
))
3683 || SCALAR_FLOAT_TYPE_P (TREE_TYPE (rhs1_type
)))
3684 || (!INTEGRAL_TYPE_P (rhs2_type
)
3685 && (TREE_CODE (rhs2_type
) != VECTOR_TYPE
3686 || !INTEGRAL_TYPE_P (TREE_TYPE (rhs2_type
))))
3687 || !useless_type_conversion_p (lhs_type
, rhs1_type
))
3689 error ("type mismatch in vector shift expression");
3690 debug_generic_expr (lhs_type
);
3691 debug_generic_expr (rhs1_type
);
3692 debug_generic_expr (rhs2_type
);
3695 /* For shifting a vector of non-integral components we
3696 only allow shifting by a constant multiple of the element size. */
3697 if (!INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type
))
3698 && (TREE_CODE (rhs2
) != INTEGER_CST
3699 || !div_if_zero_remainder (rhs2
,
3700 TYPE_SIZE (TREE_TYPE (rhs1_type
)))))
3702 error ("non-element sized vector shift of floating point vector");
3709 case WIDEN_LSHIFT_EXPR
:
3711 if (!INTEGRAL_TYPE_P (lhs_type
)
3712 || !INTEGRAL_TYPE_P (rhs1_type
)
3713 || TREE_CODE (rhs2
) != INTEGER_CST
3714 || (2 * TYPE_PRECISION (rhs1_type
) > TYPE_PRECISION (lhs_type
)))
3716 error ("type mismatch in widening vector shift expression");
3717 debug_generic_expr (lhs_type
);
3718 debug_generic_expr (rhs1_type
);
3719 debug_generic_expr (rhs2_type
);
3726 case VEC_WIDEN_LSHIFT_HI_EXPR
:
3727 case VEC_WIDEN_LSHIFT_LO_EXPR
:
3729 if (TREE_CODE (rhs1_type
) != VECTOR_TYPE
3730 || TREE_CODE (lhs_type
) != VECTOR_TYPE
3731 || !INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type
))
3732 || !INTEGRAL_TYPE_P (TREE_TYPE (lhs_type
))
3733 || TREE_CODE (rhs2
) != INTEGER_CST
3734 || (2 * TYPE_PRECISION (TREE_TYPE (rhs1_type
))
3735 > TYPE_PRECISION (TREE_TYPE (lhs_type
))))
3737 error ("type mismatch in widening vector shift expression");
3738 debug_generic_expr (lhs_type
);
3739 debug_generic_expr (rhs1_type
);
3740 debug_generic_expr (rhs2_type
);
3750 tree lhs_etype
= lhs_type
;
3751 tree rhs1_etype
= rhs1_type
;
3752 tree rhs2_etype
= rhs2_type
;
3753 if (TREE_CODE (lhs_type
) == VECTOR_TYPE
)
3755 if (TREE_CODE (rhs1_type
) != VECTOR_TYPE
3756 || TREE_CODE (rhs2_type
) != VECTOR_TYPE
)
3758 error ("invalid non-vector operands to vector valued plus");
3761 lhs_etype
= TREE_TYPE (lhs_type
);
3762 rhs1_etype
= TREE_TYPE (rhs1_type
);
3763 rhs2_etype
= TREE_TYPE (rhs2_type
);
3765 if (POINTER_TYPE_P (lhs_etype
)
3766 || POINTER_TYPE_P (rhs1_etype
)
3767 || POINTER_TYPE_P (rhs2_etype
))
3769 error ("invalid (pointer) operands to plus/minus");
3773 /* Continue with generic binary expression handling. */
3777 case POINTER_PLUS_EXPR
:
3779 if (!POINTER_TYPE_P (rhs1_type
)
3780 || !useless_type_conversion_p (lhs_type
, rhs1_type
)
3781 || !ptrofftype_p (rhs2_type
))
3783 error ("type mismatch in pointer plus expression");
3784 debug_generic_stmt (lhs_type
);
3785 debug_generic_stmt (rhs1_type
);
3786 debug_generic_stmt (rhs2_type
);
3793 case TRUTH_ANDIF_EXPR
:
3794 case TRUTH_ORIF_EXPR
:
3795 case TRUTH_AND_EXPR
:
3797 case TRUTH_XOR_EXPR
:
3807 case UNORDERED_EXPR
:
3815 /* Comparisons are also binary, but the result type is not
3816 connected to the operand types. */
3817 return verify_gimple_comparison (lhs_type
, rhs1
, rhs2
);
3819 case WIDEN_MULT_EXPR
:
3820 if (TREE_CODE (lhs_type
) != INTEGER_TYPE
)
3822 return ((2 * TYPE_PRECISION (rhs1_type
) > TYPE_PRECISION (lhs_type
))
3823 || (TYPE_PRECISION (rhs1_type
) != TYPE_PRECISION (rhs2_type
)));
3825 case WIDEN_SUM_EXPR
:
3826 case VEC_WIDEN_MULT_HI_EXPR
:
3827 case VEC_WIDEN_MULT_LO_EXPR
:
3828 case VEC_WIDEN_MULT_EVEN_EXPR
:
3829 case VEC_WIDEN_MULT_ODD_EXPR
:
3830 case VEC_PACK_TRUNC_EXPR
:
3831 case VEC_PACK_SAT_EXPR
:
3832 case VEC_PACK_FIX_TRUNC_EXPR
:
3837 case MULT_HIGHPART_EXPR
:
3838 case TRUNC_DIV_EXPR
:
3840 case FLOOR_DIV_EXPR
:
3841 case ROUND_DIV_EXPR
:
3842 case TRUNC_MOD_EXPR
:
3844 case FLOOR_MOD_EXPR
:
3845 case ROUND_MOD_EXPR
:
3847 case EXACT_DIV_EXPR
:
3853 /* Continue with generic binary expression handling. */
3860 if (!useless_type_conversion_p (lhs_type
, rhs1_type
)
3861 || !useless_type_conversion_p (lhs_type
, rhs2_type
))
3863 error ("type mismatch in binary expression");
3864 debug_generic_stmt (lhs_type
);
3865 debug_generic_stmt (rhs1_type
);
3866 debug_generic_stmt (rhs2_type
);
3873 /* Verify a gimple assignment statement STMT with a ternary rhs.
3874 Returns true if anything is wrong. */
3877 verify_gimple_assign_ternary (gimple stmt
)
3879 enum tree_code rhs_code
= gimple_assign_rhs_code (stmt
);
3880 tree lhs
= gimple_assign_lhs (stmt
);
3881 tree lhs_type
= TREE_TYPE (lhs
);
3882 tree rhs1
= gimple_assign_rhs1 (stmt
);
3883 tree rhs1_type
= TREE_TYPE (rhs1
);
3884 tree rhs2
= gimple_assign_rhs2 (stmt
);
3885 tree rhs2_type
= TREE_TYPE (rhs2
);
3886 tree rhs3
= gimple_assign_rhs3 (stmt
);
3887 tree rhs3_type
= TREE_TYPE (rhs3
);
3889 if (!is_gimple_reg (lhs
))
3891 error ("non-register as LHS of ternary operation");
3895 if (((rhs_code
== VEC_COND_EXPR
|| rhs_code
== COND_EXPR
)
3896 ? !is_gimple_condexpr (rhs1
) : !is_gimple_val (rhs1
))
3897 || !is_gimple_val (rhs2
)
3898 || !is_gimple_val (rhs3
))
3900 error ("invalid operands in ternary operation");
3904 /* First handle operations that involve different types. */
3907 case WIDEN_MULT_PLUS_EXPR
:
3908 case WIDEN_MULT_MINUS_EXPR
:
3909 if ((!INTEGRAL_TYPE_P (rhs1_type
)
3910 && !FIXED_POINT_TYPE_P (rhs1_type
))
3911 || !useless_type_conversion_p (rhs1_type
, rhs2_type
)
3912 || !useless_type_conversion_p (lhs_type
, rhs3_type
)
3913 || 2 * TYPE_PRECISION (rhs1_type
) > TYPE_PRECISION (lhs_type
)
3914 || TYPE_PRECISION (rhs1_type
) != TYPE_PRECISION (rhs2_type
))
3916 error ("type mismatch in widening multiply-accumulate expression");
3917 debug_generic_expr (lhs_type
);
3918 debug_generic_expr (rhs1_type
);
3919 debug_generic_expr (rhs2_type
);
3920 debug_generic_expr (rhs3_type
);
3926 if (!useless_type_conversion_p (lhs_type
, rhs1_type
)
3927 || !useless_type_conversion_p (lhs_type
, rhs2_type
)
3928 || !useless_type_conversion_p (lhs_type
, rhs3_type
))
3930 error ("type mismatch in fused multiply-add expression");
3931 debug_generic_expr (lhs_type
);
3932 debug_generic_expr (rhs1_type
);
3933 debug_generic_expr (rhs2_type
);
3934 debug_generic_expr (rhs3_type
);
3941 if (!useless_type_conversion_p (lhs_type
, rhs2_type
)
3942 || !useless_type_conversion_p (lhs_type
, rhs3_type
))
3944 error ("type mismatch in conditional expression");
3945 debug_generic_expr (lhs_type
);
3946 debug_generic_expr (rhs2_type
);
3947 debug_generic_expr (rhs3_type
);
3953 if (!useless_type_conversion_p (lhs_type
, rhs1_type
)
3954 || !useless_type_conversion_p (lhs_type
, rhs2_type
))
3956 error ("type mismatch in vector permute expression");
3957 debug_generic_expr (lhs_type
);
3958 debug_generic_expr (rhs1_type
);
3959 debug_generic_expr (rhs2_type
);
3960 debug_generic_expr (rhs3_type
);
3964 if (TREE_CODE (rhs1_type
) != VECTOR_TYPE
3965 || TREE_CODE (rhs2_type
) != VECTOR_TYPE
3966 || TREE_CODE (rhs3_type
) != VECTOR_TYPE
)
3968 error ("vector types expected in vector permute expression");
3969 debug_generic_expr (lhs_type
);
3970 debug_generic_expr (rhs1_type
);
3971 debug_generic_expr (rhs2_type
);
3972 debug_generic_expr (rhs3_type
);
3976 if (TYPE_VECTOR_SUBPARTS (rhs1_type
) != TYPE_VECTOR_SUBPARTS (rhs2_type
)
3977 || TYPE_VECTOR_SUBPARTS (rhs2_type
)
3978 != TYPE_VECTOR_SUBPARTS (rhs3_type
)
3979 || TYPE_VECTOR_SUBPARTS (rhs3_type
)
3980 != TYPE_VECTOR_SUBPARTS (lhs_type
))
3982 error ("vectors with different element number found "
3983 "in vector permute expression");
3984 debug_generic_expr (lhs_type
);
3985 debug_generic_expr (rhs1_type
);
3986 debug_generic_expr (rhs2_type
);
3987 debug_generic_expr (rhs3_type
);
3991 if (TREE_CODE (TREE_TYPE (rhs3_type
)) != INTEGER_TYPE
3992 || GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (rhs3_type
)))
3993 != GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (rhs1_type
))))
3995 error ("invalid mask type in vector permute expression");
3996 debug_generic_expr (lhs_type
);
3997 debug_generic_expr (rhs1_type
);
3998 debug_generic_expr (rhs2_type
);
3999 debug_generic_expr (rhs3_type
);
4006 if (!useless_type_conversion_p (rhs1_type
, rhs2_type
)
4007 || !useless_type_conversion_p (lhs_type
, rhs3_type
)
4008 || 2 * GET_MODE_BITSIZE (GET_MODE_INNER
4009 (TYPE_MODE (TREE_TYPE (rhs1_type
))))
4010 > GET_MODE_BITSIZE (GET_MODE_INNER
4011 (TYPE_MODE (TREE_TYPE (lhs_type
)))))
4013 error ("type mismatch in sad expression");
4014 debug_generic_expr (lhs_type
);
4015 debug_generic_expr (rhs1_type
);
4016 debug_generic_expr (rhs2_type
);
4017 debug_generic_expr (rhs3_type
);
4021 if (TREE_CODE (rhs1_type
) != VECTOR_TYPE
4022 || TREE_CODE (rhs2_type
) != VECTOR_TYPE
4023 || TREE_CODE (rhs3_type
) != VECTOR_TYPE
)
4025 error ("vector types expected in sad expression");
4026 debug_generic_expr (lhs_type
);
4027 debug_generic_expr (rhs1_type
);
4028 debug_generic_expr (rhs2_type
);
4029 debug_generic_expr (rhs3_type
);
4036 case REALIGN_LOAD_EXPR
:
4046 /* Verify a gimple assignment statement STMT with a single rhs.
4047 Returns true if anything is wrong. */
4050 verify_gimple_assign_single (gimple stmt
)
4052 enum tree_code rhs_code
= gimple_assign_rhs_code (stmt
);
4053 tree lhs
= gimple_assign_lhs (stmt
);
4054 tree lhs_type
= TREE_TYPE (lhs
);
4055 tree rhs1
= gimple_assign_rhs1 (stmt
);
4056 tree rhs1_type
= TREE_TYPE (rhs1
);
4059 if (!useless_type_conversion_p (lhs_type
, rhs1_type
))
4061 error ("non-trivial conversion at assignment");
4062 debug_generic_expr (lhs_type
);
4063 debug_generic_expr (rhs1_type
);
4067 if (gimple_clobber_p (stmt
)
4068 && !(DECL_P (lhs
) || TREE_CODE (lhs
) == MEM_REF
))
4070 error ("non-decl/MEM_REF LHS in clobber statement");
4071 debug_generic_expr (lhs
);
4075 if (handled_component_p (lhs
)
4076 || TREE_CODE (lhs
) == MEM_REF
4077 || TREE_CODE (lhs
) == TARGET_MEM_REF
)
4078 res
|= verify_types_in_gimple_reference (lhs
, true);
4080 /* Special codes we cannot handle via their class. */
4085 tree op
= TREE_OPERAND (rhs1
, 0);
4086 if (!is_gimple_addressable (op
))
4088 error ("invalid operand in unary expression");
4092 /* Technically there is no longer a need for matching types, but
4093 gimple hygiene asks for this check. In LTO we can end up
4094 combining incompatible units and thus end up with addresses
4095 of globals that change their type to a common one. */
4097 && !types_compatible_p (TREE_TYPE (op
),
4098 TREE_TYPE (TREE_TYPE (rhs1
)))
4099 && !one_pointer_to_useless_type_conversion_p (TREE_TYPE (rhs1
),
4102 error ("type mismatch in address expression");
4103 debug_generic_stmt (TREE_TYPE (rhs1
));
4104 debug_generic_stmt (TREE_TYPE (op
));
4108 return verify_types_in_gimple_reference (op
, true);
4113 error ("INDIRECT_REF in gimple IL");
4119 case ARRAY_RANGE_REF
:
4120 case VIEW_CONVERT_EXPR
:
4123 case TARGET_MEM_REF
:
4125 if (!is_gimple_reg (lhs
)
4126 && is_gimple_reg_type (TREE_TYPE (lhs
)))
4128 error ("invalid rhs for gimple memory store");
4129 debug_generic_stmt (lhs
);
4130 debug_generic_stmt (rhs1
);
4133 return res
|| verify_types_in_gimple_reference (rhs1
, false);
4145 /* tcc_declaration */
4150 if (!is_gimple_reg (lhs
)
4151 && !is_gimple_reg (rhs1
)
4152 && is_gimple_reg_type (TREE_TYPE (lhs
)))
4154 error ("invalid rhs for gimple memory store");
4155 debug_generic_stmt (lhs
);
4156 debug_generic_stmt (rhs1
);
4162 if (TREE_CODE (rhs1_type
) == VECTOR_TYPE
)
4165 tree elt_i
, elt_v
, elt_t
= NULL_TREE
;
4167 if (CONSTRUCTOR_NELTS (rhs1
) == 0)
4169 /* For vector CONSTRUCTORs we require that either it is empty
4170 CONSTRUCTOR, or it is a CONSTRUCTOR of smaller vector elements
4171 (then the element count must be correct to cover the whole
4172 outer vector and index must be NULL on all elements, or it is
4173 a CONSTRUCTOR of scalar elements, where we as an exception allow
4174 smaller number of elements (assuming zero filling) and
4175 consecutive indexes as compared to NULL indexes (such
4176 CONSTRUCTORs can appear in the IL from FEs). */
4177 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (rhs1
), i
, elt_i
, elt_v
)
4179 if (elt_t
== NULL_TREE
)
4181 elt_t
= TREE_TYPE (elt_v
);
4182 if (TREE_CODE (elt_t
) == VECTOR_TYPE
)
4184 tree elt_t
= TREE_TYPE (elt_v
);
4185 if (!useless_type_conversion_p (TREE_TYPE (rhs1_type
),
4188 error ("incorrect type of vector CONSTRUCTOR"
4190 debug_generic_stmt (rhs1
);
4193 else if (CONSTRUCTOR_NELTS (rhs1
)
4194 * TYPE_VECTOR_SUBPARTS (elt_t
)
4195 != TYPE_VECTOR_SUBPARTS (rhs1_type
))
4197 error ("incorrect number of vector CONSTRUCTOR"
4199 debug_generic_stmt (rhs1
);
4203 else if (!useless_type_conversion_p (TREE_TYPE (rhs1_type
),
4206 error ("incorrect type of vector CONSTRUCTOR elements");
4207 debug_generic_stmt (rhs1
);
4210 else if (CONSTRUCTOR_NELTS (rhs1
)
4211 > TYPE_VECTOR_SUBPARTS (rhs1_type
))
4213 error ("incorrect number of vector CONSTRUCTOR elements");
4214 debug_generic_stmt (rhs1
);
4218 else if (!useless_type_conversion_p (elt_t
, TREE_TYPE (elt_v
)))
4220 error ("incorrect type of vector CONSTRUCTOR elements");
4221 debug_generic_stmt (rhs1
);
4224 if (elt_i
!= NULL_TREE
4225 && (TREE_CODE (elt_t
) == VECTOR_TYPE
4226 || TREE_CODE (elt_i
) != INTEGER_CST
4227 || compare_tree_int (elt_i
, i
) != 0))
4229 error ("vector CONSTRUCTOR with non-NULL element index");
4230 debug_generic_stmt (rhs1
);
4233 if (!is_gimple_val (elt_v
))
4235 error ("vector CONSTRUCTOR element is not a GIMPLE value");
4236 debug_generic_stmt (rhs1
);
4241 else if (CONSTRUCTOR_NELTS (rhs1
) != 0)
4243 error ("non-vector CONSTRUCTOR with elements");
4244 debug_generic_stmt (rhs1
);
4250 case WITH_SIZE_EXPR
:
4260 /* Verify the contents of a GIMPLE_ASSIGN STMT. Returns true when there
4261 is a problem, otherwise false. */
4264 verify_gimple_assign (gimple stmt
)
4266 switch (gimple_assign_rhs_class (stmt
))
4268 case GIMPLE_SINGLE_RHS
:
4269 return verify_gimple_assign_single (stmt
);
4271 case GIMPLE_UNARY_RHS
:
4272 return verify_gimple_assign_unary (stmt
);
4274 case GIMPLE_BINARY_RHS
:
4275 return verify_gimple_assign_binary (stmt
);
4277 case GIMPLE_TERNARY_RHS
:
4278 return verify_gimple_assign_ternary (stmt
);
4285 /* Verify the contents of a GIMPLE_RETURN STMT. Returns true when there
4286 is a problem, otherwise false. */
4289 verify_gimple_return (gimple stmt
)
4291 tree op
= gimple_return_retval (stmt
);
4292 tree restype
= TREE_TYPE (TREE_TYPE (cfun
->decl
));
4294 /* We cannot test for present return values as we do not fix up missing
4295 return values from the original source. */
4299 if (!is_gimple_val (op
)
4300 && TREE_CODE (op
) != RESULT_DECL
)
4302 error ("invalid operand in return statement");
4303 debug_generic_stmt (op
);
4307 if ((TREE_CODE (op
) == RESULT_DECL
4308 && DECL_BY_REFERENCE (op
))
4309 || (TREE_CODE (op
) == SSA_NAME
4310 && SSA_NAME_VAR (op
)
4311 && TREE_CODE (SSA_NAME_VAR (op
)) == RESULT_DECL
4312 && DECL_BY_REFERENCE (SSA_NAME_VAR (op
))))
4313 op
= TREE_TYPE (op
);
4315 if (!useless_type_conversion_p (restype
, TREE_TYPE (op
)))
4317 error ("invalid conversion in return statement");
4318 debug_generic_stmt (restype
);
4319 debug_generic_stmt (TREE_TYPE (op
));
4327 /* Verify the contents of a GIMPLE_GOTO STMT. Returns true when there
4328 is a problem, otherwise false. */
4331 verify_gimple_goto (gimple stmt
)
4333 tree dest
= gimple_goto_dest (stmt
);
4335 /* ??? We have two canonical forms of direct goto destinations, a
4336 bare LABEL_DECL and an ADDR_EXPR of a LABEL_DECL. */
4337 if (TREE_CODE (dest
) != LABEL_DECL
4338 && (!is_gimple_val (dest
)
4339 || !POINTER_TYPE_P (TREE_TYPE (dest
))))
4341 error ("goto destination is neither a label nor a pointer");
4348 /* Verify the contents of a GIMPLE_SWITCH STMT. Returns true when there
4349 is a problem, otherwise false. */
4352 verify_gimple_switch (gimple stmt
)
4355 tree elt
, prev_upper_bound
= NULL_TREE
;
4356 tree index_type
, elt_type
= NULL_TREE
;
4358 if (!is_gimple_val (gimple_switch_index (stmt
)))
4360 error ("invalid operand to switch statement");
4361 debug_generic_stmt (gimple_switch_index (stmt
));
4365 index_type
= TREE_TYPE (gimple_switch_index (stmt
));
4366 if (! INTEGRAL_TYPE_P (index_type
))
4368 error ("non-integral type switch statement");
4369 debug_generic_expr (index_type
);
4373 elt
= gimple_switch_label (stmt
, 0);
4374 if (CASE_LOW (elt
) != NULL_TREE
|| CASE_HIGH (elt
) != NULL_TREE
)
4376 error ("invalid default case label in switch statement");
4377 debug_generic_expr (elt
);
4381 n
= gimple_switch_num_labels (stmt
);
4382 for (i
= 1; i
< n
; i
++)
4384 elt
= gimple_switch_label (stmt
, i
);
4386 if (! CASE_LOW (elt
))
4388 error ("invalid case label in switch statement");
4389 debug_generic_expr (elt
);
4393 && ! tree_int_cst_lt (CASE_LOW (elt
), CASE_HIGH (elt
)))
4395 error ("invalid case range in switch statement");
4396 debug_generic_expr (elt
);
4402 if (TREE_TYPE (CASE_LOW (elt
)) != elt_type
4403 || (CASE_HIGH (elt
) && TREE_TYPE (CASE_HIGH (elt
)) != elt_type
))
4405 error ("type mismatch for case label in switch statement");
4406 debug_generic_expr (elt
);
4412 elt_type
= TREE_TYPE (CASE_LOW (elt
));
4413 if (TYPE_PRECISION (index_type
) < TYPE_PRECISION (elt_type
))
4415 error ("type precision mismatch in switch statement");
4420 if (prev_upper_bound
)
4422 if (! tree_int_cst_lt (prev_upper_bound
, CASE_LOW (elt
)))
4424 error ("case labels not sorted in switch statement");
4429 prev_upper_bound
= CASE_HIGH (elt
);
4430 if (! prev_upper_bound
)
4431 prev_upper_bound
= CASE_LOW (elt
);
4437 /* Verify a gimple debug statement STMT.
4438 Returns true if anything is wrong. */
4441 verify_gimple_debug (gimple stmt ATTRIBUTE_UNUSED
)
4443 /* There isn't much that could be wrong in a gimple debug stmt. A
4444 gimple debug bind stmt, for example, maps a tree, that's usually
4445 a VAR_DECL or a PARM_DECL, but that could also be some scalarized
4446 component or member of an aggregate type, to another tree, that
4447 can be an arbitrary expression. These stmts expand into debug
4448 insns, and are converted to debug notes by var-tracking.c. */
4452 /* Verify a gimple label statement STMT.
4453 Returns true if anything is wrong. */
4456 verify_gimple_label (gimple stmt
)
4458 tree decl
= gimple_label_label (stmt
);
4462 if (TREE_CODE (decl
) != LABEL_DECL
)
4464 if (!DECL_NONLOCAL (decl
) && !FORCED_LABEL (decl
)
4465 && DECL_CONTEXT (decl
) != current_function_decl
)
4467 error ("label's context is not the current function decl");
4471 uid
= LABEL_DECL_UID (decl
);
4474 || (*label_to_block_map_for_fn (cfun
))[uid
] != gimple_bb (stmt
)))
4476 error ("incorrect entry in label_to_block_map");
4480 uid
= EH_LANDING_PAD_NR (decl
);
4483 eh_landing_pad lp
= get_eh_landing_pad_from_number (uid
);
4484 if (decl
!= lp
->post_landing_pad
)
4486 error ("incorrect setting of landing pad number");
4494 /* Verify the GIMPLE statement STMT. Returns true if there is an
4495 error, otherwise false. */
4498 verify_gimple_stmt (gimple stmt
)
4500 switch (gimple_code (stmt
))
4503 return verify_gimple_assign (stmt
);
4506 return verify_gimple_label (stmt
);
4509 return verify_gimple_call (stmt
);
4512 if (TREE_CODE_CLASS (gimple_cond_code (stmt
)) != tcc_comparison
)
4514 error ("invalid comparison code in gimple cond");
4517 if (!(!gimple_cond_true_label (stmt
)
4518 || TREE_CODE (gimple_cond_true_label (stmt
)) == LABEL_DECL
)
4519 || !(!gimple_cond_false_label (stmt
)
4520 || TREE_CODE (gimple_cond_false_label (stmt
)) == LABEL_DECL
))
4522 error ("invalid labels in gimple cond");
4526 return verify_gimple_comparison (boolean_type_node
,
4527 gimple_cond_lhs (stmt
),
4528 gimple_cond_rhs (stmt
));
4531 return verify_gimple_goto (stmt
);
4534 return verify_gimple_switch (stmt
);
4537 return verify_gimple_return (stmt
);
4542 case GIMPLE_TRANSACTION
:
4543 return verify_gimple_transaction (stmt
);
4545 /* Tuples that do not have tree operands. */
4547 case GIMPLE_PREDICT
:
4549 case GIMPLE_EH_DISPATCH
:
4550 case GIMPLE_EH_MUST_NOT_THROW
:
4554 /* OpenMP directives are validated by the FE and never operated
4555 on by the optimizers. Furthermore, GIMPLE_OMP_FOR may contain
4556 non-gimple expressions when the main index variable has had
4557 its address taken. This does not affect the loop itself
4558 because the header of an GIMPLE_OMP_FOR is merely used to determine
4559 how to setup the parallel iteration. */
4563 return verify_gimple_debug (stmt
);
4570 /* Verify the contents of a GIMPLE_PHI. Returns true if there is a problem,
4571 and false otherwise. */
4574 verify_gimple_phi (gimple phi
)
4578 tree phi_result
= gimple_phi_result (phi
);
4583 error ("invalid PHI result");
4587 virtual_p
= virtual_operand_p (phi_result
);
4588 if (TREE_CODE (phi_result
) != SSA_NAME
4590 && SSA_NAME_VAR (phi_result
) != gimple_vop (cfun
)))
4592 error ("invalid PHI result");
4596 for (i
= 0; i
< gimple_phi_num_args (phi
); i
++)
4598 tree t
= gimple_phi_arg_def (phi
, i
);
4602 error ("missing PHI def");
4606 /* Addressable variables do have SSA_NAMEs but they
4607 are not considered gimple values. */
4608 else if ((TREE_CODE (t
) == SSA_NAME
4609 && virtual_p
!= virtual_operand_p (t
))
4611 && (TREE_CODE (t
) != SSA_NAME
4612 || SSA_NAME_VAR (t
) != gimple_vop (cfun
)))
4614 && !is_gimple_val (t
)))
4616 error ("invalid PHI argument");
4617 debug_generic_expr (t
);
4620 #ifdef ENABLE_TYPES_CHECKING
4621 if (!useless_type_conversion_p (TREE_TYPE (phi_result
), TREE_TYPE (t
)))
4623 error ("incompatible types in PHI argument %u", i
);
4624 debug_generic_stmt (TREE_TYPE (phi_result
));
4625 debug_generic_stmt (TREE_TYPE (t
));
4634 /* Verify the GIMPLE statements inside the sequence STMTS. */
4637 verify_gimple_in_seq_2 (gimple_seq stmts
)
4639 gimple_stmt_iterator ittr
;
4642 for (ittr
= gsi_start (stmts
); !gsi_end_p (ittr
); gsi_next (&ittr
))
4644 gimple stmt
= gsi_stmt (ittr
);
4646 switch (gimple_code (stmt
))
4649 err
|= verify_gimple_in_seq_2 (gimple_bind_body (stmt
));
4653 err
|= verify_gimple_in_seq_2 (gimple_try_eval (stmt
));
4654 err
|= verify_gimple_in_seq_2 (gimple_try_cleanup (stmt
));
4657 case GIMPLE_EH_FILTER
:
4658 err
|= verify_gimple_in_seq_2 (gimple_eh_filter_failure (stmt
));
4661 case GIMPLE_EH_ELSE
:
4662 err
|= verify_gimple_in_seq_2 (gimple_eh_else_n_body (stmt
));
4663 err
|= verify_gimple_in_seq_2 (gimple_eh_else_e_body (stmt
));
4667 err
|= verify_gimple_in_seq_2 (gimple_catch_handler (stmt
));
4670 case GIMPLE_TRANSACTION
:
4671 err
|= verify_gimple_transaction (stmt
);
4676 bool err2
= verify_gimple_stmt (stmt
);
4678 debug_gimple_stmt (stmt
);
4687 /* Verify the contents of a GIMPLE_TRANSACTION. Returns true if there
4688 is a problem, otherwise false. */
4691 verify_gimple_transaction (gimple stmt
)
4693 tree lab
= gimple_transaction_label (stmt
);
4694 if (lab
!= NULL
&& TREE_CODE (lab
) != LABEL_DECL
)
4696 return verify_gimple_in_seq_2 (gimple_transaction_body (stmt
));
4700 /* Verify the GIMPLE statements inside the statement list STMTS. */
4703 verify_gimple_in_seq (gimple_seq stmts
)
4705 timevar_push (TV_TREE_STMT_VERIFY
);
4706 if (verify_gimple_in_seq_2 (stmts
))
4707 internal_error ("verify_gimple failed");
4708 timevar_pop (TV_TREE_STMT_VERIFY
);
4711 /* Return true when the T can be shared. */
4714 tree_node_can_be_shared (tree t
)
4716 if (IS_TYPE_OR_DECL_P (t
)
4717 || is_gimple_min_invariant (t
)
4718 || TREE_CODE (t
) == SSA_NAME
4719 || t
== error_mark_node
4720 || TREE_CODE (t
) == IDENTIFIER_NODE
)
4723 if (TREE_CODE (t
) == CASE_LABEL_EXPR
)
4732 /* Called via walk_tree. Verify tree sharing. */
4735 verify_node_sharing_1 (tree
*tp
, int *walk_subtrees
, void *data
)
4737 hash_set
<void *> *visited
= (hash_set
<void *> *) data
;
4739 if (tree_node_can_be_shared (*tp
))
4741 *walk_subtrees
= false;
4745 if (visited
->add (*tp
))
4751 /* Called via walk_gimple_stmt. Verify tree sharing. */
4754 verify_node_sharing (tree
*tp
, int *walk_subtrees
, void *data
)
4756 struct walk_stmt_info
*wi
= (struct walk_stmt_info
*) data
;
4757 return verify_node_sharing_1 (tp
, walk_subtrees
, wi
->info
);
4760 static bool eh_error_found
;
4762 verify_eh_throw_stmt_node (const gimple
&stmt
, const int &,
4763 hash_set
<gimple
> *visited
)
4765 if (!visited
->contains (stmt
))
4767 error ("dead STMT in EH table");
4768 debug_gimple_stmt (stmt
);
4769 eh_error_found
= true;
4774 /* Verify if the location LOCs block is in BLOCKS. */
4777 verify_location (hash_set
<tree
> *blocks
, location_t loc
)
4779 tree block
= LOCATION_BLOCK (loc
);
4780 if (block
!= NULL_TREE
4781 && !blocks
->contains (block
))
4783 error ("location references block not in block tree");
4786 if (block
!= NULL_TREE
)
4787 return verify_location (blocks
, BLOCK_SOURCE_LOCATION (block
));
4791 /* Called via walk_tree. Verify that expressions have no blocks. */
4794 verify_expr_no_block (tree
*tp
, int *walk_subtrees
, void *)
4798 *walk_subtrees
= false;
4802 location_t loc
= EXPR_LOCATION (*tp
);
4803 if (LOCATION_BLOCK (loc
) != NULL
)
4809 /* Called via walk_tree. Verify locations of expressions. */
4812 verify_expr_location_1 (tree
*tp
, int *walk_subtrees
, void *data
)
4814 hash_set
<tree
> *blocks
= (hash_set
<tree
> *) data
;
4816 if (TREE_CODE (*tp
) == VAR_DECL
4817 && DECL_HAS_DEBUG_EXPR_P (*tp
))
4819 tree t
= DECL_DEBUG_EXPR (*tp
);
4820 tree addr
= walk_tree (&t
, verify_expr_no_block
, NULL
, NULL
);
4824 if ((TREE_CODE (*tp
) == VAR_DECL
4825 || TREE_CODE (*tp
) == PARM_DECL
4826 || TREE_CODE (*tp
) == RESULT_DECL
)
4827 && DECL_HAS_VALUE_EXPR_P (*tp
))
4829 tree t
= DECL_VALUE_EXPR (*tp
);
4830 tree addr
= walk_tree (&t
, verify_expr_no_block
, NULL
, NULL
);
4837 *walk_subtrees
= false;
4841 location_t loc
= EXPR_LOCATION (*tp
);
4842 if (verify_location (blocks
, loc
))
4848 /* Called via walk_gimple_op. Verify locations of expressions. */
4851 verify_expr_location (tree
*tp
, int *walk_subtrees
, void *data
)
4853 struct walk_stmt_info
*wi
= (struct walk_stmt_info
*) data
;
4854 return verify_expr_location_1 (tp
, walk_subtrees
, wi
->info
);
4857 /* Insert all subblocks of BLOCK into BLOCKS and recurse. */
4860 collect_subblocks (hash_set
<tree
> *blocks
, tree block
)
4863 for (t
= BLOCK_SUBBLOCKS (block
); t
; t
= BLOCK_CHAIN (t
))
4866 collect_subblocks (blocks
, t
);
4870 /* Verify the GIMPLE statements in the CFG of FN. */
4873 verify_gimple_in_cfg (struct function
*fn
, bool verify_nothrow
)
4878 timevar_push (TV_TREE_STMT_VERIFY
);
4879 hash_set
<void *> visited
;
4880 hash_set
<gimple
> visited_stmts
;
4882 /* Collect all BLOCKs referenced by the BLOCK tree of FN. */
4883 hash_set
<tree
> blocks
;
4884 if (DECL_INITIAL (fn
->decl
))
4886 blocks
.add (DECL_INITIAL (fn
->decl
));
4887 collect_subblocks (&blocks
, DECL_INITIAL (fn
->decl
));
4890 FOR_EACH_BB_FN (bb
, fn
)
4892 gimple_stmt_iterator gsi
;
4894 for (gsi
= gsi_start_phis (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
4896 gimple phi
= gsi_stmt (gsi
);
4900 visited_stmts
.add (phi
);
4902 if (gimple_bb (phi
) != bb
)
4904 error ("gimple_bb (phi) is set to a wrong basic block");
4908 err2
|= verify_gimple_phi (phi
);
4910 /* Only PHI arguments have locations. */
4911 if (gimple_location (phi
) != UNKNOWN_LOCATION
)
4913 error ("PHI node with location");
4917 for (i
= 0; i
< gimple_phi_num_args (phi
); i
++)
4919 tree arg
= gimple_phi_arg_def (phi
, i
);
4920 tree addr
= walk_tree (&arg
, verify_node_sharing_1
,
4924 error ("incorrect sharing of tree nodes");
4925 debug_generic_expr (addr
);
4928 location_t loc
= gimple_phi_arg_location (phi
, i
);
4929 if (virtual_operand_p (gimple_phi_result (phi
))
4930 && loc
!= UNKNOWN_LOCATION
)
4932 error ("virtual PHI with argument locations");
4935 addr
= walk_tree (&arg
, verify_expr_location_1
, &blocks
, NULL
);
4938 debug_generic_expr (addr
);
4941 err2
|= verify_location (&blocks
, loc
);
4945 debug_gimple_stmt (phi
);
4949 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
4951 gimple stmt
= gsi_stmt (gsi
);
4953 struct walk_stmt_info wi
;
4957 visited_stmts
.add (stmt
);
4959 if (gimple_bb (stmt
) != bb
)
4961 error ("gimple_bb (stmt) is set to a wrong basic block");
4965 err2
|= verify_gimple_stmt (stmt
);
4966 err2
|= verify_location (&blocks
, gimple_location (stmt
));
4968 memset (&wi
, 0, sizeof (wi
));
4969 wi
.info
= (void *) &visited
;
4970 addr
= walk_gimple_op (stmt
, verify_node_sharing
, &wi
);
4973 error ("incorrect sharing of tree nodes");
4974 debug_generic_expr (addr
);
4978 memset (&wi
, 0, sizeof (wi
));
4979 wi
.info
= (void *) &blocks
;
4980 addr
= walk_gimple_op (stmt
, verify_expr_location
, &wi
);
4983 debug_generic_expr (addr
);
4987 /* ??? Instead of not checking these stmts at all the walker
4988 should know its context via wi. */
4989 if (!is_gimple_debug (stmt
)
4990 && !is_gimple_omp (stmt
))
4992 memset (&wi
, 0, sizeof (wi
));
4993 addr
= walk_gimple_op (stmt
, verify_expr
, &wi
);
4996 debug_generic_expr (addr
);
4997 inform (gimple_location (stmt
), "in statement");
5002 /* If the statement is marked as part of an EH region, then it is
5003 expected that the statement could throw. Verify that when we
5004 have optimizations that simplify statements such that we prove
5005 that they cannot throw, that we update other data structures
5007 lp_nr
= lookup_stmt_eh_lp (stmt
);
5010 if (!stmt_could_throw_p (stmt
))
5014 error ("statement marked for throw, but doesn%'t");
5018 else if (!gsi_one_before_end_p (gsi
))
5020 error ("statement marked for throw in middle of block");
5026 debug_gimple_stmt (stmt
);
5031 eh_error_found
= false;
5032 hash_map
<gimple
, int> *eh_table
= get_eh_throw_stmt_table (cfun
);
5034 eh_table
->traverse
<hash_set
<gimple
> *, verify_eh_throw_stmt_node
>
5037 if (err
|| eh_error_found
)
5038 internal_error ("verify_gimple failed");
5040 verify_histograms ();
5041 timevar_pop (TV_TREE_STMT_VERIFY
);
5045 /* Verifies that the flow information is OK. */
5048 gimple_verify_flow_info (void)
5052 gimple_stmt_iterator gsi
;
5057 if (ENTRY_BLOCK_PTR_FOR_FN (cfun
)->il
.gimple
.seq
5058 || ENTRY_BLOCK_PTR_FOR_FN (cfun
)->il
.gimple
.phi_nodes
)
5060 error ("ENTRY_BLOCK has IL associated with it");
5064 if (EXIT_BLOCK_PTR_FOR_FN (cfun
)->il
.gimple
.seq
5065 || EXIT_BLOCK_PTR_FOR_FN (cfun
)->il
.gimple
.phi_nodes
)
5067 error ("EXIT_BLOCK has IL associated with it");
5071 FOR_EACH_EDGE (e
, ei
, EXIT_BLOCK_PTR_FOR_FN (cfun
)->preds
)
5072 if (e
->flags
& EDGE_FALLTHRU
)
5074 error ("fallthru to exit from bb %d", e
->src
->index
);
5078 FOR_EACH_BB_FN (bb
, cfun
)
5080 bool found_ctrl_stmt
= false;
5084 /* Skip labels on the start of basic block. */
5085 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
5088 gimple prev_stmt
= stmt
;
5090 stmt
= gsi_stmt (gsi
);
5092 if (gimple_code (stmt
) != GIMPLE_LABEL
)
5095 label
= gimple_label_label (stmt
);
5096 if (prev_stmt
&& DECL_NONLOCAL (label
))
5098 error ("nonlocal label ");
5099 print_generic_expr (stderr
, label
, 0);
5100 fprintf (stderr
, " is not first in a sequence of labels in bb %d",
5105 if (prev_stmt
&& EH_LANDING_PAD_NR (label
) != 0)
5107 error ("EH landing pad label ");
5108 print_generic_expr (stderr
, label
, 0);
5109 fprintf (stderr
, " is not first in a sequence of labels in bb %d",
5114 if (label_to_block (label
) != bb
)
5117 print_generic_expr (stderr
, label
, 0);
5118 fprintf (stderr
, " to block does not match in bb %d",
5123 if (decl_function_context (label
) != current_function_decl
)
5126 print_generic_expr (stderr
, label
, 0);
5127 fprintf (stderr
, " has incorrect context in bb %d",
5133 /* Verify that body of basic block BB is free of control flow. */
5134 for (; !gsi_end_p (gsi
); gsi_next (&gsi
))
5136 gimple stmt
= gsi_stmt (gsi
);
5138 if (found_ctrl_stmt
)
5140 error ("control flow in the middle of basic block %d",
5145 if (stmt_ends_bb_p (stmt
))
5146 found_ctrl_stmt
= true;
5148 if (gimple_code (stmt
) == GIMPLE_LABEL
)
5151 print_generic_expr (stderr
, gimple_label_label (stmt
), 0);
5152 fprintf (stderr
, " in the middle of basic block %d", bb
->index
);
5157 gsi
= gsi_last_bb (bb
);
5158 if (gsi_end_p (gsi
))
5161 stmt
= gsi_stmt (gsi
);
5163 if (gimple_code (stmt
) == GIMPLE_LABEL
)
5166 err
|= verify_eh_edges (stmt
);
5168 if (is_ctrl_stmt (stmt
))
5170 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
5171 if (e
->flags
& EDGE_FALLTHRU
)
5173 error ("fallthru edge after a control statement in bb %d",
5179 if (gimple_code (stmt
) != GIMPLE_COND
)
5181 /* Verify that there are no edges with EDGE_TRUE/FALSE_FLAG set
5182 after anything else but if statement. */
5183 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
5184 if (e
->flags
& (EDGE_TRUE_VALUE
| EDGE_FALSE_VALUE
))
5186 error ("true/false edge after a non-GIMPLE_COND in bb %d",
5192 switch (gimple_code (stmt
))
5199 extract_true_false_edges_from_block (bb
, &true_edge
, &false_edge
);
5203 || !(true_edge
->flags
& EDGE_TRUE_VALUE
)
5204 || !(false_edge
->flags
& EDGE_FALSE_VALUE
)
5205 || (true_edge
->flags
& (EDGE_FALLTHRU
| EDGE_ABNORMAL
))
5206 || (false_edge
->flags
& (EDGE_FALLTHRU
| EDGE_ABNORMAL
))
5207 || EDGE_COUNT (bb
->succs
) >= 3)
5209 error ("wrong outgoing edge flags at end of bb %d",
5217 if (simple_goto_p (stmt
))
5219 error ("explicit goto at end of bb %d", bb
->index
);
5224 /* FIXME. We should double check that the labels in the
5225 destination blocks have their address taken. */
5226 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
5227 if ((e
->flags
& (EDGE_FALLTHRU
| EDGE_TRUE_VALUE
5228 | EDGE_FALSE_VALUE
))
5229 || !(e
->flags
& EDGE_ABNORMAL
))
5231 error ("wrong outgoing edge flags at end of bb %d",
5239 if (!gimple_call_builtin_p (stmt
, BUILT_IN_RETURN
))
5241 /* ... fallthru ... */
5243 if (!single_succ_p (bb
)
5244 || (single_succ_edge (bb
)->flags
5245 & (EDGE_FALLTHRU
| EDGE_ABNORMAL
5246 | EDGE_TRUE_VALUE
| EDGE_FALSE_VALUE
)))
5248 error ("wrong outgoing edge flags at end of bb %d", bb
->index
);
5251 if (single_succ (bb
) != EXIT_BLOCK_PTR_FOR_FN (cfun
))
5253 error ("return edge does not point to exit in bb %d",
5265 n
= gimple_switch_num_labels (stmt
);
5267 /* Mark all the destination basic blocks. */
5268 for (i
= 0; i
< n
; ++i
)
5270 tree lab
= CASE_LABEL (gimple_switch_label (stmt
, i
));
5271 basic_block label_bb
= label_to_block (lab
);
5272 gcc_assert (!label_bb
->aux
|| label_bb
->aux
== (void *)1);
5273 label_bb
->aux
= (void *)1;
5276 /* Verify that the case labels are sorted. */
5277 prev
= gimple_switch_label (stmt
, 0);
5278 for (i
= 1; i
< n
; ++i
)
5280 tree c
= gimple_switch_label (stmt
, i
);
5283 error ("found default case not at the start of "
5289 && !tree_int_cst_lt (CASE_LOW (prev
), CASE_LOW (c
)))
5291 error ("case labels not sorted: ");
5292 print_generic_expr (stderr
, prev
, 0);
5293 fprintf (stderr
," is greater than ");
5294 print_generic_expr (stderr
, c
, 0);
5295 fprintf (stderr
," but comes before it.\n");
5300 /* VRP will remove the default case if it can prove it will
5301 never be executed. So do not verify there always exists
5302 a default case here. */
5304 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
5308 error ("extra outgoing edge %d->%d",
5309 bb
->index
, e
->dest
->index
);
5313 e
->dest
->aux
= (void *)2;
5314 if ((e
->flags
& (EDGE_FALLTHRU
| EDGE_ABNORMAL
5315 | EDGE_TRUE_VALUE
| EDGE_FALSE_VALUE
)))
5317 error ("wrong outgoing edge flags at end of bb %d",
5323 /* Check that we have all of them. */
5324 for (i
= 0; i
< n
; ++i
)
5326 tree lab
= CASE_LABEL (gimple_switch_label (stmt
, i
));
5327 basic_block label_bb
= label_to_block (lab
);
5329 if (label_bb
->aux
!= (void *)2)
5331 error ("missing edge %i->%i", bb
->index
, label_bb
->index
);
5336 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
5337 e
->dest
->aux
= (void *)0;
5341 case GIMPLE_EH_DISPATCH
:
5342 err
|= verify_eh_dispatch_edge (stmt
);
5350 if (dom_info_state (CDI_DOMINATORS
) >= DOM_NO_FAST_QUERY
)
5351 verify_dominators (CDI_DOMINATORS
);
5357 /* Updates phi nodes after creating a forwarder block joined
5358 by edge FALLTHRU. */
5361 gimple_make_forwarder_block (edge fallthru
)
5365 basic_block dummy
, bb
;
5367 gimple_stmt_iterator gsi
;
5369 dummy
= fallthru
->src
;
5370 bb
= fallthru
->dest
;
5372 if (single_pred_p (bb
))
5375 /* If we redirected a branch we must create new PHI nodes at the
5377 for (gsi
= gsi_start_phis (dummy
); !gsi_end_p (gsi
); gsi_next (&gsi
))
5379 gimple phi
, new_phi
;
5381 phi
= gsi_stmt (gsi
);
5382 var
= gimple_phi_result (phi
);
5383 new_phi
= create_phi_node (var
, bb
);
5384 gimple_phi_set_result (phi
, copy_ssa_name (var
, phi
));
5385 add_phi_arg (new_phi
, gimple_phi_result (phi
), fallthru
,
5389 /* Add the arguments we have stored on edges. */
5390 FOR_EACH_EDGE (e
, ei
, bb
->preds
)
5395 flush_pending_stmts (e
);
5400 /* Return a non-special label in the head of basic block BLOCK.
5401 Create one if it doesn't exist. */
5404 gimple_block_label (basic_block bb
)
5406 gimple_stmt_iterator i
, s
= gsi_start_bb (bb
);
5411 for (i
= s
; !gsi_end_p (i
); first
= false, gsi_next (&i
))
5413 stmt
= gsi_stmt (i
);
5414 if (gimple_code (stmt
) != GIMPLE_LABEL
)
5416 label
= gimple_label_label (stmt
);
5417 if (!DECL_NONLOCAL (label
))
5420 gsi_move_before (&i
, &s
);
5425 label
= create_artificial_label (UNKNOWN_LOCATION
);
5426 stmt
= gimple_build_label (label
);
5427 gsi_insert_before (&s
, stmt
, GSI_NEW_STMT
);
5432 /* Attempt to perform edge redirection by replacing a possibly complex
5433 jump instruction by a goto or by removing the jump completely.
5434 This can apply only if all edges now point to the same block. The
5435 parameters and return values are equivalent to
5436 redirect_edge_and_branch. */
5439 gimple_try_redirect_by_replacing_jump (edge e
, basic_block target
)
5441 basic_block src
= e
->src
;
5442 gimple_stmt_iterator i
;
5445 /* We can replace or remove a complex jump only when we have exactly
5447 if (EDGE_COUNT (src
->succs
) != 2
5448 /* Verify that all targets will be TARGET. Specifically, the
5449 edge that is not E must also go to TARGET. */
5450 || EDGE_SUCC (src
, EDGE_SUCC (src
, 0) == e
)->dest
!= target
)
5453 i
= gsi_last_bb (src
);
5457 stmt
= gsi_stmt (i
);
5459 if (gimple_code (stmt
) == GIMPLE_COND
|| gimple_code (stmt
) == GIMPLE_SWITCH
)
5461 gsi_remove (&i
, true);
5462 e
= ssa_redirect_edge (e
, target
);
5463 e
->flags
= EDGE_FALLTHRU
;
5471 /* Redirect E to DEST. Return NULL on failure. Otherwise, return the
5472 edge representing the redirected branch. */
5475 gimple_redirect_edge_and_branch (edge e
, basic_block dest
)
5477 basic_block bb
= e
->src
;
5478 gimple_stmt_iterator gsi
;
5482 if (e
->flags
& EDGE_ABNORMAL
)
5485 if (e
->dest
== dest
)
5488 if (e
->flags
& EDGE_EH
)
5489 return redirect_eh_edge (e
, dest
);
5491 if (e
->src
!= ENTRY_BLOCK_PTR_FOR_FN (cfun
))
5493 ret
= gimple_try_redirect_by_replacing_jump (e
, dest
);
5498 gsi
= gsi_last_bb (bb
);
5499 stmt
= gsi_end_p (gsi
) ? NULL
: gsi_stmt (gsi
);
5501 switch (stmt
? gimple_code (stmt
) : GIMPLE_ERROR_MARK
)
5504 /* For COND_EXPR, we only need to redirect the edge. */
5508 /* No non-abnormal edges should lead from a non-simple goto, and
5509 simple ones should be represented implicitly. */
5514 tree label
= gimple_block_label (dest
);
5515 tree cases
= get_cases_for_edge (e
, stmt
);
5517 /* If we have a list of cases associated with E, then use it
5518 as it's a lot faster than walking the entire case vector. */
5521 edge e2
= find_edge (e
->src
, dest
);
5528 CASE_LABEL (cases
) = label
;
5529 cases
= CASE_CHAIN (cases
);
5532 /* If there was already an edge in the CFG, then we need
5533 to move all the cases associated with E to E2. */
5536 tree cases2
= get_cases_for_edge (e2
, stmt
);
5538 CASE_CHAIN (last
) = CASE_CHAIN (cases2
);
5539 CASE_CHAIN (cases2
) = first
;
5541 bitmap_set_bit (touched_switch_bbs
, gimple_bb (stmt
)->index
);
5545 size_t i
, n
= gimple_switch_num_labels (stmt
);
5547 for (i
= 0; i
< n
; i
++)
5549 tree elt
= gimple_switch_label (stmt
, i
);
5550 if (label_to_block (CASE_LABEL (elt
)) == e
->dest
)
5551 CASE_LABEL (elt
) = label
;
5559 int i
, n
= gimple_asm_nlabels (stmt
);
5562 for (i
= 0; i
< n
; ++i
)
5564 tree cons
= gimple_asm_label_op (stmt
, i
);
5565 if (label_to_block (TREE_VALUE (cons
)) == e
->dest
)
5568 label
= gimple_block_label (dest
);
5569 TREE_VALUE (cons
) = label
;
5573 /* If we didn't find any label matching the former edge in the
5574 asm labels, we must be redirecting the fallthrough
5576 gcc_assert (label
|| (e
->flags
& EDGE_FALLTHRU
));
5581 gsi_remove (&gsi
, true);
5582 e
->flags
|= EDGE_FALLTHRU
;
5585 case GIMPLE_OMP_RETURN
:
5586 case GIMPLE_OMP_CONTINUE
:
5587 case GIMPLE_OMP_SECTIONS_SWITCH
:
5588 case GIMPLE_OMP_FOR
:
5589 /* The edges from OMP constructs can be simply redirected. */
5592 case GIMPLE_EH_DISPATCH
:
5593 if (!(e
->flags
& EDGE_FALLTHRU
))
5594 redirect_eh_dispatch_edge (stmt
, e
, dest
);
5597 case GIMPLE_TRANSACTION
:
5598 /* The ABORT edge has a stored label associated with it, otherwise
5599 the edges are simply redirectable. */
5601 gimple_transaction_set_label (stmt
, gimple_block_label (dest
));
5605 /* Otherwise it must be a fallthru edge, and we don't need to
5606 do anything besides redirecting it. */
5607 gcc_assert (e
->flags
& EDGE_FALLTHRU
);
5611 /* Update/insert PHI nodes as necessary. */
5613 /* Now update the edges in the CFG. */
5614 e
= ssa_redirect_edge (e
, dest
);
5619 /* Returns true if it is possible to remove edge E by redirecting
5620 it to the destination of the other edge from E->src. */
5623 gimple_can_remove_branch_p (const_edge e
)
5625 if (e
->flags
& (EDGE_ABNORMAL
| EDGE_EH
))
5631 /* Simple wrapper, as we can always redirect fallthru edges. */
5634 gimple_redirect_edge_and_branch_force (edge e
, basic_block dest
)
5636 e
= gimple_redirect_edge_and_branch (e
, dest
);
5643 /* Splits basic block BB after statement STMT (but at least after the
5644 labels). If STMT is NULL, BB is split just after the labels. */
5647 gimple_split_block (basic_block bb
, void *stmt
)
5649 gimple_stmt_iterator gsi
;
5650 gimple_stmt_iterator gsi_tgt
;
5657 new_bb
= create_empty_bb (bb
);
5659 /* Redirect the outgoing edges. */
5660 new_bb
->succs
= bb
->succs
;
5662 FOR_EACH_EDGE (e
, ei
, new_bb
->succs
)
5665 if (stmt
&& gimple_code ((gimple
) stmt
) == GIMPLE_LABEL
)
5668 /* Move everything from GSI to the new basic block. */
5669 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
5671 act
= gsi_stmt (gsi
);
5672 if (gimple_code (act
) == GIMPLE_LABEL
)
5685 if (gsi_end_p (gsi
))
5688 /* Split the statement list - avoid re-creating new containers as this
5689 brings ugly quadratic memory consumption in the inliner.
5690 (We are still quadratic since we need to update stmt BB pointers,
5692 gsi_split_seq_before (&gsi
, &list
);
5693 set_bb_seq (new_bb
, list
);
5694 for (gsi_tgt
= gsi_start (list
);
5695 !gsi_end_p (gsi_tgt
); gsi_next (&gsi_tgt
))
5696 gimple_set_bb (gsi_stmt (gsi_tgt
), new_bb
);
5702 /* Moves basic block BB after block AFTER. */
5705 gimple_move_block_after (basic_block bb
, basic_block after
)
5707 if (bb
->prev_bb
== after
)
5711 link_block (bb
, after
);
5717 /* Return TRUE if block BB has no executable statements, otherwise return
5721 gimple_empty_block_p (basic_block bb
)
5723 /* BB must have no executable statements. */
5724 gimple_stmt_iterator gsi
= gsi_after_labels (bb
);
5727 if (gsi_end_p (gsi
))
5729 if (is_gimple_debug (gsi_stmt (gsi
)))
5730 gsi_next_nondebug (&gsi
);
5731 return gsi_end_p (gsi
);
5735 /* Split a basic block if it ends with a conditional branch and if the
5736 other part of the block is not empty. */
5739 gimple_split_block_before_cond_jump (basic_block bb
)
5741 gimple last
, split_point
;
5742 gimple_stmt_iterator gsi
= gsi_last_nondebug_bb (bb
);
5743 if (gsi_end_p (gsi
))
5745 last
= gsi_stmt (gsi
);
5746 if (gimple_code (last
) != GIMPLE_COND
5747 && gimple_code (last
) != GIMPLE_SWITCH
)
5749 gsi_prev_nondebug (&gsi
);
5750 split_point
= gsi_stmt (gsi
);
5751 return split_block (bb
, split_point
)->dest
;
5755 /* Return true if basic_block can be duplicated. */
5758 gimple_can_duplicate_bb_p (const_basic_block bb ATTRIBUTE_UNUSED
)
5763 /* Create a duplicate of the basic block BB. NOTE: This does not
5764 preserve SSA form. */
5767 gimple_duplicate_bb (basic_block bb
)
5770 gimple_stmt_iterator gsi
, gsi_tgt
;
5771 gimple_seq phis
= phi_nodes (bb
);
5772 gimple phi
, stmt
, copy
;
5774 new_bb
= create_empty_bb (EXIT_BLOCK_PTR_FOR_FN (cfun
)->prev_bb
);
5776 /* Copy the PHI nodes. We ignore PHI node arguments here because
5777 the incoming edges have not been setup yet. */
5778 for (gsi
= gsi_start (phis
); !gsi_end_p (gsi
); gsi_next (&gsi
))
5780 phi
= gsi_stmt (gsi
);
5781 copy
= create_phi_node (NULL_TREE
, new_bb
);
5782 create_new_def_for (gimple_phi_result (phi
), copy
,
5783 gimple_phi_result_ptr (copy
));
5784 gimple_set_uid (copy
, gimple_uid (phi
));
5787 gsi_tgt
= gsi_start_bb (new_bb
);
5788 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
5790 def_operand_p def_p
;
5791 ssa_op_iter op_iter
;
5794 stmt
= gsi_stmt (gsi
);
5795 if (gimple_code (stmt
) == GIMPLE_LABEL
)
5798 /* Don't duplicate label debug stmts. */
5799 if (gimple_debug_bind_p (stmt
)
5800 && TREE_CODE (gimple_debug_bind_get_var (stmt
))
5804 /* Create a new copy of STMT and duplicate STMT's virtual
5806 copy
= gimple_copy (stmt
);
5807 gsi_insert_after (&gsi_tgt
, copy
, GSI_NEW_STMT
);
5809 maybe_duplicate_eh_stmt (copy
, stmt
);
5810 gimple_duplicate_stmt_histograms (cfun
, copy
, cfun
, stmt
);
5812 /* When copying around a stmt writing into a local non-user
5813 aggregate, make sure it won't share stack slot with other
5815 lhs
= gimple_get_lhs (stmt
);
5816 if (lhs
&& TREE_CODE (lhs
) != SSA_NAME
)
5818 tree base
= get_base_address (lhs
);
5820 && (TREE_CODE (base
) == VAR_DECL
5821 || TREE_CODE (base
) == RESULT_DECL
)
5822 && DECL_IGNORED_P (base
)
5823 && !TREE_STATIC (base
)
5824 && !DECL_EXTERNAL (base
)
5825 && (TREE_CODE (base
) != VAR_DECL
5826 || !DECL_HAS_VALUE_EXPR_P (base
)))
5827 DECL_NONSHAREABLE (base
) = 1;
5830 /* Create new names for all the definitions created by COPY and
5831 add replacement mappings for each new name. */
5832 FOR_EACH_SSA_DEF_OPERAND (def_p
, copy
, op_iter
, SSA_OP_ALL_DEFS
)
5833 create_new_def_for (DEF_FROM_PTR (def_p
), copy
, def_p
);
5839 /* Adds phi node arguments for edge E_COPY after basic block duplication. */
5842 add_phi_args_after_copy_edge (edge e_copy
)
5844 basic_block bb
, bb_copy
= e_copy
->src
, dest
;
5847 gimple phi
, phi_copy
;
5849 gimple_stmt_iterator psi
, psi_copy
;
5851 if (gimple_seq_empty_p (phi_nodes (e_copy
->dest
)))
5854 bb
= bb_copy
->flags
& BB_DUPLICATED
? get_bb_original (bb_copy
) : bb_copy
;
5856 if (e_copy
->dest
->flags
& BB_DUPLICATED
)
5857 dest
= get_bb_original (e_copy
->dest
);
5859 dest
= e_copy
->dest
;
5861 e
= find_edge (bb
, dest
);
5864 /* During loop unrolling the target of the latch edge is copied.
5865 In this case we are not looking for edge to dest, but to
5866 duplicated block whose original was dest. */
5867 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
5869 if ((e
->dest
->flags
& BB_DUPLICATED
)
5870 && get_bb_original (e
->dest
) == dest
)
5874 gcc_assert (e
!= NULL
);
5877 for (psi
= gsi_start_phis (e
->dest
),
5878 psi_copy
= gsi_start_phis (e_copy
->dest
);
5880 gsi_next (&psi
), gsi_next (&psi_copy
))
5882 phi
= gsi_stmt (psi
);
5883 phi_copy
= gsi_stmt (psi_copy
);
5884 def
= PHI_ARG_DEF_FROM_EDGE (phi
, e
);
5885 add_phi_arg (phi_copy
, def
, e_copy
,
5886 gimple_phi_arg_location_from_edge (phi
, e
));
5891 /* Basic block BB_COPY was created by code duplication. Add phi node
5892 arguments for edges going out of BB_COPY. The blocks that were
5893 duplicated have BB_DUPLICATED set. */
5896 add_phi_args_after_copy_bb (basic_block bb_copy
)
5901 FOR_EACH_EDGE (e_copy
, ei
, bb_copy
->succs
)
5903 add_phi_args_after_copy_edge (e_copy
);
5907 /* Blocks in REGION_COPY array of length N_REGION were created by
5908 duplication of basic blocks. Add phi node arguments for edges
5909 going from these blocks. If E_COPY is not NULL, also add
5910 phi node arguments for its destination.*/
5913 add_phi_args_after_copy (basic_block
*region_copy
, unsigned n_region
,
5918 for (i
= 0; i
< n_region
; i
++)
5919 region_copy
[i
]->flags
|= BB_DUPLICATED
;
5921 for (i
= 0; i
< n_region
; i
++)
5922 add_phi_args_after_copy_bb (region_copy
[i
]);
5924 add_phi_args_after_copy_edge (e_copy
);
5926 for (i
= 0; i
< n_region
; i
++)
5927 region_copy
[i
]->flags
&= ~BB_DUPLICATED
;
5930 /* Duplicates a REGION (set of N_REGION basic blocks) with just a single
5931 important exit edge EXIT. By important we mean that no SSA name defined
5932 inside region is live over the other exit edges of the region. All entry
5933 edges to the region must go to ENTRY->dest. The edge ENTRY is redirected
5934 to the duplicate of the region. Dominance and loop information is
5935 updated if UPDATE_DOMINANCE is true, but not the SSA web. If
5936 UPDATE_DOMINANCE is false then we assume that the caller will update the
5937 dominance information after calling this function. The new basic
5938 blocks are stored to REGION_COPY in the same order as they had in REGION,
5939 provided that REGION_COPY is not NULL.
5940 The function returns false if it is unable to copy the region,
5944 gimple_duplicate_sese_region (edge entry
, edge exit
,
5945 basic_block
*region
, unsigned n_region
,
5946 basic_block
*region_copy
,
5947 bool update_dominance
)
5950 bool free_region_copy
= false, copying_header
= false;
5951 struct loop
*loop
= entry
->dest
->loop_father
;
5953 vec
<basic_block
> doms
;
5955 int total_freq
= 0, entry_freq
= 0;
5956 gcov_type total_count
= 0, entry_count
= 0;
5958 if (!can_copy_bbs_p (region
, n_region
))
5961 /* Some sanity checking. Note that we do not check for all possible
5962 missuses of the functions. I.e. if you ask to copy something weird,
5963 it will work, but the state of structures probably will not be
5965 for (i
= 0; i
< n_region
; i
++)
5967 /* We do not handle subloops, i.e. all the blocks must belong to the
5969 if (region
[i
]->loop_father
!= loop
)
5972 if (region
[i
] != entry
->dest
5973 && region
[i
] == loop
->header
)
5977 /* In case the function is used for loop header copying (which is the primary
5978 use), ensure that EXIT and its copy will be new latch and entry edges. */
5979 if (loop
->header
== entry
->dest
)
5981 copying_header
= true;
5983 if (!dominated_by_p (CDI_DOMINATORS
, loop
->latch
, exit
->src
))
5986 for (i
= 0; i
< n_region
; i
++)
5987 if (region
[i
] != exit
->src
5988 && dominated_by_p (CDI_DOMINATORS
, region
[i
], exit
->src
))
5992 initialize_original_copy_tables ();
5995 set_loop_copy (loop
, loop_outer (loop
));
5997 set_loop_copy (loop
, loop
);
6001 region_copy
= XNEWVEC (basic_block
, n_region
);
6002 free_region_copy
= true;
6005 /* Record blocks outside the region that are dominated by something
6007 if (update_dominance
)
6010 doms
= get_dominated_by_region (CDI_DOMINATORS
, region
, n_region
);
6013 if (entry
->dest
->count
)
6015 total_count
= entry
->dest
->count
;
6016 entry_count
= entry
->count
;
6017 /* Fix up corner cases, to avoid division by zero or creation of negative
6019 if (entry_count
> total_count
)
6020 entry_count
= total_count
;
6024 total_freq
= entry
->dest
->frequency
;
6025 entry_freq
= EDGE_FREQUENCY (entry
);
6026 /* Fix up corner cases, to avoid division by zero or creation of negative
6028 if (total_freq
== 0)
6030 else if (entry_freq
> total_freq
)
6031 entry_freq
= total_freq
;
6034 copy_bbs (region
, n_region
, region_copy
, &exit
, 1, &exit_copy
, loop
,
6035 split_edge_bb_loc (entry
), update_dominance
);
6038 scale_bbs_frequencies_gcov_type (region
, n_region
,
6039 total_count
- entry_count
,
6041 scale_bbs_frequencies_gcov_type (region_copy
, n_region
, entry_count
,
6046 scale_bbs_frequencies_int (region
, n_region
, total_freq
- entry_freq
,
6048 scale_bbs_frequencies_int (region_copy
, n_region
, entry_freq
, total_freq
);
6053 loop
->header
= exit
->dest
;
6054 loop
->latch
= exit
->src
;
6057 /* Redirect the entry and add the phi node arguments. */
6058 redirected
= redirect_edge_and_branch (entry
, get_bb_copy (entry
->dest
));
6059 gcc_assert (redirected
!= NULL
);
6060 flush_pending_stmts (entry
);
6062 /* Concerning updating of dominators: We must recount dominators
6063 for entry block and its copy. Anything that is outside of the
6064 region, but was dominated by something inside needs recounting as
6066 if (update_dominance
)
6068 set_immediate_dominator (CDI_DOMINATORS
, entry
->dest
, entry
->src
);
6069 doms
.safe_push (get_bb_original (entry
->dest
));
6070 iterate_fix_dominators (CDI_DOMINATORS
, doms
, false);
6074 /* Add the other PHI node arguments. */
6075 add_phi_args_after_copy (region_copy
, n_region
, NULL
);
6077 if (free_region_copy
)
6080 free_original_copy_tables ();
6084 /* Checks if BB is part of the region defined by N_REGION BBS. */
6086 bb_part_of_region_p (basic_block bb
, basic_block
* bbs
, unsigned n_region
)
6090 for (n
= 0; n
< n_region
; n
++)
6098 /* Duplicates REGION consisting of N_REGION blocks. The new blocks
6099 are stored to REGION_COPY in the same order in that they appear
6100 in REGION, if REGION_COPY is not NULL. ENTRY is the entry to
6101 the region, EXIT an exit from it. The condition guarding EXIT
6102 is moved to ENTRY. Returns true if duplication succeeds, false
6128 gimple_duplicate_sese_tail (edge entry ATTRIBUTE_UNUSED
, edge exit ATTRIBUTE_UNUSED
,
6129 basic_block
*region ATTRIBUTE_UNUSED
, unsigned n_region ATTRIBUTE_UNUSED
,
6130 basic_block
*region_copy ATTRIBUTE_UNUSED
)
6133 bool free_region_copy
= false;
6134 struct loop
*loop
= exit
->dest
->loop_father
;
6135 struct loop
*orig_loop
= entry
->dest
->loop_father
;
6136 basic_block switch_bb
, entry_bb
, nentry_bb
;
6137 vec
<basic_block
> doms
;
6138 int total_freq
= 0, exit_freq
= 0;
6139 gcov_type total_count
= 0, exit_count
= 0;
6140 edge exits
[2], nexits
[2], e
;
6141 gimple_stmt_iterator gsi
;
6144 basic_block exit_bb
;
6145 gimple_stmt_iterator psi
;
6148 struct loop
*target
, *aloop
, *cloop
;
6150 gcc_assert (EDGE_COUNT (exit
->src
->succs
) == 2);
6152 exits
[1] = EDGE_SUCC (exit
->src
, EDGE_SUCC (exit
->src
, 0) == exit
);
6154 if (!can_copy_bbs_p (region
, n_region
))
6157 initialize_original_copy_tables ();
6158 set_loop_copy (orig_loop
, loop
);
6161 for (aloop
= orig_loop
->inner
; aloop
; aloop
= aloop
->next
)
6163 if (bb_part_of_region_p (aloop
->header
, region
, n_region
))
6165 cloop
= duplicate_loop (aloop
, target
);
6166 duplicate_subloops (aloop
, cloop
);
6172 region_copy
= XNEWVEC (basic_block
, n_region
);
6173 free_region_copy
= true;
6176 gcc_assert (!need_ssa_update_p (cfun
));
6178 /* Record blocks outside the region that are dominated by something
6180 doms
= get_dominated_by_region (CDI_DOMINATORS
, region
, n_region
);
6182 if (exit
->src
->count
)
6184 total_count
= exit
->src
->count
;
6185 exit_count
= exit
->count
;
6186 /* Fix up corner cases, to avoid division by zero or creation of negative
6188 if (exit_count
> total_count
)
6189 exit_count
= total_count
;
6193 total_freq
= exit
->src
->frequency
;
6194 exit_freq
= EDGE_FREQUENCY (exit
);
6195 /* Fix up corner cases, to avoid division by zero or creation of negative
6197 if (total_freq
== 0)
6199 if (exit_freq
> total_freq
)
6200 exit_freq
= total_freq
;
6203 copy_bbs (region
, n_region
, region_copy
, exits
, 2, nexits
, orig_loop
,
6204 split_edge_bb_loc (exit
), true);
6207 scale_bbs_frequencies_gcov_type (region
, n_region
,
6208 total_count
- exit_count
,
6210 scale_bbs_frequencies_gcov_type (region_copy
, n_region
, exit_count
,
6215 scale_bbs_frequencies_int (region
, n_region
, total_freq
- exit_freq
,
6217 scale_bbs_frequencies_int (region_copy
, n_region
, exit_freq
, total_freq
);
6220 /* Create the switch block, and put the exit condition to it. */
6221 entry_bb
= entry
->dest
;
6222 nentry_bb
= get_bb_copy (entry_bb
);
6223 if (!last_stmt (entry
->src
)
6224 || !stmt_ends_bb_p (last_stmt (entry
->src
)))
6225 switch_bb
= entry
->src
;
6227 switch_bb
= split_edge (entry
);
6228 set_immediate_dominator (CDI_DOMINATORS
, nentry_bb
, switch_bb
);
6230 gsi
= gsi_last_bb (switch_bb
);
6231 cond_stmt
= last_stmt (exit
->src
);
6232 gcc_assert (gimple_code (cond_stmt
) == GIMPLE_COND
);
6233 cond_stmt
= gimple_copy (cond_stmt
);
6235 gsi_insert_after (&gsi
, cond_stmt
, GSI_NEW_STMT
);
6237 sorig
= single_succ_edge (switch_bb
);
6238 sorig
->flags
= exits
[1]->flags
;
6239 snew
= make_edge (switch_bb
, nentry_bb
, exits
[0]->flags
);
6241 /* Register the new edge from SWITCH_BB in loop exit lists. */
6242 rescan_loop_exit (snew
, true, false);
6244 /* Add the PHI node arguments. */
6245 add_phi_args_after_copy (region_copy
, n_region
, snew
);
6247 /* Get rid of now superfluous conditions and associated edges (and phi node
6249 exit_bb
= exit
->dest
;
6251 e
= redirect_edge_and_branch (exits
[0], exits
[1]->dest
);
6252 PENDING_STMT (e
) = NULL
;
6254 /* The latch of ORIG_LOOP was copied, and so was the backedge
6255 to the original header. We redirect this backedge to EXIT_BB. */
6256 for (i
= 0; i
< n_region
; i
++)
6257 if (get_bb_original (region_copy
[i
]) == orig_loop
->latch
)
6259 gcc_assert (single_succ_edge (region_copy
[i
]));
6260 e
= redirect_edge_and_branch (single_succ_edge (region_copy
[i
]), exit_bb
);
6261 PENDING_STMT (e
) = NULL
;
6262 for (psi
= gsi_start_phis (exit_bb
);
6266 phi
= gsi_stmt (psi
);
6267 def
= PHI_ARG_DEF (phi
, nexits
[0]->dest_idx
);
6268 add_phi_arg (phi
, def
, e
, gimple_phi_arg_location_from_edge (phi
, e
));
6271 e
= redirect_edge_and_branch (nexits
[1], nexits
[0]->dest
);
6272 PENDING_STMT (e
) = NULL
;
6274 /* Anything that is outside of the region, but was dominated by something
6275 inside needs to update dominance info. */
6276 iterate_fix_dominators (CDI_DOMINATORS
, doms
, false);
6278 /* Update the SSA web. */
6279 update_ssa (TODO_update_ssa
);
6281 if (free_region_copy
)
6284 free_original_copy_tables ();
6288 /* Add all the blocks dominated by ENTRY to the array BBS_P. Stop
6289 adding blocks when the dominator traversal reaches EXIT. This
6290 function silently assumes that ENTRY strictly dominates EXIT. */
6293 gather_blocks_in_sese_region (basic_block entry
, basic_block exit
,
6294 vec
<basic_block
> *bbs_p
)
6298 for (son
= first_dom_son (CDI_DOMINATORS
, entry
);
6300 son
= next_dom_son (CDI_DOMINATORS
, son
))
6302 bbs_p
->safe_push (son
);
6304 gather_blocks_in_sese_region (son
, exit
, bbs_p
);
6308 /* Replaces *TP with a duplicate (belonging to function TO_CONTEXT).
6309 The duplicates are recorded in VARS_MAP. */
6312 replace_by_duplicate_decl (tree
*tp
, hash_map
<tree
, tree
> *vars_map
,
6315 tree t
= *tp
, new_t
;
6316 struct function
*f
= DECL_STRUCT_FUNCTION (to_context
);
6318 if (DECL_CONTEXT (t
) == to_context
)
6322 tree
&loc
= vars_map
->get_or_insert (t
, &existed
);
6328 new_t
= copy_var_decl (t
, DECL_NAME (t
), TREE_TYPE (t
));
6329 add_local_decl (f
, new_t
);
6333 gcc_assert (TREE_CODE (t
) == CONST_DECL
);
6334 new_t
= copy_node (t
);
6336 DECL_CONTEXT (new_t
) = to_context
;
6347 /* Creates an ssa name in TO_CONTEXT equivalent to NAME.
6348 VARS_MAP maps old ssa names and var_decls to the new ones. */
6351 replace_ssa_name (tree name
, hash_map
<tree
, tree
> *vars_map
,
6356 gcc_assert (!virtual_operand_p (name
));
6358 tree
*loc
= vars_map
->get (name
);
6362 tree decl
= SSA_NAME_VAR (name
);
6365 replace_by_duplicate_decl (&decl
, vars_map
, to_context
);
6366 new_name
= make_ssa_name_fn (DECL_STRUCT_FUNCTION (to_context
),
6367 decl
, SSA_NAME_DEF_STMT (name
));
6368 if (SSA_NAME_IS_DEFAULT_DEF (name
))
6369 set_ssa_default_def (DECL_STRUCT_FUNCTION (to_context
),
6373 new_name
= copy_ssa_name_fn (DECL_STRUCT_FUNCTION (to_context
),
6374 name
, SSA_NAME_DEF_STMT (name
));
6376 vars_map
->put (name
, new_name
);
6390 hash_map
<tree
, tree
> *vars_map
;
6391 htab_t new_label_map
;
6392 hash_map
<void *, void *> *eh_map
;
6396 /* Helper for move_block_to_fn. Set TREE_BLOCK in every expression
6397 contained in *TP if it has been ORIG_BLOCK previously and change the
6398 DECL_CONTEXT of every local variable referenced in *TP. */
6401 move_stmt_op (tree
*tp
, int *walk_subtrees
, void *data
)
6403 struct walk_stmt_info
*wi
= (struct walk_stmt_info
*) data
;
6404 struct move_stmt_d
*p
= (struct move_stmt_d
*) wi
->info
;
6409 tree block
= TREE_BLOCK (t
);
6410 if (block
== p
->orig_block
6411 || (p
->orig_block
== NULL_TREE
6412 && block
!= NULL_TREE
))
6413 TREE_SET_BLOCK (t
, p
->new_block
);
6414 #ifdef ENABLE_CHECKING
6415 else if (block
!= NULL_TREE
)
6417 while (block
&& TREE_CODE (block
) == BLOCK
&& block
!= p
->orig_block
)
6418 block
= BLOCK_SUPERCONTEXT (block
);
6419 gcc_assert (block
== p
->orig_block
);
6423 else if (DECL_P (t
) || TREE_CODE (t
) == SSA_NAME
)
6425 if (TREE_CODE (t
) == SSA_NAME
)
6426 *tp
= replace_ssa_name (t
, p
->vars_map
, p
->to_context
);
6427 else if (TREE_CODE (t
) == LABEL_DECL
)
6429 if (p
->new_label_map
)
6431 struct tree_map in
, *out
;
6433 out
= (struct tree_map
*)
6434 htab_find_with_hash (p
->new_label_map
, &in
, DECL_UID (t
));
6439 DECL_CONTEXT (t
) = p
->to_context
;
6441 else if (p
->remap_decls_p
)
6443 /* Replace T with its duplicate. T should no longer appear in the
6444 parent function, so this looks wasteful; however, it may appear
6445 in referenced_vars, and more importantly, as virtual operands of
6446 statements, and in alias lists of other variables. It would be
6447 quite difficult to expunge it from all those places. ??? It might
6448 suffice to do this for addressable variables. */
6449 if ((TREE_CODE (t
) == VAR_DECL
6450 && !is_global_var (t
))
6451 || TREE_CODE (t
) == CONST_DECL
)
6452 replace_by_duplicate_decl (tp
, p
->vars_map
, p
->to_context
);
6456 else if (TYPE_P (t
))
6462 /* Helper for move_stmt_r. Given an EH region number for the source
6463 function, map that to the duplicate EH regio number in the dest. */
6466 move_stmt_eh_region_nr (int old_nr
, struct move_stmt_d
*p
)
6468 eh_region old_r
, new_r
;
6470 old_r
= get_eh_region_from_number (old_nr
);
6471 new_r
= static_cast<eh_region
> (*p
->eh_map
->get (old_r
));
6473 return new_r
->index
;
6476 /* Similar, but operate on INTEGER_CSTs. */
6479 move_stmt_eh_region_tree_nr (tree old_t_nr
, struct move_stmt_d
*p
)
6483 old_nr
= tree_to_shwi (old_t_nr
);
6484 new_nr
= move_stmt_eh_region_nr (old_nr
, p
);
6486 return build_int_cst (integer_type_node
, new_nr
);
6489 /* Like move_stmt_op, but for gimple statements.
6491 Helper for move_block_to_fn. Set GIMPLE_BLOCK in every expression
6492 contained in the current statement in *GSI_P and change the
6493 DECL_CONTEXT of every local variable referenced in the current
6497 move_stmt_r (gimple_stmt_iterator
*gsi_p
, bool *handled_ops_p
,
6498 struct walk_stmt_info
*wi
)
6500 struct move_stmt_d
*p
= (struct move_stmt_d
*) wi
->info
;
6501 gimple stmt
= gsi_stmt (*gsi_p
);
6502 tree block
= gimple_block (stmt
);
6504 if (block
== p
->orig_block
6505 || (p
->orig_block
== NULL_TREE
6506 && block
!= NULL_TREE
))
6507 gimple_set_block (stmt
, p
->new_block
);
6509 switch (gimple_code (stmt
))
6512 /* Remap the region numbers for __builtin_eh_{pointer,filter}. */
6514 tree r
, fndecl
= gimple_call_fndecl (stmt
);
6515 if (fndecl
&& DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
)
6516 switch (DECL_FUNCTION_CODE (fndecl
))
6518 case BUILT_IN_EH_COPY_VALUES
:
6519 r
= gimple_call_arg (stmt
, 1);
6520 r
= move_stmt_eh_region_tree_nr (r
, p
);
6521 gimple_call_set_arg (stmt
, 1, r
);
6524 case BUILT_IN_EH_POINTER
:
6525 case BUILT_IN_EH_FILTER
:
6526 r
= gimple_call_arg (stmt
, 0);
6527 r
= move_stmt_eh_region_tree_nr (r
, p
);
6528 gimple_call_set_arg (stmt
, 0, r
);
6539 int r
= gimple_resx_region (stmt
);
6540 r
= move_stmt_eh_region_nr (r
, p
);
6541 gimple_resx_set_region (stmt
, r
);
6545 case GIMPLE_EH_DISPATCH
:
6547 int r
= gimple_eh_dispatch_region (stmt
);
6548 r
= move_stmt_eh_region_nr (r
, p
);
6549 gimple_eh_dispatch_set_region (stmt
, r
);
6553 case GIMPLE_OMP_RETURN
:
6554 case GIMPLE_OMP_CONTINUE
:
6557 if (is_gimple_omp (stmt
))
6559 /* Do not remap variables inside OMP directives. Variables
6560 referenced in clauses and directive header belong to the
6561 parent function and should not be moved into the child
6563 bool save_remap_decls_p
= p
->remap_decls_p
;
6564 p
->remap_decls_p
= false;
6565 *handled_ops_p
= true;
6567 walk_gimple_seq_mod (gimple_omp_body_ptr (stmt
), move_stmt_r
,
6570 p
->remap_decls_p
= save_remap_decls_p
;
6578 /* Move basic block BB from function CFUN to function DEST_FN. The
6579 block is moved out of the original linked list and placed after
6580 block AFTER in the new list. Also, the block is removed from the
6581 original array of blocks and placed in DEST_FN's array of blocks.
6582 If UPDATE_EDGE_COUNT_P is true, the edge counts on both CFGs is
6583 updated to reflect the moved edges.
6585 The local variables are remapped to new instances, VARS_MAP is used
6586 to record the mapping. */
6589 move_block_to_fn (struct function
*dest_cfun
, basic_block bb
,
6590 basic_block after
, bool update_edge_count_p
,
6591 struct move_stmt_d
*d
)
6593 struct control_flow_graph
*cfg
;
6596 gimple_stmt_iterator si
;
6597 unsigned old_len
, new_len
;
6599 /* Remove BB from dominance structures. */
6600 delete_from_dominance_info (CDI_DOMINATORS
, bb
);
6602 /* Move BB from its current loop to the copy in the new function. */
6605 struct loop
*new_loop
= (struct loop
*)bb
->loop_father
->aux
;
6607 bb
->loop_father
= new_loop
;
6610 /* Link BB to the new linked list. */
6611 move_block_after (bb
, after
);
6613 /* Update the edge count in the corresponding flowgraphs. */
6614 if (update_edge_count_p
)
6615 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
6617 cfun
->cfg
->x_n_edges
--;
6618 dest_cfun
->cfg
->x_n_edges
++;
6621 /* Remove BB from the original basic block array. */
6622 (*cfun
->cfg
->x_basic_block_info
)[bb
->index
] = NULL
;
6623 cfun
->cfg
->x_n_basic_blocks
--;
6625 /* Grow DEST_CFUN's basic block array if needed. */
6626 cfg
= dest_cfun
->cfg
;
6627 cfg
->x_n_basic_blocks
++;
6628 if (bb
->index
>= cfg
->x_last_basic_block
)
6629 cfg
->x_last_basic_block
= bb
->index
+ 1;
6631 old_len
= vec_safe_length (cfg
->x_basic_block_info
);
6632 if ((unsigned) cfg
->x_last_basic_block
>= old_len
)
6634 new_len
= cfg
->x_last_basic_block
+ (cfg
->x_last_basic_block
+ 3) / 4;
6635 vec_safe_grow_cleared (cfg
->x_basic_block_info
, new_len
);
6638 (*cfg
->x_basic_block_info
)[bb
->index
] = bb
;
6640 /* Remap the variables in phi nodes. */
6641 for (si
= gsi_start_phis (bb
); !gsi_end_p (si
); )
6643 gimple phi
= gsi_stmt (si
);
6645 tree op
= PHI_RESULT (phi
);
6649 if (virtual_operand_p (op
))
6651 /* Remove the phi nodes for virtual operands (alias analysis will be
6652 run for the new function, anyway). */
6653 remove_phi_node (&si
, true);
6657 SET_PHI_RESULT (phi
,
6658 replace_ssa_name (op
, d
->vars_map
, dest_cfun
->decl
));
6659 FOR_EACH_PHI_ARG (use
, phi
, oi
, SSA_OP_USE
)
6661 op
= USE_FROM_PTR (use
);
6662 if (TREE_CODE (op
) == SSA_NAME
)
6663 SET_USE (use
, replace_ssa_name (op
, d
->vars_map
, dest_cfun
->decl
));
6666 for (i
= 0; i
< EDGE_COUNT (bb
->preds
); i
++)
6668 location_t locus
= gimple_phi_arg_location (phi
, i
);
6669 tree block
= LOCATION_BLOCK (locus
);
6671 if (locus
== UNKNOWN_LOCATION
)
6673 if (d
->orig_block
== NULL_TREE
|| block
== d
->orig_block
)
6675 if (d
->new_block
== NULL_TREE
)
6676 locus
= LOCATION_LOCUS (locus
);
6678 locus
= COMBINE_LOCATION_DATA (line_table
, locus
, d
->new_block
);
6679 gimple_phi_arg_set_location (phi
, i
, locus
);
6686 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
6688 gimple stmt
= gsi_stmt (si
);
6689 struct walk_stmt_info wi
;
6691 memset (&wi
, 0, sizeof (wi
));
6693 walk_gimple_stmt (&si
, move_stmt_r
, move_stmt_op
, &wi
);
6695 if (gimple_code (stmt
) == GIMPLE_LABEL
)
6697 tree label
= gimple_label_label (stmt
);
6698 int uid
= LABEL_DECL_UID (label
);
6700 gcc_assert (uid
> -1);
6702 old_len
= vec_safe_length (cfg
->x_label_to_block_map
);
6703 if (old_len
<= (unsigned) uid
)
6705 new_len
= 3 * uid
/ 2 + 1;
6706 vec_safe_grow_cleared (cfg
->x_label_to_block_map
, new_len
);
6709 (*cfg
->x_label_to_block_map
)[uid
] = bb
;
6710 (*cfun
->cfg
->x_label_to_block_map
)[uid
] = NULL
;
6712 gcc_assert (DECL_CONTEXT (label
) == dest_cfun
->decl
);
6714 if (uid
>= dest_cfun
->cfg
->last_label_uid
)
6715 dest_cfun
->cfg
->last_label_uid
= uid
+ 1;
6718 maybe_duplicate_eh_stmt_fn (dest_cfun
, stmt
, cfun
, stmt
, d
->eh_map
, 0);
6719 remove_stmt_from_eh_lp_fn (cfun
, stmt
);
6721 gimple_duplicate_stmt_histograms (dest_cfun
, stmt
, cfun
, stmt
);
6722 gimple_remove_stmt_histograms (cfun
, stmt
);
6724 /* We cannot leave any operands allocated from the operand caches of
6725 the current function. */
6726 free_stmt_operands (cfun
, stmt
);
6727 push_cfun (dest_cfun
);
6732 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
6733 if (e
->goto_locus
!= UNKNOWN_LOCATION
)
6735 tree block
= LOCATION_BLOCK (e
->goto_locus
);
6736 if (d
->orig_block
== NULL_TREE
6737 || block
== d
->orig_block
)
6738 e
->goto_locus
= d
->new_block
?
6739 COMBINE_LOCATION_DATA (line_table
, e
->goto_locus
, d
->new_block
) :
6740 LOCATION_LOCUS (e
->goto_locus
);
6744 /* Examine the statements in BB (which is in SRC_CFUN); find and return
6745 the outermost EH region. Use REGION as the incoming base EH region. */
6748 find_outermost_region_in_block (struct function
*src_cfun
,
6749 basic_block bb
, eh_region region
)
6751 gimple_stmt_iterator si
;
6753 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
6755 gimple stmt
= gsi_stmt (si
);
6756 eh_region stmt_region
;
6759 lp_nr
= lookup_stmt_eh_lp_fn (src_cfun
, stmt
);
6760 stmt_region
= get_eh_region_from_lp_number_fn (src_cfun
, lp_nr
);
6764 region
= stmt_region
;
6765 else if (stmt_region
!= region
)
6767 region
= eh_region_outermost (src_cfun
, stmt_region
, region
);
6768 gcc_assert (region
!= NULL
);
6777 new_label_mapper (tree decl
, void *data
)
6779 htab_t hash
= (htab_t
) data
;
6783 gcc_assert (TREE_CODE (decl
) == LABEL_DECL
);
6785 m
= XNEW (struct tree_map
);
6786 m
->hash
= DECL_UID (decl
);
6787 m
->base
.from
= decl
;
6788 m
->to
= create_artificial_label (UNKNOWN_LOCATION
);
6789 LABEL_DECL_UID (m
->to
) = LABEL_DECL_UID (decl
);
6790 if (LABEL_DECL_UID (m
->to
) >= cfun
->cfg
->last_label_uid
)
6791 cfun
->cfg
->last_label_uid
= LABEL_DECL_UID (m
->to
) + 1;
6793 slot
= htab_find_slot_with_hash (hash
, m
, m
->hash
, INSERT
);
6794 gcc_assert (*slot
== NULL
);
6801 /* Change DECL_CONTEXT of all BLOCK_VARS in block, including
6805 replace_block_vars_by_duplicates (tree block
, hash_map
<tree
, tree
> *vars_map
,
6810 for (tp
= &BLOCK_VARS (block
); *tp
; tp
= &DECL_CHAIN (*tp
))
6813 if (TREE_CODE (t
) != VAR_DECL
&& TREE_CODE (t
) != CONST_DECL
)
6815 replace_by_duplicate_decl (&t
, vars_map
, to_context
);
6818 if (TREE_CODE (*tp
) == VAR_DECL
&& DECL_HAS_VALUE_EXPR_P (*tp
))
6820 SET_DECL_VALUE_EXPR (t
, DECL_VALUE_EXPR (*tp
));
6821 DECL_HAS_VALUE_EXPR_P (t
) = 1;
6823 DECL_CHAIN (t
) = DECL_CHAIN (*tp
);
6828 for (block
= BLOCK_SUBBLOCKS (block
); block
; block
= BLOCK_CHAIN (block
))
6829 replace_block_vars_by_duplicates (block
, vars_map
, to_context
);
6832 /* Fixup the loop arrays and numbers after moving LOOP and its subloops
6836 fixup_loop_arrays_after_move (struct function
*fn1
, struct function
*fn2
,
6839 /* Discard it from the old loop array. */
6840 (*get_loops (fn1
))[loop
->num
] = NULL
;
6842 /* Place it in the new loop array, assigning it a new number. */
6843 loop
->num
= number_of_loops (fn2
);
6844 vec_safe_push (loops_for_fn (fn2
)->larray
, loop
);
6846 /* Recurse to children. */
6847 for (loop
= loop
->inner
; loop
; loop
= loop
->next
)
6848 fixup_loop_arrays_after_move (fn1
, fn2
, loop
);
6851 /* Move a single-entry, single-exit region delimited by ENTRY_BB and
6852 EXIT_BB to function DEST_CFUN. The whole region is replaced by a
6853 single basic block in the original CFG and the new basic block is
6854 returned. DEST_CFUN must not have a CFG yet.
6856 Note that the region need not be a pure SESE region. Blocks inside
6857 the region may contain calls to abort/exit. The only restriction
6858 is that ENTRY_BB should be the only entry point and it must
6861 Change TREE_BLOCK of all statements in ORIG_BLOCK to the new
6862 functions outermost BLOCK, move all subblocks of ORIG_BLOCK
6863 to the new function.
6865 All local variables referenced in the region are assumed to be in
6866 the corresponding BLOCK_VARS and unexpanded variable lists
6867 associated with DEST_CFUN. */
6870 move_sese_region_to_fn (struct function
*dest_cfun
, basic_block entry_bb
,
6871 basic_block exit_bb
, tree orig_block
)
6873 vec
<basic_block
> bbs
, dom_bbs
;
6874 basic_block dom_entry
= get_immediate_dominator (CDI_DOMINATORS
, entry_bb
);
6875 basic_block after
, bb
, *entry_pred
, *exit_succ
, abb
;
6876 struct function
*saved_cfun
= cfun
;
6877 int *entry_flag
, *exit_flag
;
6878 unsigned *entry_prob
, *exit_prob
;
6879 unsigned i
, num_entry_edges
, num_exit_edges
, num_nodes
;
6882 htab_t new_label_map
;
6883 hash_map
<void *, void *> *eh_map
;
6884 struct loop
*loop
= entry_bb
->loop_father
;
6885 struct loop
*loop0
= get_loop (saved_cfun
, 0);
6886 struct move_stmt_d d
;
6888 /* If ENTRY does not strictly dominate EXIT, this cannot be an SESE
6890 gcc_assert (entry_bb
!= exit_bb
6892 || dominated_by_p (CDI_DOMINATORS
, exit_bb
, entry_bb
)));
6894 /* Collect all the blocks in the region. Manually add ENTRY_BB
6895 because it won't be added by dfs_enumerate_from. */
6897 bbs
.safe_push (entry_bb
);
6898 gather_blocks_in_sese_region (entry_bb
, exit_bb
, &bbs
);
6900 /* The blocks that used to be dominated by something in BBS will now be
6901 dominated by the new block. */
6902 dom_bbs
= get_dominated_by_region (CDI_DOMINATORS
,
6906 /* Detach ENTRY_BB and EXIT_BB from CFUN->CFG. We need to remember
6907 the predecessor edges to ENTRY_BB and the successor edges to
6908 EXIT_BB so that we can re-attach them to the new basic block that
6909 will replace the region. */
6910 num_entry_edges
= EDGE_COUNT (entry_bb
->preds
);
6911 entry_pred
= XNEWVEC (basic_block
, num_entry_edges
);
6912 entry_flag
= XNEWVEC (int, num_entry_edges
);
6913 entry_prob
= XNEWVEC (unsigned, num_entry_edges
);
6915 for (ei
= ei_start (entry_bb
->preds
); (e
= ei_safe_edge (ei
)) != NULL
;)
6917 entry_prob
[i
] = e
->probability
;
6918 entry_flag
[i
] = e
->flags
;
6919 entry_pred
[i
++] = e
->src
;
6925 num_exit_edges
= EDGE_COUNT (exit_bb
->succs
);
6926 exit_succ
= XNEWVEC (basic_block
, num_exit_edges
);
6927 exit_flag
= XNEWVEC (int, num_exit_edges
);
6928 exit_prob
= XNEWVEC (unsigned, num_exit_edges
);
6930 for (ei
= ei_start (exit_bb
->succs
); (e
= ei_safe_edge (ei
)) != NULL
;)
6932 exit_prob
[i
] = e
->probability
;
6933 exit_flag
[i
] = e
->flags
;
6934 exit_succ
[i
++] = e
->dest
;
6946 /* Switch context to the child function to initialize DEST_FN's CFG. */
6947 gcc_assert (dest_cfun
->cfg
== NULL
);
6948 push_cfun (dest_cfun
);
6950 init_empty_tree_cfg ();
6952 /* Initialize EH information for the new function. */
6954 new_label_map
= NULL
;
6957 eh_region region
= NULL
;
6959 FOR_EACH_VEC_ELT (bbs
, i
, bb
)
6960 region
= find_outermost_region_in_block (saved_cfun
, bb
, region
);
6962 init_eh_for_function ();
6965 new_label_map
= htab_create (17, tree_map_hash
, tree_map_eq
, free
);
6966 eh_map
= duplicate_eh_regions (saved_cfun
, region
, 0,
6967 new_label_mapper
, new_label_map
);
6971 /* Initialize an empty loop tree. */
6972 struct loops
*loops
= ggc_cleared_alloc
<struct loops
> ();
6973 init_loops_structure (dest_cfun
, loops
, 1);
6974 loops
->state
= LOOPS_MAY_HAVE_MULTIPLE_LATCHES
;
6975 set_loops_for_fn (dest_cfun
, loops
);
6977 /* Move the outlined loop tree part. */
6978 num_nodes
= bbs
.length ();
6979 FOR_EACH_VEC_ELT (bbs
, i
, bb
)
6981 if (bb
->loop_father
->header
== bb
)
6983 struct loop
*this_loop
= bb
->loop_father
;
6984 struct loop
*outer
= loop_outer (this_loop
);
6986 /* If the SESE region contains some bbs ending with
6987 a noreturn call, those are considered to belong
6988 to the outermost loop in saved_cfun, rather than
6989 the entry_bb's loop_father. */
6993 num_nodes
-= this_loop
->num_nodes
;
6994 flow_loop_tree_node_remove (bb
->loop_father
);
6995 flow_loop_tree_node_add (get_loop (dest_cfun
, 0), this_loop
);
6996 fixup_loop_arrays_after_move (saved_cfun
, cfun
, this_loop
);
6999 else if (bb
->loop_father
== loop0
&& loop0
!= loop
)
7002 /* Remove loop exits from the outlined region. */
7003 if (loops_for_fn (saved_cfun
)->exits
)
7004 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
7006 struct loops
*l
= loops_for_fn (saved_cfun
);
7008 = l
->exits
->find_slot_with_hash (e
, htab_hash_pointer (e
),
7011 l
->exits
->clear_slot (slot
);
7016 /* Adjust the number of blocks in the tree root of the outlined part. */
7017 get_loop (dest_cfun
, 0)->num_nodes
= bbs
.length () + 2;
7019 /* Setup a mapping to be used by move_block_to_fn. */
7020 loop
->aux
= current_loops
->tree_root
;
7021 loop0
->aux
= current_loops
->tree_root
;
7025 /* Move blocks from BBS into DEST_CFUN. */
7026 gcc_assert (bbs
.length () >= 2);
7027 after
= dest_cfun
->cfg
->x_entry_block_ptr
;
7028 hash_map
<tree
, tree
> vars_map
;
7030 memset (&d
, 0, sizeof (d
));
7031 d
.orig_block
= orig_block
;
7032 d
.new_block
= DECL_INITIAL (dest_cfun
->decl
);
7033 d
.from_context
= cfun
->decl
;
7034 d
.to_context
= dest_cfun
->decl
;
7035 d
.vars_map
= &vars_map
;
7036 d
.new_label_map
= new_label_map
;
7038 d
.remap_decls_p
= true;
7040 FOR_EACH_VEC_ELT (bbs
, i
, bb
)
7042 /* No need to update edge counts on the last block. It has
7043 already been updated earlier when we detached the region from
7044 the original CFG. */
7045 move_block_to_fn (dest_cfun
, bb
, after
, bb
!= exit_bb
, &d
);
7051 /* Loop sizes are no longer correct, fix them up. */
7052 loop
->num_nodes
-= num_nodes
;
7053 for (struct loop
*outer
= loop_outer (loop
);
7054 outer
; outer
= loop_outer (outer
))
7055 outer
->num_nodes
-= num_nodes
;
7056 loop0
->num_nodes
-= bbs
.length () - num_nodes
;
7058 if (saved_cfun
->has_simduid_loops
|| saved_cfun
->has_force_vectorize_loops
)
7061 for (i
= 0; vec_safe_iterate (loops
->larray
, i
, &aloop
); i
++)
7066 replace_by_duplicate_decl (&aloop
->simduid
, d
.vars_map
,
7068 dest_cfun
->has_simduid_loops
= true;
7070 if (aloop
->force_vectorize
)
7071 dest_cfun
->has_force_vectorize_loops
= true;
7075 /* Rewire BLOCK_SUBBLOCKS of orig_block. */
7079 gcc_assert (BLOCK_SUBBLOCKS (DECL_INITIAL (dest_cfun
->decl
))
7081 BLOCK_SUBBLOCKS (DECL_INITIAL (dest_cfun
->decl
))
7082 = BLOCK_SUBBLOCKS (orig_block
);
7083 for (block
= BLOCK_SUBBLOCKS (orig_block
);
7084 block
; block
= BLOCK_CHAIN (block
))
7085 BLOCK_SUPERCONTEXT (block
) = DECL_INITIAL (dest_cfun
->decl
);
7086 BLOCK_SUBBLOCKS (orig_block
) = NULL_TREE
;
7089 replace_block_vars_by_duplicates (DECL_INITIAL (dest_cfun
->decl
),
7090 &vars_map
, dest_cfun
->decl
);
7093 htab_delete (new_label_map
);
7097 /* Rewire the entry and exit blocks. The successor to the entry
7098 block turns into the successor of DEST_FN's ENTRY_BLOCK_PTR in
7099 the child function. Similarly, the predecessor of DEST_FN's
7100 EXIT_BLOCK_PTR turns into the predecessor of EXIT_BLOCK_PTR. We
7101 need to switch CFUN between DEST_CFUN and SAVED_CFUN so that the
7102 various CFG manipulation function get to the right CFG.
7104 FIXME, this is silly. The CFG ought to become a parameter to
7106 push_cfun (dest_cfun
);
7107 make_edge (ENTRY_BLOCK_PTR_FOR_FN (cfun
), entry_bb
, EDGE_FALLTHRU
);
7109 make_edge (exit_bb
, EXIT_BLOCK_PTR_FOR_FN (cfun
), 0);
7112 /* Back in the original function, the SESE region has disappeared,
7113 create a new basic block in its place. */
7114 bb
= create_empty_bb (entry_pred
[0]);
7116 add_bb_to_loop (bb
, loop
);
7117 for (i
= 0; i
< num_entry_edges
; i
++)
7119 e
= make_edge (entry_pred
[i
], bb
, entry_flag
[i
]);
7120 e
->probability
= entry_prob
[i
];
7123 for (i
= 0; i
< num_exit_edges
; i
++)
7125 e
= make_edge (bb
, exit_succ
[i
], exit_flag
[i
]);
7126 e
->probability
= exit_prob
[i
];
7129 set_immediate_dominator (CDI_DOMINATORS
, bb
, dom_entry
);
7130 FOR_EACH_VEC_ELT (dom_bbs
, i
, abb
)
7131 set_immediate_dominator (CDI_DOMINATORS
, abb
, bb
);
7149 /* Dump FUNCTION_DECL FN to file FILE using FLAGS (see TDF_* in dumpfile.h)
7153 dump_function_to_file (tree fndecl
, FILE *file
, int flags
)
7155 tree arg
, var
, old_current_fndecl
= current_function_decl
;
7156 struct function
*dsf
;
7157 bool ignore_topmost_bind
= false, any_var
= false;
7160 bool tmclone
= (TREE_CODE (fndecl
) == FUNCTION_DECL
7161 && decl_is_tm_clone (fndecl
));
7162 struct function
*fun
= DECL_STRUCT_FUNCTION (fndecl
);
7164 current_function_decl
= fndecl
;
7165 fprintf (file
, "%s %s(", function_name (fun
), tmclone
? "[tm-clone] " : "");
7167 arg
= DECL_ARGUMENTS (fndecl
);
7170 print_generic_expr (file
, TREE_TYPE (arg
), dump_flags
);
7171 fprintf (file
, " ");
7172 print_generic_expr (file
, arg
, dump_flags
);
7173 if (flags
& TDF_VERBOSE
)
7174 print_node (file
, "", arg
, 4);
7175 if (DECL_CHAIN (arg
))
7176 fprintf (file
, ", ");
7177 arg
= DECL_CHAIN (arg
);
7179 fprintf (file
, ")\n");
7181 if (flags
& TDF_VERBOSE
)
7182 print_node (file
, "", fndecl
, 2);
7184 dsf
= DECL_STRUCT_FUNCTION (fndecl
);
7185 if (dsf
&& (flags
& TDF_EH
))
7186 dump_eh_tree (file
, dsf
);
7188 if (flags
& TDF_RAW
&& !gimple_has_body_p (fndecl
))
7190 dump_node (fndecl
, TDF_SLIM
| flags
, file
);
7191 current_function_decl
= old_current_fndecl
;
7195 /* When GIMPLE is lowered, the variables are no longer available in
7196 BIND_EXPRs, so display them separately. */
7197 if (fun
&& fun
->decl
== fndecl
&& (fun
->curr_properties
& PROP_gimple_lcf
))
7200 ignore_topmost_bind
= true;
7202 fprintf (file
, "{\n");
7203 if (!vec_safe_is_empty (fun
->local_decls
))
7204 FOR_EACH_LOCAL_DECL (fun
, ix
, var
)
7206 print_generic_decl (file
, var
, flags
);
7207 if (flags
& TDF_VERBOSE
)
7208 print_node (file
, "", var
, 4);
7209 fprintf (file
, "\n");
7213 if (gimple_in_ssa_p (cfun
))
7214 for (ix
= 1; ix
< num_ssa_names
; ++ix
)
7216 tree name
= ssa_name (ix
);
7217 if (name
&& !SSA_NAME_VAR (name
))
7219 fprintf (file
, " ");
7220 print_generic_expr (file
, TREE_TYPE (name
), flags
);
7221 fprintf (file
, " ");
7222 print_generic_expr (file
, name
, flags
);
7223 fprintf (file
, ";\n");
7230 if (fun
&& fun
->decl
== fndecl
7232 && basic_block_info_for_fn (fun
))
7234 /* If the CFG has been built, emit a CFG-based dump. */
7235 if (!ignore_topmost_bind
)
7236 fprintf (file
, "{\n");
7238 if (any_var
&& n_basic_blocks_for_fn (fun
))
7239 fprintf (file
, "\n");
7241 FOR_EACH_BB_FN (bb
, fun
)
7242 dump_bb (file
, bb
, 2, flags
| TDF_COMMENT
);
7244 fprintf (file
, "}\n");
7246 else if (DECL_SAVED_TREE (fndecl
) == NULL
)
7248 /* The function is now in GIMPLE form but the CFG has not been
7249 built yet. Emit the single sequence of GIMPLE statements
7250 that make up its body. */
7251 gimple_seq body
= gimple_body (fndecl
);
7253 if (gimple_seq_first_stmt (body
)
7254 && gimple_seq_first_stmt (body
) == gimple_seq_last_stmt (body
)
7255 && gimple_code (gimple_seq_first_stmt (body
)) == GIMPLE_BIND
)
7256 print_gimple_seq (file
, body
, 0, flags
);
7259 if (!ignore_topmost_bind
)
7260 fprintf (file
, "{\n");
7263 fprintf (file
, "\n");
7265 print_gimple_seq (file
, body
, 2, flags
);
7266 fprintf (file
, "}\n");
7273 /* Make a tree based dump. */
7274 chain
= DECL_SAVED_TREE (fndecl
);
7275 if (chain
&& TREE_CODE (chain
) == BIND_EXPR
)
7277 if (ignore_topmost_bind
)
7279 chain
= BIND_EXPR_BODY (chain
);
7287 if (!ignore_topmost_bind
)
7288 fprintf (file
, "{\n");
7293 fprintf (file
, "\n");
7295 print_generic_stmt_indented (file
, chain
, flags
, indent
);
7296 if (ignore_topmost_bind
)
7297 fprintf (file
, "}\n");
7300 if (flags
& TDF_ENUMERATE_LOCALS
)
7301 dump_enumerated_decls (file
, flags
);
7302 fprintf (file
, "\n\n");
7304 current_function_decl
= old_current_fndecl
;
7307 /* Dump FUNCTION_DECL FN to stderr using FLAGS (see TDF_* in tree.h) */
7310 debug_function (tree fn
, int flags
)
7312 dump_function_to_file (fn
, stderr
, flags
);
7316 /* Print on FILE the indexes for the predecessors of basic_block BB. */
7319 print_pred_bbs (FILE *file
, basic_block bb
)
7324 FOR_EACH_EDGE (e
, ei
, bb
->preds
)
7325 fprintf (file
, "bb_%d ", e
->src
->index
);
7329 /* Print on FILE the indexes for the successors of basic_block BB. */
7332 print_succ_bbs (FILE *file
, basic_block bb
)
7337 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
7338 fprintf (file
, "bb_%d ", e
->dest
->index
);
7341 /* Print to FILE the basic block BB following the VERBOSITY level. */
7344 print_loops_bb (FILE *file
, basic_block bb
, int indent
, int verbosity
)
7346 char *s_indent
= (char *) alloca ((size_t) indent
+ 1);
7347 memset ((void *) s_indent
, ' ', (size_t) indent
);
7348 s_indent
[indent
] = '\0';
7350 /* Print basic_block's header. */
7353 fprintf (file
, "%s bb_%d (preds = {", s_indent
, bb
->index
);
7354 print_pred_bbs (file
, bb
);
7355 fprintf (file
, "}, succs = {");
7356 print_succ_bbs (file
, bb
);
7357 fprintf (file
, "})\n");
7360 /* Print basic_block's body. */
7363 fprintf (file
, "%s {\n", s_indent
);
7364 dump_bb (file
, bb
, indent
+ 4, TDF_VOPS
|TDF_MEMSYMS
);
7365 fprintf (file
, "%s }\n", s_indent
);
7369 static void print_loop_and_siblings (FILE *, struct loop
*, int, int);
7371 /* Pretty print LOOP on FILE, indented INDENT spaces. Following
7372 VERBOSITY level this outputs the contents of the loop, or just its
7376 print_loop (FILE *file
, struct loop
*loop
, int indent
, int verbosity
)
7384 s_indent
= (char *) alloca ((size_t) indent
+ 1);
7385 memset ((void *) s_indent
, ' ', (size_t) indent
);
7386 s_indent
[indent
] = '\0';
7388 /* Print loop's header. */
7389 fprintf (file
, "%sloop_%d (", s_indent
, loop
->num
);
7391 fprintf (file
, "header = %d", loop
->header
->index
);
7394 fprintf (file
, "deleted)\n");
7398 fprintf (file
, ", latch = %d", loop
->latch
->index
);
7400 fprintf (file
, ", multiple latches");
7401 fprintf (file
, ", niter = ");
7402 print_generic_expr (file
, loop
->nb_iterations
, 0);
7404 if (loop
->any_upper_bound
)
7406 fprintf (file
, ", upper_bound = ");
7407 print_decu (loop
->nb_iterations_upper_bound
, file
);
7410 if (loop
->any_estimate
)
7412 fprintf (file
, ", estimate = ");
7413 print_decu (loop
->nb_iterations_estimate
, file
);
7415 fprintf (file
, ")\n");
7417 /* Print loop's body. */
7420 fprintf (file
, "%s{\n", s_indent
);
7421 FOR_EACH_BB_FN (bb
, cfun
)
7422 if (bb
->loop_father
== loop
)
7423 print_loops_bb (file
, bb
, indent
, verbosity
);
7425 print_loop_and_siblings (file
, loop
->inner
, indent
+ 2, verbosity
);
7426 fprintf (file
, "%s}\n", s_indent
);
7430 /* Print the LOOP and its sibling loops on FILE, indented INDENT
7431 spaces. Following VERBOSITY level this outputs the contents of the
7432 loop, or just its structure. */
7435 print_loop_and_siblings (FILE *file
, struct loop
*loop
, int indent
,
7441 print_loop (file
, loop
, indent
, verbosity
);
7442 print_loop_and_siblings (file
, loop
->next
, indent
, verbosity
);
7445 /* Follow a CFG edge from the entry point of the program, and on entry
7446 of a loop, pretty print the loop structure on FILE. */
7449 print_loops (FILE *file
, int verbosity
)
7453 bb
= ENTRY_BLOCK_PTR_FOR_FN (cfun
);
7454 if (bb
&& bb
->loop_father
)
7455 print_loop_and_siblings (file
, bb
->loop_father
, 0, verbosity
);
7461 debug (struct loop
&ref
)
7463 print_loop (stderr
, &ref
, 0, /*verbosity*/0);
7467 debug (struct loop
*ptr
)
7472 fprintf (stderr
, "<nil>\n");
7475 /* Dump a loop verbosely. */
7478 debug_verbose (struct loop
&ref
)
7480 print_loop (stderr
, &ref
, 0, /*verbosity*/3);
7484 debug_verbose (struct loop
*ptr
)
7489 fprintf (stderr
, "<nil>\n");
7493 /* Debugging loops structure at tree level, at some VERBOSITY level. */
7496 debug_loops (int verbosity
)
7498 print_loops (stderr
, verbosity
);
7501 /* Print on stderr the code of LOOP, at some VERBOSITY level. */
7504 debug_loop (struct loop
*loop
, int verbosity
)
7506 print_loop (stderr
, loop
, 0, verbosity
);
7509 /* Print on stderr the code of loop number NUM, at some VERBOSITY
7513 debug_loop_num (unsigned num
, int verbosity
)
7515 debug_loop (get_loop (cfun
, num
), verbosity
);
7518 /* Return true if BB ends with a call, possibly followed by some
7519 instructions that must stay with the call. Return false,
7523 gimple_block_ends_with_call_p (basic_block bb
)
7525 gimple_stmt_iterator gsi
= gsi_last_nondebug_bb (bb
);
7526 return !gsi_end_p (gsi
) && is_gimple_call (gsi_stmt (gsi
));
7530 /* Return true if BB ends with a conditional branch. Return false,
7534 gimple_block_ends_with_condjump_p (const_basic_block bb
)
7536 gimple stmt
= last_stmt (CONST_CAST_BB (bb
));
7537 return (stmt
&& gimple_code (stmt
) == GIMPLE_COND
);
7541 /* Return true if we need to add fake edge to exit at statement T.
7542 Helper function for gimple_flow_call_edges_add. */
7545 need_fake_edge_p (gimple t
)
7547 tree fndecl
= NULL_TREE
;
7550 /* NORETURN and LONGJMP calls already have an edge to exit.
7551 CONST and PURE calls do not need one.
7552 We don't currently check for CONST and PURE here, although
7553 it would be a good idea, because those attributes are
7554 figured out from the RTL in mark_constant_function, and
7555 the counter incrementation code from -fprofile-arcs
7556 leads to different results from -fbranch-probabilities. */
7557 if (is_gimple_call (t
))
7559 fndecl
= gimple_call_fndecl (t
);
7560 call_flags
= gimple_call_flags (t
);
7563 if (is_gimple_call (t
)
7565 && DECL_BUILT_IN (fndecl
)
7566 && (call_flags
& ECF_NOTHROW
)
7567 && !(call_flags
& ECF_RETURNS_TWICE
)
7568 /* fork() doesn't really return twice, but the effect of
7569 wrapping it in __gcov_fork() which calls __gcov_flush()
7570 and clears the counters before forking has the same
7571 effect as returning twice. Force a fake edge. */
7572 && !(DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
7573 && DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_FORK
))
7576 if (is_gimple_call (t
))
7582 if (!(call_flags
& ECF_NORETURN
))
7586 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
7587 if ((e
->flags
& EDGE_FAKE
) == 0)
7591 if (gimple_code (t
) == GIMPLE_ASM
7592 && (gimple_asm_volatile_p (t
) || gimple_asm_input_p (t
)))
7599 /* Add fake edges to the function exit for any non constant and non
7600 noreturn calls (or noreturn calls with EH/abnormal edges),
7601 volatile inline assembly in the bitmap of blocks specified by BLOCKS
7602 or to the whole CFG if BLOCKS is zero. Return the number of blocks
7605 The goal is to expose cases in which entering a basic block does
7606 not imply that all subsequent instructions must be executed. */
7609 gimple_flow_call_edges_add (sbitmap blocks
)
7612 int blocks_split
= 0;
7613 int last_bb
= last_basic_block_for_fn (cfun
);
7614 bool check_last_block
= false;
7616 if (n_basic_blocks_for_fn (cfun
) == NUM_FIXED_BLOCKS
)
7620 check_last_block
= true;
7622 check_last_block
= bitmap_bit_p (blocks
,
7623 EXIT_BLOCK_PTR_FOR_FN (cfun
)->prev_bb
->index
);
7625 /* In the last basic block, before epilogue generation, there will be
7626 a fallthru edge to EXIT. Special care is required if the last insn
7627 of the last basic block is a call because make_edge folds duplicate
7628 edges, which would result in the fallthru edge also being marked
7629 fake, which would result in the fallthru edge being removed by
7630 remove_fake_edges, which would result in an invalid CFG.
7632 Moreover, we can't elide the outgoing fake edge, since the block
7633 profiler needs to take this into account in order to solve the minimal
7634 spanning tree in the case that the call doesn't return.
7636 Handle this by adding a dummy instruction in a new last basic block. */
7637 if (check_last_block
)
7639 basic_block bb
= EXIT_BLOCK_PTR_FOR_FN (cfun
)->prev_bb
;
7640 gimple_stmt_iterator gsi
= gsi_last_nondebug_bb (bb
);
7643 if (!gsi_end_p (gsi
))
7646 if (t
&& need_fake_edge_p (t
))
7650 e
= find_edge (bb
, EXIT_BLOCK_PTR_FOR_FN (cfun
));
7653 gsi_insert_on_edge (e
, gimple_build_nop ());
7654 gsi_commit_edge_inserts ();
7659 /* Now add fake edges to the function exit for any non constant
7660 calls since there is no way that we can determine if they will
7662 for (i
= 0; i
< last_bb
; i
++)
7664 basic_block bb
= BASIC_BLOCK_FOR_FN (cfun
, i
);
7665 gimple_stmt_iterator gsi
;
7666 gimple stmt
, last_stmt
;
7671 if (blocks
&& !bitmap_bit_p (blocks
, i
))
7674 gsi
= gsi_last_nondebug_bb (bb
);
7675 if (!gsi_end_p (gsi
))
7677 last_stmt
= gsi_stmt (gsi
);
7680 stmt
= gsi_stmt (gsi
);
7681 if (need_fake_edge_p (stmt
))
7685 /* The handling above of the final block before the
7686 epilogue should be enough to verify that there is
7687 no edge to the exit block in CFG already.
7688 Calling make_edge in such case would cause us to
7689 mark that edge as fake and remove it later. */
7690 #ifdef ENABLE_CHECKING
7691 if (stmt
== last_stmt
)
7693 e
= find_edge (bb
, EXIT_BLOCK_PTR_FOR_FN (cfun
));
7694 gcc_assert (e
== NULL
);
7698 /* Note that the following may create a new basic block
7699 and renumber the existing basic blocks. */
7700 if (stmt
!= last_stmt
)
7702 e
= split_block (bb
, stmt
);
7706 make_edge (bb
, EXIT_BLOCK_PTR_FOR_FN (cfun
), EDGE_FAKE
);
7710 while (!gsi_end_p (gsi
));
7715 verify_flow_info ();
7717 return blocks_split
;
7720 /* Removes edge E and all the blocks dominated by it, and updates dominance
7721 information. The IL in E->src needs to be updated separately.
7722 If dominance info is not available, only the edge E is removed.*/
7725 remove_edge_and_dominated_blocks (edge e
)
7727 vec
<basic_block
> bbs_to_remove
= vNULL
;
7728 vec
<basic_block
> bbs_to_fix_dom
= vNULL
;
7732 bool none_removed
= false;
7734 basic_block bb
, dbb
;
7737 if (!dom_info_available_p (CDI_DOMINATORS
))
7743 /* No updating is needed for edges to exit. */
7744 if (e
->dest
== EXIT_BLOCK_PTR_FOR_FN (cfun
))
7746 if (cfgcleanup_altered_bbs
)
7747 bitmap_set_bit (cfgcleanup_altered_bbs
, e
->src
->index
);
7752 /* First, we find the basic blocks to remove. If E->dest has a predecessor
7753 that is not dominated by E->dest, then this set is empty. Otherwise,
7754 all the basic blocks dominated by E->dest are removed.
7756 Also, to DF_IDOM we store the immediate dominators of the blocks in
7757 the dominance frontier of E (i.e., of the successors of the
7758 removed blocks, if there are any, and of E->dest otherwise). */
7759 FOR_EACH_EDGE (f
, ei
, e
->dest
->preds
)
7764 if (!dominated_by_p (CDI_DOMINATORS
, f
->src
, e
->dest
))
7766 none_removed
= true;
7771 df
= BITMAP_ALLOC (NULL
);
7772 df_idom
= BITMAP_ALLOC (NULL
);
7775 bitmap_set_bit (df_idom
,
7776 get_immediate_dominator (CDI_DOMINATORS
, e
->dest
)->index
);
7779 bbs_to_remove
= get_all_dominated_blocks (CDI_DOMINATORS
, e
->dest
);
7780 FOR_EACH_VEC_ELT (bbs_to_remove
, i
, bb
)
7782 FOR_EACH_EDGE (f
, ei
, bb
->succs
)
7784 if (f
->dest
!= EXIT_BLOCK_PTR_FOR_FN (cfun
))
7785 bitmap_set_bit (df
, f
->dest
->index
);
7788 FOR_EACH_VEC_ELT (bbs_to_remove
, i
, bb
)
7789 bitmap_clear_bit (df
, bb
->index
);
7791 EXECUTE_IF_SET_IN_BITMAP (df
, 0, i
, bi
)
7793 bb
= BASIC_BLOCK_FOR_FN (cfun
, i
);
7794 bitmap_set_bit (df_idom
,
7795 get_immediate_dominator (CDI_DOMINATORS
, bb
)->index
);
7799 if (cfgcleanup_altered_bbs
)
7801 /* Record the set of the altered basic blocks. */
7802 bitmap_set_bit (cfgcleanup_altered_bbs
, e
->src
->index
);
7803 bitmap_ior_into (cfgcleanup_altered_bbs
, df
);
7806 /* Remove E and the cancelled blocks. */
7811 /* Walk backwards so as to get a chance to substitute all
7812 released DEFs into debug stmts. See
7813 eliminate_unnecessary_stmts() in tree-ssa-dce.c for more
7815 for (i
= bbs_to_remove
.length (); i
-- > 0; )
7816 delete_basic_block (bbs_to_remove
[i
]);
7819 /* Update the dominance information. The immediate dominator may change only
7820 for blocks whose immediate dominator belongs to DF_IDOM:
7822 Suppose that idom(X) = Y before removal of E and idom(X) != Y after the
7823 removal. Let Z the arbitrary block such that idom(Z) = Y and
7824 Z dominates X after the removal. Before removal, there exists a path P
7825 from Y to X that avoids Z. Let F be the last edge on P that is
7826 removed, and let W = F->dest. Before removal, idom(W) = Y (since Y
7827 dominates W, and because of P, Z does not dominate W), and W belongs to
7828 the dominance frontier of E. Therefore, Y belongs to DF_IDOM. */
7829 EXECUTE_IF_SET_IN_BITMAP (df_idom
, 0, i
, bi
)
7831 bb
= BASIC_BLOCK_FOR_FN (cfun
, i
);
7832 for (dbb
= first_dom_son (CDI_DOMINATORS
, bb
);
7834 dbb
= next_dom_son (CDI_DOMINATORS
, dbb
))
7835 bbs_to_fix_dom
.safe_push (dbb
);
7838 iterate_fix_dominators (CDI_DOMINATORS
, bbs_to_fix_dom
, true);
7841 BITMAP_FREE (df_idom
);
7842 bbs_to_remove
.release ();
7843 bbs_to_fix_dom
.release ();
7846 /* Purge dead EH edges from basic block BB. */
7849 gimple_purge_dead_eh_edges (basic_block bb
)
7851 bool changed
= false;
7854 gimple stmt
= last_stmt (bb
);
7856 if (stmt
&& stmt_can_throw_internal (stmt
))
7859 for (ei
= ei_start (bb
->succs
); (e
= ei_safe_edge (ei
)); )
7861 if (e
->flags
& EDGE_EH
)
7863 remove_edge_and_dominated_blocks (e
);
7873 /* Purge dead EH edges from basic block listed in BLOCKS. */
7876 gimple_purge_all_dead_eh_edges (const_bitmap blocks
)
7878 bool changed
= false;
7882 EXECUTE_IF_SET_IN_BITMAP (blocks
, 0, i
, bi
)
7884 basic_block bb
= BASIC_BLOCK_FOR_FN (cfun
, i
);
7886 /* Earlier gimple_purge_dead_eh_edges could have removed
7887 this basic block already. */
7888 gcc_assert (bb
|| changed
);
7890 changed
|= gimple_purge_dead_eh_edges (bb
);
7896 /* Purge dead abnormal call edges from basic block BB. */
7899 gimple_purge_dead_abnormal_call_edges (basic_block bb
)
7901 bool changed
= false;
7904 gimple stmt
= last_stmt (bb
);
7906 if (!cfun
->has_nonlocal_label
7907 && !cfun
->calls_setjmp
)
7910 if (stmt
&& stmt_can_make_abnormal_goto (stmt
))
7913 for (ei
= ei_start (bb
->succs
); (e
= ei_safe_edge (ei
)); )
7915 if (e
->flags
& EDGE_ABNORMAL
)
7917 if (e
->flags
& EDGE_FALLTHRU
)
7918 e
->flags
&= ~EDGE_ABNORMAL
;
7920 remove_edge_and_dominated_blocks (e
);
7930 /* Purge dead abnormal call edges from basic block listed in BLOCKS. */
7933 gimple_purge_all_dead_abnormal_call_edges (const_bitmap blocks
)
7935 bool changed
= false;
7939 EXECUTE_IF_SET_IN_BITMAP (blocks
, 0, i
, bi
)
7941 basic_block bb
= BASIC_BLOCK_FOR_FN (cfun
, i
);
7943 /* Earlier gimple_purge_dead_abnormal_call_edges could have removed
7944 this basic block already. */
7945 gcc_assert (bb
|| changed
);
7947 changed
|= gimple_purge_dead_abnormal_call_edges (bb
);
7953 /* This function is called whenever a new edge is created or
7957 gimple_execute_on_growing_pred (edge e
)
7959 basic_block bb
= e
->dest
;
7961 if (!gimple_seq_empty_p (phi_nodes (bb
)))
7962 reserve_phi_args_for_new_edge (bb
);
7965 /* This function is called immediately before edge E is removed from
7966 the edge vector E->dest->preds. */
7969 gimple_execute_on_shrinking_pred (edge e
)
7971 if (!gimple_seq_empty_p (phi_nodes (e
->dest
)))
7972 remove_phi_args (e
);
7975 /*---------------------------------------------------------------------------
7976 Helper functions for Loop versioning
7977 ---------------------------------------------------------------------------*/
7979 /* Adjust phi nodes for 'first' basic block. 'second' basic block is a copy
7980 of 'first'. Both of them are dominated by 'new_head' basic block. When
7981 'new_head' was created by 'second's incoming edge it received phi arguments
7982 on the edge by split_edge(). Later, additional edge 'e' was created to
7983 connect 'new_head' and 'first'. Now this routine adds phi args on this
7984 additional edge 'e' that new_head to second edge received as part of edge
7988 gimple_lv_adjust_loop_header_phi (basic_block first
, basic_block second
,
7989 basic_block new_head
, edge e
)
7992 gimple_stmt_iterator psi1
, psi2
;
7994 edge e2
= find_edge (new_head
, second
);
7996 /* Because NEW_HEAD has been created by splitting SECOND's incoming
7997 edge, we should always have an edge from NEW_HEAD to SECOND. */
7998 gcc_assert (e2
!= NULL
);
8000 /* Browse all 'second' basic block phi nodes and add phi args to
8001 edge 'e' for 'first' head. PHI args are always in correct order. */
8003 for (psi2
= gsi_start_phis (second
),
8004 psi1
= gsi_start_phis (first
);
8005 !gsi_end_p (psi2
) && !gsi_end_p (psi1
);
8006 gsi_next (&psi2
), gsi_next (&psi1
))
8008 phi1
= gsi_stmt (psi1
);
8009 phi2
= gsi_stmt (psi2
);
8010 def
= PHI_ARG_DEF (phi2
, e2
->dest_idx
);
8011 add_phi_arg (phi1
, def
, e
, gimple_phi_arg_location_from_edge (phi2
, e2
));
8016 /* Adds a if else statement to COND_BB with condition COND_EXPR.
8017 SECOND_HEAD is the destination of the THEN and FIRST_HEAD is
8018 the destination of the ELSE part. */
8021 gimple_lv_add_condition_to_bb (basic_block first_head ATTRIBUTE_UNUSED
,
8022 basic_block second_head ATTRIBUTE_UNUSED
,
8023 basic_block cond_bb
, void *cond_e
)
8025 gimple_stmt_iterator gsi
;
8026 gimple new_cond_expr
;
8027 tree cond_expr
= (tree
) cond_e
;
8030 /* Build new conditional expr */
8031 new_cond_expr
= gimple_build_cond_from_tree (cond_expr
,
8032 NULL_TREE
, NULL_TREE
);
8034 /* Add new cond in cond_bb. */
8035 gsi
= gsi_last_bb (cond_bb
);
8036 gsi_insert_after (&gsi
, new_cond_expr
, GSI_NEW_STMT
);
8038 /* Adjust edges appropriately to connect new head with first head
8039 as well as second head. */
8040 e0
= single_succ_edge (cond_bb
);
8041 e0
->flags
&= ~EDGE_FALLTHRU
;
8042 e0
->flags
|= EDGE_FALSE_VALUE
;
8046 /* Do book-keeping of basic block BB for the profile consistency checker.
8047 If AFTER_PASS is 0, do pre-pass accounting, or if AFTER_PASS is 1
8048 then do post-pass accounting. Store the counting in RECORD. */
8050 gimple_account_profile_record (basic_block bb
, int after_pass
,
8051 struct profile_record
*record
)
8053 gimple_stmt_iterator i
;
8054 for (i
= gsi_start_bb (bb
); !gsi_end_p (i
); gsi_next (&i
))
8056 record
->size
[after_pass
]
8057 += estimate_num_insns (gsi_stmt (i
), &eni_size_weights
);
8058 if (profile_status_for_fn (cfun
) == PROFILE_READ
)
8059 record
->time
[after_pass
]
8060 += estimate_num_insns (gsi_stmt (i
),
8061 &eni_time_weights
) * bb
->count
;
8062 else if (profile_status_for_fn (cfun
) == PROFILE_GUESSED
)
8063 record
->time
[after_pass
]
8064 += estimate_num_insns (gsi_stmt (i
),
8065 &eni_time_weights
) * bb
->frequency
;
8069 struct cfg_hooks gimple_cfg_hooks
= {
8071 gimple_verify_flow_info
,
8072 gimple_dump_bb
, /* dump_bb */
8073 gimple_dump_bb_for_graph
, /* dump_bb_for_graph */
8074 create_bb
, /* create_basic_block */
8075 gimple_redirect_edge_and_branch
, /* redirect_edge_and_branch */
8076 gimple_redirect_edge_and_branch_force
, /* redirect_edge_and_branch_force */
8077 gimple_can_remove_branch_p
, /* can_remove_branch_p */
8078 remove_bb
, /* delete_basic_block */
8079 gimple_split_block
, /* split_block */
8080 gimple_move_block_after
, /* move_block_after */
8081 gimple_can_merge_blocks_p
, /* can_merge_blocks_p */
8082 gimple_merge_blocks
, /* merge_blocks */
8083 gimple_predict_edge
, /* predict_edge */
8084 gimple_predicted_by_p
, /* predicted_by_p */
8085 gimple_can_duplicate_bb_p
, /* can_duplicate_block_p */
8086 gimple_duplicate_bb
, /* duplicate_block */
8087 gimple_split_edge
, /* split_edge */
8088 gimple_make_forwarder_block
, /* make_forward_block */
8089 NULL
, /* tidy_fallthru_edge */
8090 NULL
, /* force_nonfallthru */
8091 gimple_block_ends_with_call_p
,/* block_ends_with_call_p */
8092 gimple_block_ends_with_condjump_p
, /* block_ends_with_condjump_p */
8093 gimple_flow_call_edges_add
, /* flow_call_edges_add */
8094 gimple_execute_on_growing_pred
, /* execute_on_growing_pred */
8095 gimple_execute_on_shrinking_pred
, /* execute_on_shrinking_pred */
8096 gimple_duplicate_loop_to_header_edge
, /* duplicate loop for trees */
8097 gimple_lv_add_condition_to_bb
, /* lv_add_condition_to_bb */
8098 gimple_lv_adjust_loop_header_phi
, /* lv_adjust_loop_header_phi*/
8099 extract_true_false_edges_from_block
, /* extract_cond_bb_edges */
8100 flush_pending_stmts
, /* flush_pending_stmts */
8101 gimple_empty_block_p
, /* block_empty_p */
8102 gimple_split_block_before_cond_jump
, /* split_block_before_cond_jump */
8103 gimple_account_profile_record
,
8107 /* Split all critical edges. */
8110 split_critical_edges (void)
8116 /* split_edge can redirect edges out of SWITCH_EXPRs, which can get
8117 expensive. So we want to enable recording of edge to CASE_LABEL_EXPR
8118 mappings around the calls to split_edge. */
8119 start_recording_case_labels ();
8120 FOR_ALL_BB_FN (bb
, cfun
)
8122 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
8124 if (EDGE_CRITICAL_P (e
) && !(e
->flags
& EDGE_ABNORMAL
))
8126 /* PRE inserts statements to edges and expects that
8127 since split_critical_edges was done beforehand, committing edge
8128 insertions will not split more edges. In addition to critical
8129 edges we must split edges that have multiple successors and
8130 end by control flow statements, such as RESX.
8131 Go ahead and split them too. This matches the logic in
8132 gimple_find_edge_insert_loc. */
8133 else if ((!single_pred_p (e
->dest
)
8134 || !gimple_seq_empty_p (phi_nodes (e
->dest
))
8135 || e
->dest
== EXIT_BLOCK_PTR_FOR_FN (cfun
))
8136 && e
->src
!= ENTRY_BLOCK_PTR_FOR_FN (cfun
)
8137 && !(e
->flags
& EDGE_ABNORMAL
))
8139 gimple_stmt_iterator gsi
;
8141 gsi
= gsi_last_bb (e
->src
);
8142 if (!gsi_end_p (gsi
)
8143 && stmt_ends_bb_p (gsi_stmt (gsi
))
8144 && (gimple_code (gsi_stmt (gsi
)) != GIMPLE_RETURN
8145 && !gimple_call_builtin_p (gsi_stmt (gsi
),
8151 end_recording_case_labels ();
8157 const pass_data pass_data_split_crit_edges
=
8159 GIMPLE_PASS
, /* type */
8160 "crited", /* name */
8161 OPTGROUP_NONE
, /* optinfo_flags */
8162 TV_TREE_SPLIT_EDGES
, /* tv_id */
8163 PROP_cfg
, /* properties_required */
8164 PROP_no_crit_edges
, /* properties_provided */
8165 0, /* properties_destroyed */
8166 0, /* todo_flags_start */
8167 0, /* todo_flags_finish */
8170 class pass_split_crit_edges
: public gimple_opt_pass
8173 pass_split_crit_edges (gcc::context
*ctxt
)
8174 : gimple_opt_pass (pass_data_split_crit_edges
, ctxt
)
8177 /* opt_pass methods: */
8178 virtual unsigned int execute (function
*) { return split_critical_edges (); }
8180 opt_pass
* clone () { return new pass_split_crit_edges (m_ctxt
); }
8181 }; // class pass_split_crit_edges
8186 make_pass_split_crit_edges (gcc::context
*ctxt
)
8188 return new pass_split_crit_edges (ctxt
);
8192 /* Build a ternary operation and gimplify it. Emit code before GSI.
8193 Return the gimple_val holding the result. */
8196 gimplify_build3 (gimple_stmt_iterator
*gsi
, enum tree_code code
,
8197 tree type
, tree a
, tree b
, tree c
)
8200 location_t loc
= gimple_location (gsi_stmt (*gsi
));
8202 ret
= fold_build3_loc (loc
, code
, type
, a
, b
, c
);
8205 return force_gimple_operand_gsi (gsi
, ret
, true, NULL
, true,
8209 /* Build a binary operation and gimplify it. Emit code before GSI.
8210 Return the gimple_val holding the result. */
8213 gimplify_build2 (gimple_stmt_iterator
*gsi
, enum tree_code code
,
8214 tree type
, tree a
, tree b
)
8218 ret
= fold_build2_loc (gimple_location (gsi_stmt (*gsi
)), code
, type
, a
, b
);
8221 return force_gimple_operand_gsi (gsi
, ret
, true, NULL
, true,
8225 /* Build a unary operation and gimplify it. Emit code before GSI.
8226 Return the gimple_val holding the result. */
8229 gimplify_build1 (gimple_stmt_iterator
*gsi
, enum tree_code code
, tree type
,
8234 ret
= fold_build1_loc (gimple_location (gsi_stmt (*gsi
)), code
, type
, a
);
8237 return force_gimple_operand_gsi (gsi
, ret
, true, NULL
, true,
8243 /* Given a basic block B which ends with a conditional and has
8244 precisely two successors, determine which of the edges is taken if
8245 the conditional is true and which is taken if the conditional is
8246 false. Set TRUE_EDGE and FALSE_EDGE appropriately. */
8249 extract_true_false_edges_from_block (basic_block b
,
8253 edge e
= EDGE_SUCC (b
, 0);
8255 if (e
->flags
& EDGE_TRUE_VALUE
)
8258 *false_edge
= EDGE_SUCC (b
, 1);
8263 *true_edge
= EDGE_SUCC (b
, 1);
8267 /* Emit return warnings. */
8271 const pass_data pass_data_warn_function_return
=
8273 GIMPLE_PASS
, /* type */
8274 "*warn_function_return", /* name */
8275 OPTGROUP_NONE
, /* optinfo_flags */
8276 TV_NONE
, /* tv_id */
8277 PROP_cfg
, /* properties_required */
8278 0, /* properties_provided */
8279 0, /* properties_destroyed */
8280 0, /* todo_flags_start */
8281 0, /* todo_flags_finish */
8284 class pass_warn_function_return
: public gimple_opt_pass
8287 pass_warn_function_return (gcc::context
*ctxt
)
8288 : gimple_opt_pass (pass_data_warn_function_return
, ctxt
)
8291 /* opt_pass methods: */
8292 virtual unsigned int execute (function
*);
8294 }; // class pass_warn_function_return
8297 pass_warn_function_return::execute (function
*fun
)
8299 source_location location
;
8304 if (!targetm
.warn_func_return (fun
->decl
))
8307 /* If we have a path to EXIT, then we do return. */
8308 if (TREE_THIS_VOLATILE (fun
->decl
)
8309 && EDGE_COUNT (EXIT_BLOCK_PTR_FOR_FN (fun
)->preds
) > 0)
8311 location
= UNKNOWN_LOCATION
;
8312 FOR_EACH_EDGE (e
, ei
, EXIT_BLOCK_PTR_FOR_FN (fun
)->preds
)
8314 last
= last_stmt (e
->src
);
8315 if ((gimple_code (last
) == GIMPLE_RETURN
8316 || gimple_call_builtin_p (last
, BUILT_IN_RETURN
))
8317 && (location
= gimple_location (last
)) != UNKNOWN_LOCATION
)
8320 if (location
== UNKNOWN_LOCATION
)
8321 location
= cfun
->function_end_locus
;
8322 warning_at (location
, 0, "%<noreturn%> function does return");
8325 /* If we see "return;" in some basic block, then we do reach the end
8326 without returning a value. */
8327 else if (warn_return_type
8328 && !TREE_NO_WARNING (fun
->decl
)
8329 && EDGE_COUNT (EXIT_BLOCK_PTR_FOR_FN (fun
)->preds
) > 0
8330 && !VOID_TYPE_P (TREE_TYPE (TREE_TYPE (fun
->decl
))))
8332 FOR_EACH_EDGE (e
, ei
, EXIT_BLOCK_PTR_FOR_FN (fun
)->preds
)
8334 gimple last
= last_stmt (e
->src
);
8335 if (gimple_code (last
) == GIMPLE_RETURN
8336 && gimple_return_retval (last
) == NULL
8337 && !gimple_no_warning_p (last
))
8339 location
= gimple_location (last
);
8340 if (location
== UNKNOWN_LOCATION
)
8341 location
= fun
->function_end_locus
;
8342 warning_at (location
, OPT_Wreturn_type
, "control reaches end of non-void function");
8343 TREE_NO_WARNING (fun
->decl
) = 1;
8354 make_pass_warn_function_return (gcc::context
*ctxt
)
8356 return new pass_warn_function_return (ctxt
);
8359 /* Walk a gimplified function and warn for functions whose return value is
8360 ignored and attribute((warn_unused_result)) is set. This is done before
8361 inlining, so we don't have to worry about that. */
8364 do_warn_unused_result (gimple_seq seq
)
8367 gimple_stmt_iterator i
;
8369 for (i
= gsi_start (seq
); !gsi_end_p (i
); gsi_next (&i
))
8371 gimple g
= gsi_stmt (i
);
8373 switch (gimple_code (g
))
8376 do_warn_unused_result (gimple_bind_body (g
));
8379 do_warn_unused_result (gimple_try_eval (g
));
8380 do_warn_unused_result (gimple_try_cleanup (g
));
8383 do_warn_unused_result (gimple_catch_handler (g
));
8385 case GIMPLE_EH_FILTER
:
8386 do_warn_unused_result (gimple_eh_filter_failure (g
));
8390 if (gimple_call_lhs (g
))
8392 if (gimple_call_internal_p (g
))
8395 /* This is a naked call, as opposed to a GIMPLE_CALL with an
8396 LHS. All calls whose value is ignored should be
8397 represented like this. Look for the attribute. */
8398 fdecl
= gimple_call_fndecl (g
);
8399 ftype
= gimple_call_fntype (g
);
8401 if (lookup_attribute ("warn_unused_result", TYPE_ATTRIBUTES (ftype
)))
8403 location_t loc
= gimple_location (g
);
8406 warning_at (loc
, OPT_Wunused_result
,
8407 "ignoring return value of %qD, "
8408 "declared with attribute warn_unused_result",
8411 warning_at (loc
, OPT_Wunused_result
,
8412 "ignoring return value of function "
8413 "declared with attribute warn_unused_result");
8418 /* Not a container, not a call, or a call whose value is used. */
8426 const pass_data pass_data_warn_unused_result
=
8428 GIMPLE_PASS
, /* type */
8429 "*warn_unused_result", /* name */
8430 OPTGROUP_NONE
, /* optinfo_flags */
8431 TV_NONE
, /* tv_id */
8432 PROP_gimple_any
, /* properties_required */
8433 0, /* properties_provided */
8434 0, /* properties_destroyed */
8435 0, /* todo_flags_start */
8436 0, /* todo_flags_finish */
8439 class pass_warn_unused_result
: public gimple_opt_pass
8442 pass_warn_unused_result (gcc::context
*ctxt
)
8443 : gimple_opt_pass (pass_data_warn_unused_result
, ctxt
)
8446 /* opt_pass methods: */
8447 virtual bool gate (function
*) { return flag_warn_unused_result
; }
8448 virtual unsigned int execute (function
*)
8450 do_warn_unused_result (gimple_body (current_function_decl
));
8454 }; // class pass_warn_unused_result
8459 make_pass_warn_unused_result (gcc::context
*ctxt
)
8461 return new pass_warn_unused_result (ctxt
);
8464 /* IPA passes, compilation of earlier functions or inlining
8465 might have changed some properties, such as marked functions nothrow,
8466 pure, const or noreturn.
8467 Remove redundant edges and basic blocks, and create new ones if necessary.
8469 This pass can't be executed as stand alone pass from pass manager, because
8470 in between inlining and this fixup the verify_flow_info would fail. */
8473 execute_fixup_cfg (void)
8476 gimple_stmt_iterator gsi
;
8478 gcov_type count_scale
;
8483 = GCOV_COMPUTE_SCALE (cgraph_node::get (current_function_decl
)->count
,
8484 ENTRY_BLOCK_PTR_FOR_FN (cfun
)->count
);
8486 ENTRY_BLOCK_PTR_FOR_FN (cfun
)->count
=
8487 cgraph_node::get (current_function_decl
)->count
;
8488 EXIT_BLOCK_PTR_FOR_FN (cfun
)->count
=
8489 apply_scale (EXIT_BLOCK_PTR_FOR_FN (cfun
)->count
,
8492 FOR_EACH_EDGE (e
, ei
, ENTRY_BLOCK_PTR_FOR_FN (cfun
)->succs
)
8493 e
->count
= apply_scale (e
->count
, count_scale
);
8495 FOR_EACH_BB_FN (bb
, cfun
)
8497 bb
->count
= apply_scale (bb
->count
, count_scale
);
8498 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
);)
8500 gimple stmt
= gsi_stmt (gsi
);
8501 tree decl
= is_gimple_call (stmt
)
8502 ? gimple_call_fndecl (stmt
)
8506 int flags
= gimple_call_flags (stmt
);
8507 if (flags
& (ECF_CONST
| ECF_PURE
| ECF_LOOPING_CONST_OR_PURE
))
8509 if (gimple_purge_dead_abnormal_call_edges (bb
))
8510 todo
|= TODO_cleanup_cfg
;
8512 if (gimple_in_ssa_p (cfun
))
8514 todo
|= TODO_update_ssa
| TODO_cleanup_cfg
;
8519 if (flags
& ECF_NORETURN
8520 && fixup_noreturn_call (stmt
))
8521 todo
|= TODO_cleanup_cfg
;
8524 /* Remove stores to variables we marked write-only.
8525 Keep access when store has side effect, i.e. in case when source
8527 if (gimple_store_p (stmt
)
8528 && !gimple_has_side_effects (stmt
))
8530 tree lhs
= get_base_address (gimple_get_lhs (stmt
));
8532 if (TREE_CODE (lhs
) == VAR_DECL
8533 && (TREE_STATIC (lhs
) || DECL_EXTERNAL (lhs
))
8534 && varpool_node::get (lhs
)->writeonly
)
8536 unlink_stmt_vdef (stmt
);
8537 gsi_remove (&gsi
, true);
8538 release_defs (stmt
);
8539 todo
|= TODO_update_ssa
| TODO_cleanup_cfg
;
8543 /* For calls we can simply remove LHS when it is known
8544 to be write-only. */
8545 if (is_gimple_call (stmt
)
8546 && gimple_get_lhs (stmt
))
8548 tree lhs
= get_base_address (gimple_get_lhs (stmt
));
8550 if (TREE_CODE (lhs
) == VAR_DECL
8551 && (TREE_STATIC (lhs
) || DECL_EXTERNAL (lhs
))
8552 && varpool_node::get (lhs
)->writeonly
)
8554 gimple_call_set_lhs (stmt
, NULL
);
8556 todo
|= TODO_update_ssa
| TODO_cleanup_cfg
;
8560 if (maybe_clean_eh_stmt (stmt
)
8561 && gimple_purge_dead_eh_edges (bb
))
8562 todo
|= TODO_cleanup_cfg
;
8566 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
8567 e
->count
= apply_scale (e
->count
, count_scale
);
8569 /* If we have a basic block with no successors that does not
8570 end with a control statement or a noreturn call end it with
8571 a call to __builtin_unreachable. This situation can occur
8572 when inlining a noreturn call that does in fact return. */
8573 if (EDGE_COUNT (bb
->succs
) == 0)
8575 gimple stmt
= last_stmt (bb
);
8577 || (!is_ctrl_stmt (stmt
)
8578 && (!is_gimple_call (stmt
)
8579 || (gimple_call_flags (stmt
) & ECF_NORETURN
) == 0)))
8581 if (stmt
&& is_gimple_call (stmt
))
8582 gimple_call_set_ctrl_altering (stmt
, false);
8583 stmt
= gimple_build_call
8584 (builtin_decl_implicit (BUILT_IN_UNREACHABLE
), 0);
8585 gimple_stmt_iterator gsi
= gsi_last_bb (bb
);
8586 gsi_insert_after (&gsi
, stmt
, GSI_NEW_STMT
);
8590 if (count_scale
!= REG_BR_PROB_BASE
)
8591 compute_function_frequency ();
8593 /* Dump a textual representation of the flowgraph. */
8595 gimple_dump_cfg (dump_file
, dump_flags
);
8598 && (todo
& TODO_cleanup_cfg
))
8599 loops_state_set (LOOPS_NEED_FIXUP
);
8606 const pass_data pass_data_fixup_cfg
=
8608 GIMPLE_PASS
, /* type */
8609 "*free_cfg_annotations", /* name */
8610 OPTGROUP_NONE
, /* optinfo_flags */
8611 TV_NONE
, /* tv_id */
8612 PROP_cfg
, /* properties_required */
8613 0, /* properties_provided */
8614 0, /* properties_destroyed */
8615 0, /* todo_flags_start */
8616 0, /* todo_flags_finish */
8619 class pass_fixup_cfg
: public gimple_opt_pass
8622 pass_fixup_cfg (gcc::context
*ctxt
)
8623 : gimple_opt_pass (pass_data_fixup_cfg
, ctxt
)
8626 /* opt_pass methods: */
8627 opt_pass
* clone () { return new pass_fixup_cfg (m_ctxt
); }
8628 virtual unsigned int execute (function
*) { return execute_fixup_cfg (); }
8630 }; // class pass_fixup_cfg
8635 make_pass_fixup_cfg (gcc::context
*ctxt
)
8637 return new pass_fixup_cfg (ctxt
);
8640 /* Garbage collection support for edge_def. */
8642 extern void gt_ggc_mx (tree
&);
8643 extern void gt_ggc_mx (gimple
&);
8644 extern void gt_ggc_mx (rtx
&);
8645 extern void gt_ggc_mx (basic_block
&);
8648 gt_ggc_mx (rtx_insn
*& x
)
8651 gt_ggc_mx_rtx_def ((void *) x
);
8655 gt_ggc_mx (edge_def
*e
)
8657 tree block
= LOCATION_BLOCK (e
->goto_locus
);
8659 gt_ggc_mx (e
->dest
);
8660 if (current_ir_type () == IR_GIMPLE
)
8661 gt_ggc_mx (e
->insns
.g
);
8663 gt_ggc_mx (e
->insns
.r
);
8667 /* PCH support for edge_def. */
8669 extern void gt_pch_nx (tree
&);
8670 extern void gt_pch_nx (gimple
&);
8671 extern void gt_pch_nx (rtx
&);
8672 extern void gt_pch_nx (basic_block
&);
8675 gt_pch_nx (rtx_insn
*& x
)
8678 gt_pch_nx_rtx_def ((void *) x
);
8682 gt_pch_nx (edge_def
*e
)
8684 tree block
= LOCATION_BLOCK (e
->goto_locus
);
8686 gt_pch_nx (e
->dest
);
8687 if (current_ir_type () == IR_GIMPLE
)
8688 gt_pch_nx (e
->insns
.g
);
8690 gt_pch_nx (e
->insns
.r
);
8695 gt_pch_nx (edge_def
*e
, gt_pointer_operator op
, void *cookie
)
8697 tree block
= LOCATION_BLOCK (e
->goto_locus
);
8698 op (&(e
->src
), cookie
);
8699 op (&(e
->dest
), cookie
);
8700 if (current_ir_type () == IR_GIMPLE
)
8701 op (&(e
->insns
.g
), cookie
);
8703 op (&(e
->insns
.r
), cookie
);
8704 op (&(block
), cookie
);