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-fold.h"
42 #include "gimple-iterator.h"
43 #include "gimplify-me.h"
44 #include "gimple-walk.h"
46 #include "tree-ssa-loop-manip.h"
47 #include "tree-ssa-loop-niter.h"
48 #include "tree-into-ssa.h"
53 #include "tree-ssa-propagate.h"
54 #include "value-prof.h"
55 #include "tree-inline.h"
56 #include "tree-ssa-live.h"
57 #include "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 virtual unsigned int execute (function
*) { return execute_build_cfg (); }
412 }; // class pass_build_cfg
417 make_pass_build_cfg (gcc::context
*ctxt
)
419 return new pass_build_cfg (ctxt
);
423 /* Return true if T is a computed goto. */
426 computed_goto_p (gimple
*t
)
428 return (gimple_code (t
) == GIMPLE_GOTO
429 && TREE_CODE (gimple_goto_dest (t
)) != LABEL_DECL
);
432 /* Returns true if the sequence of statements STMTS only contains
433 a call to __builtin_unreachable (). */
436 gimple_seq_unreachable_p (gimple_seq stmts
)
439 /* Return false if -fsanitize=unreachable, we don't want to
440 optimize away those calls, but rather turn them into
441 __ubsan_handle_builtin_unreachable () or __builtin_trap ()
443 || sanitize_flags_p (SANITIZE_UNREACHABLE
))
446 gimple_stmt_iterator gsi
= gsi_last (stmts
);
448 if (!gimple_call_builtin_p (gsi_stmt (gsi
), BUILT_IN_UNREACHABLE
))
451 for (gsi_prev (&gsi
); !gsi_end_p (gsi
); gsi_prev (&gsi
))
453 gimple
*stmt
= gsi_stmt (gsi
);
454 if (gimple_code (stmt
) != GIMPLE_LABEL
455 && !is_gimple_debug (stmt
)
456 && !gimple_clobber_p (stmt
))
462 /* Returns true for edge E where e->src ends with a GIMPLE_COND and
463 the other edge points to a bb with just __builtin_unreachable ().
464 I.e. return true for C->M edge in:
472 __builtin_unreachable ();
476 assert_unreachable_fallthru_edge_p (edge e
)
478 basic_block pred_bb
= e
->src
;
479 gimple
*last
= last_stmt (pred_bb
);
480 if (last
&& gimple_code (last
) == GIMPLE_COND
)
482 basic_block other_bb
= EDGE_SUCC (pred_bb
, 0)->dest
;
483 if (other_bb
== e
->dest
)
484 other_bb
= EDGE_SUCC (pred_bb
, 1)->dest
;
485 if (EDGE_COUNT (other_bb
->succs
) == 0)
486 return gimple_seq_unreachable_p (bb_seq (other_bb
));
492 /* Initialize GF_CALL_CTRL_ALTERING flag, which indicates the call
493 could alter control flow except via eh. We initialize the flag at
494 CFG build time and only ever clear it later. */
497 gimple_call_initialize_ctrl_altering (gimple
*stmt
)
499 int flags
= gimple_call_flags (stmt
);
501 /* A call alters control flow if it can make an abnormal goto. */
502 if (call_can_make_abnormal_goto (stmt
)
503 /* A call also alters control flow if it does not return. */
504 || flags
& ECF_NORETURN
505 /* TM ending statements have backedges out of the transaction.
506 Return true so we split the basic block containing them.
507 Note that the TM_BUILTIN test is merely an optimization. */
508 || ((flags
& ECF_TM_BUILTIN
)
509 && is_tm_ending_fndecl (gimple_call_fndecl (stmt
)))
510 /* BUILT_IN_RETURN call is same as return statement. */
511 || gimple_call_builtin_p (stmt
, BUILT_IN_RETURN
)
512 /* IFN_UNIQUE should be the last insn, to make checking for it
513 as cheap as possible. */
514 || (gimple_call_internal_p (stmt
)
515 && gimple_call_internal_unique_p (stmt
)))
516 gimple_call_set_ctrl_altering (stmt
, true);
518 gimple_call_set_ctrl_altering (stmt
, false);
522 /* Insert SEQ after BB and build a flowgraph. */
525 make_blocks_1 (gimple_seq seq
, basic_block bb
)
527 gimple_stmt_iterator i
= gsi_start (seq
);
529 gimple
*prev_stmt
= NULL
;
530 bool start_new_block
= true;
531 bool first_stmt_of_seq
= true;
533 while (!gsi_end_p (i
))
535 /* PREV_STMT should only be set to a debug stmt if the debug
536 stmt is before nondebug stmts. Once stmt reaches a nondebug
537 nonlabel, prev_stmt will be set to it, so that
538 stmt_starts_bb_p will know to start a new block if a label is
539 found. However, if stmt was a label after debug stmts only,
540 keep the label in prev_stmt even if we find further debug
541 stmts, for there may be other labels after them, and they
542 should land in the same block. */
543 if (!prev_stmt
|| !stmt
|| !is_gimple_debug (stmt
))
547 if (stmt
&& is_gimple_call (stmt
))
548 gimple_call_initialize_ctrl_altering (stmt
);
550 /* If the statement starts a new basic block or if we have determined
551 in a previous pass that we need to create a new block for STMT, do
553 if (start_new_block
|| stmt_starts_bb_p (stmt
, prev_stmt
))
555 if (!first_stmt_of_seq
)
556 gsi_split_seq_before (&i
, &seq
);
557 bb
= create_basic_block (seq
, bb
);
558 start_new_block
= false;
562 /* Now add STMT to BB and create the subgraphs for special statement
564 gimple_set_bb (stmt
, bb
);
566 /* If STMT is a basic block terminator, set START_NEW_BLOCK for the
568 if (stmt_ends_bb_p (stmt
))
570 /* If the stmt can make abnormal goto use a new temporary
571 for the assignment to the LHS. This makes sure the old value
572 of the LHS is available on the abnormal edge. Otherwise
573 we will end up with overlapping life-ranges for abnormal
575 if (gimple_has_lhs (stmt
)
576 && stmt_can_make_abnormal_goto (stmt
)
577 && is_gimple_reg_type (TREE_TYPE (gimple_get_lhs (stmt
))))
579 tree lhs
= gimple_get_lhs (stmt
);
580 tree tmp
= create_tmp_var (TREE_TYPE (lhs
));
581 gimple
*s
= gimple_build_assign (lhs
, tmp
);
582 gimple_set_location (s
, gimple_location (stmt
));
583 gimple_set_block (s
, gimple_block (stmt
));
584 gimple_set_lhs (stmt
, tmp
);
585 gsi_insert_after (&i
, s
, GSI_SAME_STMT
);
587 start_new_block
= true;
591 first_stmt_of_seq
= false;
596 /* Build a flowgraph for the sequence of stmts SEQ. */
599 make_blocks (gimple_seq seq
)
601 /* Look for debug markers right before labels, and move the debug
602 stmts after the labels. Accepting labels among debug markers
603 adds no value, just complexity; if we wanted to annotate labels
604 with view numbers (so sequencing among markers would matter) or
605 somesuch, we're probably better off still moving the labels, but
606 adding other debug annotations in their original positions or
607 emitting nonbind or bind markers associated with the labels in
608 the original position of the labels.
610 Moving labels would probably be simpler, but we can't do that:
611 moving labels assigns label ids to them, and doing so because of
612 debug markers makes for -fcompare-debug and possibly even codegen
613 differences. So, we have to move the debug stmts instead. To
614 that end, we scan SEQ backwards, marking the position of the
615 latest (earliest we find) label, and moving debug stmts that are
616 not separated from it by nondebug nonlabel stmts after the
618 if (MAY_HAVE_DEBUG_MARKER_STMTS
)
620 gimple_stmt_iterator label
= gsi_none ();
622 for (gimple_stmt_iterator i
= gsi_last (seq
); !gsi_end_p (i
); gsi_prev (&i
))
624 gimple
*stmt
= gsi_stmt (i
);
626 /* If this is the first label we encounter (latest in SEQ)
627 before nondebug stmts, record its position. */
628 if (is_a
<glabel
*> (stmt
))
630 if (gsi_end_p (label
))
635 /* Without a recorded label position to move debug stmts to,
636 there's nothing to do. */
637 if (gsi_end_p (label
))
640 /* Move the debug stmt at I after LABEL. */
641 if (is_gimple_debug (stmt
))
643 gcc_assert (gimple_debug_nonbind_marker_p (stmt
));
644 /* As STMT is removed, I advances to the stmt after
645 STMT, so the gsi_prev in the for "increment"
646 expression gets us to the stmt we're to visit after
647 STMT. LABEL, however, would advance to the moved
648 stmt if we passed it to gsi_move_after, so pass it a
649 copy instead, so as to keep LABEL pointing to the
651 gimple_stmt_iterator copy
= label
;
652 gsi_move_after (&i
, ©
);
656 /* There aren't any (more?) debug stmts before label, so
657 there isn't anything else to move after it. */
662 make_blocks_1 (seq
, ENTRY_BLOCK_PTR_FOR_FN (cfun
));
665 /* Create and return a new empty basic block after bb AFTER. */
668 create_bb (void *h
, void *e
, basic_block after
)
674 /* Create and initialize a new basic block. Since alloc_block uses
675 GC allocation that clears memory to allocate a basic block, we do
676 not have to clear the newly allocated basic block here. */
679 bb
->index
= last_basic_block_for_fn (cfun
);
681 set_bb_seq (bb
, h
? (gimple_seq
) h
: NULL
);
683 /* Add the new block to the linked list of blocks. */
684 link_block (bb
, after
);
686 /* Grow the basic block array if needed. */
687 if ((size_t) last_basic_block_for_fn (cfun
)
688 == basic_block_info_for_fn (cfun
)->length ())
689 vec_safe_grow_cleared (basic_block_info_for_fn (cfun
),
690 last_basic_block_for_fn (cfun
) + 1);
692 /* Add the newly created block to the array. */
693 SET_BASIC_BLOCK_FOR_FN (cfun
, last_basic_block_for_fn (cfun
), bb
);
695 n_basic_blocks_for_fn (cfun
)++;
696 last_basic_block_for_fn (cfun
)++;
702 /*---------------------------------------------------------------------------
704 ---------------------------------------------------------------------------*/
706 /* If basic block BB has an abnormal edge to a basic block
707 containing IFN_ABNORMAL_DISPATCHER internal call, return
708 that the dispatcher's basic block, otherwise return NULL. */
711 get_abnormal_succ_dispatcher (basic_block bb
)
716 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
717 if ((e
->flags
& (EDGE_ABNORMAL
| EDGE_EH
)) == EDGE_ABNORMAL
)
719 gimple_stmt_iterator gsi
720 = gsi_start_nondebug_after_labels_bb (e
->dest
);
721 gimple
*g
= gsi_stmt (gsi
);
722 if (g
&& gimple_call_internal_p (g
, IFN_ABNORMAL_DISPATCHER
))
728 /* Helper function for make_edges. Create a basic block with
729 with ABNORMAL_DISPATCHER internal call in it if needed, and
730 create abnormal edges from BBS to it and from it to FOR_BB
731 if COMPUTED_GOTO is false, otherwise factor the computed gotos. */
734 handle_abnormal_edges (basic_block
*dispatcher_bbs
, basic_block for_bb
,
735 auto_vec
<basic_block
> *bbs
, bool computed_goto
)
737 basic_block
*dispatcher
= dispatcher_bbs
+ (computed_goto
? 1 : 0);
738 unsigned int idx
= 0;
742 if (!bb_to_omp_idx
.is_empty ())
744 dispatcher
= dispatcher_bbs
+ 2 * bb_to_omp_idx
[for_bb
->index
];
745 if (bb_to_omp_idx
[for_bb
->index
] != 0)
749 /* If the dispatcher has been created already, then there are basic
750 blocks with abnormal edges to it, so just make a new edge to
752 if (*dispatcher
== NULL
)
754 /* Check if there are any basic blocks that need to have
755 abnormal edges to this dispatcher. If there are none, return
757 if (bb_to_omp_idx
.is_empty ())
759 if (bbs
->is_empty ())
764 FOR_EACH_VEC_ELT (*bbs
, idx
, bb
)
765 if (bb_to_omp_idx
[bb
->index
] == bb_to_omp_idx
[for_bb
->index
])
771 /* Create the dispatcher bb. */
772 *dispatcher
= create_basic_block (NULL
, for_bb
);
775 /* Factor computed gotos into a common computed goto site. Also
776 record the location of that site so that we can un-factor the
777 gotos after we have converted back to normal form. */
778 gimple_stmt_iterator gsi
= gsi_start_bb (*dispatcher
);
780 /* Create the destination of the factored goto. Each original
781 computed goto will put its desired destination into this
782 variable and jump to the label we create immediately below. */
783 tree var
= create_tmp_var (ptr_type_node
, "gotovar");
785 /* Build a label for the new block which will contain the
786 factored computed goto. */
787 tree factored_label_decl
788 = create_artificial_label (UNKNOWN_LOCATION
);
789 gimple
*factored_computed_goto_label
790 = gimple_build_label (factored_label_decl
);
791 gsi_insert_after (&gsi
, factored_computed_goto_label
, GSI_NEW_STMT
);
793 /* Build our new computed goto. */
794 gimple
*factored_computed_goto
= gimple_build_goto (var
);
795 gsi_insert_after (&gsi
, factored_computed_goto
, GSI_NEW_STMT
);
797 FOR_EACH_VEC_ELT (*bbs
, idx
, bb
)
799 if (!bb_to_omp_idx
.is_empty ()
800 && bb_to_omp_idx
[bb
->index
] != bb_to_omp_idx
[for_bb
->index
])
803 gsi
= gsi_last_bb (bb
);
804 gimple
*last
= gsi_stmt (gsi
);
806 gcc_assert (computed_goto_p (last
));
808 /* Copy the original computed goto's destination into VAR. */
810 = gimple_build_assign (var
, gimple_goto_dest (last
));
811 gsi_insert_before (&gsi
, assignment
, GSI_SAME_STMT
);
813 edge e
= make_edge (bb
, *dispatcher
, EDGE_FALLTHRU
);
814 e
->goto_locus
= gimple_location (last
);
815 gsi_remove (&gsi
, true);
820 tree arg
= inner
? boolean_true_node
: boolean_false_node
;
821 gimple
*g
= gimple_build_call_internal (IFN_ABNORMAL_DISPATCHER
,
823 gimple_stmt_iterator gsi
= gsi_after_labels (*dispatcher
);
824 gsi_insert_after (&gsi
, g
, GSI_NEW_STMT
);
826 /* Create predecessor edges of the dispatcher. */
827 FOR_EACH_VEC_ELT (*bbs
, idx
, bb
)
829 if (!bb_to_omp_idx
.is_empty ()
830 && bb_to_omp_idx
[bb
->index
] != bb_to_omp_idx
[for_bb
->index
])
832 make_edge (bb
, *dispatcher
, EDGE_ABNORMAL
);
837 make_edge (*dispatcher
, for_bb
, EDGE_ABNORMAL
);
840 /* Creates outgoing edges for BB. Returns 1 when it ends with an
841 computed goto, returns 2 when it ends with a statement that
842 might return to this function via an nonlocal goto, otherwise
843 return 0. Updates *PCUR_REGION with the OMP region this BB is in. */
846 make_edges_bb (basic_block bb
, struct omp_region
**pcur_region
, int *pomp_index
)
848 gimple
*last
= last_stmt (bb
);
849 bool fallthru
= false;
855 switch (gimple_code (last
))
858 if (make_goto_expr_edges (bb
))
864 edge e
= make_edge (bb
, EXIT_BLOCK_PTR_FOR_FN (cfun
), 0);
865 e
->goto_locus
= gimple_location (last
);
870 make_cond_expr_edges (bb
);
874 make_gimple_switch_edges (as_a
<gswitch
*> (last
), bb
);
878 make_eh_edges (last
);
881 case GIMPLE_EH_DISPATCH
:
882 fallthru
= make_eh_dispatch_edges (as_a
<geh_dispatch
*> (last
));
886 /* If this function receives a nonlocal goto, then we need to
887 make edges from this call site to all the nonlocal goto
889 if (stmt_can_make_abnormal_goto (last
))
892 /* If this statement has reachable exception handlers, then
893 create abnormal edges to them. */
894 make_eh_edges (last
);
896 /* BUILTIN_RETURN is really a return statement. */
897 if (gimple_call_builtin_p (last
, BUILT_IN_RETURN
))
899 make_edge (bb
, EXIT_BLOCK_PTR_FOR_FN (cfun
), 0);
902 /* Some calls are known not to return. */
904 fallthru
= !gimple_call_noreturn_p (last
);
908 /* A GIMPLE_ASSIGN may throw internally and thus be considered
910 if (is_ctrl_altering_stmt (last
))
911 make_eh_edges (last
);
916 make_gimple_asm_edges (bb
);
921 fallthru
= omp_make_gimple_edges (bb
, pcur_region
, pomp_index
);
924 case GIMPLE_TRANSACTION
:
926 gtransaction
*txn
= as_a
<gtransaction
*> (last
);
927 tree label1
= gimple_transaction_label_norm (txn
);
928 tree label2
= gimple_transaction_label_uninst (txn
);
931 make_edge (bb
, label_to_block (cfun
, label1
), EDGE_FALLTHRU
);
933 make_edge (bb
, label_to_block (cfun
, label2
),
934 EDGE_TM_UNINSTRUMENTED
| (label1
? 0 : EDGE_FALLTHRU
));
936 tree label3
= gimple_transaction_label_over (txn
);
937 if (gimple_transaction_subcode (txn
)
938 & (GTMA_HAVE_ABORT
| GTMA_IS_OUTER
))
939 make_edge (bb
, label_to_block (cfun
, label3
), EDGE_TM_ABORT
);
946 gcc_assert (!stmt_ends_bb_p (last
));
952 make_edge (bb
, bb
->next_bb
, EDGE_FALLTHRU
);
957 /* Join all the blocks in the flowgraph. */
963 struct omp_region
*cur_region
= NULL
;
964 auto_vec
<basic_block
> ab_edge_goto
;
965 auto_vec
<basic_block
> ab_edge_call
;
966 int cur_omp_region_idx
= 0;
968 /* Create an edge from entry to the first block with executable
970 make_edge (ENTRY_BLOCK_PTR_FOR_FN (cfun
),
971 BASIC_BLOCK_FOR_FN (cfun
, NUM_FIXED_BLOCKS
),
974 /* Traverse the basic block array placing edges. */
975 FOR_EACH_BB_FN (bb
, cfun
)
979 if (!bb_to_omp_idx
.is_empty ())
980 bb_to_omp_idx
[bb
->index
] = cur_omp_region_idx
;
982 mer
= make_edges_bb (bb
, &cur_region
, &cur_omp_region_idx
);
984 ab_edge_goto
.safe_push (bb
);
986 ab_edge_call
.safe_push (bb
);
988 if (cur_region
&& bb_to_omp_idx
.is_empty ())
989 bb_to_omp_idx
.safe_grow_cleared (n_basic_blocks_for_fn (cfun
), true);
992 /* Computed gotos are hell to deal with, especially if there are
993 lots of them with a large number of destinations. So we factor
994 them to a common computed goto location before we build the
995 edge list. After we convert back to normal form, we will un-factor
996 the computed gotos since factoring introduces an unwanted jump.
997 For non-local gotos and abnormal edges from calls to calls that return
998 twice or forced labels, factor the abnormal edges too, by having all
999 abnormal edges from the calls go to a common artificial basic block
1000 with ABNORMAL_DISPATCHER internal call and abnormal edges from that
1001 basic block to all forced labels and calls returning twice.
1002 We do this per-OpenMP structured block, because those regions
1003 are guaranteed to be single entry single exit by the standard,
1004 so it is not allowed to enter or exit such regions abnormally this way,
1005 thus all computed gotos, non-local gotos and setjmp/longjmp calls
1006 must not transfer control across SESE region boundaries. */
1007 if (!ab_edge_goto
.is_empty () || !ab_edge_call
.is_empty ())
1009 gimple_stmt_iterator gsi
;
1010 basic_block dispatcher_bb_array
[2] = { NULL
, NULL
};
1011 basic_block
*dispatcher_bbs
= dispatcher_bb_array
;
1012 int count
= n_basic_blocks_for_fn (cfun
);
1014 if (!bb_to_omp_idx
.is_empty ())
1015 dispatcher_bbs
= XCNEWVEC (basic_block
, 2 * count
);
1017 FOR_EACH_BB_FN (bb
, cfun
)
1019 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
1021 glabel
*label_stmt
= dyn_cast
<glabel
*> (gsi_stmt (gsi
));
1027 target
= gimple_label_label (label_stmt
);
1029 /* Make an edge to every label block that has been marked as a
1030 potential target for a computed goto or a non-local goto. */
1031 if (FORCED_LABEL (target
))
1032 handle_abnormal_edges (dispatcher_bbs
, bb
, &ab_edge_goto
,
1034 if (DECL_NONLOCAL (target
))
1036 handle_abnormal_edges (dispatcher_bbs
, bb
, &ab_edge_call
,
1042 if (!gsi_end_p (gsi
) && is_gimple_debug (gsi_stmt (gsi
)))
1043 gsi_next_nondebug (&gsi
);
1044 if (!gsi_end_p (gsi
))
1046 /* Make an edge to every setjmp-like call. */
1047 gimple
*call_stmt
= gsi_stmt (gsi
);
1048 if (is_gimple_call (call_stmt
)
1049 && ((gimple_call_flags (call_stmt
) & ECF_RETURNS_TWICE
)
1050 || gimple_call_builtin_p (call_stmt
,
1051 BUILT_IN_SETJMP_RECEIVER
)))
1052 handle_abnormal_edges (dispatcher_bbs
, bb
, &ab_edge_call
,
1057 if (!bb_to_omp_idx
.is_empty ())
1058 XDELETE (dispatcher_bbs
);
1061 omp_free_regions ();
1064 /* Add SEQ after GSI. Start new bb after GSI, and created further bbs as
1065 needed. Returns true if new bbs were created.
1066 Note: This is transitional code, and should not be used for new code. We
1067 should be able to get rid of this by rewriting all target va-arg
1068 gimplification hooks to use an interface gimple_build_cond_value as described
1069 in https://gcc.gnu.org/ml/gcc-patches/2015-02/msg01194.html. */
1072 gimple_find_sub_bbs (gimple_seq seq
, gimple_stmt_iterator
*gsi
)
1074 gimple
*stmt
= gsi_stmt (*gsi
);
1075 basic_block bb
= gimple_bb (stmt
);
1076 basic_block lastbb
, afterbb
;
1077 int old_num_bbs
= n_basic_blocks_for_fn (cfun
);
1079 lastbb
= make_blocks_1 (seq
, bb
);
1080 if (old_num_bbs
== n_basic_blocks_for_fn (cfun
))
1082 e
= split_block (bb
, stmt
);
1083 /* Move e->dest to come after the new basic blocks. */
1085 unlink_block (afterbb
);
1086 link_block (afterbb
, lastbb
);
1087 redirect_edge_succ (e
, bb
->next_bb
);
1089 while (bb
!= afterbb
)
1091 struct omp_region
*cur_region
= NULL
;
1092 profile_count cnt
= profile_count::zero ();
1095 int cur_omp_region_idx
= 0;
1096 int mer
= make_edges_bb (bb
, &cur_region
, &cur_omp_region_idx
);
1097 gcc_assert (!mer
&& !cur_region
);
1098 add_bb_to_loop (bb
, afterbb
->loop_father
);
1102 FOR_EACH_EDGE (e
, ei
, bb
->preds
)
1104 if (e
->count ().initialized_p ())
1109 tree_guess_outgoing_edge_probabilities (bb
);
1110 if (all
|| profile_status_for_fn (cfun
) == PROFILE_READ
)
1118 /* Find the next available discriminator value for LOCUS. The
1119 discriminator distinguishes among several basic blocks that
1120 share a common locus, allowing for more accurate sample-based
1124 next_discriminator_for_locus (int line
)
1126 struct locus_discrim_map item
;
1127 struct locus_discrim_map
**slot
;
1129 item
.location_line
= line
;
1130 item
.discriminator
= 0;
1131 slot
= discriminator_per_locus
->find_slot_with_hash (&item
, line
, INSERT
);
1133 if (*slot
== HTAB_EMPTY_ENTRY
)
1135 *slot
= XNEW (struct locus_discrim_map
);
1137 (*slot
)->location_line
= line
;
1138 (*slot
)->discriminator
= 0;
1140 (*slot
)->discriminator
++;
1141 return (*slot
)->discriminator
;
1144 /* Return TRUE if LOCUS1 and LOCUS2 refer to the same source line. */
1147 same_line_p (location_t locus1
, expanded_location
*from
, location_t locus2
)
1149 expanded_location to
;
1151 if (locus1
== locus2
)
1154 to
= expand_location (locus2
);
1156 if (from
->line
!= to
.line
)
1158 if (from
->file
== to
.file
)
1160 return (from
->file
!= NULL
1162 && filename_cmp (from
->file
, to
.file
) == 0);
1165 /* Assign discriminators to each basic block. */
1168 assign_discriminators (void)
1172 FOR_EACH_BB_FN (bb
, cfun
)
1176 gimple
*last
= last_stmt (bb
);
1177 location_t locus
= last
? gimple_location (last
) : UNKNOWN_LOCATION
;
1179 if (locus
== UNKNOWN_LOCATION
)
1182 expanded_location locus_e
= expand_location (locus
);
1184 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
1186 gimple
*first
= first_non_label_stmt (e
->dest
);
1187 gimple
*last
= last_stmt (e
->dest
);
1188 if ((first
&& same_line_p (locus
, &locus_e
,
1189 gimple_location (first
)))
1190 || (last
&& same_line_p (locus
, &locus_e
,
1191 gimple_location (last
))))
1193 if (e
->dest
->discriminator
!= 0 && bb
->discriminator
== 0)
1195 = next_discriminator_for_locus (locus_e
.line
);
1197 e
->dest
->discriminator
1198 = next_discriminator_for_locus (locus_e
.line
);
1204 /* Create the edges for a GIMPLE_COND starting at block BB. */
1207 make_cond_expr_edges (basic_block bb
)
1209 gcond
*entry
= as_a
<gcond
*> (last_stmt (bb
));
1210 gimple
*then_stmt
, *else_stmt
;
1211 basic_block then_bb
, else_bb
;
1212 tree then_label
, else_label
;
1216 gcc_assert (gimple_code (entry
) == GIMPLE_COND
);
1218 /* Entry basic blocks for each component. */
1219 then_label
= gimple_cond_true_label (entry
);
1220 else_label
= gimple_cond_false_label (entry
);
1221 then_bb
= label_to_block (cfun
, then_label
);
1222 else_bb
= label_to_block (cfun
, else_label
);
1223 then_stmt
= first_stmt (then_bb
);
1224 else_stmt
= first_stmt (else_bb
);
1226 e
= make_edge (bb
, then_bb
, EDGE_TRUE_VALUE
);
1227 e
->goto_locus
= gimple_location (then_stmt
);
1228 e
= make_edge (bb
, else_bb
, EDGE_FALSE_VALUE
);
1230 e
->goto_locus
= gimple_location (else_stmt
);
1232 /* We do not need the labels anymore. */
1233 gimple_cond_set_true_label (entry
, NULL_TREE
);
1234 gimple_cond_set_false_label (entry
, NULL_TREE
);
1238 /* Called for each element in the hash table (P) as we delete the
1239 edge to cases hash table.
1241 Clear all the CASE_CHAINs to prevent problems with copying of
1242 SWITCH_EXPRs and structure sharing rules, then free the hash table
1246 edge_to_cases_cleanup (edge
const &, tree
const &value
, void *)
1250 for (t
= value
; t
; t
= next
)
1252 next
= CASE_CHAIN (t
);
1253 CASE_CHAIN (t
) = NULL
;
1259 /* Start recording information mapping edges to case labels. */
1262 start_recording_case_labels (void)
1264 gcc_assert (edge_to_cases
== NULL
);
1265 edge_to_cases
= new hash_map
<edge
, tree
>;
1266 touched_switch_bbs
= BITMAP_ALLOC (NULL
);
1269 /* Return nonzero if we are recording information for case labels. */
1272 recording_case_labels_p (void)
1274 return (edge_to_cases
!= NULL
);
1277 /* Stop recording information mapping edges to case labels and
1278 remove any information we have recorded. */
1280 end_recording_case_labels (void)
1284 edge_to_cases
->traverse
<void *, edge_to_cases_cleanup
> (NULL
);
1285 delete edge_to_cases
;
1286 edge_to_cases
= NULL
;
1287 EXECUTE_IF_SET_IN_BITMAP (touched_switch_bbs
, 0, i
, bi
)
1289 basic_block bb
= BASIC_BLOCK_FOR_FN (cfun
, i
);
1292 gimple
*stmt
= last_stmt (bb
);
1293 if (stmt
&& gimple_code (stmt
) == GIMPLE_SWITCH
)
1294 group_case_labels_stmt (as_a
<gswitch
*> (stmt
));
1297 BITMAP_FREE (touched_switch_bbs
);
1300 /* If we are inside a {start,end}_recording_cases block, then return
1301 a chain of CASE_LABEL_EXPRs from T which reference E.
1303 Otherwise return NULL. */
1306 get_cases_for_edge (edge e
, gswitch
*t
)
1311 /* If we are not recording cases, then we do not have CASE_LABEL_EXPR
1312 chains available. Return NULL so the caller can detect this case. */
1313 if (!recording_case_labels_p ())
1316 slot
= edge_to_cases
->get (e
);
1320 /* If we did not find E in the hash table, then this must be the first
1321 time we have been queried for information about E & T. Add all the
1322 elements from T to the hash table then perform the query again. */
1324 n
= gimple_switch_num_labels (t
);
1325 for (i
= 0; i
< n
; i
++)
1327 tree elt
= gimple_switch_label (t
, i
);
1328 tree lab
= CASE_LABEL (elt
);
1329 basic_block label_bb
= label_to_block (cfun
, lab
);
1330 edge this_edge
= find_edge (e
->src
, label_bb
);
1332 /* Add it to the chain of CASE_LABEL_EXPRs referencing E, or create
1334 tree
&s
= edge_to_cases
->get_or_insert (this_edge
);
1335 CASE_CHAIN (elt
) = s
;
1339 return *edge_to_cases
->get (e
);
1342 /* Create the edges for a GIMPLE_SWITCH starting at block BB. */
1345 make_gimple_switch_edges (gswitch
*entry
, basic_block bb
)
1349 n
= gimple_switch_num_labels (entry
);
1351 for (i
= 0; i
< n
; ++i
)
1353 basic_block label_bb
= gimple_switch_label_bb (cfun
, entry
, i
);
1354 make_edge (bb
, label_bb
, 0);
1359 /* Return the basic block holding label DEST. */
1362 label_to_block (struct function
*ifun
, tree dest
)
1364 int uid
= LABEL_DECL_UID (dest
);
1366 /* We would die hard when faced by an undefined label. Emit a label to
1367 the very first basic block. This will hopefully make even the dataflow
1368 and undefined variable warnings quite right. */
1369 if (seen_error () && uid
< 0)
1371 gimple_stmt_iterator gsi
=
1372 gsi_start_bb (BASIC_BLOCK_FOR_FN (cfun
, NUM_FIXED_BLOCKS
));
1375 stmt
= gimple_build_label (dest
);
1376 gsi_insert_before (&gsi
, stmt
, GSI_NEW_STMT
);
1377 uid
= LABEL_DECL_UID (dest
);
1379 if (vec_safe_length (ifun
->cfg
->x_label_to_block_map
) <= (unsigned int) uid
)
1381 return (*ifun
->cfg
->x_label_to_block_map
)[uid
];
1384 /* Create edges for a goto statement at block BB. Returns true
1385 if abnormal edges should be created. */
1388 make_goto_expr_edges (basic_block bb
)
1390 gimple_stmt_iterator last
= gsi_last_bb (bb
);
1391 gimple
*goto_t
= gsi_stmt (last
);
1393 /* A simple GOTO creates normal edges. */
1394 if (simple_goto_p (goto_t
))
1396 tree dest
= gimple_goto_dest (goto_t
);
1397 basic_block label_bb
= label_to_block (cfun
, dest
);
1398 edge e
= make_edge (bb
, label_bb
, EDGE_FALLTHRU
);
1399 e
->goto_locus
= gimple_location (goto_t
);
1400 gsi_remove (&last
, true);
1404 /* A computed GOTO creates abnormal edges. */
1408 /* Create edges for an asm statement with labels at block BB. */
1411 make_gimple_asm_edges (basic_block bb
)
1413 gasm
*stmt
= as_a
<gasm
*> (last_stmt (bb
));
1414 int i
, n
= gimple_asm_nlabels (stmt
);
1416 for (i
= 0; i
< n
; ++i
)
1418 tree label
= TREE_VALUE (gimple_asm_label_op (stmt
, i
));
1419 basic_block label_bb
= label_to_block (cfun
, label
);
1420 make_edge (bb
, label_bb
, 0);
1424 /*---------------------------------------------------------------------------
1426 ---------------------------------------------------------------------------*/
1428 /* Cleanup useless labels in basic blocks. This is something we wish
1429 to do early because it allows us to group case labels before creating
1430 the edges for the CFG, and it speeds up block statement iterators in
1431 all passes later on.
1432 We rerun this pass after CFG is created, to get rid of the labels that
1433 are no longer referenced. After then we do not run it any more, since
1434 (almost) no new labels should be created. */
1436 /* A map from basic block index to the leading label of that block. */
1442 /* True if the label is referenced from somewhere. */
1446 /* Given LABEL return the first label in the same basic block. */
1449 main_block_label (tree label
, label_record
*label_for_bb
)
1451 basic_block bb
= label_to_block (cfun
, label
);
1452 tree main_label
= label_for_bb
[bb
->index
].label
;
1454 /* label_to_block possibly inserted undefined label into the chain. */
1457 label_for_bb
[bb
->index
].label
= label
;
1461 label_for_bb
[bb
->index
].used
= true;
1465 /* Clean up redundant labels within the exception tree. */
1468 cleanup_dead_labels_eh (label_record
*label_for_bb
)
1475 if (cfun
->eh
== NULL
)
1478 for (i
= 1; vec_safe_iterate (cfun
->eh
->lp_array
, i
, &lp
); ++i
)
1479 if (lp
&& lp
->post_landing_pad
)
1481 lab
= main_block_label (lp
->post_landing_pad
, label_for_bb
);
1482 if (lab
!= lp
->post_landing_pad
)
1484 EH_LANDING_PAD_NR (lp
->post_landing_pad
) = 0;
1485 lp
->post_landing_pad
= lab
;
1486 EH_LANDING_PAD_NR (lab
) = lp
->index
;
1490 FOR_ALL_EH_REGION (r
)
1494 case ERT_MUST_NOT_THROW
:
1500 for (c
= r
->u
.eh_try
.first_catch
; c
; c
= c
->next_catch
)
1504 c
->label
= main_block_label (lab
, label_for_bb
);
1509 case ERT_ALLOWED_EXCEPTIONS
:
1510 lab
= r
->u
.allowed
.label
;
1512 r
->u
.allowed
.label
= main_block_label (lab
, label_for_bb
);
1518 /* Cleanup redundant labels. This is a three-step process:
1519 1) Find the leading label for each block.
1520 2) Redirect all references to labels to the leading labels.
1521 3) Cleanup all useless labels. */
1524 cleanup_dead_labels (void)
1527 label_record
*label_for_bb
= XCNEWVEC (struct label_record
,
1528 last_basic_block_for_fn (cfun
));
1530 /* Find a suitable label for each block. We use the first user-defined
1531 label if there is one, or otherwise just the first label we see. */
1532 FOR_EACH_BB_FN (bb
, cfun
)
1534 gimple_stmt_iterator i
;
1536 for (i
= gsi_start_bb (bb
); !gsi_end_p (i
); gsi_next (&i
))
1539 glabel
*label_stmt
= dyn_cast
<glabel
*> (gsi_stmt (i
));
1544 label
= gimple_label_label (label_stmt
);
1546 /* If we have not yet seen a label for the current block,
1547 remember this one and see if there are more labels. */
1548 if (!label_for_bb
[bb
->index
].label
)
1550 label_for_bb
[bb
->index
].label
= label
;
1554 /* If we did see a label for the current block already, but it
1555 is an artificially created label, replace it if the current
1556 label is a user defined label. */
1557 if (!DECL_ARTIFICIAL (label
)
1558 && DECL_ARTIFICIAL (label_for_bb
[bb
->index
].label
))
1560 label_for_bb
[bb
->index
].label
= label
;
1566 /* Now redirect all jumps/branches to the selected label.
1567 First do so for each block ending in a control statement. */
1568 FOR_EACH_BB_FN (bb
, cfun
)
1570 gimple
*stmt
= last_stmt (bb
);
1571 tree label
, new_label
;
1576 switch (gimple_code (stmt
))
1580 gcond
*cond_stmt
= as_a
<gcond
*> (stmt
);
1581 label
= gimple_cond_true_label (cond_stmt
);
1584 new_label
= main_block_label (label
, label_for_bb
);
1585 if (new_label
!= label
)
1586 gimple_cond_set_true_label (cond_stmt
, new_label
);
1589 label
= gimple_cond_false_label (cond_stmt
);
1592 new_label
= main_block_label (label
, label_for_bb
);
1593 if (new_label
!= label
)
1594 gimple_cond_set_false_label (cond_stmt
, new_label
);
1601 gswitch
*switch_stmt
= as_a
<gswitch
*> (stmt
);
1602 size_t i
, n
= gimple_switch_num_labels (switch_stmt
);
1604 /* Replace all destination labels. */
1605 for (i
= 0; i
< n
; ++i
)
1607 tree case_label
= gimple_switch_label (switch_stmt
, i
);
1608 label
= CASE_LABEL (case_label
);
1609 new_label
= main_block_label (label
, label_for_bb
);
1610 if (new_label
!= label
)
1611 CASE_LABEL (case_label
) = new_label
;
1618 gasm
*asm_stmt
= as_a
<gasm
*> (stmt
);
1619 int i
, n
= gimple_asm_nlabels (asm_stmt
);
1621 for (i
= 0; i
< n
; ++i
)
1623 tree cons
= gimple_asm_label_op (asm_stmt
, i
);
1624 tree label
= main_block_label (TREE_VALUE (cons
), label_for_bb
);
1625 TREE_VALUE (cons
) = label
;
1630 /* We have to handle gotos until they're removed, and we don't
1631 remove them until after we've created the CFG edges. */
1633 if (!computed_goto_p (stmt
))
1635 ggoto
*goto_stmt
= as_a
<ggoto
*> (stmt
);
1636 label
= gimple_goto_dest (goto_stmt
);
1637 new_label
= main_block_label (label
, label_for_bb
);
1638 if (new_label
!= label
)
1639 gimple_goto_set_dest (goto_stmt
, new_label
);
1643 case GIMPLE_TRANSACTION
:
1645 gtransaction
*txn
= as_a
<gtransaction
*> (stmt
);
1647 label
= gimple_transaction_label_norm (txn
);
1650 new_label
= main_block_label (label
, label_for_bb
);
1651 if (new_label
!= label
)
1652 gimple_transaction_set_label_norm (txn
, new_label
);
1655 label
= gimple_transaction_label_uninst (txn
);
1658 new_label
= main_block_label (label
, label_for_bb
);
1659 if (new_label
!= label
)
1660 gimple_transaction_set_label_uninst (txn
, new_label
);
1663 label
= gimple_transaction_label_over (txn
);
1666 new_label
= main_block_label (label
, label_for_bb
);
1667 if (new_label
!= label
)
1668 gimple_transaction_set_label_over (txn
, new_label
);
1678 /* Do the same for the exception region tree labels. */
1679 cleanup_dead_labels_eh (label_for_bb
);
1681 /* Finally, purge dead labels. All user-defined labels and labels that
1682 can be the target of non-local gotos and labels which have their
1683 address taken are preserved. */
1684 FOR_EACH_BB_FN (bb
, cfun
)
1686 gimple_stmt_iterator i
;
1687 tree label_for_this_bb
= label_for_bb
[bb
->index
].label
;
1689 if (!label_for_this_bb
)
1692 /* If the main label of the block is unused, we may still remove it. */
1693 if (!label_for_bb
[bb
->index
].used
)
1694 label_for_this_bb
= NULL
;
1696 for (i
= gsi_start_bb (bb
); !gsi_end_p (i
); )
1699 glabel
*label_stmt
= dyn_cast
<glabel
*> (gsi_stmt (i
));
1704 label
= gimple_label_label (label_stmt
);
1706 if (label
== label_for_this_bb
1707 || !DECL_ARTIFICIAL (label
)
1708 || DECL_NONLOCAL (label
)
1709 || FORCED_LABEL (label
))
1713 gcc_checking_assert (EH_LANDING_PAD_NR (label
) == 0);
1714 gsi_remove (&i
, true);
1719 free (label_for_bb
);
1722 /* Scan the sorted vector of cases in STMT (a GIMPLE_SWITCH) and combine
1723 the ones jumping to the same label.
1724 Eg. three separate entries 1: 2: 3: become one entry 1..3: */
1727 group_case_labels_stmt (gswitch
*stmt
)
1729 int old_size
= gimple_switch_num_labels (stmt
);
1730 int i
, next_index
, new_size
;
1731 basic_block default_bb
= NULL
;
1732 hash_set
<tree
> *removed_labels
= NULL
;
1734 default_bb
= gimple_switch_default_bb (cfun
, stmt
);
1736 /* Look for possible opportunities to merge cases. */
1738 while (i
< old_size
)
1740 tree base_case
, base_high
;
1741 basic_block base_bb
;
1743 base_case
= gimple_switch_label (stmt
, i
);
1745 gcc_assert (base_case
);
1746 base_bb
= label_to_block (cfun
, CASE_LABEL (base_case
));
1748 /* Discard cases that have the same destination as the default case or
1749 whose destination blocks have already been removed as unreachable. */
1751 || base_bb
== default_bb
1753 && removed_labels
->contains (CASE_LABEL (base_case
))))
1759 base_high
= CASE_HIGH (base_case
)
1760 ? CASE_HIGH (base_case
)
1761 : CASE_LOW (base_case
);
1764 /* Try to merge case labels. Break out when we reach the end
1765 of the label vector or when we cannot merge the next case
1766 label with the current one. */
1767 while (next_index
< old_size
)
1769 tree merge_case
= gimple_switch_label (stmt
, next_index
);
1770 basic_block merge_bb
= label_to_block (cfun
, CASE_LABEL (merge_case
));
1771 wide_int bhp1
= wi::to_wide (base_high
) + 1;
1773 /* Merge the cases if they jump to the same place,
1774 and their ranges are consecutive. */
1775 if (merge_bb
== base_bb
1776 && (removed_labels
== NULL
1777 || !removed_labels
->contains (CASE_LABEL (merge_case
)))
1778 && wi::to_wide (CASE_LOW (merge_case
)) == bhp1
)
1781 = (CASE_HIGH (merge_case
)
1782 ? CASE_HIGH (merge_case
) : CASE_LOW (merge_case
));
1783 CASE_HIGH (base_case
) = base_high
;
1790 /* Discard cases that have an unreachable destination block. */
1791 if (EDGE_COUNT (base_bb
->succs
) == 0
1792 && gimple_seq_unreachable_p (bb_seq (base_bb
))
1793 /* Don't optimize this if __builtin_unreachable () is the
1794 implicitly added one by the C++ FE too early, before
1795 -Wreturn-type can be diagnosed. We'll optimize it later
1796 during switchconv pass or any other cfg cleanup. */
1797 && (gimple_in_ssa_p (cfun
)
1798 || (LOCATION_LOCUS (gimple_location (last_stmt (base_bb
)))
1799 != BUILTINS_LOCATION
)))
1801 edge base_edge
= find_edge (gimple_bb (stmt
), base_bb
);
1802 if (base_edge
!= NULL
)
1804 for (gimple_stmt_iterator gsi
= gsi_start_bb (base_bb
);
1805 !gsi_end_p (gsi
); gsi_next (&gsi
))
1806 if (glabel
*stmt
= dyn_cast
<glabel
*> (gsi_stmt (gsi
)))
1808 if (FORCED_LABEL (gimple_label_label (stmt
))
1809 || DECL_NONLOCAL (gimple_label_label (stmt
)))
1811 /* Forced/non-local labels aren't going to be removed,
1812 but they will be moved to some neighbouring basic
1813 block. If some later case label refers to one of
1814 those labels, we should throw that case away rather
1815 than keeping it around and refering to some random
1816 other basic block without an edge to it. */
1817 if (removed_labels
== NULL
)
1818 removed_labels
= new hash_set
<tree
>;
1819 removed_labels
->add (gimple_label_label (stmt
));
1824 remove_edge_and_dominated_blocks (base_edge
);
1831 gimple_switch_set_label (stmt
, new_size
,
1832 gimple_switch_label (stmt
, i
));
1837 gcc_assert (new_size
<= old_size
);
1839 if (new_size
< old_size
)
1840 gimple_switch_set_num_labels (stmt
, new_size
);
1842 delete removed_labels
;
1843 return new_size
< old_size
;
1846 /* Look for blocks ending in a multiway branch (a GIMPLE_SWITCH),
1847 and scan the sorted vector of cases. Combine the ones jumping to the
1851 group_case_labels (void)
1854 bool changed
= false;
1856 FOR_EACH_BB_FN (bb
, cfun
)
1858 gimple
*stmt
= last_stmt (bb
);
1859 if (stmt
&& gimple_code (stmt
) == GIMPLE_SWITCH
)
1860 changed
|= group_case_labels_stmt (as_a
<gswitch
*> (stmt
));
1866 /* Checks whether we can merge block B into block A. */
1869 gimple_can_merge_blocks_p (basic_block a
, basic_block b
)
1873 if (!single_succ_p (a
))
1876 if (single_succ_edge (a
)->flags
& EDGE_COMPLEX
)
1879 if (single_succ (a
) != b
)
1882 if (!single_pred_p (b
))
1885 if (a
== ENTRY_BLOCK_PTR_FOR_FN (cfun
)
1886 || b
== EXIT_BLOCK_PTR_FOR_FN (cfun
))
1889 /* If A ends by a statement causing exceptions or something similar, we
1890 cannot merge the blocks. */
1891 stmt
= last_stmt (a
);
1892 if (stmt
&& stmt_ends_bb_p (stmt
))
1895 /* Do not allow a block with only a non-local label to be merged. */
1897 if (glabel
*label_stmt
= dyn_cast
<glabel
*> (stmt
))
1898 if (DECL_NONLOCAL (gimple_label_label (label_stmt
)))
1901 /* Examine the labels at the beginning of B. */
1902 for (gimple_stmt_iterator gsi
= gsi_start_bb (b
); !gsi_end_p (gsi
);
1906 glabel
*label_stmt
= dyn_cast
<glabel
*> (gsi_stmt (gsi
));
1909 lab
= gimple_label_label (label_stmt
);
1911 /* Do not remove user forced labels or for -O0 any user labels. */
1912 if (!DECL_ARTIFICIAL (lab
) && (!optimize
|| FORCED_LABEL (lab
)))
1916 /* Protect simple loop latches. We only want to avoid merging
1917 the latch with the loop header or with a block in another
1918 loop in this case. */
1920 && b
->loop_father
->latch
== b
1921 && loops_state_satisfies_p (LOOPS_HAVE_SIMPLE_LATCHES
)
1922 && (b
->loop_father
->header
== a
1923 || b
->loop_father
!= a
->loop_father
))
1926 /* It must be possible to eliminate all phi nodes in B. If ssa form
1927 is not up-to-date and a name-mapping is registered, we cannot eliminate
1928 any phis. Symbols marked for renaming are never a problem though. */
1929 for (gphi_iterator gsi
= gsi_start_phis (b
); !gsi_end_p (gsi
);
1932 gphi
*phi
= gsi
.phi ();
1933 /* Technically only new names matter. */
1934 if (name_registered_for_update_p (PHI_RESULT (phi
)))
1938 /* When not optimizing, don't merge if we'd lose goto_locus. */
1940 && single_succ_edge (a
)->goto_locus
!= UNKNOWN_LOCATION
)
1942 location_t goto_locus
= single_succ_edge (a
)->goto_locus
;
1943 gimple_stmt_iterator prev
, next
;
1944 prev
= gsi_last_nondebug_bb (a
);
1945 next
= gsi_after_labels (b
);
1946 if (!gsi_end_p (next
) && is_gimple_debug (gsi_stmt (next
)))
1947 gsi_next_nondebug (&next
);
1948 if ((gsi_end_p (prev
)
1949 || gimple_location (gsi_stmt (prev
)) != goto_locus
)
1950 && (gsi_end_p (next
)
1951 || gimple_location (gsi_stmt (next
)) != goto_locus
))
1958 /* Replaces all uses of NAME by VAL. */
1961 replace_uses_by (tree name
, tree val
)
1963 imm_use_iterator imm_iter
;
1968 FOR_EACH_IMM_USE_STMT (stmt
, imm_iter
, name
)
1970 /* Mark the block if we change the last stmt in it. */
1971 if (cfgcleanup_altered_bbs
1972 && stmt_ends_bb_p (stmt
))
1973 bitmap_set_bit (cfgcleanup_altered_bbs
, gimple_bb (stmt
)->index
);
1975 FOR_EACH_IMM_USE_ON_STMT (use
, imm_iter
)
1977 replace_exp (use
, val
);
1979 if (gimple_code (stmt
) == GIMPLE_PHI
)
1981 e
= gimple_phi_arg_edge (as_a
<gphi
*> (stmt
),
1982 PHI_ARG_INDEX_FROM_USE (use
));
1983 if (e
->flags
& EDGE_ABNORMAL
1984 && !SSA_NAME_OCCURS_IN_ABNORMAL_PHI (val
))
1986 /* This can only occur for virtual operands, since
1987 for the real ones SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name))
1988 would prevent replacement. */
1989 gcc_checking_assert (virtual_operand_p (name
));
1990 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (val
) = 1;
1995 if (gimple_code (stmt
) != GIMPLE_PHI
)
1997 gimple_stmt_iterator gsi
= gsi_for_stmt (stmt
);
1998 gimple
*orig_stmt
= stmt
;
2001 /* FIXME. It shouldn't be required to keep TREE_CONSTANT
2002 on ADDR_EXPRs up-to-date on GIMPLE. Propagation will
2003 only change sth from non-invariant to invariant, and only
2004 when propagating constants. */
2005 if (is_gimple_min_invariant (val
))
2006 for (i
= 0; i
< gimple_num_ops (stmt
); i
++)
2008 tree op
= gimple_op (stmt
, i
);
2009 /* Operands may be empty here. For example, the labels
2010 of a GIMPLE_COND are nulled out following the creation
2011 of the corresponding CFG edges. */
2012 if (op
&& TREE_CODE (op
) == ADDR_EXPR
)
2013 recompute_tree_invariant_for_addr_expr (op
);
2016 if (fold_stmt (&gsi
))
2017 stmt
= gsi_stmt (gsi
);
2019 if (maybe_clean_or_replace_eh_stmt (orig_stmt
, stmt
))
2020 gimple_purge_dead_eh_edges (gimple_bb (stmt
));
2026 gcc_checking_assert (has_zero_uses (name
));
2028 /* Also update the trees stored in loop structures. */
2031 for (auto loop
: loops_list (cfun
, 0))
2032 substitute_in_loop_info (loop
, name
, val
);
2036 /* Merge block B into block A. */
2039 gimple_merge_blocks (basic_block a
, basic_block b
)
2041 gimple_stmt_iterator last
, gsi
;
2045 fprintf (dump_file
, "Merging blocks %d and %d\n", a
->index
, b
->index
);
2047 /* Remove all single-valued PHI nodes from block B of the form
2048 V_i = PHI <V_j> by propagating V_j to all the uses of V_i. */
2049 gsi
= gsi_last_bb (a
);
2050 for (psi
= gsi_start_phis (b
); !gsi_end_p (psi
); )
2052 gimple
*phi
= gsi_stmt (psi
);
2053 tree def
= gimple_phi_result (phi
), use
= gimple_phi_arg_def (phi
, 0);
2055 bool may_replace_uses
= (virtual_operand_p (def
)
2056 || may_propagate_copy (def
, use
));
2058 /* In case we maintain loop closed ssa form, do not propagate arguments
2059 of loop exit phi nodes. */
2061 && loops_state_satisfies_p (LOOP_CLOSED_SSA
)
2062 && !virtual_operand_p (def
)
2063 && TREE_CODE (use
) == SSA_NAME
2064 && a
->loop_father
!= b
->loop_father
)
2065 may_replace_uses
= false;
2067 if (!may_replace_uses
)
2069 gcc_assert (!virtual_operand_p (def
));
2071 /* Note that just emitting the copies is fine -- there is no problem
2072 with ordering of phi nodes. This is because A is the single
2073 predecessor of B, therefore results of the phi nodes cannot
2074 appear as arguments of the phi nodes. */
2075 copy
= gimple_build_assign (def
, use
);
2076 gsi_insert_after (&gsi
, copy
, GSI_NEW_STMT
);
2077 remove_phi_node (&psi
, false);
2081 /* If we deal with a PHI for virtual operands, we can simply
2082 propagate these without fussing with folding or updating
2084 if (virtual_operand_p (def
))
2086 imm_use_iterator iter
;
2087 use_operand_p use_p
;
2090 FOR_EACH_IMM_USE_STMT (stmt
, iter
, def
)
2091 FOR_EACH_IMM_USE_ON_STMT (use_p
, iter
)
2092 SET_USE (use_p
, use
);
2094 if (SSA_NAME_OCCURS_IN_ABNORMAL_PHI (def
))
2095 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (use
) = 1;
2098 replace_uses_by (def
, use
);
2100 remove_phi_node (&psi
, true);
2104 /* Ensure that B follows A. */
2105 move_block_after (b
, a
);
2107 gcc_assert (single_succ_edge (a
)->flags
& EDGE_FALLTHRU
);
2108 gcc_assert (!last_stmt (a
) || !stmt_ends_bb_p (last_stmt (a
)));
2110 /* Remove labels from B and set gimple_bb to A for other statements. */
2111 for (gsi
= gsi_start_bb (b
); !gsi_end_p (gsi
);)
2113 gimple
*stmt
= gsi_stmt (gsi
);
2114 if (glabel
*label_stmt
= dyn_cast
<glabel
*> (stmt
))
2116 tree label
= gimple_label_label (label_stmt
);
2119 gsi_remove (&gsi
, false);
2121 /* Now that we can thread computed gotos, we might have
2122 a situation where we have a forced label in block B
2123 However, the label at the start of block B might still be
2124 used in other ways (think about the runtime checking for
2125 Fortran assigned gotos). So we cannot just delete the
2126 label. Instead we move the label to the start of block A. */
2127 if (FORCED_LABEL (label
))
2129 gimple_stmt_iterator dest_gsi
= gsi_start_bb (a
);
2130 tree first_label
= NULL_TREE
;
2131 if (!gsi_end_p (dest_gsi
))
2132 if (glabel
*first_label_stmt
2133 = dyn_cast
<glabel
*> (gsi_stmt (dest_gsi
)))
2134 first_label
= gimple_label_label (first_label_stmt
);
2136 && (DECL_NONLOCAL (first_label
)
2137 || EH_LANDING_PAD_NR (first_label
) != 0))
2138 gsi_insert_after (&dest_gsi
, stmt
, GSI_NEW_STMT
);
2140 gsi_insert_before (&dest_gsi
, stmt
, GSI_NEW_STMT
);
2142 /* Other user labels keep around in a form of a debug stmt. */
2143 else if (!DECL_ARTIFICIAL (label
) && MAY_HAVE_DEBUG_BIND_STMTS
)
2145 gimple
*dbg
= gimple_build_debug_bind (label
,
2148 gimple_debug_bind_reset_value (dbg
);
2149 gsi_insert_before (&gsi
, dbg
, GSI_SAME_STMT
);
2152 lp_nr
= EH_LANDING_PAD_NR (label
);
2155 eh_landing_pad lp
= get_eh_landing_pad_from_number (lp_nr
);
2156 lp
->post_landing_pad
= NULL
;
2161 gimple_set_bb (stmt
, a
);
2166 /* When merging two BBs, if their counts are different, the larger count
2167 is selected as the new bb count. This is to handle inconsistent
2169 if (a
->loop_father
== b
->loop_father
)
2171 a
->count
= a
->count
.merge (b
->count
);
2174 /* Merge the sequences. */
2175 last
= gsi_last_bb (a
);
2176 gsi_insert_seq_after (&last
, bb_seq (b
), GSI_NEW_STMT
);
2177 set_bb_seq (b
, NULL
);
2179 if (cfgcleanup_altered_bbs
)
2180 bitmap_set_bit (cfgcleanup_altered_bbs
, a
->index
);
2184 /* Return the one of two successors of BB that is not reachable by a
2185 complex edge, if there is one. Else, return BB. We use
2186 this in optimizations that use post-dominators for their heuristics,
2187 to catch the cases in C++ where function calls are involved. */
2190 single_noncomplex_succ (basic_block bb
)
2193 if (EDGE_COUNT (bb
->succs
) != 2)
2196 e0
= EDGE_SUCC (bb
, 0);
2197 e1
= EDGE_SUCC (bb
, 1);
2198 if (e0
->flags
& EDGE_COMPLEX
)
2200 if (e1
->flags
& EDGE_COMPLEX
)
2206 /* T is CALL_EXPR. Set current_function_calls_* flags. */
2209 notice_special_calls (gcall
*call
)
2211 int flags
= gimple_call_flags (call
);
2213 if (flags
& ECF_MAY_BE_ALLOCA
)
2214 cfun
->calls_alloca
= true;
2215 if (flags
& ECF_RETURNS_TWICE
)
2216 cfun
->calls_setjmp
= true;
2220 /* Clear flags set by notice_special_calls. Used by dead code removal
2221 to update the flags. */
2224 clear_special_calls (void)
2226 cfun
->calls_alloca
= false;
2227 cfun
->calls_setjmp
= false;
2230 /* Remove PHI nodes associated with basic block BB and all edges out of BB. */
2233 remove_phi_nodes_and_edges_for_unreachable_block (basic_block bb
)
2235 /* Since this block is no longer reachable, we can just delete all
2236 of its PHI nodes. */
2237 remove_phi_nodes (bb
);
2239 /* Remove edges to BB's successors. */
2240 while (EDGE_COUNT (bb
->succs
) > 0)
2241 remove_edge (EDGE_SUCC (bb
, 0));
2245 /* Remove statements of basic block BB. */
2248 remove_bb (basic_block bb
)
2250 gimple_stmt_iterator i
;
2254 fprintf (dump_file
, "Removing basic block %d\n", bb
->index
);
2255 if (dump_flags
& TDF_DETAILS
)
2257 dump_bb (dump_file
, bb
, 0, TDF_BLOCKS
);
2258 fprintf (dump_file
, "\n");
2264 class loop
*loop
= bb
->loop_father
;
2266 /* If a loop gets removed, clean up the information associated
2268 if (loop
->latch
== bb
2269 || loop
->header
== bb
)
2270 free_numbers_of_iterations_estimates (loop
);
2273 /* Remove all the instructions in the block. */
2274 if (bb_seq (bb
) != NULL
)
2276 /* Walk backwards so as to get a chance to substitute all
2277 released DEFs into debug stmts. See
2278 eliminate_unnecessary_stmts() in tree-ssa-dce.cc for more
2280 for (i
= gsi_last_bb (bb
); !gsi_end_p (i
);)
2282 gimple
*stmt
= gsi_stmt (i
);
2283 glabel
*label_stmt
= dyn_cast
<glabel
*> (stmt
);
2285 && (FORCED_LABEL (gimple_label_label (label_stmt
))
2286 || DECL_NONLOCAL (gimple_label_label (label_stmt
))))
2289 gimple_stmt_iterator new_gsi
;
2291 /* A non-reachable non-local label may still be referenced.
2292 But it no longer needs to carry the extra semantics of
2294 if (DECL_NONLOCAL (gimple_label_label (label_stmt
)))
2296 DECL_NONLOCAL (gimple_label_label (label_stmt
)) = 0;
2297 FORCED_LABEL (gimple_label_label (label_stmt
)) = 1;
2300 new_bb
= bb
->prev_bb
;
2301 /* Don't move any labels into ENTRY block. */
2302 if (new_bb
== ENTRY_BLOCK_PTR_FOR_FN (cfun
))
2304 new_bb
= single_succ (new_bb
);
2305 gcc_assert (new_bb
!= bb
);
2307 if ((unsigned) bb
->index
< bb_to_omp_idx
.length ()
2308 && ((unsigned) new_bb
->index
>= bb_to_omp_idx
.length ()
2309 || (bb_to_omp_idx
[bb
->index
]
2310 != bb_to_omp_idx
[new_bb
->index
])))
2312 /* During cfg pass make sure to put orphaned labels
2313 into the right OMP region. */
2317 FOR_EACH_VEC_ELT (bb_to_omp_idx
, i
, idx
)
2318 if (i
>= NUM_FIXED_BLOCKS
2319 && idx
== bb_to_omp_idx
[bb
->index
]
2320 && i
!= (unsigned) bb
->index
)
2322 new_bb
= BASIC_BLOCK_FOR_FN (cfun
, i
);
2327 new_bb
= single_succ (ENTRY_BLOCK_PTR_FOR_FN (cfun
));
2328 gcc_assert (new_bb
!= bb
);
2331 new_gsi
= gsi_after_labels (new_bb
);
2332 gsi_remove (&i
, false);
2333 gsi_insert_before (&new_gsi
, stmt
, GSI_NEW_STMT
);
2337 /* Release SSA definitions. */
2338 release_defs (stmt
);
2339 gsi_remove (&i
, true);
2343 i
= gsi_last_bb (bb
);
2349 if ((unsigned) bb
->index
< bb_to_omp_idx
.length ())
2350 bb_to_omp_idx
[bb
->index
] = -1;
2351 remove_phi_nodes_and_edges_for_unreachable_block (bb
);
2352 bb
->il
.gimple
.seq
= NULL
;
2353 bb
->il
.gimple
.phi_nodes
= NULL
;
2357 /* Given a basic block BB and a value VAL for use in the final statement
2358 of the block (if a GIMPLE_COND, GIMPLE_SWITCH, or computed goto), return
2359 the edge that will be taken out of the block.
2360 If VAL is NULL_TREE, then the current value of the final statement's
2361 predicate or index is used.
2362 If the value does not match a unique edge, NULL is returned. */
2365 find_taken_edge (basic_block bb
, tree val
)
2369 stmt
= last_stmt (bb
);
2371 /* Handle ENTRY and EXIT. */
2375 if (gimple_code (stmt
) == GIMPLE_COND
)
2376 return find_taken_edge_cond_expr (as_a
<gcond
*> (stmt
), val
);
2378 if (gimple_code (stmt
) == GIMPLE_SWITCH
)
2379 return find_taken_edge_switch_expr (as_a
<gswitch
*> (stmt
), val
);
2381 if (computed_goto_p (stmt
))
2383 /* Only optimize if the argument is a label, if the argument is
2384 not a label then we cannot construct a proper CFG.
2386 It may be the case that we only need to allow the LABEL_REF to
2387 appear inside an ADDR_EXPR, but we also allow the LABEL_REF to
2388 appear inside a LABEL_EXPR just to be safe. */
2390 && (TREE_CODE (val
) == ADDR_EXPR
|| TREE_CODE (val
) == LABEL_EXPR
)
2391 && TREE_CODE (TREE_OPERAND (val
, 0)) == LABEL_DECL
)
2392 return find_taken_edge_computed_goto (bb
, TREE_OPERAND (val
, 0));
2395 /* Otherwise we only know the taken successor edge if it's unique. */
2396 return single_succ_p (bb
) ? single_succ_edge (bb
) : NULL
;
2399 /* Given a constant value VAL and the entry block BB to a GOTO_EXPR
2400 statement, determine which of the outgoing edges will be taken out of the
2401 block. Return NULL if either edge may be taken. */
2404 find_taken_edge_computed_goto (basic_block bb
, tree val
)
2409 dest
= label_to_block (cfun
, val
);
2411 e
= find_edge (bb
, dest
);
2413 /* It's possible for find_edge to return NULL here on invalid code
2414 that abuses the labels-as-values extension (e.g. code that attempts to
2415 jump *between* functions via stored labels-as-values; PR 84136).
2416 If so, then we simply return that NULL for the edge.
2417 We don't currently have a way of detecting such invalid code, so we
2418 can't assert that it was the case when a NULL edge occurs here. */
2423 /* Given COND_STMT and a constant value VAL for use as the predicate,
2424 determine which of the two edges will be taken out of
2425 the statement's block. Return NULL if either edge may be taken.
2426 If VAL is NULL_TREE, then the current value of COND_STMT's predicate
2430 find_taken_edge_cond_expr (const gcond
*cond_stmt
, tree val
)
2432 edge true_edge
, false_edge
;
2434 if (val
== NULL_TREE
)
2436 /* Use the current value of the predicate. */
2437 if (gimple_cond_true_p (cond_stmt
))
2438 val
= integer_one_node
;
2439 else if (gimple_cond_false_p (cond_stmt
))
2440 val
= integer_zero_node
;
2444 else if (TREE_CODE (val
) != INTEGER_CST
)
2447 extract_true_false_edges_from_block (gimple_bb (cond_stmt
),
2448 &true_edge
, &false_edge
);
2450 return (integer_zerop (val
) ? false_edge
: true_edge
);
2453 /* Given SWITCH_STMT and an INTEGER_CST VAL for use as the index, determine
2454 which edge will be taken out of the statement's block. Return NULL if any
2456 If VAL is NULL_TREE, then the current value of SWITCH_STMT's index
2460 find_taken_edge_switch_expr (const gswitch
*switch_stmt
, tree val
)
2462 basic_block dest_bb
;
2466 if (gimple_switch_num_labels (switch_stmt
) == 1)
2467 taken_case
= gimple_switch_default_label (switch_stmt
);
2470 if (val
== NULL_TREE
)
2471 val
= gimple_switch_index (switch_stmt
);
2472 if (TREE_CODE (val
) != INTEGER_CST
)
2475 taken_case
= find_case_label_for_value (switch_stmt
, val
);
2477 dest_bb
= label_to_block (cfun
, CASE_LABEL (taken_case
));
2479 e
= find_edge (gimple_bb (switch_stmt
), dest_bb
);
2485 /* Return the CASE_LABEL_EXPR that SWITCH_STMT will take for VAL.
2486 We can make optimal use here of the fact that the case labels are
2487 sorted: We can do a binary search for a case matching VAL. */
2490 find_case_label_for_value (const gswitch
*switch_stmt
, tree val
)
2492 size_t low
, high
, n
= gimple_switch_num_labels (switch_stmt
);
2493 tree default_case
= gimple_switch_default_label (switch_stmt
);
2495 for (low
= 0, high
= n
; high
- low
> 1; )
2497 size_t i
= (high
+ low
) / 2;
2498 tree t
= gimple_switch_label (switch_stmt
, i
);
2501 /* Cache the result of comparing CASE_LOW and val. */
2502 cmp
= tree_int_cst_compare (CASE_LOW (t
), val
);
2509 if (CASE_HIGH (t
) == NULL
)
2511 /* A singe-valued case label. */
2517 /* A case range. We can only handle integer ranges. */
2518 if (cmp
<= 0 && tree_int_cst_compare (CASE_HIGH (t
), val
) >= 0)
2523 return default_case
;
2527 /* Dump a basic block on stderr. */
2530 gimple_debug_bb (basic_block bb
)
2532 dump_bb (stderr
, bb
, 0, TDF_VOPS
|TDF_MEMSYMS
|TDF_BLOCKS
);
2536 /* Dump basic block with index N on stderr. */
2539 gimple_debug_bb_n (int n
)
2541 gimple_debug_bb (BASIC_BLOCK_FOR_FN (cfun
, n
));
2542 return BASIC_BLOCK_FOR_FN (cfun
, n
);
2546 /* Dump the CFG on stderr.
2548 FLAGS are the same used by the tree dumping functions
2549 (see TDF_* in dumpfile.h). */
2552 gimple_debug_cfg (dump_flags_t flags
)
2554 gimple_dump_cfg (stderr
, flags
);
2558 /* Dump the program showing basic block boundaries on the given FILE.
2560 FLAGS are the same used by the tree dumping functions (see TDF_* in
2564 gimple_dump_cfg (FILE *file
, dump_flags_t flags
)
2566 if (flags
& TDF_DETAILS
)
2568 dump_function_header (file
, current_function_decl
, flags
);
2569 fprintf (file
, ";; \n%d basic blocks, %d edges, last basic block %d.\n\n",
2570 n_basic_blocks_for_fn (cfun
), n_edges_for_fn (cfun
),
2571 last_basic_block_for_fn (cfun
));
2573 brief_dump_cfg (file
, flags
);
2574 fprintf (file
, "\n");
2577 if (flags
& TDF_STATS
)
2578 dump_cfg_stats (file
);
2580 dump_function_to_file (current_function_decl
, file
, flags
| TDF_BLOCKS
);
2584 /* Dump CFG statistics on FILE. */
2587 dump_cfg_stats (FILE *file
)
2589 static long max_num_merged_labels
= 0;
2590 unsigned long size
, total
= 0;
2593 const char * const fmt_str
= "%-30s%-13s%12s\n";
2594 const char * const fmt_str_1
= "%-30s%13d" PRsa (11) "\n";
2595 const char * const fmt_str_2
= "%-30s%13ld" PRsa (11) "\n";
2596 const char * const fmt_str_3
= "%-43s" PRsa (11) "\n";
2597 const char *funcname
= current_function_name ();
2599 fprintf (file
, "\nCFG Statistics for %s\n\n", funcname
);
2601 fprintf (file
, "---------------------------------------------------------\n");
2602 fprintf (file
, fmt_str
, "", " Number of ", "Memory");
2603 fprintf (file
, fmt_str
, "", " instances ", "used ");
2604 fprintf (file
, "---------------------------------------------------------\n");
2606 size
= n_basic_blocks_for_fn (cfun
) * sizeof (struct basic_block_def
);
2608 fprintf (file
, fmt_str_1
, "Basic blocks", n_basic_blocks_for_fn (cfun
),
2609 SIZE_AMOUNT (size
));
2612 FOR_EACH_BB_FN (bb
, cfun
)
2613 num_edges
+= EDGE_COUNT (bb
->succs
);
2614 size
= num_edges
* sizeof (class edge_def
);
2616 fprintf (file
, fmt_str_2
, "Edges", num_edges
, SIZE_AMOUNT (size
));
2618 fprintf (file
, "---------------------------------------------------------\n");
2619 fprintf (file
, fmt_str_3
, "Total memory used by CFG data",
2620 SIZE_AMOUNT (total
));
2621 fprintf (file
, "---------------------------------------------------------\n");
2622 fprintf (file
, "\n");
2624 if (cfg_stats
.num_merged_labels
> max_num_merged_labels
)
2625 max_num_merged_labels
= cfg_stats
.num_merged_labels
;
2627 fprintf (file
, "Coalesced label blocks: %ld (Max so far: %ld)\n",
2628 cfg_stats
.num_merged_labels
, max_num_merged_labels
);
2630 fprintf (file
, "\n");
2634 /* Dump CFG statistics on stderr. Keep extern so that it's always
2635 linked in the final executable. */
2638 debug_cfg_stats (void)
2640 dump_cfg_stats (stderr
);
2643 /*---------------------------------------------------------------------------
2644 Miscellaneous helpers
2645 ---------------------------------------------------------------------------*/
2647 /* Return true if T, a GIMPLE_CALL, can make an abnormal transfer of control
2648 flow. Transfers of control flow associated with EH are excluded. */
2651 call_can_make_abnormal_goto (gimple
*t
)
2653 /* If the function has no non-local labels, then a call cannot make an
2654 abnormal transfer of control. */
2655 if (!cfun
->has_nonlocal_label
2656 && !cfun
->calls_setjmp
)
2659 /* Likewise if the call has no side effects. */
2660 if (!gimple_has_side_effects (t
))
2663 /* Likewise if the called function is leaf. */
2664 if (gimple_call_flags (t
) & ECF_LEAF
)
2671 /* Return true if T can make an abnormal transfer of control flow.
2672 Transfers of control flow associated with EH are excluded. */
2675 stmt_can_make_abnormal_goto (gimple
*t
)
2677 if (computed_goto_p (t
))
2679 if (is_gimple_call (t
))
2680 return call_can_make_abnormal_goto (t
);
2685 /* Return true if T represents a stmt that always transfers control. */
2688 is_ctrl_stmt (gimple
*t
)
2690 switch (gimple_code (t
))
2704 /* Return true if T is a statement that may alter the flow of control
2705 (e.g., a call to a non-returning function). */
2708 is_ctrl_altering_stmt (gimple
*t
)
2712 switch (gimple_code (t
))
2715 /* Per stmt call flag indicates whether the call could alter
2717 if (gimple_call_ctrl_altering_p (t
))
2721 case GIMPLE_EH_DISPATCH
:
2722 /* EH_DISPATCH branches to the individual catch handlers at
2723 this level of a try or allowed-exceptions region. It can
2724 fallthru to the next statement as well. */
2728 if (gimple_asm_nlabels (as_a
<gasm
*> (t
)) > 0)
2733 /* OpenMP directives alter control flow. */
2736 case GIMPLE_TRANSACTION
:
2737 /* A transaction start alters control flow. */
2744 /* If a statement can throw, it alters control flow. */
2745 return stmt_can_throw_internal (cfun
, t
);
2749 /* Return true if T is a simple local goto. */
2752 simple_goto_p (gimple
*t
)
2754 return (gimple_code (t
) == GIMPLE_GOTO
2755 && TREE_CODE (gimple_goto_dest (t
)) == LABEL_DECL
);
2759 /* Return true if STMT should start a new basic block. PREV_STMT is
2760 the statement preceding STMT. It is used when STMT is a label or a
2761 case label. Labels should only start a new basic block if their
2762 previous statement wasn't a label. Otherwise, sequence of labels
2763 would generate unnecessary basic blocks that only contain a single
2767 stmt_starts_bb_p (gimple
*stmt
, gimple
*prev_stmt
)
2772 /* PREV_STMT is only set to a debug stmt if the debug stmt is before
2773 any nondebug stmts in the block. We don't want to start another
2774 block in this case: the debug stmt will already have started the
2775 one STMT would start if we weren't outputting debug stmts. */
2776 if (prev_stmt
&& is_gimple_debug (prev_stmt
))
2779 /* Labels start a new basic block only if the preceding statement
2780 wasn't a label of the same type. This prevents the creation of
2781 consecutive blocks that have nothing but a single label. */
2782 if (glabel
*label_stmt
= dyn_cast
<glabel
*> (stmt
))
2784 /* Nonlocal and computed GOTO targets always start a new block. */
2785 if (DECL_NONLOCAL (gimple_label_label (label_stmt
))
2786 || FORCED_LABEL (gimple_label_label (label_stmt
)))
2789 if (glabel
*plabel
= safe_dyn_cast
<glabel
*> (prev_stmt
))
2791 if (DECL_NONLOCAL (gimple_label_label (plabel
))
2792 || !DECL_ARTIFICIAL (gimple_label_label (plabel
)))
2795 cfg_stats
.num_merged_labels
++;
2801 else if (gimple_code (stmt
) == GIMPLE_CALL
)
2803 if (gimple_call_flags (stmt
) & ECF_RETURNS_TWICE
)
2804 /* setjmp acts similar to a nonlocal GOTO target and thus should
2805 start a new block. */
2807 if (gimple_call_internal_p (stmt
, IFN_PHI
)
2809 && gimple_code (prev_stmt
) != GIMPLE_LABEL
2810 && (gimple_code (prev_stmt
) != GIMPLE_CALL
2811 || ! gimple_call_internal_p (prev_stmt
, IFN_PHI
)))
2812 /* PHI nodes start a new block unless preceeded by a label
2821 /* Return true if T should end a basic block. */
2824 stmt_ends_bb_p (gimple
*t
)
2826 return is_ctrl_stmt (t
) || is_ctrl_altering_stmt (t
);
2829 /* Remove block annotations and other data structures. */
2832 delete_tree_cfg_annotations (struct function
*fn
)
2834 vec_free (label_to_block_map_for_fn (fn
));
2837 /* Return the virtual phi in BB. */
2840 get_virtual_phi (basic_block bb
)
2842 for (gphi_iterator gsi
= gsi_start_phis (bb
);
2846 gphi
*phi
= gsi
.phi ();
2848 if (virtual_operand_p (PHI_RESULT (phi
)))
2855 /* Return the first statement in basic block BB. */
2858 first_stmt (basic_block bb
)
2860 gimple_stmt_iterator i
= gsi_start_bb (bb
);
2861 gimple
*stmt
= NULL
;
2863 while (!gsi_end_p (i
) && is_gimple_debug ((stmt
= gsi_stmt (i
))))
2871 /* Return the first non-label statement in basic block BB. */
2874 first_non_label_stmt (basic_block bb
)
2876 gimple_stmt_iterator i
= gsi_start_bb (bb
);
2877 while (!gsi_end_p (i
) && gimple_code (gsi_stmt (i
)) == GIMPLE_LABEL
)
2879 return !gsi_end_p (i
) ? gsi_stmt (i
) : NULL
;
2882 /* Return the last statement in basic block BB. */
2885 last_stmt (basic_block bb
)
2887 gimple_stmt_iterator i
= gsi_last_bb (bb
);
2888 gimple
*stmt
= NULL
;
2890 while (!gsi_end_p (i
) && is_gimple_debug ((stmt
= gsi_stmt (i
))))
2898 /* Return the last statement of an otherwise empty block. Return NULL
2899 if the block is totally empty, or if it contains more than one
2903 last_and_only_stmt (basic_block bb
)
2905 gimple_stmt_iterator i
= gsi_last_nondebug_bb (bb
);
2906 gimple
*last
, *prev
;
2911 last
= gsi_stmt (i
);
2912 gsi_prev_nondebug (&i
);
2916 /* Empty statements should no longer appear in the instruction stream.
2917 Everything that might have appeared before should be deleted by
2918 remove_useless_stmts, and the optimizers should just gsi_remove
2919 instead of smashing with build_empty_stmt.
2921 Thus the only thing that should appear here in a block containing
2922 one executable statement is a label. */
2923 prev
= gsi_stmt (i
);
2924 if (gimple_code (prev
) == GIMPLE_LABEL
)
2930 /* Returns the basic block after which the new basic block created
2931 by splitting edge EDGE_IN should be placed. Tries to keep the new block
2932 near its "logical" location. This is of most help to humans looking
2933 at debugging dumps. */
2936 split_edge_bb_loc (edge edge_in
)
2938 basic_block dest
= edge_in
->dest
;
2939 basic_block dest_prev
= dest
->prev_bb
;
2943 edge e
= find_edge (dest_prev
, dest
);
2944 if (e
&& !(e
->flags
& EDGE_COMPLEX
))
2945 return edge_in
->src
;
2950 /* Split a (typically critical) edge EDGE_IN. Return the new block.
2951 Abort on abnormal edges. */
2954 gimple_split_edge (edge edge_in
)
2956 basic_block new_bb
, after_bb
, dest
;
2959 /* Abnormal edges cannot be split. */
2960 gcc_assert (!(edge_in
->flags
& EDGE_ABNORMAL
));
2962 dest
= edge_in
->dest
;
2964 after_bb
= split_edge_bb_loc (edge_in
);
2966 new_bb
= create_empty_bb (after_bb
);
2967 new_bb
->count
= edge_in
->count ();
2969 /* We want to avoid re-allocating PHIs when we first
2970 add the fallthru edge from new_bb to dest but we also
2971 want to avoid changing PHI argument order when
2972 first redirecting edge_in away from dest. The former
2973 avoids changing PHI argument order by adding them
2974 last and then the redirection swapping it back into
2975 place by means of unordered remove.
2976 So hack around things by temporarily removing all PHIs
2977 from the destination during the edge redirection and then
2978 making sure the edges stay in order. */
2979 gimple_seq saved_phis
= phi_nodes (dest
);
2980 unsigned old_dest_idx
= edge_in
->dest_idx
;
2981 set_phi_nodes (dest
, NULL
);
2982 new_edge
= make_single_succ_edge (new_bb
, dest
, EDGE_FALLTHRU
);
2983 e
= redirect_edge_and_branch (edge_in
, new_bb
);
2984 gcc_assert (e
== edge_in
&& new_edge
->dest_idx
== old_dest_idx
);
2985 /* set_phi_nodes sets the BB of the PHI nodes, so do it manually here. */
2986 dest
->il
.gimple
.phi_nodes
= saved_phis
;
2992 /* Verify properties of the address expression T whose base should be
2993 TREE_ADDRESSABLE if VERIFY_ADDRESSABLE is true. */
2996 verify_address (tree t
, bool verify_addressable
)
2999 bool old_side_effects
;
3001 bool new_side_effects
;
3003 old_constant
= TREE_CONSTANT (t
);
3004 old_side_effects
= TREE_SIDE_EFFECTS (t
);
3006 recompute_tree_invariant_for_addr_expr (t
);
3007 new_side_effects
= TREE_SIDE_EFFECTS (t
);
3008 new_constant
= TREE_CONSTANT (t
);
3010 if (old_constant
!= new_constant
)
3012 error ("constant not recomputed when %<ADDR_EXPR%> changed");
3015 if (old_side_effects
!= new_side_effects
)
3017 error ("side effects not recomputed when %<ADDR_EXPR%> changed");
3021 tree base
= TREE_OPERAND (t
, 0);
3022 while (handled_component_p (base
))
3023 base
= TREE_OPERAND (base
, 0);
3026 || TREE_CODE (base
) == PARM_DECL
3027 || TREE_CODE (base
) == RESULT_DECL
))
3030 if (verify_addressable
&& !TREE_ADDRESSABLE (base
))
3032 error ("address taken but %<TREE_ADDRESSABLE%> bit not set");
3040 /* Verify if EXPR is a valid GIMPLE reference expression. If
3041 REQUIRE_LVALUE is true verifies it is an lvalue. Returns true
3042 if there is an error, otherwise false. */
3045 verify_types_in_gimple_reference (tree expr
, bool require_lvalue
)
3047 const char *code_name
= get_tree_code_name (TREE_CODE (expr
));
3049 if (TREE_CODE (expr
) == REALPART_EXPR
3050 || TREE_CODE (expr
) == IMAGPART_EXPR
3051 || TREE_CODE (expr
) == BIT_FIELD_REF
)
3053 tree op
= TREE_OPERAND (expr
, 0);
3054 if (!is_gimple_reg_type (TREE_TYPE (expr
)))
3056 error ("non-scalar %qs", code_name
);
3060 if (TREE_CODE (expr
) == BIT_FIELD_REF
)
3062 tree t1
= TREE_OPERAND (expr
, 1);
3063 tree t2
= TREE_OPERAND (expr
, 2);
3064 poly_uint64 size
, bitpos
;
3065 if (!poly_int_tree_p (t1
, &size
)
3066 || !poly_int_tree_p (t2
, &bitpos
)
3067 || !types_compatible_p (bitsizetype
, TREE_TYPE (t1
))
3068 || !types_compatible_p (bitsizetype
, TREE_TYPE (t2
)))
3070 error ("invalid position or size operand to %qs", code_name
);
3073 if (INTEGRAL_TYPE_P (TREE_TYPE (expr
))
3074 && maybe_ne (TYPE_PRECISION (TREE_TYPE (expr
)), size
))
3076 error ("integral result type precision does not match "
3077 "field size of %qs", code_name
);
3080 else if (!INTEGRAL_TYPE_P (TREE_TYPE (expr
))
3081 && TYPE_MODE (TREE_TYPE (expr
)) != BLKmode
3082 && maybe_ne (GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (expr
))),
3085 error ("mode size of non-integral result does not "
3086 "match field size of %qs",
3090 if (INTEGRAL_TYPE_P (TREE_TYPE (op
))
3091 && !type_has_mode_precision_p (TREE_TYPE (op
)))
3093 error ("%qs of non-mode-precision operand", code_name
);
3096 if (!AGGREGATE_TYPE_P (TREE_TYPE (op
))
3097 && maybe_gt (size
+ bitpos
,
3098 tree_to_poly_uint64 (TYPE_SIZE (TREE_TYPE (op
)))))
3100 error ("position plus size exceeds size of referenced object in "
3106 if ((TREE_CODE (expr
) == REALPART_EXPR
3107 || TREE_CODE (expr
) == IMAGPART_EXPR
)
3108 && !useless_type_conversion_p (TREE_TYPE (expr
),
3109 TREE_TYPE (TREE_TYPE (op
))))
3111 error ("type mismatch in %qs reference", code_name
);
3112 debug_generic_stmt (TREE_TYPE (expr
));
3113 debug_generic_stmt (TREE_TYPE (TREE_TYPE (op
)));
3119 while (handled_component_p (expr
))
3121 code_name
= get_tree_code_name (TREE_CODE (expr
));
3123 if (TREE_CODE (expr
) == REALPART_EXPR
3124 || TREE_CODE (expr
) == IMAGPART_EXPR
3125 || TREE_CODE (expr
) == BIT_FIELD_REF
)
3127 error ("non-top-level %qs", code_name
);
3131 tree op
= TREE_OPERAND (expr
, 0);
3133 if (TREE_CODE (expr
) == ARRAY_REF
3134 || TREE_CODE (expr
) == ARRAY_RANGE_REF
)
3136 if (!is_gimple_val (TREE_OPERAND (expr
, 1))
3137 || (TREE_OPERAND (expr
, 2)
3138 && !is_gimple_val (TREE_OPERAND (expr
, 2)))
3139 || (TREE_OPERAND (expr
, 3)
3140 && !is_gimple_val (TREE_OPERAND (expr
, 3))))
3142 error ("invalid operands to %qs", code_name
);
3143 debug_generic_stmt (expr
);
3148 /* Verify if the reference array element types are compatible. */
3149 if (TREE_CODE (expr
) == ARRAY_REF
3150 && !useless_type_conversion_p (TREE_TYPE (expr
),
3151 TREE_TYPE (TREE_TYPE (op
))))
3153 error ("type mismatch in %qs", code_name
);
3154 debug_generic_stmt (TREE_TYPE (expr
));
3155 debug_generic_stmt (TREE_TYPE (TREE_TYPE (op
)));
3158 if (TREE_CODE (expr
) == ARRAY_RANGE_REF
3159 && !useless_type_conversion_p (TREE_TYPE (TREE_TYPE (expr
)),
3160 TREE_TYPE (TREE_TYPE (op
))))
3162 error ("type mismatch in %qs", code_name
);
3163 debug_generic_stmt (TREE_TYPE (TREE_TYPE (expr
)));
3164 debug_generic_stmt (TREE_TYPE (TREE_TYPE (op
)));
3168 if (TREE_CODE (expr
) == COMPONENT_REF
)
3170 if (TREE_OPERAND (expr
, 2)
3171 && !is_gimple_val (TREE_OPERAND (expr
, 2)))
3173 error ("invalid %qs offset operator", code_name
);
3176 if (!useless_type_conversion_p (TREE_TYPE (expr
),
3177 TREE_TYPE (TREE_OPERAND (expr
, 1))))
3179 error ("type mismatch in %qs", code_name
);
3180 debug_generic_stmt (TREE_TYPE (expr
));
3181 debug_generic_stmt (TREE_TYPE (TREE_OPERAND (expr
, 1)));
3186 if (TREE_CODE (expr
) == VIEW_CONVERT_EXPR
)
3188 /* For VIEW_CONVERT_EXPRs which are allowed here too, we only check
3189 that their operand is not an SSA name or an invariant when
3190 requiring an lvalue (this usually means there is a SRA or IPA-SRA
3191 bug). Otherwise there is nothing to verify, gross mismatches at
3192 most invoke undefined behavior. */
3194 && (TREE_CODE (op
) == SSA_NAME
3195 || is_gimple_min_invariant (op
)))
3197 error ("conversion of %qs on the left hand side of %qs",
3198 get_tree_code_name (TREE_CODE (op
)), code_name
);
3199 debug_generic_stmt (expr
);
3202 else if (TREE_CODE (op
) == SSA_NAME
3203 && TYPE_SIZE (TREE_TYPE (expr
)) != TYPE_SIZE (TREE_TYPE (op
)))
3205 error ("conversion of register to a different size in %qs",
3207 debug_generic_stmt (expr
);
3210 else if (!handled_component_p (op
))
3217 code_name
= get_tree_code_name (TREE_CODE (expr
));
3219 if (TREE_CODE (expr
) == MEM_REF
)
3221 if (!is_gimple_mem_ref_addr (TREE_OPERAND (expr
, 0))
3222 || (TREE_CODE (TREE_OPERAND (expr
, 0)) == ADDR_EXPR
3223 && verify_address (TREE_OPERAND (expr
, 0), false)))
3225 error ("invalid address operand in %qs", code_name
);
3226 debug_generic_stmt (expr
);
3229 if (!poly_int_tree_p (TREE_OPERAND (expr
, 1))
3230 || !POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (expr
, 1))))
3232 error ("invalid offset operand in %qs", code_name
);
3233 debug_generic_stmt (expr
);
3236 if (MR_DEPENDENCE_CLIQUE (expr
) != 0
3237 && MR_DEPENDENCE_CLIQUE (expr
) > cfun
->last_clique
)
3239 error ("invalid clique in %qs", code_name
);
3240 debug_generic_stmt (expr
);
3244 else if (TREE_CODE (expr
) == TARGET_MEM_REF
)
3246 if (!TMR_BASE (expr
)
3247 || !is_gimple_mem_ref_addr (TMR_BASE (expr
))
3248 || (TREE_CODE (TMR_BASE (expr
)) == ADDR_EXPR
3249 && verify_address (TMR_BASE (expr
), false)))
3251 error ("invalid address operand in %qs", code_name
);
3254 if (!TMR_OFFSET (expr
)
3255 || !poly_int_tree_p (TMR_OFFSET (expr
))
3256 || !POINTER_TYPE_P (TREE_TYPE (TMR_OFFSET (expr
))))
3258 error ("invalid offset operand in %qs", code_name
);
3259 debug_generic_stmt (expr
);
3262 if (MR_DEPENDENCE_CLIQUE (expr
) != 0
3263 && MR_DEPENDENCE_CLIQUE (expr
) > cfun
->last_clique
)
3265 error ("invalid clique in %qs", code_name
);
3266 debug_generic_stmt (expr
);
3270 else if (TREE_CODE (expr
) == INDIRECT_REF
)
3272 error ("%qs in gimple IL", code_name
);
3273 debug_generic_stmt (expr
);
3278 && (TREE_CODE (expr
) == SSA_NAME
|| is_gimple_min_invariant (expr
)))
3281 if (TREE_CODE (expr
) != SSA_NAME
&& is_gimple_id (expr
))
3284 if (TREE_CODE (expr
) != TARGET_MEM_REF
3285 && TREE_CODE (expr
) != MEM_REF
)
3287 error ("invalid expression for min lvalue");
3294 /* Returns true if there is one pointer type in TYPE_POINTER_TO (SRC_OBJ)
3295 list of pointer-to types that is trivially convertible to DEST. */
3298 one_pointer_to_useless_type_conversion_p (tree dest
, tree src_obj
)
3302 if (!TYPE_POINTER_TO (src_obj
))
3305 for (src
= TYPE_POINTER_TO (src_obj
); src
; src
= TYPE_NEXT_PTR_TO (src
))
3306 if (useless_type_conversion_p (dest
, src
))
3312 /* Return true if TYPE1 is a fixed-point type and if conversions to and
3313 from TYPE2 can be handled by FIXED_CONVERT_EXPR. */
3316 valid_fixed_convert_types_p (tree type1
, tree type2
)
3318 return (FIXED_POINT_TYPE_P (type1
)
3319 && (INTEGRAL_TYPE_P (type2
)
3320 || SCALAR_FLOAT_TYPE_P (type2
)
3321 || FIXED_POINT_TYPE_P (type2
)));
3324 /* Verify the contents of a GIMPLE_CALL STMT. Returns true when there
3325 is a problem, otherwise false. */
3328 verify_gimple_call (gcall
*stmt
)
3330 tree fn
= gimple_call_fn (stmt
);
3331 tree fntype
, fndecl
;
3334 if (gimple_call_internal_p (stmt
))
3338 error ("gimple call has two targets");
3339 debug_generic_stmt (fn
);
3347 error ("gimple call has no target");
3352 if (fn
&& !is_gimple_call_addr (fn
))
3354 error ("invalid function in gimple call");
3355 debug_generic_stmt (fn
);
3360 && (!POINTER_TYPE_P (TREE_TYPE (fn
))
3361 || (TREE_CODE (TREE_TYPE (TREE_TYPE (fn
))) != FUNCTION_TYPE
3362 && TREE_CODE (TREE_TYPE (TREE_TYPE (fn
))) != METHOD_TYPE
)))
3364 error ("non-function in gimple call");
3368 fndecl
= gimple_call_fndecl (stmt
);
3370 && TREE_CODE (fndecl
) == FUNCTION_DECL
3371 && DECL_LOOPING_CONST_OR_PURE_P (fndecl
)
3372 && !DECL_PURE_P (fndecl
)
3373 && !TREE_READONLY (fndecl
))
3375 error ("invalid pure const state for function");
3379 tree lhs
= gimple_call_lhs (stmt
);
3381 && (!is_gimple_reg (lhs
)
3382 && (!is_gimple_lvalue (lhs
)
3383 || verify_types_in_gimple_reference
3384 (TREE_CODE (lhs
) == WITH_SIZE_EXPR
3385 ? TREE_OPERAND (lhs
, 0) : lhs
, true))))
3387 error ("invalid LHS in gimple call");
3391 if (gimple_call_ctrl_altering_p (stmt
)
3392 && gimple_call_noreturn_p (stmt
)
3393 && should_remove_lhs_p (lhs
))
3395 error ("LHS in %<noreturn%> call");
3399 fntype
= gimple_call_fntype (stmt
);
3402 && !useless_type_conversion_p (TREE_TYPE (lhs
), TREE_TYPE (fntype
))
3403 /* ??? At least C++ misses conversions at assignments from
3404 void * call results.
3405 For now simply allow arbitrary pointer type conversions. */
3406 && !(POINTER_TYPE_P (TREE_TYPE (lhs
))
3407 && POINTER_TYPE_P (TREE_TYPE (fntype
))))
3409 error ("invalid conversion in gimple call");
3410 debug_generic_stmt (TREE_TYPE (lhs
));
3411 debug_generic_stmt (TREE_TYPE (fntype
));
3415 if (gimple_call_chain (stmt
)
3416 && !is_gimple_val (gimple_call_chain (stmt
)))
3418 error ("invalid static chain in gimple call");
3419 debug_generic_stmt (gimple_call_chain (stmt
));
3423 /* If there is a static chain argument, the call should either be
3424 indirect, or the decl should have DECL_STATIC_CHAIN set. */
3425 if (gimple_call_chain (stmt
)
3427 && !DECL_STATIC_CHAIN (fndecl
))
3429 error ("static chain with function that doesn%'t use one");
3433 if (fndecl
&& fndecl_built_in_p (fndecl
, BUILT_IN_NORMAL
))
3435 switch (DECL_FUNCTION_CODE (fndecl
))
3437 case BUILT_IN_UNREACHABLE
:
3439 if (gimple_call_num_args (stmt
) > 0)
3441 /* Built-in unreachable with parameters might not be caught by
3442 undefined behavior sanitizer. Front-ends do check users do not
3443 call them that way but we also produce calls to
3444 __builtin_unreachable internally, for example when IPA figures
3445 out a call cannot happen in a legal program. In such cases,
3446 we must make sure arguments are stripped off. */
3447 error ("%<__builtin_unreachable%> or %<__builtin_trap%> call "
3457 /* For a call to .DEFERRED_INIT,
3458 LHS = DEFERRED_INIT (SIZE of the DECL, INIT_TYPE, NAME of the DECL)
3459 we should guarantee that when the 1st argument is a constant, it should
3460 be the same as the size of the LHS. */
3462 if (gimple_call_internal_p (stmt
, IFN_DEFERRED_INIT
))
3464 tree size_of_arg0
= gimple_call_arg (stmt
, 0);
3465 tree size_of_lhs
= TYPE_SIZE_UNIT (TREE_TYPE (lhs
));
3467 if (TREE_CODE (lhs
) == SSA_NAME
)
3468 lhs
= SSA_NAME_VAR (lhs
);
3470 poly_uint64 size_from_arg0
, size_from_lhs
;
3471 bool is_constant_size_arg0
= poly_int_tree_p (size_of_arg0
,
3473 bool is_constant_size_lhs
= poly_int_tree_p (size_of_lhs
,
3475 if (is_constant_size_arg0
&& is_constant_size_lhs
)
3476 if (maybe_ne (size_from_arg0
, size_from_lhs
))
3478 error ("%<DEFFERED_INIT%> calls should have same "
3479 "constant size for the first argument and LHS");
3484 /* ??? The C frontend passes unpromoted arguments in case it
3485 didn't see a function declaration before the call. So for now
3486 leave the call arguments mostly unverified. Once we gimplify
3487 unit-at-a-time we have a chance to fix this. */
3488 for (i
= 0; i
< gimple_call_num_args (stmt
); ++i
)
3490 tree arg
= gimple_call_arg (stmt
, i
);
3491 if ((is_gimple_reg_type (TREE_TYPE (arg
))
3492 && !is_gimple_val (arg
))
3493 || (!is_gimple_reg_type (TREE_TYPE (arg
))
3494 && !is_gimple_lvalue (arg
)))
3496 error ("invalid argument to gimple call");
3497 debug_generic_expr (arg
);
3500 if (!is_gimple_reg (arg
))
3502 if (TREE_CODE (arg
) == WITH_SIZE_EXPR
)
3503 arg
= TREE_OPERAND (arg
, 0);
3504 if (verify_types_in_gimple_reference (arg
, false))
3512 /* Verifies the gimple comparison with the result type TYPE and
3513 the operands OP0 and OP1, comparison code is CODE. */
3516 verify_gimple_comparison (tree type
, tree op0
, tree op1
, enum tree_code code
)
3518 tree op0_type
= TREE_TYPE (op0
);
3519 tree op1_type
= TREE_TYPE (op1
);
3521 if (!is_gimple_val (op0
) || !is_gimple_val (op1
))
3523 error ("invalid operands in gimple comparison");
3527 /* For comparisons we do not have the operations type as the
3528 effective type the comparison is carried out in. Instead
3529 we require that either the first operand is trivially
3530 convertible into the second, or the other way around. */
3531 if (!useless_type_conversion_p (op0_type
, op1_type
)
3532 && !useless_type_conversion_p (op1_type
, op0_type
))
3534 error ("mismatching comparison operand types");
3535 debug_generic_expr (op0_type
);
3536 debug_generic_expr (op1_type
);
3540 /* The resulting type of a comparison may be an effective boolean type. */
3541 if (INTEGRAL_TYPE_P (type
)
3542 && (TREE_CODE (type
) == BOOLEAN_TYPE
3543 || TYPE_PRECISION (type
) == 1))
3545 if ((TREE_CODE (op0_type
) == VECTOR_TYPE
3546 || TREE_CODE (op1_type
) == VECTOR_TYPE
)
3547 && code
!= EQ_EXPR
&& code
!= NE_EXPR
3548 && !VECTOR_BOOLEAN_TYPE_P (op0_type
)
3549 && !VECTOR_INTEGER_TYPE_P (op0_type
))
3551 error ("unsupported operation or type for vector comparison"
3552 " returning a boolean");
3553 debug_generic_expr (op0_type
);
3554 debug_generic_expr (op1_type
);
3558 /* Or a boolean vector type with the same element count
3559 as the comparison operand types. */
3560 else if (TREE_CODE (type
) == VECTOR_TYPE
3561 && TREE_CODE (TREE_TYPE (type
)) == BOOLEAN_TYPE
)
3563 if (TREE_CODE (op0_type
) != VECTOR_TYPE
3564 || TREE_CODE (op1_type
) != VECTOR_TYPE
)
3566 error ("non-vector operands in vector comparison");
3567 debug_generic_expr (op0_type
);
3568 debug_generic_expr (op1_type
);
3572 if (maybe_ne (TYPE_VECTOR_SUBPARTS (type
),
3573 TYPE_VECTOR_SUBPARTS (op0_type
)))
3575 error ("invalid vector comparison resulting type");
3576 debug_generic_expr (type
);
3582 error ("bogus comparison result type");
3583 debug_generic_expr (type
);
3590 /* Verify a gimple assignment statement STMT with an unary rhs.
3591 Returns true if anything is wrong. */
3594 verify_gimple_assign_unary (gassign
*stmt
)
3596 enum tree_code rhs_code
= gimple_assign_rhs_code (stmt
);
3597 tree lhs
= gimple_assign_lhs (stmt
);
3598 tree lhs_type
= TREE_TYPE (lhs
);
3599 tree rhs1
= gimple_assign_rhs1 (stmt
);
3600 tree rhs1_type
= TREE_TYPE (rhs1
);
3602 if (!is_gimple_reg (lhs
))
3604 error ("non-register as LHS of unary operation");
3608 if (!is_gimple_val (rhs1
))
3610 error ("invalid operand in unary operation");
3614 const char* const code_name
= get_tree_code_name (rhs_code
);
3616 /* First handle conversions. */
3621 /* Allow conversions between vectors with the same number of elements,
3622 provided that the conversion is OK for the element types too. */
3623 if (VECTOR_TYPE_P (lhs_type
)
3624 && VECTOR_TYPE_P (rhs1_type
)
3625 && known_eq (TYPE_VECTOR_SUBPARTS (lhs_type
),
3626 TYPE_VECTOR_SUBPARTS (rhs1_type
)))
3628 lhs_type
= TREE_TYPE (lhs_type
);
3629 rhs1_type
= TREE_TYPE (rhs1_type
);
3631 else if (VECTOR_TYPE_P (lhs_type
) || VECTOR_TYPE_P (rhs1_type
))
3633 error ("invalid vector types in nop conversion");
3634 debug_generic_expr (lhs_type
);
3635 debug_generic_expr (rhs1_type
);
3639 /* Allow conversions from pointer type to integral type only if
3640 there is no sign or zero extension involved.
3641 For targets were the precision of ptrofftype doesn't match that
3642 of pointers we allow conversions to types where
3643 POINTERS_EXTEND_UNSIGNED specifies how that works. */
3644 if ((POINTER_TYPE_P (lhs_type
)
3645 && INTEGRAL_TYPE_P (rhs1_type
))
3646 || (POINTER_TYPE_P (rhs1_type
)
3647 && INTEGRAL_TYPE_P (lhs_type
)
3648 && (TYPE_PRECISION (rhs1_type
) >= TYPE_PRECISION (lhs_type
)
3649 #if defined(POINTERS_EXTEND_UNSIGNED)
3650 || (TYPE_MODE (rhs1_type
) == ptr_mode
3651 && (TYPE_PRECISION (lhs_type
)
3652 == BITS_PER_WORD
/* word_mode */
3653 || (TYPE_PRECISION (lhs_type
)
3654 == GET_MODE_PRECISION (Pmode
))))
3659 /* Allow conversion from integral to offset type and vice versa. */
3660 if ((TREE_CODE (lhs_type
) == OFFSET_TYPE
3661 && INTEGRAL_TYPE_P (rhs1_type
))
3662 || (INTEGRAL_TYPE_P (lhs_type
)
3663 && TREE_CODE (rhs1_type
) == OFFSET_TYPE
))
3666 /* Otherwise assert we are converting between types of the
3668 if (INTEGRAL_TYPE_P (lhs_type
) != INTEGRAL_TYPE_P (rhs1_type
))
3670 error ("invalid types in nop conversion");
3671 debug_generic_expr (lhs_type
);
3672 debug_generic_expr (rhs1_type
);
3679 case ADDR_SPACE_CONVERT_EXPR
:
3681 if (!POINTER_TYPE_P (rhs1_type
) || !POINTER_TYPE_P (lhs_type
)
3682 || (TYPE_ADDR_SPACE (TREE_TYPE (rhs1_type
))
3683 == TYPE_ADDR_SPACE (TREE_TYPE (lhs_type
))))
3685 error ("invalid types in address space conversion");
3686 debug_generic_expr (lhs_type
);
3687 debug_generic_expr (rhs1_type
);
3694 case FIXED_CONVERT_EXPR
:
3696 if (!valid_fixed_convert_types_p (lhs_type
, rhs1_type
)
3697 && !valid_fixed_convert_types_p (rhs1_type
, lhs_type
))
3699 error ("invalid types in fixed-point conversion");
3700 debug_generic_expr (lhs_type
);
3701 debug_generic_expr (rhs1_type
);
3710 if ((!INTEGRAL_TYPE_P (rhs1_type
) || !SCALAR_FLOAT_TYPE_P (lhs_type
))
3711 && (!VECTOR_INTEGER_TYPE_P (rhs1_type
)
3712 || !VECTOR_FLOAT_TYPE_P (lhs_type
)))
3714 error ("invalid types in conversion to floating-point");
3715 debug_generic_expr (lhs_type
);
3716 debug_generic_expr (rhs1_type
);
3723 case FIX_TRUNC_EXPR
:
3725 if ((!INTEGRAL_TYPE_P (lhs_type
) || !SCALAR_FLOAT_TYPE_P (rhs1_type
))
3726 && (!VECTOR_INTEGER_TYPE_P (lhs_type
)
3727 || !VECTOR_FLOAT_TYPE_P (rhs1_type
)))
3729 error ("invalid types in conversion to integer");
3730 debug_generic_expr (lhs_type
);
3731 debug_generic_expr (rhs1_type
);
3738 case VEC_UNPACK_HI_EXPR
:
3739 case VEC_UNPACK_LO_EXPR
:
3740 case VEC_UNPACK_FLOAT_HI_EXPR
:
3741 case VEC_UNPACK_FLOAT_LO_EXPR
:
3742 case VEC_UNPACK_FIX_TRUNC_HI_EXPR
:
3743 case VEC_UNPACK_FIX_TRUNC_LO_EXPR
:
3744 if (TREE_CODE (rhs1_type
) != VECTOR_TYPE
3745 || TREE_CODE (lhs_type
) != VECTOR_TYPE
3746 || (!INTEGRAL_TYPE_P (TREE_TYPE (lhs_type
))
3747 && !SCALAR_FLOAT_TYPE_P (TREE_TYPE (lhs_type
)))
3748 || (!INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type
))
3749 && !SCALAR_FLOAT_TYPE_P (TREE_TYPE (rhs1_type
)))
3750 || ((rhs_code
== VEC_UNPACK_HI_EXPR
3751 || rhs_code
== VEC_UNPACK_LO_EXPR
)
3752 && (INTEGRAL_TYPE_P (TREE_TYPE (lhs_type
))
3753 != INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type
))))
3754 || ((rhs_code
== VEC_UNPACK_FLOAT_HI_EXPR
3755 || rhs_code
== VEC_UNPACK_FLOAT_LO_EXPR
)
3756 && (INTEGRAL_TYPE_P (TREE_TYPE (lhs_type
))
3757 || SCALAR_FLOAT_TYPE_P (TREE_TYPE (rhs1_type
))))
3758 || ((rhs_code
== VEC_UNPACK_FIX_TRUNC_HI_EXPR
3759 || rhs_code
== VEC_UNPACK_FIX_TRUNC_LO_EXPR
)
3760 && (INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type
))
3761 || SCALAR_FLOAT_TYPE_P (TREE_TYPE (lhs_type
))))
3762 || (maybe_ne (GET_MODE_SIZE (element_mode (lhs_type
)),
3763 2 * GET_MODE_SIZE (element_mode (rhs1_type
)))
3764 && (!VECTOR_BOOLEAN_TYPE_P (lhs_type
)
3765 || !VECTOR_BOOLEAN_TYPE_P (rhs1_type
)))
3766 || maybe_ne (2 * TYPE_VECTOR_SUBPARTS (lhs_type
),
3767 TYPE_VECTOR_SUBPARTS (rhs1_type
)))
3769 error ("type mismatch in %qs expression", code_name
);
3770 debug_generic_expr (lhs_type
);
3771 debug_generic_expr (rhs1_type
);
3782 /* Disallow pointer and offset types for many of the unary gimple. */
3783 if (POINTER_TYPE_P (lhs_type
)
3784 || TREE_CODE (lhs_type
) == OFFSET_TYPE
)
3786 error ("invalid types for %qs", code_name
);
3787 debug_generic_expr (lhs_type
);
3788 debug_generic_expr (rhs1_type
);
3794 if (!ANY_INTEGRAL_TYPE_P (lhs_type
)
3795 || !TYPE_UNSIGNED (lhs_type
)
3796 || !ANY_INTEGRAL_TYPE_P (rhs1_type
)
3797 || TYPE_UNSIGNED (rhs1_type
)
3798 || element_precision (lhs_type
) != element_precision (rhs1_type
))
3800 error ("invalid types for %qs", code_name
);
3801 debug_generic_expr (lhs_type
);
3802 debug_generic_expr (rhs1_type
);
3807 case VEC_DUPLICATE_EXPR
:
3808 if (TREE_CODE (lhs_type
) != VECTOR_TYPE
3809 || !useless_type_conversion_p (TREE_TYPE (lhs_type
), rhs1_type
))
3811 error ("%qs should be from a scalar to a like vector", code_name
);
3812 debug_generic_expr (lhs_type
);
3813 debug_generic_expr (rhs1_type
);
3822 /* For the remaining codes assert there is no conversion involved. */
3823 if (!useless_type_conversion_p (lhs_type
, rhs1_type
))
3825 error ("non-trivial conversion in unary operation");
3826 debug_generic_expr (lhs_type
);
3827 debug_generic_expr (rhs1_type
);
3834 /* Verify a gimple assignment statement STMT with a binary rhs.
3835 Returns true if anything is wrong. */
3838 verify_gimple_assign_binary (gassign
*stmt
)
3840 enum tree_code rhs_code
= gimple_assign_rhs_code (stmt
);
3841 tree lhs
= gimple_assign_lhs (stmt
);
3842 tree lhs_type
= TREE_TYPE (lhs
);
3843 tree rhs1
= gimple_assign_rhs1 (stmt
);
3844 tree rhs1_type
= TREE_TYPE (rhs1
);
3845 tree rhs2
= gimple_assign_rhs2 (stmt
);
3846 tree rhs2_type
= TREE_TYPE (rhs2
);
3848 if (!is_gimple_reg (lhs
))
3850 error ("non-register as LHS of binary operation");
3854 if (!is_gimple_val (rhs1
)
3855 || !is_gimple_val (rhs2
))
3857 error ("invalid operands in binary operation");
3861 const char* const code_name
= get_tree_code_name (rhs_code
);
3863 /* First handle operations that involve different types. */
3868 if (TREE_CODE (lhs_type
) != COMPLEX_TYPE
3869 || !(INTEGRAL_TYPE_P (rhs1_type
)
3870 || SCALAR_FLOAT_TYPE_P (rhs1_type
))
3871 || !(INTEGRAL_TYPE_P (rhs2_type
)
3872 || SCALAR_FLOAT_TYPE_P (rhs2_type
)))
3874 error ("type mismatch in %qs", code_name
);
3875 debug_generic_expr (lhs_type
);
3876 debug_generic_expr (rhs1_type
);
3877 debug_generic_expr (rhs2_type
);
3889 /* Shifts and rotates are ok on integral types, fixed point
3890 types and integer vector types. */
3891 if ((!INTEGRAL_TYPE_P (rhs1_type
)
3892 && !FIXED_POINT_TYPE_P (rhs1_type
)
3893 && !(TREE_CODE (rhs1_type
) == VECTOR_TYPE
3894 && INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type
))))
3895 || (!INTEGRAL_TYPE_P (rhs2_type
)
3896 /* Vector shifts of vectors are also ok. */
3897 && !(TREE_CODE (rhs1_type
) == VECTOR_TYPE
3898 && INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type
))
3899 && TREE_CODE (rhs2_type
) == VECTOR_TYPE
3900 && INTEGRAL_TYPE_P (TREE_TYPE (rhs2_type
))))
3901 || !useless_type_conversion_p (lhs_type
, rhs1_type
))
3903 error ("type mismatch in %qs", code_name
);
3904 debug_generic_expr (lhs_type
);
3905 debug_generic_expr (rhs1_type
);
3906 debug_generic_expr (rhs2_type
);
3913 case WIDEN_LSHIFT_EXPR
:
3915 if (!INTEGRAL_TYPE_P (lhs_type
)
3916 || !INTEGRAL_TYPE_P (rhs1_type
)
3917 || TREE_CODE (rhs2
) != INTEGER_CST
3918 || (2 * TYPE_PRECISION (rhs1_type
) > TYPE_PRECISION (lhs_type
)))
3920 error ("type mismatch in %qs", code_name
);
3921 debug_generic_expr (lhs_type
);
3922 debug_generic_expr (rhs1_type
);
3923 debug_generic_expr (rhs2_type
);
3930 case VEC_WIDEN_LSHIFT_HI_EXPR
:
3931 case VEC_WIDEN_LSHIFT_LO_EXPR
:
3933 if (TREE_CODE (rhs1_type
) != VECTOR_TYPE
3934 || TREE_CODE (lhs_type
) != VECTOR_TYPE
3935 || !INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type
))
3936 || !INTEGRAL_TYPE_P (TREE_TYPE (lhs_type
))
3937 || TREE_CODE (rhs2
) != INTEGER_CST
3938 || (2 * TYPE_PRECISION (TREE_TYPE (rhs1_type
))
3939 > TYPE_PRECISION (TREE_TYPE (lhs_type
))))
3941 error ("type mismatch in %qs", code_name
);
3942 debug_generic_expr (lhs_type
);
3943 debug_generic_expr (rhs1_type
);
3944 debug_generic_expr (rhs2_type
);
3951 case WIDEN_PLUS_EXPR
:
3952 case WIDEN_MINUS_EXPR
:
3956 tree lhs_etype
= lhs_type
;
3957 tree rhs1_etype
= rhs1_type
;
3958 tree rhs2_etype
= rhs2_type
;
3959 if (TREE_CODE (lhs_type
) == VECTOR_TYPE
)
3961 if (TREE_CODE (rhs1_type
) != VECTOR_TYPE
3962 || TREE_CODE (rhs2_type
) != VECTOR_TYPE
)
3964 error ("invalid non-vector operands to %qs", code_name
);
3967 lhs_etype
= TREE_TYPE (lhs_type
);
3968 rhs1_etype
= TREE_TYPE (rhs1_type
);
3969 rhs2_etype
= TREE_TYPE (rhs2_type
);
3971 if (POINTER_TYPE_P (lhs_etype
)
3972 || POINTER_TYPE_P (rhs1_etype
)
3973 || POINTER_TYPE_P (rhs2_etype
))
3975 error ("invalid (pointer) operands %qs", code_name
);
3979 /* Continue with generic binary expression handling. */
3983 case POINTER_PLUS_EXPR
:
3985 if (!POINTER_TYPE_P (rhs1_type
)
3986 || !useless_type_conversion_p (lhs_type
, rhs1_type
)
3987 || !ptrofftype_p (rhs2_type
))
3989 error ("type mismatch in %qs", code_name
);
3990 debug_generic_stmt (lhs_type
);
3991 debug_generic_stmt (rhs1_type
);
3992 debug_generic_stmt (rhs2_type
);
3999 case POINTER_DIFF_EXPR
:
4001 if (!POINTER_TYPE_P (rhs1_type
)
4002 || !POINTER_TYPE_P (rhs2_type
)
4003 /* Because we special-case pointers to void we allow difference
4004 of arbitrary pointers with the same mode. */
4005 || TYPE_MODE (rhs1_type
) != TYPE_MODE (rhs2_type
)
4006 || !INTEGRAL_TYPE_P (lhs_type
)
4007 || TYPE_UNSIGNED (lhs_type
)
4008 || TYPE_PRECISION (lhs_type
) != TYPE_PRECISION (rhs1_type
))
4010 error ("type mismatch in %qs", code_name
);
4011 debug_generic_stmt (lhs_type
);
4012 debug_generic_stmt (rhs1_type
);
4013 debug_generic_stmt (rhs2_type
);
4020 case TRUTH_ANDIF_EXPR
:
4021 case TRUTH_ORIF_EXPR
:
4022 case TRUTH_AND_EXPR
:
4024 case TRUTH_XOR_EXPR
:
4034 case UNORDERED_EXPR
:
4042 /* Comparisons are also binary, but the result type is not
4043 connected to the operand types. */
4044 return verify_gimple_comparison (lhs_type
, rhs1
, rhs2
, rhs_code
);
4046 case WIDEN_MULT_EXPR
:
4047 if (TREE_CODE (lhs_type
) != INTEGER_TYPE
)
4049 return ((2 * TYPE_PRECISION (rhs1_type
) > TYPE_PRECISION (lhs_type
))
4050 || (TYPE_PRECISION (rhs1_type
) != TYPE_PRECISION (rhs2_type
)));
4052 case WIDEN_SUM_EXPR
:
4054 if (((TREE_CODE (rhs1_type
) != VECTOR_TYPE
4055 || TREE_CODE (lhs_type
) != VECTOR_TYPE
)
4056 && ((!INTEGRAL_TYPE_P (rhs1_type
)
4057 && !SCALAR_FLOAT_TYPE_P (rhs1_type
))
4058 || (!INTEGRAL_TYPE_P (lhs_type
)
4059 && !SCALAR_FLOAT_TYPE_P (lhs_type
))))
4060 || !useless_type_conversion_p (lhs_type
, rhs2_type
)
4061 || maybe_lt (GET_MODE_SIZE (element_mode (rhs2_type
)),
4062 2 * GET_MODE_SIZE (element_mode (rhs1_type
))))
4064 error ("type mismatch in %qs", code_name
);
4065 debug_generic_expr (lhs_type
);
4066 debug_generic_expr (rhs1_type
);
4067 debug_generic_expr (rhs2_type
);
4073 case VEC_WIDEN_MINUS_HI_EXPR
:
4074 case VEC_WIDEN_MINUS_LO_EXPR
:
4075 case VEC_WIDEN_PLUS_HI_EXPR
:
4076 case VEC_WIDEN_PLUS_LO_EXPR
:
4077 case VEC_WIDEN_MULT_HI_EXPR
:
4078 case VEC_WIDEN_MULT_LO_EXPR
:
4079 case VEC_WIDEN_MULT_EVEN_EXPR
:
4080 case VEC_WIDEN_MULT_ODD_EXPR
:
4082 if (TREE_CODE (rhs1_type
) != VECTOR_TYPE
4083 || TREE_CODE (lhs_type
) != VECTOR_TYPE
4084 || !types_compatible_p (rhs1_type
, rhs2_type
)
4085 || maybe_ne (GET_MODE_SIZE (element_mode (lhs_type
)),
4086 2 * GET_MODE_SIZE (element_mode (rhs1_type
))))
4088 error ("type mismatch in %qs", code_name
);
4089 debug_generic_expr (lhs_type
);
4090 debug_generic_expr (rhs1_type
);
4091 debug_generic_expr (rhs2_type
);
4097 case VEC_PACK_TRUNC_EXPR
:
4098 /* ??? We currently use VEC_PACK_TRUNC_EXPR to simply concat
4099 vector boolean types. */
4100 if (VECTOR_BOOLEAN_TYPE_P (lhs_type
)
4101 && VECTOR_BOOLEAN_TYPE_P (rhs1_type
)
4102 && types_compatible_p (rhs1_type
, rhs2_type
)
4103 && known_eq (TYPE_VECTOR_SUBPARTS (lhs_type
),
4104 2 * TYPE_VECTOR_SUBPARTS (rhs1_type
)))
4108 case VEC_PACK_SAT_EXPR
:
4109 case VEC_PACK_FIX_TRUNC_EXPR
:
4111 if (TREE_CODE (rhs1_type
) != VECTOR_TYPE
4112 || TREE_CODE (lhs_type
) != VECTOR_TYPE
4113 || !((rhs_code
== VEC_PACK_FIX_TRUNC_EXPR
4114 && SCALAR_FLOAT_TYPE_P (TREE_TYPE (rhs1_type
))
4115 && INTEGRAL_TYPE_P (TREE_TYPE (lhs_type
)))
4116 || (INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type
))
4117 == INTEGRAL_TYPE_P (TREE_TYPE (lhs_type
))))
4118 || !types_compatible_p (rhs1_type
, rhs2_type
)
4119 || maybe_ne (GET_MODE_SIZE (element_mode (rhs1_type
)),
4120 2 * GET_MODE_SIZE (element_mode (lhs_type
)))
4121 || maybe_ne (2 * TYPE_VECTOR_SUBPARTS (rhs1_type
),
4122 TYPE_VECTOR_SUBPARTS (lhs_type
)))
4124 error ("type mismatch in %qs", code_name
);
4125 debug_generic_expr (lhs_type
);
4126 debug_generic_expr (rhs1_type
);
4127 debug_generic_expr (rhs2_type
);
4134 case VEC_PACK_FLOAT_EXPR
:
4135 if (TREE_CODE (rhs1_type
) != VECTOR_TYPE
4136 || TREE_CODE (lhs_type
) != VECTOR_TYPE
4137 || !INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type
))
4138 || !SCALAR_FLOAT_TYPE_P (TREE_TYPE (lhs_type
))
4139 || !types_compatible_p (rhs1_type
, rhs2_type
)
4140 || maybe_ne (GET_MODE_SIZE (element_mode (rhs1_type
)),
4141 2 * GET_MODE_SIZE (element_mode (lhs_type
)))
4142 || maybe_ne (2 * TYPE_VECTOR_SUBPARTS (rhs1_type
),
4143 TYPE_VECTOR_SUBPARTS (lhs_type
)))
4145 error ("type mismatch in %qs", code_name
);
4146 debug_generic_expr (lhs_type
);
4147 debug_generic_expr (rhs1_type
);
4148 debug_generic_expr (rhs2_type
);
4155 case MULT_HIGHPART_EXPR
:
4156 case TRUNC_DIV_EXPR
:
4158 case FLOOR_DIV_EXPR
:
4159 case ROUND_DIV_EXPR
:
4160 case TRUNC_MOD_EXPR
:
4162 case FLOOR_MOD_EXPR
:
4163 case ROUND_MOD_EXPR
:
4165 case EXACT_DIV_EXPR
:
4166 /* Disallow pointer and offset types for many of the binary gimple. */
4167 if (POINTER_TYPE_P (lhs_type
)
4168 || TREE_CODE (lhs_type
) == OFFSET_TYPE
)
4170 error ("invalid types for %qs", code_name
);
4171 debug_generic_expr (lhs_type
);
4172 debug_generic_expr (rhs1_type
);
4173 debug_generic_expr (rhs2_type
);
4176 /* Continue with generic binary expression handling. */
4184 /* Continue with generic binary expression handling. */
4187 case VEC_SERIES_EXPR
:
4188 if (!useless_type_conversion_p (rhs1_type
, rhs2_type
))
4190 error ("type mismatch in %qs", code_name
);
4191 debug_generic_expr (rhs1_type
);
4192 debug_generic_expr (rhs2_type
);
4195 if (TREE_CODE (lhs_type
) != VECTOR_TYPE
4196 || !useless_type_conversion_p (TREE_TYPE (lhs_type
), rhs1_type
))
4198 error ("vector type expected in %qs", code_name
);
4199 debug_generic_expr (lhs_type
);
4208 if (!useless_type_conversion_p (lhs_type
, rhs1_type
)
4209 || !useless_type_conversion_p (lhs_type
, rhs2_type
))
4211 error ("type mismatch in binary expression");
4212 debug_generic_stmt (lhs_type
);
4213 debug_generic_stmt (rhs1_type
);
4214 debug_generic_stmt (rhs2_type
);
4221 /* Verify a gimple assignment statement STMT with a ternary rhs.
4222 Returns true if anything is wrong. */
4225 verify_gimple_assign_ternary (gassign
*stmt
)
4227 enum tree_code rhs_code
= gimple_assign_rhs_code (stmt
);
4228 tree lhs
= gimple_assign_lhs (stmt
);
4229 tree lhs_type
= TREE_TYPE (lhs
);
4230 tree rhs1
= gimple_assign_rhs1 (stmt
);
4231 tree rhs1_type
= TREE_TYPE (rhs1
);
4232 tree rhs2
= gimple_assign_rhs2 (stmt
);
4233 tree rhs2_type
= TREE_TYPE (rhs2
);
4234 tree rhs3
= gimple_assign_rhs3 (stmt
);
4235 tree rhs3_type
= TREE_TYPE (rhs3
);
4237 if (!is_gimple_reg (lhs
))
4239 error ("non-register as LHS of ternary operation");
4243 if ((rhs_code
== COND_EXPR
4244 ? !is_gimple_condexpr (rhs1
) : !is_gimple_val (rhs1
))
4245 || !is_gimple_val (rhs2
)
4246 || !is_gimple_val (rhs3
))
4248 error ("invalid operands in ternary operation");
4252 const char* const code_name
= get_tree_code_name (rhs_code
);
4254 /* First handle operations that involve different types. */
4257 case WIDEN_MULT_PLUS_EXPR
:
4258 case WIDEN_MULT_MINUS_EXPR
:
4259 if ((!INTEGRAL_TYPE_P (rhs1_type
)
4260 && !FIXED_POINT_TYPE_P (rhs1_type
))
4261 || !useless_type_conversion_p (rhs1_type
, rhs2_type
)
4262 || !useless_type_conversion_p (lhs_type
, rhs3_type
)
4263 || 2 * TYPE_PRECISION (rhs1_type
) > TYPE_PRECISION (lhs_type
)
4264 || TYPE_PRECISION (rhs1_type
) != TYPE_PRECISION (rhs2_type
))
4266 error ("type mismatch in %qs", code_name
);
4267 debug_generic_expr (lhs_type
);
4268 debug_generic_expr (rhs1_type
);
4269 debug_generic_expr (rhs2_type
);
4270 debug_generic_expr (rhs3_type
);
4276 if (!VECTOR_BOOLEAN_TYPE_P (rhs1_type
)
4277 || maybe_ne (TYPE_VECTOR_SUBPARTS (rhs1_type
),
4278 TYPE_VECTOR_SUBPARTS (lhs_type
)))
4280 error ("the first argument of a %qs must be of a "
4281 "boolean vector type of the same number of elements "
4282 "as the result", code_name
);
4283 debug_generic_expr (lhs_type
);
4284 debug_generic_expr (rhs1_type
);
4287 if (!is_gimple_val (rhs1
))
4291 if (!is_gimple_val (rhs1
)
4292 && (!is_gimple_condexpr (rhs1
)
4293 || verify_gimple_comparison (TREE_TYPE (rhs1
),
4294 TREE_OPERAND (rhs1
, 0),
4295 TREE_OPERAND (rhs1
, 1),
4298 if (!useless_type_conversion_p (lhs_type
, rhs2_type
)
4299 || !useless_type_conversion_p (lhs_type
, rhs3_type
))
4301 error ("type mismatch in %qs", code_name
);
4302 debug_generic_expr (lhs_type
);
4303 debug_generic_expr (rhs2_type
);
4304 debug_generic_expr (rhs3_type
);
4310 if (!useless_type_conversion_p (lhs_type
, rhs1_type
)
4311 || !useless_type_conversion_p (lhs_type
, rhs2_type
))
4313 error ("type mismatch in %qs", code_name
);
4314 debug_generic_expr (lhs_type
);
4315 debug_generic_expr (rhs1_type
);
4316 debug_generic_expr (rhs2_type
);
4317 debug_generic_expr (rhs3_type
);
4321 if (TREE_CODE (rhs1_type
) != VECTOR_TYPE
4322 || TREE_CODE (rhs2_type
) != VECTOR_TYPE
4323 || TREE_CODE (rhs3_type
) != VECTOR_TYPE
)
4325 error ("vector types expected in %qs", code_name
);
4326 debug_generic_expr (lhs_type
);
4327 debug_generic_expr (rhs1_type
);
4328 debug_generic_expr (rhs2_type
);
4329 debug_generic_expr (rhs3_type
);
4333 if (maybe_ne (TYPE_VECTOR_SUBPARTS (rhs1_type
),
4334 TYPE_VECTOR_SUBPARTS (rhs2_type
))
4335 || maybe_ne (TYPE_VECTOR_SUBPARTS (rhs2_type
),
4336 TYPE_VECTOR_SUBPARTS (rhs3_type
))
4337 || maybe_ne (TYPE_VECTOR_SUBPARTS (rhs3_type
),
4338 TYPE_VECTOR_SUBPARTS (lhs_type
)))
4340 error ("vectors with different element number found in %qs",
4342 debug_generic_expr (lhs_type
);
4343 debug_generic_expr (rhs1_type
);
4344 debug_generic_expr (rhs2_type
);
4345 debug_generic_expr (rhs3_type
);
4349 if (TREE_CODE (TREE_TYPE (rhs3_type
)) != INTEGER_TYPE
4350 || (TREE_CODE (rhs3
) != VECTOR_CST
4351 && (GET_MODE_BITSIZE (SCALAR_INT_TYPE_MODE
4352 (TREE_TYPE (rhs3_type
)))
4353 != GET_MODE_BITSIZE (SCALAR_TYPE_MODE
4354 (TREE_TYPE (rhs1_type
))))))
4356 error ("invalid mask type in %qs", code_name
);
4357 debug_generic_expr (lhs_type
);
4358 debug_generic_expr (rhs1_type
);
4359 debug_generic_expr (rhs2_type
);
4360 debug_generic_expr (rhs3_type
);
4367 if (!useless_type_conversion_p (rhs1_type
, rhs2_type
)
4368 || !useless_type_conversion_p (lhs_type
, rhs3_type
)
4369 || 2 * GET_MODE_UNIT_BITSIZE (TYPE_MODE (TREE_TYPE (rhs1_type
)))
4370 > GET_MODE_UNIT_BITSIZE (TYPE_MODE (TREE_TYPE (lhs_type
))))
4372 error ("type mismatch in %qs", code_name
);
4373 debug_generic_expr (lhs_type
);
4374 debug_generic_expr (rhs1_type
);
4375 debug_generic_expr (rhs2_type
);
4376 debug_generic_expr (rhs3_type
);
4380 if (TREE_CODE (rhs1_type
) != VECTOR_TYPE
4381 || TREE_CODE (rhs2_type
) != VECTOR_TYPE
4382 || TREE_CODE (rhs3_type
) != VECTOR_TYPE
)
4384 error ("vector types expected in %qs", code_name
);
4385 debug_generic_expr (lhs_type
);
4386 debug_generic_expr (rhs1_type
);
4387 debug_generic_expr (rhs2_type
);
4388 debug_generic_expr (rhs3_type
);
4394 case BIT_INSERT_EXPR
:
4395 if (! useless_type_conversion_p (lhs_type
, rhs1_type
))
4397 error ("type mismatch in %qs", code_name
);
4398 debug_generic_expr (lhs_type
);
4399 debug_generic_expr (rhs1_type
);
4402 if (! ((INTEGRAL_TYPE_P (rhs1_type
)
4403 && INTEGRAL_TYPE_P (rhs2_type
))
4404 /* Vector element insert. */
4405 || (VECTOR_TYPE_P (rhs1_type
)
4406 && types_compatible_p (TREE_TYPE (rhs1_type
), rhs2_type
))
4407 /* Aligned sub-vector insert. */
4408 || (VECTOR_TYPE_P (rhs1_type
)
4409 && VECTOR_TYPE_P (rhs2_type
)
4410 && types_compatible_p (TREE_TYPE (rhs1_type
),
4411 TREE_TYPE (rhs2_type
))
4412 && multiple_p (TYPE_VECTOR_SUBPARTS (rhs1_type
),
4413 TYPE_VECTOR_SUBPARTS (rhs2_type
))
4414 && multiple_p (wi::to_poly_offset (rhs3
),
4415 wi::to_poly_offset (TYPE_SIZE (rhs2_type
))))))
4417 error ("not allowed type combination in %qs", code_name
);
4418 debug_generic_expr (rhs1_type
);
4419 debug_generic_expr (rhs2_type
);
4422 if (! tree_fits_uhwi_p (rhs3
)
4423 || ! types_compatible_p (bitsizetype
, TREE_TYPE (rhs3
))
4424 || ! tree_fits_uhwi_p (TYPE_SIZE (rhs2_type
)))
4426 error ("invalid position or size in %qs", code_name
);
4429 if (INTEGRAL_TYPE_P (rhs1_type
)
4430 && !type_has_mode_precision_p (rhs1_type
))
4432 error ("%qs into non-mode-precision operand", code_name
);
4435 if (INTEGRAL_TYPE_P (rhs1_type
))
4437 unsigned HOST_WIDE_INT bitpos
= tree_to_uhwi (rhs3
);
4438 if (bitpos
>= TYPE_PRECISION (rhs1_type
)
4439 || (bitpos
+ TYPE_PRECISION (rhs2_type
)
4440 > TYPE_PRECISION (rhs1_type
)))
4442 error ("insertion out of range in %qs", code_name
);
4446 else if (VECTOR_TYPE_P (rhs1_type
))
4448 unsigned HOST_WIDE_INT bitpos
= tree_to_uhwi (rhs3
);
4449 unsigned HOST_WIDE_INT bitsize
= tree_to_uhwi (TYPE_SIZE (rhs2_type
));
4450 if (bitpos
% bitsize
!= 0)
4452 error ("%qs not at element boundary", code_name
);
4460 if (((TREE_CODE (rhs1_type
) != VECTOR_TYPE
4461 || TREE_CODE (lhs_type
) != VECTOR_TYPE
)
4462 && ((!INTEGRAL_TYPE_P (rhs1_type
)
4463 && !SCALAR_FLOAT_TYPE_P (rhs1_type
))
4464 || (!INTEGRAL_TYPE_P (lhs_type
)
4465 && !SCALAR_FLOAT_TYPE_P (lhs_type
))))
4466 /* rhs1_type and rhs2_type may differ in sign. */
4467 || !tree_nop_conversion_p (rhs1_type
, rhs2_type
)
4468 || !useless_type_conversion_p (lhs_type
, rhs3_type
)
4469 || maybe_lt (GET_MODE_SIZE (element_mode (rhs3_type
)),
4470 2 * GET_MODE_SIZE (element_mode (rhs1_type
))))
4472 error ("type mismatch in %qs", code_name
);
4473 debug_generic_expr (lhs_type
);
4474 debug_generic_expr (rhs1_type
);
4475 debug_generic_expr (rhs2_type
);
4481 case REALIGN_LOAD_EXPR
:
4491 /* Verify a gimple assignment statement STMT with a single rhs.
4492 Returns true if anything is wrong. */
4495 verify_gimple_assign_single (gassign
*stmt
)
4497 enum tree_code rhs_code
= gimple_assign_rhs_code (stmt
);
4498 tree lhs
= gimple_assign_lhs (stmt
);
4499 tree lhs_type
= TREE_TYPE (lhs
);
4500 tree rhs1
= gimple_assign_rhs1 (stmt
);
4501 tree rhs1_type
= TREE_TYPE (rhs1
);
4504 const char* const code_name
= get_tree_code_name (rhs_code
);
4506 if (!useless_type_conversion_p (lhs_type
, rhs1_type
))
4508 error ("non-trivial conversion in %qs", code_name
);
4509 debug_generic_expr (lhs_type
);
4510 debug_generic_expr (rhs1_type
);
4514 if (gimple_clobber_p (stmt
)
4515 && !(DECL_P (lhs
) || TREE_CODE (lhs
) == MEM_REF
))
4517 error ("%qs LHS in clobber statement",
4518 get_tree_code_name (TREE_CODE (lhs
)));
4519 debug_generic_expr (lhs
);
4523 if (TREE_CODE (lhs
) == WITH_SIZE_EXPR
)
4525 error ("%qs LHS in assignment statement",
4526 get_tree_code_name (TREE_CODE (lhs
)));
4527 debug_generic_expr (lhs
);
4531 if (handled_component_p (lhs
)
4532 || TREE_CODE (lhs
) == MEM_REF
4533 || TREE_CODE (lhs
) == TARGET_MEM_REF
)
4534 res
|= verify_types_in_gimple_reference (lhs
, true);
4536 /* Special codes we cannot handle via their class. */
4541 tree op
= TREE_OPERAND (rhs1
, 0);
4542 if (!is_gimple_addressable (op
))
4544 error ("invalid operand in %qs", code_name
);
4548 /* Technically there is no longer a need for matching types, but
4549 gimple hygiene asks for this check. In LTO we can end up
4550 combining incompatible units and thus end up with addresses
4551 of globals that change their type to a common one. */
4553 && !types_compatible_p (TREE_TYPE (op
),
4554 TREE_TYPE (TREE_TYPE (rhs1
)))
4555 && !one_pointer_to_useless_type_conversion_p (TREE_TYPE (rhs1
),
4558 error ("type mismatch in %qs", code_name
);
4559 debug_generic_stmt (TREE_TYPE (rhs1
));
4560 debug_generic_stmt (TREE_TYPE (op
));
4564 return (verify_address (rhs1
, true)
4565 || verify_types_in_gimple_reference (op
, true));
4570 error ("%qs in gimple IL", code_name
);
4576 case ARRAY_RANGE_REF
:
4577 case VIEW_CONVERT_EXPR
:
4580 case TARGET_MEM_REF
:
4582 if (!is_gimple_reg (lhs
)
4583 && is_gimple_reg_type (TREE_TYPE (lhs
)))
4585 error ("invalid RHS for gimple memory store: %qs", code_name
);
4586 debug_generic_stmt (lhs
);
4587 debug_generic_stmt (rhs1
);
4590 return res
|| verify_types_in_gimple_reference (rhs1
, false);
4602 /* tcc_declaration */
4607 if (!is_gimple_reg (lhs
)
4608 && !is_gimple_reg (rhs1
)
4609 && is_gimple_reg_type (TREE_TYPE (lhs
)))
4611 error ("invalid RHS for gimple memory store: %qs", code_name
);
4612 debug_generic_stmt (lhs
);
4613 debug_generic_stmt (rhs1
);
4619 if (TREE_CODE (rhs1_type
) == VECTOR_TYPE
)
4622 tree elt_i
, elt_v
, elt_t
= NULL_TREE
;
4624 if (CONSTRUCTOR_NELTS (rhs1
) == 0)
4626 /* For vector CONSTRUCTORs we require that either it is empty
4627 CONSTRUCTOR, or it is a CONSTRUCTOR of smaller vector elements
4628 (then the element count must be correct to cover the whole
4629 outer vector and index must be NULL on all elements, or it is
4630 a CONSTRUCTOR of scalar elements, where we as an exception allow
4631 smaller number of elements (assuming zero filling) and
4632 consecutive indexes as compared to NULL indexes (such
4633 CONSTRUCTORs can appear in the IL from FEs). */
4634 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (rhs1
), i
, elt_i
, elt_v
)
4636 if (elt_t
== NULL_TREE
)
4638 elt_t
= TREE_TYPE (elt_v
);
4639 if (TREE_CODE (elt_t
) == VECTOR_TYPE
)
4641 tree elt_t
= TREE_TYPE (elt_v
);
4642 if (!useless_type_conversion_p (TREE_TYPE (rhs1_type
),
4645 error ("incorrect type of vector %qs elements",
4647 debug_generic_stmt (rhs1
);
4650 else if (maybe_ne (CONSTRUCTOR_NELTS (rhs1
)
4651 * TYPE_VECTOR_SUBPARTS (elt_t
),
4652 TYPE_VECTOR_SUBPARTS (rhs1_type
)))
4654 error ("incorrect number of vector %qs elements",
4656 debug_generic_stmt (rhs1
);
4660 else if (!useless_type_conversion_p (TREE_TYPE (rhs1_type
),
4663 error ("incorrect type of vector %qs elements",
4665 debug_generic_stmt (rhs1
);
4668 else if (maybe_gt (CONSTRUCTOR_NELTS (rhs1
),
4669 TYPE_VECTOR_SUBPARTS (rhs1_type
)))
4671 error ("incorrect number of vector %qs elements",
4673 debug_generic_stmt (rhs1
);
4677 else if (!useless_type_conversion_p (elt_t
, TREE_TYPE (elt_v
)))
4679 error ("incorrect type of vector CONSTRUCTOR elements");
4680 debug_generic_stmt (rhs1
);
4683 if (elt_i
!= NULL_TREE
4684 && (TREE_CODE (elt_t
) == VECTOR_TYPE
4685 || TREE_CODE (elt_i
) != INTEGER_CST
4686 || compare_tree_int (elt_i
, i
) != 0))
4688 error ("vector %qs with non-NULL element index",
4690 debug_generic_stmt (rhs1
);
4693 if (!is_gimple_val (elt_v
))
4695 error ("vector %qs element is not a GIMPLE value",
4697 debug_generic_stmt (rhs1
);
4702 else if (CONSTRUCTOR_NELTS (rhs1
) != 0)
4704 error ("non-vector %qs with elements", code_name
);
4705 debug_generic_stmt (rhs1
);
4712 rhs1
= fold (ASSERT_EXPR_COND (rhs1
));
4713 if (rhs1
== boolean_false_node
)
4715 error ("%qs with an always-false condition", code_name
);
4716 debug_generic_stmt (rhs1
);
4721 case WITH_SIZE_EXPR
:
4722 error ("%qs RHS in assignment statement",
4723 get_tree_code_name (rhs_code
));
4724 debug_generic_expr (rhs1
);
4737 /* Verify the contents of a GIMPLE_ASSIGN STMT. Returns true when there
4738 is a problem, otherwise false. */
4741 verify_gimple_assign (gassign
*stmt
)
4743 switch (gimple_assign_rhs_class (stmt
))
4745 case GIMPLE_SINGLE_RHS
:
4746 return verify_gimple_assign_single (stmt
);
4748 case GIMPLE_UNARY_RHS
:
4749 return verify_gimple_assign_unary (stmt
);
4751 case GIMPLE_BINARY_RHS
:
4752 return verify_gimple_assign_binary (stmt
);
4754 case GIMPLE_TERNARY_RHS
:
4755 return verify_gimple_assign_ternary (stmt
);
4762 /* Verify the contents of a GIMPLE_RETURN STMT. Returns true when there
4763 is a problem, otherwise false. */
4766 verify_gimple_return (greturn
*stmt
)
4768 tree op
= gimple_return_retval (stmt
);
4769 tree restype
= TREE_TYPE (TREE_TYPE (cfun
->decl
));
4771 /* We cannot test for present return values as we do not fix up missing
4772 return values from the original source. */
4776 if (!is_gimple_val (op
)
4777 && TREE_CODE (op
) != RESULT_DECL
)
4779 error ("invalid operand in return statement");
4780 debug_generic_stmt (op
);
4784 if ((TREE_CODE (op
) == RESULT_DECL
4785 && DECL_BY_REFERENCE (op
))
4786 || (TREE_CODE (op
) == SSA_NAME
4787 && SSA_NAME_VAR (op
)
4788 && TREE_CODE (SSA_NAME_VAR (op
)) == RESULT_DECL
4789 && DECL_BY_REFERENCE (SSA_NAME_VAR (op
))))
4790 op
= TREE_TYPE (op
);
4792 if (!useless_type_conversion_p (restype
, TREE_TYPE (op
)))
4794 error ("invalid conversion in return statement");
4795 debug_generic_stmt (restype
);
4796 debug_generic_stmt (TREE_TYPE (op
));
4804 /* Verify the contents of a GIMPLE_GOTO STMT. Returns true when there
4805 is a problem, otherwise false. */
4808 verify_gimple_goto (ggoto
*stmt
)
4810 tree dest
= gimple_goto_dest (stmt
);
4812 /* ??? We have two canonical forms of direct goto destinations, a
4813 bare LABEL_DECL and an ADDR_EXPR of a LABEL_DECL. */
4814 if (TREE_CODE (dest
) != LABEL_DECL
4815 && (!is_gimple_val (dest
)
4816 || !POINTER_TYPE_P (TREE_TYPE (dest
))))
4818 error ("goto destination is neither a label nor a pointer");
4825 /* Verify the contents of a GIMPLE_SWITCH STMT. Returns true when there
4826 is a problem, otherwise false. */
4829 verify_gimple_switch (gswitch
*stmt
)
4832 tree elt
, prev_upper_bound
= NULL_TREE
;
4833 tree index_type
, elt_type
= NULL_TREE
;
4835 if (!is_gimple_val (gimple_switch_index (stmt
)))
4837 error ("invalid operand to switch statement");
4838 debug_generic_stmt (gimple_switch_index (stmt
));
4842 index_type
= TREE_TYPE (gimple_switch_index (stmt
));
4843 if (! INTEGRAL_TYPE_P (index_type
))
4845 error ("non-integral type switch statement");
4846 debug_generic_expr (index_type
);
4850 elt
= gimple_switch_label (stmt
, 0);
4851 if (CASE_LOW (elt
) != NULL_TREE
4852 || CASE_HIGH (elt
) != NULL_TREE
4853 || CASE_CHAIN (elt
) != NULL_TREE
)
4855 error ("invalid default case label in switch statement");
4856 debug_generic_expr (elt
);
4860 n
= gimple_switch_num_labels (stmt
);
4861 for (i
= 1; i
< n
; i
++)
4863 elt
= gimple_switch_label (stmt
, i
);
4865 if (CASE_CHAIN (elt
))
4867 error ("invalid %<CASE_CHAIN%>");
4868 debug_generic_expr (elt
);
4871 if (! CASE_LOW (elt
))
4873 error ("invalid case label in switch statement");
4874 debug_generic_expr (elt
);
4878 && ! tree_int_cst_lt (CASE_LOW (elt
), CASE_HIGH (elt
)))
4880 error ("invalid case range in switch statement");
4881 debug_generic_expr (elt
);
4887 elt_type
= TREE_TYPE (CASE_LOW (elt
));
4888 if (TYPE_PRECISION (index_type
) < TYPE_PRECISION (elt_type
))
4890 error ("type precision mismatch in switch statement");
4894 if (TREE_TYPE (CASE_LOW (elt
)) != elt_type
4895 || (CASE_HIGH (elt
) && TREE_TYPE (CASE_HIGH (elt
)) != elt_type
))
4897 error ("type mismatch for case label in switch statement");
4898 debug_generic_expr (elt
);
4902 if (prev_upper_bound
)
4904 if (! tree_int_cst_lt (prev_upper_bound
, CASE_LOW (elt
)))
4906 error ("case labels not sorted in switch statement");
4911 prev_upper_bound
= CASE_HIGH (elt
);
4912 if (! prev_upper_bound
)
4913 prev_upper_bound
= CASE_LOW (elt
);
4919 /* Verify a gimple debug statement STMT.
4920 Returns true if anything is wrong. */
4923 verify_gimple_debug (gimple
*stmt ATTRIBUTE_UNUSED
)
4925 /* There isn't much that could be wrong in a gimple debug stmt. A
4926 gimple debug bind stmt, for example, maps a tree, that's usually
4927 a VAR_DECL or a PARM_DECL, but that could also be some scalarized
4928 component or member of an aggregate type, to another tree, that
4929 can be an arbitrary expression. These stmts expand into debug
4930 insns, and are converted to debug notes by var-tracking.cc. */
4934 /* Verify a gimple label statement STMT.
4935 Returns true if anything is wrong. */
4938 verify_gimple_label (glabel
*stmt
)
4940 tree decl
= gimple_label_label (stmt
);
4944 if (TREE_CODE (decl
) != LABEL_DECL
)
4946 if (!DECL_NONLOCAL (decl
) && !FORCED_LABEL (decl
)
4947 && DECL_CONTEXT (decl
) != current_function_decl
)
4949 error ("label context is not the current function declaration");
4953 uid
= LABEL_DECL_UID (decl
);
4956 || (*label_to_block_map_for_fn (cfun
))[uid
] != gimple_bb (stmt
)))
4958 error ("incorrect entry in %<label_to_block_map%>");
4962 uid
= EH_LANDING_PAD_NR (decl
);
4965 eh_landing_pad lp
= get_eh_landing_pad_from_number (uid
);
4966 if (decl
!= lp
->post_landing_pad
)
4968 error ("incorrect setting of landing pad number");
4976 /* Verify a gimple cond statement STMT.
4977 Returns true if anything is wrong. */
4980 verify_gimple_cond (gcond
*stmt
)
4982 if (TREE_CODE_CLASS (gimple_cond_code (stmt
)) != tcc_comparison
)
4984 error ("invalid comparison code in gimple cond");
4987 if (!(!gimple_cond_true_label (stmt
)
4988 || TREE_CODE (gimple_cond_true_label (stmt
)) == LABEL_DECL
)
4989 || !(!gimple_cond_false_label (stmt
)
4990 || TREE_CODE (gimple_cond_false_label (stmt
)) == LABEL_DECL
))
4992 error ("invalid labels in gimple cond");
4996 return verify_gimple_comparison (boolean_type_node
,
4997 gimple_cond_lhs (stmt
),
4998 gimple_cond_rhs (stmt
),
4999 gimple_cond_code (stmt
));
5002 /* Verify the GIMPLE statement STMT. Returns true if there is an
5003 error, otherwise false. */
5006 verify_gimple_stmt (gimple
*stmt
)
5008 switch (gimple_code (stmt
))
5011 return verify_gimple_assign (as_a
<gassign
*> (stmt
));
5014 return verify_gimple_label (as_a
<glabel
*> (stmt
));
5017 return verify_gimple_call (as_a
<gcall
*> (stmt
));
5020 return verify_gimple_cond (as_a
<gcond
*> (stmt
));
5023 return verify_gimple_goto (as_a
<ggoto
*> (stmt
));
5026 return verify_gimple_switch (as_a
<gswitch
*> (stmt
));
5029 return verify_gimple_return (as_a
<greturn
*> (stmt
));
5034 case GIMPLE_TRANSACTION
:
5035 return verify_gimple_transaction (as_a
<gtransaction
*> (stmt
));
5037 /* Tuples that do not have tree operands. */
5039 case GIMPLE_PREDICT
:
5041 case GIMPLE_EH_DISPATCH
:
5042 case GIMPLE_EH_MUST_NOT_THROW
:
5046 /* OpenMP directives are validated by the FE and never operated
5047 on by the optimizers. Furthermore, GIMPLE_OMP_FOR may contain
5048 non-gimple expressions when the main index variable has had
5049 its address taken. This does not affect the loop itself
5050 because the header of an GIMPLE_OMP_FOR is merely used to determine
5051 how to setup the parallel iteration. */
5055 return verify_gimple_debug (stmt
);
5062 /* Verify the contents of a GIMPLE_PHI. Returns true if there is a problem,
5063 and false otherwise. */
5066 verify_gimple_phi (gphi
*phi
)
5070 tree phi_result
= gimple_phi_result (phi
);
5075 error ("invalid %<PHI%> result");
5079 virtual_p
= virtual_operand_p (phi_result
);
5080 if (TREE_CODE (phi_result
) != SSA_NAME
5082 && SSA_NAME_VAR (phi_result
) != gimple_vop (cfun
)))
5084 error ("invalid %<PHI%> result");
5088 for (i
= 0; i
< gimple_phi_num_args (phi
); i
++)
5090 tree t
= gimple_phi_arg_def (phi
, i
);
5094 error ("missing %<PHI%> def");
5098 /* Addressable variables do have SSA_NAMEs but they
5099 are not considered gimple values. */
5100 else if ((TREE_CODE (t
) == SSA_NAME
5101 && virtual_p
!= virtual_operand_p (t
))
5103 && (TREE_CODE (t
) != SSA_NAME
5104 || SSA_NAME_VAR (t
) != gimple_vop (cfun
)))
5106 && !is_gimple_val (t
)))
5108 error ("invalid %<PHI%> argument");
5109 debug_generic_expr (t
);
5112 #ifdef ENABLE_TYPES_CHECKING
5113 if (!useless_type_conversion_p (TREE_TYPE (phi_result
), TREE_TYPE (t
)))
5115 error ("incompatible types in %<PHI%> argument %u", i
);
5116 debug_generic_stmt (TREE_TYPE (phi_result
));
5117 debug_generic_stmt (TREE_TYPE (t
));
5126 /* Verify the GIMPLE statements inside the sequence STMTS. */
5129 verify_gimple_in_seq_2 (gimple_seq stmts
)
5131 gimple_stmt_iterator ittr
;
5134 for (ittr
= gsi_start (stmts
); !gsi_end_p (ittr
); gsi_next (&ittr
))
5136 gimple
*stmt
= gsi_stmt (ittr
);
5138 switch (gimple_code (stmt
))
5141 err
|= verify_gimple_in_seq_2 (
5142 gimple_bind_body (as_a
<gbind
*> (stmt
)));
5146 err
|= verify_gimple_in_seq_2 (gimple_try_eval (stmt
));
5147 err
|= verify_gimple_in_seq_2 (gimple_try_cleanup (stmt
));
5150 case GIMPLE_EH_FILTER
:
5151 err
|= verify_gimple_in_seq_2 (gimple_eh_filter_failure (stmt
));
5154 case GIMPLE_EH_ELSE
:
5156 geh_else
*eh_else
= as_a
<geh_else
*> (stmt
);
5157 err
|= verify_gimple_in_seq_2 (gimple_eh_else_n_body (eh_else
));
5158 err
|= verify_gimple_in_seq_2 (gimple_eh_else_e_body (eh_else
));
5163 err
|= verify_gimple_in_seq_2 (gimple_catch_handler (
5164 as_a
<gcatch
*> (stmt
)));
5167 case GIMPLE_TRANSACTION
:
5168 err
|= verify_gimple_transaction (as_a
<gtransaction
*> (stmt
));
5173 bool err2
= verify_gimple_stmt (stmt
);
5175 debug_gimple_stmt (stmt
);
5184 /* Verify the contents of a GIMPLE_TRANSACTION. Returns true if there
5185 is a problem, otherwise false. */
5188 verify_gimple_transaction (gtransaction
*stmt
)
5192 lab
= gimple_transaction_label_norm (stmt
);
5193 if (lab
!= NULL
&& TREE_CODE (lab
) != LABEL_DECL
)
5195 lab
= gimple_transaction_label_uninst (stmt
);
5196 if (lab
!= NULL
&& TREE_CODE (lab
) != LABEL_DECL
)
5198 lab
= gimple_transaction_label_over (stmt
);
5199 if (lab
!= NULL
&& TREE_CODE (lab
) != LABEL_DECL
)
5202 return verify_gimple_in_seq_2 (gimple_transaction_body (stmt
));
5206 /* Verify the GIMPLE statements inside the statement list STMTS. */
5209 verify_gimple_in_seq (gimple_seq stmts
)
5211 timevar_push (TV_TREE_STMT_VERIFY
);
5212 if (verify_gimple_in_seq_2 (stmts
))
5213 internal_error ("%<verify_gimple%> failed");
5214 timevar_pop (TV_TREE_STMT_VERIFY
);
5217 /* Return true when the T can be shared. */
5220 tree_node_can_be_shared (tree t
)
5222 if (IS_TYPE_OR_DECL_P (t
)
5223 || TREE_CODE (t
) == SSA_NAME
5224 || TREE_CODE (t
) == IDENTIFIER_NODE
5225 || TREE_CODE (t
) == CASE_LABEL_EXPR
5226 || is_gimple_min_invariant (t
))
5229 if (t
== error_mark_node
)
5235 /* Called via walk_tree. Verify tree sharing. */
5238 verify_node_sharing_1 (tree
*tp
, int *walk_subtrees
, void *data
)
5240 hash_set
<void *> *visited
= (hash_set
<void *> *) data
;
5242 if (tree_node_can_be_shared (*tp
))
5244 *walk_subtrees
= false;
5248 if (visited
->add (*tp
))
5254 /* Called via walk_gimple_stmt. Verify tree sharing. */
5257 verify_node_sharing (tree
*tp
, int *walk_subtrees
, void *data
)
5259 struct walk_stmt_info
*wi
= (struct walk_stmt_info
*) data
;
5260 return verify_node_sharing_1 (tp
, walk_subtrees
, wi
->info
);
5263 static bool eh_error_found
;
5265 verify_eh_throw_stmt_node (gimple
*const &stmt
, const int &,
5266 hash_set
<gimple
*> *visited
)
5268 if (!visited
->contains (stmt
))
5270 error ("dead statement in EH table");
5271 debug_gimple_stmt (stmt
);
5272 eh_error_found
= true;
5277 /* Verify if the location LOCs block is in BLOCKS. */
5280 verify_location (hash_set
<tree
> *blocks
, location_t loc
)
5282 tree block
= LOCATION_BLOCK (loc
);
5283 if (block
!= NULL_TREE
5284 && !blocks
->contains (block
))
5286 error ("location references block not in block tree");
5289 if (block
!= NULL_TREE
)
5290 return verify_location (blocks
, BLOCK_SOURCE_LOCATION (block
));
5294 /* Called via walk_tree. Verify that expressions have no blocks. */
5297 verify_expr_no_block (tree
*tp
, int *walk_subtrees
, void *)
5301 *walk_subtrees
= false;
5305 location_t loc
= EXPR_LOCATION (*tp
);
5306 if (LOCATION_BLOCK (loc
) != NULL
)
5312 /* Called via walk_tree. Verify locations of expressions. */
5315 verify_expr_location_1 (tree
*tp
, int *walk_subtrees
, void *data
)
5317 hash_set
<tree
> *blocks
= (hash_set
<tree
> *) data
;
5320 /* ??? This doesn't really belong here but there's no good place to
5321 stick this remainder of old verify_expr. */
5322 /* ??? This barfs on debug stmts which contain binds to vars with
5323 different function context. */
5326 || TREE_CODE (t
) == PARM_DECL
5327 || TREE_CODE (t
) == RESULT_DECL
)
5329 tree context
= decl_function_context (t
);
5330 if (context
!= cfun
->decl
5331 && !SCOPE_FILE_SCOPE_P (context
)
5333 && !DECL_EXTERNAL (t
))
5335 error ("local declaration from a different function");
5341 if (VAR_P (t
) && DECL_HAS_DEBUG_EXPR_P (t
))
5343 tree x
= DECL_DEBUG_EXPR (t
);
5344 tree addr
= walk_tree (&x
, verify_expr_no_block
, NULL
, NULL
);
5349 || TREE_CODE (t
) == PARM_DECL
5350 || TREE_CODE (t
) == RESULT_DECL
)
5351 && DECL_HAS_VALUE_EXPR_P (t
))
5353 tree x
= DECL_VALUE_EXPR (t
);
5354 tree addr
= walk_tree (&x
, verify_expr_no_block
, NULL
, NULL
);
5361 *walk_subtrees
= false;
5365 location_t loc
= EXPR_LOCATION (t
);
5366 if (verify_location (blocks
, loc
))
5372 /* Called via walk_gimple_op. Verify locations of expressions. */
5375 verify_expr_location (tree
*tp
, int *walk_subtrees
, void *data
)
5377 struct walk_stmt_info
*wi
= (struct walk_stmt_info
*) data
;
5378 return verify_expr_location_1 (tp
, walk_subtrees
, wi
->info
);
5381 /* Insert all subblocks of BLOCK into BLOCKS and recurse. */
5384 collect_subblocks (hash_set
<tree
> *blocks
, tree block
)
5387 for (t
= BLOCK_SUBBLOCKS (block
); t
; t
= BLOCK_CHAIN (t
))
5390 collect_subblocks (blocks
, t
);
5394 /* Disable warnings about missing quoting in GCC diagnostics for
5395 the verification errors. Their format strings don't follow
5396 GCC diagnostic conventions and trigger an ICE in the end. */
5398 # pragma GCC diagnostic push
5399 # pragma GCC diagnostic ignored "-Wformat-diag"
5402 /* Verify the GIMPLE statements in the CFG of FN. */
5405 verify_gimple_in_cfg (struct function
*fn
, bool verify_nothrow
)
5410 timevar_push (TV_TREE_STMT_VERIFY
);
5411 hash_set
<void *> visited
;
5412 hash_set
<gimple
*> visited_throwing_stmts
;
5414 /* Collect all BLOCKs referenced by the BLOCK tree of FN. */
5415 hash_set
<tree
> blocks
;
5416 if (DECL_INITIAL (fn
->decl
))
5418 blocks
.add (DECL_INITIAL (fn
->decl
));
5419 collect_subblocks (&blocks
, DECL_INITIAL (fn
->decl
));
5422 FOR_EACH_BB_FN (bb
, fn
)
5424 gimple_stmt_iterator gsi
;
5428 for (gphi_iterator gpi
= gsi_start_phis (bb
);
5432 gphi
*phi
= gpi
.phi ();
5436 if (gimple_bb (phi
) != bb
)
5438 error ("gimple_bb (phi) is set to a wrong basic block");
5442 err2
|= verify_gimple_phi (phi
);
5444 /* Only PHI arguments have locations. */
5445 if (gimple_location (phi
) != UNKNOWN_LOCATION
)
5447 error ("PHI node with location");
5451 for (i
= 0; i
< gimple_phi_num_args (phi
); i
++)
5453 tree arg
= gimple_phi_arg_def (phi
, i
);
5454 tree addr
= walk_tree (&arg
, verify_node_sharing_1
,
5458 error ("incorrect sharing of tree nodes");
5459 debug_generic_expr (addr
);
5462 location_t loc
= gimple_phi_arg_location (phi
, i
);
5463 if (virtual_operand_p (gimple_phi_result (phi
))
5464 && loc
!= UNKNOWN_LOCATION
)
5466 error ("virtual PHI with argument locations");
5469 addr
= walk_tree (&arg
, verify_expr_location_1
, &blocks
, NULL
);
5472 debug_generic_expr (addr
);
5475 err2
|= verify_location (&blocks
, loc
);
5479 debug_gimple_stmt (phi
);
5483 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
5485 gimple
*stmt
= gsi_stmt (gsi
);
5487 struct walk_stmt_info wi
;
5491 if (gimple_bb (stmt
) != bb
)
5493 error ("gimple_bb (stmt) is set to a wrong basic block");
5497 err2
|= verify_gimple_stmt (stmt
);
5498 err2
|= verify_location (&blocks
, gimple_location (stmt
));
5500 memset (&wi
, 0, sizeof (wi
));
5501 wi
.info
= (void *) &visited
;
5502 addr
= walk_gimple_op (stmt
, verify_node_sharing
, &wi
);
5505 error ("incorrect sharing of tree nodes");
5506 debug_generic_expr (addr
);
5510 memset (&wi
, 0, sizeof (wi
));
5511 wi
.info
= (void *) &blocks
;
5512 addr
= walk_gimple_op (stmt
, verify_expr_location
, &wi
);
5515 debug_generic_expr (addr
);
5519 /* If the statement is marked as part of an EH region, then it is
5520 expected that the statement could throw. Verify that when we
5521 have optimizations that simplify statements such that we prove
5522 that they cannot throw, that we update other data structures
5524 lp_nr
= lookup_stmt_eh_lp (stmt
);
5526 visited_throwing_stmts
.add (stmt
);
5529 if (!stmt_could_throw_p (cfun
, stmt
))
5533 error ("statement marked for throw, but doesn%'t");
5537 else if (!gsi_one_before_end_p (gsi
))
5539 error ("statement marked for throw in middle of block");
5545 debug_gimple_stmt (stmt
);
5549 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
5550 if (e
->goto_locus
!= UNKNOWN_LOCATION
)
5551 err
|= verify_location (&blocks
, e
->goto_locus
);
5554 hash_map
<gimple
*, int> *eh_table
= get_eh_throw_stmt_table (cfun
);
5555 eh_error_found
= false;
5557 eh_table
->traverse
<hash_set
<gimple
*> *, verify_eh_throw_stmt_node
>
5558 (&visited_throwing_stmts
);
5560 if (err
|| eh_error_found
)
5561 internal_error ("verify_gimple failed");
5563 verify_histograms ();
5564 timevar_pop (TV_TREE_STMT_VERIFY
);
5568 /* Verifies that the flow information is OK. */
5571 gimple_verify_flow_info (void)
5575 gimple_stmt_iterator gsi
;
5580 if (ENTRY_BLOCK_PTR_FOR_FN (cfun
)->il
.gimple
.seq
5581 || ENTRY_BLOCK_PTR_FOR_FN (cfun
)->il
.gimple
.phi_nodes
)
5583 error ("ENTRY_BLOCK has IL associated with it");
5587 if (EXIT_BLOCK_PTR_FOR_FN (cfun
)->il
.gimple
.seq
5588 || EXIT_BLOCK_PTR_FOR_FN (cfun
)->il
.gimple
.phi_nodes
)
5590 error ("EXIT_BLOCK has IL associated with it");
5594 FOR_EACH_EDGE (e
, ei
, EXIT_BLOCK_PTR_FOR_FN (cfun
)->preds
)
5595 if (e
->flags
& EDGE_FALLTHRU
)
5597 error ("fallthru to exit from bb %d", e
->src
->index
);
5601 FOR_EACH_BB_FN (bb
, cfun
)
5603 bool found_ctrl_stmt
= false;
5607 /* Skip labels on the start of basic block. */
5608 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
5611 gimple
*prev_stmt
= stmt
;
5613 stmt
= gsi_stmt (gsi
);
5615 if (gimple_code (stmt
) != GIMPLE_LABEL
)
5618 label
= gimple_label_label (as_a
<glabel
*> (stmt
));
5619 if (prev_stmt
&& DECL_NONLOCAL (label
))
5621 error ("nonlocal label %qD is not first in a sequence "
5622 "of labels in bb %d", label
, bb
->index
);
5626 if (prev_stmt
&& EH_LANDING_PAD_NR (label
) != 0)
5628 error ("EH landing pad label %qD is not first in a sequence "
5629 "of labels in bb %d", label
, bb
->index
);
5633 if (label_to_block (cfun
, label
) != bb
)
5635 error ("label %qD to block does not match in bb %d",
5640 if (decl_function_context (label
) != current_function_decl
)
5642 error ("label %qD has incorrect context in bb %d",
5648 /* Verify that body of basic block BB is free of control flow. */
5649 for (; !gsi_end_p (gsi
); gsi_next (&gsi
))
5651 gimple
*stmt
= gsi_stmt (gsi
);
5653 if (found_ctrl_stmt
)
5655 error ("control flow in the middle of basic block %d",
5660 if (stmt_ends_bb_p (stmt
))
5661 found_ctrl_stmt
= true;
5663 if (glabel
*label_stmt
= dyn_cast
<glabel
*> (stmt
))
5665 error ("label %qD in the middle of basic block %d",
5666 gimple_label_label (label_stmt
), bb
->index
);
5671 gsi
= gsi_last_nondebug_bb (bb
);
5672 if (gsi_end_p (gsi
))
5675 stmt
= gsi_stmt (gsi
);
5677 if (gimple_code (stmt
) == GIMPLE_LABEL
)
5680 err
|= verify_eh_edges (stmt
);
5682 if (is_ctrl_stmt (stmt
))
5684 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
5685 if (e
->flags
& EDGE_FALLTHRU
)
5687 error ("fallthru edge after a control statement in bb %d",
5693 if (gimple_code (stmt
) != GIMPLE_COND
)
5695 /* Verify that there are no edges with EDGE_TRUE/FALSE_FLAG set
5696 after anything else but if statement. */
5697 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
5698 if (e
->flags
& (EDGE_TRUE_VALUE
| EDGE_FALSE_VALUE
))
5700 error ("true/false edge after a non-GIMPLE_COND in bb %d",
5706 switch (gimple_code (stmt
))
5713 extract_true_false_edges_from_block (bb
, &true_edge
, &false_edge
);
5717 || !(true_edge
->flags
& EDGE_TRUE_VALUE
)
5718 || !(false_edge
->flags
& EDGE_FALSE_VALUE
)
5719 || (true_edge
->flags
& (EDGE_FALLTHRU
| EDGE_ABNORMAL
))
5720 || (false_edge
->flags
& (EDGE_FALLTHRU
| EDGE_ABNORMAL
))
5721 || EDGE_COUNT (bb
->succs
) >= 3)
5723 error ("wrong outgoing edge flags at end of bb %d",
5731 if (simple_goto_p (stmt
))
5733 error ("explicit goto at end of bb %d", bb
->index
);
5738 /* FIXME. We should double check that the labels in the
5739 destination blocks have their address taken. */
5740 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
5741 if ((e
->flags
& (EDGE_FALLTHRU
| EDGE_TRUE_VALUE
5742 | EDGE_FALSE_VALUE
))
5743 || !(e
->flags
& EDGE_ABNORMAL
))
5745 error ("wrong outgoing edge flags at end of bb %d",
5753 if (!gimple_call_builtin_p (stmt
, BUILT_IN_RETURN
))
5757 if (!single_succ_p (bb
)
5758 || (single_succ_edge (bb
)->flags
5759 & (EDGE_FALLTHRU
| EDGE_ABNORMAL
5760 | EDGE_TRUE_VALUE
| EDGE_FALSE_VALUE
)))
5762 error ("wrong outgoing edge flags at end of bb %d", bb
->index
);
5765 if (single_succ (bb
) != EXIT_BLOCK_PTR_FOR_FN (cfun
))
5767 error ("return edge does not point to exit in bb %d",
5775 gswitch
*switch_stmt
= as_a
<gswitch
*> (stmt
);
5780 n
= gimple_switch_num_labels (switch_stmt
);
5782 /* Mark all the destination basic blocks. */
5783 for (i
= 0; i
< n
; ++i
)
5785 basic_block label_bb
= gimple_switch_label_bb (cfun
, switch_stmt
, i
);
5786 gcc_assert (!label_bb
->aux
|| label_bb
->aux
== (void *)1);
5787 label_bb
->aux
= (void *)1;
5790 /* Verify that the case labels are sorted. */
5791 prev
= gimple_switch_label (switch_stmt
, 0);
5792 for (i
= 1; i
< n
; ++i
)
5794 tree c
= gimple_switch_label (switch_stmt
, i
);
5797 error ("found default case not at the start of "
5803 && !tree_int_cst_lt (CASE_LOW (prev
), CASE_LOW (c
)))
5805 error ("case labels not sorted: ");
5806 print_generic_expr (stderr
, prev
);
5807 fprintf (stderr
," is greater than ");
5808 print_generic_expr (stderr
, c
);
5809 fprintf (stderr
," but comes before it.\n");
5814 /* VRP will remove the default case if it can prove it will
5815 never be executed. So do not verify there always exists
5816 a default case here. */
5818 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
5822 error ("extra outgoing edge %d->%d",
5823 bb
->index
, e
->dest
->index
);
5827 e
->dest
->aux
= (void *)2;
5828 if ((e
->flags
& (EDGE_FALLTHRU
| EDGE_ABNORMAL
5829 | EDGE_TRUE_VALUE
| EDGE_FALSE_VALUE
)))
5831 error ("wrong outgoing edge flags at end of bb %d",
5837 /* Check that we have all of them. */
5838 for (i
= 0; i
< n
; ++i
)
5840 basic_block label_bb
= gimple_switch_label_bb (cfun
,
5843 if (label_bb
->aux
!= (void *)2)
5845 error ("missing edge %i->%i", bb
->index
, label_bb
->index
);
5850 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
5851 e
->dest
->aux
= (void *)0;
5855 case GIMPLE_EH_DISPATCH
:
5856 err
|= verify_eh_dispatch_edge (as_a
<geh_dispatch
*> (stmt
));
5864 if (dom_info_state (CDI_DOMINATORS
) >= DOM_NO_FAST_QUERY
)
5865 verify_dominators (CDI_DOMINATORS
);
5871 # pragma GCC diagnostic pop
5874 /* Updates phi nodes after creating a forwarder block joined
5875 by edge FALLTHRU. */
5878 gimple_make_forwarder_block (edge fallthru
)
5882 basic_block dummy
, bb
;
5885 bool forward_location_p
;
5887 dummy
= fallthru
->src
;
5888 bb
= fallthru
->dest
;
5890 if (single_pred_p (bb
))
5893 /* We can forward location info if we have only one predecessor. */
5894 forward_location_p
= single_pred_p (dummy
);
5896 /* If we redirected a branch we must create new PHI nodes at the
5898 for (gsi
= gsi_start_phis (dummy
); !gsi_end_p (gsi
); gsi_next (&gsi
))
5900 gphi
*phi
, *new_phi
;
5903 var
= gimple_phi_result (phi
);
5904 new_phi
= create_phi_node (var
, bb
);
5905 gimple_phi_set_result (phi
, copy_ssa_name (var
, phi
));
5906 add_phi_arg (new_phi
, gimple_phi_result (phi
), fallthru
,
5908 ? gimple_phi_arg_location (phi
, 0) : UNKNOWN_LOCATION
);
5911 /* Add the arguments we have stored on edges. */
5912 FOR_EACH_EDGE (e
, ei
, bb
->preds
)
5917 flush_pending_stmts (e
);
5922 /* Return a non-special label in the head of basic block BLOCK.
5923 Create one if it doesn't exist. */
5926 gimple_block_label (basic_block bb
)
5928 gimple_stmt_iterator i
, s
= gsi_start_bb (bb
);
5933 for (i
= s
; !gsi_end_p (i
); first
= false, gsi_next (&i
))
5935 stmt
= dyn_cast
<glabel
*> (gsi_stmt (i
));
5938 label
= gimple_label_label (stmt
);
5939 if (!DECL_NONLOCAL (label
))
5942 gsi_move_before (&i
, &s
);
5947 label
= create_artificial_label (UNKNOWN_LOCATION
);
5948 stmt
= gimple_build_label (label
);
5949 gsi_insert_before (&s
, stmt
, GSI_NEW_STMT
);
5954 /* Attempt to perform edge redirection by replacing a possibly complex
5955 jump instruction by a goto or by removing the jump completely.
5956 This can apply only if all edges now point to the same block. The
5957 parameters and return values are equivalent to
5958 redirect_edge_and_branch. */
5961 gimple_try_redirect_by_replacing_jump (edge e
, basic_block target
)
5963 basic_block src
= e
->src
;
5964 gimple_stmt_iterator i
;
5967 /* We can replace or remove a complex jump only when we have exactly
5969 if (EDGE_COUNT (src
->succs
) != 2
5970 /* Verify that all targets will be TARGET. Specifically, the
5971 edge that is not E must also go to TARGET. */
5972 || EDGE_SUCC (src
, EDGE_SUCC (src
, 0) == e
)->dest
!= target
)
5975 i
= gsi_last_bb (src
);
5979 stmt
= gsi_stmt (i
);
5981 if (gimple_code (stmt
) == GIMPLE_COND
|| gimple_code (stmt
) == GIMPLE_SWITCH
)
5983 gsi_remove (&i
, true);
5984 e
= ssa_redirect_edge (e
, target
);
5985 e
->flags
= EDGE_FALLTHRU
;
5993 /* Redirect E to DEST. Return NULL on failure. Otherwise, return the
5994 edge representing the redirected branch. */
5997 gimple_redirect_edge_and_branch (edge e
, basic_block dest
)
5999 basic_block bb
= e
->src
;
6000 gimple_stmt_iterator gsi
;
6004 if (e
->flags
& EDGE_ABNORMAL
)
6007 if (e
->dest
== dest
)
6010 if (e
->flags
& EDGE_EH
)
6011 return redirect_eh_edge (e
, dest
);
6013 if (e
->src
!= ENTRY_BLOCK_PTR_FOR_FN (cfun
))
6015 ret
= gimple_try_redirect_by_replacing_jump (e
, dest
);
6020 gsi
= gsi_last_nondebug_bb (bb
);
6021 stmt
= gsi_end_p (gsi
) ? NULL
: gsi_stmt (gsi
);
6023 switch (stmt
? gimple_code (stmt
) : GIMPLE_ERROR_MARK
)
6026 /* For COND_EXPR, we only need to redirect the edge. */
6030 /* No non-abnormal edges should lead from a non-simple goto, and
6031 simple ones should be represented implicitly. */
6036 gswitch
*switch_stmt
= as_a
<gswitch
*> (stmt
);
6037 tree label
= gimple_block_label (dest
);
6038 tree cases
= get_cases_for_edge (e
, switch_stmt
);
6040 /* If we have a list of cases associated with E, then use it
6041 as it's a lot faster than walking the entire case vector. */
6044 edge e2
= find_edge (e
->src
, dest
);
6051 CASE_LABEL (cases
) = label
;
6052 cases
= CASE_CHAIN (cases
);
6055 /* If there was already an edge in the CFG, then we need
6056 to move all the cases associated with E to E2. */
6059 tree cases2
= get_cases_for_edge (e2
, switch_stmt
);
6061 CASE_CHAIN (last
) = CASE_CHAIN (cases2
);
6062 CASE_CHAIN (cases2
) = first
;
6064 bitmap_set_bit (touched_switch_bbs
, gimple_bb (stmt
)->index
);
6068 size_t i
, n
= gimple_switch_num_labels (switch_stmt
);
6070 for (i
= 0; i
< n
; i
++)
6072 tree elt
= gimple_switch_label (switch_stmt
, i
);
6073 if (label_to_block (cfun
, CASE_LABEL (elt
)) == e
->dest
)
6074 CASE_LABEL (elt
) = label
;
6082 gasm
*asm_stmt
= as_a
<gasm
*> (stmt
);
6083 int i
, n
= gimple_asm_nlabels (asm_stmt
);
6086 for (i
= 0; i
< n
; ++i
)
6088 tree cons
= gimple_asm_label_op (asm_stmt
, i
);
6089 if (label_to_block (cfun
, TREE_VALUE (cons
)) == e
->dest
)
6092 label
= gimple_block_label (dest
);
6093 TREE_VALUE (cons
) = label
;
6097 /* If we didn't find any label matching the former edge in the
6098 asm labels, we must be redirecting the fallthrough
6100 gcc_assert (label
|| (e
->flags
& EDGE_FALLTHRU
));
6105 gsi_remove (&gsi
, true);
6106 e
->flags
|= EDGE_FALLTHRU
;
6109 case GIMPLE_OMP_RETURN
:
6110 case GIMPLE_OMP_CONTINUE
:
6111 case GIMPLE_OMP_SECTIONS_SWITCH
:
6112 case GIMPLE_OMP_FOR
:
6113 /* The edges from OMP constructs can be simply redirected. */
6116 case GIMPLE_EH_DISPATCH
:
6117 if (!(e
->flags
& EDGE_FALLTHRU
))
6118 redirect_eh_dispatch_edge (as_a
<geh_dispatch
*> (stmt
), e
, dest
);
6121 case GIMPLE_TRANSACTION
:
6122 if (e
->flags
& EDGE_TM_ABORT
)
6123 gimple_transaction_set_label_over (as_a
<gtransaction
*> (stmt
),
6124 gimple_block_label (dest
));
6125 else if (e
->flags
& EDGE_TM_UNINSTRUMENTED
)
6126 gimple_transaction_set_label_uninst (as_a
<gtransaction
*> (stmt
),
6127 gimple_block_label (dest
));
6129 gimple_transaction_set_label_norm (as_a
<gtransaction
*> (stmt
),
6130 gimple_block_label (dest
));
6134 /* Otherwise it must be a fallthru edge, and we don't need to
6135 do anything besides redirecting it. */
6136 gcc_assert (e
->flags
& EDGE_FALLTHRU
);
6140 /* Update/insert PHI nodes as necessary. */
6142 /* Now update the edges in the CFG. */
6143 e
= ssa_redirect_edge (e
, dest
);
6148 /* Returns true if it is possible to remove edge E by redirecting
6149 it to the destination of the other edge from E->src. */
6152 gimple_can_remove_branch_p (const_edge e
)
6154 if (e
->flags
& (EDGE_ABNORMAL
| EDGE_EH
))
6160 /* Simple wrapper, as we can always redirect fallthru edges. */
6163 gimple_redirect_edge_and_branch_force (edge e
, basic_block dest
)
6165 e
= gimple_redirect_edge_and_branch (e
, dest
);
6172 /* Splits basic block BB after statement STMT (but at least after the
6173 labels). If STMT is NULL, BB is split just after the labels. */
6176 gimple_split_block (basic_block bb
, void *stmt
)
6178 gimple_stmt_iterator gsi
;
6179 gimple_stmt_iterator gsi_tgt
;
6185 new_bb
= create_empty_bb (bb
);
6187 /* Redirect the outgoing edges. */
6188 new_bb
->succs
= bb
->succs
;
6190 FOR_EACH_EDGE (e
, ei
, new_bb
->succs
)
6193 /* Get a stmt iterator pointing to the first stmt to move. */
6194 if (!stmt
|| gimple_code ((gimple
*) stmt
) == GIMPLE_LABEL
)
6195 gsi
= gsi_after_labels (bb
);
6198 gsi
= gsi_for_stmt ((gimple
*) stmt
);
6202 /* Move everything from GSI to the new basic block. */
6203 if (gsi_end_p (gsi
))
6206 /* Split the statement list - avoid re-creating new containers as this
6207 brings ugly quadratic memory consumption in the inliner.
6208 (We are still quadratic since we need to update stmt BB pointers,
6210 gsi_split_seq_before (&gsi
, &list
);
6211 set_bb_seq (new_bb
, list
);
6212 for (gsi_tgt
= gsi_start (list
);
6213 !gsi_end_p (gsi_tgt
); gsi_next (&gsi_tgt
))
6214 gimple_set_bb (gsi_stmt (gsi_tgt
), new_bb
);
6220 /* Moves basic block BB after block AFTER. */
6223 gimple_move_block_after (basic_block bb
, basic_block after
)
6225 if (bb
->prev_bb
== after
)
6229 link_block (bb
, after
);
6235 /* Return TRUE if block BB has no executable statements, otherwise return
6239 gimple_empty_block_p (basic_block bb
)
6241 /* BB must have no executable statements. */
6242 gimple_stmt_iterator gsi
= gsi_after_labels (bb
);
6245 while (!gsi_end_p (gsi
))
6247 gimple
*stmt
= gsi_stmt (gsi
);
6248 if (is_gimple_debug (stmt
))
6250 else if (gimple_code (stmt
) == GIMPLE_NOP
6251 || gimple_code (stmt
) == GIMPLE_PREDICT
)
6261 /* Split a basic block if it ends with a conditional branch and if the
6262 other part of the block is not empty. */
6265 gimple_split_block_before_cond_jump (basic_block bb
)
6267 gimple
*last
, *split_point
;
6268 gimple_stmt_iterator gsi
= gsi_last_nondebug_bb (bb
);
6269 if (gsi_end_p (gsi
))
6271 last
= gsi_stmt (gsi
);
6272 if (gimple_code (last
) != GIMPLE_COND
6273 && gimple_code (last
) != GIMPLE_SWITCH
)
6276 split_point
= gsi_stmt (gsi
);
6277 return split_block (bb
, split_point
)->dest
;
6281 /* Return true if basic_block can be duplicated. */
6284 gimple_can_duplicate_bb_p (const_basic_block bb
)
6286 gimple
*last
= last_stmt (CONST_CAST_BB (bb
));
6288 /* Do checks that can only fail for the last stmt, to minimize the work in the
6291 /* A transaction is a single entry multiple exit region. It
6292 must be duplicated in its entirety or not at all. */
6293 if (gimple_code (last
) == GIMPLE_TRANSACTION
)
6296 /* An IFN_UNIQUE call must be duplicated as part of its group,
6298 if (is_gimple_call (last
)
6299 && gimple_call_internal_p (last
)
6300 && gimple_call_internal_unique_p (last
))
6304 for (gimple_stmt_iterator gsi
= gsi_start_bb (CONST_CAST_BB (bb
));
6305 !gsi_end_p (gsi
); gsi_next (&gsi
))
6307 gimple
*g
= gsi_stmt (gsi
);
6309 /* An IFN_GOMP_SIMT_ENTER_ALLOC/IFN_GOMP_SIMT_EXIT call must be
6310 duplicated as part of its group, or not at all.
6311 The IFN_GOMP_SIMT_VOTE_ANY and IFN_GOMP_SIMT_XCHG_* are part of such a
6312 group, so the same holds there. */
6313 if (is_gimple_call (g
)
6314 && (gimple_call_internal_p (g
, IFN_GOMP_SIMT_ENTER_ALLOC
)
6315 || gimple_call_internal_p (g
, IFN_GOMP_SIMT_EXIT
)
6316 || gimple_call_internal_p (g
, IFN_GOMP_SIMT_VOTE_ANY
)
6317 || gimple_call_internal_p (g
, IFN_GOMP_SIMT_XCHG_BFLY
)
6318 || gimple_call_internal_p (g
, IFN_GOMP_SIMT_XCHG_IDX
)))
6325 /* Create a duplicate of the basic block BB. NOTE: This does not
6326 preserve SSA form. */
6329 gimple_duplicate_bb (basic_block bb
, copy_bb_data
*id
)
6332 gimple_stmt_iterator gsi_tgt
;
6334 new_bb
= create_empty_bb (EXIT_BLOCK_PTR_FOR_FN (cfun
)->prev_bb
);
6336 /* Copy the PHI nodes. We ignore PHI node arguments here because
6337 the incoming edges have not been setup yet. */
6338 for (gphi_iterator gpi
= gsi_start_phis (bb
);
6344 copy
= create_phi_node (NULL_TREE
, new_bb
);
6345 create_new_def_for (gimple_phi_result (phi
), copy
,
6346 gimple_phi_result_ptr (copy
));
6347 gimple_set_uid (copy
, gimple_uid (phi
));
6350 gsi_tgt
= gsi_start_bb (new_bb
);
6351 for (gimple_stmt_iterator gsi
= gsi_start_bb (bb
);
6355 def_operand_p def_p
;
6356 ssa_op_iter op_iter
;
6358 gimple
*stmt
, *copy
;
6360 stmt
= gsi_stmt (gsi
);
6361 if (gimple_code (stmt
) == GIMPLE_LABEL
)
6364 /* Don't duplicate label debug stmts. */
6365 if (gimple_debug_bind_p (stmt
)
6366 && TREE_CODE (gimple_debug_bind_get_var (stmt
))
6370 /* Create a new copy of STMT and duplicate STMT's virtual
6372 copy
= gimple_copy (stmt
);
6373 gsi_insert_after (&gsi_tgt
, copy
, GSI_NEW_STMT
);
6375 maybe_duplicate_eh_stmt (copy
, stmt
);
6376 gimple_duplicate_stmt_histograms (cfun
, copy
, cfun
, stmt
);
6378 /* When copying around a stmt writing into a local non-user
6379 aggregate, make sure it won't share stack slot with other
6381 lhs
= gimple_get_lhs (stmt
);
6382 if (lhs
&& TREE_CODE (lhs
) != SSA_NAME
)
6384 tree base
= get_base_address (lhs
);
6386 && (VAR_P (base
) || TREE_CODE (base
) == RESULT_DECL
)
6387 && DECL_IGNORED_P (base
)
6388 && !TREE_STATIC (base
)
6389 && !DECL_EXTERNAL (base
)
6390 && (!VAR_P (base
) || !DECL_HAS_VALUE_EXPR_P (base
)))
6391 DECL_NONSHAREABLE (base
) = 1;
6394 /* If requested remap dependence info of cliques brought in
6397 for (unsigned i
= 0; i
< gimple_num_ops (copy
); ++i
)
6399 tree op
= gimple_op (copy
, i
);
6402 if (TREE_CODE (op
) == ADDR_EXPR
6403 || TREE_CODE (op
) == WITH_SIZE_EXPR
)
6404 op
= TREE_OPERAND (op
, 0);
6405 while (handled_component_p (op
))
6406 op
= TREE_OPERAND (op
, 0);
6407 if ((TREE_CODE (op
) == MEM_REF
6408 || TREE_CODE (op
) == TARGET_MEM_REF
)
6409 && MR_DEPENDENCE_CLIQUE (op
) > 1
6410 && MR_DEPENDENCE_CLIQUE (op
) != bb
->loop_father
->owned_clique
)
6412 if (!id
->dependence_map
)
6413 id
->dependence_map
= new hash_map
<dependence_hash
,
6416 unsigned short &newc
= id
->dependence_map
->get_or_insert
6417 (MR_DEPENDENCE_CLIQUE (op
), &existed
);
6420 gcc_assert (MR_DEPENDENCE_CLIQUE (op
) <= cfun
->last_clique
);
6421 newc
= ++cfun
->last_clique
;
6423 MR_DEPENDENCE_CLIQUE (op
) = newc
;
6427 /* Create new names for all the definitions created by COPY and
6428 add replacement mappings for each new name. */
6429 FOR_EACH_SSA_DEF_OPERAND (def_p
, copy
, op_iter
, SSA_OP_ALL_DEFS
)
6430 create_new_def_for (DEF_FROM_PTR (def_p
), copy
, def_p
);
6436 /* Adds phi node arguments for edge E_COPY after basic block duplication. */
6439 add_phi_args_after_copy_edge (edge e_copy
)
6441 basic_block bb
, bb_copy
= e_copy
->src
, dest
;
6444 gphi
*phi
, *phi_copy
;
6446 gphi_iterator psi
, psi_copy
;
6448 if (gimple_seq_empty_p (phi_nodes (e_copy
->dest
)))
6451 bb
= bb_copy
->flags
& BB_DUPLICATED
? get_bb_original (bb_copy
) : bb_copy
;
6453 if (e_copy
->dest
->flags
& BB_DUPLICATED
)
6454 dest
= get_bb_original (e_copy
->dest
);
6456 dest
= e_copy
->dest
;
6458 e
= find_edge (bb
, dest
);
6461 /* During loop unrolling the target of the latch edge is copied.
6462 In this case we are not looking for edge to dest, but to
6463 duplicated block whose original was dest. */
6464 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
6466 if ((e
->dest
->flags
& BB_DUPLICATED
)
6467 && get_bb_original (e
->dest
) == dest
)
6471 gcc_assert (e
!= NULL
);
6474 for (psi
= gsi_start_phis (e
->dest
),
6475 psi_copy
= gsi_start_phis (e_copy
->dest
);
6477 gsi_next (&psi
), gsi_next (&psi_copy
))
6480 phi_copy
= psi_copy
.phi ();
6481 def
= PHI_ARG_DEF_FROM_EDGE (phi
, e
);
6482 add_phi_arg (phi_copy
, def
, e_copy
,
6483 gimple_phi_arg_location_from_edge (phi
, e
));
6488 /* Basic block BB_COPY was created by code duplication. Add phi node
6489 arguments for edges going out of BB_COPY. The blocks that were
6490 duplicated have BB_DUPLICATED set. */
6493 add_phi_args_after_copy_bb (basic_block bb_copy
)
6498 FOR_EACH_EDGE (e_copy
, ei
, bb_copy
->succs
)
6500 add_phi_args_after_copy_edge (e_copy
);
6504 /* Blocks in REGION_COPY array of length N_REGION were created by
6505 duplication of basic blocks. Add phi node arguments for edges
6506 going from these blocks. If E_COPY is not NULL, also add
6507 phi node arguments for its destination.*/
6510 add_phi_args_after_copy (basic_block
*region_copy
, unsigned n_region
,
6515 for (i
= 0; i
< n_region
; i
++)
6516 region_copy
[i
]->flags
|= BB_DUPLICATED
;
6518 for (i
= 0; i
< n_region
; i
++)
6519 add_phi_args_after_copy_bb (region_copy
[i
]);
6521 add_phi_args_after_copy_edge (e_copy
);
6523 for (i
= 0; i
< n_region
; i
++)
6524 region_copy
[i
]->flags
&= ~BB_DUPLICATED
;
6527 /* Duplicates a REGION (set of N_REGION basic blocks) with just a single
6528 important exit edge EXIT. By important we mean that no SSA name defined
6529 inside region is live over the other exit edges of the region. All entry
6530 edges to the region must go to ENTRY->dest. The edge ENTRY is redirected
6531 to the duplicate of the region. Dominance and loop information is
6532 updated if UPDATE_DOMINANCE is true, but not the SSA web. If
6533 UPDATE_DOMINANCE is false then we assume that the caller will update the
6534 dominance information after calling this function. The new basic
6535 blocks are stored to REGION_COPY in the same order as they had in REGION,
6536 provided that REGION_COPY is not NULL.
6537 The function returns false if it is unable to copy the region,
6541 gimple_duplicate_sese_region (edge entry
, edge exit
,
6542 basic_block
*region
, unsigned n_region
,
6543 basic_block
*region_copy
,
6544 bool update_dominance
)
6547 bool free_region_copy
= false, copying_header
= false;
6548 class loop
*loop
= entry
->dest
->loop_father
;
6551 profile_count total_count
= profile_count::uninitialized ();
6552 profile_count entry_count
= profile_count::uninitialized ();
6554 if (!can_copy_bbs_p (region
, n_region
))
6557 /* Some sanity checking. Note that we do not check for all possible
6558 missuses of the functions. I.e. if you ask to copy something weird,
6559 it will work, but the state of structures probably will not be
6561 for (i
= 0; i
< n_region
; i
++)
6563 /* We do not handle subloops, i.e. all the blocks must belong to the
6565 if (region
[i
]->loop_father
!= loop
)
6568 if (region
[i
] != entry
->dest
6569 && region
[i
] == loop
->header
)
6573 /* In case the function is used for loop header copying (which is the primary
6574 use), ensure that EXIT and its copy will be new latch and entry edges. */
6575 if (loop
->header
== entry
->dest
)
6577 copying_header
= true;
6579 if (!dominated_by_p (CDI_DOMINATORS
, loop
->latch
, exit
->src
))
6582 for (i
= 0; i
< n_region
; i
++)
6583 if (region
[i
] != exit
->src
6584 && dominated_by_p (CDI_DOMINATORS
, region
[i
], exit
->src
))
6588 initialize_original_copy_tables ();
6591 set_loop_copy (loop
, loop_outer (loop
));
6593 set_loop_copy (loop
, loop
);
6597 region_copy
= XNEWVEC (basic_block
, n_region
);
6598 free_region_copy
= true;
6601 /* Record blocks outside the region that are dominated by something
6603 auto_vec
<basic_block
> doms
;
6604 if (update_dominance
)
6606 doms
= get_dominated_by_region (CDI_DOMINATORS
, region
, n_region
);
6609 if (entry
->dest
->count
.initialized_p ())
6611 total_count
= entry
->dest
->count
;
6612 entry_count
= entry
->count ();
6613 /* Fix up corner cases, to avoid division by zero or creation of negative
6615 if (entry_count
> total_count
)
6616 entry_count
= total_count
;
6619 copy_bbs (region
, n_region
, region_copy
, &exit
, 1, &exit_copy
, loop
,
6620 split_edge_bb_loc (entry
), update_dominance
);
6621 if (total_count
.initialized_p () && entry_count
.initialized_p ())
6623 scale_bbs_frequencies_profile_count (region
, n_region
,
6624 total_count
- entry_count
,
6626 scale_bbs_frequencies_profile_count (region_copy
, n_region
, entry_count
,
6632 loop
->header
= exit
->dest
;
6633 loop
->latch
= exit
->src
;
6636 /* Redirect the entry and add the phi node arguments. */
6637 redirected
= redirect_edge_and_branch (entry
, get_bb_copy (entry
->dest
));
6638 gcc_assert (redirected
!= NULL
);
6639 flush_pending_stmts (entry
);
6641 /* Concerning updating of dominators: We must recount dominators
6642 for entry block and its copy. Anything that is outside of the
6643 region, but was dominated by something inside needs recounting as
6645 if (update_dominance
)
6647 set_immediate_dominator (CDI_DOMINATORS
, entry
->dest
, entry
->src
);
6648 doms
.safe_push (get_bb_original (entry
->dest
));
6649 iterate_fix_dominators (CDI_DOMINATORS
, doms
, false);
6652 /* Add the other PHI node arguments. */
6653 add_phi_args_after_copy (region_copy
, n_region
, NULL
);
6655 if (free_region_copy
)
6658 free_original_copy_tables ();
6662 /* Checks if BB is part of the region defined by N_REGION BBS. */
6664 bb_part_of_region_p (basic_block bb
, basic_block
* bbs
, unsigned n_region
)
6668 for (n
= 0; n
< n_region
; n
++)
6676 /* Duplicates REGION consisting of N_REGION blocks. The new blocks
6677 are stored to REGION_COPY in the same order in that they appear
6678 in REGION, if REGION_COPY is not NULL. ENTRY is the entry to
6679 the region, EXIT an exit from it. The condition guarding EXIT
6680 is moved to ENTRY. Returns true if duplication succeeds, false
6706 gimple_duplicate_sese_tail (edge entry
, edge exit
,
6707 basic_block
*region
, unsigned n_region
,
6708 basic_block
*region_copy
)
6711 bool free_region_copy
= false;
6712 class loop
*loop
= exit
->dest
->loop_father
;
6713 class loop
*orig_loop
= entry
->dest
->loop_father
;
6714 basic_block switch_bb
, entry_bb
, nentry_bb
;
6715 profile_count total_count
= profile_count::uninitialized (),
6716 exit_count
= profile_count::uninitialized ();
6717 edge exits
[2], nexits
[2], e
;
6718 gimple_stmt_iterator gsi
;
6721 basic_block exit_bb
;
6725 class loop
*target
, *aloop
, *cloop
;
6727 gcc_assert (EDGE_COUNT (exit
->src
->succs
) == 2);
6729 exits
[1] = EDGE_SUCC (exit
->src
, EDGE_SUCC (exit
->src
, 0) == exit
);
6731 if (!can_copy_bbs_p (region
, n_region
))
6734 initialize_original_copy_tables ();
6735 set_loop_copy (orig_loop
, loop
);
6738 for (aloop
= orig_loop
->inner
; aloop
; aloop
= aloop
->next
)
6740 if (bb_part_of_region_p (aloop
->header
, region
, n_region
))
6742 cloop
= duplicate_loop (aloop
, target
);
6743 duplicate_subloops (aloop
, cloop
);
6749 region_copy
= XNEWVEC (basic_block
, n_region
);
6750 free_region_copy
= true;
6753 gcc_assert (!need_ssa_update_p (cfun
));
6755 /* Record blocks outside the region that are dominated by something
6757 auto_vec
<basic_block
> doms
= get_dominated_by_region (CDI_DOMINATORS
, region
,
6760 total_count
= exit
->src
->count
;
6761 exit_count
= exit
->count ();
6762 /* Fix up corner cases, to avoid division by zero or creation of negative
6764 if (exit_count
> total_count
)
6765 exit_count
= total_count
;
6767 copy_bbs (region
, n_region
, region_copy
, exits
, 2, nexits
, orig_loop
,
6768 split_edge_bb_loc (exit
), true);
6769 if (total_count
.initialized_p () && exit_count
.initialized_p ())
6771 scale_bbs_frequencies_profile_count (region
, n_region
,
6772 total_count
- exit_count
,
6774 scale_bbs_frequencies_profile_count (region_copy
, n_region
, exit_count
,
6778 /* Create the switch block, and put the exit condition to it. */
6779 entry_bb
= entry
->dest
;
6780 nentry_bb
= get_bb_copy (entry_bb
);
6781 if (!last_stmt (entry
->src
)
6782 || !stmt_ends_bb_p (last_stmt (entry
->src
)))
6783 switch_bb
= entry
->src
;
6785 switch_bb
= split_edge (entry
);
6786 set_immediate_dominator (CDI_DOMINATORS
, nentry_bb
, switch_bb
);
6788 gsi
= gsi_last_bb (switch_bb
);
6789 cond_stmt
= last_stmt (exit
->src
);
6790 gcc_assert (gimple_code (cond_stmt
) == GIMPLE_COND
);
6791 cond_stmt
= gimple_copy (cond_stmt
);
6793 gsi_insert_after (&gsi
, cond_stmt
, GSI_NEW_STMT
);
6795 sorig
= single_succ_edge (switch_bb
);
6796 sorig
->flags
= exits
[1]->flags
;
6797 sorig
->probability
= exits
[1]->probability
;
6798 snew
= make_edge (switch_bb
, nentry_bb
, exits
[0]->flags
);
6799 snew
->probability
= exits
[0]->probability
;
6802 /* Register the new edge from SWITCH_BB in loop exit lists. */
6803 rescan_loop_exit (snew
, true, false);
6805 /* Add the PHI node arguments. */
6806 add_phi_args_after_copy (region_copy
, n_region
, snew
);
6808 /* Get rid of now superfluous conditions and associated edges (and phi node
6810 exit_bb
= exit
->dest
;
6812 e
= redirect_edge_and_branch (exits
[0], exits
[1]->dest
);
6813 PENDING_STMT (e
) = NULL
;
6815 /* The latch of ORIG_LOOP was copied, and so was the backedge
6816 to the original header. We redirect this backedge to EXIT_BB. */
6817 for (i
= 0; i
< n_region
; i
++)
6818 if (get_bb_original (region_copy
[i
]) == orig_loop
->latch
)
6820 gcc_assert (single_succ_edge (region_copy
[i
]));
6821 e
= redirect_edge_and_branch (single_succ_edge (region_copy
[i
]), exit_bb
);
6822 PENDING_STMT (e
) = NULL
;
6823 for (psi
= gsi_start_phis (exit_bb
);
6828 def
= PHI_ARG_DEF (phi
, nexits
[0]->dest_idx
);
6829 add_phi_arg (phi
, def
, e
, gimple_phi_arg_location_from_edge (phi
, e
));
6832 e
= redirect_edge_and_branch (nexits
[1], nexits
[0]->dest
);
6833 PENDING_STMT (e
) = NULL
;
6835 /* Anything that is outside of the region, but was dominated by something
6836 inside needs to update dominance info. */
6837 iterate_fix_dominators (CDI_DOMINATORS
, doms
, false);
6838 /* Update the SSA web. */
6839 update_ssa (TODO_update_ssa
);
6841 if (free_region_copy
)
6844 free_original_copy_tables ();
6848 /* Add all the blocks dominated by ENTRY to the array BBS_P. Stop
6849 adding blocks when the dominator traversal reaches EXIT. This
6850 function silently assumes that ENTRY strictly dominates EXIT. */
6853 gather_blocks_in_sese_region (basic_block entry
, basic_block exit
,
6854 vec
<basic_block
> *bbs_p
)
6858 for (son
= first_dom_son (CDI_DOMINATORS
, entry
);
6860 son
= next_dom_son (CDI_DOMINATORS
, son
))
6862 bbs_p
->safe_push (son
);
6864 gather_blocks_in_sese_region (son
, exit
, bbs_p
);
6868 /* Replaces *TP with a duplicate (belonging to function TO_CONTEXT).
6869 The duplicates are recorded in VARS_MAP. */
6872 replace_by_duplicate_decl (tree
*tp
, hash_map
<tree
, tree
> *vars_map
,
6875 tree t
= *tp
, new_t
;
6876 struct function
*f
= DECL_STRUCT_FUNCTION (to_context
);
6878 if (DECL_CONTEXT (t
) == to_context
)
6882 tree
&loc
= vars_map
->get_or_insert (t
, &existed
);
6888 new_t
= copy_var_decl (t
, DECL_NAME (t
), TREE_TYPE (t
));
6889 add_local_decl (f
, new_t
);
6893 gcc_assert (TREE_CODE (t
) == CONST_DECL
);
6894 new_t
= copy_node (t
);
6896 DECL_CONTEXT (new_t
) = to_context
;
6907 /* Creates an ssa name in TO_CONTEXT equivalent to NAME.
6908 VARS_MAP maps old ssa names and var_decls to the new ones. */
6911 replace_ssa_name (tree name
, hash_map
<tree
, tree
> *vars_map
,
6916 gcc_assert (!virtual_operand_p (name
));
6918 tree
*loc
= vars_map
->get (name
);
6922 tree decl
= SSA_NAME_VAR (name
);
6925 gcc_assert (!SSA_NAME_IS_DEFAULT_DEF (name
));
6926 replace_by_duplicate_decl (&decl
, vars_map
, to_context
);
6927 new_name
= make_ssa_name_fn (DECL_STRUCT_FUNCTION (to_context
),
6928 decl
, SSA_NAME_DEF_STMT (name
));
6931 new_name
= copy_ssa_name_fn (DECL_STRUCT_FUNCTION (to_context
),
6932 name
, SSA_NAME_DEF_STMT (name
));
6934 /* Now that we've used the def stmt to define new_name, make sure it
6935 doesn't define name anymore. */
6936 SSA_NAME_DEF_STMT (name
) = NULL
;
6938 vars_map
->put (name
, new_name
);
6952 hash_map
<tree
, tree
> *vars_map
;
6953 htab_t new_label_map
;
6954 hash_map
<void *, void *> *eh_map
;
6958 /* Helper for move_block_to_fn. Set TREE_BLOCK in every expression
6959 contained in *TP if it has been ORIG_BLOCK previously and change the
6960 DECL_CONTEXT of every local variable referenced in *TP. */
6963 move_stmt_op (tree
*tp
, int *walk_subtrees
, void *data
)
6965 struct walk_stmt_info
*wi
= (struct walk_stmt_info
*) data
;
6966 struct move_stmt_d
*p
= (struct move_stmt_d
*) wi
->info
;
6971 tree block
= TREE_BLOCK (t
);
6972 if (block
== NULL_TREE
)
6974 else if (block
== p
->orig_block
6975 || p
->orig_block
== NULL_TREE
)
6977 /* tree_node_can_be_shared says we can share invariant
6978 addresses but unshare_expr copies them anyways. Make sure
6979 to unshare before adjusting the block in place - we do not
6980 always see a copy here. */
6981 if (TREE_CODE (t
) == ADDR_EXPR
6982 && is_gimple_min_invariant (t
))
6983 *tp
= t
= unshare_expr (t
);
6984 TREE_SET_BLOCK (t
, p
->new_block
);
6986 else if (flag_checking
)
6988 while (block
&& TREE_CODE (block
) == BLOCK
&& block
!= p
->orig_block
)
6989 block
= BLOCK_SUPERCONTEXT (block
);
6990 gcc_assert (block
== p
->orig_block
);
6993 else if (DECL_P (t
) || TREE_CODE (t
) == SSA_NAME
)
6995 if (TREE_CODE (t
) == SSA_NAME
)
6996 *tp
= replace_ssa_name (t
, p
->vars_map
, p
->to_context
);
6997 else if (TREE_CODE (t
) == PARM_DECL
6998 && gimple_in_ssa_p (cfun
))
6999 *tp
= *(p
->vars_map
->get (t
));
7000 else if (TREE_CODE (t
) == LABEL_DECL
)
7002 if (p
->new_label_map
)
7004 struct tree_map in
, *out
;
7006 out
= (struct tree_map
*)
7007 htab_find_with_hash (p
->new_label_map
, &in
, DECL_UID (t
));
7012 /* For FORCED_LABELs we can end up with references from other
7013 functions if some SESE regions are outlined. It is UB to
7014 jump in between them, but they could be used just for printing
7015 addresses etc. In that case, DECL_CONTEXT on the label should
7016 be the function containing the glabel stmt with that LABEL_DECL,
7017 rather than whatever function a reference to the label was seen
7019 if (!FORCED_LABEL (t
) && !DECL_NONLOCAL (t
))
7020 DECL_CONTEXT (t
) = p
->to_context
;
7022 else if (p
->remap_decls_p
)
7024 /* Replace T with its duplicate. T should no longer appear in the
7025 parent function, so this looks wasteful; however, it may appear
7026 in referenced_vars, and more importantly, as virtual operands of
7027 statements, and in alias lists of other variables. It would be
7028 quite difficult to expunge it from all those places. ??? It might
7029 suffice to do this for addressable variables. */
7030 if ((VAR_P (t
) && !is_global_var (t
))
7031 || TREE_CODE (t
) == CONST_DECL
)
7032 replace_by_duplicate_decl (tp
, p
->vars_map
, p
->to_context
);
7036 else if (TYPE_P (t
))
7042 /* Helper for move_stmt_r. Given an EH region number for the source
7043 function, map that to the duplicate EH regio number in the dest. */
7046 move_stmt_eh_region_nr (int old_nr
, struct move_stmt_d
*p
)
7048 eh_region old_r
, new_r
;
7050 old_r
= get_eh_region_from_number (old_nr
);
7051 new_r
= static_cast<eh_region
> (*p
->eh_map
->get (old_r
));
7053 return new_r
->index
;
7056 /* Similar, but operate on INTEGER_CSTs. */
7059 move_stmt_eh_region_tree_nr (tree old_t_nr
, struct move_stmt_d
*p
)
7063 old_nr
= tree_to_shwi (old_t_nr
);
7064 new_nr
= move_stmt_eh_region_nr (old_nr
, p
);
7066 return build_int_cst (integer_type_node
, new_nr
);
7069 /* Like move_stmt_op, but for gimple statements.
7071 Helper for move_block_to_fn. Set GIMPLE_BLOCK in every expression
7072 contained in the current statement in *GSI_P and change the
7073 DECL_CONTEXT of every local variable referenced in the current
7077 move_stmt_r (gimple_stmt_iterator
*gsi_p
, bool *handled_ops_p
,
7078 struct walk_stmt_info
*wi
)
7080 struct move_stmt_d
*p
= (struct move_stmt_d
*) wi
->info
;
7081 gimple
*stmt
= gsi_stmt (*gsi_p
);
7082 tree block
= gimple_block (stmt
);
7084 if (block
== p
->orig_block
7085 || (p
->orig_block
== NULL_TREE
7086 && block
!= NULL_TREE
))
7087 gimple_set_block (stmt
, p
->new_block
);
7089 switch (gimple_code (stmt
))
7092 /* Remap the region numbers for __builtin_eh_{pointer,filter}. */
7094 tree r
, fndecl
= gimple_call_fndecl (stmt
);
7095 if (fndecl
&& fndecl_built_in_p (fndecl
, BUILT_IN_NORMAL
))
7096 switch (DECL_FUNCTION_CODE (fndecl
))
7098 case BUILT_IN_EH_COPY_VALUES
:
7099 r
= gimple_call_arg (stmt
, 1);
7100 r
= move_stmt_eh_region_tree_nr (r
, p
);
7101 gimple_call_set_arg (stmt
, 1, r
);
7104 case BUILT_IN_EH_POINTER
:
7105 case BUILT_IN_EH_FILTER
:
7106 r
= gimple_call_arg (stmt
, 0);
7107 r
= move_stmt_eh_region_tree_nr (r
, p
);
7108 gimple_call_set_arg (stmt
, 0, r
);
7119 gresx
*resx_stmt
= as_a
<gresx
*> (stmt
);
7120 int r
= gimple_resx_region (resx_stmt
);
7121 r
= move_stmt_eh_region_nr (r
, p
);
7122 gimple_resx_set_region (resx_stmt
, r
);
7126 case GIMPLE_EH_DISPATCH
:
7128 geh_dispatch
*eh_dispatch_stmt
= as_a
<geh_dispatch
*> (stmt
);
7129 int r
= gimple_eh_dispatch_region (eh_dispatch_stmt
);
7130 r
= move_stmt_eh_region_nr (r
, p
);
7131 gimple_eh_dispatch_set_region (eh_dispatch_stmt
, r
);
7135 case GIMPLE_OMP_RETURN
:
7136 case GIMPLE_OMP_CONTINUE
:
7141 /* For FORCED_LABEL, move_stmt_op doesn't adjust DECL_CONTEXT,
7142 so that such labels can be referenced from other regions.
7143 Make sure to update it when seeing a GIMPLE_LABEL though,
7144 that is the owner of the label. */
7145 walk_gimple_op (stmt
, move_stmt_op
, wi
);
7146 *handled_ops_p
= true;
7147 tree label
= gimple_label_label (as_a
<glabel
*> (stmt
));
7148 if (FORCED_LABEL (label
) || DECL_NONLOCAL (label
))
7149 DECL_CONTEXT (label
) = p
->to_context
;
7154 if (is_gimple_omp (stmt
))
7156 /* Do not remap variables inside OMP directives. Variables
7157 referenced in clauses and directive header belong to the
7158 parent function and should not be moved into the child
7160 bool save_remap_decls_p
= p
->remap_decls_p
;
7161 p
->remap_decls_p
= false;
7162 *handled_ops_p
= true;
7164 walk_gimple_seq_mod (gimple_omp_body_ptr (stmt
), move_stmt_r
,
7167 p
->remap_decls_p
= save_remap_decls_p
;
7175 /* Move basic block BB from function CFUN to function DEST_FN. The
7176 block is moved out of the original linked list and placed after
7177 block AFTER in the new list. Also, the block is removed from the
7178 original array of blocks and placed in DEST_FN's array of blocks.
7179 If UPDATE_EDGE_COUNT_P is true, the edge counts on both CFGs is
7180 updated to reflect the moved edges.
7182 The local variables are remapped to new instances, VARS_MAP is used
7183 to record the mapping. */
7186 move_block_to_fn (struct function
*dest_cfun
, basic_block bb
,
7187 basic_block after
, bool update_edge_count_p
,
7188 struct move_stmt_d
*d
)
7190 struct control_flow_graph
*cfg
;
7193 gimple_stmt_iterator si
;
7196 /* Remove BB from dominance structures. */
7197 delete_from_dominance_info (CDI_DOMINATORS
, bb
);
7199 /* Move BB from its current loop to the copy in the new function. */
7202 class loop
*new_loop
= (class loop
*)bb
->loop_father
->aux
;
7204 bb
->loop_father
= new_loop
;
7207 /* Link BB to the new linked list. */
7208 move_block_after (bb
, after
);
7210 /* Update the edge count in the corresponding flowgraphs. */
7211 if (update_edge_count_p
)
7212 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
7214 cfun
->cfg
->x_n_edges
--;
7215 dest_cfun
->cfg
->x_n_edges
++;
7218 /* Remove BB from the original basic block array. */
7219 (*cfun
->cfg
->x_basic_block_info
)[bb
->index
] = NULL
;
7220 cfun
->cfg
->x_n_basic_blocks
--;
7222 /* Grow DEST_CFUN's basic block array if needed. */
7223 cfg
= dest_cfun
->cfg
;
7224 cfg
->x_n_basic_blocks
++;
7225 if (bb
->index
>= cfg
->x_last_basic_block
)
7226 cfg
->x_last_basic_block
= bb
->index
+ 1;
7228 old_len
= vec_safe_length (cfg
->x_basic_block_info
);
7229 if ((unsigned) cfg
->x_last_basic_block
>= old_len
)
7230 vec_safe_grow_cleared (cfg
->x_basic_block_info
,
7231 cfg
->x_last_basic_block
+ 1);
7233 (*cfg
->x_basic_block_info
)[bb
->index
] = bb
;
7235 /* Remap the variables in phi nodes. */
7236 for (gphi_iterator psi
= gsi_start_phis (bb
);
7239 gphi
*phi
= psi
.phi ();
7241 tree op
= PHI_RESULT (phi
);
7245 if (virtual_operand_p (op
))
7247 /* Remove the phi nodes for virtual operands (alias analysis will be
7248 run for the new function, anyway). But replace all uses that
7249 might be outside of the region we move. */
7250 use_operand_p use_p
;
7251 imm_use_iterator iter
;
7253 FOR_EACH_IMM_USE_STMT (use_stmt
, iter
, op
)
7254 FOR_EACH_IMM_USE_ON_STMT (use_p
, iter
)
7255 SET_USE (use_p
, SSA_NAME_VAR (op
));
7256 remove_phi_node (&psi
, true);
7260 SET_PHI_RESULT (phi
,
7261 replace_ssa_name (op
, d
->vars_map
, dest_cfun
->decl
));
7262 FOR_EACH_PHI_ARG (use
, phi
, oi
, SSA_OP_USE
)
7264 op
= USE_FROM_PTR (use
);
7265 if (TREE_CODE (op
) == SSA_NAME
)
7266 SET_USE (use
, replace_ssa_name (op
, d
->vars_map
, dest_cfun
->decl
));
7269 for (i
= 0; i
< EDGE_COUNT (bb
->preds
); i
++)
7271 location_t locus
= gimple_phi_arg_location (phi
, i
);
7272 tree block
= LOCATION_BLOCK (locus
);
7274 if (locus
== UNKNOWN_LOCATION
)
7276 if (d
->orig_block
== NULL_TREE
|| block
== d
->orig_block
)
7278 locus
= set_block (locus
, d
->new_block
);
7279 gimple_phi_arg_set_location (phi
, i
, locus
);
7286 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
7288 gimple
*stmt
= gsi_stmt (si
);
7289 struct walk_stmt_info wi
;
7291 memset (&wi
, 0, sizeof (wi
));
7293 walk_gimple_stmt (&si
, move_stmt_r
, move_stmt_op
, &wi
);
7295 if (glabel
*label_stmt
= dyn_cast
<glabel
*> (stmt
))
7297 tree label
= gimple_label_label (label_stmt
);
7298 int uid
= LABEL_DECL_UID (label
);
7300 gcc_assert (uid
> -1);
7302 old_len
= vec_safe_length (cfg
->x_label_to_block_map
);
7303 if (old_len
<= (unsigned) uid
)
7304 vec_safe_grow_cleared (cfg
->x_label_to_block_map
, uid
+ 1);
7306 (*cfg
->x_label_to_block_map
)[uid
] = bb
;
7307 (*cfun
->cfg
->x_label_to_block_map
)[uid
] = NULL
;
7309 gcc_assert (DECL_CONTEXT (label
) == dest_cfun
->decl
);
7311 if (uid
>= dest_cfun
->cfg
->last_label_uid
)
7312 dest_cfun
->cfg
->last_label_uid
= uid
+ 1;
7315 maybe_duplicate_eh_stmt_fn (dest_cfun
, stmt
, cfun
, stmt
, d
->eh_map
, 0);
7316 remove_stmt_from_eh_lp_fn (cfun
, stmt
);
7318 gimple_duplicate_stmt_histograms (dest_cfun
, stmt
, cfun
, stmt
);
7319 gimple_remove_stmt_histograms (cfun
, stmt
);
7321 /* We cannot leave any operands allocated from the operand caches of
7322 the current function. */
7323 free_stmt_operands (cfun
, stmt
);
7324 push_cfun (dest_cfun
);
7326 if (is_gimple_call (stmt
))
7327 notice_special_calls (as_a
<gcall
*> (stmt
));
7331 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
7332 if (e
->goto_locus
!= UNKNOWN_LOCATION
)
7334 tree block
= LOCATION_BLOCK (e
->goto_locus
);
7335 if (d
->orig_block
== NULL_TREE
7336 || block
== d
->orig_block
)
7337 e
->goto_locus
= set_block (e
->goto_locus
, d
->new_block
);
7341 /* Examine the statements in BB (which is in SRC_CFUN); find and return
7342 the outermost EH region. Use REGION as the incoming base EH region.
7343 If there is no single outermost region, return NULL and set *ALL to
7347 find_outermost_region_in_block (struct function
*src_cfun
,
7348 basic_block bb
, eh_region region
,
7351 gimple_stmt_iterator si
;
7353 for (si
= gsi_start_bb (bb
); !gsi_end_p (si
); gsi_next (&si
))
7355 gimple
*stmt
= gsi_stmt (si
);
7356 eh_region stmt_region
;
7359 lp_nr
= lookup_stmt_eh_lp_fn (src_cfun
, stmt
);
7360 stmt_region
= get_eh_region_from_lp_number_fn (src_cfun
, lp_nr
);
7364 region
= stmt_region
;
7365 else if (stmt_region
!= region
)
7367 region
= eh_region_outermost (src_cfun
, stmt_region
, region
);
7381 new_label_mapper (tree decl
, void *data
)
7383 htab_t hash
= (htab_t
) data
;
7387 gcc_assert (TREE_CODE (decl
) == LABEL_DECL
);
7389 m
= XNEW (struct tree_map
);
7390 m
->hash
= DECL_UID (decl
);
7391 m
->base
.from
= decl
;
7392 m
->to
= create_artificial_label (UNKNOWN_LOCATION
);
7393 LABEL_DECL_UID (m
->to
) = LABEL_DECL_UID (decl
);
7394 if (LABEL_DECL_UID (m
->to
) >= cfun
->cfg
->last_label_uid
)
7395 cfun
->cfg
->last_label_uid
= LABEL_DECL_UID (m
->to
) + 1;
7397 slot
= htab_find_slot_with_hash (hash
, m
, m
->hash
, INSERT
);
7398 gcc_assert (*slot
== NULL
);
7405 /* Tree walker to replace the decls used inside value expressions by
7409 replace_block_vars_by_duplicates_1 (tree
*tp
, int *walk_subtrees
, void *data
)
7411 struct replace_decls_d
*rd
= (struct replace_decls_d
*)data
;
7413 switch (TREE_CODE (*tp
))
7418 replace_by_duplicate_decl (tp
, rd
->vars_map
, rd
->to_context
);
7424 if (IS_TYPE_OR_DECL_P (*tp
))
7425 *walk_subtrees
= false;
7430 /* Change DECL_CONTEXT of all BLOCK_VARS in block, including
7434 replace_block_vars_by_duplicates (tree block
, hash_map
<tree
, tree
> *vars_map
,
7439 for (tp
= &BLOCK_VARS (block
); *tp
; tp
= &DECL_CHAIN (*tp
))
7442 if (!VAR_P (t
) && TREE_CODE (t
) != CONST_DECL
)
7444 replace_by_duplicate_decl (&t
, vars_map
, to_context
);
7447 if (VAR_P (*tp
) && DECL_HAS_VALUE_EXPR_P (*tp
))
7449 tree x
= DECL_VALUE_EXPR (*tp
);
7450 struct replace_decls_d rd
= { vars_map
, to_context
};
7452 walk_tree (&x
, replace_block_vars_by_duplicates_1
, &rd
, NULL
);
7453 SET_DECL_VALUE_EXPR (t
, x
);
7454 DECL_HAS_VALUE_EXPR_P (t
) = 1;
7456 DECL_CHAIN (t
) = DECL_CHAIN (*tp
);
7461 for (block
= BLOCK_SUBBLOCKS (block
); block
; block
= BLOCK_CHAIN (block
))
7462 replace_block_vars_by_duplicates (block
, vars_map
, to_context
);
7465 /* Fixup the loop arrays and numbers after moving LOOP and its subloops
7469 fixup_loop_arrays_after_move (struct function
*fn1
, struct function
*fn2
,
7472 /* Discard it from the old loop array. */
7473 (*get_loops (fn1
))[loop
->num
] = NULL
;
7475 /* Place it in the new loop array, assigning it a new number. */
7476 loop
->num
= number_of_loops (fn2
);
7477 vec_safe_push (loops_for_fn (fn2
)->larray
, loop
);
7479 /* Recurse to children. */
7480 for (loop
= loop
->inner
; loop
; loop
= loop
->next
)
7481 fixup_loop_arrays_after_move (fn1
, fn2
, loop
);
7484 /* Verify that the blocks in BBS_P are a single-entry, single-exit region
7485 delimited by ENTRY_BB and EXIT_BB, possibly containing noreturn blocks. */
7488 verify_sese (basic_block entry
, basic_block exit
, vec
<basic_block
> *bbs_p
)
7493 bitmap bbs
= BITMAP_ALLOC (NULL
);
7496 gcc_assert (entry
!= NULL
);
7497 gcc_assert (entry
!= exit
);
7498 gcc_assert (bbs_p
!= NULL
);
7500 gcc_assert (bbs_p
->length () > 0);
7502 FOR_EACH_VEC_ELT (*bbs_p
, i
, bb
)
7503 bitmap_set_bit (bbs
, bb
->index
);
7505 gcc_assert (bitmap_bit_p (bbs
, entry
->index
));
7506 gcc_assert (exit
== NULL
|| bitmap_bit_p (bbs
, exit
->index
));
7508 FOR_EACH_VEC_ELT (*bbs_p
, i
, bb
)
7512 gcc_assert (single_pred_p (entry
));
7513 gcc_assert (!bitmap_bit_p (bbs
, single_pred (entry
)->index
));
7516 for (ei
= ei_start (bb
->preds
); !ei_end_p (ei
); ei_next (&ei
))
7519 gcc_assert (bitmap_bit_p (bbs
, e
->src
->index
));
7524 gcc_assert (single_succ_p (exit
));
7525 gcc_assert (!bitmap_bit_p (bbs
, single_succ (exit
)->index
));
7528 for (ei
= ei_start (bb
->succs
); !ei_end_p (ei
); ei_next (&ei
))
7531 gcc_assert (bitmap_bit_p (bbs
, e
->dest
->index
));
7538 /* If FROM is an SSA_NAME, mark the version in bitmap DATA. */
7541 gather_ssa_name_hash_map_from (tree
const &from
, tree
const &, void *data
)
7543 bitmap release_names
= (bitmap
)data
;
7545 if (TREE_CODE (from
) != SSA_NAME
)
7548 bitmap_set_bit (release_names
, SSA_NAME_VERSION (from
));
7552 /* Return LOOP_DIST_ALIAS call if present in BB. */
7555 find_loop_dist_alias (basic_block bb
)
7557 gimple
*g
= last_stmt (bb
);
7558 if (g
== NULL
|| gimple_code (g
) != GIMPLE_COND
)
7561 gimple_stmt_iterator gsi
= gsi_for_stmt (g
);
7563 if (gsi_end_p (gsi
))
7567 if (gimple_call_internal_p (g
, IFN_LOOP_DIST_ALIAS
))
7572 /* Fold loop internal call G like IFN_LOOP_VECTORIZED/IFN_LOOP_DIST_ALIAS
7573 to VALUE and update any immediate uses of it's LHS. */
7576 fold_loop_internal_call (gimple
*g
, tree value
)
7578 tree lhs
= gimple_call_lhs (g
);
7579 use_operand_p use_p
;
7580 imm_use_iterator iter
;
7582 gimple_stmt_iterator gsi
= gsi_for_stmt (g
);
7584 replace_call_with_value (&gsi
, value
);
7585 FOR_EACH_IMM_USE_STMT (use_stmt
, iter
, lhs
)
7587 FOR_EACH_IMM_USE_ON_STMT (use_p
, iter
)
7588 SET_USE (use_p
, value
);
7589 update_stmt (use_stmt
);
7593 /* Move a single-entry, single-exit region delimited by ENTRY_BB and
7594 EXIT_BB to function DEST_CFUN. The whole region is replaced by a
7595 single basic block in the original CFG and the new basic block is
7596 returned. DEST_CFUN must not have a CFG yet.
7598 Note that the region need not be a pure SESE region. Blocks inside
7599 the region may contain calls to abort/exit. The only restriction
7600 is that ENTRY_BB should be the only entry point and it must
7603 Change TREE_BLOCK of all statements in ORIG_BLOCK to the new
7604 functions outermost BLOCK, move all subblocks of ORIG_BLOCK
7605 to the new function.
7607 All local variables referenced in the region are assumed to be in
7608 the corresponding BLOCK_VARS and unexpanded variable lists
7609 associated with DEST_CFUN.
7611 TODO: investigate whether we can reuse gimple_duplicate_sese_region to
7612 reimplement move_sese_region_to_fn by duplicating the region rather than
7616 move_sese_region_to_fn (struct function
*dest_cfun
, basic_block entry_bb
,
7617 basic_block exit_bb
, tree orig_block
)
7619 vec
<basic_block
> bbs
;
7620 basic_block dom_entry
= get_immediate_dominator (CDI_DOMINATORS
, entry_bb
);
7621 basic_block after
, bb
, *entry_pred
, *exit_succ
, abb
;
7622 struct function
*saved_cfun
= cfun
;
7623 int *entry_flag
, *exit_flag
;
7624 profile_probability
*entry_prob
, *exit_prob
;
7625 unsigned i
, num_entry_edges
, num_exit_edges
, num_nodes
;
7628 htab_t new_label_map
;
7629 hash_map
<void *, void *> *eh_map
;
7630 class loop
*loop
= entry_bb
->loop_father
;
7631 class loop
*loop0
= get_loop (saved_cfun
, 0);
7632 struct move_stmt_d d
;
7634 /* If ENTRY does not strictly dominate EXIT, this cannot be an SESE
7636 gcc_assert (entry_bb
!= exit_bb
7638 || dominated_by_p (CDI_DOMINATORS
, exit_bb
, entry_bb
)));
7640 /* Collect all the blocks in the region. Manually add ENTRY_BB
7641 because it won't be added by dfs_enumerate_from. */
7643 bbs
.safe_push (entry_bb
);
7644 gather_blocks_in_sese_region (entry_bb
, exit_bb
, &bbs
);
7647 verify_sese (entry_bb
, exit_bb
, &bbs
);
7649 /* The blocks that used to be dominated by something in BBS will now be
7650 dominated by the new block. */
7651 auto_vec
<basic_block
> dom_bbs
= get_dominated_by_region (CDI_DOMINATORS
,
7655 /* Detach ENTRY_BB and EXIT_BB from CFUN->CFG. We need to remember
7656 the predecessor edges to ENTRY_BB and the successor edges to
7657 EXIT_BB so that we can re-attach them to the new basic block that
7658 will replace the region. */
7659 num_entry_edges
= EDGE_COUNT (entry_bb
->preds
);
7660 entry_pred
= XNEWVEC (basic_block
, num_entry_edges
);
7661 entry_flag
= XNEWVEC (int, num_entry_edges
);
7662 entry_prob
= XNEWVEC (profile_probability
, num_entry_edges
);
7664 for (ei
= ei_start (entry_bb
->preds
); (e
= ei_safe_edge (ei
)) != NULL
;)
7666 entry_prob
[i
] = e
->probability
;
7667 entry_flag
[i
] = e
->flags
;
7668 entry_pred
[i
++] = e
->src
;
7674 num_exit_edges
= EDGE_COUNT (exit_bb
->succs
);
7675 exit_succ
= XNEWVEC (basic_block
, num_exit_edges
);
7676 exit_flag
= XNEWVEC (int, num_exit_edges
);
7677 exit_prob
= XNEWVEC (profile_probability
, num_exit_edges
);
7679 for (ei
= ei_start (exit_bb
->succs
); (e
= ei_safe_edge (ei
)) != NULL
;)
7681 exit_prob
[i
] = e
->probability
;
7682 exit_flag
[i
] = e
->flags
;
7683 exit_succ
[i
++] = e
->dest
;
7695 /* Switch context to the child function to initialize DEST_FN's CFG. */
7696 gcc_assert (dest_cfun
->cfg
== NULL
);
7697 push_cfun (dest_cfun
);
7699 init_empty_tree_cfg ();
7701 /* Initialize EH information for the new function. */
7703 new_label_map
= NULL
;
7706 eh_region region
= NULL
;
7709 FOR_EACH_VEC_ELT (bbs
, i
, bb
)
7711 region
= find_outermost_region_in_block (saved_cfun
, bb
, region
, &all
);
7716 init_eh_for_function ();
7717 if (region
!= NULL
|| all
)
7719 new_label_map
= htab_create (17, tree_map_hash
, tree_map_eq
, free
);
7720 eh_map
= duplicate_eh_regions (saved_cfun
, region
, 0,
7721 new_label_mapper
, new_label_map
);
7725 /* Initialize an empty loop tree. */
7726 struct loops
*loops
= ggc_cleared_alloc
<struct loops
> ();
7727 init_loops_structure (dest_cfun
, loops
, 1);
7728 loops
->state
= LOOPS_MAY_HAVE_MULTIPLE_LATCHES
;
7729 set_loops_for_fn (dest_cfun
, loops
);
7731 vec
<loop_p
, va_gc
> *larray
= get_loops (saved_cfun
)->copy ();
7733 /* Move the outlined loop tree part. */
7734 num_nodes
= bbs
.length ();
7735 FOR_EACH_VEC_ELT (bbs
, i
, bb
)
7737 if (bb
->loop_father
->header
== bb
)
7739 class loop
*this_loop
= bb
->loop_father
;
7740 class loop
*outer
= loop_outer (this_loop
);
7742 /* If the SESE region contains some bbs ending with
7743 a noreturn call, those are considered to belong
7744 to the outermost loop in saved_cfun, rather than
7745 the entry_bb's loop_father. */
7749 num_nodes
-= this_loop
->num_nodes
;
7750 flow_loop_tree_node_remove (bb
->loop_father
);
7751 flow_loop_tree_node_add (get_loop (dest_cfun
, 0), this_loop
);
7752 fixup_loop_arrays_after_move (saved_cfun
, cfun
, this_loop
);
7755 else if (bb
->loop_father
== loop0
&& loop0
!= loop
)
7758 /* Remove loop exits from the outlined region. */
7759 if (loops_for_fn (saved_cfun
)->exits
)
7760 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
7762 struct loops
*l
= loops_for_fn (saved_cfun
);
7764 = l
->exits
->find_slot_with_hash (e
, htab_hash_pointer (e
),
7767 l
->exits
->clear_slot (slot
);
7771 /* Adjust the number of blocks in the tree root of the outlined part. */
7772 get_loop (dest_cfun
, 0)->num_nodes
= bbs
.length () + 2;
7774 /* Setup a mapping to be used by move_block_to_fn. */
7775 loop
->aux
= current_loops
->tree_root
;
7776 loop0
->aux
= current_loops
->tree_root
;
7778 /* Fix up orig_loop_num. If the block referenced in it has been moved
7779 to dest_cfun, update orig_loop_num field, otherwise clear it. */
7780 signed char *moved_orig_loop_num
= NULL
;
7781 for (auto dloop
: loops_list (dest_cfun
, 0))
7782 if (dloop
->orig_loop_num
)
7784 if (moved_orig_loop_num
== NULL
)
7786 = XCNEWVEC (signed char, vec_safe_length (larray
));
7787 if ((*larray
)[dloop
->orig_loop_num
] != NULL
7788 && get_loop (saved_cfun
, dloop
->orig_loop_num
) == NULL
)
7790 if (moved_orig_loop_num
[dloop
->orig_loop_num
] >= 0
7791 && moved_orig_loop_num
[dloop
->orig_loop_num
] < 2)
7792 moved_orig_loop_num
[dloop
->orig_loop_num
]++;
7793 dloop
->orig_loop_num
= (*larray
)[dloop
->orig_loop_num
]->num
;
7797 moved_orig_loop_num
[dloop
->orig_loop_num
] = -1;
7798 dloop
->orig_loop_num
= 0;
7803 if (moved_orig_loop_num
)
7805 FOR_EACH_VEC_ELT (bbs
, i
, bb
)
7807 gimple
*g
= find_loop_dist_alias (bb
);
7811 int orig_loop_num
= tree_to_shwi (gimple_call_arg (g
, 0));
7812 gcc_assert (orig_loop_num
7813 && (unsigned) orig_loop_num
< vec_safe_length (larray
));
7814 if (moved_orig_loop_num
[orig_loop_num
] == 2)
7816 /* If we have moved both loops with this orig_loop_num into
7817 dest_cfun and the LOOP_DIST_ALIAS call is being moved there
7818 too, update the first argument. */
7819 gcc_assert ((*larray
)[orig_loop_num
] != NULL
7820 && (get_loop (saved_cfun
, orig_loop_num
) == NULL
));
7821 tree t
= build_int_cst (integer_type_node
,
7822 (*larray
)[orig_loop_num
]->num
);
7823 gimple_call_set_arg (g
, 0, t
);
7825 /* Make sure the following loop will not update it. */
7826 moved_orig_loop_num
[orig_loop_num
] = 0;
7829 /* Otherwise at least one of the loops stayed in saved_cfun.
7830 Remove the LOOP_DIST_ALIAS call. */
7831 fold_loop_internal_call (g
, gimple_call_arg (g
, 1));
7833 FOR_EACH_BB_FN (bb
, saved_cfun
)
7835 gimple
*g
= find_loop_dist_alias (bb
);
7838 int orig_loop_num
= tree_to_shwi (gimple_call_arg (g
, 0));
7839 gcc_assert (orig_loop_num
7840 && (unsigned) orig_loop_num
< vec_safe_length (larray
));
7841 if (moved_orig_loop_num
[orig_loop_num
])
7842 /* LOOP_DIST_ALIAS call remained in saved_cfun, if at least one
7843 of the corresponding loops was moved, remove it. */
7844 fold_loop_internal_call (g
, gimple_call_arg (g
, 1));
7846 XDELETEVEC (moved_orig_loop_num
);
7850 /* Move blocks from BBS into DEST_CFUN. */
7851 gcc_assert (bbs
.length () >= 2);
7852 after
= dest_cfun
->cfg
->x_entry_block_ptr
;
7853 hash_map
<tree
, tree
> vars_map
;
7855 memset (&d
, 0, sizeof (d
));
7856 d
.orig_block
= orig_block
;
7857 d
.new_block
= DECL_INITIAL (dest_cfun
->decl
);
7858 d
.from_context
= cfun
->decl
;
7859 d
.to_context
= dest_cfun
->decl
;
7860 d
.vars_map
= &vars_map
;
7861 d
.new_label_map
= new_label_map
;
7863 d
.remap_decls_p
= true;
7865 if (gimple_in_ssa_p (cfun
))
7866 for (tree arg
= DECL_ARGUMENTS (d
.to_context
); arg
; arg
= DECL_CHAIN (arg
))
7868 tree narg
= make_ssa_name_fn (dest_cfun
, arg
, gimple_build_nop ());
7869 set_ssa_default_def (dest_cfun
, arg
, narg
);
7870 vars_map
.put (arg
, narg
);
7873 FOR_EACH_VEC_ELT (bbs
, i
, bb
)
7875 /* No need to update edge counts on the last block. It has
7876 already been updated earlier when we detached the region from
7877 the original CFG. */
7878 move_block_to_fn (dest_cfun
, bb
, after
, bb
!= exit_bb
, &d
);
7882 /* Adjust the maximum clique used. */
7883 dest_cfun
->last_clique
= saved_cfun
->last_clique
;
7887 /* Loop sizes are no longer correct, fix them up. */
7888 loop
->num_nodes
-= num_nodes
;
7889 for (class loop
*outer
= loop_outer (loop
);
7890 outer
; outer
= loop_outer (outer
))
7891 outer
->num_nodes
-= num_nodes
;
7892 loop0
->num_nodes
-= bbs
.length () - num_nodes
;
7894 if (saved_cfun
->has_simduid_loops
|| saved_cfun
->has_force_vectorize_loops
)
7897 for (i
= 0; vec_safe_iterate (loops
->larray
, i
, &aloop
); i
++)
7902 replace_by_duplicate_decl (&aloop
->simduid
, d
.vars_map
,
7904 dest_cfun
->has_simduid_loops
= true;
7906 if (aloop
->force_vectorize
)
7907 dest_cfun
->has_force_vectorize_loops
= true;
7911 /* Rewire BLOCK_SUBBLOCKS of orig_block. */
7915 gcc_assert (BLOCK_SUBBLOCKS (DECL_INITIAL (dest_cfun
->decl
))
7917 BLOCK_SUBBLOCKS (DECL_INITIAL (dest_cfun
->decl
))
7918 = BLOCK_SUBBLOCKS (orig_block
);
7919 for (block
= BLOCK_SUBBLOCKS (orig_block
);
7920 block
; block
= BLOCK_CHAIN (block
))
7921 BLOCK_SUPERCONTEXT (block
) = DECL_INITIAL (dest_cfun
->decl
);
7922 BLOCK_SUBBLOCKS (orig_block
) = NULL_TREE
;
7925 replace_block_vars_by_duplicates (DECL_INITIAL (dest_cfun
->decl
),
7926 &vars_map
, dest_cfun
->decl
);
7929 htab_delete (new_label_map
);
7933 /* We need to release ssa-names in a defined order, so first find them,
7934 and then iterate in ascending version order. */
7935 bitmap release_names
= BITMAP_ALLOC (NULL
);
7936 vars_map
.traverse
<void *, gather_ssa_name_hash_map_from
> (release_names
);
7938 EXECUTE_IF_SET_IN_BITMAP (release_names
, 0, i
, bi
)
7939 release_ssa_name (ssa_name (i
));
7940 BITMAP_FREE (release_names
);
7942 /* Rewire the entry and exit blocks. The successor to the entry
7943 block turns into the successor of DEST_FN's ENTRY_BLOCK_PTR in
7944 the child function. Similarly, the predecessor of DEST_FN's
7945 EXIT_BLOCK_PTR turns into the predecessor of EXIT_BLOCK_PTR. We
7946 need to switch CFUN between DEST_CFUN and SAVED_CFUN so that the
7947 various CFG manipulation function get to the right CFG.
7949 FIXME, this is silly. The CFG ought to become a parameter to
7951 push_cfun (dest_cfun
);
7952 ENTRY_BLOCK_PTR_FOR_FN (cfun
)->count
= entry_bb
->count
;
7953 make_single_succ_edge (ENTRY_BLOCK_PTR_FOR_FN (cfun
), entry_bb
, EDGE_FALLTHRU
);
7956 make_single_succ_edge (exit_bb
, EXIT_BLOCK_PTR_FOR_FN (cfun
), 0);
7957 EXIT_BLOCK_PTR_FOR_FN (cfun
)->count
= exit_bb
->count
;
7960 EXIT_BLOCK_PTR_FOR_FN (cfun
)->count
= profile_count::zero ();
7963 /* Back in the original function, the SESE region has disappeared,
7964 create a new basic block in its place. */
7965 bb
= create_empty_bb (entry_pred
[0]);
7967 add_bb_to_loop (bb
, loop
);
7968 for (i
= 0; i
< num_entry_edges
; i
++)
7970 e
= make_edge (entry_pred
[i
], bb
, entry_flag
[i
]);
7971 e
->probability
= entry_prob
[i
];
7974 for (i
= 0; i
< num_exit_edges
; i
++)
7976 e
= make_edge (bb
, exit_succ
[i
], exit_flag
[i
]);
7977 e
->probability
= exit_prob
[i
];
7980 set_immediate_dominator (CDI_DOMINATORS
, bb
, dom_entry
);
7981 FOR_EACH_VEC_ELT (dom_bbs
, i
, abb
)
7982 set_immediate_dominator (CDI_DOMINATORS
, abb
, bb
);
7998 /* Dump default def DEF to file FILE using FLAGS and indentation
8002 dump_default_def (FILE *file
, tree def
, int spc
, dump_flags_t flags
)
8004 for (int i
= 0; i
< spc
; ++i
)
8005 fprintf (file
, " ");
8006 dump_ssaname_info_to_file (file
, def
, spc
);
8008 print_generic_expr (file
, TREE_TYPE (def
), flags
);
8009 fprintf (file
, " ");
8010 print_generic_expr (file
, def
, flags
);
8011 fprintf (file
, " = ");
8012 print_generic_expr (file
, SSA_NAME_VAR (def
), flags
);
8013 fprintf (file
, ";\n");
8016 /* Print no_sanitize attribute to FILE for a given attribute VALUE. */
8019 print_no_sanitize_attr_value (FILE *file
, tree value
)
8021 unsigned int flags
= tree_to_uhwi (value
);
8023 for (int i
= 0; sanitizer_opts
[i
].name
!= NULL
; ++i
)
8025 if ((sanitizer_opts
[i
].flag
& flags
) == sanitizer_opts
[i
].flag
)
8028 fprintf (file
, " | ");
8029 fprintf (file
, "%s", sanitizer_opts
[i
].name
);
8035 /* Dump FUNCTION_DECL FN to file FILE using FLAGS (see TDF_* in dumpfile.h)
8039 dump_function_to_file (tree fndecl
, FILE *file
, dump_flags_t flags
)
8041 tree arg
, var
, old_current_fndecl
= current_function_decl
;
8042 struct function
*dsf
;
8043 bool ignore_topmost_bind
= false, any_var
= false;
8046 bool tmclone
= (TREE_CODE (fndecl
) == FUNCTION_DECL
8047 && decl_is_tm_clone (fndecl
));
8048 struct function
*fun
= DECL_STRUCT_FUNCTION (fndecl
);
8050 tree fntype
= TREE_TYPE (fndecl
);
8051 tree attrs
[] = { DECL_ATTRIBUTES (fndecl
), TYPE_ATTRIBUTES (fntype
) };
8053 for (int i
= 0; i
!= 2; ++i
)
8058 fprintf (file
, "__attribute__((");
8062 for (chain
= attrs
[i
]; chain
; first
= false, chain
= TREE_CHAIN (chain
))
8065 fprintf (file
, ", ");
8067 tree name
= get_attribute_name (chain
);
8068 print_generic_expr (file
, name
, dump_flags
);
8069 if (TREE_VALUE (chain
) != NULL_TREE
)
8071 fprintf (file
, " (");
8073 if (strstr (IDENTIFIER_POINTER (name
), "no_sanitize"))
8074 print_no_sanitize_attr_value (file
, TREE_VALUE (chain
));
8076 print_generic_expr (file
, TREE_VALUE (chain
), dump_flags
);
8077 fprintf (file
, ")");
8081 fprintf (file
, "))\n");
8084 current_function_decl
= fndecl
;
8085 if (flags
& TDF_GIMPLE
)
8087 static bool hotness_bb_param_printed
= false;
8088 if (profile_info
!= NULL
8089 && !hotness_bb_param_printed
)
8091 hotness_bb_param_printed
= true;
8093 "/* --param=gimple-fe-computed-hot-bb-threshold=%" PRId64
8094 " */\n", get_hot_bb_threshold ());
8097 print_generic_expr (file
, TREE_TYPE (TREE_TYPE (fndecl
)),
8098 dump_flags
| TDF_SLIM
);
8099 fprintf (file
, " __GIMPLE (%s",
8100 (fun
->curr_properties
& PROP_ssa
) ? "ssa"
8101 : (fun
->curr_properties
& PROP_cfg
) ? "cfg"
8104 if (fun
&& fun
->cfg
)
8106 basic_block bb
= ENTRY_BLOCK_PTR_FOR_FN (fun
);
8107 if (bb
->count
.initialized_p ())
8108 fprintf (file
, ",%s(%" PRIu64
")",
8109 profile_quality_as_string (bb
->count
.quality ()),
8110 bb
->count
.value ());
8111 if (dump_flags
& TDF_UID
)
8112 fprintf (file
, ")\n%sD_%u (", function_name (fun
),
8115 fprintf (file
, ")\n%s (", function_name (fun
));
8120 print_generic_expr (file
, TREE_TYPE (fntype
), dump_flags
);
8121 if (dump_flags
& TDF_UID
)
8122 fprintf (file
, " %sD.%u %s(", function_name (fun
), DECL_UID (fndecl
),
8123 tmclone
? "[tm-clone] " : "");
8125 fprintf (file
, " %s %s(", function_name (fun
),
8126 tmclone
? "[tm-clone] " : "");
8129 arg
= DECL_ARGUMENTS (fndecl
);
8132 print_generic_expr (file
, TREE_TYPE (arg
), dump_flags
);
8133 fprintf (file
, " ");
8134 print_generic_expr (file
, arg
, dump_flags
);
8135 if (DECL_CHAIN (arg
))
8136 fprintf (file
, ", ");
8137 arg
= DECL_CHAIN (arg
);
8139 fprintf (file
, ")\n");
8141 dsf
= DECL_STRUCT_FUNCTION (fndecl
);
8142 if (dsf
&& (flags
& TDF_EH
))
8143 dump_eh_tree (file
, dsf
);
8145 if (flags
& TDF_RAW
&& !gimple_has_body_p (fndecl
))
8147 dump_node (fndecl
, TDF_SLIM
| flags
, file
);
8148 current_function_decl
= old_current_fndecl
;
8152 /* When GIMPLE is lowered, the variables are no longer available in
8153 BIND_EXPRs, so display them separately. */
8154 if (fun
&& fun
->decl
== fndecl
&& (fun
->curr_properties
& PROP_gimple_lcf
))
8157 ignore_topmost_bind
= true;
8159 fprintf (file
, "{\n");
8160 if (gimple_in_ssa_p (fun
)
8161 && (flags
& TDF_ALIAS
))
8163 for (arg
= DECL_ARGUMENTS (fndecl
); arg
!= NULL
;
8164 arg
= DECL_CHAIN (arg
))
8166 tree def
= ssa_default_def (fun
, arg
);
8168 dump_default_def (file
, def
, 2, flags
);
8171 tree res
= DECL_RESULT (fun
->decl
);
8172 if (res
!= NULL_TREE
8173 && DECL_BY_REFERENCE (res
))
8175 tree def
= ssa_default_def (fun
, res
);
8177 dump_default_def (file
, def
, 2, flags
);
8180 tree static_chain
= fun
->static_chain_decl
;
8181 if (static_chain
!= NULL_TREE
)
8183 tree def
= ssa_default_def (fun
, static_chain
);
8185 dump_default_def (file
, def
, 2, flags
);
8189 if (!vec_safe_is_empty (fun
->local_decls
))
8190 FOR_EACH_LOCAL_DECL (fun
, ix
, var
)
8192 print_generic_decl (file
, var
, flags
);
8193 fprintf (file
, "\n");
8200 if (gimple_in_ssa_p (fun
))
8201 FOR_EACH_SSA_NAME (ix
, name
, fun
)
8203 if (!SSA_NAME_VAR (name
)
8204 /* SSA name with decls without a name still get
8205 dumped as _N, list those explicitely as well even
8206 though we've dumped the decl declaration as D.xxx
8208 || !SSA_NAME_IDENTIFIER (name
))
8210 fprintf (file
, " ");
8211 print_generic_expr (file
, TREE_TYPE (name
), flags
);
8212 fprintf (file
, " ");
8213 print_generic_expr (file
, name
, flags
);
8214 fprintf (file
, ";\n");
8221 if (fun
&& fun
->decl
== fndecl
8223 && basic_block_info_for_fn (fun
))
8225 /* If the CFG has been built, emit a CFG-based dump. */
8226 if (!ignore_topmost_bind
)
8227 fprintf (file
, "{\n");
8229 if (any_var
&& n_basic_blocks_for_fn (fun
))
8230 fprintf (file
, "\n");
8232 FOR_EACH_BB_FN (bb
, fun
)
8233 dump_bb (file
, bb
, 2, flags
);
8235 fprintf (file
, "}\n");
8237 else if (fun
&& (fun
->curr_properties
& PROP_gimple_any
))
8239 /* The function is now in GIMPLE form but the CFG has not been
8240 built yet. Emit the single sequence of GIMPLE statements
8241 that make up its body. */
8242 gimple_seq body
= gimple_body (fndecl
);
8244 if (gimple_seq_first_stmt (body
)
8245 && gimple_seq_first_stmt (body
) == gimple_seq_last_stmt (body
)
8246 && gimple_code (gimple_seq_first_stmt (body
)) == GIMPLE_BIND
)
8247 print_gimple_seq (file
, body
, 0, flags
);
8250 if (!ignore_topmost_bind
)
8251 fprintf (file
, "{\n");
8254 fprintf (file
, "\n");
8256 print_gimple_seq (file
, body
, 2, flags
);
8257 fprintf (file
, "}\n");
8264 /* Make a tree based dump. */
8265 chain
= DECL_SAVED_TREE (fndecl
);
8266 if (chain
&& TREE_CODE (chain
) == BIND_EXPR
)
8268 if (ignore_topmost_bind
)
8270 chain
= BIND_EXPR_BODY (chain
);
8278 if (!ignore_topmost_bind
)
8280 fprintf (file
, "{\n");
8281 /* No topmost bind, pretend it's ignored for later. */
8282 ignore_topmost_bind
= true;
8288 fprintf (file
, "\n");
8290 print_generic_stmt_indented (file
, chain
, flags
, indent
);
8291 if (ignore_topmost_bind
)
8292 fprintf (file
, "}\n");
8295 if (flags
& TDF_ENUMERATE_LOCALS
)
8296 dump_enumerated_decls (file
, flags
);
8297 fprintf (file
, "\n\n");
8299 current_function_decl
= old_current_fndecl
;
8302 /* Dump FUNCTION_DECL FN to stderr using FLAGS (see TDF_* in tree.h) */
8305 debug_function (tree fn
, dump_flags_t flags
)
8307 dump_function_to_file (fn
, stderr
, flags
);
8311 /* Print on FILE the indexes for the predecessors of basic_block BB. */
8314 print_pred_bbs (FILE *file
, basic_block bb
)
8319 FOR_EACH_EDGE (e
, ei
, bb
->preds
)
8320 fprintf (file
, "bb_%d ", e
->src
->index
);
8324 /* Print on FILE the indexes for the successors of basic_block BB. */
8327 print_succ_bbs (FILE *file
, basic_block bb
)
8332 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
8333 fprintf (file
, "bb_%d ", e
->dest
->index
);
8336 /* Print to FILE the basic block BB following the VERBOSITY level. */
8339 print_loops_bb (FILE *file
, basic_block bb
, int indent
, int verbosity
)
8341 char *s_indent
= (char *) alloca ((size_t) indent
+ 1);
8342 memset ((void *) s_indent
, ' ', (size_t) indent
);
8343 s_indent
[indent
] = '\0';
8345 /* Print basic_block's header. */
8348 fprintf (file
, "%s bb_%d (preds = {", s_indent
, bb
->index
);
8349 print_pred_bbs (file
, bb
);
8350 fprintf (file
, "}, succs = {");
8351 print_succ_bbs (file
, bb
);
8352 fprintf (file
, "})\n");
8355 /* Print basic_block's body. */
8358 fprintf (file
, "%s {\n", s_indent
);
8359 dump_bb (file
, bb
, indent
+ 4, TDF_VOPS
|TDF_MEMSYMS
);
8360 fprintf (file
, "%s }\n", s_indent
);
8364 static void print_loop_and_siblings (FILE *, class loop
*, int, int);
8366 /* Pretty print LOOP on FILE, indented INDENT spaces. Following
8367 VERBOSITY level this outputs the contents of the loop, or just its
8371 print_loop (FILE *file
, class loop
*loop
, int indent
, int verbosity
)
8379 s_indent
= (char *) alloca ((size_t) indent
+ 1);
8380 memset ((void *) s_indent
, ' ', (size_t) indent
);
8381 s_indent
[indent
] = '\0';
8383 /* Print loop's header. */
8384 fprintf (file
, "%sloop_%d (", s_indent
, loop
->num
);
8386 fprintf (file
, "header = %d", loop
->header
->index
);
8389 fprintf (file
, "deleted)\n");
8393 fprintf (file
, ", latch = %d", loop
->latch
->index
);
8395 fprintf (file
, ", multiple latches");
8396 fprintf (file
, ", niter = ");
8397 print_generic_expr (file
, loop
->nb_iterations
);
8399 if (loop
->any_upper_bound
)
8401 fprintf (file
, ", upper_bound = ");
8402 print_decu (loop
->nb_iterations_upper_bound
, file
);
8404 if (loop
->any_likely_upper_bound
)
8406 fprintf (file
, ", likely_upper_bound = ");
8407 print_decu (loop
->nb_iterations_likely_upper_bound
, file
);
8410 if (loop
->any_estimate
)
8412 fprintf (file
, ", estimate = ");
8413 print_decu (loop
->nb_iterations_estimate
, file
);
8416 fprintf (file
, ", unroll = %d", loop
->unroll
);
8417 fprintf (file
, ")\n");
8419 /* Print loop's body. */
8422 fprintf (file
, "%s{\n", s_indent
);
8423 FOR_EACH_BB_FN (bb
, cfun
)
8424 if (bb
->loop_father
== loop
)
8425 print_loops_bb (file
, bb
, indent
, verbosity
);
8427 print_loop_and_siblings (file
, loop
->inner
, indent
+ 2, verbosity
);
8428 fprintf (file
, "%s}\n", s_indent
);
8432 /* Print the LOOP and its sibling loops on FILE, indented INDENT
8433 spaces. Following VERBOSITY level this outputs the contents of the
8434 loop, or just its structure. */
8437 print_loop_and_siblings (FILE *file
, class loop
*loop
, int indent
,
8443 print_loop (file
, loop
, indent
, verbosity
);
8444 print_loop_and_siblings (file
, loop
->next
, indent
, verbosity
);
8447 /* Follow a CFG edge from the entry point of the program, and on entry
8448 of a loop, pretty print the loop structure on FILE. */
8451 print_loops (FILE *file
, int verbosity
)
8455 bb
= ENTRY_BLOCK_PTR_FOR_FN (cfun
);
8456 fprintf (file
, "\nLoops in function: %s\n", current_function_name ());
8457 if (bb
&& bb
->loop_father
)
8458 print_loop_and_siblings (file
, bb
->loop_father
, 0, verbosity
);
8464 debug (class loop
&ref
)
8466 print_loop (stderr
, &ref
, 0, /*verbosity*/0);
8470 debug (class loop
*ptr
)
8475 fprintf (stderr
, "<nil>\n");
8478 /* Dump a loop verbosely. */
8481 debug_verbose (class loop
&ref
)
8483 print_loop (stderr
, &ref
, 0, /*verbosity*/3);
8487 debug_verbose (class loop
*ptr
)
8492 fprintf (stderr
, "<nil>\n");
8496 /* Debugging loops structure at tree level, at some VERBOSITY level. */
8499 debug_loops (int verbosity
)
8501 print_loops (stderr
, verbosity
);
8504 /* Print on stderr the code of LOOP, at some VERBOSITY level. */
8507 debug_loop (class loop
*loop
, int verbosity
)
8509 print_loop (stderr
, loop
, 0, verbosity
);
8512 /* Print on stderr the code of loop number NUM, at some VERBOSITY
8516 debug_loop_num (unsigned num
, int verbosity
)
8518 debug_loop (get_loop (cfun
, num
), verbosity
);
8521 /* Return true if BB ends with a call, possibly followed by some
8522 instructions that must stay with the call. Return false,
8526 gimple_block_ends_with_call_p (basic_block bb
)
8528 gimple_stmt_iterator gsi
= gsi_last_nondebug_bb (bb
);
8529 return !gsi_end_p (gsi
) && is_gimple_call (gsi_stmt (gsi
));
8533 /* Return true if BB ends with a conditional branch. Return false,
8537 gimple_block_ends_with_condjump_p (const_basic_block bb
)
8539 gimple
*stmt
= last_stmt (CONST_CAST_BB (bb
));
8540 return (stmt
&& gimple_code (stmt
) == GIMPLE_COND
);
8544 /* Return true if statement T may terminate execution of BB in ways not
8545 explicitly represtented in the CFG. */
8548 stmt_can_terminate_bb_p (gimple
*t
)
8550 tree fndecl
= NULL_TREE
;
8553 /* Eh exception not handled internally terminates execution of the whole
8555 if (stmt_can_throw_external (cfun
, t
))
8558 /* NORETURN and LONGJMP calls already have an edge to exit.
8559 CONST and PURE calls do not need one.
8560 We don't currently check for CONST and PURE here, although
8561 it would be a good idea, because those attributes are
8562 figured out from the RTL in mark_constant_function, and
8563 the counter incrementation code from -fprofile-arcs
8564 leads to different results from -fbranch-probabilities. */
8565 if (is_gimple_call (t
))
8567 fndecl
= gimple_call_fndecl (t
);
8568 call_flags
= gimple_call_flags (t
);
8571 if (is_gimple_call (t
)
8573 && fndecl_built_in_p (fndecl
)
8574 && (call_flags
& ECF_NOTHROW
)
8575 && !(call_flags
& ECF_RETURNS_TWICE
)
8576 /* fork() doesn't really return twice, but the effect of
8577 wrapping it in __gcov_fork() which calls __gcov_dump() and
8578 __gcov_reset() and clears the counters before forking has the same
8579 effect as returning twice. Force a fake edge. */
8580 && !fndecl_built_in_p (fndecl
, BUILT_IN_FORK
))
8583 if (is_gimple_call (t
))
8589 if (call_flags
& (ECF_PURE
| ECF_CONST
)
8590 && !(call_flags
& ECF_LOOPING_CONST_OR_PURE
))
8593 /* Function call may do longjmp, terminate program or do other things.
8594 Special case noreturn that have non-abnormal edges out as in this case
8595 the fact is sufficiently represented by lack of edges out of T. */
8596 if (!(call_flags
& ECF_NORETURN
))
8600 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
8601 if ((e
->flags
& EDGE_FAKE
) == 0)
8605 if (gasm
*asm_stmt
= dyn_cast
<gasm
*> (t
))
8606 if (gimple_asm_volatile_p (asm_stmt
) || gimple_asm_input_p (asm_stmt
))
8613 /* Add fake edges to the function exit for any non constant and non
8614 noreturn calls (or noreturn calls with EH/abnormal edges),
8615 volatile inline assembly in the bitmap of blocks specified by BLOCKS
8616 or to the whole CFG if BLOCKS is zero. Return the number of blocks
8619 The goal is to expose cases in which entering a basic block does
8620 not imply that all subsequent instructions must be executed. */
8623 gimple_flow_call_edges_add (sbitmap blocks
)
8626 int blocks_split
= 0;
8627 int last_bb
= last_basic_block_for_fn (cfun
);
8628 bool check_last_block
= false;
8630 if (n_basic_blocks_for_fn (cfun
) == NUM_FIXED_BLOCKS
)
8634 check_last_block
= true;
8636 check_last_block
= bitmap_bit_p (blocks
,
8637 EXIT_BLOCK_PTR_FOR_FN (cfun
)->prev_bb
->index
);
8639 /* In the last basic block, before epilogue generation, there will be
8640 a fallthru edge to EXIT. Special care is required if the last insn
8641 of the last basic block is a call because make_edge folds duplicate
8642 edges, which would result in the fallthru edge also being marked
8643 fake, which would result in the fallthru edge being removed by
8644 remove_fake_edges, which would result in an invalid CFG.
8646 Moreover, we can't elide the outgoing fake edge, since the block
8647 profiler needs to take this into account in order to solve the minimal
8648 spanning tree in the case that the call doesn't return.
8650 Handle this by adding a dummy instruction in a new last basic block. */
8651 if (check_last_block
)
8653 basic_block bb
= EXIT_BLOCK_PTR_FOR_FN (cfun
)->prev_bb
;
8654 gimple_stmt_iterator gsi
= gsi_last_nondebug_bb (bb
);
8657 if (!gsi_end_p (gsi
))
8660 if (t
&& stmt_can_terminate_bb_p (t
))
8664 e
= find_edge (bb
, EXIT_BLOCK_PTR_FOR_FN (cfun
));
8667 gsi_insert_on_edge (e
, gimple_build_nop ());
8668 gsi_commit_edge_inserts ();
8673 /* Now add fake edges to the function exit for any non constant
8674 calls since there is no way that we can determine if they will
8676 for (i
= 0; i
< last_bb
; i
++)
8678 basic_block bb
= BASIC_BLOCK_FOR_FN (cfun
, i
);
8679 gimple_stmt_iterator gsi
;
8680 gimple
*stmt
, *last_stmt
;
8685 if (blocks
&& !bitmap_bit_p (blocks
, i
))
8688 gsi
= gsi_last_nondebug_bb (bb
);
8689 if (!gsi_end_p (gsi
))
8691 last_stmt
= gsi_stmt (gsi
);
8694 stmt
= gsi_stmt (gsi
);
8695 if (stmt_can_terminate_bb_p (stmt
))
8699 /* The handling above of the final block before the
8700 epilogue should be enough to verify that there is
8701 no edge to the exit block in CFG already.
8702 Calling make_edge in such case would cause us to
8703 mark that edge as fake and remove it later. */
8704 if (flag_checking
&& stmt
== last_stmt
)
8706 e
= find_edge (bb
, EXIT_BLOCK_PTR_FOR_FN (cfun
));
8707 gcc_assert (e
== NULL
);
8710 /* Note that the following may create a new basic block
8711 and renumber the existing basic blocks. */
8712 if (stmt
!= last_stmt
)
8714 e
= split_block (bb
, stmt
);
8718 e
= make_edge (bb
, EXIT_BLOCK_PTR_FOR_FN (cfun
), EDGE_FAKE
);
8719 e
->probability
= profile_probability::guessed_never ();
8723 while (!gsi_end_p (gsi
));
8728 checking_verify_flow_info ();
8730 return blocks_split
;
8733 /* Removes edge E and all the blocks dominated by it, and updates dominance
8734 information. The IL in E->src needs to be updated separately.
8735 If dominance info is not available, only the edge E is removed.*/
8738 remove_edge_and_dominated_blocks (edge e
)
8740 vec
<basic_block
> bbs_to_fix_dom
= vNULL
;
8743 bool none_removed
= false;
8745 basic_block bb
, dbb
;
8748 /* If we are removing a path inside a non-root loop that may change
8749 loop ownership of blocks or remove loops. Mark loops for fixup. */
8751 && loop_outer (e
->src
->loop_father
) != NULL
8752 && e
->src
->loop_father
== e
->dest
->loop_father
)
8753 loops_state_set (LOOPS_NEED_FIXUP
);
8755 if (!dom_info_available_p (CDI_DOMINATORS
))
8761 /* No updating is needed for edges to exit. */
8762 if (e
->dest
== EXIT_BLOCK_PTR_FOR_FN (cfun
))
8764 if (cfgcleanup_altered_bbs
)
8765 bitmap_set_bit (cfgcleanup_altered_bbs
, e
->src
->index
);
8770 /* First, we find the basic blocks to remove. If E->dest has a predecessor
8771 that is not dominated by E->dest, then this set is empty. Otherwise,
8772 all the basic blocks dominated by E->dest are removed.
8774 Also, to DF_IDOM we store the immediate dominators of the blocks in
8775 the dominance frontier of E (i.e., of the successors of the
8776 removed blocks, if there are any, and of E->dest otherwise). */
8777 FOR_EACH_EDGE (f
, ei
, e
->dest
->preds
)
8782 if (!dominated_by_p (CDI_DOMINATORS
, f
->src
, e
->dest
))
8784 none_removed
= true;
8789 auto_bitmap df
, df_idom
;
8790 auto_vec
<basic_block
> bbs_to_remove
;
8792 bitmap_set_bit (df_idom
,
8793 get_immediate_dominator (CDI_DOMINATORS
, e
->dest
)->index
);
8796 bbs_to_remove
= get_all_dominated_blocks (CDI_DOMINATORS
, e
->dest
);
8797 FOR_EACH_VEC_ELT (bbs_to_remove
, i
, bb
)
8799 FOR_EACH_EDGE (f
, ei
, bb
->succs
)
8801 if (f
->dest
!= EXIT_BLOCK_PTR_FOR_FN (cfun
))
8802 bitmap_set_bit (df
, f
->dest
->index
);
8805 FOR_EACH_VEC_ELT (bbs_to_remove
, i
, bb
)
8806 bitmap_clear_bit (df
, bb
->index
);
8808 EXECUTE_IF_SET_IN_BITMAP (df
, 0, i
, bi
)
8810 bb
= BASIC_BLOCK_FOR_FN (cfun
, i
);
8811 bitmap_set_bit (df_idom
,
8812 get_immediate_dominator (CDI_DOMINATORS
, bb
)->index
);
8816 if (cfgcleanup_altered_bbs
)
8818 /* Record the set of the altered basic blocks. */
8819 bitmap_set_bit (cfgcleanup_altered_bbs
, e
->src
->index
);
8820 bitmap_ior_into (cfgcleanup_altered_bbs
, df
);
8823 /* Remove E and the cancelled blocks. */
8828 /* Walk backwards so as to get a chance to substitute all
8829 released DEFs into debug stmts. See
8830 eliminate_unnecessary_stmts() in tree-ssa-dce.cc for more
8832 for (i
= bbs_to_remove
.length (); i
-- > 0; )
8833 delete_basic_block (bbs_to_remove
[i
]);
8836 /* Update the dominance information. The immediate dominator may change only
8837 for blocks whose immediate dominator belongs to DF_IDOM:
8839 Suppose that idom(X) = Y before removal of E and idom(X) != Y after the
8840 removal. Let Z the arbitrary block such that idom(Z) = Y and
8841 Z dominates X after the removal. Before removal, there exists a path P
8842 from Y to X that avoids Z. Let F be the last edge on P that is
8843 removed, and let W = F->dest. Before removal, idom(W) = Y (since Y
8844 dominates W, and because of P, Z does not dominate W), and W belongs to
8845 the dominance frontier of E. Therefore, Y belongs to DF_IDOM. */
8846 EXECUTE_IF_SET_IN_BITMAP (df_idom
, 0, i
, bi
)
8848 bb
= BASIC_BLOCK_FOR_FN (cfun
, i
);
8849 for (dbb
= first_dom_son (CDI_DOMINATORS
, bb
);
8851 dbb
= next_dom_son (CDI_DOMINATORS
, dbb
))
8852 bbs_to_fix_dom
.safe_push (dbb
);
8855 iterate_fix_dominators (CDI_DOMINATORS
, bbs_to_fix_dom
, true);
8857 bbs_to_fix_dom
.release ();
8860 /* Purge dead EH edges from basic block BB. */
8863 gimple_purge_dead_eh_edges (basic_block bb
)
8865 bool changed
= false;
8868 gimple
*stmt
= last_stmt (bb
);
8870 if (stmt
&& stmt_can_throw_internal (cfun
, stmt
))
8873 for (ei
= ei_start (bb
->succs
); (e
= ei_safe_edge (ei
)); )
8875 if (e
->flags
& EDGE_EH
)
8877 remove_edge_and_dominated_blocks (e
);
8887 /* Purge dead EH edges from basic block listed in BLOCKS. */
8890 gimple_purge_all_dead_eh_edges (const_bitmap blocks
)
8892 bool changed
= false;
8896 EXECUTE_IF_SET_IN_BITMAP (blocks
, 0, i
, bi
)
8898 basic_block bb
= BASIC_BLOCK_FOR_FN (cfun
, i
);
8900 /* Earlier gimple_purge_dead_eh_edges could have removed
8901 this basic block already. */
8902 gcc_assert (bb
|| changed
);
8904 changed
|= gimple_purge_dead_eh_edges (bb
);
8910 /* Purge dead abnormal call edges from basic block BB. */
8913 gimple_purge_dead_abnormal_call_edges (basic_block bb
)
8915 bool changed
= false;
8918 gimple
*stmt
= last_stmt (bb
);
8920 if (stmt
&& stmt_can_make_abnormal_goto (stmt
))
8923 for (ei
= ei_start (bb
->succs
); (e
= ei_safe_edge (ei
)); )
8925 if (e
->flags
& EDGE_ABNORMAL
)
8927 if (e
->flags
& EDGE_FALLTHRU
)
8928 e
->flags
&= ~EDGE_ABNORMAL
;
8930 remove_edge_and_dominated_blocks (e
);
8940 /* Purge dead abnormal call edges from basic block listed in BLOCKS. */
8943 gimple_purge_all_dead_abnormal_call_edges (const_bitmap blocks
)
8945 bool changed
= false;
8949 EXECUTE_IF_SET_IN_BITMAP (blocks
, 0, i
, bi
)
8951 basic_block bb
= BASIC_BLOCK_FOR_FN (cfun
, i
);
8953 /* Earlier gimple_purge_dead_abnormal_call_edges could have removed
8954 this basic block already. */
8955 gcc_assert (bb
|| changed
);
8957 changed
|= gimple_purge_dead_abnormal_call_edges (bb
);
8963 /* This function is called whenever a new edge is created or
8967 gimple_execute_on_growing_pred (edge e
)
8969 basic_block bb
= e
->dest
;
8971 if (!gimple_seq_empty_p (phi_nodes (bb
)))
8972 reserve_phi_args_for_new_edge (bb
);
8975 /* This function is called immediately before edge E is removed from
8976 the edge vector E->dest->preds. */
8979 gimple_execute_on_shrinking_pred (edge e
)
8981 if (!gimple_seq_empty_p (phi_nodes (e
->dest
)))
8982 remove_phi_args (e
);
8985 /*---------------------------------------------------------------------------
8986 Helper functions for Loop versioning
8987 ---------------------------------------------------------------------------*/
8989 /* Adjust phi nodes for 'first' basic block. 'second' basic block is a copy
8990 of 'first'. Both of them are dominated by 'new_head' basic block. When
8991 'new_head' was created by 'second's incoming edge it received phi arguments
8992 on the edge by split_edge(). Later, additional edge 'e' was created to
8993 connect 'new_head' and 'first'. Now this routine adds phi args on this
8994 additional edge 'e' that new_head to second edge received as part of edge
8998 gimple_lv_adjust_loop_header_phi (basic_block first
, basic_block second
,
8999 basic_block new_head
, edge e
)
9002 gphi_iterator psi1
, psi2
;
9004 edge e2
= find_edge (new_head
, second
);
9006 /* Because NEW_HEAD has been created by splitting SECOND's incoming
9007 edge, we should always have an edge from NEW_HEAD to SECOND. */
9008 gcc_assert (e2
!= NULL
);
9010 /* Browse all 'second' basic block phi nodes and add phi args to
9011 edge 'e' for 'first' head. PHI args are always in correct order. */
9013 for (psi2
= gsi_start_phis (second
),
9014 psi1
= gsi_start_phis (first
);
9015 !gsi_end_p (psi2
) && !gsi_end_p (psi1
);
9016 gsi_next (&psi2
), gsi_next (&psi1
))
9020 def
= PHI_ARG_DEF (phi2
, e2
->dest_idx
);
9021 add_phi_arg (phi1
, def
, e
, gimple_phi_arg_location_from_edge (phi2
, e2
));
9026 /* Adds a if else statement to COND_BB with condition COND_EXPR.
9027 SECOND_HEAD is the destination of the THEN and FIRST_HEAD is
9028 the destination of the ELSE part. */
9031 gimple_lv_add_condition_to_bb (basic_block first_head ATTRIBUTE_UNUSED
,
9032 basic_block second_head ATTRIBUTE_UNUSED
,
9033 basic_block cond_bb
, void *cond_e
)
9035 gimple_stmt_iterator gsi
;
9036 gimple
*new_cond_expr
;
9037 tree cond_expr
= (tree
) cond_e
;
9040 /* Build new conditional expr */
9041 new_cond_expr
= gimple_build_cond_from_tree (cond_expr
,
9042 NULL_TREE
, NULL_TREE
);
9044 /* Add new cond in cond_bb. */
9045 gsi
= gsi_last_bb (cond_bb
);
9046 gsi_insert_after (&gsi
, new_cond_expr
, GSI_NEW_STMT
);
9048 /* Adjust edges appropriately to connect new head with first head
9049 as well as second head. */
9050 e0
= single_succ_edge (cond_bb
);
9051 e0
->flags
&= ~EDGE_FALLTHRU
;
9052 e0
->flags
|= EDGE_FALSE_VALUE
;
9056 /* Do book-keeping of basic block BB for the profile consistency checker.
9057 Store the counting in RECORD. */
9059 gimple_account_profile_record (basic_block bb
,
9060 struct profile_record
*record
)
9062 gimple_stmt_iterator i
;
9063 for (i
= gsi_start_nondebug_after_labels_bb (bb
); !gsi_end_p (i
);
9064 gsi_next_nondebug (&i
))
9067 += estimate_num_insns (gsi_stmt (i
), &eni_size_weights
);
9070 if (ENTRY_BLOCK_PTR_FOR_FN (cfun
)->count
.ipa ().initialized_p ()
9071 && ENTRY_BLOCK_PTR_FOR_FN (cfun
)->count
.ipa ().nonzero_p ()
9072 && bb
->count
.ipa ().initialized_p ())
9074 += estimate_num_insns (gsi_stmt (i
),
9076 * bb
->count
.ipa ().to_gcov_type ();
9078 else if (bb
->count
.initialized_p ()
9079 && ENTRY_BLOCK_PTR_FOR_FN (cfun
)->count
.initialized_p ())
9081 += estimate_num_insns
9084 * bb
->count
.to_sreal_scale
9085 (ENTRY_BLOCK_PTR_FOR_FN (cfun
)->count
).to_double ();
9088 += estimate_num_insns (gsi_stmt (i
), &eni_time_weights
);
9092 struct cfg_hooks gimple_cfg_hooks
= {
9094 gimple_verify_flow_info
,
9095 gimple_dump_bb
, /* dump_bb */
9096 gimple_dump_bb_for_graph
, /* dump_bb_for_graph */
9097 create_bb
, /* create_basic_block */
9098 gimple_redirect_edge_and_branch
, /* redirect_edge_and_branch */
9099 gimple_redirect_edge_and_branch_force
, /* redirect_edge_and_branch_force */
9100 gimple_can_remove_branch_p
, /* can_remove_branch_p */
9101 remove_bb
, /* delete_basic_block */
9102 gimple_split_block
, /* split_block */
9103 gimple_move_block_after
, /* move_block_after */
9104 gimple_can_merge_blocks_p
, /* can_merge_blocks_p */
9105 gimple_merge_blocks
, /* merge_blocks */
9106 gimple_predict_edge
, /* predict_edge */
9107 gimple_predicted_by_p
, /* predicted_by_p */
9108 gimple_can_duplicate_bb_p
, /* can_duplicate_block_p */
9109 gimple_duplicate_bb
, /* duplicate_block */
9110 gimple_split_edge
, /* split_edge */
9111 gimple_make_forwarder_block
, /* make_forward_block */
9112 NULL
, /* tidy_fallthru_edge */
9113 NULL
, /* force_nonfallthru */
9114 gimple_block_ends_with_call_p
,/* block_ends_with_call_p */
9115 gimple_block_ends_with_condjump_p
, /* block_ends_with_condjump_p */
9116 gimple_flow_call_edges_add
, /* flow_call_edges_add */
9117 gimple_execute_on_growing_pred
, /* execute_on_growing_pred */
9118 gimple_execute_on_shrinking_pred
, /* execute_on_shrinking_pred */
9119 gimple_duplicate_loop_body_to_header_edge
, /* duplicate loop for trees */
9120 gimple_lv_add_condition_to_bb
, /* lv_add_condition_to_bb */
9121 gimple_lv_adjust_loop_header_phi
, /* lv_adjust_loop_header_phi*/
9122 extract_true_false_edges_from_block
, /* extract_cond_bb_edges */
9123 flush_pending_stmts
, /* flush_pending_stmts */
9124 gimple_empty_block_p
, /* block_empty_p */
9125 gimple_split_block_before_cond_jump
, /* split_block_before_cond_jump */
9126 gimple_account_profile_record
,
9130 /* Split all critical edges. Split some extra (not necessarily critical) edges
9131 if FOR_EDGE_INSERTION_P is true. */
9134 split_critical_edges (bool for_edge_insertion_p
/* = false */)
9140 /* split_edge can redirect edges out of SWITCH_EXPRs, which can get
9141 expensive. So we want to enable recording of edge to CASE_LABEL_EXPR
9142 mappings around the calls to split_edge. */
9143 start_recording_case_labels ();
9144 FOR_ALL_BB_FN (bb
, cfun
)
9146 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
9148 if (EDGE_CRITICAL_P (e
) && !(e
->flags
& EDGE_ABNORMAL
))
9150 /* PRE inserts statements to edges and expects that
9151 since split_critical_edges was done beforehand, committing edge
9152 insertions will not split more edges. In addition to critical
9153 edges we must split edges that have multiple successors and
9154 end by control flow statements, such as RESX.
9155 Go ahead and split them too. This matches the logic in
9156 gimple_find_edge_insert_loc. */
9157 else if (for_edge_insertion_p
9158 && (!single_pred_p (e
->dest
)
9159 || !gimple_seq_empty_p (phi_nodes (e
->dest
))
9160 || e
->dest
== EXIT_BLOCK_PTR_FOR_FN (cfun
))
9161 && e
->src
!= ENTRY_BLOCK_PTR_FOR_FN (cfun
)
9162 && !(e
->flags
& EDGE_ABNORMAL
))
9164 gimple_stmt_iterator gsi
;
9166 gsi
= gsi_last_bb (e
->src
);
9167 if (!gsi_end_p (gsi
)
9168 && stmt_ends_bb_p (gsi_stmt (gsi
))
9169 && (gimple_code (gsi_stmt (gsi
)) != GIMPLE_RETURN
9170 && !gimple_call_builtin_p (gsi_stmt (gsi
),
9176 end_recording_case_labels ();
9182 const pass_data pass_data_split_crit_edges
=
9184 GIMPLE_PASS
, /* type */
9185 "crited", /* name */
9186 OPTGROUP_NONE
, /* optinfo_flags */
9187 TV_TREE_SPLIT_EDGES
, /* tv_id */
9188 PROP_cfg
, /* properties_required */
9189 PROP_no_crit_edges
, /* properties_provided */
9190 0, /* properties_destroyed */
9191 0, /* todo_flags_start */
9192 0, /* todo_flags_finish */
9195 class pass_split_crit_edges
: public gimple_opt_pass
9198 pass_split_crit_edges (gcc::context
*ctxt
)
9199 : gimple_opt_pass (pass_data_split_crit_edges
, ctxt
)
9202 /* opt_pass methods: */
9203 virtual unsigned int execute (function
*) { return split_critical_edges (); }
9205 opt_pass
* clone () { return new pass_split_crit_edges (m_ctxt
); }
9206 }; // class pass_split_crit_edges
9211 make_pass_split_crit_edges (gcc::context
*ctxt
)
9213 return new pass_split_crit_edges (ctxt
);
9217 /* Insert COND expression which is GIMPLE_COND after STMT
9218 in basic block BB with appropriate basic block split
9219 and creation of a new conditionally executed basic block.
9220 Update profile so the new bb is visited with probability PROB.
9221 Return created basic block. */
9223 insert_cond_bb (basic_block bb
, gimple
*stmt
, gimple
*cond
,
9224 profile_probability prob
)
9226 edge fall
= split_block (bb
, stmt
);
9227 gimple_stmt_iterator iter
= gsi_last_bb (bb
);
9230 /* Insert cond statement. */
9231 gcc_assert (gimple_code (cond
) == GIMPLE_COND
);
9232 if (gsi_end_p (iter
))
9233 gsi_insert_before (&iter
, cond
, GSI_CONTINUE_LINKING
);
9235 gsi_insert_after (&iter
, cond
, GSI_CONTINUE_LINKING
);
9237 /* Create conditionally executed block. */
9238 new_bb
= create_empty_bb (bb
);
9239 edge e
= make_edge (bb
, new_bb
, EDGE_TRUE_VALUE
);
9240 e
->probability
= prob
;
9241 new_bb
->count
= e
->count ();
9242 make_single_succ_edge (new_bb
, fall
->dest
, EDGE_FALLTHRU
);
9244 /* Fix edge for split bb. */
9245 fall
->flags
= EDGE_FALSE_VALUE
;
9246 fall
->probability
-= e
->probability
;
9248 /* Update dominance info. */
9249 if (dom_info_available_p (CDI_DOMINATORS
))
9251 set_immediate_dominator (CDI_DOMINATORS
, new_bb
, bb
);
9252 set_immediate_dominator (CDI_DOMINATORS
, fall
->dest
, bb
);
9255 /* Update loop info. */
9257 add_bb_to_loop (new_bb
, bb
->loop_father
);
9264 /* Given a basic block B which ends with a conditional and has
9265 precisely two successors, determine which of the edges is taken if
9266 the conditional is true and which is taken if the conditional is
9267 false. Set TRUE_EDGE and FALSE_EDGE appropriately. */
9270 extract_true_false_edges_from_block (basic_block b
,
9274 edge e
= EDGE_SUCC (b
, 0);
9276 if (e
->flags
& EDGE_TRUE_VALUE
)
9279 *false_edge
= EDGE_SUCC (b
, 1);
9284 *true_edge
= EDGE_SUCC (b
, 1);
9289 /* From a controlling predicate in the immediate dominator DOM of
9290 PHIBLOCK determine the edges into PHIBLOCK that are chosen if the
9291 predicate evaluates to true and false and store them to
9292 *TRUE_CONTROLLED_EDGE and *FALSE_CONTROLLED_EDGE if
9293 they are non-NULL. Returns true if the edges can be determined,
9294 else return false. */
9297 extract_true_false_controlled_edges (basic_block dom
, basic_block phiblock
,
9298 edge
*true_controlled_edge
,
9299 edge
*false_controlled_edge
)
9301 basic_block bb
= phiblock
;
9302 edge true_edge
, false_edge
, tem
;
9303 edge e0
= NULL
, e1
= NULL
;
9305 /* We have to verify that one edge into the PHI node is dominated
9306 by the true edge of the predicate block and the other edge
9307 dominated by the false edge. This ensures that the PHI argument
9308 we are going to take is completely determined by the path we
9309 take from the predicate block.
9310 We can only use BB dominance checks below if the destination of
9311 the true/false edges are dominated by their edge, thus only
9312 have a single predecessor. */
9313 extract_true_false_edges_from_block (dom
, &true_edge
, &false_edge
);
9314 tem
= EDGE_PRED (bb
, 0);
9315 if (tem
== true_edge
9316 || (single_pred_p (true_edge
->dest
)
9317 && (tem
->src
== true_edge
->dest
9318 || dominated_by_p (CDI_DOMINATORS
,
9319 tem
->src
, true_edge
->dest
))))
9321 else if (tem
== false_edge
9322 || (single_pred_p (false_edge
->dest
)
9323 && (tem
->src
== false_edge
->dest
9324 || dominated_by_p (CDI_DOMINATORS
,
9325 tem
->src
, false_edge
->dest
))))
9329 tem
= EDGE_PRED (bb
, 1);
9330 if (tem
== true_edge
9331 || (single_pred_p (true_edge
->dest
)
9332 && (tem
->src
== true_edge
->dest
9333 || dominated_by_p (CDI_DOMINATORS
,
9334 tem
->src
, true_edge
->dest
))))
9336 else if (tem
== false_edge
9337 || (single_pred_p (false_edge
->dest
)
9338 && (tem
->src
== false_edge
->dest
9339 || dominated_by_p (CDI_DOMINATORS
,
9340 tem
->src
, false_edge
->dest
))))
9347 if (true_controlled_edge
)
9348 *true_controlled_edge
= e0
;
9349 if (false_controlled_edge
)
9350 *false_controlled_edge
= e1
;
9355 /* Generate a range test LHS CODE RHS that determines whether INDEX is in the
9356 range [low, high]. Place associated stmts before *GSI. */
9359 generate_range_test (basic_block bb
, tree index
, tree low
, tree high
,
9360 tree
*lhs
, tree
*rhs
)
9362 tree type
= TREE_TYPE (index
);
9363 tree utype
= range_check_type (type
);
9365 low
= fold_convert (utype
, low
);
9366 high
= fold_convert (utype
, high
);
9368 gimple_seq seq
= NULL
;
9369 index
= gimple_convert (&seq
, utype
, index
);
9370 *lhs
= gimple_build (&seq
, MINUS_EXPR
, utype
, index
, low
);
9371 *rhs
= const_binop (MINUS_EXPR
, utype
, high
, low
);
9373 gimple_stmt_iterator gsi
= gsi_last_bb (bb
);
9374 gsi_insert_seq_before (&gsi
, seq
, GSI_SAME_STMT
);
9377 /* Return the basic block that belongs to label numbered INDEX
9378 of a switch statement. */
9381 gimple_switch_label_bb (function
*ifun
, gswitch
*gs
, unsigned index
)
9383 return label_to_block (ifun
, CASE_LABEL (gimple_switch_label (gs
, index
)));
9386 /* Return the default basic block of a switch statement. */
9389 gimple_switch_default_bb (function
*ifun
, gswitch
*gs
)
9391 return gimple_switch_label_bb (ifun
, gs
, 0);
9394 /* Return the edge that belongs to label numbered INDEX
9395 of a switch statement. */
9398 gimple_switch_edge (function
*ifun
, gswitch
*gs
, unsigned index
)
9400 return find_edge (gimple_bb (gs
), gimple_switch_label_bb (ifun
, gs
, index
));
9403 /* Return the default edge of a switch statement. */
9406 gimple_switch_default_edge (function
*ifun
, gswitch
*gs
)
9408 return gimple_switch_edge (ifun
, gs
, 0);
9411 /* Return true if the only executable statement in BB is a GIMPLE_COND. */
9414 cond_only_block_p (basic_block bb
)
9416 /* BB must have no executable statements. */
9417 gimple_stmt_iterator gsi
= gsi_after_labels (bb
);
9420 while (!gsi_end_p (gsi
))
9422 gimple
*stmt
= gsi_stmt (gsi
);
9423 if (is_gimple_debug (stmt
))
9425 else if (gimple_code (stmt
) == GIMPLE_NOP
9426 || gimple_code (stmt
) == GIMPLE_PREDICT
9427 || gimple_code (stmt
) == GIMPLE_COND
)
9437 /* Emit return warnings. */
9441 const pass_data pass_data_warn_function_return
=
9443 GIMPLE_PASS
, /* type */
9444 "*warn_function_return", /* name */
9445 OPTGROUP_NONE
, /* optinfo_flags */
9446 TV_NONE
, /* tv_id */
9447 PROP_cfg
, /* properties_required */
9448 0, /* properties_provided */
9449 0, /* properties_destroyed */
9450 0, /* todo_flags_start */
9451 0, /* todo_flags_finish */
9454 class pass_warn_function_return
: public gimple_opt_pass
9457 pass_warn_function_return (gcc::context
*ctxt
)
9458 : gimple_opt_pass (pass_data_warn_function_return
, ctxt
)
9461 /* opt_pass methods: */
9462 virtual unsigned int execute (function
*);
9464 }; // class pass_warn_function_return
9467 pass_warn_function_return::execute (function
*fun
)
9469 location_t location
;
9474 if (!targetm
.warn_func_return (fun
->decl
))
9477 /* If we have a path to EXIT, then we do return. */
9478 if (TREE_THIS_VOLATILE (fun
->decl
)
9479 && EDGE_COUNT (EXIT_BLOCK_PTR_FOR_FN (fun
)->preds
) > 0)
9481 location
= UNKNOWN_LOCATION
;
9482 for (ei
= ei_start (EXIT_BLOCK_PTR_FOR_FN (fun
)->preds
);
9483 (e
= ei_safe_edge (ei
)); )
9485 last
= last_stmt (e
->src
);
9486 if ((gimple_code (last
) == GIMPLE_RETURN
9487 || gimple_call_builtin_p (last
, BUILT_IN_RETURN
))
9488 && location
== UNKNOWN_LOCATION
9489 && ((location
= LOCATION_LOCUS (gimple_location (last
)))
9490 != UNKNOWN_LOCATION
)
9493 /* When optimizing, replace return stmts in noreturn functions
9494 with __builtin_unreachable () call. */
9495 if (optimize
&& gimple_code (last
) == GIMPLE_RETURN
)
9497 tree fndecl
= builtin_decl_implicit (BUILT_IN_UNREACHABLE
);
9498 gimple
*new_stmt
= gimple_build_call (fndecl
, 0);
9499 gimple_set_location (new_stmt
, gimple_location (last
));
9500 gimple_stmt_iterator gsi
= gsi_for_stmt (last
);
9501 gsi_replace (&gsi
, new_stmt
, true);
9507 if (location
== UNKNOWN_LOCATION
)
9508 location
= cfun
->function_end_locus
;
9509 warning_at (location
, 0, "%<noreturn%> function does return");
9512 /* If we see "return;" in some basic block, then we do reach the end
9513 without returning a value. */
9514 else if (warn_return_type
> 0
9515 && !warning_suppressed_p (fun
->decl
, OPT_Wreturn_type
)
9516 && !VOID_TYPE_P (TREE_TYPE (TREE_TYPE (fun
->decl
))))
9518 FOR_EACH_EDGE (e
, ei
, EXIT_BLOCK_PTR_FOR_FN (fun
)->preds
)
9520 gimple
*last
= last_stmt (e
->src
);
9521 greturn
*return_stmt
= dyn_cast
<greturn
*> (last
);
9523 && gimple_return_retval (return_stmt
) == NULL
9524 && !warning_suppressed_p (last
, OPT_Wreturn_type
))
9526 location
= gimple_location (last
);
9527 if (LOCATION_LOCUS (location
) == UNKNOWN_LOCATION
)
9528 location
= fun
->function_end_locus
;
9529 if (warning_at (location
, OPT_Wreturn_type
,
9530 "control reaches end of non-void function"))
9531 suppress_warning (fun
->decl
, OPT_Wreturn_type
);
9535 /* The C++ FE turns fallthrough from the end of non-void function
9536 into __builtin_unreachable () call with BUILTINS_LOCATION.
9537 Recognize those too. */
9539 if (!warning_suppressed_p (fun
->decl
, OPT_Wreturn_type
))
9540 FOR_EACH_BB_FN (bb
, fun
)
9541 if (EDGE_COUNT (bb
->succs
) == 0)
9543 gimple
*last
= last_stmt (bb
);
9544 const enum built_in_function ubsan_missing_ret
9545 = BUILT_IN_UBSAN_HANDLE_MISSING_RETURN
;
9547 && ((LOCATION_LOCUS (gimple_location (last
))
9548 == BUILTINS_LOCATION
9549 && gimple_call_builtin_p (last
, BUILT_IN_UNREACHABLE
))
9550 || gimple_call_builtin_p (last
, ubsan_missing_ret
)))
9552 gimple_stmt_iterator gsi
= gsi_for_stmt (last
);
9553 gsi_prev_nondebug (&gsi
);
9554 gimple
*prev
= gsi_stmt (gsi
);
9556 location
= UNKNOWN_LOCATION
;
9558 location
= gimple_location (prev
);
9559 if (LOCATION_LOCUS (location
) == UNKNOWN_LOCATION
)
9560 location
= fun
->function_end_locus
;
9561 if (warning_at (location
, OPT_Wreturn_type
,
9562 "control reaches end of non-void function"))
9563 suppress_warning (fun
->decl
, OPT_Wreturn_type
);
9574 make_pass_warn_function_return (gcc::context
*ctxt
)
9576 return new pass_warn_function_return (ctxt
);
9579 /* Walk a gimplified function and warn for functions whose return value is
9580 ignored and attribute((warn_unused_result)) is set. This is done before
9581 inlining, so we don't have to worry about that. */
9584 do_warn_unused_result (gimple_seq seq
)
9587 gimple_stmt_iterator i
;
9589 for (i
= gsi_start (seq
); !gsi_end_p (i
); gsi_next (&i
))
9591 gimple
*g
= gsi_stmt (i
);
9593 switch (gimple_code (g
))
9596 do_warn_unused_result (gimple_bind_body (as_a
<gbind
*>(g
)));
9599 do_warn_unused_result (gimple_try_eval (g
));
9600 do_warn_unused_result (gimple_try_cleanup (g
));
9603 do_warn_unused_result (gimple_catch_handler (
9604 as_a
<gcatch
*> (g
)));
9606 case GIMPLE_EH_FILTER
:
9607 do_warn_unused_result (gimple_eh_filter_failure (g
));
9611 if (gimple_call_lhs (g
))
9613 if (gimple_call_internal_p (g
))
9616 /* This is a naked call, as opposed to a GIMPLE_CALL with an
9617 LHS. All calls whose value is ignored should be
9618 represented like this. Look for the attribute. */
9619 fdecl
= gimple_call_fndecl (g
);
9620 ftype
= gimple_call_fntype (g
);
9622 if (lookup_attribute ("warn_unused_result", TYPE_ATTRIBUTES (ftype
)))
9624 location_t loc
= gimple_location (g
);
9627 warning_at (loc
, OPT_Wunused_result
,
9628 "ignoring return value of %qD "
9629 "declared with attribute %<warn_unused_result%>",
9632 warning_at (loc
, OPT_Wunused_result
,
9633 "ignoring return value of function "
9634 "declared with attribute %<warn_unused_result%>");
9639 /* Not a container, not a call, or a call whose value is used. */
9647 const pass_data pass_data_warn_unused_result
=
9649 GIMPLE_PASS
, /* type */
9650 "*warn_unused_result", /* name */
9651 OPTGROUP_NONE
, /* optinfo_flags */
9652 TV_NONE
, /* tv_id */
9653 PROP_gimple_any
, /* properties_required */
9654 0, /* properties_provided */
9655 0, /* properties_destroyed */
9656 0, /* todo_flags_start */
9657 0, /* todo_flags_finish */
9660 class pass_warn_unused_result
: public gimple_opt_pass
9663 pass_warn_unused_result (gcc::context
*ctxt
)
9664 : gimple_opt_pass (pass_data_warn_unused_result
, ctxt
)
9667 /* opt_pass methods: */
9668 virtual bool gate (function
*) { return flag_warn_unused_result
; }
9669 virtual unsigned int execute (function
*)
9671 do_warn_unused_result (gimple_body (current_function_decl
));
9675 }; // class pass_warn_unused_result
9680 make_pass_warn_unused_result (gcc::context
*ctxt
)
9682 return new pass_warn_unused_result (ctxt
);
9685 /* Maybe Remove stores to variables we marked write-only.
9686 Return true if a store was removed. */
9688 maybe_remove_writeonly_store (gimple_stmt_iterator
&gsi
, gimple
*stmt
,
9689 bitmap dce_ssa_names
)
9691 /* Keep access when store has side effect, i.e. in case when source
9693 if (!gimple_store_p (stmt
)
9694 || gimple_has_side_effects (stmt
)
9698 tree lhs
= get_base_address (gimple_get_lhs (stmt
));
9701 || (!TREE_STATIC (lhs
) && !DECL_EXTERNAL (lhs
))
9702 || !varpool_node::get (lhs
)->writeonly
)
9705 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
9707 fprintf (dump_file
, "Removing statement, writes"
9708 " to write only var:\n");
9709 print_gimple_stmt (dump_file
, stmt
, 0,
9710 TDF_VOPS
|TDF_MEMSYMS
);
9713 /* Mark ssa name defining to be checked for simple dce. */
9714 if (gimple_assign_single_p (stmt
))
9716 tree rhs
= gimple_assign_rhs1 (stmt
);
9717 if (TREE_CODE (rhs
) == SSA_NAME
9718 && !SSA_NAME_IS_DEFAULT_DEF (rhs
))
9719 bitmap_set_bit (dce_ssa_names
, SSA_NAME_VERSION (rhs
));
9721 unlink_stmt_vdef (stmt
);
9722 gsi_remove (&gsi
, true);
9723 release_defs (stmt
);
9727 /* IPA passes, compilation of earlier functions or inlining
9728 might have changed some properties, such as marked functions nothrow,
9729 pure, const or noreturn.
9730 Remove redundant edges and basic blocks, and create new ones if necessary. */
9733 execute_fixup_cfg (void)
9736 gimple_stmt_iterator gsi
;
9738 cgraph_node
*node
= cgraph_node::get (current_function_decl
);
9739 /* Same scaling is also done by ipa_merge_profiles. */
9740 profile_count num
= node
->count
;
9741 profile_count den
= ENTRY_BLOCK_PTR_FOR_FN (cfun
)->count
;
9742 bool scale
= num
.initialized_p () && !(num
== den
);
9743 auto_bitmap dce_ssa_names
;
9747 profile_count::adjust_for_ipa_scaling (&num
, &den
);
9748 ENTRY_BLOCK_PTR_FOR_FN (cfun
)->count
= node
->count
;
9749 EXIT_BLOCK_PTR_FOR_FN (cfun
)->count
9750 = EXIT_BLOCK_PTR_FOR_FN (cfun
)->count
.apply_scale (num
, den
);
9753 FOR_EACH_BB_FN (bb
, cfun
)
9756 bb
->count
= bb
->count
.apply_scale (num
, den
);
9757 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
);)
9759 gimple
*stmt
= gsi_stmt (gsi
);
9760 tree decl
= is_gimple_call (stmt
)
9761 ? gimple_call_fndecl (stmt
)
9765 int flags
= gimple_call_flags (stmt
);
9766 if (flags
& (ECF_CONST
| ECF_PURE
| ECF_LOOPING_CONST_OR_PURE
))
9768 if (gimple_purge_dead_abnormal_call_edges (bb
))
9769 todo
|= TODO_cleanup_cfg
;
9771 if (gimple_in_ssa_p (cfun
))
9773 todo
|= TODO_update_ssa
| TODO_cleanup_cfg
;
9778 if (flags
& ECF_NORETURN
9779 && fixup_noreturn_call (stmt
))
9780 todo
|= TODO_cleanup_cfg
;
9783 /* Remove stores to variables we marked write-only. */
9784 if (maybe_remove_writeonly_store (gsi
, stmt
, dce_ssa_names
))
9786 todo
|= TODO_update_ssa
| TODO_cleanup_cfg
;
9790 /* For calls we can simply remove LHS when it is known
9791 to be write-only. */
9792 if (is_gimple_call (stmt
)
9793 && gimple_get_lhs (stmt
))
9795 tree lhs
= get_base_address (gimple_get_lhs (stmt
));
9798 && (TREE_STATIC (lhs
) || DECL_EXTERNAL (lhs
))
9799 && varpool_node::get (lhs
)->writeonly
)
9801 gimple_call_set_lhs (stmt
, NULL
);
9803 todo
|= TODO_update_ssa
| TODO_cleanup_cfg
;
9807 if (maybe_clean_eh_stmt (stmt
)
9808 && gimple_purge_dead_eh_edges (bb
))
9809 todo
|= TODO_cleanup_cfg
;
9813 /* If we have a basic block with no successors that does not
9814 end with a control statement or a noreturn call end it with
9815 a call to __builtin_unreachable. This situation can occur
9816 when inlining a noreturn call that does in fact return. */
9817 if (EDGE_COUNT (bb
->succs
) == 0)
9819 gimple
*stmt
= last_stmt (bb
);
9821 || (!is_ctrl_stmt (stmt
)
9822 && (!is_gimple_call (stmt
)
9823 || !gimple_call_noreturn_p (stmt
))))
9825 if (stmt
&& is_gimple_call (stmt
))
9826 gimple_call_set_ctrl_altering (stmt
, false);
9827 tree fndecl
= builtin_decl_implicit (BUILT_IN_UNREACHABLE
);
9828 stmt
= gimple_build_call (fndecl
, 0);
9829 gimple_stmt_iterator gsi
= gsi_last_bb (bb
);
9830 gsi_insert_after (&gsi
, stmt
, GSI_NEW_STMT
);
9831 if (!cfun
->after_inlining
)
9833 gcall
*call_stmt
= dyn_cast
<gcall
*> (stmt
);
9834 node
->create_edge (cgraph_node::get_create (fndecl
),
9835 call_stmt
, bb
->count
);
9842 update_max_bb_count ();
9843 compute_function_frequency ();
9847 && (todo
& TODO_cleanup_cfg
))
9848 loops_state_set (LOOPS_NEED_FIXUP
);
9850 simple_dce_from_worklist (dce_ssa_names
);
9857 const pass_data pass_data_fixup_cfg
=
9859 GIMPLE_PASS
, /* type */
9860 "fixup_cfg", /* name */
9861 OPTGROUP_NONE
, /* optinfo_flags */
9862 TV_NONE
, /* tv_id */
9863 PROP_cfg
, /* properties_required */
9864 0, /* properties_provided */
9865 0, /* properties_destroyed */
9866 0, /* todo_flags_start */
9867 0, /* todo_flags_finish */
9870 class pass_fixup_cfg
: public gimple_opt_pass
9873 pass_fixup_cfg (gcc::context
*ctxt
)
9874 : gimple_opt_pass (pass_data_fixup_cfg
, ctxt
)
9877 /* opt_pass methods: */
9878 opt_pass
* clone () { return new pass_fixup_cfg (m_ctxt
); }
9879 virtual unsigned int execute (function
*) { return execute_fixup_cfg (); }
9881 }; // class pass_fixup_cfg
9886 make_pass_fixup_cfg (gcc::context
*ctxt
)
9888 return new pass_fixup_cfg (ctxt
);
9891 /* Garbage collection support for edge_def. */
9893 extern void gt_ggc_mx (tree
&);
9894 extern void gt_ggc_mx (gimple
*&);
9895 extern void gt_ggc_mx (rtx
&);
9896 extern void gt_ggc_mx (basic_block
&);
9899 gt_ggc_mx (rtx_insn
*& x
)
9902 gt_ggc_mx_rtx_def ((void *) x
);
9906 gt_ggc_mx (edge_def
*e
)
9908 tree block
= LOCATION_BLOCK (e
->goto_locus
);
9910 gt_ggc_mx (e
->dest
);
9911 if (current_ir_type () == IR_GIMPLE
)
9912 gt_ggc_mx (e
->insns
.g
);
9914 gt_ggc_mx (e
->insns
.r
);
9918 /* PCH support for edge_def. */
9920 extern void gt_pch_nx (tree
&);
9921 extern void gt_pch_nx (gimple
*&);
9922 extern void gt_pch_nx (rtx
&);
9923 extern void gt_pch_nx (basic_block
&);
9926 gt_pch_nx (rtx_insn
*& x
)
9929 gt_pch_nx_rtx_def ((void *) x
);
9933 gt_pch_nx (edge_def
*e
)
9935 tree block
= LOCATION_BLOCK (e
->goto_locus
);
9937 gt_pch_nx (e
->dest
);
9938 if (current_ir_type () == IR_GIMPLE
)
9939 gt_pch_nx (e
->insns
.g
);
9941 gt_pch_nx (e
->insns
.r
);
9946 gt_pch_nx (edge_def
*e
, gt_pointer_operator op
, void *cookie
)
9948 tree block
= LOCATION_BLOCK (e
->goto_locus
);
9949 op (&(e
->src
), NULL
, cookie
);
9950 op (&(e
->dest
), NULL
, cookie
);
9951 if (current_ir_type () == IR_GIMPLE
)
9952 op (&(e
->insns
.g
), NULL
, cookie
);
9954 op (&(e
->insns
.r
), NULL
, cookie
);
9955 op (&(block
), &(block
), cookie
);
9960 namespace selftest
{
9962 /* Helper function for CFG selftests: create a dummy function decl
9963 and push it as cfun. */
9966 push_fndecl (const char *name
)
9968 tree fn_type
= build_function_type_array (integer_type_node
, 0, NULL
);
9969 /* FIXME: this uses input_location: */
9970 tree fndecl
= build_fn_decl (name
, fn_type
);
9971 tree retval
= build_decl (UNKNOWN_LOCATION
, RESULT_DECL
,
9972 NULL_TREE
, integer_type_node
);
9973 DECL_RESULT (fndecl
) = retval
;
9974 push_struct_function (fndecl
);
9975 function
*fun
= DECL_STRUCT_FUNCTION (fndecl
);
9976 ASSERT_TRUE (fun
!= NULL
);
9977 init_empty_tree_cfg_for_function (fun
);
9978 ASSERT_EQ (2, n_basic_blocks_for_fn (fun
));
9979 ASSERT_EQ (0, n_edges_for_fn (fun
));
9983 /* These tests directly create CFGs.
9984 Compare with the static fns within tree-cfg.cc:
9986 - make_blocks: calls create_basic_block (seq, bb);
9989 /* Verify a simple cfg of the form:
9990 ENTRY -> A -> B -> C -> EXIT. */
9993 test_linear_chain ()
9995 gimple_register_cfg_hooks ();
9997 tree fndecl
= push_fndecl ("cfg_test_linear_chain");
9998 function
*fun
= DECL_STRUCT_FUNCTION (fndecl
);
10000 /* Create some empty blocks. */
10001 basic_block bb_a
= create_empty_bb (ENTRY_BLOCK_PTR_FOR_FN (fun
));
10002 basic_block bb_b
= create_empty_bb (bb_a
);
10003 basic_block bb_c
= create_empty_bb (bb_b
);
10005 ASSERT_EQ (5, n_basic_blocks_for_fn (fun
));
10006 ASSERT_EQ (0, n_edges_for_fn (fun
));
10008 /* Create some edges: a simple linear chain of BBs. */
10009 make_edge (ENTRY_BLOCK_PTR_FOR_FN (fun
), bb_a
, EDGE_FALLTHRU
);
10010 make_edge (bb_a
, bb_b
, 0);
10011 make_edge (bb_b
, bb_c
, 0);
10012 make_edge (bb_c
, EXIT_BLOCK_PTR_FOR_FN (fun
), 0);
10014 /* Verify the edges. */
10015 ASSERT_EQ (4, n_edges_for_fn (fun
));
10016 ASSERT_EQ (NULL
, ENTRY_BLOCK_PTR_FOR_FN (fun
)->preds
);
10017 ASSERT_EQ (1, ENTRY_BLOCK_PTR_FOR_FN (fun
)->succs
->length ());
10018 ASSERT_EQ (1, bb_a
->preds
->length ());
10019 ASSERT_EQ (1, bb_a
->succs
->length ());
10020 ASSERT_EQ (1, bb_b
->preds
->length ());
10021 ASSERT_EQ (1, bb_b
->succs
->length ());
10022 ASSERT_EQ (1, bb_c
->preds
->length ());
10023 ASSERT_EQ (1, bb_c
->succs
->length ());
10024 ASSERT_EQ (1, EXIT_BLOCK_PTR_FOR_FN (fun
)->preds
->length ());
10025 ASSERT_EQ (NULL
, EXIT_BLOCK_PTR_FOR_FN (fun
)->succs
);
10027 /* Verify the dominance information
10028 Each BB in our simple chain should be dominated by the one before
10030 calculate_dominance_info (CDI_DOMINATORS
);
10031 ASSERT_EQ (bb_a
, get_immediate_dominator (CDI_DOMINATORS
, bb_b
));
10032 ASSERT_EQ (bb_b
, get_immediate_dominator (CDI_DOMINATORS
, bb_c
));
10033 auto_vec
<basic_block
> dom_by_b
= get_dominated_by (CDI_DOMINATORS
, bb_b
);
10034 ASSERT_EQ (1, dom_by_b
.length ());
10035 ASSERT_EQ (bb_c
, dom_by_b
[0]);
10036 free_dominance_info (CDI_DOMINATORS
);
10038 /* Similarly for post-dominance: each BB in our chain is post-dominated
10039 by the one after it. */
10040 calculate_dominance_info (CDI_POST_DOMINATORS
);
10041 ASSERT_EQ (bb_b
, get_immediate_dominator (CDI_POST_DOMINATORS
, bb_a
));
10042 ASSERT_EQ (bb_c
, get_immediate_dominator (CDI_POST_DOMINATORS
, bb_b
));
10043 auto_vec
<basic_block
> postdom_by_b
= get_dominated_by (CDI_POST_DOMINATORS
, bb_b
);
10044 ASSERT_EQ (1, postdom_by_b
.length ());
10045 ASSERT_EQ (bb_a
, postdom_by_b
[0]);
10046 free_dominance_info (CDI_POST_DOMINATORS
);
10051 /* Verify a simple CFG of the form:
10067 gimple_register_cfg_hooks ();
10069 tree fndecl
= push_fndecl ("cfg_test_diamond");
10070 function
*fun
= DECL_STRUCT_FUNCTION (fndecl
);
10072 /* Create some empty blocks. */
10073 basic_block bb_a
= create_empty_bb (ENTRY_BLOCK_PTR_FOR_FN (fun
));
10074 basic_block bb_b
= create_empty_bb (bb_a
);
10075 basic_block bb_c
= create_empty_bb (bb_a
);
10076 basic_block bb_d
= create_empty_bb (bb_b
);
10078 ASSERT_EQ (6, n_basic_blocks_for_fn (fun
));
10079 ASSERT_EQ (0, n_edges_for_fn (fun
));
10081 /* Create the edges. */
10082 make_edge (ENTRY_BLOCK_PTR_FOR_FN (fun
), bb_a
, EDGE_FALLTHRU
);
10083 make_edge (bb_a
, bb_b
, EDGE_TRUE_VALUE
);
10084 make_edge (bb_a
, bb_c
, EDGE_FALSE_VALUE
);
10085 make_edge (bb_b
, bb_d
, 0);
10086 make_edge (bb_c
, bb_d
, 0);
10087 make_edge (bb_d
, EXIT_BLOCK_PTR_FOR_FN (fun
), 0);
10089 /* Verify the edges. */
10090 ASSERT_EQ (6, n_edges_for_fn (fun
));
10091 ASSERT_EQ (1, bb_a
->preds
->length ());
10092 ASSERT_EQ (2, bb_a
->succs
->length ());
10093 ASSERT_EQ (1, bb_b
->preds
->length ());
10094 ASSERT_EQ (1, bb_b
->succs
->length ());
10095 ASSERT_EQ (1, bb_c
->preds
->length ());
10096 ASSERT_EQ (1, bb_c
->succs
->length ());
10097 ASSERT_EQ (2, bb_d
->preds
->length ());
10098 ASSERT_EQ (1, bb_d
->succs
->length ());
10100 /* Verify the dominance information. */
10101 calculate_dominance_info (CDI_DOMINATORS
);
10102 ASSERT_EQ (bb_a
, get_immediate_dominator (CDI_DOMINATORS
, bb_b
));
10103 ASSERT_EQ (bb_a
, get_immediate_dominator (CDI_DOMINATORS
, bb_c
));
10104 ASSERT_EQ (bb_a
, get_immediate_dominator (CDI_DOMINATORS
, bb_d
));
10105 auto_vec
<basic_block
> dom_by_a
= get_dominated_by (CDI_DOMINATORS
, bb_a
);
10106 ASSERT_EQ (3, dom_by_a
.length ()); /* B, C, D, in some order. */
10107 dom_by_a
.release ();
10108 auto_vec
<basic_block
> dom_by_b
= get_dominated_by (CDI_DOMINATORS
, bb_b
);
10109 ASSERT_EQ (0, dom_by_b
.length ());
10110 dom_by_b
.release ();
10111 free_dominance_info (CDI_DOMINATORS
);
10113 /* Similarly for post-dominance. */
10114 calculate_dominance_info (CDI_POST_DOMINATORS
);
10115 ASSERT_EQ (bb_d
, get_immediate_dominator (CDI_POST_DOMINATORS
, bb_a
));
10116 ASSERT_EQ (bb_d
, get_immediate_dominator (CDI_POST_DOMINATORS
, bb_b
));
10117 ASSERT_EQ (bb_d
, get_immediate_dominator (CDI_POST_DOMINATORS
, bb_c
));
10118 auto_vec
<basic_block
> postdom_by_d
= get_dominated_by (CDI_POST_DOMINATORS
, bb_d
);
10119 ASSERT_EQ (3, postdom_by_d
.length ()); /* A, B, C in some order. */
10120 postdom_by_d
.release ();
10121 auto_vec
<basic_block
> postdom_by_b
= get_dominated_by (CDI_POST_DOMINATORS
, bb_b
);
10122 ASSERT_EQ (0, postdom_by_b
.length ());
10123 postdom_by_b
.release ();
10124 free_dominance_info (CDI_POST_DOMINATORS
);
10129 /* Verify that we can handle a CFG containing a "complete" aka
10130 fully-connected subgraph (where A B C D below all have edges
10131 pointing to each other node, also to themselves).
10149 test_fully_connected ()
10151 gimple_register_cfg_hooks ();
10153 tree fndecl
= push_fndecl ("cfg_fully_connected");
10154 function
*fun
= DECL_STRUCT_FUNCTION (fndecl
);
10158 /* Create some empty blocks. */
10159 auto_vec
<basic_block
> subgraph_nodes
;
10160 for (int i
= 0; i
< n
; i
++)
10161 subgraph_nodes
.safe_push (create_empty_bb (ENTRY_BLOCK_PTR_FOR_FN (fun
)));
10163 ASSERT_EQ (n
+ 2, n_basic_blocks_for_fn (fun
));
10164 ASSERT_EQ (0, n_edges_for_fn (fun
));
10166 /* Create the edges. */
10167 make_edge (ENTRY_BLOCK_PTR_FOR_FN (fun
), subgraph_nodes
[0], EDGE_FALLTHRU
);
10168 make_edge (subgraph_nodes
[0], EXIT_BLOCK_PTR_FOR_FN (fun
), 0);
10169 for (int i
= 0; i
< n
; i
++)
10170 for (int j
= 0; j
< n
; j
++)
10171 make_edge (subgraph_nodes
[i
], subgraph_nodes
[j
], 0);
10173 /* Verify the edges. */
10174 ASSERT_EQ (2 + (n
* n
), n_edges_for_fn (fun
));
10175 /* The first one is linked to ENTRY/EXIT as well as itself and
10176 everything else. */
10177 ASSERT_EQ (n
+ 1, subgraph_nodes
[0]->preds
->length ());
10178 ASSERT_EQ (n
+ 1, subgraph_nodes
[0]->succs
->length ());
10179 /* The other ones in the subgraph are linked to everything in
10180 the subgraph (including themselves). */
10181 for (int i
= 1; i
< n
; i
++)
10183 ASSERT_EQ (n
, subgraph_nodes
[i
]->preds
->length ());
10184 ASSERT_EQ (n
, subgraph_nodes
[i
]->succs
->length ());
10187 /* Verify the dominance information. */
10188 calculate_dominance_info (CDI_DOMINATORS
);
10189 /* The initial block in the subgraph should be dominated by ENTRY. */
10190 ASSERT_EQ (ENTRY_BLOCK_PTR_FOR_FN (fun
),
10191 get_immediate_dominator (CDI_DOMINATORS
,
10192 subgraph_nodes
[0]));
10193 /* Every other block in the subgraph should be dominated by the
10195 for (int i
= 1; i
< n
; i
++)
10196 ASSERT_EQ (subgraph_nodes
[0],
10197 get_immediate_dominator (CDI_DOMINATORS
,
10198 subgraph_nodes
[i
]));
10199 free_dominance_info (CDI_DOMINATORS
);
10201 /* Similarly for post-dominance. */
10202 calculate_dominance_info (CDI_POST_DOMINATORS
);
10203 /* The initial block in the subgraph should be postdominated by EXIT. */
10204 ASSERT_EQ (EXIT_BLOCK_PTR_FOR_FN (fun
),
10205 get_immediate_dominator (CDI_POST_DOMINATORS
,
10206 subgraph_nodes
[0]));
10207 /* Every other block in the subgraph should be postdominated by the
10208 initial block, since that leads to EXIT. */
10209 for (int i
= 1; i
< n
; i
++)
10210 ASSERT_EQ (subgraph_nodes
[0],
10211 get_immediate_dominator (CDI_POST_DOMINATORS
,
10212 subgraph_nodes
[i
]));
10213 free_dominance_info (CDI_POST_DOMINATORS
);
10218 /* Run all of the selftests within this file. */
10221 tree_cfg_cc_tests ()
10223 test_linear_chain ();
10225 test_fully_connected ();
10228 } // namespace selftest
10230 /* TODO: test the dominator/postdominator logic with various graphs/nodes:
10233 - switch statement (a block with many out-edges)
10234 - something that jumps to itself
10237 #endif /* CHECKING_P */