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 (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
);
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 (basic_block
, tree
);
176 static tree
find_case_label_for_value (gimple
, 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 (bb
);
811 make_eh_edges (last
);
814 case GIMPLE_EH_DISPATCH
:
815 fallthru
= make_eh_dispatch_edges (last
);
819 /* If this function receives a nonlocal goto, then we need to
820 make edges from this call site to all the nonlocal goto
822 if (stmt_can_make_abnormal_goto (last
))
823 ab_edge_call
.safe_push (bb
);
825 /* If this statement has reachable exception handlers, then
826 create abnormal edges to them. */
827 make_eh_edges (last
);
829 /* BUILTIN_RETURN is really a return statement. */
830 if (gimple_call_builtin_p (last
, BUILT_IN_RETURN
))
832 make_edge (bb
, EXIT_BLOCK_PTR_FOR_FN (cfun
), 0);
835 /* Some calls are known not to return. */
837 fallthru
= !(gimple_call_flags (last
) & ECF_NORETURN
);
841 /* A GIMPLE_ASSIGN may throw internally and thus be considered
843 if (is_ctrl_altering_stmt (last
))
844 make_eh_edges (last
);
849 make_gimple_asm_edges (bb
);
854 fallthru
= make_gimple_omp_edges (bb
, &cur_region
,
855 &cur_omp_region_idx
);
856 if (cur_region
&& bb_to_omp_idx
== NULL
)
857 bb_to_omp_idx
= XCNEWVEC (int, n_basic_blocks_for_fn (cfun
));
860 case GIMPLE_TRANSACTION
:
862 tree abort_label
= gimple_transaction_label (last
);
864 make_edge (bb
, label_to_block (abort_label
), EDGE_TM_ABORT
);
870 gcc_assert (!stmt_ends_bb_p (last
));
878 make_edge (bb
, bb
->next_bb
, EDGE_FALLTHRU
);
881 /* Computed gotos are hell to deal with, especially if there are
882 lots of them with a large number of destinations. So we factor
883 them to a common computed goto location before we build the
884 edge list. After we convert back to normal form, we will un-factor
885 the computed gotos since factoring introduces an unwanted jump.
886 For non-local gotos and abnormal edges from calls to calls that return
887 twice or forced labels, factor the abnormal edges too, by having all
888 abnormal edges from the calls go to a common artificial basic block
889 with ABNORMAL_DISPATCHER internal call and abnormal edges from that
890 basic block to all forced labels and calls returning twice.
891 We do this per-OpenMP structured block, because those regions
892 are guaranteed to be single entry single exit by the standard,
893 so it is not allowed to enter or exit such regions abnormally this way,
894 thus all computed gotos, non-local gotos and setjmp/longjmp calls
895 must not transfer control across SESE region boundaries. */
896 if (!ab_edge_goto
.is_empty () || !ab_edge_call
.is_empty ())
898 gimple_stmt_iterator gsi
;
899 basic_block dispatcher_bb_array
[2] = { NULL
, NULL
};
900 basic_block
*dispatcher_bbs
= dispatcher_bb_array
;
901 int count
= n_basic_blocks_for_fn (cfun
);
904 dispatcher_bbs
= XCNEWVEC (basic_block
, 2 * count
);
906 FOR_EACH_BB_FN (bb
, cfun
)
908 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
910 gimple label_stmt
= gsi_stmt (gsi
);
913 if (gimple_code (label_stmt
) != GIMPLE_LABEL
)
916 target
= gimple_label_label (label_stmt
);
918 /* Make an edge to every label block that has been marked as a
919 potential target for a computed goto or a non-local goto. */
920 if (FORCED_LABEL (target
))
921 handle_abnormal_edges (dispatcher_bbs
, bb
, bb_to_omp_idx
,
922 &ab_edge_goto
, true);
923 if (DECL_NONLOCAL (target
))
925 handle_abnormal_edges (dispatcher_bbs
, bb
, bb_to_omp_idx
,
926 &ab_edge_call
, false);
931 if (!gsi_end_p (gsi
) && is_gimple_debug (gsi_stmt (gsi
)))
932 gsi_next_nondebug (&gsi
);
933 if (!gsi_end_p (gsi
))
935 /* Make an edge to every setjmp-like call. */
936 gimple call_stmt
= gsi_stmt (gsi
);
937 if (is_gimple_call (call_stmt
)
938 && ((gimple_call_flags (call_stmt
) & ECF_RETURNS_TWICE
)
939 || gimple_call_builtin_p (call_stmt
,
940 BUILT_IN_SETJMP_RECEIVER
)))
941 handle_abnormal_edges (dispatcher_bbs
, bb
, bb_to_omp_idx
,
942 &ab_edge_call
, false);
947 XDELETE (dispatcher_bbs
);
950 XDELETE (bb_to_omp_idx
);
954 /* Fold COND_EXPR_COND of each COND_EXPR. */
955 fold_cond_expr_cond ();
958 /* Find the next available discriminator value for LOCUS. The
959 discriminator distinguishes among several basic blocks that
960 share a common locus, allowing for more accurate sample-based
964 next_discriminator_for_locus (location_t locus
)
966 struct locus_discrim_map item
;
967 struct locus_discrim_map
**slot
;
970 item
.discriminator
= 0;
971 slot
= discriminator_per_locus
->find_slot_with_hash (
972 &item
, LOCATION_LINE (locus
), INSERT
);
974 if (*slot
== HTAB_EMPTY_ENTRY
)
976 *slot
= XNEW (struct locus_discrim_map
);
978 (*slot
)->locus
= locus
;
979 (*slot
)->discriminator
= 0;
981 (*slot
)->discriminator
++;
982 return (*slot
)->discriminator
;
985 /* Return TRUE if LOCUS1 and LOCUS2 refer to the same source line. */
988 same_line_p (location_t locus1
, location_t locus2
)
990 expanded_location from
, to
;
992 if (locus1
== locus2
)
995 from
= expand_location (locus1
);
996 to
= expand_location (locus2
);
998 if (from
.line
!= to
.line
)
1000 if (from
.file
== to
.file
)
1002 return (from
.file
!= NULL
1004 && filename_cmp (from
.file
, to
.file
) == 0);
1007 /* Assign discriminators to each basic block. */
1010 assign_discriminators (void)
1014 FOR_EACH_BB_FN (bb
, cfun
)
1018 gimple last
= last_stmt (bb
);
1019 location_t locus
= last
? gimple_location (last
) : UNKNOWN_LOCATION
;
1021 if (locus
== UNKNOWN_LOCATION
)
1024 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
1026 gimple first
= first_non_label_stmt (e
->dest
);
1027 gimple last
= last_stmt (e
->dest
);
1028 if ((first
&& same_line_p (locus
, gimple_location (first
)))
1029 || (last
&& same_line_p (locus
, gimple_location (last
))))
1031 if (e
->dest
->discriminator
!= 0 && bb
->discriminator
== 0)
1032 bb
->discriminator
= next_discriminator_for_locus (locus
);
1034 e
->dest
->discriminator
= next_discriminator_for_locus (locus
);
1040 /* Create the edges for a GIMPLE_COND starting at block BB. */
1043 make_cond_expr_edges (basic_block bb
)
1045 gimple entry
= last_stmt (bb
);
1046 gimple then_stmt
, else_stmt
;
1047 basic_block then_bb
, else_bb
;
1048 tree then_label
, else_label
;
1052 gcc_assert (gimple_code (entry
) == GIMPLE_COND
);
1054 /* Entry basic blocks for each component. */
1055 then_label
= gimple_cond_true_label (entry
);
1056 else_label
= gimple_cond_false_label (entry
);
1057 then_bb
= label_to_block (then_label
);
1058 else_bb
= label_to_block (else_label
);
1059 then_stmt
= first_stmt (then_bb
);
1060 else_stmt
= first_stmt (else_bb
);
1062 e
= make_edge (bb
, then_bb
, EDGE_TRUE_VALUE
);
1063 e
->goto_locus
= gimple_location (then_stmt
);
1064 e
= make_edge (bb
, else_bb
, EDGE_FALSE_VALUE
);
1066 e
->goto_locus
= gimple_location (else_stmt
);
1068 /* We do not need the labels anymore. */
1069 gimple_cond_set_true_label (entry
, NULL_TREE
);
1070 gimple_cond_set_false_label (entry
, NULL_TREE
);
1074 /* Called for each element in the hash table (P) as we delete the
1075 edge to cases hash table.
1077 Clear all the TREE_CHAINs to prevent problems with copying of
1078 SWITCH_EXPRs and structure sharing rules, then free the hash table
1082 edge_to_cases_cleanup (edge
const &, tree
const &value
, void *)
1086 for (t
= value
; t
; t
= next
)
1088 next
= CASE_CHAIN (t
);
1089 CASE_CHAIN (t
) = NULL
;
1095 /* Start recording information mapping edges to case labels. */
1098 start_recording_case_labels (void)
1100 gcc_assert (edge_to_cases
== NULL
);
1101 edge_to_cases
= new hash_map
<edge
, tree
>;
1102 touched_switch_bbs
= BITMAP_ALLOC (NULL
);
1105 /* Return nonzero if we are recording information for case labels. */
1108 recording_case_labels_p (void)
1110 return (edge_to_cases
!= NULL
);
1113 /* Stop recording information mapping edges to case labels and
1114 remove any information we have recorded. */
1116 end_recording_case_labels (void)
1120 edge_to_cases
->traverse
<void *, edge_to_cases_cleanup
> (NULL
);
1121 delete edge_to_cases
;
1122 edge_to_cases
= NULL
;
1123 EXECUTE_IF_SET_IN_BITMAP (touched_switch_bbs
, 0, i
, bi
)
1125 basic_block bb
= BASIC_BLOCK_FOR_FN (cfun
, i
);
1128 gimple stmt
= last_stmt (bb
);
1129 if (stmt
&& gimple_code (stmt
) == GIMPLE_SWITCH
)
1130 group_case_labels_stmt (stmt
);
1133 BITMAP_FREE (touched_switch_bbs
);
1136 /* If we are inside a {start,end}_recording_cases block, then return
1137 a chain of CASE_LABEL_EXPRs from T which reference E.
1139 Otherwise return NULL. */
1142 get_cases_for_edge (edge e
, gimple t
)
1147 /* If we are not recording cases, then we do not have CASE_LABEL_EXPR
1148 chains available. Return NULL so the caller can detect this case. */
1149 if (!recording_case_labels_p ())
1152 slot
= edge_to_cases
->get (e
);
1156 /* If we did not find E in the hash table, then this must be the first
1157 time we have been queried for information about E & T. Add all the
1158 elements from T to the hash table then perform the query again. */
1160 n
= gimple_switch_num_labels (t
);
1161 for (i
= 0; i
< n
; i
++)
1163 tree elt
= gimple_switch_label (t
, i
);
1164 tree lab
= CASE_LABEL (elt
);
1165 basic_block label_bb
= label_to_block (lab
);
1166 edge this_edge
= find_edge (e
->src
, label_bb
);
1168 /* Add it to the chain of CASE_LABEL_EXPRs referencing E, or create
1170 tree
&s
= edge_to_cases
->get_or_insert (this_edge
);
1171 CASE_CHAIN (elt
) = s
;
1175 return *edge_to_cases
->get (e
);
1178 /* Create the edges for a GIMPLE_SWITCH starting at block BB. */
1181 make_gimple_switch_edges (basic_block bb
)
1183 gimple entry
= last_stmt (bb
);
1186 n
= gimple_switch_num_labels (entry
);
1188 for (i
= 0; i
< n
; ++i
)
1190 tree lab
= CASE_LABEL (gimple_switch_label (entry
, i
));
1191 basic_block label_bb
= label_to_block (lab
);
1192 make_edge (bb
, label_bb
, 0);
1197 /* Return the basic block holding label DEST. */
1200 label_to_block_fn (struct function
*ifun
, tree dest
)
1202 int uid
= LABEL_DECL_UID (dest
);
1204 /* We would die hard when faced by an undefined label. Emit a label to
1205 the very first basic block. This will hopefully make even the dataflow
1206 and undefined variable warnings quite right. */
1207 if (seen_error () && uid
< 0)
1209 gimple_stmt_iterator gsi
=
1210 gsi_start_bb (BASIC_BLOCK_FOR_FN (cfun
, NUM_FIXED_BLOCKS
));
1213 stmt
= gimple_build_label (dest
);
1214 gsi_insert_before (&gsi
, stmt
, GSI_NEW_STMT
);
1215 uid
= LABEL_DECL_UID (dest
);
1217 if (vec_safe_length (ifun
->cfg
->x_label_to_block_map
) <= (unsigned int) uid
)
1219 return (*ifun
->cfg
->x_label_to_block_map
)[uid
];
1222 /* Create edges for a goto statement at block BB. Returns true
1223 if abnormal edges should be created. */
1226 make_goto_expr_edges (basic_block bb
)
1228 gimple_stmt_iterator last
= gsi_last_bb (bb
);
1229 gimple goto_t
= gsi_stmt (last
);
1231 /* A simple GOTO creates normal edges. */
1232 if (simple_goto_p (goto_t
))
1234 tree dest
= gimple_goto_dest (goto_t
);
1235 basic_block label_bb
= label_to_block (dest
);
1236 edge e
= make_edge (bb
, label_bb
, EDGE_FALLTHRU
);
1237 e
->goto_locus
= gimple_location (goto_t
);
1238 gsi_remove (&last
, true);
1242 /* A computed GOTO creates abnormal edges. */
1246 /* Create edges for an asm statement with labels at block BB. */
1249 make_gimple_asm_edges (basic_block bb
)
1251 gimple stmt
= last_stmt (bb
);
1252 int i
, n
= gimple_asm_nlabels (stmt
);
1254 for (i
= 0; i
< n
; ++i
)
1256 tree label
= TREE_VALUE (gimple_asm_label_op (stmt
, i
));
1257 basic_block label_bb
= label_to_block (label
);
1258 make_edge (bb
, label_bb
, 0);
1262 /*---------------------------------------------------------------------------
1264 ---------------------------------------------------------------------------*/
1266 /* Cleanup useless labels in basic blocks. This is something we wish
1267 to do early because it allows us to group case labels before creating
1268 the edges for the CFG, and it speeds up block statement iterators in
1269 all passes later on.
1270 We rerun this pass after CFG is created, to get rid of the labels that
1271 are no longer referenced. After then we do not run it any more, since
1272 (almost) no new labels should be created. */
1274 /* A map from basic block index to the leading label of that block. */
1275 static struct label_record
1280 /* True if the label is referenced from somewhere. */
1284 /* Given LABEL return the first label in the same basic block. */
1287 main_block_label (tree label
)
1289 basic_block bb
= label_to_block (label
);
1290 tree main_label
= label_for_bb
[bb
->index
].label
;
1292 /* label_to_block possibly inserted undefined label into the chain. */
1295 label_for_bb
[bb
->index
].label
= label
;
1299 label_for_bb
[bb
->index
].used
= true;
1303 /* Clean up redundant labels within the exception tree. */
1306 cleanup_dead_labels_eh (void)
1313 if (cfun
->eh
== NULL
)
1316 for (i
= 1; vec_safe_iterate (cfun
->eh
->lp_array
, i
, &lp
); ++i
)
1317 if (lp
&& lp
->post_landing_pad
)
1319 lab
= main_block_label (lp
->post_landing_pad
);
1320 if (lab
!= lp
->post_landing_pad
)
1322 EH_LANDING_PAD_NR (lp
->post_landing_pad
) = 0;
1323 EH_LANDING_PAD_NR (lab
) = lp
->index
;
1327 FOR_ALL_EH_REGION (r
)
1331 case ERT_MUST_NOT_THROW
:
1337 for (c
= r
->u
.eh_try
.first_catch
; c
; c
= c
->next_catch
)
1341 c
->label
= main_block_label (lab
);
1346 case ERT_ALLOWED_EXCEPTIONS
:
1347 lab
= r
->u
.allowed
.label
;
1349 r
->u
.allowed
.label
= main_block_label (lab
);
1355 /* Cleanup redundant labels. This is a three-step process:
1356 1) Find the leading label for each block.
1357 2) Redirect all references to labels to the leading labels.
1358 3) Cleanup all useless labels. */
1361 cleanup_dead_labels (void)
1364 label_for_bb
= XCNEWVEC (struct label_record
, last_basic_block_for_fn (cfun
));
1366 /* Find a suitable label for each block. We use the first user-defined
1367 label if there is one, or otherwise just the first label we see. */
1368 FOR_EACH_BB_FN (bb
, cfun
)
1370 gimple_stmt_iterator i
;
1372 for (i
= gsi_start_bb (bb
); !gsi_end_p (i
); gsi_next (&i
))
1375 gimple stmt
= gsi_stmt (i
);
1377 if (gimple_code (stmt
) != GIMPLE_LABEL
)
1380 label
= gimple_label_label (stmt
);
1382 /* If we have not yet seen a label for the current block,
1383 remember this one and see if there are more labels. */
1384 if (!label_for_bb
[bb
->index
].label
)
1386 label_for_bb
[bb
->index
].label
= label
;
1390 /* If we did see a label for the current block already, but it
1391 is an artificially created label, replace it if the current
1392 label is a user defined label. */
1393 if (!DECL_ARTIFICIAL (label
)
1394 && DECL_ARTIFICIAL (label_for_bb
[bb
->index
].label
))
1396 label_for_bb
[bb
->index
].label
= label
;
1402 /* Now redirect all jumps/branches to the selected label.
1403 First do so for each block ending in a control statement. */
1404 FOR_EACH_BB_FN (bb
, cfun
)
1406 gimple stmt
= last_stmt (bb
);
1407 tree label
, new_label
;
1412 switch (gimple_code (stmt
))
1415 label
= gimple_cond_true_label (stmt
);
1418 new_label
= main_block_label (label
);
1419 if (new_label
!= label
)
1420 gimple_cond_set_true_label (stmt
, new_label
);
1423 label
= gimple_cond_false_label (stmt
);
1426 new_label
= main_block_label (label
);
1427 if (new_label
!= label
)
1428 gimple_cond_set_false_label (stmt
, new_label
);
1434 size_t i
, n
= gimple_switch_num_labels (stmt
);
1436 /* Replace all destination labels. */
1437 for (i
= 0; i
< n
; ++i
)
1439 tree case_label
= gimple_switch_label (stmt
, i
);
1440 label
= CASE_LABEL (case_label
);
1441 new_label
= main_block_label (label
);
1442 if (new_label
!= label
)
1443 CASE_LABEL (case_label
) = new_label
;
1450 int i
, n
= gimple_asm_nlabels (stmt
);
1452 for (i
= 0; i
< n
; ++i
)
1454 tree cons
= gimple_asm_label_op (stmt
, i
);
1455 tree label
= main_block_label (TREE_VALUE (cons
));
1456 TREE_VALUE (cons
) = label
;
1461 /* We have to handle gotos until they're removed, and we don't
1462 remove them until after we've created the CFG edges. */
1464 if (!computed_goto_p (stmt
))
1466 label
= gimple_goto_dest (stmt
);
1467 new_label
= main_block_label (label
);
1468 if (new_label
!= label
)
1469 gimple_goto_set_dest (stmt
, new_label
);
1473 case GIMPLE_TRANSACTION
:
1475 tree label
= gimple_transaction_label (stmt
);
1478 tree new_label
= main_block_label (label
);
1479 if (new_label
!= label
)
1480 gimple_transaction_set_label (stmt
, new_label
);
1490 /* Do the same for the exception region tree labels. */
1491 cleanup_dead_labels_eh ();
1493 /* Finally, purge dead labels. All user-defined labels and labels that
1494 can be the target of non-local gotos and labels which have their
1495 address taken are preserved. */
1496 FOR_EACH_BB_FN (bb
, cfun
)
1498 gimple_stmt_iterator i
;
1499 tree label_for_this_bb
= label_for_bb
[bb
->index
].label
;
1501 if (!label_for_this_bb
)
1504 /* If the main label of the block is unused, we may still remove it. */
1505 if (!label_for_bb
[bb
->index
].used
)
1506 label_for_this_bb
= NULL
;
1508 for (i
= gsi_start_bb (bb
); !gsi_end_p (i
); )
1511 gimple stmt
= gsi_stmt (i
);
1513 if (gimple_code (stmt
) != GIMPLE_LABEL
)
1516 label
= gimple_label_label (stmt
);
1518 if (label
== label_for_this_bb
1519 || !DECL_ARTIFICIAL (label
)
1520 || DECL_NONLOCAL (label
)
1521 || FORCED_LABEL (label
))
1524 gsi_remove (&i
, true);
1528 free (label_for_bb
);
1531 /* Scan the sorted vector of cases in STMT (a GIMPLE_SWITCH) and combine
1532 the ones jumping to the same label.
1533 Eg. three separate entries 1: 2: 3: become one entry 1..3: */
1536 group_case_labels_stmt (gimple stmt
)
1538 int old_size
= gimple_switch_num_labels (stmt
);
1539 int i
, j
, new_size
= old_size
;
1540 basic_block default_bb
= NULL
;
1542 default_bb
= label_to_block (CASE_LABEL (gimple_switch_default_label (stmt
)));
1544 /* Look for possible opportunities to merge cases. */
1546 while (i
< old_size
)
1548 tree base_case
, base_high
;
1549 basic_block base_bb
;
1551 base_case
= gimple_switch_label (stmt
, i
);
1553 gcc_assert (base_case
);
1554 base_bb
= label_to_block (CASE_LABEL (base_case
));
1556 /* Discard cases that have the same destination as the
1558 if (base_bb
== default_bb
)
1560 gimple_switch_set_label (stmt
, i
, NULL_TREE
);
1566 base_high
= CASE_HIGH (base_case
)
1567 ? CASE_HIGH (base_case
)
1568 : CASE_LOW (base_case
);
1571 /* Try to merge case labels. Break out when we reach the end
1572 of the label vector or when we cannot merge the next case
1573 label with the current one. */
1574 while (i
< old_size
)
1576 tree merge_case
= gimple_switch_label (stmt
, i
);
1577 basic_block merge_bb
= label_to_block (CASE_LABEL (merge_case
));
1578 wide_int bhp1
= wi::add (base_high
, 1);
1580 /* Merge the cases if they jump to the same place,
1581 and their ranges are consecutive. */
1582 if (merge_bb
== base_bb
1583 && wi::eq_p (CASE_LOW (merge_case
), bhp1
))
1585 base_high
= CASE_HIGH (merge_case
) ?
1586 CASE_HIGH (merge_case
) : CASE_LOW (merge_case
);
1587 CASE_HIGH (base_case
) = base_high
;
1588 gimple_switch_set_label (stmt
, i
, NULL_TREE
);
1597 /* Compress the case labels in the label vector, and adjust the
1598 length of the vector. */
1599 for (i
= 0, j
= 0; i
< new_size
; i
++)
1601 while (! gimple_switch_label (stmt
, j
))
1603 gimple_switch_set_label (stmt
, i
,
1604 gimple_switch_label (stmt
, j
++));
1607 gcc_assert (new_size
<= old_size
);
1608 gimple_switch_set_num_labels (stmt
, new_size
);
1611 /* Look for blocks ending in a multiway branch (a GIMPLE_SWITCH),
1612 and scan the sorted vector of cases. Combine the ones jumping to the
1616 group_case_labels (void)
1620 FOR_EACH_BB_FN (bb
, cfun
)
1622 gimple stmt
= last_stmt (bb
);
1623 if (stmt
&& gimple_code (stmt
) == GIMPLE_SWITCH
)
1624 group_case_labels_stmt (stmt
);
1628 /* Checks whether we can merge block B into block A. */
1631 gimple_can_merge_blocks_p (basic_block a
, basic_block b
)
1634 gimple_stmt_iterator gsi
;
1636 if (!single_succ_p (a
))
1639 if (single_succ_edge (a
)->flags
& EDGE_COMPLEX
)
1642 if (single_succ (a
) != b
)
1645 if (!single_pred_p (b
))
1648 if (b
== EXIT_BLOCK_PTR_FOR_FN (cfun
))
1651 /* If A ends by a statement causing exceptions or something similar, we
1652 cannot merge the blocks. */
1653 stmt
= last_stmt (a
);
1654 if (stmt
&& stmt_ends_bb_p (stmt
))
1657 /* Do not allow a block with only a non-local label to be merged. */
1659 && gimple_code (stmt
) == GIMPLE_LABEL
1660 && DECL_NONLOCAL (gimple_label_label (stmt
)))
1663 /* Examine the labels at the beginning of B. */
1664 for (gsi
= gsi_start_bb (b
); !gsi_end_p (gsi
); gsi_next (&gsi
))
1667 stmt
= gsi_stmt (gsi
);
1668 if (gimple_code (stmt
) != GIMPLE_LABEL
)
1670 lab
= gimple_label_label (stmt
);
1672 /* Do not remove user forced labels or for -O0 any user labels. */
1673 if (!DECL_ARTIFICIAL (lab
) && (!optimize
|| FORCED_LABEL (lab
)))
1677 /* Protect the loop latches. */
1678 if (current_loops
&& b
->loop_father
->latch
== b
)
1681 /* It must be possible to eliminate all phi nodes in B. If ssa form
1682 is not up-to-date and a name-mapping is registered, we cannot eliminate
1683 any phis. Symbols marked for renaming are never a problem though. */
1684 for (gsi
= gsi_start_phis (b
); !gsi_end_p (gsi
); gsi_next (&gsi
))
1686 gimple phi
= gsi_stmt (gsi
);
1687 /* Technically only new names matter. */
1688 if (name_registered_for_update_p (PHI_RESULT (phi
)))
1692 /* When not optimizing, don't merge if we'd lose goto_locus. */
1694 && single_succ_edge (a
)->goto_locus
!= UNKNOWN_LOCATION
)
1696 location_t goto_locus
= single_succ_edge (a
)->goto_locus
;
1697 gimple_stmt_iterator prev
, next
;
1698 prev
= gsi_last_nondebug_bb (a
);
1699 next
= gsi_after_labels (b
);
1700 if (!gsi_end_p (next
) && is_gimple_debug (gsi_stmt (next
)))
1701 gsi_next_nondebug (&next
);
1702 if ((gsi_end_p (prev
)
1703 || gimple_location (gsi_stmt (prev
)) != goto_locus
)
1704 && (gsi_end_p (next
)
1705 || gimple_location (gsi_stmt (next
)) != goto_locus
))
1712 /* Replaces all uses of NAME by VAL. */
1715 replace_uses_by (tree name
, tree val
)
1717 imm_use_iterator imm_iter
;
1722 FOR_EACH_IMM_USE_STMT (stmt
, imm_iter
, name
)
1724 /* Mark the block if we change the last stmt in it. */
1725 if (cfgcleanup_altered_bbs
1726 && stmt_ends_bb_p (stmt
))
1727 bitmap_set_bit (cfgcleanup_altered_bbs
, gimple_bb (stmt
)->index
);
1729 FOR_EACH_IMM_USE_ON_STMT (use
, imm_iter
)
1731 replace_exp (use
, val
);
1733 if (gimple_code (stmt
) == GIMPLE_PHI
)
1735 e
= gimple_phi_arg_edge (stmt
, PHI_ARG_INDEX_FROM_USE (use
));
1736 if (e
->flags
& EDGE_ABNORMAL
)
1738 /* This can only occur for virtual operands, since
1739 for the real ones SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name))
1740 would prevent replacement. */
1741 gcc_checking_assert (virtual_operand_p (name
));
1742 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (val
) = 1;
1747 if (gimple_code (stmt
) != GIMPLE_PHI
)
1749 gimple_stmt_iterator gsi
= gsi_for_stmt (stmt
);
1750 gimple orig_stmt
= stmt
;
1753 /* FIXME. It shouldn't be required to keep TREE_CONSTANT
1754 on ADDR_EXPRs up-to-date on GIMPLE. Propagation will
1755 only change sth from non-invariant to invariant, and only
1756 when propagating constants. */
1757 if (is_gimple_min_invariant (val
))
1758 for (i
= 0; i
< gimple_num_ops (stmt
); i
++)
1760 tree op
= gimple_op (stmt
, i
);
1761 /* Operands may be empty here. For example, the labels
1762 of a GIMPLE_COND are nulled out following the creation
1763 of the corresponding CFG edges. */
1764 if (op
&& TREE_CODE (op
) == ADDR_EXPR
)
1765 recompute_tree_invariant_for_addr_expr (op
);
1768 if (fold_stmt (&gsi
))
1769 stmt
= gsi_stmt (gsi
);
1771 if (maybe_clean_or_replace_eh_stmt (orig_stmt
, stmt
))
1772 gimple_purge_dead_eh_edges (gimple_bb (stmt
));
1778 gcc_checking_assert (has_zero_uses (name
));
1780 /* Also update the trees stored in loop structures. */
1785 FOR_EACH_LOOP (loop
, 0)
1787 substitute_in_loop_info (loop
, name
, val
);
1792 /* Merge block B into block A. */
1795 gimple_merge_blocks (basic_block a
, basic_block b
)
1797 gimple_stmt_iterator last
, gsi
, psi
;
1800 fprintf (dump_file
, "Merging blocks %d and %d\n", a
->index
, b
->index
);
1802 /* Remove all single-valued PHI nodes from block B of the form
1803 V_i = PHI <V_j> by propagating V_j to all the uses of V_i. */
1804 gsi
= gsi_last_bb (a
);
1805 for (psi
= gsi_start_phis (b
); !gsi_end_p (psi
); )
1807 gimple phi
= gsi_stmt (psi
);
1808 tree def
= gimple_phi_result (phi
), use
= gimple_phi_arg_def (phi
, 0);
1810 bool may_replace_uses
= (virtual_operand_p (def
)
1811 || may_propagate_copy (def
, use
));
1813 /* In case we maintain loop closed ssa form, do not propagate arguments
1814 of loop exit phi nodes. */
1816 && loops_state_satisfies_p (LOOP_CLOSED_SSA
)
1817 && !virtual_operand_p (def
)
1818 && TREE_CODE (use
) == SSA_NAME
1819 && a
->loop_father
!= b
->loop_father
)
1820 may_replace_uses
= false;
1822 if (!may_replace_uses
)
1824 gcc_assert (!virtual_operand_p (def
));
1826 /* Note that just emitting the copies is fine -- there is no problem
1827 with ordering of phi nodes. This is because A is the single
1828 predecessor of B, therefore results of the phi nodes cannot
1829 appear as arguments of the phi nodes. */
1830 copy
= gimple_build_assign (def
, use
);
1831 gsi_insert_after (&gsi
, copy
, GSI_NEW_STMT
);
1832 remove_phi_node (&psi
, false);
1836 /* If we deal with a PHI for virtual operands, we can simply
1837 propagate these without fussing with folding or updating
1839 if (virtual_operand_p (def
))
1841 imm_use_iterator iter
;
1842 use_operand_p use_p
;
1845 FOR_EACH_IMM_USE_STMT (stmt
, iter
, def
)
1846 FOR_EACH_IMM_USE_ON_STMT (use_p
, iter
)
1847 SET_USE (use_p
, use
);
1849 if (SSA_NAME_OCCURS_IN_ABNORMAL_PHI (def
))
1850 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (use
) = 1;
1853 replace_uses_by (def
, use
);
1855 remove_phi_node (&psi
, true);
1859 /* Ensure that B follows A. */
1860 move_block_after (b
, a
);
1862 gcc_assert (single_succ_edge (a
)->flags
& EDGE_FALLTHRU
);
1863 gcc_assert (!last_stmt (a
) || !stmt_ends_bb_p (last_stmt (a
)));
1865 /* Remove labels from B and set gimple_bb to A for other statements. */
1866 for (gsi
= gsi_start_bb (b
); !gsi_end_p (gsi
);)
1868 gimple stmt
= gsi_stmt (gsi
);
1869 if (gimple_code (stmt
) == GIMPLE_LABEL
)
1871 tree label
= gimple_label_label (stmt
);
1874 gsi_remove (&gsi
, false);
1876 /* Now that we can thread computed gotos, we might have
1877 a situation where we have a forced label in block B
1878 However, the label at the start of block B might still be
1879 used in other ways (think about the runtime checking for
1880 Fortran assigned gotos). So we can not just delete the
1881 label. Instead we move the label to the start of block A. */
1882 if (FORCED_LABEL (label
))
1884 gimple_stmt_iterator dest_gsi
= gsi_start_bb (a
);
1885 gsi_insert_before (&dest_gsi
, stmt
, GSI_NEW_STMT
);
1887 /* Other user labels keep around in a form of a debug stmt. */
1888 else if (!DECL_ARTIFICIAL (label
) && MAY_HAVE_DEBUG_STMTS
)
1890 gimple dbg
= gimple_build_debug_bind (label
,
1893 gimple_debug_bind_reset_value (dbg
);
1894 gsi_insert_before (&gsi
, dbg
, GSI_SAME_STMT
);
1897 lp_nr
= EH_LANDING_PAD_NR (label
);
1900 eh_landing_pad lp
= get_eh_landing_pad_from_number (lp_nr
);
1901 lp
->post_landing_pad
= NULL
;
1906 gimple_set_bb (stmt
, a
);
1911 /* When merging two BBs, if their counts are different, the larger count
1912 is selected as the new bb count. This is to handle inconsistent
1914 if (a
->loop_father
== b
->loop_father
)
1916 a
->count
= MAX (a
->count
, b
->count
);
1917 a
->frequency
= MAX (a
->frequency
, b
->frequency
);
1920 /* Merge the sequences. */
1921 last
= gsi_last_bb (a
);
1922 gsi_insert_seq_after (&last
, bb_seq (b
), GSI_NEW_STMT
);
1923 set_bb_seq (b
, NULL
);
1925 if (cfgcleanup_altered_bbs
)
1926 bitmap_set_bit (cfgcleanup_altered_bbs
, a
->index
);
1930 /* Return the one of two successors of BB that is not reachable by a
1931 complex edge, if there is one. Else, return BB. We use
1932 this in optimizations that use post-dominators for their heuristics,
1933 to catch the cases in C++ where function calls are involved. */
1936 single_noncomplex_succ (basic_block bb
)
1939 if (EDGE_COUNT (bb
->succs
) != 2)
1942 e0
= EDGE_SUCC (bb
, 0);
1943 e1
= EDGE_SUCC (bb
, 1);
1944 if (e0
->flags
& EDGE_COMPLEX
)
1946 if (e1
->flags
& EDGE_COMPLEX
)
1952 /* T is CALL_EXPR. Set current_function_calls_* flags. */
1955 notice_special_calls (gimple call
)
1957 int flags
= gimple_call_flags (call
);
1959 if (flags
& ECF_MAY_BE_ALLOCA
)
1960 cfun
->calls_alloca
= true;
1961 if (flags
& ECF_RETURNS_TWICE
)
1962 cfun
->calls_setjmp
= true;
1966 /* Clear flags set by notice_special_calls. Used by dead code removal
1967 to update the flags. */
1970 clear_special_calls (void)
1972 cfun
->calls_alloca
= false;
1973 cfun
->calls_setjmp
= false;
1976 /* Remove PHI nodes associated with basic block BB and all edges out of BB. */
1979 remove_phi_nodes_and_edges_for_unreachable_block (basic_block bb
)
1981 /* Since this block is no longer reachable, we can just delete all
1982 of its PHI nodes. */
1983 remove_phi_nodes (bb
);
1985 /* Remove edges to BB's successors. */
1986 while (EDGE_COUNT (bb
->succs
) > 0)
1987 remove_edge (EDGE_SUCC (bb
, 0));
1991 /* Remove statements of basic block BB. */
1994 remove_bb (basic_block bb
)
1996 gimple_stmt_iterator i
;
2000 fprintf (dump_file
, "Removing basic block %d\n", bb
->index
);
2001 if (dump_flags
& TDF_DETAILS
)
2003 dump_bb (dump_file
, bb
, 0, TDF_BLOCKS
);
2004 fprintf (dump_file
, "\n");
2010 struct loop
*loop
= bb
->loop_father
;
2012 /* If a loop gets removed, clean up the information associated
2014 if (loop
->latch
== bb
2015 || loop
->header
== bb
)
2016 free_numbers_of_iterations_estimates_loop (loop
);
2019 /* Remove all the instructions in the block. */
2020 if (bb_seq (bb
) != NULL
)
2022 /* Walk backwards so as to get a chance to substitute all
2023 released DEFs into debug stmts. See
2024 eliminate_unnecessary_stmts() in tree-ssa-dce.c for more
2026 for (i
= gsi_last_bb (bb
); !gsi_end_p (i
);)
2028 gimple stmt
= gsi_stmt (i
);
2029 if (gimple_code (stmt
) == GIMPLE_LABEL
2030 && (FORCED_LABEL (gimple_label_label (stmt
))
2031 || DECL_NONLOCAL (gimple_label_label (stmt
))))
2034 gimple_stmt_iterator new_gsi
;
2036 /* A non-reachable non-local label may still be referenced.
2037 But it no longer needs to carry the extra semantics of
2039 if (DECL_NONLOCAL (gimple_label_label (stmt
)))
2041 DECL_NONLOCAL (gimple_label_label (stmt
)) = 0;
2042 FORCED_LABEL (gimple_label_label (stmt
)) = 1;
2045 new_bb
= bb
->prev_bb
;
2046 new_gsi
= gsi_start_bb (new_bb
);
2047 gsi_remove (&i
, false);
2048 gsi_insert_before (&new_gsi
, stmt
, GSI_NEW_STMT
);
2052 /* Release SSA definitions if we are in SSA. Note that we
2053 may be called when not in SSA. For example,
2054 final_cleanup calls this function via
2055 cleanup_tree_cfg. */
2056 if (gimple_in_ssa_p (cfun
))
2057 release_defs (stmt
);
2059 gsi_remove (&i
, true);
2063 i
= gsi_last_bb (bb
);
2069 remove_phi_nodes_and_edges_for_unreachable_block (bb
);
2070 bb
->il
.gimple
.seq
= NULL
;
2071 bb
->il
.gimple
.phi_nodes
= NULL
;
2075 /* Given a basic block BB ending with COND_EXPR or SWITCH_EXPR, and a
2076 predicate VAL, return the edge that will be taken out of the block.
2077 If VAL does not match a unique edge, NULL is returned. */
2080 find_taken_edge (basic_block bb
, tree val
)
2084 stmt
= last_stmt (bb
);
2087 gcc_assert (is_ctrl_stmt (stmt
));
2092 if (!is_gimple_min_invariant (val
))
2095 if (gimple_code (stmt
) == GIMPLE_COND
)
2096 return find_taken_edge_cond_expr (bb
, val
);
2098 if (gimple_code (stmt
) == GIMPLE_SWITCH
)
2099 return find_taken_edge_switch_expr (bb
, val
);
2101 if (computed_goto_p (stmt
))
2103 /* Only optimize if the argument is a label, if the argument is
2104 not a label then we can not construct a proper CFG.
2106 It may be the case that we only need to allow the LABEL_REF to
2107 appear inside an ADDR_EXPR, but we also allow the LABEL_REF to
2108 appear inside a LABEL_EXPR just to be safe. */
2109 if ((TREE_CODE (val
) == ADDR_EXPR
|| TREE_CODE (val
) == LABEL_EXPR
)
2110 && TREE_CODE (TREE_OPERAND (val
, 0)) == LABEL_DECL
)
2111 return find_taken_edge_computed_goto (bb
, TREE_OPERAND (val
, 0));
2118 /* Given a constant value VAL and the entry block BB to a GOTO_EXPR
2119 statement, determine which of the outgoing edges will be taken out of the
2120 block. Return NULL if either edge may be taken. */
2123 find_taken_edge_computed_goto (basic_block bb
, tree val
)
2128 dest
= label_to_block (val
);
2131 e
= find_edge (bb
, dest
);
2132 gcc_assert (e
!= NULL
);
2138 /* Given a constant value VAL and the entry block BB to a COND_EXPR
2139 statement, determine which of the two edges will be taken out of the
2140 block. Return NULL if either edge may be taken. */
2143 find_taken_edge_cond_expr (basic_block bb
, tree val
)
2145 edge true_edge
, false_edge
;
2147 extract_true_false_edges_from_block (bb
, &true_edge
, &false_edge
);
2149 gcc_assert (TREE_CODE (val
) == INTEGER_CST
);
2150 return (integer_zerop (val
) ? false_edge
: true_edge
);
2153 /* Given an INTEGER_CST VAL and the entry block BB to a SWITCH_EXPR
2154 statement, determine which edge will be taken out of the block. Return
2155 NULL if any edge may be taken. */
2158 find_taken_edge_switch_expr (basic_block bb
, tree val
)
2160 basic_block dest_bb
;
2165 switch_stmt
= last_stmt (bb
);
2166 taken_case
= find_case_label_for_value (switch_stmt
, val
);
2167 dest_bb
= label_to_block (CASE_LABEL (taken_case
));
2169 e
= find_edge (bb
, dest_bb
);
2175 /* Return the CASE_LABEL_EXPR that SWITCH_STMT will take for VAL.
2176 We can make optimal use here of the fact that the case labels are
2177 sorted: We can do a binary search for a case matching VAL. */
2180 find_case_label_for_value (gimple switch_stmt
, tree val
)
2182 size_t low
, high
, n
= gimple_switch_num_labels (switch_stmt
);
2183 tree default_case
= gimple_switch_default_label (switch_stmt
);
2185 for (low
= 0, high
= n
; high
- low
> 1; )
2187 size_t i
= (high
+ low
) / 2;
2188 tree t
= gimple_switch_label (switch_stmt
, i
);
2191 /* Cache the result of comparing CASE_LOW and val. */
2192 cmp
= tree_int_cst_compare (CASE_LOW (t
), val
);
2199 if (CASE_HIGH (t
) == NULL
)
2201 /* A singe-valued case label. */
2207 /* A case range. We can only handle integer ranges. */
2208 if (cmp
<= 0 && tree_int_cst_compare (CASE_HIGH (t
), val
) >= 0)
2213 return default_case
;
2217 /* Dump a basic block on stderr. */
2220 gimple_debug_bb (basic_block bb
)
2222 dump_bb (stderr
, bb
, 0, TDF_VOPS
|TDF_MEMSYMS
|TDF_BLOCKS
);
2226 /* Dump basic block with index N on stderr. */
2229 gimple_debug_bb_n (int n
)
2231 gimple_debug_bb (BASIC_BLOCK_FOR_FN (cfun
, n
));
2232 return BASIC_BLOCK_FOR_FN (cfun
, n
);
2236 /* Dump the CFG on stderr.
2238 FLAGS are the same used by the tree dumping functions
2239 (see TDF_* in dumpfile.h). */
2242 gimple_debug_cfg (int flags
)
2244 gimple_dump_cfg (stderr
, flags
);
2248 /* Dump the program showing basic block boundaries on the given FILE.
2250 FLAGS are the same used by the tree dumping functions (see TDF_* in
2254 gimple_dump_cfg (FILE *file
, int flags
)
2256 if (flags
& TDF_DETAILS
)
2258 dump_function_header (file
, current_function_decl
, flags
);
2259 fprintf (file
, ";; \n%d basic blocks, %d edges, last basic block %d.\n\n",
2260 n_basic_blocks_for_fn (cfun
), n_edges_for_fn (cfun
),
2261 last_basic_block_for_fn (cfun
));
2263 brief_dump_cfg (file
, flags
| TDF_COMMENT
);
2264 fprintf (file
, "\n");
2267 if (flags
& TDF_STATS
)
2268 dump_cfg_stats (file
);
2270 dump_function_to_file (current_function_decl
, file
, flags
| TDF_BLOCKS
);
2274 /* Dump CFG statistics on FILE. */
2277 dump_cfg_stats (FILE *file
)
2279 static long max_num_merged_labels
= 0;
2280 unsigned long size
, total
= 0;
2283 const char * const fmt_str
= "%-30s%-13s%12s\n";
2284 const char * const fmt_str_1
= "%-30s%13d%11lu%c\n";
2285 const char * const fmt_str_2
= "%-30s%13ld%11lu%c\n";
2286 const char * const fmt_str_3
= "%-43s%11lu%c\n";
2287 const char *funcname
= current_function_name ();
2289 fprintf (file
, "\nCFG Statistics for %s\n\n", funcname
);
2291 fprintf (file
, "---------------------------------------------------------\n");
2292 fprintf (file
, fmt_str
, "", " Number of ", "Memory");
2293 fprintf (file
, fmt_str
, "", " instances ", "used ");
2294 fprintf (file
, "---------------------------------------------------------\n");
2296 size
= n_basic_blocks_for_fn (cfun
) * sizeof (struct basic_block_def
);
2298 fprintf (file
, fmt_str_1
, "Basic blocks", n_basic_blocks_for_fn (cfun
),
2299 SCALE (size
), LABEL (size
));
2302 FOR_EACH_BB_FN (bb
, cfun
)
2303 num_edges
+= EDGE_COUNT (bb
->succs
);
2304 size
= num_edges
* sizeof (struct edge_def
);
2306 fprintf (file
, fmt_str_2
, "Edges", num_edges
, SCALE (size
), LABEL (size
));
2308 fprintf (file
, "---------------------------------------------------------\n");
2309 fprintf (file
, fmt_str_3
, "Total memory used by CFG data", SCALE (total
),
2311 fprintf (file
, "---------------------------------------------------------\n");
2312 fprintf (file
, "\n");
2314 if (cfg_stats
.num_merged_labels
> max_num_merged_labels
)
2315 max_num_merged_labels
= cfg_stats
.num_merged_labels
;
2317 fprintf (file
, "Coalesced label blocks: %ld (Max so far: %ld)\n",
2318 cfg_stats
.num_merged_labels
, max_num_merged_labels
);
2320 fprintf (file
, "\n");
2324 /* Dump CFG statistics on stderr. Keep extern so that it's always
2325 linked in the final executable. */
2328 debug_cfg_stats (void)
2330 dump_cfg_stats (stderr
);
2333 /*---------------------------------------------------------------------------
2334 Miscellaneous helpers
2335 ---------------------------------------------------------------------------*/
2337 /* Return true if T, a GIMPLE_CALL, can make an abnormal transfer of control
2338 flow. Transfers of control flow associated with EH are excluded. */
2341 call_can_make_abnormal_goto (gimple t
)
2343 /* If the function has no non-local labels, then a call cannot make an
2344 abnormal transfer of control. */
2345 if (!cfun
->has_nonlocal_label
2346 && !cfun
->calls_setjmp
)
2349 /* Likewise if the call has no side effects. */
2350 if (!gimple_has_side_effects (t
))
2353 /* Likewise if the called function is leaf. */
2354 if (gimple_call_flags (t
) & ECF_LEAF
)
2361 /* Return true if T can make an abnormal transfer of control flow.
2362 Transfers of control flow associated with EH are excluded. */
2365 stmt_can_make_abnormal_goto (gimple t
)
2367 if (computed_goto_p (t
))
2369 if (is_gimple_call (t
))
2370 return call_can_make_abnormal_goto (t
);
2375 /* Return true if T represents a stmt that always transfers control. */
2378 is_ctrl_stmt (gimple t
)
2380 switch (gimple_code (t
))
2394 /* Return true if T is a statement that may alter the flow of control
2395 (e.g., a call to a non-returning function). */
2398 is_ctrl_altering_stmt (gimple t
)
2402 switch (gimple_code (t
))
2405 /* Per stmt call flag indicates whether the call could alter
2407 if (gimple_call_ctrl_altering_p (t
))
2411 case GIMPLE_EH_DISPATCH
:
2412 /* EH_DISPATCH branches to the individual catch handlers at
2413 this level of a try or allowed-exceptions region. It can
2414 fallthru to the next statement as well. */
2418 if (gimple_asm_nlabels (t
) > 0)
2423 /* OpenMP directives alter control flow. */
2426 case GIMPLE_TRANSACTION
:
2427 /* A transaction start alters control flow. */
2434 /* If a statement can throw, it alters control flow. */
2435 return stmt_can_throw_internal (t
);
2439 /* Return true if T is a simple local goto. */
2442 simple_goto_p (gimple t
)
2444 return (gimple_code (t
) == GIMPLE_GOTO
2445 && TREE_CODE (gimple_goto_dest (t
)) == LABEL_DECL
);
2449 /* Return true if STMT should start a new basic block. PREV_STMT is
2450 the statement preceding STMT. It is used when STMT is a label or a
2451 case label. Labels should only start a new basic block if their
2452 previous statement wasn't a label. Otherwise, sequence of labels
2453 would generate unnecessary basic blocks that only contain a single
2457 stmt_starts_bb_p (gimple stmt
, gimple prev_stmt
)
2462 /* Labels start a new basic block only if the preceding statement
2463 wasn't a label of the same type. This prevents the creation of
2464 consecutive blocks that have nothing but a single label. */
2465 if (gimple_code (stmt
) == GIMPLE_LABEL
)
2467 /* Nonlocal and computed GOTO targets always start a new block. */
2468 if (DECL_NONLOCAL (gimple_label_label (stmt
))
2469 || FORCED_LABEL (gimple_label_label (stmt
)))
2472 if (prev_stmt
&& gimple_code (prev_stmt
) == GIMPLE_LABEL
)
2474 if (DECL_NONLOCAL (gimple_label_label (prev_stmt
)))
2477 cfg_stats
.num_merged_labels
++;
2483 else if (gimple_code (stmt
) == GIMPLE_CALL
2484 && gimple_call_flags (stmt
) & ECF_RETURNS_TWICE
)
2485 /* setjmp acts similar to a nonlocal GOTO target and thus should
2486 start a new block. */
2493 /* Return true if T should end a basic block. */
2496 stmt_ends_bb_p (gimple t
)
2498 return is_ctrl_stmt (t
) || is_ctrl_altering_stmt (t
);
2501 /* Remove block annotations and other data structures. */
2504 delete_tree_cfg_annotations (void)
2506 vec_free (label_to_block_map_for_fn (cfun
));
2510 /* Return the first statement in basic block BB. */
2513 first_stmt (basic_block bb
)
2515 gimple_stmt_iterator i
= gsi_start_bb (bb
);
2518 while (!gsi_end_p (i
) && is_gimple_debug ((stmt
= gsi_stmt (i
))))
2526 /* Return the first non-label statement in basic block BB. */
2529 first_non_label_stmt (basic_block bb
)
2531 gimple_stmt_iterator i
= gsi_start_bb (bb
);
2532 while (!gsi_end_p (i
) && gimple_code (gsi_stmt (i
)) == GIMPLE_LABEL
)
2534 return !gsi_end_p (i
) ? gsi_stmt (i
) : NULL
;
2537 /* Return the last statement in basic block BB. */
2540 last_stmt (basic_block bb
)
2542 gimple_stmt_iterator i
= gsi_last_bb (bb
);
2545 while (!gsi_end_p (i
) && is_gimple_debug ((stmt
= gsi_stmt (i
))))
2553 /* Return the last statement of an otherwise empty block. Return NULL
2554 if the block is totally empty, or if it contains more than one
2558 last_and_only_stmt (basic_block bb
)
2560 gimple_stmt_iterator i
= gsi_last_nondebug_bb (bb
);
2566 last
= gsi_stmt (i
);
2567 gsi_prev_nondebug (&i
);
2571 /* Empty statements should no longer appear in the instruction stream.
2572 Everything that might have appeared before should be deleted by
2573 remove_useless_stmts, and the optimizers should just gsi_remove
2574 instead of smashing with build_empty_stmt.
2576 Thus the only thing that should appear here in a block containing
2577 one executable statement is a label. */
2578 prev
= gsi_stmt (i
);
2579 if (gimple_code (prev
) == GIMPLE_LABEL
)
2585 /* Reinstall those PHI arguments queued in OLD_EDGE to NEW_EDGE. */
2588 reinstall_phi_args (edge new_edge
, edge old_edge
)
2592 gimple_stmt_iterator phis
;
2594 vec
<edge_var_map
> *v
= redirect_edge_var_map_vector (old_edge
);
2598 for (i
= 0, phis
= gsi_start_phis (new_edge
->dest
);
2599 v
->iterate (i
, &vm
) && !gsi_end_p (phis
);
2600 i
++, gsi_next (&phis
))
2602 gimple phi
= gsi_stmt (phis
);
2603 tree result
= redirect_edge_var_map_result (vm
);
2604 tree arg
= redirect_edge_var_map_def (vm
);
2606 gcc_assert (result
== gimple_phi_result (phi
));
2608 add_phi_arg (phi
, arg
, new_edge
, redirect_edge_var_map_location (vm
));
2611 redirect_edge_var_map_clear (old_edge
);
2614 /* Returns the basic block after which the new basic block created
2615 by splitting edge EDGE_IN should be placed. Tries to keep the new block
2616 near its "logical" location. This is of most help to humans looking
2617 at debugging dumps. */
2620 split_edge_bb_loc (edge edge_in
)
2622 basic_block dest
= edge_in
->dest
;
2623 basic_block dest_prev
= dest
->prev_bb
;
2627 edge e
= find_edge (dest_prev
, dest
);
2628 if (e
&& !(e
->flags
& EDGE_COMPLEX
))
2629 return edge_in
->src
;
2634 /* Split a (typically critical) edge EDGE_IN. Return the new block.
2635 Abort on abnormal edges. */
2638 gimple_split_edge (edge edge_in
)
2640 basic_block new_bb
, after_bb
, dest
;
2643 /* Abnormal edges cannot be split. */
2644 gcc_assert (!(edge_in
->flags
& EDGE_ABNORMAL
));
2646 dest
= edge_in
->dest
;
2648 after_bb
= split_edge_bb_loc (edge_in
);
2650 new_bb
= create_empty_bb (after_bb
);
2651 new_bb
->frequency
= EDGE_FREQUENCY (edge_in
);
2652 new_bb
->count
= edge_in
->count
;
2653 new_edge
= make_edge (new_bb
, dest
, EDGE_FALLTHRU
);
2654 new_edge
->probability
= REG_BR_PROB_BASE
;
2655 new_edge
->count
= edge_in
->count
;
2657 e
= redirect_edge_and_branch (edge_in
, new_bb
);
2658 gcc_assert (e
== edge_in
);
2659 reinstall_phi_args (new_edge
, e
);
2665 /* Verify properties of the address expression T with base object BASE. */
2668 verify_address (tree t
, tree base
)
2671 bool old_side_effects
;
2673 bool new_side_effects
;
2675 old_constant
= TREE_CONSTANT (t
);
2676 old_side_effects
= TREE_SIDE_EFFECTS (t
);
2678 recompute_tree_invariant_for_addr_expr (t
);
2679 new_side_effects
= TREE_SIDE_EFFECTS (t
);
2680 new_constant
= TREE_CONSTANT (t
);
2682 if (old_constant
!= new_constant
)
2684 error ("constant not recomputed when ADDR_EXPR changed");
2687 if (old_side_effects
!= new_side_effects
)
2689 error ("side effects not recomputed when ADDR_EXPR changed");
2693 if (!(TREE_CODE (base
) == VAR_DECL
2694 || TREE_CODE (base
) == PARM_DECL
2695 || TREE_CODE (base
) == RESULT_DECL
))
2698 if (DECL_GIMPLE_REG_P (base
))
2700 error ("DECL_GIMPLE_REG_P set on a variable with address taken");
2707 /* Callback for walk_tree, check that all elements with address taken are
2708 properly noticed as such. The DATA is an int* that is 1 if TP was seen
2709 inside a PHI node. */
2712 verify_expr (tree
*tp
, int *walk_subtrees
, void *data ATTRIBUTE_UNUSED
)
2719 /* Check operand N for being valid GIMPLE and give error MSG if not. */
2720 #define CHECK_OP(N, MSG) \
2721 do { if (!is_gimple_val (TREE_OPERAND (t, N))) \
2722 { error (MSG); return TREE_OPERAND (t, N); }} while (0)
2724 switch (TREE_CODE (t
))
2727 if (SSA_NAME_IN_FREE_LIST (t
))
2729 error ("SSA name in freelist but still referenced");
2735 error ("INDIRECT_REF in gimple IL");
2739 x
= TREE_OPERAND (t
, 0);
2740 if (!POINTER_TYPE_P (TREE_TYPE (x
))
2741 || !is_gimple_mem_ref_addr (x
))
2743 error ("invalid first operand of MEM_REF");
2746 if (TREE_CODE (TREE_OPERAND (t
, 1)) != INTEGER_CST
2747 || !POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (t
, 1))))
2749 error ("invalid offset operand of MEM_REF");
2750 return TREE_OPERAND (t
, 1);
2752 if (TREE_CODE (x
) == ADDR_EXPR
2753 && (x
= verify_address (x
, TREE_OPERAND (x
, 0))))
2759 x
= fold (ASSERT_EXPR_COND (t
));
2760 if (x
== boolean_false_node
)
2762 error ("ASSERT_EXPR with an always-false condition");
2768 error ("MODIFY_EXPR not expected while having tuples");
2775 gcc_assert (is_gimple_address (t
));
2777 /* Skip any references (they will be checked when we recurse down the
2778 tree) and ensure that any variable used as a prefix is marked
2780 for (x
= TREE_OPERAND (t
, 0);
2781 handled_component_p (x
);
2782 x
= TREE_OPERAND (x
, 0))
2785 if ((tem
= verify_address (t
, x
)))
2788 if (!(TREE_CODE (x
) == VAR_DECL
2789 || TREE_CODE (x
) == PARM_DECL
2790 || TREE_CODE (x
) == RESULT_DECL
))
2793 if (!TREE_ADDRESSABLE (x
))
2795 error ("address taken, but ADDRESSABLE bit not set");
2803 x
= COND_EXPR_COND (t
);
2804 if (!INTEGRAL_TYPE_P (TREE_TYPE (x
)))
2806 error ("non-integral used in condition");
2809 if (!is_gimple_condexpr (x
))
2811 error ("invalid conditional operand");
2816 case NON_LVALUE_EXPR
:
2817 case TRUTH_NOT_EXPR
:
2821 case FIX_TRUNC_EXPR
:
2826 CHECK_OP (0, "invalid operand to unary operator");
2832 if (!is_gimple_reg_type (TREE_TYPE (t
)))
2834 error ("non-scalar BIT_FIELD_REF, IMAGPART_EXPR or REALPART_EXPR");
2838 if (TREE_CODE (t
) == BIT_FIELD_REF
)
2840 tree t0
= TREE_OPERAND (t
, 0);
2841 tree t1
= TREE_OPERAND (t
, 1);
2842 tree t2
= TREE_OPERAND (t
, 2);
2843 if (!tree_fits_uhwi_p (t1
)
2844 || !tree_fits_uhwi_p (t2
))
2846 error ("invalid position or size operand to BIT_FIELD_REF");
2849 if (INTEGRAL_TYPE_P (TREE_TYPE (t
))
2850 && (TYPE_PRECISION (TREE_TYPE (t
))
2851 != tree_to_uhwi (t1
)))
2853 error ("integral result type precision does not match "
2854 "field size of BIT_FIELD_REF");
2857 else if (!INTEGRAL_TYPE_P (TREE_TYPE (t
))
2858 && TYPE_MODE (TREE_TYPE (t
)) != BLKmode
2859 && (GET_MODE_PRECISION (TYPE_MODE (TREE_TYPE (t
)))
2860 != tree_to_uhwi (t1
)))
2862 error ("mode precision of non-integral result does not "
2863 "match field size of BIT_FIELD_REF");
2866 if (!AGGREGATE_TYPE_P (TREE_TYPE (t0
))
2867 && (tree_to_uhwi (t1
) + tree_to_uhwi (t2
)
2868 > tree_to_uhwi (TYPE_SIZE (TREE_TYPE (t0
)))))
2870 error ("position plus size exceeds size of referenced object in "
2875 t
= TREE_OPERAND (t
, 0);
2880 case ARRAY_RANGE_REF
:
2881 case VIEW_CONVERT_EXPR
:
2882 /* We have a nest of references. Verify that each of the operands
2883 that determine where to reference is either a constant or a variable,
2884 verify that the base is valid, and then show we've already checked
2886 while (handled_component_p (t
))
2888 if (TREE_CODE (t
) == COMPONENT_REF
&& TREE_OPERAND (t
, 2))
2889 CHECK_OP (2, "invalid COMPONENT_REF offset operator");
2890 else if (TREE_CODE (t
) == ARRAY_REF
2891 || TREE_CODE (t
) == ARRAY_RANGE_REF
)
2893 CHECK_OP (1, "invalid array index");
2894 if (TREE_OPERAND (t
, 2))
2895 CHECK_OP (2, "invalid array lower bound");
2896 if (TREE_OPERAND (t
, 3))
2897 CHECK_OP (3, "invalid array stride");
2899 else if (TREE_CODE (t
) == BIT_FIELD_REF
2900 || TREE_CODE (t
) == REALPART_EXPR
2901 || TREE_CODE (t
) == IMAGPART_EXPR
)
2903 error ("non-top-level BIT_FIELD_REF, IMAGPART_EXPR or "
2908 t
= TREE_OPERAND (t
, 0);
2911 if (!is_gimple_min_invariant (t
) && !is_gimple_lvalue (t
))
2913 error ("invalid reference prefix");
2920 /* PLUS_EXPR and MINUS_EXPR don't work on pointers, they should be done using
2921 POINTER_PLUS_EXPR. */
2922 if (POINTER_TYPE_P (TREE_TYPE (t
)))
2924 error ("invalid operand to plus/minus, type is a pointer");
2927 CHECK_OP (0, "invalid operand to binary operator");
2928 CHECK_OP (1, "invalid operand to binary operator");
2931 case POINTER_PLUS_EXPR
:
2932 /* Check to make sure the first operand is a pointer or reference type. */
2933 if (!POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (t
, 0))))
2935 error ("invalid operand to pointer plus, first operand is not a pointer");
2938 /* Check to make sure the second operand is a ptrofftype. */
2939 if (!ptrofftype_p (TREE_TYPE (TREE_OPERAND (t
, 1))))
2941 error ("invalid operand to pointer plus, second operand is not an "
2942 "integer type of appropriate width");
2952 case UNORDERED_EXPR
:
2961 case TRUNC_DIV_EXPR
:
2963 case FLOOR_DIV_EXPR
:
2964 case ROUND_DIV_EXPR
:
2965 case TRUNC_MOD_EXPR
:
2967 case FLOOR_MOD_EXPR
:
2968 case ROUND_MOD_EXPR
:
2970 case EXACT_DIV_EXPR
:
2980 CHECK_OP (0, "invalid operand to binary operator");
2981 CHECK_OP (1, "invalid operand to binary operator");
2985 if (TREE_CONSTANT (t
) && TREE_CODE (TREE_TYPE (t
)) == VECTOR_TYPE
)
2989 case CASE_LABEL_EXPR
:
2992 error ("invalid CASE_CHAIN");
3006 /* Verify if EXPR is either a GIMPLE ID or a GIMPLE indirect reference.
3007 Returns true if there is an error, otherwise false. */
3010 verify_types_in_gimple_min_lval (tree expr
)
3014 if (is_gimple_id (expr
))
3017 if (TREE_CODE (expr
) != TARGET_MEM_REF
3018 && TREE_CODE (expr
) != MEM_REF
)
3020 error ("invalid expression for min lvalue");
3024 /* TARGET_MEM_REFs are strange beasts. */
3025 if (TREE_CODE (expr
) == TARGET_MEM_REF
)
3028 op
= TREE_OPERAND (expr
, 0);
3029 if (!is_gimple_val (op
))
3031 error ("invalid operand in indirect reference");
3032 debug_generic_stmt (op
);
3035 /* Memory references now generally can involve a value conversion. */
3040 /* Verify if EXPR is a valid GIMPLE reference expression. If
3041 REQUIRE_LVALUE is true verifies it is an lvalue. Returns true
3042 if there is an error, otherwise false. */
3045 verify_types_in_gimple_reference (tree expr
, bool require_lvalue
)
3047 while (handled_component_p (expr
))
3049 tree op
= TREE_OPERAND (expr
, 0);
3051 if (TREE_CODE (expr
) == ARRAY_REF
3052 || TREE_CODE (expr
) == ARRAY_RANGE_REF
)
3054 if (!is_gimple_val (TREE_OPERAND (expr
, 1))
3055 || (TREE_OPERAND (expr
, 2)
3056 && !is_gimple_val (TREE_OPERAND (expr
, 2)))
3057 || (TREE_OPERAND (expr
, 3)
3058 && !is_gimple_val (TREE_OPERAND (expr
, 3))))
3060 error ("invalid operands to array reference");
3061 debug_generic_stmt (expr
);
3066 /* Verify if the reference array element types are compatible. */
3067 if (TREE_CODE (expr
) == ARRAY_REF
3068 && !useless_type_conversion_p (TREE_TYPE (expr
),
3069 TREE_TYPE (TREE_TYPE (op
))))
3071 error ("type mismatch in array reference");
3072 debug_generic_stmt (TREE_TYPE (expr
));
3073 debug_generic_stmt (TREE_TYPE (TREE_TYPE (op
)));
3076 if (TREE_CODE (expr
) == ARRAY_RANGE_REF
3077 && !useless_type_conversion_p (TREE_TYPE (TREE_TYPE (expr
)),
3078 TREE_TYPE (TREE_TYPE (op
))))
3080 error ("type mismatch in array range reference");
3081 debug_generic_stmt (TREE_TYPE (TREE_TYPE (expr
)));
3082 debug_generic_stmt (TREE_TYPE (TREE_TYPE (op
)));
3086 if ((TREE_CODE (expr
) == REALPART_EXPR
3087 || TREE_CODE (expr
) == IMAGPART_EXPR
)
3088 && !useless_type_conversion_p (TREE_TYPE (expr
),
3089 TREE_TYPE (TREE_TYPE (op
))))
3091 error ("type mismatch in real/imagpart reference");
3092 debug_generic_stmt (TREE_TYPE (expr
));
3093 debug_generic_stmt (TREE_TYPE (TREE_TYPE (op
)));
3097 if (TREE_CODE (expr
) == COMPONENT_REF
3098 && !useless_type_conversion_p (TREE_TYPE (expr
),
3099 TREE_TYPE (TREE_OPERAND (expr
, 1))))
3101 error ("type mismatch in component reference");
3102 debug_generic_stmt (TREE_TYPE (expr
));
3103 debug_generic_stmt (TREE_TYPE (TREE_OPERAND (expr
, 1)));
3107 if (TREE_CODE (expr
) == VIEW_CONVERT_EXPR
)
3109 /* For VIEW_CONVERT_EXPRs which are allowed here too, we only check
3110 that their operand is not an SSA name or an invariant when
3111 requiring an lvalue (this usually means there is a SRA or IPA-SRA
3112 bug). Otherwise there is nothing to verify, gross mismatches at
3113 most invoke undefined behavior. */
3115 && (TREE_CODE (op
) == SSA_NAME
3116 || is_gimple_min_invariant (op
)))
3118 error ("conversion of an SSA_NAME on the left hand side");
3119 debug_generic_stmt (expr
);
3122 else if (TREE_CODE (op
) == SSA_NAME
3123 && TYPE_SIZE (TREE_TYPE (expr
)) != TYPE_SIZE (TREE_TYPE (op
)))
3125 error ("conversion of register to a different size");
3126 debug_generic_stmt (expr
);
3129 else if (!handled_component_p (op
))
3136 if (TREE_CODE (expr
) == MEM_REF
)
3138 if (!is_gimple_mem_ref_addr (TREE_OPERAND (expr
, 0)))
3140 error ("invalid address operand in MEM_REF");
3141 debug_generic_stmt (expr
);
3144 if (TREE_CODE (TREE_OPERAND (expr
, 1)) != INTEGER_CST
3145 || !POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (expr
, 1))))
3147 error ("invalid offset operand in MEM_REF");
3148 debug_generic_stmt (expr
);
3152 else if (TREE_CODE (expr
) == TARGET_MEM_REF
)
3154 if (!TMR_BASE (expr
)
3155 || !is_gimple_mem_ref_addr (TMR_BASE (expr
)))
3157 error ("invalid address operand in TARGET_MEM_REF");
3160 if (!TMR_OFFSET (expr
)
3161 || TREE_CODE (TMR_OFFSET (expr
)) != INTEGER_CST
3162 || !POINTER_TYPE_P (TREE_TYPE (TMR_OFFSET (expr
))))
3164 error ("invalid offset operand in TARGET_MEM_REF");
3165 debug_generic_stmt (expr
);
3170 return ((require_lvalue
|| !is_gimple_min_invariant (expr
))
3171 && verify_types_in_gimple_min_lval (expr
));
3174 /* Returns true if there is one pointer type in TYPE_POINTER_TO (SRC_OBJ)
3175 list of pointer-to types that is trivially convertible to DEST. */
3178 one_pointer_to_useless_type_conversion_p (tree dest
, tree src_obj
)
3182 if (!TYPE_POINTER_TO (src_obj
))
3185 for (src
= TYPE_POINTER_TO (src_obj
); src
; src
= TYPE_NEXT_PTR_TO (src
))
3186 if (useless_type_conversion_p (dest
, src
))
3192 /* Return true if TYPE1 is a fixed-point type and if conversions to and
3193 from TYPE2 can be handled by FIXED_CONVERT_EXPR. */
3196 valid_fixed_convert_types_p (tree type1
, tree type2
)
3198 return (FIXED_POINT_TYPE_P (type1
)
3199 && (INTEGRAL_TYPE_P (type2
)
3200 || SCALAR_FLOAT_TYPE_P (type2
)
3201 || FIXED_POINT_TYPE_P (type2
)));
3204 /* Verify the contents of a GIMPLE_CALL STMT. Returns true when there
3205 is a problem, otherwise false. */
3208 verify_gimple_call (gimple stmt
)
3210 tree fn
= gimple_call_fn (stmt
);
3211 tree fntype
, fndecl
;
3214 if (gimple_call_internal_p (stmt
))
3218 error ("gimple call has two targets");
3219 debug_generic_stmt (fn
);
3227 error ("gimple call has no target");
3232 if (fn
&& !is_gimple_call_addr (fn
))
3234 error ("invalid function in gimple call");
3235 debug_generic_stmt (fn
);
3240 && (!POINTER_TYPE_P (TREE_TYPE (fn
))
3241 || (TREE_CODE (TREE_TYPE (TREE_TYPE (fn
))) != FUNCTION_TYPE
3242 && TREE_CODE (TREE_TYPE (TREE_TYPE (fn
))) != METHOD_TYPE
)))
3244 error ("non-function in gimple call");
3248 fndecl
= gimple_call_fndecl (stmt
);
3250 && TREE_CODE (fndecl
) == FUNCTION_DECL
3251 && DECL_LOOPING_CONST_OR_PURE_P (fndecl
)
3252 && !DECL_PURE_P (fndecl
)
3253 && !TREE_READONLY (fndecl
))
3255 error ("invalid pure const state for function");
3259 if (gimple_call_lhs (stmt
)
3260 && (!is_gimple_lvalue (gimple_call_lhs (stmt
))
3261 || verify_types_in_gimple_reference (gimple_call_lhs (stmt
), true)))
3263 error ("invalid LHS in gimple call");
3267 if (gimple_call_lhs (stmt
) && gimple_call_noreturn_p (stmt
))
3269 error ("LHS in noreturn call");
3273 fntype
= gimple_call_fntype (stmt
);
3275 && gimple_call_lhs (stmt
)
3276 && !useless_type_conversion_p (TREE_TYPE (gimple_call_lhs (stmt
)),
3278 /* ??? At least C++ misses conversions at assignments from
3279 void * call results.
3280 ??? Java is completely off. Especially with functions
3281 returning java.lang.Object.
3282 For now simply allow arbitrary pointer type conversions. */
3283 && !(POINTER_TYPE_P (TREE_TYPE (gimple_call_lhs (stmt
)))
3284 && POINTER_TYPE_P (TREE_TYPE (fntype
))))
3286 error ("invalid conversion in gimple call");
3287 debug_generic_stmt (TREE_TYPE (gimple_call_lhs (stmt
)));
3288 debug_generic_stmt (TREE_TYPE (fntype
));
3292 if (gimple_call_chain (stmt
)
3293 && !is_gimple_val (gimple_call_chain (stmt
)))
3295 error ("invalid static chain in gimple call");
3296 debug_generic_stmt (gimple_call_chain (stmt
));
3300 /* If there is a static chain argument, this should not be an indirect
3301 call, and the decl should have DECL_STATIC_CHAIN set. */
3302 if (gimple_call_chain (stmt
))
3304 if (!gimple_call_fndecl (stmt
))
3306 error ("static chain in indirect gimple call");
3309 fn
= TREE_OPERAND (fn
, 0);
3311 if (!DECL_STATIC_CHAIN (fn
))
3313 error ("static chain with function that doesn%'t use one");
3318 /* ??? The C frontend passes unpromoted arguments in case it
3319 didn't see a function declaration before the call. So for now
3320 leave the call arguments mostly unverified. Once we gimplify
3321 unit-at-a-time we have a chance to fix this. */
3323 for (i
= 0; i
< gimple_call_num_args (stmt
); ++i
)
3325 tree arg
= gimple_call_arg (stmt
, i
);
3326 if ((is_gimple_reg_type (TREE_TYPE (arg
))
3327 && !is_gimple_val (arg
))
3328 || (!is_gimple_reg_type (TREE_TYPE (arg
))
3329 && !is_gimple_lvalue (arg
)))
3331 error ("invalid argument to gimple call");
3332 debug_generic_expr (arg
);
3340 /* Verifies the gimple comparison with the result type TYPE and
3341 the operands OP0 and OP1. */
3344 verify_gimple_comparison (tree type
, tree op0
, tree op1
)
3346 tree op0_type
= TREE_TYPE (op0
);
3347 tree op1_type
= TREE_TYPE (op1
);
3349 if (!is_gimple_val (op0
) || !is_gimple_val (op1
))
3351 error ("invalid operands in gimple comparison");
3355 /* For comparisons we do not have the operations type as the
3356 effective type the comparison is carried out in. Instead
3357 we require that either the first operand is trivially
3358 convertible into the second, or the other way around.
3359 Because we special-case pointers to void we allow
3360 comparisons of pointers with the same mode as well. */
3361 if (!useless_type_conversion_p (op0_type
, op1_type
)
3362 && !useless_type_conversion_p (op1_type
, op0_type
)
3363 && (!POINTER_TYPE_P (op0_type
)
3364 || !POINTER_TYPE_P (op1_type
)
3365 || TYPE_MODE (op0_type
) != TYPE_MODE (op1_type
)))
3367 error ("mismatching comparison operand types");
3368 debug_generic_expr (op0_type
);
3369 debug_generic_expr (op1_type
);
3373 /* The resulting type of a comparison may be an effective boolean type. */
3374 if (INTEGRAL_TYPE_P (type
)
3375 && (TREE_CODE (type
) == BOOLEAN_TYPE
3376 || TYPE_PRECISION (type
) == 1))
3378 if (TREE_CODE (op0_type
) == VECTOR_TYPE
3379 || TREE_CODE (op1_type
) == VECTOR_TYPE
)
3381 error ("vector comparison returning a boolean");
3382 debug_generic_expr (op0_type
);
3383 debug_generic_expr (op1_type
);
3387 /* Or an integer vector type with the same size and element count
3388 as the comparison operand types. */
3389 else if (TREE_CODE (type
) == VECTOR_TYPE
3390 && TREE_CODE (TREE_TYPE (type
)) == INTEGER_TYPE
)
3392 if (TREE_CODE (op0_type
) != VECTOR_TYPE
3393 || TREE_CODE (op1_type
) != VECTOR_TYPE
)
3395 error ("non-vector operands in vector comparison");
3396 debug_generic_expr (op0_type
);
3397 debug_generic_expr (op1_type
);
3401 if (TYPE_VECTOR_SUBPARTS (type
) != TYPE_VECTOR_SUBPARTS (op0_type
)
3402 || (GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (type
)))
3403 != GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (op0_type
))))
3404 /* The result of a vector comparison is of signed
3406 || TYPE_UNSIGNED (TREE_TYPE (type
)))
3408 error ("invalid vector comparison resulting type");
3409 debug_generic_expr (type
);
3415 error ("bogus comparison result type");
3416 debug_generic_expr (type
);
3423 /* Verify a gimple assignment statement STMT with an unary rhs.
3424 Returns true if anything is wrong. */
3427 verify_gimple_assign_unary (gimple stmt
)
3429 enum tree_code rhs_code
= gimple_assign_rhs_code (stmt
);
3430 tree lhs
= gimple_assign_lhs (stmt
);
3431 tree lhs_type
= TREE_TYPE (lhs
);
3432 tree rhs1
= gimple_assign_rhs1 (stmt
);
3433 tree rhs1_type
= TREE_TYPE (rhs1
);
3435 if (!is_gimple_reg (lhs
))
3437 error ("non-register as LHS of unary operation");
3441 if (!is_gimple_val (rhs1
))
3443 error ("invalid operand in unary operation");
3447 /* First handle conversions. */
3452 /* Allow conversions from pointer type to integral type only if
3453 there is no sign or zero extension involved.
3454 For targets were the precision of ptrofftype doesn't match that
3455 of pointers we need to allow arbitrary conversions to ptrofftype. */
3456 if ((POINTER_TYPE_P (lhs_type
)
3457 && INTEGRAL_TYPE_P (rhs1_type
))
3458 || (POINTER_TYPE_P (rhs1_type
)
3459 && INTEGRAL_TYPE_P (lhs_type
)
3460 && (TYPE_PRECISION (rhs1_type
) >= TYPE_PRECISION (lhs_type
)
3461 || ptrofftype_p (sizetype
))))
3464 /* Allow conversion from integral to offset type and vice versa. */
3465 if ((TREE_CODE (lhs_type
) == OFFSET_TYPE
3466 && INTEGRAL_TYPE_P (rhs1_type
))
3467 || (INTEGRAL_TYPE_P (lhs_type
)
3468 && TREE_CODE (rhs1_type
) == OFFSET_TYPE
))
3471 /* Otherwise assert we are converting between types of the
3473 if (INTEGRAL_TYPE_P (lhs_type
) != INTEGRAL_TYPE_P (rhs1_type
))
3475 error ("invalid types in nop conversion");
3476 debug_generic_expr (lhs_type
);
3477 debug_generic_expr (rhs1_type
);
3484 case ADDR_SPACE_CONVERT_EXPR
:
3486 if (!POINTER_TYPE_P (rhs1_type
) || !POINTER_TYPE_P (lhs_type
)
3487 || (TYPE_ADDR_SPACE (TREE_TYPE (rhs1_type
))
3488 == TYPE_ADDR_SPACE (TREE_TYPE (lhs_type
))))
3490 error ("invalid types in address space conversion");
3491 debug_generic_expr (lhs_type
);
3492 debug_generic_expr (rhs1_type
);
3499 case FIXED_CONVERT_EXPR
:
3501 if (!valid_fixed_convert_types_p (lhs_type
, rhs1_type
)
3502 && !valid_fixed_convert_types_p (rhs1_type
, lhs_type
))
3504 error ("invalid types in fixed-point conversion");
3505 debug_generic_expr (lhs_type
);
3506 debug_generic_expr (rhs1_type
);
3515 if ((!INTEGRAL_TYPE_P (rhs1_type
) || !SCALAR_FLOAT_TYPE_P (lhs_type
))
3516 && (!VECTOR_INTEGER_TYPE_P (rhs1_type
)
3517 || !VECTOR_FLOAT_TYPE_P (lhs_type
)))
3519 error ("invalid types in conversion to floating point");
3520 debug_generic_expr (lhs_type
);
3521 debug_generic_expr (rhs1_type
);
3528 case FIX_TRUNC_EXPR
:
3530 if ((!INTEGRAL_TYPE_P (lhs_type
) || !SCALAR_FLOAT_TYPE_P (rhs1_type
))
3531 && (!VECTOR_INTEGER_TYPE_P (lhs_type
)
3532 || !VECTOR_FLOAT_TYPE_P (rhs1_type
)))
3534 error ("invalid types in conversion to integer");
3535 debug_generic_expr (lhs_type
);
3536 debug_generic_expr (rhs1_type
);
3543 case VEC_UNPACK_HI_EXPR
:
3544 case VEC_UNPACK_LO_EXPR
:
3545 case REDUC_MAX_EXPR
:
3546 case REDUC_MIN_EXPR
:
3547 case REDUC_PLUS_EXPR
:
3548 case VEC_UNPACK_FLOAT_HI_EXPR
:
3549 case VEC_UNPACK_FLOAT_LO_EXPR
:
3557 case NON_LVALUE_EXPR
:
3565 /* For the remaining codes assert there is no conversion involved. */
3566 if (!useless_type_conversion_p (lhs_type
, rhs1_type
))
3568 error ("non-trivial conversion in unary operation");
3569 debug_generic_expr (lhs_type
);
3570 debug_generic_expr (rhs1_type
);
3577 /* Verify a gimple assignment statement STMT with a binary rhs.
3578 Returns true if anything is wrong. */
3581 verify_gimple_assign_binary (gimple stmt
)
3583 enum tree_code rhs_code
= gimple_assign_rhs_code (stmt
);
3584 tree lhs
= gimple_assign_lhs (stmt
);
3585 tree lhs_type
= TREE_TYPE (lhs
);
3586 tree rhs1
= gimple_assign_rhs1 (stmt
);
3587 tree rhs1_type
= TREE_TYPE (rhs1
);
3588 tree rhs2
= gimple_assign_rhs2 (stmt
);
3589 tree rhs2_type
= TREE_TYPE (rhs2
);
3591 if (!is_gimple_reg (lhs
))
3593 error ("non-register as LHS of binary operation");
3597 if (!is_gimple_val (rhs1
)
3598 || !is_gimple_val (rhs2
))
3600 error ("invalid operands in binary operation");
3604 /* First handle operations that involve different types. */
3609 if (TREE_CODE (lhs_type
) != COMPLEX_TYPE
3610 || !(INTEGRAL_TYPE_P (rhs1_type
)
3611 || SCALAR_FLOAT_TYPE_P (rhs1_type
))
3612 || !(INTEGRAL_TYPE_P (rhs2_type
)
3613 || SCALAR_FLOAT_TYPE_P (rhs2_type
)))
3615 error ("type mismatch in complex expression");
3616 debug_generic_expr (lhs_type
);
3617 debug_generic_expr (rhs1_type
);
3618 debug_generic_expr (rhs2_type
);
3630 /* Shifts and rotates are ok on integral types, fixed point
3631 types and integer vector types. */
3632 if ((!INTEGRAL_TYPE_P (rhs1_type
)
3633 && !FIXED_POINT_TYPE_P (rhs1_type
)
3634 && !(TREE_CODE (rhs1_type
) == VECTOR_TYPE
3635 && INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type
))))
3636 || (!INTEGRAL_TYPE_P (rhs2_type
)
3637 /* Vector shifts of vectors are also ok. */
3638 && !(TREE_CODE (rhs1_type
) == VECTOR_TYPE
3639 && INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type
))
3640 && TREE_CODE (rhs2_type
) == VECTOR_TYPE
3641 && INTEGRAL_TYPE_P (TREE_TYPE (rhs2_type
))))
3642 || !useless_type_conversion_p (lhs_type
, rhs1_type
))
3644 error ("type mismatch in shift expression");
3645 debug_generic_expr (lhs_type
);
3646 debug_generic_expr (rhs1_type
);
3647 debug_generic_expr (rhs2_type
);
3654 case VEC_LSHIFT_EXPR
:
3655 case VEC_RSHIFT_EXPR
:
3657 if (TREE_CODE (rhs1_type
) != VECTOR_TYPE
3658 || !(INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type
))
3659 || POINTER_TYPE_P (TREE_TYPE (rhs1_type
))
3660 || FIXED_POINT_TYPE_P (TREE_TYPE (rhs1_type
))
3661 || SCALAR_FLOAT_TYPE_P (TREE_TYPE (rhs1_type
)))
3662 || (!INTEGRAL_TYPE_P (rhs2_type
)
3663 && (TREE_CODE (rhs2_type
) != VECTOR_TYPE
3664 || !INTEGRAL_TYPE_P (TREE_TYPE (rhs2_type
))))
3665 || !useless_type_conversion_p (lhs_type
, rhs1_type
))
3667 error ("type mismatch in vector shift expression");
3668 debug_generic_expr (lhs_type
);
3669 debug_generic_expr (rhs1_type
);
3670 debug_generic_expr (rhs2_type
);
3673 /* For shifting a vector of non-integral components we
3674 only allow shifting by a constant multiple of the element size. */
3675 if (!INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type
))
3676 && (TREE_CODE (rhs2
) != INTEGER_CST
3677 || !div_if_zero_remainder (rhs2
,
3678 TYPE_SIZE (TREE_TYPE (rhs1_type
)))))
3680 error ("non-element sized vector shift of floating point vector");
3687 case WIDEN_LSHIFT_EXPR
:
3689 if (!INTEGRAL_TYPE_P (lhs_type
)
3690 || !INTEGRAL_TYPE_P (rhs1_type
)
3691 || TREE_CODE (rhs2
) != INTEGER_CST
3692 || (2 * TYPE_PRECISION (rhs1_type
) > TYPE_PRECISION (lhs_type
)))
3694 error ("type mismatch in widening vector shift expression");
3695 debug_generic_expr (lhs_type
);
3696 debug_generic_expr (rhs1_type
);
3697 debug_generic_expr (rhs2_type
);
3704 case VEC_WIDEN_LSHIFT_HI_EXPR
:
3705 case VEC_WIDEN_LSHIFT_LO_EXPR
:
3707 if (TREE_CODE (rhs1_type
) != VECTOR_TYPE
3708 || TREE_CODE (lhs_type
) != VECTOR_TYPE
3709 || !INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type
))
3710 || !INTEGRAL_TYPE_P (TREE_TYPE (lhs_type
))
3711 || TREE_CODE (rhs2
) != INTEGER_CST
3712 || (2 * TYPE_PRECISION (TREE_TYPE (rhs1_type
))
3713 > TYPE_PRECISION (TREE_TYPE (lhs_type
))))
3715 error ("type mismatch in widening vector shift expression");
3716 debug_generic_expr (lhs_type
);
3717 debug_generic_expr (rhs1_type
);
3718 debug_generic_expr (rhs2_type
);
3728 tree lhs_etype
= lhs_type
;
3729 tree rhs1_etype
= rhs1_type
;
3730 tree rhs2_etype
= rhs2_type
;
3731 if (TREE_CODE (lhs_type
) == VECTOR_TYPE
)
3733 if (TREE_CODE (rhs1_type
) != VECTOR_TYPE
3734 || TREE_CODE (rhs2_type
) != VECTOR_TYPE
)
3736 error ("invalid non-vector operands to vector valued plus");
3739 lhs_etype
= TREE_TYPE (lhs_type
);
3740 rhs1_etype
= TREE_TYPE (rhs1_type
);
3741 rhs2_etype
= TREE_TYPE (rhs2_type
);
3743 if (POINTER_TYPE_P (lhs_etype
)
3744 || POINTER_TYPE_P (rhs1_etype
)
3745 || POINTER_TYPE_P (rhs2_etype
))
3747 error ("invalid (pointer) operands to plus/minus");
3751 /* Continue with generic binary expression handling. */
3755 case POINTER_PLUS_EXPR
:
3757 if (!POINTER_TYPE_P (rhs1_type
)
3758 || !useless_type_conversion_p (lhs_type
, rhs1_type
)
3759 || !ptrofftype_p (rhs2_type
))
3761 error ("type mismatch in pointer plus expression");
3762 debug_generic_stmt (lhs_type
);
3763 debug_generic_stmt (rhs1_type
);
3764 debug_generic_stmt (rhs2_type
);
3771 case TRUTH_ANDIF_EXPR
:
3772 case TRUTH_ORIF_EXPR
:
3773 case TRUTH_AND_EXPR
:
3775 case TRUTH_XOR_EXPR
:
3785 case UNORDERED_EXPR
:
3793 /* Comparisons are also binary, but the result type is not
3794 connected to the operand types. */
3795 return verify_gimple_comparison (lhs_type
, rhs1
, rhs2
);
3797 case WIDEN_MULT_EXPR
:
3798 if (TREE_CODE (lhs_type
) != INTEGER_TYPE
)
3800 return ((2 * TYPE_PRECISION (rhs1_type
) > TYPE_PRECISION (lhs_type
))
3801 || (TYPE_PRECISION (rhs1_type
) != TYPE_PRECISION (rhs2_type
)));
3803 case WIDEN_SUM_EXPR
:
3804 case VEC_WIDEN_MULT_HI_EXPR
:
3805 case VEC_WIDEN_MULT_LO_EXPR
:
3806 case VEC_WIDEN_MULT_EVEN_EXPR
:
3807 case VEC_WIDEN_MULT_ODD_EXPR
:
3808 case VEC_PACK_TRUNC_EXPR
:
3809 case VEC_PACK_SAT_EXPR
:
3810 case VEC_PACK_FIX_TRUNC_EXPR
:
3815 case MULT_HIGHPART_EXPR
:
3816 case TRUNC_DIV_EXPR
:
3818 case FLOOR_DIV_EXPR
:
3819 case ROUND_DIV_EXPR
:
3820 case TRUNC_MOD_EXPR
:
3822 case FLOOR_MOD_EXPR
:
3823 case ROUND_MOD_EXPR
:
3825 case EXACT_DIV_EXPR
:
3831 /* Continue with generic binary expression handling. */
3838 if (!useless_type_conversion_p (lhs_type
, rhs1_type
)
3839 || !useless_type_conversion_p (lhs_type
, rhs2_type
))
3841 error ("type mismatch in binary expression");
3842 debug_generic_stmt (lhs_type
);
3843 debug_generic_stmt (rhs1_type
);
3844 debug_generic_stmt (rhs2_type
);
3851 /* Verify a gimple assignment statement STMT with a ternary rhs.
3852 Returns true if anything is wrong. */
3855 verify_gimple_assign_ternary (gimple stmt
)
3857 enum tree_code rhs_code
= gimple_assign_rhs_code (stmt
);
3858 tree lhs
= gimple_assign_lhs (stmt
);
3859 tree lhs_type
= TREE_TYPE (lhs
);
3860 tree rhs1
= gimple_assign_rhs1 (stmt
);
3861 tree rhs1_type
= TREE_TYPE (rhs1
);
3862 tree rhs2
= gimple_assign_rhs2 (stmt
);
3863 tree rhs2_type
= TREE_TYPE (rhs2
);
3864 tree rhs3
= gimple_assign_rhs3 (stmt
);
3865 tree rhs3_type
= TREE_TYPE (rhs3
);
3867 if (!is_gimple_reg (lhs
))
3869 error ("non-register as LHS of ternary operation");
3873 if (((rhs_code
== VEC_COND_EXPR
|| rhs_code
== COND_EXPR
)
3874 ? !is_gimple_condexpr (rhs1
) : !is_gimple_val (rhs1
))
3875 || !is_gimple_val (rhs2
)
3876 || !is_gimple_val (rhs3
))
3878 error ("invalid operands in ternary operation");
3882 /* First handle operations that involve different types. */
3885 case WIDEN_MULT_PLUS_EXPR
:
3886 case WIDEN_MULT_MINUS_EXPR
:
3887 if ((!INTEGRAL_TYPE_P (rhs1_type
)
3888 && !FIXED_POINT_TYPE_P (rhs1_type
))
3889 || !useless_type_conversion_p (rhs1_type
, rhs2_type
)
3890 || !useless_type_conversion_p (lhs_type
, rhs3_type
)
3891 || 2 * TYPE_PRECISION (rhs1_type
) > TYPE_PRECISION (lhs_type
)
3892 || TYPE_PRECISION (rhs1_type
) != TYPE_PRECISION (rhs2_type
))
3894 error ("type mismatch in widening multiply-accumulate expression");
3895 debug_generic_expr (lhs_type
);
3896 debug_generic_expr (rhs1_type
);
3897 debug_generic_expr (rhs2_type
);
3898 debug_generic_expr (rhs3_type
);
3904 if (!useless_type_conversion_p (lhs_type
, rhs1_type
)
3905 || !useless_type_conversion_p (lhs_type
, rhs2_type
)
3906 || !useless_type_conversion_p (lhs_type
, rhs3_type
))
3908 error ("type mismatch in fused multiply-add expression");
3909 debug_generic_expr (lhs_type
);
3910 debug_generic_expr (rhs1_type
);
3911 debug_generic_expr (rhs2_type
);
3912 debug_generic_expr (rhs3_type
);
3919 if (!useless_type_conversion_p (lhs_type
, rhs2_type
)
3920 || !useless_type_conversion_p (lhs_type
, rhs3_type
))
3922 error ("type mismatch in conditional expression");
3923 debug_generic_expr (lhs_type
);
3924 debug_generic_expr (rhs2_type
);
3925 debug_generic_expr (rhs3_type
);
3931 if (!useless_type_conversion_p (lhs_type
, rhs1_type
)
3932 || !useless_type_conversion_p (lhs_type
, rhs2_type
))
3934 error ("type mismatch in vector permute expression");
3935 debug_generic_expr (lhs_type
);
3936 debug_generic_expr (rhs1_type
);
3937 debug_generic_expr (rhs2_type
);
3938 debug_generic_expr (rhs3_type
);
3942 if (TREE_CODE (rhs1_type
) != VECTOR_TYPE
3943 || TREE_CODE (rhs2_type
) != VECTOR_TYPE
3944 || TREE_CODE (rhs3_type
) != VECTOR_TYPE
)
3946 error ("vector types expected in vector permute expression");
3947 debug_generic_expr (lhs_type
);
3948 debug_generic_expr (rhs1_type
);
3949 debug_generic_expr (rhs2_type
);
3950 debug_generic_expr (rhs3_type
);
3954 if (TYPE_VECTOR_SUBPARTS (rhs1_type
) != TYPE_VECTOR_SUBPARTS (rhs2_type
)
3955 || TYPE_VECTOR_SUBPARTS (rhs2_type
)
3956 != TYPE_VECTOR_SUBPARTS (rhs3_type
)
3957 || TYPE_VECTOR_SUBPARTS (rhs3_type
)
3958 != TYPE_VECTOR_SUBPARTS (lhs_type
))
3960 error ("vectors with different element number found "
3961 "in vector permute expression");
3962 debug_generic_expr (lhs_type
);
3963 debug_generic_expr (rhs1_type
);
3964 debug_generic_expr (rhs2_type
);
3965 debug_generic_expr (rhs3_type
);
3969 if (TREE_CODE (TREE_TYPE (rhs3_type
)) != INTEGER_TYPE
3970 || GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (rhs3_type
)))
3971 != GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (rhs1_type
))))
3973 error ("invalid mask type in vector permute expression");
3974 debug_generic_expr (lhs_type
);
3975 debug_generic_expr (rhs1_type
);
3976 debug_generic_expr (rhs2_type
);
3977 debug_generic_expr (rhs3_type
);
3984 if (!useless_type_conversion_p (rhs1_type
, rhs2_type
)
3985 || !useless_type_conversion_p (lhs_type
, rhs3_type
)
3986 || 2 * GET_MODE_BITSIZE (GET_MODE_INNER
3987 (TYPE_MODE (TREE_TYPE (rhs1_type
))))
3988 > GET_MODE_BITSIZE (GET_MODE_INNER
3989 (TYPE_MODE (TREE_TYPE (lhs_type
)))))
3991 error ("type mismatch in sad expression");
3992 debug_generic_expr (lhs_type
);
3993 debug_generic_expr (rhs1_type
);
3994 debug_generic_expr (rhs2_type
);
3995 debug_generic_expr (rhs3_type
);
3999 if (TREE_CODE (rhs1_type
) != VECTOR_TYPE
4000 || TREE_CODE (rhs2_type
) != VECTOR_TYPE
4001 || TREE_CODE (rhs3_type
) != VECTOR_TYPE
)
4003 error ("vector types expected in sad expression");
4004 debug_generic_expr (lhs_type
);
4005 debug_generic_expr (rhs1_type
);
4006 debug_generic_expr (rhs2_type
);
4007 debug_generic_expr (rhs3_type
);
4014 case REALIGN_LOAD_EXPR
:
4024 /* Verify a gimple assignment statement STMT with a single rhs.
4025 Returns true if anything is wrong. */
4028 verify_gimple_assign_single (gimple stmt
)
4030 enum tree_code rhs_code
= gimple_assign_rhs_code (stmt
);
4031 tree lhs
= gimple_assign_lhs (stmt
);
4032 tree lhs_type
= TREE_TYPE (lhs
);
4033 tree rhs1
= gimple_assign_rhs1 (stmt
);
4034 tree rhs1_type
= TREE_TYPE (rhs1
);
4037 if (!useless_type_conversion_p (lhs_type
, rhs1_type
))
4039 error ("non-trivial conversion at assignment");
4040 debug_generic_expr (lhs_type
);
4041 debug_generic_expr (rhs1_type
);
4045 if (gimple_clobber_p (stmt
)
4046 && !(DECL_P (lhs
) || TREE_CODE (lhs
) == MEM_REF
))
4048 error ("non-decl/MEM_REF LHS in clobber statement");
4049 debug_generic_expr (lhs
);
4053 if (handled_component_p (lhs
)
4054 || TREE_CODE (lhs
) == MEM_REF
4055 || TREE_CODE (lhs
) == TARGET_MEM_REF
)
4056 res
|= verify_types_in_gimple_reference (lhs
, true);
4058 /* Special codes we cannot handle via their class. */
4063 tree op
= TREE_OPERAND (rhs1
, 0);
4064 if (!is_gimple_addressable (op
))
4066 error ("invalid operand in unary expression");
4070 /* Technically there is no longer a need for matching types, but
4071 gimple hygiene asks for this check. In LTO we can end up
4072 combining incompatible units and thus end up with addresses
4073 of globals that change their type to a common one. */
4075 && !types_compatible_p (TREE_TYPE (op
),
4076 TREE_TYPE (TREE_TYPE (rhs1
)))
4077 && !one_pointer_to_useless_type_conversion_p (TREE_TYPE (rhs1
),
4080 error ("type mismatch in address expression");
4081 debug_generic_stmt (TREE_TYPE (rhs1
));
4082 debug_generic_stmt (TREE_TYPE (op
));
4086 return verify_types_in_gimple_reference (op
, true);
4091 error ("INDIRECT_REF in gimple IL");
4097 case ARRAY_RANGE_REF
:
4098 case VIEW_CONVERT_EXPR
:
4101 case TARGET_MEM_REF
:
4103 if (!is_gimple_reg (lhs
)
4104 && is_gimple_reg_type (TREE_TYPE (lhs
)))
4106 error ("invalid rhs for gimple memory store");
4107 debug_generic_stmt (lhs
);
4108 debug_generic_stmt (rhs1
);
4111 return res
|| verify_types_in_gimple_reference (rhs1
, false);
4123 /* tcc_declaration */
4128 if (!is_gimple_reg (lhs
)
4129 && !is_gimple_reg (rhs1
)
4130 && is_gimple_reg_type (TREE_TYPE (lhs
)))
4132 error ("invalid rhs for gimple memory store");
4133 debug_generic_stmt (lhs
);
4134 debug_generic_stmt (rhs1
);
4140 if (TREE_CODE (rhs1_type
) == VECTOR_TYPE
)
4143 tree elt_i
, elt_v
, elt_t
= NULL_TREE
;
4145 if (CONSTRUCTOR_NELTS (rhs1
) == 0)
4147 /* For vector CONSTRUCTORs we require that either it is empty
4148 CONSTRUCTOR, or it is a CONSTRUCTOR of smaller vector elements
4149 (then the element count must be correct to cover the whole
4150 outer vector and index must be NULL on all elements, or it is
4151 a CONSTRUCTOR of scalar elements, where we as an exception allow
4152 smaller number of elements (assuming zero filling) and
4153 consecutive indexes as compared to NULL indexes (such
4154 CONSTRUCTORs can appear in the IL from FEs). */
4155 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (rhs1
), i
, elt_i
, elt_v
)
4157 if (elt_t
== NULL_TREE
)
4159 elt_t
= TREE_TYPE (elt_v
);
4160 if (TREE_CODE (elt_t
) == VECTOR_TYPE
)
4162 tree elt_t
= TREE_TYPE (elt_v
);
4163 if (!useless_type_conversion_p (TREE_TYPE (rhs1_type
),
4166 error ("incorrect type of vector CONSTRUCTOR"
4168 debug_generic_stmt (rhs1
);
4171 else if (CONSTRUCTOR_NELTS (rhs1
)
4172 * TYPE_VECTOR_SUBPARTS (elt_t
)
4173 != TYPE_VECTOR_SUBPARTS (rhs1_type
))
4175 error ("incorrect number of vector CONSTRUCTOR"
4177 debug_generic_stmt (rhs1
);
4181 else if (!useless_type_conversion_p (TREE_TYPE (rhs1_type
),
4184 error ("incorrect type of vector CONSTRUCTOR elements");
4185 debug_generic_stmt (rhs1
);
4188 else if (CONSTRUCTOR_NELTS (rhs1
)
4189 > TYPE_VECTOR_SUBPARTS (rhs1_type
))
4191 error ("incorrect number of vector CONSTRUCTOR elements");
4192 debug_generic_stmt (rhs1
);
4196 else if (!useless_type_conversion_p (elt_t
, TREE_TYPE (elt_v
)))
4198 error ("incorrect type of vector CONSTRUCTOR elements");
4199 debug_generic_stmt (rhs1
);
4202 if (elt_i
!= NULL_TREE
4203 && (TREE_CODE (elt_t
) == VECTOR_TYPE
4204 || TREE_CODE (elt_i
) != INTEGER_CST
4205 || compare_tree_int (elt_i
, i
) != 0))
4207 error ("vector CONSTRUCTOR with non-NULL element index");
4208 debug_generic_stmt (rhs1
);
4216 case WITH_SIZE_EXPR
:
4226 /* Verify the contents of a GIMPLE_ASSIGN STMT. Returns true when there
4227 is a problem, otherwise false. */
4230 verify_gimple_assign (gimple stmt
)
4232 switch (gimple_assign_rhs_class (stmt
))
4234 case GIMPLE_SINGLE_RHS
:
4235 return verify_gimple_assign_single (stmt
);
4237 case GIMPLE_UNARY_RHS
:
4238 return verify_gimple_assign_unary (stmt
);
4240 case GIMPLE_BINARY_RHS
:
4241 return verify_gimple_assign_binary (stmt
);
4243 case GIMPLE_TERNARY_RHS
:
4244 return verify_gimple_assign_ternary (stmt
);
4251 /* Verify the contents of a GIMPLE_RETURN STMT. Returns true when there
4252 is a problem, otherwise false. */
4255 verify_gimple_return (gimple stmt
)
4257 tree op
= gimple_return_retval (stmt
);
4258 tree restype
= TREE_TYPE (TREE_TYPE (cfun
->decl
));
4260 /* We cannot test for present return values as we do not fix up missing
4261 return values from the original source. */
4265 if (!is_gimple_val (op
)
4266 && TREE_CODE (op
) != RESULT_DECL
)
4268 error ("invalid operand in return statement");
4269 debug_generic_stmt (op
);
4273 if ((TREE_CODE (op
) == RESULT_DECL
4274 && DECL_BY_REFERENCE (op
))
4275 || (TREE_CODE (op
) == SSA_NAME
4276 && SSA_NAME_VAR (op
)
4277 && TREE_CODE (SSA_NAME_VAR (op
)) == RESULT_DECL
4278 && DECL_BY_REFERENCE (SSA_NAME_VAR (op
))))
4279 op
= TREE_TYPE (op
);
4281 if (!useless_type_conversion_p (restype
, TREE_TYPE (op
)))
4283 error ("invalid conversion in return statement");
4284 debug_generic_stmt (restype
);
4285 debug_generic_stmt (TREE_TYPE (op
));
4293 /* Verify the contents of a GIMPLE_GOTO STMT. Returns true when there
4294 is a problem, otherwise false. */
4297 verify_gimple_goto (gimple stmt
)
4299 tree dest
= gimple_goto_dest (stmt
);
4301 /* ??? We have two canonical forms of direct goto destinations, a
4302 bare LABEL_DECL and an ADDR_EXPR of a LABEL_DECL. */
4303 if (TREE_CODE (dest
) != LABEL_DECL
4304 && (!is_gimple_val (dest
)
4305 || !POINTER_TYPE_P (TREE_TYPE (dest
))))
4307 error ("goto destination is neither a label nor a pointer");
4314 /* Verify the contents of a GIMPLE_SWITCH STMT. Returns true when there
4315 is a problem, otherwise false. */
4318 verify_gimple_switch (gimple stmt
)
4321 tree elt
, prev_upper_bound
= NULL_TREE
;
4322 tree index_type
, elt_type
= NULL_TREE
;
4324 if (!is_gimple_val (gimple_switch_index (stmt
)))
4326 error ("invalid operand to switch statement");
4327 debug_generic_stmt (gimple_switch_index (stmt
));
4331 index_type
= TREE_TYPE (gimple_switch_index (stmt
));
4332 if (! INTEGRAL_TYPE_P (index_type
))
4334 error ("non-integral type switch statement");
4335 debug_generic_expr (index_type
);
4339 elt
= gimple_switch_label (stmt
, 0);
4340 if (CASE_LOW (elt
) != NULL_TREE
|| CASE_HIGH (elt
) != NULL_TREE
)
4342 error ("invalid default case label in switch statement");
4343 debug_generic_expr (elt
);
4347 n
= gimple_switch_num_labels (stmt
);
4348 for (i
= 1; i
< n
; i
++)
4350 elt
= gimple_switch_label (stmt
, i
);
4352 if (! CASE_LOW (elt
))
4354 error ("invalid case label in switch statement");
4355 debug_generic_expr (elt
);
4359 && ! tree_int_cst_lt (CASE_LOW (elt
), CASE_HIGH (elt
)))
4361 error ("invalid case range in switch statement");
4362 debug_generic_expr (elt
);
4368 if (TREE_TYPE (CASE_LOW (elt
)) != elt_type
4369 || (CASE_HIGH (elt
) && TREE_TYPE (CASE_HIGH (elt
)) != elt_type
))
4371 error ("type mismatch for case label in switch statement");
4372 debug_generic_expr (elt
);
4378 elt_type
= TREE_TYPE (CASE_LOW (elt
));
4379 if (TYPE_PRECISION (index_type
) < TYPE_PRECISION (elt_type
))
4381 error ("type precision mismatch in switch statement");
4386 if (prev_upper_bound
)
4388 if (! tree_int_cst_lt (prev_upper_bound
, CASE_LOW (elt
)))
4390 error ("case labels not sorted in switch statement");
4395 prev_upper_bound
= CASE_HIGH (elt
);
4396 if (! prev_upper_bound
)
4397 prev_upper_bound
= CASE_LOW (elt
);
4403 /* Verify a gimple debug statement STMT.
4404 Returns true if anything is wrong. */
4407 verify_gimple_debug (gimple stmt ATTRIBUTE_UNUSED
)
4409 /* There isn't much that could be wrong in a gimple debug stmt. A
4410 gimple debug bind stmt, for example, maps a tree, that's usually
4411 a VAR_DECL or a PARM_DECL, but that could also be some scalarized
4412 component or member of an aggregate type, to another tree, that
4413 can be an arbitrary expression. These stmts expand into debug
4414 insns, and are converted to debug notes by var-tracking.c. */
4418 /* Verify a gimple label statement STMT.
4419 Returns true if anything is wrong. */
4422 verify_gimple_label (gimple stmt
)
4424 tree decl
= gimple_label_label (stmt
);
4428 if (TREE_CODE (decl
) != LABEL_DECL
)
4430 if (!DECL_NONLOCAL (decl
) && !FORCED_LABEL (decl
)
4431 && DECL_CONTEXT (decl
) != current_function_decl
)
4433 error ("label's context is not the current function decl");
4437 uid
= LABEL_DECL_UID (decl
);
4440 || (*label_to_block_map_for_fn (cfun
))[uid
] != gimple_bb (stmt
)))
4442 error ("incorrect entry in label_to_block_map");
4446 uid
= EH_LANDING_PAD_NR (decl
);
4449 eh_landing_pad lp
= get_eh_landing_pad_from_number (uid
);
4450 if (decl
!= lp
->post_landing_pad
)
4452 error ("incorrect setting of landing pad number");
4460 /* Verify the GIMPLE statement STMT. Returns true if there is an
4461 error, otherwise false. */
4464 verify_gimple_stmt (gimple stmt
)
4466 switch (gimple_code (stmt
))
4469 return verify_gimple_assign (stmt
);
4472 return verify_gimple_label (stmt
);
4475 return verify_gimple_call (stmt
);
4478 if (TREE_CODE_CLASS (gimple_cond_code (stmt
)) != tcc_comparison
)
4480 error ("invalid comparison code in gimple cond");
4483 if (!(!gimple_cond_true_label (stmt
)
4484 || TREE_CODE (gimple_cond_true_label (stmt
)) == LABEL_DECL
)
4485 || !(!gimple_cond_false_label (stmt
)
4486 || TREE_CODE (gimple_cond_false_label (stmt
)) == LABEL_DECL
))
4488 error ("invalid labels in gimple cond");
4492 return verify_gimple_comparison (boolean_type_node
,
4493 gimple_cond_lhs (stmt
),
4494 gimple_cond_rhs (stmt
));
4497 return verify_gimple_goto (stmt
);
4500 return verify_gimple_switch (stmt
);
4503 return verify_gimple_return (stmt
);
4508 case GIMPLE_TRANSACTION
:
4509 return verify_gimple_transaction (stmt
);
4511 /* Tuples that do not have tree operands. */
4513 case GIMPLE_PREDICT
:
4515 case GIMPLE_EH_DISPATCH
:
4516 case GIMPLE_EH_MUST_NOT_THROW
:
4520 /* OpenMP directives are validated by the FE and never operated
4521 on by the optimizers. Furthermore, GIMPLE_OMP_FOR may contain
4522 non-gimple expressions when the main index variable has had
4523 its address taken. This does not affect the loop itself
4524 because the header of an GIMPLE_OMP_FOR is merely used to determine
4525 how to setup the parallel iteration. */
4529 return verify_gimple_debug (stmt
);
4536 /* Verify the contents of a GIMPLE_PHI. Returns true if there is a problem,
4537 and false otherwise. */
4540 verify_gimple_phi (gimple phi
)
4544 tree phi_result
= gimple_phi_result (phi
);
4549 error ("invalid PHI result");
4553 virtual_p
= virtual_operand_p (phi_result
);
4554 if (TREE_CODE (phi_result
) != SSA_NAME
4556 && SSA_NAME_VAR (phi_result
) != gimple_vop (cfun
)))
4558 error ("invalid PHI result");
4562 for (i
= 0; i
< gimple_phi_num_args (phi
); i
++)
4564 tree t
= gimple_phi_arg_def (phi
, i
);
4568 error ("missing PHI def");
4572 /* Addressable variables do have SSA_NAMEs but they
4573 are not considered gimple values. */
4574 else if ((TREE_CODE (t
) == SSA_NAME
4575 && virtual_p
!= virtual_operand_p (t
))
4577 && (TREE_CODE (t
) != SSA_NAME
4578 || SSA_NAME_VAR (t
) != gimple_vop (cfun
)))
4580 && !is_gimple_val (t
)))
4582 error ("invalid PHI argument");
4583 debug_generic_expr (t
);
4586 #ifdef ENABLE_TYPES_CHECKING
4587 if (!useless_type_conversion_p (TREE_TYPE (phi_result
), TREE_TYPE (t
)))
4589 error ("incompatible types in PHI argument %u", i
);
4590 debug_generic_stmt (TREE_TYPE (phi_result
));
4591 debug_generic_stmt (TREE_TYPE (t
));
4600 /* Verify the GIMPLE statements inside the sequence STMTS. */
4603 verify_gimple_in_seq_2 (gimple_seq stmts
)
4605 gimple_stmt_iterator ittr
;
4608 for (ittr
= gsi_start (stmts
); !gsi_end_p (ittr
); gsi_next (&ittr
))
4610 gimple stmt
= gsi_stmt (ittr
);
4612 switch (gimple_code (stmt
))
4615 err
|= verify_gimple_in_seq_2 (gimple_bind_body (stmt
));
4619 err
|= verify_gimple_in_seq_2 (gimple_try_eval (stmt
));
4620 err
|= verify_gimple_in_seq_2 (gimple_try_cleanup (stmt
));
4623 case GIMPLE_EH_FILTER
:
4624 err
|= verify_gimple_in_seq_2 (gimple_eh_filter_failure (stmt
));
4627 case GIMPLE_EH_ELSE
:
4628 err
|= verify_gimple_in_seq_2 (gimple_eh_else_n_body (stmt
));
4629 err
|= verify_gimple_in_seq_2 (gimple_eh_else_e_body (stmt
));
4633 err
|= verify_gimple_in_seq_2 (gimple_catch_handler (stmt
));
4636 case GIMPLE_TRANSACTION
:
4637 err
|= verify_gimple_transaction (stmt
);
4642 bool err2
= verify_gimple_stmt (stmt
);
4644 debug_gimple_stmt (stmt
);
4653 /* Verify the contents of a GIMPLE_TRANSACTION. Returns true if there
4654 is a problem, otherwise false. */
4657 verify_gimple_transaction (gimple stmt
)
4659 tree lab
= gimple_transaction_label (stmt
);
4660 if (lab
!= NULL
&& TREE_CODE (lab
) != LABEL_DECL
)
4662 return verify_gimple_in_seq_2 (gimple_transaction_body (stmt
));
4666 /* Verify the GIMPLE statements inside the statement list STMTS. */
4669 verify_gimple_in_seq (gimple_seq stmts
)
4671 timevar_push (TV_TREE_STMT_VERIFY
);
4672 if (verify_gimple_in_seq_2 (stmts
))
4673 internal_error ("verify_gimple failed");
4674 timevar_pop (TV_TREE_STMT_VERIFY
);
4677 /* Return true when the T can be shared. */
4680 tree_node_can_be_shared (tree t
)
4682 if (IS_TYPE_OR_DECL_P (t
)
4683 || is_gimple_min_invariant (t
)
4684 || TREE_CODE (t
) == SSA_NAME
4685 || t
== error_mark_node
4686 || TREE_CODE (t
) == IDENTIFIER_NODE
)
4689 if (TREE_CODE (t
) == CASE_LABEL_EXPR
)
4698 /* Called via walk_tree. Verify tree sharing. */
4701 verify_node_sharing_1 (tree
*tp
, int *walk_subtrees
, void *data
)
4703 hash_set
<void *> *visited
= (hash_set
<void *> *) data
;
4705 if (tree_node_can_be_shared (*tp
))
4707 *walk_subtrees
= false;
4711 if (visited
->add (*tp
))
4717 /* Called via walk_gimple_stmt. Verify tree sharing. */
4720 verify_node_sharing (tree
*tp
, int *walk_subtrees
, void *data
)
4722 struct walk_stmt_info
*wi
= (struct walk_stmt_info
*) data
;
4723 return verify_node_sharing_1 (tp
, walk_subtrees
, wi
->info
);
4726 static bool eh_error_found
;
4728 verify_eh_throw_stmt_node (void **slot
, void *data
)
4730 struct throw_stmt_node
*node
= (struct throw_stmt_node
*)*slot
;
4731 hash_set
<void *> *visited
= (hash_set
<void *> *) data
;
4733 if (!visited
->contains (node
->stmt
))
4735 error ("dead STMT in EH table");
4736 debug_gimple_stmt (node
->stmt
);
4737 eh_error_found
= true;
4742 /* Verify if the location LOCs block is in BLOCKS. */
4745 verify_location (hash_set
<tree
> *blocks
, location_t loc
)
4747 tree block
= LOCATION_BLOCK (loc
);
4748 if (block
!= NULL_TREE
4749 && !blocks
->contains (block
))
4751 error ("location references block not in block tree");
4754 if (block
!= NULL_TREE
)
4755 return verify_location (blocks
, BLOCK_SOURCE_LOCATION (block
));
4759 /* Called via walk_tree. Verify that expressions have no blocks. */
4762 verify_expr_no_block (tree
*tp
, int *walk_subtrees
, void *)
4766 *walk_subtrees
= false;
4770 location_t loc
= EXPR_LOCATION (*tp
);
4771 if (LOCATION_BLOCK (loc
) != NULL
)
4777 /* Called via walk_tree. Verify locations of expressions. */
4780 verify_expr_location_1 (tree
*tp
, int *walk_subtrees
, void *data
)
4782 hash_set
<tree
> *blocks
= (hash_set
<tree
> *) data
;
4784 if (TREE_CODE (*tp
) == VAR_DECL
4785 && DECL_HAS_DEBUG_EXPR_P (*tp
))
4787 tree t
= DECL_DEBUG_EXPR (*tp
);
4788 tree addr
= walk_tree (&t
, verify_expr_no_block
, NULL
, NULL
);
4792 if ((TREE_CODE (*tp
) == VAR_DECL
4793 || TREE_CODE (*tp
) == PARM_DECL
4794 || TREE_CODE (*tp
) == RESULT_DECL
)
4795 && DECL_HAS_VALUE_EXPR_P (*tp
))
4797 tree t
= DECL_VALUE_EXPR (*tp
);
4798 tree addr
= walk_tree (&t
, verify_expr_no_block
, NULL
, NULL
);
4805 *walk_subtrees
= false;
4809 location_t loc
= EXPR_LOCATION (*tp
);
4810 if (verify_location (blocks
, loc
))
4816 /* Called via walk_gimple_op. Verify locations of expressions. */
4819 verify_expr_location (tree
*tp
, int *walk_subtrees
, void *data
)
4821 struct walk_stmt_info
*wi
= (struct walk_stmt_info
*) data
;
4822 return verify_expr_location_1 (tp
, walk_subtrees
, wi
->info
);
4825 /* Insert all subblocks of BLOCK into BLOCKS and recurse. */
4828 collect_subblocks (hash_set
<tree
> *blocks
, tree block
)
4831 for (t
= BLOCK_SUBBLOCKS (block
); t
; t
= BLOCK_CHAIN (t
))
4834 collect_subblocks (blocks
, t
);
4838 /* Verify the GIMPLE statements in the CFG of FN. */
4841 verify_gimple_in_cfg (struct function
*fn
, bool verify_nothrow
)
4846 timevar_push (TV_TREE_STMT_VERIFY
);
4847 hash_set
<void *> visited
;
4848 hash_set
<gimple
> visited_stmts
;
4850 /* Collect all BLOCKs referenced by the BLOCK tree of FN. */
4851 hash_set
<tree
> blocks
;
4852 if (DECL_INITIAL (fn
->decl
))
4854 blocks
.add (DECL_INITIAL (fn
->decl
));
4855 collect_subblocks (&blocks
, DECL_INITIAL (fn
->decl
));
4858 FOR_EACH_BB_FN (bb
, fn
)
4860 gimple_stmt_iterator gsi
;
4862 for (gsi
= gsi_start_phis (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
4864 gimple phi
= gsi_stmt (gsi
);
4868 visited_stmts
.add (phi
);
4870 if (gimple_bb (phi
) != bb
)
4872 error ("gimple_bb (phi) is set to a wrong basic block");
4876 err2
|= verify_gimple_phi (phi
);
4878 /* Only PHI arguments have locations. */
4879 if (gimple_location (phi
) != UNKNOWN_LOCATION
)
4881 error ("PHI node with location");
4885 for (i
= 0; i
< gimple_phi_num_args (phi
); i
++)
4887 tree arg
= gimple_phi_arg_def (phi
, i
);
4888 tree addr
= walk_tree (&arg
, verify_node_sharing_1
,
4892 error ("incorrect sharing of tree nodes");
4893 debug_generic_expr (addr
);
4896 location_t loc
= gimple_phi_arg_location (phi
, i
);
4897 if (virtual_operand_p (gimple_phi_result (phi
))
4898 && loc
!= UNKNOWN_LOCATION
)
4900 error ("virtual PHI with argument locations");
4903 addr
= walk_tree (&arg
, verify_expr_location_1
, &blocks
, NULL
);
4906 debug_generic_expr (addr
);
4909 err2
|= verify_location (&blocks
, loc
);
4913 debug_gimple_stmt (phi
);
4917 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
4919 gimple stmt
= gsi_stmt (gsi
);
4921 struct walk_stmt_info wi
;
4925 visited_stmts
.add (stmt
);
4927 if (gimple_bb (stmt
) != bb
)
4929 error ("gimple_bb (stmt) is set to a wrong basic block");
4933 err2
|= verify_gimple_stmt (stmt
);
4934 err2
|= verify_location (&blocks
, gimple_location (stmt
));
4936 memset (&wi
, 0, sizeof (wi
));
4937 wi
.info
= (void *) &visited
;
4938 addr
= walk_gimple_op (stmt
, verify_node_sharing
, &wi
);
4941 error ("incorrect sharing of tree nodes");
4942 debug_generic_expr (addr
);
4946 memset (&wi
, 0, sizeof (wi
));
4947 wi
.info
= (void *) &blocks
;
4948 addr
= walk_gimple_op (stmt
, verify_expr_location
, &wi
);
4951 debug_generic_expr (addr
);
4955 /* ??? Instead of not checking these stmts at all the walker
4956 should know its context via wi. */
4957 if (!is_gimple_debug (stmt
)
4958 && !is_gimple_omp (stmt
))
4960 memset (&wi
, 0, sizeof (wi
));
4961 addr
= walk_gimple_op (stmt
, verify_expr
, &wi
);
4964 debug_generic_expr (addr
);
4965 inform (gimple_location (stmt
), "in statement");
4970 /* If the statement is marked as part of an EH region, then it is
4971 expected that the statement could throw. Verify that when we
4972 have optimizations that simplify statements such that we prove
4973 that they cannot throw, that we update other data structures
4975 lp_nr
= lookup_stmt_eh_lp (stmt
);
4978 if (!stmt_could_throw_p (stmt
))
4982 error ("statement marked for throw, but doesn%'t");
4986 else if (!gsi_one_before_end_p (gsi
))
4988 error ("statement marked for throw in middle of block");
4994 debug_gimple_stmt (stmt
);
4999 eh_error_found
= false;
5000 if (get_eh_throw_stmt_table (cfun
))
5001 htab_traverse (get_eh_throw_stmt_table (cfun
),
5002 verify_eh_throw_stmt_node
,
5005 if (err
|| eh_error_found
)
5006 internal_error ("verify_gimple failed");
5008 verify_histograms ();
5009 timevar_pop (TV_TREE_STMT_VERIFY
);
5013 /* Verifies that the flow information is OK. */
5016 gimple_verify_flow_info (void)
5020 gimple_stmt_iterator gsi
;
5025 if (ENTRY_BLOCK_PTR_FOR_FN (cfun
)->il
.gimple
.seq
5026 || ENTRY_BLOCK_PTR_FOR_FN (cfun
)->il
.gimple
.phi_nodes
)
5028 error ("ENTRY_BLOCK has IL associated with it");
5032 if (EXIT_BLOCK_PTR_FOR_FN (cfun
)->il
.gimple
.seq
5033 || EXIT_BLOCK_PTR_FOR_FN (cfun
)->il
.gimple
.phi_nodes
)
5035 error ("EXIT_BLOCK has IL associated with it");
5039 FOR_EACH_EDGE (e
, ei
, EXIT_BLOCK_PTR_FOR_FN (cfun
)->preds
)
5040 if (e
->flags
& EDGE_FALLTHRU
)
5042 error ("fallthru to exit from bb %d", e
->src
->index
);
5046 FOR_EACH_BB_FN (bb
, cfun
)
5048 bool found_ctrl_stmt
= false;
5052 /* Skip labels on the start of basic block. */
5053 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
5056 gimple prev_stmt
= stmt
;
5058 stmt
= gsi_stmt (gsi
);
5060 if (gimple_code (stmt
) != GIMPLE_LABEL
)
5063 label
= gimple_label_label (stmt
);
5064 if (prev_stmt
&& DECL_NONLOCAL (label
))
5066 error ("nonlocal label ");
5067 print_generic_expr (stderr
, label
, 0);
5068 fprintf (stderr
, " is not first in a sequence of labels in bb %d",
5073 if (prev_stmt
&& EH_LANDING_PAD_NR (label
) != 0)
5075 error ("EH landing pad label ");
5076 print_generic_expr (stderr
, label
, 0);
5077 fprintf (stderr
, " is not first in a sequence of labels in bb %d",
5082 if (label_to_block (label
) != bb
)
5085 print_generic_expr (stderr
, label
, 0);
5086 fprintf (stderr
, " to block does not match in bb %d",
5091 if (decl_function_context (label
) != current_function_decl
)
5094 print_generic_expr (stderr
, label
, 0);
5095 fprintf (stderr
, " has incorrect context in bb %d",
5101 /* Verify that body of basic block BB is free of control flow. */
5102 for (; !gsi_end_p (gsi
); gsi_next (&gsi
))
5104 gimple stmt
= gsi_stmt (gsi
);
5106 if (found_ctrl_stmt
)
5108 error ("control flow in the middle of basic block %d",
5113 if (stmt_ends_bb_p (stmt
))
5114 found_ctrl_stmt
= true;
5116 if (gimple_code (stmt
) == GIMPLE_LABEL
)
5119 print_generic_expr (stderr
, gimple_label_label (stmt
), 0);
5120 fprintf (stderr
, " in the middle of basic block %d", bb
->index
);
5125 gsi
= gsi_last_bb (bb
);
5126 if (gsi_end_p (gsi
))
5129 stmt
= gsi_stmt (gsi
);
5131 if (gimple_code (stmt
) == GIMPLE_LABEL
)
5134 err
|= verify_eh_edges (stmt
);
5136 if (is_ctrl_stmt (stmt
))
5138 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
5139 if (e
->flags
& EDGE_FALLTHRU
)
5141 error ("fallthru edge after a control statement in bb %d",
5147 if (gimple_code (stmt
) != GIMPLE_COND
)
5149 /* Verify that there are no edges with EDGE_TRUE/FALSE_FLAG set
5150 after anything else but if statement. */
5151 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
5152 if (e
->flags
& (EDGE_TRUE_VALUE
| EDGE_FALSE_VALUE
))
5154 error ("true/false edge after a non-GIMPLE_COND in bb %d",
5160 switch (gimple_code (stmt
))
5167 extract_true_false_edges_from_block (bb
, &true_edge
, &false_edge
);
5171 || !(true_edge
->flags
& EDGE_TRUE_VALUE
)
5172 || !(false_edge
->flags
& EDGE_FALSE_VALUE
)
5173 || (true_edge
->flags
& (EDGE_FALLTHRU
| EDGE_ABNORMAL
))
5174 || (false_edge
->flags
& (EDGE_FALLTHRU
| EDGE_ABNORMAL
))
5175 || EDGE_COUNT (bb
->succs
) >= 3)
5177 error ("wrong outgoing edge flags at end of bb %d",
5185 if (simple_goto_p (stmt
))
5187 error ("explicit goto at end of bb %d", bb
->index
);
5192 /* FIXME. We should double check that the labels in the
5193 destination blocks have their address taken. */
5194 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
5195 if ((e
->flags
& (EDGE_FALLTHRU
| EDGE_TRUE_VALUE
5196 | EDGE_FALSE_VALUE
))
5197 || !(e
->flags
& EDGE_ABNORMAL
))
5199 error ("wrong outgoing edge flags at end of bb %d",
5207 if (!gimple_call_builtin_p (stmt
, BUILT_IN_RETURN
))
5209 /* ... fallthru ... */
5211 if (!single_succ_p (bb
)
5212 || (single_succ_edge (bb
)->flags
5213 & (EDGE_FALLTHRU
| EDGE_ABNORMAL
5214 | EDGE_TRUE_VALUE
| EDGE_FALSE_VALUE
)))
5216 error ("wrong outgoing edge flags at end of bb %d", bb
->index
);
5219 if (single_succ (bb
) != EXIT_BLOCK_PTR_FOR_FN (cfun
))
5221 error ("return edge does not point to exit in bb %d",
5233 n
= gimple_switch_num_labels (stmt
);
5235 /* Mark all the destination basic blocks. */
5236 for (i
= 0; i
< n
; ++i
)
5238 tree lab
= CASE_LABEL (gimple_switch_label (stmt
, i
));
5239 basic_block label_bb
= label_to_block (lab
);
5240 gcc_assert (!label_bb
->aux
|| label_bb
->aux
== (void *)1);
5241 label_bb
->aux
= (void *)1;
5244 /* Verify that the case labels are sorted. */
5245 prev
= gimple_switch_label (stmt
, 0);
5246 for (i
= 1; i
< n
; ++i
)
5248 tree c
= gimple_switch_label (stmt
, i
);
5251 error ("found default case not at the start of "
5257 && !tree_int_cst_lt (CASE_LOW (prev
), CASE_LOW (c
)))
5259 error ("case labels not sorted: ");
5260 print_generic_expr (stderr
, prev
, 0);
5261 fprintf (stderr
," is greater than ");
5262 print_generic_expr (stderr
, c
, 0);
5263 fprintf (stderr
," but comes before it.\n");
5268 /* VRP will remove the default case if it can prove it will
5269 never be executed. So do not verify there always exists
5270 a default case here. */
5272 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
5276 error ("extra outgoing edge %d->%d",
5277 bb
->index
, e
->dest
->index
);
5281 e
->dest
->aux
= (void *)2;
5282 if ((e
->flags
& (EDGE_FALLTHRU
| EDGE_ABNORMAL
5283 | EDGE_TRUE_VALUE
| EDGE_FALSE_VALUE
)))
5285 error ("wrong outgoing edge flags at end of bb %d",
5291 /* Check that we have all of them. */
5292 for (i
= 0; i
< n
; ++i
)
5294 tree lab
= CASE_LABEL (gimple_switch_label (stmt
, i
));
5295 basic_block label_bb
= label_to_block (lab
);
5297 if (label_bb
->aux
!= (void *)2)
5299 error ("missing edge %i->%i", bb
->index
, label_bb
->index
);
5304 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
5305 e
->dest
->aux
= (void *)0;
5309 case GIMPLE_EH_DISPATCH
:
5310 err
|= verify_eh_dispatch_edge (stmt
);
5318 if (dom_info_state (CDI_DOMINATORS
) >= DOM_NO_FAST_QUERY
)
5319 verify_dominators (CDI_DOMINATORS
);
5325 /* Updates phi nodes after creating a forwarder block joined
5326 by edge FALLTHRU. */
5329 gimple_make_forwarder_block (edge fallthru
)
5333 basic_block dummy
, bb
;
5335 gimple_stmt_iterator gsi
;
5337 dummy
= fallthru
->src
;
5338 bb
= fallthru
->dest
;
5340 if (single_pred_p (bb
))
5343 /* If we redirected a branch we must create new PHI nodes at the
5345 for (gsi
= gsi_start_phis (dummy
); !gsi_end_p (gsi
); gsi_next (&gsi
))
5347 gimple phi
, new_phi
;
5349 phi
= gsi_stmt (gsi
);
5350 var
= gimple_phi_result (phi
);
5351 new_phi
= create_phi_node (var
, bb
);
5352 gimple_phi_set_result (phi
, copy_ssa_name (var
, phi
));
5353 add_phi_arg (new_phi
, gimple_phi_result (phi
), fallthru
,
5357 /* Add the arguments we have stored on edges. */
5358 FOR_EACH_EDGE (e
, ei
, bb
->preds
)
5363 flush_pending_stmts (e
);
5368 /* Return a non-special label in the head of basic block BLOCK.
5369 Create one if it doesn't exist. */
5372 gimple_block_label (basic_block bb
)
5374 gimple_stmt_iterator i
, s
= gsi_start_bb (bb
);
5379 for (i
= s
; !gsi_end_p (i
); first
= false, gsi_next (&i
))
5381 stmt
= gsi_stmt (i
);
5382 if (gimple_code (stmt
) != GIMPLE_LABEL
)
5384 label
= gimple_label_label (stmt
);
5385 if (!DECL_NONLOCAL (label
))
5388 gsi_move_before (&i
, &s
);
5393 label
= create_artificial_label (UNKNOWN_LOCATION
);
5394 stmt
= gimple_build_label (label
);
5395 gsi_insert_before (&s
, stmt
, GSI_NEW_STMT
);
5400 /* Attempt to perform edge redirection by replacing a possibly complex
5401 jump instruction by a goto or by removing the jump completely.
5402 This can apply only if all edges now point to the same block. The
5403 parameters and return values are equivalent to
5404 redirect_edge_and_branch. */
5407 gimple_try_redirect_by_replacing_jump (edge e
, basic_block target
)
5409 basic_block src
= e
->src
;
5410 gimple_stmt_iterator i
;
5413 /* We can replace or remove a complex jump only when we have exactly
5415 if (EDGE_COUNT (src
->succs
) != 2
5416 /* Verify that all targets will be TARGET. Specifically, the
5417 edge that is not E must also go to TARGET. */
5418 || EDGE_SUCC (src
, EDGE_SUCC (src
, 0) == e
)->dest
!= target
)
5421 i
= gsi_last_bb (src
);
5425 stmt
= gsi_stmt (i
);
5427 if (gimple_code (stmt
) == GIMPLE_COND
|| gimple_code (stmt
) == GIMPLE_SWITCH
)
5429 gsi_remove (&i
, true);
5430 e
= ssa_redirect_edge (e
, target
);
5431 e
->flags
= EDGE_FALLTHRU
;
5439 /* Redirect E to DEST. Return NULL on failure. Otherwise, return the
5440 edge representing the redirected branch. */
5443 gimple_redirect_edge_and_branch (edge e
, basic_block dest
)
5445 basic_block bb
= e
->src
;
5446 gimple_stmt_iterator gsi
;
5450 if (e
->flags
& EDGE_ABNORMAL
)
5453 if (e
->dest
== dest
)
5456 if (e
->flags
& EDGE_EH
)
5457 return redirect_eh_edge (e
, dest
);
5459 if (e
->src
!= ENTRY_BLOCK_PTR_FOR_FN (cfun
))
5461 ret
= gimple_try_redirect_by_replacing_jump (e
, dest
);
5466 gsi
= gsi_last_bb (bb
);
5467 stmt
= gsi_end_p (gsi
) ? NULL
: gsi_stmt (gsi
);
5469 switch (stmt
? gimple_code (stmt
) : GIMPLE_ERROR_MARK
)
5472 /* For COND_EXPR, we only need to redirect the edge. */
5476 /* No non-abnormal edges should lead from a non-simple goto, and
5477 simple ones should be represented implicitly. */
5482 tree label
= gimple_block_label (dest
);
5483 tree cases
= get_cases_for_edge (e
, stmt
);
5485 /* If we have a list of cases associated with E, then use it
5486 as it's a lot faster than walking the entire case vector. */
5489 edge e2
= find_edge (e
->src
, dest
);
5496 CASE_LABEL (cases
) = label
;
5497 cases
= CASE_CHAIN (cases
);
5500 /* If there was already an edge in the CFG, then we need
5501 to move all the cases associated with E to E2. */
5504 tree cases2
= get_cases_for_edge (e2
, stmt
);
5506 CASE_CHAIN (last
) = CASE_CHAIN (cases2
);
5507 CASE_CHAIN (cases2
) = first
;
5509 bitmap_set_bit (touched_switch_bbs
, gimple_bb (stmt
)->index
);
5513 size_t i
, n
= gimple_switch_num_labels (stmt
);
5515 for (i
= 0; i
< n
; i
++)
5517 tree elt
= gimple_switch_label (stmt
, i
);
5518 if (label_to_block (CASE_LABEL (elt
)) == e
->dest
)
5519 CASE_LABEL (elt
) = label
;
5527 int i
, n
= gimple_asm_nlabels (stmt
);
5530 for (i
= 0; i
< n
; ++i
)
5532 tree cons
= gimple_asm_label_op (stmt
, i
);
5533 if (label_to_block (TREE_VALUE (cons
)) == e
->dest
)
5536 label
= gimple_block_label (dest
);
5537 TREE_VALUE (cons
) = label
;
5541 /* If we didn't find any label matching the former edge in the
5542 asm labels, we must be redirecting the fallthrough
5544 gcc_assert (label
|| (e
->flags
& EDGE_FALLTHRU
));
5549 gsi_remove (&gsi
, true);
5550 e
->flags
|= EDGE_FALLTHRU
;
5553 case GIMPLE_OMP_RETURN
:
5554 case GIMPLE_OMP_CONTINUE
:
5555 case GIMPLE_OMP_SECTIONS_SWITCH
:
5556 case GIMPLE_OMP_FOR
:
5557 /* The edges from OMP constructs can be simply redirected. */
5560 case GIMPLE_EH_DISPATCH
:
5561 if (!(e
->flags
& EDGE_FALLTHRU
))
5562 redirect_eh_dispatch_edge (stmt
, e
, dest
);
5565 case GIMPLE_TRANSACTION
:
5566 /* The ABORT edge has a stored label associated with it, otherwise
5567 the edges are simply redirectable. */
5569 gimple_transaction_set_label (stmt
, gimple_block_label (dest
));
5573 /* Otherwise it must be a fallthru edge, and we don't need to
5574 do anything besides redirecting it. */
5575 gcc_assert (e
->flags
& EDGE_FALLTHRU
);
5579 /* Update/insert PHI nodes as necessary. */
5581 /* Now update the edges in the CFG. */
5582 e
= ssa_redirect_edge (e
, dest
);
5587 /* Returns true if it is possible to remove edge E by redirecting
5588 it to the destination of the other edge from E->src. */
5591 gimple_can_remove_branch_p (const_edge e
)
5593 if (e
->flags
& (EDGE_ABNORMAL
| EDGE_EH
))
5599 /* Simple wrapper, as we can always redirect fallthru edges. */
5602 gimple_redirect_edge_and_branch_force (edge e
, basic_block dest
)
5604 e
= gimple_redirect_edge_and_branch (e
, dest
);
5611 /* Splits basic block BB after statement STMT (but at least after the
5612 labels). If STMT is NULL, BB is split just after the labels. */
5615 gimple_split_block (basic_block bb
, void *stmt
)
5617 gimple_stmt_iterator gsi
;
5618 gimple_stmt_iterator gsi_tgt
;
5625 new_bb
= create_empty_bb (bb
);
5627 /* Redirect the outgoing edges. */
5628 new_bb
->succs
= bb
->succs
;
5630 FOR_EACH_EDGE (e
, ei
, new_bb
->succs
)
5633 if (stmt
&& gimple_code ((gimple
) stmt
) == GIMPLE_LABEL
)
5636 /* Move everything from GSI to the new basic block. */
5637 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
5639 act
= gsi_stmt (gsi
);
5640 if (gimple_code (act
) == GIMPLE_LABEL
)
5653 if (gsi_end_p (gsi
))
5656 /* Split the statement list - avoid re-creating new containers as this
5657 brings ugly quadratic memory consumption in the inliner.
5658 (We are still quadratic since we need to update stmt BB pointers,
5660 gsi_split_seq_before (&gsi
, &list
);
5661 set_bb_seq (new_bb
, list
);
5662 for (gsi_tgt
= gsi_start (list
);
5663 !gsi_end_p (gsi_tgt
); gsi_next (&gsi_tgt
))
5664 gimple_set_bb (gsi_stmt (gsi_tgt
), new_bb
);
5670 /* Moves basic block BB after block AFTER. */
5673 gimple_move_block_after (basic_block bb
, basic_block after
)
5675 if (bb
->prev_bb
== after
)
5679 link_block (bb
, after
);
5685 /* Return TRUE if block BB has no executable statements, otherwise return
5689 gimple_empty_block_p (basic_block bb
)
5691 /* BB must have no executable statements. */
5692 gimple_stmt_iterator gsi
= gsi_after_labels (bb
);
5695 if (gsi_end_p (gsi
))
5697 if (is_gimple_debug (gsi_stmt (gsi
)))
5698 gsi_next_nondebug (&gsi
);
5699 return gsi_end_p (gsi
);
5703 /* Split a basic block if it ends with a conditional branch and if the
5704 other part of the block is not empty. */
5707 gimple_split_block_before_cond_jump (basic_block bb
)
5709 gimple last
, split_point
;
5710 gimple_stmt_iterator gsi
= gsi_last_nondebug_bb (bb
);
5711 if (gsi_end_p (gsi
))
5713 last
= gsi_stmt (gsi
);
5714 if (gimple_code (last
) != GIMPLE_COND
5715 && gimple_code (last
) != GIMPLE_SWITCH
)
5717 gsi_prev_nondebug (&gsi
);
5718 split_point
= gsi_stmt (gsi
);
5719 return split_block (bb
, split_point
)->dest
;
5723 /* Return true if basic_block can be duplicated. */
5726 gimple_can_duplicate_bb_p (const_basic_block bb ATTRIBUTE_UNUSED
)
5731 /* Create a duplicate of the basic block BB. NOTE: This does not
5732 preserve SSA form. */
5735 gimple_duplicate_bb (basic_block bb
)
5738 gimple_stmt_iterator gsi
, gsi_tgt
;
5739 gimple_seq phis
= phi_nodes (bb
);
5740 gimple phi
, stmt
, copy
;
5742 new_bb
= create_empty_bb (EXIT_BLOCK_PTR_FOR_FN (cfun
)->prev_bb
);
5744 /* Copy the PHI nodes. We ignore PHI node arguments here because
5745 the incoming edges have not been setup yet. */
5746 for (gsi
= gsi_start (phis
); !gsi_end_p (gsi
); gsi_next (&gsi
))
5748 phi
= gsi_stmt (gsi
);
5749 copy
= create_phi_node (NULL_TREE
, new_bb
);
5750 create_new_def_for (gimple_phi_result (phi
), copy
,
5751 gimple_phi_result_ptr (copy
));
5752 gimple_set_uid (copy
, gimple_uid (phi
));
5755 gsi_tgt
= gsi_start_bb (new_bb
);
5756 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
5758 def_operand_p def_p
;
5759 ssa_op_iter op_iter
;
5762 stmt
= gsi_stmt (gsi
);
5763 if (gimple_code (stmt
) == GIMPLE_LABEL
)
5766 /* Don't duplicate label debug stmts. */
5767 if (gimple_debug_bind_p (stmt
)
5768 && TREE_CODE (gimple_debug_bind_get_var (stmt
))
5772 /* Create a new copy of STMT and duplicate STMT's virtual
5774 copy
= gimple_copy (stmt
);
5775 gsi_insert_after (&gsi_tgt
, copy
, GSI_NEW_STMT
);
5777 maybe_duplicate_eh_stmt (copy
, stmt
);
5778 gimple_duplicate_stmt_histograms (cfun
, copy
, cfun
, stmt
);
5780 /* When copying around a stmt writing into a local non-user
5781 aggregate, make sure it won't share stack slot with other
5783 lhs
= gimple_get_lhs (stmt
);
5784 if (lhs
&& TREE_CODE (lhs
) != SSA_NAME
)
5786 tree base
= get_base_address (lhs
);
5788 && (TREE_CODE (base
) == VAR_DECL
5789 || TREE_CODE (base
) == RESULT_DECL
)
5790 && DECL_IGNORED_P (base
)
5791 && !TREE_STATIC (base
)
5792 && !DECL_EXTERNAL (base
)
5793 && (TREE_CODE (base
) != VAR_DECL
5794 || !DECL_HAS_VALUE_EXPR_P (base
)))
5795 DECL_NONSHAREABLE (base
) = 1;
5798 /* Create new names for all the definitions created by COPY and
5799 add replacement mappings for each new name. */
5800 FOR_EACH_SSA_DEF_OPERAND (def_p
, copy
, op_iter
, SSA_OP_ALL_DEFS
)
5801 create_new_def_for (DEF_FROM_PTR (def_p
), copy
, def_p
);
5807 /* Adds phi node arguments for edge E_COPY after basic block duplication. */
5810 add_phi_args_after_copy_edge (edge e_copy
)
5812 basic_block bb
, bb_copy
= e_copy
->src
, dest
;
5815 gimple phi
, phi_copy
;
5817 gimple_stmt_iterator psi
, psi_copy
;
5819 if (gimple_seq_empty_p (phi_nodes (e_copy
->dest
)))
5822 bb
= bb_copy
->flags
& BB_DUPLICATED
? get_bb_original (bb_copy
) : bb_copy
;
5824 if (e_copy
->dest
->flags
& BB_DUPLICATED
)
5825 dest
= get_bb_original (e_copy
->dest
);
5827 dest
= e_copy
->dest
;
5829 e
= find_edge (bb
, dest
);
5832 /* During loop unrolling the target of the latch edge is copied.
5833 In this case we are not looking for edge to dest, but to
5834 duplicated block whose original was dest. */
5835 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
5837 if ((e
->dest
->flags
& BB_DUPLICATED
)
5838 && get_bb_original (e
->dest
) == dest
)
5842 gcc_assert (e
!= NULL
);
5845 for (psi
= gsi_start_phis (e
->dest
),
5846 psi_copy
= gsi_start_phis (e_copy
->dest
);
5848 gsi_next (&psi
), gsi_next (&psi_copy
))
5850 phi
= gsi_stmt (psi
);
5851 phi_copy
= gsi_stmt (psi_copy
);
5852 def
= PHI_ARG_DEF_FROM_EDGE (phi
, e
);
5853 add_phi_arg (phi_copy
, def
, e_copy
,
5854 gimple_phi_arg_location_from_edge (phi
, e
));
5859 /* Basic block BB_COPY was created by code duplication. Add phi node
5860 arguments for edges going out of BB_COPY. The blocks that were
5861 duplicated have BB_DUPLICATED set. */
5864 add_phi_args_after_copy_bb (basic_block bb_copy
)
5869 FOR_EACH_EDGE (e_copy
, ei
, bb_copy
->succs
)
5871 add_phi_args_after_copy_edge (e_copy
);
5875 /* Blocks in REGION_COPY array of length N_REGION were created by
5876 duplication of basic blocks. Add phi node arguments for edges
5877 going from these blocks. If E_COPY is not NULL, also add
5878 phi node arguments for its destination.*/
5881 add_phi_args_after_copy (basic_block
*region_copy
, unsigned n_region
,
5886 for (i
= 0; i
< n_region
; i
++)
5887 region_copy
[i
]->flags
|= BB_DUPLICATED
;
5889 for (i
= 0; i
< n_region
; i
++)
5890 add_phi_args_after_copy_bb (region_copy
[i
]);
5892 add_phi_args_after_copy_edge (e_copy
);
5894 for (i
= 0; i
< n_region
; i
++)
5895 region_copy
[i
]->flags
&= ~BB_DUPLICATED
;
5898 /* Duplicates a REGION (set of N_REGION basic blocks) with just a single
5899 important exit edge EXIT. By important we mean that no SSA name defined
5900 inside region is live over the other exit edges of the region. All entry
5901 edges to the region must go to ENTRY->dest. The edge ENTRY is redirected
5902 to the duplicate of the region. Dominance and loop information is
5903 updated if UPDATE_DOMINANCE is true, but not the SSA web. If
5904 UPDATE_DOMINANCE is false then we assume that the caller will update the
5905 dominance information after calling this function. The new basic
5906 blocks are stored to REGION_COPY in the same order as they had in REGION,
5907 provided that REGION_COPY is not NULL.
5908 The function returns false if it is unable to copy the region,
5912 gimple_duplicate_sese_region (edge entry
, edge exit
,
5913 basic_block
*region
, unsigned n_region
,
5914 basic_block
*region_copy
,
5915 bool update_dominance
)
5918 bool free_region_copy
= false, copying_header
= false;
5919 struct loop
*loop
= entry
->dest
->loop_father
;
5921 vec
<basic_block
> doms
;
5923 int total_freq
= 0, entry_freq
= 0;
5924 gcov_type total_count
= 0, entry_count
= 0;
5926 if (!can_copy_bbs_p (region
, n_region
))
5929 /* Some sanity checking. Note that we do not check for all possible
5930 missuses of the functions. I.e. if you ask to copy something weird,
5931 it will work, but the state of structures probably will not be
5933 for (i
= 0; i
< n_region
; i
++)
5935 /* We do not handle subloops, i.e. all the blocks must belong to the
5937 if (region
[i
]->loop_father
!= loop
)
5940 if (region
[i
] != entry
->dest
5941 && region
[i
] == loop
->header
)
5945 /* In case the function is used for loop header copying (which is the primary
5946 use), ensure that EXIT and its copy will be new latch and entry edges. */
5947 if (loop
->header
== entry
->dest
)
5949 copying_header
= true;
5951 if (!dominated_by_p (CDI_DOMINATORS
, loop
->latch
, exit
->src
))
5954 for (i
= 0; i
< n_region
; i
++)
5955 if (region
[i
] != exit
->src
5956 && dominated_by_p (CDI_DOMINATORS
, region
[i
], exit
->src
))
5960 initialize_original_copy_tables ();
5963 set_loop_copy (loop
, loop_outer (loop
));
5965 set_loop_copy (loop
, loop
);
5969 region_copy
= XNEWVEC (basic_block
, n_region
);
5970 free_region_copy
= true;
5973 /* Record blocks outside the region that are dominated by something
5975 if (update_dominance
)
5978 doms
= get_dominated_by_region (CDI_DOMINATORS
, region
, n_region
);
5981 if (entry
->dest
->count
)
5983 total_count
= entry
->dest
->count
;
5984 entry_count
= entry
->count
;
5985 /* Fix up corner cases, to avoid division by zero or creation of negative
5987 if (entry_count
> total_count
)
5988 entry_count
= total_count
;
5992 total_freq
= entry
->dest
->frequency
;
5993 entry_freq
= EDGE_FREQUENCY (entry
);
5994 /* Fix up corner cases, to avoid division by zero or creation of negative
5996 if (total_freq
== 0)
5998 else if (entry_freq
> total_freq
)
5999 entry_freq
= total_freq
;
6002 copy_bbs (region
, n_region
, region_copy
, &exit
, 1, &exit_copy
, loop
,
6003 split_edge_bb_loc (entry
), update_dominance
);
6006 scale_bbs_frequencies_gcov_type (region
, n_region
,
6007 total_count
- entry_count
,
6009 scale_bbs_frequencies_gcov_type (region_copy
, n_region
, entry_count
,
6014 scale_bbs_frequencies_int (region
, n_region
, total_freq
- entry_freq
,
6016 scale_bbs_frequencies_int (region_copy
, n_region
, entry_freq
, total_freq
);
6021 loop
->header
= exit
->dest
;
6022 loop
->latch
= exit
->src
;
6025 /* Redirect the entry and add the phi node arguments. */
6026 redirected
= redirect_edge_and_branch (entry
, get_bb_copy (entry
->dest
));
6027 gcc_assert (redirected
!= NULL
);
6028 flush_pending_stmts (entry
);
6030 /* Concerning updating of dominators: We must recount dominators
6031 for entry block and its copy. Anything that is outside of the
6032 region, but was dominated by something inside needs recounting as
6034 if (update_dominance
)
6036 set_immediate_dominator (CDI_DOMINATORS
, entry
->dest
, entry
->src
);
6037 doms
.safe_push (get_bb_original (entry
->dest
));
6038 iterate_fix_dominators (CDI_DOMINATORS
, doms
, false);
6042 /* Add the other PHI node arguments. */
6043 add_phi_args_after_copy (region_copy
, n_region
, NULL
);
6045 if (free_region_copy
)
6048 free_original_copy_tables ();
6052 /* Checks if BB is part of the region defined by N_REGION BBS. */
6054 bb_part_of_region_p (basic_block bb
, basic_block
* bbs
, unsigned n_region
)
6058 for (n
= 0; n
< n_region
; n
++)
6066 /* Duplicates REGION consisting of N_REGION blocks. The new blocks
6067 are stored to REGION_COPY in the same order in that they appear
6068 in REGION, if REGION_COPY is not NULL. ENTRY is the entry to
6069 the region, EXIT an exit from it. The condition guarding EXIT
6070 is moved to ENTRY. Returns true if duplication succeeds, false
6096 gimple_duplicate_sese_tail (edge entry ATTRIBUTE_UNUSED
, edge exit ATTRIBUTE_UNUSED
,
6097 basic_block
*region ATTRIBUTE_UNUSED
, unsigned n_region ATTRIBUTE_UNUSED
,
6098 basic_block
*region_copy ATTRIBUTE_UNUSED
)
6101 bool free_region_copy
= false;
6102 struct loop
*loop
= exit
->dest
->loop_father
;
6103 struct loop
*orig_loop
= entry
->dest
->loop_father
;
6104 basic_block switch_bb
, entry_bb
, nentry_bb
;
6105 vec
<basic_block
> doms
;
6106 int total_freq
= 0, exit_freq
= 0;
6107 gcov_type total_count
= 0, exit_count
= 0;
6108 edge exits
[2], nexits
[2], e
;
6109 gimple_stmt_iterator gsi
;
6112 basic_block exit_bb
;
6113 gimple_stmt_iterator psi
;
6116 struct loop
*target
, *aloop
, *cloop
;
6118 gcc_assert (EDGE_COUNT (exit
->src
->succs
) == 2);
6120 exits
[1] = EDGE_SUCC (exit
->src
, EDGE_SUCC (exit
->src
, 0) == exit
);
6122 if (!can_copy_bbs_p (region
, n_region
))
6125 initialize_original_copy_tables ();
6126 set_loop_copy (orig_loop
, loop
);
6129 for (aloop
= orig_loop
->inner
; aloop
; aloop
= aloop
->next
)
6131 if (bb_part_of_region_p (aloop
->header
, region
, n_region
))
6133 cloop
= duplicate_loop (aloop
, target
);
6134 duplicate_subloops (aloop
, cloop
);
6140 region_copy
= XNEWVEC (basic_block
, n_region
);
6141 free_region_copy
= true;
6144 gcc_assert (!need_ssa_update_p (cfun
));
6146 /* Record blocks outside the region that are dominated by something
6148 doms
= get_dominated_by_region (CDI_DOMINATORS
, region
, n_region
);
6150 if (exit
->src
->count
)
6152 total_count
= exit
->src
->count
;
6153 exit_count
= exit
->count
;
6154 /* Fix up corner cases, to avoid division by zero or creation of negative
6156 if (exit_count
> total_count
)
6157 exit_count
= total_count
;
6161 total_freq
= exit
->src
->frequency
;
6162 exit_freq
= EDGE_FREQUENCY (exit
);
6163 /* Fix up corner cases, to avoid division by zero or creation of negative
6165 if (total_freq
== 0)
6167 if (exit_freq
> total_freq
)
6168 exit_freq
= total_freq
;
6171 copy_bbs (region
, n_region
, region_copy
, exits
, 2, nexits
, orig_loop
,
6172 split_edge_bb_loc (exit
), true);
6175 scale_bbs_frequencies_gcov_type (region
, n_region
,
6176 total_count
- exit_count
,
6178 scale_bbs_frequencies_gcov_type (region_copy
, n_region
, exit_count
,
6183 scale_bbs_frequencies_int (region
, n_region
, total_freq
- exit_freq
,
6185 scale_bbs_frequencies_int (region_copy
, n_region
, exit_freq
, total_freq
);
6188 /* Create the switch block, and put the exit condition to it. */
6189 entry_bb
= entry
->dest
;
6190 nentry_bb
= get_bb_copy (entry_bb
);
6191 if (!last_stmt (entry
->src
)
6192 || !stmt_ends_bb_p (last_stmt (entry
->src
)))
6193 switch_bb
= entry
->src
;
6195 switch_bb
= split_edge (entry
);
6196 set_immediate_dominator (CDI_DOMINATORS
, nentry_bb
, switch_bb
);
6198 gsi
= gsi_last_bb (switch_bb
);
6199 cond_stmt
= last_stmt (exit
->src
);
6200 gcc_assert (gimple_code (cond_stmt
) == GIMPLE_COND
);
6201 cond_stmt
= gimple_copy (cond_stmt
);
6203 gsi_insert_after (&gsi
, cond_stmt
, GSI_NEW_STMT
);
6205 sorig
= single_succ_edge (switch_bb
);
6206 sorig
->flags
= exits
[1]->flags
;
6207 snew
= make_edge (switch_bb
, nentry_bb
, exits
[0]->flags
);
6209 /* Register the new edge from SWITCH_BB in loop exit lists. */
6210 rescan_loop_exit (snew
, true, false);
6212 /* Add the PHI node arguments. */
6213 add_phi_args_after_copy (region_copy
, n_region
, snew
);
6215 /* Get rid of now superfluous conditions and associated edges (and phi node
6217 exit_bb
= exit
->dest
;
6219 e
= redirect_edge_and_branch (exits
[0], exits
[1]->dest
);
6220 PENDING_STMT (e
) = NULL
;
6222 /* The latch of ORIG_LOOP was copied, and so was the backedge
6223 to the original header. We redirect this backedge to EXIT_BB. */
6224 for (i
= 0; i
< n_region
; i
++)
6225 if (get_bb_original (region_copy
[i
]) == orig_loop
->latch
)
6227 gcc_assert (single_succ_edge (region_copy
[i
]));
6228 e
= redirect_edge_and_branch (single_succ_edge (region_copy
[i
]), exit_bb
);
6229 PENDING_STMT (e
) = NULL
;
6230 for (psi
= gsi_start_phis (exit_bb
);
6234 phi
= gsi_stmt (psi
);
6235 def
= PHI_ARG_DEF (phi
, nexits
[0]->dest_idx
);
6236 add_phi_arg (phi
, def
, e
, gimple_phi_arg_location_from_edge (phi
, e
));
6239 e
= redirect_edge_and_branch (nexits
[1], nexits
[0]->dest
);
6240 PENDING_STMT (e
) = NULL
;
6242 /* Anything that is outside of the region, but was dominated by something
6243 inside needs to update dominance info. */
6244 iterate_fix_dominators (CDI_DOMINATORS
, doms
, false);
6246 /* Update the SSA web. */
6247 update_ssa (TODO_update_ssa
);
6249 if (free_region_copy
)
6252 free_original_copy_tables ();
6256 /* Add all the blocks dominated by ENTRY to the array BBS_P. Stop
6257 adding blocks when the dominator traversal reaches EXIT. This
6258 function silently assumes that ENTRY strictly dominates EXIT. */
6261 gather_blocks_in_sese_region (basic_block entry
, basic_block exit
,
6262 vec
<basic_block
> *bbs_p
)
6266 for (son
= first_dom_son (CDI_DOMINATORS
, entry
);
6268 son
= next_dom_son (CDI_DOMINATORS
, son
))
6270 bbs_p
->safe_push (son
);
6272 gather_blocks_in_sese_region (son
, exit
, bbs_p
);
6276 /* Replaces *TP with a duplicate (belonging to function TO_CONTEXT).
6277 The duplicates are recorded in VARS_MAP. */
6280 replace_by_duplicate_decl (tree
*tp
, hash_map
<tree
, tree
> *vars_map
,
6283 tree t
= *tp
, new_t
;
6284 struct function
*f
= DECL_STRUCT_FUNCTION (to_context
);
6286 if (DECL_CONTEXT (t
) == to_context
)
6290 tree
&loc
= vars_map
->get_or_insert (t
, &existed
);
6296 new_t
= copy_var_decl (t
, DECL_NAME (t
), TREE_TYPE (t
));
6297 add_local_decl (f
, new_t
);
6301 gcc_assert (TREE_CODE (t
) == CONST_DECL
);
6302 new_t
= copy_node (t
);
6304 DECL_CONTEXT (new_t
) = to_context
;
6315 /* Creates an ssa name in TO_CONTEXT equivalent to NAME.
6316 VARS_MAP maps old ssa names and var_decls to the new ones. */
6319 replace_ssa_name (tree name
, hash_map
<tree
, tree
> *vars_map
,
6324 gcc_assert (!virtual_operand_p (name
));
6326 tree
*loc
= vars_map
->get (name
);
6330 tree decl
= SSA_NAME_VAR (name
);
6333 replace_by_duplicate_decl (&decl
, vars_map
, to_context
);
6334 new_name
= make_ssa_name_fn (DECL_STRUCT_FUNCTION (to_context
),
6335 decl
, SSA_NAME_DEF_STMT (name
));
6336 if (SSA_NAME_IS_DEFAULT_DEF (name
))
6337 set_ssa_default_def (DECL_STRUCT_FUNCTION (to_context
),
6341 new_name
= copy_ssa_name_fn (DECL_STRUCT_FUNCTION (to_context
),
6342 name
, SSA_NAME_DEF_STMT (name
));
6344 vars_map
->put (name
, new_name
);
6358 hash_map
<tree
, tree
> *vars_map
;
6359 htab_t new_label_map
;
6360 hash_map
<void *, void *> *eh_map
;
6364 /* Helper for move_block_to_fn. Set TREE_BLOCK in every expression
6365 contained in *TP if it has been ORIG_BLOCK previously and change the
6366 DECL_CONTEXT of every local variable referenced in *TP. */
6369 move_stmt_op (tree
*tp
, int *walk_subtrees
, void *data
)
6371 struct walk_stmt_info
*wi
= (struct walk_stmt_info
*) data
;
6372 struct move_stmt_d
*p
= (struct move_stmt_d
*) wi
->info
;
6377 tree block
= TREE_BLOCK (t
);
6378 if (block
== p
->orig_block
6379 || (p
->orig_block
== NULL_TREE
6380 && block
!= NULL_TREE
))
6381 TREE_SET_BLOCK (t
, p
->new_block
);
6382 #ifdef ENABLE_CHECKING
6383 else if (block
!= NULL_TREE
)
6385 while (block
&& TREE_CODE (block
) == BLOCK
&& block
!= p
->orig_block
)
6386 block
= BLOCK_SUPERCONTEXT (block
);
6387 gcc_assert (block
== p
->orig_block
);
6391 else if (DECL_P (t
) || TREE_CODE (t
) == SSA_NAME
)
6393 if (TREE_CODE (t
) == SSA_NAME
)
6394 *tp
= replace_ssa_name (t
, p
->vars_map
, p
->to_context
);
6395 else if (TREE_CODE (t
) == LABEL_DECL
)
6397 if (p
->new_label_map
)
6399 struct tree_map in
, *out
;
6401 out
= (struct tree_map
*)
6402 htab_find_with_hash (p
->new_label_map
, &in
, DECL_UID (t
));
6407 DECL_CONTEXT (t
) = p
->to_context
;
6409 else if (p
->remap_decls_p
)
6411 /* Replace T with its duplicate. T should no longer appear in the
6412 parent function, so this looks wasteful; however, it may appear
6413 in referenced_vars, and more importantly, as virtual operands of
6414 statements, and in alias lists of other variables. It would be
6415 quite difficult to expunge it from all those places. ??? It might
6416 suffice to do this for addressable variables. */
6417 if ((TREE_CODE (t
) == VAR_DECL
6418 && !is_global_var (t
))
6419 || TREE_CODE (t
) == CONST_DECL
)
6420 replace_by_duplicate_decl (tp
, p
->vars_map
, p
->to_context
);
6424 else if (TYPE_P (t
))
6430 /* Helper for move_stmt_r. Given an EH region number for the source
6431 function, map that to the duplicate EH regio number in the dest. */
6434 move_stmt_eh_region_nr (int old_nr
, struct move_stmt_d
*p
)
6436 eh_region old_r
, new_r
;
6438 old_r
= get_eh_region_from_number (old_nr
);
6439 new_r
= static_cast<eh_region
> (*p
->eh_map
->get (old_r
));
6441 return new_r
->index
;
6444 /* Similar, but operate on INTEGER_CSTs. */
6447 move_stmt_eh_region_tree_nr (tree old_t_nr
, struct move_stmt_d
*p
)
6451 old_nr
= tree_to_shwi (old_t_nr
);
6452 new_nr
= move_stmt_eh_region_nr (old_nr
, p
);
6454 return build_int_cst (integer_type_node
, new_nr
);
6457 /* Like move_stmt_op, but for gimple statements.
6459 Helper for move_block_to_fn. Set GIMPLE_BLOCK in every expression
6460 contained in the current statement in *GSI_P and change the
6461 DECL_CONTEXT of every local variable referenced in the current
6465 move_stmt_r (gimple_stmt_iterator
*gsi_p
, bool *handled_ops_p
,
6466 struct walk_stmt_info
*wi
)
6468 struct move_stmt_d
*p
= (struct move_stmt_d
*) wi
->info
;
6469 gimple stmt
= gsi_stmt (*gsi_p
);
6470 tree block
= gimple_block (stmt
);
6472 if (block
== p
->orig_block
6473 || (p
->orig_block
== NULL_TREE
6474 && block
!= NULL_TREE
))
6475 gimple_set_block (stmt
, p
->new_block
);
6477 switch (gimple_code (stmt
))
6480 /* Remap the region numbers for __builtin_eh_{pointer,filter}. */
6482 tree r
, fndecl
= gimple_call_fndecl (stmt
);
6483 if (fndecl
&& DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
)
6484 switch (DECL_FUNCTION_CODE (fndecl
))
6486 case BUILT_IN_EH_COPY_VALUES
:
6487 r
= gimple_call_arg (stmt
, 1);
6488 r
= move_stmt_eh_region_tree_nr (r
, p
);
6489 gimple_call_set_arg (stmt
, 1, r
);
6492 case BUILT_IN_EH_POINTER
:
6493 case BUILT_IN_EH_FILTER
:
6494 r
= gimple_call_arg (stmt
, 0);
6495 r
= move_stmt_eh_region_tree_nr (r
, p
);
6496 gimple_call_set_arg (stmt
, 0, r
);
6507 int r
= gimple_resx_region (stmt
);
6508 r
= move_stmt_eh_region_nr (r
, p
);
6509 gimple_resx_set_region (stmt
, r
);
6513 case GIMPLE_EH_DISPATCH
:
6515 int r
= gimple_eh_dispatch_region (stmt
);
6516 r
= move_stmt_eh_region_nr (r
, p
);
6517 gimple_eh_dispatch_set_region (stmt
, r
);
6521 case GIMPLE_OMP_RETURN
:
6522 case GIMPLE_OMP_CONTINUE
:
6525 if (is_gimple_omp (stmt
))
6527 /* Do not remap variables inside OMP directives. Variables
6528 referenced in clauses and directive header belong to the
6529 parent function and should not be moved into the child
6531 bool save_remap_decls_p
= p
->remap_decls_p
;
6532 p
->remap_decls_p
= false;
6533 *handled_ops_p
= true;
6535 walk_gimple_seq_mod (gimple_omp_body_ptr (stmt
), move_stmt_r
,
6538 p
->remap_decls_p
= save_remap_decls_p
;
6546 /* Move basic block BB from function CFUN to function DEST_FN. The
6547 block is moved out of the original linked list and placed after
6548 block AFTER in the new list. Also, the block is removed from the
6549 original array of blocks and placed in DEST_FN's array of blocks.
6550 If UPDATE_EDGE_COUNT_P is true, the edge counts on both CFGs is
6551 updated to reflect the moved edges.
6553 The local variables are remapped to new instances, VARS_MAP is used
6554 to record the mapping. */
6557 move_block_to_fn (struct function
*dest_cfun
, basic_block bb
,
6558 basic_block after
, bool update_edge_count_p
,
6559 struct move_stmt_d
*d
)
6561 struct control_flow_graph
*cfg
;
6564 gimple_stmt_iterator si
;
6565 unsigned old_len
, new_len
;
6567 /* Remove BB from dominance structures. */
6568 delete_from_dominance_info (CDI_DOMINATORS
, bb
);
6570 /* Move BB from its current loop to the copy in the new function. */
6573 struct loop
*new_loop
= (struct loop
*)bb
->loop_father
->aux
;
6575 bb
->loop_father
= new_loop
;
6578 /* Link BB to the new linked list. */
6579 move_block_after (bb
, after
);
6581 /* Update the edge count in the corresponding flowgraphs. */
6582 if (update_edge_count_p
)
6583 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
6585 cfun
->cfg
->x_n_edges
--;
6586 dest_cfun
->cfg
->x_n_edges
++;
6589 /* Remove BB from the original basic block array. */
6590 (*cfun
->cfg
->x_basic_block_info
)[bb
->index
] = NULL
;
6591 cfun
->cfg
->x_n_basic_blocks
--;
6593 /* Grow DEST_CFUN's basic block array if needed. */
6594 cfg
= dest_cfun
->cfg
;
6595 cfg
->x_n_basic_blocks
++;
6596 if (bb
->index
>= cfg
->x_last_basic_block
)
6597 cfg
->x_last_basic_block
= bb
->index
+ 1;
6599 old_len
= vec_safe_length (cfg
->x_basic_block_info
);
6600 if ((unsigned) cfg
->x_last_basic_block
>= old_len
)
6602 new_len
= cfg
->x_last_basic_block
+ (cfg
->x_last_basic_block
+ 3) / 4;
6603 vec_safe_grow_cleared (cfg
->x_basic_block_info
, new_len
);
6606 (*cfg
->x_basic_block_info
)[bb
->index
] = bb
;
6608 /* Remap the variables in phi nodes. */
6609 for (si
= gsi_start_phis (bb
); !gsi_end_p (si
); )
6611 gimple phi
= gsi_stmt (si
);
6613 tree op
= PHI_RESULT (phi
);
6617 if (virtual_operand_p (op
))
6619 /* Remove the phi nodes for virtual operands (alias analysis will be
6620 run for the new function, anyway). */
6621 remove_phi_node (&si
, true);
6625 SET_PHI_RESULT (phi
,
6626 replace_ssa_name (op
, d
->vars_map
, dest_cfun
->decl
));
6627 FOR_EACH_PHI_ARG (use
, phi
, oi
, SSA_OP_USE
)
6629 op
= USE_FROM_PTR (use
);
6630 if (TREE_CODE (op
) == SSA_NAME
)
6631 SET_USE (use
, replace_ssa_name (op
, d
->vars_map
, dest_cfun
->decl
));
6634 for (i
= 0; i
< EDGE_COUNT (bb
->preds
); i
++)
6636 location_t locus
= gimple_phi_arg_location (phi
, i
);
6637 tree block
= LOCATION_BLOCK (locus
);
6639 if (locus
== UNKNOWN_LOCATION
)
6641 if (d
->orig_block
== NULL_TREE
|| block
== d
->orig_block
)
6643 if (d
->new_block
== NULL_TREE
)
6644 locus
= LOCATION_LOCUS (locus
);
6646 locus
= COMBINE_LOCATION_DATA (line_table
, locus
, d
->new_block
);
6647 gimple_phi_arg_set_location (phi
, i
, locus
);
6654 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
6656 gimple stmt
= gsi_stmt (si
);
6657 struct walk_stmt_info wi
;
6659 memset (&wi
, 0, sizeof (wi
));
6661 walk_gimple_stmt (&si
, move_stmt_r
, move_stmt_op
, &wi
);
6663 if (gimple_code (stmt
) == GIMPLE_LABEL
)
6665 tree label
= gimple_label_label (stmt
);
6666 int uid
= LABEL_DECL_UID (label
);
6668 gcc_assert (uid
> -1);
6670 old_len
= vec_safe_length (cfg
->x_label_to_block_map
);
6671 if (old_len
<= (unsigned) uid
)
6673 new_len
= 3 * uid
/ 2 + 1;
6674 vec_safe_grow_cleared (cfg
->x_label_to_block_map
, new_len
);
6677 (*cfg
->x_label_to_block_map
)[uid
] = bb
;
6678 (*cfun
->cfg
->x_label_to_block_map
)[uid
] = NULL
;
6680 gcc_assert (DECL_CONTEXT (label
) == dest_cfun
->decl
);
6682 if (uid
>= dest_cfun
->cfg
->last_label_uid
)
6683 dest_cfun
->cfg
->last_label_uid
= uid
+ 1;
6686 maybe_duplicate_eh_stmt_fn (dest_cfun
, stmt
, cfun
, stmt
, d
->eh_map
, 0);
6687 remove_stmt_from_eh_lp_fn (cfun
, stmt
);
6689 gimple_duplicate_stmt_histograms (dest_cfun
, stmt
, cfun
, stmt
);
6690 gimple_remove_stmt_histograms (cfun
, stmt
);
6692 /* We cannot leave any operands allocated from the operand caches of
6693 the current function. */
6694 free_stmt_operands (cfun
, stmt
);
6695 push_cfun (dest_cfun
);
6700 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
6701 if (e
->goto_locus
!= UNKNOWN_LOCATION
)
6703 tree block
= LOCATION_BLOCK (e
->goto_locus
);
6704 if (d
->orig_block
== NULL_TREE
6705 || block
== d
->orig_block
)
6706 e
->goto_locus
= d
->new_block
?
6707 COMBINE_LOCATION_DATA (line_table
, e
->goto_locus
, d
->new_block
) :
6708 LOCATION_LOCUS (e
->goto_locus
);
6712 /* Examine the statements in BB (which is in SRC_CFUN); find and return
6713 the outermost EH region. Use REGION as the incoming base EH region. */
6716 find_outermost_region_in_block (struct function
*src_cfun
,
6717 basic_block bb
, eh_region region
)
6719 gimple_stmt_iterator si
;
6721 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
6723 gimple stmt
= gsi_stmt (si
);
6724 eh_region stmt_region
;
6727 lp_nr
= lookup_stmt_eh_lp_fn (src_cfun
, stmt
);
6728 stmt_region
= get_eh_region_from_lp_number_fn (src_cfun
, lp_nr
);
6732 region
= stmt_region
;
6733 else if (stmt_region
!= region
)
6735 region
= eh_region_outermost (src_cfun
, stmt_region
, region
);
6736 gcc_assert (region
!= NULL
);
6745 new_label_mapper (tree decl
, void *data
)
6747 htab_t hash
= (htab_t
) data
;
6751 gcc_assert (TREE_CODE (decl
) == LABEL_DECL
);
6753 m
= XNEW (struct tree_map
);
6754 m
->hash
= DECL_UID (decl
);
6755 m
->base
.from
= decl
;
6756 m
->to
= create_artificial_label (UNKNOWN_LOCATION
);
6757 LABEL_DECL_UID (m
->to
) = LABEL_DECL_UID (decl
);
6758 if (LABEL_DECL_UID (m
->to
) >= cfun
->cfg
->last_label_uid
)
6759 cfun
->cfg
->last_label_uid
= LABEL_DECL_UID (m
->to
) + 1;
6761 slot
= htab_find_slot_with_hash (hash
, m
, m
->hash
, INSERT
);
6762 gcc_assert (*slot
== NULL
);
6769 /* Change DECL_CONTEXT of all BLOCK_VARS in block, including
6773 replace_block_vars_by_duplicates (tree block
, hash_map
<tree
, tree
> *vars_map
,
6778 for (tp
= &BLOCK_VARS (block
); *tp
; tp
= &DECL_CHAIN (*tp
))
6781 if (TREE_CODE (t
) != VAR_DECL
&& TREE_CODE (t
) != CONST_DECL
)
6783 replace_by_duplicate_decl (&t
, vars_map
, to_context
);
6786 if (TREE_CODE (*tp
) == VAR_DECL
&& DECL_HAS_VALUE_EXPR_P (*tp
))
6788 SET_DECL_VALUE_EXPR (t
, DECL_VALUE_EXPR (*tp
));
6789 DECL_HAS_VALUE_EXPR_P (t
) = 1;
6791 DECL_CHAIN (t
) = DECL_CHAIN (*tp
);
6796 for (block
= BLOCK_SUBBLOCKS (block
); block
; block
= BLOCK_CHAIN (block
))
6797 replace_block_vars_by_duplicates (block
, vars_map
, to_context
);
6800 /* Fixup the loop arrays and numbers after moving LOOP and its subloops
6804 fixup_loop_arrays_after_move (struct function
*fn1
, struct function
*fn2
,
6807 /* Discard it from the old loop array. */
6808 (*get_loops (fn1
))[loop
->num
] = NULL
;
6810 /* Place it in the new loop array, assigning it a new number. */
6811 loop
->num
= number_of_loops (fn2
);
6812 vec_safe_push (loops_for_fn (fn2
)->larray
, loop
);
6814 /* Recurse to children. */
6815 for (loop
= loop
->inner
; loop
; loop
= loop
->next
)
6816 fixup_loop_arrays_after_move (fn1
, fn2
, loop
);
6819 /* Move a single-entry, single-exit region delimited by ENTRY_BB and
6820 EXIT_BB to function DEST_CFUN. The whole region is replaced by a
6821 single basic block in the original CFG and the new basic block is
6822 returned. DEST_CFUN must not have a CFG yet.
6824 Note that the region need not be a pure SESE region. Blocks inside
6825 the region may contain calls to abort/exit. The only restriction
6826 is that ENTRY_BB should be the only entry point and it must
6829 Change TREE_BLOCK of all statements in ORIG_BLOCK to the new
6830 functions outermost BLOCK, move all subblocks of ORIG_BLOCK
6831 to the new function.
6833 All local variables referenced in the region are assumed to be in
6834 the corresponding BLOCK_VARS and unexpanded variable lists
6835 associated with DEST_CFUN. */
6838 move_sese_region_to_fn (struct function
*dest_cfun
, basic_block entry_bb
,
6839 basic_block exit_bb
, tree orig_block
)
6841 vec
<basic_block
> bbs
, dom_bbs
;
6842 basic_block dom_entry
= get_immediate_dominator (CDI_DOMINATORS
, entry_bb
);
6843 basic_block after
, bb
, *entry_pred
, *exit_succ
, abb
;
6844 struct function
*saved_cfun
= cfun
;
6845 int *entry_flag
, *exit_flag
;
6846 unsigned *entry_prob
, *exit_prob
;
6847 unsigned i
, num_entry_edges
, num_exit_edges
, num_nodes
;
6850 htab_t new_label_map
;
6851 hash_map
<void *, void *> *eh_map
;
6852 struct loop
*loop
= entry_bb
->loop_father
;
6853 struct loop
*loop0
= get_loop (saved_cfun
, 0);
6854 struct move_stmt_d d
;
6856 /* If ENTRY does not strictly dominate EXIT, this cannot be an SESE
6858 gcc_assert (entry_bb
!= exit_bb
6860 || dominated_by_p (CDI_DOMINATORS
, exit_bb
, entry_bb
)));
6862 /* Collect all the blocks in the region. Manually add ENTRY_BB
6863 because it won't be added by dfs_enumerate_from. */
6865 bbs
.safe_push (entry_bb
);
6866 gather_blocks_in_sese_region (entry_bb
, exit_bb
, &bbs
);
6868 /* The blocks that used to be dominated by something in BBS will now be
6869 dominated by the new block. */
6870 dom_bbs
= get_dominated_by_region (CDI_DOMINATORS
,
6874 /* Detach ENTRY_BB and EXIT_BB from CFUN->CFG. We need to remember
6875 the predecessor edges to ENTRY_BB and the successor edges to
6876 EXIT_BB so that we can re-attach them to the new basic block that
6877 will replace the region. */
6878 num_entry_edges
= EDGE_COUNT (entry_bb
->preds
);
6879 entry_pred
= XNEWVEC (basic_block
, num_entry_edges
);
6880 entry_flag
= XNEWVEC (int, num_entry_edges
);
6881 entry_prob
= XNEWVEC (unsigned, num_entry_edges
);
6883 for (ei
= ei_start (entry_bb
->preds
); (e
= ei_safe_edge (ei
)) != NULL
;)
6885 entry_prob
[i
] = e
->probability
;
6886 entry_flag
[i
] = e
->flags
;
6887 entry_pred
[i
++] = e
->src
;
6893 num_exit_edges
= EDGE_COUNT (exit_bb
->succs
);
6894 exit_succ
= XNEWVEC (basic_block
, num_exit_edges
);
6895 exit_flag
= XNEWVEC (int, num_exit_edges
);
6896 exit_prob
= XNEWVEC (unsigned, num_exit_edges
);
6898 for (ei
= ei_start (exit_bb
->succs
); (e
= ei_safe_edge (ei
)) != NULL
;)
6900 exit_prob
[i
] = e
->probability
;
6901 exit_flag
[i
] = e
->flags
;
6902 exit_succ
[i
++] = e
->dest
;
6914 /* Switch context to the child function to initialize DEST_FN's CFG. */
6915 gcc_assert (dest_cfun
->cfg
== NULL
);
6916 push_cfun (dest_cfun
);
6918 init_empty_tree_cfg ();
6920 /* Initialize EH information for the new function. */
6922 new_label_map
= NULL
;
6925 eh_region region
= NULL
;
6927 FOR_EACH_VEC_ELT (bbs
, i
, bb
)
6928 region
= find_outermost_region_in_block (saved_cfun
, bb
, region
);
6930 init_eh_for_function ();
6933 new_label_map
= htab_create (17, tree_map_hash
, tree_map_eq
, free
);
6934 eh_map
= duplicate_eh_regions (saved_cfun
, region
, 0,
6935 new_label_mapper
, new_label_map
);
6939 /* Initialize an empty loop tree. */
6940 struct loops
*loops
= ggc_cleared_alloc
<struct loops
> ();
6941 init_loops_structure (dest_cfun
, loops
, 1);
6942 loops
->state
= LOOPS_MAY_HAVE_MULTIPLE_LATCHES
;
6943 set_loops_for_fn (dest_cfun
, loops
);
6945 /* Move the outlined loop tree part. */
6946 num_nodes
= bbs
.length ();
6947 FOR_EACH_VEC_ELT (bbs
, i
, bb
)
6949 if (bb
->loop_father
->header
== bb
)
6951 struct loop
*this_loop
= bb
->loop_father
;
6952 struct loop
*outer
= loop_outer (this_loop
);
6954 /* If the SESE region contains some bbs ending with
6955 a noreturn call, those are considered to belong
6956 to the outermost loop in saved_cfun, rather than
6957 the entry_bb's loop_father. */
6961 num_nodes
-= this_loop
->num_nodes
;
6962 flow_loop_tree_node_remove (bb
->loop_father
);
6963 flow_loop_tree_node_add (get_loop (dest_cfun
, 0), this_loop
);
6964 fixup_loop_arrays_after_move (saved_cfun
, cfun
, this_loop
);
6967 else if (bb
->loop_father
== loop0
&& loop0
!= loop
)
6970 /* Remove loop exits from the outlined region. */
6971 if (loops_for_fn (saved_cfun
)->exits
)
6972 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
6974 void **slot
= htab_find_slot_with_hash
6975 (loops_for_fn (saved_cfun
)->exits
, e
,
6976 htab_hash_pointer (e
), NO_INSERT
);
6978 htab_clear_slot (loops_for_fn (saved_cfun
)->exits
, slot
);
6983 /* Adjust the number of blocks in the tree root of the outlined part. */
6984 get_loop (dest_cfun
, 0)->num_nodes
= bbs
.length () + 2;
6986 /* Setup a mapping to be used by move_block_to_fn. */
6987 loop
->aux
= current_loops
->tree_root
;
6988 loop0
->aux
= current_loops
->tree_root
;
6992 /* Move blocks from BBS into DEST_CFUN. */
6993 gcc_assert (bbs
.length () >= 2);
6994 after
= dest_cfun
->cfg
->x_entry_block_ptr
;
6995 hash_map
<tree
, tree
> vars_map
;
6997 memset (&d
, 0, sizeof (d
));
6998 d
.orig_block
= orig_block
;
6999 d
.new_block
= DECL_INITIAL (dest_cfun
->decl
);
7000 d
.from_context
= cfun
->decl
;
7001 d
.to_context
= dest_cfun
->decl
;
7002 d
.vars_map
= &vars_map
;
7003 d
.new_label_map
= new_label_map
;
7005 d
.remap_decls_p
= true;
7007 FOR_EACH_VEC_ELT (bbs
, i
, bb
)
7009 /* No need to update edge counts on the last block. It has
7010 already been updated earlier when we detached the region from
7011 the original CFG. */
7012 move_block_to_fn (dest_cfun
, bb
, after
, bb
!= exit_bb
, &d
);
7018 /* Loop sizes are no longer correct, fix them up. */
7019 loop
->num_nodes
-= num_nodes
;
7020 for (struct loop
*outer
= loop_outer (loop
);
7021 outer
; outer
= loop_outer (outer
))
7022 outer
->num_nodes
-= num_nodes
;
7023 loop0
->num_nodes
-= bbs
.length () - num_nodes
;
7025 if (saved_cfun
->has_simduid_loops
|| saved_cfun
->has_force_vectorize_loops
)
7028 for (i
= 0; vec_safe_iterate (loops
->larray
, i
, &aloop
); i
++)
7033 replace_by_duplicate_decl (&aloop
->simduid
, d
.vars_map
,
7035 dest_cfun
->has_simduid_loops
= true;
7037 if (aloop
->force_vectorize
)
7038 dest_cfun
->has_force_vectorize_loops
= true;
7042 /* Rewire BLOCK_SUBBLOCKS of orig_block. */
7046 gcc_assert (BLOCK_SUBBLOCKS (DECL_INITIAL (dest_cfun
->decl
))
7048 BLOCK_SUBBLOCKS (DECL_INITIAL (dest_cfun
->decl
))
7049 = BLOCK_SUBBLOCKS (orig_block
);
7050 for (block
= BLOCK_SUBBLOCKS (orig_block
);
7051 block
; block
= BLOCK_CHAIN (block
))
7052 BLOCK_SUPERCONTEXT (block
) = DECL_INITIAL (dest_cfun
->decl
);
7053 BLOCK_SUBBLOCKS (orig_block
) = NULL_TREE
;
7056 replace_block_vars_by_duplicates (DECL_INITIAL (dest_cfun
->decl
),
7057 &vars_map
, dest_cfun
->decl
);
7060 htab_delete (new_label_map
);
7064 /* Rewire the entry and exit blocks. The successor to the entry
7065 block turns into the successor of DEST_FN's ENTRY_BLOCK_PTR in
7066 the child function. Similarly, the predecessor of DEST_FN's
7067 EXIT_BLOCK_PTR turns into the predecessor of EXIT_BLOCK_PTR. We
7068 need to switch CFUN between DEST_CFUN and SAVED_CFUN so that the
7069 various CFG manipulation function get to the right CFG.
7071 FIXME, this is silly. The CFG ought to become a parameter to
7073 push_cfun (dest_cfun
);
7074 make_edge (ENTRY_BLOCK_PTR_FOR_FN (cfun
), entry_bb
, EDGE_FALLTHRU
);
7076 make_edge (exit_bb
, EXIT_BLOCK_PTR_FOR_FN (cfun
), 0);
7079 /* Back in the original function, the SESE region has disappeared,
7080 create a new basic block in its place. */
7081 bb
= create_empty_bb (entry_pred
[0]);
7083 add_bb_to_loop (bb
, loop
);
7084 for (i
= 0; i
< num_entry_edges
; i
++)
7086 e
= make_edge (entry_pred
[i
], bb
, entry_flag
[i
]);
7087 e
->probability
= entry_prob
[i
];
7090 for (i
= 0; i
< num_exit_edges
; i
++)
7092 e
= make_edge (bb
, exit_succ
[i
], exit_flag
[i
]);
7093 e
->probability
= exit_prob
[i
];
7096 set_immediate_dominator (CDI_DOMINATORS
, bb
, dom_entry
);
7097 FOR_EACH_VEC_ELT (dom_bbs
, i
, abb
)
7098 set_immediate_dominator (CDI_DOMINATORS
, abb
, bb
);
7116 /* Dump FUNCTION_DECL FN to file FILE using FLAGS (see TDF_* in dumpfile.h)
7120 dump_function_to_file (tree fndecl
, FILE *file
, int flags
)
7122 tree arg
, var
, old_current_fndecl
= current_function_decl
;
7123 struct function
*dsf
;
7124 bool ignore_topmost_bind
= false, any_var
= false;
7127 bool tmclone
= (TREE_CODE (fndecl
) == FUNCTION_DECL
7128 && decl_is_tm_clone (fndecl
));
7129 struct function
*fun
= DECL_STRUCT_FUNCTION (fndecl
);
7131 current_function_decl
= fndecl
;
7132 fprintf (file
, "%s %s(", function_name (fun
), tmclone
? "[tm-clone] " : "");
7134 arg
= DECL_ARGUMENTS (fndecl
);
7137 print_generic_expr (file
, TREE_TYPE (arg
), dump_flags
);
7138 fprintf (file
, " ");
7139 print_generic_expr (file
, arg
, dump_flags
);
7140 if (flags
& TDF_VERBOSE
)
7141 print_node (file
, "", arg
, 4);
7142 if (DECL_CHAIN (arg
))
7143 fprintf (file
, ", ");
7144 arg
= DECL_CHAIN (arg
);
7146 fprintf (file
, ")\n");
7148 if (flags
& TDF_VERBOSE
)
7149 print_node (file
, "", fndecl
, 2);
7151 dsf
= DECL_STRUCT_FUNCTION (fndecl
);
7152 if (dsf
&& (flags
& TDF_EH
))
7153 dump_eh_tree (file
, dsf
);
7155 if (flags
& TDF_RAW
&& !gimple_has_body_p (fndecl
))
7157 dump_node (fndecl
, TDF_SLIM
| flags
, file
);
7158 current_function_decl
= old_current_fndecl
;
7162 /* When GIMPLE is lowered, the variables are no longer available in
7163 BIND_EXPRs, so display them separately. */
7164 if (fun
&& fun
->decl
== fndecl
&& (fun
->curr_properties
& PROP_gimple_lcf
))
7167 ignore_topmost_bind
= true;
7169 fprintf (file
, "{\n");
7170 if (!vec_safe_is_empty (fun
->local_decls
))
7171 FOR_EACH_LOCAL_DECL (fun
, ix
, var
)
7173 print_generic_decl (file
, var
, flags
);
7174 if (flags
& TDF_VERBOSE
)
7175 print_node (file
, "", var
, 4);
7176 fprintf (file
, "\n");
7180 if (gimple_in_ssa_p (cfun
))
7181 for (ix
= 1; ix
< num_ssa_names
; ++ix
)
7183 tree name
= ssa_name (ix
);
7184 if (name
&& !SSA_NAME_VAR (name
))
7186 fprintf (file
, " ");
7187 print_generic_expr (file
, TREE_TYPE (name
), flags
);
7188 fprintf (file
, " ");
7189 print_generic_expr (file
, name
, flags
);
7190 fprintf (file
, ";\n");
7197 if (fun
&& fun
->decl
== fndecl
7199 && basic_block_info_for_fn (fun
))
7201 /* If the CFG has been built, emit a CFG-based dump. */
7202 if (!ignore_topmost_bind
)
7203 fprintf (file
, "{\n");
7205 if (any_var
&& n_basic_blocks_for_fn (fun
))
7206 fprintf (file
, "\n");
7208 FOR_EACH_BB_FN (bb
, fun
)
7209 dump_bb (file
, bb
, 2, flags
| TDF_COMMENT
);
7211 fprintf (file
, "}\n");
7213 else if (DECL_SAVED_TREE (fndecl
) == NULL
)
7215 /* The function is now in GIMPLE form but the CFG has not been
7216 built yet. Emit the single sequence of GIMPLE statements
7217 that make up its body. */
7218 gimple_seq body
= gimple_body (fndecl
);
7220 if (gimple_seq_first_stmt (body
)
7221 && gimple_seq_first_stmt (body
) == gimple_seq_last_stmt (body
)
7222 && gimple_code (gimple_seq_first_stmt (body
)) == GIMPLE_BIND
)
7223 print_gimple_seq (file
, body
, 0, flags
);
7226 if (!ignore_topmost_bind
)
7227 fprintf (file
, "{\n");
7230 fprintf (file
, "\n");
7232 print_gimple_seq (file
, body
, 2, flags
);
7233 fprintf (file
, "}\n");
7240 /* Make a tree based dump. */
7241 chain
= DECL_SAVED_TREE (fndecl
);
7242 if (chain
&& TREE_CODE (chain
) == BIND_EXPR
)
7244 if (ignore_topmost_bind
)
7246 chain
= BIND_EXPR_BODY (chain
);
7254 if (!ignore_topmost_bind
)
7255 fprintf (file
, "{\n");
7260 fprintf (file
, "\n");
7262 print_generic_stmt_indented (file
, chain
, flags
, indent
);
7263 if (ignore_topmost_bind
)
7264 fprintf (file
, "}\n");
7267 if (flags
& TDF_ENUMERATE_LOCALS
)
7268 dump_enumerated_decls (file
, flags
);
7269 fprintf (file
, "\n\n");
7271 current_function_decl
= old_current_fndecl
;
7274 /* Dump FUNCTION_DECL FN to stderr using FLAGS (see TDF_* in tree.h) */
7277 debug_function (tree fn
, int flags
)
7279 dump_function_to_file (fn
, stderr
, flags
);
7283 /* Print on FILE the indexes for the predecessors of basic_block BB. */
7286 print_pred_bbs (FILE *file
, basic_block bb
)
7291 FOR_EACH_EDGE (e
, ei
, bb
->preds
)
7292 fprintf (file
, "bb_%d ", e
->src
->index
);
7296 /* Print on FILE the indexes for the successors of basic_block BB. */
7299 print_succ_bbs (FILE *file
, basic_block bb
)
7304 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
7305 fprintf (file
, "bb_%d ", e
->dest
->index
);
7308 /* Print to FILE the basic block BB following the VERBOSITY level. */
7311 print_loops_bb (FILE *file
, basic_block bb
, int indent
, int verbosity
)
7313 char *s_indent
= (char *) alloca ((size_t) indent
+ 1);
7314 memset ((void *) s_indent
, ' ', (size_t) indent
);
7315 s_indent
[indent
] = '\0';
7317 /* Print basic_block's header. */
7320 fprintf (file
, "%s bb_%d (preds = {", s_indent
, bb
->index
);
7321 print_pred_bbs (file
, bb
);
7322 fprintf (file
, "}, succs = {");
7323 print_succ_bbs (file
, bb
);
7324 fprintf (file
, "})\n");
7327 /* Print basic_block's body. */
7330 fprintf (file
, "%s {\n", s_indent
);
7331 dump_bb (file
, bb
, indent
+ 4, TDF_VOPS
|TDF_MEMSYMS
);
7332 fprintf (file
, "%s }\n", s_indent
);
7336 static void print_loop_and_siblings (FILE *, struct loop
*, int, int);
7338 /* Pretty print LOOP on FILE, indented INDENT spaces. Following
7339 VERBOSITY level this outputs the contents of the loop, or just its
7343 print_loop (FILE *file
, struct loop
*loop
, int indent
, int verbosity
)
7351 s_indent
= (char *) alloca ((size_t) indent
+ 1);
7352 memset ((void *) s_indent
, ' ', (size_t) indent
);
7353 s_indent
[indent
] = '\0';
7355 /* Print loop's header. */
7356 fprintf (file
, "%sloop_%d (", s_indent
, loop
->num
);
7358 fprintf (file
, "header = %d", loop
->header
->index
);
7361 fprintf (file
, "deleted)\n");
7365 fprintf (file
, ", latch = %d", loop
->latch
->index
);
7367 fprintf (file
, ", multiple latches");
7368 fprintf (file
, ", niter = ");
7369 print_generic_expr (file
, loop
->nb_iterations
, 0);
7371 if (loop
->any_upper_bound
)
7373 fprintf (file
, ", upper_bound = ");
7374 print_decu (loop
->nb_iterations_upper_bound
, file
);
7377 if (loop
->any_estimate
)
7379 fprintf (file
, ", estimate = ");
7380 print_decu (loop
->nb_iterations_estimate
, file
);
7382 fprintf (file
, ")\n");
7384 /* Print loop's body. */
7387 fprintf (file
, "%s{\n", s_indent
);
7388 FOR_EACH_BB_FN (bb
, cfun
)
7389 if (bb
->loop_father
== loop
)
7390 print_loops_bb (file
, bb
, indent
, verbosity
);
7392 print_loop_and_siblings (file
, loop
->inner
, indent
+ 2, verbosity
);
7393 fprintf (file
, "%s}\n", s_indent
);
7397 /* Print the LOOP and its sibling loops on FILE, indented INDENT
7398 spaces. Following VERBOSITY level this outputs the contents of the
7399 loop, or just its structure. */
7402 print_loop_and_siblings (FILE *file
, struct loop
*loop
, int indent
,
7408 print_loop (file
, loop
, indent
, verbosity
);
7409 print_loop_and_siblings (file
, loop
->next
, indent
, verbosity
);
7412 /* Follow a CFG edge from the entry point of the program, and on entry
7413 of a loop, pretty print the loop structure on FILE. */
7416 print_loops (FILE *file
, int verbosity
)
7420 bb
= ENTRY_BLOCK_PTR_FOR_FN (cfun
);
7421 if (bb
&& bb
->loop_father
)
7422 print_loop_and_siblings (file
, bb
->loop_father
, 0, verbosity
);
7428 debug (struct loop
&ref
)
7430 print_loop (stderr
, &ref
, 0, /*verbosity*/0);
7434 debug (struct loop
*ptr
)
7439 fprintf (stderr
, "<nil>\n");
7442 /* Dump a loop verbosely. */
7445 debug_verbose (struct loop
&ref
)
7447 print_loop (stderr
, &ref
, 0, /*verbosity*/3);
7451 debug_verbose (struct loop
*ptr
)
7456 fprintf (stderr
, "<nil>\n");
7460 /* Debugging loops structure at tree level, at some VERBOSITY level. */
7463 debug_loops (int verbosity
)
7465 print_loops (stderr
, verbosity
);
7468 /* Print on stderr the code of LOOP, at some VERBOSITY level. */
7471 debug_loop (struct loop
*loop
, int verbosity
)
7473 print_loop (stderr
, loop
, 0, verbosity
);
7476 /* Print on stderr the code of loop number NUM, at some VERBOSITY
7480 debug_loop_num (unsigned num
, int verbosity
)
7482 debug_loop (get_loop (cfun
, num
), verbosity
);
7485 /* Return true if BB ends with a call, possibly followed by some
7486 instructions that must stay with the call. Return false,
7490 gimple_block_ends_with_call_p (basic_block bb
)
7492 gimple_stmt_iterator gsi
= gsi_last_nondebug_bb (bb
);
7493 return !gsi_end_p (gsi
) && is_gimple_call (gsi_stmt (gsi
));
7497 /* Return true if BB ends with a conditional branch. Return false,
7501 gimple_block_ends_with_condjump_p (const_basic_block bb
)
7503 gimple stmt
= last_stmt (CONST_CAST_BB (bb
));
7504 return (stmt
&& gimple_code (stmt
) == GIMPLE_COND
);
7508 /* Return true if we need to add fake edge to exit at statement T.
7509 Helper function for gimple_flow_call_edges_add. */
7512 need_fake_edge_p (gimple t
)
7514 tree fndecl
= NULL_TREE
;
7517 /* NORETURN and LONGJMP calls already have an edge to exit.
7518 CONST and PURE calls do not need one.
7519 We don't currently check for CONST and PURE here, although
7520 it would be a good idea, because those attributes are
7521 figured out from the RTL in mark_constant_function, and
7522 the counter incrementation code from -fprofile-arcs
7523 leads to different results from -fbranch-probabilities. */
7524 if (is_gimple_call (t
))
7526 fndecl
= gimple_call_fndecl (t
);
7527 call_flags
= gimple_call_flags (t
);
7530 if (is_gimple_call (t
)
7532 && DECL_BUILT_IN (fndecl
)
7533 && (call_flags
& ECF_NOTHROW
)
7534 && !(call_flags
& ECF_RETURNS_TWICE
)
7535 /* fork() doesn't really return twice, but the effect of
7536 wrapping it in __gcov_fork() which calls __gcov_flush()
7537 and clears the counters before forking has the same
7538 effect as returning twice. Force a fake edge. */
7539 && !(DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
7540 && DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_FORK
))
7543 if (is_gimple_call (t
))
7549 if (!(call_flags
& ECF_NORETURN
))
7553 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
7554 if ((e
->flags
& EDGE_FAKE
) == 0)
7558 if (gimple_code (t
) == GIMPLE_ASM
7559 && (gimple_asm_volatile_p (t
) || gimple_asm_input_p (t
)))
7566 /* Add fake edges to the function exit for any non constant and non
7567 noreturn calls (or noreturn calls with EH/abnormal edges),
7568 volatile inline assembly in the bitmap of blocks specified by BLOCKS
7569 or to the whole CFG if BLOCKS is zero. Return the number of blocks
7572 The goal is to expose cases in which entering a basic block does
7573 not imply that all subsequent instructions must be executed. */
7576 gimple_flow_call_edges_add (sbitmap blocks
)
7579 int blocks_split
= 0;
7580 int last_bb
= last_basic_block_for_fn (cfun
);
7581 bool check_last_block
= false;
7583 if (n_basic_blocks_for_fn (cfun
) == NUM_FIXED_BLOCKS
)
7587 check_last_block
= true;
7589 check_last_block
= bitmap_bit_p (blocks
,
7590 EXIT_BLOCK_PTR_FOR_FN (cfun
)->prev_bb
->index
);
7592 /* In the last basic block, before epilogue generation, there will be
7593 a fallthru edge to EXIT. Special care is required if the last insn
7594 of the last basic block is a call because make_edge folds duplicate
7595 edges, which would result in the fallthru edge also being marked
7596 fake, which would result in the fallthru edge being removed by
7597 remove_fake_edges, which would result in an invalid CFG.
7599 Moreover, we can't elide the outgoing fake edge, since the block
7600 profiler needs to take this into account in order to solve the minimal
7601 spanning tree in the case that the call doesn't return.
7603 Handle this by adding a dummy instruction in a new last basic block. */
7604 if (check_last_block
)
7606 basic_block bb
= EXIT_BLOCK_PTR_FOR_FN (cfun
)->prev_bb
;
7607 gimple_stmt_iterator gsi
= gsi_last_nondebug_bb (bb
);
7610 if (!gsi_end_p (gsi
))
7613 if (t
&& need_fake_edge_p (t
))
7617 e
= find_edge (bb
, EXIT_BLOCK_PTR_FOR_FN (cfun
));
7620 gsi_insert_on_edge (e
, gimple_build_nop ());
7621 gsi_commit_edge_inserts ();
7626 /* Now add fake edges to the function exit for any non constant
7627 calls since there is no way that we can determine if they will
7629 for (i
= 0; i
< last_bb
; i
++)
7631 basic_block bb
= BASIC_BLOCK_FOR_FN (cfun
, i
);
7632 gimple_stmt_iterator gsi
;
7633 gimple stmt
, last_stmt
;
7638 if (blocks
&& !bitmap_bit_p (blocks
, i
))
7641 gsi
= gsi_last_nondebug_bb (bb
);
7642 if (!gsi_end_p (gsi
))
7644 last_stmt
= gsi_stmt (gsi
);
7647 stmt
= gsi_stmt (gsi
);
7648 if (need_fake_edge_p (stmt
))
7652 /* The handling above of the final block before the
7653 epilogue should be enough to verify that there is
7654 no edge to the exit block in CFG already.
7655 Calling make_edge in such case would cause us to
7656 mark that edge as fake and remove it later. */
7657 #ifdef ENABLE_CHECKING
7658 if (stmt
== last_stmt
)
7660 e
= find_edge (bb
, EXIT_BLOCK_PTR_FOR_FN (cfun
));
7661 gcc_assert (e
== NULL
);
7665 /* Note that the following may create a new basic block
7666 and renumber the existing basic blocks. */
7667 if (stmt
!= last_stmt
)
7669 e
= split_block (bb
, stmt
);
7673 make_edge (bb
, EXIT_BLOCK_PTR_FOR_FN (cfun
), EDGE_FAKE
);
7677 while (!gsi_end_p (gsi
));
7682 verify_flow_info ();
7684 return blocks_split
;
7687 /* Removes edge E and all the blocks dominated by it, and updates dominance
7688 information. The IL in E->src needs to be updated separately.
7689 If dominance info is not available, only the edge E is removed.*/
7692 remove_edge_and_dominated_blocks (edge e
)
7694 vec
<basic_block
> bbs_to_remove
= vNULL
;
7695 vec
<basic_block
> bbs_to_fix_dom
= vNULL
;
7699 bool none_removed
= false;
7701 basic_block bb
, dbb
;
7704 if (!dom_info_available_p (CDI_DOMINATORS
))
7710 /* No updating is needed for edges to exit. */
7711 if (e
->dest
== EXIT_BLOCK_PTR_FOR_FN (cfun
))
7713 if (cfgcleanup_altered_bbs
)
7714 bitmap_set_bit (cfgcleanup_altered_bbs
, e
->src
->index
);
7719 /* First, we find the basic blocks to remove. If E->dest has a predecessor
7720 that is not dominated by E->dest, then this set is empty. Otherwise,
7721 all the basic blocks dominated by E->dest are removed.
7723 Also, to DF_IDOM we store the immediate dominators of the blocks in
7724 the dominance frontier of E (i.e., of the successors of the
7725 removed blocks, if there are any, and of E->dest otherwise). */
7726 FOR_EACH_EDGE (f
, ei
, e
->dest
->preds
)
7731 if (!dominated_by_p (CDI_DOMINATORS
, f
->src
, e
->dest
))
7733 none_removed
= true;
7738 df
= BITMAP_ALLOC (NULL
);
7739 df_idom
= BITMAP_ALLOC (NULL
);
7742 bitmap_set_bit (df_idom
,
7743 get_immediate_dominator (CDI_DOMINATORS
, e
->dest
)->index
);
7746 bbs_to_remove
= get_all_dominated_blocks (CDI_DOMINATORS
, e
->dest
);
7747 FOR_EACH_VEC_ELT (bbs_to_remove
, i
, bb
)
7749 FOR_EACH_EDGE (f
, ei
, bb
->succs
)
7751 if (f
->dest
!= EXIT_BLOCK_PTR_FOR_FN (cfun
))
7752 bitmap_set_bit (df
, f
->dest
->index
);
7755 FOR_EACH_VEC_ELT (bbs_to_remove
, i
, bb
)
7756 bitmap_clear_bit (df
, bb
->index
);
7758 EXECUTE_IF_SET_IN_BITMAP (df
, 0, i
, bi
)
7760 bb
= BASIC_BLOCK_FOR_FN (cfun
, i
);
7761 bitmap_set_bit (df_idom
,
7762 get_immediate_dominator (CDI_DOMINATORS
, bb
)->index
);
7766 if (cfgcleanup_altered_bbs
)
7768 /* Record the set of the altered basic blocks. */
7769 bitmap_set_bit (cfgcleanup_altered_bbs
, e
->src
->index
);
7770 bitmap_ior_into (cfgcleanup_altered_bbs
, df
);
7773 /* Remove E and the cancelled blocks. */
7778 /* Walk backwards so as to get a chance to substitute all
7779 released DEFs into debug stmts. See
7780 eliminate_unnecessary_stmts() in tree-ssa-dce.c for more
7782 for (i
= bbs_to_remove
.length (); i
-- > 0; )
7783 delete_basic_block (bbs_to_remove
[i
]);
7786 /* Update the dominance information. The immediate dominator may change only
7787 for blocks whose immediate dominator belongs to DF_IDOM:
7789 Suppose that idom(X) = Y before removal of E and idom(X) != Y after the
7790 removal. Let Z the arbitrary block such that idom(Z) = Y and
7791 Z dominates X after the removal. Before removal, there exists a path P
7792 from Y to X that avoids Z. Let F be the last edge on P that is
7793 removed, and let W = F->dest. Before removal, idom(W) = Y (since Y
7794 dominates W, and because of P, Z does not dominate W), and W belongs to
7795 the dominance frontier of E. Therefore, Y belongs to DF_IDOM. */
7796 EXECUTE_IF_SET_IN_BITMAP (df_idom
, 0, i
, bi
)
7798 bb
= BASIC_BLOCK_FOR_FN (cfun
, i
);
7799 for (dbb
= first_dom_son (CDI_DOMINATORS
, bb
);
7801 dbb
= next_dom_son (CDI_DOMINATORS
, dbb
))
7802 bbs_to_fix_dom
.safe_push (dbb
);
7805 iterate_fix_dominators (CDI_DOMINATORS
, bbs_to_fix_dom
, true);
7808 BITMAP_FREE (df_idom
);
7809 bbs_to_remove
.release ();
7810 bbs_to_fix_dom
.release ();
7813 /* Purge dead EH edges from basic block BB. */
7816 gimple_purge_dead_eh_edges (basic_block bb
)
7818 bool changed
= false;
7821 gimple stmt
= last_stmt (bb
);
7823 if (stmt
&& stmt_can_throw_internal (stmt
))
7826 for (ei
= ei_start (bb
->succs
); (e
= ei_safe_edge (ei
)); )
7828 if (e
->flags
& EDGE_EH
)
7830 remove_edge_and_dominated_blocks (e
);
7840 /* Purge dead EH edges from basic block listed in BLOCKS. */
7843 gimple_purge_all_dead_eh_edges (const_bitmap blocks
)
7845 bool changed
= false;
7849 EXECUTE_IF_SET_IN_BITMAP (blocks
, 0, i
, bi
)
7851 basic_block bb
= BASIC_BLOCK_FOR_FN (cfun
, i
);
7853 /* Earlier gimple_purge_dead_eh_edges could have removed
7854 this basic block already. */
7855 gcc_assert (bb
|| changed
);
7857 changed
|= gimple_purge_dead_eh_edges (bb
);
7863 /* Purge dead abnormal call edges from basic block BB. */
7866 gimple_purge_dead_abnormal_call_edges (basic_block bb
)
7868 bool changed
= false;
7871 gimple stmt
= last_stmt (bb
);
7873 if (!cfun
->has_nonlocal_label
7874 && !cfun
->calls_setjmp
)
7877 if (stmt
&& stmt_can_make_abnormal_goto (stmt
))
7880 for (ei
= ei_start (bb
->succs
); (e
= ei_safe_edge (ei
)); )
7882 if (e
->flags
& EDGE_ABNORMAL
)
7884 if (e
->flags
& EDGE_FALLTHRU
)
7885 e
->flags
&= ~EDGE_ABNORMAL
;
7887 remove_edge_and_dominated_blocks (e
);
7897 /* Purge dead abnormal call edges from basic block listed in BLOCKS. */
7900 gimple_purge_all_dead_abnormal_call_edges (const_bitmap blocks
)
7902 bool changed
= false;
7906 EXECUTE_IF_SET_IN_BITMAP (blocks
, 0, i
, bi
)
7908 basic_block bb
= BASIC_BLOCK_FOR_FN (cfun
, i
);
7910 /* Earlier gimple_purge_dead_abnormal_call_edges could have removed
7911 this basic block already. */
7912 gcc_assert (bb
|| changed
);
7914 changed
|= gimple_purge_dead_abnormal_call_edges (bb
);
7920 /* This function is called whenever a new edge is created or
7924 gimple_execute_on_growing_pred (edge e
)
7926 basic_block bb
= e
->dest
;
7928 if (!gimple_seq_empty_p (phi_nodes (bb
)))
7929 reserve_phi_args_for_new_edge (bb
);
7932 /* This function is called immediately before edge E is removed from
7933 the edge vector E->dest->preds. */
7936 gimple_execute_on_shrinking_pred (edge e
)
7938 if (!gimple_seq_empty_p (phi_nodes (e
->dest
)))
7939 remove_phi_args (e
);
7942 /*---------------------------------------------------------------------------
7943 Helper functions for Loop versioning
7944 ---------------------------------------------------------------------------*/
7946 /* Adjust phi nodes for 'first' basic block. 'second' basic block is a copy
7947 of 'first'. Both of them are dominated by 'new_head' basic block. When
7948 'new_head' was created by 'second's incoming edge it received phi arguments
7949 on the edge by split_edge(). Later, additional edge 'e' was created to
7950 connect 'new_head' and 'first'. Now this routine adds phi args on this
7951 additional edge 'e' that new_head to second edge received as part of edge
7955 gimple_lv_adjust_loop_header_phi (basic_block first
, basic_block second
,
7956 basic_block new_head
, edge e
)
7959 gimple_stmt_iterator psi1
, psi2
;
7961 edge e2
= find_edge (new_head
, second
);
7963 /* Because NEW_HEAD has been created by splitting SECOND's incoming
7964 edge, we should always have an edge from NEW_HEAD to SECOND. */
7965 gcc_assert (e2
!= NULL
);
7967 /* Browse all 'second' basic block phi nodes and add phi args to
7968 edge 'e' for 'first' head. PHI args are always in correct order. */
7970 for (psi2
= gsi_start_phis (second
),
7971 psi1
= gsi_start_phis (first
);
7972 !gsi_end_p (psi2
) && !gsi_end_p (psi1
);
7973 gsi_next (&psi2
), gsi_next (&psi1
))
7975 phi1
= gsi_stmt (psi1
);
7976 phi2
= gsi_stmt (psi2
);
7977 def
= PHI_ARG_DEF (phi2
, e2
->dest_idx
);
7978 add_phi_arg (phi1
, def
, e
, gimple_phi_arg_location_from_edge (phi2
, e2
));
7983 /* Adds a if else statement to COND_BB with condition COND_EXPR.
7984 SECOND_HEAD is the destination of the THEN and FIRST_HEAD is
7985 the destination of the ELSE part. */
7988 gimple_lv_add_condition_to_bb (basic_block first_head ATTRIBUTE_UNUSED
,
7989 basic_block second_head ATTRIBUTE_UNUSED
,
7990 basic_block cond_bb
, void *cond_e
)
7992 gimple_stmt_iterator gsi
;
7993 gimple new_cond_expr
;
7994 tree cond_expr
= (tree
) cond_e
;
7997 /* Build new conditional expr */
7998 new_cond_expr
= gimple_build_cond_from_tree (cond_expr
,
7999 NULL_TREE
, NULL_TREE
);
8001 /* Add new cond in cond_bb. */
8002 gsi
= gsi_last_bb (cond_bb
);
8003 gsi_insert_after (&gsi
, new_cond_expr
, GSI_NEW_STMT
);
8005 /* Adjust edges appropriately to connect new head with first head
8006 as well as second head. */
8007 e0
= single_succ_edge (cond_bb
);
8008 e0
->flags
&= ~EDGE_FALLTHRU
;
8009 e0
->flags
|= EDGE_FALSE_VALUE
;
8013 /* Do book-keeping of basic block BB for the profile consistency checker.
8014 If AFTER_PASS is 0, do pre-pass accounting, or if AFTER_PASS is 1
8015 then do post-pass accounting. Store the counting in RECORD. */
8017 gimple_account_profile_record (basic_block bb
, int after_pass
,
8018 struct profile_record
*record
)
8020 gimple_stmt_iterator i
;
8021 for (i
= gsi_start_bb (bb
); !gsi_end_p (i
); gsi_next (&i
))
8023 record
->size
[after_pass
]
8024 += estimate_num_insns (gsi_stmt (i
), &eni_size_weights
);
8025 if (profile_status_for_fn (cfun
) == PROFILE_READ
)
8026 record
->time
[after_pass
]
8027 += estimate_num_insns (gsi_stmt (i
),
8028 &eni_time_weights
) * bb
->count
;
8029 else if (profile_status_for_fn (cfun
) == PROFILE_GUESSED
)
8030 record
->time
[after_pass
]
8031 += estimate_num_insns (gsi_stmt (i
),
8032 &eni_time_weights
) * bb
->frequency
;
8036 struct cfg_hooks gimple_cfg_hooks
= {
8038 gimple_verify_flow_info
,
8039 gimple_dump_bb
, /* dump_bb */
8040 gimple_dump_bb_for_graph
, /* dump_bb_for_graph */
8041 create_bb
, /* create_basic_block */
8042 gimple_redirect_edge_and_branch
, /* redirect_edge_and_branch */
8043 gimple_redirect_edge_and_branch_force
, /* redirect_edge_and_branch_force */
8044 gimple_can_remove_branch_p
, /* can_remove_branch_p */
8045 remove_bb
, /* delete_basic_block */
8046 gimple_split_block
, /* split_block */
8047 gimple_move_block_after
, /* move_block_after */
8048 gimple_can_merge_blocks_p
, /* can_merge_blocks_p */
8049 gimple_merge_blocks
, /* merge_blocks */
8050 gimple_predict_edge
, /* predict_edge */
8051 gimple_predicted_by_p
, /* predicted_by_p */
8052 gimple_can_duplicate_bb_p
, /* can_duplicate_block_p */
8053 gimple_duplicate_bb
, /* duplicate_block */
8054 gimple_split_edge
, /* split_edge */
8055 gimple_make_forwarder_block
, /* make_forward_block */
8056 NULL
, /* tidy_fallthru_edge */
8057 NULL
, /* force_nonfallthru */
8058 gimple_block_ends_with_call_p
,/* block_ends_with_call_p */
8059 gimple_block_ends_with_condjump_p
, /* block_ends_with_condjump_p */
8060 gimple_flow_call_edges_add
, /* flow_call_edges_add */
8061 gimple_execute_on_growing_pred
, /* execute_on_growing_pred */
8062 gimple_execute_on_shrinking_pred
, /* execute_on_shrinking_pred */
8063 gimple_duplicate_loop_to_header_edge
, /* duplicate loop for trees */
8064 gimple_lv_add_condition_to_bb
, /* lv_add_condition_to_bb */
8065 gimple_lv_adjust_loop_header_phi
, /* lv_adjust_loop_header_phi*/
8066 extract_true_false_edges_from_block
, /* extract_cond_bb_edges */
8067 flush_pending_stmts
, /* flush_pending_stmts */
8068 gimple_empty_block_p
, /* block_empty_p */
8069 gimple_split_block_before_cond_jump
, /* split_block_before_cond_jump */
8070 gimple_account_profile_record
,
8074 /* Split all critical edges. */
8077 split_critical_edges (void)
8083 /* split_edge can redirect edges out of SWITCH_EXPRs, which can get
8084 expensive. So we want to enable recording of edge to CASE_LABEL_EXPR
8085 mappings around the calls to split_edge. */
8086 start_recording_case_labels ();
8087 FOR_ALL_BB_FN (bb
, cfun
)
8089 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
8091 if (EDGE_CRITICAL_P (e
) && !(e
->flags
& EDGE_ABNORMAL
))
8093 /* PRE inserts statements to edges and expects that
8094 since split_critical_edges was done beforehand, committing edge
8095 insertions will not split more edges. In addition to critical
8096 edges we must split edges that have multiple successors and
8097 end by control flow statements, such as RESX.
8098 Go ahead and split them too. This matches the logic in
8099 gimple_find_edge_insert_loc. */
8100 else if ((!single_pred_p (e
->dest
)
8101 || !gimple_seq_empty_p (phi_nodes (e
->dest
))
8102 || e
->dest
== EXIT_BLOCK_PTR_FOR_FN (cfun
))
8103 && e
->src
!= ENTRY_BLOCK_PTR_FOR_FN (cfun
)
8104 && !(e
->flags
& EDGE_ABNORMAL
))
8106 gimple_stmt_iterator gsi
;
8108 gsi
= gsi_last_bb (e
->src
);
8109 if (!gsi_end_p (gsi
)
8110 && stmt_ends_bb_p (gsi_stmt (gsi
))
8111 && (gimple_code (gsi_stmt (gsi
)) != GIMPLE_RETURN
8112 && !gimple_call_builtin_p (gsi_stmt (gsi
),
8118 end_recording_case_labels ();
8124 const pass_data pass_data_split_crit_edges
=
8126 GIMPLE_PASS
, /* type */
8127 "crited", /* name */
8128 OPTGROUP_NONE
, /* optinfo_flags */
8129 TV_TREE_SPLIT_EDGES
, /* tv_id */
8130 PROP_cfg
, /* properties_required */
8131 PROP_no_crit_edges
, /* properties_provided */
8132 0, /* properties_destroyed */
8133 0, /* todo_flags_start */
8134 0, /* todo_flags_finish */
8137 class pass_split_crit_edges
: public gimple_opt_pass
8140 pass_split_crit_edges (gcc::context
*ctxt
)
8141 : gimple_opt_pass (pass_data_split_crit_edges
, ctxt
)
8144 /* opt_pass methods: */
8145 virtual unsigned int execute (function
*) { return split_critical_edges (); }
8147 opt_pass
* clone () { return new pass_split_crit_edges (m_ctxt
); }
8148 }; // class pass_split_crit_edges
8153 make_pass_split_crit_edges (gcc::context
*ctxt
)
8155 return new pass_split_crit_edges (ctxt
);
8159 /* Build a ternary operation and gimplify it. Emit code before GSI.
8160 Return the gimple_val holding the result. */
8163 gimplify_build3 (gimple_stmt_iterator
*gsi
, enum tree_code code
,
8164 tree type
, tree a
, tree b
, tree c
)
8167 location_t loc
= gimple_location (gsi_stmt (*gsi
));
8169 ret
= fold_build3_loc (loc
, code
, type
, a
, b
, c
);
8172 return force_gimple_operand_gsi (gsi
, ret
, true, NULL
, true,
8176 /* Build a binary operation and gimplify it. Emit code before GSI.
8177 Return the gimple_val holding the result. */
8180 gimplify_build2 (gimple_stmt_iterator
*gsi
, enum tree_code code
,
8181 tree type
, tree a
, tree b
)
8185 ret
= fold_build2_loc (gimple_location (gsi_stmt (*gsi
)), code
, type
, a
, b
);
8188 return force_gimple_operand_gsi (gsi
, ret
, true, NULL
, true,
8192 /* Build a unary operation and gimplify it. Emit code before GSI.
8193 Return the gimple_val holding the result. */
8196 gimplify_build1 (gimple_stmt_iterator
*gsi
, enum tree_code code
, tree type
,
8201 ret
= fold_build1_loc (gimple_location (gsi_stmt (*gsi
)), code
, type
, a
);
8204 return force_gimple_operand_gsi (gsi
, ret
, true, NULL
, true,
8210 /* Given a basic block B which ends with a conditional and has
8211 precisely two successors, determine which of the edges is taken if
8212 the conditional is true and which is taken if the conditional is
8213 false. Set TRUE_EDGE and FALSE_EDGE appropriately. */
8216 extract_true_false_edges_from_block (basic_block b
,
8220 edge e
= EDGE_SUCC (b
, 0);
8222 if (e
->flags
& EDGE_TRUE_VALUE
)
8225 *false_edge
= EDGE_SUCC (b
, 1);
8230 *true_edge
= EDGE_SUCC (b
, 1);
8234 /* Emit return warnings. */
8238 const pass_data pass_data_warn_function_return
=
8240 GIMPLE_PASS
, /* type */
8241 "*warn_function_return", /* name */
8242 OPTGROUP_NONE
, /* optinfo_flags */
8243 TV_NONE
, /* tv_id */
8244 PROP_cfg
, /* properties_required */
8245 0, /* properties_provided */
8246 0, /* properties_destroyed */
8247 0, /* todo_flags_start */
8248 0, /* todo_flags_finish */
8251 class pass_warn_function_return
: public gimple_opt_pass
8254 pass_warn_function_return (gcc::context
*ctxt
)
8255 : gimple_opt_pass (pass_data_warn_function_return
, ctxt
)
8258 /* opt_pass methods: */
8259 virtual unsigned int execute (function
*);
8261 }; // class pass_warn_function_return
8264 pass_warn_function_return::execute (function
*fun
)
8266 source_location location
;
8271 if (!targetm
.warn_func_return (fun
->decl
))
8274 /* If we have a path to EXIT, then we do return. */
8275 if (TREE_THIS_VOLATILE (fun
->decl
)
8276 && EDGE_COUNT (EXIT_BLOCK_PTR_FOR_FN (fun
)->preds
) > 0)
8278 location
= UNKNOWN_LOCATION
;
8279 FOR_EACH_EDGE (e
, ei
, EXIT_BLOCK_PTR_FOR_FN (fun
)->preds
)
8281 last
= last_stmt (e
->src
);
8282 if ((gimple_code (last
) == GIMPLE_RETURN
8283 || gimple_call_builtin_p (last
, BUILT_IN_RETURN
))
8284 && (location
= gimple_location (last
)) != UNKNOWN_LOCATION
)
8287 if (location
== UNKNOWN_LOCATION
)
8288 location
= cfun
->function_end_locus
;
8289 warning_at (location
, 0, "%<noreturn%> function does return");
8292 /* If we see "return;" in some basic block, then we do reach the end
8293 without returning a value. */
8294 else if (warn_return_type
8295 && !TREE_NO_WARNING (fun
->decl
)
8296 && EDGE_COUNT (EXIT_BLOCK_PTR_FOR_FN (fun
)->preds
) > 0
8297 && !VOID_TYPE_P (TREE_TYPE (TREE_TYPE (fun
->decl
))))
8299 FOR_EACH_EDGE (e
, ei
, EXIT_BLOCK_PTR_FOR_FN (fun
)->preds
)
8301 gimple last
= last_stmt (e
->src
);
8302 if (gimple_code (last
) == GIMPLE_RETURN
8303 && gimple_return_retval (last
) == NULL
8304 && !gimple_no_warning_p (last
))
8306 location
= gimple_location (last
);
8307 if (location
== UNKNOWN_LOCATION
)
8308 location
= fun
->function_end_locus
;
8309 warning_at (location
, OPT_Wreturn_type
, "control reaches end of non-void function");
8310 TREE_NO_WARNING (fun
->decl
) = 1;
8321 make_pass_warn_function_return (gcc::context
*ctxt
)
8323 return new pass_warn_function_return (ctxt
);
8326 /* Walk a gimplified function and warn for functions whose return value is
8327 ignored and attribute((warn_unused_result)) is set. This is done before
8328 inlining, so we don't have to worry about that. */
8331 do_warn_unused_result (gimple_seq seq
)
8334 gimple_stmt_iterator i
;
8336 for (i
= gsi_start (seq
); !gsi_end_p (i
); gsi_next (&i
))
8338 gimple g
= gsi_stmt (i
);
8340 switch (gimple_code (g
))
8343 do_warn_unused_result (gimple_bind_body (g
));
8346 do_warn_unused_result (gimple_try_eval (g
));
8347 do_warn_unused_result (gimple_try_cleanup (g
));
8350 do_warn_unused_result (gimple_catch_handler (g
));
8352 case GIMPLE_EH_FILTER
:
8353 do_warn_unused_result (gimple_eh_filter_failure (g
));
8357 if (gimple_call_lhs (g
))
8359 if (gimple_call_internal_p (g
))
8362 /* This is a naked call, as opposed to a GIMPLE_CALL with an
8363 LHS. All calls whose value is ignored should be
8364 represented like this. Look for the attribute. */
8365 fdecl
= gimple_call_fndecl (g
);
8366 ftype
= gimple_call_fntype (g
);
8368 if (lookup_attribute ("warn_unused_result", TYPE_ATTRIBUTES (ftype
)))
8370 location_t loc
= gimple_location (g
);
8373 warning_at (loc
, OPT_Wunused_result
,
8374 "ignoring return value of %qD, "
8375 "declared with attribute warn_unused_result",
8378 warning_at (loc
, OPT_Wunused_result
,
8379 "ignoring return value of function "
8380 "declared with attribute warn_unused_result");
8385 /* Not a container, not a call, or a call whose value is used. */
8393 const pass_data pass_data_warn_unused_result
=
8395 GIMPLE_PASS
, /* type */
8396 "*warn_unused_result", /* name */
8397 OPTGROUP_NONE
, /* optinfo_flags */
8398 TV_NONE
, /* tv_id */
8399 PROP_gimple_any
, /* properties_required */
8400 0, /* properties_provided */
8401 0, /* properties_destroyed */
8402 0, /* todo_flags_start */
8403 0, /* todo_flags_finish */
8406 class pass_warn_unused_result
: public gimple_opt_pass
8409 pass_warn_unused_result (gcc::context
*ctxt
)
8410 : gimple_opt_pass (pass_data_warn_unused_result
, ctxt
)
8413 /* opt_pass methods: */
8414 virtual bool gate (function
*) { return flag_warn_unused_result
; }
8415 virtual unsigned int execute (function
*)
8417 do_warn_unused_result (gimple_body (current_function_decl
));
8421 }; // class pass_warn_unused_result
8426 make_pass_warn_unused_result (gcc::context
*ctxt
)
8428 return new pass_warn_unused_result (ctxt
);
8431 /* IPA passes, compilation of earlier functions or inlining
8432 might have changed some properties, such as marked functions nothrow,
8433 pure, const or noreturn.
8434 Remove redundant edges and basic blocks, and create new ones if necessary.
8436 This pass can't be executed as stand alone pass from pass manager, because
8437 in between inlining and this fixup the verify_flow_info would fail. */
8440 execute_fixup_cfg (void)
8443 gimple_stmt_iterator gsi
;
8445 gcov_type count_scale
;
8450 = GCOV_COMPUTE_SCALE (cgraph_node::get (current_function_decl
)->count
,
8451 ENTRY_BLOCK_PTR_FOR_FN (cfun
)->count
);
8453 ENTRY_BLOCK_PTR_FOR_FN (cfun
)->count
=
8454 cgraph_node::get (current_function_decl
)->count
;
8455 EXIT_BLOCK_PTR_FOR_FN (cfun
)->count
=
8456 apply_scale (EXIT_BLOCK_PTR_FOR_FN (cfun
)->count
,
8459 FOR_EACH_EDGE (e
, ei
, ENTRY_BLOCK_PTR_FOR_FN (cfun
)->succs
)
8460 e
->count
= apply_scale (e
->count
, count_scale
);
8462 FOR_EACH_BB_FN (bb
, cfun
)
8464 bb
->count
= apply_scale (bb
->count
, count_scale
);
8465 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
);)
8467 gimple stmt
= gsi_stmt (gsi
);
8468 tree decl
= is_gimple_call (stmt
)
8469 ? gimple_call_fndecl (stmt
)
8473 int flags
= gimple_call_flags (stmt
);
8474 if (flags
& (ECF_CONST
| ECF_PURE
| ECF_LOOPING_CONST_OR_PURE
))
8476 if (gimple_purge_dead_abnormal_call_edges (bb
))
8477 todo
|= TODO_cleanup_cfg
;
8479 if (gimple_in_ssa_p (cfun
))
8481 todo
|= TODO_update_ssa
| TODO_cleanup_cfg
;
8486 if (flags
& ECF_NORETURN
8487 && fixup_noreturn_call (stmt
))
8488 todo
|= TODO_cleanup_cfg
;
8491 /* Remove stores to variables we marked write-only.
8492 Keep access when store has side effect, i.e. in case when source
8494 if (gimple_store_p (stmt
)
8495 && !gimple_has_side_effects (stmt
))
8497 tree lhs
= get_base_address (gimple_get_lhs (stmt
));
8499 if (TREE_CODE (lhs
) == VAR_DECL
8500 && (TREE_STATIC (lhs
) || DECL_EXTERNAL (lhs
))
8501 && varpool_node::get (lhs
)->writeonly
)
8503 unlink_stmt_vdef (stmt
);
8504 gsi_remove (&gsi
, true);
8505 release_defs (stmt
);
8506 todo
|= TODO_update_ssa
| TODO_cleanup_cfg
;
8510 /* For calls we can simply remove LHS when it is known
8511 to be write-only. */
8512 if (is_gimple_call (stmt
)
8513 && gimple_get_lhs (stmt
))
8515 tree lhs
= get_base_address (gimple_get_lhs (stmt
));
8517 if (TREE_CODE (lhs
) == VAR_DECL
8518 && (TREE_STATIC (lhs
) || DECL_EXTERNAL (lhs
))
8519 && varpool_node::get (lhs
)->writeonly
)
8521 gimple_call_set_lhs (stmt
, NULL
);
8523 todo
|= TODO_update_ssa
| TODO_cleanup_cfg
;
8527 if (maybe_clean_eh_stmt (stmt
)
8528 && gimple_purge_dead_eh_edges (bb
))
8529 todo
|= TODO_cleanup_cfg
;
8533 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
8534 e
->count
= apply_scale (e
->count
, count_scale
);
8536 /* If we have a basic block with no successors that does not
8537 end with a control statement or a noreturn call end it with
8538 a call to __builtin_unreachable. This situation can occur
8539 when inlining a noreturn call that does in fact return. */
8540 if (EDGE_COUNT (bb
->succs
) == 0)
8542 gimple stmt
= last_stmt (bb
);
8544 || (!is_ctrl_stmt (stmt
)
8545 && (!is_gimple_call (stmt
)
8546 || (gimple_call_flags (stmt
) & ECF_NORETURN
) == 0)))
8548 if (stmt
&& is_gimple_call (stmt
))
8549 gimple_call_set_ctrl_altering (stmt
, false);
8550 stmt
= gimple_build_call
8551 (builtin_decl_implicit (BUILT_IN_UNREACHABLE
), 0);
8552 gimple_stmt_iterator gsi
= gsi_last_bb (bb
);
8553 gsi_insert_after (&gsi
, stmt
, GSI_NEW_STMT
);
8557 if (count_scale
!= REG_BR_PROB_BASE
)
8558 compute_function_frequency ();
8560 /* Dump a textual representation of the flowgraph. */
8562 gimple_dump_cfg (dump_file
, dump_flags
);
8565 && (todo
& TODO_cleanup_cfg
))
8566 loops_state_set (LOOPS_NEED_FIXUP
);
8573 const pass_data pass_data_fixup_cfg
=
8575 GIMPLE_PASS
, /* type */
8576 "*free_cfg_annotations", /* name */
8577 OPTGROUP_NONE
, /* optinfo_flags */
8578 TV_NONE
, /* tv_id */
8579 PROP_cfg
, /* properties_required */
8580 0, /* properties_provided */
8581 0, /* properties_destroyed */
8582 0, /* todo_flags_start */
8583 0, /* todo_flags_finish */
8586 class pass_fixup_cfg
: public gimple_opt_pass
8589 pass_fixup_cfg (gcc::context
*ctxt
)
8590 : gimple_opt_pass (pass_data_fixup_cfg
, ctxt
)
8593 /* opt_pass methods: */
8594 opt_pass
* clone () { return new pass_fixup_cfg (m_ctxt
); }
8595 virtual unsigned int execute (function
*) { return execute_fixup_cfg (); }
8597 }; // class pass_fixup_cfg
8602 make_pass_fixup_cfg (gcc::context
*ctxt
)
8604 return new pass_fixup_cfg (ctxt
);
8607 /* Garbage collection support for edge_def. */
8609 extern void gt_ggc_mx (tree
&);
8610 extern void gt_ggc_mx (gimple
&);
8611 extern void gt_ggc_mx (rtx
&);
8612 extern void gt_ggc_mx (basic_block
&);
8615 gt_ggc_mx (rtx_insn
*& x
)
8618 gt_ggc_mx_rtx_def ((void *) x
);
8622 gt_ggc_mx (edge_def
*e
)
8624 tree block
= LOCATION_BLOCK (e
->goto_locus
);
8626 gt_ggc_mx (e
->dest
);
8627 if (current_ir_type () == IR_GIMPLE
)
8628 gt_ggc_mx (e
->insns
.g
);
8630 gt_ggc_mx (e
->insns
.r
);
8634 /* PCH support for edge_def. */
8636 extern void gt_pch_nx (tree
&);
8637 extern void gt_pch_nx (gimple
&);
8638 extern void gt_pch_nx (rtx
&);
8639 extern void gt_pch_nx (basic_block
&);
8642 gt_pch_nx (rtx_insn
*& x
)
8645 gt_pch_nx_rtx_def ((void *) x
);
8649 gt_pch_nx (edge_def
*e
)
8651 tree block
= LOCATION_BLOCK (e
->goto_locus
);
8653 gt_pch_nx (e
->dest
);
8654 if (current_ir_type () == IR_GIMPLE
)
8655 gt_pch_nx (e
->insns
.g
);
8657 gt_pch_nx (e
->insns
.r
);
8662 gt_pch_nx (edge_def
*e
, gt_pointer_operator op
, void *cookie
)
8664 tree block
= LOCATION_BLOCK (e
->goto_locus
);
8665 op (&(e
->src
), cookie
);
8666 op (&(e
->dest
), cookie
);
8667 if (current_ir_type () == IR_GIMPLE
)
8668 op (&(e
->insns
.g
), cookie
);
8670 op (&(e
->insns
.r
), cookie
);
8671 op (&(block
), cookie
);