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 unsigned int locus_map_hash (const void *);
103 static int locus_map_eq (const void *, const void *);
104 static void assign_discriminator (location_t, basic_block);
105 static edge gimple_redirect_edge_and_branch (edge, basic_block);
106 static edge gimple_try_redirect_by_replacing_jump (edge, basic_block);
107 static unsigned int split_critical_edges (void);
109 /* Various helpers. */
110 static inline bool stmt_starts_bb_p (gimple, gimple);
111 static int gimple_verify_flow_info (void);
112 static void gimple_make_forwarder_block (edge);
113 static void gimple_cfg2vcg (FILE *);
114 static gimple first_non_label_stmt (basic_block);
116 /* Flowgraph optimization and cleanup. */
117 static void gimple_merge_blocks (basic_block, basic_block);
118 static bool gimple_can_merge_blocks_p (basic_block, basic_block);
119 static void remove_bb (basic_block);
120 static edge find_taken_edge_computed_goto (basic_block, tree);
121 static edge find_taken_edge_cond_expr (basic_block, tree);
122 static edge find_taken_edge_switch_expr (basic_block, tree);
123 static tree find_case_label_for_value (gimple, tree);
126 init_empty_tree_cfg_for_function (struct function *fn)
128 /* Initialize the basic block array. */
130 profile_status_for_function (fn) = PROFILE_ABSENT;
131 n_basic_blocks_for_function (fn) = NUM_FIXED_BLOCKS;
132 last_basic_block_for_function (fn) = NUM_FIXED_BLOCKS;
133 basic_block_info_for_function (fn)
134 = VEC_alloc (basic_block, gc, initial_cfg_capacity);
135 VEC_safe_grow_cleared (basic_block, gc,
136 basic_block_info_for_function (fn),
137 initial_cfg_capacity);
139 /* Build a mapping of labels to their associated blocks. */
140 label_to_block_map_for_function (fn)
141 = VEC_alloc (basic_block, gc, initial_cfg_capacity);
142 VEC_safe_grow_cleared (basic_block, gc,
143 label_to_block_map_for_function (fn),
144 initial_cfg_capacity);
146 SET_BASIC_BLOCK_FOR_FUNCTION (fn, ENTRY_BLOCK,
147 ENTRY_BLOCK_PTR_FOR_FUNCTION (fn));
148 SET_BASIC_BLOCK_FOR_FUNCTION (fn, EXIT_BLOCK,
149 EXIT_BLOCK_PTR_FOR_FUNCTION (fn));
151 ENTRY_BLOCK_PTR_FOR_FUNCTION (fn)->next_bb
152 = EXIT_BLOCK_PTR_FOR_FUNCTION (fn);
153 EXIT_BLOCK_PTR_FOR_FUNCTION (fn)->prev_bb
154 = ENTRY_BLOCK_PTR_FOR_FUNCTION (fn);
158 init_empty_tree_cfg (void)
160 init_empty_tree_cfg_for_function (cfun);
163 /*---------------------------------------------------------------------------
165 ---------------------------------------------------------------------------*/
167 /* Entry point to the CFG builder for trees. SEQ is the sequence of
168 statements to be added to the flowgraph. */
171 build_gimple_cfg (gimple_seq seq)
173 /* Register specific gimple functions. */
174 gimple_register_cfg_hooks ();
176 memset ((void *) &cfg_stats, 0, sizeof (cfg_stats));
178 init_empty_tree_cfg ();
180 found_computed_goto = 0;
183 /* Computed gotos are hell to deal with, especially if there are
184 lots of them with a large number of destinations. So we factor
185 them to a common computed goto location before we build the
186 edge list. After we convert back to normal form, we will un-factor
187 the computed gotos since factoring introduces an unwanted jump. */
188 if (found_computed_goto)
189 factor_computed_gotos ();
191 /* Make sure there is always at least one block, even if it's empty. */
192 if (n_basic_blocks == NUM_FIXED_BLOCKS)
193 create_empty_bb (ENTRY_BLOCK_PTR);
195 /* Adjust the size of the array. */
196 if (VEC_length (basic_block, basic_block_info) < (size_t) n_basic_blocks)
197 VEC_safe_grow_cleared (basic_block, gc, basic_block_info, n_basic_blocks);
199 /* To speed up statement iterator walks, we first purge dead labels. */
200 cleanup_dead_labels ();
202 /* Group case nodes to reduce the number of edges.
203 We do this after cleaning up dead labels because otherwise we miss
204 a lot of obvious case merging opportunities. */
205 group_case_labels ();
207 /* Create the edges of the flowgraph. */
208 discriminator_per_locus = htab_create (13, locus_map_hash, locus_map_eq,
211 cleanup_dead_labels ();
212 htab_delete (discriminator_per_locus);
214 /* Debugging dumps. */
216 /* Write the flowgraph to a VCG file. */
218 int local_dump_flags;
219 FILE *vcg_file = dump_begin (TDI_vcg, &local_dump_flags);
222 gimple_cfg2vcg (vcg_file);
223 dump_end (TDI_vcg, vcg_file);
227 #ifdef ENABLE_CHECKING
233 execute_build_cfg (void)
235 gimple_seq body = gimple_body (current_function_decl);
237 build_gimple_cfg (body);
238 gimple_set_body (current_function_decl, NULL);
239 if (dump_file && (dump_flags & TDF_DETAILS))
241 fprintf (dump_file, "Scope blocks:\n");
242 dump_scope_blocks (dump_file, dump_flags);
247 struct gimple_opt_pass pass_build_cfg =
253 execute_build_cfg, /* execute */
256 0, /* static_pass_number */
257 TV_TREE_CFG, /* tv_id */
258 PROP_gimple_leh, /* properties_required */
259 PROP_cfg, /* properties_provided */
260 0, /* properties_destroyed */
261 0, /* todo_flags_start */
262 TODO_verify_stmts | TODO_cleanup_cfg
263 | TODO_dump_func /* todo_flags_finish */
268 /* Return true if T is a computed goto. */
271 computed_goto_p (gimple t)
273 return (gimple_code (t) == GIMPLE_GOTO
274 && TREE_CODE (gimple_goto_dest (t)) != LABEL_DECL);
278 /* Search the CFG for any computed gotos. If found, factor them to a
279 common computed goto site. Also record the location of that site so
280 that we can un-factor the gotos after we have converted back to
284 factor_computed_gotos (void)
287 tree factored_label_decl = NULL;
289 gimple factored_computed_goto_label = NULL;
290 gimple factored_computed_goto = NULL;
292 /* We know there are one or more computed gotos in this function.
293 Examine the last statement in each basic block to see if the block
294 ends with a computed goto. */
298 gimple_stmt_iterator gsi = gsi_last_bb (bb);
304 last = gsi_stmt (gsi);
306 /* Ignore the computed goto we create when we factor the original
308 if (last == factored_computed_goto)
311 /* If the last statement is a computed goto, factor it. */
312 if (computed_goto_p (last))
316 /* The first time we find a computed goto we need to create
317 the factored goto block and the variable each original
318 computed goto will use for their goto destination. */
319 if (!factored_computed_goto)
321 basic_block new_bb = create_empty_bb (bb);
322 gimple_stmt_iterator new_gsi = gsi_start_bb (new_bb);
324 /* Create the destination of the factored goto. Each original
325 computed goto will put its desired destination into this
326 variable and jump to the label we create immediately
328 var = create_tmp_var (ptr_type_node, "gotovar");
330 /* Build a label for the new block which will contain the
331 factored computed goto. */
332 factored_label_decl = create_artificial_label (UNKNOWN_LOCATION);
333 factored_computed_goto_label
334 = gimple_build_label (factored_label_decl);
335 gsi_insert_after (&new_gsi, factored_computed_goto_label,
338 /* Build our new computed goto. */
339 factored_computed_goto = gimple_build_goto (var);
340 gsi_insert_after (&new_gsi, factored_computed_goto, GSI_NEW_STMT);
343 /* Copy the original computed goto's destination into VAR. */
344 assignment = gimple_build_assign (var, gimple_goto_dest (last));
345 gsi_insert_before (&gsi, assignment, GSI_SAME_STMT);
347 /* And re-vector the computed goto to the new destination. */
348 gimple_goto_set_dest (last, factored_label_decl);
354 /* Build a flowgraph for the sequence of stmts SEQ. */
357 make_blocks (gimple_seq seq)
359 gimple_stmt_iterator i = gsi_start (seq);
361 bool start_new_block = true;
362 bool first_stmt_of_seq = true;
363 basic_block bb = ENTRY_BLOCK_PTR;
365 while (!gsi_end_p (i))
372 /* If the statement starts a new basic block or if we have determined
373 in a previous pass that we need to create a new block for STMT, do
375 if (start_new_block || stmt_starts_bb_p (stmt, prev_stmt))
377 if (!first_stmt_of_seq)
378 seq = gsi_split_seq_before (&i);
379 bb = create_basic_block (seq, NULL, bb);
380 start_new_block = false;
383 /* Now add STMT to BB and create the subgraphs for special statement
385 gimple_set_bb (stmt, bb);
387 if (computed_goto_p (stmt))
388 found_computed_goto = true;
390 /* If STMT is a basic block terminator, set START_NEW_BLOCK for the
392 if (stmt_ends_bb_p (stmt))
394 /* If the stmt can make abnormal goto use a new temporary
395 for the assignment to the LHS. This makes sure the old value
396 of the LHS is available on the abnormal edge. Otherwise
397 we will end up with overlapping life-ranges for abnormal
399 if (gimple_has_lhs (stmt)
400 && stmt_can_make_abnormal_goto (stmt)
401 && is_gimple_reg_type (TREE_TYPE (gimple_get_lhs (stmt))))
403 tree lhs = gimple_get_lhs (stmt);
404 tree tmp = create_tmp_var (TREE_TYPE (lhs), NULL);
405 gimple s = gimple_build_assign (lhs, tmp);
406 gimple_set_location (s, gimple_location (stmt));
407 gimple_set_block (s, gimple_block (stmt));
408 gimple_set_lhs (stmt, tmp);
409 if (TREE_CODE (TREE_TYPE (tmp)) == COMPLEX_TYPE
410 || TREE_CODE (TREE_TYPE (tmp)) == VECTOR_TYPE)
411 DECL_GIMPLE_REG_P (tmp) = 1;
412 gsi_insert_after (&i, s, GSI_SAME_STMT);
414 start_new_block = true;
418 first_stmt_of_seq = false;
423 /* Create and return a new empty basic block after bb AFTER. */
426 create_bb (void *h, void *e, basic_block after)
432 /* Create and initialize a new basic block. Since alloc_block uses
433 ggc_alloc_cleared to allocate a basic block, we do not have to
434 clear the newly allocated basic block here. */
437 bb->index = last_basic_block;
439 bb->il.gimple = GGC_CNEW (struct gimple_bb_info);
440 set_bb_seq (bb, h ? (gimple_seq) h : gimple_seq_alloc ());
442 /* Add the new block to the linked list of blocks. */
443 link_block (bb, after);
445 /* Grow the basic block array if needed. */
446 if ((size_t) last_basic_block == VEC_length (basic_block, basic_block_info))
448 size_t new_size = last_basic_block + (last_basic_block + 3) / 4;
449 VEC_safe_grow_cleared (basic_block, gc, basic_block_info, new_size);
452 /* Add the newly created block to the array. */
453 SET_BASIC_BLOCK (last_basic_block, bb);
462 /*---------------------------------------------------------------------------
464 ---------------------------------------------------------------------------*/
466 /* Fold COND_EXPR_COND of each COND_EXPR. */
469 fold_cond_expr_cond (void)
475 gimple stmt = last_stmt (bb);
477 if (stmt && gimple_code (stmt) == GIMPLE_COND)
479 location_t loc = gimple_location (stmt);
483 fold_defer_overflow_warnings ();
484 cond = fold_binary_loc (loc, gimple_cond_code (stmt), boolean_type_node,
485 gimple_cond_lhs (stmt), gimple_cond_rhs (stmt));
488 zerop = integer_zerop (cond);
489 onep = integer_onep (cond);
492 zerop = onep = false;
494 fold_undefer_overflow_warnings (zerop || onep,
496 WARN_STRICT_OVERFLOW_CONDITIONAL);
498 gimple_cond_make_false (stmt);
500 gimple_cond_make_true (stmt);
505 /* Join all the blocks in the flowgraph. */
511 struct omp_region *cur_region = NULL;
513 /* Create an edge from entry to the first block with executable
515 make_edge (ENTRY_BLOCK_PTR, BASIC_BLOCK (NUM_FIXED_BLOCKS), EDGE_FALLTHRU);
517 /* Traverse the basic block array placing edges. */
520 gimple last = last_stmt (bb);
525 enum gimple_code code = gimple_code (last);
529 make_goto_expr_edges (bb);
533 make_edge (bb, EXIT_BLOCK_PTR, 0);
537 make_cond_expr_edges (bb);
541 make_gimple_switch_edges (bb);
545 make_eh_edges (last);
550 /* If this function receives a nonlocal goto, then we need to
551 make edges from this call site to all the nonlocal goto
553 if (stmt_can_make_abnormal_goto (last))
554 make_abnormal_goto_edges (bb, true);
556 /* If this statement has reachable exception handlers, then
557 create abnormal edges to them. */
558 make_eh_edges (last);
560 /* Some calls are known not to return. */
561 fallthru = !(gimple_call_flags (last) & ECF_NORETURN);
565 /* A GIMPLE_ASSIGN may throw internally and thus be considered
567 if (is_ctrl_altering_stmt (last))
569 make_eh_edges (last);
574 case GIMPLE_OMP_PARALLEL:
575 case GIMPLE_OMP_TASK:
577 case GIMPLE_OMP_SINGLE:
578 case GIMPLE_OMP_MASTER:
579 case GIMPLE_OMP_ORDERED:
580 case GIMPLE_OMP_CRITICAL:
581 case GIMPLE_OMP_SECTION:
582 cur_region = new_omp_region (bb, code, cur_region);
586 case GIMPLE_OMP_SECTIONS:
587 cur_region = new_omp_region (bb, code, cur_region);
591 case GIMPLE_OMP_SECTIONS_SWITCH:
596 case GIMPLE_OMP_ATOMIC_LOAD:
597 case GIMPLE_OMP_ATOMIC_STORE:
602 case GIMPLE_OMP_RETURN:
603 /* In the case of a GIMPLE_OMP_SECTION, the edge will go
604 somewhere other than the next block. This will be
606 cur_region->exit = bb;
607 fallthru = cur_region->type != GIMPLE_OMP_SECTION;
608 cur_region = cur_region->outer;
611 case GIMPLE_OMP_CONTINUE:
612 cur_region->cont = bb;
613 switch (cur_region->type)
616 /* Mark all GIMPLE_OMP_FOR and GIMPLE_OMP_CONTINUE
617 succs edges as abnormal to prevent splitting
619 single_succ_edge (cur_region->entry)->flags |= EDGE_ABNORMAL;
620 /* Make the loopback edge. */
621 make_edge (bb, single_succ (cur_region->entry),
624 /* Create an edge from GIMPLE_OMP_FOR to exit, which
625 corresponds to the case that the body of the loop
626 is not executed at all. */
627 make_edge (cur_region->entry, bb->next_bb, EDGE_ABNORMAL);
628 make_edge (bb, bb->next_bb, EDGE_FALLTHRU | EDGE_ABNORMAL);
632 case GIMPLE_OMP_SECTIONS:
633 /* Wire up the edges into and out of the nested sections. */
635 basic_block switch_bb = single_succ (cur_region->entry);
637 struct omp_region *i;
638 for (i = cur_region->inner; i ; i = i->next)
640 gcc_assert (i->type == GIMPLE_OMP_SECTION);
641 make_edge (switch_bb, i->entry, 0);
642 make_edge (i->exit, bb, EDGE_FALLTHRU);
645 /* Make the loopback edge to the block with
646 GIMPLE_OMP_SECTIONS_SWITCH. */
647 make_edge (bb, switch_bb, 0);
649 /* Make the edge from the switch to exit. */
650 make_edge (switch_bb, bb->next_bb, 0);
661 gcc_assert (!stmt_ends_bb_p (last));
670 make_edge (bb, bb->next_bb, EDGE_FALLTHRU);
672 assign_discriminator (gimple_location (last), bb->next_bb);
679 /* Fold COND_EXPR_COND of each COND_EXPR. */
680 fold_cond_expr_cond ();
683 /* Trivial hash function for a location_t. ITEM is a pointer to
684 a hash table entry that maps a location_t to a discriminator. */
687 locus_map_hash (const void *item)
689 return ((const struct locus_discrim_map *) item)->locus;
692 /* Equality function for the locus-to-discriminator map. VA and VB
693 point to the two hash table entries to compare. */
696 locus_map_eq (const void *va, const void *vb)
698 const struct locus_discrim_map *a = (const struct locus_discrim_map *) va;
699 const struct locus_discrim_map *b = (const struct locus_discrim_map *) vb;
700 return a->locus == b->locus;
703 /* Find the next available discriminator value for LOCUS. The
704 discriminator distinguishes among several basic blocks that
705 share a common locus, allowing for more accurate sample-based
709 next_discriminator_for_locus (location_t locus)
711 struct locus_discrim_map item;
712 struct locus_discrim_map **slot;
715 item.discriminator = 0;
716 slot = (struct locus_discrim_map **)
717 htab_find_slot_with_hash (discriminator_per_locus, (void *) &item,
718 (hashval_t) locus, INSERT);
720 if (*slot == HTAB_EMPTY_ENTRY)
722 *slot = XNEW (struct locus_discrim_map);
724 (*slot)->locus = locus;
725 (*slot)->discriminator = 0;
727 (*slot)->discriminator++;
728 return (*slot)->discriminator;
731 /* Return TRUE if LOCUS1 and LOCUS2 refer to the same source line. */
734 same_line_p (location_t locus1, location_t locus2)
736 expanded_location from, to;
738 if (locus1 == locus2)
741 from = expand_location (locus1);
742 to = expand_location (locus2);
744 if (from.line != to.line)
746 if (from.file == to.file)
748 return (from.file != NULL
750 && strcmp (from.file, to.file) == 0);
753 /* Assign a unique discriminator value to block BB if it begins at the same
754 LOCUS as its predecessor block. */
757 assign_discriminator (location_t locus, basic_block bb)
761 if (locus == 0 || bb->discriminator != 0)
764 to_stmt = first_non_label_stmt (bb);
765 if (to_stmt && same_line_p (locus, gimple_location (to_stmt)))
766 bb->discriminator = next_discriminator_for_locus (locus);
769 /* Create the edges for a GIMPLE_COND starting at block BB. */
772 make_cond_expr_edges (basic_block bb)
774 gimple entry = last_stmt (bb);
775 gimple then_stmt, else_stmt;
776 basic_block then_bb, else_bb;
777 tree then_label, else_label;
779 location_t entry_locus;
782 gcc_assert (gimple_code (entry) == GIMPLE_COND);
784 entry_locus = gimple_location (entry);
786 /* Entry basic blocks for each component. */
787 then_label = gimple_cond_true_label (entry);
788 else_label = gimple_cond_false_label (entry);
789 then_bb = label_to_block (then_label);
790 else_bb = label_to_block (else_label);
791 then_stmt = first_stmt (then_bb);
792 else_stmt = first_stmt (else_bb);
794 e = make_edge (bb, then_bb, EDGE_TRUE_VALUE);
795 assign_discriminator (entry_locus, then_bb);
796 e->goto_locus = gimple_location (then_stmt);
798 e->goto_block = gimple_block (then_stmt);
799 e = make_edge (bb, else_bb, EDGE_FALSE_VALUE);
802 assign_discriminator (entry_locus, else_bb);
803 e->goto_locus = gimple_location (else_stmt);
805 e->goto_block = gimple_block (else_stmt);
808 /* We do not need the labels anymore. */
809 gimple_cond_set_true_label (entry, NULL_TREE);
810 gimple_cond_set_false_label (entry, NULL_TREE);
814 /* Called for each element in the hash table (P) as we delete the
815 edge to cases hash table.
817 Clear all the TREE_CHAINs to prevent problems with copying of
818 SWITCH_EXPRs and structure sharing rules, then free the hash table
822 edge_to_cases_cleanup (const void *key ATTRIBUTE_UNUSED, void **value,
823 void *data ATTRIBUTE_UNUSED)
827 for (t = (tree) *value; t; t = next)
829 next = TREE_CHAIN (t);
830 TREE_CHAIN (t) = NULL;
837 /* Start recording information mapping edges to case labels. */
840 start_recording_case_labels (void)
842 gcc_assert (edge_to_cases == NULL);
843 edge_to_cases = pointer_map_create ();
846 /* Return nonzero if we are recording information for case labels. */
849 recording_case_labels_p (void)
851 return (edge_to_cases != NULL);
854 /* Stop recording information mapping edges to case labels and
855 remove any information we have recorded. */
857 end_recording_case_labels (void)
859 pointer_map_traverse (edge_to_cases, edge_to_cases_cleanup, NULL);
860 pointer_map_destroy (edge_to_cases);
861 edge_to_cases = NULL;
864 /* If we are inside a {start,end}_recording_cases block, then return
865 a chain of CASE_LABEL_EXPRs from T which reference E.
867 Otherwise return NULL. */
870 get_cases_for_edge (edge e, gimple t)
875 /* If we are not recording cases, then we do not have CASE_LABEL_EXPR
876 chains available. Return NULL so the caller can detect this case. */
877 if (!recording_case_labels_p ())
880 slot = pointer_map_contains (edge_to_cases, e);
884 /* If we did not find E in the hash table, then this must be the first
885 time we have been queried for information about E & T. Add all the
886 elements from T to the hash table then perform the query again. */
888 n = gimple_switch_num_labels (t);
889 for (i = 0; i < n; i++)
891 tree elt = gimple_switch_label (t, i);
892 tree lab = CASE_LABEL (elt);
893 basic_block label_bb = label_to_block (lab);
894 edge this_edge = find_edge (e->src, label_bb);
896 /* Add it to the chain of CASE_LABEL_EXPRs referencing E, or create
898 slot = pointer_map_insert (edge_to_cases, this_edge);
899 TREE_CHAIN (elt) = (tree) *slot;
903 return (tree) *pointer_map_contains (edge_to_cases, e);
906 /* Create the edges for a GIMPLE_SWITCH starting at block BB. */
909 make_gimple_switch_edges (basic_block bb)
911 gimple entry = last_stmt (bb);
912 location_t entry_locus;
915 entry_locus = gimple_location (entry);
917 n = gimple_switch_num_labels (entry);
919 for (i = 0; i < n; ++i)
921 tree lab = CASE_LABEL (gimple_switch_label (entry, i));
922 basic_block label_bb = label_to_block (lab);
923 make_edge (bb, label_bb, 0);
924 assign_discriminator (entry_locus, label_bb);
929 /* Return the basic block holding label DEST. */
932 label_to_block_fn (struct function *ifun, tree dest)
934 int uid = LABEL_DECL_UID (dest);
936 /* We would die hard when faced by an undefined label. Emit a label to
937 the very first basic block. This will hopefully make even the dataflow
938 and undefined variable warnings quite right. */
939 if ((errorcount || sorrycount) && uid < 0)
941 gimple_stmt_iterator gsi = gsi_start_bb (BASIC_BLOCK (NUM_FIXED_BLOCKS));
944 stmt = gimple_build_label (dest);
945 gsi_insert_before (&gsi, stmt, GSI_NEW_STMT);
946 uid = LABEL_DECL_UID (dest);
948 if (VEC_length (basic_block, ifun->cfg->x_label_to_block_map)
949 <= (unsigned int) uid)
951 return VEC_index (basic_block, ifun->cfg->x_label_to_block_map, uid);
954 /* Create edges for an abnormal goto statement at block BB. If FOR_CALL
955 is true, the source statement is a CALL_EXPR instead of a GOTO_EXPR. */
958 make_abnormal_goto_edges (basic_block bb, bool for_call)
960 basic_block target_bb;
961 gimple_stmt_iterator gsi;
963 FOR_EACH_BB (target_bb)
964 for (gsi = gsi_start_bb (target_bb); !gsi_end_p (gsi); gsi_next (&gsi))
966 gimple label_stmt = gsi_stmt (gsi);
969 if (gimple_code (label_stmt) != GIMPLE_LABEL)
972 target = gimple_label_label (label_stmt);
974 /* Make an edge to every label block that has been marked as a
975 potential target for a computed goto or a non-local goto. */
976 if ((FORCED_LABEL (target) && !for_call)
977 || (DECL_NONLOCAL (target) && for_call))
979 make_edge (bb, target_bb, EDGE_ABNORMAL);
985 /* Create edges for a goto statement at block BB. */
988 make_goto_expr_edges (basic_block bb)
990 gimple_stmt_iterator last = gsi_last_bb (bb);
991 gimple goto_t = gsi_stmt (last);
993 /* A simple GOTO creates normal edges. */
994 if (simple_goto_p (goto_t))
996 tree dest = gimple_goto_dest (goto_t);
997 basic_block label_bb = label_to_block (dest);
998 edge e = make_edge (bb, label_bb, EDGE_FALLTHRU);
999 e->goto_locus = gimple_location (goto_t);
1000 assign_discriminator (e->goto_locus, label_bb);
1002 e->goto_block = gimple_block (goto_t);
1003 gsi_remove (&last, true);
1007 /* A computed GOTO creates abnormal edges. */
1008 make_abnormal_goto_edges (bb, false);
1012 /*---------------------------------------------------------------------------
1014 ---------------------------------------------------------------------------*/
1016 /* Cleanup useless labels in basic blocks. This is something we wish
1017 to do early because it allows us to group case labels before creating
1018 the edges for the CFG, and it speeds up block statement iterators in
1019 all passes later on.
1020 We rerun this pass after CFG is created, to get rid of the labels that
1021 are no longer referenced. After then we do not run it any more, since
1022 (almost) no new labels should be created. */
1024 /* A map from basic block index to the leading label of that block. */
1025 static struct label_record
1030 /* True if the label is referenced from somewhere. */
1034 /* Callback for for_each_eh_region. Helper for cleanup_dead_labels. */
1036 update_eh_label (struct eh_region_d *region)
1038 tree old_label = get_eh_region_tree_label (region);
1042 basic_block bb = label_to_block (old_label);
1044 /* ??? After optimizing, there may be EH regions with labels
1045 that have already been removed from the function body, so
1046 there is no basic block for them. */
1050 new_label = label_for_bb[bb->index].label;
1051 label_for_bb[bb->index].used = true;
1052 set_eh_region_tree_label (region, new_label);
1057 /* Given LABEL return the first label in the same basic block. */
1060 main_block_label (tree label)
1062 basic_block bb = label_to_block (label);
1063 tree main_label = label_for_bb[bb->index].label;
1065 /* label_to_block possibly inserted undefined label into the chain. */
1068 label_for_bb[bb->index].label = label;
1072 label_for_bb[bb->index].used = true;
1076 /* Cleanup redundant labels. This is a three-step process:
1077 1) Find the leading label for each block.
1078 2) Redirect all references to labels to the leading labels.
1079 3) Cleanup all useless labels. */
1082 cleanup_dead_labels (void)
1085 label_for_bb = XCNEWVEC (struct label_record, last_basic_block);
1087 /* Find a suitable label for each block. We use the first user-defined
1088 label if there is one, or otherwise just the first label we see. */
1091 gimple_stmt_iterator i;
1093 for (i = gsi_start_bb (bb); !gsi_end_p (i); gsi_next (&i))
1096 gimple stmt = gsi_stmt (i);
1098 if (gimple_code (stmt) != GIMPLE_LABEL)
1101 label = gimple_label_label (stmt);
1103 /* If we have not yet seen a label for the current block,
1104 remember this one and see if there are more labels. */
1105 if (!label_for_bb[bb->index].label)
1107 label_for_bb[bb->index].label = label;
1111 /* If we did see a label for the current block already, but it
1112 is an artificially created label, replace it if the current
1113 label is a user defined label. */
1114 if (!DECL_ARTIFICIAL (label)
1115 && DECL_ARTIFICIAL (label_for_bb[bb->index].label))
1117 label_for_bb[bb->index].label = label;
1123 /* Now redirect all jumps/branches to the selected label.
1124 First do so for each block ending in a control statement. */
1127 gimple stmt = last_stmt (bb);
1131 switch (gimple_code (stmt))
1135 tree true_label = gimple_cond_true_label (stmt);
1136 tree false_label = gimple_cond_false_label (stmt);
1139 gimple_cond_set_true_label (stmt, main_block_label (true_label));
1141 gimple_cond_set_false_label (stmt, main_block_label (false_label));
1147 size_t i, n = gimple_switch_num_labels (stmt);
1149 /* Replace all destination labels. */
1150 for (i = 0; i < n; ++i)
1152 tree case_label = gimple_switch_label (stmt, i);
1153 tree label = main_block_label (CASE_LABEL (case_label));
1154 CASE_LABEL (case_label) = label;
1159 /* We have to handle gotos until they're removed, and we don't
1160 remove them until after we've created the CFG edges. */
1162 if (!computed_goto_p (stmt))
1164 tree new_dest = main_block_label (gimple_goto_dest (stmt));
1165 gimple_goto_set_dest (stmt, new_dest);
1174 for_each_eh_region (update_eh_label);
1176 /* Finally, purge dead labels. All user-defined labels and labels that
1177 can be the target of non-local gotos and labels which have their
1178 address taken are preserved. */
1181 gimple_stmt_iterator i;
1182 tree label_for_this_bb = label_for_bb[bb->index].label;
1184 if (!label_for_this_bb)
1187 /* If the main label of the block is unused, we may still remove it. */
1188 if (!label_for_bb[bb->index].used)
1189 label_for_this_bb = NULL;
1191 for (i = gsi_start_bb (bb); !gsi_end_p (i); )
1194 gimple stmt = gsi_stmt (i);
1196 if (gimple_code (stmt) != GIMPLE_LABEL)
1199 label = gimple_label_label (stmt);
1201 if (label == label_for_this_bb
1202 || !DECL_ARTIFICIAL (label)
1203 || DECL_NONLOCAL (label)
1204 || FORCED_LABEL (label))
1207 gsi_remove (&i, true);
1211 free (label_for_bb);
1214 /* Look for blocks ending in a multiway branch (a SWITCH_EXPR in GIMPLE),
1215 and scan the sorted vector of cases. Combine the ones jumping to the
1217 Eg. three separate entries 1: 2: 3: become one entry 1..3: */
1220 group_case_labels (void)
1226 gimple stmt = last_stmt (bb);
1227 if (stmt && gimple_code (stmt) == GIMPLE_SWITCH)
1229 int old_size = gimple_switch_num_labels (stmt);
1230 int i, j, new_size = old_size;
1231 tree default_case = NULL_TREE;
1232 tree default_label = NULL_TREE;
1235 /* The default label is always the first case in a switch
1236 statement after gimplification if it was not optimized
1238 if (!CASE_LOW (gimple_switch_default_label (stmt))
1239 && !CASE_HIGH (gimple_switch_default_label (stmt)))
1241 default_case = gimple_switch_default_label (stmt);
1242 default_label = CASE_LABEL (default_case);
1246 has_default = false;
1248 /* Look for possible opportunities to merge cases. */
1253 while (i < old_size)
1255 tree base_case, base_label, base_high;
1256 base_case = gimple_switch_label (stmt, i);
1258 gcc_assert (base_case);
1259 base_label = CASE_LABEL (base_case);
1261 /* Discard cases that have the same destination as the
1263 if (base_label == default_label)
1265 gimple_switch_set_label (stmt, i, NULL_TREE);
1271 base_high = CASE_HIGH (base_case)
1272 ? CASE_HIGH (base_case)
1273 : CASE_LOW (base_case);
1276 /* Try to merge case labels. Break out when we reach the end
1277 of the label vector or when we cannot merge the next case
1278 label with the current one. */
1279 while (i < old_size)
1281 tree merge_case = gimple_switch_label (stmt, i);
1282 tree merge_label = CASE_LABEL (merge_case);
1283 tree t = int_const_binop (PLUS_EXPR, base_high,
1284 integer_one_node, 1);
1286 /* Merge the cases if they jump to the same place,
1287 and their ranges are consecutive. */
1288 if (merge_label == base_label
1289 && tree_int_cst_equal (CASE_LOW (merge_case), t))
1291 base_high = CASE_HIGH (merge_case) ?
1292 CASE_HIGH (merge_case) : CASE_LOW (merge_case);
1293 CASE_HIGH (base_case) = base_high;
1294 gimple_switch_set_label (stmt, i, NULL_TREE);
1303 /* Compress the case labels in the label vector, and adjust the
1304 length of the vector. */
1305 for (i = 0, j = 0; i < new_size; i++)
1307 while (! gimple_switch_label (stmt, j))
1309 gimple_switch_set_label (stmt, i,
1310 gimple_switch_label (stmt, j++));
1313 gcc_assert (new_size <= old_size);
1314 gimple_switch_set_num_labels (stmt, new_size);
1319 /* Checks whether we can merge block B into block A. */
1322 gimple_can_merge_blocks_p (basic_block a, basic_block b)
1325 gimple_stmt_iterator gsi;
1328 if (!single_succ_p (a))
1331 if (single_succ_edge (a)->flags & (EDGE_ABNORMAL | EDGE_EH))
1334 if (single_succ (a) != b)
1337 if (!single_pred_p (b))
1340 if (b == EXIT_BLOCK_PTR)
1343 /* If A ends by a statement causing exceptions or something similar, we
1344 cannot merge the blocks. */
1345 stmt = last_stmt (a);
1346 if (stmt && stmt_ends_bb_p (stmt))
1349 /* Do not allow a block with only a non-local label to be merged. */
1351 && gimple_code (stmt) == GIMPLE_LABEL
1352 && DECL_NONLOCAL (gimple_label_label (stmt)))
1355 /* It must be possible to eliminate all phi nodes in B. If ssa form
1356 is not up-to-date, we cannot eliminate any phis; however, if only
1357 some symbols as whole are marked for renaming, this is not a problem,
1358 as phi nodes for those symbols are irrelevant in updating anyway. */
1359 phis = phi_nodes (b);
1360 if (!gimple_seq_empty_p (phis))
1362 gimple_stmt_iterator i;
1364 if (name_mappings_registered_p ())
1367 for (i = gsi_start (phis); !gsi_end_p (i); gsi_next (&i))
1369 gimple phi = gsi_stmt (i);
1371 if (!is_gimple_reg (gimple_phi_result (phi))
1372 && !may_propagate_copy (gimple_phi_result (phi),
1373 gimple_phi_arg_def (phi, 0)))
1378 /* Do not remove user labels. */
1379 for (gsi = gsi_start_bb (b); !gsi_end_p (gsi); gsi_next (&gsi))
1381 stmt = gsi_stmt (gsi);
1382 if (gimple_code (stmt) != GIMPLE_LABEL)
1384 if (!DECL_ARTIFICIAL (gimple_label_label (stmt)))
1388 /* Protect the loop latches. */
1390 && b->loop_father->latch == b)
1396 /* Replaces all uses of NAME by VAL. */
1399 replace_uses_by (tree name, tree val)
1401 imm_use_iterator imm_iter;
1406 FOR_EACH_IMM_USE_STMT (stmt, imm_iter, name)
1408 FOR_EACH_IMM_USE_ON_STMT (use, imm_iter)
1410 replace_exp (use, val);
1412 if (gimple_code (stmt) == GIMPLE_PHI)
1414 e = gimple_phi_arg_edge (stmt, PHI_ARG_INDEX_FROM_USE (use));
1415 if (e->flags & EDGE_ABNORMAL)
1417 /* This can only occur for virtual operands, since
1418 for the real ones SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name))
1419 would prevent replacement. */
1420 gcc_assert (!is_gimple_reg (name));
1421 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (val) = 1;
1426 if (gimple_code (stmt) != GIMPLE_PHI)
1430 fold_stmt_inplace (stmt);
1431 if (cfgcleanup_altered_bbs)
1432 bitmap_set_bit (cfgcleanup_altered_bbs, gimple_bb (stmt)->index);
1434 /* FIXME. This should go in update_stmt. */
1435 for (i = 0; i < gimple_num_ops (stmt); i++)
1437 tree op = gimple_op (stmt, i);
1438 /* Operands may be empty here. For example, the labels
1439 of a GIMPLE_COND are nulled out following the creation
1440 of the corresponding CFG edges. */
1441 if (op && TREE_CODE (op) == ADDR_EXPR)
1442 recompute_tree_invariant_for_addr_expr (op);
1445 maybe_clean_or_replace_eh_stmt (stmt, stmt);
1450 gcc_assert (has_zero_uses (name));
1452 /* Also update the trees stored in loop structures. */
1458 FOR_EACH_LOOP (li, loop, 0)
1460 substitute_in_loop_info (loop, name, val);
1465 /* Merge block B into block A. */
1468 gimple_merge_blocks (basic_block a, basic_block b)
1470 gimple_stmt_iterator last, gsi, psi;
1471 gimple_seq phis = phi_nodes (b);
1474 fprintf (dump_file, "Merging blocks %d and %d\n", a->index, b->index);
1476 /* Remove all single-valued PHI nodes from block B of the form
1477 V_i = PHI <V_j> by propagating V_j to all the uses of V_i. */
1478 gsi = gsi_last_bb (a);
1479 for (psi = gsi_start (phis); !gsi_end_p (psi); )
1481 gimple phi = gsi_stmt (psi);
1482 tree def = gimple_phi_result (phi), use = gimple_phi_arg_def (phi, 0);
1484 bool may_replace_uses = !is_gimple_reg (def)
1485 || may_propagate_copy (def, use);
1487 /* In case we maintain loop closed ssa form, do not propagate arguments
1488 of loop exit phi nodes. */
1490 && loops_state_satisfies_p (LOOP_CLOSED_SSA)
1491 && is_gimple_reg (def)
1492 && TREE_CODE (use) == SSA_NAME
1493 && a->loop_father != b->loop_father)
1494 may_replace_uses = false;
1496 if (!may_replace_uses)
1498 gcc_assert (is_gimple_reg (def));
1500 /* Note that just emitting the copies is fine -- there is no problem
1501 with ordering of phi nodes. This is because A is the single
1502 predecessor of B, therefore results of the phi nodes cannot
1503 appear as arguments of the phi nodes. */
1504 copy = gimple_build_assign (def, use);
1505 gsi_insert_after (&gsi, copy, GSI_NEW_STMT);
1506 remove_phi_node (&psi, false);
1510 /* If we deal with a PHI for virtual operands, we can simply
1511 propagate these without fussing with folding or updating
1513 if (!is_gimple_reg (def))
1515 imm_use_iterator iter;
1516 use_operand_p use_p;
1519 FOR_EACH_IMM_USE_STMT (stmt, iter, def)
1520 FOR_EACH_IMM_USE_ON_STMT (use_p, iter)
1521 SET_USE (use_p, use);
1524 replace_uses_by (def, use);
1526 remove_phi_node (&psi, true);
1530 /* Ensure that B follows A. */
1531 move_block_after (b, a);
1533 gcc_assert (single_succ_edge (a)->flags & EDGE_FALLTHRU);
1534 gcc_assert (!last_stmt (a) || !stmt_ends_bb_p (last_stmt (a)));
1536 /* Remove labels from B and set gimple_bb to A for other statements. */
1537 for (gsi = gsi_start_bb (b); !gsi_end_p (gsi);)
1539 if (gimple_code (gsi_stmt (gsi)) == GIMPLE_LABEL)
1541 gimple label = gsi_stmt (gsi);
1543 gsi_remove (&gsi, false);
1545 /* Now that we can thread computed gotos, we might have
1546 a situation where we have a forced label in block B
1547 However, the label at the start of block B might still be
1548 used in other ways (think about the runtime checking for
1549 Fortran assigned gotos). So we can not just delete the
1550 label. Instead we move the label to the start of block A. */
1551 if (FORCED_LABEL (gimple_label_label (label)))
1553 gimple_stmt_iterator dest_gsi = gsi_start_bb (a);
1554 gsi_insert_before (&dest_gsi, label, GSI_NEW_STMT);
1559 gimple_set_bb (gsi_stmt (gsi), a);
1564 /* Merge the sequences. */
1565 last = gsi_last_bb (a);
1566 gsi_insert_seq_after (&last, bb_seq (b), GSI_NEW_STMT);
1567 set_bb_seq (b, NULL);
1569 if (cfgcleanup_altered_bbs)
1570 bitmap_set_bit (cfgcleanup_altered_bbs, a->index);
1574 /* Return the one of two successors of BB that is not reachable by a
1575 complex edge, if there is one. Else, return BB. We use
1576 this in optimizations that use post-dominators for their heuristics,
1577 to catch the cases in C++ where function calls are involved. */
1580 single_noncomplex_succ (basic_block bb)
1583 if (EDGE_COUNT (bb->succs) != 2)
1586 e0 = EDGE_SUCC (bb, 0);
1587 e1 = EDGE_SUCC (bb, 1);
1588 if (e0->flags & EDGE_COMPLEX)
1590 if (e1->flags & EDGE_COMPLEX)
1597 /* Walk the function tree removing unnecessary statements.
1599 * Empty statement nodes are removed
1601 * Unnecessary TRY_FINALLY and TRY_CATCH blocks are removed
1603 * Unnecessary COND_EXPRs are removed
1605 * Some unnecessary BIND_EXPRs are removed
1607 * GOTO_EXPRs immediately preceding destination are removed.
1609 Clearly more work could be done. The trick is doing the analysis
1610 and removal fast enough to be a net improvement in compile times.
1612 Note that when we remove a control structure such as a COND_EXPR
1613 BIND_EXPR, or TRY block, we will need to repeat this optimization pass
1614 to ensure we eliminate all the useless code. */
1623 gimple_stmt_iterator last_goto_gsi;
1627 static void remove_useless_stmts_1 (gimple_stmt_iterator *gsi, struct rus_data *);
1629 /* Given a statement sequence, find the first executable statement with
1630 location information, and warn that it is unreachable. When searching,
1631 descend into containers in execution order. */
1634 remove_useless_stmts_warn_notreached (gimple_seq stmts)
1636 gimple_stmt_iterator gsi;
1638 for (gsi = gsi_start (stmts); !gsi_end_p (gsi); gsi_next (&gsi))
1640 gimple stmt = gsi_stmt (gsi);
1642 if (gimple_no_warning_p (stmt)) return false;
1644 if (gimple_has_location (stmt))
1646 location_t loc = gimple_location (stmt);
1647 if (LOCATION_LINE (loc) > 0)
1649 warning_at (loc, OPT_Wunreachable_code, "will never be executed");
1654 switch (gimple_code (stmt))
1656 /* Unfortunately, we need the CFG now to detect unreachable
1657 branches in a conditional, so conditionals are not handled here. */
1660 if (remove_useless_stmts_warn_notreached (gimple_try_eval (stmt)))
1662 if (remove_useless_stmts_warn_notreached (gimple_try_cleanup (stmt)))
1667 return remove_useless_stmts_warn_notreached (gimple_catch_handler (stmt));
1669 case GIMPLE_EH_FILTER:
1670 return remove_useless_stmts_warn_notreached (gimple_eh_filter_failure (stmt));
1673 return remove_useless_stmts_warn_notreached (gimple_bind_body (stmt));
1683 /* Helper for remove_useless_stmts_1. Handle GIMPLE_COND statements. */
1686 remove_useless_stmts_cond (gimple_stmt_iterator *gsi, struct rus_data *data)
1688 gimple stmt = gsi_stmt (*gsi);
1690 /* The folded result must still be a conditional statement. */
1692 gcc_assert (gsi_stmt (*gsi) == stmt);
1694 data->may_branch = true;
1696 /* Replace trivial conditionals with gotos. */
1697 if (gimple_cond_true_p (stmt))
1699 /* Goto THEN label. */
1700 tree then_label = gimple_cond_true_label (stmt);
1702 gsi_replace (gsi, gimple_build_goto (then_label), false);
1703 data->last_goto_gsi = *gsi;
1704 data->last_was_goto = true;
1705 data->repeat = true;
1707 else if (gimple_cond_false_p (stmt))
1709 /* Goto ELSE label. */
1710 tree else_label = gimple_cond_false_label (stmt);
1712 gsi_replace (gsi, gimple_build_goto (else_label), false);
1713 data->last_goto_gsi = *gsi;
1714 data->last_was_goto = true;
1715 data->repeat = true;
1719 tree then_label = gimple_cond_true_label (stmt);
1720 tree else_label = gimple_cond_false_label (stmt);
1722 if (then_label == else_label)
1724 /* Goto common destination. */
1725 gsi_replace (gsi, gimple_build_goto (then_label), false);
1726 data->last_goto_gsi = *gsi;
1727 data->last_was_goto = true;
1728 data->repeat = true;
1734 data->last_was_goto = false;
1737 /* Helper for remove_useless_stmts_1.
1738 Handle the try-finally case for GIMPLE_TRY statements. */
1741 remove_useless_stmts_tf (gimple_stmt_iterator *gsi, struct rus_data *data)
1743 bool save_may_branch, save_may_throw;
1744 bool this_may_branch, this_may_throw;
1746 gimple_seq eval_seq, cleanup_seq;
1747 gimple_stmt_iterator eval_gsi, cleanup_gsi;
1749 gimple stmt = gsi_stmt (*gsi);
1751 /* Collect may_branch and may_throw information for the body only. */
1752 save_may_branch = data->may_branch;
1753 save_may_throw = data->may_throw;
1754 data->may_branch = false;
1755 data->may_throw = false;
1756 data->last_was_goto = false;
1758 eval_seq = gimple_try_eval (stmt);
1759 eval_gsi = gsi_start (eval_seq);
1760 remove_useless_stmts_1 (&eval_gsi, data);
1762 this_may_branch = data->may_branch;
1763 this_may_throw = data->may_throw;
1764 data->may_branch |= save_may_branch;
1765 data->may_throw |= save_may_throw;
1766 data->last_was_goto = false;
1768 cleanup_seq = gimple_try_cleanup (stmt);
1769 cleanup_gsi = gsi_start (cleanup_seq);
1770 remove_useless_stmts_1 (&cleanup_gsi, data);
1772 /* If the body is empty, then we can emit the FINALLY block without
1773 the enclosing TRY_FINALLY_EXPR. */
1774 if (gimple_seq_empty_p (eval_seq))
1776 gsi_insert_seq_before (gsi, cleanup_seq, GSI_SAME_STMT);
1777 gsi_remove (gsi, false);
1778 data->repeat = true;
1781 /* If the handler is empty, then we can emit the TRY block without
1782 the enclosing TRY_FINALLY_EXPR. */
1783 else if (gimple_seq_empty_p (cleanup_seq))
1785 gsi_insert_seq_before (gsi, eval_seq, GSI_SAME_STMT);
1786 gsi_remove (gsi, false);
1787 data->repeat = true;
1790 /* If the body neither throws, nor branches, then we can safely
1791 string the TRY and FINALLY blocks together. */
1792 else if (!this_may_branch && !this_may_throw)
1794 gsi_insert_seq_before (gsi, eval_seq, GSI_SAME_STMT);
1795 gsi_insert_seq_before (gsi, cleanup_seq, GSI_SAME_STMT);
1796 gsi_remove (gsi, false);
1797 data->repeat = true;
1803 /* Helper for remove_useless_stmts_1.
1804 Handle the try-catch case for GIMPLE_TRY statements. */
1807 remove_useless_stmts_tc (gimple_stmt_iterator *gsi, struct rus_data *data)
1809 bool save_may_throw, this_may_throw;
1811 gimple_seq eval_seq, cleanup_seq, handler_seq, failure_seq;
1812 gimple_stmt_iterator eval_gsi, cleanup_gsi, handler_gsi, failure_gsi;
1814 gimple stmt = gsi_stmt (*gsi);
1816 /* Collect may_throw information for the body only. */
1817 save_may_throw = data->may_throw;
1818 data->may_throw = false;
1819 data->last_was_goto = false;
1821 eval_seq = gimple_try_eval (stmt);
1822 eval_gsi = gsi_start (eval_seq);
1823 remove_useless_stmts_1 (&eval_gsi, data);
1825 this_may_throw = data->may_throw;
1826 data->may_throw = save_may_throw;
1828 cleanup_seq = gimple_try_cleanup (stmt);
1830 /* If the body cannot throw, then we can drop the entire TRY_CATCH_EXPR. */
1831 if (!this_may_throw)
1833 if (warn_notreached)
1835 remove_useless_stmts_warn_notreached (cleanup_seq);
1837 gsi_insert_seq_before (gsi, eval_seq, GSI_SAME_STMT);
1838 gsi_remove (gsi, false);
1839 data->repeat = true;
1843 /* Process the catch clause specially. We may be able to tell that
1844 no exceptions propagate past this point. */
1846 this_may_throw = true;
1847 cleanup_gsi = gsi_start (cleanup_seq);
1848 stmt = gsi_stmt (cleanup_gsi);
1849 data->last_was_goto = false;
1851 switch (gimple_code (stmt))
1854 /* If the first element is a catch, they all must be. */
1855 while (!gsi_end_p (cleanup_gsi))
1857 stmt = gsi_stmt (cleanup_gsi);
1858 /* If we catch all exceptions, then the body does not
1859 propagate exceptions past this point. */
1860 if (gimple_catch_types (stmt) == NULL)
1861 this_may_throw = false;
1862 data->last_was_goto = false;
1863 handler_seq = gimple_catch_handler (stmt);
1864 handler_gsi = gsi_start (handler_seq);
1865 remove_useless_stmts_1 (&handler_gsi, data);
1866 gsi_next (&cleanup_gsi);
1871 case GIMPLE_EH_FILTER:
1872 /* If the first element is an eh_filter, it should stand alone. */
1873 if (gimple_eh_filter_must_not_throw (stmt))
1874 this_may_throw = false;
1875 else if (gimple_eh_filter_types (stmt) == NULL)
1876 this_may_throw = false;
1877 failure_seq = gimple_eh_filter_failure (stmt);
1878 failure_gsi = gsi_start (failure_seq);
1879 remove_useless_stmts_1 (&failure_gsi, data);
1884 /* Otherwise this is a list of cleanup statements. */
1885 remove_useless_stmts_1 (&cleanup_gsi, data);
1887 /* If the cleanup is empty, then we can emit the TRY block without
1888 the enclosing TRY_CATCH_EXPR. */
1889 if (gimple_seq_empty_p (cleanup_seq))
1891 gsi_insert_seq_before (gsi, eval_seq, GSI_SAME_STMT);
1892 gsi_remove(gsi, false);
1893 data->repeat = true;
1900 data->may_throw |= this_may_throw;
1903 /* Helper for remove_useless_stmts_1. Handle GIMPLE_BIND statements. */
1906 remove_useless_stmts_bind (gimple_stmt_iterator *gsi, struct rus_data *data ATTRIBUTE_UNUSED)
1909 gimple_seq body_seq, fn_body_seq;
1910 gimple_stmt_iterator body_gsi;
1912 gimple stmt = gsi_stmt (*gsi);
1914 /* First remove anything underneath the BIND_EXPR. */
1916 body_seq = gimple_bind_body (stmt);
1917 body_gsi = gsi_start (body_seq);
1918 remove_useless_stmts_1 (&body_gsi, data);
1920 /* If the GIMPLE_BIND has no variables, then we can pull everything
1921 up one level and remove the GIMPLE_BIND, unless this is the toplevel
1922 GIMPLE_BIND for the current function or an inlined function.
1924 When this situation occurs we will want to apply this
1925 optimization again. */
1926 block = gimple_bind_block (stmt);
1927 fn_body_seq = gimple_body (current_function_decl);
1928 if (gimple_bind_vars (stmt) == NULL_TREE
1929 && (gimple_seq_empty_p (fn_body_seq)
1930 || stmt != gimple_seq_first_stmt (fn_body_seq))
1932 || ! BLOCK_ABSTRACT_ORIGIN (block)
1933 || (TREE_CODE (BLOCK_ABSTRACT_ORIGIN (block))
1936 tree var = NULL_TREE;
1937 /* Even if there are no gimple_bind_vars, there might be other
1938 decls in BLOCK_VARS rendering the GIMPLE_BIND not useless. */
1939 if (block && !BLOCK_NUM_NONLOCALIZED_VARS (block))
1940 for (var = BLOCK_VARS (block); var; var = TREE_CHAIN (var))
1941 if (TREE_CODE (var) == IMPORTED_DECL)
1943 if (var || (block && BLOCK_NUM_NONLOCALIZED_VARS (block)))
1947 gsi_insert_seq_before (gsi, body_seq, GSI_SAME_STMT);
1948 gsi_remove (gsi, false);
1949 data->repeat = true;
1956 /* Helper for remove_useless_stmts_1. Handle GIMPLE_GOTO statements. */
1959 remove_useless_stmts_goto (gimple_stmt_iterator *gsi, struct rus_data *data)
1961 gimple stmt = gsi_stmt (*gsi);
1963 tree dest = gimple_goto_dest (stmt);
1965 data->may_branch = true;
1966 data->last_was_goto = false;
1968 /* Record iterator for last goto expr, so that we can delete it if unnecessary. */
1969 if (TREE_CODE (dest) == LABEL_DECL)
1971 data->last_goto_gsi = *gsi;
1972 data->last_was_goto = true;
1978 /* Helper for remove_useless_stmts_1. Handle GIMPLE_LABEL statements. */
1981 remove_useless_stmts_label (gimple_stmt_iterator *gsi, struct rus_data *data)
1983 gimple stmt = gsi_stmt (*gsi);
1985 tree label = gimple_label_label (stmt);
1987 data->has_label = true;
1989 /* We do want to jump across non-local label receiver code. */
1990 if (DECL_NONLOCAL (label))
1991 data->last_was_goto = false;
1993 else if (data->last_was_goto
1994 && gimple_goto_dest (gsi_stmt (data->last_goto_gsi)) == label)
1996 /* Replace the preceding GIMPLE_GOTO statement with
1997 a GIMPLE_NOP, which will be subsequently removed.
1998 In this way, we avoid invalidating other iterators
1999 active on the statement sequence. */
2000 gsi_replace(&data->last_goto_gsi, gimple_build_nop(), false);
2001 data->last_was_goto = false;
2002 data->repeat = true;
2005 /* ??? Add something here to delete unused labels. */
2011 /* T is CALL_EXPR. Set current_function_calls_* flags. */
2014 notice_special_calls (gimple call)
2016 int flags = gimple_call_flags (call);
2018 if (flags & ECF_MAY_BE_ALLOCA)
2019 cfun->calls_alloca = true;
2020 if (flags & ECF_RETURNS_TWICE)
2021 cfun->calls_setjmp = true;
2025 /* Clear flags set by notice_special_calls. Used by dead code removal
2026 to update the flags. */
2029 clear_special_calls (void)
2031 cfun->calls_alloca = false;
2032 cfun->calls_setjmp = false;
2035 /* Remove useless statements from a statement sequence, and perform
2036 some preliminary simplifications. */
2039 remove_useless_stmts_1 (gimple_stmt_iterator *gsi, struct rus_data *data)
2041 while (!gsi_end_p (*gsi))
2043 gimple stmt = gsi_stmt (*gsi);
2045 switch (gimple_code (stmt))
2048 remove_useless_stmts_cond (gsi, data);
2052 remove_useless_stmts_goto (gsi, data);
2056 remove_useless_stmts_label (gsi, data);
2061 stmt = gsi_stmt (*gsi);
2062 data->last_was_goto = false;
2063 if (stmt_could_throw_p (stmt))
2064 data->may_throw = true;
2070 data->last_was_goto = false;
2076 stmt = gsi_stmt (*gsi);
2077 data->last_was_goto = false;
2078 if (is_gimple_call (stmt))
2079 notice_special_calls (stmt);
2081 /* We used to call update_gimple_call_flags here,
2082 which copied side-effects and nothrows status
2083 from the function decl to the call. In the new
2084 tuplified GIMPLE, the accessors for this information
2085 always consult the function decl, so this copying
2086 is no longer necessary. */
2087 if (stmt_could_throw_p (stmt))
2088 data->may_throw = true;
2094 data->last_was_goto = false;
2095 data->may_branch = true;
2100 remove_useless_stmts_bind (gsi, data);
2104 if (gimple_try_kind (stmt) == GIMPLE_TRY_CATCH)
2105 remove_useless_stmts_tc (gsi, data);
2106 else if (gimple_try_kind (stmt) == GIMPLE_TRY_FINALLY)
2107 remove_useless_stmts_tf (gsi, data);
2117 gsi_remove (gsi, false);
2120 case GIMPLE_OMP_FOR:
2122 gimple_seq pre_body_seq = gimple_omp_for_pre_body (stmt);
2123 gimple_stmt_iterator pre_body_gsi = gsi_start (pre_body_seq);
2125 remove_useless_stmts_1 (&pre_body_gsi, data);
2126 data->last_was_goto = false;
2129 case GIMPLE_OMP_CRITICAL:
2130 case GIMPLE_OMP_CONTINUE:
2131 case GIMPLE_OMP_MASTER:
2132 case GIMPLE_OMP_ORDERED:
2133 case GIMPLE_OMP_SECTION:
2134 case GIMPLE_OMP_SECTIONS:
2135 case GIMPLE_OMP_SINGLE:
2137 gimple_seq body_seq = gimple_omp_body (stmt);
2138 gimple_stmt_iterator body_gsi = gsi_start (body_seq);
2140 remove_useless_stmts_1 (&body_gsi, data);
2141 data->last_was_goto = false;
2146 case GIMPLE_OMP_PARALLEL:
2147 case GIMPLE_OMP_TASK:
2149 /* Make sure the outermost GIMPLE_BIND isn't removed
2151 gimple_seq body_seq = gimple_omp_body (stmt);
2152 gimple bind = gimple_seq_first_stmt (body_seq);
2153 gimple_seq bind_seq = gimple_bind_body (bind);
2154 gimple_stmt_iterator bind_gsi = gsi_start (bind_seq);
2156 remove_useless_stmts_1 (&bind_gsi, data);
2157 data->last_was_goto = false;
2163 data->last_was_goto = false;
2170 /* Walk the function tree, removing useless statements and performing
2171 some preliminary simplifications. */
2174 remove_useless_stmts (void)
2176 struct rus_data data;
2178 clear_special_calls ();
2182 gimple_stmt_iterator gsi;
2184 gsi = gsi_start (gimple_body (current_function_decl));
2185 memset (&data, 0, sizeof (data));
2186 remove_useless_stmts_1 (&gsi, &data);
2188 while (data.repeat);
2190 #ifdef ENABLE_TYPES_CHECKING
2191 verify_types_in_gimple_seq (gimple_body (current_function_decl));
2198 struct gimple_opt_pass pass_remove_useless_stmts =
2202 "useless", /* name */
2204 remove_useless_stmts, /* execute */
2207 0, /* static_pass_number */
2208 TV_NONE, /* tv_id */
2209 PROP_gimple_any, /* properties_required */
2210 0, /* properties_provided */
2211 0, /* properties_destroyed */
2212 0, /* todo_flags_start */
2213 TODO_dump_func /* todo_flags_finish */
2217 /* Remove PHI nodes associated with basic block BB and all edges out of BB. */
2220 remove_phi_nodes_and_edges_for_unreachable_block (basic_block bb)
2222 /* Since this block is no longer reachable, we can just delete all
2223 of its PHI nodes. */
2224 remove_phi_nodes (bb);
2226 /* Remove edges to BB's successors. */
2227 while (EDGE_COUNT (bb->succs) > 0)
2228 remove_edge (EDGE_SUCC (bb, 0));
2232 /* Remove statements of basic block BB. */
2235 remove_bb (basic_block bb)
2237 gimple_stmt_iterator i;
2238 source_location loc = UNKNOWN_LOCATION;
2242 fprintf (dump_file, "Removing basic block %d\n", bb->index);
2243 if (dump_flags & TDF_DETAILS)
2245 dump_bb (bb, dump_file, 0);
2246 fprintf (dump_file, "\n");
2252 struct loop *loop = bb->loop_father;
2254 /* If a loop gets removed, clean up the information associated
2256 if (loop->latch == bb
2257 || loop->header == bb)
2258 free_numbers_of_iterations_estimates_loop (loop);
2261 /* Remove all the instructions in the block. */
2262 if (bb_seq (bb) != NULL)
2264 for (i = gsi_start_bb (bb); !gsi_end_p (i);)
2266 gimple stmt = gsi_stmt (i);
2267 if (gimple_code (stmt) == GIMPLE_LABEL
2268 && (FORCED_LABEL (gimple_label_label (stmt))
2269 || DECL_NONLOCAL (gimple_label_label (stmt))))
2272 gimple_stmt_iterator new_gsi;
2274 /* A non-reachable non-local label may still be referenced.
2275 But it no longer needs to carry the extra semantics of
2277 if (DECL_NONLOCAL (gimple_label_label (stmt)))
2279 DECL_NONLOCAL (gimple_label_label (stmt)) = 0;
2280 FORCED_LABEL (gimple_label_label (stmt)) = 1;
2283 new_bb = bb->prev_bb;
2284 new_gsi = gsi_start_bb (new_bb);
2285 gsi_remove (&i, false);
2286 gsi_insert_before (&new_gsi, stmt, GSI_NEW_STMT);
2290 /* Release SSA definitions if we are in SSA. Note that we
2291 may be called when not in SSA. For example,
2292 final_cleanup calls this function via
2293 cleanup_tree_cfg. */
2294 if (gimple_in_ssa_p (cfun))
2295 release_defs (stmt);
2297 gsi_remove (&i, true);
2300 /* Don't warn for removed gotos. Gotos are often removed due to
2301 jump threading, thus resulting in bogus warnings. Not great,
2302 since this way we lose warnings for gotos in the original
2303 program that are indeed unreachable. */
2304 if (gimple_code (stmt) != GIMPLE_GOTO
2305 && gimple_has_location (stmt)
2307 loc = gimple_location (stmt);
2311 /* If requested, give a warning that the first statement in the
2312 block is unreachable. We walk statements backwards in the
2313 loop above, so the last statement we process is the first statement
2315 if (loc > BUILTINS_LOCATION && LOCATION_LINE (loc) > 0)
2316 warning_at (loc, OPT_Wunreachable_code, "will never be executed");
2318 remove_phi_nodes_and_edges_for_unreachable_block (bb);
2319 bb->il.gimple = NULL;
2323 /* Given a basic block BB ending with COND_EXPR or SWITCH_EXPR, and a
2324 predicate VAL, return the edge that will be taken out of the block.
2325 If VAL does not match a unique edge, NULL is returned. */
2328 find_taken_edge (basic_block bb, tree val)
2332 stmt = last_stmt (bb);
2335 gcc_assert (is_ctrl_stmt (stmt));
2340 if (!is_gimple_min_invariant (val))
2343 if (gimple_code (stmt) == GIMPLE_COND)
2344 return find_taken_edge_cond_expr (bb, val);
2346 if (gimple_code (stmt) == GIMPLE_SWITCH)
2347 return find_taken_edge_switch_expr (bb, val);
2349 if (computed_goto_p (stmt))
2351 /* Only optimize if the argument is a label, if the argument is
2352 not a label then we can not construct a proper CFG.
2354 It may be the case that we only need to allow the LABEL_REF to
2355 appear inside an ADDR_EXPR, but we also allow the LABEL_REF to
2356 appear inside a LABEL_EXPR just to be safe. */
2357 if ((TREE_CODE (val) == ADDR_EXPR || TREE_CODE (val) == LABEL_EXPR)
2358 && TREE_CODE (TREE_OPERAND (val, 0)) == LABEL_DECL)
2359 return find_taken_edge_computed_goto (bb, TREE_OPERAND (val, 0));
2366 /* Given a constant value VAL and the entry block BB to a GOTO_EXPR
2367 statement, determine which of the outgoing edges will be taken out of the
2368 block. Return NULL if either edge may be taken. */
2371 find_taken_edge_computed_goto (basic_block bb, tree val)
2376 dest = label_to_block (val);
2379 e = find_edge (bb, dest);
2380 gcc_assert (e != NULL);
2386 /* Given a constant value VAL and the entry block BB to a COND_EXPR
2387 statement, determine which of the two edges will be taken out of the
2388 block. Return NULL if either edge may be taken. */
2391 find_taken_edge_cond_expr (basic_block bb, tree val)
2393 edge true_edge, false_edge;
2395 extract_true_false_edges_from_block (bb, &true_edge, &false_edge);
2397 gcc_assert (TREE_CODE (val) == INTEGER_CST);
2398 return (integer_zerop (val) ? false_edge : true_edge);
2401 /* Given an INTEGER_CST VAL and the entry block BB to a SWITCH_EXPR
2402 statement, determine which edge will be taken out of the block. Return
2403 NULL if any edge may be taken. */
2406 find_taken_edge_switch_expr (basic_block bb, tree val)
2408 basic_block dest_bb;
2413 switch_stmt = last_stmt (bb);
2414 taken_case = find_case_label_for_value (switch_stmt, val);
2415 dest_bb = label_to_block (CASE_LABEL (taken_case));
2417 e = find_edge (bb, dest_bb);
2423 /* Return the CASE_LABEL_EXPR that SWITCH_STMT will take for VAL.
2424 We can make optimal use here of the fact that the case labels are
2425 sorted: We can do a binary search for a case matching VAL. */
2428 find_case_label_for_value (gimple switch_stmt, tree val)
2430 size_t low, high, n = gimple_switch_num_labels (switch_stmt);
2431 tree default_case = gimple_switch_default_label (switch_stmt);
2433 for (low = 0, high = n; high - low > 1; )
2435 size_t i = (high + low) / 2;
2436 tree t = gimple_switch_label (switch_stmt, i);
2439 /* Cache the result of comparing CASE_LOW and val. */
2440 cmp = tree_int_cst_compare (CASE_LOW (t), val);
2447 if (CASE_HIGH (t) == NULL)
2449 /* A singe-valued case label. */
2455 /* A case range. We can only handle integer ranges. */
2456 if (cmp <= 0 && tree_int_cst_compare (CASE_HIGH (t), val) >= 0)
2461 return default_case;
2465 /* Dump a basic block on stderr. */
2468 gimple_debug_bb (basic_block bb)
2470 gimple_dump_bb (bb, stderr, 0, TDF_VOPS|TDF_MEMSYMS);
2474 /* Dump basic block with index N on stderr. */
2477 gimple_debug_bb_n (int n)
2479 gimple_debug_bb (BASIC_BLOCK (n));
2480 return BASIC_BLOCK (n);
2484 /* Dump the CFG on stderr.
2486 FLAGS are the same used by the tree dumping functions
2487 (see TDF_* in tree-pass.h). */
2490 gimple_debug_cfg (int flags)
2492 gimple_dump_cfg (stderr, flags);
2496 /* Dump the program showing basic block boundaries on the given FILE.
2498 FLAGS are the same used by the tree dumping functions (see TDF_* in
2502 gimple_dump_cfg (FILE *file, int flags)
2504 if (flags & TDF_DETAILS)
2506 const char *funcname
2507 = lang_hooks.decl_printable_name (current_function_decl, 2);
2510 fprintf (file, ";; Function %s\n\n", funcname);
2511 fprintf (file, ";; \n%d basic blocks, %d edges, last basic block %d.\n\n",
2512 n_basic_blocks, n_edges, last_basic_block);
2514 brief_dump_cfg (file);
2515 fprintf (file, "\n");
2518 if (flags & TDF_STATS)
2519 dump_cfg_stats (file);
2521 dump_function_to_file (current_function_decl, file, flags | TDF_BLOCKS);
2525 /* Dump CFG statistics on FILE. */
2528 dump_cfg_stats (FILE *file)
2530 static long max_num_merged_labels = 0;
2531 unsigned long size, total = 0;
2534 const char * const fmt_str = "%-30s%-13s%12s\n";
2535 const char * const fmt_str_1 = "%-30s%13d%11lu%c\n";
2536 const char * const fmt_str_2 = "%-30s%13ld%11lu%c\n";
2537 const char * const fmt_str_3 = "%-43s%11lu%c\n";
2538 const char *funcname
2539 = lang_hooks.decl_printable_name (current_function_decl, 2);
2542 fprintf (file, "\nCFG Statistics for %s\n\n", funcname);
2544 fprintf (file, "---------------------------------------------------------\n");
2545 fprintf (file, fmt_str, "", " Number of ", "Memory");
2546 fprintf (file, fmt_str, "", " instances ", "used ");
2547 fprintf (file, "---------------------------------------------------------\n");
2549 size = n_basic_blocks * sizeof (struct basic_block_def);
2551 fprintf (file, fmt_str_1, "Basic blocks", n_basic_blocks,
2552 SCALE (size), LABEL (size));
2556 num_edges += EDGE_COUNT (bb->succs);
2557 size = num_edges * sizeof (struct edge_def);
2559 fprintf (file, fmt_str_2, "Edges", num_edges, SCALE (size), LABEL (size));
2561 fprintf (file, "---------------------------------------------------------\n");
2562 fprintf (file, fmt_str_3, "Total memory used by CFG data", SCALE (total),
2564 fprintf (file, "---------------------------------------------------------\n");
2565 fprintf (file, "\n");
2567 if (cfg_stats.num_merged_labels > max_num_merged_labels)
2568 max_num_merged_labels = cfg_stats.num_merged_labels;
2570 fprintf (file, "Coalesced label blocks: %ld (Max so far: %ld)\n",
2571 cfg_stats.num_merged_labels, max_num_merged_labels);
2573 fprintf (file, "\n");
2577 /* Dump CFG statistics on stderr. Keep extern so that it's always
2578 linked in the final executable. */
2581 debug_cfg_stats (void)
2583 dump_cfg_stats (stderr);
2587 /* Dump the flowgraph to a .vcg FILE. */
2590 gimple_cfg2vcg (FILE *file)
2595 const char *funcname
2596 = lang_hooks.decl_printable_name (current_function_decl, 2);
2598 /* Write the file header. */
2599 fprintf (file, "graph: { title: \"%s\"\n", funcname);
2600 fprintf (file, "node: { title: \"ENTRY\" label: \"ENTRY\" }\n");
2601 fprintf (file, "node: { title: \"EXIT\" label: \"EXIT\" }\n");
2603 /* Write blocks and edges. */
2604 FOR_EACH_EDGE (e, ei, ENTRY_BLOCK_PTR->succs)
2606 fprintf (file, "edge: { sourcename: \"ENTRY\" targetname: \"%d\"",
2609 if (e->flags & EDGE_FAKE)
2610 fprintf (file, " linestyle: dotted priority: 10");
2612 fprintf (file, " linestyle: solid priority: 100");
2614 fprintf (file, " }\n");
2620 enum gimple_code head_code, end_code;
2621 const char *head_name, *end_name;
2624 gimple first = first_stmt (bb);
2625 gimple last = last_stmt (bb);
2629 head_code = gimple_code (first);
2630 head_name = gimple_code_name[head_code];
2631 head_line = get_lineno (first);
2634 head_name = "no-statement";
2638 end_code = gimple_code (last);
2639 end_name = gimple_code_name[end_code];
2640 end_line = get_lineno (last);
2643 end_name = "no-statement";
2645 fprintf (file, "node: { title: \"%d\" label: \"#%d\\n%s (%d)\\n%s (%d)\"}\n",
2646 bb->index, bb->index, head_name, head_line, end_name,
2649 FOR_EACH_EDGE (e, ei, bb->succs)
2651 if (e->dest == EXIT_BLOCK_PTR)
2652 fprintf (file, "edge: { sourcename: \"%d\" targetname: \"EXIT\"", bb->index);
2654 fprintf (file, "edge: { sourcename: \"%d\" targetname: \"%d\"", bb->index, e->dest->index);
2656 if (e->flags & EDGE_FAKE)
2657 fprintf (file, " priority: 10 linestyle: dotted");
2659 fprintf (file, " priority: 100 linestyle: solid");
2661 fprintf (file, " }\n");
2664 if (bb->next_bb != EXIT_BLOCK_PTR)
2668 fputs ("}\n\n", file);
2673 /*---------------------------------------------------------------------------
2674 Miscellaneous helpers
2675 ---------------------------------------------------------------------------*/
2677 /* Return true if T represents a stmt that always transfers control. */
2680 is_ctrl_stmt (gimple t)
2682 return gimple_code (t) == GIMPLE_COND
2683 || gimple_code (t) == GIMPLE_SWITCH
2684 || gimple_code (t) == GIMPLE_GOTO
2685 || gimple_code (t) == GIMPLE_RETURN
2686 || gimple_code (t) == GIMPLE_RESX;
2690 /* Return true if T is a statement that may alter the flow of control
2691 (e.g., a call to a non-returning function). */
2694 is_ctrl_altering_stmt (gimple t)
2698 if (is_gimple_call (t))
2700 int flags = gimple_call_flags (t);
2702 /* A non-pure/const call alters flow control if the current
2703 function has nonlocal labels. */
2704 if (!(flags & (ECF_CONST | ECF_PURE))
2705 && cfun->has_nonlocal_label)
2708 /* A call also alters control flow if it does not return. */
2709 if (gimple_call_flags (t) & ECF_NORETURN)
2713 /* OpenMP directives alter control flow. */
2714 if (is_gimple_omp (t))
2717 /* If a statement can throw, it alters control flow. */
2718 return stmt_can_throw_internal (t);
2722 /* Return true if T is a simple local goto. */
2725 simple_goto_p (gimple t)
2727 return (gimple_code (t) == GIMPLE_GOTO
2728 && TREE_CODE (gimple_goto_dest (t)) == LABEL_DECL);
2732 /* Return true if T can make an abnormal transfer of control flow.
2733 Transfers of control flow associated with EH are excluded. */
2736 stmt_can_make_abnormal_goto (gimple t)
2738 if (computed_goto_p (t))
2740 if (is_gimple_call (t))
2741 return gimple_has_side_effects (t) && cfun->has_nonlocal_label;
2746 /* Return true if STMT should start a new basic block. PREV_STMT is
2747 the statement preceding STMT. It is used when STMT is a label or a
2748 case label. Labels should only start a new basic block if their
2749 previous statement wasn't a label. Otherwise, sequence of labels
2750 would generate unnecessary basic blocks that only contain a single
2754 stmt_starts_bb_p (gimple stmt, gimple prev_stmt)
2759 /* Labels start a new basic block only if the preceding statement
2760 wasn't a label of the same type. This prevents the creation of
2761 consecutive blocks that have nothing but a single label. */
2762 if (gimple_code (stmt) == GIMPLE_LABEL)
2764 /* Nonlocal and computed GOTO targets always start a new block. */
2765 if (DECL_NONLOCAL (gimple_label_label (stmt))
2766 || FORCED_LABEL (gimple_label_label (stmt)))
2769 if (prev_stmt && gimple_code (prev_stmt) == GIMPLE_LABEL)
2771 if (DECL_NONLOCAL (gimple_label_label (prev_stmt)))
2774 cfg_stats.num_merged_labels++;
2785 /* Return true if T should end a basic block. */
2788 stmt_ends_bb_p (gimple t)
2790 return is_ctrl_stmt (t) || is_ctrl_altering_stmt (t);
2793 /* Remove block annotations and other data structures. */
2796 delete_tree_cfg_annotations (void)
2798 label_to_block_map = NULL;
2802 /* Return the first statement in basic block BB. */
2805 first_stmt (basic_block bb)
2807 gimple_stmt_iterator i = gsi_start_bb (bb);
2808 return !gsi_end_p (i) ? gsi_stmt (i) : NULL;
2811 /* Return the first non-label statement in basic block BB. */
2814 first_non_label_stmt (basic_block bb)
2816 gimple_stmt_iterator i = gsi_start_bb (bb);
2817 while (!gsi_end_p (i) && gimple_code (gsi_stmt (i)) == GIMPLE_LABEL)
2819 return !gsi_end_p (i) ? gsi_stmt (i) : NULL;
2822 /* Return the last statement in basic block BB. */
2825 last_stmt (basic_block bb)
2827 gimple_stmt_iterator b = gsi_last_bb (bb);
2828 return !gsi_end_p (b) ? gsi_stmt (b) : NULL;
2831 /* Return the last statement of an otherwise empty block. Return NULL
2832 if the block is totally empty, or if it contains more than one
2836 last_and_only_stmt (basic_block bb)
2838 gimple_stmt_iterator i = gsi_last_bb (bb);
2844 last = gsi_stmt (i);
2849 /* Empty statements should no longer appear in the instruction stream.
2850 Everything that might have appeared before should be deleted by
2851 remove_useless_stmts, and the optimizers should just gsi_remove
2852 instead of smashing with build_empty_stmt.
2854 Thus the only thing that should appear here in a block containing
2855 one executable statement is a label. */
2856 prev = gsi_stmt (i);
2857 if (gimple_code (prev) == GIMPLE_LABEL)
2863 /* Reinstall those PHI arguments queued in OLD_EDGE to NEW_EDGE. */
2866 reinstall_phi_args (edge new_edge, edge old_edge)
2868 edge_var_map_vector v;
2871 gimple_stmt_iterator phis;
2873 v = redirect_edge_var_map_vector (old_edge);
2877 for (i = 0, phis = gsi_start_phis (new_edge->dest);
2878 VEC_iterate (edge_var_map, v, i, vm) && !gsi_end_p (phis);
2879 i++, gsi_next (&phis))
2881 gimple phi = gsi_stmt (phis);
2882 tree result = redirect_edge_var_map_result (vm);
2883 tree arg = redirect_edge_var_map_def (vm);
2885 gcc_assert (result == gimple_phi_result (phi));
2887 add_phi_arg (phi, arg, new_edge);
2890 redirect_edge_var_map_clear (old_edge);
2893 /* Returns the basic block after which the new basic block created
2894 by splitting edge EDGE_IN should be placed. Tries to keep the new block
2895 near its "logical" location. This is of most help to humans looking
2896 at debugging dumps. */
2899 split_edge_bb_loc (edge edge_in)
2901 basic_block dest = edge_in->dest;
2903 if (dest->prev_bb && find_edge (dest->prev_bb, dest))
2904 return edge_in->src;
2906 return dest->prev_bb;
2909 /* Split a (typically critical) edge EDGE_IN. Return the new block.
2910 Abort on abnormal edges. */
2913 gimple_split_edge (edge edge_in)
2915 basic_block new_bb, after_bb, dest;
2918 /* Abnormal edges cannot be split. */
2919 gcc_assert (!(edge_in->flags & EDGE_ABNORMAL));
2921 dest = edge_in->dest;
2923 after_bb = split_edge_bb_loc (edge_in);
2925 new_bb = create_empty_bb (after_bb);
2926 new_bb->frequency = EDGE_FREQUENCY (edge_in);
2927 new_bb->count = edge_in->count;
2928 new_edge = make_edge (new_bb, dest, EDGE_FALLTHRU);
2929 new_edge->probability = REG_BR_PROB_BASE;
2930 new_edge->count = edge_in->count;
2932 e = redirect_edge_and_branch (edge_in, new_bb);
2933 gcc_assert (e == edge_in);
2934 reinstall_phi_args (new_edge, e);
2939 /* Callback for walk_tree, check that all elements with address taken are
2940 properly noticed as such. The DATA is an int* that is 1 if TP was seen
2941 inside a PHI node. */
2944 verify_expr (tree *tp, int *walk_subtrees, void *data ATTRIBUTE_UNUSED)
2951 /* Check operand N for being valid GIMPLE and give error MSG if not. */
2952 #define CHECK_OP(N, MSG) \
2953 do { if (!is_gimple_val (TREE_OPERAND (t, N))) \
2954 { error (MSG); return TREE_OPERAND (t, N); }} while (0)
2956 switch (TREE_CODE (t))
2959 if (SSA_NAME_IN_FREE_LIST (t))
2961 error ("SSA name in freelist but still referenced");
2967 x = TREE_OPERAND (t, 0);
2968 if (!is_gimple_reg (x) && !is_gimple_min_invariant (x))
2970 error ("Indirect reference's operand is not a register or a constant.");
2976 x = fold (ASSERT_EXPR_COND (t));
2977 if (x == boolean_false_node)
2979 error ("ASSERT_EXPR with an always-false condition");
2985 error ("MODIFY_EXPR not expected while having tuples.");
2991 bool old_side_effects;
2993 bool new_side_effects;
2995 gcc_assert (is_gimple_address (t));
2997 old_constant = TREE_CONSTANT (t);
2998 old_side_effects = TREE_SIDE_EFFECTS (t);
3000 recompute_tree_invariant_for_addr_expr (t);
3001 new_side_effects = TREE_SIDE_EFFECTS (t);
3002 new_constant = TREE_CONSTANT (t);
3004 if (old_constant != new_constant)
3006 error ("constant not recomputed when ADDR_EXPR changed");
3009 if (old_side_effects != new_side_effects)
3011 error ("side effects not recomputed when ADDR_EXPR changed");
3015 /* Skip any references (they will be checked when we recurse down the
3016 tree) and ensure that any variable used as a prefix is marked
3018 for (x = TREE_OPERAND (t, 0);
3019 handled_component_p (x);
3020 x = TREE_OPERAND (x, 0))
3023 if (!(TREE_CODE (x) == VAR_DECL
3024 || TREE_CODE (x) == PARM_DECL
3025 || TREE_CODE (x) == RESULT_DECL))
3027 if (!TREE_ADDRESSABLE (x))
3029 error ("address taken, but ADDRESSABLE bit not set");
3032 if (DECL_GIMPLE_REG_P (x))
3034 error ("DECL_GIMPLE_REG_P set on a variable with address taken");
3042 x = COND_EXPR_COND (t);
3043 if (!INTEGRAL_TYPE_P (TREE_TYPE (x)))
3045 error ("non-integral used in condition");
3048 if (!is_gimple_condexpr (x))
3050 error ("invalid conditional operand");
3055 case NON_LVALUE_EXPR:
3059 case FIX_TRUNC_EXPR:
3064 case TRUTH_NOT_EXPR:
3065 CHECK_OP (0, "invalid operand to unary operator");
3072 case ARRAY_RANGE_REF:
3074 case VIEW_CONVERT_EXPR:
3075 /* We have a nest of references. Verify that each of the operands
3076 that determine where to reference is either a constant or a variable,
3077 verify that the base is valid, and then show we've already checked
3079 while (handled_component_p (t))
3081 if (TREE_CODE (t) == COMPONENT_REF && TREE_OPERAND (t, 2))
3082 CHECK_OP (2, "invalid COMPONENT_REF offset operator");
3083 else if (TREE_CODE (t) == ARRAY_REF
3084 || TREE_CODE (t) == ARRAY_RANGE_REF)
3086 CHECK_OP (1, "invalid array index");
3087 if (TREE_OPERAND (t, 2))
3088 CHECK_OP (2, "invalid array lower bound");
3089 if (TREE_OPERAND (t, 3))
3090 CHECK_OP (3, "invalid array stride");
3092 else if (TREE_CODE (t) == BIT_FIELD_REF)
3094 if (!host_integerp (TREE_OPERAND (t, 1), 1)
3095 || !host_integerp (TREE_OPERAND (t, 2), 1))
3097 error ("invalid position or size operand to BIT_FIELD_REF");
3100 else if (INTEGRAL_TYPE_P (TREE_TYPE (t))
3101 && (TYPE_PRECISION (TREE_TYPE (t))
3102 != TREE_INT_CST_LOW (TREE_OPERAND (t, 1))))
3104 error ("integral result type precision does not match "
3105 "field size of BIT_FIELD_REF");
3108 if (!INTEGRAL_TYPE_P (TREE_TYPE (t))
3109 && (GET_MODE_PRECISION (TYPE_MODE (TREE_TYPE (t)))
3110 != TREE_INT_CST_LOW (TREE_OPERAND (t, 1))))
3112 error ("mode precision of non-integral result does not "
3113 "match field size of BIT_FIELD_REF");
3118 t = TREE_OPERAND (t, 0);
3121 if (!is_gimple_min_invariant (t) && !is_gimple_lvalue (t))
3123 error ("invalid reference prefix");
3130 /* PLUS_EXPR and MINUS_EXPR don't work on pointers, they should be done using
3131 POINTER_PLUS_EXPR. */
3132 if (POINTER_TYPE_P (TREE_TYPE (t)))
3134 error ("invalid operand to plus/minus, type is a pointer");
3137 CHECK_OP (0, "invalid operand to binary operator");
3138 CHECK_OP (1, "invalid operand to binary operator");
3141 case POINTER_PLUS_EXPR:
3142 /* Check to make sure the first operand is a pointer or reference type. */
3143 if (!POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (t, 0))))
3145 error ("invalid operand to pointer plus, first operand is not a pointer");
3148 /* Check to make sure the second operand is an integer with type of
3150 if (!useless_type_conversion_p (sizetype,
3151 TREE_TYPE (TREE_OPERAND (t, 1))))
3153 error ("invalid operand to pointer plus, second operand is not an "
3154 "integer with type of sizetype.");
3164 case UNORDERED_EXPR:
3173 case TRUNC_DIV_EXPR:
3175 case FLOOR_DIV_EXPR:
3176 case ROUND_DIV_EXPR:
3177 case TRUNC_MOD_EXPR:
3179 case FLOOR_MOD_EXPR:
3180 case ROUND_MOD_EXPR:
3182 case EXACT_DIV_EXPR:
3192 CHECK_OP (0, "invalid operand to binary operator");
3193 CHECK_OP (1, "invalid operand to binary operator");
3197 if (TREE_CONSTANT (t) && TREE_CODE (TREE_TYPE (t)) == VECTOR_TYPE)
3210 /* Verify if EXPR is either a GIMPLE ID or a GIMPLE indirect reference.
3211 Returns true if there is an error, otherwise false. */
3214 verify_types_in_gimple_min_lval (tree expr)
3218 if (is_gimple_id (expr))
3221 if (!INDIRECT_REF_P (expr)
3222 && TREE_CODE (expr) != TARGET_MEM_REF)
3224 error ("invalid expression for min lvalue");
3228 /* TARGET_MEM_REFs are strange beasts. */
3229 if (TREE_CODE (expr) == TARGET_MEM_REF)
3232 op = TREE_OPERAND (expr, 0);
3233 if (!is_gimple_val (op))
3235 error ("invalid operand in indirect reference");
3236 debug_generic_stmt (op);
3239 if (!useless_type_conversion_p (TREE_TYPE (expr),
3240 TREE_TYPE (TREE_TYPE (op))))
3242 error ("type mismatch in indirect reference");
3243 debug_generic_stmt (TREE_TYPE (expr));
3244 debug_generic_stmt (TREE_TYPE (TREE_TYPE (op)));
3251 /* Verify if EXPR is a valid GIMPLE reference expression. If
3252 REQUIRE_LVALUE is true verifies it is an lvalue. Returns true
3253 if there is an error, otherwise false. */
3256 verify_types_in_gimple_reference (tree expr, bool require_lvalue)
3258 while (handled_component_p (expr))
3260 tree op = TREE_OPERAND (expr, 0);
3262 if (TREE_CODE (expr) == ARRAY_REF
3263 || TREE_CODE (expr) == ARRAY_RANGE_REF)
3265 if (!is_gimple_val (TREE_OPERAND (expr, 1))
3266 || (TREE_OPERAND (expr, 2)
3267 && !is_gimple_val (TREE_OPERAND (expr, 2)))
3268 || (TREE_OPERAND (expr, 3)
3269 && !is_gimple_val (TREE_OPERAND (expr, 3))))
3271 error ("invalid operands to array reference");
3272 debug_generic_stmt (expr);
3277 /* Verify if the reference array element types are compatible. */
3278 if (TREE_CODE (expr) == ARRAY_REF
3279 && !useless_type_conversion_p (TREE_TYPE (expr),
3280 TREE_TYPE (TREE_TYPE (op))))
3282 error ("type mismatch in array reference");
3283 debug_generic_stmt (TREE_TYPE (expr));
3284 debug_generic_stmt (TREE_TYPE (TREE_TYPE (op)));
3287 if (TREE_CODE (expr) == ARRAY_RANGE_REF
3288 && !useless_type_conversion_p (TREE_TYPE (TREE_TYPE (expr)),
3289 TREE_TYPE (TREE_TYPE (op))))
3291 error ("type mismatch in array range reference");
3292 debug_generic_stmt (TREE_TYPE (TREE_TYPE (expr)));
3293 debug_generic_stmt (TREE_TYPE (TREE_TYPE (op)));
3297 if ((TREE_CODE (expr) == REALPART_EXPR
3298 || TREE_CODE (expr) == IMAGPART_EXPR)
3299 && !useless_type_conversion_p (TREE_TYPE (expr),
3300 TREE_TYPE (TREE_TYPE (op))))
3302 error ("type mismatch in real/imagpart reference");
3303 debug_generic_stmt (TREE_TYPE (expr));
3304 debug_generic_stmt (TREE_TYPE (TREE_TYPE (op)));
3308 if (TREE_CODE (expr) == COMPONENT_REF
3309 && !useless_type_conversion_p (TREE_TYPE (expr),
3310 TREE_TYPE (TREE_OPERAND (expr, 1))))
3312 error ("type mismatch in component reference");
3313 debug_generic_stmt (TREE_TYPE (expr));
3314 debug_generic_stmt (TREE_TYPE (TREE_OPERAND (expr, 1)));
3318 /* For VIEW_CONVERT_EXPRs which are allowed here, too, there
3319 is nothing to verify. Gross mismatches at most invoke
3320 undefined behavior. */
3321 if (TREE_CODE (expr) == VIEW_CONVERT_EXPR
3322 && !handled_component_p (op))
3328 return ((require_lvalue || !is_gimple_min_invariant (expr))
3329 && verify_types_in_gimple_min_lval (expr));
3332 /* Returns true if there is one pointer type in TYPE_POINTER_TO (SRC_OBJ)
3333 list of pointer-to types that is trivially convertible to DEST. */
3336 one_pointer_to_useless_type_conversion_p (tree dest, tree src_obj)
3340 if (!TYPE_POINTER_TO (src_obj))
3343 for (src = TYPE_POINTER_TO (src_obj); src; src = TYPE_NEXT_PTR_TO (src))
3344 if (useless_type_conversion_p (dest, src))
3350 /* Return true if TYPE1 is a fixed-point type and if conversions to and
3351 from TYPE2 can be handled by FIXED_CONVERT_EXPR. */
3354 valid_fixed_convert_types_p (tree type1, tree type2)
3356 return (FIXED_POINT_TYPE_P (type1)
3357 && (INTEGRAL_TYPE_P (type2)
3358 || SCALAR_FLOAT_TYPE_P (type2)
3359 || FIXED_POINT_TYPE_P (type2)));
3362 /* Verify the contents of a GIMPLE_CALL STMT. Returns true when there
3363 is a problem, otherwise false. */
3366 verify_gimple_call (gimple stmt)
3368 tree fn = gimple_call_fn (stmt);
3371 if (!POINTER_TYPE_P (TREE_TYPE (fn))
3372 || (TREE_CODE (TREE_TYPE (TREE_TYPE (fn))) != FUNCTION_TYPE
3373 && TREE_CODE (TREE_TYPE (TREE_TYPE (fn))) != METHOD_TYPE))
3375 error ("non-function in gimple call");
3379 if (gimple_call_lhs (stmt)
3380 && !is_gimple_lvalue (gimple_call_lhs (stmt)))
3382 error ("invalid LHS in gimple call");
3386 fntype = TREE_TYPE (TREE_TYPE (fn));
3387 if (gimple_call_lhs (stmt)
3388 && !useless_type_conversion_p (TREE_TYPE (gimple_call_lhs (stmt)),
3390 /* ??? At least C++ misses conversions at assignments from
3391 void * call results.
3392 ??? Java is completely off. Especially with functions
3393 returning java.lang.Object.
3394 For now simply allow arbitrary pointer type conversions. */
3395 && !(POINTER_TYPE_P (TREE_TYPE (gimple_call_lhs (stmt)))
3396 && POINTER_TYPE_P (TREE_TYPE (fntype))))
3398 error ("invalid conversion in gimple call");
3399 debug_generic_stmt (TREE_TYPE (gimple_call_lhs (stmt)));
3400 debug_generic_stmt (TREE_TYPE (fntype));
3404 /* ??? The C frontend passes unpromoted arguments in case it
3405 didn't see a function declaration before the call. So for now
3406 leave the call arguments unverified. Once we gimplify
3407 unit-at-a-time we have a chance to fix this. */
3412 /* Verifies the gimple comparison with the result type TYPE and
3413 the operands OP0 and OP1. */
3416 verify_gimple_comparison (tree type, tree op0, tree op1)
3418 tree op0_type = TREE_TYPE (op0);
3419 tree op1_type = TREE_TYPE (op1);
3421 if (!is_gimple_val (op0) || !is_gimple_val (op1))
3423 error ("invalid operands in gimple comparison");
3427 /* For comparisons we do not have the operations type as the
3428 effective type the comparison is carried out in. Instead
3429 we require that either the first operand is trivially
3430 convertible into the second, or the other way around.
3431 The resulting type of a comparison may be any integral type.
3432 Because we special-case pointers to void we allow
3433 comparisons of pointers with the same mode as well. */
3434 if ((!useless_type_conversion_p (op0_type, op1_type)
3435 && !useless_type_conversion_p (op1_type, op0_type)
3436 && (!POINTER_TYPE_P (op0_type)
3437 || !POINTER_TYPE_P (op1_type)
3438 || TYPE_MODE (op0_type) != TYPE_MODE (op1_type)))
3439 || !INTEGRAL_TYPE_P (type))
3441 error ("type mismatch in comparison expression");
3442 debug_generic_expr (type);
3443 debug_generic_expr (op0_type);
3444 debug_generic_expr (op1_type);
3451 /* Verify a gimple assignment statement STMT with an unary rhs.
3452 Returns true if anything is wrong. */
3455 verify_gimple_assign_unary (gimple stmt)
3457 enum tree_code rhs_code = gimple_assign_rhs_code (stmt);
3458 tree lhs = gimple_assign_lhs (stmt);
3459 tree lhs_type = TREE_TYPE (lhs);
3460 tree rhs1 = gimple_assign_rhs1 (stmt);
3461 tree rhs1_type = TREE_TYPE (rhs1);
3463 if (!is_gimple_reg (lhs)
3465 && TREE_CODE (lhs_type) == COMPLEX_TYPE))
3467 error ("non-register as LHS of unary operation");
3471 if (!is_gimple_val (rhs1))
3473 error ("invalid operand in unary operation");
3477 /* First handle conversions. */
3482 /* Allow conversions between integral types and pointers only if
3483 there is no sign or zero extension involved.
3484 For targets were the precision of sizetype doesn't match that
3485 of pointers we need to allow arbitrary conversions from and
3487 if ((POINTER_TYPE_P (lhs_type)
3488 && INTEGRAL_TYPE_P (rhs1_type)
3489 && (TYPE_PRECISION (lhs_type) >= TYPE_PRECISION (rhs1_type)
3490 || rhs1_type == sizetype))
3491 || (POINTER_TYPE_P (rhs1_type)
3492 && INTEGRAL_TYPE_P (lhs_type)
3493 && (TYPE_PRECISION (rhs1_type) >= TYPE_PRECISION (lhs_type)
3494 || lhs_type == sizetype)))
3497 /* Allow conversion from integer to offset type and vice versa. */
3498 if ((TREE_CODE (lhs_type) == OFFSET_TYPE
3499 && TREE_CODE (rhs1_type) == INTEGER_TYPE)
3500 || (TREE_CODE (lhs_type) == INTEGER_TYPE
3501 && TREE_CODE (rhs1_type) == OFFSET_TYPE))
3504 /* Otherwise assert we are converting between types of the
3506 if (INTEGRAL_TYPE_P (lhs_type) != INTEGRAL_TYPE_P (rhs1_type))
3508 error ("invalid types in nop conversion");
3509 debug_generic_expr (lhs_type);
3510 debug_generic_expr (rhs1_type);
3517 case FIXED_CONVERT_EXPR:
3519 if (!valid_fixed_convert_types_p (lhs_type, rhs1_type)
3520 && !valid_fixed_convert_types_p (rhs1_type, lhs_type))
3522 error ("invalid types in fixed-point conversion");
3523 debug_generic_expr (lhs_type);
3524 debug_generic_expr (rhs1_type);
3533 if (!INTEGRAL_TYPE_P (rhs1_type) || !SCALAR_FLOAT_TYPE_P (lhs_type))
3535 error ("invalid types in conversion to floating point");
3536 debug_generic_expr (lhs_type);
3537 debug_generic_expr (rhs1_type);
3544 case FIX_TRUNC_EXPR:
3546 if (!INTEGRAL_TYPE_P (lhs_type) || !SCALAR_FLOAT_TYPE_P (rhs1_type))
3548 error ("invalid types in conversion to integer");
3549 debug_generic_expr (lhs_type);
3550 debug_generic_expr (rhs1_type);
3557 case VEC_UNPACK_HI_EXPR:
3558 case VEC_UNPACK_LO_EXPR:
3559 case REDUC_MAX_EXPR:
3560 case REDUC_MIN_EXPR:
3561 case REDUC_PLUS_EXPR:
3562 case VEC_UNPACK_FLOAT_HI_EXPR:
3563 case VEC_UNPACK_FLOAT_LO_EXPR:
3567 case TRUTH_NOT_EXPR:
3572 case NON_LVALUE_EXPR:
3580 /* For the remaining codes assert there is no conversion involved. */
3581 if (!useless_type_conversion_p (lhs_type, rhs1_type))
3583 error ("non-trivial conversion in unary operation");
3584 debug_generic_expr (lhs_type);
3585 debug_generic_expr (rhs1_type);
3592 /* Verify a gimple assignment statement STMT with a binary rhs.
3593 Returns true if anything is wrong. */
3596 verify_gimple_assign_binary (gimple stmt)
3598 enum tree_code rhs_code = gimple_assign_rhs_code (stmt);
3599 tree lhs = gimple_assign_lhs (stmt);
3600 tree lhs_type = TREE_TYPE (lhs);
3601 tree rhs1 = gimple_assign_rhs1 (stmt);
3602 tree rhs1_type = TREE_TYPE (rhs1);
3603 tree rhs2 = gimple_assign_rhs2 (stmt);
3604 tree rhs2_type = TREE_TYPE (rhs2);
3606 if (!is_gimple_reg (lhs)
3608 && TREE_CODE (lhs_type) == COMPLEX_TYPE))
3610 error ("non-register as LHS of binary operation");
3614 if (!is_gimple_val (rhs1)
3615 || !is_gimple_val (rhs2))
3617 error ("invalid operands in binary operation");
3621 /* First handle operations that involve different types. */
3626 if (TREE_CODE (lhs_type) != COMPLEX_TYPE
3627 || !(INTEGRAL_TYPE_P (rhs1_type)
3628 || SCALAR_FLOAT_TYPE_P (rhs1_type))
3629 || !(INTEGRAL_TYPE_P (rhs2_type)
3630 || SCALAR_FLOAT_TYPE_P (rhs2_type)))
3632 error ("type mismatch in complex expression");
3633 debug_generic_expr (lhs_type);
3634 debug_generic_expr (rhs1_type);
3635 debug_generic_expr (rhs2_type);
3647 /* Shifts and rotates are ok on integral types, fixed point
3648 types and integer vector types. */
3649 if ((!INTEGRAL_TYPE_P (rhs1_type)
3650 && !FIXED_POINT_TYPE_P (rhs1_type)
3651 && !(TREE_CODE (rhs1_type) == VECTOR_TYPE
3652 && TREE_CODE (TREE_TYPE (rhs1_type)) == INTEGER_TYPE))
3653 || (!INTEGRAL_TYPE_P (rhs2_type)
3654 /* Vector shifts of vectors are also ok. */
3655 && !(TREE_CODE (rhs1_type) == VECTOR_TYPE
3656 && TREE_CODE (TREE_TYPE (rhs1_type)) == INTEGER_TYPE
3657 && TREE_CODE (rhs2_type) == VECTOR_TYPE
3658 && TREE_CODE (TREE_TYPE (rhs2_type)) == INTEGER_TYPE))
3659 || !useless_type_conversion_p (lhs_type, rhs1_type))
3661 error ("type mismatch in shift expression");
3662 debug_generic_expr (lhs_type);
3663 debug_generic_expr (rhs1_type);
3664 debug_generic_expr (rhs2_type);
3671 case VEC_LSHIFT_EXPR:
3672 case VEC_RSHIFT_EXPR:
3674 if (TREE_CODE (rhs1_type) != VECTOR_TYPE
3675 || !(INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type))
3676 || FIXED_POINT_TYPE_P (TREE_TYPE (rhs1_type))
3677 || SCALAR_FLOAT_TYPE_P (TREE_TYPE (rhs1_type)))
3678 || (!INTEGRAL_TYPE_P (rhs2_type)
3679 && (TREE_CODE (rhs2_type) != VECTOR_TYPE
3680 || !INTEGRAL_TYPE_P (TREE_TYPE (rhs2_type))))
3681 || !useless_type_conversion_p (lhs_type, rhs1_type))
3683 error ("type mismatch in vector shift expression");
3684 debug_generic_expr (lhs_type);
3685 debug_generic_expr (rhs1_type);
3686 debug_generic_expr (rhs2_type);
3689 /* For shifting a vector of floating point components we
3690 only allow shifting by a constant multiple of the element size. */
3691 if (SCALAR_FLOAT_TYPE_P (TREE_TYPE (rhs1_type))
3692 && (TREE_CODE (rhs2) != INTEGER_CST
3693 || !div_if_zero_remainder (EXACT_DIV_EXPR, rhs2,
3694 TYPE_SIZE (TREE_TYPE (rhs1_type)))))
3696 error ("non-element sized vector shift of floating point vector");
3705 /* We use regular PLUS_EXPR for vectors.
3706 ??? This just makes the checker happy and may not be what is
3708 if (TREE_CODE (lhs_type) == VECTOR_TYPE
3709 && POINTER_TYPE_P (TREE_TYPE (lhs_type)))
3711 if (TREE_CODE (rhs1_type) != VECTOR_TYPE
3712 || TREE_CODE (rhs2_type) != VECTOR_TYPE)
3714 error ("invalid non-vector operands to vector valued plus");
3717 lhs_type = TREE_TYPE (lhs_type);
3718 rhs1_type = TREE_TYPE (rhs1_type);
3719 rhs2_type = TREE_TYPE (rhs2_type);
3720 /* PLUS_EXPR is commutative, so we might end up canonicalizing
3721 the pointer to 2nd place. */
3722 if (POINTER_TYPE_P (rhs2_type))
3724 tree tem = rhs1_type;
3725 rhs1_type = rhs2_type;
3728 goto do_pointer_plus_expr_check;
3734 if (POINTER_TYPE_P (lhs_type)
3735 || POINTER_TYPE_P (rhs1_type)
3736 || POINTER_TYPE_P (rhs2_type))
3738 error ("invalid (pointer) operands to plus/minus");
3742 /* Continue with generic binary expression handling. */
3746 case POINTER_PLUS_EXPR:
3748 do_pointer_plus_expr_check:
3749 if (!POINTER_TYPE_P (rhs1_type)
3750 || !useless_type_conversion_p (lhs_type, rhs1_type)
3751 || !useless_type_conversion_p (sizetype, rhs2_type))
3753 error ("type mismatch in pointer plus expression");
3754 debug_generic_stmt (lhs_type);
3755 debug_generic_stmt (rhs1_type);
3756 debug_generic_stmt (rhs2_type);
3763 case TRUTH_ANDIF_EXPR:
3764 case TRUTH_ORIF_EXPR:
3767 case TRUTH_AND_EXPR:
3769 case TRUTH_XOR_EXPR:
3771 /* We allow any kind of integral typed argument and result. */
3772 if (!INTEGRAL_TYPE_P (rhs1_type)
3773 || !INTEGRAL_TYPE_P (rhs2_type)
3774 || !INTEGRAL_TYPE_P (lhs_type))
3776 error ("type mismatch in binary truth expression");
3777 debug_generic_expr (lhs_type);
3778 debug_generic_expr (rhs1_type);
3779 debug_generic_expr (rhs2_type);
3792 case UNORDERED_EXPR:
3800 /* Comparisons are also binary, but the result type is not
3801 connected to the operand types. */
3802 return verify_gimple_comparison (lhs_type, rhs1, rhs2);
3804 case WIDEN_SUM_EXPR:
3805 case WIDEN_MULT_EXPR:
3806 case VEC_WIDEN_MULT_HI_EXPR:
3807 case VEC_WIDEN_MULT_LO_EXPR:
3808 case VEC_PACK_TRUNC_EXPR:
3809 case VEC_PACK_SAT_EXPR:
3810 case VEC_PACK_FIX_TRUNC_EXPR:
3811 case VEC_EXTRACT_EVEN_EXPR:
3812 case VEC_EXTRACT_ODD_EXPR:
3813 case VEC_INTERLEAVE_HIGH_EXPR:
3814 case VEC_INTERLEAVE_LOW_EXPR:
3819 case TRUNC_DIV_EXPR:
3821 case FLOOR_DIV_EXPR:
3822 case ROUND_DIV_EXPR:
3823 case TRUNC_MOD_EXPR:
3825 case FLOOR_MOD_EXPR:
3826 case ROUND_MOD_EXPR:
3828 case EXACT_DIV_EXPR:
3834 /* Continue with generic binary expression handling. */
3841 if (!useless_type_conversion_p (lhs_type, rhs1_type)
3842 || !useless_type_conversion_p (lhs_type, rhs2_type))
3844 error ("type mismatch in binary expression");
3845 debug_generic_stmt (lhs_type);
3846 debug_generic_stmt (rhs1_type);
3847 debug_generic_stmt (rhs2_type);
3854 /* Verify a gimple assignment statement STMT with a single rhs.
3855 Returns true if anything is wrong. */
3858 verify_gimple_assign_single (gimple stmt)
3860 enum tree_code rhs_code = gimple_assign_rhs_code (stmt);
3861 tree lhs = gimple_assign_lhs (stmt);
3862 tree lhs_type = TREE_TYPE (lhs);
3863 tree rhs1 = gimple_assign_rhs1 (stmt);
3864 tree rhs1_type = TREE_TYPE (rhs1);
3867 if (!useless_type_conversion_p (lhs_type, rhs1_type))
3869 error ("non-trivial conversion at assignment");
3870 debug_generic_expr (lhs_type);
3871 debug_generic_expr (rhs1_type);
3875 if (handled_component_p (lhs))
3876 res |= verify_types_in_gimple_reference (lhs, true);
3878 /* Special codes we cannot handle via their class. */
3883 tree op = TREE_OPERAND (rhs1, 0);
3884 if (!is_gimple_addressable (op))
3886 error ("invalid operand in unary expression");
3890 if (!one_pointer_to_useless_type_conversion_p (lhs_type,
3893 error ("type mismatch in address expression");
3894 debug_generic_stmt (lhs_type);
3895 debug_generic_stmt (TYPE_POINTER_TO (TREE_TYPE (op)));
3899 return verify_types_in_gimple_reference (op, true);
3906 case ALIGN_INDIRECT_REF:
3907 case MISALIGNED_INDIRECT_REF:
3909 case ARRAY_RANGE_REF:
3910 case VIEW_CONVERT_EXPR:
3913 case TARGET_MEM_REF:
3914 if (!is_gimple_reg (lhs)
3915 && is_gimple_reg_type (TREE_TYPE (lhs)))
3917 error ("invalid rhs for gimple memory store");
3918 debug_generic_stmt (lhs);
3919 debug_generic_stmt (rhs1);
3922 return res || verify_types_in_gimple_reference (rhs1, false);
3934 /* tcc_declaration */
3939 if (!is_gimple_reg (lhs)
3940 && !is_gimple_reg (rhs1)
3941 && is_gimple_reg_type (TREE_TYPE (lhs)))
3943 error ("invalid rhs for gimple memory store");
3944 debug_generic_stmt (lhs);
3945 debug_generic_stmt (rhs1);
3954 case WITH_SIZE_EXPR:
3957 case POLYNOMIAL_CHREC:
3960 case REALIGN_LOAD_EXPR:
3970 /* Verify the contents of a GIMPLE_ASSIGN STMT. Returns true when there
3971 is a problem, otherwise false. */
3974 verify_gimple_assign (gimple stmt)
3976 switch (gimple_assign_rhs_class (stmt))
3978 case GIMPLE_SINGLE_RHS:
3979 return verify_gimple_assign_single (stmt);
3981 case GIMPLE_UNARY_RHS:
3982 return verify_gimple_assign_unary (stmt);
3984 case GIMPLE_BINARY_RHS:
3985 return verify_gimple_assign_binary (stmt);
3992 /* Verify the contents of a GIMPLE_RETURN STMT. Returns true when there
3993 is a problem, otherwise false. */
3996 verify_gimple_return (gimple stmt)
3998 tree op = gimple_return_retval (stmt);
3999 tree restype = TREE_TYPE (TREE_TYPE (cfun->decl));
4001 /* We cannot test for present return values as we do not fix up missing
4002 return values from the original source. */
4006 if (!is_gimple_val (op)
4007 && TREE_CODE (op) != RESULT_DECL)
4009 error ("invalid operand in return statement");
4010 debug_generic_stmt (op);
4014 if (!useless_type_conversion_p (restype, TREE_TYPE (op))
4015 /* ??? With C++ we can have the situation that the result
4016 decl is a reference type while the return type is an aggregate. */
4017 && !(TREE_CODE (op) == RESULT_DECL
4018 && TREE_CODE (TREE_TYPE (op)) == REFERENCE_TYPE
4019 && useless_type_conversion_p (restype, TREE_TYPE (TREE_TYPE (op)))))
4021 error ("invalid conversion in return statement");
4022 debug_generic_stmt (restype);
4023 debug_generic_stmt (TREE_TYPE (op));
4031 /* Verify the contents of a GIMPLE_GOTO STMT. Returns true when there
4032 is a problem, otherwise false. */
4035 verify_gimple_goto (gimple stmt)
4037 tree dest = gimple_goto_dest (stmt);
4039 /* ??? We have two canonical forms of direct goto destinations, a
4040 bare LABEL_DECL and an ADDR_EXPR of a LABEL_DECL. */
4041 if (TREE_CODE (dest) != LABEL_DECL
4042 && (!is_gimple_val (dest)
4043 || !POINTER_TYPE_P (TREE_TYPE (dest))))
4045 error ("goto destination is neither a label nor a pointer");
4052 /* Verify the contents of a GIMPLE_SWITCH STMT. Returns true when there
4053 is a problem, otherwise false. */
4056 verify_gimple_switch (gimple stmt)
4058 if (!is_gimple_val (gimple_switch_index (stmt)))
4060 error ("invalid operand to switch statement");
4061 debug_generic_stmt (gimple_switch_index (stmt));
4069 /* Verify the contents of a GIMPLE_PHI. Returns true if there is a problem,
4070 and false otherwise. */
4073 verify_gimple_phi (gimple stmt)
4075 tree type = TREE_TYPE (gimple_phi_result (stmt));
4078 if (!is_gimple_variable (gimple_phi_result (stmt)))
4080 error ("Invalid PHI result");
4084 for (i = 0; i < gimple_phi_num_args (stmt); i++)
4086 tree arg = gimple_phi_arg_def (stmt, i);
4087 if ((is_gimple_reg (gimple_phi_result (stmt))
4088 && !is_gimple_val (arg))
4089 || (!is_gimple_reg (gimple_phi_result (stmt))
4090 && !is_gimple_addressable (arg)))
4092 error ("Invalid PHI argument");
4093 debug_generic_stmt (arg);
4096 if (!useless_type_conversion_p (type, TREE_TYPE (arg)))
4098 error ("Incompatible types in PHI argument %u", i);
4099 debug_generic_stmt (type);
4100 debug_generic_stmt (TREE_TYPE (arg));
4109 /* Verify the GIMPLE statement STMT. Returns true if there is an
4110 error, otherwise false. */
4113 verify_types_in_gimple_stmt (gimple stmt)
4115 if (is_gimple_omp (stmt))
4117 /* OpenMP directives are validated by the FE and never operated
4118 on by the optimizers. Furthermore, GIMPLE_OMP_FOR may contain
4119 non-gimple expressions when the main index variable has had
4120 its address taken. This does not affect the loop itself
4121 because the header of an GIMPLE_OMP_FOR is merely used to determine
4122 how to setup the parallel iteration. */
4126 switch (gimple_code (stmt))
4129 return verify_gimple_assign (stmt);
4132 return TREE_CODE (gimple_label_label (stmt)) != LABEL_DECL;
4135 return verify_gimple_call (stmt);
4138 return verify_gimple_comparison (boolean_type_node,
4139 gimple_cond_lhs (stmt),
4140 gimple_cond_rhs (stmt));
4143 return verify_gimple_goto (stmt);
4146 return verify_gimple_switch (stmt);
4149 return verify_gimple_return (stmt);
4155 return verify_gimple_phi (stmt);
4157 /* Tuples that do not have tree operands. */
4160 case GIMPLE_PREDICT:
4168 /* Verify the GIMPLE statements inside the sequence STMTS. */
4171 verify_types_in_gimple_seq_2 (gimple_seq stmts)
4173 gimple_stmt_iterator ittr;
4176 for (ittr = gsi_start (stmts); !gsi_end_p (ittr); gsi_next (&ittr))
4178 gimple stmt = gsi_stmt (ittr);
4180 switch (gimple_code (stmt))
4183 err |= verify_types_in_gimple_seq_2 (gimple_bind_body (stmt));
4187 err |= verify_types_in_gimple_seq_2 (gimple_try_eval (stmt));
4188 err |= verify_types_in_gimple_seq_2 (gimple_try_cleanup (stmt));
4191 case GIMPLE_EH_FILTER:
4192 err |= verify_types_in_gimple_seq_2 (gimple_eh_filter_failure (stmt));
4196 err |= verify_types_in_gimple_seq_2 (gimple_catch_handler (stmt));
4201 bool err2 = verify_types_in_gimple_stmt (stmt);
4203 debug_gimple_stmt (stmt);
4213 /* Verify the GIMPLE statements inside the statement list STMTS. */
4216 verify_types_in_gimple_seq (gimple_seq stmts)
4218 if (verify_types_in_gimple_seq_2 (stmts))
4219 internal_error ("verify_gimple failed");
4223 /* Verify STMT, return true if STMT is not in GIMPLE form.
4224 TODO: Implement type checking. */
4227 verify_stmt (gimple_stmt_iterator *gsi)
4230 struct walk_stmt_info wi;
4231 bool last_in_block = gsi_one_before_end_p (*gsi);
4232 gimple stmt = gsi_stmt (*gsi);
4234 if (is_gimple_omp (stmt))
4236 /* OpenMP directives are validated by the FE and never operated
4237 on by the optimizers. Furthermore, GIMPLE_OMP_FOR may contain
4238 non-gimple expressions when the main index variable has had
4239 its address taken. This does not affect the loop itself
4240 because the header of an GIMPLE_OMP_FOR is merely used to determine
4241 how to setup the parallel iteration. */
4245 /* FIXME. The C frontend passes unpromoted arguments in case it
4246 didn't see a function declaration before the call. */
4247 if (is_gimple_call (stmt))
4251 if (!is_gimple_call_addr (gimple_call_fn (stmt)))
4253 error ("invalid function in call statement");
4257 decl = gimple_call_fndecl (stmt);
4259 && TREE_CODE (decl) == FUNCTION_DECL
4260 && DECL_LOOPING_CONST_OR_PURE_P (decl)
4261 && (!DECL_PURE_P (decl))
4262 && (!TREE_READONLY (decl)))
4264 error ("invalid pure const state for function");
4269 memset (&wi, 0, sizeof (wi));
4270 addr = walk_gimple_op (gsi_stmt (*gsi), verify_expr, &wi);
4273 debug_generic_expr (addr);
4274 inform (gimple_location (gsi_stmt (*gsi)), "in statement");
4275 debug_gimple_stmt (stmt);
4279 /* If the statement is marked as part of an EH region, then it is
4280 expected that the statement could throw. Verify that when we
4281 have optimizations that simplify statements such that we prove
4282 that they cannot throw, that we update other data structures
4284 if (lookup_stmt_eh_region (stmt) >= 0)
4286 /* During IPA passes, ipa-pure-const sets nothrow flags on calls
4287 and they are updated on statements only after fixup_cfg
4288 is executed at beggining of expansion stage. */
4289 if (!stmt_could_throw_p (stmt) && cgraph_state != CGRAPH_STATE_IPA_SSA)
4291 error ("statement marked for throw, but doesn%'t");
4294 if (!last_in_block && stmt_can_throw_internal (stmt))
4296 error ("statement marked for throw in middle of block");
4304 debug_gimple_stmt (stmt);
4309 /* Return true when the T can be shared. */
4312 tree_node_can_be_shared (tree t)
4314 if (IS_TYPE_OR_DECL_P (t)
4315 || is_gimple_min_invariant (t)
4316 || TREE_CODE (t) == SSA_NAME
4317 || t == error_mark_node
4318 || TREE_CODE (t) == IDENTIFIER_NODE)
4321 if (TREE_CODE (t) == CASE_LABEL_EXPR)
4324 while (((TREE_CODE (t) == ARRAY_REF || TREE_CODE (t) == ARRAY_RANGE_REF)
4325 && is_gimple_min_invariant (TREE_OPERAND (t, 1)))
4326 || TREE_CODE (t) == COMPONENT_REF
4327 || TREE_CODE (t) == REALPART_EXPR
4328 || TREE_CODE (t) == IMAGPART_EXPR)
4329 t = TREE_OPERAND (t, 0);
4338 /* Called via walk_gimple_stmt. Verify tree sharing. */
4341 verify_node_sharing (tree *tp, int *walk_subtrees, void *data)
4343 struct walk_stmt_info *wi = (struct walk_stmt_info *) data;
4344 struct pointer_set_t *visited = (struct pointer_set_t *) wi->info;
4346 if (tree_node_can_be_shared (*tp))
4348 *walk_subtrees = false;
4352 if (pointer_set_insert (visited, *tp))
4359 static bool eh_error_found;
4361 verify_eh_throw_stmt_node (void **slot, void *data)
4363 struct throw_stmt_node *node = (struct throw_stmt_node *)*slot;
4364 struct pointer_set_t *visited = (struct pointer_set_t *) data;
4366 if (!pointer_set_contains (visited, node->stmt))
4368 error ("Dead STMT in EH table");
4369 debug_gimple_stmt (node->stmt);
4370 eh_error_found = true;
4376 /* Verify the GIMPLE statements in every basic block. */
4382 gimple_stmt_iterator gsi;
4384 struct pointer_set_t *visited, *visited_stmts;
4386 struct walk_stmt_info wi;
4388 timevar_push (TV_TREE_STMT_VERIFY);
4389 visited = pointer_set_create ();
4390 visited_stmts = pointer_set_create ();
4392 memset (&wi, 0, sizeof (wi));
4393 wi.info = (void *) visited;
4400 for (gsi = gsi_start_phis (bb); !gsi_end_p (gsi); gsi_next (&gsi))
4402 phi = gsi_stmt (gsi);
4403 pointer_set_insert (visited_stmts, phi);
4404 if (gimple_bb (phi) != bb)
4406 error ("gimple_bb (phi) is set to a wrong basic block");
4410 for (i = 0; i < gimple_phi_num_args (phi); i++)
4412 tree t = gimple_phi_arg_def (phi, i);
4417 error ("missing PHI def");
4418 debug_gimple_stmt (phi);
4422 /* Addressable variables do have SSA_NAMEs but they
4423 are not considered gimple values. */
4424 else if (TREE_CODE (t) != SSA_NAME
4425 && TREE_CODE (t) != FUNCTION_DECL
4426 && !is_gimple_min_invariant (t))
4428 error ("PHI argument is not a GIMPLE value");
4429 debug_gimple_stmt (phi);
4430 debug_generic_expr (t);
4434 addr = walk_tree (&t, verify_node_sharing, visited, NULL);
4437 error ("incorrect sharing of tree nodes");
4438 debug_gimple_stmt (phi);
4439 debug_generic_expr (addr);
4444 #ifdef ENABLE_TYPES_CHECKING
4445 if (verify_gimple_phi (phi))
4447 debug_gimple_stmt (phi);
4453 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); )
4455 gimple stmt = gsi_stmt (gsi);
4457 if (gimple_code (stmt) == GIMPLE_WITH_CLEANUP_EXPR
4458 || gimple_code (stmt) == GIMPLE_BIND)
4460 error ("invalid GIMPLE statement");
4461 debug_gimple_stmt (stmt);
4465 pointer_set_insert (visited_stmts, stmt);
4467 if (gimple_bb (stmt) != bb)
4469 error ("gimple_bb (stmt) is set to a wrong basic block");
4470 debug_gimple_stmt (stmt);
4474 if (gimple_code (stmt) == GIMPLE_LABEL)
4476 tree decl = gimple_label_label (stmt);
4477 int uid = LABEL_DECL_UID (decl);
4480 || VEC_index (basic_block, label_to_block_map, uid) != bb)
4482 error ("incorrect entry in label_to_block_map.\n");
4487 err |= verify_stmt (&gsi);
4489 #ifdef ENABLE_TYPES_CHECKING
4490 if (verify_types_in_gimple_stmt (gsi_stmt (gsi)))
4492 debug_gimple_stmt (stmt);
4496 addr = walk_gimple_op (gsi_stmt (gsi), verify_node_sharing, &wi);
4499 error ("incorrect sharing of tree nodes");
4500 debug_gimple_stmt (stmt);
4501 debug_generic_expr (addr);
4508 eh_error_found = false;
4509 if (get_eh_throw_stmt_table (cfun))
4510 htab_traverse (get_eh_throw_stmt_table (cfun),
4511 verify_eh_throw_stmt_node,
4514 if (err | eh_error_found)
4515 internal_error ("verify_stmts failed");
4517 pointer_set_destroy (visited);
4518 pointer_set_destroy (visited_stmts);
4519 verify_histograms ();
4520 timevar_pop (TV_TREE_STMT_VERIFY);
4524 /* Verifies that the flow information is OK. */
4527 gimple_verify_flow_info (void)
4531 gimple_stmt_iterator gsi;
4536 if (ENTRY_BLOCK_PTR->il.gimple)
4538 error ("ENTRY_BLOCK has IL associated with it");
4542 if (EXIT_BLOCK_PTR->il.gimple)
4544 error ("EXIT_BLOCK has IL associated with it");
4548 FOR_EACH_EDGE (e, ei, EXIT_BLOCK_PTR->preds)
4549 if (e->flags & EDGE_FALLTHRU)
4551 error ("fallthru to exit from bb %d", e->src->index);
4557 bool found_ctrl_stmt = false;
4561 /* Skip labels on the start of basic block. */
4562 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
4565 gimple prev_stmt = stmt;
4567 stmt = gsi_stmt (gsi);
4569 if (gimple_code (stmt) != GIMPLE_LABEL)
4572 label = gimple_label_label (stmt);
4573 if (prev_stmt && DECL_NONLOCAL (label))
4575 error ("nonlocal label ");
4576 print_generic_expr (stderr, label, 0);
4577 fprintf (stderr, " is not first in a sequence of labels in bb %d",
4582 if (label_to_block (label) != bb)
4585 print_generic_expr (stderr, label, 0);
4586 fprintf (stderr, " to block does not match in bb %d",
4591 if (decl_function_context (label) != current_function_decl)
4594 print_generic_expr (stderr, label, 0);
4595 fprintf (stderr, " has incorrect context in bb %d",
4601 /* Verify that body of basic block BB is free of control flow. */
4602 for (; !gsi_end_p (gsi); gsi_next (&gsi))
4604 gimple stmt = gsi_stmt (gsi);
4606 if (found_ctrl_stmt)
4608 error ("control flow in the middle of basic block %d",
4613 if (stmt_ends_bb_p (stmt))
4614 found_ctrl_stmt = true;
4616 if (gimple_code (stmt) == GIMPLE_LABEL)
4619 print_generic_expr (stderr, gimple_label_label (stmt), 0);
4620 fprintf (stderr, " in the middle of basic block %d", bb->index);
4625 gsi = gsi_last_bb (bb);
4626 if (gsi_end_p (gsi))
4629 stmt = gsi_stmt (gsi);
4631 err |= verify_eh_edges (stmt);
4633 if (is_ctrl_stmt (stmt))
4635 FOR_EACH_EDGE (e, ei, bb->succs)
4636 if (e->flags & EDGE_FALLTHRU)
4638 error ("fallthru edge after a control statement in bb %d",
4644 if (gimple_code (stmt) != GIMPLE_COND)
4646 /* Verify that there are no edges with EDGE_TRUE/FALSE_FLAG set
4647 after anything else but if statement. */
4648 FOR_EACH_EDGE (e, ei, bb->succs)
4649 if (e->flags & (EDGE_TRUE_VALUE | EDGE_FALSE_VALUE))
4651 error ("true/false edge after a non-GIMPLE_COND in bb %d",
4657 switch (gimple_code (stmt))
4664 extract_true_false_edges_from_block (bb, &true_edge, &false_edge);
4668 || !(true_edge->flags & EDGE_TRUE_VALUE)
4669 || !(false_edge->flags & EDGE_FALSE_VALUE)
4670 || (true_edge->flags & (EDGE_FALLTHRU | EDGE_ABNORMAL))
4671 || (false_edge->flags & (EDGE_FALLTHRU | EDGE_ABNORMAL))
4672 || EDGE_COUNT (bb->succs) >= 3)
4674 error ("wrong outgoing edge flags at end of bb %d",
4682 if (simple_goto_p (stmt))
4684 error ("explicit goto at end of bb %d", bb->index);
4689 /* FIXME. We should double check that the labels in the
4690 destination blocks have their address taken. */
4691 FOR_EACH_EDGE (e, ei, bb->succs)
4692 if ((e->flags & (EDGE_FALLTHRU | EDGE_TRUE_VALUE
4693 | EDGE_FALSE_VALUE))
4694 || !(e->flags & EDGE_ABNORMAL))
4696 error ("wrong outgoing edge flags at end of bb %d",
4704 if (!single_succ_p (bb)
4705 || (single_succ_edge (bb)->flags
4706 & (EDGE_FALLTHRU | EDGE_ABNORMAL
4707 | EDGE_TRUE_VALUE | EDGE_FALSE_VALUE)))
4709 error ("wrong outgoing edge flags at end of bb %d", bb->index);
4712 if (single_succ (bb) != EXIT_BLOCK_PTR)
4714 error ("return edge does not point to exit in bb %d",
4726 n = gimple_switch_num_labels (stmt);
4728 /* Mark all the destination basic blocks. */
4729 for (i = 0; i < n; ++i)
4731 tree lab = CASE_LABEL (gimple_switch_label (stmt, i));
4732 basic_block label_bb = label_to_block (lab);
4733 gcc_assert (!label_bb->aux || label_bb->aux == (void *)1);
4734 label_bb->aux = (void *)1;
4737 /* Verify that the case labels are sorted. */
4738 prev = gimple_switch_label (stmt, 0);
4739 for (i = 1; i < n; ++i)
4741 tree c = gimple_switch_label (stmt, i);
4744 error ("found default case not at the start of "
4750 && !tree_int_cst_lt (CASE_LOW (prev), CASE_LOW (c)))
4752 error ("case labels not sorted: ");
4753 print_generic_expr (stderr, prev, 0);
4754 fprintf (stderr," is greater than ");
4755 print_generic_expr (stderr, c, 0);
4756 fprintf (stderr," but comes before it.\n");
4761 /* VRP will remove the default case if it can prove it will
4762 never be executed. So do not verify there always exists
4763 a default case here. */
4765 FOR_EACH_EDGE (e, ei, bb->succs)
4769 error ("extra outgoing edge %d->%d",
4770 bb->index, e->dest->index);
4774 e->dest->aux = (void *)2;
4775 if ((e->flags & (EDGE_FALLTHRU | EDGE_ABNORMAL
4776 | EDGE_TRUE_VALUE | EDGE_FALSE_VALUE)))
4778 error ("wrong outgoing edge flags at end of bb %d",
4784 /* Check that we have all of them. */
4785 for (i = 0; i < n; ++i)
4787 tree lab = CASE_LABEL (gimple_switch_label (stmt, i));
4788 basic_block label_bb = label_to_block (lab);
4790 if (label_bb->aux != (void *)2)
4792 error ("missing edge %i->%i", bb->index, label_bb->index);
4797 FOR_EACH_EDGE (e, ei, bb->succs)
4798 e->dest->aux = (void *)0;
4805 if (dom_info_state (CDI_DOMINATORS) >= DOM_NO_FAST_QUERY)
4806 verify_dominators (CDI_DOMINATORS);
4812 /* Updates phi nodes after creating a forwarder block joined
4813 by edge FALLTHRU. */
4816 gimple_make_forwarder_block (edge fallthru)
4820 basic_block dummy, bb;
4822 gimple_stmt_iterator gsi;
4824 dummy = fallthru->src;
4825 bb = fallthru->dest;
4827 if (single_pred_p (bb))
4830 /* If we redirected a branch we must create new PHI nodes at the
4832 for (gsi = gsi_start_phis (dummy); !gsi_end_p (gsi); gsi_next (&gsi))
4834 gimple phi, new_phi;
4836 phi = gsi_stmt (gsi);
4837 var = gimple_phi_result (phi);
4838 new_phi = create_phi_node (var, bb);
4839 SSA_NAME_DEF_STMT (var) = new_phi;
4840 gimple_phi_set_result (phi, make_ssa_name (SSA_NAME_VAR (var), phi));
4841 add_phi_arg (new_phi, gimple_phi_result (phi), fallthru);
4844 /* Add the arguments we have stored on edges. */
4845 FOR_EACH_EDGE (e, ei, bb->preds)
4850 flush_pending_stmts (e);
4855 /* Return a non-special label in the head of basic block BLOCK.
4856 Create one if it doesn't exist. */
4859 gimple_block_label (basic_block bb)
4861 gimple_stmt_iterator i, s = gsi_start_bb (bb);
4866 for (i = s; !gsi_end_p (i); first = false, gsi_next (&i))
4868 stmt = gsi_stmt (i);
4869 if (gimple_code (stmt) != GIMPLE_LABEL)
4871 label = gimple_label_label (stmt);
4872 if (!DECL_NONLOCAL (label))
4875 gsi_move_before (&i, &s);
4880 label = create_artificial_label (UNKNOWN_LOCATION);
4881 stmt = gimple_build_label (label);
4882 gsi_insert_before (&s, stmt, GSI_NEW_STMT);
4887 /* Attempt to perform edge redirection by replacing a possibly complex
4888 jump instruction by a goto or by removing the jump completely.
4889 This can apply only if all edges now point to the same block. The
4890 parameters and return values are equivalent to
4891 redirect_edge_and_branch. */
4894 gimple_try_redirect_by_replacing_jump (edge e, basic_block target)
4896 basic_block src = e->src;
4897 gimple_stmt_iterator i;
4900 /* We can replace or remove a complex jump only when we have exactly
4902 if (EDGE_COUNT (src->succs) != 2
4903 /* Verify that all targets will be TARGET. Specifically, the
4904 edge that is not E must also go to TARGET. */
4905 || EDGE_SUCC (src, EDGE_SUCC (src, 0) == e)->dest != target)
4908 i = gsi_last_bb (src);
4912 stmt = gsi_stmt (i);
4914 if (gimple_code (stmt) == GIMPLE_COND || gimple_code (stmt) == GIMPLE_SWITCH)
4916 gsi_remove (&i, true);
4917 e = ssa_redirect_edge (e, target);
4918 e->flags = EDGE_FALLTHRU;
4926 /* Redirect E to DEST. Return NULL on failure. Otherwise, return the
4927 edge representing the redirected branch. */
4930 gimple_redirect_edge_and_branch (edge e, basic_block dest)
4932 basic_block bb = e->src;
4933 gimple_stmt_iterator gsi;
4937 if (e->flags & EDGE_ABNORMAL)
4940 if (e->src != ENTRY_BLOCK_PTR
4941 && (ret = gimple_try_redirect_by_replacing_jump (e, dest)))
4944 if (e->dest == dest)
4947 if (e->flags & EDGE_EH)
4948 return redirect_eh_edge (e, dest);
4950 gsi = gsi_last_bb (bb);
4951 stmt = gsi_end_p (gsi) ? NULL : gsi_stmt (gsi);
4953 switch (stmt ? gimple_code (stmt) : GIMPLE_ERROR_MARK)
4956 /* For COND_EXPR, we only need to redirect the edge. */
4960 /* No non-abnormal edges should lead from a non-simple goto, and
4961 simple ones should be represented implicitly. */
4966 tree label = gimple_block_label (dest);
4967 tree cases = get_cases_for_edge (e, stmt);
4969 /* If we have a list of cases associated with E, then use it
4970 as it's a lot faster than walking the entire case vector. */
4973 edge e2 = find_edge (e->src, dest);
4980 CASE_LABEL (cases) = label;
4981 cases = TREE_CHAIN (cases);
4984 /* If there was already an edge in the CFG, then we need
4985 to move all the cases associated with E to E2. */
4988 tree cases2 = get_cases_for_edge (e2, stmt);
4990 TREE_CHAIN (last) = TREE_CHAIN (cases2);
4991 TREE_CHAIN (cases2) = first;
4996 size_t i, n = gimple_switch_num_labels (stmt);
4998 for (i = 0; i < n; i++)
5000 tree elt = gimple_switch_label (stmt, i);
5001 if (label_to_block (CASE_LABEL (elt)) == e->dest)
5002 CASE_LABEL (elt) = label;
5010 gsi_remove (&gsi, true);
5011 e->flags |= EDGE_FALLTHRU;
5014 case GIMPLE_OMP_RETURN:
5015 case GIMPLE_OMP_CONTINUE:
5016 case GIMPLE_OMP_SECTIONS_SWITCH:
5017 case GIMPLE_OMP_FOR:
5018 /* The edges from OMP constructs can be simply redirected. */
5022 /* Otherwise it must be a fallthru edge, and we don't need to
5023 do anything besides redirecting it. */
5024 gcc_assert (e->flags & EDGE_FALLTHRU);
5028 /* Update/insert PHI nodes as necessary. */
5030 /* Now update the edges in the CFG. */
5031 e = ssa_redirect_edge (e, dest);
5036 /* Returns true if it is possible to remove edge E by redirecting
5037 it to the destination of the other edge from E->src. */
5040 gimple_can_remove_branch_p (const_edge e)
5042 if (e->flags & (EDGE_ABNORMAL | EDGE_EH))
5048 /* Simple wrapper, as we can always redirect fallthru edges. */
5051 gimple_redirect_edge_and_branch_force (edge e, basic_block dest)
5053 e = gimple_redirect_edge_and_branch (e, dest);
5060 /* Splits basic block BB after statement STMT (but at least after the
5061 labels). If STMT is NULL, BB is split just after the labels. */
5064 gimple_split_block (basic_block bb, void *stmt)
5066 gimple_stmt_iterator gsi;
5067 gimple_stmt_iterator gsi_tgt;
5074 new_bb = create_empty_bb (bb);
5076 /* Redirect the outgoing edges. */
5077 new_bb->succs = bb->succs;
5079 FOR_EACH_EDGE (e, ei, new_bb->succs)
5082 if (stmt && gimple_code ((gimple) stmt) == GIMPLE_LABEL)
5085 /* Move everything from GSI to the new basic block. */
5086 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
5088 act = gsi_stmt (gsi);
5089 if (gimple_code (act) == GIMPLE_LABEL)
5102 if (gsi_end_p (gsi))
5105 /* Split the statement list - avoid re-creating new containers as this
5106 brings ugly quadratic memory consumption in the inliner.
5107 (We are still quadratic since we need to update stmt BB pointers,
5109 list = gsi_split_seq_before (&gsi);
5110 set_bb_seq (new_bb, list);
5111 for (gsi_tgt = gsi_start (list);
5112 !gsi_end_p (gsi_tgt); gsi_next (&gsi_tgt))
5113 gimple_set_bb (gsi_stmt (gsi_tgt), new_bb);
5119 /* Moves basic block BB after block AFTER. */
5122 gimple_move_block_after (basic_block bb, basic_block after)
5124 if (bb->prev_bb == after)
5128 link_block (bb, after);
5134 /* Return true if basic_block can be duplicated. */
5137 gimple_can_duplicate_bb_p (const_basic_block bb ATTRIBUTE_UNUSED)
5142 /* Create a duplicate of the basic block BB. NOTE: This does not
5143 preserve SSA form. */
5146 gimple_duplicate_bb (basic_block bb)
5149 gimple_stmt_iterator gsi, gsi_tgt;
5150 gimple_seq phis = phi_nodes (bb);
5151 gimple phi, stmt, copy;
5153 new_bb = create_empty_bb (EXIT_BLOCK_PTR->prev_bb);
5155 /* Copy the PHI nodes. We ignore PHI node arguments here because
5156 the incoming edges have not been setup yet. */
5157 for (gsi = gsi_start (phis); !gsi_end_p (gsi); gsi_next (&gsi))
5159 phi = gsi_stmt (gsi);
5160 copy = create_phi_node (gimple_phi_result (phi), new_bb);
5161 create_new_def_for (gimple_phi_result (copy), copy,
5162 gimple_phi_result_ptr (copy));
5165 gsi_tgt = gsi_start_bb (new_bb);
5166 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
5168 def_operand_p def_p;
5169 ssa_op_iter op_iter;
5172 stmt = gsi_stmt (gsi);
5173 if (gimple_code (stmt) == GIMPLE_LABEL)
5176 /* Create a new copy of STMT and duplicate STMT's virtual
5178 copy = gimple_copy (stmt);
5179 gsi_insert_after (&gsi_tgt, copy, GSI_NEW_STMT);
5180 region = lookup_stmt_eh_region (stmt);
5182 add_stmt_to_eh_region (copy, region);
5183 gimple_duplicate_stmt_histograms (cfun, copy, cfun, stmt);
5185 /* Create new names for all the definitions created by COPY and
5186 add replacement mappings for each new name. */
5187 FOR_EACH_SSA_DEF_OPERAND (def_p, copy, op_iter, SSA_OP_ALL_DEFS)
5188 create_new_def_for (DEF_FROM_PTR (def_p), copy, def_p);
5194 /* Adds phi node arguments for edge E_COPY after basic block duplication. */
5197 add_phi_args_after_copy_edge (edge e_copy)
5199 basic_block bb, bb_copy = e_copy->src, dest;
5202 gimple phi, phi_copy;
5204 gimple_stmt_iterator psi, psi_copy;
5206 if (gimple_seq_empty_p (phi_nodes (e_copy->dest)))
5209 bb = bb_copy->flags & BB_DUPLICATED ? get_bb_original (bb_copy) : bb_copy;
5211 if (e_copy->dest->flags & BB_DUPLICATED)
5212 dest = get_bb_original (e_copy->dest);
5214 dest = e_copy->dest;
5216 e = find_edge (bb, dest);
5219 /* During loop unrolling the target of the latch edge is copied.
5220 In this case we are not looking for edge to dest, but to
5221 duplicated block whose original was dest. */
5222 FOR_EACH_EDGE (e, ei, bb->succs)
5224 if ((e->dest->flags & BB_DUPLICATED)
5225 && get_bb_original (e->dest) == dest)
5229 gcc_assert (e != NULL);
5232 for (psi = gsi_start_phis (e->dest),
5233 psi_copy = gsi_start_phis (e_copy->dest);
5235 gsi_next (&psi), gsi_next (&psi_copy))
5237 phi = gsi_stmt (psi);
5238 phi_copy = gsi_stmt (psi_copy);
5239 def = PHI_ARG_DEF_FROM_EDGE (phi, e);
5240 add_phi_arg (phi_copy, def, e_copy);
5245 /* Basic block BB_COPY was created by code duplication. Add phi node
5246 arguments for edges going out of BB_COPY. The blocks that were
5247 duplicated have BB_DUPLICATED set. */
5250 add_phi_args_after_copy_bb (basic_block bb_copy)
5255 FOR_EACH_EDGE (e_copy, ei, bb_copy->succs)
5257 add_phi_args_after_copy_edge (e_copy);
5261 /* Blocks in REGION_COPY array of length N_REGION were created by
5262 duplication of basic blocks. Add phi node arguments for edges
5263 going from these blocks. If E_COPY is not NULL, also add
5264 phi node arguments for its destination.*/
5267 add_phi_args_after_copy (basic_block *region_copy, unsigned n_region,
5272 for (i = 0; i < n_region; i++)
5273 region_copy[i]->flags |= BB_DUPLICATED;
5275 for (i = 0; i < n_region; i++)
5276 add_phi_args_after_copy_bb (region_copy[i]);
5278 add_phi_args_after_copy_edge (e_copy);
5280 for (i = 0; i < n_region; i++)
5281 region_copy[i]->flags &= ~BB_DUPLICATED;
5284 /* Duplicates a REGION (set of N_REGION basic blocks) with just a single
5285 important exit edge EXIT. By important we mean that no SSA name defined
5286 inside region is live over the other exit edges of the region. All entry
5287 edges to the region must go to ENTRY->dest. The edge ENTRY is redirected
5288 to the duplicate of the region. SSA form, dominance and loop information
5289 is updated. The new basic blocks are stored to REGION_COPY in the same
5290 order as they had in REGION, provided that REGION_COPY is not NULL.
5291 The function returns false if it is unable to copy the region,
5295 gimple_duplicate_sese_region (edge entry, edge exit,
5296 basic_block *region, unsigned n_region,
5297 basic_block *region_copy)
5300 bool free_region_copy = false, copying_header = false;
5301 struct loop *loop = entry->dest->loop_father;
5303 VEC (basic_block, heap) *doms;
5305 int total_freq = 0, entry_freq = 0;
5306 gcov_type total_count = 0, entry_count = 0;
5308 if (!can_copy_bbs_p (region, n_region))
5311 /* Some sanity checking. Note that we do not check for all possible
5312 missuses of the functions. I.e. if you ask to copy something weird,
5313 it will work, but the state of structures probably will not be
5315 for (i = 0; i < n_region; i++)
5317 /* We do not handle subloops, i.e. all the blocks must belong to the
5319 if (region[i]->loop_father != loop)
5322 if (region[i] != entry->dest
5323 && region[i] == loop->header)
5327 set_loop_copy (loop, loop);
5329 /* In case the function is used for loop header copying (which is the primary
5330 use), ensure that EXIT and its copy will be new latch and entry edges. */
5331 if (loop->header == entry->dest)
5333 copying_header = true;
5334 set_loop_copy (loop, loop_outer (loop));
5336 if (!dominated_by_p (CDI_DOMINATORS, loop->latch, exit->src))
5339 for (i = 0; i < n_region; i++)
5340 if (region[i] != exit->src
5341 && dominated_by_p (CDI_DOMINATORS, region[i], exit->src))
5347 region_copy = XNEWVEC (basic_block, n_region);
5348 free_region_copy = true;
5351 gcc_assert (!need_ssa_update_p (cfun));
5353 /* Record blocks outside the region that are dominated by something
5356 initialize_original_copy_tables ();
5358 doms = get_dominated_by_region (CDI_DOMINATORS, region, n_region);
5360 if (entry->dest->count)
5362 total_count = entry->dest->count;
5363 entry_count = entry->count;
5364 /* Fix up corner cases, to avoid division by zero or creation of negative
5366 if (entry_count > total_count)
5367 entry_count = total_count;
5371 total_freq = entry->dest->frequency;
5372 entry_freq = EDGE_FREQUENCY (entry);
5373 /* Fix up corner cases, to avoid division by zero or creation of negative
5375 if (total_freq == 0)
5377 else if (entry_freq > total_freq)
5378 entry_freq = total_freq;
5381 copy_bbs (region, n_region, region_copy, &exit, 1, &exit_copy, loop,
5382 split_edge_bb_loc (entry));
5385 scale_bbs_frequencies_gcov_type (region, n_region,
5386 total_count - entry_count,
5388 scale_bbs_frequencies_gcov_type (region_copy, n_region, entry_count,
5393 scale_bbs_frequencies_int (region, n_region, total_freq - entry_freq,
5395 scale_bbs_frequencies_int (region_copy, n_region, entry_freq, total_freq);
5400 loop->header = exit->dest;
5401 loop->latch = exit->src;
5404 /* Redirect the entry and add the phi node arguments. */
5405 redirected = redirect_edge_and_branch (entry, get_bb_copy (entry->dest));
5406 gcc_assert (redirected != NULL);
5407 flush_pending_stmts (entry);
5409 /* Concerning updating of dominators: We must recount dominators
5410 for entry block and its copy. Anything that is outside of the
5411 region, but was dominated by something inside needs recounting as
5413 set_immediate_dominator (CDI_DOMINATORS, entry->dest, entry->src);
5414 VEC_safe_push (basic_block, heap, doms, get_bb_original (entry->dest));
5415 iterate_fix_dominators (CDI_DOMINATORS, doms, false);
5416 VEC_free (basic_block, heap, doms);
5418 /* Add the other PHI node arguments. */
5419 add_phi_args_after_copy (region_copy, n_region, NULL);
5421 /* Update the SSA web. */
5422 update_ssa (TODO_update_ssa);
5424 if (free_region_copy)
5427 free_original_copy_tables ();
5431 /* Duplicates REGION consisting of N_REGION blocks. The new blocks
5432 are stored to REGION_COPY in the same order in that they appear
5433 in REGION, if REGION_COPY is not NULL. ENTRY is the entry to
5434 the region, EXIT an exit from it. The condition guarding EXIT
5435 is moved to ENTRY. Returns true if duplication succeeds, false
5461 gimple_duplicate_sese_tail (edge entry ATTRIBUTE_UNUSED, edge exit ATTRIBUTE_UNUSED,
5462 basic_block *region ATTRIBUTE_UNUSED, unsigned n_region ATTRIBUTE_UNUSED,
5463 basic_block *region_copy ATTRIBUTE_UNUSED)
5466 bool free_region_copy = false;
5467 struct loop *loop = exit->dest->loop_father;
5468 struct loop *orig_loop = entry->dest->loop_father;
5469 basic_block switch_bb, entry_bb, nentry_bb;
5470 VEC (basic_block, heap) *doms;
5471 int total_freq = 0, exit_freq = 0;
5472 gcov_type total_count = 0, exit_count = 0;
5473 edge exits[2], nexits[2], e;
5474 gimple_stmt_iterator gsi;
5478 gcc_assert (EDGE_COUNT (exit->src->succs) == 2);
5480 exits[1] = EDGE_SUCC (exit->src, EDGE_SUCC (exit->src, 0) == exit);
5482 if (!can_copy_bbs_p (region, n_region))
5485 /* Some sanity checking. Note that we do not check for all possible
5486 missuses of the functions. I.e. if you ask to copy something weird
5487 (e.g., in the example, if there is a jump from inside to the middle
5488 of some_code, or come_code defines some of the values used in cond)
5489 it will work, but the resulting code will not be correct. */
5490 for (i = 0; i < n_region; i++)
5492 /* We do not handle subloops, i.e. all the blocks must belong to the
5494 if (region[i]->loop_father != orig_loop)
5497 if (region[i] == orig_loop->latch)
5501 initialize_original_copy_tables ();
5502 set_loop_copy (orig_loop, loop);
5506 region_copy = XNEWVEC (basic_block, n_region);
5507 free_region_copy = true;
5510 gcc_assert (!need_ssa_update_p (cfun));
5512 /* Record blocks outside the region that are dominated by something
5514 doms = get_dominated_by_region (CDI_DOMINATORS, region, n_region);
5516 if (exit->src->count)
5518 total_count = exit->src->count;
5519 exit_count = exit->count;
5520 /* Fix up corner cases, to avoid division by zero or creation of negative
5522 if (exit_count > total_count)
5523 exit_count = total_count;
5527 total_freq = exit->src->frequency;
5528 exit_freq = EDGE_FREQUENCY (exit);
5529 /* Fix up corner cases, to avoid division by zero or creation of negative
5531 if (total_freq == 0)
5533 if (exit_freq > total_freq)
5534 exit_freq = total_freq;
5537 copy_bbs (region, n_region, region_copy, exits, 2, nexits, orig_loop,
5538 split_edge_bb_loc (exit));
5541 scale_bbs_frequencies_gcov_type (region, n_region,
5542 total_count - exit_count,
5544 scale_bbs_frequencies_gcov_type (region_copy, n_region, exit_count,
5549 scale_bbs_frequencies_int (region, n_region, total_freq - exit_freq,
5551 scale_bbs_frequencies_int (region_copy, n_region, exit_freq, total_freq);
5554 /* Create the switch block, and put the exit condition to it. */
5555 entry_bb = entry->dest;
5556 nentry_bb = get_bb_copy (entry_bb);
5557 if (!last_stmt (entry->src)
5558 || !stmt_ends_bb_p (last_stmt (entry->src)))
5559 switch_bb = entry->src;
5561 switch_bb = split_edge (entry);
5562 set_immediate_dominator (CDI_DOMINATORS, nentry_bb, switch_bb);
5564 gsi = gsi_last_bb (switch_bb);
5565 cond_stmt = last_stmt (exit->src);
5566 gcc_assert (gimple_code (cond_stmt) == GIMPLE_COND);
5567 cond_stmt = gimple_copy (cond_stmt);
5568 gimple_cond_set_lhs (cond_stmt, unshare_expr (gimple_cond_lhs (cond_stmt)));
5569 gimple_cond_set_rhs (cond_stmt, unshare_expr (gimple_cond_rhs (cond_stmt)));
5570 gsi_insert_after (&gsi, cond_stmt, GSI_NEW_STMT);
5572 sorig = single_succ_edge (switch_bb);
5573 sorig->flags = exits[1]->flags;
5574 snew = make_edge (switch_bb, nentry_bb, exits[0]->flags);
5576 /* Register the new edge from SWITCH_BB in loop exit lists. */
5577 rescan_loop_exit (snew, true, false);
5579 /* Add the PHI node arguments. */
5580 add_phi_args_after_copy (region_copy, n_region, snew);
5582 /* Get rid of now superfluous conditions and associated edges (and phi node
5584 e = redirect_edge_and_branch (exits[0], exits[1]->dest);
5585 PENDING_STMT (e) = NULL;
5586 e = redirect_edge_and_branch (nexits[1], nexits[0]->dest);
5587 PENDING_STMT (e) = NULL;
5589 /* Anything that is outside of the region, but was dominated by something
5590 inside needs to update dominance info. */
5591 iterate_fix_dominators (CDI_DOMINATORS, doms, false);
5592 VEC_free (basic_block, heap, doms);
5594 /* Update the SSA web. */
5595 update_ssa (TODO_update_ssa);
5597 if (free_region_copy)
5600 free_original_copy_tables ();
5604 /* Add all the blocks dominated by ENTRY to the array BBS_P. Stop
5605 adding blocks when the dominator traversal reaches EXIT. This
5606 function silently assumes that ENTRY strictly dominates EXIT. */
5609 gather_blocks_in_sese_region (basic_block entry, basic_block exit,
5610 VEC(basic_block,heap) **bbs_p)
5614 for (son = first_dom_son (CDI_DOMINATORS, entry);
5616 son = next_dom_son (CDI_DOMINATORS, son))
5618 VEC_safe_push (basic_block, heap, *bbs_p, son);
5620 gather_blocks_in_sese_region (son, exit, bbs_p);
5624 /* Replaces *TP with a duplicate (belonging to function TO_CONTEXT).
5625 The duplicates are recorded in VARS_MAP. */
5628 replace_by_duplicate_decl (tree *tp, struct pointer_map_t *vars_map,
5631 tree t = *tp, new_t;
5632 struct function *f = DECL_STRUCT_FUNCTION (to_context);
5635 if (DECL_CONTEXT (t) == to_context)
5638 loc = pointer_map_contains (vars_map, t);
5642 loc = pointer_map_insert (vars_map, t);
5646 new_t = copy_var_decl (t, DECL_NAME (t), TREE_TYPE (t));
5647 f->local_decls = tree_cons (NULL_TREE, new_t, f->local_decls);
5651 gcc_assert (TREE_CODE (t) == CONST_DECL);
5652 new_t = copy_node (t);
5654 DECL_CONTEXT (new_t) = to_context;
5659 new_t = (tree) *loc;
5665 /* Creates an ssa name in TO_CONTEXT equivalent to NAME.
5666 VARS_MAP maps old ssa names and var_decls to the new ones. */
5669 replace_ssa_name (tree name, struct pointer_map_t *vars_map,
5673 tree new_name, decl = SSA_NAME_VAR (name);
5675 gcc_assert (is_gimple_reg (name));
5677 loc = pointer_map_contains (vars_map, name);
5681 replace_by_duplicate_decl (&decl, vars_map, to_context);
5683 push_cfun (DECL_STRUCT_FUNCTION (to_context));
5684 if (gimple_in_ssa_p (cfun))
5685 add_referenced_var (decl);
5687 new_name = make_ssa_name (decl, SSA_NAME_DEF_STMT (name));
5688 if (SSA_NAME_IS_DEFAULT_DEF (name))
5689 set_default_def (decl, new_name);
5692 loc = pointer_map_insert (vars_map, name);
5696 new_name = (tree) *loc;
5707 struct pointer_map_t *vars_map;
5708 htab_t new_label_map;
5712 /* Helper for move_block_to_fn. Set TREE_BLOCK in every expression
5713 contained in *TP if it has been ORIG_BLOCK previously and change the
5714 DECL_CONTEXT of every local variable referenced in *TP. */
5717 move_stmt_op (tree *tp, int *walk_subtrees, void *data)
5719 struct walk_stmt_info *wi = (struct walk_stmt_info *) data;
5720 struct move_stmt_d *p = (struct move_stmt_d *) wi->info;
5724 /* We should never have TREE_BLOCK set on non-statements. */
5725 gcc_assert (!TREE_BLOCK (t));
5727 else if (DECL_P (t) || TREE_CODE (t) == SSA_NAME)
5729 if (TREE_CODE (t) == SSA_NAME)
5730 *tp = replace_ssa_name (t, p->vars_map, p->to_context);
5731 else if (TREE_CODE (t) == LABEL_DECL)
5733 if (p->new_label_map)
5735 struct tree_map in, *out;
5737 out = (struct tree_map *)
5738 htab_find_with_hash (p->new_label_map, &in, DECL_UID (t));
5743 DECL_CONTEXT (t) = p->to_context;
5745 else if (p->remap_decls_p)
5747 /* Replace T with its duplicate. T should no longer appear in the
5748 parent function, so this looks wasteful; however, it may appear
5749 in referenced_vars, and more importantly, as virtual operands of
5750 statements, and in alias lists of other variables. It would be
5751 quite difficult to expunge it from all those places. ??? It might
5752 suffice to do this for addressable variables. */
5753 if ((TREE_CODE (t) == VAR_DECL
5754 && !is_global_var (t))
5755 || TREE_CODE (t) == CONST_DECL)
5756 replace_by_duplicate_decl (tp, p->vars_map, p->to_context);
5759 && gimple_in_ssa_p (cfun))
5761 push_cfun (DECL_STRUCT_FUNCTION (p->to_context));
5762 add_referenced_var (*tp);
5768 else if (TYPE_P (t))
5774 /* Like move_stmt_op, but for gimple statements.
5776 Helper for move_block_to_fn. Set GIMPLE_BLOCK in every expression
5777 contained in the current statement in *GSI_P and change the
5778 DECL_CONTEXT of every local variable referenced in the current
5782 move_stmt_r (gimple_stmt_iterator *gsi_p, bool *handled_ops_p,
5783 struct walk_stmt_info *wi)
5785 struct move_stmt_d *p = (struct move_stmt_d *) wi->info;
5786 gimple stmt = gsi_stmt (*gsi_p);
5787 tree block = gimple_block (stmt);
5789 if (p->orig_block == NULL_TREE
5790 || block == p->orig_block
5791 || block == NULL_TREE)
5792 gimple_set_block (stmt, p->new_block);
5793 #ifdef ENABLE_CHECKING
5794 else if (block != p->new_block)
5796 while (block && block != p->orig_block)
5797 block = BLOCK_SUPERCONTEXT (block);
5802 if (is_gimple_omp (stmt)
5803 && gimple_code (stmt) != GIMPLE_OMP_RETURN
5804 && gimple_code (stmt) != GIMPLE_OMP_CONTINUE)
5806 /* Do not remap variables inside OMP directives. Variables
5807 referenced in clauses and directive header belong to the
5808 parent function and should not be moved into the child
5810 bool save_remap_decls_p = p->remap_decls_p;
5811 p->remap_decls_p = false;
5812 *handled_ops_p = true;
5814 walk_gimple_seq (gimple_omp_body (stmt), move_stmt_r, move_stmt_op, wi);
5816 p->remap_decls_p = save_remap_decls_p;
5822 /* Marks virtual operands of all statements in basic blocks BBS for
5826 mark_virtual_ops_in_bb (basic_block bb)
5828 gimple_stmt_iterator gsi;
5830 for (gsi = gsi_start_phis (bb); !gsi_end_p (gsi); gsi_next (&gsi))
5831 mark_virtual_ops_for_renaming (gsi_stmt (gsi));
5833 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
5834 mark_virtual_ops_for_renaming (gsi_stmt (gsi));
5837 /* Move basic block BB from function CFUN to function DEST_FN. The
5838 block is moved out of the original linked list and placed after
5839 block AFTER in the new list. Also, the block is removed from the
5840 original array of blocks and placed in DEST_FN's array of blocks.
5841 If UPDATE_EDGE_COUNT_P is true, the edge counts on both CFGs is
5842 updated to reflect the moved edges.
5844 The local variables are remapped to new instances, VARS_MAP is used
5845 to record the mapping. */
5848 move_block_to_fn (struct function *dest_cfun, basic_block bb,
5849 basic_block after, bool update_edge_count_p,
5850 struct move_stmt_d *d, int eh_offset)
5852 struct control_flow_graph *cfg;
5855 gimple_stmt_iterator si;
5856 unsigned old_len, new_len;
5858 /* Remove BB from dominance structures. */
5859 delete_from_dominance_info (CDI_DOMINATORS, bb);
5861 remove_bb_from_loops (bb);
5863 /* Link BB to the new linked list. */
5864 move_block_after (bb, after);
5866 /* Update the edge count in the corresponding flowgraphs. */
5867 if (update_edge_count_p)
5868 FOR_EACH_EDGE (e, ei, bb->succs)
5870 cfun->cfg->x_n_edges--;
5871 dest_cfun->cfg->x_n_edges++;
5874 /* Remove BB from the original basic block array. */
5875 VEC_replace (basic_block, cfun->cfg->x_basic_block_info, bb->index, NULL);
5876 cfun->cfg->x_n_basic_blocks--;
5878 /* Grow DEST_CFUN's basic block array if needed. */
5879 cfg = dest_cfun->cfg;
5880 cfg->x_n_basic_blocks++;
5881 if (bb->index >= cfg->x_last_basic_block)
5882 cfg->x_last_basic_block = bb->index + 1;
5884 old_len = VEC_length (basic_block, cfg->x_basic_block_info);
5885 if ((unsigned) cfg->x_last_basic_block >= old_len)
5887 new_len = cfg->x_last_basic_block + (cfg->x_last_basic_block + 3) / 4;
5888 VEC_safe_grow_cleared (basic_block, gc, cfg->x_basic_block_info,
5892 VEC_replace (basic_block, cfg->x_basic_block_info,
5895 /* Remap the variables in phi nodes. */
5896 for (si = gsi_start_phis (bb); !gsi_end_p (si); )
5898 gimple phi = gsi_stmt (si);
5900 tree op = PHI_RESULT (phi);
5903 if (!is_gimple_reg (op))
5905 /* Remove the phi nodes for virtual operands (alias analysis will be
5906 run for the new function, anyway). */
5907 remove_phi_node (&si, true);
5911 SET_PHI_RESULT (phi,
5912 replace_ssa_name (op, d->vars_map, dest_cfun->decl));
5913 FOR_EACH_PHI_ARG (use, phi, oi, SSA_OP_USE)
5915 op = USE_FROM_PTR (use);
5916 if (TREE_CODE (op) == SSA_NAME)
5917 SET_USE (use, replace_ssa_name (op, d->vars_map, dest_cfun->decl));
5923 for (si = gsi_start_bb (bb); !gsi_end_p (si); gsi_next (&si))
5925 gimple stmt = gsi_stmt (si);
5927 struct walk_stmt_info wi;
5929 memset (&wi, 0, sizeof (wi));
5931 walk_gimple_stmt (&si, move_stmt_r, move_stmt_op, &wi);
5933 if (gimple_code (stmt) == GIMPLE_LABEL)
5935 tree label = gimple_label_label (stmt);
5936 int uid = LABEL_DECL_UID (label);
5938 gcc_assert (uid > -1);
5940 old_len = VEC_length (basic_block, cfg->x_label_to_block_map);
5941 if (old_len <= (unsigned) uid)
5943 new_len = 3 * uid / 2 + 1;
5944 VEC_safe_grow_cleared (basic_block, gc,
5945 cfg->x_label_to_block_map, new_len);
5948 VEC_replace (basic_block, cfg->x_label_to_block_map, uid, bb);
5949 VEC_replace (basic_block, cfun->cfg->x_label_to_block_map, uid, NULL);
5951 gcc_assert (DECL_CONTEXT (label) == dest_cfun->decl);
5953 if (uid >= dest_cfun->cfg->last_label_uid)
5954 dest_cfun->cfg->last_label_uid = uid + 1;
5956 else if (gimple_code (stmt) == GIMPLE_RESX && eh_offset != 0)
5957 gimple_resx_set_region (stmt, gimple_resx_region (stmt) + eh_offset);
5959 region = lookup_stmt_eh_region (stmt);
5962 add_stmt_to_eh_region_fn (dest_cfun, stmt, region + eh_offset);
5963 remove_stmt_from_eh_region (stmt);
5964 gimple_duplicate_stmt_histograms (dest_cfun, stmt, cfun, stmt);
5965 gimple_remove_stmt_histograms (cfun, stmt);
5968 /* We cannot leave any operands allocated from the operand caches of
5969 the current function. */
5970 free_stmt_operands (stmt);
5971 push_cfun (dest_cfun);
5976 FOR_EACH_EDGE (e, ei, bb->succs)
5979 tree block = e->goto_block;
5980 if (d->orig_block == NULL_TREE
5981 || block == d->orig_block)
5982 e->goto_block = d->new_block;
5983 #ifdef ENABLE_CHECKING
5984 else if (block != d->new_block)
5986 while (block && block != d->orig_block)
5987 block = BLOCK_SUPERCONTEXT (block);
5994 /* Examine the statements in BB (which is in SRC_CFUN); find and return
5995 the outermost EH region. Use REGION as the incoming base EH region. */
5998 find_outermost_region_in_block (struct function *src_cfun,
5999 basic_block bb, int region)
6001 gimple_stmt_iterator si;
6003 for (si = gsi_start_bb (bb); !gsi_end_p (si); gsi_next (&si))
6005 gimple stmt = gsi_stmt (si);
6008 if (gimple_code (stmt) == GIMPLE_RESX)
6009 stmt_region = gimple_resx_region (stmt);
6011 stmt_region = lookup_stmt_eh_region_fn (src_cfun, stmt);
6012 if (stmt_region > 0)
6015 region = stmt_region;
6016 else if (stmt_region != region)
6018 region = eh_region_outermost (src_cfun, stmt_region, region);
6019 gcc_assert (region != -1);
6028 new_label_mapper (tree decl, void *data)
6030 htab_t hash = (htab_t) data;
6034 gcc_assert (TREE_CODE (decl) == LABEL_DECL);
6036 m = XNEW (struct tree_map);
6037 m->hash = DECL_UID (decl);
6038 m->base.from = decl;
6039 m->to = create_artificial_label (UNKNOWN_LOCATION);
6040 LABEL_DECL_UID (m->to) = LABEL_DECL_UID (decl);
6041 if (LABEL_DECL_UID (m->to) >= cfun->cfg->last_label_uid)
6042 cfun->cfg->last_label_uid = LABEL_DECL_UID (m->to) + 1;
6044 slot = htab_find_slot_with_hash (hash, m, m->hash, INSERT);
6045 gcc_assert (*slot == NULL);
6052 /* Change DECL_CONTEXT of all BLOCK_VARS in block, including
6056 replace_block_vars_by_duplicates (tree block, struct pointer_map_t *vars_map,
6061 for (tp = &BLOCK_VARS (block); *tp; tp = &TREE_CHAIN (*tp))
6064 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != CONST_DECL)
6066 replace_by_duplicate_decl (&t, vars_map, to_context);
6069 if (TREE_CODE (*tp) == VAR_DECL && DECL_HAS_VALUE_EXPR_P (*tp))
6071 SET_DECL_VALUE_EXPR (t, DECL_VALUE_EXPR (*tp));
6072 DECL_HAS_VALUE_EXPR_P (t) = 1;
6074 TREE_CHAIN (t) = TREE_CHAIN (*tp);
6079 for (block = BLOCK_SUBBLOCKS (block); block; block = BLOCK_CHAIN (block))
6080 replace_block_vars_by_duplicates (block, vars_map, to_context);
6083 /* Move a single-entry, single-exit region delimited by ENTRY_BB and
6084 EXIT_BB to function DEST_CFUN. The whole region is replaced by a
6085 single basic block in the original CFG and the new basic block is
6086 returned. DEST_CFUN must not have a CFG yet.
6088 Note that the region need not be a pure SESE region. Blocks inside
6089 the region may contain calls to abort/exit. The only restriction
6090 is that ENTRY_BB should be the only entry point and it must
6093 Change TREE_BLOCK of all statements in ORIG_BLOCK to the new
6094 functions outermost BLOCK, move all subblocks of ORIG_BLOCK
6095 to the new function.
6097 All local variables referenced in the region are assumed to be in
6098 the corresponding BLOCK_VARS and unexpanded variable lists
6099 associated with DEST_CFUN. */
6102 move_sese_region_to_fn (struct function *dest_cfun, basic_block entry_bb,
6103 basic_block exit_bb, tree orig_block)
6105 VEC(basic_block,heap) *bbs, *dom_bbs;
6106 basic_block dom_entry = get_immediate_dominator (CDI_DOMINATORS, entry_bb);
6107 basic_block after, bb, *entry_pred, *exit_succ, abb;
6108 struct function *saved_cfun = cfun;
6109 int *entry_flag, *exit_flag, eh_offset;
6110 unsigned *entry_prob, *exit_prob;
6111 unsigned i, num_entry_edges, num_exit_edges;
6114 htab_t new_label_map;
6115 struct pointer_map_t *vars_map;
6116 struct loop *loop = entry_bb->loop_father;
6117 struct move_stmt_d d;
6119 /* If ENTRY does not strictly dominate EXIT, this cannot be an SESE
6121 gcc_assert (entry_bb != exit_bb
6123 || dominated_by_p (CDI_DOMINATORS, exit_bb, entry_bb)));
6125 /* Collect all the blocks in the region. Manually add ENTRY_BB
6126 because it won't be added by dfs_enumerate_from. */
6128 VEC_safe_push (basic_block, heap, bbs, entry_bb);
6129 gather_blocks_in_sese_region (entry_bb, exit_bb, &bbs);
6131 /* The blocks that used to be dominated by something in BBS will now be
6132 dominated by the new block. */
6133 dom_bbs = get_dominated_by_region (CDI_DOMINATORS,
6134 VEC_address (basic_block, bbs),
6135 VEC_length (basic_block, bbs));
6137 /* Detach ENTRY_BB and EXIT_BB from CFUN->CFG. We need to remember
6138 the predecessor edges to ENTRY_BB and the successor edges to
6139 EXIT_BB so that we can re-attach them to the new basic block that
6140 will replace the region. */
6141 num_entry_edges = EDGE_COUNT (entry_bb->preds);
6142 entry_pred = (basic_block *) xcalloc (num_entry_edges, sizeof (basic_block));
6143 entry_flag = (int *) xcalloc (num_entry_edges, sizeof (int));
6144 entry_prob = XNEWVEC (unsigned, num_entry_edges);
6146 for (ei = ei_start (entry_bb->preds); (e = ei_safe_edge (ei)) != NULL;)
6148 entry_prob[i] = e->probability;
6149 entry_flag[i] = e->flags;
6150 entry_pred[i++] = e->src;
6156 num_exit_edges = EDGE_COUNT (exit_bb->succs);
6157 exit_succ = (basic_block *) xcalloc (num_exit_edges,
6158 sizeof (basic_block));
6159 exit_flag = (int *) xcalloc (num_exit_edges, sizeof (int));
6160 exit_prob = XNEWVEC (unsigned, num_exit_edges);
6162 for (ei = ei_start (exit_bb->succs); (e = ei_safe_edge (ei)) != NULL;)
6164 exit_prob[i] = e->probability;
6165 exit_flag[i] = e->flags;
6166 exit_succ[i++] = e->dest;
6178 /* Switch context to the child function to initialize DEST_FN's CFG. */
6179 gcc_assert (dest_cfun->cfg == NULL);
6180 push_cfun (dest_cfun);
6182 init_empty_tree_cfg ();
6184 /* Initialize EH information for the new function. */
6186 new_label_map = NULL;
6191 for (i = 0; VEC_iterate (basic_block, bbs, i, bb); i++)
6192 region = find_outermost_region_in_block (saved_cfun, bb, region);
6194 init_eh_for_function ();
6197 new_label_map = htab_create (17, tree_map_hash, tree_map_eq, free);
6198 eh_offset = duplicate_eh_regions (saved_cfun, new_label_mapper,
6199 new_label_map, region, 0);
6205 /* Move blocks from BBS into DEST_CFUN. */
6206 gcc_assert (VEC_length (basic_block, bbs) >= 2);
6207 after = dest_cfun->cfg->x_entry_block_ptr;
6208 vars_map = pointer_map_create ();
6210 memset (&d, 0, sizeof (d));
6211 d.vars_map = vars_map;
6212 d.from_context = cfun->decl;
6213 d.to_context = dest_cfun->decl;
6214 d.new_label_map = new_label_map;
6215 d.remap_decls_p = true;
6216 d.orig_block = orig_block;
6217 d.new_block = DECL_INITIAL (dest_cfun->decl);
6219 for (i = 0; VEC_iterate (basic_block, bbs, i, bb); i++)
6221 /* No need to update edge counts on the last block. It has
6222 already been updated earlier when we detached the region from
6223 the original CFG. */
6224 move_block_to_fn (dest_cfun, bb, after, bb != exit_bb, &d, eh_offset);
6228 /* Rewire BLOCK_SUBBLOCKS of orig_block. */
6232 gcc_assert (BLOCK_SUBBLOCKS (DECL_INITIAL (dest_cfun->decl))
6234 BLOCK_SUBBLOCKS (DECL_INITIAL (dest_cfun->decl))
6235 = BLOCK_SUBBLOCKS (orig_block);
6236 for (block = BLOCK_SUBBLOCKS (orig_block);
6237 block; block = BLOCK_CHAIN (block))
6238 BLOCK_SUPERCONTEXT (block) = DECL_INITIAL (dest_cfun->decl);
6239 BLOCK_SUBBLOCKS (orig_block) = NULL_TREE;
6242 replace_block_vars_by_duplicates (DECL_INITIAL (dest_cfun->decl),
6243 vars_map, dest_cfun->decl);
6246 htab_delete (new_label_map);
6247 pointer_map_destroy (vars_map);
6249 /* Rewire the entry and exit blocks. The successor to the entry
6250 block turns into the successor of DEST_FN's ENTRY_BLOCK_PTR in
6251 the child function. Similarly, the predecessor of DEST_FN's
6252 EXIT_BLOCK_PTR turns into the predecessor of EXIT_BLOCK_PTR. We
6253 need to switch CFUN between DEST_CFUN and SAVED_CFUN so that the
6254 various CFG manipulation function get to the right CFG.
6256 FIXME, this is silly. The CFG ought to become a parameter to
6258 push_cfun (dest_cfun);
6259 make_edge (ENTRY_BLOCK_PTR, entry_bb, EDGE_FALLTHRU);
6261 make_edge (exit_bb, EXIT_BLOCK_PTR, 0);
6264 /* Back in the original function, the SESE region has disappeared,
6265 create a new basic block in its place. */
6266 bb = create_empty_bb (entry_pred[0]);
6268 add_bb_to_loop (bb, loop);
6269 for (i = 0; i < num_entry_edges; i++)
6271 e = make_edge (entry_pred[i], bb, entry_flag[i]);
6272 e->probability = entry_prob[i];
6275 for (i = 0; i < num_exit_edges; i++)
6277 e = make_edge (bb, exit_succ[i], exit_flag[i]);
6278 e->probability = exit_prob[i];
6281 set_immediate_dominator (CDI_DOMINATORS, bb, dom_entry);
6282 for (i = 0; VEC_iterate (basic_block, dom_bbs, i, abb); i++)
6283 set_immediate_dominator (CDI_DOMINATORS, abb, bb);
6284 VEC_free (basic_block, heap, dom_bbs);
6295 VEC_free (basic_block, heap, bbs);
6301 /* Dump FUNCTION_DECL FN to file FILE using FLAGS (see TDF_* in tree-pass.h)
6305 dump_function_to_file (tree fn, FILE *file, int flags)
6307 tree arg, vars, var;
6308 struct function *dsf;
6309 bool ignore_topmost_bind = false, any_var = false;
6313 fprintf (file, "%s (", lang_hooks.decl_printable_name (fn, 2));
6315 arg = DECL_ARGUMENTS (fn);
6318 print_generic_expr (file, TREE_TYPE (arg), dump_flags);
6319 fprintf (file, " ");
6320 print_generic_expr (file, arg, dump_flags);
6321 if (flags & TDF_VERBOSE)
6322 print_node (file, "", arg, 4);
6323 if (TREE_CHAIN (arg))
6324 fprintf (file, ", ");
6325 arg = TREE_CHAIN (arg);
6327 fprintf (file, ")\n");
6329 if (flags & TDF_VERBOSE)
6330 print_node (file, "", fn, 2);
6332 dsf = DECL_STRUCT_FUNCTION (fn);
6333 if (dsf && (flags & TDF_DETAILS))
6334 dump_eh_tree (file, dsf);
6336 if (flags & TDF_RAW && !gimple_has_body_p (fn))
6338 dump_node (fn, TDF_SLIM | flags, file);
6342 /* Switch CFUN to point to FN. */
6343 push_cfun (DECL_STRUCT_FUNCTION (fn));
6345 /* When GIMPLE is lowered, the variables are no longer available in
6346 BIND_EXPRs, so display them separately. */
6347 if (cfun && cfun->decl == fn && cfun->local_decls)
6349 ignore_topmost_bind = true;
6351 fprintf (file, "{\n");
6352 for (vars = cfun->local_decls; vars; vars = TREE_CHAIN (vars))
6354 var = TREE_VALUE (vars);
6356 print_generic_decl (file, var, flags);
6357 if (flags & TDF_VERBOSE)
6358 print_node (file, "", var, 4);
6359 fprintf (file, "\n");
6365 if (cfun && cfun->decl == fn && cfun->cfg && basic_block_info)
6367 /* If the CFG has been built, emit a CFG-based dump. */
6368 check_bb_profile (ENTRY_BLOCK_PTR, file);
6369 if (!ignore_topmost_bind)
6370 fprintf (file, "{\n");
6372 if (any_var && n_basic_blocks)
6373 fprintf (file, "\n");
6376 gimple_dump_bb (bb, file, 2, flags);
6378 fprintf (file, "}\n");
6379 check_bb_profile (EXIT_BLOCK_PTR, file);
6381 else if (DECL_SAVED_TREE (fn) == NULL)
6383 /* The function is now in GIMPLE form but the CFG has not been
6384 built yet. Emit the single sequence of GIMPLE statements
6385 that make up its body. */
6386 gimple_seq body = gimple_body (fn);
6388 if (gimple_seq_first_stmt (body)
6389 && gimple_seq_first_stmt (body) == gimple_seq_last_stmt (body)
6390 && gimple_code (gimple_seq_first_stmt (body)) == GIMPLE_BIND)
6391 print_gimple_seq (file, body, 0, flags);
6394 if (!ignore_topmost_bind)
6395 fprintf (file, "{\n");
6398 fprintf (file, "\n");
6400 print_gimple_seq (file, body, 2, flags);
6401 fprintf (file, "}\n");
6408 /* Make a tree based dump. */
6409 chain = DECL_SAVED_TREE (fn);
6411 if (chain && TREE_CODE (chain) == BIND_EXPR)
6413 if (ignore_topmost_bind)
6415 chain = BIND_EXPR_BODY (chain);
6423 if (!ignore_topmost_bind)
6424 fprintf (file, "{\n");
6429 fprintf (file, "\n");
6431 print_generic_stmt_indented (file, chain, flags, indent);
6432 if (ignore_topmost_bind)
6433 fprintf (file, "}\n");
6436 fprintf (file, "\n\n");
6443 /* Dump FUNCTION_DECL FN to stderr using FLAGS (see TDF_* in tree.h) */
6446 debug_function (tree fn, int flags)
6448 dump_function_to_file (fn, stderr, flags);
6452 /* Print on FILE the indexes for the predecessors of basic_block BB. */
6455 print_pred_bbs (FILE *file, basic_block bb)
6460 FOR_EACH_EDGE (e, ei, bb->preds)
6461 fprintf (file, "bb_%d ", e->src->index);
6465 /* Print on FILE the indexes for the successors of basic_block BB. */
6468 print_succ_bbs (FILE *file, basic_block bb)
6473 FOR_EACH_EDGE (e, ei, bb->succs)
6474 fprintf (file, "bb_%d ", e->dest->index);
6477 /* Print to FILE the basic block BB following the VERBOSITY level. */
6480 print_loops_bb (FILE *file, basic_block bb, int indent, int verbosity)
6482 char *s_indent = (char *) alloca ((size_t) indent + 1);
6483 memset ((void *) s_indent, ' ', (size_t) indent);
6484 s_indent[indent] = '\0';
6486 /* Print basic_block's header. */
6489 fprintf (file, "%s bb_%d (preds = {", s_indent, bb->index);
6490 print_pred_bbs (file, bb);
6491 fprintf (file, "}, succs = {");
6492 print_succ_bbs (file, bb);
6493 fprintf (file, "})\n");
6496 /* Print basic_block's body. */
6499 fprintf (file, "%s {\n", s_indent);
6500 gimple_dump_bb (bb, file, indent + 4, TDF_VOPS|TDF_MEMSYMS);
6501 fprintf (file, "%s }\n", s_indent);
6505 static void print_loop_and_siblings (FILE *, struct loop *, int, int);
6507 /* Pretty print LOOP on FILE, indented INDENT spaces. Following
6508 VERBOSITY level this outputs the contents of the loop, or just its
6512 print_loop (FILE *file, struct loop *loop, int indent, int verbosity)
6520 s_indent = (char *) alloca ((size_t) indent + 1);
6521 memset ((void *) s_indent, ' ', (size_t) indent);
6522 s_indent[indent] = '\0';
6524 /* Print loop's header. */
6525 fprintf (file, "%sloop_%d (header = %d, latch = %d", s_indent,
6526 loop->num, loop->header->index, loop->latch->index);
6527 fprintf (file, ", niter = ");
6528 print_generic_expr (file, loop->nb_iterations, 0);
6530 if (loop->any_upper_bound)
6532 fprintf (file, ", upper_bound = ");
6533 dump_double_int (file, loop->nb_iterations_upper_bound, true);
6536 if (loop->any_estimate)
6538 fprintf (file, ", estimate = ");
6539 dump_double_int (file, loop->nb_iterations_estimate, true);
6541 fprintf (file, ")\n");
6543 /* Print loop's body. */
6546 fprintf (file, "%s{\n", s_indent);
6548 if (bb->loop_father == loop)
6549 print_loops_bb (file, bb, indent, verbosity);
6551 print_loop_and_siblings (file, loop->inner, indent + 2, verbosity);
6552 fprintf (file, "%s}\n", s_indent);
6556 /* Print the LOOP and its sibling loops on FILE, indented INDENT
6557 spaces. Following VERBOSITY level this outputs the contents of the
6558 loop, or just its structure. */
6561 print_loop_and_siblings (FILE *file, struct loop *loop, int indent, int verbosity)
6566 print_loop (file, loop, indent, verbosity);
6567 print_loop_and_siblings (file, loop->next, indent, verbosity);
6570 /* Follow a CFG edge from the entry point of the program, and on entry
6571 of a loop, pretty print the loop structure on FILE. */
6574 print_loops (FILE *file, int verbosity)
6578 bb = ENTRY_BLOCK_PTR;
6579 if (bb && bb->loop_father)
6580 print_loop_and_siblings (file, bb->loop_father, 0, verbosity);
6584 /* Debugging loops structure at tree level, at some VERBOSITY level. */
6587 debug_loops (int verbosity)
6589 print_loops (stderr, verbosity);
6592 /* Print on stderr the code of LOOP, at some VERBOSITY level. */
6595 debug_loop (struct loop *loop, int verbosity)
6597 print_loop (stderr, loop, 0, verbosity);
6600 /* Print on stderr the code of loop number NUM, at some VERBOSITY
6604 debug_loop_num (unsigned num, int verbosity)
6606 debug_loop (get_loop (num), verbosity);
6609 /* Return true if BB ends with a call, possibly followed by some
6610 instructions that must stay with the call. Return false,
6614 gimple_block_ends_with_call_p (basic_block bb)
6616 gimple_stmt_iterator gsi = gsi_last_bb (bb);
6617 return is_gimple_call (gsi_stmt (gsi));
6621 /* Return true if BB ends with a conditional branch. Return false,
6625 gimple_block_ends_with_condjump_p (const_basic_block bb)
6627 gimple stmt = last_stmt (CONST_CAST_BB (bb));
6628 return (stmt && gimple_code (stmt) == GIMPLE_COND);
6632 /* Return true if we need to add fake edge to exit at statement T.
6633 Helper function for gimple_flow_call_edges_add. */
6636 need_fake_edge_p (gimple t)
6638 tree fndecl = NULL_TREE;
6641 /* NORETURN and LONGJMP calls already have an edge to exit.
6642 CONST and PURE calls do not need one.
6643 We don't currently check for CONST and PURE here, although
6644 it would be a good idea, because those attributes are
6645 figured out from the RTL in mark_constant_function, and
6646 the counter incrementation code from -fprofile-arcs
6647 leads to different results from -fbranch-probabilities. */
6648 if (is_gimple_call (t))
6650 fndecl = gimple_call_fndecl (t);
6651 call_flags = gimple_call_flags (t);
6654 if (is_gimple_call (t)
6656 && DECL_BUILT_IN (fndecl)
6657 && (call_flags & ECF_NOTHROW)
6658 && !(call_flags & ECF_RETURNS_TWICE)
6659 /* fork() doesn't really return twice, but the effect of
6660 wrapping it in __gcov_fork() which calls __gcov_flush()
6661 and clears the counters before forking has the same
6662 effect as returning twice. Force a fake edge. */
6663 && !(DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_NORMAL
6664 && DECL_FUNCTION_CODE (fndecl) == BUILT_IN_FORK))
6667 if (is_gimple_call (t)
6668 && !(call_flags & ECF_NORETURN))
6671 if (gimple_code (t) == GIMPLE_ASM
6672 && (gimple_asm_volatile_p (t) || gimple_asm_input_p (t)))
6679 /* Add fake edges to the function exit for any non constant and non
6680 noreturn calls, volatile inline assembly in the bitmap of blocks
6681 specified by BLOCKS or to the whole CFG if BLOCKS is zero. Return
6682 the number of blocks that were split.
6684 The goal is to expose cases in which entering a basic block does
6685 not imply that all subsequent instructions must be executed. */
6688 gimple_flow_call_edges_add (sbitmap blocks)
6691 int blocks_split = 0;
6692 int last_bb = last_basic_block;
6693 bool check_last_block = false;
6695 if (n_basic_blocks == NUM_FIXED_BLOCKS)
6699 check_last_block = true;
6701 check_last_block = TEST_BIT (blocks, EXIT_BLOCK_PTR->prev_bb->index);
6703 /* In the last basic block, before epilogue generation, there will be
6704 a fallthru edge to EXIT. Special care is required if the last insn
6705 of the last basic block is a call because make_edge folds duplicate
6706 edges, which would result in the fallthru edge also being marked
6707 fake, which would result in the fallthru edge being removed by
6708 remove_fake_edges, which would result in an invalid CFG.
6710 Moreover, we can't elide the outgoing fake edge, since the block
6711 profiler needs to take this into account in order to solve the minimal
6712 spanning tree in the case that the call doesn't return.
6714 Handle this by adding a dummy instruction in a new last basic block. */
6715 if (check_last_block)
6717 basic_block bb = EXIT_BLOCK_PTR->prev_bb;
6718 gimple_stmt_iterator gsi = gsi_last_bb (bb);
6721 if (!gsi_end_p (gsi))
6724 if (t && need_fake_edge_p (t))
6728 e = find_edge (bb, EXIT_BLOCK_PTR);
6731 gsi_insert_on_edge (e, gimple_build_nop ());
6732 gsi_commit_edge_inserts ();
6737 /* Now add fake edges to the function exit for any non constant
6738 calls since there is no way that we can determine if they will
6740 for (i = 0; i < last_bb; i++)
6742 basic_block bb = BASIC_BLOCK (i);
6743 gimple_stmt_iterator gsi;
6744 gimple stmt, last_stmt;
6749 if (blocks && !TEST_BIT (blocks, i))
6752 gsi = gsi_last_bb (bb);
6753 if (!gsi_end_p (gsi))
6755 last_stmt = gsi_stmt (gsi);
6758 stmt = gsi_stmt (gsi);
6759 if (need_fake_edge_p (stmt))
6763 /* The handling above of the final block before the
6764 epilogue should be enough to verify that there is
6765 no edge to the exit block in CFG already.
6766 Calling make_edge in such case would cause us to
6767 mark that edge as fake and remove it later. */
6768 #ifdef ENABLE_CHECKING
6769 if (stmt == last_stmt)
6771 e = find_edge (bb, EXIT_BLOCK_PTR);
6772 gcc_assert (e == NULL);
6776 /* Note that the following may create a new basic block
6777 and renumber the existing basic blocks. */
6778 if (stmt != last_stmt)
6780 e = split_block (bb, stmt);
6784 make_edge (bb, EXIT_BLOCK_PTR, EDGE_FAKE);
6788 while (!gsi_end_p (gsi));
6793 verify_flow_info ();
6795 return blocks_split;
6798 /* Purge dead abnormal call edges from basic block BB. */
6801 gimple_purge_dead_abnormal_call_edges (basic_block bb)
6803 bool changed = gimple_purge_dead_eh_edges (bb);
6805 if (cfun->has_nonlocal_label)
6807 gimple stmt = last_stmt (bb);
6811 if (!(stmt && stmt_can_make_abnormal_goto (stmt)))
6812 for (ei = ei_start (bb->succs); (e = ei_safe_edge (ei)); )
6814 if (e->flags & EDGE_ABNORMAL)
6823 /* See gimple_purge_dead_eh_edges below. */
6825 free_dominance_info (CDI_DOMINATORS);
6831 /* Removes edge E and all the blocks dominated by it, and updates dominance
6832 information. The IL in E->src needs to be updated separately.
6833 If dominance info is not available, only the edge E is removed.*/
6836 remove_edge_and_dominated_blocks (edge e)
6838 VEC (basic_block, heap) *bbs_to_remove = NULL;
6839 VEC (basic_block, heap) *bbs_to_fix_dom = NULL;
6843 bool none_removed = false;
6845 basic_block bb, dbb;
6848 if (!dom_info_available_p (CDI_DOMINATORS))
6854 /* No updating is needed for edges to exit. */
6855 if (e->dest == EXIT_BLOCK_PTR)
6857 if (cfgcleanup_altered_bbs)
6858 bitmap_set_bit (cfgcleanup_altered_bbs, e->src->index);
6863 /* First, we find the basic blocks to remove. If E->dest has a predecessor
6864 that is not dominated by E->dest, then this set is empty. Otherwise,
6865 all the basic blocks dominated by E->dest are removed.
6867 Also, to DF_IDOM we store the immediate dominators of the blocks in
6868 the dominance frontier of E (i.e., of the successors of the
6869 removed blocks, if there are any, and of E->dest otherwise). */
6870 FOR_EACH_EDGE (f, ei, e->dest->preds)
6875 if (!dominated_by_p (CDI_DOMINATORS, f->src, e->dest))
6877 none_removed = true;
6882 df = BITMAP_ALLOC (NULL);
6883 df_idom = BITMAP_ALLOC (NULL);
6886 bitmap_set_bit (df_idom,
6887 get_immediate_dominator (CDI_DOMINATORS, e->dest)->index);
6890 bbs_to_remove = get_all_dominated_blocks (CDI_DOMINATORS, e->dest);
6891 for (i = 0; VEC_iterate (basic_block, bbs_to_remove, i, bb); i++)
6893 FOR_EACH_EDGE (f, ei, bb->succs)
6895 if (f->dest != EXIT_BLOCK_PTR)
6896 bitmap_set_bit (df, f->dest->index);
6899 for (i = 0; VEC_iterate (basic_block, bbs_to_remove, i, bb); i++)
6900 bitmap_clear_bit (df, bb->index);
6902 EXECUTE_IF_SET_IN_BITMAP (df, 0, i, bi)
6904 bb = BASIC_BLOCK (i);
6905 bitmap_set_bit (df_idom,
6906 get_immediate_dominator (CDI_DOMINATORS, bb)->index);
6910 if (cfgcleanup_altered_bbs)
6912 /* Record the set of the altered basic blocks. */
6913 bitmap_set_bit (cfgcleanup_altered_bbs, e->src->index);
6914 bitmap_ior_into (cfgcleanup_altered_bbs, df);
6917 /* Remove E and the cancelled blocks. */
6922 for (i = 0; VEC_iterate (basic_block, bbs_to_remove, i, bb); i++)
6923 delete_basic_block (bb);
6926 /* Update the dominance information. The immediate dominator may change only
6927 for blocks whose immediate dominator belongs to DF_IDOM:
6929 Suppose that idom(X) = Y before removal of E and idom(X) != Y after the
6930 removal. Let Z the arbitrary block such that idom(Z) = Y and
6931 Z dominates X after the removal. Before removal, there exists a path P
6932 from Y to X that avoids Z. Let F be the last edge on P that is
6933 removed, and let W = F->dest. Before removal, idom(W) = Y (since Y
6934 dominates W, and because of P, Z does not dominate W), and W belongs to
6935 the dominance frontier of E. Therefore, Y belongs to DF_IDOM. */
6936 EXECUTE_IF_SET_IN_BITMAP (df_idom, 0, i, bi)
6938 bb = BASIC_BLOCK (i);
6939 for (dbb = first_dom_son (CDI_DOMINATORS, bb);
6941 dbb = next_dom_son (CDI_DOMINATORS, dbb))
6942 VEC_safe_push (basic_block, heap, bbs_to_fix_dom, dbb);
6945 iterate_fix_dominators (CDI_DOMINATORS, bbs_to_fix_dom, true);
6948 BITMAP_FREE (df_idom);
6949 VEC_free (basic_block, heap, bbs_to_remove);
6950 VEC_free (basic_block, heap, bbs_to_fix_dom);
6953 /* Purge dead EH edges from basic block BB. */
6956 gimple_purge_dead_eh_edges (basic_block bb)
6958 bool changed = false;
6961 gimple stmt = last_stmt (bb);
6963 if (stmt && stmt_can_throw_internal (stmt))
6966 for (ei = ei_start (bb->succs); (e = ei_safe_edge (ei)); )
6968 if (e->flags & EDGE_EH)
6970 remove_edge_and_dominated_blocks (e);
6981 gimple_purge_all_dead_eh_edges (const_bitmap blocks)
6983 bool changed = false;
6987 EXECUTE_IF_SET_IN_BITMAP (blocks, 0, i, bi)
6989 basic_block bb = BASIC_BLOCK (i);
6991 /* Earlier gimple_purge_dead_eh_edges could have removed
6992 this basic block already. */
6993 gcc_assert (bb || changed);
6995 changed |= gimple_purge_dead_eh_edges (bb);
7001 /* This function is called whenever a new edge is created or
7005 gimple_execute_on_growing_pred (edge e)
7007 basic_block bb = e->dest;
7010 reserve_phi_args_for_new_edge (bb);
7013 /* This function is called immediately before edge E is removed from
7014 the edge vector E->dest->preds. */
7017 gimple_execute_on_shrinking_pred (edge e)
7019 if (phi_nodes (e->dest))
7020 remove_phi_args (e);
7023 /*---------------------------------------------------------------------------
7024 Helper functions for Loop versioning
7025 ---------------------------------------------------------------------------*/
7027 /* Adjust phi nodes for 'first' basic block. 'second' basic block is a copy
7028 of 'first'. Both of them are dominated by 'new_head' basic block. When
7029 'new_head' was created by 'second's incoming edge it received phi arguments
7030 on the edge by split_edge(). Later, additional edge 'e' was created to
7031 connect 'new_head' and 'first'. Now this routine adds phi args on this
7032 additional edge 'e' that new_head to second edge received as part of edge
7036 gimple_lv_adjust_loop_header_phi (basic_block first, basic_block second,
7037 basic_block new_head, edge e)
7040 gimple_stmt_iterator psi1, psi2;
7042 edge e2 = find_edge (new_head, second);
7044 /* Because NEW_HEAD has been created by splitting SECOND's incoming
7045 edge, we should always have an edge from NEW_HEAD to SECOND. */
7046 gcc_assert (e2 != NULL);
7048 /* Browse all 'second' basic block phi nodes and add phi args to
7049 edge 'e' for 'first' head. PHI args are always in correct order. */
7051 for (psi2 = gsi_start_phis (second),
7052 psi1 = gsi_start_phis (first);
7053 !gsi_end_p (psi2) && !gsi_end_p (psi1);
7054 gsi_next (&psi2), gsi_next (&psi1))
7056 phi1 = gsi_stmt (psi1);
7057 phi2 = gsi_stmt (psi2);
7058 def = PHI_ARG_DEF (phi2, e2->dest_idx);
7059 add_phi_arg (phi1, def, e);
7064 /* Adds a if else statement to COND_BB with condition COND_EXPR.
7065 SECOND_HEAD is the destination of the THEN and FIRST_HEAD is
7066 the destination of the ELSE part. */
7069 gimple_lv_add_condition_to_bb (basic_block first_head ATTRIBUTE_UNUSED,
7070 basic_block second_head ATTRIBUTE_UNUSED,
7071 basic_block cond_bb, void *cond_e)
7073 gimple_stmt_iterator gsi;
7074 gimple new_cond_expr;
7075 tree cond_expr = (tree) cond_e;
7078 /* Build new conditional expr */
7079 new_cond_expr = gimple_build_cond_from_tree (cond_expr,
7080 NULL_TREE, NULL_TREE);
7082 /* Add new cond in cond_bb. */
7083 gsi = gsi_last_bb (cond_bb);
7084 gsi_insert_after (&gsi, new_cond_expr, GSI_NEW_STMT);
7086 /* Adjust edges appropriately to connect new head with first head
7087 as well as second head. */
7088 e0 = single_succ_edge (cond_bb);
7089 e0->flags &= ~EDGE_FALLTHRU;
7090 e0->flags |= EDGE_FALSE_VALUE;
7093 struct cfg_hooks gimple_cfg_hooks = {
7095 gimple_verify_flow_info,
7096 gimple_dump_bb, /* dump_bb */
7097 create_bb, /* create_basic_block */
7098 gimple_redirect_edge_and_branch, /* redirect_edge_and_branch */
7099 gimple_redirect_edge_and_branch_force, /* redirect_edge_and_branch_force */
7100 gimple_can_remove_branch_p, /* can_remove_branch_p */
7101 remove_bb, /* delete_basic_block */
7102 gimple_split_block, /* split_block */
7103 gimple_move_block_after, /* move_block_after */
7104 gimple_can_merge_blocks_p, /* can_merge_blocks_p */
7105 gimple_merge_blocks, /* merge_blocks */
7106 gimple_predict_edge, /* predict_edge */
7107 gimple_predicted_by_p, /* predicted_by_p */
7108 gimple_can_duplicate_bb_p, /* can_duplicate_block_p */
7109 gimple_duplicate_bb, /* duplicate_block */
7110 gimple_split_edge, /* split_edge */
7111 gimple_make_forwarder_block, /* make_forward_block */
7112 NULL, /* tidy_fallthru_edge */
7113 gimple_block_ends_with_call_p,/* block_ends_with_call_p */
7114 gimple_block_ends_with_condjump_p, /* block_ends_with_condjump_p */
7115 gimple_flow_call_edges_add, /* flow_call_edges_add */
7116 gimple_execute_on_growing_pred, /* execute_on_growing_pred */
7117 gimple_execute_on_shrinking_pred, /* execute_on_shrinking_pred */
7118 gimple_duplicate_loop_to_header_edge, /* duplicate loop for trees */
7119 gimple_lv_add_condition_to_bb, /* lv_add_condition_to_bb */
7120 gimple_lv_adjust_loop_header_phi, /* lv_adjust_loop_header_phi*/
7121 extract_true_false_edges_from_block, /* extract_cond_bb_edges */
7122 flush_pending_stmts /* flush_pending_stmts */
7126 /* Split all critical edges. */
7129 split_critical_edges (void)
7135 /* split_edge can redirect edges out of SWITCH_EXPRs, which can get
7136 expensive. So we want to enable recording of edge to CASE_LABEL_EXPR
7137 mappings around the calls to split_edge. */
7138 start_recording_case_labels ();
7141 FOR_EACH_EDGE (e, ei, bb->succs)
7143 if (EDGE_CRITICAL_P (e) && !(e->flags & EDGE_ABNORMAL))
7145 /* PRE inserts statements to edges and expects that
7146 since split_critical_edges was done beforehand, committing edge
7147 insertions will not split more edges. In addition to critical
7148 edges we must split edges that have multiple successors and
7149 end by control flow statements, such as RESX.
7150 Go ahead and split them too. This matches the logic in
7151 gimple_find_edge_insert_loc. */
7152 else if ((!single_pred_p (e->dest)
7153 || phi_nodes (e->dest)
7154 || e->dest == EXIT_BLOCK_PTR)
7155 && e->src != ENTRY_BLOCK_PTR
7156 && !(e->flags & EDGE_ABNORMAL))
7158 gimple_stmt_iterator gsi;
7160 gsi = gsi_last_bb (e->src);
7161 if (!gsi_end_p (gsi)
7162 && stmt_ends_bb_p (gsi_stmt (gsi))
7163 && gimple_code (gsi_stmt (gsi)) != GIMPLE_RETURN)
7168 end_recording_case_labels ();
7172 struct gimple_opt_pass pass_split_crit_edges =
7176 "crited", /* name */
7178 split_critical_edges, /* execute */
7181 0, /* static_pass_number */
7182 TV_TREE_SPLIT_EDGES, /* tv_id */
7183 PROP_cfg, /* properties required */
7184 PROP_no_crit_edges, /* properties_provided */
7185 0, /* properties_destroyed */
7186 0, /* todo_flags_start */
7187 TODO_dump_func | TODO_verify_flow /* todo_flags_finish */
7192 /* Build a ternary operation and gimplify it. Emit code before GSI.
7193 Return the gimple_val holding the result. */
7196 gimplify_build3 (gimple_stmt_iterator *gsi, enum tree_code code,
7197 tree type, tree a, tree b, tree c)
7200 location_t loc = gimple_location (gsi_stmt (*gsi));
7202 ret = fold_build3_loc (loc, code, type, a, b, c);
7205 return force_gimple_operand_gsi (gsi, ret, true, NULL, true,
7209 /* Build a binary operation and gimplify it. Emit code before GSI.
7210 Return the gimple_val holding the result. */
7213 gimplify_build2 (gimple_stmt_iterator *gsi, enum tree_code code,
7214 tree type, tree a, tree b)
7218 ret = fold_build2_loc (gimple_location (gsi_stmt (*gsi)), code, type, a, b);
7221 return force_gimple_operand_gsi (gsi, ret, true, NULL, true,
7225 /* Build a unary operation and gimplify it. Emit code before GSI.
7226 Return the gimple_val holding the result. */
7229 gimplify_build1 (gimple_stmt_iterator *gsi, enum tree_code code, tree type,
7234 ret = fold_build1_loc (gimple_location (gsi_stmt (*gsi)), code, type, a);
7237 return force_gimple_operand_gsi (gsi, ret, true, NULL, true,
7243 /* Emit return warnings. */
7246 execute_warn_function_return (void)
7248 source_location location;
7253 /* If we have a path to EXIT, then we do return. */
7254 if (TREE_THIS_VOLATILE (cfun->decl)
7255 && EDGE_COUNT (EXIT_BLOCK_PTR->preds) > 0)
7257 location = UNKNOWN_LOCATION;
7258 FOR_EACH_EDGE (e, ei, EXIT_BLOCK_PTR->preds)
7260 last = last_stmt (e->src);
7261 if (gimple_code (last) == GIMPLE_RETURN
7262 && (location = gimple_location (last)) != UNKNOWN_LOCATION)
7265 if (location == UNKNOWN_LOCATION)
7266 location = cfun->function_end_locus;
7267 warning_at (location, 0, "%<noreturn%> function does return");
7270 /* If we see "return;" in some basic block, then we do reach the end
7271 without returning a value. */
7272 else if (warn_return_type
7273 && !TREE_NO_WARNING (cfun->decl)
7274 && EDGE_COUNT (EXIT_BLOCK_PTR->preds) > 0
7275 && !VOID_TYPE_P (TREE_TYPE (TREE_TYPE (cfun->decl))))
7277 FOR_EACH_EDGE (e, ei, EXIT_BLOCK_PTR->preds)
7279 gimple last = last_stmt (e->src);
7280 if (gimple_code (last) == GIMPLE_RETURN
7281 && gimple_return_retval (last) == NULL
7282 && !gimple_no_warning_p (last))
7284 location = gimple_location (last);
7285 if (location == UNKNOWN_LOCATION)
7286 location = cfun->function_end_locus;
7287 warning_at (location, OPT_Wreturn_type, "control reaches end of non-void function");
7288 TREE_NO_WARNING (cfun->decl) = 1;
7297 /* Given a basic block B which ends with a conditional and has
7298 precisely two successors, determine which of the edges is taken if
7299 the conditional is true and which is taken if the conditional is
7300 false. Set TRUE_EDGE and FALSE_EDGE appropriately. */
7303 extract_true_false_edges_from_block (basic_block b,
7307 edge e = EDGE_SUCC (b, 0);
7309 if (e->flags & EDGE_TRUE_VALUE)
7312 *false_edge = EDGE_SUCC (b, 1);
7317 *true_edge = EDGE_SUCC (b, 1);
7321 struct gimple_opt_pass pass_warn_function_return =
7327 execute_warn_function_return, /* execute */
7330 0, /* static_pass_number */
7331 TV_NONE, /* tv_id */
7332 PROP_cfg, /* properties_required */
7333 0, /* properties_provided */
7334 0, /* properties_destroyed */
7335 0, /* todo_flags_start */
7336 0 /* todo_flags_finish */
7340 /* Emit noreturn warnings. */
7343 execute_warn_function_noreturn (void)
7345 if (warn_missing_noreturn
7346 && !TREE_THIS_VOLATILE (cfun->decl)
7347 && EDGE_COUNT (EXIT_BLOCK_PTR->preds) == 0
7348 && !lang_hooks.missing_noreturn_ok_p (cfun->decl))
7349 warning_at (DECL_SOURCE_LOCATION (cfun->decl), OPT_Wmissing_noreturn,
7350 "function might be possible candidate "
7351 "for attribute %<noreturn%>");
7355 struct gimple_opt_pass pass_warn_function_noreturn =
7361 execute_warn_function_noreturn, /* execute */
7364 0, /* static_pass_number */
7365 TV_NONE, /* tv_id */
7366 PROP_cfg, /* properties_required */
7367 0, /* properties_provided */
7368 0, /* properties_destroyed */
7369 0, /* todo_flags_start */
7370 0 /* todo_flags_finish */