1 /* Control flow functions for trees.
2 Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009,
3 2010 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"
33 #include "langhooks.h"
34 #include "tree-pretty-print.h"
35 #include "gimple-pretty-print.h"
36 #include "tree-flow.h"
38 #include "tree-dump.h"
39 #include "tree-pass.h"
40 #include "diagnostic-core.h"
44 #include "cfglayout.h"
45 #include "tree-ssa-propagate.h"
46 #include "value-prof.h"
47 #include "pointer-set.h"
48 #include "tree-inline.h"
50 /* This file contains functions for building the Control Flow Graph (CFG)
51 for a function tree. */
53 /* Local declarations. */
55 /* Initial capacity for the basic block array. */
56 static const int initial_cfg_capacity = 20;
58 /* This hash table allows us to efficiently lookup all CASE_LABEL_EXPRs
59 which use a particular edge. The CASE_LABEL_EXPRs are chained together
60 via their TREE_CHAIN field, which we clear after we're done with the
61 hash table to prevent problems with duplication of GIMPLE_SWITCHes.
63 Access to this list of CASE_LABEL_EXPRs allows us to efficiently
64 update the case vector in response to edge redirections.
66 Right now this table is set up and torn down at key points in the
67 compilation process. It would be nice if we could make the table
68 more persistent. The key is getting notification of changes to
69 the CFG (particularly edge removal, creation and redirection). */
71 static struct pointer_map_t *edge_to_cases;
73 /* If we record edge_to_cases, this bitmap will hold indexes
74 of basic blocks that end in a GIMPLE_SWITCH which we touched
75 due to edge manipulations. */
77 static bitmap touched_switch_bbs;
82 long num_merged_labels;
85 static struct cfg_stats_d cfg_stats;
87 /* Nonzero if we found a computed goto while building basic blocks. */
88 static bool found_computed_goto;
90 /* Hash table to store last discriminator assigned for each locus. */
91 struct locus_discrim_map
96 static htab_t discriminator_per_locus;
98 /* Basic blocks and flowgraphs. */
99 static void make_blocks (gimple_seq);
100 static void factor_computed_gotos (void);
103 static void make_edges (void);
104 static void make_cond_expr_edges (basic_block);
105 static void make_gimple_switch_edges (basic_block);
106 static void make_goto_expr_edges (basic_block);
107 static void make_gimple_asm_edges (basic_block);
108 static unsigned int locus_map_hash (const void *);
109 static int locus_map_eq (const void *, const void *);
110 static void assign_discriminator (location_t, basic_block);
111 static edge gimple_redirect_edge_and_branch (edge, basic_block);
112 static edge gimple_try_redirect_by_replacing_jump (edge, basic_block);
113 static unsigned int split_critical_edges (void);
115 /* Various helpers. */
116 static inline bool stmt_starts_bb_p (gimple, gimple);
117 static int gimple_verify_flow_info (void);
118 static void gimple_make_forwarder_block (edge);
119 static void gimple_cfg2vcg (FILE *);
120 static gimple first_non_label_stmt (basic_block);
122 /* Flowgraph optimization and cleanup. */
123 static void gimple_merge_blocks (basic_block, basic_block);
124 static bool gimple_can_merge_blocks_p (basic_block, basic_block);
125 static void remove_bb (basic_block);
126 static edge find_taken_edge_computed_goto (basic_block, tree);
127 static edge find_taken_edge_cond_expr (basic_block, tree);
128 static edge find_taken_edge_switch_expr (basic_block, tree);
129 static tree find_case_label_for_value (gimple, tree);
130 static void group_case_labels_stmt (gimple);
133 init_empty_tree_cfg_for_function (struct function *fn)
135 /* Initialize the basic block array. */
137 profile_status_for_function (fn) = PROFILE_ABSENT;
138 n_basic_blocks_for_function (fn) = NUM_FIXED_BLOCKS;
139 last_basic_block_for_function (fn) = NUM_FIXED_BLOCKS;
140 basic_block_info_for_function (fn)
141 = VEC_alloc (basic_block, gc, initial_cfg_capacity);
142 VEC_safe_grow_cleared (basic_block, gc,
143 basic_block_info_for_function (fn),
144 initial_cfg_capacity);
146 /* Build a mapping of labels to their associated blocks. */
147 label_to_block_map_for_function (fn)
148 = VEC_alloc (basic_block, gc, initial_cfg_capacity);
149 VEC_safe_grow_cleared (basic_block, gc,
150 label_to_block_map_for_function (fn),
151 initial_cfg_capacity);
153 SET_BASIC_BLOCK_FOR_FUNCTION (fn, ENTRY_BLOCK,
154 ENTRY_BLOCK_PTR_FOR_FUNCTION (fn));
155 SET_BASIC_BLOCK_FOR_FUNCTION (fn, EXIT_BLOCK,
156 EXIT_BLOCK_PTR_FOR_FUNCTION (fn));
158 ENTRY_BLOCK_PTR_FOR_FUNCTION (fn)->next_bb
159 = EXIT_BLOCK_PTR_FOR_FUNCTION (fn);
160 EXIT_BLOCK_PTR_FOR_FUNCTION (fn)->prev_bb
161 = ENTRY_BLOCK_PTR_FOR_FUNCTION (fn);
165 init_empty_tree_cfg (void)
167 init_empty_tree_cfg_for_function (cfun);
170 /*---------------------------------------------------------------------------
172 ---------------------------------------------------------------------------*/
174 /* Entry point to the CFG builder for trees. SEQ is the sequence of
175 statements to be added to the flowgraph. */
178 build_gimple_cfg (gimple_seq seq)
180 /* Register specific gimple functions. */
181 gimple_register_cfg_hooks ();
183 memset ((void *) &cfg_stats, 0, sizeof (cfg_stats));
185 init_empty_tree_cfg ();
187 found_computed_goto = 0;
190 /* Computed gotos are hell to deal with, especially if there are
191 lots of them with a large number of destinations. So we factor
192 them to a common computed goto location before we build the
193 edge list. After we convert back to normal form, we will un-factor
194 the computed gotos since factoring introduces an unwanted jump. */
195 if (found_computed_goto)
196 factor_computed_gotos ();
198 /* Make sure there is always at least one block, even if it's empty. */
199 if (n_basic_blocks == NUM_FIXED_BLOCKS)
200 create_empty_bb (ENTRY_BLOCK_PTR);
202 /* Adjust the size of the array. */
203 if (VEC_length (basic_block, basic_block_info) < (size_t) n_basic_blocks)
204 VEC_safe_grow_cleared (basic_block, gc, basic_block_info, n_basic_blocks);
206 /* To speed up statement iterator walks, we first purge dead labels. */
207 cleanup_dead_labels ();
209 /* Group case nodes to reduce the number of edges.
210 We do this after cleaning up dead labels because otherwise we miss
211 a lot of obvious case merging opportunities. */
212 group_case_labels ();
214 /* Create the edges of the flowgraph. */
215 discriminator_per_locus = htab_create (13, locus_map_hash, locus_map_eq,
218 cleanup_dead_labels ();
219 htab_delete (discriminator_per_locus);
221 /* Debugging dumps. */
223 /* Write the flowgraph to a VCG file. */
225 int local_dump_flags;
226 FILE *vcg_file = dump_begin (TDI_vcg, &local_dump_flags);
229 gimple_cfg2vcg (vcg_file);
230 dump_end (TDI_vcg, vcg_file);
234 #ifdef ENABLE_CHECKING
240 execute_build_cfg (void)
242 gimple_seq body = gimple_body (current_function_decl);
244 build_gimple_cfg (body);
245 gimple_set_body (current_function_decl, NULL);
246 if (dump_file && (dump_flags & TDF_DETAILS))
248 fprintf (dump_file, "Scope blocks:\n");
249 dump_scope_blocks (dump_file, dump_flags);
254 struct gimple_opt_pass pass_build_cfg =
260 execute_build_cfg, /* execute */
263 0, /* static_pass_number */
264 TV_TREE_CFG, /* tv_id */
265 PROP_gimple_leh, /* properties_required */
266 PROP_cfg, /* properties_provided */
267 0, /* properties_destroyed */
268 0, /* todo_flags_start */
269 TODO_verify_stmts | TODO_cleanup_cfg
270 | TODO_dump_func /* todo_flags_finish */
275 /* Return true if T is a computed goto. */
278 computed_goto_p (gimple t)
280 return (gimple_code (t) == GIMPLE_GOTO
281 && TREE_CODE (gimple_goto_dest (t)) != LABEL_DECL);
285 /* Search the CFG for any computed gotos. If found, factor them to a
286 common computed goto site. Also record the location of that site so
287 that we can un-factor the gotos after we have converted back to
291 factor_computed_gotos (void)
294 tree factored_label_decl = NULL;
296 gimple factored_computed_goto_label = NULL;
297 gimple factored_computed_goto = NULL;
299 /* We know there are one or more computed gotos in this function.
300 Examine the last statement in each basic block to see if the block
301 ends with a computed goto. */
305 gimple_stmt_iterator gsi = gsi_last_bb (bb);
311 last = gsi_stmt (gsi);
313 /* Ignore the computed goto we create when we factor the original
315 if (last == factored_computed_goto)
318 /* If the last statement is a computed goto, factor it. */
319 if (computed_goto_p (last))
323 /* The first time we find a computed goto we need to create
324 the factored goto block and the variable each original
325 computed goto will use for their goto destination. */
326 if (!factored_computed_goto)
328 basic_block new_bb = create_empty_bb (bb);
329 gimple_stmt_iterator new_gsi = gsi_start_bb (new_bb);
331 /* Create the destination of the factored goto. Each original
332 computed goto will put its desired destination into this
333 variable and jump to the label we create immediately
335 var = create_tmp_var (ptr_type_node, "gotovar");
337 /* Build a label for the new block which will contain the
338 factored computed goto. */
339 factored_label_decl = create_artificial_label (UNKNOWN_LOCATION);
340 factored_computed_goto_label
341 = gimple_build_label (factored_label_decl);
342 gsi_insert_after (&new_gsi, factored_computed_goto_label,
345 /* Build our new computed goto. */
346 factored_computed_goto = gimple_build_goto (var);
347 gsi_insert_after (&new_gsi, factored_computed_goto, GSI_NEW_STMT);
350 /* Copy the original computed goto's destination into VAR. */
351 assignment = gimple_build_assign (var, gimple_goto_dest (last));
352 gsi_insert_before (&gsi, assignment, GSI_SAME_STMT);
354 /* And re-vector the computed goto to the new destination. */
355 gimple_goto_set_dest (last, factored_label_decl);
361 /* Build a flowgraph for the sequence of stmts SEQ. */
364 make_blocks (gimple_seq seq)
366 gimple_stmt_iterator i = gsi_start (seq);
368 bool start_new_block = true;
369 bool first_stmt_of_seq = true;
370 basic_block bb = ENTRY_BLOCK_PTR;
372 while (!gsi_end_p (i))
379 /* If the statement starts a new basic block or if we have determined
380 in a previous pass that we need to create a new block for STMT, do
382 if (start_new_block || stmt_starts_bb_p (stmt, prev_stmt))
384 if (!first_stmt_of_seq)
385 seq = gsi_split_seq_before (&i);
386 bb = create_basic_block (seq, NULL, bb);
387 start_new_block = false;
390 /* Now add STMT to BB and create the subgraphs for special statement
392 gimple_set_bb (stmt, bb);
394 if (computed_goto_p (stmt))
395 found_computed_goto = true;
397 /* If STMT is a basic block terminator, set START_NEW_BLOCK for the
399 if (stmt_ends_bb_p (stmt))
401 /* If the stmt can make abnormal goto use a new temporary
402 for the assignment to the LHS. This makes sure the old value
403 of the LHS is available on the abnormal edge. Otherwise
404 we will end up with overlapping life-ranges for abnormal
406 if (gimple_has_lhs (stmt)
407 && stmt_can_make_abnormal_goto (stmt)
408 && is_gimple_reg_type (TREE_TYPE (gimple_get_lhs (stmt))))
410 tree lhs = gimple_get_lhs (stmt);
411 tree tmp = create_tmp_var (TREE_TYPE (lhs), NULL);
412 gimple s = gimple_build_assign (lhs, tmp);
413 gimple_set_location (s, gimple_location (stmt));
414 gimple_set_block (s, gimple_block (stmt));
415 gimple_set_lhs (stmt, tmp);
416 if (TREE_CODE (TREE_TYPE (tmp)) == COMPLEX_TYPE
417 || TREE_CODE (TREE_TYPE (tmp)) == VECTOR_TYPE)
418 DECL_GIMPLE_REG_P (tmp) = 1;
419 gsi_insert_after (&i, s, GSI_SAME_STMT);
421 start_new_block = true;
425 first_stmt_of_seq = false;
430 /* Create and return a new empty basic block after bb AFTER. */
433 create_bb (void *h, void *e, basic_block after)
439 /* Create and initialize a new basic block. Since alloc_block uses
440 GC allocation that clears memory to allocate a basic block, we do
441 not have to clear the newly allocated basic block here. */
444 bb->index = last_basic_block;
446 bb->il.gimple = ggc_alloc_cleared_gimple_bb_info ();
447 set_bb_seq (bb, h ? (gimple_seq) h : gimple_seq_alloc ());
449 /* Add the new block to the linked list of blocks. */
450 link_block (bb, after);
452 /* Grow the basic block array if needed. */
453 if ((size_t) last_basic_block == VEC_length (basic_block, basic_block_info))
455 size_t new_size = last_basic_block + (last_basic_block + 3) / 4;
456 VEC_safe_grow_cleared (basic_block, gc, basic_block_info, new_size);
459 /* Add the newly created block to the array. */
460 SET_BASIC_BLOCK (last_basic_block, bb);
469 /*---------------------------------------------------------------------------
471 ---------------------------------------------------------------------------*/
473 /* Fold COND_EXPR_COND of each COND_EXPR. */
476 fold_cond_expr_cond (void)
482 gimple stmt = last_stmt (bb);
484 if (stmt && gimple_code (stmt) == GIMPLE_COND)
486 location_t loc = gimple_location (stmt);
490 fold_defer_overflow_warnings ();
491 cond = fold_binary_loc (loc, gimple_cond_code (stmt), boolean_type_node,
492 gimple_cond_lhs (stmt), gimple_cond_rhs (stmt));
495 zerop = integer_zerop (cond);
496 onep = integer_onep (cond);
499 zerop = onep = false;
501 fold_undefer_overflow_warnings (zerop || onep,
503 WARN_STRICT_OVERFLOW_CONDITIONAL);
505 gimple_cond_make_false (stmt);
507 gimple_cond_make_true (stmt);
512 /* Join all the blocks in the flowgraph. */
518 struct omp_region *cur_region = NULL;
520 /* Create an edge from entry to the first block with executable
522 make_edge (ENTRY_BLOCK_PTR, BASIC_BLOCK (NUM_FIXED_BLOCKS), EDGE_FALLTHRU);
524 /* Traverse the basic block array placing edges. */
527 gimple last = last_stmt (bb);
532 enum gimple_code code = gimple_code (last);
536 make_goto_expr_edges (bb);
540 make_edge (bb, EXIT_BLOCK_PTR, 0);
544 make_cond_expr_edges (bb);
548 make_gimple_switch_edges (bb);
552 make_eh_edges (last);
555 case GIMPLE_EH_DISPATCH:
556 fallthru = make_eh_dispatch_edges (last);
560 /* If this function receives a nonlocal goto, then we need to
561 make edges from this call site to all the nonlocal goto
563 if (stmt_can_make_abnormal_goto (last))
564 make_abnormal_goto_edges (bb, true);
566 /* If this statement has reachable exception handlers, then
567 create abnormal edges to them. */
568 make_eh_edges (last);
570 /* BUILTIN_RETURN is really a return statement. */
571 if (gimple_call_builtin_p (last, BUILT_IN_RETURN))
572 make_edge (bb, EXIT_BLOCK_PTR, 0), fallthru = false;
573 /* Some calls are known not to return. */
575 fallthru = !(gimple_call_flags (last) & ECF_NORETURN);
579 /* A GIMPLE_ASSIGN may throw internally and thus be considered
581 if (is_ctrl_altering_stmt (last))
582 make_eh_edges (last);
587 make_gimple_asm_edges (bb);
591 case GIMPLE_OMP_PARALLEL:
592 case GIMPLE_OMP_TASK:
594 case GIMPLE_OMP_SINGLE:
595 case GIMPLE_OMP_MASTER:
596 case GIMPLE_OMP_ORDERED:
597 case GIMPLE_OMP_CRITICAL:
598 case GIMPLE_OMP_SECTION:
599 cur_region = new_omp_region (bb, code, cur_region);
603 case GIMPLE_OMP_SECTIONS:
604 cur_region = new_omp_region (bb, code, cur_region);
608 case GIMPLE_OMP_SECTIONS_SWITCH:
612 case GIMPLE_OMP_ATOMIC_LOAD:
613 case GIMPLE_OMP_ATOMIC_STORE:
617 case GIMPLE_OMP_RETURN:
618 /* In the case of a GIMPLE_OMP_SECTION, the edge will go
619 somewhere other than the next block. This will be
621 cur_region->exit = bb;
622 fallthru = cur_region->type != GIMPLE_OMP_SECTION;
623 cur_region = cur_region->outer;
626 case GIMPLE_OMP_CONTINUE:
627 cur_region->cont = bb;
628 switch (cur_region->type)
631 /* Mark all GIMPLE_OMP_FOR and GIMPLE_OMP_CONTINUE
632 succs edges as abnormal to prevent splitting
634 single_succ_edge (cur_region->entry)->flags |= EDGE_ABNORMAL;
635 /* Make the loopback edge. */
636 make_edge (bb, single_succ (cur_region->entry),
639 /* Create an edge from GIMPLE_OMP_FOR to exit, which
640 corresponds to the case that the body of the loop
641 is not executed at all. */
642 make_edge (cur_region->entry, bb->next_bb, EDGE_ABNORMAL);
643 make_edge (bb, bb->next_bb, EDGE_FALLTHRU | EDGE_ABNORMAL);
647 case GIMPLE_OMP_SECTIONS:
648 /* Wire up the edges into and out of the nested sections. */
650 basic_block switch_bb = single_succ (cur_region->entry);
652 struct omp_region *i;
653 for (i = cur_region->inner; i ; i = i->next)
655 gcc_assert (i->type == GIMPLE_OMP_SECTION);
656 make_edge (switch_bb, i->entry, 0);
657 make_edge (i->exit, bb, EDGE_FALLTHRU);
660 /* Make the loopback edge to the block with
661 GIMPLE_OMP_SECTIONS_SWITCH. */
662 make_edge (bb, switch_bb, 0);
664 /* Make the edge from the switch to exit. */
665 make_edge (switch_bb, bb->next_bb, 0);
676 gcc_assert (!stmt_ends_bb_p (last));
685 make_edge (bb, bb->next_bb, EDGE_FALLTHRU);
687 assign_discriminator (gimple_location (last), bb->next_bb);
694 /* Fold COND_EXPR_COND of each COND_EXPR. */
695 fold_cond_expr_cond ();
698 /* Trivial hash function for a location_t. ITEM is a pointer to
699 a hash table entry that maps a location_t to a discriminator. */
702 locus_map_hash (const void *item)
704 return ((const struct locus_discrim_map *) item)->locus;
707 /* Equality function for the locus-to-discriminator map. VA and VB
708 point to the two hash table entries to compare. */
711 locus_map_eq (const void *va, const void *vb)
713 const struct locus_discrim_map *a = (const struct locus_discrim_map *) va;
714 const struct locus_discrim_map *b = (const struct locus_discrim_map *) vb;
715 return a->locus == b->locus;
718 /* Find the next available discriminator value for LOCUS. The
719 discriminator distinguishes among several basic blocks that
720 share a common locus, allowing for more accurate sample-based
724 next_discriminator_for_locus (location_t locus)
726 struct locus_discrim_map item;
727 struct locus_discrim_map **slot;
730 item.discriminator = 0;
731 slot = (struct locus_discrim_map **)
732 htab_find_slot_with_hash (discriminator_per_locus, (void *) &item,
733 (hashval_t) locus, INSERT);
735 if (*slot == HTAB_EMPTY_ENTRY)
737 *slot = XNEW (struct locus_discrim_map);
739 (*slot)->locus = locus;
740 (*slot)->discriminator = 0;
742 (*slot)->discriminator++;
743 return (*slot)->discriminator;
746 /* Return TRUE if LOCUS1 and LOCUS2 refer to the same source line. */
749 same_line_p (location_t locus1, location_t locus2)
751 expanded_location from, to;
753 if (locus1 == locus2)
756 from = expand_location (locus1);
757 to = expand_location (locus2);
759 if (from.line != to.line)
761 if (from.file == to.file)
763 return (from.file != NULL
765 && strcmp (from.file, to.file) == 0);
768 /* Assign a unique discriminator value to block BB if it begins at the same
769 LOCUS as its predecessor block. */
772 assign_discriminator (location_t locus, basic_block bb)
774 gimple first_in_to_bb, last_in_to_bb;
776 if (locus == 0 || bb->discriminator != 0)
779 first_in_to_bb = first_non_label_stmt (bb);
780 last_in_to_bb = last_stmt (bb);
781 if ((first_in_to_bb && same_line_p (locus, gimple_location (first_in_to_bb)))
782 || (last_in_to_bb && same_line_p (locus, gimple_location (last_in_to_bb))))
783 bb->discriminator = next_discriminator_for_locus (locus);
786 /* Create the edges for a GIMPLE_COND starting at block BB. */
789 make_cond_expr_edges (basic_block bb)
791 gimple entry = last_stmt (bb);
792 gimple then_stmt, else_stmt;
793 basic_block then_bb, else_bb;
794 tree then_label, else_label;
796 location_t entry_locus;
799 gcc_assert (gimple_code (entry) == GIMPLE_COND);
801 entry_locus = gimple_location (entry);
803 /* Entry basic blocks for each component. */
804 then_label = gimple_cond_true_label (entry);
805 else_label = gimple_cond_false_label (entry);
806 then_bb = label_to_block (then_label);
807 else_bb = label_to_block (else_label);
808 then_stmt = first_stmt (then_bb);
809 else_stmt = first_stmt (else_bb);
811 e = make_edge (bb, then_bb, EDGE_TRUE_VALUE);
812 assign_discriminator (entry_locus, then_bb);
813 e->goto_locus = gimple_location (then_stmt);
815 e->goto_block = gimple_block (then_stmt);
816 e = make_edge (bb, else_bb, EDGE_FALSE_VALUE);
819 assign_discriminator (entry_locus, else_bb);
820 e->goto_locus = gimple_location (else_stmt);
822 e->goto_block = gimple_block (else_stmt);
825 /* We do not need the labels anymore. */
826 gimple_cond_set_true_label (entry, NULL_TREE);
827 gimple_cond_set_false_label (entry, NULL_TREE);
831 /* Called for each element in the hash table (P) as we delete the
832 edge to cases hash table.
834 Clear all the TREE_CHAINs to prevent problems with copying of
835 SWITCH_EXPRs and structure sharing rules, then free the hash table
839 edge_to_cases_cleanup (const void *key ATTRIBUTE_UNUSED, void **value,
840 void *data ATTRIBUTE_UNUSED)
844 for (t = (tree) *value; t; t = next)
846 next = TREE_CHAIN (t);
847 TREE_CHAIN (t) = NULL;
854 /* Start recording information mapping edges to case labels. */
857 start_recording_case_labels (void)
859 gcc_assert (edge_to_cases == NULL);
860 edge_to_cases = pointer_map_create ();
861 touched_switch_bbs = BITMAP_ALLOC (NULL);
864 /* Return nonzero if we are recording information for case labels. */
867 recording_case_labels_p (void)
869 return (edge_to_cases != NULL);
872 /* Stop recording information mapping edges to case labels and
873 remove any information we have recorded. */
875 end_recording_case_labels (void)
879 pointer_map_traverse (edge_to_cases, edge_to_cases_cleanup, NULL);
880 pointer_map_destroy (edge_to_cases);
881 edge_to_cases = NULL;
882 EXECUTE_IF_SET_IN_BITMAP (touched_switch_bbs, 0, i, bi)
884 basic_block bb = BASIC_BLOCK (i);
887 gimple stmt = last_stmt (bb);
888 if (stmt && gimple_code (stmt) == GIMPLE_SWITCH)
889 group_case_labels_stmt (stmt);
892 BITMAP_FREE (touched_switch_bbs);
895 /* If we are inside a {start,end}_recording_cases block, then return
896 a chain of CASE_LABEL_EXPRs from T which reference E.
898 Otherwise return NULL. */
901 get_cases_for_edge (edge e, gimple t)
906 /* If we are not recording cases, then we do not have CASE_LABEL_EXPR
907 chains available. Return NULL so the caller can detect this case. */
908 if (!recording_case_labels_p ())
911 slot = pointer_map_contains (edge_to_cases, e);
915 /* If we did not find E in the hash table, then this must be the first
916 time we have been queried for information about E & T. Add all the
917 elements from T to the hash table then perform the query again. */
919 n = gimple_switch_num_labels (t);
920 for (i = 0; i < n; i++)
922 tree elt = gimple_switch_label (t, i);
923 tree lab = CASE_LABEL (elt);
924 basic_block label_bb = label_to_block (lab);
925 edge this_edge = find_edge (e->src, label_bb);
927 /* Add it to the chain of CASE_LABEL_EXPRs referencing E, or create
929 slot = pointer_map_insert (edge_to_cases, this_edge);
930 TREE_CHAIN (elt) = (tree) *slot;
934 return (tree) *pointer_map_contains (edge_to_cases, e);
937 /* Create the edges for a GIMPLE_SWITCH starting at block BB. */
940 make_gimple_switch_edges (basic_block bb)
942 gimple entry = last_stmt (bb);
943 location_t entry_locus;
946 entry_locus = gimple_location (entry);
948 n = gimple_switch_num_labels (entry);
950 for (i = 0; i < n; ++i)
952 tree lab = CASE_LABEL (gimple_switch_label (entry, i));
953 basic_block label_bb = label_to_block (lab);
954 make_edge (bb, label_bb, 0);
955 assign_discriminator (entry_locus, label_bb);
960 /* Return the basic block holding label DEST. */
963 label_to_block_fn (struct function *ifun, tree dest)
965 int uid = LABEL_DECL_UID (dest);
967 /* We would die hard when faced by an undefined label. Emit a label to
968 the very first basic block. This will hopefully make even the dataflow
969 and undefined variable warnings quite right. */
970 if (seen_error () && uid < 0)
972 gimple_stmt_iterator gsi = gsi_start_bb (BASIC_BLOCK (NUM_FIXED_BLOCKS));
975 stmt = gimple_build_label (dest);
976 gsi_insert_before (&gsi, stmt, GSI_NEW_STMT);
977 uid = LABEL_DECL_UID (dest);
979 if (VEC_length (basic_block, ifun->cfg->x_label_to_block_map)
980 <= (unsigned int) uid)
982 return VEC_index (basic_block, ifun->cfg->x_label_to_block_map, uid);
985 /* Create edges for an abnormal goto statement at block BB. If FOR_CALL
986 is true, the source statement is a CALL_EXPR instead of a GOTO_EXPR. */
989 make_abnormal_goto_edges (basic_block bb, bool for_call)
991 basic_block target_bb;
992 gimple_stmt_iterator gsi;
994 FOR_EACH_BB (target_bb)
995 for (gsi = gsi_start_bb (target_bb); !gsi_end_p (gsi); gsi_next (&gsi))
997 gimple label_stmt = gsi_stmt (gsi);
1000 if (gimple_code (label_stmt) != GIMPLE_LABEL)
1003 target = gimple_label_label (label_stmt);
1005 /* Make an edge to every label block that has been marked as a
1006 potential target for a computed goto or a non-local goto. */
1007 if ((FORCED_LABEL (target) && !for_call)
1008 || (DECL_NONLOCAL (target) && for_call))
1010 make_edge (bb, target_bb, EDGE_ABNORMAL);
1016 /* Create edges for a goto statement at block BB. */
1019 make_goto_expr_edges (basic_block bb)
1021 gimple_stmt_iterator last = gsi_last_bb (bb);
1022 gimple goto_t = gsi_stmt (last);
1024 /* A simple GOTO creates normal edges. */
1025 if (simple_goto_p (goto_t))
1027 tree dest = gimple_goto_dest (goto_t);
1028 basic_block label_bb = label_to_block (dest);
1029 edge e = make_edge (bb, label_bb, EDGE_FALLTHRU);
1030 e->goto_locus = gimple_location (goto_t);
1031 assign_discriminator (e->goto_locus, label_bb);
1033 e->goto_block = gimple_block (goto_t);
1034 gsi_remove (&last, true);
1038 /* A computed GOTO creates abnormal edges. */
1039 make_abnormal_goto_edges (bb, false);
1042 /* Create edges for an asm statement with labels at block BB. */
1045 make_gimple_asm_edges (basic_block bb)
1047 gimple stmt = last_stmt (bb);
1048 location_t stmt_loc = gimple_location (stmt);
1049 int i, n = gimple_asm_nlabels (stmt);
1051 for (i = 0; i < n; ++i)
1053 tree label = TREE_VALUE (gimple_asm_label_op (stmt, i));
1054 basic_block label_bb = label_to_block (label);
1055 make_edge (bb, label_bb, 0);
1056 assign_discriminator (stmt_loc, label_bb);
1060 /*---------------------------------------------------------------------------
1062 ---------------------------------------------------------------------------*/
1064 /* Cleanup useless labels in basic blocks. This is something we wish
1065 to do early because it allows us to group case labels before creating
1066 the edges for the CFG, and it speeds up block statement iterators in
1067 all passes later on.
1068 We rerun this pass after CFG is created, to get rid of the labels that
1069 are no longer referenced. After then we do not run it any more, since
1070 (almost) no new labels should be created. */
1072 /* A map from basic block index to the leading label of that block. */
1073 static struct label_record
1078 /* True if the label is referenced from somewhere. */
1082 /* Given LABEL return the first label in the same basic block. */
1085 main_block_label (tree label)
1087 basic_block bb = label_to_block (label);
1088 tree main_label = label_for_bb[bb->index].label;
1090 /* label_to_block possibly inserted undefined label into the chain. */
1093 label_for_bb[bb->index].label = label;
1097 label_for_bb[bb->index].used = true;
1101 /* Clean up redundant labels within the exception tree. */
1104 cleanup_dead_labels_eh (void)
1111 if (cfun->eh == NULL)
1114 for (i = 1; VEC_iterate (eh_landing_pad, cfun->eh->lp_array, i, lp); ++i)
1115 if (lp && lp->post_landing_pad)
1117 lab = main_block_label (lp->post_landing_pad);
1118 if (lab != lp->post_landing_pad)
1120 EH_LANDING_PAD_NR (lp->post_landing_pad) = 0;
1121 EH_LANDING_PAD_NR (lab) = lp->index;
1125 FOR_ALL_EH_REGION (r)
1129 case ERT_MUST_NOT_THROW:
1135 for (c = r->u.eh_try.first_catch; c ; c = c->next_catch)
1139 c->label = main_block_label (lab);
1144 case ERT_ALLOWED_EXCEPTIONS:
1145 lab = r->u.allowed.label;
1147 r->u.allowed.label = main_block_label (lab);
1153 /* Cleanup redundant labels. This is a three-step process:
1154 1) Find the leading label for each block.
1155 2) Redirect all references to labels to the leading labels.
1156 3) Cleanup all useless labels. */
1159 cleanup_dead_labels (void)
1162 label_for_bb = XCNEWVEC (struct label_record, last_basic_block);
1164 /* Find a suitable label for each block. We use the first user-defined
1165 label if there is one, or otherwise just the first label we see. */
1168 gimple_stmt_iterator i;
1170 for (i = gsi_start_bb (bb); !gsi_end_p (i); gsi_next (&i))
1173 gimple stmt = gsi_stmt (i);
1175 if (gimple_code (stmt) != GIMPLE_LABEL)
1178 label = gimple_label_label (stmt);
1180 /* If we have not yet seen a label for the current block,
1181 remember this one and see if there are more labels. */
1182 if (!label_for_bb[bb->index].label)
1184 label_for_bb[bb->index].label = label;
1188 /* If we did see a label for the current block already, but it
1189 is an artificially created label, replace it if the current
1190 label is a user defined label. */
1191 if (!DECL_ARTIFICIAL (label)
1192 && DECL_ARTIFICIAL (label_for_bb[bb->index].label))
1194 label_for_bb[bb->index].label = label;
1200 /* Now redirect all jumps/branches to the selected label.
1201 First do so for each block ending in a control statement. */
1204 gimple stmt = last_stmt (bb);
1208 switch (gimple_code (stmt))
1212 tree true_label = gimple_cond_true_label (stmt);
1213 tree false_label = gimple_cond_false_label (stmt);
1216 gimple_cond_set_true_label (stmt, main_block_label (true_label));
1218 gimple_cond_set_false_label (stmt, main_block_label (false_label));
1224 size_t i, n = gimple_switch_num_labels (stmt);
1226 /* Replace all destination labels. */
1227 for (i = 0; i < n; ++i)
1229 tree case_label = gimple_switch_label (stmt, i);
1230 tree label = main_block_label (CASE_LABEL (case_label));
1231 CASE_LABEL (case_label) = label;
1238 int i, n = gimple_asm_nlabels (stmt);
1240 for (i = 0; i < n; ++i)
1242 tree cons = gimple_asm_label_op (stmt, i);
1243 tree label = main_block_label (TREE_VALUE (cons));
1244 TREE_VALUE (cons) = label;
1249 /* We have to handle gotos until they're removed, and we don't
1250 remove them until after we've created the CFG edges. */
1252 if (!computed_goto_p (stmt))
1254 tree new_dest = main_block_label (gimple_goto_dest (stmt));
1255 gimple_goto_set_dest (stmt, new_dest);
1264 /* Do the same for the exception region tree labels. */
1265 cleanup_dead_labels_eh ();
1267 /* Finally, purge dead labels. All user-defined labels and labels that
1268 can be the target of non-local gotos and labels which have their
1269 address taken are preserved. */
1272 gimple_stmt_iterator i;
1273 tree label_for_this_bb = label_for_bb[bb->index].label;
1275 if (!label_for_this_bb)
1278 /* If the main label of the block is unused, we may still remove it. */
1279 if (!label_for_bb[bb->index].used)
1280 label_for_this_bb = NULL;
1282 for (i = gsi_start_bb (bb); !gsi_end_p (i); )
1285 gimple stmt = gsi_stmt (i);
1287 if (gimple_code (stmt) != GIMPLE_LABEL)
1290 label = gimple_label_label (stmt);
1292 if (label == label_for_this_bb
1293 || !DECL_ARTIFICIAL (label)
1294 || DECL_NONLOCAL (label)
1295 || FORCED_LABEL (label))
1298 gsi_remove (&i, true);
1302 free (label_for_bb);
1305 /* Scan the sorted vector of cases in STMT (a GIMPLE_SWITCH) and combine
1306 the ones jumping to the same label.
1307 Eg. three separate entries 1: 2: 3: become one entry 1..3: */
1310 group_case_labels_stmt (gimple stmt)
1312 int old_size = gimple_switch_num_labels (stmt);
1313 int i, j, new_size = old_size;
1314 tree default_case = NULL_TREE;
1315 tree default_label = NULL_TREE;
1318 /* The default label is always the first case in a switch
1319 statement after gimplification if it was not optimized
1321 if (!CASE_LOW (gimple_switch_default_label (stmt))
1322 && !CASE_HIGH (gimple_switch_default_label (stmt)))
1324 default_case = gimple_switch_default_label (stmt);
1325 default_label = CASE_LABEL (default_case);
1329 has_default = false;
1331 /* Look for possible opportunities to merge cases. */
1336 while (i < old_size)
1338 tree base_case, base_label, base_high;
1339 base_case = gimple_switch_label (stmt, i);
1341 gcc_assert (base_case);
1342 base_label = CASE_LABEL (base_case);
1344 /* Discard cases that have the same destination as the
1346 if (base_label == default_label)
1348 gimple_switch_set_label (stmt, i, NULL_TREE);
1354 base_high = CASE_HIGH (base_case)
1355 ? CASE_HIGH (base_case)
1356 : CASE_LOW (base_case);
1359 /* Try to merge case labels. Break out when we reach the end
1360 of the label vector or when we cannot merge the next case
1361 label with the current one. */
1362 while (i < old_size)
1364 tree merge_case = gimple_switch_label (stmt, i);
1365 tree merge_label = CASE_LABEL (merge_case);
1366 tree t = int_const_binop (PLUS_EXPR, base_high,
1367 integer_one_node, 1);
1369 /* Merge the cases if they jump to the same place,
1370 and their ranges are consecutive. */
1371 if (merge_label == base_label
1372 && tree_int_cst_equal (CASE_LOW (merge_case), t))
1374 base_high = CASE_HIGH (merge_case) ?
1375 CASE_HIGH (merge_case) : CASE_LOW (merge_case);
1376 CASE_HIGH (base_case) = base_high;
1377 gimple_switch_set_label (stmt, i, NULL_TREE);
1386 /* Compress the case labels in the label vector, and adjust the
1387 length of the vector. */
1388 for (i = 0, j = 0; i < new_size; i++)
1390 while (! gimple_switch_label (stmt, j))
1392 gimple_switch_set_label (stmt, i,
1393 gimple_switch_label (stmt, j++));
1396 gcc_assert (new_size <= old_size);
1397 gimple_switch_set_num_labels (stmt, new_size);
1400 /* Look for blocks ending in a multiway branch (a GIMPLE_SWITCH),
1401 and scan the sorted vector of cases. Combine the ones jumping to the
1405 group_case_labels (void)
1411 gimple stmt = last_stmt (bb);
1412 if (stmt && gimple_code (stmt) == GIMPLE_SWITCH)
1413 group_case_labels_stmt (stmt);
1417 /* Checks whether we can merge block B into block A. */
1420 gimple_can_merge_blocks_p (basic_block a, basic_block b)
1423 gimple_stmt_iterator gsi;
1426 if (!single_succ_p (a))
1429 if (single_succ_edge (a)->flags & (EDGE_ABNORMAL | EDGE_EH))
1432 if (single_succ (a) != b)
1435 if (!single_pred_p (b))
1438 if (b == EXIT_BLOCK_PTR)
1441 /* If A ends by a statement causing exceptions or something similar, we
1442 cannot merge the blocks. */
1443 stmt = last_stmt (a);
1444 if (stmt && stmt_ends_bb_p (stmt))
1447 /* Do not allow a block with only a non-local label to be merged. */
1449 && gimple_code (stmt) == GIMPLE_LABEL
1450 && DECL_NONLOCAL (gimple_label_label (stmt)))
1453 /* Examine the labels at the beginning of B. */
1454 for (gsi = gsi_start_bb (b); !gsi_end_p (gsi); gsi_next (&gsi))
1457 stmt = gsi_stmt (gsi);
1458 if (gimple_code (stmt) != GIMPLE_LABEL)
1460 lab = gimple_label_label (stmt);
1462 /* Do not remove user labels. */
1463 if (!DECL_ARTIFICIAL (lab))
1467 /* Protect the loop latches. */
1468 if (current_loops && b->loop_father->latch == b)
1471 /* It must be possible to eliminate all phi nodes in B. If ssa form
1472 is not up-to-date and a name-mapping is registered, we cannot eliminate
1473 any phis. Symbols marked for renaming are never a problem though. */
1474 phis = phi_nodes (b);
1475 if (!gimple_seq_empty_p (phis)
1476 && name_mappings_registered_p ())
1479 /* When not optimizing, don't merge if we'd lose goto_locus. */
1481 && single_succ_edge (a)->goto_locus != UNKNOWN_LOCATION)
1483 location_t goto_locus = single_succ_edge (a)->goto_locus;
1484 gimple_stmt_iterator prev, next;
1485 prev = gsi_last_nondebug_bb (a);
1486 next = gsi_after_labels (b);
1487 if (!gsi_end_p (next) && is_gimple_debug (gsi_stmt (next)))
1488 gsi_next_nondebug (&next);
1489 if ((gsi_end_p (prev)
1490 || gimple_location (gsi_stmt (prev)) != goto_locus)
1491 && (gsi_end_p (next)
1492 || gimple_location (gsi_stmt (next)) != goto_locus))
1499 /* Return true if the var whose chain of uses starts at PTR has no
1502 has_zero_uses_1 (const ssa_use_operand_t *head)
1504 const ssa_use_operand_t *ptr;
1506 for (ptr = head->next; ptr != head; ptr = ptr->next)
1507 if (!is_gimple_debug (USE_STMT (ptr)))
1513 /* Return true if the var whose chain of uses starts at PTR has a
1514 single nondebug use. Set USE_P and STMT to that single nondebug
1515 use, if so, or to NULL otherwise. */
1517 single_imm_use_1 (const ssa_use_operand_t *head,
1518 use_operand_p *use_p, gimple *stmt)
1520 ssa_use_operand_t *ptr, *single_use = 0;
1522 for (ptr = head->next; ptr != head; ptr = ptr->next)
1523 if (!is_gimple_debug (USE_STMT (ptr)))
1534 *use_p = single_use;
1537 *stmt = single_use ? single_use->loc.stmt : NULL;
1539 return !!single_use;
1542 /* Replaces all uses of NAME by VAL. */
1545 replace_uses_by (tree name, tree val)
1547 imm_use_iterator imm_iter;
1552 FOR_EACH_IMM_USE_STMT (stmt, imm_iter, name)
1554 FOR_EACH_IMM_USE_ON_STMT (use, imm_iter)
1556 replace_exp (use, val);
1558 if (gimple_code (stmt) == GIMPLE_PHI)
1560 e = gimple_phi_arg_edge (stmt, PHI_ARG_INDEX_FROM_USE (use));
1561 if (e->flags & EDGE_ABNORMAL)
1563 /* This can only occur for virtual operands, since
1564 for the real ones SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name))
1565 would prevent replacement. */
1566 gcc_assert (!is_gimple_reg (name));
1567 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (val) = 1;
1572 if (gimple_code (stmt) != GIMPLE_PHI)
1576 fold_stmt_inplace (stmt);
1577 if (cfgcleanup_altered_bbs)
1578 bitmap_set_bit (cfgcleanup_altered_bbs, gimple_bb (stmt)->index);
1580 /* FIXME. This should go in update_stmt. */
1581 for (i = 0; i < gimple_num_ops (stmt); i++)
1583 tree op = gimple_op (stmt, i);
1584 /* Operands may be empty here. For example, the labels
1585 of a GIMPLE_COND are nulled out following the creation
1586 of the corresponding CFG edges. */
1587 if (op && TREE_CODE (op) == ADDR_EXPR)
1588 recompute_tree_invariant_for_addr_expr (op);
1591 maybe_clean_or_replace_eh_stmt (stmt, stmt);
1596 gcc_assert (has_zero_uses (name));
1598 /* Also update the trees stored in loop structures. */
1604 FOR_EACH_LOOP (li, loop, 0)
1606 substitute_in_loop_info (loop, name, val);
1611 /* Merge block B into block A. */
1614 gimple_merge_blocks (basic_block a, basic_block b)
1616 gimple_stmt_iterator last, gsi, psi;
1617 gimple_seq phis = phi_nodes (b);
1620 fprintf (dump_file, "Merging blocks %d and %d\n", a->index, b->index);
1622 /* Remove all single-valued PHI nodes from block B of the form
1623 V_i = PHI <V_j> by propagating V_j to all the uses of V_i. */
1624 gsi = gsi_last_bb (a);
1625 for (psi = gsi_start (phis); !gsi_end_p (psi); )
1627 gimple phi = gsi_stmt (psi);
1628 tree def = gimple_phi_result (phi), use = gimple_phi_arg_def (phi, 0);
1630 bool may_replace_uses = !is_gimple_reg (def)
1631 || may_propagate_copy (def, use);
1633 /* In case we maintain loop closed ssa form, do not propagate arguments
1634 of loop exit phi nodes. */
1636 && loops_state_satisfies_p (LOOP_CLOSED_SSA)
1637 && is_gimple_reg (def)
1638 && TREE_CODE (use) == SSA_NAME
1639 && a->loop_father != b->loop_father)
1640 may_replace_uses = false;
1642 if (!may_replace_uses)
1644 gcc_assert (is_gimple_reg (def));
1646 /* Note that just emitting the copies is fine -- there is no problem
1647 with ordering of phi nodes. This is because A is the single
1648 predecessor of B, therefore results of the phi nodes cannot
1649 appear as arguments of the phi nodes. */
1650 copy = gimple_build_assign (def, use);
1651 gsi_insert_after (&gsi, copy, GSI_NEW_STMT);
1652 remove_phi_node (&psi, false);
1656 /* If we deal with a PHI for virtual operands, we can simply
1657 propagate these without fussing with folding or updating
1659 if (!is_gimple_reg (def))
1661 imm_use_iterator iter;
1662 use_operand_p use_p;
1665 FOR_EACH_IMM_USE_STMT (stmt, iter, def)
1666 FOR_EACH_IMM_USE_ON_STMT (use_p, iter)
1667 SET_USE (use_p, use);
1669 if (SSA_NAME_OCCURS_IN_ABNORMAL_PHI (def))
1670 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (use) = 1;
1673 replace_uses_by (def, use);
1675 remove_phi_node (&psi, true);
1679 /* Ensure that B follows A. */
1680 move_block_after (b, a);
1682 gcc_assert (single_succ_edge (a)->flags & EDGE_FALLTHRU);
1683 gcc_assert (!last_stmt (a) || !stmt_ends_bb_p (last_stmt (a)));
1685 /* Remove labels from B and set gimple_bb to A for other statements. */
1686 for (gsi = gsi_start_bb (b); !gsi_end_p (gsi);)
1688 gimple stmt = gsi_stmt (gsi);
1689 if (gimple_code (stmt) == GIMPLE_LABEL)
1691 tree label = gimple_label_label (stmt);
1694 gsi_remove (&gsi, false);
1696 /* Now that we can thread computed gotos, we might have
1697 a situation where we have a forced label in block B
1698 However, the label at the start of block B might still be
1699 used in other ways (think about the runtime checking for
1700 Fortran assigned gotos). So we can not just delete the
1701 label. Instead we move the label to the start of block A. */
1702 if (FORCED_LABEL (label))
1704 gimple_stmt_iterator dest_gsi = gsi_start_bb (a);
1705 gsi_insert_before (&dest_gsi, stmt, GSI_NEW_STMT);
1708 lp_nr = EH_LANDING_PAD_NR (label);
1711 eh_landing_pad lp = get_eh_landing_pad_from_number (lp_nr);
1712 lp->post_landing_pad = NULL;
1717 gimple_set_bb (stmt, a);
1722 /* Merge the sequences. */
1723 last = gsi_last_bb (a);
1724 gsi_insert_seq_after (&last, bb_seq (b), GSI_NEW_STMT);
1725 set_bb_seq (b, NULL);
1727 if (cfgcleanup_altered_bbs)
1728 bitmap_set_bit (cfgcleanup_altered_bbs, a->index);
1732 /* Return the one of two successors of BB that is not reachable by a
1733 complex edge, if there is one. Else, return BB. We use
1734 this in optimizations that use post-dominators for their heuristics,
1735 to catch the cases in C++ where function calls are involved. */
1738 single_noncomplex_succ (basic_block bb)
1741 if (EDGE_COUNT (bb->succs) != 2)
1744 e0 = EDGE_SUCC (bb, 0);
1745 e1 = EDGE_SUCC (bb, 1);
1746 if (e0->flags & EDGE_COMPLEX)
1748 if (e1->flags & EDGE_COMPLEX)
1754 /* T is CALL_EXPR. Set current_function_calls_* flags. */
1757 notice_special_calls (gimple call)
1759 int flags = gimple_call_flags (call);
1761 if (flags & ECF_MAY_BE_ALLOCA)
1762 cfun->calls_alloca = true;
1763 if (flags & ECF_RETURNS_TWICE)
1764 cfun->calls_setjmp = true;
1768 /* Clear flags set by notice_special_calls. Used by dead code removal
1769 to update the flags. */
1772 clear_special_calls (void)
1774 cfun->calls_alloca = false;
1775 cfun->calls_setjmp = false;
1778 /* Remove PHI nodes associated with basic block BB and all edges out of BB. */
1781 remove_phi_nodes_and_edges_for_unreachable_block (basic_block bb)
1783 /* Since this block is no longer reachable, we can just delete all
1784 of its PHI nodes. */
1785 remove_phi_nodes (bb);
1787 /* Remove edges to BB's successors. */
1788 while (EDGE_COUNT (bb->succs) > 0)
1789 remove_edge (EDGE_SUCC (bb, 0));
1793 /* Remove statements of basic block BB. */
1796 remove_bb (basic_block bb)
1798 gimple_stmt_iterator i;
1802 fprintf (dump_file, "Removing basic block %d\n", bb->index);
1803 if (dump_flags & TDF_DETAILS)
1805 dump_bb (bb, dump_file, 0);
1806 fprintf (dump_file, "\n");
1812 struct loop *loop = bb->loop_father;
1814 /* If a loop gets removed, clean up the information associated
1816 if (loop->latch == bb
1817 || loop->header == bb)
1818 free_numbers_of_iterations_estimates_loop (loop);
1821 /* Remove all the instructions in the block. */
1822 if (bb_seq (bb) != NULL)
1824 /* Walk backwards so as to get a chance to substitute all
1825 released DEFs into debug stmts. See
1826 eliminate_unnecessary_stmts() in tree-ssa-dce.c for more
1828 for (i = gsi_last_bb (bb); !gsi_end_p (i);)
1830 gimple stmt = gsi_stmt (i);
1831 if (gimple_code (stmt) == GIMPLE_LABEL
1832 && (FORCED_LABEL (gimple_label_label (stmt))
1833 || DECL_NONLOCAL (gimple_label_label (stmt))))
1836 gimple_stmt_iterator new_gsi;
1838 /* A non-reachable non-local label may still be referenced.
1839 But it no longer needs to carry the extra semantics of
1841 if (DECL_NONLOCAL (gimple_label_label (stmt)))
1843 DECL_NONLOCAL (gimple_label_label (stmt)) = 0;
1844 FORCED_LABEL (gimple_label_label (stmt)) = 1;
1847 new_bb = bb->prev_bb;
1848 new_gsi = gsi_start_bb (new_bb);
1849 gsi_remove (&i, false);
1850 gsi_insert_before (&new_gsi, stmt, GSI_NEW_STMT);
1854 /* Release SSA definitions if we are in SSA. Note that we
1855 may be called when not in SSA. For example,
1856 final_cleanup calls this function via
1857 cleanup_tree_cfg. */
1858 if (gimple_in_ssa_p (cfun))
1859 release_defs (stmt);
1861 gsi_remove (&i, true);
1865 i = gsi_last_bb (bb);
1871 remove_phi_nodes_and_edges_for_unreachable_block (bb);
1872 bb->il.gimple = NULL;
1876 /* Given a basic block BB ending with COND_EXPR or SWITCH_EXPR, and a
1877 predicate VAL, return the edge that will be taken out of the block.
1878 If VAL does not match a unique edge, NULL is returned. */
1881 find_taken_edge (basic_block bb, tree val)
1885 stmt = last_stmt (bb);
1888 gcc_assert (is_ctrl_stmt (stmt));
1893 if (!is_gimple_min_invariant (val))
1896 if (gimple_code (stmt) == GIMPLE_COND)
1897 return find_taken_edge_cond_expr (bb, val);
1899 if (gimple_code (stmt) == GIMPLE_SWITCH)
1900 return find_taken_edge_switch_expr (bb, val);
1902 if (computed_goto_p (stmt))
1904 /* Only optimize if the argument is a label, if the argument is
1905 not a label then we can not construct a proper CFG.
1907 It may be the case that we only need to allow the LABEL_REF to
1908 appear inside an ADDR_EXPR, but we also allow the LABEL_REF to
1909 appear inside a LABEL_EXPR just to be safe. */
1910 if ((TREE_CODE (val) == ADDR_EXPR || TREE_CODE (val) == LABEL_EXPR)
1911 && TREE_CODE (TREE_OPERAND (val, 0)) == LABEL_DECL)
1912 return find_taken_edge_computed_goto (bb, TREE_OPERAND (val, 0));
1919 /* Given a constant value VAL and the entry block BB to a GOTO_EXPR
1920 statement, determine which of the outgoing edges will be taken out of the
1921 block. Return NULL if either edge may be taken. */
1924 find_taken_edge_computed_goto (basic_block bb, tree val)
1929 dest = label_to_block (val);
1932 e = find_edge (bb, dest);
1933 gcc_assert (e != NULL);
1939 /* Given a constant value VAL and the entry block BB to a COND_EXPR
1940 statement, determine which of the two edges will be taken out of the
1941 block. Return NULL if either edge may be taken. */
1944 find_taken_edge_cond_expr (basic_block bb, tree val)
1946 edge true_edge, false_edge;
1948 extract_true_false_edges_from_block (bb, &true_edge, &false_edge);
1950 gcc_assert (TREE_CODE (val) == INTEGER_CST);
1951 return (integer_zerop (val) ? false_edge : true_edge);
1954 /* Given an INTEGER_CST VAL and the entry block BB to a SWITCH_EXPR
1955 statement, determine which edge will be taken out of the block. Return
1956 NULL if any edge may be taken. */
1959 find_taken_edge_switch_expr (basic_block bb, tree val)
1961 basic_block dest_bb;
1966 switch_stmt = last_stmt (bb);
1967 taken_case = find_case_label_for_value (switch_stmt, val);
1968 dest_bb = label_to_block (CASE_LABEL (taken_case));
1970 e = find_edge (bb, dest_bb);
1976 /* Return the CASE_LABEL_EXPR that SWITCH_STMT will take for VAL.
1977 We can make optimal use here of the fact that the case labels are
1978 sorted: We can do a binary search for a case matching VAL. */
1981 find_case_label_for_value (gimple switch_stmt, tree val)
1983 size_t low, high, n = gimple_switch_num_labels (switch_stmt);
1984 tree default_case = gimple_switch_default_label (switch_stmt);
1986 for (low = 0, high = n; high - low > 1; )
1988 size_t i = (high + low) / 2;
1989 tree t = gimple_switch_label (switch_stmt, i);
1992 /* Cache the result of comparing CASE_LOW and val. */
1993 cmp = tree_int_cst_compare (CASE_LOW (t), val);
2000 if (CASE_HIGH (t) == NULL)
2002 /* A singe-valued case label. */
2008 /* A case range. We can only handle integer ranges. */
2009 if (cmp <= 0 && tree_int_cst_compare (CASE_HIGH (t), val) >= 0)
2014 return default_case;
2018 /* Dump a basic block on stderr. */
2021 gimple_debug_bb (basic_block bb)
2023 gimple_dump_bb (bb, stderr, 0, TDF_VOPS|TDF_MEMSYMS);
2027 /* Dump basic block with index N on stderr. */
2030 gimple_debug_bb_n (int n)
2032 gimple_debug_bb (BASIC_BLOCK (n));
2033 return BASIC_BLOCK (n);
2037 /* Dump the CFG on stderr.
2039 FLAGS are the same used by the tree dumping functions
2040 (see TDF_* in tree-pass.h). */
2043 gimple_debug_cfg (int flags)
2045 gimple_dump_cfg (stderr, flags);
2049 /* Dump the program showing basic block boundaries on the given FILE.
2051 FLAGS are the same used by the tree dumping functions (see TDF_* in
2055 gimple_dump_cfg (FILE *file, int flags)
2057 if (flags & TDF_DETAILS)
2059 const char *funcname
2060 = lang_hooks.decl_printable_name (current_function_decl, 2);
2063 fprintf (file, ";; Function %s\n\n", funcname);
2064 fprintf (file, ";; \n%d basic blocks, %d edges, last basic block %d.\n\n",
2065 n_basic_blocks, n_edges, last_basic_block);
2067 brief_dump_cfg (file);
2068 fprintf (file, "\n");
2071 if (flags & TDF_STATS)
2072 dump_cfg_stats (file);
2074 dump_function_to_file (current_function_decl, file, flags | TDF_BLOCKS);
2078 /* Dump CFG statistics on FILE. */
2081 dump_cfg_stats (FILE *file)
2083 static long max_num_merged_labels = 0;
2084 unsigned long size, total = 0;
2087 const char * const fmt_str = "%-30s%-13s%12s\n";
2088 const char * const fmt_str_1 = "%-30s%13d%11lu%c\n";
2089 const char * const fmt_str_2 = "%-30s%13ld%11lu%c\n";
2090 const char * const fmt_str_3 = "%-43s%11lu%c\n";
2091 const char *funcname
2092 = lang_hooks.decl_printable_name (current_function_decl, 2);
2095 fprintf (file, "\nCFG Statistics for %s\n\n", funcname);
2097 fprintf (file, "---------------------------------------------------------\n");
2098 fprintf (file, fmt_str, "", " Number of ", "Memory");
2099 fprintf (file, fmt_str, "", " instances ", "used ");
2100 fprintf (file, "---------------------------------------------------------\n");
2102 size = n_basic_blocks * sizeof (struct basic_block_def);
2104 fprintf (file, fmt_str_1, "Basic blocks", n_basic_blocks,
2105 SCALE (size), LABEL (size));
2109 num_edges += EDGE_COUNT (bb->succs);
2110 size = num_edges * sizeof (struct edge_def);
2112 fprintf (file, fmt_str_2, "Edges", num_edges, SCALE (size), LABEL (size));
2114 fprintf (file, "---------------------------------------------------------\n");
2115 fprintf (file, fmt_str_3, "Total memory used by CFG data", SCALE (total),
2117 fprintf (file, "---------------------------------------------------------\n");
2118 fprintf (file, "\n");
2120 if (cfg_stats.num_merged_labels > max_num_merged_labels)
2121 max_num_merged_labels = cfg_stats.num_merged_labels;
2123 fprintf (file, "Coalesced label blocks: %ld (Max so far: %ld)\n",
2124 cfg_stats.num_merged_labels, max_num_merged_labels);
2126 fprintf (file, "\n");
2130 /* Dump CFG statistics on stderr. Keep extern so that it's always
2131 linked in the final executable. */
2134 debug_cfg_stats (void)
2136 dump_cfg_stats (stderr);
2140 /* Dump the flowgraph to a .vcg FILE. */
2143 gimple_cfg2vcg (FILE *file)
2148 const char *funcname
2149 = lang_hooks.decl_printable_name (current_function_decl, 2);
2151 /* Write the file header. */
2152 fprintf (file, "graph: { title: \"%s\"\n", funcname);
2153 fprintf (file, "node: { title: \"ENTRY\" label: \"ENTRY\" }\n");
2154 fprintf (file, "node: { title: \"EXIT\" label: \"EXIT\" }\n");
2156 /* Write blocks and edges. */
2157 FOR_EACH_EDGE (e, ei, ENTRY_BLOCK_PTR->succs)
2159 fprintf (file, "edge: { sourcename: \"ENTRY\" targetname: \"%d\"",
2162 if (e->flags & EDGE_FAKE)
2163 fprintf (file, " linestyle: dotted priority: 10");
2165 fprintf (file, " linestyle: solid priority: 100");
2167 fprintf (file, " }\n");
2173 enum gimple_code head_code, end_code;
2174 const char *head_name, *end_name;
2177 gimple first = first_stmt (bb);
2178 gimple last = last_stmt (bb);
2182 head_code = gimple_code (first);
2183 head_name = gimple_code_name[head_code];
2184 head_line = get_lineno (first);
2187 head_name = "no-statement";
2191 end_code = gimple_code (last);
2192 end_name = gimple_code_name[end_code];
2193 end_line = get_lineno (last);
2196 end_name = "no-statement";
2198 fprintf (file, "node: { title: \"%d\" label: \"#%d\\n%s (%d)\\n%s (%d)\"}\n",
2199 bb->index, bb->index, head_name, head_line, end_name,
2202 FOR_EACH_EDGE (e, ei, bb->succs)
2204 if (e->dest == EXIT_BLOCK_PTR)
2205 fprintf (file, "edge: { sourcename: \"%d\" targetname: \"EXIT\"", bb->index);
2207 fprintf (file, "edge: { sourcename: \"%d\" targetname: \"%d\"", bb->index, e->dest->index);
2209 if (e->flags & EDGE_FAKE)
2210 fprintf (file, " priority: 10 linestyle: dotted");
2212 fprintf (file, " priority: 100 linestyle: solid");
2214 fprintf (file, " }\n");
2217 if (bb->next_bb != EXIT_BLOCK_PTR)
2221 fputs ("}\n\n", file);
2226 /*---------------------------------------------------------------------------
2227 Miscellaneous helpers
2228 ---------------------------------------------------------------------------*/
2230 /* Return true if T represents a stmt that always transfers control. */
2233 is_ctrl_stmt (gimple t)
2235 switch (gimple_code (t))
2249 /* Return true if T is a statement that may alter the flow of control
2250 (e.g., a call to a non-returning function). */
2253 is_ctrl_altering_stmt (gimple t)
2257 switch (gimple_code (t))
2261 int flags = gimple_call_flags (t);
2263 /* A non-pure/const call alters flow control if the current
2264 function has nonlocal labels. */
2265 if (!(flags & (ECF_CONST | ECF_PURE)) && cfun->has_nonlocal_label)
2268 /* A call also alters control flow if it does not return. */
2269 if (flags & ECF_NORETURN)
2272 /* BUILT_IN_RETURN call is same as return statement. */
2273 if (gimple_call_builtin_p (t, BUILT_IN_RETURN))
2278 case GIMPLE_EH_DISPATCH:
2279 /* EH_DISPATCH branches to the individual catch handlers at
2280 this level of a try or allowed-exceptions region. It can
2281 fallthru to the next statement as well. */
2285 if (gimple_asm_nlabels (t) > 0)
2290 /* OpenMP directives alter control flow. */
2297 /* If a statement can throw, it alters control flow. */
2298 return stmt_can_throw_internal (t);
2302 /* Return true if T is a simple local goto. */
2305 simple_goto_p (gimple t)
2307 return (gimple_code (t) == GIMPLE_GOTO
2308 && TREE_CODE (gimple_goto_dest (t)) == LABEL_DECL);
2312 /* Return true if T can make an abnormal transfer of control flow.
2313 Transfers of control flow associated with EH are excluded. */
2316 stmt_can_make_abnormal_goto (gimple t)
2318 if (computed_goto_p (t))
2320 if (is_gimple_call (t))
2321 return gimple_has_side_effects (t) && cfun->has_nonlocal_label;
2326 /* Return true if STMT should start a new basic block. PREV_STMT is
2327 the statement preceding STMT. It is used when STMT is a label or a
2328 case label. Labels should only start a new basic block if their
2329 previous statement wasn't a label. Otherwise, sequence of labels
2330 would generate unnecessary basic blocks that only contain a single
2334 stmt_starts_bb_p (gimple stmt, gimple prev_stmt)
2339 /* Labels start a new basic block only if the preceding statement
2340 wasn't a label of the same type. This prevents the creation of
2341 consecutive blocks that have nothing but a single label. */
2342 if (gimple_code (stmt) == GIMPLE_LABEL)
2344 /* Nonlocal and computed GOTO targets always start a new block. */
2345 if (DECL_NONLOCAL (gimple_label_label (stmt))
2346 || FORCED_LABEL (gimple_label_label (stmt)))
2349 if (prev_stmt && gimple_code (prev_stmt) == GIMPLE_LABEL)
2351 if (DECL_NONLOCAL (gimple_label_label (prev_stmt)))
2354 cfg_stats.num_merged_labels++;
2365 /* Return true if T should end a basic block. */
2368 stmt_ends_bb_p (gimple t)
2370 return is_ctrl_stmt (t) || is_ctrl_altering_stmt (t);
2373 /* Remove block annotations and other data structures. */
2376 delete_tree_cfg_annotations (void)
2378 label_to_block_map = NULL;
2382 /* Return the first statement in basic block BB. */
2385 first_stmt (basic_block bb)
2387 gimple_stmt_iterator i = gsi_start_bb (bb);
2390 while (!gsi_end_p (i) && is_gimple_debug ((stmt = gsi_stmt (i))))
2398 /* Return the first non-label statement in basic block BB. */
2401 first_non_label_stmt (basic_block bb)
2403 gimple_stmt_iterator i = gsi_start_bb (bb);
2404 while (!gsi_end_p (i) && gimple_code (gsi_stmt (i)) == GIMPLE_LABEL)
2406 return !gsi_end_p (i) ? gsi_stmt (i) : NULL;
2409 /* Return the last statement in basic block BB. */
2412 last_stmt (basic_block bb)
2414 gimple_stmt_iterator i = gsi_last_bb (bb);
2417 while (!gsi_end_p (i) && is_gimple_debug ((stmt = gsi_stmt (i))))
2425 /* Return the last statement of an otherwise empty block. Return NULL
2426 if the block is totally empty, or if it contains more than one
2430 last_and_only_stmt (basic_block bb)
2432 gimple_stmt_iterator i = gsi_last_nondebug_bb (bb);
2438 last = gsi_stmt (i);
2439 gsi_prev_nondebug (&i);
2443 /* Empty statements should no longer appear in the instruction stream.
2444 Everything that might have appeared before should be deleted by
2445 remove_useless_stmts, and the optimizers should just gsi_remove
2446 instead of smashing with build_empty_stmt.
2448 Thus the only thing that should appear here in a block containing
2449 one executable statement is a label. */
2450 prev = gsi_stmt (i);
2451 if (gimple_code (prev) == GIMPLE_LABEL)
2457 /* Reinstall those PHI arguments queued in OLD_EDGE to NEW_EDGE. */
2460 reinstall_phi_args (edge new_edge, edge old_edge)
2462 edge_var_map_vector v;
2465 gimple_stmt_iterator phis;
2467 v = redirect_edge_var_map_vector (old_edge);
2471 for (i = 0, phis = gsi_start_phis (new_edge->dest);
2472 VEC_iterate (edge_var_map, v, i, vm) && !gsi_end_p (phis);
2473 i++, gsi_next (&phis))
2475 gimple phi = gsi_stmt (phis);
2476 tree result = redirect_edge_var_map_result (vm);
2477 tree arg = redirect_edge_var_map_def (vm);
2479 gcc_assert (result == gimple_phi_result (phi));
2481 add_phi_arg (phi, arg, new_edge, redirect_edge_var_map_location (vm));
2484 redirect_edge_var_map_clear (old_edge);
2487 /* Returns the basic block after which the new basic block created
2488 by splitting edge EDGE_IN should be placed. Tries to keep the new block
2489 near its "logical" location. This is of most help to humans looking
2490 at debugging dumps. */
2493 split_edge_bb_loc (edge edge_in)
2495 basic_block dest = edge_in->dest;
2496 basic_block dest_prev = dest->prev_bb;
2500 edge e = find_edge (dest_prev, dest);
2501 if (e && !(e->flags & EDGE_COMPLEX))
2502 return edge_in->src;
2507 /* Split a (typically critical) edge EDGE_IN. Return the new block.
2508 Abort on abnormal edges. */
2511 gimple_split_edge (edge edge_in)
2513 basic_block new_bb, after_bb, dest;
2516 /* Abnormal edges cannot be split. */
2517 gcc_assert (!(edge_in->flags & EDGE_ABNORMAL));
2519 dest = edge_in->dest;
2521 after_bb = split_edge_bb_loc (edge_in);
2523 new_bb = create_empty_bb (after_bb);
2524 new_bb->frequency = EDGE_FREQUENCY (edge_in);
2525 new_bb->count = edge_in->count;
2526 new_edge = make_edge (new_bb, dest, EDGE_FALLTHRU);
2527 new_edge->probability = REG_BR_PROB_BASE;
2528 new_edge->count = edge_in->count;
2530 e = redirect_edge_and_branch (edge_in, new_bb);
2531 gcc_assert (e == edge_in);
2532 reinstall_phi_args (new_edge, e);
2538 /* Verify properties of the address expression T with base object BASE. */
2541 verify_address (tree t, tree base)
2544 bool old_side_effects;
2546 bool new_side_effects;
2548 old_constant = TREE_CONSTANT (t);
2549 old_side_effects = TREE_SIDE_EFFECTS (t);
2551 recompute_tree_invariant_for_addr_expr (t);
2552 new_side_effects = TREE_SIDE_EFFECTS (t);
2553 new_constant = TREE_CONSTANT (t);
2555 if (old_constant != new_constant)
2557 error ("constant not recomputed when ADDR_EXPR changed");
2560 if (old_side_effects != new_side_effects)
2562 error ("side effects not recomputed when ADDR_EXPR changed");
2566 if (!(TREE_CODE (base) == VAR_DECL
2567 || TREE_CODE (base) == PARM_DECL
2568 || TREE_CODE (base) == RESULT_DECL))
2571 if (DECL_GIMPLE_REG_P (base))
2573 error ("DECL_GIMPLE_REG_P set on a variable with address taken");
2580 /* Callback for walk_tree, check that all elements with address taken are
2581 properly noticed as such. The DATA is an int* that is 1 if TP was seen
2582 inside a PHI node. */
2585 verify_expr (tree *tp, int *walk_subtrees, void *data ATTRIBUTE_UNUSED)
2592 /* Check operand N for being valid GIMPLE and give error MSG if not. */
2593 #define CHECK_OP(N, MSG) \
2594 do { if (!is_gimple_val (TREE_OPERAND (t, N))) \
2595 { error (MSG); return TREE_OPERAND (t, N); }} while (0)
2597 switch (TREE_CODE (t))
2600 if (SSA_NAME_IN_FREE_LIST (t))
2602 error ("SSA name in freelist but still referenced");
2608 error ("INDIRECT_REF in gimple IL");
2612 x = TREE_OPERAND (t, 0);
2613 if (!POINTER_TYPE_P (TREE_TYPE (x))
2614 || !is_gimple_mem_ref_addr (x))
2616 error ("Invalid first operand of MEM_REF.");
2619 if (TREE_CODE (TREE_OPERAND (t, 1)) != INTEGER_CST
2620 || !POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (t, 1))))
2622 error ("Invalid offset operand of MEM_REF.");
2623 return TREE_OPERAND (t, 1);
2625 if (TREE_CODE (x) == ADDR_EXPR
2626 && (x = verify_address (x, TREE_OPERAND (x, 0))))
2632 x = fold (ASSERT_EXPR_COND (t));
2633 if (x == boolean_false_node)
2635 error ("ASSERT_EXPR with an always-false condition");
2641 error ("MODIFY_EXPR not expected while having tuples.");
2648 gcc_assert (is_gimple_address (t));
2650 /* Skip any references (they will be checked when we recurse down the
2651 tree) and ensure that any variable used as a prefix is marked
2653 for (x = TREE_OPERAND (t, 0);
2654 handled_component_p (x);
2655 x = TREE_OPERAND (x, 0))
2658 if ((tem = verify_address (t, x)))
2661 if (!(TREE_CODE (x) == VAR_DECL
2662 || TREE_CODE (x) == PARM_DECL
2663 || TREE_CODE (x) == RESULT_DECL))
2666 if (!TREE_ADDRESSABLE (x))
2668 error ("address taken, but ADDRESSABLE bit not set");
2676 x = COND_EXPR_COND (t);
2677 if (!INTEGRAL_TYPE_P (TREE_TYPE (x)))
2679 error ("non-integral used in condition");
2682 if (!is_gimple_condexpr (x))
2684 error ("invalid conditional operand");
2689 case NON_LVALUE_EXPR:
2693 case FIX_TRUNC_EXPR:
2698 case TRUTH_NOT_EXPR:
2699 CHECK_OP (0, "invalid operand to unary operator");
2706 case ARRAY_RANGE_REF:
2708 case VIEW_CONVERT_EXPR:
2709 /* We have a nest of references. Verify that each of the operands
2710 that determine where to reference is either a constant or a variable,
2711 verify that the base is valid, and then show we've already checked
2713 while (handled_component_p (t))
2715 if (TREE_CODE (t) == COMPONENT_REF && TREE_OPERAND (t, 2))
2716 CHECK_OP (2, "invalid COMPONENT_REF offset operator");
2717 else if (TREE_CODE (t) == ARRAY_REF
2718 || TREE_CODE (t) == ARRAY_RANGE_REF)
2720 CHECK_OP (1, "invalid array index");
2721 if (TREE_OPERAND (t, 2))
2722 CHECK_OP (2, "invalid array lower bound");
2723 if (TREE_OPERAND (t, 3))
2724 CHECK_OP (3, "invalid array stride");
2726 else if (TREE_CODE (t) == BIT_FIELD_REF)
2728 if (!host_integerp (TREE_OPERAND (t, 1), 1)
2729 || !host_integerp (TREE_OPERAND (t, 2), 1))
2731 error ("invalid position or size operand to BIT_FIELD_REF");
2734 else if (INTEGRAL_TYPE_P (TREE_TYPE (t))
2735 && (TYPE_PRECISION (TREE_TYPE (t))
2736 != TREE_INT_CST_LOW (TREE_OPERAND (t, 1))))
2738 error ("integral result type precision does not match "
2739 "field size of BIT_FIELD_REF");
2742 if (!INTEGRAL_TYPE_P (TREE_TYPE (t))
2743 && (GET_MODE_PRECISION (TYPE_MODE (TREE_TYPE (t)))
2744 != TREE_INT_CST_LOW (TREE_OPERAND (t, 1))))
2746 error ("mode precision of non-integral result does not "
2747 "match field size of BIT_FIELD_REF");
2752 t = TREE_OPERAND (t, 0);
2755 if (!is_gimple_min_invariant (t) && !is_gimple_lvalue (t))
2757 error ("invalid reference prefix");
2764 /* PLUS_EXPR and MINUS_EXPR don't work on pointers, they should be done using
2765 POINTER_PLUS_EXPR. */
2766 if (POINTER_TYPE_P (TREE_TYPE (t)))
2768 error ("invalid operand to plus/minus, type is a pointer");
2771 CHECK_OP (0, "invalid operand to binary operator");
2772 CHECK_OP (1, "invalid operand to binary operator");
2775 case POINTER_PLUS_EXPR:
2776 /* Check to make sure the first operand is a pointer or reference type. */
2777 if (!POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (t, 0))))
2779 error ("invalid operand to pointer plus, first operand is not a pointer");
2782 /* Check to make sure the second operand is an integer with type of
2784 if (!useless_type_conversion_p (sizetype,
2785 TREE_TYPE (TREE_OPERAND (t, 1))))
2787 error ("invalid operand to pointer plus, second operand is not an "
2788 "integer with type of sizetype.");
2798 case UNORDERED_EXPR:
2807 case TRUNC_DIV_EXPR:
2809 case FLOOR_DIV_EXPR:
2810 case ROUND_DIV_EXPR:
2811 case TRUNC_MOD_EXPR:
2813 case FLOOR_MOD_EXPR:
2814 case ROUND_MOD_EXPR:
2816 case EXACT_DIV_EXPR:
2826 CHECK_OP (0, "invalid operand to binary operator");
2827 CHECK_OP (1, "invalid operand to binary operator");
2831 if (TREE_CONSTANT (t) && TREE_CODE (TREE_TYPE (t)) == VECTOR_TYPE)
2844 /* Verify if EXPR is either a GIMPLE ID or a GIMPLE indirect reference.
2845 Returns true if there is an error, otherwise false. */
2848 verify_types_in_gimple_min_lval (tree expr)
2852 if (is_gimple_id (expr))
2855 if (TREE_CODE (expr) != TARGET_MEM_REF
2856 && TREE_CODE (expr) != MEM_REF)
2858 error ("invalid expression for min lvalue");
2862 /* TARGET_MEM_REFs are strange beasts. */
2863 if (TREE_CODE (expr) == TARGET_MEM_REF)
2866 op = TREE_OPERAND (expr, 0);
2867 if (!is_gimple_val (op))
2869 error ("invalid operand in indirect reference");
2870 debug_generic_stmt (op);
2873 /* Memory references now generally can involve a value conversion. */
2878 /* Verify if EXPR is a valid GIMPLE reference expression. If
2879 REQUIRE_LVALUE is true verifies it is an lvalue. Returns true
2880 if there is an error, otherwise false. */
2883 verify_types_in_gimple_reference (tree expr, bool require_lvalue)
2885 while (handled_component_p (expr))
2887 tree op = TREE_OPERAND (expr, 0);
2889 if (TREE_CODE (expr) == ARRAY_REF
2890 || TREE_CODE (expr) == ARRAY_RANGE_REF)
2892 if (!is_gimple_val (TREE_OPERAND (expr, 1))
2893 || (TREE_OPERAND (expr, 2)
2894 && !is_gimple_val (TREE_OPERAND (expr, 2)))
2895 || (TREE_OPERAND (expr, 3)
2896 && !is_gimple_val (TREE_OPERAND (expr, 3))))
2898 error ("invalid operands to array reference");
2899 debug_generic_stmt (expr);
2904 /* Verify if the reference array element types are compatible. */
2905 if (TREE_CODE (expr) == ARRAY_REF
2906 && !useless_type_conversion_p (TREE_TYPE (expr),
2907 TREE_TYPE (TREE_TYPE (op))))
2909 error ("type mismatch in array reference");
2910 debug_generic_stmt (TREE_TYPE (expr));
2911 debug_generic_stmt (TREE_TYPE (TREE_TYPE (op)));
2914 if (TREE_CODE (expr) == ARRAY_RANGE_REF
2915 && !useless_type_conversion_p (TREE_TYPE (TREE_TYPE (expr)),
2916 TREE_TYPE (TREE_TYPE (op))))
2918 error ("type mismatch in array range reference");
2919 debug_generic_stmt (TREE_TYPE (TREE_TYPE (expr)));
2920 debug_generic_stmt (TREE_TYPE (TREE_TYPE (op)));
2924 if ((TREE_CODE (expr) == REALPART_EXPR
2925 || TREE_CODE (expr) == IMAGPART_EXPR)
2926 && !useless_type_conversion_p (TREE_TYPE (expr),
2927 TREE_TYPE (TREE_TYPE (op))))
2929 error ("type mismatch in real/imagpart reference");
2930 debug_generic_stmt (TREE_TYPE (expr));
2931 debug_generic_stmt (TREE_TYPE (TREE_TYPE (op)));
2935 if (TREE_CODE (expr) == COMPONENT_REF
2936 && !useless_type_conversion_p (TREE_TYPE (expr),
2937 TREE_TYPE (TREE_OPERAND (expr, 1))))
2939 error ("type mismatch in component reference");
2940 debug_generic_stmt (TREE_TYPE (expr));
2941 debug_generic_stmt (TREE_TYPE (TREE_OPERAND (expr, 1)));
2945 if (TREE_CODE (expr) == VIEW_CONVERT_EXPR)
2947 /* For VIEW_CONVERT_EXPRs which are allowed here too, we only check
2948 that their operand is not an SSA name or an invariant when
2949 requiring an lvalue (this usually means there is a SRA or IPA-SRA
2950 bug). Otherwise there is nothing to verify, gross mismatches at
2951 most invoke undefined behavior. */
2953 && (TREE_CODE (op) == SSA_NAME
2954 || is_gimple_min_invariant (op)))
2956 error ("Conversion of an SSA_NAME on the left hand side.");
2957 debug_generic_stmt (expr);
2960 else if (TREE_CODE (op) == SSA_NAME
2961 && TYPE_SIZE (TREE_TYPE (expr)) != TYPE_SIZE (TREE_TYPE (op)))
2963 error ("Conversion of register to a different size.");
2964 debug_generic_stmt (expr);
2967 else if (!handled_component_p (op))
2974 if (TREE_CODE (expr) == MEM_REF)
2976 if (!is_gimple_mem_ref_addr (TREE_OPERAND (expr, 0)))
2978 error ("Invalid address operand in MEM_REF.");
2979 debug_generic_stmt (expr);
2982 if (TREE_CODE (TREE_OPERAND (expr, 1)) != INTEGER_CST
2983 || !POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (expr, 1))))
2985 error ("Invalid offset operand in MEM_REF.");
2986 debug_generic_stmt (expr);
2990 else if (TREE_CODE (expr) == TARGET_MEM_REF)
2992 if (!TMR_BASE (expr)
2993 || !is_gimple_mem_ref_addr (TMR_BASE (expr)))
2995 error ("Invalid address operand in in TARGET_MEM_REF.");
2998 if (!TMR_OFFSET (expr)
2999 || TREE_CODE (TMR_OFFSET (expr)) != INTEGER_CST
3000 || !POINTER_TYPE_P (TREE_TYPE (TMR_OFFSET (expr))))
3002 error ("Invalid offset operand in TARGET_MEM_REF.");
3003 debug_generic_stmt (expr);
3008 return ((require_lvalue || !is_gimple_min_invariant (expr))
3009 && verify_types_in_gimple_min_lval (expr));
3012 /* Returns true if there is one pointer type in TYPE_POINTER_TO (SRC_OBJ)
3013 list of pointer-to types that is trivially convertible to DEST. */
3016 one_pointer_to_useless_type_conversion_p (tree dest, tree src_obj)
3020 if (!TYPE_POINTER_TO (src_obj))
3023 for (src = TYPE_POINTER_TO (src_obj); src; src = TYPE_NEXT_PTR_TO (src))
3024 if (useless_type_conversion_p (dest, src))
3030 /* Return true if TYPE1 is a fixed-point type and if conversions to and
3031 from TYPE2 can be handled by FIXED_CONVERT_EXPR. */
3034 valid_fixed_convert_types_p (tree type1, tree type2)
3036 return (FIXED_POINT_TYPE_P (type1)
3037 && (INTEGRAL_TYPE_P (type2)
3038 || SCALAR_FLOAT_TYPE_P (type2)
3039 || FIXED_POINT_TYPE_P (type2)));
3042 /* Verify the contents of a GIMPLE_CALL STMT. Returns true when there
3043 is a problem, otherwise false. */
3046 verify_gimple_call (gimple stmt)
3048 tree fn = gimple_call_fn (stmt);
3052 if (TREE_CODE (fn) != OBJ_TYPE_REF
3053 && !is_gimple_val (fn))
3055 error ("invalid function in gimple call");
3056 debug_generic_stmt (fn);
3060 if (!POINTER_TYPE_P (TREE_TYPE (fn))
3061 || (TREE_CODE (TREE_TYPE (TREE_TYPE (fn))) != FUNCTION_TYPE
3062 && TREE_CODE (TREE_TYPE (TREE_TYPE (fn))) != METHOD_TYPE))
3064 error ("non-function in gimple call");
3068 if (gimple_call_lhs (stmt)
3069 && (!is_gimple_lvalue (gimple_call_lhs (stmt))
3070 || verify_types_in_gimple_reference (gimple_call_lhs (stmt), true)))
3072 error ("invalid LHS in gimple call");
3076 if (gimple_call_lhs (stmt) && gimple_call_noreturn_p (stmt))
3078 error ("LHS in noreturn call");
3082 fntype = TREE_TYPE (TREE_TYPE (fn));
3083 if (gimple_call_lhs (stmt)
3084 && !useless_type_conversion_p (TREE_TYPE (gimple_call_lhs (stmt)),
3086 /* ??? At least C++ misses conversions at assignments from
3087 void * call results.
3088 ??? Java is completely off. Especially with functions
3089 returning java.lang.Object.
3090 For now simply allow arbitrary pointer type conversions. */
3091 && !(POINTER_TYPE_P (TREE_TYPE (gimple_call_lhs (stmt)))
3092 && POINTER_TYPE_P (TREE_TYPE (fntype))))
3094 error ("invalid conversion in gimple call");
3095 debug_generic_stmt (TREE_TYPE (gimple_call_lhs (stmt)));
3096 debug_generic_stmt (TREE_TYPE (fntype));
3100 if (gimple_call_chain (stmt)
3101 && !is_gimple_val (gimple_call_chain (stmt)))
3103 error ("invalid static chain in gimple call");
3104 debug_generic_stmt (gimple_call_chain (stmt));
3108 /* If there is a static chain argument, this should not be an indirect
3109 call, and the decl should have DECL_STATIC_CHAIN set. */
3110 if (gimple_call_chain (stmt))
3112 if (TREE_CODE (fn) != ADDR_EXPR
3113 || TREE_CODE (TREE_OPERAND (fn, 0)) != FUNCTION_DECL)
3115 error ("static chain in indirect gimple call");
3118 fn = TREE_OPERAND (fn, 0);
3120 if (!DECL_STATIC_CHAIN (fn))
3122 error ("static chain with function that doesn't use one");
3127 /* ??? The C frontend passes unpromoted arguments in case it
3128 didn't see a function declaration before the call. So for now
3129 leave the call arguments mostly unverified. Once we gimplify
3130 unit-at-a-time we have a chance to fix this. */
3132 for (i = 0; i < gimple_call_num_args (stmt); ++i)
3134 tree arg = gimple_call_arg (stmt, i);
3135 if ((is_gimple_reg_type (TREE_TYPE (arg))
3136 && !is_gimple_val (arg))
3137 || (!is_gimple_reg_type (TREE_TYPE (arg))
3138 && !is_gimple_lvalue (arg)))
3140 error ("invalid argument to gimple call");
3141 debug_generic_expr (arg);
3148 /* Verifies the gimple comparison with the result type TYPE and
3149 the operands OP0 and OP1. */
3152 verify_gimple_comparison (tree type, tree op0, tree op1)
3154 tree op0_type = TREE_TYPE (op0);
3155 tree op1_type = TREE_TYPE (op1);
3157 if (!is_gimple_val (op0) || !is_gimple_val (op1))
3159 error ("invalid operands in gimple comparison");
3163 /* For comparisons we do not have the operations type as the
3164 effective type the comparison is carried out in. Instead
3165 we require that either the first operand is trivially
3166 convertible into the second, or the other way around.
3167 The resulting type of a comparison may be any integral type.
3168 Because we special-case pointers to void we allow
3169 comparisons of pointers with the same mode as well. */
3170 if ((!useless_type_conversion_p (op0_type, op1_type)
3171 && !useless_type_conversion_p (op1_type, op0_type)
3172 && (!POINTER_TYPE_P (op0_type)
3173 || !POINTER_TYPE_P (op1_type)
3174 || TYPE_MODE (op0_type) != TYPE_MODE (op1_type)))
3175 || !INTEGRAL_TYPE_P (type))
3177 error ("type mismatch in comparison expression");
3178 debug_generic_expr (type);
3179 debug_generic_expr (op0_type);
3180 debug_generic_expr (op1_type);
3187 /* Verify a gimple assignment statement STMT with an unary rhs.
3188 Returns true if anything is wrong. */
3191 verify_gimple_assign_unary (gimple stmt)
3193 enum tree_code rhs_code = gimple_assign_rhs_code (stmt);
3194 tree lhs = gimple_assign_lhs (stmt);
3195 tree lhs_type = TREE_TYPE (lhs);
3196 tree rhs1 = gimple_assign_rhs1 (stmt);
3197 tree rhs1_type = TREE_TYPE (rhs1);
3199 if (!is_gimple_reg (lhs)
3201 && TREE_CODE (lhs_type) == COMPLEX_TYPE))
3203 error ("non-register as LHS of unary operation");
3207 if (!is_gimple_val (rhs1))
3209 error ("invalid operand in unary operation");
3213 /* First handle conversions. */
3218 /* Allow conversions between integral types and pointers only if
3219 there is no sign or zero extension involved.
3220 For targets were the precision of sizetype doesn't match that
3221 of pointers we need to allow arbitrary conversions from and
3223 if ((POINTER_TYPE_P (lhs_type)
3224 && INTEGRAL_TYPE_P (rhs1_type)
3225 && (TYPE_PRECISION (lhs_type) >= TYPE_PRECISION (rhs1_type)
3226 || rhs1_type == sizetype))
3227 || (POINTER_TYPE_P (rhs1_type)
3228 && INTEGRAL_TYPE_P (lhs_type)
3229 && (TYPE_PRECISION (rhs1_type) >= TYPE_PRECISION (lhs_type)
3230 || lhs_type == sizetype)))
3233 /* Allow conversion from integer to offset type and vice versa. */
3234 if ((TREE_CODE (lhs_type) == OFFSET_TYPE
3235 && TREE_CODE (rhs1_type) == INTEGER_TYPE)
3236 || (TREE_CODE (lhs_type) == INTEGER_TYPE
3237 && TREE_CODE (rhs1_type) == OFFSET_TYPE))
3240 /* Otherwise assert we are converting between types of the
3242 if (INTEGRAL_TYPE_P (lhs_type) != INTEGRAL_TYPE_P (rhs1_type))
3244 error ("invalid types in nop conversion");
3245 debug_generic_expr (lhs_type);
3246 debug_generic_expr (rhs1_type);
3253 case ADDR_SPACE_CONVERT_EXPR:
3255 if (!POINTER_TYPE_P (rhs1_type) || !POINTER_TYPE_P (lhs_type)
3256 || (TYPE_ADDR_SPACE (TREE_TYPE (rhs1_type))
3257 == TYPE_ADDR_SPACE (TREE_TYPE (lhs_type))))
3259 error ("invalid types in address space conversion");
3260 debug_generic_expr (lhs_type);
3261 debug_generic_expr (rhs1_type);
3268 case FIXED_CONVERT_EXPR:
3270 if (!valid_fixed_convert_types_p (lhs_type, rhs1_type)
3271 && !valid_fixed_convert_types_p (rhs1_type, lhs_type))
3273 error ("invalid types in fixed-point conversion");
3274 debug_generic_expr (lhs_type);
3275 debug_generic_expr (rhs1_type);
3284 if (!INTEGRAL_TYPE_P (rhs1_type) || !SCALAR_FLOAT_TYPE_P (lhs_type))
3286 error ("invalid types in conversion to floating point");
3287 debug_generic_expr (lhs_type);
3288 debug_generic_expr (rhs1_type);
3295 case FIX_TRUNC_EXPR:
3297 if (!INTEGRAL_TYPE_P (lhs_type) || !SCALAR_FLOAT_TYPE_P (rhs1_type))
3299 error ("invalid types in conversion to integer");
3300 debug_generic_expr (lhs_type);
3301 debug_generic_expr (rhs1_type);
3308 case VEC_UNPACK_HI_EXPR:
3309 case VEC_UNPACK_LO_EXPR:
3310 case REDUC_MAX_EXPR:
3311 case REDUC_MIN_EXPR:
3312 case REDUC_PLUS_EXPR:
3313 case VEC_UNPACK_FLOAT_HI_EXPR:
3314 case VEC_UNPACK_FLOAT_LO_EXPR:
3318 case TRUTH_NOT_EXPR:
3323 case NON_LVALUE_EXPR:
3331 /* For the remaining codes assert there is no conversion involved. */
3332 if (!useless_type_conversion_p (lhs_type, rhs1_type))
3334 error ("non-trivial conversion in unary operation");
3335 debug_generic_expr (lhs_type);
3336 debug_generic_expr (rhs1_type);
3343 /* Verify a gimple assignment statement STMT with a binary rhs.
3344 Returns true if anything is wrong. */
3347 verify_gimple_assign_binary (gimple stmt)
3349 enum tree_code rhs_code = gimple_assign_rhs_code (stmt);
3350 tree lhs = gimple_assign_lhs (stmt);
3351 tree lhs_type = TREE_TYPE (lhs);
3352 tree rhs1 = gimple_assign_rhs1 (stmt);
3353 tree rhs1_type = TREE_TYPE (rhs1);
3354 tree rhs2 = gimple_assign_rhs2 (stmt);
3355 tree rhs2_type = TREE_TYPE (rhs2);
3357 if (!is_gimple_reg (lhs)
3359 && TREE_CODE (lhs_type) == COMPLEX_TYPE))
3361 error ("non-register as LHS of binary operation");
3365 if (!is_gimple_val (rhs1)
3366 || !is_gimple_val (rhs2))
3368 error ("invalid operands in binary operation");
3372 /* First handle operations that involve different types. */
3377 if (TREE_CODE (lhs_type) != COMPLEX_TYPE
3378 || !(INTEGRAL_TYPE_P (rhs1_type)
3379 || SCALAR_FLOAT_TYPE_P (rhs1_type))
3380 || !(INTEGRAL_TYPE_P (rhs2_type)
3381 || SCALAR_FLOAT_TYPE_P (rhs2_type)))
3383 error ("type mismatch in complex expression");
3384 debug_generic_expr (lhs_type);
3385 debug_generic_expr (rhs1_type);
3386 debug_generic_expr (rhs2_type);
3398 /* Shifts and rotates are ok on integral types, fixed point
3399 types and integer vector types. */
3400 if ((!INTEGRAL_TYPE_P (rhs1_type)
3401 && !FIXED_POINT_TYPE_P (rhs1_type)
3402 && !(TREE_CODE (rhs1_type) == VECTOR_TYPE
3403 && INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type))))
3404 || (!INTEGRAL_TYPE_P (rhs2_type)
3405 /* Vector shifts of vectors are also ok. */
3406 && !(TREE_CODE (rhs1_type) == VECTOR_TYPE
3407 && INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type))
3408 && TREE_CODE (rhs2_type) == VECTOR_TYPE
3409 && INTEGRAL_TYPE_P (TREE_TYPE (rhs2_type))))
3410 || !useless_type_conversion_p (lhs_type, rhs1_type))
3412 error ("type mismatch in shift expression");
3413 debug_generic_expr (lhs_type);
3414 debug_generic_expr (rhs1_type);
3415 debug_generic_expr (rhs2_type);
3422 case VEC_LSHIFT_EXPR:
3423 case VEC_RSHIFT_EXPR:
3425 if (TREE_CODE (rhs1_type) != VECTOR_TYPE
3426 || !(INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type))
3427 || FIXED_POINT_TYPE_P (TREE_TYPE (rhs1_type))
3428 || SCALAR_FLOAT_TYPE_P (TREE_TYPE (rhs1_type)))
3429 || (!INTEGRAL_TYPE_P (rhs2_type)
3430 && (TREE_CODE (rhs2_type) != VECTOR_TYPE
3431 || !INTEGRAL_TYPE_P (TREE_TYPE (rhs2_type))))
3432 || !useless_type_conversion_p (lhs_type, rhs1_type))
3434 error ("type mismatch in vector shift expression");
3435 debug_generic_expr (lhs_type);
3436 debug_generic_expr (rhs1_type);
3437 debug_generic_expr (rhs2_type);
3440 /* For shifting a vector of floating point components we
3441 only allow shifting by a constant multiple of the element size. */
3442 if (SCALAR_FLOAT_TYPE_P (TREE_TYPE (rhs1_type))
3443 && (TREE_CODE (rhs2) != INTEGER_CST
3444 || !div_if_zero_remainder (EXACT_DIV_EXPR, rhs2,
3445 TYPE_SIZE (TREE_TYPE (rhs1_type)))))
3447 error ("non-element sized vector shift of floating point vector");
3456 /* We use regular PLUS_EXPR for vectors.
3457 ??? This just makes the checker happy and may not be what is
3459 if (TREE_CODE (lhs_type) == VECTOR_TYPE
3460 && POINTER_TYPE_P (TREE_TYPE (lhs_type)))
3462 if (TREE_CODE (rhs1_type) != VECTOR_TYPE
3463 || TREE_CODE (rhs2_type) != VECTOR_TYPE)
3465 error ("invalid non-vector operands to vector valued plus");
3468 lhs_type = TREE_TYPE (lhs_type);
3469 rhs1_type = TREE_TYPE (rhs1_type);
3470 rhs2_type = TREE_TYPE (rhs2_type);
3471 /* PLUS_EXPR is commutative, so we might end up canonicalizing
3472 the pointer to 2nd place. */
3473 if (POINTER_TYPE_P (rhs2_type))
3475 tree tem = rhs1_type;
3476 rhs1_type = rhs2_type;
3479 goto do_pointer_plus_expr_check;
3485 if (POINTER_TYPE_P (lhs_type)
3486 || POINTER_TYPE_P (rhs1_type)
3487 || POINTER_TYPE_P (rhs2_type))
3489 error ("invalid (pointer) operands to plus/minus");
3493 /* Continue with generic binary expression handling. */
3497 case POINTER_PLUS_EXPR:
3499 do_pointer_plus_expr_check:
3500 if (!POINTER_TYPE_P (rhs1_type)
3501 || !useless_type_conversion_p (lhs_type, rhs1_type)
3502 || !useless_type_conversion_p (sizetype, rhs2_type))
3504 error ("type mismatch in pointer plus expression");
3505 debug_generic_stmt (lhs_type);
3506 debug_generic_stmt (rhs1_type);
3507 debug_generic_stmt (rhs2_type);
3514 case TRUTH_ANDIF_EXPR:
3515 case TRUTH_ORIF_EXPR:
3518 case TRUTH_AND_EXPR:
3520 case TRUTH_XOR_EXPR:
3522 /* We allow any kind of integral typed argument and result. */
3523 if (!INTEGRAL_TYPE_P (rhs1_type)
3524 || !INTEGRAL_TYPE_P (rhs2_type)
3525 || !INTEGRAL_TYPE_P (lhs_type))
3527 error ("type mismatch in binary truth expression");
3528 debug_generic_expr (lhs_type);
3529 debug_generic_expr (rhs1_type);
3530 debug_generic_expr (rhs2_type);
3543 case UNORDERED_EXPR:
3551 /* Comparisons are also binary, but the result type is not
3552 connected to the operand types. */
3553 return verify_gimple_comparison (lhs_type, rhs1, rhs2);
3555 case WIDEN_MULT_EXPR:
3556 if (TREE_CODE (lhs_type) != INTEGER_TYPE)
3558 return ((2 * TYPE_PRECISION (rhs1_type) != TYPE_PRECISION (lhs_type))
3559 || (TYPE_PRECISION (rhs1_type) != TYPE_PRECISION (rhs2_type)));
3561 case WIDEN_SUM_EXPR:
3562 case VEC_WIDEN_MULT_HI_EXPR:
3563 case VEC_WIDEN_MULT_LO_EXPR:
3564 case VEC_PACK_TRUNC_EXPR:
3565 case VEC_PACK_SAT_EXPR:
3566 case VEC_PACK_FIX_TRUNC_EXPR:
3567 case VEC_EXTRACT_EVEN_EXPR:
3568 case VEC_EXTRACT_ODD_EXPR:
3569 case VEC_INTERLEAVE_HIGH_EXPR:
3570 case VEC_INTERLEAVE_LOW_EXPR:
3575 case TRUNC_DIV_EXPR:
3577 case FLOOR_DIV_EXPR:
3578 case ROUND_DIV_EXPR:
3579 case TRUNC_MOD_EXPR:
3581 case FLOOR_MOD_EXPR:
3582 case ROUND_MOD_EXPR:
3584 case EXACT_DIV_EXPR:
3590 /* Continue with generic binary expression handling. */
3597 if (!useless_type_conversion_p (lhs_type, rhs1_type)
3598 || !useless_type_conversion_p (lhs_type, rhs2_type))
3600 error ("type mismatch in binary expression");
3601 debug_generic_stmt (lhs_type);
3602 debug_generic_stmt (rhs1_type);
3603 debug_generic_stmt (rhs2_type);
3610 /* Verify a gimple assignment statement STMT with a ternary rhs.
3611 Returns true if anything is wrong. */
3614 verify_gimple_assign_ternary (gimple stmt)
3616 enum tree_code rhs_code = gimple_assign_rhs_code (stmt);
3617 tree lhs = gimple_assign_lhs (stmt);
3618 tree lhs_type = TREE_TYPE (lhs);
3619 tree rhs1 = gimple_assign_rhs1 (stmt);
3620 tree rhs1_type = TREE_TYPE (rhs1);
3621 tree rhs2 = gimple_assign_rhs2 (stmt);
3622 tree rhs2_type = TREE_TYPE (rhs2);
3623 tree rhs3 = gimple_assign_rhs3 (stmt);
3624 tree rhs3_type = TREE_TYPE (rhs3);
3626 if (!is_gimple_reg (lhs)
3628 && TREE_CODE (lhs_type) == COMPLEX_TYPE))
3630 error ("non-register as LHS of ternary operation");
3634 if (!is_gimple_val (rhs1)
3635 || !is_gimple_val (rhs2)
3636 || !is_gimple_val (rhs3))
3638 error ("invalid operands in ternary operation");
3642 /* First handle operations that involve different types. */
3645 case WIDEN_MULT_PLUS_EXPR:
3646 case WIDEN_MULT_MINUS_EXPR:
3647 if ((!INTEGRAL_TYPE_P (rhs1_type)
3648 && !FIXED_POINT_TYPE_P (rhs1_type))
3649 || !useless_type_conversion_p (rhs1_type, rhs2_type)
3650 || !useless_type_conversion_p (lhs_type, rhs3_type)
3651 || 2 * TYPE_PRECISION (rhs1_type) != TYPE_PRECISION (lhs_type)
3652 || TYPE_PRECISION (rhs1_type) != TYPE_PRECISION (rhs2_type))
3654 error ("type mismatch in widening multiply-accumulate expression");
3655 debug_generic_expr (lhs_type);
3656 debug_generic_expr (rhs1_type);
3657 debug_generic_expr (rhs2_type);
3658 debug_generic_expr (rhs3_type);
3669 /* Verify a gimple assignment statement STMT with a single rhs.
3670 Returns true if anything is wrong. */
3673 verify_gimple_assign_single (gimple stmt)
3675 enum tree_code rhs_code = gimple_assign_rhs_code (stmt);
3676 tree lhs = gimple_assign_lhs (stmt);
3677 tree lhs_type = TREE_TYPE (lhs);
3678 tree rhs1 = gimple_assign_rhs1 (stmt);
3679 tree rhs1_type = TREE_TYPE (rhs1);
3682 if (!useless_type_conversion_p (lhs_type, rhs1_type))
3684 error ("non-trivial conversion at assignment");
3685 debug_generic_expr (lhs_type);
3686 debug_generic_expr (rhs1_type);
3690 if (handled_component_p (lhs))
3691 res |= verify_types_in_gimple_reference (lhs, true);
3693 /* Special codes we cannot handle via their class. */
3698 tree op = TREE_OPERAND (rhs1, 0);
3699 if (!is_gimple_addressable (op))
3701 error ("invalid operand in unary expression");
3705 if (!types_compatible_p (TREE_TYPE (op), TREE_TYPE (TREE_TYPE (rhs1)))
3706 && !one_pointer_to_useless_type_conversion_p (TREE_TYPE (rhs1),
3709 error ("type mismatch in address expression");
3710 debug_generic_stmt (TREE_TYPE (rhs1));
3711 debug_generic_stmt (TREE_TYPE (op));
3715 return verify_types_in_gimple_reference (op, true);
3720 error ("INDIRECT_REF in gimple IL");
3726 case ARRAY_RANGE_REF:
3727 case VIEW_CONVERT_EXPR:
3730 case TARGET_MEM_REF:
3732 if (!is_gimple_reg (lhs)
3733 && is_gimple_reg_type (TREE_TYPE (lhs)))
3735 error ("invalid rhs for gimple memory store");
3736 debug_generic_stmt (lhs);
3737 debug_generic_stmt (rhs1);
3740 return res || verify_types_in_gimple_reference (rhs1, false);
3752 /* tcc_declaration */
3757 if (!is_gimple_reg (lhs)
3758 && !is_gimple_reg (rhs1)
3759 && is_gimple_reg_type (TREE_TYPE (lhs)))
3761 error ("invalid rhs for gimple memory store");
3762 debug_generic_stmt (lhs);
3763 debug_generic_stmt (rhs1);
3769 if (!is_gimple_reg (lhs)
3770 || (!is_gimple_reg (TREE_OPERAND (rhs1, 0))
3771 && !COMPARISON_CLASS_P (TREE_OPERAND (rhs1, 0)))
3772 || (!is_gimple_reg (TREE_OPERAND (rhs1, 1))
3773 && !is_gimple_min_invariant (TREE_OPERAND (rhs1, 1)))
3774 || (!is_gimple_reg (TREE_OPERAND (rhs1, 2))
3775 && !is_gimple_min_invariant (TREE_OPERAND (rhs1, 2))))
3777 error ("invalid COND_EXPR in gimple assignment");
3778 debug_generic_stmt (rhs1);
3786 case WITH_SIZE_EXPR:
3787 case POLYNOMIAL_CHREC:
3790 case REALIGN_LOAD_EXPR:
3800 /* Verify the contents of a GIMPLE_ASSIGN STMT. Returns true when there
3801 is a problem, otherwise false. */
3804 verify_gimple_assign (gimple stmt)
3806 switch (gimple_assign_rhs_class (stmt))
3808 case GIMPLE_SINGLE_RHS:
3809 return verify_gimple_assign_single (stmt);
3811 case GIMPLE_UNARY_RHS:
3812 return verify_gimple_assign_unary (stmt);
3814 case GIMPLE_BINARY_RHS:
3815 return verify_gimple_assign_binary (stmt);
3817 case GIMPLE_TERNARY_RHS:
3818 return verify_gimple_assign_ternary (stmt);
3825 /* Verify the contents of a GIMPLE_RETURN STMT. Returns true when there
3826 is a problem, otherwise false. */
3829 verify_gimple_return (gimple stmt)
3831 tree op = gimple_return_retval (stmt);
3832 tree restype = TREE_TYPE (TREE_TYPE (cfun->decl));
3834 /* We cannot test for present return values as we do not fix up missing
3835 return values from the original source. */
3839 if (!is_gimple_val (op)
3840 && TREE_CODE (op) != RESULT_DECL)
3842 error ("invalid operand in return statement");
3843 debug_generic_stmt (op);
3847 if ((TREE_CODE (op) == RESULT_DECL
3848 && DECL_BY_REFERENCE (op))
3849 || (TREE_CODE (op) == SSA_NAME
3850 && TREE_CODE (SSA_NAME_VAR (op)) == RESULT_DECL
3851 && DECL_BY_REFERENCE (SSA_NAME_VAR (op))))
3852 op = TREE_TYPE (op);
3854 if (!useless_type_conversion_p (restype, TREE_TYPE (op)))
3856 error ("invalid conversion in return statement");
3857 debug_generic_stmt (restype);
3858 debug_generic_stmt (TREE_TYPE (op));
3866 /* Verify the contents of a GIMPLE_GOTO STMT. Returns true when there
3867 is a problem, otherwise false. */
3870 verify_gimple_goto (gimple stmt)
3872 tree dest = gimple_goto_dest (stmt);
3874 /* ??? We have two canonical forms of direct goto destinations, a
3875 bare LABEL_DECL and an ADDR_EXPR of a LABEL_DECL. */
3876 if (TREE_CODE (dest) != LABEL_DECL
3877 && (!is_gimple_val (dest)
3878 || !POINTER_TYPE_P (TREE_TYPE (dest))))
3880 error ("goto destination is neither a label nor a pointer");
3887 /* Verify the contents of a GIMPLE_SWITCH STMT. Returns true when there
3888 is a problem, otherwise false. */
3891 verify_gimple_switch (gimple stmt)
3893 if (!is_gimple_val (gimple_switch_index (stmt)))
3895 error ("invalid operand to switch statement");
3896 debug_generic_stmt (gimple_switch_index (stmt));
3904 /* Verify the contents of a GIMPLE_PHI. Returns true if there is a problem,
3905 and false otherwise. */
3908 verify_gimple_phi (gimple stmt)
3910 tree type = TREE_TYPE (gimple_phi_result (stmt));
3913 if (TREE_CODE (gimple_phi_result (stmt)) != SSA_NAME)
3915 error ("Invalid PHI result");
3919 for (i = 0; i < gimple_phi_num_args (stmt); i++)
3921 tree arg = gimple_phi_arg_def (stmt, i);
3922 if ((is_gimple_reg (gimple_phi_result (stmt))
3923 && !is_gimple_val (arg))
3924 || (!is_gimple_reg (gimple_phi_result (stmt))
3925 && !is_gimple_addressable (arg)))
3927 error ("Invalid PHI argument");
3928 debug_generic_stmt (arg);
3931 if (!useless_type_conversion_p (type, TREE_TYPE (arg)))
3933 error ("Incompatible types in PHI argument %u", i);
3934 debug_generic_stmt (type);
3935 debug_generic_stmt (TREE_TYPE (arg));
3944 /* Verify a gimple debug statement STMT.
3945 Returns true if anything is wrong. */
3948 verify_gimple_debug (gimple stmt ATTRIBUTE_UNUSED)
3950 /* There isn't much that could be wrong in a gimple debug stmt. A
3951 gimple debug bind stmt, for example, maps a tree, that's usually
3952 a VAR_DECL or a PARM_DECL, but that could also be some scalarized
3953 component or member of an aggregate type, to another tree, that
3954 can be an arbitrary expression. These stmts expand into debug
3955 insns, and are converted to debug notes by var-tracking.c. */
3960 /* Verify the GIMPLE statement STMT. Returns true if there is an
3961 error, otherwise false. */
3964 verify_types_in_gimple_stmt (gimple stmt)
3966 switch (gimple_code (stmt))
3969 return verify_gimple_assign (stmt);
3972 return TREE_CODE (gimple_label_label (stmt)) != LABEL_DECL;
3975 return verify_gimple_call (stmt);
3978 if (TREE_CODE_CLASS (gimple_cond_code (stmt)) != tcc_comparison)
3980 error ("invalid comparison code in gimple cond");
3983 if (!(!gimple_cond_true_label (stmt)
3984 || TREE_CODE (gimple_cond_true_label (stmt)) == LABEL_DECL)
3985 || !(!gimple_cond_false_label (stmt)
3986 || TREE_CODE (gimple_cond_false_label (stmt)) == LABEL_DECL))
3988 error ("invalid labels in gimple cond");
3992 return verify_gimple_comparison (boolean_type_node,
3993 gimple_cond_lhs (stmt),
3994 gimple_cond_rhs (stmt));
3997 return verify_gimple_goto (stmt);
4000 return verify_gimple_switch (stmt);
4003 return verify_gimple_return (stmt);
4009 return verify_gimple_phi (stmt);
4011 /* Tuples that do not have tree operands. */
4013 case GIMPLE_PREDICT:
4015 case GIMPLE_EH_DISPATCH:
4016 case GIMPLE_EH_MUST_NOT_THROW:
4020 /* OpenMP directives are validated by the FE and never operated
4021 on by the optimizers. Furthermore, GIMPLE_OMP_FOR may contain
4022 non-gimple expressions when the main index variable has had
4023 its address taken. This does not affect the loop itself
4024 because the header of an GIMPLE_OMP_FOR is merely used to determine
4025 how to setup the parallel iteration. */
4029 return verify_gimple_debug (stmt);
4036 /* Verify the GIMPLE statements inside the sequence STMTS. */
4039 verify_types_in_gimple_seq_2 (gimple_seq stmts)
4041 gimple_stmt_iterator ittr;
4044 for (ittr = gsi_start (stmts); !gsi_end_p (ittr); gsi_next (&ittr))
4046 gimple stmt = gsi_stmt (ittr);
4048 switch (gimple_code (stmt))
4051 err |= verify_types_in_gimple_seq_2 (gimple_bind_body (stmt));
4055 err |= verify_types_in_gimple_seq_2 (gimple_try_eval (stmt));
4056 err |= verify_types_in_gimple_seq_2 (gimple_try_cleanup (stmt));
4059 case GIMPLE_EH_FILTER:
4060 err |= verify_types_in_gimple_seq_2 (gimple_eh_filter_failure (stmt));
4064 err |= verify_types_in_gimple_seq_2 (gimple_catch_handler (stmt));
4069 bool err2 = verify_types_in_gimple_stmt (stmt);
4071 debug_gimple_stmt (stmt);
4081 /* Verify the GIMPLE statements inside the statement list STMTS. */
4084 verify_types_in_gimple_seq (gimple_seq stmts)
4086 if (verify_types_in_gimple_seq_2 (stmts))
4087 internal_error ("verify_gimple failed");
4091 /* Verify STMT, return true if STMT is not in GIMPLE form.
4092 TODO: Implement type checking. */
4095 verify_stmt (gimple_stmt_iterator *gsi)
4098 struct walk_stmt_info wi;
4099 bool last_in_block = gsi_one_before_end_p (*gsi);
4100 gimple stmt = gsi_stmt (*gsi);
4103 if (is_gimple_omp (stmt))
4105 /* OpenMP directives are validated by the FE and never operated
4106 on by the optimizers. Furthermore, GIMPLE_OMP_FOR may contain
4107 non-gimple expressions when the main index variable has had
4108 its address taken. This does not affect the loop itself
4109 because the header of an GIMPLE_OMP_FOR is merely used to determine
4110 how to setup the parallel iteration. */
4114 /* FIXME. The C frontend passes unpromoted arguments in case it
4115 didn't see a function declaration before the call. */
4116 if (is_gimple_call (stmt))
4120 if (!is_gimple_call_addr (gimple_call_fn (stmt)))
4122 error ("invalid function in call statement");
4126 decl = gimple_call_fndecl (stmt);
4128 && TREE_CODE (decl) == FUNCTION_DECL
4129 && DECL_LOOPING_CONST_OR_PURE_P (decl)
4130 && (!DECL_PURE_P (decl))
4131 && (!TREE_READONLY (decl)))
4133 error ("invalid pure const state for function");
4138 if (is_gimple_debug (stmt))
4141 memset (&wi, 0, sizeof (wi));
4142 addr = walk_gimple_op (gsi_stmt (*gsi), verify_expr, &wi);
4145 debug_generic_expr (addr);
4146 inform (gimple_location (gsi_stmt (*gsi)), "in statement");
4147 debug_gimple_stmt (stmt);
4151 /* If the statement is marked as part of an EH region, then it is
4152 expected that the statement could throw. Verify that when we
4153 have optimizations that simplify statements such that we prove
4154 that they cannot throw, that we update other data structures
4156 lp_nr = lookup_stmt_eh_lp (stmt);
4159 if (!stmt_could_throw_p (stmt))
4161 error ("statement marked for throw, but doesn%'t");
4164 else if (lp_nr > 0 && !last_in_block && stmt_can_throw_internal (stmt))
4166 error ("statement marked for throw in middle of block");
4174 debug_gimple_stmt (stmt);
4179 /* Return true when the T can be shared. */
4182 tree_node_can_be_shared (tree t)
4184 if (IS_TYPE_OR_DECL_P (t)
4185 || is_gimple_min_invariant (t)
4186 || TREE_CODE (t) == SSA_NAME
4187 || t == error_mark_node
4188 || TREE_CODE (t) == IDENTIFIER_NODE)
4191 if (TREE_CODE (t) == CASE_LABEL_EXPR)
4194 while (((TREE_CODE (t) == ARRAY_REF || TREE_CODE (t) == ARRAY_RANGE_REF)
4195 && is_gimple_min_invariant (TREE_OPERAND (t, 1)))
4196 || TREE_CODE (t) == COMPONENT_REF
4197 || TREE_CODE (t) == REALPART_EXPR
4198 || TREE_CODE (t) == IMAGPART_EXPR)
4199 t = TREE_OPERAND (t, 0);
4208 /* Called via walk_gimple_stmt. Verify tree sharing. */
4211 verify_node_sharing (tree *tp, int *walk_subtrees, void *data)
4213 struct walk_stmt_info *wi = (struct walk_stmt_info *) data;
4214 struct pointer_set_t *visited = (struct pointer_set_t *) wi->info;
4216 if (tree_node_can_be_shared (*tp))
4218 *walk_subtrees = false;
4222 if (pointer_set_insert (visited, *tp))
4229 static bool eh_error_found;
4231 verify_eh_throw_stmt_node (void **slot, void *data)
4233 struct throw_stmt_node *node = (struct throw_stmt_node *)*slot;
4234 struct pointer_set_t *visited = (struct pointer_set_t *) data;
4236 if (!pointer_set_contains (visited, node->stmt))
4238 error ("Dead STMT in EH table");
4239 debug_gimple_stmt (node->stmt);
4240 eh_error_found = true;
4246 /* Verify the GIMPLE statements in every basic block. */
4252 gimple_stmt_iterator gsi;
4254 struct pointer_set_t *visited, *visited_stmts;
4256 struct walk_stmt_info wi;
4258 timevar_push (TV_TREE_STMT_VERIFY);
4259 visited = pointer_set_create ();
4260 visited_stmts = pointer_set_create ();
4262 memset (&wi, 0, sizeof (wi));
4263 wi.info = (void *) visited;
4270 for (gsi = gsi_start_phis (bb); !gsi_end_p (gsi); gsi_next (&gsi))
4272 phi = gsi_stmt (gsi);
4273 pointer_set_insert (visited_stmts, phi);
4274 if (gimple_bb (phi) != bb)
4276 error ("gimple_bb (phi) is set to a wrong basic block");
4280 for (i = 0; i < gimple_phi_num_args (phi); i++)
4282 tree t = gimple_phi_arg_def (phi, i);
4287 error ("missing PHI def");
4288 debug_gimple_stmt (phi);
4292 /* Addressable variables do have SSA_NAMEs but they
4293 are not considered gimple values. */
4294 else if (TREE_CODE (t) != SSA_NAME
4295 && TREE_CODE (t) != FUNCTION_DECL
4296 && !is_gimple_min_invariant (t))
4298 error ("PHI argument is not a GIMPLE value");
4299 debug_gimple_stmt (phi);
4300 debug_generic_expr (t);
4304 addr = walk_tree (&t, verify_node_sharing, visited, NULL);
4307 error ("incorrect sharing of tree nodes");
4308 debug_gimple_stmt (phi);
4309 debug_generic_expr (addr);
4314 #ifdef ENABLE_TYPES_CHECKING
4315 if (verify_gimple_phi (phi))
4317 debug_gimple_stmt (phi);
4323 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); )
4325 gimple stmt = gsi_stmt (gsi);
4327 if (gimple_code (stmt) == GIMPLE_WITH_CLEANUP_EXPR
4328 || gimple_code (stmt) == GIMPLE_BIND)
4330 error ("invalid GIMPLE statement");
4331 debug_gimple_stmt (stmt);
4335 pointer_set_insert (visited_stmts, stmt);
4337 if (gimple_bb (stmt) != bb)
4339 error ("gimple_bb (stmt) is set to a wrong basic block");
4340 debug_gimple_stmt (stmt);
4344 if (gimple_code (stmt) == GIMPLE_LABEL)
4346 tree decl = gimple_label_label (stmt);
4347 int uid = LABEL_DECL_UID (decl);
4350 || VEC_index (basic_block, label_to_block_map, uid) != bb)
4352 error ("incorrect entry in label_to_block_map");
4356 uid = EH_LANDING_PAD_NR (decl);
4359 eh_landing_pad lp = get_eh_landing_pad_from_number (uid);
4360 if (decl != lp->post_landing_pad)
4362 error ("incorrect setting of landing pad number");
4368 err |= verify_stmt (&gsi);
4370 #ifdef ENABLE_TYPES_CHECKING
4371 if (verify_types_in_gimple_stmt (gsi_stmt (gsi)))
4373 debug_gimple_stmt (stmt);
4377 addr = walk_gimple_op (gsi_stmt (gsi), verify_node_sharing, &wi);
4380 error ("incorrect sharing of tree nodes");
4381 debug_gimple_stmt (stmt);
4382 debug_generic_expr (addr);
4389 eh_error_found = false;
4390 if (get_eh_throw_stmt_table (cfun))
4391 htab_traverse (get_eh_throw_stmt_table (cfun),
4392 verify_eh_throw_stmt_node,
4395 if (err | eh_error_found)
4396 internal_error ("verify_stmts failed");
4398 pointer_set_destroy (visited);
4399 pointer_set_destroy (visited_stmts);
4400 verify_histograms ();
4401 timevar_pop (TV_TREE_STMT_VERIFY);
4405 /* Verifies that the flow information is OK. */
4408 gimple_verify_flow_info (void)
4412 gimple_stmt_iterator gsi;
4417 if (ENTRY_BLOCK_PTR->il.gimple)
4419 error ("ENTRY_BLOCK has IL associated with it");
4423 if (EXIT_BLOCK_PTR->il.gimple)
4425 error ("EXIT_BLOCK has IL associated with it");
4429 FOR_EACH_EDGE (e, ei, EXIT_BLOCK_PTR->preds)
4430 if (e->flags & EDGE_FALLTHRU)
4432 error ("fallthru to exit from bb %d", e->src->index);
4438 bool found_ctrl_stmt = false;
4442 /* Skip labels on the start of basic block. */
4443 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
4446 gimple prev_stmt = stmt;
4448 stmt = gsi_stmt (gsi);
4450 if (gimple_code (stmt) != GIMPLE_LABEL)
4453 label = gimple_label_label (stmt);
4454 if (prev_stmt && DECL_NONLOCAL (label))
4456 error ("nonlocal label ");
4457 print_generic_expr (stderr, label, 0);
4458 fprintf (stderr, " is not first in a sequence of labels in bb %d",
4463 if (prev_stmt && EH_LANDING_PAD_NR (label) != 0)
4465 error ("EH landing pad label ");
4466 print_generic_expr (stderr, label, 0);
4467 fprintf (stderr, " is not first in a sequence of labels in bb %d",
4472 if (label_to_block (label) != bb)
4475 print_generic_expr (stderr, label, 0);
4476 fprintf (stderr, " to block does not match in bb %d",
4481 if (decl_function_context (label) != current_function_decl)
4484 print_generic_expr (stderr, label, 0);
4485 fprintf (stderr, " has incorrect context in bb %d",
4491 /* Verify that body of basic block BB is free of control flow. */
4492 for (; !gsi_end_p (gsi); gsi_next (&gsi))
4494 gimple stmt = gsi_stmt (gsi);
4496 if (found_ctrl_stmt)
4498 error ("control flow in the middle of basic block %d",
4503 if (stmt_ends_bb_p (stmt))
4504 found_ctrl_stmt = true;
4506 if (gimple_code (stmt) == GIMPLE_LABEL)
4509 print_generic_expr (stderr, gimple_label_label (stmt), 0);
4510 fprintf (stderr, " in the middle of basic block %d", bb->index);
4515 gsi = gsi_last_bb (bb);
4516 if (gsi_end_p (gsi))
4519 stmt = gsi_stmt (gsi);
4521 if (gimple_code (stmt) == GIMPLE_LABEL)
4524 err |= verify_eh_edges (stmt);
4526 if (is_ctrl_stmt (stmt))
4528 FOR_EACH_EDGE (e, ei, bb->succs)
4529 if (e->flags & EDGE_FALLTHRU)
4531 error ("fallthru edge after a control statement in bb %d",
4537 if (gimple_code (stmt) != GIMPLE_COND)
4539 /* Verify that there are no edges with EDGE_TRUE/FALSE_FLAG set
4540 after anything else but if statement. */
4541 FOR_EACH_EDGE (e, ei, bb->succs)
4542 if (e->flags & (EDGE_TRUE_VALUE | EDGE_FALSE_VALUE))
4544 error ("true/false edge after a non-GIMPLE_COND in bb %d",
4550 switch (gimple_code (stmt))
4557 extract_true_false_edges_from_block (bb, &true_edge, &false_edge);
4561 || !(true_edge->flags & EDGE_TRUE_VALUE)
4562 || !(false_edge->flags & EDGE_FALSE_VALUE)
4563 || (true_edge->flags & (EDGE_FALLTHRU | EDGE_ABNORMAL))
4564 || (false_edge->flags & (EDGE_FALLTHRU | EDGE_ABNORMAL))
4565 || EDGE_COUNT (bb->succs) >= 3)
4567 error ("wrong outgoing edge flags at end of bb %d",
4575 if (simple_goto_p (stmt))
4577 error ("explicit goto at end of bb %d", bb->index);
4582 /* FIXME. We should double check that the labels in the
4583 destination blocks have their address taken. */
4584 FOR_EACH_EDGE (e, ei, bb->succs)
4585 if ((e->flags & (EDGE_FALLTHRU | EDGE_TRUE_VALUE
4586 | EDGE_FALSE_VALUE))
4587 || !(e->flags & EDGE_ABNORMAL))
4589 error ("wrong outgoing edge flags at end of bb %d",
4597 if (!gimple_call_builtin_p (stmt, BUILT_IN_RETURN))
4599 /* ... fallthru ... */
4601 if (!single_succ_p (bb)
4602 || (single_succ_edge (bb)->flags
4603 & (EDGE_FALLTHRU | EDGE_ABNORMAL
4604 | EDGE_TRUE_VALUE | EDGE_FALSE_VALUE)))
4606 error ("wrong outgoing edge flags at end of bb %d", bb->index);
4609 if (single_succ (bb) != EXIT_BLOCK_PTR)
4611 error ("return edge does not point to exit in bb %d",
4623 n = gimple_switch_num_labels (stmt);
4625 /* Mark all the destination basic blocks. */
4626 for (i = 0; i < n; ++i)
4628 tree lab = CASE_LABEL (gimple_switch_label (stmt, i));
4629 basic_block label_bb = label_to_block (lab);
4630 gcc_assert (!label_bb->aux || label_bb->aux == (void *)1);
4631 label_bb->aux = (void *)1;
4634 /* Verify that the case labels are sorted. */
4635 prev = gimple_switch_label (stmt, 0);
4636 for (i = 1; i < n; ++i)
4638 tree c = gimple_switch_label (stmt, i);
4641 error ("found default case not at the start of "
4647 && !tree_int_cst_lt (CASE_LOW (prev), CASE_LOW (c)))
4649 error ("case labels not sorted: ");
4650 print_generic_expr (stderr, prev, 0);
4651 fprintf (stderr," is greater than ");
4652 print_generic_expr (stderr, c, 0);
4653 fprintf (stderr," but comes before it.\n");
4658 /* VRP will remove the default case if it can prove it will
4659 never be executed. So do not verify there always exists
4660 a default case here. */
4662 FOR_EACH_EDGE (e, ei, bb->succs)
4666 error ("extra outgoing edge %d->%d",
4667 bb->index, e->dest->index);
4671 e->dest->aux = (void *)2;
4672 if ((e->flags & (EDGE_FALLTHRU | EDGE_ABNORMAL
4673 | EDGE_TRUE_VALUE | EDGE_FALSE_VALUE)))
4675 error ("wrong outgoing edge flags at end of bb %d",
4681 /* Check that we have all of them. */
4682 for (i = 0; i < n; ++i)
4684 tree lab = CASE_LABEL (gimple_switch_label (stmt, i));
4685 basic_block label_bb = label_to_block (lab);
4687 if (label_bb->aux != (void *)2)
4689 error ("missing edge %i->%i", bb->index, label_bb->index);
4694 FOR_EACH_EDGE (e, ei, bb->succs)
4695 e->dest->aux = (void *)0;
4699 case GIMPLE_EH_DISPATCH:
4700 err |= verify_eh_dispatch_edge (stmt);
4708 if (dom_info_state (CDI_DOMINATORS) >= DOM_NO_FAST_QUERY)
4709 verify_dominators (CDI_DOMINATORS);
4715 /* Updates phi nodes after creating a forwarder block joined
4716 by edge FALLTHRU. */
4719 gimple_make_forwarder_block (edge fallthru)
4723 basic_block dummy, bb;
4725 gimple_stmt_iterator gsi;
4727 dummy = fallthru->src;
4728 bb = fallthru->dest;
4730 if (single_pred_p (bb))
4733 /* If we redirected a branch we must create new PHI nodes at the
4735 for (gsi = gsi_start_phis (dummy); !gsi_end_p (gsi); gsi_next (&gsi))
4737 gimple phi, new_phi;
4739 phi = gsi_stmt (gsi);
4740 var = gimple_phi_result (phi);
4741 new_phi = create_phi_node (var, bb);
4742 SSA_NAME_DEF_STMT (var) = new_phi;
4743 gimple_phi_set_result (phi, make_ssa_name (SSA_NAME_VAR (var), phi));
4744 add_phi_arg (new_phi, gimple_phi_result (phi), fallthru,
4748 /* Add the arguments we have stored on edges. */
4749 FOR_EACH_EDGE (e, ei, bb->preds)
4754 flush_pending_stmts (e);
4759 /* Return a non-special label in the head of basic block BLOCK.
4760 Create one if it doesn't exist. */
4763 gimple_block_label (basic_block bb)
4765 gimple_stmt_iterator i, s = gsi_start_bb (bb);
4770 for (i = s; !gsi_end_p (i); first = false, gsi_next (&i))
4772 stmt = gsi_stmt (i);
4773 if (gimple_code (stmt) != GIMPLE_LABEL)
4775 label = gimple_label_label (stmt);
4776 if (!DECL_NONLOCAL (label))
4779 gsi_move_before (&i, &s);
4784 label = create_artificial_label (UNKNOWN_LOCATION);
4785 stmt = gimple_build_label (label);
4786 gsi_insert_before (&s, stmt, GSI_NEW_STMT);
4791 /* Attempt to perform edge redirection by replacing a possibly complex
4792 jump instruction by a goto or by removing the jump completely.
4793 This can apply only if all edges now point to the same block. The
4794 parameters and return values are equivalent to
4795 redirect_edge_and_branch. */
4798 gimple_try_redirect_by_replacing_jump (edge e, basic_block target)
4800 basic_block src = e->src;
4801 gimple_stmt_iterator i;
4804 /* We can replace or remove a complex jump only when we have exactly
4806 if (EDGE_COUNT (src->succs) != 2
4807 /* Verify that all targets will be TARGET. Specifically, the
4808 edge that is not E must also go to TARGET. */
4809 || EDGE_SUCC (src, EDGE_SUCC (src, 0) == e)->dest != target)
4812 i = gsi_last_bb (src);
4816 stmt = gsi_stmt (i);
4818 if (gimple_code (stmt) == GIMPLE_COND || gimple_code (stmt) == GIMPLE_SWITCH)
4820 gsi_remove (&i, true);
4821 e = ssa_redirect_edge (e, target);
4822 e->flags = EDGE_FALLTHRU;
4830 /* Redirect E to DEST. Return NULL on failure. Otherwise, return the
4831 edge representing the redirected branch. */
4834 gimple_redirect_edge_and_branch (edge e, basic_block dest)
4836 basic_block bb = e->src;
4837 gimple_stmt_iterator gsi;
4841 if (e->flags & EDGE_ABNORMAL)
4844 if (e->dest == dest)
4847 if (e->flags & EDGE_EH)
4848 return redirect_eh_edge (e, dest);
4850 if (e->src != ENTRY_BLOCK_PTR)
4852 ret = gimple_try_redirect_by_replacing_jump (e, dest);
4857 gsi = gsi_last_bb (bb);
4858 stmt = gsi_end_p (gsi) ? NULL : gsi_stmt (gsi);
4860 switch (stmt ? gimple_code (stmt) : GIMPLE_ERROR_MARK)
4863 /* For COND_EXPR, we only need to redirect the edge. */
4867 /* No non-abnormal edges should lead from a non-simple goto, and
4868 simple ones should be represented implicitly. */
4873 tree label = gimple_block_label (dest);
4874 tree cases = get_cases_for_edge (e, stmt);
4876 /* If we have a list of cases associated with E, then use it
4877 as it's a lot faster than walking the entire case vector. */
4880 edge e2 = find_edge (e->src, dest);
4887 CASE_LABEL (cases) = label;
4888 cases = TREE_CHAIN (cases);
4891 /* If there was already an edge in the CFG, then we need
4892 to move all the cases associated with E to E2. */
4895 tree cases2 = get_cases_for_edge (e2, stmt);
4897 TREE_CHAIN (last) = TREE_CHAIN (cases2);
4898 TREE_CHAIN (cases2) = first;
4900 bitmap_set_bit (touched_switch_bbs, gimple_bb (stmt)->index);
4904 size_t i, n = gimple_switch_num_labels (stmt);
4906 for (i = 0; i < n; i++)
4908 tree elt = gimple_switch_label (stmt, i);
4909 if (label_to_block (CASE_LABEL (elt)) == e->dest)
4910 CASE_LABEL (elt) = label;
4918 int i, n = gimple_asm_nlabels (stmt);
4921 for (i = 0; i < n; ++i)
4923 tree cons = gimple_asm_label_op (stmt, i);
4924 if (label_to_block (TREE_VALUE (cons)) == e->dest)
4927 label = gimple_block_label (dest);
4928 TREE_VALUE (cons) = label;
4932 /* If we didn't find any label matching the former edge in the
4933 asm labels, we must be redirecting the fallthrough
4935 gcc_assert (label || (e->flags & EDGE_FALLTHRU));
4940 gsi_remove (&gsi, true);
4941 e->flags |= EDGE_FALLTHRU;
4944 case GIMPLE_OMP_RETURN:
4945 case GIMPLE_OMP_CONTINUE:
4946 case GIMPLE_OMP_SECTIONS_SWITCH:
4947 case GIMPLE_OMP_FOR:
4948 /* The edges from OMP constructs can be simply redirected. */
4951 case GIMPLE_EH_DISPATCH:
4952 if (!(e->flags & EDGE_FALLTHRU))
4953 redirect_eh_dispatch_edge (stmt, e, dest);
4957 /* Otherwise it must be a fallthru edge, and we don't need to
4958 do anything besides redirecting it. */
4959 gcc_assert (e->flags & EDGE_FALLTHRU);
4963 /* Update/insert PHI nodes as necessary. */
4965 /* Now update the edges in the CFG. */
4966 e = ssa_redirect_edge (e, dest);
4971 /* Returns true if it is possible to remove edge E by redirecting
4972 it to the destination of the other edge from E->src. */
4975 gimple_can_remove_branch_p (const_edge e)
4977 if (e->flags & (EDGE_ABNORMAL | EDGE_EH))
4983 /* Simple wrapper, as we can always redirect fallthru edges. */
4986 gimple_redirect_edge_and_branch_force (edge e, basic_block dest)
4988 e = gimple_redirect_edge_and_branch (e, dest);
4995 /* Splits basic block BB after statement STMT (but at least after the
4996 labels). If STMT is NULL, BB is split just after the labels. */
4999 gimple_split_block (basic_block bb, void *stmt)
5001 gimple_stmt_iterator gsi;
5002 gimple_stmt_iterator gsi_tgt;
5009 new_bb = create_empty_bb (bb);
5011 /* Redirect the outgoing edges. */
5012 new_bb->succs = bb->succs;
5014 FOR_EACH_EDGE (e, ei, new_bb->succs)
5017 if (stmt && gimple_code ((gimple) stmt) == GIMPLE_LABEL)
5020 /* Move everything from GSI to the new basic block. */
5021 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
5023 act = gsi_stmt (gsi);
5024 if (gimple_code (act) == GIMPLE_LABEL)
5037 if (gsi_end_p (gsi))
5040 /* Split the statement list - avoid re-creating new containers as this
5041 brings ugly quadratic memory consumption in the inliner.
5042 (We are still quadratic since we need to update stmt BB pointers,
5044 list = gsi_split_seq_before (&gsi);
5045 set_bb_seq (new_bb, list);
5046 for (gsi_tgt = gsi_start (list);
5047 !gsi_end_p (gsi_tgt); gsi_next (&gsi_tgt))
5048 gimple_set_bb (gsi_stmt (gsi_tgt), new_bb);
5054 /* Moves basic block BB after block AFTER. */
5057 gimple_move_block_after (basic_block bb, basic_block after)
5059 if (bb->prev_bb == after)
5063 link_block (bb, after);
5069 /* Return true if basic_block can be duplicated. */
5072 gimple_can_duplicate_bb_p (const_basic_block bb ATTRIBUTE_UNUSED)
5077 /* Create a duplicate of the basic block BB. NOTE: This does not
5078 preserve SSA form. */
5081 gimple_duplicate_bb (basic_block bb)
5084 gimple_stmt_iterator gsi, gsi_tgt;
5085 gimple_seq phis = phi_nodes (bb);
5086 gimple phi, stmt, copy;
5088 new_bb = create_empty_bb (EXIT_BLOCK_PTR->prev_bb);
5090 /* Copy the PHI nodes. We ignore PHI node arguments here because
5091 the incoming edges have not been setup yet. */
5092 for (gsi = gsi_start (phis); !gsi_end_p (gsi); gsi_next (&gsi))
5094 phi = gsi_stmt (gsi);
5095 copy = create_phi_node (gimple_phi_result (phi), new_bb);
5096 create_new_def_for (gimple_phi_result (copy), copy,
5097 gimple_phi_result_ptr (copy));
5100 gsi_tgt = gsi_start_bb (new_bb);
5101 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
5103 def_operand_p def_p;
5104 ssa_op_iter op_iter;
5106 stmt = gsi_stmt (gsi);
5107 if (gimple_code (stmt) == GIMPLE_LABEL)
5110 /* Create a new copy of STMT and duplicate STMT's virtual
5112 copy = gimple_copy (stmt);
5113 gsi_insert_after (&gsi_tgt, copy, GSI_NEW_STMT);
5115 maybe_duplicate_eh_stmt (copy, stmt);
5116 gimple_duplicate_stmt_histograms (cfun, copy, cfun, stmt);
5118 /* Create new names for all the definitions created by COPY and
5119 add replacement mappings for each new name. */
5120 FOR_EACH_SSA_DEF_OPERAND (def_p, copy, op_iter, SSA_OP_ALL_DEFS)
5121 create_new_def_for (DEF_FROM_PTR (def_p), copy, def_p);
5127 /* Adds phi node arguments for edge E_COPY after basic block duplication. */
5130 add_phi_args_after_copy_edge (edge e_copy)
5132 basic_block bb, bb_copy = e_copy->src, dest;
5135 gimple phi, phi_copy;
5137 gimple_stmt_iterator psi, psi_copy;
5139 if (gimple_seq_empty_p (phi_nodes (e_copy->dest)))
5142 bb = bb_copy->flags & BB_DUPLICATED ? get_bb_original (bb_copy) : bb_copy;
5144 if (e_copy->dest->flags & BB_DUPLICATED)
5145 dest = get_bb_original (e_copy->dest);
5147 dest = e_copy->dest;
5149 e = find_edge (bb, dest);
5152 /* During loop unrolling the target of the latch edge is copied.
5153 In this case we are not looking for edge to dest, but to
5154 duplicated block whose original was dest. */
5155 FOR_EACH_EDGE (e, ei, bb->succs)
5157 if ((e->dest->flags & BB_DUPLICATED)
5158 && get_bb_original (e->dest) == dest)
5162 gcc_assert (e != NULL);
5165 for (psi = gsi_start_phis (e->dest),
5166 psi_copy = gsi_start_phis (e_copy->dest);
5168 gsi_next (&psi), gsi_next (&psi_copy))
5170 phi = gsi_stmt (psi);
5171 phi_copy = gsi_stmt (psi_copy);
5172 def = PHI_ARG_DEF_FROM_EDGE (phi, e);
5173 add_phi_arg (phi_copy, def, e_copy,
5174 gimple_phi_arg_location_from_edge (phi, e));
5179 /* Basic block BB_COPY was created by code duplication. Add phi node
5180 arguments for edges going out of BB_COPY. The blocks that were
5181 duplicated have BB_DUPLICATED set. */
5184 add_phi_args_after_copy_bb (basic_block bb_copy)
5189 FOR_EACH_EDGE (e_copy, ei, bb_copy->succs)
5191 add_phi_args_after_copy_edge (e_copy);
5195 /* Blocks in REGION_COPY array of length N_REGION were created by
5196 duplication of basic blocks. Add phi node arguments for edges
5197 going from these blocks. If E_COPY is not NULL, also add
5198 phi node arguments for its destination.*/
5201 add_phi_args_after_copy (basic_block *region_copy, unsigned n_region,
5206 for (i = 0; i < n_region; i++)
5207 region_copy[i]->flags |= BB_DUPLICATED;
5209 for (i = 0; i < n_region; i++)
5210 add_phi_args_after_copy_bb (region_copy[i]);
5212 add_phi_args_after_copy_edge (e_copy);
5214 for (i = 0; i < n_region; i++)
5215 region_copy[i]->flags &= ~BB_DUPLICATED;
5218 /* Duplicates a REGION (set of N_REGION basic blocks) with just a single
5219 important exit edge EXIT. By important we mean that no SSA name defined
5220 inside region is live over the other exit edges of the region. All entry
5221 edges to the region must go to ENTRY->dest. The edge ENTRY is redirected
5222 to the duplicate of the region. SSA form, dominance and loop information
5223 is updated. The new basic blocks are stored to REGION_COPY in the same
5224 order as they had in REGION, provided that REGION_COPY is not NULL.
5225 The function returns false if it is unable to copy the region,
5229 gimple_duplicate_sese_region (edge entry, edge exit,
5230 basic_block *region, unsigned n_region,
5231 basic_block *region_copy)
5234 bool free_region_copy = false, copying_header = false;
5235 struct loop *loop = entry->dest->loop_father;
5237 VEC (basic_block, heap) *doms;
5239 int total_freq = 0, entry_freq = 0;
5240 gcov_type total_count = 0, entry_count = 0;
5242 if (!can_copy_bbs_p (region, n_region))
5245 /* Some sanity checking. Note that we do not check for all possible
5246 missuses of the functions. I.e. if you ask to copy something weird,
5247 it will work, but the state of structures probably will not be
5249 for (i = 0; i < n_region; i++)
5251 /* We do not handle subloops, i.e. all the blocks must belong to the
5253 if (region[i]->loop_father != loop)
5256 if (region[i] != entry->dest
5257 && region[i] == loop->header)
5261 set_loop_copy (loop, loop);
5263 /* In case the function is used for loop header copying (which is the primary
5264 use), ensure that EXIT and its copy will be new latch and entry edges. */
5265 if (loop->header == entry->dest)
5267 copying_header = true;
5268 set_loop_copy (loop, loop_outer (loop));
5270 if (!dominated_by_p (CDI_DOMINATORS, loop->latch, exit->src))
5273 for (i = 0; i < n_region; i++)
5274 if (region[i] != exit->src
5275 && dominated_by_p (CDI_DOMINATORS, region[i], exit->src))
5281 region_copy = XNEWVEC (basic_block, n_region);
5282 free_region_copy = true;
5285 gcc_assert (!need_ssa_update_p (cfun));
5287 /* Record blocks outside the region that are dominated by something
5290 initialize_original_copy_tables ();
5292 doms = get_dominated_by_region (CDI_DOMINATORS, region, n_region);
5294 if (entry->dest->count)
5296 total_count = entry->dest->count;
5297 entry_count = entry->count;
5298 /* Fix up corner cases, to avoid division by zero or creation of negative
5300 if (entry_count > total_count)
5301 entry_count = total_count;
5305 total_freq = entry->dest->frequency;
5306 entry_freq = EDGE_FREQUENCY (entry);
5307 /* Fix up corner cases, to avoid division by zero or creation of negative
5309 if (total_freq == 0)
5311 else if (entry_freq > total_freq)
5312 entry_freq = total_freq;
5315 copy_bbs (region, n_region, region_copy, &exit, 1, &exit_copy, loop,
5316 split_edge_bb_loc (entry));
5319 scale_bbs_frequencies_gcov_type (region, n_region,
5320 total_count - entry_count,
5322 scale_bbs_frequencies_gcov_type (region_copy, n_region, entry_count,
5327 scale_bbs_frequencies_int (region, n_region, total_freq - entry_freq,
5329 scale_bbs_frequencies_int (region_copy, n_region, entry_freq, total_freq);
5334 loop->header = exit->dest;
5335 loop->latch = exit->src;
5338 /* Redirect the entry and add the phi node arguments. */
5339 redirected = redirect_edge_and_branch (entry, get_bb_copy (entry->dest));
5340 gcc_assert (redirected != NULL);
5341 flush_pending_stmts (entry);
5343 /* Concerning updating of dominators: We must recount dominators
5344 for entry block and its copy. Anything that is outside of the
5345 region, but was dominated by something inside needs recounting as
5347 set_immediate_dominator (CDI_DOMINATORS, entry->dest, entry->src);
5348 VEC_safe_push (basic_block, heap, doms, get_bb_original (entry->dest));
5349 iterate_fix_dominators (CDI_DOMINATORS, doms, false);
5350 VEC_free (basic_block, heap, doms);
5352 /* Add the other PHI node arguments. */
5353 add_phi_args_after_copy (region_copy, n_region, NULL);
5355 /* Update the SSA web. */
5356 update_ssa (TODO_update_ssa);
5358 if (free_region_copy)
5361 free_original_copy_tables ();
5365 /* Duplicates REGION consisting of N_REGION blocks. The new blocks
5366 are stored to REGION_COPY in the same order in that they appear
5367 in REGION, if REGION_COPY is not NULL. ENTRY is the entry to
5368 the region, EXIT an exit from it. The condition guarding EXIT
5369 is moved to ENTRY. Returns true if duplication succeeds, false
5395 gimple_duplicate_sese_tail (edge entry ATTRIBUTE_UNUSED, edge exit ATTRIBUTE_UNUSED,
5396 basic_block *region ATTRIBUTE_UNUSED, unsigned n_region ATTRIBUTE_UNUSED,
5397 basic_block *region_copy ATTRIBUTE_UNUSED)
5400 bool free_region_copy = false;
5401 struct loop *loop = exit->dest->loop_father;
5402 struct loop *orig_loop = entry->dest->loop_father;
5403 basic_block switch_bb, entry_bb, nentry_bb;
5404 VEC (basic_block, heap) *doms;
5405 int total_freq = 0, exit_freq = 0;
5406 gcov_type total_count = 0, exit_count = 0;
5407 edge exits[2], nexits[2], e;
5408 gimple_stmt_iterator gsi,gsi1;
5411 basic_block exit_bb;
5412 basic_block iters_bb;
5414 gimple_stmt_iterator psi;
5418 gcc_assert (EDGE_COUNT (exit->src->succs) == 2);
5420 exits[1] = EDGE_SUCC (exit->src, EDGE_SUCC (exit->src, 0) == exit);
5422 if (!can_copy_bbs_p (region, n_region))
5425 initialize_original_copy_tables ();
5426 set_loop_copy (orig_loop, loop);
5427 duplicate_subloops (orig_loop, loop);
5431 region_copy = XNEWVEC (basic_block, n_region);
5432 free_region_copy = true;
5435 gcc_assert (!need_ssa_update_p (cfun));
5437 /* Record blocks outside the region that are dominated by something
5439 doms = get_dominated_by_region (CDI_DOMINATORS, region, n_region);
5441 if (exit->src->count)
5443 total_count = exit->src->count;
5444 exit_count = exit->count;
5445 /* Fix up corner cases, to avoid division by zero or creation of negative
5447 if (exit_count > total_count)
5448 exit_count = total_count;
5452 total_freq = exit->src->frequency;
5453 exit_freq = EDGE_FREQUENCY (exit);
5454 /* Fix up corner cases, to avoid division by zero or creation of negative
5456 if (total_freq == 0)
5458 if (exit_freq > total_freq)
5459 exit_freq = total_freq;
5462 copy_bbs (region, n_region, region_copy, exits, 2, nexits, orig_loop,
5463 split_edge_bb_loc (exit));
5466 scale_bbs_frequencies_gcov_type (region, n_region,
5467 total_count - exit_count,
5469 scale_bbs_frequencies_gcov_type (region_copy, n_region, exit_count,
5474 scale_bbs_frequencies_int (region, n_region, total_freq - exit_freq,
5476 scale_bbs_frequencies_int (region_copy, n_region, exit_freq, total_freq);
5479 /* Create the switch block, and put the exit condition to it. */
5480 entry_bb = entry->dest;
5481 nentry_bb = get_bb_copy (entry_bb);
5482 if (!last_stmt (entry->src)
5483 || !stmt_ends_bb_p (last_stmt (entry->src)))
5484 switch_bb = entry->src;
5486 switch_bb = split_edge (entry);
5487 set_immediate_dominator (CDI_DOMINATORS, nentry_bb, switch_bb);
5489 gsi = gsi_last_bb (switch_bb);
5490 cond_stmt = last_stmt (exit->src);
5491 gcc_assert (gimple_code (cond_stmt) == GIMPLE_COND);
5492 cond_stmt = gimple_copy (cond_stmt);
5494 /* If the block consisting of the exit condition has the latch as
5495 successor, then the body of the loop is executed before
5496 the exit condition is tested. In such case, moving the
5497 condition to the entry, causes that the loop will iterate
5498 one less iteration (which is the wanted outcome, since we
5499 peel out the last iteration). If the body is executed after
5500 the condition, moving the condition to the entry requires
5501 decrementing one iteration. */
5502 if (exits[1]->dest == orig_loop->latch)
5503 new_rhs = gimple_cond_rhs (cond_stmt);
5506 new_rhs = fold_build2 (MINUS_EXPR, TREE_TYPE (gimple_cond_rhs (cond_stmt)),
5507 gimple_cond_rhs (cond_stmt),
5508 build_int_cst (TREE_TYPE (gimple_cond_rhs (cond_stmt)), 1));
5510 if (TREE_CODE (gimple_cond_rhs (cond_stmt)) == SSA_NAME)
5512 iters_bb = gimple_bb (SSA_NAME_DEF_STMT (gimple_cond_rhs (cond_stmt)));
5513 for (gsi1 = gsi_start_bb (iters_bb); !gsi_end_p (gsi1); gsi_next (&gsi1))
5514 if (gsi_stmt (gsi1) == SSA_NAME_DEF_STMT (gimple_cond_rhs (cond_stmt)))
5517 new_rhs = force_gimple_operand_gsi (&gsi1, new_rhs, true,
5518 NULL_TREE,false,GSI_CONTINUE_LINKING);
5521 gimple_cond_set_rhs (cond_stmt, unshare_expr (new_rhs));
5522 gimple_cond_set_lhs (cond_stmt, unshare_expr (gimple_cond_lhs (cond_stmt)));
5523 gsi_insert_after (&gsi, cond_stmt, GSI_NEW_STMT);
5525 sorig = single_succ_edge (switch_bb);
5526 sorig->flags = exits[1]->flags;
5527 snew = make_edge (switch_bb, nentry_bb, exits[0]->flags);
5529 /* Register the new edge from SWITCH_BB in loop exit lists. */
5530 rescan_loop_exit (snew, true, false);
5532 /* Add the PHI node arguments. */
5533 add_phi_args_after_copy (region_copy, n_region, snew);
5535 /* Get rid of now superfluous conditions and associated edges (and phi node
5537 exit_bb = exit->dest;
5539 e = redirect_edge_and_branch (exits[0], exits[1]->dest);
5540 PENDING_STMT (e) = NULL;
5542 /* The latch of ORIG_LOOP was copied, and so was the backedge
5543 to the original header. We redirect this backedge to EXIT_BB. */
5544 for (i = 0; i < n_region; i++)
5545 if (get_bb_original (region_copy[i]) == orig_loop->latch)
5547 gcc_assert (single_succ_edge (region_copy[i]));
5548 e = redirect_edge_and_branch (single_succ_edge (region_copy[i]), exit_bb);
5549 PENDING_STMT (e) = NULL;
5550 for (psi = gsi_start_phis (exit_bb);
5554 phi = gsi_stmt (psi);
5555 def = PHI_ARG_DEF (phi, nexits[0]->dest_idx);
5556 add_phi_arg (phi, def, e, gimple_phi_arg_location_from_edge (phi, e));
5559 e = redirect_edge_and_branch (nexits[0], nexits[1]->dest);
5560 PENDING_STMT (e) = NULL;
5562 /* Anything that is outside of the region, but was dominated by something
5563 inside needs to update dominance info. */
5564 iterate_fix_dominators (CDI_DOMINATORS, doms, false);
5565 VEC_free (basic_block, heap, doms);
5566 /* Update the SSA web. */
5567 update_ssa (TODO_update_ssa);
5569 if (free_region_copy)
5572 free_original_copy_tables ();
5576 /* Add all the blocks dominated by ENTRY to the array BBS_P. Stop
5577 adding blocks when the dominator traversal reaches EXIT. This
5578 function silently assumes that ENTRY strictly dominates EXIT. */
5581 gather_blocks_in_sese_region (basic_block entry, basic_block exit,
5582 VEC(basic_block,heap) **bbs_p)
5586 for (son = first_dom_son (CDI_DOMINATORS, entry);
5588 son = next_dom_son (CDI_DOMINATORS, son))
5590 VEC_safe_push (basic_block, heap, *bbs_p, son);
5592 gather_blocks_in_sese_region (son, exit, bbs_p);
5596 /* Replaces *TP with a duplicate (belonging to function TO_CONTEXT).
5597 The duplicates are recorded in VARS_MAP. */
5600 replace_by_duplicate_decl (tree *tp, struct pointer_map_t *vars_map,
5603 tree t = *tp, new_t;
5604 struct function *f = DECL_STRUCT_FUNCTION (to_context);
5607 if (DECL_CONTEXT (t) == to_context)
5610 loc = pointer_map_contains (vars_map, t);
5614 loc = pointer_map_insert (vars_map, t);
5618 new_t = copy_var_decl (t, DECL_NAME (t), TREE_TYPE (t));
5619 add_local_decl (f, new_t);
5623 gcc_assert (TREE_CODE (t) == CONST_DECL);
5624 new_t = copy_node (t);
5626 DECL_CONTEXT (new_t) = to_context;
5631 new_t = (tree) *loc;
5637 /* Creates an ssa name in TO_CONTEXT equivalent to NAME.
5638 VARS_MAP maps old ssa names and var_decls to the new ones. */
5641 replace_ssa_name (tree name, struct pointer_map_t *vars_map,
5645 tree new_name, decl = SSA_NAME_VAR (name);
5647 gcc_assert (is_gimple_reg (name));
5649 loc = pointer_map_contains (vars_map, name);
5653 replace_by_duplicate_decl (&decl, vars_map, to_context);
5655 push_cfun (DECL_STRUCT_FUNCTION (to_context));
5656 if (gimple_in_ssa_p (cfun))
5657 add_referenced_var (decl);
5659 new_name = make_ssa_name (decl, SSA_NAME_DEF_STMT (name));
5660 if (SSA_NAME_IS_DEFAULT_DEF (name))
5661 set_default_def (decl, new_name);
5664 loc = pointer_map_insert (vars_map, name);
5668 new_name = (tree) *loc;
5679 struct pointer_map_t *vars_map;
5680 htab_t new_label_map;
5681 struct pointer_map_t *eh_map;
5685 /* Helper for move_block_to_fn. Set TREE_BLOCK in every expression
5686 contained in *TP if it has been ORIG_BLOCK previously and change the
5687 DECL_CONTEXT of every local variable referenced in *TP. */
5690 move_stmt_op (tree *tp, int *walk_subtrees, void *data)
5692 struct walk_stmt_info *wi = (struct walk_stmt_info *) data;
5693 struct move_stmt_d *p = (struct move_stmt_d *) wi->info;
5697 /* We should never have TREE_BLOCK set on non-statements. */
5698 gcc_assert (!TREE_BLOCK (t));
5700 else if (DECL_P (t) || TREE_CODE (t) == SSA_NAME)
5702 if (TREE_CODE (t) == SSA_NAME)
5703 *tp = replace_ssa_name (t, p->vars_map, p->to_context);
5704 else if (TREE_CODE (t) == LABEL_DECL)
5706 if (p->new_label_map)
5708 struct tree_map in, *out;
5710 out = (struct tree_map *)
5711 htab_find_with_hash (p->new_label_map, &in, DECL_UID (t));
5716 DECL_CONTEXT (t) = p->to_context;
5718 else if (p->remap_decls_p)
5720 /* Replace T with its duplicate. T should no longer appear in the
5721 parent function, so this looks wasteful; however, it may appear
5722 in referenced_vars, and more importantly, as virtual operands of
5723 statements, and in alias lists of other variables. It would be
5724 quite difficult to expunge it from all those places. ??? It might
5725 suffice to do this for addressable variables. */
5726 if ((TREE_CODE (t) == VAR_DECL
5727 && !is_global_var (t))
5728 || TREE_CODE (t) == CONST_DECL)
5729 replace_by_duplicate_decl (tp, p->vars_map, p->to_context);
5732 && gimple_in_ssa_p (cfun))
5734 push_cfun (DECL_STRUCT_FUNCTION (p->to_context));
5735 add_referenced_var (*tp);
5741 else if (TYPE_P (t))
5747 /* Helper for move_stmt_r. Given an EH region number for the source
5748 function, map that to the duplicate EH regio number in the dest. */
5751 move_stmt_eh_region_nr (int old_nr, struct move_stmt_d *p)
5753 eh_region old_r, new_r;
5756 old_r = get_eh_region_from_number (old_nr);
5757 slot = pointer_map_contains (p->eh_map, old_r);
5758 new_r = (eh_region) *slot;
5760 return new_r->index;
5763 /* Similar, but operate on INTEGER_CSTs. */
5766 move_stmt_eh_region_tree_nr (tree old_t_nr, struct move_stmt_d *p)
5770 old_nr = tree_low_cst (old_t_nr, 0);
5771 new_nr = move_stmt_eh_region_nr (old_nr, p);
5773 return build_int_cst (NULL, new_nr);
5776 /* Like move_stmt_op, but for gimple statements.
5778 Helper for move_block_to_fn. Set GIMPLE_BLOCK in every expression
5779 contained in the current statement in *GSI_P and change the
5780 DECL_CONTEXT of every local variable referenced in the current
5784 move_stmt_r (gimple_stmt_iterator *gsi_p, bool *handled_ops_p,
5785 struct walk_stmt_info *wi)
5787 struct move_stmt_d *p = (struct move_stmt_d *) wi->info;
5788 gimple stmt = gsi_stmt (*gsi_p);
5789 tree block = gimple_block (stmt);
5791 if (p->orig_block == NULL_TREE
5792 || block == p->orig_block
5793 || block == NULL_TREE)
5794 gimple_set_block (stmt, p->new_block);
5795 #ifdef ENABLE_CHECKING
5796 else if (block != p->new_block)
5798 while (block && block != p->orig_block)
5799 block = BLOCK_SUPERCONTEXT (block);
5804 switch (gimple_code (stmt))
5807 /* Remap the region numbers for __builtin_eh_{pointer,filter}. */
5809 tree r, fndecl = gimple_call_fndecl (stmt);
5810 if (fndecl && DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_NORMAL)
5811 switch (DECL_FUNCTION_CODE (fndecl))
5813 case BUILT_IN_EH_COPY_VALUES:
5814 r = gimple_call_arg (stmt, 1);
5815 r = move_stmt_eh_region_tree_nr (r, p);
5816 gimple_call_set_arg (stmt, 1, r);
5819 case BUILT_IN_EH_POINTER:
5820 case BUILT_IN_EH_FILTER:
5821 r = gimple_call_arg (stmt, 0);
5822 r = move_stmt_eh_region_tree_nr (r, p);
5823 gimple_call_set_arg (stmt, 0, r);
5834 int r = gimple_resx_region (stmt);
5835 r = move_stmt_eh_region_nr (r, p);
5836 gimple_resx_set_region (stmt, r);
5840 case GIMPLE_EH_DISPATCH:
5842 int r = gimple_eh_dispatch_region (stmt);
5843 r = move_stmt_eh_region_nr (r, p);
5844 gimple_eh_dispatch_set_region (stmt, r);
5848 case GIMPLE_OMP_RETURN:
5849 case GIMPLE_OMP_CONTINUE:
5852 if (is_gimple_omp (stmt))
5854 /* Do not remap variables inside OMP directives. Variables
5855 referenced in clauses and directive header belong to the
5856 parent function and should not be moved into the child
5858 bool save_remap_decls_p = p->remap_decls_p;
5859 p->remap_decls_p = false;
5860 *handled_ops_p = true;
5862 walk_gimple_seq (gimple_omp_body (stmt), move_stmt_r,
5865 p->remap_decls_p = save_remap_decls_p;
5873 /* Move basic block BB from function CFUN to function DEST_FN. The
5874 block is moved out of the original linked list and placed after
5875 block AFTER in the new list. Also, the block is removed from the
5876 original array of blocks and placed in DEST_FN's array of blocks.
5877 If UPDATE_EDGE_COUNT_P is true, the edge counts on both CFGs is
5878 updated to reflect the moved edges.
5880 The local variables are remapped to new instances, VARS_MAP is used
5881 to record the mapping. */
5884 move_block_to_fn (struct function *dest_cfun, basic_block bb,
5885 basic_block after, bool update_edge_count_p,
5886 struct move_stmt_d *d)
5888 struct control_flow_graph *cfg;
5891 gimple_stmt_iterator si;
5892 unsigned old_len, new_len;
5894 /* Remove BB from dominance structures. */
5895 delete_from_dominance_info (CDI_DOMINATORS, bb);
5897 remove_bb_from_loops (bb);
5899 /* Link BB to the new linked list. */
5900 move_block_after (bb, after);
5902 /* Update the edge count in the corresponding flowgraphs. */
5903 if (update_edge_count_p)
5904 FOR_EACH_EDGE (e, ei, bb->succs)
5906 cfun->cfg->x_n_edges--;
5907 dest_cfun->cfg->x_n_edges++;
5910 /* Remove BB from the original basic block array. */
5911 VEC_replace (basic_block, cfun->cfg->x_basic_block_info, bb->index, NULL);
5912 cfun->cfg->x_n_basic_blocks--;
5914 /* Grow DEST_CFUN's basic block array if needed. */
5915 cfg = dest_cfun->cfg;
5916 cfg->x_n_basic_blocks++;
5917 if (bb->index >= cfg->x_last_basic_block)
5918 cfg->x_last_basic_block = bb->index + 1;
5920 old_len = VEC_length (basic_block, cfg->x_basic_block_info);
5921 if ((unsigned) cfg->x_last_basic_block >= old_len)
5923 new_len = cfg->x_last_basic_block + (cfg->x_last_basic_block + 3) / 4;
5924 VEC_safe_grow_cleared (basic_block, gc, cfg->x_basic_block_info,
5928 VEC_replace (basic_block, cfg->x_basic_block_info,
5931 /* Remap the variables in phi nodes. */
5932 for (si = gsi_start_phis (bb); !gsi_end_p (si); )
5934 gimple phi = gsi_stmt (si);
5936 tree op = PHI_RESULT (phi);
5939 if (!is_gimple_reg (op))
5941 /* Remove the phi nodes for virtual operands (alias analysis will be
5942 run for the new function, anyway). */
5943 remove_phi_node (&si, true);
5947 SET_PHI_RESULT (phi,
5948 replace_ssa_name (op, d->vars_map, dest_cfun->decl));
5949 FOR_EACH_PHI_ARG (use, phi, oi, SSA_OP_USE)
5951 op = USE_FROM_PTR (use);
5952 if (TREE_CODE (op) == SSA_NAME)
5953 SET_USE (use, replace_ssa_name (op, d->vars_map, dest_cfun->decl));
5959 for (si = gsi_start_bb (bb); !gsi_end_p (si); gsi_next (&si))
5961 gimple stmt = gsi_stmt (si);
5962 struct walk_stmt_info wi;
5964 memset (&wi, 0, sizeof (wi));
5966 walk_gimple_stmt (&si, move_stmt_r, move_stmt_op, &wi);
5968 if (gimple_code (stmt) == GIMPLE_LABEL)
5970 tree label = gimple_label_label (stmt);
5971 int uid = LABEL_DECL_UID (label);
5973 gcc_assert (uid > -1);
5975 old_len = VEC_length (basic_block, cfg->x_label_to_block_map);
5976 if (old_len <= (unsigned) uid)
5978 new_len = 3 * uid / 2 + 1;
5979 VEC_safe_grow_cleared (basic_block, gc,
5980 cfg->x_label_to_block_map, new_len);
5983 VEC_replace (basic_block, cfg->x_label_to_block_map, uid, bb);
5984 VEC_replace (basic_block, cfun->cfg->x_label_to_block_map, uid, NULL);
5986 gcc_assert (DECL_CONTEXT (label) == dest_cfun->decl);
5988 if (uid >= dest_cfun->cfg->last_label_uid)
5989 dest_cfun->cfg->last_label_uid = uid + 1;
5992 maybe_duplicate_eh_stmt_fn (dest_cfun, stmt, cfun, stmt, d->eh_map, 0);
5993 remove_stmt_from_eh_lp_fn (cfun, stmt);
5995 gimple_duplicate_stmt_histograms (dest_cfun, stmt, cfun, stmt);
5996 gimple_remove_stmt_histograms (cfun, stmt);
5998 /* We cannot leave any operands allocated from the operand caches of
5999 the current function. */
6000 free_stmt_operands (stmt);
6001 push_cfun (dest_cfun);
6006 FOR_EACH_EDGE (e, ei, bb->succs)
6009 tree block = e->goto_block;
6010 if (d->orig_block == NULL_TREE
6011 || block == d->orig_block)
6012 e->goto_block = d->new_block;
6013 #ifdef ENABLE_CHECKING
6014 else if (block != d->new_block)
6016 while (block && block != d->orig_block)
6017 block = BLOCK_SUPERCONTEXT (block);
6024 /* Examine the statements in BB (which is in SRC_CFUN); find and return
6025 the outermost EH region. Use REGION as the incoming base EH region. */
6028 find_outermost_region_in_block (struct function *src_cfun,
6029 basic_block bb, eh_region region)
6031 gimple_stmt_iterator si;
6033 for (si = gsi_start_bb (bb); !gsi_end_p (si); gsi_next (&si))
6035 gimple stmt = gsi_stmt (si);
6036 eh_region stmt_region;
6039 lp_nr = lookup_stmt_eh_lp_fn (src_cfun, stmt);
6040 stmt_region = get_eh_region_from_lp_number_fn (src_cfun, lp_nr);
6044 region = stmt_region;
6045 else if (stmt_region != region)
6047 region = eh_region_outermost (src_cfun, stmt_region, region);
6048 gcc_assert (region != NULL);
6057 new_label_mapper (tree decl, void *data)
6059 htab_t hash = (htab_t) data;
6063 gcc_assert (TREE_CODE (decl) == LABEL_DECL);
6065 m = XNEW (struct tree_map);
6066 m->hash = DECL_UID (decl);
6067 m->base.from = decl;
6068 m->to = create_artificial_label (UNKNOWN_LOCATION);
6069 LABEL_DECL_UID (m->to) = LABEL_DECL_UID (decl);
6070 if (LABEL_DECL_UID (m->to) >= cfun->cfg->last_label_uid)
6071 cfun->cfg->last_label_uid = LABEL_DECL_UID (m->to) + 1;
6073 slot = htab_find_slot_with_hash (hash, m, m->hash, INSERT);
6074 gcc_assert (*slot == NULL);
6081 /* Change DECL_CONTEXT of all BLOCK_VARS in block, including
6085 replace_block_vars_by_duplicates (tree block, struct pointer_map_t *vars_map,
6090 for (tp = &BLOCK_VARS (block); *tp; tp = &DECL_CHAIN (*tp))
6093 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != CONST_DECL)
6095 replace_by_duplicate_decl (&t, vars_map, to_context);
6098 if (TREE_CODE (*tp) == VAR_DECL && DECL_HAS_VALUE_EXPR_P (*tp))
6100 SET_DECL_VALUE_EXPR (t, DECL_VALUE_EXPR (*tp));
6101 DECL_HAS_VALUE_EXPR_P (t) = 1;
6103 DECL_CHAIN (t) = DECL_CHAIN (*tp);
6108 for (block = BLOCK_SUBBLOCKS (block); block; block = BLOCK_CHAIN (block))
6109 replace_block_vars_by_duplicates (block, vars_map, to_context);
6112 /* Move a single-entry, single-exit region delimited by ENTRY_BB and
6113 EXIT_BB to function DEST_CFUN. The whole region is replaced by a
6114 single basic block in the original CFG and the new basic block is
6115 returned. DEST_CFUN must not have a CFG yet.
6117 Note that the region need not be a pure SESE region. Blocks inside
6118 the region may contain calls to abort/exit. The only restriction
6119 is that ENTRY_BB should be the only entry point and it must
6122 Change TREE_BLOCK of all statements in ORIG_BLOCK to the new
6123 functions outermost BLOCK, move all subblocks of ORIG_BLOCK
6124 to the new function.
6126 All local variables referenced in the region are assumed to be in
6127 the corresponding BLOCK_VARS and unexpanded variable lists
6128 associated with DEST_CFUN. */
6131 move_sese_region_to_fn (struct function *dest_cfun, basic_block entry_bb,
6132 basic_block exit_bb, tree orig_block)
6134 VEC(basic_block,heap) *bbs, *dom_bbs;
6135 basic_block dom_entry = get_immediate_dominator (CDI_DOMINATORS, entry_bb);
6136 basic_block after, bb, *entry_pred, *exit_succ, abb;
6137 struct function *saved_cfun = cfun;
6138 int *entry_flag, *exit_flag;
6139 unsigned *entry_prob, *exit_prob;
6140 unsigned i, num_entry_edges, num_exit_edges;
6143 htab_t new_label_map;
6144 struct pointer_map_t *vars_map, *eh_map;
6145 struct loop *loop = entry_bb->loop_father;
6146 struct move_stmt_d d;
6148 /* If ENTRY does not strictly dominate EXIT, this cannot be an SESE
6150 gcc_assert (entry_bb != exit_bb
6152 || dominated_by_p (CDI_DOMINATORS, exit_bb, entry_bb)));
6154 /* Collect all the blocks in the region. Manually add ENTRY_BB
6155 because it won't be added by dfs_enumerate_from. */
6157 VEC_safe_push (basic_block, heap, bbs, entry_bb);
6158 gather_blocks_in_sese_region (entry_bb, exit_bb, &bbs);
6160 /* The blocks that used to be dominated by something in BBS will now be
6161 dominated by the new block. */
6162 dom_bbs = get_dominated_by_region (CDI_DOMINATORS,
6163 VEC_address (basic_block, bbs),
6164 VEC_length (basic_block, bbs));
6166 /* Detach ENTRY_BB and EXIT_BB from CFUN->CFG. We need to remember
6167 the predecessor edges to ENTRY_BB and the successor edges to
6168 EXIT_BB so that we can re-attach them to the new basic block that
6169 will replace the region. */
6170 num_entry_edges = EDGE_COUNT (entry_bb->preds);
6171 entry_pred = (basic_block *) xcalloc (num_entry_edges, sizeof (basic_block));
6172 entry_flag = (int *) xcalloc (num_entry_edges, sizeof (int));
6173 entry_prob = XNEWVEC (unsigned, num_entry_edges);
6175 for (ei = ei_start (entry_bb->preds); (e = ei_safe_edge (ei)) != NULL;)
6177 entry_prob[i] = e->probability;
6178 entry_flag[i] = e->flags;
6179 entry_pred[i++] = e->src;
6185 num_exit_edges = EDGE_COUNT (exit_bb->succs);
6186 exit_succ = (basic_block *) xcalloc (num_exit_edges,
6187 sizeof (basic_block));
6188 exit_flag = (int *) xcalloc (num_exit_edges, sizeof (int));
6189 exit_prob = XNEWVEC (unsigned, num_exit_edges);
6191 for (ei = ei_start (exit_bb->succs); (e = ei_safe_edge (ei)) != NULL;)
6193 exit_prob[i] = e->probability;
6194 exit_flag[i] = e->flags;
6195 exit_succ[i++] = e->dest;
6207 /* Switch context to the child function to initialize DEST_FN's CFG. */
6208 gcc_assert (dest_cfun->cfg == NULL);
6209 push_cfun (dest_cfun);
6211 init_empty_tree_cfg ();
6213 /* Initialize EH information for the new function. */
6215 new_label_map = NULL;
6218 eh_region region = NULL;
6220 FOR_EACH_VEC_ELT (basic_block, bbs, i, bb)
6221 region = find_outermost_region_in_block (saved_cfun, bb, region);
6223 init_eh_for_function ();
6226 new_label_map = htab_create (17, tree_map_hash, tree_map_eq, free);
6227 eh_map = duplicate_eh_regions (saved_cfun, region, 0,
6228 new_label_mapper, new_label_map);
6234 /* Move blocks from BBS into DEST_CFUN. */
6235 gcc_assert (VEC_length (basic_block, bbs) >= 2);
6236 after = dest_cfun->cfg->x_entry_block_ptr;
6237 vars_map = pointer_map_create ();
6239 memset (&d, 0, sizeof (d));
6240 d.orig_block = orig_block;
6241 d.new_block = DECL_INITIAL (dest_cfun->decl);
6242 d.from_context = cfun->decl;
6243 d.to_context = dest_cfun->decl;
6244 d.vars_map = vars_map;
6245 d.new_label_map = new_label_map;
6247 d.remap_decls_p = true;
6249 FOR_EACH_VEC_ELT (basic_block, bbs, i, bb)
6251 /* No need to update edge counts on the last block. It has
6252 already been updated earlier when we detached the region from
6253 the original CFG. */
6254 move_block_to_fn (dest_cfun, bb, after, bb != exit_bb, &d);
6258 /* Rewire BLOCK_SUBBLOCKS of orig_block. */
6262 gcc_assert (BLOCK_SUBBLOCKS (DECL_INITIAL (dest_cfun->decl))
6264 BLOCK_SUBBLOCKS (DECL_INITIAL (dest_cfun->decl))
6265 = BLOCK_SUBBLOCKS (orig_block);
6266 for (block = BLOCK_SUBBLOCKS (orig_block);
6267 block; block = BLOCK_CHAIN (block))
6268 BLOCK_SUPERCONTEXT (block) = DECL_INITIAL (dest_cfun->decl);
6269 BLOCK_SUBBLOCKS (orig_block) = NULL_TREE;
6272 replace_block_vars_by_duplicates (DECL_INITIAL (dest_cfun->decl),
6273 vars_map, dest_cfun->decl);
6276 htab_delete (new_label_map);
6278 pointer_map_destroy (eh_map);
6279 pointer_map_destroy (vars_map);
6281 /* Rewire the entry and exit blocks. The successor to the entry
6282 block turns into the successor of DEST_FN's ENTRY_BLOCK_PTR in
6283 the child function. Similarly, the predecessor of DEST_FN's
6284 EXIT_BLOCK_PTR turns into the predecessor of EXIT_BLOCK_PTR. We
6285 need to switch CFUN between DEST_CFUN and SAVED_CFUN so that the
6286 various CFG manipulation function get to the right CFG.
6288 FIXME, this is silly. The CFG ought to become a parameter to
6290 push_cfun (dest_cfun);
6291 make_edge (ENTRY_BLOCK_PTR, entry_bb, EDGE_FALLTHRU);
6293 make_edge (exit_bb, EXIT_BLOCK_PTR, 0);
6296 /* Back in the original function, the SESE region has disappeared,
6297 create a new basic block in its place. */
6298 bb = create_empty_bb (entry_pred[0]);
6300 add_bb_to_loop (bb, loop);
6301 for (i = 0; i < num_entry_edges; i++)
6303 e = make_edge (entry_pred[i], bb, entry_flag[i]);
6304 e->probability = entry_prob[i];
6307 for (i = 0; i < num_exit_edges; i++)
6309 e = make_edge (bb, exit_succ[i], exit_flag[i]);
6310 e->probability = exit_prob[i];
6313 set_immediate_dominator (CDI_DOMINATORS, bb, dom_entry);
6314 FOR_EACH_VEC_ELT (basic_block, dom_bbs, i, abb)
6315 set_immediate_dominator (CDI_DOMINATORS, abb, bb);
6316 VEC_free (basic_block, heap, dom_bbs);
6327 VEC_free (basic_block, heap, bbs);
6333 /* Dump FUNCTION_DECL FN to file FILE using FLAGS (see TDF_* in tree-pass.h)
6337 dump_function_to_file (tree fn, FILE *file, int flags)
6340 struct function *dsf;
6341 bool ignore_topmost_bind = false, any_var = false;
6345 fprintf (file, "%s (", lang_hooks.decl_printable_name (fn, 2));
6347 arg = DECL_ARGUMENTS (fn);
6350 print_generic_expr (file, TREE_TYPE (arg), dump_flags);
6351 fprintf (file, " ");
6352 print_generic_expr (file, arg, dump_flags);
6353 if (flags & TDF_VERBOSE)
6354 print_node (file, "", arg, 4);
6355 if (DECL_CHAIN (arg))
6356 fprintf (file, ", ");
6357 arg = DECL_CHAIN (arg);
6359 fprintf (file, ")\n");
6361 if (flags & TDF_VERBOSE)
6362 print_node (file, "", fn, 2);
6364 dsf = DECL_STRUCT_FUNCTION (fn);
6365 if (dsf && (flags & TDF_EH))
6366 dump_eh_tree (file, dsf);
6368 if (flags & TDF_RAW && !gimple_has_body_p (fn))
6370 dump_node (fn, TDF_SLIM | flags, file);
6374 /* Switch CFUN to point to FN. */
6375 push_cfun (DECL_STRUCT_FUNCTION (fn));
6377 /* When GIMPLE is lowered, the variables are no longer available in
6378 BIND_EXPRs, so display them separately. */
6379 if (cfun && cfun->decl == fn && !VEC_empty (tree, cfun->local_decls))
6382 ignore_topmost_bind = true;
6384 fprintf (file, "{\n");
6385 FOR_EACH_LOCAL_DECL (cfun, ix, var)
6387 print_generic_decl (file, var, flags);
6388 if (flags & TDF_VERBOSE)
6389 print_node (file, "", var, 4);
6390 fprintf (file, "\n");
6396 if (cfun && cfun->decl == fn && cfun->cfg && basic_block_info)
6398 /* If the CFG has been built, emit a CFG-based dump. */
6399 check_bb_profile (ENTRY_BLOCK_PTR, file);
6400 if (!ignore_topmost_bind)
6401 fprintf (file, "{\n");
6403 if (any_var && n_basic_blocks)
6404 fprintf (file, "\n");
6407 gimple_dump_bb (bb, file, 2, flags);
6409 fprintf (file, "}\n");
6410 check_bb_profile (EXIT_BLOCK_PTR, file);
6412 else if (DECL_SAVED_TREE (fn) == NULL)
6414 /* The function is now in GIMPLE form but the CFG has not been
6415 built yet. Emit the single sequence of GIMPLE statements
6416 that make up its body. */
6417 gimple_seq body = gimple_body (fn);
6419 if (gimple_seq_first_stmt (body)
6420 && gimple_seq_first_stmt (body) == gimple_seq_last_stmt (body)
6421 && gimple_code (gimple_seq_first_stmt (body)) == GIMPLE_BIND)
6422 print_gimple_seq (file, body, 0, flags);
6425 if (!ignore_topmost_bind)
6426 fprintf (file, "{\n");
6429 fprintf (file, "\n");
6431 print_gimple_seq (file, body, 2, flags);
6432 fprintf (file, "}\n");
6439 /* Make a tree based dump. */
6440 chain = DECL_SAVED_TREE (fn);
6442 if (chain && TREE_CODE (chain) == BIND_EXPR)
6444 if (ignore_topmost_bind)
6446 chain = BIND_EXPR_BODY (chain);
6454 if (!ignore_topmost_bind)
6455 fprintf (file, "{\n");
6460 fprintf (file, "\n");
6462 print_generic_stmt_indented (file, chain, flags, indent);
6463 if (ignore_topmost_bind)
6464 fprintf (file, "}\n");
6467 if (flags & TDF_ENUMERATE_LOCALS)
6468 dump_enumerated_decls (file, flags);
6469 fprintf (file, "\n\n");
6476 /* Dump FUNCTION_DECL FN to stderr using FLAGS (see TDF_* in tree.h) */
6479 debug_function (tree fn, int flags)
6481 dump_function_to_file (fn, stderr, flags);
6485 /* Print on FILE the indexes for the predecessors of basic_block BB. */
6488 print_pred_bbs (FILE *file, basic_block bb)
6493 FOR_EACH_EDGE (e, ei, bb->preds)
6494 fprintf (file, "bb_%d ", e->src->index);
6498 /* Print on FILE the indexes for the successors of basic_block BB. */
6501 print_succ_bbs (FILE *file, basic_block bb)
6506 FOR_EACH_EDGE (e, ei, bb->succs)
6507 fprintf (file, "bb_%d ", e->dest->index);
6510 /* Print to FILE the basic block BB following the VERBOSITY level. */
6513 print_loops_bb (FILE *file, basic_block bb, int indent, int verbosity)
6515 char *s_indent = (char *) alloca ((size_t) indent + 1);
6516 memset ((void *) s_indent, ' ', (size_t) indent);
6517 s_indent[indent] = '\0';
6519 /* Print basic_block's header. */
6522 fprintf (file, "%s bb_%d (preds = {", s_indent, bb->index);
6523 print_pred_bbs (file, bb);
6524 fprintf (file, "}, succs = {");
6525 print_succ_bbs (file, bb);
6526 fprintf (file, "})\n");
6529 /* Print basic_block's body. */
6532 fprintf (file, "%s {\n", s_indent);
6533 gimple_dump_bb (bb, file, indent + 4, TDF_VOPS|TDF_MEMSYMS);
6534 fprintf (file, "%s }\n", s_indent);
6538 static void print_loop_and_siblings (FILE *, struct loop *, int, int);
6540 /* Pretty print LOOP on FILE, indented INDENT spaces. Following
6541 VERBOSITY level this outputs the contents of the loop, or just its
6545 print_loop (FILE *file, struct loop *loop, int indent, int verbosity)
6553 s_indent = (char *) alloca ((size_t) indent + 1);
6554 memset ((void *) s_indent, ' ', (size_t) indent);
6555 s_indent[indent] = '\0';
6557 /* Print loop's header. */
6558 fprintf (file, "%sloop_%d (header = %d, latch = %d", s_indent,
6559 loop->num, loop->header->index, loop->latch->index);
6560 fprintf (file, ", niter = ");
6561 print_generic_expr (file, loop->nb_iterations, 0);
6563 if (loop->any_upper_bound)
6565 fprintf (file, ", upper_bound = ");
6566 dump_double_int (file, loop->nb_iterations_upper_bound, true);
6569 if (loop->any_estimate)
6571 fprintf (file, ", estimate = ");
6572 dump_double_int (file, loop->nb_iterations_estimate, true);
6574 fprintf (file, ")\n");
6576 /* Print loop's body. */
6579 fprintf (file, "%s{\n", s_indent);
6581 if (bb->loop_father == loop)
6582 print_loops_bb (file, bb, indent, verbosity);
6584 print_loop_and_siblings (file, loop->inner, indent + 2, verbosity);
6585 fprintf (file, "%s}\n", s_indent);
6589 /* Print the LOOP and its sibling loops on FILE, indented INDENT
6590 spaces. Following VERBOSITY level this outputs the contents of the
6591 loop, or just its structure. */
6594 print_loop_and_siblings (FILE *file, struct loop *loop, int indent, int verbosity)
6599 print_loop (file, loop, indent, verbosity);
6600 print_loop_and_siblings (file, loop->next, indent, verbosity);
6603 /* Follow a CFG edge from the entry point of the program, and on entry
6604 of a loop, pretty print the loop structure on FILE. */
6607 print_loops (FILE *file, int verbosity)
6611 bb = ENTRY_BLOCK_PTR;
6612 if (bb && bb->loop_father)
6613 print_loop_and_siblings (file, bb->loop_father, 0, verbosity);
6617 /* Debugging loops structure at tree level, at some VERBOSITY level. */
6620 debug_loops (int verbosity)
6622 print_loops (stderr, verbosity);
6625 /* Print on stderr the code of LOOP, at some VERBOSITY level. */
6628 debug_loop (struct loop *loop, int verbosity)
6630 print_loop (stderr, loop, 0, verbosity);
6633 /* Print on stderr the code of loop number NUM, at some VERBOSITY
6637 debug_loop_num (unsigned num, int verbosity)
6639 debug_loop (get_loop (num), verbosity);
6642 /* Return true if BB ends with a call, possibly followed by some
6643 instructions that must stay with the call. Return false,
6647 gimple_block_ends_with_call_p (basic_block bb)
6649 gimple_stmt_iterator gsi = gsi_last_nondebug_bb (bb);
6650 return !gsi_end_p (gsi) && is_gimple_call (gsi_stmt (gsi));
6654 /* Return true if BB ends with a conditional branch. Return false,
6658 gimple_block_ends_with_condjump_p (const_basic_block bb)
6660 gimple stmt = last_stmt (CONST_CAST_BB (bb));
6661 return (stmt && gimple_code (stmt) == GIMPLE_COND);
6665 /* Return true if we need to add fake edge to exit at statement T.
6666 Helper function for gimple_flow_call_edges_add. */
6669 need_fake_edge_p (gimple t)
6671 tree fndecl = NULL_TREE;
6674 /* NORETURN and LONGJMP calls already have an edge to exit.
6675 CONST and PURE calls do not need one.
6676 We don't currently check for CONST and PURE here, although
6677 it would be a good idea, because those attributes are
6678 figured out from the RTL in mark_constant_function, and
6679 the counter incrementation code from -fprofile-arcs
6680 leads to different results from -fbranch-probabilities. */
6681 if (is_gimple_call (t))
6683 fndecl = gimple_call_fndecl (t);
6684 call_flags = gimple_call_flags (t);
6687 if (is_gimple_call (t)
6689 && DECL_BUILT_IN (fndecl)
6690 && (call_flags & ECF_NOTHROW)
6691 && !(call_flags & ECF_RETURNS_TWICE)
6692 /* fork() doesn't really return twice, but the effect of
6693 wrapping it in __gcov_fork() which calls __gcov_flush()
6694 and clears the counters before forking has the same
6695 effect as returning twice. Force a fake edge. */
6696 && !(DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_NORMAL
6697 && DECL_FUNCTION_CODE (fndecl) == BUILT_IN_FORK))
6700 if (is_gimple_call (t)
6701 && !(call_flags & ECF_NORETURN))
6704 if (gimple_code (t) == GIMPLE_ASM
6705 && (gimple_asm_volatile_p (t) || gimple_asm_input_p (t)))
6712 /* Add fake edges to the function exit for any non constant and non
6713 noreturn calls, volatile inline assembly in the bitmap of blocks
6714 specified by BLOCKS or to the whole CFG if BLOCKS is zero. Return
6715 the number of blocks that were split.
6717 The goal is to expose cases in which entering a basic block does
6718 not imply that all subsequent instructions must be executed. */
6721 gimple_flow_call_edges_add (sbitmap blocks)
6724 int blocks_split = 0;
6725 int last_bb = last_basic_block;
6726 bool check_last_block = false;
6728 if (n_basic_blocks == NUM_FIXED_BLOCKS)
6732 check_last_block = true;
6734 check_last_block = TEST_BIT (blocks, EXIT_BLOCK_PTR->prev_bb->index);
6736 /* In the last basic block, before epilogue generation, there will be
6737 a fallthru edge to EXIT. Special care is required if the last insn
6738 of the last basic block is a call because make_edge folds duplicate
6739 edges, which would result in the fallthru edge also being marked
6740 fake, which would result in the fallthru edge being removed by
6741 remove_fake_edges, which would result in an invalid CFG.
6743 Moreover, we can't elide the outgoing fake edge, since the block
6744 profiler needs to take this into account in order to solve the minimal
6745 spanning tree in the case that the call doesn't return.
6747 Handle this by adding a dummy instruction in a new last basic block. */
6748 if (check_last_block)
6750 basic_block bb = EXIT_BLOCK_PTR->prev_bb;
6751 gimple_stmt_iterator gsi = gsi_last_bb (bb);
6754 if (!gsi_end_p (gsi))
6757 if (t && need_fake_edge_p (t))
6761 e = find_edge (bb, EXIT_BLOCK_PTR);
6764 gsi_insert_on_edge (e, gimple_build_nop ());
6765 gsi_commit_edge_inserts ();
6770 /* Now add fake edges to the function exit for any non constant
6771 calls since there is no way that we can determine if they will
6773 for (i = 0; i < last_bb; i++)
6775 basic_block bb = BASIC_BLOCK (i);
6776 gimple_stmt_iterator gsi;
6777 gimple stmt, last_stmt;
6782 if (blocks && !TEST_BIT (blocks, i))
6785 gsi = gsi_last_bb (bb);
6786 if (!gsi_end_p (gsi))
6788 last_stmt = gsi_stmt (gsi);
6791 stmt = gsi_stmt (gsi);
6792 if (need_fake_edge_p (stmt))
6796 /* The handling above of the final block before the
6797 epilogue should be enough to verify that there is
6798 no edge to the exit block in CFG already.
6799 Calling make_edge in such case would cause us to
6800 mark that edge as fake and remove it later. */
6801 #ifdef ENABLE_CHECKING
6802 if (stmt == last_stmt)
6804 e = find_edge (bb, EXIT_BLOCK_PTR);
6805 gcc_assert (e == NULL);
6809 /* Note that the following may create a new basic block
6810 and renumber the existing basic blocks. */
6811 if (stmt != last_stmt)
6813 e = split_block (bb, stmt);
6817 make_edge (bb, EXIT_BLOCK_PTR, EDGE_FAKE);
6821 while (!gsi_end_p (gsi));
6826 verify_flow_info ();
6828 return blocks_split;
6831 /* Purge dead abnormal call edges from basic block BB. */
6834 gimple_purge_dead_abnormal_call_edges (basic_block bb)
6836 bool changed = gimple_purge_dead_eh_edges (bb);
6838 if (cfun->has_nonlocal_label)
6840 gimple stmt = last_stmt (bb);
6844 if (!(stmt && stmt_can_make_abnormal_goto (stmt)))
6845 for (ei = ei_start (bb->succs); (e = ei_safe_edge (ei)); )
6847 if (e->flags & EDGE_ABNORMAL)
6856 /* See gimple_purge_dead_eh_edges below. */
6858 free_dominance_info (CDI_DOMINATORS);
6864 /* Removes edge E and all the blocks dominated by it, and updates dominance
6865 information. The IL in E->src needs to be updated separately.
6866 If dominance info is not available, only the edge E is removed.*/
6869 remove_edge_and_dominated_blocks (edge e)
6871 VEC (basic_block, heap) *bbs_to_remove = NULL;
6872 VEC (basic_block, heap) *bbs_to_fix_dom = NULL;
6876 bool none_removed = false;
6878 basic_block bb, dbb;
6881 if (!dom_info_available_p (CDI_DOMINATORS))
6887 /* No updating is needed for edges to exit. */
6888 if (e->dest == EXIT_BLOCK_PTR)
6890 if (cfgcleanup_altered_bbs)
6891 bitmap_set_bit (cfgcleanup_altered_bbs, e->src->index);
6896 /* First, we find the basic blocks to remove. If E->dest has a predecessor
6897 that is not dominated by E->dest, then this set is empty. Otherwise,
6898 all the basic blocks dominated by E->dest are removed.
6900 Also, to DF_IDOM we store the immediate dominators of the blocks in
6901 the dominance frontier of E (i.e., of the successors of the
6902 removed blocks, if there are any, and of E->dest otherwise). */
6903 FOR_EACH_EDGE (f, ei, e->dest->preds)
6908 if (!dominated_by_p (CDI_DOMINATORS, f->src, e->dest))
6910 none_removed = true;
6915 df = BITMAP_ALLOC (NULL);
6916 df_idom = BITMAP_ALLOC (NULL);
6919 bitmap_set_bit (df_idom,
6920 get_immediate_dominator (CDI_DOMINATORS, e->dest)->index);
6923 bbs_to_remove = get_all_dominated_blocks (CDI_DOMINATORS, e->dest);
6924 FOR_EACH_VEC_ELT (basic_block, bbs_to_remove, i, bb)
6926 FOR_EACH_EDGE (f, ei, bb->succs)
6928 if (f->dest != EXIT_BLOCK_PTR)
6929 bitmap_set_bit (df, f->dest->index);
6932 FOR_EACH_VEC_ELT (basic_block, bbs_to_remove, i, bb)
6933 bitmap_clear_bit (df, bb->index);
6935 EXECUTE_IF_SET_IN_BITMAP (df, 0, i, bi)
6937 bb = BASIC_BLOCK (i);
6938 bitmap_set_bit (df_idom,
6939 get_immediate_dominator (CDI_DOMINATORS, bb)->index);
6943 if (cfgcleanup_altered_bbs)
6945 /* Record the set of the altered basic blocks. */
6946 bitmap_set_bit (cfgcleanup_altered_bbs, e->src->index);
6947 bitmap_ior_into (cfgcleanup_altered_bbs, df);
6950 /* Remove E and the cancelled blocks. */
6955 /* Walk backwards so as to get a chance to substitute all
6956 released DEFs into debug stmts. See
6957 eliminate_unnecessary_stmts() in tree-ssa-dce.c for more
6959 for (i = VEC_length (basic_block, bbs_to_remove); i-- > 0; )
6960 delete_basic_block (VEC_index (basic_block, bbs_to_remove, i));
6963 /* Update the dominance information. The immediate dominator may change only
6964 for blocks whose immediate dominator belongs to DF_IDOM:
6966 Suppose that idom(X) = Y before removal of E and idom(X) != Y after the
6967 removal. Let Z the arbitrary block such that idom(Z) = Y and
6968 Z dominates X after the removal. Before removal, there exists a path P
6969 from Y to X that avoids Z. Let F be the last edge on P that is
6970 removed, and let W = F->dest. Before removal, idom(W) = Y (since Y
6971 dominates W, and because of P, Z does not dominate W), and W belongs to
6972 the dominance frontier of E. Therefore, Y belongs to DF_IDOM. */
6973 EXECUTE_IF_SET_IN_BITMAP (df_idom, 0, i, bi)
6975 bb = BASIC_BLOCK (i);
6976 for (dbb = first_dom_son (CDI_DOMINATORS, bb);
6978 dbb = next_dom_son (CDI_DOMINATORS, dbb))
6979 VEC_safe_push (basic_block, heap, bbs_to_fix_dom, dbb);
6982 iterate_fix_dominators (CDI_DOMINATORS, bbs_to_fix_dom, true);
6985 BITMAP_FREE (df_idom);
6986 VEC_free (basic_block, heap, bbs_to_remove);
6987 VEC_free (basic_block, heap, bbs_to_fix_dom);
6990 /* Purge dead EH edges from basic block BB. */
6993 gimple_purge_dead_eh_edges (basic_block bb)
6995 bool changed = false;
6998 gimple stmt = last_stmt (bb);
7000 if (stmt && stmt_can_throw_internal (stmt))
7003 for (ei = ei_start (bb->succs); (e = ei_safe_edge (ei)); )
7005 if (e->flags & EDGE_EH)
7007 remove_edge_and_dominated_blocks (e);
7018 gimple_purge_all_dead_eh_edges (const_bitmap blocks)
7020 bool changed = false;
7024 EXECUTE_IF_SET_IN_BITMAP (blocks, 0, i, bi)
7026 basic_block bb = BASIC_BLOCK (i);
7028 /* Earlier gimple_purge_dead_eh_edges could have removed
7029 this basic block already. */
7030 gcc_assert (bb || changed);
7032 changed |= gimple_purge_dead_eh_edges (bb);
7038 /* This function is called whenever a new edge is created or
7042 gimple_execute_on_growing_pred (edge e)
7044 basic_block bb = e->dest;
7046 if (!gimple_seq_empty_p (phi_nodes (bb)))
7047 reserve_phi_args_for_new_edge (bb);
7050 /* This function is called immediately before edge E is removed from
7051 the edge vector E->dest->preds. */
7054 gimple_execute_on_shrinking_pred (edge e)
7056 if (!gimple_seq_empty_p (phi_nodes (e->dest)))
7057 remove_phi_args (e);
7060 /*---------------------------------------------------------------------------
7061 Helper functions for Loop versioning
7062 ---------------------------------------------------------------------------*/
7064 /* Adjust phi nodes for 'first' basic block. 'second' basic block is a copy
7065 of 'first'. Both of them are dominated by 'new_head' basic block. When
7066 'new_head' was created by 'second's incoming edge it received phi arguments
7067 on the edge by split_edge(). Later, additional edge 'e' was created to
7068 connect 'new_head' and 'first'. Now this routine adds phi args on this
7069 additional edge 'e' that new_head to second edge received as part of edge
7073 gimple_lv_adjust_loop_header_phi (basic_block first, basic_block second,
7074 basic_block new_head, edge e)
7077 gimple_stmt_iterator psi1, psi2;
7079 edge e2 = find_edge (new_head, second);
7081 /* Because NEW_HEAD has been created by splitting SECOND's incoming
7082 edge, we should always have an edge from NEW_HEAD to SECOND. */
7083 gcc_assert (e2 != NULL);
7085 /* Browse all 'second' basic block phi nodes and add phi args to
7086 edge 'e' for 'first' head. PHI args are always in correct order. */
7088 for (psi2 = gsi_start_phis (second),
7089 psi1 = gsi_start_phis (first);
7090 !gsi_end_p (psi2) && !gsi_end_p (psi1);
7091 gsi_next (&psi2), gsi_next (&psi1))
7093 phi1 = gsi_stmt (psi1);
7094 phi2 = gsi_stmt (psi2);
7095 def = PHI_ARG_DEF (phi2, e2->dest_idx);
7096 add_phi_arg (phi1, def, e, gimple_phi_arg_location_from_edge (phi2, e2));
7101 /* Adds a if else statement to COND_BB with condition COND_EXPR.
7102 SECOND_HEAD is the destination of the THEN and FIRST_HEAD is
7103 the destination of the ELSE part. */
7106 gimple_lv_add_condition_to_bb (basic_block first_head ATTRIBUTE_UNUSED,
7107 basic_block second_head ATTRIBUTE_UNUSED,
7108 basic_block cond_bb, void *cond_e)
7110 gimple_stmt_iterator gsi;
7111 gimple new_cond_expr;
7112 tree cond_expr = (tree) cond_e;
7115 /* Build new conditional expr */
7116 new_cond_expr = gimple_build_cond_from_tree (cond_expr,
7117 NULL_TREE, NULL_TREE);
7119 /* Add new cond in cond_bb. */
7120 gsi = gsi_last_bb (cond_bb);
7121 gsi_insert_after (&gsi, new_cond_expr, GSI_NEW_STMT);
7123 /* Adjust edges appropriately to connect new head with first head
7124 as well as second head. */
7125 e0 = single_succ_edge (cond_bb);
7126 e0->flags &= ~EDGE_FALLTHRU;
7127 e0->flags |= EDGE_FALSE_VALUE;
7130 struct cfg_hooks gimple_cfg_hooks = {
7132 gimple_verify_flow_info,
7133 gimple_dump_bb, /* dump_bb */
7134 create_bb, /* create_basic_block */
7135 gimple_redirect_edge_and_branch, /* redirect_edge_and_branch */
7136 gimple_redirect_edge_and_branch_force, /* redirect_edge_and_branch_force */
7137 gimple_can_remove_branch_p, /* can_remove_branch_p */
7138 remove_bb, /* delete_basic_block */
7139 gimple_split_block, /* split_block */
7140 gimple_move_block_after, /* move_block_after */
7141 gimple_can_merge_blocks_p, /* can_merge_blocks_p */
7142 gimple_merge_blocks, /* merge_blocks */
7143 gimple_predict_edge, /* predict_edge */
7144 gimple_predicted_by_p, /* predicted_by_p */
7145 gimple_can_duplicate_bb_p, /* can_duplicate_block_p */
7146 gimple_duplicate_bb, /* duplicate_block */
7147 gimple_split_edge, /* split_edge */
7148 gimple_make_forwarder_block, /* make_forward_block */
7149 NULL, /* tidy_fallthru_edge */
7150 gimple_block_ends_with_call_p,/* block_ends_with_call_p */
7151 gimple_block_ends_with_condjump_p, /* block_ends_with_condjump_p */
7152 gimple_flow_call_edges_add, /* flow_call_edges_add */
7153 gimple_execute_on_growing_pred, /* execute_on_growing_pred */
7154 gimple_execute_on_shrinking_pred, /* execute_on_shrinking_pred */
7155 gimple_duplicate_loop_to_header_edge, /* duplicate loop for trees */
7156 gimple_lv_add_condition_to_bb, /* lv_add_condition_to_bb */
7157 gimple_lv_adjust_loop_header_phi, /* lv_adjust_loop_header_phi*/
7158 extract_true_false_edges_from_block, /* extract_cond_bb_edges */
7159 flush_pending_stmts /* flush_pending_stmts */
7163 /* Split all critical edges. */
7166 split_critical_edges (void)
7172 /* split_edge can redirect edges out of SWITCH_EXPRs, which can get
7173 expensive. So we want to enable recording of edge to CASE_LABEL_EXPR
7174 mappings around the calls to split_edge. */
7175 start_recording_case_labels ();
7178 FOR_EACH_EDGE (e, ei, bb->succs)
7180 if (EDGE_CRITICAL_P (e) && !(e->flags & EDGE_ABNORMAL))
7182 /* PRE inserts statements to edges and expects that
7183 since split_critical_edges was done beforehand, committing edge
7184 insertions will not split more edges. In addition to critical
7185 edges we must split edges that have multiple successors and
7186 end by control flow statements, such as RESX.
7187 Go ahead and split them too. This matches the logic in
7188 gimple_find_edge_insert_loc. */
7189 else if ((!single_pred_p (e->dest)
7190 || !gimple_seq_empty_p (phi_nodes (e->dest))
7191 || e->dest == EXIT_BLOCK_PTR)
7192 && e->src != ENTRY_BLOCK_PTR
7193 && !(e->flags & EDGE_ABNORMAL))
7195 gimple_stmt_iterator gsi;
7197 gsi = gsi_last_bb (e->src);
7198 if (!gsi_end_p (gsi)
7199 && stmt_ends_bb_p (gsi_stmt (gsi))
7200 && (gimple_code (gsi_stmt (gsi)) != GIMPLE_RETURN
7201 && !gimple_call_builtin_p (gsi_stmt (gsi),
7207 end_recording_case_labels ();
7211 struct gimple_opt_pass pass_split_crit_edges =
7215 "crited", /* name */
7217 split_critical_edges, /* execute */
7220 0, /* static_pass_number */
7221 TV_TREE_SPLIT_EDGES, /* tv_id */
7222 PROP_cfg, /* properties required */
7223 PROP_no_crit_edges, /* properties_provided */
7224 0, /* properties_destroyed */
7225 0, /* todo_flags_start */
7226 TODO_dump_func | TODO_verify_flow /* todo_flags_finish */
7231 /* Build a ternary operation and gimplify it. Emit code before GSI.
7232 Return the gimple_val holding the result. */
7235 gimplify_build3 (gimple_stmt_iterator *gsi, enum tree_code code,
7236 tree type, tree a, tree b, tree c)
7239 location_t loc = gimple_location (gsi_stmt (*gsi));
7241 ret = fold_build3_loc (loc, code, type, a, b, c);
7244 return force_gimple_operand_gsi (gsi, ret, true, NULL, true,
7248 /* Build a binary operation and gimplify it. Emit code before GSI.
7249 Return the gimple_val holding the result. */
7252 gimplify_build2 (gimple_stmt_iterator *gsi, enum tree_code code,
7253 tree type, tree a, tree b)
7257 ret = fold_build2_loc (gimple_location (gsi_stmt (*gsi)), code, type, a, b);
7260 return force_gimple_operand_gsi (gsi, ret, true, NULL, true,
7264 /* Build a unary operation and gimplify it. Emit code before GSI.
7265 Return the gimple_val holding the result. */
7268 gimplify_build1 (gimple_stmt_iterator *gsi, enum tree_code code, tree type,
7273 ret = fold_build1_loc (gimple_location (gsi_stmt (*gsi)), code, type, a);
7276 return force_gimple_operand_gsi (gsi, ret, true, NULL, true,
7282 /* Emit return warnings. */
7285 execute_warn_function_return (void)
7287 source_location location;
7292 /* If we have a path to EXIT, then we do return. */
7293 if (TREE_THIS_VOLATILE (cfun->decl)
7294 && EDGE_COUNT (EXIT_BLOCK_PTR->preds) > 0)
7296 location = UNKNOWN_LOCATION;
7297 FOR_EACH_EDGE (e, ei, EXIT_BLOCK_PTR->preds)
7299 last = last_stmt (e->src);
7300 if ((gimple_code (last) == GIMPLE_RETURN
7301 || gimple_call_builtin_p (last, BUILT_IN_RETURN))
7302 && (location = gimple_location (last)) != UNKNOWN_LOCATION)
7305 if (location == UNKNOWN_LOCATION)
7306 location = cfun->function_end_locus;
7307 warning_at (location, 0, "%<noreturn%> function does return");
7310 /* If we see "return;" in some basic block, then we do reach the end
7311 without returning a value. */
7312 else if (warn_return_type
7313 && !TREE_NO_WARNING (cfun->decl)
7314 && EDGE_COUNT (EXIT_BLOCK_PTR->preds) > 0
7315 && !VOID_TYPE_P (TREE_TYPE (TREE_TYPE (cfun->decl))))
7317 FOR_EACH_EDGE (e, ei, EXIT_BLOCK_PTR->preds)
7319 gimple last = last_stmt (e->src);
7320 if (gimple_code (last) == GIMPLE_RETURN
7321 && gimple_return_retval (last) == NULL
7322 && !gimple_no_warning_p (last))
7324 location = gimple_location (last);
7325 if (location == UNKNOWN_LOCATION)
7326 location = cfun->function_end_locus;
7327 warning_at (location, OPT_Wreturn_type, "control reaches end of non-void function");
7328 TREE_NO_WARNING (cfun->decl) = 1;
7337 /* Given a basic block B which ends with a conditional and has
7338 precisely two successors, determine which of the edges is taken if
7339 the conditional is true and which is taken if the conditional is
7340 false. Set TRUE_EDGE and FALSE_EDGE appropriately. */
7343 extract_true_false_edges_from_block (basic_block b,
7347 edge e = EDGE_SUCC (b, 0);
7349 if (e->flags & EDGE_TRUE_VALUE)
7352 *false_edge = EDGE_SUCC (b, 1);
7357 *true_edge = EDGE_SUCC (b, 1);
7361 struct gimple_opt_pass pass_warn_function_return =
7365 "*warn_function_return", /* name */
7367 execute_warn_function_return, /* execute */
7370 0, /* static_pass_number */
7371 TV_NONE, /* tv_id */
7372 PROP_cfg, /* properties_required */
7373 0, /* properties_provided */
7374 0, /* properties_destroyed */
7375 0, /* todo_flags_start */
7376 0 /* todo_flags_finish */
7380 /* Emit noreturn warnings. */
7383 execute_warn_function_noreturn (void)
7385 if (!TREE_THIS_VOLATILE (current_function_decl)
7386 && EDGE_COUNT (EXIT_BLOCK_PTR->preds) == 0)
7387 warn_function_noreturn (current_function_decl);
7392 gate_warn_function_noreturn (void)
7394 return warn_suggest_attribute_noreturn;
7397 struct gimple_opt_pass pass_warn_function_noreturn =
7401 "*warn_function_noreturn", /* name */
7402 gate_warn_function_noreturn, /* gate */
7403 execute_warn_function_noreturn, /* execute */
7406 0, /* static_pass_number */
7407 TV_NONE, /* tv_id */
7408 PROP_cfg, /* properties_required */
7409 0, /* properties_provided */
7410 0, /* properties_destroyed */
7411 0, /* todo_flags_start */
7412 0 /* todo_flags_finish */
7417 /* Walk a gimplified function and warn for functions whose return value is
7418 ignored and attribute((warn_unused_result)) is set. This is done before
7419 inlining, so we don't have to worry about that. */
7422 do_warn_unused_result (gimple_seq seq)
7425 gimple_stmt_iterator i;
7427 for (i = gsi_start (seq); !gsi_end_p (i); gsi_next (&i))
7429 gimple g = gsi_stmt (i);
7431 switch (gimple_code (g))
7434 do_warn_unused_result (gimple_bind_body (g));
7437 do_warn_unused_result (gimple_try_eval (g));
7438 do_warn_unused_result (gimple_try_cleanup (g));
7441 do_warn_unused_result (gimple_catch_handler (g));
7443 case GIMPLE_EH_FILTER:
7444 do_warn_unused_result (gimple_eh_filter_failure (g));
7448 if (gimple_call_lhs (g))
7451 /* This is a naked call, as opposed to a GIMPLE_CALL with an
7452 LHS. All calls whose value is ignored should be
7453 represented like this. Look for the attribute. */
7454 fdecl = gimple_call_fndecl (g);
7455 ftype = TREE_TYPE (TREE_TYPE (gimple_call_fn (g)));
7457 if (lookup_attribute ("warn_unused_result", TYPE_ATTRIBUTES (ftype)))
7459 location_t loc = gimple_location (g);
7462 warning_at (loc, OPT_Wunused_result,
7463 "ignoring return value of %qD, "
7464 "declared with attribute warn_unused_result",
7467 warning_at (loc, OPT_Wunused_result,
7468 "ignoring return value of function "
7469 "declared with attribute warn_unused_result");
7474 /* Not a container, not a call, or a call whose value is used. */
7481 run_warn_unused_result (void)
7483 do_warn_unused_result (gimple_body (current_function_decl));
7488 gate_warn_unused_result (void)
7490 return flag_warn_unused_result;
7493 struct gimple_opt_pass pass_warn_unused_result =
7497 "*warn_unused_result", /* name */
7498 gate_warn_unused_result, /* gate */
7499 run_warn_unused_result, /* execute */
7502 0, /* static_pass_number */
7503 TV_NONE, /* tv_id */
7504 PROP_gimple_any, /* properties_required */
7505 0, /* properties_provided */
7506 0, /* properties_destroyed */
7507 0, /* todo_flags_start */
7508 0, /* todo_flags_finish */