1 /* Control flow functions for trees.
2 Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009,
3 2010, 2011, 2012 Free Software Foundation, Inc.
4 Contributed by Diego Novillo <dnovillo@redhat.com>
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 3, or (at your option)
13 GCC is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
24 #include "coretypes.h"
28 #include "basic-block.h"
32 #include "gimple-pretty-print.h"
33 #include "tree-flow.h"
34 #include "tree-dump.h"
35 #include "tree-pass.h"
36 #include "diagnostic-core.h"
39 #include "tree-ssa-propagate.h"
40 #include "value-prof.h"
41 #include "pointer-set.h"
42 #include "tree-inline.h"
44 /* This file contains functions for building the Control Flow Graph (CFG)
45 for a function tree. */
47 /* Local declarations. */
49 /* Initial capacity for the basic block array. */
50 static const int initial_cfg_capacity = 20;
52 /* This hash table allows us to efficiently lookup all CASE_LABEL_EXPRs
53 which use a particular edge. The CASE_LABEL_EXPRs are chained together
54 via their CASE_CHAIN field, which we clear after we're done with the
55 hash table to prevent problems with duplication of GIMPLE_SWITCHes.
57 Access to this list of CASE_LABEL_EXPRs allows us to efficiently
58 update the case vector in response to edge redirections.
60 Right now this table is set up and torn down at key points in the
61 compilation process. It would be nice if we could make the table
62 more persistent. The key is getting notification of changes to
63 the CFG (particularly edge removal, creation and redirection). */
65 static struct pointer_map_t *edge_to_cases;
67 /* If we record edge_to_cases, this bitmap will hold indexes
68 of basic blocks that end in a GIMPLE_SWITCH which we touched
69 due to edge manipulations. */
71 static bitmap touched_switch_bbs;
76 long num_merged_labels;
79 static struct cfg_stats_d cfg_stats;
81 /* Nonzero if we found a computed goto while building basic blocks. */
82 static bool found_computed_goto;
84 /* Hash table to store last discriminator assigned for each locus. */
85 struct locus_discrim_map
90 static htab_t discriminator_per_locus;
92 /* Basic blocks and flowgraphs. */
93 static void make_blocks (gimple_seq);
94 static void factor_computed_gotos (void);
97 static void make_edges (void);
98 static void make_cond_expr_edges (basic_block);
99 static void make_gimple_switch_edges (basic_block);
100 static void make_goto_expr_edges (basic_block);
101 static void make_gimple_asm_edges (basic_block);
102 static unsigned int locus_map_hash (const void *);
103 static int locus_map_eq (const void *, const void *);
104 static void assign_discriminator (location_t, basic_block);
105 static edge gimple_redirect_edge_and_branch (edge, basic_block);
106 static edge gimple_try_redirect_by_replacing_jump (edge, basic_block);
107 static unsigned int split_critical_edges (void);
109 /* Various helpers. */
110 static inline bool stmt_starts_bb_p (gimple, gimple);
111 static int gimple_verify_flow_info (void);
112 static void gimple_make_forwarder_block (edge);
113 static void gimple_cfg2vcg (FILE *);
114 static gimple first_non_label_stmt (basic_block);
115 static bool verify_gimple_transaction (gimple);
117 /* Flowgraph optimization and cleanup. */
118 static void gimple_merge_blocks (basic_block, basic_block);
119 static bool gimple_can_merge_blocks_p (basic_block, basic_block);
120 static void remove_bb (basic_block);
121 static edge find_taken_edge_computed_goto (basic_block, tree);
122 static edge find_taken_edge_cond_expr (basic_block, tree);
123 static edge find_taken_edge_switch_expr (basic_block, tree);
124 static tree find_case_label_for_value (gimple, tree);
127 init_empty_tree_cfg_for_function (struct function *fn)
129 /* Initialize the basic block array. */
131 profile_status_for_function (fn) = PROFILE_ABSENT;
132 n_basic_blocks_for_function (fn) = NUM_FIXED_BLOCKS;
133 last_basic_block_for_function (fn) = NUM_FIXED_BLOCKS;
134 basic_block_info_for_function (fn)
135 = VEC_alloc (basic_block, gc, initial_cfg_capacity);
136 VEC_safe_grow_cleared (basic_block, gc,
137 basic_block_info_for_function (fn),
138 initial_cfg_capacity);
140 /* Build a mapping of labels to their associated blocks. */
141 label_to_block_map_for_function (fn)
142 = VEC_alloc (basic_block, gc, initial_cfg_capacity);
143 VEC_safe_grow_cleared (basic_block, gc,
144 label_to_block_map_for_function (fn),
145 initial_cfg_capacity);
147 SET_BASIC_BLOCK_FOR_FUNCTION (fn, ENTRY_BLOCK,
148 ENTRY_BLOCK_PTR_FOR_FUNCTION (fn));
149 SET_BASIC_BLOCK_FOR_FUNCTION (fn, EXIT_BLOCK,
150 EXIT_BLOCK_PTR_FOR_FUNCTION (fn));
152 ENTRY_BLOCK_PTR_FOR_FUNCTION (fn)->next_bb
153 = EXIT_BLOCK_PTR_FOR_FUNCTION (fn);
154 EXIT_BLOCK_PTR_FOR_FUNCTION (fn)->prev_bb
155 = ENTRY_BLOCK_PTR_FOR_FUNCTION (fn);
159 init_empty_tree_cfg (void)
161 init_empty_tree_cfg_for_function (cfun);
164 /*---------------------------------------------------------------------------
166 ---------------------------------------------------------------------------*/
168 /* Entry point to the CFG builder for trees. SEQ is the sequence of
169 statements to be added to the flowgraph. */
172 build_gimple_cfg (gimple_seq seq)
174 /* Register specific gimple functions. */
175 gimple_register_cfg_hooks ();
177 memset ((void *) &cfg_stats, 0, sizeof (cfg_stats));
179 init_empty_tree_cfg ();
181 found_computed_goto = 0;
184 /* Computed gotos are hell to deal with, especially if there are
185 lots of them with a large number of destinations. So we factor
186 them to a common computed goto location before we build the
187 edge list. After we convert back to normal form, we will un-factor
188 the computed gotos since factoring introduces an unwanted jump. */
189 if (found_computed_goto)
190 factor_computed_gotos ();
192 /* Make sure there is always at least one block, even if it's empty. */
193 if (n_basic_blocks == NUM_FIXED_BLOCKS)
194 create_empty_bb (ENTRY_BLOCK_PTR);
196 /* Adjust the size of the array. */
197 if (VEC_length (basic_block, basic_block_info) < (size_t) n_basic_blocks)
198 VEC_safe_grow_cleared (basic_block, gc, basic_block_info, n_basic_blocks);
200 /* To speed up statement iterator walks, we first purge dead labels. */
201 cleanup_dead_labels ();
203 /* Group case nodes to reduce the number of edges.
204 We do this after cleaning up dead labels because otherwise we miss
205 a lot of obvious case merging opportunities. */
206 group_case_labels ();
208 /* Create the edges of the flowgraph. */
209 discriminator_per_locus = htab_create (13, locus_map_hash, locus_map_eq,
212 cleanup_dead_labels ();
213 htab_delete (discriminator_per_locus);
215 /* Debugging dumps. */
217 /* Write the flowgraph to a VCG file. */
219 int local_dump_flags;
220 FILE *vcg_file = dump_begin (TDI_vcg, &local_dump_flags);
223 gimple_cfg2vcg (vcg_file);
224 dump_end (TDI_vcg, vcg_file);
230 execute_build_cfg (void)
232 gimple_seq body = gimple_body (current_function_decl);
234 build_gimple_cfg (body);
235 gimple_set_body (current_function_decl, NULL);
236 if (dump_file && (dump_flags & TDF_DETAILS))
238 fprintf (dump_file, "Scope blocks:\n");
239 dump_scope_blocks (dump_file, dump_flags);
244 struct gimple_opt_pass pass_build_cfg =
250 execute_build_cfg, /* execute */
253 0, /* static_pass_number */
254 TV_TREE_CFG, /* tv_id */
255 PROP_gimple_leh, /* properties_required */
256 PROP_cfg, /* properties_provided */
257 0, /* properties_destroyed */
258 0, /* todo_flags_start */
259 TODO_verify_stmts | TODO_cleanup_cfg /* todo_flags_finish */
264 /* Return true if T is a computed goto. */
267 computed_goto_p (gimple t)
269 return (gimple_code (t) == GIMPLE_GOTO
270 && TREE_CODE (gimple_goto_dest (t)) != LABEL_DECL);
274 /* Search the CFG for any computed gotos. If found, factor them to a
275 common computed goto site. Also record the location of that site so
276 that we can un-factor the gotos after we have converted back to
280 factor_computed_gotos (void)
283 tree factored_label_decl = NULL;
285 gimple factored_computed_goto_label = NULL;
286 gimple factored_computed_goto = NULL;
288 /* We know there are one or more computed gotos in this function.
289 Examine the last statement in each basic block to see if the block
290 ends with a computed goto. */
294 gimple_stmt_iterator gsi = gsi_last_bb (bb);
300 last = gsi_stmt (gsi);
302 /* Ignore the computed goto we create when we factor the original
304 if (last == factored_computed_goto)
307 /* If the last statement is a computed goto, factor it. */
308 if (computed_goto_p (last))
312 /* The first time we find a computed goto we need to create
313 the factored goto block and the variable each original
314 computed goto will use for their goto destination. */
315 if (!factored_computed_goto)
317 basic_block new_bb = create_empty_bb (bb);
318 gimple_stmt_iterator new_gsi = gsi_start_bb (new_bb);
320 /* Create the destination of the factored goto. Each original
321 computed goto will put its desired destination into this
322 variable and jump to the label we create immediately
324 var = create_tmp_var (ptr_type_node, "gotovar");
326 /* Build a label for the new block which will contain the
327 factored computed goto. */
328 factored_label_decl = create_artificial_label (UNKNOWN_LOCATION);
329 factored_computed_goto_label
330 = gimple_build_label (factored_label_decl);
331 gsi_insert_after (&new_gsi, factored_computed_goto_label,
334 /* Build our new computed goto. */
335 factored_computed_goto = gimple_build_goto (var);
336 gsi_insert_after (&new_gsi, factored_computed_goto, GSI_NEW_STMT);
339 /* Copy the original computed goto's destination into VAR. */
340 assignment = gimple_build_assign (var, gimple_goto_dest (last));
341 gsi_insert_before (&gsi, assignment, GSI_SAME_STMT);
343 /* And re-vector the computed goto to the new destination. */
344 gimple_goto_set_dest (last, factored_label_decl);
350 /* Build a flowgraph for the sequence of stmts SEQ. */
353 make_blocks (gimple_seq seq)
355 gimple_stmt_iterator i = gsi_start (seq);
357 bool start_new_block = true;
358 bool first_stmt_of_seq = true;
359 basic_block bb = ENTRY_BLOCK_PTR;
361 while (!gsi_end_p (i))
368 /* If the statement starts a new basic block or if we have determined
369 in a previous pass that we need to create a new block for STMT, do
371 if (start_new_block || stmt_starts_bb_p (stmt, prev_stmt))
373 if (!first_stmt_of_seq)
374 gsi_split_seq_before (&i, &seq);
375 bb = create_basic_block (seq, NULL, bb);
376 start_new_block = false;
379 /* Now add STMT to BB and create the subgraphs for special statement
381 gimple_set_bb (stmt, bb);
383 if (computed_goto_p (stmt))
384 found_computed_goto = true;
386 /* If STMT is a basic block terminator, set START_NEW_BLOCK for the
388 if (stmt_ends_bb_p (stmt))
390 /* If the stmt can make abnormal goto use a new temporary
391 for the assignment to the LHS. This makes sure the old value
392 of the LHS is available on the abnormal edge. Otherwise
393 we will end up with overlapping life-ranges for abnormal
395 if (gimple_has_lhs (stmt)
396 && stmt_can_make_abnormal_goto (stmt)
397 && is_gimple_reg_type (TREE_TYPE (gimple_get_lhs (stmt))))
399 tree lhs = gimple_get_lhs (stmt);
400 tree tmp = create_tmp_var (TREE_TYPE (lhs), NULL);
401 gimple s = gimple_build_assign (lhs, tmp);
402 gimple_set_location (s, gimple_location (stmt));
403 gimple_set_block (s, gimple_block (stmt));
404 gimple_set_lhs (stmt, tmp);
405 if (TREE_CODE (TREE_TYPE (tmp)) == COMPLEX_TYPE
406 || TREE_CODE (TREE_TYPE (tmp)) == VECTOR_TYPE)
407 DECL_GIMPLE_REG_P (tmp) = 1;
408 gsi_insert_after (&i, s, GSI_SAME_STMT);
410 start_new_block = true;
414 first_stmt_of_seq = false;
419 /* Create and return a new empty basic block after bb AFTER. */
422 create_bb (void *h, void *e, basic_block after)
428 /* Create and initialize a new basic block. Since alloc_block uses
429 GC allocation that clears memory to allocate a basic block, we do
430 not have to clear the newly allocated basic block here. */
433 bb->index = last_basic_block;
435 set_bb_seq (bb, h ? (gimple_seq) h : NULL);
437 /* Add the new block to the linked list of blocks. */
438 link_block (bb, after);
440 /* Grow the basic block array if needed. */
441 if ((size_t) last_basic_block == VEC_length (basic_block, basic_block_info))
443 size_t new_size = last_basic_block + (last_basic_block + 3) / 4;
444 VEC_safe_grow_cleared (basic_block, gc, basic_block_info, new_size);
447 /* Add the newly created block to the array. */
448 SET_BASIC_BLOCK (last_basic_block, bb);
457 /*---------------------------------------------------------------------------
459 ---------------------------------------------------------------------------*/
461 /* Fold COND_EXPR_COND of each COND_EXPR. */
464 fold_cond_expr_cond (void)
470 gimple stmt = last_stmt (bb);
472 if (stmt && gimple_code (stmt) == GIMPLE_COND)
474 location_t loc = gimple_location (stmt);
478 fold_defer_overflow_warnings ();
479 cond = fold_binary_loc (loc, gimple_cond_code (stmt), boolean_type_node,
480 gimple_cond_lhs (stmt), gimple_cond_rhs (stmt));
483 zerop = integer_zerop (cond);
484 onep = integer_onep (cond);
487 zerop = onep = false;
489 fold_undefer_overflow_warnings (zerop || onep,
491 WARN_STRICT_OVERFLOW_CONDITIONAL);
493 gimple_cond_make_false (stmt);
495 gimple_cond_make_true (stmt);
500 /* Join all the blocks in the flowgraph. */
506 struct omp_region *cur_region = NULL;
508 /* Create an edge from entry to the first block with executable
510 make_edge (ENTRY_BLOCK_PTR, BASIC_BLOCK (NUM_FIXED_BLOCKS), EDGE_FALLTHRU);
512 /* Traverse the basic block array placing edges. */
515 gimple last = last_stmt (bb);
520 enum gimple_code code = gimple_code (last);
524 make_goto_expr_edges (bb);
528 make_edge (bb, EXIT_BLOCK_PTR, 0);
532 make_cond_expr_edges (bb);
536 make_gimple_switch_edges (bb);
540 make_eh_edges (last);
543 case GIMPLE_EH_DISPATCH:
544 fallthru = make_eh_dispatch_edges (last);
548 /* If this function receives a nonlocal goto, then we need to
549 make edges from this call site to all the nonlocal goto
551 if (stmt_can_make_abnormal_goto (last))
552 make_abnormal_goto_edges (bb, true);
554 /* If this statement has reachable exception handlers, then
555 create abnormal edges to them. */
556 make_eh_edges (last);
558 /* BUILTIN_RETURN is really a return statement. */
559 if (gimple_call_builtin_p (last, BUILT_IN_RETURN))
560 make_edge (bb, EXIT_BLOCK_PTR, 0), fallthru = false;
561 /* Some calls are known not to return. */
563 fallthru = !(gimple_call_flags (last) & ECF_NORETURN);
567 /* A GIMPLE_ASSIGN may throw internally and thus be considered
569 if (is_ctrl_altering_stmt (last))
570 make_eh_edges (last);
575 make_gimple_asm_edges (bb);
579 case GIMPLE_OMP_PARALLEL:
580 case GIMPLE_OMP_TASK:
582 case GIMPLE_OMP_SINGLE:
583 case GIMPLE_OMP_MASTER:
584 case GIMPLE_OMP_ORDERED:
585 case GIMPLE_OMP_CRITICAL:
586 case GIMPLE_OMP_SECTION:
587 cur_region = new_omp_region (bb, code, cur_region);
591 case GIMPLE_OMP_SECTIONS:
592 cur_region = new_omp_region (bb, code, cur_region);
596 case GIMPLE_OMP_SECTIONS_SWITCH:
600 case GIMPLE_OMP_ATOMIC_LOAD:
601 case GIMPLE_OMP_ATOMIC_STORE:
605 case GIMPLE_OMP_RETURN:
606 /* In the case of a GIMPLE_OMP_SECTION, the edge will go
607 somewhere other than the next block. This will be
609 cur_region->exit = bb;
610 fallthru = cur_region->type != GIMPLE_OMP_SECTION;
611 cur_region = cur_region->outer;
614 case GIMPLE_OMP_CONTINUE:
615 cur_region->cont = bb;
616 switch (cur_region->type)
619 /* Mark all GIMPLE_OMP_FOR and GIMPLE_OMP_CONTINUE
620 succs edges as abnormal to prevent splitting
622 single_succ_edge (cur_region->entry)->flags |= EDGE_ABNORMAL;
623 /* Make the loopback edge. */
624 make_edge (bb, single_succ (cur_region->entry),
627 /* Create an edge from GIMPLE_OMP_FOR to exit, which
628 corresponds to the case that the body of the loop
629 is not executed at all. */
630 make_edge (cur_region->entry, bb->next_bb, EDGE_ABNORMAL);
631 make_edge (bb, bb->next_bb, EDGE_FALLTHRU | EDGE_ABNORMAL);
635 case GIMPLE_OMP_SECTIONS:
636 /* Wire up the edges into and out of the nested sections. */
638 basic_block switch_bb = single_succ (cur_region->entry);
640 struct omp_region *i;
641 for (i = cur_region->inner; i ; i = i->next)
643 gcc_assert (i->type == GIMPLE_OMP_SECTION);
644 make_edge (switch_bb, i->entry, 0);
645 make_edge (i->exit, bb, EDGE_FALLTHRU);
648 /* Make the loopback edge to the block with
649 GIMPLE_OMP_SECTIONS_SWITCH. */
650 make_edge (bb, switch_bb, 0);
652 /* Make the edge from the switch to exit. */
653 make_edge (switch_bb, bb->next_bb, 0);
663 case GIMPLE_TRANSACTION:
665 tree abort_label = gimple_transaction_label (last);
667 make_edge (bb, label_to_block (abort_label), 0);
673 gcc_assert (!stmt_ends_bb_p (last));
682 make_edge (bb, bb->next_bb, EDGE_FALLTHRU);
684 assign_discriminator (gimple_location (last), bb->next_bb);
691 /* Fold COND_EXPR_COND of each COND_EXPR. */
692 fold_cond_expr_cond ();
695 /* Trivial hash function for a location_t. ITEM is a pointer to
696 a hash table entry that maps a location_t to a discriminator. */
699 locus_map_hash (const void *item)
701 return ((const struct locus_discrim_map *) item)->locus;
704 /* Equality function for the locus-to-discriminator map. VA and VB
705 point to the two hash table entries to compare. */
708 locus_map_eq (const void *va, const void *vb)
710 const struct locus_discrim_map *a = (const struct locus_discrim_map *) va;
711 const struct locus_discrim_map *b = (const struct locus_discrim_map *) vb;
712 return a->locus == b->locus;
715 /* Find the next available discriminator value for LOCUS. The
716 discriminator distinguishes among several basic blocks that
717 share a common locus, allowing for more accurate sample-based
721 next_discriminator_for_locus (location_t locus)
723 struct locus_discrim_map item;
724 struct locus_discrim_map **slot;
727 item.discriminator = 0;
728 slot = (struct locus_discrim_map **)
729 htab_find_slot_with_hash (discriminator_per_locus, (void *) &item,
730 (hashval_t) locus, INSERT);
732 if (*slot == HTAB_EMPTY_ENTRY)
734 *slot = XNEW (struct locus_discrim_map);
736 (*slot)->locus = locus;
737 (*slot)->discriminator = 0;
739 (*slot)->discriminator++;
740 return (*slot)->discriminator;
743 /* Return TRUE if LOCUS1 and LOCUS2 refer to the same source line. */
746 same_line_p (location_t locus1, location_t locus2)
748 expanded_location from, to;
750 if (locus1 == locus2)
753 from = expand_location (locus1);
754 to = expand_location (locus2);
756 if (from.line != to.line)
758 if (from.file == to.file)
760 return (from.file != NULL
762 && filename_cmp (from.file, to.file) == 0);
765 /* Assign a unique discriminator value to block BB if it begins at the same
766 LOCUS as its predecessor block. */
769 assign_discriminator (location_t locus, basic_block bb)
771 gimple first_in_to_bb, last_in_to_bb;
773 if (locus == 0 || bb->discriminator != 0)
776 first_in_to_bb = first_non_label_stmt (bb);
777 last_in_to_bb = last_stmt (bb);
778 if ((first_in_to_bb && same_line_p (locus, gimple_location (first_in_to_bb)))
779 || (last_in_to_bb && same_line_p (locus, gimple_location (last_in_to_bb))))
780 bb->discriminator = next_discriminator_for_locus (locus);
783 /* Create the edges for a GIMPLE_COND starting at block BB. */
786 make_cond_expr_edges (basic_block bb)
788 gimple entry = last_stmt (bb);
789 gimple then_stmt, else_stmt;
790 basic_block then_bb, else_bb;
791 tree then_label, else_label;
793 location_t entry_locus;
796 gcc_assert (gimple_code (entry) == GIMPLE_COND);
798 entry_locus = gimple_location (entry);
800 /* Entry basic blocks for each component. */
801 then_label = gimple_cond_true_label (entry);
802 else_label = gimple_cond_false_label (entry);
803 then_bb = label_to_block (then_label);
804 else_bb = label_to_block (else_label);
805 then_stmt = first_stmt (then_bb);
806 else_stmt = first_stmt (else_bb);
808 e = make_edge (bb, then_bb, EDGE_TRUE_VALUE);
809 assign_discriminator (entry_locus, then_bb);
810 e->goto_locus = gimple_location (then_stmt);
812 e->goto_block = gimple_block (then_stmt);
813 e = make_edge (bb, else_bb, EDGE_FALSE_VALUE);
816 assign_discriminator (entry_locus, else_bb);
817 e->goto_locus = gimple_location (else_stmt);
819 e->goto_block = gimple_block (else_stmt);
822 /* We do not need the labels anymore. */
823 gimple_cond_set_true_label (entry, NULL_TREE);
824 gimple_cond_set_false_label (entry, NULL_TREE);
828 /* Called for each element in the hash table (P) as we delete the
829 edge to cases hash table.
831 Clear all the TREE_CHAINs to prevent problems with copying of
832 SWITCH_EXPRs and structure sharing rules, then free the hash table
836 edge_to_cases_cleanup (const void *key ATTRIBUTE_UNUSED, void **value,
837 void *data ATTRIBUTE_UNUSED)
841 for (t = (tree) *value; t; t = next)
843 next = CASE_CHAIN (t);
844 CASE_CHAIN (t) = NULL;
851 /* Start recording information mapping edges to case labels. */
854 start_recording_case_labels (void)
856 gcc_assert (edge_to_cases == NULL);
857 edge_to_cases = pointer_map_create ();
858 touched_switch_bbs = BITMAP_ALLOC (NULL);
861 /* Return nonzero if we are recording information for case labels. */
864 recording_case_labels_p (void)
866 return (edge_to_cases != NULL);
869 /* Stop recording information mapping edges to case labels and
870 remove any information we have recorded. */
872 end_recording_case_labels (void)
876 pointer_map_traverse (edge_to_cases, edge_to_cases_cleanup, NULL);
877 pointer_map_destroy (edge_to_cases);
878 edge_to_cases = NULL;
879 EXECUTE_IF_SET_IN_BITMAP (touched_switch_bbs, 0, i, bi)
881 basic_block bb = BASIC_BLOCK (i);
884 gimple stmt = last_stmt (bb);
885 if (stmt && gimple_code (stmt) == GIMPLE_SWITCH)
886 group_case_labels_stmt (stmt);
889 BITMAP_FREE (touched_switch_bbs);
892 /* If we are inside a {start,end}_recording_cases block, then return
893 a chain of CASE_LABEL_EXPRs from T which reference E.
895 Otherwise return NULL. */
898 get_cases_for_edge (edge e, gimple t)
903 /* If we are not recording cases, then we do not have CASE_LABEL_EXPR
904 chains available. Return NULL so the caller can detect this case. */
905 if (!recording_case_labels_p ())
908 slot = pointer_map_contains (edge_to_cases, e);
912 /* If we did not find E in the hash table, then this must be the first
913 time we have been queried for information about E & T. Add all the
914 elements from T to the hash table then perform the query again. */
916 n = gimple_switch_num_labels (t);
917 for (i = 0; i < n; i++)
919 tree elt = gimple_switch_label (t, i);
920 tree lab = CASE_LABEL (elt);
921 basic_block label_bb = label_to_block (lab);
922 edge this_edge = find_edge (e->src, label_bb);
924 /* Add it to the chain of CASE_LABEL_EXPRs referencing E, or create
926 slot = pointer_map_insert (edge_to_cases, this_edge);
927 CASE_CHAIN (elt) = (tree) *slot;
931 return (tree) *pointer_map_contains (edge_to_cases, e);
934 /* Create the edges for a GIMPLE_SWITCH starting at block BB. */
937 make_gimple_switch_edges (basic_block bb)
939 gimple entry = last_stmt (bb);
940 location_t entry_locus;
943 entry_locus = gimple_location (entry);
945 n = gimple_switch_num_labels (entry);
947 for (i = 0; i < n; ++i)
949 tree lab = CASE_LABEL (gimple_switch_label (entry, i));
950 basic_block label_bb = label_to_block (lab);
951 make_edge (bb, label_bb, 0);
952 assign_discriminator (entry_locus, label_bb);
957 /* Return the basic block holding label DEST. */
960 label_to_block_fn (struct function *ifun, tree dest)
962 int uid = LABEL_DECL_UID (dest);
964 /* We would die hard when faced by an undefined label. Emit a label to
965 the very first basic block. This will hopefully make even the dataflow
966 and undefined variable warnings quite right. */
967 if (seen_error () && uid < 0)
969 gimple_stmt_iterator gsi = gsi_start_bb (BASIC_BLOCK (NUM_FIXED_BLOCKS));
972 stmt = gimple_build_label (dest);
973 gsi_insert_before (&gsi, stmt, GSI_NEW_STMT);
974 uid = LABEL_DECL_UID (dest);
976 if (VEC_length (basic_block, ifun->cfg->x_label_to_block_map)
977 <= (unsigned int) uid)
979 return VEC_index (basic_block, ifun->cfg->x_label_to_block_map, uid);
982 /* Create edges for an abnormal goto statement at block BB. If FOR_CALL
983 is true, the source statement is a CALL_EXPR instead of a GOTO_EXPR. */
986 make_abnormal_goto_edges (basic_block bb, bool for_call)
988 basic_block target_bb;
989 gimple_stmt_iterator gsi;
991 FOR_EACH_BB (target_bb)
992 for (gsi = gsi_start_bb (target_bb); !gsi_end_p (gsi); gsi_next (&gsi))
994 gimple label_stmt = gsi_stmt (gsi);
997 if (gimple_code (label_stmt) != GIMPLE_LABEL)
1000 target = gimple_label_label (label_stmt);
1002 /* Make an edge to every label block that has been marked as a
1003 potential target for a computed goto or a non-local goto. */
1004 if ((FORCED_LABEL (target) && !for_call)
1005 || (DECL_NONLOCAL (target) && for_call))
1007 make_edge (bb, target_bb, EDGE_ABNORMAL);
1013 /* Create edges for a goto statement at block BB. */
1016 make_goto_expr_edges (basic_block bb)
1018 gimple_stmt_iterator last = gsi_last_bb (bb);
1019 gimple goto_t = gsi_stmt (last);
1021 /* A simple GOTO creates normal edges. */
1022 if (simple_goto_p (goto_t))
1024 tree dest = gimple_goto_dest (goto_t);
1025 basic_block label_bb = label_to_block (dest);
1026 edge e = make_edge (bb, label_bb, EDGE_FALLTHRU);
1027 e->goto_locus = gimple_location (goto_t);
1028 assign_discriminator (e->goto_locus, label_bb);
1030 e->goto_block = gimple_block (goto_t);
1031 gsi_remove (&last, true);
1035 /* A computed GOTO creates abnormal edges. */
1036 make_abnormal_goto_edges (bb, false);
1039 /* Create edges for an asm statement with labels at block BB. */
1042 make_gimple_asm_edges (basic_block bb)
1044 gimple stmt = last_stmt (bb);
1045 location_t stmt_loc = gimple_location (stmt);
1046 int i, n = gimple_asm_nlabels (stmt);
1048 for (i = 0; i < n; ++i)
1050 tree label = TREE_VALUE (gimple_asm_label_op (stmt, i));
1051 basic_block label_bb = label_to_block (label);
1052 make_edge (bb, label_bb, 0);
1053 assign_discriminator (stmt_loc, label_bb);
1057 /*---------------------------------------------------------------------------
1059 ---------------------------------------------------------------------------*/
1061 /* Cleanup useless labels in basic blocks. This is something we wish
1062 to do early because it allows us to group case labels before creating
1063 the edges for the CFG, and it speeds up block statement iterators in
1064 all passes later on.
1065 We rerun this pass after CFG is created, to get rid of the labels that
1066 are no longer referenced. After then we do not run it any more, since
1067 (almost) no new labels should be created. */
1069 /* A map from basic block index to the leading label of that block. */
1070 static struct label_record
1075 /* True if the label is referenced from somewhere. */
1079 /* Given LABEL return the first label in the same basic block. */
1082 main_block_label (tree label)
1084 basic_block bb = label_to_block (label);
1085 tree main_label = label_for_bb[bb->index].label;
1087 /* label_to_block possibly inserted undefined label into the chain. */
1090 label_for_bb[bb->index].label = label;
1094 label_for_bb[bb->index].used = true;
1098 /* Clean up redundant labels within the exception tree. */
1101 cleanup_dead_labels_eh (void)
1108 if (cfun->eh == NULL)
1111 for (i = 1; VEC_iterate (eh_landing_pad, cfun->eh->lp_array, i, lp); ++i)
1112 if (lp && lp->post_landing_pad)
1114 lab = main_block_label (lp->post_landing_pad);
1115 if (lab != lp->post_landing_pad)
1117 EH_LANDING_PAD_NR (lp->post_landing_pad) = 0;
1118 EH_LANDING_PAD_NR (lab) = lp->index;
1122 FOR_ALL_EH_REGION (r)
1126 case ERT_MUST_NOT_THROW:
1132 for (c = r->u.eh_try.first_catch; c ; c = c->next_catch)
1136 c->label = main_block_label (lab);
1141 case ERT_ALLOWED_EXCEPTIONS:
1142 lab = r->u.allowed.label;
1144 r->u.allowed.label = main_block_label (lab);
1150 /* Cleanup redundant labels. This is a three-step process:
1151 1) Find the leading label for each block.
1152 2) Redirect all references to labels to the leading labels.
1153 3) Cleanup all useless labels. */
1156 cleanup_dead_labels (void)
1159 label_for_bb = XCNEWVEC (struct label_record, last_basic_block);
1161 /* Find a suitable label for each block. We use the first user-defined
1162 label if there is one, or otherwise just the first label we see. */
1165 gimple_stmt_iterator i;
1167 for (i = gsi_start_bb (bb); !gsi_end_p (i); gsi_next (&i))
1170 gimple stmt = gsi_stmt (i);
1172 if (gimple_code (stmt) != GIMPLE_LABEL)
1175 label = gimple_label_label (stmt);
1177 /* If we have not yet seen a label for the current block,
1178 remember this one and see if there are more labels. */
1179 if (!label_for_bb[bb->index].label)
1181 label_for_bb[bb->index].label = label;
1185 /* If we did see a label for the current block already, but it
1186 is an artificially created label, replace it if the current
1187 label is a user defined label. */
1188 if (!DECL_ARTIFICIAL (label)
1189 && DECL_ARTIFICIAL (label_for_bb[bb->index].label))
1191 label_for_bb[bb->index].label = label;
1197 /* Now redirect all jumps/branches to the selected label.
1198 First do so for each block ending in a control statement. */
1201 gimple stmt = last_stmt (bb);
1202 tree label, new_label;
1207 switch (gimple_code (stmt))
1210 label = gimple_cond_true_label (stmt);
1213 new_label = main_block_label (label);
1214 if (new_label != label)
1215 gimple_cond_set_true_label (stmt, new_label);
1218 label = gimple_cond_false_label (stmt);
1221 new_label = main_block_label (label);
1222 if (new_label != label)
1223 gimple_cond_set_false_label (stmt, new_label);
1229 size_t i, n = gimple_switch_num_labels (stmt);
1231 /* Replace all destination labels. */
1232 for (i = 0; i < n; ++i)
1234 tree case_label = gimple_switch_label (stmt, i);
1235 label = CASE_LABEL (case_label);
1236 new_label = main_block_label (label);
1237 if (new_label != label)
1238 CASE_LABEL (case_label) = new_label;
1245 int i, n = gimple_asm_nlabels (stmt);
1247 for (i = 0; i < n; ++i)
1249 tree cons = gimple_asm_label_op (stmt, i);
1250 tree label = main_block_label (TREE_VALUE (cons));
1251 TREE_VALUE (cons) = label;
1256 /* We have to handle gotos until they're removed, and we don't
1257 remove them until after we've created the CFG edges. */
1259 if (!computed_goto_p (stmt))
1261 label = gimple_goto_dest (stmt);
1262 new_label = main_block_label (label);
1263 if (new_label != label)
1264 gimple_goto_set_dest (stmt, new_label);
1268 case GIMPLE_TRANSACTION:
1270 tree label = gimple_transaction_label (stmt);
1273 tree new_label = main_block_label (label);
1274 if (new_label != label)
1275 gimple_transaction_set_label (stmt, new_label);
1285 /* Do the same for the exception region tree labels. */
1286 cleanup_dead_labels_eh ();
1288 /* Finally, purge dead labels. All user-defined labels and labels that
1289 can be the target of non-local gotos and labels which have their
1290 address taken are preserved. */
1293 gimple_stmt_iterator i;
1294 tree label_for_this_bb = label_for_bb[bb->index].label;
1296 if (!label_for_this_bb)
1299 /* If the main label of the block is unused, we may still remove it. */
1300 if (!label_for_bb[bb->index].used)
1301 label_for_this_bb = NULL;
1303 for (i = gsi_start_bb (bb); !gsi_end_p (i); )
1306 gimple stmt = gsi_stmt (i);
1308 if (gimple_code (stmt) != GIMPLE_LABEL)
1311 label = gimple_label_label (stmt);
1313 if (label == label_for_this_bb
1314 || !DECL_ARTIFICIAL (label)
1315 || DECL_NONLOCAL (label)
1316 || FORCED_LABEL (label))
1319 gsi_remove (&i, true);
1323 free (label_for_bb);
1326 /* Scan the sorted vector of cases in STMT (a GIMPLE_SWITCH) and combine
1327 the ones jumping to the same label.
1328 Eg. three separate entries 1: 2: 3: become one entry 1..3: */
1331 group_case_labels_stmt (gimple stmt)
1333 int old_size = gimple_switch_num_labels (stmt);
1334 int i, j, new_size = old_size;
1335 tree default_case = NULL_TREE;
1336 tree default_label = NULL_TREE;
1339 /* The default label is always the first case in a switch
1340 statement after gimplification if it was not optimized
1342 if (!CASE_LOW (gimple_switch_default_label (stmt))
1343 && !CASE_HIGH (gimple_switch_default_label (stmt)))
1345 default_case = gimple_switch_default_label (stmt);
1346 default_label = CASE_LABEL (default_case);
1350 has_default = false;
1352 /* Look for possible opportunities to merge cases. */
1357 while (i < old_size)
1359 tree base_case, base_label, base_high;
1360 base_case = gimple_switch_label (stmt, i);
1362 gcc_assert (base_case);
1363 base_label = CASE_LABEL (base_case);
1365 /* Discard cases that have the same destination as the
1367 if (base_label == default_label)
1369 gimple_switch_set_label (stmt, i, NULL_TREE);
1375 base_high = CASE_HIGH (base_case)
1376 ? CASE_HIGH (base_case)
1377 : CASE_LOW (base_case);
1380 /* Try to merge case labels. Break out when we reach the end
1381 of the label vector or when we cannot merge the next case
1382 label with the current one. */
1383 while (i < old_size)
1385 tree merge_case = gimple_switch_label (stmt, i);
1386 tree merge_label = CASE_LABEL (merge_case);
1387 double_int bhp1 = double_int_add (tree_to_double_int (base_high),
1390 /* Merge the cases if they jump to the same place,
1391 and their ranges are consecutive. */
1392 if (merge_label == base_label
1393 && double_int_equal_p (tree_to_double_int (CASE_LOW (merge_case)),
1396 base_high = CASE_HIGH (merge_case) ?
1397 CASE_HIGH (merge_case) : CASE_LOW (merge_case);
1398 CASE_HIGH (base_case) = base_high;
1399 gimple_switch_set_label (stmt, i, NULL_TREE);
1408 /* Compress the case labels in the label vector, and adjust the
1409 length of the vector. */
1410 for (i = 0, j = 0; i < new_size; i++)
1412 while (! gimple_switch_label (stmt, j))
1414 gimple_switch_set_label (stmt, i,
1415 gimple_switch_label (stmt, j++));
1418 gcc_assert (new_size <= old_size);
1419 gimple_switch_set_num_labels (stmt, new_size);
1422 /* Look for blocks ending in a multiway branch (a GIMPLE_SWITCH),
1423 and scan the sorted vector of cases. Combine the ones jumping to the
1427 group_case_labels (void)
1433 gimple stmt = last_stmt (bb);
1434 if (stmt && gimple_code (stmt) == GIMPLE_SWITCH)
1435 group_case_labels_stmt (stmt);
1439 /* Checks whether we can merge block B into block A. */
1442 gimple_can_merge_blocks_p (basic_block a, basic_block b)
1445 gimple_stmt_iterator gsi;
1448 if (!single_succ_p (a))
1451 if (single_succ_edge (a)->flags & EDGE_COMPLEX)
1454 if (single_succ (a) != b)
1457 if (!single_pred_p (b))
1460 if (b == EXIT_BLOCK_PTR)
1463 /* If A ends by a statement causing exceptions or something similar, we
1464 cannot merge the blocks. */
1465 stmt = last_stmt (a);
1466 if (stmt && stmt_ends_bb_p (stmt))
1469 /* Do not allow a block with only a non-local label to be merged. */
1471 && gimple_code (stmt) == GIMPLE_LABEL
1472 && DECL_NONLOCAL (gimple_label_label (stmt)))
1475 /* Examine the labels at the beginning of B. */
1476 for (gsi = gsi_start_bb (b); !gsi_end_p (gsi); gsi_next (&gsi))
1479 stmt = gsi_stmt (gsi);
1480 if (gimple_code (stmt) != GIMPLE_LABEL)
1482 lab = gimple_label_label (stmt);
1484 /* Do not remove user forced labels or for -O0 any user labels. */
1485 if (!DECL_ARTIFICIAL (lab) && (!optimize || FORCED_LABEL (lab)))
1489 /* Protect the loop latches. */
1490 if (current_loops && b->loop_father->latch == b)
1493 /* It must be possible to eliminate all phi nodes in B. If ssa form
1494 is not up-to-date and a name-mapping is registered, we cannot eliminate
1495 any phis. Symbols marked for renaming are never a problem though. */
1496 phis = phi_nodes (b);
1497 if (!gimple_seq_empty_p (phis)
1498 && name_mappings_registered_p ())
1501 /* When not optimizing, don't merge if we'd lose goto_locus. */
1503 && single_succ_edge (a)->goto_locus != UNKNOWN_LOCATION)
1505 location_t goto_locus = single_succ_edge (a)->goto_locus;
1506 gimple_stmt_iterator prev, next;
1507 prev = gsi_last_nondebug_bb (a);
1508 next = gsi_after_labels (b);
1509 if (!gsi_end_p (next) && is_gimple_debug (gsi_stmt (next)))
1510 gsi_next_nondebug (&next);
1511 if ((gsi_end_p (prev)
1512 || gimple_location (gsi_stmt (prev)) != goto_locus)
1513 && (gsi_end_p (next)
1514 || gimple_location (gsi_stmt (next)) != goto_locus))
1521 /* Return true if the var whose chain of uses starts at PTR has no
1524 has_zero_uses_1 (const ssa_use_operand_t *head)
1526 const ssa_use_operand_t *ptr;
1528 for (ptr = head->next; ptr != head; ptr = ptr->next)
1529 if (!is_gimple_debug (USE_STMT (ptr)))
1535 /* Return true if the var whose chain of uses starts at PTR has a
1536 single nondebug use. Set USE_P and STMT to that single nondebug
1537 use, if so, or to NULL otherwise. */
1539 single_imm_use_1 (const ssa_use_operand_t *head,
1540 use_operand_p *use_p, gimple *stmt)
1542 ssa_use_operand_t *ptr, *single_use = 0;
1544 for (ptr = head->next; ptr != head; ptr = ptr->next)
1545 if (!is_gimple_debug (USE_STMT (ptr)))
1556 *use_p = single_use;
1559 *stmt = single_use ? single_use->loc.stmt : NULL;
1561 return !!single_use;
1564 /* Replaces all uses of NAME by VAL. */
1567 replace_uses_by (tree name, tree val)
1569 imm_use_iterator imm_iter;
1574 FOR_EACH_IMM_USE_STMT (stmt, imm_iter, name)
1576 FOR_EACH_IMM_USE_ON_STMT (use, imm_iter)
1578 replace_exp (use, val);
1580 if (gimple_code (stmt) == GIMPLE_PHI)
1582 e = gimple_phi_arg_edge (stmt, PHI_ARG_INDEX_FROM_USE (use));
1583 if (e->flags & EDGE_ABNORMAL)
1585 /* This can only occur for virtual operands, since
1586 for the real ones SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name))
1587 would prevent replacement. */
1588 gcc_checking_assert (!is_gimple_reg (name));
1589 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (val) = 1;
1594 if (gimple_code (stmt) != GIMPLE_PHI)
1596 gimple_stmt_iterator gsi = gsi_for_stmt (stmt);
1597 gimple orig_stmt = stmt;
1600 /* Mark the block if we changed the last stmt in it. */
1601 if (cfgcleanup_altered_bbs
1602 && stmt_ends_bb_p (stmt))
1603 bitmap_set_bit (cfgcleanup_altered_bbs, gimple_bb (stmt)->index);
1605 /* FIXME. It shouldn't be required to keep TREE_CONSTANT
1606 on ADDR_EXPRs up-to-date on GIMPLE. Propagation will
1607 only change sth from non-invariant to invariant, and only
1608 when propagating constants. */
1609 if (is_gimple_min_invariant (val))
1610 for (i = 0; i < gimple_num_ops (stmt); i++)
1612 tree op = gimple_op (stmt, i);
1613 /* Operands may be empty here. For example, the labels
1614 of a GIMPLE_COND are nulled out following the creation
1615 of the corresponding CFG edges. */
1616 if (op && TREE_CODE (op) == ADDR_EXPR)
1617 recompute_tree_invariant_for_addr_expr (op);
1620 if (fold_stmt (&gsi))
1621 stmt = gsi_stmt (gsi);
1623 if (maybe_clean_or_replace_eh_stmt (orig_stmt, stmt))
1624 gimple_purge_dead_eh_edges (gimple_bb (stmt));
1630 gcc_checking_assert (has_zero_uses (name));
1632 /* Also update the trees stored in loop structures. */
1638 FOR_EACH_LOOP (li, loop, 0)
1640 substitute_in_loop_info (loop, name, val);
1645 /* Merge block B into block A. */
1648 gimple_merge_blocks (basic_block a, basic_block b)
1650 gimple_stmt_iterator last, gsi, psi;
1653 fprintf (dump_file, "Merging blocks %d and %d\n", a->index, b->index);
1655 /* Remove all single-valued PHI nodes from block B of the form
1656 V_i = PHI <V_j> by propagating V_j to all the uses of V_i. */
1657 gsi = gsi_last_bb (a);
1658 for (psi = gsi_start_phis (b); !gsi_end_p (psi); )
1660 gimple phi = gsi_stmt (psi);
1661 tree def = gimple_phi_result (phi), use = gimple_phi_arg_def (phi, 0);
1663 bool may_replace_uses = !is_gimple_reg (def)
1664 || may_propagate_copy (def, use);
1666 /* In case we maintain loop closed ssa form, do not propagate arguments
1667 of loop exit phi nodes. */
1669 && loops_state_satisfies_p (LOOP_CLOSED_SSA)
1670 && is_gimple_reg (def)
1671 && TREE_CODE (use) == SSA_NAME
1672 && a->loop_father != b->loop_father)
1673 may_replace_uses = false;
1675 if (!may_replace_uses)
1677 gcc_assert (is_gimple_reg (def));
1679 /* Note that just emitting the copies is fine -- there is no problem
1680 with ordering of phi nodes. This is because A is the single
1681 predecessor of B, therefore results of the phi nodes cannot
1682 appear as arguments of the phi nodes. */
1683 copy = gimple_build_assign (def, use);
1684 gsi_insert_after (&gsi, copy, GSI_NEW_STMT);
1685 remove_phi_node (&psi, false);
1689 /* If we deal with a PHI for virtual operands, we can simply
1690 propagate these without fussing with folding or updating
1692 if (!is_gimple_reg (def))
1694 imm_use_iterator iter;
1695 use_operand_p use_p;
1698 FOR_EACH_IMM_USE_STMT (stmt, iter, def)
1699 FOR_EACH_IMM_USE_ON_STMT (use_p, iter)
1700 SET_USE (use_p, use);
1702 if (SSA_NAME_OCCURS_IN_ABNORMAL_PHI (def))
1703 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (use) = 1;
1706 replace_uses_by (def, use);
1708 remove_phi_node (&psi, true);
1712 /* Ensure that B follows A. */
1713 move_block_after (b, a);
1715 gcc_assert (single_succ_edge (a)->flags & EDGE_FALLTHRU);
1716 gcc_assert (!last_stmt (a) || !stmt_ends_bb_p (last_stmt (a)));
1718 /* Remove labels from B and set gimple_bb to A for other statements. */
1719 for (gsi = gsi_start_bb (b); !gsi_end_p (gsi);)
1721 gimple stmt = gsi_stmt (gsi);
1722 if (gimple_code (stmt) == GIMPLE_LABEL)
1724 tree label = gimple_label_label (stmt);
1727 gsi_remove (&gsi, false);
1729 /* Now that we can thread computed gotos, we might have
1730 a situation where we have a forced label in block B
1731 However, the label at the start of block B might still be
1732 used in other ways (think about the runtime checking for
1733 Fortran assigned gotos). So we can not just delete the
1734 label. Instead we move the label to the start of block A. */
1735 if (FORCED_LABEL (label))
1737 gimple_stmt_iterator dest_gsi = gsi_start_bb (a);
1738 gsi_insert_before (&dest_gsi, stmt, GSI_NEW_STMT);
1740 /* Other user labels keep around in a form of a debug stmt. */
1741 else if (!DECL_ARTIFICIAL (label) && MAY_HAVE_DEBUG_STMTS)
1743 gimple dbg = gimple_build_debug_bind (label,
1746 gimple_debug_bind_reset_value (dbg);
1747 gsi_insert_before (&gsi, dbg, GSI_SAME_STMT);
1750 lp_nr = EH_LANDING_PAD_NR (label);
1753 eh_landing_pad lp = get_eh_landing_pad_from_number (lp_nr);
1754 lp->post_landing_pad = NULL;
1759 gimple_set_bb (stmt, a);
1764 /* Merge the sequences. */
1765 last = gsi_last_bb (a);
1766 gsi_insert_seq_after (&last, bb_seq (b), GSI_NEW_STMT);
1767 set_bb_seq (b, NULL);
1769 if (cfgcleanup_altered_bbs)
1770 bitmap_set_bit (cfgcleanup_altered_bbs, a->index);
1774 /* Return the one of two successors of BB that is not reachable by a
1775 complex edge, if there is one. Else, return BB. We use
1776 this in optimizations that use post-dominators for their heuristics,
1777 to catch the cases in C++ where function calls are involved. */
1780 single_noncomplex_succ (basic_block bb)
1783 if (EDGE_COUNT (bb->succs) != 2)
1786 e0 = EDGE_SUCC (bb, 0);
1787 e1 = EDGE_SUCC (bb, 1);
1788 if (e0->flags & EDGE_COMPLEX)
1790 if (e1->flags & EDGE_COMPLEX)
1796 /* T is CALL_EXPR. Set current_function_calls_* flags. */
1799 notice_special_calls (gimple call)
1801 int flags = gimple_call_flags (call);
1803 if (flags & ECF_MAY_BE_ALLOCA)
1804 cfun->calls_alloca = true;
1805 if (flags & ECF_RETURNS_TWICE)
1806 cfun->calls_setjmp = true;
1810 /* Clear flags set by notice_special_calls. Used by dead code removal
1811 to update the flags. */
1814 clear_special_calls (void)
1816 cfun->calls_alloca = false;
1817 cfun->calls_setjmp = false;
1820 /* Remove PHI nodes associated with basic block BB and all edges out of BB. */
1823 remove_phi_nodes_and_edges_for_unreachable_block (basic_block bb)
1825 /* Since this block is no longer reachable, we can just delete all
1826 of its PHI nodes. */
1827 remove_phi_nodes (bb);
1829 /* Remove edges to BB's successors. */
1830 while (EDGE_COUNT (bb->succs) > 0)
1831 remove_edge (EDGE_SUCC (bb, 0));
1835 /* Remove statements of basic block BB. */
1838 remove_bb (basic_block bb)
1840 gimple_stmt_iterator i;
1844 fprintf (dump_file, "Removing basic block %d\n", bb->index);
1845 if (dump_flags & TDF_DETAILS)
1847 dump_bb (dump_file, bb, 0, dump_flags);
1848 fprintf (dump_file, "\n");
1854 struct loop *loop = bb->loop_father;
1856 /* If a loop gets removed, clean up the information associated
1858 if (loop->latch == bb
1859 || loop->header == bb)
1860 free_numbers_of_iterations_estimates_loop (loop);
1863 /* Remove all the instructions in the block. */
1864 if (bb_seq (bb) != NULL)
1866 /* Walk backwards so as to get a chance to substitute all
1867 released DEFs into debug stmts. See
1868 eliminate_unnecessary_stmts() in tree-ssa-dce.c for more
1870 for (i = gsi_last_bb (bb); !gsi_end_p (i);)
1872 gimple stmt = gsi_stmt (i);
1873 if (gimple_code (stmt) == GIMPLE_LABEL
1874 && (FORCED_LABEL (gimple_label_label (stmt))
1875 || DECL_NONLOCAL (gimple_label_label (stmt))))
1878 gimple_stmt_iterator new_gsi;
1880 /* A non-reachable non-local label may still be referenced.
1881 But it no longer needs to carry the extra semantics of
1883 if (DECL_NONLOCAL (gimple_label_label (stmt)))
1885 DECL_NONLOCAL (gimple_label_label (stmt)) = 0;
1886 FORCED_LABEL (gimple_label_label (stmt)) = 1;
1889 new_bb = bb->prev_bb;
1890 new_gsi = gsi_start_bb (new_bb);
1891 gsi_remove (&i, false);
1892 gsi_insert_before (&new_gsi, stmt, GSI_NEW_STMT);
1896 /* Release SSA definitions if we are in SSA. Note that we
1897 may be called when not in SSA. For example,
1898 final_cleanup calls this function via
1899 cleanup_tree_cfg. */
1900 if (gimple_in_ssa_p (cfun))
1901 release_defs (stmt);
1903 gsi_remove (&i, true);
1907 i = gsi_last_bb (bb);
1913 remove_phi_nodes_and_edges_for_unreachable_block (bb);
1914 bb->il.gimple.seq = NULL;
1915 bb->il.gimple.phi_nodes = NULL;
1919 /* Given a basic block BB ending with COND_EXPR or SWITCH_EXPR, and a
1920 predicate VAL, return the edge that will be taken out of the block.
1921 If VAL does not match a unique edge, NULL is returned. */
1924 find_taken_edge (basic_block bb, tree val)
1928 stmt = last_stmt (bb);
1931 gcc_assert (is_ctrl_stmt (stmt));
1936 if (!is_gimple_min_invariant (val))
1939 if (gimple_code (stmt) == GIMPLE_COND)
1940 return find_taken_edge_cond_expr (bb, val);
1942 if (gimple_code (stmt) == GIMPLE_SWITCH)
1943 return find_taken_edge_switch_expr (bb, val);
1945 if (computed_goto_p (stmt))
1947 /* Only optimize if the argument is a label, if the argument is
1948 not a label then we can not construct a proper CFG.
1950 It may be the case that we only need to allow the LABEL_REF to
1951 appear inside an ADDR_EXPR, but we also allow the LABEL_REF to
1952 appear inside a LABEL_EXPR just to be safe. */
1953 if ((TREE_CODE (val) == ADDR_EXPR || TREE_CODE (val) == LABEL_EXPR)
1954 && TREE_CODE (TREE_OPERAND (val, 0)) == LABEL_DECL)
1955 return find_taken_edge_computed_goto (bb, TREE_OPERAND (val, 0));
1962 /* Given a constant value VAL and the entry block BB to a GOTO_EXPR
1963 statement, determine which of the outgoing edges will be taken out of the
1964 block. Return NULL if either edge may be taken. */
1967 find_taken_edge_computed_goto (basic_block bb, tree val)
1972 dest = label_to_block (val);
1975 e = find_edge (bb, dest);
1976 gcc_assert (e != NULL);
1982 /* Given a constant value VAL and the entry block BB to a COND_EXPR
1983 statement, determine which of the two edges will be taken out of the
1984 block. Return NULL if either edge may be taken. */
1987 find_taken_edge_cond_expr (basic_block bb, tree val)
1989 edge true_edge, false_edge;
1991 extract_true_false_edges_from_block (bb, &true_edge, &false_edge);
1993 gcc_assert (TREE_CODE (val) == INTEGER_CST);
1994 return (integer_zerop (val) ? false_edge : true_edge);
1997 /* Given an INTEGER_CST VAL and the entry block BB to a SWITCH_EXPR
1998 statement, determine which edge will be taken out of the block. Return
1999 NULL if any edge may be taken. */
2002 find_taken_edge_switch_expr (basic_block bb, tree val)
2004 basic_block dest_bb;
2009 switch_stmt = last_stmt (bb);
2010 taken_case = find_case_label_for_value (switch_stmt, val);
2011 dest_bb = label_to_block (CASE_LABEL (taken_case));
2013 e = find_edge (bb, dest_bb);
2019 /* Return the CASE_LABEL_EXPR that SWITCH_STMT will take for VAL.
2020 We can make optimal use here of the fact that the case labels are
2021 sorted: We can do a binary search for a case matching VAL. */
2024 find_case_label_for_value (gimple switch_stmt, tree val)
2026 size_t low, high, n = gimple_switch_num_labels (switch_stmt);
2027 tree default_case = gimple_switch_default_label (switch_stmt);
2029 for (low = 0, high = n; high - low > 1; )
2031 size_t i = (high + low) / 2;
2032 tree t = gimple_switch_label (switch_stmt, i);
2035 /* Cache the result of comparing CASE_LOW and val. */
2036 cmp = tree_int_cst_compare (CASE_LOW (t), val);
2043 if (CASE_HIGH (t) == NULL)
2045 /* A singe-valued case label. */
2051 /* A case range. We can only handle integer ranges. */
2052 if (cmp <= 0 && tree_int_cst_compare (CASE_HIGH (t), val) >= 0)
2057 return default_case;
2061 /* Dump a basic block on stderr. */
2064 gimple_debug_bb (basic_block bb)
2066 dump_bb (stderr, bb, 0, TDF_VOPS|TDF_MEMSYMS|TDF_BLOCKS);
2070 /* Dump basic block with index N on stderr. */
2073 gimple_debug_bb_n (int n)
2075 gimple_debug_bb (BASIC_BLOCK (n));
2076 return BASIC_BLOCK (n);
2080 /* Dump the CFG on stderr.
2082 FLAGS are the same used by the tree dumping functions
2083 (see TDF_* in tree-pass.h). */
2086 gimple_debug_cfg (int flags)
2088 gimple_dump_cfg (stderr, flags);
2092 /* Dump the program showing basic block boundaries on the given FILE.
2094 FLAGS are the same used by the tree dumping functions (see TDF_* in
2098 gimple_dump_cfg (FILE *file, int flags)
2100 if (flags & TDF_DETAILS)
2102 dump_function_header (file, current_function_decl, flags);
2103 fprintf (file, ";; \n%d basic blocks, %d edges, last basic block %d.\n\n",
2104 n_basic_blocks, n_edges, last_basic_block);
2106 brief_dump_cfg (file, flags | TDF_COMMENT);
2107 fprintf (file, "\n");
2110 if (flags & TDF_STATS)
2111 dump_cfg_stats (file);
2113 dump_function_to_file (current_function_decl, file, flags | TDF_BLOCKS);
2117 /* Dump CFG statistics on FILE. */
2120 dump_cfg_stats (FILE *file)
2122 static long max_num_merged_labels = 0;
2123 unsigned long size, total = 0;
2126 const char * const fmt_str = "%-30s%-13s%12s\n";
2127 const char * const fmt_str_1 = "%-30s%13d%11lu%c\n";
2128 const char * const fmt_str_2 = "%-30s%13ld%11lu%c\n";
2129 const char * const fmt_str_3 = "%-43s%11lu%c\n";
2130 const char *funcname = current_function_name ();
2132 fprintf (file, "\nCFG Statistics for %s\n\n", funcname);
2134 fprintf (file, "---------------------------------------------------------\n");
2135 fprintf (file, fmt_str, "", " Number of ", "Memory");
2136 fprintf (file, fmt_str, "", " instances ", "used ");
2137 fprintf (file, "---------------------------------------------------------\n");
2139 size = n_basic_blocks * sizeof (struct basic_block_def);
2141 fprintf (file, fmt_str_1, "Basic blocks", n_basic_blocks,
2142 SCALE (size), LABEL (size));
2146 num_edges += EDGE_COUNT (bb->succs);
2147 size = num_edges * sizeof (struct edge_def);
2149 fprintf (file, fmt_str_2, "Edges", num_edges, SCALE (size), LABEL (size));
2151 fprintf (file, "---------------------------------------------------------\n");
2152 fprintf (file, fmt_str_3, "Total memory used by CFG data", SCALE (total),
2154 fprintf (file, "---------------------------------------------------------\n");
2155 fprintf (file, "\n");
2157 if (cfg_stats.num_merged_labels > max_num_merged_labels)
2158 max_num_merged_labels = cfg_stats.num_merged_labels;
2160 fprintf (file, "Coalesced label blocks: %ld (Max so far: %ld)\n",
2161 cfg_stats.num_merged_labels, max_num_merged_labels);
2163 fprintf (file, "\n");
2167 /* Dump CFG statistics on stderr. Keep extern so that it's always
2168 linked in the final executable. */
2171 debug_cfg_stats (void)
2173 dump_cfg_stats (stderr);
2177 /* Dump the flowgraph to a .vcg FILE. */
2180 gimple_cfg2vcg (FILE *file)
2185 const char *funcname = current_function_name ();
2187 /* Write the file header. */
2188 fprintf (file, "graph: { title: \"%s\"\n", funcname);
2189 fprintf (file, "node: { title: \"ENTRY\" label: \"ENTRY\" }\n");
2190 fprintf (file, "node: { title: \"EXIT\" label: \"EXIT\" }\n");
2192 /* Write blocks and edges. */
2193 FOR_EACH_EDGE (e, ei, ENTRY_BLOCK_PTR->succs)
2195 fprintf (file, "edge: { sourcename: \"ENTRY\" targetname: \"%d\"",
2198 if (e->flags & EDGE_FAKE)
2199 fprintf (file, " linestyle: dotted priority: 10");
2201 fprintf (file, " linestyle: solid priority: 100");
2203 fprintf (file, " }\n");
2209 enum gimple_code head_code, end_code;
2210 const char *head_name, *end_name;
2213 gimple first = first_stmt (bb);
2214 gimple last = last_stmt (bb);
2218 head_code = gimple_code (first);
2219 head_name = gimple_code_name[head_code];
2220 head_line = get_lineno (first);
2223 head_name = "no-statement";
2227 end_code = gimple_code (last);
2228 end_name = gimple_code_name[end_code];
2229 end_line = get_lineno (last);
2232 end_name = "no-statement";
2234 fprintf (file, "node: { title: \"%d\" label: \"#%d\\n%s (%d)\\n%s (%d)\"}\n",
2235 bb->index, bb->index, head_name, head_line, end_name,
2238 FOR_EACH_EDGE (e, ei, bb->succs)
2240 if (e->dest == EXIT_BLOCK_PTR)
2241 fprintf (file, "edge: { sourcename: \"%d\" targetname: \"EXIT\"", bb->index);
2243 fprintf (file, "edge: { sourcename: \"%d\" targetname: \"%d\"", bb->index, e->dest->index);
2245 if (e->flags & EDGE_FAKE)
2246 fprintf (file, " priority: 10 linestyle: dotted");
2248 fprintf (file, " priority: 100 linestyle: solid");
2250 fprintf (file, " }\n");
2253 if (bb->next_bb != EXIT_BLOCK_PTR)
2257 fputs ("}\n\n", file);
2262 /*---------------------------------------------------------------------------
2263 Miscellaneous helpers
2264 ---------------------------------------------------------------------------*/
2266 /* Return true if T, a GIMPLE_CALL, can make an abnormal transfer of control
2267 flow. Transfers of control flow associated with EH are excluded. */
2270 call_can_make_abnormal_goto (gimple t)
2272 /* If the function has no non-local labels, then a call cannot make an
2273 abnormal transfer of control. */
2274 if (!cfun->has_nonlocal_label)
2277 /* Likewise if the call has no side effects. */
2278 if (!gimple_has_side_effects (t))
2281 /* Likewise if the called function is leaf. */
2282 if (gimple_call_flags (t) & ECF_LEAF)
2289 /* Return true if T can make an abnormal transfer of control flow.
2290 Transfers of control flow associated with EH are excluded. */
2293 stmt_can_make_abnormal_goto (gimple t)
2295 if (computed_goto_p (t))
2297 if (is_gimple_call (t))
2298 return call_can_make_abnormal_goto (t);
2303 /* Return true if T represents a stmt that always transfers control. */
2306 is_ctrl_stmt (gimple t)
2308 switch (gimple_code (t))
2322 /* Return true if T is a statement that may alter the flow of control
2323 (e.g., a call to a non-returning function). */
2326 is_ctrl_altering_stmt (gimple t)
2330 switch (gimple_code (t))
2334 int flags = gimple_call_flags (t);
2336 /* A call alters control flow if it can make an abnormal goto. */
2337 if (call_can_make_abnormal_goto (t))
2340 /* A call also alters control flow if it does not return. */
2341 if (flags & ECF_NORETURN)
2344 /* TM ending statements have backedges out of the transaction.
2345 Return true so we split the basic block containing them.
2346 Note that the TM_BUILTIN test is merely an optimization. */
2347 if ((flags & ECF_TM_BUILTIN)
2348 && is_tm_ending_fndecl (gimple_call_fndecl (t)))
2351 /* BUILT_IN_RETURN call is same as return statement. */
2352 if (gimple_call_builtin_p (t, BUILT_IN_RETURN))
2357 case GIMPLE_EH_DISPATCH:
2358 /* EH_DISPATCH branches to the individual catch handlers at
2359 this level of a try or allowed-exceptions region. It can
2360 fallthru to the next statement as well. */
2364 if (gimple_asm_nlabels (t) > 0)
2369 /* OpenMP directives alter control flow. */
2372 case GIMPLE_TRANSACTION:
2373 /* A transaction start alters control flow. */
2380 /* If a statement can throw, it alters control flow. */
2381 return stmt_can_throw_internal (t);
2385 /* Return true if T is a simple local goto. */
2388 simple_goto_p (gimple t)
2390 return (gimple_code (t) == GIMPLE_GOTO
2391 && TREE_CODE (gimple_goto_dest (t)) == LABEL_DECL);
2395 /* Return true if STMT should start a new basic block. PREV_STMT is
2396 the statement preceding STMT. It is used when STMT is a label or a
2397 case label. Labels should only start a new basic block if their
2398 previous statement wasn't a label. Otherwise, sequence of labels
2399 would generate unnecessary basic blocks that only contain a single
2403 stmt_starts_bb_p (gimple stmt, gimple prev_stmt)
2408 /* Labels start a new basic block only if the preceding statement
2409 wasn't a label of the same type. This prevents the creation of
2410 consecutive blocks that have nothing but a single label. */
2411 if (gimple_code (stmt) == GIMPLE_LABEL)
2413 /* Nonlocal and computed GOTO targets always start a new block. */
2414 if (DECL_NONLOCAL (gimple_label_label (stmt))
2415 || FORCED_LABEL (gimple_label_label (stmt)))
2418 if (prev_stmt && gimple_code (prev_stmt) == GIMPLE_LABEL)
2420 if (DECL_NONLOCAL (gimple_label_label (prev_stmt)))
2423 cfg_stats.num_merged_labels++;
2434 /* Return true if T should end a basic block. */
2437 stmt_ends_bb_p (gimple t)
2439 return is_ctrl_stmt (t) || is_ctrl_altering_stmt (t);
2442 /* Remove block annotations and other data structures. */
2445 delete_tree_cfg_annotations (void)
2447 label_to_block_map = NULL;
2451 /* Return the first statement in basic block BB. */
2454 first_stmt (basic_block bb)
2456 gimple_stmt_iterator i = gsi_start_bb (bb);
2459 while (!gsi_end_p (i) && is_gimple_debug ((stmt = gsi_stmt (i))))
2467 /* Return the first non-label statement in basic block BB. */
2470 first_non_label_stmt (basic_block bb)
2472 gimple_stmt_iterator i = gsi_start_bb (bb);
2473 while (!gsi_end_p (i) && gimple_code (gsi_stmt (i)) == GIMPLE_LABEL)
2475 return !gsi_end_p (i) ? gsi_stmt (i) : NULL;
2478 /* Return the last statement in basic block BB. */
2481 last_stmt (basic_block bb)
2483 gimple_stmt_iterator i = gsi_last_bb (bb);
2486 while (!gsi_end_p (i) && is_gimple_debug ((stmt = gsi_stmt (i))))
2494 /* Return the last statement of an otherwise empty block. Return NULL
2495 if the block is totally empty, or if it contains more than one
2499 last_and_only_stmt (basic_block bb)
2501 gimple_stmt_iterator i = gsi_last_nondebug_bb (bb);
2507 last = gsi_stmt (i);
2508 gsi_prev_nondebug (&i);
2512 /* Empty statements should no longer appear in the instruction stream.
2513 Everything that might have appeared before should be deleted by
2514 remove_useless_stmts, and the optimizers should just gsi_remove
2515 instead of smashing with build_empty_stmt.
2517 Thus the only thing that should appear here in a block containing
2518 one executable statement is a label. */
2519 prev = gsi_stmt (i);
2520 if (gimple_code (prev) == GIMPLE_LABEL)
2526 /* Reinstall those PHI arguments queued in OLD_EDGE to NEW_EDGE. */
2529 reinstall_phi_args (edge new_edge, edge old_edge)
2531 edge_var_map_vector v;
2534 gimple_stmt_iterator phis;
2536 v = redirect_edge_var_map_vector (old_edge);
2540 for (i = 0, phis = gsi_start_phis (new_edge->dest);
2541 VEC_iterate (edge_var_map, v, i, vm) && !gsi_end_p (phis);
2542 i++, gsi_next (&phis))
2544 gimple phi = gsi_stmt (phis);
2545 tree result = redirect_edge_var_map_result (vm);
2546 tree arg = redirect_edge_var_map_def (vm);
2548 gcc_assert (result == gimple_phi_result (phi));
2550 add_phi_arg (phi, arg, new_edge, redirect_edge_var_map_location (vm));
2553 redirect_edge_var_map_clear (old_edge);
2556 /* Returns the basic block after which the new basic block created
2557 by splitting edge EDGE_IN should be placed. Tries to keep the new block
2558 near its "logical" location. This is of most help to humans looking
2559 at debugging dumps. */
2562 split_edge_bb_loc (edge edge_in)
2564 basic_block dest = edge_in->dest;
2565 basic_block dest_prev = dest->prev_bb;
2569 edge e = find_edge (dest_prev, dest);
2570 if (e && !(e->flags & EDGE_COMPLEX))
2571 return edge_in->src;
2576 /* Split a (typically critical) edge EDGE_IN. Return the new block.
2577 Abort on abnormal edges. */
2580 gimple_split_edge (edge edge_in)
2582 basic_block new_bb, after_bb, dest;
2585 /* Abnormal edges cannot be split. */
2586 gcc_assert (!(edge_in->flags & EDGE_ABNORMAL));
2588 dest = edge_in->dest;
2590 after_bb = split_edge_bb_loc (edge_in);
2592 new_bb = create_empty_bb (after_bb);
2593 new_bb->frequency = EDGE_FREQUENCY (edge_in);
2594 new_bb->count = edge_in->count;
2595 new_edge = make_edge (new_bb, dest, EDGE_FALLTHRU);
2596 new_edge->probability = REG_BR_PROB_BASE;
2597 new_edge->count = edge_in->count;
2599 e = redirect_edge_and_branch (edge_in, new_bb);
2600 gcc_assert (e == edge_in);
2601 reinstall_phi_args (new_edge, e);
2607 /* Verify properties of the address expression T with base object BASE. */
2610 verify_address (tree t, tree base)
2613 bool old_side_effects;
2615 bool new_side_effects;
2617 old_constant = TREE_CONSTANT (t);
2618 old_side_effects = TREE_SIDE_EFFECTS (t);
2620 recompute_tree_invariant_for_addr_expr (t);
2621 new_side_effects = TREE_SIDE_EFFECTS (t);
2622 new_constant = TREE_CONSTANT (t);
2624 if (old_constant != new_constant)
2626 error ("constant not recomputed when ADDR_EXPR changed");
2629 if (old_side_effects != new_side_effects)
2631 error ("side effects not recomputed when ADDR_EXPR changed");
2635 if (!(TREE_CODE (base) == VAR_DECL
2636 || TREE_CODE (base) == PARM_DECL
2637 || TREE_CODE (base) == RESULT_DECL))
2640 if (DECL_GIMPLE_REG_P (base))
2642 error ("DECL_GIMPLE_REG_P set on a variable with address taken");
2649 /* Callback for walk_tree, check that all elements with address taken are
2650 properly noticed as such. The DATA is an int* that is 1 if TP was seen
2651 inside a PHI node. */
2654 verify_expr (tree *tp, int *walk_subtrees, void *data ATTRIBUTE_UNUSED)
2661 /* Check operand N for being valid GIMPLE and give error MSG if not. */
2662 #define CHECK_OP(N, MSG) \
2663 do { if (!is_gimple_val (TREE_OPERAND (t, N))) \
2664 { error (MSG); return TREE_OPERAND (t, N); }} while (0)
2666 switch (TREE_CODE (t))
2669 if (SSA_NAME_IN_FREE_LIST (t))
2671 error ("SSA name in freelist but still referenced");
2677 error ("INDIRECT_REF in gimple IL");
2681 x = TREE_OPERAND (t, 0);
2682 if (!POINTER_TYPE_P (TREE_TYPE (x))
2683 || !is_gimple_mem_ref_addr (x))
2685 error ("invalid first operand of MEM_REF");
2688 if (TREE_CODE (TREE_OPERAND (t, 1)) != INTEGER_CST
2689 || !POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (t, 1))))
2691 error ("invalid offset operand of MEM_REF");
2692 return TREE_OPERAND (t, 1);
2694 if (TREE_CODE (x) == ADDR_EXPR
2695 && (x = verify_address (x, TREE_OPERAND (x, 0))))
2701 x = fold (ASSERT_EXPR_COND (t));
2702 if (x == boolean_false_node)
2704 error ("ASSERT_EXPR with an always-false condition");
2710 error ("MODIFY_EXPR not expected while having tuples");
2717 gcc_assert (is_gimple_address (t));
2719 /* Skip any references (they will be checked when we recurse down the
2720 tree) and ensure that any variable used as a prefix is marked
2722 for (x = TREE_OPERAND (t, 0);
2723 handled_component_p (x);
2724 x = TREE_OPERAND (x, 0))
2727 if ((tem = verify_address (t, x)))
2730 if (!(TREE_CODE (x) == VAR_DECL
2731 || TREE_CODE (x) == PARM_DECL
2732 || TREE_CODE (x) == RESULT_DECL))
2735 if (!TREE_ADDRESSABLE (x))
2737 error ("address taken, but ADDRESSABLE bit not set");
2745 x = COND_EXPR_COND (t);
2746 if (!INTEGRAL_TYPE_P (TREE_TYPE (x)))
2748 error ("non-integral used in condition");
2751 if (!is_gimple_condexpr (x))
2753 error ("invalid conditional operand");
2758 case NON_LVALUE_EXPR:
2759 case TRUTH_NOT_EXPR:
2763 case FIX_TRUNC_EXPR:
2768 CHECK_OP (0, "invalid operand to unary operator");
2775 case ARRAY_RANGE_REF:
2777 case VIEW_CONVERT_EXPR:
2778 /* We have a nest of references. Verify that each of the operands
2779 that determine where to reference is either a constant or a variable,
2780 verify that the base is valid, and then show we've already checked
2782 while (handled_component_p (t))
2784 if (TREE_CODE (t) == COMPONENT_REF && TREE_OPERAND (t, 2))
2785 CHECK_OP (2, "invalid COMPONENT_REF offset operator");
2786 else if (TREE_CODE (t) == ARRAY_REF
2787 || TREE_CODE (t) == ARRAY_RANGE_REF)
2789 CHECK_OP (1, "invalid array index");
2790 if (TREE_OPERAND (t, 2))
2791 CHECK_OP (2, "invalid array lower bound");
2792 if (TREE_OPERAND (t, 3))
2793 CHECK_OP (3, "invalid array stride");
2795 else if (TREE_CODE (t) == BIT_FIELD_REF)
2797 if (!host_integerp (TREE_OPERAND (t, 1), 1)
2798 || !host_integerp (TREE_OPERAND (t, 2), 1))
2800 error ("invalid position or size operand to BIT_FIELD_REF");
2803 if (INTEGRAL_TYPE_P (TREE_TYPE (t))
2804 && (TYPE_PRECISION (TREE_TYPE (t))
2805 != TREE_INT_CST_LOW (TREE_OPERAND (t, 1))))
2807 error ("integral result type precision does not match "
2808 "field size of BIT_FIELD_REF");
2811 else if (!INTEGRAL_TYPE_P (TREE_TYPE (t))
2812 && !AGGREGATE_TYPE_P (TREE_TYPE (t))
2813 && TYPE_MODE (TREE_TYPE (t)) != BLKmode
2814 && (GET_MODE_PRECISION (TYPE_MODE (TREE_TYPE (t)))
2815 != TREE_INT_CST_LOW (TREE_OPERAND (t, 1))))
2817 error ("mode precision of non-integral result does not "
2818 "match field size of BIT_FIELD_REF");
2823 t = TREE_OPERAND (t, 0);
2826 if (!is_gimple_min_invariant (t) && !is_gimple_lvalue (t))
2828 error ("invalid reference prefix");
2835 /* PLUS_EXPR and MINUS_EXPR don't work on pointers, they should be done using
2836 POINTER_PLUS_EXPR. */
2837 if (POINTER_TYPE_P (TREE_TYPE (t)))
2839 error ("invalid operand to plus/minus, type is a pointer");
2842 CHECK_OP (0, "invalid operand to binary operator");
2843 CHECK_OP (1, "invalid operand to binary operator");
2846 case POINTER_PLUS_EXPR:
2847 /* Check to make sure the first operand is a pointer or reference type. */
2848 if (!POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (t, 0))))
2850 error ("invalid operand to pointer plus, first operand is not a pointer");
2853 /* Check to make sure the second operand is a ptrofftype. */
2854 if (!ptrofftype_p (TREE_TYPE (TREE_OPERAND (t, 1))))
2856 error ("invalid operand to pointer plus, second operand is not an "
2857 "integer type of appropriate width");
2867 case UNORDERED_EXPR:
2876 case TRUNC_DIV_EXPR:
2878 case FLOOR_DIV_EXPR:
2879 case ROUND_DIV_EXPR:
2880 case TRUNC_MOD_EXPR:
2882 case FLOOR_MOD_EXPR:
2883 case ROUND_MOD_EXPR:
2885 case EXACT_DIV_EXPR:
2895 CHECK_OP (0, "invalid operand to binary operator");
2896 CHECK_OP (1, "invalid operand to binary operator");
2900 if (TREE_CONSTANT (t) && TREE_CODE (TREE_TYPE (t)) == VECTOR_TYPE)
2904 case CASE_LABEL_EXPR:
2907 error ("invalid CASE_CHAIN");
2921 /* Verify if EXPR is either a GIMPLE ID or a GIMPLE indirect reference.
2922 Returns true if there is an error, otherwise false. */
2925 verify_types_in_gimple_min_lval (tree expr)
2929 if (is_gimple_id (expr))
2932 if (TREE_CODE (expr) != TARGET_MEM_REF
2933 && TREE_CODE (expr) != MEM_REF)
2935 error ("invalid expression for min lvalue");
2939 /* TARGET_MEM_REFs are strange beasts. */
2940 if (TREE_CODE (expr) == TARGET_MEM_REF)
2943 op = TREE_OPERAND (expr, 0);
2944 if (!is_gimple_val (op))
2946 error ("invalid operand in indirect reference");
2947 debug_generic_stmt (op);
2950 /* Memory references now generally can involve a value conversion. */
2955 /* Verify if EXPR is a valid GIMPLE reference expression. If
2956 REQUIRE_LVALUE is true verifies it is an lvalue. Returns true
2957 if there is an error, otherwise false. */
2960 verify_types_in_gimple_reference (tree expr, bool require_lvalue)
2962 while (handled_component_p (expr))
2964 tree op = TREE_OPERAND (expr, 0);
2966 if (TREE_CODE (expr) == ARRAY_REF
2967 || TREE_CODE (expr) == ARRAY_RANGE_REF)
2969 if (!is_gimple_val (TREE_OPERAND (expr, 1))
2970 || (TREE_OPERAND (expr, 2)
2971 && !is_gimple_val (TREE_OPERAND (expr, 2)))
2972 || (TREE_OPERAND (expr, 3)
2973 && !is_gimple_val (TREE_OPERAND (expr, 3))))
2975 error ("invalid operands to array reference");
2976 debug_generic_stmt (expr);
2981 /* Verify if the reference array element types are compatible. */
2982 if (TREE_CODE (expr) == ARRAY_REF
2983 && !useless_type_conversion_p (TREE_TYPE (expr),
2984 TREE_TYPE (TREE_TYPE (op))))
2986 error ("type mismatch in array reference");
2987 debug_generic_stmt (TREE_TYPE (expr));
2988 debug_generic_stmt (TREE_TYPE (TREE_TYPE (op)));
2991 if (TREE_CODE (expr) == ARRAY_RANGE_REF
2992 && !useless_type_conversion_p (TREE_TYPE (TREE_TYPE (expr)),
2993 TREE_TYPE (TREE_TYPE (op))))
2995 error ("type mismatch in array range reference");
2996 debug_generic_stmt (TREE_TYPE (TREE_TYPE (expr)));
2997 debug_generic_stmt (TREE_TYPE (TREE_TYPE (op)));
3001 if ((TREE_CODE (expr) == REALPART_EXPR
3002 || TREE_CODE (expr) == IMAGPART_EXPR)
3003 && !useless_type_conversion_p (TREE_TYPE (expr),
3004 TREE_TYPE (TREE_TYPE (op))))
3006 error ("type mismatch in real/imagpart reference");
3007 debug_generic_stmt (TREE_TYPE (expr));
3008 debug_generic_stmt (TREE_TYPE (TREE_TYPE (op)));
3012 if (TREE_CODE (expr) == COMPONENT_REF
3013 && !useless_type_conversion_p (TREE_TYPE (expr),
3014 TREE_TYPE (TREE_OPERAND (expr, 1))))
3016 error ("type mismatch in component reference");
3017 debug_generic_stmt (TREE_TYPE (expr));
3018 debug_generic_stmt (TREE_TYPE (TREE_OPERAND (expr, 1)));
3022 if (TREE_CODE (expr) == VIEW_CONVERT_EXPR)
3024 /* For VIEW_CONVERT_EXPRs which are allowed here too, we only check
3025 that their operand is not an SSA name or an invariant when
3026 requiring an lvalue (this usually means there is a SRA or IPA-SRA
3027 bug). Otherwise there is nothing to verify, gross mismatches at
3028 most invoke undefined behavior. */
3030 && (TREE_CODE (op) == SSA_NAME
3031 || is_gimple_min_invariant (op)))
3033 error ("conversion of an SSA_NAME on the left hand side");
3034 debug_generic_stmt (expr);
3037 else if (TREE_CODE (op) == SSA_NAME
3038 && TYPE_SIZE (TREE_TYPE (expr)) != TYPE_SIZE (TREE_TYPE (op)))
3040 error ("conversion of register to a different size");
3041 debug_generic_stmt (expr);
3044 else if (!handled_component_p (op))
3051 if (TREE_CODE (expr) == MEM_REF)
3053 if (!is_gimple_mem_ref_addr (TREE_OPERAND (expr, 0)))
3055 error ("invalid address operand in MEM_REF");
3056 debug_generic_stmt (expr);
3059 if (TREE_CODE (TREE_OPERAND (expr, 1)) != INTEGER_CST
3060 || !POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (expr, 1))))
3062 error ("invalid offset operand in MEM_REF");
3063 debug_generic_stmt (expr);
3067 else if (TREE_CODE (expr) == TARGET_MEM_REF)
3069 if (!TMR_BASE (expr)
3070 || !is_gimple_mem_ref_addr (TMR_BASE (expr)))
3072 error ("invalid address operand in TARGET_MEM_REF");
3075 if (!TMR_OFFSET (expr)
3076 || TREE_CODE (TMR_OFFSET (expr)) != INTEGER_CST
3077 || !POINTER_TYPE_P (TREE_TYPE (TMR_OFFSET (expr))))
3079 error ("invalid offset operand in TARGET_MEM_REF");
3080 debug_generic_stmt (expr);
3085 return ((require_lvalue || !is_gimple_min_invariant (expr))
3086 && verify_types_in_gimple_min_lval (expr));
3089 /* Returns true if there is one pointer type in TYPE_POINTER_TO (SRC_OBJ)
3090 list of pointer-to types that is trivially convertible to DEST. */
3093 one_pointer_to_useless_type_conversion_p (tree dest, tree src_obj)
3097 if (!TYPE_POINTER_TO (src_obj))
3100 for (src = TYPE_POINTER_TO (src_obj); src; src = TYPE_NEXT_PTR_TO (src))
3101 if (useless_type_conversion_p (dest, src))
3107 /* Return true if TYPE1 is a fixed-point type and if conversions to and
3108 from TYPE2 can be handled by FIXED_CONVERT_EXPR. */
3111 valid_fixed_convert_types_p (tree type1, tree type2)
3113 return (FIXED_POINT_TYPE_P (type1)
3114 && (INTEGRAL_TYPE_P (type2)
3115 || SCALAR_FLOAT_TYPE_P (type2)
3116 || FIXED_POINT_TYPE_P (type2)));
3119 /* Verify the contents of a GIMPLE_CALL STMT. Returns true when there
3120 is a problem, otherwise false. */
3123 verify_gimple_call (gimple stmt)
3125 tree fn = gimple_call_fn (stmt);
3126 tree fntype, fndecl;
3129 if (gimple_call_internal_p (stmt))
3133 error ("gimple call has two targets");
3134 debug_generic_stmt (fn);
3142 error ("gimple call has no target");
3147 if (fn && !is_gimple_call_addr (fn))
3149 error ("invalid function in gimple call");
3150 debug_generic_stmt (fn);
3155 && (!POINTER_TYPE_P (TREE_TYPE (fn))
3156 || (TREE_CODE (TREE_TYPE (TREE_TYPE (fn))) != FUNCTION_TYPE
3157 && TREE_CODE (TREE_TYPE (TREE_TYPE (fn))) != METHOD_TYPE)))
3159 error ("non-function in gimple call");
3163 fndecl = gimple_call_fndecl (stmt);
3165 && TREE_CODE (fndecl) == FUNCTION_DECL
3166 && DECL_LOOPING_CONST_OR_PURE_P (fndecl)
3167 && !DECL_PURE_P (fndecl)
3168 && !TREE_READONLY (fndecl))
3170 error ("invalid pure const state for function");
3174 if (gimple_call_lhs (stmt)
3175 && (!is_gimple_lvalue (gimple_call_lhs (stmt))
3176 || verify_types_in_gimple_reference (gimple_call_lhs (stmt), true)))
3178 error ("invalid LHS in gimple call");
3182 if (gimple_call_lhs (stmt) && gimple_call_noreturn_p (stmt))
3184 error ("LHS in noreturn call");
3188 fntype = gimple_call_fntype (stmt);
3190 && gimple_call_lhs (stmt)
3191 && !useless_type_conversion_p (TREE_TYPE (gimple_call_lhs (stmt)),
3193 /* ??? At least C++ misses conversions at assignments from
3194 void * call results.
3195 ??? Java is completely off. Especially with functions
3196 returning java.lang.Object.
3197 For now simply allow arbitrary pointer type conversions. */
3198 && !(POINTER_TYPE_P (TREE_TYPE (gimple_call_lhs (stmt)))
3199 && POINTER_TYPE_P (TREE_TYPE (fntype))))
3201 error ("invalid conversion in gimple call");
3202 debug_generic_stmt (TREE_TYPE (gimple_call_lhs (stmt)));
3203 debug_generic_stmt (TREE_TYPE (fntype));
3207 if (gimple_call_chain (stmt)
3208 && !is_gimple_val (gimple_call_chain (stmt)))
3210 error ("invalid static chain in gimple call");
3211 debug_generic_stmt (gimple_call_chain (stmt));
3215 /* If there is a static chain argument, this should not be an indirect
3216 call, and the decl should have DECL_STATIC_CHAIN set. */
3217 if (gimple_call_chain (stmt))
3219 if (!gimple_call_fndecl (stmt))
3221 error ("static chain in indirect gimple call");
3224 fn = TREE_OPERAND (fn, 0);
3226 if (!DECL_STATIC_CHAIN (fn))
3228 error ("static chain with function that doesn%'t use one");
3233 /* ??? The C frontend passes unpromoted arguments in case it
3234 didn't see a function declaration before the call. So for now
3235 leave the call arguments mostly unverified. Once we gimplify
3236 unit-at-a-time we have a chance to fix this. */
3238 for (i = 0; i < gimple_call_num_args (stmt); ++i)
3240 tree arg = gimple_call_arg (stmt, i);
3241 if ((is_gimple_reg_type (TREE_TYPE (arg))
3242 && !is_gimple_val (arg))
3243 || (!is_gimple_reg_type (TREE_TYPE (arg))
3244 && !is_gimple_lvalue (arg)))
3246 error ("invalid argument to gimple call");
3247 debug_generic_expr (arg);
3255 /* Verifies the gimple comparison with the result type TYPE and
3256 the operands OP0 and OP1. */
3259 verify_gimple_comparison (tree type, tree op0, tree op1)
3261 tree op0_type = TREE_TYPE (op0);
3262 tree op1_type = TREE_TYPE (op1);
3264 if (!is_gimple_val (op0) || !is_gimple_val (op1))
3266 error ("invalid operands in gimple comparison");
3270 /* For comparisons we do not have the operations type as the
3271 effective type the comparison is carried out in. Instead
3272 we require that either the first operand is trivially
3273 convertible into the second, or the other way around.
3274 Because we special-case pointers to void we allow
3275 comparisons of pointers with the same mode as well. */
3276 if (!useless_type_conversion_p (op0_type, op1_type)
3277 && !useless_type_conversion_p (op1_type, op0_type)
3278 && (!POINTER_TYPE_P (op0_type)
3279 || !POINTER_TYPE_P (op1_type)
3280 || TYPE_MODE (op0_type) != TYPE_MODE (op1_type)))
3282 error ("mismatching comparison operand types");
3283 debug_generic_expr (op0_type);
3284 debug_generic_expr (op1_type);
3288 /* The resulting type of a comparison may be an effective boolean type. */
3289 if (INTEGRAL_TYPE_P (type)
3290 && (TREE_CODE (type) == BOOLEAN_TYPE
3291 || TYPE_PRECISION (type) == 1))
3293 /* Or an integer vector type with the same size and element count
3294 as the comparison operand types. */
3295 else if (TREE_CODE (type) == VECTOR_TYPE
3296 && TREE_CODE (TREE_TYPE (type)) == INTEGER_TYPE)
3298 if (TREE_CODE (op0_type) != VECTOR_TYPE
3299 || TREE_CODE (op1_type) != VECTOR_TYPE)
3301 error ("non-vector operands in vector comparison");
3302 debug_generic_expr (op0_type);
3303 debug_generic_expr (op1_type);
3307 if (TYPE_VECTOR_SUBPARTS (type) != TYPE_VECTOR_SUBPARTS (op0_type)
3308 || (GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (type)))
3309 != GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (op0_type)))))
3311 error ("invalid vector comparison resulting type");
3312 debug_generic_expr (type);
3318 error ("bogus comparison result type");
3319 debug_generic_expr (type);
3326 /* Verify a gimple assignment statement STMT with an unary rhs.
3327 Returns true if anything is wrong. */
3330 verify_gimple_assign_unary (gimple stmt)
3332 enum tree_code rhs_code = gimple_assign_rhs_code (stmt);
3333 tree lhs = gimple_assign_lhs (stmt);
3334 tree lhs_type = TREE_TYPE (lhs);
3335 tree rhs1 = gimple_assign_rhs1 (stmt);
3336 tree rhs1_type = TREE_TYPE (rhs1);
3338 if (!is_gimple_reg (lhs))
3340 error ("non-register as LHS of unary operation");
3344 if (!is_gimple_val (rhs1))
3346 error ("invalid operand in unary operation");
3350 /* First handle conversions. */
3355 /* Allow conversions from pointer type to integral type only if
3356 there is no sign or zero extension involved.
3357 For targets were the precision of ptrofftype doesn't match that
3358 of pointers we need to allow arbitrary conversions to ptrofftype. */
3359 if ((POINTER_TYPE_P (lhs_type)
3360 && INTEGRAL_TYPE_P (rhs1_type))
3361 || (POINTER_TYPE_P (rhs1_type)
3362 && INTEGRAL_TYPE_P (lhs_type)
3363 && (TYPE_PRECISION (rhs1_type) >= TYPE_PRECISION (lhs_type)
3364 || ptrofftype_p (sizetype))))
3367 /* Allow conversion from integral to offset type and vice versa. */
3368 if ((TREE_CODE (lhs_type) == OFFSET_TYPE
3369 && INTEGRAL_TYPE_P (rhs1_type))
3370 || (INTEGRAL_TYPE_P (lhs_type)
3371 && TREE_CODE (rhs1_type) == OFFSET_TYPE))
3374 /* Otherwise assert we are converting between types of the
3376 if (INTEGRAL_TYPE_P (lhs_type) != INTEGRAL_TYPE_P (rhs1_type))
3378 error ("invalid types in nop conversion");
3379 debug_generic_expr (lhs_type);
3380 debug_generic_expr (rhs1_type);
3387 case ADDR_SPACE_CONVERT_EXPR:
3389 if (!POINTER_TYPE_P (rhs1_type) || !POINTER_TYPE_P (lhs_type)
3390 || (TYPE_ADDR_SPACE (TREE_TYPE (rhs1_type))
3391 == TYPE_ADDR_SPACE (TREE_TYPE (lhs_type))))
3393 error ("invalid types in address space conversion");
3394 debug_generic_expr (lhs_type);
3395 debug_generic_expr (rhs1_type);
3402 case FIXED_CONVERT_EXPR:
3404 if (!valid_fixed_convert_types_p (lhs_type, rhs1_type)
3405 && !valid_fixed_convert_types_p (rhs1_type, lhs_type))
3407 error ("invalid types in fixed-point conversion");
3408 debug_generic_expr (lhs_type);
3409 debug_generic_expr (rhs1_type);
3418 if ((!INTEGRAL_TYPE_P (rhs1_type) || !SCALAR_FLOAT_TYPE_P (lhs_type))
3419 && (!VECTOR_INTEGER_TYPE_P (rhs1_type)
3420 || !VECTOR_FLOAT_TYPE_P(lhs_type)))
3422 error ("invalid types in conversion to floating point");
3423 debug_generic_expr (lhs_type);
3424 debug_generic_expr (rhs1_type);
3431 case FIX_TRUNC_EXPR:
3433 if ((!INTEGRAL_TYPE_P (lhs_type) || !SCALAR_FLOAT_TYPE_P (rhs1_type))
3434 && (!VECTOR_INTEGER_TYPE_P (lhs_type)
3435 || !VECTOR_FLOAT_TYPE_P(rhs1_type)))
3437 error ("invalid types in conversion to integer");
3438 debug_generic_expr (lhs_type);
3439 debug_generic_expr (rhs1_type);
3446 case VEC_UNPACK_HI_EXPR:
3447 case VEC_UNPACK_LO_EXPR:
3448 case REDUC_MAX_EXPR:
3449 case REDUC_MIN_EXPR:
3450 case REDUC_PLUS_EXPR:
3451 case VEC_UNPACK_FLOAT_HI_EXPR:
3452 case VEC_UNPACK_FLOAT_LO_EXPR:
3460 case NON_LVALUE_EXPR:
3468 /* For the remaining codes assert there is no conversion involved. */
3469 if (!useless_type_conversion_p (lhs_type, rhs1_type))
3471 error ("non-trivial conversion in unary operation");
3472 debug_generic_expr (lhs_type);
3473 debug_generic_expr (rhs1_type);
3480 /* Verify a gimple assignment statement STMT with a binary rhs.
3481 Returns true if anything is wrong. */
3484 verify_gimple_assign_binary (gimple stmt)
3486 enum tree_code rhs_code = gimple_assign_rhs_code (stmt);
3487 tree lhs = gimple_assign_lhs (stmt);
3488 tree lhs_type = TREE_TYPE (lhs);
3489 tree rhs1 = gimple_assign_rhs1 (stmt);
3490 tree rhs1_type = TREE_TYPE (rhs1);
3491 tree rhs2 = gimple_assign_rhs2 (stmt);
3492 tree rhs2_type = TREE_TYPE (rhs2);
3494 if (!is_gimple_reg (lhs))
3496 error ("non-register as LHS of binary operation");
3500 if (!is_gimple_val (rhs1)
3501 || !is_gimple_val (rhs2))
3503 error ("invalid operands in binary operation");
3507 /* First handle operations that involve different types. */
3512 if (TREE_CODE (lhs_type) != COMPLEX_TYPE
3513 || !(INTEGRAL_TYPE_P (rhs1_type)
3514 || SCALAR_FLOAT_TYPE_P (rhs1_type))
3515 || !(INTEGRAL_TYPE_P (rhs2_type)
3516 || SCALAR_FLOAT_TYPE_P (rhs2_type)))
3518 error ("type mismatch in complex expression");
3519 debug_generic_expr (lhs_type);
3520 debug_generic_expr (rhs1_type);
3521 debug_generic_expr (rhs2_type);
3533 /* Shifts and rotates are ok on integral types, fixed point
3534 types and integer vector types. */
3535 if ((!INTEGRAL_TYPE_P (rhs1_type)
3536 && !FIXED_POINT_TYPE_P (rhs1_type)
3537 && !(TREE_CODE (rhs1_type) == VECTOR_TYPE
3538 && INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type))))
3539 || (!INTEGRAL_TYPE_P (rhs2_type)
3540 /* Vector shifts of vectors are also ok. */
3541 && !(TREE_CODE (rhs1_type) == VECTOR_TYPE
3542 && INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type))
3543 && TREE_CODE (rhs2_type) == VECTOR_TYPE
3544 && INTEGRAL_TYPE_P (TREE_TYPE (rhs2_type))))
3545 || !useless_type_conversion_p (lhs_type, rhs1_type))
3547 error ("type mismatch in shift expression");
3548 debug_generic_expr (lhs_type);
3549 debug_generic_expr (rhs1_type);
3550 debug_generic_expr (rhs2_type);
3557 case VEC_LSHIFT_EXPR:
3558 case VEC_RSHIFT_EXPR:
3560 if (TREE_CODE (rhs1_type) != VECTOR_TYPE
3561 || !(INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type))
3562 || POINTER_TYPE_P (TREE_TYPE (rhs1_type))
3563 || FIXED_POINT_TYPE_P (TREE_TYPE (rhs1_type))
3564 || SCALAR_FLOAT_TYPE_P (TREE_TYPE (rhs1_type)))
3565 || (!INTEGRAL_TYPE_P (rhs2_type)
3566 && (TREE_CODE (rhs2_type) != VECTOR_TYPE
3567 || !INTEGRAL_TYPE_P (TREE_TYPE (rhs2_type))))
3568 || !useless_type_conversion_p (lhs_type, rhs1_type))
3570 error ("type mismatch in vector shift expression");
3571 debug_generic_expr (lhs_type);
3572 debug_generic_expr (rhs1_type);
3573 debug_generic_expr (rhs2_type);
3576 /* For shifting a vector of non-integral components we
3577 only allow shifting by a constant multiple of the element size. */
3578 if (!INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type))
3579 && (TREE_CODE (rhs2) != INTEGER_CST
3580 || !div_if_zero_remainder (EXACT_DIV_EXPR, rhs2,
3581 TYPE_SIZE (TREE_TYPE (rhs1_type)))))
3583 error ("non-element sized vector shift of floating point vector");
3590 case WIDEN_LSHIFT_EXPR:
3592 if (!INTEGRAL_TYPE_P (lhs_type)
3593 || !INTEGRAL_TYPE_P (rhs1_type)
3594 || TREE_CODE (rhs2) != INTEGER_CST
3595 || (2 * TYPE_PRECISION (rhs1_type) > TYPE_PRECISION (lhs_type)))
3597 error ("type mismatch in widening vector shift expression");
3598 debug_generic_expr (lhs_type);
3599 debug_generic_expr (rhs1_type);
3600 debug_generic_expr (rhs2_type);
3607 case VEC_WIDEN_LSHIFT_HI_EXPR:
3608 case VEC_WIDEN_LSHIFT_LO_EXPR:
3610 if (TREE_CODE (rhs1_type) != VECTOR_TYPE
3611 || TREE_CODE (lhs_type) != VECTOR_TYPE
3612 || !INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type))
3613 || !INTEGRAL_TYPE_P (TREE_TYPE (lhs_type))
3614 || TREE_CODE (rhs2) != INTEGER_CST
3615 || (2 * TYPE_PRECISION (TREE_TYPE (rhs1_type))
3616 > TYPE_PRECISION (TREE_TYPE (lhs_type))))
3618 error ("type mismatch in widening vector shift expression");
3619 debug_generic_expr (lhs_type);
3620 debug_generic_expr (rhs1_type);
3621 debug_generic_expr (rhs2_type);
3631 /* We use regular PLUS_EXPR and MINUS_EXPR for vectors.
3632 ??? This just makes the checker happy and may not be what is
3634 if (TREE_CODE (lhs_type) == VECTOR_TYPE
3635 && POINTER_TYPE_P (TREE_TYPE (lhs_type)))
3637 if (TREE_CODE (rhs1_type) != VECTOR_TYPE
3638 || TREE_CODE (rhs2_type) != VECTOR_TYPE)
3640 error ("invalid non-vector operands to vector valued plus");
3643 lhs_type = TREE_TYPE (lhs_type);
3644 rhs1_type = TREE_TYPE (rhs1_type);
3645 rhs2_type = TREE_TYPE (rhs2_type);
3646 /* PLUS_EXPR is commutative, so we might end up canonicalizing
3647 the pointer to 2nd place. */
3648 if (POINTER_TYPE_P (rhs2_type))
3650 tree tem = rhs1_type;
3651 rhs1_type = rhs2_type;
3654 goto do_pointer_plus_expr_check;
3656 if (POINTER_TYPE_P (lhs_type)
3657 || POINTER_TYPE_P (rhs1_type)
3658 || POINTER_TYPE_P (rhs2_type))
3660 error ("invalid (pointer) operands to plus/minus");
3664 /* Continue with generic binary expression handling. */
3668 case POINTER_PLUS_EXPR:
3670 do_pointer_plus_expr_check:
3671 if (!POINTER_TYPE_P (rhs1_type)
3672 || !useless_type_conversion_p (lhs_type, rhs1_type)
3673 || !ptrofftype_p (rhs2_type))
3675 error ("type mismatch in pointer plus expression");
3676 debug_generic_stmt (lhs_type);
3677 debug_generic_stmt (rhs1_type);
3678 debug_generic_stmt (rhs2_type);
3685 case TRUTH_ANDIF_EXPR:
3686 case TRUTH_ORIF_EXPR:
3687 case TRUTH_AND_EXPR:
3689 case TRUTH_XOR_EXPR:
3699 case UNORDERED_EXPR:
3707 /* Comparisons are also binary, but the result type is not
3708 connected to the operand types. */
3709 return verify_gimple_comparison (lhs_type, rhs1, rhs2);
3711 case WIDEN_MULT_EXPR:
3712 if (TREE_CODE (lhs_type) != INTEGER_TYPE)
3714 return ((2 * TYPE_PRECISION (rhs1_type) > TYPE_PRECISION (lhs_type))
3715 || (TYPE_PRECISION (rhs1_type) != TYPE_PRECISION (rhs2_type)));
3717 case WIDEN_SUM_EXPR:
3718 case VEC_WIDEN_MULT_HI_EXPR:
3719 case VEC_WIDEN_MULT_LO_EXPR:
3720 case VEC_WIDEN_MULT_EVEN_EXPR:
3721 case VEC_WIDEN_MULT_ODD_EXPR:
3722 case VEC_PACK_TRUNC_EXPR:
3723 case VEC_PACK_SAT_EXPR:
3724 case VEC_PACK_FIX_TRUNC_EXPR:
3729 case MULT_HIGHPART_EXPR:
3730 case TRUNC_DIV_EXPR:
3732 case FLOOR_DIV_EXPR:
3733 case ROUND_DIV_EXPR:
3734 case TRUNC_MOD_EXPR:
3736 case FLOOR_MOD_EXPR:
3737 case ROUND_MOD_EXPR:
3739 case EXACT_DIV_EXPR:
3745 /* Continue with generic binary expression handling. */
3752 if (!useless_type_conversion_p (lhs_type, rhs1_type)
3753 || !useless_type_conversion_p (lhs_type, rhs2_type))
3755 error ("type mismatch in binary expression");
3756 debug_generic_stmt (lhs_type);
3757 debug_generic_stmt (rhs1_type);
3758 debug_generic_stmt (rhs2_type);
3765 /* Verify a gimple assignment statement STMT with a ternary rhs.
3766 Returns true if anything is wrong. */
3769 verify_gimple_assign_ternary (gimple stmt)
3771 enum tree_code rhs_code = gimple_assign_rhs_code (stmt);
3772 tree lhs = gimple_assign_lhs (stmt);
3773 tree lhs_type = TREE_TYPE (lhs);
3774 tree rhs1 = gimple_assign_rhs1 (stmt);
3775 tree rhs1_type = TREE_TYPE (rhs1);
3776 tree rhs2 = gimple_assign_rhs2 (stmt);
3777 tree rhs2_type = TREE_TYPE (rhs2);
3778 tree rhs3 = gimple_assign_rhs3 (stmt);
3779 tree rhs3_type = TREE_TYPE (rhs3);
3781 if (!is_gimple_reg (lhs))
3783 error ("non-register as LHS of ternary operation");
3787 if (((rhs_code == VEC_COND_EXPR || rhs_code == COND_EXPR)
3788 ? !is_gimple_condexpr (rhs1) : !is_gimple_val (rhs1))
3789 || !is_gimple_val (rhs2)
3790 || !is_gimple_val (rhs3))
3792 error ("invalid operands in ternary operation");
3796 /* First handle operations that involve different types. */
3799 case WIDEN_MULT_PLUS_EXPR:
3800 case WIDEN_MULT_MINUS_EXPR:
3801 if ((!INTEGRAL_TYPE_P (rhs1_type)
3802 && !FIXED_POINT_TYPE_P (rhs1_type))
3803 || !useless_type_conversion_p (rhs1_type, rhs2_type)
3804 || !useless_type_conversion_p (lhs_type, rhs3_type)
3805 || 2 * TYPE_PRECISION (rhs1_type) > TYPE_PRECISION (lhs_type)
3806 || TYPE_PRECISION (rhs1_type) != TYPE_PRECISION (rhs2_type))
3808 error ("type mismatch in widening multiply-accumulate expression");
3809 debug_generic_expr (lhs_type);
3810 debug_generic_expr (rhs1_type);
3811 debug_generic_expr (rhs2_type);
3812 debug_generic_expr (rhs3_type);
3818 if (!useless_type_conversion_p (lhs_type, rhs1_type)
3819 || !useless_type_conversion_p (lhs_type, rhs2_type)
3820 || !useless_type_conversion_p (lhs_type, rhs3_type))
3822 error ("type mismatch in fused multiply-add expression");
3823 debug_generic_expr (lhs_type);
3824 debug_generic_expr (rhs1_type);
3825 debug_generic_expr (rhs2_type);
3826 debug_generic_expr (rhs3_type);
3833 if (!useless_type_conversion_p (lhs_type, rhs2_type)
3834 || !useless_type_conversion_p (lhs_type, rhs3_type))
3836 error ("type mismatch in conditional expression");
3837 debug_generic_expr (lhs_type);
3838 debug_generic_expr (rhs2_type);
3839 debug_generic_expr (rhs3_type);
3845 if (!useless_type_conversion_p (lhs_type, rhs1_type)
3846 || !useless_type_conversion_p (lhs_type, rhs2_type))
3848 error ("type mismatch in vector permute expression");
3849 debug_generic_expr (lhs_type);
3850 debug_generic_expr (rhs1_type);
3851 debug_generic_expr (rhs2_type);
3852 debug_generic_expr (rhs3_type);
3856 if (TREE_CODE (rhs1_type) != VECTOR_TYPE
3857 || TREE_CODE (rhs2_type) != VECTOR_TYPE
3858 || TREE_CODE (rhs3_type) != VECTOR_TYPE)
3860 error ("vector types expected in vector permute expression");
3861 debug_generic_expr (lhs_type);
3862 debug_generic_expr (rhs1_type);
3863 debug_generic_expr (rhs2_type);
3864 debug_generic_expr (rhs3_type);
3868 if (TYPE_VECTOR_SUBPARTS (rhs1_type) != TYPE_VECTOR_SUBPARTS (rhs2_type)
3869 || TYPE_VECTOR_SUBPARTS (rhs2_type)
3870 != TYPE_VECTOR_SUBPARTS (rhs3_type)
3871 || TYPE_VECTOR_SUBPARTS (rhs3_type)
3872 != TYPE_VECTOR_SUBPARTS (lhs_type))
3874 error ("vectors with different element number found "
3875 "in vector permute expression");
3876 debug_generic_expr (lhs_type);
3877 debug_generic_expr (rhs1_type);
3878 debug_generic_expr (rhs2_type);
3879 debug_generic_expr (rhs3_type);
3883 if (TREE_CODE (TREE_TYPE (rhs3_type)) != INTEGER_TYPE
3884 || GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (rhs3_type)))
3885 != GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (rhs1_type))))
3887 error ("invalid mask type in vector permute expression");
3888 debug_generic_expr (lhs_type);
3889 debug_generic_expr (rhs1_type);
3890 debug_generic_expr (rhs2_type);
3891 debug_generic_expr (rhs3_type);
3898 case REALIGN_LOAD_EXPR:
3908 /* Verify a gimple assignment statement STMT with a single rhs.
3909 Returns true if anything is wrong. */
3912 verify_gimple_assign_single (gimple stmt)
3914 enum tree_code rhs_code = gimple_assign_rhs_code (stmt);
3915 tree lhs = gimple_assign_lhs (stmt);
3916 tree lhs_type = TREE_TYPE (lhs);
3917 tree rhs1 = gimple_assign_rhs1 (stmt);
3918 tree rhs1_type = TREE_TYPE (rhs1);
3921 if (!useless_type_conversion_p (lhs_type, rhs1_type))
3923 error ("non-trivial conversion at assignment");
3924 debug_generic_expr (lhs_type);
3925 debug_generic_expr (rhs1_type);
3929 if (handled_component_p (lhs))
3930 res |= verify_types_in_gimple_reference (lhs, true);
3932 /* Special codes we cannot handle via their class. */
3937 tree op = TREE_OPERAND (rhs1, 0);
3938 if (!is_gimple_addressable (op))
3940 error ("invalid operand in unary expression");
3944 /* Technically there is no longer a need for matching types, but
3945 gimple hygiene asks for this check. In LTO we can end up
3946 combining incompatible units and thus end up with addresses
3947 of globals that change their type to a common one. */
3949 && !types_compatible_p (TREE_TYPE (op),
3950 TREE_TYPE (TREE_TYPE (rhs1)))
3951 && !one_pointer_to_useless_type_conversion_p (TREE_TYPE (rhs1),
3954 error ("type mismatch in address expression");
3955 debug_generic_stmt (TREE_TYPE (rhs1));
3956 debug_generic_stmt (TREE_TYPE (op));
3960 return verify_types_in_gimple_reference (op, true);
3965 error ("INDIRECT_REF in gimple IL");
3971 case ARRAY_RANGE_REF:
3972 case VIEW_CONVERT_EXPR:
3975 case TARGET_MEM_REF:
3977 if (!is_gimple_reg (lhs)
3978 && is_gimple_reg_type (TREE_TYPE (lhs)))
3980 error ("invalid rhs for gimple memory store");
3981 debug_generic_stmt (lhs);
3982 debug_generic_stmt (rhs1);
3985 return res || verify_types_in_gimple_reference (rhs1, false);
3997 /* tcc_declaration */
4002 if (!is_gimple_reg (lhs)
4003 && !is_gimple_reg (rhs1)
4004 && is_gimple_reg_type (TREE_TYPE (lhs)))
4006 error ("invalid rhs for gimple memory store");
4007 debug_generic_stmt (lhs);
4008 debug_generic_stmt (rhs1);
4016 case WITH_SIZE_EXPR:
4026 /* Verify the contents of a GIMPLE_ASSIGN STMT. Returns true when there
4027 is a problem, otherwise false. */
4030 verify_gimple_assign (gimple stmt)
4032 switch (gimple_assign_rhs_class (stmt))
4034 case GIMPLE_SINGLE_RHS:
4035 return verify_gimple_assign_single (stmt);
4037 case GIMPLE_UNARY_RHS:
4038 return verify_gimple_assign_unary (stmt);
4040 case GIMPLE_BINARY_RHS:
4041 return verify_gimple_assign_binary (stmt);
4043 case GIMPLE_TERNARY_RHS:
4044 return verify_gimple_assign_ternary (stmt);
4051 /* Verify the contents of a GIMPLE_RETURN STMT. Returns true when there
4052 is a problem, otherwise false. */
4055 verify_gimple_return (gimple stmt)
4057 tree op = gimple_return_retval (stmt);
4058 tree restype = TREE_TYPE (TREE_TYPE (cfun->decl));
4060 /* We cannot test for present return values as we do not fix up missing
4061 return values from the original source. */
4065 if (!is_gimple_val (op)
4066 && TREE_CODE (op) != RESULT_DECL)
4068 error ("invalid operand in return statement");
4069 debug_generic_stmt (op);
4073 if ((TREE_CODE (op) == RESULT_DECL
4074 && DECL_BY_REFERENCE (op))
4075 || (TREE_CODE (op) == SSA_NAME
4076 && TREE_CODE (SSA_NAME_VAR (op)) == RESULT_DECL
4077 && DECL_BY_REFERENCE (SSA_NAME_VAR (op))))
4078 op = TREE_TYPE (op);
4080 if (!useless_type_conversion_p (restype, TREE_TYPE (op)))
4082 error ("invalid conversion in return statement");
4083 debug_generic_stmt (restype);
4084 debug_generic_stmt (TREE_TYPE (op));
4092 /* Verify the contents of a GIMPLE_GOTO STMT. Returns true when there
4093 is a problem, otherwise false. */
4096 verify_gimple_goto (gimple stmt)
4098 tree dest = gimple_goto_dest (stmt);
4100 /* ??? We have two canonical forms of direct goto destinations, a
4101 bare LABEL_DECL and an ADDR_EXPR of a LABEL_DECL. */
4102 if (TREE_CODE (dest) != LABEL_DECL
4103 && (!is_gimple_val (dest)
4104 || !POINTER_TYPE_P (TREE_TYPE (dest))))
4106 error ("goto destination is neither a label nor a pointer");
4113 /* Verify the contents of a GIMPLE_SWITCH STMT. Returns true when there
4114 is a problem, otherwise false. */
4117 verify_gimple_switch (gimple stmt)
4120 tree elt, prev_upper_bound = NULL_TREE;
4121 tree index_type, elt_type = NULL_TREE;
4123 if (!is_gimple_val (gimple_switch_index (stmt)))
4125 error ("invalid operand to switch statement");
4126 debug_generic_stmt (gimple_switch_index (stmt));
4130 index_type = TREE_TYPE (gimple_switch_index (stmt));
4131 if (! INTEGRAL_TYPE_P (index_type))
4133 error ("non-integral type switch statement");
4134 debug_generic_expr (index_type);
4138 elt = gimple_switch_default_label (stmt);
4139 if (CASE_LOW (elt) != NULL_TREE || CASE_HIGH (elt) != NULL_TREE)
4141 error ("invalid default case label in switch statement");
4142 debug_generic_expr (elt);
4146 n = gimple_switch_num_labels (stmt);
4147 for (i = 1; i < n; i++)
4149 elt = gimple_switch_label (stmt, i);
4151 if (! CASE_LOW (elt))
4153 error ("invalid case label in switch statement");
4154 debug_generic_expr (elt);
4158 && ! tree_int_cst_lt (CASE_LOW (elt), CASE_HIGH (elt)))
4160 error ("invalid case range in switch statement");
4161 debug_generic_expr (elt);
4167 if (TREE_TYPE (CASE_LOW (elt)) != elt_type
4168 || (CASE_HIGH (elt) && TREE_TYPE (CASE_HIGH (elt)) != elt_type))
4170 error ("type mismatch for case label in switch statement");
4171 debug_generic_expr (elt);
4177 elt_type = TREE_TYPE (CASE_LOW (elt));
4178 if (TYPE_PRECISION (index_type) < TYPE_PRECISION (elt_type))
4180 error ("type precision mismatch in switch statement");
4185 if (prev_upper_bound)
4187 if (! tree_int_cst_lt (prev_upper_bound, CASE_LOW (elt)))
4189 error ("case labels not sorted in switch statement");
4194 prev_upper_bound = CASE_HIGH (elt);
4195 if (! prev_upper_bound)
4196 prev_upper_bound = CASE_LOW (elt);
4202 /* Verify a gimple debug statement STMT.
4203 Returns true if anything is wrong. */
4206 verify_gimple_debug (gimple stmt ATTRIBUTE_UNUSED)
4208 /* There isn't much that could be wrong in a gimple debug stmt. A
4209 gimple debug bind stmt, for example, maps a tree, that's usually
4210 a VAR_DECL or a PARM_DECL, but that could also be some scalarized
4211 component or member of an aggregate type, to another tree, that
4212 can be an arbitrary expression. These stmts expand into debug
4213 insns, and are converted to debug notes by var-tracking.c. */
4217 /* Verify a gimple label statement STMT.
4218 Returns true if anything is wrong. */
4221 verify_gimple_label (gimple stmt)
4223 tree decl = gimple_label_label (stmt);
4227 if (TREE_CODE (decl) != LABEL_DECL)
4230 uid = LABEL_DECL_UID (decl);
4233 || VEC_index (basic_block,
4234 label_to_block_map, uid) != gimple_bb (stmt)))
4236 error ("incorrect entry in label_to_block_map");
4240 uid = EH_LANDING_PAD_NR (decl);
4243 eh_landing_pad lp = get_eh_landing_pad_from_number (uid);
4244 if (decl != lp->post_landing_pad)
4246 error ("incorrect setting of landing pad number");
4254 /* Verify the GIMPLE statement STMT. Returns true if there is an
4255 error, otherwise false. */
4258 verify_gimple_stmt (gimple stmt)
4260 switch (gimple_code (stmt))
4263 return verify_gimple_assign (stmt);
4266 return verify_gimple_label (stmt);
4269 return verify_gimple_call (stmt);
4272 if (TREE_CODE_CLASS (gimple_cond_code (stmt)) != tcc_comparison)
4274 error ("invalid comparison code in gimple cond");
4277 if (!(!gimple_cond_true_label (stmt)
4278 || TREE_CODE (gimple_cond_true_label (stmt)) == LABEL_DECL)
4279 || !(!gimple_cond_false_label (stmt)
4280 || TREE_CODE (gimple_cond_false_label (stmt)) == LABEL_DECL))
4282 error ("invalid labels in gimple cond");
4286 return verify_gimple_comparison (boolean_type_node,
4287 gimple_cond_lhs (stmt),
4288 gimple_cond_rhs (stmt));
4291 return verify_gimple_goto (stmt);
4294 return verify_gimple_switch (stmt);
4297 return verify_gimple_return (stmt);
4302 case GIMPLE_TRANSACTION:
4303 return verify_gimple_transaction (stmt);
4305 /* Tuples that do not have tree operands. */
4307 case GIMPLE_PREDICT:
4309 case GIMPLE_EH_DISPATCH:
4310 case GIMPLE_EH_MUST_NOT_THROW:
4314 /* OpenMP directives are validated by the FE and never operated
4315 on by the optimizers. Furthermore, GIMPLE_OMP_FOR may contain
4316 non-gimple expressions when the main index variable has had
4317 its address taken. This does not affect the loop itself
4318 because the header of an GIMPLE_OMP_FOR is merely used to determine
4319 how to setup the parallel iteration. */
4323 return verify_gimple_debug (stmt);
4330 /* Verify the contents of a GIMPLE_PHI. Returns true if there is a problem,
4331 and false otherwise. */
4334 verify_gimple_phi (gimple phi)
4338 tree phi_result = gimple_phi_result (phi);
4343 error ("invalid PHI result");
4347 virtual_p = !is_gimple_reg (phi_result);
4348 if (TREE_CODE (phi_result) != SSA_NAME
4350 && SSA_NAME_VAR (phi_result) != gimple_vop (cfun)))
4352 error ("invalid PHI result");
4356 for (i = 0; i < gimple_phi_num_args (phi); i++)
4358 tree t = gimple_phi_arg_def (phi, i);
4362 error ("missing PHI def");
4366 /* Addressable variables do have SSA_NAMEs but they
4367 are not considered gimple values. */
4368 else if ((TREE_CODE (t) == SSA_NAME
4369 && virtual_p != !is_gimple_reg (t))
4371 && (TREE_CODE (t) != SSA_NAME
4372 || SSA_NAME_VAR (t) != gimple_vop (cfun)))
4374 && !is_gimple_val (t)))
4376 error ("invalid PHI argument");
4377 debug_generic_expr (t);
4380 #ifdef ENABLE_TYPES_CHECKING
4381 if (!useless_type_conversion_p (TREE_TYPE (phi_result), TREE_TYPE (t)))
4383 error ("incompatible types in PHI argument %u", i);
4384 debug_generic_stmt (TREE_TYPE (phi_result));
4385 debug_generic_stmt (TREE_TYPE (t));
4394 /* Verify the GIMPLE statements inside the sequence STMTS. */
4397 verify_gimple_in_seq_2 (gimple_seq stmts)
4399 gimple_stmt_iterator ittr;
4402 for (ittr = gsi_start (stmts); !gsi_end_p (ittr); gsi_next (&ittr))
4404 gimple stmt = gsi_stmt (ittr);
4406 switch (gimple_code (stmt))
4409 err |= verify_gimple_in_seq_2 (gimple_bind_body (stmt));
4413 err |= verify_gimple_in_seq_2 (gimple_try_eval (stmt));
4414 err |= verify_gimple_in_seq_2 (gimple_try_cleanup (stmt));
4417 case GIMPLE_EH_FILTER:
4418 err |= verify_gimple_in_seq_2 (gimple_eh_filter_failure (stmt));
4421 case GIMPLE_EH_ELSE:
4422 err |= verify_gimple_in_seq_2 (gimple_eh_else_n_body (stmt));
4423 err |= verify_gimple_in_seq_2 (gimple_eh_else_e_body (stmt));
4427 err |= verify_gimple_in_seq_2 (gimple_catch_handler (stmt));
4430 case GIMPLE_TRANSACTION:
4431 err |= verify_gimple_transaction (stmt);
4436 bool err2 = verify_gimple_stmt (stmt);
4438 debug_gimple_stmt (stmt);
4447 /* Verify the contents of a GIMPLE_TRANSACTION. Returns true if there
4448 is a problem, otherwise false. */
4451 verify_gimple_transaction (gimple stmt)
4453 tree lab = gimple_transaction_label (stmt);
4454 if (lab != NULL && TREE_CODE (lab) != LABEL_DECL)
4456 return verify_gimple_in_seq_2 (gimple_transaction_body (stmt));
4460 /* Verify the GIMPLE statements inside the statement list STMTS. */
4463 verify_gimple_in_seq (gimple_seq stmts)
4465 timevar_push (TV_TREE_STMT_VERIFY);
4466 if (verify_gimple_in_seq_2 (stmts))
4467 internal_error ("verify_gimple failed");
4468 timevar_pop (TV_TREE_STMT_VERIFY);
4471 /* Return true when the T can be shared. */
4474 tree_node_can_be_shared (tree t)
4476 if (IS_TYPE_OR_DECL_P (t)
4477 || is_gimple_min_invariant (t)
4478 || TREE_CODE (t) == SSA_NAME
4479 || t == error_mark_node
4480 || TREE_CODE (t) == IDENTIFIER_NODE)
4483 if (TREE_CODE (t) == CASE_LABEL_EXPR)
4486 while (((TREE_CODE (t) == ARRAY_REF || TREE_CODE (t) == ARRAY_RANGE_REF)
4487 && is_gimple_min_invariant (TREE_OPERAND (t, 1)))
4488 || TREE_CODE (t) == COMPONENT_REF
4489 || TREE_CODE (t) == REALPART_EXPR
4490 || TREE_CODE (t) == IMAGPART_EXPR)
4491 t = TREE_OPERAND (t, 0);
4499 /* Called via walk_gimple_stmt. Verify tree sharing. */
4502 verify_node_sharing (tree *tp, int *walk_subtrees, void *data)
4504 struct walk_stmt_info *wi = (struct walk_stmt_info *) data;
4505 struct pointer_set_t *visited = (struct pointer_set_t *) wi->info;
4507 if (tree_node_can_be_shared (*tp))
4509 *walk_subtrees = false;
4513 if (pointer_set_insert (visited, *tp))
4519 static bool eh_error_found;
4521 verify_eh_throw_stmt_node (void **slot, void *data)
4523 struct throw_stmt_node *node = (struct throw_stmt_node *)*slot;
4524 struct pointer_set_t *visited = (struct pointer_set_t *) data;
4526 if (!pointer_set_contains (visited, node->stmt))
4528 error ("dead STMT in EH table");
4529 debug_gimple_stmt (node->stmt);
4530 eh_error_found = true;
4535 /* Verify the GIMPLE statements in the CFG of FN. */
4538 verify_gimple_in_cfg (struct function *fn)
4542 struct pointer_set_t *visited, *visited_stmts;
4544 timevar_push (TV_TREE_STMT_VERIFY);
4545 visited = pointer_set_create ();
4546 visited_stmts = pointer_set_create ();
4548 FOR_EACH_BB_FN (bb, fn)
4550 gimple_stmt_iterator gsi;
4552 for (gsi = gsi_start_phis (bb); !gsi_end_p (gsi); gsi_next (&gsi))
4554 gimple phi = gsi_stmt (gsi);
4558 pointer_set_insert (visited_stmts, phi);
4560 if (gimple_bb (phi) != bb)
4562 error ("gimple_bb (phi) is set to a wrong basic block");
4566 err2 |= verify_gimple_phi (phi);
4568 for (i = 0; i < gimple_phi_num_args (phi); i++)
4570 tree arg = gimple_phi_arg_def (phi, i);
4571 tree addr = walk_tree (&arg, verify_node_sharing, visited, NULL);
4574 error ("incorrect sharing of tree nodes");
4575 debug_generic_expr (addr);
4581 debug_gimple_stmt (phi);
4585 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
4587 gimple stmt = gsi_stmt (gsi);
4589 struct walk_stmt_info wi;
4593 pointer_set_insert (visited_stmts, stmt);
4595 if (gimple_bb (stmt) != bb)
4597 error ("gimple_bb (stmt) is set to a wrong basic block");
4601 err2 |= verify_gimple_stmt (stmt);
4603 memset (&wi, 0, sizeof (wi));
4604 wi.info = (void *) visited;
4605 addr = walk_gimple_op (stmt, verify_node_sharing, &wi);
4608 error ("incorrect sharing of tree nodes");
4609 debug_generic_expr (addr);
4613 /* ??? Instead of not checking these stmts at all the walker
4614 should know its context via wi. */
4615 if (!is_gimple_debug (stmt)
4616 && !is_gimple_omp (stmt))
4618 memset (&wi, 0, sizeof (wi));
4619 addr = walk_gimple_op (stmt, verify_expr, &wi);
4622 debug_generic_expr (addr);
4623 inform (gimple_location (stmt), "in statement");
4628 /* If the statement is marked as part of an EH region, then it is
4629 expected that the statement could throw. Verify that when we
4630 have optimizations that simplify statements such that we prove
4631 that they cannot throw, that we update other data structures
4633 lp_nr = lookup_stmt_eh_lp (stmt);
4636 if (!stmt_could_throw_p (stmt))
4638 error ("statement marked for throw, but doesn%'t");
4642 && !gsi_one_before_end_p (gsi)
4643 && stmt_can_throw_internal (stmt))
4645 error ("statement marked for throw in middle of block");
4651 debug_gimple_stmt (stmt);
4656 eh_error_found = false;
4657 if (get_eh_throw_stmt_table (cfun))
4658 htab_traverse (get_eh_throw_stmt_table (cfun),
4659 verify_eh_throw_stmt_node,
4662 if (err || eh_error_found)
4663 internal_error ("verify_gimple failed");
4665 pointer_set_destroy (visited);
4666 pointer_set_destroy (visited_stmts);
4667 verify_histograms ();
4668 timevar_pop (TV_TREE_STMT_VERIFY);
4672 /* Verifies that the flow information is OK. */
4675 gimple_verify_flow_info (void)
4679 gimple_stmt_iterator gsi;
4684 if (ENTRY_BLOCK_PTR->il.gimple.seq || ENTRY_BLOCK_PTR->il.gimple.phi_nodes)
4686 error ("ENTRY_BLOCK has IL associated with it");
4690 if (EXIT_BLOCK_PTR->il.gimple.seq || EXIT_BLOCK_PTR->il.gimple.phi_nodes)
4692 error ("EXIT_BLOCK has IL associated with it");
4696 FOR_EACH_EDGE (e, ei, EXIT_BLOCK_PTR->preds)
4697 if (e->flags & EDGE_FALLTHRU)
4699 error ("fallthru to exit from bb %d", e->src->index);
4705 bool found_ctrl_stmt = false;
4709 /* Skip labels on the start of basic block. */
4710 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
4713 gimple prev_stmt = stmt;
4715 stmt = gsi_stmt (gsi);
4717 if (gimple_code (stmt) != GIMPLE_LABEL)
4720 label = gimple_label_label (stmt);
4721 if (prev_stmt && DECL_NONLOCAL (label))
4723 error ("nonlocal label ");
4724 print_generic_expr (stderr, label, 0);
4725 fprintf (stderr, " is not first in a sequence of labels in bb %d",
4730 if (prev_stmt && EH_LANDING_PAD_NR (label) != 0)
4732 error ("EH landing pad label ");
4733 print_generic_expr (stderr, label, 0);
4734 fprintf (stderr, " is not first in a sequence of labels in bb %d",
4739 if (label_to_block (label) != bb)
4742 print_generic_expr (stderr, label, 0);
4743 fprintf (stderr, " to block does not match in bb %d",
4748 if (decl_function_context (label) != current_function_decl)
4751 print_generic_expr (stderr, label, 0);
4752 fprintf (stderr, " has incorrect context in bb %d",
4758 /* Verify that body of basic block BB is free of control flow. */
4759 for (; !gsi_end_p (gsi); gsi_next (&gsi))
4761 gimple stmt = gsi_stmt (gsi);
4763 if (found_ctrl_stmt)
4765 error ("control flow in the middle of basic block %d",
4770 if (stmt_ends_bb_p (stmt))
4771 found_ctrl_stmt = true;
4773 if (gimple_code (stmt) == GIMPLE_LABEL)
4776 print_generic_expr (stderr, gimple_label_label (stmt), 0);
4777 fprintf (stderr, " in the middle of basic block %d", bb->index);
4782 gsi = gsi_last_bb (bb);
4783 if (gsi_end_p (gsi))
4786 stmt = gsi_stmt (gsi);
4788 if (gimple_code (stmt) == GIMPLE_LABEL)
4791 err |= verify_eh_edges (stmt);
4793 if (is_ctrl_stmt (stmt))
4795 FOR_EACH_EDGE (e, ei, bb->succs)
4796 if (e->flags & EDGE_FALLTHRU)
4798 error ("fallthru edge after a control statement in bb %d",
4804 if (gimple_code (stmt) != GIMPLE_COND)
4806 /* Verify that there are no edges with EDGE_TRUE/FALSE_FLAG set
4807 after anything else but if statement. */
4808 FOR_EACH_EDGE (e, ei, bb->succs)
4809 if (e->flags & (EDGE_TRUE_VALUE | EDGE_FALSE_VALUE))
4811 error ("true/false edge after a non-GIMPLE_COND in bb %d",
4817 switch (gimple_code (stmt))
4824 extract_true_false_edges_from_block (bb, &true_edge, &false_edge);
4828 || !(true_edge->flags & EDGE_TRUE_VALUE)
4829 || !(false_edge->flags & EDGE_FALSE_VALUE)
4830 || (true_edge->flags & (EDGE_FALLTHRU | EDGE_ABNORMAL))
4831 || (false_edge->flags & (EDGE_FALLTHRU | EDGE_ABNORMAL))
4832 || EDGE_COUNT (bb->succs) >= 3)
4834 error ("wrong outgoing edge flags at end of bb %d",
4842 if (simple_goto_p (stmt))
4844 error ("explicit goto at end of bb %d", bb->index);
4849 /* FIXME. We should double check that the labels in the
4850 destination blocks have their address taken. */
4851 FOR_EACH_EDGE (e, ei, bb->succs)
4852 if ((e->flags & (EDGE_FALLTHRU | EDGE_TRUE_VALUE
4853 | EDGE_FALSE_VALUE))
4854 || !(e->flags & EDGE_ABNORMAL))
4856 error ("wrong outgoing edge flags at end of bb %d",
4864 if (!gimple_call_builtin_p (stmt, BUILT_IN_RETURN))
4866 /* ... fallthru ... */
4868 if (!single_succ_p (bb)
4869 || (single_succ_edge (bb)->flags
4870 & (EDGE_FALLTHRU | EDGE_ABNORMAL
4871 | EDGE_TRUE_VALUE | EDGE_FALSE_VALUE)))
4873 error ("wrong outgoing edge flags at end of bb %d", bb->index);
4876 if (single_succ (bb) != EXIT_BLOCK_PTR)
4878 error ("return edge does not point to exit in bb %d",
4890 n = gimple_switch_num_labels (stmt);
4892 /* Mark all the destination basic blocks. */
4893 for (i = 0; i < n; ++i)
4895 tree lab = CASE_LABEL (gimple_switch_label (stmt, i));
4896 basic_block label_bb = label_to_block (lab);
4897 gcc_assert (!label_bb->aux || label_bb->aux == (void *)1);
4898 label_bb->aux = (void *)1;
4901 /* Verify that the case labels are sorted. */
4902 prev = gimple_switch_label (stmt, 0);
4903 for (i = 1; i < n; ++i)
4905 tree c = gimple_switch_label (stmt, i);
4908 error ("found default case not at the start of "
4914 && !tree_int_cst_lt (CASE_LOW (prev), CASE_LOW (c)))
4916 error ("case labels not sorted: ");
4917 print_generic_expr (stderr, prev, 0);
4918 fprintf (stderr," is greater than ");
4919 print_generic_expr (stderr, c, 0);
4920 fprintf (stderr," but comes before it.\n");
4925 /* VRP will remove the default case if it can prove it will
4926 never be executed. So do not verify there always exists
4927 a default case here. */
4929 FOR_EACH_EDGE (e, ei, bb->succs)
4933 error ("extra outgoing edge %d->%d",
4934 bb->index, e->dest->index);
4938 e->dest->aux = (void *)2;
4939 if ((e->flags & (EDGE_FALLTHRU | EDGE_ABNORMAL
4940 | EDGE_TRUE_VALUE | EDGE_FALSE_VALUE)))
4942 error ("wrong outgoing edge flags at end of bb %d",
4948 /* Check that we have all of them. */
4949 for (i = 0; i < n; ++i)
4951 tree lab = CASE_LABEL (gimple_switch_label (stmt, i));
4952 basic_block label_bb = label_to_block (lab);
4954 if (label_bb->aux != (void *)2)
4956 error ("missing edge %i->%i", bb->index, label_bb->index);
4961 FOR_EACH_EDGE (e, ei, bb->succs)
4962 e->dest->aux = (void *)0;
4966 case GIMPLE_EH_DISPATCH:
4967 err |= verify_eh_dispatch_edge (stmt);
4975 if (dom_info_state (CDI_DOMINATORS) >= DOM_NO_FAST_QUERY)
4976 verify_dominators (CDI_DOMINATORS);
4982 /* Updates phi nodes after creating a forwarder block joined
4983 by edge FALLTHRU. */
4986 gimple_make_forwarder_block (edge fallthru)
4990 basic_block dummy, bb;
4992 gimple_stmt_iterator gsi;
4994 dummy = fallthru->src;
4995 bb = fallthru->dest;
4997 if (single_pred_p (bb))
5000 /* If we redirected a branch we must create new PHI nodes at the
5002 for (gsi = gsi_start_phis (dummy); !gsi_end_p (gsi); gsi_next (&gsi))
5004 gimple phi, new_phi;
5006 phi = gsi_stmt (gsi);
5007 var = gimple_phi_result (phi);
5008 new_phi = create_phi_node (var, bb);
5009 SSA_NAME_DEF_STMT (var) = new_phi;
5010 gimple_phi_set_result (phi, make_ssa_name (SSA_NAME_VAR (var), phi));
5011 add_phi_arg (new_phi, gimple_phi_result (phi), fallthru,
5015 /* Add the arguments we have stored on edges. */
5016 FOR_EACH_EDGE (e, ei, bb->preds)
5021 flush_pending_stmts (e);
5026 /* Return a non-special label in the head of basic block BLOCK.
5027 Create one if it doesn't exist. */
5030 gimple_block_label (basic_block bb)
5032 gimple_stmt_iterator i, s = gsi_start_bb (bb);
5037 for (i = s; !gsi_end_p (i); first = false, gsi_next (&i))
5039 stmt = gsi_stmt (i);
5040 if (gimple_code (stmt) != GIMPLE_LABEL)
5042 label = gimple_label_label (stmt);
5043 if (!DECL_NONLOCAL (label))
5046 gsi_move_before (&i, &s);
5051 label = create_artificial_label (UNKNOWN_LOCATION);
5052 stmt = gimple_build_label (label);
5053 gsi_insert_before (&s, stmt, GSI_NEW_STMT);
5058 /* Attempt to perform edge redirection by replacing a possibly complex
5059 jump instruction by a goto or by removing the jump completely.
5060 This can apply only if all edges now point to the same block. The
5061 parameters and return values are equivalent to
5062 redirect_edge_and_branch. */
5065 gimple_try_redirect_by_replacing_jump (edge e, basic_block target)
5067 basic_block src = e->src;
5068 gimple_stmt_iterator i;
5071 /* We can replace or remove a complex jump only when we have exactly
5073 if (EDGE_COUNT (src->succs) != 2
5074 /* Verify that all targets will be TARGET. Specifically, the
5075 edge that is not E must also go to TARGET. */
5076 || EDGE_SUCC (src, EDGE_SUCC (src, 0) == e)->dest != target)
5079 i = gsi_last_bb (src);
5083 stmt = gsi_stmt (i);
5085 if (gimple_code (stmt) == GIMPLE_COND || gimple_code (stmt) == GIMPLE_SWITCH)
5087 gsi_remove (&i, true);
5088 e = ssa_redirect_edge (e, target);
5089 e->flags = EDGE_FALLTHRU;
5097 /* Redirect E to DEST. Return NULL on failure. Otherwise, return the
5098 edge representing the redirected branch. */
5101 gimple_redirect_edge_and_branch (edge e, basic_block dest)
5103 basic_block bb = e->src;
5104 gimple_stmt_iterator gsi;
5108 if (e->flags & EDGE_ABNORMAL)
5111 if (e->dest == dest)
5114 if (e->flags & EDGE_EH)
5115 return redirect_eh_edge (e, dest);
5117 if (e->src != ENTRY_BLOCK_PTR)
5119 ret = gimple_try_redirect_by_replacing_jump (e, dest);
5124 gsi = gsi_last_bb (bb);
5125 stmt = gsi_end_p (gsi) ? NULL : gsi_stmt (gsi);
5127 switch (stmt ? gimple_code (stmt) : GIMPLE_ERROR_MARK)
5130 /* For COND_EXPR, we only need to redirect the edge. */
5134 /* No non-abnormal edges should lead from a non-simple goto, and
5135 simple ones should be represented implicitly. */
5140 tree label = gimple_block_label (dest);
5141 tree cases = get_cases_for_edge (e, stmt);
5143 /* If we have a list of cases associated with E, then use it
5144 as it's a lot faster than walking the entire case vector. */
5147 edge e2 = find_edge (e->src, dest);
5154 CASE_LABEL (cases) = label;
5155 cases = CASE_CHAIN (cases);
5158 /* If there was already an edge in the CFG, then we need
5159 to move all the cases associated with E to E2. */
5162 tree cases2 = get_cases_for_edge (e2, stmt);
5164 CASE_CHAIN (last) = CASE_CHAIN (cases2);
5165 CASE_CHAIN (cases2) = first;
5167 bitmap_set_bit (touched_switch_bbs, gimple_bb (stmt)->index);
5171 size_t i, n = gimple_switch_num_labels (stmt);
5173 for (i = 0; i < n; i++)
5175 tree elt = gimple_switch_label (stmt, i);
5176 if (label_to_block (CASE_LABEL (elt)) == e->dest)
5177 CASE_LABEL (elt) = label;
5185 int i, n = gimple_asm_nlabels (stmt);
5188 for (i = 0; i < n; ++i)
5190 tree cons = gimple_asm_label_op (stmt, i);
5191 if (label_to_block (TREE_VALUE (cons)) == e->dest)
5194 label = gimple_block_label (dest);
5195 TREE_VALUE (cons) = label;
5199 /* If we didn't find any label matching the former edge in the
5200 asm labels, we must be redirecting the fallthrough
5202 gcc_assert (label || (e->flags & EDGE_FALLTHRU));
5207 gsi_remove (&gsi, true);
5208 e->flags |= EDGE_FALLTHRU;
5211 case GIMPLE_OMP_RETURN:
5212 case GIMPLE_OMP_CONTINUE:
5213 case GIMPLE_OMP_SECTIONS_SWITCH:
5214 case GIMPLE_OMP_FOR:
5215 /* The edges from OMP constructs can be simply redirected. */
5218 case GIMPLE_EH_DISPATCH:
5219 if (!(e->flags & EDGE_FALLTHRU))
5220 redirect_eh_dispatch_edge (stmt, e, dest);
5223 case GIMPLE_TRANSACTION:
5224 /* The ABORT edge has a stored label associated with it, otherwise
5225 the edges are simply redirectable. */
5227 gimple_transaction_set_label (stmt, gimple_block_label (dest));
5231 /* Otherwise it must be a fallthru edge, and we don't need to
5232 do anything besides redirecting it. */
5233 gcc_assert (e->flags & EDGE_FALLTHRU);
5237 /* Update/insert PHI nodes as necessary. */
5239 /* Now update the edges in the CFG. */
5240 e = ssa_redirect_edge (e, dest);
5245 /* Returns true if it is possible to remove edge E by redirecting
5246 it to the destination of the other edge from E->src. */
5249 gimple_can_remove_branch_p (const_edge e)
5251 if (e->flags & (EDGE_ABNORMAL | EDGE_EH))
5257 /* Simple wrapper, as we can always redirect fallthru edges. */
5260 gimple_redirect_edge_and_branch_force (edge e, basic_block dest)
5262 e = gimple_redirect_edge_and_branch (e, dest);
5269 /* Splits basic block BB after statement STMT (but at least after the
5270 labels). If STMT is NULL, BB is split just after the labels. */
5273 gimple_split_block (basic_block bb, void *stmt)
5275 gimple_stmt_iterator gsi;
5276 gimple_stmt_iterator gsi_tgt;
5283 new_bb = create_empty_bb (bb);
5285 /* Redirect the outgoing edges. */
5286 new_bb->succs = bb->succs;
5288 FOR_EACH_EDGE (e, ei, new_bb->succs)
5291 if (stmt && gimple_code ((gimple) stmt) == GIMPLE_LABEL)
5294 /* Move everything from GSI to the new basic block. */
5295 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
5297 act = gsi_stmt (gsi);
5298 if (gimple_code (act) == GIMPLE_LABEL)
5311 if (gsi_end_p (gsi))
5314 /* Split the statement list - avoid re-creating new containers as this
5315 brings ugly quadratic memory consumption in the inliner.
5316 (We are still quadratic since we need to update stmt BB pointers,
5318 gsi_split_seq_before (&gsi, &list);
5319 set_bb_seq (new_bb, list);
5320 for (gsi_tgt = gsi_start (list);
5321 !gsi_end_p (gsi_tgt); gsi_next (&gsi_tgt))
5322 gimple_set_bb (gsi_stmt (gsi_tgt), new_bb);
5328 /* Moves basic block BB after block AFTER. */
5331 gimple_move_block_after (basic_block bb, basic_block after)
5333 if (bb->prev_bb == after)
5337 link_block (bb, after);
5343 /* Return true if basic_block can be duplicated. */
5346 gimple_can_duplicate_bb_p (const_basic_block bb ATTRIBUTE_UNUSED)
5351 /* Create a duplicate of the basic block BB. NOTE: This does not
5352 preserve SSA form. */
5355 gimple_duplicate_bb (basic_block bb)
5358 gimple_stmt_iterator gsi, gsi_tgt;
5359 gimple_seq phis = phi_nodes (bb);
5360 gimple phi, stmt, copy;
5362 new_bb = create_empty_bb (EXIT_BLOCK_PTR->prev_bb);
5364 /* Copy the PHI nodes. We ignore PHI node arguments here because
5365 the incoming edges have not been setup yet. */
5366 for (gsi = gsi_start (phis); !gsi_end_p (gsi); gsi_next (&gsi))
5368 phi = gsi_stmt (gsi);
5369 copy = create_phi_node (gimple_phi_result (phi), new_bb);
5370 create_new_def_for (gimple_phi_result (copy), copy,
5371 gimple_phi_result_ptr (copy));
5374 gsi_tgt = gsi_start_bb (new_bb);
5375 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
5377 def_operand_p def_p;
5378 ssa_op_iter op_iter;
5381 stmt = gsi_stmt (gsi);
5382 if (gimple_code (stmt) == GIMPLE_LABEL)
5385 /* Don't duplicate label debug stmts. */
5386 if (gimple_debug_bind_p (stmt)
5387 && TREE_CODE (gimple_debug_bind_get_var (stmt))
5391 /* Create a new copy of STMT and duplicate STMT's virtual
5393 copy = gimple_copy (stmt);
5394 gsi_insert_after (&gsi_tgt, copy, GSI_NEW_STMT);
5396 maybe_duplicate_eh_stmt (copy, stmt);
5397 gimple_duplicate_stmt_histograms (cfun, copy, cfun, stmt);
5399 /* When copying around a stmt writing into a local non-user
5400 aggregate, make sure it won't share stack slot with other
5402 lhs = gimple_get_lhs (stmt);
5403 if (lhs && TREE_CODE (lhs) != SSA_NAME)
5405 tree base = get_base_address (lhs);
5407 && (TREE_CODE (base) == VAR_DECL
5408 || TREE_CODE (base) == RESULT_DECL)
5409 && DECL_IGNORED_P (base)
5410 && !TREE_STATIC (base)
5411 && !DECL_EXTERNAL (base)
5412 && (TREE_CODE (base) != VAR_DECL
5413 || !DECL_HAS_VALUE_EXPR_P (base)))
5414 DECL_NONSHAREABLE (base) = 1;
5417 /* Create new names for all the definitions created by COPY and
5418 add replacement mappings for each new name. */
5419 FOR_EACH_SSA_DEF_OPERAND (def_p, copy, op_iter, SSA_OP_ALL_DEFS)
5420 create_new_def_for (DEF_FROM_PTR (def_p), copy, def_p);
5426 /* Adds phi node arguments for edge E_COPY after basic block duplication. */
5429 add_phi_args_after_copy_edge (edge e_copy)
5431 basic_block bb, bb_copy = e_copy->src, dest;
5434 gimple phi, phi_copy;
5436 gimple_stmt_iterator psi, psi_copy;
5438 if (gimple_seq_empty_p (phi_nodes (e_copy->dest)))
5441 bb = bb_copy->flags & BB_DUPLICATED ? get_bb_original (bb_copy) : bb_copy;
5443 if (e_copy->dest->flags & BB_DUPLICATED)
5444 dest = get_bb_original (e_copy->dest);
5446 dest = e_copy->dest;
5448 e = find_edge (bb, dest);
5451 /* During loop unrolling the target of the latch edge is copied.
5452 In this case we are not looking for edge to dest, but to
5453 duplicated block whose original was dest. */
5454 FOR_EACH_EDGE (e, ei, bb->succs)
5456 if ((e->dest->flags & BB_DUPLICATED)
5457 && get_bb_original (e->dest) == dest)
5461 gcc_assert (e != NULL);
5464 for (psi = gsi_start_phis (e->dest),
5465 psi_copy = gsi_start_phis (e_copy->dest);
5467 gsi_next (&psi), gsi_next (&psi_copy))
5469 phi = gsi_stmt (psi);
5470 phi_copy = gsi_stmt (psi_copy);
5471 def = PHI_ARG_DEF_FROM_EDGE (phi, e);
5472 add_phi_arg (phi_copy, def, e_copy,
5473 gimple_phi_arg_location_from_edge (phi, e));
5478 /* Basic block BB_COPY was created by code duplication. Add phi node
5479 arguments for edges going out of BB_COPY. The blocks that were
5480 duplicated have BB_DUPLICATED set. */
5483 add_phi_args_after_copy_bb (basic_block bb_copy)
5488 FOR_EACH_EDGE (e_copy, ei, bb_copy->succs)
5490 add_phi_args_after_copy_edge (e_copy);
5494 /* Blocks in REGION_COPY array of length N_REGION were created by
5495 duplication of basic blocks. Add phi node arguments for edges
5496 going from these blocks. If E_COPY is not NULL, also add
5497 phi node arguments for its destination.*/
5500 add_phi_args_after_copy (basic_block *region_copy, unsigned n_region,
5505 for (i = 0; i < n_region; i++)
5506 region_copy[i]->flags |= BB_DUPLICATED;
5508 for (i = 0; i < n_region; i++)
5509 add_phi_args_after_copy_bb (region_copy[i]);
5511 add_phi_args_after_copy_edge (e_copy);
5513 for (i = 0; i < n_region; i++)
5514 region_copy[i]->flags &= ~BB_DUPLICATED;
5517 /* Duplicates a REGION (set of N_REGION basic blocks) with just a single
5518 important exit edge EXIT. By important we mean that no SSA name defined
5519 inside region is live over the other exit edges of the region. All entry
5520 edges to the region must go to ENTRY->dest. The edge ENTRY is redirected
5521 to the duplicate of the region. SSA form, dominance and loop information
5522 is updated. The new basic blocks are stored to REGION_COPY in the same
5523 order as they had in REGION, provided that REGION_COPY is not NULL.
5524 The function returns false if it is unable to copy the region,
5528 gimple_duplicate_sese_region (edge entry, edge exit,
5529 basic_block *region, unsigned n_region,
5530 basic_block *region_copy)
5533 bool free_region_copy = false, copying_header = false;
5534 struct loop *loop = entry->dest->loop_father;
5536 VEC (basic_block, heap) *doms;
5538 int total_freq = 0, entry_freq = 0;
5539 gcov_type total_count = 0, entry_count = 0;
5541 if (!can_copy_bbs_p (region, n_region))
5544 /* Some sanity checking. Note that we do not check for all possible
5545 missuses of the functions. I.e. if you ask to copy something weird,
5546 it will work, but the state of structures probably will not be
5548 for (i = 0; i < n_region; i++)
5550 /* We do not handle subloops, i.e. all the blocks must belong to the
5552 if (region[i]->loop_father != loop)
5555 if (region[i] != entry->dest
5556 && region[i] == loop->header)
5560 set_loop_copy (loop, loop);
5562 /* In case the function is used for loop header copying (which is the primary
5563 use), ensure that EXIT and its copy will be new latch and entry edges. */
5564 if (loop->header == entry->dest)
5566 copying_header = true;
5567 set_loop_copy (loop, loop_outer (loop));
5569 if (!dominated_by_p (CDI_DOMINATORS, loop->latch, exit->src))
5572 for (i = 0; i < n_region; i++)
5573 if (region[i] != exit->src
5574 && dominated_by_p (CDI_DOMINATORS, region[i], exit->src))
5580 region_copy = XNEWVEC (basic_block, n_region);
5581 free_region_copy = true;
5584 gcc_assert (!need_ssa_update_p (cfun));
5586 /* Record blocks outside the region that are dominated by something
5589 initialize_original_copy_tables ();
5591 doms = get_dominated_by_region (CDI_DOMINATORS, region, n_region);
5593 if (entry->dest->count)
5595 total_count = entry->dest->count;
5596 entry_count = entry->count;
5597 /* Fix up corner cases, to avoid division by zero or creation of negative
5599 if (entry_count > total_count)
5600 entry_count = total_count;
5604 total_freq = entry->dest->frequency;
5605 entry_freq = EDGE_FREQUENCY (entry);
5606 /* Fix up corner cases, to avoid division by zero or creation of negative
5608 if (total_freq == 0)
5610 else if (entry_freq > total_freq)
5611 entry_freq = total_freq;
5614 copy_bbs (region, n_region, region_copy, &exit, 1, &exit_copy, loop,
5615 split_edge_bb_loc (entry));
5618 scale_bbs_frequencies_gcov_type (region, n_region,
5619 total_count - entry_count,
5621 scale_bbs_frequencies_gcov_type (region_copy, n_region, entry_count,
5626 scale_bbs_frequencies_int (region, n_region, total_freq - entry_freq,
5628 scale_bbs_frequencies_int (region_copy, n_region, entry_freq, total_freq);
5633 loop->header = exit->dest;
5634 loop->latch = exit->src;
5637 /* Redirect the entry and add the phi node arguments. */
5638 redirected = redirect_edge_and_branch (entry, get_bb_copy (entry->dest));
5639 gcc_assert (redirected != NULL);
5640 flush_pending_stmts (entry);
5642 /* Concerning updating of dominators: We must recount dominators
5643 for entry block and its copy. Anything that is outside of the
5644 region, but was dominated by something inside needs recounting as
5646 set_immediate_dominator (CDI_DOMINATORS, entry->dest, entry->src);
5647 VEC_safe_push (basic_block, heap, doms, get_bb_original (entry->dest));
5648 iterate_fix_dominators (CDI_DOMINATORS, doms, false);
5649 VEC_free (basic_block, heap, doms);
5651 /* Add the other PHI node arguments. */
5652 add_phi_args_after_copy (region_copy, n_region, NULL);
5654 /* Update the SSA web. */
5655 update_ssa (TODO_update_ssa);
5657 if (free_region_copy)
5660 free_original_copy_tables ();
5664 /* Checks if BB is part of the region defined by N_REGION BBS. */
5666 bb_part_of_region_p (basic_block bb, basic_block* bbs, unsigned n_region)
5670 for (n = 0; n < n_region; n++)
5678 /* Duplicates REGION consisting of N_REGION blocks. The new blocks
5679 are stored to REGION_COPY in the same order in that they appear
5680 in REGION, if REGION_COPY is not NULL. ENTRY is the entry to
5681 the region, EXIT an exit from it. The condition guarding EXIT
5682 is moved to ENTRY. Returns true if duplication succeeds, false
5708 gimple_duplicate_sese_tail (edge entry ATTRIBUTE_UNUSED, edge exit ATTRIBUTE_UNUSED,
5709 basic_block *region ATTRIBUTE_UNUSED, unsigned n_region ATTRIBUTE_UNUSED,
5710 basic_block *region_copy ATTRIBUTE_UNUSED)
5713 bool free_region_copy = false;
5714 struct loop *loop = exit->dest->loop_father;
5715 struct loop *orig_loop = entry->dest->loop_father;
5716 basic_block switch_bb, entry_bb, nentry_bb;
5717 VEC (basic_block, heap) *doms;
5718 int total_freq = 0, exit_freq = 0;
5719 gcov_type total_count = 0, exit_count = 0;
5720 edge exits[2], nexits[2], e;
5721 gimple_stmt_iterator gsi;
5724 basic_block exit_bb;
5725 gimple_stmt_iterator psi;
5728 struct loop *target, *aloop, *cloop;
5730 gcc_assert (EDGE_COUNT (exit->src->succs) == 2);
5732 exits[1] = EDGE_SUCC (exit->src, EDGE_SUCC (exit->src, 0) == exit);
5734 if (!can_copy_bbs_p (region, n_region))
5737 initialize_original_copy_tables ();
5738 set_loop_copy (orig_loop, loop);
5741 for (aloop = orig_loop->inner; aloop; aloop = aloop->next)
5743 if (bb_part_of_region_p (aloop->header, region, n_region))
5745 cloop = duplicate_loop (aloop, target);
5746 duplicate_subloops (aloop, cloop);
5752 region_copy = XNEWVEC (basic_block, n_region);
5753 free_region_copy = true;
5756 gcc_assert (!need_ssa_update_p (cfun));
5758 /* Record blocks outside the region that are dominated by something
5760 doms = get_dominated_by_region (CDI_DOMINATORS, region, n_region);
5762 if (exit->src->count)
5764 total_count = exit->src->count;
5765 exit_count = exit->count;
5766 /* Fix up corner cases, to avoid division by zero or creation of negative
5768 if (exit_count > total_count)
5769 exit_count = total_count;
5773 total_freq = exit->src->frequency;
5774 exit_freq = EDGE_FREQUENCY (exit);
5775 /* Fix up corner cases, to avoid division by zero or creation of negative
5777 if (total_freq == 0)
5779 if (exit_freq > total_freq)
5780 exit_freq = total_freq;
5783 copy_bbs (region, n_region, region_copy, exits, 2, nexits, orig_loop,
5784 split_edge_bb_loc (exit));
5787 scale_bbs_frequencies_gcov_type (region, n_region,
5788 total_count - exit_count,
5790 scale_bbs_frequencies_gcov_type (region_copy, n_region, exit_count,
5795 scale_bbs_frequencies_int (region, n_region, total_freq - exit_freq,
5797 scale_bbs_frequencies_int (region_copy, n_region, exit_freq, total_freq);
5800 /* Create the switch block, and put the exit condition to it. */
5801 entry_bb = entry->dest;
5802 nentry_bb = get_bb_copy (entry_bb);
5803 if (!last_stmt (entry->src)
5804 || !stmt_ends_bb_p (last_stmt (entry->src)))
5805 switch_bb = entry->src;
5807 switch_bb = split_edge (entry);
5808 set_immediate_dominator (CDI_DOMINATORS, nentry_bb, switch_bb);
5810 gsi = gsi_last_bb (switch_bb);
5811 cond_stmt = last_stmt (exit->src);
5812 gcc_assert (gimple_code (cond_stmt) == GIMPLE_COND);
5813 cond_stmt = gimple_copy (cond_stmt);
5815 gsi_insert_after (&gsi, cond_stmt, GSI_NEW_STMT);
5817 sorig = single_succ_edge (switch_bb);
5818 sorig->flags = exits[1]->flags;
5819 snew = make_edge (switch_bb, nentry_bb, exits[0]->flags);
5821 /* Register the new edge from SWITCH_BB in loop exit lists. */
5822 rescan_loop_exit (snew, true, false);
5824 /* Add the PHI node arguments. */
5825 add_phi_args_after_copy (region_copy, n_region, snew);
5827 /* Get rid of now superfluous conditions and associated edges (and phi node
5829 exit_bb = exit->dest;
5831 e = redirect_edge_and_branch (exits[0], exits[1]->dest);
5832 PENDING_STMT (e) = NULL;
5834 /* The latch of ORIG_LOOP was copied, and so was the backedge
5835 to the original header. We redirect this backedge to EXIT_BB. */
5836 for (i = 0; i < n_region; i++)
5837 if (get_bb_original (region_copy[i]) == orig_loop->latch)
5839 gcc_assert (single_succ_edge (region_copy[i]));
5840 e = redirect_edge_and_branch (single_succ_edge (region_copy[i]), exit_bb);
5841 PENDING_STMT (e) = NULL;
5842 for (psi = gsi_start_phis (exit_bb);
5846 phi = gsi_stmt (psi);
5847 def = PHI_ARG_DEF (phi, nexits[0]->dest_idx);
5848 add_phi_arg (phi, def, e, gimple_phi_arg_location_from_edge (phi, e));
5851 e = redirect_edge_and_branch (nexits[1], nexits[0]->dest);
5852 PENDING_STMT (e) = NULL;
5854 /* Anything that is outside of the region, but was dominated by something
5855 inside needs to update dominance info. */
5856 iterate_fix_dominators (CDI_DOMINATORS, doms, false);
5857 VEC_free (basic_block, heap, doms);
5858 /* Update the SSA web. */
5859 update_ssa (TODO_update_ssa);
5861 if (free_region_copy)
5864 free_original_copy_tables ();
5868 /* Add all the blocks dominated by ENTRY to the array BBS_P. Stop
5869 adding blocks when the dominator traversal reaches EXIT. This
5870 function silently assumes that ENTRY strictly dominates EXIT. */
5873 gather_blocks_in_sese_region (basic_block entry, basic_block exit,
5874 VEC(basic_block,heap) **bbs_p)
5878 for (son = first_dom_son (CDI_DOMINATORS, entry);
5880 son = next_dom_son (CDI_DOMINATORS, son))
5882 VEC_safe_push (basic_block, heap, *bbs_p, son);
5884 gather_blocks_in_sese_region (son, exit, bbs_p);
5888 /* Replaces *TP with a duplicate (belonging to function TO_CONTEXT).
5889 The duplicates are recorded in VARS_MAP. */
5892 replace_by_duplicate_decl (tree *tp, struct pointer_map_t *vars_map,
5895 tree t = *tp, new_t;
5896 struct function *f = DECL_STRUCT_FUNCTION (to_context);
5899 if (DECL_CONTEXT (t) == to_context)
5902 loc = pointer_map_contains (vars_map, t);
5906 loc = pointer_map_insert (vars_map, t);
5910 new_t = copy_var_decl (t, DECL_NAME (t), TREE_TYPE (t));
5911 add_local_decl (f, new_t);
5915 gcc_assert (TREE_CODE (t) == CONST_DECL);
5916 new_t = copy_node (t);
5918 DECL_CONTEXT (new_t) = to_context;
5923 new_t = (tree) *loc;
5929 /* Creates an ssa name in TO_CONTEXT equivalent to NAME.
5930 VARS_MAP maps old ssa names and var_decls to the new ones. */
5933 replace_ssa_name (tree name, struct pointer_map_t *vars_map,
5937 tree new_name, decl = SSA_NAME_VAR (name);
5939 gcc_assert (is_gimple_reg (name));
5941 loc = pointer_map_contains (vars_map, name);
5945 replace_by_duplicate_decl (&decl, vars_map, to_context);
5947 push_cfun (DECL_STRUCT_FUNCTION (to_context));
5948 if (gimple_in_ssa_p (cfun))
5949 add_referenced_var (decl);
5951 new_name = make_ssa_name (decl, SSA_NAME_DEF_STMT (name));
5952 if (SSA_NAME_IS_DEFAULT_DEF (name))
5953 set_default_def (decl, new_name);
5956 loc = pointer_map_insert (vars_map, name);
5960 new_name = (tree) *loc;
5971 struct pointer_map_t *vars_map;
5972 htab_t new_label_map;
5973 struct pointer_map_t *eh_map;
5977 /* Helper for move_block_to_fn. Set TREE_BLOCK in every expression
5978 contained in *TP if it has been ORIG_BLOCK previously and change the
5979 DECL_CONTEXT of every local variable referenced in *TP. */
5982 move_stmt_op (tree *tp, int *walk_subtrees, void *data)
5984 struct walk_stmt_info *wi = (struct walk_stmt_info *) data;
5985 struct move_stmt_d *p = (struct move_stmt_d *) wi->info;
5989 /* We should never have TREE_BLOCK set on non-statements. */
5990 gcc_assert (!TREE_BLOCK (t));
5992 else if (DECL_P (t) || TREE_CODE (t) == SSA_NAME)
5994 if (TREE_CODE (t) == SSA_NAME)
5995 *tp = replace_ssa_name (t, p->vars_map, p->to_context);
5996 else if (TREE_CODE (t) == LABEL_DECL)
5998 if (p->new_label_map)
6000 struct tree_map in, *out;
6002 out = (struct tree_map *)
6003 htab_find_with_hash (p->new_label_map, &in, DECL_UID (t));
6008 DECL_CONTEXT (t) = p->to_context;
6010 else if (p->remap_decls_p)
6012 /* Replace T with its duplicate. T should no longer appear in the
6013 parent function, so this looks wasteful; however, it may appear
6014 in referenced_vars, and more importantly, as virtual operands of
6015 statements, and in alias lists of other variables. It would be
6016 quite difficult to expunge it from all those places. ??? It might
6017 suffice to do this for addressable variables. */
6018 if ((TREE_CODE (t) == VAR_DECL
6019 && !is_global_var (t))
6020 || TREE_CODE (t) == CONST_DECL)
6022 struct function *to_fn = DECL_STRUCT_FUNCTION (p->to_context);
6023 replace_by_duplicate_decl (tp, p->vars_map, p->to_context);
6024 if (gimple_referenced_vars (to_fn))
6025 add_referenced_var_1 (*tp, to_fn);
6030 else if (TYPE_P (t))
6036 /* Helper for move_stmt_r. Given an EH region number for the source
6037 function, map that to the duplicate EH regio number in the dest. */
6040 move_stmt_eh_region_nr (int old_nr, struct move_stmt_d *p)
6042 eh_region old_r, new_r;
6045 old_r = get_eh_region_from_number (old_nr);
6046 slot = pointer_map_contains (p->eh_map, old_r);
6047 new_r = (eh_region) *slot;
6049 return new_r->index;
6052 /* Similar, but operate on INTEGER_CSTs. */
6055 move_stmt_eh_region_tree_nr (tree old_t_nr, struct move_stmt_d *p)
6059 old_nr = tree_low_cst (old_t_nr, 0);
6060 new_nr = move_stmt_eh_region_nr (old_nr, p);
6062 return build_int_cst (integer_type_node, new_nr);
6065 /* Like move_stmt_op, but for gimple statements.
6067 Helper for move_block_to_fn. Set GIMPLE_BLOCK in every expression
6068 contained in the current statement in *GSI_P and change the
6069 DECL_CONTEXT of every local variable referenced in the current
6073 move_stmt_r (gimple_stmt_iterator *gsi_p, bool *handled_ops_p,
6074 struct walk_stmt_info *wi)
6076 struct move_stmt_d *p = (struct move_stmt_d *) wi->info;
6077 gimple stmt = gsi_stmt (*gsi_p);
6078 tree block = gimple_block (stmt);
6080 if (p->orig_block == NULL_TREE
6081 || block == p->orig_block
6082 || block == NULL_TREE)
6083 gimple_set_block (stmt, p->new_block);
6084 #ifdef ENABLE_CHECKING
6085 else if (block != p->new_block)
6087 while (block && block != p->orig_block)
6088 block = BLOCK_SUPERCONTEXT (block);
6093 switch (gimple_code (stmt))
6096 /* Remap the region numbers for __builtin_eh_{pointer,filter}. */
6098 tree r, fndecl = gimple_call_fndecl (stmt);
6099 if (fndecl && DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_NORMAL)
6100 switch (DECL_FUNCTION_CODE (fndecl))
6102 case BUILT_IN_EH_COPY_VALUES:
6103 r = gimple_call_arg (stmt, 1);
6104 r = move_stmt_eh_region_tree_nr (r, p);
6105 gimple_call_set_arg (stmt, 1, r);
6108 case BUILT_IN_EH_POINTER:
6109 case BUILT_IN_EH_FILTER:
6110 r = gimple_call_arg (stmt, 0);
6111 r = move_stmt_eh_region_tree_nr (r, p);
6112 gimple_call_set_arg (stmt, 0, r);
6123 int r = gimple_resx_region (stmt);
6124 r = move_stmt_eh_region_nr (r, p);
6125 gimple_resx_set_region (stmt, r);
6129 case GIMPLE_EH_DISPATCH:
6131 int r = gimple_eh_dispatch_region (stmt);
6132 r = move_stmt_eh_region_nr (r, p);
6133 gimple_eh_dispatch_set_region (stmt, r);
6137 case GIMPLE_OMP_RETURN:
6138 case GIMPLE_OMP_CONTINUE:
6141 if (is_gimple_omp (stmt))
6143 /* Do not remap variables inside OMP directives. Variables
6144 referenced in clauses and directive header belong to the
6145 parent function and should not be moved into the child
6147 bool save_remap_decls_p = p->remap_decls_p;
6148 p->remap_decls_p = false;
6149 *handled_ops_p = true;
6151 walk_gimple_seq_mod (gimple_omp_body_ptr (stmt), move_stmt_r,
6154 p->remap_decls_p = save_remap_decls_p;
6162 /* Move basic block BB from function CFUN to function DEST_FN. The
6163 block is moved out of the original linked list and placed after
6164 block AFTER in the new list. Also, the block is removed from the
6165 original array of blocks and placed in DEST_FN's array of blocks.
6166 If UPDATE_EDGE_COUNT_P is true, the edge counts on both CFGs is
6167 updated to reflect the moved edges.
6169 The local variables are remapped to new instances, VARS_MAP is used
6170 to record the mapping. */
6173 move_block_to_fn (struct function *dest_cfun, basic_block bb,
6174 basic_block after, bool update_edge_count_p,
6175 struct move_stmt_d *d)
6177 struct control_flow_graph *cfg;
6180 gimple_stmt_iterator si;
6181 unsigned old_len, new_len;
6183 /* Remove BB from dominance structures. */
6184 delete_from_dominance_info (CDI_DOMINATORS, bb);
6186 remove_bb_from_loops (bb);
6188 /* Link BB to the new linked list. */
6189 move_block_after (bb, after);
6191 /* Update the edge count in the corresponding flowgraphs. */
6192 if (update_edge_count_p)
6193 FOR_EACH_EDGE (e, ei, bb->succs)
6195 cfun->cfg->x_n_edges--;
6196 dest_cfun->cfg->x_n_edges++;
6199 /* Remove BB from the original basic block array. */
6200 VEC_replace (basic_block, cfun->cfg->x_basic_block_info, bb->index, NULL);
6201 cfun->cfg->x_n_basic_blocks--;
6203 /* Grow DEST_CFUN's basic block array if needed. */
6204 cfg = dest_cfun->cfg;
6205 cfg->x_n_basic_blocks++;
6206 if (bb->index >= cfg->x_last_basic_block)
6207 cfg->x_last_basic_block = bb->index + 1;
6209 old_len = VEC_length (basic_block, cfg->x_basic_block_info);
6210 if ((unsigned) cfg->x_last_basic_block >= old_len)
6212 new_len = cfg->x_last_basic_block + (cfg->x_last_basic_block + 3) / 4;
6213 VEC_safe_grow_cleared (basic_block, gc, cfg->x_basic_block_info,
6217 VEC_replace (basic_block, cfg->x_basic_block_info,
6220 /* Remap the variables in phi nodes. */
6221 for (si = gsi_start_phis (bb); !gsi_end_p (si); )
6223 gimple phi = gsi_stmt (si);
6225 tree op = PHI_RESULT (phi);
6228 if (!is_gimple_reg (op))
6230 /* Remove the phi nodes for virtual operands (alias analysis will be
6231 run for the new function, anyway). */
6232 remove_phi_node (&si, true);
6236 SET_PHI_RESULT (phi,
6237 replace_ssa_name (op, d->vars_map, dest_cfun->decl));
6238 FOR_EACH_PHI_ARG (use, phi, oi, SSA_OP_USE)
6240 op = USE_FROM_PTR (use);
6241 if (TREE_CODE (op) == SSA_NAME)
6242 SET_USE (use, replace_ssa_name (op, d->vars_map, dest_cfun->decl));
6248 for (si = gsi_start_bb (bb); !gsi_end_p (si); gsi_next (&si))
6250 gimple stmt = gsi_stmt (si);
6251 struct walk_stmt_info wi;
6253 memset (&wi, 0, sizeof (wi));
6255 walk_gimple_stmt (&si, move_stmt_r, move_stmt_op, &wi);
6257 if (gimple_code (stmt) == GIMPLE_LABEL)
6259 tree label = gimple_label_label (stmt);
6260 int uid = LABEL_DECL_UID (label);
6262 gcc_assert (uid > -1);
6264 old_len = VEC_length (basic_block, cfg->x_label_to_block_map);
6265 if (old_len <= (unsigned) uid)
6267 new_len = 3 * uid / 2 + 1;
6268 VEC_safe_grow_cleared (basic_block, gc,
6269 cfg->x_label_to_block_map, new_len);
6272 VEC_replace (basic_block, cfg->x_label_to_block_map, uid, bb);
6273 VEC_replace (basic_block, cfun->cfg->x_label_to_block_map, uid, NULL);
6275 gcc_assert (DECL_CONTEXT (label) == dest_cfun->decl);
6277 if (uid >= dest_cfun->cfg->last_label_uid)
6278 dest_cfun->cfg->last_label_uid = uid + 1;
6281 maybe_duplicate_eh_stmt_fn (dest_cfun, stmt, cfun, stmt, d->eh_map, 0);
6282 remove_stmt_from_eh_lp_fn (cfun, stmt);
6284 gimple_duplicate_stmt_histograms (dest_cfun, stmt, cfun, stmt);
6285 gimple_remove_stmt_histograms (cfun, stmt);
6287 /* We cannot leave any operands allocated from the operand caches of
6288 the current function. */
6289 free_stmt_operands (stmt);
6290 push_cfun (dest_cfun);
6295 FOR_EACH_EDGE (e, ei, bb->succs)
6298 tree block = e->goto_block;
6299 if (d->orig_block == NULL_TREE
6300 || block == d->orig_block)
6301 e->goto_block = d->new_block;
6302 #ifdef ENABLE_CHECKING
6303 else if (block != d->new_block)
6305 while (block && block != d->orig_block)
6306 block = BLOCK_SUPERCONTEXT (block);
6313 /* Examine the statements in BB (which is in SRC_CFUN); find and return
6314 the outermost EH region. Use REGION as the incoming base EH region. */
6317 find_outermost_region_in_block (struct function *src_cfun,
6318 basic_block bb, eh_region region)
6320 gimple_stmt_iterator si;
6322 for (si = gsi_start_bb (bb); !gsi_end_p (si); gsi_next (&si))
6324 gimple stmt = gsi_stmt (si);
6325 eh_region stmt_region;
6328 lp_nr = lookup_stmt_eh_lp_fn (src_cfun, stmt);
6329 stmt_region = get_eh_region_from_lp_number_fn (src_cfun, lp_nr);
6333 region = stmt_region;
6334 else if (stmt_region != region)
6336 region = eh_region_outermost (src_cfun, stmt_region, region);
6337 gcc_assert (region != NULL);
6346 new_label_mapper (tree decl, void *data)
6348 htab_t hash = (htab_t) data;
6352 gcc_assert (TREE_CODE (decl) == LABEL_DECL);
6354 m = XNEW (struct tree_map);
6355 m->hash = DECL_UID (decl);
6356 m->base.from = decl;
6357 m->to = create_artificial_label (UNKNOWN_LOCATION);
6358 LABEL_DECL_UID (m->to) = LABEL_DECL_UID (decl);
6359 if (LABEL_DECL_UID (m->to) >= cfun->cfg->last_label_uid)
6360 cfun->cfg->last_label_uid = LABEL_DECL_UID (m->to) + 1;
6362 slot = htab_find_slot_with_hash (hash, m, m->hash, INSERT);
6363 gcc_assert (*slot == NULL);
6370 /* Change DECL_CONTEXT of all BLOCK_VARS in block, including
6374 replace_block_vars_by_duplicates (tree block, struct pointer_map_t *vars_map,
6379 for (tp = &BLOCK_VARS (block); *tp; tp = &DECL_CHAIN (*tp))
6382 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != CONST_DECL)
6384 replace_by_duplicate_decl (&t, vars_map, to_context);
6387 if (TREE_CODE (*tp) == VAR_DECL && DECL_HAS_VALUE_EXPR_P (*tp))
6389 SET_DECL_VALUE_EXPR (t, DECL_VALUE_EXPR (*tp));
6390 DECL_HAS_VALUE_EXPR_P (t) = 1;
6392 DECL_CHAIN (t) = DECL_CHAIN (*tp);
6397 for (block = BLOCK_SUBBLOCKS (block); block; block = BLOCK_CHAIN (block))
6398 replace_block_vars_by_duplicates (block, vars_map, to_context);
6401 /* Move a single-entry, single-exit region delimited by ENTRY_BB and
6402 EXIT_BB to function DEST_CFUN. The whole region is replaced by a
6403 single basic block in the original CFG and the new basic block is
6404 returned. DEST_CFUN must not have a CFG yet.
6406 Note that the region need not be a pure SESE region. Blocks inside
6407 the region may contain calls to abort/exit. The only restriction
6408 is that ENTRY_BB should be the only entry point and it must
6411 Change TREE_BLOCK of all statements in ORIG_BLOCK to the new
6412 functions outermost BLOCK, move all subblocks of ORIG_BLOCK
6413 to the new function.
6415 All local variables referenced in the region are assumed to be in
6416 the corresponding BLOCK_VARS and unexpanded variable lists
6417 associated with DEST_CFUN. */
6420 move_sese_region_to_fn (struct function *dest_cfun, basic_block entry_bb,
6421 basic_block exit_bb, tree orig_block)
6423 VEC(basic_block,heap) *bbs, *dom_bbs;
6424 basic_block dom_entry = get_immediate_dominator (CDI_DOMINATORS, entry_bb);
6425 basic_block after, bb, *entry_pred, *exit_succ, abb;
6426 struct function *saved_cfun = cfun;
6427 int *entry_flag, *exit_flag;
6428 unsigned *entry_prob, *exit_prob;
6429 unsigned i, num_entry_edges, num_exit_edges;
6432 htab_t new_label_map;
6433 struct pointer_map_t *vars_map, *eh_map;
6434 struct loop *loop = entry_bb->loop_father;
6435 struct move_stmt_d d;
6437 /* If ENTRY does not strictly dominate EXIT, this cannot be an SESE
6439 gcc_assert (entry_bb != exit_bb
6441 || dominated_by_p (CDI_DOMINATORS, exit_bb, entry_bb)));
6443 /* Collect all the blocks in the region. Manually add ENTRY_BB
6444 because it won't be added by dfs_enumerate_from. */
6446 VEC_safe_push (basic_block, heap, bbs, entry_bb);
6447 gather_blocks_in_sese_region (entry_bb, exit_bb, &bbs);
6449 /* The blocks that used to be dominated by something in BBS will now be
6450 dominated by the new block. */
6451 dom_bbs = get_dominated_by_region (CDI_DOMINATORS,
6452 VEC_address (basic_block, bbs),
6453 VEC_length (basic_block, bbs));
6455 /* Detach ENTRY_BB and EXIT_BB from CFUN->CFG. We need to remember
6456 the predecessor edges to ENTRY_BB and the successor edges to
6457 EXIT_BB so that we can re-attach them to the new basic block that
6458 will replace the region. */
6459 num_entry_edges = EDGE_COUNT (entry_bb->preds);
6460 entry_pred = (basic_block *) xcalloc (num_entry_edges, sizeof (basic_block));
6461 entry_flag = (int *) xcalloc (num_entry_edges, sizeof (int));
6462 entry_prob = XNEWVEC (unsigned, num_entry_edges);
6464 for (ei = ei_start (entry_bb->preds); (e = ei_safe_edge (ei)) != NULL;)
6466 entry_prob[i] = e->probability;
6467 entry_flag[i] = e->flags;
6468 entry_pred[i++] = e->src;
6474 num_exit_edges = EDGE_COUNT (exit_bb->succs);
6475 exit_succ = (basic_block *) xcalloc (num_exit_edges,
6476 sizeof (basic_block));
6477 exit_flag = (int *) xcalloc (num_exit_edges, sizeof (int));
6478 exit_prob = XNEWVEC (unsigned, num_exit_edges);
6480 for (ei = ei_start (exit_bb->succs); (e = ei_safe_edge (ei)) != NULL;)
6482 exit_prob[i] = e->probability;
6483 exit_flag[i] = e->flags;
6484 exit_succ[i++] = e->dest;
6496 /* Switch context to the child function to initialize DEST_FN's CFG. */
6497 gcc_assert (dest_cfun->cfg == NULL);
6498 push_cfun (dest_cfun);
6500 init_empty_tree_cfg ();
6502 /* Initialize EH information for the new function. */
6504 new_label_map = NULL;
6507 eh_region region = NULL;
6509 FOR_EACH_VEC_ELT (basic_block, bbs, i, bb)
6510 region = find_outermost_region_in_block (saved_cfun, bb, region);
6512 init_eh_for_function ();
6515 new_label_map = htab_create (17, tree_map_hash, tree_map_eq, free);
6516 eh_map = duplicate_eh_regions (saved_cfun, region, 0,
6517 new_label_mapper, new_label_map);
6523 /* Move blocks from BBS into DEST_CFUN. */
6524 gcc_assert (VEC_length (basic_block, bbs) >= 2);
6525 after = dest_cfun->cfg->x_entry_block_ptr;
6526 vars_map = pointer_map_create ();
6528 memset (&d, 0, sizeof (d));
6529 d.orig_block = orig_block;
6530 d.new_block = DECL_INITIAL (dest_cfun->decl);
6531 d.from_context = cfun->decl;
6532 d.to_context = dest_cfun->decl;
6533 d.vars_map = vars_map;
6534 d.new_label_map = new_label_map;
6536 d.remap_decls_p = true;
6538 FOR_EACH_VEC_ELT (basic_block, bbs, i, bb)
6540 /* No need to update edge counts on the last block. It has
6541 already been updated earlier when we detached the region from
6542 the original CFG. */
6543 move_block_to_fn (dest_cfun, bb, after, bb != exit_bb, &d);
6547 /* Rewire BLOCK_SUBBLOCKS of orig_block. */
6551 gcc_assert (BLOCK_SUBBLOCKS (DECL_INITIAL (dest_cfun->decl))
6553 BLOCK_SUBBLOCKS (DECL_INITIAL (dest_cfun->decl))
6554 = BLOCK_SUBBLOCKS (orig_block);
6555 for (block = BLOCK_SUBBLOCKS (orig_block);
6556 block; block = BLOCK_CHAIN (block))
6557 BLOCK_SUPERCONTEXT (block) = DECL_INITIAL (dest_cfun->decl);
6558 BLOCK_SUBBLOCKS (orig_block) = NULL_TREE;
6561 replace_block_vars_by_duplicates (DECL_INITIAL (dest_cfun->decl),
6562 vars_map, dest_cfun->decl);
6565 htab_delete (new_label_map);
6567 pointer_map_destroy (eh_map);
6568 pointer_map_destroy (vars_map);
6570 /* Rewire the entry and exit blocks. The successor to the entry
6571 block turns into the successor of DEST_FN's ENTRY_BLOCK_PTR in
6572 the child function. Similarly, the predecessor of DEST_FN's
6573 EXIT_BLOCK_PTR turns into the predecessor of EXIT_BLOCK_PTR. We
6574 need to switch CFUN between DEST_CFUN and SAVED_CFUN so that the
6575 various CFG manipulation function get to the right CFG.
6577 FIXME, this is silly. The CFG ought to become a parameter to
6579 push_cfun (dest_cfun);
6580 make_edge (ENTRY_BLOCK_PTR, entry_bb, EDGE_FALLTHRU);
6582 make_edge (exit_bb, EXIT_BLOCK_PTR, 0);
6585 /* Back in the original function, the SESE region has disappeared,
6586 create a new basic block in its place. */
6587 bb = create_empty_bb (entry_pred[0]);
6589 add_bb_to_loop (bb, loop);
6590 for (i = 0; i < num_entry_edges; i++)
6592 e = make_edge (entry_pred[i], bb, entry_flag[i]);
6593 e->probability = entry_prob[i];
6596 for (i = 0; i < num_exit_edges; i++)
6598 e = make_edge (bb, exit_succ[i], exit_flag[i]);
6599 e->probability = exit_prob[i];
6602 set_immediate_dominator (CDI_DOMINATORS, bb, dom_entry);
6603 FOR_EACH_VEC_ELT (basic_block, dom_bbs, i, abb)
6604 set_immediate_dominator (CDI_DOMINATORS, abb, bb);
6605 VEC_free (basic_block, heap, dom_bbs);
6616 VEC_free (basic_block, heap, bbs);
6622 /* Dump FUNCTION_DECL FN to file FILE using FLAGS (see TDF_* in tree-pass.h)
6626 dump_function_to_file (tree fn, FILE *file, int flags)
6629 struct function *dsf;
6630 bool ignore_topmost_bind = false, any_var = false;
6633 bool tmclone = TREE_CODE (fn) == FUNCTION_DECL && decl_is_tm_clone (fn);
6635 fprintf (file, "%s %s(", current_function_name (),
6636 tmclone ? "[tm-clone] " : "");
6638 arg = DECL_ARGUMENTS (fn);
6641 print_generic_expr (file, TREE_TYPE (arg), dump_flags);
6642 fprintf (file, " ");
6643 print_generic_expr (file, arg, dump_flags);
6644 if (flags & TDF_VERBOSE)
6645 print_node (file, "", arg, 4);
6646 if (DECL_CHAIN (arg))
6647 fprintf (file, ", ");
6648 arg = DECL_CHAIN (arg);
6650 fprintf (file, ")\n");
6652 if (flags & TDF_VERBOSE)
6653 print_node (file, "", fn, 2);
6655 dsf = DECL_STRUCT_FUNCTION (fn);
6656 if (dsf && (flags & TDF_EH))
6657 dump_eh_tree (file, dsf);
6659 if (flags & TDF_RAW && !gimple_has_body_p (fn))
6661 dump_node (fn, TDF_SLIM | flags, file);
6665 /* Switch CFUN to point to FN. */
6666 push_cfun (DECL_STRUCT_FUNCTION (fn));
6668 /* When GIMPLE is lowered, the variables are no longer available in
6669 BIND_EXPRs, so display them separately. */
6670 if (cfun && cfun->decl == fn && !VEC_empty (tree, cfun->local_decls))
6673 ignore_topmost_bind = true;
6675 fprintf (file, "{\n");
6676 FOR_EACH_LOCAL_DECL (cfun, ix, var)
6678 print_generic_decl (file, var, flags);
6679 if (flags & TDF_VERBOSE)
6680 print_node (file, "", var, 4);
6681 fprintf (file, "\n");
6687 if (cfun && cfun->decl == fn && cfun->cfg && basic_block_info)
6689 /* If the CFG has been built, emit a CFG-based dump. */
6690 if (!ignore_topmost_bind)
6691 fprintf (file, "{\n");
6693 if (any_var && n_basic_blocks)
6694 fprintf (file, "\n");
6697 dump_bb (file, bb, 2, flags | TDF_COMMENT);
6699 fprintf (file, "}\n");
6701 else if (DECL_SAVED_TREE (fn) == NULL)
6703 /* The function is now in GIMPLE form but the CFG has not been
6704 built yet. Emit the single sequence of GIMPLE statements
6705 that make up its body. */
6706 gimple_seq body = gimple_body (fn);
6708 if (gimple_seq_first_stmt (body)
6709 && gimple_seq_first_stmt (body) == gimple_seq_last_stmt (body)
6710 && gimple_code (gimple_seq_first_stmt (body)) == GIMPLE_BIND)
6711 print_gimple_seq (file, body, 0, flags);
6714 if (!ignore_topmost_bind)
6715 fprintf (file, "{\n");
6718 fprintf (file, "\n");
6720 print_gimple_seq (file, body, 2, flags);
6721 fprintf (file, "}\n");
6728 /* Make a tree based dump. */
6729 chain = DECL_SAVED_TREE (fn);
6731 if (chain && TREE_CODE (chain) == BIND_EXPR)
6733 if (ignore_topmost_bind)
6735 chain = BIND_EXPR_BODY (chain);
6743 if (!ignore_topmost_bind)
6744 fprintf (file, "{\n");
6749 fprintf (file, "\n");
6751 print_generic_stmt_indented (file, chain, flags, indent);
6752 if (ignore_topmost_bind)
6753 fprintf (file, "}\n");
6756 if (flags & TDF_ENUMERATE_LOCALS)
6757 dump_enumerated_decls (file, flags);
6758 fprintf (file, "\n\n");
6765 /* Dump FUNCTION_DECL FN to stderr using FLAGS (see TDF_* in tree.h) */
6768 debug_function (tree fn, int flags)
6770 dump_function_to_file (fn, stderr, flags);
6774 /* Print on FILE the indexes for the predecessors of basic_block BB. */
6777 print_pred_bbs (FILE *file, basic_block bb)
6782 FOR_EACH_EDGE (e, ei, bb->preds)
6783 fprintf (file, "bb_%d ", e->src->index);
6787 /* Print on FILE the indexes for the successors of basic_block BB. */
6790 print_succ_bbs (FILE *file, basic_block bb)
6795 FOR_EACH_EDGE (e, ei, bb->succs)
6796 fprintf (file, "bb_%d ", e->dest->index);
6799 /* Print to FILE the basic block BB following the VERBOSITY level. */
6802 print_loops_bb (FILE *file, basic_block bb, int indent, int verbosity)
6804 char *s_indent = (char *) alloca ((size_t) indent + 1);
6805 memset ((void *) s_indent, ' ', (size_t) indent);
6806 s_indent[indent] = '\0';
6808 /* Print basic_block's header. */
6811 fprintf (file, "%s bb_%d (preds = {", s_indent, bb->index);
6812 print_pred_bbs (file, bb);
6813 fprintf (file, "}, succs = {");
6814 print_succ_bbs (file, bb);
6815 fprintf (file, "})\n");
6818 /* Print basic_block's body. */
6821 fprintf (file, "%s {\n", s_indent);
6822 dump_bb (file, bb, indent + 4, TDF_VOPS|TDF_MEMSYMS);
6823 fprintf (file, "%s }\n", s_indent);
6827 static void print_loop_and_siblings (FILE *, struct loop *, int, int);
6829 /* Pretty print LOOP on FILE, indented INDENT spaces. Following
6830 VERBOSITY level this outputs the contents of the loop, or just its
6834 print_loop (FILE *file, struct loop *loop, int indent, int verbosity)
6842 s_indent = (char *) alloca ((size_t) indent + 1);
6843 memset ((void *) s_indent, ' ', (size_t) indent);
6844 s_indent[indent] = '\0';
6846 /* Print loop's header. */
6847 fprintf (file, "%sloop_%d (header = %d, latch = %d", s_indent,
6848 loop->num, loop->header->index, loop->latch->index);
6849 fprintf (file, ", niter = ");
6850 print_generic_expr (file, loop->nb_iterations, 0);
6852 if (loop->any_upper_bound)
6854 fprintf (file, ", upper_bound = ");
6855 dump_double_int (file, loop->nb_iterations_upper_bound, true);
6858 if (loop->any_estimate)
6860 fprintf (file, ", estimate = ");
6861 dump_double_int (file, loop->nb_iterations_estimate, true);
6863 fprintf (file, ")\n");
6865 /* Print loop's body. */
6868 fprintf (file, "%s{\n", s_indent);
6870 if (bb->loop_father == loop)
6871 print_loops_bb (file, bb, indent, verbosity);
6873 print_loop_and_siblings (file, loop->inner, indent + 2, verbosity);
6874 fprintf (file, "%s}\n", s_indent);
6878 /* Print the LOOP and its sibling loops on FILE, indented INDENT
6879 spaces. Following VERBOSITY level this outputs the contents of the
6880 loop, or just its structure. */
6883 print_loop_and_siblings (FILE *file, struct loop *loop, int indent, int verbosity)
6888 print_loop (file, loop, indent, verbosity);
6889 print_loop_and_siblings (file, loop->next, indent, verbosity);
6892 /* Follow a CFG edge from the entry point of the program, and on entry
6893 of a loop, pretty print the loop structure on FILE. */
6896 print_loops (FILE *file, int verbosity)
6900 bb = ENTRY_BLOCK_PTR;
6901 if (bb && bb->loop_father)
6902 print_loop_and_siblings (file, bb->loop_father, 0, verbosity);
6906 /* Debugging loops structure at tree level, at some VERBOSITY level. */
6909 debug_loops (int verbosity)
6911 print_loops (stderr, verbosity);
6914 /* Print on stderr the code of LOOP, at some VERBOSITY level. */
6917 debug_loop (struct loop *loop, int verbosity)
6919 print_loop (stderr, loop, 0, verbosity);
6922 /* Print on stderr the code of loop number NUM, at some VERBOSITY
6926 debug_loop_num (unsigned num, int verbosity)
6928 debug_loop (get_loop (num), verbosity);
6931 /* Return true if BB ends with a call, possibly followed by some
6932 instructions that must stay with the call. Return false,
6936 gimple_block_ends_with_call_p (basic_block bb)
6938 gimple_stmt_iterator gsi = gsi_last_nondebug_bb (bb);
6939 return !gsi_end_p (gsi) && is_gimple_call (gsi_stmt (gsi));
6943 /* Return true if BB ends with a conditional branch. Return false,
6947 gimple_block_ends_with_condjump_p (const_basic_block bb)
6949 gimple stmt = last_stmt (CONST_CAST_BB (bb));
6950 return (stmt && gimple_code (stmt) == GIMPLE_COND);
6954 /* Return true if we need to add fake edge to exit at statement T.
6955 Helper function for gimple_flow_call_edges_add. */
6958 need_fake_edge_p (gimple t)
6960 tree fndecl = NULL_TREE;
6963 /* NORETURN and LONGJMP calls already have an edge to exit.
6964 CONST and PURE calls do not need one.
6965 We don't currently check for CONST and PURE here, although
6966 it would be a good idea, because those attributes are
6967 figured out from the RTL in mark_constant_function, and
6968 the counter incrementation code from -fprofile-arcs
6969 leads to different results from -fbranch-probabilities. */
6970 if (is_gimple_call (t))
6972 fndecl = gimple_call_fndecl (t);
6973 call_flags = gimple_call_flags (t);
6976 if (is_gimple_call (t)
6978 && DECL_BUILT_IN (fndecl)
6979 && (call_flags & ECF_NOTHROW)
6980 && !(call_flags & ECF_RETURNS_TWICE)
6981 /* fork() doesn't really return twice, but the effect of
6982 wrapping it in __gcov_fork() which calls __gcov_flush()
6983 and clears the counters before forking has the same
6984 effect as returning twice. Force a fake edge. */
6985 && !(DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_NORMAL
6986 && DECL_FUNCTION_CODE (fndecl) == BUILT_IN_FORK))
6989 if (is_gimple_call (t))
6995 if (!(call_flags & ECF_NORETURN))
6999 FOR_EACH_EDGE (e, ei, bb->succs)
7000 if ((e->flags & EDGE_FAKE) == 0)
7004 if (gimple_code (t) == GIMPLE_ASM
7005 && (gimple_asm_volatile_p (t) || gimple_asm_input_p (t)))
7012 /* Add fake edges to the function exit for any non constant and non
7013 noreturn calls (or noreturn calls with EH/abnormal edges),
7014 volatile inline assembly in the bitmap of blocks specified by BLOCKS
7015 or to the whole CFG if BLOCKS is zero. Return the number of blocks
7018 The goal is to expose cases in which entering a basic block does
7019 not imply that all subsequent instructions must be executed. */
7022 gimple_flow_call_edges_add (sbitmap blocks)
7025 int blocks_split = 0;
7026 int last_bb = last_basic_block;
7027 bool check_last_block = false;
7029 if (n_basic_blocks == NUM_FIXED_BLOCKS)
7033 check_last_block = true;
7035 check_last_block = TEST_BIT (blocks, EXIT_BLOCK_PTR->prev_bb->index);
7037 /* In the last basic block, before epilogue generation, there will be
7038 a fallthru edge to EXIT. Special care is required if the last insn
7039 of the last basic block is a call because make_edge folds duplicate
7040 edges, which would result in the fallthru edge also being marked
7041 fake, which would result in the fallthru edge being removed by
7042 remove_fake_edges, which would result in an invalid CFG.
7044 Moreover, we can't elide the outgoing fake edge, since the block
7045 profiler needs to take this into account in order to solve the minimal
7046 spanning tree in the case that the call doesn't return.
7048 Handle this by adding a dummy instruction in a new last basic block. */
7049 if (check_last_block)
7051 basic_block bb = EXIT_BLOCK_PTR->prev_bb;
7052 gimple_stmt_iterator gsi = gsi_last_nondebug_bb (bb);
7055 if (!gsi_end_p (gsi))
7058 if (t && need_fake_edge_p (t))
7062 e = find_edge (bb, EXIT_BLOCK_PTR);
7065 gsi_insert_on_edge (e, gimple_build_nop ());
7066 gsi_commit_edge_inserts ();
7071 /* Now add fake edges to the function exit for any non constant
7072 calls since there is no way that we can determine if they will
7074 for (i = 0; i < last_bb; i++)
7076 basic_block bb = BASIC_BLOCK (i);
7077 gimple_stmt_iterator gsi;
7078 gimple stmt, last_stmt;
7083 if (blocks && !TEST_BIT (blocks, i))
7086 gsi = gsi_last_nondebug_bb (bb);
7087 if (!gsi_end_p (gsi))
7089 last_stmt = gsi_stmt (gsi);
7092 stmt = gsi_stmt (gsi);
7093 if (need_fake_edge_p (stmt))
7097 /* The handling above of the final block before the
7098 epilogue should be enough to verify that there is
7099 no edge to the exit block in CFG already.
7100 Calling make_edge in such case would cause us to
7101 mark that edge as fake and remove it later. */
7102 #ifdef ENABLE_CHECKING
7103 if (stmt == last_stmt)
7105 e = find_edge (bb, EXIT_BLOCK_PTR);
7106 gcc_assert (e == NULL);
7110 /* Note that the following may create a new basic block
7111 and renumber the existing basic blocks. */
7112 if (stmt != last_stmt)
7114 e = split_block (bb, stmt);
7118 make_edge (bb, EXIT_BLOCK_PTR, EDGE_FAKE);
7122 while (!gsi_end_p (gsi));
7127 verify_flow_info ();
7129 return blocks_split;
7132 /* Removes edge E and all the blocks dominated by it, and updates dominance
7133 information. The IL in E->src needs to be updated separately.
7134 If dominance info is not available, only the edge E is removed.*/
7137 remove_edge_and_dominated_blocks (edge e)
7139 VEC (basic_block, heap) *bbs_to_remove = NULL;
7140 VEC (basic_block, heap) *bbs_to_fix_dom = NULL;
7144 bool none_removed = false;
7146 basic_block bb, dbb;
7149 if (!dom_info_available_p (CDI_DOMINATORS))
7155 /* No updating is needed for edges to exit. */
7156 if (e->dest == EXIT_BLOCK_PTR)
7158 if (cfgcleanup_altered_bbs)
7159 bitmap_set_bit (cfgcleanup_altered_bbs, e->src->index);
7164 /* First, we find the basic blocks to remove. If E->dest has a predecessor
7165 that is not dominated by E->dest, then this set is empty. Otherwise,
7166 all the basic blocks dominated by E->dest are removed.
7168 Also, to DF_IDOM we store the immediate dominators of the blocks in
7169 the dominance frontier of E (i.e., of the successors of the
7170 removed blocks, if there are any, and of E->dest otherwise). */
7171 FOR_EACH_EDGE (f, ei, e->dest->preds)
7176 if (!dominated_by_p (CDI_DOMINATORS, f->src, e->dest))
7178 none_removed = true;
7183 df = BITMAP_ALLOC (NULL);
7184 df_idom = BITMAP_ALLOC (NULL);
7187 bitmap_set_bit (df_idom,
7188 get_immediate_dominator (CDI_DOMINATORS, e->dest)->index);
7191 bbs_to_remove = get_all_dominated_blocks (CDI_DOMINATORS, e->dest);
7192 FOR_EACH_VEC_ELT (basic_block, bbs_to_remove, i, bb)
7194 FOR_EACH_EDGE (f, ei, bb->succs)
7196 if (f->dest != EXIT_BLOCK_PTR)
7197 bitmap_set_bit (df, f->dest->index);
7200 FOR_EACH_VEC_ELT (basic_block, bbs_to_remove, i, bb)
7201 bitmap_clear_bit (df, bb->index);
7203 EXECUTE_IF_SET_IN_BITMAP (df, 0, i, bi)
7205 bb = BASIC_BLOCK (i);
7206 bitmap_set_bit (df_idom,
7207 get_immediate_dominator (CDI_DOMINATORS, bb)->index);
7211 if (cfgcleanup_altered_bbs)
7213 /* Record the set of the altered basic blocks. */
7214 bitmap_set_bit (cfgcleanup_altered_bbs, e->src->index);
7215 bitmap_ior_into (cfgcleanup_altered_bbs, df);
7218 /* Remove E and the cancelled blocks. */
7223 /* Walk backwards so as to get a chance to substitute all
7224 released DEFs into debug stmts. See
7225 eliminate_unnecessary_stmts() in tree-ssa-dce.c for more
7227 for (i = VEC_length (basic_block, bbs_to_remove); i-- > 0; )
7228 delete_basic_block (VEC_index (basic_block, bbs_to_remove, i));
7231 /* Update the dominance information. The immediate dominator may change only
7232 for blocks whose immediate dominator belongs to DF_IDOM:
7234 Suppose that idom(X) = Y before removal of E and idom(X) != Y after the
7235 removal. Let Z the arbitrary block such that idom(Z) = Y and
7236 Z dominates X after the removal. Before removal, there exists a path P
7237 from Y to X that avoids Z. Let F be the last edge on P that is
7238 removed, and let W = F->dest. Before removal, idom(W) = Y (since Y
7239 dominates W, and because of P, Z does not dominate W), and W belongs to
7240 the dominance frontier of E. Therefore, Y belongs to DF_IDOM. */
7241 EXECUTE_IF_SET_IN_BITMAP (df_idom, 0, i, bi)
7243 bb = BASIC_BLOCK (i);
7244 for (dbb = first_dom_son (CDI_DOMINATORS, bb);
7246 dbb = next_dom_son (CDI_DOMINATORS, dbb))
7247 VEC_safe_push (basic_block, heap, bbs_to_fix_dom, dbb);
7250 iterate_fix_dominators (CDI_DOMINATORS, bbs_to_fix_dom, true);
7253 BITMAP_FREE (df_idom);
7254 VEC_free (basic_block, heap, bbs_to_remove);
7255 VEC_free (basic_block, heap, bbs_to_fix_dom);
7258 /* Purge dead EH edges from basic block BB. */
7261 gimple_purge_dead_eh_edges (basic_block bb)
7263 bool changed = false;
7266 gimple stmt = last_stmt (bb);
7268 if (stmt && stmt_can_throw_internal (stmt))
7271 for (ei = ei_start (bb->succs); (e = ei_safe_edge (ei)); )
7273 if (e->flags & EDGE_EH)
7275 remove_edge_and_dominated_blocks (e);
7285 /* Purge dead EH edges from basic block listed in BLOCKS. */
7288 gimple_purge_all_dead_eh_edges (const_bitmap blocks)
7290 bool changed = false;
7294 EXECUTE_IF_SET_IN_BITMAP (blocks, 0, i, bi)
7296 basic_block bb = BASIC_BLOCK (i);
7298 /* Earlier gimple_purge_dead_eh_edges could have removed
7299 this basic block already. */
7300 gcc_assert (bb || changed);
7302 changed |= gimple_purge_dead_eh_edges (bb);
7308 /* Purge dead abnormal call edges from basic block BB. */
7311 gimple_purge_dead_abnormal_call_edges (basic_block bb)
7313 bool changed = false;
7316 gimple stmt = last_stmt (bb);
7318 if (!cfun->has_nonlocal_label)
7321 if (stmt && stmt_can_make_abnormal_goto (stmt))
7324 for (ei = ei_start (bb->succs); (e = ei_safe_edge (ei)); )
7326 if (e->flags & EDGE_ABNORMAL)
7328 remove_edge_and_dominated_blocks (e);
7338 /* Purge dead abnormal call edges from basic block listed in BLOCKS. */
7341 gimple_purge_all_dead_abnormal_call_edges (const_bitmap blocks)
7343 bool changed = false;
7347 EXECUTE_IF_SET_IN_BITMAP (blocks, 0, i, bi)
7349 basic_block bb = BASIC_BLOCK (i);
7351 /* Earlier gimple_purge_dead_abnormal_call_edges could have removed
7352 this basic block already. */
7353 gcc_assert (bb || changed);
7355 changed |= gimple_purge_dead_abnormal_call_edges (bb);
7361 /* This function is called whenever a new edge is created or
7365 gimple_execute_on_growing_pred (edge e)
7367 basic_block bb = e->dest;
7369 if (!gimple_seq_empty_p (phi_nodes (bb)))
7370 reserve_phi_args_for_new_edge (bb);
7373 /* This function is called immediately before edge E is removed from
7374 the edge vector E->dest->preds. */
7377 gimple_execute_on_shrinking_pred (edge e)
7379 if (!gimple_seq_empty_p (phi_nodes (e->dest)))
7380 remove_phi_args (e);
7383 /*---------------------------------------------------------------------------
7384 Helper functions for Loop versioning
7385 ---------------------------------------------------------------------------*/
7387 /* Adjust phi nodes for 'first' basic block. 'second' basic block is a copy
7388 of 'first'. Both of them are dominated by 'new_head' basic block. When
7389 'new_head' was created by 'second's incoming edge it received phi arguments
7390 on the edge by split_edge(). Later, additional edge 'e' was created to
7391 connect 'new_head' and 'first'. Now this routine adds phi args on this
7392 additional edge 'e' that new_head to second edge received as part of edge
7396 gimple_lv_adjust_loop_header_phi (basic_block first, basic_block second,
7397 basic_block new_head, edge e)
7400 gimple_stmt_iterator psi1, psi2;
7402 edge e2 = find_edge (new_head, second);
7404 /* Because NEW_HEAD has been created by splitting SECOND's incoming
7405 edge, we should always have an edge from NEW_HEAD to SECOND. */
7406 gcc_assert (e2 != NULL);
7408 /* Browse all 'second' basic block phi nodes and add phi args to
7409 edge 'e' for 'first' head. PHI args are always in correct order. */
7411 for (psi2 = gsi_start_phis (second),
7412 psi1 = gsi_start_phis (first);
7413 !gsi_end_p (psi2) && !gsi_end_p (psi1);
7414 gsi_next (&psi2), gsi_next (&psi1))
7416 phi1 = gsi_stmt (psi1);
7417 phi2 = gsi_stmt (psi2);
7418 def = PHI_ARG_DEF (phi2, e2->dest_idx);
7419 add_phi_arg (phi1, def, e, gimple_phi_arg_location_from_edge (phi2, e2));
7424 /* Adds a if else statement to COND_BB with condition COND_EXPR.
7425 SECOND_HEAD is the destination of the THEN and FIRST_HEAD is
7426 the destination of the ELSE part. */
7429 gimple_lv_add_condition_to_bb (basic_block first_head ATTRIBUTE_UNUSED,
7430 basic_block second_head ATTRIBUTE_UNUSED,
7431 basic_block cond_bb, void *cond_e)
7433 gimple_stmt_iterator gsi;
7434 gimple new_cond_expr;
7435 tree cond_expr = (tree) cond_e;
7438 /* Build new conditional expr */
7439 new_cond_expr = gimple_build_cond_from_tree (cond_expr,
7440 NULL_TREE, NULL_TREE);
7442 /* Add new cond in cond_bb. */
7443 gsi = gsi_last_bb (cond_bb);
7444 gsi_insert_after (&gsi, new_cond_expr, GSI_NEW_STMT);
7446 /* Adjust edges appropriately to connect new head with first head
7447 as well as second head. */
7448 e0 = single_succ_edge (cond_bb);
7449 e0->flags &= ~EDGE_FALLTHRU;
7450 e0->flags |= EDGE_FALSE_VALUE;
7453 struct cfg_hooks gimple_cfg_hooks = {
7455 gimple_verify_flow_info,
7456 gimple_dump_bb, /* dump_bb */
7457 create_bb, /* create_basic_block */
7458 gimple_redirect_edge_and_branch, /* redirect_edge_and_branch */
7459 gimple_redirect_edge_and_branch_force, /* redirect_edge_and_branch_force */
7460 gimple_can_remove_branch_p, /* can_remove_branch_p */
7461 remove_bb, /* delete_basic_block */
7462 gimple_split_block, /* split_block */
7463 gimple_move_block_after, /* move_block_after */
7464 gimple_can_merge_blocks_p, /* can_merge_blocks_p */
7465 gimple_merge_blocks, /* merge_blocks */
7466 gimple_predict_edge, /* predict_edge */
7467 gimple_predicted_by_p, /* predicted_by_p */
7468 gimple_can_duplicate_bb_p, /* can_duplicate_block_p */
7469 gimple_duplicate_bb, /* duplicate_block */
7470 gimple_split_edge, /* split_edge */
7471 gimple_make_forwarder_block, /* make_forward_block */
7472 NULL, /* tidy_fallthru_edge */
7473 NULL, /* force_nonfallthru */
7474 gimple_block_ends_with_call_p,/* block_ends_with_call_p */
7475 gimple_block_ends_with_condjump_p, /* block_ends_with_condjump_p */
7476 gimple_flow_call_edges_add, /* flow_call_edges_add */
7477 gimple_execute_on_growing_pred, /* execute_on_growing_pred */
7478 gimple_execute_on_shrinking_pred, /* execute_on_shrinking_pred */
7479 gimple_duplicate_loop_to_header_edge, /* duplicate loop for trees */
7480 gimple_lv_add_condition_to_bb, /* lv_add_condition_to_bb */
7481 gimple_lv_adjust_loop_header_phi, /* lv_adjust_loop_header_phi*/
7482 extract_true_false_edges_from_block, /* extract_cond_bb_edges */
7483 flush_pending_stmts /* flush_pending_stmts */
7487 /* Split all critical edges. */
7490 split_critical_edges (void)
7496 /* split_edge can redirect edges out of SWITCH_EXPRs, which can get
7497 expensive. So we want to enable recording of edge to CASE_LABEL_EXPR
7498 mappings around the calls to split_edge. */
7499 start_recording_case_labels ();
7502 FOR_EACH_EDGE (e, ei, bb->succs)
7504 if (EDGE_CRITICAL_P (e) && !(e->flags & EDGE_ABNORMAL))
7506 /* PRE inserts statements to edges and expects that
7507 since split_critical_edges was done beforehand, committing edge
7508 insertions will not split more edges. In addition to critical
7509 edges we must split edges that have multiple successors and
7510 end by control flow statements, such as RESX.
7511 Go ahead and split them too. This matches the logic in
7512 gimple_find_edge_insert_loc. */
7513 else if ((!single_pred_p (e->dest)
7514 || !gimple_seq_empty_p (phi_nodes (e->dest))
7515 || e->dest == EXIT_BLOCK_PTR)
7516 && e->src != ENTRY_BLOCK_PTR
7517 && !(e->flags & EDGE_ABNORMAL))
7519 gimple_stmt_iterator gsi;
7521 gsi = gsi_last_bb (e->src);
7522 if (!gsi_end_p (gsi)
7523 && stmt_ends_bb_p (gsi_stmt (gsi))
7524 && (gimple_code (gsi_stmt (gsi)) != GIMPLE_RETURN
7525 && !gimple_call_builtin_p (gsi_stmt (gsi),
7531 end_recording_case_labels ();
7535 struct gimple_opt_pass pass_split_crit_edges =
7539 "crited", /* name */
7541 split_critical_edges, /* execute */
7544 0, /* static_pass_number */
7545 TV_TREE_SPLIT_EDGES, /* tv_id */
7546 PROP_cfg, /* properties required */
7547 PROP_no_crit_edges, /* properties_provided */
7548 0, /* properties_destroyed */
7549 0, /* todo_flags_start */
7550 TODO_verify_flow /* todo_flags_finish */
7555 /* Build a ternary operation and gimplify it. Emit code before GSI.
7556 Return the gimple_val holding the result. */
7559 gimplify_build3 (gimple_stmt_iterator *gsi, enum tree_code code,
7560 tree type, tree a, tree b, tree c)
7563 location_t loc = gimple_location (gsi_stmt (*gsi));
7565 ret = fold_build3_loc (loc, code, type, a, b, c);
7568 return force_gimple_operand_gsi (gsi, ret, true, NULL, true,
7572 /* Build a binary operation and gimplify it. Emit code before GSI.
7573 Return the gimple_val holding the result. */
7576 gimplify_build2 (gimple_stmt_iterator *gsi, enum tree_code code,
7577 tree type, tree a, tree b)
7581 ret = fold_build2_loc (gimple_location (gsi_stmt (*gsi)), code, type, a, b);
7584 return force_gimple_operand_gsi (gsi, ret, true, NULL, true,
7588 /* Build a unary operation and gimplify it. Emit code before GSI.
7589 Return the gimple_val holding the result. */
7592 gimplify_build1 (gimple_stmt_iterator *gsi, enum tree_code code, tree type,
7597 ret = fold_build1_loc (gimple_location (gsi_stmt (*gsi)), code, type, a);
7600 return force_gimple_operand_gsi (gsi, ret, true, NULL, true,
7606 /* Emit return warnings. */
7609 execute_warn_function_return (void)
7611 source_location location;
7616 /* If we have a path to EXIT, then we do return. */
7617 if (TREE_THIS_VOLATILE (cfun->decl)
7618 && EDGE_COUNT (EXIT_BLOCK_PTR->preds) > 0)
7620 location = UNKNOWN_LOCATION;
7621 FOR_EACH_EDGE (e, ei, EXIT_BLOCK_PTR->preds)
7623 last = last_stmt (e->src);
7624 if ((gimple_code (last) == GIMPLE_RETURN
7625 || gimple_call_builtin_p (last, BUILT_IN_RETURN))
7626 && (location = gimple_location (last)) != UNKNOWN_LOCATION)
7629 if (location == UNKNOWN_LOCATION)
7630 location = cfun->function_end_locus;
7631 warning_at (location, 0, "%<noreturn%> function does return");
7634 /* If we see "return;" in some basic block, then we do reach the end
7635 without returning a value. */
7636 else if (warn_return_type
7637 && !TREE_NO_WARNING (cfun->decl)
7638 && EDGE_COUNT (EXIT_BLOCK_PTR->preds) > 0
7639 && !VOID_TYPE_P (TREE_TYPE (TREE_TYPE (cfun->decl))))
7641 FOR_EACH_EDGE (e, ei, EXIT_BLOCK_PTR->preds)
7643 gimple last = last_stmt (e->src);
7644 if (gimple_code (last) == GIMPLE_RETURN
7645 && gimple_return_retval (last) == NULL
7646 && !gimple_no_warning_p (last))
7648 location = gimple_location (last);
7649 if (location == UNKNOWN_LOCATION)
7650 location = cfun->function_end_locus;
7651 warning_at (location, OPT_Wreturn_type, "control reaches end of non-void function");
7652 TREE_NO_WARNING (cfun->decl) = 1;
7661 /* Given a basic block B which ends with a conditional and has
7662 precisely two successors, determine which of the edges is taken if
7663 the conditional is true and which is taken if the conditional is
7664 false. Set TRUE_EDGE and FALSE_EDGE appropriately. */
7667 extract_true_false_edges_from_block (basic_block b,
7671 edge e = EDGE_SUCC (b, 0);
7673 if (e->flags & EDGE_TRUE_VALUE)
7676 *false_edge = EDGE_SUCC (b, 1);
7681 *true_edge = EDGE_SUCC (b, 1);
7685 struct gimple_opt_pass pass_warn_function_return =
7689 "*warn_function_return", /* name */
7691 execute_warn_function_return, /* execute */
7694 0, /* static_pass_number */
7695 TV_NONE, /* tv_id */
7696 PROP_cfg, /* properties_required */
7697 0, /* properties_provided */
7698 0, /* properties_destroyed */
7699 0, /* todo_flags_start */
7700 0 /* todo_flags_finish */
7704 /* Emit noreturn warnings. */
7707 execute_warn_function_noreturn (void)
7709 if (!TREE_THIS_VOLATILE (current_function_decl)
7710 && EDGE_COUNT (EXIT_BLOCK_PTR->preds) == 0)
7711 warn_function_noreturn (current_function_decl);
7716 gate_warn_function_noreturn (void)
7718 return warn_suggest_attribute_noreturn;
7721 struct gimple_opt_pass pass_warn_function_noreturn =
7725 "*warn_function_noreturn", /* name */
7726 gate_warn_function_noreturn, /* gate */
7727 execute_warn_function_noreturn, /* execute */
7730 0, /* static_pass_number */
7731 TV_NONE, /* tv_id */
7732 PROP_cfg, /* properties_required */
7733 0, /* properties_provided */
7734 0, /* properties_destroyed */
7735 0, /* todo_flags_start */
7736 0 /* todo_flags_finish */
7741 /* Walk a gimplified function and warn for functions whose return value is
7742 ignored and attribute((warn_unused_result)) is set. This is done before
7743 inlining, so we don't have to worry about that. */
7746 do_warn_unused_result (gimple_seq seq)
7749 gimple_stmt_iterator i;
7751 for (i = gsi_start (seq); !gsi_end_p (i); gsi_next (&i))
7753 gimple g = gsi_stmt (i);
7755 switch (gimple_code (g))
7758 do_warn_unused_result (gimple_bind_body (g));
7761 do_warn_unused_result (gimple_try_eval (g));
7762 do_warn_unused_result (gimple_try_cleanup (g));
7765 do_warn_unused_result (gimple_catch_handler (g));
7767 case GIMPLE_EH_FILTER:
7768 do_warn_unused_result (gimple_eh_filter_failure (g));
7772 if (gimple_call_lhs (g))
7774 if (gimple_call_internal_p (g))
7777 /* This is a naked call, as opposed to a GIMPLE_CALL with an
7778 LHS. All calls whose value is ignored should be
7779 represented like this. Look for the attribute. */
7780 fdecl = gimple_call_fndecl (g);
7781 ftype = gimple_call_fntype (g);
7783 if (lookup_attribute ("warn_unused_result", TYPE_ATTRIBUTES (ftype)))
7785 location_t loc = gimple_location (g);
7788 warning_at (loc, OPT_Wunused_result,
7789 "ignoring return value of %qD, "
7790 "declared with attribute warn_unused_result",
7793 warning_at (loc, OPT_Wunused_result,
7794 "ignoring return value of function "
7795 "declared with attribute warn_unused_result");
7800 /* Not a container, not a call, or a call whose value is used. */
7807 run_warn_unused_result (void)
7809 do_warn_unused_result (gimple_body (current_function_decl));
7814 gate_warn_unused_result (void)
7816 return flag_warn_unused_result;
7819 struct gimple_opt_pass pass_warn_unused_result =
7823 "*warn_unused_result", /* name */
7824 gate_warn_unused_result, /* gate */
7825 run_warn_unused_result, /* execute */
7828 0, /* static_pass_number */
7829 TV_NONE, /* tv_id */
7830 PROP_gimple_any, /* properties_required */
7831 0, /* properties_provided */
7832 0, /* properties_destroyed */
7833 0, /* todo_flags_start */
7834 0, /* todo_flags_finish */