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 gimple_goto goto_stmt
= as_a
<gimple_goto
> (stmt
);
1470 label
= gimple_goto_dest (goto_stmt
);
1471 new_label
= main_block_label (label
);
1472 if (new_label
!= label
)
1473 gimple_goto_set_dest (goto_stmt
, new_label
);
1477 case GIMPLE_TRANSACTION
:
1479 gimple_transaction trans_stmt
= as_a
<gimple_transaction
> (stmt
);
1480 tree label
= gimple_transaction_label (trans_stmt
);
1483 tree new_label
= main_block_label (label
);
1484 if (new_label
!= label
)
1485 gimple_transaction_set_label (trans_stmt
, new_label
);
1495 /* Do the same for the exception region tree labels. */
1496 cleanup_dead_labels_eh ();
1498 /* Finally, purge dead labels. All user-defined labels and labels that
1499 can be the target of non-local gotos and labels which have their
1500 address taken are preserved. */
1501 FOR_EACH_BB_FN (bb
, cfun
)
1503 gimple_stmt_iterator i
;
1504 tree label_for_this_bb
= label_for_bb
[bb
->index
].label
;
1506 if (!label_for_this_bb
)
1509 /* If the main label of the block is unused, we may still remove it. */
1510 if (!label_for_bb
[bb
->index
].used
)
1511 label_for_this_bb
= NULL
;
1513 for (i
= gsi_start_bb (bb
); !gsi_end_p (i
); )
1516 gimple stmt
= gsi_stmt (i
);
1518 if (gimple_code (stmt
) != GIMPLE_LABEL
)
1521 label
= gimple_label_label (stmt
);
1523 if (label
== label_for_this_bb
1524 || !DECL_ARTIFICIAL (label
)
1525 || DECL_NONLOCAL (label
)
1526 || FORCED_LABEL (label
))
1529 gsi_remove (&i
, true);
1533 free (label_for_bb
);
1536 /* Scan the sorted vector of cases in STMT (a GIMPLE_SWITCH) and combine
1537 the ones jumping to the same label.
1538 Eg. three separate entries 1: 2: 3: become one entry 1..3: */
1541 group_case_labels_stmt (gimple_switch stmt
)
1543 int old_size
= gimple_switch_num_labels (stmt
);
1544 int i
, j
, new_size
= old_size
;
1545 basic_block default_bb
= NULL
;
1547 default_bb
= label_to_block (CASE_LABEL (gimple_switch_default_label (stmt
)));
1549 /* Look for possible opportunities to merge cases. */
1551 while (i
< old_size
)
1553 tree base_case
, base_high
;
1554 basic_block base_bb
;
1556 base_case
= gimple_switch_label (stmt
, i
);
1558 gcc_assert (base_case
);
1559 base_bb
= label_to_block (CASE_LABEL (base_case
));
1561 /* Discard cases that have the same destination as the
1563 if (base_bb
== default_bb
)
1565 gimple_switch_set_label (stmt
, i
, NULL_TREE
);
1571 base_high
= CASE_HIGH (base_case
)
1572 ? CASE_HIGH (base_case
)
1573 : CASE_LOW (base_case
);
1576 /* Try to merge case labels. Break out when we reach the end
1577 of the label vector or when we cannot merge the next case
1578 label with the current one. */
1579 while (i
< old_size
)
1581 tree merge_case
= gimple_switch_label (stmt
, i
);
1582 basic_block merge_bb
= label_to_block (CASE_LABEL (merge_case
));
1583 wide_int bhp1
= wi::add (base_high
, 1);
1585 /* Merge the cases if they jump to the same place,
1586 and their ranges are consecutive. */
1587 if (merge_bb
== base_bb
1588 && wi::eq_p (CASE_LOW (merge_case
), bhp1
))
1590 base_high
= CASE_HIGH (merge_case
) ?
1591 CASE_HIGH (merge_case
) : CASE_LOW (merge_case
);
1592 CASE_HIGH (base_case
) = base_high
;
1593 gimple_switch_set_label (stmt
, i
, NULL_TREE
);
1602 /* Compress the case labels in the label vector, and adjust the
1603 length of the vector. */
1604 for (i
= 0, j
= 0; i
< new_size
; i
++)
1606 while (! gimple_switch_label (stmt
, j
))
1608 gimple_switch_set_label (stmt
, i
,
1609 gimple_switch_label (stmt
, j
++));
1612 gcc_assert (new_size
<= old_size
);
1613 gimple_switch_set_num_labels (stmt
, new_size
);
1616 /* Look for blocks ending in a multiway branch (a GIMPLE_SWITCH),
1617 and scan the sorted vector of cases. Combine the ones jumping to the
1621 group_case_labels (void)
1625 FOR_EACH_BB_FN (bb
, cfun
)
1627 gimple stmt
= last_stmt (bb
);
1628 if (stmt
&& gimple_code (stmt
) == GIMPLE_SWITCH
)
1629 group_case_labels_stmt (as_a
<gimple_switch
> (stmt
));
1633 /* Checks whether we can merge block B into block A. */
1636 gimple_can_merge_blocks_p (basic_block a
, basic_block b
)
1639 gimple_stmt_iterator gsi
;
1641 if (!single_succ_p (a
))
1644 if (single_succ_edge (a
)->flags
& EDGE_COMPLEX
)
1647 if (single_succ (a
) != b
)
1650 if (!single_pred_p (b
))
1653 if (b
== EXIT_BLOCK_PTR_FOR_FN (cfun
))
1656 /* If A ends by a statement causing exceptions or something similar, we
1657 cannot merge the blocks. */
1658 stmt
= last_stmt (a
);
1659 if (stmt
&& stmt_ends_bb_p (stmt
))
1662 /* Do not allow a block with only a non-local label to be merged. */
1664 && gimple_code (stmt
) == GIMPLE_LABEL
1665 && DECL_NONLOCAL (gimple_label_label (stmt
)))
1668 /* Examine the labels at the beginning of B. */
1669 for (gsi
= gsi_start_bb (b
); !gsi_end_p (gsi
); gsi_next (&gsi
))
1672 stmt
= gsi_stmt (gsi
);
1673 if (gimple_code (stmt
) != GIMPLE_LABEL
)
1675 lab
= gimple_label_label (stmt
);
1677 /* Do not remove user forced labels or for -O0 any user labels. */
1678 if (!DECL_ARTIFICIAL (lab
) && (!optimize
|| FORCED_LABEL (lab
)))
1682 /* Protect the loop latches. */
1683 if (current_loops
&& b
->loop_father
->latch
== b
)
1686 /* It must be possible to eliminate all phi nodes in B. If ssa form
1687 is not up-to-date and a name-mapping is registered, we cannot eliminate
1688 any phis. Symbols marked for renaming are never a problem though. */
1689 for (gsi
= gsi_start_phis (b
); !gsi_end_p (gsi
); gsi_next (&gsi
))
1691 gimple phi
= gsi_stmt (gsi
);
1692 /* Technically only new names matter. */
1693 if (name_registered_for_update_p (PHI_RESULT (phi
)))
1697 /* When not optimizing, don't merge if we'd lose goto_locus. */
1699 && single_succ_edge (a
)->goto_locus
!= UNKNOWN_LOCATION
)
1701 location_t goto_locus
= single_succ_edge (a
)->goto_locus
;
1702 gimple_stmt_iterator prev
, next
;
1703 prev
= gsi_last_nondebug_bb (a
);
1704 next
= gsi_after_labels (b
);
1705 if (!gsi_end_p (next
) && is_gimple_debug (gsi_stmt (next
)))
1706 gsi_next_nondebug (&next
);
1707 if ((gsi_end_p (prev
)
1708 || gimple_location (gsi_stmt (prev
)) != goto_locus
)
1709 && (gsi_end_p (next
)
1710 || gimple_location (gsi_stmt (next
)) != goto_locus
))
1717 /* Replaces all uses of NAME by VAL. */
1720 replace_uses_by (tree name
, tree val
)
1722 imm_use_iterator imm_iter
;
1727 FOR_EACH_IMM_USE_STMT (stmt
, imm_iter
, name
)
1729 /* Mark the block if we change the last stmt in it. */
1730 if (cfgcleanup_altered_bbs
1731 && stmt_ends_bb_p (stmt
))
1732 bitmap_set_bit (cfgcleanup_altered_bbs
, gimple_bb (stmt
)->index
);
1734 FOR_EACH_IMM_USE_ON_STMT (use
, imm_iter
)
1736 replace_exp (use
, val
);
1738 if (gimple_code (stmt
) == GIMPLE_PHI
)
1740 e
= gimple_phi_arg_edge (as_a
<gimple_phi
> (stmt
),
1741 PHI_ARG_INDEX_FROM_USE (use
));
1742 if (e
->flags
& EDGE_ABNORMAL
)
1744 /* This can only occur for virtual operands, since
1745 for the real ones SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name))
1746 would prevent replacement. */
1747 gcc_checking_assert (virtual_operand_p (name
));
1748 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (val
) = 1;
1753 if (gimple_code (stmt
) != GIMPLE_PHI
)
1755 gimple_stmt_iterator gsi
= gsi_for_stmt (stmt
);
1756 gimple orig_stmt
= stmt
;
1759 /* FIXME. It shouldn't be required to keep TREE_CONSTANT
1760 on ADDR_EXPRs up-to-date on GIMPLE. Propagation will
1761 only change sth from non-invariant to invariant, and only
1762 when propagating constants. */
1763 if (is_gimple_min_invariant (val
))
1764 for (i
= 0; i
< gimple_num_ops (stmt
); i
++)
1766 tree op
= gimple_op (stmt
, i
);
1767 /* Operands may be empty here. For example, the labels
1768 of a GIMPLE_COND are nulled out following the creation
1769 of the corresponding CFG edges. */
1770 if (op
&& TREE_CODE (op
) == ADDR_EXPR
)
1771 recompute_tree_invariant_for_addr_expr (op
);
1774 if (fold_stmt (&gsi
))
1775 stmt
= gsi_stmt (gsi
);
1777 if (maybe_clean_or_replace_eh_stmt (orig_stmt
, stmt
))
1778 gimple_purge_dead_eh_edges (gimple_bb (stmt
));
1784 gcc_checking_assert (has_zero_uses (name
));
1786 /* Also update the trees stored in loop structures. */
1791 FOR_EACH_LOOP (loop
, 0)
1793 substitute_in_loop_info (loop
, name
, val
);
1798 /* Merge block B into block A. */
1801 gimple_merge_blocks (basic_block a
, basic_block b
)
1803 gimple_stmt_iterator last
, gsi
, psi
;
1806 fprintf (dump_file
, "Merging blocks %d and %d\n", a
->index
, b
->index
);
1808 /* Remove all single-valued PHI nodes from block B of the form
1809 V_i = PHI <V_j> by propagating V_j to all the uses of V_i. */
1810 gsi
= gsi_last_bb (a
);
1811 for (psi
= gsi_start_phis (b
); !gsi_end_p (psi
); )
1813 gimple phi
= gsi_stmt (psi
);
1814 tree def
= gimple_phi_result (phi
), use
= gimple_phi_arg_def (phi
, 0);
1816 bool may_replace_uses
= (virtual_operand_p (def
)
1817 || may_propagate_copy (def
, use
));
1819 /* In case we maintain loop closed ssa form, do not propagate arguments
1820 of loop exit phi nodes. */
1822 && loops_state_satisfies_p (LOOP_CLOSED_SSA
)
1823 && !virtual_operand_p (def
)
1824 && TREE_CODE (use
) == SSA_NAME
1825 && a
->loop_father
!= b
->loop_father
)
1826 may_replace_uses
= false;
1828 if (!may_replace_uses
)
1830 gcc_assert (!virtual_operand_p (def
));
1832 /* Note that just emitting the copies is fine -- there is no problem
1833 with ordering of phi nodes. This is because A is the single
1834 predecessor of B, therefore results of the phi nodes cannot
1835 appear as arguments of the phi nodes. */
1836 copy
= gimple_build_assign (def
, use
);
1837 gsi_insert_after (&gsi
, copy
, GSI_NEW_STMT
);
1838 remove_phi_node (&psi
, false);
1842 /* If we deal with a PHI for virtual operands, we can simply
1843 propagate these without fussing with folding or updating
1845 if (virtual_operand_p (def
))
1847 imm_use_iterator iter
;
1848 use_operand_p use_p
;
1851 FOR_EACH_IMM_USE_STMT (stmt
, iter
, def
)
1852 FOR_EACH_IMM_USE_ON_STMT (use_p
, iter
)
1853 SET_USE (use_p
, use
);
1855 if (SSA_NAME_OCCURS_IN_ABNORMAL_PHI (def
))
1856 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (use
) = 1;
1859 replace_uses_by (def
, use
);
1861 remove_phi_node (&psi
, true);
1865 /* Ensure that B follows A. */
1866 move_block_after (b
, a
);
1868 gcc_assert (single_succ_edge (a
)->flags
& EDGE_FALLTHRU
);
1869 gcc_assert (!last_stmt (a
) || !stmt_ends_bb_p (last_stmt (a
)));
1871 /* Remove labels from B and set gimple_bb to A for other statements. */
1872 for (gsi
= gsi_start_bb (b
); !gsi_end_p (gsi
);)
1874 gimple stmt
= gsi_stmt (gsi
);
1875 if (gimple_code (stmt
) == GIMPLE_LABEL
)
1877 tree label
= gimple_label_label (stmt
);
1880 gsi_remove (&gsi
, false);
1882 /* Now that we can thread computed gotos, we might have
1883 a situation where we have a forced label in block B
1884 However, the label at the start of block B might still be
1885 used in other ways (think about the runtime checking for
1886 Fortran assigned gotos). So we can not just delete the
1887 label. Instead we move the label to the start of block A. */
1888 if (FORCED_LABEL (label
))
1890 gimple_stmt_iterator dest_gsi
= gsi_start_bb (a
);
1891 gsi_insert_before (&dest_gsi
, stmt
, GSI_NEW_STMT
);
1893 /* Other user labels keep around in a form of a debug stmt. */
1894 else if (!DECL_ARTIFICIAL (label
) && MAY_HAVE_DEBUG_STMTS
)
1896 gimple dbg
= gimple_build_debug_bind (label
,
1899 gimple_debug_bind_reset_value (dbg
);
1900 gsi_insert_before (&gsi
, dbg
, GSI_SAME_STMT
);
1903 lp_nr
= EH_LANDING_PAD_NR (label
);
1906 eh_landing_pad lp
= get_eh_landing_pad_from_number (lp_nr
);
1907 lp
->post_landing_pad
= NULL
;
1912 gimple_set_bb (stmt
, a
);
1917 /* When merging two BBs, if their counts are different, the larger count
1918 is selected as the new bb count. This is to handle inconsistent
1920 if (a
->loop_father
== b
->loop_father
)
1922 a
->count
= MAX (a
->count
, b
->count
);
1923 a
->frequency
= MAX (a
->frequency
, b
->frequency
);
1926 /* Merge the sequences. */
1927 last
= gsi_last_bb (a
);
1928 gsi_insert_seq_after (&last
, bb_seq (b
), GSI_NEW_STMT
);
1929 set_bb_seq (b
, NULL
);
1931 if (cfgcleanup_altered_bbs
)
1932 bitmap_set_bit (cfgcleanup_altered_bbs
, a
->index
);
1936 /* Return the one of two successors of BB that is not reachable by a
1937 complex edge, if there is one. Else, return BB. We use
1938 this in optimizations that use post-dominators for their heuristics,
1939 to catch the cases in C++ where function calls are involved. */
1942 single_noncomplex_succ (basic_block bb
)
1945 if (EDGE_COUNT (bb
->succs
) != 2)
1948 e0
= EDGE_SUCC (bb
, 0);
1949 e1
= EDGE_SUCC (bb
, 1);
1950 if (e0
->flags
& EDGE_COMPLEX
)
1952 if (e1
->flags
& EDGE_COMPLEX
)
1958 /* T is CALL_EXPR. Set current_function_calls_* flags. */
1961 notice_special_calls (gimple_call call
)
1963 int flags
= gimple_call_flags (call
);
1965 if (flags
& ECF_MAY_BE_ALLOCA
)
1966 cfun
->calls_alloca
= true;
1967 if (flags
& ECF_RETURNS_TWICE
)
1968 cfun
->calls_setjmp
= true;
1972 /* Clear flags set by notice_special_calls. Used by dead code removal
1973 to update the flags. */
1976 clear_special_calls (void)
1978 cfun
->calls_alloca
= false;
1979 cfun
->calls_setjmp
= false;
1982 /* Remove PHI nodes associated with basic block BB and all edges out of BB. */
1985 remove_phi_nodes_and_edges_for_unreachable_block (basic_block bb
)
1987 /* Since this block is no longer reachable, we can just delete all
1988 of its PHI nodes. */
1989 remove_phi_nodes (bb
);
1991 /* Remove edges to BB's successors. */
1992 while (EDGE_COUNT (bb
->succs
) > 0)
1993 remove_edge (EDGE_SUCC (bb
, 0));
1997 /* Remove statements of basic block BB. */
2000 remove_bb (basic_block bb
)
2002 gimple_stmt_iterator i
;
2006 fprintf (dump_file
, "Removing basic block %d\n", bb
->index
);
2007 if (dump_flags
& TDF_DETAILS
)
2009 dump_bb (dump_file
, bb
, 0, TDF_BLOCKS
);
2010 fprintf (dump_file
, "\n");
2016 struct loop
*loop
= bb
->loop_father
;
2018 /* If a loop gets removed, clean up the information associated
2020 if (loop
->latch
== bb
2021 || loop
->header
== bb
)
2022 free_numbers_of_iterations_estimates_loop (loop
);
2025 /* Remove all the instructions in the block. */
2026 if (bb_seq (bb
) != NULL
)
2028 /* Walk backwards so as to get a chance to substitute all
2029 released DEFs into debug stmts. See
2030 eliminate_unnecessary_stmts() in tree-ssa-dce.c for more
2032 for (i
= gsi_last_bb (bb
); !gsi_end_p (i
);)
2034 gimple stmt
= gsi_stmt (i
);
2035 if (gimple_code (stmt
) == GIMPLE_LABEL
2036 && (FORCED_LABEL (gimple_label_label (stmt
))
2037 || DECL_NONLOCAL (gimple_label_label (stmt
))))
2040 gimple_stmt_iterator new_gsi
;
2042 /* A non-reachable non-local label may still be referenced.
2043 But it no longer needs to carry the extra semantics of
2045 if (DECL_NONLOCAL (gimple_label_label (stmt
)))
2047 DECL_NONLOCAL (gimple_label_label (stmt
)) = 0;
2048 FORCED_LABEL (gimple_label_label (stmt
)) = 1;
2051 new_bb
= bb
->prev_bb
;
2052 new_gsi
= gsi_start_bb (new_bb
);
2053 gsi_remove (&i
, false);
2054 gsi_insert_before (&new_gsi
, stmt
, GSI_NEW_STMT
);
2058 /* Release SSA definitions if we are in SSA. Note that we
2059 may be called when not in SSA. For example,
2060 final_cleanup calls this function via
2061 cleanup_tree_cfg. */
2062 if (gimple_in_ssa_p (cfun
))
2063 release_defs (stmt
);
2065 gsi_remove (&i
, true);
2069 i
= gsi_last_bb (bb
);
2075 remove_phi_nodes_and_edges_for_unreachable_block (bb
);
2076 bb
->il
.gimple
.seq
= NULL
;
2077 bb
->il
.gimple
.phi_nodes
= NULL
;
2081 /* Given a basic block BB ending with COND_EXPR or SWITCH_EXPR, and a
2082 predicate VAL, return the edge that will be taken out of the block.
2083 If VAL does not match a unique edge, NULL is returned. */
2086 find_taken_edge (basic_block bb
, tree val
)
2090 stmt
= last_stmt (bb
);
2093 gcc_assert (is_ctrl_stmt (stmt
));
2098 if (!is_gimple_min_invariant (val
))
2101 if (gimple_code (stmt
) == GIMPLE_COND
)
2102 return find_taken_edge_cond_expr (bb
, val
);
2104 if (gimple_code (stmt
) == GIMPLE_SWITCH
)
2105 return find_taken_edge_switch_expr (as_a
<gimple_switch
> (stmt
), bb
, val
);
2107 if (computed_goto_p (stmt
))
2109 /* Only optimize if the argument is a label, if the argument is
2110 not a label then we can not construct a proper CFG.
2112 It may be the case that we only need to allow the LABEL_REF to
2113 appear inside an ADDR_EXPR, but we also allow the LABEL_REF to
2114 appear inside a LABEL_EXPR just to be safe. */
2115 if ((TREE_CODE (val
) == ADDR_EXPR
|| TREE_CODE (val
) == LABEL_EXPR
)
2116 && TREE_CODE (TREE_OPERAND (val
, 0)) == LABEL_DECL
)
2117 return find_taken_edge_computed_goto (bb
, TREE_OPERAND (val
, 0));
2124 /* Given a constant value VAL and the entry block BB to a GOTO_EXPR
2125 statement, determine which of the outgoing edges will be taken out of the
2126 block. Return NULL if either edge may be taken. */
2129 find_taken_edge_computed_goto (basic_block bb
, tree val
)
2134 dest
= label_to_block (val
);
2137 e
= find_edge (bb
, dest
);
2138 gcc_assert (e
!= NULL
);
2144 /* Given a constant value VAL and the entry block BB to a COND_EXPR
2145 statement, determine which of the two edges will be taken out of the
2146 block. Return NULL if either edge may be taken. */
2149 find_taken_edge_cond_expr (basic_block bb
, tree val
)
2151 edge true_edge
, false_edge
;
2153 extract_true_false_edges_from_block (bb
, &true_edge
, &false_edge
);
2155 gcc_assert (TREE_CODE (val
) == INTEGER_CST
);
2156 return (integer_zerop (val
) ? false_edge
: true_edge
);
2159 /* Given an INTEGER_CST VAL and the entry block BB to a SWITCH_EXPR
2160 statement, determine which edge will be taken out of the block. Return
2161 NULL if any edge may be taken. */
2164 find_taken_edge_switch_expr (gimple_switch switch_stmt
, basic_block bb
,
2167 basic_block dest_bb
;
2171 taken_case
= find_case_label_for_value (switch_stmt
, val
);
2172 dest_bb
= label_to_block (CASE_LABEL (taken_case
));
2174 e
= find_edge (bb
, dest_bb
);
2180 /* Return the CASE_LABEL_EXPR that SWITCH_STMT will take for VAL.
2181 We can make optimal use here of the fact that the case labels are
2182 sorted: We can do a binary search for a case matching VAL. */
2185 find_case_label_for_value (gimple_switch switch_stmt
, tree val
)
2187 size_t low
, high
, n
= gimple_switch_num_labels (switch_stmt
);
2188 tree default_case
= gimple_switch_default_label (switch_stmt
);
2190 for (low
= 0, high
= n
; high
- low
> 1; )
2192 size_t i
= (high
+ low
) / 2;
2193 tree t
= gimple_switch_label (switch_stmt
, i
);
2196 /* Cache the result of comparing CASE_LOW and val. */
2197 cmp
= tree_int_cst_compare (CASE_LOW (t
), val
);
2204 if (CASE_HIGH (t
) == NULL
)
2206 /* A singe-valued case label. */
2212 /* A case range. We can only handle integer ranges. */
2213 if (cmp
<= 0 && tree_int_cst_compare (CASE_HIGH (t
), val
) >= 0)
2218 return default_case
;
2222 /* Dump a basic block on stderr. */
2225 gimple_debug_bb (basic_block bb
)
2227 dump_bb (stderr
, bb
, 0, TDF_VOPS
|TDF_MEMSYMS
|TDF_BLOCKS
);
2231 /* Dump basic block with index N on stderr. */
2234 gimple_debug_bb_n (int n
)
2236 gimple_debug_bb (BASIC_BLOCK_FOR_FN (cfun
, n
));
2237 return BASIC_BLOCK_FOR_FN (cfun
, n
);
2241 /* Dump the CFG on stderr.
2243 FLAGS are the same used by the tree dumping functions
2244 (see TDF_* in dumpfile.h). */
2247 gimple_debug_cfg (int flags
)
2249 gimple_dump_cfg (stderr
, flags
);
2253 /* Dump the program showing basic block boundaries on the given FILE.
2255 FLAGS are the same used by the tree dumping functions (see TDF_* in
2259 gimple_dump_cfg (FILE *file
, int flags
)
2261 if (flags
& TDF_DETAILS
)
2263 dump_function_header (file
, current_function_decl
, flags
);
2264 fprintf (file
, ";; \n%d basic blocks, %d edges, last basic block %d.\n\n",
2265 n_basic_blocks_for_fn (cfun
), n_edges_for_fn (cfun
),
2266 last_basic_block_for_fn (cfun
));
2268 brief_dump_cfg (file
, flags
| TDF_COMMENT
);
2269 fprintf (file
, "\n");
2272 if (flags
& TDF_STATS
)
2273 dump_cfg_stats (file
);
2275 dump_function_to_file (current_function_decl
, file
, flags
| TDF_BLOCKS
);
2279 /* Dump CFG statistics on FILE. */
2282 dump_cfg_stats (FILE *file
)
2284 static long max_num_merged_labels
= 0;
2285 unsigned long size
, total
= 0;
2288 const char * const fmt_str
= "%-30s%-13s%12s\n";
2289 const char * const fmt_str_1
= "%-30s%13d%11lu%c\n";
2290 const char * const fmt_str_2
= "%-30s%13ld%11lu%c\n";
2291 const char * const fmt_str_3
= "%-43s%11lu%c\n";
2292 const char *funcname
= current_function_name ();
2294 fprintf (file
, "\nCFG Statistics for %s\n\n", funcname
);
2296 fprintf (file
, "---------------------------------------------------------\n");
2297 fprintf (file
, fmt_str
, "", " Number of ", "Memory");
2298 fprintf (file
, fmt_str
, "", " instances ", "used ");
2299 fprintf (file
, "---------------------------------------------------------\n");
2301 size
= n_basic_blocks_for_fn (cfun
) * sizeof (struct basic_block_def
);
2303 fprintf (file
, fmt_str_1
, "Basic blocks", n_basic_blocks_for_fn (cfun
),
2304 SCALE (size
), LABEL (size
));
2307 FOR_EACH_BB_FN (bb
, cfun
)
2308 num_edges
+= EDGE_COUNT (bb
->succs
);
2309 size
= num_edges
* sizeof (struct edge_def
);
2311 fprintf (file
, fmt_str_2
, "Edges", num_edges
, SCALE (size
), LABEL (size
));
2313 fprintf (file
, "---------------------------------------------------------\n");
2314 fprintf (file
, fmt_str_3
, "Total memory used by CFG data", SCALE (total
),
2316 fprintf (file
, "---------------------------------------------------------\n");
2317 fprintf (file
, "\n");
2319 if (cfg_stats
.num_merged_labels
> max_num_merged_labels
)
2320 max_num_merged_labels
= cfg_stats
.num_merged_labels
;
2322 fprintf (file
, "Coalesced label blocks: %ld (Max so far: %ld)\n",
2323 cfg_stats
.num_merged_labels
, max_num_merged_labels
);
2325 fprintf (file
, "\n");
2329 /* Dump CFG statistics on stderr. Keep extern so that it's always
2330 linked in the final executable. */
2333 debug_cfg_stats (void)
2335 dump_cfg_stats (stderr
);
2338 /*---------------------------------------------------------------------------
2339 Miscellaneous helpers
2340 ---------------------------------------------------------------------------*/
2342 /* Return true if T, a GIMPLE_CALL, can make an abnormal transfer of control
2343 flow. Transfers of control flow associated with EH are excluded. */
2346 call_can_make_abnormal_goto (gimple t
)
2348 /* If the function has no non-local labels, then a call cannot make an
2349 abnormal transfer of control. */
2350 if (!cfun
->has_nonlocal_label
2351 && !cfun
->calls_setjmp
)
2354 /* Likewise if the call has no side effects. */
2355 if (!gimple_has_side_effects (t
))
2358 /* Likewise if the called function is leaf. */
2359 if (gimple_call_flags (t
) & ECF_LEAF
)
2366 /* Return true if T can make an abnormal transfer of control flow.
2367 Transfers of control flow associated with EH are excluded. */
2370 stmt_can_make_abnormal_goto (gimple t
)
2372 if (computed_goto_p (t
))
2374 if (is_gimple_call (t
))
2375 return call_can_make_abnormal_goto (t
);
2380 /* Return true if T represents a stmt that always transfers control. */
2383 is_ctrl_stmt (gimple t
)
2385 switch (gimple_code (t
))
2399 /* Return true if T is a statement that may alter the flow of control
2400 (e.g., a call to a non-returning function). */
2403 is_ctrl_altering_stmt (gimple t
)
2407 switch (gimple_code (t
))
2410 /* Per stmt call flag indicates whether the call could alter
2412 if (gimple_call_ctrl_altering_p (t
))
2416 case GIMPLE_EH_DISPATCH
:
2417 /* EH_DISPATCH branches to the individual catch handlers at
2418 this level of a try or allowed-exceptions region. It can
2419 fallthru to the next statement as well. */
2423 if (gimple_asm_nlabels (as_a
<gimple_asm
> (t
)) > 0)
2428 /* OpenMP directives alter control flow. */
2431 case GIMPLE_TRANSACTION
:
2432 /* A transaction start alters control flow. */
2439 /* If a statement can throw, it alters control flow. */
2440 return stmt_can_throw_internal (t
);
2444 /* Return true if T is a simple local goto. */
2447 simple_goto_p (gimple t
)
2449 return (gimple_code (t
) == GIMPLE_GOTO
2450 && TREE_CODE (gimple_goto_dest (t
)) == LABEL_DECL
);
2454 /* Return true if STMT should start a new basic block. PREV_STMT is
2455 the statement preceding STMT. It is used when STMT is a label or a
2456 case label. Labels should only start a new basic block if their
2457 previous statement wasn't a label. Otherwise, sequence of labels
2458 would generate unnecessary basic blocks that only contain a single
2462 stmt_starts_bb_p (gimple stmt
, gimple prev_stmt
)
2467 /* Labels start a new basic block only if the preceding statement
2468 wasn't a label of the same type. This prevents the creation of
2469 consecutive blocks that have nothing but a single label. */
2470 if (gimple_code (stmt
) == GIMPLE_LABEL
)
2472 /* Nonlocal and computed GOTO targets always start a new block. */
2473 if (DECL_NONLOCAL (gimple_label_label (stmt
))
2474 || FORCED_LABEL (gimple_label_label (stmt
)))
2477 if (prev_stmt
&& gimple_code (prev_stmt
) == GIMPLE_LABEL
)
2479 if (DECL_NONLOCAL (gimple_label_label (prev_stmt
)))
2482 cfg_stats
.num_merged_labels
++;
2488 else if (gimple_code (stmt
) == GIMPLE_CALL
2489 && gimple_call_flags (stmt
) & ECF_RETURNS_TWICE
)
2490 /* setjmp acts similar to a nonlocal GOTO target and thus should
2491 start a new block. */
2498 /* Return true if T should end a basic block. */
2501 stmt_ends_bb_p (gimple t
)
2503 return is_ctrl_stmt (t
) || is_ctrl_altering_stmt (t
);
2506 /* Remove block annotations and other data structures. */
2509 delete_tree_cfg_annotations (void)
2511 vec_free (label_to_block_map_for_fn (cfun
));
2515 /* Return the first statement in basic block BB. */
2518 first_stmt (basic_block bb
)
2520 gimple_stmt_iterator i
= gsi_start_bb (bb
);
2523 while (!gsi_end_p (i
) && is_gimple_debug ((stmt
= gsi_stmt (i
))))
2531 /* Return the first non-label statement in basic block BB. */
2534 first_non_label_stmt (basic_block bb
)
2536 gimple_stmt_iterator i
= gsi_start_bb (bb
);
2537 while (!gsi_end_p (i
) && gimple_code (gsi_stmt (i
)) == GIMPLE_LABEL
)
2539 return !gsi_end_p (i
) ? gsi_stmt (i
) : NULL
;
2542 /* Return the last statement in basic block BB. */
2545 last_stmt (basic_block bb
)
2547 gimple_stmt_iterator i
= gsi_last_bb (bb
);
2550 while (!gsi_end_p (i
) && is_gimple_debug ((stmt
= gsi_stmt (i
))))
2558 /* Return the last statement of an otherwise empty block. Return NULL
2559 if the block is totally empty, or if it contains more than one
2563 last_and_only_stmt (basic_block bb
)
2565 gimple_stmt_iterator i
= gsi_last_nondebug_bb (bb
);
2571 last
= gsi_stmt (i
);
2572 gsi_prev_nondebug (&i
);
2576 /* Empty statements should no longer appear in the instruction stream.
2577 Everything that might have appeared before should be deleted by
2578 remove_useless_stmts, and the optimizers should just gsi_remove
2579 instead of smashing with build_empty_stmt.
2581 Thus the only thing that should appear here in a block containing
2582 one executable statement is a label. */
2583 prev
= gsi_stmt (i
);
2584 if (gimple_code (prev
) == GIMPLE_LABEL
)
2590 /* Reinstall those PHI arguments queued in OLD_EDGE to NEW_EDGE. */
2593 reinstall_phi_args (edge new_edge
, edge old_edge
)
2597 gimple_phi_iterator phis
;
2599 vec
<edge_var_map
> *v
= redirect_edge_var_map_vector (old_edge
);
2603 for (i
= 0, phis
= gsi_start_phis (new_edge
->dest
);
2604 v
->iterate (i
, &vm
) && !gsi_end_p (phis
);
2605 i
++, gsi_next (&phis
))
2607 gimple_phi phi
= phis
.phi ();
2608 tree result
= redirect_edge_var_map_result (vm
);
2609 tree arg
= redirect_edge_var_map_def (vm
);
2611 gcc_assert (result
== gimple_phi_result (phi
));
2613 add_phi_arg (phi
, arg
, new_edge
, redirect_edge_var_map_location (vm
));
2616 redirect_edge_var_map_clear (old_edge
);
2619 /* Returns the basic block after which the new basic block created
2620 by splitting edge EDGE_IN should be placed. Tries to keep the new block
2621 near its "logical" location. This is of most help to humans looking
2622 at debugging dumps. */
2625 split_edge_bb_loc (edge edge_in
)
2627 basic_block dest
= edge_in
->dest
;
2628 basic_block dest_prev
= dest
->prev_bb
;
2632 edge e
= find_edge (dest_prev
, dest
);
2633 if (e
&& !(e
->flags
& EDGE_COMPLEX
))
2634 return edge_in
->src
;
2639 /* Split a (typically critical) edge EDGE_IN. Return the new block.
2640 Abort on abnormal edges. */
2643 gimple_split_edge (edge edge_in
)
2645 basic_block new_bb
, after_bb
, dest
;
2648 /* Abnormal edges cannot be split. */
2649 gcc_assert (!(edge_in
->flags
& EDGE_ABNORMAL
));
2651 dest
= edge_in
->dest
;
2653 after_bb
= split_edge_bb_loc (edge_in
);
2655 new_bb
= create_empty_bb (after_bb
);
2656 new_bb
->frequency
= EDGE_FREQUENCY (edge_in
);
2657 new_bb
->count
= edge_in
->count
;
2658 new_edge
= make_edge (new_bb
, dest
, EDGE_FALLTHRU
);
2659 new_edge
->probability
= REG_BR_PROB_BASE
;
2660 new_edge
->count
= edge_in
->count
;
2662 e
= redirect_edge_and_branch (edge_in
, new_bb
);
2663 gcc_assert (e
== edge_in
);
2664 reinstall_phi_args (new_edge
, e
);
2670 /* Verify properties of the address expression T with base object BASE. */
2673 verify_address (tree t
, tree base
)
2676 bool old_side_effects
;
2678 bool new_side_effects
;
2680 old_constant
= TREE_CONSTANT (t
);
2681 old_side_effects
= TREE_SIDE_EFFECTS (t
);
2683 recompute_tree_invariant_for_addr_expr (t
);
2684 new_side_effects
= TREE_SIDE_EFFECTS (t
);
2685 new_constant
= TREE_CONSTANT (t
);
2687 if (old_constant
!= new_constant
)
2689 error ("constant not recomputed when ADDR_EXPR changed");
2692 if (old_side_effects
!= new_side_effects
)
2694 error ("side effects not recomputed when ADDR_EXPR changed");
2698 if (!(TREE_CODE (base
) == VAR_DECL
2699 || TREE_CODE (base
) == PARM_DECL
2700 || TREE_CODE (base
) == RESULT_DECL
))
2703 if (DECL_GIMPLE_REG_P (base
))
2705 error ("DECL_GIMPLE_REG_P set on a variable with address taken");
2712 /* Callback for walk_tree, check that all elements with address taken are
2713 properly noticed as such. The DATA is an int* that is 1 if TP was seen
2714 inside a PHI node. */
2717 verify_expr (tree
*tp
, int *walk_subtrees
, void *data ATTRIBUTE_UNUSED
)
2724 /* Check operand N for being valid GIMPLE and give error MSG if not. */
2725 #define CHECK_OP(N, MSG) \
2726 do { if (!is_gimple_val (TREE_OPERAND (t, N))) \
2727 { error (MSG); return TREE_OPERAND (t, N); }} while (0)
2729 switch (TREE_CODE (t
))
2732 if (SSA_NAME_IN_FREE_LIST (t
))
2734 error ("SSA name in freelist but still referenced");
2740 error ("INDIRECT_REF in gimple IL");
2744 x
= TREE_OPERAND (t
, 0);
2745 if (!POINTER_TYPE_P (TREE_TYPE (x
))
2746 || !is_gimple_mem_ref_addr (x
))
2748 error ("invalid first operand of MEM_REF");
2751 if (TREE_CODE (TREE_OPERAND (t
, 1)) != INTEGER_CST
2752 || !POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (t
, 1))))
2754 error ("invalid offset operand of MEM_REF");
2755 return TREE_OPERAND (t
, 1);
2757 if (TREE_CODE (x
) == ADDR_EXPR
2758 && (x
= verify_address (x
, TREE_OPERAND (x
, 0))))
2764 x
= fold (ASSERT_EXPR_COND (t
));
2765 if (x
== boolean_false_node
)
2767 error ("ASSERT_EXPR with an always-false condition");
2773 error ("MODIFY_EXPR not expected while having tuples");
2780 gcc_assert (is_gimple_address (t
));
2782 /* Skip any references (they will be checked when we recurse down the
2783 tree) and ensure that any variable used as a prefix is marked
2785 for (x
= TREE_OPERAND (t
, 0);
2786 handled_component_p (x
);
2787 x
= TREE_OPERAND (x
, 0))
2790 if ((tem
= verify_address (t
, x
)))
2793 if (!(TREE_CODE (x
) == VAR_DECL
2794 || TREE_CODE (x
) == PARM_DECL
2795 || TREE_CODE (x
) == RESULT_DECL
))
2798 if (!TREE_ADDRESSABLE (x
))
2800 error ("address taken, but ADDRESSABLE bit not set");
2808 x
= COND_EXPR_COND (t
);
2809 if (!INTEGRAL_TYPE_P (TREE_TYPE (x
)))
2811 error ("non-integral used in condition");
2814 if (!is_gimple_condexpr (x
))
2816 error ("invalid conditional operand");
2821 case NON_LVALUE_EXPR
:
2822 case TRUTH_NOT_EXPR
:
2826 case FIX_TRUNC_EXPR
:
2831 CHECK_OP (0, "invalid operand to unary operator");
2837 if (!is_gimple_reg_type (TREE_TYPE (t
)))
2839 error ("non-scalar BIT_FIELD_REF, IMAGPART_EXPR or REALPART_EXPR");
2843 if (TREE_CODE (t
) == BIT_FIELD_REF
)
2845 tree t0
= TREE_OPERAND (t
, 0);
2846 tree t1
= TREE_OPERAND (t
, 1);
2847 tree t2
= TREE_OPERAND (t
, 2);
2848 if (!tree_fits_uhwi_p (t1
)
2849 || !tree_fits_uhwi_p (t2
))
2851 error ("invalid position or size operand to BIT_FIELD_REF");
2854 if (INTEGRAL_TYPE_P (TREE_TYPE (t
))
2855 && (TYPE_PRECISION (TREE_TYPE (t
))
2856 != tree_to_uhwi (t1
)))
2858 error ("integral result type precision does not match "
2859 "field size of BIT_FIELD_REF");
2862 else if (!INTEGRAL_TYPE_P (TREE_TYPE (t
))
2863 && TYPE_MODE (TREE_TYPE (t
)) != BLKmode
2864 && (GET_MODE_PRECISION (TYPE_MODE (TREE_TYPE (t
)))
2865 != tree_to_uhwi (t1
)))
2867 error ("mode precision of non-integral result does not "
2868 "match field size of BIT_FIELD_REF");
2871 if (!AGGREGATE_TYPE_P (TREE_TYPE (t0
))
2872 && (tree_to_uhwi (t1
) + tree_to_uhwi (t2
)
2873 > tree_to_uhwi (TYPE_SIZE (TREE_TYPE (t0
)))))
2875 error ("position plus size exceeds size of referenced object in "
2880 t
= TREE_OPERAND (t
, 0);
2885 case ARRAY_RANGE_REF
:
2886 case VIEW_CONVERT_EXPR
:
2887 /* We have a nest of references. Verify that each of the operands
2888 that determine where to reference is either a constant or a variable,
2889 verify that the base is valid, and then show we've already checked
2891 while (handled_component_p (t
))
2893 if (TREE_CODE (t
) == COMPONENT_REF
&& TREE_OPERAND (t
, 2))
2894 CHECK_OP (2, "invalid COMPONENT_REF offset operator");
2895 else if (TREE_CODE (t
) == ARRAY_REF
2896 || TREE_CODE (t
) == ARRAY_RANGE_REF
)
2898 CHECK_OP (1, "invalid array index");
2899 if (TREE_OPERAND (t
, 2))
2900 CHECK_OP (2, "invalid array lower bound");
2901 if (TREE_OPERAND (t
, 3))
2902 CHECK_OP (3, "invalid array stride");
2904 else if (TREE_CODE (t
) == BIT_FIELD_REF
2905 || TREE_CODE (t
) == REALPART_EXPR
2906 || TREE_CODE (t
) == IMAGPART_EXPR
)
2908 error ("non-top-level BIT_FIELD_REF, IMAGPART_EXPR or "
2913 t
= TREE_OPERAND (t
, 0);
2916 if (!is_gimple_min_invariant (t
) && !is_gimple_lvalue (t
))
2918 error ("invalid reference prefix");
2925 /* PLUS_EXPR and MINUS_EXPR don't work on pointers, they should be done using
2926 POINTER_PLUS_EXPR. */
2927 if (POINTER_TYPE_P (TREE_TYPE (t
)))
2929 error ("invalid operand to plus/minus, type is a pointer");
2932 CHECK_OP (0, "invalid operand to binary operator");
2933 CHECK_OP (1, "invalid operand to binary operator");
2936 case POINTER_PLUS_EXPR
:
2937 /* Check to make sure the first operand is a pointer or reference type. */
2938 if (!POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (t
, 0))))
2940 error ("invalid operand to pointer plus, first operand is not a pointer");
2943 /* Check to make sure the second operand is a ptrofftype. */
2944 if (!ptrofftype_p (TREE_TYPE (TREE_OPERAND (t
, 1))))
2946 error ("invalid operand to pointer plus, second operand is not an "
2947 "integer type of appropriate width");
2957 case UNORDERED_EXPR
:
2966 case TRUNC_DIV_EXPR
:
2968 case FLOOR_DIV_EXPR
:
2969 case ROUND_DIV_EXPR
:
2970 case TRUNC_MOD_EXPR
:
2972 case FLOOR_MOD_EXPR
:
2973 case ROUND_MOD_EXPR
:
2975 case EXACT_DIV_EXPR
:
2985 CHECK_OP (0, "invalid operand to binary operator");
2986 CHECK_OP (1, "invalid operand to binary operator");
2990 if (TREE_CONSTANT (t
) && TREE_CODE (TREE_TYPE (t
)) == VECTOR_TYPE
)
2994 case CASE_LABEL_EXPR
:
2997 error ("invalid CASE_CHAIN");
3011 /* Verify if EXPR is either a GIMPLE ID or a GIMPLE indirect reference.
3012 Returns true if there is an error, otherwise false. */
3015 verify_types_in_gimple_min_lval (tree expr
)
3019 if (is_gimple_id (expr
))
3022 if (TREE_CODE (expr
) != TARGET_MEM_REF
3023 && TREE_CODE (expr
) != MEM_REF
)
3025 error ("invalid expression for min lvalue");
3029 /* TARGET_MEM_REFs are strange beasts. */
3030 if (TREE_CODE (expr
) == TARGET_MEM_REF
)
3033 op
= TREE_OPERAND (expr
, 0);
3034 if (!is_gimple_val (op
))
3036 error ("invalid operand in indirect reference");
3037 debug_generic_stmt (op
);
3040 /* Memory references now generally can involve a value conversion. */
3045 /* Verify if EXPR is a valid GIMPLE reference expression. If
3046 REQUIRE_LVALUE is true verifies it is an lvalue. Returns true
3047 if there is an error, otherwise false. */
3050 verify_types_in_gimple_reference (tree expr
, bool require_lvalue
)
3052 while (handled_component_p (expr
))
3054 tree op
= TREE_OPERAND (expr
, 0);
3056 if (TREE_CODE (expr
) == ARRAY_REF
3057 || TREE_CODE (expr
) == ARRAY_RANGE_REF
)
3059 if (!is_gimple_val (TREE_OPERAND (expr
, 1))
3060 || (TREE_OPERAND (expr
, 2)
3061 && !is_gimple_val (TREE_OPERAND (expr
, 2)))
3062 || (TREE_OPERAND (expr
, 3)
3063 && !is_gimple_val (TREE_OPERAND (expr
, 3))))
3065 error ("invalid operands to array reference");
3066 debug_generic_stmt (expr
);
3071 /* Verify if the reference array element types are compatible. */
3072 if (TREE_CODE (expr
) == ARRAY_REF
3073 && !useless_type_conversion_p (TREE_TYPE (expr
),
3074 TREE_TYPE (TREE_TYPE (op
))))
3076 error ("type mismatch in array reference");
3077 debug_generic_stmt (TREE_TYPE (expr
));
3078 debug_generic_stmt (TREE_TYPE (TREE_TYPE (op
)));
3081 if (TREE_CODE (expr
) == ARRAY_RANGE_REF
3082 && !useless_type_conversion_p (TREE_TYPE (TREE_TYPE (expr
)),
3083 TREE_TYPE (TREE_TYPE (op
))))
3085 error ("type mismatch in array range reference");
3086 debug_generic_stmt (TREE_TYPE (TREE_TYPE (expr
)));
3087 debug_generic_stmt (TREE_TYPE (TREE_TYPE (op
)));
3091 if ((TREE_CODE (expr
) == REALPART_EXPR
3092 || TREE_CODE (expr
) == IMAGPART_EXPR
)
3093 && !useless_type_conversion_p (TREE_TYPE (expr
),
3094 TREE_TYPE (TREE_TYPE (op
))))
3096 error ("type mismatch in real/imagpart reference");
3097 debug_generic_stmt (TREE_TYPE (expr
));
3098 debug_generic_stmt (TREE_TYPE (TREE_TYPE (op
)));
3102 if (TREE_CODE (expr
) == COMPONENT_REF
3103 && !useless_type_conversion_p (TREE_TYPE (expr
),
3104 TREE_TYPE (TREE_OPERAND (expr
, 1))))
3106 error ("type mismatch in component reference");
3107 debug_generic_stmt (TREE_TYPE (expr
));
3108 debug_generic_stmt (TREE_TYPE (TREE_OPERAND (expr
, 1)));
3112 if (TREE_CODE (expr
) == VIEW_CONVERT_EXPR
)
3114 /* For VIEW_CONVERT_EXPRs which are allowed here too, we only check
3115 that their operand is not an SSA name or an invariant when
3116 requiring an lvalue (this usually means there is a SRA or IPA-SRA
3117 bug). Otherwise there is nothing to verify, gross mismatches at
3118 most invoke undefined behavior. */
3120 && (TREE_CODE (op
) == SSA_NAME
3121 || is_gimple_min_invariant (op
)))
3123 error ("conversion of an SSA_NAME on the left hand side");
3124 debug_generic_stmt (expr
);
3127 else if (TREE_CODE (op
) == SSA_NAME
3128 && TYPE_SIZE (TREE_TYPE (expr
)) != TYPE_SIZE (TREE_TYPE (op
)))
3130 error ("conversion of register to a different size");
3131 debug_generic_stmt (expr
);
3134 else if (!handled_component_p (op
))
3141 if (TREE_CODE (expr
) == MEM_REF
)
3143 if (!is_gimple_mem_ref_addr (TREE_OPERAND (expr
, 0)))
3145 error ("invalid address operand in MEM_REF");
3146 debug_generic_stmt (expr
);
3149 if (TREE_CODE (TREE_OPERAND (expr
, 1)) != INTEGER_CST
3150 || !POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (expr
, 1))))
3152 error ("invalid offset operand in MEM_REF");
3153 debug_generic_stmt (expr
);
3157 else if (TREE_CODE (expr
) == TARGET_MEM_REF
)
3159 if (!TMR_BASE (expr
)
3160 || !is_gimple_mem_ref_addr (TMR_BASE (expr
)))
3162 error ("invalid address operand in TARGET_MEM_REF");
3165 if (!TMR_OFFSET (expr
)
3166 || TREE_CODE (TMR_OFFSET (expr
)) != INTEGER_CST
3167 || !POINTER_TYPE_P (TREE_TYPE (TMR_OFFSET (expr
))))
3169 error ("invalid offset operand in TARGET_MEM_REF");
3170 debug_generic_stmt (expr
);
3175 return ((require_lvalue
|| !is_gimple_min_invariant (expr
))
3176 && verify_types_in_gimple_min_lval (expr
));
3179 /* Returns true if there is one pointer type in TYPE_POINTER_TO (SRC_OBJ)
3180 list of pointer-to types that is trivially convertible to DEST. */
3183 one_pointer_to_useless_type_conversion_p (tree dest
, tree src_obj
)
3187 if (!TYPE_POINTER_TO (src_obj
))
3190 for (src
= TYPE_POINTER_TO (src_obj
); src
; src
= TYPE_NEXT_PTR_TO (src
))
3191 if (useless_type_conversion_p (dest
, src
))
3197 /* Return true if TYPE1 is a fixed-point type and if conversions to and
3198 from TYPE2 can be handled by FIXED_CONVERT_EXPR. */
3201 valid_fixed_convert_types_p (tree type1
, tree type2
)
3203 return (FIXED_POINT_TYPE_P (type1
)
3204 && (INTEGRAL_TYPE_P (type2
)
3205 || SCALAR_FLOAT_TYPE_P (type2
)
3206 || FIXED_POINT_TYPE_P (type2
)));
3209 /* Verify the contents of a GIMPLE_CALL STMT. Returns true when there
3210 is a problem, otherwise false. */
3213 verify_gimple_call (gimple_call stmt
)
3215 tree fn
= gimple_call_fn (stmt
);
3216 tree fntype
, fndecl
;
3219 if (gimple_call_internal_p (stmt
))
3223 error ("gimple call has two targets");
3224 debug_generic_stmt (fn
);
3232 error ("gimple call has no target");
3237 if (fn
&& !is_gimple_call_addr (fn
))
3239 error ("invalid function in gimple call");
3240 debug_generic_stmt (fn
);
3245 && (!POINTER_TYPE_P (TREE_TYPE (fn
))
3246 || (TREE_CODE (TREE_TYPE (TREE_TYPE (fn
))) != FUNCTION_TYPE
3247 && TREE_CODE (TREE_TYPE (TREE_TYPE (fn
))) != METHOD_TYPE
)))
3249 error ("non-function in gimple call");
3253 fndecl
= gimple_call_fndecl (stmt
);
3255 && TREE_CODE (fndecl
) == FUNCTION_DECL
3256 && DECL_LOOPING_CONST_OR_PURE_P (fndecl
)
3257 && !DECL_PURE_P (fndecl
)
3258 && !TREE_READONLY (fndecl
))
3260 error ("invalid pure const state for function");
3264 if (gimple_call_lhs (stmt
)
3265 && (!is_gimple_lvalue (gimple_call_lhs (stmt
))
3266 || verify_types_in_gimple_reference (gimple_call_lhs (stmt
), true)))
3268 error ("invalid LHS in gimple call");
3272 if (gimple_call_lhs (stmt
) && gimple_call_noreturn_p (stmt
))
3274 error ("LHS in noreturn call");
3278 fntype
= gimple_call_fntype (stmt
);
3280 && gimple_call_lhs (stmt
)
3281 && !useless_type_conversion_p (TREE_TYPE (gimple_call_lhs (stmt
)),
3283 /* ??? At least C++ misses conversions at assignments from
3284 void * call results.
3285 ??? Java is completely off. Especially with functions
3286 returning java.lang.Object.
3287 For now simply allow arbitrary pointer type conversions. */
3288 && !(POINTER_TYPE_P (TREE_TYPE (gimple_call_lhs (stmt
)))
3289 && POINTER_TYPE_P (TREE_TYPE (fntype
))))
3291 error ("invalid conversion in gimple call");
3292 debug_generic_stmt (TREE_TYPE (gimple_call_lhs (stmt
)));
3293 debug_generic_stmt (TREE_TYPE (fntype
));
3297 if (gimple_call_chain (stmt
)
3298 && !is_gimple_val (gimple_call_chain (stmt
)))
3300 error ("invalid static chain in gimple call");
3301 debug_generic_stmt (gimple_call_chain (stmt
));
3305 /* If there is a static chain argument, this should not be an indirect
3306 call, and the decl should have DECL_STATIC_CHAIN set. */
3307 if (gimple_call_chain (stmt
))
3309 if (!gimple_call_fndecl (stmt
))
3311 error ("static chain in indirect gimple call");
3314 fn
= TREE_OPERAND (fn
, 0);
3316 if (!DECL_STATIC_CHAIN (fn
))
3318 error ("static chain with function that doesn%'t use one");
3323 /* ??? The C frontend passes unpromoted arguments in case it
3324 didn't see a function declaration before the call. So for now
3325 leave the call arguments mostly unverified. Once we gimplify
3326 unit-at-a-time we have a chance to fix this. */
3328 for (i
= 0; i
< gimple_call_num_args (stmt
); ++i
)
3330 tree arg
= gimple_call_arg (stmt
, i
);
3331 if ((is_gimple_reg_type (TREE_TYPE (arg
))
3332 && !is_gimple_val (arg
))
3333 || (!is_gimple_reg_type (TREE_TYPE (arg
))
3334 && !is_gimple_lvalue (arg
)))
3336 error ("invalid argument to gimple call");
3337 debug_generic_expr (arg
);
3345 /* Verifies the gimple comparison with the result type TYPE and
3346 the operands OP0 and OP1. */
3349 verify_gimple_comparison (tree type
, tree op0
, tree op1
)
3351 tree op0_type
= TREE_TYPE (op0
);
3352 tree op1_type
= TREE_TYPE (op1
);
3354 if (!is_gimple_val (op0
) || !is_gimple_val (op1
))
3356 error ("invalid operands in gimple comparison");
3360 /* For comparisons we do not have the operations type as the
3361 effective type the comparison is carried out in. Instead
3362 we require that either the first operand is trivially
3363 convertible into the second, or the other way around.
3364 Because we special-case pointers to void we allow
3365 comparisons of pointers with the same mode as well. */
3366 if (!useless_type_conversion_p (op0_type
, op1_type
)
3367 && !useless_type_conversion_p (op1_type
, op0_type
)
3368 && (!POINTER_TYPE_P (op0_type
)
3369 || !POINTER_TYPE_P (op1_type
)
3370 || TYPE_MODE (op0_type
) != TYPE_MODE (op1_type
)))
3372 error ("mismatching comparison operand types");
3373 debug_generic_expr (op0_type
);
3374 debug_generic_expr (op1_type
);
3378 /* The resulting type of a comparison may be an effective boolean type. */
3379 if (INTEGRAL_TYPE_P (type
)
3380 && (TREE_CODE (type
) == BOOLEAN_TYPE
3381 || TYPE_PRECISION (type
) == 1))
3383 if (TREE_CODE (op0_type
) == VECTOR_TYPE
3384 || TREE_CODE (op1_type
) == VECTOR_TYPE
)
3386 error ("vector comparison returning a boolean");
3387 debug_generic_expr (op0_type
);
3388 debug_generic_expr (op1_type
);
3392 /* Or an integer vector type with the same size and element count
3393 as the comparison operand types. */
3394 else if (TREE_CODE (type
) == VECTOR_TYPE
3395 && TREE_CODE (TREE_TYPE (type
)) == INTEGER_TYPE
)
3397 if (TREE_CODE (op0_type
) != VECTOR_TYPE
3398 || TREE_CODE (op1_type
) != VECTOR_TYPE
)
3400 error ("non-vector operands in vector comparison");
3401 debug_generic_expr (op0_type
);
3402 debug_generic_expr (op1_type
);
3406 if (TYPE_VECTOR_SUBPARTS (type
) != TYPE_VECTOR_SUBPARTS (op0_type
)
3407 || (GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (type
)))
3408 != GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (op0_type
))))
3409 /* The result of a vector comparison is of signed
3411 || TYPE_UNSIGNED (TREE_TYPE (type
)))
3413 error ("invalid vector comparison resulting type");
3414 debug_generic_expr (type
);
3420 error ("bogus comparison result type");
3421 debug_generic_expr (type
);
3428 /* Verify a gimple assignment statement STMT with an unary rhs.
3429 Returns true if anything is wrong. */
3432 verify_gimple_assign_unary (gimple_assign stmt
)
3434 enum tree_code rhs_code
= gimple_assign_rhs_code (stmt
);
3435 tree lhs
= gimple_assign_lhs (stmt
);
3436 tree lhs_type
= TREE_TYPE (lhs
);
3437 tree rhs1
= gimple_assign_rhs1 (stmt
);
3438 tree rhs1_type
= TREE_TYPE (rhs1
);
3440 if (!is_gimple_reg (lhs
))
3442 error ("non-register as LHS of unary operation");
3446 if (!is_gimple_val (rhs1
))
3448 error ("invalid operand in unary operation");
3452 /* First handle conversions. */
3457 /* Allow conversions from pointer type to integral type only if
3458 there is no sign or zero extension involved.
3459 For targets were the precision of ptrofftype doesn't match that
3460 of pointers we need to allow arbitrary conversions to ptrofftype. */
3461 if ((POINTER_TYPE_P (lhs_type
)
3462 && INTEGRAL_TYPE_P (rhs1_type
))
3463 || (POINTER_TYPE_P (rhs1_type
)
3464 && INTEGRAL_TYPE_P (lhs_type
)
3465 && (TYPE_PRECISION (rhs1_type
) >= TYPE_PRECISION (lhs_type
)
3466 || ptrofftype_p (sizetype
))))
3469 /* Allow conversion from integral to offset type and vice versa. */
3470 if ((TREE_CODE (lhs_type
) == OFFSET_TYPE
3471 && INTEGRAL_TYPE_P (rhs1_type
))
3472 || (INTEGRAL_TYPE_P (lhs_type
)
3473 && TREE_CODE (rhs1_type
) == OFFSET_TYPE
))
3476 /* Otherwise assert we are converting between types of the
3478 if (INTEGRAL_TYPE_P (lhs_type
) != INTEGRAL_TYPE_P (rhs1_type
))
3480 error ("invalid types in nop conversion");
3481 debug_generic_expr (lhs_type
);
3482 debug_generic_expr (rhs1_type
);
3489 case ADDR_SPACE_CONVERT_EXPR
:
3491 if (!POINTER_TYPE_P (rhs1_type
) || !POINTER_TYPE_P (lhs_type
)
3492 || (TYPE_ADDR_SPACE (TREE_TYPE (rhs1_type
))
3493 == TYPE_ADDR_SPACE (TREE_TYPE (lhs_type
))))
3495 error ("invalid types in address space conversion");
3496 debug_generic_expr (lhs_type
);
3497 debug_generic_expr (rhs1_type
);
3504 case FIXED_CONVERT_EXPR
:
3506 if (!valid_fixed_convert_types_p (lhs_type
, rhs1_type
)
3507 && !valid_fixed_convert_types_p (rhs1_type
, lhs_type
))
3509 error ("invalid types in fixed-point conversion");
3510 debug_generic_expr (lhs_type
);
3511 debug_generic_expr (rhs1_type
);
3520 if ((!INTEGRAL_TYPE_P (rhs1_type
) || !SCALAR_FLOAT_TYPE_P (lhs_type
))
3521 && (!VECTOR_INTEGER_TYPE_P (rhs1_type
)
3522 || !VECTOR_FLOAT_TYPE_P (lhs_type
)))
3524 error ("invalid types in conversion to floating point");
3525 debug_generic_expr (lhs_type
);
3526 debug_generic_expr (rhs1_type
);
3533 case FIX_TRUNC_EXPR
:
3535 if ((!INTEGRAL_TYPE_P (lhs_type
) || !SCALAR_FLOAT_TYPE_P (rhs1_type
))
3536 && (!VECTOR_INTEGER_TYPE_P (lhs_type
)
3537 || !VECTOR_FLOAT_TYPE_P (rhs1_type
)))
3539 error ("invalid types in conversion to integer");
3540 debug_generic_expr (lhs_type
);
3541 debug_generic_expr (rhs1_type
);
3548 case VEC_UNPACK_HI_EXPR
:
3549 case VEC_UNPACK_LO_EXPR
:
3550 case REDUC_MAX_EXPR
:
3551 case REDUC_MIN_EXPR
:
3552 case REDUC_PLUS_EXPR
:
3553 case VEC_UNPACK_FLOAT_HI_EXPR
:
3554 case VEC_UNPACK_FLOAT_LO_EXPR
:
3569 /* For the remaining codes assert there is no conversion involved. */
3570 if (!useless_type_conversion_p (lhs_type
, rhs1_type
))
3572 error ("non-trivial conversion in unary operation");
3573 debug_generic_expr (lhs_type
);
3574 debug_generic_expr (rhs1_type
);
3581 /* Verify a gimple assignment statement STMT with a binary rhs.
3582 Returns true if anything is wrong. */
3585 verify_gimple_assign_binary (gimple_assign stmt
)
3587 enum tree_code rhs_code
= gimple_assign_rhs_code (stmt
);
3588 tree lhs
= gimple_assign_lhs (stmt
);
3589 tree lhs_type
= TREE_TYPE (lhs
);
3590 tree rhs1
= gimple_assign_rhs1 (stmt
);
3591 tree rhs1_type
= TREE_TYPE (rhs1
);
3592 tree rhs2
= gimple_assign_rhs2 (stmt
);
3593 tree rhs2_type
= TREE_TYPE (rhs2
);
3595 if (!is_gimple_reg (lhs
))
3597 error ("non-register as LHS of binary operation");
3601 if (!is_gimple_val (rhs1
)
3602 || !is_gimple_val (rhs2
))
3604 error ("invalid operands in binary operation");
3608 /* First handle operations that involve different types. */
3613 if (TREE_CODE (lhs_type
) != COMPLEX_TYPE
3614 || !(INTEGRAL_TYPE_P (rhs1_type
)
3615 || SCALAR_FLOAT_TYPE_P (rhs1_type
))
3616 || !(INTEGRAL_TYPE_P (rhs2_type
)
3617 || SCALAR_FLOAT_TYPE_P (rhs2_type
)))
3619 error ("type mismatch in complex expression");
3620 debug_generic_expr (lhs_type
);
3621 debug_generic_expr (rhs1_type
);
3622 debug_generic_expr (rhs2_type
);
3634 /* Shifts and rotates are ok on integral types, fixed point
3635 types and integer vector types. */
3636 if ((!INTEGRAL_TYPE_P (rhs1_type
)
3637 && !FIXED_POINT_TYPE_P (rhs1_type
)
3638 && !(TREE_CODE (rhs1_type
) == VECTOR_TYPE
3639 && INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type
))))
3640 || (!INTEGRAL_TYPE_P (rhs2_type
)
3641 /* Vector shifts of vectors are also ok. */
3642 && !(TREE_CODE (rhs1_type
) == VECTOR_TYPE
3643 && INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type
))
3644 && TREE_CODE (rhs2_type
) == VECTOR_TYPE
3645 && INTEGRAL_TYPE_P (TREE_TYPE (rhs2_type
))))
3646 || !useless_type_conversion_p (lhs_type
, rhs1_type
))
3648 error ("type mismatch in shift expression");
3649 debug_generic_expr (lhs_type
);
3650 debug_generic_expr (rhs1_type
);
3651 debug_generic_expr (rhs2_type
);
3658 case VEC_LSHIFT_EXPR
:
3659 case VEC_RSHIFT_EXPR
:
3661 if (TREE_CODE (rhs1_type
) != VECTOR_TYPE
3662 || !(INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type
))
3663 || POINTER_TYPE_P (TREE_TYPE (rhs1_type
))
3664 || FIXED_POINT_TYPE_P (TREE_TYPE (rhs1_type
))
3665 || SCALAR_FLOAT_TYPE_P (TREE_TYPE (rhs1_type
)))
3666 || (!INTEGRAL_TYPE_P (rhs2_type
)
3667 && (TREE_CODE (rhs2_type
) != VECTOR_TYPE
3668 || !INTEGRAL_TYPE_P (TREE_TYPE (rhs2_type
))))
3669 || !useless_type_conversion_p (lhs_type
, rhs1_type
))
3671 error ("type mismatch in vector shift expression");
3672 debug_generic_expr (lhs_type
);
3673 debug_generic_expr (rhs1_type
);
3674 debug_generic_expr (rhs2_type
);
3677 /* For shifting a vector of non-integral components we
3678 only allow shifting by a constant multiple of the element size. */
3679 if (!INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type
))
3680 && (TREE_CODE (rhs2
) != INTEGER_CST
3681 || !div_if_zero_remainder (rhs2
,
3682 TYPE_SIZE (TREE_TYPE (rhs1_type
)))))
3684 error ("non-element sized vector shift of floating point vector");
3691 case WIDEN_LSHIFT_EXPR
:
3693 if (!INTEGRAL_TYPE_P (lhs_type
)
3694 || !INTEGRAL_TYPE_P (rhs1_type
)
3695 || TREE_CODE (rhs2
) != INTEGER_CST
3696 || (2 * TYPE_PRECISION (rhs1_type
) > TYPE_PRECISION (lhs_type
)))
3698 error ("type mismatch in widening vector shift expression");
3699 debug_generic_expr (lhs_type
);
3700 debug_generic_expr (rhs1_type
);
3701 debug_generic_expr (rhs2_type
);
3708 case VEC_WIDEN_LSHIFT_HI_EXPR
:
3709 case VEC_WIDEN_LSHIFT_LO_EXPR
:
3711 if (TREE_CODE (rhs1_type
) != VECTOR_TYPE
3712 || TREE_CODE (lhs_type
) != VECTOR_TYPE
3713 || !INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type
))
3714 || !INTEGRAL_TYPE_P (TREE_TYPE (lhs_type
))
3715 || TREE_CODE (rhs2
) != INTEGER_CST
3716 || (2 * TYPE_PRECISION (TREE_TYPE (rhs1_type
))
3717 > TYPE_PRECISION (TREE_TYPE (lhs_type
))))
3719 error ("type mismatch in widening vector shift expression");
3720 debug_generic_expr (lhs_type
);
3721 debug_generic_expr (rhs1_type
);
3722 debug_generic_expr (rhs2_type
);
3732 tree lhs_etype
= lhs_type
;
3733 tree rhs1_etype
= rhs1_type
;
3734 tree rhs2_etype
= rhs2_type
;
3735 if (TREE_CODE (lhs_type
) == VECTOR_TYPE
)
3737 if (TREE_CODE (rhs1_type
) != VECTOR_TYPE
3738 || TREE_CODE (rhs2_type
) != VECTOR_TYPE
)
3740 error ("invalid non-vector operands to vector valued plus");
3743 lhs_etype
= TREE_TYPE (lhs_type
);
3744 rhs1_etype
= TREE_TYPE (rhs1_type
);
3745 rhs2_etype
= TREE_TYPE (rhs2_type
);
3747 if (POINTER_TYPE_P (lhs_etype
)
3748 || POINTER_TYPE_P (rhs1_etype
)
3749 || POINTER_TYPE_P (rhs2_etype
))
3751 error ("invalid (pointer) operands to plus/minus");
3755 /* Continue with generic binary expression handling. */
3759 case POINTER_PLUS_EXPR
:
3761 if (!POINTER_TYPE_P (rhs1_type
)
3762 || !useless_type_conversion_p (lhs_type
, rhs1_type
)
3763 || !ptrofftype_p (rhs2_type
))
3765 error ("type mismatch in pointer plus expression");
3766 debug_generic_stmt (lhs_type
);
3767 debug_generic_stmt (rhs1_type
);
3768 debug_generic_stmt (rhs2_type
);
3775 case TRUTH_ANDIF_EXPR
:
3776 case TRUTH_ORIF_EXPR
:
3777 case TRUTH_AND_EXPR
:
3779 case TRUTH_XOR_EXPR
:
3789 case UNORDERED_EXPR
:
3797 /* Comparisons are also binary, but the result type is not
3798 connected to the operand types. */
3799 return verify_gimple_comparison (lhs_type
, rhs1
, rhs2
);
3801 case WIDEN_MULT_EXPR
:
3802 if (TREE_CODE (lhs_type
) != INTEGER_TYPE
)
3804 return ((2 * TYPE_PRECISION (rhs1_type
) > TYPE_PRECISION (lhs_type
))
3805 || (TYPE_PRECISION (rhs1_type
) != TYPE_PRECISION (rhs2_type
)));
3807 case WIDEN_SUM_EXPR
:
3808 case VEC_WIDEN_MULT_HI_EXPR
:
3809 case VEC_WIDEN_MULT_LO_EXPR
:
3810 case VEC_WIDEN_MULT_EVEN_EXPR
:
3811 case VEC_WIDEN_MULT_ODD_EXPR
:
3812 case VEC_PACK_TRUNC_EXPR
:
3813 case VEC_PACK_SAT_EXPR
:
3814 case VEC_PACK_FIX_TRUNC_EXPR
:
3819 case MULT_HIGHPART_EXPR
:
3820 case TRUNC_DIV_EXPR
:
3822 case FLOOR_DIV_EXPR
:
3823 case ROUND_DIV_EXPR
:
3824 case TRUNC_MOD_EXPR
:
3826 case FLOOR_MOD_EXPR
:
3827 case ROUND_MOD_EXPR
:
3829 case EXACT_DIV_EXPR
:
3835 /* Continue with generic binary expression handling. */
3842 if (!useless_type_conversion_p (lhs_type
, rhs1_type
)
3843 || !useless_type_conversion_p (lhs_type
, rhs2_type
))
3845 error ("type mismatch in binary expression");
3846 debug_generic_stmt (lhs_type
);
3847 debug_generic_stmt (rhs1_type
);
3848 debug_generic_stmt (rhs2_type
);
3855 /* Verify a gimple assignment statement STMT with a ternary rhs.
3856 Returns true if anything is wrong. */
3859 verify_gimple_assign_ternary (gimple_assign stmt
)
3861 enum tree_code rhs_code
= gimple_assign_rhs_code (stmt
);
3862 tree lhs
= gimple_assign_lhs (stmt
);
3863 tree lhs_type
= TREE_TYPE (lhs
);
3864 tree rhs1
= gimple_assign_rhs1 (stmt
);
3865 tree rhs1_type
= TREE_TYPE (rhs1
);
3866 tree rhs2
= gimple_assign_rhs2 (stmt
);
3867 tree rhs2_type
= TREE_TYPE (rhs2
);
3868 tree rhs3
= gimple_assign_rhs3 (stmt
);
3869 tree rhs3_type
= TREE_TYPE (rhs3
);
3871 if (!is_gimple_reg (lhs
))
3873 error ("non-register as LHS of ternary operation");
3877 if (((rhs_code
== VEC_COND_EXPR
|| rhs_code
== COND_EXPR
)
3878 ? !is_gimple_condexpr (rhs1
) : !is_gimple_val (rhs1
))
3879 || !is_gimple_val (rhs2
)
3880 || !is_gimple_val (rhs3
))
3882 error ("invalid operands in ternary operation");
3886 /* First handle operations that involve different types. */
3889 case WIDEN_MULT_PLUS_EXPR
:
3890 case WIDEN_MULT_MINUS_EXPR
:
3891 if ((!INTEGRAL_TYPE_P (rhs1_type
)
3892 && !FIXED_POINT_TYPE_P (rhs1_type
))
3893 || !useless_type_conversion_p (rhs1_type
, rhs2_type
)
3894 || !useless_type_conversion_p (lhs_type
, rhs3_type
)
3895 || 2 * TYPE_PRECISION (rhs1_type
) > TYPE_PRECISION (lhs_type
)
3896 || TYPE_PRECISION (rhs1_type
) != TYPE_PRECISION (rhs2_type
))
3898 error ("type mismatch in widening multiply-accumulate expression");
3899 debug_generic_expr (lhs_type
);
3900 debug_generic_expr (rhs1_type
);
3901 debug_generic_expr (rhs2_type
);
3902 debug_generic_expr (rhs3_type
);
3908 if (!useless_type_conversion_p (lhs_type
, rhs1_type
)
3909 || !useless_type_conversion_p (lhs_type
, rhs2_type
)
3910 || !useless_type_conversion_p (lhs_type
, rhs3_type
))
3912 error ("type mismatch in fused multiply-add expression");
3913 debug_generic_expr (lhs_type
);
3914 debug_generic_expr (rhs1_type
);
3915 debug_generic_expr (rhs2_type
);
3916 debug_generic_expr (rhs3_type
);
3923 if (!useless_type_conversion_p (lhs_type
, rhs2_type
)
3924 || !useless_type_conversion_p (lhs_type
, rhs3_type
))
3926 error ("type mismatch in conditional expression");
3927 debug_generic_expr (lhs_type
);
3928 debug_generic_expr (rhs2_type
);
3929 debug_generic_expr (rhs3_type
);
3935 if (!useless_type_conversion_p (lhs_type
, rhs1_type
)
3936 || !useless_type_conversion_p (lhs_type
, rhs2_type
))
3938 error ("type mismatch in vector permute expression");
3939 debug_generic_expr (lhs_type
);
3940 debug_generic_expr (rhs1_type
);
3941 debug_generic_expr (rhs2_type
);
3942 debug_generic_expr (rhs3_type
);
3946 if (TREE_CODE (rhs1_type
) != VECTOR_TYPE
3947 || TREE_CODE (rhs2_type
) != VECTOR_TYPE
3948 || TREE_CODE (rhs3_type
) != VECTOR_TYPE
)
3950 error ("vector types expected in vector permute expression");
3951 debug_generic_expr (lhs_type
);
3952 debug_generic_expr (rhs1_type
);
3953 debug_generic_expr (rhs2_type
);
3954 debug_generic_expr (rhs3_type
);
3958 if (TYPE_VECTOR_SUBPARTS (rhs1_type
) != TYPE_VECTOR_SUBPARTS (rhs2_type
)
3959 || TYPE_VECTOR_SUBPARTS (rhs2_type
)
3960 != TYPE_VECTOR_SUBPARTS (rhs3_type
)
3961 || TYPE_VECTOR_SUBPARTS (rhs3_type
)
3962 != TYPE_VECTOR_SUBPARTS (lhs_type
))
3964 error ("vectors with different element number found "
3965 "in vector permute expression");
3966 debug_generic_expr (lhs_type
);
3967 debug_generic_expr (rhs1_type
);
3968 debug_generic_expr (rhs2_type
);
3969 debug_generic_expr (rhs3_type
);
3973 if (TREE_CODE (TREE_TYPE (rhs3_type
)) != INTEGER_TYPE
3974 || GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (rhs3_type
)))
3975 != GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (rhs1_type
))))
3977 error ("invalid mask type in vector permute expression");
3978 debug_generic_expr (lhs_type
);
3979 debug_generic_expr (rhs1_type
);
3980 debug_generic_expr (rhs2_type
);
3981 debug_generic_expr (rhs3_type
);
3988 if (!useless_type_conversion_p (rhs1_type
, rhs2_type
)
3989 || !useless_type_conversion_p (lhs_type
, rhs3_type
)
3990 || 2 * GET_MODE_BITSIZE (GET_MODE_INNER
3991 (TYPE_MODE (TREE_TYPE (rhs1_type
))))
3992 > GET_MODE_BITSIZE (GET_MODE_INNER
3993 (TYPE_MODE (TREE_TYPE (lhs_type
)))))
3995 error ("type mismatch in sad expression");
3996 debug_generic_expr (lhs_type
);
3997 debug_generic_expr (rhs1_type
);
3998 debug_generic_expr (rhs2_type
);
3999 debug_generic_expr (rhs3_type
);
4003 if (TREE_CODE (rhs1_type
) != VECTOR_TYPE
4004 || TREE_CODE (rhs2_type
) != VECTOR_TYPE
4005 || TREE_CODE (rhs3_type
) != VECTOR_TYPE
)
4007 error ("vector types expected in sad expression");
4008 debug_generic_expr (lhs_type
);
4009 debug_generic_expr (rhs1_type
);
4010 debug_generic_expr (rhs2_type
);
4011 debug_generic_expr (rhs3_type
);
4018 case REALIGN_LOAD_EXPR
:
4028 /* Verify a gimple assignment statement STMT with a single rhs.
4029 Returns true if anything is wrong. */
4032 verify_gimple_assign_single (gimple_assign stmt
)
4034 enum tree_code rhs_code
= gimple_assign_rhs_code (stmt
);
4035 tree lhs
= gimple_assign_lhs (stmt
);
4036 tree lhs_type
= TREE_TYPE (lhs
);
4037 tree rhs1
= gimple_assign_rhs1 (stmt
);
4038 tree rhs1_type
= TREE_TYPE (rhs1
);
4041 if (!useless_type_conversion_p (lhs_type
, rhs1_type
))
4043 error ("non-trivial conversion at assignment");
4044 debug_generic_expr (lhs_type
);
4045 debug_generic_expr (rhs1_type
);
4049 if (gimple_clobber_p (stmt
)
4050 && !(DECL_P (lhs
) || TREE_CODE (lhs
) == MEM_REF
))
4052 error ("non-decl/MEM_REF LHS in clobber statement");
4053 debug_generic_expr (lhs
);
4057 if (handled_component_p (lhs
)
4058 || TREE_CODE (lhs
) == MEM_REF
4059 || TREE_CODE (lhs
) == TARGET_MEM_REF
)
4060 res
|= verify_types_in_gimple_reference (lhs
, true);
4062 /* Special codes we cannot handle via their class. */
4067 tree op
= TREE_OPERAND (rhs1
, 0);
4068 if (!is_gimple_addressable (op
))
4070 error ("invalid operand in unary expression");
4074 /* Technically there is no longer a need for matching types, but
4075 gimple hygiene asks for this check. In LTO we can end up
4076 combining incompatible units and thus end up with addresses
4077 of globals that change their type to a common one. */
4079 && !types_compatible_p (TREE_TYPE (op
),
4080 TREE_TYPE (TREE_TYPE (rhs1
)))
4081 && !one_pointer_to_useless_type_conversion_p (TREE_TYPE (rhs1
),
4084 error ("type mismatch in address expression");
4085 debug_generic_stmt (TREE_TYPE (rhs1
));
4086 debug_generic_stmt (TREE_TYPE (op
));
4090 return verify_types_in_gimple_reference (op
, true);
4095 error ("INDIRECT_REF in gimple IL");
4101 case ARRAY_RANGE_REF
:
4102 case VIEW_CONVERT_EXPR
:
4105 case TARGET_MEM_REF
:
4107 if (!is_gimple_reg (lhs
)
4108 && is_gimple_reg_type (TREE_TYPE (lhs
)))
4110 error ("invalid rhs for gimple memory store");
4111 debug_generic_stmt (lhs
);
4112 debug_generic_stmt (rhs1
);
4115 return res
|| verify_types_in_gimple_reference (rhs1
, false);
4127 /* tcc_declaration */
4132 if (!is_gimple_reg (lhs
)
4133 && !is_gimple_reg (rhs1
)
4134 && is_gimple_reg_type (TREE_TYPE (lhs
)))
4136 error ("invalid rhs for gimple memory store");
4137 debug_generic_stmt (lhs
);
4138 debug_generic_stmt (rhs1
);
4144 if (TREE_CODE (rhs1_type
) == VECTOR_TYPE
)
4147 tree elt_i
, elt_v
, elt_t
= NULL_TREE
;
4149 if (CONSTRUCTOR_NELTS (rhs1
) == 0)
4151 /* For vector CONSTRUCTORs we require that either it is empty
4152 CONSTRUCTOR, or it is a CONSTRUCTOR of smaller vector elements
4153 (then the element count must be correct to cover the whole
4154 outer vector and index must be NULL on all elements, or it is
4155 a CONSTRUCTOR of scalar elements, where we as an exception allow
4156 smaller number of elements (assuming zero filling) and
4157 consecutive indexes as compared to NULL indexes (such
4158 CONSTRUCTORs can appear in the IL from FEs). */
4159 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (rhs1
), i
, elt_i
, elt_v
)
4161 if (elt_t
== NULL_TREE
)
4163 elt_t
= TREE_TYPE (elt_v
);
4164 if (TREE_CODE (elt_t
) == VECTOR_TYPE
)
4166 tree elt_t
= TREE_TYPE (elt_v
);
4167 if (!useless_type_conversion_p (TREE_TYPE (rhs1_type
),
4170 error ("incorrect type of vector CONSTRUCTOR"
4172 debug_generic_stmt (rhs1
);
4175 else if (CONSTRUCTOR_NELTS (rhs1
)
4176 * TYPE_VECTOR_SUBPARTS (elt_t
)
4177 != TYPE_VECTOR_SUBPARTS (rhs1_type
))
4179 error ("incorrect number of vector CONSTRUCTOR"
4181 debug_generic_stmt (rhs1
);
4185 else if (!useless_type_conversion_p (TREE_TYPE (rhs1_type
),
4188 error ("incorrect type of vector CONSTRUCTOR elements");
4189 debug_generic_stmt (rhs1
);
4192 else if (CONSTRUCTOR_NELTS (rhs1
)
4193 > TYPE_VECTOR_SUBPARTS (rhs1_type
))
4195 error ("incorrect number of vector CONSTRUCTOR elements");
4196 debug_generic_stmt (rhs1
);
4200 else if (!useless_type_conversion_p (elt_t
, TREE_TYPE (elt_v
)))
4202 error ("incorrect type of vector CONSTRUCTOR elements");
4203 debug_generic_stmt (rhs1
);
4206 if (elt_i
!= NULL_TREE
4207 && (TREE_CODE (elt_t
) == VECTOR_TYPE
4208 || TREE_CODE (elt_i
) != INTEGER_CST
4209 || compare_tree_int (elt_i
, i
) != 0))
4211 error ("vector CONSTRUCTOR with non-NULL element index");
4212 debug_generic_stmt (rhs1
);
4215 if (!is_gimple_val (elt_v
))
4217 error ("vector CONSTRUCTOR element is not a GIMPLE value");
4218 debug_generic_stmt (rhs1
);
4223 else if (CONSTRUCTOR_NELTS (rhs1
) != 0)
4225 error ("non-vector CONSTRUCTOR with elements");
4226 debug_generic_stmt (rhs1
);
4232 case WITH_SIZE_EXPR
:
4242 /* Verify the contents of a GIMPLE_ASSIGN STMT. Returns true when there
4243 is a problem, otherwise false. */
4246 verify_gimple_assign (gimple_assign stmt
)
4248 switch (gimple_assign_rhs_class (stmt
))
4250 case GIMPLE_SINGLE_RHS
:
4251 return verify_gimple_assign_single (stmt
);
4253 case GIMPLE_UNARY_RHS
:
4254 return verify_gimple_assign_unary (stmt
);
4256 case GIMPLE_BINARY_RHS
:
4257 return verify_gimple_assign_binary (stmt
);
4259 case GIMPLE_TERNARY_RHS
:
4260 return verify_gimple_assign_ternary (stmt
);
4267 /* Verify the contents of a GIMPLE_RETURN STMT. Returns true when there
4268 is a problem, otherwise false. */
4271 verify_gimple_return (gimple_return stmt
)
4273 tree op
= gimple_return_retval (stmt
);
4274 tree restype
= TREE_TYPE (TREE_TYPE (cfun
->decl
));
4276 /* We cannot test for present return values as we do not fix up missing
4277 return values from the original source. */
4281 if (!is_gimple_val (op
)
4282 && TREE_CODE (op
) != RESULT_DECL
)
4284 error ("invalid operand in return statement");
4285 debug_generic_stmt (op
);
4289 if ((TREE_CODE (op
) == RESULT_DECL
4290 && DECL_BY_REFERENCE (op
))
4291 || (TREE_CODE (op
) == SSA_NAME
4292 && SSA_NAME_VAR (op
)
4293 && TREE_CODE (SSA_NAME_VAR (op
)) == RESULT_DECL
4294 && DECL_BY_REFERENCE (SSA_NAME_VAR (op
))))
4295 op
= TREE_TYPE (op
);
4297 if (!useless_type_conversion_p (restype
, TREE_TYPE (op
)))
4299 error ("invalid conversion in return statement");
4300 debug_generic_stmt (restype
);
4301 debug_generic_stmt (TREE_TYPE (op
));
4309 /* Verify the contents of a GIMPLE_GOTO STMT. Returns true when there
4310 is a problem, otherwise false. */
4313 verify_gimple_goto (gimple_goto stmt
)
4315 tree dest
= gimple_goto_dest (stmt
);
4317 /* ??? We have two canonical forms of direct goto destinations, a
4318 bare LABEL_DECL and an ADDR_EXPR of a LABEL_DECL. */
4319 if (TREE_CODE (dest
) != LABEL_DECL
4320 && (!is_gimple_val (dest
)
4321 || !POINTER_TYPE_P (TREE_TYPE (dest
))))
4323 error ("goto destination is neither a label nor a pointer");
4330 /* Verify the contents of a GIMPLE_SWITCH STMT. Returns true when there
4331 is a problem, otherwise false. */
4334 verify_gimple_switch (gimple_switch stmt
)
4337 tree elt
, prev_upper_bound
= NULL_TREE
;
4338 tree index_type
, elt_type
= NULL_TREE
;
4340 if (!is_gimple_val (gimple_switch_index (stmt
)))
4342 error ("invalid operand to switch statement");
4343 debug_generic_stmt (gimple_switch_index (stmt
));
4347 index_type
= TREE_TYPE (gimple_switch_index (stmt
));
4348 if (! INTEGRAL_TYPE_P (index_type
))
4350 error ("non-integral type switch statement");
4351 debug_generic_expr (index_type
);
4355 elt
= gimple_switch_label (stmt
, 0);
4356 if (CASE_LOW (elt
) != NULL_TREE
|| CASE_HIGH (elt
) != NULL_TREE
)
4358 error ("invalid default case label in switch statement");
4359 debug_generic_expr (elt
);
4363 n
= gimple_switch_num_labels (stmt
);
4364 for (i
= 1; i
< n
; i
++)
4366 elt
= gimple_switch_label (stmt
, i
);
4368 if (! CASE_LOW (elt
))
4370 error ("invalid case label in switch statement");
4371 debug_generic_expr (elt
);
4375 && ! tree_int_cst_lt (CASE_LOW (elt
), CASE_HIGH (elt
)))
4377 error ("invalid case range in switch statement");
4378 debug_generic_expr (elt
);
4384 if (TREE_TYPE (CASE_LOW (elt
)) != elt_type
4385 || (CASE_HIGH (elt
) && TREE_TYPE (CASE_HIGH (elt
)) != elt_type
))
4387 error ("type mismatch for case label in switch statement");
4388 debug_generic_expr (elt
);
4394 elt_type
= TREE_TYPE (CASE_LOW (elt
));
4395 if (TYPE_PRECISION (index_type
) < TYPE_PRECISION (elt_type
))
4397 error ("type precision mismatch in switch statement");
4402 if (prev_upper_bound
)
4404 if (! tree_int_cst_lt (prev_upper_bound
, CASE_LOW (elt
)))
4406 error ("case labels not sorted in switch statement");
4411 prev_upper_bound
= CASE_HIGH (elt
);
4412 if (! prev_upper_bound
)
4413 prev_upper_bound
= CASE_LOW (elt
);
4419 /* Verify a gimple debug statement STMT.
4420 Returns true if anything is wrong. */
4423 verify_gimple_debug (gimple stmt ATTRIBUTE_UNUSED
)
4425 /* There isn't much that could be wrong in a gimple debug stmt. A
4426 gimple debug bind stmt, for example, maps a tree, that's usually
4427 a VAR_DECL or a PARM_DECL, but that could also be some scalarized
4428 component or member of an aggregate type, to another tree, that
4429 can be an arbitrary expression. These stmts expand into debug
4430 insns, and are converted to debug notes by var-tracking.c. */
4434 /* Verify a gimple label statement STMT.
4435 Returns true if anything is wrong. */
4438 verify_gimple_label (gimple_label stmt
)
4440 tree decl
= gimple_label_label (stmt
);
4444 if (TREE_CODE (decl
) != LABEL_DECL
)
4446 if (!DECL_NONLOCAL (decl
) && !FORCED_LABEL (decl
)
4447 && DECL_CONTEXT (decl
) != current_function_decl
)
4449 error ("label's context is not the current function decl");
4453 uid
= LABEL_DECL_UID (decl
);
4456 || (*label_to_block_map_for_fn (cfun
))[uid
] != gimple_bb (stmt
)))
4458 error ("incorrect entry in label_to_block_map");
4462 uid
= EH_LANDING_PAD_NR (decl
);
4465 eh_landing_pad lp
= get_eh_landing_pad_from_number (uid
);
4466 if (decl
!= lp
->post_landing_pad
)
4468 error ("incorrect setting of landing pad number");
4476 /* Verify the GIMPLE statement STMT. Returns true if there is an
4477 error, otherwise false. */
4480 verify_gimple_stmt (gimple stmt
)
4482 switch (gimple_code (stmt
))
4485 return verify_gimple_assign (as_a
<gimple_assign
> (stmt
));
4488 return verify_gimple_label (as_a
<gimple_label
> (stmt
));
4491 return verify_gimple_call (as_a
<gimple_call
> (stmt
));
4494 if (TREE_CODE_CLASS (gimple_cond_code (stmt
)) != tcc_comparison
)
4496 error ("invalid comparison code in gimple cond");
4499 if (!(!gimple_cond_true_label (stmt
)
4500 || TREE_CODE (gimple_cond_true_label (stmt
)) == LABEL_DECL
)
4501 || !(!gimple_cond_false_label (stmt
)
4502 || TREE_CODE (gimple_cond_false_label (stmt
)) == LABEL_DECL
))
4504 error ("invalid labels in gimple cond");
4508 return verify_gimple_comparison (boolean_type_node
,
4509 gimple_cond_lhs (stmt
),
4510 gimple_cond_rhs (stmt
));
4513 return verify_gimple_goto (as_a
<gimple_goto
> (stmt
));
4516 return verify_gimple_switch (as_a
<gimple_switch
> (stmt
));
4519 return verify_gimple_return (as_a
<gimple_return
> (stmt
));
4524 case GIMPLE_TRANSACTION
:
4525 return verify_gimple_transaction (as_a
<gimple_transaction
> (stmt
));
4527 /* Tuples that do not have tree operands. */
4529 case GIMPLE_PREDICT
:
4531 case GIMPLE_EH_DISPATCH
:
4532 case GIMPLE_EH_MUST_NOT_THROW
:
4536 /* OpenMP directives are validated by the FE and never operated
4537 on by the optimizers. Furthermore, GIMPLE_OMP_FOR may contain
4538 non-gimple expressions when the main index variable has had
4539 its address taken. This does not affect the loop itself
4540 because the header of an GIMPLE_OMP_FOR is merely used to determine
4541 how to setup the parallel iteration. */
4545 return verify_gimple_debug (stmt
);
4552 /* Verify the contents of a GIMPLE_PHI. Returns true if there is a problem,
4553 and false otherwise. */
4556 verify_gimple_phi (gimple phi
)
4560 tree phi_result
= gimple_phi_result (phi
);
4565 error ("invalid PHI result");
4569 virtual_p
= virtual_operand_p (phi_result
);
4570 if (TREE_CODE (phi_result
) != SSA_NAME
4572 && SSA_NAME_VAR (phi_result
) != gimple_vop (cfun
)))
4574 error ("invalid PHI result");
4578 for (i
= 0; i
< gimple_phi_num_args (phi
); i
++)
4580 tree t
= gimple_phi_arg_def (phi
, i
);
4584 error ("missing PHI def");
4588 /* Addressable variables do have SSA_NAMEs but they
4589 are not considered gimple values. */
4590 else if ((TREE_CODE (t
) == SSA_NAME
4591 && virtual_p
!= virtual_operand_p (t
))
4593 && (TREE_CODE (t
) != SSA_NAME
4594 || SSA_NAME_VAR (t
) != gimple_vop (cfun
)))
4596 && !is_gimple_val (t
)))
4598 error ("invalid PHI argument");
4599 debug_generic_expr (t
);
4602 #ifdef ENABLE_TYPES_CHECKING
4603 if (!useless_type_conversion_p (TREE_TYPE (phi_result
), TREE_TYPE (t
)))
4605 error ("incompatible types in PHI argument %u", i
);
4606 debug_generic_stmt (TREE_TYPE (phi_result
));
4607 debug_generic_stmt (TREE_TYPE (t
));
4616 /* Verify the GIMPLE statements inside the sequence STMTS. */
4619 verify_gimple_in_seq_2 (gimple_seq stmts
)
4621 gimple_stmt_iterator ittr
;
4624 for (ittr
= gsi_start (stmts
); !gsi_end_p (ittr
); gsi_next (&ittr
))
4626 gimple stmt
= gsi_stmt (ittr
);
4628 switch (gimple_code (stmt
))
4631 err
|= verify_gimple_in_seq_2 (
4632 gimple_bind_body (as_a
<gimple_bind
> (stmt
)));
4636 err
|= verify_gimple_in_seq_2 (gimple_try_eval (stmt
));
4637 err
|= verify_gimple_in_seq_2 (gimple_try_cleanup (stmt
));
4640 case GIMPLE_EH_FILTER
:
4641 err
|= verify_gimple_in_seq_2 (gimple_eh_filter_failure (stmt
));
4644 case GIMPLE_EH_ELSE
:
4646 gimple_eh_else eh_else
= as_a
<gimple_eh_else
> (stmt
);
4647 err
|= verify_gimple_in_seq_2 (gimple_eh_else_n_body (eh_else
));
4648 err
|= verify_gimple_in_seq_2 (gimple_eh_else_e_body (eh_else
));
4653 err
|= verify_gimple_in_seq_2 (gimple_catch_handler (
4654 as_a
<gimple_catch
> (stmt
)));
4657 case GIMPLE_TRANSACTION
:
4658 err
|= verify_gimple_transaction (as_a
<gimple_transaction
> (stmt
));
4663 bool err2
= verify_gimple_stmt (stmt
);
4665 debug_gimple_stmt (stmt
);
4674 /* Verify the contents of a GIMPLE_TRANSACTION. Returns true if there
4675 is a problem, otherwise false. */
4678 verify_gimple_transaction (gimple_transaction stmt
)
4680 tree lab
= gimple_transaction_label (stmt
);
4681 if (lab
!= NULL
&& TREE_CODE (lab
) != LABEL_DECL
)
4683 return verify_gimple_in_seq_2 (gimple_transaction_body (stmt
));
4687 /* Verify the GIMPLE statements inside the statement list STMTS. */
4690 verify_gimple_in_seq (gimple_seq stmts
)
4692 timevar_push (TV_TREE_STMT_VERIFY
);
4693 if (verify_gimple_in_seq_2 (stmts
))
4694 internal_error ("verify_gimple failed");
4695 timevar_pop (TV_TREE_STMT_VERIFY
);
4698 /* Return true when the T can be shared. */
4701 tree_node_can_be_shared (tree t
)
4703 if (IS_TYPE_OR_DECL_P (t
)
4704 || is_gimple_min_invariant (t
)
4705 || TREE_CODE (t
) == SSA_NAME
4706 || t
== error_mark_node
4707 || TREE_CODE (t
) == IDENTIFIER_NODE
)
4710 if (TREE_CODE (t
) == CASE_LABEL_EXPR
)
4719 /* Called via walk_tree. Verify tree sharing. */
4722 verify_node_sharing_1 (tree
*tp
, int *walk_subtrees
, void *data
)
4724 hash_set
<void *> *visited
= (hash_set
<void *> *) data
;
4726 if (tree_node_can_be_shared (*tp
))
4728 *walk_subtrees
= false;
4732 if (visited
->add (*tp
))
4738 /* Called via walk_gimple_stmt. Verify tree sharing. */
4741 verify_node_sharing (tree
*tp
, int *walk_subtrees
, void *data
)
4743 struct walk_stmt_info
*wi
= (struct walk_stmt_info
*) data
;
4744 return verify_node_sharing_1 (tp
, walk_subtrees
, wi
->info
);
4747 static bool eh_error_found
;
4749 verify_eh_throw_stmt_node (const gimple
&stmt
, const int &,
4750 hash_set
<gimple
> *visited
)
4752 if (!visited
->contains (stmt
))
4754 error ("dead STMT in EH table");
4755 debug_gimple_stmt (stmt
);
4756 eh_error_found
= true;
4761 /* Verify if the location LOCs block is in BLOCKS. */
4764 verify_location (hash_set
<tree
> *blocks
, location_t loc
)
4766 tree block
= LOCATION_BLOCK (loc
);
4767 if (block
!= NULL_TREE
4768 && !blocks
->contains (block
))
4770 error ("location references block not in block tree");
4773 if (block
!= NULL_TREE
)
4774 return verify_location (blocks
, BLOCK_SOURCE_LOCATION (block
));
4778 /* Called via walk_tree. Verify that expressions have no blocks. */
4781 verify_expr_no_block (tree
*tp
, int *walk_subtrees
, void *)
4785 *walk_subtrees
= false;
4789 location_t loc
= EXPR_LOCATION (*tp
);
4790 if (LOCATION_BLOCK (loc
) != NULL
)
4796 /* Called via walk_tree. Verify locations of expressions. */
4799 verify_expr_location_1 (tree
*tp
, int *walk_subtrees
, void *data
)
4801 hash_set
<tree
> *blocks
= (hash_set
<tree
> *) data
;
4803 if (TREE_CODE (*tp
) == VAR_DECL
4804 && DECL_HAS_DEBUG_EXPR_P (*tp
))
4806 tree t
= DECL_DEBUG_EXPR (*tp
);
4807 tree addr
= walk_tree (&t
, verify_expr_no_block
, NULL
, NULL
);
4811 if ((TREE_CODE (*tp
) == VAR_DECL
4812 || TREE_CODE (*tp
) == PARM_DECL
4813 || TREE_CODE (*tp
) == RESULT_DECL
)
4814 && DECL_HAS_VALUE_EXPR_P (*tp
))
4816 tree t
= DECL_VALUE_EXPR (*tp
);
4817 tree addr
= walk_tree (&t
, verify_expr_no_block
, NULL
, NULL
);
4824 *walk_subtrees
= false;
4828 location_t loc
= EXPR_LOCATION (*tp
);
4829 if (verify_location (blocks
, loc
))
4835 /* Called via walk_gimple_op. Verify locations of expressions. */
4838 verify_expr_location (tree
*tp
, int *walk_subtrees
, void *data
)
4840 struct walk_stmt_info
*wi
= (struct walk_stmt_info
*) data
;
4841 return verify_expr_location_1 (tp
, walk_subtrees
, wi
->info
);
4844 /* Insert all subblocks of BLOCK into BLOCKS and recurse. */
4847 collect_subblocks (hash_set
<tree
> *blocks
, tree block
)
4850 for (t
= BLOCK_SUBBLOCKS (block
); t
; t
= BLOCK_CHAIN (t
))
4853 collect_subblocks (blocks
, t
);
4857 /* Verify the GIMPLE statements in the CFG of FN. */
4860 verify_gimple_in_cfg (struct function
*fn
, bool verify_nothrow
)
4865 timevar_push (TV_TREE_STMT_VERIFY
);
4866 hash_set
<void *> visited
;
4867 hash_set
<gimple
> visited_stmts
;
4869 /* Collect all BLOCKs referenced by the BLOCK tree of FN. */
4870 hash_set
<tree
> blocks
;
4871 if (DECL_INITIAL (fn
->decl
))
4873 blocks
.add (DECL_INITIAL (fn
->decl
));
4874 collect_subblocks (&blocks
, DECL_INITIAL (fn
->decl
));
4877 FOR_EACH_BB_FN (bb
, fn
)
4879 gimple_stmt_iterator gsi
;
4881 for (gimple_phi_iterator gpi
= gsi_start_phis (bb
);
4885 gimple_phi phi
= gpi
.phi ();
4889 visited_stmts
.add (phi
);
4891 if (gimple_bb (phi
) != bb
)
4893 error ("gimple_bb (phi) is set to a wrong basic block");
4897 err2
|= verify_gimple_phi (phi
);
4899 /* Only PHI arguments have locations. */
4900 if (gimple_location (phi
) != UNKNOWN_LOCATION
)
4902 error ("PHI node with location");
4906 for (i
= 0; i
< gimple_phi_num_args (phi
); i
++)
4908 tree arg
= gimple_phi_arg_def (phi
, i
);
4909 tree addr
= walk_tree (&arg
, verify_node_sharing_1
,
4913 error ("incorrect sharing of tree nodes");
4914 debug_generic_expr (addr
);
4917 location_t loc
= gimple_phi_arg_location (phi
, i
);
4918 if (virtual_operand_p (gimple_phi_result (phi
))
4919 && loc
!= UNKNOWN_LOCATION
)
4921 error ("virtual PHI with argument locations");
4924 addr
= walk_tree (&arg
, verify_expr_location_1
, &blocks
, NULL
);
4927 debug_generic_expr (addr
);
4930 err2
|= verify_location (&blocks
, loc
);
4934 debug_gimple_stmt (phi
);
4938 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
4940 gimple stmt
= gsi_stmt (gsi
);
4942 struct walk_stmt_info wi
;
4946 visited_stmts
.add (stmt
);
4948 if (gimple_bb (stmt
) != bb
)
4950 error ("gimple_bb (stmt) is set to a wrong basic block");
4954 err2
|= verify_gimple_stmt (stmt
);
4955 err2
|= verify_location (&blocks
, gimple_location (stmt
));
4957 memset (&wi
, 0, sizeof (wi
));
4958 wi
.info
= (void *) &visited
;
4959 addr
= walk_gimple_op (stmt
, verify_node_sharing
, &wi
);
4962 error ("incorrect sharing of tree nodes");
4963 debug_generic_expr (addr
);
4967 memset (&wi
, 0, sizeof (wi
));
4968 wi
.info
= (void *) &blocks
;
4969 addr
= walk_gimple_op (stmt
, verify_expr_location
, &wi
);
4972 debug_generic_expr (addr
);
4976 /* ??? Instead of not checking these stmts at all the walker
4977 should know its context via wi. */
4978 if (!is_gimple_debug (stmt
)
4979 && !is_gimple_omp (stmt
))
4981 memset (&wi
, 0, sizeof (wi
));
4982 addr
= walk_gimple_op (stmt
, verify_expr
, &wi
);
4985 debug_generic_expr (addr
);
4986 inform (gimple_location (stmt
), "in statement");
4991 /* If the statement is marked as part of an EH region, then it is
4992 expected that the statement could throw. Verify that when we
4993 have optimizations that simplify statements such that we prove
4994 that they cannot throw, that we update other data structures
4996 lp_nr
= lookup_stmt_eh_lp (stmt
);
4999 if (!stmt_could_throw_p (stmt
))
5003 error ("statement marked for throw, but doesn%'t");
5007 else if (!gsi_one_before_end_p (gsi
))
5009 error ("statement marked for throw in middle of block");
5015 debug_gimple_stmt (stmt
);
5020 eh_error_found
= false;
5021 hash_map
<gimple
, int> *eh_table
= get_eh_throw_stmt_table (cfun
);
5023 eh_table
->traverse
<hash_set
<gimple
> *, verify_eh_throw_stmt_node
>
5026 if (err
|| eh_error_found
)
5027 internal_error ("verify_gimple failed");
5029 verify_histograms ();
5030 timevar_pop (TV_TREE_STMT_VERIFY
);
5034 /* Verifies that the flow information is OK. */
5037 gimple_verify_flow_info (void)
5041 gimple_stmt_iterator gsi
;
5046 if (ENTRY_BLOCK_PTR_FOR_FN (cfun
)->il
.gimple
.seq
5047 || ENTRY_BLOCK_PTR_FOR_FN (cfun
)->il
.gimple
.phi_nodes
)
5049 error ("ENTRY_BLOCK has IL associated with it");
5053 if (EXIT_BLOCK_PTR_FOR_FN (cfun
)->il
.gimple
.seq
5054 || EXIT_BLOCK_PTR_FOR_FN (cfun
)->il
.gimple
.phi_nodes
)
5056 error ("EXIT_BLOCK has IL associated with it");
5060 FOR_EACH_EDGE (e
, ei
, EXIT_BLOCK_PTR_FOR_FN (cfun
)->preds
)
5061 if (e
->flags
& EDGE_FALLTHRU
)
5063 error ("fallthru to exit from bb %d", e
->src
->index
);
5067 FOR_EACH_BB_FN (bb
, cfun
)
5069 bool found_ctrl_stmt
= false;
5073 /* Skip labels on the start of basic block. */
5074 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
5077 gimple prev_stmt
= stmt
;
5079 stmt
= gsi_stmt (gsi
);
5081 if (gimple_code (stmt
) != GIMPLE_LABEL
)
5084 label
= gimple_label_label (stmt
);
5085 if (prev_stmt
&& DECL_NONLOCAL (label
))
5087 error ("nonlocal label ");
5088 print_generic_expr (stderr
, label
, 0);
5089 fprintf (stderr
, " is not first in a sequence of labels in bb %d",
5094 if (prev_stmt
&& EH_LANDING_PAD_NR (label
) != 0)
5096 error ("EH landing pad label ");
5097 print_generic_expr (stderr
, label
, 0);
5098 fprintf (stderr
, " is not first in a sequence of labels in bb %d",
5103 if (label_to_block (label
) != bb
)
5106 print_generic_expr (stderr
, label
, 0);
5107 fprintf (stderr
, " to block does not match in bb %d",
5112 if (decl_function_context (label
) != current_function_decl
)
5115 print_generic_expr (stderr
, label
, 0);
5116 fprintf (stderr
, " has incorrect context in bb %d",
5122 /* Verify that body of basic block BB is free of control flow. */
5123 for (; !gsi_end_p (gsi
); gsi_next (&gsi
))
5125 gimple stmt
= gsi_stmt (gsi
);
5127 if (found_ctrl_stmt
)
5129 error ("control flow in the middle of basic block %d",
5134 if (stmt_ends_bb_p (stmt
))
5135 found_ctrl_stmt
= true;
5137 if (gimple_code (stmt
) == GIMPLE_LABEL
)
5140 print_generic_expr (stderr
, gimple_label_label (stmt
), 0);
5141 fprintf (stderr
, " in the middle of basic block %d", bb
->index
);
5146 gsi
= gsi_last_bb (bb
);
5147 if (gsi_end_p (gsi
))
5150 stmt
= gsi_stmt (gsi
);
5152 if (gimple_code (stmt
) == GIMPLE_LABEL
)
5155 err
|= verify_eh_edges (stmt
);
5157 if (is_ctrl_stmt (stmt
))
5159 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
5160 if (e
->flags
& EDGE_FALLTHRU
)
5162 error ("fallthru edge after a control statement in bb %d",
5168 if (gimple_code (stmt
) != GIMPLE_COND
)
5170 /* Verify that there are no edges with EDGE_TRUE/FALSE_FLAG set
5171 after anything else but if statement. */
5172 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
5173 if (e
->flags
& (EDGE_TRUE_VALUE
| EDGE_FALSE_VALUE
))
5175 error ("true/false edge after a non-GIMPLE_COND in bb %d",
5181 switch (gimple_code (stmt
))
5188 extract_true_false_edges_from_block (bb
, &true_edge
, &false_edge
);
5192 || !(true_edge
->flags
& EDGE_TRUE_VALUE
)
5193 || !(false_edge
->flags
& EDGE_FALSE_VALUE
)
5194 || (true_edge
->flags
& (EDGE_FALLTHRU
| EDGE_ABNORMAL
))
5195 || (false_edge
->flags
& (EDGE_FALLTHRU
| EDGE_ABNORMAL
))
5196 || EDGE_COUNT (bb
->succs
) >= 3)
5198 error ("wrong outgoing edge flags at end of bb %d",
5206 if (simple_goto_p (stmt
))
5208 error ("explicit goto at end of bb %d", bb
->index
);
5213 /* FIXME. We should double check that the labels in the
5214 destination blocks have their address taken. */
5215 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
5216 if ((e
->flags
& (EDGE_FALLTHRU
| EDGE_TRUE_VALUE
5217 | EDGE_FALSE_VALUE
))
5218 || !(e
->flags
& EDGE_ABNORMAL
))
5220 error ("wrong outgoing edge flags at end of bb %d",
5228 if (!gimple_call_builtin_p (stmt
, BUILT_IN_RETURN
))
5230 /* ... fallthru ... */
5232 if (!single_succ_p (bb
)
5233 || (single_succ_edge (bb
)->flags
5234 & (EDGE_FALLTHRU
| EDGE_ABNORMAL
5235 | EDGE_TRUE_VALUE
| EDGE_FALSE_VALUE
)))
5237 error ("wrong outgoing edge flags at end of bb %d", bb
->index
);
5240 if (single_succ (bb
) != EXIT_BLOCK_PTR_FOR_FN (cfun
))
5242 error ("return edge does not point to exit in bb %d",
5250 gimple_switch switch_stmt
= as_a
<gimple_switch
> (stmt
);
5255 n
= gimple_switch_num_labels (switch_stmt
);
5257 /* Mark all the destination basic blocks. */
5258 for (i
= 0; i
< n
; ++i
)
5260 tree lab
= CASE_LABEL (gimple_switch_label (switch_stmt
, i
));
5261 basic_block label_bb
= label_to_block (lab
);
5262 gcc_assert (!label_bb
->aux
|| label_bb
->aux
== (void *)1);
5263 label_bb
->aux
= (void *)1;
5266 /* Verify that the case labels are sorted. */
5267 prev
= gimple_switch_label (switch_stmt
, 0);
5268 for (i
= 1; i
< n
; ++i
)
5270 tree c
= gimple_switch_label (switch_stmt
, i
);
5273 error ("found default case not at the start of "
5279 && !tree_int_cst_lt (CASE_LOW (prev
), CASE_LOW (c
)))
5281 error ("case labels not sorted: ");
5282 print_generic_expr (stderr
, prev
, 0);
5283 fprintf (stderr
," is greater than ");
5284 print_generic_expr (stderr
, c
, 0);
5285 fprintf (stderr
," but comes before it.\n");
5290 /* VRP will remove the default case if it can prove it will
5291 never be executed. So do not verify there always exists
5292 a default case here. */
5294 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
5298 error ("extra outgoing edge %d->%d",
5299 bb
->index
, e
->dest
->index
);
5303 e
->dest
->aux
= (void *)2;
5304 if ((e
->flags
& (EDGE_FALLTHRU
| EDGE_ABNORMAL
5305 | EDGE_TRUE_VALUE
| EDGE_FALSE_VALUE
)))
5307 error ("wrong outgoing edge flags at end of bb %d",
5313 /* Check that we have all of them. */
5314 for (i
= 0; i
< n
; ++i
)
5316 tree lab
= CASE_LABEL (gimple_switch_label (switch_stmt
, i
));
5317 basic_block label_bb
= label_to_block (lab
);
5319 if (label_bb
->aux
!= (void *)2)
5321 error ("missing edge %i->%i", bb
->index
, label_bb
->index
);
5326 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
5327 e
->dest
->aux
= (void *)0;
5331 case GIMPLE_EH_DISPATCH
:
5332 err
|= verify_eh_dispatch_edge (as_a
<gimple_eh_dispatch
> (stmt
));
5340 if (dom_info_state (CDI_DOMINATORS
) >= DOM_NO_FAST_QUERY
)
5341 verify_dominators (CDI_DOMINATORS
);
5347 /* Updates phi nodes after creating a forwarder block joined
5348 by edge FALLTHRU. */
5351 gimple_make_forwarder_block (edge fallthru
)
5355 basic_block dummy
, bb
;
5357 gimple_phi_iterator gsi
;
5359 dummy
= fallthru
->src
;
5360 bb
= fallthru
->dest
;
5362 if (single_pred_p (bb
))
5365 /* If we redirected a branch we must create new PHI nodes at the
5367 for (gsi
= gsi_start_phis (dummy
); !gsi_end_p (gsi
); gsi_next (&gsi
))
5369 gimple_phi phi
, new_phi
;
5372 var
= gimple_phi_result (phi
);
5373 new_phi
= create_phi_node (var
, bb
);
5374 gimple_phi_set_result (phi
, copy_ssa_name (var
, phi
));
5375 add_phi_arg (new_phi
, gimple_phi_result (phi
), fallthru
,
5379 /* Add the arguments we have stored on edges. */
5380 FOR_EACH_EDGE (e
, ei
, bb
->preds
)
5385 flush_pending_stmts (e
);
5390 /* Return a non-special label in the head of basic block BLOCK.
5391 Create one if it doesn't exist. */
5394 gimple_block_label (basic_block bb
)
5396 gimple_stmt_iterator i
, s
= gsi_start_bb (bb
);
5401 for (i
= s
; !gsi_end_p (i
); first
= false, gsi_next (&i
))
5403 stmt
= gsi_stmt (i
);
5404 if (gimple_code (stmt
) != GIMPLE_LABEL
)
5406 label
= gimple_label_label (stmt
);
5407 if (!DECL_NONLOCAL (label
))
5410 gsi_move_before (&i
, &s
);
5415 label
= create_artificial_label (UNKNOWN_LOCATION
);
5416 stmt
= gimple_build_label (label
);
5417 gsi_insert_before (&s
, stmt
, GSI_NEW_STMT
);
5422 /* Attempt to perform edge redirection by replacing a possibly complex
5423 jump instruction by a goto or by removing the jump completely.
5424 This can apply only if all edges now point to the same block. The
5425 parameters and return values are equivalent to
5426 redirect_edge_and_branch. */
5429 gimple_try_redirect_by_replacing_jump (edge e
, basic_block target
)
5431 basic_block src
= e
->src
;
5432 gimple_stmt_iterator i
;
5435 /* We can replace or remove a complex jump only when we have exactly
5437 if (EDGE_COUNT (src
->succs
) != 2
5438 /* Verify that all targets will be TARGET. Specifically, the
5439 edge that is not E must also go to TARGET. */
5440 || EDGE_SUCC (src
, EDGE_SUCC (src
, 0) == e
)->dest
!= target
)
5443 i
= gsi_last_bb (src
);
5447 stmt
= gsi_stmt (i
);
5449 if (gimple_code (stmt
) == GIMPLE_COND
|| gimple_code (stmt
) == GIMPLE_SWITCH
)
5451 gsi_remove (&i
, true);
5452 e
= ssa_redirect_edge (e
, target
);
5453 e
->flags
= EDGE_FALLTHRU
;
5461 /* Redirect E to DEST. Return NULL on failure. Otherwise, return the
5462 edge representing the redirected branch. */
5465 gimple_redirect_edge_and_branch (edge e
, basic_block dest
)
5467 basic_block bb
= e
->src
;
5468 gimple_stmt_iterator gsi
;
5472 if (e
->flags
& EDGE_ABNORMAL
)
5475 if (e
->dest
== dest
)
5478 if (e
->flags
& EDGE_EH
)
5479 return redirect_eh_edge (e
, dest
);
5481 if (e
->src
!= ENTRY_BLOCK_PTR_FOR_FN (cfun
))
5483 ret
= gimple_try_redirect_by_replacing_jump (e
, dest
);
5488 gsi
= gsi_last_bb (bb
);
5489 stmt
= gsi_end_p (gsi
) ? NULL
: gsi_stmt (gsi
);
5491 switch (stmt
? gimple_code (stmt
) : GIMPLE_ERROR_MARK
)
5494 /* For COND_EXPR, we only need to redirect the edge. */
5498 /* No non-abnormal edges should lead from a non-simple goto, and
5499 simple ones should be represented implicitly. */
5504 gimple_switch switch_stmt
= as_a
<gimple_switch
> (stmt
);
5505 tree label
= gimple_block_label (dest
);
5506 tree cases
= get_cases_for_edge (e
, switch_stmt
);
5508 /* If we have a list of cases associated with E, then use it
5509 as it's a lot faster than walking the entire case vector. */
5512 edge e2
= find_edge (e
->src
, dest
);
5519 CASE_LABEL (cases
) = label
;
5520 cases
= CASE_CHAIN (cases
);
5523 /* If there was already an edge in the CFG, then we need
5524 to move all the cases associated with E to E2. */
5527 tree cases2
= get_cases_for_edge (e2
, switch_stmt
);
5529 CASE_CHAIN (last
) = CASE_CHAIN (cases2
);
5530 CASE_CHAIN (cases2
) = first
;
5532 bitmap_set_bit (touched_switch_bbs
, gimple_bb (stmt
)->index
);
5536 size_t i
, n
= gimple_switch_num_labels (switch_stmt
);
5538 for (i
= 0; i
< n
; i
++)
5540 tree elt
= gimple_switch_label (switch_stmt
, i
);
5541 if (label_to_block (CASE_LABEL (elt
)) == e
->dest
)
5542 CASE_LABEL (elt
) = label
;
5550 gimple_asm asm_stmt
= as_a
<gimple_asm
> (stmt
);
5551 int i
, n
= gimple_asm_nlabels (asm_stmt
);
5554 for (i
= 0; i
< n
; ++i
)
5556 tree cons
= gimple_asm_label_op (asm_stmt
, i
);
5557 if (label_to_block (TREE_VALUE (cons
)) == e
->dest
)
5560 label
= gimple_block_label (dest
);
5561 TREE_VALUE (cons
) = label
;
5565 /* If we didn't find any label matching the former edge in the
5566 asm labels, we must be redirecting the fallthrough
5568 gcc_assert (label
|| (e
->flags
& EDGE_FALLTHRU
));
5573 gsi_remove (&gsi
, true);
5574 e
->flags
|= EDGE_FALLTHRU
;
5577 case GIMPLE_OMP_RETURN
:
5578 case GIMPLE_OMP_CONTINUE
:
5579 case GIMPLE_OMP_SECTIONS_SWITCH
:
5580 case GIMPLE_OMP_FOR
:
5581 /* The edges from OMP constructs can be simply redirected. */
5584 case GIMPLE_EH_DISPATCH
:
5585 if (!(e
->flags
& EDGE_FALLTHRU
))
5586 redirect_eh_dispatch_edge (as_a
<gimple_eh_dispatch
> (stmt
), e
, dest
);
5589 case GIMPLE_TRANSACTION
:
5590 /* The ABORT edge has a stored label associated with it, otherwise
5591 the edges are simply redirectable. */
5593 gimple_transaction_set_label (as_a
<gimple_transaction
> (stmt
),
5594 gimple_block_label (dest
));
5598 /* Otherwise it must be a fallthru edge, and we don't need to
5599 do anything besides redirecting it. */
5600 gcc_assert (e
->flags
& EDGE_FALLTHRU
);
5604 /* Update/insert PHI nodes as necessary. */
5606 /* Now update the edges in the CFG. */
5607 e
= ssa_redirect_edge (e
, dest
);
5612 /* Returns true if it is possible to remove edge E by redirecting
5613 it to the destination of the other edge from E->src. */
5616 gimple_can_remove_branch_p (const_edge e
)
5618 if (e
->flags
& (EDGE_ABNORMAL
| EDGE_EH
))
5624 /* Simple wrapper, as we can always redirect fallthru edges. */
5627 gimple_redirect_edge_and_branch_force (edge e
, basic_block dest
)
5629 e
= gimple_redirect_edge_and_branch (e
, dest
);
5636 /* Splits basic block BB after statement STMT (but at least after the
5637 labels). If STMT is NULL, BB is split just after the labels. */
5640 gimple_split_block (basic_block bb
, void *stmt
)
5642 gimple_stmt_iterator gsi
;
5643 gimple_stmt_iterator gsi_tgt
;
5650 new_bb
= create_empty_bb (bb
);
5652 /* Redirect the outgoing edges. */
5653 new_bb
->succs
= bb
->succs
;
5655 FOR_EACH_EDGE (e
, ei
, new_bb
->succs
)
5658 if (stmt
&& gimple_code ((gimple
) stmt
) == GIMPLE_LABEL
)
5661 /* Move everything from GSI to the new basic block. */
5662 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
5664 act
= gsi_stmt (gsi
);
5665 if (gimple_code (act
) == GIMPLE_LABEL
)
5678 if (gsi_end_p (gsi
))
5681 /* Split the statement list - avoid re-creating new containers as this
5682 brings ugly quadratic memory consumption in the inliner.
5683 (We are still quadratic since we need to update stmt BB pointers,
5685 gsi_split_seq_before (&gsi
, &list
);
5686 set_bb_seq (new_bb
, list
);
5687 for (gsi_tgt
= gsi_start (list
);
5688 !gsi_end_p (gsi_tgt
); gsi_next (&gsi_tgt
))
5689 gimple_set_bb (gsi_stmt (gsi_tgt
), new_bb
);
5695 /* Moves basic block BB after block AFTER. */
5698 gimple_move_block_after (basic_block bb
, basic_block after
)
5700 if (bb
->prev_bb
== after
)
5704 link_block (bb
, after
);
5710 /* Return TRUE if block BB has no executable statements, otherwise return
5714 gimple_empty_block_p (basic_block bb
)
5716 /* BB must have no executable statements. */
5717 gimple_stmt_iterator gsi
= gsi_after_labels (bb
);
5720 if (gsi_end_p (gsi
))
5722 if (is_gimple_debug (gsi_stmt (gsi
)))
5723 gsi_next_nondebug (&gsi
);
5724 return gsi_end_p (gsi
);
5728 /* Split a basic block if it ends with a conditional branch and if the
5729 other part of the block is not empty. */
5732 gimple_split_block_before_cond_jump (basic_block bb
)
5734 gimple last
, split_point
;
5735 gimple_stmt_iterator gsi
= gsi_last_nondebug_bb (bb
);
5736 if (gsi_end_p (gsi
))
5738 last
= gsi_stmt (gsi
);
5739 if (gimple_code (last
) != GIMPLE_COND
5740 && gimple_code (last
) != GIMPLE_SWITCH
)
5742 gsi_prev_nondebug (&gsi
);
5743 split_point
= gsi_stmt (gsi
);
5744 return split_block (bb
, split_point
)->dest
;
5748 /* Return true if basic_block can be duplicated. */
5751 gimple_can_duplicate_bb_p (const_basic_block bb ATTRIBUTE_UNUSED
)
5756 /* Create a duplicate of the basic block BB. NOTE: This does not
5757 preserve SSA form. */
5760 gimple_duplicate_bb (basic_block bb
)
5763 gimple_stmt_iterator gsi_tgt
;
5765 new_bb
= create_empty_bb (EXIT_BLOCK_PTR_FOR_FN (cfun
)->prev_bb
);
5767 /* Copy the PHI nodes. We ignore PHI node arguments here because
5768 the incoming edges have not been setup yet. */
5769 for (gimple_phi_iterator gpi
= gsi_start_phis (bb
);
5773 gimple_phi phi
, copy
;
5775 copy
= create_phi_node (NULL_TREE
, new_bb
);
5776 create_new_def_for (gimple_phi_result (phi
), copy
,
5777 gimple_phi_result_ptr (copy
));
5778 gimple_set_uid (copy
, gimple_uid (phi
));
5781 gsi_tgt
= gsi_start_bb (new_bb
);
5782 for (gimple_stmt_iterator gsi
= gsi_start_bb (bb
);
5786 def_operand_p def_p
;
5787 ssa_op_iter op_iter
;
5791 stmt
= gsi_stmt (gsi
);
5792 if (gimple_code (stmt
) == GIMPLE_LABEL
)
5795 /* Don't duplicate label debug stmts. */
5796 if (gimple_debug_bind_p (stmt
)
5797 && TREE_CODE (gimple_debug_bind_get_var (stmt
))
5801 /* Create a new copy of STMT and duplicate STMT's virtual
5803 copy
= gimple_copy (stmt
);
5804 gsi_insert_after (&gsi_tgt
, copy
, GSI_NEW_STMT
);
5806 maybe_duplicate_eh_stmt (copy
, stmt
);
5807 gimple_duplicate_stmt_histograms (cfun
, copy
, cfun
, stmt
);
5809 /* When copying around a stmt writing into a local non-user
5810 aggregate, make sure it won't share stack slot with other
5812 lhs
= gimple_get_lhs (stmt
);
5813 if (lhs
&& TREE_CODE (lhs
) != SSA_NAME
)
5815 tree base
= get_base_address (lhs
);
5817 && (TREE_CODE (base
) == VAR_DECL
5818 || TREE_CODE (base
) == RESULT_DECL
)
5819 && DECL_IGNORED_P (base
)
5820 && !TREE_STATIC (base
)
5821 && !DECL_EXTERNAL (base
)
5822 && (TREE_CODE (base
) != VAR_DECL
5823 || !DECL_HAS_VALUE_EXPR_P (base
)))
5824 DECL_NONSHAREABLE (base
) = 1;
5827 /* Create new names for all the definitions created by COPY and
5828 add replacement mappings for each new name. */
5829 FOR_EACH_SSA_DEF_OPERAND (def_p
, copy
, op_iter
, SSA_OP_ALL_DEFS
)
5830 create_new_def_for (DEF_FROM_PTR (def_p
), copy
, def_p
);
5836 /* Adds phi node arguments for edge E_COPY after basic block duplication. */
5839 add_phi_args_after_copy_edge (edge e_copy
)
5841 basic_block bb
, bb_copy
= e_copy
->src
, dest
;
5844 gimple_phi phi
, phi_copy
;
5846 gimple_phi_iterator psi
, psi_copy
;
5848 if (gimple_seq_empty_p (phi_nodes (e_copy
->dest
)))
5851 bb
= bb_copy
->flags
& BB_DUPLICATED
? get_bb_original (bb_copy
) : bb_copy
;
5853 if (e_copy
->dest
->flags
& BB_DUPLICATED
)
5854 dest
= get_bb_original (e_copy
->dest
);
5856 dest
= e_copy
->dest
;
5858 e
= find_edge (bb
, dest
);
5861 /* During loop unrolling the target of the latch edge is copied.
5862 In this case we are not looking for edge to dest, but to
5863 duplicated block whose original was dest. */
5864 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
5866 if ((e
->dest
->flags
& BB_DUPLICATED
)
5867 && get_bb_original (e
->dest
) == dest
)
5871 gcc_assert (e
!= NULL
);
5874 for (psi
= gsi_start_phis (e
->dest
),
5875 psi_copy
= gsi_start_phis (e_copy
->dest
);
5877 gsi_next (&psi
), gsi_next (&psi_copy
))
5880 phi_copy
= psi_copy
.phi ();
5881 def
= PHI_ARG_DEF_FROM_EDGE (phi
, e
);
5882 add_phi_arg (phi_copy
, def
, e_copy
,
5883 gimple_phi_arg_location_from_edge (phi
, e
));
5888 /* Basic block BB_COPY was created by code duplication. Add phi node
5889 arguments for edges going out of BB_COPY. The blocks that were
5890 duplicated have BB_DUPLICATED set. */
5893 add_phi_args_after_copy_bb (basic_block bb_copy
)
5898 FOR_EACH_EDGE (e_copy
, ei
, bb_copy
->succs
)
5900 add_phi_args_after_copy_edge (e_copy
);
5904 /* Blocks in REGION_COPY array of length N_REGION were created by
5905 duplication of basic blocks. Add phi node arguments for edges
5906 going from these blocks. If E_COPY is not NULL, also add
5907 phi node arguments for its destination.*/
5910 add_phi_args_after_copy (basic_block
*region_copy
, unsigned n_region
,
5915 for (i
= 0; i
< n_region
; i
++)
5916 region_copy
[i
]->flags
|= BB_DUPLICATED
;
5918 for (i
= 0; i
< n_region
; i
++)
5919 add_phi_args_after_copy_bb (region_copy
[i
]);
5921 add_phi_args_after_copy_edge (e_copy
);
5923 for (i
= 0; i
< n_region
; i
++)
5924 region_copy
[i
]->flags
&= ~BB_DUPLICATED
;
5927 /* Duplicates a REGION (set of N_REGION basic blocks) with just a single
5928 important exit edge EXIT. By important we mean that no SSA name defined
5929 inside region is live over the other exit edges of the region. All entry
5930 edges to the region must go to ENTRY->dest. The edge ENTRY is redirected
5931 to the duplicate of the region. Dominance and loop information is
5932 updated if UPDATE_DOMINANCE is true, but not the SSA web. If
5933 UPDATE_DOMINANCE is false then we assume that the caller will update the
5934 dominance information after calling this function. The new basic
5935 blocks are stored to REGION_COPY in the same order as they had in REGION,
5936 provided that REGION_COPY is not NULL.
5937 The function returns false if it is unable to copy the region,
5941 gimple_duplicate_sese_region (edge entry
, edge exit
,
5942 basic_block
*region
, unsigned n_region
,
5943 basic_block
*region_copy
,
5944 bool update_dominance
)
5947 bool free_region_copy
= false, copying_header
= false;
5948 struct loop
*loop
= entry
->dest
->loop_father
;
5950 vec
<basic_block
> doms
;
5952 int total_freq
= 0, entry_freq
= 0;
5953 gcov_type total_count
= 0, entry_count
= 0;
5955 if (!can_copy_bbs_p (region
, n_region
))
5958 /* Some sanity checking. Note that we do not check for all possible
5959 missuses of the functions. I.e. if you ask to copy something weird,
5960 it will work, but the state of structures probably will not be
5962 for (i
= 0; i
< n_region
; i
++)
5964 /* We do not handle subloops, i.e. all the blocks must belong to the
5966 if (region
[i
]->loop_father
!= loop
)
5969 if (region
[i
] != entry
->dest
5970 && region
[i
] == loop
->header
)
5974 /* In case the function is used for loop header copying (which is the primary
5975 use), ensure that EXIT and its copy will be new latch and entry edges. */
5976 if (loop
->header
== entry
->dest
)
5978 copying_header
= true;
5980 if (!dominated_by_p (CDI_DOMINATORS
, loop
->latch
, exit
->src
))
5983 for (i
= 0; i
< n_region
; i
++)
5984 if (region
[i
] != exit
->src
5985 && dominated_by_p (CDI_DOMINATORS
, region
[i
], exit
->src
))
5989 initialize_original_copy_tables ();
5992 set_loop_copy (loop
, loop_outer (loop
));
5994 set_loop_copy (loop
, loop
);
5998 region_copy
= XNEWVEC (basic_block
, n_region
);
5999 free_region_copy
= true;
6002 /* Record blocks outside the region that are dominated by something
6004 if (update_dominance
)
6007 doms
= get_dominated_by_region (CDI_DOMINATORS
, region
, n_region
);
6010 if (entry
->dest
->count
)
6012 total_count
= entry
->dest
->count
;
6013 entry_count
= entry
->count
;
6014 /* Fix up corner cases, to avoid division by zero or creation of negative
6016 if (entry_count
> total_count
)
6017 entry_count
= total_count
;
6021 total_freq
= entry
->dest
->frequency
;
6022 entry_freq
= EDGE_FREQUENCY (entry
);
6023 /* Fix up corner cases, to avoid division by zero or creation of negative
6025 if (total_freq
== 0)
6027 else if (entry_freq
> total_freq
)
6028 entry_freq
= total_freq
;
6031 copy_bbs (region
, n_region
, region_copy
, &exit
, 1, &exit_copy
, loop
,
6032 split_edge_bb_loc (entry
), update_dominance
);
6035 scale_bbs_frequencies_gcov_type (region
, n_region
,
6036 total_count
- entry_count
,
6038 scale_bbs_frequencies_gcov_type (region_copy
, n_region
, entry_count
,
6043 scale_bbs_frequencies_int (region
, n_region
, total_freq
- entry_freq
,
6045 scale_bbs_frequencies_int (region_copy
, n_region
, entry_freq
, total_freq
);
6050 loop
->header
= exit
->dest
;
6051 loop
->latch
= exit
->src
;
6054 /* Redirect the entry and add the phi node arguments. */
6055 redirected
= redirect_edge_and_branch (entry
, get_bb_copy (entry
->dest
));
6056 gcc_assert (redirected
!= NULL
);
6057 flush_pending_stmts (entry
);
6059 /* Concerning updating of dominators: We must recount dominators
6060 for entry block and its copy. Anything that is outside of the
6061 region, but was dominated by something inside needs recounting as
6063 if (update_dominance
)
6065 set_immediate_dominator (CDI_DOMINATORS
, entry
->dest
, entry
->src
);
6066 doms
.safe_push (get_bb_original (entry
->dest
));
6067 iterate_fix_dominators (CDI_DOMINATORS
, doms
, false);
6071 /* Add the other PHI node arguments. */
6072 add_phi_args_after_copy (region_copy
, n_region
, NULL
);
6074 if (free_region_copy
)
6077 free_original_copy_tables ();
6081 /* Checks if BB is part of the region defined by N_REGION BBS. */
6083 bb_part_of_region_p (basic_block bb
, basic_block
* bbs
, unsigned n_region
)
6087 for (n
= 0; n
< n_region
; n
++)
6095 /* Duplicates REGION consisting of N_REGION blocks. The new blocks
6096 are stored to REGION_COPY in the same order in that they appear
6097 in REGION, if REGION_COPY is not NULL. ENTRY is the entry to
6098 the region, EXIT an exit from it. The condition guarding EXIT
6099 is moved to ENTRY. Returns true if duplication succeeds, false
6125 gimple_duplicate_sese_tail (edge entry ATTRIBUTE_UNUSED
, edge exit ATTRIBUTE_UNUSED
,
6126 basic_block
*region ATTRIBUTE_UNUSED
, unsigned n_region ATTRIBUTE_UNUSED
,
6127 basic_block
*region_copy ATTRIBUTE_UNUSED
)
6130 bool free_region_copy
= false;
6131 struct loop
*loop
= exit
->dest
->loop_father
;
6132 struct loop
*orig_loop
= entry
->dest
->loop_father
;
6133 basic_block switch_bb
, entry_bb
, nentry_bb
;
6134 vec
<basic_block
> doms
;
6135 int total_freq
= 0, exit_freq
= 0;
6136 gcov_type total_count
= 0, exit_count
= 0;
6137 edge exits
[2], nexits
[2], e
;
6138 gimple_stmt_iterator gsi
;
6141 basic_block exit_bb
;
6142 gimple_phi_iterator psi
;
6145 struct loop
*target
, *aloop
, *cloop
;
6147 gcc_assert (EDGE_COUNT (exit
->src
->succs
) == 2);
6149 exits
[1] = EDGE_SUCC (exit
->src
, EDGE_SUCC (exit
->src
, 0) == exit
);
6151 if (!can_copy_bbs_p (region
, n_region
))
6154 initialize_original_copy_tables ();
6155 set_loop_copy (orig_loop
, loop
);
6158 for (aloop
= orig_loop
->inner
; aloop
; aloop
= aloop
->next
)
6160 if (bb_part_of_region_p (aloop
->header
, region
, n_region
))
6162 cloop
= duplicate_loop (aloop
, target
);
6163 duplicate_subloops (aloop
, cloop
);
6169 region_copy
= XNEWVEC (basic_block
, n_region
);
6170 free_region_copy
= true;
6173 gcc_assert (!need_ssa_update_p (cfun
));
6175 /* Record blocks outside the region that are dominated by something
6177 doms
= get_dominated_by_region (CDI_DOMINATORS
, region
, n_region
);
6179 if (exit
->src
->count
)
6181 total_count
= exit
->src
->count
;
6182 exit_count
= exit
->count
;
6183 /* Fix up corner cases, to avoid division by zero or creation of negative
6185 if (exit_count
> total_count
)
6186 exit_count
= total_count
;
6190 total_freq
= exit
->src
->frequency
;
6191 exit_freq
= EDGE_FREQUENCY (exit
);
6192 /* Fix up corner cases, to avoid division by zero or creation of negative
6194 if (total_freq
== 0)
6196 if (exit_freq
> total_freq
)
6197 exit_freq
= total_freq
;
6200 copy_bbs (region
, n_region
, region_copy
, exits
, 2, nexits
, orig_loop
,
6201 split_edge_bb_loc (exit
), true);
6204 scale_bbs_frequencies_gcov_type (region
, n_region
,
6205 total_count
- exit_count
,
6207 scale_bbs_frequencies_gcov_type (region_copy
, n_region
, exit_count
,
6212 scale_bbs_frequencies_int (region
, n_region
, total_freq
- exit_freq
,
6214 scale_bbs_frequencies_int (region_copy
, n_region
, exit_freq
, total_freq
);
6217 /* Create the switch block, and put the exit condition to it. */
6218 entry_bb
= entry
->dest
;
6219 nentry_bb
= get_bb_copy (entry_bb
);
6220 if (!last_stmt (entry
->src
)
6221 || !stmt_ends_bb_p (last_stmt (entry
->src
)))
6222 switch_bb
= entry
->src
;
6224 switch_bb
= split_edge (entry
);
6225 set_immediate_dominator (CDI_DOMINATORS
, nentry_bb
, switch_bb
);
6227 gsi
= gsi_last_bb (switch_bb
);
6228 cond_stmt
= last_stmt (exit
->src
);
6229 gcc_assert (gimple_code (cond_stmt
) == GIMPLE_COND
);
6230 cond_stmt
= gimple_copy (cond_stmt
);
6232 gsi_insert_after (&gsi
, cond_stmt
, GSI_NEW_STMT
);
6234 sorig
= single_succ_edge (switch_bb
);
6235 sorig
->flags
= exits
[1]->flags
;
6236 snew
= make_edge (switch_bb
, nentry_bb
, exits
[0]->flags
);
6238 /* Register the new edge from SWITCH_BB in loop exit lists. */
6239 rescan_loop_exit (snew
, true, false);
6241 /* Add the PHI node arguments. */
6242 add_phi_args_after_copy (region_copy
, n_region
, snew
);
6244 /* Get rid of now superfluous conditions and associated edges (and phi node
6246 exit_bb
= exit
->dest
;
6248 e
= redirect_edge_and_branch (exits
[0], exits
[1]->dest
);
6249 PENDING_STMT (e
) = NULL
;
6251 /* The latch of ORIG_LOOP was copied, and so was the backedge
6252 to the original header. We redirect this backedge to EXIT_BB. */
6253 for (i
= 0; i
< n_region
; i
++)
6254 if (get_bb_original (region_copy
[i
]) == orig_loop
->latch
)
6256 gcc_assert (single_succ_edge (region_copy
[i
]));
6257 e
= redirect_edge_and_branch (single_succ_edge (region_copy
[i
]), exit_bb
);
6258 PENDING_STMT (e
) = NULL
;
6259 for (psi
= gsi_start_phis (exit_bb
);
6264 def
= PHI_ARG_DEF (phi
, nexits
[0]->dest_idx
);
6265 add_phi_arg (phi
, def
, e
, gimple_phi_arg_location_from_edge (phi
, e
));
6268 e
= redirect_edge_and_branch (nexits
[1], nexits
[0]->dest
);
6269 PENDING_STMT (e
) = NULL
;
6271 /* Anything that is outside of the region, but was dominated by something
6272 inside needs to update dominance info. */
6273 iterate_fix_dominators (CDI_DOMINATORS
, doms
, false);
6275 /* Update the SSA web. */
6276 update_ssa (TODO_update_ssa
);
6278 if (free_region_copy
)
6281 free_original_copy_tables ();
6285 /* Add all the blocks dominated by ENTRY to the array BBS_P. Stop
6286 adding blocks when the dominator traversal reaches EXIT. This
6287 function silently assumes that ENTRY strictly dominates EXIT. */
6290 gather_blocks_in_sese_region (basic_block entry
, basic_block exit
,
6291 vec
<basic_block
> *bbs_p
)
6295 for (son
= first_dom_son (CDI_DOMINATORS
, entry
);
6297 son
= next_dom_son (CDI_DOMINATORS
, son
))
6299 bbs_p
->safe_push (son
);
6301 gather_blocks_in_sese_region (son
, exit
, bbs_p
);
6305 /* Replaces *TP with a duplicate (belonging to function TO_CONTEXT).
6306 The duplicates are recorded in VARS_MAP. */
6309 replace_by_duplicate_decl (tree
*tp
, hash_map
<tree
, tree
> *vars_map
,
6312 tree t
= *tp
, new_t
;
6313 struct function
*f
= DECL_STRUCT_FUNCTION (to_context
);
6315 if (DECL_CONTEXT (t
) == to_context
)
6319 tree
&loc
= vars_map
->get_or_insert (t
, &existed
);
6325 new_t
= copy_var_decl (t
, DECL_NAME (t
), TREE_TYPE (t
));
6326 add_local_decl (f
, new_t
);
6330 gcc_assert (TREE_CODE (t
) == CONST_DECL
);
6331 new_t
= copy_node (t
);
6333 DECL_CONTEXT (new_t
) = to_context
;
6344 /* Creates an ssa name in TO_CONTEXT equivalent to NAME.
6345 VARS_MAP maps old ssa names and var_decls to the new ones. */
6348 replace_ssa_name (tree name
, hash_map
<tree
, tree
> *vars_map
,
6353 gcc_assert (!virtual_operand_p (name
));
6355 tree
*loc
= vars_map
->get (name
);
6359 tree decl
= SSA_NAME_VAR (name
);
6362 replace_by_duplicate_decl (&decl
, vars_map
, to_context
);
6363 new_name
= make_ssa_name_fn (DECL_STRUCT_FUNCTION (to_context
),
6364 decl
, SSA_NAME_DEF_STMT (name
));
6365 if (SSA_NAME_IS_DEFAULT_DEF (name
))
6366 set_ssa_default_def (DECL_STRUCT_FUNCTION (to_context
),
6370 new_name
= copy_ssa_name_fn (DECL_STRUCT_FUNCTION (to_context
),
6371 name
, SSA_NAME_DEF_STMT (name
));
6373 vars_map
->put (name
, new_name
);
6387 hash_map
<tree
, tree
> *vars_map
;
6388 htab_t new_label_map
;
6389 hash_map
<void *, void *> *eh_map
;
6393 /* Helper for move_block_to_fn. Set TREE_BLOCK in every expression
6394 contained in *TP if it has been ORIG_BLOCK previously and change the
6395 DECL_CONTEXT of every local variable referenced in *TP. */
6398 move_stmt_op (tree
*tp
, int *walk_subtrees
, void *data
)
6400 struct walk_stmt_info
*wi
= (struct walk_stmt_info
*) data
;
6401 struct move_stmt_d
*p
= (struct move_stmt_d
*) wi
->info
;
6406 tree block
= TREE_BLOCK (t
);
6407 if (block
== p
->orig_block
6408 || (p
->orig_block
== NULL_TREE
6409 && block
!= NULL_TREE
))
6410 TREE_SET_BLOCK (t
, p
->new_block
);
6411 #ifdef ENABLE_CHECKING
6412 else if (block
!= NULL_TREE
)
6414 while (block
&& TREE_CODE (block
) == BLOCK
&& block
!= p
->orig_block
)
6415 block
= BLOCK_SUPERCONTEXT (block
);
6416 gcc_assert (block
== p
->orig_block
);
6420 else if (DECL_P (t
) || TREE_CODE (t
) == SSA_NAME
)
6422 if (TREE_CODE (t
) == SSA_NAME
)
6423 *tp
= replace_ssa_name (t
, p
->vars_map
, p
->to_context
);
6424 else if (TREE_CODE (t
) == LABEL_DECL
)
6426 if (p
->new_label_map
)
6428 struct tree_map in
, *out
;
6430 out
= (struct tree_map
*)
6431 htab_find_with_hash (p
->new_label_map
, &in
, DECL_UID (t
));
6436 DECL_CONTEXT (t
) = p
->to_context
;
6438 else if (p
->remap_decls_p
)
6440 /* Replace T with its duplicate. T should no longer appear in the
6441 parent function, so this looks wasteful; however, it may appear
6442 in referenced_vars, and more importantly, as virtual operands of
6443 statements, and in alias lists of other variables. It would be
6444 quite difficult to expunge it from all those places. ??? It might
6445 suffice to do this for addressable variables. */
6446 if ((TREE_CODE (t
) == VAR_DECL
6447 && !is_global_var (t
))
6448 || TREE_CODE (t
) == CONST_DECL
)
6449 replace_by_duplicate_decl (tp
, p
->vars_map
, p
->to_context
);
6453 else if (TYPE_P (t
))
6459 /* Helper for move_stmt_r. Given an EH region number for the source
6460 function, map that to the duplicate EH regio number in the dest. */
6463 move_stmt_eh_region_nr (int old_nr
, struct move_stmt_d
*p
)
6465 eh_region old_r
, new_r
;
6467 old_r
= get_eh_region_from_number (old_nr
);
6468 new_r
= static_cast<eh_region
> (*p
->eh_map
->get (old_r
));
6470 return new_r
->index
;
6473 /* Similar, but operate on INTEGER_CSTs. */
6476 move_stmt_eh_region_tree_nr (tree old_t_nr
, struct move_stmt_d
*p
)
6480 old_nr
= tree_to_shwi (old_t_nr
);
6481 new_nr
= move_stmt_eh_region_nr (old_nr
, p
);
6483 return build_int_cst (integer_type_node
, new_nr
);
6486 /* Like move_stmt_op, but for gimple statements.
6488 Helper for move_block_to_fn. Set GIMPLE_BLOCK in every expression
6489 contained in the current statement in *GSI_P and change the
6490 DECL_CONTEXT of every local variable referenced in the current
6494 move_stmt_r (gimple_stmt_iterator
*gsi_p
, bool *handled_ops_p
,
6495 struct walk_stmt_info
*wi
)
6497 struct move_stmt_d
*p
= (struct move_stmt_d
*) wi
->info
;
6498 gimple stmt
= gsi_stmt (*gsi_p
);
6499 tree block
= gimple_block (stmt
);
6501 if (block
== p
->orig_block
6502 || (p
->orig_block
== NULL_TREE
6503 && block
!= NULL_TREE
))
6504 gimple_set_block (stmt
, p
->new_block
);
6506 switch (gimple_code (stmt
))
6509 /* Remap the region numbers for __builtin_eh_{pointer,filter}. */
6511 tree r
, fndecl
= gimple_call_fndecl (stmt
);
6512 if (fndecl
&& DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
)
6513 switch (DECL_FUNCTION_CODE (fndecl
))
6515 case BUILT_IN_EH_COPY_VALUES
:
6516 r
= gimple_call_arg (stmt
, 1);
6517 r
= move_stmt_eh_region_tree_nr (r
, p
);
6518 gimple_call_set_arg (stmt
, 1, r
);
6521 case BUILT_IN_EH_POINTER
:
6522 case BUILT_IN_EH_FILTER
:
6523 r
= gimple_call_arg (stmt
, 0);
6524 r
= move_stmt_eh_region_tree_nr (r
, p
);
6525 gimple_call_set_arg (stmt
, 0, r
);
6536 gimple_resx resx_stmt
= as_a
<gimple_resx
> (stmt
);
6537 int r
= gimple_resx_region (resx_stmt
);
6538 r
= move_stmt_eh_region_nr (r
, p
);
6539 gimple_resx_set_region (resx_stmt
, r
);
6543 case GIMPLE_EH_DISPATCH
:
6545 gimple_eh_dispatch eh_dispatch_stmt
= as_a
<gimple_eh_dispatch
> (stmt
);
6546 int r
= gimple_eh_dispatch_region (eh_dispatch_stmt
);
6547 r
= move_stmt_eh_region_nr (r
, p
);
6548 gimple_eh_dispatch_set_region (eh_dispatch_stmt
, r
);
6552 case GIMPLE_OMP_RETURN
:
6553 case GIMPLE_OMP_CONTINUE
:
6556 if (is_gimple_omp (stmt
))
6558 /* Do not remap variables inside OMP directives. Variables
6559 referenced in clauses and directive header belong to the
6560 parent function and should not be moved into the child
6562 bool save_remap_decls_p
= p
->remap_decls_p
;
6563 p
->remap_decls_p
= false;
6564 *handled_ops_p
= true;
6566 walk_gimple_seq_mod (gimple_omp_body_ptr (stmt
), move_stmt_r
,
6569 p
->remap_decls_p
= save_remap_decls_p
;
6577 /* Move basic block BB from function CFUN to function DEST_FN. The
6578 block is moved out of the original linked list and placed after
6579 block AFTER in the new list. Also, the block is removed from the
6580 original array of blocks and placed in DEST_FN's array of blocks.
6581 If UPDATE_EDGE_COUNT_P is true, the edge counts on both CFGs is
6582 updated to reflect the moved edges.
6584 The local variables are remapped to new instances, VARS_MAP is used
6585 to record the mapping. */
6588 move_block_to_fn (struct function
*dest_cfun
, basic_block bb
,
6589 basic_block after
, bool update_edge_count_p
,
6590 struct move_stmt_d
*d
)
6592 struct control_flow_graph
*cfg
;
6595 gimple_stmt_iterator si
;
6596 unsigned old_len
, new_len
;
6598 /* Remove BB from dominance structures. */
6599 delete_from_dominance_info (CDI_DOMINATORS
, bb
);
6601 /* Move BB from its current loop to the copy in the new function. */
6604 struct loop
*new_loop
= (struct loop
*)bb
->loop_father
->aux
;
6606 bb
->loop_father
= new_loop
;
6609 /* Link BB to the new linked list. */
6610 move_block_after (bb
, after
);
6612 /* Update the edge count in the corresponding flowgraphs. */
6613 if (update_edge_count_p
)
6614 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
6616 cfun
->cfg
->x_n_edges
--;
6617 dest_cfun
->cfg
->x_n_edges
++;
6620 /* Remove BB from the original basic block array. */
6621 (*cfun
->cfg
->x_basic_block_info
)[bb
->index
] = NULL
;
6622 cfun
->cfg
->x_n_basic_blocks
--;
6624 /* Grow DEST_CFUN's basic block array if needed. */
6625 cfg
= dest_cfun
->cfg
;
6626 cfg
->x_n_basic_blocks
++;
6627 if (bb
->index
>= cfg
->x_last_basic_block
)
6628 cfg
->x_last_basic_block
= bb
->index
+ 1;
6630 old_len
= vec_safe_length (cfg
->x_basic_block_info
);
6631 if ((unsigned) cfg
->x_last_basic_block
>= old_len
)
6633 new_len
= cfg
->x_last_basic_block
+ (cfg
->x_last_basic_block
+ 3) / 4;
6634 vec_safe_grow_cleared (cfg
->x_basic_block_info
, new_len
);
6637 (*cfg
->x_basic_block_info
)[bb
->index
] = bb
;
6639 /* Remap the variables in phi nodes. */
6640 for (gimple_phi_iterator psi
= gsi_start_phis (bb
);
6643 gimple_phi phi
= psi
.phi ();
6645 tree op
= PHI_RESULT (phi
);
6649 if (virtual_operand_p (op
))
6651 /* Remove the phi nodes for virtual operands (alias analysis will be
6652 run for the new function, anyway). */
6653 remove_phi_node (&psi
, true);
6657 SET_PHI_RESULT (phi
,
6658 replace_ssa_name (op
, d
->vars_map
, dest_cfun
->decl
));
6659 FOR_EACH_PHI_ARG (use
, phi
, oi
, SSA_OP_USE
)
6661 op
= USE_FROM_PTR (use
);
6662 if (TREE_CODE (op
) == SSA_NAME
)
6663 SET_USE (use
, replace_ssa_name (op
, d
->vars_map
, dest_cfun
->decl
));
6666 for (i
= 0; i
< EDGE_COUNT (bb
->preds
); i
++)
6668 location_t locus
= gimple_phi_arg_location (phi
, i
);
6669 tree block
= LOCATION_BLOCK (locus
);
6671 if (locus
== UNKNOWN_LOCATION
)
6673 if (d
->orig_block
== NULL_TREE
|| block
== d
->orig_block
)
6675 if (d
->new_block
== NULL_TREE
)
6676 locus
= LOCATION_LOCUS (locus
);
6678 locus
= COMBINE_LOCATION_DATA (line_table
, locus
, d
->new_block
);
6679 gimple_phi_arg_set_location (phi
, i
, locus
);
6686 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
6688 gimple stmt
= gsi_stmt (si
);
6689 struct walk_stmt_info wi
;
6691 memset (&wi
, 0, sizeof (wi
));
6693 walk_gimple_stmt (&si
, move_stmt_r
, move_stmt_op
, &wi
);
6695 if (gimple_code (stmt
) == GIMPLE_LABEL
)
6697 tree label
= gimple_label_label (stmt
);
6698 int uid
= LABEL_DECL_UID (label
);
6700 gcc_assert (uid
> -1);
6702 old_len
= vec_safe_length (cfg
->x_label_to_block_map
);
6703 if (old_len
<= (unsigned) uid
)
6705 new_len
= 3 * uid
/ 2 + 1;
6706 vec_safe_grow_cleared (cfg
->x_label_to_block_map
, new_len
);
6709 (*cfg
->x_label_to_block_map
)[uid
] = bb
;
6710 (*cfun
->cfg
->x_label_to_block_map
)[uid
] = NULL
;
6712 gcc_assert (DECL_CONTEXT (label
) == dest_cfun
->decl
);
6714 if (uid
>= dest_cfun
->cfg
->last_label_uid
)
6715 dest_cfun
->cfg
->last_label_uid
= uid
+ 1;
6718 maybe_duplicate_eh_stmt_fn (dest_cfun
, stmt
, cfun
, stmt
, d
->eh_map
, 0);
6719 remove_stmt_from_eh_lp_fn (cfun
, stmt
);
6721 gimple_duplicate_stmt_histograms (dest_cfun
, stmt
, cfun
, stmt
);
6722 gimple_remove_stmt_histograms (cfun
, stmt
);
6724 /* We cannot leave any operands allocated from the operand caches of
6725 the current function. */
6726 free_stmt_operands (cfun
, stmt
);
6727 push_cfun (dest_cfun
);
6732 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
6733 if (e
->goto_locus
!= UNKNOWN_LOCATION
)
6735 tree block
= LOCATION_BLOCK (e
->goto_locus
);
6736 if (d
->orig_block
== NULL_TREE
6737 || block
== d
->orig_block
)
6738 e
->goto_locus
= d
->new_block
?
6739 COMBINE_LOCATION_DATA (line_table
, e
->goto_locus
, d
->new_block
) :
6740 LOCATION_LOCUS (e
->goto_locus
);
6744 /* Examine the statements in BB (which is in SRC_CFUN); find and return
6745 the outermost EH region. Use REGION as the incoming base EH region. */
6748 find_outermost_region_in_block (struct function
*src_cfun
,
6749 basic_block bb
, eh_region region
)
6751 gimple_stmt_iterator si
;
6753 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
6755 gimple stmt
= gsi_stmt (si
);
6756 eh_region stmt_region
;
6759 lp_nr
= lookup_stmt_eh_lp_fn (src_cfun
, stmt
);
6760 stmt_region
= get_eh_region_from_lp_number_fn (src_cfun
, lp_nr
);
6764 region
= stmt_region
;
6765 else if (stmt_region
!= region
)
6767 region
= eh_region_outermost (src_cfun
, stmt_region
, region
);
6768 gcc_assert (region
!= NULL
);
6777 new_label_mapper (tree decl
, void *data
)
6779 htab_t hash
= (htab_t
) data
;
6783 gcc_assert (TREE_CODE (decl
) == LABEL_DECL
);
6785 m
= XNEW (struct tree_map
);
6786 m
->hash
= DECL_UID (decl
);
6787 m
->base
.from
= decl
;
6788 m
->to
= create_artificial_label (UNKNOWN_LOCATION
);
6789 LABEL_DECL_UID (m
->to
) = LABEL_DECL_UID (decl
);
6790 if (LABEL_DECL_UID (m
->to
) >= cfun
->cfg
->last_label_uid
)
6791 cfun
->cfg
->last_label_uid
= LABEL_DECL_UID (m
->to
) + 1;
6793 slot
= htab_find_slot_with_hash (hash
, m
, m
->hash
, INSERT
);
6794 gcc_assert (*slot
== NULL
);
6801 /* Change DECL_CONTEXT of all BLOCK_VARS in block, including
6805 replace_block_vars_by_duplicates (tree block
, hash_map
<tree
, tree
> *vars_map
,
6810 for (tp
= &BLOCK_VARS (block
); *tp
; tp
= &DECL_CHAIN (*tp
))
6813 if (TREE_CODE (t
) != VAR_DECL
&& TREE_CODE (t
) != CONST_DECL
)
6815 replace_by_duplicate_decl (&t
, vars_map
, to_context
);
6818 if (TREE_CODE (*tp
) == VAR_DECL
&& DECL_HAS_VALUE_EXPR_P (*tp
))
6820 SET_DECL_VALUE_EXPR (t
, DECL_VALUE_EXPR (*tp
));
6821 DECL_HAS_VALUE_EXPR_P (t
) = 1;
6823 DECL_CHAIN (t
) = DECL_CHAIN (*tp
);
6828 for (block
= BLOCK_SUBBLOCKS (block
); block
; block
= BLOCK_CHAIN (block
))
6829 replace_block_vars_by_duplicates (block
, vars_map
, to_context
);
6832 /* Fixup the loop arrays and numbers after moving LOOP and its subloops
6836 fixup_loop_arrays_after_move (struct function
*fn1
, struct function
*fn2
,
6839 /* Discard it from the old loop array. */
6840 (*get_loops (fn1
))[loop
->num
] = NULL
;
6842 /* Place it in the new loop array, assigning it a new number. */
6843 loop
->num
= number_of_loops (fn2
);
6844 vec_safe_push (loops_for_fn (fn2
)->larray
, loop
);
6846 /* Recurse to children. */
6847 for (loop
= loop
->inner
; loop
; loop
= loop
->next
)
6848 fixup_loop_arrays_after_move (fn1
, fn2
, loop
);
6851 /* Move a single-entry, single-exit region delimited by ENTRY_BB and
6852 EXIT_BB to function DEST_CFUN. The whole region is replaced by a
6853 single basic block in the original CFG and the new basic block is
6854 returned. DEST_CFUN must not have a CFG yet.
6856 Note that the region need not be a pure SESE region. Blocks inside
6857 the region may contain calls to abort/exit. The only restriction
6858 is that ENTRY_BB should be the only entry point and it must
6861 Change TREE_BLOCK of all statements in ORIG_BLOCK to the new
6862 functions outermost BLOCK, move all subblocks of ORIG_BLOCK
6863 to the new function.
6865 All local variables referenced in the region are assumed to be in
6866 the corresponding BLOCK_VARS and unexpanded variable lists
6867 associated with DEST_CFUN. */
6870 move_sese_region_to_fn (struct function
*dest_cfun
, basic_block entry_bb
,
6871 basic_block exit_bb
, tree orig_block
)
6873 vec
<basic_block
> bbs
, dom_bbs
;
6874 basic_block dom_entry
= get_immediate_dominator (CDI_DOMINATORS
, entry_bb
);
6875 basic_block after
, bb
, *entry_pred
, *exit_succ
, abb
;
6876 struct function
*saved_cfun
= cfun
;
6877 int *entry_flag
, *exit_flag
;
6878 unsigned *entry_prob
, *exit_prob
;
6879 unsigned i
, num_entry_edges
, num_exit_edges
, num_nodes
;
6882 htab_t new_label_map
;
6883 hash_map
<void *, void *> *eh_map
;
6884 struct loop
*loop
= entry_bb
->loop_father
;
6885 struct loop
*loop0
= get_loop (saved_cfun
, 0);
6886 struct move_stmt_d d
;
6888 /* If ENTRY does not strictly dominate EXIT, this cannot be an SESE
6890 gcc_assert (entry_bb
!= exit_bb
6892 || dominated_by_p (CDI_DOMINATORS
, exit_bb
, entry_bb
)));
6894 /* Collect all the blocks in the region. Manually add ENTRY_BB
6895 because it won't be added by dfs_enumerate_from. */
6897 bbs
.safe_push (entry_bb
);
6898 gather_blocks_in_sese_region (entry_bb
, exit_bb
, &bbs
);
6900 /* The blocks that used to be dominated by something in BBS will now be
6901 dominated by the new block. */
6902 dom_bbs
= get_dominated_by_region (CDI_DOMINATORS
,
6906 /* Detach ENTRY_BB and EXIT_BB from CFUN->CFG. We need to remember
6907 the predecessor edges to ENTRY_BB and the successor edges to
6908 EXIT_BB so that we can re-attach them to the new basic block that
6909 will replace the region. */
6910 num_entry_edges
= EDGE_COUNT (entry_bb
->preds
);
6911 entry_pred
= XNEWVEC (basic_block
, num_entry_edges
);
6912 entry_flag
= XNEWVEC (int, num_entry_edges
);
6913 entry_prob
= XNEWVEC (unsigned, num_entry_edges
);
6915 for (ei
= ei_start (entry_bb
->preds
); (e
= ei_safe_edge (ei
)) != NULL
;)
6917 entry_prob
[i
] = e
->probability
;
6918 entry_flag
[i
] = e
->flags
;
6919 entry_pred
[i
++] = e
->src
;
6925 num_exit_edges
= EDGE_COUNT (exit_bb
->succs
);
6926 exit_succ
= XNEWVEC (basic_block
, num_exit_edges
);
6927 exit_flag
= XNEWVEC (int, num_exit_edges
);
6928 exit_prob
= XNEWVEC (unsigned, num_exit_edges
);
6930 for (ei
= ei_start (exit_bb
->succs
); (e
= ei_safe_edge (ei
)) != NULL
;)
6932 exit_prob
[i
] = e
->probability
;
6933 exit_flag
[i
] = e
->flags
;
6934 exit_succ
[i
++] = e
->dest
;
6946 /* Switch context to the child function to initialize DEST_FN's CFG. */
6947 gcc_assert (dest_cfun
->cfg
== NULL
);
6948 push_cfun (dest_cfun
);
6950 init_empty_tree_cfg ();
6952 /* Initialize EH information for the new function. */
6954 new_label_map
= NULL
;
6957 eh_region region
= NULL
;
6959 FOR_EACH_VEC_ELT (bbs
, i
, bb
)
6960 region
= find_outermost_region_in_block (saved_cfun
, bb
, region
);
6962 init_eh_for_function ();
6965 new_label_map
= htab_create (17, tree_map_hash
, tree_map_eq
, free
);
6966 eh_map
= duplicate_eh_regions (saved_cfun
, region
, 0,
6967 new_label_mapper
, new_label_map
);
6971 /* Initialize an empty loop tree. */
6972 struct loops
*loops
= ggc_cleared_alloc
<struct loops
> ();
6973 init_loops_structure (dest_cfun
, loops
, 1);
6974 loops
->state
= LOOPS_MAY_HAVE_MULTIPLE_LATCHES
;
6975 set_loops_for_fn (dest_cfun
, loops
);
6977 /* Move the outlined loop tree part. */
6978 num_nodes
= bbs
.length ();
6979 FOR_EACH_VEC_ELT (bbs
, i
, bb
)
6981 if (bb
->loop_father
->header
== bb
)
6983 struct loop
*this_loop
= bb
->loop_father
;
6984 struct loop
*outer
= loop_outer (this_loop
);
6986 /* If the SESE region contains some bbs ending with
6987 a noreturn call, those are considered to belong
6988 to the outermost loop in saved_cfun, rather than
6989 the entry_bb's loop_father. */
6993 num_nodes
-= this_loop
->num_nodes
;
6994 flow_loop_tree_node_remove (bb
->loop_father
);
6995 flow_loop_tree_node_add (get_loop (dest_cfun
, 0), this_loop
);
6996 fixup_loop_arrays_after_move (saved_cfun
, cfun
, this_loop
);
6999 else if (bb
->loop_father
== loop0
&& loop0
!= loop
)
7002 /* Remove loop exits from the outlined region. */
7003 if (loops_for_fn (saved_cfun
)->exits
)
7004 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
7006 struct loops
*l
= loops_for_fn (saved_cfun
);
7008 = l
->exits
->find_slot_with_hash (e
, htab_hash_pointer (e
),
7011 l
->exits
->clear_slot (slot
);
7016 /* Adjust the number of blocks in the tree root of the outlined part. */
7017 get_loop (dest_cfun
, 0)->num_nodes
= bbs
.length () + 2;
7019 /* Setup a mapping to be used by move_block_to_fn. */
7020 loop
->aux
= current_loops
->tree_root
;
7021 loop0
->aux
= current_loops
->tree_root
;
7025 /* Move blocks from BBS into DEST_CFUN. */
7026 gcc_assert (bbs
.length () >= 2);
7027 after
= dest_cfun
->cfg
->x_entry_block_ptr
;
7028 hash_map
<tree
, tree
> vars_map
;
7030 memset (&d
, 0, sizeof (d
));
7031 d
.orig_block
= orig_block
;
7032 d
.new_block
= DECL_INITIAL (dest_cfun
->decl
);
7033 d
.from_context
= cfun
->decl
;
7034 d
.to_context
= dest_cfun
->decl
;
7035 d
.vars_map
= &vars_map
;
7036 d
.new_label_map
= new_label_map
;
7038 d
.remap_decls_p
= true;
7040 FOR_EACH_VEC_ELT (bbs
, i
, bb
)
7042 /* No need to update edge counts on the last block. It has
7043 already been updated earlier when we detached the region from
7044 the original CFG. */
7045 move_block_to_fn (dest_cfun
, bb
, after
, bb
!= exit_bb
, &d
);
7051 /* Loop sizes are no longer correct, fix them up. */
7052 loop
->num_nodes
-= num_nodes
;
7053 for (struct loop
*outer
= loop_outer (loop
);
7054 outer
; outer
= loop_outer (outer
))
7055 outer
->num_nodes
-= num_nodes
;
7056 loop0
->num_nodes
-= bbs
.length () - num_nodes
;
7058 if (saved_cfun
->has_simduid_loops
|| saved_cfun
->has_force_vectorize_loops
)
7061 for (i
= 0; vec_safe_iterate (loops
->larray
, i
, &aloop
); i
++)
7066 replace_by_duplicate_decl (&aloop
->simduid
, d
.vars_map
,
7068 dest_cfun
->has_simduid_loops
= true;
7070 if (aloop
->force_vectorize
)
7071 dest_cfun
->has_force_vectorize_loops
= true;
7075 /* Rewire BLOCK_SUBBLOCKS of orig_block. */
7079 gcc_assert (BLOCK_SUBBLOCKS (DECL_INITIAL (dest_cfun
->decl
))
7081 BLOCK_SUBBLOCKS (DECL_INITIAL (dest_cfun
->decl
))
7082 = BLOCK_SUBBLOCKS (orig_block
);
7083 for (block
= BLOCK_SUBBLOCKS (orig_block
);
7084 block
; block
= BLOCK_CHAIN (block
))
7085 BLOCK_SUPERCONTEXT (block
) = DECL_INITIAL (dest_cfun
->decl
);
7086 BLOCK_SUBBLOCKS (orig_block
) = NULL_TREE
;
7089 replace_block_vars_by_duplicates (DECL_INITIAL (dest_cfun
->decl
),
7090 &vars_map
, dest_cfun
->decl
);
7093 htab_delete (new_label_map
);
7097 /* Rewire the entry and exit blocks. The successor to the entry
7098 block turns into the successor of DEST_FN's ENTRY_BLOCK_PTR in
7099 the child function. Similarly, the predecessor of DEST_FN's
7100 EXIT_BLOCK_PTR turns into the predecessor of EXIT_BLOCK_PTR. We
7101 need to switch CFUN between DEST_CFUN and SAVED_CFUN so that the
7102 various CFG manipulation function get to the right CFG.
7104 FIXME, this is silly. The CFG ought to become a parameter to
7106 push_cfun (dest_cfun
);
7107 make_edge (ENTRY_BLOCK_PTR_FOR_FN (cfun
), entry_bb
, EDGE_FALLTHRU
);
7109 make_edge (exit_bb
, EXIT_BLOCK_PTR_FOR_FN (cfun
), 0);
7112 /* Back in the original function, the SESE region has disappeared,
7113 create a new basic block in its place. */
7114 bb
= create_empty_bb (entry_pred
[0]);
7116 add_bb_to_loop (bb
, loop
);
7117 for (i
= 0; i
< num_entry_edges
; i
++)
7119 e
= make_edge (entry_pred
[i
], bb
, entry_flag
[i
]);
7120 e
->probability
= entry_prob
[i
];
7123 for (i
= 0; i
< num_exit_edges
; i
++)
7125 e
= make_edge (bb
, exit_succ
[i
], exit_flag
[i
]);
7126 e
->probability
= exit_prob
[i
];
7129 set_immediate_dominator (CDI_DOMINATORS
, bb
, dom_entry
);
7130 FOR_EACH_VEC_ELT (dom_bbs
, i
, abb
)
7131 set_immediate_dominator (CDI_DOMINATORS
, abb
, bb
);
7149 /* Dump FUNCTION_DECL FN to file FILE using FLAGS (see TDF_* in dumpfile.h)
7153 dump_function_to_file (tree fndecl
, FILE *file
, int flags
)
7155 tree arg
, var
, old_current_fndecl
= current_function_decl
;
7156 struct function
*dsf
;
7157 bool ignore_topmost_bind
= false, any_var
= false;
7160 bool tmclone
= (TREE_CODE (fndecl
) == FUNCTION_DECL
7161 && decl_is_tm_clone (fndecl
));
7162 struct function
*fun
= DECL_STRUCT_FUNCTION (fndecl
);
7164 current_function_decl
= fndecl
;
7165 fprintf (file
, "%s %s(", function_name (fun
), tmclone
? "[tm-clone] " : "");
7167 arg
= DECL_ARGUMENTS (fndecl
);
7170 print_generic_expr (file
, TREE_TYPE (arg
), dump_flags
);
7171 fprintf (file
, " ");
7172 print_generic_expr (file
, arg
, dump_flags
);
7173 if (flags
& TDF_VERBOSE
)
7174 print_node (file
, "", arg
, 4);
7175 if (DECL_CHAIN (arg
))
7176 fprintf (file
, ", ");
7177 arg
= DECL_CHAIN (arg
);
7179 fprintf (file
, ")\n");
7181 if (flags
& TDF_VERBOSE
)
7182 print_node (file
, "", fndecl
, 2);
7184 dsf
= DECL_STRUCT_FUNCTION (fndecl
);
7185 if (dsf
&& (flags
& TDF_EH
))
7186 dump_eh_tree (file
, dsf
);
7188 if (flags
& TDF_RAW
&& !gimple_has_body_p (fndecl
))
7190 dump_node (fndecl
, TDF_SLIM
| flags
, file
);
7191 current_function_decl
= old_current_fndecl
;
7195 /* When GIMPLE is lowered, the variables are no longer available in
7196 BIND_EXPRs, so display them separately. */
7197 if (fun
&& fun
->decl
== fndecl
&& (fun
->curr_properties
& PROP_gimple_lcf
))
7200 ignore_topmost_bind
= true;
7202 fprintf (file
, "{\n");
7203 if (!vec_safe_is_empty (fun
->local_decls
))
7204 FOR_EACH_LOCAL_DECL (fun
, ix
, var
)
7206 print_generic_decl (file
, var
, flags
);
7207 if (flags
& TDF_VERBOSE
)
7208 print_node (file
, "", var
, 4);
7209 fprintf (file
, "\n");
7213 if (gimple_in_ssa_p (cfun
))
7214 for (ix
= 1; ix
< num_ssa_names
; ++ix
)
7216 tree name
= ssa_name (ix
);
7217 if (name
&& !SSA_NAME_VAR (name
))
7219 fprintf (file
, " ");
7220 print_generic_expr (file
, TREE_TYPE (name
), flags
);
7221 fprintf (file
, " ");
7222 print_generic_expr (file
, name
, flags
);
7223 fprintf (file
, ";\n");
7230 if (fun
&& fun
->decl
== fndecl
7232 && basic_block_info_for_fn (fun
))
7234 /* If the CFG has been built, emit a CFG-based dump. */
7235 if (!ignore_topmost_bind
)
7236 fprintf (file
, "{\n");
7238 if (any_var
&& n_basic_blocks_for_fn (fun
))
7239 fprintf (file
, "\n");
7241 FOR_EACH_BB_FN (bb
, fun
)
7242 dump_bb (file
, bb
, 2, flags
| TDF_COMMENT
);
7244 fprintf (file
, "}\n");
7246 else if (DECL_SAVED_TREE (fndecl
) == NULL
)
7248 /* The function is now in GIMPLE form but the CFG has not been
7249 built yet. Emit the single sequence of GIMPLE statements
7250 that make up its body. */
7251 gimple_seq body
= gimple_body (fndecl
);
7253 if (gimple_seq_first_stmt (body
)
7254 && gimple_seq_first_stmt (body
) == gimple_seq_last_stmt (body
)
7255 && gimple_code (gimple_seq_first_stmt (body
)) == GIMPLE_BIND
)
7256 print_gimple_seq (file
, body
, 0, flags
);
7259 if (!ignore_topmost_bind
)
7260 fprintf (file
, "{\n");
7263 fprintf (file
, "\n");
7265 print_gimple_seq (file
, body
, 2, flags
);
7266 fprintf (file
, "}\n");
7273 /* Make a tree based dump. */
7274 chain
= DECL_SAVED_TREE (fndecl
);
7275 if (chain
&& TREE_CODE (chain
) == BIND_EXPR
)
7277 if (ignore_topmost_bind
)
7279 chain
= BIND_EXPR_BODY (chain
);
7287 if (!ignore_topmost_bind
)
7288 fprintf (file
, "{\n");
7293 fprintf (file
, "\n");
7295 print_generic_stmt_indented (file
, chain
, flags
, indent
);
7296 if (ignore_topmost_bind
)
7297 fprintf (file
, "}\n");
7300 if (flags
& TDF_ENUMERATE_LOCALS
)
7301 dump_enumerated_decls (file
, flags
);
7302 fprintf (file
, "\n\n");
7304 current_function_decl
= old_current_fndecl
;
7307 /* Dump FUNCTION_DECL FN to stderr using FLAGS (see TDF_* in tree.h) */
7310 debug_function (tree fn
, int flags
)
7312 dump_function_to_file (fn
, stderr
, flags
);
7316 /* Print on FILE the indexes for the predecessors of basic_block BB. */
7319 print_pred_bbs (FILE *file
, basic_block bb
)
7324 FOR_EACH_EDGE (e
, ei
, bb
->preds
)
7325 fprintf (file
, "bb_%d ", e
->src
->index
);
7329 /* Print on FILE the indexes for the successors of basic_block BB. */
7332 print_succ_bbs (FILE *file
, basic_block bb
)
7337 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
7338 fprintf (file
, "bb_%d ", e
->dest
->index
);
7341 /* Print to FILE the basic block BB following the VERBOSITY level. */
7344 print_loops_bb (FILE *file
, basic_block bb
, int indent
, int verbosity
)
7346 char *s_indent
= (char *) alloca ((size_t) indent
+ 1);
7347 memset ((void *) s_indent
, ' ', (size_t) indent
);
7348 s_indent
[indent
] = '\0';
7350 /* Print basic_block's header. */
7353 fprintf (file
, "%s bb_%d (preds = {", s_indent
, bb
->index
);
7354 print_pred_bbs (file
, bb
);
7355 fprintf (file
, "}, succs = {");
7356 print_succ_bbs (file
, bb
);
7357 fprintf (file
, "})\n");
7360 /* Print basic_block's body. */
7363 fprintf (file
, "%s {\n", s_indent
);
7364 dump_bb (file
, bb
, indent
+ 4, TDF_VOPS
|TDF_MEMSYMS
);
7365 fprintf (file
, "%s }\n", s_indent
);
7369 static void print_loop_and_siblings (FILE *, struct loop
*, int, int);
7371 /* Pretty print LOOP on FILE, indented INDENT spaces. Following
7372 VERBOSITY level this outputs the contents of the loop, or just its
7376 print_loop (FILE *file
, struct loop
*loop
, int indent
, int verbosity
)
7384 s_indent
= (char *) alloca ((size_t) indent
+ 1);
7385 memset ((void *) s_indent
, ' ', (size_t) indent
);
7386 s_indent
[indent
] = '\0';
7388 /* Print loop's header. */
7389 fprintf (file
, "%sloop_%d (", s_indent
, loop
->num
);
7391 fprintf (file
, "header = %d", loop
->header
->index
);
7394 fprintf (file
, "deleted)\n");
7398 fprintf (file
, ", latch = %d", loop
->latch
->index
);
7400 fprintf (file
, ", multiple latches");
7401 fprintf (file
, ", niter = ");
7402 print_generic_expr (file
, loop
->nb_iterations
, 0);
7404 if (loop
->any_upper_bound
)
7406 fprintf (file
, ", upper_bound = ");
7407 print_decu (loop
->nb_iterations_upper_bound
, file
);
7410 if (loop
->any_estimate
)
7412 fprintf (file
, ", estimate = ");
7413 print_decu (loop
->nb_iterations_estimate
, file
);
7415 fprintf (file
, ")\n");
7417 /* Print loop's body. */
7420 fprintf (file
, "%s{\n", s_indent
);
7421 FOR_EACH_BB_FN (bb
, cfun
)
7422 if (bb
->loop_father
== loop
)
7423 print_loops_bb (file
, bb
, indent
, verbosity
);
7425 print_loop_and_siblings (file
, loop
->inner
, indent
+ 2, verbosity
);
7426 fprintf (file
, "%s}\n", s_indent
);
7430 /* Print the LOOP and its sibling loops on FILE, indented INDENT
7431 spaces. Following VERBOSITY level this outputs the contents of the
7432 loop, or just its structure. */
7435 print_loop_and_siblings (FILE *file
, struct loop
*loop
, int indent
,
7441 print_loop (file
, loop
, indent
, verbosity
);
7442 print_loop_and_siblings (file
, loop
->next
, indent
, verbosity
);
7445 /* Follow a CFG edge from the entry point of the program, and on entry
7446 of a loop, pretty print the loop structure on FILE. */
7449 print_loops (FILE *file
, int verbosity
)
7453 bb
= ENTRY_BLOCK_PTR_FOR_FN (cfun
);
7454 if (bb
&& bb
->loop_father
)
7455 print_loop_and_siblings (file
, bb
->loop_father
, 0, verbosity
);
7461 debug (struct loop
&ref
)
7463 print_loop (stderr
, &ref
, 0, /*verbosity*/0);
7467 debug (struct loop
*ptr
)
7472 fprintf (stderr
, "<nil>\n");
7475 /* Dump a loop verbosely. */
7478 debug_verbose (struct loop
&ref
)
7480 print_loop (stderr
, &ref
, 0, /*verbosity*/3);
7484 debug_verbose (struct loop
*ptr
)
7489 fprintf (stderr
, "<nil>\n");
7493 /* Debugging loops structure at tree level, at some VERBOSITY level. */
7496 debug_loops (int verbosity
)
7498 print_loops (stderr
, verbosity
);
7501 /* Print on stderr the code of LOOP, at some VERBOSITY level. */
7504 debug_loop (struct loop
*loop
, int verbosity
)
7506 print_loop (stderr
, loop
, 0, verbosity
);
7509 /* Print on stderr the code of loop number NUM, at some VERBOSITY
7513 debug_loop_num (unsigned num
, int verbosity
)
7515 debug_loop (get_loop (cfun
, num
), verbosity
);
7518 /* Return true if BB ends with a call, possibly followed by some
7519 instructions that must stay with the call. Return false,
7523 gimple_block_ends_with_call_p (basic_block bb
)
7525 gimple_stmt_iterator gsi
= gsi_last_nondebug_bb (bb
);
7526 return !gsi_end_p (gsi
) && is_gimple_call (gsi_stmt (gsi
));
7530 /* Return true if BB ends with a conditional branch. Return false,
7534 gimple_block_ends_with_condjump_p (const_basic_block bb
)
7536 gimple stmt
= last_stmt (CONST_CAST_BB (bb
));
7537 return (stmt
&& gimple_code (stmt
) == GIMPLE_COND
);
7541 /* Return true if we need to add fake edge to exit at statement T.
7542 Helper function for gimple_flow_call_edges_add. */
7545 need_fake_edge_p (gimple t
)
7547 tree fndecl
= NULL_TREE
;
7550 /* NORETURN and LONGJMP calls already have an edge to exit.
7551 CONST and PURE calls do not need one.
7552 We don't currently check for CONST and PURE here, although
7553 it would be a good idea, because those attributes are
7554 figured out from the RTL in mark_constant_function, and
7555 the counter incrementation code from -fprofile-arcs
7556 leads to different results from -fbranch-probabilities. */
7557 if (is_gimple_call (t
))
7559 fndecl
= gimple_call_fndecl (t
);
7560 call_flags
= gimple_call_flags (t
);
7563 if (is_gimple_call (t
)
7565 && DECL_BUILT_IN (fndecl
)
7566 && (call_flags
& ECF_NOTHROW
)
7567 && !(call_flags
& ECF_RETURNS_TWICE
)
7568 /* fork() doesn't really return twice, but the effect of
7569 wrapping it in __gcov_fork() which calls __gcov_flush()
7570 and clears the counters before forking has the same
7571 effect as returning twice. Force a fake edge. */
7572 && !(DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
7573 && DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_FORK
))
7576 if (is_gimple_call (t
))
7582 if (!(call_flags
& ECF_NORETURN
))
7586 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
7587 if ((e
->flags
& EDGE_FAKE
) == 0)
7591 if (gimple_asm asm_stmt
= dyn_cast
<gimple_asm
> (t
))
7592 if (gimple_asm_volatile_p (asm_stmt
) || gimple_asm_input_p (asm_stmt
))
7599 /* Add fake edges to the function exit for any non constant and non
7600 noreturn calls (or noreturn calls with EH/abnormal edges),
7601 volatile inline assembly in the bitmap of blocks specified by BLOCKS
7602 or to the whole CFG if BLOCKS is zero. Return the number of blocks
7605 The goal is to expose cases in which entering a basic block does
7606 not imply that all subsequent instructions must be executed. */
7609 gimple_flow_call_edges_add (sbitmap blocks
)
7612 int blocks_split
= 0;
7613 int last_bb
= last_basic_block_for_fn (cfun
);
7614 bool check_last_block
= false;
7616 if (n_basic_blocks_for_fn (cfun
) == NUM_FIXED_BLOCKS
)
7620 check_last_block
= true;
7622 check_last_block
= bitmap_bit_p (blocks
,
7623 EXIT_BLOCK_PTR_FOR_FN (cfun
)->prev_bb
->index
);
7625 /* In the last basic block, before epilogue generation, there will be
7626 a fallthru edge to EXIT. Special care is required if the last insn
7627 of the last basic block is a call because make_edge folds duplicate
7628 edges, which would result in the fallthru edge also being marked
7629 fake, which would result in the fallthru edge being removed by
7630 remove_fake_edges, which would result in an invalid CFG.
7632 Moreover, we can't elide the outgoing fake edge, since the block
7633 profiler needs to take this into account in order to solve the minimal
7634 spanning tree in the case that the call doesn't return.
7636 Handle this by adding a dummy instruction in a new last basic block. */
7637 if (check_last_block
)
7639 basic_block bb
= EXIT_BLOCK_PTR_FOR_FN (cfun
)->prev_bb
;
7640 gimple_stmt_iterator gsi
= gsi_last_nondebug_bb (bb
);
7643 if (!gsi_end_p (gsi
))
7646 if (t
&& need_fake_edge_p (t
))
7650 e
= find_edge (bb
, EXIT_BLOCK_PTR_FOR_FN (cfun
));
7653 gsi_insert_on_edge (e
, gimple_build_nop ());
7654 gsi_commit_edge_inserts ();
7659 /* Now add fake edges to the function exit for any non constant
7660 calls since there is no way that we can determine if they will
7662 for (i
= 0; i
< last_bb
; i
++)
7664 basic_block bb
= BASIC_BLOCK_FOR_FN (cfun
, i
);
7665 gimple_stmt_iterator gsi
;
7666 gimple stmt
, last_stmt
;
7671 if (blocks
&& !bitmap_bit_p (blocks
, i
))
7674 gsi
= gsi_last_nondebug_bb (bb
);
7675 if (!gsi_end_p (gsi
))
7677 last_stmt
= gsi_stmt (gsi
);
7680 stmt
= gsi_stmt (gsi
);
7681 if (need_fake_edge_p (stmt
))
7685 /* The handling above of the final block before the
7686 epilogue should be enough to verify that there is
7687 no edge to the exit block in CFG already.
7688 Calling make_edge in such case would cause us to
7689 mark that edge as fake and remove it later. */
7690 #ifdef ENABLE_CHECKING
7691 if (stmt
== last_stmt
)
7693 e
= find_edge (bb
, EXIT_BLOCK_PTR_FOR_FN (cfun
));
7694 gcc_assert (e
== NULL
);
7698 /* Note that the following may create a new basic block
7699 and renumber the existing basic blocks. */
7700 if (stmt
!= last_stmt
)
7702 e
= split_block (bb
, stmt
);
7706 make_edge (bb
, EXIT_BLOCK_PTR_FOR_FN (cfun
), EDGE_FAKE
);
7710 while (!gsi_end_p (gsi
));
7715 verify_flow_info ();
7717 return blocks_split
;
7720 /* Removes edge E and all the blocks dominated by it, and updates dominance
7721 information. The IL in E->src needs to be updated separately.
7722 If dominance info is not available, only the edge E is removed.*/
7725 remove_edge_and_dominated_blocks (edge e
)
7727 vec
<basic_block
> bbs_to_remove
= vNULL
;
7728 vec
<basic_block
> bbs_to_fix_dom
= vNULL
;
7732 bool none_removed
= false;
7734 basic_block bb
, dbb
;
7737 if (!dom_info_available_p (CDI_DOMINATORS
))
7743 /* No updating is needed for edges to exit. */
7744 if (e
->dest
== EXIT_BLOCK_PTR_FOR_FN (cfun
))
7746 if (cfgcleanup_altered_bbs
)
7747 bitmap_set_bit (cfgcleanup_altered_bbs
, e
->src
->index
);
7752 /* First, we find the basic blocks to remove. If E->dest has a predecessor
7753 that is not dominated by E->dest, then this set is empty. Otherwise,
7754 all the basic blocks dominated by E->dest are removed.
7756 Also, to DF_IDOM we store the immediate dominators of the blocks in
7757 the dominance frontier of E (i.e., of the successors of the
7758 removed blocks, if there are any, and of E->dest otherwise). */
7759 FOR_EACH_EDGE (f
, ei
, e
->dest
->preds
)
7764 if (!dominated_by_p (CDI_DOMINATORS
, f
->src
, e
->dest
))
7766 none_removed
= true;
7771 df
= BITMAP_ALLOC (NULL
);
7772 df_idom
= BITMAP_ALLOC (NULL
);
7775 bitmap_set_bit (df_idom
,
7776 get_immediate_dominator (CDI_DOMINATORS
, e
->dest
)->index
);
7779 bbs_to_remove
= get_all_dominated_blocks (CDI_DOMINATORS
, e
->dest
);
7780 FOR_EACH_VEC_ELT (bbs_to_remove
, i
, bb
)
7782 FOR_EACH_EDGE (f
, ei
, bb
->succs
)
7784 if (f
->dest
!= EXIT_BLOCK_PTR_FOR_FN (cfun
))
7785 bitmap_set_bit (df
, f
->dest
->index
);
7788 FOR_EACH_VEC_ELT (bbs_to_remove
, i
, bb
)
7789 bitmap_clear_bit (df
, bb
->index
);
7791 EXECUTE_IF_SET_IN_BITMAP (df
, 0, i
, bi
)
7793 bb
= BASIC_BLOCK_FOR_FN (cfun
, i
);
7794 bitmap_set_bit (df_idom
,
7795 get_immediate_dominator (CDI_DOMINATORS
, bb
)->index
);
7799 if (cfgcleanup_altered_bbs
)
7801 /* Record the set of the altered basic blocks. */
7802 bitmap_set_bit (cfgcleanup_altered_bbs
, e
->src
->index
);
7803 bitmap_ior_into (cfgcleanup_altered_bbs
, df
);
7806 /* Remove E and the cancelled blocks. */
7811 /* Walk backwards so as to get a chance to substitute all
7812 released DEFs into debug stmts. See
7813 eliminate_unnecessary_stmts() in tree-ssa-dce.c for more
7815 for (i
= bbs_to_remove
.length (); i
-- > 0; )
7816 delete_basic_block (bbs_to_remove
[i
]);
7819 /* Update the dominance information. The immediate dominator may change only
7820 for blocks whose immediate dominator belongs to DF_IDOM:
7822 Suppose that idom(X) = Y before removal of E and idom(X) != Y after the
7823 removal. Let Z the arbitrary block such that idom(Z) = Y and
7824 Z dominates X after the removal. Before removal, there exists a path P
7825 from Y to X that avoids Z. Let F be the last edge on P that is
7826 removed, and let W = F->dest. Before removal, idom(W) = Y (since Y
7827 dominates W, and because of P, Z does not dominate W), and W belongs to
7828 the dominance frontier of E. Therefore, Y belongs to DF_IDOM. */
7829 EXECUTE_IF_SET_IN_BITMAP (df_idom
, 0, i
, bi
)
7831 bb
= BASIC_BLOCK_FOR_FN (cfun
, i
);
7832 for (dbb
= first_dom_son (CDI_DOMINATORS
, bb
);
7834 dbb
= next_dom_son (CDI_DOMINATORS
, dbb
))
7835 bbs_to_fix_dom
.safe_push (dbb
);
7838 iterate_fix_dominators (CDI_DOMINATORS
, bbs_to_fix_dom
, true);
7841 BITMAP_FREE (df_idom
);
7842 bbs_to_remove
.release ();
7843 bbs_to_fix_dom
.release ();
7846 /* Purge dead EH edges from basic block BB. */
7849 gimple_purge_dead_eh_edges (basic_block bb
)
7851 bool changed
= false;
7854 gimple stmt
= last_stmt (bb
);
7856 if (stmt
&& stmt_can_throw_internal (stmt
))
7859 for (ei
= ei_start (bb
->succs
); (e
= ei_safe_edge (ei
)); )
7861 if (e
->flags
& EDGE_EH
)
7863 remove_edge_and_dominated_blocks (e
);
7873 /* Purge dead EH edges from basic block listed in BLOCKS. */
7876 gimple_purge_all_dead_eh_edges (const_bitmap blocks
)
7878 bool changed
= false;
7882 EXECUTE_IF_SET_IN_BITMAP (blocks
, 0, i
, bi
)
7884 basic_block bb
= BASIC_BLOCK_FOR_FN (cfun
, i
);
7886 /* Earlier gimple_purge_dead_eh_edges could have removed
7887 this basic block already. */
7888 gcc_assert (bb
|| changed
);
7890 changed
|= gimple_purge_dead_eh_edges (bb
);
7896 /* Purge dead abnormal call edges from basic block BB. */
7899 gimple_purge_dead_abnormal_call_edges (basic_block bb
)
7901 bool changed
= false;
7904 gimple stmt
= last_stmt (bb
);
7906 if (!cfun
->has_nonlocal_label
7907 && !cfun
->calls_setjmp
)
7910 if (stmt
&& stmt_can_make_abnormal_goto (stmt
))
7913 for (ei
= ei_start (bb
->succs
); (e
= ei_safe_edge (ei
)); )
7915 if (e
->flags
& EDGE_ABNORMAL
)
7917 if (e
->flags
& EDGE_FALLTHRU
)
7918 e
->flags
&= ~EDGE_ABNORMAL
;
7920 remove_edge_and_dominated_blocks (e
);
7930 /* Purge dead abnormal call edges from basic block listed in BLOCKS. */
7933 gimple_purge_all_dead_abnormal_call_edges (const_bitmap blocks
)
7935 bool changed
= false;
7939 EXECUTE_IF_SET_IN_BITMAP (blocks
, 0, i
, bi
)
7941 basic_block bb
= BASIC_BLOCK_FOR_FN (cfun
, i
);
7943 /* Earlier gimple_purge_dead_abnormal_call_edges could have removed
7944 this basic block already. */
7945 gcc_assert (bb
|| changed
);
7947 changed
|= gimple_purge_dead_abnormal_call_edges (bb
);
7953 /* This function is called whenever a new edge is created or
7957 gimple_execute_on_growing_pred (edge e
)
7959 basic_block bb
= e
->dest
;
7961 if (!gimple_seq_empty_p (phi_nodes (bb
)))
7962 reserve_phi_args_for_new_edge (bb
);
7965 /* This function is called immediately before edge E is removed from
7966 the edge vector E->dest->preds. */
7969 gimple_execute_on_shrinking_pred (edge e
)
7971 if (!gimple_seq_empty_p (phi_nodes (e
->dest
)))
7972 remove_phi_args (e
);
7975 /*---------------------------------------------------------------------------
7976 Helper functions for Loop versioning
7977 ---------------------------------------------------------------------------*/
7979 /* Adjust phi nodes for 'first' basic block. 'second' basic block is a copy
7980 of 'first'. Both of them are dominated by 'new_head' basic block. When
7981 'new_head' was created by 'second's incoming edge it received phi arguments
7982 on the edge by split_edge(). Later, additional edge 'e' was created to
7983 connect 'new_head' and 'first'. Now this routine adds phi args on this
7984 additional edge 'e' that new_head to second edge received as part of edge
7988 gimple_lv_adjust_loop_header_phi (basic_block first
, basic_block second
,
7989 basic_block new_head
, edge e
)
7991 gimple_phi phi1
, phi2
;
7992 gimple_phi_iterator psi1
, psi2
;
7994 edge e2
= find_edge (new_head
, second
);
7996 /* Because NEW_HEAD has been created by splitting SECOND's incoming
7997 edge, we should always have an edge from NEW_HEAD to SECOND. */
7998 gcc_assert (e2
!= NULL
);
8000 /* Browse all 'second' basic block phi nodes and add phi args to
8001 edge 'e' for 'first' head. PHI args are always in correct order. */
8003 for (psi2
= gsi_start_phis (second
),
8004 psi1
= gsi_start_phis (first
);
8005 !gsi_end_p (psi2
) && !gsi_end_p (psi1
);
8006 gsi_next (&psi2
), gsi_next (&psi1
))
8010 def
= PHI_ARG_DEF (phi2
, e2
->dest_idx
);
8011 add_phi_arg (phi1
, def
, e
, gimple_phi_arg_location_from_edge (phi2
, e2
));
8016 /* Adds a if else statement to COND_BB with condition COND_EXPR.
8017 SECOND_HEAD is the destination of the THEN and FIRST_HEAD is
8018 the destination of the ELSE part. */
8021 gimple_lv_add_condition_to_bb (basic_block first_head ATTRIBUTE_UNUSED
,
8022 basic_block second_head ATTRIBUTE_UNUSED
,
8023 basic_block cond_bb
, void *cond_e
)
8025 gimple_stmt_iterator gsi
;
8026 gimple new_cond_expr
;
8027 tree cond_expr
= (tree
) cond_e
;
8030 /* Build new conditional expr */
8031 new_cond_expr
= gimple_build_cond_from_tree (cond_expr
,
8032 NULL_TREE
, NULL_TREE
);
8034 /* Add new cond in cond_bb. */
8035 gsi
= gsi_last_bb (cond_bb
);
8036 gsi_insert_after (&gsi
, new_cond_expr
, GSI_NEW_STMT
);
8038 /* Adjust edges appropriately to connect new head with first head
8039 as well as second head. */
8040 e0
= single_succ_edge (cond_bb
);
8041 e0
->flags
&= ~EDGE_FALLTHRU
;
8042 e0
->flags
|= EDGE_FALSE_VALUE
;
8046 /* Do book-keeping of basic block BB for the profile consistency checker.
8047 If AFTER_PASS is 0, do pre-pass accounting, or if AFTER_PASS is 1
8048 then do post-pass accounting. Store the counting in RECORD. */
8050 gimple_account_profile_record (basic_block bb
, int after_pass
,
8051 struct profile_record
*record
)
8053 gimple_stmt_iterator i
;
8054 for (i
= gsi_start_bb (bb
); !gsi_end_p (i
); gsi_next (&i
))
8056 record
->size
[after_pass
]
8057 += estimate_num_insns (gsi_stmt (i
), &eni_size_weights
);
8058 if (profile_status_for_fn (cfun
) == PROFILE_READ
)
8059 record
->time
[after_pass
]
8060 += estimate_num_insns (gsi_stmt (i
),
8061 &eni_time_weights
) * bb
->count
;
8062 else if (profile_status_for_fn (cfun
) == PROFILE_GUESSED
)
8063 record
->time
[after_pass
]
8064 += estimate_num_insns (gsi_stmt (i
),
8065 &eni_time_weights
) * bb
->frequency
;
8069 struct cfg_hooks gimple_cfg_hooks
= {
8071 gimple_verify_flow_info
,
8072 gimple_dump_bb
, /* dump_bb */
8073 gimple_dump_bb_for_graph
, /* dump_bb_for_graph */
8074 create_bb
, /* create_basic_block */
8075 gimple_redirect_edge_and_branch
, /* redirect_edge_and_branch */
8076 gimple_redirect_edge_and_branch_force
, /* redirect_edge_and_branch_force */
8077 gimple_can_remove_branch_p
, /* can_remove_branch_p */
8078 remove_bb
, /* delete_basic_block */
8079 gimple_split_block
, /* split_block */
8080 gimple_move_block_after
, /* move_block_after */
8081 gimple_can_merge_blocks_p
, /* can_merge_blocks_p */
8082 gimple_merge_blocks
, /* merge_blocks */
8083 gimple_predict_edge
, /* predict_edge */
8084 gimple_predicted_by_p
, /* predicted_by_p */
8085 gimple_can_duplicate_bb_p
, /* can_duplicate_block_p */
8086 gimple_duplicate_bb
, /* duplicate_block */
8087 gimple_split_edge
, /* split_edge */
8088 gimple_make_forwarder_block
, /* make_forward_block */
8089 NULL
, /* tidy_fallthru_edge */
8090 NULL
, /* force_nonfallthru */
8091 gimple_block_ends_with_call_p
,/* block_ends_with_call_p */
8092 gimple_block_ends_with_condjump_p
, /* block_ends_with_condjump_p */
8093 gimple_flow_call_edges_add
, /* flow_call_edges_add */
8094 gimple_execute_on_growing_pred
, /* execute_on_growing_pred */
8095 gimple_execute_on_shrinking_pred
, /* execute_on_shrinking_pred */
8096 gimple_duplicate_loop_to_header_edge
, /* duplicate loop for trees */
8097 gimple_lv_add_condition_to_bb
, /* lv_add_condition_to_bb */
8098 gimple_lv_adjust_loop_header_phi
, /* lv_adjust_loop_header_phi*/
8099 extract_true_false_edges_from_block
, /* extract_cond_bb_edges */
8100 flush_pending_stmts
, /* flush_pending_stmts */
8101 gimple_empty_block_p
, /* block_empty_p */
8102 gimple_split_block_before_cond_jump
, /* split_block_before_cond_jump */
8103 gimple_account_profile_record
,
8107 /* Split all critical edges. */
8110 split_critical_edges (void)
8116 /* split_edge can redirect edges out of SWITCH_EXPRs, which can get
8117 expensive. So we want to enable recording of edge to CASE_LABEL_EXPR
8118 mappings around the calls to split_edge. */
8119 start_recording_case_labels ();
8120 FOR_ALL_BB_FN (bb
, cfun
)
8122 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
8124 if (EDGE_CRITICAL_P (e
) && !(e
->flags
& EDGE_ABNORMAL
))
8126 /* PRE inserts statements to edges and expects that
8127 since split_critical_edges was done beforehand, committing edge
8128 insertions will not split more edges. In addition to critical
8129 edges we must split edges that have multiple successors and
8130 end by control flow statements, such as RESX.
8131 Go ahead and split them too. This matches the logic in
8132 gimple_find_edge_insert_loc. */
8133 else if ((!single_pred_p (e
->dest
)
8134 || !gimple_seq_empty_p (phi_nodes (e
->dest
))
8135 || e
->dest
== EXIT_BLOCK_PTR_FOR_FN (cfun
))
8136 && e
->src
!= ENTRY_BLOCK_PTR_FOR_FN (cfun
)
8137 && !(e
->flags
& EDGE_ABNORMAL
))
8139 gimple_stmt_iterator gsi
;
8141 gsi
= gsi_last_bb (e
->src
);
8142 if (!gsi_end_p (gsi
)
8143 && stmt_ends_bb_p (gsi_stmt (gsi
))
8144 && (gimple_code (gsi_stmt (gsi
)) != GIMPLE_RETURN
8145 && !gimple_call_builtin_p (gsi_stmt (gsi
),
8151 end_recording_case_labels ();
8157 const pass_data pass_data_split_crit_edges
=
8159 GIMPLE_PASS
, /* type */
8160 "crited", /* name */
8161 OPTGROUP_NONE
, /* optinfo_flags */
8162 TV_TREE_SPLIT_EDGES
, /* tv_id */
8163 PROP_cfg
, /* properties_required */
8164 PROP_no_crit_edges
, /* properties_provided */
8165 0, /* properties_destroyed */
8166 0, /* todo_flags_start */
8167 0, /* todo_flags_finish */
8170 class pass_split_crit_edges
: public gimple_opt_pass
8173 pass_split_crit_edges (gcc::context
*ctxt
)
8174 : gimple_opt_pass (pass_data_split_crit_edges
, ctxt
)
8177 /* opt_pass methods: */
8178 virtual unsigned int execute (function
*) { return split_critical_edges (); }
8180 opt_pass
* clone () { return new pass_split_crit_edges (m_ctxt
); }
8181 }; // class pass_split_crit_edges
8186 make_pass_split_crit_edges (gcc::context
*ctxt
)
8188 return new pass_split_crit_edges (ctxt
);
8192 /* Build a ternary operation and gimplify it. Emit code before GSI.
8193 Return the gimple_val holding the result. */
8196 gimplify_build3 (gimple_stmt_iterator
*gsi
, enum tree_code code
,
8197 tree type
, tree a
, tree b
, tree c
)
8200 location_t loc
= gimple_location (gsi_stmt (*gsi
));
8202 ret
= fold_build3_loc (loc
, code
, type
, a
, b
, c
);
8205 return force_gimple_operand_gsi (gsi
, ret
, true, NULL
, true,
8209 /* Build a binary operation and gimplify it. Emit code before GSI.
8210 Return the gimple_val holding the result. */
8213 gimplify_build2 (gimple_stmt_iterator
*gsi
, enum tree_code code
,
8214 tree type
, tree a
, tree b
)
8218 ret
= fold_build2_loc (gimple_location (gsi_stmt (*gsi
)), code
, type
, a
, b
);
8221 return force_gimple_operand_gsi (gsi
, ret
, true, NULL
, true,
8225 /* Build a unary operation and gimplify it. Emit code before GSI.
8226 Return the gimple_val holding the result. */
8229 gimplify_build1 (gimple_stmt_iterator
*gsi
, enum tree_code code
, tree type
,
8234 ret
= fold_build1_loc (gimple_location (gsi_stmt (*gsi
)), code
, type
, a
);
8237 return force_gimple_operand_gsi (gsi
, ret
, true, NULL
, true,
8243 /* Given a basic block B which ends with a conditional and has
8244 precisely two successors, determine which of the edges is taken if
8245 the conditional is true and which is taken if the conditional is
8246 false. Set TRUE_EDGE and FALSE_EDGE appropriately. */
8249 extract_true_false_edges_from_block (basic_block b
,
8253 edge e
= EDGE_SUCC (b
, 0);
8255 if (e
->flags
& EDGE_TRUE_VALUE
)
8258 *false_edge
= EDGE_SUCC (b
, 1);
8263 *true_edge
= EDGE_SUCC (b
, 1);
8267 /* Emit return warnings. */
8271 const pass_data pass_data_warn_function_return
=
8273 GIMPLE_PASS
, /* type */
8274 "*warn_function_return", /* name */
8275 OPTGROUP_NONE
, /* optinfo_flags */
8276 TV_NONE
, /* tv_id */
8277 PROP_cfg
, /* properties_required */
8278 0, /* properties_provided */
8279 0, /* properties_destroyed */
8280 0, /* todo_flags_start */
8281 0, /* todo_flags_finish */
8284 class pass_warn_function_return
: public gimple_opt_pass
8287 pass_warn_function_return (gcc::context
*ctxt
)
8288 : gimple_opt_pass (pass_data_warn_function_return
, ctxt
)
8291 /* opt_pass methods: */
8292 virtual unsigned int execute (function
*);
8294 }; // class pass_warn_function_return
8297 pass_warn_function_return::execute (function
*fun
)
8299 source_location location
;
8304 if (!targetm
.warn_func_return (fun
->decl
))
8307 /* If we have a path to EXIT, then we do return. */
8308 if (TREE_THIS_VOLATILE (fun
->decl
)
8309 && EDGE_COUNT (EXIT_BLOCK_PTR_FOR_FN (fun
)->preds
) > 0)
8311 location
= UNKNOWN_LOCATION
;
8312 FOR_EACH_EDGE (e
, ei
, EXIT_BLOCK_PTR_FOR_FN (fun
)->preds
)
8314 last
= last_stmt (e
->src
);
8315 if ((gimple_code (last
) == GIMPLE_RETURN
8316 || gimple_call_builtin_p (last
, BUILT_IN_RETURN
))
8317 && (location
= gimple_location (last
)) != UNKNOWN_LOCATION
)
8320 if (location
== UNKNOWN_LOCATION
)
8321 location
= cfun
->function_end_locus
;
8322 warning_at (location
, 0, "%<noreturn%> function does return");
8325 /* If we see "return;" in some basic block, then we do reach the end
8326 without returning a value. */
8327 else if (warn_return_type
8328 && !TREE_NO_WARNING (fun
->decl
)
8329 && EDGE_COUNT (EXIT_BLOCK_PTR_FOR_FN (fun
)->preds
) > 0
8330 && !VOID_TYPE_P (TREE_TYPE (TREE_TYPE (fun
->decl
))))
8332 FOR_EACH_EDGE (e
, ei
, EXIT_BLOCK_PTR_FOR_FN (fun
)->preds
)
8334 gimple last
= last_stmt (e
->src
);
8335 if (gimple_code (last
) == GIMPLE_RETURN
8336 && gimple_return_retval (last
) == NULL
8337 && !gimple_no_warning_p (last
))
8339 location
= gimple_location (last
);
8340 if (location
== UNKNOWN_LOCATION
)
8341 location
= fun
->function_end_locus
;
8342 warning_at (location
, OPT_Wreturn_type
, "control reaches end of non-void function");
8343 TREE_NO_WARNING (fun
->decl
) = 1;
8354 make_pass_warn_function_return (gcc::context
*ctxt
)
8356 return new pass_warn_function_return (ctxt
);
8359 /* Walk a gimplified function and warn for functions whose return value is
8360 ignored and attribute((warn_unused_result)) is set. This is done before
8361 inlining, so we don't have to worry about that. */
8364 do_warn_unused_result (gimple_seq seq
)
8367 gimple_stmt_iterator i
;
8369 for (i
= gsi_start (seq
); !gsi_end_p (i
); gsi_next (&i
))
8371 gimple g
= gsi_stmt (i
);
8373 switch (gimple_code (g
))
8376 do_warn_unused_result (gimple_bind_body (as_a
<gimple_bind
>(g
)));
8379 do_warn_unused_result (gimple_try_eval (g
));
8380 do_warn_unused_result (gimple_try_cleanup (g
));
8383 do_warn_unused_result (gimple_catch_handler (
8384 as_a
<gimple_catch
> (g
)));
8386 case GIMPLE_EH_FILTER
:
8387 do_warn_unused_result (gimple_eh_filter_failure (g
));
8391 if (gimple_call_lhs (g
))
8393 if (gimple_call_internal_p (g
))
8396 /* This is a naked call, as opposed to a GIMPLE_CALL with an
8397 LHS. All calls whose value is ignored should be
8398 represented like this. Look for the attribute. */
8399 fdecl
= gimple_call_fndecl (g
);
8400 ftype
= gimple_call_fntype (g
);
8402 if (lookup_attribute ("warn_unused_result", TYPE_ATTRIBUTES (ftype
)))
8404 location_t loc
= gimple_location (g
);
8407 warning_at (loc
, OPT_Wunused_result
,
8408 "ignoring return value of %qD, "
8409 "declared with attribute warn_unused_result",
8412 warning_at (loc
, OPT_Wunused_result
,
8413 "ignoring return value of function "
8414 "declared with attribute warn_unused_result");
8419 /* Not a container, not a call, or a call whose value is used. */
8427 const pass_data pass_data_warn_unused_result
=
8429 GIMPLE_PASS
, /* type */
8430 "*warn_unused_result", /* name */
8431 OPTGROUP_NONE
, /* optinfo_flags */
8432 TV_NONE
, /* tv_id */
8433 PROP_gimple_any
, /* properties_required */
8434 0, /* properties_provided */
8435 0, /* properties_destroyed */
8436 0, /* todo_flags_start */
8437 0, /* todo_flags_finish */
8440 class pass_warn_unused_result
: public gimple_opt_pass
8443 pass_warn_unused_result (gcc::context
*ctxt
)
8444 : gimple_opt_pass (pass_data_warn_unused_result
, ctxt
)
8447 /* opt_pass methods: */
8448 virtual bool gate (function
*) { return flag_warn_unused_result
; }
8449 virtual unsigned int execute (function
*)
8451 do_warn_unused_result (gimple_body (current_function_decl
));
8455 }; // class pass_warn_unused_result
8460 make_pass_warn_unused_result (gcc::context
*ctxt
)
8462 return new pass_warn_unused_result (ctxt
);
8465 /* IPA passes, compilation of earlier functions or inlining
8466 might have changed some properties, such as marked functions nothrow,
8467 pure, const or noreturn.
8468 Remove redundant edges and basic blocks, and create new ones if necessary.
8470 This pass can't be executed as stand alone pass from pass manager, because
8471 in between inlining and this fixup the verify_flow_info would fail. */
8474 execute_fixup_cfg (void)
8477 gimple_stmt_iterator gsi
;
8479 gcov_type count_scale
;
8484 = GCOV_COMPUTE_SCALE (cgraph_node::get (current_function_decl
)->count
,
8485 ENTRY_BLOCK_PTR_FOR_FN (cfun
)->count
);
8487 ENTRY_BLOCK_PTR_FOR_FN (cfun
)->count
=
8488 cgraph_node::get (current_function_decl
)->count
;
8489 EXIT_BLOCK_PTR_FOR_FN (cfun
)->count
=
8490 apply_scale (EXIT_BLOCK_PTR_FOR_FN (cfun
)->count
,
8493 FOR_EACH_EDGE (e
, ei
, ENTRY_BLOCK_PTR_FOR_FN (cfun
)->succs
)
8494 e
->count
= apply_scale (e
->count
, count_scale
);
8496 FOR_EACH_BB_FN (bb
, cfun
)
8498 bb
->count
= apply_scale (bb
->count
, count_scale
);
8499 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
);)
8501 gimple stmt
= gsi_stmt (gsi
);
8502 tree decl
= is_gimple_call (stmt
)
8503 ? gimple_call_fndecl (stmt
)
8507 int flags
= gimple_call_flags (stmt
);
8508 if (flags
& (ECF_CONST
| ECF_PURE
| ECF_LOOPING_CONST_OR_PURE
))
8510 if (gimple_purge_dead_abnormal_call_edges (bb
))
8511 todo
|= TODO_cleanup_cfg
;
8513 if (gimple_in_ssa_p (cfun
))
8515 todo
|= TODO_update_ssa
| TODO_cleanup_cfg
;
8520 if (flags
& ECF_NORETURN
8521 && fixup_noreturn_call (stmt
))
8522 todo
|= TODO_cleanup_cfg
;
8525 /* Remove stores to variables we marked write-only.
8526 Keep access when store has side effect, i.e. in case when source
8528 if (gimple_store_p (stmt
)
8529 && !gimple_has_side_effects (stmt
))
8531 tree lhs
= get_base_address (gimple_get_lhs (stmt
));
8533 if (TREE_CODE (lhs
) == VAR_DECL
8534 && (TREE_STATIC (lhs
) || DECL_EXTERNAL (lhs
))
8535 && varpool_node::get (lhs
)->writeonly
)
8537 unlink_stmt_vdef (stmt
);
8538 gsi_remove (&gsi
, true);
8539 release_defs (stmt
);
8540 todo
|= TODO_update_ssa
| TODO_cleanup_cfg
;
8544 /* For calls we can simply remove LHS when it is known
8545 to be write-only. */
8546 if (is_gimple_call (stmt
)
8547 && gimple_get_lhs (stmt
))
8549 tree lhs
= get_base_address (gimple_get_lhs (stmt
));
8551 if (TREE_CODE (lhs
) == VAR_DECL
8552 && (TREE_STATIC (lhs
) || DECL_EXTERNAL (lhs
))
8553 && varpool_node::get (lhs
)->writeonly
)
8555 gimple_call_set_lhs (stmt
, NULL
);
8557 todo
|= TODO_update_ssa
| TODO_cleanup_cfg
;
8561 if (maybe_clean_eh_stmt (stmt
)
8562 && gimple_purge_dead_eh_edges (bb
))
8563 todo
|= TODO_cleanup_cfg
;
8567 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
8568 e
->count
= apply_scale (e
->count
, count_scale
);
8570 /* If we have a basic block with no successors that does not
8571 end with a control statement or a noreturn call end it with
8572 a call to __builtin_unreachable. This situation can occur
8573 when inlining a noreturn call that does in fact return. */
8574 if (EDGE_COUNT (bb
->succs
) == 0)
8576 gimple stmt
= last_stmt (bb
);
8578 || (!is_ctrl_stmt (stmt
)
8579 && (!is_gimple_call (stmt
)
8580 || (gimple_call_flags (stmt
) & ECF_NORETURN
) == 0)))
8582 if (stmt
&& is_gimple_call (stmt
))
8583 gimple_call_set_ctrl_altering (stmt
, false);
8584 stmt
= gimple_build_call
8585 (builtin_decl_implicit (BUILT_IN_UNREACHABLE
), 0);
8586 gimple_stmt_iterator gsi
= gsi_last_bb (bb
);
8587 gsi_insert_after (&gsi
, stmt
, GSI_NEW_STMT
);
8591 if (count_scale
!= REG_BR_PROB_BASE
)
8592 compute_function_frequency ();
8594 /* Dump a textual representation of the flowgraph. */
8596 gimple_dump_cfg (dump_file
, dump_flags
);
8599 && (todo
& TODO_cleanup_cfg
))
8600 loops_state_set (LOOPS_NEED_FIXUP
);
8607 const pass_data pass_data_fixup_cfg
=
8609 GIMPLE_PASS
, /* type */
8610 "*free_cfg_annotations", /* name */
8611 OPTGROUP_NONE
, /* optinfo_flags */
8612 TV_NONE
, /* tv_id */
8613 PROP_cfg
, /* properties_required */
8614 0, /* properties_provided */
8615 0, /* properties_destroyed */
8616 0, /* todo_flags_start */
8617 0, /* todo_flags_finish */
8620 class pass_fixup_cfg
: public gimple_opt_pass
8623 pass_fixup_cfg (gcc::context
*ctxt
)
8624 : gimple_opt_pass (pass_data_fixup_cfg
, ctxt
)
8627 /* opt_pass methods: */
8628 opt_pass
* clone () { return new pass_fixup_cfg (m_ctxt
); }
8629 virtual unsigned int execute (function
*) { return execute_fixup_cfg (); }
8631 }; // class pass_fixup_cfg
8636 make_pass_fixup_cfg (gcc::context
*ctxt
)
8638 return new pass_fixup_cfg (ctxt
);
8641 /* Garbage collection support for edge_def. */
8643 extern void gt_ggc_mx (tree
&);
8644 extern void gt_ggc_mx (gimple
&);
8645 extern void gt_ggc_mx (rtx
&);
8646 extern void gt_ggc_mx (basic_block
&);
8649 gt_ggc_mx (rtx_insn
*& x
)
8652 gt_ggc_mx_rtx_def ((void *) x
);
8656 gt_ggc_mx (edge_def
*e
)
8658 tree block
= LOCATION_BLOCK (e
->goto_locus
);
8660 gt_ggc_mx (e
->dest
);
8661 if (current_ir_type () == IR_GIMPLE
)
8662 gt_ggc_mx (e
->insns
.g
);
8664 gt_ggc_mx (e
->insns
.r
);
8668 /* PCH support for edge_def. */
8670 extern void gt_pch_nx (tree
&);
8671 extern void gt_pch_nx (gimple
&);
8672 extern void gt_pch_nx (rtx
&);
8673 extern void gt_pch_nx (basic_block
&);
8676 gt_pch_nx (rtx_insn
*& x
)
8679 gt_pch_nx_rtx_def ((void *) x
);
8683 gt_pch_nx (edge_def
*e
)
8685 tree block
= LOCATION_BLOCK (e
->goto_locus
);
8687 gt_pch_nx (e
->dest
);
8688 if (current_ir_type () == IR_GIMPLE
)
8689 gt_pch_nx (e
->insns
.g
);
8691 gt_pch_nx (e
->insns
.r
);
8696 gt_pch_nx (edge_def
*e
, gt_pointer_operator op
, void *cookie
)
8698 tree block
= LOCATION_BLOCK (e
->goto_locus
);
8699 op (&(e
->src
), cookie
);
8700 op (&(e
->dest
), cookie
);
8701 if (current_ir_type () == IR_GIMPLE
)
8702 op (&(e
->insns
.g
), cookie
);
8704 op (&(e
->insns
.r
), cookie
);
8705 op (&(block
), cookie
);