1 /* Control flow functions for trees.
2 Copyright (C) 2001-2015 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"
30 #include "tree-pass.h"
34 #include "insn-config.h"
37 #include "gimple-pretty-print.h"
38 #include "diagnostic-core.h"
40 #include "fold-const.h"
41 #include "trans-mem.h"
42 #include "stor-layout.h"
43 #include "print-tree.h"
46 #include "internal-fn.h"
47 #include "gimple-fold.h"
49 #include "gimple-iterator.h"
50 #include "gimplify-me.h"
51 #include "gimple-walk.h"
53 #include "tree-ssa-loop-manip.h"
54 #include "tree-ssa-loop-niter.h"
55 #include "tree-into-ssa.h"
64 #include "tree-dump.h"
67 #include "tree-ssa-propagate.h"
68 #include "value-prof.h"
69 #include "tree-inline.h"
70 #include "tree-ssa-live.h"
72 #include "tree-cfgcleanup.h"
76 /* This file contains functions for building the Control Flow Graph (CFG)
77 for a function tree. */
79 /* Local declarations. */
81 /* Initial capacity for the basic block array. */
82 static const int initial_cfg_capacity
= 20;
84 /* This hash table allows us to efficiently lookup all CASE_LABEL_EXPRs
85 which use a particular edge. The CASE_LABEL_EXPRs are chained together
86 via their CASE_CHAIN field, which we clear after we're done with the
87 hash table to prevent problems with duplication of GIMPLE_SWITCHes.
89 Access to this list of CASE_LABEL_EXPRs allows us to efficiently
90 update the case vector in response to edge redirections.
92 Right now this table is set up and torn down at key points in the
93 compilation process. It would be nice if we could make the table
94 more persistent. The key is getting notification of changes to
95 the CFG (particularly edge removal, creation and redirection). */
97 static hash_map
<edge
, tree
> *edge_to_cases
;
99 /* If we record edge_to_cases, this bitmap will hold indexes
100 of basic blocks that end in a GIMPLE_SWITCH which we touched
101 due to edge manipulations. */
103 static bitmap touched_switch_bbs
;
105 /* CFG statistics. */
108 long num_merged_labels
;
111 static struct cfg_stats_d cfg_stats
;
113 /* Data to pass to replace_block_vars_by_duplicates_1. */
114 struct replace_decls_d
116 hash_map
<tree
, tree
> *vars_map
;
120 /* Hash table to store last discriminator assigned for each locus. */
121 struct locus_discrim_map
127 /* Hashtable helpers. */
129 struct locus_discrim_hasher
: free_ptr_hash
<locus_discrim_map
>
131 static inline hashval_t
hash (const locus_discrim_map
*);
132 static inline bool equal (const locus_discrim_map
*,
133 const locus_discrim_map
*);
136 /* Trivial hash function for a location_t. ITEM is a pointer to
137 a hash table entry that maps a location_t to a discriminator. */
140 locus_discrim_hasher::hash (const locus_discrim_map
*item
)
142 return LOCATION_LINE (item
->locus
);
145 /* Equality function for the locus-to-discriminator map. A and B
146 point to the two hash table entries to compare. */
149 locus_discrim_hasher::equal (const locus_discrim_map
*a
,
150 const locus_discrim_map
*b
)
152 return LOCATION_LINE (a
->locus
) == LOCATION_LINE (b
->locus
);
155 static hash_table
<locus_discrim_hasher
> *discriminator_per_locus
;
157 /* Basic blocks and flowgraphs. */
158 static void make_blocks (gimple_seq
);
161 static void make_edges (void);
162 static void assign_discriminators (void);
163 static void make_cond_expr_edges (basic_block
);
164 static void make_gimple_switch_edges (gswitch
*, basic_block
);
165 static bool make_goto_expr_edges (basic_block
);
166 static void make_gimple_asm_edges (basic_block
);
167 static edge
gimple_redirect_edge_and_branch (edge
, basic_block
);
168 static edge
gimple_try_redirect_by_replacing_jump (edge
, basic_block
);
170 /* Various helpers. */
171 static inline bool stmt_starts_bb_p (gimple
*, gimple
*);
172 static int gimple_verify_flow_info (void);
173 static void gimple_make_forwarder_block (edge
);
174 static gimple
*first_non_label_stmt (basic_block
);
175 static bool verify_gimple_transaction (gtransaction
*);
176 static bool call_can_make_abnormal_goto (gimple
*);
178 /* Flowgraph optimization and cleanup. */
179 static void gimple_merge_blocks (basic_block
, basic_block
);
180 static bool gimple_can_merge_blocks_p (basic_block
, basic_block
);
181 static void remove_bb (basic_block
);
182 static edge
find_taken_edge_computed_goto (basic_block
, tree
);
183 static edge
find_taken_edge_cond_expr (basic_block
, tree
);
184 static edge
find_taken_edge_switch_expr (gswitch
*, basic_block
, tree
);
185 static tree
find_case_label_for_value (gswitch
*, tree
);
188 init_empty_tree_cfg_for_function (struct function
*fn
)
190 /* Initialize the basic block array. */
192 profile_status_for_fn (fn
) = PROFILE_ABSENT
;
193 n_basic_blocks_for_fn (fn
) = NUM_FIXED_BLOCKS
;
194 last_basic_block_for_fn (fn
) = NUM_FIXED_BLOCKS
;
195 vec_alloc (basic_block_info_for_fn (fn
), initial_cfg_capacity
);
196 vec_safe_grow_cleared (basic_block_info_for_fn (fn
),
197 initial_cfg_capacity
);
199 /* Build a mapping of labels to their associated blocks. */
200 vec_alloc (label_to_block_map_for_fn (fn
), initial_cfg_capacity
);
201 vec_safe_grow_cleared (label_to_block_map_for_fn (fn
),
202 initial_cfg_capacity
);
204 SET_BASIC_BLOCK_FOR_FN (fn
, ENTRY_BLOCK
, ENTRY_BLOCK_PTR_FOR_FN (fn
));
205 SET_BASIC_BLOCK_FOR_FN (fn
, EXIT_BLOCK
, EXIT_BLOCK_PTR_FOR_FN (fn
));
207 ENTRY_BLOCK_PTR_FOR_FN (fn
)->next_bb
208 = EXIT_BLOCK_PTR_FOR_FN (fn
);
209 EXIT_BLOCK_PTR_FOR_FN (fn
)->prev_bb
210 = ENTRY_BLOCK_PTR_FOR_FN (fn
);
214 init_empty_tree_cfg (void)
216 init_empty_tree_cfg_for_function (cfun
);
219 /*---------------------------------------------------------------------------
221 ---------------------------------------------------------------------------*/
223 /* Entry point to the CFG builder for trees. SEQ is the sequence of
224 statements to be added to the flowgraph. */
227 build_gimple_cfg (gimple_seq seq
)
229 /* Register specific gimple functions. */
230 gimple_register_cfg_hooks ();
232 memset ((void *) &cfg_stats
, 0, sizeof (cfg_stats
));
234 init_empty_tree_cfg ();
238 /* Make sure there is always at least one block, even if it's empty. */
239 if (n_basic_blocks_for_fn (cfun
) == NUM_FIXED_BLOCKS
)
240 create_empty_bb (ENTRY_BLOCK_PTR_FOR_FN (cfun
));
242 /* Adjust the size of the array. */
243 if (basic_block_info_for_fn (cfun
)->length ()
244 < (size_t) n_basic_blocks_for_fn (cfun
))
245 vec_safe_grow_cleared (basic_block_info_for_fn (cfun
),
246 n_basic_blocks_for_fn (cfun
));
248 /* To speed up statement iterator walks, we first purge dead labels. */
249 cleanup_dead_labels ();
251 /* Group case nodes to reduce the number of edges.
252 We do this after cleaning up dead labels because otherwise we miss
253 a lot of obvious case merging opportunities. */
254 group_case_labels ();
256 /* Create the edges of the flowgraph. */
257 discriminator_per_locus
= new hash_table
<locus_discrim_hasher
> (13);
259 assign_discriminators ();
260 cleanup_dead_labels ();
261 delete discriminator_per_locus
;
262 discriminator_per_locus
= NULL
;
265 /* Look for ANNOTATE calls with loop annotation kind in BB; if found, remove
266 them and propagate the information to LOOP. We assume that the annotations
267 come immediately before the condition in BB, if any. */
270 replace_loop_annotate_in_block (basic_block bb
, struct loop
*loop
)
272 gimple_stmt_iterator gsi
= gsi_last_bb (bb
);
273 gimple
*stmt
= gsi_stmt (gsi
);
275 if (!(stmt
&& gimple_code (stmt
) == GIMPLE_COND
))
278 for (gsi_prev_nondebug (&gsi
); !gsi_end_p (gsi
); gsi_prev (&gsi
))
280 stmt
= gsi_stmt (gsi
);
281 if (gimple_code (stmt
) != GIMPLE_CALL
)
283 if (!gimple_call_internal_p (stmt
)
284 || gimple_call_internal_fn (stmt
) != IFN_ANNOTATE
)
287 switch ((annot_expr_kind
) tree_to_shwi (gimple_call_arg (stmt
, 1)))
289 case annot_expr_ivdep_kind
:
290 loop
->safelen
= INT_MAX
;
292 case annot_expr_no_vector_kind
:
293 loop
->dont_vectorize
= true;
295 case annot_expr_vector_kind
:
296 loop
->force_vectorize
= true;
297 cfun
->has_force_vectorize_loops
= true;
303 stmt
= gimple_build_assign (gimple_call_lhs (stmt
),
304 gimple_call_arg (stmt
, 0));
305 gsi_replace (&gsi
, stmt
, true);
309 /* Look for ANNOTATE calls with loop annotation kind; if found, remove
310 them and propagate the information to the loop. We assume that the
311 annotations come immediately before the condition of the loop. */
314 replace_loop_annotate (void)
318 gimple_stmt_iterator gsi
;
321 FOR_EACH_LOOP (loop
, 0)
323 /* First look into the header. */
324 replace_loop_annotate_in_block (loop
->header
, loop
);
326 /* Then look into the latch, if any. */
328 replace_loop_annotate_in_block (loop
->latch
, loop
);
331 /* Remove IFN_ANNOTATE. Safeguard for the case loop->latch == NULL. */
332 FOR_EACH_BB_FN (bb
, cfun
)
334 for (gsi
= gsi_last_bb (bb
); !gsi_end_p (gsi
); gsi_prev (&gsi
))
336 stmt
= gsi_stmt (gsi
);
337 if (gimple_code (stmt
) != GIMPLE_CALL
)
339 if (!gimple_call_internal_p (stmt
)
340 || gimple_call_internal_fn (stmt
) != IFN_ANNOTATE
)
343 switch ((annot_expr_kind
) tree_to_shwi (gimple_call_arg (stmt
, 1)))
345 case annot_expr_ivdep_kind
:
346 case annot_expr_no_vector_kind
:
347 case annot_expr_vector_kind
:
353 warning_at (gimple_location (stmt
), 0, "ignoring loop annotation");
354 stmt
= gimple_build_assign (gimple_call_lhs (stmt
),
355 gimple_call_arg (stmt
, 0));
356 gsi_replace (&gsi
, stmt
, true);
363 execute_build_cfg (void)
365 gimple_seq body
= gimple_body (current_function_decl
);
367 build_gimple_cfg (body
);
368 gimple_set_body (current_function_decl
, NULL
);
369 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
371 fprintf (dump_file
, "Scope blocks:\n");
372 dump_scope_blocks (dump_file
, dump_flags
);
375 loop_optimizer_init (AVOID_CFG_MODIFICATIONS
);
376 replace_loop_annotate ();
382 const pass_data pass_data_build_cfg
=
384 GIMPLE_PASS
, /* type */
386 OPTGROUP_NONE
, /* optinfo_flags */
387 TV_TREE_CFG
, /* tv_id */
388 PROP_gimple_leh
, /* properties_required */
389 ( PROP_cfg
| PROP_loops
), /* properties_provided */
390 0, /* properties_destroyed */
391 0, /* todo_flags_start */
392 0, /* todo_flags_finish */
395 class pass_build_cfg
: public gimple_opt_pass
398 pass_build_cfg (gcc::context
*ctxt
)
399 : gimple_opt_pass (pass_data_build_cfg
, ctxt
)
402 /* opt_pass methods: */
403 virtual unsigned int execute (function
*) { return execute_build_cfg (); }
405 }; // class pass_build_cfg
410 make_pass_build_cfg (gcc::context
*ctxt
)
412 return new pass_build_cfg (ctxt
);
416 /* Return true if T is a computed goto. */
419 computed_goto_p (gimple
*t
)
421 return (gimple_code (t
) == GIMPLE_GOTO
422 && TREE_CODE (gimple_goto_dest (t
)) != LABEL_DECL
);
425 /* Returns true for edge E where e->src ends with a GIMPLE_COND and
426 the other edge points to a bb with just __builtin_unreachable ().
427 I.e. return true for C->M edge in:
435 __builtin_unreachable ();
439 assert_unreachable_fallthru_edge_p (edge e
)
441 basic_block pred_bb
= e
->src
;
442 gimple
*last
= last_stmt (pred_bb
);
443 if (last
&& gimple_code (last
) == GIMPLE_COND
)
445 basic_block other_bb
= EDGE_SUCC (pred_bb
, 0)->dest
;
446 if (other_bb
== e
->dest
)
447 other_bb
= EDGE_SUCC (pred_bb
, 1)->dest
;
448 if (EDGE_COUNT (other_bb
->succs
) == 0)
450 gimple_stmt_iterator gsi
= gsi_after_labels (other_bb
);
455 stmt
= gsi_stmt (gsi
);
456 while (is_gimple_debug (stmt
) || gimple_clobber_p (stmt
))
461 stmt
= gsi_stmt (gsi
);
463 return gimple_call_builtin_p (stmt
, BUILT_IN_UNREACHABLE
);
470 /* Initialize GF_CALL_CTRL_ALTERING flag, which indicates the call
471 could alter control flow except via eh. We initialize the flag at
472 CFG build time and only ever clear it later. */
475 gimple_call_initialize_ctrl_altering (gimple
*stmt
)
477 int flags
= gimple_call_flags (stmt
);
479 /* A call alters control flow if it can make an abnormal goto. */
480 if (call_can_make_abnormal_goto (stmt
)
481 /* A call also alters control flow if it does not return. */
482 || flags
& ECF_NORETURN
483 /* TM ending statements have backedges out of the transaction.
484 Return true so we split the basic block containing them.
485 Note that the TM_BUILTIN test is merely an optimization. */
486 || ((flags
& ECF_TM_BUILTIN
)
487 && is_tm_ending_fndecl (gimple_call_fndecl (stmt
)))
488 /* BUILT_IN_RETURN call is same as return statement. */
489 || gimple_call_builtin_p (stmt
, BUILT_IN_RETURN
)
490 /* IFN_UNIQUE should be the last insn, to make checking for it
491 as cheap as possible. */
492 || (gimple_call_internal_p (stmt
)
493 && gimple_call_internal_unique_p (stmt
)))
494 gimple_call_set_ctrl_altering (stmt
, true);
496 gimple_call_set_ctrl_altering (stmt
, false);
500 /* Insert SEQ after BB and build a flowgraph. */
503 make_blocks_1 (gimple_seq seq
, basic_block bb
)
505 gimple_stmt_iterator i
= gsi_start (seq
);
507 bool start_new_block
= true;
508 bool first_stmt_of_seq
= true;
510 while (!gsi_end_p (i
))
517 if (stmt
&& is_gimple_call (stmt
))
518 gimple_call_initialize_ctrl_altering (stmt
);
520 /* If the statement starts a new basic block or if we have determined
521 in a previous pass that we need to create a new block for STMT, do
523 if (start_new_block
|| stmt_starts_bb_p (stmt
, prev_stmt
))
525 if (!first_stmt_of_seq
)
526 gsi_split_seq_before (&i
, &seq
);
527 bb
= create_basic_block (seq
, bb
);
528 start_new_block
= false;
531 /* Now add STMT to BB and create the subgraphs for special statement
533 gimple_set_bb (stmt
, bb
);
535 /* If STMT is a basic block terminator, set START_NEW_BLOCK for the
537 if (stmt_ends_bb_p (stmt
))
539 /* If the stmt can make abnormal goto use a new temporary
540 for the assignment to the LHS. This makes sure the old value
541 of the LHS is available on the abnormal edge. Otherwise
542 we will end up with overlapping life-ranges for abnormal
544 if (gimple_has_lhs (stmt
)
545 && stmt_can_make_abnormal_goto (stmt
)
546 && is_gimple_reg_type (TREE_TYPE (gimple_get_lhs (stmt
))))
548 tree lhs
= gimple_get_lhs (stmt
);
549 tree tmp
= create_tmp_var (TREE_TYPE (lhs
));
550 gimple
*s
= gimple_build_assign (lhs
, tmp
);
551 gimple_set_location (s
, gimple_location (stmt
));
552 gimple_set_block (s
, gimple_block (stmt
));
553 gimple_set_lhs (stmt
, tmp
);
554 if (TREE_CODE (TREE_TYPE (tmp
)) == COMPLEX_TYPE
555 || TREE_CODE (TREE_TYPE (tmp
)) == VECTOR_TYPE
)
556 DECL_GIMPLE_REG_P (tmp
) = 1;
557 gsi_insert_after (&i
, s
, GSI_SAME_STMT
);
559 start_new_block
= true;
563 first_stmt_of_seq
= false;
568 /* Build a flowgraph for the sequence of stmts SEQ. */
571 make_blocks (gimple_seq seq
)
573 make_blocks_1 (seq
, ENTRY_BLOCK_PTR_FOR_FN (cfun
));
576 /* Create and return a new empty basic block after bb AFTER. */
579 create_bb (void *h
, void *e
, basic_block after
)
585 /* Create and initialize a new basic block. Since alloc_block uses
586 GC allocation that clears memory to allocate a basic block, we do
587 not have to clear the newly allocated basic block here. */
590 bb
->index
= last_basic_block_for_fn (cfun
);
592 set_bb_seq (bb
, h
? (gimple_seq
) h
: NULL
);
594 /* Add the new block to the linked list of blocks. */
595 link_block (bb
, after
);
597 /* Grow the basic block array if needed. */
598 if ((size_t) last_basic_block_for_fn (cfun
)
599 == basic_block_info_for_fn (cfun
)->length ())
602 (last_basic_block_for_fn (cfun
)
603 + (last_basic_block_for_fn (cfun
) + 3) / 4);
604 vec_safe_grow_cleared (basic_block_info_for_fn (cfun
), new_size
);
607 /* Add the newly created block to the array. */
608 SET_BASIC_BLOCK_FOR_FN (cfun
, last_basic_block_for_fn (cfun
), bb
);
610 n_basic_blocks_for_fn (cfun
)++;
611 last_basic_block_for_fn (cfun
)++;
617 /*---------------------------------------------------------------------------
619 ---------------------------------------------------------------------------*/
621 /* If basic block BB has an abnormal edge to a basic block
622 containing IFN_ABNORMAL_DISPATCHER internal call, return
623 that the dispatcher's basic block, otherwise return NULL. */
626 get_abnormal_succ_dispatcher (basic_block bb
)
631 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
632 if ((e
->flags
& (EDGE_ABNORMAL
| EDGE_EH
)) == EDGE_ABNORMAL
)
634 gimple_stmt_iterator gsi
635 = gsi_start_nondebug_after_labels_bb (e
->dest
);
636 gimple
*g
= gsi_stmt (gsi
);
638 && is_gimple_call (g
)
639 && gimple_call_internal_p (g
)
640 && gimple_call_internal_fn (g
) == IFN_ABNORMAL_DISPATCHER
)
646 /* Helper function for make_edges. Create a basic block with
647 with ABNORMAL_DISPATCHER internal call in it if needed, and
648 create abnormal edges from BBS to it and from it to FOR_BB
649 if COMPUTED_GOTO is false, otherwise factor the computed gotos. */
652 handle_abnormal_edges (basic_block
*dispatcher_bbs
,
653 basic_block for_bb
, int *bb_to_omp_idx
,
654 auto_vec
<basic_block
> *bbs
, bool computed_goto
)
656 basic_block
*dispatcher
= dispatcher_bbs
+ (computed_goto
? 1 : 0);
657 unsigned int idx
= 0;
663 dispatcher
= dispatcher_bbs
+ 2 * bb_to_omp_idx
[for_bb
->index
];
664 if (bb_to_omp_idx
[for_bb
->index
] != 0)
668 /* If the dispatcher has been created already, then there are basic
669 blocks with abnormal edges to it, so just make a new edge to
671 if (*dispatcher
== NULL
)
673 /* Check if there are any basic blocks that need to have
674 abnormal edges to this dispatcher. If there are none, return
676 if (bb_to_omp_idx
== NULL
)
678 if (bbs
->is_empty ())
683 FOR_EACH_VEC_ELT (*bbs
, idx
, bb
)
684 if (bb_to_omp_idx
[bb
->index
] == bb_to_omp_idx
[for_bb
->index
])
690 /* Create the dispatcher bb. */
691 *dispatcher
= create_basic_block (NULL
, for_bb
);
694 /* Factor computed gotos into a common computed goto site. Also
695 record the location of that site so that we can un-factor the
696 gotos after we have converted back to normal form. */
697 gimple_stmt_iterator gsi
= gsi_start_bb (*dispatcher
);
699 /* Create the destination of the factored goto. Each original
700 computed goto will put its desired destination into this
701 variable and jump to the label we create immediately below. */
702 tree var
= create_tmp_var (ptr_type_node
, "gotovar");
704 /* Build a label for the new block which will contain the
705 factored computed goto. */
706 tree factored_label_decl
707 = create_artificial_label (UNKNOWN_LOCATION
);
708 gimple
*factored_computed_goto_label
709 = gimple_build_label (factored_label_decl
);
710 gsi_insert_after (&gsi
, factored_computed_goto_label
, GSI_NEW_STMT
);
712 /* Build our new computed goto. */
713 gimple
*factored_computed_goto
= gimple_build_goto (var
);
714 gsi_insert_after (&gsi
, factored_computed_goto
, GSI_NEW_STMT
);
716 FOR_EACH_VEC_ELT (*bbs
, idx
, bb
)
719 && bb_to_omp_idx
[bb
->index
] != bb_to_omp_idx
[for_bb
->index
])
722 gsi
= gsi_last_bb (bb
);
723 gimple
*last
= gsi_stmt (gsi
);
725 gcc_assert (computed_goto_p (last
));
727 /* Copy the original computed goto's destination into VAR. */
729 = gimple_build_assign (var
, gimple_goto_dest (last
));
730 gsi_insert_before (&gsi
, assignment
, GSI_SAME_STMT
);
732 edge e
= make_edge (bb
, *dispatcher
, EDGE_FALLTHRU
);
733 e
->goto_locus
= gimple_location (last
);
734 gsi_remove (&gsi
, true);
739 tree arg
= inner
? boolean_true_node
: boolean_false_node
;
740 gimple
*g
= gimple_build_call_internal (IFN_ABNORMAL_DISPATCHER
,
742 gimple_stmt_iterator gsi
= gsi_after_labels (*dispatcher
);
743 gsi_insert_after (&gsi
, g
, GSI_NEW_STMT
);
745 /* Create predecessor edges of the dispatcher. */
746 FOR_EACH_VEC_ELT (*bbs
, idx
, bb
)
749 && bb_to_omp_idx
[bb
->index
] != bb_to_omp_idx
[for_bb
->index
])
751 make_edge (bb
, *dispatcher
, EDGE_ABNORMAL
);
756 make_edge (*dispatcher
, for_bb
, EDGE_ABNORMAL
);
759 /* Creates outgoing edges for BB. Returns 1 when it ends with an
760 computed goto, returns 2 when it ends with a statement that
761 might return to this function via an nonlocal goto, otherwise
762 return 0. Updates *PCUR_REGION with the OMP region this BB is in. */
765 make_edges_bb (basic_block bb
, struct omp_region
**pcur_region
, int *pomp_index
)
767 gimple
*last
= last_stmt (bb
);
768 bool fallthru
= false;
774 switch (gimple_code (last
))
777 if (make_goto_expr_edges (bb
))
783 edge e
= make_edge (bb
, EXIT_BLOCK_PTR_FOR_FN (cfun
), 0);
784 e
->goto_locus
= gimple_location (last
);
789 make_cond_expr_edges (bb
);
793 make_gimple_switch_edges (as_a
<gswitch
*> (last
), bb
);
797 make_eh_edges (last
);
800 case GIMPLE_EH_DISPATCH
:
801 fallthru
= make_eh_dispatch_edges (as_a
<geh_dispatch
*> (last
));
805 /* If this function receives a nonlocal goto, then we need to
806 make edges from this call site to all the nonlocal goto
808 if (stmt_can_make_abnormal_goto (last
))
811 /* If this statement has reachable exception handlers, then
812 create abnormal edges to them. */
813 make_eh_edges (last
);
815 /* BUILTIN_RETURN is really a return statement. */
816 if (gimple_call_builtin_p (last
, BUILT_IN_RETURN
))
818 make_edge (bb
, EXIT_BLOCK_PTR_FOR_FN (cfun
), 0);
821 /* Some calls are known not to return. */
823 fallthru
= !(gimple_call_flags (last
) & ECF_NORETURN
);
827 /* A GIMPLE_ASSIGN may throw internally and thus be considered
829 if (is_ctrl_altering_stmt (last
))
830 make_eh_edges (last
);
835 make_gimple_asm_edges (bb
);
840 fallthru
= make_gimple_omp_edges (bb
, pcur_region
, pomp_index
);
843 case GIMPLE_TRANSACTION
:
846 = gimple_transaction_label (as_a
<gtransaction
*> (last
));
848 make_edge (bb
, label_to_block (abort_label
), EDGE_TM_ABORT
);
854 gcc_assert (!stmt_ends_bb_p (last
));
860 make_edge (bb
, bb
->next_bb
, EDGE_FALLTHRU
);
865 /* Join all the blocks in the flowgraph. */
871 struct omp_region
*cur_region
= NULL
;
872 auto_vec
<basic_block
> ab_edge_goto
;
873 auto_vec
<basic_block
> ab_edge_call
;
874 int *bb_to_omp_idx
= NULL
;
875 int cur_omp_region_idx
= 0;
877 /* Create an edge from entry to the first block with executable
879 make_edge (ENTRY_BLOCK_PTR_FOR_FN (cfun
),
880 BASIC_BLOCK_FOR_FN (cfun
, NUM_FIXED_BLOCKS
),
883 /* Traverse the basic block array placing edges. */
884 FOR_EACH_BB_FN (bb
, cfun
)
889 bb_to_omp_idx
[bb
->index
] = cur_omp_region_idx
;
891 mer
= make_edges_bb (bb
, &cur_region
, &cur_omp_region_idx
);
893 ab_edge_goto
.safe_push (bb
);
895 ab_edge_call
.safe_push (bb
);
897 if (cur_region
&& bb_to_omp_idx
== NULL
)
898 bb_to_omp_idx
= XCNEWVEC (int, n_basic_blocks_for_fn (cfun
));
901 /* Computed gotos are hell to deal with, especially if there are
902 lots of them with a large number of destinations. So we factor
903 them to a common computed goto location before we build the
904 edge list. After we convert back to normal form, we will un-factor
905 the computed gotos since factoring introduces an unwanted jump.
906 For non-local gotos and abnormal edges from calls to calls that return
907 twice or forced labels, factor the abnormal edges too, by having all
908 abnormal edges from the calls go to a common artificial basic block
909 with ABNORMAL_DISPATCHER internal call and abnormal edges from that
910 basic block to all forced labels and calls returning twice.
911 We do this per-OpenMP structured block, because those regions
912 are guaranteed to be single entry single exit by the standard,
913 so it is not allowed to enter or exit such regions abnormally this way,
914 thus all computed gotos, non-local gotos and setjmp/longjmp calls
915 must not transfer control across SESE region boundaries. */
916 if (!ab_edge_goto
.is_empty () || !ab_edge_call
.is_empty ())
918 gimple_stmt_iterator gsi
;
919 basic_block dispatcher_bb_array
[2] = { NULL
, NULL
};
920 basic_block
*dispatcher_bbs
= dispatcher_bb_array
;
921 int count
= n_basic_blocks_for_fn (cfun
);
924 dispatcher_bbs
= XCNEWVEC (basic_block
, 2 * count
);
926 FOR_EACH_BB_FN (bb
, cfun
)
928 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
930 glabel
*label_stmt
= dyn_cast
<glabel
*> (gsi_stmt (gsi
));
936 target
= gimple_label_label (label_stmt
);
938 /* Make an edge to every label block that has been marked as a
939 potential target for a computed goto or a non-local goto. */
940 if (FORCED_LABEL (target
))
941 handle_abnormal_edges (dispatcher_bbs
, bb
, bb_to_omp_idx
,
942 &ab_edge_goto
, true);
943 if (DECL_NONLOCAL (target
))
945 handle_abnormal_edges (dispatcher_bbs
, bb
, bb_to_omp_idx
,
946 &ab_edge_call
, false);
951 if (!gsi_end_p (gsi
) && is_gimple_debug (gsi_stmt (gsi
)))
952 gsi_next_nondebug (&gsi
);
953 if (!gsi_end_p (gsi
))
955 /* Make an edge to every setjmp-like call. */
956 gimple
*call_stmt
= gsi_stmt (gsi
);
957 if (is_gimple_call (call_stmt
)
958 && ((gimple_call_flags (call_stmt
) & ECF_RETURNS_TWICE
)
959 || gimple_call_builtin_p (call_stmt
,
960 BUILT_IN_SETJMP_RECEIVER
)))
961 handle_abnormal_edges (dispatcher_bbs
, bb
, bb_to_omp_idx
,
962 &ab_edge_call
, false);
967 XDELETE (dispatcher_bbs
);
970 XDELETE (bb_to_omp_idx
);
975 /* Add SEQ after GSI. Start new bb after GSI, and created further bbs as
976 needed. Returns true if new bbs were created.
977 Note: This is transitional code, and should not be used for new code. We
978 should be able to get rid of this by rewriting all target va-arg
979 gimplification hooks to use an interface gimple_build_cond_value as described
980 in https://gcc.gnu.org/ml/gcc-patches/2015-02/msg01194.html. */
983 gimple_find_sub_bbs (gimple_seq seq
, gimple_stmt_iterator
*gsi
)
985 gimple
*stmt
= gsi_stmt (*gsi
);
986 basic_block bb
= gimple_bb (stmt
);
987 basic_block lastbb
, afterbb
;
988 int old_num_bbs
= n_basic_blocks_for_fn (cfun
);
990 lastbb
= make_blocks_1 (seq
, bb
);
991 if (old_num_bbs
== n_basic_blocks_for_fn (cfun
))
993 e
= split_block (bb
, stmt
);
994 /* Move e->dest to come after the new basic blocks. */
996 unlink_block (afterbb
);
997 link_block (afterbb
, lastbb
);
998 redirect_edge_succ (e
, bb
->next_bb
);
1000 while (bb
!= afterbb
)
1002 struct omp_region
*cur_region
= NULL
;
1003 int cur_omp_region_idx
= 0;
1004 int mer
= make_edges_bb (bb
, &cur_region
, &cur_omp_region_idx
);
1005 gcc_assert (!mer
&& !cur_region
);
1006 add_bb_to_loop (bb
, afterbb
->loop_father
);
1012 /* Find the next available discriminator value for LOCUS. The
1013 discriminator distinguishes among several basic blocks that
1014 share a common locus, allowing for more accurate sample-based
1018 next_discriminator_for_locus (location_t locus
)
1020 struct locus_discrim_map item
;
1021 struct locus_discrim_map
**slot
;
1024 item
.discriminator
= 0;
1025 slot
= discriminator_per_locus
->find_slot_with_hash (
1026 &item
, LOCATION_LINE (locus
), INSERT
);
1028 if (*slot
== HTAB_EMPTY_ENTRY
)
1030 *slot
= XNEW (struct locus_discrim_map
);
1032 (*slot
)->locus
= locus
;
1033 (*slot
)->discriminator
= 0;
1035 (*slot
)->discriminator
++;
1036 return (*slot
)->discriminator
;
1039 /* Return TRUE if LOCUS1 and LOCUS2 refer to the same source line. */
1042 same_line_p (location_t locus1
, location_t locus2
)
1044 expanded_location from
, to
;
1046 if (locus1
== locus2
)
1049 from
= expand_location (locus1
);
1050 to
= expand_location (locus2
);
1052 if (from
.line
!= to
.line
)
1054 if (from
.file
== to
.file
)
1056 return (from
.file
!= NULL
1058 && filename_cmp (from
.file
, to
.file
) == 0);
1061 /* Assign discriminators to each basic block. */
1064 assign_discriminators (void)
1068 FOR_EACH_BB_FN (bb
, cfun
)
1072 gimple
*last
= last_stmt (bb
);
1073 location_t locus
= last
? gimple_location (last
) : UNKNOWN_LOCATION
;
1075 if (locus
== UNKNOWN_LOCATION
)
1078 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
1080 gimple
*first
= first_non_label_stmt (e
->dest
);
1081 gimple
*last
= last_stmt (e
->dest
);
1082 if ((first
&& same_line_p (locus
, gimple_location (first
)))
1083 || (last
&& same_line_p (locus
, gimple_location (last
))))
1085 if (e
->dest
->discriminator
!= 0 && bb
->discriminator
== 0)
1086 bb
->discriminator
= next_discriminator_for_locus (locus
);
1088 e
->dest
->discriminator
= next_discriminator_for_locus (locus
);
1094 /* Create the edges for a GIMPLE_COND starting at block BB. */
1097 make_cond_expr_edges (basic_block bb
)
1099 gcond
*entry
= as_a
<gcond
*> (last_stmt (bb
));
1100 gimple
*then_stmt
, *else_stmt
;
1101 basic_block then_bb
, else_bb
;
1102 tree then_label
, else_label
;
1106 gcc_assert (gimple_code (entry
) == GIMPLE_COND
);
1108 /* Entry basic blocks for each component. */
1109 then_label
= gimple_cond_true_label (entry
);
1110 else_label
= gimple_cond_false_label (entry
);
1111 then_bb
= label_to_block (then_label
);
1112 else_bb
= label_to_block (else_label
);
1113 then_stmt
= first_stmt (then_bb
);
1114 else_stmt
= first_stmt (else_bb
);
1116 e
= make_edge (bb
, then_bb
, EDGE_TRUE_VALUE
);
1117 e
->goto_locus
= gimple_location (then_stmt
);
1118 e
= make_edge (bb
, else_bb
, EDGE_FALSE_VALUE
);
1120 e
->goto_locus
= gimple_location (else_stmt
);
1122 /* We do not need the labels anymore. */
1123 gimple_cond_set_true_label (entry
, NULL_TREE
);
1124 gimple_cond_set_false_label (entry
, NULL_TREE
);
1128 /* Called for each element in the hash table (P) as we delete the
1129 edge to cases hash table.
1131 Clear all the TREE_CHAINs to prevent problems with copying of
1132 SWITCH_EXPRs and structure sharing rules, then free the hash table
1136 edge_to_cases_cleanup (edge
const &, tree
const &value
, void *)
1140 for (t
= value
; t
; t
= next
)
1142 next
= CASE_CHAIN (t
);
1143 CASE_CHAIN (t
) = NULL
;
1149 /* Start recording information mapping edges to case labels. */
1152 start_recording_case_labels (void)
1154 gcc_assert (edge_to_cases
== NULL
);
1155 edge_to_cases
= new hash_map
<edge
, tree
>;
1156 touched_switch_bbs
= BITMAP_ALLOC (NULL
);
1159 /* Return nonzero if we are recording information for case labels. */
1162 recording_case_labels_p (void)
1164 return (edge_to_cases
!= NULL
);
1167 /* Stop recording information mapping edges to case labels and
1168 remove any information we have recorded. */
1170 end_recording_case_labels (void)
1174 edge_to_cases
->traverse
<void *, edge_to_cases_cleanup
> (NULL
);
1175 delete edge_to_cases
;
1176 edge_to_cases
= NULL
;
1177 EXECUTE_IF_SET_IN_BITMAP (touched_switch_bbs
, 0, i
, bi
)
1179 basic_block bb
= BASIC_BLOCK_FOR_FN (cfun
, i
);
1182 gimple
*stmt
= last_stmt (bb
);
1183 if (stmt
&& gimple_code (stmt
) == GIMPLE_SWITCH
)
1184 group_case_labels_stmt (as_a
<gswitch
*> (stmt
));
1187 BITMAP_FREE (touched_switch_bbs
);
1190 /* If we are inside a {start,end}_recording_cases block, then return
1191 a chain of CASE_LABEL_EXPRs from T which reference E.
1193 Otherwise return NULL. */
1196 get_cases_for_edge (edge e
, gswitch
*t
)
1201 /* If we are not recording cases, then we do not have CASE_LABEL_EXPR
1202 chains available. Return NULL so the caller can detect this case. */
1203 if (!recording_case_labels_p ())
1206 slot
= edge_to_cases
->get (e
);
1210 /* If we did not find E in the hash table, then this must be the first
1211 time we have been queried for information about E & T. Add all the
1212 elements from T to the hash table then perform the query again. */
1214 n
= gimple_switch_num_labels (t
);
1215 for (i
= 0; i
< n
; i
++)
1217 tree elt
= gimple_switch_label (t
, i
);
1218 tree lab
= CASE_LABEL (elt
);
1219 basic_block label_bb
= label_to_block (lab
);
1220 edge this_edge
= find_edge (e
->src
, label_bb
);
1222 /* Add it to the chain of CASE_LABEL_EXPRs referencing E, or create
1224 tree
&s
= edge_to_cases
->get_or_insert (this_edge
);
1225 CASE_CHAIN (elt
) = s
;
1229 return *edge_to_cases
->get (e
);
1232 /* Create the edges for a GIMPLE_SWITCH starting at block BB. */
1235 make_gimple_switch_edges (gswitch
*entry
, basic_block bb
)
1239 n
= gimple_switch_num_labels (entry
);
1241 for (i
= 0; i
< n
; ++i
)
1243 tree lab
= CASE_LABEL (gimple_switch_label (entry
, i
));
1244 basic_block label_bb
= label_to_block (lab
);
1245 make_edge (bb
, label_bb
, 0);
1250 /* Return the basic block holding label DEST. */
1253 label_to_block_fn (struct function
*ifun
, tree dest
)
1255 int uid
= LABEL_DECL_UID (dest
);
1257 /* We would die hard when faced by an undefined label. Emit a label to
1258 the very first basic block. This will hopefully make even the dataflow
1259 and undefined variable warnings quite right. */
1260 if (seen_error () && uid
< 0)
1262 gimple_stmt_iterator gsi
=
1263 gsi_start_bb (BASIC_BLOCK_FOR_FN (cfun
, NUM_FIXED_BLOCKS
));
1266 stmt
= gimple_build_label (dest
);
1267 gsi_insert_before (&gsi
, stmt
, GSI_NEW_STMT
);
1268 uid
= LABEL_DECL_UID (dest
);
1270 if (vec_safe_length (ifun
->cfg
->x_label_to_block_map
) <= (unsigned int) uid
)
1272 return (*ifun
->cfg
->x_label_to_block_map
)[uid
];
1275 /* Create edges for a goto statement at block BB. Returns true
1276 if abnormal edges should be created. */
1279 make_goto_expr_edges (basic_block bb
)
1281 gimple_stmt_iterator last
= gsi_last_bb (bb
);
1282 gimple
*goto_t
= gsi_stmt (last
);
1284 /* A simple GOTO creates normal edges. */
1285 if (simple_goto_p (goto_t
))
1287 tree dest
= gimple_goto_dest (goto_t
);
1288 basic_block label_bb
= label_to_block (dest
);
1289 edge e
= make_edge (bb
, label_bb
, EDGE_FALLTHRU
);
1290 e
->goto_locus
= gimple_location (goto_t
);
1291 gsi_remove (&last
, true);
1295 /* A computed GOTO creates abnormal edges. */
1299 /* Create edges for an asm statement with labels at block BB. */
1302 make_gimple_asm_edges (basic_block bb
)
1304 gasm
*stmt
= as_a
<gasm
*> (last_stmt (bb
));
1305 int i
, n
= gimple_asm_nlabels (stmt
);
1307 for (i
= 0; i
< n
; ++i
)
1309 tree label
= TREE_VALUE (gimple_asm_label_op (stmt
, i
));
1310 basic_block label_bb
= label_to_block (label
);
1311 make_edge (bb
, label_bb
, 0);
1315 /*---------------------------------------------------------------------------
1317 ---------------------------------------------------------------------------*/
1319 /* Cleanup useless labels in basic blocks. This is something we wish
1320 to do early because it allows us to group case labels before creating
1321 the edges for the CFG, and it speeds up block statement iterators in
1322 all passes later on.
1323 We rerun this pass after CFG is created, to get rid of the labels that
1324 are no longer referenced. After then we do not run it any more, since
1325 (almost) no new labels should be created. */
1327 /* A map from basic block index to the leading label of that block. */
1328 static struct label_record
1333 /* True if the label is referenced from somewhere. */
1337 /* Given LABEL return the first label in the same basic block. */
1340 main_block_label (tree label
)
1342 basic_block bb
= label_to_block (label
);
1343 tree main_label
= label_for_bb
[bb
->index
].label
;
1345 /* label_to_block possibly inserted undefined label into the chain. */
1348 label_for_bb
[bb
->index
].label
= label
;
1352 label_for_bb
[bb
->index
].used
= true;
1356 /* Clean up redundant labels within the exception tree. */
1359 cleanup_dead_labels_eh (void)
1366 if (cfun
->eh
== NULL
)
1369 for (i
= 1; vec_safe_iterate (cfun
->eh
->lp_array
, i
, &lp
); ++i
)
1370 if (lp
&& lp
->post_landing_pad
)
1372 lab
= main_block_label (lp
->post_landing_pad
);
1373 if (lab
!= lp
->post_landing_pad
)
1375 EH_LANDING_PAD_NR (lp
->post_landing_pad
) = 0;
1376 EH_LANDING_PAD_NR (lab
) = lp
->index
;
1380 FOR_ALL_EH_REGION (r
)
1384 case ERT_MUST_NOT_THROW
:
1390 for (c
= r
->u
.eh_try
.first_catch
; c
; c
= c
->next_catch
)
1394 c
->label
= main_block_label (lab
);
1399 case ERT_ALLOWED_EXCEPTIONS
:
1400 lab
= r
->u
.allowed
.label
;
1402 r
->u
.allowed
.label
= main_block_label (lab
);
1408 /* Cleanup redundant labels. This is a three-step process:
1409 1) Find the leading label for each block.
1410 2) Redirect all references to labels to the leading labels.
1411 3) Cleanup all useless labels. */
1414 cleanup_dead_labels (void)
1417 label_for_bb
= XCNEWVEC (struct label_record
, last_basic_block_for_fn (cfun
));
1419 /* Find a suitable label for each block. We use the first user-defined
1420 label if there is one, or otherwise just the first label we see. */
1421 FOR_EACH_BB_FN (bb
, cfun
)
1423 gimple_stmt_iterator i
;
1425 for (i
= gsi_start_bb (bb
); !gsi_end_p (i
); gsi_next (&i
))
1428 glabel
*label_stmt
= dyn_cast
<glabel
*> (gsi_stmt (i
));
1433 label
= gimple_label_label (label_stmt
);
1435 /* If we have not yet seen a label for the current block,
1436 remember this one and see if there are more labels. */
1437 if (!label_for_bb
[bb
->index
].label
)
1439 label_for_bb
[bb
->index
].label
= label
;
1443 /* If we did see a label for the current block already, but it
1444 is an artificially created label, replace it if the current
1445 label is a user defined label. */
1446 if (!DECL_ARTIFICIAL (label
)
1447 && DECL_ARTIFICIAL (label_for_bb
[bb
->index
].label
))
1449 label_for_bb
[bb
->index
].label
= label
;
1455 /* Now redirect all jumps/branches to the selected label.
1456 First do so for each block ending in a control statement. */
1457 FOR_EACH_BB_FN (bb
, cfun
)
1459 gimple
*stmt
= last_stmt (bb
);
1460 tree label
, new_label
;
1465 switch (gimple_code (stmt
))
1469 gcond
*cond_stmt
= as_a
<gcond
*> (stmt
);
1470 label
= gimple_cond_true_label (cond_stmt
);
1473 new_label
= main_block_label (label
);
1474 if (new_label
!= label
)
1475 gimple_cond_set_true_label (cond_stmt
, new_label
);
1478 label
= gimple_cond_false_label (cond_stmt
);
1481 new_label
= main_block_label (label
);
1482 if (new_label
!= label
)
1483 gimple_cond_set_false_label (cond_stmt
, new_label
);
1490 gswitch
*switch_stmt
= as_a
<gswitch
*> (stmt
);
1491 size_t i
, n
= gimple_switch_num_labels (switch_stmt
);
1493 /* Replace all destination labels. */
1494 for (i
= 0; i
< n
; ++i
)
1496 tree case_label
= gimple_switch_label (switch_stmt
, i
);
1497 label
= CASE_LABEL (case_label
);
1498 new_label
= main_block_label (label
);
1499 if (new_label
!= label
)
1500 CASE_LABEL (case_label
) = new_label
;
1507 gasm
*asm_stmt
= as_a
<gasm
*> (stmt
);
1508 int i
, n
= gimple_asm_nlabels (asm_stmt
);
1510 for (i
= 0; i
< n
; ++i
)
1512 tree cons
= gimple_asm_label_op (asm_stmt
, i
);
1513 tree label
= main_block_label (TREE_VALUE (cons
));
1514 TREE_VALUE (cons
) = label
;
1519 /* We have to handle gotos until they're removed, and we don't
1520 remove them until after we've created the CFG edges. */
1522 if (!computed_goto_p (stmt
))
1524 ggoto
*goto_stmt
= as_a
<ggoto
*> (stmt
);
1525 label
= gimple_goto_dest (goto_stmt
);
1526 new_label
= main_block_label (label
);
1527 if (new_label
!= label
)
1528 gimple_goto_set_dest (goto_stmt
, new_label
);
1532 case GIMPLE_TRANSACTION
:
1534 gtransaction
*trans_stmt
= as_a
<gtransaction
*> (stmt
);
1535 tree label
= gimple_transaction_label (trans_stmt
);
1538 tree new_label
= main_block_label (label
);
1539 if (new_label
!= label
)
1540 gimple_transaction_set_label (trans_stmt
, new_label
);
1550 /* Do the same for the exception region tree labels. */
1551 cleanup_dead_labels_eh ();
1553 /* Finally, purge dead labels. All user-defined labels and labels that
1554 can be the target of non-local gotos and labels which have their
1555 address taken are preserved. */
1556 FOR_EACH_BB_FN (bb
, cfun
)
1558 gimple_stmt_iterator i
;
1559 tree label_for_this_bb
= label_for_bb
[bb
->index
].label
;
1561 if (!label_for_this_bb
)
1564 /* If the main label of the block is unused, we may still remove it. */
1565 if (!label_for_bb
[bb
->index
].used
)
1566 label_for_this_bb
= NULL
;
1568 for (i
= gsi_start_bb (bb
); !gsi_end_p (i
); )
1571 glabel
*label_stmt
= dyn_cast
<glabel
*> (gsi_stmt (i
));
1576 label
= gimple_label_label (label_stmt
);
1578 if (label
== label_for_this_bb
1579 || !DECL_ARTIFICIAL (label
)
1580 || DECL_NONLOCAL (label
)
1581 || FORCED_LABEL (label
))
1584 gsi_remove (&i
, true);
1588 free (label_for_bb
);
1591 /* Scan the sorted vector of cases in STMT (a GIMPLE_SWITCH) and combine
1592 the ones jumping to the same label.
1593 Eg. three separate entries 1: 2: 3: become one entry 1..3: */
1596 group_case_labels_stmt (gswitch
*stmt
)
1598 int old_size
= gimple_switch_num_labels (stmt
);
1599 int i
, j
, new_size
= old_size
;
1600 basic_block default_bb
= NULL
;
1602 default_bb
= label_to_block (CASE_LABEL (gimple_switch_default_label (stmt
)));
1604 /* Look for possible opportunities to merge cases. */
1606 while (i
< old_size
)
1608 tree base_case
, base_high
;
1609 basic_block base_bb
;
1611 base_case
= gimple_switch_label (stmt
, i
);
1613 gcc_assert (base_case
);
1614 base_bb
= label_to_block (CASE_LABEL (base_case
));
1616 /* Discard cases that have the same destination as the
1618 if (base_bb
== default_bb
)
1620 gimple_switch_set_label (stmt
, i
, NULL_TREE
);
1626 base_high
= CASE_HIGH (base_case
)
1627 ? CASE_HIGH (base_case
)
1628 : CASE_LOW (base_case
);
1631 /* Try to merge case labels. Break out when we reach the end
1632 of the label vector or when we cannot merge the next case
1633 label with the current one. */
1634 while (i
< old_size
)
1636 tree merge_case
= gimple_switch_label (stmt
, i
);
1637 basic_block merge_bb
= label_to_block (CASE_LABEL (merge_case
));
1638 wide_int bhp1
= wi::add (base_high
, 1);
1640 /* Merge the cases if they jump to the same place,
1641 and their ranges are consecutive. */
1642 if (merge_bb
== base_bb
1643 && wi::eq_p (CASE_LOW (merge_case
), bhp1
))
1645 base_high
= CASE_HIGH (merge_case
) ?
1646 CASE_HIGH (merge_case
) : CASE_LOW (merge_case
);
1647 CASE_HIGH (base_case
) = base_high
;
1648 gimple_switch_set_label (stmt
, i
, NULL_TREE
);
1657 /* Compress the case labels in the label vector, and adjust the
1658 length of the vector. */
1659 for (i
= 0, j
= 0; i
< new_size
; i
++)
1661 while (! gimple_switch_label (stmt
, j
))
1663 gimple_switch_set_label (stmt
, i
,
1664 gimple_switch_label (stmt
, j
++));
1667 gcc_assert (new_size
<= old_size
);
1668 gimple_switch_set_num_labels (stmt
, new_size
);
1671 /* Look for blocks ending in a multiway branch (a GIMPLE_SWITCH),
1672 and scan the sorted vector of cases. Combine the ones jumping to the
1676 group_case_labels (void)
1680 FOR_EACH_BB_FN (bb
, cfun
)
1682 gimple
*stmt
= last_stmt (bb
);
1683 if (stmt
&& gimple_code (stmt
) == GIMPLE_SWITCH
)
1684 group_case_labels_stmt (as_a
<gswitch
*> (stmt
));
1688 /* Checks whether we can merge block B into block A. */
1691 gimple_can_merge_blocks_p (basic_block a
, basic_block b
)
1695 if (!single_succ_p (a
))
1698 if (single_succ_edge (a
)->flags
& EDGE_COMPLEX
)
1701 if (single_succ (a
) != b
)
1704 if (!single_pred_p (b
))
1707 if (a
== ENTRY_BLOCK_PTR_FOR_FN (cfun
)
1708 || b
== EXIT_BLOCK_PTR_FOR_FN (cfun
))
1711 /* If A ends by a statement causing exceptions or something similar, we
1712 cannot merge the blocks. */
1713 stmt
= last_stmt (a
);
1714 if (stmt
&& stmt_ends_bb_p (stmt
))
1717 /* Do not allow a block with only a non-local label to be merged. */
1719 if (glabel
*label_stmt
= dyn_cast
<glabel
*> (stmt
))
1720 if (DECL_NONLOCAL (gimple_label_label (label_stmt
)))
1723 /* Examine the labels at the beginning of B. */
1724 for (gimple_stmt_iterator gsi
= gsi_start_bb (b
); !gsi_end_p (gsi
);
1728 glabel
*label_stmt
= dyn_cast
<glabel
*> (gsi_stmt (gsi
));
1731 lab
= gimple_label_label (label_stmt
);
1733 /* Do not remove user forced labels or for -O0 any user labels. */
1734 if (!DECL_ARTIFICIAL (lab
) && (!optimize
|| FORCED_LABEL (lab
)))
1738 /* Protect simple loop latches. We only want to avoid merging
1739 the latch with the loop header or with a block in another
1740 loop in this case. */
1742 && b
->loop_father
->latch
== b
1743 && loops_state_satisfies_p (LOOPS_HAVE_SIMPLE_LATCHES
)
1744 && (b
->loop_father
->header
== a
1745 || b
->loop_father
!= a
->loop_father
))
1748 /* It must be possible to eliminate all phi nodes in B. If ssa form
1749 is not up-to-date and a name-mapping is registered, we cannot eliminate
1750 any phis. Symbols marked for renaming are never a problem though. */
1751 for (gphi_iterator gsi
= gsi_start_phis (b
); !gsi_end_p (gsi
);
1754 gphi
*phi
= gsi
.phi ();
1755 /* Technically only new names matter. */
1756 if (name_registered_for_update_p (PHI_RESULT (phi
)))
1760 /* When not optimizing, don't merge if we'd lose goto_locus. */
1762 && single_succ_edge (a
)->goto_locus
!= UNKNOWN_LOCATION
)
1764 location_t goto_locus
= single_succ_edge (a
)->goto_locus
;
1765 gimple_stmt_iterator prev
, next
;
1766 prev
= gsi_last_nondebug_bb (a
);
1767 next
= gsi_after_labels (b
);
1768 if (!gsi_end_p (next
) && is_gimple_debug (gsi_stmt (next
)))
1769 gsi_next_nondebug (&next
);
1770 if ((gsi_end_p (prev
)
1771 || gimple_location (gsi_stmt (prev
)) != goto_locus
)
1772 && (gsi_end_p (next
)
1773 || gimple_location (gsi_stmt (next
)) != goto_locus
))
1780 /* Replaces all uses of NAME by VAL. */
1783 replace_uses_by (tree name
, tree val
)
1785 imm_use_iterator imm_iter
;
1790 FOR_EACH_IMM_USE_STMT (stmt
, imm_iter
, name
)
1792 /* Mark the block if we change the last stmt in it. */
1793 if (cfgcleanup_altered_bbs
1794 && stmt_ends_bb_p (stmt
))
1795 bitmap_set_bit (cfgcleanup_altered_bbs
, gimple_bb (stmt
)->index
);
1797 FOR_EACH_IMM_USE_ON_STMT (use
, imm_iter
)
1799 replace_exp (use
, val
);
1801 if (gimple_code (stmt
) == GIMPLE_PHI
)
1803 e
= gimple_phi_arg_edge (as_a
<gphi
*> (stmt
),
1804 PHI_ARG_INDEX_FROM_USE (use
));
1805 if (e
->flags
& EDGE_ABNORMAL
1806 && !SSA_NAME_OCCURS_IN_ABNORMAL_PHI (val
))
1808 /* This can only occur for virtual operands, since
1809 for the real ones SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name))
1810 would prevent replacement. */
1811 gcc_checking_assert (virtual_operand_p (name
));
1812 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (val
) = 1;
1817 if (gimple_code (stmt
) != GIMPLE_PHI
)
1819 gimple_stmt_iterator gsi
= gsi_for_stmt (stmt
);
1820 gimple
*orig_stmt
= stmt
;
1823 /* FIXME. It shouldn't be required to keep TREE_CONSTANT
1824 on ADDR_EXPRs up-to-date on GIMPLE. Propagation will
1825 only change sth from non-invariant to invariant, and only
1826 when propagating constants. */
1827 if (is_gimple_min_invariant (val
))
1828 for (i
= 0; i
< gimple_num_ops (stmt
); i
++)
1830 tree op
= gimple_op (stmt
, i
);
1831 /* Operands may be empty here. For example, the labels
1832 of a GIMPLE_COND are nulled out following the creation
1833 of the corresponding CFG edges. */
1834 if (op
&& TREE_CODE (op
) == ADDR_EXPR
)
1835 recompute_tree_invariant_for_addr_expr (op
);
1838 if (fold_stmt (&gsi
))
1839 stmt
= gsi_stmt (gsi
);
1841 if (maybe_clean_or_replace_eh_stmt (orig_stmt
, stmt
))
1842 gimple_purge_dead_eh_edges (gimple_bb (stmt
));
1848 gcc_checking_assert (has_zero_uses (name
));
1850 /* Also update the trees stored in loop structures. */
1855 FOR_EACH_LOOP (loop
, 0)
1857 substitute_in_loop_info (loop
, name
, val
);
1862 /* Merge block B into block A. */
1865 gimple_merge_blocks (basic_block a
, basic_block b
)
1867 gimple_stmt_iterator last
, gsi
;
1871 fprintf (dump_file
, "Merging blocks %d and %d\n", a
->index
, b
->index
);
1873 /* Remove all single-valued PHI nodes from block B of the form
1874 V_i = PHI <V_j> by propagating V_j to all the uses of V_i. */
1875 gsi
= gsi_last_bb (a
);
1876 for (psi
= gsi_start_phis (b
); !gsi_end_p (psi
); )
1878 gimple
*phi
= gsi_stmt (psi
);
1879 tree def
= gimple_phi_result (phi
), use
= gimple_phi_arg_def (phi
, 0);
1881 bool may_replace_uses
= (virtual_operand_p (def
)
1882 || may_propagate_copy (def
, use
));
1884 /* In case we maintain loop closed ssa form, do not propagate arguments
1885 of loop exit phi nodes. */
1887 && loops_state_satisfies_p (LOOP_CLOSED_SSA
)
1888 && !virtual_operand_p (def
)
1889 && TREE_CODE (use
) == SSA_NAME
1890 && a
->loop_father
!= b
->loop_father
)
1891 may_replace_uses
= false;
1893 if (!may_replace_uses
)
1895 gcc_assert (!virtual_operand_p (def
));
1897 /* Note that just emitting the copies is fine -- there is no problem
1898 with ordering of phi nodes. This is because A is the single
1899 predecessor of B, therefore results of the phi nodes cannot
1900 appear as arguments of the phi nodes. */
1901 copy
= gimple_build_assign (def
, use
);
1902 gsi_insert_after (&gsi
, copy
, GSI_NEW_STMT
);
1903 remove_phi_node (&psi
, false);
1907 /* If we deal with a PHI for virtual operands, we can simply
1908 propagate these without fussing with folding or updating
1910 if (virtual_operand_p (def
))
1912 imm_use_iterator iter
;
1913 use_operand_p use_p
;
1916 FOR_EACH_IMM_USE_STMT (stmt
, iter
, def
)
1917 FOR_EACH_IMM_USE_ON_STMT (use_p
, iter
)
1918 SET_USE (use_p
, use
);
1920 if (SSA_NAME_OCCURS_IN_ABNORMAL_PHI (def
))
1921 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (use
) = 1;
1924 replace_uses_by (def
, use
);
1926 remove_phi_node (&psi
, true);
1930 /* Ensure that B follows A. */
1931 move_block_after (b
, a
);
1933 gcc_assert (single_succ_edge (a
)->flags
& EDGE_FALLTHRU
);
1934 gcc_assert (!last_stmt (a
) || !stmt_ends_bb_p (last_stmt (a
)));
1936 /* Remove labels from B and set gimple_bb to A for other statements. */
1937 for (gsi
= gsi_start_bb (b
); !gsi_end_p (gsi
);)
1939 gimple
*stmt
= gsi_stmt (gsi
);
1940 if (glabel
*label_stmt
= dyn_cast
<glabel
*> (stmt
))
1942 tree label
= gimple_label_label (label_stmt
);
1945 gsi_remove (&gsi
, false);
1947 /* Now that we can thread computed gotos, we might have
1948 a situation where we have a forced label in block B
1949 However, the label at the start of block B might still be
1950 used in other ways (think about the runtime checking for
1951 Fortran assigned gotos). So we can not just delete the
1952 label. Instead we move the label to the start of block A. */
1953 if (FORCED_LABEL (label
))
1955 gimple_stmt_iterator dest_gsi
= gsi_start_bb (a
);
1956 gsi_insert_before (&dest_gsi
, stmt
, GSI_NEW_STMT
);
1958 /* Other user labels keep around in a form of a debug stmt. */
1959 else if (!DECL_ARTIFICIAL (label
) && MAY_HAVE_DEBUG_STMTS
)
1961 gimple
*dbg
= gimple_build_debug_bind (label
,
1964 gimple_debug_bind_reset_value (dbg
);
1965 gsi_insert_before (&gsi
, dbg
, GSI_SAME_STMT
);
1968 lp_nr
= EH_LANDING_PAD_NR (label
);
1971 eh_landing_pad lp
= get_eh_landing_pad_from_number (lp_nr
);
1972 lp
->post_landing_pad
= NULL
;
1977 gimple_set_bb (stmt
, a
);
1982 /* When merging two BBs, if their counts are different, the larger count
1983 is selected as the new bb count. This is to handle inconsistent
1985 if (a
->loop_father
== b
->loop_father
)
1987 a
->count
= MAX (a
->count
, b
->count
);
1988 a
->frequency
= MAX (a
->frequency
, b
->frequency
);
1991 /* Merge the sequences. */
1992 last
= gsi_last_bb (a
);
1993 gsi_insert_seq_after (&last
, bb_seq (b
), GSI_NEW_STMT
);
1994 set_bb_seq (b
, NULL
);
1996 if (cfgcleanup_altered_bbs
)
1997 bitmap_set_bit (cfgcleanup_altered_bbs
, a
->index
);
2001 /* Return the one of two successors of BB that is not reachable by a
2002 complex edge, if there is one. Else, return BB. We use
2003 this in optimizations that use post-dominators for their heuristics,
2004 to catch the cases in C++ where function calls are involved. */
2007 single_noncomplex_succ (basic_block bb
)
2010 if (EDGE_COUNT (bb
->succs
) != 2)
2013 e0
= EDGE_SUCC (bb
, 0);
2014 e1
= EDGE_SUCC (bb
, 1);
2015 if (e0
->flags
& EDGE_COMPLEX
)
2017 if (e1
->flags
& EDGE_COMPLEX
)
2023 /* T is CALL_EXPR. Set current_function_calls_* flags. */
2026 notice_special_calls (gcall
*call
)
2028 int flags
= gimple_call_flags (call
);
2030 if (flags
& ECF_MAY_BE_ALLOCA
)
2031 cfun
->calls_alloca
= true;
2032 if (flags
& ECF_RETURNS_TWICE
)
2033 cfun
->calls_setjmp
= true;
2037 /* Clear flags set by notice_special_calls. Used by dead code removal
2038 to update the flags. */
2041 clear_special_calls (void)
2043 cfun
->calls_alloca
= false;
2044 cfun
->calls_setjmp
= false;
2047 /* Remove PHI nodes associated with basic block BB and all edges out of BB. */
2050 remove_phi_nodes_and_edges_for_unreachable_block (basic_block bb
)
2052 /* Since this block is no longer reachable, we can just delete all
2053 of its PHI nodes. */
2054 remove_phi_nodes (bb
);
2056 /* Remove edges to BB's successors. */
2057 while (EDGE_COUNT (bb
->succs
) > 0)
2058 remove_edge (EDGE_SUCC (bb
, 0));
2062 /* Remove statements of basic block BB. */
2065 remove_bb (basic_block bb
)
2067 gimple_stmt_iterator i
;
2071 fprintf (dump_file
, "Removing basic block %d\n", bb
->index
);
2072 if (dump_flags
& TDF_DETAILS
)
2074 dump_bb (dump_file
, bb
, 0, TDF_BLOCKS
);
2075 fprintf (dump_file
, "\n");
2081 struct loop
*loop
= bb
->loop_father
;
2083 /* If a loop gets removed, clean up the information associated
2085 if (loop
->latch
== bb
2086 || loop
->header
== bb
)
2087 free_numbers_of_iterations_estimates_loop (loop
);
2090 /* Remove all the instructions in the block. */
2091 if (bb_seq (bb
) != NULL
)
2093 /* Walk backwards so as to get a chance to substitute all
2094 released DEFs into debug stmts. See
2095 eliminate_unnecessary_stmts() in tree-ssa-dce.c for more
2097 for (i
= gsi_last_bb (bb
); !gsi_end_p (i
);)
2099 gimple
*stmt
= gsi_stmt (i
);
2100 glabel
*label_stmt
= dyn_cast
<glabel
*> (stmt
);
2102 && (FORCED_LABEL (gimple_label_label (label_stmt
))
2103 || DECL_NONLOCAL (gimple_label_label (label_stmt
))))
2106 gimple_stmt_iterator new_gsi
;
2108 /* A non-reachable non-local label may still be referenced.
2109 But it no longer needs to carry the extra semantics of
2111 if (DECL_NONLOCAL (gimple_label_label (label_stmt
)))
2113 DECL_NONLOCAL (gimple_label_label (label_stmt
)) = 0;
2114 FORCED_LABEL (gimple_label_label (label_stmt
)) = 1;
2117 new_bb
= bb
->prev_bb
;
2118 new_gsi
= gsi_start_bb (new_bb
);
2119 gsi_remove (&i
, false);
2120 gsi_insert_before (&new_gsi
, stmt
, GSI_NEW_STMT
);
2124 /* Release SSA definitions if we are in SSA. Note that we
2125 may be called when not in SSA. For example,
2126 final_cleanup calls this function via
2127 cleanup_tree_cfg. */
2128 if (gimple_in_ssa_p (cfun
))
2129 release_defs (stmt
);
2131 gsi_remove (&i
, true);
2135 i
= gsi_last_bb (bb
);
2141 remove_phi_nodes_and_edges_for_unreachable_block (bb
);
2142 bb
->il
.gimple
.seq
= NULL
;
2143 bb
->il
.gimple
.phi_nodes
= NULL
;
2147 /* Given a basic block BB ending with COND_EXPR or SWITCH_EXPR, and a
2148 predicate VAL, return the edge that will be taken out of the block.
2149 If VAL does not match a unique edge, NULL is returned. */
2152 find_taken_edge (basic_block bb
, tree val
)
2156 stmt
= last_stmt (bb
);
2159 gcc_assert (is_ctrl_stmt (stmt
));
2164 if (!is_gimple_min_invariant (val
))
2167 if (gimple_code (stmt
) == GIMPLE_COND
)
2168 return find_taken_edge_cond_expr (bb
, val
);
2170 if (gimple_code (stmt
) == GIMPLE_SWITCH
)
2171 return find_taken_edge_switch_expr (as_a
<gswitch
*> (stmt
), bb
, val
);
2173 if (computed_goto_p (stmt
))
2175 /* Only optimize if the argument is a label, if the argument is
2176 not a label then we can not construct a proper CFG.
2178 It may be the case that we only need to allow the LABEL_REF to
2179 appear inside an ADDR_EXPR, but we also allow the LABEL_REF to
2180 appear inside a LABEL_EXPR just to be safe. */
2181 if ((TREE_CODE (val
) == ADDR_EXPR
|| TREE_CODE (val
) == LABEL_EXPR
)
2182 && TREE_CODE (TREE_OPERAND (val
, 0)) == LABEL_DECL
)
2183 return find_taken_edge_computed_goto (bb
, TREE_OPERAND (val
, 0));
2190 /* Given a constant value VAL and the entry block BB to a GOTO_EXPR
2191 statement, determine which of the outgoing edges will be taken out of the
2192 block. Return NULL if either edge may be taken. */
2195 find_taken_edge_computed_goto (basic_block bb
, tree val
)
2200 dest
= label_to_block (val
);
2203 e
= find_edge (bb
, dest
);
2204 gcc_assert (e
!= NULL
);
2210 /* Given a constant value VAL and the entry block BB to a COND_EXPR
2211 statement, determine which of the two edges will be taken out of the
2212 block. Return NULL if either edge may be taken. */
2215 find_taken_edge_cond_expr (basic_block bb
, tree val
)
2217 edge true_edge
, false_edge
;
2219 extract_true_false_edges_from_block (bb
, &true_edge
, &false_edge
);
2221 gcc_assert (TREE_CODE (val
) == INTEGER_CST
);
2222 return (integer_zerop (val
) ? false_edge
: true_edge
);
2225 /* Given an INTEGER_CST VAL and the entry block BB to a SWITCH_EXPR
2226 statement, determine which edge will be taken out of the block. Return
2227 NULL if any edge may be taken. */
2230 find_taken_edge_switch_expr (gswitch
*switch_stmt
, basic_block bb
,
2233 basic_block dest_bb
;
2237 taken_case
= find_case_label_for_value (switch_stmt
, val
);
2238 dest_bb
= label_to_block (CASE_LABEL (taken_case
));
2240 e
= find_edge (bb
, dest_bb
);
2246 /* Return the CASE_LABEL_EXPR that SWITCH_STMT will take for VAL.
2247 We can make optimal use here of the fact that the case labels are
2248 sorted: We can do a binary search for a case matching VAL. */
2251 find_case_label_for_value (gswitch
*switch_stmt
, tree val
)
2253 size_t low
, high
, n
= gimple_switch_num_labels (switch_stmt
);
2254 tree default_case
= gimple_switch_default_label (switch_stmt
);
2256 for (low
= 0, high
= n
; high
- low
> 1; )
2258 size_t i
= (high
+ low
) / 2;
2259 tree t
= gimple_switch_label (switch_stmt
, i
);
2262 /* Cache the result of comparing CASE_LOW and val. */
2263 cmp
= tree_int_cst_compare (CASE_LOW (t
), val
);
2270 if (CASE_HIGH (t
) == NULL
)
2272 /* A singe-valued case label. */
2278 /* A case range. We can only handle integer ranges. */
2279 if (cmp
<= 0 && tree_int_cst_compare (CASE_HIGH (t
), val
) >= 0)
2284 return default_case
;
2288 /* Dump a basic block on stderr. */
2291 gimple_debug_bb (basic_block bb
)
2293 dump_bb (stderr
, bb
, 0, TDF_VOPS
|TDF_MEMSYMS
|TDF_BLOCKS
);
2297 /* Dump basic block with index N on stderr. */
2300 gimple_debug_bb_n (int n
)
2302 gimple_debug_bb (BASIC_BLOCK_FOR_FN (cfun
, n
));
2303 return BASIC_BLOCK_FOR_FN (cfun
, n
);
2307 /* Dump the CFG on stderr.
2309 FLAGS are the same used by the tree dumping functions
2310 (see TDF_* in dumpfile.h). */
2313 gimple_debug_cfg (int flags
)
2315 gimple_dump_cfg (stderr
, flags
);
2319 /* Dump the program showing basic block boundaries on the given FILE.
2321 FLAGS are the same used by the tree dumping functions (see TDF_* in
2325 gimple_dump_cfg (FILE *file
, int flags
)
2327 if (flags
& TDF_DETAILS
)
2329 dump_function_header (file
, current_function_decl
, flags
);
2330 fprintf (file
, ";; \n%d basic blocks, %d edges, last basic block %d.\n\n",
2331 n_basic_blocks_for_fn (cfun
), n_edges_for_fn (cfun
),
2332 last_basic_block_for_fn (cfun
));
2334 brief_dump_cfg (file
, flags
| TDF_COMMENT
);
2335 fprintf (file
, "\n");
2338 if (flags
& TDF_STATS
)
2339 dump_cfg_stats (file
);
2341 dump_function_to_file (current_function_decl
, file
, flags
| TDF_BLOCKS
);
2345 /* Dump CFG statistics on FILE. */
2348 dump_cfg_stats (FILE *file
)
2350 static long max_num_merged_labels
= 0;
2351 unsigned long size
, total
= 0;
2354 const char * const fmt_str
= "%-30s%-13s%12s\n";
2355 const char * const fmt_str_1
= "%-30s%13d%11lu%c\n";
2356 const char * const fmt_str_2
= "%-30s%13ld%11lu%c\n";
2357 const char * const fmt_str_3
= "%-43s%11lu%c\n";
2358 const char *funcname
= current_function_name ();
2360 fprintf (file
, "\nCFG Statistics for %s\n\n", funcname
);
2362 fprintf (file
, "---------------------------------------------------------\n");
2363 fprintf (file
, fmt_str
, "", " Number of ", "Memory");
2364 fprintf (file
, fmt_str
, "", " instances ", "used ");
2365 fprintf (file
, "---------------------------------------------------------\n");
2367 size
= n_basic_blocks_for_fn (cfun
) * sizeof (struct basic_block_def
);
2369 fprintf (file
, fmt_str_1
, "Basic blocks", n_basic_blocks_for_fn (cfun
),
2370 SCALE (size
), LABEL (size
));
2373 FOR_EACH_BB_FN (bb
, cfun
)
2374 num_edges
+= EDGE_COUNT (bb
->succs
);
2375 size
= num_edges
* sizeof (struct edge_def
);
2377 fprintf (file
, fmt_str_2
, "Edges", num_edges
, SCALE (size
), LABEL (size
));
2379 fprintf (file
, "---------------------------------------------------------\n");
2380 fprintf (file
, fmt_str_3
, "Total memory used by CFG data", SCALE (total
),
2382 fprintf (file
, "---------------------------------------------------------\n");
2383 fprintf (file
, "\n");
2385 if (cfg_stats
.num_merged_labels
> max_num_merged_labels
)
2386 max_num_merged_labels
= cfg_stats
.num_merged_labels
;
2388 fprintf (file
, "Coalesced label blocks: %ld (Max so far: %ld)\n",
2389 cfg_stats
.num_merged_labels
, max_num_merged_labels
);
2391 fprintf (file
, "\n");
2395 /* Dump CFG statistics on stderr. Keep extern so that it's always
2396 linked in the final executable. */
2399 debug_cfg_stats (void)
2401 dump_cfg_stats (stderr
);
2404 /*---------------------------------------------------------------------------
2405 Miscellaneous helpers
2406 ---------------------------------------------------------------------------*/
2408 /* Return true if T, a GIMPLE_CALL, can make an abnormal transfer of control
2409 flow. Transfers of control flow associated with EH are excluded. */
2412 call_can_make_abnormal_goto (gimple
*t
)
2414 /* If the function has no non-local labels, then a call cannot make an
2415 abnormal transfer of control. */
2416 if (!cfun
->has_nonlocal_label
2417 && !cfun
->calls_setjmp
)
2420 /* Likewise if the call has no side effects. */
2421 if (!gimple_has_side_effects (t
))
2424 /* Likewise if the called function is leaf. */
2425 if (gimple_call_flags (t
) & ECF_LEAF
)
2432 /* Return true if T can make an abnormal transfer of control flow.
2433 Transfers of control flow associated with EH are excluded. */
2436 stmt_can_make_abnormal_goto (gimple
*t
)
2438 if (computed_goto_p (t
))
2440 if (is_gimple_call (t
))
2441 return call_can_make_abnormal_goto (t
);
2446 /* Return true if T represents a stmt that always transfers control. */
2449 is_ctrl_stmt (gimple
*t
)
2451 switch (gimple_code (t
))
2465 /* Return true if T is a statement that may alter the flow of control
2466 (e.g., a call to a non-returning function). */
2469 is_ctrl_altering_stmt (gimple
*t
)
2473 switch (gimple_code (t
))
2476 /* Per stmt call flag indicates whether the call could alter
2478 if (gimple_call_ctrl_altering_p (t
))
2482 case GIMPLE_EH_DISPATCH
:
2483 /* EH_DISPATCH branches to the individual catch handlers at
2484 this level of a try or allowed-exceptions region. It can
2485 fallthru to the next statement as well. */
2489 if (gimple_asm_nlabels (as_a
<gasm
*> (t
)) > 0)
2494 /* OpenMP directives alter control flow. */
2497 case GIMPLE_TRANSACTION
:
2498 /* A transaction start alters control flow. */
2505 /* If a statement can throw, it alters control flow. */
2506 return stmt_can_throw_internal (t
);
2510 /* Return true if T is a simple local goto. */
2513 simple_goto_p (gimple
*t
)
2515 return (gimple_code (t
) == GIMPLE_GOTO
2516 && TREE_CODE (gimple_goto_dest (t
)) == LABEL_DECL
);
2520 /* Return true if STMT should start a new basic block. PREV_STMT is
2521 the statement preceding STMT. It is used when STMT is a label or a
2522 case label. Labels should only start a new basic block if their
2523 previous statement wasn't a label. Otherwise, sequence of labels
2524 would generate unnecessary basic blocks that only contain a single
2528 stmt_starts_bb_p (gimple
*stmt
, gimple
*prev_stmt
)
2533 /* Labels start a new basic block only if the preceding statement
2534 wasn't a label of the same type. This prevents the creation of
2535 consecutive blocks that have nothing but a single label. */
2536 if (glabel
*label_stmt
= dyn_cast
<glabel
*> (stmt
))
2538 /* Nonlocal and computed GOTO targets always start a new block. */
2539 if (DECL_NONLOCAL (gimple_label_label (label_stmt
))
2540 || FORCED_LABEL (gimple_label_label (label_stmt
)))
2543 if (prev_stmt
&& gimple_code (prev_stmt
) == GIMPLE_LABEL
)
2545 if (DECL_NONLOCAL (gimple_label_label (
2546 as_a
<glabel
*> (prev_stmt
))))
2549 cfg_stats
.num_merged_labels
++;
2555 else if (gimple_code (stmt
) == GIMPLE_CALL
2556 && gimple_call_flags (stmt
) & ECF_RETURNS_TWICE
)
2557 /* setjmp acts similar to a nonlocal GOTO target and thus should
2558 start a new block. */
2565 /* Return true if T should end a basic block. */
2568 stmt_ends_bb_p (gimple
*t
)
2570 return is_ctrl_stmt (t
) || is_ctrl_altering_stmt (t
);
2573 /* Remove block annotations and other data structures. */
2576 delete_tree_cfg_annotations (struct function
*fn
)
2578 vec_free (label_to_block_map_for_fn (fn
));
2581 /* Return the virtual phi in BB. */
2584 get_virtual_phi (basic_block bb
)
2586 for (gphi_iterator gsi
= gsi_start_phis (bb
);
2590 gphi
*phi
= gsi
.phi ();
2592 if (virtual_operand_p (PHI_RESULT (phi
)))
2599 /* Return the first statement in basic block BB. */
2602 first_stmt (basic_block bb
)
2604 gimple_stmt_iterator i
= gsi_start_bb (bb
);
2605 gimple
*stmt
= NULL
;
2607 while (!gsi_end_p (i
) && is_gimple_debug ((stmt
= gsi_stmt (i
))))
2615 /* Return the first non-label statement in basic block BB. */
2618 first_non_label_stmt (basic_block bb
)
2620 gimple_stmt_iterator i
= gsi_start_bb (bb
);
2621 while (!gsi_end_p (i
) && gimple_code (gsi_stmt (i
)) == GIMPLE_LABEL
)
2623 return !gsi_end_p (i
) ? gsi_stmt (i
) : NULL
;
2626 /* Return the last statement in basic block BB. */
2629 last_stmt (basic_block bb
)
2631 gimple_stmt_iterator i
= gsi_last_bb (bb
);
2632 gimple
*stmt
= NULL
;
2634 while (!gsi_end_p (i
) && is_gimple_debug ((stmt
= gsi_stmt (i
))))
2642 /* Return the last statement of an otherwise empty block. Return NULL
2643 if the block is totally empty, or if it contains more than one
2647 last_and_only_stmt (basic_block bb
)
2649 gimple_stmt_iterator i
= gsi_last_nondebug_bb (bb
);
2650 gimple
*last
, *prev
;
2655 last
= gsi_stmt (i
);
2656 gsi_prev_nondebug (&i
);
2660 /* Empty statements should no longer appear in the instruction stream.
2661 Everything that might have appeared before should be deleted by
2662 remove_useless_stmts, and the optimizers should just gsi_remove
2663 instead of smashing with build_empty_stmt.
2665 Thus the only thing that should appear here in a block containing
2666 one executable statement is a label. */
2667 prev
= gsi_stmt (i
);
2668 if (gimple_code (prev
) == GIMPLE_LABEL
)
2674 /* Reinstall those PHI arguments queued in OLD_EDGE to NEW_EDGE. */
2677 reinstall_phi_args (edge new_edge
, edge old_edge
)
2683 vec
<edge_var_map
> *v
= redirect_edge_var_map_vector (old_edge
);
2687 for (i
= 0, phis
= gsi_start_phis (new_edge
->dest
);
2688 v
->iterate (i
, &vm
) && !gsi_end_p (phis
);
2689 i
++, gsi_next (&phis
))
2691 gphi
*phi
= phis
.phi ();
2692 tree result
= redirect_edge_var_map_result (vm
);
2693 tree arg
= redirect_edge_var_map_def (vm
);
2695 gcc_assert (result
== gimple_phi_result (phi
));
2697 add_phi_arg (phi
, arg
, new_edge
, redirect_edge_var_map_location (vm
));
2700 redirect_edge_var_map_clear (old_edge
);
2703 /* Returns the basic block after which the new basic block created
2704 by splitting edge EDGE_IN should be placed. Tries to keep the new block
2705 near its "logical" location. This is of most help to humans looking
2706 at debugging dumps. */
2709 split_edge_bb_loc (edge edge_in
)
2711 basic_block dest
= edge_in
->dest
;
2712 basic_block dest_prev
= dest
->prev_bb
;
2716 edge e
= find_edge (dest_prev
, dest
);
2717 if (e
&& !(e
->flags
& EDGE_COMPLEX
))
2718 return edge_in
->src
;
2723 /* Split a (typically critical) edge EDGE_IN. Return the new block.
2724 Abort on abnormal edges. */
2727 gimple_split_edge (edge edge_in
)
2729 basic_block new_bb
, after_bb
, dest
;
2732 /* Abnormal edges cannot be split. */
2733 gcc_assert (!(edge_in
->flags
& EDGE_ABNORMAL
));
2735 dest
= edge_in
->dest
;
2737 after_bb
= split_edge_bb_loc (edge_in
);
2739 new_bb
= create_empty_bb (after_bb
);
2740 new_bb
->frequency
= EDGE_FREQUENCY (edge_in
);
2741 new_bb
->count
= edge_in
->count
;
2742 new_edge
= make_edge (new_bb
, dest
, EDGE_FALLTHRU
);
2743 new_edge
->probability
= REG_BR_PROB_BASE
;
2744 new_edge
->count
= edge_in
->count
;
2746 e
= redirect_edge_and_branch (edge_in
, new_bb
);
2747 gcc_assert (e
== edge_in
);
2748 reinstall_phi_args (new_edge
, e
);
2754 /* Verify properties of the address expression T with base object BASE. */
2757 verify_address (tree t
, tree base
)
2760 bool old_side_effects
;
2762 bool new_side_effects
;
2764 old_constant
= TREE_CONSTANT (t
);
2765 old_side_effects
= TREE_SIDE_EFFECTS (t
);
2767 recompute_tree_invariant_for_addr_expr (t
);
2768 new_side_effects
= TREE_SIDE_EFFECTS (t
);
2769 new_constant
= TREE_CONSTANT (t
);
2771 if (old_constant
!= new_constant
)
2773 error ("constant not recomputed when ADDR_EXPR changed");
2776 if (old_side_effects
!= new_side_effects
)
2778 error ("side effects not recomputed when ADDR_EXPR changed");
2782 if (!(TREE_CODE (base
) == VAR_DECL
2783 || TREE_CODE (base
) == PARM_DECL
2784 || TREE_CODE (base
) == RESULT_DECL
))
2787 if (DECL_GIMPLE_REG_P (base
))
2789 error ("DECL_GIMPLE_REG_P set on a variable with address taken");
2796 /* Callback for walk_tree, check that all elements with address taken are
2797 properly noticed as such. The DATA is an int* that is 1 if TP was seen
2798 inside a PHI node. */
2801 verify_expr (tree
*tp
, int *walk_subtrees
, void *data ATTRIBUTE_UNUSED
)
2808 /* Check operand N for being valid GIMPLE and give error MSG if not. */
2809 #define CHECK_OP(N, MSG) \
2810 do { if (!is_gimple_val (TREE_OPERAND (t, N))) \
2811 { error (MSG); return TREE_OPERAND (t, N); }} while (0)
2813 switch (TREE_CODE (t
))
2816 if (SSA_NAME_IN_FREE_LIST (t
))
2818 error ("SSA name in freelist but still referenced");
2824 error ("INDIRECT_REF in gimple IL");
2828 x
= TREE_OPERAND (t
, 0);
2829 if (!POINTER_TYPE_P (TREE_TYPE (x
))
2830 || !is_gimple_mem_ref_addr (x
))
2832 error ("invalid first operand of MEM_REF");
2835 if (TREE_CODE (TREE_OPERAND (t
, 1)) != INTEGER_CST
2836 || !POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (t
, 1))))
2838 error ("invalid offset operand of MEM_REF");
2839 return TREE_OPERAND (t
, 1);
2841 if (TREE_CODE (x
) == ADDR_EXPR
2842 && (x
= verify_address (x
, TREE_OPERAND (x
, 0))))
2848 x
= fold (ASSERT_EXPR_COND (t
));
2849 if (x
== boolean_false_node
)
2851 error ("ASSERT_EXPR with an always-false condition");
2857 error ("MODIFY_EXPR not expected while having tuples");
2864 gcc_assert (is_gimple_address (t
));
2866 /* Skip any references (they will be checked when we recurse down the
2867 tree) and ensure that any variable used as a prefix is marked
2869 for (x
= TREE_OPERAND (t
, 0);
2870 handled_component_p (x
);
2871 x
= TREE_OPERAND (x
, 0))
2874 if ((tem
= verify_address (t
, x
)))
2877 if (!(TREE_CODE (x
) == VAR_DECL
2878 || TREE_CODE (x
) == PARM_DECL
2879 || TREE_CODE (x
) == RESULT_DECL
))
2882 if (!TREE_ADDRESSABLE (x
))
2884 error ("address taken, but ADDRESSABLE bit not set");
2892 x
= COND_EXPR_COND (t
);
2893 if (!INTEGRAL_TYPE_P (TREE_TYPE (x
)))
2895 error ("non-integral used in condition");
2898 if (!is_gimple_condexpr (x
))
2900 error ("invalid conditional operand");
2905 case NON_LVALUE_EXPR
:
2906 case TRUTH_NOT_EXPR
:
2910 case FIX_TRUNC_EXPR
:
2915 CHECK_OP (0, "invalid operand to unary operator");
2921 if (!is_gimple_reg_type (TREE_TYPE (t
)))
2923 error ("non-scalar BIT_FIELD_REF, IMAGPART_EXPR or REALPART_EXPR");
2927 if (TREE_CODE (t
) == BIT_FIELD_REF
)
2929 tree t0
= TREE_OPERAND (t
, 0);
2930 tree t1
= TREE_OPERAND (t
, 1);
2931 tree t2
= TREE_OPERAND (t
, 2);
2932 if (!tree_fits_uhwi_p (t1
)
2933 || !tree_fits_uhwi_p (t2
))
2935 error ("invalid position or size operand to BIT_FIELD_REF");
2938 if (INTEGRAL_TYPE_P (TREE_TYPE (t
))
2939 && (TYPE_PRECISION (TREE_TYPE (t
))
2940 != tree_to_uhwi (t1
)))
2942 error ("integral result type precision does not match "
2943 "field size of BIT_FIELD_REF");
2946 else if (!INTEGRAL_TYPE_P (TREE_TYPE (t
))
2947 && TYPE_MODE (TREE_TYPE (t
)) != BLKmode
2948 && (GET_MODE_PRECISION (TYPE_MODE (TREE_TYPE (t
)))
2949 != tree_to_uhwi (t1
)))
2951 error ("mode precision of non-integral result does not "
2952 "match field size of BIT_FIELD_REF");
2955 if (!AGGREGATE_TYPE_P (TREE_TYPE (t0
))
2956 && (tree_to_uhwi (t1
) + tree_to_uhwi (t2
)
2957 > tree_to_uhwi (TYPE_SIZE (TREE_TYPE (t0
)))))
2959 error ("position plus size exceeds size of referenced object in "
2964 t
= TREE_OPERAND (t
, 0);
2969 case ARRAY_RANGE_REF
:
2970 case VIEW_CONVERT_EXPR
:
2971 /* We have a nest of references. Verify that each of the operands
2972 that determine where to reference is either a constant or a variable,
2973 verify that the base is valid, and then show we've already checked
2975 while (handled_component_p (t
))
2977 if (TREE_CODE (t
) == COMPONENT_REF
&& TREE_OPERAND (t
, 2))
2978 CHECK_OP (2, "invalid COMPONENT_REF offset operator");
2979 else if (TREE_CODE (t
) == ARRAY_REF
2980 || TREE_CODE (t
) == ARRAY_RANGE_REF
)
2982 CHECK_OP (1, "invalid array index");
2983 if (TREE_OPERAND (t
, 2))
2984 CHECK_OP (2, "invalid array lower bound");
2985 if (TREE_OPERAND (t
, 3))
2986 CHECK_OP (3, "invalid array stride");
2988 else if (TREE_CODE (t
) == BIT_FIELD_REF
2989 || TREE_CODE (t
) == REALPART_EXPR
2990 || TREE_CODE (t
) == IMAGPART_EXPR
)
2992 error ("non-top-level BIT_FIELD_REF, IMAGPART_EXPR or "
2997 t
= TREE_OPERAND (t
, 0);
3000 if (!is_gimple_min_invariant (t
) && !is_gimple_lvalue (t
))
3002 error ("invalid reference prefix");
3009 /* PLUS_EXPR and MINUS_EXPR don't work on pointers, they should be done using
3010 POINTER_PLUS_EXPR. */
3011 if (POINTER_TYPE_P (TREE_TYPE (t
)))
3013 error ("invalid operand to plus/minus, type is a pointer");
3016 CHECK_OP (0, "invalid operand to binary operator");
3017 CHECK_OP (1, "invalid operand to binary operator");
3020 case POINTER_PLUS_EXPR
:
3021 /* Check to make sure the first operand is a pointer or reference type. */
3022 if (!POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (t
, 0))))
3024 error ("invalid operand to pointer plus, first operand is not a pointer");
3027 /* Check to make sure the second operand is a ptrofftype. */
3028 if (!ptrofftype_p (TREE_TYPE (TREE_OPERAND (t
, 1))))
3030 error ("invalid operand to pointer plus, second operand is not an "
3031 "integer type of appropriate width");
3041 case UNORDERED_EXPR
:
3050 case TRUNC_DIV_EXPR
:
3052 case FLOOR_DIV_EXPR
:
3053 case ROUND_DIV_EXPR
:
3054 case TRUNC_MOD_EXPR
:
3056 case FLOOR_MOD_EXPR
:
3057 case ROUND_MOD_EXPR
:
3059 case EXACT_DIV_EXPR
:
3069 CHECK_OP (0, "invalid operand to binary operator");
3070 CHECK_OP (1, "invalid operand to binary operator");
3074 if (TREE_CONSTANT (t
) && TREE_CODE (TREE_TYPE (t
)) == VECTOR_TYPE
)
3078 case CASE_LABEL_EXPR
:
3081 error ("invalid CASE_CHAIN");
3095 /* Verify if EXPR is either a GIMPLE ID or a GIMPLE indirect reference.
3096 Returns true if there is an error, otherwise false. */
3099 verify_types_in_gimple_min_lval (tree expr
)
3103 if (is_gimple_id (expr
))
3106 if (TREE_CODE (expr
) != TARGET_MEM_REF
3107 && TREE_CODE (expr
) != MEM_REF
)
3109 error ("invalid expression for min lvalue");
3113 /* TARGET_MEM_REFs are strange beasts. */
3114 if (TREE_CODE (expr
) == TARGET_MEM_REF
)
3117 op
= TREE_OPERAND (expr
, 0);
3118 if (!is_gimple_val (op
))
3120 error ("invalid operand in indirect reference");
3121 debug_generic_stmt (op
);
3124 /* Memory references now generally can involve a value conversion. */
3129 /* Verify if EXPR is a valid GIMPLE reference expression. If
3130 REQUIRE_LVALUE is true verifies it is an lvalue. Returns true
3131 if there is an error, otherwise false. */
3134 verify_types_in_gimple_reference (tree expr
, bool require_lvalue
)
3136 while (handled_component_p (expr
))
3138 tree op
= TREE_OPERAND (expr
, 0);
3140 if (TREE_CODE (expr
) == ARRAY_REF
3141 || TREE_CODE (expr
) == ARRAY_RANGE_REF
)
3143 if (!is_gimple_val (TREE_OPERAND (expr
, 1))
3144 || (TREE_OPERAND (expr
, 2)
3145 && !is_gimple_val (TREE_OPERAND (expr
, 2)))
3146 || (TREE_OPERAND (expr
, 3)
3147 && !is_gimple_val (TREE_OPERAND (expr
, 3))))
3149 error ("invalid operands to array reference");
3150 debug_generic_stmt (expr
);
3155 /* Verify if the reference array element types are compatible. */
3156 if (TREE_CODE (expr
) == ARRAY_REF
3157 && !useless_type_conversion_p (TREE_TYPE (expr
),
3158 TREE_TYPE (TREE_TYPE (op
))))
3160 error ("type mismatch in array reference");
3161 debug_generic_stmt (TREE_TYPE (expr
));
3162 debug_generic_stmt (TREE_TYPE (TREE_TYPE (op
)));
3165 if (TREE_CODE (expr
) == ARRAY_RANGE_REF
3166 && !useless_type_conversion_p (TREE_TYPE (TREE_TYPE (expr
)),
3167 TREE_TYPE (TREE_TYPE (op
))))
3169 error ("type mismatch in array range reference");
3170 debug_generic_stmt (TREE_TYPE (TREE_TYPE (expr
)));
3171 debug_generic_stmt (TREE_TYPE (TREE_TYPE (op
)));
3175 if ((TREE_CODE (expr
) == REALPART_EXPR
3176 || TREE_CODE (expr
) == IMAGPART_EXPR
)
3177 && !useless_type_conversion_p (TREE_TYPE (expr
),
3178 TREE_TYPE (TREE_TYPE (op
))))
3180 error ("type mismatch in real/imagpart reference");
3181 debug_generic_stmt (TREE_TYPE (expr
));
3182 debug_generic_stmt (TREE_TYPE (TREE_TYPE (op
)));
3186 if (TREE_CODE (expr
) == COMPONENT_REF
3187 && !useless_type_conversion_p (TREE_TYPE (expr
),
3188 TREE_TYPE (TREE_OPERAND (expr
, 1))))
3190 error ("type mismatch in component reference");
3191 debug_generic_stmt (TREE_TYPE (expr
));
3192 debug_generic_stmt (TREE_TYPE (TREE_OPERAND (expr
, 1)));
3196 if (TREE_CODE (expr
) == VIEW_CONVERT_EXPR
)
3198 /* For VIEW_CONVERT_EXPRs which are allowed here too, we only check
3199 that their operand is not an SSA name or an invariant when
3200 requiring an lvalue (this usually means there is a SRA or IPA-SRA
3201 bug). Otherwise there is nothing to verify, gross mismatches at
3202 most invoke undefined behavior. */
3204 && (TREE_CODE (op
) == SSA_NAME
3205 || is_gimple_min_invariant (op
)))
3207 error ("conversion of an SSA_NAME on the left hand side");
3208 debug_generic_stmt (expr
);
3211 else if (TREE_CODE (op
) == SSA_NAME
3212 && TYPE_SIZE (TREE_TYPE (expr
)) != TYPE_SIZE (TREE_TYPE (op
)))
3214 error ("conversion of register to a different size");
3215 debug_generic_stmt (expr
);
3218 else if (!handled_component_p (op
))
3225 if (TREE_CODE (expr
) == MEM_REF
)
3227 if (!is_gimple_mem_ref_addr (TREE_OPERAND (expr
, 0)))
3229 error ("invalid address operand in MEM_REF");
3230 debug_generic_stmt (expr
);
3233 if (TREE_CODE (TREE_OPERAND (expr
, 1)) != INTEGER_CST
3234 || !POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (expr
, 1))))
3236 error ("invalid offset operand in MEM_REF");
3237 debug_generic_stmt (expr
);
3241 else if (TREE_CODE (expr
) == TARGET_MEM_REF
)
3243 if (!TMR_BASE (expr
)
3244 || !is_gimple_mem_ref_addr (TMR_BASE (expr
)))
3246 error ("invalid address operand in TARGET_MEM_REF");
3249 if (!TMR_OFFSET (expr
)
3250 || TREE_CODE (TMR_OFFSET (expr
)) != INTEGER_CST
3251 || !POINTER_TYPE_P (TREE_TYPE (TMR_OFFSET (expr
))))
3253 error ("invalid offset operand in TARGET_MEM_REF");
3254 debug_generic_stmt (expr
);
3259 return ((require_lvalue
|| !is_gimple_min_invariant (expr
))
3260 && verify_types_in_gimple_min_lval (expr
));
3263 /* Returns true if there is one pointer type in TYPE_POINTER_TO (SRC_OBJ)
3264 list of pointer-to types that is trivially convertible to DEST. */
3267 one_pointer_to_useless_type_conversion_p (tree dest
, tree src_obj
)
3271 if (!TYPE_POINTER_TO (src_obj
))
3274 for (src
= TYPE_POINTER_TO (src_obj
); src
; src
= TYPE_NEXT_PTR_TO (src
))
3275 if (useless_type_conversion_p (dest
, src
))
3281 /* Return true if TYPE1 is a fixed-point type and if conversions to and
3282 from TYPE2 can be handled by FIXED_CONVERT_EXPR. */
3285 valid_fixed_convert_types_p (tree type1
, tree type2
)
3287 return (FIXED_POINT_TYPE_P (type1
)
3288 && (INTEGRAL_TYPE_P (type2
)
3289 || SCALAR_FLOAT_TYPE_P (type2
)
3290 || FIXED_POINT_TYPE_P (type2
)));
3293 /* Verify the contents of a GIMPLE_CALL STMT. Returns true when there
3294 is a problem, otherwise false. */
3297 verify_gimple_call (gcall
*stmt
)
3299 tree fn
= gimple_call_fn (stmt
);
3300 tree fntype
, fndecl
;
3303 if (gimple_call_internal_p (stmt
))
3307 error ("gimple call has two targets");
3308 debug_generic_stmt (fn
);
3316 error ("gimple call has no target");
3321 if (fn
&& !is_gimple_call_addr (fn
))
3323 error ("invalid function in gimple call");
3324 debug_generic_stmt (fn
);
3329 && (!POINTER_TYPE_P (TREE_TYPE (fn
))
3330 || (TREE_CODE (TREE_TYPE (TREE_TYPE (fn
))) != FUNCTION_TYPE
3331 && TREE_CODE (TREE_TYPE (TREE_TYPE (fn
))) != METHOD_TYPE
)))
3333 error ("non-function in gimple call");
3337 fndecl
= gimple_call_fndecl (stmt
);
3339 && TREE_CODE (fndecl
) == FUNCTION_DECL
3340 && DECL_LOOPING_CONST_OR_PURE_P (fndecl
)
3341 && !DECL_PURE_P (fndecl
)
3342 && !TREE_READONLY (fndecl
))
3344 error ("invalid pure const state for function");
3348 tree lhs
= gimple_call_lhs (stmt
);
3350 && (!is_gimple_lvalue (lhs
)
3351 || verify_types_in_gimple_reference (lhs
, true)))
3353 error ("invalid LHS in gimple call");
3358 && gimple_call_ctrl_altering_p (stmt
)
3359 && gimple_call_noreturn_p (stmt
)
3360 && TREE_CODE (TYPE_SIZE_UNIT (TREE_TYPE (lhs
))) == INTEGER_CST
)
3362 error ("LHS in noreturn call");
3366 fntype
= gimple_call_fntype (stmt
);
3369 && !useless_type_conversion_p (TREE_TYPE (lhs
), TREE_TYPE (fntype
))
3370 /* ??? At least C++ misses conversions at assignments from
3371 void * call results.
3372 ??? Java is completely off. Especially with functions
3373 returning java.lang.Object.
3374 For now simply allow arbitrary pointer type conversions. */
3375 && !(POINTER_TYPE_P (TREE_TYPE (lhs
))
3376 && POINTER_TYPE_P (TREE_TYPE (fntype
))))
3378 error ("invalid conversion in gimple call");
3379 debug_generic_stmt (TREE_TYPE (lhs
));
3380 debug_generic_stmt (TREE_TYPE (fntype
));
3384 if (gimple_call_chain (stmt
)
3385 && !is_gimple_val (gimple_call_chain (stmt
)))
3387 error ("invalid static chain in gimple call");
3388 debug_generic_stmt (gimple_call_chain (stmt
));
3392 /* If there is a static chain argument, the call should either be
3393 indirect, or the decl should have DECL_STATIC_CHAIN set. */
3394 if (gimple_call_chain (stmt
)
3396 && !DECL_STATIC_CHAIN (fndecl
))
3398 error ("static chain with function that doesn%'t use one");
3402 /* ??? The C frontend passes unpromoted arguments in case it
3403 didn't see a function declaration before the call. So for now
3404 leave the call arguments mostly unverified. Once we gimplify
3405 unit-at-a-time we have a chance to fix this. */
3407 for (i
= 0; i
< gimple_call_num_args (stmt
); ++i
)
3409 tree arg
= gimple_call_arg (stmt
, i
);
3410 if ((is_gimple_reg_type (TREE_TYPE (arg
))
3411 && !is_gimple_val (arg
))
3412 || (!is_gimple_reg_type (TREE_TYPE (arg
))
3413 && !is_gimple_lvalue (arg
)))
3415 error ("invalid argument to gimple call");
3416 debug_generic_expr (arg
);
3424 /* Verifies the gimple comparison with the result type TYPE and
3425 the operands OP0 and OP1. */
3428 verify_gimple_comparison (tree type
, tree op0
, tree op1
)
3430 tree op0_type
= TREE_TYPE (op0
);
3431 tree op1_type
= TREE_TYPE (op1
);
3433 if (!is_gimple_val (op0
) || !is_gimple_val (op1
))
3435 error ("invalid operands in gimple comparison");
3439 /* For comparisons we do not have the operations type as the
3440 effective type the comparison is carried out in. Instead
3441 we require that either the first operand is trivially
3442 convertible into the second, or the other way around.
3443 Because we special-case pointers to void we allow
3444 comparisons of pointers with the same mode as well. */
3445 if (!useless_type_conversion_p (op0_type
, op1_type
)
3446 && !useless_type_conversion_p (op1_type
, op0_type
)
3447 && (!POINTER_TYPE_P (op0_type
)
3448 || !POINTER_TYPE_P (op1_type
)
3449 || TYPE_MODE (op0_type
) != TYPE_MODE (op1_type
)))
3451 error ("mismatching comparison operand types");
3452 debug_generic_expr (op0_type
);
3453 debug_generic_expr (op1_type
);
3457 /* The resulting type of a comparison may be an effective boolean type. */
3458 if (INTEGRAL_TYPE_P (type
)
3459 && (TREE_CODE (type
) == BOOLEAN_TYPE
3460 || TYPE_PRECISION (type
) == 1))
3462 if (TREE_CODE (op0_type
) == VECTOR_TYPE
3463 || TREE_CODE (op1_type
) == VECTOR_TYPE
)
3465 error ("vector comparison returning a boolean");
3466 debug_generic_expr (op0_type
);
3467 debug_generic_expr (op1_type
);
3471 /* Or a boolean vector type with the same element count
3472 as the comparison operand types. */
3473 else if (TREE_CODE (type
) == VECTOR_TYPE
3474 && TREE_CODE (TREE_TYPE (type
)) == BOOLEAN_TYPE
)
3476 if (TREE_CODE (op0_type
) != VECTOR_TYPE
3477 || TREE_CODE (op1_type
) != VECTOR_TYPE
)
3479 error ("non-vector operands in vector comparison");
3480 debug_generic_expr (op0_type
);
3481 debug_generic_expr (op1_type
);
3485 if (TYPE_VECTOR_SUBPARTS (type
) != TYPE_VECTOR_SUBPARTS (op0_type
))
3487 error ("invalid vector comparison resulting type");
3488 debug_generic_expr (type
);
3494 error ("bogus comparison result type");
3495 debug_generic_expr (type
);
3502 /* Verify a gimple assignment statement STMT with an unary rhs.
3503 Returns true if anything is wrong. */
3506 verify_gimple_assign_unary (gassign
*stmt
)
3508 enum tree_code rhs_code
= gimple_assign_rhs_code (stmt
);
3509 tree lhs
= gimple_assign_lhs (stmt
);
3510 tree lhs_type
= TREE_TYPE (lhs
);
3511 tree rhs1
= gimple_assign_rhs1 (stmt
);
3512 tree rhs1_type
= TREE_TYPE (rhs1
);
3514 if (!is_gimple_reg (lhs
))
3516 error ("non-register as LHS of unary operation");
3520 if (!is_gimple_val (rhs1
))
3522 error ("invalid operand in unary operation");
3526 /* First handle conversions. */
3531 /* Allow conversions from pointer type to integral type only if
3532 there is no sign or zero extension involved.
3533 For targets were the precision of ptrofftype doesn't match that
3534 of pointers we need to allow arbitrary conversions to ptrofftype. */
3535 if ((POINTER_TYPE_P (lhs_type
)
3536 && INTEGRAL_TYPE_P (rhs1_type
))
3537 || (POINTER_TYPE_P (rhs1_type
)
3538 && INTEGRAL_TYPE_P (lhs_type
)
3539 && (TYPE_PRECISION (rhs1_type
) >= TYPE_PRECISION (lhs_type
)
3540 || ptrofftype_p (sizetype
))))
3543 /* Allow conversion from integral to offset type and vice versa. */
3544 if ((TREE_CODE (lhs_type
) == OFFSET_TYPE
3545 && INTEGRAL_TYPE_P (rhs1_type
))
3546 || (INTEGRAL_TYPE_P (lhs_type
)
3547 && TREE_CODE (rhs1_type
) == OFFSET_TYPE
))
3550 /* Otherwise assert we are converting between types of the
3552 if (INTEGRAL_TYPE_P (lhs_type
) != INTEGRAL_TYPE_P (rhs1_type
))
3554 error ("invalid types in nop conversion");
3555 debug_generic_expr (lhs_type
);
3556 debug_generic_expr (rhs1_type
);
3563 case ADDR_SPACE_CONVERT_EXPR
:
3565 if (!POINTER_TYPE_P (rhs1_type
) || !POINTER_TYPE_P (lhs_type
)
3566 || (TYPE_ADDR_SPACE (TREE_TYPE (rhs1_type
))
3567 == TYPE_ADDR_SPACE (TREE_TYPE (lhs_type
))))
3569 error ("invalid types in address space conversion");
3570 debug_generic_expr (lhs_type
);
3571 debug_generic_expr (rhs1_type
);
3578 case FIXED_CONVERT_EXPR
:
3580 if (!valid_fixed_convert_types_p (lhs_type
, rhs1_type
)
3581 && !valid_fixed_convert_types_p (rhs1_type
, lhs_type
))
3583 error ("invalid types in fixed-point conversion");
3584 debug_generic_expr (lhs_type
);
3585 debug_generic_expr (rhs1_type
);
3594 if ((!INTEGRAL_TYPE_P (rhs1_type
) || !SCALAR_FLOAT_TYPE_P (lhs_type
))
3595 && (!VECTOR_INTEGER_TYPE_P (rhs1_type
)
3596 || !VECTOR_FLOAT_TYPE_P (lhs_type
)))
3598 error ("invalid types in conversion to floating point");
3599 debug_generic_expr (lhs_type
);
3600 debug_generic_expr (rhs1_type
);
3607 case FIX_TRUNC_EXPR
:
3609 if ((!INTEGRAL_TYPE_P (lhs_type
) || !SCALAR_FLOAT_TYPE_P (rhs1_type
))
3610 && (!VECTOR_INTEGER_TYPE_P (lhs_type
)
3611 || !VECTOR_FLOAT_TYPE_P (rhs1_type
)))
3613 error ("invalid types in conversion to integer");
3614 debug_generic_expr (lhs_type
);
3615 debug_generic_expr (rhs1_type
);
3621 case REDUC_MAX_EXPR
:
3622 case REDUC_MIN_EXPR
:
3623 case REDUC_PLUS_EXPR
:
3624 if (!VECTOR_TYPE_P (rhs1_type
)
3625 || !useless_type_conversion_p (lhs_type
, TREE_TYPE (rhs1_type
)))
3627 error ("reduction should convert from vector to element type");
3628 debug_generic_expr (lhs_type
);
3629 debug_generic_expr (rhs1_type
);
3634 case VEC_UNPACK_HI_EXPR
:
3635 case VEC_UNPACK_LO_EXPR
:
3636 case VEC_UNPACK_FLOAT_HI_EXPR
:
3637 case VEC_UNPACK_FLOAT_LO_EXPR
:
3652 /* For the remaining codes assert there is no conversion involved. */
3653 if (!useless_type_conversion_p (lhs_type
, rhs1_type
))
3655 error ("non-trivial conversion in unary operation");
3656 debug_generic_expr (lhs_type
);
3657 debug_generic_expr (rhs1_type
);
3664 /* Verify a gimple assignment statement STMT with a binary rhs.
3665 Returns true if anything is wrong. */
3668 verify_gimple_assign_binary (gassign
*stmt
)
3670 enum tree_code rhs_code
= gimple_assign_rhs_code (stmt
);
3671 tree lhs
= gimple_assign_lhs (stmt
);
3672 tree lhs_type
= TREE_TYPE (lhs
);
3673 tree rhs1
= gimple_assign_rhs1 (stmt
);
3674 tree rhs1_type
= TREE_TYPE (rhs1
);
3675 tree rhs2
= gimple_assign_rhs2 (stmt
);
3676 tree rhs2_type
= TREE_TYPE (rhs2
);
3678 if (!is_gimple_reg (lhs
))
3680 error ("non-register as LHS of binary operation");
3684 if (!is_gimple_val (rhs1
)
3685 || !is_gimple_val (rhs2
))
3687 error ("invalid operands in binary operation");
3691 /* First handle operations that involve different types. */
3696 if (TREE_CODE (lhs_type
) != COMPLEX_TYPE
3697 || !(INTEGRAL_TYPE_P (rhs1_type
)
3698 || SCALAR_FLOAT_TYPE_P (rhs1_type
))
3699 || !(INTEGRAL_TYPE_P (rhs2_type
)
3700 || SCALAR_FLOAT_TYPE_P (rhs2_type
)))
3702 error ("type mismatch in complex expression");
3703 debug_generic_expr (lhs_type
);
3704 debug_generic_expr (rhs1_type
);
3705 debug_generic_expr (rhs2_type
);
3717 /* Shifts and rotates are ok on integral types, fixed point
3718 types and integer vector types. */
3719 if ((!INTEGRAL_TYPE_P (rhs1_type
)
3720 && !FIXED_POINT_TYPE_P (rhs1_type
)
3721 && !(TREE_CODE (rhs1_type
) == VECTOR_TYPE
3722 && INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type
))))
3723 || (!INTEGRAL_TYPE_P (rhs2_type
)
3724 /* Vector shifts of vectors are also ok. */
3725 && !(TREE_CODE (rhs1_type
) == VECTOR_TYPE
3726 && INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type
))
3727 && TREE_CODE (rhs2_type
) == VECTOR_TYPE
3728 && INTEGRAL_TYPE_P (TREE_TYPE (rhs2_type
))))
3729 || !useless_type_conversion_p (lhs_type
, rhs1_type
))
3731 error ("type mismatch in shift expression");
3732 debug_generic_expr (lhs_type
);
3733 debug_generic_expr (rhs1_type
);
3734 debug_generic_expr (rhs2_type
);
3741 case WIDEN_LSHIFT_EXPR
:
3743 if (!INTEGRAL_TYPE_P (lhs_type
)
3744 || !INTEGRAL_TYPE_P (rhs1_type
)
3745 || TREE_CODE (rhs2
) != INTEGER_CST
3746 || (2 * TYPE_PRECISION (rhs1_type
) > TYPE_PRECISION (lhs_type
)))
3748 error ("type mismatch in widening vector shift expression");
3749 debug_generic_expr (lhs_type
);
3750 debug_generic_expr (rhs1_type
);
3751 debug_generic_expr (rhs2_type
);
3758 case VEC_WIDEN_LSHIFT_HI_EXPR
:
3759 case VEC_WIDEN_LSHIFT_LO_EXPR
:
3761 if (TREE_CODE (rhs1_type
) != VECTOR_TYPE
3762 || TREE_CODE (lhs_type
) != VECTOR_TYPE
3763 || !INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type
))
3764 || !INTEGRAL_TYPE_P (TREE_TYPE (lhs_type
))
3765 || TREE_CODE (rhs2
) != INTEGER_CST
3766 || (2 * TYPE_PRECISION (TREE_TYPE (rhs1_type
))
3767 > TYPE_PRECISION (TREE_TYPE (lhs_type
))))
3769 error ("type mismatch in widening vector shift expression");
3770 debug_generic_expr (lhs_type
);
3771 debug_generic_expr (rhs1_type
);
3772 debug_generic_expr (rhs2_type
);
3782 tree lhs_etype
= lhs_type
;
3783 tree rhs1_etype
= rhs1_type
;
3784 tree rhs2_etype
= rhs2_type
;
3785 if (TREE_CODE (lhs_type
) == VECTOR_TYPE
)
3787 if (TREE_CODE (rhs1_type
) != VECTOR_TYPE
3788 || TREE_CODE (rhs2_type
) != VECTOR_TYPE
)
3790 error ("invalid non-vector operands to vector valued plus");
3793 lhs_etype
= TREE_TYPE (lhs_type
);
3794 rhs1_etype
= TREE_TYPE (rhs1_type
);
3795 rhs2_etype
= TREE_TYPE (rhs2_type
);
3797 if (POINTER_TYPE_P (lhs_etype
)
3798 || POINTER_TYPE_P (rhs1_etype
)
3799 || POINTER_TYPE_P (rhs2_etype
))
3801 error ("invalid (pointer) operands to plus/minus");
3805 /* Continue with generic binary expression handling. */
3809 case POINTER_PLUS_EXPR
:
3811 if (!POINTER_TYPE_P (rhs1_type
)
3812 || !useless_type_conversion_p (lhs_type
, rhs1_type
)
3813 || !ptrofftype_p (rhs2_type
))
3815 error ("type mismatch in pointer plus expression");
3816 debug_generic_stmt (lhs_type
);
3817 debug_generic_stmt (rhs1_type
);
3818 debug_generic_stmt (rhs2_type
);
3825 case TRUTH_ANDIF_EXPR
:
3826 case TRUTH_ORIF_EXPR
:
3827 case TRUTH_AND_EXPR
:
3829 case TRUTH_XOR_EXPR
:
3839 case UNORDERED_EXPR
:
3847 /* Comparisons are also binary, but the result type is not
3848 connected to the operand types. */
3849 return verify_gimple_comparison (lhs_type
, rhs1
, rhs2
);
3851 case WIDEN_MULT_EXPR
:
3852 if (TREE_CODE (lhs_type
) != INTEGER_TYPE
)
3854 return ((2 * TYPE_PRECISION (rhs1_type
) > TYPE_PRECISION (lhs_type
))
3855 || (TYPE_PRECISION (rhs1_type
) != TYPE_PRECISION (rhs2_type
)));
3857 case WIDEN_SUM_EXPR
:
3858 case VEC_WIDEN_MULT_HI_EXPR
:
3859 case VEC_WIDEN_MULT_LO_EXPR
:
3860 case VEC_WIDEN_MULT_EVEN_EXPR
:
3861 case VEC_WIDEN_MULT_ODD_EXPR
:
3862 case VEC_PACK_TRUNC_EXPR
:
3863 case VEC_PACK_SAT_EXPR
:
3864 case VEC_PACK_FIX_TRUNC_EXPR
:
3869 case MULT_HIGHPART_EXPR
:
3870 case TRUNC_DIV_EXPR
:
3872 case FLOOR_DIV_EXPR
:
3873 case ROUND_DIV_EXPR
:
3874 case TRUNC_MOD_EXPR
:
3876 case FLOOR_MOD_EXPR
:
3877 case ROUND_MOD_EXPR
:
3879 case EXACT_DIV_EXPR
:
3885 /* Continue with generic binary expression handling. */
3892 if (!useless_type_conversion_p (lhs_type
, rhs1_type
)
3893 || !useless_type_conversion_p (lhs_type
, rhs2_type
))
3895 error ("type mismatch in binary expression");
3896 debug_generic_stmt (lhs_type
);
3897 debug_generic_stmt (rhs1_type
);
3898 debug_generic_stmt (rhs2_type
);
3905 /* Verify a gimple assignment statement STMT with a ternary rhs.
3906 Returns true if anything is wrong. */
3909 verify_gimple_assign_ternary (gassign
*stmt
)
3911 enum tree_code rhs_code
= gimple_assign_rhs_code (stmt
);
3912 tree lhs
= gimple_assign_lhs (stmt
);
3913 tree lhs_type
= TREE_TYPE (lhs
);
3914 tree rhs1
= gimple_assign_rhs1 (stmt
);
3915 tree rhs1_type
= TREE_TYPE (rhs1
);
3916 tree rhs2
= gimple_assign_rhs2 (stmt
);
3917 tree rhs2_type
= TREE_TYPE (rhs2
);
3918 tree rhs3
= gimple_assign_rhs3 (stmt
);
3919 tree rhs3_type
= TREE_TYPE (rhs3
);
3921 if (!is_gimple_reg (lhs
))
3923 error ("non-register as LHS of ternary operation");
3927 if (((rhs_code
== VEC_COND_EXPR
|| rhs_code
== COND_EXPR
)
3928 ? !is_gimple_condexpr (rhs1
) : !is_gimple_val (rhs1
))
3929 || !is_gimple_val (rhs2
)
3930 || !is_gimple_val (rhs3
))
3932 error ("invalid operands in ternary operation");
3936 /* First handle operations that involve different types. */
3939 case WIDEN_MULT_PLUS_EXPR
:
3940 case WIDEN_MULT_MINUS_EXPR
:
3941 if ((!INTEGRAL_TYPE_P (rhs1_type
)
3942 && !FIXED_POINT_TYPE_P (rhs1_type
))
3943 || !useless_type_conversion_p (rhs1_type
, rhs2_type
)
3944 || !useless_type_conversion_p (lhs_type
, rhs3_type
)
3945 || 2 * TYPE_PRECISION (rhs1_type
) > TYPE_PRECISION (lhs_type
)
3946 || TYPE_PRECISION (rhs1_type
) != TYPE_PRECISION (rhs2_type
))
3948 error ("type mismatch in widening multiply-accumulate expression");
3949 debug_generic_expr (lhs_type
);
3950 debug_generic_expr (rhs1_type
);
3951 debug_generic_expr (rhs2_type
);
3952 debug_generic_expr (rhs3_type
);
3958 if (!useless_type_conversion_p (lhs_type
, rhs1_type
)
3959 || !useless_type_conversion_p (lhs_type
, rhs2_type
)
3960 || !useless_type_conversion_p (lhs_type
, rhs3_type
))
3962 error ("type mismatch in fused multiply-add expression");
3963 debug_generic_expr (lhs_type
);
3964 debug_generic_expr (rhs1_type
);
3965 debug_generic_expr (rhs2_type
);
3966 debug_generic_expr (rhs3_type
);
3972 if (!VECTOR_BOOLEAN_TYPE_P (rhs1_type
)
3973 || TYPE_VECTOR_SUBPARTS (rhs1_type
)
3974 != TYPE_VECTOR_SUBPARTS (lhs_type
))
3976 error ("the first argument of a VEC_COND_EXPR must be of a "
3977 "boolean vector type of the same number of elements "
3979 debug_generic_expr (lhs_type
);
3980 debug_generic_expr (rhs1_type
);
3985 if (!useless_type_conversion_p (lhs_type
, rhs2_type
)
3986 || !useless_type_conversion_p (lhs_type
, rhs3_type
))
3988 error ("type mismatch in conditional expression");
3989 debug_generic_expr (lhs_type
);
3990 debug_generic_expr (rhs2_type
);
3991 debug_generic_expr (rhs3_type
);
3997 if (!useless_type_conversion_p (lhs_type
, rhs1_type
)
3998 || !useless_type_conversion_p (lhs_type
, rhs2_type
))
4000 error ("type mismatch in vector permute expression");
4001 debug_generic_expr (lhs_type
);
4002 debug_generic_expr (rhs1_type
);
4003 debug_generic_expr (rhs2_type
);
4004 debug_generic_expr (rhs3_type
);
4008 if (TREE_CODE (rhs1_type
) != VECTOR_TYPE
4009 || TREE_CODE (rhs2_type
) != VECTOR_TYPE
4010 || TREE_CODE (rhs3_type
) != VECTOR_TYPE
)
4012 error ("vector types expected in vector permute expression");
4013 debug_generic_expr (lhs_type
);
4014 debug_generic_expr (rhs1_type
);
4015 debug_generic_expr (rhs2_type
);
4016 debug_generic_expr (rhs3_type
);
4020 if (TYPE_VECTOR_SUBPARTS (rhs1_type
) != TYPE_VECTOR_SUBPARTS (rhs2_type
)
4021 || TYPE_VECTOR_SUBPARTS (rhs2_type
)
4022 != TYPE_VECTOR_SUBPARTS (rhs3_type
)
4023 || TYPE_VECTOR_SUBPARTS (rhs3_type
)
4024 != TYPE_VECTOR_SUBPARTS (lhs_type
))
4026 error ("vectors with different element number found "
4027 "in vector permute expression");
4028 debug_generic_expr (lhs_type
);
4029 debug_generic_expr (rhs1_type
);
4030 debug_generic_expr (rhs2_type
);
4031 debug_generic_expr (rhs3_type
);
4035 if (TREE_CODE (TREE_TYPE (rhs3_type
)) != INTEGER_TYPE
4036 || GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (rhs3_type
)))
4037 != GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (rhs1_type
))))
4039 error ("invalid mask type in vector permute expression");
4040 debug_generic_expr (lhs_type
);
4041 debug_generic_expr (rhs1_type
);
4042 debug_generic_expr (rhs2_type
);
4043 debug_generic_expr (rhs3_type
);
4050 if (!useless_type_conversion_p (rhs1_type
, rhs2_type
)
4051 || !useless_type_conversion_p (lhs_type
, rhs3_type
)
4052 || 2 * GET_MODE_UNIT_BITSIZE (TYPE_MODE (TREE_TYPE (rhs1_type
)))
4053 > GET_MODE_UNIT_BITSIZE (TYPE_MODE (TREE_TYPE (lhs_type
))))
4055 error ("type mismatch in sad expression");
4056 debug_generic_expr (lhs_type
);
4057 debug_generic_expr (rhs1_type
);
4058 debug_generic_expr (rhs2_type
);
4059 debug_generic_expr (rhs3_type
);
4063 if (TREE_CODE (rhs1_type
) != VECTOR_TYPE
4064 || TREE_CODE (rhs2_type
) != VECTOR_TYPE
4065 || TREE_CODE (rhs3_type
) != VECTOR_TYPE
)
4067 error ("vector types expected in sad expression");
4068 debug_generic_expr (lhs_type
);
4069 debug_generic_expr (rhs1_type
);
4070 debug_generic_expr (rhs2_type
);
4071 debug_generic_expr (rhs3_type
);
4078 case REALIGN_LOAD_EXPR
:
4088 /* Verify a gimple assignment statement STMT with a single rhs.
4089 Returns true if anything is wrong. */
4092 verify_gimple_assign_single (gassign
*stmt
)
4094 enum tree_code rhs_code
= gimple_assign_rhs_code (stmt
);
4095 tree lhs
= gimple_assign_lhs (stmt
);
4096 tree lhs_type
= TREE_TYPE (lhs
);
4097 tree rhs1
= gimple_assign_rhs1 (stmt
);
4098 tree rhs1_type
= TREE_TYPE (rhs1
);
4101 if (!useless_type_conversion_p (lhs_type
, rhs1_type
))
4103 error ("non-trivial conversion at assignment");
4104 debug_generic_expr (lhs_type
);
4105 debug_generic_expr (rhs1_type
);
4109 if (gimple_clobber_p (stmt
)
4110 && !(DECL_P (lhs
) || TREE_CODE (lhs
) == MEM_REF
))
4112 error ("non-decl/MEM_REF LHS in clobber statement");
4113 debug_generic_expr (lhs
);
4117 if (handled_component_p (lhs
)
4118 || TREE_CODE (lhs
) == MEM_REF
4119 || TREE_CODE (lhs
) == TARGET_MEM_REF
)
4120 res
|= verify_types_in_gimple_reference (lhs
, true);
4122 /* Special codes we cannot handle via their class. */
4127 tree op
= TREE_OPERAND (rhs1
, 0);
4128 if (!is_gimple_addressable (op
))
4130 error ("invalid operand in unary expression");
4134 /* Technically there is no longer a need for matching types, but
4135 gimple hygiene asks for this check. In LTO we can end up
4136 combining incompatible units and thus end up with addresses
4137 of globals that change their type to a common one. */
4139 && !types_compatible_p (TREE_TYPE (op
),
4140 TREE_TYPE (TREE_TYPE (rhs1
)))
4141 && !one_pointer_to_useless_type_conversion_p (TREE_TYPE (rhs1
),
4144 error ("type mismatch in address expression");
4145 debug_generic_stmt (TREE_TYPE (rhs1
));
4146 debug_generic_stmt (TREE_TYPE (op
));
4150 return verify_types_in_gimple_reference (op
, true);
4155 error ("INDIRECT_REF in gimple IL");
4161 case ARRAY_RANGE_REF
:
4162 case VIEW_CONVERT_EXPR
:
4165 case TARGET_MEM_REF
:
4167 if (!is_gimple_reg (lhs
)
4168 && is_gimple_reg_type (TREE_TYPE (lhs
)))
4170 error ("invalid rhs for gimple memory store");
4171 debug_generic_stmt (lhs
);
4172 debug_generic_stmt (rhs1
);
4175 return res
|| verify_types_in_gimple_reference (rhs1
, false);
4187 /* tcc_declaration */
4192 if (!is_gimple_reg (lhs
)
4193 && !is_gimple_reg (rhs1
)
4194 && is_gimple_reg_type (TREE_TYPE (lhs
)))
4196 error ("invalid rhs for gimple memory store");
4197 debug_generic_stmt (lhs
);
4198 debug_generic_stmt (rhs1
);
4204 if (TREE_CODE (rhs1_type
) == VECTOR_TYPE
)
4207 tree elt_i
, elt_v
, elt_t
= NULL_TREE
;
4209 if (CONSTRUCTOR_NELTS (rhs1
) == 0)
4211 /* For vector CONSTRUCTORs we require that either it is empty
4212 CONSTRUCTOR, or it is a CONSTRUCTOR of smaller vector elements
4213 (then the element count must be correct to cover the whole
4214 outer vector and index must be NULL on all elements, or it is
4215 a CONSTRUCTOR of scalar elements, where we as an exception allow
4216 smaller number of elements (assuming zero filling) and
4217 consecutive indexes as compared to NULL indexes (such
4218 CONSTRUCTORs can appear in the IL from FEs). */
4219 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (rhs1
), i
, elt_i
, elt_v
)
4221 if (elt_t
== NULL_TREE
)
4223 elt_t
= TREE_TYPE (elt_v
);
4224 if (TREE_CODE (elt_t
) == VECTOR_TYPE
)
4226 tree elt_t
= TREE_TYPE (elt_v
);
4227 if (!useless_type_conversion_p (TREE_TYPE (rhs1_type
),
4230 error ("incorrect type of vector CONSTRUCTOR"
4232 debug_generic_stmt (rhs1
);
4235 else if (CONSTRUCTOR_NELTS (rhs1
)
4236 * TYPE_VECTOR_SUBPARTS (elt_t
)
4237 != TYPE_VECTOR_SUBPARTS (rhs1_type
))
4239 error ("incorrect number of vector CONSTRUCTOR"
4241 debug_generic_stmt (rhs1
);
4245 else if (!useless_type_conversion_p (TREE_TYPE (rhs1_type
),
4248 error ("incorrect type of vector CONSTRUCTOR elements");
4249 debug_generic_stmt (rhs1
);
4252 else if (CONSTRUCTOR_NELTS (rhs1
)
4253 > TYPE_VECTOR_SUBPARTS (rhs1_type
))
4255 error ("incorrect number of vector CONSTRUCTOR elements");
4256 debug_generic_stmt (rhs1
);
4260 else if (!useless_type_conversion_p (elt_t
, TREE_TYPE (elt_v
)))
4262 error ("incorrect type of vector CONSTRUCTOR elements");
4263 debug_generic_stmt (rhs1
);
4266 if (elt_i
!= NULL_TREE
4267 && (TREE_CODE (elt_t
) == VECTOR_TYPE
4268 || TREE_CODE (elt_i
) != INTEGER_CST
4269 || compare_tree_int (elt_i
, i
) != 0))
4271 error ("vector CONSTRUCTOR with non-NULL element index");
4272 debug_generic_stmt (rhs1
);
4275 if (!is_gimple_val (elt_v
))
4277 error ("vector CONSTRUCTOR element is not a GIMPLE value");
4278 debug_generic_stmt (rhs1
);
4283 else if (CONSTRUCTOR_NELTS (rhs1
) != 0)
4285 error ("non-vector CONSTRUCTOR with elements");
4286 debug_generic_stmt (rhs1
);
4292 case WITH_SIZE_EXPR
:
4302 /* Verify the contents of a GIMPLE_ASSIGN STMT. Returns true when there
4303 is a problem, otherwise false. */
4306 verify_gimple_assign (gassign
*stmt
)
4308 switch (gimple_assign_rhs_class (stmt
))
4310 case GIMPLE_SINGLE_RHS
:
4311 return verify_gimple_assign_single (stmt
);
4313 case GIMPLE_UNARY_RHS
:
4314 return verify_gimple_assign_unary (stmt
);
4316 case GIMPLE_BINARY_RHS
:
4317 return verify_gimple_assign_binary (stmt
);
4319 case GIMPLE_TERNARY_RHS
:
4320 return verify_gimple_assign_ternary (stmt
);
4327 /* Verify the contents of a GIMPLE_RETURN STMT. Returns true when there
4328 is a problem, otherwise false. */
4331 verify_gimple_return (greturn
*stmt
)
4333 tree op
= gimple_return_retval (stmt
);
4334 tree restype
= TREE_TYPE (TREE_TYPE (cfun
->decl
));
4336 /* We cannot test for present return values as we do not fix up missing
4337 return values from the original source. */
4341 if (!is_gimple_val (op
)
4342 && TREE_CODE (op
) != RESULT_DECL
)
4344 error ("invalid operand in return statement");
4345 debug_generic_stmt (op
);
4349 if ((TREE_CODE (op
) == RESULT_DECL
4350 && DECL_BY_REFERENCE (op
))
4351 || (TREE_CODE (op
) == SSA_NAME
4352 && SSA_NAME_VAR (op
)
4353 && TREE_CODE (SSA_NAME_VAR (op
)) == RESULT_DECL
4354 && DECL_BY_REFERENCE (SSA_NAME_VAR (op
))))
4355 op
= TREE_TYPE (op
);
4357 if (!useless_type_conversion_p (restype
, TREE_TYPE (op
)))
4359 error ("invalid conversion in return statement");
4360 debug_generic_stmt (restype
);
4361 debug_generic_stmt (TREE_TYPE (op
));
4369 /* Verify the contents of a GIMPLE_GOTO STMT. Returns true when there
4370 is a problem, otherwise false. */
4373 verify_gimple_goto (ggoto
*stmt
)
4375 tree dest
= gimple_goto_dest (stmt
);
4377 /* ??? We have two canonical forms of direct goto destinations, a
4378 bare LABEL_DECL and an ADDR_EXPR of a LABEL_DECL. */
4379 if (TREE_CODE (dest
) != LABEL_DECL
4380 && (!is_gimple_val (dest
)
4381 || !POINTER_TYPE_P (TREE_TYPE (dest
))))
4383 error ("goto destination is neither a label nor a pointer");
4390 /* Verify the contents of a GIMPLE_SWITCH STMT. Returns true when there
4391 is a problem, otherwise false. */
4394 verify_gimple_switch (gswitch
*stmt
)
4397 tree elt
, prev_upper_bound
= NULL_TREE
;
4398 tree index_type
, elt_type
= NULL_TREE
;
4400 if (!is_gimple_val (gimple_switch_index (stmt
)))
4402 error ("invalid operand to switch statement");
4403 debug_generic_stmt (gimple_switch_index (stmt
));
4407 index_type
= TREE_TYPE (gimple_switch_index (stmt
));
4408 if (! INTEGRAL_TYPE_P (index_type
))
4410 error ("non-integral type switch statement");
4411 debug_generic_expr (index_type
);
4415 elt
= gimple_switch_label (stmt
, 0);
4416 if (CASE_LOW (elt
) != NULL_TREE
|| CASE_HIGH (elt
) != NULL_TREE
)
4418 error ("invalid default case label in switch statement");
4419 debug_generic_expr (elt
);
4423 n
= gimple_switch_num_labels (stmt
);
4424 for (i
= 1; i
< n
; i
++)
4426 elt
= gimple_switch_label (stmt
, i
);
4428 if (! CASE_LOW (elt
))
4430 error ("invalid case label in switch statement");
4431 debug_generic_expr (elt
);
4435 && ! tree_int_cst_lt (CASE_LOW (elt
), CASE_HIGH (elt
)))
4437 error ("invalid case range in switch statement");
4438 debug_generic_expr (elt
);
4444 if (TREE_TYPE (CASE_LOW (elt
)) != elt_type
4445 || (CASE_HIGH (elt
) && TREE_TYPE (CASE_HIGH (elt
)) != elt_type
))
4447 error ("type mismatch for case label in switch statement");
4448 debug_generic_expr (elt
);
4454 elt_type
= TREE_TYPE (CASE_LOW (elt
));
4455 if (TYPE_PRECISION (index_type
) < TYPE_PRECISION (elt_type
))
4457 error ("type precision mismatch in switch statement");
4462 if (prev_upper_bound
)
4464 if (! tree_int_cst_lt (prev_upper_bound
, CASE_LOW (elt
)))
4466 error ("case labels not sorted in switch statement");
4471 prev_upper_bound
= CASE_HIGH (elt
);
4472 if (! prev_upper_bound
)
4473 prev_upper_bound
= CASE_LOW (elt
);
4479 /* Verify a gimple debug statement STMT.
4480 Returns true if anything is wrong. */
4483 verify_gimple_debug (gimple
*stmt ATTRIBUTE_UNUSED
)
4485 /* There isn't much that could be wrong in a gimple debug stmt. A
4486 gimple debug bind stmt, for example, maps a tree, that's usually
4487 a VAR_DECL or a PARM_DECL, but that could also be some scalarized
4488 component or member of an aggregate type, to another tree, that
4489 can be an arbitrary expression. These stmts expand into debug
4490 insns, and are converted to debug notes by var-tracking.c. */
4494 /* Verify a gimple label statement STMT.
4495 Returns true if anything is wrong. */
4498 verify_gimple_label (glabel
*stmt
)
4500 tree decl
= gimple_label_label (stmt
);
4504 if (TREE_CODE (decl
) != LABEL_DECL
)
4506 if (!DECL_NONLOCAL (decl
) && !FORCED_LABEL (decl
)
4507 && DECL_CONTEXT (decl
) != current_function_decl
)
4509 error ("label's context is not the current function decl");
4513 uid
= LABEL_DECL_UID (decl
);
4516 || (*label_to_block_map_for_fn (cfun
))[uid
] != gimple_bb (stmt
)))
4518 error ("incorrect entry in label_to_block_map");
4522 uid
= EH_LANDING_PAD_NR (decl
);
4525 eh_landing_pad lp
= get_eh_landing_pad_from_number (uid
);
4526 if (decl
!= lp
->post_landing_pad
)
4528 error ("incorrect setting of landing pad number");
4536 /* Verify a gimple cond statement STMT.
4537 Returns true if anything is wrong. */
4540 verify_gimple_cond (gcond
*stmt
)
4542 if (TREE_CODE_CLASS (gimple_cond_code (stmt
)) != tcc_comparison
)
4544 error ("invalid comparison code in gimple cond");
4547 if (!(!gimple_cond_true_label (stmt
)
4548 || TREE_CODE (gimple_cond_true_label (stmt
)) == LABEL_DECL
)
4549 || !(!gimple_cond_false_label (stmt
)
4550 || TREE_CODE (gimple_cond_false_label (stmt
)) == LABEL_DECL
))
4552 error ("invalid labels in gimple cond");
4556 return verify_gimple_comparison (boolean_type_node
,
4557 gimple_cond_lhs (stmt
),
4558 gimple_cond_rhs (stmt
));
4561 /* Verify the GIMPLE statement STMT. Returns true if there is an
4562 error, otherwise false. */
4565 verify_gimple_stmt (gimple
*stmt
)
4567 switch (gimple_code (stmt
))
4570 return verify_gimple_assign (as_a
<gassign
*> (stmt
));
4573 return verify_gimple_label (as_a
<glabel
*> (stmt
));
4576 return verify_gimple_call (as_a
<gcall
*> (stmt
));
4579 return verify_gimple_cond (as_a
<gcond
*> (stmt
));
4582 return verify_gimple_goto (as_a
<ggoto
*> (stmt
));
4585 return verify_gimple_switch (as_a
<gswitch
*> (stmt
));
4588 return verify_gimple_return (as_a
<greturn
*> (stmt
));
4593 case GIMPLE_TRANSACTION
:
4594 return verify_gimple_transaction (as_a
<gtransaction
*> (stmt
));
4596 /* Tuples that do not have tree operands. */
4598 case GIMPLE_PREDICT
:
4600 case GIMPLE_EH_DISPATCH
:
4601 case GIMPLE_EH_MUST_NOT_THROW
:
4605 /* OpenMP directives are validated by the FE and never operated
4606 on by the optimizers. Furthermore, GIMPLE_OMP_FOR may contain
4607 non-gimple expressions when the main index variable has had
4608 its address taken. This does not affect the loop itself
4609 because the header of an GIMPLE_OMP_FOR is merely used to determine
4610 how to setup the parallel iteration. */
4614 return verify_gimple_debug (stmt
);
4621 /* Verify the contents of a GIMPLE_PHI. Returns true if there is a problem,
4622 and false otherwise. */
4625 verify_gimple_phi (gimple
*phi
)
4629 tree phi_result
= gimple_phi_result (phi
);
4634 error ("invalid PHI result");
4638 virtual_p
= virtual_operand_p (phi_result
);
4639 if (TREE_CODE (phi_result
) != SSA_NAME
4641 && SSA_NAME_VAR (phi_result
) != gimple_vop (cfun
)))
4643 error ("invalid PHI result");
4647 for (i
= 0; i
< gimple_phi_num_args (phi
); i
++)
4649 tree t
= gimple_phi_arg_def (phi
, i
);
4653 error ("missing PHI def");
4657 /* Addressable variables do have SSA_NAMEs but they
4658 are not considered gimple values. */
4659 else if ((TREE_CODE (t
) == SSA_NAME
4660 && virtual_p
!= virtual_operand_p (t
))
4662 && (TREE_CODE (t
) != SSA_NAME
4663 || SSA_NAME_VAR (t
) != gimple_vop (cfun
)))
4665 && !is_gimple_val (t
)))
4667 error ("invalid PHI argument");
4668 debug_generic_expr (t
);
4671 #ifdef ENABLE_TYPES_CHECKING
4672 if (!useless_type_conversion_p (TREE_TYPE (phi_result
), TREE_TYPE (t
)))
4674 error ("incompatible types in PHI argument %u", i
);
4675 debug_generic_stmt (TREE_TYPE (phi_result
));
4676 debug_generic_stmt (TREE_TYPE (t
));
4685 /* Verify the GIMPLE statements inside the sequence STMTS. */
4688 verify_gimple_in_seq_2 (gimple_seq stmts
)
4690 gimple_stmt_iterator ittr
;
4693 for (ittr
= gsi_start (stmts
); !gsi_end_p (ittr
); gsi_next (&ittr
))
4695 gimple
*stmt
= gsi_stmt (ittr
);
4697 switch (gimple_code (stmt
))
4700 err
|= verify_gimple_in_seq_2 (
4701 gimple_bind_body (as_a
<gbind
*> (stmt
)));
4705 err
|= verify_gimple_in_seq_2 (gimple_try_eval (stmt
));
4706 err
|= verify_gimple_in_seq_2 (gimple_try_cleanup (stmt
));
4709 case GIMPLE_EH_FILTER
:
4710 err
|= verify_gimple_in_seq_2 (gimple_eh_filter_failure (stmt
));
4713 case GIMPLE_EH_ELSE
:
4715 geh_else
*eh_else
= as_a
<geh_else
*> (stmt
);
4716 err
|= verify_gimple_in_seq_2 (gimple_eh_else_n_body (eh_else
));
4717 err
|= verify_gimple_in_seq_2 (gimple_eh_else_e_body (eh_else
));
4722 err
|= verify_gimple_in_seq_2 (gimple_catch_handler (
4723 as_a
<gcatch
*> (stmt
)));
4726 case GIMPLE_TRANSACTION
:
4727 err
|= verify_gimple_transaction (as_a
<gtransaction
*> (stmt
));
4732 bool err2
= verify_gimple_stmt (stmt
);
4734 debug_gimple_stmt (stmt
);
4743 /* Verify the contents of a GIMPLE_TRANSACTION. Returns true if there
4744 is a problem, otherwise false. */
4747 verify_gimple_transaction (gtransaction
*stmt
)
4749 tree lab
= gimple_transaction_label (stmt
);
4750 if (lab
!= NULL
&& TREE_CODE (lab
) != LABEL_DECL
)
4752 return verify_gimple_in_seq_2 (gimple_transaction_body (stmt
));
4756 /* Verify the GIMPLE statements inside the statement list STMTS. */
4759 verify_gimple_in_seq (gimple_seq stmts
)
4761 timevar_push (TV_TREE_STMT_VERIFY
);
4762 if (verify_gimple_in_seq_2 (stmts
))
4763 internal_error ("verify_gimple failed");
4764 timevar_pop (TV_TREE_STMT_VERIFY
);
4767 /* Return true when the T can be shared. */
4770 tree_node_can_be_shared (tree t
)
4772 if (IS_TYPE_OR_DECL_P (t
)
4773 || is_gimple_min_invariant (t
)
4774 || TREE_CODE (t
) == SSA_NAME
4775 || t
== error_mark_node
4776 || TREE_CODE (t
) == IDENTIFIER_NODE
)
4779 if (TREE_CODE (t
) == CASE_LABEL_EXPR
)
4788 /* Called via walk_tree. Verify tree sharing. */
4791 verify_node_sharing_1 (tree
*tp
, int *walk_subtrees
, void *data
)
4793 hash_set
<void *> *visited
= (hash_set
<void *> *) data
;
4795 if (tree_node_can_be_shared (*tp
))
4797 *walk_subtrees
= false;
4801 if (visited
->add (*tp
))
4807 /* Called via walk_gimple_stmt. Verify tree sharing. */
4810 verify_node_sharing (tree
*tp
, int *walk_subtrees
, void *data
)
4812 struct walk_stmt_info
*wi
= (struct walk_stmt_info
*) data
;
4813 return verify_node_sharing_1 (tp
, walk_subtrees
, wi
->info
);
4816 static bool eh_error_found
;
4818 verify_eh_throw_stmt_node (gimple
*const &stmt
, const int &,
4819 hash_set
<gimple
*> *visited
)
4821 if (!visited
->contains (stmt
))
4823 error ("dead STMT in EH table");
4824 debug_gimple_stmt (stmt
);
4825 eh_error_found
= true;
4830 /* Verify if the location LOCs block is in BLOCKS. */
4833 verify_location (hash_set
<tree
> *blocks
, location_t loc
)
4835 tree block
= LOCATION_BLOCK (loc
);
4836 if (block
!= NULL_TREE
4837 && !blocks
->contains (block
))
4839 error ("location references block not in block tree");
4842 if (block
!= NULL_TREE
)
4843 return verify_location (blocks
, BLOCK_SOURCE_LOCATION (block
));
4847 /* Called via walk_tree. Verify that expressions have no blocks. */
4850 verify_expr_no_block (tree
*tp
, int *walk_subtrees
, void *)
4854 *walk_subtrees
= false;
4858 location_t loc
= EXPR_LOCATION (*tp
);
4859 if (LOCATION_BLOCK (loc
) != NULL
)
4865 /* Called via walk_tree. Verify locations of expressions. */
4868 verify_expr_location_1 (tree
*tp
, int *walk_subtrees
, void *data
)
4870 hash_set
<tree
> *blocks
= (hash_set
<tree
> *) data
;
4872 if (TREE_CODE (*tp
) == VAR_DECL
4873 && DECL_HAS_DEBUG_EXPR_P (*tp
))
4875 tree t
= DECL_DEBUG_EXPR (*tp
);
4876 tree addr
= walk_tree (&t
, verify_expr_no_block
, NULL
, NULL
);
4880 if ((TREE_CODE (*tp
) == VAR_DECL
4881 || TREE_CODE (*tp
) == PARM_DECL
4882 || TREE_CODE (*tp
) == RESULT_DECL
)
4883 && DECL_HAS_VALUE_EXPR_P (*tp
))
4885 tree t
= DECL_VALUE_EXPR (*tp
);
4886 tree addr
= walk_tree (&t
, verify_expr_no_block
, NULL
, NULL
);
4893 *walk_subtrees
= false;
4897 location_t loc
= EXPR_LOCATION (*tp
);
4898 if (verify_location (blocks
, loc
))
4904 /* Called via walk_gimple_op. Verify locations of expressions. */
4907 verify_expr_location (tree
*tp
, int *walk_subtrees
, void *data
)
4909 struct walk_stmt_info
*wi
= (struct walk_stmt_info
*) data
;
4910 return verify_expr_location_1 (tp
, walk_subtrees
, wi
->info
);
4913 /* Insert all subblocks of BLOCK into BLOCKS and recurse. */
4916 collect_subblocks (hash_set
<tree
> *blocks
, tree block
)
4919 for (t
= BLOCK_SUBBLOCKS (block
); t
; t
= BLOCK_CHAIN (t
))
4922 collect_subblocks (blocks
, t
);
4926 /* Verify the GIMPLE statements in the CFG of FN. */
4929 verify_gimple_in_cfg (struct function
*fn
, bool verify_nothrow
)
4934 timevar_push (TV_TREE_STMT_VERIFY
);
4935 hash_set
<void *> visited
;
4936 hash_set
<gimple
*> visited_stmts
;
4938 /* Collect all BLOCKs referenced by the BLOCK tree of FN. */
4939 hash_set
<tree
> blocks
;
4940 if (DECL_INITIAL (fn
->decl
))
4942 blocks
.add (DECL_INITIAL (fn
->decl
));
4943 collect_subblocks (&blocks
, DECL_INITIAL (fn
->decl
));
4946 FOR_EACH_BB_FN (bb
, fn
)
4948 gimple_stmt_iterator gsi
;
4950 for (gphi_iterator gpi
= gsi_start_phis (bb
);
4954 gphi
*phi
= gpi
.phi ();
4958 visited_stmts
.add (phi
);
4960 if (gimple_bb (phi
) != bb
)
4962 error ("gimple_bb (phi) is set to a wrong basic block");
4966 err2
|= verify_gimple_phi (phi
);
4968 /* Only PHI arguments have locations. */
4969 if (gimple_location (phi
) != UNKNOWN_LOCATION
)
4971 error ("PHI node with location");
4975 for (i
= 0; i
< gimple_phi_num_args (phi
); i
++)
4977 tree arg
= gimple_phi_arg_def (phi
, i
);
4978 tree addr
= walk_tree (&arg
, verify_node_sharing_1
,
4982 error ("incorrect sharing of tree nodes");
4983 debug_generic_expr (addr
);
4986 location_t loc
= gimple_phi_arg_location (phi
, i
);
4987 if (virtual_operand_p (gimple_phi_result (phi
))
4988 && loc
!= UNKNOWN_LOCATION
)
4990 error ("virtual PHI with argument locations");
4993 addr
= walk_tree (&arg
, verify_expr_location_1
, &blocks
, NULL
);
4996 debug_generic_expr (addr
);
4999 err2
|= verify_location (&blocks
, loc
);
5003 debug_gimple_stmt (phi
);
5007 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
5009 gimple
*stmt
= gsi_stmt (gsi
);
5011 struct walk_stmt_info wi
;
5015 visited_stmts
.add (stmt
);
5017 if (gimple_bb (stmt
) != bb
)
5019 error ("gimple_bb (stmt) is set to a wrong basic block");
5023 err2
|= verify_gimple_stmt (stmt
);
5024 err2
|= verify_location (&blocks
, gimple_location (stmt
));
5026 memset (&wi
, 0, sizeof (wi
));
5027 wi
.info
= (void *) &visited
;
5028 addr
= walk_gimple_op (stmt
, verify_node_sharing
, &wi
);
5031 error ("incorrect sharing of tree nodes");
5032 debug_generic_expr (addr
);
5036 memset (&wi
, 0, sizeof (wi
));
5037 wi
.info
= (void *) &blocks
;
5038 addr
= walk_gimple_op (stmt
, verify_expr_location
, &wi
);
5041 debug_generic_expr (addr
);
5045 /* ??? Instead of not checking these stmts at all the walker
5046 should know its context via wi. */
5047 if (!is_gimple_debug (stmt
)
5048 && !is_gimple_omp (stmt
))
5050 memset (&wi
, 0, sizeof (wi
));
5051 addr
= walk_gimple_op (stmt
, verify_expr
, &wi
);
5054 debug_generic_expr (addr
);
5055 inform (gimple_location (stmt
), "in statement");
5060 /* If the statement is marked as part of an EH region, then it is
5061 expected that the statement could throw. Verify that when we
5062 have optimizations that simplify statements such that we prove
5063 that they cannot throw, that we update other data structures
5065 lp_nr
= lookup_stmt_eh_lp (stmt
);
5068 if (!stmt_could_throw_p (stmt
))
5072 error ("statement marked for throw, but doesn%'t");
5076 else if (!gsi_one_before_end_p (gsi
))
5078 error ("statement marked for throw in middle of block");
5084 debug_gimple_stmt (stmt
);
5089 eh_error_found
= false;
5090 hash_map
<gimple
*, int> *eh_table
= get_eh_throw_stmt_table (cfun
);
5092 eh_table
->traverse
<hash_set
<gimple
*> *, verify_eh_throw_stmt_node
>
5095 if (err
|| eh_error_found
)
5096 internal_error ("verify_gimple failed");
5098 verify_histograms ();
5099 timevar_pop (TV_TREE_STMT_VERIFY
);
5103 /* Verifies that the flow information is OK. */
5106 gimple_verify_flow_info (void)
5110 gimple_stmt_iterator gsi
;
5115 if (ENTRY_BLOCK_PTR_FOR_FN (cfun
)->il
.gimple
.seq
5116 || ENTRY_BLOCK_PTR_FOR_FN (cfun
)->il
.gimple
.phi_nodes
)
5118 error ("ENTRY_BLOCK has IL associated with it");
5122 if (EXIT_BLOCK_PTR_FOR_FN (cfun
)->il
.gimple
.seq
5123 || EXIT_BLOCK_PTR_FOR_FN (cfun
)->il
.gimple
.phi_nodes
)
5125 error ("EXIT_BLOCK has IL associated with it");
5129 FOR_EACH_EDGE (e
, ei
, EXIT_BLOCK_PTR_FOR_FN (cfun
)->preds
)
5130 if (e
->flags
& EDGE_FALLTHRU
)
5132 error ("fallthru to exit from bb %d", e
->src
->index
);
5136 FOR_EACH_BB_FN (bb
, cfun
)
5138 bool found_ctrl_stmt
= false;
5142 /* Skip labels on the start of basic block. */
5143 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
5146 gimple
*prev_stmt
= stmt
;
5148 stmt
= gsi_stmt (gsi
);
5150 if (gimple_code (stmt
) != GIMPLE_LABEL
)
5153 label
= gimple_label_label (as_a
<glabel
*> (stmt
));
5154 if (prev_stmt
&& DECL_NONLOCAL (label
))
5156 error ("nonlocal label ");
5157 print_generic_expr (stderr
, label
, 0);
5158 fprintf (stderr
, " is not first in a sequence of labels in bb %d",
5163 if (prev_stmt
&& EH_LANDING_PAD_NR (label
) != 0)
5165 error ("EH landing pad label ");
5166 print_generic_expr (stderr
, label
, 0);
5167 fprintf (stderr
, " is not first in a sequence of labels in bb %d",
5172 if (label_to_block (label
) != bb
)
5175 print_generic_expr (stderr
, label
, 0);
5176 fprintf (stderr
, " to block does not match in bb %d",
5181 if (decl_function_context (label
) != current_function_decl
)
5184 print_generic_expr (stderr
, label
, 0);
5185 fprintf (stderr
, " has incorrect context in bb %d",
5191 /* Verify that body of basic block BB is free of control flow. */
5192 for (; !gsi_end_p (gsi
); gsi_next (&gsi
))
5194 gimple
*stmt
= gsi_stmt (gsi
);
5196 if (found_ctrl_stmt
)
5198 error ("control flow in the middle of basic block %d",
5203 if (stmt_ends_bb_p (stmt
))
5204 found_ctrl_stmt
= true;
5206 if (glabel
*label_stmt
= dyn_cast
<glabel
*> (stmt
))
5209 print_generic_expr (stderr
, gimple_label_label (label_stmt
), 0);
5210 fprintf (stderr
, " in the middle of basic block %d", bb
->index
);
5215 gsi
= gsi_last_bb (bb
);
5216 if (gsi_end_p (gsi
))
5219 stmt
= gsi_stmt (gsi
);
5221 if (gimple_code (stmt
) == GIMPLE_LABEL
)
5224 err
|= verify_eh_edges (stmt
);
5226 if (is_ctrl_stmt (stmt
))
5228 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
5229 if (e
->flags
& EDGE_FALLTHRU
)
5231 error ("fallthru edge after a control statement in bb %d",
5237 if (gimple_code (stmt
) != GIMPLE_COND
)
5239 /* Verify that there are no edges with EDGE_TRUE/FALSE_FLAG set
5240 after anything else but if statement. */
5241 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
5242 if (e
->flags
& (EDGE_TRUE_VALUE
| EDGE_FALSE_VALUE
))
5244 error ("true/false edge after a non-GIMPLE_COND in bb %d",
5250 switch (gimple_code (stmt
))
5257 extract_true_false_edges_from_block (bb
, &true_edge
, &false_edge
);
5261 || !(true_edge
->flags
& EDGE_TRUE_VALUE
)
5262 || !(false_edge
->flags
& EDGE_FALSE_VALUE
)
5263 || (true_edge
->flags
& (EDGE_FALLTHRU
| EDGE_ABNORMAL
))
5264 || (false_edge
->flags
& (EDGE_FALLTHRU
| EDGE_ABNORMAL
))
5265 || EDGE_COUNT (bb
->succs
) >= 3)
5267 error ("wrong outgoing edge flags at end of bb %d",
5275 if (simple_goto_p (stmt
))
5277 error ("explicit goto at end of bb %d", bb
->index
);
5282 /* FIXME. We should double check that the labels in the
5283 destination blocks have their address taken. */
5284 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
5285 if ((e
->flags
& (EDGE_FALLTHRU
| EDGE_TRUE_VALUE
5286 | EDGE_FALSE_VALUE
))
5287 || !(e
->flags
& EDGE_ABNORMAL
))
5289 error ("wrong outgoing edge flags at end of bb %d",
5297 if (!gimple_call_builtin_p (stmt
, BUILT_IN_RETURN
))
5299 /* ... fallthru ... */
5301 if (!single_succ_p (bb
)
5302 || (single_succ_edge (bb
)->flags
5303 & (EDGE_FALLTHRU
| EDGE_ABNORMAL
5304 | EDGE_TRUE_VALUE
| EDGE_FALSE_VALUE
)))
5306 error ("wrong outgoing edge flags at end of bb %d", bb
->index
);
5309 if (single_succ (bb
) != EXIT_BLOCK_PTR_FOR_FN (cfun
))
5311 error ("return edge does not point to exit in bb %d",
5319 gswitch
*switch_stmt
= as_a
<gswitch
*> (stmt
);
5324 n
= gimple_switch_num_labels (switch_stmt
);
5326 /* Mark all the destination basic blocks. */
5327 for (i
= 0; i
< n
; ++i
)
5329 tree lab
= CASE_LABEL (gimple_switch_label (switch_stmt
, i
));
5330 basic_block label_bb
= label_to_block (lab
);
5331 gcc_assert (!label_bb
->aux
|| label_bb
->aux
== (void *)1);
5332 label_bb
->aux
= (void *)1;
5335 /* Verify that the case labels are sorted. */
5336 prev
= gimple_switch_label (switch_stmt
, 0);
5337 for (i
= 1; i
< n
; ++i
)
5339 tree c
= gimple_switch_label (switch_stmt
, i
);
5342 error ("found default case not at the start of "
5348 && !tree_int_cst_lt (CASE_LOW (prev
), CASE_LOW (c
)))
5350 error ("case labels not sorted: ");
5351 print_generic_expr (stderr
, prev
, 0);
5352 fprintf (stderr
," is greater than ");
5353 print_generic_expr (stderr
, c
, 0);
5354 fprintf (stderr
," but comes before it.\n");
5359 /* VRP will remove the default case if it can prove it will
5360 never be executed. So do not verify there always exists
5361 a default case here. */
5363 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
5367 error ("extra outgoing edge %d->%d",
5368 bb
->index
, e
->dest
->index
);
5372 e
->dest
->aux
= (void *)2;
5373 if ((e
->flags
& (EDGE_FALLTHRU
| EDGE_ABNORMAL
5374 | EDGE_TRUE_VALUE
| EDGE_FALSE_VALUE
)))
5376 error ("wrong outgoing edge flags at end of bb %d",
5382 /* Check that we have all of them. */
5383 for (i
= 0; i
< n
; ++i
)
5385 tree lab
= CASE_LABEL (gimple_switch_label (switch_stmt
, i
));
5386 basic_block label_bb
= label_to_block (lab
);
5388 if (label_bb
->aux
!= (void *)2)
5390 error ("missing edge %i->%i", bb
->index
, label_bb
->index
);
5395 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
5396 e
->dest
->aux
= (void *)0;
5400 case GIMPLE_EH_DISPATCH
:
5401 err
|= verify_eh_dispatch_edge (as_a
<geh_dispatch
*> (stmt
));
5409 if (dom_info_state (CDI_DOMINATORS
) >= DOM_NO_FAST_QUERY
)
5410 verify_dominators (CDI_DOMINATORS
);
5416 /* Updates phi nodes after creating a forwarder block joined
5417 by edge FALLTHRU. */
5420 gimple_make_forwarder_block (edge fallthru
)
5424 basic_block dummy
, bb
;
5428 dummy
= fallthru
->src
;
5429 bb
= fallthru
->dest
;
5431 if (single_pred_p (bb
))
5434 /* If we redirected a branch we must create new PHI nodes at the
5436 for (gsi
= gsi_start_phis (dummy
); !gsi_end_p (gsi
); gsi_next (&gsi
))
5438 gphi
*phi
, *new_phi
;
5441 var
= gimple_phi_result (phi
);
5442 new_phi
= create_phi_node (var
, bb
);
5443 gimple_phi_set_result (phi
, copy_ssa_name (var
, phi
));
5444 add_phi_arg (new_phi
, gimple_phi_result (phi
), fallthru
,
5448 /* Add the arguments we have stored on edges. */
5449 FOR_EACH_EDGE (e
, ei
, bb
->preds
)
5454 flush_pending_stmts (e
);
5459 /* Return a non-special label in the head of basic block BLOCK.
5460 Create one if it doesn't exist. */
5463 gimple_block_label (basic_block bb
)
5465 gimple_stmt_iterator i
, s
= gsi_start_bb (bb
);
5470 for (i
= s
; !gsi_end_p (i
); first
= false, gsi_next (&i
))
5472 stmt
= dyn_cast
<glabel
*> (gsi_stmt (i
));
5475 label
= gimple_label_label (stmt
);
5476 if (!DECL_NONLOCAL (label
))
5479 gsi_move_before (&i
, &s
);
5484 label
= create_artificial_label (UNKNOWN_LOCATION
);
5485 stmt
= gimple_build_label (label
);
5486 gsi_insert_before (&s
, stmt
, GSI_NEW_STMT
);
5491 /* Attempt to perform edge redirection by replacing a possibly complex
5492 jump instruction by a goto or by removing the jump completely.
5493 This can apply only if all edges now point to the same block. The
5494 parameters and return values are equivalent to
5495 redirect_edge_and_branch. */
5498 gimple_try_redirect_by_replacing_jump (edge e
, basic_block target
)
5500 basic_block src
= e
->src
;
5501 gimple_stmt_iterator i
;
5504 /* We can replace or remove a complex jump only when we have exactly
5506 if (EDGE_COUNT (src
->succs
) != 2
5507 /* Verify that all targets will be TARGET. Specifically, the
5508 edge that is not E must also go to TARGET. */
5509 || EDGE_SUCC (src
, EDGE_SUCC (src
, 0) == e
)->dest
!= target
)
5512 i
= gsi_last_bb (src
);
5516 stmt
= gsi_stmt (i
);
5518 if (gimple_code (stmt
) == GIMPLE_COND
|| gimple_code (stmt
) == GIMPLE_SWITCH
)
5520 gsi_remove (&i
, true);
5521 e
= ssa_redirect_edge (e
, target
);
5522 e
->flags
= EDGE_FALLTHRU
;
5530 /* Redirect E to DEST. Return NULL on failure. Otherwise, return the
5531 edge representing the redirected branch. */
5534 gimple_redirect_edge_and_branch (edge e
, basic_block dest
)
5536 basic_block bb
= e
->src
;
5537 gimple_stmt_iterator gsi
;
5541 if (e
->flags
& EDGE_ABNORMAL
)
5544 if (e
->dest
== dest
)
5547 if (e
->flags
& EDGE_EH
)
5548 return redirect_eh_edge (e
, dest
);
5550 if (e
->src
!= ENTRY_BLOCK_PTR_FOR_FN (cfun
))
5552 ret
= gimple_try_redirect_by_replacing_jump (e
, dest
);
5557 gsi
= gsi_last_bb (bb
);
5558 stmt
= gsi_end_p (gsi
) ? NULL
: gsi_stmt (gsi
);
5560 switch (stmt
? gimple_code (stmt
) : GIMPLE_ERROR_MARK
)
5563 /* For COND_EXPR, we only need to redirect the edge. */
5567 /* No non-abnormal edges should lead from a non-simple goto, and
5568 simple ones should be represented implicitly. */
5573 gswitch
*switch_stmt
= as_a
<gswitch
*> (stmt
);
5574 tree label
= gimple_block_label (dest
);
5575 tree cases
= get_cases_for_edge (e
, switch_stmt
);
5577 /* If we have a list of cases associated with E, then use it
5578 as it's a lot faster than walking the entire case vector. */
5581 edge e2
= find_edge (e
->src
, dest
);
5588 CASE_LABEL (cases
) = label
;
5589 cases
= CASE_CHAIN (cases
);
5592 /* If there was already an edge in the CFG, then we need
5593 to move all the cases associated with E to E2. */
5596 tree cases2
= get_cases_for_edge (e2
, switch_stmt
);
5598 CASE_CHAIN (last
) = CASE_CHAIN (cases2
);
5599 CASE_CHAIN (cases2
) = first
;
5601 bitmap_set_bit (touched_switch_bbs
, gimple_bb (stmt
)->index
);
5605 size_t i
, n
= gimple_switch_num_labels (switch_stmt
);
5607 for (i
= 0; i
< n
; i
++)
5609 tree elt
= gimple_switch_label (switch_stmt
, i
);
5610 if (label_to_block (CASE_LABEL (elt
)) == e
->dest
)
5611 CASE_LABEL (elt
) = label
;
5619 gasm
*asm_stmt
= as_a
<gasm
*> (stmt
);
5620 int i
, n
= gimple_asm_nlabels (asm_stmt
);
5623 for (i
= 0; i
< n
; ++i
)
5625 tree cons
= gimple_asm_label_op (asm_stmt
, i
);
5626 if (label_to_block (TREE_VALUE (cons
)) == e
->dest
)
5629 label
= gimple_block_label (dest
);
5630 TREE_VALUE (cons
) = label
;
5634 /* If we didn't find any label matching the former edge in the
5635 asm labels, we must be redirecting the fallthrough
5637 gcc_assert (label
|| (e
->flags
& EDGE_FALLTHRU
));
5642 gsi_remove (&gsi
, true);
5643 e
->flags
|= EDGE_FALLTHRU
;
5646 case GIMPLE_OMP_RETURN
:
5647 case GIMPLE_OMP_CONTINUE
:
5648 case GIMPLE_OMP_SECTIONS_SWITCH
:
5649 case GIMPLE_OMP_FOR
:
5650 /* The edges from OMP constructs can be simply redirected. */
5653 case GIMPLE_EH_DISPATCH
:
5654 if (!(e
->flags
& EDGE_FALLTHRU
))
5655 redirect_eh_dispatch_edge (as_a
<geh_dispatch
*> (stmt
), e
, dest
);
5658 case GIMPLE_TRANSACTION
:
5659 /* The ABORT edge has a stored label associated with it, otherwise
5660 the edges are simply redirectable. */
5662 gimple_transaction_set_label (as_a
<gtransaction
*> (stmt
),
5663 gimple_block_label (dest
));
5667 /* Otherwise it must be a fallthru edge, and we don't need to
5668 do anything besides redirecting it. */
5669 gcc_assert (e
->flags
& EDGE_FALLTHRU
);
5673 /* Update/insert PHI nodes as necessary. */
5675 /* Now update the edges in the CFG. */
5676 e
= ssa_redirect_edge (e
, dest
);
5681 /* Returns true if it is possible to remove edge E by redirecting
5682 it to the destination of the other edge from E->src. */
5685 gimple_can_remove_branch_p (const_edge e
)
5687 if (e
->flags
& (EDGE_ABNORMAL
| EDGE_EH
))
5693 /* Simple wrapper, as we can always redirect fallthru edges. */
5696 gimple_redirect_edge_and_branch_force (edge e
, basic_block dest
)
5698 e
= gimple_redirect_edge_and_branch (e
, dest
);
5705 /* Splits basic block BB after statement STMT (but at least after the
5706 labels). If STMT is NULL, BB is split just after the labels. */
5709 gimple_split_block (basic_block bb
, void *stmt
)
5711 gimple_stmt_iterator gsi
;
5712 gimple_stmt_iterator gsi_tgt
;
5718 new_bb
= create_empty_bb (bb
);
5720 /* Redirect the outgoing edges. */
5721 new_bb
->succs
= bb
->succs
;
5723 FOR_EACH_EDGE (e
, ei
, new_bb
->succs
)
5726 /* Get a stmt iterator pointing to the first stmt to move. */
5727 if (!stmt
|| gimple_code ((gimple
*) stmt
) == GIMPLE_LABEL
)
5728 gsi
= gsi_after_labels (bb
);
5731 gsi
= gsi_for_stmt ((gimple
*) stmt
);
5735 /* Move everything from GSI to the new basic block. */
5736 if (gsi_end_p (gsi
))
5739 /* Split the statement list - avoid re-creating new containers as this
5740 brings ugly quadratic memory consumption in the inliner.
5741 (We are still quadratic since we need to update stmt BB pointers,
5743 gsi_split_seq_before (&gsi
, &list
);
5744 set_bb_seq (new_bb
, list
);
5745 for (gsi_tgt
= gsi_start (list
);
5746 !gsi_end_p (gsi_tgt
); gsi_next (&gsi_tgt
))
5747 gimple_set_bb (gsi_stmt (gsi_tgt
), new_bb
);
5753 /* Moves basic block BB after block AFTER. */
5756 gimple_move_block_after (basic_block bb
, basic_block after
)
5758 if (bb
->prev_bb
== after
)
5762 link_block (bb
, after
);
5768 /* Return TRUE if block BB has no executable statements, otherwise return
5772 gimple_empty_block_p (basic_block bb
)
5774 /* BB must have no executable statements. */
5775 gimple_stmt_iterator gsi
= gsi_after_labels (bb
);
5778 if (gsi_end_p (gsi
))
5780 if (is_gimple_debug (gsi_stmt (gsi
)))
5781 gsi_next_nondebug (&gsi
);
5782 return gsi_end_p (gsi
);
5786 /* Split a basic block if it ends with a conditional branch and if the
5787 other part of the block is not empty. */
5790 gimple_split_block_before_cond_jump (basic_block bb
)
5792 gimple
*last
, *split_point
;
5793 gimple_stmt_iterator gsi
= gsi_last_nondebug_bb (bb
);
5794 if (gsi_end_p (gsi
))
5796 last
= gsi_stmt (gsi
);
5797 if (gimple_code (last
) != GIMPLE_COND
5798 && gimple_code (last
) != GIMPLE_SWITCH
)
5800 gsi_prev_nondebug (&gsi
);
5801 split_point
= gsi_stmt (gsi
);
5802 return split_block (bb
, split_point
)->dest
;
5806 /* Return true if basic_block can be duplicated. */
5809 gimple_can_duplicate_bb_p (const_basic_block bb ATTRIBUTE_UNUSED
)
5814 /* Create a duplicate of the basic block BB. NOTE: This does not
5815 preserve SSA form. */
5818 gimple_duplicate_bb (basic_block bb
)
5821 gimple_stmt_iterator gsi_tgt
;
5823 new_bb
= create_empty_bb (EXIT_BLOCK_PTR_FOR_FN (cfun
)->prev_bb
);
5825 /* Copy the PHI nodes. We ignore PHI node arguments here because
5826 the incoming edges have not been setup yet. */
5827 for (gphi_iterator gpi
= gsi_start_phis (bb
);
5833 copy
= create_phi_node (NULL_TREE
, new_bb
);
5834 create_new_def_for (gimple_phi_result (phi
), copy
,
5835 gimple_phi_result_ptr (copy
));
5836 gimple_set_uid (copy
, gimple_uid (phi
));
5839 gsi_tgt
= gsi_start_bb (new_bb
);
5840 for (gimple_stmt_iterator gsi
= gsi_start_bb (bb
);
5844 def_operand_p def_p
;
5845 ssa_op_iter op_iter
;
5847 gimple
*stmt
, *copy
;
5849 stmt
= gsi_stmt (gsi
);
5850 if (gimple_code (stmt
) == GIMPLE_LABEL
)
5853 /* Don't duplicate label debug stmts. */
5854 if (gimple_debug_bind_p (stmt
)
5855 && TREE_CODE (gimple_debug_bind_get_var (stmt
))
5859 /* Create a new copy of STMT and duplicate STMT's virtual
5861 copy
= gimple_copy (stmt
);
5862 gsi_insert_after (&gsi_tgt
, copy
, GSI_NEW_STMT
);
5864 maybe_duplicate_eh_stmt (copy
, stmt
);
5865 gimple_duplicate_stmt_histograms (cfun
, copy
, cfun
, stmt
);
5867 /* When copying around a stmt writing into a local non-user
5868 aggregate, make sure it won't share stack slot with other
5870 lhs
= gimple_get_lhs (stmt
);
5871 if (lhs
&& TREE_CODE (lhs
) != SSA_NAME
)
5873 tree base
= get_base_address (lhs
);
5875 && (TREE_CODE (base
) == VAR_DECL
5876 || TREE_CODE (base
) == RESULT_DECL
)
5877 && DECL_IGNORED_P (base
)
5878 && !TREE_STATIC (base
)
5879 && !DECL_EXTERNAL (base
)
5880 && (TREE_CODE (base
) != VAR_DECL
5881 || !DECL_HAS_VALUE_EXPR_P (base
)))
5882 DECL_NONSHAREABLE (base
) = 1;
5885 /* Create new names for all the definitions created by COPY and
5886 add replacement mappings for each new name. */
5887 FOR_EACH_SSA_DEF_OPERAND (def_p
, copy
, op_iter
, SSA_OP_ALL_DEFS
)
5888 create_new_def_for (DEF_FROM_PTR (def_p
), copy
, def_p
);
5894 /* Adds phi node arguments for edge E_COPY after basic block duplication. */
5897 add_phi_args_after_copy_edge (edge e_copy
)
5899 basic_block bb
, bb_copy
= e_copy
->src
, dest
;
5902 gphi
*phi
, *phi_copy
;
5904 gphi_iterator psi
, psi_copy
;
5906 if (gimple_seq_empty_p (phi_nodes (e_copy
->dest
)))
5909 bb
= bb_copy
->flags
& BB_DUPLICATED
? get_bb_original (bb_copy
) : bb_copy
;
5911 if (e_copy
->dest
->flags
& BB_DUPLICATED
)
5912 dest
= get_bb_original (e_copy
->dest
);
5914 dest
= e_copy
->dest
;
5916 e
= find_edge (bb
, dest
);
5919 /* During loop unrolling the target of the latch edge is copied.
5920 In this case we are not looking for edge to dest, but to
5921 duplicated block whose original was dest. */
5922 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
5924 if ((e
->dest
->flags
& BB_DUPLICATED
)
5925 && get_bb_original (e
->dest
) == dest
)
5929 gcc_assert (e
!= NULL
);
5932 for (psi
= gsi_start_phis (e
->dest
),
5933 psi_copy
= gsi_start_phis (e_copy
->dest
);
5935 gsi_next (&psi
), gsi_next (&psi_copy
))
5938 phi_copy
= psi_copy
.phi ();
5939 def
= PHI_ARG_DEF_FROM_EDGE (phi
, e
);
5940 add_phi_arg (phi_copy
, def
, e_copy
,
5941 gimple_phi_arg_location_from_edge (phi
, e
));
5946 /* Basic block BB_COPY was created by code duplication. Add phi node
5947 arguments for edges going out of BB_COPY. The blocks that were
5948 duplicated have BB_DUPLICATED set. */
5951 add_phi_args_after_copy_bb (basic_block bb_copy
)
5956 FOR_EACH_EDGE (e_copy
, ei
, bb_copy
->succs
)
5958 add_phi_args_after_copy_edge (e_copy
);
5962 /* Blocks in REGION_COPY array of length N_REGION were created by
5963 duplication of basic blocks. Add phi node arguments for edges
5964 going from these blocks. If E_COPY is not NULL, also add
5965 phi node arguments for its destination.*/
5968 add_phi_args_after_copy (basic_block
*region_copy
, unsigned n_region
,
5973 for (i
= 0; i
< n_region
; i
++)
5974 region_copy
[i
]->flags
|= BB_DUPLICATED
;
5976 for (i
= 0; i
< n_region
; i
++)
5977 add_phi_args_after_copy_bb (region_copy
[i
]);
5979 add_phi_args_after_copy_edge (e_copy
);
5981 for (i
= 0; i
< n_region
; i
++)
5982 region_copy
[i
]->flags
&= ~BB_DUPLICATED
;
5985 /* Duplicates a REGION (set of N_REGION basic blocks) with just a single
5986 important exit edge EXIT. By important we mean that no SSA name defined
5987 inside region is live over the other exit edges of the region. All entry
5988 edges to the region must go to ENTRY->dest. The edge ENTRY is redirected
5989 to the duplicate of the region. Dominance and loop information is
5990 updated if UPDATE_DOMINANCE is true, but not the SSA web. If
5991 UPDATE_DOMINANCE is false then we assume that the caller will update the
5992 dominance information after calling this function. The new basic
5993 blocks are stored to REGION_COPY in the same order as they had in REGION,
5994 provided that REGION_COPY is not NULL.
5995 The function returns false if it is unable to copy the region,
5999 gimple_duplicate_sese_region (edge entry
, edge exit
,
6000 basic_block
*region
, unsigned n_region
,
6001 basic_block
*region_copy
,
6002 bool update_dominance
)
6005 bool free_region_copy
= false, copying_header
= false;
6006 struct loop
*loop
= entry
->dest
->loop_father
;
6008 vec
<basic_block
> doms
;
6010 int total_freq
= 0, entry_freq
= 0;
6011 gcov_type total_count
= 0, entry_count
= 0;
6013 if (!can_copy_bbs_p (region
, n_region
))
6016 /* Some sanity checking. Note that we do not check for all possible
6017 missuses of the functions. I.e. if you ask to copy something weird,
6018 it will work, but the state of structures probably will not be
6020 for (i
= 0; i
< n_region
; i
++)
6022 /* We do not handle subloops, i.e. all the blocks must belong to the
6024 if (region
[i
]->loop_father
!= loop
)
6027 if (region
[i
] != entry
->dest
6028 && region
[i
] == loop
->header
)
6032 /* In case the function is used for loop header copying (which is the primary
6033 use), ensure that EXIT and its copy will be new latch and entry edges. */
6034 if (loop
->header
== entry
->dest
)
6036 copying_header
= true;
6038 if (!dominated_by_p (CDI_DOMINATORS
, loop
->latch
, exit
->src
))
6041 for (i
= 0; i
< n_region
; i
++)
6042 if (region
[i
] != exit
->src
6043 && dominated_by_p (CDI_DOMINATORS
, region
[i
], exit
->src
))
6047 initialize_original_copy_tables ();
6050 set_loop_copy (loop
, loop_outer (loop
));
6052 set_loop_copy (loop
, loop
);
6056 region_copy
= XNEWVEC (basic_block
, n_region
);
6057 free_region_copy
= true;
6060 /* Record blocks outside the region that are dominated by something
6062 if (update_dominance
)
6065 doms
= get_dominated_by_region (CDI_DOMINATORS
, region
, n_region
);
6068 if (entry
->dest
->count
)
6070 total_count
= entry
->dest
->count
;
6071 entry_count
= entry
->count
;
6072 /* Fix up corner cases, to avoid division by zero or creation of negative
6074 if (entry_count
> total_count
)
6075 entry_count
= total_count
;
6079 total_freq
= entry
->dest
->frequency
;
6080 entry_freq
= EDGE_FREQUENCY (entry
);
6081 /* Fix up corner cases, to avoid division by zero or creation of negative
6083 if (total_freq
== 0)
6085 else if (entry_freq
> total_freq
)
6086 entry_freq
= total_freq
;
6089 copy_bbs (region
, n_region
, region_copy
, &exit
, 1, &exit_copy
, loop
,
6090 split_edge_bb_loc (entry
), update_dominance
);
6093 scale_bbs_frequencies_gcov_type (region
, n_region
,
6094 total_count
- entry_count
,
6096 scale_bbs_frequencies_gcov_type (region_copy
, n_region
, entry_count
,
6101 scale_bbs_frequencies_int (region
, n_region
, total_freq
- entry_freq
,
6103 scale_bbs_frequencies_int (region_copy
, n_region
, entry_freq
, total_freq
);
6108 loop
->header
= exit
->dest
;
6109 loop
->latch
= exit
->src
;
6112 /* Redirect the entry and add the phi node arguments. */
6113 redirected
= redirect_edge_and_branch (entry
, get_bb_copy (entry
->dest
));
6114 gcc_assert (redirected
!= NULL
);
6115 flush_pending_stmts (entry
);
6117 /* Concerning updating of dominators: We must recount dominators
6118 for entry block and its copy. Anything that is outside of the
6119 region, but was dominated by something inside needs recounting as
6121 if (update_dominance
)
6123 set_immediate_dominator (CDI_DOMINATORS
, entry
->dest
, entry
->src
);
6124 doms
.safe_push (get_bb_original (entry
->dest
));
6125 iterate_fix_dominators (CDI_DOMINATORS
, doms
, false);
6129 /* Add the other PHI node arguments. */
6130 add_phi_args_after_copy (region_copy
, n_region
, NULL
);
6132 if (free_region_copy
)
6135 free_original_copy_tables ();
6139 /* Checks if BB is part of the region defined by N_REGION BBS. */
6141 bb_part_of_region_p (basic_block bb
, basic_block
* bbs
, unsigned n_region
)
6145 for (n
= 0; n
< n_region
; n
++)
6153 /* Duplicates REGION consisting of N_REGION blocks. The new blocks
6154 are stored to REGION_COPY in the same order in that they appear
6155 in REGION, if REGION_COPY is not NULL. ENTRY is the entry to
6156 the region, EXIT an exit from it. The condition guarding EXIT
6157 is moved to ENTRY. Returns true if duplication succeeds, false
6183 gimple_duplicate_sese_tail (edge entry ATTRIBUTE_UNUSED
, edge exit ATTRIBUTE_UNUSED
,
6184 basic_block
*region ATTRIBUTE_UNUSED
, unsigned n_region ATTRIBUTE_UNUSED
,
6185 basic_block
*region_copy ATTRIBUTE_UNUSED
)
6188 bool free_region_copy
= false;
6189 struct loop
*loop
= exit
->dest
->loop_father
;
6190 struct loop
*orig_loop
= entry
->dest
->loop_father
;
6191 basic_block switch_bb
, entry_bb
, nentry_bb
;
6192 vec
<basic_block
> doms
;
6193 int total_freq
= 0, exit_freq
= 0;
6194 gcov_type total_count
= 0, exit_count
= 0;
6195 edge exits
[2], nexits
[2], e
;
6196 gimple_stmt_iterator gsi
;
6199 basic_block exit_bb
;
6203 struct loop
*target
, *aloop
, *cloop
;
6205 gcc_assert (EDGE_COUNT (exit
->src
->succs
) == 2);
6207 exits
[1] = EDGE_SUCC (exit
->src
, EDGE_SUCC (exit
->src
, 0) == exit
);
6209 if (!can_copy_bbs_p (region
, n_region
))
6212 initialize_original_copy_tables ();
6213 set_loop_copy (orig_loop
, loop
);
6216 for (aloop
= orig_loop
->inner
; aloop
; aloop
= aloop
->next
)
6218 if (bb_part_of_region_p (aloop
->header
, region
, n_region
))
6220 cloop
= duplicate_loop (aloop
, target
);
6221 duplicate_subloops (aloop
, cloop
);
6227 region_copy
= XNEWVEC (basic_block
, n_region
);
6228 free_region_copy
= true;
6231 gcc_assert (!need_ssa_update_p (cfun
));
6233 /* Record blocks outside the region that are dominated by something
6235 doms
= get_dominated_by_region (CDI_DOMINATORS
, region
, n_region
);
6237 if (exit
->src
->count
)
6239 total_count
= exit
->src
->count
;
6240 exit_count
= exit
->count
;
6241 /* Fix up corner cases, to avoid division by zero or creation of negative
6243 if (exit_count
> total_count
)
6244 exit_count
= total_count
;
6248 total_freq
= exit
->src
->frequency
;
6249 exit_freq
= EDGE_FREQUENCY (exit
);
6250 /* Fix up corner cases, to avoid division by zero or creation of negative
6252 if (total_freq
== 0)
6254 if (exit_freq
> total_freq
)
6255 exit_freq
= total_freq
;
6258 copy_bbs (region
, n_region
, region_copy
, exits
, 2, nexits
, orig_loop
,
6259 split_edge_bb_loc (exit
), true);
6262 scale_bbs_frequencies_gcov_type (region
, n_region
,
6263 total_count
- exit_count
,
6265 scale_bbs_frequencies_gcov_type (region_copy
, n_region
, exit_count
,
6270 scale_bbs_frequencies_int (region
, n_region
, total_freq
- exit_freq
,
6272 scale_bbs_frequencies_int (region_copy
, n_region
, exit_freq
, total_freq
);
6275 /* Create the switch block, and put the exit condition to it. */
6276 entry_bb
= entry
->dest
;
6277 nentry_bb
= get_bb_copy (entry_bb
);
6278 if (!last_stmt (entry
->src
)
6279 || !stmt_ends_bb_p (last_stmt (entry
->src
)))
6280 switch_bb
= entry
->src
;
6282 switch_bb
= split_edge (entry
);
6283 set_immediate_dominator (CDI_DOMINATORS
, nentry_bb
, switch_bb
);
6285 gsi
= gsi_last_bb (switch_bb
);
6286 cond_stmt
= last_stmt (exit
->src
);
6287 gcc_assert (gimple_code (cond_stmt
) == GIMPLE_COND
);
6288 cond_stmt
= gimple_copy (cond_stmt
);
6290 gsi_insert_after (&gsi
, cond_stmt
, GSI_NEW_STMT
);
6292 sorig
= single_succ_edge (switch_bb
);
6293 sorig
->flags
= exits
[1]->flags
;
6294 snew
= make_edge (switch_bb
, nentry_bb
, exits
[0]->flags
);
6296 /* Register the new edge from SWITCH_BB in loop exit lists. */
6297 rescan_loop_exit (snew
, true, false);
6299 /* Add the PHI node arguments. */
6300 add_phi_args_after_copy (region_copy
, n_region
, snew
);
6302 /* Get rid of now superfluous conditions and associated edges (and phi node
6304 exit_bb
= exit
->dest
;
6306 e
= redirect_edge_and_branch (exits
[0], exits
[1]->dest
);
6307 PENDING_STMT (e
) = NULL
;
6309 /* The latch of ORIG_LOOP was copied, and so was the backedge
6310 to the original header. We redirect this backedge to EXIT_BB. */
6311 for (i
= 0; i
< n_region
; i
++)
6312 if (get_bb_original (region_copy
[i
]) == orig_loop
->latch
)
6314 gcc_assert (single_succ_edge (region_copy
[i
]));
6315 e
= redirect_edge_and_branch (single_succ_edge (region_copy
[i
]), exit_bb
);
6316 PENDING_STMT (e
) = NULL
;
6317 for (psi
= gsi_start_phis (exit_bb
);
6322 def
= PHI_ARG_DEF (phi
, nexits
[0]->dest_idx
);
6323 add_phi_arg (phi
, def
, e
, gimple_phi_arg_location_from_edge (phi
, e
));
6326 e
= redirect_edge_and_branch (nexits
[1], nexits
[0]->dest
);
6327 PENDING_STMT (e
) = NULL
;
6329 /* Anything that is outside of the region, but was dominated by something
6330 inside needs to update dominance info. */
6331 iterate_fix_dominators (CDI_DOMINATORS
, doms
, false);
6333 /* Update the SSA web. */
6334 update_ssa (TODO_update_ssa
);
6336 if (free_region_copy
)
6339 free_original_copy_tables ();
6343 /* Add all the blocks dominated by ENTRY to the array BBS_P. Stop
6344 adding blocks when the dominator traversal reaches EXIT. This
6345 function silently assumes that ENTRY strictly dominates EXIT. */
6348 gather_blocks_in_sese_region (basic_block entry
, basic_block exit
,
6349 vec
<basic_block
> *bbs_p
)
6353 for (son
= first_dom_son (CDI_DOMINATORS
, entry
);
6355 son
= next_dom_son (CDI_DOMINATORS
, son
))
6357 bbs_p
->safe_push (son
);
6359 gather_blocks_in_sese_region (son
, exit
, bbs_p
);
6363 /* Replaces *TP with a duplicate (belonging to function TO_CONTEXT).
6364 The duplicates are recorded in VARS_MAP. */
6367 replace_by_duplicate_decl (tree
*tp
, hash_map
<tree
, tree
> *vars_map
,
6370 tree t
= *tp
, new_t
;
6371 struct function
*f
= DECL_STRUCT_FUNCTION (to_context
);
6373 if (DECL_CONTEXT (t
) == to_context
)
6377 tree
&loc
= vars_map
->get_or_insert (t
, &existed
);
6383 new_t
= copy_var_decl (t
, DECL_NAME (t
), TREE_TYPE (t
));
6384 add_local_decl (f
, new_t
);
6388 gcc_assert (TREE_CODE (t
) == CONST_DECL
);
6389 new_t
= copy_node (t
);
6391 DECL_CONTEXT (new_t
) = to_context
;
6402 /* Creates an ssa name in TO_CONTEXT equivalent to NAME.
6403 VARS_MAP maps old ssa names and var_decls to the new ones. */
6406 replace_ssa_name (tree name
, hash_map
<tree
, tree
> *vars_map
,
6411 gcc_assert (!virtual_operand_p (name
));
6413 tree
*loc
= vars_map
->get (name
);
6417 tree decl
= SSA_NAME_VAR (name
);
6420 gcc_assert (!SSA_NAME_IS_DEFAULT_DEF (name
));
6421 replace_by_duplicate_decl (&decl
, vars_map
, to_context
);
6422 new_name
= make_ssa_name_fn (DECL_STRUCT_FUNCTION (to_context
),
6423 decl
, SSA_NAME_DEF_STMT (name
));
6426 new_name
= copy_ssa_name_fn (DECL_STRUCT_FUNCTION (to_context
),
6427 name
, SSA_NAME_DEF_STMT (name
));
6429 /* Now that we've used the def stmt to define new_name, make sure it
6430 doesn't define name anymore. */
6431 SSA_NAME_DEF_STMT (name
) = NULL
;
6433 vars_map
->put (name
, new_name
);
6447 hash_map
<tree
, tree
> *vars_map
;
6448 htab_t new_label_map
;
6449 hash_map
<void *, void *> *eh_map
;
6453 /* Helper for move_block_to_fn. Set TREE_BLOCK in every expression
6454 contained in *TP if it has been ORIG_BLOCK previously and change the
6455 DECL_CONTEXT of every local variable referenced in *TP. */
6458 move_stmt_op (tree
*tp
, int *walk_subtrees
, void *data
)
6460 struct walk_stmt_info
*wi
= (struct walk_stmt_info
*) data
;
6461 struct move_stmt_d
*p
= (struct move_stmt_d
*) wi
->info
;
6466 tree block
= TREE_BLOCK (t
);
6467 if (block
== p
->orig_block
6468 || (p
->orig_block
== NULL_TREE
6469 && block
!= NULL_TREE
))
6470 TREE_SET_BLOCK (t
, p
->new_block
);
6471 else if (flag_checking
&& block
!= NULL_TREE
)
6473 while (block
&& TREE_CODE (block
) == BLOCK
&& block
!= p
->orig_block
)
6474 block
= BLOCK_SUPERCONTEXT (block
);
6475 gcc_assert (block
== p
->orig_block
);
6478 else if (DECL_P (t
) || TREE_CODE (t
) == SSA_NAME
)
6480 if (TREE_CODE (t
) == SSA_NAME
)
6481 *tp
= replace_ssa_name (t
, p
->vars_map
, p
->to_context
);
6482 else if (TREE_CODE (t
) == PARM_DECL
6483 && gimple_in_ssa_p (cfun
))
6484 *tp
= *(p
->vars_map
->get (t
));
6485 else if (TREE_CODE (t
) == LABEL_DECL
)
6487 if (p
->new_label_map
)
6489 struct tree_map in
, *out
;
6491 out
= (struct tree_map
*)
6492 htab_find_with_hash (p
->new_label_map
, &in
, DECL_UID (t
));
6497 DECL_CONTEXT (t
) = p
->to_context
;
6499 else if (p
->remap_decls_p
)
6501 /* Replace T with its duplicate. T should no longer appear in the
6502 parent function, so this looks wasteful; however, it may appear
6503 in referenced_vars, and more importantly, as virtual operands of
6504 statements, and in alias lists of other variables. It would be
6505 quite difficult to expunge it from all those places. ??? It might
6506 suffice to do this for addressable variables. */
6507 if ((TREE_CODE (t
) == VAR_DECL
6508 && !is_global_var (t
))
6509 || TREE_CODE (t
) == CONST_DECL
)
6510 replace_by_duplicate_decl (tp
, p
->vars_map
, p
->to_context
);
6514 else if (TYPE_P (t
))
6520 /* Helper for move_stmt_r. Given an EH region number for the source
6521 function, map that to the duplicate EH regio number in the dest. */
6524 move_stmt_eh_region_nr (int old_nr
, struct move_stmt_d
*p
)
6526 eh_region old_r
, new_r
;
6528 old_r
= get_eh_region_from_number (old_nr
);
6529 new_r
= static_cast<eh_region
> (*p
->eh_map
->get (old_r
));
6531 return new_r
->index
;
6534 /* Similar, but operate on INTEGER_CSTs. */
6537 move_stmt_eh_region_tree_nr (tree old_t_nr
, struct move_stmt_d
*p
)
6541 old_nr
= tree_to_shwi (old_t_nr
);
6542 new_nr
= move_stmt_eh_region_nr (old_nr
, p
);
6544 return build_int_cst (integer_type_node
, new_nr
);
6547 /* Like move_stmt_op, but for gimple statements.
6549 Helper for move_block_to_fn. Set GIMPLE_BLOCK in every expression
6550 contained in the current statement in *GSI_P and change the
6551 DECL_CONTEXT of every local variable referenced in the current
6555 move_stmt_r (gimple_stmt_iterator
*gsi_p
, bool *handled_ops_p
,
6556 struct walk_stmt_info
*wi
)
6558 struct move_stmt_d
*p
= (struct move_stmt_d
*) wi
->info
;
6559 gimple
*stmt
= gsi_stmt (*gsi_p
);
6560 tree block
= gimple_block (stmt
);
6562 if (block
== p
->orig_block
6563 || (p
->orig_block
== NULL_TREE
6564 && block
!= NULL_TREE
))
6565 gimple_set_block (stmt
, p
->new_block
);
6567 switch (gimple_code (stmt
))
6570 /* Remap the region numbers for __builtin_eh_{pointer,filter}. */
6572 tree r
, fndecl
= gimple_call_fndecl (stmt
);
6573 if (fndecl
&& DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
)
6574 switch (DECL_FUNCTION_CODE (fndecl
))
6576 case BUILT_IN_EH_COPY_VALUES
:
6577 r
= gimple_call_arg (stmt
, 1);
6578 r
= move_stmt_eh_region_tree_nr (r
, p
);
6579 gimple_call_set_arg (stmt
, 1, r
);
6582 case BUILT_IN_EH_POINTER
:
6583 case BUILT_IN_EH_FILTER
:
6584 r
= gimple_call_arg (stmt
, 0);
6585 r
= move_stmt_eh_region_tree_nr (r
, p
);
6586 gimple_call_set_arg (stmt
, 0, r
);
6597 gresx
*resx_stmt
= as_a
<gresx
*> (stmt
);
6598 int r
= gimple_resx_region (resx_stmt
);
6599 r
= move_stmt_eh_region_nr (r
, p
);
6600 gimple_resx_set_region (resx_stmt
, r
);
6604 case GIMPLE_EH_DISPATCH
:
6606 geh_dispatch
*eh_dispatch_stmt
= as_a
<geh_dispatch
*> (stmt
);
6607 int r
= gimple_eh_dispatch_region (eh_dispatch_stmt
);
6608 r
= move_stmt_eh_region_nr (r
, p
);
6609 gimple_eh_dispatch_set_region (eh_dispatch_stmt
, r
);
6613 case GIMPLE_OMP_RETURN
:
6614 case GIMPLE_OMP_CONTINUE
:
6617 if (is_gimple_omp (stmt
))
6619 /* Do not remap variables inside OMP directives. Variables
6620 referenced in clauses and directive header belong to the
6621 parent function and should not be moved into the child
6623 bool save_remap_decls_p
= p
->remap_decls_p
;
6624 p
->remap_decls_p
= false;
6625 *handled_ops_p
= true;
6627 walk_gimple_seq_mod (gimple_omp_body_ptr (stmt
), move_stmt_r
,
6630 p
->remap_decls_p
= save_remap_decls_p
;
6638 /* Move basic block BB from function CFUN to function DEST_FN. The
6639 block is moved out of the original linked list and placed after
6640 block AFTER in the new list. Also, the block is removed from the
6641 original array of blocks and placed in DEST_FN's array of blocks.
6642 If UPDATE_EDGE_COUNT_P is true, the edge counts on both CFGs is
6643 updated to reflect the moved edges.
6645 The local variables are remapped to new instances, VARS_MAP is used
6646 to record the mapping. */
6649 move_block_to_fn (struct function
*dest_cfun
, basic_block bb
,
6650 basic_block after
, bool update_edge_count_p
,
6651 struct move_stmt_d
*d
)
6653 struct control_flow_graph
*cfg
;
6656 gimple_stmt_iterator si
;
6657 unsigned old_len
, new_len
;
6659 /* Remove BB from dominance structures. */
6660 delete_from_dominance_info (CDI_DOMINATORS
, bb
);
6662 /* Move BB from its current loop to the copy in the new function. */
6665 struct loop
*new_loop
= (struct loop
*)bb
->loop_father
->aux
;
6667 bb
->loop_father
= new_loop
;
6670 /* Link BB to the new linked list. */
6671 move_block_after (bb
, after
);
6673 /* Update the edge count in the corresponding flowgraphs. */
6674 if (update_edge_count_p
)
6675 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
6677 cfun
->cfg
->x_n_edges
--;
6678 dest_cfun
->cfg
->x_n_edges
++;
6681 /* Remove BB from the original basic block array. */
6682 (*cfun
->cfg
->x_basic_block_info
)[bb
->index
] = NULL
;
6683 cfun
->cfg
->x_n_basic_blocks
--;
6685 /* Grow DEST_CFUN's basic block array if needed. */
6686 cfg
= dest_cfun
->cfg
;
6687 cfg
->x_n_basic_blocks
++;
6688 if (bb
->index
>= cfg
->x_last_basic_block
)
6689 cfg
->x_last_basic_block
= bb
->index
+ 1;
6691 old_len
= vec_safe_length (cfg
->x_basic_block_info
);
6692 if ((unsigned) cfg
->x_last_basic_block
>= old_len
)
6694 new_len
= cfg
->x_last_basic_block
+ (cfg
->x_last_basic_block
+ 3) / 4;
6695 vec_safe_grow_cleared (cfg
->x_basic_block_info
, new_len
);
6698 (*cfg
->x_basic_block_info
)[bb
->index
] = bb
;
6700 /* Remap the variables in phi nodes. */
6701 for (gphi_iterator psi
= gsi_start_phis (bb
);
6704 gphi
*phi
= psi
.phi ();
6706 tree op
= PHI_RESULT (phi
);
6710 if (virtual_operand_p (op
))
6712 /* Remove the phi nodes for virtual operands (alias analysis will be
6713 run for the new function, anyway). */
6714 remove_phi_node (&psi
, true);
6718 SET_PHI_RESULT (phi
,
6719 replace_ssa_name (op
, d
->vars_map
, dest_cfun
->decl
));
6720 FOR_EACH_PHI_ARG (use
, phi
, oi
, SSA_OP_USE
)
6722 op
= USE_FROM_PTR (use
);
6723 if (TREE_CODE (op
) == SSA_NAME
)
6724 SET_USE (use
, replace_ssa_name (op
, d
->vars_map
, dest_cfun
->decl
));
6727 for (i
= 0; i
< EDGE_COUNT (bb
->preds
); i
++)
6729 location_t locus
= gimple_phi_arg_location (phi
, i
);
6730 tree block
= LOCATION_BLOCK (locus
);
6732 if (locus
== UNKNOWN_LOCATION
)
6734 if (d
->orig_block
== NULL_TREE
|| block
== d
->orig_block
)
6736 if (d
->new_block
== NULL_TREE
)
6737 locus
= LOCATION_LOCUS (locus
);
6739 locus
= COMBINE_LOCATION_DATA (line_table
, locus
, d
->new_block
);
6740 gimple_phi_arg_set_location (phi
, i
, locus
);
6747 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
6749 gimple
*stmt
= gsi_stmt (si
);
6750 struct walk_stmt_info wi
;
6752 memset (&wi
, 0, sizeof (wi
));
6754 walk_gimple_stmt (&si
, move_stmt_r
, move_stmt_op
, &wi
);
6756 if (glabel
*label_stmt
= dyn_cast
<glabel
*> (stmt
))
6758 tree label
= gimple_label_label (label_stmt
);
6759 int uid
= LABEL_DECL_UID (label
);
6761 gcc_assert (uid
> -1);
6763 old_len
= vec_safe_length (cfg
->x_label_to_block_map
);
6764 if (old_len
<= (unsigned) uid
)
6766 new_len
= 3 * uid
/ 2 + 1;
6767 vec_safe_grow_cleared (cfg
->x_label_to_block_map
, new_len
);
6770 (*cfg
->x_label_to_block_map
)[uid
] = bb
;
6771 (*cfun
->cfg
->x_label_to_block_map
)[uid
] = NULL
;
6773 gcc_assert (DECL_CONTEXT (label
) == dest_cfun
->decl
);
6775 if (uid
>= dest_cfun
->cfg
->last_label_uid
)
6776 dest_cfun
->cfg
->last_label_uid
= uid
+ 1;
6779 maybe_duplicate_eh_stmt_fn (dest_cfun
, stmt
, cfun
, stmt
, d
->eh_map
, 0);
6780 remove_stmt_from_eh_lp_fn (cfun
, stmt
);
6782 gimple_duplicate_stmt_histograms (dest_cfun
, stmt
, cfun
, stmt
);
6783 gimple_remove_stmt_histograms (cfun
, stmt
);
6785 /* We cannot leave any operands allocated from the operand caches of
6786 the current function. */
6787 free_stmt_operands (cfun
, stmt
);
6788 push_cfun (dest_cfun
);
6793 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
6794 if (e
->goto_locus
!= UNKNOWN_LOCATION
)
6796 tree block
= LOCATION_BLOCK (e
->goto_locus
);
6797 if (d
->orig_block
== NULL_TREE
6798 || block
== d
->orig_block
)
6799 e
->goto_locus
= d
->new_block
?
6800 COMBINE_LOCATION_DATA (line_table
, e
->goto_locus
, d
->new_block
) :
6801 LOCATION_LOCUS (e
->goto_locus
);
6805 /* Examine the statements in BB (which is in SRC_CFUN); find and return
6806 the outermost EH region. Use REGION as the incoming base EH region. */
6809 find_outermost_region_in_block (struct function
*src_cfun
,
6810 basic_block bb
, eh_region region
)
6812 gimple_stmt_iterator si
;
6814 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
6816 gimple
*stmt
= gsi_stmt (si
);
6817 eh_region stmt_region
;
6820 lp_nr
= lookup_stmt_eh_lp_fn (src_cfun
, stmt
);
6821 stmt_region
= get_eh_region_from_lp_number_fn (src_cfun
, lp_nr
);
6825 region
= stmt_region
;
6826 else if (stmt_region
!= region
)
6828 region
= eh_region_outermost (src_cfun
, stmt_region
, region
);
6829 gcc_assert (region
!= NULL
);
6838 new_label_mapper (tree decl
, void *data
)
6840 htab_t hash
= (htab_t
) data
;
6844 gcc_assert (TREE_CODE (decl
) == LABEL_DECL
);
6846 m
= XNEW (struct tree_map
);
6847 m
->hash
= DECL_UID (decl
);
6848 m
->base
.from
= decl
;
6849 m
->to
= create_artificial_label (UNKNOWN_LOCATION
);
6850 LABEL_DECL_UID (m
->to
) = LABEL_DECL_UID (decl
);
6851 if (LABEL_DECL_UID (m
->to
) >= cfun
->cfg
->last_label_uid
)
6852 cfun
->cfg
->last_label_uid
= LABEL_DECL_UID (m
->to
) + 1;
6854 slot
= htab_find_slot_with_hash (hash
, m
, m
->hash
, INSERT
);
6855 gcc_assert (*slot
== NULL
);
6862 /* Tree walker to replace the decls used inside value expressions by
6866 replace_block_vars_by_duplicates_1 (tree
*tp
, int *walk_subtrees
, void *data
)
6868 struct replace_decls_d
*rd
= (struct replace_decls_d
*)data
;
6870 switch (TREE_CODE (*tp
))
6875 replace_by_duplicate_decl (tp
, rd
->vars_map
, rd
->to_context
);
6881 if (IS_TYPE_OR_DECL_P (*tp
))
6882 *walk_subtrees
= false;
6887 /* Change DECL_CONTEXT of all BLOCK_VARS in block, including
6891 replace_block_vars_by_duplicates (tree block
, hash_map
<tree
, tree
> *vars_map
,
6896 for (tp
= &BLOCK_VARS (block
); *tp
; tp
= &DECL_CHAIN (*tp
))
6899 if (TREE_CODE (t
) != VAR_DECL
&& TREE_CODE (t
) != CONST_DECL
)
6901 replace_by_duplicate_decl (&t
, vars_map
, to_context
);
6904 if (TREE_CODE (*tp
) == VAR_DECL
&& DECL_HAS_VALUE_EXPR_P (*tp
))
6906 tree x
= DECL_VALUE_EXPR (*tp
);
6907 struct replace_decls_d rd
= { vars_map
, to_context
};
6909 walk_tree (&x
, replace_block_vars_by_duplicates_1
, &rd
, NULL
);
6910 SET_DECL_VALUE_EXPR (t
, x
);
6911 DECL_HAS_VALUE_EXPR_P (t
) = 1;
6913 DECL_CHAIN (t
) = DECL_CHAIN (*tp
);
6918 for (block
= BLOCK_SUBBLOCKS (block
); block
; block
= BLOCK_CHAIN (block
))
6919 replace_block_vars_by_duplicates (block
, vars_map
, to_context
);
6922 /* Fixup the loop arrays and numbers after moving LOOP and its subloops
6926 fixup_loop_arrays_after_move (struct function
*fn1
, struct function
*fn2
,
6929 /* Discard it from the old loop array. */
6930 (*get_loops (fn1
))[loop
->num
] = NULL
;
6932 /* Place it in the new loop array, assigning it a new number. */
6933 loop
->num
= number_of_loops (fn2
);
6934 vec_safe_push (loops_for_fn (fn2
)->larray
, loop
);
6936 /* Recurse to children. */
6937 for (loop
= loop
->inner
; loop
; loop
= loop
->next
)
6938 fixup_loop_arrays_after_move (fn1
, fn2
, loop
);
6941 /* Verify that the blocks in BBS_P are a single-entry, single-exit region
6942 delimited by ENTRY_BB and EXIT_BB, possibly containing noreturn blocks. */
6945 verify_sese (basic_block entry
, basic_block exit
, vec
<basic_block
> *bbs_p
)
6950 bitmap bbs
= BITMAP_ALLOC (NULL
);
6953 gcc_assert (entry
!= NULL
);
6954 gcc_assert (entry
!= exit
);
6955 gcc_assert (bbs_p
!= NULL
);
6957 gcc_assert (bbs_p
->length () > 0);
6959 FOR_EACH_VEC_ELT (*bbs_p
, i
, bb
)
6960 bitmap_set_bit (bbs
, bb
->index
);
6962 gcc_assert (bitmap_bit_p (bbs
, entry
->index
));
6963 gcc_assert (exit
== NULL
|| bitmap_bit_p (bbs
, exit
->index
));
6965 FOR_EACH_VEC_ELT (*bbs_p
, i
, bb
)
6969 gcc_assert (single_pred_p (entry
));
6970 gcc_assert (!bitmap_bit_p (bbs
, single_pred (entry
)->index
));
6973 for (ei
= ei_start (bb
->preds
); !ei_end_p (ei
); ei_next (&ei
))
6976 gcc_assert (bitmap_bit_p (bbs
, e
->src
->index
));
6981 gcc_assert (single_succ_p (exit
));
6982 gcc_assert (!bitmap_bit_p (bbs
, single_succ (exit
)->index
));
6985 for (ei
= ei_start (bb
->succs
); !ei_end_p (ei
); ei_next (&ei
))
6988 gcc_assert (bitmap_bit_p (bbs
, e
->dest
->index
));
6995 /* If FROM is an SSA_NAME, mark the version in bitmap DATA. */
6998 gather_ssa_name_hash_map_from (tree
const &from
, tree
const &, void *data
)
7000 bitmap release_names
= (bitmap
)data
;
7002 if (TREE_CODE (from
) != SSA_NAME
)
7005 bitmap_set_bit (release_names
, SSA_NAME_VERSION (from
));
7009 /* Move a single-entry, single-exit region delimited by ENTRY_BB and
7010 EXIT_BB to function DEST_CFUN. The whole region is replaced by a
7011 single basic block in the original CFG and the new basic block is
7012 returned. DEST_CFUN must not have a CFG yet.
7014 Note that the region need not be a pure SESE region. Blocks inside
7015 the region may contain calls to abort/exit. The only restriction
7016 is that ENTRY_BB should be the only entry point and it must
7019 Change TREE_BLOCK of all statements in ORIG_BLOCK to the new
7020 functions outermost BLOCK, move all subblocks of ORIG_BLOCK
7021 to the new function.
7023 All local variables referenced in the region are assumed to be in
7024 the corresponding BLOCK_VARS and unexpanded variable lists
7025 associated with DEST_CFUN.
7027 TODO: investigate whether we can reuse gimple_duplicate_sese_region to
7028 reimplement move_sese_region_to_fn by duplicating the region rather than
7032 move_sese_region_to_fn (struct function
*dest_cfun
, basic_block entry_bb
,
7033 basic_block exit_bb
, tree orig_block
)
7035 vec
<basic_block
> bbs
, dom_bbs
;
7036 basic_block dom_entry
= get_immediate_dominator (CDI_DOMINATORS
, entry_bb
);
7037 basic_block after
, bb
, *entry_pred
, *exit_succ
, abb
;
7038 struct function
*saved_cfun
= cfun
;
7039 int *entry_flag
, *exit_flag
;
7040 unsigned *entry_prob
, *exit_prob
;
7041 unsigned i
, num_entry_edges
, num_exit_edges
, num_nodes
;
7044 htab_t new_label_map
;
7045 hash_map
<void *, void *> *eh_map
;
7046 struct loop
*loop
= entry_bb
->loop_father
;
7047 struct loop
*loop0
= get_loop (saved_cfun
, 0);
7048 struct move_stmt_d d
;
7050 /* If ENTRY does not strictly dominate EXIT, this cannot be an SESE
7052 gcc_assert (entry_bb
!= exit_bb
7054 || dominated_by_p (CDI_DOMINATORS
, exit_bb
, entry_bb
)));
7056 /* Collect all the blocks in the region. Manually add ENTRY_BB
7057 because it won't be added by dfs_enumerate_from. */
7059 bbs
.safe_push (entry_bb
);
7060 gather_blocks_in_sese_region (entry_bb
, exit_bb
, &bbs
);
7063 verify_sese (entry_bb
, exit_bb
, &bbs
);
7065 /* The blocks that used to be dominated by something in BBS will now be
7066 dominated by the new block. */
7067 dom_bbs
= get_dominated_by_region (CDI_DOMINATORS
,
7071 /* Detach ENTRY_BB and EXIT_BB from CFUN->CFG. We need to remember
7072 the predecessor edges to ENTRY_BB and the successor edges to
7073 EXIT_BB so that we can re-attach them to the new basic block that
7074 will replace the region. */
7075 num_entry_edges
= EDGE_COUNT (entry_bb
->preds
);
7076 entry_pred
= XNEWVEC (basic_block
, num_entry_edges
);
7077 entry_flag
= XNEWVEC (int, num_entry_edges
);
7078 entry_prob
= XNEWVEC (unsigned, num_entry_edges
);
7080 for (ei
= ei_start (entry_bb
->preds
); (e
= ei_safe_edge (ei
)) != NULL
;)
7082 entry_prob
[i
] = e
->probability
;
7083 entry_flag
[i
] = e
->flags
;
7084 entry_pred
[i
++] = e
->src
;
7090 num_exit_edges
= EDGE_COUNT (exit_bb
->succs
);
7091 exit_succ
= XNEWVEC (basic_block
, num_exit_edges
);
7092 exit_flag
= XNEWVEC (int, num_exit_edges
);
7093 exit_prob
= XNEWVEC (unsigned, num_exit_edges
);
7095 for (ei
= ei_start (exit_bb
->succs
); (e
= ei_safe_edge (ei
)) != NULL
;)
7097 exit_prob
[i
] = e
->probability
;
7098 exit_flag
[i
] = e
->flags
;
7099 exit_succ
[i
++] = e
->dest
;
7111 /* Switch context to the child function to initialize DEST_FN's CFG. */
7112 gcc_assert (dest_cfun
->cfg
== NULL
);
7113 push_cfun (dest_cfun
);
7115 init_empty_tree_cfg ();
7117 /* Initialize EH information for the new function. */
7119 new_label_map
= NULL
;
7122 eh_region region
= NULL
;
7124 FOR_EACH_VEC_ELT (bbs
, i
, bb
)
7125 region
= find_outermost_region_in_block (saved_cfun
, bb
, region
);
7127 init_eh_for_function ();
7130 new_label_map
= htab_create (17, tree_map_hash
, tree_map_eq
, free
);
7131 eh_map
= duplicate_eh_regions (saved_cfun
, region
, 0,
7132 new_label_mapper
, new_label_map
);
7136 /* Initialize an empty loop tree. */
7137 struct loops
*loops
= ggc_cleared_alloc
<struct loops
> ();
7138 init_loops_structure (dest_cfun
, loops
, 1);
7139 loops
->state
= LOOPS_MAY_HAVE_MULTIPLE_LATCHES
;
7140 set_loops_for_fn (dest_cfun
, loops
);
7142 /* Move the outlined loop tree part. */
7143 num_nodes
= bbs
.length ();
7144 FOR_EACH_VEC_ELT (bbs
, i
, bb
)
7146 if (bb
->loop_father
->header
== bb
)
7148 struct loop
*this_loop
= bb
->loop_father
;
7149 struct loop
*outer
= loop_outer (this_loop
);
7151 /* If the SESE region contains some bbs ending with
7152 a noreturn call, those are considered to belong
7153 to the outermost loop in saved_cfun, rather than
7154 the entry_bb's loop_father. */
7158 num_nodes
-= this_loop
->num_nodes
;
7159 flow_loop_tree_node_remove (bb
->loop_father
);
7160 flow_loop_tree_node_add (get_loop (dest_cfun
, 0), this_loop
);
7161 fixup_loop_arrays_after_move (saved_cfun
, cfun
, this_loop
);
7164 else if (bb
->loop_father
== loop0
&& loop0
!= loop
)
7167 /* Remove loop exits from the outlined region. */
7168 if (loops_for_fn (saved_cfun
)->exits
)
7169 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
7171 struct loops
*l
= loops_for_fn (saved_cfun
);
7173 = l
->exits
->find_slot_with_hash (e
, htab_hash_pointer (e
),
7176 l
->exits
->clear_slot (slot
);
7181 /* Adjust the number of blocks in the tree root of the outlined part. */
7182 get_loop (dest_cfun
, 0)->num_nodes
= bbs
.length () + 2;
7184 /* Setup a mapping to be used by move_block_to_fn. */
7185 loop
->aux
= current_loops
->tree_root
;
7186 loop0
->aux
= current_loops
->tree_root
;
7190 /* Move blocks from BBS into DEST_CFUN. */
7191 gcc_assert (bbs
.length () >= 2);
7192 after
= dest_cfun
->cfg
->x_entry_block_ptr
;
7193 hash_map
<tree
, tree
> vars_map
;
7195 memset (&d
, 0, sizeof (d
));
7196 d
.orig_block
= orig_block
;
7197 d
.new_block
= DECL_INITIAL (dest_cfun
->decl
);
7198 d
.from_context
= cfun
->decl
;
7199 d
.to_context
= dest_cfun
->decl
;
7200 d
.vars_map
= &vars_map
;
7201 d
.new_label_map
= new_label_map
;
7203 d
.remap_decls_p
= true;
7205 if (gimple_in_ssa_p (cfun
))
7206 for (tree arg
= DECL_ARGUMENTS (d
.to_context
); arg
; arg
= DECL_CHAIN (arg
))
7208 tree narg
= make_ssa_name_fn (dest_cfun
, arg
, gimple_build_nop ());
7209 set_ssa_default_def (dest_cfun
, arg
, narg
);
7210 vars_map
.put (arg
, narg
);
7213 FOR_EACH_VEC_ELT (bbs
, i
, bb
)
7215 /* No need to update edge counts on the last block. It has
7216 already been updated earlier when we detached the region from
7217 the original CFG. */
7218 move_block_to_fn (dest_cfun
, bb
, after
, bb
!= exit_bb
, &d
);
7224 /* Loop sizes are no longer correct, fix them up. */
7225 loop
->num_nodes
-= num_nodes
;
7226 for (struct loop
*outer
= loop_outer (loop
);
7227 outer
; outer
= loop_outer (outer
))
7228 outer
->num_nodes
-= num_nodes
;
7229 loop0
->num_nodes
-= bbs
.length () - num_nodes
;
7231 if (saved_cfun
->has_simduid_loops
|| saved_cfun
->has_force_vectorize_loops
)
7234 for (i
= 0; vec_safe_iterate (loops
->larray
, i
, &aloop
); i
++)
7239 replace_by_duplicate_decl (&aloop
->simduid
, d
.vars_map
,
7241 dest_cfun
->has_simduid_loops
= true;
7243 if (aloop
->force_vectorize
)
7244 dest_cfun
->has_force_vectorize_loops
= true;
7248 /* Rewire BLOCK_SUBBLOCKS of orig_block. */
7252 gcc_assert (BLOCK_SUBBLOCKS (DECL_INITIAL (dest_cfun
->decl
))
7254 BLOCK_SUBBLOCKS (DECL_INITIAL (dest_cfun
->decl
))
7255 = BLOCK_SUBBLOCKS (orig_block
);
7256 for (block
= BLOCK_SUBBLOCKS (orig_block
);
7257 block
; block
= BLOCK_CHAIN (block
))
7258 BLOCK_SUPERCONTEXT (block
) = DECL_INITIAL (dest_cfun
->decl
);
7259 BLOCK_SUBBLOCKS (orig_block
) = NULL_TREE
;
7262 replace_block_vars_by_duplicates (DECL_INITIAL (dest_cfun
->decl
),
7263 &vars_map
, dest_cfun
->decl
);
7266 htab_delete (new_label_map
);
7270 if (gimple_in_ssa_p (cfun
))
7272 /* We need to release ssa-names in a defined order, so first find them,
7273 and then iterate in ascending version order. */
7274 bitmap release_names
= BITMAP_ALLOC (NULL
);
7275 vars_map
.traverse
<void *, gather_ssa_name_hash_map_from
> (release_names
);
7278 EXECUTE_IF_SET_IN_BITMAP (release_names
, 0, i
, bi
)
7279 release_ssa_name (ssa_name (i
));
7280 BITMAP_FREE (release_names
);
7283 /* Rewire the entry and exit blocks. The successor to the entry
7284 block turns into the successor of DEST_FN's ENTRY_BLOCK_PTR in
7285 the child function. Similarly, the predecessor of DEST_FN's
7286 EXIT_BLOCK_PTR turns into the predecessor of EXIT_BLOCK_PTR. We
7287 need to switch CFUN between DEST_CFUN and SAVED_CFUN so that the
7288 various CFG manipulation function get to the right CFG.
7290 FIXME, this is silly. The CFG ought to become a parameter to
7292 push_cfun (dest_cfun
);
7293 make_edge (ENTRY_BLOCK_PTR_FOR_FN (cfun
), entry_bb
, EDGE_FALLTHRU
);
7295 make_edge (exit_bb
, EXIT_BLOCK_PTR_FOR_FN (cfun
), 0);
7298 /* Back in the original function, the SESE region has disappeared,
7299 create a new basic block in its place. */
7300 bb
= create_empty_bb (entry_pred
[0]);
7302 add_bb_to_loop (bb
, loop
);
7303 for (i
= 0; i
< num_entry_edges
; i
++)
7305 e
= make_edge (entry_pred
[i
], bb
, entry_flag
[i
]);
7306 e
->probability
= entry_prob
[i
];
7309 for (i
= 0; i
< num_exit_edges
; i
++)
7311 e
= make_edge (bb
, exit_succ
[i
], exit_flag
[i
]);
7312 e
->probability
= exit_prob
[i
];
7315 set_immediate_dominator (CDI_DOMINATORS
, bb
, dom_entry
);
7316 FOR_EACH_VEC_ELT (dom_bbs
, i
, abb
)
7317 set_immediate_dominator (CDI_DOMINATORS
, abb
, bb
);
7335 /* Dump FUNCTION_DECL FN to file FILE using FLAGS (see TDF_* in dumpfile.h)
7339 dump_function_to_file (tree fndecl
, FILE *file
, int flags
)
7341 tree arg
, var
, old_current_fndecl
= current_function_decl
;
7342 struct function
*dsf
;
7343 bool ignore_topmost_bind
= false, any_var
= false;
7346 bool tmclone
= (TREE_CODE (fndecl
) == FUNCTION_DECL
7347 && decl_is_tm_clone (fndecl
));
7348 struct function
*fun
= DECL_STRUCT_FUNCTION (fndecl
);
7350 if (DECL_ATTRIBUTES (fndecl
) != NULL_TREE
)
7352 fprintf (file
, "__attribute__((");
7356 for (chain
= DECL_ATTRIBUTES (fndecl
); chain
;
7357 first
= false, chain
= TREE_CHAIN (chain
))
7360 fprintf (file
, ", ");
7362 print_generic_expr (file
, get_attribute_name (chain
), dump_flags
);
7363 if (TREE_VALUE (chain
) != NULL_TREE
)
7365 fprintf (file
, " (");
7366 print_generic_expr (file
, TREE_VALUE (chain
), dump_flags
);
7367 fprintf (file
, ")");
7371 fprintf (file
, "))\n");
7374 current_function_decl
= fndecl
;
7375 fprintf (file
, "%s %s(", function_name (fun
), tmclone
? "[tm-clone] " : "");
7377 arg
= DECL_ARGUMENTS (fndecl
);
7380 print_generic_expr (file
, TREE_TYPE (arg
), dump_flags
);
7381 fprintf (file
, " ");
7382 print_generic_expr (file
, arg
, dump_flags
);
7383 if (flags
& TDF_VERBOSE
)
7384 print_node (file
, "", arg
, 4);
7385 if (DECL_CHAIN (arg
))
7386 fprintf (file
, ", ");
7387 arg
= DECL_CHAIN (arg
);
7389 fprintf (file
, ")\n");
7391 if (flags
& TDF_VERBOSE
)
7392 print_node (file
, "", fndecl
, 2);
7394 dsf
= DECL_STRUCT_FUNCTION (fndecl
);
7395 if (dsf
&& (flags
& TDF_EH
))
7396 dump_eh_tree (file
, dsf
);
7398 if (flags
& TDF_RAW
&& !gimple_has_body_p (fndecl
))
7400 dump_node (fndecl
, TDF_SLIM
| flags
, file
);
7401 current_function_decl
= old_current_fndecl
;
7405 /* When GIMPLE is lowered, the variables are no longer available in
7406 BIND_EXPRs, so display them separately. */
7407 if (fun
&& fun
->decl
== fndecl
&& (fun
->curr_properties
& PROP_gimple_lcf
))
7410 ignore_topmost_bind
= true;
7412 fprintf (file
, "{\n");
7413 if (!vec_safe_is_empty (fun
->local_decls
))
7414 FOR_EACH_LOCAL_DECL (fun
, ix
, var
)
7416 print_generic_decl (file
, var
, flags
);
7417 if (flags
& TDF_VERBOSE
)
7418 print_node (file
, "", var
, 4);
7419 fprintf (file
, "\n");
7423 if (gimple_in_ssa_p (cfun
))
7424 for (ix
= 1; ix
< num_ssa_names
; ++ix
)
7426 tree name
= ssa_name (ix
);
7427 if (name
&& !SSA_NAME_VAR (name
))
7429 fprintf (file
, " ");
7430 print_generic_expr (file
, TREE_TYPE (name
), flags
);
7431 fprintf (file
, " ");
7432 print_generic_expr (file
, name
, flags
);
7433 fprintf (file
, ";\n");
7440 if (fun
&& fun
->decl
== fndecl
7442 && basic_block_info_for_fn (fun
))
7444 /* If the CFG has been built, emit a CFG-based dump. */
7445 if (!ignore_topmost_bind
)
7446 fprintf (file
, "{\n");
7448 if (any_var
&& n_basic_blocks_for_fn (fun
))
7449 fprintf (file
, "\n");
7451 FOR_EACH_BB_FN (bb
, fun
)
7452 dump_bb (file
, bb
, 2, flags
| TDF_COMMENT
);
7454 fprintf (file
, "}\n");
7456 else if (DECL_SAVED_TREE (fndecl
) == NULL
)
7458 /* The function is now in GIMPLE form but the CFG has not been
7459 built yet. Emit the single sequence of GIMPLE statements
7460 that make up its body. */
7461 gimple_seq body
= gimple_body (fndecl
);
7463 if (gimple_seq_first_stmt (body
)
7464 && gimple_seq_first_stmt (body
) == gimple_seq_last_stmt (body
)
7465 && gimple_code (gimple_seq_first_stmt (body
)) == GIMPLE_BIND
)
7466 print_gimple_seq (file
, body
, 0, flags
);
7469 if (!ignore_topmost_bind
)
7470 fprintf (file
, "{\n");
7473 fprintf (file
, "\n");
7475 print_gimple_seq (file
, body
, 2, flags
);
7476 fprintf (file
, "}\n");
7483 /* Make a tree based dump. */
7484 chain
= DECL_SAVED_TREE (fndecl
);
7485 if (chain
&& TREE_CODE (chain
) == BIND_EXPR
)
7487 if (ignore_topmost_bind
)
7489 chain
= BIND_EXPR_BODY (chain
);
7497 if (!ignore_topmost_bind
)
7499 fprintf (file
, "{\n");
7500 /* No topmost bind, pretend it's ignored for later. */
7501 ignore_topmost_bind
= true;
7507 fprintf (file
, "\n");
7509 print_generic_stmt_indented (file
, chain
, flags
, indent
);
7510 if (ignore_topmost_bind
)
7511 fprintf (file
, "}\n");
7514 if (flags
& TDF_ENUMERATE_LOCALS
)
7515 dump_enumerated_decls (file
, flags
);
7516 fprintf (file
, "\n\n");
7518 current_function_decl
= old_current_fndecl
;
7521 /* Dump FUNCTION_DECL FN to stderr using FLAGS (see TDF_* in tree.h) */
7524 debug_function (tree fn
, int flags
)
7526 dump_function_to_file (fn
, stderr
, flags
);
7530 /* Print on FILE the indexes for the predecessors of basic_block BB. */
7533 print_pred_bbs (FILE *file
, basic_block bb
)
7538 FOR_EACH_EDGE (e
, ei
, bb
->preds
)
7539 fprintf (file
, "bb_%d ", e
->src
->index
);
7543 /* Print on FILE the indexes for the successors of basic_block BB. */
7546 print_succ_bbs (FILE *file
, basic_block bb
)
7551 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
7552 fprintf (file
, "bb_%d ", e
->dest
->index
);
7555 /* Print to FILE the basic block BB following the VERBOSITY level. */
7558 print_loops_bb (FILE *file
, basic_block bb
, int indent
, int verbosity
)
7560 char *s_indent
= (char *) alloca ((size_t) indent
+ 1);
7561 memset ((void *) s_indent
, ' ', (size_t) indent
);
7562 s_indent
[indent
] = '\0';
7564 /* Print basic_block's header. */
7567 fprintf (file
, "%s bb_%d (preds = {", s_indent
, bb
->index
);
7568 print_pred_bbs (file
, bb
);
7569 fprintf (file
, "}, succs = {");
7570 print_succ_bbs (file
, bb
);
7571 fprintf (file
, "})\n");
7574 /* Print basic_block's body. */
7577 fprintf (file
, "%s {\n", s_indent
);
7578 dump_bb (file
, bb
, indent
+ 4, TDF_VOPS
|TDF_MEMSYMS
);
7579 fprintf (file
, "%s }\n", s_indent
);
7583 static void print_loop_and_siblings (FILE *, struct loop
*, int, int);
7585 /* Pretty print LOOP on FILE, indented INDENT spaces. Following
7586 VERBOSITY level this outputs the contents of the loop, or just its
7590 print_loop (FILE *file
, struct loop
*loop
, int indent
, int verbosity
)
7598 s_indent
= (char *) alloca ((size_t) indent
+ 1);
7599 memset ((void *) s_indent
, ' ', (size_t) indent
);
7600 s_indent
[indent
] = '\0';
7602 /* Print loop's header. */
7603 fprintf (file
, "%sloop_%d (", s_indent
, loop
->num
);
7605 fprintf (file
, "header = %d", loop
->header
->index
);
7608 fprintf (file
, "deleted)\n");
7612 fprintf (file
, ", latch = %d", loop
->latch
->index
);
7614 fprintf (file
, ", multiple latches");
7615 fprintf (file
, ", niter = ");
7616 print_generic_expr (file
, loop
->nb_iterations
, 0);
7618 if (loop
->any_upper_bound
)
7620 fprintf (file
, ", upper_bound = ");
7621 print_decu (loop
->nb_iterations_upper_bound
, file
);
7624 if (loop
->any_estimate
)
7626 fprintf (file
, ", estimate = ");
7627 print_decu (loop
->nb_iterations_estimate
, file
);
7629 fprintf (file
, ")\n");
7631 /* Print loop's body. */
7634 fprintf (file
, "%s{\n", s_indent
);
7635 FOR_EACH_BB_FN (bb
, cfun
)
7636 if (bb
->loop_father
== loop
)
7637 print_loops_bb (file
, bb
, indent
, verbosity
);
7639 print_loop_and_siblings (file
, loop
->inner
, indent
+ 2, verbosity
);
7640 fprintf (file
, "%s}\n", s_indent
);
7644 /* Print the LOOP and its sibling loops on FILE, indented INDENT
7645 spaces. Following VERBOSITY level this outputs the contents of the
7646 loop, or just its structure. */
7649 print_loop_and_siblings (FILE *file
, struct loop
*loop
, int indent
,
7655 print_loop (file
, loop
, indent
, verbosity
);
7656 print_loop_and_siblings (file
, loop
->next
, indent
, verbosity
);
7659 /* Follow a CFG edge from the entry point of the program, and on entry
7660 of a loop, pretty print the loop structure on FILE. */
7663 print_loops (FILE *file
, int verbosity
)
7667 bb
= ENTRY_BLOCK_PTR_FOR_FN (cfun
);
7668 fprintf (file
, "\nLoops in function: %s\n", current_function_name ());
7669 if (bb
&& bb
->loop_father
)
7670 print_loop_and_siblings (file
, bb
->loop_father
, 0, verbosity
);
7676 debug (struct loop
&ref
)
7678 print_loop (stderr
, &ref
, 0, /*verbosity*/0);
7682 debug (struct loop
*ptr
)
7687 fprintf (stderr
, "<nil>\n");
7690 /* Dump a loop verbosely. */
7693 debug_verbose (struct loop
&ref
)
7695 print_loop (stderr
, &ref
, 0, /*verbosity*/3);
7699 debug_verbose (struct loop
*ptr
)
7704 fprintf (stderr
, "<nil>\n");
7708 /* Debugging loops structure at tree level, at some VERBOSITY level. */
7711 debug_loops (int verbosity
)
7713 print_loops (stderr
, verbosity
);
7716 /* Print on stderr the code of LOOP, at some VERBOSITY level. */
7719 debug_loop (struct loop
*loop
, int verbosity
)
7721 print_loop (stderr
, loop
, 0, verbosity
);
7724 /* Print on stderr the code of loop number NUM, at some VERBOSITY
7728 debug_loop_num (unsigned num
, int verbosity
)
7730 debug_loop (get_loop (cfun
, num
), verbosity
);
7733 /* Return true if BB ends with a call, possibly followed by some
7734 instructions that must stay with the call. Return false,
7738 gimple_block_ends_with_call_p (basic_block bb
)
7740 gimple_stmt_iterator gsi
= gsi_last_nondebug_bb (bb
);
7741 return !gsi_end_p (gsi
) && is_gimple_call (gsi_stmt (gsi
));
7745 /* Return true if BB ends with a conditional branch. Return false,
7749 gimple_block_ends_with_condjump_p (const_basic_block bb
)
7751 gimple
*stmt
= last_stmt (CONST_CAST_BB (bb
));
7752 return (stmt
&& gimple_code (stmt
) == GIMPLE_COND
);
7756 /* Return true if we need to add fake edge to exit at statement T.
7757 Helper function for gimple_flow_call_edges_add. */
7760 need_fake_edge_p (gimple
*t
)
7762 tree fndecl
= NULL_TREE
;
7765 /* NORETURN and LONGJMP calls already have an edge to exit.
7766 CONST and PURE calls do not need one.
7767 We don't currently check for CONST and PURE here, although
7768 it would be a good idea, because those attributes are
7769 figured out from the RTL in mark_constant_function, and
7770 the counter incrementation code from -fprofile-arcs
7771 leads to different results from -fbranch-probabilities. */
7772 if (is_gimple_call (t
))
7774 fndecl
= gimple_call_fndecl (t
);
7775 call_flags
= gimple_call_flags (t
);
7778 if (is_gimple_call (t
)
7780 && DECL_BUILT_IN (fndecl
)
7781 && (call_flags
& ECF_NOTHROW
)
7782 && !(call_flags
& ECF_RETURNS_TWICE
)
7783 /* fork() doesn't really return twice, but the effect of
7784 wrapping it in __gcov_fork() which calls __gcov_flush()
7785 and clears the counters before forking has the same
7786 effect as returning twice. Force a fake edge. */
7787 && !(DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
7788 && DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_FORK
))
7791 if (is_gimple_call (t
))
7797 if (!(call_flags
& ECF_NORETURN
))
7801 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
7802 if ((e
->flags
& EDGE_FAKE
) == 0)
7806 if (gasm
*asm_stmt
= dyn_cast
<gasm
*> (t
))
7807 if (gimple_asm_volatile_p (asm_stmt
) || gimple_asm_input_p (asm_stmt
))
7814 /* Add fake edges to the function exit for any non constant and non
7815 noreturn calls (or noreturn calls with EH/abnormal edges),
7816 volatile inline assembly in the bitmap of blocks specified by BLOCKS
7817 or to the whole CFG if BLOCKS is zero. Return the number of blocks
7820 The goal is to expose cases in which entering a basic block does
7821 not imply that all subsequent instructions must be executed. */
7824 gimple_flow_call_edges_add (sbitmap blocks
)
7827 int blocks_split
= 0;
7828 int last_bb
= last_basic_block_for_fn (cfun
);
7829 bool check_last_block
= false;
7831 if (n_basic_blocks_for_fn (cfun
) == NUM_FIXED_BLOCKS
)
7835 check_last_block
= true;
7837 check_last_block
= bitmap_bit_p (blocks
,
7838 EXIT_BLOCK_PTR_FOR_FN (cfun
)->prev_bb
->index
);
7840 /* In the last basic block, before epilogue generation, there will be
7841 a fallthru edge to EXIT. Special care is required if the last insn
7842 of the last basic block is a call because make_edge folds duplicate
7843 edges, which would result in the fallthru edge also being marked
7844 fake, which would result in the fallthru edge being removed by
7845 remove_fake_edges, which would result in an invalid CFG.
7847 Moreover, we can't elide the outgoing fake edge, since the block
7848 profiler needs to take this into account in order to solve the minimal
7849 spanning tree in the case that the call doesn't return.
7851 Handle this by adding a dummy instruction in a new last basic block. */
7852 if (check_last_block
)
7854 basic_block bb
= EXIT_BLOCK_PTR_FOR_FN (cfun
)->prev_bb
;
7855 gimple_stmt_iterator gsi
= gsi_last_nondebug_bb (bb
);
7858 if (!gsi_end_p (gsi
))
7861 if (t
&& need_fake_edge_p (t
))
7865 e
= find_edge (bb
, EXIT_BLOCK_PTR_FOR_FN (cfun
));
7868 gsi_insert_on_edge (e
, gimple_build_nop ());
7869 gsi_commit_edge_inserts ();
7874 /* Now add fake edges to the function exit for any non constant
7875 calls since there is no way that we can determine if they will
7877 for (i
= 0; i
< last_bb
; i
++)
7879 basic_block bb
= BASIC_BLOCK_FOR_FN (cfun
, i
);
7880 gimple_stmt_iterator gsi
;
7881 gimple
*stmt
, *last_stmt
;
7886 if (blocks
&& !bitmap_bit_p (blocks
, i
))
7889 gsi
= gsi_last_nondebug_bb (bb
);
7890 if (!gsi_end_p (gsi
))
7892 last_stmt
= gsi_stmt (gsi
);
7895 stmt
= gsi_stmt (gsi
);
7896 if (need_fake_edge_p (stmt
))
7900 /* The handling above of the final block before the
7901 epilogue should be enough to verify that there is
7902 no edge to the exit block in CFG already.
7903 Calling make_edge in such case would cause us to
7904 mark that edge as fake and remove it later. */
7905 if (flag_checking
&& stmt
== last_stmt
)
7907 e
= find_edge (bb
, EXIT_BLOCK_PTR_FOR_FN (cfun
));
7908 gcc_assert (e
== NULL
);
7911 /* Note that the following may create a new basic block
7912 and renumber the existing basic blocks. */
7913 if (stmt
!= last_stmt
)
7915 e
= split_block (bb
, stmt
);
7919 make_edge (bb
, EXIT_BLOCK_PTR_FOR_FN (cfun
), EDGE_FAKE
);
7923 while (!gsi_end_p (gsi
));
7928 verify_flow_info ();
7930 return blocks_split
;
7933 /* Removes edge E and all the blocks dominated by it, and updates dominance
7934 information. The IL in E->src needs to be updated separately.
7935 If dominance info is not available, only the edge E is removed.*/
7938 remove_edge_and_dominated_blocks (edge e
)
7940 vec
<basic_block
> bbs_to_remove
= vNULL
;
7941 vec
<basic_block
> bbs_to_fix_dom
= vNULL
;
7945 bool none_removed
= false;
7947 basic_block bb
, dbb
;
7950 /* If we are removing a path inside a non-root loop that may change
7951 loop ownership of blocks or remove loops. Mark loops for fixup. */
7953 && loop_outer (e
->src
->loop_father
) != NULL
7954 && e
->src
->loop_father
== e
->dest
->loop_father
)
7955 loops_state_set (LOOPS_NEED_FIXUP
);
7957 if (!dom_info_available_p (CDI_DOMINATORS
))
7963 /* No updating is needed for edges to exit. */
7964 if (e
->dest
== EXIT_BLOCK_PTR_FOR_FN (cfun
))
7966 if (cfgcleanup_altered_bbs
)
7967 bitmap_set_bit (cfgcleanup_altered_bbs
, e
->src
->index
);
7972 /* First, we find the basic blocks to remove. If E->dest has a predecessor
7973 that is not dominated by E->dest, then this set is empty. Otherwise,
7974 all the basic blocks dominated by E->dest are removed.
7976 Also, to DF_IDOM we store the immediate dominators of the blocks in
7977 the dominance frontier of E (i.e., of the successors of the
7978 removed blocks, if there are any, and of E->dest otherwise). */
7979 FOR_EACH_EDGE (f
, ei
, e
->dest
->preds
)
7984 if (!dominated_by_p (CDI_DOMINATORS
, f
->src
, e
->dest
))
7986 none_removed
= true;
7991 df
= BITMAP_ALLOC (NULL
);
7992 df_idom
= BITMAP_ALLOC (NULL
);
7995 bitmap_set_bit (df_idom
,
7996 get_immediate_dominator (CDI_DOMINATORS
, e
->dest
)->index
);
7999 bbs_to_remove
= get_all_dominated_blocks (CDI_DOMINATORS
, e
->dest
);
8000 FOR_EACH_VEC_ELT (bbs_to_remove
, i
, bb
)
8002 FOR_EACH_EDGE (f
, ei
, bb
->succs
)
8004 if (f
->dest
!= EXIT_BLOCK_PTR_FOR_FN (cfun
))
8005 bitmap_set_bit (df
, f
->dest
->index
);
8008 FOR_EACH_VEC_ELT (bbs_to_remove
, i
, bb
)
8009 bitmap_clear_bit (df
, bb
->index
);
8011 EXECUTE_IF_SET_IN_BITMAP (df
, 0, i
, bi
)
8013 bb
= BASIC_BLOCK_FOR_FN (cfun
, i
);
8014 bitmap_set_bit (df_idom
,
8015 get_immediate_dominator (CDI_DOMINATORS
, bb
)->index
);
8019 if (cfgcleanup_altered_bbs
)
8021 /* Record the set of the altered basic blocks. */
8022 bitmap_set_bit (cfgcleanup_altered_bbs
, e
->src
->index
);
8023 bitmap_ior_into (cfgcleanup_altered_bbs
, df
);
8026 /* Remove E and the cancelled blocks. */
8031 /* Walk backwards so as to get a chance to substitute all
8032 released DEFs into debug stmts. See
8033 eliminate_unnecessary_stmts() in tree-ssa-dce.c for more
8035 for (i
= bbs_to_remove
.length (); i
-- > 0; )
8036 delete_basic_block (bbs_to_remove
[i
]);
8039 /* Update the dominance information. The immediate dominator may change only
8040 for blocks whose immediate dominator belongs to DF_IDOM:
8042 Suppose that idom(X) = Y before removal of E and idom(X) != Y after the
8043 removal. Let Z the arbitrary block such that idom(Z) = Y and
8044 Z dominates X after the removal. Before removal, there exists a path P
8045 from Y to X that avoids Z. Let F be the last edge on P that is
8046 removed, and let W = F->dest. Before removal, idom(W) = Y (since Y
8047 dominates W, and because of P, Z does not dominate W), and W belongs to
8048 the dominance frontier of E. Therefore, Y belongs to DF_IDOM. */
8049 EXECUTE_IF_SET_IN_BITMAP (df_idom
, 0, i
, bi
)
8051 bb
= BASIC_BLOCK_FOR_FN (cfun
, i
);
8052 for (dbb
= first_dom_son (CDI_DOMINATORS
, bb
);
8054 dbb
= next_dom_son (CDI_DOMINATORS
, dbb
))
8055 bbs_to_fix_dom
.safe_push (dbb
);
8058 iterate_fix_dominators (CDI_DOMINATORS
, bbs_to_fix_dom
, true);
8061 BITMAP_FREE (df_idom
);
8062 bbs_to_remove
.release ();
8063 bbs_to_fix_dom
.release ();
8066 /* Purge dead EH edges from basic block BB. */
8069 gimple_purge_dead_eh_edges (basic_block bb
)
8071 bool changed
= false;
8074 gimple
*stmt
= last_stmt (bb
);
8076 if (stmt
&& stmt_can_throw_internal (stmt
))
8079 for (ei
= ei_start (bb
->succs
); (e
= ei_safe_edge (ei
)); )
8081 if (e
->flags
& EDGE_EH
)
8083 remove_edge_and_dominated_blocks (e
);
8093 /* Purge dead EH edges from basic block listed in BLOCKS. */
8096 gimple_purge_all_dead_eh_edges (const_bitmap blocks
)
8098 bool changed
= false;
8102 EXECUTE_IF_SET_IN_BITMAP (blocks
, 0, i
, bi
)
8104 basic_block bb
= BASIC_BLOCK_FOR_FN (cfun
, i
);
8106 /* Earlier gimple_purge_dead_eh_edges could have removed
8107 this basic block already. */
8108 gcc_assert (bb
|| changed
);
8110 changed
|= gimple_purge_dead_eh_edges (bb
);
8116 /* Purge dead abnormal call edges from basic block BB. */
8119 gimple_purge_dead_abnormal_call_edges (basic_block bb
)
8121 bool changed
= false;
8124 gimple
*stmt
= last_stmt (bb
);
8126 if (!cfun
->has_nonlocal_label
8127 && !cfun
->calls_setjmp
)
8130 if (stmt
&& stmt_can_make_abnormal_goto (stmt
))
8133 for (ei
= ei_start (bb
->succs
); (e
= ei_safe_edge (ei
)); )
8135 if (e
->flags
& EDGE_ABNORMAL
)
8137 if (e
->flags
& EDGE_FALLTHRU
)
8138 e
->flags
&= ~EDGE_ABNORMAL
;
8140 remove_edge_and_dominated_blocks (e
);
8150 /* Purge dead abnormal call edges from basic block listed in BLOCKS. */
8153 gimple_purge_all_dead_abnormal_call_edges (const_bitmap blocks
)
8155 bool changed
= false;
8159 EXECUTE_IF_SET_IN_BITMAP (blocks
, 0, i
, bi
)
8161 basic_block bb
= BASIC_BLOCK_FOR_FN (cfun
, i
);
8163 /* Earlier gimple_purge_dead_abnormal_call_edges could have removed
8164 this basic block already. */
8165 gcc_assert (bb
|| changed
);
8167 changed
|= gimple_purge_dead_abnormal_call_edges (bb
);
8173 /* This function is called whenever a new edge is created or
8177 gimple_execute_on_growing_pred (edge e
)
8179 basic_block bb
= e
->dest
;
8181 if (!gimple_seq_empty_p (phi_nodes (bb
)))
8182 reserve_phi_args_for_new_edge (bb
);
8185 /* This function is called immediately before edge E is removed from
8186 the edge vector E->dest->preds. */
8189 gimple_execute_on_shrinking_pred (edge e
)
8191 if (!gimple_seq_empty_p (phi_nodes (e
->dest
)))
8192 remove_phi_args (e
);
8195 /*---------------------------------------------------------------------------
8196 Helper functions for Loop versioning
8197 ---------------------------------------------------------------------------*/
8199 /* Adjust phi nodes for 'first' basic block. 'second' basic block is a copy
8200 of 'first'. Both of them are dominated by 'new_head' basic block. When
8201 'new_head' was created by 'second's incoming edge it received phi arguments
8202 on the edge by split_edge(). Later, additional edge 'e' was created to
8203 connect 'new_head' and 'first'. Now this routine adds phi args on this
8204 additional edge 'e' that new_head to second edge received as part of edge
8208 gimple_lv_adjust_loop_header_phi (basic_block first
, basic_block second
,
8209 basic_block new_head
, edge e
)
8212 gphi_iterator psi1
, psi2
;
8214 edge e2
= find_edge (new_head
, second
);
8216 /* Because NEW_HEAD has been created by splitting SECOND's incoming
8217 edge, we should always have an edge from NEW_HEAD to SECOND. */
8218 gcc_assert (e2
!= NULL
);
8220 /* Browse all 'second' basic block phi nodes and add phi args to
8221 edge 'e' for 'first' head. PHI args are always in correct order. */
8223 for (psi2
= gsi_start_phis (second
),
8224 psi1
= gsi_start_phis (first
);
8225 !gsi_end_p (psi2
) && !gsi_end_p (psi1
);
8226 gsi_next (&psi2
), gsi_next (&psi1
))
8230 def
= PHI_ARG_DEF (phi2
, e2
->dest_idx
);
8231 add_phi_arg (phi1
, def
, e
, gimple_phi_arg_location_from_edge (phi2
, e2
));
8236 /* Adds a if else statement to COND_BB with condition COND_EXPR.
8237 SECOND_HEAD is the destination of the THEN and FIRST_HEAD is
8238 the destination of the ELSE part. */
8241 gimple_lv_add_condition_to_bb (basic_block first_head ATTRIBUTE_UNUSED
,
8242 basic_block second_head ATTRIBUTE_UNUSED
,
8243 basic_block cond_bb
, void *cond_e
)
8245 gimple_stmt_iterator gsi
;
8246 gimple
*new_cond_expr
;
8247 tree cond_expr
= (tree
) cond_e
;
8250 /* Build new conditional expr */
8251 new_cond_expr
= gimple_build_cond_from_tree (cond_expr
,
8252 NULL_TREE
, NULL_TREE
);
8254 /* Add new cond in cond_bb. */
8255 gsi
= gsi_last_bb (cond_bb
);
8256 gsi_insert_after (&gsi
, new_cond_expr
, GSI_NEW_STMT
);
8258 /* Adjust edges appropriately to connect new head with first head
8259 as well as second head. */
8260 e0
= single_succ_edge (cond_bb
);
8261 e0
->flags
&= ~EDGE_FALLTHRU
;
8262 e0
->flags
|= EDGE_FALSE_VALUE
;
8266 /* Do book-keeping of basic block BB for the profile consistency checker.
8267 If AFTER_PASS is 0, do pre-pass accounting, or if AFTER_PASS is 1
8268 then do post-pass accounting. Store the counting in RECORD. */
8270 gimple_account_profile_record (basic_block bb
, int after_pass
,
8271 struct profile_record
*record
)
8273 gimple_stmt_iterator i
;
8274 for (i
= gsi_start_bb (bb
); !gsi_end_p (i
); gsi_next (&i
))
8276 record
->size
[after_pass
]
8277 += estimate_num_insns (gsi_stmt (i
), &eni_size_weights
);
8278 if (profile_status_for_fn (cfun
) == PROFILE_READ
)
8279 record
->time
[after_pass
]
8280 += estimate_num_insns (gsi_stmt (i
),
8281 &eni_time_weights
) * bb
->count
;
8282 else if (profile_status_for_fn (cfun
) == PROFILE_GUESSED
)
8283 record
->time
[after_pass
]
8284 += estimate_num_insns (gsi_stmt (i
),
8285 &eni_time_weights
) * bb
->frequency
;
8289 struct cfg_hooks gimple_cfg_hooks
= {
8291 gimple_verify_flow_info
,
8292 gimple_dump_bb
, /* dump_bb */
8293 gimple_dump_bb_for_graph
, /* dump_bb_for_graph */
8294 create_bb
, /* create_basic_block */
8295 gimple_redirect_edge_and_branch
, /* redirect_edge_and_branch */
8296 gimple_redirect_edge_and_branch_force
, /* redirect_edge_and_branch_force */
8297 gimple_can_remove_branch_p
, /* can_remove_branch_p */
8298 remove_bb
, /* delete_basic_block */
8299 gimple_split_block
, /* split_block */
8300 gimple_move_block_after
, /* move_block_after */
8301 gimple_can_merge_blocks_p
, /* can_merge_blocks_p */
8302 gimple_merge_blocks
, /* merge_blocks */
8303 gimple_predict_edge
, /* predict_edge */
8304 gimple_predicted_by_p
, /* predicted_by_p */
8305 gimple_can_duplicate_bb_p
, /* can_duplicate_block_p */
8306 gimple_duplicate_bb
, /* duplicate_block */
8307 gimple_split_edge
, /* split_edge */
8308 gimple_make_forwarder_block
, /* make_forward_block */
8309 NULL
, /* tidy_fallthru_edge */
8310 NULL
, /* force_nonfallthru */
8311 gimple_block_ends_with_call_p
,/* block_ends_with_call_p */
8312 gimple_block_ends_with_condjump_p
, /* block_ends_with_condjump_p */
8313 gimple_flow_call_edges_add
, /* flow_call_edges_add */
8314 gimple_execute_on_growing_pred
, /* execute_on_growing_pred */
8315 gimple_execute_on_shrinking_pred
, /* execute_on_shrinking_pred */
8316 gimple_duplicate_loop_to_header_edge
, /* duplicate loop for trees */
8317 gimple_lv_add_condition_to_bb
, /* lv_add_condition_to_bb */
8318 gimple_lv_adjust_loop_header_phi
, /* lv_adjust_loop_header_phi*/
8319 extract_true_false_edges_from_block
, /* extract_cond_bb_edges */
8320 flush_pending_stmts
, /* flush_pending_stmts */
8321 gimple_empty_block_p
, /* block_empty_p */
8322 gimple_split_block_before_cond_jump
, /* split_block_before_cond_jump */
8323 gimple_account_profile_record
,
8327 /* Split all critical edges. */
8330 split_critical_edges (void)
8336 /* split_edge can redirect edges out of SWITCH_EXPRs, which can get
8337 expensive. So we want to enable recording of edge to CASE_LABEL_EXPR
8338 mappings around the calls to split_edge. */
8339 start_recording_case_labels ();
8340 FOR_ALL_BB_FN (bb
, cfun
)
8342 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
8344 if (EDGE_CRITICAL_P (e
) && !(e
->flags
& EDGE_ABNORMAL
))
8346 /* PRE inserts statements to edges and expects that
8347 since split_critical_edges was done beforehand, committing edge
8348 insertions will not split more edges. In addition to critical
8349 edges we must split edges that have multiple successors and
8350 end by control flow statements, such as RESX.
8351 Go ahead and split them too. This matches the logic in
8352 gimple_find_edge_insert_loc. */
8353 else if ((!single_pred_p (e
->dest
)
8354 || !gimple_seq_empty_p (phi_nodes (e
->dest
))
8355 || e
->dest
== EXIT_BLOCK_PTR_FOR_FN (cfun
))
8356 && e
->src
!= ENTRY_BLOCK_PTR_FOR_FN (cfun
)
8357 && !(e
->flags
& EDGE_ABNORMAL
))
8359 gimple_stmt_iterator gsi
;
8361 gsi
= gsi_last_bb (e
->src
);
8362 if (!gsi_end_p (gsi
)
8363 && stmt_ends_bb_p (gsi_stmt (gsi
))
8364 && (gimple_code (gsi_stmt (gsi
)) != GIMPLE_RETURN
8365 && !gimple_call_builtin_p (gsi_stmt (gsi
),
8371 end_recording_case_labels ();
8377 const pass_data pass_data_split_crit_edges
=
8379 GIMPLE_PASS
, /* type */
8380 "crited", /* name */
8381 OPTGROUP_NONE
, /* optinfo_flags */
8382 TV_TREE_SPLIT_EDGES
, /* tv_id */
8383 PROP_cfg
, /* properties_required */
8384 PROP_no_crit_edges
, /* properties_provided */
8385 0, /* properties_destroyed */
8386 0, /* todo_flags_start */
8387 0, /* todo_flags_finish */
8390 class pass_split_crit_edges
: public gimple_opt_pass
8393 pass_split_crit_edges (gcc::context
*ctxt
)
8394 : gimple_opt_pass (pass_data_split_crit_edges
, ctxt
)
8397 /* opt_pass methods: */
8398 virtual unsigned int execute (function
*) { return split_critical_edges (); }
8400 opt_pass
* clone () { return new pass_split_crit_edges (m_ctxt
); }
8401 }; // class pass_split_crit_edges
8406 make_pass_split_crit_edges (gcc::context
*ctxt
)
8408 return new pass_split_crit_edges (ctxt
);
8412 /* Insert COND expression which is GIMPLE_COND after STMT
8413 in basic block BB with appropriate basic block split
8414 and creation of a new conditionally executed basic block.
8415 Return created basic block. */
8417 insert_cond_bb (basic_block bb
, gimple
*stmt
, gimple
*cond
)
8419 edge fall
= split_block (bb
, stmt
);
8420 gimple_stmt_iterator iter
= gsi_last_bb (bb
);
8423 /* Insert cond statement. */
8424 gcc_assert (gimple_code (cond
) == GIMPLE_COND
);
8425 if (gsi_end_p (iter
))
8426 gsi_insert_before (&iter
, cond
, GSI_CONTINUE_LINKING
);
8428 gsi_insert_after (&iter
, cond
, GSI_CONTINUE_LINKING
);
8430 /* Create conditionally executed block. */
8431 new_bb
= create_empty_bb (bb
);
8432 make_edge (bb
, new_bb
, EDGE_TRUE_VALUE
);
8433 make_single_succ_edge (new_bb
, fall
->dest
, EDGE_FALLTHRU
);
8435 /* Fix edge for split bb. */
8436 fall
->flags
= EDGE_FALSE_VALUE
;
8438 /* Update dominance info. */
8439 if (dom_info_available_p (CDI_DOMINATORS
))
8441 set_immediate_dominator (CDI_DOMINATORS
, new_bb
, bb
);
8442 set_immediate_dominator (CDI_DOMINATORS
, fall
->dest
, bb
);
8445 /* Update loop info. */
8447 add_bb_to_loop (new_bb
, bb
->loop_father
);
8452 /* Build a ternary operation and gimplify it. Emit code before GSI.
8453 Return the gimple_val holding the result. */
8456 gimplify_build3 (gimple_stmt_iterator
*gsi
, enum tree_code code
,
8457 tree type
, tree a
, tree b
, tree c
)
8460 location_t loc
= gimple_location (gsi_stmt (*gsi
));
8462 ret
= fold_build3_loc (loc
, code
, type
, a
, b
, c
);
8465 return force_gimple_operand_gsi (gsi
, ret
, true, NULL
, true,
8469 /* Build a binary operation and gimplify it. Emit code before GSI.
8470 Return the gimple_val holding the result. */
8473 gimplify_build2 (gimple_stmt_iterator
*gsi
, enum tree_code code
,
8474 tree type
, tree a
, tree b
)
8478 ret
= fold_build2_loc (gimple_location (gsi_stmt (*gsi
)), code
, type
, a
, b
);
8481 return force_gimple_operand_gsi (gsi
, ret
, true, NULL
, true,
8485 /* Build a unary operation and gimplify it. Emit code before GSI.
8486 Return the gimple_val holding the result. */
8489 gimplify_build1 (gimple_stmt_iterator
*gsi
, enum tree_code code
, tree type
,
8494 ret
= fold_build1_loc (gimple_location (gsi_stmt (*gsi
)), code
, type
, a
);
8497 return force_gimple_operand_gsi (gsi
, ret
, true, NULL
, true,
8503 /* Given a basic block B which ends with a conditional and has
8504 precisely two successors, determine which of the edges is taken if
8505 the conditional is true and which is taken if the conditional is
8506 false. Set TRUE_EDGE and FALSE_EDGE appropriately. */
8509 extract_true_false_edges_from_block (basic_block b
,
8513 edge e
= EDGE_SUCC (b
, 0);
8515 if (e
->flags
& EDGE_TRUE_VALUE
)
8518 *false_edge
= EDGE_SUCC (b
, 1);
8523 *true_edge
= EDGE_SUCC (b
, 1);
8528 /* From a controlling predicate in the immediate dominator DOM of
8529 PHIBLOCK determine the edges into PHIBLOCK that are chosen if the
8530 predicate evaluates to true and false and store them to
8531 *TRUE_CONTROLLED_EDGE and *FALSE_CONTROLLED_EDGE if
8532 they are non-NULL. Returns true if the edges can be determined,
8533 else return false. */
8536 extract_true_false_controlled_edges (basic_block dom
, basic_block phiblock
,
8537 edge
*true_controlled_edge
,
8538 edge
*false_controlled_edge
)
8540 basic_block bb
= phiblock
;
8541 edge true_edge
, false_edge
, tem
;
8542 edge e0
= NULL
, e1
= NULL
;
8544 /* We have to verify that one edge into the PHI node is dominated
8545 by the true edge of the predicate block and the other edge
8546 dominated by the false edge. This ensures that the PHI argument
8547 we are going to take is completely determined by the path we
8548 take from the predicate block.
8549 We can only use BB dominance checks below if the destination of
8550 the true/false edges are dominated by their edge, thus only
8551 have a single predecessor. */
8552 extract_true_false_edges_from_block (dom
, &true_edge
, &false_edge
);
8553 tem
= EDGE_PRED (bb
, 0);
8554 if (tem
== true_edge
8555 || (single_pred_p (true_edge
->dest
)
8556 && (tem
->src
== true_edge
->dest
8557 || dominated_by_p (CDI_DOMINATORS
,
8558 tem
->src
, true_edge
->dest
))))
8560 else if (tem
== false_edge
8561 || (single_pred_p (false_edge
->dest
)
8562 && (tem
->src
== false_edge
->dest
8563 || dominated_by_p (CDI_DOMINATORS
,
8564 tem
->src
, false_edge
->dest
))))
8568 tem
= EDGE_PRED (bb
, 1);
8569 if (tem
== true_edge
8570 || (single_pred_p (true_edge
->dest
)
8571 && (tem
->src
== true_edge
->dest
8572 || dominated_by_p (CDI_DOMINATORS
,
8573 tem
->src
, true_edge
->dest
))))
8575 else if (tem
== false_edge
8576 || (single_pred_p (false_edge
->dest
)
8577 && (tem
->src
== false_edge
->dest
8578 || dominated_by_p (CDI_DOMINATORS
,
8579 tem
->src
, false_edge
->dest
))))
8586 if (true_controlled_edge
)
8587 *true_controlled_edge
= e0
;
8588 if (false_controlled_edge
)
8589 *false_controlled_edge
= e1
;
8596 /* Emit return warnings. */
8600 const pass_data pass_data_warn_function_return
=
8602 GIMPLE_PASS
, /* type */
8603 "*warn_function_return", /* name */
8604 OPTGROUP_NONE
, /* optinfo_flags */
8605 TV_NONE
, /* tv_id */
8606 PROP_cfg
, /* properties_required */
8607 0, /* properties_provided */
8608 0, /* properties_destroyed */
8609 0, /* todo_flags_start */
8610 0, /* todo_flags_finish */
8613 class pass_warn_function_return
: public gimple_opt_pass
8616 pass_warn_function_return (gcc::context
*ctxt
)
8617 : gimple_opt_pass (pass_data_warn_function_return
, ctxt
)
8620 /* opt_pass methods: */
8621 virtual unsigned int execute (function
*);
8623 }; // class pass_warn_function_return
8626 pass_warn_function_return::execute (function
*fun
)
8628 source_location location
;
8633 if (!targetm
.warn_func_return (fun
->decl
))
8636 /* If we have a path to EXIT, then we do return. */
8637 if (TREE_THIS_VOLATILE (fun
->decl
)
8638 && EDGE_COUNT (EXIT_BLOCK_PTR_FOR_FN (fun
)->preds
) > 0)
8640 location
= UNKNOWN_LOCATION
;
8641 FOR_EACH_EDGE (e
, ei
, EXIT_BLOCK_PTR_FOR_FN (fun
)->preds
)
8643 last
= last_stmt (e
->src
);
8644 if ((gimple_code (last
) == GIMPLE_RETURN
8645 || gimple_call_builtin_p (last
, BUILT_IN_RETURN
))
8646 && (location
= gimple_location (last
)) != UNKNOWN_LOCATION
)
8649 if (location
== UNKNOWN_LOCATION
)
8650 location
= cfun
->function_end_locus
;
8651 warning_at (location
, 0, "%<noreturn%> function does return");
8654 /* If we see "return;" in some basic block, then we do reach the end
8655 without returning a value. */
8656 else if (warn_return_type
8657 && !TREE_NO_WARNING (fun
->decl
)
8658 && EDGE_COUNT (EXIT_BLOCK_PTR_FOR_FN (fun
)->preds
) > 0
8659 && !VOID_TYPE_P (TREE_TYPE (TREE_TYPE (fun
->decl
))))
8661 FOR_EACH_EDGE (e
, ei
, EXIT_BLOCK_PTR_FOR_FN (fun
)->preds
)
8663 gimple
*last
= last_stmt (e
->src
);
8664 greturn
*return_stmt
= dyn_cast
<greturn
*> (last
);
8666 && gimple_return_retval (return_stmt
) == NULL
8667 && !gimple_no_warning_p (last
))
8669 location
= gimple_location (last
);
8670 if (location
== UNKNOWN_LOCATION
)
8671 location
= fun
->function_end_locus
;
8672 warning_at (location
, OPT_Wreturn_type
, "control reaches end of non-void function");
8673 TREE_NO_WARNING (fun
->decl
) = 1;
8684 make_pass_warn_function_return (gcc::context
*ctxt
)
8686 return new pass_warn_function_return (ctxt
);
8689 /* Walk a gimplified function and warn for functions whose return value is
8690 ignored and attribute((warn_unused_result)) is set. This is done before
8691 inlining, so we don't have to worry about that. */
8694 do_warn_unused_result (gimple_seq seq
)
8697 gimple_stmt_iterator i
;
8699 for (i
= gsi_start (seq
); !gsi_end_p (i
); gsi_next (&i
))
8701 gimple
*g
= gsi_stmt (i
);
8703 switch (gimple_code (g
))
8706 do_warn_unused_result (gimple_bind_body (as_a
<gbind
*>(g
)));
8709 do_warn_unused_result (gimple_try_eval (g
));
8710 do_warn_unused_result (gimple_try_cleanup (g
));
8713 do_warn_unused_result (gimple_catch_handler (
8714 as_a
<gcatch
*> (g
)));
8716 case GIMPLE_EH_FILTER
:
8717 do_warn_unused_result (gimple_eh_filter_failure (g
));
8721 if (gimple_call_lhs (g
))
8723 if (gimple_call_internal_p (g
))
8726 /* This is a naked call, as opposed to a GIMPLE_CALL with an
8727 LHS. All calls whose value is ignored should be
8728 represented like this. Look for the attribute. */
8729 fdecl
= gimple_call_fndecl (g
);
8730 ftype
= gimple_call_fntype (g
);
8732 if (lookup_attribute ("warn_unused_result", TYPE_ATTRIBUTES (ftype
)))
8734 location_t loc
= gimple_location (g
);
8737 warning_at (loc
, OPT_Wunused_result
,
8738 "ignoring return value of %qD, "
8739 "declared with attribute warn_unused_result",
8742 warning_at (loc
, OPT_Wunused_result
,
8743 "ignoring return value of function "
8744 "declared with attribute warn_unused_result");
8749 /* Not a container, not a call, or a call whose value is used. */
8757 const pass_data pass_data_warn_unused_result
=
8759 GIMPLE_PASS
, /* type */
8760 "*warn_unused_result", /* name */
8761 OPTGROUP_NONE
, /* optinfo_flags */
8762 TV_NONE
, /* tv_id */
8763 PROP_gimple_any
, /* properties_required */
8764 0, /* properties_provided */
8765 0, /* properties_destroyed */
8766 0, /* todo_flags_start */
8767 0, /* todo_flags_finish */
8770 class pass_warn_unused_result
: public gimple_opt_pass
8773 pass_warn_unused_result (gcc::context
*ctxt
)
8774 : gimple_opt_pass (pass_data_warn_unused_result
, ctxt
)
8777 /* opt_pass methods: */
8778 virtual bool gate (function
*) { return flag_warn_unused_result
; }
8779 virtual unsigned int execute (function
*)
8781 do_warn_unused_result (gimple_body (current_function_decl
));
8785 }; // class pass_warn_unused_result
8790 make_pass_warn_unused_result (gcc::context
*ctxt
)
8792 return new pass_warn_unused_result (ctxt
);
8795 /* IPA passes, compilation of earlier functions or inlining
8796 might have changed some properties, such as marked functions nothrow,
8797 pure, const or noreturn.
8798 Remove redundant edges and basic blocks, and create new ones if necessary.
8800 This pass can't be executed as stand alone pass from pass manager, because
8801 in between inlining and this fixup the verify_flow_info would fail. */
8804 execute_fixup_cfg (void)
8807 gimple_stmt_iterator gsi
;
8809 gcov_type count_scale
;
8814 = GCOV_COMPUTE_SCALE (cgraph_node::get (current_function_decl
)->count
,
8815 ENTRY_BLOCK_PTR_FOR_FN (cfun
)->count
);
8817 ENTRY_BLOCK_PTR_FOR_FN (cfun
)->count
=
8818 cgraph_node::get (current_function_decl
)->count
;
8819 EXIT_BLOCK_PTR_FOR_FN (cfun
)->count
=
8820 apply_scale (EXIT_BLOCK_PTR_FOR_FN (cfun
)->count
,
8823 FOR_EACH_EDGE (e
, ei
, ENTRY_BLOCK_PTR_FOR_FN (cfun
)->succs
)
8824 e
->count
= apply_scale (e
->count
, count_scale
);
8826 FOR_EACH_BB_FN (bb
, cfun
)
8828 bb
->count
= apply_scale (bb
->count
, count_scale
);
8829 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
);)
8831 gimple
*stmt
= gsi_stmt (gsi
);
8832 tree decl
= is_gimple_call (stmt
)
8833 ? gimple_call_fndecl (stmt
)
8837 int flags
= gimple_call_flags (stmt
);
8838 if (flags
& (ECF_CONST
| ECF_PURE
| ECF_LOOPING_CONST_OR_PURE
))
8840 if (gimple_purge_dead_abnormal_call_edges (bb
))
8841 todo
|= TODO_cleanup_cfg
;
8843 if (gimple_in_ssa_p (cfun
))
8845 todo
|= TODO_update_ssa
| TODO_cleanup_cfg
;
8850 if (flags
& ECF_NORETURN
8851 && fixup_noreturn_call (stmt
))
8852 todo
|= TODO_cleanup_cfg
;
8855 /* Remove stores to variables we marked write-only.
8856 Keep access when store has side effect, i.e. in case when source
8858 if (gimple_store_p (stmt
)
8859 && !gimple_has_side_effects (stmt
))
8861 tree lhs
= get_base_address (gimple_get_lhs (stmt
));
8863 if (TREE_CODE (lhs
) == VAR_DECL
8864 && (TREE_STATIC (lhs
) || DECL_EXTERNAL (lhs
))
8865 && varpool_node::get (lhs
)->writeonly
)
8867 unlink_stmt_vdef (stmt
);
8868 gsi_remove (&gsi
, true);
8869 release_defs (stmt
);
8870 todo
|= TODO_update_ssa
| TODO_cleanup_cfg
;
8874 /* For calls we can simply remove LHS when it is known
8875 to be write-only. */
8876 if (is_gimple_call (stmt
)
8877 && gimple_get_lhs (stmt
))
8879 tree lhs
= get_base_address (gimple_get_lhs (stmt
));
8881 if (TREE_CODE (lhs
) == VAR_DECL
8882 && (TREE_STATIC (lhs
) || DECL_EXTERNAL (lhs
))
8883 && varpool_node::get (lhs
)->writeonly
)
8885 gimple_call_set_lhs (stmt
, NULL
);
8887 todo
|= TODO_update_ssa
| TODO_cleanup_cfg
;
8891 if (maybe_clean_eh_stmt (stmt
)
8892 && gimple_purge_dead_eh_edges (bb
))
8893 todo
|= TODO_cleanup_cfg
;
8897 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
8898 e
->count
= apply_scale (e
->count
, count_scale
);
8900 /* If we have a basic block with no successors that does not
8901 end with a control statement or a noreturn call end it with
8902 a call to __builtin_unreachable. This situation can occur
8903 when inlining a noreturn call that does in fact return. */
8904 if (EDGE_COUNT (bb
->succs
) == 0)
8906 gimple
*stmt
= last_stmt (bb
);
8908 || (!is_ctrl_stmt (stmt
)
8909 && (!is_gimple_call (stmt
)
8910 || (gimple_call_flags (stmt
) & ECF_NORETURN
) == 0)))
8912 if (stmt
&& is_gimple_call (stmt
))
8913 gimple_call_set_ctrl_altering (stmt
, false);
8914 stmt
= gimple_build_call
8915 (builtin_decl_implicit (BUILT_IN_UNREACHABLE
), 0);
8916 gimple_stmt_iterator gsi
= gsi_last_bb (bb
);
8917 gsi_insert_after (&gsi
, stmt
, GSI_NEW_STMT
);
8921 if (count_scale
!= REG_BR_PROB_BASE
)
8922 compute_function_frequency ();
8925 && (todo
& TODO_cleanup_cfg
))
8926 loops_state_set (LOOPS_NEED_FIXUP
);
8933 const pass_data pass_data_fixup_cfg
=
8935 GIMPLE_PASS
, /* type */
8936 "fixup_cfg", /* name */
8937 OPTGROUP_NONE
, /* optinfo_flags */
8938 TV_NONE
, /* tv_id */
8939 PROP_cfg
, /* properties_required */
8940 0, /* properties_provided */
8941 0, /* properties_destroyed */
8942 0, /* todo_flags_start */
8943 0, /* todo_flags_finish */
8946 class pass_fixup_cfg
: public gimple_opt_pass
8949 pass_fixup_cfg (gcc::context
*ctxt
)
8950 : gimple_opt_pass (pass_data_fixup_cfg
, ctxt
)
8953 /* opt_pass methods: */
8954 opt_pass
* clone () { return new pass_fixup_cfg (m_ctxt
); }
8955 virtual unsigned int execute (function
*) { return execute_fixup_cfg (); }
8957 }; // class pass_fixup_cfg
8962 make_pass_fixup_cfg (gcc::context
*ctxt
)
8964 return new pass_fixup_cfg (ctxt
);
8967 /* Garbage collection support for edge_def. */
8969 extern void gt_ggc_mx (tree
&);
8970 extern void gt_ggc_mx (gimple
*&);
8971 extern void gt_ggc_mx (rtx
&);
8972 extern void gt_ggc_mx (basic_block
&);
8975 gt_ggc_mx (rtx_insn
*& x
)
8978 gt_ggc_mx_rtx_def ((void *) x
);
8982 gt_ggc_mx (edge_def
*e
)
8984 tree block
= LOCATION_BLOCK (e
->goto_locus
);
8986 gt_ggc_mx (e
->dest
);
8987 if (current_ir_type () == IR_GIMPLE
)
8988 gt_ggc_mx (e
->insns
.g
);
8990 gt_ggc_mx (e
->insns
.r
);
8994 /* PCH support for edge_def. */
8996 extern void gt_pch_nx (tree
&);
8997 extern void gt_pch_nx (gimple
*&);
8998 extern void gt_pch_nx (rtx
&);
8999 extern void gt_pch_nx (basic_block
&);
9002 gt_pch_nx (rtx_insn
*& x
)
9005 gt_pch_nx_rtx_def ((void *) x
);
9009 gt_pch_nx (edge_def
*e
)
9011 tree block
= LOCATION_BLOCK (e
->goto_locus
);
9013 gt_pch_nx (e
->dest
);
9014 if (current_ir_type () == IR_GIMPLE
)
9015 gt_pch_nx (e
->insns
.g
);
9017 gt_pch_nx (e
->insns
.r
);
9022 gt_pch_nx (edge_def
*e
, gt_pointer_operator op
, void *cookie
)
9024 tree block
= LOCATION_BLOCK (e
->goto_locus
);
9025 op (&(e
->src
), cookie
);
9026 op (&(e
->dest
), cookie
);
9027 if (current_ir_type () == IR_GIMPLE
)
9028 op (&(e
->insns
.g
), cookie
);
9030 op (&(e
->insns
.r
), cookie
);
9031 op (&(block
), cookie
);