1 /* Control flow functions for trees.
2 Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009
3 Free Software Foundation, Inc.
4 Contributed by Diego Novillo <dnovillo@redhat.com>
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 3, or (at your option)
13 GCC is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
24 #include "coretypes.h"
29 #include "hard-reg-set.h"
30 #include "basic-block.h"
36 #include "langhooks.h"
37 #include "diagnostic.h"
38 #include "tree-flow.h"
40 #include "tree-dump.h"
41 #include "tree-pass.h"
45 #include "cfglayout.h"
46 #include "tree-ssa-propagate.h"
47 #include "value-prof.h"
48 #include "pointer-set.h"
49 #include "tree-inline.h"
51 /* This file contains functions for building the Control Flow Graph (CFG)
52 for a function tree. */
54 /* Local declarations. */
56 /* Initial capacity for the basic block array. */
57 static const int initial_cfg_capacity = 20;
59 /* This hash table allows us to efficiently lookup all CASE_LABEL_EXPRs
60 which use a particular edge. The CASE_LABEL_EXPRs are chained together
61 via their TREE_CHAIN field, which we clear after we're done with the
62 hash table to prevent problems with duplication of GIMPLE_SWITCHes.
64 Access to this list of CASE_LABEL_EXPRs allows us to efficiently
65 update the case vector in response to edge redirections.
67 Right now this table is set up and torn down at key points in the
68 compilation process. It would be nice if we could make the table
69 more persistent. The key is getting notification of changes to
70 the CFG (particularly edge removal, creation and redirection). */
72 static struct pointer_map_t *edge_to_cases;
77 long num_merged_labels;
80 static struct cfg_stats_d cfg_stats;
82 /* Nonzero if we found a computed goto while building basic blocks. */
83 static bool found_computed_goto;
85 /* Basic blocks and flowgraphs. */
86 static void make_blocks (gimple_seq);
87 static void factor_computed_gotos (void);
90 static void make_edges (void);
91 static void make_cond_expr_edges (basic_block);
92 static void make_gimple_switch_edges (basic_block);
93 static void make_goto_expr_edges (basic_block);
94 static edge gimple_redirect_edge_and_branch (edge, basic_block);
95 static edge gimple_try_redirect_by_replacing_jump (edge, basic_block);
96 static unsigned int split_critical_edges (void);
98 /* Various helpers. */
99 static inline bool stmt_starts_bb_p (gimple, gimple);
100 static int gimple_verify_flow_info (void);
101 static void gimple_make_forwarder_block (edge);
102 static void gimple_cfg2vcg (FILE *);
104 /* Flowgraph optimization and cleanup. */
105 static void gimple_merge_blocks (basic_block, basic_block);
106 static bool gimple_can_merge_blocks_p (basic_block, basic_block);
107 static void remove_bb (basic_block);
108 static edge find_taken_edge_computed_goto (basic_block, tree);
109 static edge find_taken_edge_cond_expr (basic_block, tree);
110 static edge find_taken_edge_switch_expr (basic_block, tree);
111 static tree find_case_label_for_value (gimple, tree);
114 init_empty_tree_cfg_for_function (struct function *fn)
116 /* Initialize the basic block array. */
118 profile_status_for_function (fn) = PROFILE_ABSENT;
119 n_basic_blocks_for_function (fn) = NUM_FIXED_BLOCKS;
120 last_basic_block_for_function (fn) = NUM_FIXED_BLOCKS;
121 basic_block_info_for_function (fn)
122 = VEC_alloc (basic_block, gc, initial_cfg_capacity);
123 VEC_safe_grow_cleared (basic_block, gc,
124 basic_block_info_for_function (fn),
125 initial_cfg_capacity);
127 /* Build a mapping of labels to their associated blocks. */
128 label_to_block_map_for_function (fn)
129 = VEC_alloc (basic_block, gc, initial_cfg_capacity);
130 VEC_safe_grow_cleared (basic_block, gc,
131 label_to_block_map_for_function (fn),
132 initial_cfg_capacity);
134 SET_BASIC_BLOCK_FOR_FUNCTION (fn, ENTRY_BLOCK,
135 ENTRY_BLOCK_PTR_FOR_FUNCTION (fn));
136 SET_BASIC_BLOCK_FOR_FUNCTION (fn, EXIT_BLOCK,
137 EXIT_BLOCK_PTR_FOR_FUNCTION (fn));
139 ENTRY_BLOCK_PTR_FOR_FUNCTION (fn)->next_bb
140 = EXIT_BLOCK_PTR_FOR_FUNCTION (fn);
141 EXIT_BLOCK_PTR_FOR_FUNCTION (fn)->prev_bb
142 = ENTRY_BLOCK_PTR_FOR_FUNCTION (fn);
146 init_empty_tree_cfg (void)
148 init_empty_tree_cfg_for_function (cfun);
151 /*---------------------------------------------------------------------------
153 ---------------------------------------------------------------------------*/
155 /* Entry point to the CFG builder for trees. SEQ is the sequence of
156 statements to be added to the flowgraph. */
159 build_gimple_cfg (gimple_seq seq)
161 /* Register specific gimple functions. */
162 gimple_register_cfg_hooks ();
164 memset ((void *) &cfg_stats, 0, sizeof (cfg_stats));
166 init_empty_tree_cfg ();
168 found_computed_goto = 0;
171 /* Computed gotos are hell to deal with, especially if there are
172 lots of them with a large number of destinations. So we factor
173 them to a common computed goto location before we build the
174 edge list. After we convert back to normal form, we will un-factor
175 the computed gotos since factoring introduces an unwanted jump. */
176 if (found_computed_goto)
177 factor_computed_gotos ();
179 /* Make sure there is always at least one block, even if it's empty. */
180 if (n_basic_blocks == NUM_FIXED_BLOCKS)
181 create_empty_bb (ENTRY_BLOCK_PTR);
183 /* Adjust the size of the array. */
184 if (VEC_length (basic_block, basic_block_info) < (size_t) n_basic_blocks)
185 VEC_safe_grow_cleared (basic_block, gc, basic_block_info, n_basic_blocks);
187 /* To speed up statement iterator walks, we first purge dead labels. */
188 cleanup_dead_labels ();
190 /* Group case nodes to reduce the number of edges.
191 We do this after cleaning up dead labels because otherwise we miss
192 a lot of obvious case merging opportunities. */
193 group_case_labels ();
195 /* Create the edges of the flowgraph. */
197 cleanup_dead_labels ();
199 /* Debugging dumps. */
201 /* Write the flowgraph to a VCG file. */
203 int local_dump_flags;
204 FILE *vcg_file = dump_begin (TDI_vcg, &local_dump_flags);
207 gimple_cfg2vcg (vcg_file);
208 dump_end (TDI_vcg, vcg_file);
212 #ifdef ENABLE_CHECKING
218 execute_build_cfg (void)
220 gimple_seq body = gimple_body (current_function_decl);
222 build_gimple_cfg (body);
223 gimple_set_body (current_function_decl, NULL);
224 if (dump_file && (dump_flags & TDF_DETAILS))
226 fprintf (dump_file, "Scope blocks:\n");
227 dump_scope_blocks (dump_file, dump_flags);
232 struct gimple_opt_pass pass_build_cfg =
238 execute_build_cfg, /* execute */
241 0, /* static_pass_number */
242 TV_TREE_CFG, /* tv_id */
243 PROP_gimple_leh, /* properties_required */
244 PROP_cfg, /* properties_provided */
245 0, /* properties_destroyed */
246 0, /* todo_flags_start */
247 TODO_verify_stmts | TODO_cleanup_cfg
248 | TODO_dump_func /* todo_flags_finish */
253 /* Return true if T is a computed goto. */
256 computed_goto_p (gimple t)
258 return (gimple_code (t) == GIMPLE_GOTO
259 && TREE_CODE (gimple_goto_dest (t)) != LABEL_DECL);
263 /* Search the CFG for any computed gotos. If found, factor them to a
264 common computed goto site. Also record the location of that site so
265 that we can un-factor the gotos after we have converted back to
269 factor_computed_gotos (void)
272 tree factored_label_decl = NULL;
274 gimple factored_computed_goto_label = NULL;
275 gimple factored_computed_goto = NULL;
277 /* We know there are one or more computed gotos in this function.
278 Examine the last statement in each basic block to see if the block
279 ends with a computed goto. */
283 gimple_stmt_iterator gsi = gsi_last_bb (bb);
289 last = gsi_stmt (gsi);
291 /* Ignore the computed goto we create when we factor the original
293 if (last == factored_computed_goto)
296 /* If the last statement is a computed goto, factor it. */
297 if (computed_goto_p (last))
301 /* The first time we find a computed goto we need to create
302 the factored goto block and the variable each original
303 computed goto will use for their goto destination. */
304 if (!factored_computed_goto)
306 basic_block new_bb = create_empty_bb (bb);
307 gimple_stmt_iterator new_gsi = gsi_start_bb (new_bb);
309 /* Create the destination of the factored goto. Each original
310 computed goto will put its desired destination into this
311 variable and jump to the label we create immediately
313 var = create_tmp_var (ptr_type_node, "gotovar");
315 /* Build a label for the new block which will contain the
316 factored computed goto. */
317 factored_label_decl = create_artificial_label ();
318 factored_computed_goto_label
319 = gimple_build_label (factored_label_decl);
320 gsi_insert_after (&new_gsi, factored_computed_goto_label,
323 /* Build our new computed goto. */
324 factored_computed_goto = gimple_build_goto (var);
325 gsi_insert_after (&new_gsi, factored_computed_goto, GSI_NEW_STMT);
328 /* Copy the original computed goto's destination into VAR. */
329 assignment = gimple_build_assign (var, gimple_goto_dest (last));
330 gsi_insert_before (&gsi, assignment, GSI_SAME_STMT);
332 /* And re-vector the computed goto to the new destination. */
333 gimple_goto_set_dest (last, factored_label_decl);
339 /* Build a flowgraph for the sequence of stmts SEQ. */
342 make_blocks (gimple_seq seq)
344 gimple_stmt_iterator i = gsi_start (seq);
346 bool start_new_block = true;
347 bool first_stmt_of_seq = true;
348 basic_block bb = ENTRY_BLOCK_PTR;
350 while (!gsi_end_p (i))
357 /* If the statement starts a new basic block or if we have determined
358 in a previous pass that we need to create a new block for STMT, do
360 if (start_new_block || stmt_starts_bb_p (stmt, prev_stmt))
362 if (!first_stmt_of_seq)
363 seq = gsi_split_seq_before (&i);
364 bb = create_basic_block (seq, NULL, bb);
365 start_new_block = false;
368 /* Now add STMT to BB and create the subgraphs for special statement
370 gimple_set_bb (stmt, bb);
372 if (computed_goto_p (stmt))
373 found_computed_goto = true;
375 /* If STMT is a basic block terminator, set START_NEW_BLOCK for the
377 if (stmt_ends_bb_p (stmt))
379 /* If the stmt can make abnormal goto use a new temporary
380 for the assignment to the LHS. This makes sure the old value
381 of the LHS is available on the abnormal edge. Otherwise
382 we will end up with overlapping life-ranges for abnormal
384 if (gimple_has_lhs (stmt)
385 && stmt_can_make_abnormal_goto (stmt)
386 && is_gimple_reg_type (TREE_TYPE (gimple_get_lhs (stmt))))
388 tree lhs = gimple_get_lhs (stmt);
389 tree tmp = create_tmp_var (TREE_TYPE (lhs), NULL);
390 gimple s = gimple_build_assign (lhs, tmp);
391 gimple_set_location (s, gimple_location (stmt));
392 gimple_set_block (s, gimple_block (stmt));
393 gimple_set_lhs (stmt, tmp);
394 if (TREE_CODE (TREE_TYPE (tmp)) == COMPLEX_TYPE
395 || TREE_CODE (TREE_TYPE (tmp)) == VECTOR_TYPE)
396 DECL_GIMPLE_REG_P (tmp) = 1;
397 gsi_insert_after (&i, s, GSI_SAME_STMT);
399 start_new_block = true;
403 first_stmt_of_seq = false;
408 /* Create and return a new empty basic block after bb AFTER. */
411 create_bb (void *h, void *e, basic_block after)
417 /* Create and initialize a new basic block. Since alloc_block uses
418 ggc_alloc_cleared to allocate a basic block, we do not have to
419 clear the newly allocated basic block here. */
422 bb->index = last_basic_block;
424 bb->il.gimple = GGC_CNEW (struct gimple_bb_info);
425 set_bb_seq (bb, h ? (gimple_seq) h : gimple_seq_alloc ());
427 /* Add the new block to the linked list of blocks. */
428 link_block (bb, after);
430 /* Grow the basic block array if needed. */
431 if ((size_t) last_basic_block == VEC_length (basic_block, basic_block_info))
433 size_t new_size = last_basic_block + (last_basic_block + 3) / 4;
434 VEC_safe_grow_cleared (basic_block, gc, basic_block_info, new_size);
437 /* Add the newly created block to the array. */
438 SET_BASIC_BLOCK (last_basic_block, bb);
447 /*---------------------------------------------------------------------------
449 ---------------------------------------------------------------------------*/
451 /* Fold COND_EXPR_COND of each COND_EXPR. */
454 fold_cond_expr_cond (void)
460 gimple stmt = last_stmt (bb);
462 if (stmt && gimple_code (stmt) == GIMPLE_COND)
467 fold_defer_overflow_warnings ();
468 cond = fold_binary (gimple_cond_code (stmt), boolean_type_node,
469 gimple_cond_lhs (stmt), gimple_cond_rhs (stmt));
472 zerop = integer_zerop (cond);
473 onep = integer_onep (cond);
476 zerop = onep = false;
478 fold_undefer_overflow_warnings (zerop || onep,
480 WARN_STRICT_OVERFLOW_CONDITIONAL);
482 gimple_cond_make_false (stmt);
484 gimple_cond_make_true (stmt);
489 /* Join all the blocks in the flowgraph. */
495 struct omp_region *cur_region = NULL;
497 /* Create an edge from entry to the first block with executable
499 make_edge (ENTRY_BLOCK_PTR, BASIC_BLOCK (NUM_FIXED_BLOCKS), EDGE_FALLTHRU);
501 /* Traverse the basic block array placing edges. */
504 gimple last = last_stmt (bb);
509 enum gimple_code code = gimple_code (last);
513 make_goto_expr_edges (bb);
517 make_edge (bb, EXIT_BLOCK_PTR, 0);
521 make_cond_expr_edges (bb);
525 make_gimple_switch_edges (bb);
529 make_eh_edges (last);
534 /* If this function receives a nonlocal goto, then we need to
535 make edges from this call site to all the nonlocal goto
537 if (stmt_can_make_abnormal_goto (last))
538 make_abnormal_goto_edges (bb, true);
540 /* If this statement has reachable exception handlers, then
541 create abnormal edges to them. */
542 make_eh_edges (last);
544 /* Some calls are known not to return. */
545 fallthru = !(gimple_call_flags (last) & ECF_NORETURN);
549 /* A GIMPLE_ASSIGN may throw internally and thus be considered
551 if (is_ctrl_altering_stmt (last))
553 make_eh_edges (last);
558 case GIMPLE_OMP_PARALLEL:
559 case GIMPLE_OMP_TASK:
561 case GIMPLE_OMP_SINGLE:
562 case GIMPLE_OMP_MASTER:
563 case GIMPLE_OMP_ORDERED:
564 case GIMPLE_OMP_CRITICAL:
565 case GIMPLE_OMP_SECTION:
566 cur_region = new_omp_region (bb, code, cur_region);
570 case GIMPLE_OMP_SECTIONS:
571 cur_region = new_omp_region (bb, code, cur_region);
575 case GIMPLE_OMP_SECTIONS_SWITCH:
580 case GIMPLE_OMP_ATOMIC_LOAD:
581 case GIMPLE_OMP_ATOMIC_STORE:
586 case GIMPLE_OMP_RETURN:
587 /* In the case of a GIMPLE_OMP_SECTION, the edge will go
588 somewhere other than the next block. This will be
590 cur_region->exit = bb;
591 fallthru = cur_region->type != GIMPLE_OMP_SECTION;
592 cur_region = cur_region->outer;
595 case GIMPLE_OMP_CONTINUE:
596 cur_region->cont = bb;
597 switch (cur_region->type)
600 /* Mark all GIMPLE_OMP_FOR and GIMPLE_OMP_CONTINUE
601 succs edges as abnormal to prevent splitting
603 single_succ_edge (cur_region->entry)->flags |= EDGE_ABNORMAL;
604 /* Make the loopback edge. */
605 make_edge (bb, single_succ (cur_region->entry),
608 /* Create an edge from GIMPLE_OMP_FOR to exit, which
609 corresponds to the case that the body of the loop
610 is not executed at all. */
611 make_edge (cur_region->entry, bb->next_bb, EDGE_ABNORMAL);
612 make_edge (bb, bb->next_bb, EDGE_FALLTHRU | EDGE_ABNORMAL);
616 case GIMPLE_OMP_SECTIONS:
617 /* Wire up the edges into and out of the nested sections. */
619 basic_block switch_bb = single_succ (cur_region->entry);
621 struct omp_region *i;
622 for (i = cur_region->inner; i ; i = i->next)
624 gcc_assert (i->type == GIMPLE_OMP_SECTION);
625 make_edge (switch_bb, i->entry, 0);
626 make_edge (i->exit, bb, EDGE_FALLTHRU);
629 /* Make the loopback edge to the block with
630 GIMPLE_OMP_SECTIONS_SWITCH. */
631 make_edge (bb, switch_bb, 0);
633 /* Make the edge from the switch to exit. */
634 make_edge (switch_bb, bb->next_bb, 0);
645 gcc_assert (!stmt_ends_bb_p (last));
653 make_edge (bb, bb->next_bb, EDGE_FALLTHRU);
659 /* Fold COND_EXPR_COND of each COND_EXPR. */
660 fold_cond_expr_cond ();
664 /* Create the edges for a GIMPLE_COND starting at block BB. */
667 make_cond_expr_edges (basic_block bb)
669 gimple entry = last_stmt (bb);
670 gimple then_stmt, else_stmt;
671 basic_block then_bb, else_bb;
672 tree then_label, else_label;
676 gcc_assert (gimple_code (entry) == GIMPLE_COND);
678 /* Entry basic blocks for each component. */
679 then_label = gimple_cond_true_label (entry);
680 else_label = gimple_cond_false_label (entry);
681 then_bb = label_to_block (then_label);
682 else_bb = label_to_block (else_label);
683 then_stmt = first_stmt (then_bb);
684 else_stmt = first_stmt (else_bb);
686 e = make_edge (bb, then_bb, EDGE_TRUE_VALUE);
687 e->goto_locus = gimple_location (then_stmt);
689 e->goto_block = gimple_block (then_stmt);
690 e = make_edge (bb, else_bb, EDGE_FALSE_VALUE);
693 e->goto_locus = gimple_location (else_stmt);
695 e->goto_block = gimple_block (else_stmt);
698 /* We do not need the labels anymore. */
699 gimple_cond_set_true_label (entry, NULL_TREE);
700 gimple_cond_set_false_label (entry, NULL_TREE);
704 /* Called for each element in the hash table (P) as we delete the
705 edge to cases hash table.
707 Clear all the TREE_CHAINs to prevent problems with copying of
708 SWITCH_EXPRs and structure sharing rules, then free the hash table
712 edge_to_cases_cleanup (const void *key ATTRIBUTE_UNUSED, void **value,
713 void *data ATTRIBUTE_UNUSED)
717 for (t = (tree) *value; t; t = next)
719 next = TREE_CHAIN (t);
720 TREE_CHAIN (t) = NULL;
727 /* Start recording information mapping edges to case labels. */
730 start_recording_case_labels (void)
732 gcc_assert (edge_to_cases == NULL);
733 edge_to_cases = pointer_map_create ();
736 /* Return nonzero if we are recording information for case labels. */
739 recording_case_labels_p (void)
741 return (edge_to_cases != NULL);
744 /* Stop recording information mapping edges to case labels and
745 remove any information we have recorded. */
747 end_recording_case_labels (void)
749 pointer_map_traverse (edge_to_cases, edge_to_cases_cleanup, NULL);
750 pointer_map_destroy (edge_to_cases);
751 edge_to_cases = NULL;
754 /* If we are inside a {start,end}_recording_cases block, then return
755 a chain of CASE_LABEL_EXPRs from T which reference E.
757 Otherwise return NULL. */
760 get_cases_for_edge (edge e, gimple t)
765 /* If we are not recording cases, then we do not have CASE_LABEL_EXPR
766 chains available. Return NULL so the caller can detect this case. */
767 if (!recording_case_labels_p ())
770 slot = pointer_map_contains (edge_to_cases, e);
774 /* If we did not find E in the hash table, then this must be the first
775 time we have been queried for information about E & T. Add all the
776 elements from T to the hash table then perform the query again. */
778 n = gimple_switch_num_labels (t);
779 for (i = 0; i < n; i++)
781 tree elt = gimple_switch_label (t, i);
782 tree lab = CASE_LABEL (elt);
783 basic_block label_bb = label_to_block (lab);
784 edge this_edge = find_edge (e->src, label_bb);
786 /* Add it to the chain of CASE_LABEL_EXPRs referencing E, or create
788 slot = pointer_map_insert (edge_to_cases, this_edge);
789 TREE_CHAIN (elt) = (tree) *slot;
793 return (tree) *pointer_map_contains (edge_to_cases, e);
796 /* Create the edges for a GIMPLE_SWITCH starting at block BB. */
799 make_gimple_switch_edges (basic_block bb)
801 gimple entry = last_stmt (bb);
804 n = gimple_switch_num_labels (entry);
806 for (i = 0; i < n; ++i)
808 tree lab = CASE_LABEL (gimple_switch_label (entry, i));
809 basic_block label_bb = label_to_block (lab);
810 make_edge (bb, label_bb, 0);
815 /* Return the basic block holding label DEST. */
818 label_to_block_fn (struct function *ifun, tree dest)
820 int uid = LABEL_DECL_UID (dest);
822 /* We would die hard when faced by an undefined label. Emit a label to
823 the very first basic block. This will hopefully make even the dataflow
824 and undefined variable warnings quite right. */
825 if ((errorcount || sorrycount) && uid < 0)
827 gimple_stmt_iterator gsi = gsi_start_bb (BASIC_BLOCK (NUM_FIXED_BLOCKS));
830 stmt = gimple_build_label (dest);
831 gsi_insert_before (&gsi, stmt, GSI_NEW_STMT);
832 uid = LABEL_DECL_UID (dest);
834 if (VEC_length (basic_block, ifun->cfg->x_label_to_block_map)
835 <= (unsigned int) uid)
837 return VEC_index (basic_block, ifun->cfg->x_label_to_block_map, uid);
840 /* Create edges for an abnormal goto statement at block BB. If FOR_CALL
841 is true, the source statement is a CALL_EXPR instead of a GOTO_EXPR. */
844 make_abnormal_goto_edges (basic_block bb, bool for_call)
846 basic_block target_bb;
847 gimple_stmt_iterator gsi;
849 FOR_EACH_BB (target_bb)
850 for (gsi = gsi_start_bb (target_bb); !gsi_end_p (gsi); gsi_next (&gsi))
852 gimple label_stmt = gsi_stmt (gsi);
855 if (gimple_code (label_stmt) != GIMPLE_LABEL)
858 target = gimple_label_label (label_stmt);
860 /* Make an edge to every label block that has been marked as a
861 potential target for a computed goto or a non-local goto. */
862 if ((FORCED_LABEL (target) && !for_call)
863 || (DECL_NONLOCAL (target) && for_call))
865 make_edge (bb, target_bb, EDGE_ABNORMAL);
871 /* Create edges for a goto statement at block BB. */
874 make_goto_expr_edges (basic_block bb)
876 gimple_stmt_iterator last = gsi_last_bb (bb);
877 gimple goto_t = gsi_stmt (last);
879 /* A simple GOTO creates normal edges. */
880 if (simple_goto_p (goto_t))
882 tree dest = gimple_goto_dest (goto_t);
883 edge e = make_edge (bb, label_to_block (dest), EDGE_FALLTHRU);
884 e->goto_locus = gimple_location (goto_t);
886 e->goto_block = gimple_block (goto_t);
887 gsi_remove (&last, true);
891 /* A computed GOTO creates abnormal edges. */
892 make_abnormal_goto_edges (bb, false);
896 /*---------------------------------------------------------------------------
898 ---------------------------------------------------------------------------*/
900 /* Cleanup useless labels in basic blocks. This is something we wish
901 to do early because it allows us to group case labels before creating
902 the edges for the CFG, and it speeds up block statement iterators in
904 We rerun this pass after CFG is created, to get rid of the labels that
905 are no longer referenced. After then we do not run it any more, since
906 (almost) no new labels should be created. */
908 /* A map from basic block index to the leading label of that block. */
909 static struct label_record
914 /* True if the label is referenced from somewhere. */
918 /* Callback for for_each_eh_region. Helper for cleanup_dead_labels. */
920 update_eh_label (struct eh_region *region)
922 tree old_label = get_eh_region_tree_label (region);
926 basic_block bb = label_to_block (old_label);
928 /* ??? After optimizing, there may be EH regions with labels
929 that have already been removed from the function body, so
930 there is no basic block for them. */
934 new_label = label_for_bb[bb->index].label;
935 label_for_bb[bb->index].used = true;
936 set_eh_region_tree_label (region, new_label);
941 /* Given LABEL return the first label in the same basic block. */
944 main_block_label (tree label)
946 basic_block bb = label_to_block (label);
947 tree main_label = label_for_bb[bb->index].label;
949 /* label_to_block possibly inserted undefined label into the chain. */
952 label_for_bb[bb->index].label = label;
956 label_for_bb[bb->index].used = true;
960 /* Cleanup redundant labels. This is a three-step process:
961 1) Find the leading label for each block.
962 2) Redirect all references to labels to the leading labels.
963 3) Cleanup all useless labels. */
966 cleanup_dead_labels (void)
969 label_for_bb = XCNEWVEC (struct label_record, last_basic_block);
971 /* Find a suitable label for each block. We use the first user-defined
972 label if there is one, or otherwise just the first label we see. */
975 gimple_stmt_iterator i;
977 for (i = gsi_start_bb (bb); !gsi_end_p (i); gsi_next (&i))
980 gimple stmt = gsi_stmt (i);
982 if (gimple_code (stmt) != GIMPLE_LABEL)
985 label = gimple_label_label (stmt);
987 /* If we have not yet seen a label for the current block,
988 remember this one and see if there are more labels. */
989 if (!label_for_bb[bb->index].label)
991 label_for_bb[bb->index].label = label;
995 /* If we did see a label for the current block already, but it
996 is an artificially created label, replace it if the current
997 label is a user defined label. */
998 if (!DECL_ARTIFICIAL (label)
999 && DECL_ARTIFICIAL (label_for_bb[bb->index].label))
1001 label_for_bb[bb->index].label = label;
1007 /* Now redirect all jumps/branches to the selected label.
1008 First do so for each block ending in a control statement. */
1011 gimple stmt = last_stmt (bb);
1015 switch (gimple_code (stmt))
1019 tree true_label = gimple_cond_true_label (stmt);
1020 tree false_label = gimple_cond_false_label (stmt);
1023 gimple_cond_set_true_label (stmt, main_block_label (true_label));
1025 gimple_cond_set_false_label (stmt, main_block_label (false_label));
1031 size_t i, n = gimple_switch_num_labels (stmt);
1033 /* Replace all destination labels. */
1034 for (i = 0; i < n; ++i)
1036 tree case_label = gimple_switch_label (stmt, i);
1037 tree label = main_block_label (CASE_LABEL (case_label));
1038 CASE_LABEL (case_label) = label;
1043 /* We have to handle gotos until they're removed, and we don't
1044 remove them until after we've created the CFG edges. */
1046 if (!computed_goto_p (stmt))
1048 tree new_dest = main_block_label (gimple_goto_dest (stmt));
1049 gimple_goto_set_dest (stmt, new_dest);
1058 for_each_eh_region (update_eh_label);
1060 /* Finally, purge dead labels. All user-defined labels and labels that
1061 can be the target of non-local gotos and labels which have their
1062 address taken are preserved. */
1065 gimple_stmt_iterator i;
1066 tree label_for_this_bb = label_for_bb[bb->index].label;
1068 if (!label_for_this_bb)
1071 /* If the main label of the block is unused, we may still remove it. */
1072 if (!label_for_bb[bb->index].used)
1073 label_for_this_bb = NULL;
1075 for (i = gsi_start_bb (bb); !gsi_end_p (i); )
1078 gimple stmt = gsi_stmt (i);
1080 if (gimple_code (stmt) != GIMPLE_LABEL)
1083 label = gimple_label_label (stmt);
1085 if (label == label_for_this_bb
1086 || !DECL_ARTIFICIAL (label)
1087 || DECL_NONLOCAL (label)
1088 || FORCED_LABEL (label))
1091 gsi_remove (&i, true);
1095 free (label_for_bb);
1098 /* Look for blocks ending in a multiway branch (a SWITCH_EXPR in GIMPLE),
1099 and scan the sorted vector of cases. Combine the ones jumping to the
1101 Eg. three separate entries 1: 2: 3: become one entry 1..3: */
1104 group_case_labels (void)
1110 gimple stmt = last_stmt (bb);
1111 if (stmt && gimple_code (stmt) == GIMPLE_SWITCH)
1113 int old_size = gimple_switch_num_labels (stmt);
1114 int i, j, new_size = old_size;
1115 tree default_case = NULL_TREE;
1116 tree default_label = NULL_TREE;
1119 /* The default label is always the first case in a switch
1120 statement after gimplification if it was not optimized
1122 if (!CASE_LOW (gimple_switch_default_label (stmt))
1123 && !CASE_HIGH (gimple_switch_default_label (stmt)))
1125 default_case = gimple_switch_default_label (stmt);
1126 default_label = CASE_LABEL (default_case);
1130 has_default = false;
1132 /* Look for possible opportunities to merge cases. */
1137 while (i < old_size)
1139 tree base_case, base_label, base_high;
1140 base_case = gimple_switch_label (stmt, i);
1142 gcc_assert (base_case);
1143 base_label = CASE_LABEL (base_case);
1145 /* Discard cases that have the same destination as the
1147 if (base_label == default_label)
1149 gimple_switch_set_label (stmt, i, NULL_TREE);
1155 base_high = CASE_HIGH (base_case)
1156 ? CASE_HIGH (base_case)
1157 : CASE_LOW (base_case);
1160 /* Try to merge case labels. Break out when we reach the end
1161 of the label vector or when we cannot merge the next case
1162 label with the current one. */
1163 while (i < old_size)
1165 tree merge_case = gimple_switch_label (stmt, i);
1166 tree merge_label = CASE_LABEL (merge_case);
1167 tree t = int_const_binop (PLUS_EXPR, base_high,
1168 integer_one_node, 1);
1170 /* Merge the cases if they jump to the same place,
1171 and their ranges are consecutive. */
1172 if (merge_label == base_label
1173 && tree_int_cst_equal (CASE_LOW (merge_case), t))
1175 base_high = CASE_HIGH (merge_case) ?
1176 CASE_HIGH (merge_case) : CASE_LOW (merge_case);
1177 CASE_HIGH (base_case) = base_high;
1178 gimple_switch_set_label (stmt, i, NULL_TREE);
1187 /* Compress the case labels in the label vector, and adjust the
1188 length of the vector. */
1189 for (i = 0, j = 0; i < new_size; i++)
1191 while (! gimple_switch_label (stmt, j))
1193 gimple_switch_set_label (stmt, i,
1194 gimple_switch_label (stmt, j++));
1197 gcc_assert (new_size <= old_size);
1198 gimple_switch_set_num_labels (stmt, new_size);
1203 /* Checks whether we can merge block B into block A. */
1206 gimple_can_merge_blocks_p (basic_block a, basic_block b)
1209 gimple_stmt_iterator gsi;
1212 if (!single_succ_p (a))
1215 if (single_succ_edge (a)->flags & (EDGE_ABNORMAL | EDGE_EH))
1218 if (single_succ (a) != b)
1221 if (!single_pred_p (b))
1224 if (b == EXIT_BLOCK_PTR)
1227 /* If A ends by a statement causing exceptions or something similar, we
1228 cannot merge the blocks. */
1229 stmt = last_stmt (a);
1230 if (stmt && stmt_ends_bb_p (stmt))
1233 /* Do not allow a block with only a non-local label to be merged. */
1235 && gimple_code (stmt) == GIMPLE_LABEL
1236 && DECL_NONLOCAL (gimple_label_label (stmt)))
1239 /* It must be possible to eliminate all phi nodes in B. If ssa form
1240 is not up-to-date, we cannot eliminate any phis; however, if only
1241 some symbols as whole are marked for renaming, this is not a problem,
1242 as phi nodes for those symbols are irrelevant in updating anyway. */
1243 phis = phi_nodes (b);
1244 if (!gimple_seq_empty_p (phis))
1246 gimple_stmt_iterator i;
1248 if (name_mappings_registered_p ())
1251 for (i = gsi_start (phis); !gsi_end_p (i); gsi_next (&i))
1253 gimple phi = gsi_stmt (i);
1255 if (!is_gimple_reg (gimple_phi_result (phi))
1256 && !may_propagate_copy (gimple_phi_result (phi),
1257 gimple_phi_arg_def (phi, 0)))
1262 /* Do not remove user labels. */
1263 for (gsi = gsi_start_bb (b); !gsi_end_p (gsi); gsi_next (&gsi))
1265 stmt = gsi_stmt (gsi);
1266 if (gimple_code (stmt) != GIMPLE_LABEL)
1268 if (!DECL_ARTIFICIAL (gimple_label_label (stmt)))
1272 /* Protect the loop latches. */
1274 && b->loop_father->latch == b)
1280 /* Replaces all uses of NAME by VAL. */
1283 replace_uses_by (tree name, tree val)
1285 imm_use_iterator imm_iter;
1290 FOR_EACH_IMM_USE_STMT (stmt, imm_iter, name)
1292 if (gimple_code (stmt) != GIMPLE_PHI)
1293 push_stmt_changes (&stmt);
1295 FOR_EACH_IMM_USE_ON_STMT (use, imm_iter)
1297 replace_exp (use, val);
1299 if (gimple_code (stmt) == GIMPLE_PHI)
1301 e = gimple_phi_arg_edge (stmt, PHI_ARG_INDEX_FROM_USE (use));
1302 if (e->flags & EDGE_ABNORMAL)
1304 /* This can only occur for virtual operands, since
1305 for the real ones SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name))
1306 would prevent replacement. */
1307 gcc_assert (!is_gimple_reg (name));
1308 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (val) = 1;
1313 if (gimple_code (stmt) != GIMPLE_PHI)
1317 fold_stmt_inplace (stmt);
1318 if (cfgcleanup_altered_bbs)
1319 bitmap_set_bit (cfgcleanup_altered_bbs, gimple_bb (stmt)->index);
1321 /* FIXME. This should go in pop_stmt_changes. */
1322 for (i = 0; i < gimple_num_ops (stmt); i++)
1324 tree op = gimple_op (stmt, i);
1325 /* Operands may be empty here. For example, the labels
1326 of a GIMPLE_COND are nulled out following the creation
1327 of the corresponding CFG edges. */
1328 if (op && TREE_CODE (op) == ADDR_EXPR)
1329 recompute_tree_invariant_for_addr_expr (op);
1332 maybe_clean_or_replace_eh_stmt (stmt, stmt);
1334 pop_stmt_changes (&stmt);
1338 gcc_assert (has_zero_uses (name));
1340 /* Also update the trees stored in loop structures. */
1346 FOR_EACH_LOOP (li, loop, 0)
1348 substitute_in_loop_info (loop, name, val);
1353 /* Merge block B into block A. */
1356 gimple_merge_blocks (basic_block a, basic_block b)
1358 gimple_stmt_iterator last, gsi, psi;
1359 gimple_seq phis = phi_nodes (b);
1362 fprintf (dump_file, "Merging blocks %d and %d\n", a->index, b->index);
1364 /* Remove all single-valued PHI nodes from block B of the form
1365 V_i = PHI <V_j> by propagating V_j to all the uses of V_i. */
1366 gsi = gsi_last_bb (a);
1367 for (psi = gsi_start (phis); !gsi_end_p (psi); )
1369 gimple phi = gsi_stmt (psi);
1370 tree def = gimple_phi_result (phi), use = gimple_phi_arg_def (phi, 0);
1372 bool may_replace_uses = !is_gimple_reg (def)
1373 || may_propagate_copy (def, use);
1375 /* In case we maintain loop closed ssa form, do not propagate arguments
1376 of loop exit phi nodes. */
1378 && loops_state_satisfies_p (LOOP_CLOSED_SSA)
1379 && is_gimple_reg (def)
1380 && TREE_CODE (use) == SSA_NAME
1381 && a->loop_father != b->loop_father)
1382 may_replace_uses = false;
1384 if (!may_replace_uses)
1386 gcc_assert (is_gimple_reg (def));
1388 /* Note that just emitting the copies is fine -- there is no problem
1389 with ordering of phi nodes. This is because A is the single
1390 predecessor of B, therefore results of the phi nodes cannot
1391 appear as arguments of the phi nodes. */
1392 copy = gimple_build_assign (def, use);
1393 gsi_insert_after (&gsi, copy, GSI_NEW_STMT);
1394 remove_phi_node (&psi, false);
1398 /* If we deal with a PHI for virtual operands, we can simply
1399 propagate these without fussing with folding or updating
1401 if (!is_gimple_reg (def))
1403 imm_use_iterator iter;
1404 use_operand_p use_p;
1407 FOR_EACH_IMM_USE_STMT (stmt, iter, def)
1408 FOR_EACH_IMM_USE_ON_STMT (use_p, iter)
1409 SET_USE (use_p, use);
1412 replace_uses_by (def, use);
1414 remove_phi_node (&psi, true);
1418 /* Ensure that B follows A. */
1419 move_block_after (b, a);
1421 gcc_assert (single_succ_edge (a)->flags & EDGE_FALLTHRU);
1422 gcc_assert (!last_stmt (a) || !stmt_ends_bb_p (last_stmt (a)));
1424 /* Remove labels from B and set gimple_bb to A for other statements. */
1425 for (gsi = gsi_start_bb (b); !gsi_end_p (gsi);)
1427 if (gimple_code (gsi_stmt (gsi)) == GIMPLE_LABEL)
1429 gimple label = gsi_stmt (gsi);
1431 gsi_remove (&gsi, false);
1433 /* Now that we can thread computed gotos, we might have
1434 a situation where we have a forced label in block B
1435 However, the label at the start of block B might still be
1436 used in other ways (think about the runtime checking for
1437 Fortran assigned gotos). So we can not just delete the
1438 label. Instead we move the label to the start of block A. */
1439 if (FORCED_LABEL (gimple_label_label (label)))
1441 gimple_stmt_iterator dest_gsi = gsi_start_bb (a);
1442 gsi_insert_before (&dest_gsi, label, GSI_NEW_STMT);
1447 gimple_set_bb (gsi_stmt (gsi), a);
1452 /* Merge the sequences. */
1453 last = gsi_last_bb (a);
1454 gsi_insert_seq_after (&last, bb_seq (b), GSI_NEW_STMT);
1455 set_bb_seq (b, NULL);
1457 if (cfgcleanup_altered_bbs)
1458 bitmap_set_bit (cfgcleanup_altered_bbs, a->index);
1462 /* Return the one of two successors of BB that is not reachable by a
1463 reached by a complex edge, if there is one. Else, return BB. We use
1464 this in optimizations that use post-dominators for their heuristics,
1465 to catch the cases in C++ where function calls are involved. */
1468 single_noncomplex_succ (basic_block bb)
1471 if (EDGE_COUNT (bb->succs) != 2)
1474 e0 = EDGE_SUCC (bb, 0);
1475 e1 = EDGE_SUCC (bb, 1);
1476 if (e0->flags & EDGE_COMPLEX)
1478 if (e1->flags & EDGE_COMPLEX)
1485 /* Walk the function tree removing unnecessary statements.
1487 * Empty statement nodes are removed
1489 * Unnecessary TRY_FINALLY and TRY_CATCH blocks are removed
1491 * Unnecessary COND_EXPRs are removed
1493 * Some unnecessary BIND_EXPRs are removed
1495 * GOTO_EXPRs immediately preceding destination are removed.
1497 Clearly more work could be done. The trick is doing the analysis
1498 and removal fast enough to be a net improvement in compile times.
1500 Note that when we remove a control structure such as a COND_EXPR
1501 BIND_EXPR, or TRY block, we will need to repeat this optimization pass
1502 to ensure we eliminate all the useless code. */
1511 gimple_stmt_iterator last_goto_gsi;
1515 static void remove_useless_stmts_1 (gimple_stmt_iterator *gsi, struct rus_data *);
1517 /* Given a statement sequence, find the first executable statement with
1518 location information, and warn that it is unreachable. When searching,
1519 descend into containers in execution order. */
1522 remove_useless_stmts_warn_notreached (gimple_seq stmts)
1524 gimple_stmt_iterator gsi;
1526 for (gsi = gsi_start (stmts); !gsi_end_p (gsi); gsi_next (&gsi))
1528 gimple stmt = gsi_stmt (gsi);
1530 if (gimple_has_location (stmt))
1532 location_t loc = gimple_location (stmt);
1533 if (LOCATION_LINE (loc) > 0)
1535 warning (OPT_Wunreachable_code, "%Hwill never be executed", &loc);
1540 switch (gimple_code (stmt))
1542 /* Unfortunately, we need the CFG now to detect unreachable
1543 branches in a conditional, so conditionals are not handled here. */
1546 if (remove_useless_stmts_warn_notreached (gimple_try_eval (stmt)))
1548 if (remove_useless_stmts_warn_notreached (gimple_try_cleanup (stmt)))
1553 return remove_useless_stmts_warn_notreached (gimple_catch_handler (stmt));
1555 case GIMPLE_EH_FILTER:
1556 return remove_useless_stmts_warn_notreached (gimple_eh_filter_failure (stmt));
1559 return remove_useless_stmts_warn_notreached (gimple_bind_body (stmt));
1569 /* Helper for remove_useless_stmts_1. Handle GIMPLE_COND statements. */
1572 remove_useless_stmts_cond (gimple_stmt_iterator *gsi, struct rus_data *data)
1574 gimple stmt = gsi_stmt (*gsi);
1576 /* The folded result must still be a conditional statement. */
1578 gcc_assert (gsi_stmt (*gsi) == stmt);
1580 data->may_branch = true;
1582 /* Replace trivial conditionals with gotos. */
1583 if (gimple_cond_true_p (stmt))
1585 /* Goto THEN label. */
1586 tree then_label = gimple_cond_true_label (stmt);
1588 gsi_replace (gsi, gimple_build_goto (then_label), false);
1589 data->last_goto_gsi = *gsi;
1590 data->last_was_goto = true;
1591 data->repeat = true;
1593 else if (gimple_cond_false_p (stmt))
1595 /* Goto ELSE label. */
1596 tree else_label = gimple_cond_false_label (stmt);
1598 gsi_replace (gsi, gimple_build_goto (else_label), false);
1599 data->last_goto_gsi = *gsi;
1600 data->last_was_goto = true;
1601 data->repeat = true;
1605 tree then_label = gimple_cond_true_label (stmt);
1606 tree else_label = gimple_cond_false_label (stmt);
1608 if (then_label == else_label)
1610 /* Goto common destination. */
1611 gsi_replace (gsi, gimple_build_goto (then_label), false);
1612 data->last_goto_gsi = *gsi;
1613 data->last_was_goto = true;
1614 data->repeat = true;
1620 data->last_was_goto = false;
1623 /* Helper for remove_useless_stmts_1.
1624 Handle the try-finally case for GIMPLE_TRY statements. */
1627 remove_useless_stmts_tf (gimple_stmt_iterator *gsi, struct rus_data *data)
1629 bool save_may_branch, save_may_throw;
1630 bool this_may_branch, this_may_throw;
1632 gimple_seq eval_seq, cleanup_seq;
1633 gimple_stmt_iterator eval_gsi, cleanup_gsi;
1635 gimple stmt = gsi_stmt (*gsi);
1637 /* Collect may_branch and may_throw information for the body only. */
1638 save_may_branch = data->may_branch;
1639 save_may_throw = data->may_throw;
1640 data->may_branch = false;
1641 data->may_throw = false;
1642 data->last_was_goto = false;
1644 eval_seq = gimple_try_eval (stmt);
1645 eval_gsi = gsi_start (eval_seq);
1646 remove_useless_stmts_1 (&eval_gsi, data);
1648 this_may_branch = data->may_branch;
1649 this_may_throw = data->may_throw;
1650 data->may_branch |= save_may_branch;
1651 data->may_throw |= save_may_throw;
1652 data->last_was_goto = false;
1654 cleanup_seq = gimple_try_cleanup (stmt);
1655 cleanup_gsi = gsi_start (cleanup_seq);
1656 remove_useless_stmts_1 (&cleanup_gsi, data);
1658 /* If the body is empty, then we can emit the FINALLY block without
1659 the enclosing TRY_FINALLY_EXPR. */
1660 if (gimple_seq_empty_p (eval_seq))
1662 gsi_insert_seq_before (gsi, cleanup_seq, GSI_SAME_STMT);
1663 gsi_remove (gsi, false);
1664 data->repeat = true;
1667 /* If the handler is empty, then we can emit the TRY block without
1668 the enclosing TRY_FINALLY_EXPR. */
1669 else if (gimple_seq_empty_p (cleanup_seq))
1671 gsi_insert_seq_before (gsi, eval_seq, GSI_SAME_STMT);
1672 gsi_remove (gsi, false);
1673 data->repeat = true;
1676 /* If the body neither throws, nor branches, then we can safely
1677 string the TRY and FINALLY blocks together. */
1678 else if (!this_may_branch && !this_may_throw)
1680 gsi_insert_seq_before (gsi, eval_seq, GSI_SAME_STMT);
1681 gsi_insert_seq_before (gsi, cleanup_seq, GSI_SAME_STMT);
1682 gsi_remove (gsi, false);
1683 data->repeat = true;
1689 /* Helper for remove_useless_stmts_1.
1690 Handle the try-catch case for GIMPLE_TRY statements. */
1693 remove_useless_stmts_tc (gimple_stmt_iterator *gsi, struct rus_data *data)
1695 bool save_may_throw, this_may_throw;
1697 gimple_seq eval_seq, cleanup_seq, handler_seq, failure_seq;
1698 gimple_stmt_iterator eval_gsi, cleanup_gsi, handler_gsi, failure_gsi;
1700 gimple stmt = gsi_stmt (*gsi);
1702 /* Collect may_throw information for the body only. */
1703 save_may_throw = data->may_throw;
1704 data->may_throw = false;
1705 data->last_was_goto = false;
1707 eval_seq = gimple_try_eval (stmt);
1708 eval_gsi = gsi_start (eval_seq);
1709 remove_useless_stmts_1 (&eval_gsi, data);
1711 this_may_throw = data->may_throw;
1712 data->may_throw = save_may_throw;
1714 cleanup_seq = gimple_try_cleanup (stmt);
1716 /* If the body cannot throw, then we can drop the entire TRY_CATCH_EXPR. */
1717 if (!this_may_throw)
1719 if (warn_notreached)
1721 remove_useless_stmts_warn_notreached (cleanup_seq);
1723 gsi_insert_seq_before (gsi, eval_seq, GSI_SAME_STMT);
1724 gsi_remove (gsi, false);
1725 data->repeat = true;
1729 /* Process the catch clause specially. We may be able to tell that
1730 no exceptions propagate past this point. */
1732 this_may_throw = true;
1733 cleanup_gsi = gsi_start (cleanup_seq);
1734 stmt = gsi_stmt (cleanup_gsi);
1735 data->last_was_goto = false;
1737 switch (gimple_code (stmt))
1740 /* If the first element is a catch, they all must be. */
1741 while (!gsi_end_p (cleanup_gsi))
1743 stmt = gsi_stmt (cleanup_gsi);
1744 /* If we catch all exceptions, then the body does not
1745 propagate exceptions past this point. */
1746 if (gimple_catch_types (stmt) == NULL)
1747 this_may_throw = false;
1748 data->last_was_goto = false;
1749 handler_seq = gimple_catch_handler (stmt);
1750 handler_gsi = gsi_start (handler_seq);
1751 remove_useless_stmts_1 (&handler_gsi, data);
1752 gsi_next (&cleanup_gsi);
1757 case GIMPLE_EH_FILTER:
1758 /* If the first element is an eh_filter, it should stand alone. */
1759 if (gimple_eh_filter_must_not_throw (stmt))
1760 this_may_throw = false;
1761 else if (gimple_eh_filter_types (stmt) == NULL)
1762 this_may_throw = false;
1763 failure_seq = gimple_eh_filter_failure (stmt);
1764 failure_gsi = gsi_start (failure_seq);
1765 remove_useless_stmts_1 (&failure_gsi, data);
1770 /* Otherwise this is a list of cleanup statements. */
1771 remove_useless_stmts_1 (&cleanup_gsi, data);
1773 /* If the cleanup is empty, then we can emit the TRY block without
1774 the enclosing TRY_CATCH_EXPR. */
1775 if (gimple_seq_empty_p (cleanup_seq))
1777 gsi_insert_seq_before (gsi, eval_seq, GSI_SAME_STMT);
1778 gsi_remove(gsi, false);
1779 data->repeat = true;
1786 data->may_throw |= this_may_throw;
1789 /* Helper for remove_useless_stmts_1. Handle GIMPLE_BIND statements. */
1792 remove_useless_stmts_bind (gimple_stmt_iterator *gsi, struct rus_data *data ATTRIBUTE_UNUSED)
1795 gimple_seq body_seq, fn_body_seq;
1796 gimple_stmt_iterator body_gsi;
1798 gimple stmt = gsi_stmt (*gsi);
1800 /* First remove anything underneath the BIND_EXPR. */
1802 body_seq = gimple_bind_body (stmt);
1803 body_gsi = gsi_start (body_seq);
1804 remove_useless_stmts_1 (&body_gsi, data);
1806 /* If the GIMPLE_BIND has no variables, then we can pull everything
1807 up one level and remove the GIMPLE_BIND, unless this is the toplevel
1808 GIMPLE_BIND for the current function or an inlined function.
1810 When this situation occurs we will want to apply this
1811 optimization again. */
1812 block = gimple_bind_block (stmt);
1813 fn_body_seq = gimple_body (current_function_decl);
1814 if (gimple_bind_vars (stmt) == NULL_TREE
1815 && (gimple_seq_empty_p (fn_body_seq)
1816 || stmt != gimple_seq_first_stmt (fn_body_seq))
1818 || ! BLOCK_ABSTRACT_ORIGIN (block)
1819 || (TREE_CODE (BLOCK_ABSTRACT_ORIGIN (block))
1822 tree var = NULL_TREE;
1823 /* Even if there are no gimple_bind_vars, there might be other
1824 decls in BLOCK_VARS rendering the GIMPLE_BIND not useless. */
1825 if (block && !BLOCK_NUM_NONLOCALIZED_VARS (block))
1826 for (var = BLOCK_VARS (block); var; var = TREE_CHAIN (var))
1827 if (TREE_CODE (var) == IMPORTED_DECL)
1829 if (var || (block && BLOCK_NUM_NONLOCALIZED_VARS (block)))
1833 gsi_insert_seq_before (gsi, body_seq, GSI_SAME_STMT);
1834 gsi_remove (gsi, false);
1835 data->repeat = true;
1842 /* Helper for remove_useless_stmts_1. Handle GIMPLE_GOTO statements. */
1845 remove_useless_stmts_goto (gimple_stmt_iterator *gsi, struct rus_data *data)
1847 gimple stmt = gsi_stmt (*gsi);
1849 tree dest = gimple_goto_dest (stmt);
1851 data->may_branch = true;
1852 data->last_was_goto = false;
1854 /* Record iterator for last goto expr, so that we can delete it if unnecessary. */
1855 if (TREE_CODE (dest) == LABEL_DECL)
1857 data->last_goto_gsi = *gsi;
1858 data->last_was_goto = true;
1864 /* Helper for remove_useless_stmts_1. Handle GIMPLE_LABEL statements. */
1867 remove_useless_stmts_label (gimple_stmt_iterator *gsi, struct rus_data *data)
1869 gimple stmt = gsi_stmt (*gsi);
1871 tree label = gimple_label_label (stmt);
1873 data->has_label = true;
1875 /* We do want to jump across non-local label receiver code. */
1876 if (DECL_NONLOCAL (label))
1877 data->last_was_goto = false;
1879 else if (data->last_was_goto
1880 && gimple_goto_dest (gsi_stmt (data->last_goto_gsi)) == label)
1882 /* Replace the preceding GIMPLE_GOTO statement with
1883 a GIMPLE_NOP, which will be subsequently removed.
1884 In this way, we avoid invalidating other iterators
1885 active on the statement sequence. */
1886 gsi_replace(&data->last_goto_gsi, gimple_build_nop(), false);
1887 data->last_was_goto = false;
1888 data->repeat = true;
1891 /* ??? Add something here to delete unused labels. */
1897 /* T is CALL_EXPR. Set current_function_calls_* flags. */
1900 notice_special_calls (gimple call)
1902 int flags = gimple_call_flags (call);
1904 if (flags & ECF_MAY_BE_ALLOCA)
1905 cfun->calls_alloca = true;
1906 if (flags & ECF_RETURNS_TWICE)
1907 cfun->calls_setjmp = true;
1911 /* Clear flags set by notice_special_calls. Used by dead code removal
1912 to update the flags. */
1915 clear_special_calls (void)
1917 cfun->calls_alloca = false;
1918 cfun->calls_setjmp = false;
1921 /* Remove useless statements from a statement sequence, and perform
1922 some preliminary simplifications. */
1925 remove_useless_stmts_1 (gimple_stmt_iterator *gsi, struct rus_data *data)
1927 while (!gsi_end_p (*gsi))
1929 gimple stmt = gsi_stmt (*gsi);
1931 switch (gimple_code (stmt))
1934 remove_useless_stmts_cond (gsi, data);
1938 remove_useless_stmts_goto (gsi, data);
1942 remove_useless_stmts_label (gsi, data);
1947 stmt = gsi_stmt (*gsi);
1948 data->last_was_goto = false;
1949 if (stmt_could_throw_p (stmt))
1950 data->may_throw = true;
1956 data->last_was_goto = false;
1962 stmt = gsi_stmt (*gsi);
1963 data->last_was_goto = false;
1964 if (is_gimple_call (stmt))
1965 notice_special_calls (stmt);
1967 /* We used to call update_gimple_call_flags here,
1968 which copied side-effects and nothrows status
1969 from the function decl to the call. In the new
1970 tuplified GIMPLE, the accessors for this information
1971 always consult the function decl, so this copying
1972 is no longer necessary. */
1973 if (stmt_could_throw_p (stmt))
1974 data->may_throw = true;
1980 data->last_was_goto = false;
1981 data->may_branch = true;
1986 remove_useless_stmts_bind (gsi, data);
1990 if (gimple_try_kind (stmt) == GIMPLE_TRY_CATCH)
1991 remove_useless_stmts_tc (gsi, data);
1992 else if (gimple_try_kind (stmt) == GIMPLE_TRY_FINALLY)
1993 remove_useless_stmts_tf (gsi, data);
2003 gsi_remove (gsi, false);
2006 case GIMPLE_OMP_FOR:
2008 gimple_seq pre_body_seq = gimple_omp_for_pre_body (stmt);
2009 gimple_stmt_iterator pre_body_gsi = gsi_start (pre_body_seq);
2011 remove_useless_stmts_1 (&pre_body_gsi, data);
2012 data->last_was_goto = false;
2015 case GIMPLE_OMP_CRITICAL:
2016 case GIMPLE_OMP_CONTINUE:
2017 case GIMPLE_OMP_MASTER:
2018 case GIMPLE_OMP_ORDERED:
2019 case GIMPLE_OMP_SECTION:
2020 case GIMPLE_OMP_SECTIONS:
2021 case GIMPLE_OMP_SINGLE:
2023 gimple_seq body_seq = gimple_omp_body (stmt);
2024 gimple_stmt_iterator body_gsi = gsi_start (body_seq);
2026 remove_useless_stmts_1 (&body_gsi, data);
2027 data->last_was_goto = false;
2032 case GIMPLE_OMP_PARALLEL:
2033 case GIMPLE_OMP_TASK:
2035 /* Make sure the outermost GIMPLE_BIND isn't removed
2037 gimple_seq body_seq = gimple_omp_body (stmt);
2038 gimple bind = gimple_seq_first_stmt (body_seq);
2039 gimple_seq bind_seq = gimple_bind_body (bind);
2040 gimple_stmt_iterator bind_gsi = gsi_start (bind_seq);
2042 remove_useless_stmts_1 (&bind_gsi, data);
2043 data->last_was_goto = false;
2048 case GIMPLE_CHANGE_DYNAMIC_TYPE:
2049 /* If we do not optimize remove GIMPLE_CHANGE_DYNAMIC_TYPE as
2050 expansion is confused about them and we only remove them
2051 during alias computation otherwise. */
2054 data->last_was_goto = false;
2055 gsi_remove (gsi, false);
2061 data->last_was_goto = false;
2068 /* Walk the function tree, removing useless statements and performing
2069 some preliminary simplifications. */
2072 remove_useless_stmts (void)
2074 struct rus_data data;
2076 clear_special_calls ();
2080 gimple_stmt_iterator gsi;
2082 gsi = gsi_start (gimple_body (current_function_decl));
2083 memset (&data, 0, sizeof (data));
2084 remove_useless_stmts_1 (&gsi, &data);
2086 while (data.repeat);
2088 #ifdef ENABLE_TYPES_CHECKING
2089 verify_types_in_gimple_seq (gimple_body (current_function_decl));
2096 struct gimple_opt_pass pass_remove_useless_stmts =
2100 "useless", /* name */
2102 remove_useless_stmts, /* execute */
2105 0, /* static_pass_number */
2106 TV_NONE, /* tv_id */
2107 PROP_gimple_any, /* properties_required */
2108 0, /* properties_provided */
2109 0, /* properties_destroyed */
2110 0, /* todo_flags_start */
2111 TODO_dump_func /* todo_flags_finish */
2115 /* Remove PHI nodes associated with basic block BB and all edges out of BB. */
2118 remove_phi_nodes_and_edges_for_unreachable_block (basic_block bb)
2120 /* Since this block is no longer reachable, we can just delete all
2121 of its PHI nodes. */
2122 remove_phi_nodes (bb);
2124 /* Remove edges to BB's successors. */
2125 while (EDGE_COUNT (bb->succs) > 0)
2126 remove_edge (EDGE_SUCC (bb, 0));
2130 /* Remove statements of basic block BB. */
2133 remove_bb (basic_block bb)
2135 gimple_stmt_iterator i;
2136 source_location loc = UNKNOWN_LOCATION;
2140 fprintf (dump_file, "Removing basic block %d\n", bb->index);
2141 if (dump_flags & TDF_DETAILS)
2143 dump_bb (bb, dump_file, 0);
2144 fprintf (dump_file, "\n");
2150 struct loop *loop = bb->loop_father;
2152 /* If a loop gets removed, clean up the information associated
2154 if (loop->latch == bb
2155 || loop->header == bb)
2156 free_numbers_of_iterations_estimates_loop (loop);
2159 /* Remove all the instructions in the block. */
2160 if (bb_seq (bb) != NULL)
2162 for (i = gsi_start_bb (bb); !gsi_end_p (i);)
2164 gimple stmt = gsi_stmt (i);
2165 if (gimple_code (stmt) == GIMPLE_LABEL
2166 && (FORCED_LABEL (gimple_label_label (stmt))
2167 || DECL_NONLOCAL (gimple_label_label (stmt))))
2170 gimple_stmt_iterator new_gsi;
2172 /* A non-reachable non-local label may still be referenced.
2173 But it no longer needs to carry the extra semantics of
2175 if (DECL_NONLOCAL (gimple_label_label (stmt)))
2177 DECL_NONLOCAL (gimple_label_label (stmt)) = 0;
2178 FORCED_LABEL (gimple_label_label (stmt)) = 1;
2181 new_bb = bb->prev_bb;
2182 new_gsi = gsi_start_bb (new_bb);
2183 gsi_remove (&i, false);
2184 gsi_insert_before (&new_gsi, stmt, GSI_NEW_STMT);
2188 /* Release SSA definitions if we are in SSA. Note that we
2189 may be called when not in SSA. For example,
2190 final_cleanup calls this function via
2191 cleanup_tree_cfg. */
2192 if (gimple_in_ssa_p (cfun))
2193 release_defs (stmt);
2195 gsi_remove (&i, true);
2198 /* Don't warn for removed gotos. Gotos are often removed due to
2199 jump threading, thus resulting in bogus warnings. Not great,
2200 since this way we lose warnings for gotos in the original
2201 program that are indeed unreachable. */
2202 if (gimple_code (stmt) != GIMPLE_GOTO
2203 && gimple_has_location (stmt)
2205 loc = gimple_location (stmt);
2209 /* If requested, give a warning that the first statement in the
2210 block is unreachable. We walk statements backwards in the
2211 loop above, so the last statement we process is the first statement
2213 if (loc > BUILTINS_LOCATION && LOCATION_LINE (loc) > 0)
2214 warning (OPT_Wunreachable_code, "%Hwill never be executed", &loc);
2216 remove_phi_nodes_and_edges_for_unreachable_block (bb);
2217 bb->il.gimple = NULL;
2221 /* Given a basic block BB ending with COND_EXPR or SWITCH_EXPR, and a
2222 predicate VAL, return the edge that will be taken out of the block.
2223 If VAL does not match a unique edge, NULL is returned. */
2226 find_taken_edge (basic_block bb, tree val)
2230 stmt = last_stmt (bb);
2233 gcc_assert (is_ctrl_stmt (stmt));
2238 if (!is_gimple_min_invariant (val))
2241 if (gimple_code (stmt) == GIMPLE_COND)
2242 return find_taken_edge_cond_expr (bb, val);
2244 if (gimple_code (stmt) == GIMPLE_SWITCH)
2245 return find_taken_edge_switch_expr (bb, val);
2247 if (computed_goto_p (stmt))
2249 /* Only optimize if the argument is a label, if the argument is
2250 not a label then we can not construct a proper CFG.
2252 It may be the case that we only need to allow the LABEL_REF to
2253 appear inside an ADDR_EXPR, but we also allow the LABEL_REF to
2254 appear inside a LABEL_EXPR just to be safe. */
2255 if ((TREE_CODE (val) == ADDR_EXPR || TREE_CODE (val) == LABEL_EXPR)
2256 && TREE_CODE (TREE_OPERAND (val, 0)) == LABEL_DECL)
2257 return find_taken_edge_computed_goto (bb, TREE_OPERAND (val, 0));
2264 /* Given a constant value VAL and the entry block BB to a GOTO_EXPR
2265 statement, determine which of the outgoing edges will be taken out of the
2266 block. Return NULL if either edge may be taken. */
2269 find_taken_edge_computed_goto (basic_block bb, tree val)
2274 dest = label_to_block (val);
2277 e = find_edge (bb, dest);
2278 gcc_assert (e != NULL);
2284 /* Given a constant value VAL and the entry block BB to a COND_EXPR
2285 statement, determine which of the two edges will be taken out of the
2286 block. Return NULL if either edge may be taken. */
2289 find_taken_edge_cond_expr (basic_block bb, tree val)
2291 edge true_edge, false_edge;
2293 extract_true_false_edges_from_block (bb, &true_edge, &false_edge);
2295 gcc_assert (TREE_CODE (val) == INTEGER_CST);
2296 return (integer_zerop (val) ? false_edge : true_edge);
2299 /* Given an INTEGER_CST VAL and the entry block BB to a SWITCH_EXPR
2300 statement, determine which edge will be taken out of the block. Return
2301 NULL if any edge may be taken. */
2304 find_taken_edge_switch_expr (basic_block bb, tree val)
2306 basic_block dest_bb;
2311 switch_stmt = last_stmt (bb);
2312 taken_case = find_case_label_for_value (switch_stmt, val);
2313 dest_bb = label_to_block (CASE_LABEL (taken_case));
2315 e = find_edge (bb, dest_bb);
2321 /* Return the CASE_LABEL_EXPR that SWITCH_STMT will take for VAL.
2322 We can make optimal use here of the fact that the case labels are
2323 sorted: We can do a binary search for a case matching VAL. */
2326 find_case_label_for_value (gimple switch_stmt, tree val)
2328 size_t low, high, n = gimple_switch_num_labels (switch_stmt);
2329 tree default_case = gimple_switch_default_label (switch_stmt);
2331 for (low = 0, high = n; high - low > 1; )
2333 size_t i = (high + low) / 2;
2334 tree t = gimple_switch_label (switch_stmt, i);
2337 /* Cache the result of comparing CASE_LOW and val. */
2338 cmp = tree_int_cst_compare (CASE_LOW (t), val);
2345 if (CASE_HIGH (t) == NULL)
2347 /* A singe-valued case label. */
2353 /* A case range. We can only handle integer ranges. */
2354 if (cmp <= 0 && tree_int_cst_compare (CASE_HIGH (t), val) >= 0)
2359 return default_case;
2363 /* Dump a basic block on stderr. */
2366 gimple_debug_bb (basic_block bb)
2368 gimple_dump_bb (bb, stderr, 0, TDF_VOPS|TDF_MEMSYMS);
2372 /* Dump basic block with index N on stderr. */
2375 gimple_debug_bb_n (int n)
2377 gimple_debug_bb (BASIC_BLOCK (n));
2378 return BASIC_BLOCK (n);
2382 /* Dump the CFG on stderr.
2384 FLAGS are the same used by the tree dumping functions
2385 (see TDF_* in tree-pass.h). */
2388 gimple_debug_cfg (int flags)
2390 gimple_dump_cfg (stderr, flags);
2394 /* Dump the program showing basic block boundaries on the given FILE.
2396 FLAGS are the same used by the tree dumping functions (see TDF_* in
2400 gimple_dump_cfg (FILE *file, int flags)
2402 if (flags & TDF_DETAILS)
2404 const char *funcname
2405 = lang_hooks.decl_printable_name (current_function_decl, 2);
2408 fprintf (file, ";; Function %s\n\n", funcname);
2409 fprintf (file, ";; \n%d basic blocks, %d edges, last basic block %d.\n\n",
2410 n_basic_blocks, n_edges, last_basic_block);
2412 brief_dump_cfg (file);
2413 fprintf (file, "\n");
2416 if (flags & TDF_STATS)
2417 dump_cfg_stats (file);
2419 dump_function_to_file (current_function_decl, file, flags | TDF_BLOCKS);
2423 /* Dump CFG statistics on FILE. */
2426 dump_cfg_stats (FILE *file)
2428 static long max_num_merged_labels = 0;
2429 unsigned long size, total = 0;
2432 const char * const fmt_str = "%-30s%-13s%12s\n";
2433 const char * const fmt_str_1 = "%-30s%13d%11lu%c\n";
2434 const char * const fmt_str_2 = "%-30s%13ld%11lu%c\n";
2435 const char * const fmt_str_3 = "%-43s%11lu%c\n";
2436 const char *funcname
2437 = lang_hooks.decl_printable_name (current_function_decl, 2);
2440 fprintf (file, "\nCFG Statistics for %s\n\n", funcname);
2442 fprintf (file, "---------------------------------------------------------\n");
2443 fprintf (file, fmt_str, "", " Number of ", "Memory");
2444 fprintf (file, fmt_str, "", " instances ", "used ");
2445 fprintf (file, "---------------------------------------------------------\n");
2447 size = n_basic_blocks * sizeof (struct basic_block_def);
2449 fprintf (file, fmt_str_1, "Basic blocks", n_basic_blocks,
2450 SCALE (size), LABEL (size));
2454 num_edges += EDGE_COUNT (bb->succs);
2455 size = num_edges * sizeof (struct edge_def);
2457 fprintf (file, fmt_str_2, "Edges", num_edges, SCALE (size), LABEL (size));
2459 fprintf (file, "---------------------------------------------------------\n");
2460 fprintf (file, fmt_str_3, "Total memory used by CFG data", SCALE (total),
2462 fprintf (file, "---------------------------------------------------------\n");
2463 fprintf (file, "\n");
2465 if (cfg_stats.num_merged_labels > max_num_merged_labels)
2466 max_num_merged_labels = cfg_stats.num_merged_labels;
2468 fprintf (file, "Coalesced label blocks: %ld (Max so far: %ld)\n",
2469 cfg_stats.num_merged_labels, max_num_merged_labels);
2471 fprintf (file, "\n");
2475 /* Dump CFG statistics on stderr. Keep extern so that it's always
2476 linked in the final executable. */
2479 debug_cfg_stats (void)
2481 dump_cfg_stats (stderr);
2485 /* Dump the flowgraph to a .vcg FILE. */
2488 gimple_cfg2vcg (FILE *file)
2493 const char *funcname
2494 = lang_hooks.decl_printable_name (current_function_decl, 2);
2496 /* Write the file header. */
2497 fprintf (file, "graph: { title: \"%s\"\n", funcname);
2498 fprintf (file, "node: { title: \"ENTRY\" label: \"ENTRY\" }\n");
2499 fprintf (file, "node: { title: \"EXIT\" label: \"EXIT\" }\n");
2501 /* Write blocks and edges. */
2502 FOR_EACH_EDGE (e, ei, ENTRY_BLOCK_PTR->succs)
2504 fprintf (file, "edge: { sourcename: \"ENTRY\" targetname: \"%d\"",
2507 if (e->flags & EDGE_FAKE)
2508 fprintf (file, " linestyle: dotted priority: 10");
2510 fprintf (file, " linestyle: solid priority: 100");
2512 fprintf (file, " }\n");
2518 enum gimple_code head_code, end_code;
2519 const char *head_name, *end_name;
2522 gimple first = first_stmt (bb);
2523 gimple last = last_stmt (bb);
2527 head_code = gimple_code (first);
2528 head_name = gimple_code_name[head_code];
2529 head_line = get_lineno (first);
2532 head_name = "no-statement";
2536 end_code = gimple_code (last);
2537 end_name = gimple_code_name[end_code];
2538 end_line = get_lineno (last);
2541 end_name = "no-statement";
2543 fprintf (file, "node: { title: \"%d\" label: \"#%d\\n%s (%d)\\n%s (%d)\"}\n",
2544 bb->index, bb->index, head_name, head_line, end_name,
2547 FOR_EACH_EDGE (e, ei, bb->succs)
2549 if (e->dest == EXIT_BLOCK_PTR)
2550 fprintf (file, "edge: { sourcename: \"%d\" targetname: \"EXIT\"", bb->index);
2552 fprintf (file, "edge: { sourcename: \"%d\" targetname: \"%d\"", bb->index, e->dest->index);
2554 if (e->flags & EDGE_FAKE)
2555 fprintf (file, " priority: 10 linestyle: dotted");
2557 fprintf (file, " priority: 100 linestyle: solid");
2559 fprintf (file, " }\n");
2562 if (bb->next_bb != EXIT_BLOCK_PTR)
2566 fputs ("}\n\n", file);
2571 /*---------------------------------------------------------------------------
2572 Miscellaneous helpers
2573 ---------------------------------------------------------------------------*/
2575 /* Return true if T represents a stmt that always transfers control. */
2578 is_ctrl_stmt (gimple t)
2580 return gimple_code (t) == GIMPLE_COND
2581 || gimple_code (t) == GIMPLE_SWITCH
2582 || gimple_code (t) == GIMPLE_GOTO
2583 || gimple_code (t) == GIMPLE_RETURN
2584 || gimple_code (t) == GIMPLE_RESX;
2588 /* Return true if T is a statement that may alter the flow of control
2589 (e.g., a call to a non-returning function). */
2592 is_ctrl_altering_stmt (gimple t)
2596 if (is_gimple_call (t))
2598 int flags = gimple_call_flags (t);
2600 /* A non-pure/const call alters flow control if the current
2601 function has nonlocal labels. */
2602 if (!(flags & (ECF_CONST | ECF_PURE))
2603 && cfun->has_nonlocal_label)
2606 /* A call also alters control flow if it does not return. */
2607 if (gimple_call_flags (t) & ECF_NORETURN)
2611 /* OpenMP directives alter control flow. */
2612 if (is_gimple_omp (t))
2615 /* If a statement can throw, it alters control flow. */
2616 return stmt_can_throw_internal (t);
2620 /* Return true if T is a simple local goto. */
2623 simple_goto_p (gimple t)
2625 return (gimple_code (t) == GIMPLE_GOTO
2626 && TREE_CODE (gimple_goto_dest (t)) == LABEL_DECL);
2630 /* Return true if T can make an abnormal transfer of control flow.
2631 Transfers of control flow associated with EH are excluded. */
2634 stmt_can_make_abnormal_goto (gimple t)
2636 if (computed_goto_p (t))
2638 if (is_gimple_call (t))
2639 return gimple_has_side_effects (t) && cfun->has_nonlocal_label;
2644 /* Return true if STMT should start a new basic block. PREV_STMT is
2645 the statement preceding STMT. It is used when STMT is a label or a
2646 case label. Labels should only start a new basic block if their
2647 previous statement wasn't a label. Otherwise, sequence of labels
2648 would generate unnecessary basic blocks that only contain a single
2652 stmt_starts_bb_p (gimple stmt, gimple prev_stmt)
2657 /* Labels start a new basic block only if the preceding statement
2658 wasn't a label of the same type. This prevents the creation of
2659 consecutive blocks that have nothing but a single label. */
2660 if (gimple_code (stmt) == GIMPLE_LABEL)
2662 /* Nonlocal and computed GOTO targets always start a new block. */
2663 if (DECL_NONLOCAL (gimple_label_label (stmt))
2664 || FORCED_LABEL (gimple_label_label (stmt)))
2667 if (prev_stmt && gimple_code (prev_stmt) == GIMPLE_LABEL)
2669 if (DECL_NONLOCAL (gimple_label_label (prev_stmt)))
2672 cfg_stats.num_merged_labels++;
2683 /* Return true if T should end a basic block. */
2686 stmt_ends_bb_p (gimple t)
2688 return is_ctrl_stmt (t) || is_ctrl_altering_stmt (t);
2691 /* Remove block annotations and other data structures. */
2694 delete_tree_cfg_annotations (void)
2696 label_to_block_map = NULL;
2700 /* Return the first statement in basic block BB. */
2703 first_stmt (basic_block bb)
2705 gimple_stmt_iterator i = gsi_start_bb (bb);
2706 return !gsi_end_p (i) ? gsi_stmt (i) : NULL;
2709 /* Return the last statement in basic block BB. */
2712 last_stmt (basic_block bb)
2714 gimple_stmt_iterator b = gsi_last_bb (bb);
2715 return !gsi_end_p (b) ? gsi_stmt (b) : NULL;
2718 /* Return the last statement of an otherwise empty block. Return NULL
2719 if the block is totally empty, or if it contains more than one
2723 last_and_only_stmt (basic_block bb)
2725 gimple_stmt_iterator i = gsi_last_bb (bb);
2731 last = gsi_stmt (i);
2736 /* Empty statements should no longer appear in the instruction stream.
2737 Everything that might have appeared before should be deleted by
2738 remove_useless_stmts, and the optimizers should just gsi_remove
2739 instead of smashing with build_empty_stmt.
2741 Thus the only thing that should appear here in a block containing
2742 one executable statement is a label. */
2743 prev = gsi_stmt (i);
2744 if (gimple_code (prev) == GIMPLE_LABEL)
2750 /* Reinstall those PHI arguments queued in OLD_EDGE to NEW_EDGE. */
2753 reinstall_phi_args (edge new_edge, edge old_edge)
2755 edge_var_map_vector v;
2758 gimple_stmt_iterator phis;
2760 v = redirect_edge_var_map_vector (old_edge);
2764 for (i = 0, phis = gsi_start_phis (new_edge->dest);
2765 VEC_iterate (edge_var_map, v, i, vm) && !gsi_end_p (phis);
2766 i++, gsi_next (&phis))
2768 gimple phi = gsi_stmt (phis);
2769 tree result = redirect_edge_var_map_result (vm);
2770 tree arg = redirect_edge_var_map_def (vm);
2772 gcc_assert (result == gimple_phi_result (phi));
2774 add_phi_arg (phi, arg, new_edge);
2777 redirect_edge_var_map_clear (old_edge);
2780 /* Returns the basic block after which the new basic block created
2781 by splitting edge EDGE_IN should be placed. Tries to keep the new block
2782 near its "logical" location. This is of most help to humans looking
2783 at debugging dumps. */
2786 split_edge_bb_loc (edge edge_in)
2788 basic_block dest = edge_in->dest;
2790 if (dest->prev_bb && find_edge (dest->prev_bb, dest))
2791 return edge_in->src;
2793 return dest->prev_bb;
2796 /* Split a (typically critical) edge EDGE_IN. Return the new block.
2797 Abort on abnormal edges. */
2800 gimple_split_edge (edge edge_in)
2802 basic_block new_bb, after_bb, dest;
2805 /* Abnormal edges cannot be split. */
2806 gcc_assert (!(edge_in->flags & EDGE_ABNORMAL));
2808 dest = edge_in->dest;
2810 after_bb = split_edge_bb_loc (edge_in);
2812 new_bb = create_empty_bb (after_bb);
2813 new_bb->frequency = EDGE_FREQUENCY (edge_in);
2814 new_bb->count = edge_in->count;
2815 new_edge = make_edge (new_bb, dest, EDGE_FALLTHRU);
2816 new_edge->probability = REG_BR_PROB_BASE;
2817 new_edge->count = edge_in->count;
2819 e = redirect_edge_and_branch (edge_in, new_bb);
2820 gcc_assert (e == edge_in);
2821 reinstall_phi_args (new_edge, e);
2826 /* Callback for walk_tree, check that all elements with address taken are
2827 properly noticed as such. The DATA is an int* that is 1 if TP was seen
2828 inside a PHI node. */
2831 verify_expr (tree *tp, int *walk_subtrees, void *data ATTRIBUTE_UNUSED)
2838 /* Check operand N for being valid GIMPLE and give error MSG if not. */
2839 #define CHECK_OP(N, MSG) \
2840 do { if (!is_gimple_val (TREE_OPERAND (t, N))) \
2841 { error (MSG); return TREE_OPERAND (t, N); }} while (0)
2843 switch (TREE_CODE (t))
2846 if (SSA_NAME_IN_FREE_LIST (t))
2848 error ("SSA name in freelist but still referenced");
2854 x = TREE_OPERAND (t, 0);
2855 if (!is_gimple_reg (x) && !is_gimple_min_invariant (x))
2857 error ("Indirect reference's operand is not a register or a constant.");
2863 x = fold (ASSERT_EXPR_COND (t));
2864 if (x == boolean_false_node)
2866 error ("ASSERT_EXPR with an always-false condition");
2872 error ("MODIFY_EXPR not expected while having tuples.");
2878 bool old_side_effects;
2880 bool new_side_effects;
2882 gcc_assert (is_gimple_address (t));
2884 old_constant = TREE_CONSTANT (t);
2885 old_side_effects = TREE_SIDE_EFFECTS (t);
2887 recompute_tree_invariant_for_addr_expr (t);
2888 new_side_effects = TREE_SIDE_EFFECTS (t);
2889 new_constant = TREE_CONSTANT (t);
2891 if (old_constant != new_constant)
2893 error ("constant not recomputed when ADDR_EXPR changed");
2896 if (old_side_effects != new_side_effects)
2898 error ("side effects not recomputed when ADDR_EXPR changed");
2902 /* Skip any references (they will be checked when we recurse down the
2903 tree) and ensure that any variable used as a prefix is marked
2905 for (x = TREE_OPERAND (t, 0);
2906 handled_component_p (x);
2907 x = TREE_OPERAND (x, 0))
2910 if (!(TREE_CODE (x) == VAR_DECL
2911 || TREE_CODE (x) == PARM_DECL
2912 || TREE_CODE (x) == RESULT_DECL))
2914 if (!TREE_ADDRESSABLE (x))
2916 error ("address taken, but ADDRESSABLE bit not set");
2919 if (DECL_GIMPLE_REG_P (x))
2921 error ("DECL_GIMPLE_REG_P set on a variable with address taken");
2929 x = COND_EXPR_COND (t);
2930 if (!INTEGRAL_TYPE_P (TREE_TYPE (x)))
2932 error ("non-integral used in condition");
2935 if (!is_gimple_condexpr (x))
2937 error ("invalid conditional operand");
2942 case NON_LVALUE_EXPR:
2946 case FIX_TRUNC_EXPR:
2951 case TRUTH_NOT_EXPR:
2952 CHECK_OP (0, "invalid operand to unary operator");
2959 case ARRAY_RANGE_REF:
2961 case VIEW_CONVERT_EXPR:
2962 /* We have a nest of references. Verify that each of the operands
2963 that determine where to reference is either a constant or a variable,
2964 verify that the base is valid, and then show we've already checked
2966 while (handled_component_p (t))
2968 if (TREE_CODE (t) == COMPONENT_REF && TREE_OPERAND (t, 2))
2969 CHECK_OP (2, "invalid COMPONENT_REF offset operator");
2970 else if (TREE_CODE (t) == ARRAY_REF
2971 || TREE_CODE (t) == ARRAY_RANGE_REF)
2973 CHECK_OP (1, "invalid array index");
2974 if (TREE_OPERAND (t, 2))
2975 CHECK_OP (2, "invalid array lower bound");
2976 if (TREE_OPERAND (t, 3))
2977 CHECK_OP (3, "invalid array stride");
2979 else if (TREE_CODE (t) == BIT_FIELD_REF)
2981 if (!host_integerp (TREE_OPERAND (t, 1), 1)
2982 || !host_integerp (TREE_OPERAND (t, 2), 1))
2984 error ("invalid position or size operand to BIT_FIELD_REF");
2987 else if (INTEGRAL_TYPE_P (TREE_TYPE (t))
2988 && (TYPE_PRECISION (TREE_TYPE (t))
2989 != TREE_INT_CST_LOW (TREE_OPERAND (t, 1))))
2991 error ("integral result type precision does not match "
2992 "field size of BIT_FIELD_REF");
2995 if (!INTEGRAL_TYPE_P (TREE_TYPE (t))
2996 && (GET_MODE_PRECISION (TYPE_MODE (TREE_TYPE (t)))
2997 != TREE_INT_CST_LOW (TREE_OPERAND (t, 1))))
2999 error ("mode precision of non-integral result does not "
3000 "match field size of BIT_FIELD_REF");
3005 t = TREE_OPERAND (t, 0);
3008 if (!is_gimple_min_invariant (t) && !is_gimple_lvalue (t))
3010 error ("invalid reference prefix");
3017 /* PLUS_EXPR and MINUS_EXPR don't work on pointers, they should be done using
3018 POINTER_PLUS_EXPR. */
3019 if (POINTER_TYPE_P (TREE_TYPE (t)))
3021 error ("invalid operand to plus/minus, type is a pointer");
3024 CHECK_OP (0, "invalid operand to binary operator");
3025 CHECK_OP (1, "invalid operand to binary operator");
3028 case POINTER_PLUS_EXPR:
3029 /* Check to make sure the first operand is a pointer or reference type. */
3030 if (!POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (t, 0))))
3032 error ("invalid operand to pointer plus, first operand is not a pointer");
3035 /* Check to make sure the second operand is an integer with type of
3037 if (!useless_type_conversion_p (sizetype,
3038 TREE_TYPE (TREE_OPERAND (t, 1))))
3040 error ("invalid operand to pointer plus, second operand is not an "
3041 "integer with type of sizetype.");
3051 case UNORDERED_EXPR:
3060 case TRUNC_DIV_EXPR:
3062 case FLOOR_DIV_EXPR:
3063 case ROUND_DIV_EXPR:
3064 case TRUNC_MOD_EXPR:
3066 case FLOOR_MOD_EXPR:
3067 case ROUND_MOD_EXPR:
3069 case EXACT_DIV_EXPR:
3079 CHECK_OP (0, "invalid operand to binary operator");
3080 CHECK_OP (1, "invalid operand to binary operator");
3084 if (TREE_CONSTANT (t) && TREE_CODE (TREE_TYPE (t)) == VECTOR_TYPE)
3097 /* Verify if EXPR is either a GIMPLE ID or a GIMPLE indirect reference.
3098 Returns true if there is an error, otherwise false. */
3101 verify_types_in_gimple_min_lval (tree expr)
3105 if (is_gimple_id (expr))
3108 if (!INDIRECT_REF_P (expr)
3109 && TREE_CODE (expr) != TARGET_MEM_REF)
3111 error ("invalid expression for min lvalue");
3115 /* TARGET_MEM_REFs are strange beasts. */
3116 if (TREE_CODE (expr) == TARGET_MEM_REF)
3119 op = TREE_OPERAND (expr, 0);
3120 if (!is_gimple_val (op))
3122 error ("invalid operand in indirect reference");
3123 debug_generic_stmt (op);
3126 if (!useless_type_conversion_p (TREE_TYPE (expr),
3127 TREE_TYPE (TREE_TYPE (op))))
3129 error ("type mismatch in indirect reference");
3130 debug_generic_stmt (TREE_TYPE (expr));
3131 debug_generic_stmt (TREE_TYPE (TREE_TYPE (op)));
3138 /* Verify if EXPR is a valid GIMPLE reference expression. If
3139 REQUIRE_LVALUE is true verifies it is an lvalue. Returns true
3140 if there is an error, otherwise false. */
3143 verify_types_in_gimple_reference (tree expr, bool require_lvalue)
3145 while (handled_component_p (expr))
3147 tree op = TREE_OPERAND (expr, 0);
3149 if (TREE_CODE (expr) == ARRAY_REF
3150 || TREE_CODE (expr) == ARRAY_RANGE_REF)
3152 if (!is_gimple_val (TREE_OPERAND (expr, 1))
3153 || (TREE_OPERAND (expr, 2)
3154 && !is_gimple_val (TREE_OPERAND (expr, 2)))
3155 || (TREE_OPERAND (expr, 3)
3156 && !is_gimple_val (TREE_OPERAND (expr, 3))))
3158 error ("invalid operands to array reference");
3159 debug_generic_stmt (expr);
3164 /* Verify if the reference array element types are compatible. */
3165 if (TREE_CODE (expr) == ARRAY_REF
3166 && !useless_type_conversion_p (TREE_TYPE (expr),
3167 TREE_TYPE (TREE_TYPE (op))))
3169 error ("type mismatch in array reference");
3170 debug_generic_stmt (TREE_TYPE (expr));
3171 debug_generic_stmt (TREE_TYPE (TREE_TYPE (op)));
3174 if (TREE_CODE (expr) == ARRAY_RANGE_REF
3175 && !useless_type_conversion_p (TREE_TYPE (TREE_TYPE (expr)),
3176 TREE_TYPE (TREE_TYPE (op))))
3178 error ("type mismatch in array range reference");
3179 debug_generic_stmt (TREE_TYPE (TREE_TYPE (expr)));
3180 debug_generic_stmt (TREE_TYPE (TREE_TYPE (op)));
3184 if ((TREE_CODE (expr) == REALPART_EXPR
3185 || TREE_CODE (expr) == IMAGPART_EXPR)
3186 && !useless_type_conversion_p (TREE_TYPE (expr),
3187 TREE_TYPE (TREE_TYPE (op))))
3189 error ("type mismatch in real/imagpart reference");
3190 debug_generic_stmt (TREE_TYPE (expr));
3191 debug_generic_stmt (TREE_TYPE (TREE_TYPE (op)));
3195 if (TREE_CODE (expr) == COMPONENT_REF
3196 && !useless_type_conversion_p (TREE_TYPE (expr),
3197 TREE_TYPE (TREE_OPERAND (expr, 1))))
3199 error ("type mismatch in component reference");
3200 debug_generic_stmt (TREE_TYPE (expr));
3201 debug_generic_stmt (TREE_TYPE (TREE_OPERAND (expr, 1)));
3205 /* For VIEW_CONVERT_EXPRs which are allowed here, too, there
3206 is nothing to verify. Gross mismatches at most invoke
3207 undefined behavior. */
3208 if (TREE_CODE (expr) == VIEW_CONVERT_EXPR
3209 && !handled_component_p (op))
3215 return ((require_lvalue || !is_gimple_min_invariant (expr))
3216 && verify_types_in_gimple_min_lval (expr));
3219 /* Returns true if there is one pointer type in TYPE_POINTER_TO (SRC_OBJ)
3220 list of pointer-to types that is trivially convertible to DEST. */
3223 one_pointer_to_useless_type_conversion_p (tree dest, tree src_obj)
3227 if (!TYPE_POINTER_TO (src_obj))
3230 for (src = TYPE_POINTER_TO (src_obj); src; src = TYPE_NEXT_PTR_TO (src))
3231 if (useless_type_conversion_p (dest, src))
3237 /* Return true if TYPE1 is a fixed-point type and if conversions to and
3238 from TYPE2 can be handled by FIXED_CONVERT_EXPR. */
3241 valid_fixed_convert_types_p (tree type1, tree type2)
3243 return (FIXED_POINT_TYPE_P (type1)
3244 && (INTEGRAL_TYPE_P (type2)
3245 || SCALAR_FLOAT_TYPE_P (type2)
3246 || FIXED_POINT_TYPE_P (type2)));
3249 /* Verify the contents of a GIMPLE_CALL STMT. Returns true when there
3250 is a problem, otherwise false. */
3253 verify_gimple_call (gimple stmt)
3255 tree fn = gimple_call_fn (stmt);
3258 if (!POINTER_TYPE_P (TREE_TYPE (fn))
3259 || (TREE_CODE (TREE_TYPE (TREE_TYPE (fn))) != FUNCTION_TYPE
3260 && TREE_CODE (TREE_TYPE (TREE_TYPE (fn))) != METHOD_TYPE))
3262 error ("non-function in gimple call");
3266 if (gimple_call_lhs (stmt)
3267 && !is_gimple_lvalue (gimple_call_lhs (stmt)))
3269 error ("invalid LHS in gimple call");
3273 fntype = TREE_TYPE (TREE_TYPE (fn));
3274 if (gimple_call_lhs (stmt)
3275 && !useless_type_conversion_p (TREE_TYPE (gimple_call_lhs (stmt)),
3277 /* ??? At least C++ misses conversions at assignments from
3278 void * call results.
3279 ??? Java is completely off. Especially with functions
3280 returning java.lang.Object.
3281 For now simply allow arbitrary pointer type conversions. */
3282 && !(POINTER_TYPE_P (TREE_TYPE (gimple_call_lhs (stmt)))
3283 && POINTER_TYPE_P (TREE_TYPE (fntype))))
3285 error ("invalid conversion in gimple call");
3286 debug_generic_stmt (TREE_TYPE (gimple_call_lhs (stmt)));
3287 debug_generic_stmt (TREE_TYPE (fntype));
3291 /* ??? The C frontend passes unpromoted arguments in case it
3292 didn't see a function declaration before the call. So for now
3293 leave the call arguments unverified. Once we gimplify
3294 unit-at-a-time we have a chance to fix this. */
3299 /* Verifies the gimple comparison with the result type TYPE and
3300 the operands OP0 and OP1. */
3303 verify_gimple_comparison (tree type, tree op0, tree op1)
3305 tree op0_type = TREE_TYPE (op0);
3306 tree op1_type = TREE_TYPE (op1);
3308 if (!is_gimple_val (op0) || !is_gimple_val (op1))
3310 error ("invalid operands in gimple comparison");
3314 /* For comparisons we do not have the operations type as the
3315 effective type the comparison is carried out in. Instead
3316 we require that either the first operand is trivially
3317 convertible into the second, or the other way around.
3318 The resulting type of a comparison may be any integral type.
3319 Because we special-case pointers to void we allow
3320 comparisons of pointers with the same mode as well. */
3321 if ((!useless_type_conversion_p (op0_type, op1_type)
3322 && !useless_type_conversion_p (op1_type, op0_type)
3323 && (!POINTER_TYPE_P (op0_type)
3324 || !POINTER_TYPE_P (op1_type)
3325 || TYPE_MODE (op0_type) != TYPE_MODE (op1_type)))
3326 || !INTEGRAL_TYPE_P (type))
3328 error ("type mismatch in comparison expression");
3329 debug_generic_expr (type);
3330 debug_generic_expr (op0_type);
3331 debug_generic_expr (op1_type);
3338 /* Verify a gimple assignment statement STMT with an unary rhs.
3339 Returns true if anything is wrong. */
3342 verify_gimple_assign_unary (gimple stmt)
3344 enum tree_code rhs_code = gimple_assign_rhs_code (stmt);
3345 tree lhs = gimple_assign_lhs (stmt);
3346 tree lhs_type = TREE_TYPE (lhs);
3347 tree rhs1 = gimple_assign_rhs1 (stmt);
3348 tree rhs1_type = TREE_TYPE (rhs1);
3350 if (!is_gimple_reg (lhs)
3352 && TREE_CODE (lhs_type) == COMPLEX_TYPE))
3354 error ("non-register as LHS of unary operation");
3358 if (!is_gimple_val (rhs1))
3360 error ("invalid operand in unary operation");
3364 /* First handle conversions. */
3369 /* Allow conversions between integral types and pointers only if
3370 there is no sign or zero extension involved.
3371 For targets were the precision of sizetype doesn't match that
3372 of pointers we need to allow arbitrary conversions from and
3374 if ((POINTER_TYPE_P (lhs_type)
3375 && INTEGRAL_TYPE_P (rhs1_type)
3376 && (TYPE_PRECISION (lhs_type) >= TYPE_PRECISION (rhs1_type)
3377 || rhs1_type == sizetype))
3378 || (POINTER_TYPE_P (rhs1_type)
3379 && INTEGRAL_TYPE_P (lhs_type)
3380 && (TYPE_PRECISION (rhs1_type) >= TYPE_PRECISION (lhs_type)
3381 || lhs_type == sizetype)))
3384 /* Allow conversion from integer to offset type and vice versa. */
3385 if ((TREE_CODE (lhs_type) == OFFSET_TYPE
3386 && TREE_CODE (rhs1_type) == INTEGER_TYPE)
3387 || (TREE_CODE (lhs_type) == INTEGER_TYPE
3388 && TREE_CODE (rhs1_type) == OFFSET_TYPE))
3391 /* Otherwise assert we are converting between types of the
3393 if (INTEGRAL_TYPE_P (lhs_type) != INTEGRAL_TYPE_P (rhs1_type))
3395 error ("invalid types in nop conversion");
3396 debug_generic_expr (lhs_type);
3397 debug_generic_expr (rhs1_type);
3404 case FIXED_CONVERT_EXPR:
3406 if (!valid_fixed_convert_types_p (lhs_type, rhs1_type)
3407 && !valid_fixed_convert_types_p (rhs1_type, lhs_type))
3409 error ("invalid types in fixed-point conversion");
3410 debug_generic_expr (lhs_type);
3411 debug_generic_expr (rhs1_type);
3420 if (!INTEGRAL_TYPE_P (rhs1_type) || !SCALAR_FLOAT_TYPE_P (lhs_type))
3422 error ("invalid types in conversion to floating point");
3423 debug_generic_expr (lhs_type);
3424 debug_generic_expr (rhs1_type);
3431 case FIX_TRUNC_EXPR:
3433 if (!INTEGRAL_TYPE_P (lhs_type) || !SCALAR_FLOAT_TYPE_P (rhs1_type))
3435 error ("invalid types in conversion to integer");
3436 debug_generic_expr (lhs_type);
3437 debug_generic_expr (rhs1_type);
3444 case VEC_UNPACK_HI_EXPR:
3445 case VEC_UNPACK_LO_EXPR:
3446 case REDUC_MAX_EXPR:
3447 case REDUC_MIN_EXPR:
3448 case REDUC_PLUS_EXPR:
3449 case VEC_UNPACK_FLOAT_HI_EXPR:
3450 case VEC_UNPACK_FLOAT_LO_EXPR:
3454 case TRUTH_NOT_EXPR:
3459 case NON_LVALUE_EXPR:
3467 /* For the remaining codes assert there is no conversion involved. */
3468 if (!useless_type_conversion_p (lhs_type, rhs1_type))
3470 error ("non-trivial conversion in unary operation");
3471 debug_generic_expr (lhs_type);
3472 debug_generic_expr (rhs1_type);
3479 /* Verify a gimple assignment statement STMT with a binary rhs.
3480 Returns true if anything is wrong. */
3483 verify_gimple_assign_binary (gimple stmt)
3485 enum tree_code rhs_code = gimple_assign_rhs_code (stmt);
3486 tree lhs = gimple_assign_lhs (stmt);
3487 tree lhs_type = TREE_TYPE (lhs);
3488 tree rhs1 = gimple_assign_rhs1 (stmt);
3489 tree rhs1_type = TREE_TYPE (rhs1);
3490 tree rhs2 = gimple_assign_rhs2 (stmt);
3491 tree rhs2_type = TREE_TYPE (rhs2);
3493 if (!is_gimple_reg (lhs)
3495 && TREE_CODE (lhs_type) == COMPLEX_TYPE))
3497 error ("non-register as LHS of binary operation");
3501 if (!is_gimple_val (rhs1)
3502 || !is_gimple_val (rhs2))
3504 error ("invalid operands in binary operation");
3508 /* First handle operations that involve different types. */
3513 if (TREE_CODE (lhs_type) != COMPLEX_TYPE
3514 || !(INTEGRAL_TYPE_P (rhs1_type)
3515 || SCALAR_FLOAT_TYPE_P (rhs1_type))
3516 || !(INTEGRAL_TYPE_P (rhs2_type)
3517 || SCALAR_FLOAT_TYPE_P (rhs2_type)))
3519 error ("type mismatch in complex expression");
3520 debug_generic_expr (lhs_type);
3521 debug_generic_expr (rhs1_type);
3522 debug_generic_expr (rhs2_type);
3534 /* Shifts and rotates are ok on integral types, fixed point
3535 types and integer vector types. */
3536 if ((!INTEGRAL_TYPE_P (rhs1_type)
3537 && !FIXED_POINT_TYPE_P (rhs1_type)
3538 && !(TREE_CODE (rhs1_type) == VECTOR_TYPE
3539 && TREE_CODE (TREE_TYPE (rhs1_type)) == INTEGER_TYPE))
3540 || (!INTEGRAL_TYPE_P (rhs2_type)
3541 /* Vector shifts of vectors are also ok. */
3542 && !(TREE_CODE (rhs1_type) == VECTOR_TYPE
3543 && TREE_CODE (TREE_TYPE (rhs1_type)) == INTEGER_TYPE
3544 && TREE_CODE (rhs2_type) == VECTOR_TYPE
3545 && TREE_CODE (TREE_TYPE (rhs2_type)) == INTEGER_TYPE))
3546 || !useless_type_conversion_p (lhs_type, rhs1_type))
3548 error ("type mismatch in shift expression");
3549 debug_generic_expr (lhs_type);
3550 debug_generic_expr (rhs1_type);
3551 debug_generic_expr (rhs2_type);
3558 case VEC_LSHIFT_EXPR:
3559 case VEC_RSHIFT_EXPR:
3561 if (TREE_CODE (rhs1_type) != VECTOR_TYPE
3562 || !(INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type))
3563 || FIXED_POINT_TYPE_P (TREE_TYPE (rhs1_type)))
3564 || (!INTEGRAL_TYPE_P (rhs2_type)
3565 && (TREE_CODE (rhs2_type) != VECTOR_TYPE
3566 || !INTEGRAL_TYPE_P (TREE_TYPE (rhs2_type))))
3567 || !useless_type_conversion_p (lhs_type, rhs1_type))
3569 error ("type mismatch in vector shift expression");
3570 debug_generic_expr (lhs_type);
3571 debug_generic_expr (rhs1_type);
3572 debug_generic_expr (rhs2_type);
3581 /* We use regular PLUS_EXPR for vectors.
3582 ??? This just makes the checker happy and may not be what is
3584 if (TREE_CODE (lhs_type) == VECTOR_TYPE
3585 && POINTER_TYPE_P (TREE_TYPE (lhs_type)))
3587 if (TREE_CODE (rhs1_type) != VECTOR_TYPE
3588 || TREE_CODE (rhs2_type) != VECTOR_TYPE)
3590 error ("invalid non-vector operands to vector valued plus");
3593 lhs_type = TREE_TYPE (lhs_type);
3594 rhs1_type = TREE_TYPE (rhs1_type);
3595 rhs2_type = TREE_TYPE (rhs2_type);
3596 /* PLUS_EXPR is commutative, so we might end up canonicalizing
3597 the pointer to 2nd place. */
3598 if (POINTER_TYPE_P (rhs2_type))
3600 tree tem = rhs1_type;
3601 rhs1_type = rhs2_type;
3604 goto do_pointer_plus_expr_check;
3610 if (POINTER_TYPE_P (lhs_type)
3611 || POINTER_TYPE_P (rhs1_type)
3612 || POINTER_TYPE_P (rhs2_type))
3614 error ("invalid (pointer) operands to plus/minus");
3618 /* Continue with generic binary expression handling. */
3622 case POINTER_PLUS_EXPR:
3624 do_pointer_plus_expr_check:
3625 if (!POINTER_TYPE_P (rhs1_type)
3626 || !useless_type_conversion_p (lhs_type, rhs1_type)
3627 || !useless_type_conversion_p (sizetype, rhs2_type))
3629 error ("type mismatch in pointer plus expression");
3630 debug_generic_stmt (lhs_type);
3631 debug_generic_stmt (rhs1_type);
3632 debug_generic_stmt (rhs2_type);
3639 case TRUTH_ANDIF_EXPR:
3640 case TRUTH_ORIF_EXPR:
3643 case TRUTH_AND_EXPR:
3645 case TRUTH_XOR_EXPR:
3647 /* We allow any kind of integral typed argument and result. */
3648 if (!INTEGRAL_TYPE_P (rhs1_type)
3649 || !INTEGRAL_TYPE_P (rhs2_type)
3650 || !INTEGRAL_TYPE_P (lhs_type))
3652 error ("type mismatch in binary truth expression");
3653 debug_generic_expr (lhs_type);
3654 debug_generic_expr (rhs1_type);
3655 debug_generic_expr (rhs2_type);
3668 case UNORDERED_EXPR:
3676 /* Comparisons are also binary, but the result type is not
3677 connected to the operand types. */
3678 return verify_gimple_comparison (lhs_type, rhs1, rhs2);
3680 case WIDEN_SUM_EXPR:
3681 case WIDEN_MULT_EXPR:
3682 case VEC_WIDEN_MULT_HI_EXPR:
3683 case VEC_WIDEN_MULT_LO_EXPR:
3684 case VEC_PACK_TRUNC_EXPR:
3685 case VEC_PACK_SAT_EXPR:
3686 case VEC_PACK_FIX_TRUNC_EXPR:
3687 case VEC_EXTRACT_EVEN_EXPR:
3688 case VEC_EXTRACT_ODD_EXPR:
3689 case VEC_INTERLEAVE_HIGH_EXPR:
3690 case VEC_INTERLEAVE_LOW_EXPR:
3695 case TRUNC_DIV_EXPR:
3697 case FLOOR_DIV_EXPR:
3698 case ROUND_DIV_EXPR:
3699 case TRUNC_MOD_EXPR:
3701 case FLOOR_MOD_EXPR:
3702 case ROUND_MOD_EXPR:
3704 case EXACT_DIV_EXPR:
3710 /* Continue with generic binary expression handling. */
3717 if (!useless_type_conversion_p (lhs_type, rhs1_type)
3718 || !useless_type_conversion_p (lhs_type, rhs2_type))
3720 error ("type mismatch in binary expression");
3721 debug_generic_stmt (lhs_type);
3722 debug_generic_stmt (rhs1_type);
3723 debug_generic_stmt (rhs2_type);
3730 /* Verify a gimple assignment statement STMT with a single rhs.
3731 Returns true if anything is wrong. */
3734 verify_gimple_assign_single (gimple stmt)
3736 enum tree_code rhs_code = gimple_assign_rhs_code (stmt);
3737 tree lhs = gimple_assign_lhs (stmt);
3738 tree lhs_type = TREE_TYPE (lhs);
3739 tree rhs1 = gimple_assign_rhs1 (stmt);
3740 tree rhs1_type = TREE_TYPE (rhs1);
3743 if (!useless_type_conversion_p (lhs_type, rhs1_type))
3745 error ("non-trivial conversion at assignment");
3746 debug_generic_expr (lhs_type);
3747 debug_generic_expr (rhs1_type);
3751 if (handled_component_p (lhs))
3752 res |= verify_types_in_gimple_reference (lhs, true);
3754 /* Special codes we cannot handle via their class. */
3759 tree op = TREE_OPERAND (rhs1, 0);
3760 if (!is_gimple_addressable (op))
3762 error ("invalid operand in unary expression");
3766 if (!one_pointer_to_useless_type_conversion_p (lhs_type,
3769 error ("type mismatch in address expression");
3770 debug_generic_stmt (lhs_type);
3771 debug_generic_stmt (TYPE_POINTER_TO (TREE_TYPE (op)));
3775 return verify_types_in_gimple_reference (op, true);
3782 case ALIGN_INDIRECT_REF:
3783 case MISALIGNED_INDIRECT_REF:
3785 case ARRAY_RANGE_REF:
3786 case VIEW_CONVERT_EXPR:
3789 case TARGET_MEM_REF:
3790 if (!is_gimple_reg (lhs)
3791 && is_gimple_reg_type (TREE_TYPE (lhs)))
3793 error ("invalid rhs for gimple memory store");
3794 debug_generic_stmt (lhs);
3795 debug_generic_stmt (rhs1);
3798 return res || verify_types_in_gimple_reference (rhs1, false);
3810 /* tcc_declaration */
3815 if (!is_gimple_reg (lhs)
3816 && !is_gimple_reg (rhs1)
3817 && is_gimple_reg_type (TREE_TYPE (lhs)))
3819 error ("invalid rhs for gimple memory store");
3820 debug_generic_stmt (lhs);
3821 debug_generic_stmt (rhs1);
3830 case WITH_SIZE_EXPR:
3833 case POLYNOMIAL_CHREC:
3836 case REALIGN_LOAD_EXPR:
3846 /* Verify the contents of a GIMPLE_ASSIGN STMT. Returns true when there
3847 is a problem, otherwise false. */
3850 verify_gimple_assign (gimple stmt)
3852 switch (gimple_assign_rhs_class (stmt))
3854 case GIMPLE_SINGLE_RHS:
3855 return verify_gimple_assign_single (stmt);
3857 case GIMPLE_UNARY_RHS:
3858 return verify_gimple_assign_unary (stmt);
3860 case GIMPLE_BINARY_RHS:
3861 return verify_gimple_assign_binary (stmt);
3868 /* Verify the contents of a GIMPLE_RETURN STMT. Returns true when there
3869 is a problem, otherwise false. */
3872 verify_gimple_return (gimple stmt)
3874 tree op = gimple_return_retval (stmt);
3875 tree restype = TREE_TYPE (TREE_TYPE (cfun->decl));
3877 /* We cannot test for present return values as we do not fix up missing
3878 return values from the original source. */
3882 if (!is_gimple_val (op)
3883 && TREE_CODE (op) != RESULT_DECL)
3885 error ("invalid operand in return statement");
3886 debug_generic_stmt (op);
3890 if (!useless_type_conversion_p (restype, TREE_TYPE (op))
3891 /* ??? With C++ we can have the situation that the result
3892 decl is a reference type while the return type is an aggregate. */
3893 && !(TREE_CODE (op) == RESULT_DECL
3894 && TREE_CODE (TREE_TYPE (op)) == REFERENCE_TYPE
3895 && useless_type_conversion_p (restype, TREE_TYPE (TREE_TYPE (op)))))
3897 error ("invalid conversion in return statement");
3898 debug_generic_stmt (restype);
3899 debug_generic_stmt (TREE_TYPE (op));
3907 /* Verify the contents of a GIMPLE_GOTO STMT. Returns true when there
3908 is a problem, otherwise false. */
3911 verify_gimple_goto (gimple stmt)
3913 tree dest = gimple_goto_dest (stmt);
3915 /* ??? We have two canonical forms of direct goto destinations, a
3916 bare LABEL_DECL and an ADDR_EXPR of a LABEL_DECL. */
3917 if (TREE_CODE (dest) != LABEL_DECL
3918 && (!is_gimple_val (dest)
3919 || !POINTER_TYPE_P (TREE_TYPE (dest))))
3921 error ("goto destination is neither a label nor a pointer");
3928 /* Verify the contents of a GIMPLE_SWITCH STMT. Returns true when there
3929 is a problem, otherwise false. */
3932 verify_gimple_switch (gimple stmt)
3934 if (!is_gimple_val (gimple_switch_index (stmt)))
3936 error ("invalid operand to switch statement");
3937 debug_generic_stmt (gimple_switch_index (stmt));
3945 /* Verify the contents of a GIMPLE_PHI. Returns true if there is a problem,
3946 and false otherwise. */
3949 verify_gimple_phi (gimple stmt)
3951 tree type = TREE_TYPE (gimple_phi_result (stmt));
3954 if (!is_gimple_variable (gimple_phi_result (stmt)))
3956 error ("Invalid PHI result");
3960 for (i = 0; i < gimple_phi_num_args (stmt); i++)
3962 tree arg = gimple_phi_arg_def (stmt, i);
3963 if ((is_gimple_reg (gimple_phi_result (stmt))
3964 && !is_gimple_val (arg))
3965 || (!is_gimple_reg (gimple_phi_result (stmt))
3966 && !is_gimple_addressable (arg)))
3968 error ("Invalid PHI argument");
3969 debug_generic_stmt (arg);
3972 if (!useless_type_conversion_p (type, TREE_TYPE (arg)))
3974 error ("Incompatible types in PHI argument %u", i);
3975 debug_generic_stmt (type);
3976 debug_generic_stmt (TREE_TYPE (arg));
3985 /* Verify the GIMPLE statement STMT. Returns true if there is an
3986 error, otherwise false. */
3989 verify_types_in_gimple_stmt (gimple stmt)
3991 if (is_gimple_omp (stmt))
3993 /* OpenMP directives are validated by the FE and never operated
3994 on by the optimizers. Furthermore, GIMPLE_OMP_FOR may contain
3995 non-gimple expressions when the main index variable has had
3996 its address taken. This does not affect the loop itself
3997 because the header of an GIMPLE_OMP_FOR is merely used to determine
3998 how to setup the parallel iteration. */
4002 switch (gimple_code (stmt))
4005 return verify_gimple_assign (stmt);
4008 return TREE_CODE (gimple_label_label (stmt)) != LABEL_DECL;
4011 return verify_gimple_call (stmt);
4014 return verify_gimple_comparison (boolean_type_node,
4015 gimple_cond_lhs (stmt),
4016 gimple_cond_rhs (stmt));
4019 return verify_gimple_goto (stmt);
4022 return verify_gimple_switch (stmt);
4025 return verify_gimple_return (stmt);
4030 case GIMPLE_CHANGE_DYNAMIC_TYPE:
4031 return (!is_gimple_val (gimple_cdt_location (stmt))
4032 || !POINTER_TYPE_P (TREE_TYPE (gimple_cdt_location (stmt))));
4035 return verify_gimple_phi (stmt);
4037 /* Tuples that do not have tree operands. */
4040 case GIMPLE_PREDICT:
4048 /* Verify the GIMPLE statements inside the sequence STMTS. */
4051 verify_types_in_gimple_seq_2 (gimple_seq stmts)
4053 gimple_stmt_iterator ittr;
4056 for (ittr = gsi_start (stmts); !gsi_end_p (ittr); gsi_next (&ittr))
4058 gimple stmt = gsi_stmt (ittr);
4060 switch (gimple_code (stmt))
4063 err |= verify_types_in_gimple_seq_2 (gimple_bind_body (stmt));
4067 err |= verify_types_in_gimple_seq_2 (gimple_try_eval (stmt));
4068 err |= verify_types_in_gimple_seq_2 (gimple_try_cleanup (stmt));
4071 case GIMPLE_EH_FILTER:
4072 err |= verify_types_in_gimple_seq_2 (gimple_eh_filter_failure (stmt));
4076 err |= verify_types_in_gimple_seq_2 (gimple_catch_handler (stmt));
4081 bool err2 = verify_types_in_gimple_stmt (stmt);
4083 debug_gimple_stmt (stmt);
4093 /* Verify the GIMPLE statements inside the statement list STMTS. */
4096 verify_types_in_gimple_seq (gimple_seq stmts)
4098 if (verify_types_in_gimple_seq_2 (stmts))
4099 internal_error ("verify_gimple failed");
4103 /* Verify STMT, return true if STMT is not in GIMPLE form.
4104 TODO: Implement type checking. */
4107 verify_stmt (gimple_stmt_iterator *gsi)
4110 struct walk_stmt_info wi;
4111 bool last_in_block = gsi_one_before_end_p (*gsi);
4112 gimple stmt = gsi_stmt (*gsi);
4114 if (is_gimple_omp (stmt))
4116 /* OpenMP directives are validated by the FE and never operated
4117 on by the optimizers. Furthermore, GIMPLE_OMP_FOR may contain
4118 non-gimple expressions when the main index variable has had
4119 its address taken. This does not affect the loop itself
4120 because the header of an GIMPLE_OMP_FOR is merely used to determine
4121 how to setup the parallel iteration. */
4125 /* FIXME. The C frontend passes unpromoted arguments in case it
4126 didn't see a function declaration before the call. */
4127 if (is_gimple_call (stmt))
4131 if (!is_gimple_call_addr (gimple_call_fn (stmt)))
4133 error ("invalid function in call statement");
4137 decl = gimple_call_fndecl (stmt);
4139 && TREE_CODE (decl) == FUNCTION_DECL
4140 && DECL_LOOPING_CONST_OR_PURE_P (decl)
4141 && (!DECL_PURE_P (decl))
4142 && (!TREE_READONLY (decl)))
4144 error ("invalid pure const state for function");
4149 memset (&wi, 0, sizeof (wi));
4150 addr = walk_gimple_op (gsi_stmt (*gsi), verify_expr, &wi);
4153 debug_generic_expr (addr);
4154 inform (input_location, "in statement");
4155 debug_gimple_stmt (stmt);
4159 /* If the statement is marked as part of an EH region, then it is
4160 expected that the statement could throw. Verify that when we
4161 have optimizations that simplify statements such that we prove
4162 that they cannot throw, that we update other data structures
4164 if (lookup_stmt_eh_region (stmt) >= 0)
4166 /* During IPA passes, ipa-pure-const sets nothrow flags on calls
4167 and they are updated on statements only after fixup_cfg
4168 is executed at beggining of expansion stage. */
4169 if (!stmt_could_throw_p (stmt) && cgraph_state != CGRAPH_STATE_IPA_SSA)
4171 error ("statement marked for throw, but doesn%'t");
4174 if (!last_in_block && stmt_can_throw_internal (stmt))
4176 error ("statement marked for throw in middle of block");
4184 debug_gimple_stmt (stmt);
4189 /* Return true when the T can be shared. */
4192 tree_node_can_be_shared (tree t)
4194 if (IS_TYPE_OR_DECL_P (t)
4195 || is_gimple_min_invariant (t)
4196 || TREE_CODE (t) == SSA_NAME
4197 || t == error_mark_node
4198 || TREE_CODE (t) == IDENTIFIER_NODE)
4201 if (TREE_CODE (t) == CASE_LABEL_EXPR)
4204 while (((TREE_CODE (t) == ARRAY_REF || TREE_CODE (t) == ARRAY_RANGE_REF)
4205 && is_gimple_min_invariant (TREE_OPERAND (t, 1)))
4206 || TREE_CODE (t) == COMPONENT_REF
4207 || TREE_CODE (t) == REALPART_EXPR
4208 || TREE_CODE (t) == IMAGPART_EXPR)
4209 t = TREE_OPERAND (t, 0);
4218 /* Called via walk_gimple_stmt. Verify tree sharing. */
4221 verify_node_sharing (tree *tp, int *walk_subtrees, void *data)
4223 struct walk_stmt_info *wi = (struct walk_stmt_info *) data;
4224 struct pointer_set_t *visited = (struct pointer_set_t *) wi->info;
4226 if (tree_node_can_be_shared (*tp))
4228 *walk_subtrees = false;
4232 if (pointer_set_insert (visited, *tp))
4239 static bool eh_error_found;
4241 verify_eh_throw_stmt_node (void **slot, void *data)
4243 struct throw_stmt_node *node = (struct throw_stmt_node *)*slot;
4244 struct pointer_set_t *visited = (struct pointer_set_t *) data;
4246 if (!pointer_set_contains (visited, node->stmt))
4248 error ("Dead STMT in EH table");
4249 debug_gimple_stmt (node->stmt);
4250 eh_error_found = true;
4256 /* Verify the GIMPLE statements in every basic block. */
4262 gimple_stmt_iterator gsi;
4264 struct pointer_set_t *visited, *visited_stmts;
4266 struct walk_stmt_info wi;
4268 timevar_push (TV_TREE_STMT_VERIFY);
4269 visited = pointer_set_create ();
4270 visited_stmts = pointer_set_create ();
4272 memset (&wi, 0, sizeof (wi));
4273 wi.info = (void *) visited;
4280 for (gsi = gsi_start_phis (bb); !gsi_end_p (gsi); gsi_next (&gsi))
4282 phi = gsi_stmt (gsi);
4283 pointer_set_insert (visited_stmts, phi);
4284 if (gimple_bb (phi) != bb)
4286 error ("gimple_bb (phi) is set to a wrong basic block");
4290 for (i = 0; i < gimple_phi_num_args (phi); i++)
4292 tree t = gimple_phi_arg_def (phi, i);
4297 error ("missing PHI def");
4298 debug_gimple_stmt (phi);
4302 /* Addressable variables do have SSA_NAMEs but they
4303 are not considered gimple values. */
4304 else if (TREE_CODE (t) != SSA_NAME
4305 && TREE_CODE (t) != FUNCTION_DECL
4306 && !is_gimple_min_invariant (t))
4308 error ("PHI argument is not a GIMPLE value");
4309 debug_gimple_stmt (phi);
4310 debug_generic_expr (t);
4314 addr = walk_tree (&t, verify_node_sharing, visited, NULL);
4317 error ("incorrect sharing of tree nodes");
4318 debug_gimple_stmt (phi);
4319 debug_generic_expr (addr);
4324 #ifdef ENABLE_TYPES_CHECKING
4325 if (verify_gimple_phi (phi))
4327 debug_gimple_stmt (phi);
4333 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); )
4335 gimple stmt = gsi_stmt (gsi);
4337 if (gimple_code (stmt) == GIMPLE_WITH_CLEANUP_EXPR
4338 || gimple_code (stmt) == GIMPLE_BIND)
4340 error ("invalid GIMPLE statement");
4341 debug_gimple_stmt (stmt);
4345 pointer_set_insert (visited_stmts, stmt);
4347 if (gimple_bb (stmt) != bb)
4349 error ("gimple_bb (stmt) is set to a wrong basic block");
4353 if (gimple_code (stmt) == GIMPLE_LABEL)
4355 tree decl = gimple_label_label (stmt);
4356 int uid = LABEL_DECL_UID (decl);
4359 || VEC_index (basic_block, label_to_block_map, uid) != bb)
4361 error ("incorrect entry in label_to_block_map.\n");
4366 err |= verify_stmt (&gsi);
4368 #ifdef ENABLE_TYPES_CHECKING
4369 if (verify_types_in_gimple_stmt (gsi_stmt (gsi)))
4371 debug_gimple_stmt (stmt);
4375 addr = walk_gimple_op (gsi_stmt (gsi), verify_node_sharing, &wi);
4378 error ("incorrect sharing of tree nodes");
4379 debug_gimple_stmt (stmt);
4380 debug_generic_expr (addr);
4387 eh_error_found = false;
4388 if (get_eh_throw_stmt_table (cfun))
4389 htab_traverse (get_eh_throw_stmt_table (cfun),
4390 verify_eh_throw_stmt_node,
4393 if (err | eh_error_found)
4394 internal_error ("verify_stmts failed");
4396 pointer_set_destroy (visited);
4397 pointer_set_destroy (visited_stmts);
4398 verify_histograms ();
4399 timevar_pop (TV_TREE_STMT_VERIFY);
4403 /* Verifies that the flow information is OK. */
4406 gimple_verify_flow_info (void)
4410 gimple_stmt_iterator gsi;
4415 if (ENTRY_BLOCK_PTR->il.gimple)
4417 error ("ENTRY_BLOCK has IL associated with it");
4421 if (EXIT_BLOCK_PTR->il.gimple)
4423 error ("EXIT_BLOCK has IL associated with it");
4427 FOR_EACH_EDGE (e, ei, EXIT_BLOCK_PTR->preds)
4428 if (e->flags & EDGE_FALLTHRU)
4430 error ("fallthru to exit from bb %d", e->src->index);
4436 bool found_ctrl_stmt = false;
4440 /* Skip labels on the start of basic block. */
4441 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
4444 gimple prev_stmt = stmt;
4446 stmt = gsi_stmt (gsi);
4448 if (gimple_code (stmt) != GIMPLE_LABEL)
4451 label = gimple_label_label (stmt);
4452 if (prev_stmt && DECL_NONLOCAL (label))
4454 error ("nonlocal label ");
4455 print_generic_expr (stderr, label, 0);
4456 fprintf (stderr, " is not first in a sequence of labels in bb %d",
4461 if (label_to_block (label) != bb)
4464 print_generic_expr (stderr, label, 0);
4465 fprintf (stderr, " to block does not match in bb %d",
4470 if (decl_function_context (label) != current_function_decl)
4473 print_generic_expr (stderr, label, 0);
4474 fprintf (stderr, " has incorrect context in bb %d",
4480 /* Verify that body of basic block BB is free of control flow. */
4481 for (; !gsi_end_p (gsi); gsi_next (&gsi))
4483 gimple stmt = gsi_stmt (gsi);
4485 if (found_ctrl_stmt)
4487 error ("control flow in the middle of basic block %d",
4492 if (stmt_ends_bb_p (stmt))
4493 found_ctrl_stmt = true;
4495 if (gimple_code (stmt) == GIMPLE_LABEL)
4498 print_generic_expr (stderr, gimple_label_label (stmt), 0);
4499 fprintf (stderr, " in the middle of basic block %d", bb->index);
4504 gsi = gsi_last_bb (bb);
4505 if (gsi_end_p (gsi))
4508 stmt = gsi_stmt (gsi);
4510 err |= verify_eh_edges (stmt);
4512 if (is_ctrl_stmt (stmt))
4514 FOR_EACH_EDGE (e, ei, bb->succs)
4515 if (e->flags & EDGE_FALLTHRU)
4517 error ("fallthru edge after a control statement in bb %d",
4523 if (gimple_code (stmt) != GIMPLE_COND)
4525 /* Verify that there are no edges with EDGE_TRUE/FALSE_FLAG set
4526 after anything else but if statement. */
4527 FOR_EACH_EDGE (e, ei, bb->succs)
4528 if (e->flags & (EDGE_TRUE_VALUE | EDGE_FALSE_VALUE))
4530 error ("true/false edge after a non-GIMPLE_COND in bb %d",
4536 switch (gimple_code (stmt))
4543 extract_true_false_edges_from_block (bb, &true_edge, &false_edge);
4547 || !(true_edge->flags & EDGE_TRUE_VALUE)
4548 || !(false_edge->flags & EDGE_FALSE_VALUE)
4549 || (true_edge->flags & (EDGE_FALLTHRU | EDGE_ABNORMAL))
4550 || (false_edge->flags & (EDGE_FALLTHRU | EDGE_ABNORMAL))
4551 || EDGE_COUNT (bb->succs) >= 3)
4553 error ("wrong outgoing edge flags at end of bb %d",
4561 if (simple_goto_p (stmt))
4563 error ("explicit goto at end of bb %d", bb->index);
4568 /* FIXME. We should double check that the labels in the
4569 destination blocks have their address taken. */
4570 FOR_EACH_EDGE (e, ei, bb->succs)
4571 if ((e->flags & (EDGE_FALLTHRU | EDGE_TRUE_VALUE
4572 | EDGE_FALSE_VALUE))
4573 || !(e->flags & EDGE_ABNORMAL))
4575 error ("wrong outgoing edge flags at end of bb %d",
4583 if (!single_succ_p (bb)
4584 || (single_succ_edge (bb)->flags
4585 & (EDGE_FALLTHRU | EDGE_ABNORMAL
4586 | EDGE_TRUE_VALUE | EDGE_FALSE_VALUE)))
4588 error ("wrong outgoing edge flags at end of bb %d", bb->index);
4591 if (single_succ (bb) != EXIT_BLOCK_PTR)
4593 error ("return edge does not point to exit in bb %d",
4605 n = gimple_switch_num_labels (stmt);
4607 /* Mark all the destination basic blocks. */
4608 for (i = 0; i < n; ++i)
4610 tree lab = CASE_LABEL (gimple_switch_label (stmt, i));
4611 basic_block label_bb = label_to_block (lab);
4612 gcc_assert (!label_bb->aux || label_bb->aux == (void *)1);
4613 label_bb->aux = (void *)1;
4616 /* Verify that the case labels are sorted. */
4617 prev = gimple_switch_label (stmt, 0);
4618 for (i = 1; i < n; ++i)
4620 tree c = gimple_switch_label (stmt, i);
4623 error ("found default case not at the start of "
4629 && !tree_int_cst_lt (CASE_LOW (prev), CASE_LOW (c)))
4631 error ("case labels not sorted: ");
4632 print_generic_expr (stderr, prev, 0);
4633 fprintf (stderr," is greater than ");
4634 print_generic_expr (stderr, c, 0);
4635 fprintf (stderr," but comes before it.\n");
4640 /* VRP will remove the default case if it can prove it will
4641 never be executed. So do not verify there always exists
4642 a default case here. */
4644 FOR_EACH_EDGE (e, ei, bb->succs)
4648 error ("extra outgoing edge %d->%d",
4649 bb->index, e->dest->index);
4653 e->dest->aux = (void *)2;
4654 if ((e->flags & (EDGE_FALLTHRU | EDGE_ABNORMAL
4655 | EDGE_TRUE_VALUE | EDGE_FALSE_VALUE)))
4657 error ("wrong outgoing edge flags at end of bb %d",
4663 /* Check that we have all of them. */
4664 for (i = 0; i < n; ++i)
4666 tree lab = CASE_LABEL (gimple_switch_label (stmt, i));
4667 basic_block label_bb = label_to_block (lab);
4669 if (label_bb->aux != (void *)2)
4671 error ("missing edge %i->%i", bb->index, label_bb->index);
4676 FOR_EACH_EDGE (e, ei, bb->succs)
4677 e->dest->aux = (void *)0;
4684 if (dom_info_state (CDI_DOMINATORS) >= DOM_NO_FAST_QUERY)
4685 verify_dominators (CDI_DOMINATORS);
4691 /* Updates phi nodes after creating a forwarder block joined
4692 by edge FALLTHRU. */
4695 gimple_make_forwarder_block (edge fallthru)
4699 basic_block dummy, bb;
4701 gimple_stmt_iterator gsi;
4703 dummy = fallthru->src;
4704 bb = fallthru->dest;
4706 if (single_pred_p (bb))
4709 /* If we redirected a branch we must create new PHI nodes at the
4711 for (gsi = gsi_start_phis (dummy); !gsi_end_p (gsi); gsi_next (&gsi))
4713 gimple phi, new_phi;
4715 phi = gsi_stmt (gsi);
4716 var = gimple_phi_result (phi);
4717 new_phi = create_phi_node (var, bb);
4718 SSA_NAME_DEF_STMT (var) = new_phi;
4719 gimple_phi_set_result (phi, make_ssa_name (SSA_NAME_VAR (var), phi));
4720 add_phi_arg (new_phi, gimple_phi_result (phi), fallthru);
4723 /* Add the arguments we have stored on edges. */
4724 FOR_EACH_EDGE (e, ei, bb->preds)
4729 flush_pending_stmts (e);
4734 /* Return a non-special label in the head of basic block BLOCK.
4735 Create one if it doesn't exist. */
4738 gimple_block_label (basic_block bb)
4740 gimple_stmt_iterator i, s = gsi_start_bb (bb);
4745 for (i = s; !gsi_end_p (i); first = false, gsi_next (&i))
4747 stmt = gsi_stmt (i);
4748 if (gimple_code (stmt) != GIMPLE_LABEL)
4750 label = gimple_label_label (stmt);
4751 if (!DECL_NONLOCAL (label))
4754 gsi_move_before (&i, &s);
4759 label = create_artificial_label ();
4760 stmt = gimple_build_label (label);
4761 gsi_insert_before (&s, stmt, GSI_NEW_STMT);
4766 /* Attempt to perform edge redirection by replacing a possibly complex
4767 jump instruction by a goto or by removing the jump completely.
4768 This can apply only if all edges now point to the same block. The
4769 parameters and return values are equivalent to
4770 redirect_edge_and_branch. */
4773 gimple_try_redirect_by_replacing_jump (edge e, basic_block target)
4775 basic_block src = e->src;
4776 gimple_stmt_iterator i;
4779 /* We can replace or remove a complex jump only when we have exactly
4781 if (EDGE_COUNT (src->succs) != 2
4782 /* Verify that all targets will be TARGET. Specifically, the
4783 edge that is not E must also go to TARGET. */
4784 || EDGE_SUCC (src, EDGE_SUCC (src, 0) == e)->dest != target)
4787 i = gsi_last_bb (src);
4791 stmt = gsi_stmt (i);
4793 if (gimple_code (stmt) == GIMPLE_COND || gimple_code (stmt) == GIMPLE_SWITCH)
4795 gsi_remove (&i, true);
4796 e = ssa_redirect_edge (e, target);
4797 e->flags = EDGE_FALLTHRU;
4805 /* Redirect E to DEST. Return NULL on failure. Otherwise, return the
4806 edge representing the redirected branch. */
4809 gimple_redirect_edge_and_branch (edge e, basic_block dest)
4811 basic_block bb = e->src;
4812 gimple_stmt_iterator gsi;
4816 if (e->flags & EDGE_ABNORMAL)
4819 if (e->src != ENTRY_BLOCK_PTR
4820 && (ret = gimple_try_redirect_by_replacing_jump (e, dest)))
4823 if (e->dest == dest)
4826 if (e->flags & EDGE_EH)
4827 return redirect_eh_edge (e, dest);
4829 gsi = gsi_last_bb (bb);
4830 stmt = gsi_end_p (gsi) ? NULL : gsi_stmt (gsi);
4832 switch (stmt ? gimple_code (stmt) : ERROR_MARK)
4835 /* For COND_EXPR, we only need to redirect the edge. */
4839 /* No non-abnormal edges should lead from a non-simple goto, and
4840 simple ones should be represented implicitly. */
4845 tree label = gimple_block_label (dest);
4846 tree cases = get_cases_for_edge (e, stmt);
4848 /* If we have a list of cases associated with E, then use it
4849 as it's a lot faster than walking the entire case vector. */
4852 edge e2 = find_edge (e->src, dest);
4859 CASE_LABEL (cases) = label;
4860 cases = TREE_CHAIN (cases);
4863 /* If there was already an edge in the CFG, then we need
4864 to move all the cases associated with E to E2. */
4867 tree cases2 = get_cases_for_edge (e2, stmt);
4869 TREE_CHAIN (last) = TREE_CHAIN (cases2);
4870 TREE_CHAIN (cases2) = first;
4875 size_t i, n = gimple_switch_num_labels (stmt);
4877 for (i = 0; i < n; i++)
4879 tree elt = gimple_switch_label (stmt, i);
4880 if (label_to_block (CASE_LABEL (elt)) == e->dest)
4881 CASE_LABEL (elt) = label;
4889 gsi_remove (&gsi, true);
4890 e->flags |= EDGE_FALLTHRU;
4893 case GIMPLE_OMP_RETURN:
4894 case GIMPLE_OMP_CONTINUE:
4895 case GIMPLE_OMP_SECTIONS_SWITCH:
4896 case GIMPLE_OMP_FOR:
4897 /* The edges from OMP constructs can be simply redirected. */
4901 /* Otherwise it must be a fallthru edge, and we don't need to
4902 do anything besides redirecting it. */
4903 gcc_assert (e->flags & EDGE_FALLTHRU);
4907 /* Update/insert PHI nodes as necessary. */
4909 /* Now update the edges in the CFG. */
4910 e = ssa_redirect_edge (e, dest);
4915 /* Returns true if it is possible to remove edge E by redirecting
4916 it to the destination of the other edge from E->src. */
4919 gimple_can_remove_branch_p (const_edge e)
4921 if (e->flags & (EDGE_ABNORMAL | EDGE_EH))
4927 /* Simple wrapper, as we can always redirect fallthru edges. */
4930 gimple_redirect_edge_and_branch_force (edge e, basic_block dest)
4932 e = gimple_redirect_edge_and_branch (e, dest);
4939 /* Splits basic block BB after statement STMT (but at least after the
4940 labels). If STMT is NULL, BB is split just after the labels. */
4943 gimple_split_block (basic_block bb, void *stmt)
4945 gimple_stmt_iterator gsi;
4946 gimple_stmt_iterator gsi_tgt;
4953 new_bb = create_empty_bb (bb);
4955 /* Redirect the outgoing edges. */
4956 new_bb->succs = bb->succs;
4958 FOR_EACH_EDGE (e, ei, new_bb->succs)
4961 if (stmt && gimple_code ((gimple) stmt) == GIMPLE_LABEL)
4964 /* Move everything from GSI to the new basic block. */
4965 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
4967 act = gsi_stmt (gsi);
4968 if (gimple_code (act) == GIMPLE_LABEL)
4981 if (gsi_end_p (gsi))
4984 /* Split the statement list - avoid re-creating new containers as this
4985 brings ugly quadratic memory consumption in the inliner.
4986 (We are still quadratic since we need to update stmt BB pointers,
4988 list = gsi_split_seq_before (&gsi);
4989 set_bb_seq (new_bb, list);
4990 for (gsi_tgt = gsi_start (list);
4991 !gsi_end_p (gsi_tgt); gsi_next (&gsi_tgt))
4992 gimple_set_bb (gsi_stmt (gsi_tgt), new_bb);
4998 /* Moves basic block BB after block AFTER. */
5001 gimple_move_block_after (basic_block bb, basic_block after)
5003 if (bb->prev_bb == after)
5007 link_block (bb, after);
5013 /* Return true if basic_block can be duplicated. */
5016 gimple_can_duplicate_bb_p (const_basic_block bb ATTRIBUTE_UNUSED)
5021 /* Create a duplicate of the basic block BB. NOTE: This does not
5022 preserve SSA form. */
5025 gimple_duplicate_bb (basic_block bb)
5028 gimple_stmt_iterator gsi, gsi_tgt;
5029 gimple_seq phis = phi_nodes (bb);
5030 gimple phi, stmt, copy;
5032 new_bb = create_empty_bb (EXIT_BLOCK_PTR->prev_bb);
5034 /* Copy the PHI nodes. We ignore PHI node arguments here because
5035 the incoming edges have not been setup yet. */
5036 for (gsi = gsi_start (phis); !gsi_end_p (gsi); gsi_next (&gsi))
5038 phi = gsi_stmt (gsi);
5039 copy = create_phi_node (gimple_phi_result (phi), new_bb);
5040 create_new_def_for (gimple_phi_result (copy), copy,
5041 gimple_phi_result_ptr (copy));
5044 gsi_tgt = gsi_start_bb (new_bb);
5045 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
5047 def_operand_p def_p;
5048 ssa_op_iter op_iter;
5051 stmt = gsi_stmt (gsi);
5052 if (gimple_code (stmt) == GIMPLE_LABEL)
5055 /* Create a new copy of STMT and duplicate STMT's virtual
5057 copy = gimple_copy (stmt);
5058 gsi_insert_after (&gsi_tgt, copy, GSI_NEW_STMT);
5059 region = lookup_stmt_eh_region (stmt);
5061 add_stmt_to_eh_region (copy, region);
5062 gimple_duplicate_stmt_histograms (cfun, copy, cfun, stmt);
5064 /* Create new names for all the definitions created by COPY and
5065 add replacement mappings for each new name. */
5066 FOR_EACH_SSA_DEF_OPERAND (def_p, copy, op_iter, SSA_OP_ALL_DEFS)
5067 create_new_def_for (DEF_FROM_PTR (def_p), copy, def_p);
5073 /* Adds phi node arguments for edge E_COPY after basic block duplication. */
5076 add_phi_args_after_copy_edge (edge e_copy)
5078 basic_block bb, bb_copy = e_copy->src, dest;
5081 gimple phi, phi_copy;
5083 gimple_stmt_iterator psi, psi_copy;
5085 if (gimple_seq_empty_p (phi_nodes (e_copy->dest)))
5088 bb = bb_copy->flags & BB_DUPLICATED ? get_bb_original (bb_copy) : bb_copy;
5090 if (e_copy->dest->flags & BB_DUPLICATED)
5091 dest = get_bb_original (e_copy->dest);
5093 dest = e_copy->dest;
5095 e = find_edge (bb, dest);
5098 /* During loop unrolling the target of the latch edge is copied.
5099 In this case we are not looking for edge to dest, but to
5100 duplicated block whose original was dest. */
5101 FOR_EACH_EDGE (e, ei, bb->succs)
5103 if ((e->dest->flags & BB_DUPLICATED)
5104 && get_bb_original (e->dest) == dest)
5108 gcc_assert (e != NULL);
5111 for (psi = gsi_start_phis (e->dest),
5112 psi_copy = gsi_start_phis (e_copy->dest);
5114 gsi_next (&psi), gsi_next (&psi_copy))
5116 phi = gsi_stmt (psi);
5117 phi_copy = gsi_stmt (psi_copy);
5118 def = PHI_ARG_DEF_FROM_EDGE (phi, e);
5119 add_phi_arg (phi_copy, def, e_copy);
5124 /* Basic block BB_COPY was created by code duplication. Add phi node
5125 arguments for edges going out of BB_COPY. The blocks that were
5126 duplicated have BB_DUPLICATED set. */
5129 add_phi_args_after_copy_bb (basic_block bb_copy)
5134 FOR_EACH_EDGE (e_copy, ei, bb_copy->succs)
5136 add_phi_args_after_copy_edge (e_copy);
5140 /* Blocks in REGION_COPY array of length N_REGION were created by
5141 duplication of basic blocks. Add phi node arguments for edges
5142 going from these blocks. If E_COPY is not NULL, also add
5143 phi node arguments for its destination.*/
5146 add_phi_args_after_copy (basic_block *region_copy, unsigned n_region,
5151 for (i = 0; i < n_region; i++)
5152 region_copy[i]->flags |= BB_DUPLICATED;
5154 for (i = 0; i < n_region; i++)
5155 add_phi_args_after_copy_bb (region_copy[i]);
5157 add_phi_args_after_copy_edge (e_copy);
5159 for (i = 0; i < n_region; i++)
5160 region_copy[i]->flags &= ~BB_DUPLICATED;
5163 /* Duplicates a REGION (set of N_REGION basic blocks) with just a single
5164 important exit edge EXIT. By important we mean that no SSA name defined
5165 inside region is live over the other exit edges of the region. All entry
5166 edges to the region must go to ENTRY->dest. The edge ENTRY is redirected
5167 to the duplicate of the region. SSA form, dominance and loop information
5168 is updated. The new basic blocks are stored to REGION_COPY in the same
5169 order as they had in REGION, provided that REGION_COPY is not NULL.
5170 The function returns false if it is unable to copy the region,
5174 gimple_duplicate_sese_region (edge entry, edge exit,
5175 basic_block *region, unsigned n_region,
5176 basic_block *region_copy)
5179 bool free_region_copy = false, copying_header = false;
5180 struct loop *loop = entry->dest->loop_father;
5182 VEC (basic_block, heap) *doms;
5184 int total_freq = 0, entry_freq = 0;
5185 gcov_type total_count = 0, entry_count = 0;
5187 if (!can_copy_bbs_p (region, n_region))
5190 /* Some sanity checking. Note that we do not check for all possible
5191 missuses of the functions. I.e. if you ask to copy something weird,
5192 it will work, but the state of structures probably will not be
5194 for (i = 0; i < n_region; i++)
5196 /* We do not handle subloops, i.e. all the blocks must belong to the
5198 if (region[i]->loop_father != loop)
5201 if (region[i] != entry->dest
5202 && region[i] == loop->header)
5206 set_loop_copy (loop, loop);
5208 /* In case the function is used for loop header copying (which is the primary
5209 use), ensure that EXIT and its copy will be new latch and entry edges. */
5210 if (loop->header == entry->dest)
5212 copying_header = true;
5213 set_loop_copy (loop, loop_outer (loop));
5215 if (!dominated_by_p (CDI_DOMINATORS, loop->latch, exit->src))
5218 for (i = 0; i < n_region; i++)
5219 if (region[i] != exit->src
5220 && dominated_by_p (CDI_DOMINATORS, region[i], exit->src))
5226 region_copy = XNEWVEC (basic_block, n_region);
5227 free_region_copy = true;
5230 gcc_assert (!need_ssa_update_p (cfun));
5232 /* Record blocks outside the region that are dominated by something
5235 initialize_original_copy_tables ();
5237 doms = get_dominated_by_region (CDI_DOMINATORS, region, n_region);
5239 if (entry->dest->count)
5241 total_count = entry->dest->count;
5242 entry_count = entry->count;
5243 /* Fix up corner cases, to avoid division by zero or creation of negative
5245 if (entry_count > total_count)
5246 entry_count = total_count;
5250 total_freq = entry->dest->frequency;
5251 entry_freq = EDGE_FREQUENCY (entry);
5252 /* Fix up corner cases, to avoid division by zero or creation of negative
5254 if (total_freq == 0)
5256 else if (entry_freq > total_freq)
5257 entry_freq = total_freq;
5260 copy_bbs (region, n_region, region_copy, &exit, 1, &exit_copy, loop,
5261 split_edge_bb_loc (entry));
5264 scale_bbs_frequencies_gcov_type (region, n_region,
5265 total_count - entry_count,
5267 scale_bbs_frequencies_gcov_type (region_copy, n_region, entry_count,
5272 scale_bbs_frequencies_int (region, n_region, total_freq - entry_freq,
5274 scale_bbs_frequencies_int (region_copy, n_region, entry_freq, total_freq);
5279 loop->header = exit->dest;
5280 loop->latch = exit->src;
5283 /* Redirect the entry and add the phi node arguments. */
5284 redirected = redirect_edge_and_branch (entry, get_bb_copy (entry->dest));
5285 gcc_assert (redirected != NULL);
5286 flush_pending_stmts (entry);
5288 /* Concerning updating of dominators: We must recount dominators
5289 for entry block and its copy. Anything that is outside of the
5290 region, but was dominated by something inside needs recounting as
5292 set_immediate_dominator (CDI_DOMINATORS, entry->dest, entry->src);
5293 VEC_safe_push (basic_block, heap, doms, get_bb_original (entry->dest));
5294 iterate_fix_dominators (CDI_DOMINATORS, doms, false);
5295 VEC_free (basic_block, heap, doms);
5297 /* Add the other PHI node arguments. */
5298 add_phi_args_after_copy (region_copy, n_region, NULL);
5300 /* Update the SSA web. */
5301 update_ssa (TODO_update_ssa);
5303 if (free_region_copy)
5306 free_original_copy_tables ();
5310 /* Duplicates REGION consisting of N_REGION blocks. The new blocks
5311 are stored to REGION_COPY in the same order in that they appear
5312 in REGION, if REGION_COPY is not NULL. ENTRY is the entry to
5313 the region, EXIT an exit from it. The condition guarding EXIT
5314 is moved to ENTRY. Returns true if duplication succeeds, false
5340 gimple_duplicate_sese_tail (edge entry ATTRIBUTE_UNUSED, edge exit ATTRIBUTE_UNUSED,
5341 basic_block *region ATTRIBUTE_UNUSED, unsigned n_region ATTRIBUTE_UNUSED,
5342 basic_block *region_copy ATTRIBUTE_UNUSED)
5345 bool free_region_copy = false;
5346 struct loop *loop = exit->dest->loop_father;
5347 struct loop *orig_loop = entry->dest->loop_father;
5348 basic_block switch_bb, entry_bb, nentry_bb;
5349 VEC (basic_block, heap) *doms;
5350 int total_freq = 0, exit_freq = 0;
5351 gcov_type total_count = 0, exit_count = 0;
5352 edge exits[2], nexits[2], e;
5353 gimple_stmt_iterator gsi;
5357 gcc_assert (EDGE_COUNT (exit->src->succs) == 2);
5359 exits[1] = EDGE_SUCC (exit->src, EDGE_SUCC (exit->src, 0) == exit);
5361 if (!can_copy_bbs_p (region, n_region))
5364 /* Some sanity checking. Note that we do not check for all possible
5365 missuses of the functions. I.e. if you ask to copy something weird
5366 (e.g., in the example, if there is a jump from inside to the middle
5367 of some_code, or come_code defines some of the values used in cond)
5368 it will work, but the resulting code will not be correct. */
5369 for (i = 0; i < n_region; i++)
5371 /* We do not handle subloops, i.e. all the blocks must belong to the
5373 if (region[i]->loop_father != orig_loop)
5376 if (region[i] == orig_loop->latch)
5380 initialize_original_copy_tables ();
5381 set_loop_copy (orig_loop, loop);
5385 region_copy = XNEWVEC (basic_block, n_region);
5386 free_region_copy = true;
5389 gcc_assert (!need_ssa_update_p (cfun));
5391 /* Record blocks outside the region that are dominated by something
5393 doms = get_dominated_by_region (CDI_DOMINATORS, region, n_region);
5395 if (exit->src->count)
5397 total_count = exit->src->count;
5398 exit_count = exit->count;
5399 /* Fix up corner cases, to avoid division by zero or creation of negative
5401 if (exit_count > total_count)
5402 exit_count = total_count;
5406 total_freq = exit->src->frequency;
5407 exit_freq = EDGE_FREQUENCY (exit);
5408 /* Fix up corner cases, to avoid division by zero or creation of negative
5410 if (total_freq == 0)
5412 if (exit_freq > total_freq)
5413 exit_freq = total_freq;
5416 copy_bbs (region, n_region, region_copy, exits, 2, nexits, orig_loop,
5417 split_edge_bb_loc (exit));
5420 scale_bbs_frequencies_gcov_type (region, n_region,
5421 total_count - exit_count,
5423 scale_bbs_frequencies_gcov_type (region_copy, n_region, exit_count,
5428 scale_bbs_frequencies_int (region, n_region, total_freq - exit_freq,
5430 scale_bbs_frequencies_int (region_copy, n_region, exit_freq, total_freq);
5433 /* Create the switch block, and put the exit condition to it. */
5434 entry_bb = entry->dest;
5435 nentry_bb = get_bb_copy (entry_bb);
5436 if (!last_stmt (entry->src)
5437 || !stmt_ends_bb_p (last_stmt (entry->src)))
5438 switch_bb = entry->src;
5440 switch_bb = split_edge (entry);
5441 set_immediate_dominator (CDI_DOMINATORS, nentry_bb, switch_bb);
5443 gsi = gsi_last_bb (switch_bb);
5444 cond_stmt = last_stmt (exit->src);
5445 gcc_assert (gimple_code (cond_stmt) == GIMPLE_COND);
5446 cond_stmt = gimple_copy (cond_stmt);
5447 gimple_cond_set_lhs (cond_stmt, unshare_expr (gimple_cond_lhs (cond_stmt)));
5448 gimple_cond_set_rhs (cond_stmt, unshare_expr (gimple_cond_rhs (cond_stmt)));
5449 gsi_insert_after (&gsi, cond_stmt, GSI_NEW_STMT);
5451 sorig = single_succ_edge (switch_bb);
5452 sorig->flags = exits[1]->flags;
5453 snew = make_edge (switch_bb, nentry_bb, exits[0]->flags);
5455 /* Register the new edge from SWITCH_BB in loop exit lists. */
5456 rescan_loop_exit (snew, true, false);
5458 /* Add the PHI node arguments. */
5459 add_phi_args_after_copy (region_copy, n_region, snew);
5461 /* Get rid of now superfluous conditions and associated edges (and phi node
5463 e = redirect_edge_and_branch (exits[0], exits[1]->dest);
5464 PENDING_STMT (e) = NULL;
5465 e = redirect_edge_and_branch (nexits[1], nexits[0]->dest);
5466 PENDING_STMT (e) = NULL;
5468 /* Anything that is outside of the region, but was dominated by something
5469 inside needs to update dominance info. */
5470 iterate_fix_dominators (CDI_DOMINATORS, doms, false);
5471 VEC_free (basic_block, heap, doms);
5473 /* Update the SSA web. */
5474 update_ssa (TODO_update_ssa);
5476 if (free_region_copy)
5479 free_original_copy_tables ();
5483 /* Add all the blocks dominated by ENTRY to the array BBS_P. Stop
5484 adding blocks when the dominator traversal reaches EXIT. This
5485 function silently assumes that ENTRY strictly dominates EXIT. */
5488 gather_blocks_in_sese_region (basic_block entry, basic_block exit,
5489 VEC(basic_block,heap) **bbs_p)
5493 for (son = first_dom_son (CDI_DOMINATORS, entry);
5495 son = next_dom_son (CDI_DOMINATORS, son))
5497 VEC_safe_push (basic_block, heap, *bbs_p, son);
5499 gather_blocks_in_sese_region (son, exit, bbs_p);
5503 /* Replaces *TP with a duplicate (belonging to function TO_CONTEXT).
5504 The duplicates are recorded in VARS_MAP. */
5507 replace_by_duplicate_decl (tree *tp, struct pointer_map_t *vars_map,
5510 tree t = *tp, new_t;
5511 struct function *f = DECL_STRUCT_FUNCTION (to_context);
5514 if (DECL_CONTEXT (t) == to_context)
5517 loc = pointer_map_contains (vars_map, t);
5521 loc = pointer_map_insert (vars_map, t);
5525 new_t = copy_var_decl (t, DECL_NAME (t), TREE_TYPE (t));
5526 f->local_decls = tree_cons (NULL_TREE, new_t, f->local_decls);
5530 gcc_assert (TREE_CODE (t) == CONST_DECL);
5531 new_t = copy_node (t);
5533 DECL_CONTEXT (new_t) = to_context;
5538 new_t = (tree) *loc;
5544 /* Creates an ssa name in TO_CONTEXT equivalent to NAME.
5545 VARS_MAP maps old ssa names and var_decls to the new ones. */
5548 replace_ssa_name (tree name, struct pointer_map_t *vars_map,
5552 tree new_name, decl = SSA_NAME_VAR (name);
5554 gcc_assert (is_gimple_reg (name));
5556 loc = pointer_map_contains (vars_map, name);
5560 replace_by_duplicate_decl (&decl, vars_map, to_context);
5562 push_cfun (DECL_STRUCT_FUNCTION (to_context));
5563 if (gimple_in_ssa_p (cfun))
5564 add_referenced_var (decl);
5566 new_name = make_ssa_name (decl, SSA_NAME_DEF_STMT (name));
5567 if (SSA_NAME_IS_DEFAULT_DEF (name))
5568 set_default_def (decl, new_name);
5571 loc = pointer_map_insert (vars_map, name);
5575 new_name = (tree) *loc;
5586 struct pointer_map_t *vars_map;
5587 htab_t new_label_map;
5591 /* Helper for move_block_to_fn. Set TREE_BLOCK in every expression
5592 contained in *TP if it has been ORIG_BLOCK previously and change the
5593 DECL_CONTEXT of every local variable referenced in *TP. */
5596 move_stmt_op (tree *tp, int *walk_subtrees, void *data)
5598 struct walk_stmt_info *wi = (struct walk_stmt_info *) data;
5599 struct move_stmt_d *p = (struct move_stmt_d *) wi->info;
5603 /* We should never have TREE_BLOCK set on non-statements. */
5604 gcc_assert (!TREE_BLOCK (t));
5606 else if (DECL_P (t) || TREE_CODE (t) == SSA_NAME)
5608 if (TREE_CODE (t) == SSA_NAME)
5609 *tp = replace_ssa_name (t, p->vars_map, p->to_context);
5610 else if (TREE_CODE (t) == LABEL_DECL)
5612 if (p->new_label_map)
5614 struct tree_map in, *out;
5616 out = (struct tree_map *)
5617 htab_find_with_hash (p->new_label_map, &in, DECL_UID (t));
5622 DECL_CONTEXT (t) = p->to_context;
5624 else if (p->remap_decls_p)
5626 /* Replace T with its duplicate. T should no longer appear in the
5627 parent function, so this looks wasteful; however, it may appear
5628 in referenced_vars, and more importantly, as virtual operands of
5629 statements, and in alias lists of other variables. It would be
5630 quite difficult to expunge it from all those places. ??? It might
5631 suffice to do this for addressable variables. */
5632 if ((TREE_CODE (t) == VAR_DECL
5633 && !is_global_var (t))
5634 || TREE_CODE (t) == CONST_DECL)
5635 replace_by_duplicate_decl (tp, p->vars_map, p->to_context);
5638 && gimple_in_ssa_p (cfun))
5640 push_cfun (DECL_STRUCT_FUNCTION (p->to_context));
5641 add_referenced_var (*tp);
5647 else if (TYPE_P (t))
5653 /* Like move_stmt_op, but for gimple statements.
5655 Helper for move_block_to_fn. Set GIMPLE_BLOCK in every expression
5656 contained in the current statement in *GSI_P and change the
5657 DECL_CONTEXT of every local variable referenced in the current
5661 move_stmt_r (gimple_stmt_iterator *gsi_p, bool *handled_ops_p,
5662 struct walk_stmt_info *wi)
5664 struct move_stmt_d *p = (struct move_stmt_d *) wi->info;
5665 gimple stmt = gsi_stmt (*gsi_p);
5666 tree block = gimple_block (stmt);
5668 if (p->orig_block == NULL_TREE
5669 || block == p->orig_block
5670 || block == NULL_TREE)
5671 gimple_set_block (stmt, p->new_block);
5672 #ifdef ENABLE_CHECKING
5673 else if (block != p->new_block)
5675 while (block && block != p->orig_block)
5676 block = BLOCK_SUPERCONTEXT (block);
5681 if (is_gimple_omp (stmt)
5682 && gimple_code (stmt) != GIMPLE_OMP_RETURN
5683 && gimple_code (stmt) != GIMPLE_OMP_CONTINUE)
5685 /* Do not remap variables inside OMP directives. Variables
5686 referenced in clauses and directive header belong to the
5687 parent function and should not be moved into the child
5689 bool save_remap_decls_p = p->remap_decls_p;
5690 p->remap_decls_p = false;
5691 *handled_ops_p = true;
5693 walk_gimple_seq (gimple_omp_body (stmt), move_stmt_r, move_stmt_op, wi);
5695 p->remap_decls_p = save_remap_decls_p;
5701 /* Marks virtual operands of all statements in basic blocks BBS for
5705 mark_virtual_ops_in_bb (basic_block bb)
5707 gimple_stmt_iterator gsi;
5709 for (gsi = gsi_start_phis (bb); !gsi_end_p (gsi); gsi_next (&gsi))
5710 mark_virtual_ops_for_renaming (gsi_stmt (gsi));
5712 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
5713 mark_virtual_ops_for_renaming (gsi_stmt (gsi));
5716 /* Move basic block BB from function CFUN to function DEST_FN. The
5717 block is moved out of the original linked list and placed after
5718 block AFTER in the new list. Also, the block is removed from the
5719 original array of blocks and placed in DEST_FN's array of blocks.
5720 If UPDATE_EDGE_COUNT_P is true, the edge counts on both CFGs is
5721 updated to reflect the moved edges.
5723 The local variables are remapped to new instances, VARS_MAP is used
5724 to record the mapping. */
5727 move_block_to_fn (struct function *dest_cfun, basic_block bb,
5728 basic_block after, bool update_edge_count_p,
5729 struct move_stmt_d *d, int eh_offset)
5731 struct control_flow_graph *cfg;
5734 gimple_stmt_iterator si;
5735 unsigned old_len, new_len;
5737 /* Remove BB from dominance structures. */
5738 delete_from_dominance_info (CDI_DOMINATORS, bb);
5740 remove_bb_from_loops (bb);
5742 /* Link BB to the new linked list. */
5743 move_block_after (bb, after);
5745 /* Update the edge count in the corresponding flowgraphs. */
5746 if (update_edge_count_p)
5747 FOR_EACH_EDGE (e, ei, bb->succs)
5749 cfun->cfg->x_n_edges--;
5750 dest_cfun->cfg->x_n_edges++;
5753 /* Remove BB from the original basic block array. */
5754 VEC_replace (basic_block, cfun->cfg->x_basic_block_info, bb->index, NULL);
5755 cfun->cfg->x_n_basic_blocks--;
5757 /* Grow DEST_CFUN's basic block array if needed. */
5758 cfg = dest_cfun->cfg;
5759 cfg->x_n_basic_blocks++;
5760 if (bb->index >= cfg->x_last_basic_block)
5761 cfg->x_last_basic_block = bb->index + 1;
5763 old_len = VEC_length (basic_block, cfg->x_basic_block_info);
5764 if ((unsigned) cfg->x_last_basic_block >= old_len)
5766 new_len = cfg->x_last_basic_block + (cfg->x_last_basic_block + 3) / 4;
5767 VEC_safe_grow_cleared (basic_block, gc, cfg->x_basic_block_info,
5771 VEC_replace (basic_block, cfg->x_basic_block_info,
5774 /* Remap the variables in phi nodes. */
5775 for (si = gsi_start_phis (bb); !gsi_end_p (si); )
5777 gimple phi = gsi_stmt (si);
5779 tree op = PHI_RESULT (phi);
5782 if (!is_gimple_reg (op))
5784 /* Remove the phi nodes for virtual operands (alias analysis will be
5785 run for the new function, anyway). */
5786 remove_phi_node (&si, true);
5790 SET_PHI_RESULT (phi,
5791 replace_ssa_name (op, d->vars_map, dest_cfun->decl));
5792 FOR_EACH_PHI_ARG (use, phi, oi, SSA_OP_USE)
5794 op = USE_FROM_PTR (use);
5795 if (TREE_CODE (op) == SSA_NAME)
5796 SET_USE (use, replace_ssa_name (op, d->vars_map, dest_cfun->decl));
5802 for (si = gsi_start_bb (bb); !gsi_end_p (si); gsi_next (&si))
5804 gimple stmt = gsi_stmt (si);
5806 struct walk_stmt_info wi;
5808 memset (&wi, 0, sizeof (wi));
5810 walk_gimple_stmt (&si, move_stmt_r, move_stmt_op, &wi);
5812 if (gimple_code (stmt) == GIMPLE_LABEL)
5814 tree label = gimple_label_label (stmt);
5815 int uid = LABEL_DECL_UID (label);
5817 gcc_assert (uid > -1);
5819 old_len = VEC_length (basic_block, cfg->x_label_to_block_map);
5820 if (old_len <= (unsigned) uid)
5822 new_len = 3 * uid / 2 + 1;
5823 VEC_safe_grow_cleared (basic_block, gc,
5824 cfg->x_label_to_block_map, new_len);
5827 VEC_replace (basic_block, cfg->x_label_to_block_map, uid, bb);
5828 VEC_replace (basic_block, cfun->cfg->x_label_to_block_map, uid, NULL);
5830 gcc_assert (DECL_CONTEXT (label) == dest_cfun->decl);
5832 if (uid >= dest_cfun->cfg->last_label_uid)
5833 dest_cfun->cfg->last_label_uid = uid + 1;
5835 else if (gimple_code (stmt) == GIMPLE_RESX && eh_offset != 0)
5836 gimple_resx_set_region (stmt, gimple_resx_region (stmt) + eh_offset);
5838 region = lookup_stmt_eh_region (stmt);
5841 add_stmt_to_eh_region_fn (dest_cfun, stmt, region + eh_offset);
5842 remove_stmt_from_eh_region (stmt);
5843 gimple_duplicate_stmt_histograms (dest_cfun, stmt, cfun, stmt);
5844 gimple_remove_stmt_histograms (cfun, stmt);
5847 /* We cannot leave any operands allocated from the operand caches of
5848 the current function. */
5849 free_stmt_operands (stmt);
5850 push_cfun (dest_cfun);
5855 FOR_EACH_EDGE (e, ei, bb->succs)
5858 tree block = e->goto_block;
5859 if (d->orig_block == NULL_TREE
5860 || block == d->orig_block)
5861 e->goto_block = d->new_block;
5862 #ifdef ENABLE_CHECKING
5863 else if (block != d->new_block)
5865 while (block && block != d->orig_block)
5866 block = BLOCK_SUPERCONTEXT (block);
5873 /* Examine the statements in BB (which is in SRC_CFUN); find and return
5874 the outermost EH region. Use REGION as the incoming base EH region. */
5877 find_outermost_region_in_block (struct function *src_cfun,
5878 basic_block bb, int region)
5880 gimple_stmt_iterator si;
5882 for (si = gsi_start_bb (bb); !gsi_end_p (si); gsi_next (&si))
5884 gimple stmt = gsi_stmt (si);
5887 if (gimple_code (stmt) == GIMPLE_RESX)
5888 stmt_region = gimple_resx_region (stmt);
5890 stmt_region = lookup_stmt_eh_region_fn (src_cfun, stmt);
5891 if (stmt_region > 0)
5894 region = stmt_region;
5895 else if (stmt_region != region)
5897 region = eh_region_outermost (src_cfun, stmt_region, region);
5898 gcc_assert (region != -1);
5907 new_label_mapper (tree decl, void *data)
5909 htab_t hash = (htab_t) data;
5913 gcc_assert (TREE_CODE (decl) == LABEL_DECL);
5915 m = XNEW (struct tree_map);
5916 m->hash = DECL_UID (decl);
5917 m->base.from = decl;
5918 m->to = create_artificial_label ();
5919 LABEL_DECL_UID (m->to) = LABEL_DECL_UID (decl);
5920 if (LABEL_DECL_UID (m->to) >= cfun->cfg->last_label_uid)
5921 cfun->cfg->last_label_uid = LABEL_DECL_UID (m->to) + 1;
5923 slot = htab_find_slot_with_hash (hash, m, m->hash, INSERT);
5924 gcc_assert (*slot == NULL);
5931 /* Change DECL_CONTEXT of all BLOCK_VARS in block, including
5935 replace_block_vars_by_duplicates (tree block, struct pointer_map_t *vars_map,
5940 for (tp = &BLOCK_VARS (block); *tp; tp = &TREE_CHAIN (*tp))
5943 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != CONST_DECL)
5945 replace_by_duplicate_decl (&t, vars_map, to_context);
5948 if (TREE_CODE (*tp) == VAR_DECL && DECL_HAS_VALUE_EXPR_P (*tp))
5950 SET_DECL_VALUE_EXPR (t, DECL_VALUE_EXPR (*tp));
5951 DECL_HAS_VALUE_EXPR_P (t) = 1;
5953 TREE_CHAIN (t) = TREE_CHAIN (*tp);
5958 for (block = BLOCK_SUBBLOCKS (block); block; block = BLOCK_CHAIN (block))
5959 replace_block_vars_by_duplicates (block, vars_map, to_context);
5962 /* Move a single-entry, single-exit region delimited by ENTRY_BB and
5963 EXIT_BB to function DEST_CFUN. The whole region is replaced by a
5964 single basic block in the original CFG and the new basic block is
5965 returned. DEST_CFUN must not have a CFG yet.
5967 Note that the region need not be a pure SESE region. Blocks inside
5968 the region may contain calls to abort/exit. The only restriction
5969 is that ENTRY_BB should be the only entry point and it must
5972 Change TREE_BLOCK of all statements in ORIG_BLOCK to the new
5973 functions outermost BLOCK, move all subblocks of ORIG_BLOCK
5974 to the new function.
5976 All local variables referenced in the region are assumed to be in
5977 the corresponding BLOCK_VARS and unexpanded variable lists
5978 associated with DEST_CFUN. */
5981 move_sese_region_to_fn (struct function *dest_cfun, basic_block entry_bb,
5982 basic_block exit_bb, tree orig_block)
5984 VEC(basic_block,heap) *bbs, *dom_bbs;
5985 basic_block dom_entry = get_immediate_dominator (CDI_DOMINATORS, entry_bb);
5986 basic_block after, bb, *entry_pred, *exit_succ, abb;
5987 struct function *saved_cfun = cfun;
5988 int *entry_flag, *exit_flag, eh_offset;
5989 unsigned *entry_prob, *exit_prob;
5990 unsigned i, num_entry_edges, num_exit_edges;
5993 htab_t new_label_map;
5994 struct pointer_map_t *vars_map;
5995 struct loop *loop = entry_bb->loop_father;
5996 struct move_stmt_d d;
5998 /* If ENTRY does not strictly dominate EXIT, this cannot be an SESE
6000 gcc_assert (entry_bb != exit_bb
6002 || dominated_by_p (CDI_DOMINATORS, exit_bb, entry_bb)));
6004 /* Collect all the blocks in the region. Manually add ENTRY_BB
6005 because it won't be added by dfs_enumerate_from. */
6007 VEC_safe_push (basic_block, heap, bbs, entry_bb);
6008 gather_blocks_in_sese_region (entry_bb, exit_bb, &bbs);
6010 /* The blocks that used to be dominated by something in BBS will now be
6011 dominated by the new block. */
6012 dom_bbs = get_dominated_by_region (CDI_DOMINATORS,
6013 VEC_address (basic_block, bbs),
6014 VEC_length (basic_block, bbs));
6016 /* Detach ENTRY_BB and EXIT_BB from CFUN->CFG. We need to remember
6017 the predecessor edges to ENTRY_BB and the successor edges to
6018 EXIT_BB so that we can re-attach them to the new basic block that
6019 will replace the region. */
6020 num_entry_edges = EDGE_COUNT (entry_bb->preds);
6021 entry_pred = (basic_block *) xcalloc (num_entry_edges, sizeof (basic_block));
6022 entry_flag = (int *) xcalloc (num_entry_edges, sizeof (int));
6023 entry_prob = XNEWVEC (unsigned, num_entry_edges);
6025 for (ei = ei_start (entry_bb->preds); (e = ei_safe_edge (ei)) != NULL;)
6027 entry_prob[i] = e->probability;
6028 entry_flag[i] = e->flags;
6029 entry_pred[i++] = e->src;
6035 num_exit_edges = EDGE_COUNT (exit_bb->succs);
6036 exit_succ = (basic_block *) xcalloc (num_exit_edges,
6037 sizeof (basic_block));
6038 exit_flag = (int *) xcalloc (num_exit_edges, sizeof (int));
6039 exit_prob = XNEWVEC (unsigned, num_exit_edges);
6041 for (ei = ei_start (exit_bb->succs); (e = ei_safe_edge (ei)) != NULL;)
6043 exit_prob[i] = e->probability;
6044 exit_flag[i] = e->flags;
6045 exit_succ[i++] = e->dest;
6057 /* Switch context to the child function to initialize DEST_FN's CFG. */
6058 gcc_assert (dest_cfun->cfg == NULL);
6059 push_cfun (dest_cfun);
6061 init_empty_tree_cfg ();
6063 /* Initialize EH information for the new function. */
6065 new_label_map = NULL;
6070 for (i = 0; VEC_iterate (basic_block, bbs, i, bb); i++)
6071 region = find_outermost_region_in_block (saved_cfun, bb, region);
6073 init_eh_for_function ();
6076 new_label_map = htab_create (17, tree_map_hash, tree_map_eq, free);
6077 eh_offset = duplicate_eh_regions (saved_cfun, new_label_mapper,
6078 new_label_map, region, 0);
6084 /* Move blocks from BBS into DEST_CFUN. */
6085 gcc_assert (VEC_length (basic_block, bbs) >= 2);
6086 after = dest_cfun->cfg->x_entry_block_ptr;
6087 vars_map = pointer_map_create ();
6089 memset (&d, 0, sizeof (d));
6090 d.vars_map = vars_map;
6091 d.from_context = cfun->decl;
6092 d.to_context = dest_cfun->decl;
6093 d.new_label_map = new_label_map;
6094 d.remap_decls_p = true;
6095 d.orig_block = orig_block;
6096 d.new_block = DECL_INITIAL (dest_cfun->decl);
6098 for (i = 0; VEC_iterate (basic_block, bbs, i, bb); i++)
6100 /* No need to update edge counts on the last block. It has
6101 already been updated earlier when we detached the region from
6102 the original CFG. */
6103 move_block_to_fn (dest_cfun, bb, after, bb != exit_bb, &d, eh_offset);
6107 /* Rewire BLOCK_SUBBLOCKS of orig_block. */
6111 gcc_assert (BLOCK_SUBBLOCKS (DECL_INITIAL (dest_cfun->decl))
6113 BLOCK_SUBBLOCKS (DECL_INITIAL (dest_cfun->decl))
6114 = BLOCK_SUBBLOCKS (orig_block);
6115 for (block = BLOCK_SUBBLOCKS (orig_block);
6116 block; block = BLOCK_CHAIN (block))
6117 BLOCK_SUPERCONTEXT (block) = DECL_INITIAL (dest_cfun->decl);
6118 BLOCK_SUBBLOCKS (orig_block) = NULL_TREE;
6121 replace_block_vars_by_duplicates (DECL_INITIAL (dest_cfun->decl),
6122 vars_map, dest_cfun->decl);
6125 htab_delete (new_label_map);
6126 pointer_map_destroy (vars_map);
6128 /* Rewire the entry and exit blocks. The successor to the entry
6129 block turns into the successor of DEST_FN's ENTRY_BLOCK_PTR in
6130 the child function. Similarly, the predecessor of DEST_FN's
6131 EXIT_BLOCK_PTR turns into the predecessor of EXIT_BLOCK_PTR. We
6132 need to switch CFUN between DEST_CFUN and SAVED_CFUN so that the
6133 various CFG manipulation function get to the right CFG.
6135 FIXME, this is silly. The CFG ought to become a parameter to
6137 push_cfun (dest_cfun);
6138 make_edge (ENTRY_BLOCK_PTR, entry_bb, EDGE_FALLTHRU);
6140 make_edge (exit_bb, EXIT_BLOCK_PTR, 0);
6143 /* Back in the original function, the SESE region has disappeared,
6144 create a new basic block in its place. */
6145 bb = create_empty_bb (entry_pred[0]);
6147 add_bb_to_loop (bb, loop);
6148 for (i = 0; i < num_entry_edges; i++)
6150 e = make_edge (entry_pred[i], bb, entry_flag[i]);
6151 e->probability = entry_prob[i];
6154 for (i = 0; i < num_exit_edges; i++)
6156 e = make_edge (bb, exit_succ[i], exit_flag[i]);
6157 e->probability = exit_prob[i];
6160 set_immediate_dominator (CDI_DOMINATORS, bb, dom_entry);
6161 for (i = 0; VEC_iterate (basic_block, dom_bbs, i, abb); i++)
6162 set_immediate_dominator (CDI_DOMINATORS, abb, bb);
6163 VEC_free (basic_block, heap, dom_bbs);
6174 VEC_free (basic_block, heap, bbs);
6180 /* Dump FUNCTION_DECL FN to file FILE using FLAGS (see TDF_* in tree-pass.h)
6184 dump_function_to_file (tree fn, FILE *file, int flags)
6186 tree arg, vars, var;
6187 struct function *dsf;
6188 bool ignore_topmost_bind = false, any_var = false;
6192 fprintf (file, "%s (", lang_hooks.decl_printable_name (fn, 2));
6194 arg = DECL_ARGUMENTS (fn);
6197 print_generic_expr (file, TREE_TYPE (arg), dump_flags);
6198 fprintf (file, " ");
6199 print_generic_expr (file, arg, dump_flags);
6200 if (flags & TDF_VERBOSE)
6201 print_node (file, "", arg, 4);
6202 if (TREE_CHAIN (arg))
6203 fprintf (file, ", ");
6204 arg = TREE_CHAIN (arg);
6206 fprintf (file, ")\n");
6208 if (flags & TDF_VERBOSE)
6209 print_node (file, "", fn, 2);
6211 dsf = DECL_STRUCT_FUNCTION (fn);
6212 if (dsf && (flags & TDF_DETAILS))
6213 dump_eh_tree (file, dsf);
6215 if (flags & TDF_RAW && !gimple_has_body_p (fn))
6217 dump_node (fn, TDF_SLIM | flags, file);
6221 /* Switch CFUN to point to FN. */
6222 push_cfun (DECL_STRUCT_FUNCTION (fn));
6224 /* When GIMPLE is lowered, the variables are no longer available in
6225 BIND_EXPRs, so display them separately. */
6226 if (cfun && cfun->decl == fn && cfun->local_decls)
6228 ignore_topmost_bind = true;
6230 fprintf (file, "{\n");
6231 for (vars = cfun->local_decls; vars; vars = TREE_CHAIN (vars))
6233 var = TREE_VALUE (vars);
6235 print_generic_decl (file, var, flags);
6236 if (flags & TDF_VERBOSE)
6237 print_node (file, "", var, 4);
6238 fprintf (file, "\n");
6244 if (cfun && cfun->decl == fn && cfun->cfg && basic_block_info)
6246 /* If the CFG has been built, emit a CFG-based dump. */
6247 check_bb_profile (ENTRY_BLOCK_PTR, file);
6248 if (!ignore_topmost_bind)
6249 fprintf (file, "{\n");
6251 if (any_var && n_basic_blocks)
6252 fprintf (file, "\n");
6255 gimple_dump_bb (bb, file, 2, flags);
6257 fprintf (file, "}\n");
6258 check_bb_profile (EXIT_BLOCK_PTR, file);
6260 else if (DECL_SAVED_TREE (fn) == NULL)
6262 /* The function is now in GIMPLE form but the CFG has not been
6263 built yet. Emit the single sequence of GIMPLE statements
6264 that make up its body. */
6265 gimple_seq body = gimple_body (fn);
6267 if (gimple_seq_first_stmt (body)
6268 && gimple_seq_first_stmt (body) == gimple_seq_last_stmt (body)
6269 && gimple_code (gimple_seq_first_stmt (body)) == GIMPLE_BIND)
6270 print_gimple_seq (file, body, 0, flags);
6273 if (!ignore_topmost_bind)
6274 fprintf (file, "{\n");
6277 fprintf (file, "\n");
6279 print_gimple_seq (file, body, 2, flags);
6280 fprintf (file, "}\n");
6287 /* Make a tree based dump. */
6288 chain = DECL_SAVED_TREE (fn);
6290 if (chain && TREE_CODE (chain) == BIND_EXPR)
6292 if (ignore_topmost_bind)
6294 chain = BIND_EXPR_BODY (chain);
6302 if (!ignore_topmost_bind)
6303 fprintf (file, "{\n");
6308 fprintf (file, "\n");
6310 print_generic_stmt_indented (file, chain, flags, indent);
6311 if (ignore_topmost_bind)
6312 fprintf (file, "}\n");
6315 fprintf (file, "\n\n");
6322 /* Dump FUNCTION_DECL FN to stderr using FLAGS (see TDF_* in tree.h) */
6325 debug_function (tree fn, int flags)
6327 dump_function_to_file (fn, stderr, flags);
6331 /* Print on FILE the indexes for the predecessors of basic_block BB. */
6334 print_pred_bbs (FILE *file, basic_block bb)
6339 FOR_EACH_EDGE (e, ei, bb->preds)
6340 fprintf (file, "bb_%d ", e->src->index);
6344 /* Print on FILE the indexes for the successors of basic_block BB. */
6347 print_succ_bbs (FILE *file, basic_block bb)
6352 FOR_EACH_EDGE (e, ei, bb->succs)
6353 fprintf (file, "bb_%d ", e->dest->index);
6356 /* Print to FILE the basic block BB following the VERBOSITY level. */
6359 print_loops_bb (FILE *file, basic_block bb, int indent, int verbosity)
6361 char *s_indent = (char *) alloca ((size_t) indent + 1);
6362 memset ((void *) s_indent, ' ', (size_t) indent);
6363 s_indent[indent] = '\0';
6365 /* Print basic_block's header. */
6368 fprintf (file, "%s bb_%d (preds = {", s_indent, bb->index);
6369 print_pred_bbs (file, bb);
6370 fprintf (file, "}, succs = {");
6371 print_succ_bbs (file, bb);
6372 fprintf (file, "})\n");
6375 /* Print basic_block's body. */
6378 fprintf (file, "%s {\n", s_indent);
6379 gimple_dump_bb (bb, file, indent + 4, TDF_VOPS|TDF_MEMSYMS);
6380 fprintf (file, "%s }\n", s_indent);
6384 static void print_loop_and_siblings (FILE *, struct loop *, int, int);
6386 /* Pretty print LOOP on FILE, indented INDENT spaces. Following
6387 VERBOSITY level this outputs the contents of the loop, or just its
6391 print_loop (FILE *file, struct loop *loop, int indent, int verbosity)
6399 s_indent = (char *) alloca ((size_t) indent + 1);
6400 memset ((void *) s_indent, ' ', (size_t) indent);
6401 s_indent[indent] = '\0';
6403 /* Print loop's header. */
6404 fprintf (file, "%sloop_%d (header = %d, latch = %d", s_indent,
6405 loop->num, loop->header->index, loop->latch->index);
6406 fprintf (file, ", niter = ");
6407 print_generic_expr (file, loop->nb_iterations, 0);
6409 if (loop->any_upper_bound)
6411 fprintf (file, ", upper_bound = ");
6412 dump_double_int (file, loop->nb_iterations_upper_bound, true);
6415 if (loop->any_estimate)
6417 fprintf (file, ", estimate = ");
6418 dump_double_int (file, loop->nb_iterations_estimate, true);
6420 fprintf (file, ")\n");
6422 /* Print loop's body. */
6425 fprintf (file, "%s{\n", s_indent);
6427 if (bb->loop_father == loop)
6428 print_loops_bb (file, bb, indent, verbosity);
6430 print_loop_and_siblings (file, loop->inner, indent + 2, verbosity);
6431 fprintf (file, "%s}\n", s_indent);
6435 /* Print the LOOP and its sibling loops on FILE, indented INDENT
6436 spaces. Following VERBOSITY level this outputs the contents of the
6437 loop, or just its structure. */
6440 print_loop_and_siblings (FILE *file, struct loop *loop, int indent, int verbosity)
6445 print_loop (file, loop, indent, verbosity);
6446 print_loop_and_siblings (file, loop->next, indent, verbosity);
6449 /* Follow a CFG edge from the entry point of the program, and on entry
6450 of a loop, pretty print the loop structure on FILE. */
6453 print_loops (FILE *file, int verbosity)
6457 bb = ENTRY_BLOCK_PTR;
6458 if (bb && bb->loop_father)
6459 print_loop_and_siblings (file, bb->loop_father, 0, verbosity);
6463 /* Debugging loops structure at tree level, at some VERBOSITY level. */
6466 debug_loops (int verbosity)
6468 print_loops (stderr, verbosity);
6471 /* Print on stderr the code of LOOP, at some VERBOSITY level. */
6474 debug_loop (struct loop *loop, int verbosity)
6476 print_loop (stderr, loop, 0, verbosity);
6479 /* Print on stderr the code of loop number NUM, at some VERBOSITY
6483 debug_loop_num (unsigned num, int verbosity)
6485 debug_loop (get_loop (num), verbosity);
6488 /* Return true if BB ends with a call, possibly followed by some
6489 instructions that must stay with the call. Return false,
6493 gimple_block_ends_with_call_p (basic_block bb)
6495 gimple_stmt_iterator gsi = gsi_last_bb (bb);
6496 return is_gimple_call (gsi_stmt (gsi));
6500 /* Return true if BB ends with a conditional branch. Return false,
6504 gimple_block_ends_with_condjump_p (const_basic_block bb)
6506 gimple stmt = last_stmt (CONST_CAST_BB (bb));
6507 return (stmt && gimple_code (stmt) == GIMPLE_COND);
6511 /* Return true if we need to add fake edge to exit at statement T.
6512 Helper function for gimple_flow_call_edges_add. */
6515 need_fake_edge_p (gimple t)
6517 tree fndecl = NULL_TREE;
6520 /* NORETURN and LONGJMP calls already have an edge to exit.
6521 CONST and PURE calls do not need one.
6522 We don't currently check for CONST and PURE here, although
6523 it would be a good idea, because those attributes are
6524 figured out from the RTL in mark_constant_function, and
6525 the counter incrementation code from -fprofile-arcs
6526 leads to different results from -fbranch-probabilities. */
6527 if (is_gimple_call (t))
6529 fndecl = gimple_call_fndecl (t);
6530 call_flags = gimple_call_flags (t);
6533 if (is_gimple_call (t)
6535 && DECL_BUILT_IN (fndecl)
6536 && (call_flags & ECF_NOTHROW)
6537 && !(call_flags & ECF_RETURNS_TWICE)
6538 /* fork() doesn't really return twice, but the effect of
6539 wrapping it in __gcov_fork() which calls __gcov_flush()
6540 and clears the counters before forking has the same
6541 effect as returning twice. Force a fake edge. */
6542 && !(DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_NORMAL
6543 && DECL_FUNCTION_CODE (fndecl) == BUILT_IN_FORK))
6546 if (is_gimple_call (t)
6547 && !(call_flags & ECF_NORETURN))
6550 if (gimple_code (t) == GIMPLE_ASM
6551 && (gimple_asm_volatile_p (t) || gimple_asm_input_p (t)))
6558 /* Add fake edges to the function exit for any non constant and non
6559 noreturn calls, volatile inline assembly in the bitmap of blocks
6560 specified by BLOCKS or to the whole CFG if BLOCKS is zero. Return
6561 the number of blocks that were split.
6563 The goal is to expose cases in which entering a basic block does
6564 not imply that all subsequent instructions must be executed. */
6567 gimple_flow_call_edges_add (sbitmap blocks)
6570 int blocks_split = 0;
6571 int last_bb = last_basic_block;
6572 bool check_last_block = false;
6574 if (n_basic_blocks == NUM_FIXED_BLOCKS)
6578 check_last_block = true;
6580 check_last_block = TEST_BIT (blocks, EXIT_BLOCK_PTR->prev_bb->index);
6582 /* In the last basic block, before epilogue generation, there will be
6583 a fallthru edge to EXIT. Special care is required if the last insn
6584 of the last basic block is a call because make_edge folds duplicate
6585 edges, which would result in the fallthru edge also being marked
6586 fake, which would result in the fallthru edge being removed by
6587 remove_fake_edges, which would result in an invalid CFG.
6589 Moreover, we can't elide the outgoing fake edge, since the block
6590 profiler needs to take this into account in order to solve the minimal
6591 spanning tree in the case that the call doesn't return.
6593 Handle this by adding a dummy instruction in a new last basic block. */
6594 if (check_last_block)
6596 basic_block bb = EXIT_BLOCK_PTR->prev_bb;
6597 gimple_stmt_iterator gsi = gsi_last_bb (bb);
6600 if (!gsi_end_p (gsi))
6603 if (t && need_fake_edge_p (t))
6607 e = find_edge (bb, EXIT_BLOCK_PTR);
6610 gsi_insert_on_edge (e, gimple_build_nop ());
6611 gsi_commit_edge_inserts ();
6616 /* Now add fake edges to the function exit for any non constant
6617 calls since there is no way that we can determine if they will
6619 for (i = 0; i < last_bb; i++)
6621 basic_block bb = BASIC_BLOCK (i);
6622 gimple_stmt_iterator gsi;
6623 gimple stmt, last_stmt;
6628 if (blocks && !TEST_BIT (blocks, i))
6631 gsi = gsi_last_bb (bb);
6632 if (!gsi_end_p (gsi))
6634 last_stmt = gsi_stmt (gsi);
6637 stmt = gsi_stmt (gsi);
6638 if (need_fake_edge_p (stmt))
6642 /* The handling above of the final block before the
6643 epilogue should be enough to verify that there is
6644 no edge to the exit block in CFG already.
6645 Calling make_edge in such case would cause us to
6646 mark that edge as fake and remove it later. */
6647 #ifdef ENABLE_CHECKING
6648 if (stmt == last_stmt)
6650 e = find_edge (bb, EXIT_BLOCK_PTR);
6651 gcc_assert (e == NULL);
6655 /* Note that the following may create a new basic block
6656 and renumber the existing basic blocks. */
6657 if (stmt != last_stmt)
6659 e = split_block (bb, stmt);
6663 make_edge (bb, EXIT_BLOCK_PTR, EDGE_FAKE);
6667 while (!gsi_end_p (gsi));
6672 verify_flow_info ();
6674 return blocks_split;
6677 /* Purge dead abnormal call edges from basic block BB. */
6680 gimple_purge_dead_abnormal_call_edges (basic_block bb)
6682 bool changed = gimple_purge_dead_eh_edges (bb);
6684 if (cfun->has_nonlocal_label)
6686 gimple stmt = last_stmt (bb);
6690 if (!(stmt && stmt_can_make_abnormal_goto (stmt)))
6691 for (ei = ei_start (bb->succs); (e = ei_safe_edge (ei)); )
6693 if (e->flags & EDGE_ABNORMAL)
6702 /* See gimple_purge_dead_eh_edges below. */
6704 free_dominance_info (CDI_DOMINATORS);
6710 /* Removes edge E and all the blocks dominated by it, and updates dominance
6711 information. The IL in E->src needs to be updated separately.
6712 If dominance info is not available, only the edge E is removed.*/
6715 remove_edge_and_dominated_blocks (edge e)
6717 VEC (basic_block, heap) *bbs_to_remove = NULL;
6718 VEC (basic_block, heap) *bbs_to_fix_dom = NULL;
6722 bool none_removed = false;
6724 basic_block bb, dbb;
6727 if (!dom_info_available_p (CDI_DOMINATORS))
6733 /* No updating is needed for edges to exit. */
6734 if (e->dest == EXIT_BLOCK_PTR)
6736 if (cfgcleanup_altered_bbs)
6737 bitmap_set_bit (cfgcleanup_altered_bbs, e->src->index);
6742 /* First, we find the basic blocks to remove. If E->dest has a predecessor
6743 that is not dominated by E->dest, then this set is empty. Otherwise,
6744 all the basic blocks dominated by E->dest are removed.
6746 Also, to DF_IDOM we store the immediate dominators of the blocks in
6747 the dominance frontier of E (i.e., of the successors of the
6748 removed blocks, if there are any, and of E->dest otherwise). */
6749 FOR_EACH_EDGE (f, ei, e->dest->preds)
6754 if (!dominated_by_p (CDI_DOMINATORS, f->src, e->dest))
6756 none_removed = true;
6761 df = BITMAP_ALLOC (NULL);
6762 df_idom = BITMAP_ALLOC (NULL);
6765 bitmap_set_bit (df_idom,
6766 get_immediate_dominator (CDI_DOMINATORS, e->dest)->index);
6769 bbs_to_remove = get_all_dominated_blocks (CDI_DOMINATORS, e->dest);
6770 for (i = 0; VEC_iterate (basic_block, bbs_to_remove, i, bb); i++)
6772 FOR_EACH_EDGE (f, ei, bb->succs)
6774 if (f->dest != EXIT_BLOCK_PTR)
6775 bitmap_set_bit (df, f->dest->index);
6778 for (i = 0; VEC_iterate (basic_block, bbs_to_remove, i, bb); i++)
6779 bitmap_clear_bit (df, bb->index);
6781 EXECUTE_IF_SET_IN_BITMAP (df, 0, i, bi)
6783 bb = BASIC_BLOCK (i);
6784 bitmap_set_bit (df_idom,
6785 get_immediate_dominator (CDI_DOMINATORS, bb)->index);
6789 if (cfgcleanup_altered_bbs)
6791 /* Record the set of the altered basic blocks. */
6792 bitmap_set_bit (cfgcleanup_altered_bbs, e->src->index);
6793 bitmap_ior_into (cfgcleanup_altered_bbs, df);
6796 /* Remove E and the cancelled blocks. */
6801 for (i = 0; VEC_iterate (basic_block, bbs_to_remove, i, bb); i++)
6802 delete_basic_block (bb);
6805 /* Update the dominance information. The immediate dominator may change only
6806 for blocks whose immediate dominator belongs to DF_IDOM:
6808 Suppose that idom(X) = Y before removal of E and idom(X) != Y after the
6809 removal. Let Z the arbitrary block such that idom(Z) = Y and
6810 Z dominates X after the removal. Before removal, there exists a path P
6811 from Y to X that avoids Z. Let F be the last edge on P that is
6812 removed, and let W = F->dest. Before removal, idom(W) = Y (since Y
6813 dominates W, and because of P, Z does not dominate W), and W belongs to
6814 the dominance frontier of E. Therefore, Y belongs to DF_IDOM. */
6815 EXECUTE_IF_SET_IN_BITMAP (df_idom, 0, i, bi)
6817 bb = BASIC_BLOCK (i);
6818 for (dbb = first_dom_son (CDI_DOMINATORS, bb);
6820 dbb = next_dom_son (CDI_DOMINATORS, dbb))
6821 VEC_safe_push (basic_block, heap, bbs_to_fix_dom, dbb);
6824 iterate_fix_dominators (CDI_DOMINATORS, bbs_to_fix_dom, true);
6827 BITMAP_FREE (df_idom);
6828 VEC_free (basic_block, heap, bbs_to_remove);
6829 VEC_free (basic_block, heap, bbs_to_fix_dom);
6832 /* Purge dead EH edges from basic block BB. */
6835 gimple_purge_dead_eh_edges (basic_block bb)
6837 bool changed = false;
6840 gimple stmt = last_stmt (bb);
6842 if (stmt && stmt_can_throw_internal (stmt))
6845 for (ei = ei_start (bb->succs); (e = ei_safe_edge (ei)); )
6847 if (e->flags & EDGE_EH)
6849 remove_edge_and_dominated_blocks (e);
6860 gimple_purge_all_dead_eh_edges (const_bitmap blocks)
6862 bool changed = false;
6866 EXECUTE_IF_SET_IN_BITMAP (blocks, 0, i, bi)
6868 basic_block bb = BASIC_BLOCK (i);
6870 /* Earlier gimple_purge_dead_eh_edges could have removed
6871 this basic block already. */
6872 gcc_assert (bb || changed);
6874 changed |= gimple_purge_dead_eh_edges (bb);
6880 /* This function is called whenever a new edge is created or
6884 gimple_execute_on_growing_pred (edge e)
6886 basic_block bb = e->dest;
6889 reserve_phi_args_for_new_edge (bb);
6892 /* This function is called immediately before edge E is removed from
6893 the edge vector E->dest->preds. */
6896 gimple_execute_on_shrinking_pred (edge e)
6898 if (phi_nodes (e->dest))
6899 remove_phi_args (e);
6902 /*---------------------------------------------------------------------------
6903 Helper functions for Loop versioning
6904 ---------------------------------------------------------------------------*/
6906 /* Adjust phi nodes for 'first' basic block. 'second' basic block is a copy
6907 of 'first'. Both of them are dominated by 'new_head' basic block. When
6908 'new_head' was created by 'second's incoming edge it received phi arguments
6909 on the edge by split_edge(). Later, additional edge 'e' was created to
6910 connect 'new_head' and 'first'. Now this routine adds phi args on this
6911 additional edge 'e' that new_head to second edge received as part of edge
6915 gimple_lv_adjust_loop_header_phi (basic_block first, basic_block second,
6916 basic_block new_head, edge e)
6919 gimple_stmt_iterator psi1, psi2;
6921 edge e2 = find_edge (new_head, second);
6923 /* Because NEW_HEAD has been created by splitting SECOND's incoming
6924 edge, we should always have an edge from NEW_HEAD to SECOND. */
6925 gcc_assert (e2 != NULL);
6927 /* Browse all 'second' basic block phi nodes and add phi args to
6928 edge 'e' for 'first' head. PHI args are always in correct order. */
6930 for (psi2 = gsi_start_phis (second),
6931 psi1 = gsi_start_phis (first);
6932 !gsi_end_p (psi2) && !gsi_end_p (psi1);
6933 gsi_next (&psi2), gsi_next (&psi1))
6935 phi1 = gsi_stmt (psi1);
6936 phi2 = gsi_stmt (psi2);
6937 def = PHI_ARG_DEF (phi2, e2->dest_idx);
6938 add_phi_arg (phi1, def, e);
6943 /* Adds a if else statement to COND_BB with condition COND_EXPR.
6944 SECOND_HEAD is the destination of the THEN and FIRST_HEAD is
6945 the destination of the ELSE part. */
6948 gimple_lv_add_condition_to_bb (basic_block first_head ATTRIBUTE_UNUSED,
6949 basic_block second_head ATTRIBUTE_UNUSED,
6950 basic_block cond_bb, void *cond_e)
6952 gimple_stmt_iterator gsi;
6953 gimple new_cond_expr;
6954 tree cond_expr = (tree) cond_e;
6957 /* Build new conditional expr */
6958 new_cond_expr = gimple_build_cond_from_tree (cond_expr,
6959 NULL_TREE, NULL_TREE);
6961 /* Add new cond in cond_bb. */
6962 gsi = gsi_last_bb (cond_bb);
6963 gsi_insert_after (&gsi, new_cond_expr, GSI_NEW_STMT);
6965 /* Adjust edges appropriately to connect new head with first head
6966 as well as second head. */
6967 e0 = single_succ_edge (cond_bb);
6968 e0->flags &= ~EDGE_FALLTHRU;
6969 e0->flags |= EDGE_FALSE_VALUE;
6972 struct cfg_hooks gimple_cfg_hooks = {
6974 gimple_verify_flow_info,
6975 gimple_dump_bb, /* dump_bb */
6976 create_bb, /* create_basic_block */
6977 gimple_redirect_edge_and_branch, /* redirect_edge_and_branch */
6978 gimple_redirect_edge_and_branch_force, /* redirect_edge_and_branch_force */
6979 gimple_can_remove_branch_p, /* can_remove_branch_p */
6980 remove_bb, /* delete_basic_block */
6981 gimple_split_block, /* split_block */
6982 gimple_move_block_after, /* move_block_after */
6983 gimple_can_merge_blocks_p, /* can_merge_blocks_p */
6984 gimple_merge_blocks, /* merge_blocks */
6985 gimple_predict_edge, /* predict_edge */
6986 gimple_predicted_by_p, /* predicted_by_p */
6987 gimple_can_duplicate_bb_p, /* can_duplicate_block_p */
6988 gimple_duplicate_bb, /* duplicate_block */
6989 gimple_split_edge, /* split_edge */
6990 gimple_make_forwarder_block, /* make_forward_block */
6991 NULL, /* tidy_fallthru_edge */
6992 gimple_block_ends_with_call_p,/* block_ends_with_call_p */
6993 gimple_block_ends_with_condjump_p, /* block_ends_with_condjump_p */
6994 gimple_flow_call_edges_add, /* flow_call_edges_add */
6995 gimple_execute_on_growing_pred, /* execute_on_growing_pred */
6996 gimple_execute_on_shrinking_pred, /* execute_on_shrinking_pred */
6997 gimple_duplicate_loop_to_header_edge, /* duplicate loop for trees */
6998 gimple_lv_add_condition_to_bb, /* lv_add_condition_to_bb */
6999 gimple_lv_adjust_loop_header_phi, /* lv_adjust_loop_header_phi*/
7000 extract_true_false_edges_from_block, /* extract_cond_bb_edges */
7001 flush_pending_stmts /* flush_pending_stmts */
7005 /* Split all critical edges. */
7008 split_critical_edges (void)
7014 /* split_edge can redirect edges out of SWITCH_EXPRs, which can get
7015 expensive. So we want to enable recording of edge to CASE_LABEL_EXPR
7016 mappings around the calls to split_edge. */
7017 start_recording_case_labels ();
7020 FOR_EACH_EDGE (e, ei, bb->succs)
7022 if (EDGE_CRITICAL_P (e) && !(e->flags & EDGE_ABNORMAL))
7024 /* PRE inserts statements to edges and expects that
7025 since split_critical_edges was done beforehand, committing edge
7026 insertions will not split more edges. In addition to critical
7027 edges we must split edges that have multiple successors and
7028 end by control flow statements, such as RESX.
7029 Go ahead and split them too. This matches the logic in
7030 gimple_find_edge_insert_loc. */
7031 else if ((!single_pred_p (e->dest)
7032 || phi_nodes (e->dest)
7033 || e->dest == EXIT_BLOCK_PTR)
7034 && e->src != ENTRY_BLOCK_PTR
7035 && !(e->flags & EDGE_ABNORMAL))
7037 gimple_stmt_iterator gsi;
7039 gsi = gsi_last_bb (e->src);
7040 if (!gsi_end_p (gsi)
7041 && stmt_ends_bb_p (gsi_stmt (gsi))
7042 && gimple_code (gsi_stmt (gsi)) != GIMPLE_RETURN)
7047 end_recording_case_labels ();
7051 struct gimple_opt_pass pass_split_crit_edges =
7055 "crited", /* name */
7057 split_critical_edges, /* execute */
7060 0, /* static_pass_number */
7061 TV_TREE_SPLIT_EDGES, /* tv_id */
7062 PROP_cfg, /* properties required */
7063 PROP_no_crit_edges, /* properties_provided */
7064 0, /* properties_destroyed */
7065 0, /* todo_flags_start */
7066 TODO_dump_func /* todo_flags_finish */
7071 /* Build a ternary operation and gimplify it. Emit code before GSI.
7072 Return the gimple_val holding the result. */
7075 gimplify_build3 (gimple_stmt_iterator *gsi, enum tree_code code,
7076 tree type, tree a, tree b, tree c)
7080 ret = fold_build3 (code, type, a, b, c);
7083 return force_gimple_operand_gsi (gsi, ret, true, NULL, true,
7087 /* Build a binary operation and gimplify it. Emit code before GSI.
7088 Return the gimple_val holding the result. */
7091 gimplify_build2 (gimple_stmt_iterator *gsi, enum tree_code code,
7092 tree type, tree a, tree b)
7096 ret = fold_build2 (code, type, a, b);
7099 return force_gimple_operand_gsi (gsi, ret, true, NULL, true,
7103 /* Build a unary operation and gimplify it. Emit code before GSI.
7104 Return the gimple_val holding the result. */
7107 gimplify_build1 (gimple_stmt_iterator *gsi, enum tree_code code, tree type,
7112 ret = fold_build1 (code, type, a);
7115 return force_gimple_operand_gsi (gsi, ret, true, NULL, true,
7121 /* Emit return warnings. */
7124 execute_warn_function_return (void)
7126 source_location location;
7131 /* If we have a path to EXIT, then we do return. */
7132 if (TREE_THIS_VOLATILE (cfun->decl)
7133 && EDGE_COUNT (EXIT_BLOCK_PTR->preds) > 0)
7135 location = UNKNOWN_LOCATION;
7136 FOR_EACH_EDGE (e, ei, EXIT_BLOCK_PTR->preds)
7138 last = last_stmt (e->src);
7139 if (gimple_code (last) == GIMPLE_RETURN
7140 && (location = gimple_location (last)) != UNKNOWN_LOCATION)
7143 if (location == UNKNOWN_LOCATION)
7144 location = cfun->function_end_locus;
7145 warning (0, "%H%<noreturn%> function does return", &location);
7148 /* If we see "return;" in some basic block, then we do reach the end
7149 without returning a value. */
7150 else if (warn_return_type
7151 && !TREE_NO_WARNING (cfun->decl)
7152 && EDGE_COUNT (EXIT_BLOCK_PTR->preds) > 0
7153 && !VOID_TYPE_P (TREE_TYPE (TREE_TYPE (cfun->decl))))
7155 FOR_EACH_EDGE (e, ei, EXIT_BLOCK_PTR->preds)
7157 gimple last = last_stmt (e->src);
7158 if (gimple_code (last) == GIMPLE_RETURN
7159 && gimple_return_retval (last) == NULL
7160 && !gimple_no_warning_p (last))
7162 location = gimple_location (last);
7163 if (location == UNKNOWN_LOCATION)
7164 location = cfun->function_end_locus;
7165 warning_at (location, OPT_Wreturn_type, "control reaches end of non-void function");
7166 TREE_NO_WARNING (cfun->decl) = 1;
7175 /* Given a basic block B which ends with a conditional and has
7176 precisely two successors, determine which of the edges is taken if
7177 the conditional is true and which is taken if the conditional is
7178 false. Set TRUE_EDGE and FALSE_EDGE appropriately. */
7181 extract_true_false_edges_from_block (basic_block b,
7185 edge e = EDGE_SUCC (b, 0);
7187 if (e->flags & EDGE_TRUE_VALUE)
7190 *false_edge = EDGE_SUCC (b, 1);
7195 *true_edge = EDGE_SUCC (b, 1);
7199 struct gimple_opt_pass pass_warn_function_return =
7205 execute_warn_function_return, /* execute */
7208 0, /* static_pass_number */
7209 TV_NONE, /* tv_id */
7210 PROP_cfg, /* properties_required */
7211 0, /* properties_provided */
7212 0, /* properties_destroyed */
7213 0, /* todo_flags_start */
7214 0 /* todo_flags_finish */
7218 /* Emit noreturn warnings. */
7221 execute_warn_function_noreturn (void)
7223 if (warn_missing_noreturn
7224 && !TREE_THIS_VOLATILE (cfun->decl)
7225 && EDGE_COUNT (EXIT_BLOCK_PTR->preds) == 0
7226 && !lang_hooks.missing_noreturn_ok_p (cfun->decl))
7227 warning (OPT_Wmissing_noreturn, "%Jfunction might be possible candidate "
7228 "for attribute %<noreturn%>",
7233 struct gimple_opt_pass pass_warn_function_noreturn =
7239 execute_warn_function_noreturn, /* execute */
7242 0, /* static_pass_number */
7243 TV_NONE, /* tv_id */
7244 PROP_cfg, /* properties_required */
7245 0, /* properties_provided */
7246 0, /* properties_destroyed */
7247 0, /* todo_flags_start */
7248 0 /* todo_flags_finish */