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 | EDGE_PRESERVE))
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)
1569 gimple_stmt_iterator gsi = gsi_for_stmt (stmt);
1573 stmt = gsi_stmt (gsi);
1574 if (cfgcleanup_altered_bbs && !is_gimple_debug (stmt))
1575 bitmap_set_bit (cfgcleanup_altered_bbs, gimple_bb (stmt)->index);
1577 /* FIXME. This should go in update_stmt. */
1578 for (i = 0; i < gimple_num_ops (stmt); i++)
1580 tree op = gimple_op (stmt, i);
1581 /* Operands may be empty here. For example, the labels
1582 of a GIMPLE_COND are nulled out following the creation
1583 of the corresponding CFG edges. */
1584 if (op && TREE_CODE (op) == ADDR_EXPR)
1585 recompute_tree_invariant_for_addr_expr (op);
1588 maybe_clean_or_replace_eh_stmt (stmt, stmt);
1593 gcc_assert (has_zero_uses (name));
1595 /* Also update the trees stored in loop structures. */
1601 FOR_EACH_LOOP (li, loop, 0)
1603 substitute_in_loop_info (loop, name, val);
1608 /* Merge block B into block A. */
1611 gimple_merge_blocks (basic_block a, basic_block b)
1613 gimple_stmt_iterator last, gsi, psi;
1614 gimple_seq phis = phi_nodes (b);
1617 fprintf (dump_file, "Merging blocks %d and %d\n", a->index, b->index);
1619 /* Remove all single-valued PHI nodes from block B of the form
1620 V_i = PHI <V_j> by propagating V_j to all the uses of V_i. */
1621 gsi = gsi_last_bb (a);
1622 for (psi = gsi_start (phis); !gsi_end_p (psi); )
1624 gimple phi = gsi_stmt (psi);
1625 tree def = gimple_phi_result (phi), use = gimple_phi_arg_def (phi, 0);
1627 bool may_replace_uses = !is_gimple_reg (def)
1628 || may_propagate_copy (def, use);
1630 /* In case we maintain loop closed ssa form, do not propagate arguments
1631 of loop exit phi nodes. */
1633 && loops_state_satisfies_p (LOOP_CLOSED_SSA)
1634 && is_gimple_reg (def)
1635 && TREE_CODE (use) == SSA_NAME
1636 && a->loop_father != b->loop_father)
1637 may_replace_uses = false;
1639 if (!may_replace_uses)
1641 gcc_assert (is_gimple_reg (def));
1643 /* Note that just emitting the copies is fine -- there is no problem
1644 with ordering of phi nodes. This is because A is the single
1645 predecessor of B, therefore results of the phi nodes cannot
1646 appear as arguments of the phi nodes. */
1647 copy = gimple_build_assign (def, use);
1648 gsi_insert_after (&gsi, copy, GSI_NEW_STMT);
1649 remove_phi_node (&psi, false);
1653 /* If we deal with a PHI for virtual operands, we can simply
1654 propagate these without fussing with folding or updating
1656 if (!is_gimple_reg (def))
1658 imm_use_iterator iter;
1659 use_operand_p use_p;
1662 FOR_EACH_IMM_USE_STMT (stmt, iter, def)
1663 FOR_EACH_IMM_USE_ON_STMT (use_p, iter)
1664 SET_USE (use_p, use);
1666 if (SSA_NAME_OCCURS_IN_ABNORMAL_PHI (def))
1667 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (use) = 1;
1670 replace_uses_by (def, use);
1672 remove_phi_node (&psi, true);
1676 /* Ensure that B follows A. */
1677 move_block_after (b, a);
1679 gcc_assert (single_succ_edge (a)->flags & EDGE_FALLTHRU);
1680 gcc_assert (!last_stmt (a) || !stmt_ends_bb_p (last_stmt (a)));
1682 /* Remove labels from B and set gimple_bb to A for other statements. */
1683 for (gsi = gsi_start_bb (b); !gsi_end_p (gsi);)
1685 gimple stmt = gsi_stmt (gsi);
1686 if (gimple_code (stmt) == GIMPLE_LABEL)
1688 tree label = gimple_label_label (stmt);
1691 gsi_remove (&gsi, false);
1693 /* Now that we can thread computed gotos, we might have
1694 a situation where we have a forced label in block B
1695 However, the label at the start of block B might still be
1696 used in other ways (think about the runtime checking for
1697 Fortran assigned gotos). So we can not just delete the
1698 label. Instead we move the label to the start of block A. */
1699 if (FORCED_LABEL (label))
1701 gimple_stmt_iterator dest_gsi = gsi_start_bb (a);
1702 gsi_insert_before (&dest_gsi, stmt, GSI_NEW_STMT);
1705 lp_nr = EH_LANDING_PAD_NR (label);
1708 eh_landing_pad lp = get_eh_landing_pad_from_number (lp_nr);
1709 lp->post_landing_pad = NULL;
1714 gimple_set_bb (stmt, a);
1719 /* Merge the sequences. */
1720 last = gsi_last_bb (a);
1721 gsi_insert_seq_after (&last, bb_seq (b), GSI_NEW_STMT);
1722 set_bb_seq (b, NULL);
1724 if (cfgcleanup_altered_bbs)
1725 bitmap_set_bit (cfgcleanup_altered_bbs, a->index);
1729 /* Return the one of two successors of BB that is not reachable by a
1730 complex edge, if there is one. Else, return BB. We use
1731 this in optimizations that use post-dominators for their heuristics,
1732 to catch the cases in C++ where function calls are involved. */
1735 single_noncomplex_succ (basic_block bb)
1738 if (EDGE_COUNT (bb->succs) != 2)
1741 e0 = EDGE_SUCC (bb, 0);
1742 e1 = EDGE_SUCC (bb, 1);
1743 if (e0->flags & EDGE_COMPLEX)
1745 if (e1->flags & EDGE_COMPLEX)
1751 /* T is CALL_EXPR. Set current_function_calls_* flags. */
1754 notice_special_calls (gimple call)
1756 int flags = gimple_call_flags (call);
1758 if (flags & ECF_MAY_BE_ALLOCA)
1759 cfun->calls_alloca = true;
1760 if (flags & ECF_RETURNS_TWICE)
1761 cfun->calls_setjmp = true;
1765 /* Clear flags set by notice_special_calls. Used by dead code removal
1766 to update the flags. */
1769 clear_special_calls (void)
1771 cfun->calls_alloca = false;
1772 cfun->calls_setjmp = false;
1775 /* Remove PHI nodes associated with basic block BB and all edges out of BB. */
1778 remove_phi_nodes_and_edges_for_unreachable_block (basic_block bb)
1780 /* Since this block is no longer reachable, we can just delete all
1781 of its PHI nodes. */
1782 remove_phi_nodes (bb);
1784 /* Remove edges to BB's successors. */
1785 while (EDGE_COUNT (bb->succs) > 0)
1786 remove_edge (EDGE_SUCC (bb, 0));
1790 /* Remove statements of basic block BB. */
1793 remove_bb (basic_block bb)
1795 gimple_stmt_iterator i;
1799 fprintf (dump_file, "Removing basic block %d\n", bb->index);
1800 if (dump_flags & TDF_DETAILS)
1802 dump_bb (bb, dump_file, 0);
1803 fprintf (dump_file, "\n");
1809 struct loop *loop = bb->loop_father;
1811 /* If a loop gets removed, clean up the information associated
1813 if (loop->latch == bb
1814 || loop->header == bb)
1815 free_numbers_of_iterations_estimates_loop (loop);
1818 /* Remove all the instructions in the block. */
1819 if (bb_seq (bb) != NULL)
1821 /* Walk backwards so as to get a chance to substitute all
1822 released DEFs into debug stmts. See
1823 eliminate_unnecessary_stmts() in tree-ssa-dce.c for more
1825 for (i = gsi_last_bb (bb); !gsi_end_p (i);)
1827 gimple stmt = gsi_stmt (i);
1828 if (gimple_code (stmt) == GIMPLE_LABEL
1829 && (FORCED_LABEL (gimple_label_label (stmt))
1830 || DECL_NONLOCAL (gimple_label_label (stmt))))
1833 gimple_stmt_iterator new_gsi;
1835 /* A non-reachable non-local label may still be referenced.
1836 But it no longer needs to carry the extra semantics of
1838 if (DECL_NONLOCAL (gimple_label_label (stmt)))
1840 DECL_NONLOCAL (gimple_label_label (stmt)) = 0;
1841 FORCED_LABEL (gimple_label_label (stmt)) = 1;
1844 new_bb = bb->prev_bb;
1845 new_gsi = gsi_start_bb (new_bb);
1846 gsi_remove (&i, false);
1847 gsi_insert_before (&new_gsi, stmt, GSI_NEW_STMT);
1851 /* Release SSA definitions if we are in SSA. Note that we
1852 may be called when not in SSA. For example,
1853 final_cleanup calls this function via
1854 cleanup_tree_cfg. */
1855 if (gimple_in_ssa_p (cfun))
1856 release_defs (stmt);
1858 gsi_remove (&i, true);
1862 i = gsi_last_bb (bb);
1868 remove_phi_nodes_and_edges_for_unreachable_block (bb);
1869 bb->il.gimple = NULL;
1873 /* Given a basic block BB ending with COND_EXPR or SWITCH_EXPR, and a
1874 predicate VAL, return the edge that will be taken out of the block.
1875 If VAL does not match a unique edge, NULL is returned. */
1878 find_taken_edge (basic_block bb, tree val)
1882 stmt = last_stmt (bb);
1885 gcc_assert (is_ctrl_stmt (stmt));
1890 if (!is_gimple_min_invariant (val))
1893 if (gimple_code (stmt) == GIMPLE_COND)
1894 return find_taken_edge_cond_expr (bb, val);
1896 if (gimple_code (stmt) == GIMPLE_SWITCH)
1897 return find_taken_edge_switch_expr (bb, val);
1899 if (computed_goto_p (stmt))
1901 /* Only optimize if the argument is a label, if the argument is
1902 not a label then we can not construct a proper CFG.
1904 It may be the case that we only need to allow the LABEL_REF to
1905 appear inside an ADDR_EXPR, but we also allow the LABEL_REF to
1906 appear inside a LABEL_EXPR just to be safe. */
1907 if ((TREE_CODE (val) == ADDR_EXPR || TREE_CODE (val) == LABEL_EXPR)
1908 && TREE_CODE (TREE_OPERAND (val, 0)) == LABEL_DECL)
1909 return find_taken_edge_computed_goto (bb, TREE_OPERAND (val, 0));
1916 /* Given a constant value VAL and the entry block BB to a GOTO_EXPR
1917 statement, determine which of the outgoing edges will be taken out of the
1918 block. Return NULL if either edge may be taken. */
1921 find_taken_edge_computed_goto (basic_block bb, tree val)
1926 dest = label_to_block (val);
1929 e = find_edge (bb, dest);
1930 gcc_assert (e != NULL);
1936 /* Given a constant value VAL and the entry block BB to a COND_EXPR
1937 statement, determine which of the two edges will be taken out of the
1938 block. Return NULL if either edge may be taken. */
1941 find_taken_edge_cond_expr (basic_block bb, tree val)
1943 edge true_edge, false_edge;
1945 extract_true_false_edges_from_block (bb, &true_edge, &false_edge);
1947 gcc_assert (TREE_CODE (val) == INTEGER_CST);
1948 return (integer_zerop (val) ? false_edge : true_edge);
1951 /* Given an INTEGER_CST VAL and the entry block BB to a SWITCH_EXPR
1952 statement, determine which edge will be taken out of the block. Return
1953 NULL if any edge may be taken. */
1956 find_taken_edge_switch_expr (basic_block bb, tree val)
1958 basic_block dest_bb;
1963 switch_stmt = last_stmt (bb);
1964 taken_case = find_case_label_for_value (switch_stmt, val);
1965 dest_bb = label_to_block (CASE_LABEL (taken_case));
1967 e = find_edge (bb, dest_bb);
1973 /* Return the CASE_LABEL_EXPR that SWITCH_STMT will take for VAL.
1974 We can make optimal use here of the fact that the case labels are
1975 sorted: We can do a binary search for a case matching VAL. */
1978 find_case_label_for_value (gimple switch_stmt, tree val)
1980 size_t low, high, n = gimple_switch_num_labels (switch_stmt);
1981 tree default_case = gimple_switch_default_label (switch_stmt);
1983 for (low = 0, high = n; high - low > 1; )
1985 size_t i = (high + low) / 2;
1986 tree t = gimple_switch_label (switch_stmt, i);
1989 /* Cache the result of comparing CASE_LOW and val. */
1990 cmp = tree_int_cst_compare (CASE_LOW (t), val);
1997 if (CASE_HIGH (t) == NULL)
1999 /* A singe-valued case label. */
2005 /* A case range. We can only handle integer ranges. */
2006 if (cmp <= 0 && tree_int_cst_compare (CASE_HIGH (t), val) >= 0)
2011 return default_case;
2015 /* Dump a basic block on stderr. */
2018 gimple_debug_bb (basic_block bb)
2020 gimple_dump_bb (bb, stderr, 0, TDF_VOPS|TDF_MEMSYMS);
2024 /* Dump basic block with index N on stderr. */
2027 gimple_debug_bb_n (int n)
2029 gimple_debug_bb (BASIC_BLOCK (n));
2030 return BASIC_BLOCK (n);
2034 /* Dump the CFG on stderr.
2036 FLAGS are the same used by the tree dumping functions
2037 (see TDF_* in tree-pass.h). */
2040 gimple_debug_cfg (int flags)
2042 gimple_dump_cfg (stderr, flags);
2046 /* Dump the program showing basic block boundaries on the given FILE.
2048 FLAGS are the same used by the tree dumping functions (see TDF_* in
2052 gimple_dump_cfg (FILE *file, int flags)
2054 if (flags & TDF_DETAILS)
2056 dump_function_header (file, current_function_decl, flags);
2057 fprintf (file, ";; \n%d basic blocks, %d edges, last basic block %d.\n\n",
2058 n_basic_blocks, n_edges, last_basic_block);
2060 brief_dump_cfg (file);
2061 fprintf (file, "\n");
2064 if (flags & TDF_STATS)
2065 dump_cfg_stats (file);
2067 dump_function_to_file (current_function_decl, file, flags | TDF_BLOCKS);
2071 /* Dump CFG statistics on FILE. */
2074 dump_cfg_stats (FILE *file)
2076 static long max_num_merged_labels = 0;
2077 unsigned long size, total = 0;
2080 const char * const fmt_str = "%-30s%-13s%12s\n";
2081 const char * const fmt_str_1 = "%-30s%13d%11lu%c\n";
2082 const char * const fmt_str_2 = "%-30s%13ld%11lu%c\n";
2083 const char * const fmt_str_3 = "%-43s%11lu%c\n";
2084 const char *funcname
2085 = lang_hooks.decl_printable_name (current_function_decl, 2);
2088 fprintf (file, "\nCFG Statistics for %s\n\n", funcname);
2090 fprintf (file, "---------------------------------------------------------\n");
2091 fprintf (file, fmt_str, "", " Number of ", "Memory");
2092 fprintf (file, fmt_str, "", " instances ", "used ");
2093 fprintf (file, "---------------------------------------------------------\n");
2095 size = n_basic_blocks * sizeof (struct basic_block_def);
2097 fprintf (file, fmt_str_1, "Basic blocks", n_basic_blocks,
2098 SCALE (size), LABEL (size));
2102 num_edges += EDGE_COUNT (bb->succs);
2103 size = num_edges * sizeof (struct edge_def);
2105 fprintf (file, fmt_str_2, "Edges", num_edges, SCALE (size), LABEL (size));
2107 fprintf (file, "---------------------------------------------------------\n");
2108 fprintf (file, fmt_str_3, "Total memory used by CFG data", SCALE (total),
2110 fprintf (file, "---------------------------------------------------------\n");
2111 fprintf (file, "\n");
2113 if (cfg_stats.num_merged_labels > max_num_merged_labels)
2114 max_num_merged_labels = cfg_stats.num_merged_labels;
2116 fprintf (file, "Coalesced label blocks: %ld (Max so far: %ld)\n",
2117 cfg_stats.num_merged_labels, max_num_merged_labels);
2119 fprintf (file, "\n");
2123 /* Dump CFG statistics on stderr. Keep extern so that it's always
2124 linked in the final executable. */
2127 debug_cfg_stats (void)
2129 dump_cfg_stats (stderr);
2133 /* Dump the flowgraph to a .vcg FILE. */
2136 gimple_cfg2vcg (FILE *file)
2141 const char *funcname
2142 = lang_hooks.decl_printable_name (current_function_decl, 2);
2144 /* Write the file header. */
2145 fprintf (file, "graph: { title: \"%s\"\n", funcname);
2146 fprintf (file, "node: { title: \"ENTRY\" label: \"ENTRY\" }\n");
2147 fprintf (file, "node: { title: \"EXIT\" label: \"EXIT\" }\n");
2149 /* Write blocks and edges. */
2150 FOR_EACH_EDGE (e, ei, ENTRY_BLOCK_PTR->succs)
2152 fprintf (file, "edge: { sourcename: \"ENTRY\" targetname: \"%d\"",
2155 if (e->flags & EDGE_FAKE)
2156 fprintf (file, " linestyle: dotted priority: 10");
2158 fprintf (file, " linestyle: solid priority: 100");
2160 fprintf (file, " }\n");
2166 enum gimple_code head_code, end_code;
2167 const char *head_name, *end_name;
2170 gimple first = first_stmt (bb);
2171 gimple last = last_stmt (bb);
2175 head_code = gimple_code (first);
2176 head_name = gimple_code_name[head_code];
2177 head_line = get_lineno (first);
2180 head_name = "no-statement";
2184 end_code = gimple_code (last);
2185 end_name = gimple_code_name[end_code];
2186 end_line = get_lineno (last);
2189 end_name = "no-statement";
2191 fprintf (file, "node: { title: \"%d\" label: \"#%d\\n%s (%d)\\n%s (%d)\"}\n",
2192 bb->index, bb->index, head_name, head_line, end_name,
2195 FOR_EACH_EDGE (e, ei, bb->succs)
2197 if (e->dest == EXIT_BLOCK_PTR)
2198 fprintf (file, "edge: { sourcename: \"%d\" targetname: \"EXIT\"", bb->index);
2200 fprintf (file, "edge: { sourcename: \"%d\" targetname: \"%d\"", bb->index, e->dest->index);
2202 if (e->flags & EDGE_FAKE)
2203 fprintf (file, " priority: 10 linestyle: dotted");
2205 fprintf (file, " priority: 100 linestyle: solid");
2207 fprintf (file, " }\n");
2210 if (bb->next_bb != EXIT_BLOCK_PTR)
2214 fputs ("}\n\n", file);
2219 /*---------------------------------------------------------------------------
2220 Miscellaneous helpers
2221 ---------------------------------------------------------------------------*/
2223 /* Return true if T represents a stmt that always transfers control. */
2226 is_ctrl_stmt (gimple t)
2228 switch (gimple_code (t))
2242 /* Return true if T is a statement that may alter the flow of control
2243 (e.g., a call to a non-returning function). */
2246 is_ctrl_altering_stmt (gimple t)
2250 switch (gimple_code (t))
2254 int flags = gimple_call_flags (t);
2256 /* A non-pure/const call alters flow control if the current
2257 function has nonlocal labels. */
2258 if (!(flags & (ECF_CONST | ECF_PURE | ECF_LEAF))
2259 && cfun->has_nonlocal_label)
2262 /* A call also alters control flow if it does not return. */
2263 if (flags & ECF_NORETURN)
2266 /* BUILT_IN_RETURN call is same as return statement. */
2267 if (gimple_call_builtin_p (t, BUILT_IN_RETURN))
2272 case GIMPLE_EH_DISPATCH:
2273 /* EH_DISPATCH branches to the individual catch handlers at
2274 this level of a try or allowed-exceptions region. It can
2275 fallthru to the next statement as well. */
2279 if (gimple_asm_nlabels (t) > 0)
2284 /* OpenMP directives alter control flow. */
2291 /* If a statement can throw, it alters control flow. */
2292 return stmt_can_throw_internal (t);
2296 /* Return true if T is a simple local goto. */
2299 simple_goto_p (gimple t)
2301 return (gimple_code (t) == GIMPLE_GOTO
2302 && TREE_CODE (gimple_goto_dest (t)) == LABEL_DECL);
2306 /* Return true if T can make an abnormal transfer of control flow.
2307 Transfers of control flow associated with EH are excluded. */
2310 stmt_can_make_abnormal_goto (gimple t)
2312 if (computed_goto_p (t))
2314 if (is_gimple_call (t))
2315 return (gimple_has_side_effects (t) && cfun->has_nonlocal_label
2316 && !(gimple_call_flags (t) & ECF_LEAF));
2321 /* Return true if STMT should start a new basic block. PREV_STMT is
2322 the statement preceding STMT. It is used when STMT is a label or a
2323 case label. Labels should only start a new basic block if their
2324 previous statement wasn't a label. Otherwise, sequence of labels
2325 would generate unnecessary basic blocks that only contain a single
2329 stmt_starts_bb_p (gimple stmt, gimple prev_stmt)
2334 /* Labels start a new basic block only if the preceding statement
2335 wasn't a label of the same type. This prevents the creation of
2336 consecutive blocks that have nothing but a single label. */
2337 if (gimple_code (stmt) == GIMPLE_LABEL)
2339 /* Nonlocal and computed GOTO targets always start a new block. */
2340 if (DECL_NONLOCAL (gimple_label_label (stmt))
2341 || FORCED_LABEL (gimple_label_label (stmt)))
2344 if (prev_stmt && gimple_code (prev_stmt) == GIMPLE_LABEL)
2346 if (DECL_NONLOCAL (gimple_label_label (prev_stmt)))
2349 cfg_stats.num_merged_labels++;
2360 /* Return true if T should end a basic block. */
2363 stmt_ends_bb_p (gimple t)
2365 return is_ctrl_stmt (t) || is_ctrl_altering_stmt (t);
2368 /* Remove block annotations and other data structures. */
2371 delete_tree_cfg_annotations (void)
2373 label_to_block_map = NULL;
2377 /* Return the first statement in basic block BB. */
2380 first_stmt (basic_block bb)
2382 gimple_stmt_iterator i = gsi_start_bb (bb);
2385 while (!gsi_end_p (i) && is_gimple_debug ((stmt = gsi_stmt (i))))
2393 /* Return the first non-label statement in basic block BB. */
2396 first_non_label_stmt (basic_block bb)
2398 gimple_stmt_iterator i = gsi_start_bb (bb);
2399 while (!gsi_end_p (i) && gimple_code (gsi_stmt (i)) == GIMPLE_LABEL)
2401 return !gsi_end_p (i) ? gsi_stmt (i) : NULL;
2404 /* Return the last statement in basic block BB. */
2407 last_stmt (basic_block bb)
2409 gimple_stmt_iterator i = gsi_last_bb (bb);
2412 while (!gsi_end_p (i) && is_gimple_debug ((stmt = gsi_stmt (i))))
2420 /* Return the last statement of an otherwise empty block. Return NULL
2421 if the block is totally empty, or if it contains more than one
2425 last_and_only_stmt (basic_block bb)
2427 gimple_stmt_iterator i = gsi_last_nondebug_bb (bb);
2433 last = gsi_stmt (i);
2434 gsi_prev_nondebug (&i);
2438 /* Empty statements should no longer appear in the instruction stream.
2439 Everything that might have appeared before should be deleted by
2440 remove_useless_stmts, and the optimizers should just gsi_remove
2441 instead of smashing with build_empty_stmt.
2443 Thus the only thing that should appear here in a block containing
2444 one executable statement is a label. */
2445 prev = gsi_stmt (i);
2446 if (gimple_code (prev) == GIMPLE_LABEL)
2452 /* Reinstall those PHI arguments queued in OLD_EDGE to NEW_EDGE. */
2455 reinstall_phi_args (edge new_edge, edge old_edge)
2457 edge_var_map_vector v;
2460 gimple_stmt_iterator phis;
2462 v = redirect_edge_var_map_vector (old_edge);
2466 for (i = 0, phis = gsi_start_phis (new_edge->dest);
2467 VEC_iterate (edge_var_map, v, i, vm) && !gsi_end_p (phis);
2468 i++, gsi_next (&phis))
2470 gimple phi = gsi_stmt (phis);
2471 tree result = redirect_edge_var_map_result (vm);
2472 tree arg = redirect_edge_var_map_def (vm);
2474 gcc_assert (result == gimple_phi_result (phi));
2476 add_phi_arg (phi, arg, new_edge, redirect_edge_var_map_location (vm));
2479 redirect_edge_var_map_clear (old_edge);
2482 /* Returns the basic block after which the new basic block created
2483 by splitting edge EDGE_IN should be placed. Tries to keep the new block
2484 near its "logical" location. This is of most help to humans looking
2485 at debugging dumps. */
2488 split_edge_bb_loc (edge edge_in)
2490 basic_block dest = edge_in->dest;
2491 basic_block dest_prev = dest->prev_bb;
2495 edge e = find_edge (dest_prev, dest);
2496 if (e && !(e->flags & EDGE_COMPLEX))
2497 return edge_in->src;
2502 /* Split a (typically critical) edge EDGE_IN. Return the new block.
2503 Abort on abnormal edges. */
2506 gimple_split_edge (edge edge_in)
2508 basic_block new_bb, after_bb, dest;
2511 /* Abnormal edges cannot be split. */
2512 gcc_assert (!(edge_in->flags & EDGE_ABNORMAL));
2514 dest = edge_in->dest;
2516 after_bb = split_edge_bb_loc (edge_in);
2518 new_bb = create_empty_bb (after_bb);
2519 new_bb->frequency = EDGE_FREQUENCY (edge_in);
2520 new_bb->count = edge_in->count;
2521 new_edge = make_edge (new_bb, dest, EDGE_FALLTHRU);
2522 new_edge->probability = REG_BR_PROB_BASE;
2523 new_edge->count = edge_in->count;
2525 e = redirect_edge_and_branch (edge_in, new_bb);
2526 gcc_assert (e == edge_in);
2527 reinstall_phi_args (new_edge, e);
2533 /* Verify properties of the address expression T with base object BASE. */
2536 verify_address (tree t, tree base)
2539 bool old_side_effects;
2541 bool new_side_effects;
2543 old_constant = TREE_CONSTANT (t);
2544 old_side_effects = TREE_SIDE_EFFECTS (t);
2546 recompute_tree_invariant_for_addr_expr (t);
2547 new_side_effects = TREE_SIDE_EFFECTS (t);
2548 new_constant = TREE_CONSTANT (t);
2550 if (old_constant != new_constant)
2552 error ("constant not recomputed when ADDR_EXPR changed");
2555 if (old_side_effects != new_side_effects)
2557 error ("side effects not recomputed when ADDR_EXPR changed");
2561 if (!(TREE_CODE (base) == VAR_DECL
2562 || TREE_CODE (base) == PARM_DECL
2563 || TREE_CODE (base) == RESULT_DECL))
2566 if (DECL_GIMPLE_REG_P (base))
2568 error ("DECL_GIMPLE_REG_P set on a variable with address taken");
2575 /* Callback for walk_tree, check that all elements with address taken are
2576 properly noticed as such. The DATA is an int* that is 1 if TP was seen
2577 inside a PHI node. */
2580 verify_expr (tree *tp, int *walk_subtrees, void *data ATTRIBUTE_UNUSED)
2587 /* Check operand N for being valid GIMPLE and give error MSG if not. */
2588 #define CHECK_OP(N, MSG) \
2589 do { if (!is_gimple_val (TREE_OPERAND (t, N))) \
2590 { error (MSG); return TREE_OPERAND (t, N); }} while (0)
2592 switch (TREE_CODE (t))
2595 if (SSA_NAME_IN_FREE_LIST (t))
2597 error ("SSA name in freelist but still referenced");
2603 error ("INDIRECT_REF in gimple IL");
2607 x = TREE_OPERAND (t, 0);
2608 if (!POINTER_TYPE_P (TREE_TYPE (x))
2609 || !is_gimple_mem_ref_addr (x))
2611 error ("invalid first operand of MEM_REF");
2614 if (TREE_CODE (TREE_OPERAND (t, 1)) != INTEGER_CST
2615 || !POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (t, 1))))
2617 error ("invalid offset operand of MEM_REF");
2618 return TREE_OPERAND (t, 1);
2620 if (TREE_CODE (x) == ADDR_EXPR
2621 && (x = verify_address (x, TREE_OPERAND (x, 0))))
2627 x = fold (ASSERT_EXPR_COND (t));
2628 if (x == boolean_false_node)
2630 error ("ASSERT_EXPR with an always-false condition");
2636 error ("MODIFY_EXPR not expected while having tuples");
2643 gcc_assert (is_gimple_address (t));
2645 /* Skip any references (they will be checked when we recurse down the
2646 tree) and ensure that any variable used as a prefix is marked
2648 for (x = TREE_OPERAND (t, 0);
2649 handled_component_p (x);
2650 x = TREE_OPERAND (x, 0))
2653 if ((tem = verify_address (t, x)))
2656 if (!(TREE_CODE (x) == VAR_DECL
2657 || TREE_CODE (x) == PARM_DECL
2658 || TREE_CODE (x) == RESULT_DECL))
2661 if (!TREE_ADDRESSABLE (x))
2663 error ("address taken, but ADDRESSABLE bit not set");
2671 x = COND_EXPR_COND (t);
2672 if (!INTEGRAL_TYPE_P (TREE_TYPE (x)))
2674 error ("non-integral used in condition");
2677 if (!is_gimple_condexpr (x))
2679 error ("invalid conditional operand");
2684 case NON_LVALUE_EXPR:
2685 case TRUTH_NOT_EXPR:
2689 case FIX_TRUNC_EXPR:
2694 CHECK_OP (0, "invalid operand to unary operator");
2701 case ARRAY_RANGE_REF:
2703 case VIEW_CONVERT_EXPR:
2704 /* We have a nest of references. Verify that each of the operands
2705 that determine where to reference is either a constant or a variable,
2706 verify that the base is valid, and then show we've already checked
2708 while (handled_component_p (t))
2710 if (TREE_CODE (t) == COMPONENT_REF && TREE_OPERAND (t, 2))
2711 CHECK_OP (2, "invalid COMPONENT_REF offset operator");
2712 else if (TREE_CODE (t) == ARRAY_REF
2713 || TREE_CODE (t) == ARRAY_RANGE_REF)
2715 CHECK_OP (1, "invalid array index");
2716 if (TREE_OPERAND (t, 2))
2717 CHECK_OP (2, "invalid array lower bound");
2718 if (TREE_OPERAND (t, 3))
2719 CHECK_OP (3, "invalid array stride");
2721 else if (TREE_CODE (t) == BIT_FIELD_REF)
2723 if (!host_integerp (TREE_OPERAND (t, 1), 1)
2724 || !host_integerp (TREE_OPERAND (t, 2), 1))
2726 error ("invalid position or size operand to BIT_FIELD_REF");
2729 else if (INTEGRAL_TYPE_P (TREE_TYPE (t))
2730 && (TYPE_PRECISION (TREE_TYPE (t))
2731 != TREE_INT_CST_LOW (TREE_OPERAND (t, 1))))
2733 error ("integral result type precision does not match "
2734 "field size of BIT_FIELD_REF");
2737 if (!INTEGRAL_TYPE_P (TREE_TYPE (t))
2738 && (GET_MODE_PRECISION (TYPE_MODE (TREE_TYPE (t)))
2739 != TREE_INT_CST_LOW (TREE_OPERAND (t, 1))))
2741 error ("mode precision of non-integral result does not "
2742 "match field size of BIT_FIELD_REF");
2747 t = TREE_OPERAND (t, 0);
2750 if (!is_gimple_min_invariant (t) && !is_gimple_lvalue (t))
2752 error ("invalid reference prefix");
2759 /* PLUS_EXPR and MINUS_EXPR don't work on pointers, they should be done using
2760 POINTER_PLUS_EXPR. */
2761 if (POINTER_TYPE_P (TREE_TYPE (t)))
2763 error ("invalid operand to plus/minus, type is a pointer");
2766 CHECK_OP (0, "invalid operand to binary operator");
2767 CHECK_OP (1, "invalid operand to binary operator");
2770 case POINTER_PLUS_EXPR:
2771 /* Check to make sure the first operand is a pointer or reference type. */
2772 if (!POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (t, 0))))
2774 error ("invalid operand to pointer plus, first operand is not a pointer");
2777 /* Check to make sure the second operand is a ptrofftype. */
2778 if (!ptrofftype_p (TREE_TYPE (TREE_OPERAND (t, 1))))
2780 error ("invalid operand to pointer plus, second operand is not an "
2781 "integer type of appropriate width");
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 Because we special-case pointers to void we allow
3199 comparisons of pointers with the same mode as well. */
3200 if (!useless_type_conversion_p (op0_type, op1_type)
3201 && !useless_type_conversion_p (op1_type, op0_type)
3202 && (!POINTER_TYPE_P (op0_type)
3203 || !POINTER_TYPE_P (op1_type)
3204 || TYPE_MODE (op0_type) != TYPE_MODE (op1_type)))
3206 error ("mismatching comparison operand types");
3207 debug_generic_expr (op0_type);
3208 debug_generic_expr (op1_type);
3212 /* The resulting type of a comparison may be an effective boolean type. */
3213 if (INTEGRAL_TYPE_P (type)
3214 && (TREE_CODE (type) == BOOLEAN_TYPE
3215 || TYPE_PRECISION (type) == 1))
3217 /* Or an integer vector type with the same size and element count
3218 as the comparison operand types. */
3219 else if (TREE_CODE (type) == VECTOR_TYPE
3220 && TREE_CODE (TREE_TYPE (type)) == INTEGER_TYPE)
3222 if (TREE_CODE (op0_type) != VECTOR_TYPE
3223 || TREE_CODE (op1_type) != VECTOR_TYPE)
3225 error ("non-vector operands in vector comparison");
3226 debug_generic_expr (op0_type);
3227 debug_generic_expr (op1_type);
3231 if (TYPE_VECTOR_SUBPARTS (type) != TYPE_VECTOR_SUBPARTS (op0_type)
3232 || (GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (type)))
3233 != GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (op0_type)))))
3235 error ("invalid vector comparison resulting type");
3236 debug_generic_expr (type);
3242 error ("bogus comparison result type");
3243 debug_generic_expr (type);
3250 /* Verify a gimple assignment statement STMT with an unary rhs.
3251 Returns true if anything is wrong. */
3254 verify_gimple_assign_unary (gimple stmt)
3256 enum tree_code rhs_code = gimple_assign_rhs_code (stmt);
3257 tree lhs = gimple_assign_lhs (stmt);
3258 tree lhs_type = TREE_TYPE (lhs);
3259 tree rhs1 = gimple_assign_rhs1 (stmt);
3260 tree rhs1_type = TREE_TYPE (rhs1);
3262 if (!is_gimple_reg (lhs))
3264 error ("non-register as LHS of unary operation");
3268 if (!is_gimple_val (rhs1))
3270 error ("invalid operand in unary operation");
3274 /* First handle conversions. */
3279 /* Allow conversions between integral types and pointers only if
3280 there is no sign or zero extension involved.
3281 For targets were the precision of ptrofftype doesn't match that
3282 of pointers we need to allow arbitrary conversions from and
3284 if ((POINTER_TYPE_P (lhs_type)
3285 && INTEGRAL_TYPE_P (rhs1_type)
3286 && (TYPE_PRECISION (lhs_type) >= TYPE_PRECISION (rhs1_type)
3287 || ptrofftype_p (rhs1_type)))
3288 || (POINTER_TYPE_P (rhs1_type)
3289 && INTEGRAL_TYPE_P (lhs_type)
3290 && (TYPE_PRECISION (rhs1_type) >= TYPE_PRECISION (lhs_type)
3291 || ptrofftype_p (sizetype))))
3294 /* Allow conversion from integer to offset type and vice versa. */
3295 if ((TREE_CODE (lhs_type) == OFFSET_TYPE
3296 && TREE_CODE (rhs1_type) == INTEGER_TYPE)
3297 || (TREE_CODE (lhs_type) == INTEGER_TYPE
3298 && TREE_CODE (rhs1_type) == OFFSET_TYPE))
3301 /* Otherwise assert we are converting between types of the
3303 if (INTEGRAL_TYPE_P (lhs_type) != INTEGRAL_TYPE_P (rhs1_type))
3305 error ("invalid types in nop conversion");
3306 debug_generic_expr (lhs_type);
3307 debug_generic_expr (rhs1_type);
3314 case ADDR_SPACE_CONVERT_EXPR:
3316 if (!POINTER_TYPE_P (rhs1_type) || !POINTER_TYPE_P (lhs_type)
3317 || (TYPE_ADDR_SPACE (TREE_TYPE (rhs1_type))
3318 == TYPE_ADDR_SPACE (TREE_TYPE (lhs_type))))
3320 error ("invalid types in address space conversion");
3321 debug_generic_expr (lhs_type);
3322 debug_generic_expr (rhs1_type);
3329 case FIXED_CONVERT_EXPR:
3331 if (!valid_fixed_convert_types_p (lhs_type, rhs1_type)
3332 && !valid_fixed_convert_types_p (rhs1_type, lhs_type))
3334 error ("invalid types in fixed-point conversion");
3335 debug_generic_expr (lhs_type);
3336 debug_generic_expr (rhs1_type);
3345 if (!INTEGRAL_TYPE_P (rhs1_type) || !SCALAR_FLOAT_TYPE_P (lhs_type))
3347 error ("invalid types in conversion to floating point");
3348 debug_generic_expr (lhs_type);
3349 debug_generic_expr (rhs1_type);
3356 case FIX_TRUNC_EXPR:
3358 if (!INTEGRAL_TYPE_P (lhs_type) || !SCALAR_FLOAT_TYPE_P (rhs1_type))
3360 error ("invalid types in conversion to integer");
3361 debug_generic_expr (lhs_type);
3362 debug_generic_expr (rhs1_type);
3369 case VEC_UNPACK_HI_EXPR:
3370 case VEC_UNPACK_LO_EXPR:
3371 case REDUC_MAX_EXPR:
3372 case REDUC_MIN_EXPR:
3373 case REDUC_PLUS_EXPR:
3374 case VEC_UNPACK_FLOAT_HI_EXPR:
3375 case VEC_UNPACK_FLOAT_LO_EXPR:
3383 case NON_LVALUE_EXPR:
3391 /* For the remaining codes assert there is no conversion involved. */
3392 if (!useless_type_conversion_p (lhs_type, rhs1_type))
3394 error ("non-trivial conversion in unary operation");
3395 debug_generic_expr (lhs_type);
3396 debug_generic_expr (rhs1_type);
3403 /* Verify a gimple assignment statement STMT with a binary rhs.
3404 Returns true if anything is wrong. */
3407 verify_gimple_assign_binary (gimple stmt)
3409 enum tree_code rhs_code = gimple_assign_rhs_code (stmt);
3410 tree lhs = gimple_assign_lhs (stmt);
3411 tree lhs_type = TREE_TYPE (lhs);
3412 tree rhs1 = gimple_assign_rhs1 (stmt);
3413 tree rhs1_type = TREE_TYPE (rhs1);
3414 tree rhs2 = gimple_assign_rhs2 (stmt);
3415 tree rhs2_type = TREE_TYPE (rhs2);
3417 if (!is_gimple_reg (lhs))
3419 error ("non-register as LHS of binary operation");
3423 if (!is_gimple_val (rhs1)
3424 || !is_gimple_val (rhs2))
3426 error ("invalid operands in binary operation");
3430 /* First handle operations that involve different types. */
3435 if (TREE_CODE (lhs_type) != COMPLEX_TYPE
3436 || !(INTEGRAL_TYPE_P (rhs1_type)
3437 || SCALAR_FLOAT_TYPE_P (rhs1_type))
3438 || !(INTEGRAL_TYPE_P (rhs2_type)
3439 || SCALAR_FLOAT_TYPE_P (rhs2_type)))
3441 error ("type mismatch in complex expression");
3442 debug_generic_expr (lhs_type);
3443 debug_generic_expr (rhs1_type);
3444 debug_generic_expr (rhs2_type);
3456 /* Shifts and rotates are ok on integral types, fixed point
3457 types and integer vector types. */
3458 if ((!INTEGRAL_TYPE_P (rhs1_type)
3459 && !FIXED_POINT_TYPE_P (rhs1_type)
3460 && !(TREE_CODE (rhs1_type) == VECTOR_TYPE
3461 && INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type))))
3462 || (!INTEGRAL_TYPE_P (rhs2_type)
3463 /* Vector shifts of vectors are also ok. */
3464 && !(TREE_CODE (rhs1_type) == VECTOR_TYPE
3465 && INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type))
3466 && TREE_CODE (rhs2_type) == VECTOR_TYPE
3467 && INTEGRAL_TYPE_P (TREE_TYPE (rhs2_type))))
3468 || !useless_type_conversion_p (lhs_type, rhs1_type))
3470 error ("type mismatch in shift expression");
3471 debug_generic_expr (lhs_type);
3472 debug_generic_expr (rhs1_type);
3473 debug_generic_expr (rhs2_type);
3480 case VEC_LSHIFT_EXPR:
3481 case VEC_RSHIFT_EXPR:
3483 if (TREE_CODE (rhs1_type) != VECTOR_TYPE
3484 || !(INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type))
3485 || POINTER_TYPE_P (TREE_TYPE (rhs1_type))
3486 || FIXED_POINT_TYPE_P (TREE_TYPE (rhs1_type))
3487 || SCALAR_FLOAT_TYPE_P (TREE_TYPE (rhs1_type)))
3488 || (!INTEGRAL_TYPE_P (rhs2_type)
3489 && (TREE_CODE (rhs2_type) != VECTOR_TYPE
3490 || !INTEGRAL_TYPE_P (TREE_TYPE (rhs2_type))))
3491 || !useless_type_conversion_p (lhs_type, rhs1_type))
3493 error ("type mismatch in vector shift expression");
3494 debug_generic_expr (lhs_type);
3495 debug_generic_expr (rhs1_type);
3496 debug_generic_expr (rhs2_type);
3499 /* For shifting a vector of non-integral components we
3500 only allow shifting by a constant multiple of the element size. */
3501 if (!INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type))
3502 && (TREE_CODE (rhs2) != INTEGER_CST
3503 || !div_if_zero_remainder (EXACT_DIV_EXPR, rhs2,
3504 TYPE_SIZE (TREE_TYPE (rhs1_type)))))
3506 error ("non-element sized vector shift of floating point vector");
3516 /* We use regular PLUS_EXPR and MINUS_EXPR for vectors.
3517 ??? This just makes the checker happy and may not be what is
3519 if (TREE_CODE (lhs_type) == VECTOR_TYPE
3520 && POINTER_TYPE_P (TREE_TYPE (lhs_type)))
3522 if (TREE_CODE (rhs1_type) != VECTOR_TYPE
3523 || TREE_CODE (rhs2_type) != VECTOR_TYPE)
3525 error ("invalid non-vector operands to vector valued plus");
3528 lhs_type = TREE_TYPE (lhs_type);
3529 rhs1_type = TREE_TYPE (rhs1_type);
3530 rhs2_type = TREE_TYPE (rhs2_type);
3531 /* PLUS_EXPR is commutative, so we might end up canonicalizing
3532 the pointer to 2nd place. */
3533 if (POINTER_TYPE_P (rhs2_type))
3535 tree tem = rhs1_type;
3536 rhs1_type = rhs2_type;
3539 goto do_pointer_plus_expr_check;
3541 if (POINTER_TYPE_P (lhs_type)
3542 || POINTER_TYPE_P (rhs1_type)
3543 || POINTER_TYPE_P (rhs2_type))
3545 error ("invalid (pointer) operands to plus/minus");
3549 /* Continue with generic binary expression handling. */
3553 case POINTER_PLUS_EXPR:
3555 do_pointer_plus_expr_check:
3556 if (!POINTER_TYPE_P (rhs1_type)
3557 || !useless_type_conversion_p (lhs_type, rhs1_type)
3558 || !ptrofftype_p (rhs2_type))
3560 error ("type mismatch in pointer plus expression");
3561 debug_generic_stmt (lhs_type);
3562 debug_generic_stmt (rhs1_type);
3563 debug_generic_stmt (rhs2_type);
3570 case TRUTH_ANDIF_EXPR:
3571 case TRUTH_ORIF_EXPR:
3572 case TRUTH_AND_EXPR:
3574 case TRUTH_XOR_EXPR:
3584 case UNORDERED_EXPR:
3592 /* Comparisons are also binary, but the result type is not
3593 connected to the operand types. */
3594 return verify_gimple_comparison (lhs_type, rhs1, rhs2);
3596 case WIDEN_MULT_EXPR:
3597 if (TREE_CODE (lhs_type) != INTEGER_TYPE)
3599 return ((2 * TYPE_PRECISION (rhs1_type) > TYPE_PRECISION (lhs_type))
3600 || (TYPE_PRECISION (rhs1_type) != TYPE_PRECISION (rhs2_type)));
3602 case WIDEN_SUM_EXPR:
3603 case VEC_WIDEN_MULT_HI_EXPR:
3604 case VEC_WIDEN_MULT_LO_EXPR:
3605 case VEC_PACK_TRUNC_EXPR:
3606 case VEC_PACK_SAT_EXPR:
3607 case VEC_PACK_FIX_TRUNC_EXPR:
3608 case VEC_EXTRACT_EVEN_EXPR:
3609 case VEC_EXTRACT_ODD_EXPR:
3610 case VEC_INTERLEAVE_HIGH_EXPR:
3611 case VEC_INTERLEAVE_LOW_EXPR:
3616 case TRUNC_DIV_EXPR:
3618 case FLOOR_DIV_EXPR:
3619 case ROUND_DIV_EXPR:
3620 case TRUNC_MOD_EXPR:
3622 case FLOOR_MOD_EXPR:
3623 case ROUND_MOD_EXPR:
3625 case EXACT_DIV_EXPR:
3631 /* Continue with generic binary expression handling. */
3638 if (!useless_type_conversion_p (lhs_type, rhs1_type)
3639 || !useless_type_conversion_p (lhs_type, rhs2_type))
3641 error ("type mismatch in binary expression");
3642 debug_generic_stmt (lhs_type);
3643 debug_generic_stmt (rhs1_type);
3644 debug_generic_stmt (rhs2_type);
3651 /* Verify a gimple assignment statement STMT with a ternary rhs.
3652 Returns true if anything is wrong. */
3655 verify_gimple_assign_ternary (gimple stmt)
3657 enum tree_code rhs_code = gimple_assign_rhs_code (stmt);
3658 tree lhs = gimple_assign_lhs (stmt);
3659 tree lhs_type = TREE_TYPE (lhs);
3660 tree rhs1 = gimple_assign_rhs1 (stmt);
3661 tree rhs1_type = TREE_TYPE (rhs1);
3662 tree rhs2 = gimple_assign_rhs2 (stmt);
3663 tree rhs2_type = TREE_TYPE (rhs2);
3664 tree rhs3 = gimple_assign_rhs3 (stmt);
3665 tree rhs3_type = TREE_TYPE (rhs3);
3667 if (!is_gimple_reg (lhs))
3669 error ("non-register as LHS of ternary operation");
3673 if (((rhs_code == VEC_COND_EXPR || rhs_code == COND_EXPR)
3674 ? !is_gimple_condexpr (rhs1) : !is_gimple_val (rhs1))
3675 || !is_gimple_val (rhs2)
3676 || !is_gimple_val (rhs3))
3678 error ("invalid operands in ternary operation");
3682 /* First handle operations that involve different types. */
3685 case WIDEN_MULT_PLUS_EXPR:
3686 case WIDEN_MULT_MINUS_EXPR:
3687 if ((!INTEGRAL_TYPE_P (rhs1_type)
3688 && !FIXED_POINT_TYPE_P (rhs1_type))
3689 || !useless_type_conversion_p (rhs1_type, rhs2_type)
3690 || !useless_type_conversion_p (lhs_type, rhs3_type)
3691 || 2 * TYPE_PRECISION (rhs1_type) > TYPE_PRECISION (lhs_type)
3692 || TYPE_PRECISION (rhs1_type) != TYPE_PRECISION (rhs2_type))
3694 error ("type mismatch in widening multiply-accumulate expression");
3695 debug_generic_expr (lhs_type);
3696 debug_generic_expr (rhs1_type);
3697 debug_generic_expr (rhs2_type);
3698 debug_generic_expr (rhs3_type);
3704 if (!useless_type_conversion_p (lhs_type, rhs1_type)
3705 || !useless_type_conversion_p (lhs_type, rhs2_type)
3706 || !useless_type_conversion_p (lhs_type, rhs3_type))
3708 error ("type mismatch in fused multiply-add expression");
3709 debug_generic_expr (lhs_type);
3710 debug_generic_expr (rhs1_type);
3711 debug_generic_expr (rhs2_type);
3712 debug_generic_expr (rhs3_type);
3719 if (!useless_type_conversion_p (lhs_type, rhs2_type)
3720 || !useless_type_conversion_p (lhs_type, rhs3_type))
3722 error ("type mismatch in conditional expression");
3723 debug_generic_expr (lhs_type);
3724 debug_generic_expr (rhs2_type);
3725 debug_generic_expr (rhs3_type);
3730 case VEC_SHUFFLE_EXPR:
3731 if (!useless_type_conversion_p (lhs_type, rhs1_type)
3732 || !useless_type_conversion_p (lhs_type, rhs2_type))
3734 error ("type mismatch in vector shuffle expression");
3735 debug_generic_expr (lhs_type);
3736 debug_generic_expr (rhs1_type);
3737 debug_generic_expr (rhs2_type);
3738 debug_generic_expr (rhs3_type);
3742 if (TREE_CODE (rhs1_type) != VECTOR_TYPE
3743 || TREE_CODE (rhs2_type) != VECTOR_TYPE
3744 || TREE_CODE (rhs3_type) != VECTOR_TYPE)
3746 error ("vector types expected in vector shuffle expression");
3747 debug_generic_expr (lhs_type);
3748 debug_generic_expr (rhs1_type);
3749 debug_generic_expr (rhs2_type);
3750 debug_generic_expr (rhs3_type);
3754 if (TYPE_VECTOR_SUBPARTS (rhs1_type) != TYPE_VECTOR_SUBPARTS (rhs2_type)
3755 || TYPE_VECTOR_SUBPARTS (rhs2_type)
3756 != TYPE_VECTOR_SUBPARTS (rhs3_type)
3757 || TYPE_VECTOR_SUBPARTS (rhs3_type)
3758 != TYPE_VECTOR_SUBPARTS (lhs_type))
3760 error ("vectors with different element number found "
3761 "in vector shuffle expression");
3762 debug_generic_expr (lhs_type);
3763 debug_generic_expr (rhs1_type);
3764 debug_generic_expr (rhs2_type);
3765 debug_generic_expr (rhs3_type);
3769 if (TREE_CODE (TREE_TYPE (rhs3_type)) != INTEGER_TYPE
3770 || GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (rhs3_type)))
3771 != GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (rhs1_type))))
3773 error ("invalid mask type in vector shuffle expression");
3774 debug_generic_expr (lhs_type);
3775 debug_generic_expr (rhs1_type);
3776 debug_generic_expr (rhs2_type);
3777 debug_generic_expr (rhs3_type);
3784 case REALIGN_LOAD_EXPR:
3794 /* Verify a gimple assignment statement STMT with a single rhs.
3795 Returns true if anything is wrong. */
3798 verify_gimple_assign_single (gimple stmt)
3800 enum tree_code rhs_code = gimple_assign_rhs_code (stmt);
3801 tree lhs = gimple_assign_lhs (stmt);
3802 tree lhs_type = TREE_TYPE (lhs);
3803 tree rhs1 = gimple_assign_rhs1 (stmt);
3804 tree rhs1_type = TREE_TYPE (rhs1);
3807 if (!useless_type_conversion_p (lhs_type, rhs1_type))
3809 error ("non-trivial conversion at assignment");
3810 debug_generic_expr (lhs_type);
3811 debug_generic_expr (rhs1_type);
3815 if (handled_component_p (lhs))
3816 res |= verify_types_in_gimple_reference (lhs, true);
3818 /* Special codes we cannot handle via their class. */
3823 tree op = TREE_OPERAND (rhs1, 0);
3824 if (!is_gimple_addressable (op))
3826 error ("invalid operand in unary expression");
3830 /* Technically there is no longer a need for matching types, but
3831 gimple hygiene asks for this check. In LTO we can end up
3832 combining incompatible units and thus end up with addresses
3833 of globals that change their type to a common one. */
3835 && !types_compatible_p (TREE_TYPE (op),
3836 TREE_TYPE (TREE_TYPE (rhs1)))
3837 && !one_pointer_to_useless_type_conversion_p (TREE_TYPE (rhs1),
3840 error ("type mismatch in address expression");
3841 debug_generic_stmt (TREE_TYPE (rhs1));
3842 debug_generic_stmt (TREE_TYPE (op));
3846 return verify_types_in_gimple_reference (op, true);
3851 error ("INDIRECT_REF in gimple IL");
3857 case ARRAY_RANGE_REF:
3858 case VIEW_CONVERT_EXPR:
3861 case TARGET_MEM_REF:
3863 if (!is_gimple_reg (lhs)
3864 && is_gimple_reg_type (TREE_TYPE (lhs)))
3866 error ("invalid rhs for gimple memory store");
3867 debug_generic_stmt (lhs);
3868 debug_generic_stmt (rhs1);
3871 return res || verify_types_in_gimple_reference (rhs1, false);
3883 /* tcc_declaration */
3888 if (!is_gimple_reg (lhs)
3889 && !is_gimple_reg (rhs1)
3890 && is_gimple_reg_type (TREE_TYPE (lhs)))
3892 error ("invalid rhs for gimple memory store");
3893 debug_generic_stmt (lhs);
3894 debug_generic_stmt (rhs1);
3902 case WITH_SIZE_EXPR:
3912 /* Verify the contents of a GIMPLE_ASSIGN STMT. Returns true when there
3913 is a problem, otherwise false. */
3916 verify_gimple_assign (gimple stmt)
3918 switch (gimple_assign_rhs_class (stmt))
3920 case GIMPLE_SINGLE_RHS:
3921 return verify_gimple_assign_single (stmt);
3923 case GIMPLE_UNARY_RHS:
3924 return verify_gimple_assign_unary (stmt);
3926 case GIMPLE_BINARY_RHS:
3927 return verify_gimple_assign_binary (stmt);
3929 case GIMPLE_TERNARY_RHS:
3930 return verify_gimple_assign_ternary (stmt);
3937 /* Verify the contents of a GIMPLE_RETURN STMT. Returns true when there
3938 is a problem, otherwise false. */
3941 verify_gimple_return (gimple stmt)
3943 tree op = gimple_return_retval (stmt);
3944 tree restype = TREE_TYPE (TREE_TYPE (cfun->decl));
3946 /* We cannot test for present return values as we do not fix up missing
3947 return values from the original source. */
3951 if (!is_gimple_val (op)
3952 && TREE_CODE (op) != RESULT_DECL)
3954 error ("invalid operand in return statement");
3955 debug_generic_stmt (op);
3959 if ((TREE_CODE (op) == RESULT_DECL
3960 && DECL_BY_REFERENCE (op))
3961 || (TREE_CODE (op) == SSA_NAME
3962 && TREE_CODE (SSA_NAME_VAR (op)) == RESULT_DECL
3963 && DECL_BY_REFERENCE (SSA_NAME_VAR (op))))
3964 op = TREE_TYPE (op);
3966 if (!useless_type_conversion_p (restype, TREE_TYPE (op)))
3968 error ("invalid conversion in return statement");
3969 debug_generic_stmt (restype);
3970 debug_generic_stmt (TREE_TYPE (op));
3978 /* Verify the contents of a GIMPLE_GOTO STMT. Returns true when there
3979 is a problem, otherwise false. */
3982 verify_gimple_goto (gimple stmt)
3984 tree dest = gimple_goto_dest (stmt);
3986 /* ??? We have two canonical forms of direct goto destinations, a
3987 bare LABEL_DECL and an ADDR_EXPR of a LABEL_DECL. */
3988 if (TREE_CODE (dest) != LABEL_DECL
3989 && (!is_gimple_val (dest)
3990 || !POINTER_TYPE_P (TREE_TYPE (dest))))
3992 error ("goto destination is neither a label nor a pointer");
3999 /* Verify the contents of a GIMPLE_SWITCH STMT. Returns true when there
4000 is a problem, otherwise false. */
4003 verify_gimple_switch (gimple stmt)
4005 if (!is_gimple_val (gimple_switch_index (stmt)))
4007 error ("invalid operand to switch statement");
4008 debug_generic_stmt (gimple_switch_index (stmt));
4016 /* Verify a gimple debug statement STMT.
4017 Returns true if anything is wrong. */
4020 verify_gimple_debug (gimple stmt ATTRIBUTE_UNUSED)
4022 /* There isn't much that could be wrong in a gimple debug stmt. A
4023 gimple debug bind stmt, for example, maps a tree, that's usually
4024 a VAR_DECL or a PARM_DECL, but that could also be some scalarized
4025 component or member of an aggregate type, to another tree, that
4026 can be an arbitrary expression. These stmts expand into debug
4027 insns, and are converted to debug notes by var-tracking.c. */
4031 /* Verify a gimple label statement STMT.
4032 Returns true if anything is wrong. */
4035 verify_gimple_label (gimple stmt)
4037 tree decl = gimple_label_label (stmt);
4041 if (TREE_CODE (decl) != LABEL_DECL)
4044 uid = LABEL_DECL_UID (decl);
4047 || VEC_index (basic_block,
4048 label_to_block_map, uid) != gimple_bb (stmt)))
4050 error ("incorrect entry in label_to_block_map");
4054 uid = EH_LANDING_PAD_NR (decl);
4057 eh_landing_pad lp = get_eh_landing_pad_from_number (uid);
4058 if (decl != lp->post_landing_pad)
4060 error ("incorrect setting of landing pad number");
4068 /* Verify the GIMPLE statement STMT. Returns true if there is an
4069 error, otherwise false. */
4072 verify_gimple_stmt (gimple stmt)
4074 switch (gimple_code (stmt))
4077 return verify_gimple_assign (stmt);
4080 return verify_gimple_label (stmt);
4083 return verify_gimple_call (stmt);
4086 if (TREE_CODE_CLASS (gimple_cond_code (stmt)) != tcc_comparison)
4088 error ("invalid comparison code in gimple cond");
4091 if (!(!gimple_cond_true_label (stmt)
4092 || TREE_CODE (gimple_cond_true_label (stmt)) == LABEL_DECL)
4093 || !(!gimple_cond_false_label (stmt)
4094 || TREE_CODE (gimple_cond_false_label (stmt)) == LABEL_DECL))
4096 error ("invalid labels in gimple cond");
4100 return verify_gimple_comparison (boolean_type_node,
4101 gimple_cond_lhs (stmt),
4102 gimple_cond_rhs (stmt));
4105 return verify_gimple_goto (stmt);
4108 return verify_gimple_switch (stmt);
4111 return verify_gimple_return (stmt);
4116 /* Tuples that do not have tree operands. */
4118 case GIMPLE_PREDICT:
4120 case GIMPLE_EH_DISPATCH:
4121 case GIMPLE_EH_MUST_NOT_THROW:
4125 /* OpenMP directives are validated by the FE and never operated
4126 on by the optimizers. Furthermore, GIMPLE_OMP_FOR may contain
4127 non-gimple expressions when the main index variable has had
4128 its address taken. This does not affect the loop itself
4129 because the header of an GIMPLE_OMP_FOR is merely used to determine
4130 how to setup the parallel iteration. */
4134 return verify_gimple_debug (stmt);
4141 /* Verify the contents of a GIMPLE_PHI. Returns true if there is a problem,
4142 and false otherwise. */
4145 verify_gimple_phi (gimple phi)
4149 tree phi_result = gimple_phi_result (phi);
4154 error ("invalid PHI result");
4158 virtual_p = !is_gimple_reg (phi_result);
4159 if (TREE_CODE (phi_result) != SSA_NAME
4161 && SSA_NAME_VAR (phi_result) != gimple_vop (cfun)))
4163 error ("invalid PHI result");
4167 for (i = 0; i < gimple_phi_num_args (phi); i++)
4169 tree t = gimple_phi_arg_def (phi, i);
4173 error ("missing PHI def");
4177 /* Addressable variables do have SSA_NAMEs but they
4178 are not considered gimple values. */
4179 else if ((TREE_CODE (t) == SSA_NAME
4180 && virtual_p != !is_gimple_reg (t))
4182 && (TREE_CODE (t) != SSA_NAME
4183 || SSA_NAME_VAR (t) != gimple_vop (cfun)))
4185 && !is_gimple_val (t)))
4187 error ("invalid PHI argument");
4188 debug_generic_expr (t);
4191 #ifdef ENABLE_TYPES_CHECKING
4192 if (!useless_type_conversion_p (TREE_TYPE (phi_result), TREE_TYPE (t)))
4194 error ("incompatible types in PHI argument %u", i);
4195 debug_generic_stmt (TREE_TYPE (phi_result));
4196 debug_generic_stmt (TREE_TYPE (t));
4205 /* Verify the GIMPLE statements inside the sequence STMTS. */
4208 verify_gimple_in_seq_2 (gimple_seq stmts)
4210 gimple_stmt_iterator ittr;
4213 for (ittr = gsi_start (stmts); !gsi_end_p (ittr); gsi_next (&ittr))
4215 gimple stmt = gsi_stmt (ittr);
4217 switch (gimple_code (stmt))
4220 err |= verify_gimple_in_seq_2 (gimple_bind_body (stmt));
4224 err |= verify_gimple_in_seq_2 (gimple_try_eval (stmt));
4225 err |= verify_gimple_in_seq_2 (gimple_try_cleanup (stmt));
4228 case GIMPLE_EH_FILTER:
4229 err |= verify_gimple_in_seq_2 (gimple_eh_filter_failure (stmt));
4233 err |= verify_gimple_in_seq_2 (gimple_catch_handler (stmt));
4238 bool err2 = verify_gimple_stmt (stmt);
4240 debug_gimple_stmt (stmt);
4250 /* Verify the GIMPLE statements inside the statement list STMTS. */
4253 verify_gimple_in_seq (gimple_seq stmts)
4255 timevar_push (TV_TREE_STMT_VERIFY);
4256 if (verify_gimple_in_seq_2 (stmts))
4257 internal_error ("verify_gimple failed");
4258 timevar_pop (TV_TREE_STMT_VERIFY);
4261 /* Return true when the T can be shared. */
4264 tree_node_can_be_shared (tree t)
4266 if (IS_TYPE_OR_DECL_P (t)
4267 || is_gimple_min_invariant (t)
4268 || TREE_CODE (t) == SSA_NAME
4269 || t == error_mark_node
4270 || TREE_CODE (t) == IDENTIFIER_NODE)
4273 if (TREE_CODE (t) == CASE_LABEL_EXPR)
4276 while (((TREE_CODE (t) == ARRAY_REF || TREE_CODE (t) == ARRAY_RANGE_REF)
4277 && is_gimple_min_invariant (TREE_OPERAND (t, 1)))
4278 || TREE_CODE (t) == COMPONENT_REF
4279 || TREE_CODE (t) == REALPART_EXPR
4280 || TREE_CODE (t) == IMAGPART_EXPR)
4281 t = TREE_OPERAND (t, 0);
4289 /* Called via walk_gimple_stmt. Verify tree sharing. */
4292 verify_node_sharing (tree *tp, int *walk_subtrees, void *data)
4294 struct walk_stmt_info *wi = (struct walk_stmt_info *) data;
4295 struct pointer_set_t *visited = (struct pointer_set_t *) wi->info;
4297 if (tree_node_can_be_shared (*tp))
4299 *walk_subtrees = false;
4303 if (pointer_set_insert (visited, *tp))
4309 static bool eh_error_found;
4311 verify_eh_throw_stmt_node (void **slot, void *data)
4313 struct throw_stmt_node *node = (struct throw_stmt_node *)*slot;
4314 struct pointer_set_t *visited = (struct pointer_set_t *) data;
4316 if (!pointer_set_contains (visited, node->stmt))
4318 error ("dead STMT in EH table");
4319 debug_gimple_stmt (node->stmt);
4320 eh_error_found = true;
4325 /* Verify the GIMPLE statements in the CFG of FN. */
4328 verify_gimple_in_cfg (struct function *fn)
4332 struct pointer_set_t *visited, *visited_stmts;
4334 timevar_push (TV_TREE_STMT_VERIFY);
4335 visited = pointer_set_create ();
4336 visited_stmts = pointer_set_create ();
4338 FOR_EACH_BB_FN (bb, fn)
4340 gimple_stmt_iterator gsi;
4342 for (gsi = gsi_start_phis (bb); !gsi_end_p (gsi); gsi_next (&gsi))
4344 gimple phi = gsi_stmt (gsi);
4348 pointer_set_insert (visited_stmts, phi);
4350 if (gimple_bb (phi) != bb)
4352 error ("gimple_bb (phi) is set to a wrong basic block");
4356 err2 |= verify_gimple_phi (phi);
4358 for (i = 0; i < gimple_phi_num_args (phi); i++)
4360 tree arg = gimple_phi_arg_def (phi, i);
4361 tree addr = walk_tree (&arg, verify_node_sharing, visited, NULL);
4364 error ("incorrect sharing of tree nodes");
4365 debug_generic_expr (addr);
4371 debug_gimple_stmt (phi);
4375 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
4377 gimple stmt = gsi_stmt (gsi);
4379 struct walk_stmt_info wi;
4383 pointer_set_insert (visited_stmts, stmt);
4385 if (gimple_bb (stmt) != bb)
4387 error ("gimple_bb (stmt) is set to a wrong basic block");
4391 err2 |= verify_gimple_stmt (stmt);
4393 memset (&wi, 0, sizeof (wi));
4394 wi.info = (void *) visited;
4395 addr = walk_gimple_op (stmt, verify_node_sharing, &wi);
4398 error ("incorrect sharing of tree nodes");
4399 debug_generic_expr (addr);
4403 /* ??? Instead of not checking these stmts at all the walker
4404 should know its context via wi. */
4405 if (!is_gimple_debug (stmt)
4406 && !is_gimple_omp (stmt))
4408 memset (&wi, 0, sizeof (wi));
4409 addr = walk_gimple_op (stmt, verify_expr, &wi);
4412 debug_generic_expr (addr);
4413 inform (gimple_location (stmt), "in statement");
4418 /* If the statement is marked as part of an EH region, then it is
4419 expected that the statement could throw. Verify that when we
4420 have optimizations that simplify statements such that we prove
4421 that they cannot throw, that we update other data structures
4423 lp_nr = lookup_stmt_eh_lp (stmt);
4426 if (!stmt_could_throw_p (stmt))
4428 error ("statement marked for throw, but doesn%'t");
4432 && !gsi_one_before_end_p (gsi)
4433 && stmt_can_throw_internal (stmt))
4435 error ("statement marked for throw in middle of block");
4441 debug_gimple_stmt (stmt);
4446 eh_error_found = false;
4447 if (get_eh_throw_stmt_table (cfun))
4448 htab_traverse (get_eh_throw_stmt_table (cfun),
4449 verify_eh_throw_stmt_node,
4452 if (err || eh_error_found)
4453 internal_error ("verify_gimple failed");
4455 pointer_set_destroy (visited);
4456 pointer_set_destroy (visited_stmts);
4457 verify_histograms ();
4458 timevar_pop (TV_TREE_STMT_VERIFY);
4462 /* Verifies that the flow information is OK. */
4465 gimple_verify_flow_info (void)
4469 gimple_stmt_iterator gsi;
4474 if (ENTRY_BLOCK_PTR->il.gimple)
4476 error ("ENTRY_BLOCK has IL associated with it");
4480 if (EXIT_BLOCK_PTR->il.gimple)
4482 error ("EXIT_BLOCK has IL associated with it");
4486 FOR_EACH_EDGE (e, ei, EXIT_BLOCK_PTR->preds)
4487 if (e->flags & EDGE_FALLTHRU)
4489 error ("fallthru to exit from bb %d", e->src->index);
4495 bool found_ctrl_stmt = false;
4499 /* Skip labels on the start of basic block. */
4500 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
4503 gimple prev_stmt = stmt;
4505 stmt = gsi_stmt (gsi);
4507 if (gimple_code (stmt) != GIMPLE_LABEL)
4510 label = gimple_label_label (stmt);
4511 if (prev_stmt && DECL_NONLOCAL (label))
4513 error ("nonlocal label ");
4514 print_generic_expr (stderr, label, 0);
4515 fprintf (stderr, " is not first in a sequence of labels in bb %d",
4520 if (prev_stmt && EH_LANDING_PAD_NR (label) != 0)
4522 error ("EH landing pad label ");
4523 print_generic_expr (stderr, label, 0);
4524 fprintf (stderr, " is not first in a sequence of labels in bb %d",
4529 if (label_to_block (label) != bb)
4532 print_generic_expr (stderr, label, 0);
4533 fprintf (stderr, " to block does not match in bb %d",
4538 if (decl_function_context (label) != current_function_decl)
4541 print_generic_expr (stderr, label, 0);
4542 fprintf (stderr, " has incorrect context in bb %d",
4548 /* Verify that body of basic block BB is free of control flow. */
4549 for (; !gsi_end_p (gsi); gsi_next (&gsi))
4551 gimple stmt = gsi_stmt (gsi);
4553 if (found_ctrl_stmt)
4555 error ("control flow in the middle of basic block %d",
4560 if (stmt_ends_bb_p (stmt))
4561 found_ctrl_stmt = true;
4563 if (gimple_code (stmt) == GIMPLE_LABEL)
4566 print_generic_expr (stderr, gimple_label_label (stmt), 0);
4567 fprintf (stderr, " in the middle of basic block %d", bb->index);
4572 gsi = gsi_last_bb (bb);
4573 if (gsi_end_p (gsi))
4576 stmt = gsi_stmt (gsi);
4578 if (gimple_code (stmt) == GIMPLE_LABEL)
4581 err |= verify_eh_edges (stmt);
4583 if (is_ctrl_stmt (stmt))
4585 FOR_EACH_EDGE (e, ei, bb->succs)
4586 if (e->flags & EDGE_FALLTHRU)
4588 error ("fallthru edge after a control statement in bb %d",
4594 if (gimple_code (stmt) != GIMPLE_COND)
4596 /* Verify that there are no edges with EDGE_TRUE/FALSE_FLAG set
4597 after anything else but if statement. */
4598 FOR_EACH_EDGE (e, ei, bb->succs)
4599 if (e->flags & (EDGE_TRUE_VALUE | EDGE_FALSE_VALUE))
4601 error ("true/false edge after a non-GIMPLE_COND in bb %d",
4607 switch (gimple_code (stmt))
4614 extract_true_false_edges_from_block (bb, &true_edge, &false_edge);
4618 || !(true_edge->flags & EDGE_TRUE_VALUE)
4619 || !(false_edge->flags & EDGE_FALSE_VALUE)
4620 || (true_edge->flags & (EDGE_FALLTHRU | EDGE_ABNORMAL))
4621 || (false_edge->flags & (EDGE_FALLTHRU | EDGE_ABNORMAL))
4622 || EDGE_COUNT (bb->succs) >= 3)
4624 error ("wrong outgoing edge flags at end of bb %d",
4632 if (simple_goto_p (stmt))
4634 error ("explicit goto at end of bb %d", bb->index);
4639 /* FIXME. We should double check that the labels in the
4640 destination blocks have their address taken. */
4641 FOR_EACH_EDGE (e, ei, bb->succs)
4642 if ((e->flags & (EDGE_FALLTHRU | EDGE_TRUE_VALUE
4643 | EDGE_FALSE_VALUE))
4644 || !(e->flags & EDGE_ABNORMAL))
4646 error ("wrong outgoing edge flags at end of bb %d",
4654 if (!gimple_call_builtin_p (stmt, BUILT_IN_RETURN))
4656 /* ... fallthru ... */
4658 if (!single_succ_p (bb)
4659 || (single_succ_edge (bb)->flags
4660 & (EDGE_FALLTHRU | EDGE_ABNORMAL
4661 | EDGE_TRUE_VALUE | EDGE_FALSE_VALUE)))
4663 error ("wrong outgoing edge flags at end of bb %d", bb->index);
4666 if (single_succ (bb) != EXIT_BLOCK_PTR)
4668 error ("return edge does not point to exit in bb %d",
4680 n = gimple_switch_num_labels (stmt);
4682 /* Mark all the destination basic blocks. */
4683 for (i = 0; i < n; ++i)
4685 tree lab = CASE_LABEL (gimple_switch_label (stmt, i));
4686 basic_block label_bb = label_to_block (lab);
4687 gcc_assert (!label_bb->aux || label_bb->aux == (void *)1);
4688 label_bb->aux = (void *)1;
4691 /* Verify that the case labels are sorted. */
4692 prev = gimple_switch_label (stmt, 0);
4693 for (i = 1; i < n; ++i)
4695 tree c = gimple_switch_label (stmt, i);
4698 error ("found default case not at the start of "
4704 && !tree_int_cst_lt (CASE_LOW (prev), CASE_LOW (c)))
4706 error ("case labels not sorted: ");
4707 print_generic_expr (stderr, prev, 0);
4708 fprintf (stderr," is greater than ");
4709 print_generic_expr (stderr, c, 0);
4710 fprintf (stderr," but comes before it.\n");
4715 /* VRP will remove the default case if it can prove it will
4716 never be executed. So do not verify there always exists
4717 a default case here. */
4719 FOR_EACH_EDGE (e, ei, bb->succs)
4723 error ("extra outgoing edge %d->%d",
4724 bb->index, e->dest->index);
4728 e->dest->aux = (void *)2;
4729 if ((e->flags & (EDGE_FALLTHRU | EDGE_ABNORMAL
4730 | EDGE_TRUE_VALUE | EDGE_FALSE_VALUE)))
4732 error ("wrong outgoing edge flags at end of bb %d",
4738 /* Check that we have all of them. */
4739 for (i = 0; i < n; ++i)
4741 tree lab = CASE_LABEL (gimple_switch_label (stmt, i));
4742 basic_block label_bb = label_to_block (lab);
4744 if (label_bb->aux != (void *)2)
4746 error ("missing edge %i->%i", bb->index, label_bb->index);
4751 FOR_EACH_EDGE (e, ei, bb->succs)
4752 e->dest->aux = (void *)0;
4756 case GIMPLE_EH_DISPATCH:
4757 err |= verify_eh_dispatch_edge (stmt);
4765 if (dom_info_state (CDI_DOMINATORS) >= DOM_NO_FAST_QUERY)
4766 verify_dominators (CDI_DOMINATORS);
4772 /* Updates phi nodes after creating a forwarder block joined
4773 by edge FALLTHRU. */
4776 gimple_make_forwarder_block (edge fallthru)
4780 basic_block dummy, bb;
4782 gimple_stmt_iterator gsi;
4784 dummy = fallthru->src;
4785 bb = fallthru->dest;
4787 if (single_pred_p (bb))
4790 /* If we redirected a branch we must create new PHI nodes at the
4792 for (gsi = gsi_start_phis (dummy); !gsi_end_p (gsi); gsi_next (&gsi))
4794 gimple phi, new_phi;
4796 phi = gsi_stmt (gsi);
4797 var = gimple_phi_result (phi);
4798 new_phi = create_phi_node (var, bb);
4799 SSA_NAME_DEF_STMT (var) = new_phi;
4800 gimple_phi_set_result (phi, make_ssa_name (SSA_NAME_VAR (var), phi));
4801 add_phi_arg (new_phi, gimple_phi_result (phi), fallthru,
4805 /* Add the arguments we have stored on edges. */
4806 FOR_EACH_EDGE (e, ei, bb->preds)
4811 flush_pending_stmts (e);
4816 /* Return a non-special label in the head of basic block BLOCK.
4817 Create one if it doesn't exist. */
4820 gimple_block_label (basic_block bb)
4822 gimple_stmt_iterator i, s = gsi_start_bb (bb);
4827 for (i = s; !gsi_end_p (i); first = false, gsi_next (&i))
4829 stmt = gsi_stmt (i);
4830 if (gimple_code (stmt) != GIMPLE_LABEL)
4832 label = gimple_label_label (stmt);
4833 if (!DECL_NONLOCAL (label))
4836 gsi_move_before (&i, &s);
4841 label = create_artificial_label (UNKNOWN_LOCATION);
4842 stmt = gimple_build_label (label);
4843 gsi_insert_before (&s, stmt, GSI_NEW_STMT);
4848 /* Attempt to perform edge redirection by replacing a possibly complex
4849 jump instruction by a goto or by removing the jump completely.
4850 This can apply only if all edges now point to the same block. The
4851 parameters and return values are equivalent to
4852 redirect_edge_and_branch. */
4855 gimple_try_redirect_by_replacing_jump (edge e, basic_block target)
4857 basic_block src = e->src;
4858 gimple_stmt_iterator i;
4861 /* We can replace or remove a complex jump only when we have exactly
4863 if (EDGE_COUNT (src->succs) != 2
4864 /* Verify that all targets will be TARGET. Specifically, the
4865 edge that is not E must also go to TARGET. */
4866 || EDGE_SUCC (src, EDGE_SUCC (src, 0) == e)->dest != target)
4869 i = gsi_last_bb (src);
4873 stmt = gsi_stmt (i);
4875 if (gimple_code (stmt) == GIMPLE_COND || gimple_code (stmt) == GIMPLE_SWITCH)
4877 gsi_remove (&i, true);
4878 e = ssa_redirect_edge (e, target);
4879 e->flags = EDGE_FALLTHRU;
4887 /* Redirect E to DEST. Return NULL on failure. Otherwise, return the
4888 edge representing the redirected branch. */
4891 gimple_redirect_edge_and_branch (edge e, basic_block dest)
4893 basic_block bb = e->src;
4894 gimple_stmt_iterator gsi;
4898 if (e->flags & EDGE_ABNORMAL)
4901 if (e->dest == dest)
4904 if (e->flags & EDGE_EH)
4905 return redirect_eh_edge (e, dest);
4907 if (e->src != ENTRY_BLOCK_PTR)
4909 ret = gimple_try_redirect_by_replacing_jump (e, dest);
4914 gsi = gsi_last_bb (bb);
4915 stmt = gsi_end_p (gsi) ? NULL : gsi_stmt (gsi);
4917 switch (stmt ? gimple_code (stmt) : GIMPLE_ERROR_MARK)
4920 /* For COND_EXPR, we only need to redirect the edge. */
4924 /* No non-abnormal edges should lead from a non-simple goto, and
4925 simple ones should be represented implicitly. */
4930 tree label = gimple_block_label (dest);
4931 tree cases = get_cases_for_edge (e, stmt);
4933 /* If we have a list of cases associated with E, then use it
4934 as it's a lot faster than walking the entire case vector. */
4937 edge e2 = find_edge (e->src, dest);
4944 CASE_LABEL (cases) = label;
4945 cases = CASE_CHAIN (cases);
4948 /* If there was already an edge in the CFG, then we need
4949 to move all the cases associated with E to E2. */
4952 tree cases2 = get_cases_for_edge (e2, stmt);
4954 CASE_CHAIN (last) = CASE_CHAIN (cases2);
4955 CASE_CHAIN (cases2) = first;
4957 bitmap_set_bit (touched_switch_bbs, gimple_bb (stmt)->index);
4961 size_t i, n = gimple_switch_num_labels (stmt);
4963 for (i = 0; i < n; i++)
4965 tree elt = gimple_switch_label (stmt, i);
4966 if (label_to_block (CASE_LABEL (elt)) == e->dest)
4967 CASE_LABEL (elt) = label;
4975 int i, n = gimple_asm_nlabels (stmt);
4978 for (i = 0; i < n; ++i)
4980 tree cons = gimple_asm_label_op (stmt, i);
4981 if (label_to_block (TREE_VALUE (cons)) == e->dest)
4984 label = gimple_block_label (dest);
4985 TREE_VALUE (cons) = label;
4989 /* If we didn't find any label matching the former edge in the
4990 asm labels, we must be redirecting the fallthrough
4992 gcc_assert (label || (e->flags & EDGE_FALLTHRU));
4997 gsi_remove (&gsi, true);
4998 e->flags |= EDGE_FALLTHRU;
5001 case GIMPLE_OMP_RETURN:
5002 case GIMPLE_OMP_CONTINUE:
5003 case GIMPLE_OMP_SECTIONS_SWITCH:
5004 case GIMPLE_OMP_FOR:
5005 /* The edges from OMP constructs can be simply redirected. */
5008 case GIMPLE_EH_DISPATCH:
5009 if (!(e->flags & EDGE_FALLTHRU))
5010 redirect_eh_dispatch_edge (stmt, e, dest);
5014 /* Otherwise it must be a fallthru edge, and we don't need to
5015 do anything besides redirecting it. */
5016 gcc_assert (e->flags & EDGE_FALLTHRU);
5020 /* Update/insert PHI nodes as necessary. */
5022 /* Now update the edges in the CFG. */
5023 e = ssa_redirect_edge (e, dest);
5028 /* Returns true if it is possible to remove edge E by redirecting
5029 it to the destination of the other edge from E->src. */
5032 gimple_can_remove_branch_p (const_edge e)
5034 if (e->flags & (EDGE_ABNORMAL | EDGE_EH))
5040 /* Simple wrapper, as we can always redirect fallthru edges. */
5043 gimple_redirect_edge_and_branch_force (edge e, basic_block dest)
5045 e = gimple_redirect_edge_and_branch (e, dest);
5052 /* Splits basic block BB after statement STMT (but at least after the
5053 labels). If STMT is NULL, BB is split just after the labels. */
5056 gimple_split_block (basic_block bb, void *stmt)
5058 gimple_stmt_iterator gsi;
5059 gimple_stmt_iterator gsi_tgt;
5066 new_bb = create_empty_bb (bb);
5068 /* Redirect the outgoing edges. */
5069 new_bb->succs = bb->succs;
5071 FOR_EACH_EDGE (e, ei, new_bb->succs)
5074 if (stmt && gimple_code ((gimple) stmt) == GIMPLE_LABEL)
5077 /* Move everything from GSI to the new basic block. */
5078 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
5080 act = gsi_stmt (gsi);
5081 if (gimple_code (act) == GIMPLE_LABEL)
5094 if (gsi_end_p (gsi))
5097 /* Split the statement list - avoid re-creating new containers as this
5098 brings ugly quadratic memory consumption in the inliner.
5099 (We are still quadratic since we need to update stmt BB pointers,
5101 list = gsi_split_seq_before (&gsi);
5102 set_bb_seq (new_bb, list);
5103 for (gsi_tgt = gsi_start (list);
5104 !gsi_end_p (gsi_tgt); gsi_next (&gsi_tgt))
5105 gimple_set_bb (gsi_stmt (gsi_tgt), new_bb);
5111 /* Moves basic block BB after block AFTER. */
5114 gimple_move_block_after (basic_block bb, basic_block after)
5116 if (bb->prev_bb == after)
5120 link_block (bb, after);
5126 /* Return true if basic_block can be duplicated. */
5129 gimple_can_duplicate_bb_p (const_basic_block bb ATTRIBUTE_UNUSED)
5134 /* Create a duplicate of the basic block BB. NOTE: This does not
5135 preserve SSA form. */
5138 gimple_duplicate_bb (basic_block bb)
5141 gimple_stmt_iterator gsi, gsi_tgt;
5142 gimple_seq phis = phi_nodes (bb);
5143 gimple phi, stmt, copy;
5145 new_bb = create_empty_bb (EXIT_BLOCK_PTR->prev_bb);
5147 /* Copy the PHI nodes. We ignore PHI node arguments here because
5148 the incoming edges have not been setup yet. */
5149 for (gsi = gsi_start (phis); !gsi_end_p (gsi); gsi_next (&gsi))
5151 phi = gsi_stmt (gsi);
5152 copy = create_phi_node (gimple_phi_result (phi), new_bb);
5153 create_new_def_for (gimple_phi_result (copy), copy,
5154 gimple_phi_result_ptr (copy));
5157 gsi_tgt = gsi_start_bb (new_bb);
5158 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
5160 def_operand_p def_p;
5161 ssa_op_iter op_iter;
5164 stmt = gsi_stmt (gsi);
5165 if (gimple_code (stmt) == GIMPLE_LABEL)
5168 /* Create a new copy of STMT and duplicate STMT's virtual
5170 copy = gimple_copy (stmt);
5171 gsi_insert_after (&gsi_tgt, copy, GSI_NEW_STMT);
5173 maybe_duplicate_eh_stmt (copy, stmt);
5174 gimple_duplicate_stmt_histograms (cfun, copy, cfun, stmt);
5176 /* When copying around a stmt writing into a local non-user
5177 aggregate, make sure it won't share stack slot with other
5179 lhs = gimple_get_lhs (stmt);
5180 if (lhs && TREE_CODE (lhs) != SSA_NAME)
5182 tree base = get_base_address (lhs);
5184 && (TREE_CODE (base) == VAR_DECL
5185 || TREE_CODE (base) == RESULT_DECL)
5186 && DECL_IGNORED_P (base)
5187 && !TREE_STATIC (base)
5188 && !DECL_EXTERNAL (base)
5189 && (TREE_CODE (base) != VAR_DECL
5190 || !DECL_HAS_VALUE_EXPR_P (base)))
5191 DECL_NONSHAREABLE (base) = 1;
5194 /* Create new names for all the definitions created by COPY and
5195 add replacement mappings for each new name. */
5196 FOR_EACH_SSA_DEF_OPERAND (def_p, copy, op_iter, SSA_OP_ALL_DEFS)
5197 create_new_def_for (DEF_FROM_PTR (def_p), copy, def_p);
5203 /* Adds phi node arguments for edge E_COPY after basic block duplication. */
5206 add_phi_args_after_copy_edge (edge e_copy)
5208 basic_block bb, bb_copy = e_copy->src, dest;
5211 gimple phi, phi_copy;
5213 gimple_stmt_iterator psi, psi_copy;
5215 if (gimple_seq_empty_p (phi_nodes (e_copy->dest)))
5218 bb = bb_copy->flags & BB_DUPLICATED ? get_bb_original (bb_copy) : bb_copy;
5220 if (e_copy->dest->flags & BB_DUPLICATED)
5221 dest = get_bb_original (e_copy->dest);
5223 dest = e_copy->dest;
5225 e = find_edge (bb, dest);
5228 /* During loop unrolling the target of the latch edge is copied.
5229 In this case we are not looking for edge to dest, but to
5230 duplicated block whose original was dest. */
5231 FOR_EACH_EDGE (e, ei, bb->succs)
5233 if ((e->dest->flags & BB_DUPLICATED)
5234 && get_bb_original (e->dest) == dest)
5238 gcc_assert (e != NULL);
5241 for (psi = gsi_start_phis (e->dest),
5242 psi_copy = gsi_start_phis (e_copy->dest);
5244 gsi_next (&psi), gsi_next (&psi_copy))
5246 phi = gsi_stmt (psi);
5247 phi_copy = gsi_stmt (psi_copy);
5248 def = PHI_ARG_DEF_FROM_EDGE (phi, e);
5249 add_phi_arg (phi_copy, def, e_copy,
5250 gimple_phi_arg_location_from_edge (phi, e));
5255 /* Basic block BB_COPY was created by code duplication. Add phi node
5256 arguments for edges going out of BB_COPY. The blocks that were
5257 duplicated have BB_DUPLICATED set. */
5260 add_phi_args_after_copy_bb (basic_block bb_copy)
5265 FOR_EACH_EDGE (e_copy, ei, bb_copy->succs)
5267 add_phi_args_after_copy_edge (e_copy);
5271 /* Blocks in REGION_COPY array of length N_REGION were created by
5272 duplication of basic blocks. Add phi node arguments for edges
5273 going from these blocks. If E_COPY is not NULL, also add
5274 phi node arguments for its destination.*/
5277 add_phi_args_after_copy (basic_block *region_copy, unsigned n_region,
5282 for (i = 0; i < n_region; i++)
5283 region_copy[i]->flags |= BB_DUPLICATED;
5285 for (i = 0; i < n_region; i++)
5286 add_phi_args_after_copy_bb (region_copy[i]);
5288 add_phi_args_after_copy_edge (e_copy);
5290 for (i = 0; i < n_region; i++)
5291 region_copy[i]->flags &= ~BB_DUPLICATED;
5294 /* Duplicates a REGION (set of N_REGION basic blocks) with just a single
5295 important exit edge EXIT. By important we mean that no SSA name defined
5296 inside region is live over the other exit edges of the region. All entry
5297 edges to the region must go to ENTRY->dest. The edge ENTRY is redirected
5298 to the duplicate of the region. SSA form, dominance and loop information
5299 is updated. The new basic blocks are stored to REGION_COPY in the same
5300 order as they had in REGION, provided that REGION_COPY is not NULL.
5301 The function returns false if it is unable to copy the region,
5305 gimple_duplicate_sese_region (edge entry, edge exit,
5306 basic_block *region, unsigned n_region,
5307 basic_block *region_copy)
5310 bool free_region_copy = false, copying_header = false;
5311 struct loop *loop = entry->dest->loop_father;
5313 VEC (basic_block, heap) *doms;
5315 int total_freq = 0, entry_freq = 0;
5316 gcov_type total_count = 0, entry_count = 0;
5318 if (!can_copy_bbs_p (region, n_region))
5321 /* Some sanity checking. Note that we do not check for all possible
5322 missuses of the functions. I.e. if you ask to copy something weird,
5323 it will work, but the state of structures probably will not be
5325 for (i = 0; i < n_region; i++)
5327 /* We do not handle subloops, i.e. all the blocks must belong to the
5329 if (region[i]->loop_father != loop)
5332 if (region[i] != entry->dest
5333 && region[i] == loop->header)
5337 set_loop_copy (loop, loop);
5339 /* In case the function is used for loop header copying (which is the primary
5340 use), ensure that EXIT and its copy will be new latch and entry edges. */
5341 if (loop->header == entry->dest)
5343 copying_header = true;
5344 set_loop_copy (loop, loop_outer (loop));
5346 if (!dominated_by_p (CDI_DOMINATORS, loop->latch, exit->src))
5349 for (i = 0; i < n_region; i++)
5350 if (region[i] != exit->src
5351 && dominated_by_p (CDI_DOMINATORS, region[i], exit->src))
5357 region_copy = XNEWVEC (basic_block, n_region);
5358 free_region_copy = true;
5361 gcc_assert (!need_ssa_update_p (cfun));
5363 /* Record blocks outside the region that are dominated by something
5366 initialize_original_copy_tables ();
5368 doms = get_dominated_by_region (CDI_DOMINATORS, region, n_region);
5370 if (entry->dest->count)
5372 total_count = entry->dest->count;
5373 entry_count = entry->count;
5374 /* Fix up corner cases, to avoid division by zero or creation of negative
5376 if (entry_count > total_count)
5377 entry_count = total_count;
5381 total_freq = entry->dest->frequency;
5382 entry_freq = EDGE_FREQUENCY (entry);
5383 /* Fix up corner cases, to avoid division by zero or creation of negative
5385 if (total_freq == 0)
5387 else if (entry_freq > total_freq)
5388 entry_freq = total_freq;
5391 copy_bbs (region, n_region, region_copy, &exit, 1, &exit_copy, loop,
5392 split_edge_bb_loc (entry));
5395 scale_bbs_frequencies_gcov_type (region, n_region,
5396 total_count - entry_count,
5398 scale_bbs_frequencies_gcov_type (region_copy, n_region, entry_count,
5403 scale_bbs_frequencies_int (region, n_region, total_freq - entry_freq,
5405 scale_bbs_frequencies_int (region_copy, n_region, entry_freq, total_freq);
5410 loop->header = exit->dest;
5411 loop->latch = exit->src;
5414 /* Redirect the entry and add the phi node arguments. */
5415 redirected = redirect_edge_and_branch (entry, get_bb_copy (entry->dest));
5416 gcc_assert (redirected != NULL);
5417 flush_pending_stmts (entry);
5419 /* Concerning updating of dominators: We must recount dominators
5420 for entry block and its copy. Anything that is outside of the
5421 region, but was dominated by something inside needs recounting as
5423 set_immediate_dominator (CDI_DOMINATORS, entry->dest, entry->src);
5424 VEC_safe_push (basic_block, heap, doms, get_bb_original (entry->dest));
5425 iterate_fix_dominators (CDI_DOMINATORS, doms, false);
5426 VEC_free (basic_block, heap, doms);
5428 /* Add the other PHI node arguments. */
5429 add_phi_args_after_copy (region_copy, n_region, NULL);
5431 /* Update the SSA web. */
5432 update_ssa (TODO_update_ssa);
5434 if (free_region_copy)
5437 free_original_copy_tables ();
5441 /* Duplicates REGION consisting of N_REGION blocks. The new blocks
5442 are stored to REGION_COPY in the same order in that they appear
5443 in REGION, if REGION_COPY is not NULL. ENTRY is the entry to
5444 the region, EXIT an exit from it. The condition guarding EXIT
5445 is moved to ENTRY. Returns true if duplication succeeds, false
5471 gimple_duplicate_sese_tail (edge entry ATTRIBUTE_UNUSED, edge exit ATTRIBUTE_UNUSED,
5472 basic_block *region ATTRIBUTE_UNUSED, unsigned n_region ATTRIBUTE_UNUSED,
5473 basic_block *region_copy ATTRIBUTE_UNUSED)
5476 bool free_region_copy = false;
5477 struct loop *loop = exit->dest->loop_father;
5478 struct loop *orig_loop = entry->dest->loop_father;
5479 basic_block switch_bb, entry_bb, nentry_bb;
5480 VEC (basic_block, heap) *doms;
5481 int total_freq = 0, exit_freq = 0;
5482 gcov_type total_count = 0, exit_count = 0;
5483 edge exits[2], nexits[2], e;
5484 gimple_stmt_iterator gsi;
5487 basic_block exit_bb;
5488 gimple_stmt_iterator psi;
5492 gcc_assert (EDGE_COUNT (exit->src->succs) == 2);
5494 exits[1] = EDGE_SUCC (exit->src, EDGE_SUCC (exit->src, 0) == exit);
5496 if (!can_copy_bbs_p (region, n_region))
5499 initialize_original_copy_tables ();
5500 set_loop_copy (orig_loop, loop);
5501 duplicate_subloops (orig_loop, loop);
5505 region_copy = XNEWVEC (basic_block, n_region);
5506 free_region_copy = true;
5509 gcc_assert (!need_ssa_update_p (cfun));
5511 /* Record blocks outside the region that are dominated by something
5513 doms = get_dominated_by_region (CDI_DOMINATORS, region, n_region);
5515 if (exit->src->count)
5517 total_count = exit->src->count;
5518 exit_count = exit->count;
5519 /* Fix up corner cases, to avoid division by zero or creation of negative
5521 if (exit_count > total_count)
5522 exit_count = total_count;
5526 total_freq = exit->src->frequency;
5527 exit_freq = EDGE_FREQUENCY (exit);
5528 /* Fix up corner cases, to avoid division by zero or creation of negative
5530 if (total_freq == 0)
5532 if (exit_freq > total_freq)
5533 exit_freq = total_freq;
5536 copy_bbs (region, n_region, region_copy, exits, 2, nexits, orig_loop,
5537 split_edge_bb_loc (exit));
5540 scale_bbs_frequencies_gcov_type (region, n_region,
5541 total_count - exit_count,
5543 scale_bbs_frequencies_gcov_type (region_copy, n_region, exit_count,
5548 scale_bbs_frequencies_int (region, n_region, total_freq - exit_freq,
5550 scale_bbs_frequencies_int (region_copy, n_region, exit_freq, total_freq);
5553 /* Create the switch block, and put the exit condition to it. */
5554 entry_bb = entry->dest;
5555 nentry_bb = get_bb_copy (entry_bb);
5556 if (!last_stmt (entry->src)
5557 || !stmt_ends_bb_p (last_stmt (entry->src)))
5558 switch_bb = entry->src;
5560 switch_bb = split_edge (entry);
5561 set_immediate_dominator (CDI_DOMINATORS, nentry_bb, switch_bb);
5563 gsi = gsi_last_bb (switch_bb);
5564 cond_stmt = last_stmt (exit->src);
5565 gcc_assert (gimple_code (cond_stmt) == GIMPLE_COND);
5566 cond_stmt = gimple_copy (cond_stmt);
5568 gsi_insert_after (&gsi, cond_stmt, GSI_NEW_STMT);
5570 sorig = single_succ_edge (switch_bb);
5571 sorig->flags = exits[1]->flags;
5572 snew = make_edge (switch_bb, nentry_bb, exits[0]->flags);
5574 /* Register the new edge from SWITCH_BB in loop exit lists. */
5575 rescan_loop_exit (snew, true, false);
5577 /* Add the PHI node arguments. */
5578 add_phi_args_after_copy (region_copy, n_region, snew);
5580 /* Get rid of now superfluous conditions and associated edges (and phi node
5582 exit_bb = exit->dest;
5584 e = redirect_edge_and_branch (exits[0], exits[1]->dest);
5585 PENDING_STMT (e) = NULL;
5587 /* The latch of ORIG_LOOP was copied, and so was the backedge
5588 to the original header. We redirect this backedge to EXIT_BB. */
5589 for (i = 0; i < n_region; i++)
5590 if (get_bb_original (region_copy[i]) == orig_loop->latch)
5592 gcc_assert (single_succ_edge (region_copy[i]));
5593 e = redirect_edge_and_branch (single_succ_edge (region_copy[i]), exit_bb);
5594 PENDING_STMT (e) = NULL;
5595 for (psi = gsi_start_phis (exit_bb);
5599 phi = gsi_stmt (psi);
5600 def = PHI_ARG_DEF (phi, nexits[0]->dest_idx);
5601 add_phi_arg (phi, def, e, gimple_phi_arg_location_from_edge (phi, e));
5604 e = redirect_edge_and_branch (nexits[0], nexits[1]->dest);
5605 PENDING_STMT (e) = NULL;
5607 /* Anything that is outside of the region, but was dominated by something
5608 inside needs to update dominance info. */
5609 iterate_fix_dominators (CDI_DOMINATORS, doms, false);
5610 VEC_free (basic_block, heap, doms);
5611 /* Update the SSA web. */
5612 update_ssa (TODO_update_ssa);
5614 if (free_region_copy)
5617 free_original_copy_tables ();
5621 /* Add all the blocks dominated by ENTRY to the array BBS_P. Stop
5622 adding blocks when the dominator traversal reaches EXIT. This
5623 function silently assumes that ENTRY strictly dominates EXIT. */
5626 gather_blocks_in_sese_region (basic_block entry, basic_block exit,
5627 VEC(basic_block,heap) **bbs_p)
5631 for (son = first_dom_son (CDI_DOMINATORS, entry);
5633 son = next_dom_son (CDI_DOMINATORS, son))
5635 VEC_safe_push (basic_block, heap, *bbs_p, son);
5637 gather_blocks_in_sese_region (son, exit, bbs_p);
5641 /* Replaces *TP with a duplicate (belonging to function TO_CONTEXT).
5642 The duplicates are recorded in VARS_MAP. */
5645 replace_by_duplicate_decl (tree *tp, struct pointer_map_t *vars_map,
5648 tree t = *tp, new_t;
5649 struct function *f = DECL_STRUCT_FUNCTION (to_context);
5652 if (DECL_CONTEXT (t) == to_context)
5655 loc = pointer_map_contains (vars_map, t);
5659 loc = pointer_map_insert (vars_map, t);
5663 new_t = copy_var_decl (t, DECL_NAME (t), TREE_TYPE (t));
5664 add_local_decl (f, new_t);
5668 gcc_assert (TREE_CODE (t) == CONST_DECL);
5669 new_t = copy_node (t);
5671 DECL_CONTEXT (new_t) = to_context;
5676 new_t = (tree) *loc;
5682 /* Creates an ssa name in TO_CONTEXT equivalent to NAME.
5683 VARS_MAP maps old ssa names and var_decls to the new ones. */
5686 replace_ssa_name (tree name, struct pointer_map_t *vars_map,
5690 tree new_name, decl = SSA_NAME_VAR (name);
5692 gcc_assert (is_gimple_reg (name));
5694 loc = pointer_map_contains (vars_map, name);
5698 replace_by_duplicate_decl (&decl, vars_map, to_context);
5700 push_cfun (DECL_STRUCT_FUNCTION (to_context));
5701 if (gimple_in_ssa_p (cfun))
5702 add_referenced_var (decl);
5704 new_name = make_ssa_name (decl, SSA_NAME_DEF_STMT (name));
5705 if (SSA_NAME_IS_DEFAULT_DEF (name))
5706 set_default_def (decl, new_name);
5709 loc = pointer_map_insert (vars_map, name);
5713 new_name = (tree) *loc;
5724 struct pointer_map_t *vars_map;
5725 htab_t new_label_map;
5726 struct pointer_map_t *eh_map;
5730 /* Helper for move_block_to_fn. Set TREE_BLOCK in every expression
5731 contained in *TP if it has been ORIG_BLOCK previously and change the
5732 DECL_CONTEXT of every local variable referenced in *TP. */
5735 move_stmt_op (tree *tp, int *walk_subtrees, void *data)
5737 struct walk_stmt_info *wi = (struct walk_stmt_info *) data;
5738 struct move_stmt_d *p = (struct move_stmt_d *) wi->info;
5742 /* We should never have TREE_BLOCK set on non-statements. */
5743 gcc_assert (!TREE_BLOCK (t));
5745 else if (DECL_P (t) || TREE_CODE (t) == SSA_NAME)
5747 if (TREE_CODE (t) == SSA_NAME)
5748 *tp = replace_ssa_name (t, p->vars_map, p->to_context);
5749 else if (TREE_CODE (t) == LABEL_DECL)
5751 if (p->new_label_map)
5753 struct tree_map in, *out;
5755 out = (struct tree_map *)
5756 htab_find_with_hash (p->new_label_map, &in, DECL_UID (t));
5761 DECL_CONTEXT (t) = p->to_context;
5763 else if (p->remap_decls_p)
5765 /* Replace T with its duplicate. T should no longer appear in the
5766 parent function, so this looks wasteful; however, it may appear
5767 in referenced_vars, and more importantly, as virtual operands of
5768 statements, and in alias lists of other variables. It would be
5769 quite difficult to expunge it from all those places. ??? It might
5770 suffice to do this for addressable variables. */
5771 if ((TREE_CODE (t) == VAR_DECL
5772 && !is_global_var (t))
5773 || TREE_CODE (t) == CONST_DECL)
5774 replace_by_duplicate_decl (tp, p->vars_map, p->to_context);
5777 && gimple_in_ssa_p (cfun))
5779 push_cfun (DECL_STRUCT_FUNCTION (p->to_context));
5780 add_referenced_var (*tp);
5786 else if (TYPE_P (t))
5792 /* Helper for move_stmt_r. Given an EH region number for the source
5793 function, map that to the duplicate EH regio number in the dest. */
5796 move_stmt_eh_region_nr (int old_nr, struct move_stmt_d *p)
5798 eh_region old_r, new_r;
5801 old_r = get_eh_region_from_number (old_nr);
5802 slot = pointer_map_contains (p->eh_map, old_r);
5803 new_r = (eh_region) *slot;
5805 return new_r->index;
5808 /* Similar, but operate on INTEGER_CSTs. */
5811 move_stmt_eh_region_tree_nr (tree old_t_nr, struct move_stmt_d *p)
5815 old_nr = tree_low_cst (old_t_nr, 0);
5816 new_nr = move_stmt_eh_region_nr (old_nr, p);
5818 return build_int_cst (integer_type_node, new_nr);
5821 /* Like move_stmt_op, but for gimple statements.
5823 Helper for move_block_to_fn. Set GIMPLE_BLOCK in every expression
5824 contained in the current statement in *GSI_P and change the
5825 DECL_CONTEXT of every local variable referenced in the current
5829 move_stmt_r (gimple_stmt_iterator *gsi_p, bool *handled_ops_p,
5830 struct walk_stmt_info *wi)
5832 struct move_stmt_d *p = (struct move_stmt_d *) wi->info;
5833 gimple stmt = gsi_stmt (*gsi_p);
5834 tree block = gimple_block (stmt);
5836 if (p->orig_block == NULL_TREE
5837 || block == p->orig_block
5838 || block == NULL_TREE)
5839 gimple_set_block (stmt, p->new_block);
5840 #ifdef ENABLE_CHECKING
5841 else if (block != p->new_block)
5843 while (block && block != p->orig_block)
5844 block = BLOCK_SUPERCONTEXT (block);
5849 switch (gimple_code (stmt))
5852 /* Remap the region numbers for __builtin_eh_{pointer,filter}. */
5854 tree r, fndecl = gimple_call_fndecl (stmt);
5855 if (fndecl && DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_NORMAL)
5856 switch (DECL_FUNCTION_CODE (fndecl))
5858 case BUILT_IN_EH_COPY_VALUES:
5859 r = gimple_call_arg (stmt, 1);
5860 r = move_stmt_eh_region_tree_nr (r, p);
5861 gimple_call_set_arg (stmt, 1, r);
5864 case BUILT_IN_EH_POINTER:
5865 case BUILT_IN_EH_FILTER:
5866 r = gimple_call_arg (stmt, 0);
5867 r = move_stmt_eh_region_tree_nr (r, p);
5868 gimple_call_set_arg (stmt, 0, r);
5879 int r = gimple_resx_region (stmt);
5880 r = move_stmt_eh_region_nr (r, p);
5881 gimple_resx_set_region (stmt, r);
5885 case GIMPLE_EH_DISPATCH:
5887 int r = gimple_eh_dispatch_region (stmt);
5888 r = move_stmt_eh_region_nr (r, p);
5889 gimple_eh_dispatch_set_region (stmt, r);
5893 case GIMPLE_OMP_RETURN:
5894 case GIMPLE_OMP_CONTINUE:
5897 if (is_gimple_omp (stmt))
5899 /* Do not remap variables inside OMP directives. Variables
5900 referenced in clauses and directive header belong to the
5901 parent function and should not be moved into the child
5903 bool save_remap_decls_p = p->remap_decls_p;
5904 p->remap_decls_p = false;
5905 *handled_ops_p = true;
5907 walk_gimple_seq (gimple_omp_body (stmt), move_stmt_r,
5910 p->remap_decls_p = save_remap_decls_p;
5918 /* Move basic block BB from function CFUN to function DEST_FN. The
5919 block is moved out of the original linked list and placed after
5920 block AFTER in the new list. Also, the block is removed from the
5921 original array of blocks and placed in DEST_FN's array of blocks.
5922 If UPDATE_EDGE_COUNT_P is true, the edge counts on both CFGs is
5923 updated to reflect the moved edges.
5925 The local variables are remapped to new instances, VARS_MAP is used
5926 to record the mapping. */
5929 move_block_to_fn (struct function *dest_cfun, basic_block bb,
5930 basic_block after, bool update_edge_count_p,
5931 struct move_stmt_d *d)
5933 struct control_flow_graph *cfg;
5936 gimple_stmt_iterator si;
5937 unsigned old_len, new_len;
5939 /* Remove BB from dominance structures. */
5940 delete_from_dominance_info (CDI_DOMINATORS, bb);
5942 remove_bb_from_loops (bb);
5944 /* Link BB to the new linked list. */
5945 move_block_after (bb, after);
5947 /* Update the edge count in the corresponding flowgraphs. */
5948 if (update_edge_count_p)
5949 FOR_EACH_EDGE (e, ei, bb->succs)
5951 cfun->cfg->x_n_edges--;
5952 dest_cfun->cfg->x_n_edges++;
5955 /* Remove BB from the original basic block array. */
5956 VEC_replace (basic_block, cfun->cfg->x_basic_block_info, bb->index, NULL);
5957 cfun->cfg->x_n_basic_blocks--;
5959 /* Grow DEST_CFUN's basic block array if needed. */
5960 cfg = dest_cfun->cfg;
5961 cfg->x_n_basic_blocks++;
5962 if (bb->index >= cfg->x_last_basic_block)
5963 cfg->x_last_basic_block = bb->index + 1;
5965 old_len = VEC_length (basic_block, cfg->x_basic_block_info);
5966 if ((unsigned) cfg->x_last_basic_block >= old_len)
5968 new_len = cfg->x_last_basic_block + (cfg->x_last_basic_block + 3) / 4;
5969 VEC_safe_grow_cleared (basic_block, gc, cfg->x_basic_block_info,
5973 VEC_replace (basic_block, cfg->x_basic_block_info,
5976 /* Remap the variables in phi nodes. */
5977 for (si = gsi_start_phis (bb); !gsi_end_p (si); )
5979 gimple phi = gsi_stmt (si);
5981 tree op = PHI_RESULT (phi);
5984 if (!is_gimple_reg (op))
5986 /* Remove the phi nodes for virtual operands (alias analysis will be
5987 run for the new function, anyway). */
5988 remove_phi_node (&si, true);
5992 SET_PHI_RESULT (phi,
5993 replace_ssa_name (op, d->vars_map, dest_cfun->decl));
5994 FOR_EACH_PHI_ARG (use, phi, oi, SSA_OP_USE)
5996 op = USE_FROM_PTR (use);
5997 if (TREE_CODE (op) == SSA_NAME)
5998 SET_USE (use, replace_ssa_name (op, d->vars_map, dest_cfun->decl));
6004 for (si = gsi_start_bb (bb); !gsi_end_p (si); gsi_next (&si))
6006 gimple stmt = gsi_stmt (si);
6007 struct walk_stmt_info wi;
6009 memset (&wi, 0, sizeof (wi));
6011 walk_gimple_stmt (&si, move_stmt_r, move_stmt_op, &wi);
6013 if (gimple_code (stmt) == GIMPLE_LABEL)
6015 tree label = gimple_label_label (stmt);
6016 int uid = LABEL_DECL_UID (label);
6018 gcc_assert (uid > -1);
6020 old_len = VEC_length (basic_block, cfg->x_label_to_block_map);
6021 if (old_len <= (unsigned) uid)
6023 new_len = 3 * uid / 2 + 1;
6024 VEC_safe_grow_cleared (basic_block, gc,
6025 cfg->x_label_to_block_map, new_len);
6028 VEC_replace (basic_block, cfg->x_label_to_block_map, uid, bb);
6029 VEC_replace (basic_block, cfun->cfg->x_label_to_block_map, uid, NULL);
6031 gcc_assert (DECL_CONTEXT (label) == dest_cfun->decl);
6033 if (uid >= dest_cfun->cfg->last_label_uid)
6034 dest_cfun->cfg->last_label_uid = uid + 1;
6037 maybe_duplicate_eh_stmt_fn (dest_cfun, stmt, cfun, stmt, d->eh_map, 0);
6038 remove_stmt_from_eh_lp_fn (cfun, stmt);
6040 gimple_duplicate_stmt_histograms (dest_cfun, stmt, cfun, stmt);
6041 gimple_remove_stmt_histograms (cfun, stmt);
6043 /* We cannot leave any operands allocated from the operand caches of
6044 the current function. */
6045 free_stmt_operands (stmt);
6046 push_cfun (dest_cfun);
6051 FOR_EACH_EDGE (e, ei, bb->succs)
6054 tree block = e->goto_block;
6055 if (d->orig_block == NULL_TREE
6056 || block == d->orig_block)
6057 e->goto_block = d->new_block;
6058 #ifdef ENABLE_CHECKING
6059 else if (block != d->new_block)
6061 while (block && block != d->orig_block)
6062 block = BLOCK_SUPERCONTEXT (block);
6069 /* Examine the statements in BB (which is in SRC_CFUN); find and return
6070 the outermost EH region. Use REGION as the incoming base EH region. */
6073 find_outermost_region_in_block (struct function *src_cfun,
6074 basic_block bb, eh_region region)
6076 gimple_stmt_iterator si;
6078 for (si = gsi_start_bb (bb); !gsi_end_p (si); gsi_next (&si))
6080 gimple stmt = gsi_stmt (si);
6081 eh_region stmt_region;
6084 lp_nr = lookup_stmt_eh_lp_fn (src_cfun, stmt);
6085 stmt_region = get_eh_region_from_lp_number_fn (src_cfun, lp_nr);
6089 region = stmt_region;
6090 else if (stmt_region != region)
6092 region = eh_region_outermost (src_cfun, stmt_region, region);
6093 gcc_assert (region != NULL);
6102 new_label_mapper (tree decl, void *data)
6104 htab_t hash = (htab_t) data;
6108 gcc_assert (TREE_CODE (decl) == LABEL_DECL);
6110 m = XNEW (struct tree_map);
6111 m->hash = DECL_UID (decl);
6112 m->base.from = decl;
6113 m->to = create_artificial_label (UNKNOWN_LOCATION);
6114 LABEL_DECL_UID (m->to) = LABEL_DECL_UID (decl);
6115 if (LABEL_DECL_UID (m->to) >= cfun->cfg->last_label_uid)
6116 cfun->cfg->last_label_uid = LABEL_DECL_UID (m->to) + 1;
6118 slot = htab_find_slot_with_hash (hash, m, m->hash, INSERT);
6119 gcc_assert (*slot == NULL);
6126 /* Change DECL_CONTEXT of all BLOCK_VARS in block, including
6130 replace_block_vars_by_duplicates (tree block, struct pointer_map_t *vars_map,
6135 for (tp = &BLOCK_VARS (block); *tp; tp = &DECL_CHAIN (*tp))
6138 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != CONST_DECL)
6140 replace_by_duplicate_decl (&t, vars_map, to_context);
6143 if (TREE_CODE (*tp) == VAR_DECL && DECL_HAS_VALUE_EXPR_P (*tp))
6145 SET_DECL_VALUE_EXPR (t, DECL_VALUE_EXPR (*tp));
6146 DECL_HAS_VALUE_EXPR_P (t) = 1;
6148 DECL_CHAIN (t) = DECL_CHAIN (*tp);
6153 for (block = BLOCK_SUBBLOCKS (block); block; block = BLOCK_CHAIN (block))
6154 replace_block_vars_by_duplicates (block, vars_map, to_context);
6157 /* Move a single-entry, single-exit region delimited by ENTRY_BB and
6158 EXIT_BB to function DEST_CFUN. The whole region is replaced by a
6159 single basic block in the original CFG and the new basic block is
6160 returned. DEST_CFUN must not have a CFG yet.
6162 Note that the region need not be a pure SESE region. Blocks inside
6163 the region may contain calls to abort/exit. The only restriction
6164 is that ENTRY_BB should be the only entry point and it must
6167 Change TREE_BLOCK of all statements in ORIG_BLOCK to the new
6168 functions outermost BLOCK, move all subblocks of ORIG_BLOCK
6169 to the new function.
6171 All local variables referenced in the region are assumed to be in
6172 the corresponding BLOCK_VARS and unexpanded variable lists
6173 associated with DEST_CFUN. */
6176 move_sese_region_to_fn (struct function *dest_cfun, basic_block entry_bb,
6177 basic_block exit_bb, tree orig_block)
6179 VEC(basic_block,heap) *bbs, *dom_bbs;
6180 basic_block dom_entry = get_immediate_dominator (CDI_DOMINATORS, entry_bb);
6181 basic_block after, bb, *entry_pred, *exit_succ, abb;
6182 struct function *saved_cfun = cfun;
6183 int *entry_flag, *exit_flag;
6184 unsigned *entry_prob, *exit_prob;
6185 unsigned i, num_entry_edges, num_exit_edges;
6188 htab_t new_label_map;
6189 struct pointer_map_t *vars_map, *eh_map;
6190 struct loop *loop = entry_bb->loop_father;
6191 struct move_stmt_d d;
6193 /* If ENTRY does not strictly dominate EXIT, this cannot be an SESE
6195 gcc_assert (entry_bb != exit_bb
6197 || dominated_by_p (CDI_DOMINATORS, exit_bb, entry_bb)));
6199 /* Collect all the blocks in the region. Manually add ENTRY_BB
6200 because it won't be added by dfs_enumerate_from. */
6202 VEC_safe_push (basic_block, heap, bbs, entry_bb);
6203 gather_blocks_in_sese_region (entry_bb, exit_bb, &bbs);
6205 /* The blocks that used to be dominated by something in BBS will now be
6206 dominated by the new block. */
6207 dom_bbs = get_dominated_by_region (CDI_DOMINATORS,
6208 VEC_address (basic_block, bbs),
6209 VEC_length (basic_block, bbs));
6211 /* Detach ENTRY_BB and EXIT_BB from CFUN->CFG. We need to remember
6212 the predecessor edges to ENTRY_BB and the successor edges to
6213 EXIT_BB so that we can re-attach them to the new basic block that
6214 will replace the region. */
6215 num_entry_edges = EDGE_COUNT (entry_bb->preds);
6216 entry_pred = (basic_block *) xcalloc (num_entry_edges, sizeof (basic_block));
6217 entry_flag = (int *) xcalloc (num_entry_edges, sizeof (int));
6218 entry_prob = XNEWVEC (unsigned, num_entry_edges);
6220 for (ei = ei_start (entry_bb->preds); (e = ei_safe_edge (ei)) != NULL;)
6222 entry_prob[i] = e->probability;
6223 entry_flag[i] = e->flags;
6224 entry_pred[i++] = e->src;
6230 num_exit_edges = EDGE_COUNT (exit_bb->succs);
6231 exit_succ = (basic_block *) xcalloc (num_exit_edges,
6232 sizeof (basic_block));
6233 exit_flag = (int *) xcalloc (num_exit_edges, sizeof (int));
6234 exit_prob = XNEWVEC (unsigned, num_exit_edges);
6236 for (ei = ei_start (exit_bb->succs); (e = ei_safe_edge (ei)) != NULL;)
6238 exit_prob[i] = e->probability;
6239 exit_flag[i] = e->flags;
6240 exit_succ[i++] = e->dest;
6252 /* Switch context to the child function to initialize DEST_FN's CFG. */
6253 gcc_assert (dest_cfun->cfg == NULL);
6254 push_cfun (dest_cfun);
6256 init_empty_tree_cfg ();
6258 /* Initialize EH information for the new function. */
6260 new_label_map = NULL;
6263 eh_region region = NULL;
6265 FOR_EACH_VEC_ELT (basic_block, bbs, i, bb)
6266 region = find_outermost_region_in_block (saved_cfun, bb, region);
6268 init_eh_for_function ();
6271 new_label_map = htab_create (17, tree_map_hash, tree_map_eq, free);
6272 eh_map = duplicate_eh_regions (saved_cfun, region, 0,
6273 new_label_mapper, new_label_map);
6279 /* Move blocks from BBS into DEST_CFUN. */
6280 gcc_assert (VEC_length (basic_block, bbs) >= 2);
6281 after = dest_cfun->cfg->x_entry_block_ptr;
6282 vars_map = pointer_map_create ();
6284 memset (&d, 0, sizeof (d));
6285 d.orig_block = orig_block;
6286 d.new_block = DECL_INITIAL (dest_cfun->decl);
6287 d.from_context = cfun->decl;
6288 d.to_context = dest_cfun->decl;
6289 d.vars_map = vars_map;
6290 d.new_label_map = new_label_map;
6292 d.remap_decls_p = true;
6294 FOR_EACH_VEC_ELT (basic_block, bbs, i, bb)
6296 /* No need to update edge counts on the last block. It has
6297 already been updated earlier when we detached the region from
6298 the original CFG. */
6299 move_block_to_fn (dest_cfun, bb, after, bb != exit_bb, &d);
6303 /* Rewire BLOCK_SUBBLOCKS of orig_block. */
6307 gcc_assert (BLOCK_SUBBLOCKS (DECL_INITIAL (dest_cfun->decl))
6309 BLOCK_SUBBLOCKS (DECL_INITIAL (dest_cfun->decl))
6310 = BLOCK_SUBBLOCKS (orig_block);
6311 for (block = BLOCK_SUBBLOCKS (orig_block);
6312 block; block = BLOCK_CHAIN (block))
6313 BLOCK_SUPERCONTEXT (block) = DECL_INITIAL (dest_cfun->decl);
6314 BLOCK_SUBBLOCKS (orig_block) = NULL_TREE;
6317 replace_block_vars_by_duplicates (DECL_INITIAL (dest_cfun->decl),
6318 vars_map, dest_cfun->decl);
6321 htab_delete (new_label_map);
6323 pointer_map_destroy (eh_map);
6324 pointer_map_destroy (vars_map);
6326 /* Rewire the entry and exit blocks. The successor to the entry
6327 block turns into the successor of DEST_FN's ENTRY_BLOCK_PTR in
6328 the child function. Similarly, the predecessor of DEST_FN's
6329 EXIT_BLOCK_PTR turns into the predecessor of EXIT_BLOCK_PTR. We
6330 need to switch CFUN between DEST_CFUN and SAVED_CFUN so that the
6331 various CFG manipulation function get to the right CFG.
6333 FIXME, this is silly. The CFG ought to become a parameter to
6335 push_cfun (dest_cfun);
6336 make_edge (ENTRY_BLOCK_PTR, entry_bb, EDGE_FALLTHRU);
6338 make_edge (exit_bb, EXIT_BLOCK_PTR, 0);
6341 /* Back in the original function, the SESE region has disappeared,
6342 create a new basic block in its place. */
6343 bb = create_empty_bb (entry_pred[0]);
6345 add_bb_to_loop (bb, loop);
6346 for (i = 0; i < num_entry_edges; i++)
6348 e = make_edge (entry_pred[i], bb, entry_flag[i]);
6349 e->probability = entry_prob[i];
6352 for (i = 0; i < num_exit_edges; i++)
6354 e = make_edge (bb, exit_succ[i], exit_flag[i]);
6355 e->probability = exit_prob[i];
6358 set_immediate_dominator (CDI_DOMINATORS, bb, dom_entry);
6359 FOR_EACH_VEC_ELT (basic_block, dom_bbs, i, abb)
6360 set_immediate_dominator (CDI_DOMINATORS, abb, bb);
6361 VEC_free (basic_block, heap, dom_bbs);
6372 VEC_free (basic_block, heap, bbs);
6378 /* Dump FUNCTION_DECL FN to file FILE using FLAGS (see TDF_* in tree-pass.h)
6382 dump_function_to_file (tree fn, FILE *file, int flags)
6385 struct function *dsf;
6386 bool ignore_topmost_bind = false, any_var = false;
6390 fprintf (file, "%s (", lang_hooks.decl_printable_name (fn, 2));
6392 arg = DECL_ARGUMENTS (fn);
6395 print_generic_expr (file, TREE_TYPE (arg), dump_flags);
6396 fprintf (file, " ");
6397 print_generic_expr (file, arg, dump_flags);
6398 if (flags & TDF_VERBOSE)
6399 print_node (file, "", arg, 4);
6400 if (DECL_CHAIN (arg))
6401 fprintf (file, ", ");
6402 arg = DECL_CHAIN (arg);
6404 fprintf (file, ")\n");
6406 if (flags & TDF_VERBOSE)
6407 print_node (file, "", fn, 2);
6409 dsf = DECL_STRUCT_FUNCTION (fn);
6410 if (dsf && (flags & TDF_EH))
6411 dump_eh_tree (file, dsf);
6413 if (flags & TDF_RAW && !gimple_has_body_p (fn))
6415 dump_node (fn, TDF_SLIM | flags, file);
6419 /* Switch CFUN to point to FN. */
6420 push_cfun (DECL_STRUCT_FUNCTION (fn));
6422 /* When GIMPLE is lowered, the variables are no longer available in
6423 BIND_EXPRs, so display them separately. */
6424 if (cfun && cfun->decl == fn && !VEC_empty (tree, cfun->local_decls))
6427 ignore_topmost_bind = true;
6429 fprintf (file, "{\n");
6430 FOR_EACH_LOCAL_DECL (cfun, ix, var)
6432 print_generic_decl (file, var, flags);
6433 if (flags & TDF_VERBOSE)
6434 print_node (file, "", var, 4);
6435 fprintf (file, "\n");
6441 if (cfun && cfun->decl == fn && cfun->cfg && basic_block_info)
6443 /* If the CFG has been built, emit a CFG-based dump. */
6444 check_bb_profile (ENTRY_BLOCK_PTR, file);
6445 if (!ignore_topmost_bind)
6446 fprintf (file, "{\n");
6448 if (any_var && n_basic_blocks)
6449 fprintf (file, "\n");
6452 gimple_dump_bb (bb, file, 2, flags);
6454 fprintf (file, "}\n");
6455 check_bb_profile (EXIT_BLOCK_PTR, file);
6457 else if (DECL_SAVED_TREE (fn) == NULL)
6459 /* The function is now in GIMPLE form but the CFG has not been
6460 built yet. Emit the single sequence of GIMPLE statements
6461 that make up its body. */
6462 gimple_seq body = gimple_body (fn);
6464 if (gimple_seq_first_stmt (body)
6465 && gimple_seq_first_stmt (body) == gimple_seq_last_stmt (body)
6466 && gimple_code (gimple_seq_first_stmt (body)) == GIMPLE_BIND)
6467 print_gimple_seq (file, body, 0, flags);
6470 if (!ignore_topmost_bind)
6471 fprintf (file, "{\n");
6474 fprintf (file, "\n");
6476 print_gimple_seq (file, body, 2, flags);
6477 fprintf (file, "}\n");
6484 /* Make a tree based dump. */
6485 chain = DECL_SAVED_TREE (fn);
6487 if (chain && TREE_CODE (chain) == BIND_EXPR)
6489 if (ignore_topmost_bind)
6491 chain = BIND_EXPR_BODY (chain);
6499 if (!ignore_topmost_bind)
6500 fprintf (file, "{\n");
6505 fprintf (file, "\n");
6507 print_generic_stmt_indented (file, chain, flags, indent);
6508 if (ignore_topmost_bind)
6509 fprintf (file, "}\n");
6512 if (flags & TDF_ENUMERATE_LOCALS)
6513 dump_enumerated_decls (file, flags);
6514 fprintf (file, "\n\n");
6521 /* Dump FUNCTION_DECL FN to stderr using FLAGS (see TDF_* in tree.h) */
6524 debug_function (tree fn, int flags)
6526 dump_function_to_file (fn, stderr, flags);
6530 /* Print on FILE the indexes for the predecessors of basic_block BB. */
6533 print_pred_bbs (FILE *file, basic_block bb)
6538 FOR_EACH_EDGE (e, ei, bb->preds)
6539 fprintf (file, "bb_%d ", e->src->index);
6543 /* Print on FILE the indexes for the successors of basic_block BB. */
6546 print_succ_bbs (FILE *file, basic_block bb)
6551 FOR_EACH_EDGE (e, ei, bb->succs)
6552 fprintf (file, "bb_%d ", e->dest->index);
6555 /* Print to FILE the basic block BB following the VERBOSITY level. */
6558 print_loops_bb (FILE *file, basic_block bb, int indent, int verbosity)
6560 char *s_indent = (char *) alloca ((size_t) indent + 1);
6561 memset ((void *) s_indent, ' ', (size_t) indent);
6562 s_indent[indent] = '\0';
6564 /* Print basic_block's header. */
6567 fprintf (file, "%s bb_%d (preds = {", s_indent, bb->index);
6568 print_pred_bbs (file, bb);
6569 fprintf (file, "}, succs = {");
6570 print_succ_bbs (file, bb);
6571 fprintf (file, "})\n");
6574 /* Print basic_block's body. */
6577 fprintf (file, "%s {\n", s_indent);
6578 gimple_dump_bb (bb, file, indent + 4, TDF_VOPS|TDF_MEMSYMS);
6579 fprintf (file, "%s }\n", s_indent);
6583 static void print_loop_and_siblings (FILE *, struct loop *, int, int);
6585 /* Pretty print LOOP on FILE, indented INDENT spaces. Following
6586 VERBOSITY level this outputs the contents of the loop, or just its
6590 print_loop (FILE *file, struct loop *loop, int indent, int verbosity)
6598 s_indent = (char *) alloca ((size_t) indent + 1);
6599 memset ((void *) s_indent, ' ', (size_t) indent);
6600 s_indent[indent] = '\0';
6602 /* Print loop's header. */
6603 fprintf (file, "%sloop_%d (header = %d, latch = %d", s_indent,
6604 loop->num, loop->header->index, loop->latch->index);
6605 fprintf (file, ", niter = ");
6606 print_generic_expr (file, loop->nb_iterations, 0);
6608 if (loop->any_upper_bound)
6610 fprintf (file, ", upper_bound = ");
6611 dump_double_int (file, loop->nb_iterations_upper_bound, true);
6614 if (loop->any_estimate)
6616 fprintf (file, ", estimate = ");
6617 dump_double_int (file, loop->nb_iterations_estimate, true);
6619 fprintf (file, ")\n");
6621 /* Print loop's body. */
6624 fprintf (file, "%s{\n", s_indent);
6626 if (bb->loop_father == loop)
6627 print_loops_bb (file, bb, indent, verbosity);
6629 print_loop_and_siblings (file, loop->inner, indent + 2, verbosity);
6630 fprintf (file, "%s}\n", s_indent);
6634 /* Print the LOOP and its sibling loops on FILE, indented INDENT
6635 spaces. Following VERBOSITY level this outputs the contents of the
6636 loop, or just its structure. */
6639 print_loop_and_siblings (FILE *file, struct loop *loop, int indent, int verbosity)
6644 print_loop (file, loop, indent, verbosity);
6645 print_loop_and_siblings (file, loop->next, indent, verbosity);
6648 /* Follow a CFG edge from the entry point of the program, and on entry
6649 of a loop, pretty print the loop structure on FILE. */
6652 print_loops (FILE *file, int verbosity)
6656 bb = ENTRY_BLOCK_PTR;
6657 if (bb && bb->loop_father)
6658 print_loop_and_siblings (file, bb->loop_father, 0, verbosity);
6662 /* Debugging loops structure at tree level, at some VERBOSITY level. */
6665 debug_loops (int verbosity)
6667 print_loops (stderr, verbosity);
6670 /* Print on stderr the code of LOOP, at some VERBOSITY level. */
6673 debug_loop (struct loop *loop, int verbosity)
6675 print_loop (stderr, loop, 0, verbosity);
6678 /* Print on stderr the code of loop number NUM, at some VERBOSITY
6682 debug_loop_num (unsigned num, int verbosity)
6684 debug_loop (get_loop (num), verbosity);
6687 /* Return true if BB ends with a call, possibly followed by some
6688 instructions that must stay with the call. Return false,
6692 gimple_block_ends_with_call_p (basic_block bb)
6694 gimple_stmt_iterator gsi = gsi_last_nondebug_bb (bb);
6695 return !gsi_end_p (gsi) && is_gimple_call (gsi_stmt (gsi));
6699 /* Return true if BB ends with a conditional branch. Return false,
6703 gimple_block_ends_with_condjump_p (const_basic_block bb)
6705 gimple stmt = last_stmt (CONST_CAST_BB (bb));
6706 return (stmt && gimple_code (stmt) == GIMPLE_COND);
6710 /* Return true if we need to add fake edge to exit at statement T.
6711 Helper function for gimple_flow_call_edges_add. */
6714 need_fake_edge_p (gimple t)
6716 tree fndecl = NULL_TREE;
6719 /* NORETURN and LONGJMP calls already have an edge to exit.
6720 CONST and PURE calls do not need one.
6721 We don't currently check for CONST and PURE here, although
6722 it would be a good idea, because those attributes are
6723 figured out from the RTL in mark_constant_function, and
6724 the counter incrementation code from -fprofile-arcs
6725 leads to different results from -fbranch-probabilities. */
6726 if (is_gimple_call (t))
6728 fndecl = gimple_call_fndecl (t);
6729 call_flags = gimple_call_flags (t);
6732 if (is_gimple_call (t)
6734 && DECL_BUILT_IN (fndecl)
6735 && (call_flags & ECF_NOTHROW)
6736 && !(call_flags & ECF_RETURNS_TWICE)
6737 /* fork() doesn't really return twice, but the effect of
6738 wrapping it in __gcov_fork() which calls __gcov_flush()
6739 and clears the counters before forking has the same
6740 effect as returning twice. Force a fake edge. */
6741 && !(DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_NORMAL
6742 && DECL_FUNCTION_CODE (fndecl) == BUILT_IN_FORK))
6745 if (is_gimple_call (t)
6746 && !(call_flags & ECF_NORETURN))
6749 if (gimple_code (t) == GIMPLE_ASM
6750 && (gimple_asm_volatile_p (t) || gimple_asm_input_p (t)))
6757 /* Add fake edges to the function exit for any non constant and non
6758 noreturn calls, volatile inline assembly in the bitmap of blocks
6759 specified by BLOCKS or to the whole CFG if BLOCKS is zero. Return
6760 the number of blocks that were split.
6762 The goal is to expose cases in which entering a basic block does
6763 not imply that all subsequent instructions must be executed. */
6766 gimple_flow_call_edges_add (sbitmap blocks)
6769 int blocks_split = 0;
6770 int last_bb = last_basic_block;
6771 bool check_last_block = false;
6773 if (n_basic_blocks == NUM_FIXED_BLOCKS)
6777 check_last_block = true;
6779 check_last_block = TEST_BIT (blocks, EXIT_BLOCK_PTR->prev_bb->index);
6781 /* In the last basic block, before epilogue generation, there will be
6782 a fallthru edge to EXIT. Special care is required if the last insn
6783 of the last basic block is a call because make_edge folds duplicate
6784 edges, which would result in the fallthru edge also being marked
6785 fake, which would result in the fallthru edge being removed by
6786 remove_fake_edges, which would result in an invalid CFG.
6788 Moreover, we can't elide the outgoing fake edge, since the block
6789 profiler needs to take this into account in order to solve the minimal
6790 spanning tree in the case that the call doesn't return.
6792 Handle this by adding a dummy instruction in a new last basic block. */
6793 if (check_last_block)
6795 basic_block bb = EXIT_BLOCK_PTR->prev_bb;
6796 gimple_stmt_iterator gsi = gsi_last_nondebug_bb (bb);
6799 if (!gsi_end_p (gsi))
6802 if (t && need_fake_edge_p (t))
6806 e = find_edge (bb, EXIT_BLOCK_PTR);
6809 gsi_insert_on_edge (e, gimple_build_nop ());
6810 gsi_commit_edge_inserts ();
6815 /* Now add fake edges to the function exit for any non constant
6816 calls since there is no way that we can determine if they will
6818 for (i = 0; i < last_bb; i++)
6820 basic_block bb = BASIC_BLOCK (i);
6821 gimple_stmt_iterator gsi;
6822 gimple stmt, last_stmt;
6827 if (blocks && !TEST_BIT (blocks, i))
6830 gsi = gsi_last_nondebug_bb (bb);
6831 if (!gsi_end_p (gsi))
6833 last_stmt = gsi_stmt (gsi);
6836 stmt = gsi_stmt (gsi);
6837 if (need_fake_edge_p (stmt))
6841 /* The handling above of the final block before the
6842 epilogue should be enough to verify that there is
6843 no edge to the exit block in CFG already.
6844 Calling make_edge in such case would cause us to
6845 mark that edge as fake and remove it later. */
6846 #ifdef ENABLE_CHECKING
6847 if (stmt == last_stmt)
6849 e = find_edge (bb, EXIT_BLOCK_PTR);
6850 gcc_assert (e == NULL);
6854 /* Note that the following may create a new basic block
6855 and renumber the existing basic blocks. */
6856 if (stmt != last_stmt)
6858 e = split_block (bb, stmt);
6862 make_edge (bb, EXIT_BLOCK_PTR, EDGE_FAKE);
6866 while (!gsi_end_p (gsi));
6871 verify_flow_info ();
6873 return blocks_split;
6876 /* Removes edge E and all the blocks dominated by it, and updates dominance
6877 information. The IL in E->src needs to be updated separately.
6878 If dominance info is not available, only the edge E is removed.*/
6881 remove_edge_and_dominated_blocks (edge e)
6883 VEC (basic_block, heap) *bbs_to_remove = NULL;
6884 VEC (basic_block, heap) *bbs_to_fix_dom = NULL;
6888 bool none_removed = false;
6890 basic_block bb, dbb;
6893 if (!dom_info_available_p (CDI_DOMINATORS))
6899 /* No updating is needed for edges to exit. */
6900 if (e->dest == EXIT_BLOCK_PTR)
6902 if (cfgcleanup_altered_bbs)
6903 bitmap_set_bit (cfgcleanup_altered_bbs, e->src->index);
6908 /* First, we find the basic blocks to remove. If E->dest has a predecessor
6909 that is not dominated by E->dest, then this set is empty. Otherwise,
6910 all the basic blocks dominated by E->dest are removed.
6912 Also, to DF_IDOM we store the immediate dominators of the blocks in
6913 the dominance frontier of E (i.e., of the successors of the
6914 removed blocks, if there are any, and of E->dest otherwise). */
6915 FOR_EACH_EDGE (f, ei, e->dest->preds)
6920 if (!dominated_by_p (CDI_DOMINATORS, f->src, e->dest))
6922 none_removed = true;
6927 df = BITMAP_ALLOC (NULL);
6928 df_idom = BITMAP_ALLOC (NULL);
6931 bitmap_set_bit (df_idom,
6932 get_immediate_dominator (CDI_DOMINATORS, e->dest)->index);
6935 bbs_to_remove = get_all_dominated_blocks (CDI_DOMINATORS, e->dest);
6936 FOR_EACH_VEC_ELT (basic_block, bbs_to_remove, i, bb)
6938 FOR_EACH_EDGE (f, ei, bb->succs)
6940 if (f->dest != EXIT_BLOCK_PTR)
6941 bitmap_set_bit (df, f->dest->index);
6944 FOR_EACH_VEC_ELT (basic_block, bbs_to_remove, i, bb)
6945 bitmap_clear_bit (df, bb->index);
6947 EXECUTE_IF_SET_IN_BITMAP (df, 0, i, bi)
6949 bb = BASIC_BLOCK (i);
6950 bitmap_set_bit (df_idom,
6951 get_immediate_dominator (CDI_DOMINATORS, bb)->index);
6955 if (cfgcleanup_altered_bbs)
6957 /* Record the set of the altered basic blocks. */
6958 bitmap_set_bit (cfgcleanup_altered_bbs, e->src->index);
6959 bitmap_ior_into (cfgcleanup_altered_bbs, df);
6962 /* Remove E and the cancelled blocks. */
6967 /* Walk backwards so as to get a chance to substitute all
6968 released DEFs into debug stmts. See
6969 eliminate_unnecessary_stmts() in tree-ssa-dce.c for more
6971 for (i = VEC_length (basic_block, bbs_to_remove); i-- > 0; )
6972 delete_basic_block (VEC_index (basic_block, bbs_to_remove, i));
6975 /* Update the dominance information. The immediate dominator may change only
6976 for blocks whose immediate dominator belongs to DF_IDOM:
6978 Suppose that idom(X) = Y before removal of E and idom(X) != Y after the
6979 removal. Let Z the arbitrary block such that idom(Z) = Y and
6980 Z dominates X after the removal. Before removal, there exists a path P
6981 from Y to X that avoids Z. Let F be the last edge on P that is
6982 removed, and let W = F->dest. Before removal, idom(W) = Y (since Y
6983 dominates W, and because of P, Z does not dominate W), and W belongs to
6984 the dominance frontier of E. Therefore, Y belongs to DF_IDOM. */
6985 EXECUTE_IF_SET_IN_BITMAP (df_idom, 0, i, bi)
6987 bb = BASIC_BLOCK (i);
6988 for (dbb = first_dom_son (CDI_DOMINATORS, bb);
6990 dbb = next_dom_son (CDI_DOMINATORS, dbb))
6991 VEC_safe_push (basic_block, heap, bbs_to_fix_dom, dbb);
6994 iterate_fix_dominators (CDI_DOMINATORS, bbs_to_fix_dom, true);
6997 BITMAP_FREE (df_idom);
6998 VEC_free (basic_block, heap, bbs_to_remove);
6999 VEC_free (basic_block, heap, bbs_to_fix_dom);
7002 /* Purge dead EH edges from basic block BB. */
7005 gimple_purge_dead_eh_edges (basic_block bb)
7007 bool changed = false;
7010 gimple stmt = last_stmt (bb);
7012 if (stmt && stmt_can_throw_internal (stmt))
7015 for (ei = ei_start (bb->succs); (e = ei_safe_edge (ei)); )
7017 if (e->flags & EDGE_EH)
7019 remove_edge_and_dominated_blocks (e);
7029 /* Purge dead EH edges from basic block listed in BLOCKS. */
7032 gimple_purge_all_dead_eh_edges (const_bitmap blocks)
7034 bool changed = false;
7038 EXECUTE_IF_SET_IN_BITMAP (blocks, 0, i, bi)
7040 basic_block bb = BASIC_BLOCK (i);
7042 /* Earlier gimple_purge_dead_eh_edges could have removed
7043 this basic block already. */
7044 gcc_assert (bb || changed);
7046 changed |= gimple_purge_dead_eh_edges (bb);
7052 /* Purge dead abnormal call edges from basic block BB. */
7055 gimple_purge_dead_abnormal_call_edges (basic_block bb)
7057 bool changed = false;
7060 gimple stmt = last_stmt (bb);
7062 if (!cfun->has_nonlocal_label)
7065 if (stmt && stmt_can_make_abnormal_goto (stmt))
7068 for (ei = ei_start (bb->succs); (e = ei_safe_edge (ei)); )
7070 if (e->flags & EDGE_ABNORMAL)
7072 remove_edge_and_dominated_blocks (e);
7082 /* Purge dead abnormal call edges from basic block listed in BLOCKS. */
7085 gimple_purge_all_dead_abnormal_call_edges (const_bitmap blocks)
7087 bool changed = false;
7091 EXECUTE_IF_SET_IN_BITMAP (blocks, 0, i, bi)
7093 basic_block bb = BASIC_BLOCK (i);
7095 /* Earlier gimple_purge_dead_abnormal_call_edges could have removed
7096 this basic block already. */
7097 gcc_assert (bb || changed);
7099 changed |= gimple_purge_dead_abnormal_call_edges (bb);
7105 /* This function is called whenever a new edge is created or
7109 gimple_execute_on_growing_pred (edge e)
7111 basic_block bb = e->dest;
7113 if (!gimple_seq_empty_p (phi_nodes (bb)))
7114 reserve_phi_args_for_new_edge (bb);
7117 /* This function is called immediately before edge E is removed from
7118 the edge vector E->dest->preds. */
7121 gimple_execute_on_shrinking_pred (edge e)
7123 if (!gimple_seq_empty_p (phi_nodes (e->dest)))
7124 remove_phi_args (e);
7127 /*---------------------------------------------------------------------------
7128 Helper functions for Loop versioning
7129 ---------------------------------------------------------------------------*/
7131 /* Adjust phi nodes for 'first' basic block. 'second' basic block is a copy
7132 of 'first'. Both of them are dominated by 'new_head' basic block. When
7133 'new_head' was created by 'second's incoming edge it received phi arguments
7134 on the edge by split_edge(). Later, additional edge 'e' was created to
7135 connect 'new_head' and 'first'. Now this routine adds phi args on this
7136 additional edge 'e' that new_head to second edge received as part of edge
7140 gimple_lv_adjust_loop_header_phi (basic_block first, basic_block second,
7141 basic_block new_head, edge e)
7144 gimple_stmt_iterator psi1, psi2;
7146 edge e2 = find_edge (new_head, second);
7148 /* Because NEW_HEAD has been created by splitting SECOND's incoming
7149 edge, we should always have an edge from NEW_HEAD to SECOND. */
7150 gcc_assert (e2 != NULL);
7152 /* Browse all 'second' basic block phi nodes and add phi args to
7153 edge 'e' for 'first' head. PHI args are always in correct order. */
7155 for (psi2 = gsi_start_phis (second),
7156 psi1 = gsi_start_phis (first);
7157 !gsi_end_p (psi2) && !gsi_end_p (psi1);
7158 gsi_next (&psi2), gsi_next (&psi1))
7160 phi1 = gsi_stmt (psi1);
7161 phi2 = gsi_stmt (psi2);
7162 def = PHI_ARG_DEF (phi2, e2->dest_idx);
7163 add_phi_arg (phi1, def, e, gimple_phi_arg_location_from_edge (phi2, e2));
7168 /* Adds a if else statement to COND_BB with condition COND_EXPR.
7169 SECOND_HEAD is the destination of the THEN and FIRST_HEAD is
7170 the destination of the ELSE part. */
7173 gimple_lv_add_condition_to_bb (basic_block first_head ATTRIBUTE_UNUSED,
7174 basic_block second_head ATTRIBUTE_UNUSED,
7175 basic_block cond_bb, void *cond_e)
7177 gimple_stmt_iterator gsi;
7178 gimple new_cond_expr;
7179 tree cond_expr = (tree) cond_e;
7182 /* Build new conditional expr */
7183 new_cond_expr = gimple_build_cond_from_tree (cond_expr,
7184 NULL_TREE, NULL_TREE);
7186 /* Add new cond in cond_bb. */
7187 gsi = gsi_last_bb (cond_bb);
7188 gsi_insert_after (&gsi, new_cond_expr, GSI_NEW_STMT);
7190 /* Adjust edges appropriately to connect new head with first head
7191 as well as second head. */
7192 e0 = single_succ_edge (cond_bb);
7193 e0->flags &= ~EDGE_FALLTHRU;
7194 e0->flags |= EDGE_FALSE_VALUE;
7197 struct cfg_hooks gimple_cfg_hooks = {
7199 gimple_verify_flow_info,
7200 gimple_dump_bb, /* dump_bb */
7201 create_bb, /* create_basic_block */
7202 gimple_redirect_edge_and_branch, /* redirect_edge_and_branch */
7203 gimple_redirect_edge_and_branch_force, /* redirect_edge_and_branch_force */
7204 gimple_can_remove_branch_p, /* can_remove_branch_p */
7205 remove_bb, /* delete_basic_block */
7206 gimple_split_block, /* split_block */
7207 gimple_move_block_after, /* move_block_after */
7208 gimple_can_merge_blocks_p, /* can_merge_blocks_p */
7209 gimple_merge_blocks, /* merge_blocks */
7210 gimple_predict_edge, /* predict_edge */
7211 gimple_predicted_by_p, /* predicted_by_p */
7212 gimple_can_duplicate_bb_p, /* can_duplicate_block_p */
7213 gimple_duplicate_bb, /* duplicate_block */
7214 gimple_split_edge, /* split_edge */
7215 gimple_make_forwarder_block, /* make_forward_block */
7216 NULL, /* tidy_fallthru_edge */
7217 NULL, /* force_nonfallthru */
7218 gimple_block_ends_with_call_p,/* block_ends_with_call_p */
7219 gimple_block_ends_with_condjump_p, /* block_ends_with_condjump_p */
7220 gimple_flow_call_edges_add, /* flow_call_edges_add */
7221 gimple_execute_on_growing_pred, /* execute_on_growing_pred */
7222 gimple_execute_on_shrinking_pred, /* execute_on_shrinking_pred */
7223 gimple_duplicate_loop_to_header_edge, /* duplicate loop for trees */
7224 gimple_lv_add_condition_to_bb, /* lv_add_condition_to_bb */
7225 gimple_lv_adjust_loop_header_phi, /* lv_adjust_loop_header_phi*/
7226 extract_true_false_edges_from_block, /* extract_cond_bb_edges */
7227 flush_pending_stmts /* flush_pending_stmts */
7231 /* Split all critical edges. */
7234 split_critical_edges (void)
7240 /* split_edge can redirect edges out of SWITCH_EXPRs, which can get
7241 expensive. So we want to enable recording of edge to CASE_LABEL_EXPR
7242 mappings around the calls to split_edge. */
7243 start_recording_case_labels ();
7246 FOR_EACH_EDGE (e, ei, bb->succs)
7248 if (EDGE_CRITICAL_P (e) && !(e->flags & EDGE_ABNORMAL))
7250 /* PRE inserts statements to edges and expects that
7251 since split_critical_edges was done beforehand, committing edge
7252 insertions will not split more edges. In addition to critical
7253 edges we must split edges that have multiple successors and
7254 end by control flow statements, such as RESX.
7255 Go ahead and split them too. This matches the logic in
7256 gimple_find_edge_insert_loc. */
7257 else if ((!single_pred_p (e->dest)
7258 || !gimple_seq_empty_p (phi_nodes (e->dest))
7259 || e->dest == EXIT_BLOCK_PTR)
7260 && e->src != ENTRY_BLOCK_PTR
7261 && !(e->flags & EDGE_ABNORMAL))
7263 gimple_stmt_iterator gsi;
7265 gsi = gsi_last_bb (e->src);
7266 if (!gsi_end_p (gsi)
7267 && stmt_ends_bb_p (gsi_stmt (gsi))
7268 && (gimple_code (gsi_stmt (gsi)) != GIMPLE_RETURN
7269 && !gimple_call_builtin_p (gsi_stmt (gsi),
7275 end_recording_case_labels ();
7279 struct gimple_opt_pass pass_split_crit_edges =
7283 "crited", /* name */
7285 split_critical_edges, /* execute */
7288 0, /* static_pass_number */
7289 TV_TREE_SPLIT_EDGES, /* tv_id */
7290 PROP_cfg, /* properties required */
7291 PROP_no_crit_edges, /* properties_provided */
7292 0, /* properties_destroyed */
7293 0, /* todo_flags_start */
7294 TODO_verify_flow /* todo_flags_finish */
7299 /* Build a ternary operation and gimplify it. Emit code before GSI.
7300 Return the gimple_val holding the result. */
7303 gimplify_build3 (gimple_stmt_iterator *gsi, enum tree_code code,
7304 tree type, tree a, tree b, tree c)
7307 location_t loc = gimple_location (gsi_stmt (*gsi));
7309 ret = fold_build3_loc (loc, code, type, a, b, c);
7312 return force_gimple_operand_gsi (gsi, ret, true, NULL, true,
7316 /* Build a binary operation and gimplify it. Emit code before GSI.
7317 Return the gimple_val holding the result. */
7320 gimplify_build2 (gimple_stmt_iterator *gsi, enum tree_code code,
7321 tree type, tree a, tree b)
7325 ret = fold_build2_loc (gimple_location (gsi_stmt (*gsi)), code, type, a, b);
7328 return force_gimple_operand_gsi (gsi, ret, true, NULL, true,
7332 /* Build a unary operation and gimplify it. Emit code before GSI.
7333 Return the gimple_val holding the result. */
7336 gimplify_build1 (gimple_stmt_iterator *gsi, enum tree_code code, tree type,
7341 ret = fold_build1_loc (gimple_location (gsi_stmt (*gsi)), code, type, a);
7344 return force_gimple_operand_gsi (gsi, ret, true, NULL, true,
7350 /* Emit return warnings. */
7353 execute_warn_function_return (void)
7355 source_location location;
7360 /* If we have a path to EXIT, then we do return. */
7361 if (TREE_THIS_VOLATILE (cfun->decl)
7362 && EDGE_COUNT (EXIT_BLOCK_PTR->preds) > 0)
7364 location = UNKNOWN_LOCATION;
7365 FOR_EACH_EDGE (e, ei, EXIT_BLOCK_PTR->preds)
7367 last = last_stmt (e->src);
7368 if ((gimple_code (last) == GIMPLE_RETURN
7369 || gimple_call_builtin_p (last, BUILT_IN_RETURN))
7370 && (location = gimple_location (last)) != UNKNOWN_LOCATION)
7373 if (location == UNKNOWN_LOCATION)
7374 location = cfun->function_end_locus;
7375 warning_at (location, 0, "%<noreturn%> function does return");
7378 /* If we see "return;" in some basic block, then we do reach the end
7379 without returning a value. */
7380 else if (warn_return_type
7381 && !TREE_NO_WARNING (cfun->decl)
7382 && EDGE_COUNT (EXIT_BLOCK_PTR->preds) > 0
7383 && !VOID_TYPE_P (TREE_TYPE (TREE_TYPE (cfun->decl))))
7385 FOR_EACH_EDGE (e, ei, EXIT_BLOCK_PTR->preds)
7387 gimple last = last_stmt (e->src);
7388 if (gimple_code (last) == GIMPLE_RETURN
7389 && gimple_return_retval (last) == NULL
7390 && !gimple_no_warning_p (last))
7392 location = gimple_location (last);
7393 if (location == UNKNOWN_LOCATION)
7394 location = cfun->function_end_locus;
7395 warning_at (location, OPT_Wreturn_type, "control reaches end of non-void function");
7396 TREE_NO_WARNING (cfun->decl) = 1;
7405 /* Given a basic block B which ends with a conditional and has
7406 precisely two successors, determine which of the edges is taken if
7407 the conditional is true and which is taken if the conditional is
7408 false. Set TRUE_EDGE and FALSE_EDGE appropriately. */
7411 extract_true_false_edges_from_block (basic_block b,
7415 edge e = EDGE_SUCC (b, 0);
7417 if (e->flags & EDGE_TRUE_VALUE)
7420 *false_edge = EDGE_SUCC (b, 1);
7425 *true_edge = EDGE_SUCC (b, 1);
7429 struct gimple_opt_pass pass_warn_function_return =
7433 "*warn_function_return", /* name */
7435 execute_warn_function_return, /* execute */
7438 0, /* static_pass_number */
7439 TV_NONE, /* tv_id */
7440 PROP_cfg, /* properties_required */
7441 0, /* properties_provided */
7442 0, /* properties_destroyed */
7443 0, /* todo_flags_start */
7444 0 /* todo_flags_finish */
7448 /* Emit noreturn warnings. */
7451 execute_warn_function_noreturn (void)
7453 if (!TREE_THIS_VOLATILE (current_function_decl)
7454 && EDGE_COUNT (EXIT_BLOCK_PTR->preds) == 0)
7455 warn_function_noreturn (current_function_decl);
7460 gate_warn_function_noreturn (void)
7462 return warn_suggest_attribute_noreturn;
7465 struct gimple_opt_pass pass_warn_function_noreturn =
7469 "*warn_function_noreturn", /* name */
7470 gate_warn_function_noreturn, /* gate */
7471 execute_warn_function_noreturn, /* execute */
7474 0, /* static_pass_number */
7475 TV_NONE, /* tv_id */
7476 PROP_cfg, /* properties_required */
7477 0, /* properties_provided */
7478 0, /* properties_destroyed */
7479 0, /* todo_flags_start */
7480 0 /* todo_flags_finish */
7485 /* Walk a gimplified function and warn for functions whose return value is
7486 ignored and attribute((warn_unused_result)) is set. This is done before
7487 inlining, so we don't have to worry about that. */
7490 do_warn_unused_result (gimple_seq seq)
7493 gimple_stmt_iterator i;
7495 for (i = gsi_start (seq); !gsi_end_p (i); gsi_next (&i))
7497 gimple g = gsi_stmt (i);
7499 switch (gimple_code (g))
7502 do_warn_unused_result (gimple_bind_body (g));
7505 do_warn_unused_result (gimple_try_eval (g));
7506 do_warn_unused_result (gimple_try_cleanup (g));
7509 do_warn_unused_result (gimple_catch_handler (g));
7511 case GIMPLE_EH_FILTER:
7512 do_warn_unused_result (gimple_eh_filter_failure (g));
7516 if (gimple_call_lhs (g))
7518 if (gimple_call_internal_p (g))
7521 /* This is a naked call, as opposed to a GIMPLE_CALL with an
7522 LHS. All calls whose value is ignored should be
7523 represented like this. Look for the attribute. */
7524 fdecl = gimple_call_fndecl (g);
7525 ftype = gimple_call_fntype (g);
7527 if (lookup_attribute ("warn_unused_result", TYPE_ATTRIBUTES (ftype)))
7529 location_t loc = gimple_location (g);
7532 warning_at (loc, OPT_Wunused_result,
7533 "ignoring return value of %qD, "
7534 "declared with attribute warn_unused_result",
7537 warning_at (loc, OPT_Wunused_result,
7538 "ignoring return value of function "
7539 "declared with attribute warn_unused_result");
7544 /* Not a container, not a call, or a call whose value is used. */
7551 run_warn_unused_result (void)
7553 do_warn_unused_result (gimple_body (current_function_decl));
7558 gate_warn_unused_result (void)
7560 return flag_warn_unused_result;
7563 struct gimple_opt_pass pass_warn_unused_result =
7567 "*warn_unused_result", /* name */
7568 gate_warn_unused_result, /* gate */
7569 run_warn_unused_result, /* execute */
7572 0, /* static_pass_number */
7573 TV_NONE, /* tv_id */
7574 PROP_gimple_any, /* properties_required */
7575 0, /* properties_provided */
7576 0, /* properties_destroyed */
7577 0, /* todo_flags_start */
7578 0, /* todo_flags_finish */