1 /* Control flow functions for trees.
2 Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009,
3 2010, 2011 Free Software Foundation, Inc.
4 Contributed by Diego Novillo <dnovillo@redhat.com>
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 3, or (at your option)
13 GCC is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
24 #include "coretypes.h"
28 #include "basic-block.h"
33 #include "langhooks.h"
34 #include "tree-pretty-print.h"
35 #include "gimple-pretty-print.h"
36 #include "tree-flow.h"
38 #include "tree-dump.h"
39 #include "tree-pass.h"
40 #include "diagnostic-core.h"
43 #include "cfglayout.h"
44 #include "tree-ssa-propagate.h"
45 #include "value-prof.h"
46 #include "pointer-set.h"
47 #include "tree-inline.h"
49 /* This file contains functions for building the Control Flow Graph (CFG)
50 for a function tree. */
52 /* Local declarations. */
54 /* Initial capacity for the basic block array. */
55 static const int initial_cfg_capacity = 20;
57 /* This hash table allows us to efficiently lookup all CASE_LABEL_EXPRs
58 which use a particular edge. The CASE_LABEL_EXPRs are chained together
59 via their TREE_CHAIN field, which we clear after we're done with the
60 hash table to prevent problems with duplication of GIMPLE_SWITCHes.
62 Access to this list of CASE_LABEL_EXPRs allows us to efficiently
63 update the case vector in response to edge redirections.
65 Right now this table is set up and torn down at key points in the
66 compilation process. It would be nice if we could make the table
67 more persistent. The key is getting notification of changes to
68 the CFG (particularly edge removal, creation and redirection). */
70 static struct pointer_map_t *edge_to_cases;
72 /* If we record edge_to_cases, this bitmap will hold indexes
73 of basic blocks that end in a GIMPLE_SWITCH which we touched
74 due to edge manipulations. */
76 static bitmap touched_switch_bbs;
81 long num_merged_labels;
84 static struct cfg_stats_d cfg_stats;
86 /* Nonzero if we found a computed goto while building basic blocks. */
87 static bool found_computed_goto;
89 /* Hash table to store last discriminator assigned for each locus. */
90 struct locus_discrim_map
95 static htab_t discriminator_per_locus;
97 /* Basic blocks and flowgraphs. */
98 static void make_blocks (gimple_seq);
99 static void factor_computed_gotos (void);
102 static void make_edges (void);
103 static void make_cond_expr_edges (basic_block);
104 static void make_gimple_switch_edges (basic_block);
105 static void make_goto_expr_edges (basic_block);
106 static void make_gimple_asm_edges (basic_block);
107 static unsigned int locus_map_hash (const void *);
108 static int locus_map_eq (const void *, const void *);
109 static void assign_discriminator (location_t, basic_block);
110 static edge gimple_redirect_edge_and_branch (edge, basic_block);
111 static edge gimple_try_redirect_by_replacing_jump (edge, basic_block);
112 static unsigned int split_critical_edges (void);
114 /* Various helpers. */
115 static inline bool stmt_starts_bb_p (gimple, gimple);
116 static int gimple_verify_flow_info (void);
117 static void gimple_make_forwarder_block (edge);
118 static void gimple_cfg2vcg (FILE *);
119 static gimple first_non_label_stmt (basic_block);
121 /* Flowgraph optimization and cleanup. */
122 static void gimple_merge_blocks (basic_block, basic_block);
123 static bool gimple_can_merge_blocks_p (basic_block, basic_block);
124 static void remove_bb (basic_block);
125 static edge find_taken_edge_computed_goto (basic_block, tree);
126 static edge find_taken_edge_cond_expr (basic_block, tree);
127 static edge find_taken_edge_switch_expr (basic_block, tree);
128 static tree find_case_label_for_value (gimple, tree);
129 static void group_case_labels_stmt (gimple);
132 init_empty_tree_cfg_for_function (struct function *fn)
134 /* Initialize the basic block array. */
136 profile_status_for_function (fn) = PROFILE_ABSENT;
137 n_basic_blocks_for_function (fn) = NUM_FIXED_BLOCKS;
138 last_basic_block_for_function (fn) = NUM_FIXED_BLOCKS;
139 basic_block_info_for_function (fn)
140 = VEC_alloc (basic_block, gc, initial_cfg_capacity);
141 VEC_safe_grow_cleared (basic_block, gc,
142 basic_block_info_for_function (fn),
143 initial_cfg_capacity);
145 /* Build a mapping of labels to their associated blocks. */
146 label_to_block_map_for_function (fn)
147 = VEC_alloc (basic_block, gc, initial_cfg_capacity);
148 VEC_safe_grow_cleared (basic_block, gc,
149 label_to_block_map_for_function (fn),
150 initial_cfg_capacity);
152 SET_BASIC_BLOCK_FOR_FUNCTION (fn, ENTRY_BLOCK,
153 ENTRY_BLOCK_PTR_FOR_FUNCTION (fn));
154 SET_BASIC_BLOCK_FOR_FUNCTION (fn, EXIT_BLOCK,
155 EXIT_BLOCK_PTR_FOR_FUNCTION (fn));
157 ENTRY_BLOCK_PTR_FOR_FUNCTION (fn)->next_bb
158 = EXIT_BLOCK_PTR_FOR_FUNCTION (fn);
159 EXIT_BLOCK_PTR_FOR_FUNCTION (fn)->prev_bb
160 = ENTRY_BLOCK_PTR_FOR_FUNCTION (fn);
164 init_empty_tree_cfg (void)
166 init_empty_tree_cfg_for_function (cfun);
169 /*---------------------------------------------------------------------------
171 ---------------------------------------------------------------------------*/
173 /* Entry point to the CFG builder for trees. SEQ is the sequence of
174 statements to be added to the flowgraph. */
177 build_gimple_cfg (gimple_seq seq)
179 /* Register specific gimple functions. */
180 gimple_register_cfg_hooks ();
182 memset ((void *) &cfg_stats, 0, sizeof (cfg_stats));
184 init_empty_tree_cfg ();
186 found_computed_goto = 0;
189 /* Computed gotos are hell to deal with, especially if there are
190 lots of them with a large number of destinations. So we factor
191 them to a common computed goto location before we build the
192 edge list. After we convert back to normal form, we will un-factor
193 the computed gotos since factoring introduces an unwanted jump. */
194 if (found_computed_goto)
195 factor_computed_gotos ();
197 /* Make sure there is always at least one block, even if it's empty. */
198 if (n_basic_blocks == NUM_FIXED_BLOCKS)
199 create_empty_bb (ENTRY_BLOCK_PTR);
201 /* Adjust the size of the array. */
202 if (VEC_length (basic_block, basic_block_info) < (size_t) n_basic_blocks)
203 VEC_safe_grow_cleared (basic_block, gc, basic_block_info, n_basic_blocks);
205 /* To speed up statement iterator walks, we first purge dead labels. */
206 cleanup_dead_labels ();
208 /* Group case nodes to reduce the number of edges.
209 We do this after cleaning up dead labels because otherwise we miss
210 a lot of obvious case merging opportunities. */
211 group_case_labels ();
213 /* Create the edges of the flowgraph. */
214 discriminator_per_locus = htab_create (13, locus_map_hash, locus_map_eq,
217 cleanup_dead_labels ();
218 htab_delete (discriminator_per_locus);
220 /* Debugging dumps. */
222 /* Write the flowgraph to a VCG file. */
224 int local_dump_flags;
225 FILE *vcg_file = dump_begin (TDI_vcg, &local_dump_flags);
228 gimple_cfg2vcg (vcg_file);
229 dump_end (TDI_vcg, vcg_file);
235 execute_build_cfg (void)
237 gimple_seq body = gimple_body (current_function_decl);
239 build_gimple_cfg (body);
240 gimple_set_body (current_function_decl, NULL);
241 if (dump_file && (dump_flags & TDF_DETAILS))
243 fprintf (dump_file, "Scope blocks:\n");
244 dump_scope_blocks (dump_file, dump_flags);
249 struct gimple_opt_pass pass_build_cfg =
255 execute_build_cfg, /* execute */
258 0, /* static_pass_number */
259 TV_TREE_CFG, /* tv_id */
260 PROP_gimple_leh, /* properties_required */
261 PROP_cfg, /* properties_provided */
262 0, /* properties_destroyed */
263 0, /* todo_flags_start */
264 TODO_verify_stmts | TODO_cleanup_cfg /* todo_flags_finish */
269 /* Return true if T is a computed goto. */
272 computed_goto_p (gimple t)
274 return (gimple_code (t) == GIMPLE_GOTO
275 && TREE_CODE (gimple_goto_dest (t)) != LABEL_DECL);
279 /* Search the CFG for any computed gotos. If found, factor them to a
280 common computed goto site. Also record the location of that site so
281 that we can un-factor the gotos after we have converted back to
285 factor_computed_gotos (void)
288 tree factored_label_decl = NULL;
290 gimple factored_computed_goto_label = NULL;
291 gimple factored_computed_goto = NULL;
293 /* We know there are one or more computed gotos in this function.
294 Examine the last statement in each basic block to see if the block
295 ends with a computed goto. */
299 gimple_stmt_iterator gsi = gsi_last_bb (bb);
305 last = gsi_stmt (gsi);
307 /* Ignore the computed goto we create when we factor the original
309 if (last == factored_computed_goto)
312 /* If the last statement is a computed goto, factor it. */
313 if (computed_goto_p (last))
317 /* The first time we find a computed goto we need to create
318 the factored goto block and the variable each original
319 computed goto will use for their goto destination. */
320 if (!factored_computed_goto)
322 basic_block new_bb = create_empty_bb (bb);
323 gimple_stmt_iterator new_gsi = gsi_start_bb (new_bb);
325 /* Create the destination of the factored goto. Each original
326 computed goto will put its desired destination into this
327 variable and jump to the label we create immediately
329 var = create_tmp_var (ptr_type_node, "gotovar");
331 /* Build a label for the new block which will contain the
332 factored computed goto. */
333 factored_label_decl = create_artificial_label (UNKNOWN_LOCATION);
334 factored_computed_goto_label
335 = gimple_build_label (factored_label_decl);
336 gsi_insert_after (&new_gsi, factored_computed_goto_label,
339 /* Build our new computed goto. */
340 factored_computed_goto = gimple_build_goto (var);
341 gsi_insert_after (&new_gsi, factored_computed_goto, GSI_NEW_STMT);
344 /* Copy the original computed goto's destination into VAR. */
345 assignment = gimple_build_assign (var, gimple_goto_dest (last));
346 gsi_insert_before (&gsi, assignment, GSI_SAME_STMT);
348 /* And re-vector the computed goto to the new destination. */
349 gimple_goto_set_dest (last, factored_label_decl);
355 /* Build a flowgraph for the sequence of stmts SEQ. */
358 make_blocks (gimple_seq seq)
360 gimple_stmt_iterator i = gsi_start (seq);
362 bool start_new_block = true;
363 bool first_stmt_of_seq = true;
364 basic_block bb = ENTRY_BLOCK_PTR;
366 while (!gsi_end_p (i))
373 /* If the statement starts a new basic block or if we have determined
374 in a previous pass that we need to create a new block for STMT, do
376 if (start_new_block || stmt_starts_bb_p (stmt, prev_stmt))
378 if (!first_stmt_of_seq)
379 seq = gsi_split_seq_before (&i);
380 bb = create_basic_block (seq, NULL, bb);
381 start_new_block = false;
384 /* Now add STMT to BB and create the subgraphs for special statement
386 gimple_set_bb (stmt, bb);
388 if (computed_goto_p (stmt))
389 found_computed_goto = true;
391 /* If STMT is a basic block terminator, set START_NEW_BLOCK for the
393 if (stmt_ends_bb_p (stmt))
395 /* If the stmt can make abnormal goto use a new temporary
396 for the assignment to the LHS. This makes sure the old value
397 of the LHS is available on the abnormal edge. Otherwise
398 we will end up with overlapping life-ranges for abnormal
400 if (gimple_has_lhs (stmt)
401 && stmt_can_make_abnormal_goto (stmt)
402 && is_gimple_reg_type (TREE_TYPE (gimple_get_lhs (stmt))))
404 tree lhs = gimple_get_lhs (stmt);
405 tree tmp = create_tmp_var (TREE_TYPE (lhs), NULL);
406 gimple s = gimple_build_assign (lhs, tmp);
407 gimple_set_location (s, gimple_location (stmt));
408 gimple_set_block (s, gimple_block (stmt));
409 gimple_set_lhs (stmt, tmp);
410 if (TREE_CODE (TREE_TYPE (tmp)) == COMPLEX_TYPE
411 || TREE_CODE (TREE_TYPE (tmp)) == VECTOR_TYPE)
412 DECL_GIMPLE_REG_P (tmp) = 1;
413 gsi_insert_after (&i, s, GSI_SAME_STMT);
415 start_new_block = true;
419 first_stmt_of_seq = false;
424 /* Create and return a new empty basic block after bb AFTER. */
427 create_bb (void *h, void *e, basic_block after)
433 /* Create and initialize a new basic block. Since alloc_block uses
434 GC allocation that clears memory to allocate a basic block, we do
435 not have to clear the newly allocated basic block here. */
438 bb->index = last_basic_block;
440 bb->il.gimple = ggc_alloc_cleared_gimple_bb_info ();
441 set_bb_seq (bb, h ? (gimple_seq) h : gimple_seq_alloc ());
443 /* Add the new block to the linked list of blocks. */
444 link_block (bb, after);
446 /* Grow the basic block array if needed. */
447 if ((size_t) last_basic_block == VEC_length (basic_block, basic_block_info))
449 size_t new_size = last_basic_block + (last_basic_block + 3) / 4;
450 VEC_safe_grow_cleared (basic_block, gc, basic_block_info, new_size);
453 /* Add the newly created block to the array. */
454 SET_BASIC_BLOCK (last_basic_block, bb);
463 /*---------------------------------------------------------------------------
465 ---------------------------------------------------------------------------*/
467 /* Fold COND_EXPR_COND of each COND_EXPR. */
470 fold_cond_expr_cond (void)
476 gimple stmt = last_stmt (bb);
478 if (stmt && gimple_code (stmt) == GIMPLE_COND)
480 location_t loc = gimple_location (stmt);
484 fold_defer_overflow_warnings ();
485 cond = fold_binary_loc (loc, gimple_cond_code (stmt), boolean_type_node,
486 gimple_cond_lhs (stmt), gimple_cond_rhs (stmt));
489 zerop = integer_zerop (cond);
490 onep = integer_onep (cond);
493 zerop = onep = false;
495 fold_undefer_overflow_warnings (zerop || onep,
497 WARN_STRICT_OVERFLOW_CONDITIONAL);
499 gimple_cond_make_false (stmt);
501 gimple_cond_make_true (stmt);
506 /* Join all the blocks in the flowgraph. */
512 struct omp_region *cur_region = NULL;
514 /* Create an edge from entry to the first block with executable
516 make_edge (ENTRY_BLOCK_PTR, BASIC_BLOCK (NUM_FIXED_BLOCKS), EDGE_FALLTHRU);
518 /* Traverse the basic block array placing edges. */
521 gimple last = last_stmt (bb);
526 enum gimple_code code = gimple_code (last);
530 make_goto_expr_edges (bb);
534 make_edge (bb, EXIT_BLOCK_PTR, 0);
538 make_cond_expr_edges (bb);
542 make_gimple_switch_edges (bb);
546 make_eh_edges (last);
549 case GIMPLE_EH_DISPATCH:
550 fallthru = make_eh_dispatch_edges (last);
554 /* If this function receives a nonlocal goto, then we need to
555 make edges from this call site to all the nonlocal goto
557 if (stmt_can_make_abnormal_goto (last))
558 make_abnormal_goto_edges (bb, true);
560 /* If this statement has reachable exception handlers, then
561 create abnormal edges to them. */
562 make_eh_edges (last);
564 /* BUILTIN_RETURN is really a return statement. */
565 if (gimple_call_builtin_p (last, BUILT_IN_RETURN))
566 make_edge (bb, EXIT_BLOCK_PTR, 0), fallthru = false;
567 /* Some calls are known not to return. */
569 fallthru = !(gimple_call_flags (last) & ECF_NORETURN);
573 /* A GIMPLE_ASSIGN may throw internally and thus be considered
575 if (is_ctrl_altering_stmt (last))
576 make_eh_edges (last);
581 make_gimple_asm_edges (bb);
585 case GIMPLE_OMP_PARALLEL:
586 case GIMPLE_OMP_TASK:
588 case GIMPLE_OMP_SINGLE:
589 case GIMPLE_OMP_MASTER:
590 case GIMPLE_OMP_ORDERED:
591 case GIMPLE_OMP_CRITICAL:
592 case GIMPLE_OMP_SECTION:
593 cur_region = new_omp_region (bb, code, cur_region);
597 case GIMPLE_OMP_SECTIONS:
598 cur_region = new_omp_region (bb, code, cur_region);
602 case GIMPLE_OMP_SECTIONS_SWITCH:
606 case GIMPLE_OMP_ATOMIC_LOAD:
607 case GIMPLE_OMP_ATOMIC_STORE:
611 case GIMPLE_OMP_RETURN:
612 /* In the case of a GIMPLE_OMP_SECTION, the edge will go
613 somewhere other than the next block. This will be
615 cur_region->exit = bb;
616 fallthru = cur_region->type != GIMPLE_OMP_SECTION;
617 cur_region = cur_region->outer;
620 case GIMPLE_OMP_CONTINUE:
621 cur_region->cont = bb;
622 switch (cur_region->type)
625 /* Mark all GIMPLE_OMP_FOR and GIMPLE_OMP_CONTINUE
626 succs edges as abnormal to prevent splitting
628 single_succ_edge (cur_region->entry)->flags |= EDGE_ABNORMAL;
629 /* Make the loopback edge. */
630 make_edge (bb, single_succ (cur_region->entry),
633 /* Create an edge from GIMPLE_OMP_FOR to exit, which
634 corresponds to the case that the body of the loop
635 is not executed at all. */
636 make_edge (cur_region->entry, bb->next_bb, EDGE_ABNORMAL);
637 make_edge (bb, bb->next_bb, EDGE_FALLTHRU | EDGE_ABNORMAL);
641 case GIMPLE_OMP_SECTIONS:
642 /* Wire up the edges into and out of the nested sections. */
644 basic_block switch_bb = single_succ (cur_region->entry);
646 struct omp_region *i;
647 for (i = cur_region->inner; i ; i = i->next)
649 gcc_assert (i->type == GIMPLE_OMP_SECTION);
650 make_edge (switch_bb, i->entry, 0);
651 make_edge (i->exit, bb, EDGE_FALLTHRU);
654 /* Make the loopback edge to the block with
655 GIMPLE_OMP_SECTIONS_SWITCH. */
656 make_edge (bb, switch_bb, 0);
658 /* Make the edge from the switch to exit. */
659 make_edge (switch_bb, bb->next_bb, 0);
670 gcc_assert (!stmt_ends_bb_p (last));
679 make_edge (bb, bb->next_bb, EDGE_FALLTHRU);
681 assign_discriminator (gimple_location (last), bb->next_bb);
688 /* Fold COND_EXPR_COND of each COND_EXPR. */
689 fold_cond_expr_cond ();
692 /* Trivial hash function for a location_t. ITEM is a pointer to
693 a hash table entry that maps a location_t to a discriminator. */
696 locus_map_hash (const void *item)
698 return ((const struct locus_discrim_map *) item)->locus;
701 /* Equality function for the locus-to-discriminator map. VA and VB
702 point to the two hash table entries to compare. */
705 locus_map_eq (const void *va, const void *vb)
707 const struct locus_discrim_map *a = (const struct locus_discrim_map *) va;
708 const struct locus_discrim_map *b = (const struct locus_discrim_map *) vb;
709 return a->locus == b->locus;
712 /* Find the next available discriminator value for LOCUS. The
713 discriminator distinguishes among several basic blocks that
714 share a common locus, allowing for more accurate sample-based
718 next_discriminator_for_locus (location_t locus)
720 struct locus_discrim_map item;
721 struct locus_discrim_map **slot;
724 item.discriminator = 0;
725 slot = (struct locus_discrim_map **)
726 htab_find_slot_with_hash (discriminator_per_locus, (void *) &item,
727 (hashval_t) locus, INSERT);
729 if (*slot == HTAB_EMPTY_ENTRY)
731 *slot = XNEW (struct locus_discrim_map);
733 (*slot)->locus = locus;
734 (*slot)->discriminator = 0;
736 (*slot)->discriminator++;
737 return (*slot)->discriminator;
740 /* Return TRUE if LOCUS1 and LOCUS2 refer to the same source line. */
743 same_line_p (location_t locus1, location_t locus2)
745 expanded_location from, to;
747 if (locus1 == locus2)
750 from = expand_location (locus1);
751 to = expand_location (locus2);
753 if (from.line != to.line)
755 if (from.file == to.file)
757 return (from.file != NULL
759 && filename_cmp (from.file, to.file) == 0);
762 /* Assign a unique discriminator value to block BB if it begins at the same
763 LOCUS as its predecessor block. */
766 assign_discriminator (location_t locus, basic_block bb)
768 gimple first_in_to_bb, last_in_to_bb;
770 if (locus == 0 || bb->discriminator != 0)
773 first_in_to_bb = first_non_label_stmt (bb);
774 last_in_to_bb = last_stmt (bb);
775 if ((first_in_to_bb && same_line_p (locus, gimple_location (first_in_to_bb)))
776 || (last_in_to_bb && same_line_p (locus, gimple_location (last_in_to_bb))))
777 bb->discriminator = next_discriminator_for_locus (locus);
780 /* Create the edges for a GIMPLE_COND starting at block BB. */
783 make_cond_expr_edges (basic_block bb)
785 gimple entry = last_stmt (bb);
786 gimple then_stmt, else_stmt;
787 basic_block then_bb, else_bb;
788 tree then_label, else_label;
790 location_t entry_locus;
793 gcc_assert (gimple_code (entry) == GIMPLE_COND);
795 entry_locus = gimple_location (entry);
797 /* Entry basic blocks for each component. */
798 then_label = gimple_cond_true_label (entry);
799 else_label = gimple_cond_false_label (entry);
800 then_bb = label_to_block (then_label);
801 else_bb = label_to_block (else_label);
802 then_stmt = first_stmt (then_bb);
803 else_stmt = first_stmt (else_bb);
805 e = make_edge (bb, then_bb, EDGE_TRUE_VALUE);
806 assign_discriminator (entry_locus, then_bb);
807 e->goto_locus = gimple_location (then_stmt);
809 e->goto_block = gimple_block (then_stmt);
810 e = make_edge (bb, else_bb, EDGE_FALSE_VALUE);
813 assign_discriminator (entry_locus, else_bb);
814 e->goto_locus = gimple_location (else_stmt);
816 e->goto_block = gimple_block (else_stmt);
819 /* We do not need the labels anymore. */
820 gimple_cond_set_true_label (entry, NULL_TREE);
821 gimple_cond_set_false_label (entry, NULL_TREE);
825 /* Called for each element in the hash table (P) as we delete the
826 edge to cases hash table.
828 Clear all the TREE_CHAINs to prevent problems with copying of
829 SWITCH_EXPRs and structure sharing rules, then free the hash table
833 edge_to_cases_cleanup (const void *key ATTRIBUTE_UNUSED, void **value,
834 void *data ATTRIBUTE_UNUSED)
838 for (t = (tree) *value; t; t = next)
840 next = CASE_CHAIN (t);
841 CASE_CHAIN (t) = NULL;
848 /* Start recording information mapping edges to case labels. */
851 start_recording_case_labels (void)
853 gcc_assert (edge_to_cases == NULL);
854 edge_to_cases = pointer_map_create ();
855 touched_switch_bbs = BITMAP_ALLOC (NULL);
858 /* Return nonzero if we are recording information for case labels. */
861 recording_case_labels_p (void)
863 return (edge_to_cases != NULL);
866 /* Stop recording information mapping edges to case labels and
867 remove any information we have recorded. */
869 end_recording_case_labels (void)
873 pointer_map_traverse (edge_to_cases, edge_to_cases_cleanup, NULL);
874 pointer_map_destroy (edge_to_cases);
875 edge_to_cases = NULL;
876 EXECUTE_IF_SET_IN_BITMAP (touched_switch_bbs, 0, i, bi)
878 basic_block bb = BASIC_BLOCK (i);
881 gimple stmt = last_stmt (bb);
882 if (stmt && gimple_code (stmt) == GIMPLE_SWITCH)
883 group_case_labels_stmt (stmt);
886 BITMAP_FREE (touched_switch_bbs);
889 /* If we are inside a {start,end}_recording_cases block, then return
890 a chain of CASE_LABEL_EXPRs from T which reference E.
892 Otherwise return NULL. */
895 get_cases_for_edge (edge e, gimple t)
900 /* If we are not recording cases, then we do not have CASE_LABEL_EXPR
901 chains available. Return NULL so the caller can detect this case. */
902 if (!recording_case_labels_p ())
905 slot = pointer_map_contains (edge_to_cases, e);
909 /* If we did not find E in the hash table, then this must be the first
910 time we have been queried for information about E & T. Add all the
911 elements from T to the hash table then perform the query again. */
913 n = gimple_switch_num_labels (t);
914 for (i = 0; i < n; i++)
916 tree elt = gimple_switch_label (t, i);
917 tree lab = CASE_LABEL (elt);
918 basic_block label_bb = label_to_block (lab);
919 edge this_edge = find_edge (e->src, label_bb);
921 /* Add it to the chain of CASE_LABEL_EXPRs referencing E, or create
923 slot = pointer_map_insert (edge_to_cases, this_edge);
924 CASE_CHAIN (elt) = (tree) *slot;
928 return (tree) *pointer_map_contains (edge_to_cases, e);
931 /* Create the edges for a GIMPLE_SWITCH starting at block BB. */
934 make_gimple_switch_edges (basic_block bb)
936 gimple entry = last_stmt (bb);
937 location_t entry_locus;
940 entry_locus = gimple_location (entry);
942 n = gimple_switch_num_labels (entry);
944 for (i = 0; i < n; ++i)
946 tree lab = CASE_LABEL (gimple_switch_label (entry, i));
947 basic_block label_bb = label_to_block (lab);
948 make_edge (bb, label_bb, 0);
949 assign_discriminator (entry_locus, label_bb);
954 /* Return the basic block holding label DEST. */
957 label_to_block_fn (struct function *ifun, tree dest)
959 int uid = LABEL_DECL_UID (dest);
961 /* We would die hard when faced by an undefined label. Emit a label to
962 the very first basic block. This will hopefully make even the dataflow
963 and undefined variable warnings quite right. */
964 if (seen_error () && uid < 0)
966 gimple_stmt_iterator gsi = gsi_start_bb (BASIC_BLOCK (NUM_FIXED_BLOCKS));
969 stmt = gimple_build_label (dest);
970 gsi_insert_before (&gsi, stmt, GSI_NEW_STMT);
971 uid = LABEL_DECL_UID (dest);
973 if (VEC_length (basic_block, ifun->cfg->x_label_to_block_map)
974 <= (unsigned int) uid)
976 return VEC_index (basic_block, ifun->cfg->x_label_to_block_map, uid);
979 /* Create edges for an abnormal goto statement at block BB. If FOR_CALL
980 is true, the source statement is a CALL_EXPR instead of a GOTO_EXPR. */
983 make_abnormal_goto_edges (basic_block bb, bool for_call)
985 basic_block target_bb;
986 gimple_stmt_iterator gsi;
988 FOR_EACH_BB (target_bb)
989 for (gsi = gsi_start_bb (target_bb); !gsi_end_p (gsi); gsi_next (&gsi))
991 gimple label_stmt = gsi_stmt (gsi);
994 if (gimple_code (label_stmt) != GIMPLE_LABEL)
997 target = gimple_label_label (label_stmt);
999 /* Make an edge to every label block that has been marked as a
1000 potential target for a computed goto or a non-local goto. */
1001 if ((FORCED_LABEL (target) && !for_call)
1002 || (DECL_NONLOCAL (target) && for_call))
1004 make_edge (bb, target_bb, EDGE_ABNORMAL);
1010 /* Create edges for a goto statement at block BB. */
1013 make_goto_expr_edges (basic_block bb)
1015 gimple_stmt_iterator last = gsi_last_bb (bb);
1016 gimple goto_t = gsi_stmt (last);
1018 /* A simple GOTO creates normal edges. */
1019 if (simple_goto_p (goto_t))
1021 tree dest = gimple_goto_dest (goto_t);
1022 basic_block label_bb = label_to_block (dest);
1023 edge e = make_edge (bb, label_bb, EDGE_FALLTHRU);
1024 e->goto_locus = gimple_location (goto_t);
1025 assign_discriminator (e->goto_locus, label_bb);
1027 e->goto_block = gimple_block (goto_t);
1028 gsi_remove (&last, true);
1032 /* A computed GOTO creates abnormal edges. */
1033 make_abnormal_goto_edges (bb, false);
1036 /* Create edges for an asm statement with labels at block BB. */
1039 make_gimple_asm_edges (basic_block bb)
1041 gimple stmt = last_stmt (bb);
1042 location_t stmt_loc = gimple_location (stmt);
1043 int i, n = gimple_asm_nlabels (stmt);
1045 for (i = 0; i < n; ++i)
1047 tree label = TREE_VALUE (gimple_asm_label_op (stmt, i));
1048 basic_block label_bb = label_to_block (label);
1049 make_edge (bb, label_bb, 0);
1050 assign_discriminator (stmt_loc, label_bb);
1054 /*---------------------------------------------------------------------------
1056 ---------------------------------------------------------------------------*/
1058 /* Cleanup useless labels in basic blocks. This is something we wish
1059 to do early because it allows us to group case labels before creating
1060 the edges for the CFG, and it speeds up block statement iterators in
1061 all passes later on.
1062 We rerun this pass after CFG is created, to get rid of the labels that
1063 are no longer referenced. After then we do not run it any more, since
1064 (almost) no new labels should be created. */
1066 /* A map from basic block index to the leading label of that block. */
1067 static struct label_record
1072 /* True if the label is referenced from somewhere. */
1076 /* Given LABEL return the first label in the same basic block. */
1079 main_block_label (tree label)
1081 basic_block bb = label_to_block (label);
1082 tree main_label = label_for_bb[bb->index].label;
1084 /* label_to_block possibly inserted undefined label into the chain. */
1087 label_for_bb[bb->index].label = label;
1091 label_for_bb[bb->index].used = true;
1095 /* Clean up redundant labels within the exception tree. */
1098 cleanup_dead_labels_eh (void)
1105 if (cfun->eh == NULL)
1108 for (i = 1; VEC_iterate (eh_landing_pad, cfun->eh->lp_array, i, lp); ++i)
1109 if (lp && lp->post_landing_pad)
1111 lab = main_block_label (lp->post_landing_pad);
1112 if (lab != lp->post_landing_pad)
1114 EH_LANDING_PAD_NR (lp->post_landing_pad) = 0;
1115 EH_LANDING_PAD_NR (lab) = lp->index;
1119 FOR_ALL_EH_REGION (r)
1123 case ERT_MUST_NOT_THROW:
1129 for (c = r->u.eh_try.first_catch; c ; c = c->next_catch)
1133 c->label = main_block_label (lab);
1138 case ERT_ALLOWED_EXCEPTIONS:
1139 lab = r->u.allowed.label;
1141 r->u.allowed.label = main_block_label (lab);
1147 /* Cleanup redundant labels. This is a three-step process:
1148 1) Find the leading label for each block.
1149 2) Redirect all references to labels to the leading labels.
1150 3) Cleanup all useless labels. */
1153 cleanup_dead_labels (void)
1156 label_for_bb = XCNEWVEC (struct label_record, last_basic_block);
1158 /* Find a suitable label for each block. We use the first user-defined
1159 label if there is one, or otherwise just the first label we see. */
1162 gimple_stmt_iterator i;
1164 for (i = gsi_start_bb (bb); !gsi_end_p (i); gsi_next (&i))
1167 gimple stmt = gsi_stmt (i);
1169 if (gimple_code (stmt) != GIMPLE_LABEL)
1172 label = gimple_label_label (stmt);
1174 /* If we have not yet seen a label for the current block,
1175 remember this one and see if there are more labels. */
1176 if (!label_for_bb[bb->index].label)
1178 label_for_bb[bb->index].label = label;
1182 /* If we did see a label for the current block already, but it
1183 is an artificially created label, replace it if the current
1184 label is a user defined label. */
1185 if (!DECL_ARTIFICIAL (label)
1186 && DECL_ARTIFICIAL (label_for_bb[bb->index].label))
1188 label_for_bb[bb->index].label = label;
1194 /* Now redirect all jumps/branches to the selected label.
1195 First do so for each block ending in a control statement. */
1198 gimple stmt = last_stmt (bb);
1202 switch (gimple_code (stmt))
1206 tree true_label = gimple_cond_true_label (stmt);
1207 tree false_label = gimple_cond_false_label (stmt);
1210 gimple_cond_set_true_label (stmt, main_block_label (true_label));
1212 gimple_cond_set_false_label (stmt, main_block_label (false_label));
1218 size_t i, n = gimple_switch_num_labels (stmt);
1220 /* Replace all destination labels. */
1221 for (i = 0; i < n; ++i)
1223 tree case_label = gimple_switch_label (stmt, i);
1224 tree label = main_block_label (CASE_LABEL (case_label));
1225 CASE_LABEL (case_label) = label;
1232 int i, n = gimple_asm_nlabels (stmt);
1234 for (i = 0; i < n; ++i)
1236 tree cons = gimple_asm_label_op (stmt, i);
1237 tree label = main_block_label (TREE_VALUE (cons));
1238 TREE_VALUE (cons) = label;
1243 /* We have to handle gotos until they're removed, and we don't
1244 remove them until after we've created the CFG edges. */
1246 if (!computed_goto_p (stmt))
1248 tree new_dest = main_block_label (gimple_goto_dest (stmt));
1249 gimple_goto_set_dest (stmt, new_dest);
1258 /* Do the same for the exception region tree labels. */
1259 cleanup_dead_labels_eh ();
1261 /* Finally, purge dead labels. All user-defined labels and labels that
1262 can be the target of non-local gotos and labels which have their
1263 address taken are preserved. */
1266 gimple_stmt_iterator i;
1267 tree label_for_this_bb = label_for_bb[bb->index].label;
1269 if (!label_for_this_bb)
1272 /* If the main label of the block is unused, we may still remove it. */
1273 if (!label_for_bb[bb->index].used)
1274 label_for_this_bb = NULL;
1276 for (i = gsi_start_bb (bb); !gsi_end_p (i); )
1279 gimple stmt = gsi_stmt (i);
1281 if (gimple_code (stmt) != GIMPLE_LABEL)
1284 label = gimple_label_label (stmt);
1286 if (label == label_for_this_bb
1287 || !DECL_ARTIFICIAL (label)
1288 || DECL_NONLOCAL (label)
1289 || FORCED_LABEL (label))
1292 gsi_remove (&i, true);
1296 free (label_for_bb);
1299 /* Scan the sorted vector of cases in STMT (a GIMPLE_SWITCH) and combine
1300 the ones jumping to the same label.
1301 Eg. three separate entries 1: 2: 3: become one entry 1..3: */
1304 group_case_labels_stmt (gimple stmt)
1306 int old_size = gimple_switch_num_labels (stmt);
1307 int i, j, new_size = old_size;
1308 tree default_case = NULL_TREE;
1309 tree default_label = NULL_TREE;
1312 /* The default label is always the first case in a switch
1313 statement after gimplification if it was not optimized
1315 if (!CASE_LOW (gimple_switch_default_label (stmt))
1316 && !CASE_HIGH (gimple_switch_default_label (stmt)))
1318 default_case = gimple_switch_default_label (stmt);
1319 default_label = CASE_LABEL (default_case);
1323 has_default = false;
1325 /* Look for possible opportunities to merge cases. */
1330 while (i < old_size)
1332 tree base_case, base_label, base_high;
1333 base_case = gimple_switch_label (stmt, i);
1335 gcc_assert (base_case);
1336 base_label = CASE_LABEL (base_case);
1338 /* Discard cases that have the same destination as the
1340 if (base_label == default_label)
1342 gimple_switch_set_label (stmt, i, NULL_TREE);
1348 base_high = CASE_HIGH (base_case)
1349 ? CASE_HIGH (base_case)
1350 : CASE_LOW (base_case);
1353 /* Try to merge case labels. Break out when we reach the end
1354 of the label vector or when we cannot merge the next case
1355 label with the current one. */
1356 while (i < old_size)
1358 tree merge_case = gimple_switch_label (stmt, i);
1359 tree merge_label = CASE_LABEL (merge_case);
1360 double_int bhp1 = double_int_add (tree_to_double_int (base_high),
1363 /* Merge the cases if they jump to the same place,
1364 and their ranges are consecutive. */
1365 if (merge_label == base_label
1366 && double_int_equal_p (tree_to_double_int (CASE_LOW (merge_case)),
1369 base_high = CASE_HIGH (merge_case) ?
1370 CASE_HIGH (merge_case) : CASE_LOW (merge_case);
1371 CASE_HIGH (base_case) = base_high;
1372 gimple_switch_set_label (stmt, i, NULL_TREE);
1381 /* Compress the case labels in the label vector, and adjust the
1382 length of the vector. */
1383 for (i = 0, j = 0; i < new_size; i++)
1385 while (! gimple_switch_label (stmt, j))
1387 gimple_switch_set_label (stmt, i,
1388 gimple_switch_label (stmt, j++));
1391 gcc_assert (new_size <= old_size);
1392 gimple_switch_set_num_labels (stmt, new_size);
1395 /* Look for blocks ending in a multiway branch (a GIMPLE_SWITCH),
1396 and scan the sorted vector of cases. Combine the ones jumping to the
1400 group_case_labels (void)
1406 gimple stmt = last_stmt (bb);
1407 if (stmt && gimple_code (stmt) == GIMPLE_SWITCH)
1408 group_case_labels_stmt (stmt);
1412 /* Checks whether we can merge block B into block A. */
1415 gimple_can_merge_blocks_p (basic_block a, basic_block b)
1418 gimple_stmt_iterator gsi;
1421 if (!single_succ_p (a))
1424 if (single_succ_edge (a)->flags & (EDGE_ABNORMAL | EDGE_EH))
1427 if (single_succ (a) != b)
1430 if (!single_pred_p (b))
1433 if (b == EXIT_BLOCK_PTR)
1436 /* If A ends by a statement causing exceptions or something similar, we
1437 cannot merge the blocks. */
1438 stmt = last_stmt (a);
1439 if (stmt && stmt_ends_bb_p (stmt))
1442 /* Do not allow a block with only a non-local label to be merged. */
1444 && gimple_code (stmt) == GIMPLE_LABEL
1445 && DECL_NONLOCAL (gimple_label_label (stmt)))
1448 /* Examine the labels at the beginning of B. */
1449 for (gsi = gsi_start_bb (b); !gsi_end_p (gsi); gsi_next (&gsi))
1452 stmt = gsi_stmt (gsi);
1453 if (gimple_code (stmt) != GIMPLE_LABEL)
1455 lab = gimple_label_label (stmt);
1457 /* Do not remove user labels. */
1458 if (!DECL_ARTIFICIAL (lab))
1462 /* Protect the loop latches. */
1463 if (current_loops && b->loop_father->latch == b)
1466 /* It must be possible to eliminate all phi nodes in B. If ssa form
1467 is not up-to-date and a name-mapping is registered, we cannot eliminate
1468 any phis. Symbols marked for renaming are never a problem though. */
1469 phis = phi_nodes (b);
1470 if (!gimple_seq_empty_p (phis)
1471 && name_mappings_registered_p ())
1474 /* When not optimizing, don't merge if we'd lose goto_locus. */
1476 && single_succ_edge (a)->goto_locus != UNKNOWN_LOCATION)
1478 location_t goto_locus = single_succ_edge (a)->goto_locus;
1479 gimple_stmt_iterator prev, next;
1480 prev = gsi_last_nondebug_bb (a);
1481 next = gsi_after_labels (b);
1482 if (!gsi_end_p (next) && is_gimple_debug (gsi_stmt (next)))
1483 gsi_next_nondebug (&next);
1484 if ((gsi_end_p (prev)
1485 || gimple_location (gsi_stmt (prev)) != goto_locus)
1486 && (gsi_end_p (next)
1487 || gimple_location (gsi_stmt (next)) != goto_locus))
1494 /* Return true if the var whose chain of uses starts at PTR has no
1497 has_zero_uses_1 (const ssa_use_operand_t *head)
1499 const ssa_use_operand_t *ptr;
1501 for (ptr = head->next; ptr != head; ptr = ptr->next)
1502 if (!is_gimple_debug (USE_STMT (ptr)))
1508 /* Return true if the var whose chain of uses starts at PTR has a
1509 single nondebug use. Set USE_P and STMT to that single nondebug
1510 use, if so, or to NULL otherwise. */
1512 single_imm_use_1 (const ssa_use_operand_t *head,
1513 use_operand_p *use_p, gimple *stmt)
1515 ssa_use_operand_t *ptr, *single_use = 0;
1517 for (ptr = head->next; ptr != head; ptr = ptr->next)
1518 if (!is_gimple_debug (USE_STMT (ptr)))
1529 *use_p = single_use;
1532 *stmt = single_use ? single_use->loc.stmt : NULL;
1534 return !!single_use;
1537 /* Replaces all uses of NAME by VAL. */
1540 replace_uses_by (tree name, tree val)
1542 imm_use_iterator imm_iter;
1547 FOR_EACH_IMM_USE_STMT (stmt, imm_iter, name)
1549 FOR_EACH_IMM_USE_ON_STMT (use, imm_iter)
1551 replace_exp (use, val);
1553 if (gimple_code (stmt) == GIMPLE_PHI)
1555 e = gimple_phi_arg_edge (stmt, PHI_ARG_INDEX_FROM_USE (use));
1556 if (e->flags & EDGE_ABNORMAL)
1558 /* This can only occur for virtual operands, since
1559 for the real ones SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name))
1560 would prevent replacement. */
1561 gcc_assert (!is_gimple_reg (name));
1562 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (val) = 1;
1567 if (gimple_code (stmt) != GIMPLE_PHI)
1571 fold_stmt_inplace (stmt);
1572 if (cfgcleanup_altered_bbs && !is_gimple_debug (stmt))
1573 bitmap_set_bit (cfgcleanup_altered_bbs, gimple_bb (stmt)->index);
1575 /* FIXME. This should go in update_stmt. */
1576 for (i = 0; i < gimple_num_ops (stmt); i++)
1578 tree op = gimple_op (stmt, i);
1579 /* Operands may be empty here. For example, the labels
1580 of a GIMPLE_COND are nulled out following the creation
1581 of the corresponding CFG edges. */
1582 if (op && TREE_CODE (op) == ADDR_EXPR)
1583 recompute_tree_invariant_for_addr_expr (op);
1586 maybe_clean_or_replace_eh_stmt (stmt, stmt);
1591 gcc_assert (has_zero_uses (name));
1593 /* Also update the trees stored in loop structures. */
1599 FOR_EACH_LOOP (li, loop, 0)
1601 substitute_in_loop_info (loop, name, val);
1606 /* Merge block B into block A. */
1609 gimple_merge_blocks (basic_block a, basic_block b)
1611 gimple_stmt_iterator last, gsi, psi;
1612 gimple_seq phis = phi_nodes (b);
1615 fprintf (dump_file, "Merging blocks %d and %d\n", a->index, b->index);
1617 /* Remove all single-valued PHI nodes from block B of the form
1618 V_i = PHI <V_j> by propagating V_j to all the uses of V_i. */
1619 gsi = gsi_last_bb (a);
1620 for (psi = gsi_start (phis); !gsi_end_p (psi); )
1622 gimple phi = gsi_stmt (psi);
1623 tree def = gimple_phi_result (phi), use = gimple_phi_arg_def (phi, 0);
1625 bool may_replace_uses = !is_gimple_reg (def)
1626 || may_propagate_copy (def, use);
1628 /* In case we maintain loop closed ssa form, do not propagate arguments
1629 of loop exit phi nodes. */
1631 && loops_state_satisfies_p (LOOP_CLOSED_SSA)
1632 && is_gimple_reg (def)
1633 && TREE_CODE (use) == SSA_NAME
1634 && a->loop_father != b->loop_father)
1635 may_replace_uses = false;
1637 if (!may_replace_uses)
1639 gcc_assert (is_gimple_reg (def));
1641 /* Note that just emitting the copies is fine -- there is no problem
1642 with ordering of phi nodes. This is because A is the single
1643 predecessor of B, therefore results of the phi nodes cannot
1644 appear as arguments of the phi nodes. */
1645 copy = gimple_build_assign (def, use);
1646 gsi_insert_after (&gsi, copy, GSI_NEW_STMT);
1647 remove_phi_node (&psi, false);
1651 /* If we deal with a PHI for virtual operands, we can simply
1652 propagate these without fussing with folding or updating
1654 if (!is_gimple_reg (def))
1656 imm_use_iterator iter;
1657 use_operand_p use_p;
1660 FOR_EACH_IMM_USE_STMT (stmt, iter, def)
1661 FOR_EACH_IMM_USE_ON_STMT (use_p, iter)
1662 SET_USE (use_p, use);
1664 if (SSA_NAME_OCCURS_IN_ABNORMAL_PHI (def))
1665 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (use) = 1;
1668 replace_uses_by (def, use);
1670 remove_phi_node (&psi, true);
1674 /* Ensure that B follows A. */
1675 move_block_after (b, a);
1677 gcc_assert (single_succ_edge (a)->flags & EDGE_FALLTHRU);
1678 gcc_assert (!last_stmt (a) || !stmt_ends_bb_p (last_stmt (a)));
1680 /* Remove labels from B and set gimple_bb to A for other statements. */
1681 for (gsi = gsi_start_bb (b); !gsi_end_p (gsi);)
1683 gimple stmt = gsi_stmt (gsi);
1684 if (gimple_code (stmt) == GIMPLE_LABEL)
1686 tree label = gimple_label_label (stmt);
1689 gsi_remove (&gsi, false);
1691 /* Now that we can thread computed gotos, we might have
1692 a situation where we have a forced label in block B
1693 However, the label at the start of block B might still be
1694 used in other ways (think about the runtime checking for
1695 Fortran assigned gotos). So we can not just delete the
1696 label. Instead we move the label to the start of block A. */
1697 if (FORCED_LABEL (label))
1699 gimple_stmt_iterator dest_gsi = gsi_start_bb (a);
1700 gsi_insert_before (&dest_gsi, stmt, GSI_NEW_STMT);
1703 lp_nr = EH_LANDING_PAD_NR (label);
1706 eh_landing_pad lp = get_eh_landing_pad_from_number (lp_nr);
1707 lp->post_landing_pad = NULL;
1712 gimple_set_bb (stmt, a);
1717 /* Merge the sequences. */
1718 last = gsi_last_bb (a);
1719 gsi_insert_seq_after (&last, bb_seq (b), GSI_NEW_STMT);
1720 set_bb_seq (b, NULL);
1722 if (cfgcleanup_altered_bbs)
1723 bitmap_set_bit (cfgcleanup_altered_bbs, a->index);
1727 /* Return the one of two successors of BB that is not reachable by a
1728 complex edge, if there is one. Else, return BB. We use
1729 this in optimizations that use post-dominators for their heuristics,
1730 to catch the cases in C++ where function calls are involved. */
1733 single_noncomplex_succ (basic_block bb)
1736 if (EDGE_COUNT (bb->succs) != 2)
1739 e0 = EDGE_SUCC (bb, 0);
1740 e1 = EDGE_SUCC (bb, 1);
1741 if (e0->flags & EDGE_COMPLEX)
1743 if (e1->flags & EDGE_COMPLEX)
1749 /* T is CALL_EXPR. Set current_function_calls_* flags. */
1752 notice_special_calls (gimple call)
1754 int flags = gimple_call_flags (call);
1756 if (flags & ECF_MAY_BE_ALLOCA)
1757 cfun->calls_alloca = true;
1758 if (flags & ECF_RETURNS_TWICE)
1759 cfun->calls_setjmp = true;
1763 /* Clear flags set by notice_special_calls. Used by dead code removal
1764 to update the flags. */
1767 clear_special_calls (void)
1769 cfun->calls_alloca = false;
1770 cfun->calls_setjmp = false;
1773 /* Remove PHI nodes associated with basic block BB and all edges out of BB. */
1776 remove_phi_nodes_and_edges_for_unreachable_block (basic_block bb)
1778 /* Since this block is no longer reachable, we can just delete all
1779 of its PHI nodes. */
1780 remove_phi_nodes (bb);
1782 /* Remove edges to BB's successors. */
1783 while (EDGE_COUNT (bb->succs) > 0)
1784 remove_edge (EDGE_SUCC (bb, 0));
1788 /* Remove statements of basic block BB. */
1791 remove_bb (basic_block bb)
1793 gimple_stmt_iterator i;
1797 fprintf (dump_file, "Removing basic block %d\n", bb->index);
1798 if (dump_flags & TDF_DETAILS)
1800 dump_bb (bb, dump_file, 0);
1801 fprintf (dump_file, "\n");
1807 struct loop *loop = bb->loop_father;
1809 /* If a loop gets removed, clean up the information associated
1811 if (loop->latch == bb
1812 || loop->header == bb)
1813 free_numbers_of_iterations_estimates_loop (loop);
1816 /* Remove all the instructions in the block. */
1817 if (bb_seq (bb) != NULL)
1819 /* Walk backwards so as to get a chance to substitute all
1820 released DEFs into debug stmts. See
1821 eliminate_unnecessary_stmts() in tree-ssa-dce.c for more
1823 for (i = gsi_last_bb (bb); !gsi_end_p (i);)
1825 gimple stmt = gsi_stmt (i);
1826 if (gimple_code (stmt) == GIMPLE_LABEL
1827 && (FORCED_LABEL (gimple_label_label (stmt))
1828 || DECL_NONLOCAL (gimple_label_label (stmt))))
1831 gimple_stmt_iterator new_gsi;
1833 /* A non-reachable non-local label may still be referenced.
1834 But it no longer needs to carry the extra semantics of
1836 if (DECL_NONLOCAL (gimple_label_label (stmt)))
1838 DECL_NONLOCAL (gimple_label_label (stmt)) = 0;
1839 FORCED_LABEL (gimple_label_label (stmt)) = 1;
1842 new_bb = bb->prev_bb;
1843 new_gsi = gsi_start_bb (new_bb);
1844 gsi_remove (&i, false);
1845 gsi_insert_before (&new_gsi, stmt, GSI_NEW_STMT);
1849 /* Release SSA definitions if we are in SSA. Note that we
1850 may be called when not in SSA. For example,
1851 final_cleanup calls this function via
1852 cleanup_tree_cfg. */
1853 if (gimple_in_ssa_p (cfun))
1854 release_defs (stmt);
1856 gsi_remove (&i, true);
1860 i = gsi_last_bb (bb);
1866 remove_phi_nodes_and_edges_for_unreachable_block (bb);
1867 bb->il.gimple = NULL;
1871 /* Given a basic block BB ending with COND_EXPR or SWITCH_EXPR, and a
1872 predicate VAL, return the edge that will be taken out of the block.
1873 If VAL does not match a unique edge, NULL is returned. */
1876 find_taken_edge (basic_block bb, tree val)
1880 stmt = last_stmt (bb);
1883 gcc_assert (is_ctrl_stmt (stmt));
1888 if (!is_gimple_min_invariant (val))
1891 if (gimple_code (stmt) == GIMPLE_COND)
1892 return find_taken_edge_cond_expr (bb, val);
1894 if (gimple_code (stmt) == GIMPLE_SWITCH)
1895 return find_taken_edge_switch_expr (bb, val);
1897 if (computed_goto_p (stmt))
1899 /* Only optimize if the argument is a label, if the argument is
1900 not a label then we can not construct a proper CFG.
1902 It may be the case that we only need to allow the LABEL_REF to
1903 appear inside an ADDR_EXPR, but we also allow the LABEL_REF to
1904 appear inside a LABEL_EXPR just to be safe. */
1905 if ((TREE_CODE (val) == ADDR_EXPR || TREE_CODE (val) == LABEL_EXPR)
1906 && TREE_CODE (TREE_OPERAND (val, 0)) == LABEL_DECL)
1907 return find_taken_edge_computed_goto (bb, TREE_OPERAND (val, 0));
1914 /* Given a constant value VAL and the entry block BB to a GOTO_EXPR
1915 statement, determine which of the outgoing edges will be taken out of the
1916 block. Return NULL if either edge may be taken. */
1919 find_taken_edge_computed_goto (basic_block bb, tree val)
1924 dest = label_to_block (val);
1927 e = find_edge (bb, dest);
1928 gcc_assert (e != NULL);
1934 /* Given a constant value VAL and the entry block BB to a COND_EXPR
1935 statement, determine which of the two edges will be taken out of the
1936 block. Return NULL if either edge may be taken. */
1939 find_taken_edge_cond_expr (basic_block bb, tree val)
1941 edge true_edge, false_edge;
1943 extract_true_false_edges_from_block (bb, &true_edge, &false_edge);
1945 gcc_assert (TREE_CODE (val) == INTEGER_CST);
1946 return (integer_zerop (val) ? false_edge : true_edge);
1949 /* Given an INTEGER_CST VAL and the entry block BB to a SWITCH_EXPR
1950 statement, determine which edge will be taken out of the block. Return
1951 NULL if any edge may be taken. */
1954 find_taken_edge_switch_expr (basic_block bb, tree val)
1956 basic_block dest_bb;
1961 switch_stmt = last_stmt (bb);
1962 taken_case = find_case_label_for_value (switch_stmt, val);
1963 dest_bb = label_to_block (CASE_LABEL (taken_case));
1965 e = find_edge (bb, dest_bb);
1971 /* Return the CASE_LABEL_EXPR that SWITCH_STMT will take for VAL.
1972 We can make optimal use here of the fact that the case labels are
1973 sorted: We can do a binary search for a case matching VAL. */
1976 find_case_label_for_value (gimple switch_stmt, tree val)
1978 size_t low, high, n = gimple_switch_num_labels (switch_stmt);
1979 tree default_case = gimple_switch_default_label (switch_stmt);
1981 for (low = 0, high = n; high - low > 1; )
1983 size_t i = (high + low) / 2;
1984 tree t = gimple_switch_label (switch_stmt, i);
1987 /* Cache the result of comparing CASE_LOW and val. */
1988 cmp = tree_int_cst_compare (CASE_LOW (t), val);
1995 if (CASE_HIGH (t) == NULL)
1997 /* A singe-valued case label. */
2003 /* A case range. We can only handle integer ranges. */
2004 if (cmp <= 0 && tree_int_cst_compare (CASE_HIGH (t), val) >= 0)
2009 return default_case;
2013 /* Dump a basic block on stderr. */
2016 gimple_debug_bb (basic_block bb)
2018 gimple_dump_bb (bb, stderr, 0, TDF_VOPS|TDF_MEMSYMS);
2022 /* Dump basic block with index N on stderr. */
2025 gimple_debug_bb_n (int n)
2027 gimple_debug_bb (BASIC_BLOCK (n));
2028 return BASIC_BLOCK (n);
2032 /* Dump the CFG on stderr.
2034 FLAGS are the same used by the tree dumping functions
2035 (see TDF_* in tree-pass.h). */
2038 gimple_debug_cfg (int flags)
2040 gimple_dump_cfg (stderr, flags);
2044 /* Dump the program showing basic block boundaries on the given FILE.
2046 FLAGS are the same used by the tree dumping functions (see TDF_* in
2050 gimple_dump_cfg (FILE *file, int flags)
2052 if (flags & TDF_DETAILS)
2054 dump_function_header (file, current_function_decl, flags);
2055 fprintf (file, ";; \n%d basic blocks, %d edges, last basic block %d.\n\n",
2056 n_basic_blocks, n_edges, last_basic_block);
2058 brief_dump_cfg (file);
2059 fprintf (file, "\n");
2062 if (flags & TDF_STATS)
2063 dump_cfg_stats (file);
2065 dump_function_to_file (current_function_decl, file, flags | TDF_BLOCKS);
2069 /* Dump CFG statistics on FILE. */
2072 dump_cfg_stats (FILE *file)
2074 static long max_num_merged_labels = 0;
2075 unsigned long size, total = 0;
2078 const char * const fmt_str = "%-30s%-13s%12s\n";
2079 const char * const fmt_str_1 = "%-30s%13d%11lu%c\n";
2080 const char * const fmt_str_2 = "%-30s%13ld%11lu%c\n";
2081 const char * const fmt_str_3 = "%-43s%11lu%c\n";
2082 const char *funcname
2083 = lang_hooks.decl_printable_name (current_function_decl, 2);
2086 fprintf (file, "\nCFG Statistics for %s\n\n", funcname);
2088 fprintf (file, "---------------------------------------------------------\n");
2089 fprintf (file, fmt_str, "", " Number of ", "Memory");
2090 fprintf (file, fmt_str, "", " instances ", "used ");
2091 fprintf (file, "---------------------------------------------------------\n");
2093 size = n_basic_blocks * sizeof (struct basic_block_def);
2095 fprintf (file, fmt_str_1, "Basic blocks", n_basic_blocks,
2096 SCALE (size), LABEL (size));
2100 num_edges += EDGE_COUNT (bb->succs);
2101 size = num_edges * sizeof (struct edge_def);
2103 fprintf (file, fmt_str_2, "Edges", num_edges, SCALE (size), LABEL (size));
2105 fprintf (file, "---------------------------------------------------------\n");
2106 fprintf (file, fmt_str_3, "Total memory used by CFG data", SCALE (total),
2108 fprintf (file, "---------------------------------------------------------\n");
2109 fprintf (file, "\n");
2111 if (cfg_stats.num_merged_labels > max_num_merged_labels)
2112 max_num_merged_labels = cfg_stats.num_merged_labels;
2114 fprintf (file, "Coalesced label blocks: %ld (Max so far: %ld)\n",
2115 cfg_stats.num_merged_labels, max_num_merged_labels);
2117 fprintf (file, "\n");
2121 /* Dump CFG statistics on stderr. Keep extern so that it's always
2122 linked in the final executable. */
2125 debug_cfg_stats (void)
2127 dump_cfg_stats (stderr);
2131 /* Dump the flowgraph to a .vcg FILE. */
2134 gimple_cfg2vcg (FILE *file)
2139 const char *funcname
2140 = lang_hooks.decl_printable_name (current_function_decl, 2);
2142 /* Write the file header. */
2143 fprintf (file, "graph: { title: \"%s\"\n", funcname);
2144 fprintf (file, "node: { title: \"ENTRY\" label: \"ENTRY\" }\n");
2145 fprintf (file, "node: { title: \"EXIT\" label: \"EXIT\" }\n");
2147 /* Write blocks and edges. */
2148 FOR_EACH_EDGE (e, ei, ENTRY_BLOCK_PTR->succs)
2150 fprintf (file, "edge: { sourcename: \"ENTRY\" targetname: \"%d\"",
2153 if (e->flags & EDGE_FAKE)
2154 fprintf (file, " linestyle: dotted priority: 10");
2156 fprintf (file, " linestyle: solid priority: 100");
2158 fprintf (file, " }\n");
2164 enum gimple_code head_code, end_code;
2165 const char *head_name, *end_name;
2168 gimple first = first_stmt (bb);
2169 gimple last = last_stmt (bb);
2173 head_code = gimple_code (first);
2174 head_name = gimple_code_name[head_code];
2175 head_line = get_lineno (first);
2178 head_name = "no-statement";
2182 end_code = gimple_code (last);
2183 end_name = gimple_code_name[end_code];
2184 end_line = get_lineno (last);
2187 end_name = "no-statement";
2189 fprintf (file, "node: { title: \"%d\" label: \"#%d\\n%s (%d)\\n%s (%d)\"}\n",
2190 bb->index, bb->index, head_name, head_line, end_name,
2193 FOR_EACH_EDGE (e, ei, bb->succs)
2195 if (e->dest == EXIT_BLOCK_PTR)
2196 fprintf (file, "edge: { sourcename: \"%d\" targetname: \"EXIT\"", bb->index);
2198 fprintf (file, "edge: { sourcename: \"%d\" targetname: \"%d\"", bb->index, e->dest->index);
2200 if (e->flags & EDGE_FAKE)
2201 fprintf (file, " priority: 10 linestyle: dotted");
2203 fprintf (file, " priority: 100 linestyle: solid");
2205 fprintf (file, " }\n");
2208 if (bb->next_bb != EXIT_BLOCK_PTR)
2212 fputs ("}\n\n", file);
2217 /*---------------------------------------------------------------------------
2218 Miscellaneous helpers
2219 ---------------------------------------------------------------------------*/
2221 /* Return true if T represents a stmt that always transfers control. */
2224 is_ctrl_stmt (gimple t)
2226 switch (gimple_code (t))
2240 /* Return true if T is a statement that may alter the flow of control
2241 (e.g., a call to a non-returning function). */
2244 is_ctrl_altering_stmt (gimple t)
2248 switch (gimple_code (t))
2252 int flags = gimple_call_flags (t);
2254 /* A non-pure/const call alters flow control if the current
2255 function has nonlocal labels. */
2256 if (!(flags & (ECF_CONST | ECF_PURE | ECF_LEAF))
2257 && cfun->has_nonlocal_label)
2260 /* A call also alters control flow if it does not return. */
2261 if (flags & ECF_NORETURN)
2264 /* BUILT_IN_RETURN call is same as return statement. */
2265 if (gimple_call_builtin_p (t, BUILT_IN_RETURN))
2270 case GIMPLE_EH_DISPATCH:
2271 /* EH_DISPATCH branches to the individual catch handlers at
2272 this level of a try or allowed-exceptions region. It can
2273 fallthru to the next statement as well. */
2277 if (gimple_asm_nlabels (t) > 0)
2282 /* OpenMP directives alter control flow. */
2289 /* If a statement can throw, it alters control flow. */
2290 return stmt_can_throw_internal (t);
2294 /* Return true if T is a simple local goto. */
2297 simple_goto_p (gimple t)
2299 return (gimple_code (t) == GIMPLE_GOTO
2300 && TREE_CODE (gimple_goto_dest (t)) == LABEL_DECL);
2304 /* Return true if T can make an abnormal transfer of control flow.
2305 Transfers of control flow associated with EH are excluded. */
2308 stmt_can_make_abnormal_goto (gimple t)
2310 if (computed_goto_p (t))
2312 if (is_gimple_call (t))
2313 return (gimple_has_side_effects (t) && cfun->has_nonlocal_label
2314 && !(gimple_call_flags (t) & ECF_LEAF));
2319 /* Return true if STMT should start a new basic block. PREV_STMT is
2320 the statement preceding STMT. It is used when STMT is a label or a
2321 case label. Labels should only start a new basic block if their
2322 previous statement wasn't a label. Otherwise, sequence of labels
2323 would generate unnecessary basic blocks that only contain a single
2327 stmt_starts_bb_p (gimple stmt, gimple prev_stmt)
2332 /* Labels start a new basic block only if the preceding statement
2333 wasn't a label of the same type. This prevents the creation of
2334 consecutive blocks that have nothing but a single label. */
2335 if (gimple_code (stmt) == GIMPLE_LABEL)
2337 /* Nonlocal and computed GOTO targets always start a new block. */
2338 if (DECL_NONLOCAL (gimple_label_label (stmt))
2339 || FORCED_LABEL (gimple_label_label (stmt)))
2342 if (prev_stmt && gimple_code (prev_stmt) == GIMPLE_LABEL)
2344 if (DECL_NONLOCAL (gimple_label_label (prev_stmt)))
2347 cfg_stats.num_merged_labels++;
2358 /* Return true if T should end a basic block. */
2361 stmt_ends_bb_p (gimple t)
2363 return is_ctrl_stmt (t) || is_ctrl_altering_stmt (t);
2366 /* Remove block annotations and other data structures. */
2369 delete_tree_cfg_annotations (void)
2371 label_to_block_map = NULL;
2375 /* Return the first statement in basic block BB. */
2378 first_stmt (basic_block bb)
2380 gimple_stmt_iterator i = gsi_start_bb (bb);
2383 while (!gsi_end_p (i) && is_gimple_debug ((stmt = gsi_stmt (i))))
2391 /* Return the first non-label statement in basic block BB. */
2394 first_non_label_stmt (basic_block bb)
2396 gimple_stmt_iterator i = gsi_start_bb (bb);
2397 while (!gsi_end_p (i) && gimple_code (gsi_stmt (i)) == GIMPLE_LABEL)
2399 return !gsi_end_p (i) ? gsi_stmt (i) : NULL;
2402 /* Return the last statement in basic block BB. */
2405 last_stmt (basic_block bb)
2407 gimple_stmt_iterator i = gsi_last_bb (bb);
2410 while (!gsi_end_p (i) && is_gimple_debug ((stmt = gsi_stmt (i))))
2418 /* Return the last statement of an otherwise empty block. Return NULL
2419 if the block is totally empty, or if it contains more than one
2423 last_and_only_stmt (basic_block bb)
2425 gimple_stmt_iterator i = gsi_last_nondebug_bb (bb);
2431 last = gsi_stmt (i);
2432 gsi_prev_nondebug (&i);
2436 /* Empty statements should no longer appear in the instruction stream.
2437 Everything that might have appeared before should be deleted by
2438 remove_useless_stmts, and the optimizers should just gsi_remove
2439 instead of smashing with build_empty_stmt.
2441 Thus the only thing that should appear here in a block containing
2442 one executable statement is a label. */
2443 prev = gsi_stmt (i);
2444 if (gimple_code (prev) == GIMPLE_LABEL)
2450 /* Reinstall those PHI arguments queued in OLD_EDGE to NEW_EDGE. */
2453 reinstall_phi_args (edge new_edge, edge old_edge)
2455 edge_var_map_vector v;
2458 gimple_stmt_iterator phis;
2460 v = redirect_edge_var_map_vector (old_edge);
2464 for (i = 0, phis = gsi_start_phis (new_edge->dest);
2465 VEC_iterate (edge_var_map, v, i, vm) && !gsi_end_p (phis);
2466 i++, gsi_next (&phis))
2468 gimple phi = gsi_stmt (phis);
2469 tree result = redirect_edge_var_map_result (vm);
2470 tree arg = redirect_edge_var_map_def (vm);
2472 gcc_assert (result == gimple_phi_result (phi));
2474 add_phi_arg (phi, arg, new_edge, redirect_edge_var_map_location (vm));
2477 redirect_edge_var_map_clear (old_edge);
2480 /* Returns the basic block after which the new basic block created
2481 by splitting edge EDGE_IN should be placed. Tries to keep the new block
2482 near its "logical" location. This is of most help to humans looking
2483 at debugging dumps. */
2486 split_edge_bb_loc (edge edge_in)
2488 basic_block dest = edge_in->dest;
2489 basic_block dest_prev = dest->prev_bb;
2493 edge e = find_edge (dest_prev, dest);
2494 if (e && !(e->flags & EDGE_COMPLEX))
2495 return edge_in->src;
2500 /* Split a (typically critical) edge EDGE_IN. Return the new block.
2501 Abort on abnormal edges. */
2504 gimple_split_edge (edge edge_in)
2506 basic_block new_bb, after_bb, dest;
2509 /* Abnormal edges cannot be split. */
2510 gcc_assert (!(edge_in->flags & EDGE_ABNORMAL));
2512 dest = edge_in->dest;
2514 after_bb = split_edge_bb_loc (edge_in);
2516 new_bb = create_empty_bb (after_bb);
2517 new_bb->frequency = EDGE_FREQUENCY (edge_in);
2518 new_bb->count = edge_in->count;
2519 new_edge = make_edge (new_bb, dest, EDGE_FALLTHRU);
2520 new_edge->probability = REG_BR_PROB_BASE;
2521 new_edge->count = edge_in->count;
2523 e = redirect_edge_and_branch (edge_in, new_bb);
2524 gcc_assert (e == edge_in);
2525 reinstall_phi_args (new_edge, e);
2531 /* Verify properties of the address expression T with base object BASE. */
2534 verify_address (tree t, tree base)
2537 bool old_side_effects;
2539 bool new_side_effects;
2541 old_constant = TREE_CONSTANT (t);
2542 old_side_effects = TREE_SIDE_EFFECTS (t);
2544 recompute_tree_invariant_for_addr_expr (t);
2545 new_side_effects = TREE_SIDE_EFFECTS (t);
2546 new_constant = TREE_CONSTANT (t);
2548 if (old_constant != new_constant)
2550 error ("constant not recomputed when ADDR_EXPR changed");
2553 if (old_side_effects != new_side_effects)
2555 error ("side effects not recomputed when ADDR_EXPR changed");
2559 if (!(TREE_CODE (base) == VAR_DECL
2560 || TREE_CODE (base) == PARM_DECL
2561 || TREE_CODE (base) == RESULT_DECL))
2564 if (DECL_GIMPLE_REG_P (base))
2566 error ("DECL_GIMPLE_REG_P set on a variable with address taken");
2573 /* Callback for walk_tree, check that all elements with address taken are
2574 properly noticed as such. The DATA is an int* that is 1 if TP was seen
2575 inside a PHI node. */
2578 verify_expr (tree *tp, int *walk_subtrees, void *data ATTRIBUTE_UNUSED)
2585 /* Check operand N for being valid GIMPLE and give error MSG if not. */
2586 #define CHECK_OP(N, MSG) \
2587 do { if (!is_gimple_val (TREE_OPERAND (t, N))) \
2588 { error (MSG); return TREE_OPERAND (t, N); }} while (0)
2590 switch (TREE_CODE (t))
2593 if (SSA_NAME_IN_FREE_LIST (t))
2595 error ("SSA name in freelist but still referenced");
2601 error ("INDIRECT_REF in gimple IL");
2605 x = TREE_OPERAND (t, 0);
2606 if (!POINTER_TYPE_P (TREE_TYPE (x))
2607 || !is_gimple_mem_ref_addr (x))
2609 error ("invalid first operand of MEM_REF");
2612 if (TREE_CODE (TREE_OPERAND (t, 1)) != INTEGER_CST
2613 || !POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (t, 1))))
2615 error ("invalid offset operand of MEM_REF");
2616 return TREE_OPERAND (t, 1);
2618 if (TREE_CODE (x) == ADDR_EXPR
2619 && (x = verify_address (x, TREE_OPERAND (x, 0))))
2625 x = fold (ASSERT_EXPR_COND (t));
2626 if (x == boolean_false_node)
2628 error ("ASSERT_EXPR with an always-false condition");
2634 error ("MODIFY_EXPR not expected while having tuples");
2641 gcc_assert (is_gimple_address (t));
2643 /* Skip any references (they will be checked when we recurse down the
2644 tree) and ensure that any variable used as a prefix is marked
2646 for (x = TREE_OPERAND (t, 0);
2647 handled_component_p (x);
2648 x = TREE_OPERAND (x, 0))
2651 if ((tem = verify_address (t, x)))
2654 if (!(TREE_CODE (x) == VAR_DECL
2655 || TREE_CODE (x) == PARM_DECL
2656 || TREE_CODE (x) == RESULT_DECL))
2659 if (!TREE_ADDRESSABLE (x))
2661 error ("address taken, but ADDRESSABLE bit not set");
2669 x = COND_EXPR_COND (t);
2670 if (!INTEGRAL_TYPE_P (TREE_TYPE (x)))
2672 error ("non-integral used in condition");
2675 if (!is_gimple_condexpr (x))
2677 error ("invalid conditional operand");
2682 case NON_LVALUE_EXPR:
2683 case TRUTH_NOT_EXPR:
2687 case FIX_TRUNC_EXPR:
2692 CHECK_OP (0, "invalid operand to unary operator");
2699 case ARRAY_RANGE_REF:
2701 case VIEW_CONVERT_EXPR:
2702 /* We have a nest of references. Verify that each of the operands
2703 that determine where to reference is either a constant or a variable,
2704 verify that the base is valid, and then show we've already checked
2706 while (handled_component_p (t))
2708 if (TREE_CODE (t) == COMPONENT_REF && TREE_OPERAND (t, 2))
2709 CHECK_OP (2, "invalid COMPONENT_REF offset operator");
2710 else if (TREE_CODE (t) == ARRAY_REF
2711 || TREE_CODE (t) == ARRAY_RANGE_REF)
2713 CHECK_OP (1, "invalid array index");
2714 if (TREE_OPERAND (t, 2))
2715 CHECK_OP (2, "invalid array lower bound");
2716 if (TREE_OPERAND (t, 3))
2717 CHECK_OP (3, "invalid array stride");
2719 else if (TREE_CODE (t) == BIT_FIELD_REF)
2721 if (!host_integerp (TREE_OPERAND (t, 1), 1)
2722 || !host_integerp (TREE_OPERAND (t, 2), 1))
2724 error ("invalid position or size operand to BIT_FIELD_REF");
2727 else if (INTEGRAL_TYPE_P (TREE_TYPE (t))
2728 && (TYPE_PRECISION (TREE_TYPE (t))
2729 != TREE_INT_CST_LOW (TREE_OPERAND (t, 1))))
2731 error ("integral result type precision does not match "
2732 "field size of BIT_FIELD_REF");
2735 if (!INTEGRAL_TYPE_P (TREE_TYPE (t))
2736 && (GET_MODE_PRECISION (TYPE_MODE (TREE_TYPE (t)))
2737 != TREE_INT_CST_LOW (TREE_OPERAND (t, 1))))
2739 error ("mode precision of non-integral result does not "
2740 "match field size of BIT_FIELD_REF");
2745 t = TREE_OPERAND (t, 0);
2748 if (!is_gimple_min_invariant (t) && !is_gimple_lvalue (t))
2750 error ("invalid reference prefix");
2757 /* PLUS_EXPR and MINUS_EXPR don't work on pointers, they should be done using
2758 POINTER_PLUS_EXPR. */
2759 if (POINTER_TYPE_P (TREE_TYPE (t)))
2761 error ("invalid operand to plus/minus, type is a pointer");
2764 CHECK_OP (0, "invalid operand to binary operator");
2765 CHECK_OP (1, "invalid operand to binary operator");
2768 case POINTER_PLUS_EXPR:
2769 /* Check to make sure the first operand is a pointer or reference type. */
2770 if (!POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (t, 0))))
2772 error ("invalid operand to pointer plus, first operand is not a pointer");
2775 /* Check to make sure the second operand is an integer with type of
2777 if (!useless_type_conversion_p (sizetype,
2778 TREE_TYPE (TREE_OPERAND (t, 1))))
2780 error ("invalid operand to pointer plus, second operand is not an "
2781 "integer with type of sizetype");
2791 case UNORDERED_EXPR:
2800 case TRUNC_DIV_EXPR:
2802 case FLOOR_DIV_EXPR:
2803 case ROUND_DIV_EXPR:
2804 case TRUNC_MOD_EXPR:
2806 case FLOOR_MOD_EXPR:
2807 case ROUND_MOD_EXPR:
2809 case EXACT_DIV_EXPR:
2819 CHECK_OP (0, "invalid operand to binary operator");
2820 CHECK_OP (1, "invalid operand to binary operator");
2824 if (TREE_CONSTANT (t) && TREE_CODE (TREE_TYPE (t)) == VECTOR_TYPE)
2828 case CASE_LABEL_EXPR:
2831 error ("invalid CASE_CHAIN");
2845 /* Verify if EXPR is either a GIMPLE ID or a GIMPLE indirect reference.
2846 Returns true if there is an error, otherwise false. */
2849 verify_types_in_gimple_min_lval (tree expr)
2853 if (is_gimple_id (expr))
2856 if (TREE_CODE (expr) != TARGET_MEM_REF
2857 && TREE_CODE (expr) != MEM_REF)
2859 error ("invalid expression for min lvalue");
2863 /* TARGET_MEM_REFs are strange beasts. */
2864 if (TREE_CODE (expr) == TARGET_MEM_REF)
2867 op = TREE_OPERAND (expr, 0);
2868 if (!is_gimple_val (op))
2870 error ("invalid operand in indirect reference");
2871 debug_generic_stmt (op);
2874 /* Memory references now generally can involve a value conversion. */
2879 /* Verify if EXPR is a valid GIMPLE reference expression. If
2880 REQUIRE_LVALUE is true verifies it is an lvalue. Returns true
2881 if there is an error, otherwise false. */
2884 verify_types_in_gimple_reference (tree expr, bool require_lvalue)
2886 while (handled_component_p (expr))
2888 tree op = TREE_OPERAND (expr, 0);
2890 if (TREE_CODE (expr) == ARRAY_REF
2891 || TREE_CODE (expr) == ARRAY_RANGE_REF)
2893 if (!is_gimple_val (TREE_OPERAND (expr, 1))
2894 || (TREE_OPERAND (expr, 2)
2895 && !is_gimple_val (TREE_OPERAND (expr, 2)))
2896 || (TREE_OPERAND (expr, 3)
2897 && !is_gimple_val (TREE_OPERAND (expr, 3))))
2899 error ("invalid operands to array reference");
2900 debug_generic_stmt (expr);
2905 /* Verify if the reference array element types are compatible. */
2906 if (TREE_CODE (expr) == ARRAY_REF
2907 && !useless_type_conversion_p (TREE_TYPE (expr),
2908 TREE_TYPE (TREE_TYPE (op))))
2910 error ("type mismatch in array reference");
2911 debug_generic_stmt (TREE_TYPE (expr));
2912 debug_generic_stmt (TREE_TYPE (TREE_TYPE (op)));
2915 if (TREE_CODE (expr) == ARRAY_RANGE_REF
2916 && !useless_type_conversion_p (TREE_TYPE (TREE_TYPE (expr)),
2917 TREE_TYPE (TREE_TYPE (op))))
2919 error ("type mismatch in array range reference");
2920 debug_generic_stmt (TREE_TYPE (TREE_TYPE (expr)));
2921 debug_generic_stmt (TREE_TYPE (TREE_TYPE (op)));
2925 if ((TREE_CODE (expr) == REALPART_EXPR
2926 || TREE_CODE (expr) == IMAGPART_EXPR)
2927 && !useless_type_conversion_p (TREE_TYPE (expr),
2928 TREE_TYPE (TREE_TYPE (op))))
2930 error ("type mismatch in real/imagpart reference");
2931 debug_generic_stmt (TREE_TYPE (expr));
2932 debug_generic_stmt (TREE_TYPE (TREE_TYPE (op)));
2936 if (TREE_CODE (expr) == COMPONENT_REF
2937 && !useless_type_conversion_p (TREE_TYPE (expr),
2938 TREE_TYPE (TREE_OPERAND (expr, 1))))
2940 error ("type mismatch in component reference");
2941 debug_generic_stmt (TREE_TYPE (expr));
2942 debug_generic_stmt (TREE_TYPE (TREE_OPERAND (expr, 1)));
2946 if (TREE_CODE (expr) == VIEW_CONVERT_EXPR)
2948 /* For VIEW_CONVERT_EXPRs which are allowed here too, we only check
2949 that their operand is not an SSA name or an invariant when
2950 requiring an lvalue (this usually means there is a SRA or IPA-SRA
2951 bug). Otherwise there is nothing to verify, gross mismatches at
2952 most invoke undefined behavior. */
2954 && (TREE_CODE (op) == SSA_NAME
2955 || is_gimple_min_invariant (op)))
2957 error ("conversion of an SSA_NAME on the left hand side");
2958 debug_generic_stmt (expr);
2961 else if (TREE_CODE (op) == SSA_NAME
2962 && TYPE_SIZE (TREE_TYPE (expr)) != TYPE_SIZE (TREE_TYPE (op)))
2964 error ("conversion of register to a different size");
2965 debug_generic_stmt (expr);
2968 else if (!handled_component_p (op))
2975 if (TREE_CODE (expr) == MEM_REF)
2977 if (!is_gimple_mem_ref_addr (TREE_OPERAND (expr, 0)))
2979 error ("invalid address operand in MEM_REF");
2980 debug_generic_stmt (expr);
2983 if (TREE_CODE (TREE_OPERAND (expr, 1)) != INTEGER_CST
2984 || !POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (expr, 1))))
2986 error ("invalid offset operand in MEM_REF");
2987 debug_generic_stmt (expr);
2991 else if (TREE_CODE (expr) == TARGET_MEM_REF)
2993 if (!TMR_BASE (expr)
2994 || !is_gimple_mem_ref_addr (TMR_BASE (expr)))
2996 error ("invalid address operand in TARGET_MEM_REF");
2999 if (!TMR_OFFSET (expr)
3000 || TREE_CODE (TMR_OFFSET (expr)) != INTEGER_CST
3001 || !POINTER_TYPE_P (TREE_TYPE (TMR_OFFSET (expr))))
3003 error ("invalid offset operand in TARGET_MEM_REF");
3004 debug_generic_stmt (expr);
3009 return ((require_lvalue || !is_gimple_min_invariant (expr))
3010 && verify_types_in_gimple_min_lval (expr));
3013 /* Returns true if there is one pointer type in TYPE_POINTER_TO (SRC_OBJ)
3014 list of pointer-to types that is trivially convertible to DEST. */
3017 one_pointer_to_useless_type_conversion_p (tree dest, tree src_obj)
3021 if (!TYPE_POINTER_TO (src_obj))
3024 for (src = TYPE_POINTER_TO (src_obj); src; src = TYPE_NEXT_PTR_TO (src))
3025 if (useless_type_conversion_p (dest, src))
3031 /* Return true if TYPE1 is a fixed-point type and if conversions to and
3032 from TYPE2 can be handled by FIXED_CONVERT_EXPR. */
3035 valid_fixed_convert_types_p (tree type1, tree type2)
3037 return (FIXED_POINT_TYPE_P (type1)
3038 && (INTEGRAL_TYPE_P (type2)
3039 || SCALAR_FLOAT_TYPE_P (type2)
3040 || FIXED_POINT_TYPE_P (type2)));
3043 /* Verify the contents of a GIMPLE_CALL STMT. Returns true when there
3044 is a problem, otherwise false. */
3047 verify_gimple_call (gimple stmt)
3049 tree fn = gimple_call_fn (stmt);
3050 tree fntype, fndecl;
3053 if (gimple_call_internal_p (stmt))
3057 error ("gimple call has two targets");
3058 debug_generic_stmt (fn);
3066 error ("gimple call has no target");
3071 if (fn && !is_gimple_call_addr (fn))
3073 error ("invalid function in gimple call");
3074 debug_generic_stmt (fn);
3079 && (!POINTER_TYPE_P (TREE_TYPE (fn))
3080 || (TREE_CODE (TREE_TYPE (TREE_TYPE (fn))) != FUNCTION_TYPE
3081 && TREE_CODE (TREE_TYPE (TREE_TYPE (fn))) != METHOD_TYPE)))
3083 error ("non-function in gimple call");
3087 fndecl = gimple_call_fndecl (stmt);
3089 && TREE_CODE (fndecl) == FUNCTION_DECL
3090 && DECL_LOOPING_CONST_OR_PURE_P (fndecl)
3091 && !DECL_PURE_P (fndecl)
3092 && !TREE_READONLY (fndecl))
3094 error ("invalid pure const state for function");
3098 if (gimple_call_lhs (stmt)
3099 && (!is_gimple_lvalue (gimple_call_lhs (stmt))
3100 || verify_types_in_gimple_reference (gimple_call_lhs (stmt), true)))
3102 error ("invalid LHS in gimple call");
3106 if (gimple_call_lhs (stmt) && gimple_call_noreturn_p (stmt))
3108 error ("LHS in noreturn call");
3112 fntype = gimple_call_fntype (stmt);
3114 && gimple_call_lhs (stmt)
3115 && !useless_type_conversion_p (TREE_TYPE (gimple_call_lhs (stmt)),
3117 /* ??? At least C++ misses conversions at assignments from
3118 void * call results.
3119 ??? Java is completely off. Especially with functions
3120 returning java.lang.Object.
3121 For now simply allow arbitrary pointer type conversions. */
3122 && !(POINTER_TYPE_P (TREE_TYPE (gimple_call_lhs (stmt)))
3123 && POINTER_TYPE_P (TREE_TYPE (fntype))))
3125 error ("invalid conversion in gimple call");
3126 debug_generic_stmt (TREE_TYPE (gimple_call_lhs (stmt)));
3127 debug_generic_stmt (TREE_TYPE (fntype));
3131 if (gimple_call_chain (stmt)
3132 && !is_gimple_val (gimple_call_chain (stmt)))
3134 error ("invalid static chain in gimple call");
3135 debug_generic_stmt (gimple_call_chain (stmt));
3139 /* If there is a static chain argument, this should not be an indirect
3140 call, and the decl should have DECL_STATIC_CHAIN set. */
3141 if (gimple_call_chain (stmt))
3143 if (!gimple_call_fndecl (stmt))
3145 error ("static chain in indirect gimple call");
3148 fn = TREE_OPERAND (fn, 0);
3150 if (!DECL_STATIC_CHAIN (fn))
3152 error ("static chain with function that doesn%'t use one");
3157 /* ??? The C frontend passes unpromoted arguments in case it
3158 didn't see a function declaration before the call. So for now
3159 leave the call arguments mostly unverified. Once we gimplify
3160 unit-at-a-time we have a chance to fix this. */
3162 for (i = 0; i < gimple_call_num_args (stmt); ++i)
3164 tree arg = gimple_call_arg (stmt, i);
3165 if ((is_gimple_reg_type (TREE_TYPE (arg))
3166 && !is_gimple_val (arg))
3167 || (!is_gimple_reg_type (TREE_TYPE (arg))
3168 && !is_gimple_lvalue (arg)))
3170 error ("invalid argument to gimple call");
3171 debug_generic_expr (arg);
3179 /* Verifies the gimple comparison with the result type TYPE and
3180 the operands OP0 and OP1. */
3183 verify_gimple_comparison (tree type, tree op0, tree op1)
3185 tree op0_type = TREE_TYPE (op0);
3186 tree op1_type = TREE_TYPE (op1);
3188 if (!is_gimple_val (op0) || !is_gimple_val (op1))
3190 error ("invalid operands in gimple comparison");
3194 /* For comparisons we do not have the operations type as the
3195 effective type the comparison is carried out in. Instead
3196 we require that either the first operand is trivially
3197 convertible into the second, or the other way around.
3198 The resulting type of a comparison may be any integral type.
3199 Because we special-case pointers to void we allow
3200 comparisons of pointers with the same mode as well. */
3201 if ((!useless_type_conversion_p (op0_type, op1_type)
3202 && !useless_type_conversion_p (op1_type, op0_type)
3203 && (!POINTER_TYPE_P (op0_type)
3204 || !POINTER_TYPE_P (op1_type)
3205 || TYPE_MODE (op0_type) != TYPE_MODE (op1_type)))
3206 || !INTEGRAL_TYPE_P (type))
3208 error ("type mismatch in comparison expression");
3209 debug_generic_expr (type);
3210 debug_generic_expr (op0_type);
3211 debug_generic_expr (op1_type);
3218 /* Verify a gimple assignment statement STMT with an unary rhs.
3219 Returns true if anything is wrong. */
3222 verify_gimple_assign_unary (gimple stmt)
3224 enum tree_code rhs_code = gimple_assign_rhs_code (stmt);
3225 tree lhs = gimple_assign_lhs (stmt);
3226 tree lhs_type = TREE_TYPE (lhs);
3227 tree rhs1 = gimple_assign_rhs1 (stmt);
3228 tree rhs1_type = TREE_TYPE (rhs1);
3230 if (!is_gimple_reg (lhs))
3232 error ("non-register as LHS of unary operation");
3236 if (!is_gimple_val (rhs1))
3238 error ("invalid operand in unary operation");
3242 /* First handle conversions. */
3247 /* Allow conversions between integral types and pointers only if
3248 there is no sign or zero extension involved.
3249 For targets were the precision of sizetype doesn't match that
3250 of pointers we need to allow arbitrary conversions from and
3252 if ((POINTER_TYPE_P (lhs_type)
3253 && INTEGRAL_TYPE_P (rhs1_type)
3254 && (TYPE_PRECISION (lhs_type) >= TYPE_PRECISION (rhs1_type)
3255 || rhs1_type == sizetype))
3256 || (POINTER_TYPE_P (rhs1_type)
3257 && INTEGRAL_TYPE_P (lhs_type)
3258 && (TYPE_PRECISION (rhs1_type) >= TYPE_PRECISION (lhs_type)
3259 || lhs_type == sizetype)))
3262 /* Allow conversion from integer to offset type and vice versa. */
3263 if ((TREE_CODE (lhs_type) == OFFSET_TYPE
3264 && TREE_CODE (rhs1_type) == INTEGER_TYPE)
3265 || (TREE_CODE (lhs_type) == INTEGER_TYPE
3266 && TREE_CODE (rhs1_type) == OFFSET_TYPE))
3269 /* Otherwise assert we are converting between types of the
3271 if (INTEGRAL_TYPE_P (lhs_type) != INTEGRAL_TYPE_P (rhs1_type))
3273 error ("invalid types in nop conversion");
3274 debug_generic_expr (lhs_type);
3275 debug_generic_expr (rhs1_type);
3282 case ADDR_SPACE_CONVERT_EXPR:
3284 if (!POINTER_TYPE_P (rhs1_type) || !POINTER_TYPE_P (lhs_type)
3285 || (TYPE_ADDR_SPACE (TREE_TYPE (rhs1_type))
3286 == TYPE_ADDR_SPACE (TREE_TYPE (lhs_type))))
3288 error ("invalid types in address space conversion");
3289 debug_generic_expr (lhs_type);
3290 debug_generic_expr (rhs1_type);
3297 case FIXED_CONVERT_EXPR:
3299 if (!valid_fixed_convert_types_p (lhs_type, rhs1_type)
3300 && !valid_fixed_convert_types_p (rhs1_type, lhs_type))
3302 error ("invalid types in fixed-point conversion");
3303 debug_generic_expr (lhs_type);
3304 debug_generic_expr (rhs1_type);
3313 if (!INTEGRAL_TYPE_P (rhs1_type) || !SCALAR_FLOAT_TYPE_P (lhs_type))
3315 error ("invalid types in conversion to floating point");
3316 debug_generic_expr (lhs_type);
3317 debug_generic_expr (rhs1_type);
3324 case FIX_TRUNC_EXPR:
3326 if (!INTEGRAL_TYPE_P (lhs_type) || !SCALAR_FLOAT_TYPE_P (rhs1_type))
3328 error ("invalid types in conversion to integer");
3329 debug_generic_expr (lhs_type);
3330 debug_generic_expr (rhs1_type);
3337 case VEC_UNPACK_HI_EXPR:
3338 case VEC_UNPACK_LO_EXPR:
3339 case REDUC_MAX_EXPR:
3340 case REDUC_MIN_EXPR:
3341 case REDUC_PLUS_EXPR:
3342 case VEC_UNPACK_FLOAT_HI_EXPR:
3343 case VEC_UNPACK_FLOAT_LO_EXPR:
3351 case NON_LVALUE_EXPR:
3359 /* For the remaining codes assert there is no conversion involved. */
3360 if (!useless_type_conversion_p (lhs_type, rhs1_type))
3362 error ("non-trivial conversion in unary operation");
3363 debug_generic_expr (lhs_type);
3364 debug_generic_expr (rhs1_type);
3371 /* Verify a gimple assignment statement STMT with a binary rhs.
3372 Returns true if anything is wrong. */
3375 verify_gimple_assign_binary (gimple stmt)
3377 enum tree_code rhs_code = gimple_assign_rhs_code (stmt);
3378 tree lhs = gimple_assign_lhs (stmt);
3379 tree lhs_type = TREE_TYPE (lhs);
3380 tree rhs1 = gimple_assign_rhs1 (stmt);
3381 tree rhs1_type = TREE_TYPE (rhs1);
3382 tree rhs2 = gimple_assign_rhs2 (stmt);
3383 tree rhs2_type = TREE_TYPE (rhs2);
3385 if (!is_gimple_reg (lhs))
3387 error ("non-register as LHS of binary operation");
3391 if (!is_gimple_val (rhs1)
3392 || !is_gimple_val (rhs2))
3394 error ("invalid operands in binary operation");
3398 /* First handle operations that involve different types. */
3403 if (TREE_CODE (lhs_type) != COMPLEX_TYPE
3404 || !(INTEGRAL_TYPE_P (rhs1_type)
3405 || SCALAR_FLOAT_TYPE_P (rhs1_type))
3406 || !(INTEGRAL_TYPE_P (rhs2_type)
3407 || SCALAR_FLOAT_TYPE_P (rhs2_type)))
3409 error ("type mismatch in complex expression");
3410 debug_generic_expr (lhs_type);
3411 debug_generic_expr (rhs1_type);
3412 debug_generic_expr (rhs2_type);
3424 /* Shifts and rotates are ok on integral types, fixed point
3425 types and integer vector types. */
3426 if ((!INTEGRAL_TYPE_P (rhs1_type)
3427 && !FIXED_POINT_TYPE_P (rhs1_type)
3428 && !(TREE_CODE (rhs1_type) == VECTOR_TYPE
3429 && INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type))))
3430 || (!INTEGRAL_TYPE_P (rhs2_type)
3431 /* Vector shifts of vectors are also ok. */
3432 && !(TREE_CODE (rhs1_type) == VECTOR_TYPE
3433 && INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type))
3434 && TREE_CODE (rhs2_type) == VECTOR_TYPE
3435 && INTEGRAL_TYPE_P (TREE_TYPE (rhs2_type))))
3436 || !useless_type_conversion_p (lhs_type, rhs1_type))
3438 error ("type mismatch in shift expression");
3439 debug_generic_expr (lhs_type);
3440 debug_generic_expr (rhs1_type);
3441 debug_generic_expr (rhs2_type);
3448 case VEC_LSHIFT_EXPR:
3449 case VEC_RSHIFT_EXPR:
3451 if (TREE_CODE (rhs1_type) != VECTOR_TYPE
3452 || !(INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type))
3453 || POINTER_TYPE_P (TREE_TYPE (rhs1_type))
3454 || FIXED_POINT_TYPE_P (TREE_TYPE (rhs1_type))
3455 || SCALAR_FLOAT_TYPE_P (TREE_TYPE (rhs1_type)))
3456 || (!INTEGRAL_TYPE_P (rhs2_type)
3457 && (TREE_CODE (rhs2_type) != VECTOR_TYPE
3458 || !INTEGRAL_TYPE_P (TREE_TYPE (rhs2_type))))
3459 || !useless_type_conversion_p (lhs_type, rhs1_type))
3461 error ("type mismatch in vector shift expression");
3462 debug_generic_expr (lhs_type);
3463 debug_generic_expr (rhs1_type);
3464 debug_generic_expr (rhs2_type);
3467 /* For shifting a vector of non-integral components we
3468 only allow shifting by a constant multiple of the element size. */
3469 if (!INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type))
3470 && (TREE_CODE (rhs2) != INTEGER_CST
3471 || !div_if_zero_remainder (EXACT_DIV_EXPR, rhs2,
3472 TYPE_SIZE (TREE_TYPE (rhs1_type)))))
3474 error ("non-element sized vector shift of floating point vector");
3484 /* We use regular PLUS_EXPR and MINUS_EXPR for vectors.
3485 ??? This just makes the checker happy and may not be what is
3487 if (TREE_CODE (lhs_type) == VECTOR_TYPE
3488 && POINTER_TYPE_P (TREE_TYPE (lhs_type)))
3490 if (TREE_CODE (rhs1_type) != VECTOR_TYPE
3491 || TREE_CODE (rhs2_type) != VECTOR_TYPE)
3493 error ("invalid non-vector operands to vector valued plus");
3496 lhs_type = TREE_TYPE (lhs_type);
3497 rhs1_type = TREE_TYPE (rhs1_type);
3498 rhs2_type = TREE_TYPE (rhs2_type);
3499 /* PLUS_EXPR is commutative, so we might end up canonicalizing
3500 the pointer to 2nd place. */
3501 if (POINTER_TYPE_P (rhs2_type))
3503 tree tem = rhs1_type;
3504 rhs1_type = rhs2_type;
3507 goto do_pointer_plus_expr_check;
3509 if (POINTER_TYPE_P (lhs_type)
3510 || POINTER_TYPE_P (rhs1_type)
3511 || POINTER_TYPE_P (rhs2_type))
3513 error ("invalid (pointer) operands to plus/minus");
3517 /* Continue with generic binary expression handling. */
3521 case POINTER_PLUS_EXPR:
3523 do_pointer_plus_expr_check:
3524 if (!POINTER_TYPE_P (rhs1_type)
3525 || !useless_type_conversion_p (lhs_type, rhs1_type)
3526 || !useless_type_conversion_p (sizetype, rhs2_type))
3528 error ("type mismatch in pointer plus expression");
3529 debug_generic_stmt (lhs_type);
3530 debug_generic_stmt (rhs1_type);
3531 debug_generic_stmt (rhs2_type);
3538 case TRUTH_ANDIF_EXPR:
3539 case TRUTH_ORIF_EXPR:
3540 case TRUTH_AND_EXPR:
3542 case TRUTH_XOR_EXPR:
3552 case UNORDERED_EXPR:
3560 /* Comparisons are also binary, but the result type is not
3561 connected to the operand types. */
3562 return verify_gimple_comparison (lhs_type, rhs1, rhs2);
3564 case WIDEN_MULT_EXPR:
3565 if (TREE_CODE (lhs_type) != INTEGER_TYPE)
3567 return ((2 * TYPE_PRECISION (rhs1_type) != TYPE_PRECISION (lhs_type))
3568 || (TYPE_PRECISION (rhs1_type) != TYPE_PRECISION (rhs2_type)));
3570 case WIDEN_SUM_EXPR:
3571 case VEC_WIDEN_MULT_HI_EXPR:
3572 case VEC_WIDEN_MULT_LO_EXPR:
3573 case VEC_PACK_TRUNC_EXPR:
3574 case VEC_PACK_SAT_EXPR:
3575 case VEC_PACK_FIX_TRUNC_EXPR:
3576 case VEC_EXTRACT_EVEN_EXPR:
3577 case VEC_EXTRACT_ODD_EXPR:
3578 case VEC_INTERLEAVE_HIGH_EXPR:
3579 case VEC_INTERLEAVE_LOW_EXPR:
3584 case TRUNC_DIV_EXPR:
3586 case FLOOR_DIV_EXPR:
3587 case ROUND_DIV_EXPR:
3588 case TRUNC_MOD_EXPR:
3590 case FLOOR_MOD_EXPR:
3591 case ROUND_MOD_EXPR:
3593 case EXACT_DIV_EXPR:
3599 /* Continue with generic binary expression handling. */
3606 if (!useless_type_conversion_p (lhs_type, rhs1_type)
3607 || !useless_type_conversion_p (lhs_type, rhs2_type))
3609 error ("type mismatch in binary expression");
3610 debug_generic_stmt (lhs_type);
3611 debug_generic_stmt (rhs1_type);
3612 debug_generic_stmt (rhs2_type);
3619 /* Verify a gimple assignment statement STMT with a ternary rhs.
3620 Returns true if anything is wrong. */
3623 verify_gimple_assign_ternary (gimple stmt)
3625 enum tree_code rhs_code = gimple_assign_rhs_code (stmt);
3626 tree lhs = gimple_assign_lhs (stmt);
3627 tree lhs_type = TREE_TYPE (lhs);
3628 tree rhs1 = gimple_assign_rhs1 (stmt);
3629 tree rhs1_type = TREE_TYPE (rhs1);
3630 tree rhs2 = gimple_assign_rhs2 (stmt);
3631 tree rhs2_type = TREE_TYPE (rhs2);
3632 tree rhs3 = gimple_assign_rhs3 (stmt);
3633 tree rhs3_type = TREE_TYPE (rhs3);
3635 if (!is_gimple_reg (lhs))
3637 error ("non-register as LHS of ternary operation");
3641 if (!is_gimple_val (rhs1)
3642 || !is_gimple_val (rhs2)
3643 || !is_gimple_val (rhs3))
3645 error ("invalid operands in ternary operation");
3649 /* First handle operations that involve different types. */
3652 case WIDEN_MULT_PLUS_EXPR:
3653 case WIDEN_MULT_MINUS_EXPR:
3654 if ((!INTEGRAL_TYPE_P (rhs1_type)
3655 && !FIXED_POINT_TYPE_P (rhs1_type))
3656 || !useless_type_conversion_p (rhs1_type, rhs2_type)
3657 || !useless_type_conversion_p (lhs_type, rhs3_type)
3658 || 2 * TYPE_PRECISION (rhs1_type) != TYPE_PRECISION (lhs_type)
3659 || TYPE_PRECISION (rhs1_type) != TYPE_PRECISION (rhs2_type))
3661 error ("type mismatch in widening multiply-accumulate expression");
3662 debug_generic_expr (lhs_type);
3663 debug_generic_expr (rhs1_type);
3664 debug_generic_expr (rhs2_type);
3665 debug_generic_expr (rhs3_type);
3671 if (!useless_type_conversion_p (lhs_type, rhs1_type)
3672 || !useless_type_conversion_p (lhs_type, rhs2_type)
3673 || !useless_type_conversion_p (lhs_type, rhs3_type))
3675 error ("type mismatch in fused multiply-add expression");
3676 debug_generic_expr (lhs_type);
3677 debug_generic_expr (rhs1_type);
3678 debug_generic_expr (rhs2_type);
3679 debug_generic_expr (rhs3_type);
3685 case REALIGN_LOAD_EXPR:
3695 /* Verify a gimple assignment statement STMT with a single rhs.
3696 Returns true if anything is wrong. */
3699 verify_gimple_assign_single (gimple stmt)
3701 enum tree_code rhs_code = gimple_assign_rhs_code (stmt);
3702 tree lhs = gimple_assign_lhs (stmt);
3703 tree lhs_type = TREE_TYPE (lhs);
3704 tree rhs1 = gimple_assign_rhs1 (stmt);
3705 tree rhs1_type = TREE_TYPE (rhs1);
3708 if (!useless_type_conversion_p (lhs_type, rhs1_type))
3710 error ("non-trivial conversion at assignment");
3711 debug_generic_expr (lhs_type);
3712 debug_generic_expr (rhs1_type);
3716 if (handled_component_p (lhs))
3717 res |= verify_types_in_gimple_reference (lhs, true);
3719 /* Special codes we cannot handle via their class. */
3724 tree op = TREE_OPERAND (rhs1, 0);
3725 if (!is_gimple_addressable (op))
3727 error ("invalid operand in unary expression");
3731 /* Technically there is no longer a need for matching types, but
3732 gimple hygiene asks for this check. In LTO we can end up
3733 combining incompatible units and thus end up with addresses
3734 of globals that change their type to a common one. */
3736 && !types_compatible_p (TREE_TYPE (op),
3737 TREE_TYPE (TREE_TYPE (rhs1)))
3738 && !one_pointer_to_useless_type_conversion_p (TREE_TYPE (rhs1),
3741 error ("type mismatch in address expression");
3742 debug_generic_stmt (TREE_TYPE (rhs1));
3743 debug_generic_stmt (TREE_TYPE (op));
3747 return verify_types_in_gimple_reference (op, true);
3752 error ("INDIRECT_REF in gimple IL");
3758 case ARRAY_RANGE_REF:
3759 case VIEW_CONVERT_EXPR:
3762 case TARGET_MEM_REF:
3764 if (!is_gimple_reg (lhs)
3765 && is_gimple_reg_type (TREE_TYPE (lhs)))
3767 error ("invalid rhs for gimple memory store");
3768 debug_generic_stmt (lhs);
3769 debug_generic_stmt (rhs1);
3772 return res || verify_types_in_gimple_reference (rhs1, false);
3784 /* tcc_declaration */
3789 if (!is_gimple_reg (lhs)
3790 && !is_gimple_reg (rhs1)
3791 && is_gimple_reg_type (TREE_TYPE (lhs)))
3793 error ("invalid rhs for gimple memory store");
3794 debug_generic_stmt (lhs);
3795 debug_generic_stmt (rhs1);
3801 if (!is_gimple_reg (lhs)
3802 || (!is_gimple_reg (TREE_OPERAND (rhs1, 0))
3803 && !COMPARISON_CLASS_P (TREE_OPERAND (rhs1, 0)))
3804 || (!is_gimple_reg (TREE_OPERAND (rhs1, 1))
3805 && !is_gimple_min_invariant (TREE_OPERAND (rhs1, 1)))
3806 || (!is_gimple_reg (TREE_OPERAND (rhs1, 2))
3807 && !is_gimple_min_invariant (TREE_OPERAND (rhs1, 2))))
3809 error ("invalid COND_EXPR in gimple assignment");
3810 debug_generic_stmt (rhs1);
3818 case WITH_SIZE_EXPR:
3829 /* Verify the contents of a GIMPLE_ASSIGN STMT. Returns true when there
3830 is a problem, otherwise false. */
3833 verify_gimple_assign (gimple stmt)
3835 switch (gimple_assign_rhs_class (stmt))
3837 case GIMPLE_SINGLE_RHS:
3838 return verify_gimple_assign_single (stmt);
3840 case GIMPLE_UNARY_RHS:
3841 return verify_gimple_assign_unary (stmt);
3843 case GIMPLE_BINARY_RHS:
3844 return verify_gimple_assign_binary (stmt);
3846 case GIMPLE_TERNARY_RHS:
3847 return verify_gimple_assign_ternary (stmt);
3854 /* Verify the contents of a GIMPLE_RETURN STMT. Returns true when there
3855 is a problem, otherwise false. */
3858 verify_gimple_return (gimple stmt)
3860 tree op = gimple_return_retval (stmt);
3861 tree restype = TREE_TYPE (TREE_TYPE (cfun->decl));
3863 /* We cannot test for present return values as we do not fix up missing
3864 return values from the original source. */
3868 if (!is_gimple_val (op)
3869 && TREE_CODE (op) != RESULT_DECL)
3871 error ("invalid operand in return statement");
3872 debug_generic_stmt (op);
3876 if ((TREE_CODE (op) == RESULT_DECL
3877 && DECL_BY_REFERENCE (op))
3878 || (TREE_CODE (op) == SSA_NAME
3879 && TREE_CODE (SSA_NAME_VAR (op)) == RESULT_DECL
3880 && DECL_BY_REFERENCE (SSA_NAME_VAR (op))))
3881 op = TREE_TYPE (op);
3883 if (!useless_type_conversion_p (restype, TREE_TYPE (op)))
3885 error ("invalid conversion in return statement");
3886 debug_generic_stmt (restype);
3887 debug_generic_stmt (TREE_TYPE (op));
3895 /* Verify the contents of a GIMPLE_GOTO STMT. Returns true when there
3896 is a problem, otherwise false. */
3899 verify_gimple_goto (gimple stmt)
3901 tree dest = gimple_goto_dest (stmt);
3903 /* ??? We have two canonical forms of direct goto destinations, a
3904 bare LABEL_DECL and an ADDR_EXPR of a LABEL_DECL. */
3905 if (TREE_CODE (dest) != LABEL_DECL
3906 && (!is_gimple_val (dest)
3907 || !POINTER_TYPE_P (TREE_TYPE (dest))))
3909 error ("goto destination is neither a label nor a pointer");
3916 /* Verify the contents of a GIMPLE_SWITCH STMT. Returns true when there
3917 is a problem, otherwise false. */
3920 verify_gimple_switch (gimple stmt)
3922 if (!is_gimple_val (gimple_switch_index (stmt)))
3924 error ("invalid operand to switch statement");
3925 debug_generic_stmt (gimple_switch_index (stmt));
3933 /* Verify a gimple debug statement STMT.
3934 Returns true if anything is wrong. */
3937 verify_gimple_debug (gimple stmt ATTRIBUTE_UNUSED)
3939 /* There isn't much that could be wrong in a gimple debug stmt. A
3940 gimple debug bind stmt, for example, maps a tree, that's usually
3941 a VAR_DECL or a PARM_DECL, but that could also be some scalarized
3942 component or member of an aggregate type, to another tree, that
3943 can be an arbitrary expression. These stmts expand into debug
3944 insns, and are converted to debug notes by var-tracking.c. */
3948 /* Verify a gimple label statement STMT.
3949 Returns true if anything is wrong. */
3952 verify_gimple_label (gimple stmt)
3954 tree decl = gimple_label_label (stmt);
3958 if (TREE_CODE (decl) != LABEL_DECL)
3961 uid = LABEL_DECL_UID (decl);
3964 || VEC_index (basic_block,
3965 label_to_block_map, uid) != gimple_bb (stmt)))
3967 error ("incorrect entry in label_to_block_map");
3971 uid = EH_LANDING_PAD_NR (decl);
3974 eh_landing_pad lp = get_eh_landing_pad_from_number (uid);
3975 if (decl != lp->post_landing_pad)
3977 error ("incorrect setting of landing pad number");
3985 /* Verify the GIMPLE statement STMT. Returns true if there is an
3986 error, otherwise false. */
3989 verify_gimple_stmt (gimple stmt)
3991 switch (gimple_code (stmt))
3994 return verify_gimple_assign (stmt);
3997 return verify_gimple_label (stmt);
4000 return verify_gimple_call (stmt);
4003 if (TREE_CODE_CLASS (gimple_cond_code (stmt)) != tcc_comparison)
4005 error ("invalid comparison code in gimple cond");
4008 if (!(!gimple_cond_true_label (stmt)
4009 || TREE_CODE (gimple_cond_true_label (stmt)) == LABEL_DECL)
4010 || !(!gimple_cond_false_label (stmt)
4011 || TREE_CODE (gimple_cond_false_label (stmt)) == LABEL_DECL))
4013 error ("invalid labels in gimple cond");
4017 return verify_gimple_comparison (boolean_type_node,
4018 gimple_cond_lhs (stmt),
4019 gimple_cond_rhs (stmt));
4022 return verify_gimple_goto (stmt);
4025 return verify_gimple_switch (stmt);
4028 return verify_gimple_return (stmt);
4033 /* Tuples that do not have tree operands. */
4035 case GIMPLE_PREDICT:
4037 case GIMPLE_EH_DISPATCH:
4038 case GIMPLE_EH_MUST_NOT_THROW:
4042 /* OpenMP directives are validated by the FE and never operated
4043 on by the optimizers. Furthermore, GIMPLE_OMP_FOR may contain
4044 non-gimple expressions when the main index variable has had
4045 its address taken. This does not affect the loop itself
4046 because the header of an GIMPLE_OMP_FOR is merely used to determine
4047 how to setup the parallel iteration. */
4051 return verify_gimple_debug (stmt);
4058 /* Verify the contents of a GIMPLE_PHI. Returns true if there is a problem,
4059 and false otherwise. */
4062 verify_gimple_phi (gimple phi)
4066 tree phi_result = gimple_phi_result (phi);
4071 error ("invalid PHI result");
4075 virtual_p = !is_gimple_reg (phi_result);
4076 if (TREE_CODE (phi_result) != SSA_NAME
4078 && SSA_NAME_VAR (phi_result) != gimple_vop (cfun)))
4080 error ("invalid PHI result");
4084 for (i = 0; i < gimple_phi_num_args (phi); i++)
4086 tree t = gimple_phi_arg_def (phi, i);
4090 error ("missing PHI def");
4094 /* Addressable variables do have SSA_NAMEs but they
4095 are not considered gimple values. */
4096 else if ((TREE_CODE (t) == SSA_NAME
4097 && virtual_p != !is_gimple_reg (t))
4099 && (TREE_CODE (t) != SSA_NAME
4100 || SSA_NAME_VAR (t) != gimple_vop (cfun)))
4102 && !is_gimple_val (t)))
4104 error ("invalid PHI argument");
4105 debug_generic_expr (t);
4108 #ifdef ENABLE_TYPES_CHECKING
4109 if (!useless_type_conversion_p (TREE_TYPE (phi_result), TREE_TYPE (t)))
4111 error ("incompatible types in PHI argument %u", i);
4112 debug_generic_stmt (TREE_TYPE (phi_result));
4113 debug_generic_stmt (TREE_TYPE (t));
4122 /* Verify the GIMPLE statements inside the sequence STMTS. */
4125 verify_gimple_in_seq_2 (gimple_seq stmts)
4127 gimple_stmt_iterator ittr;
4130 for (ittr = gsi_start (stmts); !gsi_end_p (ittr); gsi_next (&ittr))
4132 gimple stmt = gsi_stmt (ittr);
4134 switch (gimple_code (stmt))
4137 err |= verify_gimple_in_seq_2 (gimple_bind_body (stmt));
4141 err |= verify_gimple_in_seq_2 (gimple_try_eval (stmt));
4142 err |= verify_gimple_in_seq_2 (gimple_try_cleanup (stmt));
4145 case GIMPLE_EH_FILTER:
4146 err |= verify_gimple_in_seq_2 (gimple_eh_filter_failure (stmt));
4150 err |= verify_gimple_in_seq_2 (gimple_catch_handler (stmt));
4155 bool err2 = verify_gimple_stmt (stmt);
4157 debug_gimple_stmt (stmt);
4167 /* Verify the GIMPLE statements inside the statement list STMTS. */
4170 verify_gimple_in_seq (gimple_seq stmts)
4172 timevar_push (TV_TREE_STMT_VERIFY);
4173 if (verify_gimple_in_seq_2 (stmts))
4174 internal_error ("verify_gimple failed");
4175 timevar_pop (TV_TREE_STMT_VERIFY);
4178 /* Return true when the T can be shared. */
4181 tree_node_can_be_shared (tree t)
4183 if (IS_TYPE_OR_DECL_P (t)
4184 || is_gimple_min_invariant (t)
4185 || TREE_CODE (t) == SSA_NAME
4186 || t == error_mark_node
4187 || TREE_CODE (t) == IDENTIFIER_NODE)
4190 if (TREE_CODE (t) == CASE_LABEL_EXPR)
4193 while (((TREE_CODE (t) == ARRAY_REF || TREE_CODE (t) == ARRAY_RANGE_REF)
4194 && is_gimple_min_invariant (TREE_OPERAND (t, 1)))
4195 || TREE_CODE (t) == COMPONENT_REF
4196 || TREE_CODE (t) == REALPART_EXPR
4197 || TREE_CODE (t) == IMAGPART_EXPR)
4198 t = TREE_OPERAND (t, 0);
4206 /* Called via walk_gimple_stmt. Verify tree sharing. */
4209 verify_node_sharing (tree *tp, int *walk_subtrees, void *data)
4211 struct walk_stmt_info *wi = (struct walk_stmt_info *) data;
4212 struct pointer_set_t *visited = (struct pointer_set_t *) wi->info;
4214 if (tree_node_can_be_shared (*tp))
4216 *walk_subtrees = false;
4220 if (pointer_set_insert (visited, *tp))
4226 static bool eh_error_found;
4228 verify_eh_throw_stmt_node (void **slot, void *data)
4230 struct throw_stmt_node *node = (struct throw_stmt_node *)*slot;
4231 struct pointer_set_t *visited = (struct pointer_set_t *) data;
4233 if (!pointer_set_contains (visited, node->stmt))
4235 error ("dead STMT in EH table");
4236 debug_gimple_stmt (node->stmt);
4237 eh_error_found = true;
4242 /* Verify the GIMPLE statements in the CFG of FN. */
4245 verify_gimple_in_cfg (struct function *fn)
4249 struct pointer_set_t *visited, *visited_stmts;
4251 timevar_push (TV_TREE_STMT_VERIFY);
4252 visited = pointer_set_create ();
4253 visited_stmts = pointer_set_create ();
4255 FOR_EACH_BB_FN (bb, fn)
4257 gimple_stmt_iterator gsi;
4259 for (gsi = gsi_start_phis (bb); !gsi_end_p (gsi); gsi_next (&gsi))
4261 gimple phi = gsi_stmt (gsi);
4265 pointer_set_insert (visited_stmts, phi);
4267 if (gimple_bb (phi) != bb)
4269 error ("gimple_bb (phi) is set to a wrong basic block");
4273 err2 |= verify_gimple_phi (phi);
4275 for (i = 0; i < gimple_phi_num_args (phi); i++)
4277 tree arg = gimple_phi_arg_def (phi, i);
4278 tree addr = walk_tree (&arg, verify_node_sharing, visited, NULL);
4281 error ("incorrect sharing of tree nodes");
4282 debug_generic_expr (addr);
4288 debug_gimple_stmt (phi);
4292 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
4294 gimple stmt = gsi_stmt (gsi);
4296 struct walk_stmt_info wi;
4300 pointer_set_insert (visited_stmts, stmt);
4302 if (gimple_bb (stmt) != bb)
4304 error ("gimple_bb (stmt) is set to a wrong basic block");
4308 err2 |= verify_gimple_stmt (stmt);
4310 memset (&wi, 0, sizeof (wi));
4311 wi.info = (void *) visited;
4312 addr = walk_gimple_op (stmt, verify_node_sharing, &wi);
4315 error ("incorrect sharing of tree nodes");
4316 debug_generic_expr (addr);
4320 /* ??? Instead of not checking these stmts at all the walker
4321 should know its context via wi. */
4322 if (!is_gimple_debug (stmt)
4323 && !is_gimple_omp (stmt))
4325 memset (&wi, 0, sizeof (wi));
4326 addr = walk_gimple_op (stmt, verify_expr, &wi);
4329 debug_generic_expr (addr);
4330 inform (gimple_location (stmt), "in statement");
4335 /* If the statement is marked as part of an EH region, then it is
4336 expected that the statement could throw. Verify that when we
4337 have optimizations that simplify statements such that we prove
4338 that they cannot throw, that we update other data structures
4340 lp_nr = lookup_stmt_eh_lp (stmt);
4343 if (!stmt_could_throw_p (stmt))
4345 error ("statement marked for throw, but doesn%'t");
4349 && !gsi_one_before_end_p (gsi)
4350 && stmt_can_throw_internal (stmt))
4352 error ("statement marked for throw in middle of block");
4358 debug_gimple_stmt (stmt);
4363 eh_error_found = false;
4364 if (get_eh_throw_stmt_table (cfun))
4365 htab_traverse (get_eh_throw_stmt_table (cfun),
4366 verify_eh_throw_stmt_node,
4369 if (err || eh_error_found)
4370 internal_error ("verify_gimple failed");
4372 pointer_set_destroy (visited);
4373 pointer_set_destroy (visited_stmts);
4374 verify_histograms ();
4375 timevar_pop (TV_TREE_STMT_VERIFY);
4379 /* Verifies that the flow information is OK. */
4382 gimple_verify_flow_info (void)
4386 gimple_stmt_iterator gsi;
4391 if (ENTRY_BLOCK_PTR->il.gimple)
4393 error ("ENTRY_BLOCK has IL associated with it");
4397 if (EXIT_BLOCK_PTR->il.gimple)
4399 error ("EXIT_BLOCK has IL associated with it");
4403 FOR_EACH_EDGE (e, ei, EXIT_BLOCK_PTR->preds)
4404 if (e->flags & EDGE_FALLTHRU)
4406 error ("fallthru to exit from bb %d", e->src->index);
4412 bool found_ctrl_stmt = false;
4416 /* Skip labels on the start of basic block. */
4417 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
4420 gimple prev_stmt = stmt;
4422 stmt = gsi_stmt (gsi);
4424 if (gimple_code (stmt) != GIMPLE_LABEL)
4427 label = gimple_label_label (stmt);
4428 if (prev_stmt && DECL_NONLOCAL (label))
4430 error ("nonlocal label ");
4431 print_generic_expr (stderr, label, 0);
4432 fprintf (stderr, " is not first in a sequence of labels in bb %d",
4437 if (prev_stmt && EH_LANDING_PAD_NR (label) != 0)
4439 error ("EH landing pad label ");
4440 print_generic_expr (stderr, label, 0);
4441 fprintf (stderr, " is not first in a sequence of labels in bb %d",
4446 if (label_to_block (label) != bb)
4449 print_generic_expr (stderr, label, 0);
4450 fprintf (stderr, " to block does not match in bb %d",
4455 if (decl_function_context (label) != current_function_decl)
4458 print_generic_expr (stderr, label, 0);
4459 fprintf (stderr, " has incorrect context in bb %d",
4465 /* Verify that body of basic block BB is free of control flow. */
4466 for (; !gsi_end_p (gsi); gsi_next (&gsi))
4468 gimple stmt = gsi_stmt (gsi);
4470 if (found_ctrl_stmt)
4472 error ("control flow in the middle of basic block %d",
4477 if (stmt_ends_bb_p (stmt))
4478 found_ctrl_stmt = true;
4480 if (gimple_code (stmt) == GIMPLE_LABEL)
4483 print_generic_expr (stderr, gimple_label_label (stmt), 0);
4484 fprintf (stderr, " in the middle of basic block %d", bb->index);
4489 gsi = gsi_last_bb (bb);
4490 if (gsi_end_p (gsi))
4493 stmt = gsi_stmt (gsi);
4495 if (gimple_code (stmt) == GIMPLE_LABEL)
4498 err |= verify_eh_edges (stmt);
4500 if (is_ctrl_stmt (stmt))
4502 FOR_EACH_EDGE (e, ei, bb->succs)
4503 if (e->flags & EDGE_FALLTHRU)
4505 error ("fallthru edge after a control statement in bb %d",
4511 if (gimple_code (stmt) != GIMPLE_COND)
4513 /* Verify that there are no edges with EDGE_TRUE/FALSE_FLAG set
4514 after anything else but if statement. */
4515 FOR_EACH_EDGE (e, ei, bb->succs)
4516 if (e->flags & (EDGE_TRUE_VALUE | EDGE_FALSE_VALUE))
4518 error ("true/false edge after a non-GIMPLE_COND in bb %d",
4524 switch (gimple_code (stmt))
4531 extract_true_false_edges_from_block (bb, &true_edge, &false_edge);
4535 || !(true_edge->flags & EDGE_TRUE_VALUE)
4536 || !(false_edge->flags & EDGE_FALSE_VALUE)
4537 || (true_edge->flags & (EDGE_FALLTHRU | EDGE_ABNORMAL))
4538 || (false_edge->flags & (EDGE_FALLTHRU | EDGE_ABNORMAL))
4539 || EDGE_COUNT (bb->succs) >= 3)
4541 error ("wrong outgoing edge flags at end of bb %d",
4549 if (simple_goto_p (stmt))
4551 error ("explicit goto at end of bb %d", bb->index);
4556 /* FIXME. We should double check that the labels in the
4557 destination blocks have their address taken. */
4558 FOR_EACH_EDGE (e, ei, bb->succs)
4559 if ((e->flags & (EDGE_FALLTHRU | EDGE_TRUE_VALUE
4560 | EDGE_FALSE_VALUE))
4561 || !(e->flags & EDGE_ABNORMAL))
4563 error ("wrong outgoing edge flags at end of bb %d",
4571 if (!gimple_call_builtin_p (stmt, BUILT_IN_RETURN))
4573 /* ... fallthru ... */
4575 if (!single_succ_p (bb)
4576 || (single_succ_edge (bb)->flags
4577 & (EDGE_FALLTHRU | EDGE_ABNORMAL
4578 | EDGE_TRUE_VALUE | EDGE_FALSE_VALUE)))
4580 error ("wrong outgoing edge flags at end of bb %d", bb->index);
4583 if (single_succ (bb) != EXIT_BLOCK_PTR)
4585 error ("return edge does not point to exit in bb %d",
4597 n = gimple_switch_num_labels (stmt);
4599 /* Mark all the destination basic blocks. */
4600 for (i = 0; i < n; ++i)
4602 tree lab = CASE_LABEL (gimple_switch_label (stmt, i));
4603 basic_block label_bb = label_to_block (lab);
4604 gcc_assert (!label_bb->aux || label_bb->aux == (void *)1);
4605 label_bb->aux = (void *)1;
4608 /* Verify that the case labels are sorted. */
4609 prev = gimple_switch_label (stmt, 0);
4610 for (i = 1; i < n; ++i)
4612 tree c = gimple_switch_label (stmt, i);
4615 error ("found default case not at the start of "
4621 && !tree_int_cst_lt (CASE_LOW (prev), CASE_LOW (c)))
4623 error ("case labels not sorted: ");
4624 print_generic_expr (stderr, prev, 0);
4625 fprintf (stderr," is greater than ");
4626 print_generic_expr (stderr, c, 0);
4627 fprintf (stderr," but comes before it.\n");
4632 /* VRP will remove the default case if it can prove it will
4633 never be executed. So do not verify there always exists
4634 a default case here. */
4636 FOR_EACH_EDGE (e, ei, bb->succs)
4640 error ("extra outgoing edge %d->%d",
4641 bb->index, e->dest->index);
4645 e->dest->aux = (void *)2;
4646 if ((e->flags & (EDGE_FALLTHRU | EDGE_ABNORMAL
4647 | EDGE_TRUE_VALUE | EDGE_FALSE_VALUE)))
4649 error ("wrong outgoing edge flags at end of bb %d",
4655 /* Check that we have all of them. */
4656 for (i = 0; i < n; ++i)
4658 tree lab = CASE_LABEL (gimple_switch_label (stmt, i));
4659 basic_block label_bb = label_to_block (lab);
4661 if (label_bb->aux != (void *)2)
4663 error ("missing edge %i->%i", bb->index, label_bb->index);
4668 FOR_EACH_EDGE (e, ei, bb->succs)
4669 e->dest->aux = (void *)0;
4673 case GIMPLE_EH_DISPATCH:
4674 err |= verify_eh_dispatch_edge (stmt);
4682 if (dom_info_state (CDI_DOMINATORS) >= DOM_NO_FAST_QUERY)
4683 verify_dominators (CDI_DOMINATORS);
4689 /* Updates phi nodes after creating a forwarder block joined
4690 by edge FALLTHRU. */
4693 gimple_make_forwarder_block (edge fallthru)
4697 basic_block dummy, bb;
4699 gimple_stmt_iterator gsi;
4701 dummy = fallthru->src;
4702 bb = fallthru->dest;
4704 if (single_pred_p (bb))
4707 /* If we redirected a branch we must create new PHI nodes at the
4709 for (gsi = gsi_start_phis (dummy); !gsi_end_p (gsi); gsi_next (&gsi))
4711 gimple phi, new_phi;
4713 phi = gsi_stmt (gsi);
4714 var = gimple_phi_result (phi);
4715 new_phi = create_phi_node (var, bb);
4716 SSA_NAME_DEF_STMT (var) = new_phi;
4717 gimple_phi_set_result (phi, make_ssa_name (SSA_NAME_VAR (var), phi));
4718 add_phi_arg (new_phi, gimple_phi_result (phi), fallthru,
4722 /* Add the arguments we have stored on edges. */
4723 FOR_EACH_EDGE (e, ei, bb->preds)
4728 flush_pending_stmts (e);
4733 /* Return a non-special label in the head of basic block BLOCK.
4734 Create one if it doesn't exist. */
4737 gimple_block_label (basic_block bb)
4739 gimple_stmt_iterator i, s = gsi_start_bb (bb);
4744 for (i = s; !gsi_end_p (i); first = false, gsi_next (&i))
4746 stmt = gsi_stmt (i);
4747 if (gimple_code (stmt) != GIMPLE_LABEL)
4749 label = gimple_label_label (stmt);
4750 if (!DECL_NONLOCAL (label))
4753 gsi_move_before (&i, &s);
4758 label = create_artificial_label (UNKNOWN_LOCATION);
4759 stmt = gimple_build_label (label);
4760 gsi_insert_before (&s, stmt, GSI_NEW_STMT);
4765 /* Attempt to perform edge redirection by replacing a possibly complex
4766 jump instruction by a goto or by removing the jump completely.
4767 This can apply only if all edges now point to the same block. The
4768 parameters and return values are equivalent to
4769 redirect_edge_and_branch. */
4772 gimple_try_redirect_by_replacing_jump (edge e, basic_block target)
4774 basic_block src = e->src;
4775 gimple_stmt_iterator i;
4778 /* We can replace or remove a complex jump only when we have exactly
4780 if (EDGE_COUNT (src->succs) != 2
4781 /* Verify that all targets will be TARGET. Specifically, the
4782 edge that is not E must also go to TARGET. */
4783 || EDGE_SUCC (src, EDGE_SUCC (src, 0) == e)->dest != target)
4786 i = gsi_last_bb (src);
4790 stmt = gsi_stmt (i);
4792 if (gimple_code (stmt) == GIMPLE_COND || gimple_code (stmt) == GIMPLE_SWITCH)
4794 gsi_remove (&i, true);
4795 e = ssa_redirect_edge (e, target);
4796 e->flags = EDGE_FALLTHRU;
4804 /* Redirect E to DEST. Return NULL on failure. Otherwise, return the
4805 edge representing the redirected branch. */
4808 gimple_redirect_edge_and_branch (edge e, basic_block dest)
4810 basic_block bb = e->src;
4811 gimple_stmt_iterator gsi;
4815 if (e->flags & EDGE_ABNORMAL)
4818 if (e->dest == dest)
4821 if (e->flags & EDGE_EH)
4822 return redirect_eh_edge (e, dest);
4824 if (e->src != ENTRY_BLOCK_PTR)
4826 ret = gimple_try_redirect_by_replacing_jump (e, dest);
4831 gsi = gsi_last_bb (bb);
4832 stmt = gsi_end_p (gsi) ? NULL : gsi_stmt (gsi);
4834 switch (stmt ? gimple_code (stmt) : GIMPLE_ERROR_MARK)
4837 /* For COND_EXPR, we only need to redirect the edge. */
4841 /* No non-abnormal edges should lead from a non-simple goto, and
4842 simple ones should be represented implicitly. */
4847 tree label = gimple_block_label (dest);
4848 tree cases = get_cases_for_edge (e, stmt);
4850 /* If we have a list of cases associated with E, then use it
4851 as it's a lot faster than walking the entire case vector. */
4854 edge e2 = find_edge (e->src, dest);
4861 CASE_LABEL (cases) = label;
4862 cases = CASE_CHAIN (cases);
4865 /* If there was already an edge in the CFG, then we need
4866 to move all the cases associated with E to E2. */
4869 tree cases2 = get_cases_for_edge (e2, stmt);
4871 CASE_CHAIN (last) = CASE_CHAIN (cases2);
4872 CASE_CHAIN (cases2) = first;
4874 bitmap_set_bit (touched_switch_bbs, gimple_bb (stmt)->index);
4878 size_t i, n = gimple_switch_num_labels (stmt);
4880 for (i = 0; i < n; i++)
4882 tree elt = gimple_switch_label (stmt, i);
4883 if (label_to_block (CASE_LABEL (elt)) == e->dest)
4884 CASE_LABEL (elt) = label;
4892 int i, n = gimple_asm_nlabels (stmt);
4895 for (i = 0; i < n; ++i)
4897 tree cons = gimple_asm_label_op (stmt, i);
4898 if (label_to_block (TREE_VALUE (cons)) == e->dest)
4901 label = gimple_block_label (dest);
4902 TREE_VALUE (cons) = label;
4906 /* If we didn't find any label matching the former edge in the
4907 asm labels, we must be redirecting the fallthrough
4909 gcc_assert (label || (e->flags & EDGE_FALLTHRU));
4914 gsi_remove (&gsi, true);
4915 e->flags |= EDGE_FALLTHRU;
4918 case GIMPLE_OMP_RETURN:
4919 case GIMPLE_OMP_CONTINUE:
4920 case GIMPLE_OMP_SECTIONS_SWITCH:
4921 case GIMPLE_OMP_FOR:
4922 /* The edges from OMP constructs can be simply redirected. */
4925 case GIMPLE_EH_DISPATCH:
4926 if (!(e->flags & EDGE_FALLTHRU))
4927 redirect_eh_dispatch_edge (stmt, e, dest);
4931 /* Otherwise it must be a fallthru edge, and we don't need to
4932 do anything besides redirecting it. */
4933 gcc_assert (e->flags & EDGE_FALLTHRU);
4937 /* Update/insert PHI nodes as necessary. */
4939 /* Now update the edges in the CFG. */
4940 e = ssa_redirect_edge (e, dest);
4945 /* Returns true if it is possible to remove edge E by redirecting
4946 it to the destination of the other edge from E->src. */
4949 gimple_can_remove_branch_p (const_edge e)
4951 if (e->flags & (EDGE_ABNORMAL | EDGE_EH))
4957 /* Simple wrapper, as we can always redirect fallthru edges. */
4960 gimple_redirect_edge_and_branch_force (edge e, basic_block dest)
4962 e = gimple_redirect_edge_and_branch (e, dest);
4969 /* Splits basic block BB after statement STMT (but at least after the
4970 labels). If STMT is NULL, BB is split just after the labels. */
4973 gimple_split_block (basic_block bb, void *stmt)
4975 gimple_stmt_iterator gsi;
4976 gimple_stmt_iterator gsi_tgt;
4983 new_bb = create_empty_bb (bb);
4985 /* Redirect the outgoing edges. */
4986 new_bb->succs = bb->succs;
4988 FOR_EACH_EDGE (e, ei, new_bb->succs)
4991 if (stmt && gimple_code ((gimple) stmt) == GIMPLE_LABEL)
4994 /* Move everything from GSI to the new basic block. */
4995 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
4997 act = gsi_stmt (gsi);
4998 if (gimple_code (act) == GIMPLE_LABEL)
5011 if (gsi_end_p (gsi))
5014 /* Split the statement list - avoid re-creating new containers as this
5015 brings ugly quadratic memory consumption in the inliner.
5016 (We are still quadratic since we need to update stmt BB pointers,
5018 list = gsi_split_seq_before (&gsi);
5019 set_bb_seq (new_bb, list);
5020 for (gsi_tgt = gsi_start (list);
5021 !gsi_end_p (gsi_tgt); gsi_next (&gsi_tgt))
5022 gimple_set_bb (gsi_stmt (gsi_tgt), new_bb);
5028 /* Moves basic block BB after block AFTER. */
5031 gimple_move_block_after (basic_block bb, basic_block after)
5033 if (bb->prev_bb == after)
5037 link_block (bb, after);
5043 /* Return true if basic_block can be duplicated. */
5046 gimple_can_duplicate_bb_p (const_basic_block bb ATTRIBUTE_UNUSED)
5051 /* Create a duplicate of the basic block BB. NOTE: This does not
5052 preserve SSA form. */
5055 gimple_duplicate_bb (basic_block bb)
5058 gimple_stmt_iterator gsi, gsi_tgt;
5059 gimple_seq phis = phi_nodes (bb);
5060 gimple phi, stmt, copy;
5062 new_bb = create_empty_bb (EXIT_BLOCK_PTR->prev_bb);
5064 /* Copy the PHI nodes. We ignore PHI node arguments here because
5065 the incoming edges have not been setup yet. */
5066 for (gsi = gsi_start (phis); !gsi_end_p (gsi); gsi_next (&gsi))
5068 phi = gsi_stmt (gsi);
5069 copy = create_phi_node (gimple_phi_result (phi), new_bb);
5070 create_new_def_for (gimple_phi_result (copy), copy,
5071 gimple_phi_result_ptr (copy));
5074 gsi_tgt = gsi_start_bb (new_bb);
5075 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
5077 def_operand_p def_p;
5078 ssa_op_iter op_iter;
5081 stmt = gsi_stmt (gsi);
5082 if (gimple_code (stmt) == GIMPLE_LABEL)
5085 /* Create a new copy of STMT and duplicate STMT's virtual
5087 copy = gimple_copy (stmt);
5088 gsi_insert_after (&gsi_tgt, copy, GSI_NEW_STMT);
5090 maybe_duplicate_eh_stmt (copy, stmt);
5091 gimple_duplicate_stmt_histograms (cfun, copy, cfun, stmt);
5093 /* When copying around a stmt writing into a local non-user
5094 aggregate, make sure it won't share stack slot with other
5096 lhs = gimple_get_lhs (stmt);
5097 if (lhs && TREE_CODE (lhs) != SSA_NAME)
5099 tree base = get_base_address (lhs);
5101 && (TREE_CODE (base) == VAR_DECL
5102 || TREE_CODE (base) == RESULT_DECL)
5103 && DECL_IGNORED_P (base)
5104 && !TREE_STATIC (base)
5105 && !DECL_EXTERNAL (base)
5106 && (TREE_CODE (base) != VAR_DECL
5107 || !DECL_HAS_VALUE_EXPR_P (base)))
5108 DECL_NONSHAREABLE (base) = 1;
5111 /* Create new names for all the definitions created by COPY and
5112 add replacement mappings for each new name. */
5113 FOR_EACH_SSA_DEF_OPERAND (def_p, copy, op_iter, SSA_OP_ALL_DEFS)
5114 create_new_def_for (DEF_FROM_PTR (def_p), copy, def_p);
5120 /* Adds phi node arguments for edge E_COPY after basic block duplication. */
5123 add_phi_args_after_copy_edge (edge e_copy)
5125 basic_block bb, bb_copy = e_copy->src, dest;
5128 gimple phi, phi_copy;
5130 gimple_stmt_iterator psi, psi_copy;
5132 if (gimple_seq_empty_p (phi_nodes (e_copy->dest)))
5135 bb = bb_copy->flags & BB_DUPLICATED ? get_bb_original (bb_copy) : bb_copy;
5137 if (e_copy->dest->flags & BB_DUPLICATED)
5138 dest = get_bb_original (e_copy->dest);
5140 dest = e_copy->dest;
5142 e = find_edge (bb, dest);
5145 /* During loop unrolling the target of the latch edge is copied.
5146 In this case we are not looking for edge to dest, but to
5147 duplicated block whose original was dest. */
5148 FOR_EACH_EDGE (e, ei, bb->succs)
5150 if ((e->dest->flags & BB_DUPLICATED)
5151 && get_bb_original (e->dest) == dest)
5155 gcc_assert (e != NULL);
5158 for (psi = gsi_start_phis (e->dest),
5159 psi_copy = gsi_start_phis (e_copy->dest);
5161 gsi_next (&psi), gsi_next (&psi_copy))
5163 phi = gsi_stmt (psi);
5164 phi_copy = gsi_stmt (psi_copy);
5165 def = PHI_ARG_DEF_FROM_EDGE (phi, e);
5166 add_phi_arg (phi_copy, def, e_copy,
5167 gimple_phi_arg_location_from_edge (phi, e));
5172 /* Basic block BB_COPY was created by code duplication. Add phi node
5173 arguments for edges going out of BB_COPY. The blocks that were
5174 duplicated have BB_DUPLICATED set. */
5177 add_phi_args_after_copy_bb (basic_block bb_copy)
5182 FOR_EACH_EDGE (e_copy, ei, bb_copy->succs)
5184 add_phi_args_after_copy_edge (e_copy);
5188 /* Blocks in REGION_COPY array of length N_REGION were created by
5189 duplication of basic blocks. Add phi node arguments for edges
5190 going from these blocks. If E_COPY is not NULL, also add
5191 phi node arguments for its destination.*/
5194 add_phi_args_after_copy (basic_block *region_copy, unsigned n_region,
5199 for (i = 0; i < n_region; i++)
5200 region_copy[i]->flags |= BB_DUPLICATED;
5202 for (i = 0; i < n_region; i++)
5203 add_phi_args_after_copy_bb (region_copy[i]);
5205 add_phi_args_after_copy_edge (e_copy);
5207 for (i = 0; i < n_region; i++)
5208 region_copy[i]->flags &= ~BB_DUPLICATED;
5211 /* Duplicates a REGION (set of N_REGION basic blocks) with just a single
5212 important exit edge EXIT. By important we mean that no SSA name defined
5213 inside region is live over the other exit edges of the region. All entry
5214 edges to the region must go to ENTRY->dest. The edge ENTRY is redirected
5215 to the duplicate of the region. SSA form, dominance and loop information
5216 is updated. The new basic blocks are stored to REGION_COPY in the same
5217 order as they had in REGION, provided that REGION_COPY is not NULL.
5218 The function returns false if it is unable to copy the region,
5222 gimple_duplicate_sese_region (edge entry, edge exit,
5223 basic_block *region, unsigned n_region,
5224 basic_block *region_copy)
5227 bool free_region_copy = false, copying_header = false;
5228 struct loop *loop = entry->dest->loop_father;
5230 VEC (basic_block, heap) *doms;
5232 int total_freq = 0, entry_freq = 0;
5233 gcov_type total_count = 0, entry_count = 0;
5235 if (!can_copy_bbs_p (region, n_region))
5238 /* Some sanity checking. Note that we do not check for all possible
5239 missuses of the functions. I.e. if you ask to copy something weird,
5240 it will work, but the state of structures probably will not be
5242 for (i = 0; i < n_region; i++)
5244 /* We do not handle subloops, i.e. all the blocks must belong to the
5246 if (region[i]->loop_father != loop)
5249 if (region[i] != entry->dest
5250 && region[i] == loop->header)
5254 set_loop_copy (loop, loop);
5256 /* In case the function is used for loop header copying (which is the primary
5257 use), ensure that EXIT and its copy will be new latch and entry edges. */
5258 if (loop->header == entry->dest)
5260 copying_header = true;
5261 set_loop_copy (loop, loop_outer (loop));
5263 if (!dominated_by_p (CDI_DOMINATORS, loop->latch, exit->src))
5266 for (i = 0; i < n_region; i++)
5267 if (region[i] != exit->src
5268 && dominated_by_p (CDI_DOMINATORS, region[i], exit->src))
5274 region_copy = XNEWVEC (basic_block, n_region);
5275 free_region_copy = true;
5278 gcc_assert (!need_ssa_update_p (cfun));
5280 /* Record blocks outside the region that are dominated by something
5283 initialize_original_copy_tables ();
5285 doms = get_dominated_by_region (CDI_DOMINATORS, region, n_region);
5287 if (entry->dest->count)
5289 total_count = entry->dest->count;
5290 entry_count = entry->count;
5291 /* Fix up corner cases, to avoid division by zero or creation of negative
5293 if (entry_count > total_count)
5294 entry_count = total_count;
5298 total_freq = entry->dest->frequency;
5299 entry_freq = EDGE_FREQUENCY (entry);
5300 /* Fix up corner cases, to avoid division by zero or creation of negative
5302 if (total_freq == 0)
5304 else if (entry_freq > total_freq)
5305 entry_freq = total_freq;
5308 copy_bbs (region, n_region, region_copy, &exit, 1, &exit_copy, loop,
5309 split_edge_bb_loc (entry));
5312 scale_bbs_frequencies_gcov_type (region, n_region,
5313 total_count - entry_count,
5315 scale_bbs_frequencies_gcov_type (region_copy, n_region, entry_count,
5320 scale_bbs_frequencies_int (region, n_region, total_freq - entry_freq,
5322 scale_bbs_frequencies_int (region_copy, n_region, entry_freq, total_freq);
5327 loop->header = exit->dest;
5328 loop->latch = exit->src;
5331 /* Redirect the entry and add the phi node arguments. */
5332 redirected = redirect_edge_and_branch (entry, get_bb_copy (entry->dest));
5333 gcc_assert (redirected != NULL);
5334 flush_pending_stmts (entry);
5336 /* Concerning updating of dominators: We must recount dominators
5337 for entry block and its copy. Anything that is outside of the
5338 region, but was dominated by something inside needs recounting as
5340 set_immediate_dominator (CDI_DOMINATORS, entry->dest, entry->src);
5341 VEC_safe_push (basic_block, heap, doms, get_bb_original (entry->dest));
5342 iterate_fix_dominators (CDI_DOMINATORS, doms, false);
5343 VEC_free (basic_block, heap, doms);
5345 /* Add the other PHI node arguments. */
5346 add_phi_args_after_copy (region_copy, n_region, NULL);
5348 /* Update the SSA web. */
5349 update_ssa (TODO_update_ssa);
5351 if (free_region_copy)
5354 free_original_copy_tables ();
5358 /* Duplicates REGION consisting of N_REGION blocks. The new blocks
5359 are stored to REGION_COPY in the same order in that they appear
5360 in REGION, if REGION_COPY is not NULL. ENTRY is the entry to
5361 the region, EXIT an exit from it. The condition guarding EXIT
5362 is moved to ENTRY. Returns true if duplication succeeds, false
5388 gimple_duplicate_sese_tail (edge entry ATTRIBUTE_UNUSED, edge exit ATTRIBUTE_UNUSED,
5389 basic_block *region ATTRIBUTE_UNUSED, unsigned n_region ATTRIBUTE_UNUSED,
5390 basic_block *region_copy ATTRIBUTE_UNUSED)
5393 bool free_region_copy = false;
5394 struct loop *loop = exit->dest->loop_father;
5395 struct loop *orig_loop = entry->dest->loop_father;
5396 basic_block switch_bb, entry_bb, nentry_bb;
5397 VEC (basic_block, heap) *doms;
5398 int total_freq = 0, exit_freq = 0;
5399 gcov_type total_count = 0, exit_count = 0;
5400 edge exits[2], nexits[2], e;
5401 gimple_stmt_iterator gsi;
5404 basic_block exit_bb;
5405 gimple_stmt_iterator psi;
5409 gcc_assert (EDGE_COUNT (exit->src->succs) == 2);
5411 exits[1] = EDGE_SUCC (exit->src, EDGE_SUCC (exit->src, 0) == exit);
5413 if (!can_copy_bbs_p (region, n_region))
5416 initialize_original_copy_tables ();
5417 set_loop_copy (orig_loop, loop);
5418 duplicate_subloops (orig_loop, loop);
5422 region_copy = XNEWVEC (basic_block, n_region);
5423 free_region_copy = true;
5426 gcc_assert (!need_ssa_update_p (cfun));
5428 /* Record blocks outside the region that are dominated by something
5430 doms = get_dominated_by_region (CDI_DOMINATORS, region, n_region);
5432 if (exit->src->count)
5434 total_count = exit->src->count;
5435 exit_count = exit->count;
5436 /* Fix up corner cases, to avoid division by zero or creation of negative
5438 if (exit_count > total_count)
5439 exit_count = total_count;
5443 total_freq = exit->src->frequency;
5444 exit_freq = EDGE_FREQUENCY (exit);
5445 /* Fix up corner cases, to avoid division by zero or creation of negative
5447 if (total_freq == 0)
5449 if (exit_freq > total_freq)
5450 exit_freq = total_freq;
5453 copy_bbs (region, n_region, region_copy, exits, 2, nexits, orig_loop,
5454 split_edge_bb_loc (exit));
5457 scale_bbs_frequencies_gcov_type (region, n_region,
5458 total_count - exit_count,
5460 scale_bbs_frequencies_gcov_type (region_copy, n_region, exit_count,
5465 scale_bbs_frequencies_int (region, n_region, total_freq - exit_freq,
5467 scale_bbs_frequencies_int (region_copy, n_region, exit_freq, total_freq);
5470 /* Create the switch block, and put the exit condition to it. */
5471 entry_bb = entry->dest;
5472 nentry_bb = get_bb_copy (entry_bb);
5473 if (!last_stmt (entry->src)
5474 || !stmt_ends_bb_p (last_stmt (entry->src)))
5475 switch_bb = entry->src;
5477 switch_bb = split_edge (entry);
5478 set_immediate_dominator (CDI_DOMINATORS, nentry_bb, switch_bb);
5480 gsi = gsi_last_bb (switch_bb);
5481 cond_stmt = last_stmt (exit->src);
5482 gcc_assert (gimple_code (cond_stmt) == GIMPLE_COND);
5483 cond_stmt = gimple_copy (cond_stmt);
5485 gsi_insert_after (&gsi, cond_stmt, GSI_NEW_STMT);
5487 sorig = single_succ_edge (switch_bb);
5488 sorig->flags = exits[1]->flags;
5489 snew = make_edge (switch_bb, nentry_bb, exits[0]->flags);
5491 /* Register the new edge from SWITCH_BB in loop exit lists. */
5492 rescan_loop_exit (snew, true, false);
5494 /* Add the PHI node arguments. */
5495 add_phi_args_after_copy (region_copy, n_region, snew);
5497 /* Get rid of now superfluous conditions and associated edges (and phi node
5499 exit_bb = exit->dest;
5501 e = redirect_edge_and_branch (exits[0], exits[1]->dest);
5502 PENDING_STMT (e) = NULL;
5504 /* The latch of ORIG_LOOP was copied, and so was the backedge
5505 to the original header. We redirect this backedge to EXIT_BB. */
5506 for (i = 0; i < n_region; i++)
5507 if (get_bb_original (region_copy[i]) == orig_loop->latch)
5509 gcc_assert (single_succ_edge (region_copy[i]));
5510 e = redirect_edge_and_branch (single_succ_edge (region_copy[i]), exit_bb);
5511 PENDING_STMT (e) = NULL;
5512 for (psi = gsi_start_phis (exit_bb);
5516 phi = gsi_stmt (psi);
5517 def = PHI_ARG_DEF (phi, nexits[0]->dest_idx);
5518 add_phi_arg (phi, def, e, gimple_phi_arg_location_from_edge (phi, e));
5521 e = redirect_edge_and_branch (nexits[0], nexits[1]->dest);
5522 PENDING_STMT (e) = NULL;
5524 /* Anything that is outside of the region, but was dominated by something
5525 inside needs to update dominance info. */
5526 iterate_fix_dominators (CDI_DOMINATORS, doms, false);
5527 VEC_free (basic_block, heap, doms);
5528 /* Update the SSA web. */
5529 update_ssa (TODO_update_ssa);
5531 if (free_region_copy)
5534 free_original_copy_tables ();
5538 /* Add all the blocks dominated by ENTRY to the array BBS_P. Stop
5539 adding blocks when the dominator traversal reaches EXIT. This
5540 function silently assumes that ENTRY strictly dominates EXIT. */
5543 gather_blocks_in_sese_region (basic_block entry, basic_block exit,
5544 VEC(basic_block,heap) **bbs_p)
5548 for (son = first_dom_son (CDI_DOMINATORS, entry);
5550 son = next_dom_son (CDI_DOMINATORS, son))
5552 VEC_safe_push (basic_block, heap, *bbs_p, son);
5554 gather_blocks_in_sese_region (son, exit, bbs_p);
5558 /* Replaces *TP with a duplicate (belonging to function TO_CONTEXT).
5559 The duplicates are recorded in VARS_MAP. */
5562 replace_by_duplicate_decl (tree *tp, struct pointer_map_t *vars_map,
5565 tree t = *tp, new_t;
5566 struct function *f = DECL_STRUCT_FUNCTION (to_context);
5569 if (DECL_CONTEXT (t) == to_context)
5572 loc = pointer_map_contains (vars_map, t);
5576 loc = pointer_map_insert (vars_map, t);
5580 new_t = copy_var_decl (t, DECL_NAME (t), TREE_TYPE (t));
5581 add_local_decl (f, new_t);
5585 gcc_assert (TREE_CODE (t) == CONST_DECL);
5586 new_t = copy_node (t);
5588 DECL_CONTEXT (new_t) = to_context;
5593 new_t = (tree) *loc;
5599 /* Creates an ssa name in TO_CONTEXT equivalent to NAME.
5600 VARS_MAP maps old ssa names and var_decls to the new ones. */
5603 replace_ssa_name (tree name, struct pointer_map_t *vars_map,
5607 tree new_name, decl = SSA_NAME_VAR (name);
5609 gcc_assert (is_gimple_reg (name));
5611 loc = pointer_map_contains (vars_map, name);
5615 replace_by_duplicate_decl (&decl, vars_map, to_context);
5617 push_cfun (DECL_STRUCT_FUNCTION (to_context));
5618 if (gimple_in_ssa_p (cfun))
5619 add_referenced_var (decl);
5621 new_name = make_ssa_name (decl, SSA_NAME_DEF_STMT (name));
5622 if (SSA_NAME_IS_DEFAULT_DEF (name))
5623 set_default_def (decl, new_name);
5626 loc = pointer_map_insert (vars_map, name);
5630 new_name = (tree) *loc;
5641 struct pointer_map_t *vars_map;
5642 htab_t new_label_map;
5643 struct pointer_map_t *eh_map;
5647 /* Helper for move_block_to_fn. Set TREE_BLOCK in every expression
5648 contained in *TP if it has been ORIG_BLOCK previously and change the
5649 DECL_CONTEXT of every local variable referenced in *TP. */
5652 move_stmt_op (tree *tp, int *walk_subtrees, void *data)
5654 struct walk_stmt_info *wi = (struct walk_stmt_info *) data;
5655 struct move_stmt_d *p = (struct move_stmt_d *) wi->info;
5659 /* We should never have TREE_BLOCK set on non-statements. */
5660 gcc_assert (!TREE_BLOCK (t));
5662 else if (DECL_P (t) || TREE_CODE (t) == SSA_NAME)
5664 if (TREE_CODE (t) == SSA_NAME)
5665 *tp = replace_ssa_name (t, p->vars_map, p->to_context);
5666 else if (TREE_CODE (t) == LABEL_DECL)
5668 if (p->new_label_map)
5670 struct tree_map in, *out;
5672 out = (struct tree_map *)
5673 htab_find_with_hash (p->new_label_map, &in, DECL_UID (t));
5678 DECL_CONTEXT (t) = p->to_context;
5680 else if (p->remap_decls_p)
5682 /* Replace T with its duplicate. T should no longer appear in the
5683 parent function, so this looks wasteful; however, it may appear
5684 in referenced_vars, and more importantly, as virtual operands of
5685 statements, and in alias lists of other variables. It would be
5686 quite difficult to expunge it from all those places. ??? It might
5687 suffice to do this for addressable variables. */
5688 if ((TREE_CODE (t) == VAR_DECL
5689 && !is_global_var (t))
5690 || TREE_CODE (t) == CONST_DECL)
5691 replace_by_duplicate_decl (tp, p->vars_map, p->to_context);
5694 && gimple_in_ssa_p (cfun))
5696 push_cfun (DECL_STRUCT_FUNCTION (p->to_context));
5697 add_referenced_var (*tp);
5703 else if (TYPE_P (t))
5709 /* Helper for move_stmt_r. Given an EH region number for the source
5710 function, map that to the duplicate EH regio number in the dest. */
5713 move_stmt_eh_region_nr (int old_nr, struct move_stmt_d *p)
5715 eh_region old_r, new_r;
5718 old_r = get_eh_region_from_number (old_nr);
5719 slot = pointer_map_contains (p->eh_map, old_r);
5720 new_r = (eh_region) *slot;
5722 return new_r->index;
5725 /* Similar, but operate on INTEGER_CSTs. */
5728 move_stmt_eh_region_tree_nr (tree old_t_nr, struct move_stmt_d *p)
5732 old_nr = tree_low_cst (old_t_nr, 0);
5733 new_nr = move_stmt_eh_region_nr (old_nr, p);
5735 return build_int_cst (integer_type_node, new_nr);
5738 /* Like move_stmt_op, but for gimple statements.
5740 Helper for move_block_to_fn. Set GIMPLE_BLOCK in every expression
5741 contained in the current statement in *GSI_P and change the
5742 DECL_CONTEXT of every local variable referenced in the current
5746 move_stmt_r (gimple_stmt_iterator *gsi_p, bool *handled_ops_p,
5747 struct walk_stmt_info *wi)
5749 struct move_stmt_d *p = (struct move_stmt_d *) wi->info;
5750 gimple stmt = gsi_stmt (*gsi_p);
5751 tree block = gimple_block (stmt);
5753 if (p->orig_block == NULL_TREE
5754 || block == p->orig_block
5755 || block == NULL_TREE)
5756 gimple_set_block (stmt, p->new_block);
5757 #ifdef ENABLE_CHECKING
5758 else if (block != p->new_block)
5760 while (block && block != p->orig_block)
5761 block = BLOCK_SUPERCONTEXT (block);
5766 switch (gimple_code (stmt))
5769 /* Remap the region numbers for __builtin_eh_{pointer,filter}. */
5771 tree r, fndecl = gimple_call_fndecl (stmt);
5772 if (fndecl && DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_NORMAL)
5773 switch (DECL_FUNCTION_CODE (fndecl))
5775 case BUILT_IN_EH_COPY_VALUES:
5776 r = gimple_call_arg (stmt, 1);
5777 r = move_stmt_eh_region_tree_nr (r, p);
5778 gimple_call_set_arg (stmt, 1, r);
5781 case BUILT_IN_EH_POINTER:
5782 case BUILT_IN_EH_FILTER:
5783 r = gimple_call_arg (stmt, 0);
5784 r = move_stmt_eh_region_tree_nr (r, p);
5785 gimple_call_set_arg (stmt, 0, r);
5796 int r = gimple_resx_region (stmt);
5797 r = move_stmt_eh_region_nr (r, p);
5798 gimple_resx_set_region (stmt, r);
5802 case GIMPLE_EH_DISPATCH:
5804 int r = gimple_eh_dispatch_region (stmt);
5805 r = move_stmt_eh_region_nr (r, p);
5806 gimple_eh_dispatch_set_region (stmt, r);
5810 case GIMPLE_OMP_RETURN:
5811 case GIMPLE_OMP_CONTINUE:
5814 if (is_gimple_omp (stmt))
5816 /* Do not remap variables inside OMP directives. Variables
5817 referenced in clauses and directive header belong to the
5818 parent function and should not be moved into the child
5820 bool save_remap_decls_p = p->remap_decls_p;
5821 p->remap_decls_p = false;
5822 *handled_ops_p = true;
5824 walk_gimple_seq (gimple_omp_body (stmt), move_stmt_r,
5827 p->remap_decls_p = save_remap_decls_p;
5835 /* Move basic block BB from function CFUN to function DEST_FN. The
5836 block is moved out of the original linked list and placed after
5837 block AFTER in the new list. Also, the block is removed from the
5838 original array of blocks and placed in DEST_FN's array of blocks.
5839 If UPDATE_EDGE_COUNT_P is true, the edge counts on both CFGs is
5840 updated to reflect the moved edges.
5842 The local variables are remapped to new instances, VARS_MAP is used
5843 to record the mapping. */
5846 move_block_to_fn (struct function *dest_cfun, basic_block bb,
5847 basic_block after, bool update_edge_count_p,
5848 struct move_stmt_d *d)
5850 struct control_flow_graph *cfg;
5853 gimple_stmt_iterator si;
5854 unsigned old_len, new_len;
5856 /* Remove BB from dominance structures. */
5857 delete_from_dominance_info (CDI_DOMINATORS, bb);
5859 remove_bb_from_loops (bb);
5861 /* Link BB to the new linked list. */
5862 move_block_after (bb, after);
5864 /* Update the edge count in the corresponding flowgraphs. */
5865 if (update_edge_count_p)
5866 FOR_EACH_EDGE (e, ei, bb->succs)
5868 cfun->cfg->x_n_edges--;
5869 dest_cfun->cfg->x_n_edges++;
5872 /* Remove BB from the original basic block array. */
5873 VEC_replace (basic_block, cfun->cfg->x_basic_block_info, bb->index, NULL);
5874 cfun->cfg->x_n_basic_blocks--;
5876 /* Grow DEST_CFUN's basic block array if needed. */
5877 cfg = dest_cfun->cfg;
5878 cfg->x_n_basic_blocks++;
5879 if (bb->index >= cfg->x_last_basic_block)
5880 cfg->x_last_basic_block = bb->index + 1;
5882 old_len = VEC_length (basic_block, cfg->x_basic_block_info);
5883 if ((unsigned) cfg->x_last_basic_block >= old_len)
5885 new_len = cfg->x_last_basic_block + (cfg->x_last_basic_block + 3) / 4;
5886 VEC_safe_grow_cleared (basic_block, gc, cfg->x_basic_block_info,
5890 VEC_replace (basic_block, cfg->x_basic_block_info,
5893 /* Remap the variables in phi nodes. */
5894 for (si = gsi_start_phis (bb); !gsi_end_p (si); )
5896 gimple phi = gsi_stmt (si);
5898 tree op = PHI_RESULT (phi);
5901 if (!is_gimple_reg (op))
5903 /* Remove the phi nodes for virtual operands (alias analysis will be
5904 run for the new function, anyway). */
5905 remove_phi_node (&si, true);
5909 SET_PHI_RESULT (phi,
5910 replace_ssa_name (op, d->vars_map, dest_cfun->decl));
5911 FOR_EACH_PHI_ARG (use, phi, oi, SSA_OP_USE)
5913 op = USE_FROM_PTR (use);
5914 if (TREE_CODE (op) == SSA_NAME)
5915 SET_USE (use, replace_ssa_name (op, d->vars_map, dest_cfun->decl));
5921 for (si = gsi_start_bb (bb); !gsi_end_p (si); gsi_next (&si))
5923 gimple stmt = gsi_stmt (si);
5924 struct walk_stmt_info wi;
5926 memset (&wi, 0, sizeof (wi));
5928 walk_gimple_stmt (&si, move_stmt_r, move_stmt_op, &wi);
5930 if (gimple_code (stmt) == GIMPLE_LABEL)
5932 tree label = gimple_label_label (stmt);
5933 int uid = LABEL_DECL_UID (label);
5935 gcc_assert (uid > -1);
5937 old_len = VEC_length (basic_block, cfg->x_label_to_block_map);
5938 if (old_len <= (unsigned) uid)
5940 new_len = 3 * uid / 2 + 1;
5941 VEC_safe_grow_cleared (basic_block, gc,
5942 cfg->x_label_to_block_map, new_len);
5945 VEC_replace (basic_block, cfg->x_label_to_block_map, uid, bb);
5946 VEC_replace (basic_block, cfun->cfg->x_label_to_block_map, uid, NULL);
5948 gcc_assert (DECL_CONTEXT (label) == dest_cfun->decl);
5950 if (uid >= dest_cfun->cfg->last_label_uid)
5951 dest_cfun->cfg->last_label_uid = uid + 1;
5954 maybe_duplicate_eh_stmt_fn (dest_cfun, stmt, cfun, stmt, d->eh_map, 0);
5955 remove_stmt_from_eh_lp_fn (cfun, stmt);
5957 gimple_duplicate_stmt_histograms (dest_cfun, stmt, cfun, stmt);
5958 gimple_remove_stmt_histograms (cfun, stmt);
5960 /* We cannot leave any operands allocated from the operand caches of
5961 the current function. */
5962 free_stmt_operands (stmt);
5963 push_cfun (dest_cfun);
5968 FOR_EACH_EDGE (e, ei, bb->succs)
5971 tree block = e->goto_block;
5972 if (d->orig_block == NULL_TREE
5973 || block == d->orig_block)
5974 e->goto_block = d->new_block;
5975 #ifdef ENABLE_CHECKING
5976 else if (block != d->new_block)
5978 while (block && block != d->orig_block)
5979 block = BLOCK_SUPERCONTEXT (block);
5986 /* Examine the statements in BB (which is in SRC_CFUN); find and return
5987 the outermost EH region. Use REGION as the incoming base EH region. */
5990 find_outermost_region_in_block (struct function *src_cfun,
5991 basic_block bb, eh_region region)
5993 gimple_stmt_iterator si;
5995 for (si = gsi_start_bb (bb); !gsi_end_p (si); gsi_next (&si))
5997 gimple stmt = gsi_stmt (si);
5998 eh_region stmt_region;
6001 lp_nr = lookup_stmt_eh_lp_fn (src_cfun, stmt);
6002 stmt_region = get_eh_region_from_lp_number_fn (src_cfun, lp_nr);
6006 region = stmt_region;
6007 else if (stmt_region != region)
6009 region = eh_region_outermost (src_cfun, stmt_region, region);
6010 gcc_assert (region != NULL);
6019 new_label_mapper (tree decl, void *data)
6021 htab_t hash = (htab_t) data;
6025 gcc_assert (TREE_CODE (decl) == LABEL_DECL);
6027 m = XNEW (struct tree_map);
6028 m->hash = DECL_UID (decl);
6029 m->base.from = decl;
6030 m->to = create_artificial_label (UNKNOWN_LOCATION);
6031 LABEL_DECL_UID (m->to) = LABEL_DECL_UID (decl);
6032 if (LABEL_DECL_UID (m->to) >= cfun->cfg->last_label_uid)
6033 cfun->cfg->last_label_uid = LABEL_DECL_UID (m->to) + 1;
6035 slot = htab_find_slot_with_hash (hash, m, m->hash, INSERT);
6036 gcc_assert (*slot == NULL);
6043 /* Change DECL_CONTEXT of all BLOCK_VARS in block, including
6047 replace_block_vars_by_duplicates (tree block, struct pointer_map_t *vars_map,
6052 for (tp = &BLOCK_VARS (block); *tp; tp = &DECL_CHAIN (*tp))
6055 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != CONST_DECL)
6057 replace_by_duplicate_decl (&t, vars_map, to_context);
6060 if (TREE_CODE (*tp) == VAR_DECL && DECL_HAS_VALUE_EXPR_P (*tp))
6062 SET_DECL_VALUE_EXPR (t, DECL_VALUE_EXPR (*tp));
6063 DECL_HAS_VALUE_EXPR_P (t) = 1;
6065 DECL_CHAIN (t) = DECL_CHAIN (*tp);
6070 for (block = BLOCK_SUBBLOCKS (block); block; block = BLOCK_CHAIN (block))
6071 replace_block_vars_by_duplicates (block, vars_map, to_context);
6074 /* Move a single-entry, single-exit region delimited by ENTRY_BB and
6075 EXIT_BB to function DEST_CFUN. The whole region is replaced by a
6076 single basic block in the original CFG and the new basic block is
6077 returned. DEST_CFUN must not have a CFG yet.
6079 Note that the region need not be a pure SESE region. Blocks inside
6080 the region may contain calls to abort/exit. The only restriction
6081 is that ENTRY_BB should be the only entry point and it must
6084 Change TREE_BLOCK of all statements in ORIG_BLOCK to the new
6085 functions outermost BLOCK, move all subblocks of ORIG_BLOCK
6086 to the new function.
6088 All local variables referenced in the region are assumed to be in
6089 the corresponding BLOCK_VARS and unexpanded variable lists
6090 associated with DEST_CFUN. */
6093 move_sese_region_to_fn (struct function *dest_cfun, basic_block entry_bb,
6094 basic_block exit_bb, tree orig_block)
6096 VEC(basic_block,heap) *bbs, *dom_bbs;
6097 basic_block dom_entry = get_immediate_dominator (CDI_DOMINATORS, entry_bb);
6098 basic_block after, bb, *entry_pred, *exit_succ, abb;
6099 struct function *saved_cfun = cfun;
6100 int *entry_flag, *exit_flag;
6101 unsigned *entry_prob, *exit_prob;
6102 unsigned i, num_entry_edges, num_exit_edges;
6105 htab_t new_label_map;
6106 struct pointer_map_t *vars_map, *eh_map;
6107 struct loop *loop = entry_bb->loop_father;
6108 struct move_stmt_d d;
6110 /* If ENTRY does not strictly dominate EXIT, this cannot be an SESE
6112 gcc_assert (entry_bb != exit_bb
6114 || dominated_by_p (CDI_DOMINATORS, exit_bb, entry_bb)));
6116 /* Collect all the blocks in the region. Manually add ENTRY_BB
6117 because it won't be added by dfs_enumerate_from. */
6119 VEC_safe_push (basic_block, heap, bbs, entry_bb);
6120 gather_blocks_in_sese_region (entry_bb, exit_bb, &bbs);
6122 /* The blocks that used to be dominated by something in BBS will now be
6123 dominated by the new block. */
6124 dom_bbs = get_dominated_by_region (CDI_DOMINATORS,
6125 VEC_address (basic_block, bbs),
6126 VEC_length (basic_block, bbs));
6128 /* Detach ENTRY_BB and EXIT_BB from CFUN->CFG. We need to remember
6129 the predecessor edges to ENTRY_BB and the successor edges to
6130 EXIT_BB so that we can re-attach them to the new basic block that
6131 will replace the region. */
6132 num_entry_edges = EDGE_COUNT (entry_bb->preds);
6133 entry_pred = (basic_block *) xcalloc (num_entry_edges, sizeof (basic_block));
6134 entry_flag = (int *) xcalloc (num_entry_edges, sizeof (int));
6135 entry_prob = XNEWVEC (unsigned, num_entry_edges);
6137 for (ei = ei_start (entry_bb->preds); (e = ei_safe_edge (ei)) != NULL;)
6139 entry_prob[i] = e->probability;
6140 entry_flag[i] = e->flags;
6141 entry_pred[i++] = e->src;
6147 num_exit_edges = EDGE_COUNT (exit_bb->succs);
6148 exit_succ = (basic_block *) xcalloc (num_exit_edges,
6149 sizeof (basic_block));
6150 exit_flag = (int *) xcalloc (num_exit_edges, sizeof (int));
6151 exit_prob = XNEWVEC (unsigned, num_exit_edges);
6153 for (ei = ei_start (exit_bb->succs); (e = ei_safe_edge (ei)) != NULL;)
6155 exit_prob[i] = e->probability;
6156 exit_flag[i] = e->flags;
6157 exit_succ[i++] = e->dest;
6169 /* Switch context to the child function to initialize DEST_FN's CFG. */
6170 gcc_assert (dest_cfun->cfg == NULL);
6171 push_cfun (dest_cfun);
6173 init_empty_tree_cfg ();
6175 /* Initialize EH information for the new function. */
6177 new_label_map = NULL;
6180 eh_region region = NULL;
6182 FOR_EACH_VEC_ELT (basic_block, bbs, i, bb)
6183 region = find_outermost_region_in_block (saved_cfun, bb, region);
6185 init_eh_for_function ();
6188 new_label_map = htab_create (17, tree_map_hash, tree_map_eq, free);
6189 eh_map = duplicate_eh_regions (saved_cfun, region, 0,
6190 new_label_mapper, new_label_map);
6196 /* Move blocks from BBS into DEST_CFUN. */
6197 gcc_assert (VEC_length (basic_block, bbs) >= 2);
6198 after = dest_cfun->cfg->x_entry_block_ptr;
6199 vars_map = pointer_map_create ();
6201 memset (&d, 0, sizeof (d));
6202 d.orig_block = orig_block;
6203 d.new_block = DECL_INITIAL (dest_cfun->decl);
6204 d.from_context = cfun->decl;
6205 d.to_context = dest_cfun->decl;
6206 d.vars_map = vars_map;
6207 d.new_label_map = new_label_map;
6209 d.remap_decls_p = true;
6211 FOR_EACH_VEC_ELT (basic_block, bbs, i, bb)
6213 /* No need to update edge counts on the last block. It has
6214 already been updated earlier when we detached the region from
6215 the original CFG. */
6216 move_block_to_fn (dest_cfun, bb, after, bb != exit_bb, &d);
6220 /* Rewire BLOCK_SUBBLOCKS of orig_block. */
6224 gcc_assert (BLOCK_SUBBLOCKS (DECL_INITIAL (dest_cfun->decl))
6226 BLOCK_SUBBLOCKS (DECL_INITIAL (dest_cfun->decl))
6227 = BLOCK_SUBBLOCKS (orig_block);
6228 for (block = BLOCK_SUBBLOCKS (orig_block);
6229 block; block = BLOCK_CHAIN (block))
6230 BLOCK_SUPERCONTEXT (block) = DECL_INITIAL (dest_cfun->decl);
6231 BLOCK_SUBBLOCKS (orig_block) = NULL_TREE;
6234 replace_block_vars_by_duplicates (DECL_INITIAL (dest_cfun->decl),
6235 vars_map, dest_cfun->decl);
6238 htab_delete (new_label_map);
6240 pointer_map_destroy (eh_map);
6241 pointer_map_destroy (vars_map);
6243 /* Rewire the entry and exit blocks. The successor to the entry
6244 block turns into the successor of DEST_FN's ENTRY_BLOCK_PTR in
6245 the child function. Similarly, the predecessor of DEST_FN's
6246 EXIT_BLOCK_PTR turns into the predecessor of EXIT_BLOCK_PTR. We
6247 need to switch CFUN between DEST_CFUN and SAVED_CFUN so that the
6248 various CFG manipulation function get to the right CFG.
6250 FIXME, this is silly. The CFG ought to become a parameter to
6252 push_cfun (dest_cfun);
6253 make_edge (ENTRY_BLOCK_PTR, entry_bb, EDGE_FALLTHRU);
6255 make_edge (exit_bb, EXIT_BLOCK_PTR, 0);
6258 /* Back in the original function, the SESE region has disappeared,
6259 create a new basic block in its place. */
6260 bb = create_empty_bb (entry_pred[0]);
6262 add_bb_to_loop (bb, loop);
6263 for (i = 0; i < num_entry_edges; i++)
6265 e = make_edge (entry_pred[i], bb, entry_flag[i]);
6266 e->probability = entry_prob[i];
6269 for (i = 0; i < num_exit_edges; i++)
6271 e = make_edge (bb, exit_succ[i], exit_flag[i]);
6272 e->probability = exit_prob[i];
6275 set_immediate_dominator (CDI_DOMINATORS, bb, dom_entry);
6276 FOR_EACH_VEC_ELT (basic_block, dom_bbs, i, abb)
6277 set_immediate_dominator (CDI_DOMINATORS, abb, bb);
6278 VEC_free (basic_block, heap, dom_bbs);
6289 VEC_free (basic_block, heap, bbs);
6295 /* Dump FUNCTION_DECL FN to file FILE using FLAGS (see TDF_* in tree-pass.h)
6299 dump_function_to_file (tree fn, FILE *file, int flags)
6302 struct function *dsf;
6303 bool ignore_topmost_bind = false, any_var = false;
6307 fprintf (file, "%s (", lang_hooks.decl_printable_name (fn, 2));
6309 arg = DECL_ARGUMENTS (fn);
6312 print_generic_expr (file, TREE_TYPE (arg), dump_flags);
6313 fprintf (file, " ");
6314 print_generic_expr (file, arg, dump_flags);
6315 if (flags & TDF_VERBOSE)
6316 print_node (file, "", arg, 4);
6317 if (DECL_CHAIN (arg))
6318 fprintf (file, ", ");
6319 arg = DECL_CHAIN (arg);
6321 fprintf (file, ")\n");
6323 if (flags & TDF_VERBOSE)
6324 print_node (file, "", fn, 2);
6326 dsf = DECL_STRUCT_FUNCTION (fn);
6327 if (dsf && (flags & TDF_EH))
6328 dump_eh_tree (file, dsf);
6330 if (flags & TDF_RAW && !gimple_has_body_p (fn))
6332 dump_node (fn, TDF_SLIM | flags, file);
6336 /* Switch CFUN to point to FN. */
6337 push_cfun (DECL_STRUCT_FUNCTION (fn));
6339 /* When GIMPLE is lowered, the variables are no longer available in
6340 BIND_EXPRs, so display them separately. */
6341 if (cfun && cfun->decl == fn && !VEC_empty (tree, cfun->local_decls))
6344 ignore_topmost_bind = true;
6346 fprintf (file, "{\n");
6347 FOR_EACH_LOCAL_DECL (cfun, ix, var)
6349 print_generic_decl (file, var, flags);
6350 if (flags & TDF_VERBOSE)
6351 print_node (file, "", var, 4);
6352 fprintf (file, "\n");
6358 if (cfun && cfun->decl == fn && cfun->cfg && basic_block_info)
6360 /* If the CFG has been built, emit a CFG-based dump. */
6361 check_bb_profile (ENTRY_BLOCK_PTR, file);
6362 if (!ignore_topmost_bind)
6363 fprintf (file, "{\n");
6365 if (any_var && n_basic_blocks)
6366 fprintf (file, "\n");
6369 gimple_dump_bb (bb, file, 2, flags);
6371 fprintf (file, "}\n");
6372 check_bb_profile (EXIT_BLOCK_PTR, file);
6374 else if (DECL_SAVED_TREE (fn) == NULL)
6376 /* The function is now in GIMPLE form but the CFG has not been
6377 built yet. Emit the single sequence of GIMPLE statements
6378 that make up its body. */
6379 gimple_seq body = gimple_body (fn);
6381 if (gimple_seq_first_stmt (body)
6382 && gimple_seq_first_stmt (body) == gimple_seq_last_stmt (body)
6383 && gimple_code (gimple_seq_first_stmt (body)) == GIMPLE_BIND)
6384 print_gimple_seq (file, body, 0, flags);
6387 if (!ignore_topmost_bind)
6388 fprintf (file, "{\n");
6391 fprintf (file, "\n");
6393 print_gimple_seq (file, body, 2, flags);
6394 fprintf (file, "}\n");
6401 /* Make a tree based dump. */
6402 chain = DECL_SAVED_TREE (fn);
6404 if (chain && TREE_CODE (chain) == BIND_EXPR)
6406 if (ignore_topmost_bind)
6408 chain = BIND_EXPR_BODY (chain);
6416 if (!ignore_topmost_bind)
6417 fprintf (file, "{\n");
6422 fprintf (file, "\n");
6424 print_generic_stmt_indented (file, chain, flags, indent);
6425 if (ignore_topmost_bind)
6426 fprintf (file, "}\n");
6429 if (flags & TDF_ENUMERATE_LOCALS)
6430 dump_enumerated_decls (file, flags);
6431 fprintf (file, "\n\n");
6438 /* Dump FUNCTION_DECL FN to stderr using FLAGS (see TDF_* in tree.h) */
6441 debug_function (tree fn, int flags)
6443 dump_function_to_file (fn, stderr, flags);
6447 /* Print on FILE the indexes for the predecessors of basic_block BB. */
6450 print_pred_bbs (FILE *file, basic_block bb)
6455 FOR_EACH_EDGE (e, ei, bb->preds)
6456 fprintf (file, "bb_%d ", e->src->index);
6460 /* Print on FILE the indexes for the successors of basic_block BB. */
6463 print_succ_bbs (FILE *file, basic_block bb)
6468 FOR_EACH_EDGE (e, ei, bb->succs)
6469 fprintf (file, "bb_%d ", e->dest->index);
6472 /* Print to FILE the basic block BB following the VERBOSITY level. */
6475 print_loops_bb (FILE *file, basic_block bb, int indent, int verbosity)
6477 char *s_indent = (char *) alloca ((size_t) indent + 1);
6478 memset ((void *) s_indent, ' ', (size_t) indent);
6479 s_indent[indent] = '\0';
6481 /* Print basic_block's header. */
6484 fprintf (file, "%s bb_%d (preds = {", s_indent, bb->index);
6485 print_pred_bbs (file, bb);
6486 fprintf (file, "}, succs = {");
6487 print_succ_bbs (file, bb);
6488 fprintf (file, "})\n");
6491 /* Print basic_block's body. */
6494 fprintf (file, "%s {\n", s_indent);
6495 gimple_dump_bb (bb, file, indent + 4, TDF_VOPS|TDF_MEMSYMS);
6496 fprintf (file, "%s }\n", s_indent);
6500 static void print_loop_and_siblings (FILE *, struct loop *, int, int);
6502 /* Pretty print LOOP on FILE, indented INDENT spaces. Following
6503 VERBOSITY level this outputs the contents of the loop, or just its
6507 print_loop (FILE *file, struct loop *loop, int indent, int verbosity)
6515 s_indent = (char *) alloca ((size_t) indent + 1);
6516 memset ((void *) s_indent, ' ', (size_t) indent);
6517 s_indent[indent] = '\0';
6519 /* Print loop's header. */
6520 fprintf (file, "%sloop_%d (header = %d, latch = %d", s_indent,
6521 loop->num, loop->header->index, loop->latch->index);
6522 fprintf (file, ", niter = ");
6523 print_generic_expr (file, loop->nb_iterations, 0);
6525 if (loop->any_upper_bound)
6527 fprintf (file, ", upper_bound = ");
6528 dump_double_int (file, loop->nb_iterations_upper_bound, true);
6531 if (loop->any_estimate)
6533 fprintf (file, ", estimate = ");
6534 dump_double_int (file, loop->nb_iterations_estimate, true);
6536 fprintf (file, ")\n");
6538 /* Print loop's body. */
6541 fprintf (file, "%s{\n", s_indent);
6543 if (bb->loop_father == loop)
6544 print_loops_bb (file, bb, indent, verbosity);
6546 print_loop_and_siblings (file, loop->inner, indent + 2, verbosity);
6547 fprintf (file, "%s}\n", s_indent);
6551 /* Print the LOOP and its sibling loops on FILE, indented INDENT
6552 spaces. Following VERBOSITY level this outputs the contents of the
6553 loop, or just its structure. */
6556 print_loop_and_siblings (FILE *file, struct loop *loop, int indent, int verbosity)
6561 print_loop (file, loop, indent, verbosity);
6562 print_loop_and_siblings (file, loop->next, indent, verbosity);
6565 /* Follow a CFG edge from the entry point of the program, and on entry
6566 of a loop, pretty print the loop structure on FILE. */
6569 print_loops (FILE *file, int verbosity)
6573 bb = ENTRY_BLOCK_PTR;
6574 if (bb && bb->loop_father)
6575 print_loop_and_siblings (file, bb->loop_father, 0, verbosity);
6579 /* Debugging loops structure at tree level, at some VERBOSITY level. */
6582 debug_loops (int verbosity)
6584 print_loops (stderr, verbosity);
6587 /* Print on stderr the code of LOOP, at some VERBOSITY level. */
6590 debug_loop (struct loop *loop, int verbosity)
6592 print_loop (stderr, loop, 0, verbosity);
6595 /* Print on stderr the code of loop number NUM, at some VERBOSITY
6599 debug_loop_num (unsigned num, int verbosity)
6601 debug_loop (get_loop (num), verbosity);
6604 /* Return true if BB ends with a call, possibly followed by some
6605 instructions that must stay with the call. Return false,
6609 gimple_block_ends_with_call_p (basic_block bb)
6611 gimple_stmt_iterator gsi = gsi_last_nondebug_bb (bb);
6612 return !gsi_end_p (gsi) && is_gimple_call (gsi_stmt (gsi));
6616 /* Return true if BB ends with a conditional branch. Return false,
6620 gimple_block_ends_with_condjump_p (const_basic_block bb)
6622 gimple stmt = last_stmt (CONST_CAST_BB (bb));
6623 return (stmt && gimple_code (stmt) == GIMPLE_COND);
6627 /* Return true if we need to add fake edge to exit at statement T.
6628 Helper function for gimple_flow_call_edges_add. */
6631 need_fake_edge_p (gimple t)
6633 tree fndecl = NULL_TREE;
6636 /* NORETURN and LONGJMP calls already have an edge to exit.
6637 CONST and PURE calls do not need one.
6638 We don't currently check for CONST and PURE here, although
6639 it would be a good idea, because those attributes are
6640 figured out from the RTL in mark_constant_function, and
6641 the counter incrementation code from -fprofile-arcs
6642 leads to different results from -fbranch-probabilities. */
6643 if (is_gimple_call (t))
6645 fndecl = gimple_call_fndecl (t);
6646 call_flags = gimple_call_flags (t);
6649 if (is_gimple_call (t)
6651 && DECL_BUILT_IN (fndecl)
6652 && (call_flags & ECF_NOTHROW)
6653 && !(call_flags & ECF_RETURNS_TWICE)
6654 /* fork() doesn't really return twice, but the effect of
6655 wrapping it in __gcov_fork() which calls __gcov_flush()
6656 and clears the counters before forking has the same
6657 effect as returning twice. Force a fake edge. */
6658 && !(DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_NORMAL
6659 && DECL_FUNCTION_CODE (fndecl) == BUILT_IN_FORK))
6662 if (is_gimple_call (t)
6663 && !(call_flags & ECF_NORETURN))
6666 if (gimple_code (t) == GIMPLE_ASM
6667 && (gimple_asm_volatile_p (t) || gimple_asm_input_p (t)))
6674 /* Add fake edges to the function exit for any non constant and non
6675 noreturn calls, volatile inline assembly in the bitmap of blocks
6676 specified by BLOCKS or to the whole CFG if BLOCKS is zero. Return
6677 the number of blocks that were split.
6679 The goal is to expose cases in which entering a basic block does
6680 not imply that all subsequent instructions must be executed. */
6683 gimple_flow_call_edges_add (sbitmap blocks)
6686 int blocks_split = 0;
6687 int last_bb = last_basic_block;
6688 bool check_last_block = false;
6690 if (n_basic_blocks == NUM_FIXED_BLOCKS)
6694 check_last_block = true;
6696 check_last_block = TEST_BIT (blocks, EXIT_BLOCK_PTR->prev_bb->index);
6698 /* In the last basic block, before epilogue generation, there will be
6699 a fallthru edge to EXIT. Special care is required if the last insn
6700 of the last basic block is a call because make_edge folds duplicate
6701 edges, which would result in the fallthru edge also being marked
6702 fake, which would result in the fallthru edge being removed by
6703 remove_fake_edges, which would result in an invalid CFG.
6705 Moreover, we can't elide the outgoing fake edge, since the block
6706 profiler needs to take this into account in order to solve the minimal
6707 spanning tree in the case that the call doesn't return.
6709 Handle this by adding a dummy instruction in a new last basic block. */
6710 if (check_last_block)
6712 basic_block bb = EXIT_BLOCK_PTR->prev_bb;
6713 gimple_stmt_iterator gsi = gsi_last_nondebug_bb (bb);
6716 if (!gsi_end_p (gsi))
6719 if (t && need_fake_edge_p (t))
6723 e = find_edge (bb, EXIT_BLOCK_PTR);
6726 gsi_insert_on_edge (e, gimple_build_nop ());
6727 gsi_commit_edge_inserts ();
6732 /* Now add fake edges to the function exit for any non constant
6733 calls since there is no way that we can determine if they will
6735 for (i = 0; i < last_bb; i++)
6737 basic_block bb = BASIC_BLOCK (i);
6738 gimple_stmt_iterator gsi;
6739 gimple stmt, last_stmt;
6744 if (blocks && !TEST_BIT (blocks, i))
6747 gsi = gsi_last_nondebug_bb (bb);
6748 if (!gsi_end_p (gsi))
6750 last_stmt = gsi_stmt (gsi);
6753 stmt = gsi_stmt (gsi);
6754 if (need_fake_edge_p (stmt))
6758 /* The handling above of the final block before the
6759 epilogue should be enough to verify that there is
6760 no edge to the exit block in CFG already.
6761 Calling make_edge in such case would cause us to
6762 mark that edge as fake and remove it later. */
6763 #ifdef ENABLE_CHECKING
6764 if (stmt == last_stmt)
6766 e = find_edge (bb, EXIT_BLOCK_PTR);
6767 gcc_assert (e == NULL);
6771 /* Note that the following may create a new basic block
6772 and renumber the existing basic blocks. */
6773 if (stmt != last_stmt)
6775 e = split_block (bb, stmt);
6779 make_edge (bb, EXIT_BLOCK_PTR, EDGE_FAKE);
6783 while (!gsi_end_p (gsi));
6788 verify_flow_info ();
6790 return blocks_split;
6793 /* Removes edge E and all the blocks dominated by it, and updates dominance
6794 information. The IL in E->src needs to be updated separately.
6795 If dominance info is not available, only the edge E is removed.*/
6798 remove_edge_and_dominated_blocks (edge e)
6800 VEC (basic_block, heap) *bbs_to_remove = NULL;
6801 VEC (basic_block, heap) *bbs_to_fix_dom = NULL;
6805 bool none_removed = false;
6807 basic_block bb, dbb;
6810 if (!dom_info_available_p (CDI_DOMINATORS))
6816 /* No updating is needed for edges to exit. */
6817 if (e->dest == EXIT_BLOCK_PTR)
6819 if (cfgcleanup_altered_bbs)
6820 bitmap_set_bit (cfgcleanup_altered_bbs, e->src->index);
6825 /* First, we find the basic blocks to remove. If E->dest has a predecessor
6826 that is not dominated by E->dest, then this set is empty. Otherwise,
6827 all the basic blocks dominated by E->dest are removed.
6829 Also, to DF_IDOM we store the immediate dominators of the blocks in
6830 the dominance frontier of E (i.e., of the successors of the
6831 removed blocks, if there are any, and of E->dest otherwise). */
6832 FOR_EACH_EDGE (f, ei, e->dest->preds)
6837 if (!dominated_by_p (CDI_DOMINATORS, f->src, e->dest))
6839 none_removed = true;
6844 df = BITMAP_ALLOC (NULL);
6845 df_idom = BITMAP_ALLOC (NULL);
6848 bitmap_set_bit (df_idom,
6849 get_immediate_dominator (CDI_DOMINATORS, e->dest)->index);
6852 bbs_to_remove = get_all_dominated_blocks (CDI_DOMINATORS, e->dest);
6853 FOR_EACH_VEC_ELT (basic_block, bbs_to_remove, i, bb)
6855 FOR_EACH_EDGE (f, ei, bb->succs)
6857 if (f->dest != EXIT_BLOCK_PTR)
6858 bitmap_set_bit (df, f->dest->index);
6861 FOR_EACH_VEC_ELT (basic_block, bbs_to_remove, i, bb)
6862 bitmap_clear_bit (df, bb->index);
6864 EXECUTE_IF_SET_IN_BITMAP (df, 0, i, bi)
6866 bb = BASIC_BLOCK (i);
6867 bitmap_set_bit (df_idom,
6868 get_immediate_dominator (CDI_DOMINATORS, bb)->index);
6872 if (cfgcleanup_altered_bbs)
6874 /* Record the set of the altered basic blocks. */
6875 bitmap_set_bit (cfgcleanup_altered_bbs, e->src->index);
6876 bitmap_ior_into (cfgcleanup_altered_bbs, df);
6879 /* Remove E and the cancelled blocks. */
6884 /* Walk backwards so as to get a chance to substitute all
6885 released DEFs into debug stmts. See
6886 eliminate_unnecessary_stmts() in tree-ssa-dce.c for more
6888 for (i = VEC_length (basic_block, bbs_to_remove); i-- > 0; )
6889 delete_basic_block (VEC_index (basic_block, bbs_to_remove, i));
6892 /* Update the dominance information. The immediate dominator may change only
6893 for blocks whose immediate dominator belongs to DF_IDOM:
6895 Suppose that idom(X) = Y before removal of E and idom(X) != Y after the
6896 removal. Let Z the arbitrary block such that idom(Z) = Y and
6897 Z dominates X after the removal. Before removal, there exists a path P
6898 from Y to X that avoids Z. Let F be the last edge on P that is
6899 removed, and let W = F->dest. Before removal, idom(W) = Y (since Y
6900 dominates W, and because of P, Z does not dominate W), and W belongs to
6901 the dominance frontier of E. Therefore, Y belongs to DF_IDOM. */
6902 EXECUTE_IF_SET_IN_BITMAP (df_idom, 0, i, bi)
6904 bb = BASIC_BLOCK (i);
6905 for (dbb = first_dom_son (CDI_DOMINATORS, bb);
6907 dbb = next_dom_son (CDI_DOMINATORS, dbb))
6908 VEC_safe_push (basic_block, heap, bbs_to_fix_dom, dbb);
6911 iterate_fix_dominators (CDI_DOMINATORS, bbs_to_fix_dom, true);
6914 BITMAP_FREE (df_idom);
6915 VEC_free (basic_block, heap, bbs_to_remove);
6916 VEC_free (basic_block, heap, bbs_to_fix_dom);
6919 /* Purge dead EH edges from basic block BB. */
6922 gimple_purge_dead_eh_edges (basic_block bb)
6924 bool changed = false;
6927 gimple stmt = last_stmt (bb);
6929 if (stmt && stmt_can_throw_internal (stmt))
6932 for (ei = ei_start (bb->succs); (e = ei_safe_edge (ei)); )
6934 if (e->flags & EDGE_EH)
6936 remove_edge_and_dominated_blocks (e);
6946 /* Purge dead EH edges from basic block listed in BLOCKS. */
6949 gimple_purge_all_dead_eh_edges (const_bitmap blocks)
6951 bool changed = false;
6955 EXECUTE_IF_SET_IN_BITMAP (blocks, 0, i, bi)
6957 basic_block bb = BASIC_BLOCK (i);
6959 /* Earlier gimple_purge_dead_eh_edges could have removed
6960 this basic block already. */
6961 gcc_assert (bb || changed);
6963 changed |= gimple_purge_dead_eh_edges (bb);
6969 /* Purge dead abnormal call edges from basic block BB. */
6972 gimple_purge_dead_abnormal_call_edges (basic_block bb)
6974 bool changed = false;
6977 gimple stmt = last_stmt (bb);
6979 if (!cfun->has_nonlocal_label)
6982 if (stmt && stmt_can_make_abnormal_goto (stmt))
6985 for (ei = ei_start (bb->succs); (e = ei_safe_edge (ei)); )
6987 if (e->flags & EDGE_ABNORMAL)
6989 remove_edge_and_dominated_blocks (e);
6999 /* Purge dead abnormal call edges from basic block listed in BLOCKS. */
7002 gimple_purge_all_dead_abnormal_call_edges (const_bitmap blocks)
7004 bool changed = false;
7008 EXECUTE_IF_SET_IN_BITMAP (blocks, 0, i, bi)
7010 basic_block bb = BASIC_BLOCK (i);
7012 /* Earlier gimple_purge_dead_abnormal_call_edges could have removed
7013 this basic block already. */
7014 gcc_assert (bb || changed);
7016 changed |= gimple_purge_dead_abnormal_call_edges (bb);
7022 /* This function is called whenever a new edge is created or
7026 gimple_execute_on_growing_pred (edge e)
7028 basic_block bb = e->dest;
7030 if (!gimple_seq_empty_p (phi_nodes (bb)))
7031 reserve_phi_args_for_new_edge (bb);
7034 /* This function is called immediately before edge E is removed from
7035 the edge vector E->dest->preds. */
7038 gimple_execute_on_shrinking_pred (edge e)
7040 if (!gimple_seq_empty_p (phi_nodes (e->dest)))
7041 remove_phi_args (e);
7044 /*---------------------------------------------------------------------------
7045 Helper functions for Loop versioning
7046 ---------------------------------------------------------------------------*/
7048 /* Adjust phi nodes for 'first' basic block. 'second' basic block is a copy
7049 of 'first'. Both of them are dominated by 'new_head' basic block. When
7050 'new_head' was created by 'second's incoming edge it received phi arguments
7051 on the edge by split_edge(). Later, additional edge 'e' was created to
7052 connect 'new_head' and 'first'. Now this routine adds phi args on this
7053 additional edge 'e' that new_head to second edge received as part of edge
7057 gimple_lv_adjust_loop_header_phi (basic_block first, basic_block second,
7058 basic_block new_head, edge e)
7061 gimple_stmt_iterator psi1, psi2;
7063 edge e2 = find_edge (new_head, second);
7065 /* Because NEW_HEAD has been created by splitting SECOND's incoming
7066 edge, we should always have an edge from NEW_HEAD to SECOND. */
7067 gcc_assert (e2 != NULL);
7069 /* Browse all 'second' basic block phi nodes and add phi args to
7070 edge 'e' for 'first' head. PHI args are always in correct order. */
7072 for (psi2 = gsi_start_phis (second),
7073 psi1 = gsi_start_phis (first);
7074 !gsi_end_p (psi2) && !gsi_end_p (psi1);
7075 gsi_next (&psi2), gsi_next (&psi1))
7077 phi1 = gsi_stmt (psi1);
7078 phi2 = gsi_stmt (psi2);
7079 def = PHI_ARG_DEF (phi2, e2->dest_idx);
7080 add_phi_arg (phi1, def, e, gimple_phi_arg_location_from_edge (phi2, e2));
7085 /* Adds a if else statement to COND_BB with condition COND_EXPR.
7086 SECOND_HEAD is the destination of the THEN and FIRST_HEAD is
7087 the destination of the ELSE part. */
7090 gimple_lv_add_condition_to_bb (basic_block first_head ATTRIBUTE_UNUSED,
7091 basic_block second_head ATTRIBUTE_UNUSED,
7092 basic_block cond_bb, void *cond_e)
7094 gimple_stmt_iterator gsi;
7095 gimple new_cond_expr;
7096 tree cond_expr = (tree) cond_e;
7099 /* Build new conditional expr */
7100 new_cond_expr = gimple_build_cond_from_tree (cond_expr,
7101 NULL_TREE, NULL_TREE);
7103 /* Add new cond in cond_bb. */
7104 gsi = gsi_last_bb (cond_bb);
7105 gsi_insert_after (&gsi, new_cond_expr, GSI_NEW_STMT);
7107 /* Adjust edges appropriately to connect new head with first head
7108 as well as second head. */
7109 e0 = single_succ_edge (cond_bb);
7110 e0->flags &= ~EDGE_FALLTHRU;
7111 e0->flags |= EDGE_FALSE_VALUE;
7114 struct cfg_hooks gimple_cfg_hooks = {
7116 gimple_verify_flow_info,
7117 gimple_dump_bb, /* dump_bb */
7118 create_bb, /* create_basic_block */
7119 gimple_redirect_edge_and_branch, /* redirect_edge_and_branch */
7120 gimple_redirect_edge_and_branch_force, /* redirect_edge_and_branch_force */
7121 gimple_can_remove_branch_p, /* can_remove_branch_p */
7122 remove_bb, /* delete_basic_block */
7123 gimple_split_block, /* split_block */
7124 gimple_move_block_after, /* move_block_after */
7125 gimple_can_merge_blocks_p, /* can_merge_blocks_p */
7126 gimple_merge_blocks, /* merge_blocks */
7127 gimple_predict_edge, /* predict_edge */
7128 gimple_predicted_by_p, /* predicted_by_p */
7129 gimple_can_duplicate_bb_p, /* can_duplicate_block_p */
7130 gimple_duplicate_bb, /* duplicate_block */
7131 gimple_split_edge, /* split_edge */
7132 gimple_make_forwarder_block, /* make_forward_block */
7133 NULL, /* tidy_fallthru_edge */
7134 NULL, /* force_nonfallthru */
7135 gimple_block_ends_with_call_p,/* block_ends_with_call_p */
7136 gimple_block_ends_with_condjump_p, /* block_ends_with_condjump_p */
7137 gimple_flow_call_edges_add, /* flow_call_edges_add */
7138 gimple_execute_on_growing_pred, /* execute_on_growing_pred */
7139 gimple_execute_on_shrinking_pred, /* execute_on_shrinking_pred */
7140 gimple_duplicate_loop_to_header_edge, /* duplicate loop for trees */
7141 gimple_lv_add_condition_to_bb, /* lv_add_condition_to_bb */
7142 gimple_lv_adjust_loop_header_phi, /* lv_adjust_loop_header_phi*/
7143 extract_true_false_edges_from_block, /* extract_cond_bb_edges */
7144 flush_pending_stmts /* flush_pending_stmts */
7148 /* Split all critical edges. */
7151 split_critical_edges (void)
7157 /* split_edge can redirect edges out of SWITCH_EXPRs, which can get
7158 expensive. So we want to enable recording of edge to CASE_LABEL_EXPR
7159 mappings around the calls to split_edge. */
7160 start_recording_case_labels ();
7163 FOR_EACH_EDGE (e, ei, bb->succs)
7165 if (EDGE_CRITICAL_P (e) && !(e->flags & EDGE_ABNORMAL))
7167 /* PRE inserts statements to edges and expects that
7168 since split_critical_edges was done beforehand, committing edge
7169 insertions will not split more edges. In addition to critical
7170 edges we must split edges that have multiple successors and
7171 end by control flow statements, such as RESX.
7172 Go ahead and split them too. This matches the logic in
7173 gimple_find_edge_insert_loc. */
7174 else if ((!single_pred_p (e->dest)
7175 || !gimple_seq_empty_p (phi_nodes (e->dest))
7176 || e->dest == EXIT_BLOCK_PTR)
7177 && e->src != ENTRY_BLOCK_PTR
7178 && !(e->flags & EDGE_ABNORMAL))
7180 gimple_stmt_iterator gsi;
7182 gsi = gsi_last_bb (e->src);
7183 if (!gsi_end_p (gsi)
7184 && stmt_ends_bb_p (gsi_stmt (gsi))
7185 && (gimple_code (gsi_stmt (gsi)) != GIMPLE_RETURN
7186 && !gimple_call_builtin_p (gsi_stmt (gsi),
7192 end_recording_case_labels ();
7196 struct gimple_opt_pass pass_split_crit_edges =
7200 "crited", /* name */
7202 split_critical_edges, /* execute */
7205 0, /* static_pass_number */
7206 TV_TREE_SPLIT_EDGES, /* tv_id */
7207 PROP_cfg, /* properties required */
7208 PROP_no_crit_edges, /* properties_provided */
7209 0, /* properties_destroyed */
7210 0, /* todo_flags_start */
7211 TODO_verify_flow /* todo_flags_finish */
7216 /* Build a ternary operation and gimplify it. Emit code before GSI.
7217 Return the gimple_val holding the result. */
7220 gimplify_build3 (gimple_stmt_iterator *gsi, enum tree_code code,
7221 tree type, tree a, tree b, tree c)
7224 location_t loc = gimple_location (gsi_stmt (*gsi));
7226 ret = fold_build3_loc (loc, code, type, a, b, c);
7229 return force_gimple_operand_gsi (gsi, ret, true, NULL, true,
7233 /* Build a binary operation and gimplify it. Emit code before GSI.
7234 Return the gimple_val holding the result. */
7237 gimplify_build2 (gimple_stmt_iterator *gsi, enum tree_code code,
7238 tree type, tree a, tree b)
7242 ret = fold_build2_loc (gimple_location (gsi_stmt (*gsi)), code, type, a, b);
7245 return force_gimple_operand_gsi (gsi, ret, true, NULL, true,
7249 /* Build a unary operation and gimplify it. Emit code before GSI.
7250 Return the gimple_val holding the result. */
7253 gimplify_build1 (gimple_stmt_iterator *gsi, enum tree_code code, tree type,
7258 ret = fold_build1_loc (gimple_location (gsi_stmt (*gsi)), code, type, a);
7261 return force_gimple_operand_gsi (gsi, ret, true, NULL, true,
7267 /* Emit return warnings. */
7270 execute_warn_function_return (void)
7272 source_location location;
7277 /* If we have a path to EXIT, then we do return. */
7278 if (TREE_THIS_VOLATILE (cfun->decl)
7279 && EDGE_COUNT (EXIT_BLOCK_PTR->preds) > 0)
7281 location = UNKNOWN_LOCATION;
7282 FOR_EACH_EDGE (e, ei, EXIT_BLOCK_PTR->preds)
7284 last = last_stmt (e->src);
7285 if ((gimple_code (last) == GIMPLE_RETURN
7286 || gimple_call_builtin_p (last, BUILT_IN_RETURN))
7287 && (location = gimple_location (last)) != UNKNOWN_LOCATION)
7290 if (location == UNKNOWN_LOCATION)
7291 location = cfun->function_end_locus;
7292 warning_at (location, 0, "%<noreturn%> function does return");
7295 /* If we see "return;" in some basic block, then we do reach the end
7296 without returning a value. */
7297 else if (warn_return_type
7298 && !TREE_NO_WARNING (cfun->decl)
7299 && EDGE_COUNT (EXIT_BLOCK_PTR->preds) > 0
7300 && !VOID_TYPE_P (TREE_TYPE (TREE_TYPE (cfun->decl))))
7302 FOR_EACH_EDGE (e, ei, EXIT_BLOCK_PTR->preds)
7304 gimple last = last_stmt (e->src);
7305 if (gimple_code (last) == GIMPLE_RETURN
7306 && gimple_return_retval (last) == NULL
7307 && !gimple_no_warning_p (last))
7309 location = gimple_location (last);
7310 if (location == UNKNOWN_LOCATION)
7311 location = cfun->function_end_locus;
7312 warning_at (location, OPT_Wreturn_type, "control reaches end of non-void function");
7313 TREE_NO_WARNING (cfun->decl) = 1;
7322 /* Given a basic block B which ends with a conditional and has
7323 precisely two successors, determine which of the edges is taken if
7324 the conditional is true and which is taken if the conditional is
7325 false. Set TRUE_EDGE and FALSE_EDGE appropriately. */
7328 extract_true_false_edges_from_block (basic_block b,
7332 edge e = EDGE_SUCC (b, 0);
7334 if (e->flags & EDGE_TRUE_VALUE)
7337 *false_edge = EDGE_SUCC (b, 1);
7342 *true_edge = EDGE_SUCC (b, 1);
7346 struct gimple_opt_pass pass_warn_function_return =
7350 "*warn_function_return", /* name */
7352 execute_warn_function_return, /* execute */
7355 0, /* static_pass_number */
7356 TV_NONE, /* tv_id */
7357 PROP_cfg, /* properties_required */
7358 0, /* properties_provided */
7359 0, /* properties_destroyed */
7360 0, /* todo_flags_start */
7361 0 /* todo_flags_finish */
7365 /* Emit noreturn warnings. */
7368 execute_warn_function_noreturn (void)
7370 if (!TREE_THIS_VOLATILE (current_function_decl)
7371 && EDGE_COUNT (EXIT_BLOCK_PTR->preds) == 0)
7372 warn_function_noreturn (current_function_decl);
7377 gate_warn_function_noreturn (void)
7379 return warn_suggest_attribute_noreturn;
7382 struct gimple_opt_pass pass_warn_function_noreturn =
7386 "*warn_function_noreturn", /* name */
7387 gate_warn_function_noreturn, /* gate */
7388 execute_warn_function_noreturn, /* execute */
7391 0, /* static_pass_number */
7392 TV_NONE, /* tv_id */
7393 PROP_cfg, /* properties_required */
7394 0, /* properties_provided */
7395 0, /* properties_destroyed */
7396 0, /* todo_flags_start */
7397 0 /* todo_flags_finish */
7402 /* Walk a gimplified function and warn for functions whose return value is
7403 ignored and attribute((warn_unused_result)) is set. This is done before
7404 inlining, so we don't have to worry about that. */
7407 do_warn_unused_result (gimple_seq seq)
7410 gimple_stmt_iterator i;
7412 for (i = gsi_start (seq); !gsi_end_p (i); gsi_next (&i))
7414 gimple g = gsi_stmt (i);
7416 switch (gimple_code (g))
7419 do_warn_unused_result (gimple_bind_body (g));
7422 do_warn_unused_result (gimple_try_eval (g));
7423 do_warn_unused_result (gimple_try_cleanup (g));
7426 do_warn_unused_result (gimple_catch_handler (g));
7428 case GIMPLE_EH_FILTER:
7429 do_warn_unused_result (gimple_eh_filter_failure (g));
7433 if (gimple_call_lhs (g))
7435 if (gimple_call_internal_p (g))
7438 /* This is a naked call, as opposed to a GIMPLE_CALL with an
7439 LHS. All calls whose value is ignored should be
7440 represented like this. Look for the attribute. */
7441 fdecl = gimple_call_fndecl (g);
7442 ftype = gimple_call_fntype (g);
7444 if (lookup_attribute ("warn_unused_result", TYPE_ATTRIBUTES (ftype)))
7446 location_t loc = gimple_location (g);
7449 warning_at (loc, OPT_Wunused_result,
7450 "ignoring return value of %qD, "
7451 "declared with attribute warn_unused_result",
7454 warning_at (loc, OPT_Wunused_result,
7455 "ignoring return value of function "
7456 "declared with attribute warn_unused_result");
7461 /* Not a container, not a call, or a call whose value is used. */
7468 run_warn_unused_result (void)
7470 do_warn_unused_result (gimple_body (current_function_decl));
7475 gate_warn_unused_result (void)
7477 return flag_warn_unused_result;
7480 struct gimple_opt_pass pass_warn_unused_result =
7484 "*warn_unused_result", /* name */
7485 gate_warn_unused_result, /* gate */
7486 run_warn_unused_result, /* execute */
7489 0, /* static_pass_number */
7490 TV_NONE, /* tv_id */
7491 PROP_gimple_any, /* properties_required */
7492 0, /* properties_provided */
7493 0, /* properties_destroyed */
7494 0, /* todo_flags_start */
7495 0, /* todo_flags_finish */