1 /* Control flow functions for trees.
2 Copyright (C) 2001-2022 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-iterator.h"
41 #include "gimple-fold.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 "tree-ssa-dce.h"
58 #include "omp-general.h"
59 #include "omp-expand.h"
60 #include "tree-cfgcleanup.h"
69 /* This file contains functions for building the Control Flow Graph (CFG)
70 for a function tree. */
72 /* Local declarations. */
74 /* Initial capacity for the basic block array. */
75 static const int initial_cfg_capacity
= 20;
77 /* This hash table allows us to efficiently lookup all CASE_LABEL_EXPRs
78 which use a particular edge. The CASE_LABEL_EXPRs are chained together
79 via their CASE_CHAIN field, which we clear after we're done with the
80 hash table to prevent problems with duplication of GIMPLE_SWITCHes.
82 Access to this list of CASE_LABEL_EXPRs allows us to efficiently
83 update the case vector in response to edge redirections.
85 Right now this table is set up and torn down at key points in the
86 compilation process. It would be nice if we could make the table
87 more persistent. The key is getting notification of changes to
88 the CFG (particularly edge removal, creation and redirection). */
90 static hash_map
<edge
, tree
> *edge_to_cases
;
92 /* If we record edge_to_cases, this bitmap will hold indexes
93 of basic blocks that end in a GIMPLE_SWITCH which we touched
94 due to edge manipulations. */
96 static bitmap touched_switch_bbs
;
98 /* OpenMP region idxs for blocks during cfg pass. */
99 static vec
<int> bb_to_omp_idx
;
101 /* CFG statistics. */
104 long num_merged_labels
;
107 static struct cfg_stats_d cfg_stats
;
109 /* Data to pass to replace_block_vars_by_duplicates_1. */
110 struct replace_decls_d
112 hash_map
<tree
, tree
> *vars_map
;
116 /* Hash table to store last discriminator assigned for each locus. */
117 struct locus_discrim_map
123 /* Hashtable helpers. */
125 struct locus_discrim_hasher
: free_ptr_hash
<locus_discrim_map
>
127 static inline hashval_t
hash (const locus_discrim_map
*);
128 static inline bool equal (const locus_discrim_map
*,
129 const locus_discrim_map
*);
132 /* Trivial hash function for a location_t. ITEM is a pointer to
133 a hash table entry that maps a location_t to a discriminator. */
136 locus_discrim_hasher::hash (const locus_discrim_map
*item
)
138 return item
->location_line
;
141 /* Equality function for the locus-to-discriminator map. A and B
142 point to the two hash table entries to compare. */
145 locus_discrim_hasher::equal (const locus_discrim_map
*a
,
146 const locus_discrim_map
*b
)
148 return a
->location_line
== b
->location_line
;
151 static hash_table
<locus_discrim_hasher
> *discriminator_per_locus
;
153 /* Basic blocks and flowgraphs. */
154 static void make_blocks (gimple_seq
);
157 static void make_edges (void);
158 static void assign_discriminators (void);
159 static void make_cond_expr_edges (basic_block
);
160 static void make_gimple_switch_edges (gswitch
*, basic_block
);
161 static bool make_goto_expr_edges (basic_block
);
162 static void make_gimple_asm_edges (basic_block
);
163 static edge
gimple_redirect_edge_and_branch (edge
, basic_block
);
164 static edge
gimple_try_redirect_by_replacing_jump (edge
, basic_block
);
166 /* Various helpers. */
167 static inline bool stmt_starts_bb_p (gimple
*, gimple
*);
168 static int gimple_verify_flow_info (void);
169 static void gimple_make_forwarder_block (edge
);
170 static gimple
*first_non_label_stmt (basic_block
);
171 static bool verify_gimple_transaction (gtransaction
*);
172 static bool call_can_make_abnormal_goto (gimple
*);
174 /* Flowgraph optimization and cleanup. */
175 static void gimple_merge_blocks (basic_block
, basic_block
);
176 static bool gimple_can_merge_blocks_p (basic_block
, basic_block
);
177 static void remove_bb (basic_block
);
178 static edge
find_taken_edge_computed_goto (basic_block
, tree
);
179 static edge
find_taken_edge_cond_expr (const gcond
*, tree
);
182 init_empty_tree_cfg_for_function (struct function
*fn
)
184 /* Initialize the basic block array. */
186 profile_status_for_fn (fn
) = PROFILE_ABSENT
;
187 n_basic_blocks_for_fn (fn
) = NUM_FIXED_BLOCKS
;
188 last_basic_block_for_fn (fn
) = NUM_FIXED_BLOCKS
;
189 vec_safe_grow_cleared (basic_block_info_for_fn (fn
),
190 initial_cfg_capacity
, true);
192 /* Build a mapping of labels to their associated blocks. */
193 vec_safe_grow_cleared (label_to_block_map_for_fn (fn
),
194 initial_cfg_capacity
, true);
196 SET_BASIC_BLOCK_FOR_FN (fn
, ENTRY_BLOCK
, ENTRY_BLOCK_PTR_FOR_FN (fn
));
197 SET_BASIC_BLOCK_FOR_FN (fn
, EXIT_BLOCK
, EXIT_BLOCK_PTR_FOR_FN (fn
));
199 ENTRY_BLOCK_PTR_FOR_FN (fn
)->next_bb
200 = EXIT_BLOCK_PTR_FOR_FN (fn
);
201 EXIT_BLOCK_PTR_FOR_FN (fn
)->prev_bb
202 = ENTRY_BLOCK_PTR_FOR_FN (fn
);
206 init_empty_tree_cfg (void)
208 init_empty_tree_cfg_for_function (cfun
);
211 /*---------------------------------------------------------------------------
213 ---------------------------------------------------------------------------*/
215 /* Entry point to the CFG builder for trees. SEQ is the sequence of
216 statements to be added to the flowgraph. */
219 build_gimple_cfg (gimple_seq seq
)
221 /* Register specific gimple functions. */
222 gimple_register_cfg_hooks ();
224 memset ((void *) &cfg_stats
, 0, sizeof (cfg_stats
));
226 init_empty_tree_cfg ();
230 /* Make sure there is always at least one block, even if it's empty. */
231 if (n_basic_blocks_for_fn (cfun
) == NUM_FIXED_BLOCKS
)
232 create_empty_bb (ENTRY_BLOCK_PTR_FOR_FN (cfun
));
234 /* Adjust the size of the array. */
235 if (basic_block_info_for_fn (cfun
)->length ()
236 < (size_t) n_basic_blocks_for_fn (cfun
))
237 vec_safe_grow_cleared (basic_block_info_for_fn (cfun
),
238 n_basic_blocks_for_fn (cfun
));
240 /* To speed up statement iterator walks, we first purge dead labels. */
241 cleanup_dead_labels ();
243 /* Group case nodes to reduce the number of edges.
244 We do this after cleaning up dead labels because otherwise we miss
245 a lot of obvious case merging opportunities. */
246 group_case_labels ();
248 /* Create the edges of the flowgraph. */
249 discriminator_per_locus
= new hash_table
<locus_discrim_hasher
> (13);
251 assign_discriminators ();
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
, class 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)
318 gimple_stmt_iterator gsi
;
321 for (auto loop
: loops_list (cfun
, 0))
323 /* First look into the header. */
324 replace_loop_annotate_in_block (loop
->header
, loop
);
326 /* Then look into the latch, if any. */
328 replace_loop_annotate_in_block (loop
->latch
, loop
);
330 /* Push the global flag_finite_loops state down to individual loops. */
331 loop
->finite_p
= flag_finite_loops
;
334 /* Remove IFN_ANNOTATE. Safeguard for the case loop->latch == NULL. */
335 FOR_EACH_BB_FN (bb
, cfun
)
337 for (gsi
= gsi_last_bb (bb
); !gsi_end_p (gsi
); gsi_prev (&gsi
))
339 stmt
= gsi_stmt (gsi
);
340 if (gimple_code (stmt
) != GIMPLE_CALL
)
342 if (!gimple_call_internal_p (stmt
)
343 || gimple_call_internal_fn (stmt
) != IFN_ANNOTATE
)
346 switch ((annot_expr_kind
) tree_to_shwi (gimple_call_arg (stmt
, 1)))
348 case annot_expr_ivdep_kind
:
349 case annot_expr_unroll_kind
:
350 case annot_expr_no_vector_kind
:
351 case annot_expr_vector_kind
:
352 case annot_expr_parallel_kind
:
358 warning_at (gimple_location (stmt
), 0, "ignoring loop annotation");
359 stmt
= gimple_build_assign (gimple_call_lhs (stmt
),
360 gimple_call_arg (stmt
, 0));
361 gsi_replace (&gsi
, stmt
, true);
367 execute_build_cfg (void)
369 gimple_seq body
= gimple_body (current_function_decl
);
371 build_gimple_cfg (body
);
372 gimple_set_body (current_function_decl
, NULL
);
373 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
375 fprintf (dump_file
, "Scope blocks:\n");
376 dump_scope_blocks (dump_file
, dump_flags
);
380 bb_to_omp_idx
.release ();
382 loop_optimizer_init (AVOID_CFG_MODIFICATIONS
);
383 replace_loop_annotate ();
389 const pass_data pass_data_build_cfg
=
391 GIMPLE_PASS
, /* type */
393 OPTGROUP_NONE
, /* optinfo_flags */
394 TV_TREE_CFG
, /* tv_id */
395 PROP_gimple_leh
, /* properties_required */
396 ( PROP_cfg
| PROP_loops
), /* properties_provided */
397 0, /* properties_destroyed */
398 0, /* todo_flags_start */
399 0, /* todo_flags_finish */
402 class pass_build_cfg
: public gimple_opt_pass
405 pass_build_cfg (gcc::context
*ctxt
)
406 : gimple_opt_pass (pass_data_build_cfg
, ctxt
)
409 /* opt_pass methods: */
410 unsigned int execute (function
*) final override
412 return execute_build_cfg ();
415 }; // class pass_build_cfg
420 make_pass_build_cfg (gcc::context
*ctxt
)
422 return new pass_build_cfg (ctxt
);
426 /* Return true if T is a computed goto. */
429 computed_goto_p (gimple
*t
)
431 return (gimple_code (t
) == GIMPLE_GOTO
432 && TREE_CODE (gimple_goto_dest (t
)) != LABEL_DECL
);
435 /* Returns true if the sequence of statements STMTS only contains
436 a call to __builtin_unreachable (). */
439 gimple_seq_unreachable_p (gimple_seq stmts
)
442 /* Return false if -fsanitize=unreachable, we don't want to
443 optimize away those calls, but rather turn them into
444 __ubsan_handle_builtin_unreachable () or __builtin_trap ()
446 || sanitize_flags_p (SANITIZE_UNREACHABLE
))
449 gimple_stmt_iterator gsi
= gsi_last (stmts
);
451 if (!gimple_call_builtin_p (gsi_stmt (gsi
), BUILT_IN_UNREACHABLE
))
454 for (gsi_prev (&gsi
); !gsi_end_p (gsi
); gsi_prev (&gsi
))
456 gimple
*stmt
= gsi_stmt (gsi
);
457 if (gimple_code (stmt
) != GIMPLE_LABEL
458 && !is_gimple_debug (stmt
)
459 && !gimple_clobber_p (stmt
))
465 /* Returns true for edge E where e->src ends with a GIMPLE_COND and
466 the other edge points to a bb with just __builtin_unreachable ().
467 I.e. return true for C->M edge in:
475 __builtin_unreachable ();
479 assert_unreachable_fallthru_edge_p (edge e
)
481 basic_block pred_bb
= e
->src
;
482 gimple
*last
= last_stmt (pred_bb
);
483 if (last
&& gimple_code (last
) == GIMPLE_COND
)
485 basic_block other_bb
= EDGE_SUCC (pred_bb
, 0)->dest
;
486 if (other_bb
== e
->dest
)
487 other_bb
= EDGE_SUCC (pred_bb
, 1)->dest
;
488 if (EDGE_COUNT (other_bb
->succs
) == 0)
489 return gimple_seq_unreachable_p (bb_seq (other_bb
));
495 /* Initialize GF_CALL_CTRL_ALTERING flag, which indicates the call
496 could alter control flow except via eh. We initialize the flag at
497 CFG build time and only ever clear it later. */
500 gimple_call_initialize_ctrl_altering (gimple
*stmt
)
502 int flags
= gimple_call_flags (stmt
);
504 /* A call alters control flow if it can make an abnormal goto. */
505 if (call_can_make_abnormal_goto (stmt
)
506 /* A call also alters control flow if it does not return. */
507 || flags
& ECF_NORETURN
508 /* TM ending statements have backedges out of the transaction.
509 Return true so we split the basic block containing them.
510 Note that the TM_BUILTIN test is merely an optimization. */
511 || ((flags
& ECF_TM_BUILTIN
)
512 && is_tm_ending_fndecl (gimple_call_fndecl (stmt
)))
513 /* BUILT_IN_RETURN call is same as return statement. */
514 || gimple_call_builtin_p (stmt
, BUILT_IN_RETURN
)
515 /* IFN_UNIQUE should be the last insn, to make checking for it
516 as cheap as possible. */
517 || (gimple_call_internal_p (stmt
)
518 && gimple_call_internal_unique_p (stmt
)))
519 gimple_call_set_ctrl_altering (stmt
, true);
521 gimple_call_set_ctrl_altering (stmt
, false);
525 /* Insert SEQ after BB and build a flowgraph. */
528 make_blocks_1 (gimple_seq seq
, basic_block bb
)
530 gimple_stmt_iterator i
= gsi_start (seq
);
532 gimple
*prev_stmt
= NULL
;
533 bool start_new_block
= true;
534 bool first_stmt_of_seq
= true;
536 while (!gsi_end_p (i
))
538 /* PREV_STMT should only be set to a debug stmt if the debug
539 stmt is before nondebug stmts. Once stmt reaches a nondebug
540 nonlabel, prev_stmt will be set to it, so that
541 stmt_starts_bb_p will know to start a new block if a label is
542 found. However, if stmt was a label after debug stmts only,
543 keep the label in prev_stmt even if we find further debug
544 stmts, for there may be other labels after them, and they
545 should land in the same block. */
546 if (!prev_stmt
|| !stmt
|| !is_gimple_debug (stmt
))
550 if (stmt
&& is_gimple_call (stmt
))
551 gimple_call_initialize_ctrl_altering (stmt
);
553 /* If the statement starts a new basic block or if we have determined
554 in a previous pass that we need to create a new block for STMT, do
556 if (start_new_block
|| stmt_starts_bb_p (stmt
, prev_stmt
))
558 if (!first_stmt_of_seq
)
559 gsi_split_seq_before (&i
, &seq
);
560 bb
= create_basic_block (seq
, bb
);
561 start_new_block
= false;
565 /* Now add STMT to BB and create the subgraphs for special statement
567 gimple_set_bb (stmt
, bb
);
569 /* If STMT is a basic block terminator, set START_NEW_BLOCK for the
571 if (stmt_ends_bb_p (stmt
))
573 /* If the stmt can make abnormal goto use a new temporary
574 for the assignment to the LHS. This makes sure the old value
575 of the LHS is available on the abnormal edge. Otherwise
576 we will end up with overlapping life-ranges for abnormal
578 if (gimple_has_lhs (stmt
)
579 && stmt_can_make_abnormal_goto (stmt
)
580 && is_gimple_reg_type (TREE_TYPE (gimple_get_lhs (stmt
))))
582 tree lhs
= gimple_get_lhs (stmt
);
583 tree tmp
= create_tmp_var (TREE_TYPE (lhs
));
584 gimple
*s
= gimple_build_assign (lhs
, tmp
);
585 gimple_set_location (s
, gimple_location (stmt
));
586 gimple_set_block (s
, gimple_block (stmt
));
587 gimple_set_lhs (stmt
, tmp
);
588 gsi_insert_after (&i
, s
, GSI_SAME_STMT
);
590 start_new_block
= true;
594 first_stmt_of_seq
= false;
599 /* Build a flowgraph for the sequence of stmts SEQ. */
602 make_blocks (gimple_seq seq
)
604 /* Look for debug markers right before labels, and move the debug
605 stmts after the labels. Accepting labels among debug markers
606 adds no value, just complexity; if we wanted to annotate labels
607 with view numbers (so sequencing among markers would matter) or
608 somesuch, we're probably better off still moving the labels, but
609 adding other debug annotations in their original positions or
610 emitting nonbind or bind markers associated with the labels in
611 the original position of the labels.
613 Moving labels would probably be simpler, but we can't do that:
614 moving labels assigns label ids to them, and doing so because of
615 debug markers makes for -fcompare-debug and possibly even codegen
616 differences. So, we have to move the debug stmts instead. To
617 that end, we scan SEQ backwards, marking the position of the
618 latest (earliest we find) label, and moving debug stmts that are
619 not separated from it by nondebug nonlabel stmts after the
621 if (MAY_HAVE_DEBUG_MARKER_STMTS
)
623 gimple_stmt_iterator label
= gsi_none ();
625 for (gimple_stmt_iterator i
= gsi_last (seq
); !gsi_end_p (i
); gsi_prev (&i
))
627 gimple
*stmt
= gsi_stmt (i
);
629 /* If this is the first label we encounter (latest in SEQ)
630 before nondebug stmts, record its position. */
631 if (is_a
<glabel
*> (stmt
))
633 if (gsi_end_p (label
))
638 /* Without a recorded label position to move debug stmts to,
639 there's nothing to do. */
640 if (gsi_end_p (label
))
643 /* Move the debug stmt at I after LABEL. */
644 if (is_gimple_debug (stmt
))
646 gcc_assert (gimple_debug_nonbind_marker_p (stmt
));
647 /* As STMT is removed, I advances to the stmt after
648 STMT, so the gsi_prev in the for "increment"
649 expression gets us to the stmt we're to visit after
650 STMT. LABEL, however, would advance to the moved
651 stmt if we passed it to gsi_move_after, so pass it a
652 copy instead, so as to keep LABEL pointing to the
654 gimple_stmt_iterator copy
= label
;
655 gsi_move_after (&i
, ©
);
659 /* There aren't any (more?) debug stmts before label, so
660 there isn't anything else to move after it. */
665 make_blocks_1 (seq
, ENTRY_BLOCK_PTR_FOR_FN (cfun
));
668 /* Create and return a new empty basic block after bb AFTER. */
671 create_bb (void *h
, void *e
, basic_block after
)
677 /* Create and initialize a new basic block. Since alloc_block uses
678 GC allocation that clears memory to allocate a basic block, we do
679 not have to clear the newly allocated basic block here. */
682 bb
->index
= last_basic_block_for_fn (cfun
);
684 set_bb_seq (bb
, h
? (gimple_seq
) h
: NULL
);
686 /* Add the new block to the linked list of blocks. */
687 link_block (bb
, after
);
689 /* Grow the basic block array if needed. */
690 if ((size_t) last_basic_block_for_fn (cfun
)
691 == basic_block_info_for_fn (cfun
)->length ())
692 vec_safe_grow_cleared (basic_block_info_for_fn (cfun
),
693 last_basic_block_for_fn (cfun
) + 1);
695 /* Add the newly created block to the array. */
696 SET_BASIC_BLOCK_FOR_FN (cfun
, last_basic_block_for_fn (cfun
), bb
);
698 n_basic_blocks_for_fn (cfun
)++;
699 last_basic_block_for_fn (cfun
)++;
705 /*---------------------------------------------------------------------------
707 ---------------------------------------------------------------------------*/
709 /* If basic block BB has an abnormal edge to a basic block
710 containing IFN_ABNORMAL_DISPATCHER internal call, return
711 that the dispatcher's basic block, otherwise return NULL. */
714 get_abnormal_succ_dispatcher (basic_block bb
)
719 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
720 if ((e
->flags
& (EDGE_ABNORMAL
| EDGE_EH
)) == EDGE_ABNORMAL
)
722 gimple_stmt_iterator gsi
723 = gsi_start_nondebug_after_labels_bb (e
->dest
);
724 gimple
*g
= gsi_stmt (gsi
);
725 if (g
&& gimple_call_internal_p (g
, IFN_ABNORMAL_DISPATCHER
))
731 /* Helper function for make_edges. Create a basic block with
732 with ABNORMAL_DISPATCHER internal call in it if needed, and
733 create abnormal edges from BBS to it and from it to FOR_BB
734 if COMPUTED_GOTO is false, otherwise factor the computed gotos. */
737 handle_abnormal_edges (basic_block
*dispatcher_bbs
, basic_block for_bb
,
738 auto_vec
<basic_block
> *bbs
, bool computed_goto
)
740 basic_block
*dispatcher
= dispatcher_bbs
+ (computed_goto
? 1 : 0);
741 unsigned int idx
= 0;
745 if (!bb_to_omp_idx
.is_empty ())
747 dispatcher
= dispatcher_bbs
+ 2 * bb_to_omp_idx
[for_bb
->index
];
748 if (bb_to_omp_idx
[for_bb
->index
] != 0)
752 /* If the dispatcher has been created already, then there are basic
753 blocks with abnormal edges to it, so just make a new edge to
755 if (*dispatcher
== NULL
)
757 /* Check if there are any basic blocks that need to have
758 abnormal edges to this dispatcher. If there are none, return
760 if (bb_to_omp_idx
.is_empty ())
762 if (bbs
->is_empty ())
767 FOR_EACH_VEC_ELT (*bbs
, idx
, bb
)
768 if (bb_to_omp_idx
[bb
->index
] == bb_to_omp_idx
[for_bb
->index
])
774 /* Create the dispatcher bb. */
775 *dispatcher
= create_basic_block (NULL
, for_bb
);
778 /* Factor computed gotos into a common computed goto site. Also
779 record the location of that site so that we can un-factor the
780 gotos after we have converted back to normal form. */
781 gimple_stmt_iterator gsi
= gsi_start_bb (*dispatcher
);
783 /* Create the destination of the factored goto. Each original
784 computed goto will put its desired destination into this
785 variable and jump to the label we create immediately below. */
786 tree var
= create_tmp_var (ptr_type_node
, "gotovar");
788 /* Build a label for the new block which will contain the
789 factored computed goto. */
790 tree factored_label_decl
791 = create_artificial_label (UNKNOWN_LOCATION
);
792 gimple
*factored_computed_goto_label
793 = gimple_build_label (factored_label_decl
);
794 gsi_insert_after (&gsi
, factored_computed_goto_label
, GSI_NEW_STMT
);
796 /* Build our new computed goto. */
797 gimple
*factored_computed_goto
= gimple_build_goto (var
);
798 gsi_insert_after (&gsi
, factored_computed_goto
, GSI_NEW_STMT
);
800 FOR_EACH_VEC_ELT (*bbs
, idx
, bb
)
802 if (!bb_to_omp_idx
.is_empty ()
803 && bb_to_omp_idx
[bb
->index
] != bb_to_omp_idx
[for_bb
->index
])
806 gsi
= gsi_last_bb (bb
);
807 gimple
*last
= gsi_stmt (gsi
);
809 gcc_assert (computed_goto_p (last
));
811 /* Copy the original computed goto's destination into VAR. */
813 = gimple_build_assign (var
, gimple_goto_dest (last
));
814 gsi_insert_before (&gsi
, assignment
, GSI_SAME_STMT
);
816 edge e
= make_edge (bb
, *dispatcher
, EDGE_FALLTHRU
);
817 e
->goto_locus
= gimple_location (last
);
818 gsi_remove (&gsi
, true);
823 tree arg
= inner
? boolean_true_node
: boolean_false_node
;
824 gimple
*g
= gimple_build_call_internal (IFN_ABNORMAL_DISPATCHER
,
826 gimple_stmt_iterator gsi
= gsi_after_labels (*dispatcher
);
827 gsi_insert_after (&gsi
, g
, GSI_NEW_STMT
);
829 /* Create predecessor edges of the dispatcher. */
830 FOR_EACH_VEC_ELT (*bbs
, idx
, bb
)
832 if (!bb_to_omp_idx
.is_empty ()
833 && bb_to_omp_idx
[bb
->index
] != bb_to_omp_idx
[for_bb
->index
])
835 make_edge (bb
, *dispatcher
, EDGE_ABNORMAL
);
840 make_edge (*dispatcher
, for_bb
, EDGE_ABNORMAL
);
843 /* Creates outgoing edges for BB. Returns 1 when it ends with an
844 computed goto, returns 2 when it ends with a statement that
845 might return to this function via an nonlocal goto, otherwise
846 return 0. Updates *PCUR_REGION with the OMP region this BB is in. */
849 make_edges_bb (basic_block bb
, struct omp_region
**pcur_region
, int *pomp_index
)
851 gimple
*last
= last_stmt (bb
);
852 bool fallthru
= false;
858 switch (gimple_code (last
))
861 if (make_goto_expr_edges (bb
))
867 edge e
= make_edge (bb
, EXIT_BLOCK_PTR_FOR_FN (cfun
), 0);
868 e
->goto_locus
= gimple_location (last
);
873 make_cond_expr_edges (bb
);
877 make_gimple_switch_edges (as_a
<gswitch
*> (last
), bb
);
881 make_eh_edges (last
);
884 case GIMPLE_EH_DISPATCH
:
885 fallthru
= make_eh_dispatch_edges (as_a
<geh_dispatch
*> (last
));
889 /* If this function receives a nonlocal goto, then we need to
890 make edges from this call site to all the nonlocal goto
892 if (stmt_can_make_abnormal_goto (last
))
895 /* If this statement has reachable exception handlers, then
896 create abnormal edges to them. */
897 make_eh_edges (last
);
899 /* BUILTIN_RETURN is really a return statement. */
900 if (gimple_call_builtin_p (last
, BUILT_IN_RETURN
))
902 make_edge (bb
, EXIT_BLOCK_PTR_FOR_FN (cfun
), 0);
905 /* Some calls are known not to return. */
907 fallthru
= !gimple_call_noreturn_p (last
);
911 /* A GIMPLE_ASSIGN may throw internally and thus be considered
913 if (is_ctrl_altering_stmt (last
))
914 make_eh_edges (last
);
919 make_gimple_asm_edges (bb
);
924 fallthru
= omp_make_gimple_edges (bb
, pcur_region
, pomp_index
);
927 case GIMPLE_TRANSACTION
:
929 gtransaction
*txn
= as_a
<gtransaction
*> (last
);
930 tree label1
= gimple_transaction_label_norm (txn
);
931 tree label2
= gimple_transaction_label_uninst (txn
);
934 make_edge (bb
, label_to_block (cfun
, label1
), EDGE_FALLTHRU
);
936 make_edge (bb
, label_to_block (cfun
, label2
),
937 EDGE_TM_UNINSTRUMENTED
| (label1
? 0 : EDGE_FALLTHRU
));
939 tree label3
= gimple_transaction_label_over (txn
);
940 if (gimple_transaction_subcode (txn
)
941 & (GTMA_HAVE_ABORT
| GTMA_IS_OUTER
))
942 make_edge (bb
, label_to_block (cfun
, label3
), EDGE_TM_ABORT
);
949 gcc_assert (!stmt_ends_bb_p (last
));
955 make_edge (bb
, bb
->next_bb
, EDGE_FALLTHRU
);
960 /* Join all the blocks in the flowgraph. */
966 struct omp_region
*cur_region
= NULL
;
967 auto_vec
<basic_block
> ab_edge_goto
;
968 auto_vec
<basic_block
> ab_edge_call
;
969 int cur_omp_region_idx
= 0;
971 /* Create an edge from entry to the first block with executable
973 make_edge (ENTRY_BLOCK_PTR_FOR_FN (cfun
),
974 BASIC_BLOCK_FOR_FN (cfun
, NUM_FIXED_BLOCKS
),
977 /* Traverse the basic block array placing edges. */
978 FOR_EACH_BB_FN (bb
, cfun
)
982 if (!bb_to_omp_idx
.is_empty ())
983 bb_to_omp_idx
[bb
->index
] = cur_omp_region_idx
;
985 mer
= make_edges_bb (bb
, &cur_region
, &cur_omp_region_idx
);
987 ab_edge_goto
.safe_push (bb
);
989 ab_edge_call
.safe_push (bb
);
991 if (cur_region
&& bb_to_omp_idx
.is_empty ())
992 bb_to_omp_idx
.safe_grow_cleared (n_basic_blocks_for_fn (cfun
), true);
995 /* Computed gotos are hell to deal with, especially if there are
996 lots of them with a large number of destinations. So we factor
997 them to a common computed goto location before we build the
998 edge list. After we convert back to normal form, we will un-factor
999 the computed gotos since factoring introduces an unwanted jump.
1000 For non-local gotos and abnormal edges from calls to calls that return
1001 twice or forced labels, factor the abnormal edges too, by having all
1002 abnormal edges from the calls go to a common artificial basic block
1003 with ABNORMAL_DISPATCHER internal call and abnormal edges from that
1004 basic block to all forced labels and calls returning twice.
1005 We do this per-OpenMP structured block, because those regions
1006 are guaranteed to be single entry single exit by the standard,
1007 so it is not allowed to enter or exit such regions abnormally this way,
1008 thus all computed gotos, non-local gotos and setjmp/longjmp calls
1009 must not transfer control across SESE region boundaries. */
1010 if (!ab_edge_goto
.is_empty () || !ab_edge_call
.is_empty ())
1012 gimple_stmt_iterator gsi
;
1013 basic_block dispatcher_bb_array
[2] = { NULL
, NULL
};
1014 basic_block
*dispatcher_bbs
= dispatcher_bb_array
;
1015 int count
= n_basic_blocks_for_fn (cfun
);
1017 if (!bb_to_omp_idx
.is_empty ())
1018 dispatcher_bbs
= XCNEWVEC (basic_block
, 2 * count
);
1020 FOR_EACH_BB_FN (bb
, cfun
)
1022 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
1024 glabel
*label_stmt
= dyn_cast
<glabel
*> (gsi_stmt (gsi
));
1030 target
= gimple_label_label (label_stmt
);
1032 /* Make an edge to every label block that has been marked as a
1033 potential target for a computed goto or a non-local goto. */
1034 if (FORCED_LABEL (target
))
1035 handle_abnormal_edges (dispatcher_bbs
, bb
, &ab_edge_goto
,
1037 if (DECL_NONLOCAL (target
))
1039 handle_abnormal_edges (dispatcher_bbs
, bb
, &ab_edge_call
,
1045 if (!gsi_end_p (gsi
) && is_gimple_debug (gsi_stmt (gsi
)))
1046 gsi_next_nondebug (&gsi
);
1047 if (!gsi_end_p (gsi
))
1049 /* Make an edge to every setjmp-like call. */
1050 gimple
*call_stmt
= gsi_stmt (gsi
);
1051 if (is_gimple_call (call_stmt
)
1052 && ((gimple_call_flags (call_stmt
) & ECF_RETURNS_TWICE
)
1053 || gimple_call_builtin_p (call_stmt
,
1054 BUILT_IN_SETJMP_RECEIVER
)))
1055 handle_abnormal_edges (dispatcher_bbs
, bb
, &ab_edge_call
,
1060 if (!bb_to_omp_idx
.is_empty ())
1061 XDELETE (dispatcher_bbs
);
1064 omp_free_regions ();
1067 /* Add SEQ after GSI. Start new bb after GSI, and created further bbs as
1068 needed. Returns true if new bbs were created.
1069 Note: This is transitional code, and should not be used for new code. We
1070 should be able to get rid of this by rewriting all target va-arg
1071 gimplification hooks to use an interface gimple_build_cond_value as described
1072 in https://gcc.gnu.org/ml/gcc-patches/2015-02/msg01194.html. */
1075 gimple_find_sub_bbs (gimple_seq seq
, gimple_stmt_iterator
*gsi
)
1077 gimple
*stmt
= gsi_stmt (*gsi
);
1078 basic_block bb
= gimple_bb (stmt
);
1079 basic_block lastbb
, afterbb
;
1080 int old_num_bbs
= n_basic_blocks_for_fn (cfun
);
1082 lastbb
= make_blocks_1 (seq
, bb
);
1083 if (old_num_bbs
== n_basic_blocks_for_fn (cfun
))
1085 e
= split_block (bb
, stmt
);
1086 /* Move e->dest to come after the new basic blocks. */
1088 unlink_block (afterbb
);
1089 link_block (afterbb
, lastbb
);
1090 redirect_edge_succ (e
, bb
->next_bb
);
1092 while (bb
!= afterbb
)
1094 struct omp_region
*cur_region
= NULL
;
1095 profile_count cnt
= profile_count::zero ();
1098 int cur_omp_region_idx
= 0;
1099 int mer
= make_edges_bb (bb
, &cur_region
, &cur_omp_region_idx
);
1100 gcc_assert (!mer
&& !cur_region
);
1101 add_bb_to_loop (bb
, afterbb
->loop_father
);
1105 FOR_EACH_EDGE (e
, ei
, bb
->preds
)
1107 if (e
->count ().initialized_p ())
1112 tree_guess_outgoing_edge_probabilities (bb
);
1113 if (all
|| profile_status_for_fn (cfun
) == PROFILE_READ
)
1121 /* Find the next available discriminator value for LOCUS. The
1122 discriminator distinguishes among several basic blocks that
1123 share a common locus, allowing for more accurate sample-based
1127 next_discriminator_for_locus (int line
)
1129 struct locus_discrim_map item
;
1130 struct locus_discrim_map
**slot
;
1132 item
.location_line
= line
;
1133 item
.discriminator
= 0;
1134 slot
= discriminator_per_locus
->find_slot_with_hash (&item
, line
, INSERT
);
1136 if (*slot
== HTAB_EMPTY_ENTRY
)
1138 *slot
= XNEW (struct locus_discrim_map
);
1140 (*slot
)->location_line
= line
;
1141 (*slot
)->discriminator
= 0;
1143 (*slot
)->discriminator
++;
1144 return (*slot
)->discriminator
;
1147 /* Return TRUE if LOCUS1 and LOCUS2 refer to the same source line. */
1150 same_line_p (location_t locus1
, expanded_location
*from
, location_t locus2
)
1152 expanded_location to
;
1154 if (locus1
== locus2
)
1157 to
= expand_location (locus2
);
1159 if (from
->line
!= to
.line
)
1161 if (from
->file
== to
.file
)
1163 return (from
->file
!= NULL
1165 && filename_cmp (from
->file
, to
.file
) == 0);
1168 /* Assign discriminators to each basic block. */
1171 assign_discriminators (void)
1175 FOR_EACH_BB_FN (bb
, cfun
)
1179 gimple
*last
= last_stmt (bb
);
1180 location_t locus
= last
? gimple_location (last
) : UNKNOWN_LOCATION
;
1182 if (locus
== UNKNOWN_LOCATION
)
1185 expanded_location locus_e
= expand_location (locus
);
1187 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
1189 gimple
*first
= first_non_label_stmt (e
->dest
);
1190 gimple
*last
= last_stmt (e
->dest
);
1191 if ((first
&& same_line_p (locus
, &locus_e
,
1192 gimple_location (first
)))
1193 || (last
&& same_line_p (locus
, &locus_e
,
1194 gimple_location (last
))))
1196 if (e
->dest
->discriminator
!= 0 && bb
->discriminator
== 0)
1198 = next_discriminator_for_locus (locus_e
.line
);
1200 e
->dest
->discriminator
1201 = next_discriminator_for_locus (locus_e
.line
);
1207 /* Create the edges for a GIMPLE_COND starting at block BB. */
1210 make_cond_expr_edges (basic_block bb
)
1212 gcond
*entry
= as_a
<gcond
*> (last_stmt (bb
));
1213 gimple
*then_stmt
, *else_stmt
;
1214 basic_block then_bb
, else_bb
;
1215 tree then_label
, else_label
;
1219 gcc_assert (gimple_code (entry
) == GIMPLE_COND
);
1221 /* Entry basic blocks for each component. */
1222 then_label
= gimple_cond_true_label (entry
);
1223 else_label
= gimple_cond_false_label (entry
);
1224 then_bb
= label_to_block (cfun
, then_label
);
1225 else_bb
= label_to_block (cfun
, else_label
);
1226 then_stmt
= first_stmt (then_bb
);
1227 else_stmt
= first_stmt (else_bb
);
1229 e
= make_edge (bb
, then_bb
, EDGE_TRUE_VALUE
);
1230 e
->goto_locus
= gimple_location (then_stmt
);
1231 e
= make_edge (bb
, else_bb
, EDGE_FALSE_VALUE
);
1233 e
->goto_locus
= gimple_location (else_stmt
);
1235 /* We do not need the labels anymore. */
1236 gimple_cond_set_true_label (entry
, NULL_TREE
);
1237 gimple_cond_set_false_label (entry
, NULL_TREE
);
1241 /* Called for each element in the hash table (P) as we delete the
1242 edge to cases hash table.
1244 Clear all the CASE_CHAINs to prevent problems with copying of
1245 SWITCH_EXPRs and structure sharing rules, then free the hash table
1249 edge_to_cases_cleanup (edge
const &, tree
const &value
, void *)
1253 for (t
= value
; t
; t
= next
)
1255 next
= CASE_CHAIN (t
);
1256 CASE_CHAIN (t
) = NULL
;
1262 /* Start recording information mapping edges to case labels. */
1265 start_recording_case_labels (void)
1267 gcc_assert (edge_to_cases
== NULL
);
1268 edge_to_cases
= new hash_map
<edge
, tree
>;
1269 touched_switch_bbs
= BITMAP_ALLOC (NULL
);
1272 /* Return nonzero if we are recording information for case labels. */
1275 recording_case_labels_p (void)
1277 return (edge_to_cases
!= NULL
);
1280 /* Stop recording information mapping edges to case labels and
1281 remove any information we have recorded. */
1283 end_recording_case_labels (void)
1287 edge_to_cases
->traverse
<void *, edge_to_cases_cleanup
> (NULL
);
1288 delete edge_to_cases
;
1289 edge_to_cases
= NULL
;
1290 EXECUTE_IF_SET_IN_BITMAP (touched_switch_bbs
, 0, i
, bi
)
1292 basic_block bb
= BASIC_BLOCK_FOR_FN (cfun
, i
);
1295 gimple
*stmt
= last_stmt (bb
);
1296 if (stmt
&& gimple_code (stmt
) == GIMPLE_SWITCH
)
1297 group_case_labels_stmt (as_a
<gswitch
*> (stmt
));
1300 BITMAP_FREE (touched_switch_bbs
);
1303 /* If we are inside a {start,end}_recording_cases block, then return
1304 a chain of CASE_LABEL_EXPRs from T which reference E.
1306 Otherwise return NULL. */
1309 get_cases_for_edge (edge e
, gswitch
*t
)
1314 /* If we are not recording cases, then we do not have CASE_LABEL_EXPR
1315 chains available. Return NULL so the caller can detect this case. */
1316 if (!recording_case_labels_p ())
1319 slot
= edge_to_cases
->get (e
);
1323 /* If we did not find E in the hash table, then this must be the first
1324 time we have been queried for information about E & T. Add all the
1325 elements from T to the hash table then perform the query again. */
1327 n
= gimple_switch_num_labels (t
);
1328 for (i
= 0; i
< n
; i
++)
1330 tree elt
= gimple_switch_label (t
, i
);
1331 tree lab
= CASE_LABEL (elt
);
1332 basic_block label_bb
= label_to_block (cfun
, lab
);
1333 edge this_edge
= find_edge (e
->src
, label_bb
);
1335 /* Add it to the chain of CASE_LABEL_EXPRs referencing E, or create
1337 tree
&s
= edge_to_cases
->get_or_insert (this_edge
);
1338 CASE_CHAIN (elt
) = s
;
1342 return *edge_to_cases
->get (e
);
1345 /* Create the edges for a GIMPLE_SWITCH starting at block BB. */
1348 make_gimple_switch_edges (gswitch
*entry
, basic_block bb
)
1352 n
= gimple_switch_num_labels (entry
);
1354 for (i
= 0; i
< n
; ++i
)
1356 basic_block label_bb
= gimple_switch_label_bb (cfun
, entry
, i
);
1357 make_edge (bb
, label_bb
, 0);
1362 /* Return the basic block holding label DEST. */
1365 label_to_block (struct function
*ifun
, tree dest
)
1367 int uid
= LABEL_DECL_UID (dest
);
1369 /* We would die hard when faced by an undefined label. Emit a label to
1370 the very first basic block. This will hopefully make even the dataflow
1371 and undefined variable warnings quite right. */
1372 if (seen_error () && uid
< 0)
1374 gimple_stmt_iterator gsi
=
1375 gsi_start_bb (BASIC_BLOCK_FOR_FN (cfun
, NUM_FIXED_BLOCKS
));
1378 stmt
= gimple_build_label (dest
);
1379 gsi_insert_before (&gsi
, stmt
, GSI_NEW_STMT
);
1380 uid
= LABEL_DECL_UID (dest
);
1382 if (vec_safe_length (ifun
->cfg
->x_label_to_block_map
) <= (unsigned int) uid
)
1384 return (*ifun
->cfg
->x_label_to_block_map
)[uid
];
1387 /* Create edges for a goto statement at block BB. Returns true
1388 if abnormal edges should be created. */
1391 make_goto_expr_edges (basic_block bb
)
1393 gimple_stmt_iterator last
= gsi_last_bb (bb
);
1394 gimple
*goto_t
= gsi_stmt (last
);
1396 /* A simple GOTO creates normal edges. */
1397 if (simple_goto_p (goto_t
))
1399 tree dest
= gimple_goto_dest (goto_t
);
1400 basic_block label_bb
= label_to_block (cfun
, dest
);
1401 edge e
= make_edge (bb
, label_bb
, EDGE_FALLTHRU
);
1402 e
->goto_locus
= gimple_location (goto_t
);
1403 gsi_remove (&last
, true);
1407 /* A computed GOTO creates abnormal edges. */
1411 /* Create edges for an asm statement with labels at block BB. */
1414 make_gimple_asm_edges (basic_block bb
)
1416 gasm
*stmt
= as_a
<gasm
*> (last_stmt (bb
));
1417 int i
, n
= gimple_asm_nlabels (stmt
);
1419 for (i
= 0; i
< n
; ++i
)
1421 tree label
= TREE_VALUE (gimple_asm_label_op (stmt
, i
));
1422 basic_block label_bb
= label_to_block (cfun
, label
);
1423 make_edge (bb
, label_bb
, 0);
1427 /*---------------------------------------------------------------------------
1429 ---------------------------------------------------------------------------*/
1431 /* Cleanup useless labels in basic blocks. This is something we wish
1432 to do early because it allows us to group case labels before creating
1433 the edges for the CFG, and it speeds up block statement iterators in
1434 all passes later on.
1435 We rerun this pass after CFG is created, to get rid of the labels that
1436 are no longer referenced. After then we do not run it any more, since
1437 (almost) no new labels should be created. */
1439 /* A map from basic block index to the leading label of that block. */
1445 /* True if the label is referenced from somewhere. */
1449 /* Given LABEL return the first label in the same basic block. */
1452 main_block_label (tree label
, label_record
*label_for_bb
)
1454 basic_block bb
= label_to_block (cfun
, label
);
1455 tree main_label
= label_for_bb
[bb
->index
].label
;
1457 /* label_to_block possibly inserted undefined label into the chain. */
1460 label_for_bb
[bb
->index
].label
= label
;
1464 label_for_bb
[bb
->index
].used
= true;
1468 /* Clean up redundant labels within the exception tree. */
1471 cleanup_dead_labels_eh (label_record
*label_for_bb
)
1478 if (cfun
->eh
== NULL
)
1481 for (i
= 1; vec_safe_iterate (cfun
->eh
->lp_array
, i
, &lp
); ++i
)
1482 if (lp
&& lp
->post_landing_pad
)
1484 lab
= main_block_label (lp
->post_landing_pad
, label_for_bb
);
1485 if (lab
!= lp
->post_landing_pad
)
1487 EH_LANDING_PAD_NR (lp
->post_landing_pad
) = 0;
1488 lp
->post_landing_pad
= lab
;
1489 EH_LANDING_PAD_NR (lab
) = lp
->index
;
1493 FOR_ALL_EH_REGION (r
)
1497 case ERT_MUST_NOT_THROW
:
1503 for (c
= r
->u
.eh_try
.first_catch
; c
; c
= c
->next_catch
)
1507 c
->label
= main_block_label (lab
, label_for_bb
);
1512 case ERT_ALLOWED_EXCEPTIONS
:
1513 lab
= r
->u
.allowed
.label
;
1515 r
->u
.allowed
.label
= main_block_label (lab
, label_for_bb
);
1521 /* Cleanup redundant labels. This is a three-step process:
1522 1) Find the leading label for each block.
1523 2) Redirect all references to labels to the leading labels.
1524 3) Cleanup all useless labels. */
1527 cleanup_dead_labels (void)
1530 label_record
*label_for_bb
= XCNEWVEC (struct label_record
,
1531 last_basic_block_for_fn (cfun
));
1533 /* Find a suitable label for each block. We use the first user-defined
1534 label if there is one, or otherwise just the first label we see. */
1535 FOR_EACH_BB_FN (bb
, cfun
)
1537 gimple_stmt_iterator i
;
1539 for (i
= gsi_start_bb (bb
); !gsi_end_p (i
); gsi_next (&i
))
1542 glabel
*label_stmt
= dyn_cast
<glabel
*> (gsi_stmt (i
));
1547 label
= gimple_label_label (label_stmt
);
1549 /* If we have not yet seen a label for the current block,
1550 remember this one and see if there are more labels. */
1551 if (!label_for_bb
[bb
->index
].label
)
1553 label_for_bb
[bb
->index
].label
= label
;
1557 /* If we did see a label for the current block already, but it
1558 is an artificially created label, replace it if the current
1559 label is a user defined label. */
1560 if (!DECL_ARTIFICIAL (label
)
1561 && DECL_ARTIFICIAL (label_for_bb
[bb
->index
].label
))
1563 label_for_bb
[bb
->index
].label
= label
;
1569 /* Now redirect all jumps/branches to the selected label.
1570 First do so for each block ending in a control statement. */
1571 FOR_EACH_BB_FN (bb
, cfun
)
1573 gimple
*stmt
= last_stmt (bb
);
1574 tree label
, new_label
;
1579 switch (gimple_code (stmt
))
1583 gcond
*cond_stmt
= as_a
<gcond
*> (stmt
);
1584 label
= gimple_cond_true_label (cond_stmt
);
1587 new_label
= main_block_label (label
, label_for_bb
);
1588 if (new_label
!= label
)
1589 gimple_cond_set_true_label (cond_stmt
, new_label
);
1592 label
= gimple_cond_false_label (cond_stmt
);
1595 new_label
= main_block_label (label
, label_for_bb
);
1596 if (new_label
!= label
)
1597 gimple_cond_set_false_label (cond_stmt
, new_label
);
1604 gswitch
*switch_stmt
= as_a
<gswitch
*> (stmt
);
1605 size_t i
, n
= gimple_switch_num_labels (switch_stmt
);
1607 /* Replace all destination labels. */
1608 for (i
= 0; i
< n
; ++i
)
1610 tree case_label
= gimple_switch_label (switch_stmt
, i
);
1611 label
= CASE_LABEL (case_label
);
1612 new_label
= main_block_label (label
, label_for_bb
);
1613 if (new_label
!= label
)
1614 CASE_LABEL (case_label
) = new_label
;
1621 gasm
*asm_stmt
= as_a
<gasm
*> (stmt
);
1622 int i
, n
= gimple_asm_nlabels (asm_stmt
);
1624 for (i
= 0; i
< n
; ++i
)
1626 tree cons
= gimple_asm_label_op (asm_stmt
, i
);
1627 tree label
= main_block_label (TREE_VALUE (cons
), label_for_bb
);
1628 TREE_VALUE (cons
) = label
;
1633 /* We have to handle gotos until they're removed, and we don't
1634 remove them until after we've created the CFG edges. */
1636 if (!computed_goto_p (stmt
))
1638 ggoto
*goto_stmt
= as_a
<ggoto
*> (stmt
);
1639 label
= gimple_goto_dest (goto_stmt
);
1640 new_label
= main_block_label (label
, label_for_bb
);
1641 if (new_label
!= label
)
1642 gimple_goto_set_dest (goto_stmt
, new_label
);
1646 case GIMPLE_TRANSACTION
:
1648 gtransaction
*txn
= as_a
<gtransaction
*> (stmt
);
1650 label
= gimple_transaction_label_norm (txn
);
1653 new_label
= main_block_label (label
, label_for_bb
);
1654 if (new_label
!= label
)
1655 gimple_transaction_set_label_norm (txn
, new_label
);
1658 label
= gimple_transaction_label_uninst (txn
);
1661 new_label
= main_block_label (label
, label_for_bb
);
1662 if (new_label
!= label
)
1663 gimple_transaction_set_label_uninst (txn
, new_label
);
1666 label
= gimple_transaction_label_over (txn
);
1669 new_label
= main_block_label (label
, label_for_bb
);
1670 if (new_label
!= label
)
1671 gimple_transaction_set_label_over (txn
, new_label
);
1681 /* Do the same for the exception region tree labels. */
1682 cleanup_dead_labels_eh (label_for_bb
);
1684 /* Finally, purge dead labels. All user-defined labels and labels that
1685 can be the target of non-local gotos and labels which have their
1686 address taken are preserved. */
1687 FOR_EACH_BB_FN (bb
, cfun
)
1689 gimple_stmt_iterator i
;
1690 tree label_for_this_bb
= label_for_bb
[bb
->index
].label
;
1692 if (!label_for_this_bb
)
1695 /* If the main label of the block is unused, we may still remove it. */
1696 if (!label_for_bb
[bb
->index
].used
)
1697 label_for_this_bb
= NULL
;
1699 for (i
= gsi_start_bb (bb
); !gsi_end_p (i
); )
1702 glabel
*label_stmt
= dyn_cast
<glabel
*> (gsi_stmt (i
));
1707 label
= gimple_label_label (label_stmt
);
1709 if (label
== label_for_this_bb
1710 || !DECL_ARTIFICIAL (label
)
1711 || DECL_NONLOCAL (label
)
1712 || FORCED_LABEL (label
))
1716 gcc_checking_assert (EH_LANDING_PAD_NR (label
) == 0);
1717 gsi_remove (&i
, true);
1722 free (label_for_bb
);
1725 /* Scan the sorted vector of cases in STMT (a GIMPLE_SWITCH) and combine
1726 the ones jumping to the same label.
1727 Eg. three separate entries 1: 2: 3: become one entry 1..3: */
1730 group_case_labels_stmt (gswitch
*stmt
)
1732 int old_size
= gimple_switch_num_labels (stmt
);
1733 int i
, next_index
, new_size
;
1734 basic_block default_bb
= NULL
;
1735 hash_set
<tree
> *removed_labels
= NULL
;
1737 default_bb
= gimple_switch_default_bb (cfun
, stmt
);
1739 /* Look for possible opportunities to merge cases. */
1741 while (i
< old_size
)
1743 tree base_case
, base_high
;
1744 basic_block base_bb
;
1746 base_case
= gimple_switch_label (stmt
, i
);
1748 gcc_assert (base_case
);
1749 base_bb
= label_to_block (cfun
, CASE_LABEL (base_case
));
1751 /* Discard cases that have the same destination as the default case or
1752 whose destination blocks have already been removed as unreachable. */
1754 || base_bb
== default_bb
1756 && removed_labels
->contains (CASE_LABEL (base_case
))))
1762 base_high
= CASE_HIGH (base_case
)
1763 ? CASE_HIGH (base_case
)
1764 : CASE_LOW (base_case
);
1767 /* Try to merge case labels. Break out when we reach the end
1768 of the label vector or when we cannot merge the next case
1769 label with the current one. */
1770 while (next_index
< old_size
)
1772 tree merge_case
= gimple_switch_label (stmt
, next_index
);
1773 basic_block merge_bb
= label_to_block (cfun
, CASE_LABEL (merge_case
));
1774 wide_int bhp1
= wi::to_wide (base_high
) + 1;
1776 /* Merge the cases if they jump to the same place,
1777 and their ranges are consecutive. */
1778 if (merge_bb
== base_bb
1779 && (removed_labels
== NULL
1780 || !removed_labels
->contains (CASE_LABEL (merge_case
)))
1781 && wi::to_wide (CASE_LOW (merge_case
)) == bhp1
)
1784 = (CASE_HIGH (merge_case
)
1785 ? CASE_HIGH (merge_case
) : CASE_LOW (merge_case
));
1786 CASE_HIGH (base_case
) = base_high
;
1793 /* Discard cases that have an unreachable destination block. */
1794 if (EDGE_COUNT (base_bb
->succs
) == 0
1795 && gimple_seq_unreachable_p (bb_seq (base_bb
))
1796 /* Don't optimize this if __builtin_unreachable () is the
1797 implicitly added one by the C++ FE too early, before
1798 -Wreturn-type can be diagnosed. We'll optimize it later
1799 during switchconv pass or any other cfg cleanup. */
1800 && (gimple_in_ssa_p (cfun
)
1801 || (LOCATION_LOCUS (gimple_location (last_stmt (base_bb
)))
1802 != BUILTINS_LOCATION
)))
1804 edge base_edge
= find_edge (gimple_bb (stmt
), base_bb
);
1805 if (base_edge
!= NULL
)
1807 for (gimple_stmt_iterator gsi
= gsi_start_bb (base_bb
);
1808 !gsi_end_p (gsi
); gsi_next (&gsi
))
1809 if (glabel
*stmt
= dyn_cast
<glabel
*> (gsi_stmt (gsi
)))
1811 if (FORCED_LABEL (gimple_label_label (stmt
))
1812 || DECL_NONLOCAL (gimple_label_label (stmt
)))
1814 /* Forced/non-local labels aren't going to be removed,
1815 but they will be moved to some neighbouring basic
1816 block. If some later case label refers to one of
1817 those labels, we should throw that case away rather
1818 than keeping it around and refering to some random
1819 other basic block without an edge to it. */
1820 if (removed_labels
== NULL
)
1821 removed_labels
= new hash_set
<tree
>;
1822 removed_labels
->add (gimple_label_label (stmt
));
1827 remove_edge_and_dominated_blocks (base_edge
);
1834 gimple_switch_set_label (stmt
, new_size
,
1835 gimple_switch_label (stmt
, i
));
1840 gcc_assert (new_size
<= old_size
);
1842 if (new_size
< old_size
)
1843 gimple_switch_set_num_labels (stmt
, new_size
);
1845 delete removed_labels
;
1846 return new_size
< old_size
;
1849 /* Look for blocks ending in a multiway branch (a GIMPLE_SWITCH),
1850 and scan the sorted vector of cases. Combine the ones jumping to the
1854 group_case_labels (void)
1857 bool changed
= false;
1859 FOR_EACH_BB_FN (bb
, cfun
)
1861 gimple
*stmt
= last_stmt (bb
);
1862 if (stmt
&& gimple_code (stmt
) == GIMPLE_SWITCH
)
1863 changed
|= group_case_labels_stmt (as_a
<gswitch
*> (stmt
));
1869 /* Checks whether we can merge block B into block A. */
1872 gimple_can_merge_blocks_p (basic_block a
, basic_block b
)
1876 if (!single_succ_p (a
))
1879 if (single_succ_edge (a
)->flags
& EDGE_COMPLEX
)
1882 if (single_succ (a
) != b
)
1885 if (!single_pred_p (b
))
1888 if (a
== ENTRY_BLOCK_PTR_FOR_FN (cfun
)
1889 || b
== EXIT_BLOCK_PTR_FOR_FN (cfun
))
1892 /* If A ends by a statement causing exceptions or something similar, we
1893 cannot merge the blocks. */
1894 stmt
= last_stmt (a
);
1895 if (stmt
&& stmt_ends_bb_p (stmt
))
1898 /* Do not allow a block with only a non-local label to be merged. */
1900 if (glabel
*label_stmt
= dyn_cast
<glabel
*> (stmt
))
1901 if (DECL_NONLOCAL (gimple_label_label (label_stmt
)))
1904 /* Examine the labels at the beginning of B. */
1905 for (gimple_stmt_iterator gsi
= gsi_start_bb (b
); !gsi_end_p (gsi
);
1909 glabel
*label_stmt
= dyn_cast
<glabel
*> (gsi_stmt (gsi
));
1912 lab
= gimple_label_label (label_stmt
);
1914 /* Do not remove user forced labels or for -O0 any user labels. */
1915 if (!DECL_ARTIFICIAL (lab
) && (!optimize
|| FORCED_LABEL (lab
)))
1919 /* Protect simple loop latches. We only want to avoid merging
1920 the latch with the loop header or with a block in another
1921 loop in this case. */
1923 && b
->loop_father
->latch
== b
1924 && loops_state_satisfies_p (LOOPS_HAVE_SIMPLE_LATCHES
)
1925 && (b
->loop_father
->header
== a
1926 || b
->loop_father
!= a
->loop_father
))
1929 /* It must be possible to eliminate all phi nodes in B. If ssa form
1930 is not up-to-date and a name-mapping is registered, we cannot eliminate
1931 any phis. Symbols marked for renaming are never a problem though. */
1932 for (gphi_iterator gsi
= gsi_start_phis (b
); !gsi_end_p (gsi
);
1935 gphi
*phi
= gsi
.phi ();
1936 /* Technically only new names matter. */
1937 if (name_registered_for_update_p (PHI_RESULT (phi
)))
1941 /* When not optimizing, don't merge if we'd lose goto_locus. */
1943 && single_succ_edge (a
)->goto_locus
!= UNKNOWN_LOCATION
)
1945 location_t goto_locus
= single_succ_edge (a
)->goto_locus
;
1946 gimple_stmt_iterator prev
, next
;
1947 prev
= gsi_last_nondebug_bb (a
);
1948 next
= gsi_after_labels (b
);
1949 if (!gsi_end_p (next
) && is_gimple_debug (gsi_stmt (next
)))
1950 gsi_next_nondebug (&next
);
1951 if ((gsi_end_p (prev
)
1952 || gimple_location (gsi_stmt (prev
)) != goto_locus
)
1953 && (gsi_end_p (next
)
1954 || gimple_location (gsi_stmt (next
)) != goto_locus
))
1961 /* Replaces all uses of NAME by VAL. */
1964 replace_uses_by (tree name
, tree val
)
1966 imm_use_iterator imm_iter
;
1971 FOR_EACH_IMM_USE_STMT (stmt
, imm_iter
, name
)
1973 /* Mark the block if we change the last stmt in it. */
1974 if (cfgcleanup_altered_bbs
1975 && stmt_ends_bb_p (stmt
))
1976 bitmap_set_bit (cfgcleanup_altered_bbs
, gimple_bb (stmt
)->index
);
1978 FOR_EACH_IMM_USE_ON_STMT (use
, imm_iter
)
1980 replace_exp (use
, val
);
1982 if (gimple_code (stmt
) == GIMPLE_PHI
)
1984 e
= gimple_phi_arg_edge (as_a
<gphi
*> (stmt
),
1985 PHI_ARG_INDEX_FROM_USE (use
));
1986 if (e
->flags
& EDGE_ABNORMAL
1987 && !SSA_NAME_OCCURS_IN_ABNORMAL_PHI (val
))
1989 /* This can only occur for virtual operands, since
1990 for the real ones SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name))
1991 would prevent replacement. */
1992 gcc_checking_assert (virtual_operand_p (name
));
1993 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (val
) = 1;
1998 if (gimple_code (stmt
) != GIMPLE_PHI
)
2000 gimple_stmt_iterator gsi
= gsi_for_stmt (stmt
);
2001 gimple
*orig_stmt
= stmt
;
2004 /* FIXME. It shouldn't be required to keep TREE_CONSTANT
2005 on ADDR_EXPRs up-to-date on GIMPLE. Propagation will
2006 only change sth from non-invariant to invariant, and only
2007 when propagating constants. */
2008 if (is_gimple_min_invariant (val
))
2009 for (i
= 0; i
< gimple_num_ops (stmt
); i
++)
2011 tree op
= gimple_op (stmt
, i
);
2012 /* Operands may be empty here. For example, the labels
2013 of a GIMPLE_COND are nulled out following the creation
2014 of the corresponding CFG edges. */
2015 if (op
&& TREE_CODE (op
) == ADDR_EXPR
)
2016 recompute_tree_invariant_for_addr_expr (op
);
2019 if (fold_stmt (&gsi
))
2020 stmt
= gsi_stmt (gsi
);
2022 if (maybe_clean_or_replace_eh_stmt (orig_stmt
, stmt
))
2023 gimple_purge_dead_eh_edges (gimple_bb (stmt
));
2029 gcc_checking_assert (has_zero_uses (name
));
2031 /* Also update the trees stored in loop structures. */
2034 for (auto loop
: loops_list (cfun
, 0))
2035 substitute_in_loop_info (loop
, name
, val
);
2039 /* Merge block B into block A. */
2042 gimple_merge_blocks (basic_block a
, basic_block b
)
2044 gimple_stmt_iterator last
, gsi
;
2048 fprintf (dump_file
, "Merging blocks %d and %d\n", a
->index
, b
->index
);
2050 /* Remove all single-valued PHI nodes from block B of the form
2051 V_i = PHI <V_j> by propagating V_j to all the uses of V_i. */
2052 gsi
= gsi_last_bb (a
);
2053 for (psi
= gsi_start_phis (b
); !gsi_end_p (psi
); )
2055 gimple
*phi
= gsi_stmt (psi
);
2056 tree def
= gimple_phi_result (phi
), use
= gimple_phi_arg_def (phi
, 0);
2058 bool may_replace_uses
= (virtual_operand_p (def
)
2059 || may_propagate_copy (def
, use
));
2061 /* In case we maintain loop closed ssa form, do not propagate arguments
2062 of loop exit phi nodes. */
2064 && loops_state_satisfies_p (LOOP_CLOSED_SSA
)
2065 && !virtual_operand_p (def
)
2066 && TREE_CODE (use
) == SSA_NAME
2067 && a
->loop_father
!= b
->loop_father
)
2068 may_replace_uses
= false;
2070 if (!may_replace_uses
)
2072 gcc_assert (!virtual_operand_p (def
));
2074 /* Note that just emitting the copies is fine -- there is no problem
2075 with ordering of phi nodes. This is because A is the single
2076 predecessor of B, therefore results of the phi nodes cannot
2077 appear as arguments of the phi nodes. */
2078 copy
= gimple_build_assign (def
, use
);
2079 gsi_insert_after (&gsi
, copy
, GSI_NEW_STMT
);
2080 remove_phi_node (&psi
, false);
2084 /* If we deal with a PHI for virtual operands, we can simply
2085 propagate these without fussing with folding or updating
2087 if (virtual_operand_p (def
))
2089 imm_use_iterator iter
;
2090 use_operand_p use_p
;
2093 FOR_EACH_IMM_USE_STMT (stmt
, iter
, def
)
2094 FOR_EACH_IMM_USE_ON_STMT (use_p
, iter
)
2095 SET_USE (use_p
, use
);
2097 if (SSA_NAME_OCCURS_IN_ABNORMAL_PHI (def
))
2098 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (use
) = 1;
2101 replace_uses_by (def
, use
);
2103 remove_phi_node (&psi
, true);
2107 /* Ensure that B follows A. */
2108 move_block_after (b
, a
);
2110 gcc_assert (single_succ_edge (a
)->flags
& EDGE_FALLTHRU
);
2111 gcc_assert (!last_stmt (a
) || !stmt_ends_bb_p (last_stmt (a
)));
2113 /* Remove labels from B and set gimple_bb to A for other statements. */
2114 for (gsi
= gsi_start_bb (b
); !gsi_end_p (gsi
);)
2116 gimple
*stmt
= gsi_stmt (gsi
);
2117 if (glabel
*label_stmt
= dyn_cast
<glabel
*> (stmt
))
2119 tree label
= gimple_label_label (label_stmt
);
2122 gsi_remove (&gsi
, false);
2124 /* Now that we can thread computed gotos, we might have
2125 a situation where we have a forced label in block B
2126 However, the label at the start of block B might still be
2127 used in other ways (think about the runtime checking for
2128 Fortran assigned gotos). So we cannot just delete the
2129 label. Instead we move the label to the start of block A. */
2130 if (FORCED_LABEL (label
))
2132 gimple_stmt_iterator dest_gsi
= gsi_start_bb (a
);
2133 tree first_label
= NULL_TREE
;
2134 if (!gsi_end_p (dest_gsi
))
2135 if (glabel
*first_label_stmt
2136 = dyn_cast
<glabel
*> (gsi_stmt (dest_gsi
)))
2137 first_label
= gimple_label_label (first_label_stmt
);
2139 && (DECL_NONLOCAL (first_label
)
2140 || EH_LANDING_PAD_NR (first_label
) != 0))
2141 gsi_insert_after (&dest_gsi
, stmt
, GSI_NEW_STMT
);
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 class 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.cc 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 if ((unsigned) bb
->index
< bb_to_omp_idx
.length ()
2311 && ((unsigned) new_bb
->index
>= bb_to_omp_idx
.length ()
2312 || (bb_to_omp_idx
[bb
->index
]
2313 != bb_to_omp_idx
[new_bb
->index
])))
2315 /* During cfg pass make sure to put orphaned labels
2316 into the right OMP region. */
2320 FOR_EACH_VEC_ELT (bb_to_omp_idx
, i
, idx
)
2321 if (i
>= NUM_FIXED_BLOCKS
2322 && idx
== bb_to_omp_idx
[bb
->index
]
2323 && i
!= (unsigned) bb
->index
)
2325 new_bb
= BASIC_BLOCK_FOR_FN (cfun
, i
);
2330 new_bb
= single_succ (ENTRY_BLOCK_PTR_FOR_FN (cfun
));
2331 gcc_assert (new_bb
!= bb
);
2334 new_gsi
= gsi_after_labels (new_bb
);
2335 gsi_remove (&i
, false);
2336 gsi_insert_before (&new_gsi
, stmt
, GSI_NEW_STMT
);
2340 /* Release SSA definitions. */
2341 release_defs (stmt
);
2342 gsi_remove (&i
, true);
2346 i
= gsi_last_bb (bb
);
2352 if ((unsigned) bb
->index
< bb_to_omp_idx
.length ())
2353 bb_to_omp_idx
[bb
->index
] = -1;
2354 remove_phi_nodes_and_edges_for_unreachable_block (bb
);
2355 bb
->il
.gimple
.seq
= NULL
;
2356 bb
->il
.gimple
.phi_nodes
= NULL
;
2360 /* Given a basic block BB and a value VAL for use in the final statement
2361 of the block (if a GIMPLE_COND, GIMPLE_SWITCH, or computed goto), return
2362 the edge that will be taken out of the block.
2363 If VAL is NULL_TREE, then the current value of the final statement's
2364 predicate or index is used.
2365 If the value does not match a unique edge, NULL is returned. */
2368 find_taken_edge (basic_block bb
, tree val
)
2372 stmt
= last_stmt (bb
);
2374 /* Handle ENTRY and EXIT. */
2378 if (gimple_code (stmt
) == GIMPLE_COND
)
2379 return find_taken_edge_cond_expr (as_a
<gcond
*> (stmt
), val
);
2381 if (gimple_code (stmt
) == GIMPLE_SWITCH
)
2382 return find_taken_edge_switch_expr (as_a
<gswitch
*> (stmt
), val
);
2384 if (computed_goto_p (stmt
))
2386 /* Only optimize if the argument is a label, if the argument is
2387 not a label then we cannot construct a proper CFG.
2389 It may be the case that we only need to allow the LABEL_REF to
2390 appear inside an ADDR_EXPR, but we also allow the LABEL_REF to
2391 appear inside a LABEL_EXPR just to be safe. */
2393 && (TREE_CODE (val
) == ADDR_EXPR
|| TREE_CODE (val
) == LABEL_EXPR
)
2394 && TREE_CODE (TREE_OPERAND (val
, 0)) == LABEL_DECL
)
2395 return find_taken_edge_computed_goto (bb
, TREE_OPERAND (val
, 0));
2398 /* Otherwise we only know the taken successor edge if it's unique. */
2399 return single_succ_p (bb
) ? single_succ_edge (bb
) : NULL
;
2402 /* Given a constant value VAL and the entry block BB to a GOTO_EXPR
2403 statement, determine which of the outgoing edges will be taken out of the
2404 block. Return NULL if either edge may be taken. */
2407 find_taken_edge_computed_goto (basic_block bb
, tree val
)
2412 dest
= label_to_block (cfun
, val
);
2414 e
= find_edge (bb
, dest
);
2416 /* It's possible for find_edge to return NULL here on invalid code
2417 that abuses the labels-as-values extension (e.g. code that attempts to
2418 jump *between* functions via stored labels-as-values; PR 84136).
2419 If so, then we simply return that NULL for the edge.
2420 We don't currently have a way of detecting such invalid code, so we
2421 can't assert that it was the case when a NULL edge occurs here. */
2426 /* Given COND_STMT and a constant value VAL for use as the predicate,
2427 determine which of the two edges will be taken out of
2428 the statement's block. Return NULL if either edge may be taken.
2429 If VAL is NULL_TREE, then the current value of COND_STMT's predicate
2433 find_taken_edge_cond_expr (const gcond
*cond_stmt
, tree val
)
2435 edge true_edge
, false_edge
;
2437 if (val
== NULL_TREE
)
2439 /* Use the current value of the predicate. */
2440 if (gimple_cond_true_p (cond_stmt
))
2441 val
= integer_one_node
;
2442 else if (gimple_cond_false_p (cond_stmt
))
2443 val
= integer_zero_node
;
2447 else if (TREE_CODE (val
) != INTEGER_CST
)
2450 extract_true_false_edges_from_block (gimple_bb (cond_stmt
),
2451 &true_edge
, &false_edge
);
2453 return (integer_zerop (val
) ? false_edge
: true_edge
);
2456 /* Given SWITCH_STMT and an INTEGER_CST VAL for use as the index, determine
2457 which edge will be taken out of the statement's block. Return NULL if any
2459 If VAL is NULL_TREE, then the current value of SWITCH_STMT's index
2463 find_taken_edge_switch_expr (const gswitch
*switch_stmt
, tree val
)
2465 basic_block dest_bb
;
2469 if (gimple_switch_num_labels (switch_stmt
) == 1)
2470 taken_case
= gimple_switch_default_label (switch_stmt
);
2473 if (val
== NULL_TREE
)
2474 val
= gimple_switch_index (switch_stmt
);
2475 if (TREE_CODE (val
) != INTEGER_CST
)
2478 taken_case
= find_case_label_for_value (switch_stmt
, val
);
2480 dest_bb
= label_to_block (cfun
, CASE_LABEL (taken_case
));
2482 e
= find_edge (gimple_bb (switch_stmt
), dest_bb
);
2488 /* Return the CASE_LABEL_EXPR that SWITCH_STMT will take for VAL.
2489 We can make optimal use here of the fact that the case labels are
2490 sorted: We can do a binary search for a case matching VAL. */
2493 find_case_label_for_value (const gswitch
*switch_stmt
, tree val
)
2495 size_t low
, high
, n
= gimple_switch_num_labels (switch_stmt
);
2496 tree default_case
= gimple_switch_default_label (switch_stmt
);
2498 for (low
= 0, high
= n
; high
- low
> 1; )
2500 size_t i
= (high
+ low
) / 2;
2501 tree t
= gimple_switch_label (switch_stmt
, i
);
2504 /* Cache the result of comparing CASE_LOW and val. */
2505 cmp
= tree_int_cst_compare (CASE_LOW (t
), val
);
2512 if (CASE_HIGH (t
) == NULL
)
2514 /* A singe-valued case label. */
2520 /* A case range. We can only handle integer ranges. */
2521 if (cmp
<= 0 && tree_int_cst_compare (CASE_HIGH (t
), val
) >= 0)
2526 return default_case
;
2530 /* Dump a basic block on stderr. */
2533 gimple_debug_bb (basic_block bb
)
2535 dump_bb (stderr
, bb
, 0, TDF_VOPS
|TDF_MEMSYMS
|TDF_BLOCKS
);
2539 /* Dump basic block with index N on stderr. */
2542 gimple_debug_bb_n (int n
)
2544 gimple_debug_bb (BASIC_BLOCK_FOR_FN (cfun
, n
));
2545 return BASIC_BLOCK_FOR_FN (cfun
, n
);
2549 /* Dump the CFG on stderr.
2551 FLAGS are the same used by the tree dumping functions
2552 (see TDF_* in dumpfile.h). */
2555 gimple_debug_cfg (dump_flags_t flags
)
2557 gimple_dump_cfg (stderr
, flags
);
2561 /* Dump the program showing basic block boundaries on the given FILE.
2563 FLAGS are the same used by the tree dumping functions (see TDF_* in
2567 gimple_dump_cfg (FILE *file
, dump_flags_t flags
)
2569 if (flags
& TDF_DETAILS
)
2571 dump_function_header (file
, current_function_decl
, flags
);
2572 fprintf (file
, ";; \n%d basic blocks, %d edges, last basic block %d.\n\n",
2573 n_basic_blocks_for_fn (cfun
), n_edges_for_fn (cfun
),
2574 last_basic_block_for_fn (cfun
));
2576 brief_dump_cfg (file
, flags
);
2577 fprintf (file
, "\n");
2580 if (flags
& TDF_STATS
)
2581 dump_cfg_stats (file
);
2583 dump_function_to_file (current_function_decl
, file
, flags
| TDF_BLOCKS
);
2587 /* Dump CFG statistics on FILE. */
2590 dump_cfg_stats (FILE *file
)
2592 static long max_num_merged_labels
= 0;
2593 unsigned long size
, total
= 0;
2596 const char * const fmt_str
= "%-30s%-13s%12s\n";
2597 const char * const fmt_str_1
= "%-30s%13d" PRsa (11) "\n";
2598 const char * const fmt_str_2
= "%-30s%13ld" PRsa (11) "\n";
2599 const char * const fmt_str_3
= "%-43s" PRsa (11) "\n";
2600 const char *funcname
= current_function_name ();
2602 fprintf (file
, "\nCFG Statistics for %s\n\n", funcname
);
2604 fprintf (file
, "---------------------------------------------------------\n");
2605 fprintf (file
, fmt_str
, "", " Number of ", "Memory");
2606 fprintf (file
, fmt_str
, "", " instances ", "used ");
2607 fprintf (file
, "---------------------------------------------------------\n");
2609 size
= n_basic_blocks_for_fn (cfun
) * sizeof (struct basic_block_def
);
2611 fprintf (file
, fmt_str_1
, "Basic blocks", n_basic_blocks_for_fn (cfun
),
2612 SIZE_AMOUNT (size
));
2615 FOR_EACH_BB_FN (bb
, cfun
)
2616 num_edges
+= EDGE_COUNT (bb
->succs
);
2617 size
= num_edges
* sizeof (class edge_def
);
2619 fprintf (file
, fmt_str_2
, "Edges", num_edges
, SIZE_AMOUNT (size
));
2621 fprintf (file
, "---------------------------------------------------------\n");
2622 fprintf (file
, fmt_str_3
, "Total memory used by CFG data",
2623 SIZE_AMOUNT (total
));
2624 fprintf (file
, "---------------------------------------------------------\n");
2625 fprintf (file
, "\n");
2627 if (cfg_stats
.num_merged_labels
> max_num_merged_labels
)
2628 max_num_merged_labels
= cfg_stats
.num_merged_labels
;
2630 fprintf (file
, "Coalesced label blocks: %ld (Max so far: %ld)\n",
2631 cfg_stats
.num_merged_labels
, max_num_merged_labels
);
2633 fprintf (file
, "\n");
2637 /* Dump CFG statistics on stderr. Keep extern so that it's always
2638 linked in the final executable. */
2641 debug_cfg_stats (void)
2643 dump_cfg_stats (stderr
);
2646 /*---------------------------------------------------------------------------
2647 Miscellaneous helpers
2648 ---------------------------------------------------------------------------*/
2650 /* Return true if T, a GIMPLE_CALL, can make an abnormal transfer of control
2651 flow. Transfers of control flow associated with EH are excluded. */
2654 call_can_make_abnormal_goto (gimple
*t
)
2656 /* If the function has no non-local labels, then a call cannot make an
2657 abnormal transfer of control. */
2658 if (!cfun
->has_nonlocal_label
2659 && !cfun
->calls_setjmp
)
2662 /* Likewise if the call has no side effects. */
2663 if (!gimple_has_side_effects (t
))
2666 /* Likewise if the called function is leaf. */
2667 if (gimple_call_flags (t
) & ECF_LEAF
)
2674 /* Return true if T can make an abnormal transfer of control flow.
2675 Transfers of control flow associated with EH are excluded. */
2678 stmt_can_make_abnormal_goto (gimple
*t
)
2680 if (computed_goto_p (t
))
2682 if (is_gimple_call (t
))
2683 return call_can_make_abnormal_goto (t
);
2688 /* Return true if T represents a stmt that always transfers control. */
2691 is_ctrl_stmt (gimple
*t
)
2693 switch (gimple_code (t
))
2707 /* Return true if T is a statement that may alter the flow of control
2708 (e.g., a call to a non-returning function). */
2711 is_ctrl_altering_stmt (gimple
*t
)
2715 switch (gimple_code (t
))
2718 /* Per stmt call flag indicates whether the call could alter
2720 if (gimple_call_ctrl_altering_p (t
))
2724 case GIMPLE_EH_DISPATCH
:
2725 /* EH_DISPATCH branches to the individual catch handlers at
2726 this level of a try or allowed-exceptions region. It can
2727 fallthru to the next statement as well. */
2731 if (gimple_asm_nlabels (as_a
<gasm
*> (t
)) > 0)
2736 /* OpenMP directives alter control flow. */
2739 case GIMPLE_TRANSACTION
:
2740 /* A transaction start alters control flow. */
2747 /* If a statement can throw, it alters control flow. */
2748 return stmt_can_throw_internal (cfun
, t
);
2752 /* Return true if T is a simple local goto. */
2755 simple_goto_p (gimple
*t
)
2757 return (gimple_code (t
) == GIMPLE_GOTO
2758 && TREE_CODE (gimple_goto_dest (t
)) == LABEL_DECL
);
2762 /* Return true if STMT should start a new basic block. PREV_STMT is
2763 the statement preceding STMT. It is used when STMT is a label or a
2764 case label. Labels should only start a new basic block if their
2765 previous statement wasn't a label. Otherwise, sequence of labels
2766 would generate unnecessary basic blocks that only contain a single
2770 stmt_starts_bb_p (gimple
*stmt
, gimple
*prev_stmt
)
2775 /* PREV_STMT is only set to a debug stmt if the debug stmt is before
2776 any nondebug stmts in the block. We don't want to start another
2777 block in this case: the debug stmt will already have started the
2778 one STMT would start if we weren't outputting debug stmts. */
2779 if (prev_stmt
&& is_gimple_debug (prev_stmt
))
2782 /* Labels start a new basic block only if the preceding statement
2783 wasn't a label of the same type. This prevents the creation of
2784 consecutive blocks that have nothing but a single label. */
2785 if (glabel
*label_stmt
= dyn_cast
<glabel
*> (stmt
))
2787 /* Nonlocal and computed GOTO targets always start a new block. */
2788 if (DECL_NONLOCAL (gimple_label_label (label_stmt
))
2789 || FORCED_LABEL (gimple_label_label (label_stmt
)))
2792 if (glabel
*plabel
= safe_dyn_cast
<glabel
*> (prev_stmt
))
2794 if (DECL_NONLOCAL (gimple_label_label (plabel
))
2795 || !DECL_ARTIFICIAL (gimple_label_label (plabel
)))
2798 cfg_stats
.num_merged_labels
++;
2804 else if (gimple_code (stmt
) == GIMPLE_CALL
)
2806 if (gimple_call_flags (stmt
) & ECF_RETURNS_TWICE
)
2807 /* setjmp acts similar to a nonlocal GOTO target and thus should
2808 start a new block. */
2810 if (gimple_call_internal_p (stmt
, IFN_PHI
)
2812 && gimple_code (prev_stmt
) != GIMPLE_LABEL
2813 && (gimple_code (prev_stmt
) != GIMPLE_CALL
2814 || ! gimple_call_internal_p (prev_stmt
, IFN_PHI
)))
2815 /* PHI nodes start a new block unless preceeded by a label
2824 /* Return true if T should end a basic block. */
2827 stmt_ends_bb_p (gimple
*t
)
2829 return is_ctrl_stmt (t
) || is_ctrl_altering_stmt (t
);
2832 /* Remove block annotations and other data structures. */
2835 delete_tree_cfg_annotations (struct function
*fn
)
2837 vec_free (label_to_block_map_for_fn (fn
));
2840 /* Return the virtual phi in BB. */
2843 get_virtual_phi (basic_block bb
)
2845 for (gphi_iterator gsi
= gsi_start_phis (bb
);
2849 gphi
*phi
= gsi
.phi ();
2851 if (virtual_operand_p (PHI_RESULT (phi
)))
2858 /* Return the first statement in basic block BB. */
2861 first_stmt (basic_block bb
)
2863 gimple_stmt_iterator i
= gsi_start_bb (bb
);
2864 gimple
*stmt
= NULL
;
2866 while (!gsi_end_p (i
) && is_gimple_debug ((stmt
= gsi_stmt (i
))))
2874 /* Return the first non-label statement in basic block BB. */
2877 first_non_label_stmt (basic_block bb
)
2879 gimple_stmt_iterator i
= gsi_start_bb (bb
);
2880 while (!gsi_end_p (i
) && gimple_code (gsi_stmt (i
)) == GIMPLE_LABEL
)
2882 return !gsi_end_p (i
) ? gsi_stmt (i
) : NULL
;
2885 /* Return the last statement in basic block BB. */
2888 last_stmt (basic_block bb
)
2890 gimple_stmt_iterator i
= gsi_last_bb (bb
);
2891 gimple
*stmt
= NULL
;
2893 while (!gsi_end_p (i
) && is_gimple_debug ((stmt
= gsi_stmt (i
))))
2901 /* Return the last statement of an otherwise empty block. Return NULL
2902 if the block is totally empty, or if it contains more than one
2906 last_and_only_stmt (basic_block bb
)
2908 gimple_stmt_iterator i
= gsi_last_nondebug_bb (bb
);
2909 gimple
*last
, *prev
;
2914 last
= gsi_stmt (i
);
2915 gsi_prev_nondebug (&i
);
2919 /* Empty statements should no longer appear in the instruction stream.
2920 Everything that might have appeared before should be deleted by
2921 remove_useless_stmts, and the optimizers should just gsi_remove
2922 instead of smashing with build_empty_stmt.
2924 Thus the only thing that should appear here in a block containing
2925 one executable statement is a label. */
2926 prev
= gsi_stmt (i
);
2927 if (gimple_code (prev
) == GIMPLE_LABEL
)
2933 /* Returns the basic block after which the new basic block created
2934 by splitting edge EDGE_IN should be placed. Tries to keep the new block
2935 near its "logical" location. This is of most help to humans looking
2936 at debugging dumps. */
2939 split_edge_bb_loc (edge edge_in
)
2941 basic_block dest
= edge_in
->dest
;
2942 basic_block dest_prev
= dest
->prev_bb
;
2946 edge e
= find_edge (dest_prev
, dest
);
2947 if (e
&& !(e
->flags
& EDGE_COMPLEX
))
2948 return edge_in
->src
;
2953 /* Split a (typically critical) edge EDGE_IN. Return the new block.
2954 Abort on abnormal edges. */
2957 gimple_split_edge (edge edge_in
)
2959 basic_block new_bb
, after_bb
, dest
;
2962 /* Abnormal edges cannot be split. */
2963 gcc_assert (!(edge_in
->flags
& EDGE_ABNORMAL
));
2965 dest
= edge_in
->dest
;
2967 after_bb
= split_edge_bb_loc (edge_in
);
2969 new_bb
= create_empty_bb (after_bb
);
2970 new_bb
->count
= edge_in
->count ();
2972 /* We want to avoid re-allocating PHIs when we first
2973 add the fallthru edge from new_bb to dest but we also
2974 want to avoid changing PHI argument order when
2975 first redirecting edge_in away from dest. The former
2976 avoids changing PHI argument order by adding them
2977 last and then the redirection swapping it back into
2978 place by means of unordered remove.
2979 So hack around things by temporarily removing all PHIs
2980 from the destination during the edge redirection and then
2981 making sure the edges stay in order. */
2982 gimple_seq saved_phis
= phi_nodes (dest
);
2983 unsigned old_dest_idx
= edge_in
->dest_idx
;
2984 set_phi_nodes (dest
, NULL
);
2985 new_edge
= make_single_succ_edge (new_bb
, dest
, EDGE_FALLTHRU
);
2986 e
= redirect_edge_and_branch (edge_in
, new_bb
);
2987 gcc_assert (e
== edge_in
&& new_edge
->dest_idx
== old_dest_idx
);
2988 /* set_phi_nodes sets the BB of the PHI nodes, so do it manually here. */
2989 dest
->il
.gimple
.phi_nodes
= saved_phis
;
2995 /* Verify properties of the address expression T whose base should be
2996 TREE_ADDRESSABLE if VERIFY_ADDRESSABLE is true. */
2999 verify_address (tree t
, bool verify_addressable
)
3002 bool old_side_effects
;
3004 bool new_side_effects
;
3006 old_constant
= TREE_CONSTANT (t
);
3007 old_side_effects
= TREE_SIDE_EFFECTS (t
);
3009 recompute_tree_invariant_for_addr_expr (t
);
3010 new_side_effects
= TREE_SIDE_EFFECTS (t
);
3011 new_constant
= TREE_CONSTANT (t
);
3013 if (old_constant
!= new_constant
)
3015 error ("constant not recomputed when %<ADDR_EXPR%> changed");
3018 if (old_side_effects
!= new_side_effects
)
3020 error ("side effects not recomputed when %<ADDR_EXPR%> changed");
3024 tree base
= TREE_OPERAND (t
, 0);
3025 while (handled_component_p (base
))
3026 base
= TREE_OPERAND (base
, 0);
3029 || TREE_CODE (base
) == PARM_DECL
3030 || TREE_CODE (base
) == RESULT_DECL
))
3033 if (verify_addressable
&& !TREE_ADDRESSABLE (base
))
3035 error ("address taken but %<TREE_ADDRESSABLE%> bit not set");
3043 /* Verify if EXPR is a valid GIMPLE reference expression. If
3044 REQUIRE_LVALUE is true verifies it is an lvalue. Returns true
3045 if there is an error, otherwise false. */
3048 verify_types_in_gimple_reference (tree expr
, bool require_lvalue
)
3050 const char *code_name
= get_tree_code_name (TREE_CODE (expr
));
3052 if (TREE_CODE (expr
) == REALPART_EXPR
3053 || TREE_CODE (expr
) == IMAGPART_EXPR
3054 || TREE_CODE (expr
) == BIT_FIELD_REF
)
3056 tree op
= TREE_OPERAND (expr
, 0);
3057 if (!is_gimple_reg_type (TREE_TYPE (expr
)))
3059 error ("non-scalar %qs", code_name
);
3063 if (TREE_CODE (expr
) == BIT_FIELD_REF
)
3065 tree t1
= TREE_OPERAND (expr
, 1);
3066 tree t2
= TREE_OPERAND (expr
, 2);
3067 poly_uint64 size
, bitpos
;
3068 if (!poly_int_tree_p (t1
, &size
)
3069 || !poly_int_tree_p (t2
, &bitpos
)
3070 || !types_compatible_p (bitsizetype
, TREE_TYPE (t1
))
3071 || !types_compatible_p (bitsizetype
, TREE_TYPE (t2
)))
3073 error ("invalid position or size operand to %qs", code_name
);
3076 if (INTEGRAL_TYPE_P (TREE_TYPE (expr
))
3077 && maybe_ne (TYPE_PRECISION (TREE_TYPE (expr
)), size
))
3079 error ("integral result type precision does not match "
3080 "field size of %qs", code_name
);
3083 else if (!INTEGRAL_TYPE_P (TREE_TYPE (expr
))
3084 && TYPE_MODE (TREE_TYPE (expr
)) != BLKmode
3085 && maybe_ne (GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (expr
))),
3088 error ("mode size of non-integral result does not "
3089 "match field size of %qs",
3093 if (INTEGRAL_TYPE_P (TREE_TYPE (op
))
3094 && !type_has_mode_precision_p (TREE_TYPE (op
)))
3096 error ("%qs of non-mode-precision operand", code_name
);
3099 if (!AGGREGATE_TYPE_P (TREE_TYPE (op
))
3100 && maybe_gt (size
+ bitpos
,
3101 tree_to_poly_uint64 (TYPE_SIZE (TREE_TYPE (op
)))))
3103 error ("position plus size exceeds size of referenced object in "
3109 if ((TREE_CODE (expr
) == REALPART_EXPR
3110 || TREE_CODE (expr
) == IMAGPART_EXPR
)
3111 && !useless_type_conversion_p (TREE_TYPE (expr
),
3112 TREE_TYPE (TREE_TYPE (op
))))
3114 error ("type mismatch in %qs reference", code_name
);
3115 debug_generic_stmt (TREE_TYPE (expr
));
3116 debug_generic_stmt (TREE_TYPE (TREE_TYPE (op
)));
3122 while (handled_component_p (expr
))
3124 code_name
= get_tree_code_name (TREE_CODE (expr
));
3126 if (TREE_CODE (expr
) == REALPART_EXPR
3127 || TREE_CODE (expr
) == IMAGPART_EXPR
3128 || TREE_CODE (expr
) == BIT_FIELD_REF
)
3130 error ("non-top-level %qs", code_name
);
3134 tree op
= TREE_OPERAND (expr
, 0);
3136 if (TREE_CODE (expr
) == ARRAY_REF
3137 || TREE_CODE (expr
) == ARRAY_RANGE_REF
)
3139 if (!is_gimple_val (TREE_OPERAND (expr
, 1))
3140 || (TREE_OPERAND (expr
, 2)
3141 && !is_gimple_val (TREE_OPERAND (expr
, 2)))
3142 || (TREE_OPERAND (expr
, 3)
3143 && !is_gimple_val (TREE_OPERAND (expr
, 3))))
3145 error ("invalid operands to %qs", code_name
);
3146 debug_generic_stmt (expr
);
3151 /* Verify if the reference array element types are compatible. */
3152 if (TREE_CODE (expr
) == ARRAY_REF
3153 && !useless_type_conversion_p (TREE_TYPE (expr
),
3154 TREE_TYPE (TREE_TYPE (op
))))
3156 error ("type mismatch in %qs", code_name
);
3157 debug_generic_stmt (TREE_TYPE (expr
));
3158 debug_generic_stmt (TREE_TYPE (TREE_TYPE (op
)));
3161 if (TREE_CODE (expr
) == ARRAY_RANGE_REF
3162 && !useless_type_conversion_p (TREE_TYPE (TREE_TYPE (expr
)),
3163 TREE_TYPE (TREE_TYPE (op
))))
3165 error ("type mismatch in %qs", code_name
);
3166 debug_generic_stmt (TREE_TYPE (TREE_TYPE (expr
)));
3167 debug_generic_stmt (TREE_TYPE (TREE_TYPE (op
)));
3171 if (TREE_CODE (expr
) == COMPONENT_REF
)
3173 if (TREE_OPERAND (expr
, 2)
3174 && !is_gimple_val (TREE_OPERAND (expr
, 2)))
3176 error ("invalid %qs offset operator", code_name
);
3179 if (!useless_type_conversion_p (TREE_TYPE (expr
),
3180 TREE_TYPE (TREE_OPERAND (expr
, 1))))
3182 error ("type mismatch in %qs", code_name
);
3183 debug_generic_stmt (TREE_TYPE (expr
));
3184 debug_generic_stmt (TREE_TYPE (TREE_OPERAND (expr
, 1)));
3189 if (TREE_CODE (expr
) == VIEW_CONVERT_EXPR
)
3191 /* For VIEW_CONVERT_EXPRs which are allowed here too, we only check
3192 that their operand is not an SSA name or an invariant when
3193 requiring an lvalue (this usually means there is a SRA or IPA-SRA
3194 bug). Otherwise there is nothing to verify, gross mismatches at
3195 most invoke undefined behavior. */
3197 && (TREE_CODE (op
) == SSA_NAME
3198 || is_gimple_min_invariant (op
)))
3200 error ("conversion of %qs on the left hand side of %qs",
3201 get_tree_code_name (TREE_CODE (op
)), code_name
);
3202 debug_generic_stmt (expr
);
3205 else if (TREE_CODE (op
) == SSA_NAME
3206 && TYPE_SIZE (TREE_TYPE (expr
)) != TYPE_SIZE (TREE_TYPE (op
)))
3208 error ("conversion of register to a different size in %qs",
3210 debug_generic_stmt (expr
);
3213 else if (!handled_component_p (op
))
3220 code_name
= get_tree_code_name (TREE_CODE (expr
));
3222 if (TREE_CODE (expr
) == MEM_REF
)
3224 if (!is_gimple_mem_ref_addr (TREE_OPERAND (expr
, 0))
3225 || (TREE_CODE (TREE_OPERAND (expr
, 0)) == ADDR_EXPR
3226 && verify_address (TREE_OPERAND (expr
, 0), false)))
3228 error ("invalid address operand in %qs", code_name
);
3229 debug_generic_stmt (expr
);
3232 if (!poly_int_tree_p (TREE_OPERAND (expr
, 1))
3233 || !POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (expr
, 1))))
3235 error ("invalid offset operand in %qs", code_name
);
3236 debug_generic_stmt (expr
);
3239 if (MR_DEPENDENCE_CLIQUE (expr
) != 0
3240 && MR_DEPENDENCE_CLIQUE (expr
) > cfun
->last_clique
)
3242 error ("invalid clique in %qs", code_name
);
3243 debug_generic_stmt (expr
);
3247 else if (TREE_CODE (expr
) == TARGET_MEM_REF
)
3249 if (!TMR_BASE (expr
)
3250 || !is_gimple_mem_ref_addr (TMR_BASE (expr
))
3251 || (TREE_CODE (TMR_BASE (expr
)) == ADDR_EXPR
3252 && verify_address (TMR_BASE (expr
), false)))
3254 error ("invalid address operand in %qs", code_name
);
3257 if (!TMR_OFFSET (expr
)
3258 || !poly_int_tree_p (TMR_OFFSET (expr
))
3259 || !POINTER_TYPE_P (TREE_TYPE (TMR_OFFSET (expr
))))
3261 error ("invalid offset operand in %qs", code_name
);
3262 debug_generic_stmt (expr
);
3265 if (MR_DEPENDENCE_CLIQUE (expr
) != 0
3266 && MR_DEPENDENCE_CLIQUE (expr
) > cfun
->last_clique
)
3268 error ("invalid clique in %qs", code_name
);
3269 debug_generic_stmt (expr
);
3273 else if (TREE_CODE (expr
) == INDIRECT_REF
)
3275 error ("%qs in gimple IL", code_name
);
3276 debug_generic_stmt (expr
);
3281 && (TREE_CODE (expr
) == SSA_NAME
|| is_gimple_min_invariant (expr
)))
3284 if (TREE_CODE (expr
) != SSA_NAME
&& is_gimple_id (expr
))
3287 if (TREE_CODE (expr
) != TARGET_MEM_REF
3288 && TREE_CODE (expr
) != MEM_REF
)
3290 error ("invalid expression for min lvalue");
3297 /* Returns true if there is one pointer type in TYPE_POINTER_TO (SRC_OBJ)
3298 list of pointer-to types that is trivially convertible to DEST. */
3301 one_pointer_to_useless_type_conversion_p (tree dest
, tree src_obj
)
3305 if (!TYPE_POINTER_TO (src_obj
))
3308 for (src
= TYPE_POINTER_TO (src_obj
); src
; src
= TYPE_NEXT_PTR_TO (src
))
3309 if (useless_type_conversion_p (dest
, src
))
3315 /* Return true if TYPE1 is a fixed-point type and if conversions to and
3316 from TYPE2 can be handled by FIXED_CONVERT_EXPR. */
3319 valid_fixed_convert_types_p (tree type1
, tree type2
)
3321 return (FIXED_POINT_TYPE_P (type1
)
3322 && (INTEGRAL_TYPE_P (type2
)
3323 || SCALAR_FLOAT_TYPE_P (type2
)
3324 || FIXED_POINT_TYPE_P (type2
)));
3327 /* Verify the contents of a GIMPLE_CALL STMT. Returns true when there
3328 is a problem, otherwise false. */
3331 verify_gimple_call (gcall
*stmt
)
3333 tree fn
= gimple_call_fn (stmt
);
3334 tree fntype
, fndecl
;
3337 if (gimple_call_internal_p (stmt
))
3341 error ("gimple call has two targets");
3342 debug_generic_stmt (fn
);
3350 error ("gimple call has no target");
3355 if (fn
&& !is_gimple_call_addr (fn
))
3357 error ("invalid function in gimple call");
3358 debug_generic_stmt (fn
);
3363 && (!POINTER_TYPE_P (TREE_TYPE (fn
))
3364 || (TREE_CODE (TREE_TYPE (TREE_TYPE (fn
))) != FUNCTION_TYPE
3365 && TREE_CODE (TREE_TYPE (TREE_TYPE (fn
))) != METHOD_TYPE
)))
3367 error ("non-function in gimple call");
3371 fndecl
= gimple_call_fndecl (stmt
);
3373 && TREE_CODE (fndecl
) == FUNCTION_DECL
3374 && DECL_LOOPING_CONST_OR_PURE_P (fndecl
)
3375 && !DECL_PURE_P (fndecl
)
3376 && !TREE_READONLY (fndecl
))
3378 error ("invalid pure const state for function");
3382 tree lhs
= gimple_call_lhs (stmt
);
3384 && (!is_gimple_reg (lhs
)
3385 && (!is_gimple_lvalue (lhs
)
3386 || verify_types_in_gimple_reference
3387 (TREE_CODE (lhs
) == WITH_SIZE_EXPR
3388 ? TREE_OPERAND (lhs
, 0) : lhs
, true))))
3390 error ("invalid LHS in gimple call");
3394 if (gimple_call_ctrl_altering_p (stmt
)
3395 && gimple_call_noreturn_p (stmt
)
3396 && should_remove_lhs_p (lhs
))
3398 error ("LHS in %<noreturn%> call");
3402 fntype
= gimple_call_fntype (stmt
);
3405 && !useless_type_conversion_p (TREE_TYPE (lhs
), TREE_TYPE (fntype
))
3406 /* ??? At least C++ misses conversions at assignments from
3407 void * call results.
3408 For now simply allow arbitrary pointer type conversions. */
3409 && !(POINTER_TYPE_P (TREE_TYPE (lhs
))
3410 && POINTER_TYPE_P (TREE_TYPE (fntype
))))
3412 error ("invalid conversion in gimple call");
3413 debug_generic_stmt (TREE_TYPE (lhs
));
3414 debug_generic_stmt (TREE_TYPE (fntype
));
3418 if (gimple_call_chain (stmt
)
3419 && !is_gimple_val (gimple_call_chain (stmt
)))
3421 error ("invalid static chain in gimple call");
3422 debug_generic_stmt (gimple_call_chain (stmt
));
3426 /* If there is a static chain argument, the call should either be
3427 indirect, or the decl should have DECL_STATIC_CHAIN set. */
3428 if (gimple_call_chain (stmt
)
3430 && !DECL_STATIC_CHAIN (fndecl
))
3432 error ("static chain with function that doesn%'t use one");
3436 if (fndecl
&& fndecl_built_in_p (fndecl
, BUILT_IN_NORMAL
))
3438 switch (DECL_FUNCTION_CODE (fndecl
))
3440 case BUILT_IN_UNREACHABLE
:
3442 if (gimple_call_num_args (stmt
) > 0)
3444 /* Built-in unreachable with parameters might not be caught by
3445 undefined behavior sanitizer. Front-ends do check users do not
3446 call them that way but we also produce calls to
3447 __builtin_unreachable internally, for example when IPA figures
3448 out a call cannot happen in a legal program. In such cases,
3449 we must make sure arguments are stripped off. */
3450 error ("%<__builtin_unreachable%> or %<__builtin_trap%> call "
3460 /* For a call to .DEFERRED_INIT,
3461 LHS = DEFERRED_INIT (SIZE of the DECL, INIT_TYPE, NAME of the DECL)
3462 we should guarantee that when the 1st argument is a constant, it should
3463 be the same as the size of the LHS. */
3465 if (gimple_call_internal_p (stmt
, IFN_DEFERRED_INIT
))
3467 tree size_of_arg0
= gimple_call_arg (stmt
, 0);
3468 tree size_of_lhs
= TYPE_SIZE_UNIT (TREE_TYPE (lhs
));
3470 if (TREE_CODE (lhs
) == SSA_NAME
)
3471 lhs
= SSA_NAME_VAR (lhs
);
3473 poly_uint64 size_from_arg0
, size_from_lhs
;
3474 bool is_constant_size_arg0
= poly_int_tree_p (size_of_arg0
,
3476 bool is_constant_size_lhs
= poly_int_tree_p (size_of_lhs
,
3478 if (is_constant_size_arg0
&& is_constant_size_lhs
)
3479 if (maybe_ne (size_from_arg0
, size_from_lhs
))
3481 error ("%<DEFFERED_INIT%> calls should have same "
3482 "constant size for the first argument and LHS");
3487 /* ??? The C frontend passes unpromoted arguments in case it
3488 didn't see a function declaration before the call. So for now
3489 leave the call arguments mostly unverified. Once we gimplify
3490 unit-at-a-time we have a chance to fix this. */
3491 for (i
= 0; i
< gimple_call_num_args (stmt
); ++i
)
3493 tree arg
= gimple_call_arg (stmt
, i
);
3494 if ((is_gimple_reg_type (TREE_TYPE (arg
))
3495 && !is_gimple_val (arg
))
3496 || (!is_gimple_reg_type (TREE_TYPE (arg
))
3497 && !is_gimple_lvalue (arg
)))
3499 error ("invalid argument to gimple call");
3500 debug_generic_expr (arg
);
3503 if (!is_gimple_reg (arg
))
3505 if (TREE_CODE (arg
) == WITH_SIZE_EXPR
)
3506 arg
= TREE_OPERAND (arg
, 0);
3507 if (verify_types_in_gimple_reference (arg
, false))
3515 /* Verifies the gimple comparison with the result type TYPE and
3516 the operands OP0 and OP1, comparison code is CODE. */
3519 verify_gimple_comparison (tree type
, tree op0
, tree op1
, enum tree_code code
)
3521 tree op0_type
= TREE_TYPE (op0
);
3522 tree op1_type
= TREE_TYPE (op1
);
3524 if (!is_gimple_val (op0
) || !is_gimple_val (op1
))
3526 error ("invalid operands in gimple comparison");
3530 /* For comparisons we do not have the operations type as the
3531 effective type the comparison is carried out in. Instead
3532 we require that either the first operand is trivially
3533 convertible into the second, or the other way around. */
3534 if (!useless_type_conversion_p (op0_type
, op1_type
)
3535 && !useless_type_conversion_p (op1_type
, op0_type
))
3537 error ("mismatching comparison operand types");
3538 debug_generic_expr (op0_type
);
3539 debug_generic_expr (op1_type
);
3543 /* The resulting type of a comparison may be an effective boolean type. */
3544 if (INTEGRAL_TYPE_P (type
)
3545 && (TREE_CODE (type
) == BOOLEAN_TYPE
3546 || TYPE_PRECISION (type
) == 1))
3548 if ((TREE_CODE (op0_type
) == VECTOR_TYPE
3549 || TREE_CODE (op1_type
) == VECTOR_TYPE
)
3550 && code
!= EQ_EXPR
&& code
!= NE_EXPR
3551 && !VECTOR_BOOLEAN_TYPE_P (op0_type
)
3552 && !VECTOR_INTEGER_TYPE_P (op0_type
))
3554 error ("unsupported operation or type for vector comparison"
3555 " returning a boolean");
3556 debug_generic_expr (op0_type
);
3557 debug_generic_expr (op1_type
);
3561 /* Or a boolean vector type with the same element count
3562 as the comparison operand types. */
3563 else if (TREE_CODE (type
) == VECTOR_TYPE
3564 && TREE_CODE (TREE_TYPE (type
)) == BOOLEAN_TYPE
)
3566 if (TREE_CODE (op0_type
) != VECTOR_TYPE
3567 || TREE_CODE (op1_type
) != VECTOR_TYPE
)
3569 error ("non-vector operands in vector comparison");
3570 debug_generic_expr (op0_type
);
3571 debug_generic_expr (op1_type
);
3575 if (maybe_ne (TYPE_VECTOR_SUBPARTS (type
),
3576 TYPE_VECTOR_SUBPARTS (op0_type
)))
3578 error ("invalid vector comparison resulting type");
3579 debug_generic_expr (type
);
3585 error ("bogus comparison result type");
3586 debug_generic_expr (type
);
3593 /* Verify a gimple assignment statement STMT with an unary rhs.
3594 Returns true if anything is wrong. */
3597 verify_gimple_assign_unary (gassign
*stmt
)
3599 enum tree_code rhs_code
= gimple_assign_rhs_code (stmt
);
3600 tree lhs
= gimple_assign_lhs (stmt
);
3601 tree lhs_type
= TREE_TYPE (lhs
);
3602 tree rhs1
= gimple_assign_rhs1 (stmt
);
3603 tree rhs1_type
= TREE_TYPE (rhs1
);
3605 if (!is_gimple_reg (lhs
))
3607 error ("non-register as LHS of unary operation");
3611 if (!is_gimple_val (rhs1
))
3613 error ("invalid operand in unary operation");
3617 const char* const code_name
= get_tree_code_name (rhs_code
);
3619 /* First handle conversions. */
3624 /* Allow conversions between vectors with the same number of elements,
3625 provided that the conversion is OK for the element types too. */
3626 if (VECTOR_TYPE_P (lhs_type
)
3627 && VECTOR_TYPE_P (rhs1_type
)
3628 && known_eq (TYPE_VECTOR_SUBPARTS (lhs_type
),
3629 TYPE_VECTOR_SUBPARTS (rhs1_type
)))
3631 lhs_type
= TREE_TYPE (lhs_type
);
3632 rhs1_type
= TREE_TYPE (rhs1_type
);
3634 else if (VECTOR_TYPE_P (lhs_type
) || VECTOR_TYPE_P (rhs1_type
))
3636 error ("invalid vector types in nop conversion");
3637 debug_generic_expr (lhs_type
);
3638 debug_generic_expr (rhs1_type
);
3642 /* Allow conversions from pointer type to integral type only if
3643 there is no sign or zero extension involved.
3644 For targets were the precision of ptrofftype doesn't match that
3645 of pointers we allow conversions to types where
3646 POINTERS_EXTEND_UNSIGNED specifies how that works. */
3647 if ((POINTER_TYPE_P (lhs_type
)
3648 && INTEGRAL_TYPE_P (rhs1_type
))
3649 || (POINTER_TYPE_P (rhs1_type
)
3650 && INTEGRAL_TYPE_P (lhs_type
)
3651 && (TYPE_PRECISION (rhs1_type
) >= TYPE_PRECISION (lhs_type
)
3652 #if defined(POINTERS_EXTEND_UNSIGNED)
3653 || (TYPE_MODE (rhs1_type
) == ptr_mode
3654 && (TYPE_PRECISION (lhs_type
)
3655 == BITS_PER_WORD
/* word_mode */
3656 || (TYPE_PRECISION (lhs_type
)
3657 == GET_MODE_PRECISION (Pmode
))))
3662 /* Allow conversion from integral to offset type and vice versa. */
3663 if ((TREE_CODE (lhs_type
) == OFFSET_TYPE
3664 && INTEGRAL_TYPE_P (rhs1_type
))
3665 || (INTEGRAL_TYPE_P (lhs_type
)
3666 && TREE_CODE (rhs1_type
) == OFFSET_TYPE
))
3669 /* Otherwise assert we are converting between types of the
3671 if (INTEGRAL_TYPE_P (lhs_type
) != INTEGRAL_TYPE_P (rhs1_type
))
3673 error ("invalid types in nop conversion");
3674 debug_generic_expr (lhs_type
);
3675 debug_generic_expr (rhs1_type
);
3682 case ADDR_SPACE_CONVERT_EXPR
:
3684 if (!POINTER_TYPE_P (rhs1_type
) || !POINTER_TYPE_P (lhs_type
)
3685 || (TYPE_ADDR_SPACE (TREE_TYPE (rhs1_type
))
3686 == TYPE_ADDR_SPACE (TREE_TYPE (lhs_type
))))
3688 error ("invalid types in address space conversion");
3689 debug_generic_expr (lhs_type
);
3690 debug_generic_expr (rhs1_type
);
3697 case FIXED_CONVERT_EXPR
:
3699 if (!valid_fixed_convert_types_p (lhs_type
, rhs1_type
)
3700 && !valid_fixed_convert_types_p (rhs1_type
, lhs_type
))
3702 error ("invalid types in fixed-point conversion");
3703 debug_generic_expr (lhs_type
);
3704 debug_generic_expr (rhs1_type
);
3713 if ((!INTEGRAL_TYPE_P (rhs1_type
) || !SCALAR_FLOAT_TYPE_P (lhs_type
))
3714 && (!VECTOR_INTEGER_TYPE_P (rhs1_type
)
3715 || !VECTOR_FLOAT_TYPE_P (lhs_type
)))
3717 error ("invalid types in conversion to floating-point");
3718 debug_generic_expr (lhs_type
);
3719 debug_generic_expr (rhs1_type
);
3726 case FIX_TRUNC_EXPR
:
3728 if ((!INTEGRAL_TYPE_P (lhs_type
) || !SCALAR_FLOAT_TYPE_P (rhs1_type
))
3729 && (!VECTOR_INTEGER_TYPE_P (lhs_type
)
3730 || !VECTOR_FLOAT_TYPE_P (rhs1_type
)))
3732 error ("invalid types in conversion to integer");
3733 debug_generic_expr (lhs_type
);
3734 debug_generic_expr (rhs1_type
);
3741 case VEC_UNPACK_HI_EXPR
:
3742 case VEC_UNPACK_LO_EXPR
:
3743 case VEC_UNPACK_FLOAT_HI_EXPR
:
3744 case VEC_UNPACK_FLOAT_LO_EXPR
:
3745 case VEC_UNPACK_FIX_TRUNC_HI_EXPR
:
3746 case VEC_UNPACK_FIX_TRUNC_LO_EXPR
:
3747 if (TREE_CODE (rhs1_type
) != VECTOR_TYPE
3748 || TREE_CODE (lhs_type
) != VECTOR_TYPE
3749 || (!INTEGRAL_TYPE_P (TREE_TYPE (lhs_type
))
3750 && !SCALAR_FLOAT_TYPE_P (TREE_TYPE (lhs_type
)))
3751 || (!INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type
))
3752 && !SCALAR_FLOAT_TYPE_P (TREE_TYPE (rhs1_type
)))
3753 || ((rhs_code
== VEC_UNPACK_HI_EXPR
3754 || rhs_code
== VEC_UNPACK_LO_EXPR
)
3755 && (INTEGRAL_TYPE_P (TREE_TYPE (lhs_type
))
3756 != INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type
))))
3757 || ((rhs_code
== VEC_UNPACK_FLOAT_HI_EXPR
3758 || rhs_code
== VEC_UNPACK_FLOAT_LO_EXPR
)
3759 && (INTEGRAL_TYPE_P (TREE_TYPE (lhs_type
))
3760 || SCALAR_FLOAT_TYPE_P (TREE_TYPE (rhs1_type
))))
3761 || ((rhs_code
== VEC_UNPACK_FIX_TRUNC_HI_EXPR
3762 || rhs_code
== VEC_UNPACK_FIX_TRUNC_LO_EXPR
)
3763 && (INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type
))
3764 || SCALAR_FLOAT_TYPE_P (TREE_TYPE (lhs_type
))))
3765 || (maybe_ne (GET_MODE_SIZE (element_mode (lhs_type
)),
3766 2 * GET_MODE_SIZE (element_mode (rhs1_type
)))
3767 && (!VECTOR_BOOLEAN_TYPE_P (lhs_type
)
3768 || !VECTOR_BOOLEAN_TYPE_P (rhs1_type
)))
3769 || maybe_ne (2 * TYPE_VECTOR_SUBPARTS (lhs_type
),
3770 TYPE_VECTOR_SUBPARTS (rhs1_type
)))
3772 error ("type mismatch in %qs expression", code_name
);
3773 debug_generic_expr (lhs_type
);
3774 debug_generic_expr (rhs1_type
);
3785 /* Disallow pointer and offset types for many of the unary gimple. */
3786 if (POINTER_TYPE_P (lhs_type
)
3787 || TREE_CODE (lhs_type
) == OFFSET_TYPE
)
3789 error ("invalid types for %qs", code_name
);
3790 debug_generic_expr (lhs_type
);
3791 debug_generic_expr (rhs1_type
);
3797 if (!ANY_INTEGRAL_TYPE_P (lhs_type
)
3798 || !TYPE_UNSIGNED (lhs_type
)
3799 || !ANY_INTEGRAL_TYPE_P (rhs1_type
)
3800 || TYPE_UNSIGNED (rhs1_type
)
3801 || element_precision (lhs_type
) != element_precision (rhs1_type
))
3803 error ("invalid types for %qs", code_name
);
3804 debug_generic_expr (lhs_type
);
3805 debug_generic_expr (rhs1_type
);
3810 case VEC_DUPLICATE_EXPR
:
3811 if (TREE_CODE (lhs_type
) != VECTOR_TYPE
3812 || !useless_type_conversion_p (TREE_TYPE (lhs_type
), rhs1_type
))
3814 error ("%qs should be from a scalar to a like vector", code_name
);
3815 debug_generic_expr (lhs_type
);
3816 debug_generic_expr (rhs1_type
);
3825 /* For the remaining codes assert there is no conversion involved. */
3826 if (!useless_type_conversion_p (lhs_type
, rhs1_type
))
3828 error ("non-trivial conversion in unary operation");
3829 debug_generic_expr (lhs_type
);
3830 debug_generic_expr (rhs1_type
);
3837 /* Verify a gimple assignment statement STMT with a binary rhs.
3838 Returns true if anything is wrong. */
3841 verify_gimple_assign_binary (gassign
*stmt
)
3843 enum tree_code rhs_code
= gimple_assign_rhs_code (stmt
);
3844 tree lhs
= gimple_assign_lhs (stmt
);
3845 tree lhs_type
= TREE_TYPE (lhs
);
3846 tree rhs1
= gimple_assign_rhs1 (stmt
);
3847 tree rhs1_type
= TREE_TYPE (rhs1
);
3848 tree rhs2
= gimple_assign_rhs2 (stmt
);
3849 tree rhs2_type
= TREE_TYPE (rhs2
);
3851 if (!is_gimple_reg (lhs
))
3853 error ("non-register as LHS of binary operation");
3857 if (!is_gimple_val (rhs1
)
3858 || !is_gimple_val (rhs2
))
3860 error ("invalid operands in binary operation");
3864 const char* const code_name
= get_tree_code_name (rhs_code
);
3866 /* First handle operations that involve different types. */
3871 if (TREE_CODE (lhs_type
) != COMPLEX_TYPE
3872 || !(INTEGRAL_TYPE_P (rhs1_type
)
3873 || SCALAR_FLOAT_TYPE_P (rhs1_type
))
3874 || !(INTEGRAL_TYPE_P (rhs2_type
)
3875 || SCALAR_FLOAT_TYPE_P (rhs2_type
)))
3877 error ("type mismatch in %qs", code_name
);
3878 debug_generic_expr (lhs_type
);
3879 debug_generic_expr (rhs1_type
);
3880 debug_generic_expr (rhs2_type
);
3892 /* Shifts and rotates are ok on integral types, fixed point
3893 types and integer vector types. */
3894 if ((!INTEGRAL_TYPE_P (rhs1_type
)
3895 && !FIXED_POINT_TYPE_P (rhs1_type
)
3896 && !(TREE_CODE (rhs1_type
) == VECTOR_TYPE
3897 && INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type
))))
3898 || (!INTEGRAL_TYPE_P (rhs2_type
)
3899 /* Vector shifts of vectors are also ok. */
3900 && !(TREE_CODE (rhs1_type
) == VECTOR_TYPE
3901 && INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type
))
3902 && TREE_CODE (rhs2_type
) == VECTOR_TYPE
3903 && INTEGRAL_TYPE_P (TREE_TYPE (rhs2_type
))))
3904 || !useless_type_conversion_p (lhs_type
, rhs1_type
))
3906 error ("type mismatch in %qs", code_name
);
3907 debug_generic_expr (lhs_type
);
3908 debug_generic_expr (rhs1_type
);
3909 debug_generic_expr (rhs2_type
);
3916 case WIDEN_LSHIFT_EXPR
:
3918 if (!INTEGRAL_TYPE_P (lhs_type
)
3919 || !INTEGRAL_TYPE_P (rhs1_type
)
3920 || TREE_CODE (rhs2
) != INTEGER_CST
3921 || (2 * TYPE_PRECISION (rhs1_type
) > TYPE_PRECISION (lhs_type
)))
3923 error ("type mismatch in %qs", code_name
);
3924 debug_generic_expr (lhs_type
);
3925 debug_generic_expr (rhs1_type
);
3926 debug_generic_expr (rhs2_type
);
3933 case VEC_WIDEN_LSHIFT_HI_EXPR
:
3934 case VEC_WIDEN_LSHIFT_LO_EXPR
:
3936 if (TREE_CODE (rhs1_type
) != VECTOR_TYPE
3937 || TREE_CODE (lhs_type
) != VECTOR_TYPE
3938 || !INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type
))
3939 || !INTEGRAL_TYPE_P (TREE_TYPE (lhs_type
))
3940 || TREE_CODE (rhs2
) != INTEGER_CST
3941 || (2 * TYPE_PRECISION (TREE_TYPE (rhs1_type
))
3942 > TYPE_PRECISION (TREE_TYPE (lhs_type
))))
3944 error ("type mismatch in %qs", code_name
);
3945 debug_generic_expr (lhs_type
);
3946 debug_generic_expr (rhs1_type
);
3947 debug_generic_expr (rhs2_type
);
3954 case WIDEN_PLUS_EXPR
:
3955 case WIDEN_MINUS_EXPR
:
3959 tree lhs_etype
= lhs_type
;
3960 tree rhs1_etype
= rhs1_type
;
3961 tree rhs2_etype
= rhs2_type
;
3962 if (TREE_CODE (lhs_type
) == VECTOR_TYPE
)
3964 if (TREE_CODE (rhs1_type
) != VECTOR_TYPE
3965 || TREE_CODE (rhs2_type
) != VECTOR_TYPE
)
3967 error ("invalid non-vector operands to %qs", code_name
);
3970 lhs_etype
= TREE_TYPE (lhs_type
);
3971 rhs1_etype
= TREE_TYPE (rhs1_type
);
3972 rhs2_etype
= TREE_TYPE (rhs2_type
);
3974 if (POINTER_TYPE_P (lhs_etype
)
3975 || POINTER_TYPE_P (rhs1_etype
)
3976 || POINTER_TYPE_P (rhs2_etype
))
3978 error ("invalid (pointer) operands %qs", code_name
);
3982 /* Continue with generic binary expression handling. */
3986 case POINTER_PLUS_EXPR
:
3988 if (!POINTER_TYPE_P (rhs1_type
)
3989 || !useless_type_conversion_p (lhs_type
, rhs1_type
)
3990 || !ptrofftype_p (rhs2_type
))
3992 error ("type mismatch in %qs", code_name
);
3993 debug_generic_stmt (lhs_type
);
3994 debug_generic_stmt (rhs1_type
);
3995 debug_generic_stmt (rhs2_type
);
4002 case POINTER_DIFF_EXPR
:
4004 if (!POINTER_TYPE_P (rhs1_type
)
4005 || !POINTER_TYPE_P (rhs2_type
)
4006 /* Because we special-case pointers to void we allow difference
4007 of arbitrary pointers with the same mode. */
4008 || TYPE_MODE (rhs1_type
) != TYPE_MODE (rhs2_type
)
4009 || !INTEGRAL_TYPE_P (lhs_type
)
4010 || TYPE_UNSIGNED (lhs_type
)
4011 || TYPE_PRECISION (lhs_type
) != TYPE_PRECISION (rhs1_type
))
4013 error ("type mismatch in %qs", code_name
);
4014 debug_generic_stmt (lhs_type
);
4015 debug_generic_stmt (rhs1_type
);
4016 debug_generic_stmt (rhs2_type
);
4023 case TRUTH_ANDIF_EXPR
:
4024 case TRUTH_ORIF_EXPR
:
4025 case TRUTH_AND_EXPR
:
4027 case TRUTH_XOR_EXPR
:
4037 case UNORDERED_EXPR
:
4045 /* Comparisons are also binary, but the result type is not
4046 connected to the operand types. */
4047 return verify_gimple_comparison (lhs_type
, rhs1
, rhs2
, rhs_code
);
4049 case WIDEN_MULT_EXPR
:
4050 if (TREE_CODE (lhs_type
) != INTEGER_TYPE
)
4052 return ((2 * TYPE_PRECISION (rhs1_type
) > TYPE_PRECISION (lhs_type
))
4053 || (TYPE_PRECISION (rhs1_type
) != TYPE_PRECISION (rhs2_type
)));
4055 case WIDEN_SUM_EXPR
:
4057 if (((TREE_CODE (rhs1_type
) != VECTOR_TYPE
4058 || TREE_CODE (lhs_type
) != VECTOR_TYPE
)
4059 && ((!INTEGRAL_TYPE_P (rhs1_type
)
4060 && !SCALAR_FLOAT_TYPE_P (rhs1_type
))
4061 || (!INTEGRAL_TYPE_P (lhs_type
)
4062 && !SCALAR_FLOAT_TYPE_P (lhs_type
))))
4063 || !useless_type_conversion_p (lhs_type
, rhs2_type
)
4064 || maybe_lt (GET_MODE_SIZE (element_mode (rhs2_type
)),
4065 2 * GET_MODE_SIZE (element_mode (rhs1_type
))))
4067 error ("type mismatch in %qs", code_name
);
4068 debug_generic_expr (lhs_type
);
4069 debug_generic_expr (rhs1_type
);
4070 debug_generic_expr (rhs2_type
);
4076 case VEC_WIDEN_MINUS_HI_EXPR
:
4077 case VEC_WIDEN_MINUS_LO_EXPR
:
4078 case VEC_WIDEN_PLUS_HI_EXPR
:
4079 case VEC_WIDEN_PLUS_LO_EXPR
:
4080 case VEC_WIDEN_MULT_HI_EXPR
:
4081 case VEC_WIDEN_MULT_LO_EXPR
:
4082 case VEC_WIDEN_MULT_EVEN_EXPR
:
4083 case VEC_WIDEN_MULT_ODD_EXPR
:
4085 if (TREE_CODE (rhs1_type
) != VECTOR_TYPE
4086 || TREE_CODE (lhs_type
) != VECTOR_TYPE
4087 || !types_compatible_p (rhs1_type
, rhs2_type
)
4088 || maybe_ne (GET_MODE_SIZE (element_mode (lhs_type
)),
4089 2 * GET_MODE_SIZE (element_mode (rhs1_type
))))
4091 error ("type mismatch in %qs", code_name
);
4092 debug_generic_expr (lhs_type
);
4093 debug_generic_expr (rhs1_type
);
4094 debug_generic_expr (rhs2_type
);
4100 case VEC_PACK_TRUNC_EXPR
:
4101 /* ??? We currently use VEC_PACK_TRUNC_EXPR to simply concat
4102 vector boolean types. */
4103 if (VECTOR_BOOLEAN_TYPE_P (lhs_type
)
4104 && VECTOR_BOOLEAN_TYPE_P (rhs1_type
)
4105 && types_compatible_p (rhs1_type
, rhs2_type
)
4106 && known_eq (TYPE_VECTOR_SUBPARTS (lhs_type
),
4107 2 * TYPE_VECTOR_SUBPARTS (rhs1_type
)))
4111 case VEC_PACK_SAT_EXPR
:
4112 case VEC_PACK_FIX_TRUNC_EXPR
:
4114 if (TREE_CODE (rhs1_type
) != VECTOR_TYPE
4115 || TREE_CODE (lhs_type
) != VECTOR_TYPE
4116 || !((rhs_code
== VEC_PACK_FIX_TRUNC_EXPR
4117 && SCALAR_FLOAT_TYPE_P (TREE_TYPE (rhs1_type
))
4118 && INTEGRAL_TYPE_P (TREE_TYPE (lhs_type
)))
4119 || (INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type
))
4120 == INTEGRAL_TYPE_P (TREE_TYPE (lhs_type
))))
4121 || !types_compatible_p (rhs1_type
, rhs2_type
)
4122 || maybe_ne (GET_MODE_SIZE (element_mode (rhs1_type
)),
4123 2 * GET_MODE_SIZE (element_mode (lhs_type
)))
4124 || maybe_ne (2 * TYPE_VECTOR_SUBPARTS (rhs1_type
),
4125 TYPE_VECTOR_SUBPARTS (lhs_type
)))
4127 error ("type mismatch in %qs", code_name
);
4128 debug_generic_expr (lhs_type
);
4129 debug_generic_expr (rhs1_type
);
4130 debug_generic_expr (rhs2_type
);
4137 case VEC_PACK_FLOAT_EXPR
:
4138 if (TREE_CODE (rhs1_type
) != VECTOR_TYPE
4139 || TREE_CODE (lhs_type
) != VECTOR_TYPE
4140 || !INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type
))
4141 || !SCALAR_FLOAT_TYPE_P (TREE_TYPE (lhs_type
))
4142 || !types_compatible_p (rhs1_type
, rhs2_type
)
4143 || maybe_ne (GET_MODE_SIZE (element_mode (rhs1_type
)),
4144 2 * GET_MODE_SIZE (element_mode (lhs_type
)))
4145 || maybe_ne (2 * TYPE_VECTOR_SUBPARTS (rhs1_type
),
4146 TYPE_VECTOR_SUBPARTS (lhs_type
)))
4148 error ("type mismatch in %qs", code_name
);
4149 debug_generic_expr (lhs_type
);
4150 debug_generic_expr (rhs1_type
);
4151 debug_generic_expr (rhs2_type
);
4158 case MULT_HIGHPART_EXPR
:
4159 case TRUNC_DIV_EXPR
:
4161 case FLOOR_DIV_EXPR
:
4162 case ROUND_DIV_EXPR
:
4163 case TRUNC_MOD_EXPR
:
4165 case FLOOR_MOD_EXPR
:
4166 case ROUND_MOD_EXPR
:
4168 case EXACT_DIV_EXPR
:
4169 /* Disallow pointer and offset types for many of the binary gimple. */
4170 if (POINTER_TYPE_P (lhs_type
)
4171 || TREE_CODE (lhs_type
) == OFFSET_TYPE
)
4173 error ("invalid types for %qs", code_name
);
4174 debug_generic_expr (lhs_type
);
4175 debug_generic_expr (rhs1_type
);
4176 debug_generic_expr (rhs2_type
);
4179 /* Continue with generic binary expression handling. */
4187 /* Continue with generic binary expression handling. */
4190 case VEC_SERIES_EXPR
:
4191 if (!useless_type_conversion_p (rhs1_type
, rhs2_type
))
4193 error ("type mismatch in %qs", code_name
);
4194 debug_generic_expr (rhs1_type
);
4195 debug_generic_expr (rhs2_type
);
4198 if (TREE_CODE (lhs_type
) != VECTOR_TYPE
4199 || !useless_type_conversion_p (TREE_TYPE (lhs_type
), rhs1_type
))
4201 error ("vector type expected in %qs", code_name
);
4202 debug_generic_expr (lhs_type
);
4211 if (!useless_type_conversion_p (lhs_type
, rhs1_type
)
4212 || !useless_type_conversion_p (lhs_type
, rhs2_type
))
4214 error ("type mismatch in binary expression");
4215 debug_generic_stmt (lhs_type
);
4216 debug_generic_stmt (rhs1_type
);
4217 debug_generic_stmt (rhs2_type
);
4224 /* Verify a gimple assignment statement STMT with a ternary rhs.
4225 Returns true if anything is wrong. */
4228 verify_gimple_assign_ternary (gassign
*stmt
)
4230 enum tree_code rhs_code
= gimple_assign_rhs_code (stmt
);
4231 tree lhs
= gimple_assign_lhs (stmt
);
4232 tree lhs_type
= TREE_TYPE (lhs
);
4233 tree rhs1
= gimple_assign_rhs1 (stmt
);
4234 tree rhs1_type
= TREE_TYPE (rhs1
);
4235 tree rhs2
= gimple_assign_rhs2 (stmt
);
4236 tree rhs2_type
= TREE_TYPE (rhs2
);
4237 tree rhs3
= gimple_assign_rhs3 (stmt
);
4238 tree rhs3_type
= TREE_TYPE (rhs3
);
4240 if (!is_gimple_reg (lhs
))
4242 error ("non-register as LHS of ternary operation");
4246 if (!is_gimple_val (rhs1
)
4247 || !is_gimple_val (rhs2
)
4248 || !is_gimple_val (rhs3
))
4250 error ("invalid operands in ternary operation");
4254 const char* const code_name
= get_tree_code_name (rhs_code
);
4256 /* First handle operations that involve different types. */
4259 case WIDEN_MULT_PLUS_EXPR
:
4260 case WIDEN_MULT_MINUS_EXPR
:
4261 if ((!INTEGRAL_TYPE_P (rhs1_type
)
4262 && !FIXED_POINT_TYPE_P (rhs1_type
))
4263 || !useless_type_conversion_p (rhs1_type
, rhs2_type
)
4264 || !useless_type_conversion_p (lhs_type
, rhs3_type
)
4265 || 2 * TYPE_PRECISION (rhs1_type
) > TYPE_PRECISION (lhs_type
)
4266 || TYPE_PRECISION (rhs1_type
) != TYPE_PRECISION (rhs2_type
))
4268 error ("type mismatch in %qs", code_name
);
4269 debug_generic_expr (lhs_type
);
4270 debug_generic_expr (rhs1_type
);
4271 debug_generic_expr (rhs2_type
);
4272 debug_generic_expr (rhs3_type
);
4278 if (!VECTOR_BOOLEAN_TYPE_P (rhs1_type
)
4279 || maybe_ne (TYPE_VECTOR_SUBPARTS (rhs1_type
),
4280 TYPE_VECTOR_SUBPARTS (lhs_type
)))
4282 error ("the first argument of a %qs must be of a "
4283 "boolean vector type of the same number of elements "
4284 "as the result", code_name
);
4285 debug_generic_expr (lhs_type
);
4286 debug_generic_expr (rhs1_type
);
4291 if (!useless_type_conversion_p (lhs_type
, rhs2_type
)
4292 || !useless_type_conversion_p (lhs_type
, rhs3_type
))
4294 error ("type mismatch in %qs", code_name
);
4295 debug_generic_expr (lhs_type
);
4296 debug_generic_expr (rhs2_type
);
4297 debug_generic_expr (rhs3_type
);
4303 /* If permute is constant, then we allow for lhs and rhs
4304 to have different vector types, provided:
4305 (1) lhs, rhs1, rhs2 have same element type.
4306 (2) rhs3 vector is constant and has integer element type.
4307 (3) len(lhs) == len(rhs3) && len(rhs1) == len(rhs2). */
4309 if (TREE_CODE (lhs_type
) != VECTOR_TYPE
4310 || TREE_CODE (rhs1_type
) != VECTOR_TYPE
4311 || TREE_CODE (rhs2_type
) != VECTOR_TYPE
4312 || TREE_CODE (rhs3_type
) != VECTOR_TYPE
)
4314 error ("vector types expected in %qs", code_name
);
4315 debug_generic_expr (lhs_type
);
4316 debug_generic_expr (rhs1_type
);
4317 debug_generic_expr (rhs2_type
);
4318 debug_generic_expr (rhs3_type
);
4322 /* If rhs3 is constant, we allow lhs, rhs1 and rhs2 to be different vector types,
4323 as long as lhs, rhs1 and rhs2 have same element type. */
4324 if (TREE_CONSTANT (rhs3
)
4325 ? (!useless_type_conversion_p (TREE_TYPE (lhs_type
), TREE_TYPE (rhs1_type
))
4326 || !useless_type_conversion_p (TREE_TYPE (lhs_type
), TREE_TYPE (rhs2_type
)))
4327 : (!useless_type_conversion_p (lhs_type
, rhs1_type
)
4328 || !useless_type_conversion_p (lhs_type
, rhs2_type
)))
4330 error ("type mismatch in %qs", code_name
);
4331 debug_generic_expr (lhs_type
);
4332 debug_generic_expr (rhs1_type
);
4333 debug_generic_expr (rhs2_type
);
4334 debug_generic_expr (rhs3_type
);
4338 /* If rhs3 is constant, relax the check len(rhs2) == len(rhs3). */
4339 if (maybe_ne (TYPE_VECTOR_SUBPARTS (rhs1_type
),
4340 TYPE_VECTOR_SUBPARTS (rhs2_type
))
4341 || (!TREE_CONSTANT(rhs3
)
4342 && maybe_ne (TYPE_VECTOR_SUBPARTS (rhs2_type
),
4343 TYPE_VECTOR_SUBPARTS (rhs3_type
)))
4344 || maybe_ne (TYPE_VECTOR_SUBPARTS (rhs3_type
),
4345 TYPE_VECTOR_SUBPARTS (lhs_type
)))
4347 error ("vectors with different element number found in %qs",
4349 debug_generic_expr (lhs_type
);
4350 debug_generic_expr (rhs1_type
);
4351 debug_generic_expr (rhs2_type
);
4352 debug_generic_expr (rhs3_type
);
4356 if (TREE_CODE (TREE_TYPE (rhs3_type
)) != INTEGER_TYPE
4357 || (TREE_CODE (rhs3
) != VECTOR_CST
4358 && (GET_MODE_BITSIZE (SCALAR_INT_TYPE_MODE
4359 (TREE_TYPE (rhs3_type
)))
4360 != GET_MODE_BITSIZE (SCALAR_TYPE_MODE
4361 (TREE_TYPE (rhs1_type
))))))
4363 error ("invalid mask type in %qs", code_name
);
4364 debug_generic_expr (lhs_type
);
4365 debug_generic_expr (rhs1_type
);
4366 debug_generic_expr (rhs2_type
);
4367 debug_generic_expr (rhs3_type
);
4374 if (!useless_type_conversion_p (rhs1_type
, rhs2_type
)
4375 || !useless_type_conversion_p (lhs_type
, rhs3_type
)
4376 || 2 * GET_MODE_UNIT_BITSIZE (TYPE_MODE (TREE_TYPE (rhs1_type
)))
4377 > GET_MODE_UNIT_BITSIZE (TYPE_MODE (TREE_TYPE (lhs_type
))))
4379 error ("type mismatch in %qs", code_name
);
4380 debug_generic_expr (lhs_type
);
4381 debug_generic_expr (rhs1_type
);
4382 debug_generic_expr (rhs2_type
);
4383 debug_generic_expr (rhs3_type
);
4387 if (TREE_CODE (rhs1_type
) != VECTOR_TYPE
4388 || TREE_CODE (rhs2_type
) != VECTOR_TYPE
4389 || TREE_CODE (rhs3_type
) != VECTOR_TYPE
)
4391 error ("vector types expected in %qs", code_name
);
4392 debug_generic_expr (lhs_type
);
4393 debug_generic_expr (rhs1_type
);
4394 debug_generic_expr (rhs2_type
);
4395 debug_generic_expr (rhs3_type
);
4401 case BIT_INSERT_EXPR
:
4402 if (! useless_type_conversion_p (lhs_type
, rhs1_type
))
4404 error ("type mismatch in %qs", code_name
);
4405 debug_generic_expr (lhs_type
);
4406 debug_generic_expr (rhs1_type
);
4409 if (! ((INTEGRAL_TYPE_P (rhs1_type
)
4410 && INTEGRAL_TYPE_P (rhs2_type
))
4411 /* Vector element insert. */
4412 || (VECTOR_TYPE_P (rhs1_type
)
4413 && types_compatible_p (TREE_TYPE (rhs1_type
), rhs2_type
))
4414 /* Aligned sub-vector insert. */
4415 || (VECTOR_TYPE_P (rhs1_type
)
4416 && VECTOR_TYPE_P (rhs2_type
)
4417 && types_compatible_p (TREE_TYPE (rhs1_type
),
4418 TREE_TYPE (rhs2_type
))
4419 && multiple_p (TYPE_VECTOR_SUBPARTS (rhs1_type
),
4420 TYPE_VECTOR_SUBPARTS (rhs2_type
))
4421 && multiple_p (wi::to_poly_offset (rhs3
),
4422 wi::to_poly_offset (TYPE_SIZE (rhs2_type
))))))
4424 error ("not allowed type combination in %qs", code_name
);
4425 debug_generic_expr (rhs1_type
);
4426 debug_generic_expr (rhs2_type
);
4429 if (! tree_fits_uhwi_p (rhs3
)
4430 || ! types_compatible_p (bitsizetype
, TREE_TYPE (rhs3
))
4431 || ! tree_fits_uhwi_p (TYPE_SIZE (rhs2_type
)))
4433 error ("invalid position or size in %qs", code_name
);
4436 if (INTEGRAL_TYPE_P (rhs1_type
)
4437 && !type_has_mode_precision_p (rhs1_type
))
4439 error ("%qs into non-mode-precision operand", code_name
);
4442 if (INTEGRAL_TYPE_P (rhs1_type
))
4444 unsigned HOST_WIDE_INT bitpos
= tree_to_uhwi (rhs3
);
4445 if (bitpos
>= TYPE_PRECISION (rhs1_type
)
4446 || (bitpos
+ TYPE_PRECISION (rhs2_type
)
4447 > TYPE_PRECISION (rhs1_type
)))
4449 error ("insertion out of range in %qs", code_name
);
4453 else if (VECTOR_TYPE_P (rhs1_type
))
4455 unsigned HOST_WIDE_INT bitpos
= tree_to_uhwi (rhs3
);
4456 unsigned HOST_WIDE_INT bitsize
= tree_to_uhwi (TYPE_SIZE (rhs2_type
));
4457 if (bitpos
% bitsize
!= 0)
4459 error ("%qs not at element boundary", code_name
);
4467 if (((TREE_CODE (rhs1_type
) != VECTOR_TYPE
4468 || TREE_CODE (lhs_type
) != VECTOR_TYPE
)
4469 && ((!INTEGRAL_TYPE_P (rhs1_type
)
4470 && !SCALAR_FLOAT_TYPE_P (rhs1_type
))
4471 || (!INTEGRAL_TYPE_P (lhs_type
)
4472 && !SCALAR_FLOAT_TYPE_P (lhs_type
))))
4473 /* rhs1_type and rhs2_type may differ in sign. */
4474 || !tree_nop_conversion_p (rhs1_type
, rhs2_type
)
4475 || !useless_type_conversion_p (lhs_type
, rhs3_type
)
4476 || maybe_lt (GET_MODE_SIZE (element_mode (rhs3_type
)),
4477 2 * GET_MODE_SIZE (element_mode (rhs1_type
))))
4479 error ("type mismatch in %qs", code_name
);
4480 debug_generic_expr (lhs_type
);
4481 debug_generic_expr (rhs1_type
);
4482 debug_generic_expr (rhs2_type
);
4488 case REALIGN_LOAD_EXPR
:
4498 /* Verify a gimple assignment statement STMT with a single rhs.
4499 Returns true if anything is wrong. */
4502 verify_gimple_assign_single (gassign
*stmt
)
4504 enum tree_code rhs_code
= gimple_assign_rhs_code (stmt
);
4505 tree lhs
= gimple_assign_lhs (stmt
);
4506 tree lhs_type
= TREE_TYPE (lhs
);
4507 tree rhs1
= gimple_assign_rhs1 (stmt
);
4508 tree rhs1_type
= TREE_TYPE (rhs1
);
4511 const char* const code_name
= get_tree_code_name (rhs_code
);
4513 if (!useless_type_conversion_p (lhs_type
, rhs1_type
))
4515 error ("non-trivial conversion in %qs", code_name
);
4516 debug_generic_expr (lhs_type
);
4517 debug_generic_expr (rhs1_type
);
4521 if (gimple_clobber_p (stmt
)
4522 && !(DECL_P (lhs
) || TREE_CODE (lhs
) == MEM_REF
))
4524 error ("%qs LHS in clobber statement",
4525 get_tree_code_name (TREE_CODE (lhs
)));
4526 debug_generic_expr (lhs
);
4530 if (TREE_CODE (lhs
) == WITH_SIZE_EXPR
)
4532 error ("%qs LHS in assignment statement",
4533 get_tree_code_name (TREE_CODE (lhs
)));
4534 debug_generic_expr (lhs
);
4538 if (handled_component_p (lhs
)
4539 || TREE_CODE (lhs
) == MEM_REF
4540 || TREE_CODE (lhs
) == TARGET_MEM_REF
)
4541 res
|= verify_types_in_gimple_reference (lhs
, true);
4543 /* Special codes we cannot handle via their class. */
4548 tree op
= TREE_OPERAND (rhs1
, 0);
4549 if (!is_gimple_addressable (op
))
4551 error ("invalid operand in %qs", code_name
);
4555 /* Technically there is no longer a need for matching types, but
4556 gimple hygiene asks for this check. In LTO we can end up
4557 combining incompatible units and thus end up with addresses
4558 of globals that change their type to a common one. */
4560 && !types_compatible_p (TREE_TYPE (op
),
4561 TREE_TYPE (TREE_TYPE (rhs1
)))
4562 && !one_pointer_to_useless_type_conversion_p (TREE_TYPE (rhs1
),
4565 error ("type mismatch in %qs", code_name
);
4566 debug_generic_stmt (TREE_TYPE (rhs1
));
4567 debug_generic_stmt (TREE_TYPE (op
));
4571 return (verify_address (rhs1
, true)
4572 || verify_types_in_gimple_reference (op
, true));
4577 error ("%qs in gimple IL", code_name
);
4583 case ARRAY_RANGE_REF
:
4584 case VIEW_CONVERT_EXPR
:
4587 case TARGET_MEM_REF
:
4589 if (!is_gimple_reg (lhs
)
4590 && is_gimple_reg_type (TREE_TYPE (lhs
)))
4592 error ("invalid RHS for gimple memory store: %qs", code_name
);
4593 debug_generic_stmt (lhs
);
4594 debug_generic_stmt (rhs1
);
4597 return res
|| verify_types_in_gimple_reference (rhs1
, false);
4609 /* tcc_declaration */
4614 if (!is_gimple_reg (lhs
)
4615 && !is_gimple_reg (rhs1
)
4616 && is_gimple_reg_type (TREE_TYPE (lhs
)))
4618 error ("invalid RHS for gimple memory store: %qs", code_name
);
4619 debug_generic_stmt (lhs
);
4620 debug_generic_stmt (rhs1
);
4626 if (TREE_CODE (rhs1_type
) == VECTOR_TYPE
)
4629 tree elt_i
, elt_v
, elt_t
= NULL_TREE
;
4631 if (CONSTRUCTOR_NELTS (rhs1
) == 0)
4633 /* For vector CONSTRUCTORs we require that either it is empty
4634 CONSTRUCTOR, or it is a CONSTRUCTOR of smaller vector elements
4635 (then the element count must be correct to cover the whole
4636 outer vector and index must be NULL on all elements, or it is
4637 a CONSTRUCTOR of scalar elements, where we as an exception allow
4638 smaller number of elements (assuming zero filling) and
4639 consecutive indexes as compared to NULL indexes (such
4640 CONSTRUCTORs can appear in the IL from FEs). */
4641 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (rhs1
), i
, elt_i
, elt_v
)
4643 if (elt_t
== NULL_TREE
)
4645 elt_t
= TREE_TYPE (elt_v
);
4646 if (TREE_CODE (elt_t
) == VECTOR_TYPE
)
4648 tree elt_t
= TREE_TYPE (elt_v
);
4649 if (!useless_type_conversion_p (TREE_TYPE (rhs1_type
),
4652 error ("incorrect type of vector %qs elements",
4654 debug_generic_stmt (rhs1
);
4657 else if (maybe_ne (CONSTRUCTOR_NELTS (rhs1
)
4658 * TYPE_VECTOR_SUBPARTS (elt_t
),
4659 TYPE_VECTOR_SUBPARTS (rhs1_type
)))
4661 error ("incorrect number of vector %qs elements",
4663 debug_generic_stmt (rhs1
);
4667 else if (!useless_type_conversion_p (TREE_TYPE (rhs1_type
),
4670 error ("incorrect type of vector %qs elements",
4672 debug_generic_stmt (rhs1
);
4675 else if (maybe_gt (CONSTRUCTOR_NELTS (rhs1
),
4676 TYPE_VECTOR_SUBPARTS (rhs1_type
)))
4678 error ("incorrect number of vector %qs elements",
4680 debug_generic_stmt (rhs1
);
4684 else if (!useless_type_conversion_p (elt_t
, TREE_TYPE (elt_v
)))
4686 error ("incorrect type of vector CONSTRUCTOR elements");
4687 debug_generic_stmt (rhs1
);
4690 if (elt_i
!= NULL_TREE
4691 && (TREE_CODE (elt_t
) == VECTOR_TYPE
4692 || TREE_CODE (elt_i
) != INTEGER_CST
4693 || compare_tree_int (elt_i
, i
) != 0))
4695 error ("vector %qs with non-NULL element index",
4697 debug_generic_stmt (rhs1
);
4700 if (!is_gimple_val (elt_v
))
4702 error ("vector %qs element is not a GIMPLE value",
4704 debug_generic_stmt (rhs1
);
4709 else if (CONSTRUCTOR_NELTS (rhs1
) != 0)
4711 error ("non-vector %qs with elements", code_name
);
4712 debug_generic_stmt (rhs1
);
4719 rhs1
= fold (ASSERT_EXPR_COND (rhs1
));
4720 if (rhs1
== boolean_false_node
)
4722 error ("%qs with an always-false condition", code_name
);
4723 debug_generic_stmt (rhs1
);
4728 case WITH_SIZE_EXPR
:
4729 error ("%qs RHS in assignment statement",
4730 get_tree_code_name (rhs_code
));
4731 debug_generic_expr (rhs1
);
4744 /* Verify the contents of a GIMPLE_ASSIGN STMT. Returns true when there
4745 is a problem, otherwise false. */
4748 verify_gimple_assign (gassign
*stmt
)
4750 switch (gimple_assign_rhs_class (stmt
))
4752 case GIMPLE_SINGLE_RHS
:
4753 return verify_gimple_assign_single (stmt
);
4755 case GIMPLE_UNARY_RHS
:
4756 return verify_gimple_assign_unary (stmt
);
4758 case GIMPLE_BINARY_RHS
:
4759 return verify_gimple_assign_binary (stmt
);
4761 case GIMPLE_TERNARY_RHS
:
4762 return verify_gimple_assign_ternary (stmt
);
4769 /* Verify the contents of a GIMPLE_RETURN STMT. Returns true when there
4770 is a problem, otherwise false. */
4773 verify_gimple_return (greturn
*stmt
)
4775 tree op
= gimple_return_retval (stmt
);
4776 tree restype
= TREE_TYPE (TREE_TYPE (cfun
->decl
));
4778 /* We cannot test for present return values as we do not fix up missing
4779 return values from the original source. */
4783 if (!is_gimple_val (op
)
4784 && TREE_CODE (op
) != RESULT_DECL
)
4786 error ("invalid operand in return statement");
4787 debug_generic_stmt (op
);
4791 if ((TREE_CODE (op
) == RESULT_DECL
4792 && DECL_BY_REFERENCE (op
))
4793 || (TREE_CODE (op
) == SSA_NAME
4794 && SSA_NAME_VAR (op
)
4795 && TREE_CODE (SSA_NAME_VAR (op
)) == RESULT_DECL
4796 && DECL_BY_REFERENCE (SSA_NAME_VAR (op
))))
4797 op
= TREE_TYPE (op
);
4799 if (!useless_type_conversion_p (restype
, TREE_TYPE (op
)))
4801 error ("invalid conversion in return statement");
4802 debug_generic_stmt (restype
);
4803 debug_generic_stmt (TREE_TYPE (op
));
4811 /* Verify the contents of a GIMPLE_GOTO STMT. Returns true when there
4812 is a problem, otherwise false. */
4815 verify_gimple_goto (ggoto
*stmt
)
4817 tree dest
= gimple_goto_dest (stmt
);
4819 /* ??? We have two canonical forms of direct goto destinations, a
4820 bare LABEL_DECL and an ADDR_EXPR of a LABEL_DECL. */
4821 if (TREE_CODE (dest
) != LABEL_DECL
4822 && (!is_gimple_val (dest
)
4823 || !POINTER_TYPE_P (TREE_TYPE (dest
))))
4825 error ("goto destination is neither a label nor a pointer");
4832 /* Verify the contents of a GIMPLE_SWITCH STMT. Returns true when there
4833 is a problem, otherwise false. */
4836 verify_gimple_switch (gswitch
*stmt
)
4839 tree elt
, prev_upper_bound
= NULL_TREE
;
4840 tree index_type
, elt_type
= NULL_TREE
;
4842 if (!is_gimple_val (gimple_switch_index (stmt
)))
4844 error ("invalid operand to switch statement");
4845 debug_generic_stmt (gimple_switch_index (stmt
));
4849 index_type
= TREE_TYPE (gimple_switch_index (stmt
));
4850 if (! INTEGRAL_TYPE_P (index_type
))
4852 error ("non-integral type switch statement");
4853 debug_generic_expr (index_type
);
4857 elt
= gimple_switch_label (stmt
, 0);
4858 if (CASE_LOW (elt
) != NULL_TREE
4859 || CASE_HIGH (elt
) != NULL_TREE
4860 || CASE_CHAIN (elt
) != NULL_TREE
)
4862 error ("invalid default case label in switch statement");
4863 debug_generic_expr (elt
);
4867 n
= gimple_switch_num_labels (stmt
);
4868 for (i
= 1; i
< n
; i
++)
4870 elt
= gimple_switch_label (stmt
, i
);
4872 if (CASE_CHAIN (elt
))
4874 error ("invalid %<CASE_CHAIN%>");
4875 debug_generic_expr (elt
);
4878 if (! CASE_LOW (elt
))
4880 error ("invalid case label in switch statement");
4881 debug_generic_expr (elt
);
4885 && ! tree_int_cst_lt (CASE_LOW (elt
), CASE_HIGH (elt
)))
4887 error ("invalid case range in switch statement");
4888 debug_generic_expr (elt
);
4894 elt_type
= TREE_TYPE (CASE_LOW (elt
));
4895 if (TYPE_PRECISION (index_type
) < TYPE_PRECISION (elt_type
))
4897 error ("type precision mismatch in switch statement");
4901 if (TREE_TYPE (CASE_LOW (elt
)) != elt_type
4902 || (CASE_HIGH (elt
) && TREE_TYPE (CASE_HIGH (elt
)) != elt_type
))
4904 error ("type mismatch for case label in switch statement");
4905 debug_generic_expr (elt
);
4909 if (prev_upper_bound
)
4911 if (! tree_int_cst_lt (prev_upper_bound
, CASE_LOW (elt
)))
4913 error ("case labels not sorted in switch statement");
4918 prev_upper_bound
= CASE_HIGH (elt
);
4919 if (! prev_upper_bound
)
4920 prev_upper_bound
= CASE_LOW (elt
);
4926 /* Verify a gimple debug statement STMT.
4927 Returns true if anything is wrong. */
4930 verify_gimple_debug (gimple
*stmt ATTRIBUTE_UNUSED
)
4932 /* There isn't much that could be wrong in a gimple debug stmt. A
4933 gimple debug bind stmt, for example, maps a tree, that's usually
4934 a VAR_DECL or a PARM_DECL, but that could also be some scalarized
4935 component or member of an aggregate type, to another tree, that
4936 can be an arbitrary expression. These stmts expand into debug
4937 insns, and are converted to debug notes by var-tracking.cc. */
4941 /* Verify a gimple label statement STMT.
4942 Returns true if anything is wrong. */
4945 verify_gimple_label (glabel
*stmt
)
4947 tree decl
= gimple_label_label (stmt
);
4951 if (TREE_CODE (decl
) != LABEL_DECL
)
4953 if (!DECL_NONLOCAL (decl
) && !FORCED_LABEL (decl
)
4954 && DECL_CONTEXT (decl
) != current_function_decl
)
4956 error ("label context is not the current function declaration");
4960 uid
= LABEL_DECL_UID (decl
);
4963 || (*label_to_block_map_for_fn (cfun
))[uid
] != gimple_bb (stmt
)))
4965 error ("incorrect entry in %<label_to_block_map%>");
4969 uid
= EH_LANDING_PAD_NR (decl
);
4972 eh_landing_pad lp
= get_eh_landing_pad_from_number (uid
);
4973 if (decl
!= lp
->post_landing_pad
)
4975 error ("incorrect setting of landing pad number");
4983 /* Verify a gimple cond statement STMT.
4984 Returns true if anything is wrong. */
4987 verify_gimple_cond (gcond
*stmt
)
4989 if (TREE_CODE_CLASS (gimple_cond_code (stmt
)) != tcc_comparison
)
4991 error ("invalid comparison code in gimple cond");
4994 if (!(!gimple_cond_true_label (stmt
)
4995 || TREE_CODE (gimple_cond_true_label (stmt
)) == LABEL_DECL
)
4996 || !(!gimple_cond_false_label (stmt
)
4997 || TREE_CODE (gimple_cond_false_label (stmt
)) == LABEL_DECL
))
4999 error ("invalid labels in gimple cond");
5003 return verify_gimple_comparison (boolean_type_node
,
5004 gimple_cond_lhs (stmt
),
5005 gimple_cond_rhs (stmt
),
5006 gimple_cond_code (stmt
));
5009 /* Verify the GIMPLE statement STMT. Returns true if there is an
5010 error, otherwise false. */
5013 verify_gimple_stmt (gimple
*stmt
)
5015 switch (gimple_code (stmt
))
5018 return verify_gimple_assign (as_a
<gassign
*> (stmt
));
5021 return verify_gimple_label (as_a
<glabel
*> (stmt
));
5024 return verify_gimple_call (as_a
<gcall
*> (stmt
));
5027 return verify_gimple_cond (as_a
<gcond
*> (stmt
));
5030 return verify_gimple_goto (as_a
<ggoto
*> (stmt
));
5033 return verify_gimple_switch (as_a
<gswitch
*> (stmt
));
5036 return verify_gimple_return (as_a
<greturn
*> (stmt
));
5041 case GIMPLE_TRANSACTION
:
5042 return verify_gimple_transaction (as_a
<gtransaction
*> (stmt
));
5044 /* Tuples that do not have tree operands. */
5046 case GIMPLE_PREDICT
:
5048 case GIMPLE_EH_DISPATCH
:
5049 case GIMPLE_EH_MUST_NOT_THROW
:
5053 /* OpenMP directives are validated by the FE and never operated
5054 on by the optimizers. Furthermore, GIMPLE_OMP_FOR may contain
5055 non-gimple expressions when the main index variable has had
5056 its address taken. This does not affect the loop itself
5057 because the header of an GIMPLE_OMP_FOR is merely used to determine
5058 how to setup the parallel iteration. */
5062 return verify_gimple_debug (stmt
);
5069 /* Verify the contents of a GIMPLE_PHI. Returns true if there is a problem,
5070 and false otherwise. */
5073 verify_gimple_phi (gphi
*phi
)
5077 tree phi_result
= gimple_phi_result (phi
);
5082 error ("invalid %<PHI%> result");
5086 virtual_p
= virtual_operand_p (phi_result
);
5087 if (TREE_CODE (phi_result
) != SSA_NAME
5089 && SSA_NAME_VAR (phi_result
) != gimple_vop (cfun
)))
5091 error ("invalid %<PHI%> result");
5095 for (i
= 0; i
< gimple_phi_num_args (phi
); i
++)
5097 tree t
= gimple_phi_arg_def (phi
, i
);
5101 error ("missing %<PHI%> def");
5105 /* Addressable variables do have SSA_NAMEs but they
5106 are not considered gimple values. */
5107 else if ((TREE_CODE (t
) == SSA_NAME
5108 && virtual_p
!= virtual_operand_p (t
))
5110 && (TREE_CODE (t
) != SSA_NAME
5111 || SSA_NAME_VAR (t
) != gimple_vop (cfun
)))
5113 && !is_gimple_val (t
)))
5115 error ("invalid %<PHI%> argument");
5116 debug_generic_expr (t
);
5119 #ifdef ENABLE_TYPES_CHECKING
5120 if (!useless_type_conversion_p (TREE_TYPE (phi_result
), TREE_TYPE (t
)))
5122 error ("incompatible types in %<PHI%> argument %u", i
);
5123 debug_generic_stmt (TREE_TYPE (phi_result
));
5124 debug_generic_stmt (TREE_TYPE (t
));
5133 /* Verify the GIMPLE statements inside the sequence STMTS. */
5136 verify_gimple_in_seq_2 (gimple_seq stmts
)
5138 gimple_stmt_iterator ittr
;
5141 for (ittr
= gsi_start (stmts
); !gsi_end_p (ittr
); gsi_next (&ittr
))
5143 gimple
*stmt
= gsi_stmt (ittr
);
5145 switch (gimple_code (stmt
))
5148 err
|= verify_gimple_in_seq_2 (
5149 gimple_bind_body (as_a
<gbind
*> (stmt
)));
5153 err
|= verify_gimple_in_seq_2 (gimple_try_eval (stmt
));
5154 err
|= verify_gimple_in_seq_2 (gimple_try_cleanup (stmt
));
5157 case GIMPLE_EH_FILTER
:
5158 err
|= verify_gimple_in_seq_2 (gimple_eh_filter_failure (stmt
));
5161 case GIMPLE_EH_ELSE
:
5163 geh_else
*eh_else
= as_a
<geh_else
*> (stmt
);
5164 err
|= verify_gimple_in_seq_2 (gimple_eh_else_n_body (eh_else
));
5165 err
|= verify_gimple_in_seq_2 (gimple_eh_else_e_body (eh_else
));
5170 err
|= verify_gimple_in_seq_2 (gimple_catch_handler (
5171 as_a
<gcatch
*> (stmt
)));
5174 case GIMPLE_TRANSACTION
:
5175 err
|= verify_gimple_transaction (as_a
<gtransaction
*> (stmt
));
5180 bool err2
= verify_gimple_stmt (stmt
);
5182 debug_gimple_stmt (stmt
);
5191 /* Verify the contents of a GIMPLE_TRANSACTION. Returns true if there
5192 is a problem, otherwise false. */
5195 verify_gimple_transaction (gtransaction
*stmt
)
5199 lab
= gimple_transaction_label_norm (stmt
);
5200 if (lab
!= NULL
&& TREE_CODE (lab
) != LABEL_DECL
)
5202 lab
= gimple_transaction_label_uninst (stmt
);
5203 if (lab
!= NULL
&& TREE_CODE (lab
) != LABEL_DECL
)
5205 lab
= gimple_transaction_label_over (stmt
);
5206 if (lab
!= NULL
&& TREE_CODE (lab
) != LABEL_DECL
)
5209 return verify_gimple_in_seq_2 (gimple_transaction_body (stmt
));
5213 /* Verify the GIMPLE statements inside the statement list STMTS. */
5216 verify_gimple_in_seq (gimple_seq stmts
)
5218 timevar_push (TV_TREE_STMT_VERIFY
);
5219 if (verify_gimple_in_seq_2 (stmts
))
5220 internal_error ("%<verify_gimple%> failed");
5221 timevar_pop (TV_TREE_STMT_VERIFY
);
5224 /* Return true when the T can be shared. */
5227 tree_node_can_be_shared (tree t
)
5229 if (IS_TYPE_OR_DECL_P (t
)
5230 || TREE_CODE (t
) == SSA_NAME
5231 || TREE_CODE (t
) == IDENTIFIER_NODE
5232 || TREE_CODE (t
) == CASE_LABEL_EXPR
5233 || is_gimple_min_invariant (t
))
5236 if (t
== error_mark_node
)
5242 /* Called via walk_tree. Verify tree sharing. */
5245 verify_node_sharing_1 (tree
*tp
, int *walk_subtrees
, void *data
)
5247 hash_set
<void *> *visited
= (hash_set
<void *> *) data
;
5249 if (tree_node_can_be_shared (*tp
))
5251 *walk_subtrees
= false;
5255 if (visited
->add (*tp
))
5261 /* Called via walk_gimple_stmt. Verify tree sharing. */
5264 verify_node_sharing (tree
*tp
, int *walk_subtrees
, void *data
)
5266 struct walk_stmt_info
*wi
= (struct walk_stmt_info
*) data
;
5267 return verify_node_sharing_1 (tp
, walk_subtrees
, wi
->info
);
5270 static bool eh_error_found
;
5272 verify_eh_throw_stmt_node (gimple
*const &stmt
, const int &,
5273 hash_set
<gimple
*> *visited
)
5275 if (!visited
->contains (stmt
))
5277 error ("dead statement in EH table");
5278 debug_gimple_stmt (stmt
);
5279 eh_error_found
= true;
5284 /* Verify if the location LOCs block is in BLOCKS. */
5287 verify_location (hash_set
<tree
> *blocks
, location_t loc
)
5289 tree block
= LOCATION_BLOCK (loc
);
5290 if (block
!= NULL_TREE
5291 && !blocks
->contains (block
))
5293 error ("location references block not in block tree");
5296 if (block
!= NULL_TREE
)
5297 return verify_location (blocks
, BLOCK_SOURCE_LOCATION (block
));
5301 /* Called via walk_tree. Verify that expressions have no blocks. */
5304 verify_expr_no_block (tree
*tp
, int *walk_subtrees
, void *)
5308 *walk_subtrees
= false;
5312 location_t loc
= EXPR_LOCATION (*tp
);
5313 if (LOCATION_BLOCK (loc
) != NULL
)
5319 /* Called via walk_tree. Verify locations of expressions. */
5322 verify_expr_location_1 (tree
*tp
, int *walk_subtrees
, void *data
)
5324 hash_set
<tree
> *blocks
= (hash_set
<tree
> *) data
;
5327 /* ??? This doesn't really belong here but there's no good place to
5328 stick this remainder of old verify_expr. */
5329 /* ??? This barfs on debug stmts which contain binds to vars with
5330 different function context. */
5333 || TREE_CODE (t
) == PARM_DECL
5334 || TREE_CODE (t
) == RESULT_DECL
)
5336 tree context
= decl_function_context (t
);
5337 if (context
!= cfun
->decl
5338 && !SCOPE_FILE_SCOPE_P (context
)
5340 && !DECL_EXTERNAL (t
))
5342 error ("local declaration from a different function");
5348 if (VAR_P (t
) && DECL_HAS_DEBUG_EXPR_P (t
))
5350 tree x
= DECL_DEBUG_EXPR (t
);
5351 tree addr
= walk_tree (&x
, verify_expr_no_block
, NULL
, NULL
);
5356 || TREE_CODE (t
) == PARM_DECL
5357 || TREE_CODE (t
) == RESULT_DECL
)
5358 && DECL_HAS_VALUE_EXPR_P (t
))
5360 tree x
= DECL_VALUE_EXPR (t
);
5361 tree addr
= walk_tree (&x
, verify_expr_no_block
, NULL
, NULL
);
5368 *walk_subtrees
= false;
5372 location_t loc
= EXPR_LOCATION (t
);
5373 if (verify_location (blocks
, loc
))
5379 /* Called via walk_gimple_op. Verify locations of expressions. */
5382 verify_expr_location (tree
*tp
, int *walk_subtrees
, void *data
)
5384 struct walk_stmt_info
*wi
= (struct walk_stmt_info
*) data
;
5385 return verify_expr_location_1 (tp
, walk_subtrees
, wi
->info
);
5388 /* Insert all subblocks of BLOCK into BLOCKS and recurse. */
5391 collect_subblocks (hash_set
<tree
> *blocks
, tree block
)
5394 for (t
= BLOCK_SUBBLOCKS (block
); t
; t
= BLOCK_CHAIN (t
))
5397 collect_subblocks (blocks
, t
);
5401 /* Disable warnings about missing quoting in GCC diagnostics for
5402 the verification errors. Their format strings don't follow
5403 GCC diagnostic conventions and trigger an ICE in the end. */
5405 # pragma GCC diagnostic push
5406 # pragma GCC diagnostic ignored "-Wformat-diag"
5409 /* Verify the GIMPLE statements in the CFG of FN. */
5412 verify_gimple_in_cfg (struct function
*fn
, bool verify_nothrow
)
5417 timevar_push (TV_TREE_STMT_VERIFY
);
5418 hash_set
<void *> visited
;
5419 hash_set
<gimple
*> visited_throwing_stmts
;
5421 /* Collect all BLOCKs referenced by the BLOCK tree of FN. */
5422 hash_set
<tree
> blocks
;
5423 if (DECL_INITIAL (fn
->decl
))
5425 blocks
.add (DECL_INITIAL (fn
->decl
));
5426 collect_subblocks (&blocks
, DECL_INITIAL (fn
->decl
));
5429 FOR_EACH_BB_FN (bb
, fn
)
5431 gimple_stmt_iterator gsi
;
5435 for (gphi_iterator gpi
= gsi_start_phis (bb
);
5439 gphi
*phi
= gpi
.phi ();
5443 if (gimple_bb (phi
) != bb
)
5445 error ("gimple_bb (phi) is set to a wrong basic block");
5449 err2
|= verify_gimple_phi (phi
);
5451 /* Only PHI arguments have locations. */
5452 if (gimple_location (phi
) != UNKNOWN_LOCATION
)
5454 error ("PHI node with location");
5458 for (i
= 0; i
< gimple_phi_num_args (phi
); i
++)
5460 tree arg
= gimple_phi_arg_def (phi
, i
);
5461 tree addr
= walk_tree (&arg
, verify_node_sharing_1
,
5465 error ("incorrect sharing of tree nodes");
5466 debug_generic_expr (addr
);
5469 location_t loc
= gimple_phi_arg_location (phi
, i
);
5470 if (virtual_operand_p (gimple_phi_result (phi
))
5471 && loc
!= UNKNOWN_LOCATION
)
5473 error ("virtual PHI with argument locations");
5476 addr
= walk_tree (&arg
, verify_expr_location_1
, &blocks
, NULL
);
5479 debug_generic_expr (addr
);
5482 err2
|= verify_location (&blocks
, loc
);
5486 debug_gimple_stmt (phi
);
5490 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
5492 gimple
*stmt
= gsi_stmt (gsi
);
5494 struct walk_stmt_info wi
;
5498 if (gimple_bb (stmt
) != bb
)
5500 error ("gimple_bb (stmt) is set to a wrong basic block");
5504 err2
|= verify_gimple_stmt (stmt
);
5505 err2
|= verify_location (&blocks
, gimple_location (stmt
));
5507 memset (&wi
, 0, sizeof (wi
));
5508 wi
.info
= (void *) &visited
;
5509 addr
= walk_gimple_op (stmt
, verify_node_sharing
, &wi
);
5512 error ("incorrect sharing of tree nodes");
5513 debug_generic_expr (addr
);
5517 memset (&wi
, 0, sizeof (wi
));
5518 wi
.info
= (void *) &blocks
;
5519 addr
= walk_gimple_op (stmt
, verify_expr_location
, &wi
);
5522 debug_generic_expr (addr
);
5526 /* If the statement is marked as part of an EH region, then it is
5527 expected that the statement could throw. Verify that when we
5528 have optimizations that simplify statements such that we prove
5529 that they cannot throw, that we update other data structures
5531 lp_nr
= lookup_stmt_eh_lp (stmt
);
5533 visited_throwing_stmts
.add (stmt
);
5536 if (!stmt_could_throw_p (cfun
, stmt
))
5540 error ("statement marked for throw, but doesn%'t");
5544 else if (!gsi_one_before_end_p (gsi
))
5546 error ("statement marked for throw in middle of block");
5552 debug_gimple_stmt (stmt
);
5556 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
5557 if (e
->goto_locus
!= UNKNOWN_LOCATION
)
5558 err
|= verify_location (&blocks
, e
->goto_locus
);
5561 hash_map
<gimple
*, int> *eh_table
= get_eh_throw_stmt_table (cfun
);
5562 eh_error_found
= false;
5564 eh_table
->traverse
<hash_set
<gimple
*> *, verify_eh_throw_stmt_node
>
5565 (&visited_throwing_stmts
);
5567 if (err
|| eh_error_found
)
5568 internal_error ("verify_gimple failed");
5570 verify_histograms ();
5571 timevar_pop (TV_TREE_STMT_VERIFY
);
5575 /* Verifies that the flow information is OK. */
5578 gimple_verify_flow_info (void)
5582 gimple_stmt_iterator gsi
;
5587 if (ENTRY_BLOCK_PTR_FOR_FN (cfun
)->il
.gimple
.seq
5588 || ENTRY_BLOCK_PTR_FOR_FN (cfun
)->il
.gimple
.phi_nodes
)
5590 error ("ENTRY_BLOCK has IL associated with it");
5594 if (EXIT_BLOCK_PTR_FOR_FN (cfun
)->il
.gimple
.seq
5595 || EXIT_BLOCK_PTR_FOR_FN (cfun
)->il
.gimple
.phi_nodes
)
5597 error ("EXIT_BLOCK has IL associated with it");
5601 FOR_EACH_EDGE (e
, ei
, EXIT_BLOCK_PTR_FOR_FN (cfun
)->preds
)
5602 if (e
->flags
& EDGE_FALLTHRU
)
5604 error ("fallthru to exit from bb %d", e
->src
->index
);
5608 FOR_EACH_BB_FN (bb
, cfun
)
5610 bool found_ctrl_stmt
= false;
5614 /* Skip labels on the start of basic block. */
5615 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
5618 gimple
*prev_stmt
= stmt
;
5620 stmt
= gsi_stmt (gsi
);
5622 if (gimple_code (stmt
) != GIMPLE_LABEL
)
5625 label
= gimple_label_label (as_a
<glabel
*> (stmt
));
5626 if (prev_stmt
&& DECL_NONLOCAL (label
))
5628 error ("nonlocal label %qD is not first in a sequence "
5629 "of labels in bb %d", label
, bb
->index
);
5633 if (prev_stmt
&& EH_LANDING_PAD_NR (label
) != 0)
5635 error ("EH landing pad label %qD is not first in a sequence "
5636 "of labels in bb %d", label
, bb
->index
);
5640 if (label_to_block (cfun
, label
) != bb
)
5642 error ("label %qD to block does not match in bb %d",
5647 if (decl_function_context (label
) != current_function_decl
)
5649 error ("label %qD has incorrect context in bb %d",
5655 /* Verify that body of basic block BB is free of control flow. */
5656 for (; !gsi_end_p (gsi
); gsi_next (&gsi
))
5658 gimple
*stmt
= gsi_stmt (gsi
);
5660 if (found_ctrl_stmt
)
5662 error ("control flow in the middle of basic block %d",
5667 if (stmt_ends_bb_p (stmt
))
5668 found_ctrl_stmt
= true;
5670 if (glabel
*label_stmt
= dyn_cast
<glabel
*> (stmt
))
5672 error ("label %qD in the middle of basic block %d",
5673 gimple_label_label (label_stmt
), bb
->index
);
5678 gsi
= gsi_last_nondebug_bb (bb
);
5679 if (gsi_end_p (gsi
))
5682 stmt
= gsi_stmt (gsi
);
5684 if (gimple_code (stmt
) == GIMPLE_LABEL
)
5687 err
|= verify_eh_edges (stmt
);
5689 if (is_ctrl_stmt (stmt
))
5691 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
5692 if (e
->flags
& EDGE_FALLTHRU
)
5694 error ("fallthru edge after a control statement in bb %d",
5700 if (gimple_code (stmt
) != GIMPLE_COND
)
5702 /* Verify that there are no edges with EDGE_TRUE/FALSE_FLAG set
5703 after anything else but if statement. */
5704 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
5705 if (e
->flags
& (EDGE_TRUE_VALUE
| EDGE_FALSE_VALUE
))
5707 error ("true/false edge after a non-GIMPLE_COND in bb %d",
5713 switch (gimple_code (stmt
))
5720 extract_true_false_edges_from_block (bb
, &true_edge
, &false_edge
);
5724 || !(true_edge
->flags
& EDGE_TRUE_VALUE
)
5725 || !(false_edge
->flags
& EDGE_FALSE_VALUE
)
5726 || (true_edge
->flags
& (EDGE_FALLTHRU
| EDGE_ABNORMAL
))
5727 || (false_edge
->flags
& (EDGE_FALLTHRU
| EDGE_ABNORMAL
))
5728 || EDGE_COUNT (bb
->succs
) >= 3)
5730 error ("wrong outgoing edge flags at end of bb %d",
5738 if (simple_goto_p (stmt
))
5740 error ("explicit goto at end of bb %d", bb
->index
);
5745 /* FIXME. We should double check that the labels in the
5746 destination blocks have their address taken. */
5747 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
5748 if ((e
->flags
& (EDGE_FALLTHRU
| EDGE_TRUE_VALUE
5749 | EDGE_FALSE_VALUE
))
5750 || !(e
->flags
& EDGE_ABNORMAL
))
5752 error ("wrong outgoing edge flags at end of bb %d",
5760 if (!gimple_call_builtin_p (stmt
, BUILT_IN_RETURN
))
5764 if (!single_succ_p (bb
)
5765 || (single_succ_edge (bb
)->flags
5766 & (EDGE_FALLTHRU
| EDGE_ABNORMAL
5767 | EDGE_TRUE_VALUE
| EDGE_FALSE_VALUE
)))
5769 error ("wrong outgoing edge flags at end of bb %d", bb
->index
);
5772 if (single_succ (bb
) != EXIT_BLOCK_PTR_FOR_FN (cfun
))
5774 error ("return edge does not point to exit in bb %d",
5782 gswitch
*switch_stmt
= as_a
<gswitch
*> (stmt
);
5787 n
= gimple_switch_num_labels (switch_stmt
);
5789 /* Mark all the destination basic blocks. */
5790 for (i
= 0; i
< n
; ++i
)
5792 basic_block label_bb
= gimple_switch_label_bb (cfun
, switch_stmt
, i
);
5793 gcc_assert (!label_bb
->aux
|| label_bb
->aux
== (void *)1);
5794 label_bb
->aux
= (void *)1;
5797 /* Verify that the case labels are sorted. */
5798 prev
= gimple_switch_label (switch_stmt
, 0);
5799 for (i
= 1; i
< n
; ++i
)
5801 tree c
= gimple_switch_label (switch_stmt
, i
);
5804 error ("found default case not at the start of "
5810 && !tree_int_cst_lt (CASE_LOW (prev
), CASE_LOW (c
)))
5812 error ("case labels not sorted: ");
5813 print_generic_expr (stderr
, prev
);
5814 fprintf (stderr
," is greater than ");
5815 print_generic_expr (stderr
, c
);
5816 fprintf (stderr
," but comes before it.\n");
5821 /* VRP will remove the default case if it can prove it will
5822 never be executed. So do not verify there always exists
5823 a default case here. */
5825 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
5829 error ("extra outgoing edge %d->%d",
5830 bb
->index
, e
->dest
->index
);
5834 e
->dest
->aux
= (void *)2;
5835 if ((e
->flags
& (EDGE_FALLTHRU
| EDGE_ABNORMAL
5836 | EDGE_TRUE_VALUE
| EDGE_FALSE_VALUE
)))
5838 error ("wrong outgoing edge flags at end of bb %d",
5844 /* Check that we have all of them. */
5845 for (i
= 0; i
< n
; ++i
)
5847 basic_block label_bb
= gimple_switch_label_bb (cfun
,
5850 if (label_bb
->aux
!= (void *)2)
5852 error ("missing edge %i->%i", bb
->index
, label_bb
->index
);
5857 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
5858 e
->dest
->aux
= (void *)0;
5862 case GIMPLE_EH_DISPATCH
:
5863 err
|= verify_eh_dispatch_edge (as_a
<geh_dispatch
*> (stmt
));
5871 if (dom_info_state (CDI_DOMINATORS
) >= DOM_NO_FAST_QUERY
)
5872 verify_dominators (CDI_DOMINATORS
);
5878 # pragma GCC diagnostic pop
5881 /* Updates phi nodes after creating a forwarder block joined
5882 by edge FALLTHRU. */
5885 gimple_make_forwarder_block (edge fallthru
)
5889 basic_block dummy
, bb
;
5892 bool forward_location_p
;
5894 dummy
= fallthru
->src
;
5895 bb
= fallthru
->dest
;
5897 if (single_pred_p (bb
))
5900 /* We can forward location info if we have only one predecessor. */
5901 forward_location_p
= single_pred_p (dummy
);
5903 /* If we redirected a branch we must create new PHI nodes at the
5905 for (gsi
= gsi_start_phis (dummy
); !gsi_end_p (gsi
); gsi_next (&gsi
))
5907 gphi
*phi
, *new_phi
;
5910 var
= gimple_phi_result (phi
);
5911 new_phi
= create_phi_node (var
, bb
);
5912 gimple_phi_set_result (phi
, copy_ssa_name (var
, phi
));
5913 add_phi_arg (new_phi
, gimple_phi_result (phi
), fallthru
,
5915 ? gimple_phi_arg_location (phi
, 0) : UNKNOWN_LOCATION
);
5918 /* Add the arguments we have stored on edges. */
5919 FOR_EACH_EDGE (e
, ei
, bb
->preds
)
5924 flush_pending_stmts (e
);
5929 /* Return a non-special label in the head of basic block BLOCK.
5930 Create one if it doesn't exist. */
5933 gimple_block_label (basic_block bb
)
5935 gimple_stmt_iterator i
, s
= gsi_start_bb (bb
);
5940 for (i
= s
; !gsi_end_p (i
); first
= false, gsi_next (&i
))
5942 stmt
= dyn_cast
<glabel
*> (gsi_stmt (i
));
5945 label
= gimple_label_label (stmt
);
5946 if (!DECL_NONLOCAL (label
))
5949 gsi_move_before (&i
, &s
);
5954 label
= create_artificial_label (UNKNOWN_LOCATION
);
5955 stmt
= gimple_build_label (label
);
5956 gsi_insert_before (&s
, stmt
, GSI_NEW_STMT
);
5961 /* Attempt to perform edge redirection by replacing a possibly complex
5962 jump instruction by a goto or by removing the jump completely.
5963 This can apply only if all edges now point to the same block. The
5964 parameters and return values are equivalent to
5965 redirect_edge_and_branch. */
5968 gimple_try_redirect_by_replacing_jump (edge e
, basic_block target
)
5970 basic_block src
= e
->src
;
5971 gimple_stmt_iterator i
;
5974 /* We can replace or remove a complex jump only when we have exactly
5976 if (EDGE_COUNT (src
->succs
) != 2
5977 /* Verify that all targets will be TARGET. Specifically, the
5978 edge that is not E must also go to TARGET. */
5979 || EDGE_SUCC (src
, EDGE_SUCC (src
, 0) == e
)->dest
!= target
)
5982 i
= gsi_last_bb (src
);
5986 stmt
= gsi_stmt (i
);
5988 if (gimple_code (stmt
) == GIMPLE_COND
|| gimple_code (stmt
) == GIMPLE_SWITCH
)
5990 gsi_remove (&i
, true);
5991 e
= ssa_redirect_edge (e
, target
);
5992 e
->flags
= EDGE_FALLTHRU
;
6000 /* Redirect E to DEST. Return NULL on failure. Otherwise, return the
6001 edge representing the redirected branch. */
6004 gimple_redirect_edge_and_branch (edge e
, basic_block dest
)
6006 basic_block bb
= e
->src
;
6007 gimple_stmt_iterator gsi
;
6011 if (e
->flags
& EDGE_ABNORMAL
)
6014 if (e
->dest
== dest
)
6017 if (e
->flags
& EDGE_EH
)
6018 return redirect_eh_edge (e
, dest
);
6020 if (e
->src
!= ENTRY_BLOCK_PTR_FOR_FN (cfun
))
6022 ret
= gimple_try_redirect_by_replacing_jump (e
, dest
);
6027 gsi
= gsi_last_nondebug_bb (bb
);
6028 stmt
= gsi_end_p (gsi
) ? NULL
: gsi_stmt (gsi
);
6030 switch (stmt
? gimple_code (stmt
) : GIMPLE_ERROR_MARK
)
6033 /* For COND_EXPR, we only need to redirect the edge. */
6037 /* No non-abnormal edges should lead from a non-simple goto, and
6038 simple ones should be represented implicitly. */
6043 gswitch
*switch_stmt
= as_a
<gswitch
*> (stmt
);
6044 tree label
= gimple_block_label (dest
);
6045 tree cases
= get_cases_for_edge (e
, switch_stmt
);
6047 /* If we have a list of cases associated with E, then use it
6048 as it's a lot faster than walking the entire case vector. */
6051 edge e2
= find_edge (e
->src
, dest
);
6058 CASE_LABEL (cases
) = label
;
6059 cases
= CASE_CHAIN (cases
);
6062 /* If there was already an edge in the CFG, then we need
6063 to move all the cases associated with E to E2. */
6066 tree cases2
= get_cases_for_edge (e2
, switch_stmt
);
6068 CASE_CHAIN (last
) = CASE_CHAIN (cases2
);
6069 CASE_CHAIN (cases2
) = first
;
6071 bitmap_set_bit (touched_switch_bbs
, gimple_bb (stmt
)->index
);
6075 size_t i
, n
= gimple_switch_num_labels (switch_stmt
);
6077 for (i
= 0; i
< n
; i
++)
6079 tree elt
= gimple_switch_label (switch_stmt
, i
);
6080 if (label_to_block (cfun
, CASE_LABEL (elt
)) == e
->dest
)
6081 CASE_LABEL (elt
) = label
;
6089 gasm
*asm_stmt
= as_a
<gasm
*> (stmt
);
6090 int i
, n
= gimple_asm_nlabels (asm_stmt
);
6093 for (i
= 0; i
< n
; ++i
)
6095 tree cons
= gimple_asm_label_op (asm_stmt
, i
);
6096 if (label_to_block (cfun
, TREE_VALUE (cons
)) == e
->dest
)
6099 label
= gimple_block_label (dest
);
6100 TREE_VALUE (cons
) = label
;
6104 /* If we didn't find any label matching the former edge in the
6105 asm labels, we must be redirecting the fallthrough
6107 gcc_assert (label
|| (e
->flags
& EDGE_FALLTHRU
));
6112 gsi_remove (&gsi
, true);
6113 e
->flags
|= EDGE_FALLTHRU
;
6116 case GIMPLE_OMP_RETURN
:
6117 case GIMPLE_OMP_CONTINUE
:
6118 case GIMPLE_OMP_SECTIONS_SWITCH
:
6119 case GIMPLE_OMP_FOR
:
6120 /* The edges from OMP constructs can be simply redirected. */
6123 case GIMPLE_EH_DISPATCH
:
6124 if (!(e
->flags
& EDGE_FALLTHRU
))
6125 redirect_eh_dispatch_edge (as_a
<geh_dispatch
*> (stmt
), e
, dest
);
6128 case GIMPLE_TRANSACTION
:
6129 if (e
->flags
& EDGE_TM_ABORT
)
6130 gimple_transaction_set_label_over (as_a
<gtransaction
*> (stmt
),
6131 gimple_block_label (dest
));
6132 else if (e
->flags
& EDGE_TM_UNINSTRUMENTED
)
6133 gimple_transaction_set_label_uninst (as_a
<gtransaction
*> (stmt
),
6134 gimple_block_label (dest
));
6136 gimple_transaction_set_label_norm (as_a
<gtransaction
*> (stmt
),
6137 gimple_block_label (dest
));
6141 /* Otherwise it must be a fallthru edge, and we don't need to
6142 do anything besides redirecting it. */
6143 gcc_assert (e
->flags
& EDGE_FALLTHRU
);
6147 /* Update/insert PHI nodes as necessary. */
6149 /* Now update the edges in the CFG. */
6150 e
= ssa_redirect_edge (e
, dest
);
6155 /* Returns true if it is possible to remove edge E by redirecting
6156 it to the destination of the other edge from E->src. */
6159 gimple_can_remove_branch_p (const_edge e
)
6161 if (e
->flags
& (EDGE_ABNORMAL
| EDGE_EH
))
6167 /* Simple wrapper, as we can always redirect fallthru edges. */
6170 gimple_redirect_edge_and_branch_force (edge e
, basic_block dest
)
6172 e
= gimple_redirect_edge_and_branch (e
, dest
);
6179 /* Splits basic block BB after statement STMT (but at least after the
6180 labels). If STMT is NULL, BB is split just after the labels. */
6183 gimple_split_block (basic_block bb
, void *stmt
)
6185 gimple_stmt_iterator gsi
;
6186 gimple_stmt_iterator gsi_tgt
;
6192 new_bb
= create_empty_bb (bb
);
6194 /* Redirect the outgoing edges. */
6195 new_bb
->succs
= bb
->succs
;
6197 FOR_EACH_EDGE (e
, ei
, new_bb
->succs
)
6200 /* Get a stmt iterator pointing to the first stmt to move. */
6201 if (!stmt
|| gimple_code ((gimple
*) stmt
) == GIMPLE_LABEL
)
6202 gsi
= gsi_after_labels (bb
);
6205 gsi
= gsi_for_stmt ((gimple
*) stmt
);
6209 /* Move everything from GSI to the new basic block. */
6210 if (gsi_end_p (gsi
))
6213 /* Split the statement list - avoid re-creating new containers as this
6214 brings ugly quadratic memory consumption in the inliner.
6215 (We are still quadratic since we need to update stmt BB pointers,
6217 gsi_split_seq_before (&gsi
, &list
);
6218 set_bb_seq (new_bb
, list
);
6219 for (gsi_tgt
= gsi_start (list
);
6220 !gsi_end_p (gsi_tgt
); gsi_next (&gsi_tgt
))
6221 gimple_set_bb (gsi_stmt (gsi_tgt
), new_bb
);
6227 /* Moves basic block BB after block AFTER. */
6230 gimple_move_block_after (basic_block bb
, basic_block after
)
6232 if (bb
->prev_bb
== after
)
6236 link_block (bb
, after
);
6242 /* Return TRUE if block BB has no executable statements, otherwise return
6246 gimple_empty_block_p (basic_block bb
)
6248 /* BB must have no executable statements. */
6249 gimple_stmt_iterator gsi
= gsi_after_labels (bb
);
6252 while (!gsi_end_p (gsi
))
6254 gimple
*stmt
= gsi_stmt (gsi
);
6255 if (is_gimple_debug (stmt
))
6257 else if (gimple_code (stmt
) == GIMPLE_NOP
6258 || gimple_code (stmt
) == GIMPLE_PREDICT
)
6268 /* Split a basic block if it ends with a conditional branch and if the
6269 other part of the block is not empty. */
6272 gimple_split_block_before_cond_jump (basic_block bb
)
6274 gimple
*last
, *split_point
;
6275 gimple_stmt_iterator gsi
= gsi_last_nondebug_bb (bb
);
6276 if (gsi_end_p (gsi
))
6278 last
= gsi_stmt (gsi
);
6279 if (gimple_code (last
) != GIMPLE_COND
6280 && gimple_code (last
) != GIMPLE_SWITCH
)
6283 split_point
= gsi_stmt (gsi
);
6284 return split_block (bb
, split_point
)->dest
;
6288 /* Return true if basic_block can be duplicated. */
6291 gimple_can_duplicate_bb_p (const_basic_block bb
)
6293 gimple
*last
= last_stmt (CONST_CAST_BB (bb
));
6295 /* Do checks that can only fail for the last stmt, to minimize the work in the
6298 /* A transaction is a single entry multiple exit region. It
6299 must be duplicated in its entirety or not at all. */
6300 if (gimple_code (last
) == GIMPLE_TRANSACTION
)
6303 /* An IFN_UNIQUE call must be duplicated as part of its group,
6305 if (is_gimple_call (last
)
6306 && gimple_call_internal_p (last
)
6307 && gimple_call_internal_unique_p (last
))
6311 for (gimple_stmt_iterator gsi
= gsi_start_bb (CONST_CAST_BB (bb
));
6312 !gsi_end_p (gsi
); gsi_next (&gsi
))
6314 gimple
*g
= gsi_stmt (gsi
);
6316 /* An IFN_GOMP_SIMT_ENTER_ALLOC/IFN_GOMP_SIMT_EXIT call must be
6317 duplicated as part of its group, or not at all.
6318 The IFN_GOMP_SIMT_VOTE_ANY and IFN_GOMP_SIMT_XCHG_* are part of such a
6319 group, so the same holds there. */
6320 if (is_gimple_call (g
)
6321 && (gimple_call_internal_p (g
, IFN_GOMP_SIMT_ENTER_ALLOC
)
6322 || gimple_call_internal_p (g
, IFN_GOMP_SIMT_EXIT
)
6323 || gimple_call_internal_p (g
, IFN_GOMP_SIMT_VOTE_ANY
)
6324 || gimple_call_internal_p (g
, IFN_GOMP_SIMT_XCHG_BFLY
)
6325 || gimple_call_internal_p (g
, IFN_GOMP_SIMT_XCHG_IDX
)))
6332 /* Create a duplicate of the basic block BB. NOTE: This does not
6333 preserve SSA form. */
6336 gimple_duplicate_bb (basic_block bb
, copy_bb_data
*id
)
6339 gimple_stmt_iterator gsi_tgt
;
6341 new_bb
= create_empty_bb (EXIT_BLOCK_PTR_FOR_FN (cfun
)->prev_bb
);
6343 /* Copy the PHI nodes. We ignore PHI node arguments here because
6344 the incoming edges have not been setup yet. */
6345 for (gphi_iterator gpi
= gsi_start_phis (bb
);
6351 copy
= create_phi_node (NULL_TREE
, new_bb
);
6352 create_new_def_for (gimple_phi_result (phi
), copy
,
6353 gimple_phi_result_ptr (copy
));
6354 gimple_set_uid (copy
, gimple_uid (phi
));
6357 gsi_tgt
= gsi_start_bb (new_bb
);
6358 for (gimple_stmt_iterator gsi
= gsi_start_bb (bb
);
6362 def_operand_p def_p
;
6363 ssa_op_iter op_iter
;
6365 gimple
*stmt
, *copy
;
6367 stmt
= gsi_stmt (gsi
);
6368 if (gimple_code (stmt
) == GIMPLE_LABEL
)
6371 /* Don't duplicate label debug stmts. */
6372 if (gimple_debug_bind_p (stmt
)
6373 && TREE_CODE (gimple_debug_bind_get_var (stmt
))
6377 /* Create a new copy of STMT and duplicate STMT's virtual
6379 copy
= gimple_copy (stmt
);
6380 gsi_insert_after (&gsi_tgt
, copy
, GSI_NEW_STMT
);
6382 maybe_duplicate_eh_stmt (copy
, stmt
);
6383 gimple_duplicate_stmt_histograms (cfun
, copy
, cfun
, stmt
);
6385 /* When copying around a stmt writing into a local non-user
6386 aggregate, make sure it won't share stack slot with other
6388 lhs
= gimple_get_lhs (stmt
);
6389 if (lhs
&& TREE_CODE (lhs
) != SSA_NAME
)
6391 tree base
= get_base_address (lhs
);
6393 && (VAR_P (base
) || TREE_CODE (base
) == RESULT_DECL
)
6394 && DECL_IGNORED_P (base
)
6395 && !TREE_STATIC (base
)
6396 && !DECL_EXTERNAL (base
)
6397 && (!VAR_P (base
) || !DECL_HAS_VALUE_EXPR_P (base
)))
6398 DECL_NONSHAREABLE (base
) = 1;
6401 /* If requested remap dependence info of cliques brought in
6404 for (unsigned i
= 0; i
< gimple_num_ops (copy
); ++i
)
6406 tree op
= gimple_op (copy
, i
);
6409 if (TREE_CODE (op
) == ADDR_EXPR
6410 || TREE_CODE (op
) == WITH_SIZE_EXPR
)
6411 op
= TREE_OPERAND (op
, 0);
6412 while (handled_component_p (op
))
6413 op
= TREE_OPERAND (op
, 0);
6414 if ((TREE_CODE (op
) == MEM_REF
6415 || TREE_CODE (op
) == TARGET_MEM_REF
)
6416 && MR_DEPENDENCE_CLIQUE (op
) > 1
6417 && MR_DEPENDENCE_CLIQUE (op
) != bb
->loop_father
->owned_clique
)
6419 if (!id
->dependence_map
)
6420 id
->dependence_map
= new hash_map
<dependence_hash
,
6423 unsigned short &newc
= id
->dependence_map
->get_or_insert
6424 (MR_DEPENDENCE_CLIQUE (op
), &existed
);
6427 gcc_assert (MR_DEPENDENCE_CLIQUE (op
) <= cfun
->last_clique
);
6428 newc
= ++cfun
->last_clique
;
6430 MR_DEPENDENCE_CLIQUE (op
) = newc
;
6434 /* Create new names for all the definitions created by COPY and
6435 add replacement mappings for each new name. */
6436 FOR_EACH_SSA_DEF_OPERAND (def_p
, copy
, op_iter
, SSA_OP_ALL_DEFS
)
6437 create_new_def_for (DEF_FROM_PTR (def_p
), copy
, def_p
);
6443 /* Adds phi node arguments for edge E_COPY after basic block duplication. */
6446 add_phi_args_after_copy_edge (edge e_copy
)
6448 basic_block bb
, bb_copy
= e_copy
->src
, dest
;
6451 gphi
*phi
, *phi_copy
;
6453 gphi_iterator psi
, psi_copy
;
6455 if (gimple_seq_empty_p (phi_nodes (e_copy
->dest
)))
6458 bb
= bb_copy
->flags
& BB_DUPLICATED
? get_bb_original (bb_copy
) : bb_copy
;
6460 if (e_copy
->dest
->flags
& BB_DUPLICATED
)
6461 dest
= get_bb_original (e_copy
->dest
);
6463 dest
= e_copy
->dest
;
6465 e
= find_edge (bb
, dest
);
6468 /* During loop unrolling the target of the latch edge is copied.
6469 In this case we are not looking for edge to dest, but to
6470 duplicated block whose original was dest. */
6471 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
6473 if ((e
->dest
->flags
& BB_DUPLICATED
)
6474 && get_bb_original (e
->dest
) == dest
)
6478 gcc_assert (e
!= NULL
);
6481 for (psi
= gsi_start_phis (e
->dest
),
6482 psi_copy
= gsi_start_phis (e_copy
->dest
);
6484 gsi_next (&psi
), gsi_next (&psi_copy
))
6487 phi_copy
= psi_copy
.phi ();
6488 def
= PHI_ARG_DEF_FROM_EDGE (phi
, e
);
6489 add_phi_arg (phi_copy
, def
, e_copy
,
6490 gimple_phi_arg_location_from_edge (phi
, e
));
6495 /* Basic block BB_COPY was created by code duplication. Add phi node
6496 arguments for edges going out of BB_COPY. The blocks that were
6497 duplicated have BB_DUPLICATED set. */
6500 add_phi_args_after_copy_bb (basic_block bb_copy
)
6505 FOR_EACH_EDGE (e_copy
, ei
, bb_copy
->succs
)
6507 add_phi_args_after_copy_edge (e_copy
);
6511 /* Blocks in REGION_COPY array of length N_REGION were created by
6512 duplication of basic blocks. Add phi node arguments for edges
6513 going from these blocks. If E_COPY is not NULL, also add
6514 phi node arguments for its destination.*/
6517 add_phi_args_after_copy (basic_block
*region_copy
, unsigned n_region
,
6522 for (i
= 0; i
< n_region
; i
++)
6523 region_copy
[i
]->flags
|= BB_DUPLICATED
;
6525 for (i
= 0; i
< n_region
; i
++)
6526 add_phi_args_after_copy_bb (region_copy
[i
]);
6528 add_phi_args_after_copy_edge (e_copy
);
6530 for (i
= 0; i
< n_region
; i
++)
6531 region_copy
[i
]->flags
&= ~BB_DUPLICATED
;
6534 /* Duplicates a REGION (set of N_REGION basic blocks) with just a single
6535 important exit edge EXIT. By important we mean that no SSA name defined
6536 inside region is live over the other exit edges of the region. All entry
6537 edges to the region must go to ENTRY->dest. The edge ENTRY is redirected
6538 to the duplicate of the region. Dominance and loop information is
6539 updated if UPDATE_DOMINANCE is true, but not the SSA web. If
6540 UPDATE_DOMINANCE is false then we assume that the caller will update the
6541 dominance information after calling this function. The new basic
6542 blocks are stored to REGION_COPY in the same order as they had in REGION,
6543 provided that REGION_COPY is not NULL.
6544 The function returns false if it is unable to copy the region,
6548 gimple_duplicate_sese_region (edge entry
, edge exit
,
6549 basic_block
*region
, unsigned n_region
,
6550 basic_block
*region_copy
,
6551 bool update_dominance
)
6554 bool free_region_copy
= false, copying_header
= false;
6555 class loop
*loop
= entry
->dest
->loop_father
;
6558 profile_count total_count
= profile_count::uninitialized ();
6559 profile_count entry_count
= profile_count::uninitialized ();
6561 if (!can_copy_bbs_p (region
, n_region
))
6564 /* Some sanity checking. Note that we do not check for all possible
6565 missuses of the functions. I.e. if you ask to copy something weird,
6566 it will work, but the state of structures probably will not be
6568 for (i
= 0; i
< n_region
; i
++)
6570 /* We do not handle subloops, i.e. all the blocks must belong to the
6572 if (region
[i
]->loop_father
!= loop
)
6575 if (region
[i
] != entry
->dest
6576 && region
[i
] == loop
->header
)
6580 /* In case the function is used for loop header copying (which is the primary
6581 use), ensure that EXIT and its copy will be new latch and entry edges. */
6582 if (loop
->header
== entry
->dest
)
6584 copying_header
= true;
6586 if (!dominated_by_p (CDI_DOMINATORS
, loop
->latch
, exit
->src
))
6589 for (i
= 0; i
< n_region
; i
++)
6590 if (region
[i
] != exit
->src
6591 && dominated_by_p (CDI_DOMINATORS
, region
[i
], exit
->src
))
6595 initialize_original_copy_tables ();
6598 set_loop_copy (loop
, loop_outer (loop
));
6600 set_loop_copy (loop
, loop
);
6604 region_copy
= XNEWVEC (basic_block
, n_region
);
6605 free_region_copy
= true;
6608 /* Record blocks outside the region that are dominated by something
6610 auto_vec
<basic_block
> doms
;
6611 if (update_dominance
)
6613 doms
= get_dominated_by_region (CDI_DOMINATORS
, region
, n_region
);
6616 if (entry
->dest
->count
.initialized_p ())
6618 total_count
= entry
->dest
->count
;
6619 entry_count
= entry
->count ();
6620 /* Fix up corner cases, to avoid division by zero or creation of negative
6622 if (entry_count
> total_count
)
6623 entry_count
= total_count
;
6626 copy_bbs (region
, n_region
, region_copy
, &exit
, 1, &exit_copy
, loop
,
6627 split_edge_bb_loc (entry
), update_dominance
);
6628 if (total_count
.initialized_p () && entry_count
.initialized_p ())
6630 scale_bbs_frequencies_profile_count (region
, n_region
,
6631 total_count
- entry_count
,
6633 scale_bbs_frequencies_profile_count (region_copy
, n_region
, entry_count
,
6639 loop
->header
= exit
->dest
;
6640 loop
->latch
= exit
->src
;
6643 /* Redirect the entry and add the phi node arguments. */
6644 redirected
= redirect_edge_and_branch (entry
, get_bb_copy (entry
->dest
));
6645 gcc_assert (redirected
!= NULL
);
6646 flush_pending_stmts (entry
);
6648 /* Concerning updating of dominators: We must recount dominators
6649 for entry block and its copy. Anything that is outside of the
6650 region, but was dominated by something inside needs recounting as
6652 if (update_dominance
)
6654 set_immediate_dominator (CDI_DOMINATORS
, entry
->dest
, entry
->src
);
6655 doms
.safe_push (get_bb_original (entry
->dest
));
6656 iterate_fix_dominators (CDI_DOMINATORS
, doms
, false);
6659 /* Add the other PHI node arguments. */
6660 add_phi_args_after_copy (region_copy
, n_region
, NULL
);
6662 if (free_region_copy
)
6665 free_original_copy_tables ();
6669 /* Checks if BB is part of the region defined by N_REGION BBS. */
6671 bb_part_of_region_p (basic_block bb
, basic_block
* bbs
, unsigned n_region
)
6675 for (n
= 0; n
< n_region
; n
++)
6683 /* Duplicates REGION consisting of N_REGION blocks. The new blocks
6684 are stored to REGION_COPY in the same order in that they appear
6685 in REGION, if REGION_COPY is not NULL. ENTRY is the entry to
6686 the region, EXIT an exit from it. The condition guarding EXIT
6687 is moved to ENTRY. Returns true if duplication succeeds, false
6713 gimple_duplicate_sese_tail (edge entry
, edge exit
,
6714 basic_block
*region
, unsigned n_region
,
6715 basic_block
*region_copy
)
6718 bool free_region_copy
= false;
6719 class loop
*loop
= exit
->dest
->loop_father
;
6720 class loop
*orig_loop
= entry
->dest
->loop_father
;
6721 basic_block switch_bb
, entry_bb
, nentry_bb
;
6722 profile_count total_count
= profile_count::uninitialized (),
6723 exit_count
= profile_count::uninitialized ();
6724 edge exits
[2], nexits
[2], e
;
6725 gimple_stmt_iterator gsi
;
6728 basic_block exit_bb
;
6732 class loop
*target
, *aloop
, *cloop
;
6734 gcc_assert (EDGE_COUNT (exit
->src
->succs
) == 2);
6736 exits
[1] = EDGE_SUCC (exit
->src
, EDGE_SUCC (exit
->src
, 0) == exit
);
6738 if (!can_copy_bbs_p (region
, n_region
))
6741 initialize_original_copy_tables ();
6742 set_loop_copy (orig_loop
, loop
);
6745 for (aloop
= orig_loop
->inner
; aloop
; aloop
= aloop
->next
)
6747 if (bb_part_of_region_p (aloop
->header
, region
, n_region
))
6749 cloop
= duplicate_loop (aloop
, target
);
6750 duplicate_subloops (aloop
, cloop
);
6756 region_copy
= XNEWVEC (basic_block
, n_region
);
6757 free_region_copy
= true;
6760 gcc_assert (!need_ssa_update_p (cfun
));
6762 /* Record blocks outside the region that are dominated by something
6764 auto_vec
<basic_block
> doms
= get_dominated_by_region (CDI_DOMINATORS
, region
,
6767 total_count
= exit
->src
->count
;
6768 exit_count
= exit
->count ();
6769 /* Fix up corner cases, to avoid division by zero or creation of negative
6771 if (exit_count
> total_count
)
6772 exit_count
= total_count
;
6774 copy_bbs (region
, n_region
, region_copy
, exits
, 2, nexits
, orig_loop
,
6775 split_edge_bb_loc (exit
), true);
6776 if (total_count
.initialized_p () && exit_count
.initialized_p ())
6778 scale_bbs_frequencies_profile_count (region
, n_region
,
6779 total_count
- exit_count
,
6781 scale_bbs_frequencies_profile_count (region_copy
, n_region
, exit_count
,
6785 /* Create the switch block, and put the exit condition to it. */
6786 entry_bb
= entry
->dest
;
6787 nentry_bb
= get_bb_copy (entry_bb
);
6788 if (!last_stmt (entry
->src
)
6789 || !stmt_ends_bb_p (last_stmt (entry
->src
)))
6790 switch_bb
= entry
->src
;
6792 switch_bb
= split_edge (entry
);
6793 set_immediate_dominator (CDI_DOMINATORS
, nentry_bb
, switch_bb
);
6795 gsi
= gsi_last_bb (switch_bb
);
6796 cond_stmt
= last_stmt (exit
->src
);
6797 gcc_assert (gimple_code (cond_stmt
) == GIMPLE_COND
);
6798 cond_stmt
= gimple_copy (cond_stmt
);
6800 gsi_insert_after (&gsi
, cond_stmt
, GSI_NEW_STMT
);
6802 sorig
= single_succ_edge (switch_bb
);
6803 sorig
->flags
= exits
[1]->flags
;
6804 sorig
->probability
= exits
[1]->probability
;
6805 snew
= make_edge (switch_bb
, nentry_bb
, exits
[0]->flags
);
6806 snew
->probability
= exits
[0]->probability
;
6809 /* Register the new edge from SWITCH_BB in loop exit lists. */
6810 rescan_loop_exit (snew
, true, false);
6812 /* Add the PHI node arguments. */
6813 add_phi_args_after_copy (region_copy
, n_region
, snew
);
6815 /* Get rid of now superfluous conditions and associated edges (and phi node
6817 exit_bb
= exit
->dest
;
6819 e
= redirect_edge_and_branch (exits
[0], exits
[1]->dest
);
6820 PENDING_STMT (e
) = NULL
;
6822 /* The latch of ORIG_LOOP was copied, and so was the backedge
6823 to the original header. We redirect this backedge to EXIT_BB. */
6824 for (i
= 0; i
< n_region
; i
++)
6825 if (get_bb_original (region_copy
[i
]) == orig_loop
->latch
)
6827 gcc_assert (single_succ_edge (region_copy
[i
]));
6828 e
= redirect_edge_and_branch (single_succ_edge (region_copy
[i
]), exit_bb
);
6829 PENDING_STMT (e
) = NULL
;
6830 for (psi
= gsi_start_phis (exit_bb
);
6835 def
= PHI_ARG_DEF (phi
, nexits
[0]->dest_idx
);
6836 add_phi_arg (phi
, def
, e
, gimple_phi_arg_location_from_edge (phi
, e
));
6839 e
= redirect_edge_and_branch (nexits
[1], nexits
[0]->dest
);
6840 PENDING_STMT (e
) = NULL
;
6842 /* Anything that is outside of the region, but was dominated by something
6843 inside needs to update dominance info. */
6844 iterate_fix_dominators (CDI_DOMINATORS
, doms
, false);
6845 /* Update the SSA web. */
6846 update_ssa (TODO_update_ssa
);
6848 if (free_region_copy
)
6851 free_original_copy_tables ();
6855 /* Add all the blocks dominated by ENTRY to the array BBS_P. Stop
6856 adding blocks when the dominator traversal reaches EXIT. This
6857 function silently assumes that ENTRY strictly dominates EXIT. */
6860 gather_blocks_in_sese_region (basic_block entry
, basic_block exit
,
6861 vec
<basic_block
> *bbs_p
)
6865 for (son
= first_dom_son (CDI_DOMINATORS
, entry
);
6867 son
= next_dom_son (CDI_DOMINATORS
, son
))
6869 bbs_p
->safe_push (son
);
6871 gather_blocks_in_sese_region (son
, exit
, bbs_p
);
6875 /* Replaces *TP with a duplicate (belonging to function TO_CONTEXT).
6876 The duplicates are recorded in VARS_MAP. */
6879 replace_by_duplicate_decl (tree
*tp
, hash_map
<tree
, tree
> *vars_map
,
6882 tree t
= *tp
, new_t
;
6883 struct function
*f
= DECL_STRUCT_FUNCTION (to_context
);
6885 if (DECL_CONTEXT (t
) == to_context
)
6889 tree
&loc
= vars_map
->get_or_insert (t
, &existed
);
6895 new_t
= copy_var_decl (t
, DECL_NAME (t
), TREE_TYPE (t
));
6896 add_local_decl (f
, new_t
);
6900 gcc_assert (TREE_CODE (t
) == CONST_DECL
);
6901 new_t
= copy_node (t
);
6903 DECL_CONTEXT (new_t
) = to_context
;
6914 /* Creates an ssa name in TO_CONTEXT equivalent to NAME.
6915 VARS_MAP maps old ssa names and var_decls to the new ones. */
6918 replace_ssa_name (tree name
, hash_map
<tree
, tree
> *vars_map
,
6923 gcc_assert (!virtual_operand_p (name
));
6925 tree
*loc
= vars_map
->get (name
);
6929 tree decl
= SSA_NAME_VAR (name
);
6932 gcc_assert (!SSA_NAME_IS_DEFAULT_DEF (name
));
6933 replace_by_duplicate_decl (&decl
, vars_map
, to_context
);
6934 new_name
= make_ssa_name_fn (DECL_STRUCT_FUNCTION (to_context
),
6935 decl
, SSA_NAME_DEF_STMT (name
));
6938 new_name
= copy_ssa_name_fn (DECL_STRUCT_FUNCTION (to_context
),
6939 name
, SSA_NAME_DEF_STMT (name
));
6941 /* Now that we've used the def stmt to define new_name, make sure it
6942 doesn't define name anymore. */
6943 SSA_NAME_DEF_STMT (name
) = NULL
;
6945 vars_map
->put (name
, new_name
);
6959 hash_map
<tree
, tree
> *vars_map
;
6960 htab_t new_label_map
;
6961 hash_map
<void *, void *> *eh_map
;
6965 /* Helper for move_block_to_fn. Set TREE_BLOCK in every expression
6966 contained in *TP if it has been ORIG_BLOCK previously and change the
6967 DECL_CONTEXT of every local variable referenced in *TP. */
6970 move_stmt_op (tree
*tp
, int *walk_subtrees
, void *data
)
6972 struct walk_stmt_info
*wi
= (struct walk_stmt_info
*) data
;
6973 struct move_stmt_d
*p
= (struct move_stmt_d
*) wi
->info
;
6978 tree block
= TREE_BLOCK (t
);
6979 if (block
== NULL_TREE
)
6981 else if (block
== p
->orig_block
6982 || p
->orig_block
== NULL_TREE
)
6984 /* tree_node_can_be_shared says we can share invariant
6985 addresses but unshare_expr copies them anyways. Make sure
6986 to unshare before adjusting the block in place - we do not
6987 always see a copy here. */
6988 if (TREE_CODE (t
) == ADDR_EXPR
6989 && is_gimple_min_invariant (t
))
6990 *tp
= t
= unshare_expr (t
);
6991 TREE_SET_BLOCK (t
, p
->new_block
);
6993 else if (flag_checking
)
6995 while (block
&& TREE_CODE (block
) == BLOCK
&& block
!= p
->orig_block
)
6996 block
= BLOCK_SUPERCONTEXT (block
);
6997 gcc_assert (block
== p
->orig_block
);
7000 else if (DECL_P (t
) || TREE_CODE (t
) == SSA_NAME
)
7002 if (TREE_CODE (t
) == SSA_NAME
)
7003 *tp
= replace_ssa_name (t
, p
->vars_map
, p
->to_context
);
7004 else if (TREE_CODE (t
) == PARM_DECL
7005 && gimple_in_ssa_p (cfun
))
7006 *tp
= *(p
->vars_map
->get (t
));
7007 else if (TREE_CODE (t
) == LABEL_DECL
)
7009 if (p
->new_label_map
)
7011 struct tree_map in
, *out
;
7013 out
= (struct tree_map
*)
7014 htab_find_with_hash (p
->new_label_map
, &in
, DECL_UID (t
));
7019 /* For FORCED_LABELs we can end up with references from other
7020 functions if some SESE regions are outlined. It is UB to
7021 jump in between them, but they could be used just for printing
7022 addresses etc. In that case, DECL_CONTEXT on the label should
7023 be the function containing the glabel stmt with that LABEL_DECL,
7024 rather than whatever function a reference to the label was seen
7026 if (!FORCED_LABEL (t
) && !DECL_NONLOCAL (t
))
7027 DECL_CONTEXT (t
) = p
->to_context
;
7029 else if (p
->remap_decls_p
)
7031 /* Replace T with its duplicate. T should no longer appear in the
7032 parent function, so this looks wasteful; however, it may appear
7033 in referenced_vars, and more importantly, as virtual operands of
7034 statements, and in alias lists of other variables. It would be
7035 quite difficult to expunge it from all those places. ??? It might
7036 suffice to do this for addressable variables. */
7037 if ((VAR_P (t
) && !is_global_var (t
))
7038 || TREE_CODE (t
) == CONST_DECL
)
7039 replace_by_duplicate_decl (tp
, p
->vars_map
, p
->to_context
);
7043 else if (TYPE_P (t
))
7049 /* Helper for move_stmt_r. Given an EH region number for the source
7050 function, map that to the duplicate EH regio number in the dest. */
7053 move_stmt_eh_region_nr (int old_nr
, struct move_stmt_d
*p
)
7055 eh_region old_r
, new_r
;
7057 old_r
= get_eh_region_from_number (old_nr
);
7058 new_r
= static_cast<eh_region
> (*p
->eh_map
->get (old_r
));
7060 return new_r
->index
;
7063 /* Similar, but operate on INTEGER_CSTs. */
7066 move_stmt_eh_region_tree_nr (tree old_t_nr
, struct move_stmt_d
*p
)
7070 old_nr
= tree_to_shwi (old_t_nr
);
7071 new_nr
= move_stmt_eh_region_nr (old_nr
, p
);
7073 return build_int_cst (integer_type_node
, new_nr
);
7076 /* Like move_stmt_op, but for gimple statements.
7078 Helper for move_block_to_fn. Set GIMPLE_BLOCK in every expression
7079 contained in the current statement in *GSI_P and change the
7080 DECL_CONTEXT of every local variable referenced in the current
7084 move_stmt_r (gimple_stmt_iterator
*gsi_p
, bool *handled_ops_p
,
7085 struct walk_stmt_info
*wi
)
7087 struct move_stmt_d
*p
= (struct move_stmt_d
*) wi
->info
;
7088 gimple
*stmt
= gsi_stmt (*gsi_p
);
7089 tree block
= gimple_block (stmt
);
7091 if (block
== p
->orig_block
7092 || (p
->orig_block
== NULL_TREE
7093 && block
!= NULL_TREE
))
7094 gimple_set_block (stmt
, p
->new_block
);
7096 switch (gimple_code (stmt
))
7099 /* Remap the region numbers for __builtin_eh_{pointer,filter}. */
7101 tree r
, fndecl
= gimple_call_fndecl (stmt
);
7102 if (fndecl
&& fndecl_built_in_p (fndecl
, BUILT_IN_NORMAL
))
7103 switch (DECL_FUNCTION_CODE (fndecl
))
7105 case BUILT_IN_EH_COPY_VALUES
:
7106 r
= gimple_call_arg (stmt
, 1);
7107 r
= move_stmt_eh_region_tree_nr (r
, p
);
7108 gimple_call_set_arg (stmt
, 1, r
);
7111 case BUILT_IN_EH_POINTER
:
7112 case BUILT_IN_EH_FILTER
:
7113 r
= gimple_call_arg (stmt
, 0);
7114 r
= move_stmt_eh_region_tree_nr (r
, p
);
7115 gimple_call_set_arg (stmt
, 0, r
);
7126 gresx
*resx_stmt
= as_a
<gresx
*> (stmt
);
7127 int r
= gimple_resx_region (resx_stmt
);
7128 r
= move_stmt_eh_region_nr (r
, p
);
7129 gimple_resx_set_region (resx_stmt
, r
);
7133 case GIMPLE_EH_DISPATCH
:
7135 geh_dispatch
*eh_dispatch_stmt
= as_a
<geh_dispatch
*> (stmt
);
7136 int r
= gimple_eh_dispatch_region (eh_dispatch_stmt
);
7137 r
= move_stmt_eh_region_nr (r
, p
);
7138 gimple_eh_dispatch_set_region (eh_dispatch_stmt
, r
);
7142 case GIMPLE_OMP_RETURN
:
7143 case GIMPLE_OMP_CONTINUE
:
7148 /* For FORCED_LABEL, move_stmt_op doesn't adjust DECL_CONTEXT,
7149 so that such labels can be referenced from other regions.
7150 Make sure to update it when seeing a GIMPLE_LABEL though,
7151 that is the owner of the label. */
7152 walk_gimple_op (stmt
, move_stmt_op
, wi
);
7153 *handled_ops_p
= true;
7154 tree label
= gimple_label_label (as_a
<glabel
*> (stmt
));
7155 if (FORCED_LABEL (label
) || DECL_NONLOCAL (label
))
7156 DECL_CONTEXT (label
) = p
->to_context
;
7161 if (is_gimple_omp (stmt
))
7163 /* Do not remap variables inside OMP directives. Variables
7164 referenced in clauses and directive header belong to the
7165 parent function and should not be moved into the child
7167 bool save_remap_decls_p
= p
->remap_decls_p
;
7168 p
->remap_decls_p
= false;
7169 *handled_ops_p
= true;
7171 walk_gimple_seq_mod (gimple_omp_body_ptr (stmt
), move_stmt_r
,
7174 p
->remap_decls_p
= save_remap_decls_p
;
7182 /* Move basic block BB from function CFUN to function DEST_FN. The
7183 block is moved out of the original linked list and placed after
7184 block AFTER in the new list. Also, the block is removed from the
7185 original array of blocks and placed in DEST_FN's array of blocks.
7186 If UPDATE_EDGE_COUNT_P is true, the edge counts on both CFGs is
7187 updated to reflect the moved edges.
7189 The local variables are remapped to new instances, VARS_MAP is used
7190 to record the mapping. */
7193 move_block_to_fn (struct function
*dest_cfun
, basic_block bb
,
7194 basic_block after
, bool update_edge_count_p
,
7195 struct move_stmt_d
*d
)
7197 struct control_flow_graph
*cfg
;
7200 gimple_stmt_iterator si
;
7203 /* Remove BB from dominance structures. */
7204 delete_from_dominance_info (CDI_DOMINATORS
, bb
);
7206 /* Move BB from its current loop to the copy in the new function. */
7209 class loop
*new_loop
= (class loop
*)bb
->loop_father
->aux
;
7211 bb
->loop_father
= new_loop
;
7214 /* Link BB to the new linked list. */
7215 move_block_after (bb
, after
);
7217 /* Update the edge count in the corresponding flowgraphs. */
7218 if (update_edge_count_p
)
7219 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
7221 cfun
->cfg
->x_n_edges
--;
7222 dest_cfun
->cfg
->x_n_edges
++;
7225 /* Remove BB from the original basic block array. */
7226 (*cfun
->cfg
->x_basic_block_info
)[bb
->index
] = NULL
;
7227 cfun
->cfg
->x_n_basic_blocks
--;
7229 /* Grow DEST_CFUN's basic block array if needed. */
7230 cfg
= dest_cfun
->cfg
;
7231 cfg
->x_n_basic_blocks
++;
7232 if (bb
->index
>= cfg
->x_last_basic_block
)
7233 cfg
->x_last_basic_block
= bb
->index
+ 1;
7235 old_len
= vec_safe_length (cfg
->x_basic_block_info
);
7236 if ((unsigned) cfg
->x_last_basic_block
>= old_len
)
7237 vec_safe_grow_cleared (cfg
->x_basic_block_info
,
7238 cfg
->x_last_basic_block
+ 1);
7240 (*cfg
->x_basic_block_info
)[bb
->index
] = bb
;
7242 /* Remap the variables in phi nodes. */
7243 for (gphi_iterator psi
= gsi_start_phis (bb
);
7246 gphi
*phi
= psi
.phi ();
7248 tree op
= PHI_RESULT (phi
);
7252 if (virtual_operand_p (op
))
7254 /* Remove the phi nodes for virtual operands (alias analysis will be
7255 run for the new function, anyway). But replace all uses that
7256 might be outside of the region we move. */
7257 use_operand_p use_p
;
7258 imm_use_iterator iter
;
7260 FOR_EACH_IMM_USE_STMT (use_stmt
, iter
, op
)
7261 FOR_EACH_IMM_USE_ON_STMT (use_p
, iter
)
7262 SET_USE (use_p
, SSA_NAME_VAR (op
));
7263 remove_phi_node (&psi
, true);
7267 SET_PHI_RESULT (phi
,
7268 replace_ssa_name (op
, d
->vars_map
, dest_cfun
->decl
));
7269 FOR_EACH_PHI_ARG (use
, phi
, oi
, SSA_OP_USE
)
7271 op
= USE_FROM_PTR (use
);
7272 if (TREE_CODE (op
) == SSA_NAME
)
7273 SET_USE (use
, replace_ssa_name (op
, d
->vars_map
, dest_cfun
->decl
));
7276 for (i
= 0; i
< EDGE_COUNT (bb
->preds
); i
++)
7278 location_t locus
= gimple_phi_arg_location (phi
, i
);
7279 tree block
= LOCATION_BLOCK (locus
);
7281 if (locus
== UNKNOWN_LOCATION
)
7283 if (d
->orig_block
== NULL_TREE
|| block
== d
->orig_block
)
7285 locus
= set_block (locus
, d
->new_block
);
7286 gimple_phi_arg_set_location (phi
, i
, locus
);
7293 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
7295 gimple
*stmt
= gsi_stmt (si
);
7296 struct walk_stmt_info wi
;
7298 memset (&wi
, 0, sizeof (wi
));
7300 walk_gimple_stmt (&si
, move_stmt_r
, move_stmt_op
, &wi
);
7302 if (glabel
*label_stmt
= dyn_cast
<glabel
*> (stmt
))
7304 tree label
= gimple_label_label (label_stmt
);
7305 int uid
= LABEL_DECL_UID (label
);
7307 gcc_assert (uid
> -1);
7309 old_len
= vec_safe_length (cfg
->x_label_to_block_map
);
7310 if (old_len
<= (unsigned) uid
)
7311 vec_safe_grow_cleared (cfg
->x_label_to_block_map
, uid
+ 1);
7313 (*cfg
->x_label_to_block_map
)[uid
] = bb
;
7314 (*cfun
->cfg
->x_label_to_block_map
)[uid
] = NULL
;
7316 gcc_assert (DECL_CONTEXT (label
) == dest_cfun
->decl
);
7318 if (uid
>= dest_cfun
->cfg
->last_label_uid
)
7319 dest_cfun
->cfg
->last_label_uid
= uid
+ 1;
7322 maybe_duplicate_eh_stmt_fn (dest_cfun
, stmt
, cfun
, stmt
, d
->eh_map
, 0);
7323 remove_stmt_from_eh_lp_fn (cfun
, stmt
);
7325 gimple_duplicate_stmt_histograms (dest_cfun
, stmt
, cfun
, stmt
);
7326 gimple_remove_stmt_histograms (cfun
, stmt
);
7328 /* We cannot leave any operands allocated from the operand caches of
7329 the current function. */
7330 free_stmt_operands (cfun
, stmt
);
7331 push_cfun (dest_cfun
);
7333 if (is_gimple_call (stmt
))
7334 notice_special_calls (as_a
<gcall
*> (stmt
));
7338 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
7339 if (e
->goto_locus
!= UNKNOWN_LOCATION
)
7341 tree block
= LOCATION_BLOCK (e
->goto_locus
);
7342 if (d
->orig_block
== NULL_TREE
7343 || block
== d
->orig_block
)
7344 e
->goto_locus
= set_block (e
->goto_locus
, d
->new_block
);
7348 /* Examine the statements in BB (which is in SRC_CFUN); find and return
7349 the outermost EH region. Use REGION as the incoming base EH region.
7350 If there is no single outermost region, return NULL and set *ALL to
7354 find_outermost_region_in_block (struct function
*src_cfun
,
7355 basic_block bb
, eh_region region
,
7358 gimple_stmt_iterator si
;
7360 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
7362 gimple
*stmt
= gsi_stmt (si
);
7363 eh_region stmt_region
;
7366 lp_nr
= lookup_stmt_eh_lp_fn (src_cfun
, stmt
);
7367 stmt_region
= get_eh_region_from_lp_number_fn (src_cfun
, lp_nr
);
7371 region
= stmt_region
;
7372 else if (stmt_region
!= region
)
7374 region
= eh_region_outermost (src_cfun
, stmt_region
, region
);
7388 new_label_mapper (tree decl
, void *data
)
7390 htab_t hash
= (htab_t
) data
;
7394 gcc_assert (TREE_CODE (decl
) == LABEL_DECL
);
7396 m
= XNEW (struct tree_map
);
7397 m
->hash
= DECL_UID (decl
);
7398 m
->base
.from
= decl
;
7399 m
->to
= create_artificial_label (UNKNOWN_LOCATION
);
7400 LABEL_DECL_UID (m
->to
) = LABEL_DECL_UID (decl
);
7401 if (LABEL_DECL_UID (m
->to
) >= cfun
->cfg
->last_label_uid
)
7402 cfun
->cfg
->last_label_uid
= LABEL_DECL_UID (m
->to
) + 1;
7404 slot
= htab_find_slot_with_hash (hash
, m
, m
->hash
, INSERT
);
7405 gcc_assert (*slot
== NULL
);
7412 /* Tree walker to replace the decls used inside value expressions by
7416 replace_block_vars_by_duplicates_1 (tree
*tp
, int *walk_subtrees
, void *data
)
7418 struct replace_decls_d
*rd
= (struct replace_decls_d
*)data
;
7420 switch (TREE_CODE (*tp
))
7425 replace_by_duplicate_decl (tp
, rd
->vars_map
, rd
->to_context
);
7431 if (IS_TYPE_OR_DECL_P (*tp
))
7432 *walk_subtrees
= false;
7437 /* Change DECL_CONTEXT of all BLOCK_VARS in block, including
7441 replace_block_vars_by_duplicates (tree block
, hash_map
<tree
, tree
> *vars_map
,
7446 for (tp
= &BLOCK_VARS (block
); *tp
; tp
= &DECL_CHAIN (*tp
))
7449 if (!VAR_P (t
) && TREE_CODE (t
) != CONST_DECL
)
7451 replace_by_duplicate_decl (&t
, vars_map
, to_context
);
7454 if (VAR_P (*tp
) && DECL_HAS_VALUE_EXPR_P (*tp
))
7456 tree x
= DECL_VALUE_EXPR (*tp
);
7457 struct replace_decls_d rd
= { vars_map
, to_context
};
7459 walk_tree (&x
, replace_block_vars_by_duplicates_1
, &rd
, NULL
);
7460 SET_DECL_VALUE_EXPR (t
, x
);
7461 DECL_HAS_VALUE_EXPR_P (t
) = 1;
7463 DECL_CHAIN (t
) = DECL_CHAIN (*tp
);
7468 for (block
= BLOCK_SUBBLOCKS (block
); block
; block
= BLOCK_CHAIN (block
))
7469 replace_block_vars_by_duplicates (block
, vars_map
, to_context
);
7472 /* Fixup the loop arrays and numbers after moving LOOP and its subloops
7476 fixup_loop_arrays_after_move (struct function
*fn1
, struct function
*fn2
,
7479 /* Discard it from the old loop array. */
7480 (*get_loops (fn1
))[loop
->num
] = NULL
;
7482 /* Place it in the new loop array, assigning it a new number. */
7483 loop
->num
= number_of_loops (fn2
);
7484 vec_safe_push (loops_for_fn (fn2
)->larray
, loop
);
7486 /* Recurse to children. */
7487 for (loop
= loop
->inner
; loop
; loop
= loop
->next
)
7488 fixup_loop_arrays_after_move (fn1
, fn2
, loop
);
7491 /* Verify that the blocks in BBS_P are a single-entry, single-exit region
7492 delimited by ENTRY_BB and EXIT_BB, possibly containing noreturn blocks. */
7495 verify_sese (basic_block entry
, basic_block exit
, vec
<basic_block
> *bbs_p
)
7500 bitmap bbs
= BITMAP_ALLOC (NULL
);
7503 gcc_assert (entry
!= NULL
);
7504 gcc_assert (entry
!= exit
);
7505 gcc_assert (bbs_p
!= NULL
);
7507 gcc_assert (bbs_p
->length () > 0);
7509 FOR_EACH_VEC_ELT (*bbs_p
, i
, bb
)
7510 bitmap_set_bit (bbs
, bb
->index
);
7512 gcc_assert (bitmap_bit_p (bbs
, entry
->index
));
7513 gcc_assert (exit
== NULL
|| bitmap_bit_p (bbs
, exit
->index
));
7515 FOR_EACH_VEC_ELT (*bbs_p
, i
, bb
)
7519 gcc_assert (single_pred_p (entry
));
7520 gcc_assert (!bitmap_bit_p (bbs
, single_pred (entry
)->index
));
7523 for (ei
= ei_start (bb
->preds
); !ei_end_p (ei
); ei_next (&ei
))
7526 gcc_assert (bitmap_bit_p (bbs
, e
->src
->index
));
7531 gcc_assert (single_succ_p (exit
));
7532 gcc_assert (!bitmap_bit_p (bbs
, single_succ (exit
)->index
));
7535 for (ei
= ei_start (bb
->succs
); !ei_end_p (ei
); ei_next (&ei
))
7538 gcc_assert (bitmap_bit_p (bbs
, e
->dest
->index
));
7545 /* If FROM is an SSA_NAME, mark the version in bitmap DATA. */
7548 gather_ssa_name_hash_map_from (tree
const &from
, tree
const &, void *data
)
7550 bitmap release_names
= (bitmap
)data
;
7552 if (TREE_CODE (from
) != SSA_NAME
)
7555 bitmap_set_bit (release_names
, SSA_NAME_VERSION (from
));
7559 /* Return LOOP_DIST_ALIAS call if present in BB. */
7562 find_loop_dist_alias (basic_block bb
)
7564 gimple
*g
= last_stmt (bb
);
7565 if (g
== NULL
|| gimple_code (g
) != GIMPLE_COND
)
7568 gimple_stmt_iterator gsi
= gsi_for_stmt (g
);
7570 if (gsi_end_p (gsi
))
7574 if (gimple_call_internal_p (g
, IFN_LOOP_DIST_ALIAS
))
7579 /* Fold loop internal call G like IFN_LOOP_VECTORIZED/IFN_LOOP_DIST_ALIAS
7580 to VALUE and update any immediate uses of it's LHS. */
7583 fold_loop_internal_call (gimple
*g
, tree value
)
7585 tree lhs
= gimple_call_lhs (g
);
7586 use_operand_p use_p
;
7587 imm_use_iterator iter
;
7589 gimple_stmt_iterator gsi
= gsi_for_stmt (g
);
7591 replace_call_with_value (&gsi
, value
);
7592 FOR_EACH_IMM_USE_STMT (use_stmt
, iter
, lhs
)
7594 FOR_EACH_IMM_USE_ON_STMT (use_p
, iter
)
7595 SET_USE (use_p
, value
);
7596 update_stmt (use_stmt
);
7600 /* Move a single-entry, single-exit region delimited by ENTRY_BB and
7601 EXIT_BB to function DEST_CFUN. The whole region is replaced by a
7602 single basic block in the original CFG and the new basic block is
7603 returned. DEST_CFUN must not have a CFG yet.
7605 Note that the region need not be a pure SESE region. Blocks inside
7606 the region may contain calls to abort/exit. The only restriction
7607 is that ENTRY_BB should be the only entry point and it must
7610 Change TREE_BLOCK of all statements in ORIG_BLOCK to the new
7611 functions outermost BLOCK, move all subblocks of ORIG_BLOCK
7612 to the new function.
7614 All local variables referenced in the region are assumed to be in
7615 the corresponding BLOCK_VARS and unexpanded variable lists
7616 associated with DEST_CFUN.
7618 TODO: investigate whether we can reuse gimple_duplicate_sese_region to
7619 reimplement move_sese_region_to_fn by duplicating the region rather than
7623 move_sese_region_to_fn (struct function
*dest_cfun
, basic_block entry_bb
,
7624 basic_block exit_bb
, tree orig_block
)
7626 vec
<basic_block
> bbs
;
7627 basic_block dom_entry
= get_immediate_dominator (CDI_DOMINATORS
, entry_bb
);
7628 basic_block after
, bb
, *entry_pred
, *exit_succ
, abb
;
7629 struct function
*saved_cfun
= cfun
;
7630 int *entry_flag
, *exit_flag
;
7631 profile_probability
*entry_prob
, *exit_prob
;
7632 unsigned i
, num_entry_edges
, num_exit_edges
, num_nodes
;
7635 htab_t new_label_map
;
7636 hash_map
<void *, void *> *eh_map
;
7637 class loop
*loop
= entry_bb
->loop_father
;
7638 class loop
*loop0
= get_loop (saved_cfun
, 0);
7639 struct move_stmt_d d
;
7641 /* If ENTRY does not strictly dominate EXIT, this cannot be an SESE
7643 gcc_assert (entry_bb
!= exit_bb
7645 || dominated_by_p (CDI_DOMINATORS
, exit_bb
, entry_bb
)));
7647 /* Collect all the blocks in the region. Manually add ENTRY_BB
7648 because it won't be added by dfs_enumerate_from. */
7650 bbs
.safe_push (entry_bb
);
7651 gather_blocks_in_sese_region (entry_bb
, exit_bb
, &bbs
);
7654 verify_sese (entry_bb
, exit_bb
, &bbs
);
7656 /* The blocks that used to be dominated by something in BBS will now be
7657 dominated by the new block. */
7658 auto_vec
<basic_block
> dom_bbs
= get_dominated_by_region (CDI_DOMINATORS
,
7662 /* Detach ENTRY_BB and EXIT_BB from CFUN->CFG. We need to remember
7663 the predecessor edges to ENTRY_BB and the successor edges to
7664 EXIT_BB so that we can re-attach them to the new basic block that
7665 will replace the region. */
7666 num_entry_edges
= EDGE_COUNT (entry_bb
->preds
);
7667 entry_pred
= XNEWVEC (basic_block
, num_entry_edges
);
7668 entry_flag
= XNEWVEC (int, num_entry_edges
);
7669 entry_prob
= XNEWVEC (profile_probability
, num_entry_edges
);
7671 for (ei
= ei_start (entry_bb
->preds
); (e
= ei_safe_edge (ei
)) != NULL
;)
7673 entry_prob
[i
] = e
->probability
;
7674 entry_flag
[i
] = e
->flags
;
7675 entry_pred
[i
++] = e
->src
;
7681 num_exit_edges
= EDGE_COUNT (exit_bb
->succs
);
7682 exit_succ
= XNEWVEC (basic_block
, num_exit_edges
);
7683 exit_flag
= XNEWVEC (int, num_exit_edges
);
7684 exit_prob
= XNEWVEC (profile_probability
, num_exit_edges
);
7686 for (ei
= ei_start (exit_bb
->succs
); (e
= ei_safe_edge (ei
)) != NULL
;)
7688 exit_prob
[i
] = e
->probability
;
7689 exit_flag
[i
] = e
->flags
;
7690 exit_succ
[i
++] = e
->dest
;
7702 /* Switch context to the child function to initialize DEST_FN's CFG. */
7703 gcc_assert (dest_cfun
->cfg
== NULL
);
7704 push_cfun (dest_cfun
);
7706 init_empty_tree_cfg ();
7708 /* Initialize EH information for the new function. */
7710 new_label_map
= NULL
;
7713 eh_region region
= NULL
;
7716 FOR_EACH_VEC_ELT (bbs
, i
, bb
)
7718 region
= find_outermost_region_in_block (saved_cfun
, bb
, region
, &all
);
7723 init_eh_for_function ();
7724 if (region
!= NULL
|| all
)
7726 new_label_map
= htab_create (17, tree_map_hash
, tree_map_eq
, free
);
7727 eh_map
= duplicate_eh_regions (saved_cfun
, region
, 0,
7728 new_label_mapper
, new_label_map
);
7732 /* Initialize an empty loop tree. */
7733 struct loops
*loops
= ggc_cleared_alloc
<struct loops
> ();
7734 init_loops_structure (dest_cfun
, loops
, 1);
7735 loops
->state
= LOOPS_MAY_HAVE_MULTIPLE_LATCHES
;
7736 set_loops_for_fn (dest_cfun
, loops
);
7738 vec
<loop_p
, va_gc
> *larray
= get_loops (saved_cfun
)->copy ();
7740 /* Move the outlined loop tree part. */
7741 num_nodes
= bbs
.length ();
7742 FOR_EACH_VEC_ELT (bbs
, i
, bb
)
7744 if (bb
->loop_father
->header
== bb
)
7746 class loop
*this_loop
= bb
->loop_father
;
7747 class loop
*outer
= loop_outer (this_loop
);
7749 /* If the SESE region contains some bbs ending with
7750 a noreturn call, those are considered to belong
7751 to the outermost loop in saved_cfun, rather than
7752 the entry_bb's loop_father. */
7756 num_nodes
-= this_loop
->num_nodes
;
7757 flow_loop_tree_node_remove (bb
->loop_father
);
7758 flow_loop_tree_node_add (get_loop (dest_cfun
, 0), this_loop
);
7759 fixup_loop_arrays_after_move (saved_cfun
, cfun
, this_loop
);
7762 else if (bb
->loop_father
== loop0
&& loop0
!= loop
)
7765 /* Remove loop exits from the outlined region. */
7766 if (loops_for_fn (saved_cfun
)->exits
)
7767 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
7769 struct loops
*l
= loops_for_fn (saved_cfun
);
7771 = l
->exits
->find_slot_with_hash (e
, htab_hash_pointer (e
),
7774 l
->exits
->clear_slot (slot
);
7778 /* Adjust the number of blocks in the tree root of the outlined part. */
7779 get_loop (dest_cfun
, 0)->num_nodes
= bbs
.length () + 2;
7781 /* Setup a mapping to be used by move_block_to_fn. */
7782 loop
->aux
= current_loops
->tree_root
;
7783 loop0
->aux
= current_loops
->tree_root
;
7785 /* Fix up orig_loop_num. If the block referenced in it has been moved
7786 to dest_cfun, update orig_loop_num field, otherwise clear it. */
7787 signed char *moved_orig_loop_num
= NULL
;
7788 for (auto dloop
: loops_list (dest_cfun
, 0))
7789 if (dloop
->orig_loop_num
)
7791 if (moved_orig_loop_num
== NULL
)
7793 = XCNEWVEC (signed char, vec_safe_length (larray
));
7794 if ((*larray
)[dloop
->orig_loop_num
] != NULL
7795 && get_loop (saved_cfun
, dloop
->orig_loop_num
) == NULL
)
7797 if (moved_orig_loop_num
[dloop
->orig_loop_num
] >= 0
7798 && moved_orig_loop_num
[dloop
->orig_loop_num
] < 2)
7799 moved_orig_loop_num
[dloop
->orig_loop_num
]++;
7800 dloop
->orig_loop_num
= (*larray
)[dloop
->orig_loop_num
]->num
;
7804 moved_orig_loop_num
[dloop
->orig_loop_num
] = -1;
7805 dloop
->orig_loop_num
= 0;
7810 if (moved_orig_loop_num
)
7812 FOR_EACH_VEC_ELT (bbs
, i
, bb
)
7814 gimple
*g
= find_loop_dist_alias (bb
);
7818 int orig_loop_num
= tree_to_shwi (gimple_call_arg (g
, 0));
7819 gcc_assert (orig_loop_num
7820 && (unsigned) orig_loop_num
< vec_safe_length (larray
));
7821 if (moved_orig_loop_num
[orig_loop_num
] == 2)
7823 /* If we have moved both loops with this orig_loop_num into
7824 dest_cfun and the LOOP_DIST_ALIAS call is being moved there
7825 too, update the first argument. */
7826 gcc_assert ((*larray
)[orig_loop_num
] != NULL
7827 && (get_loop (saved_cfun
, orig_loop_num
) == NULL
));
7828 tree t
= build_int_cst (integer_type_node
,
7829 (*larray
)[orig_loop_num
]->num
);
7830 gimple_call_set_arg (g
, 0, t
);
7832 /* Make sure the following loop will not update it. */
7833 moved_orig_loop_num
[orig_loop_num
] = 0;
7836 /* Otherwise at least one of the loops stayed in saved_cfun.
7837 Remove the LOOP_DIST_ALIAS call. */
7838 fold_loop_internal_call (g
, gimple_call_arg (g
, 1));
7840 FOR_EACH_BB_FN (bb
, saved_cfun
)
7842 gimple
*g
= find_loop_dist_alias (bb
);
7845 int orig_loop_num
= tree_to_shwi (gimple_call_arg (g
, 0));
7846 gcc_assert (orig_loop_num
7847 && (unsigned) orig_loop_num
< vec_safe_length (larray
));
7848 if (moved_orig_loop_num
[orig_loop_num
])
7849 /* LOOP_DIST_ALIAS call remained in saved_cfun, if at least one
7850 of the corresponding loops was moved, remove it. */
7851 fold_loop_internal_call (g
, gimple_call_arg (g
, 1));
7853 XDELETEVEC (moved_orig_loop_num
);
7857 /* Move blocks from BBS into DEST_CFUN. */
7858 gcc_assert (bbs
.length () >= 2);
7859 after
= dest_cfun
->cfg
->x_entry_block_ptr
;
7860 hash_map
<tree
, tree
> vars_map
;
7862 memset (&d
, 0, sizeof (d
));
7863 d
.orig_block
= orig_block
;
7864 d
.new_block
= DECL_INITIAL (dest_cfun
->decl
);
7865 d
.from_context
= cfun
->decl
;
7866 d
.to_context
= dest_cfun
->decl
;
7867 d
.vars_map
= &vars_map
;
7868 d
.new_label_map
= new_label_map
;
7870 d
.remap_decls_p
= true;
7872 if (gimple_in_ssa_p (cfun
))
7873 for (tree arg
= DECL_ARGUMENTS (d
.to_context
); arg
; arg
= DECL_CHAIN (arg
))
7875 tree narg
= make_ssa_name_fn (dest_cfun
, arg
, gimple_build_nop ());
7876 set_ssa_default_def (dest_cfun
, arg
, narg
);
7877 vars_map
.put (arg
, narg
);
7880 FOR_EACH_VEC_ELT (bbs
, i
, bb
)
7882 /* No need to update edge counts on the last block. It has
7883 already been updated earlier when we detached the region from
7884 the original CFG. */
7885 move_block_to_fn (dest_cfun
, bb
, after
, bb
!= exit_bb
, &d
);
7889 /* Adjust the maximum clique used. */
7890 dest_cfun
->last_clique
= saved_cfun
->last_clique
;
7894 /* Loop sizes are no longer correct, fix them up. */
7895 loop
->num_nodes
-= num_nodes
;
7896 for (class loop
*outer
= loop_outer (loop
);
7897 outer
; outer
= loop_outer (outer
))
7898 outer
->num_nodes
-= num_nodes
;
7899 loop0
->num_nodes
-= bbs
.length () - num_nodes
;
7901 if (saved_cfun
->has_simduid_loops
|| saved_cfun
->has_force_vectorize_loops
)
7904 for (i
= 0; vec_safe_iterate (loops
->larray
, i
, &aloop
); i
++)
7909 replace_by_duplicate_decl (&aloop
->simduid
, d
.vars_map
,
7911 dest_cfun
->has_simduid_loops
= true;
7913 if (aloop
->force_vectorize
)
7914 dest_cfun
->has_force_vectorize_loops
= true;
7918 /* Rewire BLOCK_SUBBLOCKS of orig_block. */
7922 gcc_assert (BLOCK_SUBBLOCKS (DECL_INITIAL (dest_cfun
->decl
))
7924 BLOCK_SUBBLOCKS (DECL_INITIAL (dest_cfun
->decl
))
7925 = BLOCK_SUBBLOCKS (orig_block
);
7926 for (block
= BLOCK_SUBBLOCKS (orig_block
);
7927 block
; block
= BLOCK_CHAIN (block
))
7928 BLOCK_SUPERCONTEXT (block
) = DECL_INITIAL (dest_cfun
->decl
);
7929 BLOCK_SUBBLOCKS (orig_block
) = NULL_TREE
;
7932 replace_block_vars_by_duplicates (DECL_INITIAL (dest_cfun
->decl
),
7933 &vars_map
, dest_cfun
->decl
);
7936 htab_delete (new_label_map
);
7940 /* We need to release ssa-names in a defined order, so first find them,
7941 and then iterate in ascending version order. */
7942 bitmap release_names
= BITMAP_ALLOC (NULL
);
7943 vars_map
.traverse
<void *, gather_ssa_name_hash_map_from
> (release_names
);
7945 EXECUTE_IF_SET_IN_BITMAP (release_names
, 0, i
, bi
)
7946 release_ssa_name (ssa_name (i
));
7947 BITMAP_FREE (release_names
);
7949 /* Rewire the entry and exit blocks. The successor to the entry
7950 block turns into the successor of DEST_FN's ENTRY_BLOCK_PTR in
7951 the child function. Similarly, the predecessor of DEST_FN's
7952 EXIT_BLOCK_PTR turns into the predecessor of EXIT_BLOCK_PTR. We
7953 need to switch CFUN between DEST_CFUN and SAVED_CFUN so that the
7954 various CFG manipulation function get to the right CFG.
7956 FIXME, this is silly. The CFG ought to become a parameter to
7958 push_cfun (dest_cfun
);
7959 ENTRY_BLOCK_PTR_FOR_FN (cfun
)->count
= entry_bb
->count
;
7960 make_single_succ_edge (ENTRY_BLOCK_PTR_FOR_FN (cfun
), entry_bb
, EDGE_FALLTHRU
);
7963 make_single_succ_edge (exit_bb
, EXIT_BLOCK_PTR_FOR_FN (cfun
), 0);
7964 EXIT_BLOCK_PTR_FOR_FN (cfun
)->count
= exit_bb
->count
;
7967 EXIT_BLOCK_PTR_FOR_FN (cfun
)->count
= profile_count::zero ();
7970 /* Back in the original function, the SESE region has disappeared,
7971 create a new basic block in its place. */
7972 bb
= create_empty_bb (entry_pred
[0]);
7974 add_bb_to_loop (bb
, loop
);
7975 for (i
= 0; i
< num_entry_edges
; i
++)
7977 e
= make_edge (entry_pred
[i
], bb
, entry_flag
[i
]);
7978 e
->probability
= entry_prob
[i
];
7981 for (i
= 0; i
< num_exit_edges
; i
++)
7983 e
= make_edge (bb
, exit_succ
[i
], exit_flag
[i
]);
7984 e
->probability
= exit_prob
[i
];
7987 set_immediate_dominator (CDI_DOMINATORS
, bb
, dom_entry
);
7988 FOR_EACH_VEC_ELT (dom_bbs
, i
, abb
)
7989 set_immediate_dominator (CDI_DOMINATORS
, abb
, bb
);
8005 /* Dump default def DEF to file FILE using FLAGS and indentation
8009 dump_default_def (FILE *file
, tree def
, int spc
, dump_flags_t flags
)
8011 for (int i
= 0; i
< spc
; ++i
)
8012 fprintf (file
, " ");
8013 dump_ssaname_info_to_file (file
, def
, spc
);
8015 print_generic_expr (file
, TREE_TYPE (def
), flags
);
8016 fprintf (file
, " ");
8017 print_generic_expr (file
, def
, flags
);
8018 fprintf (file
, " = ");
8019 print_generic_expr (file
, SSA_NAME_VAR (def
), flags
);
8020 fprintf (file
, ";\n");
8023 /* Print no_sanitize attribute to FILE for a given attribute VALUE. */
8026 print_no_sanitize_attr_value (FILE *file
, tree value
)
8028 unsigned int flags
= tree_to_uhwi (value
);
8030 for (int i
= 0; sanitizer_opts
[i
].name
!= NULL
; ++i
)
8032 if ((sanitizer_opts
[i
].flag
& flags
) == sanitizer_opts
[i
].flag
)
8035 fprintf (file
, " | ");
8036 fprintf (file
, "%s", sanitizer_opts
[i
].name
);
8042 /* Dump FUNCTION_DECL FN to file FILE using FLAGS (see TDF_* in dumpfile.h)
8046 dump_function_to_file (tree fndecl
, FILE *file
, dump_flags_t flags
)
8048 tree arg
, var
, old_current_fndecl
= current_function_decl
;
8049 struct function
*dsf
;
8050 bool ignore_topmost_bind
= false, any_var
= false;
8053 bool tmclone
= (TREE_CODE (fndecl
) == FUNCTION_DECL
8054 && decl_is_tm_clone (fndecl
));
8055 struct function
*fun
= DECL_STRUCT_FUNCTION (fndecl
);
8057 tree fntype
= TREE_TYPE (fndecl
);
8058 tree attrs
[] = { DECL_ATTRIBUTES (fndecl
), TYPE_ATTRIBUTES (fntype
) };
8060 for (int i
= 0; i
!= 2; ++i
)
8065 fprintf (file
, "__attribute__((");
8069 for (chain
= attrs
[i
]; chain
; first
= false, chain
= TREE_CHAIN (chain
))
8072 fprintf (file
, ", ");
8074 tree name
= get_attribute_name (chain
);
8075 print_generic_expr (file
, name
, dump_flags
);
8076 if (TREE_VALUE (chain
) != NULL_TREE
)
8078 fprintf (file
, " (");
8080 if (strstr (IDENTIFIER_POINTER (name
), "no_sanitize"))
8081 print_no_sanitize_attr_value (file
, TREE_VALUE (chain
));
8083 print_generic_expr (file
, TREE_VALUE (chain
), dump_flags
);
8084 fprintf (file
, ")");
8088 fprintf (file
, "))\n");
8091 current_function_decl
= fndecl
;
8092 if (flags
& TDF_GIMPLE
)
8094 static bool hotness_bb_param_printed
= false;
8095 if (profile_info
!= NULL
8096 && !hotness_bb_param_printed
)
8098 hotness_bb_param_printed
= true;
8100 "/* --param=gimple-fe-computed-hot-bb-threshold=%" PRId64
8101 " */\n", get_hot_bb_threshold ());
8104 print_generic_expr (file
, TREE_TYPE (TREE_TYPE (fndecl
)),
8105 dump_flags
| TDF_SLIM
);
8106 fprintf (file
, " __GIMPLE (%s",
8107 (fun
->curr_properties
& PROP_ssa
) ? "ssa"
8108 : (fun
->curr_properties
& PROP_cfg
) ? "cfg"
8111 if (fun
&& fun
->cfg
)
8113 basic_block bb
= ENTRY_BLOCK_PTR_FOR_FN (fun
);
8114 if (bb
->count
.initialized_p ())
8115 fprintf (file
, ",%s(%" PRIu64
")",
8116 profile_quality_as_string (bb
->count
.quality ()),
8117 bb
->count
.value ());
8118 if (dump_flags
& TDF_UID
)
8119 fprintf (file
, ")\n%sD_%u (", function_name (fun
),
8122 fprintf (file
, ")\n%s (", function_name (fun
));
8127 print_generic_expr (file
, TREE_TYPE (fntype
), dump_flags
);
8128 if (dump_flags
& TDF_UID
)
8129 fprintf (file
, " %sD.%u %s(", function_name (fun
), DECL_UID (fndecl
),
8130 tmclone
? "[tm-clone] " : "");
8132 fprintf (file
, " %s %s(", function_name (fun
),
8133 tmclone
? "[tm-clone] " : "");
8136 arg
= DECL_ARGUMENTS (fndecl
);
8139 print_generic_expr (file
, TREE_TYPE (arg
), dump_flags
);
8140 fprintf (file
, " ");
8141 print_generic_expr (file
, arg
, dump_flags
);
8142 if (DECL_CHAIN (arg
))
8143 fprintf (file
, ", ");
8144 arg
= DECL_CHAIN (arg
);
8146 fprintf (file
, ")\n");
8148 dsf
= DECL_STRUCT_FUNCTION (fndecl
);
8149 if (dsf
&& (flags
& TDF_EH
))
8150 dump_eh_tree (file
, dsf
);
8152 if (flags
& TDF_RAW
&& !gimple_has_body_p (fndecl
))
8154 dump_node (fndecl
, TDF_SLIM
| flags
, file
);
8155 current_function_decl
= old_current_fndecl
;
8159 /* When GIMPLE is lowered, the variables are no longer available in
8160 BIND_EXPRs, so display them separately. */
8161 if (fun
&& fun
->decl
== fndecl
&& (fun
->curr_properties
& PROP_gimple_lcf
))
8164 ignore_topmost_bind
= true;
8166 fprintf (file
, "{\n");
8167 if (gimple_in_ssa_p (fun
)
8168 && (flags
& TDF_ALIAS
))
8170 for (arg
= DECL_ARGUMENTS (fndecl
); arg
!= NULL
;
8171 arg
= DECL_CHAIN (arg
))
8173 tree def
= ssa_default_def (fun
, arg
);
8175 dump_default_def (file
, def
, 2, flags
);
8178 tree res
= DECL_RESULT (fun
->decl
);
8179 if (res
!= NULL_TREE
8180 && DECL_BY_REFERENCE (res
))
8182 tree def
= ssa_default_def (fun
, res
);
8184 dump_default_def (file
, def
, 2, flags
);
8187 tree static_chain
= fun
->static_chain_decl
;
8188 if (static_chain
!= NULL_TREE
)
8190 tree def
= ssa_default_def (fun
, static_chain
);
8192 dump_default_def (file
, def
, 2, flags
);
8196 if (!vec_safe_is_empty (fun
->local_decls
))
8197 FOR_EACH_LOCAL_DECL (fun
, ix
, var
)
8199 print_generic_decl (file
, var
, flags
);
8200 fprintf (file
, "\n");
8207 if (gimple_in_ssa_p (fun
))
8208 FOR_EACH_SSA_NAME (ix
, name
, fun
)
8210 if (!SSA_NAME_VAR (name
)
8211 /* SSA name with decls without a name still get
8212 dumped as _N, list those explicitely as well even
8213 though we've dumped the decl declaration as D.xxx
8215 || !SSA_NAME_IDENTIFIER (name
))
8217 fprintf (file
, " ");
8218 print_generic_expr (file
, TREE_TYPE (name
), flags
);
8219 fprintf (file
, " ");
8220 print_generic_expr (file
, name
, flags
);
8221 fprintf (file
, ";\n");
8228 if (fun
&& fun
->decl
== fndecl
8230 && basic_block_info_for_fn (fun
))
8232 /* If the CFG has been built, emit a CFG-based dump. */
8233 if (!ignore_topmost_bind
)
8234 fprintf (file
, "{\n");
8236 if (any_var
&& n_basic_blocks_for_fn (fun
))
8237 fprintf (file
, "\n");
8239 FOR_EACH_BB_FN (bb
, fun
)
8240 dump_bb (file
, bb
, 2, flags
);
8242 fprintf (file
, "}\n");
8244 else if (fun
&& (fun
->curr_properties
& PROP_gimple_any
))
8246 /* The function is now in GIMPLE form but the CFG has not been
8247 built yet. Emit the single sequence of GIMPLE statements
8248 that make up its body. */
8249 gimple_seq body
= gimple_body (fndecl
);
8251 if (gimple_seq_first_stmt (body
)
8252 && gimple_seq_first_stmt (body
) == gimple_seq_last_stmt (body
)
8253 && gimple_code (gimple_seq_first_stmt (body
)) == GIMPLE_BIND
)
8254 print_gimple_seq (file
, body
, 0, flags
);
8257 if (!ignore_topmost_bind
)
8258 fprintf (file
, "{\n");
8261 fprintf (file
, "\n");
8263 print_gimple_seq (file
, body
, 2, flags
);
8264 fprintf (file
, "}\n");
8271 /* Make a tree based dump. */
8272 chain
= DECL_SAVED_TREE (fndecl
);
8273 if (chain
&& TREE_CODE (chain
) == BIND_EXPR
)
8275 if (ignore_topmost_bind
)
8277 chain
= BIND_EXPR_BODY (chain
);
8285 if (!ignore_topmost_bind
)
8287 fprintf (file
, "{\n");
8288 /* No topmost bind, pretend it's ignored for later. */
8289 ignore_topmost_bind
= true;
8295 fprintf (file
, "\n");
8297 print_generic_stmt_indented (file
, chain
, flags
, indent
);
8298 if (ignore_topmost_bind
)
8299 fprintf (file
, "}\n");
8302 if (flags
& TDF_ENUMERATE_LOCALS
)
8303 dump_enumerated_decls (file
, flags
);
8304 fprintf (file
, "\n\n");
8306 current_function_decl
= old_current_fndecl
;
8309 /* Dump FUNCTION_DECL FN to stderr using FLAGS (see TDF_* in tree.h) */
8312 debug_function (tree fn
, dump_flags_t flags
)
8314 dump_function_to_file (fn
, stderr
, flags
);
8318 /* Print on FILE the indexes for the predecessors of basic_block BB. */
8321 print_pred_bbs (FILE *file
, basic_block bb
)
8326 FOR_EACH_EDGE (e
, ei
, bb
->preds
)
8327 fprintf (file
, "bb_%d ", e
->src
->index
);
8331 /* Print on FILE the indexes for the successors of basic_block BB. */
8334 print_succ_bbs (FILE *file
, basic_block bb
)
8339 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
8340 fprintf (file
, "bb_%d ", e
->dest
->index
);
8343 /* Print to FILE the basic block BB following the VERBOSITY level. */
8346 print_loops_bb (FILE *file
, basic_block bb
, int indent
, int verbosity
)
8348 char *s_indent
= (char *) alloca ((size_t) indent
+ 1);
8349 memset ((void *) s_indent
, ' ', (size_t) indent
);
8350 s_indent
[indent
] = '\0';
8352 /* Print basic_block's header. */
8355 fprintf (file
, "%s bb_%d (preds = {", s_indent
, bb
->index
);
8356 print_pred_bbs (file
, bb
);
8357 fprintf (file
, "}, succs = {");
8358 print_succ_bbs (file
, bb
);
8359 fprintf (file
, "})\n");
8362 /* Print basic_block's body. */
8365 fprintf (file
, "%s {\n", s_indent
);
8366 dump_bb (file
, bb
, indent
+ 4, TDF_VOPS
|TDF_MEMSYMS
);
8367 fprintf (file
, "%s }\n", s_indent
);
8371 static void print_loop_and_siblings (FILE *, class loop
*, int, int);
8373 /* Pretty print LOOP on FILE, indented INDENT spaces. Following
8374 VERBOSITY level this outputs the contents of the loop, or just its
8378 print_loop (FILE *file
, class loop
*loop
, int indent
, int verbosity
)
8386 s_indent
= (char *) alloca ((size_t) indent
+ 1);
8387 memset ((void *) s_indent
, ' ', (size_t) indent
);
8388 s_indent
[indent
] = '\0';
8390 /* Print loop's header. */
8391 fprintf (file
, "%sloop_%d (", s_indent
, loop
->num
);
8393 fprintf (file
, "header = %d", loop
->header
->index
);
8396 fprintf (file
, "deleted)\n");
8400 fprintf (file
, ", latch = %d", loop
->latch
->index
);
8402 fprintf (file
, ", multiple latches");
8403 fprintf (file
, ", niter = ");
8404 print_generic_expr (file
, loop
->nb_iterations
);
8406 if (loop
->any_upper_bound
)
8408 fprintf (file
, ", upper_bound = ");
8409 print_decu (loop
->nb_iterations_upper_bound
, file
);
8411 if (loop
->any_likely_upper_bound
)
8413 fprintf (file
, ", likely_upper_bound = ");
8414 print_decu (loop
->nb_iterations_likely_upper_bound
, file
);
8417 if (loop
->any_estimate
)
8419 fprintf (file
, ", estimate = ");
8420 print_decu (loop
->nb_iterations_estimate
, file
);
8423 fprintf (file
, ", unroll = %d", loop
->unroll
);
8424 fprintf (file
, ")\n");
8426 /* Print loop's body. */
8429 fprintf (file
, "%s{\n", s_indent
);
8430 FOR_EACH_BB_FN (bb
, cfun
)
8431 if (bb
->loop_father
== loop
)
8432 print_loops_bb (file
, bb
, indent
, verbosity
);
8434 print_loop_and_siblings (file
, loop
->inner
, indent
+ 2, verbosity
);
8435 fprintf (file
, "%s}\n", s_indent
);
8439 /* Print the LOOP and its sibling loops on FILE, indented INDENT
8440 spaces. Following VERBOSITY level this outputs the contents of the
8441 loop, or just its structure. */
8444 print_loop_and_siblings (FILE *file
, class loop
*loop
, int indent
,
8450 print_loop (file
, loop
, indent
, verbosity
);
8451 print_loop_and_siblings (file
, loop
->next
, indent
, verbosity
);
8454 /* Follow a CFG edge from the entry point of the program, and on entry
8455 of a loop, pretty print the loop structure on FILE. */
8458 print_loops (FILE *file
, int verbosity
)
8462 bb
= ENTRY_BLOCK_PTR_FOR_FN (cfun
);
8463 fprintf (file
, "\nLoops in function: %s\n", current_function_name ());
8464 if (bb
&& bb
->loop_father
)
8465 print_loop_and_siblings (file
, bb
->loop_father
, 0, verbosity
);
8471 debug (class loop
&ref
)
8473 print_loop (stderr
, &ref
, 0, /*verbosity*/0);
8477 debug (class loop
*ptr
)
8482 fprintf (stderr
, "<nil>\n");
8485 /* Dump a loop verbosely. */
8488 debug_verbose (class loop
&ref
)
8490 print_loop (stderr
, &ref
, 0, /*verbosity*/3);
8494 debug_verbose (class loop
*ptr
)
8499 fprintf (stderr
, "<nil>\n");
8503 /* Debugging loops structure at tree level, at some VERBOSITY level. */
8506 debug_loops (int verbosity
)
8508 print_loops (stderr
, verbosity
);
8511 /* Print on stderr the code of LOOP, at some VERBOSITY level. */
8514 debug_loop (class loop
*loop
, int verbosity
)
8516 print_loop (stderr
, loop
, 0, verbosity
);
8519 /* Print on stderr the code of loop number NUM, at some VERBOSITY
8523 debug_loop_num (unsigned num
, int verbosity
)
8525 debug_loop (get_loop (cfun
, num
), verbosity
);
8528 /* Return true if BB ends with a call, possibly followed by some
8529 instructions that must stay with the call. Return false,
8533 gimple_block_ends_with_call_p (basic_block bb
)
8535 gimple_stmt_iterator gsi
= gsi_last_nondebug_bb (bb
);
8536 return !gsi_end_p (gsi
) && is_gimple_call (gsi_stmt (gsi
));
8540 /* Return true if BB ends with a conditional branch. Return false,
8544 gimple_block_ends_with_condjump_p (const_basic_block bb
)
8546 gimple
*stmt
= last_stmt (CONST_CAST_BB (bb
));
8547 return (stmt
&& gimple_code (stmt
) == GIMPLE_COND
);
8551 /* Return true if statement T may terminate execution of BB in ways not
8552 explicitly represtented in the CFG. */
8555 stmt_can_terminate_bb_p (gimple
*t
)
8557 tree fndecl
= NULL_TREE
;
8560 /* Eh exception not handled internally terminates execution of the whole
8562 if (stmt_can_throw_external (cfun
, t
))
8565 /* NORETURN and LONGJMP calls already have an edge to exit.
8566 CONST and PURE calls do not need one.
8567 We don't currently check for CONST and PURE here, although
8568 it would be a good idea, because those attributes are
8569 figured out from the RTL in mark_constant_function, and
8570 the counter incrementation code from -fprofile-arcs
8571 leads to different results from -fbranch-probabilities. */
8572 if (is_gimple_call (t
))
8574 fndecl
= gimple_call_fndecl (t
);
8575 call_flags
= gimple_call_flags (t
);
8578 if (is_gimple_call (t
)
8580 && fndecl_built_in_p (fndecl
)
8581 && (call_flags
& ECF_NOTHROW
)
8582 && !(call_flags
& ECF_RETURNS_TWICE
)
8583 /* fork() doesn't really return twice, but the effect of
8584 wrapping it in __gcov_fork() which calls __gcov_dump() and
8585 __gcov_reset() and clears the counters before forking has the same
8586 effect as returning twice. Force a fake edge. */
8587 && !fndecl_built_in_p (fndecl
, BUILT_IN_FORK
))
8590 if (is_gimple_call (t
))
8596 if (call_flags
& (ECF_PURE
| ECF_CONST
)
8597 && !(call_flags
& ECF_LOOPING_CONST_OR_PURE
))
8600 /* Function call may do longjmp, terminate program or do other things.
8601 Special case noreturn that have non-abnormal edges out as in this case
8602 the fact is sufficiently represented by lack of edges out of T. */
8603 if (!(call_flags
& ECF_NORETURN
))
8607 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
8608 if ((e
->flags
& EDGE_FAKE
) == 0)
8612 if (gasm
*asm_stmt
= dyn_cast
<gasm
*> (t
))
8613 if (gimple_asm_volatile_p (asm_stmt
) || gimple_asm_input_p (asm_stmt
))
8620 /* Add fake edges to the function exit for any non constant and non
8621 noreturn calls (or noreturn calls with EH/abnormal edges),
8622 volatile inline assembly in the bitmap of blocks specified by BLOCKS
8623 or to the whole CFG if BLOCKS is zero. Return the number of blocks
8626 The goal is to expose cases in which entering a basic block does
8627 not imply that all subsequent instructions must be executed. */
8630 gimple_flow_call_edges_add (sbitmap blocks
)
8633 int blocks_split
= 0;
8634 int last_bb
= last_basic_block_for_fn (cfun
);
8635 bool check_last_block
= false;
8637 if (n_basic_blocks_for_fn (cfun
) == NUM_FIXED_BLOCKS
)
8641 check_last_block
= true;
8643 check_last_block
= bitmap_bit_p (blocks
,
8644 EXIT_BLOCK_PTR_FOR_FN (cfun
)->prev_bb
->index
);
8646 /* In the last basic block, before epilogue generation, there will be
8647 a fallthru edge to EXIT. Special care is required if the last insn
8648 of the last basic block is a call because make_edge folds duplicate
8649 edges, which would result in the fallthru edge also being marked
8650 fake, which would result in the fallthru edge being removed by
8651 remove_fake_edges, which would result in an invalid CFG.
8653 Moreover, we can't elide the outgoing fake edge, since the block
8654 profiler needs to take this into account in order to solve the minimal
8655 spanning tree in the case that the call doesn't return.
8657 Handle this by adding a dummy instruction in a new last basic block. */
8658 if (check_last_block
)
8660 basic_block bb
= EXIT_BLOCK_PTR_FOR_FN (cfun
)->prev_bb
;
8661 gimple_stmt_iterator gsi
= gsi_last_nondebug_bb (bb
);
8664 if (!gsi_end_p (gsi
))
8667 if (t
&& stmt_can_terminate_bb_p (t
))
8671 e
= find_edge (bb
, EXIT_BLOCK_PTR_FOR_FN (cfun
));
8674 gsi_insert_on_edge (e
, gimple_build_nop ());
8675 gsi_commit_edge_inserts ();
8680 /* Now add fake edges to the function exit for any non constant
8681 calls since there is no way that we can determine if they will
8683 for (i
= 0; i
< last_bb
; i
++)
8685 basic_block bb
= BASIC_BLOCK_FOR_FN (cfun
, i
);
8686 gimple_stmt_iterator gsi
;
8687 gimple
*stmt
, *last_stmt
;
8692 if (blocks
&& !bitmap_bit_p (blocks
, i
))
8695 gsi
= gsi_last_nondebug_bb (bb
);
8696 if (!gsi_end_p (gsi
))
8698 last_stmt
= gsi_stmt (gsi
);
8701 stmt
= gsi_stmt (gsi
);
8702 if (stmt_can_terminate_bb_p (stmt
))
8706 /* The handling above of the final block before the
8707 epilogue should be enough to verify that there is
8708 no edge to the exit block in CFG already.
8709 Calling make_edge in such case would cause us to
8710 mark that edge as fake and remove it later. */
8711 if (flag_checking
&& stmt
== last_stmt
)
8713 e
= find_edge (bb
, EXIT_BLOCK_PTR_FOR_FN (cfun
));
8714 gcc_assert (e
== NULL
);
8717 /* Note that the following may create a new basic block
8718 and renumber the existing basic blocks. */
8719 if (stmt
!= last_stmt
)
8721 e
= split_block (bb
, stmt
);
8725 e
= make_edge (bb
, EXIT_BLOCK_PTR_FOR_FN (cfun
), EDGE_FAKE
);
8726 e
->probability
= profile_probability::guessed_never ();
8730 while (!gsi_end_p (gsi
));
8735 checking_verify_flow_info ();
8737 return blocks_split
;
8740 /* Removes edge E and all the blocks dominated by it, and updates dominance
8741 information. The IL in E->src needs to be updated separately.
8742 If dominance info is not available, only the edge E is removed.*/
8745 remove_edge_and_dominated_blocks (edge e
)
8747 vec
<basic_block
> bbs_to_fix_dom
= vNULL
;
8750 bool none_removed
= false;
8752 basic_block bb
, dbb
;
8755 /* If we are removing a path inside a non-root loop that may change
8756 loop ownership of blocks or remove loops. Mark loops for fixup. */
8758 && loop_outer (e
->src
->loop_father
) != NULL
8759 && e
->src
->loop_father
== e
->dest
->loop_father
)
8760 loops_state_set (LOOPS_NEED_FIXUP
);
8762 if (!dom_info_available_p (CDI_DOMINATORS
))
8768 /* No updating is needed for edges to exit. */
8769 if (e
->dest
== EXIT_BLOCK_PTR_FOR_FN (cfun
))
8771 if (cfgcleanup_altered_bbs
)
8772 bitmap_set_bit (cfgcleanup_altered_bbs
, e
->src
->index
);
8777 /* First, we find the basic blocks to remove. If E->dest has a predecessor
8778 that is not dominated by E->dest, then this set is empty. Otherwise,
8779 all the basic blocks dominated by E->dest are removed.
8781 Also, to DF_IDOM we store the immediate dominators of the blocks in
8782 the dominance frontier of E (i.e., of the successors of the
8783 removed blocks, if there are any, and of E->dest otherwise). */
8784 FOR_EACH_EDGE (f
, ei
, e
->dest
->preds
)
8789 if (!dominated_by_p (CDI_DOMINATORS
, f
->src
, e
->dest
))
8791 none_removed
= true;
8796 auto_bitmap df
, df_idom
;
8797 auto_vec
<basic_block
> bbs_to_remove
;
8799 bitmap_set_bit (df_idom
,
8800 get_immediate_dominator (CDI_DOMINATORS
, e
->dest
)->index
);
8803 bbs_to_remove
= get_all_dominated_blocks (CDI_DOMINATORS
, e
->dest
);
8804 FOR_EACH_VEC_ELT (bbs_to_remove
, i
, bb
)
8806 FOR_EACH_EDGE (f
, ei
, bb
->succs
)
8808 if (f
->dest
!= EXIT_BLOCK_PTR_FOR_FN (cfun
))
8809 bitmap_set_bit (df
, f
->dest
->index
);
8812 FOR_EACH_VEC_ELT (bbs_to_remove
, i
, bb
)
8813 bitmap_clear_bit (df
, bb
->index
);
8815 EXECUTE_IF_SET_IN_BITMAP (df
, 0, i
, bi
)
8817 bb
= BASIC_BLOCK_FOR_FN (cfun
, i
);
8818 bitmap_set_bit (df_idom
,
8819 get_immediate_dominator (CDI_DOMINATORS
, bb
)->index
);
8823 if (cfgcleanup_altered_bbs
)
8825 /* Record the set of the altered basic blocks. */
8826 bitmap_set_bit (cfgcleanup_altered_bbs
, e
->src
->index
);
8827 bitmap_ior_into (cfgcleanup_altered_bbs
, df
);
8830 /* Remove E and the cancelled blocks. */
8835 /* Walk backwards so as to get a chance to substitute all
8836 released DEFs into debug stmts. See
8837 eliminate_unnecessary_stmts() in tree-ssa-dce.cc for more
8839 for (i
= bbs_to_remove
.length (); i
-- > 0; )
8840 delete_basic_block (bbs_to_remove
[i
]);
8843 /* Update the dominance information. The immediate dominator may change only
8844 for blocks whose immediate dominator belongs to DF_IDOM:
8846 Suppose that idom(X) = Y before removal of E and idom(X) != Y after the
8847 removal. Let Z the arbitrary block such that idom(Z) = Y and
8848 Z dominates X after the removal. Before removal, there exists a path P
8849 from Y to X that avoids Z. Let F be the last edge on P that is
8850 removed, and let W = F->dest. Before removal, idom(W) = Y (since Y
8851 dominates W, and because of P, Z does not dominate W), and W belongs to
8852 the dominance frontier of E. Therefore, Y belongs to DF_IDOM. */
8853 EXECUTE_IF_SET_IN_BITMAP (df_idom
, 0, i
, bi
)
8855 bb
= BASIC_BLOCK_FOR_FN (cfun
, i
);
8856 for (dbb
= first_dom_son (CDI_DOMINATORS
, bb
);
8858 dbb
= next_dom_son (CDI_DOMINATORS
, dbb
))
8859 bbs_to_fix_dom
.safe_push (dbb
);
8862 iterate_fix_dominators (CDI_DOMINATORS
, bbs_to_fix_dom
, true);
8864 bbs_to_fix_dom
.release ();
8867 /* Purge dead EH edges from basic block BB. */
8870 gimple_purge_dead_eh_edges (basic_block bb
)
8872 bool changed
= false;
8875 gimple
*stmt
= last_stmt (bb
);
8877 if (stmt
&& stmt_can_throw_internal (cfun
, stmt
))
8880 for (ei
= ei_start (bb
->succs
); (e
= ei_safe_edge (ei
)); )
8882 if (e
->flags
& EDGE_EH
)
8884 remove_edge_and_dominated_blocks (e
);
8894 /* Purge dead EH edges from basic block listed in BLOCKS. */
8897 gimple_purge_all_dead_eh_edges (const_bitmap blocks
)
8899 bool changed
= false;
8903 EXECUTE_IF_SET_IN_BITMAP (blocks
, 0, i
, bi
)
8905 basic_block bb
= BASIC_BLOCK_FOR_FN (cfun
, i
);
8907 /* Earlier gimple_purge_dead_eh_edges could have removed
8908 this basic block already. */
8909 gcc_assert (bb
|| changed
);
8911 changed
|= gimple_purge_dead_eh_edges (bb
);
8917 /* Purge dead abnormal call edges from basic block BB. */
8920 gimple_purge_dead_abnormal_call_edges (basic_block bb
)
8922 bool changed
= false;
8925 gimple
*stmt
= last_stmt (bb
);
8927 if (stmt
&& stmt_can_make_abnormal_goto (stmt
))
8930 for (ei
= ei_start (bb
->succs
); (e
= ei_safe_edge (ei
)); )
8932 if (e
->flags
& EDGE_ABNORMAL
)
8934 if (e
->flags
& EDGE_FALLTHRU
)
8935 e
->flags
&= ~EDGE_ABNORMAL
;
8937 remove_edge_and_dominated_blocks (e
);
8947 /* Purge dead abnormal call edges from basic block listed in BLOCKS. */
8950 gimple_purge_all_dead_abnormal_call_edges (const_bitmap blocks
)
8952 bool changed
= false;
8956 EXECUTE_IF_SET_IN_BITMAP (blocks
, 0, i
, bi
)
8958 basic_block bb
= BASIC_BLOCK_FOR_FN (cfun
, i
);
8960 /* Earlier gimple_purge_dead_abnormal_call_edges could have removed
8961 this basic block already. */
8962 gcc_assert (bb
|| changed
);
8964 changed
|= gimple_purge_dead_abnormal_call_edges (bb
);
8970 /* This function is called whenever a new edge is created or
8974 gimple_execute_on_growing_pred (edge e
)
8976 basic_block bb
= e
->dest
;
8978 if (!gimple_seq_empty_p (phi_nodes (bb
)))
8979 reserve_phi_args_for_new_edge (bb
);
8982 /* This function is called immediately before edge E is removed from
8983 the edge vector E->dest->preds. */
8986 gimple_execute_on_shrinking_pred (edge e
)
8988 if (!gimple_seq_empty_p (phi_nodes (e
->dest
)))
8989 remove_phi_args (e
);
8992 /*---------------------------------------------------------------------------
8993 Helper functions for Loop versioning
8994 ---------------------------------------------------------------------------*/
8996 /* Adjust phi nodes for 'first' basic block. 'second' basic block is a copy
8997 of 'first'. Both of them are dominated by 'new_head' basic block. When
8998 'new_head' was created by 'second's incoming edge it received phi arguments
8999 on the edge by split_edge(). Later, additional edge 'e' was created to
9000 connect 'new_head' and 'first'. Now this routine adds phi args on this
9001 additional edge 'e' that new_head to second edge received as part of edge
9005 gimple_lv_adjust_loop_header_phi (basic_block first
, basic_block second
,
9006 basic_block new_head
, edge e
)
9009 gphi_iterator psi1
, psi2
;
9011 edge e2
= find_edge (new_head
, second
);
9013 /* Because NEW_HEAD has been created by splitting SECOND's incoming
9014 edge, we should always have an edge from NEW_HEAD to SECOND. */
9015 gcc_assert (e2
!= NULL
);
9017 /* Browse all 'second' basic block phi nodes and add phi args to
9018 edge 'e' for 'first' head. PHI args are always in correct order. */
9020 for (psi2
= gsi_start_phis (second
),
9021 psi1
= gsi_start_phis (first
);
9022 !gsi_end_p (psi2
) && !gsi_end_p (psi1
);
9023 gsi_next (&psi2
), gsi_next (&psi1
))
9027 def
= PHI_ARG_DEF (phi2
, e2
->dest_idx
);
9028 add_phi_arg (phi1
, def
, e
, gimple_phi_arg_location_from_edge (phi2
, e2
));
9033 /* Adds a if else statement to COND_BB with condition COND_EXPR.
9034 SECOND_HEAD is the destination of the THEN and FIRST_HEAD is
9035 the destination of the ELSE part. */
9038 gimple_lv_add_condition_to_bb (basic_block first_head ATTRIBUTE_UNUSED
,
9039 basic_block second_head ATTRIBUTE_UNUSED
,
9040 basic_block cond_bb
, void *cond_e
)
9042 gimple_stmt_iterator gsi
;
9043 gimple
*new_cond_expr
;
9044 tree cond_expr
= (tree
) cond_e
;
9047 /* Build new conditional expr */
9048 gsi
= gsi_last_bb (cond_bb
);
9050 cond_expr
= force_gimple_operand_gsi_1 (&gsi
, cond_expr
,
9051 is_gimple_condexpr_for_cond
,
9053 GSI_CONTINUE_LINKING
);
9054 new_cond_expr
= gimple_build_cond_from_tree (cond_expr
,
9055 NULL_TREE
, NULL_TREE
);
9057 /* Add new cond in cond_bb. */
9058 gsi_insert_after (&gsi
, new_cond_expr
, GSI_NEW_STMT
);
9060 /* Adjust edges appropriately to connect new head with first head
9061 as well as second head. */
9062 e0
= single_succ_edge (cond_bb
);
9063 e0
->flags
&= ~EDGE_FALLTHRU
;
9064 e0
->flags
|= EDGE_FALSE_VALUE
;
9068 /* Do book-keeping of basic block BB for the profile consistency checker.
9069 Store the counting in RECORD. */
9071 gimple_account_profile_record (basic_block bb
,
9072 struct profile_record
*record
)
9074 gimple_stmt_iterator i
;
9075 for (i
= gsi_start_nondebug_after_labels_bb (bb
); !gsi_end_p (i
);
9076 gsi_next_nondebug (&i
))
9079 += estimate_num_insns (gsi_stmt (i
), &eni_size_weights
);
9082 if (ENTRY_BLOCK_PTR_FOR_FN (cfun
)->count
.ipa ().initialized_p ()
9083 && ENTRY_BLOCK_PTR_FOR_FN (cfun
)->count
.ipa ().nonzero_p ()
9084 && bb
->count
.ipa ().initialized_p ())
9086 += estimate_num_insns (gsi_stmt (i
),
9088 * bb
->count
.ipa ().to_gcov_type ();
9090 else if (bb
->count
.initialized_p ()
9091 && ENTRY_BLOCK_PTR_FOR_FN (cfun
)->count
.initialized_p ())
9093 += estimate_num_insns
9096 * bb
->count
.to_sreal_scale
9097 (ENTRY_BLOCK_PTR_FOR_FN (cfun
)->count
).to_double ();
9100 += estimate_num_insns (gsi_stmt (i
), &eni_time_weights
);
9104 struct cfg_hooks gimple_cfg_hooks
= {
9106 gimple_verify_flow_info
,
9107 gimple_dump_bb
, /* dump_bb */
9108 gimple_dump_bb_for_graph
, /* dump_bb_for_graph */
9109 create_bb
, /* create_basic_block */
9110 gimple_redirect_edge_and_branch
, /* redirect_edge_and_branch */
9111 gimple_redirect_edge_and_branch_force
, /* redirect_edge_and_branch_force */
9112 gimple_can_remove_branch_p
, /* can_remove_branch_p */
9113 remove_bb
, /* delete_basic_block */
9114 gimple_split_block
, /* split_block */
9115 gimple_move_block_after
, /* move_block_after */
9116 gimple_can_merge_blocks_p
, /* can_merge_blocks_p */
9117 gimple_merge_blocks
, /* merge_blocks */
9118 gimple_predict_edge
, /* predict_edge */
9119 gimple_predicted_by_p
, /* predicted_by_p */
9120 gimple_can_duplicate_bb_p
, /* can_duplicate_block_p */
9121 gimple_duplicate_bb
, /* duplicate_block */
9122 gimple_split_edge
, /* split_edge */
9123 gimple_make_forwarder_block
, /* make_forward_block */
9124 NULL
, /* tidy_fallthru_edge */
9125 NULL
, /* force_nonfallthru */
9126 gimple_block_ends_with_call_p
,/* block_ends_with_call_p */
9127 gimple_block_ends_with_condjump_p
, /* block_ends_with_condjump_p */
9128 gimple_flow_call_edges_add
, /* flow_call_edges_add */
9129 gimple_execute_on_growing_pred
, /* execute_on_growing_pred */
9130 gimple_execute_on_shrinking_pred
, /* execute_on_shrinking_pred */
9131 gimple_duplicate_loop_body_to_header_edge
, /* duplicate loop for trees */
9132 gimple_lv_add_condition_to_bb
, /* lv_add_condition_to_bb */
9133 gimple_lv_adjust_loop_header_phi
, /* lv_adjust_loop_header_phi*/
9134 extract_true_false_edges_from_block
, /* extract_cond_bb_edges */
9135 flush_pending_stmts
, /* flush_pending_stmts */
9136 gimple_empty_block_p
, /* block_empty_p */
9137 gimple_split_block_before_cond_jump
, /* split_block_before_cond_jump */
9138 gimple_account_profile_record
,
9142 /* Split all critical edges. Split some extra (not necessarily critical) edges
9143 if FOR_EDGE_INSERTION_P is true. */
9146 split_critical_edges (bool for_edge_insertion_p
/* = false */)
9152 /* split_edge can redirect edges out of SWITCH_EXPRs, which can get
9153 expensive. So we want to enable recording of edge to CASE_LABEL_EXPR
9154 mappings around the calls to split_edge. */
9155 start_recording_case_labels ();
9156 FOR_ALL_BB_FN (bb
, cfun
)
9158 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
9160 if (EDGE_CRITICAL_P (e
) && !(e
->flags
& EDGE_ABNORMAL
))
9162 /* PRE inserts statements to edges and expects that
9163 since split_critical_edges was done beforehand, committing edge
9164 insertions will not split more edges. In addition to critical
9165 edges we must split edges that have multiple successors and
9166 end by control flow statements, such as RESX.
9167 Go ahead and split them too. This matches the logic in
9168 gimple_find_edge_insert_loc. */
9169 else if (for_edge_insertion_p
9170 && (!single_pred_p (e
->dest
)
9171 || !gimple_seq_empty_p (phi_nodes (e
->dest
))
9172 || e
->dest
== EXIT_BLOCK_PTR_FOR_FN (cfun
))
9173 && e
->src
!= ENTRY_BLOCK_PTR_FOR_FN (cfun
)
9174 && !(e
->flags
& EDGE_ABNORMAL
))
9176 gimple_stmt_iterator gsi
;
9178 gsi
= gsi_last_bb (e
->src
);
9179 if (!gsi_end_p (gsi
)
9180 && stmt_ends_bb_p (gsi_stmt (gsi
))
9181 && (gimple_code (gsi_stmt (gsi
)) != GIMPLE_RETURN
9182 && !gimple_call_builtin_p (gsi_stmt (gsi
),
9188 end_recording_case_labels ();
9194 const pass_data pass_data_split_crit_edges
=
9196 GIMPLE_PASS
, /* type */
9197 "crited", /* name */
9198 OPTGROUP_NONE
, /* optinfo_flags */
9199 TV_TREE_SPLIT_EDGES
, /* tv_id */
9200 PROP_cfg
, /* properties_required */
9201 PROP_no_crit_edges
, /* properties_provided */
9202 0, /* properties_destroyed */
9203 0, /* todo_flags_start */
9204 0, /* todo_flags_finish */
9207 class pass_split_crit_edges
: public gimple_opt_pass
9210 pass_split_crit_edges (gcc::context
*ctxt
)
9211 : gimple_opt_pass (pass_data_split_crit_edges
, ctxt
)
9214 /* opt_pass methods: */
9215 unsigned int execute (function
*) final override
9217 return split_critical_edges ();
9220 opt_pass
* clone () final override
9222 return new pass_split_crit_edges (m_ctxt
);
9224 }; // class pass_split_crit_edges
9229 make_pass_split_crit_edges (gcc::context
*ctxt
)
9231 return new pass_split_crit_edges (ctxt
);
9235 /* Insert COND expression which is GIMPLE_COND after STMT
9236 in basic block BB with appropriate basic block split
9237 and creation of a new conditionally executed basic block.
9238 Update profile so the new bb is visited with probability PROB.
9239 Return created basic block. */
9241 insert_cond_bb (basic_block bb
, gimple
*stmt
, gimple
*cond
,
9242 profile_probability prob
)
9244 edge fall
= split_block (bb
, stmt
);
9245 gimple_stmt_iterator iter
= gsi_last_bb (bb
);
9248 /* Insert cond statement. */
9249 gcc_assert (gimple_code (cond
) == GIMPLE_COND
);
9250 if (gsi_end_p (iter
))
9251 gsi_insert_before (&iter
, cond
, GSI_CONTINUE_LINKING
);
9253 gsi_insert_after (&iter
, cond
, GSI_CONTINUE_LINKING
);
9255 /* Create conditionally executed block. */
9256 new_bb
= create_empty_bb (bb
);
9257 edge e
= make_edge (bb
, new_bb
, EDGE_TRUE_VALUE
);
9258 e
->probability
= prob
;
9259 new_bb
->count
= e
->count ();
9260 make_single_succ_edge (new_bb
, fall
->dest
, EDGE_FALLTHRU
);
9262 /* Fix edge for split bb. */
9263 fall
->flags
= EDGE_FALSE_VALUE
;
9264 fall
->probability
-= e
->probability
;
9266 /* Update dominance info. */
9267 if (dom_info_available_p (CDI_DOMINATORS
))
9269 set_immediate_dominator (CDI_DOMINATORS
, new_bb
, bb
);
9270 set_immediate_dominator (CDI_DOMINATORS
, fall
->dest
, bb
);
9273 /* Update loop info. */
9275 add_bb_to_loop (new_bb
, bb
->loop_father
);
9282 /* Given a basic block B which ends with a conditional and has
9283 precisely two successors, determine which of the edges is taken if
9284 the conditional is true and which is taken if the conditional is
9285 false. Set TRUE_EDGE and FALSE_EDGE appropriately. */
9288 extract_true_false_edges_from_block (basic_block b
,
9292 edge e
= EDGE_SUCC (b
, 0);
9294 if (e
->flags
& EDGE_TRUE_VALUE
)
9297 *false_edge
= EDGE_SUCC (b
, 1);
9302 *true_edge
= EDGE_SUCC (b
, 1);
9307 /* From a controlling predicate in the immediate dominator DOM of
9308 PHIBLOCK determine the edges into PHIBLOCK that are chosen if the
9309 predicate evaluates to true and false and store them to
9310 *TRUE_CONTROLLED_EDGE and *FALSE_CONTROLLED_EDGE if
9311 they are non-NULL. Returns true if the edges can be determined,
9312 else return false. */
9315 extract_true_false_controlled_edges (basic_block dom
, basic_block phiblock
,
9316 edge
*true_controlled_edge
,
9317 edge
*false_controlled_edge
)
9319 basic_block bb
= phiblock
;
9320 edge true_edge
, false_edge
, tem
;
9321 edge e0
= NULL
, e1
= NULL
;
9323 /* We have to verify that one edge into the PHI node is dominated
9324 by the true edge of the predicate block and the other edge
9325 dominated by the false edge. This ensures that the PHI argument
9326 we are going to take is completely determined by the path we
9327 take from the predicate block.
9328 We can only use BB dominance checks below if the destination of
9329 the true/false edges are dominated by their edge, thus only
9330 have a single predecessor. */
9331 extract_true_false_edges_from_block (dom
, &true_edge
, &false_edge
);
9332 tem
= EDGE_PRED (bb
, 0);
9333 if (tem
== true_edge
9334 || (single_pred_p (true_edge
->dest
)
9335 && (tem
->src
== true_edge
->dest
9336 || dominated_by_p (CDI_DOMINATORS
,
9337 tem
->src
, true_edge
->dest
))))
9339 else if (tem
== false_edge
9340 || (single_pred_p (false_edge
->dest
)
9341 && (tem
->src
== false_edge
->dest
9342 || dominated_by_p (CDI_DOMINATORS
,
9343 tem
->src
, false_edge
->dest
))))
9347 tem
= EDGE_PRED (bb
, 1);
9348 if (tem
== true_edge
9349 || (single_pred_p (true_edge
->dest
)
9350 && (tem
->src
== true_edge
->dest
9351 || dominated_by_p (CDI_DOMINATORS
,
9352 tem
->src
, true_edge
->dest
))))
9354 else if (tem
== false_edge
9355 || (single_pred_p (false_edge
->dest
)
9356 && (tem
->src
== false_edge
->dest
9357 || dominated_by_p (CDI_DOMINATORS
,
9358 tem
->src
, false_edge
->dest
))))
9365 if (true_controlled_edge
)
9366 *true_controlled_edge
= e0
;
9367 if (false_controlled_edge
)
9368 *false_controlled_edge
= e1
;
9373 /* Generate a range test LHS CODE RHS that determines whether INDEX is in the
9374 range [low, high]. Place associated stmts before *GSI. */
9377 generate_range_test (basic_block bb
, tree index
, tree low
, tree high
,
9378 tree
*lhs
, tree
*rhs
)
9380 tree type
= TREE_TYPE (index
);
9381 tree utype
= range_check_type (type
);
9383 low
= fold_convert (utype
, low
);
9384 high
= fold_convert (utype
, high
);
9386 gimple_seq seq
= NULL
;
9387 index
= gimple_convert (&seq
, utype
, index
);
9388 *lhs
= gimple_build (&seq
, MINUS_EXPR
, utype
, index
, low
);
9389 *rhs
= const_binop (MINUS_EXPR
, utype
, high
, low
);
9391 gimple_stmt_iterator gsi
= gsi_last_bb (bb
);
9392 gsi_insert_seq_before (&gsi
, seq
, GSI_SAME_STMT
);
9395 /* Return the basic block that belongs to label numbered INDEX
9396 of a switch statement. */
9399 gimple_switch_label_bb (function
*ifun
, gswitch
*gs
, unsigned index
)
9401 return label_to_block (ifun
, CASE_LABEL (gimple_switch_label (gs
, index
)));
9404 /* Return the default basic block of a switch statement. */
9407 gimple_switch_default_bb (function
*ifun
, gswitch
*gs
)
9409 return gimple_switch_label_bb (ifun
, gs
, 0);
9412 /* Return the edge that belongs to label numbered INDEX
9413 of a switch statement. */
9416 gimple_switch_edge (function
*ifun
, gswitch
*gs
, unsigned index
)
9418 return find_edge (gimple_bb (gs
), gimple_switch_label_bb (ifun
, gs
, index
));
9421 /* Return the default edge of a switch statement. */
9424 gimple_switch_default_edge (function
*ifun
, gswitch
*gs
)
9426 return gimple_switch_edge (ifun
, gs
, 0);
9429 /* Return true if the only executable statement in BB is a GIMPLE_COND. */
9432 cond_only_block_p (basic_block bb
)
9434 /* BB must have no executable statements. */
9435 gimple_stmt_iterator gsi
= gsi_after_labels (bb
);
9438 while (!gsi_end_p (gsi
))
9440 gimple
*stmt
= gsi_stmt (gsi
);
9441 if (is_gimple_debug (stmt
))
9443 else if (gimple_code (stmt
) == GIMPLE_NOP
9444 || gimple_code (stmt
) == GIMPLE_PREDICT
9445 || gimple_code (stmt
) == GIMPLE_COND
)
9455 /* Emit return warnings. */
9459 const pass_data pass_data_warn_function_return
=
9461 GIMPLE_PASS
, /* type */
9462 "*warn_function_return", /* name */
9463 OPTGROUP_NONE
, /* optinfo_flags */
9464 TV_NONE
, /* tv_id */
9465 PROP_cfg
, /* properties_required */
9466 0, /* properties_provided */
9467 0, /* properties_destroyed */
9468 0, /* todo_flags_start */
9469 0, /* todo_flags_finish */
9472 class pass_warn_function_return
: public gimple_opt_pass
9475 pass_warn_function_return (gcc::context
*ctxt
)
9476 : gimple_opt_pass (pass_data_warn_function_return
, ctxt
)
9479 /* opt_pass methods: */
9480 unsigned int execute (function
*) final override
;
9482 }; // class pass_warn_function_return
9485 pass_warn_function_return::execute (function
*fun
)
9487 location_t location
;
9492 if (!targetm
.warn_func_return (fun
->decl
))
9495 /* If we have a path to EXIT, then we do return. */
9496 if (TREE_THIS_VOLATILE (fun
->decl
)
9497 && EDGE_COUNT (EXIT_BLOCK_PTR_FOR_FN (fun
)->preds
) > 0)
9499 location
= UNKNOWN_LOCATION
;
9500 for (ei
= ei_start (EXIT_BLOCK_PTR_FOR_FN (fun
)->preds
);
9501 (e
= ei_safe_edge (ei
)); )
9503 last
= last_stmt (e
->src
);
9504 if ((gimple_code (last
) == GIMPLE_RETURN
9505 || gimple_call_builtin_p (last
, BUILT_IN_RETURN
))
9506 && location
== UNKNOWN_LOCATION
9507 && ((location
= LOCATION_LOCUS (gimple_location (last
)))
9508 != UNKNOWN_LOCATION
)
9511 /* When optimizing, replace return stmts in noreturn functions
9512 with __builtin_unreachable () call. */
9513 if (optimize
&& gimple_code (last
) == GIMPLE_RETURN
)
9515 location_t loc
= gimple_location (last
);
9516 gimple
*new_stmt
= gimple_build_builtin_unreachable (loc
);
9517 gimple_stmt_iterator gsi
= gsi_for_stmt (last
);
9518 gsi_replace (&gsi
, new_stmt
, true);
9524 if (location
== UNKNOWN_LOCATION
)
9525 location
= cfun
->function_end_locus
;
9526 warning_at (location
, 0, "%<noreturn%> function does return");
9529 /* If we see "return;" in some basic block, then we do reach the end
9530 without returning a value. */
9531 else if (warn_return_type
> 0
9532 && !warning_suppressed_p (fun
->decl
, OPT_Wreturn_type
)
9533 && !VOID_TYPE_P (TREE_TYPE (TREE_TYPE (fun
->decl
))))
9535 FOR_EACH_EDGE (e
, ei
, EXIT_BLOCK_PTR_FOR_FN (fun
)->preds
)
9537 gimple
*last
= last_stmt (e
->src
);
9538 greturn
*return_stmt
= dyn_cast
<greturn
*> (last
);
9540 && gimple_return_retval (return_stmt
) == NULL
9541 && !warning_suppressed_p (last
, OPT_Wreturn_type
))
9543 location
= gimple_location (last
);
9544 if (LOCATION_LOCUS (location
) == UNKNOWN_LOCATION
)
9545 location
= fun
->function_end_locus
;
9546 if (warning_at (location
, OPT_Wreturn_type
,
9547 "control reaches end of non-void function"))
9548 suppress_warning (fun
->decl
, OPT_Wreturn_type
);
9552 /* The C++ FE turns fallthrough from the end of non-void function
9553 into __builtin_unreachable () call with BUILTINS_LOCATION.
9554 Recognize those as well as calls from ubsan_instrument_return. */
9556 if (!warning_suppressed_p (fun
->decl
, OPT_Wreturn_type
))
9557 FOR_EACH_BB_FN (bb
, fun
)
9558 if (EDGE_COUNT (bb
->succs
) == 0)
9560 gimple
*last
= last_stmt (bb
);
9561 const enum built_in_function ubsan_missing_ret
9562 = BUILT_IN_UBSAN_HANDLE_MISSING_RETURN
;
9564 && ((LOCATION_LOCUS (gimple_location (last
))
9565 == BUILTINS_LOCATION
9566 && (gimple_call_builtin_p (last
, BUILT_IN_UNREACHABLE
)
9567 || gimple_call_builtin_p (last
, BUILT_IN_TRAP
)))
9568 || gimple_call_builtin_p (last
, ubsan_missing_ret
)))
9570 gimple_stmt_iterator gsi
= gsi_for_stmt (last
);
9571 gsi_prev_nondebug (&gsi
);
9572 gimple
*prev
= gsi_stmt (gsi
);
9574 location
= UNKNOWN_LOCATION
;
9576 location
= gimple_location (prev
);
9577 if (LOCATION_LOCUS (location
) == UNKNOWN_LOCATION
)
9578 location
= fun
->function_end_locus
;
9579 if (warning_at (location
, OPT_Wreturn_type
,
9580 "control reaches end of non-void function"))
9581 suppress_warning (fun
->decl
, OPT_Wreturn_type
);
9592 make_pass_warn_function_return (gcc::context
*ctxt
)
9594 return new pass_warn_function_return (ctxt
);
9597 /* Walk a gimplified function and warn for functions whose return value is
9598 ignored and attribute((warn_unused_result)) is set. This is done before
9599 inlining, so we don't have to worry about that. */
9602 do_warn_unused_result (gimple_seq seq
)
9605 gimple_stmt_iterator i
;
9607 for (i
= gsi_start (seq
); !gsi_end_p (i
); gsi_next (&i
))
9609 gimple
*g
= gsi_stmt (i
);
9611 switch (gimple_code (g
))
9614 do_warn_unused_result (gimple_bind_body (as_a
<gbind
*>(g
)));
9617 do_warn_unused_result (gimple_try_eval (g
));
9618 do_warn_unused_result (gimple_try_cleanup (g
));
9621 do_warn_unused_result (gimple_catch_handler (
9622 as_a
<gcatch
*> (g
)));
9624 case GIMPLE_EH_FILTER
:
9625 do_warn_unused_result (gimple_eh_filter_failure (g
));
9629 if (gimple_call_lhs (g
))
9631 if (gimple_call_internal_p (g
))
9634 /* This is a naked call, as opposed to a GIMPLE_CALL with an
9635 LHS. All calls whose value is ignored should be
9636 represented like this. Look for the attribute. */
9637 fdecl
= gimple_call_fndecl (g
);
9638 ftype
= gimple_call_fntype (g
);
9640 if (lookup_attribute ("warn_unused_result", TYPE_ATTRIBUTES (ftype
)))
9642 location_t loc
= gimple_location (g
);
9645 warning_at (loc
, OPT_Wunused_result
,
9646 "ignoring return value of %qD "
9647 "declared with attribute %<warn_unused_result%>",
9650 warning_at (loc
, OPT_Wunused_result
,
9651 "ignoring return value of function "
9652 "declared with attribute %<warn_unused_result%>");
9657 /* Not a container, not a call, or a call whose value is used. */
9665 const pass_data pass_data_warn_unused_result
=
9667 GIMPLE_PASS
, /* type */
9668 "*warn_unused_result", /* name */
9669 OPTGROUP_NONE
, /* optinfo_flags */
9670 TV_NONE
, /* tv_id */
9671 PROP_gimple_any
, /* properties_required */
9672 0, /* properties_provided */
9673 0, /* properties_destroyed */
9674 0, /* todo_flags_start */
9675 0, /* todo_flags_finish */
9678 class pass_warn_unused_result
: public gimple_opt_pass
9681 pass_warn_unused_result (gcc::context
*ctxt
)
9682 : gimple_opt_pass (pass_data_warn_unused_result
, ctxt
)
9685 /* opt_pass methods: */
9686 bool gate (function
*) final override
{ return flag_warn_unused_result
; }
9687 unsigned int execute (function
*) final override
9689 do_warn_unused_result (gimple_body (current_function_decl
));
9693 }; // class pass_warn_unused_result
9698 make_pass_warn_unused_result (gcc::context
*ctxt
)
9700 return new pass_warn_unused_result (ctxt
);
9703 /* Maybe Remove stores to variables we marked write-only.
9704 Return true if a store was removed. */
9706 maybe_remove_writeonly_store (gimple_stmt_iterator
&gsi
, gimple
*stmt
,
9707 bitmap dce_ssa_names
)
9709 /* Keep access when store has side effect, i.e. in case when source
9711 if (!gimple_store_p (stmt
)
9712 || gimple_has_side_effects (stmt
)
9716 tree lhs
= get_base_address (gimple_get_lhs (stmt
));
9719 || (!TREE_STATIC (lhs
) && !DECL_EXTERNAL (lhs
))
9720 || !varpool_node::get (lhs
)->writeonly
)
9723 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
9725 fprintf (dump_file
, "Removing statement, writes"
9726 " to write only var:\n");
9727 print_gimple_stmt (dump_file
, stmt
, 0,
9728 TDF_VOPS
|TDF_MEMSYMS
);
9731 /* Mark ssa name defining to be checked for simple dce. */
9732 if (gimple_assign_single_p (stmt
))
9734 tree rhs
= gimple_assign_rhs1 (stmt
);
9735 if (TREE_CODE (rhs
) == SSA_NAME
9736 && !SSA_NAME_IS_DEFAULT_DEF (rhs
))
9737 bitmap_set_bit (dce_ssa_names
, SSA_NAME_VERSION (rhs
));
9739 unlink_stmt_vdef (stmt
);
9740 gsi_remove (&gsi
, true);
9741 release_defs (stmt
);
9745 /* IPA passes, compilation of earlier functions or inlining
9746 might have changed some properties, such as marked functions nothrow,
9747 pure, const or noreturn.
9748 Remove redundant edges and basic blocks, and create new ones if necessary. */
9751 execute_fixup_cfg (void)
9754 gimple_stmt_iterator gsi
;
9756 cgraph_node
*node
= cgraph_node::get (current_function_decl
);
9757 /* Same scaling is also done by ipa_merge_profiles. */
9758 profile_count num
= node
->count
;
9759 profile_count den
= ENTRY_BLOCK_PTR_FOR_FN (cfun
)->count
;
9760 bool scale
= num
.initialized_p () && !(num
== den
);
9761 auto_bitmap dce_ssa_names
;
9765 profile_count::adjust_for_ipa_scaling (&num
, &den
);
9766 ENTRY_BLOCK_PTR_FOR_FN (cfun
)->count
= node
->count
;
9767 EXIT_BLOCK_PTR_FOR_FN (cfun
)->count
9768 = EXIT_BLOCK_PTR_FOR_FN (cfun
)->count
.apply_scale (num
, den
);
9771 FOR_EACH_BB_FN (bb
, cfun
)
9774 bb
->count
= bb
->count
.apply_scale (num
, den
);
9775 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
);)
9777 gimple
*stmt
= gsi_stmt (gsi
);
9778 tree decl
= is_gimple_call (stmt
)
9779 ? gimple_call_fndecl (stmt
)
9783 int flags
= gimple_call_flags (stmt
);
9784 if (flags
& (ECF_CONST
| ECF_PURE
| ECF_LOOPING_CONST_OR_PURE
))
9786 if (gimple_purge_dead_abnormal_call_edges (bb
))
9787 todo
|= TODO_cleanup_cfg
;
9789 if (gimple_in_ssa_p (cfun
))
9791 todo
|= TODO_update_ssa
| TODO_cleanup_cfg
;
9796 if (flags
& ECF_NORETURN
9797 && fixup_noreturn_call (stmt
))
9798 todo
|= TODO_cleanup_cfg
;
9801 /* Remove stores to variables we marked write-only. */
9802 if (maybe_remove_writeonly_store (gsi
, stmt
, dce_ssa_names
))
9804 todo
|= TODO_update_ssa
| TODO_cleanup_cfg
;
9808 /* For calls we can simply remove LHS when it is known
9809 to be write-only. */
9810 if (is_gimple_call (stmt
)
9811 && gimple_get_lhs (stmt
))
9813 tree lhs
= get_base_address (gimple_get_lhs (stmt
));
9816 && (TREE_STATIC (lhs
) || DECL_EXTERNAL (lhs
))
9817 && varpool_node::get (lhs
)->writeonly
)
9819 gimple_call_set_lhs (stmt
, NULL
);
9821 todo
|= TODO_update_ssa
| TODO_cleanup_cfg
;
9825 if (maybe_clean_eh_stmt (stmt
)
9826 && gimple_purge_dead_eh_edges (bb
))
9827 todo
|= TODO_cleanup_cfg
;
9831 /* If we have a basic block with no successors that does not
9832 end with a control statement or a noreturn call end it with
9833 a call to __builtin_unreachable. This situation can occur
9834 when inlining a noreturn call that does in fact return. */
9835 if (EDGE_COUNT (bb
->succs
) == 0)
9837 gimple
*stmt
= last_stmt (bb
);
9839 || (!is_ctrl_stmt (stmt
)
9840 && (!is_gimple_call (stmt
)
9841 || !gimple_call_noreturn_p (stmt
))))
9843 if (stmt
&& is_gimple_call (stmt
))
9844 gimple_call_set_ctrl_altering (stmt
, false);
9845 tree fndecl
= builtin_decl_unreachable ();
9846 stmt
= gimple_build_call (fndecl
, 0);
9847 gimple_stmt_iterator gsi
= gsi_last_bb (bb
);
9848 gsi_insert_after (&gsi
, stmt
, GSI_NEW_STMT
);
9849 if (!cfun
->after_inlining
)
9851 gcall
*call_stmt
= dyn_cast
<gcall
*> (stmt
);
9852 node
->create_edge (cgraph_node::get_create (fndecl
),
9853 call_stmt
, bb
->count
);
9860 update_max_bb_count ();
9861 compute_function_frequency ();
9865 && (todo
& TODO_cleanup_cfg
))
9866 loops_state_set (LOOPS_NEED_FIXUP
);
9868 simple_dce_from_worklist (dce_ssa_names
);
9875 const pass_data pass_data_fixup_cfg
=
9877 GIMPLE_PASS
, /* type */
9878 "fixup_cfg", /* name */
9879 OPTGROUP_NONE
, /* optinfo_flags */
9880 TV_NONE
, /* tv_id */
9881 PROP_cfg
, /* properties_required */
9882 0, /* properties_provided */
9883 0, /* properties_destroyed */
9884 0, /* todo_flags_start */
9885 0, /* todo_flags_finish */
9888 class pass_fixup_cfg
: public gimple_opt_pass
9891 pass_fixup_cfg (gcc::context
*ctxt
)
9892 : gimple_opt_pass (pass_data_fixup_cfg
, ctxt
)
9895 /* opt_pass methods: */
9896 opt_pass
* clone () final override
{ return new pass_fixup_cfg (m_ctxt
); }
9897 unsigned int execute (function
*) final override
9899 return execute_fixup_cfg ();
9902 }; // class pass_fixup_cfg
9907 make_pass_fixup_cfg (gcc::context
*ctxt
)
9909 return new pass_fixup_cfg (ctxt
);
9912 /* Garbage collection support for edge_def. */
9914 extern void gt_ggc_mx (tree
&);
9915 extern void gt_ggc_mx (gimple
*&);
9916 extern void gt_ggc_mx (rtx
&);
9917 extern void gt_ggc_mx (basic_block
&);
9920 gt_ggc_mx (rtx_insn
*& x
)
9923 gt_ggc_mx_rtx_def ((void *) x
);
9927 gt_ggc_mx (edge_def
*e
)
9929 tree block
= LOCATION_BLOCK (e
->goto_locus
);
9931 gt_ggc_mx (e
->dest
);
9932 if (current_ir_type () == IR_GIMPLE
)
9933 gt_ggc_mx (e
->insns
.g
);
9935 gt_ggc_mx (e
->insns
.r
);
9939 /* PCH support for edge_def. */
9941 extern void gt_pch_nx (tree
&);
9942 extern void gt_pch_nx (gimple
*&);
9943 extern void gt_pch_nx (rtx
&);
9944 extern void gt_pch_nx (basic_block
&);
9947 gt_pch_nx (rtx_insn
*& x
)
9950 gt_pch_nx_rtx_def ((void *) x
);
9954 gt_pch_nx (edge_def
*e
)
9956 tree block
= LOCATION_BLOCK (e
->goto_locus
);
9958 gt_pch_nx (e
->dest
);
9959 if (current_ir_type () == IR_GIMPLE
)
9960 gt_pch_nx (e
->insns
.g
);
9962 gt_pch_nx (e
->insns
.r
);
9967 gt_pch_nx (edge_def
*e
, gt_pointer_operator op
, void *cookie
)
9969 tree block
= LOCATION_BLOCK (e
->goto_locus
);
9970 op (&(e
->src
), NULL
, cookie
);
9971 op (&(e
->dest
), NULL
, cookie
);
9972 if (current_ir_type () == IR_GIMPLE
)
9973 op (&(e
->insns
.g
), NULL
, cookie
);
9975 op (&(e
->insns
.r
), NULL
, cookie
);
9976 op (&(block
), &(block
), cookie
);
9981 namespace selftest
{
9983 /* Helper function for CFG selftests: create a dummy function decl
9984 and push it as cfun. */
9987 push_fndecl (const char *name
)
9989 tree fn_type
= build_function_type_array (integer_type_node
, 0, NULL
);
9990 /* FIXME: this uses input_location: */
9991 tree fndecl
= build_fn_decl (name
, fn_type
);
9992 tree retval
= build_decl (UNKNOWN_LOCATION
, RESULT_DECL
,
9993 NULL_TREE
, integer_type_node
);
9994 DECL_RESULT (fndecl
) = retval
;
9995 push_struct_function (fndecl
);
9996 function
*fun
= DECL_STRUCT_FUNCTION (fndecl
);
9997 ASSERT_TRUE (fun
!= NULL
);
9998 init_empty_tree_cfg_for_function (fun
);
9999 ASSERT_EQ (2, n_basic_blocks_for_fn (fun
));
10000 ASSERT_EQ (0, n_edges_for_fn (fun
));
10004 /* These tests directly create CFGs.
10005 Compare with the static fns within tree-cfg.cc:
10007 - make_blocks: calls create_basic_block (seq, bb);
10010 /* Verify a simple cfg of the form:
10011 ENTRY -> A -> B -> C -> EXIT. */
10014 test_linear_chain ()
10016 gimple_register_cfg_hooks ();
10018 tree fndecl
= push_fndecl ("cfg_test_linear_chain");
10019 function
*fun
= DECL_STRUCT_FUNCTION (fndecl
);
10021 /* Create some empty blocks. */
10022 basic_block bb_a
= create_empty_bb (ENTRY_BLOCK_PTR_FOR_FN (fun
));
10023 basic_block bb_b
= create_empty_bb (bb_a
);
10024 basic_block bb_c
= create_empty_bb (bb_b
);
10026 ASSERT_EQ (5, n_basic_blocks_for_fn (fun
));
10027 ASSERT_EQ (0, n_edges_for_fn (fun
));
10029 /* Create some edges: a simple linear chain of BBs. */
10030 make_edge (ENTRY_BLOCK_PTR_FOR_FN (fun
), bb_a
, EDGE_FALLTHRU
);
10031 make_edge (bb_a
, bb_b
, 0);
10032 make_edge (bb_b
, bb_c
, 0);
10033 make_edge (bb_c
, EXIT_BLOCK_PTR_FOR_FN (fun
), 0);
10035 /* Verify the edges. */
10036 ASSERT_EQ (4, n_edges_for_fn (fun
));
10037 ASSERT_EQ (NULL
, ENTRY_BLOCK_PTR_FOR_FN (fun
)->preds
);
10038 ASSERT_EQ (1, ENTRY_BLOCK_PTR_FOR_FN (fun
)->succs
->length ());
10039 ASSERT_EQ (1, bb_a
->preds
->length ());
10040 ASSERT_EQ (1, bb_a
->succs
->length ());
10041 ASSERT_EQ (1, bb_b
->preds
->length ());
10042 ASSERT_EQ (1, bb_b
->succs
->length ());
10043 ASSERT_EQ (1, bb_c
->preds
->length ());
10044 ASSERT_EQ (1, bb_c
->succs
->length ());
10045 ASSERT_EQ (1, EXIT_BLOCK_PTR_FOR_FN (fun
)->preds
->length ());
10046 ASSERT_EQ (NULL
, EXIT_BLOCK_PTR_FOR_FN (fun
)->succs
);
10048 /* Verify the dominance information
10049 Each BB in our simple chain should be dominated by the one before
10051 calculate_dominance_info (CDI_DOMINATORS
);
10052 ASSERT_EQ (bb_a
, get_immediate_dominator (CDI_DOMINATORS
, bb_b
));
10053 ASSERT_EQ (bb_b
, get_immediate_dominator (CDI_DOMINATORS
, bb_c
));
10054 auto_vec
<basic_block
> dom_by_b
= get_dominated_by (CDI_DOMINATORS
, bb_b
);
10055 ASSERT_EQ (1, dom_by_b
.length ());
10056 ASSERT_EQ (bb_c
, dom_by_b
[0]);
10057 free_dominance_info (CDI_DOMINATORS
);
10059 /* Similarly for post-dominance: each BB in our chain is post-dominated
10060 by the one after it. */
10061 calculate_dominance_info (CDI_POST_DOMINATORS
);
10062 ASSERT_EQ (bb_b
, get_immediate_dominator (CDI_POST_DOMINATORS
, bb_a
));
10063 ASSERT_EQ (bb_c
, get_immediate_dominator (CDI_POST_DOMINATORS
, bb_b
));
10064 auto_vec
<basic_block
> postdom_by_b
= get_dominated_by (CDI_POST_DOMINATORS
, bb_b
);
10065 ASSERT_EQ (1, postdom_by_b
.length ());
10066 ASSERT_EQ (bb_a
, postdom_by_b
[0]);
10067 free_dominance_info (CDI_POST_DOMINATORS
);
10072 /* Verify a simple CFG of the form:
10088 gimple_register_cfg_hooks ();
10090 tree fndecl
= push_fndecl ("cfg_test_diamond");
10091 function
*fun
= DECL_STRUCT_FUNCTION (fndecl
);
10093 /* Create some empty blocks. */
10094 basic_block bb_a
= create_empty_bb (ENTRY_BLOCK_PTR_FOR_FN (fun
));
10095 basic_block bb_b
= create_empty_bb (bb_a
);
10096 basic_block bb_c
= create_empty_bb (bb_a
);
10097 basic_block bb_d
= create_empty_bb (bb_b
);
10099 ASSERT_EQ (6, n_basic_blocks_for_fn (fun
));
10100 ASSERT_EQ (0, n_edges_for_fn (fun
));
10102 /* Create the edges. */
10103 make_edge (ENTRY_BLOCK_PTR_FOR_FN (fun
), bb_a
, EDGE_FALLTHRU
);
10104 make_edge (bb_a
, bb_b
, EDGE_TRUE_VALUE
);
10105 make_edge (bb_a
, bb_c
, EDGE_FALSE_VALUE
);
10106 make_edge (bb_b
, bb_d
, 0);
10107 make_edge (bb_c
, bb_d
, 0);
10108 make_edge (bb_d
, EXIT_BLOCK_PTR_FOR_FN (fun
), 0);
10110 /* Verify the edges. */
10111 ASSERT_EQ (6, n_edges_for_fn (fun
));
10112 ASSERT_EQ (1, bb_a
->preds
->length ());
10113 ASSERT_EQ (2, bb_a
->succs
->length ());
10114 ASSERT_EQ (1, bb_b
->preds
->length ());
10115 ASSERT_EQ (1, bb_b
->succs
->length ());
10116 ASSERT_EQ (1, bb_c
->preds
->length ());
10117 ASSERT_EQ (1, bb_c
->succs
->length ());
10118 ASSERT_EQ (2, bb_d
->preds
->length ());
10119 ASSERT_EQ (1, bb_d
->succs
->length ());
10121 /* Verify the dominance information. */
10122 calculate_dominance_info (CDI_DOMINATORS
);
10123 ASSERT_EQ (bb_a
, get_immediate_dominator (CDI_DOMINATORS
, bb_b
));
10124 ASSERT_EQ (bb_a
, get_immediate_dominator (CDI_DOMINATORS
, bb_c
));
10125 ASSERT_EQ (bb_a
, get_immediate_dominator (CDI_DOMINATORS
, bb_d
));
10126 auto_vec
<basic_block
> dom_by_a
= get_dominated_by (CDI_DOMINATORS
, bb_a
);
10127 ASSERT_EQ (3, dom_by_a
.length ()); /* B, C, D, in some order. */
10128 dom_by_a
.release ();
10129 auto_vec
<basic_block
> dom_by_b
= get_dominated_by (CDI_DOMINATORS
, bb_b
);
10130 ASSERT_EQ (0, dom_by_b
.length ());
10131 dom_by_b
.release ();
10132 free_dominance_info (CDI_DOMINATORS
);
10134 /* Similarly for post-dominance. */
10135 calculate_dominance_info (CDI_POST_DOMINATORS
);
10136 ASSERT_EQ (bb_d
, get_immediate_dominator (CDI_POST_DOMINATORS
, bb_a
));
10137 ASSERT_EQ (bb_d
, get_immediate_dominator (CDI_POST_DOMINATORS
, bb_b
));
10138 ASSERT_EQ (bb_d
, get_immediate_dominator (CDI_POST_DOMINATORS
, bb_c
));
10139 auto_vec
<basic_block
> postdom_by_d
= get_dominated_by (CDI_POST_DOMINATORS
, bb_d
);
10140 ASSERT_EQ (3, postdom_by_d
.length ()); /* A, B, C in some order. */
10141 postdom_by_d
.release ();
10142 auto_vec
<basic_block
> postdom_by_b
= get_dominated_by (CDI_POST_DOMINATORS
, bb_b
);
10143 ASSERT_EQ (0, postdom_by_b
.length ());
10144 postdom_by_b
.release ();
10145 free_dominance_info (CDI_POST_DOMINATORS
);
10150 /* Verify that we can handle a CFG containing a "complete" aka
10151 fully-connected subgraph (where A B C D below all have edges
10152 pointing to each other node, also to themselves).
10170 test_fully_connected ()
10172 gimple_register_cfg_hooks ();
10174 tree fndecl
= push_fndecl ("cfg_fully_connected");
10175 function
*fun
= DECL_STRUCT_FUNCTION (fndecl
);
10179 /* Create some empty blocks. */
10180 auto_vec
<basic_block
> subgraph_nodes
;
10181 for (int i
= 0; i
< n
; i
++)
10182 subgraph_nodes
.safe_push (create_empty_bb (ENTRY_BLOCK_PTR_FOR_FN (fun
)));
10184 ASSERT_EQ (n
+ 2, n_basic_blocks_for_fn (fun
));
10185 ASSERT_EQ (0, n_edges_for_fn (fun
));
10187 /* Create the edges. */
10188 make_edge (ENTRY_BLOCK_PTR_FOR_FN (fun
), subgraph_nodes
[0], EDGE_FALLTHRU
);
10189 make_edge (subgraph_nodes
[0], EXIT_BLOCK_PTR_FOR_FN (fun
), 0);
10190 for (int i
= 0; i
< n
; i
++)
10191 for (int j
= 0; j
< n
; j
++)
10192 make_edge (subgraph_nodes
[i
], subgraph_nodes
[j
], 0);
10194 /* Verify the edges. */
10195 ASSERT_EQ (2 + (n
* n
), n_edges_for_fn (fun
));
10196 /* The first one is linked to ENTRY/EXIT as well as itself and
10197 everything else. */
10198 ASSERT_EQ (n
+ 1, subgraph_nodes
[0]->preds
->length ());
10199 ASSERT_EQ (n
+ 1, subgraph_nodes
[0]->succs
->length ());
10200 /* The other ones in the subgraph are linked to everything in
10201 the subgraph (including themselves). */
10202 for (int i
= 1; i
< n
; i
++)
10204 ASSERT_EQ (n
, subgraph_nodes
[i
]->preds
->length ());
10205 ASSERT_EQ (n
, subgraph_nodes
[i
]->succs
->length ());
10208 /* Verify the dominance information. */
10209 calculate_dominance_info (CDI_DOMINATORS
);
10210 /* The initial block in the subgraph should be dominated by ENTRY. */
10211 ASSERT_EQ (ENTRY_BLOCK_PTR_FOR_FN (fun
),
10212 get_immediate_dominator (CDI_DOMINATORS
,
10213 subgraph_nodes
[0]));
10214 /* Every other block in the subgraph should be dominated by the
10216 for (int i
= 1; i
< n
; i
++)
10217 ASSERT_EQ (subgraph_nodes
[0],
10218 get_immediate_dominator (CDI_DOMINATORS
,
10219 subgraph_nodes
[i
]));
10220 free_dominance_info (CDI_DOMINATORS
);
10222 /* Similarly for post-dominance. */
10223 calculate_dominance_info (CDI_POST_DOMINATORS
);
10224 /* The initial block in the subgraph should be postdominated by EXIT. */
10225 ASSERT_EQ (EXIT_BLOCK_PTR_FOR_FN (fun
),
10226 get_immediate_dominator (CDI_POST_DOMINATORS
,
10227 subgraph_nodes
[0]));
10228 /* Every other block in the subgraph should be postdominated by the
10229 initial block, since that leads to EXIT. */
10230 for (int i
= 1; i
< n
; i
++)
10231 ASSERT_EQ (subgraph_nodes
[0],
10232 get_immediate_dominator (CDI_POST_DOMINATORS
,
10233 subgraph_nodes
[i
]));
10234 free_dominance_info (CDI_POST_DOMINATORS
);
10239 /* Run all of the selftests within this file. */
10242 tree_cfg_cc_tests ()
10244 test_linear_chain ();
10246 test_fully_connected ();
10249 } // namespace selftest
10251 /* TODO: test the dominator/postdominator logic with various graphs/nodes:
10254 - switch statement (a block with many out-edges)
10255 - something that jumps to itself
10258 #endif /* CHECKING_P */