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
:
3564 /* For the remaining codes assert there is no conversion involved. */
3565 if (!useless_type_conversion_p (lhs_type
, rhs1_type
))
3567 error ("non-trivial conversion in unary operation");
3568 debug_generic_expr (lhs_type
);
3569 debug_generic_expr (rhs1_type
);
3576 /* Verify a gimple assignment statement STMT with a binary rhs.
3577 Returns true if anything is wrong. */
3580 verify_gimple_assign_binary (gimple stmt
)
3582 enum tree_code rhs_code
= gimple_assign_rhs_code (stmt
);
3583 tree lhs
= gimple_assign_lhs (stmt
);
3584 tree lhs_type
= TREE_TYPE (lhs
);
3585 tree rhs1
= gimple_assign_rhs1 (stmt
);
3586 tree rhs1_type
= TREE_TYPE (rhs1
);
3587 tree rhs2
= gimple_assign_rhs2 (stmt
);
3588 tree rhs2_type
= TREE_TYPE (rhs2
);
3590 if (!is_gimple_reg (lhs
))
3592 error ("non-register as LHS of binary operation");
3596 if (!is_gimple_val (rhs1
)
3597 || !is_gimple_val (rhs2
))
3599 error ("invalid operands in binary operation");
3603 /* First handle operations that involve different types. */
3608 if (TREE_CODE (lhs_type
) != COMPLEX_TYPE
3609 || !(INTEGRAL_TYPE_P (rhs1_type
)
3610 || SCALAR_FLOAT_TYPE_P (rhs1_type
))
3611 || !(INTEGRAL_TYPE_P (rhs2_type
)
3612 || SCALAR_FLOAT_TYPE_P (rhs2_type
)))
3614 error ("type mismatch in complex expression");
3615 debug_generic_expr (lhs_type
);
3616 debug_generic_expr (rhs1_type
);
3617 debug_generic_expr (rhs2_type
);
3629 /* Shifts and rotates are ok on integral types, fixed point
3630 types and integer vector types. */
3631 if ((!INTEGRAL_TYPE_P (rhs1_type
)
3632 && !FIXED_POINT_TYPE_P (rhs1_type
)
3633 && !(TREE_CODE (rhs1_type
) == VECTOR_TYPE
3634 && INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type
))))
3635 || (!INTEGRAL_TYPE_P (rhs2_type
)
3636 /* Vector shifts of vectors are also ok. */
3637 && !(TREE_CODE (rhs1_type
) == VECTOR_TYPE
3638 && INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type
))
3639 && TREE_CODE (rhs2_type
) == VECTOR_TYPE
3640 && INTEGRAL_TYPE_P (TREE_TYPE (rhs2_type
))))
3641 || !useless_type_conversion_p (lhs_type
, rhs1_type
))
3643 error ("type mismatch in shift expression");
3644 debug_generic_expr (lhs_type
);
3645 debug_generic_expr (rhs1_type
);
3646 debug_generic_expr (rhs2_type
);
3653 case VEC_LSHIFT_EXPR
:
3654 case VEC_RSHIFT_EXPR
:
3656 if (TREE_CODE (rhs1_type
) != VECTOR_TYPE
3657 || !(INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type
))
3658 || POINTER_TYPE_P (TREE_TYPE (rhs1_type
))
3659 || FIXED_POINT_TYPE_P (TREE_TYPE (rhs1_type
))
3660 || SCALAR_FLOAT_TYPE_P (TREE_TYPE (rhs1_type
)))
3661 || (!INTEGRAL_TYPE_P (rhs2_type
)
3662 && (TREE_CODE (rhs2_type
) != VECTOR_TYPE
3663 || !INTEGRAL_TYPE_P (TREE_TYPE (rhs2_type
))))
3664 || !useless_type_conversion_p (lhs_type
, rhs1_type
))
3666 error ("type mismatch in vector shift expression");
3667 debug_generic_expr (lhs_type
);
3668 debug_generic_expr (rhs1_type
);
3669 debug_generic_expr (rhs2_type
);
3672 /* For shifting a vector of non-integral components we
3673 only allow shifting by a constant multiple of the element size. */
3674 if (!INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type
))
3675 && (TREE_CODE (rhs2
) != INTEGER_CST
3676 || !div_if_zero_remainder (rhs2
,
3677 TYPE_SIZE (TREE_TYPE (rhs1_type
)))))
3679 error ("non-element sized vector shift of floating point vector");
3686 case WIDEN_LSHIFT_EXPR
:
3688 if (!INTEGRAL_TYPE_P (lhs_type
)
3689 || !INTEGRAL_TYPE_P (rhs1_type
)
3690 || TREE_CODE (rhs2
) != INTEGER_CST
3691 || (2 * TYPE_PRECISION (rhs1_type
) > TYPE_PRECISION (lhs_type
)))
3693 error ("type mismatch in widening vector shift expression");
3694 debug_generic_expr (lhs_type
);
3695 debug_generic_expr (rhs1_type
);
3696 debug_generic_expr (rhs2_type
);
3703 case VEC_WIDEN_LSHIFT_HI_EXPR
:
3704 case VEC_WIDEN_LSHIFT_LO_EXPR
:
3706 if (TREE_CODE (rhs1_type
) != VECTOR_TYPE
3707 || TREE_CODE (lhs_type
) != VECTOR_TYPE
3708 || !INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type
))
3709 || !INTEGRAL_TYPE_P (TREE_TYPE (lhs_type
))
3710 || TREE_CODE (rhs2
) != INTEGER_CST
3711 || (2 * TYPE_PRECISION (TREE_TYPE (rhs1_type
))
3712 > TYPE_PRECISION (TREE_TYPE (lhs_type
))))
3714 error ("type mismatch in widening vector shift expression");
3715 debug_generic_expr (lhs_type
);
3716 debug_generic_expr (rhs1_type
);
3717 debug_generic_expr (rhs2_type
);
3727 tree lhs_etype
= lhs_type
;
3728 tree rhs1_etype
= rhs1_type
;
3729 tree rhs2_etype
= rhs2_type
;
3730 if (TREE_CODE (lhs_type
) == VECTOR_TYPE
)
3732 if (TREE_CODE (rhs1_type
) != VECTOR_TYPE
3733 || TREE_CODE (rhs2_type
) != VECTOR_TYPE
)
3735 error ("invalid non-vector operands to vector valued plus");
3738 lhs_etype
= TREE_TYPE (lhs_type
);
3739 rhs1_etype
= TREE_TYPE (rhs1_type
);
3740 rhs2_etype
= TREE_TYPE (rhs2_type
);
3742 if (POINTER_TYPE_P (lhs_etype
)
3743 || POINTER_TYPE_P (rhs1_etype
)
3744 || POINTER_TYPE_P (rhs2_etype
))
3746 error ("invalid (pointer) operands to plus/minus");
3750 /* Continue with generic binary expression handling. */
3754 case POINTER_PLUS_EXPR
:
3756 if (!POINTER_TYPE_P (rhs1_type
)
3757 || !useless_type_conversion_p (lhs_type
, rhs1_type
)
3758 || !ptrofftype_p (rhs2_type
))
3760 error ("type mismatch in pointer plus expression");
3761 debug_generic_stmt (lhs_type
);
3762 debug_generic_stmt (rhs1_type
);
3763 debug_generic_stmt (rhs2_type
);
3770 case TRUTH_ANDIF_EXPR
:
3771 case TRUTH_ORIF_EXPR
:
3772 case TRUTH_AND_EXPR
:
3774 case TRUTH_XOR_EXPR
:
3784 case UNORDERED_EXPR
:
3792 /* Comparisons are also binary, but the result type is not
3793 connected to the operand types. */
3794 return verify_gimple_comparison (lhs_type
, rhs1
, rhs2
);
3796 case WIDEN_MULT_EXPR
:
3797 if (TREE_CODE (lhs_type
) != INTEGER_TYPE
)
3799 return ((2 * TYPE_PRECISION (rhs1_type
) > TYPE_PRECISION (lhs_type
))
3800 || (TYPE_PRECISION (rhs1_type
) != TYPE_PRECISION (rhs2_type
)));
3802 case WIDEN_SUM_EXPR
:
3803 case VEC_WIDEN_MULT_HI_EXPR
:
3804 case VEC_WIDEN_MULT_LO_EXPR
:
3805 case VEC_WIDEN_MULT_EVEN_EXPR
:
3806 case VEC_WIDEN_MULT_ODD_EXPR
:
3807 case VEC_PACK_TRUNC_EXPR
:
3808 case VEC_PACK_SAT_EXPR
:
3809 case VEC_PACK_FIX_TRUNC_EXPR
:
3814 case MULT_HIGHPART_EXPR
:
3815 case TRUNC_DIV_EXPR
:
3817 case FLOOR_DIV_EXPR
:
3818 case ROUND_DIV_EXPR
:
3819 case TRUNC_MOD_EXPR
:
3821 case FLOOR_MOD_EXPR
:
3822 case ROUND_MOD_EXPR
:
3824 case EXACT_DIV_EXPR
:
3830 /* Continue with generic binary expression handling. */
3837 if (!useless_type_conversion_p (lhs_type
, rhs1_type
)
3838 || !useless_type_conversion_p (lhs_type
, rhs2_type
))
3840 error ("type mismatch in binary expression");
3841 debug_generic_stmt (lhs_type
);
3842 debug_generic_stmt (rhs1_type
);
3843 debug_generic_stmt (rhs2_type
);
3850 /* Verify a gimple assignment statement STMT with a ternary rhs.
3851 Returns true if anything is wrong. */
3854 verify_gimple_assign_ternary (gimple stmt
)
3856 enum tree_code rhs_code
= gimple_assign_rhs_code (stmt
);
3857 tree lhs
= gimple_assign_lhs (stmt
);
3858 tree lhs_type
= TREE_TYPE (lhs
);
3859 tree rhs1
= gimple_assign_rhs1 (stmt
);
3860 tree rhs1_type
= TREE_TYPE (rhs1
);
3861 tree rhs2
= gimple_assign_rhs2 (stmt
);
3862 tree rhs2_type
= TREE_TYPE (rhs2
);
3863 tree rhs3
= gimple_assign_rhs3 (stmt
);
3864 tree rhs3_type
= TREE_TYPE (rhs3
);
3866 if (!is_gimple_reg (lhs
))
3868 error ("non-register as LHS of ternary operation");
3872 if (((rhs_code
== VEC_COND_EXPR
|| rhs_code
== COND_EXPR
)
3873 ? !is_gimple_condexpr (rhs1
) : !is_gimple_val (rhs1
))
3874 || !is_gimple_val (rhs2
)
3875 || !is_gimple_val (rhs3
))
3877 error ("invalid operands in ternary operation");
3881 /* First handle operations that involve different types. */
3884 case WIDEN_MULT_PLUS_EXPR
:
3885 case WIDEN_MULT_MINUS_EXPR
:
3886 if ((!INTEGRAL_TYPE_P (rhs1_type
)
3887 && !FIXED_POINT_TYPE_P (rhs1_type
))
3888 || !useless_type_conversion_p (rhs1_type
, rhs2_type
)
3889 || !useless_type_conversion_p (lhs_type
, rhs3_type
)
3890 || 2 * TYPE_PRECISION (rhs1_type
) > TYPE_PRECISION (lhs_type
)
3891 || TYPE_PRECISION (rhs1_type
) != TYPE_PRECISION (rhs2_type
))
3893 error ("type mismatch in widening multiply-accumulate expression");
3894 debug_generic_expr (lhs_type
);
3895 debug_generic_expr (rhs1_type
);
3896 debug_generic_expr (rhs2_type
);
3897 debug_generic_expr (rhs3_type
);
3903 if (!useless_type_conversion_p (lhs_type
, rhs1_type
)
3904 || !useless_type_conversion_p (lhs_type
, rhs2_type
)
3905 || !useless_type_conversion_p (lhs_type
, rhs3_type
))
3907 error ("type mismatch in fused multiply-add expression");
3908 debug_generic_expr (lhs_type
);
3909 debug_generic_expr (rhs1_type
);
3910 debug_generic_expr (rhs2_type
);
3911 debug_generic_expr (rhs3_type
);
3918 if (!useless_type_conversion_p (lhs_type
, rhs2_type
)
3919 || !useless_type_conversion_p (lhs_type
, rhs3_type
))
3921 error ("type mismatch in conditional expression");
3922 debug_generic_expr (lhs_type
);
3923 debug_generic_expr (rhs2_type
);
3924 debug_generic_expr (rhs3_type
);
3930 if (!useless_type_conversion_p (lhs_type
, rhs1_type
)
3931 || !useless_type_conversion_p (lhs_type
, rhs2_type
))
3933 error ("type mismatch in vector permute expression");
3934 debug_generic_expr (lhs_type
);
3935 debug_generic_expr (rhs1_type
);
3936 debug_generic_expr (rhs2_type
);
3937 debug_generic_expr (rhs3_type
);
3941 if (TREE_CODE (rhs1_type
) != VECTOR_TYPE
3942 || TREE_CODE (rhs2_type
) != VECTOR_TYPE
3943 || TREE_CODE (rhs3_type
) != VECTOR_TYPE
)
3945 error ("vector types expected in vector permute expression");
3946 debug_generic_expr (lhs_type
);
3947 debug_generic_expr (rhs1_type
);
3948 debug_generic_expr (rhs2_type
);
3949 debug_generic_expr (rhs3_type
);
3953 if (TYPE_VECTOR_SUBPARTS (rhs1_type
) != TYPE_VECTOR_SUBPARTS (rhs2_type
)
3954 || TYPE_VECTOR_SUBPARTS (rhs2_type
)
3955 != TYPE_VECTOR_SUBPARTS (rhs3_type
)
3956 || TYPE_VECTOR_SUBPARTS (rhs3_type
)
3957 != TYPE_VECTOR_SUBPARTS (lhs_type
))
3959 error ("vectors with different element number found "
3960 "in vector permute expression");
3961 debug_generic_expr (lhs_type
);
3962 debug_generic_expr (rhs1_type
);
3963 debug_generic_expr (rhs2_type
);
3964 debug_generic_expr (rhs3_type
);
3968 if (TREE_CODE (TREE_TYPE (rhs3_type
)) != INTEGER_TYPE
3969 || GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (rhs3_type
)))
3970 != GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (rhs1_type
))))
3972 error ("invalid mask type in vector permute expression");
3973 debug_generic_expr (lhs_type
);
3974 debug_generic_expr (rhs1_type
);
3975 debug_generic_expr (rhs2_type
);
3976 debug_generic_expr (rhs3_type
);
3983 if (!useless_type_conversion_p (rhs1_type
, rhs2_type
)
3984 || !useless_type_conversion_p (lhs_type
, rhs3_type
)
3985 || 2 * GET_MODE_BITSIZE (GET_MODE_INNER
3986 (TYPE_MODE (TREE_TYPE (rhs1_type
))))
3987 > GET_MODE_BITSIZE (GET_MODE_INNER
3988 (TYPE_MODE (TREE_TYPE (lhs_type
)))))
3990 error ("type mismatch in sad expression");
3991 debug_generic_expr (lhs_type
);
3992 debug_generic_expr (rhs1_type
);
3993 debug_generic_expr (rhs2_type
);
3994 debug_generic_expr (rhs3_type
);
3998 if (TREE_CODE (rhs1_type
) != VECTOR_TYPE
3999 || TREE_CODE (rhs2_type
) != VECTOR_TYPE
4000 || TREE_CODE (rhs3_type
) != VECTOR_TYPE
)
4002 error ("vector types expected in sad expression");
4003 debug_generic_expr (lhs_type
);
4004 debug_generic_expr (rhs1_type
);
4005 debug_generic_expr (rhs2_type
);
4006 debug_generic_expr (rhs3_type
);
4013 case REALIGN_LOAD_EXPR
:
4023 /* Verify a gimple assignment statement STMT with a single rhs.
4024 Returns true if anything is wrong. */
4027 verify_gimple_assign_single (gimple stmt
)
4029 enum tree_code rhs_code
= gimple_assign_rhs_code (stmt
);
4030 tree lhs
= gimple_assign_lhs (stmt
);
4031 tree lhs_type
= TREE_TYPE (lhs
);
4032 tree rhs1
= gimple_assign_rhs1 (stmt
);
4033 tree rhs1_type
= TREE_TYPE (rhs1
);
4036 if (!useless_type_conversion_p (lhs_type
, rhs1_type
))
4038 error ("non-trivial conversion at assignment");
4039 debug_generic_expr (lhs_type
);
4040 debug_generic_expr (rhs1_type
);
4044 if (gimple_clobber_p (stmt
)
4045 && !(DECL_P (lhs
) || TREE_CODE (lhs
) == MEM_REF
))
4047 error ("non-decl/MEM_REF LHS in clobber statement");
4048 debug_generic_expr (lhs
);
4052 if (handled_component_p (lhs
)
4053 || TREE_CODE (lhs
) == MEM_REF
4054 || TREE_CODE (lhs
) == TARGET_MEM_REF
)
4055 res
|= verify_types_in_gimple_reference (lhs
, true);
4057 /* Special codes we cannot handle via their class. */
4062 tree op
= TREE_OPERAND (rhs1
, 0);
4063 if (!is_gimple_addressable (op
))
4065 error ("invalid operand in unary expression");
4069 /* Technically there is no longer a need for matching types, but
4070 gimple hygiene asks for this check. In LTO we can end up
4071 combining incompatible units and thus end up with addresses
4072 of globals that change their type to a common one. */
4074 && !types_compatible_p (TREE_TYPE (op
),
4075 TREE_TYPE (TREE_TYPE (rhs1
)))
4076 && !one_pointer_to_useless_type_conversion_p (TREE_TYPE (rhs1
),
4079 error ("type mismatch in address expression");
4080 debug_generic_stmt (TREE_TYPE (rhs1
));
4081 debug_generic_stmt (TREE_TYPE (op
));
4085 return verify_types_in_gimple_reference (op
, true);
4090 error ("INDIRECT_REF in gimple IL");
4096 case ARRAY_RANGE_REF
:
4097 case VIEW_CONVERT_EXPR
:
4100 case TARGET_MEM_REF
:
4102 if (!is_gimple_reg (lhs
)
4103 && is_gimple_reg_type (TREE_TYPE (lhs
)))
4105 error ("invalid rhs for gimple memory store");
4106 debug_generic_stmt (lhs
);
4107 debug_generic_stmt (rhs1
);
4110 return res
|| verify_types_in_gimple_reference (rhs1
, false);
4122 /* tcc_declaration */
4127 if (!is_gimple_reg (lhs
)
4128 && !is_gimple_reg (rhs1
)
4129 && is_gimple_reg_type (TREE_TYPE (lhs
)))
4131 error ("invalid rhs for gimple memory store");
4132 debug_generic_stmt (lhs
);
4133 debug_generic_stmt (rhs1
);
4139 if (TREE_CODE (rhs1_type
) == VECTOR_TYPE
)
4142 tree elt_i
, elt_v
, elt_t
= NULL_TREE
;
4144 if (CONSTRUCTOR_NELTS (rhs1
) == 0)
4146 /* For vector CONSTRUCTORs we require that either it is empty
4147 CONSTRUCTOR, or it is a CONSTRUCTOR of smaller vector elements
4148 (then the element count must be correct to cover the whole
4149 outer vector and index must be NULL on all elements, or it is
4150 a CONSTRUCTOR of scalar elements, where we as an exception allow
4151 smaller number of elements (assuming zero filling) and
4152 consecutive indexes as compared to NULL indexes (such
4153 CONSTRUCTORs can appear in the IL from FEs). */
4154 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (rhs1
), i
, elt_i
, elt_v
)
4156 if (elt_t
== NULL_TREE
)
4158 elt_t
= TREE_TYPE (elt_v
);
4159 if (TREE_CODE (elt_t
) == VECTOR_TYPE
)
4161 tree elt_t
= TREE_TYPE (elt_v
);
4162 if (!useless_type_conversion_p (TREE_TYPE (rhs1_type
),
4165 error ("incorrect type of vector CONSTRUCTOR"
4167 debug_generic_stmt (rhs1
);
4170 else if (CONSTRUCTOR_NELTS (rhs1
)
4171 * TYPE_VECTOR_SUBPARTS (elt_t
)
4172 != TYPE_VECTOR_SUBPARTS (rhs1_type
))
4174 error ("incorrect number of vector CONSTRUCTOR"
4176 debug_generic_stmt (rhs1
);
4180 else if (!useless_type_conversion_p (TREE_TYPE (rhs1_type
),
4183 error ("incorrect type of vector CONSTRUCTOR elements");
4184 debug_generic_stmt (rhs1
);
4187 else if (CONSTRUCTOR_NELTS (rhs1
)
4188 > TYPE_VECTOR_SUBPARTS (rhs1_type
))
4190 error ("incorrect number of vector CONSTRUCTOR elements");
4191 debug_generic_stmt (rhs1
);
4195 else if (!useless_type_conversion_p (elt_t
, TREE_TYPE (elt_v
)))
4197 error ("incorrect type of vector CONSTRUCTOR elements");
4198 debug_generic_stmt (rhs1
);
4201 if (elt_i
!= NULL_TREE
4202 && (TREE_CODE (elt_t
) == VECTOR_TYPE
4203 || TREE_CODE (elt_i
) != INTEGER_CST
4204 || compare_tree_int (elt_i
, i
) != 0))
4206 error ("vector CONSTRUCTOR with non-NULL element index");
4207 debug_generic_stmt (rhs1
);
4215 case WITH_SIZE_EXPR
:
4225 /* Verify the contents of a GIMPLE_ASSIGN STMT. Returns true when there
4226 is a problem, otherwise false. */
4229 verify_gimple_assign (gimple stmt
)
4231 switch (gimple_assign_rhs_class (stmt
))
4233 case GIMPLE_SINGLE_RHS
:
4234 return verify_gimple_assign_single (stmt
);
4236 case GIMPLE_UNARY_RHS
:
4237 return verify_gimple_assign_unary (stmt
);
4239 case GIMPLE_BINARY_RHS
:
4240 return verify_gimple_assign_binary (stmt
);
4242 case GIMPLE_TERNARY_RHS
:
4243 return verify_gimple_assign_ternary (stmt
);
4250 /* Verify the contents of a GIMPLE_RETURN STMT. Returns true when there
4251 is a problem, otherwise false. */
4254 verify_gimple_return (gimple stmt
)
4256 tree op
= gimple_return_retval (stmt
);
4257 tree restype
= TREE_TYPE (TREE_TYPE (cfun
->decl
));
4259 /* We cannot test for present return values as we do not fix up missing
4260 return values from the original source. */
4264 if (!is_gimple_val (op
)
4265 && TREE_CODE (op
) != RESULT_DECL
)
4267 error ("invalid operand in return statement");
4268 debug_generic_stmt (op
);
4272 if ((TREE_CODE (op
) == RESULT_DECL
4273 && DECL_BY_REFERENCE (op
))
4274 || (TREE_CODE (op
) == SSA_NAME
4275 && SSA_NAME_VAR (op
)
4276 && TREE_CODE (SSA_NAME_VAR (op
)) == RESULT_DECL
4277 && DECL_BY_REFERENCE (SSA_NAME_VAR (op
))))
4278 op
= TREE_TYPE (op
);
4280 if (!useless_type_conversion_p (restype
, TREE_TYPE (op
)))
4282 error ("invalid conversion in return statement");
4283 debug_generic_stmt (restype
);
4284 debug_generic_stmt (TREE_TYPE (op
));
4292 /* Verify the contents of a GIMPLE_GOTO STMT. Returns true when there
4293 is a problem, otherwise false. */
4296 verify_gimple_goto (gimple stmt
)
4298 tree dest
= gimple_goto_dest (stmt
);
4300 /* ??? We have two canonical forms of direct goto destinations, a
4301 bare LABEL_DECL and an ADDR_EXPR of a LABEL_DECL. */
4302 if (TREE_CODE (dest
) != LABEL_DECL
4303 && (!is_gimple_val (dest
)
4304 || !POINTER_TYPE_P (TREE_TYPE (dest
))))
4306 error ("goto destination is neither a label nor a pointer");
4313 /* Verify the contents of a GIMPLE_SWITCH STMT. Returns true when there
4314 is a problem, otherwise false. */
4317 verify_gimple_switch (gimple stmt
)
4320 tree elt
, prev_upper_bound
= NULL_TREE
;
4321 tree index_type
, elt_type
= NULL_TREE
;
4323 if (!is_gimple_val (gimple_switch_index (stmt
)))
4325 error ("invalid operand to switch statement");
4326 debug_generic_stmt (gimple_switch_index (stmt
));
4330 index_type
= TREE_TYPE (gimple_switch_index (stmt
));
4331 if (! INTEGRAL_TYPE_P (index_type
))
4333 error ("non-integral type switch statement");
4334 debug_generic_expr (index_type
);
4338 elt
= gimple_switch_label (stmt
, 0);
4339 if (CASE_LOW (elt
) != NULL_TREE
|| CASE_HIGH (elt
) != NULL_TREE
)
4341 error ("invalid default case label in switch statement");
4342 debug_generic_expr (elt
);
4346 n
= gimple_switch_num_labels (stmt
);
4347 for (i
= 1; i
< n
; i
++)
4349 elt
= gimple_switch_label (stmt
, i
);
4351 if (! CASE_LOW (elt
))
4353 error ("invalid case label in switch statement");
4354 debug_generic_expr (elt
);
4358 && ! tree_int_cst_lt (CASE_LOW (elt
), CASE_HIGH (elt
)))
4360 error ("invalid case range in switch statement");
4361 debug_generic_expr (elt
);
4367 if (TREE_TYPE (CASE_LOW (elt
)) != elt_type
4368 || (CASE_HIGH (elt
) && TREE_TYPE (CASE_HIGH (elt
)) != elt_type
))
4370 error ("type mismatch for case label in switch statement");
4371 debug_generic_expr (elt
);
4377 elt_type
= TREE_TYPE (CASE_LOW (elt
));
4378 if (TYPE_PRECISION (index_type
) < TYPE_PRECISION (elt_type
))
4380 error ("type precision mismatch in switch statement");
4385 if (prev_upper_bound
)
4387 if (! tree_int_cst_lt (prev_upper_bound
, CASE_LOW (elt
)))
4389 error ("case labels not sorted in switch statement");
4394 prev_upper_bound
= CASE_HIGH (elt
);
4395 if (! prev_upper_bound
)
4396 prev_upper_bound
= CASE_LOW (elt
);
4402 /* Verify a gimple debug statement STMT.
4403 Returns true if anything is wrong. */
4406 verify_gimple_debug (gimple stmt ATTRIBUTE_UNUSED
)
4408 /* There isn't much that could be wrong in a gimple debug stmt. A
4409 gimple debug bind stmt, for example, maps a tree, that's usually
4410 a VAR_DECL or a PARM_DECL, but that could also be some scalarized
4411 component or member of an aggregate type, to another tree, that
4412 can be an arbitrary expression. These stmts expand into debug
4413 insns, and are converted to debug notes by var-tracking.c. */
4417 /* Verify a gimple label statement STMT.
4418 Returns true if anything is wrong. */
4421 verify_gimple_label (gimple stmt
)
4423 tree decl
= gimple_label_label (stmt
);
4427 if (TREE_CODE (decl
) != LABEL_DECL
)
4429 if (!DECL_NONLOCAL (decl
) && !FORCED_LABEL (decl
)
4430 && DECL_CONTEXT (decl
) != current_function_decl
)
4432 error ("label's context is not the current function decl");
4436 uid
= LABEL_DECL_UID (decl
);
4439 || (*label_to_block_map_for_fn (cfun
))[uid
] != gimple_bb (stmt
)))
4441 error ("incorrect entry in label_to_block_map");
4445 uid
= EH_LANDING_PAD_NR (decl
);
4448 eh_landing_pad lp
= get_eh_landing_pad_from_number (uid
);
4449 if (decl
!= lp
->post_landing_pad
)
4451 error ("incorrect setting of landing pad number");
4459 /* Verify the GIMPLE statement STMT. Returns true if there is an
4460 error, otherwise false. */
4463 verify_gimple_stmt (gimple stmt
)
4465 switch (gimple_code (stmt
))
4468 return verify_gimple_assign (stmt
);
4471 return verify_gimple_label (stmt
);
4474 return verify_gimple_call (stmt
);
4477 if (TREE_CODE_CLASS (gimple_cond_code (stmt
)) != tcc_comparison
)
4479 error ("invalid comparison code in gimple cond");
4482 if (!(!gimple_cond_true_label (stmt
)
4483 || TREE_CODE (gimple_cond_true_label (stmt
)) == LABEL_DECL
)
4484 || !(!gimple_cond_false_label (stmt
)
4485 || TREE_CODE (gimple_cond_false_label (stmt
)) == LABEL_DECL
))
4487 error ("invalid labels in gimple cond");
4491 return verify_gimple_comparison (boolean_type_node
,
4492 gimple_cond_lhs (stmt
),
4493 gimple_cond_rhs (stmt
));
4496 return verify_gimple_goto (stmt
);
4499 return verify_gimple_switch (stmt
);
4502 return verify_gimple_return (stmt
);
4507 case GIMPLE_TRANSACTION
:
4508 return verify_gimple_transaction (stmt
);
4510 /* Tuples that do not have tree operands. */
4512 case GIMPLE_PREDICT
:
4514 case GIMPLE_EH_DISPATCH
:
4515 case GIMPLE_EH_MUST_NOT_THROW
:
4519 /* OpenMP directives are validated by the FE and never operated
4520 on by the optimizers. Furthermore, GIMPLE_OMP_FOR may contain
4521 non-gimple expressions when the main index variable has had
4522 its address taken. This does not affect the loop itself
4523 because the header of an GIMPLE_OMP_FOR is merely used to determine
4524 how to setup the parallel iteration. */
4528 return verify_gimple_debug (stmt
);
4535 /* Verify the contents of a GIMPLE_PHI. Returns true if there is a problem,
4536 and false otherwise. */
4539 verify_gimple_phi (gimple phi
)
4543 tree phi_result
= gimple_phi_result (phi
);
4548 error ("invalid PHI result");
4552 virtual_p
= virtual_operand_p (phi_result
);
4553 if (TREE_CODE (phi_result
) != SSA_NAME
4555 && SSA_NAME_VAR (phi_result
) != gimple_vop (cfun
)))
4557 error ("invalid PHI result");
4561 for (i
= 0; i
< gimple_phi_num_args (phi
); i
++)
4563 tree t
= gimple_phi_arg_def (phi
, i
);
4567 error ("missing PHI def");
4571 /* Addressable variables do have SSA_NAMEs but they
4572 are not considered gimple values. */
4573 else if ((TREE_CODE (t
) == SSA_NAME
4574 && virtual_p
!= virtual_operand_p (t
))
4576 && (TREE_CODE (t
) != SSA_NAME
4577 || SSA_NAME_VAR (t
) != gimple_vop (cfun
)))
4579 && !is_gimple_val (t
)))
4581 error ("invalid PHI argument");
4582 debug_generic_expr (t
);
4585 #ifdef ENABLE_TYPES_CHECKING
4586 if (!useless_type_conversion_p (TREE_TYPE (phi_result
), TREE_TYPE (t
)))
4588 error ("incompatible types in PHI argument %u", i
);
4589 debug_generic_stmt (TREE_TYPE (phi_result
));
4590 debug_generic_stmt (TREE_TYPE (t
));
4599 /* Verify the GIMPLE statements inside the sequence STMTS. */
4602 verify_gimple_in_seq_2 (gimple_seq stmts
)
4604 gimple_stmt_iterator ittr
;
4607 for (ittr
= gsi_start (stmts
); !gsi_end_p (ittr
); gsi_next (&ittr
))
4609 gimple stmt
= gsi_stmt (ittr
);
4611 switch (gimple_code (stmt
))
4614 err
|= verify_gimple_in_seq_2 (gimple_bind_body (stmt
));
4618 err
|= verify_gimple_in_seq_2 (gimple_try_eval (stmt
));
4619 err
|= verify_gimple_in_seq_2 (gimple_try_cleanup (stmt
));
4622 case GIMPLE_EH_FILTER
:
4623 err
|= verify_gimple_in_seq_2 (gimple_eh_filter_failure (stmt
));
4626 case GIMPLE_EH_ELSE
:
4627 err
|= verify_gimple_in_seq_2 (gimple_eh_else_n_body (stmt
));
4628 err
|= verify_gimple_in_seq_2 (gimple_eh_else_e_body (stmt
));
4632 err
|= verify_gimple_in_seq_2 (gimple_catch_handler (stmt
));
4635 case GIMPLE_TRANSACTION
:
4636 err
|= verify_gimple_transaction (stmt
);
4641 bool err2
= verify_gimple_stmt (stmt
);
4643 debug_gimple_stmt (stmt
);
4652 /* Verify the contents of a GIMPLE_TRANSACTION. Returns true if there
4653 is a problem, otherwise false. */
4656 verify_gimple_transaction (gimple stmt
)
4658 tree lab
= gimple_transaction_label (stmt
);
4659 if (lab
!= NULL
&& TREE_CODE (lab
) != LABEL_DECL
)
4661 return verify_gimple_in_seq_2 (gimple_transaction_body (stmt
));
4665 /* Verify the GIMPLE statements inside the statement list STMTS. */
4668 verify_gimple_in_seq (gimple_seq stmts
)
4670 timevar_push (TV_TREE_STMT_VERIFY
);
4671 if (verify_gimple_in_seq_2 (stmts
))
4672 internal_error ("verify_gimple failed");
4673 timevar_pop (TV_TREE_STMT_VERIFY
);
4676 /* Return true when the T can be shared. */
4679 tree_node_can_be_shared (tree t
)
4681 if (IS_TYPE_OR_DECL_P (t
)
4682 || is_gimple_min_invariant (t
)
4683 || TREE_CODE (t
) == SSA_NAME
4684 || t
== error_mark_node
4685 || TREE_CODE (t
) == IDENTIFIER_NODE
)
4688 if (TREE_CODE (t
) == CASE_LABEL_EXPR
)
4697 /* Called via walk_tree. Verify tree sharing. */
4700 verify_node_sharing_1 (tree
*tp
, int *walk_subtrees
, void *data
)
4702 hash_set
<void *> *visited
= (hash_set
<void *> *) data
;
4704 if (tree_node_can_be_shared (*tp
))
4706 *walk_subtrees
= false;
4710 if (visited
->add (*tp
))
4716 /* Called via walk_gimple_stmt. Verify tree sharing. */
4719 verify_node_sharing (tree
*tp
, int *walk_subtrees
, void *data
)
4721 struct walk_stmt_info
*wi
= (struct walk_stmt_info
*) data
;
4722 return verify_node_sharing_1 (tp
, walk_subtrees
, wi
->info
);
4725 static bool eh_error_found
;
4727 verify_eh_throw_stmt_node (void **slot
, void *data
)
4729 struct throw_stmt_node
*node
= (struct throw_stmt_node
*)*slot
;
4730 hash_set
<void *> *visited
= (hash_set
<void *> *) data
;
4732 if (!visited
->contains (node
->stmt
))
4734 error ("dead STMT in EH table");
4735 debug_gimple_stmt (node
->stmt
);
4736 eh_error_found
= true;
4741 /* Verify if the location LOCs block is in BLOCKS. */
4744 verify_location (hash_set
<tree
> *blocks
, location_t loc
)
4746 tree block
= LOCATION_BLOCK (loc
);
4747 if (block
!= NULL_TREE
4748 && !blocks
->contains (block
))
4750 error ("location references block not in block tree");
4753 if (block
!= NULL_TREE
)
4754 return verify_location (blocks
, BLOCK_SOURCE_LOCATION (block
));
4758 /* Called via walk_tree. Verify that expressions have no blocks. */
4761 verify_expr_no_block (tree
*tp
, int *walk_subtrees
, void *)
4765 *walk_subtrees
= false;
4769 location_t loc
= EXPR_LOCATION (*tp
);
4770 if (LOCATION_BLOCK (loc
) != NULL
)
4776 /* Called via walk_tree. Verify locations of expressions. */
4779 verify_expr_location_1 (tree
*tp
, int *walk_subtrees
, void *data
)
4781 hash_set
<tree
> *blocks
= (hash_set
<tree
> *) data
;
4783 if (TREE_CODE (*tp
) == VAR_DECL
4784 && DECL_HAS_DEBUG_EXPR_P (*tp
))
4786 tree t
= DECL_DEBUG_EXPR (*tp
);
4787 tree addr
= walk_tree (&t
, verify_expr_no_block
, NULL
, NULL
);
4791 if ((TREE_CODE (*tp
) == VAR_DECL
4792 || TREE_CODE (*tp
) == PARM_DECL
4793 || TREE_CODE (*tp
) == RESULT_DECL
)
4794 && DECL_HAS_VALUE_EXPR_P (*tp
))
4796 tree t
= DECL_VALUE_EXPR (*tp
);
4797 tree addr
= walk_tree (&t
, verify_expr_no_block
, NULL
, NULL
);
4804 *walk_subtrees
= false;
4808 location_t loc
= EXPR_LOCATION (*tp
);
4809 if (verify_location (blocks
, loc
))
4815 /* Called via walk_gimple_op. Verify locations of expressions. */
4818 verify_expr_location (tree
*tp
, int *walk_subtrees
, void *data
)
4820 struct walk_stmt_info
*wi
= (struct walk_stmt_info
*) data
;
4821 return verify_expr_location_1 (tp
, walk_subtrees
, wi
->info
);
4824 /* Insert all subblocks of BLOCK into BLOCKS and recurse. */
4827 collect_subblocks (hash_set
<tree
> *blocks
, tree block
)
4830 for (t
= BLOCK_SUBBLOCKS (block
); t
; t
= BLOCK_CHAIN (t
))
4833 collect_subblocks (blocks
, t
);
4837 /* Verify the GIMPLE statements in the CFG of FN. */
4840 verify_gimple_in_cfg (struct function
*fn
, bool verify_nothrow
)
4845 timevar_push (TV_TREE_STMT_VERIFY
);
4846 hash_set
<void *> visited
;
4847 hash_set
<gimple
> visited_stmts
;
4849 /* Collect all BLOCKs referenced by the BLOCK tree of FN. */
4850 hash_set
<tree
> blocks
;
4851 if (DECL_INITIAL (fn
->decl
))
4853 blocks
.add (DECL_INITIAL (fn
->decl
));
4854 collect_subblocks (&blocks
, DECL_INITIAL (fn
->decl
));
4857 FOR_EACH_BB_FN (bb
, fn
)
4859 gimple_stmt_iterator gsi
;
4861 for (gsi
= gsi_start_phis (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
4863 gimple phi
= gsi_stmt (gsi
);
4867 visited_stmts
.add (phi
);
4869 if (gimple_bb (phi
) != bb
)
4871 error ("gimple_bb (phi) is set to a wrong basic block");
4875 err2
|= verify_gimple_phi (phi
);
4877 /* Only PHI arguments have locations. */
4878 if (gimple_location (phi
) != UNKNOWN_LOCATION
)
4880 error ("PHI node with location");
4884 for (i
= 0; i
< gimple_phi_num_args (phi
); i
++)
4886 tree arg
= gimple_phi_arg_def (phi
, i
);
4887 tree addr
= walk_tree (&arg
, verify_node_sharing_1
,
4891 error ("incorrect sharing of tree nodes");
4892 debug_generic_expr (addr
);
4895 location_t loc
= gimple_phi_arg_location (phi
, i
);
4896 if (virtual_operand_p (gimple_phi_result (phi
))
4897 && loc
!= UNKNOWN_LOCATION
)
4899 error ("virtual PHI with argument locations");
4902 addr
= walk_tree (&arg
, verify_expr_location_1
, &blocks
, NULL
);
4905 debug_generic_expr (addr
);
4908 err2
|= verify_location (&blocks
, loc
);
4912 debug_gimple_stmt (phi
);
4916 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
4918 gimple stmt
= gsi_stmt (gsi
);
4920 struct walk_stmt_info wi
;
4924 visited_stmts
.add (stmt
);
4926 if (gimple_bb (stmt
) != bb
)
4928 error ("gimple_bb (stmt) is set to a wrong basic block");
4932 err2
|= verify_gimple_stmt (stmt
);
4933 err2
|= verify_location (&blocks
, gimple_location (stmt
));
4935 memset (&wi
, 0, sizeof (wi
));
4936 wi
.info
= (void *) &visited
;
4937 addr
= walk_gimple_op (stmt
, verify_node_sharing
, &wi
);
4940 error ("incorrect sharing of tree nodes");
4941 debug_generic_expr (addr
);
4945 memset (&wi
, 0, sizeof (wi
));
4946 wi
.info
= (void *) &blocks
;
4947 addr
= walk_gimple_op (stmt
, verify_expr_location
, &wi
);
4950 debug_generic_expr (addr
);
4954 /* ??? Instead of not checking these stmts at all the walker
4955 should know its context via wi. */
4956 if (!is_gimple_debug (stmt
)
4957 && !is_gimple_omp (stmt
))
4959 memset (&wi
, 0, sizeof (wi
));
4960 addr
= walk_gimple_op (stmt
, verify_expr
, &wi
);
4963 debug_generic_expr (addr
);
4964 inform (gimple_location (stmt
), "in statement");
4969 /* If the statement is marked as part of an EH region, then it is
4970 expected that the statement could throw. Verify that when we
4971 have optimizations that simplify statements such that we prove
4972 that they cannot throw, that we update other data structures
4974 lp_nr
= lookup_stmt_eh_lp (stmt
);
4977 if (!stmt_could_throw_p (stmt
))
4981 error ("statement marked for throw, but doesn%'t");
4985 else if (!gsi_one_before_end_p (gsi
))
4987 error ("statement marked for throw in middle of block");
4993 debug_gimple_stmt (stmt
);
4998 eh_error_found
= false;
4999 if (get_eh_throw_stmt_table (cfun
))
5000 htab_traverse (get_eh_throw_stmt_table (cfun
),
5001 verify_eh_throw_stmt_node
,
5004 if (err
|| eh_error_found
)
5005 internal_error ("verify_gimple failed");
5007 verify_histograms ();
5008 timevar_pop (TV_TREE_STMT_VERIFY
);
5012 /* Verifies that the flow information is OK. */
5015 gimple_verify_flow_info (void)
5019 gimple_stmt_iterator gsi
;
5024 if (ENTRY_BLOCK_PTR_FOR_FN (cfun
)->il
.gimple
.seq
5025 || ENTRY_BLOCK_PTR_FOR_FN (cfun
)->il
.gimple
.phi_nodes
)
5027 error ("ENTRY_BLOCK has IL associated with it");
5031 if (EXIT_BLOCK_PTR_FOR_FN (cfun
)->il
.gimple
.seq
5032 || EXIT_BLOCK_PTR_FOR_FN (cfun
)->il
.gimple
.phi_nodes
)
5034 error ("EXIT_BLOCK has IL associated with it");
5038 FOR_EACH_EDGE (e
, ei
, EXIT_BLOCK_PTR_FOR_FN (cfun
)->preds
)
5039 if (e
->flags
& EDGE_FALLTHRU
)
5041 error ("fallthru to exit from bb %d", e
->src
->index
);
5045 FOR_EACH_BB_FN (bb
, cfun
)
5047 bool found_ctrl_stmt
= false;
5051 /* Skip labels on the start of basic block. */
5052 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
5055 gimple prev_stmt
= stmt
;
5057 stmt
= gsi_stmt (gsi
);
5059 if (gimple_code (stmt
) != GIMPLE_LABEL
)
5062 label
= gimple_label_label (stmt
);
5063 if (prev_stmt
&& DECL_NONLOCAL (label
))
5065 error ("nonlocal label ");
5066 print_generic_expr (stderr
, label
, 0);
5067 fprintf (stderr
, " is not first in a sequence of labels in bb %d",
5072 if (prev_stmt
&& EH_LANDING_PAD_NR (label
) != 0)
5074 error ("EH landing pad label ");
5075 print_generic_expr (stderr
, label
, 0);
5076 fprintf (stderr
, " is not first in a sequence of labels in bb %d",
5081 if (label_to_block (label
) != bb
)
5084 print_generic_expr (stderr
, label
, 0);
5085 fprintf (stderr
, " to block does not match in bb %d",
5090 if (decl_function_context (label
) != current_function_decl
)
5093 print_generic_expr (stderr
, label
, 0);
5094 fprintf (stderr
, " has incorrect context in bb %d",
5100 /* Verify that body of basic block BB is free of control flow. */
5101 for (; !gsi_end_p (gsi
); gsi_next (&gsi
))
5103 gimple stmt
= gsi_stmt (gsi
);
5105 if (found_ctrl_stmt
)
5107 error ("control flow in the middle of basic block %d",
5112 if (stmt_ends_bb_p (stmt
))
5113 found_ctrl_stmt
= true;
5115 if (gimple_code (stmt
) == GIMPLE_LABEL
)
5118 print_generic_expr (stderr
, gimple_label_label (stmt
), 0);
5119 fprintf (stderr
, " in the middle of basic block %d", bb
->index
);
5124 gsi
= gsi_last_bb (bb
);
5125 if (gsi_end_p (gsi
))
5128 stmt
= gsi_stmt (gsi
);
5130 if (gimple_code (stmt
) == GIMPLE_LABEL
)
5133 err
|= verify_eh_edges (stmt
);
5135 if (is_ctrl_stmt (stmt
))
5137 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
5138 if (e
->flags
& EDGE_FALLTHRU
)
5140 error ("fallthru edge after a control statement in bb %d",
5146 if (gimple_code (stmt
) != GIMPLE_COND
)
5148 /* Verify that there are no edges with EDGE_TRUE/FALSE_FLAG set
5149 after anything else but if statement. */
5150 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
5151 if (e
->flags
& (EDGE_TRUE_VALUE
| EDGE_FALSE_VALUE
))
5153 error ("true/false edge after a non-GIMPLE_COND in bb %d",
5159 switch (gimple_code (stmt
))
5166 extract_true_false_edges_from_block (bb
, &true_edge
, &false_edge
);
5170 || !(true_edge
->flags
& EDGE_TRUE_VALUE
)
5171 || !(false_edge
->flags
& EDGE_FALSE_VALUE
)
5172 || (true_edge
->flags
& (EDGE_FALLTHRU
| EDGE_ABNORMAL
))
5173 || (false_edge
->flags
& (EDGE_FALLTHRU
| EDGE_ABNORMAL
))
5174 || EDGE_COUNT (bb
->succs
) >= 3)
5176 error ("wrong outgoing edge flags at end of bb %d",
5184 if (simple_goto_p (stmt
))
5186 error ("explicit goto at end of bb %d", bb
->index
);
5191 /* FIXME. We should double check that the labels in the
5192 destination blocks have their address taken. */
5193 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
5194 if ((e
->flags
& (EDGE_FALLTHRU
| EDGE_TRUE_VALUE
5195 | EDGE_FALSE_VALUE
))
5196 || !(e
->flags
& EDGE_ABNORMAL
))
5198 error ("wrong outgoing edge flags at end of bb %d",
5206 if (!gimple_call_builtin_p (stmt
, BUILT_IN_RETURN
))
5208 /* ... fallthru ... */
5210 if (!single_succ_p (bb
)
5211 || (single_succ_edge (bb
)->flags
5212 & (EDGE_FALLTHRU
| EDGE_ABNORMAL
5213 | EDGE_TRUE_VALUE
| EDGE_FALSE_VALUE
)))
5215 error ("wrong outgoing edge flags at end of bb %d", bb
->index
);
5218 if (single_succ (bb
) != EXIT_BLOCK_PTR_FOR_FN (cfun
))
5220 error ("return edge does not point to exit in bb %d",
5232 n
= gimple_switch_num_labels (stmt
);
5234 /* Mark all the destination basic blocks. */
5235 for (i
= 0; i
< n
; ++i
)
5237 tree lab
= CASE_LABEL (gimple_switch_label (stmt
, i
));
5238 basic_block label_bb
= label_to_block (lab
);
5239 gcc_assert (!label_bb
->aux
|| label_bb
->aux
== (void *)1);
5240 label_bb
->aux
= (void *)1;
5243 /* Verify that the case labels are sorted. */
5244 prev
= gimple_switch_label (stmt
, 0);
5245 for (i
= 1; i
< n
; ++i
)
5247 tree c
= gimple_switch_label (stmt
, i
);
5250 error ("found default case not at the start of "
5256 && !tree_int_cst_lt (CASE_LOW (prev
), CASE_LOW (c
)))
5258 error ("case labels not sorted: ");
5259 print_generic_expr (stderr
, prev
, 0);
5260 fprintf (stderr
," is greater than ");
5261 print_generic_expr (stderr
, c
, 0);
5262 fprintf (stderr
," but comes before it.\n");
5267 /* VRP will remove the default case if it can prove it will
5268 never be executed. So do not verify there always exists
5269 a default case here. */
5271 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
5275 error ("extra outgoing edge %d->%d",
5276 bb
->index
, e
->dest
->index
);
5280 e
->dest
->aux
= (void *)2;
5281 if ((e
->flags
& (EDGE_FALLTHRU
| EDGE_ABNORMAL
5282 | EDGE_TRUE_VALUE
| EDGE_FALSE_VALUE
)))
5284 error ("wrong outgoing edge flags at end of bb %d",
5290 /* Check that we have all of them. */
5291 for (i
= 0; i
< n
; ++i
)
5293 tree lab
= CASE_LABEL (gimple_switch_label (stmt
, i
));
5294 basic_block label_bb
= label_to_block (lab
);
5296 if (label_bb
->aux
!= (void *)2)
5298 error ("missing edge %i->%i", bb
->index
, label_bb
->index
);
5303 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
5304 e
->dest
->aux
= (void *)0;
5308 case GIMPLE_EH_DISPATCH
:
5309 err
|= verify_eh_dispatch_edge (stmt
);
5317 if (dom_info_state (CDI_DOMINATORS
) >= DOM_NO_FAST_QUERY
)
5318 verify_dominators (CDI_DOMINATORS
);
5324 /* Updates phi nodes after creating a forwarder block joined
5325 by edge FALLTHRU. */
5328 gimple_make_forwarder_block (edge fallthru
)
5332 basic_block dummy
, bb
;
5334 gimple_stmt_iterator gsi
;
5336 dummy
= fallthru
->src
;
5337 bb
= fallthru
->dest
;
5339 if (single_pred_p (bb
))
5342 /* If we redirected a branch we must create new PHI nodes at the
5344 for (gsi
= gsi_start_phis (dummy
); !gsi_end_p (gsi
); gsi_next (&gsi
))
5346 gimple phi
, new_phi
;
5348 phi
= gsi_stmt (gsi
);
5349 var
= gimple_phi_result (phi
);
5350 new_phi
= create_phi_node (var
, bb
);
5351 gimple_phi_set_result (phi
, copy_ssa_name (var
, phi
));
5352 add_phi_arg (new_phi
, gimple_phi_result (phi
), fallthru
,
5356 /* Add the arguments we have stored on edges. */
5357 FOR_EACH_EDGE (e
, ei
, bb
->preds
)
5362 flush_pending_stmts (e
);
5367 /* Return a non-special label in the head of basic block BLOCK.
5368 Create one if it doesn't exist. */
5371 gimple_block_label (basic_block bb
)
5373 gimple_stmt_iterator i
, s
= gsi_start_bb (bb
);
5378 for (i
= s
; !gsi_end_p (i
); first
= false, gsi_next (&i
))
5380 stmt
= gsi_stmt (i
);
5381 if (gimple_code (stmt
) != GIMPLE_LABEL
)
5383 label
= gimple_label_label (stmt
);
5384 if (!DECL_NONLOCAL (label
))
5387 gsi_move_before (&i
, &s
);
5392 label
= create_artificial_label (UNKNOWN_LOCATION
);
5393 stmt
= gimple_build_label (label
);
5394 gsi_insert_before (&s
, stmt
, GSI_NEW_STMT
);
5399 /* Attempt to perform edge redirection by replacing a possibly complex
5400 jump instruction by a goto or by removing the jump completely.
5401 This can apply only if all edges now point to the same block. The
5402 parameters and return values are equivalent to
5403 redirect_edge_and_branch. */
5406 gimple_try_redirect_by_replacing_jump (edge e
, basic_block target
)
5408 basic_block src
= e
->src
;
5409 gimple_stmt_iterator i
;
5412 /* We can replace or remove a complex jump only when we have exactly
5414 if (EDGE_COUNT (src
->succs
) != 2
5415 /* Verify that all targets will be TARGET. Specifically, the
5416 edge that is not E must also go to TARGET. */
5417 || EDGE_SUCC (src
, EDGE_SUCC (src
, 0) == e
)->dest
!= target
)
5420 i
= gsi_last_bb (src
);
5424 stmt
= gsi_stmt (i
);
5426 if (gimple_code (stmt
) == GIMPLE_COND
|| gimple_code (stmt
) == GIMPLE_SWITCH
)
5428 gsi_remove (&i
, true);
5429 e
= ssa_redirect_edge (e
, target
);
5430 e
->flags
= EDGE_FALLTHRU
;
5438 /* Redirect E to DEST. Return NULL on failure. Otherwise, return the
5439 edge representing the redirected branch. */
5442 gimple_redirect_edge_and_branch (edge e
, basic_block dest
)
5444 basic_block bb
= e
->src
;
5445 gimple_stmt_iterator gsi
;
5449 if (e
->flags
& EDGE_ABNORMAL
)
5452 if (e
->dest
== dest
)
5455 if (e
->flags
& EDGE_EH
)
5456 return redirect_eh_edge (e
, dest
);
5458 if (e
->src
!= ENTRY_BLOCK_PTR_FOR_FN (cfun
))
5460 ret
= gimple_try_redirect_by_replacing_jump (e
, dest
);
5465 gsi
= gsi_last_bb (bb
);
5466 stmt
= gsi_end_p (gsi
) ? NULL
: gsi_stmt (gsi
);
5468 switch (stmt
? gimple_code (stmt
) : GIMPLE_ERROR_MARK
)
5471 /* For COND_EXPR, we only need to redirect the edge. */
5475 /* No non-abnormal edges should lead from a non-simple goto, and
5476 simple ones should be represented implicitly. */
5481 tree label
= gimple_block_label (dest
);
5482 tree cases
= get_cases_for_edge (e
, stmt
);
5484 /* If we have a list of cases associated with E, then use it
5485 as it's a lot faster than walking the entire case vector. */
5488 edge e2
= find_edge (e
->src
, dest
);
5495 CASE_LABEL (cases
) = label
;
5496 cases
= CASE_CHAIN (cases
);
5499 /* If there was already an edge in the CFG, then we need
5500 to move all the cases associated with E to E2. */
5503 tree cases2
= get_cases_for_edge (e2
, stmt
);
5505 CASE_CHAIN (last
) = CASE_CHAIN (cases2
);
5506 CASE_CHAIN (cases2
) = first
;
5508 bitmap_set_bit (touched_switch_bbs
, gimple_bb (stmt
)->index
);
5512 size_t i
, n
= gimple_switch_num_labels (stmt
);
5514 for (i
= 0; i
< n
; i
++)
5516 tree elt
= gimple_switch_label (stmt
, i
);
5517 if (label_to_block (CASE_LABEL (elt
)) == e
->dest
)
5518 CASE_LABEL (elt
) = label
;
5526 int i
, n
= gimple_asm_nlabels (stmt
);
5529 for (i
= 0; i
< n
; ++i
)
5531 tree cons
= gimple_asm_label_op (stmt
, i
);
5532 if (label_to_block (TREE_VALUE (cons
)) == e
->dest
)
5535 label
= gimple_block_label (dest
);
5536 TREE_VALUE (cons
) = label
;
5540 /* If we didn't find any label matching the former edge in the
5541 asm labels, we must be redirecting the fallthrough
5543 gcc_assert (label
|| (e
->flags
& EDGE_FALLTHRU
));
5548 gsi_remove (&gsi
, true);
5549 e
->flags
|= EDGE_FALLTHRU
;
5552 case GIMPLE_OMP_RETURN
:
5553 case GIMPLE_OMP_CONTINUE
:
5554 case GIMPLE_OMP_SECTIONS_SWITCH
:
5555 case GIMPLE_OMP_FOR
:
5556 /* The edges from OMP constructs can be simply redirected. */
5559 case GIMPLE_EH_DISPATCH
:
5560 if (!(e
->flags
& EDGE_FALLTHRU
))
5561 redirect_eh_dispatch_edge (stmt
, e
, dest
);
5564 case GIMPLE_TRANSACTION
:
5565 /* The ABORT edge has a stored label associated with it, otherwise
5566 the edges are simply redirectable. */
5568 gimple_transaction_set_label (stmt
, gimple_block_label (dest
));
5572 /* Otherwise it must be a fallthru edge, and we don't need to
5573 do anything besides redirecting it. */
5574 gcc_assert (e
->flags
& EDGE_FALLTHRU
);
5578 /* Update/insert PHI nodes as necessary. */
5580 /* Now update the edges in the CFG. */
5581 e
= ssa_redirect_edge (e
, dest
);
5586 /* Returns true if it is possible to remove edge E by redirecting
5587 it to the destination of the other edge from E->src. */
5590 gimple_can_remove_branch_p (const_edge e
)
5592 if (e
->flags
& (EDGE_ABNORMAL
| EDGE_EH
))
5598 /* Simple wrapper, as we can always redirect fallthru edges. */
5601 gimple_redirect_edge_and_branch_force (edge e
, basic_block dest
)
5603 e
= gimple_redirect_edge_and_branch (e
, dest
);
5610 /* Splits basic block BB after statement STMT (but at least after the
5611 labels). If STMT is NULL, BB is split just after the labels. */
5614 gimple_split_block (basic_block bb
, void *stmt
)
5616 gimple_stmt_iterator gsi
;
5617 gimple_stmt_iterator gsi_tgt
;
5624 new_bb
= create_empty_bb (bb
);
5626 /* Redirect the outgoing edges. */
5627 new_bb
->succs
= bb
->succs
;
5629 FOR_EACH_EDGE (e
, ei
, new_bb
->succs
)
5632 if (stmt
&& gimple_code ((gimple
) stmt
) == GIMPLE_LABEL
)
5635 /* Move everything from GSI to the new basic block. */
5636 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
5638 act
= gsi_stmt (gsi
);
5639 if (gimple_code (act
) == GIMPLE_LABEL
)
5652 if (gsi_end_p (gsi
))
5655 /* Split the statement list - avoid re-creating new containers as this
5656 brings ugly quadratic memory consumption in the inliner.
5657 (We are still quadratic since we need to update stmt BB pointers,
5659 gsi_split_seq_before (&gsi
, &list
);
5660 set_bb_seq (new_bb
, list
);
5661 for (gsi_tgt
= gsi_start (list
);
5662 !gsi_end_p (gsi_tgt
); gsi_next (&gsi_tgt
))
5663 gimple_set_bb (gsi_stmt (gsi_tgt
), new_bb
);
5669 /* Moves basic block BB after block AFTER. */
5672 gimple_move_block_after (basic_block bb
, basic_block after
)
5674 if (bb
->prev_bb
== after
)
5678 link_block (bb
, after
);
5684 /* Return TRUE if block BB has no executable statements, otherwise return
5688 gimple_empty_block_p (basic_block bb
)
5690 /* BB must have no executable statements. */
5691 gimple_stmt_iterator gsi
= gsi_after_labels (bb
);
5694 if (gsi_end_p (gsi
))
5696 if (is_gimple_debug (gsi_stmt (gsi
)))
5697 gsi_next_nondebug (&gsi
);
5698 return gsi_end_p (gsi
);
5702 /* Split a basic block if it ends with a conditional branch and if the
5703 other part of the block is not empty. */
5706 gimple_split_block_before_cond_jump (basic_block bb
)
5708 gimple last
, split_point
;
5709 gimple_stmt_iterator gsi
= gsi_last_nondebug_bb (bb
);
5710 if (gsi_end_p (gsi
))
5712 last
= gsi_stmt (gsi
);
5713 if (gimple_code (last
) != GIMPLE_COND
5714 && gimple_code (last
) != GIMPLE_SWITCH
)
5716 gsi_prev_nondebug (&gsi
);
5717 split_point
= gsi_stmt (gsi
);
5718 return split_block (bb
, split_point
)->dest
;
5722 /* Return true if basic_block can be duplicated. */
5725 gimple_can_duplicate_bb_p (const_basic_block bb ATTRIBUTE_UNUSED
)
5730 /* Create a duplicate of the basic block BB. NOTE: This does not
5731 preserve SSA form. */
5734 gimple_duplicate_bb (basic_block bb
)
5737 gimple_stmt_iterator gsi
, gsi_tgt
;
5738 gimple_seq phis
= phi_nodes (bb
);
5739 gimple phi
, stmt
, copy
;
5741 new_bb
= create_empty_bb (EXIT_BLOCK_PTR_FOR_FN (cfun
)->prev_bb
);
5743 /* Copy the PHI nodes. We ignore PHI node arguments here because
5744 the incoming edges have not been setup yet. */
5745 for (gsi
= gsi_start (phis
); !gsi_end_p (gsi
); gsi_next (&gsi
))
5747 phi
= gsi_stmt (gsi
);
5748 copy
= create_phi_node (NULL_TREE
, new_bb
);
5749 create_new_def_for (gimple_phi_result (phi
), copy
,
5750 gimple_phi_result_ptr (copy
));
5751 gimple_set_uid (copy
, gimple_uid (phi
));
5754 gsi_tgt
= gsi_start_bb (new_bb
);
5755 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
5757 def_operand_p def_p
;
5758 ssa_op_iter op_iter
;
5761 stmt
= gsi_stmt (gsi
);
5762 if (gimple_code (stmt
) == GIMPLE_LABEL
)
5765 /* Don't duplicate label debug stmts. */
5766 if (gimple_debug_bind_p (stmt
)
5767 && TREE_CODE (gimple_debug_bind_get_var (stmt
))
5771 /* Create a new copy of STMT and duplicate STMT's virtual
5773 copy
= gimple_copy (stmt
);
5774 gsi_insert_after (&gsi_tgt
, copy
, GSI_NEW_STMT
);
5776 maybe_duplicate_eh_stmt (copy
, stmt
);
5777 gimple_duplicate_stmt_histograms (cfun
, copy
, cfun
, stmt
);
5779 /* When copying around a stmt writing into a local non-user
5780 aggregate, make sure it won't share stack slot with other
5782 lhs
= gimple_get_lhs (stmt
);
5783 if (lhs
&& TREE_CODE (lhs
) != SSA_NAME
)
5785 tree base
= get_base_address (lhs
);
5787 && (TREE_CODE (base
) == VAR_DECL
5788 || TREE_CODE (base
) == RESULT_DECL
)
5789 && DECL_IGNORED_P (base
)
5790 && !TREE_STATIC (base
)
5791 && !DECL_EXTERNAL (base
)
5792 && (TREE_CODE (base
) != VAR_DECL
5793 || !DECL_HAS_VALUE_EXPR_P (base
)))
5794 DECL_NONSHAREABLE (base
) = 1;
5797 /* Create new names for all the definitions created by COPY and
5798 add replacement mappings for each new name. */
5799 FOR_EACH_SSA_DEF_OPERAND (def_p
, copy
, op_iter
, SSA_OP_ALL_DEFS
)
5800 create_new_def_for (DEF_FROM_PTR (def_p
), copy
, def_p
);
5806 /* Adds phi node arguments for edge E_COPY after basic block duplication. */
5809 add_phi_args_after_copy_edge (edge e_copy
)
5811 basic_block bb
, bb_copy
= e_copy
->src
, dest
;
5814 gimple phi
, phi_copy
;
5816 gimple_stmt_iterator psi
, psi_copy
;
5818 if (gimple_seq_empty_p (phi_nodes (e_copy
->dest
)))
5821 bb
= bb_copy
->flags
& BB_DUPLICATED
? get_bb_original (bb_copy
) : bb_copy
;
5823 if (e_copy
->dest
->flags
& BB_DUPLICATED
)
5824 dest
= get_bb_original (e_copy
->dest
);
5826 dest
= e_copy
->dest
;
5828 e
= find_edge (bb
, dest
);
5831 /* During loop unrolling the target of the latch edge is copied.
5832 In this case we are not looking for edge to dest, but to
5833 duplicated block whose original was dest. */
5834 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
5836 if ((e
->dest
->flags
& BB_DUPLICATED
)
5837 && get_bb_original (e
->dest
) == dest
)
5841 gcc_assert (e
!= NULL
);
5844 for (psi
= gsi_start_phis (e
->dest
),
5845 psi_copy
= gsi_start_phis (e_copy
->dest
);
5847 gsi_next (&psi
), gsi_next (&psi_copy
))
5849 phi
= gsi_stmt (psi
);
5850 phi_copy
= gsi_stmt (psi_copy
);
5851 def
= PHI_ARG_DEF_FROM_EDGE (phi
, e
);
5852 add_phi_arg (phi_copy
, def
, e_copy
,
5853 gimple_phi_arg_location_from_edge (phi
, e
));
5858 /* Basic block BB_COPY was created by code duplication. Add phi node
5859 arguments for edges going out of BB_COPY. The blocks that were
5860 duplicated have BB_DUPLICATED set. */
5863 add_phi_args_after_copy_bb (basic_block bb_copy
)
5868 FOR_EACH_EDGE (e_copy
, ei
, bb_copy
->succs
)
5870 add_phi_args_after_copy_edge (e_copy
);
5874 /* Blocks in REGION_COPY array of length N_REGION were created by
5875 duplication of basic blocks. Add phi node arguments for edges
5876 going from these blocks. If E_COPY is not NULL, also add
5877 phi node arguments for its destination.*/
5880 add_phi_args_after_copy (basic_block
*region_copy
, unsigned n_region
,
5885 for (i
= 0; i
< n_region
; i
++)
5886 region_copy
[i
]->flags
|= BB_DUPLICATED
;
5888 for (i
= 0; i
< n_region
; i
++)
5889 add_phi_args_after_copy_bb (region_copy
[i
]);
5891 add_phi_args_after_copy_edge (e_copy
);
5893 for (i
= 0; i
< n_region
; i
++)
5894 region_copy
[i
]->flags
&= ~BB_DUPLICATED
;
5897 /* Duplicates a REGION (set of N_REGION basic blocks) with just a single
5898 important exit edge EXIT. By important we mean that no SSA name defined
5899 inside region is live over the other exit edges of the region. All entry
5900 edges to the region must go to ENTRY->dest. The edge ENTRY is redirected
5901 to the duplicate of the region. Dominance and loop information is
5902 updated if UPDATE_DOMINANCE is true, but not the SSA web. If
5903 UPDATE_DOMINANCE is false then we assume that the caller will update the
5904 dominance information after calling this function. The new basic
5905 blocks are stored to REGION_COPY in the same order as they had in REGION,
5906 provided that REGION_COPY is not NULL.
5907 The function returns false if it is unable to copy the region,
5911 gimple_duplicate_sese_region (edge entry
, edge exit
,
5912 basic_block
*region
, unsigned n_region
,
5913 basic_block
*region_copy
,
5914 bool update_dominance
)
5917 bool free_region_copy
= false, copying_header
= false;
5918 struct loop
*loop
= entry
->dest
->loop_father
;
5920 vec
<basic_block
> doms
;
5922 int total_freq
= 0, entry_freq
= 0;
5923 gcov_type total_count
= 0, entry_count
= 0;
5925 if (!can_copy_bbs_p (region
, n_region
))
5928 /* Some sanity checking. Note that we do not check for all possible
5929 missuses of the functions. I.e. if you ask to copy something weird,
5930 it will work, but the state of structures probably will not be
5932 for (i
= 0; i
< n_region
; i
++)
5934 /* We do not handle subloops, i.e. all the blocks must belong to the
5936 if (region
[i
]->loop_father
!= loop
)
5939 if (region
[i
] != entry
->dest
5940 && region
[i
] == loop
->header
)
5944 /* In case the function is used for loop header copying (which is the primary
5945 use), ensure that EXIT and its copy will be new latch and entry edges. */
5946 if (loop
->header
== entry
->dest
)
5948 copying_header
= true;
5950 if (!dominated_by_p (CDI_DOMINATORS
, loop
->latch
, exit
->src
))
5953 for (i
= 0; i
< n_region
; i
++)
5954 if (region
[i
] != exit
->src
5955 && dominated_by_p (CDI_DOMINATORS
, region
[i
], exit
->src
))
5959 initialize_original_copy_tables ();
5962 set_loop_copy (loop
, loop_outer (loop
));
5964 set_loop_copy (loop
, loop
);
5968 region_copy
= XNEWVEC (basic_block
, n_region
);
5969 free_region_copy
= true;
5972 /* Record blocks outside the region that are dominated by something
5974 if (update_dominance
)
5977 doms
= get_dominated_by_region (CDI_DOMINATORS
, region
, n_region
);
5980 if (entry
->dest
->count
)
5982 total_count
= entry
->dest
->count
;
5983 entry_count
= entry
->count
;
5984 /* Fix up corner cases, to avoid division by zero or creation of negative
5986 if (entry_count
> total_count
)
5987 entry_count
= total_count
;
5991 total_freq
= entry
->dest
->frequency
;
5992 entry_freq
= EDGE_FREQUENCY (entry
);
5993 /* Fix up corner cases, to avoid division by zero or creation of negative
5995 if (total_freq
== 0)
5997 else if (entry_freq
> total_freq
)
5998 entry_freq
= total_freq
;
6001 copy_bbs (region
, n_region
, region_copy
, &exit
, 1, &exit_copy
, loop
,
6002 split_edge_bb_loc (entry
), update_dominance
);
6005 scale_bbs_frequencies_gcov_type (region
, n_region
,
6006 total_count
- entry_count
,
6008 scale_bbs_frequencies_gcov_type (region_copy
, n_region
, entry_count
,
6013 scale_bbs_frequencies_int (region
, n_region
, total_freq
- entry_freq
,
6015 scale_bbs_frequencies_int (region_copy
, n_region
, entry_freq
, total_freq
);
6020 loop
->header
= exit
->dest
;
6021 loop
->latch
= exit
->src
;
6024 /* Redirect the entry and add the phi node arguments. */
6025 redirected
= redirect_edge_and_branch (entry
, get_bb_copy (entry
->dest
));
6026 gcc_assert (redirected
!= NULL
);
6027 flush_pending_stmts (entry
);
6029 /* Concerning updating of dominators: We must recount dominators
6030 for entry block and its copy. Anything that is outside of the
6031 region, but was dominated by something inside needs recounting as
6033 if (update_dominance
)
6035 set_immediate_dominator (CDI_DOMINATORS
, entry
->dest
, entry
->src
);
6036 doms
.safe_push (get_bb_original (entry
->dest
));
6037 iterate_fix_dominators (CDI_DOMINATORS
, doms
, false);
6041 /* Add the other PHI node arguments. */
6042 add_phi_args_after_copy (region_copy
, n_region
, NULL
);
6044 if (free_region_copy
)
6047 free_original_copy_tables ();
6051 /* Checks if BB is part of the region defined by N_REGION BBS. */
6053 bb_part_of_region_p (basic_block bb
, basic_block
* bbs
, unsigned n_region
)
6057 for (n
= 0; n
< n_region
; n
++)
6065 /* Duplicates REGION consisting of N_REGION blocks. The new blocks
6066 are stored to REGION_COPY in the same order in that they appear
6067 in REGION, if REGION_COPY is not NULL. ENTRY is the entry to
6068 the region, EXIT an exit from it. The condition guarding EXIT
6069 is moved to ENTRY. Returns true if duplication succeeds, false
6095 gimple_duplicate_sese_tail (edge entry ATTRIBUTE_UNUSED
, edge exit ATTRIBUTE_UNUSED
,
6096 basic_block
*region ATTRIBUTE_UNUSED
, unsigned n_region ATTRIBUTE_UNUSED
,
6097 basic_block
*region_copy ATTRIBUTE_UNUSED
)
6100 bool free_region_copy
= false;
6101 struct loop
*loop
= exit
->dest
->loop_father
;
6102 struct loop
*orig_loop
= entry
->dest
->loop_father
;
6103 basic_block switch_bb
, entry_bb
, nentry_bb
;
6104 vec
<basic_block
> doms
;
6105 int total_freq
= 0, exit_freq
= 0;
6106 gcov_type total_count
= 0, exit_count
= 0;
6107 edge exits
[2], nexits
[2], e
;
6108 gimple_stmt_iterator gsi
;
6111 basic_block exit_bb
;
6112 gimple_stmt_iterator psi
;
6115 struct loop
*target
, *aloop
, *cloop
;
6117 gcc_assert (EDGE_COUNT (exit
->src
->succs
) == 2);
6119 exits
[1] = EDGE_SUCC (exit
->src
, EDGE_SUCC (exit
->src
, 0) == exit
);
6121 if (!can_copy_bbs_p (region
, n_region
))
6124 initialize_original_copy_tables ();
6125 set_loop_copy (orig_loop
, loop
);
6128 for (aloop
= orig_loop
->inner
; aloop
; aloop
= aloop
->next
)
6130 if (bb_part_of_region_p (aloop
->header
, region
, n_region
))
6132 cloop
= duplicate_loop (aloop
, target
);
6133 duplicate_subloops (aloop
, cloop
);
6139 region_copy
= XNEWVEC (basic_block
, n_region
);
6140 free_region_copy
= true;
6143 gcc_assert (!need_ssa_update_p (cfun
));
6145 /* Record blocks outside the region that are dominated by something
6147 doms
= get_dominated_by_region (CDI_DOMINATORS
, region
, n_region
);
6149 if (exit
->src
->count
)
6151 total_count
= exit
->src
->count
;
6152 exit_count
= exit
->count
;
6153 /* Fix up corner cases, to avoid division by zero or creation of negative
6155 if (exit_count
> total_count
)
6156 exit_count
= total_count
;
6160 total_freq
= exit
->src
->frequency
;
6161 exit_freq
= EDGE_FREQUENCY (exit
);
6162 /* Fix up corner cases, to avoid division by zero or creation of negative
6164 if (total_freq
== 0)
6166 if (exit_freq
> total_freq
)
6167 exit_freq
= total_freq
;
6170 copy_bbs (region
, n_region
, region_copy
, exits
, 2, nexits
, orig_loop
,
6171 split_edge_bb_loc (exit
), true);
6174 scale_bbs_frequencies_gcov_type (region
, n_region
,
6175 total_count
- exit_count
,
6177 scale_bbs_frequencies_gcov_type (region_copy
, n_region
, exit_count
,
6182 scale_bbs_frequencies_int (region
, n_region
, total_freq
- exit_freq
,
6184 scale_bbs_frequencies_int (region_copy
, n_region
, exit_freq
, total_freq
);
6187 /* Create the switch block, and put the exit condition to it. */
6188 entry_bb
= entry
->dest
;
6189 nentry_bb
= get_bb_copy (entry_bb
);
6190 if (!last_stmt (entry
->src
)
6191 || !stmt_ends_bb_p (last_stmt (entry
->src
)))
6192 switch_bb
= entry
->src
;
6194 switch_bb
= split_edge (entry
);
6195 set_immediate_dominator (CDI_DOMINATORS
, nentry_bb
, switch_bb
);
6197 gsi
= gsi_last_bb (switch_bb
);
6198 cond_stmt
= last_stmt (exit
->src
);
6199 gcc_assert (gimple_code (cond_stmt
) == GIMPLE_COND
);
6200 cond_stmt
= gimple_copy (cond_stmt
);
6202 gsi_insert_after (&gsi
, cond_stmt
, GSI_NEW_STMT
);
6204 sorig
= single_succ_edge (switch_bb
);
6205 sorig
->flags
= exits
[1]->flags
;
6206 snew
= make_edge (switch_bb
, nentry_bb
, exits
[0]->flags
);
6208 /* Register the new edge from SWITCH_BB in loop exit lists. */
6209 rescan_loop_exit (snew
, true, false);
6211 /* Add the PHI node arguments. */
6212 add_phi_args_after_copy (region_copy
, n_region
, snew
);
6214 /* Get rid of now superfluous conditions and associated edges (and phi node
6216 exit_bb
= exit
->dest
;
6218 e
= redirect_edge_and_branch (exits
[0], exits
[1]->dest
);
6219 PENDING_STMT (e
) = NULL
;
6221 /* The latch of ORIG_LOOP was copied, and so was the backedge
6222 to the original header. We redirect this backedge to EXIT_BB. */
6223 for (i
= 0; i
< n_region
; i
++)
6224 if (get_bb_original (region_copy
[i
]) == orig_loop
->latch
)
6226 gcc_assert (single_succ_edge (region_copy
[i
]));
6227 e
= redirect_edge_and_branch (single_succ_edge (region_copy
[i
]), exit_bb
);
6228 PENDING_STMT (e
) = NULL
;
6229 for (psi
= gsi_start_phis (exit_bb
);
6233 phi
= gsi_stmt (psi
);
6234 def
= PHI_ARG_DEF (phi
, nexits
[0]->dest_idx
);
6235 add_phi_arg (phi
, def
, e
, gimple_phi_arg_location_from_edge (phi
, e
));
6238 e
= redirect_edge_and_branch (nexits
[1], nexits
[0]->dest
);
6239 PENDING_STMT (e
) = NULL
;
6241 /* Anything that is outside of the region, but was dominated by something
6242 inside needs to update dominance info. */
6243 iterate_fix_dominators (CDI_DOMINATORS
, doms
, false);
6245 /* Update the SSA web. */
6246 update_ssa (TODO_update_ssa
);
6248 if (free_region_copy
)
6251 free_original_copy_tables ();
6255 /* Add all the blocks dominated by ENTRY to the array BBS_P. Stop
6256 adding blocks when the dominator traversal reaches EXIT. This
6257 function silently assumes that ENTRY strictly dominates EXIT. */
6260 gather_blocks_in_sese_region (basic_block entry
, basic_block exit
,
6261 vec
<basic_block
> *bbs_p
)
6265 for (son
= first_dom_son (CDI_DOMINATORS
, entry
);
6267 son
= next_dom_son (CDI_DOMINATORS
, son
))
6269 bbs_p
->safe_push (son
);
6271 gather_blocks_in_sese_region (son
, exit
, bbs_p
);
6275 /* Replaces *TP with a duplicate (belonging to function TO_CONTEXT).
6276 The duplicates are recorded in VARS_MAP. */
6279 replace_by_duplicate_decl (tree
*tp
, hash_map
<tree
, tree
> *vars_map
,
6282 tree t
= *tp
, new_t
;
6283 struct function
*f
= DECL_STRUCT_FUNCTION (to_context
);
6285 if (DECL_CONTEXT (t
) == to_context
)
6289 tree
&loc
= vars_map
->get_or_insert (t
, &existed
);
6295 new_t
= copy_var_decl (t
, DECL_NAME (t
), TREE_TYPE (t
));
6296 add_local_decl (f
, new_t
);
6300 gcc_assert (TREE_CODE (t
) == CONST_DECL
);
6301 new_t
= copy_node (t
);
6303 DECL_CONTEXT (new_t
) = to_context
;
6314 /* Creates an ssa name in TO_CONTEXT equivalent to NAME.
6315 VARS_MAP maps old ssa names and var_decls to the new ones. */
6318 replace_ssa_name (tree name
, hash_map
<tree
, tree
> *vars_map
,
6323 gcc_assert (!virtual_operand_p (name
));
6325 tree
*loc
= vars_map
->get (name
);
6329 tree decl
= SSA_NAME_VAR (name
);
6332 replace_by_duplicate_decl (&decl
, vars_map
, to_context
);
6333 new_name
= make_ssa_name_fn (DECL_STRUCT_FUNCTION (to_context
),
6334 decl
, SSA_NAME_DEF_STMT (name
));
6335 if (SSA_NAME_IS_DEFAULT_DEF (name
))
6336 set_ssa_default_def (DECL_STRUCT_FUNCTION (to_context
),
6340 new_name
= copy_ssa_name_fn (DECL_STRUCT_FUNCTION (to_context
),
6341 name
, SSA_NAME_DEF_STMT (name
));
6343 vars_map
->put (name
, new_name
);
6357 hash_map
<tree
, tree
> *vars_map
;
6358 htab_t new_label_map
;
6359 hash_map
<void *, void *> *eh_map
;
6363 /* Helper for move_block_to_fn. Set TREE_BLOCK in every expression
6364 contained in *TP if it has been ORIG_BLOCK previously and change the
6365 DECL_CONTEXT of every local variable referenced in *TP. */
6368 move_stmt_op (tree
*tp
, int *walk_subtrees
, void *data
)
6370 struct walk_stmt_info
*wi
= (struct walk_stmt_info
*) data
;
6371 struct move_stmt_d
*p
= (struct move_stmt_d
*) wi
->info
;
6376 tree block
= TREE_BLOCK (t
);
6377 if (block
== p
->orig_block
6378 || (p
->orig_block
== NULL_TREE
6379 && block
!= NULL_TREE
))
6380 TREE_SET_BLOCK (t
, p
->new_block
);
6381 #ifdef ENABLE_CHECKING
6382 else if (block
!= NULL_TREE
)
6384 while (block
&& TREE_CODE (block
) == BLOCK
&& block
!= p
->orig_block
)
6385 block
= BLOCK_SUPERCONTEXT (block
);
6386 gcc_assert (block
== p
->orig_block
);
6390 else if (DECL_P (t
) || TREE_CODE (t
) == SSA_NAME
)
6392 if (TREE_CODE (t
) == SSA_NAME
)
6393 *tp
= replace_ssa_name (t
, p
->vars_map
, p
->to_context
);
6394 else if (TREE_CODE (t
) == LABEL_DECL
)
6396 if (p
->new_label_map
)
6398 struct tree_map in
, *out
;
6400 out
= (struct tree_map
*)
6401 htab_find_with_hash (p
->new_label_map
, &in
, DECL_UID (t
));
6406 DECL_CONTEXT (t
) = p
->to_context
;
6408 else if (p
->remap_decls_p
)
6410 /* Replace T with its duplicate. T should no longer appear in the
6411 parent function, so this looks wasteful; however, it may appear
6412 in referenced_vars, and more importantly, as virtual operands of
6413 statements, and in alias lists of other variables. It would be
6414 quite difficult to expunge it from all those places. ??? It might
6415 suffice to do this for addressable variables. */
6416 if ((TREE_CODE (t
) == VAR_DECL
6417 && !is_global_var (t
))
6418 || TREE_CODE (t
) == CONST_DECL
)
6419 replace_by_duplicate_decl (tp
, p
->vars_map
, p
->to_context
);
6423 else if (TYPE_P (t
))
6429 /* Helper for move_stmt_r. Given an EH region number for the source
6430 function, map that to the duplicate EH regio number in the dest. */
6433 move_stmt_eh_region_nr (int old_nr
, struct move_stmt_d
*p
)
6435 eh_region old_r
, new_r
;
6437 old_r
= get_eh_region_from_number (old_nr
);
6438 new_r
= static_cast<eh_region
> (*p
->eh_map
->get (old_r
));
6440 return new_r
->index
;
6443 /* Similar, but operate on INTEGER_CSTs. */
6446 move_stmt_eh_region_tree_nr (tree old_t_nr
, struct move_stmt_d
*p
)
6450 old_nr
= tree_to_shwi (old_t_nr
);
6451 new_nr
= move_stmt_eh_region_nr (old_nr
, p
);
6453 return build_int_cst (integer_type_node
, new_nr
);
6456 /* Like move_stmt_op, but for gimple statements.
6458 Helper for move_block_to_fn. Set GIMPLE_BLOCK in every expression
6459 contained in the current statement in *GSI_P and change the
6460 DECL_CONTEXT of every local variable referenced in the current
6464 move_stmt_r (gimple_stmt_iterator
*gsi_p
, bool *handled_ops_p
,
6465 struct walk_stmt_info
*wi
)
6467 struct move_stmt_d
*p
= (struct move_stmt_d
*) wi
->info
;
6468 gimple stmt
= gsi_stmt (*gsi_p
);
6469 tree block
= gimple_block (stmt
);
6471 if (block
== p
->orig_block
6472 || (p
->orig_block
== NULL_TREE
6473 && block
!= NULL_TREE
))
6474 gimple_set_block (stmt
, p
->new_block
);
6476 switch (gimple_code (stmt
))
6479 /* Remap the region numbers for __builtin_eh_{pointer,filter}. */
6481 tree r
, fndecl
= gimple_call_fndecl (stmt
);
6482 if (fndecl
&& DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
)
6483 switch (DECL_FUNCTION_CODE (fndecl
))
6485 case BUILT_IN_EH_COPY_VALUES
:
6486 r
= gimple_call_arg (stmt
, 1);
6487 r
= move_stmt_eh_region_tree_nr (r
, p
);
6488 gimple_call_set_arg (stmt
, 1, r
);
6491 case BUILT_IN_EH_POINTER
:
6492 case BUILT_IN_EH_FILTER
:
6493 r
= gimple_call_arg (stmt
, 0);
6494 r
= move_stmt_eh_region_tree_nr (r
, p
);
6495 gimple_call_set_arg (stmt
, 0, r
);
6506 int r
= gimple_resx_region (stmt
);
6507 r
= move_stmt_eh_region_nr (r
, p
);
6508 gimple_resx_set_region (stmt
, r
);
6512 case GIMPLE_EH_DISPATCH
:
6514 int r
= gimple_eh_dispatch_region (stmt
);
6515 r
= move_stmt_eh_region_nr (r
, p
);
6516 gimple_eh_dispatch_set_region (stmt
, r
);
6520 case GIMPLE_OMP_RETURN
:
6521 case GIMPLE_OMP_CONTINUE
:
6524 if (is_gimple_omp (stmt
))
6526 /* Do not remap variables inside OMP directives. Variables
6527 referenced in clauses and directive header belong to the
6528 parent function and should not be moved into the child
6530 bool save_remap_decls_p
= p
->remap_decls_p
;
6531 p
->remap_decls_p
= false;
6532 *handled_ops_p
= true;
6534 walk_gimple_seq_mod (gimple_omp_body_ptr (stmt
), move_stmt_r
,
6537 p
->remap_decls_p
= save_remap_decls_p
;
6545 /* Move basic block BB from function CFUN to function DEST_FN. The
6546 block is moved out of the original linked list and placed after
6547 block AFTER in the new list. Also, the block is removed from the
6548 original array of blocks and placed in DEST_FN's array of blocks.
6549 If UPDATE_EDGE_COUNT_P is true, the edge counts on both CFGs is
6550 updated to reflect the moved edges.
6552 The local variables are remapped to new instances, VARS_MAP is used
6553 to record the mapping. */
6556 move_block_to_fn (struct function
*dest_cfun
, basic_block bb
,
6557 basic_block after
, bool update_edge_count_p
,
6558 struct move_stmt_d
*d
)
6560 struct control_flow_graph
*cfg
;
6563 gimple_stmt_iterator si
;
6564 unsigned old_len
, new_len
;
6566 /* Remove BB from dominance structures. */
6567 delete_from_dominance_info (CDI_DOMINATORS
, bb
);
6569 /* Move BB from its current loop to the copy in the new function. */
6572 struct loop
*new_loop
= (struct loop
*)bb
->loop_father
->aux
;
6574 bb
->loop_father
= new_loop
;
6577 /* Link BB to the new linked list. */
6578 move_block_after (bb
, after
);
6580 /* Update the edge count in the corresponding flowgraphs. */
6581 if (update_edge_count_p
)
6582 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
6584 cfun
->cfg
->x_n_edges
--;
6585 dest_cfun
->cfg
->x_n_edges
++;
6588 /* Remove BB from the original basic block array. */
6589 (*cfun
->cfg
->x_basic_block_info
)[bb
->index
] = NULL
;
6590 cfun
->cfg
->x_n_basic_blocks
--;
6592 /* Grow DEST_CFUN's basic block array if needed. */
6593 cfg
= dest_cfun
->cfg
;
6594 cfg
->x_n_basic_blocks
++;
6595 if (bb
->index
>= cfg
->x_last_basic_block
)
6596 cfg
->x_last_basic_block
= bb
->index
+ 1;
6598 old_len
= vec_safe_length (cfg
->x_basic_block_info
);
6599 if ((unsigned) cfg
->x_last_basic_block
>= old_len
)
6601 new_len
= cfg
->x_last_basic_block
+ (cfg
->x_last_basic_block
+ 3) / 4;
6602 vec_safe_grow_cleared (cfg
->x_basic_block_info
, new_len
);
6605 (*cfg
->x_basic_block_info
)[bb
->index
] = bb
;
6607 /* Remap the variables in phi nodes. */
6608 for (si
= gsi_start_phis (bb
); !gsi_end_p (si
); )
6610 gimple phi
= gsi_stmt (si
);
6612 tree op
= PHI_RESULT (phi
);
6616 if (virtual_operand_p (op
))
6618 /* Remove the phi nodes for virtual operands (alias analysis will be
6619 run for the new function, anyway). */
6620 remove_phi_node (&si
, true);
6624 SET_PHI_RESULT (phi
,
6625 replace_ssa_name (op
, d
->vars_map
, dest_cfun
->decl
));
6626 FOR_EACH_PHI_ARG (use
, phi
, oi
, SSA_OP_USE
)
6628 op
= USE_FROM_PTR (use
);
6629 if (TREE_CODE (op
) == SSA_NAME
)
6630 SET_USE (use
, replace_ssa_name (op
, d
->vars_map
, dest_cfun
->decl
));
6633 for (i
= 0; i
< EDGE_COUNT (bb
->preds
); i
++)
6635 location_t locus
= gimple_phi_arg_location (phi
, i
);
6636 tree block
= LOCATION_BLOCK (locus
);
6638 if (locus
== UNKNOWN_LOCATION
)
6640 if (d
->orig_block
== NULL_TREE
|| block
== d
->orig_block
)
6642 if (d
->new_block
== NULL_TREE
)
6643 locus
= LOCATION_LOCUS (locus
);
6645 locus
= COMBINE_LOCATION_DATA (line_table
, locus
, d
->new_block
);
6646 gimple_phi_arg_set_location (phi
, i
, locus
);
6653 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
6655 gimple stmt
= gsi_stmt (si
);
6656 struct walk_stmt_info wi
;
6658 memset (&wi
, 0, sizeof (wi
));
6660 walk_gimple_stmt (&si
, move_stmt_r
, move_stmt_op
, &wi
);
6662 if (gimple_code (stmt
) == GIMPLE_LABEL
)
6664 tree label
= gimple_label_label (stmt
);
6665 int uid
= LABEL_DECL_UID (label
);
6667 gcc_assert (uid
> -1);
6669 old_len
= vec_safe_length (cfg
->x_label_to_block_map
);
6670 if (old_len
<= (unsigned) uid
)
6672 new_len
= 3 * uid
/ 2 + 1;
6673 vec_safe_grow_cleared (cfg
->x_label_to_block_map
, new_len
);
6676 (*cfg
->x_label_to_block_map
)[uid
] = bb
;
6677 (*cfun
->cfg
->x_label_to_block_map
)[uid
] = NULL
;
6679 gcc_assert (DECL_CONTEXT (label
) == dest_cfun
->decl
);
6681 if (uid
>= dest_cfun
->cfg
->last_label_uid
)
6682 dest_cfun
->cfg
->last_label_uid
= uid
+ 1;
6685 maybe_duplicate_eh_stmt_fn (dest_cfun
, stmt
, cfun
, stmt
, d
->eh_map
, 0);
6686 remove_stmt_from_eh_lp_fn (cfun
, stmt
);
6688 gimple_duplicate_stmt_histograms (dest_cfun
, stmt
, cfun
, stmt
);
6689 gimple_remove_stmt_histograms (cfun
, stmt
);
6691 /* We cannot leave any operands allocated from the operand caches of
6692 the current function. */
6693 free_stmt_operands (cfun
, stmt
);
6694 push_cfun (dest_cfun
);
6699 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
6700 if (e
->goto_locus
!= UNKNOWN_LOCATION
)
6702 tree block
= LOCATION_BLOCK (e
->goto_locus
);
6703 if (d
->orig_block
== NULL_TREE
6704 || block
== d
->orig_block
)
6705 e
->goto_locus
= d
->new_block
?
6706 COMBINE_LOCATION_DATA (line_table
, e
->goto_locus
, d
->new_block
) :
6707 LOCATION_LOCUS (e
->goto_locus
);
6711 /* Examine the statements in BB (which is in SRC_CFUN); find and return
6712 the outermost EH region. Use REGION as the incoming base EH region. */
6715 find_outermost_region_in_block (struct function
*src_cfun
,
6716 basic_block bb
, eh_region region
)
6718 gimple_stmt_iterator si
;
6720 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
6722 gimple stmt
= gsi_stmt (si
);
6723 eh_region stmt_region
;
6726 lp_nr
= lookup_stmt_eh_lp_fn (src_cfun
, stmt
);
6727 stmt_region
= get_eh_region_from_lp_number_fn (src_cfun
, lp_nr
);
6731 region
= stmt_region
;
6732 else if (stmt_region
!= region
)
6734 region
= eh_region_outermost (src_cfun
, stmt_region
, region
);
6735 gcc_assert (region
!= NULL
);
6744 new_label_mapper (tree decl
, void *data
)
6746 htab_t hash
= (htab_t
) data
;
6750 gcc_assert (TREE_CODE (decl
) == LABEL_DECL
);
6752 m
= XNEW (struct tree_map
);
6753 m
->hash
= DECL_UID (decl
);
6754 m
->base
.from
= decl
;
6755 m
->to
= create_artificial_label (UNKNOWN_LOCATION
);
6756 LABEL_DECL_UID (m
->to
) = LABEL_DECL_UID (decl
);
6757 if (LABEL_DECL_UID (m
->to
) >= cfun
->cfg
->last_label_uid
)
6758 cfun
->cfg
->last_label_uid
= LABEL_DECL_UID (m
->to
) + 1;
6760 slot
= htab_find_slot_with_hash (hash
, m
, m
->hash
, INSERT
);
6761 gcc_assert (*slot
== NULL
);
6768 /* Change DECL_CONTEXT of all BLOCK_VARS in block, including
6772 replace_block_vars_by_duplicates (tree block
, hash_map
<tree
, tree
> *vars_map
,
6777 for (tp
= &BLOCK_VARS (block
); *tp
; tp
= &DECL_CHAIN (*tp
))
6780 if (TREE_CODE (t
) != VAR_DECL
&& TREE_CODE (t
) != CONST_DECL
)
6782 replace_by_duplicate_decl (&t
, vars_map
, to_context
);
6785 if (TREE_CODE (*tp
) == VAR_DECL
&& DECL_HAS_VALUE_EXPR_P (*tp
))
6787 SET_DECL_VALUE_EXPR (t
, DECL_VALUE_EXPR (*tp
));
6788 DECL_HAS_VALUE_EXPR_P (t
) = 1;
6790 DECL_CHAIN (t
) = DECL_CHAIN (*tp
);
6795 for (block
= BLOCK_SUBBLOCKS (block
); block
; block
= BLOCK_CHAIN (block
))
6796 replace_block_vars_by_duplicates (block
, vars_map
, to_context
);
6799 /* Fixup the loop arrays and numbers after moving LOOP and its subloops
6803 fixup_loop_arrays_after_move (struct function
*fn1
, struct function
*fn2
,
6806 /* Discard it from the old loop array. */
6807 (*get_loops (fn1
))[loop
->num
] = NULL
;
6809 /* Place it in the new loop array, assigning it a new number. */
6810 loop
->num
= number_of_loops (fn2
);
6811 vec_safe_push (loops_for_fn (fn2
)->larray
, loop
);
6813 /* Recurse to children. */
6814 for (loop
= loop
->inner
; loop
; loop
= loop
->next
)
6815 fixup_loop_arrays_after_move (fn1
, fn2
, loop
);
6818 /* Move a single-entry, single-exit region delimited by ENTRY_BB and
6819 EXIT_BB to function DEST_CFUN. The whole region is replaced by a
6820 single basic block in the original CFG and the new basic block is
6821 returned. DEST_CFUN must not have a CFG yet.
6823 Note that the region need not be a pure SESE region. Blocks inside
6824 the region may contain calls to abort/exit. The only restriction
6825 is that ENTRY_BB should be the only entry point and it must
6828 Change TREE_BLOCK of all statements in ORIG_BLOCK to the new
6829 functions outermost BLOCK, move all subblocks of ORIG_BLOCK
6830 to the new function.
6832 All local variables referenced in the region are assumed to be in
6833 the corresponding BLOCK_VARS and unexpanded variable lists
6834 associated with DEST_CFUN. */
6837 move_sese_region_to_fn (struct function
*dest_cfun
, basic_block entry_bb
,
6838 basic_block exit_bb
, tree orig_block
)
6840 vec
<basic_block
> bbs
, dom_bbs
;
6841 basic_block dom_entry
= get_immediate_dominator (CDI_DOMINATORS
, entry_bb
);
6842 basic_block after
, bb
, *entry_pred
, *exit_succ
, abb
;
6843 struct function
*saved_cfun
= cfun
;
6844 int *entry_flag
, *exit_flag
;
6845 unsigned *entry_prob
, *exit_prob
;
6846 unsigned i
, num_entry_edges
, num_exit_edges
, num_nodes
;
6849 htab_t new_label_map
;
6850 hash_map
<void *, void *> *eh_map
;
6851 struct loop
*loop
= entry_bb
->loop_father
;
6852 struct loop
*loop0
= get_loop (saved_cfun
, 0);
6853 struct move_stmt_d d
;
6855 /* If ENTRY does not strictly dominate EXIT, this cannot be an SESE
6857 gcc_assert (entry_bb
!= exit_bb
6859 || dominated_by_p (CDI_DOMINATORS
, exit_bb
, entry_bb
)));
6861 /* Collect all the blocks in the region. Manually add ENTRY_BB
6862 because it won't be added by dfs_enumerate_from. */
6864 bbs
.safe_push (entry_bb
);
6865 gather_blocks_in_sese_region (entry_bb
, exit_bb
, &bbs
);
6867 /* The blocks that used to be dominated by something in BBS will now be
6868 dominated by the new block. */
6869 dom_bbs
= get_dominated_by_region (CDI_DOMINATORS
,
6873 /* Detach ENTRY_BB and EXIT_BB from CFUN->CFG. We need to remember
6874 the predecessor edges to ENTRY_BB and the successor edges to
6875 EXIT_BB so that we can re-attach them to the new basic block that
6876 will replace the region. */
6877 num_entry_edges
= EDGE_COUNT (entry_bb
->preds
);
6878 entry_pred
= XNEWVEC (basic_block
, num_entry_edges
);
6879 entry_flag
= XNEWVEC (int, num_entry_edges
);
6880 entry_prob
= XNEWVEC (unsigned, num_entry_edges
);
6882 for (ei
= ei_start (entry_bb
->preds
); (e
= ei_safe_edge (ei
)) != NULL
;)
6884 entry_prob
[i
] = e
->probability
;
6885 entry_flag
[i
] = e
->flags
;
6886 entry_pred
[i
++] = e
->src
;
6892 num_exit_edges
= EDGE_COUNT (exit_bb
->succs
);
6893 exit_succ
= XNEWVEC (basic_block
, num_exit_edges
);
6894 exit_flag
= XNEWVEC (int, num_exit_edges
);
6895 exit_prob
= XNEWVEC (unsigned, num_exit_edges
);
6897 for (ei
= ei_start (exit_bb
->succs
); (e
= ei_safe_edge (ei
)) != NULL
;)
6899 exit_prob
[i
] = e
->probability
;
6900 exit_flag
[i
] = e
->flags
;
6901 exit_succ
[i
++] = e
->dest
;
6913 /* Switch context to the child function to initialize DEST_FN's CFG. */
6914 gcc_assert (dest_cfun
->cfg
== NULL
);
6915 push_cfun (dest_cfun
);
6917 init_empty_tree_cfg ();
6919 /* Initialize EH information for the new function. */
6921 new_label_map
= NULL
;
6924 eh_region region
= NULL
;
6926 FOR_EACH_VEC_ELT (bbs
, i
, bb
)
6927 region
= find_outermost_region_in_block (saved_cfun
, bb
, region
);
6929 init_eh_for_function ();
6932 new_label_map
= htab_create (17, tree_map_hash
, tree_map_eq
, free
);
6933 eh_map
= duplicate_eh_regions (saved_cfun
, region
, 0,
6934 new_label_mapper
, new_label_map
);
6938 /* Initialize an empty loop tree. */
6939 struct loops
*loops
= ggc_cleared_alloc
<struct loops
> ();
6940 init_loops_structure (dest_cfun
, loops
, 1);
6941 loops
->state
= LOOPS_MAY_HAVE_MULTIPLE_LATCHES
;
6942 set_loops_for_fn (dest_cfun
, loops
);
6944 /* Move the outlined loop tree part. */
6945 num_nodes
= bbs
.length ();
6946 FOR_EACH_VEC_ELT (bbs
, i
, bb
)
6948 if (bb
->loop_father
->header
== bb
)
6950 struct loop
*this_loop
= bb
->loop_father
;
6951 struct loop
*outer
= loop_outer (this_loop
);
6953 /* If the SESE region contains some bbs ending with
6954 a noreturn call, those are considered to belong
6955 to the outermost loop in saved_cfun, rather than
6956 the entry_bb's loop_father. */
6960 num_nodes
-= this_loop
->num_nodes
;
6961 flow_loop_tree_node_remove (bb
->loop_father
);
6962 flow_loop_tree_node_add (get_loop (dest_cfun
, 0), this_loop
);
6963 fixup_loop_arrays_after_move (saved_cfun
, cfun
, this_loop
);
6966 else if (bb
->loop_father
== loop0
&& loop0
!= loop
)
6969 /* Remove loop exits from the outlined region. */
6970 if (loops_for_fn (saved_cfun
)->exits
)
6971 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
6973 void **slot
= htab_find_slot_with_hash
6974 (loops_for_fn (saved_cfun
)->exits
, e
,
6975 htab_hash_pointer (e
), NO_INSERT
);
6977 htab_clear_slot (loops_for_fn (saved_cfun
)->exits
, slot
);
6982 /* Adjust the number of blocks in the tree root of the outlined part. */
6983 get_loop (dest_cfun
, 0)->num_nodes
= bbs
.length () + 2;
6985 /* Setup a mapping to be used by move_block_to_fn. */
6986 loop
->aux
= current_loops
->tree_root
;
6987 loop0
->aux
= current_loops
->tree_root
;
6991 /* Move blocks from BBS into DEST_CFUN. */
6992 gcc_assert (bbs
.length () >= 2);
6993 after
= dest_cfun
->cfg
->x_entry_block_ptr
;
6994 hash_map
<tree
, tree
> vars_map
;
6996 memset (&d
, 0, sizeof (d
));
6997 d
.orig_block
= orig_block
;
6998 d
.new_block
= DECL_INITIAL (dest_cfun
->decl
);
6999 d
.from_context
= cfun
->decl
;
7000 d
.to_context
= dest_cfun
->decl
;
7001 d
.vars_map
= &vars_map
;
7002 d
.new_label_map
= new_label_map
;
7004 d
.remap_decls_p
= true;
7006 FOR_EACH_VEC_ELT (bbs
, i
, bb
)
7008 /* No need to update edge counts on the last block. It has
7009 already been updated earlier when we detached the region from
7010 the original CFG. */
7011 move_block_to_fn (dest_cfun
, bb
, after
, bb
!= exit_bb
, &d
);
7017 /* Loop sizes are no longer correct, fix them up. */
7018 loop
->num_nodes
-= num_nodes
;
7019 for (struct loop
*outer
= loop_outer (loop
);
7020 outer
; outer
= loop_outer (outer
))
7021 outer
->num_nodes
-= num_nodes
;
7022 loop0
->num_nodes
-= bbs
.length () - num_nodes
;
7024 if (saved_cfun
->has_simduid_loops
|| saved_cfun
->has_force_vectorize_loops
)
7027 for (i
= 0; vec_safe_iterate (loops
->larray
, i
, &aloop
); i
++)
7032 replace_by_duplicate_decl (&aloop
->simduid
, d
.vars_map
,
7034 dest_cfun
->has_simduid_loops
= true;
7036 if (aloop
->force_vectorize
)
7037 dest_cfun
->has_force_vectorize_loops
= true;
7041 /* Rewire BLOCK_SUBBLOCKS of orig_block. */
7045 gcc_assert (BLOCK_SUBBLOCKS (DECL_INITIAL (dest_cfun
->decl
))
7047 BLOCK_SUBBLOCKS (DECL_INITIAL (dest_cfun
->decl
))
7048 = BLOCK_SUBBLOCKS (orig_block
);
7049 for (block
= BLOCK_SUBBLOCKS (orig_block
);
7050 block
; block
= BLOCK_CHAIN (block
))
7051 BLOCK_SUPERCONTEXT (block
) = DECL_INITIAL (dest_cfun
->decl
);
7052 BLOCK_SUBBLOCKS (orig_block
) = NULL_TREE
;
7055 replace_block_vars_by_duplicates (DECL_INITIAL (dest_cfun
->decl
),
7056 &vars_map
, dest_cfun
->decl
);
7059 htab_delete (new_label_map
);
7063 /* Rewire the entry and exit blocks. The successor to the entry
7064 block turns into the successor of DEST_FN's ENTRY_BLOCK_PTR in
7065 the child function. Similarly, the predecessor of DEST_FN's
7066 EXIT_BLOCK_PTR turns into the predecessor of EXIT_BLOCK_PTR. We
7067 need to switch CFUN between DEST_CFUN and SAVED_CFUN so that the
7068 various CFG manipulation function get to the right CFG.
7070 FIXME, this is silly. The CFG ought to become a parameter to
7072 push_cfun (dest_cfun
);
7073 make_edge (ENTRY_BLOCK_PTR_FOR_FN (cfun
), entry_bb
, EDGE_FALLTHRU
);
7075 make_edge (exit_bb
, EXIT_BLOCK_PTR_FOR_FN (cfun
), 0);
7078 /* Back in the original function, the SESE region has disappeared,
7079 create a new basic block in its place. */
7080 bb
= create_empty_bb (entry_pred
[0]);
7082 add_bb_to_loop (bb
, loop
);
7083 for (i
= 0; i
< num_entry_edges
; i
++)
7085 e
= make_edge (entry_pred
[i
], bb
, entry_flag
[i
]);
7086 e
->probability
= entry_prob
[i
];
7089 for (i
= 0; i
< num_exit_edges
; i
++)
7091 e
= make_edge (bb
, exit_succ
[i
], exit_flag
[i
]);
7092 e
->probability
= exit_prob
[i
];
7095 set_immediate_dominator (CDI_DOMINATORS
, bb
, dom_entry
);
7096 FOR_EACH_VEC_ELT (dom_bbs
, i
, abb
)
7097 set_immediate_dominator (CDI_DOMINATORS
, abb
, bb
);
7115 /* Dump FUNCTION_DECL FN to file FILE using FLAGS (see TDF_* in dumpfile.h)
7119 dump_function_to_file (tree fndecl
, FILE *file
, int flags
)
7121 tree arg
, var
, old_current_fndecl
= current_function_decl
;
7122 struct function
*dsf
;
7123 bool ignore_topmost_bind
= false, any_var
= false;
7126 bool tmclone
= (TREE_CODE (fndecl
) == FUNCTION_DECL
7127 && decl_is_tm_clone (fndecl
));
7128 struct function
*fun
= DECL_STRUCT_FUNCTION (fndecl
);
7130 current_function_decl
= fndecl
;
7131 fprintf (file
, "%s %s(", function_name (fun
), tmclone
? "[tm-clone] " : "");
7133 arg
= DECL_ARGUMENTS (fndecl
);
7136 print_generic_expr (file
, TREE_TYPE (arg
), dump_flags
);
7137 fprintf (file
, " ");
7138 print_generic_expr (file
, arg
, dump_flags
);
7139 if (flags
& TDF_VERBOSE
)
7140 print_node (file
, "", arg
, 4);
7141 if (DECL_CHAIN (arg
))
7142 fprintf (file
, ", ");
7143 arg
= DECL_CHAIN (arg
);
7145 fprintf (file
, ")\n");
7147 if (flags
& TDF_VERBOSE
)
7148 print_node (file
, "", fndecl
, 2);
7150 dsf
= DECL_STRUCT_FUNCTION (fndecl
);
7151 if (dsf
&& (flags
& TDF_EH
))
7152 dump_eh_tree (file
, dsf
);
7154 if (flags
& TDF_RAW
&& !gimple_has_body_p (fndecl
))
7156 dump_node (fndecl
, TDF_SLIM
| flags
, file
);
7157 current_function_decl
= old_current_fndecl
;
7161 /* When GIMPLE is lowered, the variables are no longer available in
7162 BIND_EXPRs, so display them separately. */
7163 if (fun
&& fun
->decl
== fndecl
&& (fun
->curr_properties
& PROP_gimple_lcf
))
7166 ignore_topmost_bind
= true;
7168 fprintf (file
, "{\n");
7169 if (!vec_safe_is_empty (fun
->local_decls
))
7170 FOR_EACH_LOCAL_DECL (fun
, ix
, var
)
7172 print_generic_decl (file
, var
, flags
);
7173 if (flags
& TDF_VERBOSE
)
7174 print_node (file
, "", var
, 4);
7175 fprintf (file
, "\n");
7179 if (gimple_in_ssa_p (cfun
))
7180 for (ix
= 1; ix
< num_ssa_names
; ++ix
)
7182 tree name
= ssa_name (ix
);
7183 if (name
&& !SSA_NAME_VAR (name
))
7185 fprintf (file
, " ");
7186 print_generic_expr (file
, TREE_TYPE (name
), flags
);
7187 fprintf (file
, " ");
7188 print_generic_expr (file
, name
, flags
);
7189 fprintf (file
, ";\n");
7196 if (fun
&& fun
->decl
== fndecl
7198 && basic_block_info_for_fn (fun
))
7200 /* If the CFG has been built, emit a CFG-based dump. */
7201 if (!ignore_topmost_bind
)
7202 fprintf (file
, "{\n");
7204 if (any_var
&& n_basic_blocks_for_fn (fun
))
7205 fprintf (file
, "\n");
7207 FOR_EACH_BB_FN (bb
, fun
)
7208 dump_bb (file
, bb
, 2, flags
| TDF_COMMENT
);
7210 fprintf (file
, "}\n");
7212 else if (DECL_SAVED_TREE (fndecl
) == NULL
)
7214 /* The function is now in GIMPLE form but the CFG has not been
7215 built yet. Emit the single sequence of GIMPLE statements
7216 that make up its body. */
7217 gimple_seq body
= gimple_body (fndecl
);
7219 if (gimple_seq_first_stmt (body
)
7220 && gimple_seq_first_stmt (body
) == gimple_seq_last_stmt (body
)
7221 && gimple_code (gimple_seq_first_stmt (body
)) == GIMPLE_BIND
)
7222 print_gimple_seq (file
, body
, 0, flags
);
7225 if (!ignore_topmost_bind
)
7226 fprintf (file
, "{\n");
7229 fprintf (file
, "\n");
7231 print_gimple_seq (file
, body
, 2, flags
);
7232 fprintf (file
, "}\n");
7239 /* Make a tree based dump. */
7240 chain
= DECL_SAVED_TREE (fndecl
);
7241 if (chain
&& TREE_CODE (chain
) == BIND_EXPR
)
7243 if (ignore_topmost_bind
)
7245 chain
= BIND_EXPR_BODY (chain
);
7253 if (!ignore_topmost_bind
)
7254 fprintf (file
, "{\n");
7259 fprintf (file
, "\n");
7261 print_generic_stmt_indented (file
, chain
, flags
, indent
);
7262 if (ignore_topmost_bind
)
7263 fprintf (file
, "}\n");
7266 if (flags
& TDF_ENUMERATE_LOCALS
)
7267 dump_enumerated_decls (file
, flags
);
7268 fprintf (file
, "\n\n");
7270 current_function_decl
= old_current_fndecl
;
7273 /* Dump FUNCTION_DECL FN to stderr using FLAGS (see TDF_* in tree.h) */
7276 debug_function (tree fn
, int flags
)
7278 dump_function_to_file (fn
, stderr
, flags
);
7282 /* Print on FILE the indexes for the predecessors of basic_block BB. */
7285 print_pred_bbs (FILE *file
, basic_block bb
)
7290 FOR_EACH_EDGE (e
, ei
, bb
->preds
)
7291 fprintf (file
, "bb_%d ", e
->src
->index
);
7295 /* Print on FILE the indexes for the successors of basic_block BB. */
7298 print_succ_bbs (FILE *file
, basic_block bb
)
7303 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
7304 fprintf (file
, "bb_%d ", e
->dest
->index
);
7307 /* Print to FILE the basic block BB following the VERBOSITY level. */
7310 print_loops_bb (FILE *file
, basic_block bb
, int indent
, int verbosity
)
7312 char *s_indent
= (char *) alloca ((size_t) indent
+ 1);
7313 memset ((void *) s_indent
, ' ', (size_t) indent
);
7314 s_indent
[indent
] = '\0';
7316 /* Print basic_block's header. */
7319 fprintf (file
, "%s bb_%d (preds = {", s_indent
, bb
->index
);
7320 print_pred_bbs (file
, bb
);
7321 fprintf (file
, "}, succs = {");
7322 print_succ_bbs (file
, bb
);
7323 fprintf (file
, "})\n");
7326 /* Print basic_block's body. */
7329 fprintf (file
, "%s {\n", s_indent
);
7330 dump_bb (file
, bb
, indent
+ 4, TDF_VOPS
|TDF_MEMSYMS
);
7331 fprintf (file
, "%s }\n", s_indent
);
7335 static void print_loop_and_siblings (FILE *, struct loop
*, int, int);
7337 /* Pretty print LOOP on FILE, indented INDENT spaces. Following
7338 VERBOSITY level this outputs the contents of the loop, or just its
7342 print_loop (FILE *file
, struct loop
*loop
, int indent
, int verbosity
)
7350 s_indent
= (char *) alloca ((size_t) indent
+ 1);
7351 memset ((void *) s_indent
, ' ', (size_t) indent
);
7352 s_indent
[indent
] = '\0';
7354 /* Print loop's header. */
7355 fprintf (file
, "%sloop_%d (", s_indent
, loop
->num
);
7357 fprintf (file
, "header = %d", loop
->header
->index
);
7360 fprintf (file
, "deleted)\n");
7364 fprintf (file
, ", latch = %d", loop
->latch
->index
);
7366 fprintf (file
, ", multiple latches");
7367 fprintf (file
, ", niter = ");
7368 print_generic_expr (file
, loop
->nb_iterations
, 0);
7370 if (loop
->any_upper_bound
)
7372 fprintf (file
, ", upper_bound = ");
7373 print_decu (loop
->nb_iterations_upper_bound
, file
);
7376 if (loop
->any_estimate
)
7378 fprintf (file
, ", estimate = ");
7379 print_decu (loop
->nb_iterations_estimate
, file
);
7381 fprintf (file
, ")\n");
7383 /* Print loop's body. */
7386 fprintf (file
, "%s{\n", s_indent
);
7387 FOR_EACH_BB_FN (bb
, cfun
)
7388 if (bb
->loop_father
== loop
)
7389 print_loops_bb (file
, bb
, indent
, verbosity
);
7391 print_loop_and_siblings (file
, loop
->inner
, indent
+ 2, verbosity
);
7392 fprintf (file
, "%s}\n", s_indent
);
7396 /* Print the LOOP and its sibling loops on FILE, indented INDENT
7397 spaces. Following VERBOSITY level this outputs the contents of the
7398 loop, or just its structure. */
7401 print_loop_and_siblings (FILE *file
, struct loop
*loop
, int indent
,
7407 print_loop (file
, loop
, indent
, verbosity
);
7408 print_loop_and_siblings (file
, loop
->next
, indent
, verbosity
);
7411 /* Follow a CFG edge from the entry point of the program, and on entry
7412 of a loop, pretty print the loop structure on FILE. */
7415 print_loops (FILE *file
, int verbosity
)
7419 bb
= ENTRY_BLOCK_PTR_FOR_FN (cfun
);
7420 if (bb
&& bb
->loop_father
)
7421 print_loop_and_siblings (file
, bb
->loop_father
, 0, verbosity
);
7427 debug (struct loop
&ref
)
7429 print_loop (stderr
, &ref
, 0, /*verbosity*/0);
7433 debug (struct loop
*ptr
)
7438 fprintf (stderr
, "<nil>\n");
7441 /* Dump a loop verbosely. */
7444 debug_verbose (struct loop
&ref
)
7446 print_loop (stderr
, &ref
, 0, /*verbosity*/3);
7450 debug_verbose (struct loop
*ptr
)
7455 fprintf (stderr
, "<nil>\n");
7459 /* Debugging loops structure at tree level, at some VERBOSITY level. */
7462 debug_loops (int verbosity
)
7464 print_loops (stderr
, verbosity
);
7467 /* Print on stderr the code of LOOP, at some VERBOSITY level. */
7470 debug_loop (struct loop
*loop
, int verbosity
)
7472 print_loop (stderr
, loop
, 0, verbosity
);
7475 /* Print on stderr the code of loop number NUM, at some VERBOSITY
7479 debug_loop_num (unsigned num
, int verbosity
)
7481 debug_loop (get_loop (cfun
, num
), verbosity
);
7484 /* Return true if BB ends with a call, possibly followed by some
7485 instructions that must stay with the call. Return false,
7489 gimple_block_ends_with_call_p (basic_block bb
)
7491 gimple_stmt_iterator gsi
= gsi_last_nondebug_bb (bb
);
7492 return !gsi_end_p (gsi
) && is_gimple_call (gsi_stmt (gsi
));
7496 /* Return true if BB ends with a conditional branch. Return false,
7500 gimple_block_ends_with_condjump_p (const_basic_block bb
)
7502 gimple stmt
= last_stmt (CONST_CAST_BB (bb
));
7503 return (stmt
&& gimple_code (stmt
) == GIMPLE_COND
);
7507 /* Return true if we need to add fake edge to exit at statement T.
7508 Helper function for gimple_flow_call_edges_add. */
7511 need_fake_edge_p (gimple t
)
7513 tree fndecl
= NULL_TREE
;
7516 /* NORETURN and LONGJMP calls already have an edge to exit.
7517 CONST and PURE calls do not need one.
7518 We don't currently check for CONST and PURE here, although
7519 it would be a good idea, because those attributes are
7520 figured out from the RTL in mark_constant_function, and
7521 the counter incrementation code from -fprofile-arcs
7522 leads to different results from -fbranch-probabilities. */
7523 if (is_gimple_call (t
))
7525 fndecl
= gimple_call_fndecl (t
);
7526 call_flags
= gimple_call_flags (t
);
7529 if (is_gimple_call (t
)
7531 && DECL_BUILT_IN (fndecl
)
7532 && (call_flags
& ECF_NOTHROW
)
7533 && !(call_flags
& ECF_RETURNS_TWICE
)
7534 /* fork() doesn't really return twice, but the effect of
7535 wrapping it in __gcov_fork() which calls __gcov_flush()
7536 and clears the counters before forking has the same
7537 effect as returning twice. Force a fake edge. */
7538 && !(DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
7539 && DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_FORK
))
7542 if (is_gimple_call (t
))
7548 if (!(call_flags
& ECF_NORETURN
))
7552 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
7553 if ((e
->flags
& EDGE_FAKE
) == 0)
7557 if (gimple_code (t
) == GIMPLE_ASM
7558 && (gimple_asm_volatile_p (t
) || gimple_asm_input_p (t
)))
7565 /* Add fake edges to the function exit for any non constant and non
7566 noreturn calls (or noreturn calls with EH/abnormal edges),
7567 volatile inline assembly in the bitmap of blocks specified by BLOCKS
7568 or to the whole CFG if BLOCKS is zero. Return the number of blocks
7571 The goal is to expose cases in which entering a basic block does
7572 not imply that all subsequent instructions must be executed. */
7575 gimple_flow_call_edges_add (sbitmap blocks
)
7578 int blocks_split
= 0;
7579 int last_bb
= last_basic_block_for_fn (cfun
);
7580 bool check_last_block
= false;
7582 if (n_basic_blocks_for_fn (cfun
) == NUM_FIXED_BLOCKS
)
7586 check_last_block
= true;
7588 check_last_block
= bitmap_bit_p (blocks
,
7589 EXIT_BLOCK_PTR_FOR_FN (cfun
)->prev_bb
->index
);
7591 /* In the last basic block, before epilogue generation, there will be
7592 a fallthru edge to EXIT. Special care is required if the last insn
7593 of the last basic block is a call because make_edge folds duplicate
7594 edges, which would result in the fallthru edge also being marked
7595 fake, which would result in the fallthru edge being removed by
7596 remove_fake_edges, which would result in an invalid CFG.
7598 Moreover, we can't elide the outgoing fake edge, since the block
7599 profiler needs to take this into account in order to solve the minimal
7600 spanning tree in the case that the call doesn't return.
7602 Handle this by adding a dummy instruction in a new last basic block. */
7603 if (check_last_block
)
7605 basic_block bb
= EXIT_BLOCK_PTR_FOR_FN (cfun
)->prev_bb
;
7606 gimple_stmt_iterator gsi
= gsi_last_nondebug_bb (bb
);
7609 if (!gsi_end_p (gsi
))
7612 if (t
&& need_fake_edge_p (t
))
7616 e
= find_edge (bb
, EXIT_BLOCK_PTR_FOR_FN (cfun
));
7619 gsi_insert_on_edge (e
, gimple_build_nop ());
7620 gsi_commit_edge_inserts ();
7625 /* Now add fake edges to the function exit for any non constant
7626 calls since there is no way that we can determine if they will
7628 for (i
= 0; i
< last_bb
; i
++)
7630 basic_block bb
= BASIC_BLOCK_FOR_FN (cfun
, i
);
7631 gimple_stmt_iterator gsi
;
7632 gimple stmt
, last_stmt
;
7637 if (blocks
&& !bitmap_bit_p (blocks
, i
))
7640 gsi
= gsi_last_nondebug_bb (bb
);
7641 if (!gsi_end_p (gsi
))
7643 last_stmt
= gsi_stmt (gsi
);
7646 stmt
= gsi_stmt (gsi
);
7647 if (need_fake_edge_p (stmt
))
7651 /* The handling above of the final block before the
7652 epilogue should be enough to verify that there is
7653 no edge to the exit block in CFG already.
7654 Calling make_edge in such case would cause us to
7655 mark that edge as fake and remove it later. */
7656 #ifdef ENABLE_CHECKING
7657 if (stmt
== last_stmt
)
7659 e
= find_edge (bb
, EXIT_BLOCK_PTR_FOR_FN (cfun
));
7660 gcc_assert (e
== NULL
);
7664 /* Note that the following may create a new basic block
7665 and renumber the existing basic blocks. */
7666 if (stmt
!= last_stmt
)
7668 e
= split_block (bb
, stmt
);
7672 make_edge (bb
, EXIT_BLOCK_PTR_FOR_FN (cfun
), EDGE_FAKE
);
7676 while (!gsi_end_p (gsi
));
7681 verify_flow_info ();
7683 return blocks_split
;
7686 /* Removes edge E and all the blocks dominated by it, and updates dominance
7687 information. The IL in E->src needs to be updated separately.
7688 If dominance info is not available, only the edge E is removed.*/
7691 remove_edge_and_dominated_blocks (edge e
)
7693 vec
<basic_block
> bbs_to_remove
= vNULL
;
7694 vec
<basic_block
> bbs_to_fix_dom
= vNULL
;
7698 bool none_removed
= false;
7700 basic_block bb
, dbb
;
7703 if (!dom_info_available_p (CDI_DOMINATORS
))
7709 /* No updating is needed for edges to exit. */
7710 if (e
->dest
== EXIT_BLOCK_PTR_FOR_FN (cfun
))
7712 if (cfgcleanup_altered_bbs
)
7713 bitmap_set_bit (cfgcleanup_altered_bbs
, e
->src
->index
);
7718 /* First, we find the basic blocks to remove. If E->dest has a predecessor
7719 that is not dominated by E->dest, then this set is empty. Otherwise,
7720 all the basic blocks dominated by E->dest are removed.
7722 Also, to DF_IDOM we store the immediate dominators of the blocks in
7723 the dominance frontier of E (i.e., of the successors of the
7724 removed blocks, if there are any, and of E->dest otherwise). */
7725 FOR_EACH_EDGE (f
, ei
, e
->dest
->preds
)
7730 if (!dominated_by_p (CDI_DOMINATORS
, f
->src
, e
->dest
))
7732 none_removed
= true;
7737 df
= BITMAP_ALLOC (NULL
);
7738 df_idom
= BITMAP_ALLOC (NULL
);
7741 bitmap_set_bit (df_idom
,
7742 get_immediate_dominator (CDI_DOMINATORS
, e
->dest
)->index
);
7745 bbs_to_remove
= get_all_dominated_blocks (CDI_DOMINATORS
, e
->dest
);
7746 FOR_EACH_VEC_ELT (bbs_to_remove
, i
, bb
)
7748 FOR_EACH_EDGE (f
, ei
, bb
->succs
)
7750 if (f
->dest
!= EXIT_BLOCK_PTR_FOR_FN (cfun
))
7751 bitmap_set_bit (df
, f
->dest
->index
);
7754 FOR_EACH_VEC_ELT (bbs_to_remove
, i
, bb
)
7755 bitmap_clear_bit (df
, bb
->index
);
7757 EXECUTE_IF_SET_IN_BITMAP (df
, 0, i
, bi
)
7759 bb
= BASIC_BLOCK_FOR_FN (cfun
, i
);
7760 bitmap_set_bit (df_idom
,
7761 get_immediate_dominator (CDI_DOMINATORS
, bb
)->index
);
7765 if (cfgcleanup_altered_bbs
)
7767 /* Record the set of the altered basic blocks. */
7768 bitmap_set_bit (cfgcleanup_altered_bbs
, e
->src
->index
);
7769 bitmap_ior_into (cfgcleanup_altered_bbs
, df
);
7772 /* Remove E and the cancelled blocks. */
7777 /* Walk backwards so as to get a chance to substitute all
7778 released DEFs into debug stmts. See
7779 eliminate_unnecessary_stmts() in tree-ssa-dce.c for more
7781 for (i
= bbs_to_remove
.length (); i
-- > 0; )
7782 delete_basic_block (bbs_to_remove
[i
]);
7785 /* Update the dominance information. The immediate dominator may change only
7786 for blocks whose immediate dominator belongs to DF_IDOM:
7788 Suppose that idom(X) = Y before removal of E and idom(X) != Y after the
7789 removal. Let Z the arbitrary block such that idom(Z) = Y and
7790 Z dominates X after the removal. Before removal, there exists a path P
7791 from Y to X that avoids Z. Let F be the last edge on P that is
7792 removed, and let W = F->dest. Before removal, idom(W) = Y (since Y
7793 dominates W, and because of P, Z does not dominate W), and W belongs to
7794 the dominance frontier of E. Therefore, Y belongs to DF_IDOM. */
7795 EXECUTE_IF_SET_IN_BITMAP (df_idom
, 0, i
, bi
)
7797 bb
= BASIC_BLOCK_FOR_FN (cfun
, i
);
7798 for (dbb
= first_dom_son (CDI_DOMINATORS
, bb
);
7800 dbb
= next_dom_son (CDI_DOMINATORS
, dbb
))
7801 bbs_to_fix_dom
.safe_push (dbb
);
7804 iterate_fix_dominators (CDI_DOMINATORS
, bbs_to_fix_dom
, true);
7807 BITMAP_FREE (df_idom
);
7808 bbs_to_remove
.release ();
7809 bbs_to_fix_dom
.release ();
7812 /* Purge dead EH edges from basic block BB. */
7815 gimple_purge_dead_eh_edges (basic_block bb
)
7817 bool changed
= false;
7820 gimple stmt
= last_stmt (bb
);
7822 if (stmt
&& stmt_can_throw_internal (stmt
))
7825 for (ei
= ei_start (bb
->succs
); (e
= ei_safe_edge (ei
)); )
7827 if (e
->flags
& EDGE_EH
)
7829 remove_edge_and_dominated_blocks (e
);
7839 /* Purge dead EH edges from basic block listed in BLOCKS. */
7842 gimple_purge_all_dead_eh_edges (const_bitmap blocks
)
7844 bool changed
= false;
7848 EXECUTE_IF_SET_IN_BITMAP (blocks
, 0, i
, bi
)
7850 basic_block bb
= BASIC_BLOCK_FOR_FN (cfun
, i
);
7852 /* Earlier gimple_purge_dead_eh_edges could have removed
7853 this basic block already. */
7854 gcc_assert (bb
|| changed
);
7856 changed
|= gimple_purge_dead_eh_edges (bb
);
7862 /* Purge dead abnormal call edges from basic block BB. */
7865 gimple_purge_dead_abnormal_call_edges (basic_block bb
)
7867 bool changed
= false;
7870 gimple stmt
= last_stmt (bb
);
7872 if (!cfun
->has_nonlocal_label
7873 && !cfun
->calls_setjmp
)
7876 if (stmt
&& stmt_can_make_abnormal_goto (stmt
))
7879 for (ei
= ei_start (bb
->succs
); (e
= ei_safe_edge (ei
)); )
7881 if (e
->flags
& EDGE_ABNORMAL
)
7883 if (e
->flags
& EDGE_FALLTHRU
)
7884 e
->flags
&= ~EDGE_ABNORMAL
;
7886 remove_edge_and_dominated_blocks (e
);
7896 /* Purge dead abnormal call edges from basic block listed in BLOCKS. */
7899 gimple_purge_all_dead_abnormal_call_edges (const_bitmap blocks
)
7901 bool changed
= false;
7905 EXECUTE_IF_SET_IN_BITMAP (blocks
, 0, i
, bi
)
7907 basic_block bb
= BASIC_BLOCK_FOR_FN (cfun
, i
);
7909 /* Earlier gimple_purge_dead_abnormal_call_edges could have removed
7910 this basic block already. */
7911 gcc_assert (bb
|| changed
);
7913 changed
|= gimple_purge_dead_abnormal_call_edges (bb
);
7919 /* This function is called whenever a new edge is created or
7923 gimple_execute_on_growing_pred (edge e
)
7925 basic_block bb
= e
->dest
;
7927 if (!gimple_seq_empty_p (phi_nodes (bb
)))
7928 reserve_phi_args_for_new_edge (bb
);
7931 /* This function is called immediately before edge E is removed from
7932 the edge vector E->dest->preds. */
7935 gimple_execute_on_shrinking_pred (edge e
)
7937 if (!gimple_seq_empty_p (phi_nodes (e
->dest
)))
7938 remove_phi_args (e
);
7941 /*---------------------------------------------------------------------------
7942 Helper functions for Loop versioning
7943 ---------------------------------------------------------------------------*/
7945 /* Adjust phi nodes for 'first' basic block. 'second' basic block is a copy
7946 of 'first'. Both of them are dominated by 'new_head' basic block. When
7947 'new_head' was created by 'second's incoming edge it received phi arguments
7948 on the edge by split_edge(). Later, additional edge 'e' was created to
7949 connect 'new_head' and 'first'. Now this routine adds phi args on this
7950 additional edge 'e' that new_head to second edge received as part of edge
7954 gimple_lv_adjust_loop_header_phi (basic_block first
, basic_block second
,
7955 basic_block new_head
, edge e
)
7958 gimple_stmt_iterator psi1
, psi2
;
7960 edge e2
= find_edge (new_head
, second
);
7962 /* Because NEW_HEAD has been created by splitting SECOND's incoming
7963 edge, we should always have an edge from NEW_HEAD to SECOND. */
7964 gcc_assert (e2
!= NULL
);
7966 /* Browse all 'second' basic block phi nodes and add phi args to
7967 edge 'e' for 'first' head. PHI args are always in correct order. */
7969 for (psi2
= gsi_start_phis (second
),
7970 psi1
= gsi_start_phis (first
);
7971 !gsi_end_p (psi2
) && !gsi_end_p (psi1
);
7972 gsi_next (&psi2
), gsi_next (&psi1
))
7974 phi1
= gsi_stmt (psi1
);
7975 phi2
= gsi_stmt (psi2
);
7976 def
= PHI_ARG_DEF (phi2
, e2
->dest_idx
);
7977 add_phi_arg (phi1
, def
, e
, gimple_phi_arg_location_from_edge (phi2
, e2
));
7982 /* Adds a if else statement to COND_BB with condition COND_EXPR.
7983 SECOND_HEAD is the destination of the THEN and FIRST_HEAD is
7984 the destination of the ELSE part. */
7987 gimple_lv_add_condition_to_bb (basic_block first_head ATTRIBUTE_UNUSED
,
7988 basic_block second_head ATTRIBUTE_UNUSED
,
7989 basic_block cond_bb
, void *cond_e
)
7991 gimple_stmt_iterator gsi
;
7992 gimple new_cond_expr
;
7993 tree cond_expr
= (tree
) cond_e
;
7996 /* Build new conditional expr */
7997 new_cond_expr
= gimple_build_cond_from_tree (cond_expr
,
7998 NULL_TREE
, NULL_TREE
);
8000 /* Add new cond in cond_bb. */
8001 gsi
= gsi_last_bb (cond_bb
);
8002 gsi_insert_after (&gsi
, new_cond_expr
, GSI_NEW_STMT
);
8004 /* Adjust edges appropriately to connect new head with first head
8005 as well as second head. */
8006 e0
= single_succ_edge (cond_bb
);
8007 e0
->flags
&= ~EDGE_FALLTHRU
;
8008 e0
->flags
|= EDGE_FALSE_VALUE
;
8012 /* Do book-keeping of basic block BB for the profile consistency checker.
8013 If AFTER_PASS is 0, do pre-pass accounting, or if AFTER_PASS is 1
8014 then do post-pass accounting. Store the counting in RECORD. */
8016 gimple_account_profile_record (basic_block bb
, int after_pass
,
8017 struct profile_record
*record
)
8019 gimple_stmt_iterator i
;
8020 for (i
= gsi_start_bb (bb
); !gsi_end_p (i
); gsi_next (&i
))
8022 record
->size
[after_pass
]
8023 += estimate_num_insns (gsi_stmt (i
), &eni_size_weights
);
8024 if (profile_status_for_fn (cfun
) == PROFILE_READ
)
8025 record
->time
[after_pass
]
8026 += estimate_num_insns (gsi_stmt (i
),
8027 &eni_time_weights
) * bb
->count
;
8028 else if (profile_status_for_fn (cfun
) == PROFILE_GUESSED
)
8029 record
->time
[after_pass
]
8030 += estimate_num_insns (gsi_stmt (i
),
8031 &eni_time_weights
) * bb
->frequency
;
8035 struct cfg_hooks gimple_cfg_hooks
= {
8037 gimple_verify_flow_info
,
8038 gimple_dump_bb
, /* dump_bb */
8039 gimple_dump_bb_for_graph
, /* dump_bb_for_graph */
8040 create_bb
, /* create_basic_block */
8041 gimple_redirect_edge_and_branch
, /* redirect_edge_and_branch */
8042 gimple_redirect_edge_and_branch_force
, /* redirect_edge_and_branch_force */
8043 gimple_can_remove_branch_p
, /* can_remove_branch_p */
8044 remove_bb
, /* delete_basic_block */
8045 gimple_split_block
, /* split_block */
8046 gimple_move_block_after
, /* move_block_after */
8047 gimple_can_merge_blocks_p
, /* can_merge_blocks_p */
8048 gimple_merge_blocks
, /* merge_blocks */
8049 gimple_predict_edge
, /* predict_edge */
8050 gimple_predicted_by_p
, /* predicted_by_p */
8051 gimple_can_duplicate_bb_p
, /* can_duplicate_block_p */
8052 gimple_duplicate_bb
, /* duplicate_block */
8053 gimple_split_edge
, /* split_edge */
8054 gimple_make_forwarder_block
, /* make_forward_block */
8055 NULL
, /* tidy_fallthru_edge */
8056 NULL
, /* force_nonfallthru */
8057 gimple_block_ends_with_call_p
,/* block_ends_with_call_p */
8058 gimple_block_ends_with_condjump_p
, /* block_ends_with_condjump_p */
8059 gimple_flow_call_edges_add
, /* flow_call_edges_add */
8060 gimple_execute_on_growing_pred
, /* execute_on_growing_pred */
8061 gimple_execute_on_shrinking_pred
, /* execute_on_shrinking_pred */
8062 gimple_duplicate_loop_to_header_edge
, /* duplicate loop for trees */
8063 gimple_lv_add_condition_to_bb
, /* lv_add_condition_to_bb */
8064 gimple_lv_adjust_loop_header_phi
, /* lv_adjust_loop_header_phi*/
8065 extract_true_false_edges_from_block
, /* extract_cond_bb_edges */
8066 flush_pending_stmts
, /* flush_pending_stmts */
8067 gimple_empty_block_p
, /* block_empty_p */
8068 gimple_split_block_before_cond_jump
, /* split_block_before_cond_jump */
8069 gimple_account_profile_record
,
8073 /* Split all critical edges. */
8076 split_critical_edges (void)
8082 /* split_edge can redirect edges out of SWITCH_EXPRs, which can get
8083 expensive. So we want to enable recording of edge to CASE_LABEL_EXPR
8084 mappings around the calls to split_edge. */
8085 start_recording_case_labels ();
8086 FOR_ALL_BB_FN (bb
, cfun
)
8088 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
8090 if (EDGE_CRITICAL_P (e
) && !(e
->flags
& EDGE_ABNORMAL
))
8092 /* PRE inserts statements to edges and expects that
8093 since split_critical_edges was done beforehand, committing edge
8094 insertions will not split more edges. In addition to critical
8095 edges we must split edges that have multiple successors and
8096 end by control flow statements, such as RESX.
8097 Go ahead and split them too. This matches the logic in
8098 gimple_find_edge_insert_loc. */
8099 else if ((!single_pred_p (e
->dest
)
8100 || !gimple_seq_empty_p (phi_nodes (e
->dest
))
8101 || e
->dest
== EXIT_BLOCK_PTR_FOR_FN (cfun
))
8102 && e
->src
!= ENTRY_BLOCK_PTR_FOR_FN (cfun
)
8103 && !(e
->flags
& EDGE_ABNORMAL
))
8105 gimple_stmt_iterator gsi
;
8107 gsi
= gsi_last_bb (e
->src
);
8108 if (!gsi_end_p (gsi
)
8109 && stmt_ends_bb_p (gsi_stmt (gsi
))
8110 && (gimple_code (gsi_stmt (gsi
)) != GIMPLE_RETURN
8111 && !gimple_call_builtin_p (gsi_stmt (gsi
),
8117 end_recording_case_labels ();
8123 const pass_data pass_data_split_crit_edges
=
8125 GIMPLE_PASS
, /* type */
8126 "crited", /* name */
8127 OPTGROUP_NONE
, /* optinfo_flags */
8128 TV_TREE_SPLIT_EDGES
, /* tv_id */
8129 PROP_cfg
, /* properties_required */
8130 PROP_no_crit_edges
, /* properties_provided */
8131 0, /* properties_destroyed */
8132 0, /* todo_flags_start */
8133 0, /* todo_flags_finish */
8136 class pass_split_crit_edges
: public gimple_opt_pass
8139 pass_split_crit_edges (gcc::context
*ctxt
)
8140 : gimple_opt_pass (pass_data_split_crit_edges
, ctxt
)
8143 /* opt_pass methods: */
8144 virtual unsigned int execute (function
*) { return split_critical_edges (); }
8146 opt_pass
* clone () { return new pass_split_crit_edges (m_ctxt
); }
8147 }; // class pass_split_crit_edges
8152 make_pass_split_crit_edges (gcc::context
*ctxt
)
8154 return new pass_split_crit_edges (ctxt
);
8158 /* Build a ternary operation and gimplify it. Emit code before GSI.
8159 Return the gimple_val holding the result. */
8162 gimplify_build3 (gimple_stmt_iterator
*gsi
, enum tree_code code
,
8163 tree type
, tree a
, tree b
, tree c
)
8166 location_t loc
= gimple_location (gsi_stmt (*gsi
));
8168 ret
= fold_build3_loc (loc
, code
, type
, a
, b
, c
);
8171 return force_gimple_operand_gsi (gsi
, ret
, true, NULL
, true,
8175 /* Build a binary operation and gimplify it. Emit code before GSI.
8176 Return the gimple_val holding the result. */
8179 gimplify_build2 (gimple_stmt_iterator
*gsi
, enum tree_code code
,
8180 tree type
, tree a
, tree b
)
8184 ret
= fold_build2_loc (gimple_location (gsi_stmt (*gsi
)), code
, type
, a
, b
);
8187 return force_gimple_operand_gsi (gsi
, ret
, true, NULL
, true,
8191 /* Build a unary operation and gimplify it. Emit code before GSI.
8192 Return the gimple_val holding the result. */
8195 gimplify_build1 (gimple_stmt_iterator
*gsi
, enum tree_code code
, tree type
,
8200 ret
= fold_build1_loc (gimple_location (gsi_stmt (*gsi
)), code
, type
, a
);
8203 return force_gimple_operand_gsi (gsi
, ret
, true, NULL
, true,
8209 /* Given a basic block B which ends with a conditional and has
8210 precisely two successors, determine which of the edges is taken if
8211 the conditional is true and which is taken if the conditional is
8212 false. Set TRUE_EDGE and FALSE_EDGE appropriately. */
8215 extract_true_false_edges_from_block (basic_block b
,
8219 edge e
= EDGE_SUCC (b
, 0);
8221 if (e
->flags
& EDGE_TRUE_VALUE
)
8224 *false_edge
= EDGE_SUCC (b
, 1);
8229 *true_edge
= EDGE_SUCC (b
, 1);
8233 /* Emit return warnings. */
8237 const pass_data pass_data_warn_function_return
=
8239 GIMPLE_PASS
, /* type */
8240 "*warn_function_return", /* name */
8241 OPTGROUP_NONE
, /* optinfo_flags */
8242 TV_NONE
, /* tv_id */
8243 PROP_cfg
, /* properties_required */
8244 0, /* properties_provided */
8245 0, /* properties_destroyed */
8246 0, /* todo_flags_start */
8247 0, /* todo_flags_finish */
8250 class pass_warn_function_return
: public gimple_opt_pass
8253 pass_warn_function_return (gcc::context
*ctxt
)
8254 : gimple_opt_pass (pass_data_warn_function_return
, ctxt
)
8257 /* opt_pass methods: */
8258 virtual unsigned int execute (function
*);
8260 }; // class pass_warn_function_return
8263 pass_warn_function_return::execute (function
*fun
)
8265 source_location location
;
8270 if (!targetm
.warn_func_return (fun
->decl
))
8273 /* If we have a path to EXIT, then we do return. */
8274 if (TREE_THIS_VOLATILE (fun
->decl
)
8275 && EDGE_COUNT (EXIT_BLOCK_PTR_FOR_FN (fun
)->preds
) > 0)
8277 location
= UNKNOWN_LOCATION
;
8278 FOR_EACH_EDGE (e
, ei
, EXIT_BLOCK_PTR_FOR_FN (fun
)->preds
)
8280 last
= last_stmt (e
->src
);
8281 if ((gimple_code (last
) == GIMPLE_RETURN
8282 || gimple_call_builtin_p (last
, BUILT_IN_RETURN
))
8283 && (location
= gimple_location (last
)) != UNKNOWN_LOCATION
)
8286 if (location
== UNKNOWN_LOCATION
)
8287 location
= cfun
->function_end_locus
;
8288 warning_at (location
, 0, "%<noreturn%> function does return");
8291 /* If we see "return;" in some basic block, then we do reach the end
8292 without returning a value. */
8293 else if (warn_return_type
8294 && !TREE_NO_WARNING (fun
->decl
)
8295 && EDGE_COUNT (EXIT_BLOCK_PTR_FOR_FN (fun
)->preds
) > 0
8296 && !VOID_TYPE_P (TREE_TYPE (TREE_TYPE (fun
->decl
))))
8298 FOR_EACH_EDGE (e
, ei
, EXIT_BLOCK_PTR_FOR_FN (fun
)->preds
)
8300 gimple last
= last_stmt (e
->src
);
8301 if (gimple_code (last
) == GIMPLE_RETURN
8302 && gimple_return_retval (last
) == NULL
8303 && !gimple_no_warning_p (last
))
8305 location
= gimple_location (last
);
8306 if (location
== UNKNOWN_LOCATION
)
8307 location
= fun
->function_end_locus
;
8308 warning_at (location
, OPT_Wreturn_type
, "control reaches end of non-void function");
8309 TREE_NO_WARNING (fun
->decl
) = 1;
8320 make_pass_warn_function_return (gcc::context
*ctxt
)
8322 return new pass_warn_function_return (ctxt
);
8325 /* Walk a gimplified function and warn for functions whose return value is
8326 ignored and attribute((warn_unused_result)) is set. This is done before
8327 inlining, so we don't have to worry about that. */
8330 do_warn_unused_result (gimple_seq seq
)
8333 gimple_stmt_iterator i
;
8335 for (i
= gsi_start (seq
); !gsi_end_p (i
); gsi_next (&i
))
8337 gimple g
= gsi_stmt (i
);
8339 switch (gimple_code (g
))
8342 do_warn_unused_result (gimple_bind_body (g
));
8345 do_warn_unused_result (gimple_try_eval (g
));
8346 do_warn_unused_result (gimple_try_cleanup (g
));
8349 do_warn_unused_result (gimple_catch_handler (g
));
8351 case GIMPLE_EH_FILTER
:
8352 do_warn_unused_result (gimple_eh_filter_failure (g
));
8356 if (gimple_call_lhs (g
))
8358 if (gimple_call_internal_p (g
))
8361 /* This is a naked call, as opposed to a GIMPLE_CALL with an
8362 LHS. All calls whose value is ignored should be
8363 represented like this. Look for the attribute. */
8364 fdecl
= gimple_call_fndecl (g
);
8365 ftype
= gimple_call_fntype (g
);
8367 if (lookup_attribute ("warn_unused_result", TYPE_ATTRIBUTES (ftype
)))
8369 location_t loc
= gimple_location (g
);
8372 warning_at (loc
, OPT_Wunused_result
,
8373 "ignoring return value of %qD, "
8374 "declared with attribute warn_unused_result",
8377 warning_at (loc
, OPT_Wunused_result
,
8378 "ignoring return value of function "
8379 "declared with attribute warn_unused_result");
8384 /* Not a container, not a call, or a call whose value is used. */
8392 const pass_data pass_data_warn_unused_result
=
8394 GIMPLE_PASS
, /* type */
8395 "*warn_unused_result", /* name */
8396 OPTGROUP_NONE
, /* optinfo_flags */
8397 TV_NONE
, /* tv_id */
8398 PROP_gimple_any
, /* properties_required */
8399 0, /* properties_provided */
8400 0, /* properties_destroyed */
8401 0, /* todo_flags_start */
8402 0, /* todo_flags_finish */
8405 class pass_warn_unused_result
: public gimple_opt_pass
8408 pass_warn_unused_result (gcc::context
*ctxt
)
8409 : gimple_opt_pass (pass_data_warn_unused_result
, ctxt
)
8412 /* opt_pass methods: */
8413 virtual bool gate (function
*) { return flag_warn_unused_result
; }
8414 virtual unsigned int execute (function
*)
8416 do_warn_unused_result (gimple_body (current_function_decl
));
8420 }; // class pass_warn_unused_result
8425 make_pass_warn_unused_result (gcc::context
*ctxt
)
8427 return new pass_warn_unused_result (ctxt
);
8430 /* IPA passes, compilation of earlier functions or inlining
8431 might have changed some properties, such as marked functions nothrow,
8432 pure, const or noreturn.
8433 Remove redundant edges and basic blocks, and create new ones if necessary.
8435 This pass can't be executed as stand alone pass from pass manager, because
8436 in between inlining and this fixup the verify_flow_info would fail. */
8439 execute_fixup_cfg (void)
8442 gimple_stmt_iterator gsi
;
8444 gcov_type count_scale
;
8449 = GCOV_COMPUTE_SCALE (cgraph_node::get (current_function_decl
)->count
,
8450 ENTRY_BLOCK_PTR_FOR_FN (cfun
)->count
);
8452 ENTRY_BLOCK_PTR_FOR_FN (cfun
)->count
=
8453 cgraph_node::get (current_function_decl
)->count
;
8454 EXIT_BLOCK_PTR_FOR_FN (cfun
)->count
=
8455 apply_scale (EXIT_BLOCK_PTR_FOR_FN (cfun
)->count
,
8458 FOR_EACH_EDGE (e
, ei
, ENTRY_BLOCK_PTR_FOR_FN (cfun
)->succs
)
8459 e
->count
= apply_scale (e
->count
, count_scale
);
8461 FOR_EACH_BB_FN (bb
, cfun
)
8463 bb
->count
= apply_scale (bb
->count
, count_scale
);
8464 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
);)
8466 gimple stmt
= gsi_stmt (gsi
);
8467 tree decl
= is_gimple_call (stmt
)
8468 ? gimple_call_fndecl (stmt
)
8472 int flags
= gimple_call_flags (stmt
);
8473 if (flags
& (ECF_CONST
| ECF_PURE
| ECF_LOOPING_CONST_OR_PURE
))
8475 if (gimple_purge_dead_abnormal_call_edges (bb
))
8476 todo
|= TODO_cleanup_cfg
;
8478 if (gimple_in_ssa_p (cfun
))
8480 todo
|= TODO_update_ssa
| TODO_cleanup_cfg
;
8485 if (flags
& ECF_NORETURN
8486 && fixup_noreturn_call (stmt
))
8487 todo
|= TODO_cleanup_cfg
;
8490 /* Remove stores to variables we marked write-only.
8491 Keep access when store has side effect, i.e. in case when source
8493 if (gimple_store_p (stmt
)
8494 && !gimple_has_side_effects (stmt
))
8496 tree lhs
= get_base_address (gimple_get_lhs (stmt
));
8498 if (TREE_CODE (lhs
) == VAR_DECL
8499 && (TREE_STATIC (lhs
) || DECL_EXTERNAL (lhs
))
8500 && varpool_node::get (lhs
)->writeonly
)
8502 unlink_stmt_vdef (stmt
);
8503 gsi_remove (&gsi
, true);
8504 release_defs (stmt
);
8505 todo
|= TODO_update_ssa
| TODO_cleanup_cfg
;
8509 /* For calls we can simply remove LHS when it is known
8510 to be write-only. */
8511 if (is_gimple_call (stmt
)
8512 && gimple_get_lhs (stmt
))
8514 tree lhs
= get_base_address (gimple_get_lhs (stmt
));
8516 if (TREE_CODE (lhs
) == VAR_DECL
8517 && (TREE_STATIC (lhs
) || DECL_EXTERNAL (lhs
))
8518 && varpool_node::get (lhs
)->writeonly
)
8520 gimple_call_set_lhs (stmt
, NULL
);
8522 todo
|= TODO_update_ssa
| TODO_cleanup_cfg
;
8526 if (maybe_clean_eh_stmt (stmt
)
8527 && gimple_purge_dead_eh_edges (bb
))
8528 todo
|= TODO_cleanup_cfg
;
8532 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
8533 e
->count
= apply_scale (e
->count
, count_scale
);
8535 /* If we have a basic block with no successors that does not
8536 end with a control statement or a noreturn call end it with
8537 a call to __builtin_unreachable. This situation can occur
8538 when inlining a noreturn call that does in fact return. */
8539 if (EDGE_COUNT (bb
->succs
) == 0)
8541 gimple stmt
= last_stmt (bb
);
8543 || (!is_ctrl_stmt (stmt
)
8544 && (!is_gimple_call (stmt
)
8545 || (gimple_call_flags (stmt
) & ECF_NORETURN
) == 0)))
8547 if (stmt
&& is_gimple_call (stmt
))
8548 gimple_call_set_ctrl_altering (stmt
, false);
8549 stmt
= gimple_build_call
8550 (builtin_decl_implicit (BUILT_IN_UNREACHABLE
), 0);
8551 gimple_stmt_iterator gsi
= gsi_last_bb (bb
);
8552 gsi_insert_after (&gsi
, stmt
, GSI_NEW_STMT
);
8556 if (count_scale
!= REG_BR_PROB_BASE
)
8557 compute_function_frequency ();
8559 /* Dump a textual representation of the flowgraph. */
8561 gimple_dump_cfg (dump_file
, dump_flags
);
8564 && (todo
& TODO_cleanup_cfg
))
8565 loops_state_set (LOOPS_NEED_FIXUP
);
8572 const pass_data pass_data_fixup_cfg
=
8574 GIMPLE_PASS
, /* type */
8575 "*free_cfg_annotations", /* name */
8576 OPTGROUP_NONE
, /* optinfo_flags */
8577 TV_NONE
, /* tv_id */
8578 PROP_cfg
, /* properties_required */
8579 0, /* properties_provided */
8580 0, /* properties_destroyed */
8581 0, /* todo_flags_start */
8582 0, /* todo_flags_finish */
8585 class pass_fixup_cfg
: public gimple_opt_pass
8588 pass_fixup_cfg (gcc::context
*ctxt
)
8589 : gimple_opt_pass (pass_data_fixup_cfg
, ctxt
)
8592 /* opt_pass methods: */
8593 opt_pass
* clone () { return new pass_fixup_cfg (m_ctxt
); }
8594 virtual unsigned int execute (function
*) { return execute_fixup_cfg (); }
8596 }; // class pass_fixup_cfg
8601 make_pass_fixup_cfg (gcc::context
*ctxt
)
8603 return new pass_fixup_cfg (ctxt
);
8606 /* Garbage collection support for edge_def. */
8608 extern void gt_ggc_mx (tree
&);
8609 extern void gt_ggc_mx (gimple
&);
8610 extern void gt_ggc_mx (rtx
&);
8611 extern void gt_ggc_mx (basic_block
&);
8614 gt_ggc_mx (rtx_insn
*& x
)
8617 gt_ggc_mx_rtx_def ((void *) x
);
8621 gt_ggc_mx (edge_def
*e
)
8623 tree block
= LOCATION_BLOCK (e
->goto_locus
);
8625 gt_ggc_mx (e
->dest
);
8626 if (current_ir_type () == IR_GIMPLE
)
8627 gt_ggc_mx (e
->insns
.g
);
8629 gt_ggc_mx (e
->insns
.r
);
8633 /* PCH support for edge_def. */
8635 extern void gt_pch_nx (tree
&);
8636 extern void gt_pch_nx (gimple
&);
8637 extern void gt_pch_nx (rtx
&);
8638 extern void gt_pch_nx (basic_block
&);
8641 gt_pch_nx (rtx_insn
*& x
)
8644 gt_pch_nx_rtx_def ((void *) x
);
8648 gt_pch_nx (edge_def
*e
)
8650 tree block
= LOCATION_BLOCK (e
->goto_locus
);
8652 gt_pch_nx (e
->dest
);
8653 if (current_ir_type () == IR_GIMPLE
)
8654 gt_pch_nx (e
->insns
.g
);
8656 gt_pch_nx (e
->insns
.r
);
8661 gt_pch_nx (edge_def
*e
, gt_pointer_operator op
, void *cookie
)
8663 tree block
= LOCATION_BLOCK (e
->goto_locus
);
8664 op (&(e
->src
), cookie
);
8665 op (&(e
->dest
), cookie
);
8666 if (current_ir_type () == IR_GIMPLE
)
8667 op (&(e
->insns
.g
), cookie
);
8669 op (&(e
->insns
.r
), cookie
);
8670 op (&(block
), cookie
);