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);
236 execute_build_cfg (void)
238 gimple_seq body = gimple_body (current_function_decl);
240 build_gimple_cfg (body);
241 gimple_set_body (current_function_decl, NULL);
242 if (dump_file && (dump_flags & TDF_DETAILS))
244 fprintf (dump_file, "Scope blocks:\n");
245 dump_scope_blocks (dump_file, dump_flags);
250 struct gimple_opt_pass pass_build_cfg =
256 execute_build_cfg, /* execute */
259 0, /* static_pass_number */
260 TV_TREE_CFG, /* tv_id */
261 PROP_gimple_leh, /* properties_required */
262 PROP_cfg, /* properties_provided */
263 0, /* properties_destroyed */
264 0, /* todo_flags_start */
265 TODO_verify_stmts | TODO_cleanup_cfg
266 | TODO_dump_func /* todo_flags_finish */
271 /* Return true if T is a computed goto. */
274 computed_goto_p (gimple t)
276 return (gimple_code (t) == GIMPLE_GOTO
277 && TREE_CODE (gimple_goto_dest (t)) != LABEL_DECL);
281 /* Search the CFG for any computed gotos. If found, factor them to a
282 common computed goto site. Also record the location of that site so
283 that we can un-factor the gotos after we have converted back to
287 factor_computed_gotos (void)
290 tree factored_label_decl = NULL;
292 gimple factored_computed_goto_label = NULL;
293 gimple factored_computed_goto = NULL;
295 /* We know there are one or more computed gotos in this function.
296 Examine the last statement in each basic block to see if the block
297 ends with a computed goto. */
301 gimple_stmt_iterator gsi = gsi_last_bb (bb);
307 last = gsi_stmt (gsi);
309 /* Ignore the computed goto we create when we factor the original
311 if (last == factored_computed_goto)
314 /* If the last statement is a computed goto, factor it. */
315 if (computed_goto_p (last))
319 /* The first time we find a computed goto we need to create
320 the factored goto block and the variable each original
321 computed goto will use for their goto destination. */
322 if (!factored_computed_goto)
324 basic_block new_bb = create_empty_bb (bb);
325 gimple_stmt_iterator new_gsi = gsi_start_bb (new_bb);
327 /* Create the destination of the factored goto. Each original
328 computed goto will put its desired destination into this
329 variable and jump to the label we create immediately
331 var = create_tmp_var (ptr_type_node, "gotovar");
333 /* Build a label for the new block which will contain the
334 factored computed goto. */
335 factored_label_decl = create_artificial_label (UNKNOWN_LOCATION);
336 factored_computed_goto_label
337 = gimple_build_label (factored_label_decl);
338 gsi_insert_after (&new_gsi, factored_computed_goto_label,
341 /* Build our new computed goto. */
342 factored_computed_goto = gimple_build_goto (var);
343 gsi_insert_after (&new_gsi, factored_computed_goto, GSI_NEW_STMT);
346 /* Copy the original computed goto's destination into VAR. */
347 assignment = gimple_build_assign (var, gimple_goto_dest (last));
348 gsi_insert_before (&gsi, assignment, GSI_SAME_STMT);
350 /* And re-vector the computed goto to the new destination. */
351 gimple_goto_set_dest (last, factored_label_decl);
357 /* Build a flowgraph for the sequence of stmts SEQ. */
360 make_blocks (gimple_seq seq)
362 gimple_stmt_iterator i = gsi_start (seq);
364 bool start_new_block = true;
365 bool first_stmt_of_seq = true;
366 basic_block bb = ENTRY_BLOCK_PTR;
368 while (!gsi_end_p (i))
375 /* If the statement starts a new basic block or if we have determined
376 in a previous pass that we need to create a new block for STMT, do
378 if (start_new_block || stmt_starts_bb_p (stmt, prev_stmt))
380 if (!first_stmt_of_seq)
381 seq = gsi_split_seq_before (&i);
382 bb = create_basic_block (seq, NULL, bb);
383 start_new_block = false;
386 /* Now add STMT to BB and create the subgraphs for special statement
388 gimple_set_bb (stmt, bb);
390 if (computed_goto_p (stmt))
391 found_computed_goto = true;
393 /* If STMT is a basic block terminator, set START_NEW_BLOCK for the
395 if (stmt_ends_bb_p (stmt))
397 /* If the stmt can make abnormal goto use a new temporary
398 for the assignment to the LHS. This makes sure the old value
399 of the LHS is available on the abnormal edge. Otherwise
400 we will end up with overlapping life-ranges for abnormal
402 if (gimple_has_lhs (stmt)
403 && stmt_can_make_abnormal_goto (stmt)
404 && is_gimple_reg_type (TREE_TYPE (gimple_get_lhs (stmt))))
406 tree lhs = gimple_get_lhs (stmt);
407 tree tmp = create_tmp_var (TREE_TYPE (lhs), NULL);
408 gimple s = gimple_build_assign (lhs, tmp);
409 gimple_set_location (s, gimple_location (stmt));
410 gimple_set_block (s, gimple_block (stmt));
411 gimple_set_lhs (stmt, tmp);
412 if (TREE_CODE (TREE_TYPE (tmp)) == COMPLEX_TYPE
413 || TREE_CODE (TREE_TYPE (tmp)) == VECTOR_TYPE)
414 DECL_GIMPLE_REG_P (tmp) = 1;
415 gsi_insert_after (&i, s, GSI_SAME_STMT);
417 start_new_block = true;
421 first_stmt_of_seq = false;
426 /* Create and return a new empty basic block after bb AFTER. */
429 create_bb (void *h, void *e, basic_block after)
435 /* Create and initialize a new basic block. Since alloc_block uses
436 GC allocation that clears memory to allocate a basic block, we do
437 not have to clear the newly allocated basic block here. */
440 bb->index = last_basic_block;
442 bb->il.gimple = ggc_alloc_cleared_gimple_bb_info ();
443 set_bb_seq (bb, h ? (gimple_seq) h : gimple_seq_alloc ());
445 /* Add the new block to the linked list of blocks. */
446 link_block (bb, after);
448 /* Grow the basic block array if needed. */
449 if ((size_t) last_basic_block == VEC_length (basic_block, basic_block_info))
451 size_t new_size = last_basic_block + (last_basic_block + 3) / 4;
452 VEC_safe_grow_cleared (basic_block, gc, basic_block_info, new_size);
455 /* Add the newly created block to the array. */
456 SET_BASIC_BLOCK (last_basic_block, bb);
465 /*---------------------------------------------------------------------------
467 ---------------------------------------------------------------------------*/
469 /* Fold COND_EXPR_COND of each COND_EXPR. */
472 fold_cond_expr_cond (void)
478 gimple stmt = last_stmt (bb);
480 if (stmt && gimple_code (stmt) == GIMPLE_COND)
482 location_t loc = gimple_location (stmt);
486 fold_defer_overflow_warnings ();
487 cond = fold_binary_loc (loc, gimple_cond_code (stmt), boolean_type_node,
488 gimple_cond_lhs (stmt), gimple_cond_rhs (stmt));
491 zerop = integer_zerop (cond);
492 onep = integer_onep (cond);
495 zerop = onep = false;
497 fold_undefer_overflow_warnings (zerop || onep,
499 WARN_STRICT_OVERFLOW_CONDITIONAL);
501 gimple_cond_make_false (stmt);
503 gimple_cond_make_true (stmt);
508 /* Join all the blocks in the flowgraph. */
514 struct omp_region *cur_region = NULL;
516 /* Create an edge from entry to the first block with executable
518 make_edge (ENTRY_BLOCK_PTR, BASIC_BLOCK (NUM_FIXED_BLOCKS), EDGE_FALLTHRU);
520 /* Traverse the basic block array placing edges. */
523 gimple last = last_stmt (bb);
528 enum gimple_code code = gimple_code (last);
532 make_goto_expr_edges (bb);
536 make_edge (bb, EXIT_BLOCK_PTR, 0);
540 make_cond_expr_edges (bb);
544 make_gimple_switch_edges (bb);
548 make_eh_edges (last);
551 case GIMPLE_EH_DISPATCH:
552 fallthru = make_eh_dispatch_edges (last);
556 /* If this function receives a nonlocal goto, then we need to
557 make edges from this call site to all the nonlocal goto
559 if (stmt_can_make_abnormal_goto (last))
560 make_abnormal_goto_edges (bb, true);
562 /* If this statement has reachable exception handlers, then
563 create abnormal edges to them. */
564 make_eh_edges (last);
566 /* BUILTIN_RETURN is really a return statement. */
567 if (gimple_call_builtin_p (last, BUILT_IN_RETURN))
568 make_edge (bb, EXIT_BLOCK_PTR, 0), fallthru = false;
569 /* Some calls are known not to return. */
571 fallthru = !(gimple_call_flags (last) & ECF_NORETURN);
575 /* A GIMPLE_ASSIGN may throw internally and thus be considered
577 if (is_ctrl_altering_stmt (last))
578 make_eh_edges (last);
583 make_gimple_asm_edges (bb);
587 case GIMPLE_OMP_PARALLEL:
588 case GIMPLE_OMP_TASK:
590 case GIMPLE_OMP_SINGLE:
591 case GIMPLE_OMP_MASTER:
592 case GIMPLE_OMP_ORDERED:
593 case GIMPLE_OMP_CRITICAL:
594 case GIMPLE_OMP_SECTION:
595 cur_region = new_omp_region (bb, code, cur_region);
599 case GIMPLE_OMP_SECTIONS:
600 cur_region = new_omp_region (bb, code, cur_region);
604 case GIMPLE_OMP_SECTIONS_SWITCH:
608 case GIMPLE_OMP_ATOMIC_LOAD:
609 case GIMPLE_OMP_ATOMIC_STORE:
613 case GIMPLE_OMP_RETURN:
614 /* In the case of a GIMPLE_OMP_SECTION, the edge will go
615 somewhere other than the next block. This will be
617 cur_region->exit = bb;
618 fallthru = cur_region->type != GIMPLE_OMP_SECTION;
619 cur_region = cur_region->outer;
622 case GIMPLE_OMP_CONTINUE:
623 cur_region->cont = bb;
624 switch (cur_region->type)
627 /* Mark all GIMPLE_OMP_FOR and GIMPLE_OMP_CONTINUE
628 succs edges as abnormal to prevent splitting
630 single_succ_edge (cur_region->entry)->flags |= EDGE_ABNORMAL;
631 /* Make the loopback edge. */
632 make_edge (bb, single_succ (cur_region->entry),
635 /* Create an edge from GIMPLE_OMP_FOR to exit, which
636 corresponds to the case that the body of the loop
637 is not executed at all. */
638 make_edge (cur_region->entry, bb->next_bb, EDGE_ABNORMAL);
639 make_edge (bb, bb->next_bb, EDGE_FALLTHRU | EDGE_ABNORMAL);
643 case GIMPLE_OMP_SECTIONS:
644 /* Wire up the edges into and out of the nested sections. */
646 basic_block switch_bb = single_succ (cur_region->entry);
648 struct omp_region *i;
649 for (i = cur_region->inner; i ; i = i->next)
651 gcc_assert (i->type == GIMPLE_OMP_SECTION);
652 make_edge (switch_bb, i->entry, 0);
653 make_edge (i->exit, bb, EDGE_FALLTHRU);
656 /* Make the loopback edge to the block with
657 GIMPLE_OMP_SECTIONS_SWITCH. */
658 make_edge (bb, switch_bb, 0);
660 /* Make the edge from the switch to exit. */
661 make_edge (switch_bb, bb->next_bb, 0);
672 gcc_assert (!stmt_ends_bb_p (last));
681 make_edge (bb, bb->next_bb, EDGE_FALLTHRU);
683 assign_discriminator (gimple_location (last), bb->next_bb);
690 /* Fold COND_EXPR_COND of each COND_EXPR. */
691 fold_cond_expr_cond ();
694 /* Trivial hash function for a location_t. ITEM is a pointer to
695 a hash table entry that maps a location_t to a discriminator. */
698 locus_map_hash (const void *item)
700 return ((const struct locus_discrim_map *) item)->locus;
703 /* Equality function for the locus-to-discriminator map. VA and VB
704 point to the two hash table entries to compare. */
707 locus_map_eq (const void *va, const void *vb)
709 const struct locus_discrim_map *a = (const struct locus_discrim_map *) va;
710 const struct locus_discrim_map *b = (const struct locus_discrim_map *) vb;
711 return a->locus == b->locus;
714 /* Find the next available discriminator value for LOCUS. The
715 discriminator distinguishes among several basic blocks that
716 share a common locus, allowing for more accurate sample-based
720 next_discriminator_for_locus (location_t locus)
722 struct locus_discrim_map item;
723 struct locus_discrim_map **slot;
726 item.discriminator = 0;
727 slot = (struct locus_discrim_map **)
728 htab_find_slot_with_hash (discriminator_per_locus, (void *) &item,
729 (hashval_t) locus, INSERT);
731 if (*slot == HTAB_EMPTY_ENTRY)
733 *slot = XNEW (struct locus_discrim_map);
735 (*slot)->locus = locus;
736 (*slot)->discriminator = 0;
738 (*slot)->discriminator++;
739 return (*slot)->discriminator;
742 /* Return TRUE if LOCUS1 and LOCUS2 refer to the same source line. */
745 same_line_p (location_t locus1, location_t locus2)
747 expanded_location from, to;
749 if (locus1 == locus2)
752 from = expand_location (locus1);
753 to = expand_location (locus2);
755 if (from.line != to.line)
757 if (from.file == to.file)
759 return (from.file != NULL
761 && strcmp (from.file, to.file) == 0);
764 /* Assign a unique discriminator value to block BB if it begins at the same
765 LOCUS as its predecessor block. */
768 assign_discriminator (location_t locus, basic_block bb)
770 gimple first_in_to_bb, last_in_to_bb;
772 if (locus == 0 || bb->discriminator != 0)
775 first_in_to_bb = first_non_label_stmt (bb);
776 last_in_to_bb = last_stmt (bb);
777 if ((first_in_to_bb && same_line_p (locus, gimple_location (first_in_to_bb)))
778 || (last_in_to_bb && same_line_p (locus, gimple_location (last_in_to_bb))))
779 bb->discriminator = next_discriminator_for_locus (locus);
782 /* Create the edges for a GIMPLE_COND starting at block BB. */
785 make_cond_expr_edges (basic_block bb)
787 gimple entry = last_stmt (bb);
788 gimple then_stmt, else_stmt;
789 basic_block then_bb, else_bb;
790 tree then_label, else_label;
792 location_t entry_locus;
795 gcc_assert (gimple_code (entry) == GIMPLE_COND);
797 entry_locus = gimple_location (entry);
799 /* Entry basic blocks for each component. */
800 then_label = gimple_cond_true_label (entry);
801 else_label = gimple_cond_false_label (entry);
802 then_bb = label_to_block (then_label);
803 else_bb = label_to_block (else_label);
804 then_stmt = first_stmt (then_bb);
805 else_stmt = first_stmt (else_bb);
807 e = make_edge (bb, then_bb, EDGE_TRUE_VALUE);
808 assign_discriminator (entry_locus, then_bb);
809 e->goto_locus = gimple_location (then_stmt);
811 e->goto_block = gimple_block (then_stmt);
812 e = make_edge (bb, else_bb, EDGE_FALSE_VALUE);
815 assign_discriminator (entry_locus, else_bb);
816 e->goto_locus = gimple_location (else_stmt);
818 e->goto_block = gimple_block (else_stmt);
821 /* We do not need the labels anymore. */
822 gimple_cond_set_true_label (entry, NULL_TREE);
823 gimple_cond_set_false_label (entry, NULL_TREE);
827 /* Called for each element in the hash table (P) as we delete the
828 edge to cases hash table.
830 Clear all the TREE_CHAINs to prevent problems with copying of
831 SWITCH_EXPRs and structure sharing rules, then free the hash table
835 edge_to_cases_cleanup (const void *key ATTRIBUTE_UNUSED, void **value,
836 void *data ATTRIBUTE_UNUSED)
840 for (t = (tree) *value; t; t = next)
842 next = TREE_CHAIN (t);
843 TREE_CHAIN (t) = NULL;
850 /* Start recording information mapping edges to case labels. */
853 start_recording_case_labels (void)
855 gcc_assert (edge_to_cases == NULL);
856 edge_to_cases = pointer_map_create ();
857 touched_switch_bbs = BITMAP_ALLOC (NULL);
860 /* Return nonzero if we are recording information for case labels. */
863 recording_case_labels_p (void)
865 return (edge_to_cases != NULL);
868 /* Stop recording information mapping edges to case labels and
869 remove any information we have recorded. */
871 end_recording_case_labels (void)
875 pointer_map_traverse (edge_to_cases, edge_to_cases_cleanup, NULL);
876 pointer_map_destroy (edge_to_cases);
877 edge_to_cases = NULL;
878 EXECUTE_IF_SET_IN_BITMAP (touched_switch_bbs, 0, i, bi)
880 basic_block bb = BASIC_BLOCK (i);
883 gimple stmt = last_stmt (bb);
884 if (stmt && gimple_code (stmt) == GIMPLE_SWITCH)
885 group_case_labels_stmt (stmt);
888 BITMAP_FREE (touched_switch_bbs);
891 /* If we are inside a {start,end}_recording_cases block, then return
892 a chain of CASE_LABEL_EXPRs from T which reference E.
894 Otherwise return NULL. */
897 get_cases_for_edge (edge e, gimple t)
902 /* If we are not recording cases, then we do not have CASE_LABEL_EXPR
903 chains available. Return NULL so the caller can detect this case. */
904 if (!recording_case_labels_p ())
907 slot = pointer_map_contains (edge_to_cases, e);
911 /* If we did not find E in the hash table, then this must be the first
912 time we have been queried for information about E & T. Add all the
913 elements from T to the hash table then perform the query again. */
915 n = gimple_switch_num_labels (t);
916 for (i = 0; i < n; i++)
918 tree elt = gimple_switch_label (t, i);
919 tree lab = CASE_LABEL (elt);
920 basic_block label_bb = label_to_block (lab);
921 edge this_edge = find_edge (e->src, label_bb);
923 /* Add it to the chain of CASE_LABEL_EXPRs referencing E, or create
925 slot = pointer_map_insert (edge_to_cases, this_edge);
926 TREE_CHAIN (elt) = (tree) *slot;
930 return (tree) *pointer_map_contains (edge_to_cases, e);
933 /* Create the edges for a GIMPLE_SWITCH starting at block BB. */
936 make_gimple_switch_edges (basic_block bb)
938 gimple entry = last_stmt (bb);
939 location_t entry_locus;
942 entry_locus = gimple_location (entry);
944 n = gimple_switch_num_labels (entry);
946 for (i = 0; i < n; ++i)
948 tree lab = CASE_LABEL (gimple_switch_label (entry, i));
949 basic_block label_bb = label_to_block (lab);
950 make_edge (bb, label_bb, 0);
951 assign_discriminator (entry_locus, label_bb);
956 /* Return the basic block holding label DEST. */
959 label_to_block_fn (struct function *ifun, tree dest)
961 int uid = LABEL_DECL_UID (dest);
963 /* We would die hard when faced by an undefined label. Emit a label to
964 the very first basic block. This will hopefully make even the dataflow
965 and undefined variable warnings quite right. */
966 if (seen_error () && uid < 0)
968 gimple_stmt_iterator gsi = gsi_start_bb (BASIC_BLOCK (NUM_FIXED_BLOCKS));
971 stmt = gimple_build_label (dest);
972 gsi_insert_before (&gsi, stmt, GSI_NEW_STMT);
973 uid = LABEL_DECL_UID (dest);
975 if (VEC_length (basic_block, ifun->cfg->x_label_to_block_map)
976 <= (unsigned int) uid)
978 return VEC_index (basic_block, ifun->cfg->x_label_to_block_map, uid);
981 /* Create edges for an abnormal goto statement at block BB. If FOR_CALL
982 is true, the source statement is a CALL_EXPR instead of a GOTO_EXPR. */
985 make_abnormal_goto_edges (basic_block bb, bool for_call)
987 basic_block target_bb;
988 gimple_stmt_iterator gsi;
990 FOR_EACH_BB (target_bb)
991 for (gsi = gsi_start_bb (target_bb); !gsi_end_p (gsi); gsi_next (&gsi))
993 gimple label_stmt = gsi_stmt (gsi);
996 if (gimple_code (label_stmt) != GIMPLE_LABEL)
999 target = gimple_label_label (label_stmt);
1001 /* Make an edge to every label block that has been marked as a
1002 potential target for a computed goto or a non-local goto. */
1003 if ((FORCED_LABEL (target) && !for_call)
1004 || (DECL_NONLOCAL (target) && for_call))
1006 make_edge (bb, target_bb, EDGE_ABNORMAL);
1012 /* Create edges for a goto statement at block BB. */
1015 make_goto_expr_edges (basic_block bb)
1017 gimple_stmt_iterator last = gsi_last_bb (bb);
1018 gimple goto_t = gsi_stmt (last);
1020 /* A simple GOTO creates normal edges. */
1021 if (simple_goto_p (goto_t))
1023 tree dest = gimple_goto_dest (goto_t);
1024 basic_block label_bb = label_to_block (dest);
1025 edge e = make_edge (bb, label_bb, EDGE_FALLTHRU);
1026 e->goto_locus = gimple_location (goto_t);
1027 assign_discriminator (e->goto_locus, label_bb);
1029 e->goto_block = gimple_block (goto_t);
1030 gsi_remove (&last, true);
1034 /* A computed GOTO creates abnormal edges. */
1035 make_abnormal_goto_edges (bb, false);
1038 /* Create edges for an asm statement with labels at block BB. */
1041 make_gimple_asm_edges (basic_block bb)
1043 gimple stmt = last_stmt (bb);
1044 location_t stmt_loc = gimple_location (stmt);
1045 int i, n = gimple_asm_nlabels (stmt);
1047 for (i = 0; i < n; ++i)
1049 tree label = TREE_VALUE (gimple_asm_label_op (stmt, i));
1050 basic_block label_bb = label_to_block (label);
1051 make_edge (bb, label_bb, 0);
1052 assign_discriminator (stmt_loc, label_bb);
1056 /*---------------------------------------------------------------------------
1058 ---------------------------------------------------------------------------*/
1060 /* Cleanup useless labels in basic blocks. This is something we wish
1061 to do early because it allows us to group case labels before creating
1062 the edges for the CFG, and it speeds up block statement iterators in
1063 all passes later on.
1064 We rerun this pass after CFG is created, to get rid of the labels that
1065 are no longer referenced. After then we do not run it any more, since
1066 (almost) no new labels should be created. */
1068 /* A map from basic block index to the leading label of that block. */
1069 static struct label_record
1074 /* True if the label is referenced from somewhere. */
1078 /* Given LABEL return the first label in the same basic block. */
1081 main_block_label (tree label)
1083 basic_block bb = label_to_block (label);
1084 tree main_label = label_for_bb[bb->index].label;
1086 /* label_to_block possibly inserted undefined label into the chain. */
1089 label_for_bb[bb->index].label = label;
1093 label_for_bb[bb->index].used = true;
1097 /* Clean up redundant labels within the exception tree. */
1100 cleanup_dead_labels_eh (void)
1107 if (cfun->eh == NULL)
1110 for (i = 1; VEC_iterate (eh_landing_pad, cfun->eh->lp_array, i, lp); ++i)
1111 if (lp && lp->post_landing_pad)
1113 lab = main_block_label (lp->post_landing_pad);
1114 if (lab != lp->post_landing_pad)
1116 EH_LANDING_PAD_NR (lp->post_landing_pad) = 0;
1117 EH_LANDING_PAD_NR (lab) = lp->index;
1121 FOR_ALL_EH_REGION (r)
1125 case ERT_MUST_NOT_THROW:
1131 for (c = r->u.eh_try.first_catch; c ; c = c->next_catch)
1135 c->label = main_block_label (lab);
1140 case ERT_ALLOWED_EXCEPTIONS:
1141 lab = r->u.allowed.label;
1143 r->u.allowed.label = main_block_label (lab);
1149 /* Cleanup redundant labels. This is a three-step process:
1150 1) Find the leading label for each block.
1151 2) Redirect all references to labels to the leading labels.
1152 3) Cleanup all useless labels. */
1155 cleanup_dead_labels (void)
1158 label_for_bb = XCNEWVEC (struct label_record, last_basic_block);
1160 /* Find a suitable label for each block. We use the first user-defined
1161 label if there is one, or otherwise just the first label we see. */
1164 gimple_stmt_iterator i;
1166 for (i = gsi_start_bb (bb); !gsi_end_p (i); gsi_next (&i))
1169 gimple stmt = gsi_stmt (i);
1171 if (gimple_code (stmt) != GIMPLE_LABEL)
1174 label = gimple_label_label (stmt);
1176 /* If we have not yet seen a label for the current block,
1177 remember this one and see if there are more labels. */
1178 if (!label_for_bb[bb->index].label)
1180 label_for_bb[bb->index].label = label;
1184 /* If we did see a label for the current block already, but it
1185 is an artificially created label, replace it if the current
1186 label is a user defined label. */
1187 if (!DECL_ARTIFICIAL (label)
1188 && DECL_ARTIFICIAL (label_for_bb[bb->index].label))
1190 label_for_bb[bb->index].label = label;
1196 /* Now redirect all jumps/branches to the selected label.
1197 First do so for each block ending in a control statement. */
1200 gimple stmt = last_stmt (bb);
1204 switch (gimple_code (stmt))
1208 tree true_label = gimple_cond_true_label (stmt);
1209 tree false_label = gimple_cond_false_label (stmt);
1212 gimple_cond_set_true_label (stmt, main_block_label (true_label));
1214 gimple_cond_set_false_label (stmt, main_block_label (false_label));
1220 size_t i, n = gimple_switch_num_labels (stmt);
1222 /* Replace all destination labels. */
1223 for (i = 0; i < n; ++i)
1225 tree case_label = gimple_switch_label (stmt, i);
1226 tree label = main_block_label (CASE_LABEL (case_label));
1227 CASE_LABEL (case_label) = label;
1234 int i, n = gimple_asm_nlabels (stmt);
1236 for (i = 0; i < n; ++i)
1238 tree cons = gimple_asm_label_op (stmt, i);
1239 tree label = main_block_label (TREE_VALUE (cons));
1240 TREE_VALUE (cons) = label;
1245 /* We have to handle gotos until they're removed, and we don't
1246 remove them until after we've created the CFG edges. */
1248 if (!computed_goto_p (stmt))
1250 tree new_dest = main_block_label (gimple_goto_dest (stmt));
1251 gimple_goto_set_dest (stmt, new_dest);
1260 /* Do the same for the exception region tree labels. */
1261 cleanup_dead_labels_eh ();
1263 /* Finally, purge dead labels. All user-defined labels and labels that
1264 can be the target of non-local gotos and labels which have their
1265 address taken are preserved. */
1268 gimple_stmt_iterator i;
1269 tree label_for_this_bb = label_for_bb[bb->index].label;
1271 if (!label_for_this_bb)
1274 /* If the main label of the block is unused, we may still remove it. */
1275 if (!label_for_bb[bb->index].used)
1276 label_for_this_bb = NULL;
1278 for (i = gsi_start_bb (bb); !gsi_end_p (i); )
1281 gimple stmt = gsi_stmt (i);
1283 if (gimple_code (stmt) != GIMPLE_LABEL)
1286 label = gimple_label_label (stmt);
1288 if (label == label_for_this_bb
1289 || !DECL_ARTIFICIAL (label)
1290 || DECL_NONLOCAL (label)
1291 || FORCED_LABEL (label))
1294 gsi_remove (&i, true);
1298 free (label_for_bb);
1301 /* Scan the sorted vector of cases in STMT (a GIMPLE_SWITCH) and combine
1302 the ones jumping to the same label.
1303 Eg. three separate entries 1: 2: 3: become one entry 1..3: */
1306 group_case_labels_stmt (gimple stmt)
1308 int old_size = gimple_switch_num_labels (stmt);
1309 int i, j, new_size = old_size;
1310 tree default_case = NULL_TREE;
1311 tree default_label = NULL_TREE;
1314 /* The default label is always the first case in a switch
1315 statement after gimplification if it was not optimized
1317 if (!CASE_LOW (gimple_switch_default_label (stmt))
1318 && !CASE_HIGH (gimple_switch_default_label (stmt)))
1320 default_case = gimple_switch_default_label (stmt);
1321 default_label = CASE_LABEL (default_case);
1325 has_default = false;
1327 /* Look for possible opportunities to merge cases. */
1332 while (i < old_size)
1334 tree base_case, base_label, base_high;
1335 base_case = gimple_switch_label (stmt, i);
1337 gcc_assert (base_case);
1338 base_label = CASE_LABEL (base_case);
1340 /* Discard cases that have the same destination as the
1342 if (base_label == default_label)
1344 gimple_switch_set_label (stmt, i, NULL_TREE);
1350 base_high = CASE_HIGH (base_case)
1351 ? CASE_HIGH (base_case)
1352 : CASE_LOW (base_case);
1355 /* Try to merge case labels. Break out when we reach the end
1356 of the label vector or when we cannot merge the next case
1357 label with the current one. */
1358 while (i < old_size)
1360 tree merge_case = gimple_switch_label (stmt, i);
1361 tree merge_label = CASE_LABEL (merge_case);
1362 tree t = int_const_binop (PLUS_EXPR, base_high,
1363 integer_one_node, 1);
1365 /* Merge the cases if they jump to the same place,
1366 and their ranges are consecutive. */
1367 if (merge_label == base_label
1368 && tree_int_cst_equal (CASE_LOW (merge_case), t))
1370 base_high = CASE_HIGH (merge_case) ?
1371 CASE_HIGH (merge_case) : CASE_LOW (merge_case);
1372 CASE_HIGH (base_case) = base_high;
1373 gimple_switch_set_label (stmt, i, NULL_TREE);
1382 /* Compress the case labels in the label vector, and adjust the
1383 length of the vector. */
1384 for (i = 0, j = 0; i < new_size; i++)
1386 while (! gimple_switch_label (stmt, j))
1388 gimple_switch_set_label (stmt, i,
1389 gimple_switch_label (stmt, j++));
1392 gcc_assert (new_size <= old_size);
1393 gimple_switch_set_num_labels (stmt, new_size);
1396 /* Look for blocks ending in a multiway branch (a GIMPLE_SWITCH),
1397 and scan the sorted vector of cases. Combine the ones jumping to the
1401 group_case_labels (void)
1407 gimple stmt = last_stmt (bb);
1408 if (stmt && gimple_code (stmt) == GIMPLE_SWITCH)
1409 group_case_labels_stmt (stmt);
1413 /* Checks whether we can merge block B into block A. */
1416 gimple_can_merge_blocks_p (basic_block a, basic_block b)
1419 gimple_stmt_iterator gsi;
1422 if (!single_succ_p (a))
1425 if (single_succ_edge (a)->flags & (EDGE_ABNORMAL | EDGE_EH))
1428 if (single_succ (a) != b)
1431 if (!single_pred_p (b))
1434 if (b == EXIT_BLOCK_PTR)
1437 /* If A ends by a statement causing exceptions or something similar, we
1438 cannot merge the blocks. */
1439 stmt = last_stmt (a);
1440 if (stmt && stmt_ends_bb_p (stmt))
1443 /* Do not allow a block with only a non-local label to be merged. */
1445 && gimple_code (stmt) == GIMPLE_LABEL
1446 && DECL_NONLOCAL (gimple_label_label (stmt)))
1449 /* Examine the labels at the beginning of B. */
1450 for (gsi = gsi_start_bb (b); !gsi_end_p (gsi); gsi_next (&gsi))
1453 stmt = gsi_stmt (gsi);
1454 if (gimple_code (stmt) != GIMPLE_LABEL)
1456 lab = gimple_label_label (stmt);
1458 /* Do not remove user labels. */
1459 if (!DECL_ARTIFICIAL (lab))
1463 /* Protect the loop latches. */
1464 if (current_loops && b->loop_father->latch == b)
1467 /* It must be possible to eliminate all phi nodes in B. If ssa form
1468 is not up-to-date and a name-mapping is registered, we cannot eliminate
1469 any phis. Symbols marked for renaming are never a problem though. */
1470 phis = phi_nodes (b);
1471 if (!gimple_seq_empty_p (phis)
1472 && name_mappings_registered_p ())
1475 /* When not optimizing, don't merge if we'd lose goto_locus. */
1477 && single_succ_edge (a)->goto_locus != UNKNOWN_LOCATION)
1479 location_t goto_locus = single_succ_edge (a)->goto_locus;
1480 gimple_stmt_iterator prev, next;
1481 prev = gsi_last_nondebug_bb (a);
1482 next = gsi_after_labels (b);
1483 if (!gsi_end_p (next) && is_gimple_debug (gsi_stmt (next)))
1484 gsi_next_nondebug (&next);
1485 if ((gsi_end_p (prev)
1486 || gimple_location (gsi_stmt (prev)) != goto_locus)
1487 && (gsi_end_p (next)
1488 || gimple_location (gsi_stmt (next)) != goto_locus))
1495 /* Return true if the var whose chain of uses starts at PTR has no
1498 has_zero_uses_1 (const ssa_use_operand_t *head)
1500 const ssa_use_operand_t *ptr;
1502 for (ptr = head->next; ptr != head; ptr = ptr->next)
1503 if (!is_gimple_debug (USE_STMT (ptr)))
1509 /* Return true if the var whose chain of uses starts at PTR has a
1510 single nondebug use. Set USE_P and STMT to that single nondebug
1511 use, if so, or to NULL otherwise. */
1513 single_imm_use_1 (const ssa_use_operand_t *head,
1514 use_operand_p *use_p, gimple *stmt)
1516 ssa_use_operand_t *ptr, *single_use = 0;
1518 for (ptr = head->next; ptr != head; ptr = ptr->next)
1519 if (!is_gimple_debug (USE_STMT (ptr)))
1530 *use_p = single_use;
1533 *stmt = single_use ? single_use->loc.stmt : NULL;
1535 return !!single_use;
1538 /* Replaces all uses of NAME by VAL. */
1541 replace_uses_by (tree name, tree val)
1543 imm_use_iterator imm_iter;
1548 FOR_EACH_IMM_USE_STMT (stmt, imm_iter, name)
1550 FOR_EACH_IMM_USE_ON_STMT (use, imm_iter)
1552 replace_exp (use, val);
1554 if (gimple_code (stmt) == GIMPLE_PHI)
1556 e = gimple_phi_arg_edge (stmt, PHI_ARG_INDEX_FROM_USE (use));
1557 if (e->flags & EDGE_ABNORMAL)
1559 /* This can only occur for virtual operands, since
1560 for the real ones SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name))
1561 would prevent replacement. */
1562 gcc_assert (!is_gimple_reg (name));
1563 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (val) = 1;
1568 if (gimple_code (stmt) != GIMPLE_PHI)
1572 fold_stmt_inplace (stmt);
1573 if (cfgcleanup_altered_bbs)
1574 bitmap_set_bit (cfgcleanup_altered_bbs, gimple_bb (stmt)->index);
1576 /* FIXME. This should go in update_stmt. */
1577 for (i = 0; i < gimple_num_ops (stmt); i++)
1579 tree op = gimple_op (stmt, i);
1580 /* Operands may be empty here. For example, the labels
1581 of a GIMPLE_COND are nulled out following the creation
1582 of the corresponding CFG edges. */
1583 if (op && TREE_CODE (op) == ADDR_EXPR)
1584 recompute_tree_invariant_for_addr_expr (op);
1587 maybe_clean_or_replace_eh_stmt (stmt, stmt);
1592 gcc_assert (has_zero_uses (name));
1594 /* Also update the trees stored in loop structures. */
1600 FOR_EACH_LOOP (li, loop, 0)
1602 substitute_in_loop_info (loop, name, val);
1607 /* Merge block B into block A. */
1610 gimple_merge_blocks (basic_block a, basic_block b)
1612 gimple_stmt_iterator last, gsi, psi;
1613 gimple_seq phis = phi_nodes (b);
1616 fprintf (dump_file, "Merging blocks %d and %d\n", a->index, b->index);
1618 /* Remove all single-valued PHI nodes from block B of the form
1619 V_i = PHI <V_j> by propagating V_j to all the uses of V_i. */
1620 gsi = gsi_last_bb (a);
1621 for (psi = gsi_start (phis); !gsi_end_p (psi); )
1623 gimple phi = gsi_stmt (psi);
1624 tree def = gimple_phi_result (phi), use = gimple_phi_arg_def (phi, 0);
1626 bool may_replace_uses = !is_gimple_reg (def)
1627 || may_propagate_copy (def, use);
1629 /* In case we maintain loop closed ssa form, do not propagate arguments
1630 of loop exit phi nodes. */
1632 && loops_state_satisfies_p (LOOP_CLOSED_SSA)
1633 && is_gimple_reg (def)
1634 && TREE_CODE (use) == SSA_NAME
1635 && a->loop_father != b->loop_father)
1636 may_replace_uses = false;
1638 if (!may_replace_uses)
1640 gcc_assert (is_gimple_reg (def));
1642 /* Note that just emitting the copies is fine -- there is no problem
1643 with ordering of phi nodes. This is because A is the single
1644 predecessor of B, therefore results of the phi nodes cannot
1645 appear as arguments of the phi nodes. */
1646 copy = gimple_build_assign (def, use);
1647 gsi_insert_after (&gsi, copy, GSI_NEW_STMT);
1648 remove_phi_node (&psi, false);
1652 /* If we deal with a PHI for virtual operands, we can simply
1653 propagate these without fussing with folding or updating
1655 if (!is_gimple_reg (def))
1657 imm_use_iterator iter;
1658 use_operand_p use_p;
1661 FOR_EACH_IMM_USE_STMT (stmt, iter, def)
1662 FOR_EACH_IMM_USE_ON_STMT (use_p, iter)
1663 SET_USE (use_p, use);
1665 if (SSA_NAME_OCCURS_IN_ABNORMAL_PHI (def))
1666 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (use) = 1;
1669 replace_uses_by (def, use);
1671 remove_phi_node (&psi, true);
1675 /* Ensure that B follows A. */
1676 move_block_after (b, a);
1678 gcc_assert (single_succ_edge (a)->flags & EDGE_FALLTHRU);
1679 gcc_assert (!last_stmt (a) || !stmt_ends_bb_p (last_stmt (a)));
1681 /* Remove labels from B and set gimple_bb to A for other statements. */
1682 for (gsi = gsi_start_bb (b); !gsi_end_p (gsi);)
1684 gimple stmt = gsi_stmt (gsi);
1685 if (gimple_code (stmt) == GIMPLE_LABEL)
1687 tree label = gimple_label_label (stmt);
1690 gsi_remove (&gsi, false);
1692 /* Now that we can thread computed gotos, we might have
1693 a situation where we have a forced label in block B
1694 However, the label at the start of block B might still be
1695 used in other ways (think about the runtime checking for
1696 Fortran assigned gotos). So we can not just delete the
1697 label. Instead we move the label to the start of block A. */
1698 if (FORCED_LABEL (label))
1700 gimple_stmt_iterator dest_gsi = gsi_start_bb (a);
1701 gsi_insert_before (&dest_gsi, stmt, GSI_NEW_STMT);
1704 lp_nr = EH_LANDING_PAD_NR (label);
1707 eh_landing_pad lp = get_eh_landing_pad_from_number (lp_nr);
1708 lp->post_landing_pad = NULL;
1713 gimple_set_bb (stmt, a);
1718 /* Merge the sequences. */
1719 last = gsi_last_bb (a);
1720 gsi_insert_seq_after (&last, bb_seq (b), GSI_NEW_STMT);
1721 set_bb_seq (b, NULL);
1723 if (cfgcleanup_altered_bbs)
1724 bitmap_set_bit (cfgcleanup_altered_bbs, a->index);
1728 /* Return the one of two successors of BB that is not reachable by a
1729 complex edge, if there is one. Else, return BB. We use
1730 this in optimizations that use post-dominators for their heuristics,
1731 to catch the cases in C++ where function calls are involved. */
1734 single_noncomplex_succ (basic_block bb)
1737 if (EDGE_COUNT (bb->succs) != 2)
1740 e0 = EDGE_SUCC (bb, 0);
1741 e1 = EDGE_SUCC (bb, 1);
1742 if (e0->flags & EDGE_COMPLEX)
1744 if (e1->flags & EDGE_COMPLEX)
1750 /* T is CALL_EXPR. Set current_function_calls_* flags. */
1753 notice_special_calls (gimple call)
1755 int flags = gimple_call_flags (call);
1757 if (flags & ECF_MAY_BE_ALLOCA)
1758 cfun->calls_alloca = true;
1759 if (flags & ECF_RETURNS_TWICE)
1760 cfun->calls_setjmp = true;
1764 /* Clear flags set by notice_special_calls. Used by dead code removal
1765 to update the flags. */
1768 clear_special_calls (void)
1770 cfun->calls_alloca = false;
1771 cfun->calls_setjmp = false;
1774 /* Remove PHI nodes associated with basic block BB and all edges out of BB. */
1777 remove_phi_nodes_and_edges_for_unreachable_block (basic_block bb)
1779 /* Since this block is no longer reachable, we can just delete all
1780 of its PHI nodes. */
1781 remove_phi_nodes (bb);
1783 /* Remove edges to BB's successors. */
1784 while (EDGE_COUNT (bb->succs) > 0)
1785 remove_edge (EDGE_SUCC (bb, 0));
1789 /* Remove statements of basic block BB. */
1792 remove_bb (basic_block bb)
1794 gimple_stmt_iterator i;
1798 fprintf (dump_file, "Removing basic block %d\n", bb->index);
1799 if (dump_flags & TDF_DETAILS)
1801 dump_bb (bb, dump_file, 0);
1802 fprintf (dump_file, "\n");
1808 struct loop *loop = bb->loop_father;
1810 /* If a loop gets removed, clean up the information associated
1812 if (loop->latch == bb
1813 || loop->header == bb)
1814 free_numbers_of_iterations_estimates_loop (loop);
1817 /* Remove all the instructions in the block. */
1818 if (bb_seq (bb) != NULL)
1820 /* Walk backwards so as to get a chance to substitute all
1821 released DEFs into debug stmts. See
1822 eliminate_unnecessary_stmts() in tree-ssa-dce.c for more
1824 for (i = gsi_last_bb (bb); !gsi_end_p (i);)
1826 gimple stmt = gsi_stmt (i);
1827 if (gimple_code (stmt) == GIMPLE_LABEL
1828 && (FORCED_LABEL (gimple_label_label (stmt))
1829 || DECL_NONLOCAL (gimple_label_label (stmt))))
1832 gimple_stmt_iterator new_gsi;
1834 /* A non-reachable non-local label may still be referenced.
1835 But it no longer needs to carry the extra semantics of
1837 if (DECL_NONLOCAL (gimple_label_label (stmt)))
1839 DECL_NONLOCAL (gimple_label_label (stmt)) = 0;
1840 FORCED_LABEL (gimple_label_label (stmt)) = 1;
1843 new_bb = bb->prev_bb;
1844 new_gsi = gsi_start_bb (new_bb);
1845 gsi_remove (&i, false);
1846 gsi_insert_before (&new_gsi, stmt, GSI_NEW_STMT);
1850 /* Release SSA definitions if we are in SSA. Note that we
1851 may be called when not in SSA. For example,
1852 final_cleanup calls this function via
1853 cleanup_tree_cfg. */
1854 if (gimple_in_ssa_p (cfun))
1855 release_defs (stmt);
1857 gsi_remove (&i, true);
1861 i = gsi_last_bb (bb);
1867 remove_phi_nodes_and_edges_for_unreachable_block (bb);
1868 bb->il.gimple = NULL;
1872 /* Given a basic block BB ending with COND_EXPR or SWITCH_EXPR, and a
1873 predicate VAL, return the edge that will be taken out of the block.
1874 If VAL does not match a unique edge, NULL is returned. */
1877 find_taken_edge (basic_block bb, tree val)
1881 stmt = last_stmt (bb);
1884 gcc_assert (is_ctrl_stmt (stmt));
1889 if (!is_gimple_min_invariant (val))
1892 if (gimple_code (stmt) == GIMPLE_COND)
1893 return find_taken_edge_cond_expr (bb, val);
1895 if (gimple_code (stmt) == GIMPLE_SWITCH)
1896 return find_taken_edge_switch_expr (bb, val);
1898 if (computed_goto_p (stmt))
1900 /* Only optimize if the argument is a label, if the argument is
1901 not a label then we can not construct a proper CFG.
1903 It may be the case that we only need to allow the LABEL_REF to
1904 appear inside an ADDR_EXPR, but we also allow the LABEL_REF to
1905 appear inside a LABEL_EXPR just to be safe. */
1906 if ((TREE_CODE (val) == ADDR_EXPR || TREE_CODE (val) == LABEL_EXPR)
1907 && TREE_CODE (TREE_OPERAND (val, 0)) == LABEL_DECL)
1908 return find_taken_edge_computed_goto (bb, TREE_OPERAND (val, 0));
1915 /* Given a constant value VAL and the entry block BB to a GOTO_EXPR
1916 statement, determine which of the outgoing edges will be taken out of the
1917 block. Return NULL if either edge may be taken. */
1920 find_taken_edge_computed_goto (basic_block bb, tree val)
1925 dest = label_to_block (val);
1928 e = find_edge (bb, dest);
1929 gcc_assert (e != NULL);
1935 /* Given a constant value VAL and the entry block BB to a COND_EXPR
1936 statement, determine which of the two edges will be taken out of the
1937 block. Return NULL if either edge may be taken. */
1940 find_taken_edge_cond_expr (basic_block bb, tree val)
1942 edge true_edge, false_edge;
1944 extract_true_false_edges_from_block (bb, &true_edge, &false_edge);
1946 gcc_assert (TREE_CODE (val) == INTEGER_CST);
1947 return (integer_zerop (val) ? false_edge : true_edge);
1950 /* Given an INTEGER_CST VAL and the entry block BB to a SWITCH_EXPR
1951 statement, determine which edge will be taken out of the block. Return
1952 NULL if any edge may be taken. */
1955 find_taken_edge_switch_expr (basic_block bb, tree val)
1957 basic_block dest_bb;
1962 switch_stmt = last_stmt (bb);
1963 taken_case = find_case_label_for_value (switch_stmt, val);
1964 dest_bb = label_to_block (CASE_LABEL (taken_case));
1966 e = find_edge (bb, dest_bb);
1972 /* Return the CASE_LABEL_EXPR that SWITCH_STMT will take for VAL.
1973 We can make optimal use here of the fact that the case labels are
1974 sorted: We can do a binary search for a case matching VAL. */
1977 find_case_label_for_value (gimple switch_stmt, tree val)
1979 size_t low, high, n = gimple_switch_num_labels (switch_stmt);
1980 tree default_case = gimple_switch_default_label (switch_stmt);
1982 for (low = 0, high = n; high - low > 1; )
1984 size_t i = (high + low) / 2;
1985 tree t = gimple_switch_label (switch_stmt, i);
1988 /* Cache the result of comparing CASE_LOW and val. */
1989 cmp = tree_int_cst_compare (CASE_LOW (t), val);
1996 if (CASE_HIGH (t) == NULL)
1998 /* A singe-valued case label. */
2004 /* A case range. We can only handle integer ranges. */
2005 if (cmp <= 0 && tree_int_cst_compare (CASE_HIGH (t), val) >= 0)
2010 return default_case;
2014 /* Dump a basic block on stderr. */
2017 gimple_debug_bb (basic_block bb)
2019 gimple_dump_bb (bb, stderr, 0, TDF_VOPS|TDF_MEMSYMS);
2023 /* Dump basic block with index N on stderr. */
2026 gimple_debug_bb_n (int n)
2028 gimple_debug_bb (BASIC_BLOCK (n));
2029 return BASIC_BLOCK (n);
2033 /* Dump the CFG on stderr.
2035 FLAGS are the same used by the tree dumping functions
2036 (see TDF_* in tree-pass.h). */
2039 gimple_debug_cfg (int flags)
2041 gimple_dump_cfg (stderr, flags);
2045 /* Dump the program showing basic block boundaries on the given FILE.
2047 FLAGS are the same used by the tree dumping functions (see TDF_* in
2051 gimple_dump_cfg (FILE *file, int flags)
2053 if (flags & TDF_DETAILS)
2055 const char *funcname
2056 = lang_hooks.decl_printable_name (current_function_decl, 2);
2059 fprintf (file, ";; Function %s\n\n", funcname);
2060 fprintf (file, ";; \n%d basic blocks, %d edges, last basic block %d.\n\n",
2061 n_basic_blocks, n_edges, last_basic_block);
2063 brief_dump_cfg (file);
2064 fprintf (file, "\n");
2067 if (flags & TDF_STATS)
2068 dump_cfg_stats (file);
2070 dump_function_to_file (current_function_decl, file, flags | TDF_BLOCKS);
2074 /* Dump CFG statistics on FILE. */
2077 dump_cfg_stats (FILE *file)
2079 static long max_num_merged_labels = 0;
2080 unsigned long size, total = 0;
2083 const char * const fmt_str = "%-30s%-13s%12s\n";
2084 const char * const fmt_str_1 = "%-30s%13d%11lu%c\n";
2085 const char * const fmt_str_2 = "%-30s%13ld%11lu%c\n";
2086 const char * const fmt_str_3 = "%-43s%11lu%c\n";
2087 const char *funcname
2088 = lang_hooks.decl_printable_name (current_function_decl, 2);
2091 fprintf (file, "\nCFG Statistics for %s\n\n", funcname);
2093 fprintf (file, "---------------------------------------------------------\n");
2094 fprintf (file, fmt_str, "", " Number of ", "Memory");
2095 fprintf (file, fmt_str, "", " instances ", "used ");
2096 fprintf (file, "---------------------------------------------------------\n");
2098 size = n_basic_blocks * sizeof (struct basic_block_def);
2100 fprintf (file, fmt_str_1, "Basic blocks", n_basic_blocks,
2101 SCALE (size), LABEL (size));
2105 num_edges += EDGE_COUNT (bb->succs);
2106 size = num_edges * sizeof (struct edge_def);
2108 fprintf (file, fmt_str_2, "Edges", num_edges, SCALE (size), LABEL (size));
2110 fprintf (file, "---------------------------------------------------------\n");
2111 fprintf (file, fmt_str_3, "Total memory used by CFG data", SCALE (total),
2113 fprintf (file, "---------------------------------------------------------\n");
2114 fprintf (file, "\n");
2116 if (cfg_stats.num_merged_labels > max_num_merged_labels)
2117 max_num_merged_labels = cfg_stats.num_merged_labels;
2119 fprintf (file, "Coalesced label blocks: %ld (Max so far: %ld)\n",
2120 cfg_stats.num_merged_labels, max_num_merged_labels);
2122 fprintf (file, "\n");
2126 /* Dump CFG statistics on stderr. Keep extern so that it's always
2127 linked in the final executable. */
2130 debug_cfg_stats (void)
2132 dump_cfg_stats (stderr);
2136 /* Dump the flowgraph to a .vcg FILE. */
2139 gimple_cfg2vcg (FILE *file)
2144 const char *funcname
2145 = lang_hooks.decl_printable_name (current_function_decl, 2);
2147 /* Write the file header. */
2148 fprintf (file, "graph: { title: \"%s\"\n", funcname);
2149 fprintf (file, "node: { title: \"ENTRY\" label: \"ENTRY\" }\n");
2150 fprintf (file, "node: { title: \"EXIT\" label: \"EXIT\" }\n");
2152 /* Write blocks and edges. */
2153 FOR_EACH_EDGE (e, ei, ENTRY_BLOCK_PTR->succs)
2155 fprintf (file, "edge: { sourcename: \"ENTRY\" targetname: \"%d\"",
2158 if (e->flags & EDGE_FAKE)
2159 fprintf (file, " linestyle: dotted priority: 10");
2161 fprintf (file, " linestyle: solid priority: 100");
2163 fprintf (file, " }\n");
2169 enum gimple_code head_code, end_code;
2170 const char *head_name, *end_name;
2173 gimple first = first_stmt (bb);
2174 gimple last = last_stmt (bb);
2178 head_code = gimple_code (first);
2179 head_name = gimple_code_name[head_code];
2180 head_line = get_lineno (first);
2183 head_name = "no-statement";
2187 end_code = gimple_code (last);
2188 end_name = gimple_code_name[end_code];
2189 end_line = get_lineno (last);
2192 end_name = "no-statement";
2194 fprintf (file, "node: { title: \"%d\" label: \"#%d\\n%s (%d)\\n%s (%d)\"}\n",
2195 bb->index, bb->index, head_name, head_line, end_name,
2198 FOR_EACH_EDGE (e, ei, bb->succs)
2200 if (e->dest == EXIT_BLOCK_PTR)
2201 fprintf (file, "edge: { sourcename: \"%d\" targetname: \"EXIT\"", bb->index);
2203 fprintf (file, "edge: { sourcename: \"%d\" targetname: \"%d\"", bb->index, e->dest->index);
2205 if (e->flags & EDGE_FAKE)
2206 fprintf (file, " priority: 10 linestyle: dotted");
2208 fprintf (file, " priority: 100 linestyle: solid");
2210 fprintf (file, " }\n");
2213 if (bb->next_bb != EXIT_BLOCK_PTR)
2217 fputs ("}\n\n", file);
2222 /*---------------------------------------------------------------------------
2223 Miscellaneous helpers
2224 ---------------------------------------------------------------------------*/
2226 /* Return true if T represents a stmt that always transfers control. */
2229 is_ctrl_stmt (gimple t)
2231 switch (gimple_code (t))
2245 /* Return true if T is a statement that may alter the flow of control
2246 (e.g., a call to a non-returning function). */
2249 is_ctrl_altering_stmt (gimple t)
2253 switch (gimple_code (t))
2257 int flags = gimple_call_flags (t);
2259 /* A non-pure/const call alters flow control if the current
2260 function has nonlocal labels. */
2261 if (!(flags & (ECF_CONST | ECF_PURE)) && cfun->has_nonlocal_label)
2264 /* A call also alters control flow if it does not return. */
2265 if (flags & ECF_NORETURN)
2268 /* BUILT_IN_RETURN call is same as return statement. */
2269 if (gimple_call_builtin_p (t, BUILT_IN_RETURN))
2274 case GIMPLE_EH_DISPATCH:
2275 /* EH_DISPATCH branches to the individual catch handlers at
2276 this level of a try or allowed-exceptions region. It can
2277 fallthru to the next statement as well. */
2281 if (gimple_asm_nlabels (t) > 0)
2286 /* OpenMP directives alter control flow. */
2293 /* If a statement can throw, it alters control flow. */
2294 return stmt_can_throw_internal (t);
2298 /* Return true if T is a simple local goto. */
2301 simple_goto_p (gimple t)
2303 return (gimple_code (t) == GIMPLE_GOTO
2304 && TREE_CODE (gimple_goto_dest (t)) == LABEL_DECL);
2308 /* Return true if T can make an abnormal transfer of control flow.
2309 Transfers of control flow associated with EH are excluded. */
2312 stmt_can_make_abnormal_goto (gimple t)
2314 if (computed_goto_p (t))
2316 if (is_gimple_call (t))
2317 return gimple_has_side_effects (t) && cfun->has_nonlocal_label;
2322 /* Return true if STMT should start a new basic block. PREV_STMT is
2323 the statement preceding STMT. It is used when STMT is a label or a
2324 case label. Labels should only start a new basic block if their
2325 previous statement wasn't a label. Otherwise, sequence of labels
2326 would generate unnecessary basic blocks that only contain a single
2330 stmt_starts_bb_p (gimple stmt, gimple prev_stmt)
2335 /* Labels start a new basic block only if the preceding statement
2336 wasn't a label of the same type. This prevents the creation of
2337 consecutive blocks that have nothing but a single label. */
2338 if (gimple_code (stmt) == GIMPLE_LABEL)
2340 /* Nonlocal and computed GOTO targets always start a new block. */
2341 if (DECL_NONLOCAL (gimple_label_label (stmt))
2342 || FORCED_LABEL (gimple_label_label (stmt)))
2345 if (prev_stmt && gimple_code (prev_stmt) == GIMPLE_LABEL)
2347 if (DECL_NONLOCAL (gimple_label_label (prev_stmt)))
2350 cfg_stats.num_merged_labels++;
2361 /* Return true if T should end a basic block. */
2364 stmt_ends_bb_p (gimple t)
2366 return is_ctrl_stmt (t) || is_ctrl_altering_stmt (t);
2369 /* Remove block annotations and other data structures. */
2372 delete_tree_cfg_annotations (void)
2374 label_to_block_map = NULL;
2378 /* Return the first statement in basic block BB. */
2381 first_stmt (basic_block bb)
2383 gimple_stmt_iterator i = gsi_start_bb (bb);
2386 while (!gsi_end_p (i) && is_gimple_debug ((stmt = gsi_stmt (i))))
2394 /* Return the first non-label statement in basic block BB. */
2397 first_non_label_stmt (basic_block bb)
2399 gimple_stmt_iterator i = gsi_start_bb (bb);
2400 while (!gsi_end_p (i) && gimple_code (gsi_stmt (i)) == GIMPLE_LABEL)
2402 return !gsi_end_p (i) ? gsi_stmt (i) : NULL;
2405 /* Return the last statement in basic block BB. */
2408 last_stmt (basic_block bb)
2410 gimple_stmt_iterator i = gsi_last_bb (bb);
2413 while (!gsi_end_p (i) && is_gimple_debug ((stmt = gsi_stmt (i))))
2421 /* Return the last statement of an otherwise empty block. Return NULL
2422 if the block is totally empty, or if it contains more than one
2426 last_and_only_stmt (basic_block bb)
2428 gimple_stmt_iterator i = gsi_last_nondebug_bb (bb);
2434 last = gsi_stmt (i);
2435 gsi_prev_nondebug (&i);
2439 /* Empty statements should no longer appear in the instruction stream.
2440 Everything that might have appeared before should be deleted by
2441 remove_useless_stmts, and the optimizers should just gsi_remove
2442 instead of smashing with build_empty_stmt.
2444 Thus the only thing that should appear here in a block containing
2445 one executable statement is a label. */
2446 prev = gsi_stmt (i);
2447 if (gimple_code (prev) == GIMPLE_LABEL)
2453 /* Reinstall those PHI arguments queued in OLD_EDGE to NEW_EDGE. */
2456 reinstall_phi_args (edge new_edge, edge old_edge)
2458 edge_var_map_vector v;
2461 gimple_stmt_iterator phis;
2463 v = redirect_edge_var_map_vector (old_edge);
2467 for (i = 0, phis = gsi_start_phis (new_edge->dest);
2468 VEC_iterate (edge_var_map, v, i, vm) && !gsi_end_p (phis);
2469 i++, gsi_next (&phis))
2471 gimple phi = gsi_stmt (phis);
2472 tree result = redirect_edge_var_map_result (vm);
2473 tree arg = redirect_edge_var_map_def (vm);
2475 gcc_assert (result == gimple_phi_result (phi));
2477 add_phi_arg (phi, arg, new_edge, redirect_edge_var_map_location (vm));
2480 redirect_edge_var_map_clear (old_edge);
2483 /* Returns the basic block after which the new basic block created
2484 by splitting edge EDGE_IN should be placed. Tries to keep the new block
2485 near its "logical" location. This is of most help to humans looking
2486 at debugging dumps. */
2489 split_edge_bb_loc (edge edge_in)
2491 basic_block dest = edge_in->dest;
2492 basic_block dest_prev = dest->prev_bb;
2496 edge e = find_edge (dest_prev, dest);
2497 if (e && !(e->flags & EDGE_COMPLEX))
2498 return edge_in->src;
2503 /* Split a (typically critical) edge EDGE_IN. Return the new block.
2504 Abort on abnormal edges. */
2507 gimple_split_edge (edge edge_in)
2509 basic_block new_bb, after_bb, dest;
2512 /* Abnormal edges cannot be split. */
2513 gcc_assert (!(edge_in->flags & EDGE_ABNORMAL));
2515 dest = edge_in->dest;
2517 after_bb = split_edge_bb_loc (edge_in);
2519 new_bb = create_empty_bb (after_bb);
2520 new_bb->frequency = EDGE_FREQUENCY (edge_in);
2521 new_bb->count = edge_in->count;
2522 new_edge = make_edge (new_bb, dest, EDGE_FALLTHRU);
2523 new_edge->probability = REG_BR_PROB_BASE;
2524 new_edge->count = edge_in->count;
2526 e = redirect_edge_and_branch (edge_in, new_bb);
2527 gcc_assert (e == edge_in);
2528 reinstall_phi_args (new_edge, e);
2534 /* Verify properties of the address expression T with base object BASE. */
2537 verify_address (tree t, tree base)
2540 bool old_side_effects;
2542 bool new_side_effects;
2544 old_constant = TREE_CONSTANT (t);
2545 old_side_effects = TREE_SIDE_EFFECTS (t);
2547 recompute_tree_invariant_for_addr_expr (t);
2548 new_side_effects = TREE_SIDE_EFFECTS (t);
2549 new_constant = TREE_CONSTANT (t);
2551 if (old_constant != new_constant)
2553 error ("constant not recomputed when ADDR_EXPR changed");
2556 if (old_side_effects != new_side_effects)
2558 error ("side effects not recomputed when ADDR_EXPR changed");
2562 if (!(TREE_CODE (base) == VAR_DECL
2563 || TREE_CODE (base) == PARM_DECL
2564 || TREE_CODE (base) == RESULT_DECL))
2567 if (DECL_GIMPLE_REG_P (base))
2569 error ("DECL_GIMPLE_REG_P set on a variable with address taken");
2576 /* Callback for walk_tree, check that all elements with address taken are
2577 properly noticed as such. The DATA is an int* that is 1 if TP was seen
2578 inside a PHI node. */
2581 verify_expr (tree *tp, int *walk_subtrees, void *data ATTRIBUTE_UNUSED)
2588 /* Check operand N for being valid GIMPLE and give error MSG if not. */
2589 #define CHECK_OP(N, MSG) \
2590 do { if (!is_gimple_val (TREE_OPERAND (t, N))) \
2591 { error (MSG); return TREE_OPERAND (t, N); }} while (0)
2593 switch (TREE_CODE (t))
2596 if (SSA_NAME_IN_FREE_LIST (t))
2598 error ("SSA name in freelist but still referenced");
2604 error ("INDIRECT_REF in gimple IL");
2608 x = TREE_OPERAND (t, 0);
2609 if (!POINTER_TYPE_P (TREE_TYPE (x))
2610 || !is_gimple_mem_ref_addr (x))
2612 error ("Invalid first operand of MEM_REF.");
2615 if (TREE_CODE (TREE_OPERAND (t, 1)) != INTEGER_CST
2616 || !POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (t, 1))))
2618 error ("Invalid offset operand of MEM_REF.");
2619 return TREE_OPERAND (t, 1);
2621 if (TREE_CODE (x) == ADDR_EXPR
2622 && (x = verify_address (x, TREE_OPERAND (x, 0))))
2628 x = fold (ASSERT_EXPR_COND (t));
2629 if (x == boolean_false_node)
2631 error ("ASSERT_EXPR with an always-false condition");
2637 error ("MODIFY_EXPR not expected while having tuples.");
2644 gcc_assert (is_gimple_address (t));
2646 /* Skip any references (they will be checked when we recurse down the
2647 tree) and ensure that any variable used as a prefix is marked
2649 for (x = TREE_OPERAND (t, 0);
2650 handled_component_p (x);
2651 x = TREE_OPERAND (x, 0))
2654 if ((tem = verify_address (t, x)))
2657 if (!(TREE_CODE (x) == VAR_DECL
2658 || TREE_CODE (x) == PARM_DECL
2659 || TREE_CODE (x) == RESULT_DECL))
2662 if (!TREE_ADDRESSABLE (x))
2664 error ("address taken, but ADDRESSABLE bit not set");
2672 x = COND_EXPR_COND (t);
2673 if (!INTEGRAL_TYPE_P (TREE_TYPE (x)))
2675 error ("non-integral used in condition");
2678 if (!is_gimple_condexpr (x))
2680 error ("invalid conditional operand");
2685 case NON_LVALUE_EXPR:
2689 case FIX_TRUNC_EXPR:
2694 case TRUTH_NOT_EXPR:
2695 CHECK_OP (0, "invalid operand to unary operator");
2702 case ARRAY_RANGE_REF:
2704 case VIEW_CONVERT_EXPR:
2705 /* We have a nest of references. Verify that each of the operands
2706 that determine where to reference is either a constant or a variable,
2707 verify that the base is valid, and then show we've already checked
2709 while (handled_component_p (t))
2711 if (TREE_CODE (t) == COMPONENT_REF && TREE_OPERAND (t, 2))
2712 CHECK_OP (2, "invalid COMPONENT_REF offset operator");
2713 else if (TREE_CODE (t) == ARRAY_REF
2714 || TREE_CODE (t) == ARRAY_RANGE_REF)
2716 CHECK_OP (1, "invalid array index");
2717 if (TREE_OPERAND (t, 2))
2718 CHECK_OP (2, "invalid array lower bound");
2719 if (TREE_OPERAND (t, 3))
2720 CHECK_OP (3, "invalid array stride");
2722 else if (TREE_CODE (t) == BIT_FIELD_REF)
2724 if (!host_integerp (TREE_OPERAND (t, 1), 1)
2725 || !host_integerp (TREE_OPERAND (t, 2), 1))
2727 error ("invalid position or size operand to BIT_FIELD_REF");
2730 else if (INTEGRAL_TYPE_P (TREE_TYPE (t))
2731 && (TYPE_PRECISION (TREE_TYPE (t))
2732 != TREE_INT_CST_LOW (TREE_OPERAND (t, 1))))
2734 error ("integral result type precision does not match "
2735 "field size of BIT_FIELD_REF");
2738 if (!INTEGRAL_TYPE_P (TREE_TYPE (t))
2739 && (GET_MODE_PRECISION (TYPE_MODE (TREE_TYPE (t)))
2740 != TREE_INT_CST_LOW (TREE_OPERAND (t, 1))))
2742 error ("mode precision of non-integral result does not "
2743 "match field size of BIT_FIELD_REF");
2748 t = TREE_OPERAND (t, 0);
2751 if (!is_gimple_min_invariant (t) && !is_gimple_lvalue (t))
2753 error ("invalid reference prefix");
2760 /* PLUS_EXPR and MINUS_EXPR don't work on pointers, they should be done using
2761 POINTER_PLUS_EXPR. */
2762 if (POINTER_TYPE_P (TREE_TYPE (t)))
2764 error ("invalid operand to plus/minus, type is a pointer");
2767 CHECK_OP (0, "invalid operand to binary operator");
2768 CHECK_OP (1, "invalid operand to binary operator");
2771 case POINTER_PLUS_EXPR:
2772 /* Check to make sure the first operand is a pointer or reference type. */
2773 if (!POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (t, 0))))
2775 error ("invalid operand to pointer plus, first operand is not a pointer");
2778 /* Check to make sure the second operand is an integer with type of
2780 if (!useless_type_conversion_p (sizetype,
2781 TREE_TYPE (TREE_OPERAND (t, 1))))
2783 error ("invalid operand to pointer plus, second operand is not an "
2784 "integer with type of sizetype.");
2794 case UNORDERED_EXPR:
2803 case TRUNC_DIV_EXPR:
2805 case FLOOR_DIV_EXPR:
2806 case ROUND_DIV_EXPR:
2807 case TRUNC_MOD_EXPR:
2809 case FLOOR_MOD_EXPR:
2810 case ROUND_MOD_EXPR:
2812 case EXACT_DIV_EXPR:
2822 CHECK_OP (0, "invalid operand to binary operator");
2823 CHECK_OP (1, "invalid operand to binary operator");
2827 if (TREE_CONSTANT (t) && TREE_CODE (TREE_TYPE (t)) == VECTOR_TYPE)
2840 /* Verify if EXPR is either a GIMPLE ID or a GIMPLE indirect reference.
2841 Returns true if there is an error, otherwise false. */
2844 verify_types_in_gimple_min_lval (tree expr)
2848 if (is_gimple_id (expr))
2851 if (TREE_CODE (expr) != TARGET_MEM_REF
2852 && TREE_CODE (expr) != MEM_REF)
2854 error ("invalid expression for min lvalue");
2858 /* TARGET_MEM_REFs are strange beasts. */
2859 if (TREE_CODE (expr) == TARGET_MEM_REF)
2862 op = TREE_OPERAND (expr, 0);
2863 if (!is_gimple_val (op))
2865 error ("invalid operand in indirect reference");
2866 debug_generic_stmt (op);
2869 /* Memory references now generally can involve a value conversion. */
2874 /* Verify if EXPR is a valid GIMPLE reference expression. If
2875 REQUIRE_LVALUE is true verifies it is an lvalue. Returns true
2876 if there is an error, otherwise false. */
2879 verify_types_in_gimple_reference (tree expr, bool require_lvalue)
2881 while (handled_component_p (expr))
2883 tree op = TREE_OPERAND (expr, 0);
2885 if (TREE_CODE (expr) == ARRAY_REF
2886 || TREE_CODE (expr) == ARRAY_RANGE_REF)
2888 if (!is_gimple_val (TREE_OPERAND (expr, 1))
2889 || (TREE_OPERAND (expr, 2)
2890 && !is_gimple_val (TREE_OPERAND (expr, 2)))
2891 || (TREE_OPERAND (expr, 3)
2892 && !is_gimple_val (TREE_OPERAND (expr, 3))))
2894 error ("invalid operands to array reference");
2895 debug_generic_stmt (expr);
2900 /* Verify if the reference array element types are compatible. */
2901 if (TREE_CODE (expr) == ARRAY_REF
2902 && !useless_type_conversion_p (TREE_TYPE (expr),
2903 TREE_TYPE (TREE_TYPE (op))))
2905 error ("type mismatch in array reference");
2906 debug_generic_stmt (TREE_TYPE (expr));
2907 debug_generic_stmt (TREE_TYPE (TREE_TYPE (op)));
2910 if (TREE_CODE (expr) == ARRAY_RANGE_REF
2911 && !useless_type_conversion_p (TREE_TYPE (TREE_TYPE (expr)),
2912 TREE_TYPE (TREE_TYPE (op))))
2914 error ("type mismatch in array range reference");
2915 debug_generic_stmt (TREE_TYPE (TREE_TYPE (expr)));
2916 debug_generic_stmt (TREE_TYPE (TREE_TYPE (op)));
2920 if ((TREE_CODE (expr) == REALPART_EXPR
2921 || TREE_CODE (expr) == IMAGPART_EXPR)
2922 && !useless_type_conversion_p (TREE_TYPE (expr),
2923 TREE_TYPE (TREE_TYPE (op))))
2925 error ("type mismatch in real/imagpart reference");
2926 debug_generic_stmt (TREE_TYPE (expr));
2927 debug_generic_stmt (TREE_TYPE (TREE_TYPE (op)));
2931 if (TREE_CODE (expr) == COMPONENT_REF
2932 && !useless_type_conversion_p (TREE_TYPE (expr),
2933 TREE_TYPE (TREE_OPERAND (expr, 1))))
2935 error ("type mismatch in component reference");
2936 debug_generic_stmt (TREE_TYPE (expr));
2937 debug_generic_stmt (TREE_TYPE (TREE_OPERAND (expr, 1)));
2941 if (TREE_CODE (expr) == VIEW_CONVERT_EXPR)
2943 /* For VIEW_CONVERT_EXPRs which are allowed here too, we only check
2944 that their operand is not an SSA name or an invariant when
2945 requiring an lvalue (this usually means there is a SRA or IPA-SRA
2946 bug). Otherwise there is nothing to verify, gross mismatches at
2947 most invoke undefined behavior. */
2949 && (TREE_CODE (op) == SSA_NAME
2950 || is_gimple_min_invariant (op)))
2952 error ("Conversion of an SSA_NAME on the left hand side.");
2953 debug_generic_stmt (expr);
2956 else if (TREE_CODE (op) == SSA_NAME
2957 && TYPE_SIZE (TREE_TYPE (expr)) != TYPE_SIZE (TREE_TYPE (op)))
2959 error ("Conversion of register to a different size.");
2960 debug_generic_stmt (expr);
2963 else if (!handled_component_p (op))
2970 if (TREE_CODE (expr) == MEM_REF)
2972 if (!is_gimple_mem_ref_addr (TREE_OPERAND (expr, 0)))
2974 error ("Invalid address operand in MEM_REF.");
2975 debug_generic_stmt (expr);
2978 if (TREE_CODE (TREE_OPERAND (expr, 1)) != INTEGER_CST
2979 || !POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (expr, 1))))
2981 error ("Invalid offset operand in MEM_REF.");
2982 debug_generic_stmt (expr);
2986 else if (TREE_CODE (expr) == TARGET_MEM_REF)
2988 if (!TMR_BASE (expr)
2989 || !is_gimple_mem_ref_addr (TMR_BASE (expr)))
2991 error ("Invalid address operand in in TARGET_MEM_REF.");
2994 if (!TMR_OFFSET (expr)
2995 || TREE_CODE (TMR_OFFSET (expr)) != INTEGER_CST
2996 || !POINTER_TYPE_P (TREE_TYPE (TMR_OFFSET (expr))))
2998 error ("Invalid offset operand in TARGET_MEM_REF.");
2999 debug_generic_stmt (expr);
3004 return ((require_lvalue || !is_gimple_min_invariant (expr))
3005 && verify_types_in_gimple_min_lval (expr));
3008 /* Returns true if there is one pointer type in TYPE_POINTER_TO (SRC_OBJ)
3009 list of pointer-to types that is trivially convertible to DEST. */
3012 one_pointer_to_useless_type_conversion_p (tree dest, tree src_obj)
3016 if (!TYPE_POINTER_TO (src_obj))
3019 for (src = TYPE_POINTER_TO (src_obj); src; src = TYPE_NEXT_PTR_TO (src))
3020 if (useless_type_conversion_p (dest, src))
3026 /* Return true if TYPE1 is a fixed-point type and if conversions to and
3027 from TYPE2 can be handled by FIXED_CONVERT_EXPR. */
3030 valid_fixed_convert_types_p (tree type1, tree type2)
3032 return (FIXED_POINT_TYPE_P (type1)
3033 && (INTEGRAL_TYPE_P (type2)
3034 || SCALAR_FLOAT_TYPE_P (type2)
3035 || FIXED_POINT_TYPE_P (type2)));
3038 /* Verify the contents of a GIMPLE_CALL STMT. Returns true when there
3039 is a problem, otherwise false. */
3042 verify_gimple_call (gimple stmt)
3044 tree fn = gimple_call_fn (stmt);
3048 if (TREE_CODE (fn) != OBJ_TYPE_REF
3049 && !is_gimple_val (fn))
3051 error ("invalid function in gimple call");
3052 debug_generic_stmt (fn);
3056 if (!POINTER_TYPE_P (TREE_TYPE (fn))
3057 || (TREE_CODE (TREE_TYPE (TREE_TYPE (fn))) != FUNCTION_TYPE
3058 && TREE_CODE (TREE_TYPE (TREE_TYPE (fn))) != METHOD_TYPE))
3060 error ("non-function in gimple call");
3064 if (gimple_call_lhs (stmt)
3065 && (!is_gimple_lvalue (gimple_call_lhs (stmt))
3066 || verify_types_in_gimple_reference (gimple_call_lhs (stmt), true)))
3068 error ("invalid LHS in gimple call");
3072 if (gimple_call_lhs (stmt) && gimple_call_noreturn_p (stmt))
3074 error ("LHS in noreturn call");
3078 fntype = TREE_TYPE (TREE_TYPE (fn));
3079 if (gimple_call_lhs (stmt)
3080 && !useless_type_conversion_p (TREE_TYPE (gimple_call_lhs (stmt)),
3082 /* ??? At least C++ misses conversions at assignments from
3083 void * call results.
3084 ??? Java is completely off. Especially with functions
3085 returning java.lang.Object.
3086 For now simply allow arbitrary pointer type conversions. */
3087 && !(POINTER_TYPE_P (TREE_TYPE (gimple_call_lhs (stmt)))
3088 && POINTER_TYPE_P (TREE_TYPE (fntype))))
3090 error ("invalid conversion in gimple call");
3091 debug_generic_stmt (TREE_TYPE (gimple_call_lhs (stmt)));
3092 debug_generic_stmt (TREE_TYPE (fntype));
3096 if (gimple_call_chain (stmt)
3097 && !is_gimple_val (gimple_call_chain (stmt)))
3099 error ("invalid static chain in gimple call");
3100 debug_generic_stmt (gimple_call_chain (stmt));
3104 /* If there is a static chain argument, this should not be an indirect
3105 call, and the decl should have DECL_STATIC_CHAIN set. */
3106 if (gimple_call_chain (stmt))
3108 if (TREE_CODE (fn) != ADDR_EXPR
3109 || TREE_CODE (TREE_OPERAND (fn, 0)) != FUNCTION_DECL)
3111 error ("static chain in indirect gimple call");
3114 fn = TREE_OPERAND (fn, 0);
3116 if (!DECL_STATIC_CHAIN (fn))
3118 error ("static chain with function that doesn't use one");
3123 /* ??? The C frontend passes unpromoted arguments in case it
3124 didn't see a function declaration before the call. So for now
3125 leave the call arguments mostly unverified. Once we gimplify
3126 unit-at-a-time we have a chance to fix this. */
3128 for (i = 0; i < gimple_call_num_args (stmt); ++i)
3130 tree arg = gimple_call_arg (stmt, i);
3131 if ((is_gimple_reg_type (TREE_TYPE (arg))
3132 && !is_gimple_val (arg))
3133 || (!is_gimple_reg_type (TREE_TYPE (arg))
3134 && !is_gimple_lvalue (arg)))
3136 error ("invalid argument to gimple call");
3137 debug_generic_expr (arg);
3144 /* Verifies the gimple comparison with the result type TYPE and
3145 the operands OP0 and OP1. */
3148 verify_gimple_comparison (tree type, tree op0, tree op1)
3150 tree op0_type = TREE_TYPE (op0);
3151 tree op1_type = TREE_TYPE (op1);
3153 if (!is_gimple_val (op0) || !is_gimple_val (op1))
3155 error ("invalid operands in gimple comparison");
3159 /* For comparisons we do not have the operations type as the
3160 effective type the comparison is carried out in. Instead
3161 we require that either the first operand is trivially
3162 convertible into the second, or the other way around.
3163 The resulting type of a comparison may be any integral type.
3164 Because we special-case pointers to void we allow
3165 comparisons of pointers with the same mode as well. */
3166 if ((!useless_type_conversion_p (op0_type, op1_type)
3167 && !useless_type_conversion_p (op1_type, op0_type)
3168 && (!POINTER_TYPE_P (op0_type)
3169 || !POINTER_TYPE_P (op1_type)
3170 || TYPE_MODE (op0_type) != TYPE_MODE (op1_type)))
3171 || !INTEGRAL_TYPE_P (type))
3173 error ("type mismatch in comparison expression");
3174 debug_generic_expr (type);
3175 debug_generic_expr (op0_type);
3176 debug_generic_expr (op1_type);
3183 /* Verify a gimple assignment statement STMT with an unary rhs.
3184 Returns true if anything is wrong. */
3187 verify_gimple_assign_unary (gimple stmt)
3189 enum tree_code rhs_code = gimple_assign_rhs_code (stmt);
3190 tree lhs = gimple_assign_lhs (stmt);
3191 tree lhs_type = TREE_TYPE (lhs);
3192 tree rhs1 = gimple_assign_rhs1 (stmt);
3193 tree rhs1_type = TREE_TYPE (rhs1);
3195 if (!is_gimple_reg (lhs)
3197 && TREE_CODE (lhs_type) == COMPLEX_TYPE))
3199 error ("non-register as LHS of unary operation");
3203 if (!is_gimple_val (rhs1))
3205 error ("invalid operand in unary operation");
3209 /* First handle conversions. */
3214 /* Allow conversions between integral types and pointers only if
3215 there is no sign or zero extension involved.
3216 For targets were the precision of sizetype doesn't match that
3217 of pointers we need to allow arbitrary conversions from and
3219 if ((POINTER_TYPE_P (lhs_type)
3220 && INTEGRAL_TYPE_P (rhs1_type)
3221 && (TYPE_PRECISION (lhs_type) >= TYPE_PRECISION (rhs1_type)
3222 || rhs1_type == sizetype))
3223 || (POINTER_TYPE_P (rhs1_type)
3224 && INTEGRAL_TYPE_P (lhs_type)
3225 && (TYPE_PRECISION (rhs1_type) >= TYPE_PRECISION (lhs_type)
3226 || lhs_type == sizetype)))
3229 /* Allow conversion from integer to offset type and vice versa. */
3230 if ((TREE_CODE (lhs_type) == OFFSET_TYPE
3231 && TREE_CODE (rhs1_type) == INTEGER_TYPE)
3232 || (TREE_CODE (lhs_type) == INTEGER_TYPE
3233 && TREE_CODE (rhs1_type) == OFFSET_TYPE))
3236 /* Otherwise assert we are converting between types of the
3238 if (INTEGRAL_TYPE_P (lhs_type) != INTEGRAL_TYPE_P (rhs1_type))
3240 error ("invalid types in nop conversion");
3241 debug_generic_expr (lhs_type);
3242 debug_generic_expr (rhs1_type);
3249 case ADDR_SPACE_CONVERT_EXPR:
3251 if (!POINTER_TYPE_P (rhs1_type) || !POINTER_TYPE_P (lhs_type)
3252 || (TYPE_ADDR_SPACE (TREE_TYPE (rhs1_type))
3253 == TYPE_ADDR_SPACE (TREE_TYPE (lhs_type))))
3255 error ("invalid types in address space conversion");
3256 debug_generic_expr (lhs_type);
3257 debug_generic_expr (rhs1_type);
3264 case FIXED_CONVERT_EXPR:
3266 if (!valid_fixed_convert_types_p (lhs_type, rhs1_type)
3267 && !valid_fixed_convert_types_p (rhs1_type, lhs_type))
3269 error ("invalid types in fixed-point conversion");
3270 debug_generic_expr (lhs_type);
3271 debug_generic_expr (rhs1_type);
3280 if (!INTEGRAL_TYPE_P (rhs1_type) || !SCALAR_FLOAT_TYPE_P (lhs_type))
3282 error ("invalid types in conversion to floating point");
3283 debug_generic_expr (lhs_type);
3284 debug_generic_expr (rhs1_type);
3291 case FIX_TRUNC_EXPR:
3293 if (!INTEGRAL_TYPE_P (lhs_type) || !SCALAR_FLOAT_TYPE_P (rhs1_type))
3295 error ("invalid types in conversion to integer");
3296 debug_generic_expr (lhs_type);
3297 debug_generic_expr (rhs1_type);
3304 case VEC_UNPACK_HI_EXPR:
3305 case VEC_UNPACK_LO_EXPR:
3306 case REDUC_MAX_EXPR:
3307 case REDUC_MIN_EXPR:
3308 case REDUC_PLUS_EXPR:
3309 case VEC_UNPACK_FLOAT_HI_EXPR:
3310 case VEC_UNPACK_FLOAT_LO_EXPR:
3314 case TRUTH_NOT_EXPR:
3319 case NON_LVALUE_EXPR:
3327 /* For the remaining codes assert there is no conversion involved. */
3328 if (!useless_type_conversion_p (lhs_type, rhs1_type))
3330 error ("non-trivial conversion in unary operation");
3331 debug_generic_expr (lhs_type);
3332 debug_generic_expr (rhs1_type);
3339 /* Verify a gimple assignment statement STMT with a binary rhs.
3340 Returns true if anything is wrong. */
3343 verify_gimple_assign_binary (gimple stmt)
3345 enum tree_code rhs_code = gimple_assign_rhs_code (stmt);
3346 tree lhs = gimple_assign_lhs (stmt);
3347 tree lhs_type = TREE_TYPE (lhs);
3348 tree rhs1 = gimple_assign_rhs1 (stmt);
3349 tree rhs1_type = TREE_TYPE (rhs1);
3350 tree rhs2 = gimple_assign_rhs2 (stmt);
3351 tree rhs2_type = TREE_TYPE (rhs2);
3353 if (!is_gimple_reg (lhs)
3355 && TREE_CODE (lhs_type) == COMPLEX_TYPE))
3357 error ("non-register as LHS of binary operation");
3361 if (!is_gimple_val (rhs1)
3362 || !is_gimple_val (rhs2))
3364 error ("invalid operands in binary operation");
3368 /* First handle operations that involve different types. */
3373 if (TREE_CODE (lhs_type) != COMPLEX_TYPE
3374 || !(INTEGRAL_TYPE_P (rhs1_type)
3375 || SCALAR_FLOAT_TYPE_P (rhs1_type))
3376 || !(INTEGRAL_TYPE_P (rhs2_type)
3377 || SCALAR_FLOAT_TYPE_P (rhs2_type)))
3379 error ("type mismatch in complex expression");
3380 debug_generic_expr (lhs_type);
3381 debug_generic_expr (rhs1_type);
3382 debug_generic_expr (rhs2_type);
3394 /* Shifts and rotates are ok on integral types, fixed point
3395 types and integer vector types. */
3396 if ((!INTEGRAL_TYPE_P (rhs1_type)
3397 && !FIXED_POINT_TYPE_P (rhs1_type)
3398 && !(TREE_CODE (rhs1_type) == VECTOR_TYPE
3399 && INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type))))
3400 || (!INTEGRAL_TYPE_P (rhs2_type)
3401 /* Vector shifts of vectors are also ok. */
3402 && !(TREE_CODE (rhs1_type) == VECTOR_TYPE
3403 && INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type))
3404 && TREE_CODE (rhs2_type) == VECTOR_TYPE
3405 && INTEGRAL_TYPE_P (TREE_TYPE (rhs2_type))))
3406 || !useless_type_conversion_p (lhs_type, rhs1_type))
3408 error ("type mismatch in shift expression");
3409 debug_generic_expr (lhs_type);
3410 debug_generic_expr (rhs1_type);
3411 debug_generic_expr (rhs2_type);
3418 case VEC_LSHIFT_EXPR:
3419 case VEC_RSHIFT_EXPR:
3421 if (TREE_CODE (rhs1_type) != VECTOR_TYPE
3422 || !(INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type))
3423 || FIXED_POINT_TYPE_P (TREE_TYPE (rhs1_type))
3424 || SCALAR_FLOAT_TYPE_P (TREE_TYPE (rhs1_type)))
3425 || (!INTEGRAL_TYPE_P (rhs2_type)
3426 && (TREE_CODE (rhs2_type) != VECTOR_TYPE
3427 || !INTEGRAL_TYPE_P (TREE_TYPE (rhs2_type))))
3428 || !useless_type_conversion_p (lhs_type, rhs1_type))
3430 error ("type mismatch in vector shift expression");
3431 debug_generic_expr (lhs_type);
3432 debug_generic_expr (rhs1_type);
3433 debug_generic_expr (rhs2_type);
3436 /* For shifting a vector of floating point components we
3437 only allow shifting by a constant multiple of the element size. */
3438 if (SCALAR_FLOAT_TYPE_P (TREE_TYPE (rhs1_type))
3439 && (TREE_CODE (rhs2) != INTEGER_CST
3440 || !div_if_zero_remainder (EXACT_DIV_EXPR, rhs2,
3441 TYPE_SIZE (TREE_TYPE (rhs1_type)))))
3443 error ("non-element sized vector shift of floating point vector");
3453 /* We use regular PLUS_EXPR and MINUS_EXPR for vectors.
3454 ??? This just makes the checker happy and may not be what is
3456 if (TREE_CODE (lhs_type) == VECTOR_TYPE
3457 && POINTER_TYPE_P (TREE_TYPE (lhs_type)))
3459 if (TREE_CODE (rhs1_type) != VECTOR_TYPE
3460 || TREE_CODE (rhs2_type) != VECTOR_TYPE)
3462 error ("invalid non-vector operands to vector valued plus");
3465 lhs_type = TREE_TYPE (lhs_type);
3466 rhs1_type = TREE_TYPE (rhs1_type);
3467 rhs2_type = TREE_TYPE (rhs2_type);
3468 /* PLUS_EXPR is commutative, so we might end up canonicalizing
3469 the pointer to 2nd place. */
3470 if (POINTER_TYPE_P (rhs2_type))
3472 tree tem = rhs1_type;
3473 rhs1_type = rhs2_type;
3476 goto do_pointer_plus_expr_check;
3478 if (POINTER_TYPE_P (lhs_type)
3479 || POINTER_TYPE_P (rhs1_type)
3480 || POINTER_TYPE_P (rhs2_type))
3482 error ("invalid (pointer) operands to plus/minus");
3486 /* Continue with generic binary expression handling. */
3490 case POINTER_PLUS_EXPR:
3492 do_pointer_plus_expr_check:
3493 if (!POINTER_TYPE_P (rhs1_type)
3494 || !useless_type_conversion_p (lhs_type, rhs1_type)
3495 || !useless_type_conversion_p (sizetype, rhs2_type))
3497 error ("type mismatch in pointer plus expression");
3498 debug_generic_stmt (lhs_type);
3499 debug_generic_stmt (rhs1_type);
3500 debug_generic_stmt (rhs2_type);
3507 case TRUTH_ANDIF_EXPR:
3508 case TRUTH_ORIF_EXPR:
3511 case TRUTH_AND_EXPR:
3513 case TRUTH_XOR_EXPR:
3515 /* We allow any kind of integral typed argument and result. */
3516 if (!INTEGRAL_TYPE_P (rhs1_type)
3517 || !INTEGRAL_TYPE_P (rhs2_type)
3518 || !INTEGRAL_TYPE_P (lhs_type))
3520 error ("type mismatch in binary truth expression");
3521 debug_generic_expr (lhs_type);
3522 debug_generic_expr (rhs1_type);
3523 debug_generic_expr (rhs2_type);
3536 case UNORDERED_EXPR:
3544 /* Comparisons are also binary, but the result type is not
3545 connected to the operand types. */
3546 return verify_gimple_comparison (lhs_type, rhs1, rhs2);
3548 case WIDEN_MULT_EXPR:
3549 if (TREE_CODE (lhs_type) != INTEGER_TYPE)
3551 return ((2 * TYPE_PRECISION (rhs1_type) != TYPE_PRECISION (lhs_type))
3552 || (TYPE_PRECISION (rhs1_type) != TYPE_PRECISION (rhs2_type)));
3554 case WIDEN_SUM_EXPR:
3555 case VEC_WIDEN_MULT_HI_EXPR:
3556 case VEC_WIDEN_MULT_LO_EXPR:
3557 case VEC_PACK_TRUNC_EXPR:
3558 case VEC_PACK_SAT_EXPR:
3559 case VEC_PACK_FIX_TRUNC_EXPR:
3560 case VEC_EXTRACT_EVEN_EXPR:
3561 case VEC_EXTRACT_ODD_EXPR:
3562 case VEC_INTERLEAVE_HIGH_EXPR:
3563 case VEC_INTERLEAVE_LOW_EXPR:
3568 case TRUNC_DIV_EXPR:
3570 case FLOOR_DIV_EXPR:
3571 case ROUND_DIV_EXPR:
3572 case TRUNC_MOD_EXPR:
3574 case FLOOR_MOD_EXPR:
3575 case ROUND_MOD_EXPR:
3577 case EXACT_DIV_EXPR:
3583 /* Continue with generic binary expression handling. */
3590 if (!useless_type_conversion_p (lhs_type, rhs1_type)
3591 || !useless_type_conversion_p (lhs_type, rhs2_type))
3593 error ("type mismatch in binary expression");
3594 debug_generic_stmt (lhs_type);
3595 debug_generic_stmt (rhs1_type);
3596 debug_generic_stmt (rhs2_type);
3603 /* Verify a gimple assignment statement STMT with a ternary rhs.
3604 Returns true if anything is wrong. */
3607 verify_gimple_assign_ternary (gimple stmt)
3609 enum tree_code rhs_code = gimple_assign_rhs_code (stmt);
3610 tree lhs = gimple_assign_lhs (stmt);
3611 tree lhs_type = TREE_TYPE (lhs);
3612 tree rhs1 = gimple_assign_rhs1 (stmt);
3613 tree rhs1_type = TREE_TYPE (rhs1);
3614 tree rhs2 = gimple_assign_rhs2 (stmt);
3615 tree rhs2_type = TREE_TYPE (rhs2);
3616 tree rhs3 = gimple_assign_rhs3 (stmt);
3617 tree rhs3_type = TREE_TYPE (rhs3);
3619 if (!is_gimple_reg (lhs)
3621 && TREE_CODE (lhs_type) == COMPLEX_TYPE))
3623 error ("non-register as LHS of ternary operation");
3627 if (!is_gimple_val (rhs1)
3628 || !is_gimple_val (rhs2)
3629 || !is_gimple_val (rhs3))
3631 error ("invalid operands in ternary operation");
3635 /* First handle operations that involve different types. */
3638 case WIDEN_MULT_PLUS_EXPR:
3639 case WIDEN_MULT_MINUS_EXPR:
3640 if ((!INTEGRAL_TYPE_P (rhs1_type)
3641 && !FIXED_POINT_TYPE_P (rhs1_type))
3642 || !useless_type_conversion_p (rhs1_type, rhs2_type)
3643 || !useless_type_conversion_p (lhs_type, rhs3_type)
3644 || 2 * TYPE_PRECISION (rhs1_type) != TYPE_PRECISION (lhs_type)
3645 || TYPE_PRECISION (rhs1_type) != TYPE_PRECISION (rhs2_type))
3647 error ("type mismatch in widening multiply-accumulate expression");
3648 debug_generic_expr (lhs_type);
3649 debug_generic_expr (rhs1_type);
3650 debug_generic_expr (rhs2_type);
3651 debug_generic_expr (rhs3_type);
3662 /* Verify a gimple assignment statement STMT with a single rhs.
3663 Returns true if anything is wrong. */
3666 verify_gimple_assign_single (gimple stmt)
3668 enum tree_code rhs_code = gimple_assign_rhs_code (stmt);
3669 tree lhs = gimple_assign_lhs (stmt);
3670 tree lhs_type = TREE_TYPE (lhs);
3671 tree rhs1 = gimple_assign_rhs1 (stmt);
3672 tree rhs1_type = TREE_TYPE (rhs1);
3675 if (!useless_type_conversion_p (lhs_type, rhs1_type))
3677 error ("non-trivial conversion at assignment");
3678 debug_generic_expr (lhs_type);
3679 debug_generic_expr (rhs1_type);
3683 if (handled_component_p (lhs))
3684 res |= verify_types_in_gimple_reference (lhs, true);
3686 /* Special codes we cannot handle via their class. */
3691 tree op = TREE_OPERAND (rhs1, 0);
3692 if (!is_gimple_addressable (op))
3694 error ("invalid operand in unary expression");
3698 if (!types_compatible_p (TREE_TYPE (op), TREE_TYPE (TREE_TYPE (rhs1)))
3699 && !one_pointer_to_useless_type_conversion_p (TREE_TYPE (rhs1),
3702 error ("type mismatch in address expression");
3703 debug_generic_stmt (TREE_TYPE (rhs1));
3704 debug_generic_stmt (TREE_TYPE (op));
3708 return verify_types_in_gimple_reference (op, true);
3713 error ("INDIRECT_REF in gimple IL");
3719 case ARRAY_RANGE_REF:
3720 case VIEW_CONVERT_EXPR:
3723 case TARGET_MEM_REF:
3725 if (!is_gimple_reg (lhs)
3726 && is_gimple_reg_type (TREE_TYPE (lhs)))
3728 error ("invalid rhs for gimple memory store");
3729 debug_generic_stmt (lhs);
3730 debug_generic_stmt (rhs1);
3733 return res || verify_types_in_gimple_reference (rhs1, false);
3745 /* tcc_declaration */
3750 if (!is_gimple_reg (lhs)
3751 && !is_gimple_reg (rhs1)
3752 && is_gimple_reg_type (TREE_TYPE (lhs)))
3754 error ("invalid rhs for gimple memory store");
3755 debug_generic_stmt (lhs);
3756 debug_generic_stmt (rhs1);
3762 if (!is_gimple_reg (lhs)
3763 || (!is_gimple_reg (TREE_OPERAND (rhs1, 0))
3764 && !COMPARISON_CLASS_P (TREE_OPERAND (rhs1, 0)))
3765 || (!is_gimple_reg (TREE_OPERAND (rhs1, 1))
3766 && !is_gimple_min_invariant (TREE_OPERAND (rhs1, 1)))
3767 || (!is_gimple_reg (TREE_OPERAND (rhs1, 2))
3768 && !is_gimple_min_invariant (TREE_OPERAND (rhs1, 2))))
3770 error ("invalid COND_EXPR in gimple assignment");
3771 debug_generic_stmt (rhs1);
3779 case WITH_SIZE_EXPR:
3780 case POLYNOMIAL_CHREC:
3783 case REALIGN_LOAD_EXPR:
3793 /* Verify the contents of a GIMPLE_ASSIGN STMT. Returns true when there
3794 is a problem, otherwise false. */
3797 verify_gimple_assign (gimple stmt)
3799 switch (gimple_assign_rhs_class (stmt))
3801 case GIMPLE_SINGLE_RHS:
3802 return verify_gimple_assign_single (stmt);
3804 case GIMPLE_UNARY_RHS:
3805 return verify_gimple_assign_unary (stmt);
3807 case GIMPLE_BINARY_RHS:
3808 return verify_gimple_assign_binary (stmt);
3810 case GIMPLE_TERNARY_RHS:
3811 return verify_gimple_assign_ternary (stmt);
3818 /* Verify the contents of a GIMPLE_RETURN STMT. Returns true when there
3819 is a problem, otherwise false. */
3822 verify_gimple_return (gimple stmt)
3824 tree op = gimple_return_retval (stmt);
3825 tree restype = TREE_TYPE (TREE_TYPE (cfun->decl));
3827 /* We cannot test for present return values as we do not fix up missing
3828 return values from the original source. */
3832 if (!is_gimple_val (op)
3833 && TREE_CODE (op) != RESULT_DECL)
3835 error ("invalid operand in return statement");
3836 debug_generic_stmt (op);
3840 if ((TREE_CODE (op) == RESULT_DECL
3841 && DECL_BY_REFERENCE (op))
3842 || (TREE_CODE (op) == SSA_NAME
3843 && TREE_CODE (SSA_NAME_VAR (op)) == RESULT_DECL
3844 && DECL_BY_REFERENCE (SSA_NAME_VAR (op))))
3845 op = TREE_TYPE (op);
3847 if (!useless_type_conversion_p (restype, TREE_TYPE (op)))
3849 error ("invalid conversion in return statement");
3850 debug_generic_stmt (restype);
3851 debug_generic_stmt (TREE_TYPE (op));
3859 /* Verify the contents of a GIMPLE_GOTO STMT. Returns true when there
3860 is a problem, otherwise false. */
3863 verify_gimple_goto (gimple stmt)
3865 tree dest = gimple_goto_dest (stmt);
3867 /* ??? We have two canonical forms of direct goto destinations, a
3868 bare LABEL_DECL and an ADDR_EXPR of a LABEL_DECL. */
3869 if (TREE_CODE (dest) != LABEL_DECL
3870 && (!is_gimple_val (dest)
3871 || !POINTER_TYPE_P (TREE_TYPE (dest))))
3873 error ("goto destination is neither a label nor a pointer");
3880 /* Verify the contents of a GIMPLE_SWITCH STMT. Returns true when there
3881 is a problem, otherwise false. */
3884 verify_gimple_switch (gimple stmt)
3886 if (!is_gimple_val (gimple_switch_index (stmt)))
3888 error ("invalid operand to switch statement");
3889 debug_generic_stmt (gimple_switch_index (stmt));
3897 /* Verify the contents of a GIMPLE_PHI. Returns true if there is a problem,
3898 and false otherwise. */
3901 verify_gimple_phi (gimple stmt)
3903 tree type = TREE_TYPE (gimple_phi_result (stmt));
3906 if (TREE_CODE (gimple_phi_result (stmt)) != SSA_NAME)
3908 error ("Invalid PHI result");
3912 for (i = 0; i < gimple_phi_num_args (stmt); i++)
3914 tree arg = gimple_phi_arg_def (stmt, i);
3915 if ((is_gimple_reg (gimple_phi_result (stmt))
3916 && !is_gimple_val (arg))
3917 || (!is_gimple_reg (gimple_phi_result (stmt))
3918 && !is_gimple_addressable (arg)))
3920 error ("Invalid PHI argument");
3921 debug_generic_stmt (arg);
3924 if (!useless_type_conversion_p (type, TREE_TYPE (arg)))
3926 error ("Incompatible types in PHI argument %u", i);
3927 debug_generic_stmt (type);
3928 debug_generic_stmt (TREE_TYPE (arg));
3937 /* Verify a gimple debug statement STMT.
3938 Returns true if anything is wrong. */
3941 verify_gimple_debug (gimple stmt ATTRIBUTE_UNUSED)
3943 /* There isn't much that could be wrong in a gimple debug stmt. A
3944 gimple debug bind stmt, for example, maps a tree, that's usually
3945 a VAR_DECL or a PARM_DECL, but that could also be some scalarized
3946 component or member of an aggregate type, to another tree, that
3947 can be an arbitrary expression. These stmts expand into debug
3948 insns, and are converted to debug notes by var-tracking.c. */
3953 /* Verify the GIMPLE statement STMT. Returns true if there is an
3954 error, otherwise false. */
3957 verify_types_in_gimple_stmt (gimple stmt)
3959 switch (gimple_code (stmt))
3962 return verify_gimple_assign (stmt);
3965 return TREE_CODE (gimple_label_label (stmt)) != LABEL_DECL;
3968 return verify_gimple_call (stmt);
3971 if (TREE_CODE_CLASS (gimple_cond_code (stmt)) != tcc_comparison)
3973 error ("invalid comparison code in gimple cond");
3976 if (!(!gimple_cond_true_label (stmt)
3977 || TREE_CODE (gimple_cond_true_label (stmt)) == LABEL_DECL)
3978 || !(!gimple_cond_false_label (stmt)
3979 || TREE_CODE (gimple_cond_false_label (stmt)) == LABEL_DECL))
3981 error ("invalid labels in gimple cond");
3985 return verify_gimple_comparison (boolean_type_node,
3986 gimple_cond_lhs (stmt),
3987 gimple_cond_rhs (stmt));
3990 return verify_gimple_goto (stmt);
3993 return verify_gimple_switch (stmt);
3996 return verify_gimple_return (stmt);
4002 return verify_gimple_phi (stmt);
4004 /* Tuples that do not have tree operands. */
4006 case GIMPLE_PREDICT:
4008 case GIMPLE_EH_DISPATCH:
4009 case GIMPLE_EH_MUST_NOT_THROW:
4013 /* OpenMP directives are validated by the FE and never operated
4014 on by the optimizers. Furthermore, GIMPLE_OMP_FOR may contain
4015 non-gimple expressions when the main index variable has had
4016 its address taken. This does not affect the loop itself
4017 because the header of an GIMPLE_OMP_FOR is merely used to determine
4018 how to setup the parallel iteration. */
4022 return verify_gimple_debug (stmt);
4029 /* Verify the GIMPLE statements inside the sequence STMTS. */
4032 verify_types_in_gimple_seq_2 (gimple_seq stmts)
4034 gimple_stmt_iterator ittr;
4037 for (ittr = gsi_start (stmts); !gsi_end_p (ittr); gsi_next (&ittr))
4039 gimple stmt = gsi_stmt (ittr);
4041 switch (gimple_code (stmt))
4044 err |= verify_types_in_gimple_seq_2 (gimple_bind_body (stmt));
4048 err |= verify_types_in_gimple_seq_2 (gimple_try_eval (stmt));
4049 err |= verify_types_in_gimple_seq_2 (gimple_try_cleanup (stmt));
4052 case GIMPLE_EH_FILTER:
4053 err |= verify_types_in_gimple_seq_2 (gimple_eh_filter_failure (stmt));
4057 err |= verify_types_in_gimple_seq_2 (gimple_catch_handler (stmt));
4062 bool err2 = verify_types_in_gimple_stmt (stmt);
4064 debug_gimple_stmt (stmt);
4074 /* Verify the GIMPLE statements inside the statement list STMTS. */
4077 verify_types_in_gimple_seq (gimple_seq stmts)
4079 if (verify_types_in_gimple_seq_2 (stmts))
4080 internal_error ("verify_gimple failed");
4084 /* Verify STMT, return true if STMT is not in GIMPLE form.
4085 TODO: Implement type checking. */
4088 verify_stmt (gimple_stmt_iterator *gsi)
4091 struct walk_stmt_info wi;
4092 bool last_in_block = gsi_one_before_end_p (*gsi);
4093 gimple stmt = gsi_stmt (*gsi);
4096 if (is_gimple_omp (stmt))
4098 /* OpenMP directives are validated by the FE and never operated
4099 on by the optimizers. Furthermore, GIMPLE_OMP_FOR may contain
4100 non-gimple expressions when the main index variable has had
4101 its address taken. This does not affect the loop itself
4102 because the header of an GIMPLE_OMP_FOR is merely used to determine
4103 how to setup the parallel iteration. */
4107 /* FIXME. The C frontend passes unpromoted arguments in case it
4108 didn't see a function declaration before the call. */
4109 if (is_gimple_call (stmt))
4113 if (!is_gimple_call_addr (gimple_call_fn (stmt)))
4115 error ("invalid function in call statement");
4119 decl = gimple_call_fndecl (stmt);
4121 && TREE_CODE (decl) == FUNCTION_DECL
4122 && DECL_LOOPING_CONST_OR_PURE_P (decl)
4123 && (!DECL_PURE_P (decl))
4124 && (!TREE_READONLY (decl)))
4126 error ("invalid pure const state for function");
4131 if (is_gimple_debug (stmt))
4134 memset (&wi, 0, sizeof (wi));
4135 addr = walk_gimple_op (gsi_stmt (*gsi), verify_expr, &wi);
4138 debug_generic_expr (addr);
4139 inform (gimple_location (gsi_stmt (*gsi)), "in statement");
4140 debug_gimple_stmt (stmt);
4144 /* If the statement is marked as part of an EH region, then it is
4145 expected that the statement could throw. Verify that when we
4146 have optimizations that simplify statements such that we prove
4147 that they cannot throw, that we update other data structures
4149 lp_nr = lookup_stmt_eh_lp (stmt);
4152 if (!stmt_could_throw_p (stmt))
4154 error ("statement marked for throw, but doesn%'t");
4157 else if (lp_nr > 0 && !last_in_block && stmt_can_throw_internal (stmt))
4159 error ("statement marked for throw in middle of block");
4167 debug_gimple_stmt (stmt);
4172 /* Return true when the T can be shared. */
4175 tree_node_can_be_shared (tree t)
4177 if (IS_TYPE_OR_DECL_P (t)
4178 || is_gimple_min_invariant (t)
4179 || TREE_CODE (t) == SSA_NAME
4180 || t == error_mark_node
4181 || TREE_CODE (t) == IDENTIFIER_NODE)
4184 if (TREE_CODE (t) == CASE_LABEL_EXPR)
4187 while (((TREE_CODE (t) == ARRAY_REF || TREE_CODE (t) == ARRAY_RANGE_REF)
4188 && is_gimple_min_invariant (TREE_OPERAND (t, 1)))
4189 || TREE_CODE (t) == COMPONENT_REF
4190 || TREE_CODE (t) == REALPART_EXPR
4191 || TREE_CODE (t) == IMAGPART_EXPR)
4192 t = TREE_OPERAND (t, 0);
4201 /* Called via walk_gimple_stmt. Verify tree sharing. */
4204 verify_node_sharing (tree *tp, int *walk_subtrees, void *data)
4206 struct walk_stmt_info *wi = (struct walk_stmt_info *) data;
4207 struct pointer_set_t *visited = (struct pointer_set_t *) wi->info;
4209 if (tree_node_can_be_shared (*tp))
4211 *walk_subtrees = false;
4215 if (pointer_set_insert (visited, *tp))
4222 static bool eh_error_found;
4224 verify_eh_throw_stmt_node (void **slot, void *data)
4226 struct throw_stmt_node *node = (struct throw_stmt_node *)*slot;
4227 struct pointer_set_t *visited = (struct pointer_set_t *) data;
4229 if (!pointer_set_contains (visited, node->stmt))
4231 error ("Dead STMT in EH table");
4232 debug_gimple_stmt (node->stmt);
4233 eh_error_found = true;
4239 /* Verify the GIMPLE statements in every basic block. */
4245 gimple_stmt_iterator gsi;
4247 struct pointer_set_t *visited, *visited_stmts;
4249 struct walk_stmt_info wi;
4251 timevar_push (TV_TREE_STMT_VERIFY);
4252 visited = pointer_set_create ();
4253 visited_stmts = pointer_set_create ();
4255 memset (&wi, 0, sizeof (wi));
4256 wi.info = (void *) visited;
4263 for (gsi = gsi_start_phis (bb); !gsi_end_p (gsi); gsi_next (&gsi))
4265 phi = gsi_stmt (gsi);
4266 pointer_set_insert (visited_stmts, phi);
4267 if (gimple_bb (phi) != bb)
4269 error ("gimple_bb (phi) is set to a wrong basic block");
4273 for (i = 0; i < gimple_phi_num_args (phi); i++)
4275 tree t = gimple_phi_arg_def (phi, i);
4280 error ("missing PHI def");
4281 debug_gimple_stmt (phi);
4285 /* Addressable variables do have SSA_NAMEs but they
4286 are not considered gimple values. */
4287 else if (TREE_CODE (t) != SSA_NAME
4288 && TREE_CODE (t) != FUNCTION_DECL
4289 && !is_gimple_min_invariant (t))
4291 error ("PHI argument is not a GIMPLE value");
4292 debug_gimple_stmt (phi);
4293 debug_generic_expr (t);
4297 addr = walk_tree (&t, verify_node_sharing, visited, NULL);
4300 error ("incorrect sharing of tree nodes");
4301 debug_gimple_stmt (phi);
4302 debug_generic_expr (addr);
4307 #ifdef ENABLE_TYPES_CHECKING
4308 if (verify_gimple_phi (phi))
4310 debug_gimple_stmt (phi);
4316 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); )
4318 gimple stmt = gsi_stmt (gsi);
4320 if (gimple_code (stmt) == GIMPLE_WITH_CLEANUP_EXPR
4321 || gimple_code (stmt) == GIMPLE_BIND)
4323 error ("invalid GIMPLE statement");
4324 debug_gimple_stmt (stmt);
4328 pointer_set_insert (visited_stmts, stmt);
4330 if (gimple_bb (stmt) != bb)
4332 error ("gimple_bb (stmt) is set to a wrong basic block");
4333 debug_gimple_stmt (stmt);
4337 if (gimple_code (stmt) == GIMPLE_LABEL)
4339 tree decl = gimple_label_label (stmt);
4340 int uid = LABEL_DECL_UID (decl);
4343 || VEC_index (basic_block, label_to_block_map, uid) != bb)
4345 error ("incorrect entry in label_to_block_map");
4349 uid = EH_LANDING_PAD_NR (decl);
4352 eh_landing_pad lp = get_eh_landing_pad_from_number (uid);
4353 if (decl != lp->post_landing_pad)
4355 error ("incorrect setting of landing pad number");
4361 err |= verify_stmt (&gsi);
4363 #ifdef ENABLE_TYPES_CHECKING
4364 if (verify_types_in_gimple_stmt (gsi_stmt (gsi)))
4366 debug_gimple_stmt (stmt);
4370 addr = walk_gimple_op (gsi_stmt (gsi), verify_node_sharing, &wi);
4373 error ("incorrect sharing of tree nodes");
4374 debug_gimple_stmt (stmt);
4375 debug_generic_expr (addr);
4382 eh_error_found = false;
4383 if (get_eh_throw_stmt_table (cfun))
4384 htab_traverse (get_eh_throw_stmt_table (cfun),
4385 verify_eh_throw_stmt_node,
4388 if (err | eh_error_found)
4389 internal_error ("verify_stmts failed");
4391 pointer_set_destroy (visited);
4392 pointer_set_destroy (visited_stmts);
4393 verify_histograms ();
4394 timevar_pop (TV_TREE_STMT_VERIFY);
4398 /* Verifies that the flow information is OK. */
4401 gimple_verify_flow_info (void)
4405 gimple_stmt_iterator gsi;
4410 if (ENTRY_BLOCK_PTR->il.gimple)
4412 error ("ENTRY_BLOCK has IL associated with it");
4416 if (EXIT_BLOCK_PTR->il.gimple)
4418 error ("EXIT_BLOCK has IL associated with it");
4422 FOR_EACH_EDGE (e, ei, EXIT_BLOCK_PTR->preds)
4423 if (e->flags & EDGE_FALLTHRU)
4425 error ("fallthru to exit from bb %d", e->src->index);
4431 bool found_ctrl_stmt = false;
4435 /* Skip labels on the start of basic block. */
4436 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
4439 gimple prev_stmt = stmt;
4441 stmt = gsi_stmt (gsi);
4443 if (gimple_code (stmt) != GIMPLE_LABEL)
4446 label = gimple_label_label (stmt);
4447 if (prev_stmt && DECL_NONLOCAL (label))
4449 error ("nonlocal label ");
4450 print_generic_expr (stderr, label, 0);
4451 fprintf (stderr, " is not first in a sequence of labels in bb %d",
4456 if (prev_stmt && EH_LANDING_PAD_NR (label) != 0)
4458 error ("EH landing pad label ");
4459 print_generic_expr (stderr, label, 0);
4460 fprintf (stderr, " is not first in a sequence of labels in bb %d",
4465 if (label_to_block (label) != bb)
4468 print_generic_expr (stderr, label, 0);
4469 fprintf (stderr, " to block does not match in bb %d",
4474 if (decl_function_context (label) != current_function_decl)
4477 print_generic_expr (stderr, label, 0);
4478 fprintf (stderr, " has incorrect context in bb %d",
4484 /* Verify that body of basic block BB is free of control flow. */
4485 for (; !gsi_end_p (gsi); gsi_next (&gsi))
4487 gimple stmt = gsi_stmt (gsi);
4489 if (found_ctrl_stmt)
4491 error ("control flow in the middle of basic block %d",
4496 if (stmt_ends_bb_p (stmt))
4497 found_ctrl_stmt = true;
4499 if (gimple_code (stmt) == GIMPLE_LABEL)
4502 print_generic_expr (stderr, gimple_label_label (stmt), 0);
4503 fprintf (stderr, " in the middle of basic block %d", bb->index);
4508 gsi = gsi_last_bb (bb);
4509 if (gsi_end_p (gsi))
4512 stmt = gsi_stmt (gsi);
4514 if (gimple_code (stmt) == GIMPLE_LABEL)
4517 err |= verify_eh_edges (stmt);
4519 if (is_ctrl_stmt (stmt))
4521 FOR_EACH_EDGE (e, ei, bb->succs)
4522 if (e->flags & EDGE_FALLTHRU)
4524 error ("fallthru edge after a control statement in bb %d",
4530 if (gimple_code (stmt) != GIMPLE_COND)
4532 /* Verify that there are no edges with EDGE_TRUE/FALSE_FLAG set
4533 after anything else but if statement. */
4534 FOR_EACH_EDGE (e, ei, bb->succs)
4535 if (e->flags & (EDGE_TRUE_VALUE | EDGE_FALSE_VALUE))
4537 error ("true/false edge after a non-GIMPLE_COND in bb %d",
4543 switch (gimple_code (stmt))
4550 extract_true_false_edges_from_block (bb, &true_edge, &false_edge);
4554 || !(true_edge->flags & EDGE_TRUE_VALUE)
4555 || !(false_edge->flags & EDGE_FALSE_VALUE)
4556 || (true_edge->flags & (EDGE_FALLTHRU | EDGE_ABNORMAL))
4557 || (false_edge->flags & (EDGE_FALLTHRU | EDGE_ABNORMAL))
4558 || EDGE_COUNT (bb->succs) >= 3)
4560 error ("wrong outgoing edge flags at end of bb %d",
4568 if (simple_goto_p (stmt))
4570 error ("explicit goto at end of bb %d", bb->index);
4575 /* FIXME. We should double check that the labels in the
4576 destination blocks have their address taken. */
4577 FOR_EACH_EDGE (e, ei, bb->succs)
4578 if ((e->flags & (EDGE_FALLTHRU | EDGE_TRUE_VALUE
4579 | EDGE_FALSE_VALUE))
4580 || !(e->flags & EDGE_ABNORMAL))
4582 error ("wrong outgoing edge flags at end of bb %d",
4590 if (!gimple_call_builtin_p (stmt, BUILT_IN_RETURN))
4592 /* ... fallthru ... */
4594 if (!single_succ_p (bb)
4595 || (single_succ_edge (bb)->flags
4596 & (EDGE_FALLTHRU | EDGE_ABNORMAL
4597 | EDGE_TRUE_VALUE | EDGE_FALSE_VALUE)))
4599 error ("wrong outgoing edge flags at end of bb %d", bb->index);
4602 if (single_succ (bb) != EXIT_BLOCK_PTR)
4604 error ("return edge does not point to exit in bb %d",
4616 n = gimple_switch_num_labels (stmt);
4618 /* Mark all the destination basic blocks. */
4619 for (i = 0; i < n; ++i)
4621 tree lab = CASE_LABEL (gimple_switch_label (stmt, i));
4622 basic_block label_bb = label_to_block (lab);
4623 gcc_assert (!label_bb->aux || label_bb->aux == (void *)1);
4624 label_bb->aux = (void *)1;
4627 /* Verify that the case labels are sorted. */
4628 prev = gimple_switch_label (stmt, 0);
4629 for (i = 1; i < n; ++i)
4631 tree c = gimple_switch_label (stmt, i);
4634 error ("found default case not at the start of "
4640 && !tree_int_cst_lt (CASE_LOW (prev), CASE_LOW (c)))
4642 error ("case labels not sorted: ");
4643 print_generic_expr (stderr, prev, 0);
4644 fprintf (stderr," is greater than ");
4645 print_generic_expr (stderr, c, 0);
4646 fprintf (stderr," but comes before it.\n");
4651 /* VRP will remove the default case if it can prove it will
4652 never be executed. So do not verify there always exists
4653 a default case here. */
4655 FOR_EACH_EDGE (e, ei, bb->succs)
4659 error ("extra outgoing edge %d->%d",
4660 bb->index, e->dest->index);
4664 e->dest->aux = (void *)2;
4665 if ((e->flags & (EDGE_FALLTHRU | EDGE_ABNORMAL
4666 | EDGE_TRUE_VALUE | EDGE_FALSE_VALUE)))
4668 error ("wrong outgoing edge flags at end of bb %d",
4674 /* Check that we have all of them. */
4675 for (i = 0; i < n; ++i)
4677 tree lab = CASE_LABEL (gimple_switch_label (stmt, i));
4678 basic_block label_bb = label_to_block (lab);
4680 if (label_bb->aux != (void *)2)
4682 error ("missing edge %i->%i", bb->index, label_bb->index);
4687 FOR_EACH_EDGE (e, ei, bb->succs)
4688 e->dest->aux = (void *)0;
4692 case GIMPLE_EH_DISPATCH:
4693 err |= verify_eh_dispatch_edge (stmt);
4701 if (dom_info_state (CDI_DOMINATORS) >= DOM_NO_FAST_QUERY)
4702 verify_dominators (CDI_DOMINATORS);
4708 /* Updates phi nodes after creating a forwarder block joined
4709 by edge FALLTHRU. */
4712 gimple_make_forwarder_block (edge fallthru)
4716 basic_block dummy, bb;
4718 gimple_stmt_iterator gsi;
4720 dummy = fallthru->src;
4721 bb = fallthru->dest;
4723 if (single_pred_p (bb))
4726 /* If we redirected a branch we must create new PHI nodes at the
4728 for (gsi = gsi_start_phis (dummy); !gsi_end_p (gsi); gsi_next (&gsi))
4730 gimple phi, new_phi;
4732 phi = gsi_stmt (gsi);
4733 var = gimple_phi_result (phi);
4734 new_phi = create_phi_node (var, bb);
4735 SSA_NAME_DEF_STMT (var) = new_phi;
4736 gimple_phi_set_result (phi, make_ssa_name (SSA_NAME_VAR (var), phi));
4737 add_phi_arg (new_phi, gimple_phi_result (phi), fallthru,
4741 /* Add the arguments we have stored on edges. */
4742 FOR_EACH_EDGE (e, ei, bb->preds)
4747 flush_pending_stmts (e);
4752 /* Return a non-special label in the head of basic block BLOCK.
4753 Create one if it doesn't exist. */
4756 gimple_block_label (basic_block bb)
4758 gimple_stmt_iterator i, s = gsi_start_bb (bb);
4763 for (i = s; !gsi_end_p (i); first = false, gsi_next (&i))
4765 stmt = gsi_stmt (i);
4766 if (gimple_code (stmt) != GIMPLE_LABEL)
4768 label = gimple_label_label (stmt);
4769 if (!DECL_NONLOCAL (label))
4772 gsi_move_before (&i, &s);
4777 label = create_artificial_label (UNKNOWN_LOCATION);
4778 stmt = gimple_build_label (label);
4779 gsi_insert_before (&s, stmt, GSI_NEW_STMT);
4784 /* Attempt to perform edge redirection by replacing a possibly complex
4785 jump instruction by a goto or by removing the jump completely.
4786 This can apply only if all edges now point to the same block. The
4787 parameters and return values are equivalent to
4788 redirect_edge_and_branch. */
4791 gimple_try_redirect_by_replacing_jump (edge e, basic_block target)
4793 basic_block src = e->src;
4794 gimple_stmt_iterator i;
4797 /* We can replace or remove a complex jump only when we have exactly
4799 if (EDGE_COUNT (src->succs) != 2
4800 /* Verify that all targets will be TARGET. Specifically, the
4801 edge that is not E must also go to TARGET. */
4802 || EDGE_SUCC (src, EDGE_SUCC (src, 0) == e)->dest != target)
4805 i = gsi_last_bb (src);
4809 stmt = gsi_stmt (i);
4811 if (gimple_code (stmt) == GIMPLE_COND || gimple_code (stmt) == GIMPLE_SWITCH)
4813 gsi_remove (&i, true);
4814 e = ssa_redirect_edge (e, target);
4815 e->flags = EDGE_FALLTHRU;
4823 /* Redirect E to DEST. Return NULL on failure. Otherwise, return the
4824 edge representing the redirected branch. */
4827 gimple_redirect_edge_and_branch (edge e, basic_block dest)
4829 basic_block bb = e->src;
4830 gimple_stmt_iterator gsi;
4834 if (e->flags & EDGE_ABNORMAL)
4837 if (e->dest == dest)
4840 if (e->flags & EDGE_EH)
4841 return redirect_eh_edge (e, dest);
4843 if (e->src != ENTRY_BLOCK_PTR)
4845 ret = gimple_try_redirect_by_replacing_jump (e, dest);
4850 gsi = gsi_last_bb (bb);
4851 stmt = gsi_end_p (gsi) ? NULL : gsi_stmt (gsi);
4853 switch (stmt ? gimple_code (stmt) : GIMPLE_ERROR_MARK)
4856 /* For COND_EXPR, we only need to redirect the edge. */
4860 /* No non-abnormal edges should lead from a non-simple goto, and
4861 simple ones should be represented implicitly. */
4866 tree label = gimple_block_label (dest);
4867 tree cases = get_cases_for_edge (e, stmt);
4869 /* If we have a list of cases associated with E, then use it
4870 as it's a lot faster than walking the entire case vector. */
4873 edge e2 = find_edge (e->src, dest);
4880 CASE_LABEL (cases) = label;
4881 cases = TREE_CHAIN (cases);
4884 /* If there was already an edge in the CFG, then we need
4885 to move all the cases associated with E to E2. */
4888 tree cases2 = get_cases_for_edge (e2, stmt);
4890 TREE_CHAIN (last) = TREE_CHAIN (cases2);
4891 TREE_CHAIN (cases2) = first;
4893 bitmap_set_bit (touched_switch_bbs, gimple_bb (stmt)->index);
4897 size_t i, n = gimple_switch_num_labels (stmt);
4899 for (i = 0; i < n; i++)
4901 tree elt = gimple_switch_label (stmt, i);
4902 if (label_to_block (CASE_LABEL (elt)) == e->dest)
4903 CASE_LABEL (elt) = label;
4911 int i, n = gimple_asm_nlabels (stmt);
4914 for (i = 0; i < n; ++i)
4916 tree cons = gimple_asm_label_op (stmt, i);
4917 if (label_to_block (TREE_VALUE (cons)) == e->dest)
4920 label = gimple_block_label (dest);
4921 TREE_VALUE (cons) = label;
4925 /* If we didn't find any label matching the former edge in the
4926 asm labels, we must be redirecting the fallthrough
4928 gcc_assert (label || (e->flags & EDGE_FALLTHRU));
4933 gsi_remove (&gsi, true);
4934 e->flags |= EDGE_FALLTHRU;
4937 case GIMPLE_OMP_RETURN:
4938 case GIMPLE_OMP_CONTINUE:
4939 case GIMPLE_OMP_SECTIONS_SWITCH:
4940 case GIMPLE_OMP_FOR:
4941 /* The edges from OMP constructs can be simply redirected. */
4944 case GIMPLE_EH_DISPATCH:
4945 if (!(e->flags & EDGE_FALLTHRU))
4946 redirect_eh_dispatch_edge (stmt, e, dest);
4950 /* Otherwise it must be a fallthru edge, and we don't need to
4951 do anything besides redirecting it. */
4952 gcc_assert (e->flags & EDGE_FALLTHRU);
4956 /* Update/insert PHI nodes as necessary. */
4958 /* Now update the edges in the CFG. */
4959 e = ssa_redirect_edge (e, dest);
4964 /* Returns true if it is possible to remove edge E by redirecting
4965 it to the destination of the other edge from E->src. */
4968 gimple_can_remove_branch_p (const_edge e)
4970 if (e->flags & (EDGE_ABNORMAL | EDGE_EH))
4976 /* Simple wrapper, as we can always redirect fallthru edges. */
4979 gimple_redirect_edge_and_branch_force (edge e, basic_block dest)
4981 e = gimple_redirect_edge_and_branch (e, dest);
4988 /* Splits basic block BB after statement STMT (but at least after the
4989 labels). If STMT is NULL, BB is split just after the labels. */
4992 gimple_split_block (basic_block bb, void *stmt)
4994 gimple_stmt_iterator gsi;
4995 gimple_stmt_iterator gsi_tgt;
5002 new_bb = create_empty_bb (bb);
5004 /* Redirect the outgoing edges. */
5005 new_bb->succs = bb->succs;
5007 FOR_EACH_EDGE (e, ei, new_bb->succs)
5010 if (stmt && gimple_code ((gimple) stmt) == GIMPLE_LABEL)
5013 /* Move everything from GSI to the new basic block. */
5014 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
5016 act = gsi_stmt (gsi);
5017 if (gimple_code (act) == GIMPLE_LABEL)
5030 if (gsi_end_p (gsi))
5033 /* Split the statement list - avoid re-creating new containers as this
5034 brings ugly quadratic memory consumption in the inliner.
5035 (We are still quadratic since we need to update stmt BB pointers,
5037 list = gsi_split_seq_before (&gsi);
5038 set_bb_seq (new_bb, list);
5039 for (gsi_tgt = gsi_start (list);
5040 !gsi_end_p (gsi_tgt); gsi_next (&gsi_tgt))
5041 gimple_set_bb (gsi_stmt (gsi_tgt), new_bb);
5047 /* Moves basic block BB after block AFTER. */
5050 gimple_move_block_after (basic_block bb, basic_block after)
5052 if (bb->prev_bb == after)
5056 link_block (bb, after);
5062 /* Return true if basic_block can be duplicated. */
5065 gimple_can_duplicate_bb_p (const_basic_block bb ATTRIBUTE_UNUSED)
5070 /* Create a duplicate of the basic block BB. NOTE: This does not
5071 preserve SSA form. */
5074 gimple_duplicate_bb (basic_block bb)
5077 gimple_stmt_iterator gsi, gsi_tgt;
5078 gimple_seq phis = phi_nodes (bb);
5079 gimple phi, stmt, copy;
5081 new_bb = create_empty_bb (EXIT_BLOCK_PTR->prev_bb);
5083 /* Copy the PHI nodes. We ignore PHI node arguments here because
5084 the incoming edges have not been setup yet. */
5085 for (gsi = gsi_start (phis); !gsi_end_p (gsi); gsi_next (&gsi))
5087 phi = gsi_stmt (gsi);
5088 copy = create_phi_node (gimple_phi_result (phi), new_bb);
5089 create_new_def_for (gimple_phi_result (copy), copy,
5090 gimple_phi_result_ptr (copy));
5093 gsi_tgt = gsi_start_bb (new_bb);
5094 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
5096 def_operand_p def_p;
5097 ssa_op_iter op_iter;
5099 stmt = gsi_stmt (gsi);
5100 if (gimple_code (stmt) == GIMPLE_LABEL)
5103 /* Create a new copy of STMT and duplicate STMT's virtual
5105 copy = gimple_copy (stmt);
5106 gsi_insert_after (&gsi_tgt, copy, GSI_NEW_STMT);
5108 maybe_duplicate_eh_stmt (copy, stmt);
5109 gimple_duplicate_stmt_histograms (cfun, copy, cfun, stmt);
5111 /* Create new names for all the definitions created by COPY and
5112 add replacement mappings for each new name. */
5113 FOR_EACH_SSA_DEF_OPERAND (def_p, copy, op_iter, SSA_OP_ALL_DEFS)
5114 create_new_def_for (DEF_FROM_PTR (def_p), copy, def_p);
5120 /* Adds phi node arguments for edge E_COPY after basic block duplication. */
5123 add_phi_args_after_copy_edge (edge e_copy)
5125 basic_block bb, bb_copy = e_copy->src, dest;
5128 gimple phi, phi_copy;
5130 gimple_stmt_iterator psi, psi_copy;
5132 if (gimple_seq_empty_p (phi_nodes (e_copy->dest)))
5135 bb = bb_copy->flags & BB_DUPLICATED ? get_bb_original (bb_copy) : bb_copy;
5137 if (e_copy->dest->flags & BB_DUPLICATED)
5138 dest = get_bb_original (e_copy->dest);
5140 dest = e_copy->dest;
5142 e = find_edge (bb, dest);
5145 /* During loop unrolling the target of the latch edge is copied.
5146 In this case we are not looking for edge to dest, but to
5147 duplicated block whose original was dest. */
5148 FOR_EACH_EDGE (e, ei, bb->succs)
5150 if ((e->dest->flags & BB_DUPLICATED)
5151 && get_bb_original (e->dest) == dest)
5155 gcc_assert (e != NULL);
5158 for (psi = gsi_start_phis (e->dest),
5159 psi_copy = gsi_start_phis (e_copy->dest);
5161 gsi_next (&psi), gsi_next (&psi_copy))
5163 phi = gsi_stmt (psi);
5164 phi_copy = gsi_stmt (psi_copy);
5165 def = PHI_ARG_DEF_FROM_EDGE (phi, e);
5166 add_phi_arg (phi_copy, def, e_copy,
5167 gimple_phi_arg_location_from_edge (phi, e));
5172 /* Basic block BB_COPY was created by code duplication. Add phi node
5173 arguments for edges going out of BB_COPY. The blocks that were
5174 duplicated have BB_DUPLICATED set. */
5177 add_phi_args_after_copy_bb (basic_block bb_copy)
5182 FOR_EACH_EDGE (e_copy, ei, bb_copy->succs)
5184 add_phi_args_after_copy_edge (e_copy);
5188 /* Blocks in REGION_COPY array of length N_REGION were created by
5189 duplication of basic blocks. Add phi node arguments for edges
5190 going from these blocks. If E_COPY is not NULL, also add
5191 phi node arguments for its destination.*/
5194 add_phi_args_after_copy (basic_block *region_copy, unsigned n_region,
5199 for (i = 0; i < n_region; i++)
5200 region_copy[i]->flags |= BB_DUPLICATED;
5202 for (i = 0; i < n_region; i++)
5203 add_phi_args_after_copy_bb (region_copy[i]);
5205 add_phi_args_after_copy_edge (e_copy);
5207 for (i = 0; i < n_region; i++)
5208 region_copy[i]->flags &= ~BB_DUPLICATED;
5211 /* Duplicates a REGION (set of N_REGION basic blocks) with just a single
5212 important exit edge EXIT. By important we mean that no SSA name defined
5213 inside region is live over the other exit edges of the region. All entry
5214 edges to the region must go to ENTRY->dest. The edge ENTRY is redirected
5215 to the duplicate of the region. SSA form, dominance and loop information
5216 is updated. The new basic blocks are stored to REGION_COPY in the same
5217 order as they had in REGION, provided that REGION_COPY is not NULL.
5218 The function returns false if it is unable to copy the region,
5222 gimple_duplicate_sese_region (edge entry, edge exit,
5223 basic_block *region, unsigned n_region,
5224 basic_block *region_copy)
5227 bool free_region_copy = false, copying_header = false;
5228 struct loop *loop = entry->dest->loop_father;
5230 VEC (basic_block, heap) *doms;
5232 int total_freq = 0, entry_freq = 0;
5233 gcov_type total_count = 0, entry_count = 0;
5235 if (!can_copy_bbs_p (region, n_region))
5238 /* Some sanity checking. Note that we do not check for all possible
5239 missuses of the functions. I.e. if you ask to copy something weird,
5240 it will work, but the state of structures probably will not be
5242 for (i = 0; i < n_region; i++)
5244 /* We do not handle subloops, i.e. all the blocks must belong to the
5246 if (region[i]->loop_father != loop)
5249 if (region[i] != entry->dest
5250 && region[i] == loop->header)
5254 set_loop_copy (loop, loop);
5256 /* In case the function is used for loop header copying (which is the primary
5257 use), ensure that EXIT and its copy will be new latch and entry edges. */
5258 if (loop->header == entry->dest)
5260 copying_header = true;
5261 set_loop_copy (loop, loop_outer (loop));
5263 if (!dominated_by_p (CDI_DOMINATORS, loop->latch, exit->src))
5266 for (i = 0; i < n_region; i++)
5267 if (region[i] != exit->src
5268 && dominated_by_p (CDI_DOMINATORS, region[i], exit->src))
5274 region_copy = XNEWVEC (basic_block, n_region);
5275 free_region_copy = true;
5278 gcc_assert (!need_ssa_update_p (cfun));
5280 /* Record blocks outside the region that are dominated by something
5283 initialize_original_copy_tables ();
5285 doms = get_dominated_by_region (CDI_DOMINATORS, region, n_region);
5287 if (entry->dest->count)
5289 total_count = entry->dest->count;
5290 entry_count = entry->count;
5291 /* Fix up corner cases, to avoid division by zero or creation of negative
5293 if (entry_count > total_count)
5294 entry_count = total_count;
5298 total_freq = entry->dest->frequency;
5299 entry_freq = EDGE_FREQUENCY (entry);
5300 /* Fix up corner cases, to avoid division by zero or creation of negative
5302 if (total_freq == 0)
5304 else if (entry_freq > total_freq)
5305 entry_freq = total_freq;
5308 copy_bbs (region, n_region, region_copy, &exit, 1, &exit_copy, loop,
5309 split_edge_bb_loc (entry));
5312 scale_bbs_frequencies_gcov_type (region, n_region,
5313 total_count - entry_count,
5315 scale_bbs_frequencies_gcov_type (region_copy, n_region, entry_count,
5320 scale_bbs_frequencies_int (region, n_region, total_freq - entry_freq,
5322 scale_bbs_frequencies_int (region_copy, n_region, entry_freq, total_freq);
5327 loop->header = exit->dest;
5328 loop->latch = exit->src;
5331 /* Redirect the entry and add the phi node arguments. */
5332 redirected = redirect_edge_and_branch (entry, get_bb_copy (entry->dest));
5333 gcc_assert (redirected != NULL);
5334 flush_pending_stmts (entry);
5336 /* Concerning updating of dominators: We must recount dominators
5337 for entry block and its copy. Anything that is outside of the
5338 region, but was dominated by something inside needs recounting as
5340 set_immediate_dominator (CDI_DOMINATORS, entry->dest, entry->src);
5341 VEC_safe_push (basic_block, heap, doms, get_bb_original (entry->dest));
5342 iterate_fix_dominators (CDI_DOMINATORS, doms, false);
5343 VEC_free (basic_block, heap, doms);
5345 /* Add the other PHI node arguments. */
5346 add_phi_args_after_copy (region_copy, n_region, NULL);
5348 /* Update the SSA web. */
5349 update_ssa (TODO_update_ssa);
5351 if (free_region_copy)
5354 free_original_copy_tables ();
5358 /* Duplicates REGION consisting of N_REGION blocks. The new blocks
5359 are stored to REGION_COPY in the same order in that they appear
5360 in REGION, if REGION_COPY is not NULL. ENTRY is the entry to
5361 the region, EXIT an exit from it. The condition guarding EXIT
5362 is moved to ENTRY. Returns true if duplication succeeds, false
5388 gimple_duplicate_sese_tail (edge entry ATTRIBUTE_UNUSED, edge exit ATTRIBUTE_UNUSED,
5389 basic_block *region ATTRIBUTE_UNUSED, unsigned n_region ATTRIBUTE_UNUSED,
5390 basic_block *region_copy ATTRIBUTE_UNUSED)
5393 bool free_region_copy = false;
5394 struct loop *loop = exit->dest->loop_father;
5395 struct loop *orig_loop = entry->dest->loop_father;
5396 basic_block switch_bb, entry_bb, nentry_bb;
5397 VEC (basic_block, heap) *doms;
5398 int total_freq = 0, exit_freq = 0;
5399 gcov_type total_count = 0, exit_count = 0;
5400 edge exits[2], nexits[2], e;
5401 gimple_stmt_iterator gsi,gsi1;
5404 basic_block exit_bb;
5405 basic_block iters_bb;
5407 gimple_stmt_iterator psi;
5411 gcc_assert (EDGE_COUNT (exit->src->succs) == 2);
5413 exits[1] = EDGE_SUCC (exit->src, EDGE_SUCC (exit->src, 0) == exit);
5415 if (!can_copy_bbs_p (region, n_region))
5418 initialize_original_copy_tables ();
5419 set_loop_copy (orig_loop, loop);
5420 duplicate_subloops (orig_loop, loop);
5424 region_copy = XNEWVEC (basic_block, n_region);
5425 free_region_copy = true;
5428 gcc_assert (!need_ssa_update_p (cfun));
5430 /* Record blocks outside the region that are dominated by something
5432 doms = get_dominated_by_region (CDI_DOMINATORS, region, n_region);
5434 if (exit->src->count)
5436 total_count = exit->src->count;
5437 exit_count = exit->count;
5438 /* Fix up corner cases, to avoid division by zero or creation of negative
5440 if (exit_count > total_count)
5441 exit_count = total_count;
5445 total_freq = exit->src->frequency;
5446 exit_freq = EDGE_FREQUENCY (exit);
5447 /* Fix up corner cases, to avoid division by zero or creation of negative
5449 if (total_freq == 0)
5451 if (exit_freq > total_freq)
5452 exit_freq = total_freq;
5455 copy_bbs (region, n_region, region_copy, exits, 2, nexits, orig_loop,
5456 split_edge_bb_loc (exit));
5459 scale_bbs_frequencies_gcov_type (region, n_region,
5460 total_count - exit_count,
5462 scale_bbs_frequencies_gcov_type (region_copy, n_region, exit_count,
5467 scale_bbs_frequencies_int (region, n_region, total_freq - exit_freq,
5469 scale_bbs_frequencies_int (region_copy, n_region, exit_freq, total_freq);
5472 /* Create the switch block, and put the exit condition to it. */
5473 entry_bb = entry->dest;
5474 nentry_bb = get_bb_copy (entry_bb);
5475 if (!last_stmt (entry->src)
5476 || !stmt_ends_bb_p (last_stmt (entry->src)))
5477 switch_bb = entry->src;
5479 switch_bb = split_edge (entry);
5480 set_immediate_dominator (CDI_DOMINATORS, nentry_bb, switch_bb);
5482 gsi = gsi_last_bb (switch_bb);
5483 cond_stmt = last_stmt (exit->src);
5484 gcc_assert (gimple_code (cond_stmt) == GIMPLE_COND);
5485 cond_stmt = gimple_copy (cond_stmt);
5487 /* If the block consisting of the exit condition has the latch as
5488 successor, then the body of the loop is executed before
5489 the exit condition is tested. In such case, moving the
5490 condition to the entry, causes that the loop will iterate
5491 one less iteration (which is the wanted outcome, since we
5492 peel out the last iteration). If the body is executed after
5493 the condition, moving the condition to the entry requires
5494 decrementing one iteration. */
5495 if (exits[1]->dest == orig_loop->latch)
5496 new_rhs = gimple_cond_rhs (cond_stmt);
5499 new_rhs = fold_build2 (MINUS_EXPR, TREE_TYPE (gimple_cond_rhs (cond_stmt)),
5500 gimple_cond_rhs (cond_stmt),
5501 build_int_cst (TREE_TYPE (gimple_cond_rhs (cond_stmt)), 1));
5503 if (TREE_CODE (gimple_cond_rhs (cond_stmt)) == SSA_NAME)
5505 iters_bb = gimple_bb (SSA_NAME_DEF_STMT (gimple_cond_rhs (cond_stmt)));
5506 for (gsi1 = gsi_start_bb (iters_bb); !gsi_end_p (gsi1); gsi_next (&gsi1))
5507 if (gsi_stmt (gsi1) == SSA_NAME_DEF_STMT (gimple_cond_rhs (cond_stmt)))
5510 new_rhs = force_gimple_operand_gsi (&gsi1, new_rhs, true,
5511 NULL_TREE,false,GSI_CONTINUE_LINKING);
5514 gimple_cond_set_rhs (cond_stmt, unshare_expr (new_rhs));
5515 gimple_cond_set_lhs (cond_stmt, unshare_expr (gimple_cond_lhs (cond_stmt)));
5516 gsi_insert_after (&gsi, cond_stmt, GSI_NEW_STMT);
5518 sorig = single_succ_edge (switch_bb);
5519 sorig->flags = exits[1]->flags;
5520 snew = make_edge (switch_bb, nentry_bb, exits[0]->flags);
5522 /* Register the new edge from SWITCH_BB in loop exit lists. */
5523 rescan_loop_exit (snew, true, false);
5525 /* Add the PHI node arguments. */
5526 add_phi_args_after_copy (region_copy, n_region, snew);
5528 /* Get rid of now superfluous conditions and associated edges (and phi node
5530 exit_bb = exit->dest;
5532 e = redirect_edge_and_branch (exits[0], exits[1]->dest);
5533 PENDING_STMT (e) = NULL;
5535 /* The latch of ORIG_LOOP was copied, and so was the backedge
5536 to the original header. We redirect this backedge to EXIT_BB. */
5537 for (i = 0; i < n_region; i++)
5538 if (get_bb_original (region_copy[i]) == orig_loop->latch)
5540 gcc_assert (single_succ_edge (region_copy[i]));
5541 e = redirect_edge_and_branch (single_succ_edge (region_copy[i]), exit_bb);
5542 PENDING_STMT (e) = NULL;
5543 for (psi = gsi_start_phis (exit_bb);
5547 phi = gsi_stmt (psi);
5548 def = PHI_ARG_DEF (phi, nexits[0]->dest_idx);
5549 add_phi_arg (phi, def, e, gimple_phi_arg_location_from_edge (phi, e));
5552 e = redirect_edge_and_branch (nexits[0], nexits[1]->dest);
5553 PENDING_STMT (e) = NULL;
5555 /* Anything that is outside of the region, but was dominated by something
5556 inside needs to update dominance info. */
5557 iterate_fix_dominators (CDI_DOMINATORS, doms, false);
5558 VEC_free (basic_block, heap, doms);
5559 /* Update the SSA web. */
5560 update_ssa (TODO_update_ssa);
5562 if (free_region_copy)
5565 free_original_copy_tables ();
5569 /* Add all the blocks dominated by ENTRY to the array BBS_P. Stop
5570 adding blocks when the dominator traversal reaches EXIT. This
5571 function silently assumes that ENTRY strictly dominates EXIT. */
5574 gather_blocks_in_sese_region (basic_block entry, basic_block exit,
5575 VEC(basic_block,heap) **bbs_p)
5579 for (son = first_dom_son (CDI_DOMINATORS, entry);
5581 son = next_dom_son (CDI_DOMINATORS, son))
5583 VEC_safe_push (basic_block, heap, *bbs_p, son);
5585 gather_blocks_in_sese_region (son, exit, bbs_p);
5589 /* Replaces *TP with a duplicate (belonging to function TO_CONTEXT).
5590 The duplicates are recorded in VARS_MAP. */
5593 replace_by_duplicate_decl (tree *tp, struct pointer_map_t *vars_map,
5596 tree t = *tp, new_t;
5597 struct function *f = DECL_STRUCT_FUNCTION (to_context);
5600 if (DECL_CONTEXT (t) == to_context)
5603 loc = pointer_map_contains (vars_map, t);
5607 loc = pointer_map_insert (vars_map, t);
5611 new_t = copy_var_decl (t, DECL_NAME (t), TREE_TYPE (t));
5612 add_local_decl (f, new_t);
5616 gcc_assert (TREE_CODE (t) == CONST_DECL);
5617 new_t = copy_node (t);
5619 DECL_CONTEXT (new_t) = to_context;
5624 new_t = (tree) *loc;
5630 /* Creates an ssa name in TO_CONTEXT equivalent to NAME.
5631 VARS_MAP maps old ssa names and var_decls to the new ones. */
5634 replace_ssa_name (tree name, struct pointer_map_t *vars_map,
5638 tree new_name, decl = SSA_NAME_VAR (name);
5640 gcc_assert (is_gimple_reg (name));
5642 loc = pointer_map_contains (vars_map, name);
5646 replace_by_duplicate_decl (&decl, vars_map, to_context);
5648 push_cfun (DECL_STRUCT_FUNCTION (to_context));
5649 if (gimple_in_ssa_p (cfun))
5650 add_referenced_var (decl);
5652 new_name = make_ssa_name (decl, SSA_NAME_DEF_STMT (name));
5653 if (SSA_NAME_IS_DEFAULT_DEF (name))
5654 set_default_def (decl, new_name);
5657 loc = pointer_map_insert (vars_map, name);
5661 new_name = (tree) *loc;
5672 struct pointer_map_t *vars_map;
5673 htab_t new_label_map;
5674 struct pointer_map_t *eh_map;
5678 /* Helper for move_block_to_fn. Set TREE_BLOCK in every expression
5679 contained in *TP if it has been ORIG_BLOCK previously and change the
5680 DECL_CONTEXT of every local variable referenced in *TP. */
5683 move_stmt_op (tree *tp, int *walk_subtrees, void *data)
5685 struct walk_stmt_info *wi = (struct walk_stmt_info *) data;
5686 struct move_stmt_d *p = (struct move_stmt_d *) wi->info;
5690 /* We should never have TREE_BLOCK set on non-statements. */
5691 gcc_assert (!TREE_BLOCK (t));
5693 else if (DECL_P (t) || TREE_CODE (t) == SSA_NAME)
5695 if (TREE_CODE (t) == SSA_NAME)
5696 *tp = replace_ssa_name (t, p->vars_map, p->to_context);
5697 else if (TREE_CODE (t) == LABEL_DECL)
5699 if (p->new_label_map)
5701 struct tree_map in, *out;
5703 out = (struct tree_map *)
5704 htab_find_with_hash (p->new_label_map, &in, DECL_UID (t));
5709 DECL_CONTEXT (t) = p->to_context;
5711 else if (p->remap_decls_p)
5713 /* Replace T with its duplicate. T should no longer appear in the
5714 parent function, so this looks wasteful; however, it may appear
5715 in referenced_vars, and more importantly, as virtual operands of
5716 statements, and in alias lists of other variables. It would be
5717 quite difficult to expunge it from all those places. ??? It might
5718 suffice to do this for addressable variables. */
5719 if ((TREE_CODE (t) == VAR_DECL
5720 && !is_global_var (t))
5721 || TREE_CODE (t) == CONST_DECL)
5722 replace_by_duplicate_decl (tp, p->vars_map, p->to_context);
5725 && gimple_in_ssa_p (cfun))
5727 push_cfun (DECL_STRUCT_FUNCTION (p->to_context));
5728 add_referenced_var (*tp);
5734 else if (TYPE_P (t))
5740 /* Helper for move_stmt_r. Given an EH region number for the source
5741 function, map that to the duplicate EH regio number in the dest. */
5744 move_stmt_eh_region_nr (int old_nr, struct move_stmt_d *p)
5746 eh_region old_r, new_r;
5749 old_r = get_eh_region_from_number (old_nr);
5750 slot = pointer_map_contains (p->eh_map, old_r);
5751 new_r = (eh_region) *slot;
5753 return new_r->index;
5756 /* Similar, but operate on INTEGER_CSTs. */
5759 move_stmt_eh_region_tree_nr (tree old_t_nr, struct move_stmt_d *p)
5763 old_nr = tree_low_cst (old_t_nr, 0);
5764 new_nr = move_stmt_eh_region_nr (old_nr, p);
5766 return build_int_cst (NULL, new_nr);
5769 /* Like move_stmt_op, but for gimple statements.
5771 Helper for move_block_to_fn. Set GIMPLE_BLOCK in every expression
5772 contained in the current statement in *GSI_P and change the
5773 DECL_CONTEXT of every local variable referenced in the current
5777 move_stmt_r (gimple_stmt_iterator *gsi_p, bool *handled_ops_p,
5778 struct walk_stmt_info *wi)
5780 struct move_stmt_d *p = (struct move_stmt_d *) wi->info;
5781 gimple stmt = gsi_stmt (*gsi_p);
5782 tree block = gimple_block (stmt);
5784 if (p->orig_block == NULL_TREE
5785 || block == p->orig_block
5786 || block == NULL_TREE)
5787 gimple_set_block (stmt, p->new_block);
5788 #ifdef ENABLE_CHECKING
5789 else if (block != p->new_block)
5791 while (block && block != p->orig_block)
5792 block = BLOCK_SUPERCONTEXT (block);
5797 switch (gimple_code (stmt))
5800 /* Remap the region numbers for __builtin_eh_{pointer,filter}. */
5802 tree r, fndecl = gimple_call_fndecl (stmt);
5803 if (fndecl && DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_NORMAL)
5804 switch (DECL_FUNCTION_CODE (fndecl))
5806 case BUILT_IN_EH_COPY_VALUES:
5807 r = gimple_call_arg (stmt, 1);
5808 r = move_stmt_eh_region_tree_nr (r, p);
5809 gimple_call_set_arg (stmt, 1, r);
5812 case BUILT_IN_EH_POINTER:
5813 case BUILT_IN_EH_FILTER:
5814 r = gimple_call_arg (stmt, 0);
5815 r = move_stmt_eh_region_tree_nr (r, p);
5816 gimple_call_set_arg (stmt, 0, r);
5827 int r = gimple_resx_region (stmt);
5828 r = move_stmt_eh_region_nr (r, p);
5829 gimple_resx_set_region (stmt, r);
5833 case GIMPLE_EH_DISPATCH:
5835 int r = gimple_eh_dispatch_region (stmt);
5836 r = move_stmt_eh_region_nr (r, p);
5837 gimple_eh_dispatch_set_region (stmt, r);
5841 case GIMPLE_OMP_RETURN:
5842 case GIMPLE_OMP_CONTINUE:
5845 if (is_gimple_omp (stmt))
5847 /* Do not remap variables inside OMP directives. Variables
5848 referenced in clauses and directive header belong to the
5849 parent function and should not be moved into the child
5851 bool save_remap_decls_p = p->remap_decls_p;
5852 p->remap_decls_p = false;
5853 *handled_ops_p = true;
5855 walk_gimple_seq (gimple_omp_body (stmt), move_stmt_r,
5858 p->remap_decls_p = save_remap_decls_p;
5866 /* Move basic block BB from function CFUN to function DEST_FN. The
5867 block is moved out of the original linked list and placed after
5868 block AFTER in the new list. Also, the block is removed from the
5869 original array of blocks and placed in DEST_FN's array of blocks.
5870 If UPDATE_EDGE_COUNT_P is true, the edge counts on both CFGs is
5871 updated to reflect the moved edges.
5873 The local variables are remapped to new instances, VARS_MAP is used
5874 to record the mapping. */
5877 move_block_to_fn (struct function *dest_cfun, basic_block bb,
5878 basic_block after, bool update_edge_count_p,
5879 struct move_stmt_d *d)
5881 struct control_flow_graph *cfg;
5884 gimple_stmt_iterator si;
5885 unsigned old_len, new_len;
5887 /* Remove BB from dominance structures. */
5888 delete_from_dominance_info (CDI_DOMINATORS, bb);
5890 remove_bb_from_loops (bb);
5892 /* Link BB to the new linked list. */
5893 move_block_after (bb, after);
5895 /* Update the edge count in the corresponding flowgraphs. */
5896 if (update_edge_count_p)
5897 FOR_EACH_EDGE (e, ei, bb->succs)
5899 cfun->cfg->x_n_edges--;
5900 dest_cfun->cfg->x_n_edges++;
5903 /* Remove BB from the original basic block array. */
5904 VEC_replace (basic_block, cfun->cfg->x_basic_block_info, bb->index, NULL);
5905 cfun->cfg->x_n_basic_blocks--;
5907 /* Grow DEST_CFUN's basic block array if needed. */
5908 cfg = dest_cfun->cfg;
5909 cfg->x_n_basic_blocks++;
5910 if (bb->index >= cfg->x_last_basic_block)
5911 cfg->x_last_basic_block = bb->index + 1;
5913 old_len = VEC_length (basic_block, cfg->x_basic_block_info);
5914 if ((unsigned) cfg->x_last_basic_block >= old_len)
5916 new_len = cfg->x_last_basic_block + (cfg->x_last_basic_block + 3) / 4;
5917 VEC_safe_grow_cleared (basic_block, gc, cfg->x_basic_block_info,
5921 VEC_replace (basic_block, cfg->x_basic_block_info,
5924 /* Remap the variables in phi nodes. */
5925 for (si = gsi_start_phis (bb); !gsi_end_p (si); )
5927 gimple phi = gsi_stmt (si);
5929 tree op = PHI_RESULT (phi);
5932 if (!is_gimple_reg (op))
5934 /* Remove the phi nodes for virtual operands (alias analysis will be
5935 run for the new function, anyway). */
5936 remove_phi_node (&si, true);
5940 SET_PHI_RESULT (phi,
5941 replace_ssa_name (op, d->vars_map, dest_cfun->decl));
5942 FOR_EACH_PHI_ARG (use, phi, oi, SSA_OP_USE)
5944 op = USE_FROM_PTR (use);
5945 if (TREE_CODE (op) == SSA_NAME)
5946 SET_USE (use, replace_ssa_name (op, d->vars_map, dest_cfun->decl));
5952 for (si = gsi_start_bb (bb); !gsi_end_p (si); gsi_next (&si))
5954 gimple stmt = gsi_stmt (si);
5955 struct walk_stmt_info wi;
5957 memset (&wi, 0, sizeof (wi));
5959 walk_gimple_stmt (&si, move_stmt_r, move_stmt_op, &wi);
5961 if (gimple_code (stmt) == GIMPLE_LABEL)
5963 tree label = gimple_label_label (stmt);
5964 int uid = LABEL_DECL_UID (label);
5966 gcc_assert (uid > -1);
5968 old_len = VEC_length (basic_block, cfg->x_label_to_block_map);
5969 if (old_len <= (unsigned) uid)
5971 new_len = 3 * uid / 2 + 1;
5972 VEC_safe_grow_cleared (basic_block, gc,
5973 cfg->x_label_to_block_map, new_len);
5976 VEC_replace (basic_block, cfg->x_label_to_block_map, uid, bb);
5977 VEC_replace (basic_block, cfun->cfg->x_label_to_block_map, uid, NULL);
5979 gcc_assert (DECL_CONTEXT (label) == dest_cfun->decl);
5981 if (uid >= dest_cfun->cfg->last_label_uid)
5982 dest_cfun->cfg->last_label_uid = uid + 1;
5985 maybe_duplicate_eh_stmt_fn (dest_cfun, stmt, cfun, stmt, d->eh_map, 0);
5986 remove_stmt_from_eh_lp_fn (cfun, stmt);
5988 gimple_duplicate_stmt_histograms (dest_cfun, stmt, cfun, stmt);
5989 gimple_remove_stmt_histograms (cfun, stmt);
5991 /* We cannot leave any operands allocated from the operand caches of
5992 the current function. */
5993 free_stmt_operands (stmt);
5994 push_cfun (dest_cfun);
5999 FOR_EACH_EDGE (e, ei, bb->succs)
6002 tree block = e->goto_block;
6003 if (d->orig_block == NULL_TREE
6004 || block == d->orig_block)
6005 e->goto_block = d->new_block;
6006 #ifdef ENABLE_CHECKING
6007 else if (block != d->new_block)
6009 while (block && block != d->orig_block)
6010 block = BLOCK_SUPERCONTEXT (block);
6017 /* Examine the statements in BB (which is in SRC_CFUN); find and return
6018 the outermost EH region. Use REGION as the incoming base EH region. */
6021 find_outermost_region_in_block (struct function *src_cfun,
6022 basic_block bb, eh_region region)
6024 gimple_stmt_iterator si;
6026 for (si = gsi_start_bb (bb); !gsi_end_p (si); gsi_next (&si))
6028 gimple stmt = gsi_stmt (si);
6029 eh_region stmt_region;
6032 lp_nr = lookup_stmt_eh_lp_fn (src_cfun, stmt);
6033 stmt_region = get_eh_region_from_lp_number_fn (src_cfun, lp_nr);
6037 region = stmt_region;
6038 else if (stmt_region != region)
6040 region = eh_region_outermost (src_cfun, stmt_region, region);
6041 gcc_assert (region != NULL);
6050 new_label_mapper (tree decl, void *data)
6052 htab_t hash = (htab_t) data;
6056 gcc_assert (TREE_CODE (decl) == LABEL_DECL);
6058 m = XNEW (struct tree_map);
6059 m->hash = DECL_UID (decl);
6060 m->base.from = decl;
6061 m->to = create_artificial_label (UNKNOWN_LOCATION);
6062 LABEL_DECL_UID (m->to) = LABEL_DECL_UID (decl);
6063 if (LABEL_DECL_UID (m->to) >= cfun->cfg->last_label_uid)
6064 cfun->cfg->last_label_uid = LABEL_DECL_UID (m->to) + 1;
6066 slot = htab_find_slot_with_hash (hash, m, m->hash, INSERT);
6067 gcc_assert (*slot == NULL);
6074 /* Change DECL_CONTEXT of all BLOCK_VARS in block, including
6078 replace_block_vars_by_duplicates (tree block, struct pointer_map_t *vars_map,
6083 for (tp = &BLOCK_VARS (block); *tp; tp = &DECL_CHAIN (*tp))
6086 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != CONST_DECL)
6088 replace_by_duplicate_decl (&t, vars_map, to_context);
6091 if (TREE_CODE (*tp) == VAR_DECL && DECL_HAS_VALUE_EXPR_P (*tp))
6093 SET_DECL_VALUE_EXPR (t, DECL_VALUE_EXPR (*tp));
6094 DECL_HAS_VALUE_EXPR_P (t) = 1;
6096 DECL_CHAIN (t) = DECL_CHAIN (*tp);
6101 for (block = BLOCK_SUBBLOCKS (block); block; block = BLOCK_CHAIN (block))
6102 replace_block_vars_by_duplicates (block, vars_map, to_context);
6105 /* Move a single-entry, single-exit region delimited by ENTRY_BB and
6106 EXIT_BB to function DEST_CFUN. The whole region is replaced by a
6107 single basic block in the original CFG and the new basic block is
6108 returned. DEST_CFUN must not have a CFG yet.
6110 Note that the region need not be a pure SESE region. Blocks inside
6111 the region may contain calls to abort/exit. The only restriction
6112 is that ENTRY_BB should be the only entry point and it must
6115 Change TREE_BLOCK of all statements in ORIG_BLOCK to the new
6116 functions outermost BLOCK, move all subblocks of ORIG_BLOCK
6117 to the new function.
6119 All local variables referenced in the region are assumed to be in
6120 the corresponding BLOCK_VARS and unexpanded variable lists
6121 associated with DEST_CFUN. */
6124 move_sese_region_to_fn (struct function *dest_cfun, basic_block entry_bb,
6125 basic_block exit_bb, tree orig_block)
6127 VEC(basic_block,heap) *bbs, *dom_bbs;
6128 basic_block dom_entry = get_immediate_dominator (CDI_DOMINATORS, entry_bb);
6129 basic_block after, bb, *entry_pred, *exit_succ, abb;
6130 struct function *saved_cfun = cfun;
6131 int *entry_flag, *exit_flag;
6132 unsigned *entry_prob, *exit_prob;
6133 unsigned i, num_entry_edges, num_exit_edges;
6136 htab_t new_label_map;
6137 struct pointer_map_t *vars_map, *eh_map;
6138 struct loop *loop = entry_bb->loop_father;
6139 struct move_stmt_d d;
6141 /* If ENTRY does not strictly dominate EXIT, this cannot be an SESE
6143 gcc_assert (entry_bb != exit_bb
6145 || dominated_by_p (CDI_DOMINATORS, exit_bb, entry_bb)));
6147 /* Collect all the blocks in the region. Manually add ENTRY_BB
6148 because it won't be added by dfs_enumerate_from. */
6150 VEC_safe_push (basic_block, heap, bbs, entry_bb);
6151 gather_blocks_in_sese_region (entry_bb, exit_bb, &bbs);
6153 /* The blocks that used to be dominated by something in BBS will now be
6154 dominated by the new block. */
6155 dom_bbs = get_dominated_by_region (CDI_DOMINATORS,
6156 VEC_address (basic_block, bbs),
6157 VEC_length (basic_block, bbs));
6159 /* Detach ENTRY_BB and EXIT_BB from CFUN->CFG. We need to remember
6160 the predecessor edges to ENTRY_BB and the successor edges to
6161 EXIT_BB so that we can re-attach them to the new basic block that
6162 will replace the region. */
6163 num_entry_edges = EDGE_COUNT (entry_bb->preds);
6164 entry_pred = (basic_block *) xcalloc (num_entry_edges, sizeof (basic_block));
6165 entry_flag = (int *) xcalloc (num_entry_edges, sizeof (int));
6166 entry_prob = XNEWVEC (unsigned, num_entry_edges);
6168 for (ei = ei_start (entry_bb->preds); (e = ei_safe_edge (ei)) != NULL;)
6170 entry_prob[i] = e->probability;
6171 entry_flag[i] = e->flags;
6172 entry_pred[i++] = e->src;
6178 num_exit_edges = EDGE_COUNT (exit_bb->succs);
6179 exit_succ = (basic_block *) xcalloc (num_exit_edges,
6180 sizeof (basic_block));
6181 exit_flag = (int *) xcalloc (num_exit_edges, sizeof (int));
6182 exit_prob = XNEWVEC (unsigned, num_exit_edges);
6184 for (ei = ei_start (exit_bb->succs); (e = ei_safe_edge (ei)) != NULL;)
6186 exit_prob[i] = e->probability;
6187 exit_flag[i] = e->flags;
6188 exit_succ[i++] = e->dest;
6200 /* Switch context to the child function to initialize DEST_FN's CFG. */
6201 gcc_assert (dest_cfun->cfg == NULL);
6202 push_cfun (dest_cfun);
6204 init_empty_tree_cfg ();
6206 /* Initialize EH information for the new function. */
6208 new_label_map = NULL;
6211 eh_region region = NULL;
6213 FOR_EACH_VEC_ELT (basic_block, bbs, i, bb)
6214 region = find_outermost_region_in_block (saved_cfun, bb, region);
6216 init_eh_for_function ();
6219 new_label_map = htab_create (17, tree_map_hash, tree_map_eq, free);
6220 eh_map = duplicate_eh_regions (saved_cfun, region, 0,
6221 new_label_mapper, new_label_map);
6227 /* Move blocks from BBS into DEST_CFUN. */
6228 gcc_assert (VEC_length (basic_block, bbs) >= 2);
6229 after = dest_cfun->cfg->x_entry_block_ptr;
6230 vars_map = pointer_map_create ();
6232 memset (&d, 0, sizeof (d));
6233 d.orig_block = orig_block;
6234 d.new_block = DECL_INITIAL (dest_cfun->decl);
6235 d.from_context = cfun->decl;
6236 d.to_context = dest_cfun->decl;
6237 d.vars_map = vars_map;
6238 d.new_label_map = new_label_map;
6240 d.remap_decls_p = true;
6242 FOR_EACH_VEC_ELT (basic_block, bbs, i, bb)
6244 /* No need to update edge counts on the last block. It has
6245 already been updated earlier when we detached the region from
6246 the original CFG. */
6247 move_block_to_fn (dest_cfun, bb, after, bb != exit_bb, &d);
6251 /* Rewire BLOCK_SUBBLOCKS of orig_block. */
6255 gcc_assert (BLOCK_SUBBLOCKS (DECL_INITIAL (dest_cfun->decl))
6257 BLOCK_SUBBLOCKS (DECL_INITIAL (dest_cfun->decl))
6258 = BLOCK_SUBBLOCKS (orig_block);
6259 for (block = BLOCK_SUBBLOCKS (orig_block);
6260 block; block = BLOCK_CHAIN (block))
6261 BLOCK_SUPERCONTEXT (block) = DECL_INITIAL (dest_cfun->decl);
6262 BLOCK_SUBBLOCKS (orig_block) = NULL_TREE;
6265 replace_block_vars_by_duplicates (DECL_INITIAL (dest_cfun->decl),
6266 vars_map, dest_cfun->decl);
6269 htab_delete (new_label_map);
6271 pointer_map_destroy (eh_map);
6272 pointer_map_destroy (vars_map);
6274 /* Rewire the entry and exit blocks. The successor to the entry
6275 block turns into the successor of DEST_FN's ENTRY_BLOCK_PTR in
6276 the child function. Similarly, the predecessor of DEST_FN's
6277 EXIT_BLOCK_PTR turns into the predecessor of EXIT_BLOCK_PTR. We
6278 need to switch CFUN between DEST_CFUN and SAVED_CFUN so that the
6279 various CFG manipulation function get to the right CFG.
6281 FIXME, this is silly. The CFG ought to become a parameter to
6283 push_cfun (dest_cfun);
6284 make_edge (ENTRY_BLOCK_PTR, entry_bb, EDGE_FALLTHRU);
6286 make_edge (exit_bb, EXIT_BLOCK_PTR, 0);
6289 /* Back in the original function, the SESE region has disappeared,
6290 create a new basic block in its place. */
6291 bb = create_empty_bb (entry_pred[0]);
6293 add_bb_to_loop (bb, loop);
6294 for (i = 0; i < num_entry_edges; i++)
6296 e = make_edge (entry_pred[i], bb, entry_flag[i]);
6297 e->probability = entry_prob[i];
6300 for (i = 0; i < num_exit_edges; i++)
6302 e = make_edge (bb, exit_succ[i], exit_flag[i]);
6303 e->probability = exit_prob[i];
6306 set_immediate_dominator (CDI_DOMINATORS, bb, dom_entry);
6307 FOR_EACH_VEC_ELT (basic_block, dom_bbs, i, abb)
6308 set_immediate_dominator (CDI_DOMINATORS, abb, bb);
6309 VEC_free (basic_block, heap, dom_bbs);
6320 VEC_free (basic_block, heap, bbs);
6326 /* Dump FUNCTION_DECL FN to file FILE using FLAGS (see TDF_* in tree-pass.h)
6330 dump_function_to_file (tree fn, FILE *file, int flags)
6333 struct function *dsf;
6334 bool ignore_topmost_bind = false, any_var = false;
6338 fprintf (file, "%s (", lang_hooks.decl_printable_name (fn, 2));
6340 arg = DECL_ARGUMENTS (fn);
6343 print_generic_expr (file, TREE_TYPE (arg), dump_flags);
6344 fprintf (file, " ");
6345 print_generic_expr (file, arg, dump_flags);
6346 if (flags & TDF_VERBOSE)
6347 print_node (file, "", arg, 4);
6348 if (DECL_CHAIN (arg))
6349 fprintf (file, ", ");
6350 arg = DECL_CHAIN (arg);
6352 fprintf (file, ")\n");
6354 if (flags & TDF_VERBOSE)
6355 print_node (file, "", fn, 2);
6357 dsf = DECL_STRUCT_FUNCTION (fn);
6358 if (dsf && (flags & TDF_EH))
6359 dump_eh_tree (file, dsf);
6361 if (flags & TDF_RAW && !gimple_has_body_p (fn))
6363 dump_node (fn, TDF_SLIM | flags, file);
6367 /* Switch CFUN to point to FN. */
6368 push_cfun (DECL_STRUCT_FUNCTION (fn));
6370 /* When GIMPLE is lowered, the variables are no longer available in
6371 BIND_EXPRs, so display them separately. */
6372 if (cfun && cfun->decl == fn && !VEC_empty (tree, cfun->local_decls))
6375 ignore_topmost_bind = true;
6377 fprintf (file, "{\n");
6378 FOR_EACH_LOCAL_DECL (cfun, ix, var)
6380 print_generic_decl (file, var, flags);
6381 if (flags & TDF_VERBOSE)
6382 print_node (file, "", var, 4);
6383 fprintf (file, "\n");
6389 if (cfun && cfun->decl == fn && cfun->cfg && basic_block_info)
6391 /* If the CFG has been built, emit a CFG-based dump. */
6392 check_bb_profile (ENTRY_BLOCK_PTR, file);
6393 if (!ignore_topmost_bind)
6394 fprintf (file, "{\n");
6396 if (any_var && n_basic_blocks)
6397 fprintf (file, "\n");
6400 gimple_dump_bb (bb, file, 2, flags);
6402 fprintf (file, "}\n");
6403 check_bb_profile (EXIT_BLOCK_PTR, file);
6405 else if (DECL_SAVED_TREE (fn) == NULL)
6407 /* The function is now in GIMPLE form but the CFG has not been
6408 built yet. Emit the single sequence of GIMPLE statements
6409 that make up its body. */
6410 gimple_seq body = gimple_body (fn);
6412 if (gimple_seq_first_stmt (body)
6413 && gimple_seq_first_stmt (body) == gimple_seq_last_stmt (body)
6414 && gimple_code (gimple_seq_first_stmt (body)) == GIMPLE_BIND)
6415 print_gimple_seq (file, body, 0, flags);
6418 if (!ignore_topmost_bind)
6419 fprintf (file, "{\n");
6422 fprintf (file, "\n");
6424 print_gimple_seq (file, body, 2, flags);
6425 fprintf (file, "}\n");
6432 /* Make a tree based dump. */
6433 chain = DECL_SAVED_TREE (fn);
6435 if (chain && TREE_CODE (chain) == BIND_EXPR)
6437 if (ignore_topmost_bind)
6439 chain = BIND_EXPR_BODY (chain);
6447 if (!ignore_topmost_bind)
6448 fprintf (file, "{\n");
6453 fprintf (file, "\n");
6455 print_generic_stmt_indented (file, chain, flags, indent);
6456 if (ignore_topmost_bind)
6457 fprintf (file, "}\n");
6460 if (flags & TDF_ENUMERATE_LOCALS)
6461 dump_enumerated_decls (file, flags);
6462 fprintf (file, "\n\n");
6469 /* Dump FUNCTION_DECL FN to stderr using FLAGS (see TDF_* in tree.h) */
6472 debug_function (tree fn, int flags)
6474 dump_function_to_file (fn, stderr, flags);
6478 /* Print on FILE the indexes for the predecessors of basic_block BB. */
6481 print_pred_bbs (FILE *file, basic_block bb)
6486 FOR_EACH_EDGE (e, ei, bb->preds)
6487 fprintf (file, "bb_%d ", e->src->index);
6491 /* Print on FILE the indexes for the successors of basic_block BB. */
6494 print_succ_bbs (FILE *file, basic_block bb)
6499 FOR_EACH_EDGE (e, ei, bb->succs)
6500 fprintf (file, "bb_%d ", e->dest->index);
6503 /* Print to FILE the basic block BB following the VERBOSITY level. */
6506 print_loops_bb (FILE *file, basic_block bb, int indent, int verbosity)
6508 char *s_indent = (char *) alloca ((size_t) indent + 1);
6509 memset ((void *) s_indent, ' ', (size_t) indent);
6510 s_indent[indent] = '\0';
6512 /* Print basic_block's header. */
6515 fprintf (file, "%s bb_%d (preds = {", s_indent, bb->index);
6516 print_pred_bbs (file, bb);
6517 fprintf (file, "}, succs = {");
6518 print_succ_bbs (file, bb);
6519 fprintf (file, "})\n");
6522 /* Print basic_block's body. */
6525 fprintf (file, "%s {\n", s_indent);
6526 gimple_dump_bb (bb, file, indent + 4, TDF_VOPS|TDF_MEMSYMS);
6527 fprintf (file, "%s }\n", s_indent);
6531 static void print_loop_and_siblings (FILE *, struct loop *, int, int);
6533 /* Pretty print LOOP on FILE, indented INDENT spaces. Following
6534 VERBOSITY level this outputs the contents of the loop, or just its
6538 print_loop (FILE *file, struct loop *loop, int indent, int verbosity)
6546 s_indent = (char *) alloca ((size_t) indent + 1);
6547 memset ((void *) s_indent, ' ', (size_t) indent);
6548 s_indent[indent] = '\0';
6550 /* Print loop's header. */
6551 fprintf (file, "%sloop_%d (header = %d, latch = %d", s_indent,
6552 loop->num, loop->header->index, loop->latch->index);
6553 fprintf (file, ", niter = ");
6554 print_generic_expr (file, loop->nb_iterations, 0);
6556 if (loop->any_upper_bound)
6558 fprintf (file, ", upper_bound = ");
6559 dump_double_int (file, loop->nb_iterations_upper_bound, true);
6562 if (loop->any_estimate)
6564 fprintf (file, ", estimate = ");
6565 dump_double_int (file, loop->nb_iterations_estimate, true);
6567 fprintf (file, ")\n");
6569 /* Print loop's body. */
6572 fprintf (file, "%s{\n", s_indent);
6574 if (bb->loop_father == loop)
6575 print_loops_bb (file, bb, indent, verbosity);
6577 print_loop_and_siblings (file, loop->inner, indent + 2, verbosity);
6578 fprintf (file, "%s}\n", s_indent);
6582 /* Print the LOOP and its sibling loops on FILE, indented INDENT
6583 spaces. Following VERBOSITY level this outputs the contents of the
6584 loop, or just its structure. */
6587 print_loop_and_siblings (FILE *file, struct loop *loop, int indent, int verbosity)
6592 print_loop (file, loop, indent, verbosity);
6593 print_loop_and_siblings (file, loop->next, indent, verbosity);
6596 /* Follow a CFG edge from the entry point of the program, and on entry
6597 of a loop, pretty print the loop structure on FILE. */
6600 print_loops (FILE *file, int verbosity)
6604 bb = ENTRY_BLOCK_PTR;
6605 if (bb && bb->loop_father)
6606 print_loop_and_siblings (file, bb->loop_father, 0, verbosity);
6610 /* Debugging loops structure at tree level, at some VERBOSITY level. */
6613 debug_loops (int verbosity)
6615 print_loops (stderr, verbosity);
6618 /* Print on stderr the code of LOOP, at some VERBOSITY level. */
6621 debug_loop (struct loop *loop, int verbosity)
6623 print_loop (stderr, loop, 0, verbosity);
6626 /* Print on stderr the code of loop number NUM, at some VERBOSITY
6630 debug_loop_num (unsigned num, int verbosity)
6632 debug_loop (get_loop (num), verbosity);
6635 /* Return true if BB ends with a call, possibly followed by some
6636 instructions that must stay with the call. Return false,
6640 gimple_block_ends_with_call_p (basic_block bb)
6642 gimple_stmt_iterator gsi = gsi_last_nondebug_bb (bb);
6643 return !gsi_end_p (gsi) && is_gimple_call (gsi_stmt (gsi));
6647 /* Return true if BB ends with a conditional branch. Return false,
6651 gimple_block_ends_with_condjump_p (const_basic_block bb)
6653 gimple stmt = last_stmt (CONST_CAST_BB (bb));
6654 return (stmt && gimple_code (stmt) == GIMPLE_COND);
6658 /* Return true if we need to add fake edge to exit at statement T.
6659 Helper function for gimple_flow_call_edges_add. */
6662 need_fake_edge_p (gimple t)
6664 tree fndecl = NULL_TREE;
6667 /* NORETURN and LONGJMP calls already have an edge to exit.
6668 CONST and PURE calls do not need one.
6669 We don't currently check for CONST and PURE here, although
6670 it would be a good idea, because those attributes are
6671 figured out from the RTL in mark_constant_function, and
6672 the counter incrementation code from -fprofile-arcs
6673 leads to different results from -fbranch-probabilities. */
6674 if (is_gimple_call (t))
6676 fndecl = gimple_call_fndecl (t);
6677 call_flags = gimple_call_flags (t);
6680 if (is_gimple_call (t)
6682 && DECL_BUILT_IN (fndecl)
6683 && (call_flags & ECF_NOTHROW)
6684 && !(call_flags & ECF_RETURNS_TWICE)
6685 /* fork() doesn't really return twice, but the effect of
6686 wrapping it in __gcov_fork() which calls __gcov_flush()
6687 and clears the counters before forking has the same
6688 effect as returning twice. Force a fake edge. */
6689 && !(DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_NORMAL
6690 && DECL_FUNCTION_CODE (fndecl) == BUILT_IN_FORK))
6693 if (is_gimple_call (t)
6694 && !(call_flags & ECF_NORETURN))
6697 if (gimple_code (t) == GIMPLE_ASM
6698 && (gimple_asm_volatile_p (t) || gimple_asm_input_p (t)))
6705 /* Add fake edges to the function exit for any non constant and non
6706 noreturn calls, volatile inline assembly in the bitmap of blocks
6707 specified by BLOCKS or to the whole CFG if BLOCKS is zero. Return
6708 the number of blocks that were split.
6710 The goal is to expose cases in which entering a basic block does
6711 not imply that all subsequent instructions must be executed. */
6714 gimple_flow_call_edges_add (sbitmap blocks)
6717 int blocks_split = 0;
6718 int last_bb = last_basic_block;
6719 bool check_last_block = false;
6721 if (n_basic_blocks == NUM_FIXED_BLOCKS)
6725 check_last_block = true;
6727 check_last_block = TEST_BIT (blocks, EXIT_BLOCK_PTR->prev_bb->index);
6729 /* In the last basic block, before epilogue generation, there will be
6730 a fallthru edge to EXIT. Special care is required if the last insn
6731 of the last basic block is a call because make_edge folds duplicate
6732 edges, which would result in the fallthru edge also being marked
6733 fake, which would result in the fallthru edge being removed by
6734 remove_fake_edges, which would result in an invalid CFG.
6736 Moreover, we can't elide the outgoing fake edge, since the block
6737 profiler needs to take this into account in order to solve the minimal
6738 spanning tree in the case that the call doesn't return.
6740 Handle this by adding a dummy instruction in a new last basic block. */
6741 if (check_last_block)
6743 basic_block bb = EXIT_BLOCK_PTR->prev_bb;
6744 gimple_stmt_iterator gsi = gsi_last_bb (bb);
6747 if (!gsi_end_p (gsi))
6750 if (t && need_fake_edge_p (t))
6754 e = find_edge (bb, EXIT_BLOCK_PTR);
6757 gsi_insert_on_edge (e, gimple_build_nop ());
6758 gsi_commit_edge_inserts ();
6763 /* Now add fake edges to the function exit for any non constant
6764 calls since there is no way that we can determine if they will
6766 for (i = 0; i < last_bb; i++)
6768 basic_block bb = BASIC_BLOCK (i);
6769 gimple_stmt_iterator gsi;
6770 gimple stmt, last_stmt;
6775 if (blocks && !TEST_BIT (blocks, i))
6778 gsi = gsi_last_bb (bb);
6779 if (!gsi_end_p (gsi))
6781 last_stmt = gsi_stmt (gsi);
6784 stmt = gsi_stmt (gsi);
6785 if (need_fake_edge_p (stmt))
6789 /* The handling above of the final block before the
6790 epilogue should be enough to verify that there is
6791 no edge to the exit block in CFG already.
6792 Calling make_edge in such case would cause us to
6793 mark that edge as fake and remove it later. */
6794 #ifdef ENABLE_CHECKING
6795 if (stmt == last_stmt)
6797 e = find_edge (bb, EXIT_BLOCK_PTR);
6798 gcc_assert (e == NULL);
6802 /* Note that the following may create a new basic block
6803 and renumber the existing basic blocks. */
6804 if (stmt != last_stmt)
6806 e = split_block (bb, stmt);
6810 make_edge (bb, EXIT_BLOCK_PTR, EDGE_FAKE);
6814 while (!gsi_end_p (gsi));
6819 verify_flow_info ();
6821 return blocks_split;
6824 /* Purge dead abnormal call edges from basic block BB. */
6827 gimple_purge_dead_abnormal_call_edges (basic_block bb)
6829 bool changed = gimple_purge_dead_eh_edges (bb);
6831 if (cfun->has_nonlocal_label)
6833 gimple stmt = last_stmt (bb);
6837 if (!(stmt && stmt_can_make_abnormal_goto (stmt)))
6838 for (ei = ei_start (bb->succs); (e = ei_safe_edge (ei)); )
6840 if (e->flags & EDGE_ABNORMAL)
6849 /* See gimple_purge_dead_eh_edges below. */
6851 free_dominance_info (CDI_DOMINATORS);
6857 /* Removes edge E and all the blocks dominated by it, and updates dominance
6858 information. The IL in E->src needs to be updated separately.
6859 If dominance info is not available, only the edge E is removed.*/
6862 remove_edge_and_dominated_blocks (edge e)
6864 VEC (basic_block, heap) *bbs_to_remove = NULL;
6865 VEC (basic_block, heap) *bbs_to_fix_dom = NULL;
6869 bool none_removed = false;
6871 basic_block bb, dbb;
6874 if (!dom_info_available_p (CDI_DOMINATORS))
6880 /* No updating is needed for edges to exit. */
6881 if (e->dest == EXIT_BLOCK_PTR)
6883 if (cfgcleanup_altered_bbs)
6884 bitmap_set_bit (cfgcleanup_altered_bbs, e->src->index);
6889 /* First, we find the basic blocks to remove. If E->dest has a predecessor
6890 that is not dominated by E->dest, then this set is empty. Otherwise,
6891 all the basic blocks dominated by E->dest are removed.
6893 Also, to DF_IDOM we store the immediate dominators of the blocks in
6894 the dominance frontier of E (i.e., of the successors of the
6895 removed blocks, if there are any, and of E->dest otherwise). */
6896 FOR_EACH_EDGE (f, ei, e->dest->preds)
6901 if (!dominated_by_p (CDI_DOMINATORS, f->src, e->dest))
6903 none_removed = true;
6908 df = BITMAP_ALLOC (NULL);
6909 df_idom = BITMAP_ALLOC (NULL);
6912 bitmap_set_bit (df_idom,
6913 get_immediate_dominator (CDI_DOMINATORS, e->dest)->index);
6916 bbs_to_remove = get_all_dominated_blocks (CDI_DOMINATORS, e->dest);
6917 FOR_EACH_VEC_ELT (basic_block, bbs_to_remove, i, bb)
6919 FOR_EACH_EDGE (f, ei, bb->succs)
6921 if (f->dest != EXIT_BLOCK_PTR)
6922 bitmap_set_bit (df, f->dest->index);
6925 FOR_EACH_VEC_ELT (basic_block, bbs_to_remove, i, bb)
6926 bitmap_clear_bit (df, bb->index);
6928 EXECUTE_IF_SET_IN_BITMAP (df, 0, i, bi)
6930 bb = BASIC_BLOCK (i);
6931 bitmap_set_bit (df_idom,
6932 get_immediate_dominator (CDI_DOMINATORS, bb)->index);
6936 if (cfgcleanup_altered_bbs)
6938 /* Record the set of the altered basic blocks. */
6939 bitmap_set_bit (cfgcleanup_altered_bbs, e->src->index);
6940 bitmap_ior_into (cfgcleanup_altered_bbs, df);
6943 /* Remove E and the cancelled blocks. */
6948 /* Walk backwards so as to get a chance to substitute all
6949 released DEFs into debug stmts. See
6950 eliminate_unnecessary_stmts() in tree-ssa-dce.c for more
6952 for (i = VEC_length (basic_block, bbs_to_remove); i-- > 0; )
6953 delete_basic_block (VEC_index (basic_block, bbs_to_remove, i));
6956 /* Update the dominance information. The immediate dominator may change only
6957 for blocks whose immediate dominator belongs to DF_IDOM:
6959 Suppose that idom(X) = Y before removal of E and idom(X) != Y after the
6960 removal. Let Z the arbitrary block such that idom(Z) = Y and
6961 Z dominates X after the removal. Before removal, there exists a path P
6962 from Y to X that avoids Z. Let F be the last edge on P that is
6963 removed, and let W = F->dest. Before removal, idom(W) = Y (since Y
6964 dominates W, and because of P, Z does not dominate W), and W belongs to
6965 the dominance frontier of E. Therefore, Y belongs to DF_IDOM. */
6966 EXECUTE_IF_SET_IN_BITMAP (df_idom, 0, i, bi)
6968 bb = BASIC_BLOCK (i);
6969 for (dbb = first_dom_son (CDI_DOMINATORS, bb);
6971 dbb = next_dom_son (CDI_DOMINATORS, dbb))
6972 VEC_safe_push (basic_block, heap, bbs_to_fix_dom, dbb);
6975 iterate_fix_dominators (CDI_DOMINATORS, bbs_to_fix_dom, true);
6978 BITMAP_FREE (df_idom);
6979 VEC_free (basic_block, heap, bbs_to_remove);
6980 VEC_free (basic_block, heap, bbs_to_fix_dom);
6983 /* Purge dead EH edges from basic block BB. */
6986 gimple_purge_dead_eh_edges (basic_block bb)
6988 bool changed = false;
6991 gimple stmt = last_stmt (bb);
6993 if (stmt && stmt_can_throw_internal (stmt))
6996 for (ei = ei_start (bb->succs); (e = ei_safe_edge (ei)); )
6998 if (e->flags & EDGE_EH)
7000 remove_edge_and_dominated_blocks (e);
7011 gimple_purge_all_dead_eh_edges (const_bitmap blocks)
7013 bool changed = false;
7017 EXECUTE_IF_SET_IN_BITMAP (blocks, 0, i, bi)
7019 basic_block bb = BASIC_BLOCK (i);
7021 /* Earlier gimple_purge_dead_eh_edges could have removed
7022 this basic block already. */
7023 gcc_assert (bb || changed);
7025 changed |= gimple_purge_dead_eh_edges (bb);
7031 /* This function is called whenever a new edge is created or
7035 gimple_execute_on_growing_pred (edge e)
7037 basic_block bb = e->dest;
7039 if (!gimple_seq_empty_p (phi_nodes (bb)))
7040 reserve_phi_args_for_new_edge (bb);
7043 /* This function is called immediately before edge E is removed from
7044 the edge vector E->dest->preds. */
7047 gimple_execute_on_shrinking_pred (edge e)
7049 if (!gimple_seq_empty_p (phi_nodes (e->dest)))
7050 remove_phi_args (e);
7053 /*---------------------------------------------------------------------------
7054 Helper functions for Loop versioning
7055 ---------------------------------------------------------------------------*/
7057 /* Adjust phi nodes for 'first' basic block. 'second' basic block is a copy
7058 of 'first'. Both of them are dominated by 'new_head' basic block. When
7059 'new_head' was created by 'second's incoming edge it received phi arguments
7060 on the edge by split_edge(). Later, additional edge 'e' was created to
7061 connect 'new_head' and 'first'. Now this routine adds phi args on this
7062 additional edge 'e' that new_head to second edge received as part of edge
7066 gimple_lv_adjust_loop_header_phi (basic_block first, basic_block second,
7067 basic_block new_head, edge e)
7070 gimple_stmt_iterator psi1, psi2;
7072 edge e2 = find_edge (new_head, second);
7074 /* Because NEW_HEAD has been created by splitting SECOND's incoming
7075 edge, we should always have an edge from NEW_HEAD to SECOND. */
7076 gcc_assert (e2 != NULL);
7078 /* Browse all 'second' basic block phi nodes and add phi args to
7079 edge 'e' for 'first' head. PHI args are always in correct order. */
7081 for (psi2 = gsi_start_phis (second),
7082 psi1 = gsi_start_phis (first);
7083 !gsi_end_p (psi2) && !gsi_end_p (psi1);
7084 gsi_next (&psi2), gsi_next (&psi1))
7086 phi1 = gsi_stmt (psi1);
7087 phi2 = gsi_stmt (psi2);
7088 def = PHI_ARG_DEF (phi2, e2->dest_idx);
7089 add_phi_arg (phi1, def, e, gimple_phi_arg_location_from_edge (phi2, e2));
7094 /* Adds a if else statement to COND_BB with condition COND_EXPR.
7095 SECOND_HEAD is the destination of the THEN and FIRST_HEAD is
7096 the destination of the ELSE part. */
7099 gimple_lv_add_condition_to_bb (basic_block first_head ATTRIBUTE_UNUSED,
7100 basic_block second_head ATTRIBUTE_UNUSED,
7101 basic_block cond_bb, void *cond_e)
7103 gimple_stmt_iterator gsi;
7104 gimple new_cond_expr;
7105 tree cond_expr = (tree) cond_e;
7108 /* Build new conditional expr */
7109 new_cond_expr = gimple_build_cond_from_tree (cond_expr,
7110 NULL_TREE, NULL_TREE);
7112 /* Add new cond in cond_bb. */
7113 gsi = gsi_last_bb (cond_bb);
7114 gsi_insert_after (&gsi, new_cond_expr, GSI_NEW_STMT);
7116 /* Adjust edges appropriately to connect new head with first head
7117 as well as second head. */
7118 e0 = single_succ_edge (cond_bb);
7119 e0->flags &= ~EDGE_FALLTHRU;
7120 e0->flags |= EDGE_FALSE_VALUE;
7123 struct cfg_hooks gimple_cfg_hooks = {
7125 gimple_verify_flow_info,
7126 gimple_dump_bb, /* dump_bb */
7127 create_bb, /* create_basic_block */
7128 gimple_redirect_edge_and_branch, /* redirect_edge_and_branch */
7129 gimple_redirect_edge_and_branch_force, /* redirect_edge_and_branch_force */
7130 gimple_can_remove_branch_p, /* can_remove_branch_p */
7131 remove_bb, /* delete_basic_block */
7132 gimple_split_block, /* split_block */
7133 gimple_move_block_after, /* move_block_after */
7134 gimple_can_merge_blocks_p, /* can_merge_blocks_p */
7135 gimple_merge_blocks, /* merge_blocks */
7136 gimple_predict_edge, /* predict_edge */
7137 gimple_predicted_by_p, /* predicted_by_p */
7138 gimple_can_duplicate_bb_p, /* can_duplicate_block_p */
7139 gimple_duplicate_bb, /* duplicate_block */
7140 gimple_split_edge, /* split_edge */
7141 gimple_make_forwarder_block, /* make_forward_block */
7142 NULL, /* tidy_fallthru_edge */
7143 gimple_block_ends_with_call_p,/* block_ends_with_call_p */
7144 gimple_block_ends_with_condjump_p, /* block_ends_with_condjump_p */
7145 gimple_flow_call_edges_add, /* flow_call_edges_add */
7146 gimple_execute_on_growing_pred, /* execute_on_growing_pred */
7147 gimple_execute_on_shrinking_pred, /* execute_on_shrinking_pred */
7148 gimple_duplicate_loop_to_header_edge, /* duplicate loop for trees */
7149 gimple_lv_add_condition_to_bb, /* lv_add_condition_to_bb */
7150 gimple_lv_adjust_loop_header_phi, /* lv_adjust_loop_header_phi*/
7151 extract_true_false_edges_from_block, /* extract_cond_bb_edges */
7152 flush_pending_stmts /* flush_pending_stmts */
7156 /* Split all critical edges. */
7159 split_critical_edges (void)
7165 /* split_edge can redirect edges out of SWITCH_EXPRs, which can get
7166 expensive. So we want to enable recording of edge to CASE_LABEL_EXPR
7167 mappings around the calls to split_edge. */
7168 start_recording_case_labels ();
7171 FOR_EACH_EDGE (e, ei, bb->succs)
7173 if (EDGE_CRITICAL_P (e) && !(e->flags & EDGE_ABNORMAL))
7175 /* PRE inserts statements to edges and expects that
7176 since split_critical_edges was done beforehand, committing edge
7177 insertions will not split more edges. In addition to critical
7178 edges we must split edges that have multiple successors and
7179 end by control flow statements, such as RESX.
7180 Go ahead and split them too. This matches the logic in
7181 gimple_find_edge_insert_loc. */
7182 else if ((!single_pred_p (e->dest)
7183 || !gimple_seq_empty_p (phi_nodes (e->dest))
7184 || e->dest == EXIT_BLOCK_PTR)
7185 && e->src != ENTRY_BLOCK_PTR
7186 && !(e->flags & EDGE_ABNORMAL))
7188 gimple_stmt_iterator gsi;
7190 gsi = gsi_last_bb (e->src);
7191 if (!gsi_end_p (gsi)
7192 && stmt_ends_bb_p (gsi_stmt (gsi))
7193 && (gimple_code (gsi_stmt (gsi)) != GIMPLE_RETURN
7194 && !gimple_call_builtin_p (gsi_stmt (gsi),
7200 end_recording_case_labels ();
7204 struct gimple_opt_pass pass_split_crit_edges =
7208 "crited", /* name */
7210 split_critical_edges, /* execute */
7213 0, /* static_pass_number */
7214 TV_TREE_SPLIT_EDGES, /* tv_id */
7215 PROP_cfg, /* properties required */
7216 PROP_no_crit_edges, /* properties_provided */
7217 0, /* properties_destroyed */
7218 0, /* todo_flags_start */
7219 TODO_dump_func | TODO_verify_flow /* todo_flags_finish */
7224 /* Build a ternary operation and gimplify it. Emit code before GSI.
7225 Return the gimple_val holding the result. */
7228 gimplify_build3 (gimple_stmt_iterator *gsi, enum tree_code code,
7229 tree type, tree a, tree b, tree c)
7232 location_t loc = gimple_location (gsi_stmt (*gsi));
7234 ret = fold_build3_loc (loc, code, type, a, b, c);
7237 return force_gimple_operand_gsi (gsi, ret, true, NULL, true,
7241 /* Build a binary operation and gimplify it. Emit code before GSI.
7242 Return the gimple_val holding the result. */
7245 gimplify_build2 (gimple_stmt_iterator *gsi, enum tree_code code,
7246 tree type, tree a, tree b)
7250 ret = fold_build2_loc (gimple_location (gsi_stmt (*gsi)), code, type, a, b);
7253 return force_gimple_operand_gsi (gsi, ret, true, NULL, true,
7257 /* Build a unary operation and gimplify it. Emit code before GSI.
7258 Return the gimple_val holding the result. */
7261 gimplify_build1 (gimple_stmt_iterator *gsi, enum tree_code code, tree type,
7266 ret = fold_build1_loc (gimple_location (gsi_stmt (*gsi)), code, type, a);
7269 return force_gimple_operand_gsi (gsi, ret, true, NULL, true,
7275 /* Emit return warnings. */
7278 execute_warn_function_return (void)
7280 source_location location;
7285 /* If we have a path to EXIT, then we do return. */
7286 if (TREE_THIS_VOLATILE (cfun->decl)
7287 && EDGE_COUNT (EXIT_BLOCK_PTR->preds) > 0)
7289 location = UNKNOWN_LOCATION;
7290 FOR_EACH_EDGE (e, ei, EXIT_BLOCK_PTR->preds)
7292 last = last_stmt (e->src);
7293 if ((gimple_code (last) == GIMPLE_RETURN
7294 || gimple_call_builtin_p (last, BUILT_IN_RETURN))
7295 && (location = gimple_location (last)) != UNKNOWN_LOCATION)
7298 if (location == UNKNOWN_LOCATION)
7299 location = cfun->function_end_locus;
7300 warning_at (location, 0, "%<noreturn%> function does return");
7303 /* If we see "return;" in some basic block, then we do reach the end
7304 without returning a value. */
7305 else if (warn_return_type
7306 && !TREE_NO_WARNING (cfun->decl)
7307 && EDGE_COUNT (EXIT_BLOCK_PTR->preds) > 0
7308 && !VOID_TYPE_P (TREE_TYPE (TREE_TYPE (cfun->decl))))
7310 FOR_EACH_EDGE (e, ei, EXIT_BLOCK_PTR->preds)
7312 gimple last = last_stmt (e->src);
7313 if (gimple_code (last) == GIMPLE_RETURN
7314 && gimple_return_retval (last) == NULL
7315 && !gimple_no_warning_p (last))
7317 location = gimple_location (last);
7318 if (location == UNKNOWN_LOCATION)
7319 location = cfun->function_end_locus;
7320 warning_at (location, OPT_Wreturn_type, "control reaches end of non-void function");
7321 TREE_NO_WARNING (cfun->decl) = 1;
7330 /* Given a basic block B which ends with a conditional and has
7331 precisely two successors, determine which of the edges is taken if
7332 the conditional is true and which is taken if the conditional is
7333 false. Set TRUE_EDGE and FALSE_EDGE appropriately. */
7336 extract_true_false_edges_from_block (basic_block b,
7340 edge e = EDGE_SUCC (b, 0);
7342 if (e->flags & EDGE_TRUE_VALUE)
7345 *false_edge = EDGE_SUCC (b, 1);
7350 *true_edge = EDGE_SUCC (b, 1);
7354 struct gimple_opt_pass pass_warn_function_return =
7358 "*warn_function_return", /* name */
7360 execute_warn_function_return, /* execute */
7363 0, /* static_pass_number */
7364 TV_NONE, /* tv_id */
7365 PROP_cfg, /* properties_required */
7366 0, /* properties_provided */
7367 0, /* properties_destroyed */
7368 0, /* todo_flags_start */
7369 0 /* todo_flags_finish */
7373 /* Emit noreturn warnings. */
7376 execute_warn_function_noreturn (void)
7378 if (!TREE_THIS_VOLATILE (current_function_decl)
7379 && EDGE_COUNT (EXIT_BLOCK_PTR->preds) == 0)
7380 warn_function_noreturn (current_function_decl);
7385 gate_warn_function_noreturn (void)
7387 return warn_suggest_attribute_noreturn;
7390 struct gimple_opt_pass pass_warn_function_noreturn =
7394 "*warn_function_noreturn", /* name */
7395 gate_warn_function_noreturn, /* gate */
7396 execute_warn_function_noreturn, /* execute */
7399 0, /* static_pass_number */
7400 TV_NONE, /* tv_id */
7401 PROP_cfg, /* properties_required */
7402 0, /* properties_provided */
7403 0, /* properties_destroyed */
7404 0, /* todo_flags_start */
7405 0 /* todo_flags_finish */
7410 /* Walk a gimplified function and warn for functions whose return value is
7411 ignored and attribute((warn_unused_result)) is set. This is done before
7412 inlining, so we don't have to worry about that. */
7415 do_warn_unused_result (gimple_seq seq)
7418 gimple_stmt_iterator i;
7420 for (i = gsi_start (seq); !gsi_end_p (i); gsi_next (&i))
7422 gimple g = gsi_stmt (i);
7424 switch (gimple_code (g))
7427 do_warn_unused_result (gimple_bind_body (g));
7430 do_warn_unused_result (gimple_try_eval (g));
7431 do_warn_unused_result (gimple_try_cleanup (g));
7434 do_warn_unused_result (gimple_catch_handler (g));
7436 case GIMPLE_EH_FILTER:
7437 do_warn_unused_result (gimple_eh_filter_failure (g));
7441 if (gimple_call_lhs (g))
7444 /* This is a naked call, as opposed to a GIMPLE_CALL with an
7445 LHS. All calls whose value is ignored should be
7446 represented like this. Look for the attribute. */
7447 fdecl = gimple_call_fndecl (g);
7448 ftype = TREE_TYPE (TREE_TYPE (gimple_call_fn (g)));
7450 if (lookup_attribute ("warn_unused_result", TYPE_ATTRIBUTES (ftype)))
7452 location_t loc = gimple_location (g);
7455 warning_at (loc, OPT_Wunused_result,
7456 "ignoring return value of %qD, "
7457 "declared with attribute warn_unused_result",
7460 warning_at (loc, OPT_Wunused_result,
7461 "ignoring return value of function "
7462 "declared with attribute warn_unused_result");
7467 /* Not a container, not a call, or a call whose value is used. */
7474 run_warn_unused_result (void)
7476 do_warn_unused_result (gimple_body (current_function_decl));
7481 gate_warn_unused_result (void)
7483 return flag_warn_unused_result;
7486 struct gimple_opt_pass pass_warn_unused_result =
7490 "*warn_unused_result", /* name */
7491 gate_warn_unused_result, /* gate */
7492 run_warn_unused_result, /* execute */
7495 0, /* static_pass_number */
7496 TV_NONE, /* tv_id */
7497 PROP_gimple_any, /* properties_required */
7498 0, /* properties_provided */
7499 0, /* properties_destroyed */
7500 0, /* todo_flags_start */
7501 0, /* todo_flags_finish */