1 /* Control flow functions for trees.
2 Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009
3 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"
29 #include "hard-reg-set.h"
30 #include "basic-block.h"
36 #include "langhooks.h"
37 #include "diagnostic.h"
38 #include "tree-flow.h"
40 #include "tree-dump.h"
41 #include "tree-pass.h"
45 #include "cfglayout.h"
46 #include "tree-ssa-propagate.h"
47 #include "value-prof.h"
48 #include "pointer-set.h"
49 #include "tree-inline.h"
51 /* This file contains functions for building the Control Flow Graph (CFG)
52 for a function tree. */
54 /* Local declarations. */
56 /* Initial capacity for the basic block array. */
57 static const int initial_cfg_capacity = 20;
59 /* This hash table allows us to efficiently lookup all CASE_LABEL_EXPRs
60 which use a particular edge. The CASE_LABEL_EXPRs are chained together
61 via their TREE_CHAIN field, which we clear after we're done with the
62 hash table to prevent problems with duplication of GIMPLE_SWITCHes.
64 Access to this list of CASE_LABEL_EXPRs allows us to efficiently
65 update the case vector in response to edge redirections.
67 Right now this table is set up and torn down at key points in the
68 compilation process. It would be nice if we could make the table
69 more persistent. The key is getting notification of changes to
70 the CFG (particularly edge removal, creation and redirection). */
72 static struct pointer_map_t *edge_to_cases;
77 long num_merged_labels;
80 static struct cfg_stats_d cfg_stats;
82 /* Nonzero if we found a computed goto while building basic blocks. */
83 static bool found_computed_goto;
85 /* Hash table to store last discriminator assigned for each locus. */
86 struct locus_discrim_map
91 static htab_t discriminator_per_locus;
93 /* Basic blocks and flowgraphs. */
94 static void make_blocks (gimple_seq);
95 static void factor_computed_gotos (void);
98 static void make_edges (void);
99 static void make_cond_expr_edges (basic_block);
100 static void make_gimple_switch_edges (basic_block);
101 static void make_goto_expr_edges (basic_block);
102 static void make_gimple_asm_edges (basic_block);
103 static unsigned int locus_map_hash (const void *);
104 static int locus_map_eq (const void *, const void *);
105 static void assign_discriminator (location_t, basic_block);
106 static edge gimple_redirect_edge_and_branch (edge, basic_block);
107 static edge gimple_try_redirect_by_replacing_jump (edge, basic_block);
108 static unsigned int split_critical_edges (void);
110 /* Various helpers. */
111 static inline bool stmt_starts_bb_p (gimple, gimple);
112 static int gimple_verify_flow_info (void);
113 static void gimple_make_forwarder_block (edge);
114 static void gimple_cfg2vcg (FILE *);
115 static gimple first_non_label_stmt (basic_block);
117 /* Flowgraph optimization and cleanup. */
118 static void gimple_merge_blocks (basic_block, basic_block);
119 static bool gimple_can_merge_blocks_p (basic_block, basic_block);
120 static void remove_bb (basic_block);
121 static edge find_taken_edge_computed_goto (basic_block, tree);
122 static edge find_taken_edge_cond_expr (basic_block, tree);
123 static edge find_taken_edge_switch_expr (basic_block, tree);
124 static tree find_case_label_for_value (gimple, tree);
127 init_empty_tree_cfg_for_function (struct function *fn)
129 /* Initialize the basic block array. */
131 profile_status_for_function (fn) = PROFILE_ABSENT;
132 n_basic_blocks_for_function (fn) = NUM_FIXED_BLOCKS;
133 last_basic_block_for_function (fn) = NUM_FIXED_BLOCKS;
134 basic_block_info_for_function (fn)
135 = VEC_alloc (basic_block, gc, initial_cfg_capacity);
136 VEC_safe_grow_cleared (basic_block, gc,
137 basic_block_info_for_function (fn),
138 initial_cfg_capacity);
140 /* Build a mapping of labels to their associated blocks. */
141 label_to_block_map_for_function (fn)
142 = VEC_alloc (basic_block, gc, initial_cfg_capacity);
143 VEC_safe_grow_cleared (basic_block, gc,
144 label_to_block_map_for_function (fn),
145 initial_cfg_capacity);
147 SET_BASIC_BLOCK_FOR_FUNCTION (fn, ENTRY_BLOCK,
148 ENTRY_BLOCK_PTR_FOR_FUNCTION (fn));
149 SET_BASIC_BLOCK_FOR_FUNCTION (fn, EXIT_BLOCK,
150 EXIT_BLOCK_PTR_FOR_FUNCTION (fn));
152 ENTRY_BLOCK_PTR_FOR_FUNCTION (fn)->next_bb
153 = EXIT_BLOCK_PTR_FOR_FUNCTION (fn);
154 EXIT_BLOCK_PTR_FOR_FUNCTION (fn)->prev_bb
155 = ENTRY_BLOCK_PTR_FOR_FUNCTION (fn);
159 init_empty_tree_cfg (void)
161 init_empty_tree_cfg_for_function (cfun);
164 /*---------------------------------------------------------------------------
166 ---------------------------------------------------------------------------*/
168 /* Entry point to the CFG builder for trees. SEQ is the sequence of
169 statements to be added to the flowgraph. */
172 build_gimple_cfg (gimple_seq seq)
174 /* Register specific gimple functions. */
175 gimple_register_cfg_hooks ();
177 memset ((void *) &cfg_stats, 0, sizeof (cfg_stats));
179 init_empty_tree_cfg ();
181 found_computed_goto = 0;
184 /* Computed gotos are hell to deal with, especially if there are
185 lots of them with a large number of destinations. So we factor
186 them to a common computed goto location before we build the
187 edge list. After we convert back to normal form, we will un-factor
188 the computed gotos since factoring introduces an unwanted jump. */
189 if (found_computed_goto)
190 factor_computed_gotos ();
192 /* Make sure there is always at least one block, even if it's empty. */
193 if (n_basic_blocks == NUM_FIXED_BLOCKS)
194 create_empty_bb (ENTRY_BLOCK_PTR);
196 /* Adjust the size of the array. */
197 if (VEC_length (basic_block, basic_block_info) < (size_t) n_basic_blocks)
198 VEC_safe_grow_cleared (basic_block, gc, basic_block_info, n_basic_blocks);
200 /* To speed up statement iterator walks, we first purge dead labels. */
201 cleanup_dead_labels ();
203 /* Group case nodes to reduce the number of edges.
204 We do this after cleaning up dead labels because otherwise we miss
205 a lot of obvious case merging opportunities. */
206 group_case_labels ();
208 /* Create the edges of the flowgraph. */
209 discriminator_per_locus = htab_create (13, locus_map_hash, locus_map_eq,
212 cleanup_dead_labels ();
213 htab_delete (discriminator_per_locus);
215 /* Debugging dumps. */
217 /* Write the flowgraph to a VCG file. */
219 int local_dump_flags;
220 FILE *vcg_file = dump_begin (TDI_vcg, &local_dump_flags);
223 gimple_cfg2vcg (vcg_file);
224 dump_end (TDI_vcg, vcg_file);
228 #ifdef ENABLE_CHECKING
234 execute_build_cfg (void)
236 gimple_seq body = gimple_body (current_function_decl);
238 build_gimple_cfg (body);
239 gimple_set_body (current_function_decl, NULL);
240 if (dump_file && (dump_flags & TDF_DETAILS))
242 fprintf (dump_file, "Scope blocks:\n");
243 dump_scope_blocks (dump_file, dump_flags);
248 struct gimple_opt_pass pass_build_cfg =
254 execute_build_cfg, /* execute */
257 0, /* static_pass_number */
258 TV_TREE_CFG, /* tv_id */
259 PROP_gimple_leh, /* properties_required */
260 PROP_cfg, /* properties_provided */
261 0, /* properties_destroyed */
262 0, /* todo_flags_start */
263 TODO_verify_stmts | TODO_cleanup_cfg
264 | TODO_dump_func /* todo_flags_finish */
269 /* Return true if T is a computed goto. */
272 computed_goto_p (gimple t)
274 return (gimple_code (t) == GIMPLE_GOTO
275 && TREE_CODE (gimple_goto_dest (t)) != LABEL_DECL);
279 /* Search the CFG for any computed gotos. If found, factor them to a
280 common computed goto site. Also record the location of that site so
281 that we can un-factor the gotos after we have converted back to
285 factor_computed_gotos (void)
288 tree factored_label_decl = NULL;
290 gimple factored_computed_goto_label = NULL;
291 gimple factored_computed_goto = NULL;
293 /* We know there are one or more computed gotos in this function.
294 Examine the last statement in each basic block to see if the block
295 ends with a computed goto. */
299 gimple_stmt_iterator gsi = gsi_last_bb (bb);
305 last = gsi_stmt (gsi);
307 /* Ignore the computed goto we create when we factor the original
309 if (last == factored_computed_goto)
312 /* If the last statement is a computed goto, factor it. */
313 if (computed_goto_p (last))
317 /* The first time we find a computed goto we need to create
318 the factored goto block and the variable each original
319 computed goto will use for their goto destination. */
320 if (!factored_computed_goto)
322 basic_block new_bb = create_empty_bb (bb);
323 gimple_stmt_iterator new_gsi = gsi_start_bb (new_bb);
325 /* Create the destination of the factored goto. Each original
326 computed goto will put its desired destination into this
327 variable and jump to the label we create immediately
329 var = create_tmp_var (ptr_type_node, "gotovar");
331 /* Build a label for the new block which will contain the
332 factored computed goto. */
333 factored_label_decl = create_artificial_label (UNKNOWN_LOCATION);
334 factored_computed_goto_label
335 = gimple_build_label (factored_label_decl);
336 gsi_insert_after (&new_gsi, factored_computed_goto_label,
339 /* Build our new computed goto. */
340 factored_computed_goto = gimple_build_goto (var);
341 gsi_insert_after (&new_gsi, factored_computed_goto, GSI_NEW_STMT);
344 /* Copy the original computed goto's destination into VAR. */
345 assignment = gimple_build_assign (var, gimple_goto_dest (last));
346 gsi_insert_before (&gsi, assignment, GSI_SAME_STMT);
348 /* And re-vector the computed goto to the new destination. */
349 gimple_goto_set_dest (last, factored_label_decl);
355 /* Build a flowgraph for the sequence of stmts SEQ. */
358 make_blocks (gimple_seq seq)
360 gimple_stmt_iterator i = gsi_start (seq);
362 bool start_new_block = true;
363 bool first_stmt_of_seq = true;
364 basic_block bb = ENTRY_BLOCK_PTR;
366 while (!gsi_end_p (i))
373 /* If the statement starts a new basic block or if we have determined
374 in a previous pass that we need to create a new block for STMT, do
376 if (start_new_block || stmt_starts_bb_p (stmt, prev_stmt))
378 if (!first_stmt_of_seq)
379 seq = gsi_split_seq_before (&i);
380 bb = create_basic_block (seq, NULL, bb);
381 start_new_block = false;
384 /* Now add STMT to BB and create the subgraphs for special statement
386 gimple_set_bb (stmt, bb);
388 if (computed_goto_p (stmt))
389 found_computed_goto = true;
391 /* If STMT is a basic block terminator, set START_NEW_BLOCK for the
393 if (stmt_ends_bb_p (stmt))
395 /* If the stmt can make abnormal goto use a new temporary
396 for the assignment to the LHS. This makes sure the old value
397 of the LHS is available on the abnormal edge. Otherwise
398 we will end up with overlapping life-ranges for abnormal
400 if (gimple_has_lhs (stmt)
401 && stmt_can_make_abnormal_goto (stmt)
402 && is_gimple_reg_type (TREE_TYPE (gimple_get_lhs (stmt))))
404 tree lhs = gimple_get_lhs (stmt);
405 tree tmp = create_tmp_var (TREE_TYPE (lhs), NULL);
406 gimple s = gimple_build_assign (lhs, tmp);
407 gimple_set_location (s, gimple_location (stmt));
408 gimple_set_block (s, gimple_block (stmt));
409 gimple_set_lhs (stmt, tmp);
410 if (TREE_CODE (TREE_TYPE (tmp)) == COMPLEX_TYPE
411 || TREE_CODE (TREE_TYPE (tmp)) == VECTOR_TYPE)
412 DECL_GIMPLE_REG_P (tmp) = 1;
413 gsi_insert_after (&i, s, GSI_SAME_STMT);
415 start_new_block = true;
419 first_stmt_of_seq = false;
424 /* Create and return a new empty basic block after bb AFTER. */
427 create_bb (void *h, void *e, basic_block after)
433 /* Create and initialize a new basic block. Since alloc_block uses
434 ggc_alloc_cleared to allocate a basic block, we do not have to
435 clear the newly allocated basic block here. */
438 bb->index = last_basic_block;
440 bb->il.gimple = GGC_CNEW (struct gimple_bb_info);
441 set_bb_seq (bb, h ? (gimple_seq) h : gimple_seq_alloc ());
443 /* Add the new block to the linked list of blocks. */
444 link_block (bb, after);
446 /* Grow the basic block array if needed. */
447 if ((size_t) last_basic_block == VEC_length (basic_block, basic_block_info))
449 size_t new_size = last_basic_block + (last_basic_block + 3) / 4;
450 VEC_safe_grow_cleared (basic_block, gc, basic_block_info, new_size);
453 /* Add the newly created block to the array. */
454 SET_BASIC_BLOCK (last_basic_block, bb);
463 /*---------------------------------------------------------------------------
465 ---------------------------------------------------------------------------*/
467 /* Fold COND_EXPR_COND of each COND_EXPR. */
470 fold_cond_expr_cond (void)
476 gimple stmt = last_stmt (bb);
478 if (stmt && gimple_code (stmt) == GIMPLE_COND)
480 location_t loc = gimple_location (stmt);
484 fold_defer_overflow_warnings ();
485 cond = fold_binary_loc (loc, gimple_cond_code (stmt), boolean_type_node,
486 gimple_cond_lhs (stmt), gimple_cond_rhs (stmt));
489 zerop = integer_zerop (cond);
490 onep = integer_onep (cond);
493 zerop = onep = false;
495 fold_undefer_overflow_warnings (zerop || onep,
497 WARN_STRICT_OVERFLOW_CONDITIONAL);
499 gimple_cond_make_false (stmt);
501 gimple_cond_make_true (stmt);
506 /* Join all the blocks in the flowgraph. */
512 struct omp_region *cur_region = NULL;
514 /* Create an edge from entry to the first block with executable
516 make_edge (ENTRY_BLOCK_PTR, BASIC_BLOCK (NUM_FIXED_BLOCKS), EDGE_FALLTHRU);
518 /* Traverse the basic block array placing edges. */
521 gimple last = last_stmt (bb);
526 enum gimple_code code = gimple_code (last);
530 make_goto_expr_edges (bb);
534 make_edge (bb, EXIT_BLOCK_PTR, 0);
538 make_cond_expr_edges (bb);
542 make_gimple_switch_edges (bb);
546 make_eh_edges (last);
549 case GIMPLE_EH_DISPATCH:
550 fallthru = make_eh_dispatch_edges (last);
554 /* If this function receives a nonlocal goto, then we need to
555 make edges from this call site to all the nonlocal goto
557 if (stmt_can_make_abnormal_goto (last))
558 make_abnormal_goto_edges (bb, true);
560 /* If this statement has reachable exception handlers, then
561 create abnormal edges to them. */
562 make_eh_edges (last);
564 /* Some calls are known not to return. */
565 fallthru = !(gimple_call_flags (last) & ECF_NORETURN);
569 /* A GIMPLE_ASSIGN may throw internally and thus be considered
571 if (is_ctrl_altering_stmt (last))
572 make_eh_edges (last);
577 make_gimple_asm_edges (bb);
581 case GIMPLE_OMP_PARALLEL:
582 case GIMPLE_OMP_TASK:
584 case GIMPLE_OMP_SINGLE:
585 case GIMPLE_OMP_MASTER:
586 case GIMPLE_OMP_ORDERED:
587 case GIMPLE_OMP_CRITICAL:
588 case GIMPLE_OMP_SECTION:
589 cur_region = new_omp_region (bb, code, cur_region);
593 case GIMPLE_OMP_SECTIONS:
594 cur_region = new_omp_region (bb, code, cur_region);
598 case GIMPLE_OMP_SECTIONS_SWITCH:
602 case GIMPLE_OMP_ATOMIC_LOAD:
603 case GIMPLE_OMP_ATOMIC_STORE:
607 case GIMPLE_OMP_RETURN:
608 /* In the case of a GIMPLE_OMP_SECTION, the edge will go
609 somewhere other than the next block. This will be
611 cur_region->exit = bb;
612 fallthru = cur_region->type != GIMPLE_OMP_SECTION;
613 cur_region = cur_region->outer;
616 case GIMPLE_OMP_CONTINUE:
617 cur_region->cont = bb;
618 switch (cur_region->type)
621 /* Mark all GIMPLE_OMP_FOR and GIMPLE_OMP_CONTINUE
622 succs edges as abnormal to prevent splitting
624 single_succ_edge (cur_region->entry)->flags |= EDGE_ABNORMAL;
625 /* Make the loopback edge. */
626 make_edge (bb, single_succ (cur_region->entry),
629 /* Create an edge from GIMPLE_OMP_FOR to exit, which
630 corresponds to the case that the body of the loop
631 is not executed at all. */
632 make_edge (cur_region->entry, bb->next_bb, EDGE_ABNORMAL);
633 make_edge (bb, bb->next_bb, EDGE_FALLTHRU | EDGE_ABNORMAL);
637 case GIMPLE_OMP_SECTIONS:
638 /* Wire up the edges into and out of the nested sections. */
640 basic_block switch_bb = single_succ (cur_region->entry);
642 struct omp_region *i;
643 for (i = cur_region->inner; i ; i = i->next)
645 gcc_assert (i->type == GIMPLE_OMP_SECTION);
646 make_edge (switch_bb, i->entry, 0);
647 make_edge (i->exit, bb, EDGE_FALLTHRU);
650 /* Make the loopback edge to the block with
651 GIMPLE_OMP_SECTIONS_SWITCH. */
652 make_edge (bb, switch_bb, 0);
654 /* Make the edge from the switch to exit. */
655 make_edge (switch_bb, bb->next_bb, 0);
666 gcc_assert (!stmt_ends_bb_p (last));
675 make_edge (bb, bb->next_bb, EDGE_FALLTHRU);
677 assign_discriminator (gimple_location (last), bb->next_bb);
684 /* Fold COND_EXPR_COND of each COND_EXPR. */
685 fold_cond_expr_cond ();
688 /* Trivial hash function for a location_t. ITEM is a pointer to
689 a hash table entry that maps a location_t to a discriminator. */
692 locus_map_hash (const void *item)
694 return ((const struct locus_discrim_map *) item)->locus;
697 /* Equality function for the locus-to-discriminator map. VA and VB
698 point to the two hash table entries to compare. */
701 locus_map_eq (const void *va, const void *vb)
703 const struct locus_discrim_map *a = (const struct locus_discrim_map *) va;
704 const struct locus_discrim_map *b = (const struct locus_discrim_map *) vb;
705 return a->locus == b->locus;
708 /* Find the next available discriminator value for LOCUS. The
709 discriminator distinguishes among several basic blocks that
710 share a common locus, allowing for more accurate sample-based
714 next_discriminator_for_locus (location_t locus)
716 struct locus_discrim_map item;
717 struct locus_discrim_map **slot;
720 item.discriminator = 0;
721 slot = (struct locus_discrim_map **)
722 htab_find_slot_with_hash (discriminator_per_locus, (void *) &item,
723 (hashval_t) locus, INSERT);
725 if (*slot == HTAB_EMPTY_ENTRY)
727 *slot = XNEW (struct locus_discrim_map);
729 (*slot)->locus = locus;
730 (*slot)->discriminator = 0;
732 (*slot)->discriminator++;
733 return (*slot)->discriminator;
736 /* Return TRUE if LOCUS1 and LOCUS2 refer to the same source line. */
739 same_line_p (location_t locus1, location_t locus2)
741 expanded_location from, to;
743 if (locus1 == locus2)
746 from = expand_location (locus1);
747 to = expand_location (locus2);
749 if (from.line != to.line)
751 if (from.file == to.file)
753 return (from.file != NULL
755 && strcmp (from.file, to.file) == 0);
758 /* Assign a unique discriminator value to block BB if it begins at the same
759 LOCUS as its predecessor block. */
762 assign_discriminator (location_t locus, basic_block bb)
764 gimple first_in_to_bb, last_in_to_bb;
766 if (locus == 0 || bb->discriminator != 0)
769 first_in_to_bb = first_non_label_stmt (bb);
770 last_in_to_bb = last_stmt (bb);
771 if ((first_in_to_bb && same_line_p (locus, gimple_location (first_in_to_bb)))
772 || (last_in_to_bb && same_line_p (locus, gimple_location (last_in_to_bb))))
773 bb->discriminator = next_discriminator_for_locus (locus);
776 /* Create the edges for a GIMPLE_COND starting at block BB. */
779 make_cond_expr_edges (basic_block bb)
781 gimple entry = last_stmt (bb);
782 gimple then_stmt, else_stmt;
783 basic_block then_bb, else_bb;
784 tree then_label, else_label;
786 location_t entry_locus;
789 gcc_assert (gimple_code (entry) == GIMPLE_COND);
791 entry_locus = gimple_location (entry);
793 /* Entry basic blocks for each component. */
794 then_label = gimple_cond_true_label (entry);
795 else_label = gimple_cond_false_label (entry);
796 then_bb = label_to_block (then_label);
797 else_bb = label_to_block (else_label);
798 then_stmt = first_stmt (then_bb);
799 else_stmt = first_stmt (else_bb);
801 e = make_edge (bb, then_bb, EDGE_TRUE_VALUE);
802 assign_discriminator (entry_locus, then_bb);
803 e->goto_locus = gimple_location (then_stmt);
805 e->goto_block = gimple_block (then_stmt);
806 e = make_edge (bb, else_bb, EDGE_FALSE_VALUE);
809 assign_discriminator (entry_locus, else_bb);
810 e->goto_locus = gimple_location (else_stmt);
812 e->goto_block = gimple_block (else_stmt);
815 /* We do not need the labels anymore. */
816 gimple_cond_set_true_label (entry, NULL_TREE);
817 gimple_cond_set_false_label (entry, NULL_TREE);
821 /* Called for each element in the hash table (P) as we delete the
822 edge to cases hash table.
824 Clear all the TREE_CHAINs to prevent problems with copying of
825 SWITCH_EXPRs and structure sharing rules, then free the hash table
829 edge_to_cases_cleanup (const void *key ATTRIBUTE_UNUSED, void **value,
830 void *data ATTRIBUTE_UNUSED)
834 for (t = (tree) *value; t; t = next)
836 next = TREE_CHAIN (t);
837 TREE_CHAIN (t) = NULL;
844 /* Start recording information mapping edges to case labels. */
847 start_recording_case_labels (void)
849 gcc_assert (edge_to_cases == NULL);
850 edge_to_cases = pointer_map_create ();
853 /* Return nonzero if we are recording information for case labels. */
856 recording_case_labels_p (void)
858 return (edge_to_cases != NULL);
861 /* Stop recording information mapping edges to case labels and
862 remove any information we have recorded. */
864 end_recording_case_labels (void)
866 pointer_map_traverse (edge_to_cases, edge_to_cases_cleanup, NULL);
867 pointer_map_destroy (edge_to_cases);
868 edge_to_cases = NULL;
871 /* If we are inside a {start,end}_recording_cases block, then return
872 a chain of CASE_LABEL_EXPRs from T which reference E.
874 Otherwise return NULL. */
877 get_cases_for_edge (edge e, gimple t)
882 /* If we are not recording cases, then we do not have CASE_LABEL_EXPR
883 chains available. Return NULL so the caller can detect this case. */
884 if (!recording_case_labels_p ())
887 slot = pointer_map_contains (edge_to_cases, e);
891 /* If we did not find E in the hash table, then this must be the first
892 time we have been queried for information about E & T. Add all the
893 elements from T to the hash table then perform the query again. */
895 n = gimple_switch_num_labels (t);
896 for (i = 0; i < n; i++)
898 tree elt = gimple_switch_label (t, i);
899 tree lab = CASE_LABEL (elt);
900 basic_block label_bb = label_to_block (lab);
901 edge this_edge = find_edge (e->src, label_bb);
903 /* Add it to the chain of CASE_LABEL_EXPRs referencing E, or create
905 slot = pointer_map_insert (edge_to_cases, this_edge);
906 TREE_CHAIN (elt) = (tree) *slot;
910 return (tree) *pointer_map_contains (edge_to_cases, e);
913 /* Create the edges for a GIMPLE_SWITCH starting at block BB. */
916 make_gimple_switch_edges (basic_block bb)
918 gimple entry = last_stmt (bb);
919 location_t entry_locus;
922 entry_locus = gimple_location (entry);
924 n = gimple_switch_num_labels (entry);
926 for (i = 0; i < n; ++i)
928 tree lab = CASE_LABEL (gimple_switch_label (entry, i));
929 basic_block label_bb = label_to_block (lab);
930 make_edge (bb, label_bb, 0);
931 assign_discriminator (entry_locus, label_bb);
936 /* Return the basic block holding label DEST. */
939 label_to_block_fn (struct function *ifun, tree dest)
941 int uid = LABEL_DECL_UID (dest);
943 /* We would die hard when faced by an undefined label. Emit a label to
944 the very first basic block. This will hopefully make even the dataflow
945 and undefined variable warnings quite right. */
946 if ((errorcount || sorrycount) && uid < 0)
948 gimple_stmt_iterator gsi = gsi_start_bb (BASIC_BLOCK (NUM_FIXED_BLOCKS));
951 stmt = gimple_build_label (dest);
952 gsi_insert_before (&gsi, stmt, GSI_NEW_STMT);
953 uid = LABEL_DECL_UID (dest);
955 if (VEC_length (basic_block, ifun->cfg->x_label_to_block_map)
956 <= (unsigned int) uid)
958 return VEC_index (basic_block, ifun->cfg->x_label_to_block_map, uid);
961 /* Create edges for an abnormal goto statement at block BB. If FOR_CALL
962 is true, the source statement is a CALL_EXPR instead of a GOTO_EXPR. */
965 make_abnormal_goto_edges (basic_block bb, bool for_call)
967 basic_block target_bb;
968 gimple_stmt_iterator gsi;
970 FOR_EACH_BB (target_bb)
971 for (gsi = gsi_start_bb (target_bb); !gsi_end_p (gsi); gsi_next (&gsi))
973 gimple label_stmt = gsi_stmt (gsi);
976 if (gimple_code (label_stmt) != GIMPLE_LABEL)
979 target = gimple_label_label (label_stmt);
981 /* Make an edge to every label block that has been marked as a
982 potential target for a computed goto or a non-local goto. */
983 if ((FORCED_LABEL (target) && !for_call)
984 || (DECL_NONLOCAL (target) && for_call))
986 make_edge (bb, target_bb, EDGE_ABNORMAL);
992 /* Create edges for a goto statement at block BB. */
995 make_goto_expr_edges (basic_block bb)
997 gimple_stmt_iterator last = gsi_last_bb (bb);
998 gimple goto_t = gsi_stmt (last);
1000 /* A simple GOTO creates normal edges. */
1001 if (simple_goto_p (goto_t))
1003 tree dest = gimple_goto_dest (goto_t);
1004 basic_block label_bb = label_to_block (dest);
1005 edge e = make_edge (bb, label_bb, EDGE_FALLTHRU);
1006 e->goto_locus = gimple_location (goto_t);
1007 assign_discriminator (e->goto_locus, label_bb);
1009 e->goto_block = gimple_block (goto_t);
1010 gsi_remove (&last, true);
1014 /* A computed GOTO creates abnormal edges. */
1015 make_abnormal_goto_edges (bb, false);
1018 /* Create edges for an asm statement with labels at block BB. */
1021 make_gimple_asm_edges (basic_block bb)
1023 gimple stmt = last_stmt (bb);
1024 location_t stmt_loc = gimple_location (stmt);
1025 int i, n = gimple_asm_nlabels (stmt);
1027 for (i = 0; i < n; ++i)
1029 tree label = TREE_VALUE (gimple_asm_label_op (stmt, i));
1030 basic_block label_bb = label_to_block (label);
1031 make_edge (bb, label_bb, 0);
1032 assign_discriminator (stmt_loc, label_bb);
1036 /*---------------------------------------------------------------------------
1038 ---------------------------------------------------------------------------*/
1040 /* Cleanup useless labels in basic blocks. This is something we wish
1041 to do early because it allows us to group case labels before creating
1042 the edges for the CFG, and it speeds up block statement iterators in
1043 all passes later on.
1044 We rerun this pass after CFG is created, to get rid of the labels that
1045 are no longer referenced. After then we do not run it any more, since
1046 (almost) no new labels should be created. */
1048 /* A map from basic block index to the leading label of that block. */
1049 static struct label_record
1054 /* True if the label is referenced from somewhere. */
1058 /* Given LABEL return the first label in the same basic block. */
1061 main_block_label (tree label)
1063 basic_block bb = label_to_block (label);
1064 tree main_label = label_for_bb[bb->index].label;
1066 /* label_to_block possibly inserted undefined label into the chain. */
1069 label_for_bb[bb->index].label = label;
1073 label_for_bb[bb->index].used = true;
1077 /* Clean up redundant labels within the exception tree. */
1080 cleanup_dead_labels_eh (void)
1087 if (cfun->eh == NULL)
1090 for (i = 1; VEC_iterate (eh_landing_pad, cfun->eh->lp_array, i, lp); ++i)
1091 if (lp && lp->post_landing_pad)
1093 lab = main_block_label (lp->post_landing_pad);
1094 if (lab != lp->post_landing_pad)
1096 EH_LANDING_PAD_NR (lp->post_landing_pad) = 0;
1097 EH_LANDING_PAD_NR (lab) = lp->index;
1101 FOR_ALL_EH_REGION (r)
1105 case ERT_MUST_NOT_THROW:
1111 for (c = r->u.eh_try.first_catch; c ; c = c->next_catch)
1115 c->label = main_block_label (lab);
1120 case ERT_ALLOWED_EXCEPTIONS:
1121 lab = r->u.allowed.label;
1123 r->u.allowed.label = main_block_label (lab);
1129 /* Cleanup redundant labels. This is a three-step process:
1130 1) Find the leading label for each block.
1131 2) Redirect all references to labels to the leading labels.
1132 3) Cleanup all useless labels. */
1135 cleanup_dead_labels (void)
1138 label_for_bb = XCNEWVEC (struct label_record, last_basic_block);
1140 /* Find a suitable label for each block. We use the first user-defined
1141 label if there is one, or otherwise just the first label we see. */
1144 gimple_stmt_iterator i;
1146 for (i = gsi_start_bb (bb); !gsi_end_p (i); gsi_next (&i))
1149 gimple stmt = gsi_stmt (i);
1151 if (gimple_code (stmt) != GIMPLE_LABEL)
1154 label = gimple_label_label (stmt);
1156 /* If we have not yet seen a label for the current block,
1157 remember this one and see if there are more labels. */
1158 if (!label_for_bb[bb->index].label)
1160 label_for_bb[bb->index].label = label;
1164 /* If we did see a label for the current block already, but it
1165 is an artificially created label, replace it if the current
1166 label is a user defined label. */
1167 if (!DECL_ARTIFICIAL (label)
1168 && DECL_ARTIFICIAL (label_for_bb[bb->index].label))
1170 label_for_bb[bb->index].label = label;
1176 /* Now redirect all jumps/branches to the selected label.
1177 First do so for each block ending in a control statement. */
1180 gimple stmt = last_stmt (bb);
1184 switch (gimple_code (stmt))
1188 tree true_label = gimple_cond_true_label (stmt);
1189 tree false_label = gimple_cond_false_label (stmt);
1192 gimple_cond_set_true_label (stmt, main_block_label (true_label));
1194 gimple_cond_set_false_label (stmt, main_block_label (false_label));
1200 size_t i, n = gimple_switch_num_labels (stmt);
1202 /* Replace all destination labels. */
1203 for (i = 0; i < n; ++i)
1205 tree case_label = gimple_switch_label (stmt, i);
1206 tree label = main_block_label (CASE_LABEL (case_label));
1207 CASE_LABEL (case_label) = label;
1214 int i, n = gimple_asm_nlabels (stmt);
1216 for (i = 0; i < n; ++i)
1218 tree cons = gimple_asm_label_op (stmt, i);
1219 tree label = main_block_label (TREE_VALUE (cons));
1220 TREE_VALUE (cons) = label;
1225 /* We have to handle gotos until they're removed, and we don't
1226 remove them until after we've created the CFG edges. */
1228 if (!computed_goto_p (stmt))
1230 tree new_dest = main_block_label (gimple_goto_dest (stmt));
1231 gimple_goto_set_dest (stmt, new_dest);
1240 /* Do the same for the exception region tree labels. */
1241 cleanup_dead_labels_eh ();
1243 /* Finally, purge dead labels. All user-defined labels and labels that
1244 can be the target of non-local gotos and labels which have their
1245 address taken are preserved. */
1248 gimple_stmt_iterator i;
1249 tree label_for_this_bb = label_for_bb[bb->index].label;
1251 if (!label_for_this_bb)
1254 /* If the main label of the block is unused, we may still remove it. */
1255 if (!label_for_bb[bb->index].used)
1256 label_for_this_bb = NULL;
1258 for (i = gsi_start_bb (bb); !gsi_end_p (i); )
1261 gimple stmt = gsi_stmt (i);
1263 if (gimple_code (stmt) != GIMPLE_LABEL)
1266 label = gimple_label_label (stmt);
1268 if (label == label_for_this_bb
1269 || !DECL_ARTIFICIAL (label)
1270 || DECL_NONLOCAL (label)
1271 || FORCED_LABEL (label))
1274 gsi_remove (&i, true);
1278 free (label_for_bb);
1281 /* Look for blocks ending in a multiway branch (a SWITCH_EXPR in GIMPLE),
1282 and scan the sorted vector of cases. Combine the ones jumping to the
1284 Eg. three separate entries 1: 2: 3: become one entry 1..3: */
1287 group_case_labels (void)
1293 gimple stmt = last_stmt (bb);
1294 if (stmt && gimple_code (stmt) == GIMPLE_SWITCH)
1296 int old_size = gimple_switch_num_labels (stmt);
1297 int i, j, new_size = old_size;
1298 tree default_case = NULL_TREE;
1299 tree default_label = NULL_TREE;
1302 /* The default label is always the first case in a switch
1303 statement after gimplification if it was not optimized
1305 if (!CASE_LOW (gimple_switch_default_label (stmt))
1306 && !CASE_HIGH (gimple_switch_default_label (stmt)))
1308 default_case = gimple_switch_default_label (stmt);
1309 default_label = CASE_LABEL (default_case);
1313 has_default = false;
1315 /* Look for possible opportunities to merge cases. */
1320 while (i < old_size)
1322 tree base_case, base_label, base_high;
1323 base_case = gimple_switch_label (stmt, i);
1325 gcc_assert (base_case);
1326 base_label = CASE_LABEL (base_case);
1328 /* Discard cases that have the same destination as the
1330 if (base_label == default_label)
1332 gimple_switch_set_label (stmt, i, NULL_TREE);
1338 base_high = CASE_HIGH (base_case)
1339 ? CASE_HIGH (base_case)
1340 : CASE_LOW (base_case);
1343 /* Try to merge case labels. Break out when we reach the end
1344 of the label vector or when we cannot merge the next case
1345 label with the current one. */
1346 while (i < old_size)
1348 tree merge_case = gimple_switch_label (stmt, i);
1349 tree merge_label = CASE_LABEL (merge_case);
1350 tree t = int_const_binop (PLUS_EXPR, base_high,
1351 integer_one_node, 1);
1353 /* Merge the cases if they jump to the same place,
1354 and their ranges are consecutive. */
1355 if (merge_label == base_label
1356 && tree_int_cst_equal (CASE_LOW (merge_case), t))
1358 base_high = CASE_HIGH (merge_case) ?
1359 CASE_HIGH (merge_case) : CASE_LOW (merge_case);
1360 CASE_HIGH (base_case) = base_high;
1361 gimple_switch_set_label (stmt, i, NULL_TREE);
1370 /* Compress the case labels in the label vector, and adjust the
1371 length of the vector. */
1372 for (i = 0, j = 0; i < new_size; i++)
1374 while (! gimple_switch_label (stmt, j))
1376 gimple_switch_set_label (stmt, i,
1377 gimple_switch_label (stmt, j++));
1380 gcc_assert (new_size <= old_size);
1381 gimple_switch_set_num_labels (stmt, new_size);
1386 /* Checks whether we can merge block B into block A. */
1389 gimple_can_merge_blocks_p (basic_block a, basic_block b)
1392 gimple_stmt_iterator gsi;
1395 if (!single_succ_p (a))
1398 if (single_succ_edge (a)->flags & (EDGE_ABNORMAL | EDGE_EH))
1401 if (single_succ (a) != b)
1404 if (!single_pred_p (b))
1407 if (b == EXIT_BLOCK_PTR)
1410 /* If A ends by a statement causing exceptions or something similar, we
1411 cannot merge the blocks. */
1412 stmt = last_stmt (a);
1413 if (stmt && stmt_ends_bb_p (stmt))
1416 /* Do not allow a block with only a non-local label to be merged. */
1418 && gimple_code (stmt) == GIMPLE_LABEL
1419 && DECL_NONLOCAL (gimple_label_label (stmt)))
1422 /* Examine the labels at the beginning of B. */
1423 for (gsi = gsi_start_bb (b); !gsi_end_p (gsi); gsi_next (&gsi))
1426 stmt = gsi_stmt (gsi);
1427 if (gimple_code (stmt) != GIMPLE_LABEL)
1429 lab = gimple_label_label (stmt);
1431 /* Do not remove user labels. */
1432 if (!DECL_ARTIFICIAL (lab))
1436 /* Protect the loop latches. */
1437 if (current_loops && b->loop_father->latch == b)
1440 /* It must be possible to eliminate all phi nodes in B. If ssa form
1441 is not up-to-date, we cannot eliminate any phis; however, if only
1442 some symbols as whole are marked for renaming, this is not a problem,
1443 as phi nodes for those symbols are irrelevant in updating anyway. */
1444 phis = phi_nodes (b);
1445 if (!gimple_seq_empty_p (phis))
1447 gimple_stmt_iterator i;
1449 if (name_mappings_registered_p ())
1452 for (i = gsi_start (phis); !gsi_end_p (i); gsi_next (&i))
1454 gimple phi = gsi_stmt (i);
1456 if (!is_gimple_reg (gimple_phi_result (phi))
1457 && !may_propagate_copy (gimple_phi_result (phi),
1458 gimple_phi_arg_def (phi, 0)))
1466 /* Return true if the var whose chain of uses starts at PTR has no
1469 has_zero_uses_1 (const ssa_use_operand_t *head)
1471 const ssa_use_operand_t *ptr;
1473 for (ptr = head->next; ptr != head; ptr = ptr->next)
1474 if (!is_gimple_debug (USE_STMT (ptr)))
1480 /* Return true if the var whose chain of uses starts at PTR has a
1481 single nondebug use. Set USE_P and STMT to that single nondebug
1482 use, if so, or to NULL otherwise. */
1484 single_imm_use_1 (const ssa_use_operand_t *head,
1485 use_operand_p *use_p, gimple *stmt)
1487 ssa_use_operand_t *ptr, *single_use = 0;
1489 for (ptr = head->next; ptr != head; ptr = ptr->next)
1490 if (!is_gimple_debug (USE_STMT (ptr)))
1501 *use_p = single_use;
1504 *stmt = single_use ? single_use->loc.stmt : NULL;
1506 return !!single_use;
1509 /* Replaces all uses of NAME by VAL. */
1512 replace_uses_by (tree name, tree val)
1514 imm_use_iterator imm_iter;
1519 FOR_EACH_IMM_USE_STMT (stmt, imm_iter, name)
1521 FOR_EACH_IMM_USE_ON_STMT (use, imm_iter)
1523 replace_exp (use, val);
1525 if (gimple_code (stmt) == GIMPLE_PHI)
1527 e = gimple_phi_arg_edge (stmt, PHI_ARG_INDEX_FROM_USE (use));
1528 if (e->flags & EDGE_ABNORMAL)
1530 /* This can only occur for virtual operands, since
1531 for the real ones SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name))
1532 would prevent replacement. */
1533 gcc_assert (!is_gimple_reg (name));
1534 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (val) = 1;
1539 if (gimple_code (stmt) != GIMPLE_PHI)
1543 fold_stmt_inplace (stmt);
1544 if (cfgcleanup_altered_bbs)
1545 bitmap_set_bit (cfgcleanup_altered_bbs, gimple_bb (stmt)->index);
1547 /* FIXME. This should go in update_stmt. */
1548 for (i = 0; i < gimple_num_ops (stmt); i++)
1550 tree op = gimple_op (stmt, i);
1551 /* Operands may be empty here. For example, the labels
1552 of a GIMPLE_COND are nulled out following the creation
1553 of the corresponding CFG edges. */
1554 if (op && TREE_CODE (op) == ADDR_EXPR)
1555 recompute_tree_invariant_for_addr_expr (op);
1558 maybe_clean_or_replace_eh_stmt (stmt, stmt);
1563 gcc_assert (has_zero_uses (name));
1565 /* Also update the trees stored in loop structures. */
1571 FOR_EACH_LOOP (li, loop, 0)
1573 substitute_in_loop_info (loop, name, val);
1578 /* Merge block B into block A. */
1581 gimple_merge_blocks (basic_block a, basic_block b)
1583 gimple_stmt_iterator last, gsi, psi;
1584 gimple_seq phis = phi_nodes (b);
1587 fprintf (dump_file, "Merging blocks %d and %d\n", a->index, b->index);
1589 /* Remove all single-valued PHI nodes from block B of the form
1590 V_i = PHI <V_j> by propagating V_j to all the uses of V_i. */
1591 gsi = gsi_last_bb (a);
1592 for (psi = gsi_start (phis); !gsi_end_p (psi); )
1594 gimple phi = gsi_stmt (psi);
1595 tree def = gimple_phi_result (phi), use = gimple_phi_arg_def (phi, 0);
1597 bool may_replace_uses = !is_gimple_reg (def)
1598 || may_propagate_copy (def, use);
1600 /* In case we maintain loop closed ssa form, do not propagate arguments
1601 of loop exit phi nodes. */
1603 && loops_state_satisfies_p (LOOP_CLOSED_SSA)
1604 && is_gimple_reg (def)
1605 && TREE_CODE (use) == SSA_NAME
1606 && a->loop_father != b->loop_father)
1607 may_replace_uses = false;
1609 if (!may_replace_uses)
1611 gcc_assert (is_gimple_reg (def));
1613 /* Note that just emitting the copies is fine -- there is no problem
1614 with ordering of phi nodes. This is because A is the single
1615 predecessor of B, therefore results of the phi nodes cannot
1616 appear as arguments of the phi nodes. */
1617 copy = gimple_build_assign (def, use);
1618 gsi_insert_after (&gsi, copy, GSI_NEW_STMT);
1619 remove_phi_node (&psi, false);
1623 /* If we deal with a PHI for virtual operands, we can simply
1624 propagate these without fussing with folding or updating
1626 if (!is_gimple_reg (def))
1628 imm_use_iterator iter;
1629 use_operand_p use_p;
1632 FOR_EACH_IMM_USE_STMT (stmt, iter, def)
1633 FOR_EACH_IMM_USE_ON_STMT (use_p, iter)
1634 SET_USE (use_p, use);
1637 replace_uses_by (def, use);
1639 remove_phi_node (&psi, true);
1643 /* Ensure that B follows A. */
1644 move_block_after (b, a);
1646 gcc_assert (single_succ_edge (a)->flags & EDGE_FALLTHRU);
1647 gcc_assert (!last_stmt (a) || !stmt_ends_bb_p (last_stmt (a)));
1649 /* Remove labels from B and set gimple_bb to A for other statements. */
1650 for (gsi = gsi_start_bb (b); !gsi_end_p (gsi);)
1652 gimple stmt = gsi_stmt (gsi);
1653 if (gimple_code (stmt) == GIMPLE_LABEL)
1655 tree label = gimple_label_label (stmt);
1658 gsi_remove (&gsi, false);
1660 /* Now that we can thread computed gotos, we might have
1661 a situation where we have a forced label in block B
1662 However, the label at the start of block B might still be
1663 used in other ways (think about the runtime checking for
1664 Fortran assigned gotos). So we can not just delete the
1665 label. Instead we move the label to the start of block A. */
1666 if (FORCED_LABEL (label))
1668 gimple_stmt_iterator dest_gsi = gsi_start_bb (a);
1669 gsi_insert_before (&dest_gsi, stmt, GSI_NEW_STMT);
1672 lp_nr = EH_LANDING_PAD_NR (label);
1675 eh_landing_pad lp = get_eh_landing_pad_from_number (lp_nr);
1676 lp->post_landing_pad = NULL;
1681 gimple_set_bb (stmt, a);
1686 /* Merge the sequences. */
1687 last = gsi_last_bb (a);
1688 gsi_insert_seq_after (&last, bb_seq (b), GSI_NEW_STMT);
1689 set_bb_seq (b, NULL);
1691 if (cfgcleanup_altered_bbs)
1692 bitmap_set_bit (cfgcleanup_altered_bbs, a->index);
1696 /* Return the one of two successors of BB that is not reachable by a
1697 complex edge, if there is one. Else, return BB. We use
1698 this in optimizations that use post-dominators for their heuristics,
1699 to catch the cases in C++ where function calls are involved. */
1702 single_noncomplex_succ (basic_block bb)
1705 if (EDGE_COUNT (bb->succs) != 2)
1708 e0 = EDGE_SUCC (bb, 0);
1709 e1 = EDGE_SUCC (bb, 1);
1710 if (e0->flags & EDGE_COMPLEX)
1712 if (e1->flags & EDGE_COMPLEX)
1718 /* T is CALL_EXPR. Set current_function_calls_* flags. */
1721 notice_special_calls (gimple call)
1723 int flags = gimple_call_flags (call);
1725 if (flags & ECF_MAY_BE_ALLOCA)
1726 cfun->calls_alloca = true;
1727 if (flags & ECF_RETURNS_TWICE)
1728 cfun->calls_setjmp = true;
1732 /* Clear flags set by notice_special_calls. Used by dead code removal
1733 to update the flags. */
1736 clear_special_calls (void)
1738 cfun->calls_alloca = false;
1739 cfun->calls_setjmp = false;
1742 /* Remove PHI nodes associated with basic block BB and all edges out of BB. */
1745 remove_phi_nodes_and_edges_for_unreachable_block (basic_block bb)
1747 /* Since this block is no longer reachable, we can just delete all
1748 of its PHI nodes. */
1749 remove_phi_nodes (bb);
1751 /* Remove edges to BB's successors. */
1752 while (EDGE_COUNT (bb->succs) > 0)
1753 remove_edge (EDGE_SUCC (bb, 0));
1757 /* Remove statements of basic block BB. */
1760 remove_bb (basic_block bb)
1762 gimple_stmt_iterator i;
1766 fprintf (dump_file, "Removing basic block %d\n", bb->index);
1767 if (dump_flags & TDF_DETAILS)
1769 dump_bb (bb, dump_file, 0);
1770 fprintf (dump_file, "\n");
1776 struct loop *loop = bb->loop_father;
1778 /* If a loop gets removed, clean up the information associated
1780 if (loop->latch == bb
1781 || loop->header == bb)
1782 free_numbers_of_iterations_estimates_loop (loop);
1785 /* Remove all the instructions in the block. */
1786 if (bb_seq (bb) != NULL)
1788 /* Walk backwards so as to get a chance to substitute all
1789 released DEFs into debug stmts. See
1790 eliminate_unnecessary_stmts() in tree-ssa-dce.c for more
1792 for (i = gsi_last_bb (bb); !gsi_end_p (i);)
1794 gimple stmt = gsi_stmt (i);
1795 if (gimple_code (stmt) == GIMPLE_LABEL
1796 && (FORCED_LABEL (gimple_label_label (stmt))
1797 || DECL_NONLOCAL (gimple_label_label (stmt))))
1800 gimple_stmt_iterator new_gsi;
1802 /* A non-reachable non-local label may still be referenced.
1803 But it no longer needs to carry the extra semantics of
1805 if (DECL_NONLOCAL (gimple_label_label (stmt)))
1807 DECL_NONLOCAL (gimple_label_label (stmt)) = 0;
1808 FORCED_LABEL (gimple_label_label (stmt)) = 1;
1811 new_bb = bb->prev_bb;
1812 new_gsi = gsi_start_bb (new_bb);
1813 gsi_remove (&i, false);
1814 gsi_insert_before (&new_gsi, stmt, GSI_NEW_STMT);
1818 /* Release SSA definitions if we are in SSA. Note that we
1819 may be called when not in SSA. For example,
1820 final_cleanup calls this function via
1821 cleanup_tree_cfg. */
1822 if (gimple_in_ssa_p (cfun))
1823 release_defs (stmt);
1825 gsi_remove (&i, true);
1829 i = gsi_last_bb (bb);
1835 remove_phi_nodes_and_edges_for_unreachable_block (bb);
1836 bb->il.gimple = NULL;
1840 /* Given a basic block BB ending with COND_EXPR or SWITCH_EXPR, and a
1841 predicate VAL, return the edge that will be taken out of the block.
1842 If VAL does not match a unique edge, NULL is returned. */
1845 find_taken_edge (basic_block bb, tree val)
1849 stmt = last_stmt (bb);
1852 gcc_assert (is_ctrl_stmt (stmt));
1857 if (!is_gimple_min_invariant (val))
1860 if (gimple_code (stmt) == GIMPLE_COND)
1861 return find_taken_edge_cond_expr (bb, val);
1863 if (gimple_code (stmt) == GIMPLE_SWITCH)
1864 return find_taken_edge_switch_expr (bb, val);
1866 if (computed_goto_p (stmt))
1868 /* Only optimize if the argument is a label, if the argument is
1869 not a label then we can not construct a proper CFG.
1871 It may be the case that we only need to allow the LABEL_REF to
1872 appear inside an ADDR_EXPR, but we also allow the LABEL_REF to
1873 appear inside a LABEL_EXPR just to be safe. */
1874 if ((TREE_CODE (val) == ADDR_EXPR || TREE_CODE (val) == LABEL_EXPR)
1875 && TREE_CODE (TREE_OPERAND (val, 0)) == LABEL_DECL)
1876 return find_taken_edge_computed_goto (bb, TREE_OPERAND (val, 0));
1883 /* Given a constant value VAL and the entry block BB to a GOTO_EXPR
1884 statement, determine which of the outgoing edges will be taken out of the
1885 block. Return NULL if either edge may be taken. */
1888 find_taken_edge_computed_goto (basic_block bb, tree val)
1893 dest = label_to_block (val);
1896 e = find_edge (bb, dest);
1897 gcc_assert (e != NULL);
1903 /* Given a constant value VAL and the entry block BB to a COND_EXPR
1904 statement, determine which of the two edges will be taken out of the
1905 block. Return NULL if either edge may be taken. */
1908 find_taken_edge_cond_expr (basic_block bb, tree val)
1910 edge true_edge, false_edge;
1912 extract_true_false_edges_from_block (bb, &true_edge, &false_edge);
1914 gcc_assert (TREE_CODE (val) == INTEGER_CST);
1915 return (integer_zerop (val) ? false_edge : true_edge);
1918 /* Given an INTEGER_CST VAL and the entry block BB to a SWITCH_EXPR
1919 statement, determine which edge will be taken out of the block. Return
1920 NULL if any edge may be taken. */
1923 find_taken_edge_switch_expr (basic_block bb, tree val)
1925 basic_block dest_bb;
1930 switch_stmt = last_stmt (bb);
1931 taken_case = find_case_label_for_value (switch_stmt, val);
1932 dest_bb = label_to_block (CASE_LABEL (taken_case));
1934 e = find_edge (bb, dest_bb);
1940 /* Return the CASE_LABEL_EXPR that SWITCH_STMT will take for VAL.
1941 We can make optimal use here of the fact that the case labels are
1942 sorted: We can do a binary search for a case matching VAL. */
1945 find_case_label_for_value (gimple switch_stmt, tree val)
1947 size_t low, high, n = gimple_switch_num_labels (switch_stmt);
1948 tree default_case = gimple_switch_default_label (switch_stmt);
1950 for (low = 0, high = n; high - low > 1; )
1952 size_t i = (high + low) / 2;
1953 tree t = gimple_switch_label (switch_stmt, i);
1956 /* Cache the result of comparing CASE_LOW and val. */
1957 cmp = tree_int_cst_compare (CASE_LOW (t), val);
1964 if (CASE_HIGH (t) == NULL)
1966 /* A singe-valued case label. */
1972 /* A case range. We can only handle integer ranges. */
1973 if (cmp <= 0 && tree_int_cst_compare (CASE_HIGH (t), val) >= 0)
1978 return default_case;
1982 /* Dump a basic block on stderr. */
1985 gimple_debug_bb (basic_block bb)
1987 gimple_dump_bb (bb, stderr, 0, TDF_VOPS|TDF_MEMSYMS);
1991 /* Dump basic block with index N on stderr. */
1994 gimple_debug_bb_n (int n)
1996 gimple_debug_bb (BASIC_BLOCK (n));
1997 return BASIC_BLOCK (n);
2001 /* Dump the CFG on stderr.
2003 FLAGS are the same used by the tree dumping functions
2004 (see TDF_* in tree-pass.h). */
2007 gimple_debug_cfg (int flags)
2009 gimple_dump_cfg (stderr, flags);
2013 /* Dump the program showing basic block boundaries on the given FILE.
2015 FLAGS are the same used by the tree dumping functions (see TDF_* in
2019 gimple_dump_cfg (FILE *file, int flags)
2021 if (flags & TDF_DETAILS)
2023 const char *funcname
2024 = lang_hooks.decl_printable_name (current_function_decl, 2);
2027 fprintf (file, ";; Function %s\n\n", funcname);
2028 fprintf (file, ";; \n%d basic blocks, %d edges, last basic block %d.\n\n",
2029 n_basic_blocks, n_edges, last_basic_block);
2031 brief_dump_cfg (file);
2032 fprintf (file, "\n");
2035 if (flags & TDF_STATS)
2036 dump_cfg_stats (file);
2038 dump_function_to_file (current_function_decl, file, flags | TDF_BLOCKS);
2042 /* Dump CFG statistics on FILE. */
2045 dump_cfg_stats (FILE *file)
2047 static long max_num_merged_labels = 0;
2048 unsigned long size, total = 0;
2051 const char * const fmt_str = "%-30s%-13s%12s\n";
2052 const char * const fmt_str_1 = "%-30s%13d%11lu%c\n";
2053 const char * const fmt_str_2 = "%-30s%13ld%11lu%c\n";
2054 const char * const fmt_str_3 = "%-43s%11lu%c\n";
2055 const char *funcname
2056 = lang_hooks.decl_printable_name (current_function_decl, 2);
2059 fprintf (file, "\nCFG Statistics for %s\n\n", funcname);
2061 fprintf (file, "---------------------------------------------------------\n");
2062 fprintf (file, fmt_str, "", " Number of ", "Memory");
2063 fprintf (file, fmt_str, "", " instances ", "used ");
2064 fprintf (file, "---------------------------------------------------------\n");
2066 size = n_basic_blocks * sizeof (struct basic_block_def);
2068 fprintf (file, fmt_str_1, "Basic blocks", n_basic_blocks,
2069 SCALE (size), LABEL (size));
2073 num_edges += EDGE_COUNT (bb->succs);
2074 size = num_edges * sizeof (struct edge_def);
2076 fprintf (file, fmt_str_2, "Edges", num_edges, SCALE (size), LABEL (size));
2078 fprintf (file, "---------------------------------------------------------\n");
2079 fprintf (file, fmt_str_3, "Total memory used by CFG data", SCALE (total),
2081 fprintf (file, "---------------------------------------------------------\n");
2082 fprintf (file, "\n");
2084 if (cfg_stats.num_merged_labels > max_num_merged_labels)
2085 max_num_merged_labels = cfg_stats.num_merged_labels;
2087 fprintf (file, "Coalesced label blocks: %ld (Max so far: %ld)\n",
2088 cfg_stats.num_merged_labels, max_num_merged_labels);
2090 fprintf (file, "\n");
2094 /* Dump CFG statistics on stderr. Keep extern so that it's always
2095 linked in the final executable. */
2098 debug_cfg_stats (void)
2100 dump_cfg_stats (stderr);
2104 /* Dump the flowgraph to a .vcg FILE. */
2107 gimple_cfg2vcg (FILE *file)
2112 const char *funcname
2113 = lang_hooks.decl_printable_name (current_function_decl, 2);
2115 /* Write the file header. */
2116 fprintf (file, "graph: { title: \"%s\"\n", funcname);
2117 fprintf (file, "node: { title: \"ENTRY\" label: \"ENTRY\" }\n");
2118 fprintf (file, "node: { title: \"EXIT\" label: \"EXIT\" }\n");
2120 /* Write blocks and edges. */
2121 FOR_EACH_EDGE (e, ei, ENTRY_BLOCK_PTR->succs)
2123 fprintf (file, "edge: { sourcename: \"ENTRY\" targetname: \"%d\"",
2126 if (e->flags & EDGE_FAKE)
2127 fprintf (file, " linestyle: dotted priority: 10");
2129 fprintf (file, " linestyle: solid priority: 100");
2131 fprintf (file, " }\n");
2137 enum gimple_code head_code, end_code;
2138 const char *head_name, *end_name;
2141 gimple first = first_stmt (bb);
2142 gimple last = last_stmt (bb);
2146 head_code = gimple_code (first);
2147 head_name = gimple_code_name[head_code];
2148 head_line = get_lineno (first);
2151 head_name = "no-statement";
2155 end_code = gimple_code (last);
2156 end_name = gimple_code_name[end_code];
2157 end_line = get_lineno (last);
2160 end_name = "no-statement";
2162 fprintf (file, "node: { title: \"%d\" label: \"#%d\\n%s (%d)\\n%s (%d)\"}\n",
2163 bb->index, bb->index, head_name, head_line, end_name,
2166 FOR_EACH_EDGE (e, ei, bb->succs)
2168 if (e->dest == EXIT_BLOCK_PTR)
2169 fprintf (file, "edge: { sourcename: \"%d\" targetname: \"EXIT\"", bb->index);
2171 fprintf (file, "edge: { sourcename: \"%d\" targetname: \"%d\"", bb->index, e->dest->index);
2173 if (e->flags & EDGE_FAKE)
2174 fprintf (file, " priority: 10 linestyle: dotted");
2176 fprintf (file, " priority: 100 linestyle: solid");
2178 fprintf (file, " }\n");
2181 if (bb->next_bb != EXIT_BLOCK_PTR)
2185 fputs ("}\n\n", file);
2190 /*---------------------------------------------------------------------------
2191 Miscellaneous helpers
2192 ---------------------------------------------------------------------------*/
2194 /* Return true if T represents a stmt that always transfers control. */
2197 is_ctrl_stmt (gimple t)
2199 switch (gimple_code (t))
2213 /* Return true if T is a statement that may alter the flow of control
2214 (e.g., a call to a non-returning function). */
2217 is_ctrl_altering_stmt (gimple t)
2221 switch (gimple_code (t))
2225 int flags = gimple_call_flags (t);
2227 /* A non-pure/const call alters flow control if the current
2228 function has nonlocal labels. */
2229 if (!(flags & (ECF_CONST | ECF_PURE)) && cfun->has_nonlocal_label)
2232 /* A call also alters control flow if it does not return. */
2233 if (gimple_call_flags (t) & ECF_NORETURN)
2238 case GIMPLE_EH_DISPATCH:
2239 /* EH_DISPATCH branches to the individual catch handlers at
2240 this level of a try or allowed-exceptions region. It can
2241 fallthru to the next statement as well. */
2245 if (gimple_asm_nlabels (t) > 0)
2250 /* OpenMP directives alter control flow. */
2257 /* If a statement can throw, it alters control flow. */
2258 return stmt_can_throw_internal (t);
2262 /* Return true if T is a simple local goto. */
2265 simple_goto_p (gimple t)
2267 return (gimple_code (t) == GIMPLE_GOTO
2268 && TREE_CODE (gimple_goto_dest (t)) == LABEL_DECL);
2272 /* Return true if T can make an abnormal transfer of control flow.
2273 Transfers of control flow associated with EH are excluded. */
2276 stmt_can_make_abnormal_goto (gimple t)
2278 if (computed_goto_p (t))
2280 if (is_gimple_call (t))
2281 return gimple_has_side_effects (t) && cfun->has_nonlocal_label;
2286 /* Return true if STMT should start a new basic block. PREV_STMT is
2287 the statement preceding STMT. It is used when STMT is a label or a
2288 case label. Labels should only start a new basic block if their
2289 previous statement wasn't a label. Otherwise, sequence of labels
2290 would generate unnecessary basic blocks that only contain a single
2294 stmt_starts_bb_p (gimple stmt, gimple prev_stmt)
2299 /* Labels start a new basic block only if the preceding statement
2300 wasn't a label of the same type. This prevents the creation of
2301 consecutive blocks that have nothing but a single label. */
2302 if (gimple_code (stmt) == GIMPLE_LABEL)
2304 /* Nonlocal and computed GOTO targets always start a new block. */
2305 if (DECL_NONLOCAL (gimple_label_label (stmt))
2306 || FORCED_LABEL (gimple_label_label (stmt)))
2309 if (prev_stmt && gimple_code (prev_stmt) == GIMPLE_LABEL)
2311 if (DECL_NONLOCAL (gimple_label_label (prev_stmt)))
2314 cfg_stats.num_merged_labels++;
2325 /* Return true if T should end a basic block. */
2328 stmt_ends_bb_p (gimple t)
2330 return is_ctrl_stmt (t) || is_ctrl_altering_stmt (t);
2333 /* Remove block annotations and other data structures. */
2336 delete_tree_cfg_annotations (void)
2338 label_to_block_map = NULL;
2342 /* Return the first statement in basic block BB. */
2345 first_stmt (basic_block bb)
2347 gimple_stmt_iterator i = gsi_start_bb (bb);
2350 while (!gsi_end_p (i) && is_gimple_debug ((stmt = gsi_stmt (i))))
2358 /* Return the first non-label statement in basic block BB. */
2361 first_non_label_stmt (basic_block bb)
2363 gimple_stmt_iterator i = gsi_start_bb (bb);
2364 while (!gsi_end_p (i) && gimple_code (gsi_stmt (i)) == GIMPLE_LABEL)
2366 return !gsi_end_p (i) ? gsi_stmt (i) : NULL;
2369 /* Return the last statement in basic block BB. */
2372 last_stmt (basic_block bb)
2374 gimple_stmt_iterator i = gsi_last_bb (bb);
2377 while (!gsi_end_p (i) && is_gimple_debug ((stmt = gsi_stmt (i))))
2385 /* Return the last statement of an otherwise empty block. Return NULL
2386 if the block is totally empty, or if it contains more than one
2390 last_and_only_stmt (basic_block bb)
2392 gimple_stmt_iterator i = gsi_last_nondebug_bb (bb);
2398 last = gsi_stmt (i);
2399 gsi_prev_nondebug (&i);
2403 /* Empty statements should no longer appear in the instruction stream.
2404 Everything that might have appeared before should be deleted by
2405 remove_useless_stmts, and the optimizers should just gsi_remove
2406 instead of smashing with build_empty_stmt.
2408 Thus the only thing that should appear here in a block containing
2409 one executable statement is a label. */
2410 prev = gsi_stmt (i);
2411 if (gimple_code (prev) == GIMPLE_LABEL)
2417 /* Reinstall those PHI arguments queued in OLD_EDGE to NEW_EDGE. */
2420 reinstall_phi_args (edge new_edge, edge old_edge)
2422 edge_var_map_vector v;
2425 gimple_stmt_iterator phis;
2427 v = redirect_edge_var_map_vector (old_edge);
2431 for (i = 0, phis = gsi_start_phis (new_edge->dest);
2432 VEC_iterate (edge_var_map, v, i, vm) && !gsi_end_p (phis);
2433 i++, gsi_next (&phis))
2435 gimple phi = gsi_stmt (phis);
2436 tree result = redirect_edge_var_map_result (vm);
2437 tree arg = redirect_edge_var_map_def (vm);
2439 gcc_assert (result == gimple_phi_result (phi));
2441 add_phi_arg (phi, arg, new_edge, redirect_edge_var_map_location (vm));
2444 redirect_edge_var_map_clear (old_edge);
2447 /* Returns the basic block after which the new basic block created
2448 by splitting edge EDGE_IN should be placed. Tries to keep the new block
2449 near its "logical" location. This is of most help to humans looking
2450 at debugging dumps. */
2453 split_edge_bb_loc (edge edge_in)
2455 basic_block dest = edge_in->dest;
2456 basic_block dest_prev = dest->prev_bb;
2460 edge e = find_edge (dest_prev, dest);
2461 if (e && !(e->flags & EDGE_COMPLEX))
2462 return edge_in->src;
2467 /* Split a (typically critical) edge EDGE_IN. Return the new block.
2468 Abort on abnormal edges. */
2471 gimple_split_edge (edge edge_in)
2473 basic_block new_bb, after_bb, dest;
2476 /* Abnormal edges cannot be split. */
2477 gcc_assert (!(edge_in->flags & EDGE_ABNORMAL));
2479 dest = edge_in->dest;
2481 after_bb = split_edge_bb_loc (edge_in);
2483 new_bb = create_empty_bb (after_bb);
2484 new_bb->frequency = EDGE_FREQUENCY (edge_in);
2485 new_bb->count = edge_in->count;
2486 new_edge = make_edge (new_bb, dest, EDGE_FALLTHRU);
2487 new_edge->probability = REG_BR_PROB_BASE;
2488 new_edge->count = edge_in->count;
2490 e = redirect_edge_and_branch (edge_in, new_bb);
2491 gcc_assert (e == edge_in);
2492 reinstall_phi_args (new_edge, e);
2497 /* Callback for walk_tree, check that all elements with address taken are
2498 properly noticed as such. The DATA is an int* that is 1 if TP was seen
2499 inside a PHI node. */
2502 verify_expr (tree *tp, int *walk_subtrees, void *data ATTRIBUTE_UNUSED)
2509 /* Check operand N for being valid GIMPLE and give error MSG if not. */
2510 #define CHECK_OP(N, MSG) \
2511 do { if (!is_gimple_val (TREE_OPERAND (t, N))) \
2512 { error (MSG); return TREE_OPERAND (t, N); }} while (0)
2514 switch (TREE_CODE (t))
2517 if (SSA_NAME_IN_FREE_LIST (t))
2519 error ("SSA name in freelist but still referenced");
2525 x = TREE_OPERAND (t, 0);
2526 if (!is_gimple_reg (x) && !is_gimple_min_invariant (x))
2528 error ("Indirect reference's operand is not a register or a constant.");
2534 x = fold (ASSERT_EXPR_COND (t));
2535 if (x == boolean_false_node)
2537 error ("ASSERT_EXPR with an always-false condition");
2543 error ("MODIFY_EXPR not expected while having tuples.");
2549 bool old_side_effects;
2551 bool new_side_effects;
2553 gcc_assert (is_gimple_address (t));
2555 old_constant = TREE_CONSTANT (t);
2556 old_side_effects = TREE_SIDE_EFFECTS (t);
2558 recompute_tree_invariant_for_addr_expr (t);
2559 new_side_effects = TREE_SIDE_EFFECTS (t);
2560 new_constant = TREE_CONSTANT (t);
2562 if (old_constant != new_constant)
2564 error ("constant not recomputed when ADDR_EXPR changed");
2567 if (old_side_effects != new_side_effects)
2569 error ("side effects not recomputed when ADDR_EXPR changed");
2573 /* Skip any references (they will be checked when we recurse down the
2574 tree) and ensure that any variable used as a prefix is marked
2576 for (x = TREE_OPERAND (t, 0);
2577 handled_component_p (x);
2578 x = TREE_OPERAND (x, 0))
2581 if (!(TREE_CODE (x) == VAR_DECL
2582 || TREE_CODE (x) == PARM_DECL
2583 || TREE_CODE (x) == RESULT_DECL))
2585 if (!TREE_ADDRESSABLE (x))
2587 error ("address taken, but ADDRESSABLE bit not set");
2590 if (DECL_GIMPLE_REG_P (x))
2592 error ("DECL_GIMPLE_REG_P set on a variable with address taken");
2600 x = COND_EXPR_COND (t);
2601 if (!INTEGRAL_TYPE_P (TREE_TYPE (x)))
2603 error ("non-integral used in condition");
2606 if (!is_gimple_condexpr (x))
2608 error ("invalid conditional operand");
2613 case NON_LVALUE_EXPR:
2617 case FIX_TRUNC_EXPR:
2622 case TRUTH_NOT_EXPR:
2623 CHECK_OP (0, "invalid operand to unary operator");
2630 case ARRAY_RANGE_REF:
2632 case VIEW_CONVERT_EXPR:
2633 /* We have a nest of references. Verify that each of the operands
2634 that determine where to reference is either a constant or a variable,
2635 verify that the base is valid, and then show we've already checked
2637 while (handled_component_p (t))
2639 if (TREE_CODE (t) == COMPONENT_REF && TREE_OPERAND (t, 2))
2640 CHECK_OP (2, "invalid COMPONENT_REF offset operator");
2641 else if (TREE_CODE (t) == ARRAY_REF
2642 || TREE_CODE (t) == ARRAY_RANGE_REF)
2644 CHECK_OP (1, "invalid array index");
2645 if (TREE_OPERAND (t, 2))
2646 CHECK_OP (2, "invalid array lower bound");
2647 if (TREE_OPERAND (t, 3))
2648 CHECK_OP (3, "invalid array stride");
2650 else if (TREE_CODE (t) == BIT_FIELD_REF)
2652 if (!host_integerp (TREE_OPERAND (t, 1), 1)
2653 || !host_integerp (TREE_OPERAND (t, 2), 1))
2655 error ("invalid position or size operand to BIT_FIELD_REF");
2658 else if (INTEGRAL_TYPE_P (TREE_TYPE (t))
2659 && (TYPE_PRECISION (TREE_TYPE (t))
2660 != TREE_INT_CST_LOW (TREE_OPERAND (t, 1))))
2662 error ("integral result type precision does not match "
2663 "field size of BIT_FIELD_REF");
2666 if (!INTEGRAL_TYPE_P (TREE_TYPE (t))
2667 && (GET_MODE_PRECISION (TYPE_MODE (TREE_TYPE (t)))
2668 != TREE_INT_CST_LOW (TREE_OPERAND (t, 1))))
2670 error ("mode precision of non-integral result does not "
2671 "match field size of BIT_FIELD_REF");
2676 t = TREE_OPERAND (t, 0);
2679 if (!is_gimple_min_invariant (t) && !is_gimple_lvalue (t))
2681 error ("invalid reference prefix");
2688 /* PLUS_EXPR and MINUS_EXPR don't work on pointers, they should be done using
2689 POINTER_PLUS_EXPR. */
2690 if (POINTER_TYPE_P (TREE_TYPE (t)))
2692 error ("invalid operand to plus/minus, type is a pointer");
2695 CHECK_OP (0, "invalid operand to binary operator");
2696 CHECK_OP (1, "invalid operand to binary operator");
2699 case POINTER_PLUS_EXPR:
2700 /* Check to make sure the first operand is a pointer or reference type. */
2701 if (!POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (t, 0))))
2703 error ("invalid operand to pointer plus, first operand is not a pointer");
2706 /* Check to make sure the second operand is an integer with type of
2708 if (!useless_type_conversion_p (sizetype,
2709 TREE_TYPE (TREE_OPERAND (t, 1))))
2711 error ("invalid operand to pointer plus, second operand is not an "
2712 "integer with type of sizetype.");
2722 case UNORDERED_EXPR:
2731 case TRUNC_DIV_EXPR:
2733 case FLOOR_DIV_EXPR:
2734 case ROUND_DIV_EXPR:
2735 case TRUNC_MOD_EXPR:
2737 case FLOOR_MOD_EXPR:
2738 case ROUND_MOD_EXPR:
2740 case EXACT_DIV_EXPR:
2750 CHECK_OP (0, "invalid operand to binary operator");
2751 CHECK_OP (1, "invalid operand to binary operator");
2755 if (TREE_CONSTANT (t) && TREE_CODE (TREE_TYPE (t)) == VECTOR_TYPE)
2768 /* Verify if EXPR is either a GIMPLE ID or a GIMPLE indirect reference.
2769 Returns true if there is an error, otherwise false. */
2772 verify_types_in_gimple_min_lval (tree expr)
2776 if (is_gimple_id (expr))
2779 if (!INDIRECT_REF_P (expr)
2780 && TREE_CODE (expr) != TARGET_MEM_REF)
2782 error ("invalid expression for min lvalue");
2786 /* TARGET_MEM_REFs are strange beasts. */
2787 if (TREE_CODE (expr) == TARGET_MEM_REF)
2790 op = TREE_OPERAND (expr, 0);
2791 if (!is_gimple_val (op))
2793 error ("invalid operand in indirect reference");
2794 debug_generic_stmt (op);
2797 if (!useless_type_conversion_p (TREE_TYPE (expr),
2798 TREE_TYPE (TREE_TYPE (op))))
2800 error ("type mismatch in indirect reference");
2801 debug_generic_stmt (TREE_TYPE (expr));
2802 debug_generic_stmt (TREE_TYPE (TREE_TYPE (op)));
2809 /* Verify if EXPR is a valid GIMPLE reference expression. If
2810 REQUIRE_LVALUE is true verifies it is an lvalue. Returns true
2811 if there is an error, otherwise false. */
2814 verify_types_in_gimple_reference (tree expr, bool require_lvalue)
2816 while (handled_component_p (expr))
2818 tree op = TREE_OPERAND (expr, 0);
2820 if (TREE_CODE (expr) == ARRAY_REF
2821 || TREE_CODE (expr) == ARRAY_RANGE_REF)
2823 if (!is_gimple_val (TREE_OPERAND (expr, 1))
2824 || (TREE_OPERAND (expr, 2)
2825 && !is_gimple_val (TREE_OPERAND (expr, 2)))
2826 || (TREE_OPERAND (expr, 3)
2827 && !is_gimple_val (TREE_OPERAND (expr, 3))))
2829 error ("invalid operands to array reference");
2830 debug_generic_stmt (expr);
2835 /* Verify if the reference array element types are compatible. */
2836 if (TREE_CODE (expr) == ARRAY_REF
2837 && !useless_type_conversion_p (TREE_TYPE (expr),
2838 TREE_TYPE (TREE_TYPE (op))))
2840 error ("type mismatch in array reference");
2841 debug_generic_stmt (TREE_TYPE (expr));
2842 debug_generic_stmt (TREE_TYPE (TREE_TYPE (op)));
2845 if (TREE_CODE (expr) == ARRAY_RANGE_REF
2846 && !useless_type_conversion_p (TREE_TYPE (TREE_TYPE (expr)),
2847 TREE_TYPE (TREE_TYPE (op))))
2849 error ("type mismatch in array range reference");
2850 debug_generic_stmt (TREE_TYPE (TREE_TYPE (expr)));
2851 debug_generic_stmt (TREE_TYPE (TREE_TYPE (op)));
2855 if ((TREE_CODE (expr) == REALPART_EXPR
2856 || TREE_CODE (expr) == IMAGPART_EXPR)
2857 && !useless_type_conversion_p (TREE_TYPE (expr),
2858 TREE_TYPE (TREE_TYPE (op))))
2860 error ("type mismatch in real/imagpart reference");
2861 debug_generic_stmt (TREE_TYPE (expr));
2862 debug_generic_stmt (TREE_TYPE (TREE_TYPE (op)));
2866 if (TREE_CODE (expr) == COMPONENT_REF
2867 && !useless_type_conversion_p (TREE_TYPE (expr),
2868 TREE_TYPE (TREE_OPERAND (expr, 1))))
2870 error ("type mismatch in component reference");
2871 debug_generic_stmt (TREE_TYPE (expr));
2872 debug_generic_stmt (TREE_TYPE (TREE_OPERAND (expr, 1)));
2876 if (TREE_CODE (expr) == VIEW_CONVERT_EXPR)
2878 /* For VIEW_CONVERT_EXPRs which are allowed here too, we only check
2879 that their operand is not an SSA name or an invariant when
2880 requiring an lvalue (this usually means there is a SRA or IPA-SRA
2881 bug). Otherwise there is nothing to verify, gross mismatches at
2882 most invoke undefined behavior. */
2884 && (TREE_CODE (op) == SSA_NAME
2885 || is_gimple_min_invariant (op)))
2887 error ("Conversion of an SSA_NAME on the left hand side.");
2888 debug_generic_stmt (expr);
2891 else if (!handled_component_p (op))
2898 return ((require_lvalue || !is_gimple_min_invariant (expr))
2899 && verify_types_in_gimple_min_lval (expr));
2902 /* Returns true if there is one pointer type in TYPE_POINTER_TO (SRC_OBJ)
2903 list of pointer-to types that is trivially convertible to DEST. */
2906 one_pointer_to_useless_type_conversion_p (tree dest, tree src_obj)
2910 if (!TYPE_POINTER_TO (src_obj))
2913 for (src = TYPE_POINTER_TO (src_obj); src; src = TYPE_NEXT_PTR_TO (src))
2914 if (useless_type_conversion_p (dest, src))
2920 /* Return true if TYPE1 is a fixed-point type and if conversions to and
2921 from TYPE2 can be handled by FIXED_CONVERT_EXPR. */
2924 valid_fixed_convert_types_p (tree type1, tree type2)
2926 return (FIXED_POINT_TYPE_P (type1)
2927 && (INTEGRAL_TYPE_P (type2)
2928 || SCALAR_FLOAT_TYPE_P (type2)
2929 || FIXED_POINT_TYPE_P (type2)));
2932 /* Verify the contents of a GIMPLE_CALL STMT. Returns true when there
2933 is a problem, otherwise false. */
2936 verify_gimple_call (gimple stmt)
2938 tree fn = gimple_call_fn (stmt);
2942 if (TREE_CODE (fn) != OBJ_TYPE_REF
2943 && !is_gimple_val (fn))
2945 error ("invalid function in gimple call");
2946 debug_generic_stmt (fn);
2950 if (!POINTER_TYPE_P (TREE_TYPE (fn))
2951 || (TREE_CODE (TREE_TYPE (TREE_TYPE (fn))) != FUNCTION_TYPE
2952 && TREE_CODE (TREE_TYPE (TREE_TYPE (fn))) != METHOD_TYPE))
2954 error ("non-function in gimple call");
2958 if (gimple_call_lhs (stmt)
2959 && (!is_gimple_lvalue (gimple_call_lhs (stmt))
2960 || verify_types_in_gimple_reference (gimple_call_lhs (stmt), true)))
2962 error ("invalid LHS in gimple call");
2966 fntype = TREE_TYPE (TREE_TYPE (fn));
2967 if (gimple_call_lhs (stmt)
2968 && !useless_type_conversion_p (TREE_TYPE (gimple_call_lhs (stmt)),
2970 /* ??? At least C++ misses conversions at assignments from
2971 void * call results.
2972 ??? Java is completely off. Especially with functions
2973 returning java.lang.Object.
2974 For now simply allow arbitrary pointer type conversions. */
2975 && !(POINTER_TYPE_P (TREE_TYPE (gimple_call_lhs (stmt)))
2976 && POINTER_TYPE_P (TREE_TYPE (fntype))))
2978 error ("invalid conversion in gimple call");
2979 debug_generic_stmt (TREE_TYPE (gimple_call_lhs (stmt)));
2980 debug_generic_stmt (TREE_TYPE (fntype));
2984 if (gimple_call_chain (stmt)
2985 && !is_gimple_val (gimple_call_chain (stmt)))
2987 error ("invalid static chain in gimple call");
2988 debug_generic_stmt (gimple_call_chain (stmt));
2992 /* If there is a static chain argument, this should not be an indirect
2993 call, and the decl should have DECL_STATIC_CHAIN set. */
2994 if (gimple_call_chain (stmt))
2996 if (TREE_CODE (fn) != ADDR_EXPR
2997 || TREE_CODE (TREE_OPERAND (fn, 0)) != FUNCTION_DECL)
2999 error ("static chain in indirect gimple call");
3002 fn = TREE_OPERAND (fn, 0);
3004 if (!DECL_STATIC_CHAIN (fn))
3006 error ("static chain with function that doesn't use one");
3011 /* ??? The C frontend passes unpromoted arguments in case it
3012 didn't see a function declaration before the call. So for now
3013 leave the call arguments mostly unverified. Once we gimplify
3014 unit-at-a-time we have a chance to fix this. */
3016 for (i = 0; i < gimple_call_num_args (stmt); ++i)
3018 tree arg = gimple_call_arg (stmt, i);
3019 if (!is_gimple_operand (arg))
3021 error ("invalid argument to gimple call");
3022 debug_generic_expr (arg);
3029 /* Verifies the gimple comparison with the result type TYPE and
3030 the operands OP0 and OP1. */
3033 verify_gimple_comparison (tree type, tree op0, tree op1)
3035 tree op0_type = TREE_TYPE (op0);
3036 tree op1_type = TREE_TYPE (op1);
3038 if (!is_gimple_val (op0) || !is_gimple_val (op1))
3040 error ("invalid operands in gimple comparison");
3044 /* For comparisons we do not have the operations type as the
3045 effective type the comparison is carried out in. Instead
3046 we require that either the first operand is trivially
3047 convertible into the second, or the other way around.
3048 The resulting type of a comparison may be any integral type.
3049 Because we special-case pointers to void we allow
3050 comparisons of pointers with the same mode as well. */
3051 if ((!useless_type_conversion_p (op0_type, op1_type)
3052 && !useless_type_conversion_p (op1_type, op0_type)
3053 && (!POINTER_TYPE_P (op0_type)
3054 || !POINTER_TYPE_P (op1_type)
3055 || TYPE_MODE (op0_type) != TYPE_MODE (op1_type)))
3056 || !INTEGRAL_TYPE_P (type))
3058 error ("type mismatch in comparison expression");
3059 debug_generic_expr (type);
3060 debug_generic_expr (op0_type);
3061 debug_generic_expr (op1_type);
3068 /* Verify a gimple assignment statement STMT with an unary rhs.
3069 Returns true if anything is wrong. */
3072 verify_gimple_assign_unary (gimple stmt)
3074 enum tree_code rhs_code = gimple_assign_rhs_code (stmt);
3075 tree lhs = gimple_assign_lhs (stmt);
3076 tree lhs_type = TREE_TYPE (lhs);
3077 tree rhs1 = gimple_assign_rhs1 (stmt);
3078 tree rhs1_type = TREE_TYPE (rhs1);
3080 if (!is_gimple_reg (lhs)
3082 && TREE_CODE (lhs_type) == COMPLEX_TYPE))
3084 error ("non-register as LHS of unary operation");
3088 if (!is_gimple_val (rhs1))
3090 error ("invalid operand in unary operation");
3094 /* First handle conversions. */
3099 /* Allow conversions between integral types and pointers only if
3100 there is no sign or zero extension involved.
3101 For targets were the precision of sizetype doesn't match that
3102 of pointers we need to allow arbitrary conversions from and
3104 if ((POINTER_TYPE_P (lhs_type)
3105 && INTEGRAL_TYPE_P (rhs1_type)
3106 && (TYPE_PRECISION (lhs_type) >= TYPE_PRECISION (rhs1_type)
3107 || rhs1_type == sizetype))
3108 || (POINTER_TYPE_P (rhs1_type)
3109 && INTEGRAL_TYPE_P (lhs_type)
3110 && (TYPE_PRECISION (rhs1_type) >= TYPE_PRECISION (lhs_type)
3111 || lhs_type == sizetype)))
3114 /* Allow conversion from integer to offset type and vice versa. */
3115 if ((TREE_CODE (lhs_type) == OFFSET_TYPE
3116 && TREE_CODE (rhs1_type) == INTEGER_TYPE)
3117 || (TREE_CODE (lhs_type) == INTEGER_TYPE
3118 && TREE_CODE (rhs1_type) == OFFSET_TYPE))
3121 /* Otherwise assert we are converting between types of the
3123 if (INTEGRAL_TYPE_P (lhs_type) != INTEGRAL_TYPE_P (rhs1_type))
3125 error ("invalid types in nop conversion");
3126 debug_generic_expr (lhs_type);
3127 debug_generic_expr (rhs1_type);
3134 case ADDR_SPACE_CONVERT_EXPR:
3136 if (!POINTER_TYPE_P (rhs1_type) || !POINTER_TYPE_P (lhs_type)
3137 || (TYPE_ADDR_SPACE (TREE_TYPE (rhs1_type))
3138 == TYPE_ADDR_SPACE (TREE_TYPE (lhs_type))))
3140 error ("invalid types in address space conversion");
3141 debug_generic_expr (lhs_type);
3142 debug_generic_expr (rhs1_type);
3149 case FIXED_CONVERT_EXPR:
3151 if (!valid_fixed_convert_types_p (lhs_type, rhs1_type)
3152 && !valid_fixed_convert_types_p (rhs1_type, lhs_type))
3154 error ("invalid types in fixed-point conversion");
3155 debug_generic_expr (lhs_type);
3156 debug_generic_expr (rhs1_type);
3165 if (!INTEGRAL_TYPE_P (rhs1_type) || !SCALAR_FLOAT_TYPE_P (lhs_type))
3167 error ("invalid types in conversion to floating point");
3168 debug_generic_expr (lhs_type);
3169 debug_generic_expr (rhs1_type);
3176 case FIX_TRUNC_EXPR:
3178 if (!INTEGRAL_TYPE_P (lhs_type) || !SCALAR_FLOAT_TYPE_P (rhs1_type))
3180 error ("invalid types in conversion to integer");
3181 debug_generic_expr (lhs_type);
3182 debug_generic_expr (rhs1_type);
3189 case VEC_UNPACK_HI_EXPR:
3190 case VEC_UNPACK_LO_EXPR:
3191 case REDUC_MAX_EXPR:
3192 case REDUC_MIN_EXPR:
3193 case REDUC_PLUS_EXPR:
3194 case VEC_UNPACK_FLOAT_HI_EXPR:
3195 case VEC_UNPACK_FLOAT_LO_EXPR:
3199 case TRUTH_NOT_EXPR:
3204 case NON_LVALUE_EXPR:
3212 /* For the remaining codes assert there is no conversion involved. */
3213 if (!useless_type_conversion_p (lhs_type, rhs1_type))
3215 error ("non-trivial conversion in unary operation");
3216 debug_generic_expr (lhs_type);
3217 debug_generic_expr (rhs1_type);
3224 /* Verify a gimple assignment statement STMT with a binary rhs.
3225 Returns true if anything is wrong. */
3228 verify_gimple_assign_binary (gimple stmt)
3230 enum tree_code rhs_code = gimple_assign_rhs_code (stmt);
3231 tree lhs = gimple_assign_lhs (stmt);
3232 tree lhs_type = TREE_TYPE (lhs);
3233 tree rhs1 = gimple_assign_rhs1 (stmt);
3234 tree rhs1_type = TREE_TYPE (rhs1);
3235 tree rhs2 = gimple_assign_rhs2 (stmt);
3236 tree rhs2_type = TREE_TYPE (rhs2);
3238 if (!is_gimple_reg (lhs)
3240 && TREE_CODE (lhs_type) == COMPLEX_TYPE))
3242 error ("non-register as LHS of binary operation");
3246 if (!is_gimple_val (rhs1)
3247 || !is_gimple_val (rhs2))
3249 error ("invalid operands in binary operation");
3253 /* First handle operations that involve different types. */
3258 if (TREE_CODE (lhs_type) != COMPLEX_TYPE
3259 || !(INTEGRAL_TYPE_P (rhs1_type)
3260 || SCALAR_FLOAT_TYPE_P (rhs1_type))
3261 || !(INTEGRAL_TYPE_P (rhs2_type)
3262 || SCALAR_FLOAT_TYPE_P (rhs2_type)))
3264 error ("type mismatch in complex expression");
3265 debug_generic_expr (lhs_type);
3266 debug_generic_expr (rhs1_type);
3267 debug_generic_expr (rhs2_type);
3279 /* Shifts and rotates are ok on integral types, fixed point
3280 types and integer vector types. */
3281 if ((!INTEGRAL_TYPE_P (rhs1_type)
3282 && !FIXED_POINT_TYPE_P (rhs1_type)
3283 && !(TREE_CODE (rhs1_type) == VECTOR_TYPE
3284 && TREE_CODE (TREE_TYPE (rhs1_type)) == INTEGER_TYPE))
3285 || (!INTEGRAL_TYPE_P (rhs2_type)
3286 /* Vector shifts of vectors are also ok. */
3287 && !(TREE_CODE (rhs1_type) == VECTOR_TYPE
3288 && TREE_CODE (TREE_TYPE (rhs1_type)) == INTEGER_TYPE
3289 && TREE_CODE (rhs2_type) == VECTOR_TYPE
3290 && TREE_CODE (TREE_TYPE (rhs2_type)) == INTEGER_TYPE))
3291 || !useless_type_conversion_p (lhs_type, rhs1_type))
3293 error ("type mismatch in shift expression");
3294 debug_generic_expr (lhs_type);
3295 debug_generic_expr (rhs1_type);
3296 debug_generic_expr (rhs2_type);
3303 case VEC_LSHIFT_EXPR:
3304 case VEC_RSHIFT_EXPR:
3306 if (TREE_CODE (rhs1_type) != VECTOR_TYPE
3307 || !(INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type))
3308 || FIXED_POINT_TYPE_P (TREE_TYPE (rhs1_type))
3309 || SCALAR_FLOAT_TYPE_P (TREE_TYPE (rhs1_type)))
3310 || (!INTEGRAL_TYPE_P (rhs2_type)
3311 && (TREE_CODE (rhs2_type) != VECTOR_TYPE
3312 || !INTEGRAL_TYPE_P (TREE_TYPE (rhs2_type))))
3313 || !useless_type_conversion_p (lhs_type, rhs1_type))
3315 error ("type mismatch in vector shift expression");
3316 debug_generic_expr (lhs_type);
3317 debug_generic_expr (rhs1_type);
3318 debug_generic_expr (rhs2_type);
3321 /* For shifting a vector of floating point components we
3322 only allow shifting by a constant multiple of the element size. */
3323 if (SCALAR_FLOAT_TYPE_P (TREE_TYPE (rhs1_type))
3324 && (TREE_CODE (rhs2) != INTEGER_CST
3325 || !div_if_zero_remainder (EXACT_DIV_EXPR, rhs2,
3326 TYPE_SIZE (TREE_TYPE (rhs1_type)))))
3328 error ("non-element sized vector shift of floating point vector");
3337 /* We use regular PLUS_EXPR for vectors.
3338 ??? This just makes the checker happy and may not be what is
3340 if (TREE_CODE (lhs_type) == VECTOR_TYPE
3341 && POINTER_TYPE_P (TREE_TYPE (lhs_type)))
3343 if (TREE_CODE (rhs1_type) != VECTOR_TYPE
3344 || TREE_CODE (rhs2_type) != VECTOR_TYPE)
3346 error ("invalid non-vector operands to vector valued plus");
3349 lhs_type = TREE_TYPE (lhs_type);
3350 rhs1_type = TREE_TYPE (rhs1_type);
3351 rhs2_type = TREE_TYPE (rhs2_type);
3352 /* PLUS_EXPR is commutative, so we might end up canonicalizing
3353 the pointer to 2nd place. */
3354 if (POINTER_TYPE_P (rhs2_type))
3356 tree tem = rhs1_type;
3357 rhs1_type = rhs2_type;
3360 goto do_pointer_plus_expr_check;
3366 if (POINTER_TYPE_P (lhs_type)
3367 || POINTER_TYPE_P (rhs1_type)
3368 || POINTER_TYPE_P (rhs2_type))
3370 error ("invalid (pointer) operands to plus/minus");
3374 /* Continue with generic binary expression handling. */
3378 case POINTER_PLUS_EXPR:
3380 do_pointer_plus_expr_check:
3381 if (!POINTER_TYPE_P (rhs1_type)
3382 || !useless_type_conversion_p (lhs_type, rhs1_type)
3383 || !useless_type_conversion_p (sizetype, rhs2_type))
3385 error ("type mismatch in pointer plus expression");
3386 debug_generic_stmt (lhs_type);
3387 debug_generic_stmt (rhs1_type);
3388 debug_generic_stmt (rhs2_type);
3395 case TRUTH_ANDIF_EXPR:
3396 case TRUTH_ORIF_EXPR:
3399 case TRUTH_AND_EXPR:
3401 case TRUTH_XOR_EXPR:
3403 /* We allow any kind of integral typed argument and result. */
3404 if (!INTEGRAL_TYPE_P (rhs1_type)
3405 || !INTEGRAL_TYPE_P (rhs2_type)
3406 || !INTEGRAL_TYPE_P (lhs_type))
3408 error ("type mismatch in binary truth expression");
3409 debug_generic_expr (lhs_type);
3410 debug_generic_expr (rhs1_type);
3411 debug_generic_expr (rhs2_type);
3424 case UNORDERED_EXPR:
3432 /* Comparisons are also binary, but the result type is not
3433 connected to the operand types. */
3434 return verify_gimple_comparison (lhs_type, rhs1, rhs2);
3436 case WIDEN_SUM_EXPR:
3437 case WIDEN_MULT_EXPR:
3438 case VEC_WIDEN_MULT_HI_EXPR:
3439 case VEC_WIDEN_MULT_LO_EXPR:
3440 case VEC_PACK_TRUNC_EXPR:
3441 case VEC_PACK_SAT_EXPR:
3442 case VEC_PACK_FIX_TRUNC_EXPR:
3443 case VEC_EXTRACT_EVEN_EXPR:
3444 case VEC_EXTRACT_ODD_EXPR:
3445 case VEC_INTERLEAVE_HIGH_EXPR:
3446 case VEC_INTERLEAVE_LOW_EXPR:
3451 case TRUNC_DIV_EXPR:
3453 case FLOOR_DIV_EXPR:
3454 case ROUND_DIV_EXPR:
3455 case TRUNC_MOD_EXPR:
3457 case FLOOR_MOD_EXPR:
3458 case ROUND_MOD_EXPR:
3460 case EXACT_DIV_EXPR:
3466 /* Continue with generic binary expression handling. */
3473 if (!useless_type_conversion_p (lhs_type, rhs1_type)
3474 || !useless_type_conversion_p (lhs_type, rhs2_type))
3476 error ("type mismatch in binary expression");
3477 debug_generic_stmt (lhs_type);
3478 debug_generic_stmt (rhs1_type);
3479 debug_generic_stmt (rhs2_type);
3486 /* Verify a gimple assignment statement STMT with a single rhs.
3487 Returns true if anything is wrong. */
3490 verify_gimple_assign_single (gimple stmt)
3492 enum tree_code rhs_code = gimple_assign_rhs_code (stmt);
3493 tree lhs = gimple_assign_lhs (stmt);
3494 tree lhs_type = TREE_TYPE (lhs);
3495 tree rhs1 = gimple_assign_rhs1 (stmt);
3496 tree rhs1_type = TREE_TYPE (rhs1);
3499 if (!useless_type_conversion_p (lhs_type, rhs1_type))
3501 error ("non-trivial conversion at assignment");
3502 debug_generic_expr (lhs_type);
3503 debug_generic_expr (rhs1_type);
3507 if (handled_component_p (lhs))
3508 res |= verify_types_in_gimple_reference (lhs, true);
3510 /* Special codes we cannot handle via their class. */
3515 tree op = TREE_OPERAND (rhs1, 0);
3516 if (!is_gimple_addressable (op))
3518 error ("invalid operand in unary expression");
3522 if (!types_compatible_p (TREE_TYPE (op), TREE_TYPE (TREE_TYPE (rhs1)))
3523 && !one_pointer_to_useless_type_conversion_p (TREE_TYPE (rhs1),
3526 error ("type mismatch in address expression");
3527 debug_generic_stmt (TREE_TYPE (rhs1));
3528 debug_generic_stmt (TREE_TYPE (op));
3532 return verify_types_in_gimple_reference (op, true);
3539 case ALIGN_INDIRECT_REF:
3540 case MISALIGNED_INDIRECT_REF:
3542 case ARRAY_RANGE_REF:
3543 case VIEW_CONVERT_EXPR:
3546 case TARGET_MEM_REF:
3547 if (!is_gimple_reg (lhs)
3548 && is_gimple_reg_type (TREE_TYPE (lhs)))
3550 error ("invalid rhs for gimple memory store");
3551 debug_generic_stmt (lhs);
3552 debug_generic_stmt (rhs1);
3555 return res || verify_types_in_gimple_reference (rhs1, false);
3567 /* tcc_declaration */
3572 if (!is_gimple_reg (lhs)
3573 && !is_gimple_reg (rhs1)
3574 && is_gimple_reg_type (TREE_TYPE (lhs)))
3576 error ("invalid rhs for gimple memory store");
3577 debug_generic_stmt (lhs);
3578 debug_generic_stmt (rhs1);
3587 case WITH_SIZE_EXPR:
3588 case POLYNOMIAL_CHREC:
3591 case REALIGN_LOAD_EXPR:
3601 /* Verify the contents of a GIMPLE_ASSIGN STMT. Returns true when there
3602 is a problem, otherwise false. */
3605 verify_gimple_assign (gimple stmt)
3607 switch (gimple_assign_rhs_class (stmt))
3609 case GIMPLE_SINGLE_RHS:
3610 return verify_gimple_assign_single (stmt);
3612 case GIMPLE_UNARY_RHS:
3613 return verify_gimple_assign_unary (stmt);
3615 case GIMPLE_BINARY_RHS:
3616 return verify_gimple_assign_binary (stmt);
3623 /* Verify the contents of a GIMPLE_RETURN STMT. Returns true when there
3624 is a problem, otherwise false. */
3627 verify_gimple_return (gimple stmt)
3629 tree op = gimple_return_retval (stmt);
3630 tree restype = TREE_TYPE (TREE_TYPE (cfun->decl));
3632 /* We cannot test for present return values as we do not fix up missing
3633 return values from the original source. */
3637 if (!is_gimple_val (op)
3638 && TREE_CODE (op) != RESULT_DECL)
3640 error ("invalid operand in return statement");
3641 debug_generic_stmt (op);
3645 if (!useless_type_conversion_p (restype, TREE_TYPE (op))
3646 /* ??? With C++ we can have the situation that the result
3647 decl is a reference type while the return type is an aggregate. */
3648 && !(TREE_CODE (op) == RESULT_DECL
3649 && TREE_CODE (TREE_TYPE (op)) == REFERENCE_TYPE
3650 && useless_type_conversion_p (restype, TREE_TYPE (TREE_TYPE (op)))))
3652 error ("invalid conversion in return statement");
3653 debug_generic_stmt (restype);
3654 debug_generic_stmt (TREE_TYPE (op));
3662 /* Verify the contents of a GIMPLE_GOTO STMT. Returns true when there
3663 is a problem, otherwise false. */
3666 verify_gimple_goto (gimple stmt)
3668 tree dest = gimple_goto_dest (stmt);
3670 /* ??? We have two canonical forms of direct goto destinations, a
3671 bare LABEL_DECL and an ADDR_EXPR of a LABEL_DECL. */
3672 if (TREE_CODE (dest) != LABEL_DECL
3673 && (!is_gimple_val (dest)
3674 || !POINTER_TYPE_P (TREE_TYPE (dest))))
3676 error ("goto destination is neither a label nor a pointer");
3683 /* Verify the contents of a GIMPLE_SWITCH STMT. Returns true when there
3684 is a problem, otherwise false. */
3687 verify_gimple_switch (gimple stmt)
3689 if (!is_gimple_val (gimple_switch_index (stmt)))
3691 error ("invalid operand to switch statement");
3692 debug_generic_stmt (gimple_switch_index (stmt));
3700 /* Verify the contents of a GIMPLE_PHI. Returns true if there is a problem,
3701 and false otherwise. */
3704 verify_gimple_phi (gimple stmt)
3706 tree type = TREE_TYPE (gimple_phi_result (stmt));
3709 if (TREE_CODE (gimple_phi_result (stmt)) != SSA_NAME)
3711 error ("Invalid PHI result");
3715 for (i = 0; i < gimple_phi_num_args (stmt); i++)
3717 tree arg = gimple_phi_arg_def (stmt, i);
3718 if ((is_gimple_reg (gimple_phi_result (stmt))
3719 && !is_gimple_val (arg))
3720 || (!is_gimple_reg (gimple_phi_result (stmt))
3721 && !is_gimple_addressable (arg)))
3723 error ("Invalid PHI argument");
3724 debug_generic_stmt (arg);
3727 if (!useless_type_conversion_p (type, TREE_TYPE (arg)))
3729 error ("Incompatible types in PHI argument %u", i);
3730 debug_generic_stmt (type);
3731 debug_generic_stmt (TREE_TYPE (arg));
3740 /* Verify a gimple debug statement STMT.
3741 Returns true if anything is wrong. */
3744 verify_gimple_debug (gimple stmt ATTRIBUTE_UNUSED)
3746 /* There isn't much that could be wrong in a gimple debug stmt. A
3747 gimple debug bind stmt, for example, maps a tree, that's usually
3748 a VAR_DECL or a PARM_DECL, but that could also be some scalarized
3749 component or member of an aggregate type, to another tree, that
3750 can be an arbitrary expression. These stmts expand into debug
3751 insns, and are converted to debug notes by var-tracking.c. */
3756 /* Verify the GIMPLE statement STMT. Returns true if there is an
3757 error, otherwise false. */
3760 verify_types_in_gimple_stmt (gimple stmt)
3762 switch (gimple_code (stmt))
3765 return verify_gimple_assign (stmt);
3768 return TREE_CODE (gimple_label_label (stmt)) != LABEL_DECL;
3771 return verify_gimple_call (stmt);
3774 if (TREE_CODE_CLASS (gimple_cond_code (stmt)) != tcc_comparison)
3776 error ("invalid comparison code in gimple cond");
3779 if (!(!gimple_cond_true_label (stmt)
3780 || TREE_CODE (gimple_cond_true_label (stmt)) == LABEL_DECL)
3781 || !(!gimple_cond_false_label (stmt)
3782 || TREE_CODE (gimple_cond_false_label (stmt)) == LABEL_DECL))
3784 error ("invalid labels in gimple cond");
3788 return verify_gimple_comparison (boolean_type_node,
3789 gimple_cond_lhs (stmt),
3790 gimple_cond_rhs (stmt));
3793 return verify_gimple_goto (stmt);
3796 return verify_gimple_switch (stmt);
3799 return verify_gimple_return (stmt);
3805 return verify_gimple_phi (stmt);
3807 /* Tuples that do not have tree operands. */
3809 case GIMPLE_PREDICT:
3811 case GIMPLE_EH_DISPATCH:
3812 case GIMPLE_EH_MUST_NOT_THROW:
3816 /* OpenMP directives are validated by the FE and never operated
3817 on by the optimizers. Furthermore, GIMPLE_OMP_FOR may contain
3818 non-gimple expressions when the main index variable has had
3819 its address taken. This does not affect the loop itself
3820 because the header of an GIMPLE_OMP_FOR is merely used to determine
3821 how to setup the parallel iteration. */
3825 return verify_gimple_debug (stmt);
3832 /* Verify the GIMPLE statements inside the sequence STMTS. */
3835 verify_types_in_gimple_seq_2 (gimple_seq stmts)
3837 gimple_stmt_iterator ittr;
3840 for (ittr = gsi_start (stmts); !gsi_end_p (ittr); gsi_next (&ittr))
3842 gimple stmt = gsi_stmt (ittr);
3844 switch (gimple_code (stmt))
3847 err |= verify_types_in_gimple_seq_2 (gimple_bind_body (stmt));
3851 err |= verify_types_in_gimple_seq_2 (gimple_try_eval (stmt));
3852 err |= verify_types_in_gimple_seq_2 (gimple_try_cleanup (stmt));
3855 case GIMPLE_EH_FILTER:
3856 err |= verify_types_in_gimple_seq_2 (gimple_eh_filter_failure (stmt));
3860 err |= verify_types_in_gimple_seq_2 (gimple_catch_handler (stmt));
3865 bool err2 = verify_types_in_gimple_stmt (stmt);
3867 debug_gimple_stmt (stmt);
3877 /* Verify the GIMPLE statements inside the statement list STMTS. */
3880 verify_types_in_gimple_seq (gimple_seq stmts)
3882 if (verify_types_in_gimple_seq_2 (stmts))
3883 internal_error ("verify_gimple failed");
3887 /* Verify STMT, return true if STMT is not in GIMPLE form.
3888 TODO: Implement type checking. */
3891 verify_stmt (gimple_stmt_iterator *gsi)
3894 struct walk_stmt_info wi;
3895 bool last_in_block = gsi_one_before_end_p (*gsi);
3896 gimple stmt = gsi_stmt (*gsi);
3899 if (is_gimple_omp (stmt))
3901 /* OpenMP directives are validated by the FE and never operated
3902 on by the optimizers. Furthermore, GIMPLE_OMP_FOR may contain
3903 non-gimple expressions when the main index variable has had
3904 its address taken. This does not affect the loop itself
3905 because the header of an GIMPLE_OMP_FOR is merely used to determine
3906 how to setup the parallel iteration. */
3910 /* FIXME. The C frontend passes unpromoted arguments in case it
3911 didn't see a function declaration before the call. */
3912 if (is_gimple_call (stmt))
3916 if (!is_gimple_call_addr (gimple_call_fn (stmt)))
3918 error ("invalid function in call statement");
3922 decl = gimple_call_fndecl (stmt);
3924 && TREE_CODE (decl) == FUNCTION_DECL
3925 && DECL_LOOPING_CONST_OR_PURE_P (decl)
3926 && (!DECL_PURE_P (decl))
3927 && (!TREE_READONLY (decl)))
3929 error ("invalid pure const state for function");
3934 if (is_gimple_debug (stmt))
3937 memset (&wi, 0, sizeof (wi));
3938 addr = walk_gimple_op (gsi_stmt (*gsi), verify_expr, &wi);
3941 debug_generic_expr (addr);
3942 inform (gimple_location (gsi_stmt (*gsi)), "in statement");
3943 debug_gimple_stmt (stmt);
3947 /* If the statement is marked as part of an EH region, then it is
3948 expected that the statement could throw. Verify that when we
3949 have optimizations that simplify statements such that we prove
3950 that they cannot throw, that we update other data structures
3952 lp_nr = lookup_stmt_eh_lp (stmt);
3955 if (!stmt_could_throw_p (stmt))
3957 /* During IPA passes, ipa-pure-const sets nothrow flags on calls
3958 and they are updated on statements only after fixup_cfg
3959 is executed at beggining of expansion stage. */
3960 if (cgraph_state != CGRAPH_STATE_IPA_SSA)
3962 error ("statement marked for throw, but doesn%'t");
3966 else if (lp_nr > 0 && !last_in_block && stmt_can_throw_internal (stmt))
3968 error ("statement marked for throw in middle of block");
3976 debug_gimple_stmt (stmt);
3981 /* Return true when the T can be shared. */
3984 tree_node_can_be_shared (tree t)
3986 if (IS_TYPE_OR_DECL_P (t)
3987 || is_gimple_min_invariant (t)
3988 || TREE_CODE (t) == SSA_NAME
3989 || t == error_mark_node
3990 || TREE_CODE (t) == IDENTIFIER_NODE)
3993 if (TREE_CODE (t) == CASE_LABEL_EXPR)
3996 while (((TREE_CODE (t) == ARRAY_REF || TREE_CODE (t) == ARRAY_RANGE_REF)
3997 && is_gimple_min_invariant (TREE_OPERAND (t, 1)))
3998 || TREE_CODE (t) == COMPONENT_REF
3999 || TREE_CODE (t) == REALPART_EXPR
4000 || TREE_CODE (t) == IMAGPART_EXPR)
4001 t = TREE_OPERAND (t, 0);
4010 /* Called via walk_gimple_stmt. Verify tree sharing. */
4013 verify_node_sharing (tree *tp, int *walk_subtrees, void *data)
4015 struct walk_stmt_info *wi = (struct walk_stmt_info *) data;
4016 struct pointer_set_t *visited = (struct pointer_set_t *) wi->info;
4018 if (tree_node_can_be_shared (*tp))
4020 *walk_subtrees = false;
4024 if (pointer_set_insert (visited, *tp))
4031 static bool eh_error_found;
4033 verify_eh_throw_stmt_node (void **slot, void *data)
4035 struct throw_stmt_node *node = (struct throw_stmt_node *)*slot;
4036 struct pointer_set_t *visited = (struct pointer_set_t *) data;
4038 if (!pointer_set_contains (visited, node->stmt))
4040 error ("Dead STMT in EH table");
4041 debug_gimple_stmt (node->stmt);
4042 eh_error_found = true;
4048 /* Verify the GIMPLE statements in every basic block. */
4054 gimple_stmt_iterator gsi;
4056 struct pointer_set_t *visited, *visited_stmts;
4058 struct walk_stmt_info wi;
4060 timevar_push (TV_TREE_STMT_VERIFY);
4061 visited = pointer_set_create ();
4062 visited_stmts = pointer_set_create ();
4064 memset (&wi, 0, sizeof (wi));
4065 wi.info = (void *) visited;
4072 for (gsi = gsi_start_phis (bb); !gsi_end_p (gsi); gsi_next (&gsi))
4074 phi = gsi_stmt (gsi);
4075 pointer_set_insert (visited_stmts, phi);
4076 if (gimple_bb (phi) != bb)
4078 error ("gimple_bb (phi) is set to a wrong basic block");
4082 for (i = 0; i < gimple_phi_num_args (phi); i++)
4084 tree t = gimple_phi_arg_def (phi, i);
4089 error ("missing PHI def");
4090 debug_gimple_stmt (phi);
4094 /* Addressable variables do have SSA_NAMEs but they
4095 are not considered gimple values. */
4096 else if (TREE_CODE (t) != SSA_NAME
4097 && TREE_CODE (t) != FUNCTION_DECL
4098 && !is_gimple_min_invariant (t))
4100 error ("PHI argument is not a GIMPLE value");
4101 debug_gimple_stmt (phi);
4102 debug_generic_expr (t);
4106 addr = walk_tree (&t, verify_node_sharing, visited, NULL);
4109 error ("incorrect sharing of tree nodes");
4110 debug_gimple_stmt (phi);
4111 debug_generic_expr (addr);
4116 #ifdef ENABLE_TYPES_CHECKING
4117 if (verify_gimple_phi (phi))
4119 debug_gimple_stmt (phi);
4125 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); )
4127 gimple stmt = gsi_stmt (gsi);
4129 if (gimple_code (stmt) == GIMPLE_WITH_CLEANUP_EXPR
4130 || gimple_code (stmt) == GIMPLE_BIND)
4132 error ("invalid GIMPLE statement");
4133 debug_gimple_stmt (stmt);
4137 pointer_set_insert (visited_stmts, stmt);
4139 if (gimple_bb (stmt) != bb)
4141 error ("gimple_bb (stmt) is set to a wrong basic block");
4142 debug_gimple_stmt (stmt);
4146 if (gimple_code (stmt) == GIMPLE_LABEL)
4148 tree decl = gimple_label_label (stmt);
4149 int uid = LABEL_DECL_UID (decl);
4152 || VEC_index (basic_block, label_to_block_map, uid) != bb)
4154 error ("incorrect entry in label_to_block_map");
4158 uid = EH_LANDING_PAD_NR (decl);
4161 eh_landing_pad lp = get_eh_landing_pad_from_number (uid);
4162 if (decl != lp->post_landing_pad)
4164 error ("incorrect setting of landing pad number");
4170 err |= verify_stmt (&gsi);
4172 #ifdef ENABLE_TYPES_CHECKING
4173 if (verify_types_in_gimple_stmt (gsi_stmt (gsi)))
4175 debug_gimple_stmt (stmt);
4179 addr = walk_gimple_op (gsi_stmt (gsi), verify_node_sharing, &wi);
4182 error ("incorrect sharing of tree nodes");
4183 debug_gimple_stmt (stmt);
4184 debug_generic_expr (addr);
4191 eh_error_found = false;
4192 if (get_eh_throw_stmt_table (cfun))
4193 htab_traverse (get_eh_throw_stmt_table (cfun),
4194 verify_eh_throw_stmt_node,
4197 if (err | eh_error_found)
4198 internal_error ("verify_stmts failed");
4200 pointer_set_destroy (visited);
4201 pointer_set_destroy (visited_stmts);
4202 verify_histograms ();
4203 timevar_pop (TV_TREE_STMT_VERIFY);
4207 /* Verifies that the flow information is OK. */
4210 gimple_verify_flow_info (void)
4214 gimple_stmt_iterator gsi;
4219 if (ENTRY_BLOCK_PTR->il.gimple)
4221 error ("ENTRY_BLOCK has IL associated with it");
4225 if (EXIT_BLOCK_PTR->il.gimple)
4227 error ("EXIT_BLOCK has IL associated with it");
4231 FOR_EACH_EDGE (e, ei, EXIT_BLOCK_PTR->preds)
4232 if (e->flags & EDGE_FALLTHRU)
4234 error ("fallthru to exit from bb %d", e->src->index);
4240 bool found_ctrl_stmt = false;
4244 /* Skip labels on the start of basic block. */
4245 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
4248 gimple prev_stmt = stmt;
4250 stmt = gsi_stmt (gsi);
4252 if (gimple_code (stmt) != GIMPLE_LABEL)
4255 label = gimple_label_label (stmt);
4256 if (prev_stmt && DECL_NONLOCAL (label))
4258 error ("nonlocal label ");
4259 print_generic_expr (stderr, label, 0);
4260 fprintf (stderr, " is not first in a sequence of labels in bb %d",
4265 if (label_to_block (label) != bb)
4268 print_generic_expr (stderr, label, 0);
4269 fprintf (stderr, " to block does not match in bb %d",
4274 if (decl_function_context (label) != current_function_decl)
4277 print_generic_expr (stderr, label, 0);
4278 fprintf (stderr, " has incorrect context in bb %d",
4284 /* Verify that body of basic block BB is free of control flow. */
4285 for (; !gsi_end_p (gsi); gsi_next (&gsi))
4287 gimple stmt = gsi_stmt (gsi);
4289 if (found_ctrl_stmt)
4291 error ("control flow in the middle of basic block %d",
4296 if (stmt_ends_bb_p (stmt))
4297 found_ctrl_stmt = true;
4299 if (gimple_code (stmt) == GIMPLE_LABEL)
4302 print_generic_expr (stderr, gimple_label_label (stmt), 0);
4303 fprintf (stderr, " in the middle of basic block %d", bb->index);
4308 gsi = gsi_last_bb (bb);
4309 if (gsi_end_p (gsi))
4312 stmt = gsi_stmt (gsi);
4314 if (gimple_code (stmt) == GIMPLE_LABEL)
4317 err |= verify_eh_edges (stmt);
4319 if (is_ctrl_stmt (stmt))
4321 FOR_EACH_EDGE (e, ei, bb->succs)
4322 if (e->flags & EDGE_FALLTHRU)
4324 error ("fallthru edge after a control statement in bb %d",
4330 if (gimple_code (stmt) != GIMPLE_COND)
4332 /* Verify that there are no edges with EDGE_TRUE/FALSE_FLAG set
4333 after anything else but if statement. */
4334 FOR_EACH_EDGE (e, ei, bb->succs)
4335 if (e->flags & (EDGE_TRUE_VALUE | EDGE_FALSE_VALUE))
4337 error ("true/false edge after a non-GIMPLE_COND in bb %d",
4343 switch (gimple_code (stmt))
4350 extract_true_false_edges_from_block (bb, &true_edge, &false_edge);
4354 || !(true_edge->flags & EDGE_TRUE_VALUE)
4355 || !(false_edge->flags & EDGE_FALSE_VALUE)
4356 || (true_edge->flags & (EDGE_FALLTHRU | EDGE_ABNORMAL))
4357 || (false_edge->flags & (EDGE_FALLTHRU | EDGE_ABNORMAL))
4358 || EDGE_COUNT (bb->succs) >= 3)
4360 error ("wrong outgoing edge flags at end of bb %d",
4368 if (simple_goto_p (stmt))
4370 error ("explicit goto at end of bb %d", bb->index);
4375 /* FIXME. We should double check that the labels in the
4376 destination blocks have their address taken. */
4377 FOR_EACH_EDGE (e, ei, bb->succs)
4378 if ((e->flags & (EDGE_FALLTHRU | EDGE_TRUE_VALUE
4379 | EDGE_FALSE_VALUE))
4380 || !(e->flags & EDGE_ABNORMAL))
4382 error ("wrong outgoing edge flags at end of bb %d",
4390 if (!single_succ_p (bb)
4391 || (single_succ_edge (bb)->flags
4392 & (EDGE_FALLTHRU | EDGE_ABNORMAL
4393 | EDGE_TRUE_VALUE | EDGE_FALSE_VALUE)))
4395 error ("wrong outgoing edge flags at end of bb %d", bb->index);
4398 if (single_succ (bb) != EXIT_BLOCK_PTR)
4400 error ("return edge does not point to exit in bb %d",
4412 n = gimple_switch_num_labels (stmt);
4414 /* Mark all the destination basic blocks. */
4415 for (i = 0; i < n; ++i)
4417 tree lab = CASE_LABEL (gimple_switch_label (stmt, i));
4418 basic_block label_bb = label_to_block (lab);
4419 gcc_assert (!label_bb->aux || label_bb->aux == (void *)1);
4420 label_bb->aux = (void *)1;
4423 /* Verify that the case labels are sorted. */
4424 prev = gimple_switch_label (stmt, 0);
4425 for (i = 1; i < n; ++i)
4427 tree c = gimple_switch_label (stmt, i);
4430 error ("found default case not at the start of "
4436 && !tree_int_cst_lt (CASE_LOW (prev), CASE_LOW (c)))
4438 error ("case labels not sorted: ");
4439 print_generic_expr (stderr, prev, 0);
4440 fprintf (stderr," is greater than ");
4441 print_generic_expr (stderr, c, 0);
4442 fprintf (stderr," but comes before it.\n");
4447 /* VRP will remove the default case if it can prove it will
4448 never be executed. So do not verify there always exists
4449 a default case here. */
4451 FOR_EACH_EDGE (e, ei, bb->succs)
4455 error ("extra outgoing edge %d->%d",
4456 bb->index, e->dest->index);
4460 e->dest->aux = (void *)2;
4461 if ((e->flags & (EDGE_FALLTHRU | EDGE_ABNORMAL
4462 | EDGE_TRUE_VALUE | EDGE_FALSE_VALUE)))
4464 error ("wrong outgoing edge flags at end of bb %d",
4470 /* Check that we have all of them. */
4471 for (i = 0; i < n; ++i)
4473 tree lab = CASE_LABEL (gimple_switch_label (stmt, i));
4474 basic_block label_bb = label_to_block (lab);
4476 if (label_bb->aux != (void *)2)
4478 error ("missing edge %i->%i", bb->index, label_bb->index);
4483 FOR_EACH_EDGE (e, ei, bb->succs)
4484 e->dest->aux = (void *)0;
4488 case GIMPLE_EH_DISPATCH:
4489 err |= verify_eh_dispatch_edge (stmt);
4497 if (dom_info_state (CDI_DOMINATORS) >= DOM_NO_FAST_QUERY)
4498 verify_dominators (CDI_DOMINATORS);
4504 /* Updates phi nodes after creating a forwarder block joined
4505 by edge FALLTHRU. */
4508 gimple_make_forwarder_block (edge fallthru)
4512 basic_block dummy, bb;
4514 gimple_stmt_iterator gsi;
4516 dummy = fallthru->src;
4517 bb = fallthru->dest;
4519 if (single_pred_p (bb))
4522 /* If we redirected a branch we must create new PHI nodes at the
4524 for (gsi = gsi_start_phis (dummy); !gsi_end_p (gsi); gsi_next (&gsi))
4526 gimple phi, new_phi;
4528 phi = gsi_stmt (gsi);
4529 var = gimple_phi_result (phi);
4530 new_phi = create_phi_node (var, bb);
4531 SSA_NAME_DEF_STMT (var) = new_phi;
4532 gimple_phi_set_result (phi, make_ssa_name (SSA_NAME_VAR (var), phi));
4533 add_phi_arg (new_phi, gimple_phi_result (phi), fallthru,
4537 /* Add the arguments we have stored on edges. */
4538 FOR_EACH_EDGE (e, ei, bb->preds)
4543 flush_pending_stmts (e);
4548 /* Return a non-special label in the head of basic block BLOCK.
4549 Create one if it doesn't exist. */
4552 gimple_block_label (basic_block bb)
4554 gimple_stmt_iterator i, s = gsi_start_bb (bb);
4559 for (i = s; !gsi_end_p (i); first = false, gsi_next (&i))
4561 stmt = gsi_stmt (i);
4562 if (gimple_code (stmt) != GIMPLE_LABEL)
4564 label = gimple_label_label (stmt);
4565 if (!DECL_NONLOCAL (label))
4568 gsi_move_before (&i, &s);
4573 label = create_artificial_label (UNKNOWN_LOCATION);
4574 stmt = gimple_build_label (label);
4575 gsi_insert_before (&s, stmt, GSI_NEW_STMT);
4580 /* Attempt to perform edge redirection by replacing a possibly complex
4581 jump instruction by a goto or by removing the jump completely.
4582 This can apply only if all edges now point to the same block. The
4583 parameters and return values are equivalent to
4584 redirect_edge_and_branch. */
4587 gimple_try_redirect_by_replacing_jump (edge e, basic_block target)
4589 basic_block src = e->src;
4590 gimple_stmt_iterator i;
4593 /* We can replace or remove a complex jump only when we have exactly
4595 if (EDGE_COUNT (src->succs) != 2
4596 /* Verify that all targets will be TARGET. Specifically, the
4597 edge that is not E must also go to TARGET. */
4598 || EDGE_SUCC (src, EDGE_SUCC (src, 0) == e)->dest != target)
4601 i = gsi_last_bb (src);
4605 stmt = gsi_stmt (i);
4607 if (gimple_code (stmt) == GIMPLE_COND || gimple_code (stmt) == GIMPLE_SWITCH)
4609 gsi_remove (&i, true);
4610 e = ssa_redirect_edge (e, target);
4611 e->flags = EDGE_FALLTHRU;
4619 /* Redirect E to DEST. Return NULL on failure. Otherwise, return the
4620 edge representing the redirected branch. */
4623 gimple_redirect_edge_and_branch (edge e, basic_block dest)
4625 basic_block bb = e->src;
4626 gimple_stmt_iterator gsi;
4630 if (e->flags & EDGE_ABNORMAL)
4633 if (e->dest == dest)
4636 if (e->flags & EDGE_EH)
4637 return redirect_eh_edge (e, dest);
4639 if (e->src != ENTRY_BLOCK_PTR)
4641 ret = gimple_try_redirect_by_replacing_jump (e, dest);
4646 gsi = gsi_last_bb (bb);
4647 stmt = gsi_end_p (gsi) ? NULL : gsi_stmt (gsi);
4649 switch (stmt ? gimple_code (stmt) : GIMPLE_ERROR_MARK)
4652 /* For COND_EXPR, we only need to redirect the edge. */
4656 /* No non-abnormal edges should lead from a non-simple goto, and
4657 simple ones should be represented implicitly. */
4662 tree label = gimple_block_label (dest);
4663 tree cases = get_cases_for_edge (e, stmt);
4665 /* If we have a list of cases associated with E, then use it
4666 as it's a lot faster than walking the entire case vector. */
4669 edge e2 = find_edge (e->src, dest);
4676 CASE_LABEL (cases) = label;
4677 cases = TREE_CHAIN (cases);
4680 /* If there was already an edge in the CFG, then we need
4681 to move all the cases associated with E to E2. */
4684 tree cases2 = get_cases_for_edge (e2, stmt);
4686 TREE_CHAIN (last) = TREE_CHAIN (cases2);
4687 TREE_CHAIN (cases2) = first;
4692 size_t i, n = gimple_switch_num_labels (stmt);
4694 for (i = 0; i < n; i++)
4696 tree elt = gimple_switch_label (stmt, i);
4697 if (label_to_block (CASE_LABEL (elt)) == e->dest)
4698 CASE_LABEL (elt) = label;
4706 int i, n = gimple_asm_nlabels (stmt);
4709 for (i = 0; i < n; ++i)
4711 tree cons = gimple_asm_label_op (stmt, i);
4712 if (label_to_block (TREE_VALUE (cons)) == e->dest)
4715 label = gimple_block_label (dest);
4716 TREE_VALUE (cons) = label;
4720 /* If we didn't find any label matching the former edge in the
4721 asm labels, we must be redirecting the fallthrough
4723 gcc_assert (label || (e->flags & EDGE_FALLTHRU));
4728 gsi_remove (&gsi, true);
4729 e->flags |= EDGE_FALLTHRU;
4732 case GIMPLE_OMP_RETURN:
4733 case GIMPLE_OMP_CONTINUE:
4734 case GIMPLE_OMP_SECTIONS_SWITCH:
4735 case GIMPLE_OMP_FOR:
4736 /* The edges from OMP constructs can be simply redirected. */
4739 case GIMPLE_EH_DISPATCH:
4740 if (!(e->flags & EDGE_FALLTHRU))
4741 redirect_eh_dispatch_edge (stmt, e, dest);
4745 /* Otherwise it must be a fallthru edge, and we don't need to
4746 do anything besides redirecting it. */
4747 gcc_assert (e->flags & EDGE_FALLTHRU);
4751 /* Update/insert PHI nodes as necessary. */
4753 /* Now update the edges in the CFG. */
4754 e = ssa_redirect_edge (e, dest);
4759 /* Returns true if it is possible to remove edge E by redirecting
4760 it to the destination of the other edge from E->src. */
4763 gimple_can_remove_branch_p (const_edge e)
4765 if (e->flags & (EDGE_ABNORMAL | EDGE_EH))
4771 /* Simple wrapper, as we can always redirect fallthru edges. */
4774 gimple_redirect_edge_and_branch_force (edge e, basic_block dest)
4776 e = gimple_redirect_edge_and_branch (e, dest);
4783 /* Splits basic block BB after statement STMT (but at least after the
4784 labels). If STMT is NULL, BB is split just after the labels. */
4787 gimple_split_block (basic_block bb, void *stmt)
4789 gimple_stmt_iterator gsi;
4790 gimple_stmt_iterator gsi_tgt;
4797 new_bb = create_empty_bb (bb);
4799 /* Redirect the outgoing edges. */
4800 new_bb->succs = bb->succs;
4802 FOR_EACH_EDGE (e, ei, new_bb->succs)
4805 if (stmt && gimple_code ((gimple) stmt) == GIMPLE_LABEL)
4808 /* Move everything from GSI to the new basic block. */
4809 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
4811 act = gsi_stmt (gsi);
4812 if (gimple_code (act) == GIMPLE_LABEL)
4825 if (gsi_end_p (gsi))
4828 /* Split the statement list - avoid re-creating new containers as this
4829 brings ugly quadratic memory consumption in the inliner.
4830 (We are still quadratic since we need to update stmt BB pointers,
4832 list = gsi_split_seq_before (&gsi);
4833 set_bb_seq (new_bb, list);
4834 for (gsi_tgt = gsi_start (list);
4835 !gsi_end_p (gsi_tgt); gsi_next (&gsi_tgt))
4836 gimple_set_bb (gsi_stmt (gsi_tgt), new_bb);
4842 /* Moves basic block BB after block AFTER. */
4845 gimple_move_block_after (basic_block bb, basic_block after)
4847 if (bb->prev_bb == after)
4851 link_block (bb, after);
4857 /* Return true if basic_block can be duplicated. */
4860 gimple_can_duplicate_bb_p (const_basic_block bb ATTRIBUTE_UNUSED)
4865 /* Create a duplicate of the basic block BB. NOTE: This does not
4866 preserve SSA form. */
4869 gimple_duplicate_bb (basic_block bb)
4872 gimple_stmt_iterator gsi, gsi_tgt;
4873 gimple_seq phis = phi_nodes (bb);
4874 gimple phi, stmt, copy;
4876 new_bb = create_empty_bb (EXIT_BLOCK_PTR->prev_bb);
4878 /* Copy the PHI nodes. We ignore PHI node arguments here because
4879 the incoming edges have not been setup yet. */
4880 for (gsi = gsi_start (phis); !gsi_end_p (gsi); gsi_next (&gsi))
4882 phi = gsi_stmt (gsi);
4883 copy = create_phi_node (gimple_phi_result (phi), new_bb);
4884 create_new_def_for (gimple_phi_result (copy), copy,
4885 gimple_phi_result_ptr (copy));
4888 gsi_tgt = gsi_start_bb (new_bb);
4889 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
4891 def_operand_p def_p;
4892 ssa_op_iter op_iter;
4894 stmt = gsi_stmt (gsi);
4895 if (gimple_code (stmt) == GIMPLE_LABEL)
4898 /* Create a new copy of STMT and duplicate STMT's virtual
4900 copy = gimple_copy (stmt);
4901 gsi_insert_after (&gsi_tgt, copy, GSI_NEW_STMT);
4903 maybe_duplicate_eh_stmt (copy, stmt);
4904 gimple_duplicate_stmt_histograms (cfun, copy, cfun, stmt);
4906 /* Create new names for all the definitions created by COPY and
4907 add replacement mappings for each new name. */
4908 FOR_EACH_SSA_DEF_OPERAND (def_p, copy, op_iter, SSA_OP_ALL_DEFS)
4909 create_new_def_for (DEF_FROM_PTR (def_p), copy, def_p);
4915 /* Add phi arguments to the phi nodes in E_COPY->dest according to
4916 the phi arguments coming from the equivalent edge at
4917 the phi nodes of DEST. */
4920 add_phi_args_after_redirect (edge e_copy, edge orig_e)
4922 gimple_stmt_iterator psi, psi_copy;
4923 gimple phi, phi_copy;
4926 for (psi = gsi_start_phis (orig_e->dest),
4927 psi_copy = gsi_start_phis (e_copy->dest);
4929 gsi_next (&psi), gsi_next (&psi_copy))
4932 phi = gsi_stmt (psi);
4933 phi_copy = gsi_stmt (psi_copy);
4934 def = PHI_ARG_DEF_FROM_EDGE (phi, orig_e);
4935 add_phi_arg (phi_copy, def, e_copy,
4936 gimple_phi_arg_location_from_edge (phi, orig_e));
4940 /* Adds phi node arguments for edge E_COPY after basic block duplication. */
4943 add_phi_args_after_copy_edge (edge e_copy)
4945 basic_block bb, bb_copy = e_copy->src, dest;
4948 gimple phi, phi_copy;
4950 gimple_stmt_iterator psi, psi_copy;
4952 if (gimple_seq_empty_p (phi_nodes (e_copy->dest)))
4955 bb = bb_copy->flags & BB_DUPLICATED ? get_bb_original (bb_copy) : bb_copy;
4957 if (e_copy->dest->flags & BB_DUPLICATED)
4958 dest = get_bb_original (e_copy->dest);
4960 dest = e_copy->dest;
4962 e = find_edge (bb, dest);
4965 /* During loop unrolling the target of the latch edge is copied.
4966 In this case we are not looking for edge to dest, but to
4967 duplicated block whose original was dest. */
4968 FOR_EACH_EDGE (e, ei, bb->succs)
4970 if ((e->dest->flags & BB_DUPLICATED)
4971 && get_bb_original (e->dest) == dest)
4975 gcc_assert (e != NULL);
4978 for (psi = gsi_start_phis (e->dest),
4979 psi_copy = gsi_start_phis (e_copy->dest);
4981 gsi_next (&psi), gsi_next (&psi_copy))
4983 phi = gsi_stmt (psi);
4984 phi_copy = gsi_stmt (psi_copy);
4985 def = PHI_ARG_DEF_FROM_EDGE (phi, e);
4986 add_phi_arg (phi_copy, def, e_copy,
4987 gimple_phi_arg_location_from_edge (phi, e));
4992 /* Basic block BB_COPY was created by code duplication. Add phi node
4993 arguments for edges going out of BB_COPY. The blocks that were
4994 duplicated have BB_DUPLICATED set. */
4997 add_phi_args_after_copy_bb (basic_block bb_copy)
5002 FOR_EACH_EDGE (e_copy, ei, bb_copy->succs)
5004 add_phi_args_after_copy_edge (e_copy);
5008 /* Blocks in REGION_COPY array of length N_REGION were created by
5009 duplication of basic blocks. Add phi node arguments for edges
5010 going from these blocks. If E_COPY is not NULL, also add
5011 phi node arguments for its destination.*/
5014 add_phi_args_after_copy (basic_block *region_copy, unsigned n_region,
5019 for (i = 0; i < n_region; i++)
5020 region_copy[i]->flags |= BB_DUPLICATED;
5022 for (i = 0; i < n_region; i++)
5023 add_phi_args_after_copy_bb (region_copy[i]);
5025 add_phi_args_after_copy_edge (e_copy);
5027 for (i = 0; i < n_region; i++)
5028 region_copy[i]->flags &= ~BB_DUPLICATED;
5031 /* Duplicates a REGION (set of N_REGION basic blocks) with just a single
5032 important exit edge EXIT. By important we mean that no SSA name defined
5033 inside region is live over the other exit edges of the region. All entry
5034 edges to the region must go to ENTRY->dest. The edge ENTRY is redirected
5035 to the duplicate of the region. SSA form, dominance and loop information
5036 is updated. The new basic blocks are stored to REGION_COPY in the same
5037 order as they had in REGION, provided that REGION_COPY is not NULL.
5038 The function returns false if it is unable to copy the region,
5042 gimple_duplicate_sese_region (edge entry, edge exit,
5043 basic_block *region, unsigned n_region,
5044 basic_block *region_copy)
5047 bool free_region_copy = false, copying_header = false;
5048 struct loop *loop = entry->dest->loop_father;
5050 VEC (basic_block, heap) *doms;
5052 int total_freq = 0, entry_freq = 0;
5053 gcov_type total_count = 0, entry_count = 0;
5055 if (!can_copy_bbs_p (region, n_region))
5058 /* Some sanity checking. Note that we do not check for all possible
5059 missuses of the functions. I.e. if you ask to copy something weird,
5060 it will work, but the state of structures probably will not be
5062 for (i = 0; i < n_region; i++)
5064 /* We do not handle subloops, i.e. all the blocks must belong to the
5066 if (region[i]->loop_father != loop)
5069 if (region[i] != entry->dest
5070 && region[i] == loop->header)
5074 set_loop_copy (loop, loop);
5076 /* In case the function is used for loop header copying (which is the primary
5077 use), ensure that EXIT and its copy will be new latch and entry edges. */
5078 if (loop->header == entry->dest)
5080 copying_header = true;
5081 set_loop_copy (loop, loop_outer (loop));
5083 if (!dominated_by_p (CDI_DOMINATORS, loop->latch, exit->src))
5086 for (i = 0; i < n_region; i++)
5087 if (region[i] != exit->src
5088 && dominated_by_p (CDI_DOMINATORS, region[i], exit->src))
5094 region_copy = XNEWVEC (basic_block, n_region);
5095 free_region_copy = true;
5098 gcc_assert (!need_ssa_update_p (cfun));
5100 /* Record blocks outside the region that are dominated by something
5103 initialize_original_copy_tables ();
5105 doms = get_dominated_by_region (CDI_DOMINATORS, region, n_region);
5107 if (entry->dest->count)
5109 total_count = entry->dest->count;
5110 entry_count = entry->count;
5111 /* Fix up corner cases, to avoid division by zero or creation of negative
5113 if (entry_count > total_count)
5114 entry_count = total_count;
5118 total_freq = entry->dest->frequency;
5119 entry_freq = EDGE_FREQUENCY (entry);
5120 /* Fix up corner cases, to avoid division by zero or creation of negative
5122 if (total_freq == 0)
5124 else if (entry_freq > total_freq)
5125 entry_freq = total_freq;
5128 copy_bbs (region, n_region, region_copy, &exit, 1, &exit_copy, loop,
5129 split_edge_bb_loc (entry));
5132 scale_bbs_frequencies_gcov_type (region, n_region,
5133 total_count - entry_count,
5135 scale_bbs_frequencies_gcov_type (region_copy, n_region, entry_count,
5140 scale_bbs_frequencies_int (region, n_region, total_freq - entry_freq,
5142 scale_bbs_frequencies_int (region_copy, n_region, entry_freq, total_freq);
5147 loop->header = exit->dest;
5148 loop->latch = exit->src;
5151 /* Redirect the entry and add the phi node arguments. */
5152 redirected = redirect_edge_and_branch (entry, get_bb_copy (entry->dest));
5153 gcc_assert (redirected != NULL);
5154 flush_pending_stmts (entry);
5156 /* Concerning updating of dominators: We must recount dominators
5157 for entry block and its copy. Anything that is outside of the
5158 region, but was dominated by something inside needs recounting as
5160 set_immediate_dominator (CDI_DOMINATORS, entry->dest, entry->src);
5161 VEC_safe_push (basic_block, heap, doms, get_bb_original (entry->dest));
5162 iterate_fix_dominators (CDI_DOMINATORS, doms, false);
5163 VEC_free (basic_block, heap, doms);
5165 /* Add the other PHI node arguments. */
5166 add_phi_args_after_copy (region_copy, n_region, NULL);
5168 /* Update the SSA web. */
5169 update_ssa (TODO_update_ssa);
5171 if (free_region_copy)
5174 free_original_copy_tables ();
5178 /* Duplicates REGION consisting of N_REGION blocks. The new blocks
5179 are stored to REGION_COPY in the same order in that they appear
5180 in REGION, if REGION_COPY is not NULL. ENTRY is the entry to
5181 the region, EXIT an exit from it. The condition guarding EXIT
5182 is moved to ENTRY. Returns true if duplication succeeds, false
5208 gimple_duplicate_sese_tail (edge entry ATTRIBUTE_UNUSED, edge exit ATTRIBUTE_UNUSED,
5209 basic_block *region ATTRIBUTE_UNUSED, unsigned n_region ATTRIBUTE_UNUSED,
5210 basic_block *region_copy ATTRIBUTE_UNUSED)
5213 bool free_region_copy = false;
5214 struct loop *loop = exit->dest->loop_father;
5215 struct loop *orig_loop = entry->dest->loop_father;
5216 basic_block switch_bb, entry_bb, nentry_bb;
5217 VEC (basic_block, heap) *doms;
5218 int total_freq = 0, exit_freq = 0;
5219 gcov_type total_count = 0, exit_count = 0;
5220 edge exits[2], nexits[2], e;
5221 gimple_stmt_iterator gsi,gsi1;
5223 edge sorig, snew, orig_e;
5224 basic_block exit_bb;
5226 VEC (edge, heap) *redirect_edges;
5227 basic_block iters_bb, orig_src;
5230 gcc_assert (EDGE_COUNT (exit->src->succs) == 2);
5232 exits[1] = EDGE_SUCC (exit->src, EDGE_SUCC (exit->src, 0) == exit);
5234 if (!can_copy_bbs_p (region, n_region))
5237 /* Some sanity checking. Note that we do not check for all possible
5238 missuses of the functions. I.e. if you ask to copy something weird
5239 (e.g., in the example, if there is a jump from inside to the middle
5240 of some_code, or come_code defines some of the values used in cond)
5241 it will work, but the resulting code will not be correct. */
5242 for (i = 0; i < n_region; i++)
5244 if (region[i] == orig_loop->latch)
5248 initialize_original_copy_tables ();
5249 set_loop_copy (orig_loop, loop);
5250 duplicate_subloops (orig_loop, loop);
5254 region_copy = XNEWVEC (basic_block, n_region);
5255 free_region_copy = true;
5258 gcc_assert (!need_ssa_update_p (cfun));
5260 /* Record blocks outside the region that are dominated by something
5262 doms = get_dominated_by_region (CDI_DOMINATORS, region, n_region);
5264 if (exit->src->count)
5266 total_count = exit->src->count;
5267 exit_count = exit->count;
5268 /* Fix up corner cases, to avoid division by zero or creation of negative
5270 if (exit_count > total_count)
5271 exit_count = total_count;
5275 total_freq = exit->src->frequency;
5276 exit_freq = EDGE_FREQUENCY (exit);
5277 /* Fix up corner cases, to avoid division by zero or creation of negative
5279 if (total_freq == 0)
5281 if (exit_freq > total_freq)
5282 exit_freq = total_freq;
5285 copy_bbs (region, n_region, region_copy, exits, 2, nexits, orig_loop,
5286 split_edge_bb_loc (exit));
5289 scale_bbs_frequencies_gcov_type (region, n_region,
5290 total_count - exit_count,
5292 scale_bbs_frequencies_gcov_type (region_copy, n_region, exit_count,
5297 scale_bbs_frequencies_int (region, n_region, total_freq - exit_freq,
5299 scale_bbs_frequencies_int (region_copy, n_region, exit_freq, total_freq);
5302 /* Create the switch block, and put the exit condition to it. */
5303 entry_bb = entry->dest;
5304 nentry_bb = get_bb_copy (entry_bb);
5305 if (!last_stmt (entry->src)
5306 || !stmt_ends_bb_p (last_stmt (entry->src)))
5307 switch_bb = entry->src;
5309 switch_bb = split_edge (entry);
5310 set_immediate_dominator (CDI_DOMINATORS, nentry_bb, switch_bb);
5312 gsi = gsi_last_bb (switch_bb);
5313 cond_stmt = last_stmt (exit->src);
5314 gcc_assert (gimple_code (cond_stmt) == GIMPLE_COND);
5315 cond_stmt = gimple_copy (cond_stmt);
5317 /* If the block consisting of the exit condition has the latch as
5318 successor, then the body of the loop is executed before
5319 the exit condition is tested. In such case, moving the
5320 condition to the entry, causes that the loop will iterate
5321 one less iteration (which is the wanted outcome, since we
5322 peel out the last iteration). If the body is executed after
5323 the condition, moving the condition to the entry requires
5324 decrementing one iteration. */
5325 if (exits[1]->dest == orig_loop->latch)
5326 new_rhs = gimple_cond_rhs (cond_stmt);
5329 new_rhs = fold_build2 (MINUS_EXPR, TREE_TYPE (gimple_cond_rhs (cond_stmt)),
5330 gimple_cond_rhs (cond_stmt),
5331 build_int_cst (TREE_TYPE (gimple_cond_rhs (cond_stmt)), 1));
5333 if (TREE_CODE (gimple_cond_rhs (cond_stmt)) == SSA_NAME)
5335 iters_bb = gimple_bb (SSA_NAME_DEF_STMT (gimple_cond_rhs (cond_stmt)));
5336 for (gsi1 = gsi_start_bb (iters_bb); !gsi_end_p (gsi1); gsi_next (&gsi1))
5337 if (gsi_stmt (gsi1) == SSA_NAME_DEF_STMT (gimple_cond_rhs (cond_stmt)))
5340 new_rhs = force_gimple_operand_gsi (&gsi1, new_rhs, true,
5341 NULL_TREE,false,GSI_CONTINUE_LINKING);
5344 gimple_cond_set_rhs (cond_stmt, unshare_expr (new_rhs));
5345 gimple_cond_set_lhs (cond_stmt, unshare_expr (gimple_cond_lhs (cond_stmt)));
5346 gsi_insert_after (&gsi, cond_stmt, GSI_NEW_STMT);
5348 sorig = single_succ_edge (switch_bb);
5349 sorig->flags = exits[1]->flags;
5350 snew = make_edge (switch_bb, nentry_bb, exits[0]->flags);
5352 /* Register the new edge from SWITCH_BB in loop exit lists. */
5353 rescan_loop_exit (snew, true, false);
5355 /* Add the PHI node arguments. */
5356 add_phi_args_after_copy (region_copy, n_region, snew);
5358 /* Get rid of now superfluous conditions and associated edges (and phi node
5360 exit_bb = exit->dest;
5362 e = redirect_edge_and_branch (exits[0], exits[1]->dest);
5363 PENDING_STMT (e) = NULL;
5365 /* If the block consisting of the exit condition has the latch as
5366 successor, then the body of the loop is executed before
5367 the exit condition is tested.
5370 { cond } (exit[0]) -> { latch }
5377 In such case, the equivalent copied edge nexits[1]
5378 (for the peeled iteration) needs to be redirected to exit_bb.
5382 { cond } (exit[0]) -> { body }
5389 exit[0] is pointing to the body of the loop,
5390 and the equivalent nexits[0] needs to be redirected to
5391 the copied body (of the peeled iteration). */
5393 if (exits[1]->dest == orig_loop->latch)
5394 e = redirect_edge_and_branch (nexits[1], nexits[0]->dest);
5396 e = redirect_edge_and_branch (nexits[0], nexits[1]->dest);
5397 PENDING_STMT (e) = NULL;
5399 redirect_edges = VEC_alloc (edge, heap, 10);
5401 for (i = 0; i < n_region; i++)
5402 region_copy[i]->flags |= BB_DUPLICATED;
5404 /* Iterate all incoming edges to latch. All those coming from
5405 copied bbs will be redirected to exit_bb. */
5406 FOR_EACH_EDGE (e, ei, orig_loop->latch->preds)
5408 if (e->src->flags & BB_DUPLICATED)
5409 VEC_safe_push (edge, heap, redirect_edges, e);
5412 for (i = 0; i < n_region; i++)
5413 region_copy[i]->flags &= ~BB_DUPLICATED;
5415 for (i = 0; VEC_iterate (edge, redirect_edges, i, e); ++i)
5417 e = redirect_edge_and_branch (e, exit_bb);
5418 PENDING_STMT (e) = NULL;
5419 orig_src = get_bb_original (e->src);
5420 orig_e = find_edge (orig_src, orig_loop->latch);
5421 add_phi_args_after_redirect (e, orig_e);
5424 VEC_free (edge, heap, redirect_edges);
5426 /* Anything that is outside of the region, but was dominated by something
5427 inside needs to update dominance info. */
5428 iterate_fix_dominators (CDI_DOMINATORS, doms, false);
5429 VEC_free (basic_block, heap, doms);
5431 /* Update the SSA web. */
5432 update_ssa (TODO_update_ssa);
5434 if (free_region_copy)
5437 free_original_copy_tables ();
5441 /* Add all the blocks dominated by ENTRY to the array BBS_P. Stop
5442 adding blocks when the dominator traversal reaches EXIT. This
5443 function silently assumes that ENTRY strictly dominates EXIT. */
5446 gather_blocks_in_sese_region (basic_block entry, basic_block exit,
5447 VEC(basic_block,heap) **bbs_p)
5451 for (son = first_dom_son (CDI_DOMINATORS, entry);
5453 son = next_dom_son (CDI_DOMINATORS, son))
5455 VEC_safe_push (basic_block, heap, *bbs_p, son);
5457 gather_blocks_in_sese_region (son, exit, bbs_p);
5461 /* Replaces *TP with a duplicate (belonging to function TO_CONTEXT).
5462 The duplicates are recorded in VARS_MAP. */
5465 replace_by_duplicate_decl (tree *tp, struct pointer_map_t *vars_map,
5468 tree t = *tp, new_t;
5469 struct function *f = DECL_STRUCT_FUNCTION (to_context);
5472 if (DECL_CONTEXT (t) == to_context)
5475 loc = pointer_map_contains (vars_map, t);
5479 loc = pointer_map_insert (vars_map, t);
5483 new_t = copy_var_decl (t, DECL_NAME (t), TREE_TYPE (t));
5484 f->local_decls = tree_cons (NULL_TREE, new_t, f->local_decls);
5488 gcc_assert (TREE_CODE (t) == CONST_DECL);
5489 new_t = copy_node (t);
5491 DECL_CONTEXT (new_t) = to_context;
5496 new_t = (tree) *loc;
5502 /* Creates an ssa name in TO_CONTEXT equivalent to NAME.
5503 VARS_MAP maps old ssa names and var_decls to the new ones. */
5506 replace_ssa_name (tree name, struct pointer_map_t *vars_map,
5510 tree new_name, decl = SSA_NAME_VAR (name);
5512 gcc_assert (is_gimple_reg (name));
5514 loc = pointer_map_contains (vars_map, name);
5518 replace_by_duplicate_decl (&decl, vars_map, to_context);
5520 push_cfun (DECL_STRUCT_FUNCTION (to_context));
5521 if (gimple_in_ssa_p (cfun))
5522 add_referenced_var (decl);
5524 new_name = make_ssa_name (decl, SSA_NAME_DEF_STMT (name));
5525 if (SSA_NAME_IS_DEFAULT_DEF (name))
5526 set_default_def (decl, new_name);
5529 loc = pointer_map_insert (vars_map, name);
5533 new_name = (tree) *loc;
5544 struct pointer_map_t *vars_map;
5545 htab_t new_label_map;
5546 struct pointer_map_t *eh_map;
5550 /* Helper for move_block_to_fn. Set TREE_BLOCK in every expression
5551 contained in *TP if it has been ORIG_BLOCK previously and change the
5552 DECL_CONTEXT of every local variable referenced in *TP. */
5555 move_stmt_op (tree *tp, int *walk_subtrees, void *data)
5557 struct walk_stmt_info *wi = (struct walk_stmt_info *) data;
5558 struct move_stmt_d *p = (struct move_stmt_d *) wi->info;
5562 /* We should never have TREE_BLOCK set on non-statements. */
5563 gcc_assert (!TREE_BLOCK (t));
5565 else if (DECL_P (t) || TREE_CODE (t) == SSA_NAME)
5567 if (TREE_CODE (t) == SSA_NAME)
5568 *tp = replace_ssa_name (t, p->vars_map, p->to_context);
5569 else if (TREE_CODE (t) == LABEL_DECL)
5571 if (p->new_label_map)
5573 struct tree_map in, *out;
5575 out = (struct tree_map *)
5576 htab_find_with_hash (p->new_label_map, &in, DECL_UID (t));
5581 DECL_CONTEXT (t) = p->to_context;
5583 else if (p->remap_decls_p)
5585 /* Replace T with its duplicate. T should no longer appear in the
5586 parent function, so this looks wasteful; however, it may appear
5587 in referenced_vars, and more importantly, as virtual operands of
5588 statements, and in alias lists of other variables. It would be
5589 quite difficult to expunge it from all those places. ??? It might
5590 suffice to do this for addressable variables. */
5591 if ((TREE_CODE (t) == VAR_DECL
5592 && !is_global_var (t))
5593 || TREE_CODE (t) == CONST_DECL)
5594 replace_by_duplicate_decl (tp, p->vars_map, p->to_context);
5597 && gimple_in_ssa_p (cfun))
5599 push_cfun (DECL_STRUCT_FUNCTION (p->to_context));
5600 add_referenced_var (*tp);
5606 else if (TYPE_P (t))
5612 /* Helper for move_stmt_r. Given an EH region number for the source
5613 function, map that to the duplicate EH regio number in the dest. */
5616 move_stmt_eh_region_nr (int old_nr, struct move_stmt_d *p)
5618 eh_region old_r, new_r;
5621 old_r = get_eh_region_from_number (old_nr);
5622 slot = pointer_map_contains (p->eh_map, old_r);
5623 new_r = (eh_region) *slot;
5625 return new_r->index;
5628 /* Similar, but operate on INTEGER_CSTs. */
5631 move_stmt_eh_region_tree_nr (tree old_t_nr, struct move_stmt_d *p)
5635 old_nr = tree_low_cst (old_t_nr, 0);
5636 new_nr = move_stmt_eh_region_nr (old_nr, p);
5638 return build_int_cst (NULL, new_nr);
5641 /* Like move_stmt_op, but for gimple statements.
5643 Helper for move_block_to_fn. Set GIMPLE_BLOCK in every expression
5644 contained in the current statement in *GSI_P and change the
5645 DECL_CONTEXT of every local variable referenced in the current
5649 move_stmt_r (gimple_stmt_iterator *gsi_p, bool *handled_ops_p,
5650 struct walk_stmt_info *wi)
5652 struct move_stmt_d *p = (struct move_stmt_d *) wi->info;
5653 gimple stmt = gsi_stmt (*gsi_p);
5654 tree block = gimple_block (stmt);
5656 if (p->orig_block == NULL_TREE
5657 || block == p->orig_block
5658 || block == NULL_TREE)
5659 gimple_set_block (stmt, p->new_block);
5660 #ifdef ENABLE_CHECKING
5661 else if (block != p->new_block)
5663 while (block && block != p->orig_block)
5664 block = BLOCK_SUPERCONTEXT (block);
5669 switch (gimple_code (stmt))
5672 /* Remap the region numbers for __builtin_eh_{pointer,filter}. */
5674 tree r, fndecl = gimple_call_fndecl (stmt);
5675 if (fndecl && DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_NORMAL)
5676 switch (DECL_FUNCTION_CODE (fndecl))
5678 case BUILT_IN_EH_COPY_VALUES:
5679 r = gimple_call_arg (stmt, 1);
5680 r = move_stmt_eh_region_tree_nr (r, p);
5681 gimple_call_set_arg (stmt, 1, r);
5684 case BUILT_IN_EH_POINTER:
5685 case BUILT_IN_EH_FILTER:
5686 r = gimple_call_arg (stmt, 0);
5687 r = move_stmt_eh_region_tree_nr (r, p);
5688 gimple_call_set_arg (stmt, 0, r);
5699 int r = gimple_resx_region (stmt);
5700 r = move_stmt_eh_region_nr (r, p);
5701 gimple_resx_set_region (stmt, r);
5705 case GIMPLE_EH_DISPATCH:
5707 int r = gimple_eh_dispatch_region (stmt);
5708 r = move_stmt_eh_region_nr (r, p);
5709 gimple_eh_dispatch_set_region (stmt, r);
5713 case GIMPLE_OMP_RETURN:
5714 case GIMPLE_OMP_CONTINUE:
5717 if (is_gimple_omp (stmt))
5719 /* Do not remap variables inside OMP directives. Variables
5720 referenced in clauses and directive header belong to the
5721 parent function and should not be moved into the child
5723 bool save_remap_decls_p = p->remap_decls_p;
5724 p->remap_decls_p = false;
5725 *handled_ops_p = true;
5727 walk_gimple_seq (gimple_omp_body (stmt), move_stmt_r,
5730 p->remap_decls_p = save_remap_decls_p;
5738 /* Marks virtual operands of all statements in basic blocks BBS for
5742 mark_virtual_ops_in_bb (basic_block bb)
5744 gimple_stmt_iterator gsi;
5746 for (gsi = gsi_start_phis (bb); !gsi_end_p (gsi); gsi_next (&gsi))
5747 mark_virtual_ops_for_renaming (gsi_stmt (gsi));
5749 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
5750 mark_virtual_ops_for_renaming (gsi_stmt (gsi));
5753 /* Move basic block BB from function CFUN to function DEST_FN. The
5754 block is moved out of the original linked list and placed after
5755 block AFTER in the new list. Also, the block is removed from the
5756 original array of blocks and placed in DEST_FN's array of blocks.
5757 If UPDATE_EDGE_COUNT_P is true, the edge counts on both CFGs is
5758 updated to reflect the moved edges.
5760 The local variables are remapped to new instances, VARS_MAP is used
5761 to record the mapping. */
5764 move_block_to_fn (struct function *dest_cfun, basic_block bb,
5765 basic_block after, bool update_edge_count_p,
5766 struct move_stmt_d *d)
5768 struct control_flow_graph *cfg;
5771 gimple_stmt_iterator si;
5772 unsigned old_len, new_len;
5774 /* Remove BB from dominance structures. */
5775 delete_from_dominance_info (CDI_DOMINATORS, bb);
5777 remove_bb_from_loops (bb);
5779 /* Link BB to the new linked list. */
5780 move_block_after (bb, after);
5782 /* Update the edge count in the corresponding flowgraphs. */
5783 if (update_edge_count_p)
5784 FOR_EACH_EDGE (e, ei, bb->succs)
5786 cfun->cfg->x_n_edges--;
5787 dest_cfun->cfg->x_n_edges++;
5790 /* Remove BB from the original basic block array. */
5791 VEC_replace (basic_block, cfun->cfg->x_basic_block_info, bb->index, NULL);
5792 cfun->cfg->x_n_basic_blocks--;
5794 /* Grow DEST_CFUN's basic block array if needed. */
5795 cfg = dest_cfun->cfg;
5796 cfg->x_n_basic_blocks++;
5797 if (bb->index >= cfg->x_last_basic_block)
5798 cfg->x_last_basic_block = bb->index + 1;
5800 old_len = VEC_length (basic_block, cfg->x_basic_block_info);
5801 if ((unsigned) cfg->x_last_basic_block >= old_len)
5803 new_len = cfg->x_last_basic_block + (cfg->x_last_basic_block + 3) / 4;
5804 VEC_safe_grow_cleared (basic_block, gc, cfg->x_basic_block_info,
5808 VEC_replace (basic_block, cfg->x_basic_block_info,
5811 /* Remap the variables in phi nodes. */
5812 for (si = gsi_start_phis (bb); !gsi_end_p (si); )
5814 gimple phi = gsi_stmt (si);
5816 tree op = PHI_RESULT (phi);
5819 if (!is_gimple_reg (op))
5821 /* Remove the phi nodes for virtual operands (alias analysis will be
5822 run for the new function, anyway). */
5823 remove_phi_node (&si, true);
5827 SET_PHI_RESULT (phi,
5828 replace_ssa_name (op, d->vars_map, dest_cfun->decl));
5829 FOR_EACH_PHI_ARG (use, phi, oi, SSA_OP_USE)
5831 op = USE_FROM_PTR (use);
5832 if (TREE_CODE (op) == SSA_NAME)
5833 SET_USE (use, replace_ssa_name (op, d->vars_map, dest_cfun->decl));
5839 for (si = gsi_start_bb (bb); !gsi_end_p (si); gsi_next (&si))
5841 gimple stmt = gsi_stmt (si);
5842 struct walk_stmt_info wi;
5844 memset (&wi, 0, sizeof (wi));
5846 walk_gimple_stmt (&si, move_stmt_r, move_stmt_op, &wi);
5848 if (gimple_code (stmt) == GIMPLE_LABEL)
5850 tree label = gimple_label_label (stmt);
5851 int uid = LABEL_DECL_UID (label);
5853 gcc_assert (uid > -1);
5855 old_len = VEC_length (basic_block, cfg->x_label_to_block_map);
5856 if (old_len <= (unsigned) uid)
5858 new_len = 3 * uid / 2 + 1;
5859 VEC_safe_grow_cleared (basic_block, gc,
5860 cfg->x_label_to_block_map, new_len);
5863 VEC_replace (basic_block, cfg->x_label_to_block_map, uid, bb);
5864 VEC_replace (basic_block, cfun->cfg->x_label_to_block_map, uid, NULL);
5866 gcc_assert (DECL_CONTEXT (label) == dest_cfun->decl);
5868 if (uid >= dest_cfun->cfg->last_label_uid)
5869 dest_cfun->cfg->last_label_uid = uid + 1;
5872 maybe_duplicate_eh_stmt_fn (dest_cfun, stmt, cfun, stmt, d->eh_map, 0);
5873 remove_stmt_from_eh_lp_fn (cfun, stmt);
5875 gimple_duplicate_stmt_histograms (dest_cfun, stmt, cfun, stmt);
5876 gimple_remove_stmt_histograms (cfun, stmt);
5878 /* We cannot leave any operands allocated from the operand caches of
5879 the current function. */
5880 free_stmt_operands (stmt);
5881 push_cfun (dest_cfun);
5886 FOR_EACH_EDGE (e, ei, bb->succs)
5889 tree block = e->goto_block;
5890 if (d->orig_block == NULL_TREE
5891 || block == d->orig_block)
5892 e->goto_block = d->new_block;
5893 #ifdef ENABLE_CHECKING
5894 else if (block != d->new_block)
5896 while (block && block != d->orig_block)
5897 block = BLOCK_SUPERCONTEXT (block);
5904 /* Examine the statements in BB (which is in SRC_CFUN); find and return
5905 the outermost EH region. Use REGION as the incoming base EH region. */
5908 find_outermost_region_in_block (struct function *src_cfun,
5909 basic_block bb, eh_region region)
5911 gimple_stmt_iterator si;
5913 for (si = gsi_start_bb (bb); !gsi_end_p (si); gsi_next (&si))
5915 gimple stmt = gsi_stmt (si);
5916 eh_region stmt_region;
5919 lp_nr = lookup_stmt_eh_lp_fn (src_cfun, stmt);
5920 stmt_region = get_eh_region_from_lp_number_fn (src_cfun, lp_nr);
5924 region = stmt_region;
5925 else if (stmt_region != region)
5927 region = eh_region_outermost (src_cfun, stmt_region, region);
5928 gcc_assert (region != NULL);
5937 new_label_mapper (tree decl, void *data)
5939 htab_t hash = (htab_t) data;
5943 gcc_assert (TREE_CODE (decl) == LABEL_DECL);
5945 m = XNEW (struct tree_map);
5946 m->hash = DECL_UID (decl);
5947 m->base.from = decl;
5948 m->to = create_artificial_label (UNKNOWN_LOCATION);
5949 LABEL_DECL_UID (m->to) = LABEL_DECL_UID (decl);
5950 if (LABEL_DECL_UID (m->to) >= cfun->cfg->last_label_uid)
5951 cfun->cfg->last_label_uid = LABEL_DECL_UID (m->to) + 1;
5953 slot = htab_find_slot_with_hash (hash, m, m->hash, INSERT);
5954 gcc_assert (*slot == NULL);
5961 /* Change DECL_CONTEXT of all BLOCK_VARS in block, including
5965 replace_block_vars_by_duplicates (tree block, struct pointer_map_t *vars_map,
5970 for (tp = &BLOCK_VARS (block); *tp; tp = &TREE_CHAIN (*tp))
5973 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != CONST_DECL)
5975 replace_by_duplicate_decl (&t, vars_map, to_context);
5978 if (TREE_CODE (*tp) == VAR_DECL && DECL_HAS_VALUE_EXPR_P (*tp))
5980 SET_DECL_VALUE_EXPR (t, DECL_VALUE_EXPR (*tp));
5981 DECL_HAS_VALUE_EXPR_P (t) = 1;
5983 TREE_CHAIN (t) = TREE_CHAIN (*tp);
5988 for (block = BLOCK_SUBBLOCKS (block); block; block = BLOCK_CHAIN (block))
5989 replace_block_vars_by_duplicates (block, vars_map, to_context);
5992 /* Move a single-entry, single-exit region delimited by ENTRY_BB and
5993 EXIT_BB to function DEST_CFUN. The whole region is replaced by a
5994 single basic block in the original CFG and the new basic block is
5995 returned. DEST_CFUN must not have a CFG yet.
5997 Note that the region need not be a pure SESE region. Blocks inside
5998 the region may contain calls to abort/exit. The only restriction
5999 is that ENTRY_BB should be the only entry point and it must
6002 Change TREE_BLOCK of all statements in ORIG_BLOCK to the new
6003 functions outermost BLOCK, move all subblocks of ORIG_BLOCK
6004 to the new function.
6006 All local variables referenced in the region are assumed to be in
6007 the corresponding BLOCK_VARS and unexpanded variable lists
6008 associated with DEST_CFUN. */
6011 move_sese_region_to_fn (struct function *dest_cfun, basic_block entry_bb,
6012 basic_block exit_bb, tree orig_block)
6014 VEC(basic_block,heap) *bbs, *dom_bbs;
6015 basic_block dom_entry = get_immediate_dominator (CDI_DOMINATORS, entry_bb);
6016 basic_block after, bb, *entry_pred, *exit_succ, abb;
6017 struct function *saved_cfun = cfun;
6018 int *entry_flag, *exit_flag;
6019 unsigned *entry_prob, *exit_prob;
6020 unsigned i, num_entry_edges, num_exit_edges;
6023 htab_t new_label_map;
6024 struct pointer_map_t *vars_map, *eh_map;
6025 struct loop *loop = entry_bb->loop_father;
6026 struct move_stmt_d d;
6028 /* If ENTRY does not strictly dominate EXIT, this cannot be an SESE
6030 gcc_assert (entry_bb != exit_bb
6032 || dominated_by_p (CDI_DOMINATORS, exit_bb, entry_bb)));
6034 /* Collect all the blocks in the region. Manually add ENTRY_BB
6035 because it won't be added by dfs_enumerate_from. */
6037 VEC_safe_push (basic_block, heap, bbs, entry_bb);
6038 gather_blocks_in_sese_region (entry_bb, exit_bb, &bbs);
6040 /* The blocks that used to be dominated by something in BBS will now be
6041 dominated by the new block. */
6042 dom_bbs = get_dominated_by_region (CDI_DOMINATORS,
6043 VEC_address (basic_block, bbs),
6044 VEC_length (basic_block, bbs));
6046 /* Detach ENTRY_BB and EXIT_BB from CFUN->CFG. We need to remember
6047 the predecessor edges to ENTRY_BB and the successor edges to
6048 EXIT_BB so that we can re-attach them to the new basic block that
6049 will replace the region. */
6050 num_entry_edges = EDGE_COUNT (entry_bb->preds);
6051 entry_pred = (basic_block *) xcalloc (num_entry_edges, sizeof (basic_block));
6052 entry_flag = (int *) xcalloc (num_entry_edges, sizeof (int));
6053 entry_prob = XNEWVEC (unsigned, num_entry_edges);
6055 for (ei = ei_start (entry_bb->preds); (e = ei_safe_edge (ei)) != NULL;)
6057 entry_prob[i] = e->probability;
6058 entry_flag[i] = e->flags;
6059 entry_pred[i++] = e->src;
6065 num_exit_edges = EDGE_COUNT (exit_bb->succs);
6066 exit_succ = (basic_block *) xcalloc (num_exit_edges,
6067 sizeof (basic_block));
6068 exit_flag = (int *) xcalloc (num_exit_edges, sizeof (int));
6069 exit_prob = XNEWVEC (unsigned, num_exit_edges);
6071 for (ei = ei_start (exit_bb->succs); (e = ei_safe_edge (ei)) != NULL;)
6073 exit_prob[i] = e->probability;
6074 exit_flag[i] = e->flags;
6075 exit_succ[i++] = e->dest;
6087 /* Switch context to the child function to initialize DEST_FN's CFG. */
6088 gcc_assert (dest_cfun->cfg == NULL);
6089 push_cfun (dest_cfun);
6091 init_empty_tree_cfg ();
6093 /* Initialize EH information for the new function. */
6095 new_label_map = NULL;
6098 eh_region region = NULL;
6100 for (i = 0; VEC_iterate (basic_block, bbs, i, bb); i++)
6101 region = find_outermost_region_in_block (saved_cfun, bb, region);
6103 init_eh_for_function ();
6106 new_label_map = htab_create (17, tree_map_hash, tree_map_eq, free);
6107 eh_map = duplicate_eh_regions (saved_cfun, region, 0,
6108 new_label_mapper, new_label_map);
6114 /* Move blocks from BBS into DEST_CFUN. */
6115 gcc_assert (VEC_length (basic_block, bbs) >= 2);
6116 after = dest_cfun->cfg->x_entry_block_ptr;
6117 vars_map = pointer_map_create ();
6119 memset (&d, 0, sizeof (d));
6120 d.orig_block = orig_block;
6121 d.new_block = DECL_INITIAL (dest_cfun->decl);
6122 d.from_context = cfun->decl;
6123 d.to_context = dest_cfun->decl;
6124 d.vars_map = vars_map;
6125 d.new_label_map = new_label_map;
6127 d.remap_decls_p = true;
6129 for (i = 0; VEC_iterate (basic_block, bbs, i, bb); i++)
6131 /* No need to update edge counts on the last block. It has
6132 already been updated earlier when we detached the region from
6133 the original CFG. */
6134 move_block_to_fn (dest_cfun, bb, after, bb != exit_bb, &d);
6138 /* Rewire BLOCK_SUBBLOCKS of orig_block. */
6142 gcc_assert (BLOCK_SUBBLOCKS (DECL_INITIAL (dest_cfun->decl))
6144 BLOCK_SUBBLOCKS (DECL_INITIAL (dest_cfun->decl))
6145 = BLOCK_SUBBLOCKS (orig_block);
6146 for (block = BLOCK_SUBBLOCKS (orig_block);
6147 block; block = BLOCK_CHAIN (block))
6148 BLOCK_SUPERCONTEXT (block) = DECL_INITIAL (dest_cfun->decl);
6149 BLOCK_SUBBLOCKS (orig_block) = NULL_TREE;
6152 replace_block_vars_by_duplicates (DECL_INITIAL (dest_cfun->decl),
6153 vars_map, dest_cfun->decl);
6156 htab_delete (new_label_map);
6158 pointer_map_destroy (eh_map);
6159 pointer_map_destroy (vars_map);
6161 /* Rewire the entry and exit blocks. The successor to the entry
6162 block turns into the successor of DEST_FN's ENTRY_BLOCK_PTR in
6163 the child function. Similarly, the predecessor of DEST_FN's
6164 EXIT_BLOCK_PTR turns into the predecessor of EXIT_BLOCK_PTR. We
6165 need to switch CFUN between DEST_CFUN and SAVED_CFUN so that the
6166 various CFG manipulation function get to the right CFG.
6168 FIXME, this is silly. The CFG ought to become a parameter to
6170 push_cfun (dest_cfun);
6171 make_edge (ENTRY_BLOCK_PTR, entry_bb, EDGE_FALLTHRU);
6173 make_edge (exit_bb, EXIT_BLOCK_PTR, 0);
6176 /* Back in the original function, the SESE region has disappeared,
6177 create a new basic block in its place. */
6178 bb = create_empty_bb (entry_pred[0]);
6180 add_bb_to_loop (bb, loop);
6181 for (i = 0; i < num_entry_edges; i++)
6183 e = make_edge (entry_pred[i], bb, entry_flag[i]);
6184 e->probability = entry_prob[i];
6187 for (i = 0; i < num_exit_edges; i++)
6189 e = make_edge (bb, exit_succ[i], exit_flag[i]);
6190 e->probability = exit_prob[i];
6193 set_immediate_dominator (CDI_DOMINATORS, bb, dom_entry);
6194 for (i = 0; VEC_iterate (basic_block, dom_bbs, i, abb); i++)
6195 set_immediate_dominator (CDI_DOMINATORS, abb, bb);
6196 VEC_free (basic_block, heap, dom_bbs);
6207 VEC_free (basic_block, heap, bbs);
6213 /* Dump FUNCTION_DECL FN to file FILE using FLAGS (see TDF_* in tree-pass.h)
6217 dump_function_to_file (tree fn, FILE *file, int flags)
6219 tree arg, vars, var;
6220 struct function *dsf;
6221 bool ignore_topmost_bind = false, any_var = false;
6225 fprintf (file, "%s (", lang_hooks.decl_printable_name (fn, 2));
6227 arg = DECL_ARGUMENTS (fn);
6230 print_generic_expr (file, TREE_TYPE (arg), dump_flags);
6231 fprintf (file, " ");
6232 print_generic_expr (file, arg, dump_flags);
6233 if (flags & TDF_VERBOSE)
6234 print_node (file, "", arg, 4);
6235 if (TREE_CHAIN (arg))
6236 fprintf (file, ", ");
6237 arg = TREE_CHAIN (arg);
6239 fprintf (file, ")\n");
6241 if (flags & TDF_VERBOSE)
6242 print_node (file, "", fn, 2);
6244 dsf = DECL_STRUCT_FUNCTION (fn);
6245 if (dsf && (flags & TDF_EH))
6246 dump_eh_tree (file, dsf);
6248 if (flags & TDF_RAW && !gimple_has_body_p (fn))
6250 dump_node (fn, TDF_SLIM | flags, file);
6254 /* Switch CFUN to point to FN. */
6255 push_cfun (DECL_STRUCT_FUNCTION (fn));
6257 /* When GIMPLE is lowered, the variables are no longer available in
6258 BIND_EXPRs, so display them separately. */
6259 if (cfun && cfun->decl == fn && cfun->local_decls)
6261 ignore_topmost_bind = true;
6263 fprintf (file, "{\n");
6264 for (vars = cfun->local_decls; vars; vars = TREE_CHAIN (vars))
6266 var = TREE_VALUE (vars);
6268 print_generic_decl (file, var, flags);
6269 if (flags & TDF_VERBOSE)
6270 print_node (file, "", var, 4);
6271 fprintf (file, "\n");
6277 if (cfun && cfun->decl == fn && cfun->cfg && basic_block_info)
6279 /* If the CFG has been built, emit a CFG-based dump. */
6280 check_bb_profile (ENTRY_BLOCK_PTR, file);
6281 if (!ignore_topmost_bind)
6282 fprintf (file, "{\n");
6284 if (any_var && n_basic_blocks)
6285 fprintf (file, "\n");
6288 gimple_dump_bb (bb, file, 2, flags);
6290 fprintf (file, "}\n");
6291 check_bb_profile (EXIT_BLOCK_PTR, file);
6293 else if (DECL_SAVED_TREE (fn) == NULL)
6295 /* The function is now in GIMPLE form but the CFG has not been
6296 built yet. Emit the single sequence of GIMPLE statements
6297 that make up its body. */
6298 gimple_seq body = gimple_body (fn);
6300 if (gimple_seq_first_stmt (body)
6301 && gimple_seq_first_stmt (body) == gimple_seq_last_stmt (body)
6302 && gimple_code (gimple_seq_first_stmt (body)) == GIMPLE_BIND)
6303 print_gimple_seq (file, body, 0, flags);
6306 if (!ignore_topmost_bind)
6307 fprintf (file, "{\n");
6310 fprintf (file, "\n");
6312 print_gimple_seq (file, body, 2, flags);
6313 fprintf (file, "}\n");
6320 /* Make a tree based dump. */
6321 chain = DECL_SAVED_TREE (fn);
6323 if (chain && TREE_CODE (chain) == BIND_EXPR)
6325 if (ignore_topmost_bind)
6327 chain = BIND_EXPR_BODY (chain);
6335 if (!ignore_topmost_bind)
6336 fprintf (file, "{\n");
6341 fprintf (file, "\n");
6343 print_generic_stmt_indented (file, chain, flags, indent);
6344 if (ignore_topmost_bind)
6345 fprintf (file, "}\n");
6348 fprintf (file, "\n\n");
6355 /* Dump FUNCTION_DECL FN to stderr using FLAGS (see TDF_* in tree.h) */
6358 debug_function (tree fn, int flags)
6360 dump_function_to_file (fn, stderr, flags);
6364 /* Print on FILE the indexes for the predecessors of basic_block BB. */
6367 print_pred_bbs (FILE *file, basic_block bb)
6372 FOR_EACH_EDGE (e, ei, bb->preds)
6373 fprintf (file, "bb_%d ", e->src->index);
6377 /* Print on FILE the indexes for the successors of basic_block BB. */
6380 print_succ_bbs (FILE *file, basic_block bb)
6385 FOR_EACH_EDGE (e, ei, bb->succs)
6386 fprintf (file, "bb_%d ", e->dest->index);
6389 /* Print to FILE the basic block BB following the VERBOSITY level. */
6392 print_loops_bb (FILE *file, basic_block bb, int indent, int verbosity)
6394 char *s_indent = (char *) alloca ((size_t) indent + 1);
6395 memset ((void *) s_indent, ' ', (size_t) indent);
6396 s_indent[indent] = '\0';
6398 /* Print basic_block's header. */
6401 fprintf (file, "%s bb_%d (preds = {", s_indent, bb->index);
6402 print_pred_bbs (file, bb);
6403 fprintf (file, "}, succs = {");
6404 print_succ_bbs (file, bb);
6405 fprintf (file, "})\n");
6408 /* Print basic_block's body. */
6411 fprintf (file, "%s {\n", s_indent);
6412 gimple_dump_bb (bb, file, indent + 4, TDF_VOPS|TDF_MEMSYMS);
6413 fprintf (file, "%s }\n", s_indent);
6417 static void print_loop_and_siblings (FILE *, struct loop *, int, int);
6419 /* Pretty print LOOP on FILE, indented INDENT spaces. Following
6420 VERBOSITY level this outputs the contents of the loop, or just its
6424 print_loop (FILE *file, struct loop *loop, int indent, int verbosity)
6432 s_indent = (char *) alloca ((size_t) indent + 1);
6433 memset ((void *) s_indent, ' ', (size_t) indent);
6434 s_indent[indent] = '\0';
6436 /* Print loop's header. */
6437 fprintf (file, "%sloop_%d (header = %d, latch = %d", s_indent,
6438 loop->num, loop->header->index, loop->latch->index);
6439 fprintf (file, ", niter = ");
6440 print_generic_expr (file, loop->nb_iterations, 0);
6442 if (loop->any_upper_bound)
6444 fprintf (file, ", upper_bound = ");
6445 dump_double_int (file, loop->nb_iterations_upper_bound, true);
6448 if (loop->any_estimate)
6450 fprintf (file, ", estimate = ");
6451 dump_double_int (file, loop->nb_iterations_estimate, true);
6453 fprintf (file, ")\n");
6455 /* Print loop's body. */
6458 fprintf (file, "%s{\n", s_indent);
6460 if (bb->loop_father == loop)
6461 print_loops_bb (file, bb, indent, verbosity);
6463 print_loop_and_siblings (file, loop->inner, indent + 2, verbosity);
6464 fprintf (file, "%s}\n", s_indent);
6468 /* Print the LOOP and its sibling loops on FILE, indented INDENT
6469 spaces. Following VERBOSITY level this outputs the contents of the
6470 loop, or just its structure. */
6473 print_loop_and_siblings (FILE *file, struct loop *loop, int indent, int verbosity)
6478 print_loop (file, loop, indent, verbosity);
6479 print_loop_and_siblings (file, loop->next, indent, verbosity);
6482 /* Follow a CFG edge from the entry point of the program, and on entry
6483 of a loop, pretty print the loop structure on FILE. */
6486 print_loops (FILE *file, int verbosity)
6490 bb = ENTRY_BLOCK_PTR;
6491 if (bb && bb->loop_father)
6492 print_loop_and_siblings (file, bb->loop_father, 0, verbosity);
6496 /* Debugging loops structure at tree level, at some VERBOSITY level. */
6499 debug_loops (int verbosity)
6501 print_loops (stderr, verbosity);
6504 /* Print on stderr the code of LOOP, at some VERBOSITY level. */
6507 debug_loop (struct loop *loop, int verbosity)
6509 print_loop (stderr, loop, 0, verbosity);
6512 /* Print on stderr the code of loop number NUM, at some VERBOSITY
6516 debug_loop_num (unsigned num, int verbosity)
6518 debug_loop (get_loop (num), verbosity);
6521 /* Return true if BB ends with a call, possibly followed by some
6522 instructions that must stay with the call. Return false,
6526 gimple_block_ends_with_call_p (basic_block bb)
6528 gimple_stmt_iterator gsi = gsi_last_nondebug_bb (bb);
6529 return is_gimple_call (gsi_stmt (gsi));
6533 /* Return true if BB ends with a conditional branch. Return false,
6537 gimple_block_ends_with_condjump_p (const_basic_block bb)
6539 gimple stmt = last_stmt (CONST_CAST_BB (bb));
6540 return (stmt && gimple_code (stmt) == GIMPLE_COND);
6544 /* Return true if we need to add fake edge to exit at statement T.
6545 Helper function for gimple_flow_call_edges_add. */
6548 need_fake_edge_p (gimple t)
6550 tree fndecl = NULL_TREE;
6553 /* NORETURN and LONGJMP calls already have an edge to exit.
6554 CONST and PURE calls do not need one.
6555 We don't currently check for CONST and PURE here, although
6556 it would be a good idea, because those attributes are
6557 figured out from the RTL in mark_constant_function, and
6558 the counter incrementation code from -fprofile-arcs
6559 leads to different results from -fbranch-probabilities. */
6560 if (is_gimple_call (t))
6562 fndecl = gimple_call_fndecl (t);
6563 call_flags = gimple_call_flags (t);
6566 if (is_gimple_call (t)
6568 && DECL_BUILT_IN (fndecl)
6569 && (call_flags & ECF_NOTHROW)
6570 && !(call_flags & ECF_RETURNS_TWICE)
6571 /* fork() doesn't really return twice, but the effect of
6572 wrapping it in __gcov_fork() which calls __gcov_flush()
6573 and clears the counters before forking has the same
6574 effect as returning twice. Force a fake edge. */
6575 && !(DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_NORMAL
6576 && DECL_FUNCTION_CODE (fndecl) == BUILT_IN_FORK))
6579 if (is_gimple_call (t)
6580 && !(call_flags & ECF_NORETURN))
6583 if (gimple_code (t) == GIMPLE_ASM
6584 && (gimple_asm_volatile_p (t) || gimple_asm_input_p (t)))
6591 /* Add fake edges to the function exit for any non constant and non
6592 noreturn calls, volatile inline assembly in the bitmap of blocks
6593 specified by BLOCKS or to the whole CFG if BLOCKS is zero. Return
6594 the number of blocks that were split.
6596 The goal is to expose cases in which entering a basic block does
6597 not imply that all subsequent instructions must be executed. */
6600 gimple_flow_call_edges_add (sbitmap blocks)
6603 int blocks_split = 0;
6604 int last_bb = last_basic_block;
6605 bool check_last_block = false;
6607 if (n_basic_blocks == NUM_FIXED_BLOCKS)
6611 check_last_block = true;
6613 check_last_block = TEST_BIT (blocks, EXIT_BLOCK_PTR->prev_bb->index);
6615 /* In the last basic block, before epilogue generation, there will be
6616 a fallthru edge to EXIT. Special care is required if the last insn
6617 of the last basic block is a call because make_edge folds duplicate
6618 edges, which would result in the fallthru edge also being marked
6619 fake, which would result in the fallthru edge being removed by
6620 remove_fake_edges, which would result in an invalid CFG.
6622 Moreover, we can't elide the outgoing fake edge, since the block
6623 profiler needs to take this into account in order to solve the minimal
6624 spanning tree in the case that the call doesn't return.
6626 Handle this by adding a dummy instruction in a new last basic block. */
6627 if (check_last_block)
6629 basic_block bb = EXIT_BLOCK_PTR->prev_bb;
6630 gimple_stmt_iterator gsi = gsi_last_bb (bb);
6633 if (!gsi_end_p (gsi))
6636 if (t && need_fake_edge_p (t))
6640 e = find_edge (bb, EXIT_BLOCK_PTR);
6643 gsi_insert_on_edge (e, gimple_build_nop ());
6644 gsi_commit_edge_inserts ();
6649 /* Now add fake edges to the function exit for any non constant
6650 calls since there is no way that we can determine if they will
6652 for (i = 0; i < last_bb; i++)
6654 basic_block bb = BASIC_BLOCK (i);
6655 gimple_stmt_iterator gsi;
6656 gimple stmt, last_stmt;
6661 if (blocks && !TEST_BIT (blocks, i))
6664 gsi = gsi_last_bb (bb);
6665 if (!gsi_end_p (gsi))
6667 last_stmt = gsi_stmt (gsi);
6670 stmt = gsi_stmt (gsi);
6671 if (need_fake_edge_p (stmt))
6675 /* The handling above of the final block before the
6676 epilogue should be enough to verify that there is
6677 no edge to the exit block in CFG already.
6678 Calling make_edge in such case would cause us to
6679 mark that edge as fake and remove it later. */
6680 #ifdef ENABLE_CHECKING
6681 if (stmt == last_stmt)
6683 e = find_edge (bb, EXIT_BLOCK_PTR);
6684 gcc_assert (e == NULL);
6688 /* Note that the following may create a new basic block
6689 and renumber the existing basic blocks. */
6690 if (stmt != last_stmt)
6692 e = split_block (bb, stmt);
6696 make_edge (bb, EXIT_BLOCK_PTR, EDGE_FAKE);
6700 while (!gsi_end_p (gsi));
6705 verify_flow_info ();
6707 return blocks_split;
6710 /* Purge dead abnormal call edges from basic block BB. */
6713 gimple_purge_dead_abnormal_call_edges (basic_block bb)
6715 bool changed = gimple_purge_dead_eh_edges (bb);
6717 if (cfun->has_nonlocal_label)
6719 gimple stmt = last_stmt (bb);
6723 if (!(stmt && stmt_can_make_abnormal_goto (stmt)))
6724 for (ei = ei_start (bb->succs); (e = ei_safe_edge (ei)); )
6726 if (e->flags & EDGE_ABNORMAL)
6735 /* See gimple_purge_dead_eh_edges below. */
6737 free_dominance_info (CDI_DOMINATORS);
6743 /* Removes edge E and all the blocks dominated by it, and updates dominance
6744 information. The IL in E->src needs to be updated separately.
6745 If dominance info is not available, only the edge E is removed.*/
6748 remove_edge_and_dominated_blocks (edge e)
6750 VEC (basic_block, heap) *bbs_to_remove = NULL;
6751 VEC (basic_block, heap) *bbs_to_fix_dom = NULL;
6755 bool none_removed = false;
6757 basic_block bb, dbb;
6760 if (!dom_info_available_p (CDI_DOMINATORS))
6766 /* No updating is needed for edges to exit. */
6767 if (e->dest == EXIT_BLOCK_PTR)
6769 if (cfgcleanup_altered_bbs)
6770 bitmap_set_bit (cfgcleanup_altered_bbs, e->src->index);
6775 /* First, we find the basic blocks to remove. If E->dest has a predecessor
6776 that is not dominated by E->dest, then this set is empty. Otherwise,
6777 all the basic blocks dominated by E->dest are removed.
6779 Also, to DF_IDOM we store the immediate dominators of the blocks in
6780 the dominance frontier of E (i.e., of the successors of the
6781 removed blocks, if there are any, and of E->dest otherwise). */
6782 FOR_EACH_EDGE (f, ei, e->dest->preds)
6787 if (!dominated_by_p (CDI_DOMINATORS, f->src, e->dest))
6789 none_removed = true;
6794 df = BITMAP_ALLOC (NULL);
6795 df_idom = BITMAP_ALLOC (NULL);
6798 bitmap_set_bit (df_idom,
6799 get_immediate_dominator (CDI_DOMINATORS, e->dest)->index);
6802 bbs_to_remove = get_all_dominated_blocks (CDI_DOMINATORS, e->dest);
6803 for (i = 0; VEC_iterate (basic_block, bbs_to_remove, i, bb); i++)
6805 FOR_EACH_EDGE (f, ei, bb->succs)
6807 if (f->dest != EXIT_BLOCK_PTR)
6808 bitmap_set_bit (df, f->dest->index);
6811 for (i = 0; VEC_iterate (basic_block, bbs_to_remove, i, bb); i++)
6812 bitmap_clear_bit (df, bb->index);
6814 EXECUTE_IF_SET_IN_BITMAP (df, 0, i, bi)
6816 bb = BASIC_BLOCK (i);
6817 bitmap_set_bit (df_idom,
6818 get_immediate_dominator (CDI_DOMINATORS, bb)->index);
6822 if (cfgcleanup_altered_bbs)
6824 /* Record the set of the altered basic blocks. */
6825 bitmap_set_bit (cfgcleanup_altered_bbs, e->src->index);
6826 bitmap_ior_into (cfgcleanup_altered_bbs, df);
6829 /* Remove E and the cancelled blocks. */
6834 /* Walk backwards so as to get a chance to substitute all
6835 released DEFs into debug stmts. See
6836 eliminate_unnecessary_stmts() in tree-ssa-dce.c for more
6838 for (i = VEC_length (basic_block, bbs_to_remove); i-- > 0; )
6839 delete_basic_block (VEC_index (basic_block, bbs_to_remove, i));
6842 /* Update the dominance information. The immediate dominator may change only
6843 for blocks whose immediate dominator belongs to DF_IDOM:
6845 Suppose that idom(X) = Y before removal of E and idom(X) != Y after the
6846 removal. Let Z the arbitrary block such that idom(Z) = Y and
6847 Z dominates X after the removal. Before removal, there exists a path P
6848 from Y to X that avoids Z. Let F be the last edge on P that is
6849 removed, and let W = F->dest. Before removal, idom(W) = Y (since Y
6850 dominates W, and because of P, Z does not dominate W), and W belongs to
6851 the dominance frontier of E. Therefore, Y belongs to DF_IDOM. */
6852 EXECUTE_IF_SET_IN_BITMAP (df_idom, 0, i, bi)
6854 bb = BASIC_BLOCK (i);
6855 for (dbb = first_dom_son (CDI_DOMINATORS, bb);
6857 dbb = next_dom_son (CDI_DOMINATORS, dbb))
6858 VEC_safe_push (basic_block, heap, bbs_to_fix_dom, dbb);
6861 iterate_fix_dominators (CDI_DOMINATORS, bbs_to_fix_dom, true);
6864 BITMAP_FREE (df_idom);
6865 VEC_free (basic_block, heap, bbs_to_remove);
6866 VEC_free (basic_block, heap, bbs_to_fix_dom);
6869 /* Purge dead EH edges from basic block BB. */
6872 gimple_purge_dead_eh_edges (basic_block bb)
6874 bool changed = false;
6877 gimple stmt = last_stmt (bb);
6879 if (stmt && stmt_can_throw_internal (stmt))
6882 for (ei = ei_start (bb->succs); (e = ei_safe_edge (ei)); )
6884 if (e->flags & EDGE_EH)
6886 remove_edge_and_dominated_blocks (e);
6897 gimple_purge_all_dead_eh_edges (const_bitmap blocks)
6899 bool changed = false;
6903 EXECUTE_IF_SET_IN_BITMAP (blocks, 0, i, bi)
6905 basic_block bb = BASIC_BLOCK (i);
6907 /* Earlier gimple_purge_dead_eh_edges could have removed
6908 this basic block already. */
6909 gcc_assert (bb || changed);
6911 changed |= gimple_purge_dead_eh_edges (bb);
6917 /* This function is called whenever a new edge is created or
6921 gimple_execute_on_growing_pred (edge e)
6923 basic_block bb = e->dest;
6926 reserve_phi_args_for_new_edge (bb);
6929 /* This function is called immediately before edge E is removed from
6930 the edge vector E->dest->preds. */
6933 gimple_execute_on_shrinking_pred (edge e)
6935 if (phi_nodes (e->dest))
6936 remove_phi_args (e);
6939 /*---------------------------------------------------------------------------
6940 Helper functions for Loop versioning
6941 ---------------------------------------------------------------------------*/
6943 /* Adjust phi nodes for 'first' basic block. 'second' basic block is a copy
6944 of 'first'. Both of them are dominated by 'new_head' basic block. When
6945 'new_head' was created by 'second's incoming edge it received phi arguments
6946 on the edge by split_edge(). Later, additional edge 'e' was created to
6947 connect 'new_head' and 'first'. Now this routine adds phi args on this
6948 additional edge 'e' that new_head to second edge received as part of edge
6952 gimple_lv_adjust_loop_header_phi (basic_block first, basic_block second,
6953 basic_block new_head, edge e)
6956 gimple_stmt_iterator psi1, psi2;
6958 edge e2 = find_edge (new_head, second);
6960 /* Because NEW_HEAD has been created by splitting SECOND's incoming
6961 edge, we should always have an edge from NEW_HEAD to SECOND. */
6962 gcc_assert (e2 != NULL);
6964 /* Browse all 'second' basic block phi nodes and add phi args to
6965 edge 'e' for 'first' head. PHI args are always in correct order. */
6967 for (psi2 = gsi_start_phis (second),
6968 psi1 = gsi_start_phis (first);
6969 !gsi_end_p (psi2) && !gsi_end_p (psi1);
6970 gsi_next (&psi2), gsi_next (&psi1))
6972 phi1 = gsi_stmt (psi1);
6973 phi2 = gsi_stmt (psi2);
6974 def = PHI_ARG_DEF (phi2, e2->dest_idx);
6975 add_phi_arg (phi1, def, e, gimple_phi_arg_location_from_edge (phi2, e2));
6980 /* Adds a if else statement to COND_BB with condition COND_EXPR.
6981 SECOND_HEAD is the destination of the THEN and FIRST_HEAD is
6982 the destination of the ELSE part. */
6985 gimple_lv_add_condition_to_bb (basic_block first_head ATTRIBUTE_UNUSED,
6986 basic_block second_head ATTRIBUTE_UNUSED,
6987 basic_block cond_bb, void *cond_e)
6989 gimple_stmt_iterator gsi;
6990 gimple new_cond_expr;
6991 tree cond_expr = (tree) cond_e;
6994 /* Build new conditional expr */
6995 new_cond_expr = gimple_build_cond_from_tree (cond_expr,
6996 NULL_TREE, NULL_TREE);
6998 /* Add new cond in cond_bb. */
6999 gsi = gsi_last_bb (cond_bb);
7000 gsi_insert_after (&gsi, new_cond_expr, GSI_NEW_STMT);
7002 /* Adjust edges appropriately to connect new head with first head
7003 as well as second head. */
7004 e0 = single_succ_edge (cond_bb);
7005 e0->flags &= ~EDGE_FALLTHRU;
7006 e0->flags |= EDGE_FALSE_VALUE;
7009 struct cfg_hooks gimple_cfg_hooks = {
7011 gimple_verify_flow_info,
7012 gimple_dump_bb, /* dump_bb */
7013 create_bb, /* create_basic_block */
7014 gimple_redirect_edge_and_branch, /* redirect_edge_and_branch */
7015 gimple_redirect_edge_and_branch_force, /* redirect_edge_and_branch_force */
7016 gimple_can_remove_branch_p, /* can_remove_branch_p */
7017 remove_bb, /* delete_basic_block */
7018 gimple_split_block, /* split_block */
7019 gimple_move_block_after, /* move_block_after */
7020 gimple_can_merge_blocks_p, /* can_merge_blocks_p */
7021 gimple_merge_blocks, /* merge_blocks */
7022 gimple_predict_edge, /* predict_edge */
7023 gimple_predicted_by_p, /* predicted_by_p */
7024 gimple_can_duplicate_bb_p, /* can_duplicate_block_p */
7025 gimple_duplicate_bb, /* duplicate_block */
7026 gimple_split_edge, /* split_edge */
7027 gimple_make_forwarder_block, /* make_forward_block */
7028 NULL, /* tidy_fallthru_edge */
7029 gimple_block_ends_with_call_p,/* block_ends_with_call_p */
7030 gimple_block_ends_with_condjump_p, /* block_ends_with_condjump_p */
7031 gimple_flow_call_edges_add, /* flow_call_edges_add */
7032 gimple_execute_on_growing_pred, /* execute_on_growing_pred */
7033 gimple_execute_on_shrinking_pred, /* execute_on_shrinking_pred */
7034 gimple_duplicate_loop_to_header_edge, /* duplicate loop for trees */
7035 gimple_lv_add_condition_to_bb, /* lv_add_condition_to_bb */
7036 gimple_lv_adjust_loop_header_phi, /* lv_adjust_loop_header_phi*/
7037 extract_true_false_edges_from_block, /* extract_cond_bb_edges */
7038 flush_pending_stmts /* flush_pending_stmts */
7042 /* Split all critical edges. */
7045 split_critical_edges (void)
7051 /* split_edge can redirect edges out of SWITCH_EXPRs, which can get
7052 expensive. So we want to enable recording of edge to CASE_LABEL_EXPR
7053 mappings around the calls to split_edge. */
7054 start_recording_case_labels ();
7057 FOR_EACH_EDGE (e, ei, bb->succs)
7059 if (EDGE_CRITICAL_P (e) && !(e->flags & EDGE_ABNORMAL))
7061 /* PRE inserts statements to edges and expects that
7062 since split_critical_edges was done beforehand, committing edge
7063 insertions will not split more edges. In addition to critical
7064 edges we must split edges that have multiple successors and
7065 end by control flow statements, such as RESX.
7066 Go ahead and split them too. This matches the logic in
7067 gimple_find_edge_insert_loc. */
7068 else if ((!single_pred_p (e->dest)
7069 || !gimple_seq_empty_p (phi_nodes (e->dest))
7070 || e->dest == EXIT_BLOCK_PTR)
7071 && e->src != ENTRY_BLOCK_PTR
7072 && !(e->flags & EDGE_ABNORMAL))
7074 gimple_stmt_iterator gsi;
7076 gsi = gsi_last_bb (e->src);
7077 if (!gsi_end_p (gsi)
7078 && stmt_ends_bb_p (gsi_stmt (gsi))
7079 && gimple_code (gsi_stmt (gsi)) != GIMPLE_RETURN)
7084 end_recording_case_labels ();
7088 struct gimple_opt_pass pass_split_crit_edges =
7092 "crited", /* name */
7094 split_critical_edges, /* execute */
7097 0, /* static_pass_number */
7098 TV_TREE_SPLIT_EDGES, /* tv_id */
7099 PROP_cfg, /* properties required */
7100 PROP_no_crit_edges, /* properties_provided */
7101 0, /* properties_destroyed */
7102 0, /* todo_flags_start */
7103 TODO_dump_func | TODO_verify_flow /* todo_flags_finish */
7108 /* Build a ternary operation and gimplify it. Emit code before GSI.
7109 Return the gimple_val holding the result. */
7112 gimplify_build3 (gimple_stmt_iterator *gsi, enum tree_code code,
7113 tree type, tree a, tree b, tree c)
7116 location_t loc = gimple_location (gsi_stmt (*gsi));
7118 ret = fold_build3_loc (loc, code, type, a, b, c);
7121 return force_gimple_operand_gsi (gsi, ret, true, NULL, true,
7125 /* Build a binary operation and gimplify it. Emit code before GSI.
7126 Return the gimple_val holding the result. */
7129 gimplify_build2 (gimple_stmt_iterator *gsi, enum tree_code code,
7130 tree type, tree a, tree b)
7134 ret = fold_build2_loc (gimple_location (gsi_stmt (*gsi)), code, type, a, b);
7137 return force_gimple_operand_gsi (gsi, ret, true, NULL, true,
7141 /* Build a unary operation and gimplify it. Emit code before GSI.
7142 Return the gimple_val holding the result. */
7145 gimplify_build1 (gimple_stmt_iterator *gsi, enum tree_code code, tree type,
7150 ret = fold_build1_loc (gimple_location (gsi_stmt (*gsi)), code, type, a);
7153 return force_gimple_operand_gsi (gsi, ret, true, NULL, true,
7159 /* Emit return warnings. */
7162 execute_warn_function_return (void)
7164 source_location location;
7169 /* If we have a path to EXIT, then we do return. */
7170 if (TREE_THIS_VOLATILE (cfun->decl)
7171 && EDGE_COUNT (EXIT_BLOCK_PTR->preds) > 0)
7173 location = UNKNOWN_LOCATION;
7174 FOR_EACH_EDGE (e, ei, EXIT_BLOCK_PTR->preds)
7176 last = last_stmt (e->src);
7177 if (gimple_code (last) == GIMPLE_RETURN
7178 && (location = gimple_location (last)) != UNKNOWN_LOCATION)
7181 if (location == UNKNOWN_LOCATION)
7182 location = cfun->function_end_locus;
7183 warning_at (location, 0, "%<noreturn%> function does return");
7186 /* If we see "return;" in some basic block, then we do reach the end
7187 without returning a value. */
7188 else if (warn_return_type
7189 && !TREE_NO_WARNING (cfun->decl)
7190 && EDGE_COUNT (EXIT_BLOCK_PTR->preds) > 0
7191 && !VOID_TYPE_P (TREE_TYPE (TREE_TYPE (cfun->decl))))
7193 FOR_EACH_EDGE (e, ei, EXIT_BLOCK_PTR->preds)
7195 gimple last = last_stmt (e->src);
7196 if (gimple_code (last) == GIMPLE_RETURN
7197 && gimple_return_retval (last) == NULL
7198 && !gimple_no_warning_p (last))
7200 location = gimple_location (last);
7201 if (location == UNKNOWN_LOCATION)
7202 location = cfun->function_end_locus;
7203 warning_at (location, OPT_Wreturn_type, "control reaches end of non-void function");
7204 TREE_NO_WARNING (cfun->decl) = 1;
7213 /* Given a basic block B which ends with a conditional and has
7214 precisely two successors, determine which of the edges is taken if
7215 the conditional is true and which is taken if the conditional is
7216 false. Set TRUE_EDGE and FALSE_EDGE appropriately. */
7219 extract_true_false_edges_from_block (basic_block b,
7223 edge e = EDGE_SUCC (b, 0);
7225 if (e->flags & EDGE_TRUE_VALUE)
7228 *false_edge = EDGE_SUCC (b, 1);
7233 *true_edge = EDGE_SUCC (b, 1);
7237 struct gimple_opt_pass pass_warn_function_return =
7241 "*warn_function_return", /* name */
7243 execute_warn_function_return, /* execute */
7246 0, /* static_pass_number */
7247 TV_NONE, /* tv_id */
7248 PROP_cfg, /* properties_required */
7249 0, /* properties_provided */
7250 0, /* properties_destroyed */
7251 0, /* todo_flags_start */
7252 0 /* todo_flags_finish */
7256 /* Emit noreturn warnings. */
7259 execute_warn_function_noreturn (void)
7261 if (warn_missing_noreturn
7262 && !TREE_THIS_VOLATILE (cfun->decl)
7263 && EDGE_COUNT (EXIT_BLOCK_PTR->preds) == 0
7264 && !lang_hooks.missing_noreturn_ok_p (cfun->decl))
7265 warning_at (DECL_SOURCE_LOCATION (cfun->decl), OPT_Wmissing_noreturn,
7266 "function might be possible candidate "
7267 "for attribute %<noreturn%>");
7271 struct gimple_opt_pass pass_warn_function_noreturn =
7275 "*warn_function_noreturn", /* name */
7277 execute_warn_function_noreturn, /* execute */
7280 0, /* static_pass_number */
7281 TV_NONE, /* tv_id */
7282 PROP_cfg, /* properties_required */
7283 0, /* properties_provided */
7284 0, /* properties_destroyed */
7285 0, /* todo_flags_start */
7286 0 /* todo_flags_finish */
7291 /* Walk a gimplified function and warn for functions whose return value is
7292 ignored and attribute((warn_unused_result)) is set. This is done before
7293 inlining, so we don't have to worry about that. */
7296 do_warn_unused_result (gimple_seq seq)
7299 gimple_stmt_iterator i;
7301 for (i = gsi_start (seq); !gsi_end_p (i); gsi_next (&i))
7303 gimple g = gsi_stmt (i);
7305 switch (gimple_code (g))
7308 do_warn_unused_result (gimple_bind_body (g));
7311 do_warn_unused_result (gimple_try_eval (g));
7312 do_warn_unused_result (gimple_try_cleanup (g));
7315 do_warn_unused_result (gimple_catch_handler (g));
7317 case GIMPLE_EH_FILTER:
7318 do_warn_unused_result (gimple_eh_filter_failure (g));
7322 if (gimple_call_lhs (g))
7325 /* This is a naked call, as opposed to a GIMPLE_CALL with an
7326 LHS. All calls whose value is ignored should be
7327 represented like this. Look for the attribute. */
7328 fdecl = gimple_call_fndecl (g);
7329 ftype = TREE_TYPE (TREE_TYPE (gimple_call_fn (g)));
7331 if (lookup_attribute ("warn_unused_result", TYPE_ATTRIBUTES (ftype)))
7333 location_t loc = gimple_location (g);
7336 warning_at (loc, OPT_Wunused_result,
7337 "ignoring return value of %qD, "
7338 "declared with attribute warn_unused_result",
7341 warning_at (loc, OPT_Wunused_result,
7342 "ignoring return value of function "
7343 "declared with attribute warn_unused_result");
7348 /* Not a container, not a call, or a call whose value is used. */
7355 run_warn_unused_result (void)
7357 do_warn_unused_result (gimple_body (current_function_decl));
7362 gate_warn_unused_result (void)
7364 return flag_warn_unused_result;
7367 struct gimple_opt_pass pass_warn_unused_result =
7371 "*warn_unused_result", /* name */
7372 gate_warn_unused_result, /* gate */
7373 run_warn_unused_result, /* execute */
7376 0, /* static_pass_number */
7377 TV_NONE, /* tv_id */
7378 PROP_gimple_any, /* properties_required */
7379 0, /* properties_provided */
7380 0, /* properties_destroyed */
7381 0, /* todo_flags_start */
7382 0, /* todo_flags_finish */