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 (gswitch
*, 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 (gtransaction
*);
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 (gswitch
*, basic_block
, tree
);
176 static tree
find_case_label_for_value (gswitch
*, 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 gcond
*cond_stmt
= as_a
<gcond
*> (stmt
);
595 location_t loc
= gimple_location (stmt
);
599 fold_defer_overflow_warnings ();
600 cond
= fold_binary_loc (loc
, gimple_cond_code (cond_stmt
),
602 gimple_cond_lhs (cond_stmt
),
603 gimple_cond_rhs (cond_stmt
));
606 zerop
= integer_zerop (cond
);
607 onep
= integer_onep (cond
);
610 zerop
= onep
= false;
612 fold_undefer_overflow_warnings (zerop
|| onep
,
614 WARN_STRICT_OVERFLOW_CONDITIONAL
);
616 gimple_cond_make_false (cond_stmt
);
618 gimple_cond_make_true (cond_stmt
);
623 /* If basic block BB has an abnormal edge to a basic block
624 containing IFN_ABNORMAL_DISPATCHER internal call, return
625 that the dispatcher's basic block, otherwise return NULL. */
628 get_abnormal_succ_dispatcher (basic_block bb
)
633 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
634 if ((e
->flags
& (EDGE_ABNORMAL
| EDGE_EH
)) == EDGE_ABNORMAL
)
636 gimple_stmt_iterator gsi
637 = gsi_start_nondebug_after_labels_bb (e
->dest
);
638 gimple g
= gsi_stmt (gsi
);
640 && is_gimple_call (g
)
641 && gimple_call_internal_p (g
)
642 && gimple_call_internal_fn (g
) == IFN_ABNORMAL_DISPATCHER
)
648 /* Helper function for make_edges. Create a basic block with
649 with ABNORMAL_DISPATCHER internal call in it if needed, and
650 create abnormal edges from BBS to it and from it to FOR_BB
651 if COMPUTED_GOTO is false, otherwise factor the computed gotos. */
654 handle_abnormal_edges (basic_block
*dispatcher_bbs
,
655 basic_block for_bb
, int *bb_to_omp_idx
,
656 auto_vec
<basic_block
> *bbs
, bool computed_goto
)
658 basic_block
*dispatcher
= dispatcher_bbs
+ (computed_goto
? 1 : 0);
659 unsigned int idx
= 0;
665 dispatcher
= dispatcher_bbs
+ 2 * bb_to_omp_idx
[for_bb
->index
];
666 if (bb_to_omp_idx
[for_bb
->index
] != 0)
670 /* If the dispatcher has been created already, then there are basic
671 blocks with abnormal edges to it, so just make a new edge to
673 if (*dispatcher
== NULL
)
675 /* Check if there are any basic blocks that need to have
676 abnormal edges to this dispatcher. If there are none, return
678 if (bb_to_omp_idx
== NULL
)
680 if (bbs
->is_empty ())
685 FOR_EACH_VEC_ELT (*bbs
, idx
, bb
)
686 if (bb_to_omp_idx
[bb
->index
] == bb_to_omp_idx
[for_bb
->index
])
692 /* Create the dispatcher bb. */
693 *dispatcher
= create_basic_block (NULL
, NULL
, for_bb
);
696 /* Factor computed gotos into a common computed goto site. Also
697 record the location of that site so that we can un-factor the
698 gotos after we have converted back to normal form. */
699 gimple_stmt_iterator gsi
= gsi_start_bb (*dispatcher
);
701 /* Create the destination of the factored goto. Each original
702 computed goto will put its desired destination into this
703 variable and jump to the label we create immediately below. */
704 tree var
= create_tmp_var (ptr_type_node
, "gotovar");
706 /* Build a label for the new block which will contain the
707 factored computed goto. */
708 tree factored_label_decl
709 = create_artificial_label (UNKNOWN_LOCATION
);
710 gimple factored_computed_goto_label
711 = gimple_build_label (factored_label_decl
);
712 gsi_insert_after (&gsi
, factored_computed_goto_label
, GSI_NEW_STMT
);
714 /* Build our new computed goto. */
715 gimple factored_computed_goto
= gimple_build_goto (var
);
716 gsi_insert_after (&gsi
, factored_computed_goto
, GSI_NEW_STMT
);
718 FOR_EACH_VEC_ELT (*bbs
, idx
, bb
)
721 && bb_to_omp_idx
[bb
->index
] != bb_to_omp_idx
[for_bb
->index
])
724 gsi
= gsi_last_bb (bb
);
725 gimple last
= gsi_stmt (gsi
);
727 gcc_assert (computed_goto_p (last
));
729 /* Copy the original computed goto's destination into VAR. */
731 = gimple_build_assign (var
, gimple_goto_dest (last
));
732 gsi_insert_before (&gsi
, assignment
, GSI_SAME_STMT
);
734 edge e
= make_edge (bb
, *dispatcher
, EDGE_FALLTHRU
);
735 e
->goto_locus
= gimple_location (last
);
736 gsi_remove (&gsi
, true);
741 tree arg
= inner
? boolean_true_node
: boolean_false_node
;
742 gimple g
= gimple_build_call_internal (IFN_ABNORMAL_DISPATCHER
,
744 gimple_stmt_iterator gsi
= gsi_after_labels (*dispatcher
);
745 gsi_insert_after (&gsi
, g
, GSI_NEW_STMT
);
747 /* Create predecessor edges of the dispatcher. */
748 FOR_EACH_VEC_ELT (*bbs
, idx
, bb
)
751 && bb_to_omp_idx
[bb
->index
] != bb_to_omp_idx
[for_bb
->index
])
753 make_edge (bb
, *dispatcher
, EDGE_ABNORMAL
);
758 make_edge (*dispatcher
, for_bb
, EDGE_ABNORMAL
);
761 /* Join all the blocks in the flowgraph. */
767 struct omp_region
*cur_region
= NULL
;
768 auto_vec
<basic_block
> ab_edge_goto
;
769 auto_vec
<basic_block
> ab_edge_call
;
770 int *bb_to_omp_idx
= NULL
;
771 int cur_omp_region_idx
= 0;
773 /* Create an edge from entry to the first block with executable
775 make_edge (ENTRY_BLOCK_PTR_FOR_FN (cfun
),
776 BASIC_BLOCK_FOR_FN (cfun
, NUM_FIXED_BLOCKS
),
779 /* Traverse the basic block array placing edges. */
780 FOR_EACH_BB_FN (bb
, cfun
)
782 gimple last
= last_stmt (bb
);
786 bb_to_omp_idx
[bb
->index
] = cur_omp_region_idx
;
790 enum gimple_code code
= gimple_code (last
);
794 if (make_goto_expr_edges (bb
))
795 ab_edge_goto
.safe_push (bb
);
800 edge e
= make_edge (bb
, EXIT_BLOCK_PTR_FOR_FN (cfun
), 0);
801 e
->goto_locus
= gimple_location (last
);
806 make_cond_expr_edges (bb
);
810 make_gimple_switch_edges (as_a
<gswitch
*> (last
), bb
);
814 make_eh_edges (last
);
817 case GIMPLE_EH_DISPATCH
:
819 make_eh_dispatch_edges (as_a
<geh_dispatch
*> (last
));
823 /* If this function receives a nonlocal goto, then we need to
824 make edges from this call site to all the nonlocal goto
826 if (stmt_can_make_abnormal_goto (last
))
827 ab_edge_call
.safe_push (bb
);
829 /* If this statement has reachable exception handlers, then
830 create abnormal edges to them. */
831 make_eh_edges (last
);
833 /* BUILTIN_RETURN is really a return statement. */
834 if (gimple_call_builtin_p (last
, BUILT_IN_RETURN
))
836 make_edge (bb
, EXIT_BLOCK_PTR_FOR_FN (cfun
), 0);
839 /* Some calls are known not to return. */
841 fallthru
= !(gimple_call_flags (last
) & ECF_NORETURN
);
845 /* A GIMPLE_ASSIGN may throw internally and thus be considered
847 if (is_ctrl_altering_stmt (last
))
848 make_eh_edges (last
);
853 make_gimple_asm_edges (bb
);
858 fallthru
= make_gimple_omp_edges (bb
, &cur_region
,
859 &cur_omp_region_idx
);
860 if (cur_region
&& bb_to_omp_idx
== NULL
)
861 bb_to_omp_idx
= XCNEWVEC (int, n_basic_blocks_for_fn (cfun
));
864 case GIMPLE_TRANSACTION
:
867 gimple_transaction_label (as_a
<gtransaction
*> (last
));
869 make_edge (bb
, label_to_block (abort_label
), EDGE_TM_ABORT
);
875 gcc_assert (!stmt_ends_bb_p (last
));
883 make_edge (bb
, bb
->next_bb
, EDGE_FALLTHRU
);
886 /* Computed gotos are hell to deal with, especially if there are
887 lots of them with a large number of destinations. So we factor
888 them to a common computed goto location before we build the
889 edge list. After we convert back to normal form, we will un-factor
890 the computed gotos since factoring introduces an unwanted jump.
891 For non-local gotos and abnormal edges from calls to calls that return
892 twice or forced labels, factor the abnormal edges too, by having all
893 abnormal edges from the calls go to a common artificial basic block
894 with ABNORMAL_DISPATCHER internal call and abnormal edges from that
895 basic block to all forced labels and calls returning twice.
896 We do this per-OpenMP structured block, because those regions
897 are guaranteed to be single entry single exit by the standard,
898 so it is not allowed to enter or exit such regions abnormally this way,
899 thus all computed gotos, non-local gotos and setjmp/longjmp calls
900 must not transfer control across SESE region boundaries. */
901 if (!ab_edge_goto
.is_empty () || !ab_edge_call
.is_empty ())
903 gimple_stmt_iterator gsi
;
904 basic_block dispatcher_bb_array
[2] = { NULL
, NULL
};
905 basic_block
*dispatcher_bbs
= dispatcher_bb_array
;
906 int count
= n_basic_blocks_for_fn (cfun
);
909 dispatcher_bbs
= XCNEWVEC (basic_block
, 2 * count
);
911 FOR_EACH_BB_FN (bb
, cfun
)
913 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
916 dyn_cast
<glabel
*> (gsi_stmt (gsi
));
922 target
= gimple_label_label (label_stmt
);
924 /* Make an edge to every label block that has been marked as a
925 potential target for a computed goto or a non-local goto. */
926 if (FORCED_LABEL (target
))
927 handle_abnormal_edges (dispatcher_bbs
, bb
, bb_to_omp_idx
,
928 &ab_edge_goto
, true);
929 if (DECL_NONLOCAL (target
))
931 handle_abnormal_edges (dispatcher_bbs
, bb
, bb_to_omp_idx
,
932 &ab_edge_call
, false);
937 if (!gsi_end_p (gsi
) && is_gimple_debug (gsi_stmt (gsi
)))
938 gsi_next_nondebug (&gsi
);
939 if (!gsi_end_p (gsi
))
941 /* Make an edge to every setjmp-like call. */
942 gimple call_stmt
= gsi_stmt (gsi
);
943 if (is_gimple_call (call_stmt
)
944 && ((gimple_call_flags (call_stmt
) & ECF_RETURNS_TWICE
)
945 || gimple_call_builtin_p (call_stmt
,
946 BUILT_IN_SETJMP_RECEIVER
)))
947 handle_abnormal_edges (dispatcher_bbs
, bb
, bb_to_omp_idx
,
948 &ab_edge_call
, false);
953 XDELETE (dispatcher_bbs
);
956 XDELETE (bb_to_omp_idx
);
960 /* Fold COND_EXPR_COND of each COND_EXPR. */
961 fold_cond_expr_cond ();
964 /* Find the next available discriminator value for LOCUS. The
965 discriminator distinguishes among several basic blocks that
966 share a common locus, allowing for more accurate sample-based
970 next_discriminator_for_locus (location_t locus
)
972 struct locus_discrim_map item
;
973 struct locus_discrim_map
**slot
;
976 item
.discriminator
= 0;
977 slot
= discriminator_per_locus
->find_slot_with_hash (
978 &item
, LOCATION_LINE (locus
), INSERT
);
980 if (*slot
== HTAB_EMPTY_ENTRY
)
982 *slot
= XNEW (struct locus_discrim_map
);
984 (*slot
)->locus
= locus
;
985 (*slot
)->discriminator
= 0;
987 (*slot
)->discriminator
++;
988 return (*slot
)->discriminator
;
991 /* Return TRUE if LOCUS1 and LOCUS2 refer to the same source line. */
994 same_line_p (location_t locus1
, location_t locus2
)
996 expanded_location from
, to
;
998 if (locus1
== locus2
)
1001 from
= expand_location (locus1
);
1002 to
= expand_location (locus2
);
1004 if (from
.line
!= to
.line
)
1006 if (from
.file
== to
.file
)
1008 return (from
.file
!= NULL
1010 && filename_cmp (from
.file
, to
.file
) == 0);
1013 /* Assign discriminators to each basic block. */
1016 assign_discriminators (void)
1020 FOR_EACH_BB_FN (bb
, cfun
)
1024 gimple last
= last_stmt (bb
);
1025 location_t locus
= last
? gimple_location (last
) : UNKNOWN_LOCATION
;
1027 if (locus
== UNKNOWN_LOCATION
)
1030 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
1032 gimple first
= first_non_label_stmt (e
->dest
);
1033 gimple last
= last_stmt (e
->dest
);
1034 if ((first
&& same_line_p (locus
, gimple_location (first
)))
1035 || (last
&& same_line_p (locus
, gimple_location (last
))))
1037 if (e
->dest
->discriminator
!= 0 && bb
->discriminator
== 0)
1038 bb
->discriminator
= next_discriminator_for_locus (locus
);
1040 e
->dest
->discriminator
= next_discriminator_for_locus (locus
);
1046 /* Create the edges for a GIMPLE_COND starting at block BB. */
1049 make_cond_expr_edges (basic_block bb
)
1051 gcond
*entry
= as_a
<gcond
*> (last_stmt (bb
));
1052 gimple then_stmt
, else_stmt
;
1053 basic_block then_bb
, else_bb
;
1054 tree then_label
, else_label
;
1058 gcc_assert (gimple_code (entry
) == GIMPLE_COND
);
1060 /* Entry basic blocks for each component. */
1061 then_label
= gimple_cond_true_label (entry
);
1062 else_label
= gimple_cond_false_label (entry
);
1063 then_bb
= label_to_block (then_label
);
1064 else_bb
= label_to_block (else_label
);
1065 then_stmt
= first_stmt (then_bb
);
1066 else_stmt
= first_stmt (else_bb
);
1068 e
= make_edge (bb
, then_bb
, EDGE_TRUE_VALUE
);
1069 e
->goto_locus
= gimple_location (then_stmt
);
1070 e
= make_edge (bb
, else_bb
, EDGE_FALSE_VALUE
);
1072 e
->goto_locus
= gimple_location (else_stmt
);
1074 /* We do not need the labels anymore. */
1075 gimple_cond_set_true_label (entry
, NULL_TREE
);
1076 gimple_cond_set_false_label (entry
, NULL_TREE
);
1080 /* Called for each element in the hash table (P) as we delete the
1081 edge to cases hash table.
1083 Clear all the TREE_CHAINs to prevent problems with copying of
1084 SWITCH_EXPRs and structure sharing rules, then free the hash table
1088 edge_to_cases_cleanup (edge
const &, tree
const &value
, void *)
1092 for (t
= value
; t
; t
= next
)
1094 next
= CASE_CHAIN (t
);
1095 CASE_CHAIN (t
) = NULL
;
1101 /* Start recording information mapping edges to case labels. */
1104 start_recording_case_labels (void)
1106 gcc_assert (edge_to_cases
== NULL
);
1107 edge_to_cases
= new hash_map
<edge
, tree
>;
1108 touched_switch_bbs
= BITMAP_ALLOC (NULL
);
1111 /* Return nonzero if we are recording information for case labels. */
1114 recording_case_labels_p (void)
1116 return (edge_to_cases
!= NULL
);
1119 /* Stop recording information mapping edges to case labels and
1120 remove any information we have recorded. */
1122 end_recording_case_labels (void)
1126 edge_to_cases
->traverse
<void *, edge_to_cases_cleanup
> (NULL
);
1127 delete edge_to_cases
;
1128 edge_to_cases
= NULL
;
1129 EXECUTE_IF_SET_IN_BITMAP (touched_switch_bbs
, 0, i
, bi
)
1131 basic_block bb
= BASIC_BLOCK_FOR_FN (cfun
, i
);
1134 gimple stmt
= last_stmt (bb
);
1135 if (stmt
&& gimple_code (stmt
) == GIMPLE_SWITCH
)
1136 group_case_labels_stmt (as_a
<gswitch
*> (stmt
));
1139 BITMAP_FREE (touched_switch_bbs
);
1142 /* If we are inside a {start,end}_recording_cases block, then return
1143 a chain of CASE_LABEL_EXPRs from T which reference E.
1145 Otherwise return NULL. */
1148 get_cases_for_edge (edge e
, gswitch
*t
)
1153 /* If we are not recording cases, then we do not have CASE_LABEL_EXPR
1154 chains available. Return NULL so the caller can detect this case. */
1155 if (!recording_case_labels_p ())
1158 slot
= edge_to_cases
->get (e
);
1162 /* If we did not find E in the hash table, then this must be the first
1163 time we have been queried for information about E & T. Add all the
1164 elements from T to the hash table then perform the query again. */
1166 n
= gimple_switch_num_labels (t
);
1167 for (i
= 0; i
< n
; i
++)
1169 tree elt
= gimple_switch_label (t
, i
);
1170 tree lab
= CASE_LABEL (elt
);
1171 basic_block label_bb
= label_to_block (lab
);
1172 edge this_edge
= find_edge (e
->src
, label_bb
);
1174 /* Add it to the chain of CASE_LABEL_EXPRs referencing E, or create
1176 tree
&s
= edge_to_cases
->get_or_insert (this_edge
);
1177 CASE_CHAIN (elt
) = s
;
1181 return *edge_to_cases
->get (e
);
1184 /* Create the edges for a GIMPLE_SWITCH starting at block BB. */
1187 make_gimple_switch_edges (gswitch
*entry
, basic_block bb
)
1191 n
= gimple_switch_num_labels (entry
);
1193 for (i
= 0; i
< n
; ++i
)
1195 tree lab
= CASE_LABEL (gimple_switch_label (entry
, i
));
1196 basic_block label_bb
= label_to_block (lab
);
1197 make_edge (bb
, label_bb
, 0);
1202 /* Return the basic block holding label DEST. */
1205 label_to_block_fn (struct function
*ifun
, tree dest
)
1207 int uid
= LABEL_DECL_UID (dest
);
1209 /* We would die hard when faced by an undefined label. Emit a label to
1210 the very first basic block. This will hopefully make even the dataflow
1211 and undefined variable warnings quite right. */
1212 if (seen_error () && uid
< 0)
1214 gimple_stmt_iterator gsi
=
1215 gsi_start_bb (BASIC_BLOCK_FOR_FN (cfun
, NUM_FIXED_BLOCKS
));
1218 stmt
= gimple_build_label (dest
);
1219 gsi_insert_before (&gsi
, stmt
, GSI_NEW_STMT
);
1220 uid
= LABEL_DECL_UID (dest
);
1222 if (vec_safe_length (ifun
->cfg
->x_label_to_block_map
) <= (unsigned int) uid
)
1224 return (*ifun
->cfg
->x_label_to_block_map
)[uid
];
1227 /* Create edges for a goto statement at block BB. Returns true
1228 if abnormal edges should be created. */
1231 make_goto_expr_edges (basic_block bb
)
1233 gimple_stmt_iterator last
= gsi_last_bb (bb
);
1234 gimple goto_t
= gsi_stmt (last
);
1236 /* A simple GOTO creates normal edges. */
1237 if (simple_goto_p (goto_t
))
1239 tree dest
= gimple_goto_dest (goto_t
);
1240 basic_block label_bb
= label_to_block (dest
);
1241 edge e
= make_edge (bb
, label_bb
, EDGE_FALLTHRU
);
1242 e
->goto_locus
= gimple_location (goto_t
);
1243 gsi_remove (&last
, true);
1247 /* A computed GOTO creates abnormal edges. */
1251 /* Create edges for an asm statement with labels at block BB. */
1254 make_gimple_asm_edges (basic_block bb
)
1256 gasm
*stmt
= as_a
<gasm
*> (last_stmt (bb
));
1257 int i
, n
= gimple_asm_nlabels (stmt
);
1259 for (i
= 0; i
< n
; ++i
)
1261 tree label
= TREE_VALUE (gimple_asm_label_op (stmt
, i
));
1262 basic_block label_bb
= label_to_block (label
);
1263 make_edge (bb
, label_bb
, 0);
1267 /*---------------------------------------------------------------------------
1269 ---------------------------------------------------------------------------*/
1271 /* Cleanup useless labels in basic blocks. This is something we wish
1272 to do early because it allows us to group case labels before creating
1273 the edges for the CFG, and it speeds up block statement iterators in
1274 all passes later on.
1275 We rerun this pass after CFG is created, to get rid of the labels that
1276 are no longer referenced. After then we do not run it any more, since
1277 (almost) no new labels should be created. */
1279 /* A map from basic block index to the leading label of that block. */
1280 static struct label_record
1285 /* True if the label is referenced from somewhere. */
1289 /* Given LABEL return the first label in the same basic block. */
1292 main_block_label (tree label
)
1294 basic_block bb
= label_to_block (label
);
1295 tree main_label
= label_for_bb
[bb
->index
].label
;
1297 /* label_to_block possibly inserted undefined label into the chain. */
1300 label_for_bb
[bb
->index
].label
= label
;
1304 label_for_bb
[bb
->index
].used
= true;
1308 /* Clean up redundant labels within the exception tree. */
1311 cleanup_dead_labels_eh (void)
1318 if (cfun
->eh
== NULL
)
1321 for (i
= 1; vec_safe_iterate (cfun
->eh
->lp_array
, i
, &lp
); ++i
)
1322 if (lp
&& lp
->post_landing_pad
)
1324 lab
= main_block_label (lp
->post_landing_pad
);
1325 if (lab
!= lp
->post_landing_pad
)
1327 EH_LANDING_PAD_NR (lp
->post_landing_pad
) = 0;
1328 EH_LANDING_PAD_NR (lab
) = lp
->index
;
1332 FOR_ALL_EH_REGION (r
)
1336 case ERT_MUST_NOT_THROW
:
1342 for (c
= r
->u
.eh_try
.first_catch
; c
; c
= c
->next_catch
)
1346 c
->label
= main_block_label (lab
);
1351 case ERT_ALLOWED_EXCEPTIONS
:
1352 lab
= r
->u
.allowed
.label
;
1354 r
->u
.allowed
.label
= main_block_label (lab
);
1360 /* Cleanup redundant labels. This is a three-step process:
1361 1) Find the leading label for each block.
1362 2) Redirect all references to labels to the leading labels.
1363 3) Cleanup all useless labels. */
1366 cleanup_dead_labels (void)
1369 label_for_bb
= XCNEWVEC (struct label_record
, last_basic_block_for_fn (cfun
));
1371 /* Find a suitable label for each block. We use the first user-defined
1372 label if there is one, or otherwise just the first label we see. */
1373 FOR_EACH_BB_FN (bb
, cfun
)
1375 gimple_stmt_iterator i
;
1377 for (i
= gsi_start_bb (bb
); !gsi_end_p (i
); gsi_next (&i
))
1380 glabel
*label_stmt
= dyn_cast
<glabel
*> (gsi_stmt (i
));
1385 label
= gimple_label_label (label_stmt
);
1387 /* If we have not yet seen a label for the current block,
1388 remember this one and see if there are more labels. */
1389 if (!label_for_bb
[bb
->index
].label
)
1391 label_for_bb
[bb
->index
].label
= label
;
1395 /* If we did see a label for the current block already, but it
1396 is an artificially created label, replace it if the current
1397 label is a user defined label. */
1398 if (!DECL_ARTIFICIAL (label
)
1399 && DECL_ARTIFICIAL (label_for_bb
[bb
->index
].label
))
1401 label_for_bb
[bb
->index
].label
= label
;
1407 /* Now redirect all jumps/branches to the selected label.
1408 First do so for each block ending in a control statement. */
1409 FOR_EACH_BB_FN (bb
, cfun
)
1411 gimple stmt
= last_stmt (bb
);
1412 tree label
, new_label
;
1417 switch (gimple_code (stmt
))
1421 gcond
*cond_stmt
= as_a
<gcond
*> (stmt
);
1422 label
= gimple_cond_true_label (cond_stmt
);
1425 new_label
= main_block_label (label
);
1426 if (new_label
!= label
)
1427 gimple_cond_set_true_label (cond_stmt
, new_label
);
1430 label
= gimple_cond_false_label (cond_stmt
);
1433 new_label
= main_block_label (label
);
1434 if (new_label
!= label
)
1435 gimple_cond_set_false_label (cond_stmt
, new_label
);
1442 gswitch
*switch_stmt
= as_a
<gswitch
*> (stmt
);
1443 size_t i
, n
= gimple_switch_num_labels (switch_stmt
);
1445 /* Replace all destination labels. */
1446 for (i
= 0; i
< n
; ++i
)
1448 tree case_label
= gimple_switch_label (switch_stmt
, i
);
1449 label
= CASE_LABEL (case_label
);
1450 new_label
= main_block_label (label
);
1451 if (new_label
!= label
)
1452 CASE_LABEL (case_label
) = new_label
;
1459 gasm
*asm_stmt
= as_a
<gasm
*> (stmt
);
1460 int i
, n
= gimple_asm_nlabels (asm_stmt
);
1462 for (i
= 0; i
< n
; ++i
)
1464 tree cons
= gimple_asm_label_op (asm_stmt
, i
);
1465 tree label
= main_block_label (TREE_VALUE (cons
));
1466 TREE_VALUE (cons
) = label
;
1471 /* We have to handle gotos until they're removed, and we don't
1472 remove them until after we've created the CFG edges. */
1474 if (!computed_goto_p (stmt
))
1476 ggoto
*goto_stmt
= as_a
<ggoto
*> (stmt
);
1477 label
= gimple_goto_dest (goto_stmt
);
1478 new_label
= main_block_label (label
);
1479 if (new_label
!= label
)
1480 gimple_goto_set_dest (goto_stmt
, new_label
);
1484 case GIMPLE_TRANSACTION
:
1486 gtransaction
*trans_stmt
= as_a
<gtransaction
*> (stmt
);
1487 tree label
= gimple_transaction_label (trans_stmt
);
1490 tree new_label
= main_block_label (label
);
1491 if (new_label
!= label
)
1492 gimple_transaction_set_label (trans_stmt
, new_label
);
1502 /* Do the same for the exception region tree labels. */
1503 cleanup_dead_labels_eh ();
1505 /* Finally, purge dead labels. All user-defined labels and labels that
1506 can be the target of non-local gotos and labels which have their
1507 address taken are preserved. */
1508 FOR_EACH_BB_FN (bb
, cfun
)
1510 gimple_stmt_iterator i
;
1511 tree label_for_this_bb
= label_for_bb
[bb
->index
].label
;
1513 if (!label_for_this_bb
)
1516 /* If the main label of the block is unused, we may still remove it. */
1517 if (!label_for_bb
[bb
->index
].used
)
1518 label_for_this_bb
= NULL
;
1520 for (i
= gsi_start_bb (bb
); !gsi_end_p (i
); )
1523 glabel
*label_stmt
= dyn_cast
<glabel
*> (gsi_stmt (i
));
1528 label
= gimple_label_label (label_stmt
);
1530 if (label
== label_for_this_bb
1531 || !DECL_ARTIFICIAL (label
)
1532 || DECL_NONLOCAL (label
)
1533 || FORCED_LABEL (label
))
1536 gsi_remove (&i
, true);
1540 free (label_for_bb
);
1543 /* Scan the sorted vector of cases in STMT (a GIMPLE_SWITCH) and combine
1544 the ones jumping to the same label.
1545 Eg. three separate entries 1: 2: 3: become one entry 1..3: */
1548 group_case_labels_stmt (gswitch
*stmt
)
1550 int old_size
= gimple_switch_num_labels (stmt
);
1551 int i
, j
, new_size
= old_size
;
1552 basic_block default_bb
= NULL
;
1554 default_bb
= label_to_block (CASE_LABEL (gimple_switch_default_label (stmt
)));
1556 /* Look for possible opportunities to merge cases. */
1558 while (i
< old_size
)
1560 tree base_case
, base_high
;
1561 basic_block base_bb
;
1563 base_case
= gimple_switch_label (stmt
, i
);
1565 gcc_assert (base_case
);
1566 base_bb
= label_to_block (CASE_LABEL (base_case
));
1568 /* Discard cases that have the same destination as the
1570 if (base_bb
== default_bb
)
1572 gimple_switch_set_label (stmt
, i
, NULL_TREE
);
1578 base_high
= CASE_HIGH (base_case
)
1579 ? CASE_HIGH (base_case
)
1580 : CASE_LOW (base_case
);
1583 /* Try to merge case labels. Break out when we reach the end
1584 of the label vector or when we cannot merge the next case
1585 label with the current one. */
1586 while (i
< old_size
)
1588 tree merge_case
= gimple_switch_label (stmt
, i
);
1589 basic_block merge_bb
= label_to_block (CASE_LABEL (merge_case
));
1590 wide_int bhp1
= wi::add (base_high
, 1);
1592 /* Merge the cases if they jump to the same place,
1593 and their ranges are consecutive. */
1594 if (merge_bb
== base_bb
1595 && wi::eq_p (CASE_LOW (merge_case
), bhp1
))
1597 base_high
= CASE_HIGH (merge_case
) ?
1598 CASE_HIGH (merge_case
) : CASE_LOW (merge_case
);
1599 CASE_HIGH (base_case
) = base_high
;
1600 gimple_switch_set_label (stmt
, i
, NULL_TREE
);
1609 /* Compress the case labels in the label vector, and adjust the
1610 length of the vector. */
1611 for (i
= 0, j
= 0; i
< new_size
; i
++)
1613 while (! gimple_switch_label (stmt
, j
))
1615 gimple_switch_set_label (stmt
, i
,
1616 gimple_switch_label (stmt
, j
++));
1619 gcc_assert (new_size
<= old_size
);
1620 gimple_switch_set_num_labels (stmt
, new_size
);
1623 /* Look for blocks ending in a multiway branch (a GIMPLE_SWITCH),
1624 and scan the sorted vector of cases. Combine the ones jumping to the
1628 group_case_labels (void)
1632 FOR_EACH_BB_FN (bb
, cfun
)
1634 gimple stmt
= last_stmt (bb
);
1635 if (stmt
&& gimple_code (stmt
) == GIMPLE_SWITCH
)
1636 group_case_labels_stmt (as_a
<gswitch
*> (stmt
));
1640 /* Checks whether we can merge block B into block A. */
1643 gimple_can_merge_blocks_p (basic_block a
, basic_block b
)
1647 if (!single_succ_p (a
))
1650 if (single_succ_edge (a
)->flags
& EDGE_COMPLEX
)
1653 if (single_succ (a
) != b
)
1656 if (!single_pred_p (b
))
1659 if (b
== EXIT_BLOCK_PTR_FOR_FN (cfun
))
1662 /* If A ends by a statement causing exceptions or something similar, we
1663 cannot merge the blocks. */
1664 stmt
= last_stmt (a
);
1665 if (stmt
&& stmt_ends_bb_p (stmt
))
1668 /* Do not allow a block with only a non-local label to be merged. */
1670 if (glabel
*label_stmt
= dyn_cast
<glabel
*> (stmt
))
1671 if (DECL_NONLOCAL (gimple_label_label (label_stmt
)))
1674 /* Examine the labels at the beginning of B. */
1675 for (gimple_stmt_iterator gsi
= gsi_start_bb (b
); !gsi_end_p (gsi
);
1679 glabel
*label_stmt
= dyn_cast
<glabel
*> (gsi_stmt (gsi
));
1682 lab
= gimple_label_label (label_stmt
);
1684 /* Do not remove user forced labels or for -O0 any user labels. */
1685 if (!DECL_ARTIFICIAL (lab
) && (!optimize
|| FORCED_LABEL (lab
)))
1689 /* Protect the loop latches. */
1690 if (current_loops
&& b
->loop_father
->latch
== b
)
1693 /* It must be possible to eliminate all phi nodes in B. If ssa form
1694 is not up-to-date and a name-mapping is registered, we cannot eliminate
1695 any phis. Symbols marked for renaming are never a problem though. */
1696 for (gphi_iterator gsi
= gsi_start_phis (b
); !gsi_end_p (gsi
);
1699 gphi
*phi
= gsi
.phi ();
1700 /* Technically only new names matter. */
1701 if (name_registered_for_update_p (PHI_RESULT (phi
)))
1705 /* When not optimizing, don't merge if we'd lose goto_locus. */
1707 && single_succ_edge (a
)->goto_locus
!= UNKNOWN_LOCATION
)
1709 location_t goto_locus
= single_succ_edge (a
)->goto_locus
;
1710 gimple_stmt_iterator prev
, next
;
1711 prev
= gsi_last_nondebug_bb (a
);
1712 next
= gsi_after_labels (b
);
1713 if (!gsi_end_p (next
) && is_gimple_debug (gsi_stmt (next
)))
1714 gsi_next_nondebug (&next
);
1715 if ((gsi_end_p (prev
)
1716 || gimple_location (gsi_stmt (prev
)) != goto_locus
)
1717 && (gsi_end_p (next
)
1718 || gimple_location (gsi_stmt (next
)) != goto_locus
))
1725 /* Replaces all uses of NAME by VAL. */
1728 replace_uses_by (tree name
, tree val
)
1730 imm_use_iterator imm_iter
;
1735 FOR_EACH_IMM_USE_STMT (stmt
, imm_iter
, name
)
1737 /* Mark the block if we change the last stmt in it. */
1738 if (cfgcleanup_altered_bbs
1739 && stmt_ends_bb_p (stmt
))
1740 bitmap_set_bit (cfgcleanup_altered_bbs
, gimple_bb (stmt
)->index
);
1742 FOR_EACH_IMM_USE_ON_STMT (use
, imm_iter
)
1744 replace_exp (use
, val
);
1746 if (gimple_code (stmt
) == GIMPLE_PHI
)
1748 e
= gimple_phi_arg_edge (as_a
<gphi
*> (stmt
),
1749 PHI_ARG_INDEX_FROM_USE (use
));
1750 if (e
->flags
& EDGE_ABNORMAL
)
1752 /* This can only occur for virtual operands, since
1753 for the real ones SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name))
1754 would prevent replacement. */
1755 gcc_checking_assert (virtual_operand_p (name
));
1756 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (val
) = 1;
1761 if (gimple_code (stmt
) != GIMPLE_PHI
)
1763 gimple_stmt_iterator gsi
= gsi_for_stmt (stmt
);
1764 gimple orig_stmt
= stmt
;
1767 /* FIXME. It shouldn't be required to keep TREE_CONSTANT
1768 on ADDR_EXPRs up-to-date on GIMPLE. Propagation will
1769 only change sth from non-invariant to invariant, and only
1770 when propagating constants. */
1771 if (is_gimple_min_invariant (val
))
1772 for (i
= 0; i
< gimple_num_ops (stmt
); i
++)
1774 tree op
= gimple_op (stmt
, i
);
1775 /* Operands may be empty here. For example, the labels
1776 of a GIMPLE_COND are nulled out following the creation
1777 of the corresponding CFG edges. */
1778 if (op
&& TREE_CODE (op
) == ADDR_EXPR
)
1779 recompute_tree_invariant_for_addr_expr (op
);
1782 if (fold_stmt (&gsi
))
1783 stmt
= gsi_stmt (gsi
);
1785 if (maybe_clean_or_replace_eh_stmt (orig_stmt
, stmt
))
1786 gimple_purge_dead_eh_edges (gimple_bb (stmt
));
1792 gcc_checking_assert (has_zero_uses (name
));
1794 /* Also update the trees stored in loop structures. */
1799 FOR_EACH_LOOP (loop
, 0)
1801 substitute_in_loop_info (loop
, name
, val
);
1806 /* Merge block B into block A. */
1809 gimple_merge_blocks (basic_block a
, basic_block b
)
1811 gimple_stmt_iterator last
, gsi
;
1815 fprintf (dump_file
, "Merging blocks %d and %d\n", a
->index
, b
->index
);
1817 /* Remove all single-valued PHI nodes from block B of the form
1818 V_i = PHI <V_j> by propagating V_j to all the uses of V_i. */
1819 gsi
= gsi_last_bb (a
);
1820 for (psi
= gsi_start_phis (b
); !gsi_end_p (psi
); )
1822 gimple phi
= gsi_stmt (psi
);
1823 tree def
= gimple_phi_result (phi
), use
= gimple_phi_arg_def (phi
, 0);
1825 bool may_replace_uses
= (virtual_operand_p (def
)
1826 || may_propagate_copy (def
, use
));
1828 /* In case we maintain loop closed ssa form, do not propagate arguments
1829 of loop exit phi nodes. */
1831 && loops_state_satisfies_p (LOOP_CLOSED_SSA
)
1832 && !virtual_operand_p (def
)
1833 && TREE_CODE (use
) == SSA_NAME
1834 && a
->loop_father
!= b
->loop_father
)
1835 may_replace_uses
= false;
1837 if (!may_replace_uses
)
1839 gcc_assert (!virtual_operand_p (def
));
1841 /* Note that just emitting the copies is fine -- there is no problem
1842 with ordering of phi nodes. This is because A is the single
1843 predecessor of B, therefore results of the phi nodes cannot
1844 appear as arguments of the phi nodes. */
1845 copy
= gimple_build_assign (def
, use
);
1846 gsi_insert_after (&gsi
, copy
, GSI_NEW_STMT
);
1847 remove_phi_node (&psi
, false);
1851 /* If we deal with a PHI for virtual operands, we can simply
1852 propagate these without fussing with folding or updating
1854 if (virtual_operand_p (def
))
1856 imm_use_iterator iter
;
1857 use_operand_p use_p
;
1860 FOR_EACH_IMM_USE_STMT (stmt
, iter
, def
)
1861 FOR_EACH_IMM_USE_ON_STMT (use_p
, iter
)
1862 SET_USE (use_p
, use
);
1864 if (SSA_NAME_OCCURS_IN_ABNORMAL_PHI (def
))
1865 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (use
) = 1;
1868 replace_uses_by (def
, use
);
1870 remove_phi_node (&psi
, true);
1874 /* Ensure that B follows A. */
1875 move_block_after (b
, a
);
1877 gcc_assert (single_succ_edge (a
)->flags
& EDGE_FALLTHRU
);
1878 gcc_assert (!last_stmt (a
) || !stmt_ends_bb_p (last_stmt (a
)));
1880 /* Remove labels from B and set gimple_bb to A for other statements. */
1881 for (gsi
= gsi_start_bb (b
); !gsi_end_p (gsi
);)
1883 gimple stmt
= gsi_stmt (gsi
);
1884 if (glabel
*label_stmt
= dyn_cast
<glabel
*> (stmt
))
1886 tree label
= gimple_label_label (label_stmt
);
1889 gsi_remove (&gsi
, false);
1891 /* Now that we can thread computed gotos, we might have
1892 a situation where we have a forced label in block B
1893 However, the label at the start of block B might still be
1894 used in other ways (think about the runtime checking for
1895 Fortran assigned gotos). So we can not just delete the
1896 label. Instead we move the label to the start of block A. */
1897 if (FORCED_LABEL (label
))
1899 gimple_stmt_iterator dest_gsi
= gsi_start_bb (a
);
1900 gsi_insert_before (&dest_gsi
, stmt
, GSI_NEW_STMT
);
1902 /* Other user labels keep around in a form of a debug stmt. */
1903 else if (!DECL_ARTIFICIAL (label
) && MAY_HAVE_DEBUG_STMTS
)
1905 gimple dbg
= gimple_build_debug_bind (label
,
1908 gimple_debug_bind_reset_value (dbg
);
1909 gsi_insert_before (&gsi
, dbg
, GSI_SAME_STMT
);
1912 lp_nr
= EH_LANDING_PAD_NR (label
);
1915 eh_landing_pad lp
= get_eh_landing_pad_from_number (lp_nr
);
1916 lp
->post_landing_pad
= NULL
;
1921 gimple_set_bb (stmt
, a
);
1926 /* When merging two BBs, if their counts are different, the larger count
1927 is selected as the new bb count. This is to handle inconsistent
1929 if (a
->loop_father
== b
->loop_father
)
1931 a
->count
= MAX (a
->count
, b
->count
);
1932 a
->frequency
= MAX (a
->frequency
, b
->frequency
);
1935 /* Merge the sequences. */
1936 last
= gsi_last_bb (a
);
1937 gsi_insert_seq_after (&last
, bb_seq (b
), GSI_NEW_STMT
);
1938 set_bb_seq (b
, NULL
);
1940 if (cfgcleanup_altered_bbs
)
1941 bitmap_set_bit (cfgcleanup_altered_bbs
, a
->index
);
1945 /* Return the one of two successors of BB that is not reachable by a
1946 complex edge, if there is one. Else, return BB. We use
1947 this in optimizations that use post-dominators for their heuristics,
1948 to catch the cases in C++ where function calls are involved. */
1951 single_noncomplex_succ (basic_block bb
)
1954 if (EDGE_COUNT (bb
->succs
) != 2)
1957 e0
= EDGE_SUCC (bb
, 0);
1958 e1
= EDGE_SUCC (bb
, 1);
1959 if (e0
->flags
& EDGE_COMPLEX
)
1961 if (e1
->flags
& EDGE_COMPLEX
)
1967 /* T is CALL_EXPR. Set current_function_calls_* flags. */
1970 notice_special_calls (gcall
*call
)
1972 int flags
= gimple_call_flags (call
);
1974 if (flags
& ECF_MAY_BE_ALLOCA
)
1975 cfun
->calls_alloca
= true;
1976 if (flags
& ECF_RETURNS_TWICE
)
1977 cfun
->calls_setjmp
= true;
1981 /* Clear flags set by notice_special_calls. Used by dead code removal
1982 to update the flags. */
1985 clear_special_calls (void)
1987 cfun
->calls_alloca
= false;
1988 cfun
->calls_setjmp
= false;
1991 /* Remove PHI nodes associated with basic block BB and all edges out of BB. */
1994 remove_phi_nodes_and_edges_for_unreachable_block (basic_block bb
)
1996 /* Since this block is no longer reachable, we can just delete all
1997 of its PHI nodes. */
1998 remove_phi_nodes (bb
);
2000 /* Remove edges to BB's successors. */
2001 while (EDGE_COUNT (bb
->succs
) > 0)
2002 remove_edge (EDGE_SUCC (bb
, 0));
2006 /* Remove statements of basic block BB. */
2009 remove_bb (basic_block bb
)
2011 gimple_stmt_iterator i
;
2015 fprintf (dump_file
, "Removing basic block %d\n", bb
->index
);
2016 if (dump_flags
& TDF_DETAILS
)
2018 dump_bb (dump_file
, bb
, 0, TDF_BLOCKS
);
2019 fprintf (dump_file
, "\n");
2025 struct loop
*loop
= bb
->loop_father
;
2027 /* If a loop gets removed, clean up the information associated
2029 if (loop
->latch
== bb
2030 || loop
->header
== bb
)
2031 free_numbers_of_iterations_estimates_loop (loop
);
2034 /* Remove all the instructions in the block. */
2035 if (bb_seq (bb
) != NULL
)
2037 /* Walk backwards so as to get a chance to substitute all
2038 released DEFs into debug stmts. See
2039 eliminate_unnecessary_stmts() in tree-ssa-dce.c for more
2041 for (i
= gsi_last_bb (bb
); !gsi_end_p (i
);)
2043 gimple stmt
= gsi_stmt (i
);
2044 glabel
*label_stmt
= dyn_cast
<glabel
*> (stmt
);
2046 && (FORCED_LABEL (gimple_label_label (label_stmt
))
2047 || DECL_NONLOCAL (gimple_label_label (label_stmt
))))
2050 gimple_stmt_iterator new_gsi
;
2052 /* A non-reachable non-local label may still be referenced.
2053 But it no longer needs to carry the extra semantics of
2055 if (DECL_NONLOCAL (gimple_label_label (label_stmt
)))
2057 DECL_NONLOCAL (gimple_label_label (label_stmt
)) = 0;
2058 FORCED_LABEL (gimple_label_label (label_stmt
)) = 1;
2061 new_bb
= bb
->prev_bb
;
2062 new_gsi
= gsi_start_bb (new_bb
);
2063 gsi_remove (&i
, false);
2064 gsi_insert_before (&new_gsi
, stmt
, GSI_NEW_STMT
);
2068 /* Release SSA definitions if we are in SSA. Note that we
2069 may be called when not in SSA. For example,
2070 final_cleanup calls this function via
2071 cleanup_tree_cfg. */
2072 if (gimple_in_ssa_p (cfun
))
2073 release_defs (stmt
);
2075 gsi_remove (&i
, true);
2079 i
= gsi_last_bb (bb
);
2085 remove_phi_nodes_and_edges_for_unreachable_block (bb
);
2086 bb
->il
.gimple
.seq
= NULL
;
2087 bb
->il
.gimple
.phi_nodes
= NULL
;
2091 /* Given a basic block BB ending with COND_EXPR or SWITCH_EXPR, and a
2092 predicate VAL, return the edge that will be taken out of the block.
2093 If VAL does not match a unique edge, NULL is returned. */
2096 find_taken_edge (basic_block bb
, tree val
)
2100 stmt
= last_stmt (bb
);
2103 gcc_assert (is_ctrl_stmt (stmt
));
2108 if (!is_gimple_min_invariant (val
))
2111 if (gimple_code (stmt
) == GIMPLE_COND
)
2112 return find_taken_edge_cond_expr (bb
, val
);
2114 if (gimple_code (stmt
) == GIMPLE_SWITCH
)
2115 return find_taken_edge_switch_expr (as_a
<gswitch
*> (stmt
), bb
, val
);
2117 if (computed_goto_p (stmt
))
2119 /* Only optimize if the argument is a label, if the argument is
2120 not a label then we can not construct a proper CFG.
2122 It may be the case that we only need to allow the LABEL_REF to
2123 appear inside an ADDR_EXPR, but we also allow the LABEL_REF to
2124 appear inside a LABEL_EXPR just to be safe. */
2125 if ((TREE_CODE (val
) == ADDR_EXPR
|| TREE_CODE (val
) == LABEL_EXPR
)
2126 && TREE_CODE (TREE_OPERAND (val
, 0)) == LABEL_DECL
)
2127 return find_taken_edge_computed_goto (bb
, TREE_OPERAND (val
, 0));
2134 /* Given a constant value VAL and the entry block BB to a GOTO_EXPR
2135 statement, determine which of the outgoing edges will be taken out of the
2136 block. Return NULL if either edge may be taken. */
2139 find_taken_edge_computed_goto (basic_block bb
, tree val
)
2144 dest
= label_to_block (val
);
2147 e
= find_edge (bb
, dest
);
2148 gcc_assert (e
!= NULL
);
2154 /* Given a constant value VAL and the entry block BB to a COND_EXPR
2155 statement, determine which of the two edges will be taken out of the
2156 block. Return NULL if either edge may be taken. */
2159 find_taken_edge_cond_expr (basic_block bb
, tree val
)
2161 edge true_edge
, false_edge
;
2163 extract_true_false_edges_from_block (bb
, &true_edge
, &false_edge
);
2165 gcc_assert (TREE_CODE (val
) == INTEGER_CST
);
2166 return (integer_zerop (val
) ? false_edge
: true_edge
);
2169 /* Given an INTEGER_CST VAL and the entry block BB to a SWITCH_EXPR
2170 statement, determine which edge will be taken out of the block. Return
2171 NULL if any edge may be taken. */
2174 find_taken_edge_switch_expr (gswitch
*switch_stmt
, basic_block bb
,
2177 basic_block dest_bb
;
2181 taken_case
= find_case_label_for_value (switch_stmt
, val
);
2182 dest_bb
= label_to_block (CASE_LABEL (taken_case
));
2184 e
= find_edge (bb
, dest_bb
);
2190 /* Return the CASE_LABEL_EXPR that SWITCH_STMT will take for VAL.
2191 We can make optimal use here of the fact that the case labels are
2192 sorted: We can do a binary search for a case matching VAL. */
2195 find_case_label_for_value (gswitch
*switch_stmt
, tree val
)
2197 size_t low
, high
, n
= gimple_switch_num_labels (switch_stmt
);
2198 tree default_case
= gimple_switch_default_label (switch_stmt
);
2200 for (low
= 0, high
= n
; high
- low
> 1; )
2202 size_t i
= (high
+ low
) / 2;
2203 tree t
= gimple_switch_label (switch_stmt
, i
);
2206 /* Cache the result of comparing CASE_LOW and val. */
2207 cmp
= tree_int_cst_compare (CASE_LOW (t
), val
);
2214 if (CASE_HIGH (t
) == NULL
)
2216 /* A singe-valued case label. */
2222 /* A case range. We can only handle integer ranges. */
2223 if (cmp
<= 0 && tree_int_cst_compare (CASE_HIGH (t
), val
) >= 0)
2228 return default_case
;
2232 /* Dump a basic block on stderr. */
2235 gimple_debug_bb (basic_block bb
)
2237 dump_bb (stderr
, bb
, 0, TDF_VOPS
|TDF_MEMSYMS
|TDF_BLOCKS
);
2241 /* Dump basic block with index N on stderr. */
2244 gimple_debug_bb_n (int n
)
2246 gimple_debug_bb (BASIC_BLOCK_FOR_FN (cfun
, n
));
2247 return BASIC_BLOCK_FOR_FN (cfun
, n
);
2251 /* Dump the CFG on stderr.
2253 FLAGS are the same used by the tree dumping functions
2254 (see TDF_* in dumpfile.h). */
2257 gimple_debug_cfg (int flags
)
2259 gimple_dump_cfg (stderr
, flags
);
2263 /* Dump the program showing basic block boundaries on the given FILE.
2265 FLAGS are the same used by the tree dumping functions (see TDF_* in
2269 gimple_dump_cfg (FILE *file
, int flags
)
2271 if (flags
& TDF_DETAILS
)
2273 dump_function_header (file
, current_function_decl
, flags
);
2274 fprintf (file
, ";; \n%d basic blocks, %d edges, last basic block %d.\n\n",
2275 n_basic_blocks_for_fn (cfun
), n_edges_for_fn (cfun
),
2276 last_basic_block_for_fn (cfun
));
2278 brief_dump_cfg (file
, flags
| TDF_COMMENT
);
2279 fprintf (file
, "\n");
2282 if (flags
& TDF_STATS
)
2283 dump_cfg_stats (file
);
2285 dump_function_to_file (current_function_decl
, file
, flags
| TDF_BLOCKS
);
2289 /* Dump CFG statistics on FILE. */
2292 dump_cfg_stats (FILE *file
)
2294 static long max_num_merged_labels
= 0;
2295 unsigned long size
, total
= 0;
2298 const char * const fmt_str
= "%-30s%-13s%12s\n";
2299 const char * const fmt_str_1
= "%-30s%13d%11lu%c\n";
2300 const char * const fmt_str_2
= "%-30s%13ld%11lu%c\n";
2301 const char * const fmt_str_3
= "%-43s%11lu%c\n";
2302 const char *funcname
= current_function_name ();
2304 fprintf (file
, "\nCFG Statistics for %s\n\n", funcname
);
2306 fprintf (file
, "---------------------------------------------------------\n");
2307 fprintf (file
, fmt_str
, "", " Number of ", "Memory");
2308 fprintf (file
, fmt_str
, "", " instances ", "used ");
2309 fprintf (file
, "---------------------------------------------------------\n");
2311 size
= n_basic_blocks_for_fn (cfun
) * sizeof (struct basic_block_def
);
2313 fprintf (file
, fmt_str_1
, "Basic blocks", n_basic_blocks_for_fn (cfun
),
2314 SCALE (size
), LABEL (size
));
2317 FOR_EACH_BB_FN (bb
, cfun
)
2318 num_edges
+= EDGE_COUNT (bb
->succs
);
2319 size
= num_edges
* sizeof (struct edge_def
);
2321 fprintf (file
, fmt_str_2
, "Edges", num_edges
, SCALE (size
), LABEL (size
));
2323 fprintf (file
, "---------------------------------------------------------\n");
2324 fprintf (file
, fmt_str_3
, "Total memory used by CFG data", SCALE (total
),
2326 fprintf (file
, "---------------------------------------------------------\n");
2327 fprintf (file
, "\n");
2329 if (cfg_stats
.num_merged_labels
> max_num_merged_labels
)
2330 max_num_merged_labels
= cfg_stats
.num_merged_labels
;
2332 fprintf (file
, "Coalesced label blocks: %ld (Max so far: %ld)\n",
2333 cfg_stats
.num_merged_labels
, max_num_merged_labels
);
2335 fprintf (file
, "\n");
2339 /* Dump CFG statistics on stderr. Keep extern so that it's always
2340 linked in the final executable. */
2343 debug_cfg_stats (void)
2345 dump_cfg_stats (stderr
);
2348 /*---------------------------------------------------------------------------
2349 Miscellaneous helpers
2350 ---------------------------------------------------------------------------*/
2352 /* Return true if T, a GIMPLE_CALL, can make an abnormal transfer of control
2353 flow. Transfers of control flow associated with EH are excluded. */
2356 call_can_make_abnormal_goto (gimple t
)
2358 /* If the function has no non-local labels, then a call cannot make an
2359 abnormal transfer of control. */
2360 if (!cfun
->has_nonlocal_label
2361 && !cfun
->calls_setjmp
)
2364 /* Likewise if the call has no side effects. */
2365 if (!gimple_has_side_effects (t
))
2368 /* Likewise if the called function is leaf. */
2369 if (gimple_call_flags (t
) & ECF_LEAF
)
2376 /* Return true if T can make an abnormal transfer of control flow.
2377 Transfers of control flow associated with EH are excluded. */
2380 stmt_can_make_abnormal_goto (gimple t
)
2382 if (computed_goto_p (t
))
2384 if (is_gimple_call (t
))
2385 return call_can_make_abnormal_goto (t
);
2390 /* Return true if T represents a stmt that always transfers control. */
2393 is_ctrl_stmt (gimple t
)
2395 switch (gimple_code (t
))
2409 /* Return true if T is a statement that may alter the flow of control
2410 (e.g., a call to a non-returning function). */
2413 is_ctrl_altering_stmt (gimple t
)
2417 switch (gimple_code (t
))
2420 /* Per stmt call flag indicates whether the call could alter
2422 if (gimple_call_ctrl_altering_p (t
))
2426 case GIMPLE_EH_DISPATCH
:
2427 /* EH_DISPATCH branches to the individual catch handlers at
2428 this level of a try or allowed-exceptions region. It can
2429 fallthru to the next statement as well. */
2433 if (gimple_asm_nlabels (as_a
<gasm
*> (t
)) > 0)
2438 /* OpenMP directives alter control flow. */
2441 case GIMPLE_TRANSACTION
:
2442 /* A transaction start alters control flow. */
2449 /* If a statement can throw, it alters control flow. */
2450 return stmt_can_throw_internal (t
);
2454 /* Return true if T is a simple local goto. */
2457 simple_goto_p (gimple t
)
2459 return (gimple_code (t
) == GIMPLE_GOTO
2460 && TREE_CODE (gimple_goto_dest (t
)) == LABEL_DECL
);
2464 /* Return true if STMT should start a new basic block. PREV_STMT is
2465 the statement preceding STMT. It is used when STMT is a label or a
2466 case label. Labels should only start a new basic block if their
2467 previous statement wasn't a label. Otherwise, sequence of labels
2468 would generate unnecessary basic blocks that only contain a single
2472 stmt_starts_bb_p (gimple stmt
, gimple prev_stmt
)
2477 /* Labels start a new basic block only if the preceding statement
2478 wasn't a label of the same type. This prevents the creation of
2479 consecutive blocks that have nothing but a single label. */
2480 if (glabel
*label_stmt
= dyn_cast
<glabel
*> (stmt
))
2482 /* Nonlocal and computed GOTO targets always start a new block. */
2483 if (DECL_NONLOCAL (gimple_label_label (label_stmt
))
2484 || FORCED_LABEL (gimple_label_label (label_stmt
)))
2487 if (prev_stmt
&& gimple_code (prev_stmt
) == GIMPLE_LABEL
)
2489 if (DECL_NONLOCAL (gimple_label_label (
2490 as_a
<glabel
*> (prev_stmt
))))
2493 cfg_stats
.num_merged_labels
++;
2499 else if (gimple_code (stmt
) == GIMPLE_CALL
2500 && gimple_call_flags (stmt
) & ECF_RETURNS_TWICE
)
2501 /* setjmp acts similar to a nonlocal GOTO target and thus should
2502 start a new block. */
2509 /* Return true if T should end a basic block. */
2512 stmt_ends_bb_p (gimple t
)
2514 return is_ctrl_stmt (t
) || is_ctrl_altering_stmt (t
);
2517 /* Remove block annotations and other data structures. */
2520 delete_tree_cfg_annotations (void)
2522 vec_free (label_to_block_map_for_fn (cfun
));
2526 /* Return the first statement in basic block BB. */
2529 first_stmt (basic_block bb
)
2531 gimple_stmt_iterator i
= gsi_start_bb (bb
);
2534 while (!gsi_end_p (i
) && is_gimple_debug ((stmt
= gsi_stmt (i
))))
2542 /* Return the first non-label statement in basic block BB. */
2545 first_non_label_stmt (basic_block bb
)
2547 gimple_stmt_iterator i
= gsi_start_bb (bb
);
2548 while (!gsi_end_p (i
) && gimple_code (gsi_stmt (i
)) == GIMPLE_LABEL
)
2550 return !gsi_end_p (i
) ? gsi_stmt (i
) : NULL
;
2553 /* Return the last statement in basic block BB. */
2556 last_stmt (basic_block bb
)
2558 gimple_stmt_iterator i
= gsi_last_bb (bb
);
2561 while (!gsi_end_p (i
) && is_gimple_debug ((stmt
= gsi_stmt (i
))))
2569 /* Return the last statement of an otherwise empty block. Return NULL
2570 if the block is totally empty, or if it contains more than one
2574 last_and_only_stmt (basic_block bb
)
2576 gimple_stmt_iterator i
= gsi_last_nondebug_bb (bb
);
2582 last
= gsi_stmt (i
);
2583 gsi_prev_nondebug (&i
);
2587 /* Empty statements should no longer appear in the instruction stream.
2588 Everything that might have appeared before should be deleted by
2589 remove_useless_stmts, and the optimizers should just gsi_remove
2590 instead of smashing with build_empty_stmt.
2592 Thus the only thing that should appear here in a block containing
2593 one executable statement is a label. */
2594 prev
= gsi_stmt (i
);
2595 if (gimple_code (prev
) == GIMPLE_LABEL
)
2601 /* Reinstall those PHI arguments queued in OLD_EDGE to NEW_EDGE. */
2604 reinstall_phi_args (edge new_edge
, edge old_edge
)
2610 vec
<edge_var_map
> *v
= redirect_edge_var_map_vector (old_edge
);
2614 for (i
= 0, phis
= gsi_start_phis (new_edge
->dest
);
2615 v
->iterate (i
, &vm
) && !gsi_end_p (phis
);
2616 i
++, gsi_next (&phis
))
2618 gphi
*phi
= phis
.phi ();
2619 tree result
= redirect_edge_var_map_result (vm
);
2620 tree arg
= redirect_edge_var_map_def (vm
);
2622 gcc_assert (result
== gimple_phi_result (phi
));
2624 add_phi_arg (phi
, arg
, new_edge
, redirect_edge_var_map_location (vm
));
2627 redirect_edge_var_map_clear (old_edge
);
2630 /* Returns the basic block after which the new basic block created
2631 by splitting edge EDGE_IN should be placed. Tries to keep the new block
2632 near its "logical" location. This is of most help to humans looking
2633 at debugging dumps. */
2636 split_edge_bb_loc (edge edge_in
)
2638 basic_block dest
= edge_in
->dest
;
2639 basic_block dest_prev
= dest
->prev_bb
;
2643 edge e
= find_edge (dest_prev
, dest
);
2644 if (e
&& !(e
->flags
& EDGE_COMPLEX
))
2645 return edge_in
->src
;
2650 /* Split a (typically critical) edge EDGE_IN. Return the new block.
2651 Abort on abnormal edges. */
2654 gimple_split_edge (edge edge_in
)
2656 basic_block new_bb
, after_bb
, dest
;
2659 /* Abnormal edges cannot be split. */
2660 gcc_assert (!(edge_in
->flags
& EDGE_ABNORMAL
));
2662 dest
= edge_in
->dest
;
2664 after_bb
= split_edge_bb_loc (edge_in
);
2666 new_bb
= create_empty_bb (after_bb
);
2667 new_bb
->frequency
= EDGE_FREQUENCY (edge_in
);
2668 new_bb
->count
= edge_in
->count
;
2669 new_edge
= make_edge (new_bb
, dest
, EDGE_FALLTHRU
);
2670 new_edge
->probability
= REG_BR_PROB_BASE
;
2671 new_edge
->count
= edge_in
->count
;
2673 e
= redirect_edge_and_branch (edge_in
, new_bb
);
2674 gcc_assert (e
== edge_in
);
2675 reinstall_phi_args (new_edge
, e
);
2681 /* Verify properties of the address expression T with base object BASE. */
2684 verify_address (tree t
, tree base
)
2687 bool old_side_effects
;
2689 bool new_side_effects
;
2691 old_constant
= TREE_CONSTANT (t
);
2692 old_side_effects
= TREE_SIDE_EFFECTS (t
);
2694 recompute_tree_invariant_for_addr_expr (t
);
2695 new_side_effects
= TREE_SIDE_EFFECTS (t
);
2696 new_constant
= TREE_CONSTANT (t
);
2698 if (old_constant
!= new_constant
)
2700 error ("constant not recomputed when ADDR_EXPR changed");
2703 if (old_side_effects
!= new_side_effects
)
2705 error ("side effects not recomputed when ADDR_EXPR changed");
2709 if (!(TREE_CODE (base
) == VAR_DECL
2710 || TREE_CODE (base
) == PARM_DECL
2711 || TREE_CODE (base
) == RESULT_DECL
))
2714 if (DECL_GIMPLE_REG_P (base
))
2716 error ("DECL_GIMPLE_REG_P set on a variable with address taken");
2723 /* Callback for walk_tree, check that all elements with address taken are
2724 properly noticed as such. The DATA is an int* that is 1 if TP was seen
2725 inside a PHI node. */
2728 verify_expr (tree
*tp
, int *walk_subtrees
, void *data ATTRIBUTE_UNUSED
)
2735 /* Check operand N for being valid GIMPLE and give error MSG if not. */
2736 #define CHECK_OP(N, MSG) \
2737 do { if (!is_gimple_val (TREE_OPERAND (t, N))) \
2738 { error (MSG); return TREE_OPERAND (t, N); }} while (0)
2740 switch (TREE_CODE (t
))
2743 if (SSA_NAME_IN_FREE_LIST (t
))
2745 error ("SSA name in freelist but still referenced");
2751 error ("INDIRECT_REF in gimple IL");
2755 x
= TREE_OPERAND (t
, 0);
2756 if (!POINTER_TYPE_P (TREE_TYPE (x
))
2757 || !is_gimple_mem_ref_addr (x
))
2759 error ("invalid first operand of MEM_REF");
2762 if (TREE_CODE (TREE_OPERAND (t
, 1)) != INTEGER_CST
2763 || !POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (t
, 1))))
2765 error ("invalid offset operand of MEM_REF");
2766 return TREE_OPERAND (t
, 1);
2768 if (TREE_CODE (x
) == ADDR_EXPR
2769 && (x
= verify_address (x
, TREE_OPERAND (x
, 0))))
2775 x
= fold (ASSERT_EXPR_COND (t
));
2776 if (x
== boolean_false_node
)
2778 error ("ASSERT_EXPR with an always-false condition");
2784 error ("MODIFY_EXPR not expected while having tuples");
2791 gcc_assert (is_gimple_address (t
));
2793 /* Skip any references (they will be checked when we recurse down the
2794 tree) and ensure that any variable used as a prefix is marked
2796 for (x
= TREE_OPERAND (t
, 0);
2797 handled_component_p (x
);
2798 x
= TREE_OPERAND (x
, 0))
2801 if ((tem
= verify_address (t
, x
)))
2804 if (!(TREE_CODE (x
) == VAR_DECL
2805 || TREE_CODE (x
) == PARM_DECL
2806 || TREE_CODE (x
) == RESULT_DECL
))
2809 if (!TREE_ADDRESSABLE (x
))
2811 error ("address taken, but ADDRESSABLE bit not set");
2819 x
= COND_EXPR_COND (t
);
2820 if (!INTEGRAL_TYPE_P (TREE_TYPE (x
)))
2822 error ("non-integral used in condition");
2825 if (!is_gimple_condexpr (x
))
2827 error ("invalid conditional operand");
2832 case NON_LVALUE_EXPR
:
2833 case TRUTH_NOT_EXPR
:
2837 case FIX_TRUNC_EXPR
:
2842 CHECK_OP (0, "invalid operand to unary operator");
2848 if (!is_gimple_reg_type (TREE_TYPE (t
)))
2850 error ("non-scalar BIT_FIELD_REF, IMAGPART_EXPR or REALPART_EXPR");
2854 if (TREE_CODE (t
) == BIT_FIELD_REF
)
2856 tree t0
= TREE_OPERAND (t
, 0);
2857 tree t1
= TREE_OPERAND (t
, 1);
2858 tree t2
= TREE_OPERAND (t
, 2);
2859 if (!tree_fits_uhwi_p (t1
)
2860 || !tree_fits_uhwi_p (t2
))
2862 error ("invalid position or size operand to BIT_FIELD_REF");
2865 if (INTEGRAL_TYPE_P (TREE_TYPE (t
))
2866 && (TYPE_PRECISION (TREE_TYPE (t
))
2867 != tree_to_uhwi (t1
)))
2869 error ("integral result type precision does not match "
2870 "field size of BIT_FIELD_REF");
2873 else if (!INTEGRAL_TYPE_P (TREE_TYPE (t
))
2874 && TYPE_MODE (TREE_TYPE (t
)) != BLKmode
2875 && (GET_MODE_PRECISION (TYPE_MODE (TREE_TYPE (t
)))
2876 != tree_to_uhwi (t1
)))
2878 error ("mode precision of non-integral result does not "
2879 "match field size of BIT_FIELD_REF");
2882 if (!AGGREGATE_TYPE_P (TREE_TYPE (t0
))
2883 && (tree_to_uhwi (t1
) + tree_to_uhwi (t2
)
2884 > tree_to_uhwi (TYPE_SIZE (TREE_TYPE (t0
)))))
2886 error ("position plus size exceeds size of referenced object in "
2891 t
= TREE_OPERAND (t
, 0);
2896 case ARRAY_RANGE_REF
:
2897 case VIEW_CONVERT_EXPR
:
2898 /* We have a nest of references. Verify that each of the operands
2899 that determine where to reference is either a constant or a variable,
2900 verify that the base is valid, and then show we've already checked
2902 while (handled_component_p (t
))
2904 if (TREE_CODE (t
) == COMPONENT_REF
&& TREE_OPERAND (t
, 2))
2905 CHECK_OP (2, "invalid COMPONENT_REF offset operator");
2906 else if (TREE_CODE (t
) == ARRAY_REF
2907 || TREE_CODE (t
) == ARRAY_RANGE_REF
)
2909 CHECK_OP (1, "invalid array index");
2910 if (TREE_OPERAND (t
, 2))
2911 CHECK_OP (2, "invalid array lower bound");
2912 if (TREE_OPERAND (t
, 3))
2913 CHECK_OP (3, "invalid array stride");
2915 else if (TREE_CODE (t
) == BIT_FIELD_REF
2916 || TREE_CODE (t
) == REALPART_EXPR
2917 || TREE_CODE (t
) == IMAGPART_EXPR
)
2919 error ("non-top-level BIT_FIELD_REF, IMAGPART_EXPR or "
2924 t
= TREE_OPERAND (t
, 0);
2927 if (!is_gimple_min_invariant (t
) && !is_gimple_lvalue (t
))
2929 error ("invalid reference prefix");
2936 /* PLUS_EXPR and MINUS_EXPR don't work on pointers, they should be done using
2937 POINTER_PLUS_EXPR. */
2938 if (POINTER_TYPE_P (TREE_TYPE (t
)))
2940 error ("invalid operand to plus/minus, type is a pointer");
2943 CHECK_OP (0, "invalid operand to binary operator");
2944 CHECK_OP (1, "invalid operand to binary operator");
2947 case POINTER_PLUS_EXPR
:
2948 /* Check to make sure the first operand is a pointer or reference type. */
2949 if (!POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (t
, 0))))
2951 error ("invalid operand to pointer plus, first operand is not a pointer");
2954 /* Check to make sure the second operand is a ptrofftype. */
2955 if (!ptrofftype_p (TREE_TYPE (TREE_OPERAND (t
, 1))))
2957 error ("invalid operand to pointer plus, second operand is not an "
2958 "integer type of appropriate width");
2968 case UNORDERED_EXPR
:
2977 case TRUNC_DIV_EXPR
:
2979 case FLOOR_DIV_EXPR
:
2980 case ROUND_DIV_EXPR
:
2981 case TRUNC_MOD_EXPR
:
2983 case FLOOR_MOD_EXPR
:
2984 case ROUND_MOD_EXPR
:
2986 case EXACT_DIV_EXPR
:
2996 CHECK_OP (0, "invalid operand to binary operator");
2997 CHECK_OP (1, "invalid operand to binary operator");
3001 if (TREE_CONSTANT (t
) && TREE_CODE (TREE_TYPE (t
)) == VECTOR_TYPE
)
3005 case CASE_LABEL_EXPR
:
3008 error ("invalid CASE_CHAIN");
3022 /* Verify if EXPR is either a GIMPLE ID or a GIMPLE indirect reference.
3023 Returns true if there is an error, otherwise false. */
3026 verify_types_in_gimple_min_lval (tree expr
)
3030 if (is_gimple_id (expr
))
3033 if (TREE_CODE (expr
) != TARGET_MEM_REF
3034 && TREE_CODE (expr
) != MEM_REF
)
3036 error ("invalid expression for min lvalue");
3040 /* TARGET_MEM_REFs are strange beasts. */
3041 if (TREE_CODE (expr
) == TARGET_MEM_REF
)
3044 op
= TREE_OPERAND (expr
, 0);
3045 if (!is_gimple_val (op
))
3047 error ("invalid operand in indirect reference");
3048 debug_generic_stmt (op
);
3051 /* Memory references now generally can involve a value conversion. */
3056 /* Verify if EXPR is a valid GIMPLE reference expression. If
3057 REQUIRE_LVALUE is true verifies it is an lvalue. Returns true
3058 if there is an error, otherwise false. */
3061 verify_types_in_gimple_reference (tree expr
, bool require_lvalue
)
3063 while (handled_component_p (expr
))
3065 tree op
= TREE_OPERAND (expr
, 0);
3067 if (TREE_CODE (expr
) == ARRAY_REF
3068 || TREE_CODE (expr
) == ARRAY_RANGE_REF
)
3070 if (!is_gimple_val (TREE_OPERAND (expr
, 1))
3071 || (TREE_OPERAND (expr
, 2)
3072 && !is_gimple_val (TREE_OPERAND (expr
, 2)))
3073 || (TREE_OPERAND (expr
, 3)
3074 && !is_gimple_val (TREE_OPERAND (expr
, 3))))
3076 error ("invalid operands to array reference");
3077 debug_generic_stmt (expr
);
3082 /* Verify if the reference array element types are compatible. */
3083 if (TREE_CODE (expr
) == ARRAY_REF
3084 && !useless_type_conversion_p (TREE_TYPE (expr
),
3085 TREE_TYPE (TREE_TYPE (op
))))
3087 error ("type mismatch in array reference");
3088 debug_generic_stmt (TREE_TYPE (expr
));
3089 debug_generic_stmt (TREE_TYPE (TREE_TYPE (op
)));
3092 if (TREE_CODE (expr
) == ARRAY_RANGE_REF
3093 && !useless_type_conversion_p (TREE_TYPE (TREE_TYPE (expr
)),
3094 TREE_TYPE (TREE_TYPE (op
))))
3096 error ("type mismatch in array range reference");
3097 debug_generic_stmt (TREE_TYPE (TREE_TYPE (expr
)));
3098 debug_generic_stmt (TREE_TYPE (TREE_TYPE (op
)));
3102 if ((TREE_CODE (expr
) == REALPART_EXPR
3103 || TREE_CODE (expr
) == IMAGPART_EXPR
)
3104 && !useless_type_conversion_p (TREE_TYPE (expr
),
3105 TREE_TYPE (TREE_TYPE (op
))))
3107 error ("type mismatch in real/imagpart reference");
3108 debug_generic_stmt (TREE_TYPE (expr
));
3109 debug_generic_stmt (TREE_TYPE (TREE_TYPE (op
)));
3113 if (TREE_CODE (expr
) == COMPONENT_REF
3114 && !useless_type_conversion_p (TREE_TYPE (expr
),
3115 TREE_TYPE (TREE_OPERAND (expr
, 1))))
3117 error ("type mismatch in component reference");
3118 debug_generic_stmt (TREE_TYPE (expr
));
3119 debug_generic_stmt (TREE_TYPE (TREE_OPERAND (expr
, 1)));
3123 if (TREE_CODE (expr
) == VIEW_CONVERT_EXPR
)
3125 /* For VIEW_CONVERT_EXPRs which are allowed here too, we only check
3126 that their operand is not an SSA name or an invariant when
3127 requiring an lvalue (this usually means there is a SRA or IPA-SRA
3128 bug). Otherwise there is nothing to verify, gross mismatches at
3129 most invoke undefined behavior. */
3131 && (TREE_CODE (op
) == SSA_NAME
3132 || is_gimple_min_invariant (op
)))
3134 error ("conversion of an SSA_NAME on the left hand side");
3135 debug_generic_stmt (expr
);
3138 else if (TREE_CODE (op
) == SSA_NAME
3139 && TYPE_SIZE (TREE_TYPE (expr
)) != TYPE_SIZE (TREE_TYPE (op
)))
3141 error ("conversion of register to a different size");
3142 debug_generic_stmt (expr
);
3145 else if (!handled_component_p (op
))
3152 if (TREE_CODE (expr
) == MEM_REF
)
3154 if (!is_gimple_mem_ref_addr (TREE_OPERAND (expr
, 0)))
3156 error ("invalid address operand in MEM_REF");
3157 debug_generic_stmt (expr
);
3160 if (TREE_CODE (TREE_OPERAND (expr
, 1)) != INTEGER_CST
3161 || !POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (expr
, 1))))
3163 error ("invalid offset operand in MEM_REF");
3164 debug_generic_stmt (expr
);
3168 else if (TREE_CODE (expr
) == TARGET_MEM_REF
)
3170 if (!TMR_BASE (expr
)
3171 || !is_gimple_mem_ref_addr (TMR_BASE (expr
)))
3173 error ("invalid address operand in TARGET_MEM_REF");
3176 if (!TMR_OFFSET (expr
)
3177 || TREE_CODE (TMR_OFFSET (expr
)) != INTEGER_CST
3178 || !POINTER_TYPE_P (TREE_TYPE (TMR_OFFSET (expr
))))
3180 error ("invalid offset operand in TARGET_MEM_REF");
3181 debug_generic_stmt (expr
);
3186 return ((require_lvalue
|| !is_gimple_min_invariant (expr
))
3187 && verify_types_in_gimple_min_lval (expr
));
3190 /* Returns true if there is one pointer type in TYPE_POINTER_TO (SRC_OBJ)
3191 list of pointer-to types that is trivially convertible to DEST. */
3194 one_pointer_to_useless_type_conversion_p (tree dest
, tree src_obj
)
3198 if (!TYPE_POINTER_TO (src_obj
))
3201 for (src
= TYPE_POINTER_TO (src_obj
); src
; src
= TYPE_NEXT_PTR_TO (src
))
3202 if (useless_type_conversion_p (dest
, src
))
3208 /* Return true if TYPE1 is a fixed-point type and if conversions to and
3209 from TYPE2 can be handled by FIXED_CONVERT_EXPR. */
3212 valid_fixed_convert_types_p (tree type1
, tree type2
)
3214 return (FIXED_POINT_TYPE_P (type1
)
3215 && (INTEGRAL_TYPE_P (type2
)
3216 || SCALAR_FLOAT_TYPE_P (type2
)
3217 || FIXED_POINT_TYPE_P (type2
)));
3220 /* Verify the contents of a GIMPLE_CALL STMT. Returns true when there
3221 is a problem, otherwise false. */
3224 verify_gimple_call (gcall
*stmt
)
3226 tree fn
= gimple_call_fn (stmt
);
3227 tree fntype
, fndecl
;
3230 if (gimple_call_internal_p (stmt
))
3234 error ("gimple call has two targets");
3235 debug_generic_stmt (fn
);
3243 error ("gimple call has no target");
3248 if (fn
&& !is_gimple_call_addr (fn
))
3250 error ("invalid function in gimple call");
3251 debug_generic_stmt (fn
);
3256 && (!POINTER_TYPE_P (TREE_TYPE (fn
))
3257 || (TREE_CODE (TREE_TYPE (TREE_TYPE (fn
))) != FUNCTION_TYPE
3258 && TREE_CODE (TREE_TYPE (TREE_TYPE (fn
))) != METHOD_TYPE
)))
3260 error ("non-function in gimple call");
3264 fndecl
= gimple_call_fndecl (stmt
);
3266 && TREE_CODE (fndecl
) == FUNCTION_DECL
3267 && DECL_LOOPING_CONST_OR_PURE_P (fndecl
)
3268 && !DECL_PURE_P (fndecl
)
3269 && !TREE_READONLY (fndecl
))
3271 error ("invalid pure const state for function");
3275 if (gimple_call_lhs (stmt
)
3276 && (!is_gimple_lvalue (gimple_call_lhs (stmt
))
3277 || verify_types_in_gimple_reference (gimple_call_lhs (stmt
), true)))
3279 error ("invalid LHS in gimple call");
3283 if (gimple_call_lhs (stmt
) && gimple_call_noreturn_p (stmt
))
3285 error ("LHS in noreturn call");
3289 fntype
= gimple_call_fntype (stmt
);
3291 && gimple_call_lhs (stmt
)
3292 && !useless_type_conversion_p (TREE_TYPE (gimple_call_lhs (stmt
)),
3294 /* ??? At least C++ misses conversions at assignments from
3295 void * call results.
3296 ??? Java is completely off. Especially with functions
3297 returning java.lang.Object.
3298 For now simply allow arbitrary pointer type conversions. */
3299 && !(POINTER_TYPE_P (TREE_TYPE (gimple_call_lhs (stmt
)))
3300 && POINTER_TYPE_P (TREE_TYPE (fntype
))))
3302 error ("invalid conversion in gimple call");
3303 debug_generic_stmt (TREE_TYPE (gimple_call_lhs (stmt
)));
3304 debug_generic_stmt (TREE_TYPE (fntype
));
3308 if (gimple_call_chain (stmt
)
3309 && !is_gimple_val (gimple_call_chain (stmt
)))
3311 error ("invalid static chain in gimple call");
3312 debug_generic_stmt (gimple_call_chain (stmt
));
3316 /* If there is a static chain argument, this should not be an indirect
3317 call, and the decl should have DECL_STATIC_CHAIN set. */
3318 if (gimple_call_chain (stmt
))
3320 if (!gimple_call_fndecl (stmt
))
3322 error ("static chain in indirect gimple call");
3325 fn
= TREE_OPERAND (fn
, 0);
3327 if (!DECL_STATIC_CHAIN (fn
))
3329 error ("static chain with function that doesn%'t use one");
3334 /* ??? The C frontend passes unpromoted arguments in case it
3335 didn't see a function declaration before the call. So for now
3336 leave the call arguments mostly unverified. Once we gimplify
3337 unit-at-a-time we have a chance to fix this. */
3339 for (i
= 0; i
< gimple_call_num_args (stmt
); ++i
)
3341 tree arg
= gimple_call_arg (stmt
, i
);
3342 if ((is_gimple_reg_type (TREE_TYPE (arg
))
3343 && !is_gimple_val (arg
))
3344 || (!is_gimple_reg_type (TREE_TYPE (arg
))
3345 && !is_gimple_lvalue (arg
)))
3347 error ("invalid argument to gimple call");
3348 debug_generic_expr (arg
);
3356 /* Verifies the gimple comparison with the result type TYPE and
3357 the operands OP0 and OP1. */
3360 verify_gimple_comparison (tree type
, tree op0
, tree op1
)
3362 tree op0_type
= TREE_TYPE (op0
);
3363 tree op1_type
= TREE_TYPE (op1
);
3365 if (!is_gimple_val (op0
) || !is_gimple_val (op1
))
3367 error ("invalid operands in gimple comparison");
3371 /* For comparisons we do not have the operations type as the
3372 effective type the comparison is carried out in. Instead
3373 we require that either the first operand is trivially
3374 convertible into the second, or the other way around.
3375 Because we special-case pointers to void we allow
3376 comparisons of pointers with the same mode as well. */
3377 if (!useless_type_conversion_p (op0_type
, op1_type
)
3378 && !useless_type_conversion_p (op1_type
, op0_type
)
3379 && (!POINTER_TYPE_P (op0_type
)
3380 || !POINTER_TYPE_P (op1_type
)
3381 || TYPE_MODE (op0_type
) != TYPE_MODE (op1_type
)))
3383 error ("mismatching comparison operand types");
3384 debug_generic_expr (op0_type
);
3385 debug_generic_expr (op1_type
);
3389 /* The resulting type of a comparison may be an effective boolean type. */
3390 if (INTEGRAL_TYPE_P (type
)
3391 && (TREE_CODE (type
) == BOOLEAN_TYPE
3392 || TYPE_PRECISION (type
) == 1))
3394 if (TREE_CODE (op0_type
) == VECTOR_TYPE
3395 || TREE_CODE (op1_type
) == VECTOR_TYPE
)
3397 error ("vector comparison returning a boolean");
3398 debug_generic_expr (op0_type
);
3399 debug_generic_expr (op1_type
);
3403 /* Or an integer vector type with the same size and element count
3404 as the comparison operand types. */
3405 else if (TREE_CODE (type
) == VECTOR_TYPE
3406 && TREE_CODE (TREE_TYPE (type
)) == INTEGER_TYPE
)
3408 if (TREE_CODE (op0_type
) != VECTOR_TYPE
3409 || TREE_CODE (op1_type
) != VECTOR_TYPE
)
3411 error ("non-vector operands in vector comparison");
3412 debug_generic_expr (op0_type
);
3413 debug_generic_expr (op1_type
);
3417 if (TYPE_VECTOR_SUBPARTS (type
) != TYPE_VECTOR_SUBPARTS (op0_type
)
3418 || (GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (type
)))
3419 != GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (op0_type
))))
3420 /* The result of a vector comparison is of signed
3422 || TYPE_UNSIGNED (TREE_TYPE (type
)))
3424 error ("invalid vector comparison resulting type");
3425 debug_generic_expr (type
);
3431 error ("bogus comparison result type");
3432 debug_generic_expr (type
);
3439 /* Verify a gimple assignment statement STMT with an unary rhs.
3440 Returns true if anything is wrong. */
3443 verify_gimple_assign_unary (gassign
*stmt
)
3445 enum tree_code rhs_code
= gimple_assign_rhs_code (stmt
);
3446 tree lhs
= gimple_assign_lhs (stmt
);
3447 tree lhs_type
= TREE_TYPE (lhs
);
3448 tree rhs1
= gimple_assign_rhs1 (stmt
);
3449 tree rhs1_type
= TREE_TYPE (rhs1
);
3451 if (!is_gimple_reg (lhs
))
3453 error ("non-register as LHS of unary operation");
3457 if (!is_gimple_val (rhs1
))
3459 error ("invalid operand in unary operation");
3463 /* First handle conversions. */
3468 /* Allow conversions from pointer type to integral type only if
3469 there is no sign or zero extension involved.
3470 For targets were the precision of ptrofftype doesn't match that
3471 of pointers we need to allow arbitrary conversions to ptrofftype. */
3472 if ((POINTER_TYPE_P (lhs_type
)
3473 && INTEGRAL_TYPE_P (rhs1_type
))
3474 || (POINTER_TYPE_P (rhs1_type
)
3475 && INTEGRAL_TYPE_P (lhs_type
)
3476 && (TYPE_PRECISION (rhs1_type
) >= TYPE_PRECISION (lhs_type
)
3477 || ptrofftype_p (sizetype
))))
3480 /* Allow conversion from integral to offset type and vice versa. */
3481 if ((TREE_CODE (lhs_type
) == OFFSET_TYPE
3482 && INTEGRAL_TYPE_P (rhs1_type
))
3483 || (INTEGRAL_TYPE_P (lhs_type
)
3484 && TREE_CODE (rhs1_type
) == OFFSET_TYPE
))
3487 /* Otherwise assert we are converting between types of the
3489 if (INTEGRAL_TYPE_P (lhs_type
) != INTEGRAL_TYPE_P (rhs1_type
))
3491 error ("invalid types in nop conversion");
3492 debug_generic_expr (lhs_type
);
3493 debug_generic_expr (rhs1_type
);
3500 case ADDR_SPACE_CONVERT_EXPR
:
3502 if (!POINTER_TYPE_P (rhs1_type
) || !POINTER_TYPE_P (lhs_type
)
3503 || (TYPE_ADDR_SPACE (TREE_TYPE (rhs1_type
))
3504 == TYPE_ADDR_SPACE (TREE_TYPE (lhs_type
))))
3506 error ("invalid types in address space conversion");
3507 debug_generic_expr (lhs_type
);
3508 debug_generic_expr (rhs1_type
);
3515 case FIXED_CONVERT_EXPR
:
3517 if (!valid_fixed_convert_types_p (lhs_type
, rhs1_type
)
3518 && !valid_fixed_convert_types_p (rhs1_type
, lhs_type
))
3520 error ("invalid types in fixed-point conversion");
3521 debug_generic_expr (lhs_type
);
3522 debug_generic_expr (rhs1_type
);
3531 if ((!INTEGRAL_TYPE_P (rhs1_type
) || !SCALAR_FLOAT_TYPE_P (lhs_type
))
3532 && (!VECTOR_INTEGER_TYPE_P (rhs1_type
)
3533 || !VECTOR_FLOAT_TYPE_P (lhs_type
)))
3535 error ("invalid types in conversion to floating point");
3536 debug_generic_expr (lhs_type
);
3537 debug_generic_expr (rhs1_type
);
3544 case FIX_TRUNC_EXPR
:
3546 if ((!INTEGRAL_TYPE_P (lhs_type
) || !SCALAR_FLOAT_TYPE_P (rhs1_type
))
3547 && (!VECTOR_INTEGER_TYPE_P (lhs_type
)
3548 || !VECTOR_FLOAT_TYPE_P (rhs1_type
)))
3550 error ("invalid types in conversion to integer");
3551 debug_generic_expr (lhs_type
);
3552 debug_generic_expr (rhs1_type
);
3559 case VEC_UNPACK_HI_EXPR
:
3560 case VEC_UNPACK_LO_EXPR
:
3561 case REDUC_MAX_EXPR
:
3562 case REDUC_MIN_EXPR
:
3563 case REDUC_PLUS_EXPR
:
3564 case VEC_UNPACK_FLOAT_HI_EXPR
:
3565 case VEC_UNPACK_FLOAT_LO_EXPR
:
3580 /* For the remaining codes assert there is no conversion involved. */
3581 if (!useless_type_conversion_p (lhs_type
, rhs1_type
))
3583 error ("non-trivial conversion in unary operation");
3584 debug_generic_expr (lhs_type
);
3585 debug_generic_expr (rhs1_type
);
3592 /* Verify a gimple assignment statement STMT with a binary rhs.
3593 Returns true if anything is wrong. */
3596 verify_gimple_assign_binary (gassign
*stmt
)
3598 enum tree_code rhs_code
= gimple_assign_rhs_code (stmt
);
3599 tree lhs
= gimple_assign_lhs (stmt
);
3600 tree lhs_type
= TREE_TYPE (lhs
);
3601 tree rhs1
= gimple_assign_rhs1 (stmt
);
3602 tree rhs1_type
= TREE_TYPE (rhs1
);
3603 tree rhs2
= gimple_assign_rhs2 (stmt
);
3604 tree rhs2_type
= TREE_TYPE (rhs2
);
3606 if (!is_gimple_reg (lhs
))
3608 error ("non-register as LHS of binary operation");
3612 if (!is_gimple_val (rhs1
)
3613 || !is_gimple_val (rhs2
))
3615 error ("invalid operands in binary operation");
3619 /* First handle operations that involve different types. */
3624 if (TREE_CODE (lhs_type
) != COMPLEX_TYPE
3625 || !(INTEGRAL_TYPE_P (rhs1_type
)
3626 || SCALAR_FLOAT_TYPE_P (rhs1_type
))
3627 || !(INTEGRAL_TYPE_P (rhs2_type
)
3628 || SCALAR_FLOAT_TYPE_P (rhs2_type
)))
3630 error ("type mismatch in complex expression");
3631 debug_generic_expr (lhs_type
);
3632 debug_generic_expr (rhs1_type
);
3633 debug_generic_expr (rhs2_type
);
3645 /* Shifts and rotates are ok on integral types, fixed point
3646 types and integer vector types. */
3647 if ((!INTEGRAL_TYPE_P (rhs1_type
)
3648 && !FIXED_POINT_TYPE_P (rhs1_type
)
3649 && !(TREE_CODE (rhs1_type
) == VECTOR_TYPE
3650 && INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type
))))
3651 || (!INTEGRAL_TYPE_P (rhs2_type
)
3652 /* Vector shifts of vectors are also ok. */
3653 && !(TREE_CODE (rhs1_type
) == VECTOR_TYPE
3654 && INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type
))
3655 && TREE_CODE (rhs2_type
) == VECTOR_TYPE
3656 && INTEGRAL_TYPE_P (TREE_TYPE (rhs2_type
))))
3657 || !useless_type_conversion_p (lhs_type
, rhs1_type
))
3659 error ("type mismatch in shift expression");
3660 debug_generic_expr (lhs_type
);
3661 debug_generic_expr (rhs1_type
);
3662 debug_generic_expr (rhs2_type
);
3669 case VEC_LSHIFT_EXPR
:
3670 case VEC_RSHIFT_EXPR
:
3672 if (TREE_CODE (rhs1_type
) != VECTOR_TYPE
3673 || !(INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type
))
3674 || POINTER_TYPE_P (TREE_TYPE (rhs1_type
))
3675 || FIXED_POINT_TYPE_P (TREE_TYPE (rhs1_type
))
3676 || SCALAR_FLOAT_TYPE_P (TREE_TYPE (rhs1_type
)))
3677 || (!INTEGRAL_TYPE_P (rhs2_type
)
3678 && (TREE_CODE (rhs2_type
) != VECTOR_TYPE
3679 || !INTEGRAL_TYPE_P (TREE_TYPE (rhs2_type
))))
3680 || !useless_type_conversion_p (lhs_type
, rhs1_type
))
3682 error ("type mismatch in vector shift expression");
3683 debug_generic_expr (lhs_type
);
3684 debug_generic_expr (rhs1_type
);
3685 debug_generic_expr (rhs2_type
);
3688 /* For shifting a vector of non-integral components we
3689 only allow shifting by a constant multiple of the element size. */
3690 if (!INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type
))
3691 && (TREE_CODE (rhs2
) != INTEGER_CST
3692 || !div_if_zero_remainder (rhs2
,
3693 TYPE_SIZE (TREE_TYPE (rhs1_type
)))))
3695 error ("non-element sized vector shift of floating point vector");
3702 case WIDEN_LSHIFT_EXPR
:
3704 if (!INTEGRAL_TYPE_P (lhs_type
)
3705 || !INTEGRAL_TYPE_P (rhs1_type
)
3706 || TREE_CODE (rhs2
) != INTEGER_CST
3707 || (2 * TYPE_PRECISION (rhs1_type
) > TYPE_PRECISION (lhs_type
)))
3709 error ("type mismatch in widening vector shift expression");
3710 debug_generic_expr (lhs_type
);
3711 debug_generic_expr (rhs1_type
);
3712 debug_generic_expr (rhs2_type
);
3719 case VEC_WIDEN_LSHIFT_HI_EXPR
:
3720 case VEC_WIDEN_LSHIFT_LO_EXPR
:
3722 if (TREE_CODE (rhs1_type
) != VECTOR_TYPE
3723 || TREE_CODE (lhs_type
) != VECTOR_TYPE
3724 || !INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type
))
3725 || !INTEGRAL_TYPE_P (TREE_TYPE (lhs_type
))
3726 || TREE_CODE (rhs2
) != INTEGER_CST
3727 || (2 * TYPE_PRECISION (TREE_TYPE (rhs1_type
))
3728 > TYPE_PRECISION (TREE_TYPE (lhs_type
))))
3730 error ("type mismatch in widening vector shift expression");
3731 debug_generic_expr (lhs_type
);
3732 debug_generic_expr (rhs1_type
);
3733 debug_generic_expr (rhs2_type
);
3743 tree lhs_etype
= lhs_type
;
3744 tree rhs1_etype
= rhs1_type
;
3745 tree rhs2_etype
= rhs2_type
;
3746 if (TREE_CODE (lhs_type
) == VECTOR_TYPE
)
3748 if (TREE_CODE (rhs1_type
) != VECTOR_TYPE
3749 || TREE_CODE (rhs2_type
) != VECTOR_TYPE
)
3751 error ("invalid non-vector operands to vector valued plus");
3754 lhs_etype
= TREE_TYPE (lhs_type
);
3755 rhs1_etype
= TREE_TYPE (rhs1_type
);
3756 rhs2_etype
= TREE_TYPE (rhs2_type
);
3758 if (POINTER_TYPE_P (lhs_etype
)
3759 || POINTER_TYPE_P (rhs1_etype
)
3760 || POINTER_TYPE_P (rhs2_etype
))
3762 error ("invalid (pointer) operands to plus/minus");
3766 /* Continue with generic binary expression handling. */
3770 case POINTER_PLUS_EXPR
:
3772 if (!POINTER_TYPE_P (rhs1_type
)
3773 || !useless_type_conversion_p (lhs_type
, rhs1_type
)
3774 || !ptrofftype_p (rhs2_type
))
3776 error ("type mismatch in pointer plus expression");
3777 debug_generic_stmt (lhs_type
);
3778 debug_generic_stmt (rhs1_type
);
3779 debug_generic_stmt (rhs2_type
);
3786 case TRUTH_ANDIF_EXPR
:
3787 case TRUTH_ORIF_EXPR
:
3788 case TRUTH_AND_EXPR
:
3790 case TRUTH_XOR_EXPR
:
3800 case UNORDERED_EXPR
:
3808 /* Comparisons are also binary, but the result type is not
3809 connected to the operand types. */
3810 return verify_gimple_comparison (lhs_type
, rhs1
, rhs2
);
3812 case WIDEN_MULT_EXPR
:
3813 if (TREE_CODE (lhs_type
) != INTEGER_TYPE
)
3815 return ((2 * TYPE_PRECISION (rhs1_type
) > TYPE_PRECISION (lhs_type
))
3816 || (TYPE_PRECISION (rhs1_type
) != TYPE_PRECISION (rhs2_type
)));
3818 case WIDEN_SUM_EXPR
:
3819 case VEC_WIDEN_MULT_HI_EXPR
:
3820 case VEC_WIDEN_MULT_LO_EXPR
:
3821 case VEC_WIDEN_MULT_EVEN_EXPR
:
3822 case VEC_WIDEN_MULT_ODD_EXPR
:
3823 case VEC_PACK_TRUNC_EXPR
:
3824 case VEC_PACK_SAT_EXPR
:
3825 case VEC_PACK_FIX_TRUNC_EXPR
:
3830 case MULT_HIGHPART_EXPR
:
3831 case TRUNC_DIV_EXPR
:
3833 case FLOOR_DIV_EXPR
:
3834 case ROUND_DIV_EXPR
:
3835 case TRUNC_MOD_EXPR
:
3837 case FLOOR_MOD_EXPR
:
3838 case ROUND_MOD_EXPR
:
3840 case EXACT_DIV_EXPR
:
3846 /* Continue with generic binary expression handling. */
3853 if (!useless_type_conversion_p (lhs_type
, rhs1_type
)
3854 || !useless_type_conversion_p (lhs_type
, rhs2_type
))
3856 error ("type mismatch in binary expression");
3857 debug_generic_stmt (lhs_type
);
3858 debug_generic_stmt (rhs1_type
);
3859 debug_generic_stmt (rhs2_type
);
3866 /* Verify a gimple assignment statement STMT with a ternary rhs.
3867 Returns true if anything is wrong. */
3870 verify_gimple_assign_ternary (gassign
*stmt
)
3872 enum tree_code rhs_code
= gimple_assign_rhs_code (stmt
);
3873 tree lhs
= gimple_assign_lhs (stmt
);
3874 tree lhs_type
= TREE_TYPE (lhs
);
3875 tree rhs1
= gimple_assign_rhs1 (stmt
);
3876 tree rhs1_type
= TREE_TYPE (rhs1
);
3877 tree rhs2
= gimple_assign_rhs2 (stmt
);
3878 tree rhs2_type
= TREE_TYPE (rhs2
);
3879 tree rhs3
= gimple_assign_rhs3 (stmt
);
3880 tree rhs3_type
= TREE_TYPE (rhs3
);
3882 if (!is_gimple_reg (lhs
))
3884 error ("non-register as LHS of ternary operation");
3888 if (((rhs_code
== VEC_COND_EXPR
|| rhs_code
== COND_EXPR
)
3889 ? !is_gimple_condexpr (rhs1
) : !is_gimple_val (rhs1
))
3890 || !is_gimple_val (rhs2
)
3891 || !is_gimple_val (rhs3
))
3893 error ("invalid operands in ternary operation");
3897 /* First handle operations that involve different types. */
3900 case WIDEN_MULT_PLUS_EXPR
:
3901 case WIDEN_MULT_MINUS_EXPR
:
3902 if ((!INTEGRAL_TYPE_P (rhs1_type
)
3903 && !FIXED_POINT_TYPE_P (rhs1_type
))
3904 || !useless_type_conversion_p (rhs1_type
, rhs2_type
)
3905 || !useless_type_conversion_p (lhs_type
, rhs3_type
)
3906 || 2 * TYPE_PRECISION (rhs1_type
) > TYPE_PRECISION (lhs_type
)
3907 || TYPE_PRECISION (rhs1_type
) != TYPE_PRECISION (rhs2_type
))
3909 error ("type mismatch in widening multiply-accumulate expression");
3910 debug_generic_expr (lhs_type
);
3911 debug_generic_expr (rhs1_type
);
3912 debug_generic_expr (rhs2_type
);
3913 debug_generic_expr (rhs3_type
);
3919 if (!useless_type_conversion_p (lhs_type
, rhs1_type
)
3920 || !useless_type_conversion_p (lhs_type
, rhs2_type
)
3921 || !useless_type_conversion_p (lhs_type
, rhs3_type
))
3923 error ("type mismatch in fused multiply-add expression");
3924 debug_generic_expr (lhs_type
);
3925 debug_generic_expr (rhs1_type
);
3926 debug_generic_expr (rhs2_type
);
3927 debug_generic_expr (rhs3_type
);
3934 if (!useless_type_conversion_p (lhs_type
, rhs2_type
)
3935 || !useless_type_conversion_p (lhs_type
, rhs3_type
))
3937 error ("type mismatch in conditional expression");
3938 debug_generic_expr (lhs_type
);
3939 debug_generic_expr (rhs2_type
);
3940 debug_generic_expr (rhs3_type
);
3946 if (!useless_type_conversion_p (lhs_type
, rhs1_type
)
3947 || !useless_type_conversion_p (lhs_type
, rhs2_type
))
3949 error ("type mismatch in vector permute expression");
3950 debug_generic_expr (lhs_type
);
3951 debug_generic_expr (rhs1_type
);
3952 debug_generic_expr (rhs2_type
);
3953 debug_generic_expr (rhs3_type
);
3957 if (TREE_CODE (rhs1_type
) != VECTOR_TYPE
3958 || TREE_CODE (rhs2_type
) != VECTOR_TYPE
3959 || TREE_CODE (rhs3_type
) != VECTOR_TYPE
)
3961 error ("vector types expected in vector permute expression");
3962 debug_generic_expr (lhs_type
);
3963 debug_generic_expr (rhs1_type
);
3964 debug_generic_expr (rhs2_type
);
3965 debug_generic_expr (rhs3_type
);
3969 if (TYPE_VECTOR_SUBPARTS (rhs1_type
) != TYPE_VECTOR_SUBPARTS (rhs2_type
)
3970 || TYPE_VECTOR_SUBPARTS (rhs2_type
)
3971 != TYPE_VECTOR_SUBPARTS (rhs3_type
)
3972 || TYPE_VECTOR_SUBPARTS (rhs3_type
)
3973 != TYPE_VECTOR_SUBPARTS (lhs_type
))
3975 error ("vectors with different element number found "
3976 "in vector permute expression");
3977 debug_generic_expr (lhs_type
);
3978 debug_generic_expr (rhs1_type
);
3979 debug_generic_expr (rhs2_type
);
3980 debug_generic_expr (rhs3_type
);
3984 if (TREE_CODE (TREE_TYPE (rhs3_type
)) != INTEGER_TYPE
3985 || GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (rhs3_type
)))
3986 != GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (rhs1_type
))))
3988 error ("invalid mask type in vector permute expression");
3989 debug_generic_expr (lhs_type
);
3990 debug_generic_expr (rhs1_type
);
3991 debug_generic_expr (rhs2_type
);
3992 debug_generic_expr (rhs3_type
);
3999 if (!useless_type_conversion_p (rhs1_type
, rhs2_type
)
4000 || !useless_type_conversion_p (lhs_type
, rhs3_type
)
4001 || 2 * GET_MODE_BITSIZE (GET_MODE_INNER
4002 (TYPE_MODE (TREE_TYPE (rhs1_type
))))
4003 > GET_MODE_BITSIZE (GET_MODE_INNER
4004 (TYPE_MODE (TREE_TYPE (lhs_type
)))))
4006 error ("type mismatch in sad expression");
4007 debug_generic_expr (lhs_type
);
4008 debug_generic_expr (rhs1_type
);
4009 debug_generic_expr (rhs2_type
);
4010 debug_generic_expr (rhs3_type
);
4014 if (TREE_CODE (rhs1_type
) != VECTOR_TYPE
4015 || TREE_CODE (rhs2_type
) != VECTOR_TYPE
4016 || TREE_CODE (rhs3_type
) != VECTOR_TYPE
)
4018 error ("vector types expected in sad expression");
4019 debug_generic_expr (lhs_type
);
4020 debug_generic_expr (rhs1_type
);
4021 debug_generic_expr (rhs2_type
);
4022 debug_generic_expr (rhs3_type
);
4029 case REALIGN_LOAD_EXPR
:
4039 /* Verify a gimple assignment statement STMT with a single rhs.
4040 Returns true if anything is wrong. */
4043 verify_gimple_assign_single (gassign
*stmt
)
4045 enum tree_code rhs_code
= gimple_assign_rhs_code (stmt
);
4046 tree lhs
= gimple_assign_lhs (stmt
);
4047 tree lhs_type
= TREE_TYPE (lhs
);
4048 tree rhs1
= gimple_assign_rhs1 (stmt
);
4049 tree rhs1_type
= TREE_TYPE (rhs1
);
4052 if (!useless_type_conversion_p (lhs_type
, rhs1_type
))
4054 error ("non-trivial conversion at assignment");
4055 debug_generic_expr (lhs_type
);
4056 debug_generic_expr (rhs1_type
);
4060 if (gimple_clobber_p (stmt
)
4061 && !(DECL_P (lhs
) || TREE_CODE (lhs
) == MEM_REF
))
4063 error ("non-decl/MEM_REF LHS in clobber statement");
4064 debug_generic_expr (lhs
);
4068 if (handled_component_p (lhs
)
4069 || TREE_CODE (lhs
) == MEM_REF
4070 || TREE_CODE (lhs
) == TARGET_MEM_REF
)
4071 res
|= verify_types_in_gimple_reference (lhs
, true);
4073 /* Special codes we cannot handle via their class. */
4078 tree op
= TREE_OPERAND (rhs1
, 0);
4079 if (!is_gimple_addressable (op
))
4081 error ("invalid operand in unary expression");
4085 /* Technically there is no longer a need for matching types, but
4086 gimple hygiene asks for this check. In LTO we can end up
4087 combining incompatible units and thus end up with addresses
4088 of globals that change their type to a common one. */
4090 && !types_compatible_p (TREE_TYPE (op
),
4091 TREE_TYPE (TREE_TYPE (rhs1
)))
4092 && !one_pointer_to_useless_type_conversion_p (TREE_TYPE (rhs1
),
4095 error ("type mismatch in address expression");
4096 debug_generic_stmt (TREE_TYPE (rhs1
));
4097 debug_generic_stmt (TREE_TYPE (op
));
4101 return verify_types_in_gimple_reference (op
, true);
4106 error ("INDIRECT_REF in gimple IL");
4112 case ARRAY_RANGE_REF
:
4113 case VIEW_CONVERT_EXPR
:
4116 case TARGET_MEM_REF
:
4118 if (!is_gimple_reg (lhs
)
4119 && is_gimple_reg_type (TREE_TYPE (lhs
)))
4121 error ("invalid rhs for gimple memory store");
4122 debug_generic_stmt (lhs
);
4123 debug_generic_stmt (rhs1
);
4126 return res
|| verify_types_in_gimple_reference (rhs1
, false);
4138 /* tcc_declaration */
4143 if (!is_gimple_reg (lhs
)
4144 && !is_gimple_reg (rhs1
)
4145 && is_gimple_reg_type (TREE_TYPE (lhs
)))
4147 error ("invalid rhs for gimple memory store");
4148 debug_generic_stmt (lhs
);
4149 debug_generic_stmt (rhs1
);
4155 if (TREE_CODE (rhs1_type
) == VECTOR_TYPE
)
4158 tree elt_i
, elt_v
, elt_t
= NULL_TREE
;
4160 if (CONSTRUCTOR_NELTS (rhs1
) == 0)
4162 /* For vector CONSTRUCTORs we require that either it is empty
4163 CONSTRUCTOR, or it is a CONSTRUCTOR of smaller vector elements
4164 (then the element count must be correct to cover the whole
4165 outer vector and index must be NULL on all elements, or it is
4166 a CONSTRUCTOR of scalar elements, where we as an exception allow
4167 smaller number of elements (assuming zero filling) and
4168 consecutive indexes as compared to NULL indexes (such
4169 CONSTRUCTORs can appear in the IL from FEs). */
4170 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (rhs1
), i
, elt_i
, elt_v
)
4172 if (elt_t
== NULL_TREE
)
4174 elt_t
= TREE_TYPE (elt_v
);
4175 if (TREE_CODE (elt_t
) == VECTOR_TYPE
)
4177 tree elt_t
= TREE_TYPE (elt_v
);
4178 if (!useless_type_conversion_p (TREE_TYPE (rhs1_type
),
4181 error ("incorrect type of vector CONSTRUCTOR"
4183 debug_generic_stmt (rhs1
);
4186 else if (CONSTRUCTOR_NELTS (rhs1
)
4187 * TYPE_VECTOR_SUBPARTS (elt_t
)
4188 != TYPE_VECTOR_SUBPARTS (rhs1_type
))
4190 error ("incorrect number of vector CONSTRUCTOR"
4192 debug_generic_stmt (rhs1
);
4196 else if (!useless_type_conversion_p (TREE_TYPE (rhs1_type
),
4199 error ("incorrect type of vector CONSTRUCTOR elements");
4200 debug_generic_stmt (rhs1
);
4203 else if (CONSTRUCTOR_NELTS (rhs1
)
4204 > TYPE_VECTOR_SUBPARTS (rhs1_type
))
4206 error ("incorrect number of vector CONSTRUCTOR elements");
4207 debug_generic_stmt (rhs1
);
4211 else if (!useless_type_conversion_p (elt_t
, TREE_TYPE (elt_v
)))
4213 error ("incorrect type of vector CONSTRUCTOR elements");
4214 debug_generic_stmt (rhs1
);
4217 if (elt_i
!= NULL_TREE
4218 && (TREE_CODE (elt_t
) == VECTOR_TYPE
4219 || TREE_CODE (elt_i
) != INTEGER_CST
4220 || compare_tree_int (elt_i
, i
) != 0))
4222 error ("vector CONSTRUCTOR with non-NULL element index");
4223 debug_generic_stmt (rhs1
);
4226 if (!is_gimple_val (elt_v
))
4228 error ("vector CONSTRUCTOR element is not a GIMPLE value");
4229 debug_generic_stmt (rhs1
);
4234 else if (CONSTRUCTOR_NELTS (rhs1
) != 0)
4236 error ("non-vector CONSTRUCTOR with elements");
4237 debug_generic_stmt (rhs1
);
4243 case WITH_SIZE_EXPR
:
4253 /* Verify the contents of a GIMPLE_ASSIGN STMT. Returns true when there
4254 is a problem, otherwise false. */
4257 verify_gimple_assign (gassign
*stmt
)
4259 switch (gimple_assign_rhs_class (stmt
))
4261 case GIMPLE_SINGLE_RHS
:
4262 return verify_gimple_assign_single (stmt
);
4264 case GIMPLE_UNARY_RHS
:
4265 return verify_gimple_assign_unary (stmt
);
4267 case GIMPLE_BINARY_RHS
:
4268 return verify_gimple_assign_binary (stmt
);
4270 case GIMPLE_TERNARY_RHS
:
4271 return verify_gimple_assign_ternary (stmt
);
4278 /* Verify the contents of a GIMPLE_RETURN STMT. Returns true when there
4279 is a problem, otherwise false. */
4282 verify_gimple_return (greturn
*stmt
)
4284 tree op
= gimple_return_retval (stmt
);
4285 tree restype
= TREE_TYPE (TREE_TYPE (cfun
->decl
));
4287 /* We cannot test for present return values as we do not fix up missing
4288 return values from the original source. */
4292 if (!is_gimple_val (op
)
4293 && TREE_CODE (op
) != RESULT_DECL
)
4295 error ("invalid operand in return statement");
4296 debug_generic_stmt (op
);
4300 if ((TREE_CODE (op
) == RESULT_DECL
4301 && DECL_BY_REFERENCE (op
))
4302 || (TREE_CODE (op
) == SSA_NAME
4303 && SSA_NAME_VAR (op
)
4304 && TREE_CODE (SSA_NAME_VAR (op
)) == RESULT_DECL
4305 && DECL_BY_REFERENCE (SSA_NAME_VAR (op
))))
4306 op
= TREE_TYPE (op
);
4308 if (!useless_type_conversion_p (restype
, TREE_TYPE (op
)))
4310 error ("invalid conversion in return statement");
4311 debug_generic_stmt (restype
);
4312 debug_generic_stmt (TREE_TYPE (op
));
4320 /* Verify the contents of a GIMPLE_GOTO STMT. Returns true when there
4321 is a problem, otherwise false. */
4324 verify_gimple_goto (ggoto
*stmt
)
4326 tree dest
= gimple_goto_dest (stmt
);
4328 /* ??? We have two canonical forms of direct goto destinations, a
4329 bare LABEL_DECL and an ADDR_EXPR of a LABEL_DECL. */
4330 if (TREE_CODE (dest
) != LABEL_DECL
4331 && (!is_gimple_val (dest
)
4332 || !POINTER_TYPE_P (TREE_TYPE (dest
))))
4334 error ("goto destination is neither a label nor a pointer");
4341 /* Verify the contents of a GIMPLE_SWITCH STMT. Returns true when there
4342 is a problem, otherwise false. */
4345 verify_gimple_switch (gswitch
*stmt
)
4348 tree elt
, prev_upper_bound
= NULL_TREE
;
4349 tree index_type
, elt_type
= NULL_TREE
;
4351 if (!is_gimple_val (gimple_switch_index (stmt
)))
4353 error ("invalid operand to switch statement");
4354 debug_generic_stmt (gimple_switch_index (stmt
));
4358 index_type
= TREE_TYPE (gimple_switch_index (stmt
));
4359 if (! INTEGRAL_TYPE_P (index_type
))
4361 error ("non-integral type switch statement");
4362 debug_generic_expr (index_type
);
4366 elt
= gimple_switch_label (stmt
, 0);
4367 if (CASE_LOW (elt
) != NULL_TREE
|| CASE_HIGH (elt
) != NULL_TREE
)
4369 error ("invalid default case label in switch statement");
4370 debug_generic_expr (elt
);
4374 n
= gimple_switch_num_labels (stmt
);
4375 for (i
= 1; i
< n
; i
++)
4377 elt
= gimple_switch_label (stmt
, i
);
4379 if (! CASE_LOW (elt
))
4381 error ("invalid case label in switch statement");
4382 debug_generic_expr (elt
);
4386 && ! tree_int_cst_lt (CASE_LOW (elt
), CASE_HIGH (elt
)))
4388 error ("invalid case range in switch statement");
4389 debug_generic_expr (elt
);
4395 if (TREE_TYPE (CASE_LOW (elt
)) != elt_type
4396 || (CASE_HIGH (elt
) && TREE_TYPE (CASE_HIGH (elt
)) != elt_type
))
4398 error ("type mismatch for case label in switch statement");
4399 debug_generic_expr (elt
);
4405 elt_type
= TREE_TYPE (CASE_LOW (elt
));
4406 if (TYPE_PRECISION (index_type
) < TYPE_PRECISION (elt_type
))
4408 error ("type precision mismatch in switch statement");
4413 if (prev_upper_bound
)
4415 if (! tree_int_cst_lt (prev_upper_bound
, CASE_LOW (elt
)))
4417 error ("case labels not sorted in switch statement");
4422 prev_upper_bound
= CASE_HIGH (elt
);
4423 if (! prev_upper_bound
)
4424 prev_upper_bound
= CASE_LOW (elt
);
4430 /* Verify a gimple debug statement STMT.
4431 Returns true if anything is wrong. */
4434 verify_gimple_debug (gimple stmt ATTRIBUTE_UNUSED
)
4436 /* There isn't much that could be wrong in a gimple debug stmt. A
4437 gimple debug bind stmt, for example, maps a tree, that's usually
4438 a VAR_DECL or a PARM_DECL, but that could also be some scalarized
4439 component or member of an aggregate type, to another tree, that
4440 can be an arbitrary expression. These stmts expand into debug
4441 insns, and are converted to debug notes by var-tracking.c. */
4445 /* Verify a gimple label statement STMT.
4446 Returns true if anything is wrong. */
4449 verify_gimple_label (glabel
*stmt
)
4451 tree decl
= gimple_label_label (stmt
);
4455 if (TREE_CODE (decl
) != LABEL_DECL
)
4457 if (!DECL_NONLOCAL (decl
) && !FORCED_LABEL (decl
)
4458 && DECL_CONTEXT (decl
) != current_function_decl
)
4460 error ("label's context is not the current function decl");
4464 uid
= LABEL_DECL_UID (decl
);
4467 || (*label_to_block_map_for_fn (cfun
))[uid
] != gimple_bb (stmt
)))
4469 error ("incorrect entry in label_to_block_map");
4473 uid
= EH_LANDING_PAD_NR (decl
);
4476 eh_landing_pad lp
= get_eh_landing_pad_from_number (uid
);
4477 if (decl
!= lp
->post_landing_pad
)
4479 error ("incorrect setting of landing pad number");
4487 /* Verify a gimple cond statement STMT.
4488 Returns true if anything is wrong. */
4491 verify_gimple_cond (gcond
*stmt
)
4493 if (TREE_CODE_CLASS (gimple_cond_code (stmt
)) != tcc_comparison
)
4495 error ("invalid comparison code in gimple cond");
4498 if (!(!gimple_cond_true_label (stmt
)
4499 || TREE_CODE (gimple_cond_true_label (stmt
)) == LABEL_DECL
)
4500 || !(!gimple_cond_false_label (stmt
)
4501 || TREE_CODE (gimple_cond_false_label (stmt
)) == LABEL_DECL
))
4503 error ("invalid labels in gimple cond");
4507 return verify_gimple_comparison (boolean_type_node
,
4508 gimple_cond_lhs (stmt
),
4509 gimple_cond_rhs (stmt
));
4512 /* Verify the GIMPLE statement STMT. Returns true if there is an
4513 error, otherwise false. */
4516 verify_gimple_stmt (gimple stmt
)
4518 switch (gimple_code (stmt
))
4521 return verify_gimple_assign (as_a
<gassign
*> (stmt
));
4524 return verify_gimple_label (as_a
<glabel
*> (stmt
));
4527 return verify_gimple_call (as_a
<gcall
*> (stmt
));
4530 return verify_gimple_cond (as_a
<gcond
*> (stmt
));
4533 return verify_gimple_goto (as_a
<ggoto
*> (stmt
));
4536 return verify_gimple_switch (as_a
<gswitch
*> (stmt
));
4539 return verify_gimple_return (as_a
<greturn
*> (stmt
));
4544 case GIMPLE_TRANSACTION
:
4545 return verify_gimple_transaction (as_a
<gtransaction
*> (stmt
));
4547 /* Tuples that do not have tree operands. */
4549 case GIMPLE_PREDICT
:
4551 case GIMPLE_EH_DISPATCH
:
4552 case GIMPLE_EH_MUST_NOT_THROW
:
4556 /* OpenMP directives are validated by the FE and never operated
4557 on by the optimizers. Furthermore, GIMPLE_OMP_FOR may contain
4558 non-gimple expressions when the main index variable has had
4559 its address taken. This does not affect the loop itself
4560 because the header of an GIMPLE_OMP_FOR is merely used to determine
4561 how to setup the parallel iteration. */
4565 return verify_gimple_debug (stmt
);
4572 /* Verify the contents of a GIMPLE_PHI. Returns true if there is a problem,
4573 and false otherwise. */
4576 verify_gimple_phi (gimple phi
)
4580 tree phi_result
= gimple_phi_result (phi
);
4585 error ("invalid PHI result");
4589 virtual_p
= virtual_operand_p (phi_result
);
4590 if (TREE_CODE (phi_result
) != SSA_NAME
4592 && SSA_NAME_VAR (phi_result
) != gimple_vop (cfun
)))
4594 error ("invalid PHI result");
4598 for (i
= 0; i
< gimple_phi_num_args (phi
); i
++)
4600 tree t
= gimple_phi_arg_def (phi
, i
);
4604 error ("missing PHI def");
4608 /* Addressable variables do have SSA_NAMEs but they
4609 are not considered gimple values. */
4610 else if ((TREE_CODE (t
) == SSA_NAME
4611 && virtual_p
!= virtual_operand_p (t
))
4613 && (TREE_CODE (t
) != SSA_NAME
4614 || SSA_NAME_VAR (t
) != gimple_vop (cfun
)))
4616 && !is_gimple_val (t
)))
4618 error ("invalid PHI argument");
4619 debug_generic_expr (t
);
4622 #ifdef ENABLE_TYPES_CHECKING
4623 if (!useless_type_conversion_p (TREE_TYPE (phi_result
), TREE_TYPE (t
)))
4625 error ("incompatible types in PHI argument %u", i
);
4626 debug_generic_stmt (TREE_TYPE (phi_result
));
4627 debug_generic_stmt (TREE_TYPE (t
));
4636 /* Verify the GIMPLE statements inside the sequence STMTS. */
4639 verify_gimple_in_seq_2 (gimple_seq stmts
)
4641 gimple_stmt_iterator ittr
;
4644 for (ittr
= gsi_start (stmts
); !gsi_end_p (ittr
); gsi_next (&ittr
))
4646 gimple stmt
= gsi_stmt (ittr
);
4648 switch (gimple_code (stmt
))
4651 err
|= verify_gimple_in_seq_2 (
4652 gimple_bind_body (as_a
<gbind
*> (stmt
)));
4656 err
|= verify_gimple_in_seq_2 (gimple_try_eval (stmt
));
4657 err
|= verify_gimple_in_seq_2 (gimple_try_cleanup (stmt
));
4660 case GIMPLE_EH_FILTER
:
4661 err
|= verify_gimple_in_seq_2 (gimple_eh_filter_failure (stmt
));
4664 case GIMPLE_EH_ELSE
:
4666 geh_else
*eh_else
= as_a
<geh_else
*> (stmt
);
4667 err
|= verify_gimple_in_seq_2 (gimple_eh_else_n_body (eh_else
));
4668 err
|= verify_gimple_in_seq_2 (gimple_eh_else_e_body (eh_else
));
4673 err
|= verify_gimple_in_seq_2 (gimple_catch_handler (
4674 as_a
<gcatch
*> (stmt
)));
4677 case GIMPLE_TRANSACTION
:
4678 err
|= verify_gimple_transaction (as_a
<gtransaction
*> (stmt
));
4683 bool err2
= verify_gimple_stmt (stmt
);
4685 debug_gimple_stmt (stmt
);
4694 /* Verify the contents of a GIMPLE_TRANSACTION. Returns true if there
4695 is a problem, otherwise false. */
4698 verify_gimple_transaction (gtransaction
*stmt
)
4700 tree lab
= gimple_transaction_label (stmt
);
4701 if (lab
!= NULL
&& TREE_CODE (lab
) != LABEL_DECL
)
4703 return verify_gimple_in_seq_2 (gimple_transaction_body (stmt
));
4707 /* Verify the GIMPLE statements inside the statement list STMTS. */
4710 verify_gimple_in_seq (gimple_seq stmts
)
4712 timevar_push (TV_TREE_STMT_VERIFY
);
4713 if (verify_gimple_in_seq_2 (stmts
))
4714 internal_error ("verify_gimple failed");
4715 timevar_pop (TV_TREE_STMT_VERIFY
);
4718 /* Return true when the T can be shared. */
4721 tree_node_can_be_shared (tree t
)
4723 if (IS_TYPE_OR_DECL_P (t
)
4724 || is_gimple_min_invariant (t
)
4725 || TREE_CODE (t
) == SSA_NAME
4726 || t
== error_mark_node
4727 || TREE_CODE (t
) == IDENTIFIER_NODE
)
4730 if (TREE_CODE (t
) == CASE_LABEL_EXPR
)
4739 /* Called via walk_tree. Verify tree sharing. */
4742 verify_node_sharing_1 (tree
*tp
, int *walk_subtrees
, void *data
)
4744 hash_set
<void *> *visited
= (hash_set
<void *> *) data
;
4746 if (tree_node_can_be_shared (*tp
))
4748 *walk_subtrees
= false;
4752 if (visited
->add (*tp
))
4758 /* Called via walk_gimple_stmt. Verify tree sharing. */
4761 verify_node_sharing (tree
*tp
, int *walk_subtrees
, void *data
)
4763 struct walk_stmt_info
*wi
= (struct walk_stmt_info
*) data
;
4764 return verify_node_sharing_1 (tp
, walk_subtrees
, wi
->info
);
4767 static bool eh_error_found
;
4769 verify_eh_throw_stmt_node (const gimple
&stmt
, const int &,
4770 hash_set
<gimple
> *visited
)
4772 if (!visited
->contains (stmt
))
4774 error ("dead STMT in EH table");
4775 debug_gimple_stmt (stmt
);
4776 eh_error_found
= true;
4781 /* Verify if the location LOCs block is in BLOCKS. */
4784 verify_location (hash_set
<tree
> *blocks
, location_t loc
)
4786 tree block
= LOCATION_BLOCK (loc
);
4787 if (block
!= NULL_TREE
4788 && !blocks
->contains (block
))
4790 error ("location references block not in block tree");
4793 if (block
!= NULL_TREE
)
4794 return verify_location (blocks
, BLOCK_SOURCE_LOCATION (block
));
4798 /* Called via walk_tree. Verify that expressions have no blocks. */
4801 verify_expr_no_block (tree
*tp
, int *walk_subtrees
, void *)
4805 *walk_subtrees
= false;
4809 location_t loc
= EXPR_LOCATION (*tp
);
4810 if (LOCATION_BLOCK (loc
) != NULL
)
4816 /* Called via walk_tree. Verify locations of expressions. */
4819 verify_expr_location_1 (tree
*tp
, int *walk_subtrees
, void *data
)
4821 hash_set
<tree
> *blocks
= (hash_set
<tree
> *) data
;
4823 if (TREE_CODE (*tp
) == VAR_DECL
4824 && DECL_HAS_DEBUG_EXPR_P (*tp
))
4826 tree t
= DECL_DEBUG_EXPR (*tp
);
4827 tree addr
= walk_tree (&t
, verify_expr_no_block
, NULL
, NULL
);
4831 if ((TREE_CODE (*tp
) == VAR_DECL
4832 || TREE_CODE (*tp
) == PARM_DECL
4833 || TREE_CODE (*tp
) == RESULT_DECL
)
4834 && DECL_HAS_VALUE_EXPR_P (*tp
))
4836 tree t
= DECL_VALUE_EXPR (*tp
);
4837 tree addr
= walk_tree (&t
, verify_expr_no_block
, NULL
, NULL
);
4844 *walk_subtrees
= false;
4848 location_t loc
= EXPR_LOCATION (*tp
);
4849 if (verify_location (blocks
, loc
))
4855 /* Called via walk_gimple_op. Verify locations of expressions. */
4858 verify_expr_location (tree
*tp
, int *walk_subtrees
, void *data
)
4860 struct walk_stmt_info
*wi
= (struct walk_stmt_info
*) data
;
4861 return verify_expr_location_1 (tp
, walk_subtrees
, wi
->info
);
4864 /* Insert all subblocks of BLOCK into BLOCKS and recurse. */
4867 collect_subblocks (hash_set
<tree
> *blocks
, tree block
)
4870 for (t
= BLOCK_SUBBLOCKS (block
); t
; t
= BLOCK_CHAIN (t
))
4873 collect_subblocks (blocks
, t
);
4877 /* Verify the GIMPLE statements in the CFG of FN. */
4880 verify_gimple_in_cfg (struct function
*fn
, bool verify_nothrow
)
4885 timevar_push (TV_TREE_STMT_VERIFY
);
4886 hash_set
<void *> visited
;
4887 hash_set
<gimple
> visited_stmts
;
4889 /* Collect all BLOCKs referenced by the BLOCK tree of FN. */
4890 hash_set
<tree
> blocks
;
4891 if (DECL_INITIAL (fn
->decl
))
4893 blocks
.add (DECL_INITIAL (fn
->decl
));
4894 collect_subblocks (&blocks
, DECL_INITIAL (fn
->decl
));
4897 FOR_EACH_BB_FN (bb
, fn
)
4899 gimple_stmt_iterator gsi
;
4901 for (gphi_iterator gpi
= gsi_start_phis (bb
);
4905 gphi
*phi
= gpi
.phi ();
4909 visited_stmts
.add (phi
);
4911 if (gimple_bb (phi
) != bb
)
4913 error ("gimple_bb (phi) is set to a wrong basic block");
4917 err2
|= verify_gimple_phi (phi
);
4919 /* Only PHI arguments have locations. */
4920 if (gimple_location (phi
) != UNKNOWN_LOCATION
)
4922 error ("PHI node with location");
4926 for (i
= 0; i
< gimple_phi_num_args (phi
); i
++)
4928 tree arg
= gimple_phi_arg_def (phi
, i
);
4929 tree addr
= walk_tree (&arg
, verify_node_sharing_1
,
4933 error ("incorrect sharing of tree nodes");
4934 debug_generic_expr (addr
);
4937 location_t loc
= gimple_phi_arg_location (phi
, i
);
4938 if (virtual_operand_p (gimple_phi_result (phi
))
4939 && loc
!= UNKNOWN_LOCATION
)
4941 error ("virtual PHI with argument locations");
4944 addr
= walk_tree (&arg
, verify_expr_location_1
, &blocks
, NULL
);
4947 debug_generic_expr (addr
);
4950 err2
|= verify_location (&blocks
, loc
);
4954 debug_gimple_stmt (phi
);
4958 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
4960 gimple stmt
= gsi_stmt (gsi
);
4962 struct walk_stmt_info wi
;
4966 visited_stmts
.add (stmt
);
4968 if (gimple_bb (stmt
) != bb
)
4970 error ("gimple_bb (stmt) is set to a wrong basic block");
4974 err2
|= verify_gimple_stmt (stmt
);
4975 err2
|= verify_location (&blocks
, gimple_location (stmt
));
4977 memset (&wi
, 0, sizeof (wi
));
4978 wi
.info
= (void *) &visited
;
4979 addr
= walk_gimple_op (stmt
, verify_node_sharing
, &wi
);
4982 error ("incorrect sharing of tree nodes");
4983 debug_generic_expr (addr
);
4987 memset (&wi
, 0, sizeof (wi
));
4988 wi
.info
= (void *) &blocks
;
4989 addr
= walk_gimple_op (stmt
, verify_expr_location
, &wi
);
4992 debug_generic_expr (addr
);
4996 /* ??? Instead of not checking these stmts at all the walker
4997 should know its context via wi. */
4998 if (!is_gimple_debug (stmt
)
4999 && !is_gimple_omp (stmt
))
5001 memset (&wi
, 0, sizeof (wi
));
5002 addr
= walk_gimple_op (stmt
, verify_expr
, &wi
);
5005 debug_generic_expr (addr
);
5006 inform (gimple_location (stmt
), "in statement");
5011 /* If the statement is marked as part of an EH region, then it is
5012 expected that the statement could throw. Verify that when we
5013 have optimizations that simplify statements such that we prove
5014 that they cannot throw, that we update other data structures
5016 lp_nr
= lookup_stmt_eh_lp (stmt
);
5019 if (!stmt_could_throw_p (stmt
))
5023 error ("statement marked for throw, but doesn%'t");
5027 else if (!gsi_one_before_end_p (gsi
))
5029 error ("statement marked for throw in middle of block");
5035 debug_gimple_stmt (stmt
);
5040 eh_error_found
= false;
5041 hash_map
<gimple
, int> *eh_table
= get_eh_throw_stmt_table (cfun
);
5043 eh_table
->traverse
<hash_set
<gimple
> *, verify_eh_throw_stmt_node
>
5046 if (err
|| eh_error_found
)
5047 internal_error ("verify_gimple failed");
5049 verify_histograms ();
5050 timevar_pop (TV_TREE_STMT_VERIFY
);
5054 /* Verifies that the flow information is OK. */
5057 gimple_verify_flow_info (void)
5061 gimple_stmt_iterator gsi
;
5066 if (ENTRY_BLOCK_PTR_FOR_FN (cfun
)->il
.gimple
.seq
5067 || ENTRY_BLOCK_PTR_FOR_FN (cfun
)->il
.gimple
.phi_nodes
)
5069 error ("ENTRY_BLOCK has IL associated with it");
5073 if (EXIT_BLOCK_PTR_FOR_FN (cfun
)->il
.gimple
.seq
5074 || EXIT_BLOCK_PTR_FOR_FN (cfun
)->il
.gimple
.phi_nodes
)
5076 error ("EXIT_BLOCK has IL associated with it");
5080 FOR_EACH_EDGE (e
, ei
, EXIT_BLOCK_PTR_FOR_FN (cfun
)->preds
)
5081 if (e
->flags
& EDGE_FALLTHRU
)
5083 error ("fallthru to exit from bb %d", e
->src
->index
);
5087 FOR_EACH_BB_FN (bb
, cfun
)
5089 bool found_ctrl_stmt
= false;
5093 /* Skip labels on the start of basic block. */
5094 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
5097 gimple prev_stmt
= stmt
;
5099 stmt
= gsi_stmt (gsi
);
5101 if (gimple_code (stmt
) != GIMPLE_LABEL
)
5104 label
= gimple_label_label (as_a
<glabel
*> (stmt
));
5105 if (prev_stmt
&& DECL_NONLOCAL (label
))
5107 error ("nonlocal label ");
5108 print_generic_expr (stderr
, label
, 0);
5109 fprintf (stderr
, " is not first in a sequence of labels in bb %d",
5114 if (prev_stmt
&& EH_LANDING_PAD_NR (label
) != 0)
5116 error ("EH landing pad label ");
5117 print_generic_expr (stderr
, label
, 0);
5118 fprintf (stderr
, " is not first in a sequence of labels in bb %d",
5123 if (label_to_block (label
) != bb
)
5126 print_generic_expr (stderr
, label
, 0);
5127 fprintf (stderr
, " to block does not match in bb %d",
5132 if (decl_function_context (label
) != current_function_decl
)
5135 print_generic_expr (stderr
, label
, 0);
5136 fprintf (stderr
, " has incorrect context in bb %d",
5142 /* Verify that body of basic block BB is free of control flow. */
5143 for (; !gsi_end_p (gsi
); gsi_next (&gsi
))
5145 gimple stmt
= gsi_stmt (gsi
);
5147 if (found_ctrl_stmt
)
5149 error ("control flow in the middle of basic block %d",
5154 if (stmt_ends_bb_p (stmt
))
5155 found_ctrl_stmt
= true;
5157 if (glabel
*label_stmt
= dyn_cast
<glabel
*> (stmt
))
5160 print_generic_expr (stderr
, gimple_label_label (label_stmt
), 0);
5161 fprintf (stderr
, " in the middle of basic block %d", bb
->index
);
5166 gsi
= gsi_last_bb (bb
);
5167 if (gsi_end_p (gsi
))
5170 stmt
= gsi_stmt (gsi
);
5172 if (gimple_code (stmt
) == GIMPLE_LABEL
)
5175 err
|= verify_eh_edges (stmt
);
5177 if (is_ctrl_stmt (stmt
))
5179 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
5180 if (e
->flags
& EDGE_FALLTHRU
)
5182 error ("fallthru edge after a control statement in bb %d",
5188 if (gimple_code (stmt
) != GIMPLE_COND
)
5190 /* Verify that there are no edges with EDGE_TRUE/FALSE_FLAG set
5191 after anything else but if statement. */
5192 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
5193 if (e
->flags
& (EDGE_TRUE_VALUE
| EDGE_FALSE_VALUE
))
5195 error ("true/false edge after a non-GIMPLE_COND in bb %d",
5201 switch (gimple_code (stmt
))
5208 extract_true_false_edges_from_block (bb
, &true_edge
, &false_edge
);
5212 || !(true_edge
->flags
& EDGE_TRUE_VALUE
)
5213 || !(false_edge
->flags
& EDGE_FALSE_VALUE
)
5214 || (true_edge
->flags
& (EDGE_FALLTHRU
| EDGE_ABNORMAL
))
5215 || (false_edge
->flags
& (EDGE_FALLTHRU
| EDGE_ABNORMAL
))
5216 || EDGE_COUNT (bb
->succs
) >= 3)
5218 error ("wrong outgoing edge flags at end of bb %d",
5226 if (simple_goto_p (stmt
))
5228 error ("explicit goto at end of bb %d", bb
->index
);
5233 /* FIXME. We should double check that the labels in the
5234 destination blocks have their address taken. */
5235 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
5236 if ((e
->flags
& (EDGE_FALLTHRU
| EDGE_TRUE_VALUE
5237 | EDGE_FALSE_VALUE
))
5238 || !(e
->flags
& EDGE_ABNORMAL
))
5240 error ("wrong outgoing edge flags at end of bb %d",
5248 if (!gimple_call_builtin_p (stmt
, BUILT_IN_RETURN
))
5250 /* ... fallthru ... */
5252 if (!single_succ_p (bb
)
5253 || (single_succ_edge (bb
)->flags
5254 & (EDGE_FALLTHRU
| EDGE_ABNORMAL
5255 | EDGE_TRUE_VALUE
| EDGE_FALSE_VALUE
)))
5257 error ("wrong outgoing edge flags at end of bb %d", bb
->index
);
5260 if (single_succ (bb
) != EXIT_BLOCK_PTR_FOR_FN (cfun
))
5262 error ("return edge does not point to exit in bb %d",
5270 gswitch
*switch_stmt
= as_a
<gswitch
*> (stmt
);
5275 n
= gimple_switch_num_labels (switch_stmt
);
5277 /* Mark all the destination basic blocks. */
5278 for (i
= 0; i
< n
; ++i
)
5280 tree lab
= CASE_LABEL (gimple_switch_label (switch_stmt
, i
));
5281 basic_block label_bb
= label_to_block (lab
);
5282 gcc_assert (!label_bb
->aux
|| label_bb
->aux
== (void *)1);
5283 label_bb
->aux
= (void *)1;
5286 /* Verify that the case labels are sorted. */
5287 prev
= gimple_switch_label (switch_stmt
, 0);
5288 for (i
= 1; i
< n
; ++i
)
5290 tree c
= gimple_switch_label (switch_stmt
, i
);
5293 error ("found default case not at the start of "
5299 && !tree_int_cst_lt (CASE_LOW (prev
), CASE_LOW (c
)))
5301 error ("case labels not sorted: ");
5302 print_generic_expr (stderr
, prev
, 0);
5303 fprintf (stderr
," is greater than ");
5304 print_generic_expr (stderr
, c
, 0);
5305 fprintf (stderr
," but comes before it.\n");
5310 /* VRP will remove the default case if it can prove it will
5311 never be executed. So do not verify there always exists
5312 a default case here. */
5314 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
5318 error ("extra outgoing edge %d->%d",
5319 bb
->index
, e
->dest
->index
);
5323 e
->dest
->aux
= (void *)2;
5324 if ((e
->flags
& (EDGE_FALLTHRU
| EDGE_ABNORMAL
5325 | EDGE_TRUE_VALUE
| EDGE_FALSE_VALUE
)))
5327 error ("wrong outgoing edge flags at end of bb %d",
5333 /* Check that we have all of them. */
5334 for (i
= 0; i
< n
; ++i
)
5336 tree lab
= CASE_LABEL (gimple_switch_label (switch_stmt
, i
));
5337 basic_block label_bb
= label_to_block (lab
);
5339 if (label_bb
->aux
!= (void *)2)
5341 error ("missing edge %i->%i", bb
->index
, label_bb
->index
);
5346 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
5347 e
->dest
->aux
= (void *)0;
5351 case GIMPLE_EH_DISPATCH
:
5352 err
|= verify_eh_dispatch_edge (as_a
<geh_dispatch
*> (stmt
));
5360 if (dom_info_state (CDI_DOMINATORS
) >= DOM_NO_FAST_QUERY
)
5361 verify_dominators (CDI_DOMINATORS
);
5367 /* Updates phi nodes after creating a forwarder block joined
5368 by edge FALLTHRU. */
5371 gimple_make_forwarder_block (edge fallthru
)
5375 basic_block dummy
, bb
;
5379 dummy
= fallthru
->src
;
5380 bb
= fallthru
->dest
;
5382 if (single_pred_p (bb
))
5385 /* If we redirected a branch we must create new PHI nodes at the
5387 for (gsi
= gsi_start_phis (dummy
); !gsi_end_p (gsi
); gsi_next (&gsi
))
5389 gphi
*phi
, *new_phi
;
5392 var
= gimple_phi_result (phi
);
5393 new_phi
= create_phi_node (var
, bb
);
5394 gimple_phi_set_result (phi
, copy_ssa_name (var
, phi
));
5395 add_phi_arg (new_phi
, gimple_phi_result (phi
), fallthru
,
5399 /* Add the arguments we have stored on edges. */
5400 FOR_EACH_EDGE (e
, ei
, bb
->preds
)
5405 flush_pending_stmts (e
);
5410 /* Return a non-special label in the head of basic block BLOCK.
5411 Create one if it doesn't exist. */
5414 gimple_block_label (basic_block bb
)
5416 gimple_stmt_iterator i
, s
= gsi_start_bb (bb
);
5421 for (i
= s
; !gsi_end_p (i
); first
= false, gsi_next (&i
))
5423 stmt
= dyn_cast
<glabel
*> (gsi_stmt (i
));
5426 label
= gimple_label_label (stmt
);
5427 if (!DECL_NONLOCAL (label
))
5430 gsi_move_before (&i
, &s
);
5435 label
= create_artificial_label (UNKNOWN_LOCATION
);
5436 stmt
= gimple_build_label (label
);
5437 gsi_insert_before (&s
, stmt
, GSI_NEW_STMT
);
5442 /* Attempt to perform edge redirection by replacing a possibly complex
5443 jump instruction by a goto or by removing the jump completely.
5444 This can apply only if all edges now point to the same block. The
5445 parameters and return values are equivalent to
5446 redirect_edge_and_branch. */
5449 gimple_try_redirect_by_replacing_jump (edge e
, basic_block target
)
5451 basic_block src
= e
->src
;
5452 gimple_stmt_iterator i
;
5455 /* We can replace or remove a complex jump only when we have exactly
5457 if (EDGE_COUNT (src
->succs
) != 2
5458 /* Verify that all targets will be TARGET. Specifically, the
5459 edge that is not E must also go to TARGET. */
5460 || EDGE_SUCC (src
, EDGE_SUCC (src
, 0) == e
)->dest
!= target
)
5463 i
= gsi_last_bb (src
);
5467 stmt
= gsi_stmt (i
);
5469 if (gimple_code (stmt
) == GIMPLE_COND
|| gimple_code (stmt
) == GIMPLE_SWITCH
)
5471 gsi_remove (&i
, true);
5472 e
= ssa_redirect_edge (e
, target
);
5473 e
->flags
= EDGE_FALLTHRU
;
5481 /* Redirect E to DEST. Return NULL on failure. Otherwise, return the
5482 edge representing the redirected branch. */
5485 gimple_redirect_edge_and_branch (edge e
, basic_block dest
)
5487 basic_block bb
= e
->src
;
5488 gimple_stmt_iterator gsi
;
5492 if (e
->flags
& EDGE_ABNORMAL
)
5495 if (e
->dest
== dest
)
5498 if (e
->flags
& EDGE_EH
)
5499 return redirect_eh_edge (e
, dest
);
5501 if (e
->src
!= ENTRY_BLOCK_PTR_FOR_FN (cfun
))
5503 ret
= gimple_try_redirect_by_replacing_jump (e
, dest
);
5508 gsi
= gsi_last_bb (bb
);
5509 stmt
= gsi_end_p (gsi
) ? NULL
: gsi_stmt (gsi
);
5511 switch (stmt
? gimple_code (stmt
) : GIMPLE_ERROR_MARK
)
5514 /* For COND_EXPR, we only need to redirect the edge. */
5518 /* No non-abnormal edges should lead from a non-simple goto, and
5519 simple ones should be represented implicitly. */
5524 gswitch
*switch_stmt
= as_a
<gswitch
*> (stmt
);
5525 tree label
= gimple_block_label (dest
);
5526 tree cases
= get_cases_for_edge (e
, switch_stmt
);
5528 /* If we have a list of cases associated with E, then use it
5529 as it's a lot faster than walking the entire case vector. */
5532 edge e2
= find_edge (e
->src
, dest
);
5539 CASE_LABEL (cases
) = label
;
5540 cases
= CASE_CHAIN (cases
);
5543 /* If there was already an edge in the CFG, then we need
5544 to move all the cases associated with E to E2. */
5547 tree cases2
= get_cases_for_edge (e2
, switch_stmt
);
5549 CASE_CHAIN (last
) = CASE_CHAIN (cases2
);
5550 CASE_CHAIN (cases2
) = first
;
5552 bitmap_set_bit (touched_switch_bbs
, gimple_bb (stmt
)->index
);
5556 size_t i
, n
= gimple_switch_num_labels (switch_stmt
);
5558 for (i
= 0; i
< n
; i
++)
5560 tree elt
= gimple_switch_label (switch_stmt
, i
);
5561 if (label_to_block (CASE_LABEL (elt
)) == e
->dest
)
5562 CASE_LABEL (elt
) = label
;
5570 gasm
*asm_stmt
= as_a
<gasm
*> (stmt
);
5571 int i
, n
= gimple_asm_nlabels (asm_stmt
);
5574 for (i
= 0; i
< n
; ++i
)
5576 tree cons
= gimple_asm_label_op (asm_stmt
, i
);
5577 if (label_to_block (TREE_VALUE (cons
)) == e
->dest
)
5580 label
= gimple_block_label (dest
);
5581 TREE_VALUE (cons
) = label
;
5585 /* If we didn't find any label matching the former edge in the
5586 asm labels, we must be redirecting the fallthrough
5588 gcc_assert (label
|| (e
->flags
& EDGE_FALLTHRU
));
5593 gsi_remove (&gsi
, true);
5594 e
->flags
|= EDGE_FALLTHRU
;
5597 case GIMPLE_OMP_RETURN
:
5598 case GIMPLE_OMP_CONTINUE
:
5599 case GIMPLE_OMP_SECTIONS_SWITCH
:
5600 case GIMPLE_OMP_FOR
:
5601 /* The edges from OMP constructs can be simply redirected. */
5604 case GIMPLE_EH_DISPATCH
:
5605 if (!(e
->flags
& EDGE_FALLTHRU
))
5606 redirect_eh_dispatch_edge (as_a
<geh_dispatch
*> (stmt
), e
, dest
);
5609 case GIMPLE_TRANSACTION
:
5610 /* The ABORT edge has a stored label associated with it, otherwise
5611 the edges are simply redirectable. */
5613 gimple_transaction_set_label (as_a
<gtransaction
*> (stmt
),
5614 gimple_block_label (dest
));
5618 /* Otherwise it must be a fallthru edge, and we don't need to
5619 do anything besides redirecting it. */
5620 gcc_assert (e
->flags
& EDGE_FALLTHRU
);
5624 /* Update/insert PHI nodes as necessary. */
5626 /* Now update the edges in the CFG. */
5627 e
= ssa_redirect_edge (e
, dest
);
5632 /* Returns true if it is possible to remove edge E by redirecting
5633 it to the destination of the other edge from E->src. */
5636 gimple_can_remove_branch_p (const_edge e
)
5638 if (e
->flags
& (EDGE_ABNORMAL
| EDGE_EH
))
5644 /* Simple wrapper, as we can always redirect fallthru edges. */
5647 gimple_redirect_edge_and_branch_force (edge e
, basic_block dest
)
5649 e
= gimple_redirect_edge_and_branch (e
, dest
);
5656 /* Splits basic block BB after statement STMT (but at least after the
5657 labels). If STMT is NULL, BB is split just after the labels. */
5660 gimple_split_block (basic_block bb
, void *stmt
)
5662 gimple_stmt_iterator gsi
;
5663 gimple_stmt_iterator gsi_tgt
;
5670 new_bb
= create_empty_bb (bb
);
5672 /* Redirect the outgoing edges. */
5673 new_bb
->succs
= bb
->succs
;
5675 FOR_EACH_EDGE (e
, ei
, new_bb
->succs
)
5678 if (stmt
&& gimple_code ((gimple
) stmt
) == GIMPLE_LABEL
)
5681 /* Move everything from GSI to the new basic block. */
5682 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
5684 act
= gsi_stmt (gsi
);
5685 if (gimple_code (act
) == GIMPLE_LABEL
)
5698 if (gsi_end_p (gsi
))
5701 /* Split the statement list - avoid re-creating new containers as this
5702 brings ugly quadratic memory consumption in the inliner.
5703 (We are still quadratic since we need to update stmt BB pointers,
5705 gsi_split_seq_before (&gsi
, &list
);
5706 set_bb_seq (new_bb
, list
);
5707 for (gsi_tgt
= gsi_start (list
);
5708 !gsi_end_p (gsi_tgt
); gsi_next (&gsi_tgt
))
5709 gimple_set_bb (gsi_stmt (gsi_tgt
), new_bb
);
5715 /* Moves basic block BB after block AFTER. */
5718 gimple_move_block_after (basic_block bb
, basic_block after
)
5720 if (bb
->prev_bb
== after
)
5724 link_block (bb
, after
);
5730 /* Return TRUE if block BB has no executable statements, otherwise return
5734 gimple_empty_block_p (basic_block bb
)
5736 /* BB must have no executable statements. */
5737 gimple_stmt_iterator gsi
= gsi_after_labels (bb
);
5740 if (gsi_end_p (gsi
))
5742 if (is_gimple_debug (gsi_stmt (gsi
)))
5743 gsi_next_nondebug (&gsi
);
5744 return gsi_end_p (gsi
);
5748 /* Split a basic block if it ends with a conditional branch and if the
5749 other part of the block is not empty. */
5752 gimple_split_block_before_cond_jump (basic_block bb
)
5754 gimple last
, split_point
;
5755 gimple_stmt_iterator gsi
= gsi_last_nondebug_bb (bb
);
5756 if (gsi_end_p (gsi
))
5758 last
= gsi_stmt (gsi
);
5759 if (gimple_code (last
) != GIMPLE_COND
5760 && gimple_code (last
) != GIMPLE_SWITCH
)
5762 gsi_prev_nondebug (&gsi
);
5763 split_point
= gsi_stmt (gsi
);
5764 return split_block (bb
, split_point
)->dest
;
5768 /* Return true if basic_block can be duplicated. */
5771 gimple_can_duplicate_bb_p (const_basic_block bb ATTRIBUTE_UNUSED
)
5776 /* Create a duplicate of the basic block BB. NOTE: This does not
5777 preserve SSA form. */
5780 gimple_duplicate_bb (basic_block bb
)
5783 gimple_stmt_iterator gsi_tgt
;
5785 new_bb
= create_empty_bb (EXIT_BLOCK_PTR_FOR_FN (cfun
)->prev_bb
);
5787 /* Copy the PHI nodes. We ignore PHI node arguments here because
5788 the incoming edges have not been setup yet. */
5789 for (gphi_iterator gpi
= gsi_start_phis (bb
);
5795 copy
= create_phi_node (NULL_TREE
, new_bb
);
5796 create_new_def_for (gimple_phi_result (phi
), copy
,
5797 gimple_phi_result_ptr (copy
));
5798 gimple_set_uid (copy
, gimple_uid (phi
));
5801 gsi_tgt
= gsi_start_bb (new_bb
);
5802 for (gimple_stmt_iterator gsi
= gsi_start_bb (bb
);
5806 def_operand_p def_p
;
5807 ssa_op_iter op_iter
;
5811 stmt
= gsi_stmt (gsi
);
5812 if (gimple_code (stmt
) == GIMPLE_LABEL
)
5815 /* Don't duplicate label debug stmts. */
5816 if (gimple_debug_bind_p (stmt
)
5817 && TREE_CODE (gimple_debug_bind_get_var (stmt
))
5821 /* Create a new copy of STMT and duplicate STMT's virtual
5823 copy
= gimple_copy (stmt
);
5824 gsi_insert_after (&gsi_tgt
, copy
, GSI_NEW_STMT
);
5826 maybe_duplicate_eh_stmt (copy
, stmt
);
5827 gimple_duplicate_stmt_histograms (cfun
, copy
, cfun
, stmt
);
5829 /* When copying around a stmt writing into a local non-user
5830 aggregate, make sure it won't share stack slot with other
5832 lhs
= gimple_get_lhs (stmt
);
5833 if (lhs
&& TREE_CODE (lhs
) != SSA_NAME
)
5835 tree base
= get_base_address (lhs
);
5837 && (TREE_CODE (base
) == VAR_DECL
5838 || TREE_CODE (base
) == RESULT_DECL
)
5839 && DECL_IGNORED_P (base
)
5840 && !TREE_STATIC (base
)
5841 && !DECL_EXTERNAL (base
)
5842 && (TREE_CODE (base
) != VAR_DECL
5843 || !DECL_HAS_VALUE_EXPR_P (base
)))
5844 DECL_NONSHAREABLE (base
) = 1;
5847 /* Create new names for all the definitions created by COPY and
5848 add replacement mappings for each new name. */
5849 FOR_EACH_SSA_DEF_OPERAND (def_p
, copy
, op_iter
, SSA_OP_ALL_DEFS
)
5850 create_new_def_for (DEF_FROM_PTR (def_p
), copy
, def_p
);
5856 /* Adds phi node arguments for edge E_COPY after basic block duplication. */
5859 add_phi_args_after_copy_edge (edge e_copy
)
5861 basic_block bb
, bb_copy
= e_copy
->src
, dest
;
5864 gphi
*phi
, *phi_copy
;
5866 gphi_iterator psi
, psi_copy
;
5868 if (gimple_seq_empty_p (phi_nodes (e_copy
->dest
)))
5871 bb
= bb_copy
->flags
& BB_DUPLICATED
? get_bb_original (bb_copy
) : bb_copy
;
5873 if (e_copy
->dest
->flags
& BB_DUPLICATED
)
5874 dest
= get_bb_original (e_copy
->dest
);
5876 dest
= e_copy
->dest
;
5878 e
= find_edge (bb
, dest
);
5881 /* During loop unrolling the target of the latch edge is copied.
5882 In this case we are not looking for edge to dest, but to
5883 duplicated block whose original was dest. */
5884 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
5886 if ((e
->dest
->flags
& BB_DUPLICATED
)
5887 && get_bb_original (e
->dest
) == dest
)
5891 gcc_assert (e
!= NULL
);
5894 for (psi
= gsi_start_phis (e
->dest
),
5895 psi_copy
= gsi_start_phis (e_copy
->dest
);
5897 gsi_next (&psi
), gsi_next (&psi_copy
))
5900 phi_copy
= psi_copy
.phi ();
5901 def
= PHI_ARG_DEF_FROM_EDGE (phi
, e
);
5902 add_phi_arg (phi_copy
, def
, e_copy
,
5903 gimple_phi_arg_location_from_edge (phi
, e
));
5908 /* Basic block BB_COPY was created by code duplication. Add phi node
5909 arguments for edges going out of BB_COPY. The blocks that were
5910 duplicated have BB_DUPLICATED set. */
5913 add_phi_args_after_copy_bb (basic_block bb_copy
)
5918 FOR_EACH_EDGE (e_copy
, ei
, bb_copy
->succs
)
5920 add_phi_args_after_copy_edge (e_copy
);
5924 /* Blocks in REGION_COPY array of length N_REGION were created by
5925 duplication of basic blocks. Add phi node arguments for edges
5926 going from these blocks. If E_COPY is not NULL, also add
5927 phi node arguments for its destination.*/
5930 add_phi_args_after_copy (basic_block
*region_copy
, unsigned n_region
,
5935 for (i
= 0; i
< n_region
; i
++)
5936 region_copy
[i
]->flags
|= BB_DUPLICATED
;
5938 for (i
= 0; i
< n_region
; i
++)
5939 add_phi_args_after_copy_bb (region_copy
[i
]);
5941 add_phi_args_after_copy_edge (e_copy
);
5943 for (i
= 0; i
< n_region
; i
++)
5944 region_copy
[i
]->flags
&= ~BB_DUPLICATED
;
5947 /* Duplicates a REGION (set of N_REGION basic blocks) with just a single
5948 important exit edge EXIT. By important we mean that no SSA name defined
5949 inside region is live over the other exit edges of the region. All entry
5950 edges to the region must go to ENTRY->dest. The edge ENTRY is redirected
5951 to the duplicate of the region. Dominance and loop information is
5952 updated if UPDATE_DOMINANCE is true, but not the SSA web. If
5953 UPDATE_DOMINANCE is false then we assume that the caller will update the
5954 dominance information after calling this function. The new basic
5955 blocks are stored to REGION_COPY in the same order as they had in REGION,
5956 provided that REGION_COPY is not NULL.
5957 The function returns false if it is unable to copy the region,
5961 gimple_duplicate_sese_region (edge entry
, edge exit
,
5962 basic_block
*region
, unsigned n_region
,
5963 basic_block
*region_copy
,
5964 bool update_dominance
)
5967 bool free_region_copy
= false, copying_header
= false;
5968 struct loop
*loop
= entry
->dest
->loop_father
;
5970 vec
<basic_block
> doms
;
5972 int total_freq
= 0, entry_freq
= 0;
5973 gcov_type total_count
= 0, entry_count
= 0;
5975 if (!can_copy_bbs_p (region
, n_region
))
5978 /* Some sanity checking. Note that we do not check for all possible
5979 missuses of the functions. I.e. if you ask to copy something weird,
5980 it will work, but the state of structures probably will not be
5982 for (i
= 0; i
< n_region
; i
++)
5984 /* We do not handle subloops, i.e. all the blocks must belong to the
5986 if (region
[i
]->loop_father
!= loop
)
5989 if (region
[i
] != entry
->dest
5990 && region
[i
] == loop
->header
)
5994 /* In case the function is used for loop header copying (which is the primary
5995 use), ensure that EXIT and its copy will be new latch and entry edges. */
5996 if (loop
->header
== entry
->dest
)
5998 copying_header
= true;
6000 if (!dominated_by_p (CDI_DOMINATORS
, loop
->latch
, exit
->src
))
6003 for (i
= 0; i
< n_region
; i
++)
6004 if (region
[i
] != exit
->src
6005 && dominated_by_p (CDI_DOMINATORS
, region
[i
], exit
->src
))
6009 initialize_original_copy_tables ();
6012 set_loop_copy (loop
, loop_outer (loop
));
6014 set_loop_copy (loop
, loop
);
6018 region_copy
= XNEWVEC (basic_block
, n_region
);
6019 free_region_copy
= true;
6022 /* Record blocks outside the region that are dominated by something
6024 if (update_dominance
)
6027 doms
= get_dominated_by_region (CDI_DOMINATORS
, region
, n_region
);
6030 if (entry
->dest
->count
)
6032 total_count
= entry
->dest
->count
;
6033 entry_count
= entry
->count
;
6034 /* Fix up corner cases, to avoid division by zero or creation of negative
6036 if (entry_count
> total_count
)
6037 entry_count
= total_count
;
6041 total_freq
= entry
->dest
->frequency
;
6042 entry_freq
= EDGE_FREQUENCY (entry
);
6043 /* Fix up corner cases, to avoid division by zero or creation of negative
6045 if (total_freq
== 0)
6047 else if (entry_freq
> total_freq
)
6048 entry_freq
= total_freq
;
6051 copy_bbs (region
, n_region
, region_copy
, &exit
, 1, &exit_copy
, loop
,
6052 split_edge_bb_loc (entry
), update_dominance
);
6055 scale_bbs_frequencies_gcov_type (region
, n_region
,
6056 total_count
- entry_count
,
6058 scale_bbs_frequencies_gcov_type (region_copy
, n_region
, entry_count
,
6063 scale_bbs_frequencies_int (region
, n_region
, total_freq
- entry_freq
,
6065 scale_bbs_frequencies_int (region_copy
, n_region
, entry_freq
, total_freq
);
6070 loop
->header
= exit
->dest
;
6071 loop
->latch
= exit
->src
;
6074 /* Redirect the entry and add the phi node arguments. */
6075 redirected
= redirect_edge_and_branch (entry
, get_bb_copy (entry
->dest
));
6076 gcc_assert (redirected
!= NULL
);
6077 flush_pending_stmts (entry
);
6079 /* Concerning updating of dominators: We must recount dominators
6080 for entry block and its copy. Anything that is outside of the
6081 region, but was dominated by something inside needs recounting as
6083 if (update_dominance
)
6085 set_immediate_dominator (CDI_DOMINATORS
, entry
->dest
, entry
->src
);
6086 doms
.safe_push (get_bb_original (entry
->dest
));
6087 iterate_fix_dominators (CDI_DOMINATORS
, doms
, false);
6091 /* Add the other PHI node arguments. */
6092 add_phi_args_after_copy (region_copy
, n_region
, NULL
);
6094 if (free_region_copy
)
6097 free_original_copy_tables ();
6101 /* Checks if BB is part of the region defined by N_REGION BBS. */
6103 bb_part_of_region_p (basic_block bb
, basic_block
* bbs
, unsigned n_region
)
6107 for (n
= 0; n
< n_region
; n
++)
6115 /* Duplicates REGION consisting of N_REGION blocks. The new blocks
6116 are stored to REGION_COPY in the same order in that they appear
6117 in REGION, if REGION_COPY is not NULL. ENTRY is the entry to
6118 the region, EXIT an exit from it. The condition guarding EXIT
6119 is moved to ENTRY. Returns true if duplication succeeds, false
6145 gimple_duplicate_sese_tail (edge entry ATTRIBUTE_UNUSED
, edge exit ATTRIBUTE_UNUSED
,
6146 basic_block
*region ATTRIBUTE_UNUSED
, unsigned n_region ATTRIBUTE_UNUSED
,
6147 basic_block
*region_copy ATTRIBUTE_UNUSED
)
6150 bool free_region_copy
= false;
6151 struct loop
*loop
= exit
->dest
->loop_father
;
6152 struct loop
*orig_loop
= entry
->dest
->loop_father
;
6153 basic_block switch_bb
, entry_bb
, nentry_bb
;
6154 vec
<basic_block
> doms
;
6155 int total_freq
= 0, exit_freq
= 0;
6156 gcov_type total_count
= 0, exit_count
= 0;
6157 edge exits
[2], nexits
[2], e
;
6158 gimple_stmt_iterator gsi
;
6161 basic_block exit_bb
;
6165 struct loop
*target
, *aloop
, *cloop
;
6167 gcc_assert (EDGE_COUNT (exit
->src
->succs
) == 2);
6169 exits
[1] = EDGE_SUCC (exit
->src
, EDGE_SUCC (exit
->src
, 0) == exit
);
6171 if (!can_copy_bbs_p (region
, n_region
))
6174 initialize_original_copy_tables ();
6175 set_loop_copy (orig_loop
, loop
);
6178 for (aloop
= orig_loop
->inner
; aloop
; aloop
= aloop
->next
)
6180 if (bb_part_of_region_p (aloop
->header
, region
, n_region
))
6182 cloop
= duplicate_loop (aloop
, target
);
6183 duplicate_subloops (aloop
, cloop
);
6189 region_copy
= XNEWVEC (basic_block
, n_region
);
6190 free_region_copy
= true;
6193 gcc_assert (!need_ssa_update_p (cfun
));
6195 /* Record blocks outside the region that are dominated by something
6197 doms
= get_dominated_by_region (CDI_DOMINATORS
, region
, n_region
);
6199 if (exit
->src
->count
)
6201 total_count
= exit
->src
->count
;
6202 exit_count
= exit
->count
;
6203 /* Fix up corner cases, to avoid division by zero or creation of negative
6205 if (exit_count
> total_count
)
6206 exit_count
= total_count
;
6210 total_freq
= exit
->src
->frequency
;
6211 exit_freq
= EDGE_FREQUENCY (exit
);
6212 /* Fix up corner cases, to avoid division by zero or creation of negative
6214 if (total_freq
== 0)
6216 if (exit_freq
> total_freq
)
6217 exit_freq
= total_freq
;
6220 copy_bbs (region
, n_region
, region_copy
, exits
, 2, nexits
, orig_loop
,
6221 split_edge_bb_loc (exit
), true);
6224 scale_bbs_frequencies_gcov_type (region
, n_region
,
6225 total_count
- exit_count
,
6227 scale_bbs_frequencies_gcov_type (region_copy
, n_region
, exit_count
,
6232 scale_bbs_frequencies_int (region
, n_region
, total_freq
- exit_freq
,
6234 scale_bbs_frequencies_int (region_copy
, n_region
, exit_freq
, total_freq
);
6237 /* Create the switch block, and put the exit condition to it. */
6238 entry_bb
= entry
->dest
;
6239 nentry_bb
= get_bb_copy (entry_bb
);
6240 if (!last_stmt (entry
->src
)
6241 || !stmt_ends_bb_p (last_stmt (entry
->src
)))
6242 switch_bb
= entry
->src
;
6244 switch_bb
= split_edge (entry
);
6245 set_immediate_dominator (CDI_DOMINATORS
, nentry_bb
, switch_bb
);
6247 gsi
= gsi_last_bb (switch_bb
);
6248 cond_stmt
= last_stmt (exit
->src
);
6249 gcc_assert (gimple_code (cond_stmt
) == GIMPLE_COND
);
6250 cond_stmt
= gimple_copy (cond_stmt
);
6252 gsi_insert_after (&gsi
, cond_stmt
, GSI_NEW_STMT
);
6254 sorig
= single_succ_edge (switch_bb
);
6255 sorig
->flags
= exits
[1]->flags
;
6256 snew
= make_edge (switch_bb
, nentry_bb
, exits
[0]->flags
);
6258 /* Register the new edge from SWITCH_BB in loop exit lists. */
6259 rescan_loop_exit (snew
, true, false);
6261 /* Add the PHI node arguments. */
6262 add_phi_args_after_copy (region_copy
, n_region
, snew
);
6264 /* Get rid of now superfluous conditions and associated edges (and phi node
6266 exit_bb
= exit
->dest
;
6268 e
= redirect_edge_and_branch (exits
[0], exits
[1]->dest
);
6269 PENDING_STMT (e
) = NULL
;
6271 /* The latch of ORIG_LOOP was copied, and so was the backedge
6272 to the original header. We redirect this backedge to EXIT_BB. */
6273 for (i
= 0; i
< n_region
; i
++)
6274 if (get_bb_original (region_copy
[i
]) == orig_loop
->latch
)
6276 gcc_assert (single_succ_edge (region_copy
[i
]));
6277 e
= redirect_edge_and_branch (single_succ_edge (region_copy
[i
]), exit_bb
);
6278 PENDING_STMT (e
) = NULL
;
6279 for (psi
= gsi_start_phis (exit_bb
);
6284 def
= PHI_ARG_DEF (phi
, nexits
[0]->dest_idx
);
6285 add_phi_arg (phi
, def
, e
, gimple_phi_arg_location_from_edge (phi
, e
));
6288 e
= redirect_edge_and_branch (nexits
[1], nexits
[0]->dest
);
6289 PENDING_STMT (e
) = NULL
;
6291 /* Anything that is outside of the region, but was dominated by something
6292 inside needs to update dominance info. */
6293 iterate_fix_dominators (CDI_DOMINATORS
, doms
, false);
6295 /* Update the SSA web. */
6296 update_ssa (TODO_update_ssa
);
6298 if (free_region_copy
)
6301 free_original_copy_tables ();
6305 /* Add all the blocks dominated by ENTRY to the array BBS_P. Stop
6306 adding blocks when the dominator traversal reaches EXIT. This
6307 function silently assumes that ENTRY strictly dominates EXIT. */
6310 gather_blocks_in_sese_region (basic_block entry
, basic_block exit
,
6311 vec
<basic_block
> *bbs_p
)
6315 for (son
= first_dom_son (CDI_DOMINATORS
, entry
);
6317 son
= next_dom_son (CDI_DOMINATORS
, son
))
6319 bbs_p
->safe_push (son
);
6321 gather_blocks_in_sese_region (son
, exit
, bbs_p
);
6325 /* Replaces *TP with a duplicate (belonging to function TO_CONTEXT).
6326 The duplicates are recorded in VARS_MAP. */
6329 replace_by_duplicate_decl (tree
*tp
, hash_map
<tree
, tree
> *vars_map
,
6332 tree t
= *tp
, new_t
;
6333 struct function
*f
= DECL_STRUCT_FUNCTION (to_context
);
6335 if (DECL_CONTEXT (t
) == to_context
)
6339 tree
&loc
= vars_map
->get_or_insert (t
, &existed
);
6345 new_t
= copy_var_decl (t
, DECL_NAME (t
), TREE_TYPE (t
));
6346 add_local_decl (f
, new_t
);
6350 gcc_assert (TREE_CODE (t
) == CONST_DECL
);
6351 new_t
= copy_node (t
);
6353 DECL_CONTEXT (new_t
) = to_context
;
6364 /* Creates an ssa name in TO_CONTEXT equivalent to NAME.
6365 VARS_MAP maps old ssa names and var_decls to the new ones. */
6368 replace_ssa_name (tree name
, hash_map
<tree
, tree
> *vars_map
,
6373 gcc_assert (!virtual_operand_p (name
));
6375 tree
*loc
= vars_map
->get (name
);
6379 tree decl
= SSA_NAME_VAR (name
);
6382 replace_by_duplicate_decl (&decl
, vars_map
, to_context
);
6383 new_name
= make_ssa_name_fn (DECL_STRUCT_FUNCTION (to_context
),
6384 decl
, SSA_NAME_DEF_STMT (name
));
6385 if (SSA_NAME_IS_DEFAULT_DEF (name
))
6386 set_ssa_default_def (DECL_STRUCT_FUNCTION (to_context
),
6390 new_name
= copy_ssa_name_fn (DECL_STRUCT_FUNCTION (to_context
),
6391 name
, SSA_NAME_DEF_STMT (name
));
6393 vars_map
->put (name
, new_name
);
6407 hash_map
<tree
, tree
> *vars_map
;
6408 htab_t new_label_map
;
6409 hash_map
<void *, void *> *eh_map
;
6413 /* Helper for move_block_to_fn. Set TREE_BLOCK in every expression
6414 contained in *TP if it has been ORIG_BLOCK previously and change the
6415 DECL_CONTEXT of every local variable referenced in *TP. */
6418 move_stmt_op (tree
*tp
, int *walk_subtrees
, void *data
)
6420 struct walk_stmt_info
*wi
= (struct walk_stmt_info
*) data
;
6421 struct move_stmt_d
*p
= (struct move_stmt_d
*) wi
->info
;
6426 tree block
= TREE_BLOCK (t
);
6427 if (block
== p
->orig_block
6428 || (p
->orig_block
== NULL_TREE
6429 && block
!= NULL_TREE
))
6430 TREE_SET_BLOCK (t
, p
->new_block
);
6431 #ifdef ENABLE_CHECKING
6432 else if (block
!= NULL_TREE
)
6434 while (block
&& TREE_CODE (block
) == BLOCK
&& block
!= p
->orig_block
)
6435 block
= BLOCK_SUPERCONTEXT (block
);
6436 gcc_assert (block
== p
->orig_block
);
6440 else if (DECL_P (t
) || TREE_CODE (t
) == SSA_NAME
)
6442 if (TREE_CODE (t
) == SSA_NAME
)
6443 *tp
= replace_ssa_name (t
, p
->vars_map
, p
->to_context
);
6444 else if (TREE_CODE (t
) == LABEL_DECL
)
6446 if (p
->new_label_map
)
6448 struct tree_map in
, *out
;
6450 out
= (struct tree_map
*)
6451 htab_find_with_hash (p
->new_label_map
, &in
, DECL_UID (t
));
6456 DECL_CONTEXT (t
) = p
->to_context
;
6458 else if (p
->remap_decls_p
)
6460 /* Replace T with its duplicate. T should no longer appear in the
6461 parent function, so this looks wasteful; however, it may appear
6462 in referenced_vars, and more importantly, as virtual operands of
6463 statements, and in alias lists of other variables. It would be
6464 quite difficult to expunge it from all those places. ??? It might
6465 suffice to do this for addressable variables. */
6466 if ((TREE_CODE (t
) == VAR_DECL
6467 && !is_global_var (t
))
6468 || TREE_CODE (t
) == CONST_DECL
)
6469 replace_by_duplicate_decl (tp
, p
->vars_map
, p
->to_context
);
6473 else if (TYPE_P (t
))
6479 /* Helper for move_stmt_r. Given an EH region number for the source
6480 function, map that to the duplicate EH regio number in the dest. */
6483 move_stmt_eh_region_nr (int old_nr
, struct move_stmt_d
*p
)
6485 eh_region old_r
, new_r
;
6487 old_r
= get_eh_region_from_number (old_nr
);
6488 new_r
= static_cast<eh_region
> (*p
->eh_map
->get (old_r
));
6490 return new_r
->index
;
6493 /* Similar, but operate on INTEGER_CSTs. */
6496 move_stmt_eh_region_tree_nr (tree old_t_nr
, struct move_stmt_d
*p
)
6500 old_nr
= tree_to_shwi (old_t_nr
);
6501 new_nr
= move_stmt_eh_region_nr (old_nr
, p
);
6503 return build_int_cst (integer_type_node
, new_nr
);
6506 /* Like move_stmt_op, but for gimple statements.
6508 Helper for move_block_to_fn. Set GIMPLE_BLOCK in every expression
6509 contained in the current statement in *GSI_P and change the
6510 DECL_CONTEXT of every local variable referenced in the current
6514 move_stmt_r (gimple_stmt_iterator
*gsi_p
, bool *handled_ops_p
,
6515 struct walk_stmt_info
*wi
)
6517 struct move_stmt_d
*p
= (struct move_stmt_d
*) wi
->info
;
6518 gimple stmt
= gsi_stmt (*gsi_p
);
6519 tree block
= gimple_block (stmt
);
6521 if (block
== p
->orig_block
6522 || (p
->orig_block
== NULL_TREE
6523 && block
!= NULL_TREE
))
6524 gimple_set_block (stmt
, p
->new_block
);
6526 switch (gimple_code (stmt
))
6529 /* Remap the region numbers for __builtin_eh_{pointer,filter}. */
6531 tree r
, fndecl
= gimple_call_fndecl (stmt
);
6532 if (fndecl
&& DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
)
6533 switch (DECL_FUNCTION_CODE (fndecl
))
6535 case BUILT_IN_EH_COPY_VALUES
:
6536 r
= gimple_call_arg (stmt
, 1);
6537 r
= move_stmt_eh_region_tree_nr (r
, p
);
6538 gimple_call_set_arg (stmt
, 1, r
);
6541 case BUILT_IN_EH_POINTER
:
6542 case BUILT_IN_EH_FILTER
:
6543 r
= gimple_call_arg (stmt
, 0);
6544 r
= move_stmt_eh_region_tree_nr (r
, p
);
6545 gimple_call_set_arg (stmt
, 0, r
);
6556 gresx
*resx_stmt
= as_a
<gresx
*> (stmt
);
6557 int r
= gimple_resx_region (resx_stmt
);
6558 r
= move_stmt_eh_region_nr (r
, p
);
6559 gimple_resx_set_region (resx_stmt
, r
);
6563 case GIMPLE_EH_DISPATCH
:
6565 geh_dispatch
*eh_dispatch_stmt
= as_a
<geh_dispatch
*> (stmt
);
6566 int r
= gimple_eh_dispatch_region (eh_dispatch_stmt
);
6567 r
= move_stmt_eh_region_nr (r
, p
);
6568 gimple_eh_dispatch_set_region (eh_dispatch_stmt
, r
);
6572 case GIMPLE_OMP_RETURN
:
6573 case GIMPLE_OMP_CONTINUE
:
6576 if (is_gimple_omp (stmt
))
6578 /* Do not remap variables inside OMP directives. Variables
6579 referenced in clauses and directive header belong to the
6580 parent function and should not be moved into the child
6582 bool save_remap_decls_p
= p
->remap_decls_p
;
6583 p
->remap_decls_p
= false;
6584 *handled_ops_p
= true;
6586 walk_gimple_seq_mod (gimple_omp_body_ptr (stmt
), move_stmt_r
,
6589 p
->remap_decls_p
= save_remap_decls_p
;
6597 /* Move basic block BB from function CFUN to function DEST_FN. The
6598 block is moved out of the original linked list and placed after
6599 block AFTER in the new list. Also, the block is removed from the
6600 original array of blocks and placed in DEST_FN's array of blocks.
6601 If UPDATE_EDGE_COUNT_P is true, the edge counts on both CFGs is
6602 updated to reflect the moved edges.
6604 The local variables are remapped to new instances, VARS_MAP is used
6605 to record the mapping. */
6608 move_block_to_fn (struct function
*dest_cfun
, basic_block bb
,
6609 basic_block after
, bool update_edge_count_p
,
6610 struct move_stmt_d
*d
)
6612 struct control_flow_graph
*cfg
;
6615 gimple_stmt_iterator si
;
6616 unsigned old_len
, new_len
;
6618 /* Remove BB from dominance structures. */
6619 delete_from_dominance_info (CDI_DOMINATORS
, bb
);
6621 /* Move BB from its current loop to the copy in the new function. */
6624 struct loop
*new_loop
= (struct loop
*)bb
->loop_father
->aux
;
6626 bb
->loop_father
= new_loop
;
6629 /* Link BB to the new linked list. */
6630 move_block_after (bb
, after
);
6632 /* Update the edge count in the corresponding flowgraphs. */
6633 if (update_edge_count_p
)
6634 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
6636 cfun
->cfg
->x_n_edges
--;
6637 dest_cfun
->cfg
->x_n_edges
++;
6640 /* Remove BB from the original basic block array. */
6641 (*cfun
->cfg
->x_basic_block_info
)[bb
->index
] = NULL
;
6642 cfun
->cfg
->x_n_basic_blocks
--;
6644 /* Grow DEST_CFUN's basic block array if needed. */
6645 cfg
= dest_cfun
->cfg
;
6646 cfg
->x_n_basic_blocks
++;
6647 if (bb
->index
>= cfg
->x_last_basic_block
)
6648 cfg
->x_last_basic_block
= bb
->index
+ 1;
6650 old_len
= vec_safe_length (cfg
->x_basic_block_info
);
6651 if ((unsigned) cfg
->x_last_basic_block
>= old_len
)
6653 new_len
= cfg
->x_last_basic_block
+ (cfg
->x_last_basic_block
+ 3) / 4;
6654 vec_safe_grow_cleared (cfg
->x_basic_block_info
, new_len
);
6657 (*cfg
->x_basic_block_info
)[bb
->index
] = bb
;
6659 /* Remap the variables in phi nodes. */
6660 for (gphi_iterator psi
= gsi_start_phis (bb
);
6663 gphi
*phi
= psi
.phi ();
6665 tree op
= PHI_RESULT (phi
);
6669 if (virtual_operand_p (op
))
6671 /* Remove the phi nodes for virtual operands (alias analysis will be
6672 run for the new function, anyway). */
6673 remove_phi_node (&psi
, true);
6677 SET_PHI_RESULT (phi
,
6678 replace_ssa_name (op
, d
->vars_map
, dest_cfun
->decl
));
6679 FOR_EACH_PHI_ARG (use
, phi
, oi
, SSA_OP_USE
)
6681 op
= USE_FROM_PTR (use
);
6682 if (TREE_CODE (op
) == SSA_NAME
)
6683 SET_USE (use
, replace_ssa_name (op
, d
->vars_map
, dest_cfun
->decl
));
6686 for (i
= 0; i
< EDGE_COUNT (bb
->preds
); i
++)
6688 location_t locus
= gimple_phi_arg_location (phi
, i
);
6689 tree block
= LOCATION_BLOCK (locus
);
6691 if (locus
== UNKNOWN_LOCATION
)
6693 if (d
->orig_block
== NULL_TREE
|| block
== d
->orig_block
)
6695 if (d
->new_block
== NULL_TREE
)
6696 locus
= LOCATION_LOCUS (locus
);
6698 locus
= COMBINE_LOCATION_DATA (line_table
, locus
, d
->new_block
);
6699 gimple_phi_arg_set_location (phi
, i
, locus
);
6706 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
6708 gimple stmt
= gsi_stmt (si
);
6709 struct walk_stmt_info wi
;
6711 memset (&wi
, 0, sizeof (wi
));
6713 walk_gimple_stmt (&si
, move_stmt_r
, move_stmt_op
, &wi
);
6715 if (glabel
*label_stmt
= dyn_cast
<glabel
*> (stmt
))
6717 tree label
= gimple_label_label (label_stmt
);
6718 int uid
= LABEL_DECL_UID (label
);
6720 gcc_assert (uid
> -1);
6722 old_len
= vec_safe_length (cfg
->x_label_to_block_map
);
6723 if (old_len
<= (unsigned) uid
)
6725 new_len
= 3 * uid
/ 2 + 1;
6726 vec_safe_grow_cleared (cfg
->x_label_to_block_map
, new_len
);
6729 (*cfg
->x_label_to_block_map
)[uid
] = bb
;
6730 (*cfun
->cfg
->x_label_to_block_map
)[uid
] = NULL
;
6732 gcc_assert (DECL_CONTEXT (label
) == dest_cfun
->decl
);
6734 if (uid
>= dest_cfun
->cfg
->last_label_uid
)
6735 dest_cfun
->cfg
->last_label_uid
= uid
+ 1;
6738 maybe_duplicate_eh_stmt_fn (dest_cfun
, stmt
, cfun
, stmt
, d
->eh_map
, 0);
6739 remove_stmt_from_eh_lp_fn (cfun
, stmt
);
6741 gimple_duplicate_stmt_histograms (dest_cfun
, stmt
, cfun
, stmt
);
6742 gimple_remove_stmt_histograms (cfun
, stmt
);
6744 /* We cannot leave any operands allocated from the operand caches of
6745 the current function. */
6746 free_stmt_operands (cfun
, stmt
);
6747 push_cfun (dest_cfun
);
6752 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
6753 if (e
->goto_locus
!= UNKNOWN_LOCATION
)
6755 tree block
= LOCATION_BLOCK (e
->goto_locus
);
6756 if (d
->orig_block
== NULL_TREE
6757 || block
== d
->orig_block
)
6758 e
->goto_locus
= d
->new_block
?
6759 COMBINE_LOCATION_DATA (line_table
, e
->goto_locus
, d
->new_block
) :
6760 LOCATION_LOCUS (e
->goto_locus
);
6764 /* Examine the statements in BB (which is in SRC_CFUN); find and return
6765 the outermost EH region. Use REGION as the incoming base EH region. */
6768 find_outermost_region_in_block (struct function
*src_cfun
,
6769 basic_block bb
, eh_region region
)
6771 gimple_stmt_iterator si
;
6773 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
6775 gimple stmt
= gsi_stmt (si
);
6776 eh_region stmt_region
;
6779 lp_nr
= lookup_stmt_eh_lp_fn (src_cfun
, stmt
);
6780 stmt_region
= get_eh_region_from_lp_number_fn (src_cfun
, lp_nr
);
6784 region
= stmt_region
;
6785 else if (stmt_region
!= region
)
6787 region
= eh_region_outermost (src_cfun
, stmt_region
, region
);
6788 gcc_assert (region
!= NULL
);
6797 new_label_mapper (tree decl
, void *data
)
6799 htab_t hash
= (htab_t
) data
;
6803 gcc_assert (TREE_CODE (decl
) == LABEL_DECL
);
6805 m
= XNEW (struct tree_map
);
6806 m
->hash
= DECL_UID (decl
);
6807 m
->base
.from
= decl
;
6808 m
->to
= create_artificial_label (UNKNOWN_LOCATION
);
6809 LABEL_DECL_UID (m
->to
) = LABEL_DECL_UID (decl
);
6810 if (LABEL_DECL_UID (m
->to
) >= cfun
->cfg
->last_label_uid
)
6811 cfun
->cfg
->last_label_uid
= LABEL_DECL_UID (m
->to
) + 1;
6813 slot
= htab_find_slot_with_hash (hash
, m
, m
->hash
, INSERT
);
6814 gcc_assert (*slot
== NULL
);
6821 /* Change DECL_CONTEXT of all BLOCK_VARS in block, including
6825 replace_block_vars_by_duplicates (tree block
, hash_map
<tree
, tree
> *vars_map
,
6830 for (tp
= &BLOCK_VARS (block
); *tp
; tp
= &DECL_CHAIN (*tp
))
6833 if (TREE_CODE (t
) != VAR_DECL
&& TREE_CODE (t
) != CONST_DECL
)
6835 replace_by_duplicate_decl (&t
, vars_map
, to_context
);
6838 if (TREE_CODE (*tp
) == VAR_DECL
&& DECL_HAS_VALUE_EXPR_P (*tp
))
6840 SET_DECL_VALUE_EXPR (t
, DECL_VALUE_EXPR (*tp
));
6841 DECL_HAS_VALUE_EXPR_P (t
) = 1;
6843 DECL_CHAIN (t
) = DECL_CHAIN (*tp
);
6848 for (block
= BLOCK_SUBBLOCKS (block
); block
; block
= BLOCK_CHAIN (block
))
6849 replace_block_vars_by_duplicates (block
, vars_map
, to_context
);
6852 /* Fixup the loop arrays and numbers after moving LOOP and its subloops
6856 fixup_loop_arrays_after_move (struct function
*fn1
, struct function
*fn2
,
6859 /* Discard it from the old loop array. */
6860 (*get_loops (fn1
))[loop
->num
] = NULL
;
6862 /* Place it in the new loop array, assigning it a new number. */
6863 loop
->num
= number_of_loops (fn2
);
6864 vec_safe_push (loops_for_fn (fn2
)->larray
, loop
);
6866 /* Recurse to children. */
6867 for (loop
= loop
->inner
; loop
; loop
= loop
->next
)
6868 fixup_loop_arrays_after_move (fn1
, fn2
, loop
);
6871 /* Move a single-entry, single-exit region delimited by ENTRY_BB and
6872 EXIT_BB to function DEST_CFUN. The whole region is replaced by a
6873 single basic block in the original CFG and the new basic block is
6874 returned. DEST_CFUN must not have a CFG yet.
6876 Note that the region need not be a pure SESE region. Blocks inside
6877 the region may contain calls to abort/exit. The only restriction
6878 is that ENTRY_BB should be the only entry point and it must
6881 Change TREE_BLOCK of all statements in ORIG_BLOCK to the new
6882 functions outermost BLOCK, move all subblocks of ORIG_BLOCK
6883 to the new function.
6885 All local variables referenced in the region are assumed to be in
6886 the corresponding BLOCK_VARS and unexpanded variable lists
6887 associated with DEST_CFUN. */
6890 move_sese_region_to_fn (struct function
*dest_cfun
, basic_block entry_bb
,
6891 basic_block exit_bb
, tree orig_block
)
6893 vec
<basic_block
> bbs
, dom_bbs
;
6894 basic_block dom_entry
= get_immediate_dominator (CDI_DOMINATORS
, entry_bb
);
6895 basic_block after
, bb
, *entry_pred
, *exit_succ
, abb
;
6896 struct function
*saved_cfun
= cfun
;
6897 int *entry_flag
, *exit_flag
;
6898 unsigned *entry_prob
, *exit_prob
;
6899 unsigned i
, num_entry_edges
, num_exit_edges
, num_nodes
;
6902 htab_t new_label_map
;
6903 hash_map
<void *, void *> *eh_map
;
6904 struct loop
*loop
= entry_bb
->loop_father
;
6905 struct loop
*loop0
= get_loop (saved_cfun
, 0);
6906 struct move_stmt_d d
;
6908 /* If ENTRY does not strictly dominate EXIT, this cannot be an SESE
6910 gcc_assert (entry_bb
!= exit_bb
6912 || dominated_by_p (CDI_DOMINATORS
, exit_bb
, entry_bb
)));
6914 /* Collect all the blocks in the region. Manually add ENTRY_BB
6915 because it won't be added by dfs_enumerate_from. */
6917 bbs
.safe_push (entry_bb
);
6918 gather_blocks_in_sese_region (entry_bb
, exit_bb
, &bbs
);
6920 /* The blocks that used to be dominated by something in BBS will now be
6921 dominated by the new block. */
6922 dom_bbs
= get_dominated_by_region (CDI_DOMINATORS
,
6926 /* Detach ENTRY_BB and EXIT_BB from CFUN->CFG. We need to remember
6927 the predecessor edges to ENTRY_BB and the successor edges to
6928 EXIT_BB so that we can re-attach them to the new basic block that
6929 will replace the region. */
6930 num_entry_edges
= EDGE_COUNT (entry_bb
->preds
);
6931 entry_pred
= XNEWVEC (basic_block
, num_entry_edges
);
6932 entry_flag
= XNEWVEC (int, num_entry_edges
);
6933 entry_prob
= XNEWVEC (unsigned, num_entry_edges
);
6935 for (ei
= ei_start (entry_bb
->preds
); (e
= ei_safe_edge (ei
)) != NULL
;)
6937 entry_prob
[i
] = e
->probability
;
6938 entry_flag
[i
] = e
->flags
;
6939 entry_pred
[i
++] = e
->src
;
6945 num_exit_edges
= EDGE_COUNT (exit_bb
->succs
);
6946 exit_succ
= XNEWVEC (basic_block
, num_exit_edges
);
6947 exit_flag
= XNEWVEC (int, num_exit_edges
);
6948 exit_prob
= XNEWVEC (unsigned, num_exit_edges
);
6950 for (ei
= ei_start (exit_bb
->succs
); (e
= ei_safe_edge (ei
)) != NULL
;)
6952 exit_prob
[i
] = e
->probability
;
6953 exit_flag
[i
] = e
->flags
;
6954 exit_succ
[i
++] = e
->dest
;
6966 /* Switch context to the child function to initialize DEST_FN's CFG. */
6967 gcc_assert (dest_cfun
->cfg
== NULL
);
6968 push_cfun (dest_cfun
);
6970 init_empty_tree_cfg ();
6972 /* Initialize EH information for the new function. */
6974 new_label_map
= NULL
;
6977 eh_region region
= NULL
;
6979 FOR_EACH_VEC_ELT (bbs
, i
, bb
)
6980 region
= find_outermost_region_in_block (saved_cfun
, bb
, region
);
6982 init_eh_for_function ();
6985 new_label_map
= htab_create (17, tree_map_hash
, tree_map_eq
, free
);
6986 eh_map
= duplicate_eh_regions (saved_cfun
, region
, 0,
6987 new_label_mapper
, new_label_map
);
6991 /* Initialize an empty loop tree. */
6992 struct loops
*loops
= ggc_cleared_alloc
<struct loops
> ();
6993 init_loops_structure (dest_cfun
, loops
, 1);
6994 loops
->state
= LOOPS_MAY_HAVE_MULTIPLE_LATCHES
;
6995 set_loops_for_fn (dest_cfun
, loops
);
6997 /* Move the outlined loop tree part. */
6998 num_nodes
= bbs
.length ();
6999 FOR_EACH_VEC_ELT (bbs
, i
, bb
)
7001 if (bb
->loop_father
->header
== bb
)
7003 struct loop
*this_loop
= bb
->loop_father
;
7004 struct loop
*outer
= loop_outer (this_loop
);
7006 /* If the SESE region contains some bbs ending with
7007 a noreturn call, those are considered to belong
7008 to the outermost loop in saved_cfun, rather than
7009 the entry_bb's loop_father. */
7013 num_nodes
-= this_loop
->num_nodes
;
7014 flow_loop_tree_node_remove (bb
->loop_father
);
7015 flow_loop_tree_node_add (get_loop (dest_cfun
, 0), this_loop
);
7016 fixup_loop_arrays_after_move (saved_cfun
, cfun
, this_loop
);
7019 else if (bb
->loop_father
== loop0
&& loop0
!= loop
)
7022 /* Remove loop exits from the outlined region. */
7023 if (loops_for_fn (saved_cfun
)->exits
)
7024 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
7026 struct loops
*l
= loops_for_fn (saved_cfun
);
7028 = l
->exits
->find_slot_with_hash (e
, htab_hash_pointer (e
),
7031 l
->exits
->clear_slot (slot
);
7036 /* Adjust the number of blocks in the tree root of the outlined part. */
7037 get_loop (dest_cfun
, 0)->num_nodes
= bbs
.length () + 2;
7039 /* Setup a mapping to be used by move_block_to_fn. */
7040 loop
->aux
= current_loops
->tree_root
;
7041 loop0
->aux
= current_loops
->tree_root
;
7045 /* Move blocks from BBS into DEST_CFUN. */
7046 gcc_assert (bbs
.length () >= 2);
7047 after
= dest_cfun
->cfg
->x_entry_block_ptr
;
7048 hash_map
<tree
, tree
> vars_map
;
7050 memset (&d
, 0, sizeof (d
));
7051 d
.orig_block
= orig_block
;
7052 d
.new_block
= DECL_INITIAL (dest_cfun
->decl
);
7053 d
.from_context
= cfun
->decl
;
7054 d
.to_context
= dest_cfun
->decl
;
7055 d
.vars_map
= &vars_map
;
7056 d
.new_label_map
= new_label_map
;
7058 d
.remap_decls_p
= true;
7060 FOR_EACH_VEC_ELT (bbs
, i
, bb
)
7062 /* No need to update edge counts on the last block. It has
7063 already been updated earlier when we detached the region from
7064 the original CFG. */
7065 move_block_to_fn (dest_cfun
, bb
, after
, bb
!= exit_bb
, &d
);
7071 /* Loop sizes are no longer correct, fix them up. */
7072 loop
->num_nodes
-= num_nodes
;
7073 for (struct loop
*outer
= loop_outer (loop
);
7074 outer
; outer
= loop_outer (outer
))
7075 outer
->num_nodes
-= num_nodes
;
7076 loop0
->num_nodes
-= bbs
.length () - num_nodes
;
7078 if (saved_cfun
->has_simduid_loops
|| saved_cfun
->has_force_vectorize_loops
)
7081 for (i
= 0; vec_safe_iterate (loops
->larray
, i
, &aloop
); i
++)
7086 replace_by_duplicate_decl (&aloop
->simduid
, d
.vars_map
,
7088 dest_cfun
->has_simduid_loops
= true;
7090 if (aloop
->force_vectorize
)
7091 dest_cfun
->has_force_vectorize_loops
= true;
7095 /* Rewire BLOCK_SUBBLOCKS of orig_block. */
7099 gcc_assert (BLOCK_SUBBLOCKS (DECL_INITIAL (dest_cfun
->decl
))
7101 BLOCK_SUBBLOCKS (DECL_INITIAL (dest_cfun
->decl
))
7102 = BLOCK_SUBBLOCKS (orig_block
);
7103 for (block
= BLOCK_SUBBLOCKS (orig_block
);
7104 block
; block
= BLOCK_CHAIN (block
))
7105 BLOCK_SUPERCONTEXT (block
) = DECL_INITIAL (dest_cfun
->decl
);
7106 BLOCK_SUBBLOCKS (orig_block
) = NULL_TREE
;
7109 replace_block_vars_by_duplicates (DECL_INITIAL (dest_cfun
->decl
),
7110 &vars_map
, dest_cfun
->decl
);
7113 htab_delete (new_label_map
);
7117 /* Rewire the entry and exit blocks. The successor to the entry
7118 block turns into the successor of DEST_FN's ENTRY_BLOCK_PTR in
7119 the child function. Similarly, the predecessor of DEST_FN's
7120 EXIT_BLOCK_PTR turns into the predecessor of EXIT_BLOCK_PTR. We
7121 need to switch CFUN between DEST_CFUN and SAVED_CFUN so that the
7122 various CFG manipulation function get to the right CFG.
7124 FIXME, this is silly. The CFG ought to become a parameter to
7126 push_cfun (dest_cfun
);
7127 make_edge (ENTRY_BLOCK_PTR_FOR_FN (cfun
), entry_bb
, EDGE_FALLTHRU
);
7129 make_edge (exit_bb
, EXIT_BLOCK_PTR_FOR_FN (cfun
), 0);
7132 /* Back in the original function, the SESE region has disappeared,
7133 create a new basic block in its place. */
7134 bb
= create_empty_bb (entry_pred
[0]);
7136 add_bb_to_loop (bb
, loop
);
7137 for (i
= 0; i
< num_entry_edges
; i
++)
7139 e
= make_edge (entry_pred
[i
], bb
, entry_flag
[i
]);
7140 e
->probability
= entry_prob
[i
];
7143 for (i
= 0; i
< num_exit_edges
; i
++)
7145 e
= make_edge (bb
, exit_succ
[i
], exit_flag
[i
]);
7146 e
->probability
= exit_prob
[i
];
7149 set_immediate_dominator (CDI_DOMINATORS
, bb
, dom_entry
);
7150 FOR_EACH_VEC_ELT (dom_bbs
, i
, abb
)
7151 set_immediate_dominator (CDI_DOMINATORS
, abb
, bb
);
7169 /* Dump FUNCTION_DECL FN to file FILE using FLAGS (see TDF_* in dumpfile.h)
7173 dump_function_to_file (tree fndecl
, FILE *file
, int flags
)
7175 tree arg
, var
, old_current_fndecl
= current_function_decl
;
7176 struct function
*dsf
;
7177 bool ignore_topmost_bind
= false, any_var
= false;
7180 bool tmclone
= (TREE_CODE (fndecl
) == FUNCTION_DECL
7181 && decl_is_tm_clone (fndecl
));
7182 struct function
*fun
= DECL_STRUCT_FUNCTION (fndecl
);
7184 current_function_decl
= fndecl
;
7185 fprintf (file
, "%s %s(", function_name (fun
), tmclone
? "[tm-clone] " : "");
7187 arg
= DECL_ARGUMENTS (fndecl
);
7190 print_generic_expr (file
, TREE_TYPE (arg
), dump_flags
);
7191 fprintf (file
, " ");
7192 print_generic_expr (file
, arg
, dump_flags
);
7193 if (flags
& TDF_VERBOSE
)
7194 print_node (file
, "", arg
, 4);
7195 if (DECL_CHAIN (arg
))
7196 fprintf (file
, ", ");
7197 arg
= DECL_CHAIN (arg
);
7199 fprintf (file
, ")\n");
7201 if (flags
& TDF_VERBOSE
)
7202 print_node (file
, "", fndecl
, 2);
7204 dsf
= DECL_STRUCT_FUNCTION (fndecl
);
7205 if (dsf
&& (flags
& TDF_EH
))
7206 dump_eh_tree (file
, dsf
);
7208 if (flags
& TDF_RAW
&& !gimple_has_body_p (fndecl
))
7210 dump_node (fndecl
, TDF_SLIM
| flags
, file
);
7211 current_function_decl
= old_current_fndecl
;
7215 /* When GIMPLE is lowered, the variables are no longer available in
7216 BIND_EXPRs, so display them separately. */
7217 if (fun
&& fun
->decl
== fndecl
&& (fun
->curr_properties
& PROP_gimple_lcf
))
7220 ignore_topmost_bind
= true;
7222 fprintf (file
, "{\n");
7223 if (!vec_safe_is_empty (fun
->local_decls
))
7224 FOR_EACH_LOCAL_DECL (fun
, ix
, var
)
7226 print_generic_decl (file
, var
, flags
);
7227 if (flags
& TDF_VERBOSE
)
7228 print_node (file
, "", var
, 4);
7229 fprintf (file
, "\n");
7233 if (gimple_in_ssa_p (cfun
))
7234 for (ix
= 1; ix
< num_ssa_names
; ++ix
)
7236 tree name
= ssa_name (ix
);
7237 if (name
&& !SSA_NAME_VAR (name
))
7239 fprintf (file
, " ");
7240 print_generic_expr (file
, TREE_TYPE (name
), flags
);
7241 fprintf (file
, " ");
7242 print_generic_expr (file
, name
, flags
);
7243 fprintf (file
, ";\n");
7250 if (fun
&& fun
->decl
== fndecl
7252 && basic_block_info_for_fn (fun
))
7254 /* If the CFG has been built, emit a CFG-based dump. */
7255 if (!ignore_topmost_bind
)
7256 fprintf (file
, "{\n");
7258 if (any_var
&& n_basic_blocks_for_fn (fun
))
7259 fprintf (file
, "\n");
7261 FOR_EACH_BB_FN (bb
, fun
)
7262 dump_bb (file
, bb
, 2, flags
| TDF_COMMENT
);
7264 fprintf (file
, "}\n");
7266 else if (DECL_SAVED_TREE (fndecl
) == NULL
)
7268 /* The function is now in GIMPLE form but the CFG has not been
7269 built yet. Emit the single sequence of GIMPLE statements
7270 that make up its body. */
7271 gimple_seq body
= gimple_body (fndecl
);
7273 if (gimple_seq_first_stmt (body
)
7274 && gimple_seq_first_stmt (body
) == gimple_seq_last_stmt (body
)
7275 && gimple_code (gimple_seq_first_stmt (body
)) == GIMPLE_BIND
)
7276 print_gimple_seq (file
, body
, 0, flags
);
7279 if (!ignore_topmost_bind
)
7280 fprintf (file
, "{\n");
7283 fprintf (file
, "\n");
7285 print_gimple_seq (file
, body
, 2, flags
);
7286 fprintf (file
, "}\n");
7293 /* Make a tree based dump. */
7294 chain
= DECL_SAVED_TREE (fndecl
);
7295 if (chain
&& TREE_CODE (chain
) == BIND_EXPR
)
7297 if (ignore_topmost_bind
)
7299 chain
= BIND_EXPR_BODY (chain
);
7307 if (!ignore_topmost_bind
)
7308 fprintf (file
, "{\n");
7313 fprintf (file
, "\n");
7315 print_generic_stmt_indented (file
, chain
, flags
, indent
);
7316 if (ignore_topmost_bind
)
7317 fprintf (file
, "}\n");
7320 if (flags
& TDF_ENUMERATE_LOCALS
)
7321 dump_enumerated_decls (file
, flags
);
7322 fprintf (file
, "\n\n");
7324 current_function_decl
= old_current_fndecl
;
7327 /* Dump FUNCTION_DECL FN to stderr using FLAGS (see TDF_* in tree.h) */
7330 debug_function (tree fn
, int flags
)
7332 dump_function_to_file (fn
, stderr
, flags
);
7336 /* Print on FILE the indexes for the predecessors of basic_block BB. */
7339 print_pred_bbs (FILE *file
, basic_block bb
)
7344 FOR_EACH_EDGE (e
, ei
, bb
->preds
)
7345 fprintf (file
, "bb_%d ", e
->src
->index
);
7349 /* Print on FILE the indexes for the successors of basic_block BB. */
7352 print_succ_bbs (FILE *file
, basic_block bb
)
7357 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
7358 fprintf (file
, "bb_%d ", e
->dest
->index
);
7361 /* Print to FILE the basic block BB following the VERBOSITY level. */
7364 print_loops_bb (FILE *file
, basic_block bb
, int indent
, int verbosity
)
7366 char *s_indent
= (char *) alloca ((size_t) indent
+ 1);
7367 memset ((void *) s_indent
, ' ', (size_t) indent
);
7368 s_indent
[indent
] = '\0';
7370 /* Print basic_block's header. */
7373 fprintf (file
, "%s bb_%d (preds = {", s_indent
, bb
->index
);
7374 print_pred_bbs (file
, bb
);
7375 fprintf (file
, "}, succs = {");
7376 print_succ_bbs (file
, bb
);
7377 fprintf (file
, "})\n");
7380 /* Print basic_block's body. */
7383 fprintf (file
, "%s {\n", s_indent
);
7384 dump_bb (file
, bb
, indent
+ 4, TDF_VOPS
|TDF_MEMSYMS
);
7385 fprintf (file
, "%s }\n", s_indent
);
7389 static void print_loop_and_siblings (FILE *, struct loop
*, int, int);
7391 /* Pretty print LOOP on FILE, indented INDENT spaces. Following
7392 VERBOSITY level this outputs the contents of the loop, or just its
7396 print_loop (FILE *file
, struct loop
*loop
, int indent
, int verbosity
)
7404 s_indent
= (char *) alloca ((size_t) indent
+ 1);
7405 memset ((void *) s_indent
, ' ', (size_t) indent
);
7406 s_indent
[indent
] = '\0';
7408 /* Print loop's header. */
7409 fprintf (file
, "%sloop_%d (", s_indent
, loop
->num
);
7411 fprintf (file
, "header = %d", loop
->header
->index
);
7414 fprintf (file
, "deleted)\n");
7418 fprintf (file
, ", latch = %d", loop
->latch
->index
);
7420 fprintf (file
, ", multiple latches");
7421 fprintf (file
, ", niter = ");
7422 print_generic_expr (file
, loop
->nb_iterations
, 0);
7424 if (loop
->any_upper_bound
)
7426 fprintf (file
, ", upper_bound = ");
7427 print_decu (loop
->nb_iterations_upper_bound
, file
);
7430 if (loop
->any_estimate
)
7432 fprintf (file
, ", estimate = ");
7433 print_decu (loop
->nb_iterations_estimate
, file
);
7435 fprintf (file
, ")\n");
7437 /* Print loop's body. */
7440 fprintf (file
, "%s{\n", s_indent
);
7441 FOR_EACH_BB_FN (bb
, cfun
)
7442 if (bb
->loop_father
== loop
)
7443 print_loops_bb (file
, bb
, indent
, verbosity
);
7445 print_loop_and_siblings (file
, loop
->inner
, indent
+ 2, verbosity
);
7446 fprintf (file
, "%s}\n", s_indent
);
7450 /* Print the LOOP and its sibling loops on FILE, indented INDENT
7451 spaces. Following VERBOSITY level this outputs the contents of the
7452 loop, or just its structure. */
7455 print_loop_and_siblings (FILE *file
, struct loop
*loop
, int indent
,
7461 print_loop (file
, loop
, indent
, verbosity
);
7462 print_loop_and_siblings (file
, loop
->next
, indent
, verbosity
);
7465 /* Follow a CFG edge from the entry point of the program, and on entry
7466 of a loop, pretty print the loop structure on FILE. */
7469 print_loops (FILE *file
, int verbosity
)
7473 bb
= ENTRY_BLOCK_PTR_FOR_FN (cfun
);
7474 if (bb
&& bb
->loop_father
)
7475 print_loop_and_siblings (file
, bb
->loop_father
, 0, verbosity
);
7481 debug (struct loop
&ref
)
7483 print_loop (stderr
, &ref
, 0, /*verbosity*/0);
7487 debug (struct loop
*ptr
)
7492 fprintf (stderr
, "<nil>\n");
7495 /* Dump a loop verbosely. */
7498 debug_verbose (struct loop
&ref
)
7500 print_loop (stderr
, &ref
, 0, /*verbosity*/3);
7504 debug_verbose (struct loop
*ptr
)
7509 fprintf (stderr
, "<nil>\n");
7513 /* Debugging loops structure at tree level, at some VERBOSITY level. */
7516 debug_loops (int verbosity
)
7518 print_loops (stderr
, verbosity
);
7521 /* Print on stderr the code of LOOP, at some VERBOSITY level. */
7524 debug_loop (struct loop
*loop
, int verbosity
)
7526 print_loop (stderr
, loop
, 0, verbosity
);
7529 /* Print on stderr the code of loop number NUM, at some VERBOSITY
7533 debug_loop_num (unsigned num
, int verbosity
)
7535 debug_loop (get_loop (cfun
, num
), verbosity
);
7538 /* Return true if BB ends with a call, possibly followed by some
7539 instructions that must stay with the call. Return false,
7543 gimple_block_ends_with_call_p (basic_block bb
)
7545 gimple_stmt_iterator gsi
= gsi_last_nondebug_bb (bb
);
7546 return !gsi_end_p (gsi
) && is_gimple_call (gsi_stmt (gsi
));
7550 /* Return true if BB ends with a conditional branch. Return false,
7554 gimple_block_ends_with_condjump_p (const_basic_block bb
)
7556 gimple stmt
= last_stmt (CONST_CAST_BB (bb
));
7557 return (stmt
&& gimple_code (stmt
) == GIMPLE_COND
);
7561 /* Return true if we need to add fake edge to exit at statement T.
7562 Helper function for gimple_flow_call_edges_add. */
7565 need_fake_edge_p (gimple t
)
7567 tree fndecl
= NULL_TREE
;
7570 /* NORETURN and LONGJMP calls already have an edge to exit.
7571 CONST and PURE calls do not need one.
7572 We don't currently check for CONST and PURE here, although
7573 it would be a good idea, because those attributes are
7574 figured out from the RTL in mark_constant_function, and
7575 the counter incrementation code from -fprofile-arcs
7576 leads to different results from -fbranch-probabilities. */
7577 if (is_gimple_call (t
))
7579 fndecl
= gimple_call_fndecl (t
);
7580 call_flags
= gimple_call_flags (t
);
7583 if (is_gimple_call (t
)
7585 && DECL_BUILT_IN (fndecl
)
7586 && (call_flags
& ECF_NOTHROW
)
7587 && !(call_flags
& ECF_RETURNS_TWICE
)
7588 /* fork() doesn't really return twice, but the effect of
7589 wrapping it in __gcov_fork() which calls __gcov_flush()
7590 and clears the counters before forking has the same
7591 effect as returning twice. Force a fake edge. */
7592 && !(DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
7593 && DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_FORK
))
7596 if (is_gimple_call (t
))
7602 if (!(call_flags
& ECF_NORETURN
))
7606 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
7607 if ((e
->flags
& EDGE_FAKE
) == 0)
7611 if (gasm
*asm_stmt
= dyn_cast
<gasm
*> (t
))
7612 if (gimple_asm_volatile_p (asm_stmt
) || gimple_asm_input_p (asm_stmt
))
7619 /* Add fake edges to the function exit for any non constant and non
7620 noreturn calls (or noreturn calls with EH/abnormal edges),
7621 volatile inline assembly in the bitmap of blocks specified by BLOCKS
7622 or to the whole CFG if BLOCKS is zero. Return the number of blocks
7625 The goal is to expose cases in which entering a basic block does
7626 not imply that all subsequent instructions must be executed. */
7629 gimple_flow_call_edges_add (sbitmap blocks
)
7632 int blocks_split
= 0;
7633 int last_bb
= last_basic_block_for_fn (cfun
);
7634 bool check_last_block
= false;
7636 if (n_basic_blocks_for_fn (cfun
) == NUM_FIXED_BLOCKS
)
7640 check_last_block
= true;
7642 check_last_block
= bitmap_bit_p (blocks
,
7643 EXIT_BLOCK_PTR_FOR_FN (cfun
)->prev_bb
->index
);
7645 /* In the last basic block, before epilogue generation, there will be
7646 a fallthru edge to EXIT. Special care is required if the last insn
7647 of the last basic block is a call because make_edge folds duplicate
7648 edges, which would result in the fallthru edge also being marked
7649 fake, which would result in the fallthru edge being removed by
7650 remove_fake_edges, which would result in an invalid CFG.
7652 Moreover, we can't elide the outgoing fake edge, since the block
7653 profiler needs to take this into account in order to solve the minimal
7654 spanning tree in the case that the call doesn't return.
7656 Handle this by adding a dummy instruction in a new last basic block. */
7657 if (check_last_block
)
7659 basic_block bb
= EXIT_BLOCK_PTR_FOR_FN (cfun
)->prev_bb
;
7660 gimple_stmt_iterator gsi
= gsi_last_nondebug_bb (bb
);
7663 if (!gsi_end_p (gsi
))
7666 if (t
&& need_fake_edge_p (t
))
7670 e
= find_edge (bb
, EXIT_BLOCK_PTR_FOR_FN (cfun
));
7673 gsi_insert_on_edge (e
, gimple_build_nop ());
7674 gsi_commit_edge_inserts ();
7679 /* Now add fake edges to the function exit for any non constant
7680 calls since there is no way that we can determine if they will
7682 for (i
= 0; i
< last_bb
; i
++)
7684 basic_block bb
= BASIC_BLOCK_FOR_FN (cfun
, i
);
7685 gimple_stmt_iterator gsi
;
7686 gimple stmt
, last_stmt
;
7691 if (blocks
&& !bitmap_bit_p (blocks
, i
))
7694 gsi
= gsi_last_nondebug_bb (bb
);
7695 if (!gsi_end_p (gsi
))
7697 last_stmt
= gsi_stmt (gsi
);
7700 stmt
= gsi_stmt (gsi
);
7701 if (need_fake_edge_p (stmt
))
7705 /* The handling above of the final block before the
7706 epilogue should be enough to verify that there is
7707 no edge to the exit block in CFG already.
7708 Calling make_edge in such case would cause us to
7709 mark that edge as fake and remove it later. */
7710 #ifdef ENABLE_CHECKING
7711 if (stmt
== last_stmt
)
7713 e
= find_edge (bb
, EXIT_BLOCK_PTR_FOR_FN (cfun
));
7714 gcc_assert (e
== NULL
);
7718 /* Note that the following may create a new basic block
7719 and renumber the existing basic blocks. */
7720 if (stmt
!= last_stmt
)
7722 e
= split_block (bb
, stmt
);
7726 make_edge (bb
, EXIT_BLOCK_PTR_FOR_FN (cfun
), EDGE_FAKE
);
7730 while (!gsi_end_p (gsi
));
7735 verify_flow_info ();
7737 return blocks_split
;
7740 /* Removes edge E and all the blocks dominated by it, and updates dominance
7741 information. The IL in E->src needs to be updated separately.
7742 If dominance info is not available, only the edge E is removed.*/
7745 remove_edge_and_dominated_blocks (edge e
)
7747 vec
<basic_block
> bbs_to_remove
= vNULL
;
7748 vec
<basic_block
> bbs_to_fix_dom
= vNULL
;
7752 bool none_removed
= false;
7754 basic_block bb
, dbb
;
7757 if (!dom_info_available_p (CDI_DOMINATORS
))
7763 /* No updating is needed for edges to exit. */
7764 if (e
->dest
== EXIT_BLOCK_PTR_FOR_FN (cfun
))
7766 if (cfgcleanup_altered_bbs
)
7767 bitmap_set_bit (cfgcleanup_altered_bbs
, e
->src
->index
);
7772 /* First, we find the basic blocks to remove. If E->dest has a predecessor
7773 that is not dominated by E->dest, then this set is empty. Otherwise,
7774 all the basic blocks dominated by E->dest are removed.
7776 Also, to DF_IDOM we store the immediate dominators of the blocks in
7777 the dominance frontier of E (i.e., of the successors of the
7778 removed blocks, if there are any, and of E->dest otherwise). */
7779 FOR_EACH_EDGE (f
, ei
, e
->dest
->preds
)
7784 if (!dominated_by_p (CDI_DOMINATORS
, f
->src
, e
->dest
))
7786 none_removed
= true;
7791 df
= BITMAP_ALLOC (NULL
);
7792 df_idom
= BITMAP_ALLOC (NULL
);
7795 bitmap_set_bit (df_idom
,
7796 get_immediate_dominator (CDI_DOMINATORS
, e
->dest
)->index
);
7799 bbs_to_remove
= get_all_dominated_blocks (CDI_DOMINATORS
, e
->dest
);
7800 FOR_EACH_VEC_ELT (bbs_to_remove
, i
, bb
)
7802 FOR_EACH_EDGE (f
, ei
, bb
->succs
)
7804 if (f
->dest
!= EXIT_BLOCK_PTR_FOR_FN (cfun
))
7805 bitmap_set_bit (df
, f
->dest
->index
);
7808 FOR_EACH_VEC_ELT (bbs_to_remove
, i
, bb
)
7809 bitmap_clear_bit (df
, bb
->index
);
7811 EXECUTE_IF_SET_IN_BITMAP (df
, 0, i
, bi
)
7813 bb
= BASIC_BLOCK_FOR_FN (cfun
, i
);
7814 bitmap_set_bit (df_idom
,
7815 get_immediate_dominator (CDI_DOMINATORS
, bb
)->index
);
7819 if (cfgcleanup_altered_bbs
)
7821 /* Record the set of the altered basic blocks. */
7822 bitmap_set_bit (cfgcleanup_altered_bbs
, e
->src
->index
);
7823 bitmap_ior_into (cfgcleanup_altered_bbs
, df
);
7826 /* Remove E and the cancelled blocks. */
7831 /* Walk backwards so as to get a chance to substitute all
7832 released DEFs into debug stmts. See
7833 eliminate_unnecessary_stmts() in tree-ssa-dce.c for more
7835 for (i
= bbs_to_remove
.length (); i
-- > 0; )
7836 delete_basic_block (bbs_to_remove
[i
]);
7839 /* Update the dominance information. The immediate dominator may change only
7840 for blocks whose immediate dominator belongs to DF_IDOM:
7842 Suppose that idom(X) = Y before removal of E and idom(X) != Y after the
7843 removal. Let Z the arbitrary block such that idom(Z) = Y and
7844 Z dominates X after the removal. Before removal, there exists a path P
7845 from Y to X that avoids Z. Let F be the last edge on P that is
7846 removed, and let W = F->dest. Before removal, idom(W) = Y (since Y
7847 dominates W, and because of P, Z does not dominate W), and W belongs to
7848 the dominance frontier of E. Therefore, Y belongs to DF_IDOM. */
7849 EXECUTE_IF_SET_IN_BITMAP (df_idom
, 0, i
, bi
)
7851 bb
= BASIC_BLOCK_FOR_FN (cfun
, i
);
7852 for (dbb
= first_dom_son (CDI_DOMINATORS
, bb
);
7854 dbb
= next_dom_son (CDI_DOMINATORS
, dbb
))
7855 bbs_to_fix_dom
.safe_push (dbb
);
7858 iterate_fix_dominators (CDI_DOMINATORS
, bbs_to_fix_dom
, true);
7861 BITMAP_FREE (df_idom
);
7862 bbs_to_remove
.release ();
7863 bbs_to_fix_dom
.release ();
7866 /* Purge dead EH edges from basic block BB. */
7869 gimple_purge_dead_eh_edges (basic_block bb
)
7871 bool changed
= false;
7874 gimple stmt
= last_stmt (bb
);
7876 if (stmt
&& stmt_can_throw_internal (stmt
))
7879 for (ei
= ei_start (bb
->succs
); (e
= ei_safe_edge (ei
)); )
7881 if (e
->flags
& EDGE_EH
)
7883 remove_edge_and_dominated_blocks (e
);
7893 /* Purge dead EH edges from basic block listed in BLOCKS. */
7896 gimple_purge_all_dead_eh_edges (const_bitmap blocks
)
7898 bool changed
= false;
7902 EXECUTE_IF_SET_IN_BITMAP (blocks
, 0, i
, bi
)
7904 basic_block bb
= BASIC_BLOCK_FOR_FN (cfun
, i
);
7906 /* Earlier gimple_purge_dead_eh_edges could have removed
7907 this basic block already. */
7908 gcc_assert (bb
|| changed
);
7910 changed
|= gimple_purge_dead_eh_edges (bb
);
7916 /* Purge dead abnormal call edges from basic block BB. */
7919 gimple_purge_dead_abnormal_call_edges (basic_block bb
)
7921 bool changed
= false;
7924 gimple stmt
= last_stmt (bb
);
7926 if (!cfun
->has_nonlocal_label
7927 && !cfun
->calls_setjmp
)
7930 if (stmt
&& stmt_can_make_abnormal_goto (stmt
))
7933 for (ei
= ei_start (bb
->succs
); (e
= ei_safe_edge (ei
)); )
7935 if (e
->flags
& EDGE_ABNORMAL
)
7937 if (e
->flags
& EDGE_FALLTHRU
)
7938 e
->flags
&= ~EDGE_ABNORMAL
;
7940 remove_edge_and_dominated_blocks (e
);
7950 /* Purge dead abnormal call edges from basic block listed in BLOCKS. */
7953 gimple_purge_all_dead_abnormal_call_edges (const_bitmap blocks
)
7955 bool changed
= false;
7959 EXECUTE_IF_SET_IN_BITMAP (blocks
, 0, i
, bi
)
7961 basic_block bb
= BASIC_BLOCK_FOR_FN (cfun
, i
);
7963 /* Earlier gimple_purge_dead_abnormal_call_edges could have removed
7964 this basic block already. */
7965 gcc_assert (bb
|| changed
);
7967 changed
|= gimple_purge_dead_abnormal_call_edges (bb
);
7973 /* This function is called whenever a new edge is created or
7977 gimple_execute_on_growing_pred (edge e
)
7979 basic_block bb
= e
->dest
;
7981 if (!gimple_seq_empty_p (phi_nodes (bb
)))
7982 reserve_phi_args_for_new_edge (bb
);
7985 /* This function is called immediately before edge E is removed from
7986 the edge vector E->dest->preds. */
7989 gimple_execute_on_shrinking_pred (edge e
)
7991 if (!gimple_seq_empty_p (phi_nodes (e
->dest
)))
7992 remove_phi_args (e
);
7995 /*---------------------------------------------------------------------------
7996 Helper functions for Loop versioning
7997 ---------------------------------------------------------------------------*/
7999 /* Adjust phi nodes for 'first' basic block. 'second' basic block is a copy
8000 of 'first'. Both of them are dominated by 'new_head' basic block. When
8001 'new_head' was created by 'second's incoming edge it received phi arguments
8002 on the edge by split_edge(). Later, additional edge 'e' was created to
8003 connect 'new_head' and 'first'. Now this routine adds phi args on this
8004 additional edge 'e' that new_head to second edge received as part of edge
8008 gimple_lv_adjust_loop_header_phi (basic_block first
, basic_block second
,
8009 basic_block new_head
, edge e
)
8012 gphi_iterator psi1
, psi2
;
8014 edge e2
= find_edge (new_head
, second
);
8016 /* Because NEW_HEAD has been created by splitting SECOND's incoming
8017 edge, we should always have an edge from NEW_HEAD to SECOND. */
8018 gcc_assert (e2
!= NULL
);
8020 /* Browse all 'second' basic block phi nodes and add phi args to
8021 edge 'e' for 'first' head. PHI args are always in correct order. */
8023 for (psi2
= gsi_start_phis (second
),
8024 psi1
= gsi_start_phis (first
);
8025 !gsi_end_p (psi2
) && !gsi_end_p (psi1
);
8026 gsi_next (&psi2
), gsi_next (&psi1
))
8030 def
= PHI_ARG_DEF (phi2
, e2
->dest_idx
);
8031 add_phi_arg (phi1
, def
, e
, gimple_phi_arg_location_from_edge (phi2
, e2
));
8036 /* Adds a if else statement to COND_BB with condition COND_EXPR.
8037 SECOND_HEAD is the destination of the THEN and FIRST_HEAD is
8038 the destination of the ELSE part. */
8041 gimple_lv_add_condition_to_bb (basic_block first_head ATTRIBUTE_UNUSED
,
8042 basic_block second_head ATTRIBUTE_UNUSED
,
8043 basic_block cond_bb
, void *cond_e
)
8045 gimple_stmt_iterator gsi
;
8046 gimple new_cond_expr
;
8047 tree cond_expr
= (tree
) cond_e
;
8050 /* Build new conditional expr */
8051 new_cond_expr
= gimple_build_cond_from_tree (cond_expr
,
8052 NULL_TREE
, NULL_TREE
);
8054 /* Add new cond in cond_bb. */
8055 gsi
= gsi_last_bb (cond_bb
);
8056 gsi_insert_after (&gsi
, new_cond_expr
, GSI_NEW_STMT
);
8058 /* Adjust edges appropriately to connect new head with first head
8059 as well as second head. */
8060 e0
= single_succ_edge (cond_bb
);
8061 e0
->flags
&= ~EDGE_FALLTHRU
;
8062 e0
->flags
|= EDGE_FALSE_VALUE
;
8066 /* Do book-keeping of basic block BB for the profile consistency checker.
8067 If AFTER_PASS is 0, do pre-pass accounting, or if AFTER_PASS is 1
8068 then do post-pass accounting. Store the counting in RECORD. */
8070 gimple_account_profile_record (basic_block bb
, int after_pass
,
8071 struct profile_record
*record
)
8073 gimple_stmt_iterator i
;
8074 for (i
= gsi_start_bb (bb
); !gsi_end_p (i
); gsi_next (&i
))
8076 record
->size
[after_pass
]
8077 += estimate_num_insns (gsi_stmt (i
), &eni_size_weights
);
8078 if (profile_status_for_fn (cfun
) == PROFILE_READ
)
8079 record
->time
[after_pass
]
8080 += estimate_num_insns (gsi_stmt (i
),
8081 &eni_time_weights
) * bb
->count
;
8082 else if (profile_status_for_fn (cfun
) == PROFILE_GUESSED
)
8083 record
->time
[after_pass
]
8084 += estimate_num_insns (gsi_stmt (i
),
8085 &eni_time_weights
) * bb
->frequency
;
8089 struct cfg_hooks gimple_cfg_hooks
= {
8091 gimple_verify_flow_info
,
8092 gimple_dump_bb
, /* dump_bb */
8093 gimple_dump_bb_for_graph
, /* dump_bb_for_graph */
8094 create_bb
, /* create_basic_block */
8095 gimple_redirect_edge_and_branch
, /* redirect_edge_and_branch */
8096 gimple_redirect_edge_and_branch_force
, /* redirect_edge_and_branch_force */
8097 gimple_can_remove_branch_p
, /* can_remove_branch_p */
8098 remove_bb
, /* delete_basic_block */
8099 gimple_split_block
, /* split_block */
8100 gimple_move_block_after
, /* move_block_after */
8101 gimple_can_merge_blocks_p
, /* can_merge_blocks_p */
8102 gimple_merge_blocks
, /* merge_blocks */
8103 gimple_predict_edge
, /* predict_edge */
8104 gimple_predicted_by_p
, /* predicted_by_p */
8105 gimple_can_duplicate_bb_p
, /* can_duplicate_block_p */
8106 gimple_duplicate_bb
, /* duplicate_block */
8107 gimple_split_edge
, /* split_edge */
8108 gimple_make_forwarder_block
, /* make_forward_block */
8109 NULL
, /* tidy_fallthru_edge */
8110 NULL
, /* force_nonfallthru */
8111 gimple_block_ends_with_call_p
,/* block_ends_with_call_p */
8112 gimple_block_ends_with_condjump_p
, /* block_ends_with_condjump_p */
8113 gimple_flow_call_edges_add
, /* flow_call_edges_add */
8114 gimple_execute_on_growing_pred
, /* execute_on_growing_pred */
8115 gimple_execute_on_shrinking_pred
, /* execute_on_shrinking_pred */
8116 gimple_duplicate_loop_to_header_edge
, /* duplicate loop for trees */
8117 gimple_lv_add_condition_to_bb
, /* lv_add_condition_to_bb */
8118 gimple_lv_adjust_loop_header_phi
, /* lv_adjust_loop_header_phi*/
8119 extract_true_false_edges_from_block
, /* extract_cond_bb_edges */
8120 flush_pending_stmts
, /* flush_pending_stmts */
8121 gimple_empty_block_p
, /* block_empty_p */
8122 gimple_split_block_before_cond_jump
, /* split_block_before_cond_jump */
8123 gimple_account_profile_record
,
8127 /* Split all critical edges. */
8130 split_critical_edges (void)
8136 /* split_edge can redirect edges out of SWITCH_EXPRs, which can get
8137 expensive. So we want to enable recording of edge to CASE_LABEL_EXPR
8138 mappings around the calls to split_edge. */
8139 start_recording_case_labels ();
8140 FOR_ALL_BB_FN (bb
, cfun
)
8142 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
8144 if (EDGE_CRITICAL_P (e
) && !(e
->flags
& EDGE_ABNORMAL
))
8146 /* PRE inserts statements to edges and expects that
8147 since split_critical_edges was done beforehand, committing edge
8148 insertions will not split more edges. In addition to critical
8149 edges we must split edges that have multiple successors and
8150 end by control flow statements, such as RESX.
8151 Go ahead and split them too. This matches the logic in
8152 gimple_find_edge_insert_loc. */
8153 else if ((!single_pred_p (e
->dest
)
8154 || !gimple_seq_empty_p (phi_nodes (e
->dest
))
8155 || e
->dest
== EXIT_BLOCK_PTR_FOR_FN (cfun
))
8156 && e
->src
!= ENTRY_BLOCK_PTR_FOR_FN (cfun
)
8157 && !(e
->flags
& EDGE_ABNORMAL
))
8159 gimple_stmt_iterator gsi
;
8161 gsi
= gsi_last_bb (e
->src
);
8162 if (!gsi_end_p (gsi
)
8163 && stmt_ends_bb_p (gsi_stmt (gsi
))
8164 && (gimple_code (gsi_stmt (gsi
)) != GIMPLE_RETURN
8165 && !gimple_call_builtin_p (gsi_stmt (gsi
),
8171 end_recording_case_labels ();
8177 const pass_data pass_data_split_crit_edges
=
8179 GIMPLE_PASS
, /* type */
8180 "crited", /* name */
8181 OPTGROUP_NONE
, /* optinfo_flags */
8182 TV_TREE_SPLIT_EDGES
, /* tv_id */
8183 PROP_cfg
, /* properties_required */
8184 PROP_no_crit_edges
, /* properties_provided */
8185 0, /* properties_destroyed */
8186 0, /* todo_flags_start */
8187 0, /* todo_flags_finish */
8190 class pass_split_crit_edges
: public gimple_opt_pass
8193 pass_split_crit_edges (gcc::context
*ctxt
)
8194 : gimple_opt_pass (pass_data_split_crit_edges
, ctxt
)
8197 /* opt_pass methods: */
8198 virtual unsigned int execute (function
*) { return split_critical_edges (); }
8200 opt_pass
* clone () { return new pass_split_crit_edges (m_ctxt
); }
8201 }; // class pass_split_crit_edges
8206 make_pass_split_crit_edges (gcc::context
*ctxt
)
8208 return new pass_split_crit_edges (ctxt
);
8212 /* Build a ternary operation and gimplify it. Emit code before GSI.
8213 Return the gimple_val holding the result. */
8216 gimplify_build3 (gimple_stmt_iterator
*gsi
, enum tree_code code
,
8217 tree type
, tree a
, tree b
, tree c
)
8220 location_t loc
= gimple_location (gsi_stmt (*gsi
));
8222 ret
= fold_build3_loc (loc
, code
, type
, a
, b
, c
);
8225 return force_gimple_operand_gsi (gsi
, ret
, true, NULL
, true,
8229 /* Build a binary operation and gimplify it. Emit code before GSI.
8230 Return the gimple_val holding the result. */
8233 gimplify_build2 (gimple_stmt_iterator
*gsi
, enum tree_code code
,
8234 tree type
, tree a
, tree b
)
8238 ret
= fold_build2_loc (gimple_location (gsi_stmt (*gsi
)), code
, type
, a
, b
);
8241 return force_gimple_operand_gsi (gsi
, ret
, true, NULL
, true,
8245 /* Build a unary operation and gimplify it. Emit code before GSI.
8246 Return the gimple_val holding the result. */
8249 gimplify_build1 (gimple_stmt_iterator
*gsi
, enum tree_code code
, tree type
,
8254 ret
= fold_build1_loc (gimple_location (gsi_stmt (*gsi
)), code
, type
, a
);
8257 return force_gimple_operand_gsi (gsi
, ret
, true, NULL
, true,
8263 /* Given a basic block B which ends with a conditional and has
8264 precisely two successors, determine which of the edges is taken if
8265 the conditional is true and which is taken if the conditional is
8266 false. Set TRUE_EDGE and FALSE_EDGE appropriately. */
8269 extract_true_false_edges_from_block (basic_block b
,
8273 edge e
= EDGE_SUCC (b
, 0);
8275 if (e
->flags
& EDGE_TRUE_VALUE
)
8278 *false_edge
= EDGE_SUCC (b
, 1);
8283 *true_edge
= EDGE_SUCC (b
, 1);
8287 /* Emit return warnings. */
8291 const pass_data pass_data_warn_function_return
=
8293 GIMPLE_PASS
, /* type */
8294 "*warn_function_return", /* name */
8295 OPTGROUP_NONE
, /* optinfo_flags */
8296 TV_NONE
, /* tv_id */
8297 PROP_cfg
, /* properties_required */
8298 0, /* properties_provided */
8299 0, /* properties_destroyed */
8300 0, /* todo_flags_start */
8301 0, /* todo_flags_finish */
8304 class pass_warn_function_return
: public gimple_opt_pass
8307 pass_warn_function_return (gcc::context
*ctxt
)
8308 : gimple_opt_pass (pass_data_warn_function_return
, ctxt
)
8311 /* opt_pass methods: */
8312 virtual unsigned int execute (function
*);
8314 }; // class pass_warn_function_return
8317 pass_warn_function_return::execute (function
*fun
)
8319 source_location location
;
8324 if (!targetm
.warn_func_return (fun
->decl
))
8327 /* If we have a path to EXIT, then we do return. */
8328 if (TREE_THIS_VOLATILE (fun
->decl
)
8329 && EDGE_COUNT (EXIT_BLOCK_PTR_FOR_FN (fun
)->preds
) > 0)
8331 location
= UNKNOWN_LOCATION
;
8332 FOR_EACH_EDGE (e
, ei
, EXIT_BLOCK_PTR_FOR_FN (fun
)->preds
)
8334 last
= last_stmt (e
->src
);
8335 if ((gimple_code (last
) == GIMPLE_RETURN
8336 || gimple_call_builtin_p (last
, BUILT_IN_RETURN
))
8337 && (location
= gimple_location (last
)) != UNKNOWN_LOCATION
)
8340 if (location
== UNKNOWN_LOCATION
)
8341 location
= cfun
->function_end_locus
;
8342 warning_at (location
, 0, "%<noreturn%> function does return");
8345 /* If we see "return;" in some basic block, then we do reach the end
8346 without returning a value. */
8347 else if (warn_return_type
8348 && !TREE_NO_WARNING (fun
->decl
)
8349 && EDGE_COUNT (EXIT_BLOCK_PTR_FOR_FN (fun
)->preds
) > 0
8350 && !VOID_TYPE_P (TREE_TYPE (TREE_TYPE (fun
->decl
))))
8352 FOR_EACH_EDGE (e
, ei
, EXIT_BLOCK_PTR_FOR_FN (fun
)->preds
)
8354 gimple last
= last_stmt (e
->src
);
8355 greturn
*return_stmt
= dyn_cast
<greturn
*> (last
);
8357 && gimple_return_retval (return_stmt
) == NULL
8358 && !gimple_no_warning_p (last
))
8360 location
= gimple_location (last
);
8361 if (location
== UNKNOWN_LOCATION
)
8362 location
= fun
->function_end_locus
;
8363 warning_at (location
, OPT_Wreturn_type
, "control reaches end of non-void function");
8364 TREE_NO_WARNING (fun
->decl
) = 1;
8375 make_pass_warn_function_return (gcc::context
*ctxt
)
8377 return new pass_warn_function_return (ctxt
);
8380 /* Walk a gimplified function and warn for functions whose return value is
8381 ignored and attribute((warn_unused_result)) is set. This is done before
8382 inlining, so we don't have to worry about that. */
8385 do_warn_unused_result (gimple_seq seq
)
8388 gimple_stmt_iterator i
;
8390 for (i
= gsi_start (seq
); !gsi_end_p (i
); gsi_next (&i
))
8392 gimple g
= gsi_stmt (i
);
8394 switch (gimple_code (g
))
8397 do_warn_unused_result (gimple_bind_body (as_a
<gbind
*>(g
)));
8400 do_warn_unused_result (gimple_try_eval (g
));
8401 do_warn_unused_result (gimple_try_cleanup (g
));
8404 do_warn_unused_result (gimple_catch_handler (
8405 as_a
<gcatch
*> (g
)));
8407 case GIMPLE_EH_FILTER
:
8408 do_warn_unused_result (gimple_eh_filter_failure (g
));
8412 if (gimple_call_lhs (g
))
8414 if (gimple_call_internal_p (g
))
8417 /* This is a naked call, as opposed to a GIMPLE_CALL with an
8418 LHS. All calls whose value is ignored should be
8419 represented like this. Look for the attribute. */
8420 fdecl
= gimple_call_fndecl (g
);
8421 ftype
= gimple_call_fntype (g
);
8423 if (lookup_attribute ("warn_unused_result", TYPE_ATTRIBUTES (ftype
)))
8425 location_t loc
= gimple_location (g
);
8428 warning_at (loc
, OPT_Wunused_result
,
8429 "ignoring return value of %qD, "
8430 "declared with attribute warn_unused_result",
8433 warning_at (loc
, OPT_Wunused_result
,
8434 "ignoring return value of function "
8435 "declared with attribute warn_unused_result");
8440 /* Not a container, not a call, or a call whose value is used. */
8448 const pass_data pass_data_warn_unused_result
=
8450 GIMPLE_PASS
, /* type */
8451 "*warn_unused_result", /* name */
8452 OPTGROUP_NONE
, /* optinfo_flags */
8453 TV_NONE
, /* tv_id */
8454 PROP_gimple_any
, /* properties_required */
8455 0, /* properties_provided */
8456 0, /* properties_destroyed */
8457 0, /* todo_flags_start */
8458 0, /* todo_flags_finish */
8461 class pass_warn_unused_result
: public gimple_opt_pass
8464 pass_warn_unused_result (gcc::context
*ctxt
)
8465 : gimple_opt_pass (pass_data_warn_unused_result
, ctxt
)
8468 /* opt_pass methods: */
8469 virtual bool gate (function
*) { return flag_warn_unused_result
; }
8470 virtual unsigned int execute (function
*)
8472 do_warn_unused_result (gimple_body (current_function_decl
));
8476 }; // class pass_warn_unused_result
8481 make_pass_warn_unused_result (gcc::context
*ctxt
)
8483 return new pass_warn_unused_result (ctxt
);
8486 /* IPA passes, compilation of earlier functions or inlining
8487 might have changed some properties, such as marked functions nothrow,
8488 pure, const or noreturn.
8489 Remove redundant edges and basic blocks, and create new ones if necessary.
8491 This pass can't be executed as stand alone pass from pass manager, because
8492 in between inlining and this fixup the verify_flow_info would fail. */
8495 execute_fixup_cfg (void)
8498 gimple_stmt_iterator gsi
;
8500 gcov_type count_scale
;
8505 = GCOV_COMPUTE_SCALE (cgraph_node::get (current_function_decl
)->count
,
8506 ENTRY_BLOCK_PTR_FOR_FN (cfun
)->count
);
8508 ENTRY_BLOCK_PTR_FOR_FN (cfun
)->count
=
8509 cgraph_node::get (current_function_decl
)->count
;
8510 EXIT_BLOCK_PTR_FOR_FN (cfun
)->count
=
8511 apply_scale (EXIT_BLOCK_PTR_FOR_FN (cfun
)->count
,
8514 FOR_EACH_EDGE (e
, ei
, ENTRY_BLOCK_PTR_FOR_FN (cfun
)->succs
)
8515 e
->count
= apply_scale (e
->count
, count_scale
);
8517 FOR_EACH_BB_FN (bb
, cfun
)
8519 bb
->count
= apply_scale (bb
->count
, count_scale
);
8520 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
);)
8522 gimple stmt
= gsi_stmt (gsi
);
8523 tree decl
= is_gimple_call (stmt
)
8524 ? gimple_call_fndecl (stmt
)
8528 int flags
= gimple_call_flags (stmt
);
8529 if (flags
& (ECF_CONST
| ECF_PURE
| ECF_LOOPING_CONST_OR_PURE
))
8531 if (gimple_purge_dead_abnormal_call_edges (bb
))
8532 todo
|= TODO_cleanup_cfg
;
8534 if (gimple_in_ssa_p (cfun
))
8536 todo
|= TODO_update_ssa
| TODO_cleanup_cfg
;
8541 if (flags
& ECF_NORETURN
8542 && fixup_noreturn_call (stmt
))
8543 todo
|= TODO_cleanup_cfg
;
8546 /* Remove stores to variables we marked write-only.
8547 Keep access when store has side effect, i.e. in case when source
8549 if (gimple_store_p (stmt
)
8550 && !gimple_has_side_effects (stmt
))
8552 tree lhs
= get_base_address (gimple_get_lhs (stmt
));
8554 if (TREE_CODE (lhs
) == VAR_DECL
8555 && (TREE_STATIC (lhs
) || DECL_EXTERNAL (lhs
))
8556 && varpool_node::get (lhs
)->writeonly
)
8558 unlink_stmt_vdef (stmt
);
8559 gsi_remove (&gsi
, true);
8560 release_defs (stmt
);
8561 todo
|= TODO_update_ssa
| TODO_cleanup_cfg
;
8565 /* For calls we can simply remove LHS when it is known
8566 to be write-only. */
8567 if (is_gimple_call (stmt
)
8568 && gimple_get_lhs (stmt
))
8570 tree lhs
= get_base_address (gimple_get_lhs (stmt
));
8572 if (TREE_CODE (lhs
) == VAR_DECL
8573 && (TREE_STATIC (lhs
) || DECL_EXTERNAL (lhs
))
8574 && varpool_node::get (lhs
)->writeonly
)
8576 gimple_call_set_lhs (stmt
, NULL
);
8578 todo
|= TODO_update_ssa
| TODO_cleanup_cfg
;
8582 if (maybe_clean_eh_stmt (stmt
)
8583 && gimple_purge_dead_eh_edges (bb
))
8584 todo
|= TODO_cleanup_cfg
;
8588 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
8589 e
->count
= apply_scale (e
->count
, count_scale
);
8591 /* If we have a basic block with no successors that does not
8592 end with a control statement or a noreturn call end it with
8593 a call to __builtin_unreachable. This situation can occur
8594 when inlining a noreturn call that does in fact return. */
8595 if (EDGE_COUNT (bb
->succs
) == 0)
8597 gimple stmt
= last_stmt (bb
);
8599 || (!is_ctrl_stmt (stmt
)
8600 && (!is_gimple_call (stmt
)
8601 || (gimple_call_flags (stmt
) & ECF_NORETURN
) == 0)))
8603 if (stmt
&& is_gimple_call (stmt
))
8604 gimple_call_set_ctrl_altering (stmt
, false);
8605 stmt
= gimple_build_call
8606 (builtin_decl_implicit (BUILT_IN_UNREACHABLE
), 0);
8607 gimple_stmt_iterator gsi
= gsi_last_bb (bb
);
8608 gsi_insert_after (&gsi
, stmt
, GSI_NEW_STMT
);
8612 if (count_scale
!= REG_BR_PROB_BASE
)
8613 compute_function_frequency ();
8615 /* Dump a textual representation of the flowgraph. */
8617 gimple_dump_cfg (dump_file
, dump_flags
);
8620 && (todo
& TODO_cleanup_cfg
))
8621 loops_state_set (LOOPS_NEED_FIXUP
);
8628 const pass_data pass_data_fixup_cfg
=
8630 GIMPLE_PASS
, /* type */
8631 "*free_cfg_annotations", /* name */
8632 OPTGROUP_NONE
, /* optinfo_flags */
8633 TV_NONE
, /* tv_id */
8634 PROP_cfg
, /* properties_required */
8635 0, /* properties_provided */
8636 0, /* properties_destroyed */
8637 0, /* todo_flags_start */
8638 0, /* todo_flags_finish */
8641 class pass_fixup_cfg
: public gimple_opt_pass
8644 pass_fixup_cfg (gcc::context
*ctxt
)
8645 : gimple_opt_pass (pass_data_fixup_cfg
, ctxt
)
8648 /* opt_pass methods: */
8649 opt_pass
* clone () { return new pass_fixup_cfg (m_ctxt
); }
8650 virtual unsigned int execute (function
*) { return execute_fixup_cfg (); }
8652 }; // class pass_fixup_cfg
8657 make_pass_fixup_cfg (gcc::context
*ctxt
)
8659 return new pass_fixup_cfg (ctxt
);
8662 /* Garbage collection support for edge_def. */
8664 extern void gt_ggc_mx (tree
&);
8665 extern void gt_ggc_mx (gimple
&);
8666 extern void gt_ggc_mx (rtx
&);
8667 extern void gt_ggc_mx (basic_block
&);
8670 gt_ggc_mx (rtx_insn
*& x
)
8673 gt_ggc_mx_rtx_def ((void *) x
);
8677 gt_ggc_mx (edge_def
*e
)
8679 tree block
= LOCATION_BLOCK (e
->goto_locus
);
8681 gt_ggc_mx (e
->dest
);
8682 if (current_ir_type () == IR_GIMPLE
)
8683 gt_ggc_mx (e
->insns
.g
);
8685 gt_ggc_mx (e
->insns
.r
);
8689 /* PCH support for edge_def. */
8691 extern void gt_pch_nx (tree
&);
8692 extern void gt_pch_nx (gimple
&);
8693 extern void gt_pch_nx (rtx
&);
8694 extern void gt_pch_nx (basic_block
&);
8697 gt_pch_nx (rtx_insn
*& x
)
8700 gt_pch_nx_rtx_def ((void *) x
);
8704 gt_pch_nx (edge_def
*e
)
8706 tree block
= LOCATION_BLOCK (e
->goto_locus
);
8708 gt_pch_nx (e
->dest
);
8709 if (current_ir_type () == IR_GIMPLE
)
8710 gt_pch_nx (e
->insns
.g
);
8712 gt_pch_nx (e
->insns
.r
);
8717 gt_pch_nx (edge_def
*e
, gt_pointer_operator op
, void *cookie
)
8719 tree block
= LOCATION_BLOCK (e
->goto_locus
);
8720 op (&(e
->src
), cookie
);
8721 op (&(e
->dest
), cookie
);
8722 if (current_ir_type () == IR_GIMPLE
)
8723 op (&(e
->insns
.g
), cookie
);
8725 op (&(e
->insns
.r
), cookie
);
8726 op (&(block
), cookie
);