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"
32 #include "basic-block.h"
35 #include "gimple-pretty-print.h"
36 #include "tree-ssa-alias.h"
37 #include "internal-fn.h"
38 #include "gimple-fold.h"
40 #include "gimple-expr.h"
43 #include "gimple-iterator.h"
44 #include "gimplify-me.h"
45 #include "gimple-walk.h"
46 #include "gimple-ssa.h"
49 #include "tree-phinodes.h"
50 #include "ssa-iterators.h"
51 #include "stringpool.h"
52 #include "tree-ssanames.h"
53 #include "tree-ssa-loop-manip.h"
54 #include "tree-ssa-loop-niter.h"
55 #include "tree-into-ssa.h"
59 #include "tree-dump.h"
60 #include "tree-pass.h"
61 #include "diagnostic-core.h"
64 #include "tree-ssa-propagate.h"
65 #include "value-prof.h"
66 #include "tree-inline.h"
68 #include "tree-ssa-live.h"
70 #include "tree-cfgcleanup.h"
72 #include "wide-int-print.h"
74 /* This file contains functions for building the Control Flow Graph (CFG)
75 for a function tree. */
77 /* Local declarations. */
79 /* Initial capacity for the basic block array. */
80 static const int initial_cfg_capacity
= 20;
82 /* This hash table allows us to efficiently lookup all CASE_LABEL_EXPRs
83 which use a particular edge. The CASE_LABEL_EXPRs are chained together
84 via their CASE_CHAIN field, which we clear after we're done with the
85 hash table to prevent problems with duplication of GIMPLE_SWITCHes.
87 Access to this list of CASE_LABEL_EXPRs allows us to efficiently
88 update the case vector in response to edge redirections.
90 Right now this table is set up and torn down at key points in the
91 compilation process. It would be nice if we could make the table
92 more persistent. The key is getting notification of changes to
93 the CFG (particularly edge removal, creation and redirection). */
95 static hash_map
<edge
, tree
> *edge_to_cases
;
97 /* If we record edge_to_cases, this bitmap will hold indexes
98 of basic blocks that end in a GIMPLE_SWITCH which we touched
99 due to edge manipulations. */
101 static bitmap touched_switch_bbs
;
103 /* CFG statistics. */
106 long num_merged_labels
;
109 static struct cfg_stats_d cfg_stats
;
111 /* Hash table to store last discriminator assigned for each locus. */
112 struct locus_discrim_map
118 /* Hashtable helpers. */
120 struct locus_discrim_hasher
: typed_free_remove
<locus_discrim_map
>
122 typedef locus_discrim_map value_type
;
123 typedef locus_discrim_map compare_type
;
124 static inline hashval_t
hash (const value_type
*);
125 static inline bool equal (const value_type
*, const compare_type
*);
128 /* Trivial hash function for a location_t. ITEM is a pointer to
129 a hash table entry that maps a location_t to a discriminator. */
132 locus_discrim_hasher::hash (const value_type
*item
)
134 return LOCATION_LINE (item
->locus
);
137 /* Equality function for the locus-to-discriminator map. A and B
138 point to the two hash table entries to compare. */
141 locus_discrim_hasher::equal (const value_type
*a
, const compare_type
*b
)
143 return LOCATION_LINE (a
->locus
) == LOCATION_LINE (b
->locus
);
146 static hash_table
<locus_discrim_hasher
> *discriminator_per_locus
;
148 /* Basic blocks and flowgraphs. */
149 static void make_blocks (gimple_seq
);
152 static void make_edges (void);
153 static void assign_discriminators (void);
154 static void make_cond_expr_edges (basic_block
);
155 static void make_gimple_switch_edges (gimple_switch
, basic_block
);
156 static bool make_goto_expr_edges (basic_block
);
157 static void make_gimple_asm_edges (basic_block
);
158 static edge
gimple_redirect_edge_and_branch (edge
, basic_block
);
159 static edge
gimple_try_redirect_by_replacing_jump (edge
, basic_block
);
161 /* Various helpers. */
162 static inline bool stmt_starts_bb_p (gimple
, gimple
);
163 static int gimple_verify_flow_info (void);
164 static void gimple_make_forwarder_block (edge
);
165 static gimple
first_non_label_stmt (basic_block
);
166 static bool verify_gimple_transaction (gimple_transaction
);
167 static bool call_can_make_abnormal_goto (gimple
);
169 /* Flowgraph optimization and cleanup. */
170 static void gimple_merge_blocks (basic_block
, basic_block
);
171 static bool gimple_can_merge_blocks_p (basic_block
, basic_block
);
172 static void remove_bb (basic_block
);
173 static edge
find_taken_edge_computed_goto (basic_block
, tree
);
174 static edge
find_taken_edge_cond_expr (basic_block
, tree
);
175 static edge
find_taken_edge_switch_expr (gimple_switch
, basic_block
, tree
);
176 static tree
find_case_label_for_value (gimple_switch
, tree
);
179 init_empty_tree_cfg_for_function (struct function
*fn
)
181 /* Initialize the basic block array. */
183 profile_status_for_fn (fn
) = PROFILE_ABSENT
;
184 n_basic_blocks_for_fn (fn
) = NUM_FIXED_BLOCKS
;
185 last_basic_block_for_fn (fn
) = NUM_FIXED_BLOCKS
;
186 vec_alloc (basic_block_info_for_fn (fn
), initial_cfg_capacity
);
187 vec_safe_grow_cleared (basic_block_info_for_fn (fn
),
188 initial_cfg_capacity
);
190 /* Build a mapping of labels to their associated blocks. */
191 vec_alloc (label_to_block_map_for_fn (fn
), initial_cfg_capacity
);
192 vec_safe_grow_cleared (label_to_block_map_for_fn (fn
),
193 initial_cfg_capacity
);
195 SET_BASIC_BLOCK_FOR_FN (fn
, ENTRY_BLOCK
, ENTRY_BLOCK_PTR_FOR_FN (fn
));
196 SET_BASIC_BLOCK_FOR_FN (fn
, EXIT_BLOCK
, EXIT_BLOCK_PTR_FOR_FN (fn
));
198 ENTRY_BLOCK_PTR_FOR_FN (fn
)->next_bb
199 = EXIT_BLOCK_PTR_FOR_FN (fn
);
200 EXIT_BLOCK_PTR_FOR_FN (fn
)->prev_bb
201 = ENTRY_BLOCK_PTR_FOR_FN (fn
);
205 init_empty_tree_cfg (void)
207 init_empty_tree_cfg_for_function (cfun
);
210 /*---------------------------------------------------------------------------
212 ---------------------------------------------------------------------------*/
214 /* Entry point to the CFG builder for trees. SEQ is the sequence of
215 statements to be added to the flowgraph. */
218 build_gimple_cfg (gimple_seq seq
)
220 /* Register specific gimple functions. */
221 gimple_register_cfg_hooks ();
223 memset ((void *) &cfg_stats
, 0, sizeof (cfg_stats
));
225 init_empty_tree_cfg ();
229 /* Make sure there is always at least one block, even if it's empty. */
230 if (n_basic_blocks_for_fn (cfun
) == NUM_FIXED_BLOCKS
)
231 create_empty_bb (ENTRY_BLOCK_PTR_FOR_FN (cfun
));
233 /* Adjust the size of the array. */
234 if (basic_block_info_for_fn (cfun
)->length ()
235 < (size_t) n_basic_blocks_for_fn (cfun
))
236 vec_safe_grow_cleared (basic_block_info_for_fn (cfun
),
237 n_basic_blocks_for_fn (cfun
));
239 /* To speed up statement iterator walks, we first purge dead labels. */
240 cleanup_dead_labels ();
242 /* Group case nodes to reduce the number of edges.
243 We do this after cleaning up dead labels because otherwise we miss
244 a lot of obvious case merging opportunities. */
245 group_case_labels ();
247 /* Create the edges of the flowgraph. */
248 discriminator_per_locus
= new hash_table
<locus_discrim_hasher
> (13);
250 assign_discriminators ();
251 cleanup_dead_labels ();
252 delete discriminator_per_locus
;
253 discriminator_per_locus
= NULL
;
257 /* Look for ANNOTATE calls with loop annotation kind; if found, remove
258 them and propagate the information to the loop. We assume that the
259 annotations come immediately before the condition of the loop. */
262 replace_loop_annotate ()
266 gimple_stmt_iterator gsi
;
269 FOR_EACH_LOOP (loop
, 0)
271 gsi
= gsi_last_bb (loop
->header
);
272 stmt
= gsi_stmt (gsi
);
273 if (!(stmt
&& gimple_code (stmt
) == GIMPLE_COND
))
275 for (gsi_prev_nondebug (&gsi
); !gsi_end_p (gsi
); gsi_prev (&gsi
))
277 stmt
= gsi_stmt (gsi
);
278 if (gimple_code (stmt
) != GIMPLE_CALL
)
280 if (!gimple_call_internal_p (stmt
)
281 || gimple_call_internal_fn (stmt
) != IFN_ANNOTATE
)
283 switch ((annot_expr_kind
) tree_to_shwi (gimple_call_arg (stmt
, 1)))
285 case annot_expr_ivdep_kind
:
286 loop
->safelen
= INT_MAX
;
288 case annot_expr_no_vector_kind
:
289 loop
->dont_vectorize
= true;
291 case annot_expr_vector_kind
:
292 loop
->force_vectorize
= true;
293 cfun
->has_force_vectorize_loops
= true;
298 stmt
= gimple_build_assign (gimple_call_lhs (stmt
),
299 gimple_call_arg (stmt
, 0));
300 gsi_replace (&gsi
, stmt
, true);
304 /* Remove IFN_ANNOTATE. Safeguard for the case loop->latch == NULL. */
305 FOR_EACH_BB_FN (bb
, cfun
)
307 for (gsi
= gsi_last_bb (bb
); !gsi_end_p (gsi
); gsi_prev (&gsi
))
309 stmt
= gsi_stmt (gsi
);
310 if (gimple_code (stmt
) != GIMPLE_CALL
)
312 if (!gimple_call_internal_p (stmt
)
313 || gimple_call_internal_fn (stmt
) != IFN_ANNOTATE
)
315 switch ((annot_expr_kind
) tree_to_shwi (gimple_call_arg (stmt
, 1)))
317 case annot_expr_ivdep_kind
:
318 case annot_expr_no_vector_kind
:
319 case annot_expr_vector_kind
:
324 warning_at (gimple_location (stmt
), 0, "ignoring loop annotation");
325 stmt
= gimple_build_assign (gimple_call_lhs (stmt
),
326 gimple_call_arg (stmt
, 0));
327 gsi_replace (&gsi
, stmt
, true);
334 execute_build_cfg (void)
336 gimple_seq body
= gimple_body (current_function_decl
);
338 build_gimple_cfg (body
);
339 gimple_set_body (current_function_decl
, NULL
);
340 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
342 fprintf (dump_file
, "Scope blocks:\n");
343 dump_scope_blocks (dump_file
, dump_flags
);
346 loop_optimizer_init (AVOID_CFG_MODIFICATIONS
);
347 replace_loop_annotate ();
353 const pass_data pass_data_build_cfg
=
355 GIMPLE_PASS
, /* type */
357 OPTGROUP_NONE
, /* optinfo_flags */
358 TV_TREE_CFG
, /* tv_id */
359 PROP_gimple_leh
, /* properties_required */
360 ( PROP_cfg
| PROP_loops
), /* properties_provided */
361 0, /* properties_destroyed */
362 0, /* todo_flags_start */
363 0, /* todo_flags_finish */
366 class pass_build_cfg
: public gimple_opt_pass
369 pass_build_cfg (gcc::context
*ctxt
)
370 : gimple_opt_pass (pass_data_build_cfg
, ctxt
)
373 /* opt_pass methods: */
374 virtual unsigned int execute (function
*) { return execute_build_cfg (); }
376 }; // class pass_build_cfg
381 make_pass_build_cfg (gcc::context
*ctxt
)
383 return new pass_build_cfg (ctxt
);
387 /* Return true if T is a computed goto. */
390 computed_goto_p (gimple t
)
392 return (gimple_code (t
) == GIMPLE_GOTO
393 && TREE_CODE (gimple_goto_dest (t
)) != LABEL_DECL
);
396 /* Returns true for edge E where e->src ends with a GIMPLE_COND and
397 the other edge points to a bb with just __builtin_unreachable ().
398 I.e. return true for C->M edge in:
406 __builtin_unreachable ();
410 assert_unreachable_fallthru_edge_p (edge e
)
412 basic_block pred_bb
= e
->src
;
413 gimple last
= last_stmt (pred_bb
);
414 if (last
&& gimple_code (last
) == GIMPLE_COND
)
416 basic_block other_bb
= EDGE_SUCC (pred_bb
, 0)->dest
;
417 if (other_bb
== e
->dest
)
418 other_bb
= EDGE_SUCC (pred_bb
, 1)->dest
;
419 if (EDGE_COUNT (other_bb
->succs
) == 0)
421 gimple_stmt_iterator gsi
= gsi_after_labels (other_bb
);
426 stmt
= gsi_stmt (gsi
);
427 while (is_gimple_debug (stmt
) || gimple_clobber_p (stmt
))
432 stmt
= gsi_stmt (gsi
);
434 return gimple_call_builtin_p (stmt
, BUILT_IN_UNREACHABLE
);
441 /* Initialize GF_CALL_CTRL_ALTERING flag, which indicates the call
442 could alter control flow except via eh. We initialize the flag at
443 CFG build time and only ever clear it later. */
446 gimple_call_initialize_ctrl_altering (gimple stmt
)
448 int flags
= gimple_call_flags (stmt
);
450 /* A call alters control flow if it can make an abnormal goto. */
451 if (call_can_make_abnormal_goto (stmt
)
452 /* A call also alters control flow if it does not return. */
453 || flags
& ECF_NORETURN
454 /* TM ending statements have backedges out of the transaction.
455 Return true so we split the basic block containing them.
456 Note that the TM_BUILTIN test is merely an optimization. */
457 || ((flags
& ECF_TM_BUILTIN
)
458 && is_tm_ending_fndecl (gimple_call_fndecl (stmt
)))
459 /* BUILT_IN_RETURN call is same as return statement. */
460 || gimple_call_builtin_p (stmt
, BUILT_IN_RETURN
))
461 gimple_call_set_ctrl_altering (stmt
, true);
463 gimple_call_set_ctrl_altering (stmt
, false);
467 /* Build a flowgraph for the sequence of stmts SEQ. */
470 make_blocks (gimple_seq seq
)
472 gimple_stmt_iterator i
= gsi_start (seq
);
474 bool start_new_block
= true;
475 bool first_stmt_of_seq
= true;
476 basic_block bb
= ENTRY_BLOCK_PTR_FOR_FN (cfun
);
478 while (!gsi_end_p (i
))
485 if (stmt
&& is_gimple_call (stmt
))
486 gimple_call_initialize_ctrl_altering (stmt
);
488 /* If the statement starts a new basic block or if we have determined
489 in a previous pass that we need to create a new block for STMT, do
491 if (start_new_block
|| stmt_starts_bb_p (stmt
, prev_stmt
))
493 if (!first_stmt_of_seq
)
494 gsi_split_seq_before (&i
, &seq
);
495 bb
= create_basic_block (seq
, NULL
, bb
);
496 start_new_block
= false;
499 /* Now add STMT to BB and create the subgraphs for special statement
501 gimple_set_bb (stmt
, bb
);
503 /* If STMT is a basic block terminator, set START_NEW_BLOCK for the
505 if (stmt_ends_bb_p (stmt
))
507 /* If the stmt can make abnormal goto use a new temporary
508 for the assignment to the LHS. This makes sure the old value
509 of the LHS is available on the abnormal edge. Otherwise
510 we will end up with overlapping life-ranges for abnormal
512 if (gimple_has_lhs (stmt
)
513 && stmt_can_make_abnormal_goto (stmt
)
514 && is_gimple_reg_type (TREE_TYPE (gimple_get_lhs (stmt
))))
516 tree lhs
= gimple_get_lhs (stmt
);
517 tree tmp
= create_tmp_var (TREE_TYPE (lhs
), NULL
);
518 gimple s
= gimple_build_assign (lhs
, tmp
);
519 gimple_set_location (s
, gimple_location (stmt
));
520 gimple_set_block (s
, gimple_block (stmt
));
521 gimple_set_lhs (stmt
, tmp
);
522 if (TREE_CODE (TREE_TYPE (tmp
)) == COMPLEX_TYPE
523 || TREE_CODE (TREE_TYPE (tmp
)) == VECTOR_TYPE
)
524 DECL_GIMPLE_REG_P (tmp
) = 1;
525 gsi_insert_after (&i
, s
, GSI_SAME_STMT
);
527 start_new_block
= true;
531 first_stmt_of_seq
= false;
536 /* Create and return a new empty basic block after bb AFTER. */
539 create_bb (void *h
, void *e
, basic_block after
)
545 /* Create and initialize a new basic block. Since alloc_block uses
546 GC allocation that clears memory to allocate a basic block, we do
547 not have to clear the newly allocated basic block here. */
550 bb
->index
= last_basic_block_for_fn (cfun
);
552 set_bb_seq (bb
, h
? (gimple_seq
) h
: NULL
);
554 /* Add the new block to the linked list of blocks. */
555 link_block (bb
, after
);
557 /* Grow the basic block array if needed. */
558 if ((size_t) last_basic_block_for_fn (cfun
)
559 == basic_block_info_for_fn (cfun
)->length ())
562 (last_basic_block_for_fn (cfun
)
563 + (last_basic_block_for_fn (cfun
) + 3) / 4);
564 vec_safe_grow_cleared (basic_block_info_for_fn (cfun
), new_size
);
567 /* Add the newly created block to the array. */
568 SET_BASIC_BLOCK_FOR_FN (cfun
, last_basic_block_for_fn (cfun
), bb
);
570 n_basic_blocks_for_fn (cfun
)++;
571 last_basic_block_for_fn (cfun
)++;
577 /*---------------------------------------------------------------------------
579 ---------------------------------------------------------------------------*/
581 /* Fold COND_EXPR_COND of each COND_EXPR. */
584 fold_cond_expr_cond (void)
588 FOR_EACH_BB_FN (bb
, cfun
)
590 gimple stmt
= last_stmt (bb
);
592 if (stmt
&& gimple_code (stmt
) == GIMPLE_COND
)
594 location_t loc
= gimple_location (stmt
);
598 fold_defer_overflow_warnings ();
599 cond
= fold_binary_loc (loc
, gimple_cond_code (stmt
), boolean_type_node
,
600 gimple_cond_lhs (stmt
), gimple_cond_rhs (stmt
));
603 zerop
= integer_zerop (cond
);
604 onep
= integer_onep (cond
);
607 zerop
= onep
= false;
609 fold_undefer_overflow_warnings (zerop
|| onep
,
611 WARN_STRICT_OVERFLOW_CONDITIONAL
);
613 gimple_cond_make_false (stmt
);
615 gimple_cond_make_true (stmt
);
620 /* If basic block BB has an abnormal edge to a basic block
621 containing IFN_ABNORMAL_DISPATCHER internal call, return
622 that the dispatcher's basic block, otherwise return NULL. */
625 get_abnormal_succ_dispatcher (basic_block bb
)
630 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
631 if ((e
->flags
& (EDGE_ABNORMAL
| EDGE_EH
)) == EDGE_ABNORMAL
)
633 gimple_stmt_iterator gsi
634 = gsi_start_nondebug_after_labels_bb (e
->dest
);
635 gimple g
= gsi_stmt (gsi
);
637 && is_gimple_call (g
)
638 && gimple_call_internal_p (g
)
639 && gimple_call_internal_fn (g
) == IFN_ABNORMAL_DISPATCHER
)
645 /* Helper function for make_edges. Create a basic block with
646 with ABNORMAL_DISPATCHER internal call in it if needed, and
647 create abnormal edges from BBS to it and from it to FOR_BB
648 if COMPUTED_GOTO is false, otherwise factor the computed gotos. */
651 handle_abnormal_edges (basic_block
*dispatcher_bbs
,
652 basic_block for_bb
, int *bb_to_omp_idx
,
653 auto_vec
<basic_block
> *bbs
, bool computed_goto
)
655 basic_block
*dispatcher
= dispatcher_bbs
+ (computed_goto
? 1 : 0);
656 unsigned int idx
= 0;
662 dispatcher
= dispatcher_bbs
+ 2 * bb_to_omp_idx
[for_bb
->index
];
663 if (bb_to_omp_idx
[for_bb
->index
] != 0)
667 /* If the dispatcher has been created already, then there are basic
668 blocks with abnormal edges to it, so just make a new edge to
670 if (*dispatcher
== NULL
)
672 /* Check if there are any basic blocks that need to have
673 abnormal edges to this dispatcher. If there are none, return
675 if (bb_to_omp_idx
== NULL
)
677 if (bbs
->is_empty ())
682 FOR_EACH_VEC_ELT (*bbs
, idx
, bb
)
683 if (bb_to_omp_idx
[bb
->index
] == bb_to_omp_idx
[for_bb
->index
])
689 /* Create the dispatcher bb. */
690 *dispatcher
= create_basic_block (NULL
, NULL
, for_bb
);
693 /* Factor computed gotos into a common computed goto site. Also
694 record the location of that site so that we can un-factor the
695 gotos after we have converted back to normal form. */
696 gimple_stmt_iterator gsi
= gsi_start_bb (*dispatcher
);
698 /* Create the destination of the factored goto. Each original
699 computed goto will put its desired destination into this
700 variable and jump to the label we create immediately below. */
701 tree var
= create_tmp_var (ptr_type_node
, "gotovar");
703 /* Build a label for the new block which will contain the
704 factored computed goto. */
705 tree factored_label_decl
706 = create_artificial_label (UNKNOWN_LOCATION
);
707 gimple factored_computed_goto_label
708 = gimple_build_label (factored_label_decl
);
709 gsi_insert_after (&gsi
, factored_computed_goto_label
, GSI_NEW_STMT
);
711 /* Build our new computed goto. */
712 gimple factored_computed_goto
= gimple_build_goto (var
);
713 gsi_insert_after (&gsi
, factored_computed_goto
, GSI_NEW_STMT
);
715 FOR_EACH_VEC_ELT (*bbs
, idx
, bb
)
718 && bb_to_omp_idx
[bb
->index
] != bb_to_omp_idx
[for_bb
->index
])
721 gsi
= gsi_last_bb (bb
);
722 gimple last
= gsi_stmt (gsi
);
724 gcc_assert (computed_goto_p (last
));
726 /* Copy the original computed goto's destination into VAR. */
728 = gimple_build_assign (var
, gimple_goto_dest (last
));
729 gsi_insert_before (&gsi
, assignment
, GSI_SAME_STMT
);
731 edge e
= make_edge (bb
, *dispatcher
, EDGE_FALLTHRU
);
732 e
->goto_locus
= gimple_location (last
);
733 gsi_remove (&gsi
, true);
738 tree arg
= inner
? boolean_true_node
: boolean_false_node
;
739 gimple g
= gimple_build_call_internal (IFN_ABNORMAL_DISPATCHER
,
741 gimple_stmt_iterator gsi
= gsi_after_labels (*dispatcher
);
742 gsi_insert_after (&gsi
, g
, GSI_NEW_STMT
);
744 /* Create predecessor edges of the dispatcher. */
745 FOR_EACH_VEC_ELT (*bbs
, idx
, bb
)
748 && bb_to_omp_idx
[bb
->index
] != bb_to_omp_idx
[for_bb
->index
])
750 make_edge (bb
, *dispatcher
, EDGE_ABNORMAL
);
755 make_edge (*dispatcher
, for_bb
, EDGE_ABNORMAL
);
758 /* Join all the blocks in the flowgraph. */
764 struct omp_region
*cur_region
= NULL
;
765 auto_vec
<basic_block
> ab_edge_goto
;
766 auto_vec
<basic_block
> ab_edge_call
;
767 int *bb_to_omp_idx
= NULL
;
768 int cur_omp_region_idx
= 0;
770 /* Create an edge from entry to the first block with executable
772 make_edge (ENTRY_BLOCK_PTR_FOR_FN (cfun
),
773 BASIC_BLOCK_FOR_FN (cfun
, NUM_FIXED_BLOCKS
),
776 /* Traverse the basic block array placing edges. */
777 FOR_EACH_BB_FN (bb
, cfun
)
779 gimple last
= last_stmt (bb
);
783 bb_to_omp_idx
[bb
->index
] = cur_omp_region_idx
;
787 enum gimple_code code
= gimple_code (last
);
791 if (make_goto_expr_edges (bb
))
792 ab_edge_goto
.safe_push (bb
);
797 edge e
= make_edge (bb
, EXIT_BLOCK_PTR_FOR_FN (cfun
), 0);
798 e
->goto_locus
= gimple_location (last
);
803 make_cond_expr_edges (bb
);
807 make_gimple_switch_edges (as_a
<gimple_switch
> (last
), bb
);
811 make_eh_edges (last
);
814 case GIMPLE_EH_DISPATCH
:
816 make_eh_dispatch_edges (as_a
<gimple_eh_dispatch
> (last
));
820 /* If this function receives a nonlocal goto, then we need to
821 make edges from this call site to all the nonlocal goto
823 if (stmt_can_make_abnormal_goto (last
))
824 ab_edge_call
.safe_push (bb
);
826 /* If this statement has reachable exception handlers, then
827 create abnormal edges to them. */
828 make_eh_edges (last
);
830 /* BUILTIN_RETURN is really a return statement. */
831 if (gimple_call_builtin_p (last
, BUILT_IN_RETURN
))
833 make_edge (bb
, EXIT_BLOCK_PTR_FOR_FN (cfun
), 0);
836 /* Some calls are known not to return. */
838 fallthru
= !(gimple_call_flags (last
) & ECF_NORETURN
);
842 /* A GIMPLE_ASSIGN may throw internally and thus be considered
844 if (is_ctrl_altering_stmt (last
))
845 make_eh_edges (last
);
850 make_gimple_asm_edges (bb
);
855 fallthru
= make_gimple_omp_edges (bb
, &cur_region
,
856 &cur_omp_region_idx
);
857 if (cur_region
&& bb_to_omp_idx
== NULL
)
858 bb_to_omp_idx
= XCNEWVEC (int, n_basic_blocks_for_fn (cfun
));
861 case GIMPLE_TRANSACTION
:
864 gimple_transaction_label (as_a
<gimple_transaction
> (last
));
866 make_edge (bb
, label_to_block (abort_label
), EDGE_TM_ABORT
);
872 gcc_assert (!stmt_ends_bb_p (last
));
880 make_edge (bb
, bb
->next_bb
, EDGE_FALLTHRU
);
883 /* Computed gotos are hell to deal with, especially if there are
884 lots of them with a large number of destinations. So we factor
885 them to a common computed goto location before we build the
886 edge list. After we convert back to normal form, we will un-factor
887 the computed gotos since factoring introduces an unwanted jump.
888 For non-local gotos and abnormal edges from calls to calls that return
889 twice or forced labels, factor the abnormal edges too, by having all
890 abnormal edges from the calls go to a common artificial basic block
891 with ABNORMAL_DISPATCHER internal call and abnormal edges from that
892 basic block to all forced labels and calls returning twice.
893 We do this per-OpenMP structured block, because those regions
894 are guaranteed to be single entry single exit by the standard,
895 so it is not allowed to enter or exit such regions abnormally this way,
896 thus all computed gotos, non-local gotos and setjmp/longjmp calls
897 must not transfer control across SESE region boundaries. */
898 if (!ab_edge_goto
.is_empty () || !ab_edge_call
.is_empty ())
900 gimple_stmt_iterator gsi
;
901 basic_block dispatcher_bb_array
[2] = { NULL
, NULL
};
902 basic_block
*dispatcher_bbs
= dispatcher_bb_array
;
903 int count
= n_basic_blocks_for_fn (cfun
);
906 dispatcher_bbs
= XCNEWVEC (basic_block
, 2 * count
);
908 FOR_EACH_BB_FN (bb
, cfun
)
910 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
912 gimple label_stmt
= gsi_stmt (gsi
);
915 if (gimple_code (label_stmt
) != GIMPLE_LABEL
)
918 target
= gimple_label_label (label_stmt
);
920 /* Make an edge to every label block that has been marked as a
921 potential target for a computed goto or a non-local goto. */
922 if (FORCED_LABEL (target
))
923 handle_abnormal_edges (dispatcher_bbs
, bb
, bb_to_omp_idx
,
924 &ab_edge_goto
, true);
925 if (DECL_NONLOCAL (target
))
927 handle_abnormal_edges (dispatcher_bbs
, bb
, bb_to_omp_idx
,
928 &ab_edge_call
, false);
933 if (!gsi_end_p (gsi
) && is_gimple_debug (gsi_stmt (gsi
)))
934 gsi_next_nondebug (&gsi
);
935 if (!gsi_end_p (gsi
))
937 /* Make an edge to every setjmp-like call. */
938 gimple call_stmt
= gsi_stmt (gsi
);
939 if (is_gimple_call (call_stmt
)
940 && ((gimple_call_flags (call_stmt
) & ECF_RETURNS_TWICE
)
941 || gimple_call_builtin_p (call_stmt
,
942 BUILT_IN_SETJMP_RECEIVER
)))
943 handle_abnormal_edges (dispatcher_bbs
, bb
, bb_to_omp_idx
,
944 &ab_edge_call
, false);
949 XDELETE (dispatcher_bbs
);
952 XDELETE (bb_to_omp_idx
);
956 /* Fold COND_EXPR_COND of each COND_EXPR. */
957 fold_cond_expr_cond ();
960 /* Find the next available discriminator value for LOCUS. The
961 discriminator distinguishes among several basic blocks that
962 share a common locus, allowing for more accurate sample-based
966 next_discriminator_for_locus (location_t locus
)
968 struct locus_discrim_map item
;
969 struct locus_discrim_map
**slot
;
972 item
.discriminator
= 0;
973 slot
= discriminator_per_locus
->find_slot_with_hash (
974 &item
, LOCATION_LINE (locus
), INSERT
);
976 if (*slot
== HTAB_EMPTY_ENTRY
)
978 *slot
= XNEW (struct locus_discrim_map
);
980 (*slot
)->locus
= locus
;
981 (*slot
)->discriminator
= 0;
983 (*slot
)->discriminator
++;
984 return (*slot
)->discriminator
;
987 /* Return TRUE if LOCUS1 and LOCUS2 refer to the same source line. */
990 same_line_p (location_t locus1
, location_t locus2
)
992 expanded_location from
, to
;
994 if (locus1
== locus2
)
997 from
= expand_location (locus1
);
998 to
= expand_location (locus2
);
1000 if (from
.line
!= to
.line
)
1002 if (from
.file
== to
.file
)
1004 return (from
.file
!= NULL
1006 && filename_cmp (from
.file
, to
.file
) == 0);
1009 /* Assign discriminators to each basic block. */
1012 assign_discriminators (void)
1016 FOR_EACH_BB_FN (bb
, cfun
)
1020 gimple last
= last_stmt (bb
);
1021 location_t locus
= last
? gimple_location (last
) : UNKNOWN_LOCATION
;
1023 if (locus
== UNKNOWN_LOCATION
)
1026 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
1028 gimple first
= first_non_label_stmt (e
->dest
);
1029 gimple last
= last_stmt (e
->dest
);
1030 if ((first
&& same_line_p (locus
, gimple_location (first
)))
1031 || (last
&& same_line_p (locus
, gimple_location (last
))))
1033 if (e
->dest
->discriminator
!= 0 && bb
->discriminator
== 0)
1034 bb
->discriminator
= next_discriminator_for_locus (locus
);
1036 e
->dest
->discriminator
= next_discriminator_for_locus (locus
);
1042 /* Create the edges for a GIMPLE_COND starting at block BB. */
1045 make_cond_expr_edges (basic_block bb
)
1047 gimple entry
= last_stmt (bb
);
1048 gimple then_stmt
, else_stmt
;
1049 basic_block then_bb
, else_bb
;
1050 tree then_label
, else_label
;
1054 gcc_assert (gimple_code (entry
) == GIMPLE_COND
);
1056 /* Entry basic blocks for each component. */
1057 then_label
= gimple_cond_true_label (entry
);
1058 else_label
= gimple_cond_false_label (entry
);
1059 then_bb
= label_to_block (then_label
);
1060 else_bb
= label_to_block (else_label
);
1061 then_stmt
= first_stmt (then_bb
);
1062 else_stmt
= first_stmt (else_bb
);
1064 e
= make_edge (bb
, then_bb
, EDGE_TRUE_VALUE
);
1065 e
->goto_locus
= gimple_location (then_stmt
);
1066 e
= make_edge (bb
, else_bb
, EDGE_FALSE_VALUE
);
1068 e
->goto_locus
= gimple_location (else_stmt
);
1070 /* We do not need the labels anymore. */
1071 gimple_cond_set_true_label (entry
, NULL_TREE
);
1072 gimple_cond_set_false_label (entry
, NULL_TREE
);
1076 /* Called for each element in the hash table (P) as we delete the
1077 edge to cases hash table.
1079 Clear all the TREE_CHAINs to prevent problems with copying of
1080 SWITCH_EXPRs and structure sharing rules, then free the hash table
1084 edge_to_cases_cleanup (edge
const &, tree
const &value
, void *)
1088 for (t
= value
; t
; t
= next
)
1090 next
= CASE_CHAIN (t
);
1091 CASE_CHAIN (t
) = NULL
;
1097 /* Start recording information mapping edges to case labels. */
1100 start_recording_case_labels (void)
1102 gcc_assert (edge_to_cases
== NULL
);
1103 edge_to_cases
= new hash_map
<edge
, tree
>;
1104 touched_switch_bbs
= BITMAP_ALLOC (NULL
);
1107 /* Return nonzero if we are recording information for case labels. */
1110 recording_case_labels_p (void)
1112 return (edge_to_cases
!= NULL
);
1115 /* Stop recording information mapping edges to case labels and
1116 remove any information we have recorded. */
1118 end_recording_case_labels (void)
1122 edge_to_cases
->traverse
<void *, edge_to_cases_cleanup
> (NULL
);
1123 delete edge_to_cases
;
1124 edge_to_cases
= NULL
;
1125 EXECUTE_IF_SET_IN_BITMAP (touched_switch_bbs
, 0, i
, bi
)
1127 basic_block bb
= BASIC_BLOCK_FOR_FN (cfun
, i
);
1130 gimple stmt
= last_stmt (bb
);
1131 if (stmt
&& gimple_code (stmt
) == GIMPLE_SWITCH
)
1132 group_case_labels_stmt (as_a
<gimple_switch
> (stmt
));
1135 BITMAP_FREE (touched_switch_bbs
);
1138 /* If we are inside a {start,end}_recording_cases block, then return
1139 a chain of CASE_LABEL_EXPRs from T which reference E.
1141 Otherwise return NULL. */
1144 get_cases_for_edge (edge e
, gimple_switch t
)
1149 /* If we are not recording cases, then we do not have CASE_LABEL_EXPR
1150 chains available. Return NULL so the caller can detect this case. */
1151 if (!recording_case_labels_p ())
1154 slot
= edge_to_cases
->get (e
);
1158 /* If we did not find E in the hash table, then this must be the first
1159 time we have been queried for information about E & T. Add all the
1160 elements from T to the hash table then perform the query again. */
1162 n
= gimple_switch_num_labels (t
);
1163 for (i
= 0; i
< n
; i
++)
1165 tree elt
= gimple_switch_label (t
, i
);
1166 tree lab
= CASE_LABEL (elt
);
1167 basic_block label_bb
= label_to_block (lab
);
1168 edge this_edge
= find_edge (e
->src
, label_bb
);
1170 /* Add it to the chain of CASE_LABEL_EXPRs referencing E, or create
1172 tree
&s
= edge_to_cases
->get_or_insert (this_edge
);
1173 CASE_CHAIN (elt
) = s
;
1177 return *edge_to_cases
->get (e
);
1180 /* Create the edges for a GIMPLE_SWITCH starting at block BB. */
1183 make_gimple_switch_edges (gimple_switch entry
, basic_block bb
)
1187 n
= gimple_switch_num_labels (entry
);
1189 for (i
= 0; i
< n
; ++i
)
1191 tree lab
= CASE_LABEL (gimple_switch_label (entry
, i
));
1192 basic_block label_bb
= label_to_block (lab
);
1193 make_edge (bb
, label_bb
, 0);
1198 /* Return the basic block holding label DEST. */
1201 label_to_block_fn (struct function
*ifun
, tree dest
)
1203 int uid
= LABEL_DECL_UID (dest
);
1205 /* We would die hard when faced by an undefined label. Emit a label to
1206 the very first basic block. This will hopefully make even the dataflow
1207 and undefined variable warnings quite right. */
1208 if (seen_error () && uid
< 0)
1210 gimple_stmt_iterator gsi
=
1211 gsi_start_bb (BASIC_BLOCK_FOR_FN (cfun
, NUM_FIXED_BLOCKS
));
1214 stmt
= gimple_build_label (dest
);
1215 gsi_insert_before (&gsi
, stmt
, GSI_NEW_STMT
);
1216 uid
= LABEL_DECL_UID (dest
);
1218 if (vec_safe_length (ifun
->cfg
->x_label_to_block_map
) <= (unsigned int) uid
)
1220 return (*ifun
->cfg
->x_label_to_block_map
)[uid
];
1223 /* Create edges for a goto statement at block BB. Returns true
1224 if abnormal edges should be created. */
1227 make_goto_expr_edges (basic_block bb
)
1229 gimple_stmt_iterator last
= gsi_last_bb (bb
);
1230 gimple goto_t
= gsi_stmt (last
);
1232 /* A simple GOTO creates normal edges. */
1233 if (simple_goto_p (goto_t
))
1235 tree dest
= gimple_goto_dest (goto_t
);
1236 basic_block label_bb
= label_to_block (dest
);
1237 edge e
= make_edge (bb
, label_bb
, EDGE_FALLTHRU
);
1238 e
->goto_locus
= gimple_location (goto_t
);
1239 gsi_remove (&last
, true);
1243 /* A computed GOTO creates abnormal edges. */
1247 /* Create edges for an asm statement with labels at block BB. */
1250 make_gimple_asm_edges (basic_block bb
)
1252 gimple_asm stmt
= as_a
<gimple_asm
> (last_stmt (bb
));
1253 int i
, n
= gimple_asm_nlabels (stmt
);
1255 for (i
= 0; i
< n
; ++i
)
1257 tree label
= TREE_VALUE (gimple_asm_label_op (stmt
, i
));
1258 basic_block label_bb
= label_to_block (label
);
1259 make_edge (bb
, label_bb
, 0);
1263 /*---------------------------------------------------------------------------
1265 ---------------------------------------------------------------------------*/
1267 /* Cleanup useless labels in basic blocks. This is something we wish
1268 to do early because it allows us to group case labels before creating
1269 the edges for the CFG, and it speeds up block statement iterators in
1270 all passes later on.
1271 We rerun this pass after CFG is created, to get rid of the labels that
1272 are no longer referenced. After then we do not run it any more, since
1273 (almost) no new labels should be created. */
1275 /* A map from basic block index to the leading label of that block. */
1276 static struct label_record
1281 /* True if the label is referenced from somewhere. */
1285 /* Given LABEL return the first label in the same basic block. */
1288 main_block_label (tree label
)
1290 basic_block bb
= label_to_block (label
);
1291 tree main_label
= label_for_bb
[bb
->index
].label
;
1293 /* label_to_block possibly inserted undefined label into the chain. */
1296 label_for_bb
[bb
->index
].label
= label
;
1300 label_for_bb
[bb
->index
].used
= true;
1304 /* Clean up redundant labels within the exception tree. */
1307 cleanup_dead_labels_eh (void)
1314 if (cfun
->eh
== NULL
)
1317 for (i
= 1; vec_safe_iterate (cfun
->eh
->lp_array
, i
, &lp
); ++i
)
1318 if (lp
&& lp
->post_landing_pad
)
1320 lab
= main_block_label (lp
->post_landing_pad
);
1321 if (lab
!= lp
->post_landing_pad
)
1323 EH_LANDING_PAD_NR (lp
->post_landing_pad
) = 0;
1324 EH_LANDING_PAD_NR (lab
) = lp
->index
;
1328 FOR_ALL_EH_REGION (r
)
1332 case ERT_MUST_NOT_THROW
:
1338 for (c
= r
->u
.eh_try
.first_catch
; c
; c
= c
->next_catch
)
1342 c
->label
= main_block_label (lab
);
1347 case ERT_ALLOWED_EXCEPTIONS
:
1348 lab
= r
->u
.allowed
.label
;
1350 r
->u
.allowed
.label
= main_block_label (lab
);
1356 /* Cleanup redundant labels. This is a three-step process:
1357 1) Find the leading label for each block.
1358 2) Redirect all references to labels to the leading labels.
1359 3) Cleanup all useless labels. */
1362 cleanup_dead_labels (void)
1365 label_for_bb
= XCNEWVEC (struct label_record
, last_basic_block_for_fn (cfun
));
1367 /* Find a suitable label for each block. We use the first user-defined
1368 label if there is one, or otherwise just the first label we see. */
1369 FOR_EACH_BB_FN (bb
, cfun
)
1371 gimple_stmt_iterator i
;
1373 for (i
= gsi_start_bb (bb
); !gsi_end_p (i
); gsi_next (&i
))
1376 gimple stmt
= gsi_stmt (i
);
1378 if (gimple_code (stmt
) != GIMPLE_LABEL
)
1381 label
= gimple_label_label (stmt
);
1383 /* If we have not yet seen a label for the current block,
1384 remember this one and see if there are more labels. */
1385 if (!label_for_bb
[bb
->index
].label
)
1387 label_for_bb
[bb
->index
].label
= label
;
1391 /* If we did see a label for the current block already, but it
1392 is an artificially created label, replace it if the current
1393 label is a user defined label. */
1394 if (!DECL_ARTIFICIAL (label
)
1395 && DECL_ARTIFICIAL (label_for_bb
[bb
->index
].label
))
1397 label_for_bb
[bb
->index
].label
= label
;
1403 /* Now redirect all jumps/branches to the selected label.
1404 First do so for each block ending in a control statement. */
1405 FOR_EACH_BB_FN (bb
, cfun
)
1407 gimple stmt
= last_stmt (bb
);
1408 tree label
, new_label
;
1413 switch (gimple_code (stmt
))
1416 label
= gimple_cond_true_label (stmt
);
1419 new_label
= main_block_label (label
);
1420 if (new_label
!= label
)
1421 gimple_cond_set_true_label (stmt
, new_label
);
1424 label
= gimple_cond_false_label (stmt
);
1427 new_label
= main_block_label (label
);
1428 if (new_label
!= label
)
1429 gimple_cond_set_false_label (stmt
, new_label
);
1435 gimple_switch switch_stmt
= as_a
<gimple_switch
> (stmt
);
1436 size_t i
, n
= gimple_switch_num_labels (switch_stmt
);
1438 /* Replace all destination labels. */
1439 for (i
= 0; i
< n
; ++i
)
1441 tree case_label
= gimple_switch_label (switch_stmt
, i
);
1442 label
= CASE_LABEL (case_label
);
1443 new_label
= main_block_label (label
);
1444 if (new_label
!= label
)
1445 CASE_LABEL (case_label
) = new_label
;
1452 gimple_asm asm_stmt
= as_a
<gimple_asm
> (stmt
);
1453 int i
, n
= gimple_asm_nlabels (asm_stmt
);
1455 for (i
= 0; i
< n
; ++i
)
1457 tree cons
= gimple_asm_label_op (asm_stmt
, i
);
1458 tree label
= main_block_label (TREE_VALUE (cons
));
1459 TREE_VALUE (cons
) = label
;
1464 /* We have to handle gotos until they're removed, and we don't
1465 remove them until after we've created the CFG edges. */
1467 if (!computed_goto_p (stmt
))
1469 label
= gimple_goto_dest (stmt
);
1470 new_label
= main_block_label (label
);
1471 if (new_label
!= label
)
1472 gimple_goto_set_dest (stmt
, new_label
);
1476 case GIMPLE_TRANSACTION
:
1478 gimple_transaction trans_stmt
= as_a
<gimple_transaction
> (stmt
);
1479 tree label
= gimple_transaction_label (trans_stmt
);
1482 tree new_label
= main_block_label (label
);
1483 if (new_label
!= label
)
1484 gimple_transaction_set_label (trans_stmt
, new_label
);
1494 /* Do the same for the exception region tree labels. */
1495 cleanup_dead_labels_eh ();
1497 /* Finally, purge dead labels. All user-defined labels and labels that
1498 can be the target of non-local gotos and labels which have their
1499 address taken are preserved. */
1500 FOR_EACH_BB_FN (bb
, cfun
)
1502 gimple_stmt_iterator i
;
1503 tree label_for_this_bb
= label_for_bb
[bb
->index
].label
;
1505 if (!label_for_this_bb
)
1508 /* If the main label of the block is unused, we may still remove it. */
1509 if (!label_for_bb
[bb
->index
].used
)
1510 label_for_this_bb
= NULL
;
1512 for (i
= gsi_start_bb (bb
); !gsi_end_p (i
); )
1515 gimple stmt
= gsi_stmt (i
);
1517 if (gimple_code (stmt
) != GIMPLE_LABEL
)
1520 label
= gimple_label_label (stmt
);
1522 if (label
== label_for_this_bb
1523 || !DECL_ARTIFICIAL (label
)
1524 || DECL_NONLOCAL (label
)
1525 || FORCED_LABEL (label
))
1528 gsi_remove (&i
, true);
1532 free (label_for_bb
);
1535 /* Scan the sorted vector of cases in STMT (a GIMPLE_SWITCH) and combine
1536 the ones jumping to the same label.
1537 Eg. three separate entries 1: 2: 3: become one entry 1..3: */
1540 group_case_labels_stmt (gimple_switch stmt
)
1542 int old_size
= gimple_switch_num_labels (stmt
);
1543 int i
, j
, new_size
= old_size
;
1544 basic_block default_bb
= NULL
;
1546 default_bb
= label_to_block (CASE_LABEL (gimple_switch_default_label (stmt
)));
1548 /* Look for possible opportunities to merge cases. */
1550 while (i
< old_size
)
1552 tree base_case
, base_high
;
1553 basic_block base_bb
;
1555 base_case
= gimple_switch_label (stmt
, i
);
1557 gcc_assert (base_case
);
1558 base_bb
= label_to_block (CASE_LABEL (base_case
));
1560 /* Discard cases that have the same destination as the
1562 if (base_bb
== default_bb
)
1564 gimple_switch_set_label (stmt
, i
, NULL_TREE
);
1570 base_high
= CASE_HIGH (base_case
)
1571 ? CASE_HIGH (base_case
)
1572 : CASE_LOW (base_case
);
1575 /* Try to merge case labels. Break out when we reach the end
1576 of the label vector or when we cannot merge the next case
1577 label with the current one. */
1578 while (i
< old_size
)
1580 tree merge_case
= gimple_switch_label (stmt
, i
);
1581 basic_block merge_bb
= label_to_block (CASE_LABEL (merge_case
));
1582 wide_int bhp1
= wi::add (base_high
, 1);
1584 /* Merge the cases if they jump to the same place,
1585 and their ranges are consecutive. */
1586 if (merge_bb
== base_bb
1587 && wi::eq_p (CASE_LOW (merge_case
), bhp1
))
1589 base_high
= CASE_HIGH (merge_case
) ?
1590 CASE_HIGH (merge_case
) : CASE_LOW (merge_case
);
1591 CASE_HIGH (base_case
) = base_high
;
1592 gimple_switch_set_label (stmt
, i
, NULL_TREE
);
1601 /* Compress the case labels in the label vector, and adjust the
1602 length of the vector. */
1603 for (i
= 0, j
= 0; i
< new_size
; i
++)
1605 while (! gimple_switch_label (stmt
, j
))
1607 gimple_switch_set_label (stmt
, i
,
1608 gimple_switch_label (stmt
, j
++));
1611 gcc_assert (new_size
<= old_size
);
1612 gimple_switch_set_num_labels (stmt
, new_size
);
1615 /* Look for blocks ending in a multiway branch (a GIMPLE_SWITCH),
1616 and scan the sorted vector of cases. Combine the ones jumping to the
1620 group_case_labels (void)
1624 FOR_EACH_BB_FN (bb
, cfun
)
1626 gimple stmt
= last_stmt (bb
);
1627 if (stmt
&& gimple_code (stmt
) == GIMPLE_SWITCH
)
1628 group_case_labels_stmt (as_a
<gimple_switch
> (stmt
));
1632 /* Checks whether we can merge block B into block A. */
1635 gimple_can_merge_blocks_p (basic_block a
, basic_block b
)
1638 gimple_stmt_iterator gsi
;
1640 if (!single_succ_p (a
))
1643 if (single_succ_edge (a
)->flags
& EDGE_COMPLEX
)
1646 if (single_succ (a
) != b
)
1649 if (!single_pred_p (b
))
1652 if (b
== EXIT_BLOCK_PTR_FOR_FN (cfun
))
1655 /* If A ends by a statement causing exceptions or something similar, we
1656 cannot merge the blocks. */
1657 stmt
= last_stmt (a
);
1658 if (stmt
&& stmt_ends_bb_p (stmt
))
1661 /* Do not allow a block with only a non-local label to be merged. */
1663 && gimple_code (stmt
) == GIMPLE_LABEL
1664 && DECL_NONLOCAL (gimple_label_label (stmt
)))
1667 /* Examine the labels at the beginning of B. */
1668 for (gsi
= gsi_start_bb (b
); !gsi_end_p (gsi
); gsi_next (&gsi
))
1671 stmt
= gsi_stmt (gsi
);
1672 if (gimple_code (stmt
) != GIMPLE_LABEL
)
1674 lab
= gimple_label_label (stmt
);
1676 /* Do not remove user forced labels or for -O0 any user labels. */
1677 if (!DECL_ARTIFICIAL (lab
) && (!optimize
|| FORCED_LABEL (lab
)))
1681 /* Protect the loop latches. */
1682 if (current_loops
&& b
->loop_father
->latch
== b
)
1685 /* It must be possible to eliminate all phi nodes in B. If ssa form
1686 is not up-to-date and a name-mapping is registered, we cannot eliminate
1687 any phis. Symbols marked for renaming are never a problem though. */
1688 for (gsi
= gsi_start_phis (b
); !gsi_end_p (gsi
); gsi_next (&gsi
))
1690 gimple phi
= gsi_stmt (gsi
);
1691 /* Technically only new names matter. */
1692 if (name_registered_for_update_p (PHI_RESULT (phi
)))
1696 /* When not optimizing, don't merge if we'd lose goto_locus. */
1698 && single_succ_edge (a
)->goto_locus
!= UNKNOWN_LOCATION
)
1700 location_t goto_locus
= single_succ_edge (a
)->goto_locus
;
1701 gimple_stmt_iterator prev
, next
;
1702 prev
= gsi_last_nondebug_bb (a
);
1703 next
= gsi_after_labels (b
);
1704 if (!gsi_end_p (next
) && is_gimple_debug (gsi_stmt (next
)))
1705 gsi_next_nondebug (&next
);
1706 if ((gsi_end_p (prev
)
1707 || gimple_location (gsi_stmt (prev
)) != goto_locus
)
1708 && (gsi_end_p (next
)
1709 || gimple_location (gsi_stmt (next
)) != goto_locus
))
1716 /* Replaces all uses of NAME by VAL. */
1719 replace_uses_by (tree name
, tree val
)
1721 imm_use_iterator imm_iter
;
1726 FOR_EACH_IMM_USE_STMT (stmt
, imm_iter
, name
)
1728 /* Mark the block if we change the last stmt in it. */
1729 if (cfgcleanup_altered_bbs
1730 && stmt_ends_bb_p (stmt
))
1731 bitmap_set_bit (cfgcleanup_altered_bbs
, gimple_bb (stmt
)->index
);
1733 FOR_EACH_IMM_USE_ON_STMT (use
, imm_iter
)
1735 replace_exp (use
, val
);
1737 if (gimple_code (stmt
) == GIMPLE_PHI
)
1739 e
= gimple_phi_arg_edge (stmt
, PHI_ARG_INDEX_FROM_USE (use
));
1740 if (e
->flags
& EDGE_ABNORMAL
)
1742 /* This can only occur for virtual operands, since
1743 for the real ones SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name))
1744 would prevent replacement. */
1745 gcc_checking_assert (virtual_operand_p (name
));
1746 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (val
) = 1;
1751 if (gimple_code (stmt
) != GIMPLE_PHI
)
1753 gimple_stmt_iterator gsi
= gsi_for_stmt (stmt
);
1754 gimple orig_stmt
= stmt
;
1757 /* FIXME. It shouldn't be required to keep TREE_CONSTANT
1758 on ADDR_EXPRs up-to-date on GIMPLE. Propagation will
1759 only change sth from non-invariant to invariant, and only
1760 when propagating constants. */
1761 if (is_gimple_min_invariant (val
))
1762 for (i
= 0; i
< gimple_num_ops (stmt
); i
++)
1764 tree op
= gimple_op (stmt
, i
);
1765 /* Operands may be empty here. For example, the labels
1766 of a GIMPLE_COND are nulled out following the creation
1767 of the corresponding CFG edges. */
1768 if (op
&& TREE_CODE (op
) == ADDR_EXPR
)
1769 recompute_tree_invariant_for_addr_expr (op
);
1772 if (fold_stmt (&gsi
))
1773 stmt
= gsi_stmt (gsi
);
1775 if (maybe_clean_or_replace_eh_stmt (orig_stmt
, stmt
))
1776 gimple_purge_dead_eh_edges (gimple_bb (stmt
));
1782 gcc_checking_assert (has_zero_uses (name
));
1784 /* Also update the trees stored in loop structures. */
1789 FOR_EACH_LOOP (loop
, 0)
1791 substitute_in_loop_info (loop
, name
, val
);
1796 /* Merge block B into block A. */
1799 gimple_merge_blocks (basic_block a
, basic_block b
)
1801 gimple_stmt_iterator last
, gsi
, psi
;
1804 fprintf (dump_file
, "Merging blocks %d and %d\n", a
->index
, b
->index
);
1806 /* Remove all single-valued PHI nodes from block B of the form
1807 V_i = PHI <V_j> by propagating V_j to all the uses of V_i. */
1808 gsi
= gsi_last_bb (a
);
1809 for (psi
= gsi_start_phis (b
); !gsi_end_p (psi
); )
1811 gimple phi
= gsi_stmt (psi
);
1812 tree def
= gimple_phi_result (phi
), use
= gimple_phi_arg_def (phi
, 0);
1814 bool may_replace_uses
= (virtual_operand_p (def
)
1815 || may_propagate_copy (def
, use
));
1817 /* In case we maintain loop closed ssa form, do not propagate arguments
1818 of loop exit phi nodes. */
1820 && loops_state_satisfies_p (LOOP_CLOSED_SSA
)
1821 && !virtual_operand_p (def
)
1822 && TREE_CODE (use
) == SSA_NAME
1823 && a
->loop_father
!= b
->loop_father
)
1824 may_replace_uses
= false;
1826 if (!may_replace_uses
)
1828 gcc_assert (!virtual_operand_p (def
));
1830 /* Note that just emitting the copies is fine -- there is no problem
1831 with ordering of phi nodes. This is because A is the single
1832 predecessor of B, therefore results of the phi nodes cannot
1833 appear as arguments of the phi nodes. */
1834 copy
= gimple_build_assign (def
, use
);
1835 gsi_insert_after (&gsi
, copy
, GSI_NEW_STMT
);
1836 remove_phi_node (&psi
, false);
1840 /* If we deal with a PHI for virtual operands, we can simply
1841 propagate these without fussing with folding or updating
1843 if (virtual_operand_p (def
))
1845 imm_use_iterator iter
;
1846 use_operand_p use_p
;
1849 FOR_EACH_IMM_USE_STMT (stmt
, iter
, def
)
1850 FOR_EACH_IMM_USE_ON_STMT (use_p
, iter
)
1851 SET_USE (use_p
, use
);
1853 if (SSA_NAME_OCCURS_IN_ABNORMAL_PHI (def
))
1854 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (use
) = 1;
1857 replace_uses_by (def
, use
);
1859 remove_phi_node (&psi
, true);
1863 /* Ensure that B follows A. */
1864 move_block_after (b
, a
);
1866 gcc_assert (single_succ_edge (a
)->flags
& EDGE_FALLTHRU
);
1867 gcc_assert (!last_stmt (a
) || !stmt_ends_bb_p (last_stmt (a
)));
1869 /* Remove labels from B and set gimple_bb to A for other statements. */
1870 for (gsi
= gsi_start_bb (b
); !gsi_end_p (gsi
);)
1872 gimple stmt
= gsi_stmt (gsi
);
1873 if (gimple_code (stmt
) == GIMPLE_LABEL
)
1875 tree label
= gimple_label_label (stmt
);
1878 gsi_remove (&gsi
, false);
1880 /* Now that we can thread computed gotos, we might have
1881 a situation where we have a forced label in block B
1882 However, the label at the start of block B might still be
1883 used in other ways (think about the runtime checking for
1884 Fortran assigned gotos). So we can not just delete the
1885 label. Instead we move the label to the start of block A. */
1886 if (FORCED_LABEL (label
))
1888 gimple_stmt_iterator dest_gsi
= gsi_start_bb (a
);
1889 gsi_insert_before (&dest_gsi
, stmt
, GSI_NEW_STMT
);
1891 /* Other user labels keep around in a form of a debug stmt. */
1892 else if (!DECL_ARTIFICIAL (label
) && MAY_HAVE_DEBUG_STMTS
)
1894 gimple dbg
= gimple_build_debug_bind (label
,
1897 gimple_debug_bind_reset_value (dbg
);
1898 gsi_insert_before (&gsi
, dbg
, GSI_SAME_STMT
);
1901 lp_nr
= EH_LANDING_PAD_NR (label
);
1904 eh_landing_pad lp
= get_eh_landing_pad_from_number (lp_nr
);
1905 lp
->post_landing_pad
= NULL
;
1910 gimple_set_bb (stmt
, a
);
1915 /* When merging two BBs, if their counts are different, the larger count
1916 is selected as the new bb count. This is to handle inconsistent
1918 if (a
->loop_father
== b
->loop_father
)
1920 a
->count
= MAX (a
->count
, b
->count
);
1921 a
->frequency
= MAX (a
->frequency
, b
->frequency
);
1924 /* Merge the sequences. */
1925 last
= gsi_last_bb (a
);
1926 gsi_insert_seq_after (&last
, bb_seq (b
), GSI_NEW_STMT
);
1927 set_bb_seq (b
, NULL
);
1929 if (cfgcleanup_altered_bbs
)
1930 bitmap_set_bit (cfgcleanup_altered_bbs
, a
->index
);
1934 /* Return the one of two successors of BB that is not reachable by a
1935 complex edge, if there is one. Else, return BB. We use
1936 this in optimizations that use post-dominators for their heuristics,
1937 to catch the cases in C++ where function calls are involved. */
1940 single_noncomplex_succ (basic_block bb
)
1943 if (EDGE_COUNT (bb
->succs
) != 2)
1946 e0
= EDGE_SUCC (bb
, 0);
1947 e1
= EDGE_SUCC (bb
, 1);
1948 if (e0
->flags
& EDGE_COMPLEX
)
1950 if (e1
->flags
& EDGE_COMPLEX
)
1956 /* T is CALL_EXPR. Set current_function_calls_* flags. */
1959 notice_special_calls (gimple_call call
)
1961 int flags
= gimple_call_flags (call
);
1963 if (flags
& ECF_MAY_BE_ALLOCA
)
1964 cfun
->calls_alloca
= true;
1965 if (flags
& ECF_RETURNS_TWICE
)
1966 cfun
->calls_setjmp
= true;
1970 /* Clear flags set by notice_special_calls. Used by dead code removal
1971 to update the flags. */
1974 clear_special_calls (void)
1976 cfun
->calls_alloca
= false;
1977 cfun
->calls_setjmp
= false;
1980 /* Remove PHI nodes associated with basic block BB and all edges out of BB. */
1983 remove_phi_nodes_and_edges_for_unreachable_block (basic_block bb
)
1985 /* Since this block is no longer reachable, we can just delete all
1986 of its PHI nodes. */
1987 remove_phi_nodes (bb
);
1989 /* Remove edges to BB's successors. */
1990 while (EDGE_COUNT (bb
->succs
) > 0)
1991 remove_edge (EDGE_SUCC (bb
, 0));
1995 /* Remove statements of basic block BB. */
1998 remove_bb (basic_block bb
)
2000 gimple_stmt_iterator i
;
2004 fprintf (dump_file
, "Removing basic block %d\n", bb
->index
);
2005 if (dump_flags
& TDF_DETAILS
)
2007 dump_bb (dump_file
, bb
, 0, TDF_BLOCKS
);
2008 fprintf (dump_file
, "\n");
2014 struct loop
*loop
= bb
->loop_father
;
2016 /* If a loop gets removed, clean up the information associated
2018 if (loop
->latch
== bb
2019 || loop
->header
== bb
)
2020 free_numbers_of_iterations_estimates_loop (loop
);
2023 /* Remove all the instructions in the block. */
2024 if (bb_seq (bb
) != NULL
)
2026 /* Walk backwards so as to get a chance to substitute all
2027 released DEFs into debug stmts. See
2028 eliminate_unnecessary_stmts() in tree-ssa-dce.c for more
2030 for (i
= gsi_last_bb (bb
); !gsi_end_p (i
);)
2032 gimple stmt
= gsi_stmt (i
);
2033 if (gimple_code (stmt
) == GIMPLE_LABEL
2034 && (FORCED_LABEL (gimple_label_label (stmt
))
2035 || DECL_NONLOCAL (gimple_label_label (stmt
))))
2038 gimple_stmt_iterator new_gsi
;
2040 /* A non-reachable non-local label may still be referenced.
2041 But it no longer needs to carry the extra semantics of
2043 if (DECL_NONLOCAL (gimple_label_label (stmt
)))
2045 DECL_NONLOCAL (gimple_label_label (stmt
)) = 0;
2046 FORCED_LABEL (gimple_label_label (stmt
)) = 1;
2049 new_bb
= bb
->prev_bb
;
2050 new_gsi
= gsi_start_bb (new_bb
);
2051 gsi_remove (&i
, false);
2052 gsi_insert_before (&new_gsi
, stmt
, GSI_NEW_STMT
);
2056 /* Release SSA definitions if we are in SSA. Note that we
2057 may be called when not in SSA. For example,
2058 final_cleanup calls this function via
2059 cleanup_tree_cfg. */
2060 if (gimple_in_ssa_p (cfun
))
2061 release_defs (stmt
);
2063 gsi_remove (&i
, true);
2067 i
= gsi_last_bb (bb
);
2073 remove_phi_nodes_and_edges_for_unreachable_block (bb
);
2074 bb
->il
.gimple
.seq
= NULL
;
2075 bb
->il
.gimple
.phi_nodes
= NULL
;
2079 /* Given a basic block BB ending with COND_EXPR or SWITCH_EXPR, and a
2080 predicate VAL, return the edge that will be taken out of the block.
2081 If VAL does not match a unique edge, NULL is returned. */
2084 find_taken_edge (basic_block bb
, tree val
)
2088 stmt
= last_stmt (bb
);
2091 gcc_assert (is_ctrl_stmt (stmt
));
2096 if (!is_gimple_min_invariant (val
))
2099 if (gimple_code (stmt
) == GIMPLE_COND
)
2100 return find_taken_edge_cond_expr (bb
, val
);
2102 if (gimple_code (stmt
) == GIMPLE_SWITCH
)
2103 return find_taken_edge_switch_expr (as_a
<gimple_switch
> (stmt
), bb
, val
);
2105 if (computed_goto_p (stmt
))
2107 /* Only optimize if the argument is a label, if the argument is
2108 not a label then we can not construct a proper CFG.
2110 It may be the case that we only need to allow the LABEL_REF to
2111 appear inside an ADDR_EXPR, but we also allow the LABEL_REF to
2112 appear inside a LABEL_EXPR just to be safe. */
2113 if ((TREE_CODE (val
) == ADDR_EXPR
|| TREE_CODE (val
) == LABEL_EXPR
)
2114 && TREE_CODE (TREE_OPERAND (val
, 0)) == LABEL_DECL
)
2115 return find_taken_edge_computed_goto (bb
, TREE_OPERAND (val
, 0));
2122 /* Given a constant value VAL and the entry block BB to a GOTO_EXPR
2123 statement, determine which of the outgoing edges will be taken out of the
2124 block. Return NULL if either edge may be taken. */
2127 find_taken_edge_computed_goto (basic_block bb
, tree val
)
2132 dest
= label_to_block (val
);
2135 e
= find_edge (bb
, dest
);
2136 gcc_assert (e
!= NULL
);
2142 /* Given a constant value VAL and the entry block BB to a COND_EXPR
2143 statement, determine which of the two edges will be taken out of the
2144 block. Return NULL if either edge may be taken. */
2147 find_taken_edge_cond_expr (basic_block bb
, tree val
)
2149 edge true_edge
, false_edge
;
2151 extract_true_false_edges_from_block (bb
, &true_edge
, &false_edge
);
2153 gcc_assert (TREE_CODE (val
) == INTEGER_CST
);
2154 return (integer_zerop (val
) ? false_edge
: true_edge
);
2157 /* Given an INTEGER_CST VAL and the entry block BB to a SWITCH_EXPR
2158 statement, determine which edge will be taken out of the block. Return
2159 NULL if any edge may be taken. */
2162 find_taken_edge_switch_expr (gimple_switch switch_stmt
, basic_block bb
,
2165 basic_block dest_bb
;
2169 taken_case
= find_case_label_for_value (switch_stmt
, val
);
2170 dest_bb
= label_to_block (CASE_LABEL (taken_case
));
2172 e
= find_edge (bb
, dest_bb
);
2178 /* Return the CASE_LABEL_EXPR that SWITCH_STMT will take for VAL.
2179 We can make optimal use here of the fact that the case labels are
2180 sorted: We can do a binary search for a case matching VAL. */
2183 find_case_label_for_value (gimple_switch switch_stmt
, tree val
)
2185 size_t low
, high
, n
= gimple_switch_num_labels (switch_stmt
);
2186 tree default_case
= gimple_switch_default_label (switch_stmt
);
2188 for (low
= 0, high
= n
; high
- low
> 1; )
2190 size_t i
= (high
+ low
) / 2;
2191 tree t
= gimple_switch_label (switch_stmt
, i
);
2194 /* Cache the result of comparing CASE_LOW and val. */
2195 cmp
= tree_int_cst_compare (CASE_LOW (t
), val
);
2202 if (CASE_HIGH (t
) == NULL
)
2204 /* A singe-valued case label. */
2210 /* A case range. We can only handle integer ranges. */
2211 if (cmp
<= 0 && tree_int_cst_compare (CASE_HIGH (t
), val
) >= 0)
2216 return default_case
;
2220 /* Dump a basic block on stderr. */
2223 gimple_debug_bb (basic_block bb
)
2225 dump_bb (stderr
, bb
, 0, TDF_VOPS
|TDF_MEMSYMS
|TDF_BLOCKS
);
2229 /* Dump basic block with index N on stderr. */
2232 gimple_debug_bb_n (int n
)
2234 gimple_debug_bb (BASIC_BLOCK_FOR_FN (cfun
, n
));
2235 return BASIC_BLOCK_FOR_FN (cfun
, n
);
2239 /* Dump the CFG on stderr.
2241 FLAGS are the same used by the tree dumping functions
2242 (see TDF_* in dumpfile.h). */
2245 gimple_debug_cfg (int flags
)
2247 gimple_dump_cfg (stderr
, flags
);
2251 /* Dump the program showing basic block boundaries on the given FILE.
2253 FLAGS are the same used by the tree dumping functions (see TDF_* in
2257 gimple_dump_cfg (FILE *file
, int flags
)
2259 if (flags
& TDF_DETAILS
)
2261 dump_function_header (file
, current_function_decl
, flags
);
2262 fprintf (file
, ";; \n%d basic blocks, %d edges, last basic block %d.\n\n",
2263 n_basic_blocks_for_fn (cfun
), n_edges_for_fn (cfun
),
2264 last_basic_block_for_fn (cfun
));
2266 brief_dump_cfg (file
, flags
| TDF_COMMENT
);
2267 fprintf (file
, "\n");
2270 if (flags
& TDF_STATS
)
2271 dump_cfg_stats (file
);
2273 dump_function_to_file (current_function_decl
, file
, flags
| TDF_BLOCKS
);
2277 /* Dump CFG statistics on FILE. */
2280 dump_cfg_stats (FILE *file
)
2282 static long max_num_merged_labels
= 0;
2283 unsigned long size
, total
= 0;
2286 const char * const fmt_str
= "%-30s%-13s%12s\n";
2287 const char * const fmt_str_1
= "%-30s%13d%11lu%c\n";
2288 const char * const fmt_str_2
= "%-30s%13ld%11lu%c\n";
2289 const char * const fmt_str_3
= "%-43s%11lu%c\n";
2290 const char *funcname
= current_function_name ();
2292 fprintf (file
, "\nCFG Statistics for %s\n\n", funcname
);
2294 fprintf (file
, "---------------------------------------------------------\n");
2295 fprintf (file
, fmt_str
, "", " Number of ", "Memory");
2296 fprintf (file
, fmt_str
, "", " instances ", "used ");
2297 fprintf (file
, "---------------------------------------------------------\n");
2299 size
= n_basic_blocks_for_fn (cfun
) * sizeof (struct basic_block_def
);
2301 fprintf (file
, fmt_str_1
, "Basic blocks", n_basic_blocks_for_fn (cfun
),
2302 SCALE (size
), LABEL (size
));
2305 FOR_EACH_BB_FN (bb
, cfun
)
2306 num_edges
+= EDGE_COUNT (bb
->succs
);
2307 size
= num_edges
* sizeof (struct edge_def
);
2309 fprintf (file
, fmt_str_2
, "Edges", num_edges
, SCALE (size
), LABEL (size
));
2311 fprintf (file
, "---------------------------------------------------------\n");
2312 fprintf (file
, fmt_str_3
, "Total memory used by CFG data", SCALE (total
),
2314 fprintf (file
, "---------------------------------------------------------\n");
2315 fprintf (file
, "\n");
2317 if (cfg_stats
.num_merged_labels
> max_num_merged_labels
)
2318 max_num_merged_labels
= cfg_stats
.num_merged_labels
;
2320 fprintf (file
, "Coalesced label blocks: %ld (Max so far: %ld)\n",
2321 cfg_stats
.num_merged_labels
, max_num_merged_labels
);
2323 fprintf (file
, "\n");
2327 /* Dump CFG statistics on stderr. Keep extern so that it's always
2328 linked in the final executable. */
2331 debug_cfg_stats (void)
2333 dump_cfg_stats (stderr
);
2336 /*---------------------------------------------------------------------------
2337 Miscellaneous helpers
2338 ---------------------------------------------------------------------------*/
2340 /* Return true if T, a GIMPLE_CALL, can make an abnormal transfer of control
2341 flow. Transfers of control flow associated with EH are excluded. */
2344 call_can_make_abnormal_goto (gimple t
)
2346 /* If the function has no non-local labels, then a call cannot make an
2347 abnormal transfer of control. */
2348 if (!cfun
->has_nonlocal_label
2349 && !cfun
->calls_setjmp
)
2352 /* Likewise if the call has no side effects. */
2353 if (!gimple_has_side_effects (t
))
2356 /* Likewise if the called function is leaf. */
2357 if (gimple_call_flags (t
) & ECF_LEAF
)
2364 /* Return true if T can make an abnormal transfer of control flow.
2365 Transfers of control flow associated with EH are excluded. */
2368 stmt_can_make_abnormal_goto (gimple t
)
2370 if (computed_goto_p (t
))
2372 if (is_gimple_call (t
))
2373 return call_can_make_abnormal_goto (t
);
2378 /* Return true if T represents a stmt that always transfers control. */
2381 is_ctrl_stmt (gimple t
)
2383 switch (gimple_code (t
))
2397 /* Return true if T is a statement that may alter the flow of control
2398 (e.g., a call to a non-returning function). */
2401 is_ctrl_altering_stmt (gimple t
)
2405 switch (gimple_code (t
))
2408 /* Per stmt call flag indicates whether the call could alter
2410 if (gimple_call_ctrl_altering_p (t
))
2414 case GIMPLE_EH_DISPATCH
:
2415 /* EH_DISPATCH branches to the individual catch handlers at
2416 this level of a try or allowed-exceptions region. It can
2417 fallthru to the next statement as well. */
2421 if (gimple_asm_nlabels (as_a
<gimple_asm
> (t
)) > 0)
2426 /* OpenMP directives alter control flow. */
2429 case GIMPLE_TRANSACTION
:
2430 /* A transaction start alters control flow. */
2437 /* If a statement can throw, it alters control flow. */
2438 return stmt_can_throw_internal (t
);
2442 /* Return true if T is a simple local goto. */
2445 simple_goto_p (gimple t
)
2447 return (gimple_code (t
) == GIMPLE_GOTO
2448 && TREE_CODE (gimple_goto_dest (t
)) == LABEL_DECL
);
2452 /* Return true if STMT should start a new basic block. PREV_STMT is
2453 the statement preceding STMT. It is used when STMT is a label or a
2454 case label. Labels should only start a new basic block if their
2455 previous statement wasn't a label. Otherwise, sequence of labels
2456 would generate unnecessary basic blocks that only contain a single
2460 stmt_starts_bb_p (gimple stmt
, gimple prev_stmt
)
2465 /* Labels start a new basic block only if the preceding statement
2466 wasn't a label of the same type. This prevents the creation of
2467 consecutive blocks that have nothing but a single label. */
2468 if (gimple_code (stmt
) == GIMPLE_LABEL
)
2470 /* Nonlocal and computed GOTO targets always start a new block. */
2471 if (DECL_NONLOCAL (gimple_label_label (stmt
))
2472 || FORCED_LABEL (gimple_label_label (stmt
)))
2475 if (prev_stmt
&& gimple_code (prev_stmt
) == GIMPLE_LABEL
)
2477 if (DECL_NONLOCAL (gimple_label_label (prev_stmt
)))
2480 cfg_stats
.num_merged_labels
++;
2486 else if (gimple_code (stmt
) == GIMPLE_CALL
2487 && gimple_call_flags (stmt
) & ECF_RETURNS_TWICE
)
2488 /* setjmp acts similar to a nonlocal GOTO target and thus should
2489 start a new block. */
2496 /* Return true if T should end a basic block. */
2499 stmt_ends_bb_p (gimple t
)
2501 return is_ctrl_stmt (t
) || is_ctrl_altering_stmt (t
);
2504 /* Remove block annotations and other data structures. */
2507 delete_tree_cfg_annotations (void)
2509 vec_free (label_to_block_map_for_fn (cfun
));
2513 /* Return the first statement in basic block BB. */
2516 first_stmt (basic_block bb
)
2518 gimple_stmt_iterator i
= gsi_start_bb (bb
);
2521 while (!gsi_end_p (i
) && is_gimple_debug ((stmt
= gsi_stmt (i
))))
2529 /* Return the first non-label statement in basic block BB. */
2532 first_non_label_stmt (basic_block bb
)
2534 gimple_stmt_iterator i
= gsi_start_bb (bb
);
2535 while (!gsi_end_p (i
) && gimple_code (gsi_stmt (i
)) == GIMPLE_LABEL
)
2537 return !gsi_end_p (i
) ? gsi_stmt (i
) : NULL
;
2540 /* Return the last statement in basic block BB. */
2543 last_stmt (basic_block bb
)
2545 gimple_stmt_iterator i
= gsi_last_bb (bb
);
2548 while (!gsi_end_p (i
) && is_gimple_debug ((stmt
= gsi_stmt (i
))))
2556 /* Return the last statement of an otherwise empty block. Return NULL
2557 if the block is totally empty, or if it contains more than one
2561 last_and_only_stmt (basic_block bb
)
2563 gimple_stmt_iterator i
= gsi_last_nondebug_bb (bb
);
2569 last
= gsi_stmt (i
);
2570 gsi_prev_nondebug (&i
);
2574 /* Empty statements should no longer appear in the instruction stream.
2575 Everything that might have appeared before should be deleted by
2576 remove_useless_stmts, and the optimizers should just gsi_remove
2577 instead of smashing with build_empty_stmt.
2579 Thus the only thing that should appear here in a block containing
2580 one executable statement is a label. */
2581 prev
= gsi_stmt (i
);
2582 if (gimple_code (prev
) == GIMPLE_LABEL
)
2588 /* Reinstall those PHI arguments queued in OLD_EDGE to NEW_EDGE. */
2591 reinstall_phi_args (edge new_edge
, edge old_edge
)
2595 gimple_phi_iterator phis
;
2597 vec
<edge_var_map
> *v
= redirect_edge_var_map_vector (old_edge
);
2601 for (i
= 0, phis
= gsi_start_phis (new_edge
->dest
);
2602 v
->iterate (i
, &vm
) && !gsi_end_p (phis
);
2603 i
++, gsi_next (&phis
))
2605 gimple_phi phi
= phis
.phi ();
2606 tree result
= redirect_edge_var_map_result (vm
);
2607 tree arg
= redirect_edge_var_map_def (vm
);
2609 gcc_assert (result
== gimple_phi_result (phi
));
2611 add_phi_arg (phi
, arg
, new_edge
, redirect_edge_var_map_location (vm
));
2614 redirect_edge_var_map_clear (old_edge
);
2617 /* Returns the basic block after which the new basic block created
2618 by splitting edge EDGE_IN should be placed. Tries to keep the new block
2619 near its "logical" location. This is of most help to humans looking
2620 at debugging dumps. */
2623 split_edge_bb_loc (edge edge_in
)
2625 basic_block dest
= edge_in
->dest
;
2626 basic_block dest_prev
= dest
->prev_bb
;
2630 edge e
= find_edge (dest_prev
, dest
);
2631 if (e
&& !(e
->flags
& EDGE_COMPLEX
))
2632 return edge_in
->src
;
2637 /* Split a (typically critical) edge EDGE_IN. Return the new block.
2638 Abort on abnormal edges. */
2641 gimple_split_edge (edge edge_in
)
2643 basic_block new_bb
, after_bb
, dest
;
2646 /* Abnormal edges cannot be split. */
2647 gcc_assert (!(edge_in
->flags
& EDGE_ABNORMAL
));
2649 dest
= edge_in
->dest
;
2651 after_bb
= split_edge_bb_loc (edge_in
);
2653 new_bb
= create_empty_bb (after_bb
);
2654 new_bb
->frequency
= EDGE_FREQUENCY (edge_in
);
2655 new_bb
->count
= edge_in
->count
;
2656 new_edge
= make_edge (new_bb
, dest
, EDGE_FALLTHRU
);
2657 new_edge
->probability
= REG_BR_PROB_BASE
;
2658 new_edge
->count
= edge_in
->count
;
2660 e
= redirect_edge_and_branch (edge_in
, new_bb
);
2661 gcc_assert (e
== edge_in
);
2662 reinstall_phi_args (new_edge
, e
);
2668 /* Verify properties of the address expression T with base object BASE. */
2671 verify_address (tree t
, tree base
)
2674 bool old_side_effects
;
2676 bool new_side_effects
;
2678 old_constant
= TREE_CONSTANT (t
);
2679 old_side_effects
= TREE_SIDE_EFFECTS (t
);
2681 recompute_tree_invariant_for_addr_expr (t
);
2682 new_side_effects
= TREE_SIDE_EFFECTS (t
);
2683 new_constant
= TREE_CONSTANT (t
);
2685 if (old_constant
!= new_constant
)
2687 error ("constant not recomputed when ADDR_EXPR changed");
2690 if (old_side_effects
!= new_side_effects
)
2692 error ("side effects not recomputed when ADDR_EXPR changed");
2696 if (!(TREE_CODE (base
) == VAR_DECL
2697 || TREE_CODE (base
) == PARM_DECL
2698 || TREE_CODE (base
) == RESULT_DECL
))
2701 if (DECL_GIMPLE_REG_P (base
))
2703 error ("DECL_GIMPLE_REG_P set on a variable with address taken");
2710 /* Callback for walk_tree, check that all elements with address taken are
2711 properly noticed as such. The DATA is an int* that is 1 if TP was seen
2712 inside a PHI node. */
2715 verify_expr (tree
*tp
, int *walk_subtrees
, void *data ATTRIBUTE_UNUSED
)
2722 /* Check operand N for being valid GIMPLE and give error MSG if not. */
2723 #define CHECK_OP(N, MSG) \
2724 do { if (!is_gimple_val (TREE_OPERAND (t, N))) \
2725 { error (MSG); return TREE_OPERAND (t, N); }} while (0)
2727 switch (TREE_CODE (t
))
2730 if (SSA_NAME_IN_FREE_LIST (t
))
2732 error ("SSA name in freelist but still referenced");
2738 error ("INDIRECT_REF in gimple IL");
2742 x
= TREE_OPERAND (t
, 0);
2743 if (!POINTER_TYPE_P (TREE_TYPE (x
))
2744 || !is_gimple_mem_ref_addr (x
))
2746 error ("invalid first operand of MEM_REF");
2749 if (TREE_CODE (TREE_OPERAND (t
, 1)) != INTEGER_CST
2750 || !POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (t
, 1))))
2752 error ("invalid offset operand of MEM_REF");
2753 return TREE_OPERAND (t
, 1);
2755 if (TREE_CODE (x
) == ADDR_EXPR
2756 && (x
= verify_address (x
, TREE_OPERAND (x
, 0))))
2762 x
= fold (ASSERT_EXPR_COND (t
));
2763 if (x
== boolean_false_node
)
2765 error ("ASSERT_EXPR with an always-false condition");
2771 error ("MODIFY_EXPR not expected while having tuples");
2778 gcc_assert (is_gimple_address (t
));
2780 /* Skip any references (they will be checked when we recurse down the
2781 tree) and ensure that any variable used as a prefix is marked
2783 for (x
= TREE_OPERAND (t
, 0);
2784 handled_component_p (x
);
2785 x
= TREE_OPERAND (x
, 0))
2788 if ((tem
= verify_address (t
, x
)))
2791 if (!(TREE_CODE (x
) == VAR_DECL
2792 || TREE_CODE (x
) == PARM_DECL
2793 || TREE_CODE (x
) == RESULT_DECL
))
2796 if (!TREE_ADDRESSABLE (x
))
2798 error ("address taken, but ADDRESSABLE bit not set");
2806 x
= COND_EXPR_COND (t
);
2807 if (!INTEGRAL_TYPE_P (TREE_TYPE (x
)))
2809 error ("non-integral used in condition");
2812 if (!is_gimple_condexpr (x
))
2814 error ("invalid conditional operand");
2819 case NON_LVALUE_EXPR
:
2820 case TRUTH_NOT_EXPR
:
2824 case FIX_TRUNC_EXPR
:
2829 CHECK_OP (0, "invalid operand to unary operator");
2835 if (!is_gimple_reg_type (TREE_TYPE (t
)))
2837 error ("non-scalar BIT_FIELD_REF, IMAGPART_EXPR or REALPART_EXPR");
2841 if (TREE_CODE (t
) == BIT_FIELD_REF
)
2843 tree t0
= TREE_OPERAND (t
, 0);
2844 tree t1
= TREE_OPERAND (t
, 1);
2845 tree t2
= TREE_OPERAND (t
, 2);
2846 if (!tree_fits_uhwi_p (t1
)
2847 || !tree_fits_uhwi_p (t2
))
2849 error ("invalid position or size operand to BIT_FIELD_REF");
2852 if (INTEGRAL_TYPE_P (TREE_TYPE (t
))
2853 && (TYPE_PRECISION (TREE_TYPE (t
))
2854 != tree_to_uhwi (t1
)))
2856 error ("integral result type precision does not match "
2857 "field size of BIT_FIELD_REF");
2860 else if (!INTEGRAL_TYPE_P (TREE_TYPE (t
))
2861 && TYPE_MODE (TREE_TYPE (t
)) != BLKmode
2862 && (GET_MODE_PRECISION (TYPE_MODE (TREE_TYPE (t
)))
2863 != tree_to_uhwi (t1
)))
2865 error ("mode precision of non-integral result does not "
2866 "match field size of BIT_FIELD_REF");
2869 if (!AGGREGATE_TYPE_P (TREE_TYPE (t0
))
2870 && (tree_to_uhwi (t1
) + tree_to_uhwi (t2
)
2871 > tree_to_uhwi (TYPE_SIZE (TREE_TYPE (t0
)))))
2873 error ("position plus size exceeds size of referenced object in "
2878 t
= TREE_OPERAND (t
, 0);
2883 case ARRAY_RANGE_REF
:
2884 case VIEW_CONVERT_EXPR
:
2885 /* We have a nest of references. Verify that each of the operands
2886 that determine where to reference is either a constant or a variable,
2887 verify that the base is valid, and then show we've already checked
2889 while (handled_component_p (t
))
2891 if (TREE_CODE (t
) == COMPONENT_REF
&& TREE_OPERAND (t
, 2))
2892 CHECK_OP (2, "invalid COMPONENT_REF offset operator");
2893 else if (TREE_CODE (t
) == ARRAY_REF
2894 || TREE_CODE (t
) == ARRAY_RANGE_REF
)
2896 CHECK_OP (1, "invalid array index");
2897 if (TREE_OPERAND (t
, 2))
2898 CHECK_OP (2, "invalid array lower bound");
2899 if (TREE_OPERAND (t
, 3))
2900 CHECK_OP (3, "invalid array stride");
2902 else if (TREE_CODE (t
) == BIT_FIELD_REF
2903 || TREE_CODE (t
) == REALPART_EXPR
2904 || TREE_CODE (t
) == IMAGPART_EXPR
)
2906 error ("non-top-level BIT_FIELD_REF, IMAGPART_EXPR or "
2911 t
= TREE_OPERAND (t
, 0);
2914 if (!is_gimple_min_invariant (t
) && !is_gimple_lvalue (t
))
2916 error ("invalid reference prefix");
2923 /* PLUS_EXPR and MINUS_EXPR don't work on pointers, they should be done using
2924 POINTER_PLUS_EXPR. */
2925 if (POINTER_TYPE_P (TREE_TYPE (t
)))
2927 error ("invalid operand to plus/minus, type is a pointer");
2930 CHECK_OP (0, "invalid operand to binary operator");
2931 CHECK_OP (1, "invalid operand to binary operator");
2934 case POINTER_PLUS_EXPR
:
2935 /* Check to make sure the first operand is a pointer or reference type. */
2936 if (!POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (t
, 0))))
2938 error ("invalid operand to pointer plus, first operand is not a pointer");
2941 /* Check to make sure the second operand is a ptrofftype. */
2942 if (!ptrofftype_p (TREE_TYPE (TREE_OPERAND (t
, 1))))
2944 error ("invalid operand to pointer plus, second operand is not an "
2945 "integer type of appropriate width");
2955 case UNORDERED_EXPR
:
2964 case TRUNC_DIV_EXPR
:
2966 case FLOOR_DIV_EXPR
:
2967 case ROUND_DIV_EXPR
:
2968 case TRUNC_MOD_EXPR
:
2970 case FLOOR_MOD_EXPR
:
2971 case ROUND_MOD_EXPR
:
2973 case EXACT_DIV_EXPR
:
2983 CHECK_OP (0, "invalid operand to binary operator");
2984 CHECK_OP (1, "invalid operand to binary operator");
2988 if (TREE_CONSTANT (t
) && TREE_CODE (TREE_TYPE (t
)) == VECTOR_TYPE
)
2992 case CASE_LABEL_EXPR
:
2995 error ("invalid CASE_CHAIN");
3009 /* Verify if EXPR is either a GIMPLE ID or a GIMPLE indirect reference.
3010 Returns true if there is an error, otherwise false. */
3013 verify_types_in_gimple_min_lval (tree expr
)
3017 if (is_gimple_id (expr
))
3020 if (TREE_CODE (expr
) != TARGET_MEM_REF
3021 && TREE_CODE (expr
) != MEM_REF
)
3023 error ("invalid expression for min lvalue");
3027 /* TARGET_MEM_REFs are strange beasts. */
3028 if (TREE_CODE (expr
) == TARGET_MEM_REF
)
3031 op
= TREE_OPERAND (expr
, 0);
3032 if (!is_gimple_val (op
))
3034 error ("invalid operand in indirect reference");
3035 debug_generic_stmt (op
);
3038 /* Memory references now generally can involve a value conversion. */
3043 /* Verify if EXPR is a valid GIMPLE reference expression. If
3044 REQUIRE_LVALUE is true verifies it is an lvalue. Returns true
3045 if there is an error, otherwise false. */
3048 verify_types_in_gimple_reference (tree expr
, bool require_lvalue
)
3050 while (handled_component_p (expr
))
3052 tree op
= TREE_OPERAND (expr
, 0);
3054 if (TREE_CODE (expr
) == ARRAY_REF
3055 || TREE_CODE (expr
) == ARRAY_RANGE_REF
)
3057 if (!is_gimple_val (TREE_OPERAND (expr
, 1))
3058 || (TREE_OPERAND (expr
, 2)
3059 && !is_gimple_val (TREE_OPERAND (expr
, 2)))
3060 || (TREE_OPERAND (expr
, 3)
3061 && !is_gimple_val (TREE_OPERAND (expr
, 3))))
3063 error ("invalid operands to array reference");
3064 debug_generic_stmt (expr
);
3069 /* Verify if the reference array element types are compatible. */
3070 if (TREE_CODE (expr
) == ARRAY_REF
3071 && !useless_type_conversion_p (TREE_TYPE (expr
),
3072 TREE_TYPE (TREE_TYPE (op
))))
3074 error ("type mismatch in array reference");
3075 debug_generic_stmt (TREE_TYPE (expr
));
3076 debug_generic_stmt (TREE_TYPE (TREE_TYPE (op
)));
3079 if (TREE_CODE (expr
) == ARRAY_RANGE_REF
3080 && !useless_type_conversion_p (TREE_TYPE (TREE_TYPE (expr
)),
3081 TREE_TYPE (TREE_TYPE (op
))))
3083 error ("type mismatch in array range reference");
3084 debug_generic_stmt (TREE_TYPE (TREE_TYPE (expr
)));
3085 debug_generic_stmt (TREE_TYPE (TREE_TYPE (op
)));
3089 if ((TREE_CODE (expr
) == REALPART_EXPR
3090 || TREE_CODE (expr
) == IMAGPART_EXPR
)
3091 && !useless_type_conversion_p (TREE_TYPE (expr
),
3092 TREE_TYPE (TREE_TYPE (op
))))
3094 error ("type mismatch in real/imagpart reference");
3095 debug_generic_stmt (TREE_TYPE (expr
));
3096 debug_generic_stmt (TREE_TYPE (TREE_TYPE (op
)));
3100 if (TREE_CODE (expr
) == COMPONENT_REF
3101 && !useless_type_conversion_p (TREE_TYPE (expr
),
3102 TREE_TYPE (TREE_OPERAND (expr
, 1))))
3104 error ("type mismatch in component reference");
3105 debug_generic_stmt (TREE_TYPE (expr
));
3106 debug_generic_stmt (TREE_TYPE (TREE_OPERAND (expr
, 1)));
3110 if (TREE_CODE (expr
) == VIEW_CONVERT_EXPR
)
3112 /* For VIEW_CONVERT_EXPRs which are allowed here too, we only check
3113 that their operand is not an SSA name or an invariant when
3114 requiring an lvalue (this usually means there is a SRA or IPA-SRA
3115 bug). Otherwise there is nothing to verify, gross mismatches at
3116 most invoke undefined behavior. */
3118 && (TREE_CODE (op
) == SSA_NAME
3119 || is_gimple_min_invariant (op
)))
3121 error ("conversion of an SSA_NAME on the left hand side");
3122 debug_generic_stmt (expr
);
3125 else if (TREE_CODE (op
) == SSA_NAME
3126 && TYPE_SIZE (TREE_TYPE (expr
)) != TYPE_SIZE (TREE_TYPE (op
)))
3128 error ("conversion of register to a different size");
3129 debug_generic_stmt (expr
);
3132 else if (!handled_component_p (op
))
3139 if (TREE_CODE (expr
) == MEM_REF
)
3141 if (!is_gimple_mem_ref_addr (TREE_OPERAND (expr
, 0)))
3143 error ("invalid address operand in MEM_REF");
3144 debug_generic_stmt (expr
);
3147 if (TREE_CODE (TREE_OPERAND (expr
, 1)) != INTEGER_CST
3148 || !POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (expr
, 1))))
3150 error ("invalid offset operand in MEM_REF");
3151 debug_generic_stmt (expr
);
3155 else if (TREE_CODE (expr
) == TARGET_MEM_REF
)
3157 if (!TMR_BASE (expr
)
3158 || !is_gimple_mem_ref_addr (TMR_BASE (expr
)))
3160 error ("invalid address operand in TARGET_MEM_REF");
3163 if (!TMR_OFFSET (expr
)
3164 || TREE_CODE (TMR_OFFSET (expr
)) != INTEGER_CST
3165 || !POINTER_TYPE_P (TREE_TYPE (TMR_OFFSET (expr
))))
3167 error ("invalid offset operand in TARGET_MEM_REF");
3168 debug_generic_stmt (expr
);
3173 return ((require_lvalue
|| !is_gimple_min_invariant (expr
))
3174 && verify_types_in_gimple_min_lval (expr
));
3177 /* Returns true if there is one pointer type in TYPE_POINTER_TO (SRC_OBJ)
3178 list of pointer-to types that is trivially convertible to DEST. */
3181 one_pointer_to_useless_type_conversion_p (tree dest
, tree src_obj
)
3185 if (!TYPE_POINTER_TO (src_obj
))
3188 for (src
= TYPE_POINTER_TO (src_obj
); src
; src
= TYPE_NEXT_PTR_TO (src
))
3189 if (useless_type_conversion_p (dest
, src
))
3195 /* Return true if TYPE1 is a fixed-point type and if conversions to and
3196 from TYPE2 can be handled by FIXED_CONVERT_EXPR. */
3199 valid_fixed_convert_types_p (tree type1
, tree type2
)
3201 return (FIXED_POINT_TYPE_P (type1
)
3202 && (INTEGRAL_TYPE_P (type2
)
3203 || SCALAR_FLOAT_TYPE_P (type2
)
3204 || FIXED_POINT_TYPE_P (type2
)));
3207 /* Verify the contents of a GIMPLE_CALL STMT. Returns true when there
3208 is a problem, otherwise false. */
3211 verify_gimple_call (gimple stmt
)
3213 tree fn
= gimple_call_fn (stmt
);
3214 tree fntype
, fndecl
;
3217 if (gimple_call_internal_p (stmt
))
3221 error ("gimple call has two targets");
3222 debug_generic_stmt (fn
);
3230 error ("gimple call has no target");
3235 if (fn
&& !is_gimple_call_addr (fn
))
3237 error ("invalid function in gimple call");
3238 debug_generic_stmt (fn
);
3243 && (!POINTER_TYPE_P (TREE_TYPE (fn
))
3244 || (TREE_CODE (TREE_TYPE (TREE_TYPE (fn
))) != FUNCTION_TYPE
3245 && TREE_CODE (TREE_TYPE (TREE_TYPE (fn
))) != METHOD_TYPE
)))
3247 error ("non-function in gimple call");
3251 fndecl
= gimple_call_fndecl (stmt
);
3253 && TREE_CODE (fndecl
) == FUNCTION_DECL
3254 && DECL_LOOPING_CONST_OR_PURE_P (fndecl
)
3255 && !DECL_PURE_P (fndecl
)
3256 && !TREE_READONLY (fndecl
))
3258 error ("invalid pure const state for function");
3262 if (gimple_call_lhs (stmt
)
3263 && (!is_gimple_lvalue (gimple_call_lhs (stmt
))
3264 || verify_types_in_gimple_reference (gimple_call_lhs (stmt
), true)))
3266 error ("invalid LHS in gimple call");
3270 if (gimple_call_lhs (stmt
) && gimple_call_noreturn_p (stmt
))
3272 error ("LHS in noreturn call");
3276 fntype
= gimple_call_fntype (stmt
);
3278 && gimple_call_lhs (stmt
)
3279 && !useless_type_conversion_p (TREE_TYPE (gimple_call_lhs (stmt
)),
3281 /* ??? At least C++ misses conversions at assignments from
3282 void * call results.
3283 ??? Java is completely off. Especially with functions
3284 returning java.lang.Object.
3285 For now simply allow arbitrary pointer type conversions. */
3286 && !(POINTER_TYPE_P (TREE_TYPE (gimple_call_lhs (stmt
)))
3287 && POINTER_TYPE_P (TREE_TYPE (fntype
))))
3289 error ("invalid conversion in gimple call");
3290 debug_generic_stmt (TREE_TYPE (gimple_call_lhs (stmt
)));
3291 debug_generic_stmt (TREE_TYPE (fntype
));
3295 if (gimple_call_chain (stmt
)
3296 && !is_gimple_val (gimple_call_chain (stmt
)))
3298 error ("invalid static chain in gimple call");
3299 debug_generic_stmt (gimple_call_chain (stmt
));
3303 /* If there is a static chain argument, this should not be an indirect
3304 call, and the decl should have DECL_STATIC_CHAIN set. */
3305 if (gimple_call_chain (stmt
))
3307 if (!gimple_call_fndecl (stmt
))
3309 error ("static chain in indirect gimple call");
3312 fn
= TREE_OPERAND (fn
, 0);
3314 if (!DECL_STATIC_CHAIN (fn
))
3316 error ("static chain with function that doesn%'t use one");
3321 /* ??? The C frontend passes unpromoted arguments in case it
3322 didn't see a function declaration before the call. So for now
3323 leave the call arguments mostly unverified. Once we gimplify
3324 unit-at-a-time we have a chance to fix this. */
3326 for (i
= 0; i
< gimple_call_num_args (stmt
); ++i
)
3328 tree arg
= gimple_call_arg (stmt
, i
);
3329 if ((is_gimple_reg_type (TREE_TYPE (arg
))
3330 && !is_gimple_val (arg
))
3331 || (!is_gimple_reg_type (TREE_TYPE (arg
))
3332 && !is_gimple_lvalue (arg
)))
3334 error ("invalid argument to gimple call");
3335 debug_generic_expr (arg
);
3343 /* Verifies the gimple comparison with the result type TYPE and
3344 the operands OP0 and OP1. */
3347 verify_gimple_comparison (tree type
, tree op0
, tree op1
)
3349 tree op0_type
= TREE_TYPE (op0
);
3350 tree op1_type
= TREE_TYPE (op1
);
3352 if (!is_gimple_val (op0
) || !is_gimple_val (op1
))
3354 error ("invalid operands in gimple comparison");
3358 /* For comparisons we do not have the operations type as the
3359 effective type the comparison is carried out in. Instead
3360 we require that either the first operand is trivially
3361 convertible into the second, or the other way around.
3362 Because we special-case pointers to void we allow
3363 comparisons of pointers with the same mode as well. */
3364 if (!useless_type_conversion_p (op0_type
, op1_type
)
3365 && !useless_type_conversion_p (op1_type
, op0_type
)
3366 && (!POINTER_TYPE_P (op0_type
)
3367 || !POINTER_TYPE_P (op1_type
)
3368 || TYPE_MODE (op0_type
) != TYPE_MODE (op1_type
)))
3370 error ("mismatching comparison operand types");
3371 debug_generic_expr (op0_type
);
3372 debug_generic_expr (op1_type
);
3376 /* The resulting type of a comparison may be an effective boolean type. */
3377 if (INTEGRAL_TYPE_P (type
)
3378 && (TREE_CODE (type
) == BOOLEAN_TYPE
3379 || TYPE_PRECISION (type
) == 1))
3381 if (TREE_CODE (op0_type
) == VECTOR_TYPE
3382 || TREE_CODE (op1_type
) == VECTOR_TYPE
)
3384 error ("vector comparison returning a boolean");
3385 debug_generic_expr (op0_type
);
3386 debug_generic_expr (op1_type
);
3390 /* Or an integer vector type with the same size and element count
3391 as the comparison operand types. */
3392 else if (TREE_CODE (type
) == VECTOR_TYPE
3393 && TREE_CODE (TREE_TYPE (type
)) == INTEGER_TYPE
)
3395 if (TREE_CODE (op0_type
) != VECTOR_TYPE
3396 || TREE_CODE (op1_type
) != VECTOR_TYPE
)
3398 error ("non-vector operands in vector comparison");
3399 debug_generic_expr (op0_type
);
3400 debug_generic_expr (op1_type
);
3404 if (TYPE_VECTOR_SUBPARTS (type
) != TYPE_VECTOR_SUBPARTS (op0_type
)
3405 || (GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (type
)))
3406 != GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (op0_type
))))
3407 /* The result of a vector comparison is of signed
3409 || TYPE_UNSIGNED (TREE_TYPE (type
)))
3411 error ("invalid vector comparison resulting type");
3412 debug_generic_expr (type
);
3418 error ("bogus comparison result type");
3419 debug_generic_expr (type
);
3426 /* Verify a gimple assignment statement STMT with an unary rhs.
3427 Returns true if anything is wrong. */
3430 verify_gimple_assign_unary (gimple_assign stmt
)
3432 enum tree_code rhs_code
= gimple_assign_rhs_code (stmt
);
3433 tree lhs
= gimple_assign_lhs (stmt
);
3434 tree lhs_type
= TREE_TYPE (lhs
);
3435 tree rhs1
= gimple_assign_rhs1 (stmt
);
3436 tree rhs1_type
= TREE_TYPE (rhs1
);
3438 if (!is_gimple_reg (lhs
))
3440 error ("non-register as LHS of unary operation");
3444 if (!is_gimple_val (rhs1
))
3446 error ("invalid operand in unary operation");
3450 /* First handle conversions. */
3455 /* Allow conversions from pointer type to integral type only if
3456 there is no sign or zero extension involved.
3457 For targets were the precision of ptrofftype doesn't match that
3458 of pointers we need to allow arbitrary conversions to ptrofftype. */
3459 if ((POINTER_TYPE_P (lhs_type
)
3460 && INTEGRAL_TYPE_P (rhs1_type
))
3461 || (POINTER_TYPE_P (rhs1_type
)
3462 && INTEGRAL_TYPE_P (lhs_type
)
3463 && (TYPE_PRECISION (rhs1_type
) >= TYPE_PRECISION (lhs_type
)
3464 || ptrofftype_p (sizetype
))))
3467 /* Allow conversion from integral to offset type and vice versa. */
3468 if ((TREE_CODE (lhs_type
) == OFFSET_TYPE
3469 && INTEGRAL_TYPE_P (rhs1_type
))
3470 || (INTEGRAL_TYPE_P (lhs_type
)
3471 && TREE_CODE (rhs1_type
) == OFFSET_TYPE
))
3474 /* Otherwise assert we are converting between types of the
3476 if (INTEGRAL_TYPE_P (lhs_type
) != INTEGRAL_TYPE_P (rhs1_type
))
3478 error ("invalid types in nop conversion");
3479 debug_generic_expr (lhs_type
);
3480 debug_generic_expr (rhs1_type
);
3487 case ADDR_SPACE_CONVERT_EXPR
:
3489 if (!POINTER_TYPE_P (rhs1_type
) || !POINTER_TYPE_P (lhs_type
)
3490 || (TYPE_ADDR_SPACE (TREE_TYPE (rhs1_type
))
3491 == TYPE_ADDR_SPACE (TREE_TYPE (lhs_type
))))
3493 error ("invalid types in address space conversion");
3494 debug_generic_expr (lhs_type
);
3495 debug_generic_expr (rhs1_type
);
3502 case FIXED_CONVERT_EXPR
:
3504 if (!valid_fixed_convert_types_p (lhs_type
, rhs1_type
)
3505 && !valid_fixed_convert_types_p (rhs1_type
, lhs_type
))
3507 error ("invalid types in fixed-point conversion");
3508 debug_generic_expr (lhs_type
);
3509 debug_generic_expr (rhs1_type
);
3518 if ((!INTEGRAL_TYPE_P (rhs1_type
) || !SCALAR_FLOAT_TYPE_P (lhs_type
))
3519 && (!VECTOR_INTEGER_TYPE_P (rhs1_type
)
3520 || !VECTOR_FLOAT_TYPE_P (lhs_type
)))
3522 error ("invalid types in conversion to floating point");
3523 debug_generic_expr (lhs_type
);
3524 debug_generic_expr (rhs1_type
);
3531 case FIX_TRUNC_EXPR
:
3533 if ((!INTEGRAL_TYPE_P (lhs_type
) || !SCALAR_FLOAT_TYPE_P (rhs1_type
))
3534 && (!VECTOR_INTEGER_TYPE_P (lhs_type
)
3535 || !VECTOR_FLOAT_TYPE_P (rhs1_type
)))
3537 error ("invalid types in conversion to integer");
3538 debug_generic_expr (lhs_type
);
3539 debug_generic_expr (rhs1_type
);
3546 case VEC_UNPACK_HI_EXPR
:
3547 case VEC_UNPACK_LO_EXPR
:
3548 case REDUC_MAX_EXPR
:
3549 case REDUC_MIN_EXPR
:
3550 case REDUC_PLUS_EXPR
:
3551 case VEC_UNPACK_FLOAT_HI_EXPR
:
3552 case VEC_UNPACK_FLOAT_LO_EXPR
:
3567 /* For the remaining codes assert there is no conversion involved. */
3568 if (!useless_type_conversion_p (lhs_type
, rhs1_type
))
3570 error ("non-trivial conversion in unary operation");
3571 debug_generic_expr (lhs_type
);
3572 debug_generic_expr (rhs1_type
);
3579 /* Verify a gimple assignment statement STMT with a binary rhs.
3580 Returns true if anything is wrong. */
3583 verify_gimple_assign_binary (gimple_assign stmt
)
3585 enum tree_code rhs_code
= gimple_assign_rhs_code (stmt
);
3586 tree lhs
= gimple_assign_lhs (stmt
);
3587 tree lhs_type
= TREE_TYPE (lhs
);
3588 tree rhs1
= gimple_assign_rhs1 (stmt
);
3589 tree rhs1_type
= TREE_TYPE (rhs1
);
3590 tree rhs2
= gimple_assign_rhs2 (stmt
);
3591 tree rhs2_type
= TREE_TYPE (rhs2
);
3593 if (!is_gimple_reg (lhs
))
3595 error ("non-register as LHS of binary operation");
3599 if (!is_gimple_val (rhs1
)
3600 || !is_gimple_val (rhs2
))
3602 error ("invalid operands in binary operation");
3606 /* First handle operations that involve different types. */
3611 if (TREE_CODE (lhs_type
) != COMPLEX_TYPE
3612 || !(INTEGRAL_TYPE_P (rhs1_type
)
3613 || SCALAR_FLOAT_TYPE_P (rhs1_type
))
3614 || !(INTEGRAL_TYPE_P (rhs2_type
)
3615 || SCALAR_FLOAT_TYPE_P (rhs2_type
)))
3617 error ("type mismatch in complex expression");
3618 debug_generic_expr (lhs_type
);
3619 debug_generic_expr (rhs1_type
);
3620 debug_generic_expr (rhs2_type
);
3632 /* Shifts and rotates are ok on integral types, fixed point
3633 types and integer vector types. */
3634 if ((!INTEGRAL_TYPE_P (rhs1_type
)
3635 && !FIXED_POINT_TYPE_P (rhs1_type
)
3636 && !(TREE_CODE (rhs1_type
) == VECTOR_TYPE
3637 && INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type
))))
3638 || (!INTEGRAL_TYPE_P (rhs2_type
)
3639 /* Vector shifts of vectors are also ok. */
3640 && !(TREE_CODE (rhs1_type
) == VECTOR_TYPE
3641 && INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type
))
3642 && TREE_CODE (rhs2_type
) == VECTOR_TYPE
3643 && INTEGRAL_TYPE_P (TREE_TYPE (rhs2_type
))))
3644 || !useless_type_conversion_p (lhs_type
, rhs1_type
))
3646 error ("type mismatch in shift expression");
3647 debug_generic_expr (lhs_type
);
3648 debug_generic_expr (rhs1_type
);
3649 debug_generic_expr (rhs2_type
);
3656 case VEC_LSHIFT_EXPR
:
3657 case VEC_RSHIFT_EXPR
:
3659 if (TREE_CODE (rhs1_type
) != VECTOR_TYPE
3660 || !(INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type
))
3661 || POINTER_TYPE_P (TREE_TYPE (rhs1_type
))
3662 || FIXED_POINT_TYPE_P (TREE_TYPE (rhs1_type
))
3663 || SCALAR_FLOAT_TYPE_P (TREE_TYPE (rhs1_type
)))
3664 || (!INTEGRAL_TYPE_P (rhs2_type
)
3665 && (TREE_CODE (rhs2_type
) != VECTOR_TYPE
3666 || !INTEGRAL_TYPE_P (TREE_TYPE (rhs2_type
))))
3667 || !useless_type_conversion_p (lhs_type
, rhs1_type
))
3669 error ("type mismatch in vector shift expression");
3670 debug_generic_expr (lhs_type
);
3671 debug_generic_expr (rhs1_type
);
3672 debug_generic_expr (rhs2_type
);
3675 /* For shifting a vector of non-integral components we
3676 only allow shifting by a constant multiple of the element size. */
3677 if (!INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type
))
3678 && (TREE_CODE (rhs2
) != INTEGER_CST
3679 || !div_if_zero_remainder (rhs2
,
3680 TYPE_SIZE (TREE_TYPE (rhs1_type
)))))
3682 error ("non-element sized vector shift of floating point vector");
3689 case WIDEN_LSHIFT_EXPR
:
3691 if (!INTEGRAL_TYPE_P (lhs_type
)
3692 || !INTEGRAL_TYPE_P (rhs1_type
)
3693 || TREE_CODE (rhs2
) != INTEGER_CST
3694 || (2 * TYPE_PRECISION (rhs1_type
) > TYPE_PRECISION (lhs_type
)))
3696 error ("type mismatch in widening vector shift expression");
3697 debug_generic_expr (lhs_type
);
3698 debug_generic_expr (rhs1_type
);
3699 debug_generic_expr (rhs2_type
);
3706 case VEC_WIDEN_LSHIFT_HI_EXPR
:
3707 case VEC_WIDEN_LSHIFT_LO_EXPR
:
3709 if (TREE_CODE (rhs1_type
) != VECTOR_TYPE
3710 || TREE_CODE (lhs_type
) != VECTOR_TYPE
3711 || !INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type
))
3712 || !INTEGRAL_TYPE_P (TREE_TYPE (lhs_type
))
3713 || TREE_CODE (rhs2
) != INTEGER_CST
3714 || (2 * TYPE_PRECISION (TREE_TYPE (rhs1_type
))
3715 > TYPE_PRECISION (TREE_TYPE (lhs_type
))))
3717 error ("type mismatch in widening vector shift expression");
3718 debug_generic_expr (lhs_type
);
3719 debug_generic_expr (rhs1_type
);
3720 debug_generic_expr (rhs2_type
);
3730 tree lhs_etype
= lhs_type
;
3731 tree rhs1_etype
= rhs1_type
;
3732 tree rhs2_etype
= rhs2_type
;
3733 if (TREE_CODE (lhs_type
) == VECTOR_TYPE
)
3735 if (TREE_CODE (rhs1_type
) != VECTOR_TYPE
3736 || TREE_CODE (rhs2_type
) != VECTOR_TYPE
)
3738 error ("invalid non-vector operands to vector valued plus");
3741 lhs_etype
= TREE_TYPE (lhs_type
);
3742 rhs1_etype
= TREE_TYPE (rhs1_type
);
3743 rhs2_etype
= TREE_TYPE (rhs2_type
);
3745 if (POINTER_TYPE_P (lhs_etype
)
3746 || POINTER_TYPE_P (rhs1_etype
)
3747 || POINTER_TYPE_P (rhs2_etype
))
3749 error ("invalid (pointer) operands to plus/minus");
3753 /* Continue with generic binary expression handling. */
3757 case POINTER_PLUS_EXPR
:
3759 if (!POINTER_TYPE_P (rhs1_type
)
3760 || !useless_type_conversion_p (lhs_type
, rhs1_type
)
3761 || !ptrofftype_p (rhs2_type
))
3763 error ("type mismatch in pointer plus expression");
3764 debug_generic_stmt (lhs_type
);
3765 debug_generic_stmt (rhs1_type
);
3766 debug_generic_stmt (rhs2_type
);
3773 case TRUTH_ANDIF_EXPR
:
3774 case TRUTH_ORIF_EXPR
:
3775 case TRUTH_AND_EXPR
:
3777 case TRUTH_XOR_EXPR
:
3787 case UNORDERED_EXPR
:
3795 /* Comparisons are also binary, but the result type is not
3796 connected to the operand types. */
3797 return verify_gimple_comparison (lhs_type
, rhs1
, rhs2
);
3799 case WIDEN_MULT_EXPR
:
3800 if (TREE_CODE (lhs_type
) != INTEGER_TYPE
)
3802 return ((2 * TYPE_PRECISION (rhs1_type
) > TYPE_PRECISION (lhs_type
))
3803 || (TYPE_PRECISION (rhs1_type
) != TYPE_PRECISION (rhs2_type
)));
3805 case WIDEN_SUM_EXPR
:
3806 case VEC_WIDEN_MULT_HI_EXPR
:
3807 case VEC_WIDEN_MULT_LO_EXPR
:
3808 case VEC_WIDEN_MULT_EVEN_EXPR
:
3809 case VEC_WIDEN_MULT_ODD_EXPR
:
3810 case VEC_PACK_TRUNC_EXPR
:
3811 case VEC_PACK_SAT_EXPR
:
3812 case VEC_PACK_FIX_TRUNC_EXPR
:
3817 case MULT_HIGHPART_EXPR
:
3818 case TRUNC_DIV_EXPR
:
3820 case FLOOR_DIV_EXPR
:
3821 case ROUND_DIV_EXPR
:
3822 case TRUNC_MOD_EXPR
:
3824 case FLOOR_MOD_EXPR
:
3825 case ROUND_MOD_EXPR
:
3827 case EXACT_DIV_EXPR
:
3833 /* Continue with generic binary expression handling. */
3840 if (!useless_type_conversion_p (lhs_type
, rhs1_type
)
3841 || !useless_type_conversion_p (lhs_type
, rhs2_type
))
3843 error ("type mismatch in binary expression");
3844 debug_generic_stmt (lhs_type
);
3845 debug_generic_stmt (rhs1_type
);
3846 debug_generic_stmt (rhs2_type
);
3853 /* Verify a gimple assignment statement STMT with a ternary rhs.
3854 Returns true if anything is wrong. */
3857 verify_gimple_assign_ternary (gimple_assign stmt
)
3859 enum tree_code rhs_code
= gimple_assign_rhs_code (stmt
);
3860 tree lhs
= gimple_assign_lhs (stmt
);
3861 tree lhs_type
= TREE_TYPE (lhs
);
3862 tree rhs1
= gimple_assign_rhs1 (stmt
);
3863 tree rhs1_type
= TREE_TYPE (rhs1
);
3864 tree rhs2
= gimple_assign_rhs2 (stmt
);
3865 tree rhs2_type
= TREE_TYPE (rhs2
);
3866 tree rhs3
= gimple_assign_rhs3 (stmt
);
3867 tree rhs3_type
= TREE_TYPE (rhs3
);
3869 if (!is_gimple_reg (lhs
))
3871 error ("non-register as LHS of ternary operation");
3875 if (((rhs_code
== VEC_COND_EXPR
|| rhs_code
== COND_EXPR
)
3876 ? !is_gimple_condexpr (rhs1
) : !is_gimple_val (rhs1
))
3877 || !is_gimple_val (rhs2
)
3878 || !is_gimple_val (rhs3
))
3880 error ("invalid operands in ternary operation");
3884 /* First handle operations that involve different types. */
3887 case WIDEN_MULT_PLUS_EXPR
:
3888 case WIDEN_MULT_MINUS_EXPR
:
3889 if ((!INTEGRAL_TYPE_P (rhs1_type
)
3890 && !FIXED_POINT_TYPE_P (rhs1_type
))
3891 || !useless_type_conversion_p (rhs1_type
, rhs2_type
)
3892 || !useless_type_conversion_p (lhs_type
, rhs3_type
)
3893 || 2 * TYPE_PRECISION (rhs1_type
) > TYPE_PRECISION (lhs_type
)
3894 || TYPE_PRECISION (rhs1_type
) != TYPE_PRECISION (rhs2_type
))
3896 error ("type mismatch in widening multiply-accumulate expression");
3897 debug_generic_expr (lhs_type
);
3898 debug_generic_expr (rhs1_type
);
3899 debug_generic_expr (rhs2_type
);
3900 debug_generic_expr (rhs3_type
);
3906 if (!useless_type_conversion_p (lhs_type
, rhs1_type
)
3907 || !useless_type_conversion_p (lhs_type
, rhs2_type
)
3908 || !useless_type_conversion_p (lhs_type
, rhs3_type
))
3910 error ("type mismatch in fused multiply-add expression");
3911 debug_generic_expr (lhs_type
);
3912 debug_generic_expr (rhs1_type
);
3913 debug_generic_expr (rhs2_type
);
3914 debug_generic_expr (rhs3_type
);
3921 if (!useless_type_conversion_p (lhs_type
, rhs2_type
)
3922 || !useless_type_conversion_p (lhs_type
, rhs3_type
))
3924 error ("type mismatch in conditional expression");
3925 debug_generic_expr (lhs_type
);
3926 debug_generic_expr (rhs2_type
);
3927 debug_generic_expr (rhs3_type
);
3933 if (!useless_type_conversion_p (lhs_type
, rhs1_type
)
3934 || !useless_type_conversion_p (lhs_type
, rhs2_type
))
3936 error ("type mismatch in vector permute expression");
3937 debug_generic_expr (lhs_type
);
3938 debug_generic_expr (rhs1_type
);
3939 debug_generic_expr (rhs2_type
);
3940 debug_generic_expr (rhs3_type
);
3944 if (TREE_CODE (rhs1_type
) != VECTOR_TYPE
3945 || TREE_CODE (rhs2_type
) != VECTOR_TYPE
3946 || TREE_CODE (rhs3_type
) != VECTOR_TYPE
)
3948 error ("vector types expected in vector permute expression");
3949 debug_generic_expr (lhs_type
);
3950 debug_generic_expr (rhs1_type
);
3951 debug_generic_expr (rhs2_type
);
3952 debug_generic_expr (rhs3_type
);
3956 if (TYPE_VECTOR_SUBPARTS (rhs1_type
) != TYPE_VECTOR_SUBPARTS (rhs2_type
)
3957 || TYPE_VECTOR_SUBPARTS (rhs2_type
)
3958 != TYPE_VECTOR_SUBPARTS (rhs3_type
)
3959 || TYPE_VECTOR_SUBPARTS (rhs3_type
)
3960 != TYPE_VECTOR_SUBPARTS (lhs_type
))
3962 error ("vectors with different element number found "
3963 "in vector permute expression");
3964 debug_generic_expr (lhs_type
);
3965 debug_generic_expr (rhs1_type
);
3966 debug_generic_expr (rhs2_type
);
3967 debug_generic_expr (rhs3_type
);
3971 if (TREE_CODE (TREE_TYPE (rhs3_type
)) != INTEGER_TYPE
3972 || GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (rhs3_type
)))
3973 != GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (rhs1_type
))))
3975 error ("invalid mask type in vector permute expression");
3976 debug_generic_expr (lhs_type
);
3977 debug_generic_expr (rhs1_type
);
3978 debug_generic_expr (rhs2_type
);
3979 debug_generic_expr (rhs3_type
);
3986 if (!useless_type_conversion_p (rhs1_type
, rhs2_type
)
3987 || !useless_type_conversion_p (lhs_type
, rhs3_type
)
3988 || 2 * GET_MODE_BITSIZE (GET_MODE_INNER
3989 (TYPE_MODE (TREE_TYPE (rhs1_type
))))
3990 > GET_MODE_BITSIZE (GET_MODE_INNER
3991 (TYPE_MODE (TREE_TYPE (lhs_type
)))))
3993 error ("type mismatch in sad expression");
3994 debug_generic_expr (lhs_type
);
3995 debug_generic_expr (rhs1_type
);
3996 debug_generic_expr (rhs2_type
);
3997 debug_generic_expr (rhs3_type
);
4001 if (TREE_CODE (rhs1_type
) != VECTOR_TYPE
4002 || TREE_CODE (rhs2_type
) != VECTOR_TYPE
4003 || TREE_CODE (rhs3_type
) != VECTOR_TYPE
)
4005 error ("vector types expected in sad expression");
4006 debug_generic_expr (lhs_type
);
4007 debug_generic_expr (rhs1_type
);
4008 debug_generic_expr (rhs2_type
);
4009 debug_generic_expr (rhs3_type
);
4016 case REALIGN_LOAD_EXPR
:
4026 /* Verify a gimple assignment statement STMT with a single rhs.
4027 Returns true if anything is wrong. */
4030 verify_gimple_assign_single (gimple_assign stmt
)
4032 enum tree_code rhs_code
= gimple_assign_rhs_code (stmt
);
4033 tree lhs
= gimple_assign_lhs (stmt
);
4034 tree lhs_type
= TREE_TYPE (lhs
);
4035 tree rhs1
= gimple_assign_rhs1 (stmt
);
4036 tree rhs1_type
= TREE_TYPE (rhs1
);
4039 if (!useless_type_conversion_p (lhs_type
, rhs1_type
))
4041 error ("non-trivial conversion at assignment");
4042 debug_generic_expr (lhs_type
);
4043 debug_generic_expr (rhs1_type
);
4047 if (gimple_clobber_p (stmt
)
4048 && !(DECL_P (lhs
) || TREE_CODE (lhs
) == MEM_REF
))
4050 error ("non-decl/MEM_REF LHS in clobber statement");
4051 debug_generic_expr (lhs
);
4055 if (handled_component_p (lhs
)
4056 || TREE_CODE (lhs
) == MEM_REF
4057 || TREE_CODE (lhs
) == TARGET_MEM_REF
)
4058 res
|= verify_types_in_gimple_reference (lhs
, true);
4060 /* Special codes we cannot handle via their class. */
4065 tree op
= TREE_OPERAND (rhs1
, 0);
4066 if (!is_gimple_addressable (op
))
4068 error ("invalid operand in unary expression");
4072 /* Technically there is no longer a need for matching types, but
4073 gimple hygiene asks for this check. In LTO we can end up
4074 combining incompatible units and thus end up with addresses
4075 of globals that change their type to a common one. */
4077 && !types_compatible_p (TREE_TYPE (op
),
4078 TREE_TYPE (TREE_TYPE (rhs1
)))
4079 && !one_pointer_to_useless_type_conversion_p (TREE_TYPE (rhs1
),
4082 error ("type mismatch in address expression");
4083 debug_generic_stmt (TREE_TYPE (rhs1
));
4084 debug_generic_stmt (TREE_TYPE (op
));
4088 return verify_types_in_gimple_reference (op
, true);
4093 error ("INDIRECT_REF in gimple IL");
4099 case ARRAY_RANGE_REF
:
4100 case VIEW_CONVERT_EXPR
:
4103 case TARGET_MEM_REF
:
4105 if (!is_gimple_reg (lhs
)
4106 && is_gimple_reg_type (TREE_TYPE (lhs
)))
4108 error ("invalid rhs for gimple memory store");
4109 debug_generic_stmt (lhs
);
4110 debug_generic_stmt (rhs1
);
4113 return res
|| verify_types_in_gimple_reference (rhs1
, false);
4125 /* tcc_declaration */
4130 if (!is_gimple_reg (lhs
)
4131 && !is_gimple_reg (rhs1
)
4132 && is_gimple_reg_type (TREE_TYPE (lhs
)))
4134 error ("invalid rhs for gimple memory store");
4135 debug_generic_stmt (lhs
);
4136 debug_generic_stmt (rhs1
);
4142 if (TREE_CODE (rhs1_type
) == VECTOR_TYPE
)
4145 tree elt_i
, elt_v
, elt_t
= NULL_TREE
;
4147 if (CONSTRUCTOR_NELTS (rhs1
) == 0)
4149 /* For vector CONSTRUCTORs we require that either it is empty
4150 CONSTRUCTOR, or it is a CONSTRUCTOR of smaller vector elements
4151 (then the element count must be correct to cover the whole
4152 outer vector and index must be NULL on all elements, or it is
4153 a CONSTRUCTOR of scalar elements, where we as an exception allow
4154 smaller number of elements (assuming zero filling) and
4155 consecutive indexes as compared to NULL indexes (such
4156 CONSTRUCTORs can appear in the IL from FEs). */
4157 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (rhs1
), i
, elt_i
, elt_v
)
4159 if (elt_t
== NULL_TREE
)
4161 elt_t
= TREE_TYPE (elt_v
);
4162 if (TREE_CODE (elt_t
) == VECTOR_TYPE
)
4164 tree elt_t
= TREE_TYPE (elt_v
);
4165 if (!useless_type_conversion_p (TREE_TYPE (rhs1_type
),
4168 error ("incorrect type of vector CONSTRUCTOR"
4170 debug_generic_stmt (rhs1
);
4173 else if (CONSTRUCTOR_NELTS (rhs1
)
4174 * TYPE_VECTOR_SUBPARTS (elt_t
)
4175 != TYPE_VECTOR_SUBPARTS (rhs1_type
))
4177 error ("incorrect number of vector CONSTRUCTOR"
4179 debug_generic_stmt (rhs1
);
4183 else if (!useless_type_conversion_p (TREE_TYPE (rhs1_type
),
4186 error ("incorrect type of vector CONSTRUCTOR elements");
4187 debug_generic_stmt (rhs1
);
4190 else if (CONSTRUCTOR_NELTS (rhs1
)
4191 > TYPE_VECTOR_SUBPARTS (rhs1_type
))
4193 error ("incorrect number of vector CONSTRUCTOR elements");
4194 debug_generic_stmt (rhs1
);
4198 else if (!useless_type_conversion_p (elt_t
, TREE_TYPE (elt_v
)))
4200 error ("incorrect type of vector CONSTRUCTOR elements");
4201 debug_generic_stmt (rhs1
);
4204 if (elt_i
!= NULL_TREE
4205 && (TREE_CODE (elt_t
) == VECTOR_TYPE
4206 || TREE_CODE (elt_i
) != INTEGER_CST
4207 || compare_tree_int (elt_i
, i
) != 0))
4209 error ("vector CONSTRUCTOR with non-NULL element index");
4210 debug_generic_stmt (rhs1
);
4213 if (!is_gimple_val (elt_v
))
4215 error ("vector CONSTRUCTOR element is not a GIMPLE value");
4216 debug_generic_stmt (rhs1
);
4221 else if (CONSTRUCTOR_NELTS (rhs1
) != 0)
4223 error ("non-vector CONSTRUCTOR with elements");
4224 debug_generic_stmt (rhs1
);
4230 case WITH_SIZE_EXPR
:
4240 /* Verify the contents of a GIMPLE_ASSIGN STMT. Returns true when there
4241 is a problem, otherwise false. */
4244 verify_gimple_assign (gimple_assign stmt
)
4246 switch (gimple_assign_rhs_class (stmt
))
4248 case GIMPLE_SINGLE_RHS
:
4249 return verify_gimple_assign_single (stmt
);
4251 case GIMPLE_UNARY_RHS
:
4252 return verify_gimple_assign_unary (stmt
);
4254 case GIMPLE_BINARY_RHS
:
4255 return verify_gimple_assign_binary (stmt
);
4257 case GIMPLE_TERNARY_RHS
:
4258 return verify_gimple_assign_ternary (stmt
);
4265 /* Verify the contents of a GIMPLE_RETURN STMT. Returns true when there
4266 is a problem, otherwise false. */
4269 verify_gimple_return (gimple_return stmt
)
4271 tree op
= gimple_return_retval (stmt
);
4272 tree restype
= TREE_TYPE (TREE_TYPE (cfun
->decl
));
4274 /* We cannot test for present return values as we do not fix up missing
4275 return values from the original source. */
4279 if (!is_gimple_val (op
)
4280 && TREE_CODE (op
) != RESULT_DECL
)
4282 error ("invalid operand in return statement");
4283 debug_generic_stmt (op
);
4287 if ((TREE_CODE (op
) == RESULT_DECL
4288 && DECL_BY_REFERENCE (op
))
4289 || (TREE_CODE (op
) == SSA_NAME
4290 && SSA_NAME_VAR (op
)
4291 && TREE_CODE (SSA_NAME_VAR (op
)) == RESULT_DECL
4292 && DECL_BY_REFERENCE (SSA_NAME_VAR (op
))))
4293 op
= TREE_TYPE (op
);
4295 if (!useless_type_conversion_p (restype
, TREE_TYPE (op
)))
4297 error ("invalid conversion in return statement");
4298 debug_generic_stmt (restype
);
4299 debug_generic_stmt (TREE_TYPE (op
));
4307 /* Verify the contents of a GIMPLE_GOTO STMT. Returns true when there
4308 is a problem, otherwise false. */
4311 verify_gimple_goto (gimple_goto stmt
)
4313 tree dest
= gimple_goto_dest (stmt
);
4315 /* ??? We have two canonical forms of direct goto destinations, a
4316 bare LABEL_DECL and an ADDR_EXPR of a LABEL_DECL. */
4317 if (TREE_CODE (dest
) != LABEL_DECL
4318 && (!is_gimple_val (dest
)
4319 || !POINTER_TYPE_P (TREE_TYPE (dest
))))
4321 error ("goto destination is neither a label nor a pointer");
4328 /* Verify the contents of a GIMPLE_SWITCH STMT. Returns true when there
4329 is a problem, otherwise false. */
4332 verify_gimple_switch (gimple_switch stmt
)
4335 tree elt
, prev_upper_bound
= NULL_TREE
;
4336 tree index_type
, elt_type
= NULL_TREE
;
4338 if (!is_gimple_val (gimple_switch_index (stmt
)))
4340 error ("invalid operand to switch statement");
4341 debug_generic_stmt (gimple_switch_index (stmt
));
4345 index_type
= TREE_TYPE (gimple_switch_index (stmt
));
4346 if (! INTEGRAL_TYPE_P (index_type
))
4348 error ("non-integral type switch statement");
4349 debug_generic_expr (index_type
);
4353 elt
= gimple_switch_label (stmt
, 0);
4354 if (CASE_LOW (elt
) != NULL_TREE
|| CASE_HIGH (elt
) != NULL_TREE
)
4356 error ("invalid default case label in switch statement");
4357 debug_generic_expr (elt
);
4361 n
= gimple_switch_num_labels (stmt
);
4362 for (i
= 1; i
< n
; i
++)
4364 elt
= gimple_switch_label (stmt
, i
);
4366 if (! CASE_LOW (elt
))
4368 error ("invalid case label in switch statement");
4369 debug_generic_expr (elt
);
4373 && ! tree_int_cst_lt (CASE_LOW (elt
), CASE_HIGH (elt
)))
4375 error ("invalid case range in switch statement");
4376 debug_generic_expr (elt
);
4382 if (TREE_TYPE (CASE_LOW (elt
)) != elt_type
4383 || (CASE_HIGH (elt
) && TREE_TYPE (CASE_HIGH (elt
)) != elt_type
))
4385 error ("type mismatch for case label in switch statement");
4386 debug_generic_expr (elt
);
4392 elt_type
= TREE_TYPE (CASE_LOW (elt
));
4393 if (TYPE_PRECISION (index_type
) < TYPE_PRECISION (elt_type
))
4395 error ("type precision mismatch in switch statement");
4400 if (prev_upper_bound
)
4402 if (! tree_int_cst_lt (prev_upper_bound
, CASE_LOW (elt
)))
4404 error ("case labels not sorted in switch statement");
4409 prev_upper_bound
= CASE_HIGH (elt
);
4410 if (! prev_upper_bound
)
4411 prev_upper_bound
= CASE_LOW (elt
);
4417 /* Verify a gimple debug statement STMT.
4418 Returns true if anything is wrong. */
4421 verify_gimple_debug (gimple stmt ATTRIBUTE_UNUSED
)
4423 /* There isn't much that could be wrong in a gimple debug stmt. A
4424 gimple debug bind stmt, for example, maps a tree, that's usually
4425 a VAR_DECL or a PARM_DECL, but that could also be some scalarized
4426 component or member of an aggregate type, to another tree, that
4427 can be an arbitrary expression. These stmts expand into debug
4428 insns, and are converted to debug notes by var-tracking.c. */
4432 /* Verify a gimple label statement STMT.
4433 Returns true if anything is wrong. */
4436 verify_gimple_label (gimple_label stmt
)
4438 tree decl
= gimple_label_label (stmt
);
4442 if (TREE_CODE (decl
) != LABEL_DECL
)
4444 if (!DECL_NONLOCAL (decl
) && !FORCED_LABEL (decl
)
4445 && DECL_CONTEXT (decl
) != current_function_decl
)
4447 error ("label's context is not the current function decl");
4451 uid
= LABEL_DECL_UID (decl
);
4454 || (*label_to_block_map_for_fn (cfun
))[uid
] != gimple_bb (stmt
)))
4456 error ("incorrect entry in label_to_block_map");
4460 uid
= EH_LANDING_PAD_NR (decl
);
4463 eh_landing_pad lp
= get_eh_landing_pad_from_number (uid
);
4464 if (decl
!= lp
->post_landing_pad
)
4466 error ("incorrect setting of landing pad number");
4474 /* Verify the GIMPLE statement STMT. Returns true if there is an
4475 error, otherwise false. */
4478 verify_gimple_stmt (gimple stmt
)
4480 switch (gimple_code (stmt
))
4483 return verify_gimple_assign (as_a
<gimple_assign
> (stmt
));
4486 return verify_gimple_label (as_a
<gimple_label
> (stmt
));
4489 return verify_gimple_call (stmt
);
4492 if (TREE_CODE_CLASS (gimple_cond_code (stmt
)) != tcc_comparison
)
4494 error ("invalid comparison code in gimple cond");
4497 if (!(!gimple_cond_true_label (stmt
)
4498 || TREE_CODE (gimple_cond_true_label (stmt
)) == LABEL_DECL
)
4499 || !(!gimple_cond_false_label (stmt
)
4500 || TREE_CODE (gimple_cond_false_label (stmt
)) == LABEL_DECL
))
4502 error ("invalid labels in gimple cond");
4506 return verify_gimple_comparison (boolean_type_node
,
4507 gimple_cond_lhs (stmt
),
4508 gimple_cond_rhs (stmt
));
4511 return verify_gimple_goto (as_a
<gimple_goto
> (stmt
));
4514 return verify_gimple_switch (as_a
<gimple_switch
> (stmt
));
4517 return verify_gimple_return (as_a
<gimple_return
> (stmt
));
4522 case GIMPLE_TRANSACTION
:
4523 return verify_gimple_transaction (as_a
<gimple_transaction
> (stmt
));
4525 /* Tuples that do not have tree operands. */
4527 case GIMPLE_PREDICT
:
4529 case GIMPLE_EH_DISPATCH
:
4530 case GIMPLE_EH_MUST_NOT_THROW
:
4534 /* OpenMP directives are validated by the FE and never operated
4535 on by the optimizers. Furthermore, GIMPLE_OMP_FOR may contain
4536 non-gimple expressions when the main index variable has had
4537 its address taken. This does not affect the loop itself
4538 because the header of an GIMPLE_OMP_FOR is merely used to determine
4539 how to setup the parallel iteration. */
4543 return verify_gimple_debug (stmt
);
4550 /* Verify the contents of a GIMPLE_PHI. Returns true if there is a problem,
4551 and false otherwise. */
4554 verify_gimple_phi (gimple phi
)
4558 tree phi_result
= gimple_phi_result (phi
);
4563 error ("invalid PHI result");
4567 virtual_p
= virtual_operand_p (phi_result
);
4568 if (TREE_CODE (phi_result
) != SSA_NAME
4570 && SSA_NAME_VAR (phi_result
) != gimple_vop (cfun
)))
4572 error ("invalid PHI result");
4576 for (i
= 0; i
< gimple_phi_num_args (phi
); i
++)
4578 tree t
= gimple_phi_arg_def (phi
, i
);
4582 error ("missing PHI def");
4586 /* Addressable variables do have SSA_NAMEs but they
4587 are not considered gimple values. */
4588 else if ((TREE_CODE (t
) == SSA_NAME
4589 && virtual_p
!= virtual_operand_p (t
))
4591 && (TREE_CODE (t
) != SSA_NAME
4592 || SSA_NAME_VAR (t
) != gimple_vop (cfun
)))
4594 && !is_gimple_val (t
)))
4596 error ("invalid PHI argument");
4597 debug_generic_expr (t
);
4600 #ifdef ENABLE_TYPES_CHECKING
4601 if (!useless_type_conversion_p (TREE_TYPE (phi_result
), TREE_TYPE (t
)))
4603 error ("incompatible types in PHI argument %u", i
);
4604 debug_generic_stmt (TREE_TYPE (phi_result
));
4605 debug_generic_stmt (TREE_TYPE (t
));
4614 /* Verify the GIMPLE statements inside the sequence STMTS. */
4617 verify_gimple_in_seq_2 (gimple_seq stmts
)
4619 gimple_stmt_iterator ittr
;
4622 for (ittr
= gsi_start (stmts
); !gsi_end_p (ittr
); gsi_next (&ittr
))
4624 gimple stmt
= gsi_stmt (ittr
);
4626 switch (gimple_code (stmt
))
4629 err
|= verify_gimple_in_seq_2 (
4630 gimple_bind_body (as_a
<gimple_bind
> (stmt
)));
4634 err
|= verify_gimple_in_seq_2 (gimple_try_eval (stmt
));
4635 err
|= verify_gimple_in_seq_2 (gimple_try_cleanup (stmt
));
4638 case GIMPLE_EH_FILTER
:
4639 err
|= verify_gimple_in_seq_2 (gimple_eh_filter_failure (stmt
));
4642 case GIMPLE_EH_ELSE
:
4644 gimple_eh_else eh_else
= as_a
<gimple_eh_else
> (stmt
);
4645 err
|= verify_gimple_in_seq_2 (gimple_eh_else_n_body (eh_else
));
4646 err
|= verify_gimple_in_seq_2 (gimple_eh_else_e_body (eh_else
));
4651 err
|= verify_gimple_in_seq_2 (gimple_catch_handler (
4652 as_a
<gimple_catch
> (stmt
)));
4655 case GIMPLE_TRANSACTION
:
4656 err
|= verify_gimple_transaction (as_a
<gimple_transaction
> (stmt
));
4661 bool err2
= verify_gimple_stmt (stmt
);
4663 debug_gimple_stmt (stmt
);
4672 /* Verify the contents of a GIMPLE_TRANSACTION. Returns true if there
4673 is a problem, otherwise false. */
4676 verify_gimple_transaction (gimple_transaction stmt
)
4678 tree lab
= gimple_transaction_label (stmt
);
4679 if (lab
!= NULL
&& TREE_CODE (lab
) != LABEL_DECL
)
4681 return verify_gimple_in_seq_2 (gimple_transaction_body (stmt
));
4685 /* Verify the GIMPLE statements inside the statement list STMTS. */
4688 verify_gimple_in_seq (gimple_seq stmts
)
4690 timevar_push (TV_TREE_STMT_VERIFY
);
4691 if (verify_gimple_in_seq_2 (stmts
))
4692 internal_error ("verify_gimple failed");
4693 timevar_pop (TV_TREE_STMT_VERIFY
);
4696 /* Return true when the T can be shared. */
4699 tree_node_can_be_shared (tree t
)
4701 if (IS_TYPE_OR_DECL_P (t
)
4702 || is_gimple_min_invariant (t
)
4703 || TREE_CODE (t
) == SSA_NAME
4704 || t
== error_mark_node
4705 || TREE_CODE (t
) == IDENTIFIER_NODE
)
4708 if (TREE_CODE (t
) == CASE_LABEL_EXPR
)
4717 /* Called via walk_tree. Verify tree sharing. */
4720 verify_node_sharing_1 (tree
*tp
, int *walk_subtrees
, void *data
)
4722 hash_set
<void *> *visited
= (hash_set
<void *> *) data
;
4724 if (tree_node_can_be_shared (*tp
))
4726 *walk_subtrees
= false;
4730 if (visited
->add (*tp
))
4736 /* Called via walk_gimple_stmt. Verify tree sharing. */
4739 verify_node_sharing (tree
*tp
, int *walk_subtrees
, void *data
)
4741 struct walk_stmt_info
*wi
= (struct walk_stmt_info
*) data
;
4742 return verify_node_sharing_1 (tp
, walk_subtrees
, wi
->info
);
4745 static bool eh_error_found
;
4747 verify_eh_throw_stmt_node (const gimple
&stmt
, const int &,
4748 hash_set
<gimple
> *visited
)
4750 if (!visited
->contains (stmt
))
4752 error ("dead STMT in EH table");
4753 debug_gimple_stmt (stmt
);
4754 eh_error_found
= true;
4759 /* Verify if the location LOCs block is in BLOCKS. */
4762 verify_location (hash_set
<tree
> *blocks
, location_t loc
)
4764 tree block
= LOCATION_BLOCK (loc
);
4765 if (block
!= NULL_TREE
4766 && !blocks
->contains (block
))
4768 error ("location references block not in block tree");
4771 if (block
!= NULL_TREE
)
4772 return verify_location (blocks
, BLOCK_SOURCE_LOCATION (block
));
4776 /* Called via walk_tree. Verify that expressions have no blocks. */
4779 verify_expr_no_block (tree
*tp
, int *walk_subtrees
, void *)
4783 *walk_subtrees
= false;
4787 location_t loc
= EXPR_LOCATION (*tp
);
4788 if (LOCATION_BLOCK (loc
) != NULL
)
4794 /* Called via walk_tree. Verify locations of expressions. */
4797 verify_expr_location_1 (tree
*tp
, int *walk_subtrees
, void *data
)
4799 hash_set
<tree
> *blocks
= (hash_set
<tree
> *) data
;
4801 if (TREE_CODE (*tp
) == VAR_DECL
4802 && DECL_HAS_DEBUG_EXPR_P (*tp
))
4804 tree t
= DECL_DEBUG_EXPR (*tp
);
4805 tree addr
= walk_tree (&t
, verify_expr_no_block
, NULL
, NULL
);
4809 if ((TREE_CODE (*tp
) == VAR_DECL
4810 || TREE_CODE (*tp
) == PARM_DECL
4811 || TREE_CODE (*tp
) == RESULT_DECL
)
4812 && DECL_HAS_VALUE_EXPR_P (*tp
))
4814 tree t
= DECL_VALUE_EXPR (*tp
);
4815 tree addr
= walk_tree (&t
, verify_expr_no_block
, NULL
, NULL
);
4822 *walk_subtrees
= false;
4826 location_t loc
= EXPR_LOCATION (*tp
);
4827 if (verify_location (blocks
, loc
))
4833 /* Called via walk_gimple_op. Verify locations of expressions. */
4836 verify_expr_location (tree
*tp
, int *walk_subtrees
, void *data
)
4838 struct walk_stmt_info
*wi
= (struct walk_stmt_info
*) data
;
4839 return verify_expr_location_1 (tp
, walk_subtrees
, wi
->info
);
4842 /* Insert all subblocks of BLOCK into BLOCKS and recurse. */
4845 collect_subblocks (hash_set
<tree
> *blocks
, tree block
)
4848 for (t
= BLOCK_SUBBLOCKS (block
); t
; t
= BLOCK_CHAIN (t
))
4851 collect_subblocks (blocks
, t
);
4855 /* Verify the GIMPLE statements in the CFG of FN. */
4858 verify_gimple_in_cfg (struct function
*fn
, bool verify_nothrow
)
4863 timevar_push (TV_TREE_STMT_VERIFY
);
4864 hash_set
<void *> visited
;
4865 hash_set
<gimple
> visited_stmts
;
4867 /* Collect all BLOCKs referenced by the BLOCK tree of FN. */
4868 hash_set
<tree
> blocks
;
4869 if (DECL_INITIAL (fn
->decl
))
4871 blocks
.add (DECL_INITIAL (fn
->decl
));
4872 collect_subblocks (&blocks
, DECL_INITIAL (fn
->decl
));
4875 FOR_EACH_BB_FN (bb
, fn
)
4877 gimple_stmt_iterator gsi
;
4879 for (gsi
= gsi_start_phis (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
4881 gimple phi
= gsi_stmt (gsi
);
4885 visited_stmts
.add (phi
);
4887 if (gimple_bb (phi
) != bb
)
4889 error ("gimple_bb (phi) is set to a wrong basic block");
4893 err2
|= verify_gimple_phi (phi
);
4895 /* Only PHI arguments have locations. */
4896 if (gimple_location (phi
) != UNKNOWN_LOCATION
)
4898 error ("PHI node with location");
4902 for (i
= 0; i
< gimple_phi_num_args (phi
); i
++)
4904 tree arg
= gimple_phi_arg_def (phi
, i
);
4905 tree addr
= walk_tree (&arg
, verify_node_sharing_1
,
4909 error ("incorrect sharing of tree nodes");
4910 debug_generic_expr (addr
);
4913 location_t loc
= gimple_phi_arg_location (phi
, i
);
4914 if (virtual_operand_p (gimple_phi_result (phi
))
4915 && loc
!= UNKNOWN_LOCATION
)
4917 error ("virtual PHI with argument locations");
4920 addr
= walk_tree (&arg
, verify_expr_location_1
, &blocks
, NULL
);
4923 debug_generic_expr (addr
);
4926 err2
|= verify_location (&blocks
, loc
);
4930 debug_gimple_stmt (phi
);
4934 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
4936 gimple stmt
= gsi_stmt (gsi
);
4938 struct walk_stmt_info wi
;
4942 visited_stmts
.add (stmt
);
4944 if (gimple_bb (stmt
) != bb
)
4946 error ("gimple_bb (stmt) is set to a wrong basic block");
4950 err2
|= verify_gimple_stmt (stmt
);
4951 err2
|= verify_location (&blocks
, gimple_location (stmt
));
4953 memset (&wi
, 0, sizeof (wi
));
4954 wi
.info
= (void *) &visited
;
4955 addr
= walk_gimple_op (stmt
, verify_node_sharing
, &wi
);
4958 error ("incorrect sharing of tree nodes");
4959 debug_generic_expr (addr
);
4963 memset (&wi
, 0, sizeof (wi
));
4964 wi
.info
= (void *) &blocks
;
4965 addr
= walk_gimple_op (stmt
, verify_expr_location
, &wi
);
4968 debug_generic_expr (addr
);
4972 /* ??? Instead of not checking these stmts at all the walker
4973 should know its context via wi. */
4974 if (!is_gimple_debug (stmt
)
4975 && !is_gimple_omp (stmt
))
4977 memset (&wi
, 0, sizeof (wi
));
4978 addr
= walk_gimple_op (stmt
, verify_expr
, &wi
);
4981 debug_generic_expr (addr
);
4982 inform (gimple_location (stmt
), "in statement");
4987 /* If the statement is marked as part of an EH region, then it is
4988 expected that the statement could throw. Verify that when we
4989 have optimizations that simplify statements such that we prove
4990 that they cannot throw, that we update other data structures
4992 lp_nr
= lookup_stmt_eh_lp (stmt
);
4995 if (!stmt_could_throw_p (stmt
))
4999 error ("statement marked for throw, but doesn%'t");
5003 else if (!gsi_one_before_end_p (gsi
))
5005 error ("statement marked for throw in middle of block");
5011 debug_gimple_stmt (stmt
);
5016 eh_error_found
= false;
5017 hash_map
<gimple
, int> *eh_table
= get_eh_throw_stmt_table (cfun
);
5019 eh_table
->traverse
<hash_set
<gimple
> *, verify_eh_throw_stmt_node
>
5022 if (err
|| eh_error_found
)
5023 internal_error ("verify_gimple failed");
5025 verify_histograms ();
5026 timevar_pop (TV_TREE_STMT_VERIFY
);
5030 /* Verifies that the flow information is OK. */
5033 gimple_verify_flow_info (void)
5037 gimple_stmt_iterator gsi
;
5042 if (ENTRY_BLOCK_PTR_FOR_FN (cfun
)->il
.gimple
.seq
5043 || ENTRY_BLOCK_PTR_FOR_FN (cfun
)->il
.gimple
.phi_nodes
)
5045 error ("ENTRY_BLOCK has IL associated with it");
5049 if (EXIT_BLOCK_PTR_FOR_FN (cfun
)->il
.gimple
.seq
5050 || EXIT_BLOCK_PTR_FOR_FN (cfun
)->il
.gimple
.phi_nodes
)
5052 error ("EXIT_BLOCK has IL associated with it");
5056 FOR_EACH_EDGE (e
, ei
, EXIT_BLOCK_PTR_FOR_FN (cfun
)->preds
)
5057 if (e
->flags
& EDGE_FALLTHRU
)
5059 error ("fallthru to exit from bb %d", e
->src
->index
);
5063 FOR_EACH_BB_FN (bb
, cfun
)
5065 bool found_ctrl_stmt
= false;
5069 /* Skip labels on the start of basic block. */
5070 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
5073 gimple prev_stmt
= stmt
;
5075 stmt
= gsi_stmt (gsi
);
5077 if (gimple_code (stmt
) != GIMPLE_LABEL
)
5080 label
= gimple_label_label (stmt
);
5081 if (prev_stmt
&& DECL_NONLOCAL (label
))
5083 error ("nonlocal label ");
5084 print_generic_expr (stderr
, label
, 0);
5085 fprintf (stderr
, " is not first in a sequence of labels in bb %d",
5090 if (prev_stmt
&& EH_LANDING_PAD_NR (label
) != 0)
5092 error ("EH landing pad label ");
5093 print_generic_expr (stderr
, label
, 0);
5094 fprintf (stderr
, " is not first in a sequence of labels in bb %d",
5099 if (label_to_block (label
) != bb
)
5102 print_generic_expr (stderr
, label
, 0);
5103 fprintf (stderr
, " to block does not match in bb %d",
5108 if (decl_function_context (label
) != current_function_decl
)
5111 print_generic_expr (stderr
, label
, 0);
5112 fprintf (stderr
, " has incorrect context in bb %d",
5118 /* Verify that body of basic block BB is free of control flow. */
5119 for (; !gsi_end_p (gsi
); gsi_next (&gsi
))
5121 gimple stmt
= gsi_stmt (gsi
);
5123 if (found_ctrl_stmt
)
5125 error ("control flow in the middle of basic block %d",
5130 if (stmt_ends_bb_p (stmt
))
5131 found_ctrl_stmt
= true;
5133 if (gimple_code (stmt
) == GIMPLE_LABEL
)
5136 print_generic_expr (stderr
, gimple_label_label (stmt
), 0);
5137 fprintf (stderr
, " in the middle of basic block %d", bb
->index
);
5142 gsi
= gsi_last_bb (bb
);
5143 if (gsi_end_p (gsi
))
5146 stmt
= gsi_stmt (gsi
);
5148 if (gimple_code (stmt
) == GIMPLE_LABEL
)
5151 err
|= verify_eh_edges (stmt
);
5153 if (is_ctrl_stmt (stmt
))
5155 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
5156 if (e
->flags
& EDGE_FALLTHRU
)
5158 error ("fallthru edge after a control statement in bb %d",
5164 if (gimple_code (stmt
) != GIMPLE_COND
)
5166 /* Verify that there are no edges with EDGE_TRUE/FALSE_FLAG set
5167 after anything else but if statement. */
5168 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
5169 if (e
->flags
& (EDGE_TRUE_VALUE
| EDGE_FALSE_VALUE
))
5171 error ("true/false edge after a non-GIMPLE_COND in bb %d",
5177 switch (gimple_code (stmt
))
5184 extract_true_false_edges_from_block (bb
, &true_edge
, &false_edge
);
5188 || !(true_edge
->flags
& EDGE_TRUE_VALUE
)
5189 || !(false_edge
->flags
& EDGE_FALSE_VALUE
)
5190 || (true_edge
->flags
& (EDGE_FALLTHRU
| EDGE_ABNORMAL
))
5191 || (false_edge
->flags
& (EDGE_FALLTHRU
| EDGE_ABNORMAL
))
5192 || EDGE_COUNT (bb
->succs
) >= 3)
5194 error ("wrong outgoing edge flags at end of bb %d",
5202 if (simple_goto_p (stmt
))
5204 error ("explicit goto at end of bb %d", bb
->index
);
5209 /* FIXME. We should double check that the labels in the
5210 destination blocks have their address taken. */
5211 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
5212 if ((e
->flags
& (EDGE_FALLTHRU
| EDGE_TRUE_VALUE
5213 | EDGE_FALSE_VALUE
))
5214 || !(e
->flags
& EDGE_ABNORMAL
))
5216 error ("wrong outgoing edge flags at end of bb %d",
5224 if (!gimple_call_builtin_p (stmt
, BUILT_IN_RETURN
))
5226 /* ... fallthru ... */
5228 if (!single_succ_p (bb
)
5229 || (single_succ_edge (bb
)->flags
5230 & (EDGE_FALLTHRU
| EDGE_ABNORMAL
5231 | EDGE_TRUE_VALUE
| EDGE_FALSE_VALUE
)))
5233 error ("wrong outgoing edge flags at end of bb %d", bb
->index
);
5236 if (single_succ (bb
) != EXIT_BLOCK_PTR_FOR_FN (cfun
))
5238 error ("return edge does not point to exit in bb %d",
5246 gimple_switch switch_stmt
= as_a
<gimple_switch
> (stmt
);
5251 n
= gimple_switch_num_labels (switch_stmt
);
5253 /* Mark all the destination basic blocks. */
5254 for (i
= 0; i
< n
; ++i
)
5256 tree lab
= CASE_LABEL (gimple_switch_label (switch_stmt
, i
));
5257 basic_block label_bb
= label_to_block (lab
);
5258 gcc_assert (!label_bb
->aux
|| label_bb
->aux
== (void *)1);
5259 label_bb
->aux
= (void *)1;
5262 /* Verify that the case labels are sorted. */
5263 prev
= gimple_switch_label (switch_stmt
, 0);
5264 for (i
= 1; i
< n
; ++i
)
5266 tree c
= gimple_switch_label (switch_stmt
, i
);
5269 error ("found default case not at the start of "
5275 && !tree_int_cst_lt (CASE_LOW (prev
), CASE_LOW (c
)))
5277 error ("case labels not sorted: ");
5278 print_generic_expr (stderr
, prev
, 0);
5279 fprintf (stderr
," is greater than ");
5280 print_generic_expr (stderr
, c
, 0);
5281 fprintf (stderr
," but comes before it.\n");
5286 /* VRP will remove the default case if it can prove it will
5287 never be executed. So do not verify there always exists
5288 a default case here. */
5290 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
5294 error ("extra outgoing edge %d->%d",
5295 bb
->index
, e
->dest
->index
);
5299 e
->dest
->aux
= (void *)2;
5300 if ((e
->flags
& (EDGE_FALLTHRU
| EDGE_ABNORMAL
5301 | EDGE_TRUE_VALUE
| EDGE_FALSE_VALUE
)))
5303 error ("wrong outgoing edge flags at end of bb %d",
5309 /* Check that we have all of them. */
5310 for (i
= 0; i
< n
; ++i
)
5312 tree lab
= CASE_LABEL (gimple_switch_label (switch_stmt
, i
));
5313 basic_block label_bb
= label_to_block (lab
);
5315 if (label_bb
->aux
!= (void *)2)
5317 error ("missing edge %i->%i", bb
->index
, label_bb
->index
);
5322 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
5323 e
->dest
->aux
= (void *)0;
5327 case GIMPLE_EH_DISPATCH
:
5328 err
|= verify_eh_dispatch_edge (as_a
<gimple_eh_dispatch
> (stmt
));
5336 if (dom_info_state (CDI_DOMINATORS
) >= DOM_NO_FAST_QUERY
)
5337 verify_dominators (CDI_DOMINATORS
);
5343 /* Updates phi nodes after creating a forwarder block joined
5344 by edge FALLTHRU. */
5347 gimple_make_forwarder_block (edge fallthru
)
5351 basic_block dummy
, bb
;
5353 gimple_phi_iterator gsi
;
5355 dummy
= fallthru
->src
;
5356 bb
= fallthru
->dest
;
5358 if (single_pred_p (bb
))
5361 /* If we redirected a branch we must create new PHI nodes at the
5363 for (gsi
= gsi_start_phis (dummy
); !gsi_end_p (gsi
); gsi_next (&gsi
))
5365 gimple_phi phi
, new_phi
;
5368 var
= gimple_phi_result (phi
);
5369 new_phi
= create_phi_node (var
, bb
);
5370 gimple_phi_set_result (phi
, copy_ssa_name (var
, phi
));
5371 add_phi_arg (new_phi
, gimple_phi_result (phi
), fallthru
,
5375 /* Add the arguments we have stored on edges. */
5376 FOR_EACH_EDGE (e
, ei
, bb
->preds
)
5381 flush_pending_stmts (e
);
5386 /* Return a non-special label in the head of basic block BLOCK.
5387 Create one if it doesn't exist. */
5390 gimple_block_label (basic_block bb
)
5392 gimple_stmt_iterator i
, s
= gsi_start_bb (bb
);
5397 for (i
= s
; !gsi_end_p (i
); first
= false, gsi_next (&i
))
5399 stmt
= gsi_stmt (i
);
5400 if (gimple_code (stmt
) != GIMPLE_LABEL
)
5402 label
= gimple_label_label (stmt
);
5403 if (!DECL_NONLOCAL (label
))
5406 gsi_move_before (&i
, &s
);
5411 label
= create_artificial_label (UNKNOWN_LOCATION
);
5412 stmt
= gimple_build_label (label
);
5413 gsi_insert_before (&s
, stmt
, GSI_NEW_STMT
);
5418 /* Attempt to perform edge redirection by replacing a possibly complex
5419 jump instruction by a goto or by removing the jump completely.
5420 This can apply only if all edges now point to the same block. The
5421 parameters and return values are equivalent to
5422 redirect_edge_and_branch. */
5425 gimple_try_redirect_by_replacing_jump (edge e
, basic_block target
)
5427 basic_block src
= e
->src
;
5428 gimple_stmt_iterator i
;
5431 /* We can replace or remove a complex jump only when we have exactly
5433 if (EDGE_COUNT (src
->succs
) != 2
5434 /* Verify that all targets will be TARGET. Specifically, the
5435 edge that is not E must also go to TARGET. */
5436 || EDGE_SUCC (src
, EDGE_SUCC (src
, 0) == e
)->dest
!= target
)
5439 i
= gsi_last_bb (src
);
5443 stmt
= gsi_stmt (i
);
5445 if (gimple_code (stmt
) == GIMPLE_COND
|| gimple_code (stmt
) == GIMPLE_SWITCH
)
5447 gsi_remove (&i
, true);
5448 e
= ssa_redirect_edge (e
, target
);
5449 e
->flags
= EDGE_FALLTHRU
;
5457 /* Redirect E to DEST. Return NULL on failure. Otherwise, return the
5458 edge representing the redirected branch. */
5461 gimple_redirect_edge_and_branch (edge e
, basic_block dest
)
5463 basic_block bb
= e
->src
;
5464 gimple_stmt_iterator gsi
;
5468 if (e
->flags
& EDGE_ABNORMAL
)
5471 if (e
->dest
== dest
)
5474 if (e
->flags
& EDGE_EH
)
5475 return redirect_eh_edge (e
, dest
);
5477 if (e
->src
!= ENTRY_BLOCK_PTR_FOR_FN (cfun
))
5479 ret
= gimple_try_redirect_by_replacing_jump (e
, dest
);
5484 gsi
= gsi_last_bb (bb
);
5485 stmt
= gsi_end_p (gsi
) ? NULL
: gsi_stmt (gsi
);
5487 switch (stmt
? gimple_code (stmt
) : GIMPLE_ERROR_MARK
)
5490 /* For COND_EXPR, we only need to redirect the edge. */
5494 /* No non-abnormal edges should lead from a non-simple goto, and
5495 simple ones should be represented implicitly. */
5500 gimple_switch switch_stmt
= as_a
<gimple_switch
> (stmt
);
5501 tree label
= gimple_block_label (dest
);
5502 tree cases
= get_cases_for_edge (e
, switch_stmt
);
5504 /* If we have a list of cases associated with E, then use it
5505 as it's a lot faster than walking the entire case vector. */
5508 edge e2
= find_edge (e
->src
, dest
);
5515 CASE_LABEL (cases
) = label
;
5516 cases
= CASE_CHAIN (cases
);
5519 /* If there was already an edge in the CFG, then we need
5520 to move all the cases associated with E to E2. */
5523 tree cases2
= get_cases_for_edge (e2
, switch_stmt
);
5525 CASE_CHAIN (last
) = CASE_CHAIN (cases2
);
5526 CASE_CHAIN (cases2
) = first
;
5528 bitmap_set_bit (touched_switch_bbs
, gimple_bb (stmt
)->index
);
5532 size_t i
, n
= gimple_switch_num_labels (switch_stmt
);
5534 for (i
= 0; i
< n
; i
++)
5536 tree elt
= gimple_switch_label (switch_stmt
, i
);
5537 if (label_to_block (CASE_LABEL (elt
)) == e
->dest
)
5538 CASE_LABEL (elt
) = label
;
5546 gimple_asm asm_stmt
= as_a
<gimple_asm
> (stmt
);
5547 int i
, n
= gimple_asm_nlabels (asm_stmt
);
5550 for (i
= 0; i
< n
; ++i
)
5552 tree cons
= gimple_asm_label_op (asm_stmt
, i
);
5553 if (label_to_block (TREE_VALUE (cons
)) == e
->dest
)
5556 label
= gimple_block_label (dest
);
5557 TREE_VALUE (cons
) = label
;
5561 /* If we didn't find any label matching the former edge in the
5562 asm labels, we must be redirecting the fallthrough
5564 gcc_assert (label
|| (e
->flags
& EDGE_FALLTHRU
));
5569 gsi_remove (&gsi
, true);
5570 e
->flags
|= EDGE_FALLTHRU
;
5573 case GIMPLE_OMP_RETURN
:
5574 case GIMPLE_OMP_CONTINUE
:
5575 case GIMPLE_OMP_SECTIONS_SWITCH
:
5576 case GIMPLE_OMP_FOR
:
5577 /* The edges from OMP constructs can be simply redirected. */
5580 case GIMPLE_EH_DISPATCH
:
5581 if (!(e
->flags
& EDGE_FALLTHRU
))
5582 redirect_eh_dispatch_edge (as_a
<gimple_eh_dispatch
> (stmt
), e
, dest
);
5585 case GIMPLE_TRANSACTION
:
5586 /* The ABORT edge has a stored label associated with it, otherwise
5587 the edges are simply redirectable. */
5589 gimple_transaction_set_label (as_a
<gimple_transaction
> (stmt
),
5590 gimple_block_label (dest
));
5594 /* Otherwise it must be a fallthru edge, and we don't need to
5595 do anything besides redirecting it. */
5596 gcc_assert (e
->flags
& EDGE_FALLTHRU
);
5600 /* Update/insert PHI nodes as necessary. */
5602 /* Now update the edges in the CFG. */
5603 e
= ssa_redirect_edge (e
, dest
);
5608 /* Returns true if it is possible to remove edge E by redirecting
5609 it to the destination of the other edge from E->src. */
5612 gimple_can_remove_branch_p (const_edge e
)
5614 if (e
->flags
& (EDGE_ABNORMAL
| EDGE_EH
))
5620 /* Simple wrapper, as we can always redirect fallthru edges. */
5623 gimple_redirect_edge_and_branch_force (edge e
, basic_block dest
)
5625 e
= gimple_redirect_edge_and_branch (e
, dest
);
5632 /* Splits basic block BB after statement STMT (but at least after the
5633 labels). If STMT is NULL, BB is split just after the labels. */
5636 gimple_split_block (basic_block bb
, void *stmt
)
5638 gimple_stmt_iterator gsi
;
5639 gimple_stmt_iterator gsi_tgt
;
5646 new_bb
= create_empty_bb (bb
);
5648 /* Redirect the outgoing edges. */
5649 new_bb
->succs
= bb
->succs
;
5651 FOR_EACH_EDGE (e
, ei
, new_bb
->succs
)
5654 if (stmt
&& gimple_code ((gimple
) stmt
) == GIMPLE_LABEL
)
5657 /* Move everything from GSI to the new basic block. */
5658 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
5660 act
= gsi_stmt (gsi
);
5661 if (gimple_code (act
) == GIMPLE_LABEL
)
5674 if (gsi_end_p (gsi
))
5677 /* Split the statement list - avoid re-creating new containers as this
5678 brings ugly quadratic memory consumption in the inliner.
5679 (We are still quadratic since we need to update stmt BB pointers,
5681 gsi_split_seq_before (&gsi
, &list
);
5682 set_bb_seq (new_bb
, list
);
5683 for (gsi_tgt
= gsi_start (list
);
5684 !gsi_end_p (gsi_tgt
); gsi_next (&gsi_tgt
))
5685 gimple_set_bb (gsi_stmt (gsi_tgt
), new_bb
);
5691 /* Moves basic block BB after block AFTER. */
5694 gimple_move_block_after (basic_block bb
, basic_block after
)
5696 if (bb
->prev_bb
== after
)
5700 link_block (bb
, after
);
5706 /* Return TRUE if block BB has no executable statements, otherwise return
5710 gimple_empty_block_p (basic_block bb
)
5712 /* BB must have no executable statements. */
5713 gimple_stmt_iterator gsi
= gsi_after_labels (bb
);
5716 if (gsi_end_p (gsi
))
5718 if (is_gimple_debug (gsi_stmt (gsi
)))
5719 gsi_next_nondebug (&gsi
);
5720 return gsi_end_p (gsi
);
5724 /* Split a basic block if it ends with a conditional branch and if the
5725 other part of the block is not empty. */
5728 gimple_split_block_before_cond_jump (basic_block bb
)
5730 gimple last
, split_point
;
5731 gimple_stmt_iterator gsi
= gsi_last_nondebug_bb (bb
);
5732 if (gsi_end_p (gsi
))
5734 last
= gsi_stmt (gsi
);
5735 if (gimple_code (last
) != GIMPLE_COND
5736 && gimple_code (last
) != GIMPLE_SWITCH
)
5738 gsi_prev_nondebug (&gsi
);
5739 split_point
= gsi_stmt (gsi
);
5740 return split_block (bb
, split_point
)->dest
;
5744 /* Return true if basic_block can be duplicated. */
5747 gimple_can_duplicate_bb_p (const_basic_block bb ATTRIBUTE_UNUSED
)
5752 /* Create a duplicate of the basic block BB. NOTE: This does not
5753 preserve SSA form. */
5756 gimple_duplicate_bb (basic_block bb
)
5759 gimple_stmt_iterator gsi
, gsi_tgt
;
5760 gimple_seq phis
= phi_nodes (bb
);
5761 gimple phi
, stmt
, copy
;
5763 new_bb
= create_empty_bb (EXIT_BLOCK_PTR_FOR_FN (cfun
)->prev_bb
);
5765 /* Copy the PHI nodes. We ignore PHI node arguments here because
5766 the incoming edges have not been setup yet. */
5767 for (gsi
= gsi_start (phis
); !gsi_end_p (gsi
); gsi_next (&gsi
))
5769 phi
= gsi_stmt (gsi
);
5770 copy
= create_phi_node (NULL_TREE
, new_bb
);
5771 create_new_def_for (gimple_phi_result (phi
), copy
,
5772 gimple_phi_result_ptr (copy
));
5773 gimple_set_uid (copy
, gimple_uid (phi
));
5776 gsi_tgt
= gsi_start_bb (new_bb
);
5777 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
5779 def_operand_p def_p
;
5780 ssa_op_iter op_iter
;
5783 stmt
= gsi_stmt (gsi
);
5784 if (gimple_code (stmt
) == GIMPLE_LABEL
)
5787 /* Don't duplicate label debug stmts. */
5788 if (gimple_debug_bind_p (stmt
)
5789 && TREE_CODE (gimple_debug_bind_get_var (stmt
))
5793 /* Create a new copy of STMT and duplicate STMT's virtual
5795 copy
= gimple_copy (stmt
);
5796 gsi_insert_after (&gsi_tgt
, copy
, GSI_NEW_STMT
);
5798 maybe_duplicate_eh_stmt (copy
, stmt
);
5799 gimple_duplicate_stmt_histograms (cfun
, copy
, cfun
, stmt
);
5801 /* When copying around a stmt writing into a local non-user
5802 aggregate, make sure it won't share stack slot with other
5804 lhs
= gimple_get_lhs (stmt
);
5805 if (lhs
&& TREE_CODE (lhs
) != SSA_NAME
)
5807 tree base
= get_base_address (lhs
);
5809 && (TREE_CODE (base
) == VAR_DECL
5810 || TREE_CODE (base
) == RESULT_DECL
)
5811 && DECL_IGNORED_P (base
)
5812 && !TREE_STATIC (base
)
5813 && !DECL_EXTERNAL (base
)
5814 && (TREE_CODE (base
) != VAR_DECL
5815 || !DECL_HAS_VALUE_EXPR_P (base
)))
5816 DECL_NONSHAREABLE (base
) = 1;
5819 /* Create new names for all the definitions created by COPY and
5820 add replacement mappings for each new name. */
5821 FOR_EACH_SSA_DEF_OPERAND (def_p
, copy
, op_iter
, SSA_OP_ALL_DEFS
)
5822 create_new_def_for (DEF_FROM_PTR (def_p
), copy
, def_p
);
5828 /* Adds phi node arguments for edge E_COPY after basic block duplication. */
5831 add_phi_args_after_copy_edge (edge e_copy
)
5833 basic_block bb
, bb_copy
= e_copy
->src
, dest
;
5836 gimple_phi phi
, phi_copy
;
5838 gimple_phi_iterator psi
, psi_copy
;
5840 if (gimple_seq_empty_p (phi_nodes (e_copy
->dest
)))
5843 bb
= bb_copy
->flags
& BB_DUPLICATED
? get_bb_original (bb_copy
) : bb_copy
;
5845 if (e_copy
->dest
->flags
& BB_DUPLICATED
)
5846 dest
= get_bb_original (e_copy
->dest
);
5848 dest
= e_copy
->dest
;
5850 e
= find_edge (bb
, dest
);
5853 /* During loop unrolling the target of the latch edge is copied.
5854 In this case we are not looking for edge to dest, but to
5855 duplicated block whose original was dest. */
5856 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
5858 if ((e
->dest
->flags
& BB_DUPLICATED
)
5859 && get_bb_original (e
->dest
) == dest
)
5863 gcc_assert (e
!= NULL
);
5866 for (psi
= gsi_start_phis (e
->dest
),
5867 psi_copy
= gsi_start_phis (e_copy
->dest
);
5869 gsi_next (&psi
), gsi_next (&psi_copy
))
5872 phi_copy
= psi_copy
.phi ();
5873 def
= PHI_ARG_DEF_FROM_EDGE (phi
, e
);
5874 add_phi_arg (phi_copy
, def
, e_copy
,
5875 gimple_phi_arg_location_from_edge (phi
, e
));
5880 /* Basic block BB_COPY was created by code duplication. Add phi node
5881 arguments for edges going out of BB_COPY. The blocks that were
5882 duplicated have BB_DUPLICATED set. */
5885 add_phi_args_after_copy_bb (basic_block bb_copy
)
5890 FOR_EACH_EDGE (e_copy
, ei
, bb_copy
->succs
)
5892 add_phi_args_after_copy_edge (e_copy
);
5896 /* Blocks in REGION_COPY array of length N_REGION were created by
5897 duplication of basic blocks. Add phi node arguments for edges
5898 going from these blocks. If E_COPY is not NULL, also add
5899 phi node arguments for its destination.*/
5902 add_phi_args_after_copy (basic_block
*region_copy
, unsigned n_region
,
5907 for (i
= 0; i
< n_region
; i
++)
5908 region_copy
[i
]->flags
|= BB_DUPLICATED
;
5910 for (i
= 0; i
< n_region
; i
++)
5911 add_phi_args_after_copy_bb (region_copy
[i
]);
5913 add_phi_args_after_copy_edge (e_copy
);
5915 for (i
= 0; i
< n_region
; i
++)
5916 region_copy
[i
]->flags
&= ~BB_DUPLICATED
;
5919 /* Duplicates a REGION (set of N_REGION basic blocks) with just a single
5920 important exit edge EXIT. By important we mean that no SSA name defined
5921 inside region is live over the other exit edges of the region. All entry
5922 edges to the region must go to ENTRY->dest. The edge ENTRY is redirected
5923 to the duplicate of the region. Dominance and loop information is
5924 updated if UPDATE_DOMINANCE is true, but not the SSA web. If
5925 UPDATE_DOMINANCE is false then we assume that the caller will update the
5926 dominance information after calling this function. The new basic
5927 blocks are stored to REGION_COPY in the same order as they had in REGION,
5928 provided that REGION_COPY is not NULL.
5929 The function returns false if it is unable to copy the region,
5933 gimple_duplicate_sese_region (edge entry
, edge exit
,
5934 basic_block
*region
, unsigned n_region
,
5935 basic_block
*region_copy
,
5936 bool update_dominance
)
5939 bool free_region_copy
= false, copying_header
= false;
5940 struct loop
*loop
= entry
->dest
->loop_father
;
5942 vec
<basic_block
> doms
;
5944 int total_freq
= 0, entry_freq
= 0;
5945 gcov_type total_count
= 0, entry_count
= 0;
5947 if (!can_copy_bbs_p (region
, n_region
))
5950 /* Some sanity checking. Note that we do not check for all possible
5951 missuses of the functions. I.e. if you ask to copy something weird,
5952 it will work, but the state of structures probably will not be
5954 for (i
= 0; i
< n_region
; i
++)
5956 /* We do not handle subloops, i.e. all the blocks must belong to the
5958 if (region
[i
]->loop_father
!= loop
)
5961 if (region
[i
] != entry
->dest
5962 && region
[i
] == loop
->header
)
5966 /* In case the function is used for loop header copying (which is the primary
5967 use), ensure that EXIT and its copy will be new latch and entry edges. */
5968 if (loop
->header
== entry
->dest
)
5970 copying_header
= true;
5972 if (!dominated_by_p (CDI_DOMINATORS
, loop
->latch
, exit
->src
))
5975 for (i
= 0; i
< n_region
; i
++)
5976 if (region
[i
] != exit
->src
5977 && dominated_by_p (CDI_DOMINATORS
, region
[i
], exit
->src
))
5981 initialize_original_copy_tables ();
5984 set_loop_copy (loop
, loop_outer (loop
));
5986 set_loop_copy (loop
, loop
);
5990 region_copy
= XNEWVEC (basic_block
, n_region
);
5991 free_region_copy
= true;
5994 /* Record blocks outside the region that are dominated by something
5996 if (update_dominance
)
5999 doms
= get_dominated_by_region (CDI_DOMINATORS
, region
, n_region
);
6002 if (entry
->dest
->count
)
6004 total_count
= entry
->dest
->count
;
6005 entry_count
= entry
->count
;
6006 /* Fix up corner cases, to avoid division by zero or creation of negative
6008 if (entry_count
> total_count
)
6009 entry_count
= total_count
;
6013 total_freq
= entry
->dest
->frequency
;
6014 entry_freq
= EDGE_FREQUENCY (entry
);
6015 /* Fix up corner cases, to avoid division by zero or creation of negative
6017 if (total_freq
== 0)
6019 else if (entry_freq
> total_freq
)
6020 entry_freq
= total_freq
;
6023 copy_bbs (region
, n_region
, region_copy
, &exit
, 1, &exit_copy
, loop
,
6024 split_edge_bb_loc (entry
), update_dominance
);
6027 scale_bbs_frequencies_gcov_type (region
, n_region
,
6028 total_count
- entry_count
,
6030 scale_bbs_frequencies_gcov_type (region_copy
, n_region
, entry_count
,
6035 scale_bbs_frequencies_int (region
, n_region
, total_freq
- entry_freq
,
6037 scale_bbs_frequencies_int (region_copy
, n_region
, entry_freq
, total_freq
);
6042 loop
->header
= exit
->dest
;
6043 loop
->latch
= exit
->src
;
6046 /* Redirect the entry and add the phi node arguments. */
6047 redirected
= redirect_edge_and_branch (entry
, get_bb_copy (entry
->dest
));
6048 gcc_assert (redirected
!= NULL
);
6049 flush_pending_stmts (entry
);
6051 /* Concerning updating of dominators: We must recount dominators
6052 for entry block and its copy. Anything that is outside of the
6053 region, but was dominated by something inside needs recounting as
6055 if (update_dominance
)
6057 set_immediate_dominator (CDI_DOMINATORS
, entry
->dest
, entry
->src
);
6058 doms
.safe_push (get_bb_original (entry
->dest
));
6059 iterate_fix_dominators (CDI_DOMINATORS
, doms
, false);
6063 /* Add the other PHI node arguments. */
6064 add_phi_args_after_copy (region_copy
, n_region
, NULL
);
6066 if (free_region_copy
)
6069 free_original_copy_tables ();
6073 /* Checks if BB is part of the region defined by N_REGION BBS. */
6075 bb_part_of_region_p (basic_block bb
, basic_block
* bbs
, unsigned n_region
)
6079 for (n
= 0; n
< n_region
; n
++)
6087 /* Duplicates REGION consisting of N_REGION blocks. The new blocks
6088 are stored to REGION_COPY in the same order in that they appear
6089 in REGION, if REGION_COPY is not NULL. ENTRY is the entry to
6090 the region, EXIT an exit from it. The condition guarding EXIT
6091 is moved to ENTRY. Returns true if duplication succeeds, false
6117 gimple_duplicate_sese_tail (edge entry ATTRIBUTE_UNUSED
, edge exit ATTRIBUTE_UNUSED
,
6118 basic_block
*region ATTRIBUTE_UNUSED
, unsigned n_region ATTRIBUTE_UNUSED
,
6119 basic_block
*region_copy ATTRIBUTE_UNUSED
)
6122 bool free_region_copy
= false;
6123 struct loop
*loop
= exit
->dest
->loop_father
;
6124 struct loop
*orig_loop
= entry
->dest
->loop_father
;
6125 basic_block switch_bb
, entry_bb
, nentry_bb
;
6126 vec
<basic_block
> doms
;
6127 int total_freq
= 0, exit_freq
= 0;
6128 gcov_type total_count
= 0, exit_count
= 0;
6129 edge exits
[2], nexits
[2], e
;
6130 gimple_stmt_iterator gsi
;
6133 basic_block exit_bb
;
6134 gimple_stmt_iterator psi
;
6137 struct loop
*target
, *aloop
, *cloop
;
6139 gcc_assert (EDGE_COUNT (exit
->src
->succs
) == 2);
6141 exits
[1] = EDGE_SUCC (exit
->src
, EDGE_SUCC (exit
->src
, 0) == exit
);
6143 if (!can_copy_bbs_p (region
, n_region
))
6146 initialize_original_copy_tables ();
6147 set_loop_copy (orig_loop
, loop
);
6150 for (aloop
= orig_loop
->inner
; aloop
; aloop
= aloop
->next
)
6152 if (bb_part_of_region_p (aloop
->header
, region
, n_region
))
6154 cloop
= duplicate_loop (aloop
, target
);
6155 duplicate_subloops (aloop
, cloop
);
6161 region_copy
= XNEWVEC (basic_block
, n_region
);
6162 free_region_copy
= true;
6165 gcc_assert (!need_ssa_update_p (cfun
));
6167 /* Record blocks outside the region that are dominated by something
6169 doms
= get_dominated_by_region (CDI_DOMINATORS
, region
, n_region
);
6171 if (exit
->src
->count
)
6173 total_count
= exit
->src
->count
;
6174 exit_count
= exit
->count
;
6175 /* Fix up corner cases, to avoid division by zero or creation of negative
6177 if (exit_count
> total_count
)
6178 exit_count
= total_count
;
6182 total_freq
= exit
->src
->frequency
;
6183 exit_freq
= EDGE_FREQUENCY (exit
);
6184 /* Fix up corner cases, to avoid division by zero or creation of negative
6186 if (total_freq
== 0)
6188 if (exit_freq
> total_freq
)
6189 exit_freq
= total_freq
;
6192 copy_bbs (region
, n_region
, region_copy
, exits
, 2, nexits
, orig_loop
,
6193 split_edge_bb_loc (exit
), true);
6196 scale_bbs_frequencies_gcov_type (region
, n_region
,
6197 total_count
- exit_count
,
6199 scale_bbs_frequencies_gcov_type (region_copy
, n_region
, exit_count
,
6204 scale_bbs_frequencies_int (region
, n_region
, total_freq
- exit_freq
,
6206 scale_bbs_frequencies_int (region_copy
, n_region
, exit_freq
, total_freq
);
6209 /* Create the switch block, and put the exit condition to it. */
6210 entry_bb
= entry
->dest
;
6211 nentry_bb
= get_bb_copy (entry_bb
);
6212 if (!last_stmt (entry
->src
)
6213 || !stmt_ends_bb_p (last_stmt (entry
->src
)))
6214 switch_bb
= entry
->src
;
6216 switch_bb
= split_edge (entry
);
6217 set_immediate_dominator (CDI_DOMINATORS
, nentry_bb
, switch_bb
);
6219 gsi
= gsi_last_bb (switch_bb
);
6220 cond_stmt
= last_stmt (exit
->src
);
6221 gcc_assert (gimple_code (cond_stmt
) == GIMPLE_COND
);
6222 cond_stmt
= gimple_copy (cond_stmt
);
6224 gsi_insert_after (&gsi
, cond_stmt
, GSI_NEW_STMT
);
6226 sorig
= single_succ_edge (switch_bb
);
6227 sorig
->flags
= exits
[1]->flags
;
6228 snew
= make_edge (switch_bb
, nentry_bb
, exits
[0]->flags
);
6230 /* Register the new edge from SWITCH_BB in loop exit lists. */
6231 rescan_loop_exit (snew
, true, false);
6233 /* Add the PHI node arguments. */
6234 add_phi_args_after_copy (region_copy
, n_region
, snew
);
6236 /* Get rid of now superfluous conditions and associated edges (and phi node
6238 exit_bb
= exit
->dest
;
6240 e
= redirect_edge_and_branch (exits
[0], exits
[1]->dest
);
6241 PENDING_STMT (e
) = NULL
;
6243 /* The latch of ORIG_LOOP was copied, and so was the backedge
6244 to the original header. We redirect this backedge to EXIT_BB. */
6245 for (i
= 0; i
< n_region
; i
++)
6246 if (get_bb_original (region_copy
[i
]) == orig_loop
->latch
)
6248 gcc_assert (single_succ_edge (region_copy
[i
]));
6249 e
= redirect_edge_and_branch (single_succ_edge (region_copy
[i
]), exit_bb
);
6250 PENDING_STMT (e
) = NULL
;
6251 for (psi
= gsi_start_phis (exit_bb
);
6255 phi
= gsi_stmt (psi
);
6256 def
= PHI_ARG_DEF (phi
, nexits
[0]->dest_idx
);
6257 add_phi_arg (phi
, def
, e
, gimple_phi_arg_location_from_edge (phi
, e
));
6260 e
= redirect_edge_and_branch (nexits
[1], nexits
[0]->dest
);
6261 PENDING_STMT (e
) = NULL
;
6263 /* Anything that is outside of the region, but was dominated by something
6264 inside needs to update dominance info. */
6265 iterate_fix_dominators (CDI_DOMINATORS
, doms
, false);
6267 /* Update the SSA web. */
6268 update_ssa (TODO_update_ssa
);
6270 if (free_region_copy
)
6273 free_original_copy_tables ();
6277 /* Add all the blocks dominated by ENTRY to the array BBS_P. Stop
6278 adding blocks when the dominator traversal reaches EXIT. This
6279 function silently assumes that ENTRY strictly dominates EXIT. */
6282 gather_blocks_in_sese_region (basic_block entry
, basic_block exit
,
6283 vec
<basic_block
> *bbs_p
)
6287 for (son
= first_dom_son (CDI_DOMINATORS
, entry
);
6289 son
= next_dom_son (CDI_DOMINATORS
, son
))
6291 bbs_p
->safe_push (son
);
6293 gather_blocks_in_sese_region (son
, exit
, bbs_p
);
6297 /* Replaces *TP with a duplicate (belonging to function TO_CONTEXT).
6298 The duplicates are recorded in VARS_MAP. */
6301 replace_by_duplicate_decl (tree
*tp
, hash_map
<tree
, tree
> *vars_map
,
6304 tree t
= *tp
, new_t
;
6305 struct function
*f
= DECL_STRUCT_FUNCTION (to_context
);
6307 if (DECL_CONTEXT (t
) == to_context
)
6311 tree
&loc
= vars_map
->get_or_insert (t
, &existed
);
6317 new_t
= copy_var_decl (t
, DECL_NAME (t
), TREE_TYPE (t
));
6318 add_local_decl (f
, new_t
);
6322 gcc_assert (TREE_CODE (t
) == CONST_DECL
);
6323 new_t
= copy_node (t
);
6325 DECL_CONTEXT (new_t
) = to_context
;
6336 /* Creates an ssa name in TO_CONTEXT equivalent to NAME.
6337 VARS_MAP maps old ssa names and var_decls to the new ones. */
6340 replace_ssa_name (tree name
, hash_map
<tree
, tree
> *vars_map
,
6345 gcc_assert (!virtual_operand_p (name
));
6347 tree
*loc
= vars_map
->get (name
);
6351 tree decl
= SSA_NAME_VAR (name
);
6354 replace_by_duplicate_decl (&decl
, vars_map
, to_context
);
6355 new_name
= make_ssa_name_fn (DECL_STRUCT_FUNCTION (to_context
),
6356 decl
, SSA_NAME_DEF_STMT (name
));
6357 if (SSA_NAME_IS_DEFAULT_DEF (name
))
6358 set_ssa_default_def (DECL_STRUCT_FUNCTION (to_context
),
6362 new_name
= copy_ssa_name_fn (DECL_STRUCT_FUNCTION (to_context
),
6363 name
, SSA_NAME_DEF_STMT (name
));
6365 vars_map
->put (name
, new_name
);
6379 hash_map
<tree
, tree
> *vars_map
;
6380 htab_t new_label_map
;
6381 hash_map
<void *, void *> *eh_map
;
6385 /* Helper for move_block_to_fn. Set TREE_BLOCK in every expression
6386 contained in *TP if it has been ORIG_BLOCK previously and change the
6387 DECL_CONTEXT of every local variable referenced in *TP. */
6390 move_stmt_op (tree
*tp
, int *walk_subtrees
, void *data
)
6392 struct walk_stmt_info
*wi
= (struct walk_stmt_info
*) data
;
6393 struct move_stmt_d
*p
= (struct move_stmt_d
*) wi
->info
;
6398 tree block
= TREE_BLOCK (t
);
6399 if (block
== p
->orig_block
6400 || (p
->orig_block
== NULL_TREE
6401 && block
!= NULL_TREE
))
6402 TREE_SET_BLOCK (t
, p
->new_block
);
6403 #ifdef ENABLE_CHECKING
6404 else if (block
!= NULL_TREE
)
6406 while (block
&& TREE_CODE (block
) == BLOCK
&& block
!= p
->orig_block
)
6407 block
= BLOCK_SUPERCONTEXT (block
);
6408 gcc_assert (block
== p
->orig_block
);
6412 else if (DECL_P (t
) || TREE_CODE (t
) == SSA_NAME
)
6414 if (TREE_CODE (t
) == SSA_NAME
)
6415 *tp
= replace_ssa_name (t
, p
->vars_map
, p
->to_context
);
6416 else if (TREE_CODE (t
) == LABEL_DECL
)
6418 if (p
->new_label_map
)
6420 struct tree_map in
, *out
;
6422 out
= (struct tree_map
*)
6423 htab_find_with_hash (p
->new_label_map
, &in
, DECL_UID (t
));
6428 DECL_CONTEXT (t
) = p
->to_context
;
6430 else if (p
->remap_decls_p
)
6432 /* Replace T with its duplicate. T should no longer appear in the
6433 parent function, so this looks wasteful; however, it may appear
6434 in referenced_vars, and more importantly, as virtual operands of
6435 statements, and in alias lists of other variables. It would be
6436 quite difficult to expunge it from all those places. ??? It might
6437 suffice to do this for addressable variables. */
6438 if ((TREE_CODE (t
) == VAR_DECL
6439 && !is_global_var (t
))
6440 || TREE_CODE (t
) == CONST_DECL
)
6441 replace_by_duplicate_decl (tp
, p
->vars_map
, p
->to_context
);
6445 else if (TYPE_P (t
))
6451 /* Helper for move_stmt_r. Given an EH region number for the source
6452 function, map that to the duplicate EH regio number in the dest. */
6455 move_stmt_eh_region_nr (int old_nr
, struct move_stmt_d
*p
)
6457 eh_region old_r
, new_r
;
6459 old_r
= get_eh_region_from_number (old_nr
);
6460 new_r
= static_cast<eh_region
> (*p
->eh_map
->get (old_r
));
6462 return new_r
->index
;
6465 /* Similar, but operate on INTEGER_CSTs. */
6468 move_stmt_eh_region_tree_nr (tree old_t_nr
, struct move_stmt_d
*p
)
6472 old_nr
= tree_to_shwi (old_t_nr
);
6473 new_nr
= move_stmt_eh_region_nr (old_nr
, p
);
6475 return build_int_cst (integer_type_node
, new_nr
);
6478 /* Like move_stmt_op, but for gimple statements.
6480 Helper for move_block_to_fn. Set GIMPLE_BLOCK in every expression
6481 contained in the current statement in *GSI_P and change the
6482 DECL_CONTEXT of every local variable referenced in the current
6486 move_stmt_r (gimple_stmt_iterator
*gsi_p
, bool *handled_ops_p
,
6487 struct walk_stmt_info
*wi
)
6489 struct move_stmt_d
*p
= (struct move_stmt_d
*) wi
->info
;
6490 gimple stmt
= gsi_stmt (*gsi_p
);
6491 tree block
= gimple_block (stmt
);
6493 if (block
== p
->orig_block
6494 || (p
->orig_block
== NULL_TREE
6495 && block
!= NULL_TREE
))
6496 gimple_set_block (stmt
, p
->new_block
);
6498 switch (gimple_code (stmt
))
6501 /* Remap the region numbers for __builtin_eh_{pointer,filter}. */
6503 tree r
, fndecl
= gimple_call_fndecl (stmt
);
6504 if (fndecl
&& DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
)
6505 switch (DECL_FUNCTION_CODE (fndecl
))
6507 case BUILT_IN_EH_COPY_VALUES
:
6508 r
= gimple_call_arg (stmt
, 1);
6509 r
= move_stmt_eh_region_tree_nr (r
, p
);
6510 gimple_call_set_arg (stmt
, 1, r
);
6513 case BUILT_IN_EH_POINTER
:
6514 case BUILT_IN_EH_FILTER
:
6515 r
= gimple_call_arg (stmt
, 0);
6516 r
= move_stmt_eh_region_tree_nr (r
, p
);
6517 gimple_call_set_arg (stmt
, 0, r
);
6528 gimple_resx resx_stmt
= as_a
<gimple_resx
> (stmt
);
6529 int r
= gimple_resx_region (resx_stmt
);
6530 r
= move_stmt_eh_region_nr (r
, p
);
6531 gimple_resx_set_region (resx_stmt
, r
);
6535 case GIMPLE_EH_DISPATCH
:
6537 gimple_eh_dispatch eh_dispatch_stmt
= as_a
<gimple_eh_dispatch
> (stmt
);
6538 int r
= gimple_eh_dispatch_region (eh_dispatch_stmt
);
6539 r
= move_stmt_eh_region_nr (r
, p
);
6540 gimple_eh_dispatch_set_region (eh_dispatch_stmt
, r
);
6544 case GIMPLE_OMP_RETURN
:
6545 case GIMPLE_OMP_CONTINUE
:
6548 if (is_gimple_omp (stmt
))
6550 /* Do not remap variables inside OMP directives. Variables
6551 referenced in clauses and directive header belong to the
6552 parent function and should not be moved into the child
6554 bool save_remap_decls_p
= p
->remap_decls_p
;
6555 p
->remap_decls_p
= false;
6556 *handled_ops_p
= true;
6558 walk_gimple_seq_mod (gimple_omp_body_ptr (stmt
), move_stmt_r
,
6561 p
->remap_decls_p
= save_remap_decls_p
;
6569 /* Move basic block BB from function CFUN to function DEST_FN. The
6570 block is moved out of the original linked list and placed after
6571 block AFTER in the new list. Also, the block is removed from the
6572 original array of blocks and placed in DEST_FN's array of blocks.
6573 If UPDATE_EDGE_COUNT_P is true, the edge counts on both CFGs is
6574 updated to reflect the moved edges.
6576 The local variables are remapped to new instances, VARS_MAP is used
6577 to record the mapping. */
6580 move_block_to_fn (struct function
*dest_cfun
, basic_block bb
,
6581 basic_block after
, bool update_edge_count_p
,
6582 struct move_stmt_d
*d
)
6584 struct control_flow_graph
*cfg
;
6587 gimple_stmt_iterator si
;
6588 unsigned old_len
, new_len
;
6590 /* Remove BB from dominance structures. */
6591 delete_from_dominance_info (CDI_DOMINATORS
, bb
);
6593 /* Move BB from its current loop to the copy in the new function. */
6596 struct loop
*new_loop
= (struct loop
*)bb
->loop_father
->aux
;
6598 bb
->loop_father
= new_loop
;
6601 /* Link BB to the new linked list. */
6602 move_block_after (bb
, after
);
6604 /* Update the edge count in the corresponding flowgraphs. */
6605 if (update_edge_count_p
)
6606 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
6608 cfun
->cfg
->x_n_edges
--;
6609 dest_cfun
->cfg
->x_n_edges
++;
6612 /* Remove BB from the original basic block array. */
6613 (*cfun
->cfg
->x_basic_block_info
)[bb
->index
] = NULL
;
6614 cfun
->cfg
->x_n_basic_blocks
--;
6616 /* Grow DEST_CFUN's basic block array if needed. */
6617 cfg
= dest_cfun
->cfg
;
6618 cfg
->x_n_basic_blocks
++;
6619 if (bb
->index
>= cfg
->x_last_basic_block
)
6620 cfg
->x_last_basic_block
= bb
->index
+ 1;
6622 old_len
= vec_safe_length (cfg
->x_basic_block_info
);
6623 if ((unsigned) cfg
->x_last_basic_block
>= old_len
)
6625 new_len
= cfg
->x_last_basic_block
+ (cfg
->x_last_basic_block
+ 3) / 4;
6626 vec_safe_grow_cleared (cfg
->x_basic_block_info
, new_len
);
6629 (*cfg
->x_basic_block_info
)[bb
->index
] = bb
;
6631 /* Remap the variables in phi nodes. */
6632 for (si
= gsi_start_phis (bb
); !gsi_end_p (si
); )
6634 gimple phi
= gsi_stmt (si
);
6636 tree op
= PHI_RESULT (phi
);
6640 if (virtual_operand_p (op
))
6642 /* Remove the phi nodes for virtual operands (alias analysis will be
6643 run for the new function, anyway). */
6644 remove_phi_node (&si
, true);
6648 SET_PHI_RESULT (phi
,
6649 replace_ssa_name (op
, d
->vars_map
, dest_cfun
->decl
));
6650 FOR_EACH_PHI_ARG (use
, phi
, oi
, SSA_OP_USE
)
6652 op
= USE_FROM_PTR (use
);
6653 if (TREE_CODE (op
) == SSA_NAME
)
6654 SET_USE (use
, replace_ssa_name (op
, d
->vars_map
, dest_cfun
->decl
));
6657 for (i
= 0; i
< EDGE_COUNT (bb
->preds
); i
++)
6659 location_t locus
= gimple_phi_arg_location (phi
, i
);
6660 tree block
= LOCATION_BLOCK (locus
);
6662 if (locus
== UNKNOWN_LOCATION
)
6664 if (d
->orig_block
== NULL_TREE
|| block
== d
->orig_block
)
6666 if (d
->new_block
== NULL_TREE
)
6667 locus
= LOCATION_LOCUS (locus
);
6669 locus
= COMBINE_LOCATION_DATA (line_table
, locus
, d
->new_block
);
6670 gimple_phi_arg_set_location (phi
, i
, locus
);
6677 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
6679 gimple stmt
= gsi_stmt (si
);
6680 struct walk_stmt_info wi
;
6682 memset (&wi
, 0, sizeof (wi
));
6684 walk_gimple_stmt (&si
, move_stmt_r
, move_stmt_op
, &wi
);
6686 if (gimple_code (stmt
) == GIMPLE_LABEL
)
6688 tree label
= gimple_label_label (stmt
);
6689 int uid
= LABEL_DECL_UID (label
);
6691 gcc_assert (uid
> -1);
6693 old_len
= vec_safe_length (cfg
->x_label_to_block_map
);
6694 if (old_len
<= (unsigned) uid
)
6696 new_len
= 3 * uid
/ 2 + 1;
6697 vec_safe_grow_cleared (cfg
->x_label_to_block_map
, new_len
);
6700 (*cfg
->x_label_to_block_map
)[uid
] = bb
;
6701 (*cfun
->cfg
->x_label_to_block_map
)[uid
] = NULL
;
6703 gcc_assert (DECL_CONTEXT (label
) == dest_cfun
->decl
);
6705 if (uid
>= dest_cfun
->cfg
->last_label_uid
)
6706 dest_cfun
->cfg
->last_label_uid
= uid
+ 1;
6709 maybe_duplicate_eh_stmt_fn (dest_cfun
, stmt
, cfun
, stmt
, d
->eh_map
, 0);
6710 remove_stmt_from_eh_lp_fn (cfun
, stmt
);
6712 gimple_duplicate_stmt_histograms (dest_cfun
, stmt
, cfun
, stmt
);
6713 gimple_remove_stmt_histograms (cfun
, stmt
);
6715 /* We cannot leave any operands allocated from the operand caches of
6716 the current function. */
6717 free_stmt_operands (cfun
, stmt
);
6718 push_cfun (dest_cfun
);
6723 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
6724 if (e
->goto_locus
!= UNKNOWN_LOCATION
)
6726 tree block
= LOCATION_BLOCK (e
->goto_locus
);
6727 if (d
->orig_block
== NULL_TREE
6728 || block
== d
->orig_block
)
6729 e
->goto_locus
= d
->new_block
?
6730 COMBINE_LOCATION_DATA (line_table
, e
->goto_locus
, d
->new_block
) :
6731 LOCATION_LOCUS (e
->goto_locus
);
6735 /* Examine the statements in BB (which is in SRC_CFUN); find and return
6736 the outermost EH region. Use REGION as the incoming base EH region. */
6739 find_outermost_region_in_block (struct function
*src_cfun
,
6740 basic_block bb
, eh_region region
)
6742 gimple_stmt_iterator si
;
6744 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
6746 gimple stmt
= gsi_stmt (si
);
6747 eh_region stmt_region
;
6750 lp_nr
= lookup_stmt_eh_lp_fn (src_cfun
, stmt
);
6751 stmt_region
= get_eh_region_from_lp_number_fn (src_cfun
, lp_nr
);
6755 region
= stmt_region
;
6756 else if (stmt_region
!= region
)
6758 region
= eh_region_outermost (src_cfun
, stmt_region
, region
);
6759 gcc_assert (region
!= NULL
);
6768 new_label_mapper (tree decl
, void *data
)
6770 htab_t hash
= (htab_t
) data
;
6774 gcc_assert (TREE_CODE (decl
) == LABEL_DECL
);
6776 m
= XNEW (struct tree_map
);
6777 m
->hash
= DECL_UID (decl
);
6778 m
->base
.from
= decl
;
6779 m
->to
= create_artificial_label (UNKNOWN_LOCATION
);
6780 LABEL_DECL_UID (m
->to
) = LABEL_DECL_UID (decl
);
6781 if (LABEL_DECL_UID (m
->to
) >= cfun
->cfg
->last_label_uid
)
6782 cfun
->cfg
->last_label_uid
= LABEL_DECL_UID (m
->to
) + 1;
6784 slot
= htab_find_slot_with_hash (hash
, m
, m
->hash
, INSERT
);
6785 gcc_assert (*slot
== NULL
);
6792 /* Change DECL_CONTEXT of all BLOCK_VARS in block, including
6796 replace_block_vars_by_duplicates (tree block
, hash_map
<tree
, tree
> *vars_map
,
6801 for (tp
= &BLOCK_VARS (block
); *tp
; tp
= &DECL_CHAIN (*tp
))
6804 if (TREE_CODE (t
) != VAR_DECL
&& TREE_CODE (t
) != CONST_DECL
)
6806 replace_by_duplicate_decl (&t
, vars_map
, to_context
);
6809 if (TREE_CODE (*tp
) == VAR_DECL
&& DECL_HAS_VALUE_EXPR_P (*tp
))
6811 SET_DECL_VALUE_EXPR (t
, DECL_VALUE_EXPR (*tp
));
6812 DECL_HAS_VALUE_EXPR_P (t
) = 1;
6814 DECL_CHAIN (t
) = DECL_CHAIN (*tp
);
6819 for (block
= BLOCK_SUBBLOCKS (block
); block
; block
= BLOCK_CHAIN (block
))
6820 replace_block_vars_by_duplicates (block
, vars_map
, to_context
);
6823 /* Fixup the loop arrays and numbers after moving LOOP and its subloops
6827 fixup_loop_arrays_after_move (struct function
*fn1
, struct function
*fn2
,
6830 /* Discard it from the old loop array. */
6831 (*get_loops (fn1
))[loop
->num
] = NULL
;
6833 /* Place it in the new loop array, assigning it a new number. */
6834 loop
->num
= number_of_loops (fn2
);
6835 vec_safe_push (loops_for_fn (fn2
)->larray
, loop
);
6837 /* Recurse to children. */
6838 for (loop
= loop
->inner
; loop
; loop
= loop
->next
)
6839 fixup_loop_arrays_after_move (fn1
, fn2
, loop
);
6842 /* Move a single-entry, single-exit region delimited by ENTRY_BB and
6843 EXIT_BB to function DEST_CFUN. The whole region is replaced by a
6844 single basic block in the original CFG and the new basic block is
6845 returned. DEST_CFUN must not have a CFG yet.
6847 Note that the region need not be a pure SESE region. Blocks inside
6848 the region may contain calls to abort/exit. The only restriction
6849 is that ENTRY_BB should be the only entry point and it must
6852 Change TREE_BLOCK of all statements in ORIG_BLOCK to the new
6853 functions outermost BLOCK, move all subblocks of ORIG_BLOCK
6854 to the new function.
6856 All local variables referenced in the region are assumed to be in
6857 the corresponding BLOCK_VARS and unexpanded variable lists
6858 associated with DEST_CFUN. */
6861 move_sese_region_to_fn (struct function
*dest_cfun
, basic_block entry_bb
,
6862 basic_block exit_bb
, tree orig_block
)
6864 vec
<basic_block
> bbs
, dom_bbs
;
6865 basic_block dom_entry
= get_immediate_dominator (CDI_DOMINATORS
, entry_bb
);
6866 basic_block after
, bb
, *entry_pred
, *exit_succ
, abb
;
6867 struct function
*saved_cfun
= cfun
;
6868 int *entry_flag
, *exit_flag
;
6869 unsigned *entry_prob
, *exit_prob
;
6870 unsigned i
, num_entry_edges
, num_exit_edges
, num_nodes
;
6873 htab_t new_label_map
;
6874 hash_map
<void *, void *> *eh_map
;
6875 struct loop
*loop
= entry_bb
->loop_father
;
6876 struct loop
*loop0
= get_loop (saved_cfun
, 0);
6877 struct move_stmt_d d
;
6879 /* If ENTRY does not strictly dominate EXIT, this cannot be an SESE
6881 gcc_assert (entry_bb
!= exit_bb
6883 || dominated_by_p (CDI_DOMINATORS
, exit_bb
, entry_bb
)));
6885 /* Collect all the blocks in the region. Manually add ENTRY_BB
6886 because it won't be added by dfs_enumerate_from. */
6888 bbs
.safe_push (entry_bb
);
6889 gather_blocks_in_sese_region (entry_bb
, exit_bb
, &bbs
);
6891 /* The blocks that used to be dominated by something in BBS will now be
6892 dominated by the new block. */
6893 dom_bbs
= get_dominated_by_region (CDI_DOMINATORS
,
6897 /* Detach ENTRY_BB and EXIT_BB from CFUN->CFG. We need to remember
6898 the predecessor edges to ENTRY_BB and the successor edges to
6899 EXIT_BB so that we can re-attach them to the new basic block that
6900 will replace the region. */
6901 num_entry_edges
= EDGE_COUNT (entry_bb
->preds
);
6902 entry_pred
= XNEWVEC (basic_block
, num_entry_edges
);
6903 entry_flag
= XNEWVEC (int, num_entry_edges
);
6904 entry_prob
= XNEWVEC (unsigned, num_entry_edges
);
6906 for (ei
= ei_start (entry_bb
->preds
); (e
= ei_safe_edge (ei
)) != NULL
;)
6908 entry_prob
[i
] = e
->probability
;
6909 entry_flag
[i
] = e
->flags
;
6910 entry_pred
[i
++] = e
->src
;
6916 num_exit_edges
= EDGE_COUNT (exit_bb
->succs
);
6917 exit_succ
= XNEWVEC (basic_block
, num_exit_edges
);
6918 exit_flag
= XNEWVEC (int, num_exit_edges
);
6919 exit_prob
= XNEWVEC (unsigned, num_exit_edges
);
6921 for (ei
= ei_start (exit_bb
->succs
); (e
= ei_safe_edge (ei
)) != NULL
;)
6923 exit_prob
[i
] = e
->probability
;
6924 exit_flag
[i
] = e
->flags
;
6925 exit_succ
[i
++] = e
->dest
;
6937 /* Switch context to the child function to initialize DEST_FN's CFG. */
6938 gcc_assert (dest_cfun
->cfg
== NULL
);
6939 push_cfun (dest_cfun
);
6941 init_empty_tree_cfg ();
6943 /* Initialize EH information for the new function. */
6945 new_label_map
= NULL
;
6948 eh_region region
= NULL
;
6950 FOR_EACH_VEC_ELT (bbs
, i
, bb
)
6951 region
= find_outermost_region_in_block (saved_cfun
, bb
, region
);
6953 init_eh_for_function ();
6956 new_label_map
= htab_create (17, tree_map_hash
, tree_map_eq
, free
);
6957 eh_map
= duplicate_eh_regions (saved_cfun
, region
, 0,
6958 new_label_mapper
, new_label_map
);
6962 /* Initialize an empty loop tree. */
6963 struct loops
*loops
= ggc_cleared_alloc
<struct loops
> ();
6964 init_loops_structure (dest_cfun
, loops
, 1);
6965 loops
->state
= LOOPS_MAY_HAVE_MULTIPLE_LATCHES
;
6966 set_loops_for_fn (dest_cfun
, loops
);
6968 /* Move the outlined loop tree part. */
6969 num_nodes
= bbs
.length ();
6970 FOR_EACH_VEC_ELT (bbs
, i
, bb
)
6972 if (bb
->loop_father
->header
== bb
)
6974 struct loop
*this_loop
= bb
->loop_father
;
6975 struct loop
*outer
= loop_outer (this_loop
);
6977 /* If the SESE region contains some bbs ending with
6978 a noreturn call, those are considered to belong
6979 to the outermost loop in saved_cfun, rather than
6980 the entry_bb's loop_father. */
6984 num_nodes
-= this_loop
->num_nodes
;
6985 flow_loop_tree_node_remove (bb
->loop_father
);
6986 flow_loop_tree_node_add (get_loop (dest_cfun
, 0), this_loop
);
6987 fixup_loop_arrays_after_move (saved_cfun
, cfun
, this_loop
);
6990 else if (bb
->loop_father
== loop0
&& loop0
!= loop
)
6993 /* Remove loop exits from the outlined region. */
6994 if (loops_for_fn (saved_cfun
)->exits
)
6995 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
6997 struct loops
*l
= loops_for_fn (saved_cfun
);
6999 = l
->exits
->find_slot_with_hash (e
, htab_hash_pointer (e
),
7002 l
->exits
->clear_slot (slot
);
7007 /* Adjust the number of blocks in the tree root of the outlined part. */
7008 get_loop (dest_cfun
, 0)->num_nodes
= bbs
.length () + 2;
7010 /* Setup a mapping to be used by move_block_to_fn. */
7011 loop
->aux
= current_loops
->tree_root
;
7012 loop0
->aux
= current_loops
->tree_root
;
7016 /* Move blocks from BBS into DEST_CFUN. */
7017 gcc_assert (bbs
.length () >= 2);
7018 after
= dest_cfun
->cfg
->x_entry_block_ptr
;
7019 hash_map
<tree
, tree
> vars_map
;
7021 memset (&d
, 0, sizeof (d
));
7022 d
.orig_block
= orig_block
;
7023 d
.new_block
= DECL_INITIAL (dest_cfun
->decl
);
7024 d
.from_context
= cfun
->decl
;
7025 d
.to_context
= dest_cfun
->decl
;
7026 d
.vars_map
= &vars_map
;
7027 d
.new_label_map
= new_label_map
;
7029 d
.remap_decls_p
= true;
7031 FOR_EACH_VEC_ELT (bbs
, i
, bb
)
7033 /* No need to update edge counts on the last block. It has
7034 already been updated earlier when we detached the region from
7035 the original CFG. */
7036 move_block_to_fn (dest_cfun
, bb
, after
, bb
!= exit_bb
, &d
);
7042 /* Loop sizes are no longer correct, fix them up. */
7043 loop
->num_nodes
-= num_nodes
;
7044 for (struct loop
*outer
= loop_outer (loop
);
7045 outer
; outer
= loop_outer (outer
))
7046 outer
->num_nodes
-= num_nodes
;
7047 loop0
->num_nodes
-= bbs
.length () - num_nodes
;
7049 if (saved_cfun
->has_simduid_loops
|| saved_cfun
->has_force_vectorize_loops
)
7052 for (i
= 0; vec_safe_iterate (loops
->larray
, i
, &aloop
); i
++)
7057 replace_by_duplicate_decl (&aloop
->simduid
, d
.vars_map
,
7059 dest_cfun
->has_simduid_loops
= true;
7061 if (aloop
->force_vectorize
)
7062 dest_cfun
->has_force_vectorize_loops
= true;
7066 /* Rewire BLOCK_SUBBLOCKS of orig_block. */
7070 gcc_assert (BLOCK_SUBBLOCKS (DECL_INITIAL (dest_cfun
->decl
))
7072 BLOCK_SUBBLOCKS (DECL_INITIAL (dest_cfun
->decl
))
7073 = BLOCK_SUBBLOCKS (orig_block
);
7074 for (block
= BLOCK_SUBBLOCKS (orig_block
);
7075 block
; block
= BLOCK_CHAIN (block
))
7076 BLOCK_SUPERCONTEXT (block
) = DECL_INITIAL (dest_cfun
->decl
);
7077 BLOCK_SUBBLOCKS (orig_block
) = NULL_TREE
;
7080 replace_block_vars_by_duplicates (DECL_INITIAL (dest_cfun
->decl
),
7081 &vars_map
, dest_cfun
->decl
);
7084 htab_delete (new_label_map
);
7088 /* Rewire the entry and exit blocks. The successor to the entry
7089 block turns into the successor of DEST_FN's ENTRY_BLOCK_PTR in
7090 the child function. Similarly, the predecessor of DEST_FN's
7091 EXIT_BLOCK_PTR turns into the predecessor of EXIT_BLOCK_PTR. We
7092 need to switch CFUN between DEST_CFUN and SAVED_CFUN so that the
7093 various CFG manipulation function get to the right CFG.
7095 FIXME, this is silly. The CFG ought to become a parameter to
7097 push_cfun (dest_cfun
);
7098 make_edge (ENTRY_BLOCK_PTR_FOR_FN (cfun
), entry_bb
, EDGE_FALLTHRU
);
7100 make_edge (exit_bb
, EXIT_BLOCK_PTR_FOR_FN (cfun
), 0);
7103 /* Back in the original function, the SESE region has disappeared,
7104 create a new basic block in its place. */
7105 bb
= create_empty_bb (entry_pred
[0]);
7107 add_bb_to_loop (bb
, loop
);
7108 for (i
= 0; i
< num_entry_edges
; i
++)
7110 e
= make_edge (entry_pred
[i
], bb
, entry_flag
[i
]);
7111 e
->probability
= entry_prob
[i
];
7114 for (i
= 0; i
< num_exit_edges
; i
++)
7116 e
= make_edge (bb
, exit_succ
[i
], exit_flag
[i
]);
7117 e
->probability
= exit_prob
[i
];
7120 set_immediate_dominator (CDI_DOMINATORS
, bb
, dom_entry
);
7121 FOR_EACH_VEC_ELT (dom_bbs
, i
, abb
)
7122 set_immediate_dominator (CDI_DOMINATORS
, abb
, bb
);
7140 /* Dump FUNCTION_DECL FN to file FILE using FLAGS (see TDF_* in dumpfile.h)
7144 dump_function_to_file (tree fndecl
, FILE *file
, int flags
)
7146 tree arg
, var
, old_current_fndecl
= current_function_decl
;
7147 struct function
*dsf
;
7148 bool ignore_topmost_bind
= false, any_var
= false;
7151 bool tmclone
= (TREE_CODE (fndecl
) == FUNCTION_DECL
7152 && decl_is_tm_clone (fndecl
));
7153 struct function
*fun
= DECL_STRUCT_FUNCTION (fndecl
);
7155 current_function_decl
= fndecl
;
7156 fprintf (file
, "%s %s(", function_name (fun
), tmclone
? "[tm-clone] " : "");
7158 arg
= DECL_ARGUMENTS (fndecl
);
7161 print_generic_expr (file
, TREE_TYPE (arg
), dump_flags
);
7162 fprintf (file
, " ");
7163 print_generic_expr (file
, arg
, dump_flags
);
7164 if (flags
& TDF_VERBOSE
)
7165 print_node (file
, "", arg
, 4);
7166 if (DECL_CHAIN (arg
))
7167 fprintf (file
, ", ");
7168 arg
= DECL_CHAIN (arg
);
7170 fprintf (file
, ")\n");
7172 if (flags
& TDF_VERBOSE
)
7173 print_node (file
, "", fndecl
, 2);
7175 dsf
= DECL_STRUCT_FUNCTION (fndecl
);
7176 if (dsf
&& (flags
& TDF_EH
))
7177 dump_eh_tree (file
, dsf
);
7179 if (flags
& TDF_RAW
&& !gimple_has_body_p (fndecl
))
7181 dump_node (fndecl
, TDF_SLIM
| flags
, file
);
7182 current_function_decl
= old_current_fndecl
;
7186 /* When GIMPLE is lowered, the variables are no longer available in
7187 BIND_EXPRs, so display them separately. */
7188 if (fun
&& fun
->decl
== fndecl
&& (fun
->curr_properties
& PROP_gimple_lcf
))
7191 ignore_topmost_bind
= true;
7193 fprintf (file
, "{\n");
7194 if (!vec_safe_is_empty (fun
->local_decls
))
7195 FOR_EACH_LOCAL_DECL (fun
, ix
, var
)
7197 print_generic_decl (file
, var
, flags
);
7198 if (flags
& TDF_VERBOSE
)
7199 print_node (file
, "", var
, 4);
7200 fprintf (file
, "\n");
7204 if (gimple_in_ssa_p (cfun
))
7205 for (ix
= 1; ix
< num_ssa_names
; ++ix
)
7207 tree name
= ssa_name (ix
);
7208 if (name
&& !SSA_NAME_VAR (name
))
7210 fprintf (file
, " ");
7211 print_generic_expr (file
, TREE_TYPE (name
), flags
);
7212 fprintf (file
, " ");
7213 print_generic_expr (file
, name
, flags
);
7214 fprintf (file
, ";\n");
7221 if (fun
&& fun
->decl
== fndecl
7223 && basic_block_info_for_fn (fun
))
7225 /* If the CFG has been built, emit a CFG-based dump. */
7226 if (!ignore_topmost_bind
)
7227 fprintf (file
, "{\n");
7229 if (any_var
&& n_basic_blocks_for_fn (fun
))
7230 fprintf (file
, "\n");
7232 FOR_EACH_BB_FN (bb
, fun
)
7233 dump_bb (file
, bb
, 2, flags
| TDF_COMMENT
);
7235 fprintf (file
, "}\n");
7237 else if (DECL_SAVED_TREE (fndecl
) == NULL
)
7239 /* The function is now in GIMPLE form but the CFG has not been
7240 built yet. Emit the single sequence of GIMPLE statements
7241 that make up its body. */
7242 gimple_seq body
= gimple_body (fndecl
);
7244 if (gimple_seq_first_stmt (body
)
7245 && gimple_seq_first_stmt (body
) == gimple_seq_last_stmt (body
)
7246 && gimple_code (gimple_seq_first_stmt (body
)) == GIMPLE_BIND
)
7247 print_gimple_seq (file
, body
, 0, flags
);
7250 if (!ignore_topmost_bind
)
7251 fprintf (file
, "{\n");
7254 fprintf (file
, "\n");
7256 print_gimple_seq (file
, body
, 2, flags
);
7257 fprintf (file
, "}\n");
7264 /* Make a tree based dump. */
7265 chain
= DECL_SAVED_TREE (fndecl
);
7266 if (chain
&& TREE_CODE (chain
) == BIND_EXPR
)
7268 if (ignore_topmost_bind
)
7270 chain
= BIND_EXPR_BODY (chain
);
7278 if (!ignore_topmost_bind
)
7279 fprintf (file
, "{\n");
7284 fprintf (file
, "\n");
7286 print_generic_stmt_indented (file
, chain
, flags
, indent
);
7287 if (ignore_topmost_bind
)
7288 fprintf (file
, "}\n");
7291 if (flags
& TDF_ENUMERATE_LOCALS
)
7292 dump_enumerated_decls (file
, flags
);
7293 fprintf (file
, "\n\n");
7295 current_function_decl
= old_current_fndecl
;
7298 /* Dump FUNCTION_DECL FN to stderr using FLAGS (see TDF_* in tree.h) */
7301 debug_function (tree fn
, int flags
)
7303 dump_function_to_file (fn
, stderr
, flags
);
7307 /* Print on FILE the indexes for the predecessors of basic_block BB. */
7310 print_pred_bbs (FILE *file
, basic_block bb
)
7315 FOR_EACH_EDGE (e
, ei
, bb
->preds
)
7316 fprintf (file
, "bb_%d ", e
->src
->index
);
7320 /* Print on FILE the indexes for the successors of basic_block BB. */
7323 print_succ_bbs (FILE *file
, basic_block bb
)
7328 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
7329 fprintf (file
, "bb_%d ", e
->dest
->index
);
7332 /* Print to FILE the basic block BB following the VERBOSITY level. */
7335 print_loops_bb (FILE *file
, basic_block bb
, int indent
, int verbosity
)
7337 char *s_indent
= (char *) alloca ((size_t) indent
+ 1);
7338 memset ((void *) s_indent
, ' ', (size_t) indent
);
7339 s_indent
[indent
] = '\0';
7341 /* Print basic_block's header. */
7344 fprintf (file
, "%s bb_%d (preds = {", s_indent
, bb
->index
);
7345 print_pred_bbs (file
, bb
);
7346 fprintf (file
, "}, succs = {");
7347 print_succ_bbs (file
, bb
);
7348 fprintf (file
, "})\n");
7351 /* Print basic_block's body. */
7354 fprintf (file
, "%s {\n", s_indent
);
7355 dump_bb (file
, bb
, indent
+ 4, TDF_VOPS
|TDF_MEMSYMS
);
7356 fprintf (file
, "%s }\n", s_indent
);
7360 static void print_loop_and_siblings (FILE *, struct loop
*, int, int);
7362 /* Pretty print LOOP on FILE, indented INDENT spaces. Following
7363 VERBOSITY level this outputs the contents of the loop, or just its
7367 print_loop (FILE *file
, struct loop
*loop
, int indent
, int verbosity
)
7375 s_indent
= (char *) alloca ((size_t) indent
+ 1);
7376 memset ((void *) s_indent
, ' ', (size_t) indent
);
7377 s_indent
[indent
] = '\0';
7379 /* Print loop's header. */
7380 fprintf (file
, "%sloop_%d (", s_indent
, loop
->num
);
7382 fprintf (file
, "header = %d", loop
->header
->index
);
7385 fprintf (file
, "deleted)\n");
7389 fprintf (file
, ", latch = %d", loop
->latch
->index
);
7391 fprintf (file
, ", multiple latches");
7392 fprintf (file
, ", niter = ");
7393 print_generic_expr (file
, loop
->nb_iterations
, 0);
7395 if (loop
->any_upper_bound
)
7397 fprintf (file
, ", upper_bound = ");
7398 print_decu (loop
->nb_iterations_upper_bound
, file
);
7401 if (loop
->any_estimate
)
7403 fprintf (file
, ", estimate = ");
7404 print_decu (loop
->nb_iterations_estimate
, file
);
7406 fprintf (file
, ")\n");
7408 /* Print loop's body. */
7411 fprintf (file
, "%s{\n", s_indent
);
7412 FOR_EACH_BB_FN (bb
, cfun
)
7413 if (bb
->loop_father
== loop
)
7414 print_loops_bb (file
, bb
, indent
, verbosity
);
7416 print_loop_and_siblings (file
, loop
->inner
, indent
+ 2, verbosity
);
7417 fprintf (file
, "%s}\n", s_indent
);
7421 /* Print the LOOP and its sibling loops on FILE, indented INDENT
7422 spaces. Following VERBOSITY level this outputs the contents of the
7423 loop, or just its structure. */
7426 print_loop_and_siblings (FILE *file
, struct loop
*loop
, int indent
,
7432 print_loop (file
, loop
, indent
, verbosity
);
7433 print_loop_and_siblings (file
, loop
->next
, indent
, verbosity
);
7436 /* Follow a CFG edge from the entry point of the program, and on entry
7437 of a loop, pretty print the loop structure on FILE. */
7440 print_loops (FILE *file
, int verbosity
)
7444 bb
= ENTRY_BLOCK_PTR_FOR_FN (cfun
);
7445 if (bb
&& bb
->loop_father
)
7446 print_loop_and_siblings (file
, bb
->loop_father
, 0, verbosity
);
7452 debug (struct loop
&ref
)
7454 print_loop (stderr
, &ref
, 0, /*verbosity*/0);
7458 debug (struct loop
*ptr
)
7463 fprintf (stderr
, "<nil>\n");
7466 /* Dump a loop verbosely. */
7469 debug_verbose (struct loop
&ref
)
7471 print_loop (stderr
, &ref
, 0, /*verbosity*/3);
7475 debug_verbose (struct loop
*ptr
)
7480 fprintf (stderr
, "<nil>\n");
7484 /* Debugging loops structure at tree level, at some VERBOSITY level. */
7487 debug_loops (int verbosity
)
7489 print_loops (stderr
, verbosity
);
7492 /* Print on stderr the code of LOOP, at some VERBOSITY level. */
7495 debug_loop (struct loop
*loop
, int verbosity
)
7497 print_loop (stderr
, loop
, 0, verbosity
);
7500 /* Print on stderr the code of loop number NUM, at some VERBOSITY
7504 debug_loop_num (unsigned num
, int verbosity
)
7506 debug_loop (get_loop (cfun
, num
), verbosity
);
7509 /* Return true if BB ends with a call, possibly followed by some
7510 instructions that must stay with the call. Return false,
7514 gimple_block_ends_with_call_p (basic_block bb
)
7516 gimple_stmt_iterator gsi
= gsi_last_nondebug_bb (bb
);
7517 return !gsi_end_p (gsi
) && is_gimple_call (gsi_stmt (gsi
));
7521 /* Return true if BB ends with a conditional branch. Return false,
7525 gimple_block_ends_with_condjump_p (const_basic_block bb
)
7527 gimple stmt
= last_stmt (CONST_CAST_BB (bb
));
7528 return (stmt
&& gimple_code (stmt
) == GIMPLE_COND
);
7532 /* Return true if we need to add fake edge to exit at statement T.
7533 Helper function for gimple_flow_call_edges_add. */
7536 need_fake_edge_p (gimple t
)
7538 tree fndecl
= NULL_TREE
;
7541 /* NORETURN and LONGJMP calls already have an edge to exit.
7542 CONST and PURE calls do not need one.
7543 We don't currently check for CONST and PURE here, although
7544 it would be a good idea, because those attributes are
7545 figured out from the RTL in mark_constant_function, and
7546 the counter incrementation code from -fprofile-arcs
7547 leads to different results from -fbranch-probabilities. */
7548 if (is_gimple_call (t
))
7550 fndecl
= gimple_call_fndecl (t
);
7551 call_flags
= gimple_call_flags (t
);
7554 if (is_gimple_call (t
)
7556 && DECL_BUILT_IN (fndecl
)
7557 && (call_flags
& ECF_NOTHROW
)
7558 && !(call_flags
& ECF_RETURNS_TWICE
)
7559 /* fork() doesn't really return twice, but the effect of
7560 wrapping it in __gcov_fork() which calls __gcov_flush()
7561 and clears the counters before forking has the same
7562 effect as returning twice. Force a fake edge. */
7563 && !(DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
7564 && DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_FORK
))
7567 if (is_gimple_call (t
))
7573 if (!(call_flags
& ECF_NORETURN
))
7577 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
7578 if ((e
->flags
& EDGE_FAKE
) == 0)
7582 if (gimple_asm asm_stmt
= dyn_cast
<gimple_asm
> (t
))
7583 if (gimple_asm_volatile_p (asm_stmt
) || gimple_asm_input_p (asm_stmt
))
7590 /* Add fake edges to the function exit for any non constant and non
7591 noreturn calls (or noreturn calls with EH/abnormal edges),
7592 volatile inline assembly in the bitmap of blocks specified by BLOCKS
7593 or to the whole CFG if BLOCKS is zero. Return the number of blocks
7596 The goal is to expose cases in which entering a basic block does
7597 not imply that all subsequent instructions must be executed. */
7600 gimple_flow_call_edges_add (sbitmap blocks
)
7603 int blocks_split
= 0;
7604 int last_bb
= last_basic_block_for_fn (cfun
);
7605 bool check_last_block
= false;
7607 if (n_basic_blocks_for_fn (cfun
) == NUM_FIXED_BLOCKS
)
7611 check_last_block
= true;
7613 check_last_block
= bitmap_bit_p (blocks
,
7614 EXIT_BLOCK_PTR_FOR_FN (cfun
)->prev_bb
->index
);
7616 /* In the last basic block, before epilogue generation, there will be
7617 a fallthru edge to EXIT. Special care is required if the last insn
7618 of the last basic block is a call because make_edge folds duplicate
7619 edges, which would result in the fallthru edge also being marked
7620 fake, which would result in the fallthru edge being removed by
7621 remove_fake_edges, which would result in an invalid CFG.
7623 Moreover, we can't elide the outgoing fake edge, since the block
7624 profiler needs to take this into account in order to solve the minimal
7625 spanning tree in the case that the call doesn't return.
7627 Handle this by adding a dummy instruction in a new last basic block. */
7628 if (check_last_block
)
7630 basic_block bb
= EXIT_BLOCK_PTR_FOR_FN (cfun
)->prev_bb
;
7631 gimple_stmt_iterator gsi
= gsi_last_nondebug_bb (bb
);
7634 if (!gsi_end_p (gsi
))
7637 if (t
&& need_fake_edge_p (t
))
7641 e
= find_edge (bb
, EXIT_BLOCK_PTR_FOR_FN (cfun
));
7644 gsi_insert_on_edge (e
, gimple_build_nop ());
7645 gsi_commit_edge_inserts ();
7650 /* Now add fake edges to the function exit for any non constant
7651 calls since there is no way that we can determine if they will
7653 for (i
= 0; i
< last_bb
; i
++)
7655 basic_block bb
= BASIC_BLOCK_FOR_FN (cfun
, i
);
7656 gimple_stmt_iterator gsi
;
7657 gimple stmt
, last_stmt
;
7662 if (blocks
&& !bitmap_bit_p (blocks
, i
))
7665 gsi
= gsi_last_nondebug_bb (bb
);
7666 if (!gsi_end_p (gsi
))
7668 last_stmt
= gsi_stmt (gsi
);
7671 stmt
= gsi_stmt (gsi
);
7672 if (need_fake_edge_p (stmt
))
7676 /* The handling above of the final block before the
7677 epilogue should be enough to verify that there is
7678 no edge to the exit block in CFG already.
7679 Calling make_edge in such case would cause us to
7680 mark that edge as fake and remove it later. */
7681 #ifdef ENABLE_CHECKING
7682 if (stmt
== last_stmt
)
7684 e
= find_edge (bb
, EXIT_BLOCK_PTR_FOR_FN (cfun
));
7685 gcc_assert (e
== NULL
);
7689 /* Note that the following may create a new basic block
7690 and renumber the existing basic blocks. */
7691 if (stmt
!= last_stmt
)
7693 e
= split_block (bb
, stmt
);
7697 make_edge (bb
, EXIT_BLOCK_PTR_FOR_FN (cfun
), EDGE_FAKE
);
7701 while (!gsi_end_p (gsi
));
7706 verify_flow_info ();
7708 return blocks_split
;
7711 /* Removes edge E and all the blocks dominated by it, and updates dominance
7712 information. The IL in E->src needs to be updated separately.
7713 If dominance info is not available, only the edge E is removed.*/
7716 remove_edge_and_dominated_blocks (edge e
)
7718 vec
<basic_block
> bbs_to_remove
= vNULL
;
7719 vec
<basic_block
> bbs_to_fix_dom
= vNULL
;
7723 bool none_removed
= false;
7725 basic_block bb
, dbb
;
7728 if (!dom_info_available_p (CDI_DOMINATORS
))
7734 /* No updating is needed for edges to exit. */
7735 if (e
->dest
== EXIT_BLOCK_PTR_FOR_FN (cfun
))
7737 if (cfgcleanup_altered_bbs
)
7738 bitmap_set_bit (cfgcleanup_altered_bbs
, e
->src
->index
);
7743 /* First, we find the basic blocks to remove. If E->dest has a predecessor
7744 that is not dominated by E->dest, then this set is empty. Otherwise,
7745 all the basic blocks dominated by E->dest are removed.
7747 Also, to DF_IDOM we store the immediate dominators of the blocks in
7748 the dominance frontier of E (i.e., of the successors of the
7749 removed blocks, if there are any, and of E->dest otherwise). */
7750 FOR_EACH_EDGE (f
, ei
, e
->dest
->preds
)
7755 if (!dominated_by_p (CDI_DOMINATORS
, f
->src
, e
->dest
))
7757 none_removed
= true;
7762 df
= BITMAP_ALLOC (NULL
);
7763 df_idom
= BITMAP_ALLOC (NULL
);
7766 bitmap_set_bit (df_idom
,
7767 get_immediate_dominator (CDI_DOMINATORS
, e
->dest
)->index
);
7770 bbs_to_remove
= get_all_dominated_blocks (CDI_DOMINATORS
, e
->dest
);
7771 FOR_EACH_VEC_ELT (bbs_to_remove
, i
, bb
)
7773 FOR_EACH_EDGE (f
, ei
, bb
->succs
)
7775 if (f
->dest
!= EXIT_BLOCK_PTR_FOR_FN (cfun
))
7776 bitmap_set_bit (df
, f
->dest
->index
);
7779 FOR_EACH_VEC_ELT (bbs_to_remove
, i
, bb
)
7780 bitmap_clear_bit (df
, bb
->index
);
7782 EXECUTE_IF_SET_IN_BITMAP (df
, 0, i
, bi
)
7784 bb
= BASIC_BLOCK_FOR_FN (cfun
, i
);
7785 bitmap_set_bit (df_idom
,
7786 get_immediate_dominator (CDI_DOMINATORS
, bb
)->index
);
7790 if (cfgcleanup_altered_bbs
)
7792 /* Record the set of the altered basic blocks. */
7793 bitmap_set_bit (cfgcleanup_altered_bbs
, e
->src
->index
);
7794 bitmap_ior_into (cfgcleanup_altered_bbs
, df
);
7797 /* Remove E and the cancelled blocks. */
7802 /* Walk backwards so as to get a chance to substitute all
7803 released DEFs into debug stmts. See
7804 eliminate_unnecessary_stmts() in tree-ssa-dce.c for more
7806 for (i
= bbs_to_remove
.length (); i
-- > 0; )
7807 delete_basic_block (bbs_to_remove
[i
]);
7810 /* Update the dominance information. The immediate dominator may change only
7811 for blocks whose immediate dominator belongs to DF_IDOM:
7813 Suppose that idom(X) = Y before removal of E and idom(X) != Y after the
7814 removal. Let Z the arbitrary block such that idom(Z) = Y and
7815 Z dominates X after the removal. Before removal, there exists a path P
7816 from Y to X that avoids Z. Let F be the last edge on P that is
7817 removed, and let W = F->dest. Before removal, idom(W) = Y (since Y
7818 dominates W, and because of P, Z does not dominate W), and W belongs to
7819 the dominance frontier of E. Therefore, Y belongs to DF_IDOM. */
7820 EXECUTE_IF_SET_IN_BITMAP (df_idom
, 0, i
, bi
)
7822 bb
= BASIC_BLOCK_FOR_FN (cfun
, i
);
7823 for (dbb
= first_dom_son (CDI_DOMINATORS
, bb
);
7825 dbb
= next_dom_son (CDI_DOMINATORS
, dbb
))
7826 bbs_to_fix_dom
.safe_push (dbb
);
7829 iterate_fix_dominators (CDI_DOMINATORS
, bbs_to_fix_dom
, true);
7832 BITMAP_FREE (df_idom
);
7833 bbs_to_remove
.release ();
7834 bbs_to_fix_dom
.release ();
7837 /* Purge dead EH edges from basic block BB. */
7840 gimple_purge_dead_eh_edges (basic_block bb
)
7842 bool changed
= false;
7845 gimple stmt
= last_stmt (bb
);
7847 if (stmt
&& stmt_can_throw_internal (stmt
))
7850 for (ei
= ei_start (bb
->succs
); (e
= ei_safe_edge (ei
)); )
7852 if (e
->flags
& EDGE_EH
)
7854 remove_edge_and_dominated_blocks (e
);
7864 /* Purge dead EH edges from basic block listed in BLOCKS. */
7867 gimple_purge_all_dead_eh_edges (const_bitmap blocks
)
7869 bool changed
= false;
7873 EXECUTE_IF_SET_IN_BITMAP (blocks
, 0, i
, bi
)
7875 basic_block bb
= BASIC_BLOCK_FOR_FN (cfun
, i
);
7877 /* Earlier gimple_purge_dead_eh_edges could have removed
7878 this basic block already. */
7879 gcc_assert (bb
|| changed
);
7881 changed
|= gimple_purge_dead_eh_edges (bb
);
7887 /* Purge dead abnormal call edges from basic block BB. */
7890 gimple_purge_dead_abnormal_call_edges (basic_block bb
)
7892 bool changed
= false;
7895 gimple stmt
= last_stmt (bb
);
7897 if (!cfun
->has_nonlocal_label
7898 && !cfun
->calls_setjmp
)
7901 if (stmt
&& stmt_can_make_abnormal_goto (stmt
))
7904 for (ei
= ei_start (bb
->succs
); (e
= ei_safe_edge (ei
)); )
7906 if (e
->flags
& EDGE_ABNORMAL
)
7908 if (e
->flags
& EDGE_FALLTHRU
)
7909 e
->flags
&= ~EDGE_ABNORMAL
;
7911 remove_edge_and_dominated_blocks (e
);
7921 /* Purge dead abnormal call edges from basic block listed in BLOCKS. */
7924 gimple_purge_all_dead_abnormal_call_edges (const_bitmap blocks
)
7926 bool changed
= false;
7930 EXECUTE_IF_SET_IN_BITMAP (blocks
, 0, i
, bi
)
7932 basic_block bb
= BASIC_BLOCK_FOR_FN (cfun
, i
);
7934 /* Earlier gimple_purge_dead_abnormal_call_edges could have removed
7935 this basic block already. */
7936 gcc_assert (bb
|| changed
);
7938 changed
|= gimple_purge_dead_abnormal_call_edges (bb
);
7944 /* This function is called whenever a new edge is created or
7948 gimple_execute_on_growing_pred (edge e
)
7950 basic_block bb
= e
->dest
;
7952 if (!gimple_seq_empty_p (phi_nodes (bb
)))
7953 reserve_phi_args_for_new_edge (bb
);
7956 /* This function is called immediately before edge E is removed from
7957 the edge vector E->dest->preds. */
7960 gimple_execute_on_shrinking_pred (edge e
)
7962 if (!gimple_seq_empty_p (phi_nodes (e
->dest
)))
7963 remove_phi_args (e
);
7966 /*---------------------------------------------------------------------------
7967 Helper functions for Loop versioning
7968 ---------------------------------------------------------------------------*/
7970 /* Adjust phi nodes for 'first' basic block. 'second' basic block is a copy
7971 of 'first'. Both of them are dominated by 'new_head' basic block. When
7972 'new_head' was created by 'second's incoming edge it received phi arguments
7973 on the edge by split_edge(). Later, additional edge 'e' was created to
7974 connect 'new_head' and 'first'. Now this routine adds phi args on this
7975 additional edge 'e' that new_head to second edge received as part of edge
7979 gimple_lv_adjust_loop_header_phi (basic_block first
, basic_block second
,
7980 basic_block new_head
, edge e
)
7982 gimple_phi phi1
, phi2
;
7983 gimple_phi_iterator psi1
, psi2
;
7985 edge e2
= find_edge (new_head
, second
);
7987 /* Because NEW_HEAD has been created by splitting SECOND's incoming
7988 edge, we should always have an edge from NEW_HEAD to SECOND. */
7989 gcc_assert (e2
!= NULL
);
7991 /* Browse all 'second' basic block phi nodes and add phi args to
7992 edge 'e' for 'first' head. PHI args are always in correct order. */
7994 for (psi2
= gsi_start_phis (second
),
7995 psi1
= gsi_start_phis (first
);
7996 !gsi_end_p (psi2
) && !gsi_end_p (psi1
);
7997 gsi_next (&psi2
), gsi_next (&psi1
))
8001 def
= PHI_ARG_DEF (phi2
, e2
->dest_idx
);
8002 add_phi_arg (phi1
, def
, e
, gimple_phi_arg_location_from_edge (phi2
, e2
));
8007 /* Adds a if else statement to COND_BB with condition COND_EXPR.
8008 SECOND_HEAD is the destination of the THEN and FIRST_HEAD is
8009 the destination of the ELSE part. */
8012 gimple_lv_add_condition_to_bb (basic_block first_head ATTRIBUTE_UNUSED
,
8013 basic_block second_head ATTRIBUTE_UNUSED
,
8014 basic_block cond_bb
, void *cond_e
)
8016 gimple_stmt_iterator gsi
;
8017 gimple new_cond_expr
;
8018 tree cond_expr
= (tree
) cond_e
;
8021 /* Build new conditional expr */
8022 new_cond_expr
= gimple_build_cond_from_tree (cond_expr
,
8023 NULL_TREE
, NULL_TREE
);
8025 /* Add new cond in cond_bb. */
8026 gsi
= gsi_last_bb (cond_bb
);
8027 gsi_insert_after (&gsi
, new_cond_expr
, GSI_NEW_STMT
);
8029 /* Adjust edges appropriately to connect new head with first head
8030 as well as second head. */
8031 e0
= single_succ_edge (cond_bb
);
8032 e0
->flags
&= ~EDGE_FALLTHRU
;
8033 e0
->flags
|= EDGE_FALSE_VALUE
;
8037 /* Do book-keeping of basic block BB for the profile consistency checker.
8038 If AFTER_PASS is 0, do pre-pass accounting, or if AFTER_PASS is 1
8039 then do post-pass accounting. Store the counting in RECORD. */
8041 gimple_account_profile_record (basic_block bb
, int after_pass
,
8042 struct profile_record
*record
)
8044 gimple_stmt_iterator i
;
8045 for (i
= gsi_start_bb (bb
); !gsi_end_p (i
); gsi_next (&i
))
8047 record
->size
[after_pass
]
8048 += estimate_num_insns (gsi_stmt (i
), &eni_size_weights
);
8049 if (profile_status_for_fn (cfun
) == PROFILE_READ
)
8050 record
->time
[after_pass
]
8051 += estimate_num_insns (gsi_stmt (i
),
8052 &eni_time_weights
) * bb
->count
;
8053 else if (profile_status_for_fn (cfun
) == PROFILE_GUESSED
)
8054 record
->time
[after_pass
]
8055 += estimate_num_insns (gsi_stmt (i
),
8056 &eni_time_weights
) * bb
->frequency
;
8060 struct cfg_hooks gimple_cfg_hooks
= {
8062 gimple_verify_flow_info
,
8063 gimple_dump_bb
, /* dump_bb */
8064 gimple_dump_bb_for_graph
, /* dump_bb_for_graph */
8065 create_bb
, /* create_basic_block */
8066 gimple_redirect_edge_and_branch
, /* redirect_edge_and_branch */
8067 gimple_redirect_edge_and_branch_force
, /* redirect_edge_and_branch_force */
8068 gimple_can_remove_branch_p
, /* can_remove_branch_p */
8069 remove_bb
, /* delete_basic_block */
8070 gimple_split_block
, /* split_block */
8071 gimple_move_block_after
, /* move_block_after */
8072 gimple_can_merge_blocks_p
, /* can_merge_blocks_p */
8073 gimple_merge_blocks
, /* merge_blocks */
8074 gimple_predict_edge
, /* predict_edge */
8075 gimple_predicted_by_p
, /* predicted_by_p */
8076 gimple_can_duplicate_bb_p
, /* can_duplicate_block_p */
8077 gimple_duplicate_bb
, /* duplicate_block */
8078 gimple_split_edge
, /* split_edge */
8079 gimple_make_forwarder_block
, /* make_forward_block */
8080 NULL
, /* tidy_fallthru_edge */
8081 NULL
, /* force_nonfallthru */
8082 gimple_block_ends_with_call_p
,/* block_ends_with_call_p */
8083 gimple_block_ends_with_condjump_p
, /* block_ends_with_condjump_p */
8084 gimple_flow_call_edges_add
, /* flow_call_edges_add */
8085 gimple_execute_on_growing_pred
, /* execute_on_growing_pred */
8086 gimple_execute_on_shrinking_pred
, /* execute_on_shrinking_pred */
8087 gimple_duplicate_loop_to_header_edge
, /* duplicate loop for trees */
8088 gimple_lv_add_condition_to_bb
, /* lv_add_condition_to_bb */
8089 gimple_lv_adjust_loop_header_phi
, /* lv_adjust_loop_header_phi*/
8090 extract_true_false_edges_from_block
, /* extract_cond_bb_edges */
8091 flush_pending_stmts
, /* flush_pending_stmts */
8092 gimple_empty_block_p
, /* block_empty_p */
8093 gimple_split_block_before_cond_jump
, /* split_block_before_cond_jump */
8094 gimple_account_profile_record
,
8098 /* Split all critical edges. */
8101 split_critical_edges (void)
8107 /* split_edge can redirect edges out of SWITCH_EXPRs, which can get
8108 expensive. So we want to enable recording of edge to CASE_LABEL_EXPR
8109 mappings around the calls to split_edge. */
8110 start_recording_case_labels ();
8111 FOR_ALL_BB_FN (bb
, cfun
)
8113 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
8115 if (EDGE_CRITICAL_P (e
) && !(e
->flags
& EDGE_ABNORMAL
))
8117 /* PRE inserts statements to edges and expects that
8118 since split_critical_edges was done beforehand, committing edge
8119 insertions will not split more edges. In addition to critical
8120 edges we must split edges that have multiple successors and
8121 end by control flow statements, such as RESX.
8122 Go ahead and split them too. This matches the logic in
8123 gimple_find_edge_insert_loc. */
8124 else if ((!single_pred_p (e
->dest
)
8125 || !gimple_seq_empty_p (phi_nodes (e
->dest
))
8126 || e
->dest
== EXIT_BLOCK_PTR_FOR_FN (cfun
))
8127 && e
->src
!= ENTRY_BLOCK_PTR_FOR_FN (cfun
)
8128 && !(e
->flags
& EDGE_ABNORMAL
))
8130 gimple_stmt_iterator gsi
;
8132 gsi
= gsi_last_bb (e
->src
);
8133 if (!gsi_end_p (gsi
)
8134 && stmt_ends_bb_p (gsi_stmt (gsi
))
8135 && (gimple_code (gsi_stmt (gsi
)) != GIMPLE_RETURN
8136 && !gimple_call_builtin_p (gsi_stmt (gsi
),
8142 end_recording_case_labels ();
8148 const pass_data pass_data_split_crit_edges
=
8150 GIMPLE_PASS
, /* type */
8151 "crited", /* name */
8152 OPTGROUP_NONE
, /* optinfo_flags */
8153 TV_TREE_SPLIT_EDGES
, /* tv_id */
8154 PROP_cfg
, /* properties_required */
8155 PROP_no_crit_edges
, /* properties_provided */
8156 0, /* properties_destroyed */
8157 0, /* todo_flags_start */
8158 0, /* todo_flags_finish */
8161 class pass_split_crit_edges
: public gimple_opt_pass
8164 pass_split_crit_edges (gcc::context
*ctxt
)
8165 : gimple_opt_pass (pass_data_split_crit_edges
, ctxt
)
8168 /* opt_pass methods: */
8169 virtual unsigned int execute (function
*) { return split_critical_edges (); }
8171 opt_pass
* clone () { return new pass_split_crit_edges (m_ctxt
); }
8172 }; // class pass_split_crit_edges
8177 make_pass_split_crit_edges (gcc::context
*ctxt
)
8179 return new pass_split_crit_edges (ctxt
);
8183 /* Build a ternary operation and gimplify it. Emit code before GSI.
8184 Return the gimple_val holding the result. */
8187 gimplify_build3 (gimple_stmt_iterator
*gsi
, enum tree_code code
,
8188 tree type
, tree a
, tree b
, tree c
)
8191 location_t loc
= gimple_location (gsi_stmt (*gsi
));
8193 ret
= fold_build3_loc (loc
, code
, type
, a
, b
, c
);
8196 return force_gimple_operand_gsi (gsi
, ret
, true, NULL
, true,
8200 /* Build a binary operation and gimplify it. Emit code before GSI.
8201 Return the gimple_val holding the result. */
8204 gimplify_build2 (gimple_stmt_iterator
*gsi
, enum tree_code code
,
8205 tree type
, tree a
, tree b
)
8209 ret
= fold_build2_loc (gimple_location (gsi_stmt (*gsi
)), code
, type
, a
, b
);
8212 return force_gimple_operand_gsi (gsi
, ret
, true, NULL
, true,
8216 /* Build a unary operation and gimplify it. Emit code before GSI.
8217 Return the gimple_val holding the result. */
8220 gimplify_build1 (gimple_stmt_iterator
*gsi
, enum tree_code code
, tree type
,
8225 ret
= fold_build1_loc (gimple_location (gsi_stmt (*gsi
)), code
, type
, a
);
8228 return force_gimple_operand_gsi (gsi
, ret
, true, NULL
, true,
8234 /* Given a basic block B which ends with a conditional and has
8235 precisely two successors, determine which of the edges is taken if
8236 the conditional is true and which is taken if the conditional is
8237 false. Set TRUE_EDGE and FALSE_EDGE appropriately. */
8240 extract_true_false_edges_from_block (basic_block b
,
8244 edge e
= EDGE_SUCC (b
, 0);
8246 if (e
->flags
& EDGE_TRUE_VALUE
)
8249 *false_edge
= EDGE_SUCC (b
, 1);
8254 *true_edge
= EDGE_SUCC (b
, 1);
8258 /* Emit return warnings. */
8262 const pass_data pass_data_warn_function_return
=
8264 GIMPLE_PASS
, /* type */
8265 "*warn_function_return", /* name */
8266 OPTGROUP_NONE
, /* optinfo_flags */
8267 TV_NONE
, /* tv_id */
8268 PROP_cfg
, /* properties_required */
8269 0, /* properties_provided */
8270 0, /* properties_destroyed */
8271 0, /* todo_flags_start */
8272 0, /* todo_flags_finish */
8275 class pass_warn_function_return
: public gimple_opt_pass
8278 pass_warn_function_return (gcc::context
*ctxt
)
8279 : gimple_opt_pass (pass_data_warn_function_return
, ctxt
)
8282 /* opt_pass methods: */
8283 virtual unsigned int execute (function
*);
8285 }; // class pass_warn_function_return
8288 pass_warn_function_return::execute (function
*fun
)
8290 source_location location
;
8295 if (!targetm
.warn_func_return (fun
->decl
))
8298 /* If we have a path to EXIT, then we do return. */
8299 if (TREE_THIS_VOLATILE (fun
->decl
)
8300 && EDGE_COUNT (EXIT_BLOCK_PTR_FOR_FN (fun
)->preds
) > 0)
8302 location
= UNKNOWN_LOCATION
;
8303 FOR_EACH_EDGE (e
, ei
, EXIT_BLOCK_PTR_FOR_FN (fun
)->preds
)
8305 last
= last_stmt (e
->src
);
8306 if ((gimple_code (last
) == GIMPLE_RETURN
8307 || gimple_call_builtin_p (last
, BUILT_IN_RETURN
))
8308 && (location
= gimple_location (last
)) != UNKNOWN_LOCATION
)
8311 if (location
== UNKNOWN_LOCATION
)
8312 location
= cfun
->function_end_locus
;
8313 warning_at (location
, 0, "%<noreturn%> function does return");
8316 /* If we see "return;" in some basic block, then we do reach the end
8317 without returning a value. */
8318 else if (warn_return_type
8319 && !TREE_NO_WARNING (fun
->decl
)
8320 && EDGE_COUNT (EXIT_BLOCK_PTR_FOR_FN (fun
)->preds
) > 0
8321 && !VOID_TYPE_P (TREE_TYPE (TREE_TYPE (fun
->decl
))))
8323 FOR_EACH_EDGE (e
, ei
, EXIT_BLOCK_PTR_FOR_FN (fun
)->preds
)
8325 gimple last
= last_stmt (e
->src
);
8326 if (gimple_code (last
) == GIMPLE_RETURN
8327 && gimple_return_retval (last
) == NULL
8328 && !gimple_no_warning_p (last
))
8330 location
= gimple_location (last
);
8331 if (location
== UNKNOWN_LOCATION
)
8332 location
= fun
->function_end_locus
;
8333 warning_at (location
, OPT_Wreturn_type
, "control reaches end of non-void function");
8334 TREE_NO_WARNING (fun
->decl
) = 1;
8345 make_pass_warn_function_return (gcc::context
*ctxt
)
8347 return new pass_warn_function_return (ctxt
);
8350 /* Walk a gimplified function and warn for functions whose return value is
8351 ignored and attribute((warn_unused_result)) is set. This is done before
8352 inlining, so we don't have to worry about that. */
8355 do_warn_unused_result (gimple_seq seq
)
8358 gimple_stmt_iterator i
;
8360 for (i
= gsi_start (seq
); !gsi_end_p (i
); gsi_next (&i
))
8362 gimple g
= gsi_stmt (i
);
8364 switch (gimple_code (g
))
8367 do_warn_unused_result (gimple_bind_body (as_a
<gimple_bind
>(g
)));
8370 do_warn_unused_result (gimple_try_eval (g
));
8371 do_warn_unused_result (gimple_try_cleanup (g
));
8374 do_warn_unused_result (gimple_catch_handler (
8375 as_a
<gimple_catch
> (g
)));
8377 case GIMPLE_EH_FILTER
:
8378 do_warn_unused_result (gimple_eh_filter_failure (g
));
8382 if (gimple_call_lhs (g
))
8384 if (gimple_call_internal_p (g
))
8387 /* This is a naked call, as opposed to a GIMPLE_CALL with an
8388 LHS. All calls whose value is ignored should be
8389 represented like this. Look for the attribute. */
8390 fdecl
= gimple_call_fndecl (g
);
8391 ftype
= gimple_call_fntype (g
);
8393 if (lookup_attribute ("warn_unused_result", TYPE_ATTRIBUTES (ftype
)))
8395 location_t loc
= gimple_location (g
);
8398 warning_at (loc
, OPT_Wunused_result
,
8399 "ignoring return value of %qD, "
8400 "declared with attribute warn_unused_result",
8403 warning_at (loc
, OPT_Wunused_result
,
8404 "ignoring return value of function "
8405 "declared with attribute warn_unused_result");
8410 /* Not a container, not a call, or a call whose value is used. */
8418 const pass_data pass_data_warn_unused_result
=
8420 GIMPLE_PASS
, /* type */
8421 "*warn_unused_result", /* name */
8422 OPTGROUP_NONE
, /* optinfo_flags */
8423 TV_NONE
, /* tv_id */
8424 PROP_gimple_any
, /* properties_required */
8425 0, /* properties_provided */
8426 0, /* properties_destroyed */
8427 0, /* todo_flags_start */
8428 0, /* todo_flags_finish */
8431 class pass_warn_unused_result
: public gimple_opt_pass
8434 pass_warn_unused_result (gcc::context
*ctxt
)
8435 : gimple_opt_pass (pass_data_warn_unused_result
, ctxt
)
8438 /* opt_pass methods: */
8439 virtual bool gate (function
*) { return flag_warn_unused_result
; }
8440 virtual unsigned int execute (function
*)
8442 do_warn_unused_result (gimple_body (current_function_decl
));
8446 }; // class pass_warn_unused_result
8451 make_pass_warn_unused_result (gcc::context
*ctxt
)
8453 return new pass_warn_unused_result (ctxt
);
8456 /* IPA passes, compilation of earlier functions or inlining
8457 might have changed some properties, such as marked functions nothrow,
8458 pure, const or noreturn.
8459 Remove redundant edges and basic blocks, and create new ones if necessary.
8461 This pass can't be executed as stand alone pass from pass manager, because
8462 in between inlining and this fixup the verify_flow_info would fail. */
8465 execute_fixup_cfg (void)
8468 gimple_stmt_iterator gsi
;
8470 gcov_type count_scale
;
8475 = GCOV_COMPUTE_SCALE (cgraph_node::get (current_function_decl
)->count
,
8476 ENTRY_BLOCK_PTR_FOR_FN (cfun
)->count
);
8478 ENTRY_BLOCK_PTR_FOR_FN (cfun
)->count
=
8479 cgraph_node::get (current_function_decl
)->count
;
8480 EXIT_BLOCK_PTR_FOR_FN (cfun
)->count
=
8481 apply_scale (EXIT_BLOCK_PTR_FOR_FN (cfun
)->count
,
8484 FOR_EACH_EDGE (e
, ei
, ENTRY_BLOCK_PTR_FOR_FN (cfun
)->succs
)
8485 e
->count
= apply_scale (e
->count
, count_scale
);
8487 FOR_EACH_BB_FN (bb
, cfun
)
8489 bb
->count
= apply_scale (bb
->count
, count_scale
);
8490 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
);)
8492 gimple stmt
= gsi_stmt (gsi
);
8493 tree decl
= is_gimple_call (stmt
)
8494 ? gimple_call_fndecl (stmt
)
8498 int flags
= gimple_call_flags (stmt
);
8499 if (flags
& (ECF_CONST
| ECF_PURE
| ECF_LOOPING_CONST_OR_PURE
))
8501 if (gimple_purge_dead_abnormal_call_edges (bb
))
8502 todo
|= TODO_cleanup_cfg
;
8504 if (gimple_in_ssa_p (cfun
))
8506 todo
|= TODO_update_ssa
| TODO_cleanup_cfg
;
8511 if (flags
& ECF_NORETURN
8512 && fixup_noreturn_call (stmt
))
8513 todo
|= TODO_cleanup_cfg
;
8516 /* Remove stores to variables we marked write-only.
8517 Keep access when store has side effect, i.e. in case when source
8519 if (gimple_store_p (stmt
)
8520 && !gimple_has_side_effects (stmt
))
8522 tree lhs
= get_base_address (gimple_get_lhs (stmt
));
8524 if (TREE_CODE (lhs
) == VAR_DECL
8525 && (TREE_STATIC (lhs
) || DECL_EXTERNAL (lhs
))
8526 && varpool_node::get (lhs
)->writeonly
)
8528 unlink_stmt_vdef (stmt
);
8529 gsi_remove (&gsi
, true);
8530 release_defs (stmt
);
8531 todo
|= TODO_update_ssa
| TODO_cleanup_cfg
;
8535 /* For calls we can simply remove LHS when it is known
8536 to be write-only. */
8537 if (is_gimple_call (stmt
)
8538 && gimple_get_lhs (stmt
))
8540 tree lhs
= get_base_address (gimple_get_lhs (stmt
));
8542 if (TREE_CODE (lhs
) == VAR_DECL
8543 && (TREE_STATIC (lhs
) || DECL_EXTERNAL (lhs
))
8544 && varpool_node::get (lhs
)->writeonly
)
8546 gimple_call_set_lhs (stmt
, NULL
);
8548 todo
|= TODO_update_ssa
| TODO_cleanup_cfg
;
8552 if (maybe_clean_eh_stmt (stmt
)
8553 && gimple_purge_dead_eh_edges (bb
))
8554 todo
|= TODO_cleanup_cfg
;
8558 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
8559 e
->count
= apply_scale (e
->count
, count_scale
);
8561 /* If we have a basic block with no successors that does not
8562 end with a control statement or a noreturn call end it with
8563 a call to __builtin_unreachable. This situation can occur
8564 when inlining a noreturn call that does in fact return. */
8565 if (EDGE_COUNT (bb
->succs
) == 0)
8567 gimple stmt
= last_stmt (bb
);
8569 || (!is_ctrl_stmt (stmt
)
8570 && (!is_gimple_call (stmt
)
8571 || (gimple_call_flags (stmt
) & ECF_NORETURN
) == 0)))
8573 if (stmt
&& is_gimple_call (stmt
))
8574 gimple_call_set_ctrl_altering (stmt
, false);
8575 stmt
= gimple_build_call
8576 (builtin_decl_implicit (BUILT_IN_UNREACHABLE
), 0);
8577 gimple_stmt_iterator gsi
= gsi_last_bb (bb
);
8578 gsi_insert_after (&gsi
, stmt
, GSI_NEW_STMT
);
8582 if (count_scale
!= REG_BR_PROB_BASE
)
8583 compute_function_frequency ();
8585 /* Dump a textual representation of the flowgraph. */
8587 gimple_dump_cfg (dump_file
, dump_flags
);
8590 && (todo
& TODO_cleanup_cfg
))
8591 loops_state_set (LOOPS_NEED_FIXUP
);
8598 const pass_data pass_data_fixup_cfg
=
8600 GIMPLE_PASS
, /* type */
8601 "*free_cfg_annotations", /* name */
8602 OPTGROUP_NONE
, /* optinfo_flags */
8603 TV_NONE
, /* tv_id */
8604 PROP_cfg
, /* properties_required */
8605 0, /* properties_provided */
8606 0, /* properties_destroyed */
8607 0, /* todo_flags_start */
8608 0, /* todo_flags_finish */
8611 class pass_fixup_cfg
: public gimple_opt_pass
8614 pass_fixup_cfg (gcc::context
*ctxt
)
8615 : gimple_opt_pass (pass_data_fixup_cfg
, ctxt
)
8618 /* opt_pass methods: */
8619 opt_pass
* clone () { return new pass_fixup_cfg (m_ctxt
); }
8620 virtual unsigned int execute (function
*) { return execute_fixup_cfg (); }
8622 }; // class pass_fixup_cfg
8627 make_pass_fixup_cfg (gcc::context
*ctxt
)
8629 return new pass_fixup_cfg (ctxt
);
8632 /* Garbage collection support for edge_def. */
8634 extern void gt_ggc_mx (tree
&);
8635 extern void gt_ggc_mx (gimple
&);
8636 extern void gt_ggc_mx (rtx
&);
8637 extern void gt_ggc_mx (basic_block
&);
8640 gt_ggc_mx (rtx_insn
*& x
)
8643 gt_ggc_mx_rtx_def ((void *) x
);
8647 gt_ggc_mx (edge_def
*e
)
8649 tree block
= LOCATION_BLOCK (e
->goto_locus
);
8651 gt_ggc_mx (e
->dest
);
8652 if (current_ir_type () == IR_GIMPLE
)
8653 gt_ggc_mx (e
->insns
.g
);
8655 gt_ggc_mx (e
->insns
.r
);
8659 /* PCH support for edge_def. */
8661 extern void gt_pch_nx (tree
&);
8662 extern void gt_pch_nx (gimple
&);
8663 extern void gt_pch_nx (rtx
&);
8664 extern void gt_pch_nx (basic_block
&);
8667 gt_pch_nx (rtx_insn
*& x
)
8670 gt_pch_nx_rtx_def ((void *) x
);
8674 gt_pch_nx (edge_def
*e
)
8676 tree block
= LOCATION_BLOCK (e
->goto_locus
);
8678 gt_pch_nx (e
->dest
);
8679 if (current_ir_type () == IR_GIMPLE
)
8680 gt_pch_nx (e
->insns
.g
);
8682 gt_pch_nx (e
->insns
.r
);
8687 gt_pch_nx (edge_def
*e
, gt_pointer_operator op
, void *cookie
)
8689 tree block
= LOCATION_BLOCK (e
->goto_locus
);
8690 op (&(e
->src
), cookie
);
8691 op (&(e
->dest
), cookie
);
8692 if (current_ir_type () == IR_GIMPLE
)
8693 op (&(e
->insns
.g
), cookie
);
8695 op (&(e
->insns
.r
), cookie
);
8696 op (&(block
), cookie
);