1 /* Control flow functions for trees.
2 Copyright (C) 2001-2018 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"
33 #include "gimple-pretty-print.h"
34 #include "diagnostic-core.h"
35 #include "fold-const.h"
36 #include "trans-mem.h"
37 #include "stor-layout.h"
38 #include "print-tree.h"
40 #include "gimple-fold.h"
42 #include "gimple-iterator.h"
43 #include "gimplify-me.h"
44 #include "gimple-walk.h"
46 #include "tree-ssa-loop-manip.h"
47 #include "tree-ssa-loop-niter.h"
48 #include "tree-into-ssa.h"
53 #include "tree-ssa-propagate.h"
54 #include "value-prof.h"
55 #include "tree-inline.h"
56 #include "tree-ssa-live.h"
57 #include "omp-general.h"
58 #include "omp-expand.h"
59 #include "tree-cfgcleanup.h"
66 /* This file contains functions for building the Control Flow Graph (CFG)
67 for a function tree. */
69 /* Local declarations. */
71 /* Initial capacity for the basic block array. */
72 static const int initial_cfg_capacity
= 20;
74 /* This hash table allows us to efficiently lookup all CASE_LABEL_EXPRs
75 which use a particular edge. The CASE_LABEL_EXPRs are chained together
76 via their CASE_CHAIN field, which we clear after we're done with the
77 hash table to prevent problems with duplication of GIMPLE_SWITCHes.
79 Access to this list of CASE_LABEL_EXPRs allows us to efficiently
80 update the case vector in response to edge redirections.
82 Right now this table is set up and torn down at key points in the
83 compilation process. It would be nice if we could make the table
84 more persistent. The key is getting notification of changes to
85 the CFG (particularly edge removal, creation and redirection). */
87 static hash_map
<edge
, tree
> *edge_to_cases
;
89 /* If we record edge_to_cases, this bitmap will hold indexes
90 of basic blocks that end in a GIMPLE_SWITCH which we touched
91 due to edge manipulations. */
93 static bitmap touched_switch_bbs
;
98 long num_merged_labels
;
101 static struct cfg_stats_d cfg_stats
;
103 /* Data to pass to replace_block_vars_by_duplicates_1. */
104 struct replace_decls_d
106 hash_map
<tree
, tree
> *vars_map
;
110 /* Hash table to store last discriminator assigned for each locus. */
111 struct locus_discrim_map
117 /* Hashtable helpers. */
119 struct locus_discrim_hasher
: free_ptr_hash
<locus_discrim_map
>
121 static inline hashval_t
hash (const locus_discrim_map
*);
122 static inline bool equal (const locus_discrim_map
*,
123 const locus_discrim_map
*);
126 /* Trivial hash function for a location_t. ITEM is a pointer to
127 a hash table entry that maps a location_t to a discriminator. */
130 locus_discrim_hasher::hash (const locus_discrim_map
*item
)
132 return LOCATION_LINE (item
->locus
);
135 /* Equality function for the locus-to-discriminator map. A and B
136 point to the two hash table entries to compare. */
139 locus_discrim_hasher::equal (const locus_discrim_map
*a
,
140 const locus_discrim_map
*b
)
142 return LOCATION_LINE (a
->locus
) == LOCATION_LINE (b
->locus
);
145 static hash_table
<locus_discrim_hasher
> *discriminator_per_locus
;
147 /* Basic blocks and flowgraphs. */
148 static void make_blocks (gimple_seq
);
151 static void make_edges (void);
152 static void assign_discriminators (void);
153 static void make_cond_expr_edges (basic_block
);
154 static void make_gimple_switch_edges (gswitch
*, basic_block
);
155 static bool make_goto_expr_edges (basic_block
);
156 static void make_gimple_asm_edges (basic_block
);
157 static edge
gimple_redirect_edge_and_branch (edge
, basic_block
);
158 static edge
gimple_try_redirect_by_replacing_jump (edge
, basic_block
);
160 /* Various helpers. */
161 static inline bool stmt_starts_bb_p (gimple
*, gimple
*);
162 static int gimple_verify_flow_info (void);
163 static void gimple_make_forwarder_block (edge
);
164 static gimple
*first_non_label_stmt (basic_block
);
165 static bool verify_gimple_transaction (gtransaction
*);
166 static bool call_can_make_abnormal_goto (gimple
*);
168 /* Flowgraph optimization and cleanup. */
169 static void gimple_merge_blocks (basic_block
, basic_block
);
170 static bool gimple_can_merge_blocks_p (basic_block
, basic_block
);
171 static void remove_bb (basic_block
);
172 static edge
find_taken_edge_computed_goto (basic_block
, tree
);
173 static edge
find_taken_edge_cond_expr (const gcond
*, tree
);
174 static edge
find_taken_edge_switch_expr (const gswitch
*, tree
);
175 static tree
find_case_label_for_value (const gswitch
*, tree
);
176 static void lower_phi_internal_fn ();
179 init_empty_tree_cfg_for_function (struct function
*fn
)
181 /* Initialize the basic block array. */
183 profile_status_for_fn (fn
) = PROFILE_ABSENT
;
184 n_basic_blocks_for_fn (fn
) = NUM_FIXED_BLOCKS
;
185 last_basic_block_for_fn (fn
) = NUM_FIXED_BLOCKS
;
186 vec_alloc (basic_block_info_for_fn (fn
), initial_cfg_capacity
);
187 vec_safe_grow_cleared (basic_block_info_for_fn (fn
),
188 initial_cfg_capacity
);
190 /* Build a mapping of labels to their associated blocks. */
191 vec_alloc (label_to_block_map_for_fn (fn
), initial_cfg_capacity
);
192 vec_safe_grow_cleared (label_to_block_map_for_fn (fn
),
193 initial_cfg_capacity
);
195 SET_BASIC_BLOCK_FOR_FN (fn
, ENTRY_BLOCK
, ENTRY_BLOCK_PTR_FOR_FN (fn
));
196 SET_BASIC_BLOCK_FOR_FN (fn
, EXIT_BLOCK
, EXIT_BLOCK_PTR_FOR_FN (fn
));
198 ENTRY_BLOCK_PTR_FOR_FN (fn
)->next_bb
199 = EXIT_BLOCK_PTR_FOR_FN (fn
);
200 EXIT_BLOCK_PTR_FOR_FN (fn
)->prev_bb
201 = ENTRY_BLOCK_PTR_FOR_FN (fn
);
205 init_empty_tree_cfg (void)
207 init_empty_tree_cfg_for_function (cfun
);
210 /*---------------------------------------------------------------------------
212 ---------------------------------------------------------------------------*/
214 /* Entry point to the CFG builder for trees. SEQ is the sequence of
215 statements to be added to the flowgraph. */
218 build_gimple_cfg (gimple_seq seq
)
220 /* Register specific gimple functions. */
221 gimple_register_cfg_hooks ();
223 memset ((void *) &cfg_stats
, 0, sizeof (cfg_stats
));
225 init_empty_tree_cfg ();
229 /* Make sure there is always at least one block, even if it's empty. */
230 if (n_basic_blocks_for_fn (cfun
) == NUM_FIXED_BLOCKS
)
231 create_empty_bb (ENTRY_BLOCK_PTR_FOR_FN (cfun
));
233 /* Adjust the size of the array. */
234 if (basic_block_info_for_fn (cfun
)->length ()
235 < (size_t) n_basic_blocks_for_fn (cfun
))
236 vec_safe_grow_cleared (basic_block_info_for_fn (cfun
),
237 n_basic_blocks_for_fn (cfun
));
239 /* To speed up statement iterator walks, we first purge dead labels. */
240 cleanup_dead_labels ();
242 /* Group case nodes to reduce the number of edges.
243 We do this after cleaning up dead labels because otherwise we miss
244 a lot of obvious case merging opportunities. */
245 group_case_labels ();
247 /* Create the edges of the flowgraph. */
248 discriminator_per_locus
= new hash_table
<locus_discrim_hasher
> (13);
250 assign_discriminators ();
251 lower_phi_internal_fn ();
252 cleanup_dead_labels ();
253 delete discriminator_per_locus
;
254 discriminator_per_locus
= NULL
;
257 /* Look for ANNOTATE calls with loop annotation kind in BB; if found, remove
258 them and propagate the information to LOOP. We assume that the annotations
259 come immediately before the condition in BB, if any. */
262 replace_loop_annotate_in_block (basic_block bb
, struct loop
*loop
)
264 gimple_stmt_iterator gsi
= gsi_last_bb (bb
);
265 gimple
*stmt
= gsi_stmt (gsi
);
267 if (!(stmt
&& gimple_code (stmt
) == GIMPLE_COND
))
270 for (gsi_prev_nondebug (&gsi
); !gsi_end_p (gsi
); gsi_prev (&gsi
))
272 stmt
= gsi_stmt (gsi
);
273 if (gimple_code (stmt
) != GIMPLE_CALL
)
275 if (!gimple_call_internal_p (stmt
)
276 || gimple_call_internal_fn (stmt
) != IFN_ANNOTATE
)
279 switch ((annot_expr_kind
) tree_to_shwi (gimple_call_arg (stmt
, 1)))
281 case annot_expr_ivdep_kind
:
282 loop
->safelen
= INT_MAX
;
284 case annot_expr_unroll_kind
:
286 = (unsigned short) tree_to_shwi (gimple_call_arg (stmt
, 2));
287 cfun
->has_unroll
= true;
289 case annot_expr_no_vector_kind
:
290 loop
->dont_vectorize
= true;
292 case annot_expr_vector_kind
:
293 loop
->force_vectorize
= true;
294 cfun
->has_force_vectorize_loops
= true;
296 case annot_expr_parallel_kind
:
297 loop
->can_be_parallel
= true;
298 loop
->safelen
= INT_MAX
;
304 stmt
= gimple_build_assign (gimple_call_lhs (stmt
),
305 gimple_call_arg (stmt
, 0));
306 gsi_replace (&gsi
, stmt
, true);
310 /* Look for ANNOTATE calls with loop annotation kind; if found, remove
311 them and propagate the information to the loop. We assume that the
312 annotations come immediately before the condition of the loop. */
315 replace_loop_annotate (void)
319 gimple_stmt_iterator gsi
;
322 FOR_EACH_LOOP (loop
, 0)
324 /* First look into the header. */
325 replace_loop_annotate_in_block (loop
->header
, loop
);
327 /* Then look into the latch, if any. */
329 replace_loop_annotate_in_block (loop
->latch
, loop
);
332 /* Remove IFN_ANNOTATE. Safeguard for the case loop->latch == NULL. */
333 FOR_EACH_BB_FN (bb
, cfun
)
335 for (gsi
= gsi_last_bb (bb
); !gsi_end_p (gsi
); gsi_prev (&gsi
))
337 stmt
= gsi_stmt (gsi
);
338 if (gimple_code (stmt
) != GIMPLE_CALL
)
340 if (!gimple_call_internal_p (stmt
)
341 || gimple_call_internal_fn (stmt
) != IFN_ANNOTATE
)
344 switch ((annot_expr_kind
) tree_to_shwi (gimple_call_arg (stmt
, 1)))
346 case annot_expr_ivdep_kind
:
347 case annot_expr_unroll_kind
:
348 case annot_expr_no_vector_kind
:
349 case annot_expr_vector_kind
:
350 case annot_expr_parallel_kind
:
356 warning_at (gimple_location (stmt
), 0, "ignoring loop annotation");
357 stmt
= gimple_build_assign (gimple_call_lhs (stmt
),
358 gimple_call_arg (stmt
, 0));
359 gsi_replace (&gsi
, stmt
, true);
364 /* Lower internal PHI function from GIMPLE FE. */
367 lower_phi_internal_fn ()
369 basic_block bb
, pred
= NULL
;
370 gimple_stmt_iterator gsi
;
375 /* After edge creation, handle __PHI function from GIMPLE FE. */
376 FOR_EACH_BB_FN (bb
, cfun
)
378 for (gsi
= gsi_after_labels (bb
); !gsi_end_p (gsi
);)
380 stmt
= gsi_stmt (gsi
);
381 if (! gimple_call_internal_p (stmt
, IFN_PHI
))
384 lhs
= gimple_call_lhs (stmt
);
385 phi_node
= create_phi_node (lhs
, bb
);
387 /* Add arguments to the PHI node. */
388 for (unsigned i
= 0; i
< gimple_call_num_args (stmt
); ++i
)
390 tree arg
= gimple_call_arg (stmt
, i
);
391 if (TREE_CODE (arg
) == LABEL_DECL
)
392 pred
= label_to_block (arg
);
395 edge e
= find_edge (pred
, bb
);
396 add_phi_arg (phi_node
, arg
, e
, UNKNOWN_LOCATION
);
400 gsi_remove (&gsi
, true);
406 execute_build_cfg (void)
408 gimple_seq body
= gimple_body (current_function_decl
);
410 build_gimple_cfg (body
);
411 gimple_set_body (current_function_decl
, NULL
);
412 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
414 fprintf (dump_file
, "Scope blocks:\n");
415 dump_scope_blocks (dump_file
, dump_flags
);
418 loop_optimizer_init (AVOID_CFG_MODIFICATIONS
);
419 replace_loop_annotate ();
425 const pass_data pass_data_build_cfg
=
427 GIMPLE_PASS
, /* type */
429 OPTGROUP_NONE
, /* optinfo_flags */
430 TV_TREE_CFG
, /* tv_id */
431 PROP_gimple_leh
, /* properties_required */
432 ( PROP_cfg
| PROP_loops
), /* properties_provided */
433 0, /* properties_destroyed */
434 0, /* todo_flags_start */
435 0, /* todo_flags_finish */
438 class pass_build_cfg
: public gimple_opt_pass
441 pass_build_cfg (gcc::context
*ctxt
)
442 : gimple_opt_pass (pass_data_build_cfg
, ctxt
)
445 /* opt_pass methods: */
446 virtual unsigned int execute (function
*) { return execute_build_cfg (); }
448 }; // class pass_build_cfg
453 make_pass_build_cfg (gcc::context
*ctxt
)
455 return new pass_build_cfg (ctxt
);
459 /* Return true if T is a computed goto. */
462 computed_goto_p (gimple
*t
)
464 return (gimple_code (t
) == GIMPLE_GOTO
465 && TREE_CODE (gimple_goto_dest (t
)) != LABEL_DECL
);
468 /* Returns true if the sequence of statements STMTS only contains
469 a call to __builtin_unreachable (). */
472 gimple_seq_unreachable_p (gimple_seq stmts
)
475 /* Return false if -fsanitize=unreachable, we don't want to
476 optimize away those calls, but rather turn them into
477 __ubsan_handle_builtin_unreachable () or __builtin_trap ()
479 || sanitize_flags_p (SANITIZE_UNREACHABLE
))
482 gimple_stmt_iterator gsi
= gsi_last (stmts
);
484 if (!gimple_call_builtin_p (gsi_stmt (gsi
), BUILT_IN_UNREACHABLE
))
487 for (gsi_prev (&gsi
); !gsi_end_p (gsi
); gsi_prev (&gsi
))
489 gimple
*stmt
= gsi_stmt (gsi
);
490 if (gimple_code (stmt
) != GIMPLE_LABEL
491 && !is_gimple_debug (stmt
)
492 && !gimple_clobber_p (stmt
))
498 /* Returns true for edge E where e->src ends with a GIMPLE_COND and
499 the other edge points to a bb with just __builtin_unreachable ().
500 I.e. return true for C->M edge in:
508 __builtin_unreachable ();
512 assert_unreachable_fallthru_edge_p (edge e
)
514 basic_block pred_bb
= e
->src
;
515 gimple
*last
= last_stmt (pred_bb
);
516 if (last
&& gimple_code (last
) == GIMPLE_COND
)
518 basic_block other_bb
= EDGE_SUCC (pred_bb
, 0)->dest
;
519 if (other_bb
== e
->dest
)
520 other_bb
= EDGE_SUCC (pred_bb
, 1)->dest
;
521 if (EDGE_COUNT (other_bb
->succs
) == 0)
522 return gimple_seq_unreachable_p (bb_seq (other_bb
));
528 /* Initialize GF_CALL_CTRL_ALTERING flag, which indicates the call
529 could alter control flow except via eh. We initialize the flag at
530 CFG build time and only ever clear it later. */
533 gimple_call_initialize_ctrl_altering (gimple
*stmt
)
535 int flags
= gimple_call_flags (stmt
);
537 /* A call alters control flow if it can make an abnormal goto. */
538 if (call_can_make_abnormal_goto (stmt
)
539 /* A call also alters control flow if it does not return. */
540 || flags
& ECF_NORETURN
541 /* TM ending statements have backedges out of the transaction.
542 Return true so we split the basic block containing them.
543 Note that the TM_BUILTIN test is merely an optimization. */
544 || ((flags
& ECF_TM_BUILTIN
)
545 && is_tm_ending_fndecl (gimple_call_fndecl (stmt
)))
546 /* BUILT_IN_RETURN call is same as return statement. */
547 || gimple_call_builtin_p (stmt
, BUILT_IN_RETURN
)
548 /* IFN_UNIQUE should be the last insn, to make checking for it
549 as cheap as possible. */
550 || (gimple_call_internal_p (stmt
)
551 && gimple_call_internal_unique_p (stmt
)))
552 gimple_call_set_ctrl_altering (stmt
, true);
554 gimple_call_set_ctrl_altering (stmt
, false);
558 /* Insert SEQ after BB and build a flowgraph. */
561 make_blocks_1 (gimple_seq seq
, basic_block bb
)
563 gimple_stmt_iterator i
= gsi_start (seq
);
565 gimple
*prev_stmt
= NULL
;
566 bool start_new_block
= true;
567 bool first_stmt_of_seq
= true;
569 while (!gsi_end_p (i
))
571 /* PREV_STMT should only be set to a debug stmt if the debug
572 stmt is before nondebug stmts. Once stmt reaches a nondebug
573 nonlabel, prev_stmt will be set to it, so that
574 stmt_starts_bb_p will know to start a new block if a label is
575 found. However, if stmt was a label after debug stmts only,
576 keep the label in prev_stmt even if we find further debug
577 stmts, for there may be other labels after them, and they
578 should land in the same block. */
579 if (!prev_stmt
|| !stmt
|| !is_gimple_debug (stmt
))
583 if (stmt
&& is_gimple_call (stmt
))
584 gimple_call_initialize_ctrl_altering (stmt
);
586 /* If the statement starts a new basic block or if we have determined
587 in a previous pass that we need to create a new block for STMT, do
589 if (start_new_block
|| stmt_starts_bb_p (stmt
, prev_stmt
))
591 if (!first_stmt_of_seq
)
592 gsi_split_seq_before (&i
, &seq
);
593 bb
= create_basic_block (seq
, bb
);
594 start_new_block
= false;
598 /* Now add STMT to BB and create the subgraphs for special statement
600 gimple_set_bb (stmt
, bb
);
602 /* If STMT is a basic block terminator, set START_NEW_BLOCK for the
604 if (stmt_ends_bb_p (stmt
))
606 /* If the stmt can make abnormal goto use a new temporary
607 for the assignment to the LHS. This makes sure the old value
608 of the LHS is available on the abnormal edge. Otherwise
609 we will end up with overlapping life-ranges for abnormal
611 if (gimple_has_lhs (stmt
)
612 && stmt_can_make_abnormal_goto (stmt
)
613 && is_gimple_reg_type (TREE_TYPE (gimple_get_lhs (stmt
))))
615 tree lhs
= gimple_get_lhs (stmt
);
616 tree tmp
= create_tmp_var (TREE_TYPE (lhs
));
617 gimple
*s
= gimple_build_assign (lhs
, tmp
);
618 gimple_set_location (s
, gimple_location (stmt
));
619 gimple_set_block (s
, gimple_block (stmt
));
620 gimple_set_lhs (stmt
, tmp
);
621 if (TREE_CODE (TREE_TYPE (tmp
)) == COMPLEX_TYPE
622 || TREE_CODE (TREE_TYPE (tmp
)) == VECTOR_TYPE
)
623 DECL_GIMPLE_REG_P (tmp
) = 1;
624 gsi_insert_after (&i
, s
, GSI_SAME_STMT
);
626 start_new_block
= true;
630 first_stmt_of_seq
= false;
635 /* Build a flowgraph for the sequence of stmts SEQ. */
638 make_blocks (gimple_seq seq
)
640 /* Look for debug markers right before labels, and move the debug
641 stmts after the labels. Accepting labels among debug markers
642 adds no value, just complexity; if we wanted to annotate labels
643 with view numbers (so sequencing among markers would matter) or
644 somesuch, we're probably better off still moving the labels, but
645 adding other debug annotations in their original positions or
646 emitting nonbind or bind markers associated with the labels in
647 the original position of the labels.
649 Moving labels would probably be simpler, but we can't do that:
650 moving labels assigns label ids to them, and doing so because of
651 debug markers makes for -fcompare-debug and possibly even codegen
652 differences. So, we have to move the debug stmts instead. To
653 that end, we scan SEQ backwards, marking the position of the
654 latest (earliest we find) label, and moving debug stmts that are
655 not separated from it by nondebug nonlabel stmts after the
657 if (MAY_HAVE_DEBUG_MARKER_STMTS
)
659 gimple_stmt_iterator label
= gsi_none ();
661 for (gimple_stmt_iterator i
= gsi_last (seq
); !gsi_end_p (i
); gsi_prev (&i
))
663 gimple
*stmt
= gsi_stmt (i
);
665 /* If this is the first label we encounter (latest in SEQ)
666 before nondebug stmts, record its position. */
667 if (is_a
<glabel
*> (stmt
))
669 if (gsi_end_p (label
))
674 /* Without a recorded label position to move debug stmts to,
675 there's nothing to do. */
676 if (gsi_end_p (label
))
679 /* Move the debug stmt at I after LABEL. */
680 if (is_gimple_debug (stmt
))
682 gcc_assert (gimple_debug_nonbind_marker_p (stmt
));
683 /* As STMT is removed, I advances to the stmt after
684 STMT, so the gsi_prev in the for "increment"
685 expression gets us to the stmt we're to visit after
686 STMT. LABEL, however, would advance to the moved
687 stmt if we passed it to gsi_move_after, so pass it a
688 copy instead, so as to keep LABEL pointing to the
690 gimple_stmt_iterator copy
= label
;
691 gsi_move_after (&i
, ©
);
695 /* There aren't any (more?) debug stmts before label, so
696 there isn't anything else to move after it. */
701 make_blocks_1 (seq
, ENTRY_BLOCK_PTR_FOR_FN (cfun
));
704 /* Create and return a new empty basic block after bb AFTER. */
707 create_bb (void *h
, void *e
, basic_block after
)
713 /* Create and initialize a new basic block. Since alloc_block uses
714 GC allocation that clears memory to allocate a basic block, we do
715 not have to clear the newly allocated basic block here. */
718 bb
->index
= last_basic_block_for_fn (cfun
);
720 set_bb_seq (bb
, h
? (gimple_seq
) h
: NULL
);
722 /* Add the new block to the linked list of blocks. */
723 link_block (bb
, after
);
725 /* Grow the basic block array if needed. */
726 if ((size_t) last_basic_block_for_fn (cfun
)
727 == basic_block_info_for_fn (cfun
)->length ())
730 (last_basic_block_for_fn (cfun
)
731 + (last_basic_block_for_fn (cfun
) + 3) / 4);
732 vec_safe_grow_cleared (basic_block_info_for_fn (cfun
), new_size
);
735 /* Add the newly created block to the array. */
736 SET_BASIC_BLOCK_FOR_FN (cfun
, last_basic_block_for_fn (cfun
), bb
);
738 n_basic_blocks_for_fn (cfun
)++;
739 last_basic_block_for_fn (cfun
)++;
745 /*---------------------------------------------------------------------------
747 ---------------------------------------------------------------------------*/
749 /* If basic block BB has an abnormal edge to a basic block
750 containing IFN_ABNORMAL_DISPATCHER internal call, return
751 that the dispatcher's basic block, otherwise return NULL. */
754 get_abnormal_succ_dispatcher (basic_block bb
)
759 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
760 if ((e
->flags
& (EDGE_ABNORMAL
| EDGE_EH
)) == EDGE_ABNORMAL
)
762 gimple_stmt_iterator gsi
763 = gsi_start_nondebug_after_labels_bb (e
->dest
);
764 gimple
*g
= gsi_stmt (gsi
);
765 if (g
&& gimple_call_internal_p (g
, IFN_ABNORMAL_DISPATCHER
))
771 /* Helper function for make_edges. Create a basic block with
772 with ABNORMAL_DISPATCHER internal call in it if needed, and
773 create abnormal edges from BBS to it and from it to FOR_BB
774 if COMPUTED_GOTO is false, otherwise factor the computed gotos. */
777 handle_abnormal_edges (basic_block
*dispatcher_bbs
,
778 basic_block for_bb
, int *bb_to_omp_idx
,
779 auto_vec
<basic_block
> *bbs
, bool computed_goto
)
781 basic_block
*dispatcher
= dispatcher_bbs
+ (computed_goto
? 1 : 0);
782 unsigned int idx
= 0;
788 dispatcher
= dispatcher_bbs
+ 2 * bb_to_omp_idx
[for_bb
->index
];
789 if (bb_to_omp_idx
[for_bb
->index
] != 0)
793 /* If the dispatcher has been created already, then there are basic
794 blocks with abnormal edges to it, so just make a new edge to
796 if (*dispatcher
== NULL
)
798 /* Check if there are any basic blocks that need to have
799 abnormal edges to this dispatcher. If there are none, return
801 if (bb_to_omp_idx
== NULL
)
803 if (bbs
->is_empty ())
808 FOR_EACH_VEC_ELT (*bbs
, idx
, bb
)
809 if (bb_to_omp_idx
[bb
->index
] == bb_to_omp_idx
[for_bb
->index
])
815 /* Create the dispatcher bb. */
816 *dispatcher
= create_basic_block (NULL
, for_bb
);
819 /* Factor computed gotos into a common computed goto site. Also
820 record the location of that site so that we can un-factor the
821 gotos after we have converted back to normal form. */
822 gimple_stmt_iterator gsi
= gsi_start_bb (*dispatcher
);
824 /* Create the destination of the factored goto. Each original
825 computed goto will put its desired destination into this
826 variable and jump to the label we create immediately below. */
827 tree var
= create_tmp_var (ptr_type_node
, "gotovar");
829 /* Build a label for the new block which will contain the
830 factored computed goto. */
831 tree factored_label_decl
832 = create_artificial_label (UNKNOWN_LOCATION
);
833 gimple
*factored_computed_goto_label
834 = gimple_build_label (factored_label_decl
);
835 gsi_insert_after (&gsi
, factored_computed_goto_label
, GSI_NEW_STMT
);
837 /* Build our new computed goto. */
838 gimple
*factored_computed_goto
= gimple_build_goto (var
);
839 gsi_insert_after (&gsi
, factored_computed_goto
, GSI_NEW_STMT
);
841 FOR_EACH_VEC_ELT (*bbs
, idx
, bb
)
844 && bb_to_omp_idx
[bb
->index
] != bb_to_omp_idx
[for_bb
->index
])
847 gsi
= gsi_last_bb (bb
);
848 gimple
*last
= gsi_stmt (gsi
);
850 gcc_assert (computed_goto_p (last
));
852 /* Copy the original computed goto's destination into VAR. */
854 = gimple_build_assign (var
, gimple_goto_dest (last
));
855 gsi_insert_before (&gsi
, assignment
, GSI_SAME_STMT
);
857 edge e
= make_edge (bb
, *dispatcher
, EDGE_FALLTHRU
);
858 e
->goto_locus
= gimple_location (last
);
859 gsi_remove (&gsi
, true);
864 tree arg
= inner
? boolean_true_node
: boolean_false_node
;
865 gimple
*g
= gimple_build_call_internal (IFN_ABNORMAL_DISPATCHER
,
867 gimple_stmt_iterator gsi
= gsi_after_labels (*dispatcher
);
868 gsi_insert_after (&gsi
, g
, GSI_NEW_STMT
);
870 /* Create predecessor edges of the dispatcher. */
871 FOR_EACH_VEC_ELT (*bbs
, idx
, bb
)
874 && bb_to_omp_idx
[bb
->index
] != bb_to_omp_idx
[for_bb
->index
])
876 make_edge (bb
, *dispatcher
, EDGE_ABNORMAL
);
881 make_edge (*dispatcher
, for_bb
, EDGE_ABNORMAL
);
884 /* Creates outgoing edges for BB. Returns 1 when it ends with an
885 computed goto, returns 2 when it ends with a statement that
886 might return to this function via an nonlocal goto, otherwise
887 return 0. Updates *PCUR_REGION with the OMP region this BB is in. */
890 make_edges_bb (basic_block bb
, struct omp_region
**pcur_region
, int *pomp_index
)
892 gimple
*last
= last_stmt (bb
);
893 bool fallthru
= false;
899 switch (gimple_code (last
))
902 if (make_goto_expr_edges (bb
))
908 edge e
= make_edge (bb
, EXIT_BLOCK_PTR_FOR_FN (cfun
), 0);
909 e
->goto_locus
= gimple_location (last
);
914 make_cond_expr_edges (bb
);
918 make_gimple_switch_edges (as_a
<gswitch
*> (last
), bb
);
922 make_eh_edges (last
);
925 case GIMPLE_EH_DISPATCH
:
926 fallthru
= make_eh_dispatch_edges (as_a
<geh_dispatch
*> (last
));
930 /* If this function receives a nonlocal goto, then we need to
931 make edges from this call site to all the nonlocal goto
933 if (stmt_can_make_abnormal_goto (last
))
936 /* If this statement has reachable exception handlers, then
937 create abnormal edges to them. */
938 make_eh_edges (last
);
940 /* BUILTIN_RETURN is really a return statement. */
941 if (gimple_call_builtin_p (last
, BUILT_IN_RETURN
))
943 make_edge (bb
, EXIT_BLOCK_PTR_FOR_FN (cfun
), 0);
946 /* Some calls are known not to return. */
948 fallthru
= !gimple_call_noreturn_p (last
);
952 /* A GIMPLE_ASSIGN may throw internally and thus be considered
954 if (is_ctrl_altering_stmt (last
))
955 make_eh_edges (last
);
960 make_gimple_asm_edges (bb
);
965 fallthru
= omp_make_gimple_edges (bb
, pcur_region
, pomp_index
);
968 case GIMPLE_TRANSACTION
:
970 gtransaction
*txn
= as_a
<gtransaction
*> (last
);
971 tree label1
= gimple_transaction_label_norm (txn
);
972 tree label2
= gimple_transaction_label_uninst (txn
);
975 make_edge (bb
, label_to_block (label1
), EDGE_FALLTHRU
);
977 make_edge (bb
, label_to_block (label2
),
978 EDGE_TM_UNINSTRUMENTED
| (label1
? 0 : EDGE_FALLTHRU
));
980 tree label3
= gimple_transaction_label_over (txn
);
981 if (gimple_transaction_subcode (txn
)
982 & (GTMA_HAVE_ABORT
| GTMA_IS_OUTER
))
983 make_edge (bb
, label_to_block (label3
), EDGE_TM_ABORT
);
990 gcc_assert (!stmt_ends_bb_p (last
));
996 make_edge (bb
, bb
->next_bb
, EDGE_FALLTHRU
);
1001 /* Join all the blocks in the flowgraph. */
1007 struct omp_region
*cur_region
= NULL
;
1008 auto_vec
<basic_block
> ab_edge_goto
;
1009 auto_vec
<basic_block
> ab_edge_call
;
1010 int *bb_to_omp_idx
= NULL
;
1011 int cur_omp_region_idx
= 0;
1013 /* Create an edge from entry to the first block with executable
1014 statements in it. */
1015 make_edge (ENTRY_BLOCK_PTR_FOR_FN (cfun
),
1016 BASIC_BLOCK_FOR_FN (cfun
, NUM_FIXED_BLOCKS
),
1019 /* Traverse the basic block array placing edges. */
1020 FOR_EACH_BB_FN (bb
, cfun
)
1025 bb_to_omp_idx
[bb
->index
] = cur_omp_region_idx
;
1027 mer
= make_edges_bb (bb
, &cur_region
, &cur_omp_region_idx
);
1029 ab_edge_goto
.safe_push (bb
);
1031 ab_edge_call
.safe_push (bb
);
1033 if (cur_region
&& bb_to_omp_idx
== NULL
)
1034 bb_to_omp_idx
= XCNEWVEC (int, n_basic_blocks_for_fn (cfun
));
1037 /* Computed gotos are hell to deal with, especially if there are
1038 lots of them with a large number of destinations. So we factor
1039 them to a common computed goto location before we build the
1040 edge list. After we convert back to normal form, we will un-factor
1041 the computed gotos since factoring introduces an unwanted jump.
1042 For non-local gotos and abnormal edges from calls to calls that return
1043 twice or forced labels, factor the abnormal edges too, by having all
1044 abnormal edges from the calls go to a common artificial basic block
1045 with ABNORMAL_DISPATCHER internal call and abnormal edges from that
1046 basic block to all forced labels and calls returning twice.
1047 We do this per-OpenMP structured block, because those regions
1048 are guaranteed to be single entry single exit by the standard,
1049 so it is not allowed to enter or exit such regions abnormally this way,
1050 thus all computed gotos, non-local gotos and setjmp/longjmp calls
1051 must not transfer control across SESE region boundaries. */
1052 if (!ab_edge_goto
.is_empty () || !ab_edge_call
.is_empty ())
1054 gimple_stmt_iterator gsi
;
1055 basic_block dispatcher_bb_array
[2] = { NULL
, NULL
};
1056 basic_block
*dispatcher_bbs
= dispatcher_bb_array
;
1057 int count
= n_basic_blocks_for_fn (cfun
);
1060 dispatcher_bbs
= XCNEWVEC (basic_block
, 2 * count
);
1062 FOR_EACH_BB_FN (bb
, cfun
)
1064 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
1066 glabel
*label_stmt
= dyn_cast
<glabel
*> (gsi_stmt (gsi
));
1072 target
= gimple_label_label (label_stmt
);
1074 /* Make an edge to every label block that has been marked as a
1075 potential target for a computed goto or a non-local goto. */
1076 if (FORCED_LABEL (target
))
1077 handle_abnormal_edges (dispatcher_bbs
, bb
, bb_to_omp_idx
,
1078 &ab_edge_goto
, true);
1079 if (DECL_NONLOCAL (target
))
1081 handle_abnormal_edges (dispatcher_bbs
, bb
, bb_to_omp_idx
,
1082 &ab_edge_call
, false);
1087 if (!gsi_end_p (gsi
) && is_gimple_debug (gsi_stmt (gsi
)))
1088 gsi_next_nondebug (&gsi
);
1089 if (!gsi_end_p (gsi
))
1091 /* Make an edge to every setjmp-like call. */
1092 gimple
*call_stmt
= gsi_stmt (gsi
);
1093 if (is_gimple_call (call_stmt
)
1094 && ((gimple_call_flags (call_stmt
) & ECF_RETURNS_TWICE
)
1095 || gimple_call_builtin_p (call_stmt
,
1096 BUILT_IN_SETJMP_RECEIVER
)))
1097 handle_abnormal_edges (dispatcher_bbs
, bb
, bb_to_omp_idx
,
1098 &ab_edge_call
, false);
1103 XDELETE (dispatcher_bbs
);
1106 XDELETE (bb_to_omp_idx
);
1108 omp_free_regions ();
1111 /* Add SEQ after GSI. Start new bb after GSI, and created further bbs as
1112 needed. Returns true if new bbs were created.
1113 Note: This is transitional code, and should not be used for new code. We
1114 should be able to get rid of this by rewriting all target va-arg
1115 gimplification hooks to use an interface gimple_build_cond_value as described
1116 in https://gcc.gnu.org/ml/gcc-patches/2015-02/msg01194.html. */
1119 gimple_find_sub_bbs (gimple_seq seq
, gimple_stmt_iterator
*gsi
)
1121 gimple
*stmt
= gsi_stmt (*gsi
);
1122 basic_block bb
= gimple_bb (stmt
);
1123 basic_block lastbb
, afterbb
;
1124 int old_num_bbs
= n_basic_blocks_for_fn (cfun
);
1126 lastbb
= make_blocks_1 (seq
, bb
);
1127 if (old_num_bbs
== n_basic_blocks_for_fn (cfun
))
1129 e
= split_block (bb
, stmt
);
1130 /* Move e->dest to come after the new basic blocks. */
1132 unlink_block (afterbb
);
1133 link_block (afterbb
, lastbb
);
1134 redirect_edge_succ (e
, bb
->next_bb
);
1136 while (bb
!= afterbb
)
1138 struct omp_region
*cur_region
= NULL
;
1139 profile_count cnt
= profile_count::zero ();
1142 int cur_omp_region_idx
= 0;
1143 int mer
= make_edges_bb (bb
, &cur_region
, &cur_omp_region_idx
);
1144 gcc_assert (!mer
&& !cur_region
);
1145 add_bb_to_loop (bb
, afterbb
->loop_father
);
1149 FOR_EACH_EDGE (e
, ei
, bb
->preds
)
1151 if (e
->count ().initialized_p ())
1156 tree_guess_outgoing_edge_probabilities (bb
);
1157 if (all
|| profile_status_for_fn (cfun
) == PROFILE_READ
)
1165 /* Find the next available discriminator value for LOCUS. The
1166 discriminator distinguishes among several basic blocks that
1167 share a common locus, allowing for more accurate sample-based
1171 next_discriminator_for_locus (location_t locus
)
1173 struct locus_discrim_map item
;
1174 struct locus_discrim_map
**slot
;
1177 item
.discriminator
= 0;
1178 slot
= discriminator_per_locus
->find_slot_with_hash (
1179 &item
, LOCATION_LINE (locus
), INSERT
);
1181 if (*slot
== HTAB_EMPTY_ENTRY
)
1183 *slot
= XNEW (struct locus_discrim_map
);
1185 (*slot
)->locus
= locus
;
1186 (*slot
)->discriminator
= 0;
1188 (*slot
)->discriminator
++;
1189 return (*slot
)->discriminator
;
1192 /* Return TRUE if LOCUS1 and LOCUS2 refer to the same source line. */
1195 same_line_p (location_t locus1
, location_t locus2
)
1197 expanded_location from
, to
;
1199 if (locus1
== locus2
)
1202 from
= expand_location (locus1
);
1203 to
= expand_location (locus2
);
1205 if (from
.line
!= to
.line
)
1207 if (from
.file
== to
.file
)
1209 return (from
.file
!= NULL
1211 && filename_cmp (from
.file
, to
.file
) == 0);
1214 /* Assign discriminators to each basic block. */
1217 assign_discriminators (void)
1221 FOR_EACH_BB_FN (bb
, cfun
)
1225 gimple
*last
= last_stmt (bb
);
1226 location_t locus
= last
? gimple_location (last
) : UNKNOWN_LOCATION
;
1228 if (locus
== UNKNOWN_LOCATION
)
1231 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
1233 gimple
*first
= first_non_label_stmt (e
->dest
);
1234 gimple
*last
= last_stmt (e
->dest
);
1235 if ((first
&& same_line_p (locus
, gimple_location (first
)))
1236 || (last
&& same_line_p (locus
, gimple_location (last
))))
1238 if (e
->dest
->discriminator
!= 0 && bb
->discriminator
== 0)
1239 bb
->discriminator
= next_discriminator_for_locus (locus
);
1241 e
->dest
->discriminator
= next_discriminator_for_locus (locus
);
1247 /* Create the edges for a GIMPLE_COND starting at block BB. */
1250 make_cond_expr_edges (basic_block bb
)
1252 gcond
*entry
= as_a
<gcond
*> (last_stmt (bb
));
1253 gimple
*then_stmt
, *else_stmt
;
1254 basic_block then_bb
, else_bb
;
1255 tree then_label
, else_label
;
1259 gcc_assert (gimple_code (entry
) == GIMPLE_COND
);
1261 /* Entry basic blocks for each component. */
1262 then_label
= gimple_cond_true_label (entry
);
1263 else_label
= gimple_cond_false_label (entry
);
1264 then_bb
= label_to_block (then_label
);
1265 else_bb
= label_to_block (else_label
);
1266 then_stmt
= first_stmt (then_bb
);
1267 else_stmt
= first_stmt (else_bb
);
1269 e
= make_edge (bb
, then_bb
, EDGE_TRUE_VALUE
);
1270 e
->goto_locus
= gimple_location (then_stmt
);
1271 e
= make_edge (bb
, else_bb
, EDGE_FALSE_VALUE
);
1273 e
->goto_locus
= gimple_location (else_stmt
);
1275 /* We do not need the labels anymore. */
1276 gimple_cond_set_true_label (entry
, NULL_TREE
);
1277 gimple_cond_set_false_label (entry
, NULL_TREE
);
1281 /* Called for each element in the hash table (P) as we delete the
1282 edge to cases hash table.
1284 Clear all the CASE_CHAINs to prevent problems with copying of
1285 SWITCH_EXPRs and structure sharing rules, then free the hash table
1289 edge_to_cases_cleanup (edge
const &, tree
const &value
, void *)
1293 for (t
= value
; t
; t
= next
)
1295 next
= CASE_CHAIN (t
);
1296 CASE_CHAIN (t
) = NULL
;
1302 /* Start recording information mapping edges to case labels. */
1305 start_recording_case_labels (void)
1307 gcc_assert (edge_to_cases
== NULL
);
1308 edge_to_cases
= new hash_map
<edge
, tree
>;
1309 touched_switch_bbs
= BITMAP_ALLOC (NULL
);
1312 /* Return nonzero if we are recording information for case labels. */
1315 recording_case_labels_p (void)
1317 return (edge_to_cases
!= NULL
);
1320 /* Stop recording information mapping edges to case labels and
1321 remove any information we have recorded. */
1323 end_recording_case_labels (void)
1327 edge_to_cases
->traverse
<void *, edge_to_cases_cleanup
> (NULL
);
1328 delete edge_to_cases
;
1329 edge_to_cases
= NULL
;
1330 EXECUTE_IF_SET_IN_BITMAP (touched_switch_bbs
, 0, i
, bi
)
1332 basic_block bb
= BASIC_BLOCK_FOR_FN (cfun
, i
);
1335 gimple
*stmt
= last_stmt (bb
);
1336 if (stmt
&& gimple_code (stmt
) == GIMPLE_SWITCH
)
1337 group_case_labels_stmt (as_a
<gswitch
*> (stmt
));
1340 BITMAP_FREE (touched_switch_bbs
);
1343 /* If we are inside a {start,end}_recording_cases block, then return
1344 a chain of CASE_LABEL_EXPRs from T which reference E.
1346 Otherwise return NULL. */
1349 get_cases_for_edge (edge e
, gswitch
*t
)
1354 /* If we are not recording cases, then we do not have CASE_LABEL_EXPR
1355 chains available. Return NULL so the caller can detect this case. */
1356 if (!recording_case_labels_p ())
1359 slot
= edge_to_cases
->get (e
);
1363 /* If we did not find E in the hash table, then this must be the first
1364 time we have been queried for information about E & T. Add all the
1365 elements from T to the hash table then perform the query again. */
1367 n
= gimple_switch_num_labels (t
);
1368 for (i
= 0; i
< n
; i
++)
1370 tree elt
= gimple_switch_label (t
, i
);
1371 tree lab
= CASE_LABEL (elt
);
1372 basic_block label_bb
= label_to_block (lab
);
1373 edge this_edge
= find_edge (e
->src
, label_bb
);
1375 /* Add it to the chain of CASE_LABEL_EXPRs referencing E, or create
1377 tree
&s
= edge_to_cases
->get_or_insert (this_edge
);
1378 CASE_CHAIN (elt
) = s
;
1382 return *edge_to_cases
->get (e
);
1385 /* Create the edges for a GIMPLE_SWITCH starting at block BB. */
1388 make_gimple_switch_edges (gswitch
*entry
, basic_block bb
)
1392 n
= gimple_switch_num_labels (entry
);
1394 for (i
= 0; i
< n
; ++i
)
1396 tree lab
= CASE_LABEL (gimple_switch_label (entry
, i
));
1397 basic_block label_bb
= label_to_block (lab
);
1398 make_edge (bb
, label_bb
, 0);
1403 /* Return the basic block holding label DEST. */
1406 label_to_block_fn (struct function
*ifun
, tree dest
)
1408 int uid
= LABEL_DECL_UID (dest
);
1410 /* We would die hard when faced by an undefined label. Emit a label to
1411 the very first basic block. This will hopefully make even the dataflow
1412 and undefined variable warnings quite right. */
1413 if (seen_error () && uid
< 0)
1415 gimple_stmt_iterator gsi
=
1416 gsi_start_bb (BASIC_BLOCK_FOR_FN (cfun
, NUM_FIXED_BLOCKS
));
1419 stmt
= gimple_build_label (dest
);
1420 gsi_insert_before (&gsi
, stmt
, GSI_NEW_STMT
);
1421 uid
= LABEL_DECL_UID (dest
);
1423 if (vec_safe_length (ifun
->cfg
->x_label_to_block_map
) <= (unsigned int) uid
)
1425 return (*ifun
->cfg
->x_label_to_block_map
)[uid
];
1428 /* Create edges for a goto statement at block BB. Returns true
1429 if abnormal edges should be created. */
1432 make_goto_expr_edges (basic_block bb
)
1434 gimple_stmt_iterator last
= gsi_last_bb (bb
);
1435 gimple
*goto_t
= gsi_stmt (last
);
1437 /* A simple GOTO creates normal edges. */
1438 if (simple_goto_p (goto_t
))
1440 tree dest
= gimple_goto_dest (goto_t
);
1441 basic_block label_bb
= label_to_block (dest
);
1442 edge e
= make_edge (bb
, label_bb
, EDGE_FALLTHRU
);
1443 e
->goto_locus
= gimple_location (goto_t
);
1444 gsi_remove (&last
, true);
1448 /* A computed GOTO creates abnormal edges. */
1452 /* Create edges for an asm statement with labels at block BB. */
1455 make_gimple_asm_edges (basic_block bb
)
1457 gasm
*stmt
= as_a
<gasm
*> (last_stmt (bb
));
1458 int i
, n
= gimple_asm_nlabels (stmt
);
1460 for (i
= 0; i
< n
; ++i
)
1462 tree label
= TREE_VALUE (gimple_asm_label_op (stmt
, i
));
1463 basic_block label_bb
= label_to_block (label
);
1464 make_edge (bb
, label_bb
, 0);
1468 /*---------------------------------------------------------------------------
1470 ---------------------------------------------------------------------------*/
1472 /* Cleanup useless labels in basic blocks. This is something we wish
1473 to do early because it allows us to group case labels before creating
1474 the edges for the CFG, and it speeds up block statement iterators in
1475 all passes later on.
1476 We rerun this pass after CFG is created, to get rid of the labels that
1477 are no longer referenced. After then we do not run it any more, since
1478 (almost) no new labels should be created. */
1480 /* A map from basic block index to the leading label of that block. */
1481 static struct label_record
1486 /* True if the label is referenced from somewhere. */
1490 /* Given LABEL return the first label in the same basic block. */
1493 main_block_label (tree label
)
1495 basic_block bb
= label_to_block (label
);
1496 tree main_label
= label_for_bb
[bb
->index
].label
;
1498 /* label_to_block possibly inserted undefined label into the chain. */
1501 label_for_bb
[bb
->index
].label
= label
;
1505 label_for_bb
[bb
->index
].used
= true;
1509 /* Clean up redundant labels within the exception tree. */
1512 cleanup_dead_labels_eh (void)
1519 if (cfun
->eh
== NULL
)
1522 for (i
= 1; vec_safe_iterate (cfun
->eh
->lp_array
, i
, &lp
); ++i
)
1523 if (lp
&& lp
->post_landing_pad
)
1525 lab
= main_block_label (lp
->post_landing_pad
);
1526 if (lab
!= lp
->post_landing_pad
)
1528 EH_LANDING_PAD_NR (lp
->post_landing_pad
) = 0;
1529 EH_LANDING_PAD_NR (lab
) = lp
->index
;
1533 FOR_ALL_EH_REGION (r
)
1537 case ERT_MUST_NOT_THROW
:
1543 for (c
= r
->u
.eh_try
.first_catch
; c
; c
= c
->next_catch
)
1547 c
->label
= main_block_label (lab
);
1552 case ERT_ALLOWED_EXCEPTIONS
:
1553 lab
= r
->u
.allowed
.label
;
1555 r
->u
.allowed
.label
= main_block_label (lab
);
1561 /* Cleanup redundant labels. This is a three-step process:
1562 1) Find the leading label for each block.
1563 2) Redirect all references to labels to the leading labels.
1564 3) Cleanup all useless labels. */
1567 cleanup_dead_labels (void)
1570 label_for_bb
= XCNEWVEC (struct label_record
, last_basic_block_for_fn (cfun
));
1572 /* Find a suitable label for each block. We use the first user-defined
1573 label if there is one, or otherwise just the first label we see. */
1574 FOR_EACH_BB_FN (bb
, cfun
)
1576 gimple_stmt_iterator i
;
1578 for (i
= gsi_start_bb (bb
); !gsi_end_p (i
); gsi_next (&i
))
1581 glabel
*label_stmt
= dyn_cast
<glabel
*> (gsi_stmt (i
));
1586 label
= gimple_label_label (label_stmt
);
1588 /* If we have not yet seen a label for the current block,
1589 remember this one and see if there are more labels. */
1590 if (!label_for_bb
[bb
->index
].label
)
1592 label_for_bb
[bb
->index
].label
= label
;
1596 /* If we did see a label for the current block already, but it
1597 is an artificially created label, replace it if the current
1598 label is a user defined label. */
1599 if (!DECL_ARTIFICIAL (label
)
1600 && DECL_ARTIFICIAL (label_for_bb
[bb
->index
].label
))
1602 label_for_bb
[bb
->index
].label
= label
;
1608 /* Now redirect all jumps/branches to the selected label.
1609 First do so for each block ending in a control statement. */
1610 FOR_EACH_BB_FN (bb
, cfun
)
1612 gimple
*stmt
= last_stmt (bb
);
1613 tree label
, new_label
;
1618 switch (gimple_code (stmt
))
1622 gcond
*cond_stmt
= as_a
<gcond
*> (stmt
);
1623 label
= gimple_cond_true_label (cond_stmt
);
1626 new_label
= main_block_label (label
);
1627 if (new_label
!= label
)
1628 gimple_cond_set_true_label (cond_stmt
, new_label
);
1631 label
= gimple_cond_false_label (cond_stmt
);
1634 new_label
= main_block_label (label
);
1635 if (new_label
!= label
)
1636 gimple_cond_set_false_label (cond_stmt
, new_label
);
1643 gswitch
*switch_stmt
= as_a
<gswitch
*> (stmt
);
1644 size_t i
, n
= gimple_switch_num_labels (switch_stmt
);
1646 /* Replace all destination labels. */
1647 for (i
= 0; i
< n
; ++i
)
1649 tree case_label
= gimple_switch_label (switch_stmt
, i
);
1650 label
= CASE_LABEL (case_label
);
1651 new_label
= main_block_label (label
);
1652 if (new_label
!= label
)
1653 CASE_LABEL (case_label
) = new_label
;
1660 gasm
*asm_stmt
= as_a
<gasm
*> (stmt
);
1661 int i
, n
= gimple_asm_nlabels (asm_stmt
);
1663 for (i
= 0; i
< n
; ++i
)
1665 tree cons
= gimple_asm_label_op (asm_stmt
, i
);
1666 tree label
= main_block_label (TREE_VALUE (cons
));
1667 TREE_VALUE (cons
) = label
;
1672 /* We have to handle gotos until they're removed, and we don't
1673 remove them until after we've created the CFG edges. */
1675 if (!computed_goto_p (stmt
))
1677 ggoto
*goto_stmt
= as_a
<ggoto
*> (stmt
);
1678 label
= gimple_goto_dest (goto_stmt
);
1679 new_label
= main_block_label (label
);
1680 if (new_label
!= label
)
1681 gimple_goto_set_dest (goto_stmt
, new_label
);
1685 case GIMPLE_TRANSACTION
:
1687 gtransaction
*txn
= as_a
<gtransaction
*> (stmt
);
1689 label
= gimple_transaction_label_norm (txn
);
1692 new_label
= main_block_label (label
);
1693 if (new_label
!= label
)
1694 gimple_transaction_set_label_norm (txn
, new_label
);
1697 label
= gimple_transaction_label_uninst (txn
);
1700 new_label
= main_block_label (label
);
1701 if (new_label
!= label
)
1702 gimple_transaction_set_label_uninst (txn
, new_label
);
1705 label
= gimple_transaction_label_over (txn
);
1708 new_label
= main_block_label (label
);
1709 if (new_label
!= label
)
1710 gimple_transaction_set_label_over (txn
, new_label
);
1720 /* Do the same for the exception region tree labels. */
1721 cleanup_dead_labels_eh ();
1723 /* Finally, purge dead labels. All user-defined labels and labels that
1724 can be the target of non-local gotos and labels which have their
1725 address taken are preserved. */
1726 FOR_EACH_BB_FN (bb
, cfun
)
1728 gimple_stmt_iterator i
;
1729 tree label_for_this_bb
= label_for_bb
[bb
->index
].label
;
1731 if (!label_for_this_bb
)
1734 /* If the main label of the block is unused, we may still remove it. */
1735 if (!label_for_bb
[bb
->index
].used
)
1736 label_for_this_bb
= NULL
;
1738 for (i
= gsi_start_bb (bb
); !gsi_end_p (i
); )
1741 glabel
*label_stmt
= dyn_cast
<glabel
*> (gsi_stmt (i
));
1746 label
= gimple_label_label (label_stmt
);
1748 if (label
== label_for_this_bb
1749 || !DECL_ARTIFICIAL (label
)
1750 || DECL_NONLOCAL (label
)
1751 || FORCED_LABEL (label
))
1754 gsi_remove (&i
, true);
1758 free (label_for_bb
);
1761 /* Scan the sorted vector of cases in STMT (a GIMPLE_SWITCH) and combine
1762 the ones jumping to the same label.
1763 Eg. three separate entries 1: 2: 3: become one entry 1..3: */
1766 group_case_labels_stmt (gswitch
*stmt
)
1768 int old_size
= gimple_switch_num_labels (stmt
);
1769 int i
, next_index
, new_size
;
1770 basic_block default_bb
= NULL
;
1772 default_bb
= label_to_block (CASE_LABEL (gimple_switch_default_label (stmt
)));
1774 /* Look for possible opportunities to merge cases. */
1776 while (i
< old_size
)
1778 tree base_case
, base_high
;
1779 basic_block base_bb
;
1781 base_case
= gimple_switch_label (stmt
, i
);
1783 gcc_assert (base_case
);
1784 base_bb
= label_to_block (CASE_LABEL (base_case
));
1786 /* Discard cases that have the same destination as the default case or
1787 whose destiniation blocks have already been removed as unreachable. */
1788 if (base_bb
== NULL
|| base_bb
== default_bb
)
1794 base_high
= CASE_HIGH (base_case
)
1795 ? CASE_HIGH (base_case
)
1796 : CASE_LOW (base_case
);
1799 /* Try to merge case labels. Break out when we reach the end
1800 of the label vector or when we cannot merge the next case
1801 label with the current one. */
1802 while (next_index
< old_size
)
1804 tree merge_case
= gimple_switch_label (stmt
, next_index
);
1805 basic_block merge_bb
= label_to_block (CASE_LABEL (merge_case
));
1806 wide_int bhp1
= wi::to_wide (base_high
) + 1;
1808 /* Merge the cases if they jump to the same place,
1809 and their ranges are consecutive. */
1810 if (merge_bb
== base_bb
1811 && wi::to_wide (CASE_LOW (merge_case
)) == bhp1
)
1813 base_high
= CASE_HIGH (merge_case
) ?
1814 CASE_HIGH (merge_case
) : CASE_LOW (merge_case
);
1815 CASE_HIGH (base_case
) = base_high
;
1822 /* Discard cases that have an unreachable destination block. */
1823 if (EDGE_COUNT (base_bb
->succs
) == 0
1824 && gimple_seq_unreachable_p (bb_seq (base_bb
))
1825 /* Don't optimize this if __builtin_unreachable () is the
1826 implicitly added one by the C++ FE too early, before
1827 -Wreturn-type can be diagnosed. We'll optimize it later
1828 during switchconv pass or any other cfg cleanup. */
1829 && (gimple_in_ssa_p (cfun
)
1830 || (LOCATION_LOCUS (gimple_location (last_stmt (base_bb
)))
1831 != BUILTINS_LOCATION
)))
1833 edge base_edge
= find_edge (gimple_bb (stmt
), base_bb
);
1834 if (base_edge
!= NULL
)
1835 remove_edge_and_dominated_blocks (base_edge
);
1841 gimple_switch_set_label (stmt
, new_size
,
1842 gimple_switch_label (stmt
, i
));
1847 gcc_assert (new_size
<= old_size
);
1849 if (new_size
< old_size
)
1850 gimple_switch_set_num_labels (stmt
, new_size
);
1852 return new_size
< old_size
;
1855 /* Look for blocks ending in a multiway branch (a GIMPLE_SWITCH),
1856 and scan the sorted vector of cases. Combine the ones jumping to the
1860 group_case_labels (void)
1863 bool changed
= false;
1865 FOR_EACH_BB_FN (bb
, cfun
)
1867 gimple
*stmt
= last_stmt (bb
);
1868 if (stmt
&& gimple_code (stmt
) == GIMPLE_SWITCH
)
1869 changed
|= group_case_labels_stmt (as_a
<gswitch
*> (stmt
));
1875 /* Checks whether we can merge block B into block A. */
1878 gimple_can_merge_blocks_p (basic_block a
, basic_block b
)
1882 if (!single_succ_p (a
))
1885 if (single_succ_edge (a
)->flags
& EDGE_COMPLEX
)
1888 if (single_succ (a
) != b
)
1891 if (!single_pred_p (b
))
1894 if (a
== ENTRY_BLOCK_PTR_FOR_FN (cfun
)
1895 || b
== EXIT_BLOCK_PTR_FOR_FN (cfun
))
1898 /* If A ends by a statement causing exceptions or something similar, we
1899 cannot merge the blocks. */
1900 stmt
= last_stmt (a
);
1901 if (stmt
&& stmt_ends_bb_p (stmt
))
1904 /* Do not allow a block with only a non-local label to be merged. */
1906 if (glabel
*label_stmt
= dyn_cast
<glabel
*> (stmt
))
1907 if (DECL_NONLOCAL (gimple_label_label (label_stmt
)))
1910 /* Examine the labels at the beginning of B. */
1911 for (gimple_stmt_iterator gsi
= gsi_start_bb (b
); !gsi_end_p (gsi
);
1915 glabel
*label_stmt
= dyn_cast
<glabel
*> (gsi_stmt (gsi
));
1918 lab
= gimple_label_label (label_stmt
);
1920 /* Do not remove user forced labels or for -O0 any user labels. */
1921 if (!DECL_ARTIFICIAL (lab
) && (!optimize
|| FORCED_LABEL (lab
)))
1925 /* Protect simple loop latches. We only want to avoid merging
1926 the latch with the loop header or with a block in another
1927 loop in this case. */
1929 && b
->loop_father
->latch
== b
1930 && loops_state_satisfies_p (LOOPS_HAVE_SIMPLE_LATCHES
)
1931 && (b
->loop_father
->header
== a
1932 || b
->loop_father
!= a
->loop_father
))
1935 /* It must be possible to eliminate all phi nodes in B. If ssa form
1936 is not up-to-date and a name-mapping is registered, we cannot eliminate
1937 any phis. Symbols marked for renaming are never a problem though. */
1938 for (gphi_iterator gsi
= gsi_start_phis (b
); !gsi_end_p (gsi
);
1941 gphi
*phi
= gsi
.phi ();
1942 /* Technically only new names matter. */
1943 if (name_registered_for_update_p (PHI_RESULT (phi
)))
1947 /* When not optimizing, don't merge if we'd lose goto_locus. */
1949 && single_succ_edge (a
)->goto_locus
!= UNKNOWN_LOCATION
)
1951 location_t goto_locus
= single_succ_edge (a
)->goto_locus
;
1952 gimple_stmt_iterator prev
, next
;
1953 prev
= gsi_last_nondebug_bb (a
);
1954 next
= gsi_after_labels (b
);
1955 if (!gsi_end_p (next
) && is_gimple_debug (gsi_stmt (next
)))
1956 gsi_next_nondebug (&next
);
1957 if ((gsi_end_p (prev
)
1958 || gimple_location (gsi_stmt (prev
)) != goto_locus
)
1959 && (gsi_end_p (next
)
1960 || gimple_location (gsi_stmt (next
)) != goto_locus
))
1967 /* Replaces all uses of NAME by VAL. */
1970 replace_uses_by (tree name
, tree val
)
1972 imm_use_iterator imm_iter
;
1977 FOR_EACH_IMM_USE_STMT (stmt
, imm_iter
, name
)
1979 /* Mark the block if we change the last stmt in it. */
1980 if (cfgcleanup_altered_bbs
1981 && stmt_ends_bb_p (stmt
))
1982 bitmap_set_bit (cfgcleanup_altered_bbs
, gimple_bb (stmt
)->index
);
1984 FOR_EACH_IMM_USE_ON_STMT (use
, imm_iter
)
1986 replace_exp (use
, val
);
1988 if (gimple_code (stmt
) == GIMPLE_PHI
)
1990 e
= gimple_phi_arg_edge (as_a
<gphi
*> (stmt
),
1991 PHI_ARG_INDEX_FROM_USE (use
));
1992 if (e
->flags
& EDGE_ABNORMAL
1993 && !SSA_NAME_OCCURS_IN_ABNORMAL_PHI (val
))
1995 /* This can only occur for virtual operands, since
1996 for the real ones SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name))
1997 would prevent replacement. */
1998 gcc_checking_assert (virtual_operand_p (name
));
1999 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (val
) = 1;
2004 if (gimple_code (stmt
) != GIMPLE_PHI
)
2006 gimple_stmt_iterator gsi
= gsi_for_stmt (stmt
);
2007 gimple
*orig_stmt
= stmt
;
2010 /* FIXME. It shouldn't be required to keep TREE_CONSTANT
2011 on ADDR_EXPRs up-to-date on GIMPLE. Propagation will
2012 only change sth from non-invariant to invariant, and only
2013 when propagating constants. */
2014 if (is_gimple_min_invariant (val
))
2015 for (i
= 0; i
< gimple_num_ops (stmt
); i
++)
2017 tree op
= gimple_op (stmt
, i
);
2018 /* Operands may be empty here. For example, the labels
2019 of a GIMPLE_COND are nulled out following the creation
2020 of the corresponding CFG edges. */
2021 if (op
&& TREE_CODE (op
) == ADDR_EXPR
)
2022 recompute_tree_invariant_for_addr_expr (op
);
2025 if (fold_stmt (&gsi
))
2026 stmt
= gsi_stmt (gsi
);
2028 if (maybe_clean_or_replace_eh_stmt (orig_stmt
, stmt
))
2029 gimple_purge_dead_eh_edges (gimple_bb (stmt
));
2035 gcc_checking_assert (has_zero_uses (name
));
2037 /* Also update the trees stored in loop structures. */
2042 FOR_EACH_LOOP (loop
, 0)
2044 substitute_in_loop_info (loop
, name
, val
);
2049 /* Merge block B into block A. */
2052 gimple_merge_blocks (basic_block a
, basic_block b
)
2054 gimple_stmt_iterator last
, gsi
;
2058 fprintf (dump_file
, "Merging blocks %d and %d\n", a
->index
, b
->index
);
2060 /* Remove all single-valued PHI nodes from block B of the form
2061 V_i = PHI <V_j> by propagating V_j to all the uses of V_i. */
2062 gsi
= gsi_last_bb (a
);
2063 for (psi
= gsi_start_phis (b
); !gsi_end_p (psi
); )
2065 gimple
*phi
= gsi_stmt (psi
);
2066 tree def
= gimple_phi_result (phi
), use
= gimple_phi_arg_def (phi
, 0);
2068 bool may_replace_uses
= (virtual_operand_p (def
)
2069 || may_propagate_copy (def
, use
));
2071 /* In case we maintain loop closed ssa form, do not propagate arguments
2072 of loop exit phi nodes. */
2074 && loops_state_satisfies_p (LOOP_CLOSED_SSA
)
2075 && !virtual_operand_p (def
)
2076 && TREE_CODE (use
) == SSA_NAME
2077 && a
->loop_father
!= b
->loop_father
)
2078 may_replace_uses
= false;
2080 if (!may_replace_uses
)
2082 gcc_assert (!virtual_operand_p (def
));
2084 /* Note that just emitting the copies is fine -- there is no problem
2085 with ordering of phi nodes. This is because A is the single
2086 predecessor of B, therefore results of the phi nodes cannot
2087 appear as arguments of the phi nodes. */
2088 copy
= gimple_build_assign (def
, use
);
2089 gsi_insert_after (&gsi
, copy
, GSI_NEW_STMT
);
2090 remove_phi_node (&psi
, false);
2094 /* If we deal with a PHI for virtual operands, we can simply
2095 propagate these without fussing with folding or updating
2097 if (virtual_operand_p (def
))
2099 imm_use_iterator iter
;
2100 use_operand_p use_p
;
2103 FOR_EACH_IMM_USE_STMT (stmt
, iter
, def
)
2104 FOR_EACH_IMM_USE_ON_STMT (use_p
, iter
)
2105 SET_USE (use_p
, use
);
2107 if (SSA_NAME_OCCURS_IN_ABNORMAL_PHI (def
))
2108 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (use
) = 1;
2111 replace_uses_by (def
, use
);
2113 remove_phi_node (&psi
, true);
2117 /* Ensure that B follows A. */
2118 move_block_after (b
, a
);
2120 gcc_assert (single_succ_edge (a
)->flags
& EDGE_FALLTHRU
);
2121 gcc_assert (!last_stmt (a
) || !stmt_ends_bb_p (last_stmt (a
)));
2123 /* Remove labels from B and set gimple_bb to A for other statements. */
2124 for (gsi
= gsi_start_bb (b
); !gsi_end_p (gsi
);)
2126 gimple
*stmt
= gsi_stmt (gsi
);
2127 if (glabel
*label_stmt
= dyn_cast
<glabel
*> (stmt
))
2129 tree label
= gimple_label_label (label_stmt
);
2132 gsi_remove (&gsi
, false);
2134 /* Now that we can thread computed gotos, we might have
2135 a situation where we have a forced label in block B
2136 However, the label at the start of block B might still be
2137 used in other ways (think about the runtime checking for
2138 Fortran assigned gotos). So we can not just delete the
2139 label. Instead we move the label to the start of block A. */
2140 if (FORCED_LABEL (label
))
2142 gimple_stmt_iterator dest_gsi
= gsi_start_bb (a
);
2143 gsi_insert_before (&dest_gsi
, stmt
, GSI_NEW_STMT
);
2145 /* Other user labels keep around in a form of a debug stmt. */
2146 else if (!DECL_ARTIFICIAL (label
) && MAY_HAVE_DEBUG_BIND_STMTS
)
2148 gimple
*dbg
= gimple_build_debug_bind (label
,
2151 gimple_debug_bind_reset_value (dbg
);
2152 gsi_insert_before (&gsi
, dbg
, GSI_SAME_STMT
);
2155 lp_nr
= EH_LANDING_PAD_NR (label
);
2158 eh_landing_pad lp
= get_eh_landing_pad_from_number (lp_nr
);
2159 lp
->post_landing_pad
= NULL
;
2164 gimple_set_bb (stmt
, a
);
2169 /* When merging two BBs, if their counts are different, the larger count
2170 is selected as the new bb count. This is to handle inconsistent
2172 if (a
->loop_father
== b
->loop_father
)
2174 a
->count
= a
->count
.merge (b
->count
);
2177 /* Merge the sequences. */
2178 last
= gsi_last_bb (a
);
2179 gsi_insert_seq_after (&last
, bb_seq (b
), GSI_NEW_STMT
);
2180 set_bb_seq (b
, NULL
);
2182 if (cfgcleanup_altered_bbs
)
2183 bitmap_set_bit (cfgcleanup_altered_bbs
, a
->index
);
2187 /* Return the one of two successors of BB that is not reachable by a
2188 complex edge, if there is one. Else, return BB. We use
2189 this in optimizations that use post-dominators for their heuristics,
2190 to catch the cases in C++ where function calls are involved. */
2193 single_noncomplex_succ (basic_block bb
)
2196 if (EDGE_COUNT (bb
->succs
) != 2)
2199 e0
= EDGE_SUCC (bb
, 0);
2200 e1
= EDGE_SUCC (bb
, 1);
2201 if (e0
->flags
& EDGE_COMPLEX
)
2203 if (e1
->flags
& EDGE_COMPLEX
)
2209 /* T is CALL_EXPR. Set current_function_calls_* flags. */
2212 notice_special_calls (gcall
*call
)
2214 int flags
= gimple_call_flags (call
);
2216 if (flags
& ECF_MAY_BE_ALLOCA
)
2217 cfun
->calls_alloca
= true;
2218 if (flags
& ECF_RETURNS_TWICE
)
2219 cfun
->calls_setjmp
= true;
2223 /* Clear flags set by notice_special_calls. Used by dead code removal
2224 to update the flags. */
2227 clear_special_calls (void)
2229 cfun
->calls_alloca
= false;
2230 cfun
->calls_setjmp
= false;
2233 /* Remove PHI nodes associated with basic block BB and all edges out of BB. */
2236 remove_phi_nodes_and_edges_for_unreachable_block (basic_block bb
)
2238 /* Since this block is no longer reachable, we can just delete all
2239 of its PHI nodes. */
2240 remove_phi_nodes (bb
);
2242 /* Remove edges to BB's successors. */
2243 while (EDGE_COUNT (bb
->succs
) > 0)
2244 remove_edge (EDGE_SUCC (bb
, 0));
2248 /* Remove statements of basic block BB. */
2251 remove_bb (basic_block bb
)
2253 gimple_stmt_iterator i
;
2257 fprintf (dump_file
, "Removing basic block %d\n", bb
->index
);
2258 if (dump_flags
& TDF_DETAILS
)
2260 dump_bb (dump_file
, bb
, 0, TDF_BLOCKS
);
2261 fprintf (dump_file
, "\n");
2267 struct loop
*loop
= bb
->loop_father
;
2269 /* If a loop gets removed, clean up the information associated
2271 if (loop
->latch
== bb
2272 || loop
->header
== bb
)
2273 free_numbers_of_iterations_estimates (loop
);
2276 /* Remove all the instructions in the block. */
2277 if (bb_seq (bb
) != NULL
)
2279 /* Walk backwards so as to get a chance to substitute all
2280 released DEFs into debug stmts. See
2281 eliminate_unnecessary_stmts() in tree-ssa-dce.c for more
2283 for (i
= gsi_last_bb (bb
); !gsi_end_p (i
);)
2285 gimple
*stmt
= gsi_stmt (i
);
2286 glabel
*label_stmt
= dyn_cast
<glabel
*> (stmt
);
2288 && (FORCED_LABEL (gimple_label_label (label_stmt
))
2289 || DECL_NONLOCAL (gimple_label_label (label_stmt
))))
2292 gimple_stmt_iterator new_gsi
;
2294 /* A non-reachable non-local label may still be referenced.
2295 But it no longer needs to carry the extra semantics of
2297 if (DECL_NONLOCAL (gimple_label_label (label_stmt
)))
2299 DECL_NONLOCAL (gimple_label_label (label_stmt
)) = 0;
2300 FORCED_LABEL (gimple_label_label (label_stmt
)) = 1;
2303 new_bb
= bb
->prev_bb
;
2304 /* Don't move any labels into ENTRY block. */
2305 if (new_bb
== ENTRY_BLOCK_PTR_FOR_FN (cfun
))
2307 new_bb
= single_succ (new_bb
);
2308 gcc_assert (new_bb
!= bb
);
2310 new_gsi
= gsi_start_bb (new_bb
);
2311 gsi_remove (&i
, false);
2312 gsi_insert_before (&new_gsi
, stmt
, GSI_NEW_STMT
);
2316 /* Release SSA definitions. */
2317 release_defs (stmt
);
2318 gsi_remove (&i
, true);
2322 i
= gsi_last_bb (bb
);
2328 remove_phi_nodes_and_edges_for_unreachable_block (bb
);
2329 bb
->il
.gimple
.seq
= NULL
;
2330 bb
->il
.gimple
.phi_nodes
= NULL
;
2334 /* Given a basic block BB and a value VAL for use in the final statement
2335 of the block (if a GIMPLE_COND, GIMPLE_SWITCH, or computed goto), return
2336 the edge that will be taken out of the block.
2337 If VAL is NULL_TREE, then the current value of the final statement's
2338 predicate or index is used.
2339 If the value does not match a unique edge, NULL is returned. */
2342 find_taken_edge (basic_block bb
, tree val
)
2346 stmt
= last_stmt (bb
);
2348 /* Handle ENTRY and EXIT. */
2352 if (gimple_code (stmt
) == GIMPLE_COND
)
2353 return find_taken_edge_cond_expr (as_a
<gcond
*> (stmt
), val
);
2355 if (gimple_code (stmt
) == GIMPLE_SWITCH
)
2356 return find_taken_edge_switch_expr (as_a
<gswitch
*> (stmt
), val
);
2358 if (computed_goto_p (stmt
))
2360 /* Only optimize if the argument is a label, if the argument is
2361 not a label then we can not construct a proper CFG.
2363 It may be the case that we only need to allow the LABEL_REF to
2364 appear inside an ADDR_EXPR, but we also allow the LABEL_REF to
2365 appear inside a LABEL_EXPR just to be safe. */
2367 && (TREE_CODE (val
) == ADDR_EXPR
|| TREE_CODE (val
) == LABEL_EXPR
)
2368 && TREE_CODE (TREE_OPERAND (val
, 0)) == LABEL_DECL
)
2369 return find_taken_edge_computed_goto (bb
, TREE_OPERAND (val
, 0));
2372 /* Otherwise we only know the taken successor edge if it's unique. */
2373 return single_succ_p (bb
) ? single_succ_edge (bb
) : NULL
;
2376 /* Given a constant value VAL and the entry block BB to a GOTO_EXPR
2377 statement, determine which of the outgoing edges will be taken out of the
2378 block. Return NULL if either edge may be taken. */
2381 find_taken_edge_computed_goto (basic_block bb
, tree val
)
2386 dest
= label_to_block (val
);
2388 e
= find_edge (bb
, dest
);
2390 /* It's possible for find_edge to return NULL here on invalid code
2391 that abuses the labels-as-values extension (e.g. code that attempts to
2392 jump *between* functions via stored labels-as-values; PR 84136).
2393 If so, then we simply return that NULL for the edge.
2394 We don't currently have a way of detecting such invalid code, so we
2395 can't assert that it was the case when a NULL edge occurs here. */
2400 /* Given COND_STMT and a constant value VAL for use as the predicate,
2401 determine which of the two edges will be taken out of
2402 the statement's block. Return NULL if either edge may be taken.
2403 If VAL is NULL_TREE, then the current value of COND_STMT's predicate
2407 find_taken_edge_cond_expr (const gcond
*cond_stmt
, tree val
)
2409 edge true_edge
, false_edge
;
2411 if (val
== NULL_TREE
)
2413 /* Use the current value of the predicate. */
2414 if (gimple_cond_true_p (cond_stmt
))
2415 val
= integer_one_node
;
2416 else if (gimple_cond_false_p (cond_stmt
))
2417 val
= integer_zero_node
;
2421 else if (TREE_CODE (val
) != INTEGER_CST
)
2424 extract_true_false_edges_from_block (gimple_bb (cond_stmt
),
2425 &true_edge
, &false_edge
);
2427 return (integer_zerop (val
) ? false_edge
: true_edge
);
2430 /* Given SWITCH_STMT and an INTEGER_CST VAL for use as the index, determine
2431 which edge will be taken out of the statement's block. Return NULL if any
2433 If VAL is NULL_TREE, then the current value of SWITCH_STMT's index
2437 find_taken_edge_switch_expr (const gswitch
*switch_stmt
, tree val
)
2439 basic_block dest_bb
;
2443 if (gimple_switch_num_labels (switch_stmt
) == 1)
2444 taken_case
= gimple_switch_default_label (switch_stmt
);
2447 if (val
== NULL_TREE
)
2448 val
= gimple_switch_index (switch_stmt
);
2449 if (TREE_CODE (val
) != INTEGER_CST
)
2452 taken_case
= find_case_label_for_value (switch_stmt
, val
);
2454 dest_bb
= label_to_block (CASE_LABEL (taken_case
));
2456 e
= find_edge (gimple_bb (switch_stmt
), dest_bb
);
2462 /* Return the CASE_LABEL_EXPR that SWITCH_STMT will take for VAL.
2463 We can make optimal use here of the fact that the case labels are
2464 sorted: We can do a binary search for a case matching VAL. */
2467 find_case_label_for_value (const gswitch
*switch_stmt
, tree val
)
2469 size_t low
, high
, n
= gimple_switch_num_labels (switch_stmt
);
2470 tree default_case
= gimple_switch_default_label (switch_stmt
);
2472 for (low
= 0, high
= n
; high
- low
> 1; )
2474 size_t i
= (high
+ low
) / 2;
2475 tree t
= gimple_switch_label (switch_stmt
, i
);
2478 /* Cache the result of comparing CASE_LOW and val. */
2479 cmp
= tree_int_cst_compare (CASE_LOW (t
), val
);
2486 if (CASE_HIGH (t
) == NULL
)
2488 /* A singe-valued case label. */
2494 /* A case range. We can only handle integer ranges. */
2495 if (cmp
<= 0 && tree_int_cst_compare (CASE_HIGH (t
), val
) >= 0)
2500 return default_case
;
2504 /* Dump a basic block on stderr. */
2507 gimple_debug_bb (basic_block bb
)
2509 dump_bb (stderr
, bb
, 0, TDF_VOPS
|TDF_MEMSYMS
|TDF_BLOCKS
);
2513 /* Dump basic block with index N on stderr. */
2516 gimple_debug_bb_n (int n
)
2518 gimple_debug_bb (BASIC_BLOCK_FOR_FN (cfun
, n
));
2519 return BASIC_BLOCK_FOR_FN (cfun
, n
);
2523 /* Dump the CFG on stderr.
2525 FLAGS are the same used by the tree dumping functions
2526 (see TDF_* in dumpfile.h). */
2529 gimple_debug_cfg (dump_flags_t flags
)
2531 gimple_dump_cfg (stderr
, flags
);
2535 /* Dump the program showing basic block boundaries on the given FILE.
2537 FLAGS are the same used by the tree dumping functions (see TDF_* in
2541 gimple_dump_cfg (FILE *file
, dump_flags_t flags
)
2543 if (flags
& TDF_DETAILS
)
2545 dump_function_header (file
, current_function_decl
, flags
);
2546 fprintf (file
, ";; \n%d basic blocks, %d edges, last basic block %d.\n\n",
2547 n_basic_blocks_for_fn (cfun
), n_edges_for_fn (cfun
),
2548 last_basic_block_for_fn (cfun
));
2550 brief_dump_cfg (file
, flags
);
2551 fprintf (file
, "\n");
2554 if (flags
& TDF_STATS
)
2555 dump_cfg_stats (file
);
2557 dump_function_to_file (current_function_decl
, file
, flags
| TDF_BLOCKS
);
2561 /* Dump CFG statistics on FILE. */
2564 dump_cfg_stats (FILE *file
)
2566 static long max_num_merged_labels
= 0;
2567 unsigned long size
, total
= 0;
2570 const char * const fmt_str
= "%-30s%-13s%12s\n";
2571 const char * const fmt_str_1
= "%-30s%13d%11lu%c\n";
2572 const char * const fmt_str_2
= "%-30s%13ld%11lu%c\n";
2573 const char * const fmt_str_3
= "%-43s%11lu%c\n";
2574 const char *funcname
= current_function_name ();
2576 fprintf (file
, "\nCFG Statistics for %s\n\n", funcname
);
2578 fprintf (file
, "---------------------------------------------------------\n");
2579 fprintf (file
, fmt_str
, "", " Number of ", "Memory");
2580 fprintf (file
, fmt_str
, "", " instances ", "used ");
2581 fprintf (file
, "---------------------------------------------------------\n");
2583 size
= n_basic_blocks_for_fn (cfun
) * sizeof (struct basic_block_def
);
2585 fprintf (file
, fmt_str_1
, "Basic blocks", n_basic_blocks_for_fn (cfun
),
2586 SCALE (size
), LABEL (size
));
2589 FOR_EACH_BB_FN (bb
, cfun
)
2590 num_edges
+= EDGE_COUNT (bb
->succs
);
2591 size
= num_edges
* sizeof (struct edge_def
);
2593 fprintf (file
, fmt_str_2
, "Edges", num_edges
, SCALE (size
), LABEL (size
));
2595 fprintf (file
, "---------------------------------------------------------\n");
2596 fprintf (file
, fmt_str_3
, "Total memory used by CFG data", SCALE (total
),
2598 fprintf (file
, "---------------------------------------------------------\n");
2599 fprintf (file
, "\n");
2601 if (cfg_stats
.num_merged_labels
> max_num_merged_labels
)
2602 max_num_merged_labels
= cfg_stats
.num_merged_labels
;
2604 fprintf (file
, "Coalesced label blocks: %ld (Max so far: %ld)\n",
2605 cfg_stats
.num_merged_labels
, max_num_merged_labels
);
2607 fprintf (file
, "\n");
2611 /* Dump CFG statistics on stderr. Keep extern so that it's always
2612 linked in the final executable. */
2615 debug_cfg_stats (void)
2617 dump_cfg_stats (stderr
);
2620 /*---------------------------------------------------------------------------
2621 Miscellaneous helpers
2622 ---------------------------------------------------------------------------*/
2624 /* Return true if T, a GIMPLE_CALL, can make an abnormal transfer of control
2625 flow. Transfers of control flow associated with EH are excluded. */
2628 call_can_make_abnormal_goto (gimple
*t
)
2630 /* If the function has no non-local labels, then a call cannot make an
2631 abnormal transfer of control. */
2632 if (!cfun
->has_nonlocal_label
2633 && !cfun
->calls_setjmp
)
2636 /* Likewise if the call has no side effects. */
2637 if (!gimple_has_side_effects (t
))
2640 /* Likewise if the called function is leaf. */
2641 if (gimple_call_flags (t
) & ECF_LEAF
)
2648 /* Return true if T can make an abnormal transfer of control flow.
2649 Transfers of control flow associated with EH are excluded. */
2652 stmt_can_make_abnormal_goto (gimple
*t
)
2654 if (computed_goto_p (t
))
2656 if (is_gimple_call (t
))
2657 return call_can_make_abnormal_goto (t
);
2662 /* Return true if T represents a stmt that always transfers control. */
2665 is_ctrl_stmt (gimple
*t
)
2667 switch (gimple_code (t
))
2681 /* Return true if T is a statement that may alter the flow of control
2682 (e.g., a call to a non-returning function). */
2685 is_ctrl_altering_stmt (gimple
*t
)
2689 switch (gimple_code (t
))
2692 /* Per stmt call flag indicates whether the call could alter
2694 if (gimple_call_ctrl_altering_p (t
))
2698 case GIMPLE_EH_DISPATCH
:
2699 /* EH_DISPATCH branches to the individual catch handlers at
2700 this level of a try or allowed-exceptions region. It can
2701 fallthru to the next statement as well. */
2705 if (gimple_asm_nlabels (as_a
<gasm
*> (t
)) > 0)
2710 /* OpenMP directives alter control flow. */
2713 case GIMPLE_TRANSACTION
:
2714 /* A transaction start alters control flow. */
2721 /* If a statement can throw, it alters control flow. */
2722 return stmt_can_throw_internal (t
);
2726 /* Return true if T is a simple local goto. */
2729 simple_goto_p (gimple
*t
)
2731 return (gimple_code (t
) == GIMPLE_GOTO
2732 && TREE_CODE (gimple_goto_dest (t
)) == LABEL_DECL
);
2736 /* Return true if STMT should start a new basic block. PREV_STMT is
2737 the statement preceding STMT. It is used when STMT is a label or a
2738 case label. Labels should only start a new basic block if their
2739 previous statement wasn't a label. Otherwise, sequence of labels
2740 would generate unnecessary basic blocks that only contain a single
2744 stmt_starts_bb_p (gimple
*stmt
, gimple
*prev_stmt
)
2749 /* PREV_STMT is only set to a debug stmt if the debug stmt is before
2750 any nondebug stmts in the block. We don't want to start another
2751 block in this case: the debug stmt will already have started the
2752 one STMT would start if we weren't outputting debug stmts. */
2753 if (prev_stmt
&& is_gimple_debug (prev_stmt
))
2756 /* Labels start a new basic block only if the preceding statement
2757 wasn't a label of the same type. This prevents the creation of
2758 consecutive blocks that have nothing but a single label. */
2759 if (glabel
*label_stmt
= dyn_cast
<glabel
*> (stmt
))
2761 /* Nonlocal and computed GOTO targets always start a new block. */
2762 if (DECL_NONLOCAL (gimple_label_label (label_stmt
))
2763 || FORCED_LABEL (gimple_label_label (label_stmt
)))
2766 if (prev_stmt
&& gimple_code (prev_stmt
) == GIMPLE_LABEL
)
2768 if (DECL_NONLOCAL (gimple_label_label (
2769 as_a
<glabel
*> (prev_stmt
))))
2772 cfg_stats
.num_merged_labels
++;
2778 else if (gimple_code (stmt
) == GIMPLE_CALL
)
2780 if (gimple_call_flags (stmt
) & ECF_RETURNS_TWICE
)
2781 /* setjmp acts similar to a nonlocal GOTO target and thus should
2782 start a new block. */
2784 if (gimple_call_internal_p (stmt
, IFN_PHI
)
2786 && gimple_code (prev_stmt
) != GIMPLE_LABEL
2787 && (gimple_code (prev_stmt
) != GIMPLE_CALL
2788 || ! gimple_call_internal_p (prev_stmt
, IFN_PHI
)))
2789 /* PHI nodes start a new block unless preceeded by a label
2798 /* Return true if T should end a basic block. */
2801 stmt_ends_bb_p (gimple
*t
)
2803 return is_ctrl_stmt (t
) || is_ctrl_altering_stmt (t
);
2806 /* Remove block annotations and other data structures. */
2809 delete_tree_cfg_annotations (struct function
*fn
)
2811 vec_free (label_to_block_map_for_fn (fn
));
2814 /* Return the virtual phi in BB. */
2817 get_virtual_phi (basic_block bb
)
2819 for (gphi_iterator gsi
= gsi_start_phis (bb
);
2823 gphi
*phi
= gsi
.phi ();
2825 if (virtual_operand_p (PHI_RESULT (phi
)))
2832 /* Return the first statement in basic block BB. */
2835 first_stmt (basic_block bb
)
2837 gimple_stmt_iterator i
= gsi_start_bb (bb
);
2838 gimple
*stmt
= NULL
;
2840 while (!gsi_end_p (i
) && is_gimple_debug ((stmt
= gsi_stmt (i
))))
2848 /* Return the first non-label statement in basic block BB. */
2851 first_non_label_stmt (basic_block bb
)
2853 gimple_stmt_iterator i
= gsi_start_bb (bb
);
2854 while (!gsi_end_p (i
) && gimple_code (gsi_stmt (i
)) == GIMPLE_LABEL
)
2856 return !gsi_end_p (i
) ? gsi_stmt (i
) : NULL
;
2859 /* Return the last statement in basic block BB. */
2862 last_stmt (basic_block bb
)
2864 gimple_stmt_iterator i
= gsi_last_bb (bb
);
2865 gimple
*stmt
= NULL
;
2867 while (!gsi_end_p (i
) && is_gimple_debug ((stmt
= gsi_stmt (i
))))
2875 /* Return the last statement of an otherwise empty block. Return NULL
2876 if the block is totally empty, or if it contains more than one
2880 last_and_only_stmt (basic_block bb
)
2882 gimple_stmt_iterator i
= gsi_last_nondebug_bb (bb
);
2883 gimple
*last
, *prev
;
2888 last
= gsi_stmt (i
);
2889 gsi_prev_nondebug (&i
);
2893 /* Empty statements should no longer appear in the instruction stream.
2894 Everything that might have appeared before should be deleted by
2895 remove_useless_stmts, and the optimizers should just gsi_remove
2896 instead of smashing with build_empty_stmt.
2898 Thus the only thing that should appear here in a block containing
2899 one executable statement is a label. */
2900 prev
= gsi_stmt (i
);
2901 if (gimple_code (prev
) == GIMPLE_LABEL
)
2907 /* Reinstall those PHI arguments queued in OLD_EDGE to NEW_EDGE. */
2910 reinstall_phi_args (edge new_edge
, edge old_edge
)
2916 vec
<edge_var_map
> *v
= redirect_edge_var_map_vector (old_edge
);
2920 for (i
= 0, phis
= gsi_start_phis (new_edge
->dest
);
2921 v
->iterate (i
, &vm
) && !gsi_end_p (phis
);
2922 i
++, gsi_next (&phis
))
2924 gphi
*phi
= phis
.phi ();
2925 tree result
= redirect_edge_var_map_result (vm
);
2926 tree arg
= redirect_edge_var_map_def (vm
);
2928 gcc_assert (result
== gimple_phi_result (phi
));
2930 add_phi_arg (phi
, arg
, new_edge
, redirect_edge_var_map_location (vm
));
2933 redirect_edge_var_map_clear (old_edge
);
2936 /* Returns the basic block after which the new basic block created
2937 by splitting edge EDGE_IN should be placed. Tries to keep the new block
2938 near its "logical" location. This is of most help to humans looking
2939 at debugging dumps. */
2942 split_edge_bb_loc (edge edge_in
)
2944 basic_block dest
= edge_in
->dest
;
2945 basic_block dest_prev
= dest
->prev_bb
;
2949 edge e
= find_edge (dest_prev
, dest
);
2950 if (e
&& !(e
->flags
& EDGE_COMPLEX
))
2951 return edge_in
->src
;
2956 /* Split a (typically critical) edge EDGE_IN. Return the new block.
2957 Abort on abnormal edges. */
2960 gimple_split_edge (edge edge_in
)
2962 basic_block new_bb
, after_bb
, dest
;
2965 /* Abnormal edges cannot be split. */
2966 gcc_assert (!(edge_in
->flags
& EDGE_ABNORMAL
));
2968 dest
= edge_in
->dest
;
2970 after_bb
= split_edge_bb_loc (edge_in
);
2972 new_bb
= create_empty_bb (after_bb
);
2973 new_bb
->count
= edge_in
->count ();
2975 e
= redirect_edge_and_branch (edge_in
, new_bb
);
2976 gcc_assert (e
== edge_in
);
2978 new_edge
= make_single_succ_edge (new_bb
, dest
, EDGE_FALLTHRU
);
2979 reinstall_phi_args (new_edge
, e
);
2985 /* Verify properties of the address expression T with base object BASE. */
2988 verify_address (tree t
, tree base
)
2991 bool old_side_effects
;
2993 bool new_side_effects
;
2995 old_constant
= TREE_CONSTANT (t
);
2996 old_side_effects
= TREE_SIDE_EFFECTS (t
);
2998 recompute_tree_invariant_for_addr_expr (t
);
2999 new_side_effects
= TREE_SIDE_EFFECTS (t
);
3000 new_constant
= TREE_CONSTANT (t
);
3002 if (old_constant
!= new_constant
)
3004 error ("constant not recomputed when ADDR_EXPR changed");
3007 if (old_side_effects
!= new_side_effects
)
3009 error ("side effects not recomputed when ADDR_EXPR changed");
3014 || TREE_CODE (base
) == PARM_DECL
3015 || TREE_CODE (base
) == RESULT_DECL
))
3018 if (DECL_GIMPLE_REG_P (base
))
3020 error ("DECL_GIMPLE_REG_P set on a variable with address taken");
3027 /* Callback for walk_tree, check that all elements with address taken are
3028 properly noticed as such. The DATA is an int* that is 1 if TP was seen
3029 inside a PHI node. */
3032 verify_expr (tree
*tp
, int *walk_subtrees
, void *data ATTRIBUTE_UNUSED
)
3039 /* Check operand N for being valid GIMPLE and give error MSG if not. */
3040 #define CHECK_OP(N, MSG) \
3041 do { if (!is_gimple_val (TREE_OPERAND (t, N))) \
3042 { error (MSG); return TREE_OPERAND (t, N); }} while (0)
3044 switch (TREE_CODE (t
))
3047 if (SSA_NAME_IN_FREE_LIST (t
))
3049 error ("SSA name in freelist but still referenced");
3058 tree context
= decl_function_context (t
);
3059 if (context
!= cfun
->decl
3060 && !SCOPE_FILE_SCOPE_P (context
)
3062 && !DECL_EXTERNAL (t
))
3064 error ("Local declaration from a different function");
3071 error ("INDIRECT_REF in gimple IL");
3075 x
= TREE_OPERAND (t
, 0);
3076 if (!POINTER_TYPE_P (TREE_TYPE (x
))
3077 || !is_gimple_mem_ref_addr (x
))
3079 error ("invalid first operand of MEM_REF");
3082 if (!poly_int_tree_p (TREE_OPERAND (t
, 1))
3083 || !POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (t
, 1))))
3085 error ("invalid offset operand of MEM_REF");
3086 return TREE_OPERAND (t
, 1);
3088 if (TREE_CODE (x
) == ADDR_EXPR
)
3090 tree va
= verify_address (x
, TREE_OPERAND (x
, 0));
3093 x
= TREE_OPERAND (x
, 0);
3095 walk_tree (&x
, verify_expr
, data
, NULL
);
3100 x
= fold (ASSERT_EXPR_COND (t
));
3101 if (x
== boolean_false_node
)
3103 error ("ASSERT_EXPR with an always-false condition");
3109 error ("MODIFY_EXPR not expected while having tuples");
3116 gcc_assert (is_gimple_address (t
));
3118 /* Skip any references (they will be checked when we recurse down the
3119 tree) and ensure that any variable used as a prefix is marked
3121 for (x
= TREE_OPERAND (t
, 0);
3122 handled_component_p (x
);
3123 x
= TREE_OPERAND (x
, 0))
3126 if ((tem
= verify_address (t
, x
)))
3130 || TREE_CODE (x
) == PARM_DECL
3131 || TREE_CODE (x
) == RESULT_DECL
))
3134 if (!TREE_ADDRESSABLE (x
))
3136 error ("address taken, but ADDRESSABLE bit not set");
3146 case NON_LVALUE_EXPR
:
3147 case TRUTH_NOT_EXPR
:
3151 case FIX_TRUNC_EXPR
:
3161 if (!is_gimple_reg_type (TREE_TYPE (t
)))
3163 error ("non-scalar BIT_FIELD_REF, IMAGPART_EXPR or REALPART_EXPR");
3167 if (TREE_CODE (t
) == BIT_FIELD_REF
)
3169 tree t0
= TREE_OPERAND (t
, 0);
3170 tree t1
= TREE_OPERAND (t
, 1);
3171 tree t2
= TREE_OPERAND (t
, 2);
3172 poly_uint64 size
, bitpos
;
3173 if (!poly_int_tree_p (t1
, &size
)
3174 || !poly_int_tree_p (t2
, &bitpos
)
3175 || !types_compatible_p (bitsizetype
, TREE_TYPE (t1
))
3176 || !types_compatible_p (bitsizetype
, TREE_TYPE (t2
)))
3178 error ("invalid position or size operand to BIT_FIELD_REF");
3181 if (INTEGRAL_TYPE_P (TREE_TYPE (t
))
3182 && maybe_ne (TYPE_PRECISION (TREE_TYPE (t
)), size
))
3184 error ("integral result type precision does not match "
3185 "field size of BIT_FIELD_REF");
3188 else if (!INTEGRAL_TYPE_P (TREE_TYPE (t
))
3189 && TYPE_MODE (TREE_TYPE (t
)) != BLKmode
3190 && maybe_ne (GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (t
))),
3193 error ("mode size of non-integral result does not "
3194 "match field size of BIT_FIELD_REF");
3197 if (!AGGREGATE_TYPE_P (TREE_TYPE (t0
))
3198 && maybe_gt (size
+ bitpos
,
3199 tree_to_poly_uint64 (TYPE_SIZE (TREE_TYPE (t0
)))))
3201 error ("position plus size exceeds size of referenced object in "
3206 t
= TREE_OPERAND (t
, 0);
3211 case ARRAY_RANGE_REF
:
3212 case VIEW_CONVERT_EXPR
:
3213 /* We have a nest of references. Verify that each of the operands
3214 that determine where to reference is either a constant or a variable,
3215 verify that the base is valid, and then show we've already checked
3217 while (handled_component_p (t
))
3219 if (TREE_CODE (t
) == COMPONENT_REF
&& TREE_OPERAND (t
, 2))
3220 CHECK_OP (2, "invalid COMPONENT_REF offset operator");
3221 else if (TREE_CODE (t
) == ARRAY_REF
3222 || TREE_CODE (t
) == ARRAY_RANGE_REF
)
3224 CHECK_OP (1, "invalid array index");
3225 if (TREE_OPERAND (t
, 2))
3226 CHECK_OP (2, "invalid array lower bound");
3227 if (TREE_OPERAND (t
, 3))
3228 CHECK_OP (3, "invalid array stride");
3230 else if (TREE_CODE (t
) == BIT_FIELD_REF
3231 || TREE_CODE (t
) == REALPART_EXPR
3232 || TREE_CODE (t
) == IMAGPART_EXPR
)
3234 error ("non-top-level BIT_FIELD_REF, IMAGPART_EXPR or "
3239 t
= TREE_OPERAND (t
, 0);
3242 if (!is_gimple_min_invariant (t
) && !is_gimple_lvalue (t
))
3244 error ("invalid reference prefix");
3247 walk_tree (&t
, verify_expr
, data
, NULL
);
3254 case POINTER_DIFF_EXPR
:
3257 case POINTER_PLUS_EXPR
:
3259 case TRUNC_DIV_EXPR
:
3261 case FLOOR_DIV_EXPR
:
3262 case ROUND_DIV_EXPR
:
3263 case TRUNC_MOD_EXPR
:
3265 case FLOOR_MOD_EXPR
:
3266 case ROUND_MOD_EXPR
:
3268 case EXACT_DIV_EXPR
:
3286 case UNORDERED_EXPR
:
3294 /* Reachable via COND_EXPR condition which is GENERIC. */
3295 CHECK_OP (0, "invalid operand to binary operator");
3296 CHECK_OP (1, "invalid operand to binary operator");
3300 if (TREE_CONSTANT (t
) && TREE_CODE (TREE_TYPE (t
)) == VECTOR_TYPE
)
3304 case CASE_LABEL_EXPR
:
3307 error ("invalid CASE_CHAIN");
3321 /* Verify if EXPR is either a GIMPLE ID or a GIMPLE indirect reference.
3322 Returns true if there is an error, otherwise false. */
3325 verify_types_in_gimple_min_lval (tree expr
)
3329 if (is_gimple_id (expr
))
3332 if (TREE_CODE (expr
) != TARGET_MEM_REF
3333 && TREE_CODE (expr
) != MEM_REF
)
3335 error ("invalid expression for min lvalue");
3339 /* TARGET_MEM_REFs are strange beasts. */
3340 if (TREE_CODE (expr
) == TARGET_MEM_REF
)
3343 op
= TREE_OPERAND (expr
, 0);
3344 if (!is_gimple_val (op
))
3346 error ("invalid operand in indirect reference");
3347 debug_generic_stmt (op
);
3350 /* Memory references now generally can involve a value conversion. */
3355 /* Verify if EXPR is a valid GIMPLE reference expression. If
3356 REQUIRE_LVALUE is true verifies it is an lvalue. Returns true
3357 if there is an error, otherwise false. */
3360 verify_types_in_gimple_reference (tree expr
, bool require_lvalue
)
3362 while (handled_component_p (expr
))
3364 tree op
= TREE_OPERAND (expr
, 0);
3366 if (TREE_CODE (expr
) == ARRAY_REF
3367 || TREE_CODE (expr
) == ARRAY_RANGE_REF
)
3369 if (!is_gimple_val (TREE_OPERAND (expr
, 1))
3370 || (TREE_OPERAND (expr
, 2)
3371 && !is_gimple_val (TREE_OPERAND (expr
, 2)))
3372 || (TREE_OPERAND (expr
, 3)
3373 && !is_gimple_val (TREE_OPERAND (expr
, 3))))
3375 error ("invalid operands to array reference");
3376 debug_generic_stmt (expr
);
3381 /* Verify if the reference array element types are compatible. */
3382 if (TREE_CODE (expr
) == ARRAY_REF
3383 && !useless_type_conversion_p (TREE_TYPE (expr
),
3384 TREE_TYPE (TREE_TYPE (op
))))
3386 error ("type mismatch in array reference");
3387 debug_generic_stmt (TREE_TYPE (expr
));
3388 debug_generic_stmt (TREE_TYPE (TREE_TYPE (op
)));
3391 if (TREE_CODE (expr
) == ARRAY_RANGE_REF
3392 && !useless_type_conversion_p (TREE_TYPE (TREE_TYPE (expr
)),
3393 TREE_TYPE (TREE_TYPE (op
))))
3395 error ("type mismatch in array range reference");
3396 debug_generic_stmt (TREE_TYPE (TREE_TYPE (expr
)));
3397 debug_generic_stmt (TREE_TYPE (TREE_TYPE (op
)));
3401 if ((TREE_CODE (expr
) == REALPART_EXPR
3402 || TREE_CODE (expr
) == IMAGPART_EXPR
)
3403 && !useless_type_conversion_p (TREE_TYPE (expr
),
3404 TREE_TYPE (TREE_TYPE (op
))))
3406 error ("type mismatch in real/imagpart reference");
3407 debug_generic_stmt (TREE_TYPE (expr
));
3408 debug_generic_stmt (TREE_TYPE (TREE_TYPE (op
)));
3412 if (TREE_CODE (expr
) == COMPONENT_REF
3413 && !useless_type_conversion_p (TREE_TYPE (expr
),
3414 TREE_TYPE (TREE_OPERAND (expr
, 1))))
3416 error ("type mismatch in component reference");
3417 debug_generic_stmt (TREE_TYPE (expr
));
3418 debug_generic_stmt (TREE_TYPE (TREE_OPERAND (expr
, 1)));
3422 if (TREE_CODE (expr
) == VIEW_CONVERT_EXPR
)
3424 /* For VIEW_CONVERT_EXPRs which are allowed here too, we only check
3425 that their operand is not an SSA name or an invariant when
3426 requiring an lvalue (this usually means there is a SRA or IPA-SRA
3427 bug). Otherwise there is nothing to verify, gross mismatches at
3428 most invoke undefined behavior. */
3430 && (TREE_CODE (op
) == SSA_NAME
3431 || is_gimple_min_invariant (op
)))
3433 error ("conversion of an SSA_NAME on the left hand side");
3434 debug_generic_stmt (expr
);
3437 else if (TREE_CODE (op
) == SSA_NAME
3438 && TYPE_SIZE (TREE_TYPE (expr
)) != TYPE_SIZE (TREE_TYPE (op
)))
3440 error ("conversion of register to a different size");
3441 debug_generic_stmt (expr
);
3444 else if (!handled_component_p (op
))
3451 if (TREE_CODE (expr
) == MEM_REF
)
3453 if (!is_gimple_mem_ref_addr (TREE_OPERAND (expr
, 0)))
3455 error ("invalid address operand in MEM_REF");
3456 debug_generic_stmt (expr
);
3459 if (!poly_int_tree_p (TREE_OPERAND (expr
, 1))
3460 || !POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (expr
, 1))))
3462 error ("invalid offset operand in MEM_REF");
3463 debug_generic_stmt (expr
);
3467 else if (TREE_CODE (expr
) == TARGET_MEM_REF
)
3469 if (!TMR_BASE (expr
)
3470 || !is_gimple_mem_ref_addr (TMR_BASE (expr
)))
3472 error ("invalid address operand in TARGET_MEM_REF");
3475 if (!TMR_OFFSET (expr
)
3476 || !poly_int_tree_p (TMR_OFFSET (expr
))
3477 || !POINTER_TYPE_P (TREE_TYPE (TMR_OFFSET (expr
))))
3479 error ("invalid offset operand in TARGET_MEM_REF");
3480 debug_generic_stmt (expr
);
3485 return ((require_lvalue
|| !is_gimple_min_invariant (expr
))
3486 && verify_types_in_gimple_min_lval (expr
));
3489 /* Returns true if there is one pointer type in TYPE_POINTER_TO (SRC_OBJ)
3490 list of pointer-to types that is trivially convertible to DEST. */
3493 one_pointer_to_useless_type_conversion_p (tree dest
, tree src_obj
)
3497 if (!TYPE_POINTER_TO (src_obj
))
3500 for (src
= TYPE_POINTER_TO (src_obj
); src
; src
= TYPE_NEXT_PTR_TO (src
))
3501 if (useless_type_conversion_p (dest
, src
))
3507 /* Return true if TYPE1 is a fixed-point type and if conversions to and
3508 from TYPE2 can be handled by FIXED_CONVERT_EXPR. */
3511 valid_fixed_convert_types_p (tree type1
, tree type2
)
3513 return (FIXED_POINT_TYPE_P (type1
)
3514 && (INTEGRAL_TYPE_P (type2
)
3515 || SCALAR_FLOAT_TYPE_P (type2
)
3516 || FIXED_POINT_TYPE_P (type2
)));
3519 /* Verify the contents of a GIMPLE_CALL STMT. Returns true when there
3520 is a problem, otherwise false. */
3523 verify_gimple_call (gcall
*stmt
)
3525 tree fn
= gimple_call_fn (stmt
);
3526 tree fntype
, fndecl
;
3529 if (gimple_call_internal_p (stmt
))
3533 error ("gimple call has two targets");
3534 debug_generic_stmt (fn
);
3537 /* FIXME : for passing label as arg in internal fn PHI from GIMPLE FE*/
3538 else if (gimple_call_internal_fn (stmt
) == IFN_PHI
)
3547 error ("gimple call has no target");
3552 if (fn
&& !is_gimple_call_addr (fn
))
3554 error ("invalid function in gimple call");
3555 debug_generic_stmt (fn
);
3560 && (!POINTER_TYPE_P (TREE_TYPE (fn
))
3561 || (TREE_CODE (TREE_TYPE (TREE_TYPE (fn
))) != FUNCTION_TYPE
3562 && TREE_CODE (TREE_TYPE (TREE_TYPE (fn
))) != METHOD_TYPE
)))
3564 error ("non-function in gimple call");
3568 fndecl
= gimple_call_fndecl (stmt
);
3570 && TREE_CODE (fndecl
) == FUNCTION_DECL
3571 && DECL_LOOPING_CONST_OR_PURE_P (fndecl
)
3572 && !DECL_PURE_P (fndecl
)
3573 && !TREE_READONLY (fndecl
))
3575 error ("invalid pure const state for function");
3579 tree lhs
= gimple_call_lhs (stmt
);
3581 && (!is_gimple_lvalue (lhs
)
3582 || verify_types_in_gimple_reference (lhs
, true)))
3584 error ("invalid LHS in gimple call");
3588 if (gimple_call_ctrl_altering_p (stmt
)
3589 && gimple_call_noreturn_p (stmt
)
3590 && should_remove_lhs_p (lhs
))
3592 error ("LHS in noreturn call");
3596 fntype
= gimple_call_fntype (stmt
);
3599 && !useless_type_conversion_p (TREE_TYPE (lhs
), TREE_TYPE (fntype
))
3600 /* ??? At least C++ misses conversions at assignments from
3601 void * call results.
3602 For now simply allow arbitrary pointer type conversions. */
3603 && !(POINTER_TYPE_P (TREE_TYPE (lhs
))
3604 && POINTER_TYPE_P (TREE_TYPE (fntype
))))
3606 error ("invalid conversion in gimple call");
3607 debug_generic_stmt (TREE_TYPE (lhs
));
3608 debug_generic_stmt (TREE_TYPE (fntype
));
3612 if (gimple_call_chain (stmt
)
3613 && !is_gimple_val (gimple_call_chain (stmt
)))
3615 error ("invalid static chain in gimple call");
3616 debug_generic_stmt (gimple_call_chain (stmt
));
3620 /* If there is a static chain argument, the call should either be
3621 indirect, or the decl should have DECL_STATIC_CHAIN set. */
3622 if (gimple_call_chain (stmt
)
3624 && !DECL_STATIC_CHAIN (fndecl
))
3626 error ("static chain with function that doesn%'t use one");
3630 if (fndecl
&& DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
)
3632 switch (DECL_FUNCTION_CODE (fndecl
))
3634 case BUILT_IN_UNREACHABLE
:
3636 if (gimple_call_num_args (stmt
) > 0)
3638 /* Built-in unreachable with parameters might not be caught by
3639 undefined behavior sanitizer. Front-ends do check users do not
3640 call them that way but we also produce calls to
3641 __builtin_unreachable internally, for example when IPA figures
3642 out a call cannot happen in a legal program. In such cases,
3643 we must make sure arguments are stripped off. */
3644 error ("__builtin_unreachable or __builtin_trap call with "
3654 /* ??? The C frontend passes unpromoted arguments in case it
3655 didn't see a function declaration before the call. So for now
3656 leave the call arguments mostly unverified. Once we gimplify
3657 unit-at-a-time we have a chance to fix this. */
3659 for (i
= 0; i
< gimple_call_num_args (stmt
); ++i
)
3661 tree arg
= gimple_call_arg (stmt
, i
);
3662 if ((is_gimple_reg_type (TREE_TYPE (arg
))
3663 && !is_gimple_val (arg
))
3664 || (!is_gimple_reg_type (TREE_TYPE (arg
))
3665 && !is_gimple_lvalue (arg
)))
3667 error ("invalid argument to gimple call");
3668 debug_generic_expr (arg
);
3676 /* Verifies the gimple comparison with the result type TYPE and
3677 the operands OP0 and OP1, comparison code is CODE. */
3680 verify_gimple_comparison (tree type
, tree op0
, tree op1
, enum tree_code code
)
3682 tree op0_type
= TREE_TYPE (op0
);
3683 tree op1_type
= TREE_TYPE (op1
);
3685 if (!is_gimple_val (op0
) || !is_gimple_val (op1
))
3687 error ("invalid operands in gimple comparison");
3691 /* For comparisons we do not have the operations type as the
3692 effective type the comparison is carried out in. Instead
3693 we require that either the first operand is trivially
3694 convertible into the second, or the other way around.
3695 Because we special-case pointers to void we allow
3696 comparisons of pointers with the same mode as well. */
3697 if (!useless_type_conversion_p (op0_type
, op1_type
)
3698 && !useless_type_conversion_p (op1_type
, op0_type
)
3699 && (!POINTER_TYPE_P (op0_type
)
3700 || !POINTER_TYPE_P (op1_type
)
3701 || TYPE_MODE (op0_type
) != TYPE_MODE (op1_type
)))
3703 error ("mismatching comparison operand types");
3704 debug_generic_expr (op0_type
);
3705 debug_generic_expr (op1_type
);
3709 /* The resulting type of a comparison may be an effective boolean type. */
3710 if (INTEGRAL_TYPE_P (type
)
3711 && (TREE_CODE (type
) == BOOLEAN_TYPE
3712 || TYPE_PRECISION (type
) == 1))
3714 if ((TREE_CODE (op0_type
) == VECTOR_TYPE
3715 || TREE_CODE (op1_type
) == VECTOR_TYPE
)
3716 && code
!= EQ_EXPR
&& code
!= NE_EXPR
3717 && !VECTOR_BOOLEAN_TYPE_P (op0_type
)
3718 && !VECTOR_INTEGER_TYPE_P (op0_type
))
3720 error ("unsupported operation or type for vector comparison"
3721 " returning a boolean");
3722 debug_generic_expr (op0_type
);
3723 debug_generic_expr (op1_type
);
3727 /* Or a boolean vector type with the same element count
3728 as the comparison operand types. */
3729 else if (TREE_CODE (type
) == VECTOR_TYPE
3730 && TREE_CODE (TREE_TYPE (type
)) == BOOLEAN_TYPE
)
3732 if (TREE_CODE (op0_type
) != VECTOR_TYPE
3733 || TREE_CODE (op1_type
) != VECTOR_TYPE
)
3735 error ("non-vector operands in vector comparison");
3736 debug_generic_expr (op0_type
);
3737 debug_generic_expr (op1_type
);
3741 if (maybe_ne (TYPE_VECTOR_SUBPARTS (type
),
3742 TYPE_VECTOR_SUBPARTS (op0_type
)))
3744 error ("invalid vector comparison resulting type");
3745 debug_generic_expr (type
);
3751 error ("bogus comparison result type");
3752 debug_generic_expr (type
);
3759 /* Verify a gimple assignment statement STMT with an unary rhs.
3760 Returns true if anything is wrong. */
3763 verify_gimple_assign_unary (gassign
*stmt
)
3765 enum tree_code rhs_code
= gimple_assign_rhs_code (stmt
);
3766 tree lhs
= gimple_assign_lhs (stmt
);
3767 tree lhs_type
= TREE_TYPE (lhs
);
3768 tree rhs1
= gimple_assign_rhs1 (stmt
);
3769 tree rhs1_type
= TREE_TYPE (rhs1
);
3771 if (!is_gimple_reg (lhs
))
3773 error ("non-register as LHS of unary operation");
3777 if (!is_gimple_val (rhs1
))
3779 error ("invalid operand in unary operation");
3783 /* First handle conversions. */
3788 /* Allow conversions from pointer type to integral type only if
3789 there is no sign or zero extension involved.
3790 For targets were the precision of ptrofftype doesn't match that
3791 of pointers we need to allow arbitrary conversions to ptrofftype. */
3792 if ((POINTER_TYPE_P (lhs_type
)
3793 && INTEGRAL_TYPE_P (rhs1_type
))
3794 || (POINTER_TYPE_P (rhs1_type
)
3795 && INTEGRAL_TYPE_P (lhs_type
)
3796 && (TYPE_PRECISION (rhs1_type
) >= TYPE_PRECISION (lhs_type
)
3797 || ptrofftype_p (lhs_type
))))
3800 /* Allow conversion from integral to offset type and vice versa. */
3801 if ((TREE_CODE (lhs_type
) == OFFSET_TYPE
3802 && INTEGRAL_TYPE_P (rhs1_type
))
3803 || (INTEGRAL_TYPE_P (lhs_type
)
3804 && TREE_CODE (rhs1_type
) == OFFSET_TYPE
))
3807 /* Otherwise assert we are converting between types of the
3809 if (INTEGRAL_TYPE_P (lhs_type
) != INTEGRAL_TYPE_P (rhs1_type
))
3811 error ("invalid types in nop conversion");
3812 debug_generic_expr (lhs_type
);
3813 debug_generic_expr (rhs1_type
);
3820 case ADDR_SPACE_CONVERT_EXPR
:
3822 if (!POINTER_TYPE_P (rhs1_type
) || !POINTER_TYPE_P (lhs_type
)
3823 || (TYPE_ADDR_SPACE (TREE_TYPE (rhs1_type
))
3824 == TYPE_ADDR_SPACE (TREE_TYPE (lhs_type
))))
3826 error ("invalid types in address space conversion");
3827 debug_generic_expr (lhs_type
);
3828 debug_generic_expr (rhs1_type
);
3835 case FIXED_CONVERT_EXPR
:
3837 if (!valid_fixed_convert_types_p (lhs_type
, rhs1_type
)
3838 && !valid_fixed_convert_types_p (rhs1_type
, lhs_type
))
3840 error ("invalid types in fixed-point conversion");
3841 debug_generic_expr (lhs_type
);
3842 debug_generic_expr (rhs1_type
);
3851 if ((!INTEGRAL_TYPE_P (rhs1_type
) || !SCALAR_FLOAT_TYPE_P (lhs_type
))
3852 && (!VECTOR_INTEGER_TYPE_P (rhs1_type
)
3853 || !VECTOR_FLOAT_TYPE_P (lhs_type
)))
3855 error ("invalid types in conversion to floating point");
3856 debug_generic_expr (lhs_type
);
3857 debug_generic_expr (rhs1_type
);
3864 case FIX_TRUNC_EXPR
:
3866 if ((!INTEGRAL_TYPE_P (lhs_type
) || !SCALAR_FLOAT_TYPE_P (rhs1_type
))
3867 && (!VECTOR_INTEGER_TYPE_P (lhs_type
)
3868 || !VECTOR_FLOAT_TYPE_P (rhs1_type
)))
3870 error ("invalid types in conversion to integer");
3871 debug_generic_expr (lhs_type
);
3872 debug_generic_expr (rhs1_type
);
3879 case VEC_UNPACK_HI_EXPR
:
3880 case VEC_UNPACK_LO_EXPR
:
3881 case VEC_UNPACK_FLOAT_HI_EXPR
:
3882 case VEC_UNPACK_FLOAT_LO_EXPR
:
3893 case VEC_DUPLICATE_EXPR
:
3894 if (TREE_CODE (lhs_type
) != VECTOR_TYPE
3895 || !useless_type_conversion_p (TREE_TYPE (lhs_type
), rhs1_type
))
3897 error ("vec_duplicate should be from a scalar to a like vector");
3898 debug_generic_expr (lhs_type
);
3899 debug_generic_expr (rhs1_type
);
3908 /* For the remaining codes assert there is no conversion involved. */
3909 if (!useless_type_conversion_p (lhs_type
, rhs1_type
))
3911 error ("non-trivial conversion in unary operation");
3912 debug_generic_expr (lhs_type
);
3913 debug_generic_expr (rhs1_type
);
3920 /* Verify a gimple assignment statement STMT with a binary rhs.
3921 Returns true if anything is wrong. */
3924 verify_gimple_assign_binary (gassign
*stmt
)
3926 enum tree_code rhs_code
= gimple_assign_rhs_code (stmt
);
3927 tree lhs
= gimple_assign_lhs (stmt
);
3928 tree lhs_type
= TREE_TYPE (lhs
);
3929 tree rhs1
= gimple_assign_rhs1 (stmt
);
3930 tree rhs1_type
= TREE_TYPE (rhs1
);
3931 tree rhs2
= gimple_assign_rhs2 (stmt
);
3932 tree rhs2_type
= TREE_TYPE (rhs2
);
3934 if (!is_gimple_reg (lhs
))
3936 error ("non-register as LHS of binary operation");
3940 if (!is_gimple_val (rhs1
)
3941 || !is_gimple_val (rhs2
))
3943 error ("invalid operands in binary operation");
3947 /* First handle operations that involve different types. */
3952 if (TREE_CODE (lhs_type
) != COMPLEX_TYPE
3953 || !(INTEGRAL_TYPE_P (rhs1_type
)
3954 || SCALAR_FLOAT_TYPE_P (rhs1_type
))
3955 || !(INTEGRAL_TYPE_P (rhs2_type
)
3956 || SCALAR_FLOAT_TYPE_P (rhs2_type
)))
3958 error ("type mismatch in complex expression");
3959 debug_generic_expr (lhs_type
);
3960 debug_generic_expr (rhs1_type
);
3961 debug_generic_expr (rhs2_type
);
3973 /* Shifts and rotates are ok on integral types, fixed point
3974 types and integer vector types. */
3975 if ((!INTEGRAL_TYPE_P (rhs1_type
)
3976 && !FIXED_POINT_TYPE_P (rhs1_type
)
3977 && !(TREE_CODE (rhs1_type
) == VECTOR_TYPE
3978 && INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type
))))
3979 || (!INTEGRAL_TYPE_P (rhs2_type
)
3980 /* Vector shifts of vectors are also ok. */
3981 && !(TREE_CODE (rhs1_type
) == VECTOR_TYPE
3982 && INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type
))
3983 && TREE_CODE (rhs2_type
) == VECTOR_TYPE
3984 && INTEGRAL_TYPE_P (TREE_TYPE (rhs2_type
))))
3985 || !useless_type_conversion_p (lhs_type
, rhs1_type
))
3987 error ("type mismatch in shift expression");
3988 debug_generic_expr (lhs_type
);
3989 debug_generic_expr (rhs1_type
);
3990 debug_generic_expr (rhs2_type
);
3997 case WIDEN_LSHIFT_EXPR
:
3999 if (!INTEGRAL_TYPE_P (lhs_type
)
4000 || !INTEGRAL_TYPE_P (rhs1_type
)
4001 || TREE_CODE (rhs2
) != INTEGER_CST
4002 || (2 * TYPE_PRECISION (rhs1_type
) > TYPE_PRECISION (lhs_type
)))
4004 error ("type mismatch in widening vector shift expression");
4005 debug_generic_expr (lhs_type
);
4006 debug_generic_expr (rhs1_type
);
4007 debug_generic_expr (rhs2_type
);
4014 case VEC_WIDEN_LSHIFT_HI_EXPR
:
4015 case VEC_WIDEN_LSHIFT_LO_EXPR
:
4017 if (TREE_CODE (rhs1_type
) != VECTOR_TYPE
4018 || TREE_CODE (lhs_type
) != VECTOR_TYPE
4019 || !INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type
))
4020 || !INTEGRAL_TYPE_P (TREE_TYPE (lhs_type
))
4021 || TREE_CODE (rhs2
) != INTEGER_CST
4022 || (2 * TYPE_PRECISION (TREE_TYPE (rhs1_type
))
4023 > TYPE_PRECISION (TREE_TYPE (lhs_type
))))
4025 error ("type mismatch in widening vector shift expression");
4026 debug_generic_expr (lhs_type
);
4027 debug_generic_expr (rhs1_type
);
4028 debug_generic_expr (rhs2_type
);
4038 tree lhs_etype
= lhs_type
;
4039 tree rhs1_etype
= rhs1_type
;
4040 tree rhs2_etype
= rhs2_type
;
4041 if (TREE_CODE (lhs_type
) == VECTOR_TYPE
)
4043 if (TREE_CODE (rhs1_type
) != VECTOR_TYPE
4044 || TREE_CODE (rhs2_type
) != VECTOR_TYPE
)
4046 error ("invalid non-vector operands to vector valued plus");
4049 lhs_etype
= TREE_TYPE (lhs_type
);
4050 rhs1_etype
= TREE_TYPE (rhs1_type
);
4051 rhs2_etype
= TREE_TYPE (rhs2_type
);
4053 if (POINTER_TYPE_P (lhs_etype
)
4054 || POINTER_TYPE_P (rhs1_etype
)
4055 || POINTER_TYPE_P (rhs2_etype
))
4057 error ("invalid (pointer) operands to plus/minus");
4061 /* Continue with generic binary expression handling. */
4065 case POINTER_PLUS_EXPR
:
4067 if (!POINTER_TYPE_P (rhs1_type
)
4068 || !useless_type_conversion_p (lhs_type
, rhs1_type
)
4069 || !ptrofftype_p (rhs2_type
))
4071 error ("type mismatch in pointer plus expression");
4072 debug_generic_stmt (lhs_type
);
4073 debug_generic_stmt (rhs1_type
);
4074 debug_generic_stmt (rhs2_type
);
4081 case POINTER_DIFF_EXPR
:
4083 if (!POINTER_TYPE_P (rhs1_type
)
4084 || !POINTER_TYPE_P (rhs2_type
)
4085 /* Because we special-case pointers to void we allow difference
4086 of arbitrary pointers with the same mode. */
4087 || TYPE_MODE (rhs1_type
) != TYPE_MODE (rhs2_type
)
4088 || TREE_CODE (lhs_type
) != INTEGER_TYPE
4089 || TYPE_UNSIGNED (lhs_type
)
4090 || TYPE_PRECISION (lhs_type
) != TYPE_PRECISION (rhs1_type
))
4092 error ("type mismatch in pointer diff expression");
4093 debug_generic_stmt (lhs_type
);
4094 debug_generic_stmt (rhs1_type
);
4095 debug_generic_stmt (rhs2_type
);
4102 case TRUTH_ANDIF_EXPR
:
4103 case TRUTH_ORIF_EXPR
:
4104 case TRUTH_AND_EXPR
:
4106 case TRUTH_XOR_EXPR
:
4116 case UNORDERED_EXPR
:
4124 /* Comparisons are also binary, but the result type is not
4125 connected to the operand types. */
4126 return verify_gimple_comparison (lhs_type
, rhs1
, rhs2
, rhs_code
);
4128 case WIDEN_MULT_EXPR
:
4129 if (TREE_CODE (lhs_type
) != INTEGER_TYPE
)
4131 return ((2 * TYPE_PRECISION (rhs1_type
) > TYPE_PRECISION (lhs_type
))
4132 || (TYPE_PRECISION (rhs1_type
) != TYPE_PRECISION (rhs2_type
)));
4134 case WIDEN_SUM_EXPR
:
4136 if (((TREE_CODE (rhs1_type
) != VECTOR_TYPE
4137 || TREE_CODE (lhs_type
) != VECTOR_TYPE
)
4138 && ((!INTEGRAL_TYPE_P (rhs1_type
)
4139 && !SCALAR_FLOAT_TYPE_P (rhs1_type
))
4140 || (!INTEGRAL_TYPE_P (lhs_type
)
4141 && !SCALAR_FLOAT_TYPE_P (lhs_type
))))
4142 || !useless_type_conversion_p (lhs_type
, rhs2_type
)
4143 || maybe_lt (GET_MODE_SIZE (element_mode (rhs2_type
)),
4144 2 * GET_MODE_SIZE (element_mode (rhs1_type
))))
4146 error ("type mismatch in widening sum reduction");
4147 debug_generic_expr (lhs_type
);
4148 debug_generic_expr (rhs1_type
);
4149 debug_generic_expr (rhs2_type
);
4155 case VEC_WIDEN_MULT_HI_EXPR
:
4156 case VEC_WIDEN_MULT_LO_EXPR
:
4157 case VEC_WIDEN_MULT_EVEN_EXPR
:
4158 case VEC_WIDEN_MULT_ODD_EXPR
:
4160 if (TREE_CODE (rhs1_type
) != VECTOR_TYPE
4161 || TREE_CODE (lhs_type
) != VECTOR_TYPE
4162 || !types_compatible_p (rhs1_type
, rhs2_type
)
4163 || maybe_ne (GET_MODE_SIZE (element_mode (lhs_type
)),
4164 2 * GET_MODE_SIZE (element_mode (rhs1_type
))))
4166 error ("type mismatch in vector widening multiplication");
4167 debug_generic_expr (lhs_type
);
4168 debug_generic_expr (rhs1_type
);
4169 debug_generic_expr (rhs2_type
);
4175 case VEC_PACK_TRUNC_EXPR
:
4176 /* ??? We currently use VEC_PACK_TRUNC_EXPR to simply concat
4177 vector boolean types. */
4178 if (VECTOR_BOOLEAN_TYPE_P (lhs_type
)
4179 && VECTOR_BOOLEAN_TYPE_P (rhs1_type
)
4180 && types_compatible_p (rhs1_type
, rhs2_type
)
4181 && known_eq (TYPE_VECTOR_SUBPARTS (lhs_type
),
4182 2 * TYPE_VECTOR_SUBPARTS (rhs1_type
)))
4186 case VEC_PACK_SAT_EXPR
:
4187 case VEC_PACK_FIX_TRUNC_EXPR
:
4189 if (TREE_CODE (rhs1_type
) != VECTOR_TYPE
4190 || TREE_CODE (lhs_type
) != VECTOR_TYPE
4191 || !((rhs_code
== VEC_PACK_FIX_TRUNC_EXPR
4192 && SCALAR_FLOAT_TYPE_P (TREE_TYPE (rhs1_type
))
4193 && INTEGRAL_TYPE_P (TREE_TYPE (lhs_type
)))
4194 || (INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type
))
4195 == INTEGRAL_TYPE_P (TREE_TYPE (lhs_type
))))
4196 || !types_compatible_p (rhs1_type
, rhs2_type
)
4197 || maybe_ne (GET_MODE_SIZE (element_mode (rhs1_type
)),
4198 2 * GET_MODE_SIZE (element_mode (lhs_type
))))
4200 error ("type mismatch in vector pack expression");
4201 debug_generic_expr (lhs_type
);
4202 debug_generic_expr (rhs1_type
);
4203 debug_generic_expr (rhs2_type
);
4211 case MULT_HIGHPART_EXPR
:
4212 case TRUNC_DIV_EXPR
:
4214 case FLOOR_DIV_EXPR
:
4215 case ROUND_DIV_EXPR
:
4216 case TRUNC_MOD_EXPR
:
4218 case FLOOR_MOD_EXPR
:
4219 case ROUND_MOD_EXPR
:
4221 case EXACT_DIV_EXPR
:
4227 /* Continue with generic binary expression handling. */
4230 case VEC_SERIES_EXPR
:
4231 if (!useless_type_conversion_p (rhs1_type
, rhs2_type
))
4233 error ("type mismatch in series expression");
4234 debug_generic_expr (rhs1_type
);
4235 debug_generic_expr (rhs2_type
);
4238 if (TREE_CODE (lhs_type
) != VECTOR_TYPE
4239 || !useless_type_conversion_p (TREE_TYPE (lhs_type
), rhs1_type
))
4241 error ("vector type expected in series expression");
4242 debug_generic_expr (lhs_type
);
4251 if (!useless_type_conversion_p (lhs_type
, rhs1_type
)
4252 || !useless_type_conversion_p (lhs_type
, rhs2_type
))
4254 error ("type mismatch in binary expression");
4255 debug_generic_stmt (lhs_type
);
4256 debug_generic_stmt (rhs1_type
);
4257 debug_generic_stmt (rhs2_type
);
4264 /* Verify a gimple assignment statement STMT with a ternary rhs.
4265 Returns true if anything is wrong. */
4268 verify_gimple_assign_ternary (gassign
*stmt
)
4270 enum tree_code rhs_code
= gimple_assign_rhs_code (stmt
);
4271 tree lhs
= gimple_assign_lhs (stmt
);
4272 tree lhs_type
= TREE_TYPE (lhs
);
4273 tree rhs1
= gimple_assign_rhs1 (stmt
);
4274 tree rhs1_type
= TREE_TYPE (rhs1
);
4275 tree rhs2
= gimple_assign_rhs2 (stmt
);
4276 tree rhs2_type
= TREE_TYPE (rhs2
);
4277 tree rhs3
= gimple_assign_rhs3 (stmt
);
4278 tree rhs3_type
= TREE_TYPE (rhs3
);
4280 if (!is_gimple_reg (lhs
))
4282 error ("non-register as LHS of ternary operation");
4286 if (((rhs_code
== VEC_COND_EXPR
|| rhs_code
== COND_EXPR
)
4287 ? !is_gimple_condexpr (rhs1
) : !is_gimple_val (rhs1
))
4288 || !is_gimple_val (rhs2
)
4289 || !is_gimple_val (rhs3
))
4291 error ("invalid operands in ternary operation");
4295 /* First handle operations that involve different types. */
4298 case WIDEN_MULT_PLUS_EXPR
:
4299 case WIDEN_MULT_MINUS_EXPR
:
4300 if ((!INTEGRAL_TYPE_P (rhs1_type
)
4301 && !FIXED_POINT_TYPE_P (rhs1_type
))
4302 || !useless_type_conversion_p (rhs1_type
, rhs2_type
)
4303 || !useless_type_conversion_p (lhs_type
, rhs3_type
)
4304 || 2 * TYPE_PRECISION (rhs1_type
) > TYPE_PRECISION (lhs_type
)
4305 || TYPE_PRECISION (rhs1_type
) != TYPE_PRECISION (rhs2_type
))
4307 error ("type mismatch in widening multiply-accumulate expression");
4308 debug_generic_expr (lhs_type
);
4309 debug_generic_expr (rhs1_type
);
4310 debug_generic_expr (rhs2_type
);
4311 debug_generic_expr (rhs3_type
);
4317 if (!useless_type_conversion_p (lhs_type
, rhs1_type
)
4318 || !useless_type_conversion_p (lhs_type
, rhs2_type
)
4319 || !useless_type_conversion_p (lhs_type
, rhs3_type
))
4321 error ("type mismatch in fused multiply-add expression");
4322 debug_generic_expr (lhs_type
);
4323 debug_generic_expr (rhs1_type
);
4324 debug_generic_expr (rhs2_type
);
4325 debug_generic_expr (rhs3_type
);
4331 if (!VECTOR_BOOLEAN_TYPE_P (rhs1_type
)
4332 || maybe_ne (TYPE_VECTOR_SUBPARTS (rhs1_type
),
4333 TYPE_VECTOR_SUBPARTS (lhs_type
)))
4335 error ("the first argument of a VEC_COND_EXPR must be of a "
4336 "boolean vector type of the same number of elements "
4338 debug_generic_expr (lhs_type
);
4339 debug_generic_expr (rhs1_type
);
4344 if (!useless_type_conversion_p (lhs_type
, rhs2_type
)
4345 || !useless_type_conversion_p (lhs_type
, rhs3_type
))
4347 error ("type mismatch in conditional expression");
4348 debug_generic_expr (lhs_type
);
4349 debug_generic_expr (rhs2_type
);
4350 debug_generic_expr (rhs3_type
);
4356 if (!useless_type_conversion_p (lhs_type
, rhs1_type
)
4357 || !useless_type_conversion_p (lhs_type
, rhs2_type
))
4359 error ("type mismatch in vector permute expression");
4360 debug_generic_expr (lhs_type
);
4361 debug_generic_expr (rhs1_type
);
4362 debug_generic_expr (rhs2_type
);
4363 debug_generic_expr (rhs3_type
);
4367 if (TREE_CODE (rhs1_type
) != VECTOR_TYPE
4368 || TREE_CODE (rhs2_type
) != VECTOR_TYPE
4369 || TREE_CODE (rhs3_type
) != VECTOR_TYPE
)
4371 error ("vector types expected in vector permute expression");
4372 debug_generic_expr (lhs_type
);
4373 debug_generic_expr (rhs1_type
);
4374 debug_generic_expr (rhs2_type
);
4375 debug_generic_expr (rhs3_type
);
4379 if (maybe_ne (TYPE_VECTOR_SUBPARTS (rhs1_type
),
4380 TYPE_VECTOR_SUBPARTS (rhs2_type
))
4381 || maybe_ne (TYPE_VECTOR_SUBPARTS (rhs2_type
),
4382 TYPE_VECTOR_SUBPARTS (rhs3_type
))
4383 || maybe_ne (TYPE_VECTOR_SUBPARTS (rhs3_type
),
4384 TYPE_VECTOR_SUBPARTS (lhs_type
)))
4386 error ("vectors with different element number found "
4387 "in vector permute expression");
4388 debug_generic_expr (lhs_type
);
4389 debug_generic_expr (rhs1_type
);
4390 debug_generic_expr (rhs2_type
);
4391 debug_generic_expr (rhs3_type
);
4395 if (TREE_CODE (TREE_TYPE (rhs3_type
)) != INTEGER_TYPE
4396 || (TREE_CODE (rhs3
) != VECTOR_CST
4397 && (GET_MODE_BITSIZE (SCALAR_INT_TYPE_MODE
4398 (TREE_TYPE (rhs3_type
)))
4399 != GET_MODE_BITSIZE (SCALAR_TYPE_MODE
4400 (TREE_TYPE (rhs1_type
))))))
4402 error ("invalid mask type in vector permute expression");
4403 debug_generic_expr (lhs_type
);
4404 debug_generic_expr (rhs1_type
);
4405 debug_generic_expr (rhs2_type
);
4406 debug_generic_expr (rhs3_type
);
4413 if (!useless_type_conversion_p (rhs1_type
, rhs2_type
)
4414 || !useless_type_conversion_p (lhs_type
, rhs3_type
)
4415 || 2 * GET_MODE_UNIT_BITSIZE (TYPE_MODE (TREE_TYPE (rhs1_type
)))
4416 > GET_MODE_UNIT_BITSIZE (TYPE_MODE (TREE_TYPE (lhs_type
))))
4418 error ("type mismatch in sad expression");
4419 debug_generic_expr (lhs_type
);
4420 debug_generic_expr (rhs1_type
);
4421 debug_generic_expr (rhs2_type
);
4422 debug_generic_expr (rhs3_type
);
4426 if (TREE_CODE (rhs1_type
) != VECTOR_TYPE
4427 || TREE_CODE (rhs2_type
) != VECTOR_TYPE
4428 || TREE_CODE (rhs3_type
) != VECTOR_TYPE
)
4430 error ("vector types expected in sad expression");
4431 debug_generic_expr (lhs_type
);
4432 debug_generic_expr (rhs1_type
);
4433 debug_generic_expr (rhs2_type
);
4434 debug_generic_expr (rhs3_type
);
4440 case BIT_INSERT_EXPR
:
4441 if (! useless_type_conversion_p (lhs_type
, rhs1_type
))
4443 error ("type mismatch in BIT_INSERT_EXPR");
4444 debug_generic_expr (lhs_type
);
4445 debug_generic_expr (rhs1_type
);
4448 if (! ((INTEGRAL_TYPE_P (rhs1_type
)
4449 && INTEGRAL_TYPE_P (rhs2_type
))
4450 || (VECTOR_TYPE_P (rhs1_type
)
4451 && types_compatible_p (TREE_TYPE (rhs1_type
), rhs2_type
))))
4453 error ("not allowed type combination in BIT_INSERT_EXPR");
4454 debug_generic_expr (rhs1_type
);
4455 debug_generic_expr (rhs2_type
);
4458 if (! tree_fits_uhwi_p (rhs3
)
4459 || ! types_compatible_p (bitsizetype
, TREE_TYPE (rhs3
))
4460 || ! tree_fits_uhwi_p (TYPE_SIZE (rhs2_type
)))
4462 error ("invalid position or size in BIT_INSERT_EXPR");
4465 if (INTEGRAL_TYPE_P (rhs1_type
))
4467 unsigned HOST_WIDE_INT bitpos
= tree_to_uhwi (rhs3
);
4468 if (bitpos
>= TYPE_PRECISION (rhs1_type
)
4469 || (bitpos
+ TYPE_PRECISION (rhs2_type
)
4470 > TYPE_PRECISION (rhs1_type
)))
4472 error ("insertion out of range in BIT_INSERT_EXPR");
4476 else if (VECTOR_TYPE_P (rhs1_type
))
4478 unsigned HOST_WIDE_INT bitpos
= tree_to_uhwi (rhs3
);
4479 unsigned HOST_WIDE_INT bitsize
= tree_to_uhwi (TYPE_SIZE (rhs2_type
));
4480 if (bitpos
% bitsize
!= 0)
4482 error ("vector insertion not at element boundary");
4490 if (((TREE_CODE (rhs1_type
) != VECTOR_TYPE
4491 || TREE_CODE (lhs_type
) != VECTOR_TYPE
)
4492 && ((!INTEGRAL_TYPE_P (rhs1_type
)
4493 && !SCALAR_FLOAT_TYPE_P (rhs1_type
))
4494 || (!INTEGRAL_TYPE_P (lhs_type
)
4495 && !SCALAR_FLOAT_TYPE_P (lhs_type
))))
4496 || !types_compatible_p (rhs1_type
, rhs2_type
)
4497 || !useless_type_conversion_p (lhs_type
, rhs3_type
)
4498 || maybe_lt (GET_MODE_SIZE (element_mode (rhs3_type
)),
4499 2 * GET_MODE_SIZE (element_mode (rhs1_type
))))
4501 error ("type mismatch in dot product reduction");
4502 debug_generic_expr (lhs_type
);
4503 debug_generic_expr (rhs1_type
);
4504 debug_generic_expr (rhs2_type
);
4510 case REALIGN_LOAD_EXPR
:
4520 /* Verify a gimple assignment statement STMT with a single rhs.
4521 Returns true if anything is wrong. */
4524 verify_gimple_assign_single (gassign
*stmt
)
4526 enum tree_code rhs_code
= gimple_assign_rhs_code (stmt
);
4527 tree lhs
= gimple_assign_lhs (stmt
);
4528 tree lhs_type
= TREE_TYPE (lhs
);
4529 tree rhs1
= gimple_assign_rhs1 (stmt
);
4530 tree rhs1_type
= TREE_TYPE (rhs1
);
4533 if (!useless_type_conversion_p (lhs_type
, rhs1_type
))
4535 error ("non-trivial conversion at assignment");
4536 debug_generic_expr (lhs_type
);
4537 debug_generic_expr (rhs1_type
);
4541 if (gimple_clobber_p (stmt
)
4542 && !(DECL_P (lhs
) || TREE_CODE (lhs
) == MEM_REF
))
4544 error ("non-decl/MEM_REF LHS in clobber statement");
4545 debug_generic_expr (lhs
);
4549 if (handled_component_p (lhs
)
4550 || TREE_CODE (lhs
) == MEM_REF
4551 || TREE_CODE (lhs
) == TARGET_MEM_REF
)
4552 res
|= verify_types_in_gimple_reference (lhs
, true);
4554 /* Special codes we cannot handle via their class. */
4559 tree op
= TREE_OPERAND (rhs1
, 0);
4560 if (!is_gimple_addressable (op
))
4562 error ("invalid operand in unary expression");
4566 /* Technically there is no longer a need for matching types, but
4567 gimple hygiene asks for this check. In LTO we can end up
4568 combining incompatible units and thus end up with addresses
4569 of globals that change their type to a common one. */
4571 && !types_compatible_p (TREE_TYPE (op
),
4572 TREE_TYPE (TREE_TYPE (rhs1
)))
4573 && !one_pointer_to_useless_type_conversion_p (TREE_TYPE (rhs1
),
4576 error ("type mismatch in address expression");
4577 debug_generic_stmt (TREE_TYPE (rhs1
));
4578 debug_generic_stmt (TREE_TYPE (op
));
4582 return verify_types_in_gimple_reference (op
, true);
4587 error ("INDIRECT_REF in gimple IL");
4593 case ARRAY_RANGE_REF
:
4594 case VIEW_CONVERT_EXPR
:
4597 case TARGET_MEM_REF
:
4599 if (!is_gimple_reg (lhs
)
4600 && is_gimple_reg_type (TREE_TYPE (lhs
)))
4602 error ("invalid rhs for gimple memory store");
4603 debug_generic_stmt (lhs
);
4604 debug_generic_stmt (rhs1
);
4607 return res
|| verify_types_in_gimple_reference (rhs1
, false);
4619 /* tcc_declaration */
4624 if (!is_gimple_reg (lhs
)
4625 && !is_gimple_reg (rhs1
)
4626 && is_gimple_reg_type (TREE_TYPE (lhs
)))
4628 error ("invalid rhs for gimple memory store");
4629 debug_generic_stmt (lhs
);
4630 debug_generic_stmt (rhs1
);
4636 if (TREE_CODE (rhs1_type
) == VECTOR_TYPE
)
4639 tree elt_i
, elt_v
, elt_t
= NULL_TREE
;
4641 if (CONSTRUCTOR_NELTS (rhs1
) == 0)
4643 /* For vector CONSTRUCTORs we require that either it is empty
4644 CONSTRUCTOR, or it is a CONSTRUCTOR of smaller vector elements
4645 (then the element count must be correct to cover the whole
4646 outer vector and index must be NULL on all elements, or it is
4647 a CONSTRUCTOR of scalar elements, where we as an exception allow
4648 smaller number of elements (assuming zero filling) and
4649 consecutive indexes as compared to NULL indexes (such
4650 CONSTRUCTORs can appear in the IL from FEs). */
4651 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (rhs1
), i
, elt_i
, elt_v
)
4653 if (elt_t
== NULL_TREE
)
4655 elt_t
= TREE_TYPE (elt_v
);
4656 if (TREE_CODE (elt_t
) == VECTOR_TYPE
)
4658 tree elt_t
= TREE_TYPE (elt_v
);
4659 if (!useless_type_conversion_p (TREE_TYPE (rhs1_type
),
4662 error ("incorrect type of vector CONSTRUCTOR"
4664 debug_generic_stmt (rhs1
);
4667 else if (maybe_ne (CONSTRUCTOR_NELTS (rhs1
)
4668 * TYPE_VECTOR_SUBPARTS (elt_t
),
4669 TYPE_VECTOR_SUBPARTS (rhs1_type
)))
4671 error ("incorrect number of vector CONSTRUCTOR"
4673 debug_generic_stmt (rhs1
);
4677 else if (!useless_type_conversion_p (TREE_TYPE (rhs1_type
),
4680 error ("incorrect type of vector CONSTRUCTOR elements");
4681 debug_generic_stmt (rhs1
);
4684 else if (maybe_gt (CONSTRUCTOR_NELTS (rhs1
),
4685 TYPE_VECTOR_SUBPARTS (rhs1_type
)))
4687 error ("incorrect number of vector CONSTRUCTOR elements");
4688 debug_generic_stmt (rhs1
);
4692 else if (!useless_type_conversion_p (elt_t
, TREE_TYPE (elt_v
)))
4694 error ("incorrect type of vector CONSTRUCTOR elements");
4695 debug_generic_stmt (rhs1
);
4698 if (elt_i
!= NULL_TREE
4699 && (TREE_CODE (elt_t
) == VECTOR_TYPE
4700 || TREE_CODE (elt_i
) != INTEGER_CST
4701 || compare_tree_int (elt_i
, i
) != 0))
4703 error ("vector CONSTRUCTOR with non-NULL element index");
4704 debug_generic_stmt (rhs1
);
4707 if (!is_gimple_val (elt_v
))
4709 error ("vector CONSTRUCTOR element is not a GIMPLE value");
4710 debug_generic_stmt (rhs1
);
4715 else if (CONSTRUCTOR_NELTS (rhs1
) != 0)
4717 error ("non-vector CONSTRUCTOR with elements");
4718 debug_generic_stmt (rhs1
);
4724 case WITH_SIZE_EXPR
:
4734 /* Verify the contents of a GIMPLE_ASSIGN STMT. Returns true when there
4735 is a problem, otherwise false. */
4738 verify_gimple_assign (gassign
*stmt
)
4740 switch (gimple_assign_rhs_class (stmt
))
4742 case GIMPLE_SINGLE_RHS
:
4743 return verify_gimple_assign_single (stmt
);
4745 case GIMPLE_UNARY_RHS
:
4746 return verify_gimple_assign_unary (stmt
);
4748 case GIMPLE_BINARY_RHS
:
4749 return verify_gimple_assign_binary (stmt
);
4751 case GIMPLE_TERNARY_RHS
:
4752 return verify_gimple_assign_ternary (stmt
);
4759 /* Verify the contents of a GIMPLE_RETURN STMT. Returns true when there
4760 is a problem, otherwise false. */
4763 verify_gimple_return (greturn
*stmt
)
4765 tree op
= gimple_return_retval (stmt
);
4766 tree restype
= TREE_TYPE (TREE_TYPE (cfun
->decl
));
4768 /* We cannot test for present return values as we do not fix up missing
4769 return values from the original source. */
4773 if (!is_gimple_val (op
)
4774 && TREE_CODE (op
) != RESULT_DECL
)
4776 error ("invalid operand in return statement");
4777 debug_generic_stmt (op
);
4781 if ((TREE_CODE (op
) == RESULT_DECL
4782 && DECL_BY_REFERENCE (op
))
4783 || (TREE_CODE (op
) == SSA_NAME
4784 && SSA_NAME_VAR (op
)
4785 && TREE_CODE (SSA_NAME_VAR (op
)) == RESULT_DECL
4786 && DECL_BY_REFERENCE (SSA_NAME_VAR (op
))))
4787 op
= TREE_TYPE (op
);
4789 if (!useless_type_conversion_p (restype
, TREE_TYPE (op
)))
4791 error ("invalid conversion in return statement");
4792 debug_generic_stmt (restype
);
4793 debug_generic_stmt (TREE_TYPE (op
));
4801 /* Verify the contents of a GIMPLE_GOTO STMT. Returns true when there
4802 is a problem, otherwise false. */
4805 verify_gimple_goto (ggoto
*stmt
)
4807 tree dest
= gimple_goto_dest (stmt
);
4809 /* ??? We have two canonical forms of direct goto destinations, a
4810 bare LABEL_DECL and an ADDR_EXPR of a LABEL_DECL. */
4811 if (TREE_CODE (dest
) != LABEL_DECL
4812 && (!is_gimple_val (dest
)
4813 || !POINTER_TYPE_P (TREE_TYPE (dest
))))
4815 error ("goto destination is neither a label nor a pointer");
4822 /* Verify the contents of a GIMPLE_SWITCH STMT. Returns true when there
4823 is a problem, otherwise false. */
4826 verify_gimple_switch (gswitch
*stmt
)
4829 tree elt
, prev_upper_bound
= NULL_TREE
;
4830 tree index_type
, elt_type
= NULL_TREE
;
4832 if (!is_gimple_val (gimple_switch_index (stmt
)))
4834 error ("invalid operand to switch statement");
4835 debug_generic_stmt (gimple_switch_index (stmt
));
4839 index_type
= TREE_TYPE (gimple_switch_index (stmt
));
4840 if (! INTEGRAL_TYPE_P (index_type
))
4842 error ("non-integral type switch statement");
4843 debug_generic_expr (index_type
);
4847 elt
= gimple_switch_label (stmt
, 0);
4848 if (CASE_LOW (elt
) != NULL_TREE
|| CASE_HIGH (elt
) != NULL_TREE
)
4850 error ("invalid default case label in switch statement");
4851 debug_generic_expr (elt
);
4855 n
= gimple_switch_num_labels (stmt
);
4856 for (i
= 1; i
< n
; i
++)
4858 elt
= gimple_switch_label (stmt
, i
);
4860 if (! CASE_LOW (elt
))
4862 error ("invalid case label in switch statement");
4863 debug_generic_expr (elt
);
4867 && ! tree_int_cst_lt (CASE_LOW (elt
), CASE_HIGH (elt
)))
4869 error ("invalid case range in switch statement");
4870 debug_generic_expr (elt
);
4876 if (TREE_TYPE (CASE_LOW (elt
)) != elt_type
4877 || (CASE_HIGH (elt
) && TREE_TYPE (CASE_HIGH (elt
)) != elt_type
))
4879 error ("type mismatch for case label in switch statement");
4880 debug_generic_expr (elt
);
4886 elt_type
= TREE_TYPE (CASE_LOW (elt
));
4887 if (TYPE_PRECISION (index_type
) < TYPE_PRECISION (elt_type
))
4889 error ("type precision mismatch in switch statement");
4894 if (prev_upper_bound
)
4896 if (! tree_int_cst_lt (prev_upper_bound
, CASE_LOW (elt
)))
4898 error ("case labels not sorted in switch statement");
4903 prev_upper_bound
= CASE_HIGH (elt
);
4904 if (! prev_upper_bound
)
4905 prev_upper_bound
= CASE_LOW (elt
);
4911 /* Verify a gimple debug statement STMT.
4912 Returns true if anything is wrong. */
4915 verify_gimple_debug (gimple
*stmt ATTRIBUTE_UNUSED
)
4917 /* There isn't much that could be wrong in a gimple debug stmt. A
4918 gimple debug bind stmt, for example, maps a tree, that's usually
4919 a VAR_DECL or a PARM_DECL, but that could also be some scalarized
4920 component or member of an aggregate type, to another tree, that
4921 can be an arbitrary expression. These stmts expand into debug
4922 insns, and are converted to debug notes by var-tracking.c. */
4926 /* Verify a gimple label statement STMT.
4927 Returns true if anything is wrong. */
4930 verify_gimple_label (glabel
*stmt
)
4932 tree decl
= gimple_label_label (stmt
);
4936 if (TREE_CODE (decl
) != LABEL_DECL
)
4938 if (!DECL_NONLOCAL (decl
) && !FORCED_LABEL (decl
)
4939 && DECL_CONTEXT (decl
) != current_function_decl
)
4941 error ("label's context is not the current function decl");
4945 uid
= LABEL_DECL_UID (decl
);
4948 || (*label_to_block_map_for_fn (cfun
))[uid
] != gimple_bb (stmt
)))
4950 error ("incorrect entry in label_to_block_map");
4954 uid
= EH_LANDING_PAD_NR (decl
);
4957 eh_landing_pad lp
= get_eh_landing_pad_from_number (uid
);
4958 if (decl
!= lp
->post_landing_pad
)
4960 error ("incorrect setting of landing pad number");
4968 /* Verify a gimple cond statement STMT.
4969 Returns true if anything is wrong. */
4972 verify_gimple_cond (gcond
*stmt
)
4974 if (TREE_CODE_CLASS (gimple_cond_code (stmt
)) != tcc_comparison
)
4976 error ("invalid comparison code in gimple cond");
4979 if (!(!gimple_cond_true_label (stmt
)
4980 || TREE_CODE (gimple_cond_true_label (stmt
)) == LABEL_DECL
)
4981 || !(!gimple_cond_false_label (stmt
)
4982 || TREE_CODE (gimple_cond_false_label (stmt
)) == LABEL_DECL
))
4984 error ("invalid labels in gimple cond");
4988 return verify_gimple_comparison (boolean_type_node
,
4989 gimple_cond_lhs (stmt
),
4990 gimple_cond_rhs (stmt
),
4991 gimple_cond_code (stmt
));
4994 /* Verify the GIMPLE statement STMT. Returns true if there is an
4995 error, otherwise false. */
4998 verify_gimple_stmt (gimple
*stmt
)
5000 switch (gimple_code (stmt
))
5003 return verify_gimple_assign (as_a
<gassign
*> (stmt
));
5006 return verify_gimple_label (as_a
<glabel
*> (stmt
));
5009 return verify_gimple_call (as_a
<gcall
*> (stmt
));
5012 return verify_gimple_cond (as_a
<gcond
*> (stmt
));
5015 return verify_gimple_goto (as_a
<ggoto
*> (stmt
));
5018 return verify_gimple_switch (as_a
<gswitch
*> (stmt
));
5021 return verify_gimple_return (as_a
<greturn
*> (stmt
));
5026 case GIMPLE_TRANSACTION
:
5027 return verify_gimple_transaction (as_a
<gtransaction
*> (stmt
));
5029 /* Tuples that do not have tree operands. */
5031 case GIMPLE_PREDICT
:
5033 case GIMPLE_EH_DISPATCH
:
5034 case GIMPLE_EH_MUST_NOT_THROW
:
5038 /* OpenMP directives are validated by the FE and never operated
5039 on by the optimizers. Furthermore, GIMPLE_OMP_FOR may contain
5040 non-gimple expressions when the main index variable has had
5041 its address taken. This does not affect the loop itself
5042 because the header of an GIMPLE_OMP_FOR is merely used to determine
5043 how to setup the parallel iteration. */
5047 return verify_gimple_debug (stmt
);
5054 /* Verify the contents of a GIMPLE_PHI. Returns true if there is a problem,
5055 and false otherwise. */
5058 verify_gimple_phi (gphi
*phi
)
5062 tree phi_result
= gimple_phi_result (phi
);
5067 error ("invalid PHI result");
5071 virtual_p
= virtual_operand_p (phi_result
);
5072 if (TREE_CODE (phi_result
) != SSA_NAME
5074 && SSA_NAME_VAR (phi_result
) != gimple_vop (cfun
)))
5076 error ("invalid PHI result");
5080 for (i
= 0; i
< gimple_phi_num_args (phi
); i
++)
5082 tree t
= gimple_phi_arg_def (phi
, i
);
5086 error ("missing PHI def");
5090 /* Addressable variables do have SSA_NAMEs but they
5091 are not considered gimple values. */
5092 else if ((TREE_CODE (t
) == SSA_NAME
5093 && virtual_p
!= virtual_operand_p (t
))
5095 && (TREE_CODE (t
) != SSA_NAME
5096 || SSA_NAME_VAR (t
) != gimple_vop (cfun
)))
5098 && !is_gimple_val (t
)))
5100 error ("invalid PHI argument");
5101 debug_generic_expr (t
);
5104 #ifdef ENABLE_TYPES_CHECKING
5105 if (!useless_type_conversion_p (TREE_TYPE (phi_result
), TREE_TYPE (t
)))
5107 error ("incompatible types in PHI argument %u", i
);
5108 debug_generic_stmt (TREE_TYPE (phi_result
));
5109 debug_generic_stmt (TREE_TYPE (t
));
5118 /* Verify the GIMPLE statements inside the sequence STMTS. */
5121 verify_gimple_in_seq_2 (gimple_seq stmts
)
5123 gimple_stmt_iterator ittr
;
5126 for (ittr
= gsi_start (stmts
); !gsi_end_p (ittr
); gsi_next (&ittr
))
5128 gimple
*stmt
= gsi_stmt (ittr
);
5130 switch (gimple_code (stmt
))
5133 err
|= verify_gimple_in_seq_2 (
5134 gimple_bind_body (as_a
<gbind
*> (stmt
)));
5138 err
|= verify_gimple_in_seq_2 (gimple_try_eval (stmt
));
5139 err
|= verify_gimple_in_seq_2 (gimple_try_cleanup (stmt
));
5142 case GIMPLE_EH_FILTER
:
5143 err
|= verify_gimple_in_seq_2 (gimple_eh_filter_failure (stmt
));
5146 case GIMPLE_EH_ELSE
:
5148 geh_else
*eh_else
= as_a
<geh_else
*> (stmt
);
5149 err
|= verify_gimple_in_seq_2 (gimple_eh_else_n_body (eh_else
));
5150 err
|= verify_gimple_in_seq_2 (gimple_eh_else_e_body (eh_else
));
5155 err
|= verify_gimple_in_seq_2 (gimple_catch_handler (
5156 as_a
<gcatch
*> (stmt
)));
5159 case GIMPLE_TRANSACTION
:
5160 err
|= verify_gimple_transaction (as_a
<gtransaction
*> (stmt
));
5165 bool err2
= verify_gimple_stmt (stmt
);
5167 debug_gimple_stmt (stmt
);
5176 /* Verify the contents of a GIMPLE_TRANSACTION. Returns true if there
5177 is a problem, otherwise false. */
5180 verify_gimple_transaction (gtransaction
*stmt
)
5184 lab
= gimple_transaction_label_norm (stmt
);
5185 if (lab
!= NULL
&& TREE_CODE (lab
) != LABEL_DECL
)
5187 lab
= gimple_transaction_label_uninst (stmt
);
5188 if (lab
!= NULL
&& TREE_CODE (lab
) != LABEL_DECL
)
5190 lab
= gimple_transaction_label_over (stmt
);
5191 if (lab
!= NULL
&& TREE_CODE (lab
) != LABEL_DECL
)
5194 return verify_gimple_in_seq_2 (gimple_transaction_body (stmt
));
5198 /* Verify the GIMPLE statements inside the statement list STMTS. */
5201 verify_gimple_in_seq (gimple_seq stmts
)
5203 timevar_push (TV_TREE_STMT_VERIFY
);
5204 if (verify_gimple_in_seq_2 (stmts
))
5205 internal_error ("verify_gimple failed");
5206 timevar_pop (TV_TREE_STMT_VERIFY
);
5209 /* Return true when the T can be shared. */
5212 tree_node_can_be_shared (tree t
)
5214 if (IS_TYPE_OR_DECL_P (t
)
5215 || is_gimple_min_invariant (t
)
5216 || TREE_CODE (t
) == SSA_NAME
5217 || t
== error_mark_node
5218 || TREE_CODE (t
) == IDENTIFIER_NODE
)
5221 if (TREE_CODE (t
) == CASE_LABEL_EXPR
)
5230 /* Called via walk_tree. Verify tree sharing. */
5233 verify_node_sharing_1 (tree
*tp
, int *walk_subtrees
, void *data
)
5235 hash_set
<void *> *visited
= (hash_set
<void *> *) data
;
5237 if (tree_node_can_be_shared (*tp
))
5239 *walk_subtrees
= false;
5243 if (visited
->add (*tp
))
5249 /* Called via walk_gimple_stmt. Verify tree sharing. */
5252 verify_node_sharing (tree
*tp
, int *walk_subtrees
, void *data
)
5254 struct walk_stmt_info
*wi
= (struct walk_stmt_info
*) data
;
5255 return verify_node_sharing_1 (tp
, walk_subtrees
, wi
->info
);
5258 static bool eh_error_found
;
5260 verify_eh_throw_stmt_node (gimple
*const &stmt
, const int &,
5261 hash_set
<gimple
*> *visited
)
5263 if (!visited
->contains (stmt
))
5265 error ("dead STMT in EH table");
5266 debug_gimple_stmt (stmt
);
5267 eh_error_found
= true;
5272 /* Verify if the location LOCs block is in BLOCKS. */
5275 verify_location (hash_set
<tree
> *blocks
, location_t loc
)
5277 tree block
= LOCATION_BLOCK (loc
);
5278 if (block
!= NULL_TREE
5279 && !blocks
->contains (block
))
5281 error ("location references block not in block tree");
5284 if (block
!= NULL_TREE
)
5285 return verify_location (blocks
, BLOCK_SOURCE_LOCATION (block
));
5289 /* Called via walk_tree. Verify that expressions have no blocks. */
5292 verify_expr_no_block (tree
*tp
, int *walk_subtrees
, void *)
5296 *walk_subtrees
= false;
5300 location_t loc
= EXPR_LOCATION (*tp
);
5301 if (LOCATION_BLOCK (loc
) != NULL
)
5307 /* Called via walk_tree. Verify locations of expressions. */
5310 verify_expr_location_1 (tree
*tp
, int *walk_subtrees
, void *data
)
5312 hash_set
<tree
> *blocks
= (hash_set
<tree
> *) data
;
5314 if (VAR_P (*tp
) && DECL_HAS_DEBUG_EXPR_P (*tp
))
5316 tree t
= DECL_DEBUG_EXPR (*tp
);
5317 tree addr
= walk_tree (&t
, verify_expr_no_block
, NULL
, NULL
);
5322 || TREE_CODE (*tp
) == PARM_DECL
5323 || TREE_CODE (*tp
) == RESULT_DECL
)
5324 && DECL_HAS_VALUE_EXPR_P (*tp
))
5326 tree t
= DECL_VALUE_EXPR (*tp
);
5327 tree addr
= walk_tree (&t
, verify_expr_no_block
, NULL
, NULL
);
5334 *walk_subtrees
= false;
5338 location_t loc
= EXPR_LOCATION (*tp
);
5339 if (verify_location (blocks
, loc
))
5345 /* Called via walk_gimple_op. Verify locations of expressions. */
5348 verify_expr_location (tree
*tp
, int *walk_subtrees
, void *data
)
5350 struct walk_stmt_info
*wi
= (struct walk_stmt_info
*) data
;
5351 return verify_expr_location_1 (tp
, walk_subtrees
, wi
->info
);
5354 /* Insert all subblocks of BLOCK into BLOCKS and recurse. */
5357 collect_subblocks (hash_set
<tree
> *blocks
, tree block
)
5360 for (t
= BLOCK_SUBBLOCKS (block
); t
; t
= BLOCK_CHAIN (t
))
5363 collect_subblocks (blocks
, t
);
5367 /* Verify the GIMPLE statements in the CFG of FN. */
5370 verify_gimple_in_cfg (struct function
*fn
, bool verify_nothrow
)
5375 timevar_push (TV_TREE_STMT_VERIFY
);
5376 hash_set
<void *> visited
;
5377 hash_set
<gimple
*> visited_throwing_stmts
;
5379 /* Collect all BLOCKs referenced by the BLOCK tree of FN. */
5380 hash_set
<tree
> blocks
;
5381 if (DECL_INITIAL (fn
->decl
))
5383 blocks
.add (DECL_INITIAL (fn
->decl
));
5384 collect_subblocks (&blocks
, DECL_INITIAL (fn
->decl
));
5387 FOR_EACH_BB_FN (bb
, fn
)
5389 gimple_stmt_iterator gsi
;
5391 for (gphi_iterator gpi
= gsi_start_phis (bb
);
5395 gphi
*phi
= gpi
.phi ();
5399 if (gimple_bb (phi
) != bb
)
5401 error ("gimple_bb (phi) is set to a wrong basic block");
5405 err2
|= verify_gimple_phi (phi
);
5407 /* Only PHI arguments have locations. */
5408 if (gimple_location (phi
) != UNKNOWN_LOCATION
)
5410 error ("PHI node with location");
5414 for (i
= 0; i
< gimple_phi_num_args (phi
); i
++)
5416 tree arg
= gimple_phi_arg_def (phi
, i
);
5417 tree addr
= walk_tree (&arg
, verify_node_sharing_1
,
5421 error ("incorrect sharing of tree nodes");
5422 debug_generic_expr (addr
);
5425 location_t loc
= gimple_phi_arg_location (phi
, i
);
5426 if (virtual_operand_p (gimple_phi_result (phi
))
5427 && loc
!= UNKNOWN_LOCATION
)
5429 error ("virtual PHI with argument locations");
5432 addr
= walk_tree (&arg
, verify_expr_location_1
, &blocks
, NULL
);
5435 debug_generic_expr (addr
);
5438 err2
|= verify_location (&blocks
, loc
);
5442 debug_gimple_stmt (phi
);
5446 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
5448 gimple
*stmt
= gsi_stmt (gsi
);
5450 struct walk_stmt_info wi
;
5454 if (gimple_bb (stmt
) != bb
)
5456 error ("gimple_bb (stmt) is set to a wrong basic block");
5460 err2
|= verify_gimple_stmt (stmt
);
5461 err2
|= verify_location (&blocks
, gimple_location (stmt
));
5463 memset (&wi
, 0, sizeof (wi
));
5464 wi
.info
= (void *) &visited
;
5465 addr
= walk_gimple_op (stmt
, verify_node_sharing
, &wi
);
5468 error ("incorrect sharing of tree nodes");
5469 debug_generic_expr (addr
);
5473 memset (&wi
, 0, sizeof (wi
));
5474 wi
.info
= (void *) &blocks
;
5475 addr
= walk_gimple_op (stmt
, verify_expr_location
, &wi
);
5478 debug_generic_expr (addr
);
5482 /* ??? Instead of not checking these stmts at all the walker
5483 should know its context via wi. */
5484 if (!is_gimple_debug (stmt
)
5485 && !is_gimple_omp (stmt
))
5487 memset (&wi
, 0, sizeof (wi
));
5488 addr
= walk_gimple_op (stmt
, verify_expr
, &wi
);
5491 debug_generic_expr (addr
);
5492 inform (gimple_location (stmt
), "in statement");
5497 /* If the statement is marked as part of an EH region, then it is
5498 expected that the statement could throw. Verify that when we
5499 have optimizations that simplify statements such that we prove
5500 that they cannot throw, that we update other data structures
5502 lp_nr
= lookup_stmt_eh_lp (stmt
);
5504 visited_throwing_stmts
.add (stmt
);
5507 if (!stmt_could_throw_p (stmt
))
5511 error ("statement marked for throw, but doesn%'t");
5515 else if (!gsi_one_before_end_p (gsi
))
5517 error ("statement marked for throw in middle of block");
5523 debug_gimple_stmt (stmt
);
5528 hash_map
<gimple
*, int> *eh_table
= get_eh_throw_stmt_table (cfun
);
5529 eh_error_found
= false;
5531 eh_table
->traverse
<hash_set
<gimple
*> *, verify_eh_throw_stmt_node
>
5532 (&visited_throwing_stmts
);
5534 if (err
|| eh_error_found
)
5535 internal_error ("verify_gimple failed");
5537 verify_histograms ();
5538 timevar_pop (TV_TREE_STMT_VERIFY
);
5542 /* Verifies that the flow information is OK. */
5545 gimple_verify_flow_info (void)
5549 gimple_stmt_iterator gsi
;
5554 if (ENTRY_BLOCK_PTR_FOR_FN (cfun
)->il
.gimple
.seq
5555 || ENTRY_BLOCK_PTR_FOR_FN (cfun
)->il
.gimple
.phi_nodes
)
5557 error ("ENTRY_BLOCK has IL associated with it");
5561 if (EXIT_BLOCK_PTR_FOR_FN (cfun
)->il
.gimple
.seq
5562 || EXIT_BLOCK_PTR_FOR_FN (cfun
)->il
.gimple
.phi_nodes
)
5564 error ("EXIT_BLOCK has IL associated with it");
5568 FOR_EACH_EDGE (e
, ei
, EXIT_BLOCK_PTR_FOR_FN (cfun
)->preds
)
5569 if (e
->flags
& EDGE_FALLTHRU
)
5571 error ("fallthru to exit from bb %d", e
->src
->index
);
5575 FOR_EACH_BB_FN (bb
, cfun
)
5577 bool found_ctrl_stmt
= false;
5581 /* Skip labels on the start of basic block. */
5582 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
5585 gimple
*prev_stmt
= stmt
;
5587 stmt
= gsi_stmt (gsi
);
5589 if (gimple_code (stmt
) != GIMPLE_LABEL
)
5592 label
= gimple_label_label (as_a
<glabel
*> (stmt
));
5593 if (prev_stmt
&& DECL_NONLOCAL (label
))
5595 error ("nonlocal label ");
5596 print_generic_expr (stderr
, label
);
5597 fprintf (stderr
, " is not first in a sequence of labels in bb %d",
5602 if (prev_stmt
&& EH_LANDING_PAD_NR (label
) != 0)
5604 error ("EH landing pad label ");
5605 print_generic_expr (stderr
, label
);
5606 fprintf (stderr
, " is not first in a sequence of labels in bb %d",
5611 if (label_to_block (label
) != bb
)
5614 print_generic_expr (stderr
, label
);
5615 fprintf (stderr
, " to block does not match in bb %d",
5620 if (decl_function_context (label
) != current_function_decl
)
5623 print_generic_expr (stderr
, label
);
5624 fprintf (stderr
, " has incorrect context in bb %d",
5630 /* Verify that body of basic block BB is free of control flow. */
5631 for (; !gsi_end_p (gsi
); gsi_next (&gsi
))
5633 gimple
*stmt
= gsi_stmt (gsi
);
5635 if (found_ctrl_stmt
)
5637 error ("control flow in the middle of basic block %d",
5642 if (stmt_ends_bb_p (stmt
))
5643 found_ctrl_stmt
= true;
5645 if (glabel
*label_stmt
= dyn_cast
<glabel
*> (stmt
))
5648 print_generic_expr (stderr
, gimple_label_label (label_stmt
));
5649 fprintf (stderr
, " in the middle of basic block %d", bb
->index
);
5654 gsi
= gsi_last_nondebug_bb (bb
);
5655 if (gsi_end_p (gsi
))
5658 stmt
= gsi_stmt (gsi
);
5660 if (gimple_code (stmt
) == GIMPLE_LABEL
)
5663 err
|= verify_eh_edges (stmt
);
5665 if (is_ctrl_stmt (stmt
))
5667 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
5668 if (e
->flags
& EDGE_FALLTHRU
)
5670 error ("fallthru edge after a control statement in bb %d",
5676 if (gimple_code (stmt
) != GIMPLE_COND
)
5678 /* Verify that there are no edges with EDGE_TRUE/FALSE_FLAG set
5679 after anything else but if statement. */
5680 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
5681 if (e
->flags
& (EDGE_TRUE_VALUE
| EDGE_FALSE_VALUE
))
5683 error ("true/false edge after a non-GIMPLE_COND in bb %d",
5689 switch (gimple_code (stmt
))
5696 extract_true_false_edges_from_block (bb
, &true_edge
, &false_edge
);
5700 || !(true_edge
->flags
& EDGE_TRUE_VALUE
)
5701 || !(false_edge
->flags
& EDGE_FALSE_VALUE
)
5702 || (true_edge
->flags
& (EDGE_FALLTHRU
| EDGE_ABNORMAL
))
5703 || (false_edge
->flags
& (EDGE_FALLTHRU
| EDGE_ABNORMAL
))
5704 || EDGE_COUNT (bb
->succs
) >= 3)
5706 error ("wrong outgoing edge flags at end of bb %d",
5714 if (simple_goto_p (stmt
))
5716 error ("explicit goto at end of bb %d", bb
->index
);
5721 /* FIXME. We should double check that the labels in the
5722 destination blocks have their address taken. */
5723 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
5724 if ((e
->flags
& (EDGE_FALLTHRU
| EDGE_TRUE_VALUE
5725 | EDGE_FALSE_VALUE
))
5726 || !(e
->flags
& EDGE_ABNORMAL
))
5728 error ("wrong outgoing edge flags at end of bb %d",
5736 if (!gimple_call_builtin_p (stmt
, BUILT_IN_RETURN
))
5740 if (!single_succ_p (bb
)
5741 || (single_succ_edge (bb
)->flags
5742 & (EDGE_FALLTHRU
| EDGE_ABNORMAL
5743 | EDGE_TRUE_VALUE
| EDGE_FALSE_VALUE
)))
5745 error ("wrong outgoing edge flags at end of bb %d", bb
->index
);
5748 if (single_succ (bb
) != EXIT_BLOCK_PTR_FOR_FN (cfun
))
5750 error ("return edge does not point to exit in bb %d",
5758 gswitch
*switch_stmt
= as_a
<gswitch
*> (stmt
);
5763 n
= gimple_switch_num_labels (switch_stmt
);
5765 /* Mark all the destination basic blocks. */
5766 for (i
= 0; i
< n
; ++i
)
5768 tree lab
= CASE_LABEL (gimple_switch_label (switch_stmt
, i
));
5769 basic_block label_bb
= label_to_block (lab
);
5770 gcc_assert (!label_bb
->aux
|| label_bb
->aux
== (void *)1);
5771 label_bb
->aux
= (void *)1;
5774 /* Verify that the case labels are sorted. */
5775 prev
= gimple_switch_label (switch_stmt
, 0);
5776 for (i
= 1; i
< n
; ++i
)
5778 tree c
= gimple_switch_label (switch_stmt
, i
);
5781 error ("found default case not at the start of "
5787 && !tree_int_cst_lt (CASE_LOW (prev
), CASE_LOW (c
)))
5789 error ("case labels not sorted: ");
5790 print_generic_expr (stderr
, prev
);
5791 fprintf (stderr
," is greater than ");
5792 print_generic_expr (stderr
, c
);
5793 fprintf (stderr
," but comes before it.\n");
5798 /* VRP will remove the default case if it can prove it will
5799 never be executed. So do not verify there always exists
5800 a default case here. */
5802 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
5806 error ("extra outgoing edge %d->%d",
5807 bb
->index
, e
->dest
->index
);
5811 e
->dest
->aux
= (void *)2;
5812 if ((e
->flags
& (EDGE_FALLTHRU
| EDGE_ABNORMAL
5813 | EDGE_TRUE_VALUE
| EDGE_FALSE_VALUE
)))
5815 error ("wrong outgoing edge flags at end of bb %d",
5821 /* Check that we have all of them. */
5822 for (i
= 0; i
< n
; ++i
)
5824 tree lab
= CASE_LABEL (gimple_switch_label (switch_stmt
, i
));
5825 basic_block label_bb
= label_to_block (lab
);
5827 if (label_bb
->aux
!= (void *)2)
5829 error ("missing edge %i->%i", bb
->index
, label_bb
->index
);
5834 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
5835 e
->dest
->aux
= (void *)0;
5839 case GIMPLE_EH_DISPATCH
:
5840 err
|= verify_eh_dispatch_edge (as_a
<geh_dispatch
*> (stmt
));
5848 if (dom_info_state (CDI_DOMINATORS
) >= DOM_NO_FAST_QUERY
)
5849 verify_dominators (CDI_DOMINATORS
);
5855 /* Updates phi nodes after creating a forwarder block joined
5856 by edge FALLTHRU. */
5859 gimple_make_forwarder_block (edge fallthru
)
5863 basic_block dummy
, bb
;
5867 dummy
= fallthru
->src
;
5868 bb
= fallthru
->dest
;
5870 if (single_pred_p (bb
))
5873 /* If we redirected a branch we must create new PHI nodes at the
5875 for (gsi
= gsi_start_phis (dummy
); !gsi_end_p (gsi
); gsi_next (&gsi
))
5877 gphi
*phi
, *new_phi
;
5880 var
= gimple_phi_result (phi
);
5881 new_phi
= create_phi_node (var
, bb
);
5882 gimple_phi_set_result (phi
, copy_ssa_name (var
, phi
));
5883 add_phi_arg (new_phi
, gimple_phi_result (phi
), fallthru
,
5887 /* Add the arguments we have stored on edges. */
5888 FOR_EACH_EDGE (e
, ei
, bb
->preds
)
5893 flush_pending_stmts (e
);
5898 /* Return a non-special label in the head of basic block BLOCK.
5899 Create one if it doesn't exist. */
5902 gimple_block_label (basic_block bb
)
5904 gimple_stmt_iterator i
, s
= gsi_start_bb (bb
);
5909 for (i
= s
; !gsi_end_p (i
); first
= false, gsi_next (&i
))
5911 stmt
= dyn_cast
<glabel
*> (gsi_stmt (i
));
5914 label
= gimple_label_label (stmt
);
5915 if (!DECL_NONLOCAL (label
))
5918 gsi_move_before (&i
, &s
);
5923 label
= create_artificial_label (UNKNOWN_LOCATION
);
5924 stmt
= gimple_build_label (label
);
5925 gsi_insert_before (&s
, stmt
, GSI_NEW_STMT
);
5930 /* Attempt to perform edge redirection by replacing a possibly complex
5931 jump instruction by a goto or by removing the jump completely.
5932 This can apply only if all edges now point to the same block. The
5933 parameters and return values are equivalent to
5934 redirect_edge_and_branch. */
5937 gimple_try_redirect_by_replacing_jump (edge e
, basic_block target
)
5939 basic_block src
= e
->src
;
5940 gimple_stmt_iterator i
;
5943 /* We can replace or remove a complex jump only when we have exactly
5945 if (EDGE_COUNT (src
->succs
) != 2
5946 /* Verify that all targets will be TARGET. Specifically, the
5947 edge that is not E must also go to TARGET. */
5948 || EDGE_SUCC (src
, EDGE_SUCC (src
, 0) == e
)->dest
!= target
)
5951 i
= gsi_last_bb (src
);
5955 stmt
= gsi_stmt (i
);
5957 if (gimple_code (stmt
) == GIMPLE_COND
|| gimple_code (stmt
) == GIMPLE_SWITCH
)
5959 gsi_remove (&i
, true);
5960 e
= ssa_redirect_edge (e
, target
);
5961 e
->flags
= EDGE_FALLTHRU
;
5969 /* Redirect E to DEST. Return NULL on failure. Otherwise, return the
5970 edge representing the redirected branch. */
5973 gimple_redirect_edge_and_branch (edge e
, basic_block dest
)
5975 basic_block bb
= e
->src
;
5976 gimple_stmt_iterator gsi
;
5980 if (e
->flags
& EDGE_ABNORMAL
)
5983 if (e
->dest
== dest
)
5986 if (e
->flags
& EDGE_EH
)
5987 return redirect_eh_edge (e
, dest
);
5989 if (e
->src
!= ENTRY_BLOCK_PTR_FOR_FN (cfun
))
5991 ret
= gimple_try_redirect_by_replacing_jump (e
, dest
);
5996 gsi
= gsi_last_nondebug_bb (bb
);
5997 stmt
= gsi_end_p (gsi
) ? NULL
: gsi_stmt (gsi
);
5999 switch (stmt
? gimple_code (stmt
) : GIMPLE_ERROR_MARK
)
6002 /* For COND_EXPR, we only need to redirect the edge. */
6006 /* No non-abnormal edges should lead from a non-simple goto, and
6007 simple ones should be represented implicitly. */
6012 gswitch
*switch_stmt
= as_a
<gswitch
*> (stmt
);
6013 tree label
= gimple_block_label (dest
);
6014 tree cases
= get_cases_for_edge (e
, switch_stmt
);
6016 /* If we have a list of cases associated with E, then use it
6017 as it's a lot faster than walking the entire case vector. */
6020 edge e2
= find_edge (e
->src
, dest
);
6027 CASE_LABEL (cases
) = label
;
6028 cases
= CASE_CHAIN (cases
);
6031 /* If there was already an edge in the CFG, then we need
6032 to move all the cases associated with E to E2. */
6035 tree cases2
= get_cases_for_edge (e2
, switch_stmt
);
6037 CASE_CHAIN (last
) = CASE_CHAIN (cases2
);
6038 CASE_CHAIN (cases2
) = first
;
6040 bitmap_set_bit (touched_switch_bbs
, gimple_bb (stmt
)->index
);
6044 size_t i
, n
= gimple_switch_num_labels (switch_stmt
);
6046 for (i
= 0; i
< n
; i
++)
6048 tree elt
= gimple_switch_label (switch_stmt
, i
);
6049 if (label_to_block (CASE_LABEL (elt
)) == e
->dest
)
6050 CASE_LABEL (elt
) = label
;
6058 gasm
*asm_stmt
= as_a
<gasm
*> (stmt
);
6059 int i
, n
= gimple_asm_nlabels (asm_stmt
);
6062 for (i
= 0; i
< n
; ++i
)
6064 tree cons
= gimple_asm_label_op (asm_stmt
, i
);
6065 if (label_to_block (TREE_VALUE (cons
)) == e
->dest
)
6068 label
= gimple_block_label (dest
);
6069 TREE_VALUE (cons
) = label
;
6073 /* If we didn't find any label matching the former edge in the
6074 asm labels, we must be redirecting the fallthrough
6076 gcc_assert (label
|| (e
->flags
& EDGE_FALLTHRU
));
6081 gsi_remove (&gsi
, true);
6082 e
->flags
|= EDGE_FALLTHRU
;
6085 case GIMPLE_OMP_RETURN
:
6086 case GIMPLE_OMP_CONTINUE
:
6087 case GIMPLE_OMP_SECTIONS_SWITCH
:
6088 case GIMPLE_OMP_FOR
:
6089 /* The edges from OMP constructs can be simply redirected. */
6092 case GIMPLE_EH_DISPATCH
:
6093 if (!(e
->flags
& EDGE_FALLTHRU
))
6094 redirect_eh_dispatch_edge (as_a
<geh_dispatch
*> (stmt
), e
, dest
);
6097 case GIMPLE_TRANSACTION
:
6098 if (e
->flags
& EDGE_TM_ABORT
)
6099 gimple_transaction_set_label_over (as_a
<gtransaction
*> (stmt
),
6100 gimple_block_label (dest
));
6101 else if (e
->flags
& EDGE_TM_UNINSTRUMENTED
)
6102 gimple_transaction_set_label_uninst (as_a
<gtransaction
*> (stmt
),
6103 gimple_block_label (dest
));
6105 gimple_transaction_set_label_norm (as_a
<gtransaction
*> (stmt
),
6106 gimple_block_label (dest
));
6110 /* Otherwise it must be a fallthru edge, and we don't need to
6111 do anything besides redirecting it. */
6112 gcc_assert (e
->flags
& EDGE_FALLTHRU
);
6116 /* Update/insert PHI nodes as necessary. */
6118 /* Now update the edges in the CFG. */
6119 e
= ssa_redirect_edge (e
, dest
);
6124 /* Returns true if it is possible to remove edge E by redirecting
6125 it to the destination of the other edge from E->src. */
6128 gimple_can_remove_branch_p (const_edge e
)
6130 if (e
->flags
& (EDGE_ABNORMAL
| EDGE_EH
))
6136 /* Simple wrapper, as we can always redirect fallthru edges. */
6139 gimple_redirect_edge_and_branch_force (edge e
, basic_block dest
)
6141 e
= gimple_redirect_edge_and_branch (e
, dest
);
6148 /* Splits basic block BB after statement STMT (but at least after the
6149 labels). If STMT is NULL, BB is split just after the labels. */
6152 gimple_split_block (basic_block bb
, void *stmt
)
6154 gimple_stmt_iterator gsi
;
6155 gimple_stmt_iterator gsi_tgt
;
6161 new_bb
= create_empty_bb (bb
);
6163 /* Redirect the outgoing edges. */
6164 new_bb
->succs
= bb
->succs
;
6166 FOR_EACH_EDGE (e
, ei
, new_bb
->succs
)
6169 /* Get a stmt iterator pointing to the first stmt to move. */
6170 if (!stmt
|| gimple_code ((gimple
*) stmt
) == GIMPLE_LABEL
)
6171 gsi
= gsi_after_labels (bb
);
6174 gsi
= gsi_for_stmt ((gimple
*) stmt
);
6178 /* Move everything from GSI to the new basic block. */
6179 if (gsi_end_p (gsi
))
6182 /* Split the statement list - avoid re-creating new containers as this
6183 brings ugly quadratic memory consumption in the inliner.
6184 (We are still quadratic since we need to update stmt BB pointers,
6186 gsi_split_seq_before (&gsi
, &list
);
6187 set_bb_seq (new_bb
, list
);
6188 for (gsi_tgt
= gsi_start (list
);
6189 !gsi_end_p (gsi_tgt
); gsi_next (&gsi_tgt
))
6190 gimple_set_bb (gsi_stmt (gsi_tgt
), new_bb
);
6196 /* Moves basic block BB after block AFTER. */
6199 gimple_move_block_after (basic_block bb
, basic_block after
)
6201 if (bb
->prev_bb
== after
)
6205 link_block (bb
, after
);
6211 /* Return TRUE if block BB has no executable statements, otherwise return
6215 gimple_empty_block_p (basic_block bb
)
6217 /* BB must have no executable statements. */
6218 gimple_stmt_iterator gsi
= gsi_after_labels (bb
);
6221 if (gsi_end_p (gsi
))
6223 if (is_gimple_debug (gsi_stmt (gsi
)))
6224 gsi_next_nondebug (&gsi
);
6225 return gsi_end_p (gsi
);
6229 /* Split a basic block if it ends with a conditional branch and if the
6230 other part of the block is not empty. */
6233 gimple_split_block_before_cond_jump (basic_block bb
)
6235 gimple
*last
, *split_point
;
6236 gimple_stmt_iterator gsi
= gsi_last_nondebug_bb (bb
);
6237 if (gsi_end_p (gsi
))
6239 last
= gsi_stmt (gsi
);
6240 if (gimple_code (last
) != GIMPLE_COND
6241 && gimple_code (last
) != GIMPLE_SWITCH
)
6244 split_point
= gsi_stmt (gsi
);
6245 return split_block (bb
, split_point
)->dest
;
6249 /* Return true if basic_block can be duplicated. */
6252 gimple_can_duplicate_bb_p (const_basic_block bb ATTRIBUTE_UNUSED
)
6257 /* Create a duplicate of the basic block BB. NOTE: This does not
6258 preserve SSA form. */
6261 gimple_duplicate_bb (basic_block bb
)
6264 gimple_stmt_iterator gsi_tgt
;
6266 new_bb
= create_empty_bb (EXIT_BLOCK_PTR_FOR_FN (cfun
)->prev_bb
);
6268 /* Copy the PHI nodes. We ignore PHI node arguments here because
6269 the incoming edges have not been setup yet. */
6270 for (gphi_iterator gpi
= gsi_start_phis (bb
);
6276 copy
= create_phi_node (NULL_TREE
, new_bb
);
6277 create_new_def_for (gimple_phi_result (phi
), copy
,
6278 gimple_phi_result_ptr (copy
));
6279 gimple_set_uid (copy
, gimple_uid (phi
));
6282 gsi_tgt
= gsi_start_bb (new_bb
);
6283 for (gimple_stmt_iterator gsi
= gsi_start_bb (bb
);
6287 def_operand_p def_p
;
6288 ssa_op_iter op_iter
;
6290 gimple
*stmt
, *copy
;
6292 stmt
= gsi_stmt (gsi
);
6293 if (gimple_code (stmt
) == GIMPLE_LABEL
)
6296 /* Don't duplicate label debug stmts. */
6297 if (gimple_debug_bind_p (stmt
)
6298 && TREE_CODE (gimple_debug_bind_get_var (stmt
))
6302 /* Create a new copy of STMT and duplicate STMT's virtual
6304 copy
= gimple_copy (stmt
);
6305 gsi_insert_after (&gsi_tgt
, copy
, GSI_NEW_STMT
);
6307 maybe_duplicate_eh_stmt (copy
, stmt
);
6308 gimple_duplicate_stmt_histograms (cfun
, copy
, cfun
, stmt
);
6310 /* When copying around a stmt writing into a local non-user
6311 aggregate, make sure it won't share stack slot with other
6313 lhs
= gimple_get_lhs (stmt
);
6314 if (lhs
&& TREE_CODE (lhs
) != SSA_NAME
)
6316 tree base
= get_base_address (lhs
);
6318 && (VAR_P (base
) || TREE_CODE (base
) == RESULT_DECL
)
6319 && DECL_IGNORED_P (base
)
6320 && !TREE_STATIC (base
)
6321 && !DECL_EXTERNAL (base
)
6322 && (!VAR_P (base
) || !DECL_HAS_VALUE_EXPR_P (base
)))
6323 DECL_NONSHAREABLE (base
) = 1;
6326 /* Create new names for all the definitions created by COPY and
6327 add replacement mappings for each new name. */
6328 FOR_EACH_SSA_DEF_OPERAND (def_p
, copy
, op_iter
, SSA_OP_ALL_DEFS
)
6329 create_new_def_for (DEF_FROM_PTR (def_p
), copy
, def_p
);
6335 /* Adds phi node arguments for edge E_COPY after basic block duplication. */
6338 add_phi_args_after_copy_edge (edge e_copy
)
6340 basic_block bb
, bb_copy
= e_copy
->src
, dest
;
6343 gphi
*phi
, *phi_copy
;
6345 gphi_iterator psi
, psi_copy
;
6347 if (gimple_seq_empty_p (phi_nodes (e_copy
->dest
)))
6350 bb
= bb_copy
->flags
& BB_DUPLICATED
? get_bb_original (bb_copy
) : bb_copy
;
6352 if (e_copy
->dest
->flags
& BB_DUPLICATED
)
6353 dest
= get_bb_original (e_copy
->dest
);
6355 dest
= e_copy
->dest
;
6357 e
= find_edge (bb
, dest
);
6360 /* During loop unrolling the target of the latch edge is copied.
6361 In this case we are not looking for edge to dest, but to
6362 duplicated block whose original was dest. */
6363 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
6365 if ((e
->dest
->flags
& BB_DUPLICATED
)
6366 && get_bb_original (e
->dest
) == dest
)
6370 gcc_assert (e
!= NULL
);
6373 for (psi
= gsi_start_phis (e
->dest
),
6374 psi_copy
= gsi_start_phis (e_copy
->dest
);
6376 gsi_next (&psi
), gsi_next (&psi_copy
))
6379 phi_copy
= psi_copy
.phi ();
6380 def
= PHI_ARG_DEF_FROM_EDGE (phi
, e
);
6381 add_phi_arg (phi_copy
, def
, e_copy
,
6382 gimple_phi_arg_location_from_edge (phi
, e
));
6387 /* Basic block BB_COPY was created by code duplication. Add phi node
6388 arguments for edges going out of BB_COPY. The blocks that were
6389 duplicated have BB_DUPLICATED set. */
6392 add_phi_args_after_copy_bb (basic_block bb_copy
)
6397 FOR_EACH_EDGE (e_copy
, ei
, bb_copy
->succs
)
6399 add_phi_args_after_copy_edge (e_copy
);
6403 /* Blocks in REGION_COPY array of length N_REGION were created by
6404 duplication of basic blocks. Add phi node arguments for edges
6405 going from these blocks. If E_COPY is not NULL, also add
6406 phi node arguments for its destination.*/
6409 add_phi_args_after_copy (basic_block
*region_copy
, unsigned n_region
,
6414 for (i
= 0; i
< n_region
; i
++)
6415 region_copy
[i
]->flags
|= BB_DUPLICATED
;
6417 for (i
= 0; i
< n_region
; i
++)
6418 add_phi_args_after_copy_bb (region_copy
[i
]);
6420 add_phi_args_after_copy_edge (e_copy
);
6422 for (i
= 0; i
< n_region
; i
++)
6423 region_copy
[i
]->flags
&= ~BB_DUPLICATED
;
6426 /* Duplicates a REGION (set of N_REGION basic blocks) with just a single
6427 important exit edge EXIT. By important we mean that no SSA name defined
6428 inside region is live over the other exit edges of the region. All entry
6429 edges to the region must go to ENTRY->dest. The edge ENTRY is redirected
6430 to the duplicate of the region. Dominance and loop information is
6431 updated if UPDATE_DOMINANCE is true, but not the SSA web. If
6432 UPDATE_DOMINANCE is false then we assume that the caller will update the
6433 dominance information after calling this function. The new basic
6434 blocks are stored to REGION_COPY in the same order as they had in REGION,
6435 provided that REGION_COPY is not NULL.
6436 The function returns false if it is unable to copy the region,
6440 gimple_duplicate_sese_region (edge entry
, edge exit
,
6441 basic_block
*region
, unsigned n_region
,
6442 basic_block
*region_copy
,
6443 bool update_dominance
)
6446 bool free_region_copy
= false, copying_header
= false;
6447 struct loop
*loop
= entry
->dest
->loop_father
;
6449 vec
<basic_block
> doms
= vNULL
;
6451 profile_count total_count
= profile_count::uninitialized ();
6452 profile_count entry_count
= profile_count::uninitialized ();
6454 if (!can_copy_bbs_p (region
, n_region
))
6457 /* Some sanity checking. Note that we do not check for all possible
6458 missuses of the functions. I.e. if you ask to copy something weird,
6459 it will work, but the state of structures probably will not be
6461 for (i
= 0; i
< n_region
; i
++)
6463 /* We do not handle subloops, i.e. all the blocks must belong to the
6465 if (region
[i
]->loop_father
!= loop
)
6468 if (region
[i
] != entry
->dest
6469 && region
[i
] == loop
->header
)
6473 /* In case the function is used for loop header copying (which is the primary
6474 use), ensure that EXIT and its copy will be new latch and entry edges. */
6475 if (loop
->header
== entry
->dest
)
6477 copying_header
= true;
6479 if (!dominated_by_p (CDI_DOMINATORS
, loop
->latch
, exit
->src
))
6482 for (i
= 0; i
< n_region
; i
++)
6483 if (region
[i
] != exit
->src
6484 && dominated_by_p (CDI_DOMINATORS
, region
[i
], exit
->src
))
6488 initialize_original_copy_tables ();
6491 set_loop_copy (loop
, loop_outer (loop
));
6493 set_loop_copy (loop
, loop
);
6497 region_copy
= XNEWVEC (basic_block
, n_region
);
6498 free_region_copy
= true;
6501 /* Record blocks outside the region that are dominated by something
6503 if (update_dominance
)
6506 doms
= get_dominated_by_region (CDI_DOMINATORS
, region
, n_region
);
6509 if (entry
->dest
->count
.initialized_p ())
6511 total_count
= entry
->dest
->count
;
6512 entry_count
= entry
->count ();
6513 /* Fix up corner cases, to avoid division by zero or creation of negative
6515 if (entry_count
> total_count
)
6516 entry_count
= total_count
;
6519 copy_bbs (region
, n_region
, region_copy
, &exit
, 1, &exit_copy
, loop
,
6520 split_edge_bb_loc (entry
), update_dominance
);
6521 if (total_count
.initialized_p () && entry_count
.initialized_p ())
6523 scale_bbs_frequencies_profile_count (region
, n_region
,
6524 total_count
- entry_count
,
6526 scale_bbs_frequencies_profile_count (region_copy
, n_region
, entry_count
,
6532 loop
->header
= exit
->dest
;
6533 loop
->latch
= exit
->src
;
6536 /* Redirect the entry and add the phi node arguments. */
6537 redirected
= redirect_edge_and_branch (entry
, get_bb_copy (entry
->dest
));
6538 gcc_assert (redirected
!= NULL
);
6539 flush_pending_stmts (entry
);
6541 /* Concerning updating of dominators: We must recount dominators
6542 for entry block and its copy. Anything that is outside of the
6543 region, but was dominated by something inside needs recounting as
6545 if (update_dominance
)
6547 set_immediate_dominator (CDI_DOMINATORS
, entry
->dest
, entry
->src
);
6548 doms
.safe_push (get_bb_original (entry
->dest
));
6549 iterate_fix_dominators (CDI_DOMINATORS
, doms
, false);
6553 /* Add the other PHI node arguments. */
6554 add_phi_args_after_copy (region_copy
, n_region
, NULL
);
6556 if (free_region_copy
)
6559 free_original_copy_tables ();
6563 /* Checks if BB is part of the region defined by N_REGION BBS. */
6565 bb_part_of_region_p (basic_block bb
, basic_block
* bbs
, unsigned n_region
)
6569 for (n
= 0; n
< n_region
; n
++)
6577 /* Duplicates REGION consisting of N_REGION blocks. The new blocks
6578 are stored to REGION_COPY in the same order in that they appear
6579 in REGION, if REGION_COPY is not NULL. ENTRY is the entry to
6580 the region, EXIT an exit from it. The condition guarding EXIT
6581 is moved to ENTRY. Returns true if duplication succeeds, false
6607 gimple_duplicate_sese_tail (edge entry
, edge exit
,
6608 basic_block
*region
, unsigned n_region
,
6609 basic_block
*region_copy
)
6612 bool free_region_copy
= false;
6613 struct loop
*loop
= exit
->dest
->loop_father
;
6614 struct loop
*orig_loop
= entry
->dest
->loop_father
;
6615 basic_block switch_bb
, entry_bb
, nentry_bb
;
6616 vec
<basic_block
> doms
;
6617 profile_count total_count
= profile_count::uninitialized (),
6618 exit_count
= profile_count::uninitialized ();
6619 edge exits
[2], nexits
[2], e
;
6620 gimple_stmt_iterator gsi
;
6623 basic_block exit_bb
;
6627 struct loop
*target
, *aloop
, *cloop
;
6629 gcc_assert (EDGE_COUNT (exit
->src
->succs
) == 2);
6631 exits
[1] = EDGE_SUCC (exit
->src
, EDGE_SUCC (exit
->src
, 0) == exit
);
6633 if (!can_copy_bbs_p (region
, n_region
))
6636 initialize_original_copy_tables ();
6637 set_loop_copy (orig_loop
, loop
);
6640 for (aloop
= orig_loop
->inner
; aloop
; aloop
= aloop
->next
)
6642 if (bb_part_of_region_p (aloop
->header
, region
, n_region
))
6644 cloop
= duplicate_loop (aloop
, target
);
6645 duplicate_subloops (aloop
, cloop
);
6651 region_copy
= XNEWVEC (basic_block
, n_region
);
6652 free_region_copy
= true;
6655 gcc_assert (!need_ssa_update_p (cfun
));
6657 /* Record blocks outside the region that are dominated by something
6659 doms
= get_dominated_by_region (CDI_DOMINATORS
, region
, n_region
);
6661 total_count
= exit
->src
->count
;
6662 exit_count
= exit
->count ();
6663 /* Fix up corner cases, to avoid division by zero or creation of negative
6665 if (exit_count
> total_count
)
6666 exit_count
= total_count
;
6668 copy_bbs (region
, n_region
, region_copy
, exits
, 2, nexits
, orig_loop
,
6669 split_edge_bb_loc (exit
), true);
6670 if (total_count
.initialized_p () && exit_count
.initialized_p ())
6672 scale_bbs_frequencies_profile_count (region
, n_region
,
6673 total_count
- exit_count
,
6675 scale_bbs_frequencies_profile_count (region_copy
, n_region
, exit_count
,
6679 /* Create the switch block, and put the exit condition to it. */
6680 entry_bb
= entry
->dest
;
6681 nentry_bb
= get_bb_copy (entry_bb
);
6682 if (!last_stmt (entry
->src
)
6683 || !stmt_ends_bb_p (last_stmt (entry
->src
)))
6684 switch_bb
= entry
->src
;
6686 switch_bb
= split_edge (entry
);
6687 set_immediate_dominator (CDI_DOMINATORS
, nentry_bb
, switch_bb
);
6689 gsi
= gsi_last_bb (switch_bb
);
6690 cond_stmt
= last_stmt (exit
->src
);
6691 gcc_assert (gimple_code (cond_stmt
) == GIMPLE_COND
);
6692 cond_stmt
= gimple_copy (cond_stmt
);
6694 gsi_insert_after (&gsi
, cond_stmt
, GSI_NEW_STMT
);
6696 sorig
= single_succ_edge (switch_bb
);
6697 sorig
->flags
= exits
[1]->flags
;
6698 sorig
->probability
= exits
[1]->probability
;
6699 snew
= make_edge (switch_bb
, nentry_bb
, exits
[0]->flags
);
6700 snew
->probability
= exits
[0]->probability
;
6703 /* Register the new edge from SWITCH_BB in loop exit lists. */
6704 rescan_loop_exit (snew
, true, false);
6706 /* Add the PHI node arguments. */
6707 add_phi_args_after_copy (region_copy
, n_region
, snew
);
6709 /* Get rid of now superfluous conditions and associated edges (and phi node
6711 exit_bb
= exit
->dest
;
6713 e
= redirect_edge_and_branch (exits
[0], exits
[1]->dest
);
6714 PENDING_STMT (e
) = NULL
;
6716 /* The latch of ORIG_LOOP was copied, and so was the backedge
6717 to the original header. We redirect this backedge to EXIT_BB. */
6718 for (i
= 0; i
< n_region
; i
++)
6719 if (get_bb_original (region_copy
[i
]) == orig_loop
->latch
)
6721 gcc_assert (single_succ_edge (region_copy
[i
]));
6722 e
= redirect_edge_and_branch (single_succ_edge (region_copy
[i
]), exit_bb
);
6723 PENDING_STMT (e
) = NULL
;
6724 for (psi
= gsi_start_phis (exit_bb
);
6729 def
= PHI_ARG_DEF (phi
, nexits
[0]->dest_idx
);
6730 add_phi_arg (phi
, def
, e
, gimple_phi_arg_location_from_edge (phi
, e
));
6733 e
= redirect_edge_and_branch (nexits
[1], nexits
[0]->dest
);
6734 PENDING_STMT (e
) = NULL
;
6736 /* Anything that is outside of the region, but was dominated by something
6737 inside needs to update dominance info. */
6738 iterate_fix_dominators (CDI_DOMINATORS
, doms
, false);
6740 /* Update the SSA web. */
6741 update_ssa (TODO_update_ssa
);
6743 if (free_region_copy
)
6746 free_original_copy_tables ();
6750 /* Add all the blocks dominated by ENTRY to the array BBS_P. Stop
6751 adding blocks when the dominator traversal reaches EXIT. This
6752 function silently assumes that ENTRY strictly dominates EXIT. */
6755 gather_blocks_in_sese_region (basic_block entry
, basic_block exit
,
6756 vec
<basic_block
> *bbs_p
)
6760 for (son
= first_dom_son (CDI_DOMINATORS
, entry
);
6762 son
= next_dom_son (CDI_DOMINATORS
, son
))
6764 bbs_p
->safe_push (son
);
6766 gather_blocks_in_sese_region (son
, exit
, bbs_p
);
6770 /* Replaces *TP with a duplicate (belonging to function TO_CONTEXT).
6771 The duplicates are recorded in VARS_MAP. */
6774 replace_by_duplicate_decl (tree
*tp
, hash_map
<tree
, tree
> *vars_map
,
6777 tree t
= *tp
, new_t
;
6778 struct function
*f
= DECL_STRUCT_FUNCTION (to_context
);
6780 if (DECL_CONTEXT (t
) == to_context
)
6784 tree
&loc
= vars_map
->get_or_insert (t
, &existed
);
6790 new_t
= copy_var_decl (t
, DECL_NAME (t
), TREE_TYPE (t
));
6791 add_local_decl (f
, new_t
);
6795 gcc_assert (TREE_CODE (t
) == CONST_DECL
);
6796 new_t
= copy_node (t
);
6798 DECL_CONTEXT (new_t
) = to_context
;
6809 /* Creates an ssa name in TO_CONTEXT equivalent to NAME.
6810 VARS_MAP maps old ssa names and var_decls to the new ones. */
6813 replace_ssa_name (tree name
, hash_map
<tree
, tree
> *vars_map
,
6818 gcc_assert (!virtual_operand_p (name
));
6820 tree
*loc
= vars_map
->get (name
);
6824 tree decl
= SSA_NAME_VAR (name
);
6827 gcc_assert (!SSA_NAME_IS_DEFAULT_DEF (name
));
6828 replace_by_duplicate_decl (&decl
, vars_map
, to_context
);
6829 new_name
= make_ssa_name_fn (DECL_STRUCT_FUNCTION (to_context
),
6830 decl
, SSA_NAME_DEF_STMT (name
));
6833 new_name
= copy_ssa_name_fn (DECL_STRUCT_FUNCTION (to_context
),
6834 name
, SSA_NAME_DEF_STMT (name
));
6836 /* Now that we've used the def stmt to define new_name, make sure it
6837 doesn't define name anymore. */
6838 SSA_NAME_DEF_STMT (name
) = NULL
;
6840 vars_map
->put (name
, new_name
);
6854 hash_map
<tree
, tree
> *vars_map
;
6855 htab_t new_label_map
;
6856 hash_map
<void *, void *> *eh_map
;
6860 /* Helper for move_block_to_fn. Set TREE_BLOCK in every expression
6861 contained in *TP if it has been ORIG_BLOCK previously and change the
6862 DECL_CONTEXT of every local variable referenced in *TP. */
6865 move_stmt_op (tree
*tp
, int *walk_subtrees
, void *data
)
6867 struct walk_stmt_info
*wi
= (struct walk_stmt_info
*) data
;
6868 struct move_stmt_d
*p
= (struct move_stmt_d
*) wi
->info
;
6873 tree block
= TREE_BLOCK (t
);
6874 if (block
== NULL_TREE
)
6876 else if (block
== p
->orig_block
6877 || p
->orig_block
== NULL_TREE
)
6878 TREE_SET_BLOCK (t
, p
->new_block
);
6879 else if (flag_checking
)
6881 while (block
&& TREE_CODE (block
) == BLOCK
&& block
!= p
->orig_block
)
6882 block
= BLOCK_SUPERCONTEXT (block
);
6883 gcc_assert (block
== p
->orig_block
);
6886 else if (DECL_P (t
) || TREE_CODE (t
) == SSA_NAME
)
6888 if (TREE_CODE (t
) == SSA_NAME
)
6889 *tp
= replace_ssa_name (t
, p
->vars_map
, p
->to_context
);
6890 else if (TREE_CODE (t
) == PARM_DECL
6891 && gimple_in_ssa_p (cfun
))
6892 *tp
= *(p
->vars_map
->get (t
));
6893 else if (TREE_CODE (t
) == LABEL_DECL
)
6895 if (p
->new_label_map
)
6897 struct tree_map in
, *out
;
6899 out
= (struct tree_map
*)
6900 htab_find_with_hash (p
->new_label_map
, &in
, DECL_UID (t
));
6905 /* For FORCED_LABELs we can end up with references from other
6906 functions if some SESE regions are outlined. It is UB to
6907 jump in between them, but they could be used just for printing
6908 addresses etc. In that case, DECL_CONTEXT on the label should
6909 be the function containing the glabel stmt with that LABEL_DECL,
6910 rather than whatever function a reference to the label was seen
6912 if (!FORCED_LABEL (t
) && !DECL_NONLOCAL (t
))
6913 DECL_CONTEXT (t
) = p
->to_context
;
6915 else if (p
->remap_decls_p
)
6917 /* Replace T with its duplicate. T should no longer appear in the
6918 parent function, so this looks wasteful; however, it may appear
6919 in referenced_vars, and more importantly, as virtual operands of
6920 statements, and in alias lists of other variables. It would be
6921 quite difficult to expunge it from all those places. ??? It might
6922 suffice to do this for addressable variables. */
6923 if ((VAR_P (t
) && !is_global_var (t
))
6924 || TREE_CODE (t
) == CONST_DECL
)
6925 replace_by_duplicate_decl (tp
, p
->vars_map
, p
->to_context
);
6929 else if (TYPE_P (t
))
6935 /* Helper for move_stmt_r. Given an EH region number for the source
6936 function, map that to the duplicate EH regio number in the dest. */
6939 move_stmt_eh_region_nr (int old_nr
, struct move_stmt_d
*p
)
6941 eh_region old_r
, new_r
;
6943 old_r
= get_eh_region_from_number (old_nr
);
6944 new_r
= static_cast<eh_region
> (*p
->eh_map
->get (old_r
));
6946 return new_r
->index
;
6949 /* Similar, but operate on INTEGER_CSTs. */
6952 move_stmt_eh_region_tree_nr (tree old_t_nr
, struct move_stmt_d
*p
)
6956 old_nr
= tree_to_shwi (old_t_nr
);
6957 new_nr
= move_stmt_eh_region_nr (old_nr
, p
);
6959 return build_int_cst (integer_type_node
, new_nr
);
6962 /* Like move_stmt_op, but for gimple statements.
6964 Helper for move_block_to_fn. Set GIMPLE_BLOCK in every expression
6965 contained in the current statement in *GSI_P and change the
6966 DECL_CONTEXT of every local variable referenced in the current
6970 move_stmt_r (gimple_stmt_iterator
*gsi_p
, bool *handled_ops_p
,
6971 struct walk_stmt_info
*wi
)
6973 struct move_stmt_d
*p
= (struct move_stmt_d
*) wi
->info
;
6974 gimple
*stmt
= gsi_stmt (*gsi_p
);
6975 tree block
= gimple_block (stmt
);
6977 if (block
== p
->orig_block
6978 || (p
->orig_block
== NULL_TREE
6979 && block
!= NULL_TREE
))
6980 gimple_set_block (stmt
, p
->new_block
);
6982 switch (gimple_code (stmt
))
6985 /* Remap the region numbers for __builtin_eh_{pointer,filter}. */
6987 tree r
, fndecl
= gimple_call_fndecl (stmt
);
6988 if (fndecl
&& DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
)
6989 switch (DECL_FUNCTION_CODE (fndecl
))
6991 case BUILT_IN_EH_COPY_VALUES
:
6992 r
= gimple_call_arg (stmt
, 1);
6993 r
= move_stmt_eh_region_tree_nr (r
, p
);
6994 gimple_call_set_arg (stmt
, 1, r
);
6997 case BUILT_IN_EH_POINTER
:
6998 case BUILT_IN_EH_FILTER
:
6999 r
= gimple_call_arg (stmt
, 0);
7000 r
= move_stmt_eh_region_tree_nr (r
, p
);
7001 gimple_call_set_arg (stmt
, 0, r
);
7012 gresx
*resx_stmt
= as_a
<gresx
*> (stmt
);
7013 int r
= gimple_resx_region (resx_stmt
);
7014 r
= move_stmt_eh_region_nr (r
, p
);
7015 gimple_resx_set_region (resx_stmt
, r
);
7019 case GIMPLE_EH_DISPATCH
:
7021 geh_dispatch
*eh_dispatch_stmt
= as_a
<geh_dispatch
*> (stmt
);
7022 int r
= gimple_eh_dispatch_region (eh_dispatch_stmt
);
7023 r
= move_stmt_eh_region_nr (r
, p
);
7024 gimple_eh_dispatch_set_region (eh_dispatch_stmt
, r
);
7028 case GIMPLE_OMP_RETURN
:
7029 case GIMPLE_OMP_CONTINUE
:
7034 /* For FORCED_LABEL, move_stmt_op doesn't adjust DECL_CONTEXT,
7035 so that such labels can be referenced from other regions.
7036 Make sure to update it when seeing a GIMPLE_LABEL though,
7037 that is the owner of the label. */
7038 walk_gimple_op (stmt
, move_stmt_op
, wi
);
7039 *handled_ops_p
= true;
7040 tree label
= gimple_label_label (as_a
<glabel
*> (stmt
));
7041 if (FORCED_LABEL (label
) || DECL_NONLOCAL (label
))
7042 DECL_CONTEXT (label
) = p
->to_context
;
7047 if (is_gimple_omp (stmt
))
7049 /* Do not remap variables inside OMP directives. Variables
7050 referenced in clauses and directive header belong to the
7051 parent function and should not be moved into the child
7053 bool save_remap_decls_p
= p
->remap_decls_p
;
7054 p
->remap_decls_p
= false;
7055 *handled_ops_p
= true;
7057 walk_gimple_seq_mod (gimple_omp_body_ptr (stmt
), move_stmt_r
,
7060 p
->remap_decls_p
= save_remap_decls_p
;
7068 /* Move basic block BB from function CFUN to function DEST_FN. The
7069 block is moved out of the original linked list and placed after
7070 block AFTER in the new list. Also, the block is removed from the
7071 original array of blocks and placed in DEST_FN's array of blocks.
7072 If UPDATE_EDGE_COUNT_P is true, the edge counts on both CFGs is
7073 updated to reflect the moved edges.
7075 The local variables are remapped to new instances, VARS_MAP is used
7076 to record the mapping. */
7079 move_block_to_fn (struct function
*dest_cfun
, basic_block bb
,
7080 basic_block after
, bool update_edge_count_p
,
7081 struct move_stmt_d
*d
)
7083 struct control_flow_graph
*cfg
;
7086 gimple_stmt_iterator si
;
7087 unsigned old_len
, new_len
;
7089 /* Remove BB from dominance structures. */
7090 delete_from_dominance_info (CDI_DOMINATORS
, bb
);
7092 /* Move BB from its current loop to the copy in the new function. */
7095 struct loop
*new_loop
= (struct loop
*)bb
->loop_father
->aux
;
7097 bb
->loop_father
= new_loop
;
7100 /* Link BB to the new linked list. */
7101 move_block_after (bb
, after
);
7103 /* Update the edge count in the corresponding flowgraphs. */
7104 if (update_edge_count_p
)
7105 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
7107 cfun
->cfg
->x_n_edges
--;
7108 dest_cfun
->cfg
->x_n_edges
++;
7111 /* Remove BB from the original basic block array. */
7112 (*cfun
->cfg
->x_basic_block_info
)[bb
->index
] = NULL
;
7113 cfun
->cfg
->x_n_basic_blocks
--;
7115 /* Grow DEST_CFUN's basic block array if needed. */
7116 cfg
= dest_cfun
->cfg
;
7117 cfg
->x_n_basic_blocks
++;
7118 if (bb
->index
>= cfg
->x_last_basic_block
)
7119 cfg
->x_last_basic_block
= bb
->index
+ 1;
7121 old_len
= vec_safe_length (cfg
->x_basic_block_info
);
7122 if ((unsigned) cfg
->x_last_basic_block
>= old_len
)
7124 new_len
= cfg
->x_last_basic_block
+ (cfg
->x_last_basic_block
+ 3) / 4;
7125 vec_safe_grow_cleared (cfg
->x_basic_block_info
, new_len
);
7128 (*cfg
->x_basic_block_info
)[bb
->index
] = bb
;
7130 /* Remap the variables in phi nodes. */
7131 for (gphi_iterator psi
= gsi_start_phis (bb
);
7134 gphi
*phi
= psi
.phi ();
7136 tree op
= PHI_RESULT (phi
);
7140 if (virtual_operand_p (op
))
7142 /* Remove the phi nodes for virtual operands (alias analysis will be
7143 run for the new function, anyway). */
7144 remove_phi_node (&psi
, true);
7148 SET_PHI_RESULT (phi
,
7149 replace_ssa_name (op
, d
->vars_map
, dest_cfun
->decl
));
7150 FOR_EACH_PHI_ARG (use
, phi
, oi
, SSA_OP_USE
)
7152 op
= USE_FROM_PTR (use
);
7153 if (TREE_CODE (op
) == SSA_NAME
)
7154 SET_USE (use
, replace_ssa_name (op
, d
->vars_map
, dest_cfun
->decl
));
7157 for (i
= 0; i
< EDGE_COUNT (bb
->preds
); i
++)
7159 location_t locus
= gimple_phi_arg_location (phi
, i
);
7160 tree block
= LOCATION_BLOCK (locus
);
7162 if (locus
== UNKNOWN_LOCATION
)
7164 if (d
->orig_block
== NULL_TREE
|| block
== d
->orig_block
)
7166 locus
= set_block (locus
, d
->new_block
);
7167 gimple_phi_arg_set_location (phi
, i
, locus
);
7174 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
7176 gimple
*stmt
= gsi_stmt (si
);
7177 struct walk_stmt_info wi
;
7179 memset (&wi
, 0, sizeof (wi
));
7181 walk_gimple_stmt (&si
, move_stmt_r
, move_stmt_op
, &wi
);
7183 if (glabel
*label_stmt
= dyn_cast
<glabel
*> (stmt
))
7185 tree label
= gimple_label_label (label_stmt
);
7186 int uid
= LABEL_DECL_UID (label
);
7188 gcc_assert (uid
> -1);
7190 old_len
= vec_safe_length (cfg
->x_label_to_block_map
);
7191 if (old_len
<= (unsigned) uid
)
7193 new_len
= 3 * uid
/ 2 + 1;
7194 vec_safe_grow_cleared (cfg
->x_label_to_block_map
, new_len
);
7197 (*cfg
->x_label_to_block_map
)[uid
] = bb
;
7198 (*cfun
->cfg
->x_label_to_block_map
)[uid
] = NULL
;
7200 gcc_assert (DECL_CONTEXT (label
) == dest_cfun
->decl
);
7202 if (uid
>= dest_cfun
->cfg
->last_label_uid
)
7203 dest_cfun
->cfg
->last_label_uid
= uid
+ 1;
7206 maybe_duplicate_eh_stmt_fn (dest_cfun
, stmt
, cfun
, stmt
, d
->eh_map
, 0);
7207 remove_stmt_from_eh_lp_fn (cfun
, stmt
);
7209 gimple_duplicate_stmt_histograms (dest_cfun
, stmt
, cfun
, stmt
);
7210 gimple_remove_stmt_histograms (cfun
, stmt
);
7212 /* We cannot leave any operands allocated from the operand caches of
7213 the current function. */
7214 free_stmt_operands (cfun
, stmt
);
7215 push_cfun (dest_cfun
);
7220 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
7221 if (e
->goto_locus
!= UNKNOWN_LOCATION
)
7223 tree block
= LOCATION_BLOCK (e
->goto_locus
);
7224 if (d
->orig_block
== NULL_TREE
7225 || block
== d
->orig_block
)
7226 e
->goto_locus
= set_block (e
->goto_locus
, d
->new_block
);
7230 /* Examine the statements in BB (which is in SRC_CFUN); find and return
7231 the outermost EH region. Use REGION as the incoming base EH region. */
7234 find_outermost_region_in_block (struct function
*src_cfun
,
7235 basic_block bb
, eh_region region
)
7237 gimple_stmt_iterator si
;
7239 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
7241 gimple
*stmt
= gsi_stmt (si
);
7242 eh_region stmt_region
;
7245 lp_nr
= lookup_stmt_eh_lp_fn (src_cfun
, stmt
);
7246 stmt_region
= get_eh_region_from_lp_number_fn (src_cfun
, lp_nr
);
7250 region
= stmt_region
;
7251 else if (stmt_region
!= region
)
7253 region
= eh_region_outermost (src_cfun
, stmt_region
, region
);
7254 gcc_assert (region
!= NULL
);
7263 new_label_mapper (tree decl
, void *data
)
7265 htab_t hash
= (htab_t
) data
;
7269 gcc_assert (TREE_CODE (decl
) == LABEL_DECL
);
7271 m
= XNEW (struct tree_map
);
7272 m
->hash
= DECL_UID (decl
);
7273 m
->base
.from
= decl
;
7274 m
->to
= create_artificial_label (UNKNOWN_LOCATION
);
7275 LABEL_DECL_UID (m
->to
) = LABEL_DECL_UID (decl
);
7276 if (LABEL_DECL_UID (m
->to
) >= cfun
->cfg
->last_label_uid
)
7277 cfun
->cfg
->last_label_uid
= LABEL_DECL_UID (m
->to
) + 1;
7279 slot
= htab_find_slot_with_hash (hash
, m
, m
->hash
, INSERT
);
7280 gcc_assert (*slot
== NULL
);
7287 /* Tree walker to replace the decls used inside value expressions by
7291 replace_block_vars_by_duplicates_1 (tree
*tp
, int *walk_subtrees
, void *data
)
7293 struct replace_decls_d
*rd
= (struct replace_decls_d
*)data
;
7295 switch (TREE_CODE (*tp
))
7300 replace_by_duplicate_decl (tp
, rd
->vars_map
, rd
->to_context
);
7306 if (IS_TYPE_OR_DECL_P (*tp
))
7307 *walk_subtrees
= false;
7312 /* Change DECL_CONTEXT of all BLOCK_VARS in block, including
7316 replace_block_vars_by_duplicates (tree block
, hash_map
<tree
, tree
> *vars_map
,
7321 for (tp
= &BLOCK_VARS (block
); *tp
; tp
= &DECL_CHAIN (*tp
))
7324 if (!VAR_P (t
) && TREE_CODE (t
) != CONST_DECL
)
7326 replace_by_duplicate_decl (&t
, vars_map
, to_context
);
7329 if (VAR_P (*tp
) && DECL_HAS_VALUE_EXPR_P (*tp
))
7331 tree x
= DECL_VALUE_EXPR (*tp
);
7332 struct replace_decls_d rd
= { vars_map
, to_context
};
7334 walk_tree (&x
, replace_block_vars_by_duplicates_1
, &rd
, NULL
);
7335 SET_DECL_VALUE_EXPR (t
, x
);
7336 DECL_HAS_VALUE_EXPR_P (t
) = 1;
7338 DECL_CHAIN (t
) = DECL_CHAIN (*tp
);
7343 for (block
= BLOCK_SUBBLOCKS (block
); block
; block
= BLOCK_CHAIN (block
))
7344 replace_block_vars_by_duplicates (block
, vars_map
, to_context
);
7347 /* Fixup the loop arrays and numbers after moving LOOP and its subloops
7351 fixup_loop_arrays_after_move (struct function
*fn1
, struct function
*fn2
,
7354 /* Discard it from the old loop array. */
7355 (*get_loops (fn1
))[loop
->num
] = NULL
;
7357 /* Place it in the new loop array, assigning it a new number. */
7358 loop
->num
= number_of_loops (fn2
);
7359 vec_safe_push (loops_for_fn (fn2
)->larray
, loop
);
7361 /* Recurse to children. */
7362 for (loop
= loop
->inner
; loop
; loop
= loop
->next
)
7363 fixup_loop_arrays_after_move (fn1
, fn2
, loop
);
7366 /* Verify that the blocks in BBS_P are a single-entry, single-exit region
7367 delimited by ENTRY_BB and EXIT_BB, possibly containing noreturn blocks. */
7370 verify_sese (basic_block entry
, basic_block exit
, vec
<basic_block
> *bbs_p
)
7375 bitmap bbs
= BITMAP_ALLOC (NULL
);
7378 gcc_assert (entry
!= NULL
);
7379 gcc_assert (entry
!= exit
);
7380 gcc_assert (bbs_p
!= NULL
);
7382 gcc_assert (bbs_p
->length () > 0);
7384 FOR_EACH_VEC_ELT (*bbs_p
, i
, bb
)
7385 bitmap_set_bit (bbs
, bb
->index
);
7387 gcc_assert (bitmap_bit_p (bbs
, entry
->index
));
7388 gcc_assert (exit
== NULL
|| bitmap_bit_p (bbs
, exit
->index
));
7390 FOR_EACH_VEC_ELT (*bbs_p
, i
, bb
)
7394 gcc_assert (single_pred_p (entry
));
7395 gcc_assert (!bitmap_bit_p (bbs
, single_pred (entry
)->index
));
7398 for (ei
= ei_start (bb
->preds
); !ei_end_p (ei
); ei_next (&ei
))
7401 gcc_assert (bitmap_bit_p (bbs
, e
->src
->index
));
7406 gcc_assert (single_succ_p (exit
));
7407 gcc_assert (!bitmap_bit_p (bbs
, single_succ (exit
)->index
));
7410 for (ei
= ei_start (bb
->succs
); !ei_end_p (ei
); ei_next (&ei
))
7413 gcc_assert (bitmap_bit_p (bbs
, e
->dest
->index
));
7420 /* If FROM is an SSA_NAME, mark the version in bitmap DATA. */
7423 gather_ssa_name_hash_map_from (tree
const &from
, tree
const &, void *data
)
7425 bitmap release_names
= (bitmap
)data
;
7427 if (TREE_CODE (from
) != SSA_NAME
)
7430 bitmap_set_bit (release_names
, SSA_NAME_VERSION (from
));
7434 /* Return LOOP_DIST_ALIAS call if present in BB. */
7437 find_loop_dist_alias (basic_block bb
)
7439 gimple
*g
= last_stmt (bb
);
7440 if (g
== NULL
|| gimple_code (g
) != GIMPLE_COND
)
7443 gimple_stmt_iterator gsi
= gsi_for_stmt (g
);
7445 if (gsi_end_p (gsi
))
7449 if (gimple_call_internal_p (g
, IFN_LOOP_DIST_ALIAS
))
7454 /* Fold loop internal call G like IFN_LOOP_VECTORIZED/IFN_LOOP_DIST_ALIAS
7455 to VALUE and update any immediate uses of it's LHS. */
7458 fold_loop_internal_call (gimple
*g
, tree value
)
7460 tree lhs
= gimple_call_lhs (g
);
7461 use_operand_p use_p
;
7462 imm_use_iterator iter
;
7464 gimple_stmt_iterator gsi
= gsi_for_stmt (g
);
7466 update_call_from_tree (&gsi
, value
);
7467 FOR_EACH_IMM_USE_STMT (use_stmt
, iter
, lhs
)
7469 FOR_EACH_IMM_USE_ON_STMT (use_p
, iter
)
7470 SET_USE (use_p
, value
);
7471 update_stmt (use_stmt
);
7475 /* Move a single-entry, single-exit region delimited by ENTRY_BB and
7476 EXIT_BB to function DEST_CFUN. The whole region is replaced by a
7477 single basic block in the original CFG and the new basic block is
7478 returned. DEST_CFUN must not have a CFG yet.
7480 Note that the region need not be a pure SESE region. Blocks inside
7481 the region may contain calls to abort/exit. The only restriction
7482 is that ENTRY_BB should be the only entry point and it must
7485 Change TREE_BLOCK of all statements in ORIG_BLOCK to the new
7486 functions outermost BLOCK, move all subblocks of ORIG_BLOCK
7487 to the new function.
7489 All local variables referenced in the region are assumed to be in
7490 the corresponding BLOCK_VARS and unexpanded variable lists
7491 associated with DEST_CFUN.
7493 TODO: investigate whether we can reuse gimple_duplicate_sese_region to
7494 reimplement move_sese_region_to_fn by duplicating the region rather than
7498 move_sese_region_to_fn (struct function
*dest_cfun
, basic_block entry_bb
,
7499 basic_block exit_bb
, tree orig_block
)
7501 vec
<basic_block
> bbs
, dom_bbs
;
7502 basic_block dom_entry
= get_immediate_dominator (CDI_DOMINATORS
, entry_bb
);
7503 basic_block after
, bb
, *entry_pred
, *exit_succ
, abb
;
7504 struct function
*saved_cfun
= cfun
;
7505 int *entry_flag
, *exit_flag
;
7506 profile_probability
*entry_prob
, *exit_prob
;
7507 unsigned i
, num_entry_edges
, num_exit_edges
, num_nodes
;
7510 htab_t new_label_map
;
7511 hash_map
<void *, void *> *eh_map
;
7512 struct loop
*loop
= entry_bb
->loop_father
;
7513 struct loop
*loop0
= get_loop (saved_cfun
, 0);
7514 struct move_stmt_d d
;
7516 /* If ENTRY does not strictly dominate EXIT, this cannot be an SESE
7518 gcc_assert (entry_bb
!= exit_bb
7520 || dominated_by_p (CDI_DOMINATORS
, exit_bb
, entry_bb
)));
7522 /* Collect all the blocks in the region. Manually add ENTRY_BB
7523 because it won't be added by dfs_enumerate_from. */
7525 bbs
.safe_push (entry_bb
);
7526 gather_blocks_in_sese_region (entry_bb
, exit_bb
, &bbs
);
7529 verify_sese (entry_bb
, exit_bb
, &bbs
);
7531 /* The blocks that used to be dominated by something in BBS will now be
7532 dominated by the new block. */
7533 dom_bbs
= get_dominated_by_region (CDI_DOMINATORS
,
7537 /* Detach ENTRY_BB and EXIT_BB from CFUN->CFG. We need to remember
7538 the predecessor edges to ENTRY_BB and the successor edges to
7539 EXIT_BB so that we can re-attach them to the new basic block that
7540 will replace the region. */
7541 num_entry_edges
= EDGE_COUNT (entry_bb
->preds
);
7542 entry_pred
= XNEWVEC (basic_block
, num_entry_edges
);
7543 entry_flag
= XNEWVEC (int, num_entry_edges
);
7544 entry_prob
= XNEWVEC (profile_probability
, num_entry_edges
);
7546 for (ei
= ei_start (entry_bb
->preds
); (e
= ei_safe_edge (ei
)) != NULL
;)
7548 entry_prob
[i
] = e
->probability
;
7549 entry_flag
[i
] = e
->flags
;
7550 entry_pred
[i
++] = e
->src
;
7556 num_exit_edges
= EDGE_COUNT (exit_bb
->succs
);
7557 exit_succ
= XNEWVEC (basic_block
, num_exit_edges
);
7558 exit_flag
= XNEWVEC (int, num_exit_edges
);
7559 exit_prob
= XNEWVEC (profile_probability
, num_exit_edges
);
7561 for (ei
= ei_start (exit_bb
->succs
); (e
= ei_safe_edge (ei
)) != NULL
;)
7563 exit_prob
[i
] = e
->probability
;
7564 exit_flag
[i
] = e
->flags
;
7565 exit_succ
[i
++] = e
->dest
;
7577 /* Switch context to the child function to initialize DEST_FN's CFG. */
7578 gcc_assert (dest_cfun
->cfg
== NULL
);
7579 push_cfun (dest_cfun
);
7581 init_empty_tree_cfg ();
7583 /* Initialize EH information for the new function. */
7585 new_label_map
= NULL
;
7588 eh_region region
= NULL
;
7590 FOR_EACH_VEC_ELT (bbs
, i
, bb
)
7591 region
= find_outermost_region_in_block (saved_cfun
, bb
, region
);
7593 init_eh_for_function ();
7596 new_label_map
= htab_create (17, tree_map_hash
, tree_map_eq
, free
);
7597 eh_map
= duplicate_eh_regions (saved_cfun
, region
, 0,
7598 new_label_mapper
, new_label_map
);
7602 /* Initialize an empty loop tree. */
7603 struct loops
*loops
= ggc_cleared_alloc
<struct loops
> ();
7604 init_loops_structure (dest_cfun
, loops
, 1);
7605 loops
->state
= LOOPS_MAY_HAVE_MULTIPLE_LATCHES
;
7606 set_loops_for_fn (dest_cfun
, loops
);
7608 vec
<loop_p
, va_gc
> *larray
= get_loops (saved_cfun
)->copy ();
7610 /* Move the outlined loop tree part. */
7611 num_nodes
= bbs
.length ();
7612 FOR_EACH_VEC_ELT (bbs
, i
, bb
)
7614 if (bb
->loop_father
->header
== bb
)
7616 struct loop
*this_loop
= bb
->loop_father
;
7617 struct loop
*outer
= loop_outer (this_loop
);
7619 /* If the SESE region contains some bbs ending with
7620 a noreturn call, those are considered to belong
7621 to the outermost loop in saved_cfun, rather than
7622 the entry_bb's loop_father. */
7626 num_nodes
-= this_loop
->num_nodes
;
7627 flow_loop_tree_node_remove (bb
->loop_father
);
7628 flow_loop_tree_node_add (get_loop (dest_cfun
, 0), this_loop
);
7629 fixup_loop_arrays_after_move (saved_cfun
, cfun
, this_loop
);
7632 else if (bb
->loop_father
== loop0
&& loop0
!= loop
)
7635 /* Remove loop exits from the outlined region. */
7636 if (loops_for_fn (saved_cfun
)->exits
)
7637 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
7639 struct loops
*l
= loops_for_fn (saved_cfun
);
7641 = l
->exits
->find_slot_with_hash (e
, htab_hash_pointer (e
),
7644 l
->exits
->clear_slot (slot
);
7648 /* Adjust the number of blocks in the tree root of the outlined part. */
7649 get_loop (dest_cfun
, 0)->num_nodes
= bbs
.length () + 2;
7651 /* Setup a mapping to be used by move_block_to_fn. */
7652 loop
->aux
= current_loops
->tree_root
;
7653 loop0
->aux
= current_loops
->tree_root
;
7655 /* Fix up orig_loop_num. If the block referenced in it has been moved
7656 to dest_cfun, update orig_loop_num field, otherwise clear it. */
7658 signed char *moved_orig_loop_num
= NULL
;
7659 FOR_EACH_LOOP_FN (dest_cfun
, dloop
, 0)
7660 if (dloop
->orig_loop_num
)
7662 if (moved_orig_loop_num
== NULL
)
7664 = XCNEWVEC (signed char, vec_safe_length (larray
));
7665 if ((*larray
)[dloop
->orig_loop_num
] != NULL
7666 && get_loop (saved_cfun
, dloop
->orig_loop_num
) == NULL
)
7668 if (moved_orig_loop_num
[dloop
->orig_loop_num
] >= 0
7669 && moved_orig_loop_num
[dloop
->orig_loop_num
] < 2)
7670 moved_orig_loop_num
[dloop
->orig_loop_num
]++;
7671 dloop
->orig_loop_num
= (*larray
)[dloop
->orig_loop_num
]->num
;
7675 moved_orig_loop_num
[dloop
->orig_loop_num
] = -1;
7676 dloop
->orig_loop_num
= 0;
7681 if (moved_orig_loop_num
)
7683 FOR_EACH_VEC_ELT (bbs
, i
, bb
)
7685 gimple
*g
= find_loop_dist_alias (bb
);
7689 int orig_loop_num
= tree_to_shwi (gimple_call_arg (g
, 0));
7690 gcc_assert (orig_loop_num
7691 && (unsigned) orig_loop_num
< vec_safe_length (larray
));
7692 if (moved_orig_loop_num
[orig_loop_num
] == 2)
7694 /* If we have moved both loops with this orig_loop_num into
7695 dest_cfun and the LOOP_DIST_ALIAS call is being moved there
7696 too, update the first argument. */
7697 gcc_assert ((*larray
)[dloop
->orig_loop_num
] != NULL
7698 && (get_loop (saved_cfun
, dloop
->orig_loop_num
)
7700 tree t
= build_int_cst (integer_type_node
,
7701 (*larray
)[dloop
->orig_loop_num
]->num
);
7702 gimple_call_set_arg (g
, 0, t
);
7704 /* Make sure the following loop will not update it. */
7705 moved_orig_loop_num
[orig_loop_num
] = 0;
7708 /* Otherwise at least one of the loops stayed in saved_cfun.
7709 Remove the LOOP_DIST_ALIAS call. */
7710 fold_loop_internal_call (g
, gimple_call_arg (g
, 1));
7712 FOR_EACH_BB_FN (bb
, saved_cfun
)
7714 gimple
*g
= find_loop_dist_alias (bb
);
7717 int orig_loop_num
= tree_to_shwi (gimple_call_arg (g
, 0));
7718 gcc_assert (orig_loop_num
7719 && (unsigned) orig_loop_num
< vec_safe_length (larray
));
7720 if (moved_orig_loop_num
[orig_loop_num
])
7721 /* LOOP_DIST_ALIAS call remained in saved_cfun, if at least one
7722 of the corresponding loops was moved, remove it. */
7723 fold_loop_internal_call (g
, gimple_call_arg (g
, 1));
7725 XDELETEVEC (moved_orig_loop_num
);
7729 /* Move blocks from BBS into DEST_CFUN. */
7730 gcc_assert (bbs
.length () >= 2);
7731 after
= dest_cfun
->cfg
->x_entry_block_ptr
;
7732 hash_map
<tree
, tree
> vars_map
;
7734 memset (&d
, 0, sizeof (d
));
7735 d
.orig_block
= orig_block
;
7736 d
.new_block
= DECL_INITIAL (dest_cfun
->decl
);
7737 d
.from_context
= cfun
->decl
;
7738 d
.to_context
= dest_cfun
->decl
;
7739 d
.vars_map
= &vars_map
;
7740 d
.new_label_map
= new_label_map
;
7742 d
.remap_decls_p
= true;
7744 if (gimple_in_ssa_p (cfun
))
7745 for (tree arg
= DECL_ARGUMENTS (d
.to_context
); arg
; arg
= DECL_CHAIN (arg
))
7747 tree narg
= make_ssa_name_fn (dest_cfun
, arg
, gimple_build_nop ());
7748 set_ssa_default_def (dest_cfun
, arg
, narg
);
7749 vars_map
.put (arg
, narg
);
7752 FOR_EACH_VEC_ELT (bbs
, i
, bb
)
7754 /* No need to update edge counts on the last block. It has
7755 already been updated earlier when we detached the region from
7756 the original CFG. */
7757 move_block_to_fn (dest_cfun
, bb
, after
, bb
!= exit_bb
, &d
);
7763 /* Loop sizes are no longer correct, fix them up. */
7764 loop
->num_nodes
-= num_nodes
;
7765 for (struct loop
*outer
= loop_outer (loop
);
7766 outer
; outer
= loop_outer (outer
))
7767 outer
->num_nodes
-= num_nodes
;
7768 loop0
->num_nodes
-= bbs
.length () - num_nodes
;
7770 if (saved_cfun
->has_simduid_loops
|| saved_cfun
->has_force_vectorize_loops
)
7773 for (i
= 0; vec_safe_iterate (loops
->larray
, i
, &aloop
); i
++)
7778 replace_by_duplicate_decl (&aloop
->simduid
, d
.vars_map
,
7780 dest_cfun
->has_simduid_loops
= true;
7782 if (aloop
->force_vectorize
)
7783 dest_cfun
->has_force_vectorize_loops
= true;
7787 /* Rewire BLOCK_SUBBLOCKS of orig_block. */
7791 gcc_assert (BLOCK_SUBBLOCKS (DECL_INITIAL (dest_cfun
->decl
))
7793 BLOCK_SUBBLOCKS (DECL_INITIAL (dest_cfun
->decl
))
7794 = BLOCK_SUBBLOCKS (orig_block
);
7795 for (block
= BLOCK_SUBBLOCKS (orig_block
);
7796 block
; block
= BLOCK_CHAIN (block
))
7797 BLOCK_SUPERCONTEXT (block
) = DECL_INITIAL (dest_cfun
->decl
);
7798 BLOCK_SUBBLOCKS (orig_block
) = NULL_TREE
;
7801 replace_block_vars_by_duplicates (DECL_INITIAL (dest_cfun
->decl
),
7802 &vars_map
, dest_cfun
->decl
);
7805 htab_delete (new_label_map
);
7809 if (gimple_in_ssa_p (cfun
))
7811 /* We need to release ssa-names in a defined order, so first find them,
7812 and then iterate in ascending version order. */
7813 bitmap release_names
= BITMAP_ALLOC (NULL
);
7814 vars_map
.traverse
<void *, gather_ssa_name_hash_map_from
> (release_names
);
7817 EXECUTE_IF_SET_IN_BITMAP (release_names
, 0, i
, bi
)
7818 release_ssa_name (ssa_name (i
));
7819 BITMAP_FREE (release_names
);
7822 /* Rewire the entry and exit blocks. The successor to the entry
7823 block turns into the successor of DEST_FN's ENTRY_BLOCK_PTR in
7824 the child function. Similarly, the predecessor of DEST_FN's
7825 EXIT_BLOCK_PTR turns into the predecessor of EXIT_BLOCK_PTR. We
7826 need to switch CFUN between DEST_CFUN and SAVED_CFUN so that the
7827 various CFG manipulation function get to the right CFG.
7829 FIXME, this is silly. The CFG ought to become a parameter to
7831 push_cfun (dest_cfun
);
7832 ENTRY_BLOCK_PTR_FOR_FN (cfun
)->count
= entry_bb
->count
;
7833 make_single_succ_edge (ENTRY_BLOCK_PTR_FOR_FN (cfun
), entry_bb
, EDGE_FALLTHRU
);
7836 make_single_succ_edge (exit_bb
, EXIT_BLOCK_PTR_FOR_FN (cfun
), 0);
7837 EXIT_BLOCK_PTR_FOR_FN (cfun
)->count
= exit_bb
->count
;
7840 EXIT_BLOCK_PTR_FOR_FN (cfun
)->count
= profile_count::zero ();
7843 /* Back in the original function, the SESE region has disappeared,
7844 create a new basic block in its place. */
7845 bb
= create_empty_bb (entry_pred
[0]);
7847 add_bb_to_loop (bb
, loop
);
7848 for (i
= 0; i
< num_entry_edges
; i
++)
7850 e
= make_edge (entry_pred
[i
], bb
, entry_flag
[i
]);
7851 e
->probability
= entry_prob
[i
];
7854 for (i
= 0; i
< num_exit_edges
; i
++)
7856 e
= make_edge (bb
, exit_succ
[i
], exit_flag
[i
]);
7857 e
->probability
= exit_prob
[i
];
7860 set_immediate_dominator (CDI_DOMINATORS
, bb
, dom_entry
);
7861 FOR_EACH_VEC_ELT (dom_bbs
, i
, abb
)
7862 set_immediate_dominator (CDI_DOMINATORS
, abb
, bb
);
7879 /* Dump default def DEF to file FILE using FLAGS and indentation
7883 dump_default_def (FILE *file
, tree def
, int spc
, dump_flags_t flags
)
7885 for (int i
= 0; i
< spc
; ++i
)
7886 fprintf (file
, " ");
7887 dump_ssaname_info_to_file (file
, def
, spc
);
7889 print_generic_expr (file
, TREE_TYPE (def
), flags
);
7890 fprintf (file
, " ");
7891 print_generic_expr (file
, def
, flags
);
7892 fprintf (file
, " = ");
7893 print_generic_expr (file
, SSA_NAME_VAR (def
), flags
);
7894 fprintf (file
, ";\n");
7897 /* Print no_sanitize attribute to FILE for a given attribute VALUE. */
7900 print_no_sanitize_attr_value (FILE *file
, tree value
)
7902 unsigned int flags
= tree_to_uhwi (value
);
7904 for (int i
= 0; sanitizer_opts
[i
].name
!= NULL
; ++i
)
7906 if ((sanitizer_opts
[i
].flag
& flags
) == sanitizer_opts
[i
].flag
)
7909 fprintf (file
, " | ");
7910 fprintf (file
, "%s", sanitizer_opts
[i
].name
);
7916 /* Dump FUNCTION_DECL FN to file FILE using FLAGS (see TDF_* in dumpfile.h)
7920 dump_function_to_file (tree fndecl
, FILE *file
, dump_flags_t flags
)
7922 tree arg
, var
, old_current_fndecl
= current_function_decl
;
7923 struct function
*dsf
;
7924 bool ignore_topmost_bind
= false, any_var
= false;
7927 bool tmclone
= (TREE_CODE (fndecl
) == FUNCTION_DECL
7928 && decl_is_tm_clone (fndecl
));
7929 struct function
*fun
= DECL_STRUCT_FUNCTION (fndecl
);
7931 if (DECL_ATTRIBUTES (fndecl
) != NULL_TREE
)
7933 fprintf (file
, "__attribute__((");
7937 for (chain
= DECL_ATTRIBUTES (fndecl
); chain
;
7938 first
= false, chain
= TREE_CHAIN (chain
))
7941 fprintf (file
, ", ");
7943 tree name
= get_attribute_name (chain
);
7944 print_generic_expr (file
, name
, dump_flags
);
7945 if (TREE_VALUE (chain
) != NULL_TREE
)
7947 fprintf (file
, " (");
7949 if (strstr (IDENTIFIER_POINTER (name
), "no_sanitize"))
7950 print_no_sanitize_attr_value (file
, TREE_VALUE (chain
));
7952 print_generic_expr (file
, TREE_VALUE (chain
), dump_flags
);
7953 fprintf (file
, ")");
7957 fprintf (file
, "))\n");
7960 current_function_decl
= fndecl
;
7961 if (flags
& TDF_GIMPLE
)
7963 print_generic_expr (file
, TREE_TYPE (TREE_TYPE (fndecl
)),
7964 dump_flags
| TDF_SLIM
);
7965 fprintf (file
, " __GIMPLE ()\n%s (", function_name (fun
));
7968 fprintf (file
, "%s %s(", function_name (fun
), tmclone
? "[tm-clone] " : "");
7970 arg
= DECL_ARGUMENTS (fndecl
);
7973 print_generic_expr (file
, TREE_TYPE (arg
), dump_flags
);
7974 fprintf (file
, " ");
7975 print_generic_expr (file
, arg
, dump_flags
);
7976 if (DECL_CHAIN (arg
))
7977 fprintf (file
, ", ");
7978 arg
= DECL_CHAIN (arg
);
7980 fprintf (file
, ")\n");
7982 dsf
= DECL_STRUCT_FUNCTION (fndecl
);
7983 if (dsf
&& (flags
& TDF_EH
))
7984 dump_eh_tree (file
, dsf
);
7986 if (flags
& TDF_RAW
&& !gimple_has_body_p (fndecl
))
7988 dump_node (fndecl
, TDF_SLIM
| flags
, file
);
7989 current_function_decl
= old_current_fndecl
;
7993 /* When GIMPLE is lowered, the variables are no longer available in
7994 BIND_EXPRs, so display them separately. */
7995 if (fun
&& fun
->decl
== fndecl
&& (fun
->curr_properties
& PROP_gimple_lcf
))
7998 ignore_topmost_bind
= true;
8000 fprintf (file
, "{\n");
8001 if (gimple_in_ssa_p (fun
)
8002 && (flags
& TDF_ALIAS
))
8004 for (arg
= DECL_ARGUMENTS (fndecl
); arg
!= NULL
;
8005 arg
= DECL_CHAIN (arg
))
8007 tree def
= ssa_default_def (fun
, arg
);
8009 dump_default_def (file
, def
, 2, flags
);
8012 tree res
= DECL_RESULT (fun
->decl
);
8013 if (res
!= NULL_TREE
8014 && DECL_BY_REFERENCE (res
))
8016 tree def
= ssa_default_def (fun
, res
);
8018 dump_default_def (file
, def
, 2, flags
);
8021 tree static_chain
= fun
->static_chain_decl
;
8022 if (static_chain
!= NULL_TREE
)
8024 tree def
= ssa_default_def (fun
, static_chain
);
8026 dump_default_def (file
, def
, 2, flags
);
8030 if (!vec_safe_is_empty (fun
->local_decls
))
8031 FOR_EACH_LOCAL_DECL (fun
, ix
, var
)
8033 print_generic_decl (file
, var
, flags
);
8034 fprintf (file
, "\n");
8041 if (gimple_in_ssa_p (cfun
))
8042 FOR_EACH_SSA_NAME (ix
, name
, cfun
)
8044 if (!SSA_NAME_VAR (name
))
8046 fprintf (file
, " ");
8047 print_generic_expr (file
, TREE_TYPE (name
), flags
);
8048 fprintf (file
, " ");
8049 print_generic_expr (file
, name
, flags
);
8050 fprintf (file
, ";\n");
8057 if (fun
&& fun
->decl
== fndecl
8059 && basic_block_info_for_fn (fun
))
8061 /* If the CFG has been built, emit a CFG-based dump. */
8062 if (!ignore_topmost_bind
)
8063 fprintf (file
, "{\n");
8065 if (any_var
&& n_basic_blocks_for_fn (fun
))
8066 fprintf (file
, "\n");
8068 FOR_EACH_BB_FN (bb
, fun
)
8069 dump_bb (file
, bb
, 2, flags
);
8071 fprintf (file
, "}\n");
8073 else if (fun
->curr_properties
& PROP_gimple_any
)
8075 /* The function is now in GIMPLE form but the CFG has not been
8076 built yet. Emit the single sequence of GIMPLE statements
8077 that make up its body. */
8078 gimple_seq body
= gimple_body (fndecl
);
8080 if (gimple_seq_first_stmt (body
)
8081 && gimple_seq_first_stmt (body
) == gimple_seq_last_stmt (body
)
8082 && gimple_code (gimple_seq_first_stmt (body
)) == GIMPLE_BIND
)
8083 print_gimple_seq (file
, body
, 0, flags
);
8086 if (!ignore_topmost_bind
)
8087 fprintf (file
, "{\n");
8090 fprintf (file
, "\n");
8092 print_gimple_seq (file
, body
, 2, flags
);
8093 fprintf (file
, "}\n");
8100 /* Make a tree based dump. */
8101 chain
= DECL_SAVED_TREE (fndecl
);
8102 if (chain
&& TREE_CODE (chain
) == BIND_EXPR
)
8104 if (ignore_topmost_bind
)
8106 chain
= BIND_EXPR_BODY (chain
);
8114 if (!ignore_topmost_bind
)
8116 fprintf (file
, "{\n");
8117 /* No topmost bind, pretend it's ignored for later. */
8118 ignore_topmost_bind
= true;
8124 fprintf (file
, "\n");
8126 print_generic_stmt_indented (file
, chain
, flags
, indent
);
8127 if (ignore_topmost_bind
)
8128 fprintf (file
, "}\n");
8131 if (flags
& TDF_ENUMERATE_LOCALS
)
8132 dump_enumerated_decls (file
, flags
);
8133 fprintf (file
, "\n\n");
8135 current_function_decl
= old_current_fndecl
;
8138 /* Dump FUNCTION_DECL FN to stderr using FLAGS (see TDF_* in tree.h) */
8141 debug_function (tree fn
, dump_flags_t flags
)
8143 dump_function_to_file (fn
, stderr
, flags
);
8147 /* Print on FILE the indexes for the predecessors of basic_block BB. */
8150 print_pred_bbs (FILE *file
, basic_block bb
)
8155 FOR_EACH_EDGE (e
, ei
, bb
->preds
)
8156 fprintf (file
, "bb_%d ", e
->src
->index
);
8160 /* Print on FILE the indexes for the successors of basic_block BB. */
8163 print_succ_bbs (FILE *file
, basic_block bb
)
8168 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
8169 fprintf (file
, "bb_%d ", e
->dest
->index
);
8172 /* Print to FILE the basic block BB following the VERBOSITY level. */
8175 print_loops_bb (FILE *file
, basic_block bb
, int indent
, int verbosity
)
8177 char *s_indent
= (char *) alloca ((size_t) indent
+ 1);
8178 memset ((void *) s_indent
, ' ', (size_t) indent
);
8179 s_indent
[indent
] = '\0';
8181 /* Print basic_block's header. */
8184 fprintf (file
, "%s bb_%d (preds = {", s_indent
, bb
->index
);
8185 print_pred_bbs (file
, bb
);
8186 fprintf (file
, "}, succs = {");
8187 print_succ_bbs (file
, bb
);
8188 fprintf (file
, "})\n");
8191 /* Print basic_block's body. */
8194 fprintf (file
, "%s {\n", s_indent
);
8195 dump_bb (file
, bb
, indent
+ 4, TDF_VOPS
|TDF_MEMSYMS
);
8196 fprintf (file
, "%s }\n", s_indent
);
8200 static void print_loop_and_siblings (FILE *, struct loop
*, int, int);
8202 /* Pretty print LOOP on FILE, indented INDENT spaces. Following
8203 VERBOSITY level this outputs the contents of the loop, or just its
8207 print_loop (FILE *file
, struct loop
*loop
, int indent
, int verbosity
)
8215 s_indent
= (char *) alloca ((size_t) indent
+ 1);
8216 memset ((void *) s_indent
, ' ', (size_t) indent
);
8217 s_indent
[indent
] = '\0';
8219 /* Print loop's header. */
8220 fprintf (file
, "%sloop_%d (", s_indent
, loop
->num
);
8222 fprintf (file
, "header = %d", loop
->header
->index
);
8225 fprintf (file
, "deleted)\n");
8229 fprintf (file
, ", latch = %d", loop
->latch
->index
);
8231 fprintf (file
, ", multiple latches");
8232 fprintf (file
, ", niter = ");
8233 print_generic_expr (file
, loop
->nb_iterations
);
8235 if (loop
->any_upper_bound
)
8237 fprintf (file
, ", upper_bound = ");
8238 print_decu (loop
->nb_iterations_upper_bound
, file
);
8240 if (loop
->any_likely_upper_bound
)
8242 fprintf (file
, ", likely_upper_bound = ");
8243 print_decu (loop
->nb_iterations_likely_upper_bound
, file
);
8246 if (loop
->any_estimate
)
8248 fprintf (file
, ", estimate = ");
8249 print_decu (loop
->nb_iterations_estimate
, file
);
8252 fprintf (file
, ", unroll = %d", loop
->unroll
);
8253 fprintf (file
, ")\n");
8255 /* Print loop's body. */
8258 fprintf (file
, "%s{\n", s_indent
);
8259 FOR_EACH_BB_FN (bb
, cfun
)
8260 if (bb
->loop_father
== loop
)
8261 print_loops_bb (file
, bb
, indent
, verbosity
);
8263 print_loop_and_siblings (file
, loop
->inner
, indent
+ 2, verbosity
);
8264 fprintf (file
, "%s}\n", s_indent
);
8268 /* Print the LOOP and its sibling loops on FILE, indented INDENT
8269 spaces. Following VERBOSITY level this outputs the contents of the
8270 loop, or just its structure. */
8273 print_loop_and_siblings (FILE *file
, struct loop
*loop
, int indent
,
8279 print_loop (file
, loop
, indent
, verbosity
);
8280 print_loop_and_siblings (file
, loop
->next
, indent
, verbosity
);
8283 /* Follow a CFG edge from the entry point of the program, and on entry
8284 of a loop, pretty print the loop structure on FILE. */
8287 print_loops (FILE *file
, int verbosity
)
8291 bb
= ENTRY_BLOCK_PTR_FOR_FN (cfun
);
8292 fprintf (file
, "\nLoops in function: %s\n", current_function_name ());
8293 if (bb
&& bb
->loop_father
)
8294 print_loop_and_siblings (file
, bb
->loop_father
, 0, verbosity
);
8300 debug (struct loop
&ref
)
8302 print_loop (stderr
, &ref
, 0, /*verbosity*/0);
8306 debug (struct loop
*ptr
)
8311 fprintf (stderr
, "<nil>\n");
8314 /* Dump a loop verbosely. */
8317 debug_verbose (struct loop
&ref
)
8319 print_loop (stderr
, &ref
, 0, /*verbosity*/3);
8323 debug_verbose (struct loop
*ptr
)
8328 fprintf (stderr
, "<nil>\n");
8332 /* Debugging loops structure at tree level, at some VERBOSITY level. */
8335 debug_loops (int verbosity
)
8337 print_loops (stderr
, verbosity
);
8340 /* Print on stderr the code of LOOP, at some VERBOSITY level. */
8343 debug_loop (struct loop
*loop
, int verbosity
)
8345 print_loop (stderr
, loop
, 0, verbosity
);
8348 /* Print on stderr the code of loop number NUM, at some VERBOSITY
8352 debug_loop_num (unsigned num
, int verbosity
)
8354 debug_loop (get_loop (cfun
, num
), verbosity
);
8357 /* Return true if BB ends with a call, possibly followed by some
8358 instructions that must stay with the call. Return false,
8362 gimple_block_ends_with_call_p (basic_block bb
)
8364 gimple_stmt_iterator gsi
= gsi_last_nondebug_bb (bb
);
8365 return !gsi_end_p (gsi
) && is_gimple_call (gsi_stmt (gsi
));
8369 /* Return true if BB ends with a conditional branch. Return false,
8373 gimple_block_ends_with_condjump_p (const_basic_block bb
)
8375 gimple
*stmt
= last_stmt (CONST_CAST_BB (bb
));
8376 return (stmt
&& gimple_code (stmt
) == GIMPLE_COND
);
8380 /* Return true if statement T may terminate execution of BB in ways not
8381 explicitly represtented in the CFG. */
8384 stmt_can_terminate_bb_p (gimple
*t
)
8386 tree fndecl
= NULL_TREE
;
8389 /* Eh exception not handled internally terminates execution of the whole
8391 if (stmt_can_throw_external (t
))
8394 /* NORETURN and LONGJMP calls already have an edge to exit.
8395 CONST and PURE calls do not need one.
8396 We don't currently check for CONST and PURE here, although
8397 it would be a good idea, because those attributes are
8398 figured out from the RTL in mark_constant_function, and
8399 the counter incrementation code from -fprofile-arcs
8400 leads to different results from -fbranch-probabilities. */
8401 if (is_gimple_call (t
))
8403 fndecl
= gimple_call_fndecl (t
);
8404 call_flags
= gimple_call_flags (t
);
8407 if (is_gimple_call (t
)
8409 && DECL_BUILT_IN (fndecl
)
8410 && (call_flags
& ECF_NOTHROW
)
8411 && !(call_flags
& ECF_RETURNS_TWICE
)
8412 /* fork() doesn't really return twice, but the effect of
8413 wrapping it in __gcov_fork() which calls __gcov_flush()
8414 and clears the counters before forking has the same
8415 effect as returning twice. Force a fake edge. */
8416 && !(DECL_BUILT_IN_CLASS (fndecl
) == BUILT_IN_NORMAL
8417 && DECL_FUNCTION_CODE (fndecl
) == BUILT_IN_FORK
))
8420 if (is_gimple_call (t
))
8426 if (call_flags
& (ECF_PURE
| ECF_CONST
)
8427 && !(call_flags
& ECF_LOOPING_CONST_OR_PURE
))
8430 /* Function call may do longjmp, terminate program or do other things.
8431 Special case noreturn that have non-abnormal edges out as in this case
8432 the fact is sufficiently represented by lack of edges out of T. */
8433 if (!(call_flags
& ECF_NORETURN
))
8437 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
8438 if ((e
->flags
& EDGE_FAKE
) == 0)
8442 if (gasm
*asm_stmt
= dyn_cast
<gasm
*> (t
))
8443 if (gimple_asm_volatile_p (asm_stmt
) || gimple_asm_input_p (asm_stmt
))
8450 /* Add fake edges to the function exit for any non constant and non
8451 noreturn calls (or noreturn calls with EH/abnormal edges),
8452 volatile inline assembly in the bitmap of blocks specified by BLOCKS
8453 or to the whole CFG if BLOCKS is zero. Return the number of blocks
8456 The goal is to expose cases in which entering a basic block does
8457 not imply that all subsequent instructions must be executed. */
8460 gimple_flow_call_edges_add (sbitmap blocks
)
8463 int blocks_split
= 0;
8464 int last_bb
= last_basic_block_for_fn (cfun
);
8465 bool check_last_block
= false;
8467 if (n_basic_blocks_for_fn (cfun
) == NUM_FIXED_BLOCKS
)
8471 check_last_block
= true;
8473 check_last_block
= bitmap_bit_p (blocks
,
8474 EXIT_BLOCK_PTR_FOR_FN (cfun
)->prev_bb
->index
);
8476 /* In the last basic block, before epilogue generation, there will be
8477 a fallthru edge to EXIT. Special care is required if the last insn
8478 of the last basic block is a call because make_edge folds duplicate
8479 edges, which would result in the fallthru edge also being marked
8480 fake, which would result in the fallthru edge being removed by
8481 remove_fake_edges, which would result in an invalid CFG.
8483 Moreover, we can't elide the outgoing fake edge, since the block
8484 profiler needs to take this into account in order to solve the minimal
8485 spanning tree in the case that the call doesn't return.
8487 Handle this by adding a dummy instruction in a new last basic block. */
8488 if (check_last_block
)
8490 basic_block bb
= EXIT_BLOCK_PTR_FOR_FN (cfun
)->prev_bb
;
8491 gimple_stmt_iterator gsi
= gsi_last_nondebug_bb (bb
);
8494 if (!gsi_end_p (gsi
))
8497 if (t
&& stmt_can_terminate_bb_p (t
))
8501 e
= find_edge (bb
, EXIT_BLOCK_PTR_FOR_FN (cfun
));
8504 gsi_insert_on_edge (e
, gimple_build_nop ());
8505 gsi_commit_edge_inserts ();
8510 /* Now add fake edges to the function exit for any non constant
8511 calls since there is no way that we can determine if they will
8513 for (i
= 0; i
< last_bb
; i
++)
8515 basic_block bb
= BASIC_BLOCK_FOR_FN (cfun
, i
);
8516 gimple_stmt_iterator gsi
;
8517 gimple
*stmt
, *last_stmt
;
8522 if (blocks
&& !bitmap_bit_p (blocks
, i
))
8525 gsi
= gsi_last_nondebug_bb (bb
);
8526 if (!gsi_end_p (gsi
))
8528 last_stmt
= gsi_stmt (gsi
);
8531 stmt
= gsi_stmt (gsi
);
8532 if (stmt_can_terminate_bb_p (stmt
))
8536 /* The handling above of the final block before the
8537 epilogue should be enough to verify that there is
8538 no edge to the exit block in CFG already.
8539 Calling make_edge in such case would cause us to
8540 mark that edge as fake and remove it later. */
8541 if (flag_checking
&& stmt
== last_stmt
)
8543 e
= find_edge (bb
, EXIT_BLOCK_PTR_FOR_FN (cfun
));
8544 gcc_assert (e
== NULL
);
8547 /* Note that the following may create a new basic block
8548 and renumber the existing basic blocks. */
8549 if (stmt
!= last_stmt
)
8551 e
= split_block (bb
, stmt
);
8555 e
= make_edge (bb
, EXIT_BLOCK_PTR_FOR_FN (cfun
), EDGE_FAKE
);
8556 e
->probability
= profile_probability::guessed_never ();
8560 while (!gsi_end_p (gsi
));
8565 checking_verify_flow_info ();
8567 return blocks_split
;
8570 /* Removes edge E and all the blocks dominated by it, and updates dominance
8571 information. The IL in E->src needs to be updated separately.
8572 If dominance info is not available, only the edge E is removed.*/
8575 remove_edge_and_dominated_blocks (edge e
)
8577 vec
<basic_block
> bbs_to_remove
= vNULL
;
8578 vec
<basic_block
> bbs_to_fix_dom
= vNULL
;
8581 bool none_removed
= false;
8583 basic_block bb
, dbb
;
8586 /* If we are removing a path inside a non-root loop that may change
8587 loop ownership of blocks or remove loops. Mark loops for fixup. */
8589 && loop_outer (e
->src
->loop_father
) != NULL
8590 && e
->src
->loop_father
== e
->dest
->loop_father
)
8591 loops_state_set (LOOPS_NEED_FIXUP
);
8593 if (!dom_info_available_p (CDI_DOMINATORS
))
8599 /* No updating is needed for edges to exit. */
8600 if (e
->dest
== EXIT_BLOCK_PTR_FOR_FN (cfun
))
8602 if (cfgcleanup_altered_bbs
)
8603 bitmap_set_bit (cfgcleanup_altered_bbs
, e
->src
->index
);
8608 /* First, we find the basic blocks to remove. If E->dest has a predecessor
8609 that is not dominated by E->dest, then this set is empty. Otherwise,
8610 all the basic blocks dominated by E->dest are removed.
8612 Also, to DF_IDOM we store the immediate dominators of the blocks in
8613 the dominance frontier of E (i.e., of the successors of the
8614 removed blocks, if there are any, and of E->dest otherwise). */
8615 FOR_EACH_EDGE (f
, ei
, e
->dest
->preds
)
8620 if (!dominated_by_p (CDI_DOMINATORS
, f
->src
, e
->dest
))
8622 none_removed
= true;
8627 auto_bitmap df
, df_idom
;
8629 bitmap_set_bit (df_idom
,
8630 get_immediate_dominator (CDI_DOMINATORS
, e
->dest
)->index
);
8633 bbs_to_remove
= get_all_dominated_blocks (CDI_DOMINATORS
, e
->dest
);
8634 FOR_EACH_VEC_ELT (bbs_to_remove
, i
, bb
)
8636 FOR_EACH_EDGE (f
, ei
, bb
->succs
)
8638 if (f
->dest
!= EXIT_BLOCK_PTR_FOR_FN (cfun
))
8639 bitmap_set_bit (df
, f
->dest
->index
);
8642 FOR_EACH_VEC_ELT (bbs_to_remove
, i
, bb
)
8643 bitmap_clear_bit (df
, bb
->index
);
8645 EXECUTE_IF_SET_IN_BITMAP (df
, 0, i
, bi
)
8647 bb
= BASIC_BLOCK_FOR_FN (cfun
, i
);
8648 bitmap_set_bit (df_idom
,
8649 get_immediate_dominator (CDI_DOMINATORS
, bb
)->index
);
8653 if (cfgcleanup_altered_bbs
)
8655 /* Record the set of the altered basic blocks. */
8656 bitmap_set_bit (cfgcleanup_altered_bbs
, e
->src
->index
);
8657 bitmap_ior_into (cfgcleanup_altered_bbs
, df
);
8660 /* Remove E and the cancelled blocks. */
8665 /* Walk backwards so as to get a chance to substitute all
8666 released DEFs into debug stmts. See
8667 eliminate_unnecessary_stmts() in tree-ssa-dce.c for more
8669 for (i
= bbs_to_remove
.length (); i
-- > 0; )
8670 delete_basic_block (bbs_to_remove
[i
]);
8673 /* Update the dominance information. The immediate dominator may change only
8674 for blocks whose immediate dominator belongs to DF_IDOM:
8676 Suppose that idom(X) = Y before removal of E and idom(X) != Y after the
8677 removal. Let Z the arbitrary block such that idom(Z) = Y and
8678 Z dominates X after the removal. Before removal, there exists a path P
8679 from Y to X that avoids Z. Let F be the last edge on P that is
8680 removed, and let W = F->dest. Before removal, idom(W) = Y (since Y
8681 dominates W, and because of P, Z does not dominate W), and W belongs to
8682 the dominance frontier of E. Therefore, Y belongs to DF_IDOM. */
8683 EXECUTE_IF_SET_IN_BITMAP (df_idom
, 0, i
, bi
)
8685 bb
= BASIC_BLOCK_FOR_FN (cfun
, i
);
8686 for (dbb
= first_dom_son (CDI_DOMINATORS
, bb
);
8688 dbb
= next_dom_son (CDI_DOMINATORS
, dbb
))
8689 bbs_to_fix_dom
.safe_push (dbb
);
8692 iterate_fix_dominators (CDI_DOMINATORS
, bbs_to_fix_dom
, true);
8694 bbs_to_remove
.release ();
8695 bbs_to_fix_dom
.release ();
8698 /* Purge dead EH edges from basic block BB. */
8701 gimple_purge_dead_eh_edges (basic_block bb
)
8703 bool changed
= false;
8706 gimple
*stmt
= last_stmt (bb
);
8708 if (stmt
&& stmt_can_throw_internal (stmt
))
8711 for (ei
= ei_start (bb
->succs
); (e
= ei_safe_edge (ei
)); )
8713 if (e
->flags
& EDGE_EH
)
8715 remove_edge_and_dominated_blocks (e
);
8725 /* Purge dead EH edges from basic block listed in BLOCKS. */
8728 gimple_purge_all_dead_eh_edges (const_bitmap blocks
)
8730 bool changed
= false;
8734 EXECUTE_IF_SET_IN_BITMAP (blocks
, 0, i
, bi
)
8736 basic_block bb
= BASIC_BLOCK_FOR_FN (cfun
, i
);
8738 /* Earlier gimple_purge_dead_eh_edges could have removed
8739 this basic block already. */
8740 gcc_assert (bb
|| changed
);
8742 changed
|= gimple_purge_dead_eh_edges (bb
);
8748 /* Purge dead abnormal call edges from basic block BB. */
8751 gimple_purge_dead_abnormal_call_edges (basic_block bb
)
8753 bool changed
= false;
8756 gimple
*stmt
= last_stmt (bb
);
8758 if (!cfun
->has_nonlocal_label
8759 && !cfun
->calls_setjmp
)
8762 if (stmt
&& stmt_can_make_abnormal_goto (stmt
))
8765 for (ei
= ei_start (bb
->succs
); (e
= ei_safe_edge (ei
)); )
8767 if (e
->flags
& EDGE_ABNORMAL
)
8769 if (e
->flags
& EDGE_FALLTHRU
)
8770 e
->flags
&= ~EDGE_ABNORMAL
;
8772 remove_edge_and_dominated_blocks (e
);
8782 /* Purge dead abnormal call edges from basic block listed in BLOCKS. */
8785 gimple_purge_all_dead_abnormal_call_edges (const_bitmap blocks
)
8787 bool changed
= false;
8791 EXECUTE_IF_SET_IN_BITMAP (blocks
, 0, i
, bi
)
8793 basic_block bb
= BASIC_BLOCK_FOR_FN (cfun
, i
);
8795 /* Earlier gimple_purge_dead_abnormal_call_edges could have removed
8796 this basic block already. */
8797 gcc_assert (bb
|| changed
);
8799 changed
|= gimple_purge_dead_abnormal_call_edges (bb
);
8805 /* This function is called whenever a new edge is created or
8809 gimple_execute_on_growing_pred (edge e
)
8811 basic_block bb
= e
->dest
;
8813 if (!gimple_seq_empty_p (phi_nodes (bb
)))
8814 reserve_phi_args_for_new_edge (bb
);
8817 /* This function is called immediately before edge E is removed from
8818 the edge vector E->dest->preds. */
8821 gimple_execute_on_shrinking_pred (edge e
)
8823 if (!gimple_seq_empty_p (phi_nodes (e
->dest
)))
8824 remove_phi_args (e
);
8827 /*---------------------------------------------------------------------------
8828 Helper functions for Loop versioning
8829 ---------------------------------------------------------------------------*/
8831 /* Adjust phi nodes for 'first' basic block. 'second' basic block is a copy
8832 of 'first'. Both of them are dominated by 'new_head' basic block. When
8833 'new_head' was created by 'second's incoming edge it received phi arguments
8834 on the edge by split_edge(). Later, additional edge 'e' was created to
8835 connect 'new_head' and 'first'. Now this routine adds phi args on this
8836 additional edge 'e' that new_head to second edge received as part of edge
8840 gimple_lv_adjust_loop_header_phi (basic_block first
, basic_block second
,
8841 basic_block new_head
, edge e
)
8844 gphi_iterator psi1
, psi2
;
8846 edge e2
= find_edge (new_head
, second
);
8848 /* Because NEW_HEAD has been created by splitting SECOND's incoming
8849 edge, we should always have an edge from NEW_HEAD to SECOND. */
8850 gcc_assert (e2
!= NULL
);
8852 /* Browse all 'second' basic block phi nodes and add phi args to
8853 edge 'e' for 'first' head. PHI args are always in correct order. */
8855 for (psi2
= gsi_start_phis (second
),
8856 psi1
= gsi_start_phis (first
);
8857 !gsi_end_p (psi2
) && !gsi_end_p (psi1
);
8858 gsi_next (&psi2
), gsi_next (&psi1
))
8862 def
= PHI_ARG_DEF (phi2
, e2
->dest_idx
);
8863 add_phi_arg (phi1
, def
, e
, gimple_phi_arg_location_from_edge (phi2
, e2
));
8868 /* Adds a if else statement to COND_BB with condition COND_EXPR.
8869 SECOND_HEAD is the destination of the THEN and FIRST_HEAD is
8870 the destination of the ELSE part. */
8873 gimple_lv_add_condition_to_bb (basic_block first_head ATTRIBUTE_UNUSED
,
8874 basic_block second_head ATTRIBUTE_UNUSED
,
8875 basic_block cond_bb
, void *cond_e
)
8877 gimple_stmt_iterator gsi
;
8878 gimple
*new_cond_expr
;
8879 tree cond_expr
= (tree
) cond_e
;
8882 /* Build new conditional expr */
8883 new_cond_expr
= gimple_build_cond_from_tree (cond_expr
,
8884 NULL_TREE
, NULL_TREE
);
8886 /* Add new cond in cond_bb. */
8887 gsi
= gsi_last_bb (cond_bb
);
8888 gsi_insert_after (&gsi
, new_cond_expr
, GSI_NEW_STMT
);
8890 /* Adjust edges appropriately to connect new head with first head
8891 as well as second head. */
8892 e0
= single_succ_edge (cond_bb
);
8893 e0
->flags
&= ~EDGE_FALLTHRU
;
8894 e0
->flags
|= EDGE_FALSE_VALUE
;
8898 /* Do book-keeping of basic block BB for the profile consistency checker.
8899 If AFTER_PASS is 0, do pre-pass accounting, or if AFTER_PASS is 1
8900 then do post-pass accounting. Store the counting in RECORD. */
8902 gimple_account_profile_record (basic_block bb
, int after_pass
,
8903 struct profile_record
*record
)
8905 gimple_stmt_iterator i
;
8906 for (i
= gsi_start_bb (bb
); !gsi_end_p (i
); gsi_next (&i
))
8908 record
->size
[after_pass
]
8909 += estimate_num_insns (gsi_stmt (i
), &eni_size_weights
);
8910 if (bb
->count
.initialized_p ())
8911 record
->time
[after_pass
]
8912 += estimate_num_insns (gsi_stmt (i
),
8913 &eni_time_weights
) * bb
->count
.to_gcov_type ();
8914 else if (profile_status_for_fn (cfun
) == PROFILE_GUESSED
)
8915 record
->time
[after_pass
]
8916 += estimate_num_insns (gsi_stmt (i
),
8917 &eni_time_weights
) * bb
->count
.to_frequency (cfun
);
8921 struct cfg_hooks gimple_cfg_hooks
= {
8923 gimple_verify_flow_info
,
8924 gimple_dump_bb
, /* dump_bb */
8925 gimple_dump_bb_for_graph
, /* dump_bb_for_graph */
8926 create_bb
, /* create_basic_block */
8927 gimple_redirect_edge_and_branch
, /* redirect_edge_and_branch */
8928 gimple_redirect_edge_and_branch_force
, /* redirect_edge_and_branch_force */
8929 gimple_can_remove_branch_p
, /* can_remove_branch_p */
8930 remove_bb
, /* delete_basic_block */
8931 gimple_split_block
, /* split_block */
8932 gimple_move_block_after
, /* move_block_after */
8933 gimple_can_merge_blocks_p
, /* can_merge_blocks_p */
8934 gimple_merge_blocks
, /* merge_blocks */
8935 gimple_predict_edge
, /* predict_edge */
8936 gimple_predicted_by_p
, /* predicted_by_p */
8937 gimple_can_duplicate_bb_p
, /* can_duplicate_block_p */
8938 gimple_duplicate_bb
, /* duplicate_block */
8939 gimple_split_edge
, /* split_edge */
8940 gimple_make_forwarder_block
, /* make_forward_block */
8941 NULL
, /* tidy_fallthru_edge */
8942 NULL
, /* force_nonfallthru */
8943 gimple_block_ends_with_call_p
,/* block_ends_with_call_p */
8944 gimple_block_ends_with_condjump_p
, /* block_ends_with_condjump_p */
8945 gimple_flow_call_edges_add
, /* flow_call_edges_add */
8946 gimple_execute_on_growing_pred
, /* execute_on_growing_pred */
8947 gimple_execute_on_shrinking_pred
, /* execute_on_shrinking_pred */
8948 gimple_duplicate_loop_to_header_edge
, /* duplicate loop for trees */
8949 gimple_lv_add_condition_to_bb
, /* lv_add_condition_to_bb */
8950 gimple_lv_adjust_loop_header_phi
, /* lv_adjust_loop_header_phi*/
8951 extract_true_false_edges_from_block
, /* extract_cond_bb_edges */
8952 flush_pending_stmts
, /* flush_pending_stmts */
8953 gimple_empty_block_p
, /* block_empty_p */
8954 gimple_split_block_before_cond_jump
, /* split_block_before_cond_jump */
8955 gimple_account_profile_record
,
8959 /* Split all critical edges. */
8962 split_critical_edges (void)
8968 /* split_edge can redirect edges out of SWITCH_EXPRs, which can get
8969 expensive. So we want to enable recording of edge to CASE_LABEL_EXPR
8970 mappings around the calls to split_edge. */
8971 start_recording_case_labels ();
8972 FOR_ALL_BB_FN (bb
, cfun
)
8974 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
8976 if (EDGE_CRITICAL_P (e
) && !(e
->flags
& EDGE_ABNORMAL
))
8978 /* PRE inserts statements to edges and expects that
8979 since split_critical_edges was done beforehand, committing edge
8980 insertions will not split more edges. In addition to critical
8981 edges we must split edges that have multiple successors and
8982 end by control flow statements, such as RESX.
8983 Go ahead and split them too. This matches the logic in
8984 gimple_find_edge_insert_loc. */
8985 else if ((!single_pred_p (e
->dest
)
8986 || !gimple_seq_empty_p (phi_nodes (e
->dest
))
8987 || e
->dest
== EXIT_BLOCK_PTR_FOR_FN (cfun
))
8988 && e
->src
!= ENTRY_BLOCK_PTR_FOR_FN (cfun
)
8989 && !(e
->flags
& EDGE_ABNORMAL
))
8991 gimple_stmt_iterator gsi
;
8993 gsi
= gsi_last_bb (e
->src
);
8994 if (!gsi_end_p (gsi
)
8995 && stmt_ends_bb_p (gsi_stmt (gsi
))
8996 && (gimple_code (gsi_stmt (gsi
)) != GIMPLE_RETURN
8997 && !gimple_call_builtin_p (gsi_stmt (gsi
),
9003 end_recording_case_labels ();
9009 const pass_data pass_data_split_crit_edges
=
9011 GIMPLE_PASS
, /* type */
9012 "crited", /* name */
9013 OPTGROUP_NONE
, /* optinfo_flags */
9014 TV_TREE_SPLIT_EDGES
, /* tv_id */
9015 PROP_cfg
, /* properties_required */
9016 PROP_no_crit_edges
, /* properties_provided */
9017 0, /* properties_destroyed */
9018 0, /* todo_flags_start */
9019 0, /* todo_flags_finish */
9022 class pass_split_crit_edges
: public gimple_opt_pass
9025 pass_split_crit_edges (gcc::context
*ctxt
)
9026 : gimple_opt_pass (pass_data_split_crit_edges
, ctxt
)
9029 /* opt_pass methods: */
9030 virtual unsigned int execute (function
*) { return split_critical_edges (); }
9032 opt_pass
* clone () { return new pass_split_crit_edges (m_ctxt
); }
9033 }; // class pass_split_crit_edges
9038 make_pass_split_crit_edges (gcc::context
*ctxt
)
9040 return new pass_split_crit_edges (ctxt
);
9044 /* Insert COND expression which is GIMPLE_COND after STMT
9045 in basic block BB with appropriate basic block split
9046 and creation of a new conditionally executed basic block.
9047 Update profile so the new bb is visited with probability PROB.
9048 Return created basic block. */
9050 insert_cond_bb (basic_block bb
, gimple
*stmt
, gimple
*cond
,
9051 profile_probability prob
)
9053 edge fall
= split_block (bb
, stmt
);
9054 gimple_stmt_iterator iter
= gsi_last_bb (bb
);
9057 /* Insert cond statement. */
9058 gcc_assert (gimple_code (cond
) == GIMPLE_COND
);
9059 if (gsi_end_p (iter
))
9060 gsi_insert_before (&iter
, cond
, GSI_CONTINUE_LINKING
);
9062 gsi_insert_after (&iter
, cond
, GSI_CONTINUE_LINKING
);
9064 /* Create conditionally executed block. */
9065 new_bb
= create_empty_bb (bb
);
9066 edge e
= make_edge (bb
, new_bb
, EDGE_TRUE_VALUE
);
9067 e
->probability
= prob
;
9068 new_bb
->count
= e
->count ();
9069 make_single_succ_edge (new_bb
, fall
->dest
, EDGE_FALLTHRU
);
9071 /* Fix edge for split bb. */
9072 fall
->flags
= EDGE_FALSE_VALUE
;
9073 fall
->probability
-= e
->probability
;
9075 /* Update dominance info. */
9076 if (dom_info_available_p (CDI_DOMINATORS
))
9078 set_immediate_dominator (CDI_DOMINATORS
, new_bb
, bb
);
9079 set_immediate_dominator (CDI_DOMINATORS
, fall
->dest
, bb
);
9082 /* Update loop info. */
9084 add_bb_to_loop (new_bb
, bb
->loop_father
);
9089 /* Build a ternary operation and gimplify it. Emit code before GSI.
9090 Return the gimple_val holding the result. */
9093 gimplify_build3 (gimple_stmt_iterator
*gsi
, enum tree_code code
,
9094 tree type
, tree a
, tree b
, tree c
)
9097 location_t loc
= gimple_location (gsi_stmt (*gsi
));
9099 ret
= fold_build3_loc (loc
, code
, type
, a
, b
, c
);
9102 return force_gimple_operand_gsi (gsi
, ret
, true, NULL
, true,
9106 /* Build a binary operation and gimplify it. Emit code before GSI.
9107 Return the gimple_val holding the result. */
9110 gimplify_build2 (gimple_stmt_iterator
*gsi
, enum tree_code code
,
9111 tree type
, tree a
, tree b
)
9115 ret
= fold_build2_loc (gimple_location (gsi_stmt (*gsi
)), code
, type
, a
, b
);
9118 return force_gimple_operand_gsi (gsi
, ret
, true, NULL
, true,
9122 /* Build a unary operation and gimplify it. Emit code before GSI.
9123 Return the gimple_val holding the result. */
9126 gimplify_build1 (gimple_stmt_iterator
*gsi
, enum tree_code code
, tree type
,
9131 ret
= fold_build1_loc (gimple_location (gsi_stmt (*gsi
)), code
, type
, a
);
9134 return force_gimple_operand_gsi (gsi
, ret
, true, NULL
, true,
9140 /* Given a basic block B which ends with a conditional and has
9141 precisely two successors, determine which of the edges is taken if
9142 the conditional is true and which is taken if the conditional is
9143 false. Set TRUE_EDGE and FALSE_EDGE appropriately. */
9146 extract_true_false_edges_from_block (basic_block b
,
9150 edge e
= EDGE_SUCC (b
, 0);
9152 if (e
->flags
& EDGE_TRUE_VALUE
)
9155 *false_edge
= EDGE_SUCC (b
, 1);
9160 *true_edge
= EDGE_SUCC (b
, 1);
9165 /* From a controlling predicate in the immediate dominator DOM of
9166 PHIBLOCK determine the edges into PHIBLOCK that are chosen if the
9167 predicate evaluates to true and false and store them to
9168 *TRUE_CONTROLLED_EDGE and *FALSE_CONTROLLED_EDGE if
9169 they are non-NULL. Returns true if the edges can be determined,
9170 else return false. */
9173 extract_true_false_controlled_edges (basic_block dom
, basic_block phiblock
,
9174 edge
*true_controlled_edge
,
9175 edge
*false_controlled_edge
)
9177 basic_block bb
= phiblock
;
9178 edge true_edge
, false_edge
, tem
;
9179 edge e0
= NULL
, e1
= NULL
;
9181 /* We have to verify that one edge into the PHI node is dominated
9182 by the true edge of the predicate block and the other edge
9183 dominated by the false edge. This ensures that the PHI argument
9184 we are going to take is completely determined by the path we
9185 take from the predicate block.
9186 We can only use BB dominance checks below if the destination of
9187 the true/false edges are dominated by their edge, thus only
9188 have a single predecessor. */
9189 extract_true_false_edges_from_block (dom
, &true_edge
, &false_edge
);
9190 tem
= EDGE_PRED (bb
, 0);
9191 if (tem
== true_edge
9192 || (single_pred_p (true_edge
->dest
)
9193 && (tem
->src
== true_edge
->dest
9194 || dominated_by_p (CDI_DOMINATORS
,
9195 tem
->src
, true_edge
->dest
))))
9197 else if (tem
== false_edge
9198 || (single_pred_p (false_edge
->dest
)
9199 && (tem
->src
== false_edge
->dest
9200 || dominated_by_p (CDI_DOMINATORS
,
9201 tem
->src
, false_edge
->dest
))))
9205 tem
= EDGE_PRED (bb
, 1);
9206 if (tem
== true_edge
9207 || (single_pred_p (true_edge
->dest
)
9208 && (tem
->src
== true_edge
->dest
9209 || dominated_by_p (CDI_DOMINATORS
,
9210 tem
->src
, true_edge
->dest
))))
9212 else if (tem
== false_edge
9213 || (single_pred_p (false_edge
->dest
)
9214 && (tem
->src
== false_edge
->dest
9215 || dominated_by_p (CDI_DOMINATORS
,
9216 tem
->src
, false_edge
->dest
))))
9223 if (true_controlled_edge
)
9224 *true_controlled_edge
= e0
;
9225 if (false_controlled_edge
)
9226 *false_controlled_edge
= e1
;
9231 /* Generate a range test LHS CODE RHS that determines whether INDEX is in the
9232 range [low, high]. Place associated stmts before *GSI. */
9235 generate_range_test (basic_block bb
, tree index
, tree low
, tree high
,
9236 tree
*lhs
, tree
*rhs
)
9238 tree type
= TREE_TYPE (index
);
9239 tree utype
= unsigned_type_for (type
);
9241 low
= fold_convert (type
, low
);
9242 high
= fold_convert (type
, high
);
9244 tree tmp
= make_ssa_name (type
);
9246 = gimple_build_assign (tmp
, MINUS_EXPR
, index
, low
);
9248 *lhs
= make_ssa_name (utype
);
9249 gassign
*a
= gimple_build_assign (*lhs
, NOP_EXPR
, tmp
);
9251 *rhs
= fold_build2 (MINUS_EXPR
, utype
, high
, low
);
9252 gimple_stmt_iterator gsi
= gsi_last_bb (bb
);
9253 gsi_insert_before (&gsi
, sub1
, GSI_SAME_STMT
);
9254 gsi_insert_before (&gsi
, a
, GSI_SAME_STMT
);
9257 /* Emit return warnings. */
9261 const pass_data pass_data_warn_function_return
=
9263 GIMPLE_PASS
, /* type */
9264 "*warn_function_return", /* name */
9265 OPTGROUP_NONE
, /* optinfo_flags */
9266 TV_NONE
, /* tv_id */
9267 PROP_cfg
, /* properties_required */
9268 0, /* properties_provided */
9269 0, /* properties_destroyed */
9270 0, /* todo_flags_start */
9271 0, /* todo_flags_finish */
9274 class pass_warn_function_return
: public gimple_opt_pass
9277 pass_warn_function_return (gcc::context
*ctxt
)
9278 : gimple_opt_pass (pass_data_warn_function_return
, ctxt
)
9281 /* opt_pass methods: */
9282 virtual unsigned int execute (function
*);
9284 }; // class pass_warn_function_return
9287 pass_warn_function_return::execute (function
*fun
)
9289 source_location location
;
9294 if (!targetm
.warn_func_return (fun
->decl
))
9297 /* If we have a path to EXIT, then we do return. */
9298 if (TREE_THIS_VOLATILE (fun
->decl
)
9299 && EDGE_COUNT (EXIT_BLOCK_PTR_FOR_FN (fun
)->preds
) > 0)
9301 location
= UNKNOWN_LOCATION
;
9302 for (ei
= ei_start (EXIT_BLOCK_PTR_FOR_FN (fun
)->preds
);
9303 (e
= ei_safe_edge (ei
)); )
9305 last
= last_stmt (e
->src
);
9306 if ((gimple_code (last
) == GIMPLE_RETURN
9307 || gimple_call_builtin_p (last
, BUILT_IN_RETURN
))
9308 && location
== UNKNOWN_LOCATION
9309 && ((location
= LOCATION_LOCUS (gimple_location (last
)))
9310 != UNKNOWN_LOCATION
)
9313 /* When optimizing, replace return stmts in noreturn functions
9314 with __builtin_unreachable () call. */
9315 if (optimize
&& gimple_code (last
) == GIMPLE_RETURN
)
9317 tree fndecl
= builtin_decl_implicit (BUILT_IN_UNREACHABLE
);
9318 gimple
*new_stmt
= gimple_build_call (fndecl
, 0);
9319 gimple_set_location (new_stmt
, gimple_location (last
));
9320 gimple_stmt_iterator gsi
= gsi_for_stmt (last
);
9321 gsi_replace (&gsi
, new_stmt
, true);
9327 if (location
== UNKNOWN_LOCATION
)
9328 location
= cfun
->function_end_locus
;
9329 warning_at (location
, 0, "%<noreturn%> function does return");
9332 /* If we see "return;" in some basic block, then we do reach the end
9333 without returning a value. */
9334 else if (warn_return_type
> 0
9335 && !TREE_NO_WARNING (fun
->decl
)
9336 && !VOID_TYPE_P (TREE_TYPE (TREE_TYPE (fun
->decl
))))
9338 FOR_EACH_EDGE (e
, ei
, EXIT_BLOCK_PTR_FOR_FN (fun
)->preds
)
9340 gimple
*last
= last_stmt (e
->src
);
9341 greturn
*return_stmt
= dyn_cast
<greturn
*> (last
);
9343 && gimple_return_retval (return_stmt
) == NULL
9344 && !gimple_no_warning_p (last
))
9346 location
= gimple_location (last
);
9347 if (LOCATION_LOCUS (location
) == UNKNOWN_LOCATION
)
9348 location
= fun
->function_end_locus
;
9349 warning_at (location
, OPT_Wreturn_type
,
9350 "control reaches end of non-void function");
9351 TREE_NO_WARNING (fun
->decl
) = 1;
9355 /* The C++ FE turns fallthrough from the end of non-void function
9356 into __builtin_unreachable () call with BUILTINS_LOCATION.
9357 Recognize those too. */
9359 if (!TREE_NO_WARNING (fun
->decl
))
9360 FOR_EACH_BB_FN (bb
, fun
)
9361 if (EDGE_COUNT (bb
->succs
) == 0)
9363 gimple
*last
= last_stmt (bb
);
9364 const enum built_in_function ubsan_missing_ret
9365 = BUILT_IN_UBSAN_HANDLE_MISSING_RETURN
;
9367 && ((LOCATION_LOCUS (gimple_location (last
))
9368 == BUILTINS_LOCATION
9369 && gimple_call_builtin_p (last
, BUILT_IN_UNREACHABLE
))
9370 || gimple_call_builtin_p (last
, ubsan_missing_ret
)))
9372 gimple_stmt_iterator gsi
= gsi_for_stmt (last
);
9373 gsi_prev_nondebug (&gsi
);
9374 gimple
*prev
= gsi_stmt (gsi
);
9376 location
= UNKNOWN_LOCATION
;
9378 location
= gimple_location (prev
);
9379 if (LOCATION_LOCUS (location
) == UNKNOWN_LOCATION
)
9380 location
= fun
->function_end_locus
;
9381 warning_at (location
, OPT_Wreturn_type
,
9382 "control reaches end of non-void function");
9383 TREE_NO_WARNING (fun
->decl
) = 1;
9394 make_pass_warn_function_return (gcc::context
*ctxt
)
9396 return new pass_warn_function_return (ctxt
);
9399 /* Walk a gimplified function and warn for functions whose return value is
9400 ignored and attribute((warn_unused_result)) is set. This is done before
9401 inlining, so we don't have to worry about that. */
9404 do_warn_unused_result (gimple_seq seq
)
9407 gimple_stmt_iterator i
;
9409 for (i
= gsi_start (seq
); !gsi_end_p (i
); gsi_next (&i
))
9411 gimple
*g
= gsi_stmt (i
);
9413 switch (gimple_code (g
))
9416 do_warn_unused_result (gimple_bind_body (as_a
<gbind
*>(g
)));
9419 do_warn_unused_result (gimple_try_eval (g
));
9420 do_warn_unused_result (gimple_try_cleanup (g
));
9423 do_warn_unused_result (gimple_catch_handler (
9424 as_a
<gcatch
*> (g
)));
9426 case GIMPLE_EH_FILTER
:
9427 do_warn_unused_result (gimple_eh_filter_failure (g
));
9431 if (gimple_call_lhs (g
))
9433 if (gimple_call_internal_p (g
))
9436 /* This is a naked call, as opposed to a GIMPLE_CALL with an
9437 LHS. All calls whose value is ignored should be
9438 represented like this. Look for the attribute. */
9439 fdecl
= gimple_call_fndecl (g
);
9440 ftype
= gimple_call_fntype (g
);
9442 if (lookup_attribute ("warn_unused_result", TYPE_ATTRIBUTES (ftype
)))
9444 location_t loc
= gimple_location (g
);
9447 warning_at (loc
, OPT_Wunused_result
,
9448 "ignoring return value of %qD, "
9449 "declared with attribute warn_unused_result",
9452 warning_at (loc
, OPT_Wunused_result
,
9453 "ignoring return value of function "
9454 "declared with attribute warn_unused_result");
9459 /* Not a container, not a call, or a call whose value is used. */
9467 const pass_data pass_data_warn_unused_result
=
9469 GIMPLE_PASS
, /* type */
9470 "*warn_unused_result", /* name */
9471 OPTGROUP_NONE
, /* optinfo_flags */
9472 TV_NONE
, /* tv_id */
9473 PROP_gimple_any
, /* properties_required */
9474 0, /* properties_provided */
9475 0, /* properties_destroyed */
9476 0, /* todo_flags_start */
9477 0, /* todo_flags_finish */
9480 class pass_warn_unused_result
: public gimple_opt_pass
9483 pass_warn_unused_result (gcc::context
*ctxt
)
9484 : gimple_opt_pass (pass_data_warn_unused_result
, ctxt
)
9487 /* opt_pass methods: */
9488 virtual bool gate (function
*) { return flag_warn_unused_result
; }
9489 virtual unsigned int execute (function
*)
9491 do_warn_unused_result (gimple_body (current_function_decl
));
9495 }; // class pass_warn_unused_result
9500 make_pass_warn_unused_result (gcc::context
*ctxt
)
9502 return new pass_warn_unused_result (ctxt
);
9505 /* IPA passes, compilation of earlier functions or inlining
9506 might have changed some properties, such as marked functions nothrow,
9507 pure, const or noreturn.
9508 Remove redundant edges and basic blocks, and create new ones if necessary.
9510 This pass can't be executed as stand alone pass from pass manager, because
9511 in between inlining and this fixup the verify_flow_info would fail. */
9514 execute_fixup_cfg (void)
9517 gimple_stmt_iterator gsi
;
9519 cgraph_node
*node
= cgraph_node::get (current_function_decl
);
9520 profile_count num
= node
->count
;
9521 profile_count den
= ENTRY_BLOCK_PTR_FOR_FN (cfun
)->count
;
9522 bool scale
= num
.initialized_p () && !(num
== den
);
9526 profile_count::adjust_for_ipa_scaling (&num
, &den
);
9527 ENTRY_BLOCK_PTR_FOR_FN (cfun
)->count
= node
->count
;
9528 EXIT_BLOCK_PTR_FOR_FN (cfun
)->count
9529 = EXIT_BLOCK_PTR_FOR_FN (cfun
)->count
.apply_scale (num
, den
);
9532 FOR_EACH_BB_FN (bb
, cfun
)
9535 bb
->count
= bb
->count
.apply_scale (num
, den
);
9536 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
);)
9538 gimple
*stmt
= gsi_stmt (gsi
);
9539 tree decl
= is_gimple_call (stmt
)
9540 ? gimple_call_fndecl (stmt
)
9544 int flags
= gimple_call_flags (stmt
);
9545 if (flags
& (ECF_CONST
| ECF_PURE
| ECF_LOOPING_CONST_OR_PURE
))
9547 if (gimple_purge_dead_abnormal_call_edges (bb
))
9548 todo
|= TODO_cleanup_cfg
;
9550 if (gimple_in_ssa_p (cfun
))
9552 todo
|= TODO_update_ssa
| TODO_cleanup_cfg
;
9557 if (flags
& ECF_NORETURN
9558 && fixup_noreturn_call (stmt
))
9559 todo
|= TODO_cleanup_cfg
;
9562 /* Remove stores to variables we marked write-only.
9563 Keep access when store has side effect, i.e. in case when source
9565 if (gimple_store_p (stmt
)
9566 && !gimple_has_side_effects (stmt
))
9568 tree lhs
= get_base_address (gimple_get_lhs (stmt
));
9571 && (TREE_STATIC (lhs
) || DECL_EXTERNAL (lhs
))
9572 && varpool_node::get (lhs
)->writeonly
)
9574 unlink_stmt_vdef (stmt
);
9575 gsi_remove (&gsi
, true);
9576 release_defs (stmt
);
9577 todo
|= TODO_update_ssa
| TODO_cleanup_cfg
;
9581 /* For calls we can simply remove LHS when it is known
9582 to be write-only. */
9583 if (is_gimple_call (stmt
)
9584 && gimple_get_lhs (stmt
))
9586 tree lhs
= get_base_address (gimple_get_lhs (stmt
));
9589 && (TREE_STATIC (lhs
) || DECL_EXTERNAL (lhs
))
9590 && varpool_node::get (lhs
)->writeonly
)
9592 gimple_call_set_lhs (stmt
, NULL
);
9594 todo
|= TODO_update_ssa
| TODO_cleanup_cfg
;
9598 if (maybe_clean_eh_stmt (stmt
)
9599 && gimple_purge_dead_eh_edges (bb
))
9600 todo
|= TODO_cleanup_cfg
;
9604 /* If we have a basic block with no successors that does not
9605 end with a control statement or a noreturn call end it with
9606 a call to __builtin_unreachable. This situation can occur
9607 when inlining a noreturn call that does in fact return. */
9608 if (EDGE_COUNT (bb
->succs
) == 0)
9610 gimple
*stmt
= last_stmt (bb
);
9612 || (!is_ctrl_stmt (stmt
)
9613 && (!is_gimple_call (stmt
)
9614 || !gimple_call_noreturn_p (stmt
))))
9616 if (stmt
&& is_gimple_call (stmt
))
9617 gimple_call_set_ctrl_altering (stmt
, false);
9618 tree fndecl
= builtin_decl_implicit (BUILT_IN_UNREACHABLE
);
9619 stmt
= gimple_build_call (fndecl
, 0);
9620 gimple_stmt_iterator gsi
= gsi_last_bb (bb
);
9621 gsi_insert_after (&gsi
, stmt
, GSI_NEW_STMT
);
9622 if (!cfun
->after_inlining
)
9624 gcall
*call_stmt
= dyn_cast
<gcall
*> (stmt
);
9625 node
->create_edge (cgraph_node::get_create (fndecl
),
9626 call_stmt
, bb
->count
);
9632 compute_function_frequency ();
9635 && (todo
& TODO_cleanup_cfg
))
9636 loops_state_set (LOOPS_NEED_FIXUP
);
9643 const pass_data pass_data_fixup_cfg
=
9645 GIMPLE_PASS
, /* type */
9646 "fixup_cfg", /* name */
9647 OPTGROUP_NONE
, /* optinfo_flags */
9648 TV_NONE
, /* tv_id */
9649 PROP_cfg
, /* properties_required */
9650 0, /* properties_provided */
9651 0, /* properties_destroyed */
9652 0, /* todo_flags_start */
9653 0, /* todo_flags_finish */
9656 class pass_fixup_cfg
: public gimple_opt_pass
9659 pass_fixup_cfg (gcc::context
*ctxt
)
9660 : gimple_opt_pass (pass_data_fixup_cfg
, ctxt
)
9663 /* opt_pass methods: */
9664 opt_pass
* clone () { return new pass_fixup_cfg (m_ctxt
); }
9665 virtual unsigned int execute (function
*) { return execute_fixup_cfg (); }
9667 }; // class pass_fixup_cfg
9672 make_pass_fixup_cfg (gcc::context
*ctxt
)
9674 return new pass_fixup_cfg (ctxt
);
9677 /* Garbage collection support for edge_def. */
9679 extern void gt_ggc_mx (tree
&);
9680 extern void gt_ggc_mx (gimple
*&);
9681 extern void gt_ggc_mx (rtx
&);
9682 extern void gt_ggc_mx (basic_block
&);
9685 gt_ggc_mx (rtx_insn
*& x
)
9688 gt_ggc_mx_rtx_def ((void *) x
);
9692 gt_ggc_mx (edge_def
*e
)
9694 tree block
= LOCATION_BLOCK (e
->goto_locus
);
9696 gt_ggc_mx (e
->dest
);
9697 if (current_ir_type () == IR_GIMPLE
)
9698 gt_ggc_mx (e
->insns
.g
);
9700 gt_ggc_mx (e
->insns
.r
);
9704 /* PCH support for edge_def. */
9706 extern void gt_pch_nx (tree
&);
9707 extern void gt_pch_nx (gimple
*&);
9708 extern void gt_pch_nx (rtx
&);
9709 extern void gt_pch_nx (basic_block
&);
9712 gt_pch_nx (rtx_insn
*& x
)
9715 gt_pch_nx_rtx_def ((void *) x
);
9719 gt_pch_nx (edge_def
*e
)
9721 tree block
= LOCATION_BLOCK (e
->goto_locus
);
9723 gt_pch_nx (e
->dest
);
9724 if (current_ir_type () == IR_GIMPLE
)
9725 gt_pch_nx (e
->insns
.g
);
9727 gt_pch_nx (e
->insns
.r
);
9732 gt_pch_nx (edge_def
*e
, gt_pointer_operator op
, void *cookie
)
9734 tree block
= LOCATION_BLOCK (e
->goto_locus
);
9735 op (&(e
->src
), cookie
);
9736 op (&(e
->dest
), cookie
);
9737 if (current_ir_type () == IR_GIMPLE
)
9738 op (&(e
->insns
.g
), cookie
);
9740 op (&(e
->insns
.r
), cookie
);
9741 op (&(block
), cookie
);
9746 namespace selftest
{
9748 /* Helper function for CFG selftests: create a dummy function decl
9749 and push it as cfun. */
9752 push_fndecl (const char *name
)
9754 tree fn_type
= build_function_type_array (integer_type_node
, 0, NULL
);
9755 /* FIXME: this uses input_location: */
9756 tree fndecl
= build_fn_decl (name
, fn_type
);
9757 tree retval
= build_decl (UNKNOWN_LOCATION
, RESULT_DECL
,
9758 NULL_TREE
, integer_type_node
);
9759 DECL_RESULT (fndecl
) = retval
;
9760 push_struct_function (fndecl
);
9761 function
*fun
= DECL_STRUCT_FUNCTION (fndecl
);
9762 ASSERT_TRUE (fun
!= NULL
);
9763 init_empty_tree_cfg_for_function (fun
);
9764 ASSERT_EQ (2, n_basic_blocks_for_fn (fun
));
9765 ASSERT_EQ (0, n_edges_for_fn (fun
));
9769 /* These tests directly create CFGs.
9770 Compare with the static fns within tree-cfg.c:
9772 - make_blocks: calls create_basic_block (seq, bb);
9775 /* Verify a simple cfg of the form:
9776 ENTRY -> A -> B -> C -> EXIT. */
9779 test_linear_chain ()
9781 gimple_register_cfg_hooks ();
9783 tree fndecl
= push_fndecl ("cfg_test_linear_chain");
9784 function
*fun
= DECL_STRUCT_FUNCTION (fndecl
);
9786 /* Create some empty blocks. */
9787 basic_block bb_a
= create_empty_bb (ENTRY_BLOCK_PTR_FOR_FN (fun
));
9788 basic_block bb_b
= create_empty_bb (bb_a
);
9789 basic_block bb_c
= create_empty_bb (bb_b
);
9791 ASSERT_EQ (5, n_basic_blocks_for_fn (fun
));
9792 ASSERT_EQ (0, n_edges_for_fn (fun
));
9794 /* Create some edges: a simple linear chain of BBs. */
9795 make_edge (ENTRY_BLOCK_PTR_FOR_FN (fun
), bb_a
, EDGE_FALLTHRU
);
9796 make_edge (bb_a
, bb_b
, 0);
9797 make_edge (bb_b
, bb_c
, 0);
9798 make_edge (bb_c
, EXIT_BLOCK_PTR_FOR_FN (fun
), 0);
9800 /* Verify the edges. */
9801 ASSERT_EQ (4, n_edges_for_fn (fun
));
9802 ASSERT_EQ (NULL
, ENTRY_BLOCK_PTR_FOR_FN (fun
)->preds
);
9803 ASSERT_EQ (1, ENTRY_BLOCK_PTR_FOR_FN (fun
)->succs
->length ());
9804 ASSERT_EQ (1, bb_a
->preds
->length ());
9805 ASSERT_EQ (1, bb_a
->succs
->length ());
9806 ASSERT_EQ (1, bb_b
->preds
->length ());
9807 ASSERT_EQ (1, bb_b
->succs
->length ());
9808 ASSERT_EQ (1, bb_c
->preds
->length ());
9809 ASSERT_EQ (1, bb_c
->succs
->length ());
9810 ASSERT_EQ (1, EXIT_BLOCK_PTR_FOR_FN (fun
)->preds
->length ());
9811 ASSERT_EQ (NULL
, EXIT_BLOCK_PTR_FOR_FN (fun
)->succs
);
9813 /* Verify the dominance information
9814 Each BB in our simple chain should be dominated by the one before
9816 calculate_dominance_info (CDI_DOMINATORS
);
9817 ASSERT_EQ (bb_a
, get_immediate_dominator (CDI_DOMINATORS
, bb_b
));
9818 ASSERT_EQ (bb_b
, get_immediate_dominator (CDI_DOMINATORS
, bb_c
));
9819 vec
<basic_block
> dom_by_b
= get_dominated_by (CDI_DOMINATORS
, bb_b
);
9820 ASSERT_EQ (1, dom_by_b
.length ());
9821 ASSERT_EQ (bb_c
, dom_by_b
[0]);
9822 free_dominance_info (CDI_DOMINATORS
);
9823 dom_by_b
.release ();
9825 /* Similarly for post-dominance: each BB in our chain is post-dominated
9826 by the one after it. */
9827 calculate_dominance_info (CDI_POST_DOMINATORS
);
9828 ASSERT_EQ (bb_b
, get_immediate_dominator (CDI_POST_DOMINATORS
, bb_a
));
9829 ASSERT_EQ (bb_c
, get_immediate_dominator (CDI_POST_DOMINATORS
, bb_b
));
9830 vec
<basic_block
> postdom_by_b
= get_dominated_by (CDI_POST_DOMINATORS
, bb_b
);
9831 ASSERT_EQ (1, postdom_by_b
.length ());
9832 ASSERT_EQ (bb_a
, postdom_by_b
[0]);
9833 free_dominance_info (CDI_POST_DOMINATORS
);
9834 postdom_by_b
.release ();
9839 /* Verify a simple CFG of the form:
9855 gimple_register_cfg_hooks ();
9857 tree fndecl
= push_fndecl ("cfg_test_diamond");
9858 function
*fun
= DECL_STRUCT_FUNCTION (fndecl
);
9860 /* Create some empty blocks. */
9861 basic_block bb_a
= create_empty_bb (ENTRY_BLOCK_PTR_FOR_FN (fun
));
9862 basic_block bb_b
= create_empty_bb (bb_a
);
9863 basic_block bb_c
= create_empty_bb (bb_a
);
9864 basic_block bb_d
= create_empty_bb (bb_b
);
9866 ASSERT_EQ (6, n_basic_blocks_for_fn (fun
));
9867 ASSERT_EQ (0, n_edges_for_fn (fun
));
9869 /* Create the edges. */
9870 make_edge (ENTRY_BLOCK_PTR_FOR_FN (fun
), bb_a
, EDGE_FALLTHRU
);
9871 make_edge (bb_a
, bb_b
, EDGE_TRUE_VALUE
);
9872 make_edge (bb_a
, bb_c
, EDGE_FALSE_VALUE
);
9873 make_edge (bb_b
, bb_d
, 0);
9874 make_edge (bb_c
, bb_d
, 0);
9875 make_edge (bb_d
, EXIT_BLOCK_PTR_FOR_FN (fun
), 0);
9877 /* Verify the edges. */
9878 ASSERT_EQ (6, n_edges_for_fn (fun
));
9879 ASSERT_EQ (1, bb_a
->preds
->length ());
9880 ASSERT_EQ (2, bb_a
->succs
->length ());
9881 ASSERT_EQ (1, bb_b
->preds
->length ());
9882 ASSERT_EQ (1, bb_b
->succs
->length ());
9883 ASSERT_EQ (1, bb_c
->preds
->length ());
9884 ASSERT_EQ (1, bb_c
->succs
->length ());
9885 ASSERT_EQ (2, bb_d
->preds
->length ());
9886 ASSERT_EQ (1, bb_d
->succs
->length ());
9888 /* Verify the dominance information. */
9889 calculate_dominance_info (CDI_DOMINATORS
);
9890 ASSERT_EQ (bb_a
, get_immediate_dominator (CDI_DOMINATORS
, bb_b
));
9891 ASSERT_EQ (bb_a
, get_immediate_dominator (CDI_DOMINATORS
, bb_c
));
9892 ASSERT_EQ (bb_a
, get_immediate_dominator (CDI_DOMINATORS
, bb_d
));
9893 vec
<basic_block
> dom_by_a
= get_dominated_by (CDI_DOMINATORS
, bb_a
);
9894 ASSERT_EQ (3, dom_by_a
.length ()); /* B, C, D, in some order. */
9895 dom_by_a
.release ();
9896 vec
<basic_block
> dom_by_b
= get_dominated_by (CDI_DOMINATORS
, bb_b
);
9897 ASSERT_EQ (0, dom_by_b
.length ());
9898 dom_by_b
.release ();
9899 free_dominance_info (CDI_DOMINATORS
);
9901 /* Similarly for post-dominance. */
9902 calculate_dominance_info (CDI_POST_DOMINATORS
);
9903 ASSERT_EQ (bb_d
, get_immediate_dominator (CDI_POST_DOMINATORS
, bb_a
));
9904 ASSERT_EQ (bb_d
, get_immediate_dominator (CDI_POST_DOMINATORS
, bb_b
));
9905 ASSERT_EQ (bb_d
, get_immediate_dominator (CDI_POST_DOMINATORS
, bb_c
));
9906 vec
<basic_block
> postdom_by_d
= get_dominated_by (CDI_POST_DOMINATORS
, bb_d
);
9907 ASSERT_EQ (3, postdom_by_d
.length ()); /* A, B, C in some order. */
9908 postdom_by_d
.release ();
9909 vec
<basic_block
> postdom_by_b
= get_dominated_by (CDI_POST_DOMINATORS
, bb_b
);
9910 ASSERT_EQ (0, postdom_by_b
.length ());
9911 postdom_by_b
.release ();
9912 free_dominance_info (CDI_POST_DOMINATORS
);
9917 /* Verify that we can handle a CFG containing a "complete" aka
9918 fully-connected subgraph (where A B C D below all have edges
9919 pointing to each other node, also to themselves).
9937 test_fully_connected ()
9939 gimple_register_cfg_hooks ();
9941 tree fndecl
= push_fndecl ("cfg_fully_connected");
9942 function
*fun
= DECL_STRUCT_FUNCTION (fndecl
);
9946 /* Create some empty blocks. */
9947 auto_vec
<basic_block
> subgraph_nodes
;
9948 for (int i
= 0; i
< n
; i
++)
9949 subgraph_nodes
.safe_push (create_empty_bb (ENTRY_BLOCK_PTR_FOR_FN (fun
)));
9951 ASSERT_EQ (n
+ 2, n_basic_blocks_for_fn (fun
));
9952 ASSERT_EQ (0, n_edges_for_fn (fun
));
9954 /* Create the edges. */
9955 make_edge (ENTRY_BLOCK_PTR_FOR_FN (fun
), subgraph_nodes
[0], EDGE_FALLTHRU
);
9956 make_edge (subgraph_nodes
[0], EXIT_BLOCK_PTR_FOR_FN (fun
), 0);
9957 for (int i
= 0; i
< n
; i
++)
9958 for (int j
= 0; j
< n
; j
++)
9959 make_edge (subgraph_nodes
[i
], subgraph_nodes
[j
], 0);
9961 /* Verify the edges. */
9962 ASSERT_EQ (2 + (n
* n
), n_edges_for_fn (fun
));
9963 /* The first one is linked to ENTRY/EXIT as well as itself and
9965 ASSERT_EQ (n
+ 1, subgraph_nodes
[0]->preds
->length ());
9966 ASSERT_EQ (n
+ 1, subgraph_nodes
[0]->succs
->length ());
9967 /* The other ones in the subgraph are linked to everything in
9968 the subgraph (including themselves). */
9969 for (int i
= 1; i
< n
; i
++)
9971 ASSERT_EQ (n
, subgraph_nodes
[i
]->preds
->length ());
9972 ASSERT_EQ (n
, subgraph_nodes
[i
]->succs
->length ());
9975 /* Verify the dominance information. */
9976 calculate_dominance_info (CDI_DOMINATORS
);
9977 /* The initial block in the subgraph should be dominated by ENTRY. */
9978 ASSERT_EQ (ENTRY_BLOCK_PTR_FOR_FN (fun
),
9979 get_immediate_dominator (CDI_DOMINATORS
,
9980 subgraph_nodes
[0]));
9981 /* Every other block in the subgraph should be dominated by the
9983 for (int i
= 1; i
< n
; i
++)
9984 ASSERT_EQ (subgraph_nodes
[0],
9985 get_immediate_dominator (CDI_DOMINATORS
,
9986 subgraph_nodes
[i
]));
9987 free_dominance_info (CDI_DOMINATORS
);
9989 /* Similarly for post-dominance. */
9990 calculate_dominance_info (CDI_POST_DOMINATORS
);
9991 /* The initial block in the subgraph should be postdominated by EXIT. */
9992 ASSERT_EQ (EXIT_BLOCK_PTR_FOR_FN (fun
),
9993 get_immediate_dominator (CDI_POST_DOMINATORS
,
9994 subgraph_nodes
[0]));
9995 /* Every other block in the subgraph should be postdominated by the
9996 initial block, since that leads to EXIT. */
9997 for (int i
= 1; i
< n
; i
++)
9998 ASSERT_EQ (subgraph_nodes
[0],
9999 get_immediate_dominator (CDI_POST_DOMINATORS
,
10000 subgraph_nodes
[i
]));
10001 free_dominance_info (CDI_POST_DOMINATORS
);
10006 /* Run all of the selftests within this file. */
10009 tree_cfg_c_tests ()
10011 test_linear_chain ();
10013 test_fully_connected ();
10016 } // namespace selftest
10018 /* TODO: test the dominator/postdominator logic with various graphs/nodes:
10021 - switch statement (a block with many out-edges)
10022 - something that jumps to itself
10025 #endif /* CHECKING_P */