1 /* Control flow functions for trees.
2 Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007
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 SWITCH_EXPRs.
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 basic_block
create_bb (void *, void *, basic_block
);
87 static void make_blocks (tree
);
88 static void factor_computed_gotos (void);
91 static void make_edges (void);
92 static void make_cond_expr_edges (basic_block
);
93 static void make_switch_expr_edges (basic_block
);
94 static void make_goto_expr_edges (basic_block
);
95 static edge
tree_redirect_edge_and_branch (edge
, basic_block
);
96 static edge
tree_try_redirect_by_replacing_jump (edge
, basic_block
);
97 static unsigned int split_critical_edges (void);
99 /* Various helpers. */
100 static inline bool stmt_starts_bb_p (const_tree
, const_tree
);
101 static int tree_verify_flow_info (void);
102 static void tree_make_forwarder_block (edge
);
103 static void tree_cfg2vcg (FILE *);
104 static inline void change_bb_for_stmt (tree t
, basic_block bb
);
106 /* Flowgraph optimization and cleanup. */
107 static void tree_merge_blocks (basic_block
, basic_block
);
108 static bool tree_can_merge_blocks_p (basic_block
, basic_block
);
109 static void remove_bb (basic_block
);
110 static edge
find_taken_edge_computed_goto (basic_block
, tree
);
111 static edge
find_taken_edge_cond_expr (basic_block
, tree
);
112 static edge
find_taken_edge_switch_expr (basic_block
, tree
);
113 static tree
find_case_label_for_value (tree
, tree
);
116 init_empty_tree_cfg (void)
118 /* Initialize the basic block array. */
120 profile_status
= PROFILE_ABSENT
;
121 n_basic_blocks
= NUM_FIXED_BLOCKS
;
122 last_basic_block
= NUM_FIXED_BLOCKS
;
123 basic_block_info
= VEC_alloc (basic_block
, gc
, initial_cfg_capacity
);
124 VEC_safe_grow_cleared (basic_block
, gc
, basic_block_info
,
125 initial_cfg_capacity
);
127 /* Build a mapping of labels to their associated blocks. */
128 label_to_block_map
= VEC_alloc (basic_block
, gc
, initial_cfg_capacity
);
129 VEC_safe_grow_cleared (basic_block
, gc
, label_to_block_map
,
130 initial_cfg_capacity
);
132 SET_BASIC_BLOCK (ENTRY_BLOCK
, ENTRY_BLOCK_PTR
);
133 SET_BASIC_BLOCK (EXIT_BLOCK
, EXIT_BLOCK_PTR
);
134 ENTRY_BLOCK_PTR
->next_bb
= EXIT_BLOCK_PTR
;
135 EXIT_BLOCK_PTR
->prev_bb
= ENTRY_BLOCK_PTR
;
138 /*---------------------------------------------------------------------------
140 ---------------------------------------------------------------------------*/
142 /* Entry point to the CFG builder for trees. TP points to the list of
143 statements to be added to the flowgraph. */
146 build_tree_cfg (tree
*tp
)
148 /* Register specific tree functions. */
149 tree_register_cfg_hooks ();
151 memset ((void *) &cfg_stats
, 0, sizeof (cfg_stats
));
153 init_empty_tree_cfg ();
155 found_computed_goto
= 0;
158 /* Computed gotos are hell to deal with, especially if there are
159 lots of them with a large number of destinations. So we factor
160 them to a common computed goto location before we build the
161 edge list. After we convert back to normal form, we will un-factor
162 the computed gotos since factoring introduces an unwanted jump. */
163 if (found_computed_goto
)
164 factor_computed_gotos ();
166 /* Make sure there is always at least one block, even if it's empty. */
167 if (n_basic_blocks
== NUM_FIXED_BLOCKS
)
168 create_empty_bb (ENTRY_BLOCK_PTR
);
170 /* Adjust the size of the array. */
171 if (VEC_length (basic_block
, basic_block_info
) < (size_t) n_basic_blocks
)
172 VEC_safe_grow_cleared (basic_block
, gc
, basic_block_info
, n_basic_blocks
);
174 /* To speed up statement iterator walks, we first purge dead labels. */
175 cleanup_dead_labels ();
177 /* Group case nodes to reduce the number of edges.
178 We do this after cleaning up dead labels because otherwise we miss
179 a lot of obvious case merging opportunities. */
180 group_case_labels ();
182 /* Create the edges of the flowgraph. */
184 cleanup_dead_labels ();
186 /* Debugging dumps. */
188 /* Write the flowgraph to a VCG file. */
190 int local_dump_flags
;
191 FILE *vcg_file
= dump_begin (TDI_vcg
, &local_dump_flags
);
194 tree_cfg2vcg (vcg_file
);
195 dump_end (TDI_vcg
, vcg_file
);
199 #ifdef ENABLE_CHECKING
203 /* Dump a textual representation of the flowgraph. */
205 dump_tree_cfg (dump_file
, dump_flags
);
209 execute_build_cfg (void)
211 build_tree_cfg (&DECL_SAVED_TREE (current_function_decl
));
215 struct tree_opt_pass pass_build_cfg
=
219 execute_build_cfg
, /* execute */
222 0, /* static_pass_number */
223 TV_TREE_CFG
, /* tv_id */
224 PROP_gimple_leh
, /* properties_required */
225 PROP_cfg
, /* properties_provided */
226 0, /* properties_destroyed */
227 0, /* todo_flags_start */
228 TODO_verify_stmts
| TODO_cleanup_cfg
, /* todo_flags_finish */
232 /* Search the CFG for any computed gotos. If found, factor them to a
233 common computed goto site. Also record the location of that site so
234 that we can un-factor the gotos after we have converted back to
238 factor_computed_gotos (void)
241 tree factored_label_decl
= NULL
;
243 tree factored_computed_goto_label
= NULL
;
244 tree factored_computed_goto
= NULL
;
246 /* We know there are one or more computed gotos in this function.
247 Examine the last statement in each basic block to see if the block
248 ends with a computed goto. */
252 block_stmt_iterator bsi
= bsi_last (bb
);
257 last
= bsi_stmt (bsi
);
259 /* Ignore the computed goto we create when we factor the original
261 if (last
== factored_computed_goto
)
264 /* If the last statement is a computed goto, factor it. */
265 if (computed_goto_p (last
))
269 /* The first time we find a computed goto we need to create
270 the factored goto block and the variable each original
271 computed goto will use for their goto destination. */
272 if (! factored_computed_goto
)
274 basic_block new_bb
= create_empty_bb (bb
);
275 block_stmt_iterator new_bsi
= bsi_start (new_bb
);
277 /* Create the destination of the factored goto. Each original
278 computed goto will put its desired destination into this
279 variable and jump to the label we create immediately
281 var
= create_tmp_var (ptr_type_node
, "gotovar");
283 /* Build a label for the new block which will contain the
284 factored computed goto. */
285 factored_label_decl
= create_artificial_label ();
286 factored_computed_goto_label
287 = build1 (LABEL_EXPR
, void_type_node
, factored_label_decl
);
288 bsi_insert_after (&new_bsi
, factored_computed_goto_label
,
291 /* Build our new computed goto. */
292 factored_computed_goto
= build1 (GOTO_EXPR
, void_type_node
, var
);
293 bsi_insert_after (&new_bsi
, factored_computed_goto
,
297 /* Copy the original computed goto's destination into VAR. */
298 assignment
= build_gimple_modify_stmt (var
,
299 GOTO_DESTINATION (last
));
300 bsi_insert_before (&bsi
, assignment
, BSI_SAME_STMT
);
302 /* And re-vector the computed goto to the new destination. */
303 GOTO_DESTINATION (last
) = factored_label_decl
;
309 /* Build a flowgraph for the statement_list STMT_LIST. */
312 make_blocks (tree stmt_list
)
314 tree_stmt_iterator i
= tsi_start (stmt_list
);
316 bool start_new_block
= true;
317 bool first_stmt_of_list
= true;
318 basic_block bb
= ENTRY_BLOCK_PTR
;
320 while (!tsi_end_p (i
))
327 /* If the statement starts a new basic block or if we have determined
328 in a previous pass that we need to create a new block for STMT, do
330 if (start_new_block
|| stmt_starts_bb_p (stmt
, prev_stmt
))
332 if (!first_stmt_of_list
)
333 stmt_list
= tsi_split_statement_list_before (&i
);
334 bb
= create_basic_block (stmt_list
, NULL
, bb
);
335 start_new_block
= false;
338 /* Now add STMT to BB and create the subgraphs for special statement
340 set_bb_for_stmt (stmt
, bb
);
342 if (computed_goto_p (stmt
))
343 found_computed_goto
= true;
345 /* If STMT is a basic block terminator, set START_NEW_BLOCK for the
347 if (stmt_ends_bb_p (stmt
))
348 start_new_block
= true;
351 first_stmt_of_list
= false;
356 /* Create and return a new empty basic block after bb AFTER. */
359 create_bb (void *h
, void *e
, basic_block after
)
365 /* Create and initialize a new basic block. Since alloc_block uses
366 ggc_alloc_cleared to allocate a basic block, we do not have to
367 clear the newly allocated basic block here. */
370 bb
->index
= last_basic_block
;
372 bb
->il
.tree
= GGC_CNEW (struct tree_bb_info
);
373 set_bb_stmt_list (bb
, h
? (tree
) h
: alloc_stmt_list ());
375 /* Add the new block to the linked list of blocks. */
376 link_block (bb
, after
);
378 /* Grow the basic block array if needed. */
379 if ((size_t) last_basic_block
== VEC_length (basic_block
, basic_block_info
))
381 size_t new_size
= last_basic_block
+ (last_basic_block
+ 3) / 4;
382 VEC_safe_grow_cleared (basic_block
, gc
, basic_block_info
, new_size
);
385 /* Add the newly created block to the array. */
386 SET_BASIC_BLOCK (last_basic_block
, bb
);
395 /*---------------------------------------------------------------------------
397 ---------------------------------------------------------------------------*/
399 /* Fold COND_EXPR_COND of each COND_EXPR. */
402 fold_cond_expr_cond (void)
408 tree stmt
= last_stmt (bb
);
411 && TREE_CODE (stmt
) == COND_EXPR
)
416 fold_defer_overflow_warnings ();
417 cond
= fold (COND_EXPR_COND (stmt
));
418 zerop
= integer_zerop (cond
);
419 onep
= integer_onep (cond
);
420 fold_undefer_overflow_warnings (zerop
|| onep
,
422 WARN_STRICT_OVERFLOW_CONDITIONAL
);
424 COND_EXPR_COND (stmt
) = boolean_false_node
;
426 COND_EXPR_COND (stmt
) = boolean_true_node
;
431 /* Join all the blocks in the flowgraph. */
437 struct omp_region
*cur_region
= NULL
;
439 /* Create an edge from entry to the first block with executable
441 make_edge (ENTRY_BLOCK_PTR
, BASIC_BLOCK (NUM_FIXED_BLOCKS
), EDGE_FALLTHRU
);
443 /* Traverse the basic block array placing edges. */
446 tree last
= last_stmt (bb
);
451 enum tree_code code
= TREE_CODE (last
);
455 make_goto_expr_edges (bb
);
459 make_edge (bb
, EXIT_BLOCK_PTR
, 0);
463 make_cond_expr_edges (bb
);
467 make_switch_expr_edges (bb
);
471 make_eh_edges (last
);
476 /* If this function receives a nonlocal goto, then we need to
477 make edges from this call site to all the nonlocal goto
479 if (tree_can_make_abnormal_goto (last
))
480 make_abnormal_goto_edges (bb
, true);
482 /* If this statement has reachable exception handlers, then
483 create abnormal edges to them. */
484 make_eh_edges (last
);
486 /* Some calls are known not to return. */
487 fallthru
= !(call_expr_flags (last
) & ECF_NORETURN
);
493 case GIMPLE_MODIFY_STMT
:
494 if (is_ctrl_altering_stmt (last
))
496 /* A GIMPLE_MODIFY_STMT may have a CALL_EXPR on its RHS and
497 the CALL_EXPR may have an abnormal edge. Search the RHS
498 for this case and create any required edges. */
499 if (tree_can_make_abnormal_goto (last
))
500 make_abnormal_goto_edges (bb
, true);
502 make_eh_edges (last
);
514 cur_region
= new_omp_region (bb
, code
, cur_region
);
519 cur_region
= new_omp_region (bb
, code
, cur_region
);
523 case OMP_SECTIONS_SWITCH
:
528 case OMP_ATOMIC_LOAD
:
529 case OMP_ATOMIC_STORE
:
535 /* In the case of an OMP_SECTION, the edge will go somewhere
536 other than the next block. This will be created later. */
537 cur_region
->exit
= bb
;
538 fallthru
= cur_region
->type
!= OMP_SECTION
;
539 cur_region
= cur_region
->outer
;
543 cur_region
->cont
= bb
;
544 switch (cur_region
->type
)
547 /* Make the loopback edge. */
548 make_edge (bb
, single_succ (cur_region
->entry
), 0);
550 /* Create an edge from OMP_FOR to exit, which corresponds to
551 the case that the body of the loop is not executed at
553 make_edge (cur_region
->entry
, bb
->next_bb
, 0);
558 /* Wire up the edges into and out of the nested sections. */
560 basic_block switch_bb
= single_succ (cur_region
->entry
);
562 struct omp_region
*i
;
563 for (i
= cur_region
->inner
; i
; i
= i
->next
)
565 gcc_assert (i
->type
== OMP_SECTION
);
566 make_edge (switch_bb
, i
->entry
, 0);
567 make_edge (i
->exit
, bb
, EDGE_FALLTHRU
);
570 /* Make the loopback edge to the block with
571 OMP_SECTIONS_SWITCH. */
572 make_edge (bb
, switch_bb
, 0);
574 /* Make the edge from the switch to exit. */
575 make_edge (switch_bb
, bb
->next_bb
, 0);
586 gcc_assert (!stmt_ends_bb_p (last
));
594 make_edge (bb
, bb
->next_bb
, EDGE_FALLTHRU
);
600 /* Fold COND_EXPR_COND of each COND_EXPR. */
601 fold_cond_expr_cond ();
605 /* Create the edges for a COND_EXPR starting at block BB.
606 At this point, both clauses must contain only simple gotos. */
609 make_cond_expr_edges (basic_block bb
)
611 tree entry
= last_stmt (bb
);
612 basic_block then_bb
, else_bb
;
613 tree then_label
, else_label
;
617 gcc_assert (TREE_CODE (entry
) == COND_EXPR
);
619 /* Entry basic blocks for each component. */
620 then_label
= GOTO_DESTINATION (COND_EXPR_THEN (entry
));
621 else_label
= GOTO_DESTINATION (COND_EXPR_ELSE (entry
));
622 then_bb
= label_to_block (then_label
);
623 else_bb
= label_to_block (else_label
);
625 e
= make_edge (bb
, then_bb
, EDGE_TRUE_VALUE
);
626 #ifdef USE_MAPPED_LOCATION
627 e
->goto_locus
= EXPR_LOCATION (COND_EXPR_THEN (entry
));
629 e
->goto_locus
= EXPR_LOCUS (COND_EXPR_THEN (entry
));
631 e
= make_edge (bb
, else_bb
, EDGE_FALSE_VALUE
);
634 #ifdef USE_MAPPED_LOCATION
635 e
->goto_locus
= EXPR_LOCATION (COND_EXPR_ELSE (entry
));
637 e
->goto_locus
= EXPR_LOCUS (COND_EXPR_ELSE (entry
));
641 /* We do not need the gotos anymore. */
642 COND_EXPR_THEN (entry
) = NULL_TREE
;
643 COND_EXPR_ELSE (entry
) = NULL_TREE
;
647 /* Called for each element in the hash table (P) as we delete the
648 edge to cases hash table.
650 Clear all the TREE_CHAINs to prevent problems with copying of
651 SWITCH_EXPRs and structure sharing rules, then free the hash table
655 edge_to_cases_cleanup (const void *key ATTRIBUTE_UNUSED
, void **value
,
656 void *data ATTRIBUTE_UNUSED
)
660 for (t
= (tree
) *value
; t
; t
= next
)
662 next
= TREE_CHAIN (t
);
663 TREE_CHAIN (t
) = NULL
;
670 /* Start recording information mapping edges to case labels. */
673 start_recording_case_labels (void)
675 gcc_assert (edge_to_cases
== NULL
);
676 edge_to_cases
= pointer_map_create ();
679 /* Return nonzero if we are recording information for case labels. */
682 recording_case_labels_p (void)
684 return (edge_to_cases
!= NULL
);
687 /* Stop recording information mapping edges to case labels and
688 remove any information we have recorded. */
690 end_recording_case_labels (void)
692 pointer_map_traverse (edge_to_cases
, edge_to_cases_cleanup
, NULL
);
693 pointer_map_destroy (edge_to_cases
);
694 edge_to_cases
= NULL
;
697 /* If we are inside a {start,end}_recording_cases block, then return
698 a chain of CASE_LABEL_EXPRs from T which reference E.
700 Otherwise return NULL. */
703 get_cases_for_edge (edge e
, tree t
)
709 /* If we are not recording cases, then we do not have CASE_LABEL_EXPR
710 chains available. Return NULL so the caller can detect this case. */
711 if (!recording_case_labels_p ())
714 slot
= pointer_map_contains (edge_to_cases
, e
);
718 /* If we did not find E in the hash table, then this must be the first
719 time we have been queried for information about E & T. Add all the
720 elements from T to the hash table then perform the query again. */
722 vec
= SWITCH_LABELS (t
);
723 n
= TREE_VEC_LENGTH (vec
);
724 for (i
= 0; i
< n
; i
++)
726 tree elt
= TREE_VEC_ELT (vec
, i
);
727 tree lab
= CASE_LABEL (elt
);
728 basic_block label_bb
= label_to_block (lab
);
729 edge this_edge
= find_edge (e
->src
, label_bb
);
731 /* Add it to the chain of CASE_LABEL_EXPRs referencing E, or create
733 slot
= pointer_map_insert (edge_to_cases
, this_edge
);
734 TREE_CHAIN (elt
) = (tree
) *slot
;
738 return (tree
) *pointer_map_contains (edge_to_cases
, e
);
741 /* Create the edges for a SWITCH_EXPR starting at block BB.
742 At this point, the switch body has been lowered and the
743 SWITCH_LABELS filled in, so this is in effect a multi-way branch. */
746 make_switch_expr_edges (basic_block bb
)
748 tree entry
= last_stmt (bb
);
752 vec
= SWITCH_LABELS (entry
);
753 n
= TREE_VEC_LENGTH (vec
);
755 for (i
= 0; i
< n
; ++i
)
757 tree lab
= CASE_LABEL (TREE_VEC_ELT (vec
, i
));
758 basic_block label_bb
= label_to_block (lab
);
759 make_edge (bb
, label_bb
, 0);
764 /* Return the basic block holding label DEST. */
767 label_to_block_fn (struct function
*ifun
, tree dest
)
769 int uid
= LABEL_DECL_UID (dest
);
771 /* We would die hard when faced by an undefined label. Emit a label to
772 the very first basic block. This will hopefully make even the dataflow
773 and undefined variable warnings quite right. */
774 if ((errorcount
|| sorrycount
) && uid
< 0)
776 block_stmt_iterator bsi
=
777 bsi_start (BASIC_BLOCK (NUM_FIXED_BLOCKS
));
780 stmt
= build1 (LABEL_EXPR
, void_type_node
, dest
);
781 bsi_insert_before (&bsi
, stmt
, BSI_NEW_STMT
);
782 uid
= LABEL_DECL_UID (dest
);
784 if (VEC_length (basic_block
, ifun
->cfg
->x_label_to_block_map
)
785 <= (unsigned int) uid
)
787 return VEC_index (basic_block
, ifun
->cfg
->x_label_to_block_map
, uid
);
790 /* Create edges for an abnormal goto statement at block BB. If FOR_CALL
791 is true, the source statement is a CALL_EXPR instead of a GOTO_EXPR. */
794 make_abnormal_goto_edges (basic_block bb
, bool for_call
)
796 basic_block target_bb
;
797 block_stmt_iterator bsi
;
799 FOR_EACH_BB (target_bb
)
800 for (bsi
= bsi_start (target_bb
); !bsi_end_p (bsi
); bsi_next (&bsi
))
802 tree target
= bsi_stmt (bsi
);
804 if (TREE_CODE (target
) != LABEL_EXPR
)
807 target
= LABEL_EXPR_LABEL (target
);
809 /* Make an edge to every label block that has been marked as a
810 potential target for a computed goto or a non-local goto. */
811 if ((FORCED_LABEL (target
) && !for_call
)
812 || (DECL_NONLOCAL (target
) && for_call
))
814 make_edge (bb
, target_bb
, EDGE_ABNORMAL
);
820 /* Create edges for a goto statement at block BB. */
823 make_goto_expr_edges (basic_block bb
)
825 block_stmt_iterator last
= bsi_last (bb
);
826 tree goto_t
= bsi_stmt (last
);
828 /* A simple GOTO creates normal edges. */
829 if (simple_goto_p (goto_t
))
831 tree dest
= GOTO_DESTINATION (goto_t
);
832 edge e
= make_edge (bb
, label_to_block (dest
), EDGE_FALLTHRU
);
833 #ifdef USE_MAPPED_LOCATION
834 e
->goto_locus
= EXPR_LOCATION (goto_t
);
836 e
->goto_locus
= EXPR_LOCUS (goto_t
);
838 bsi_remove (&last
, true);
842 /* A computed GOTO creates abnormal edges. */
843 make_abnormal_goto_edges (bb
, false);
847 /*---------------------------------------------------------------------------
849 ---------------------------------------------------------------------------*/
851 /* Cleanup useless labels in basic blocks. This is something we wish
852 to do early because it allows us to group case labels before creating
853 the edges for the CFG, and it speeds up block statement iterators in
855 We rerun this pass after CFG is created, to get rid of the labels that
856 are no longer referenced. After then we do not run it any more, since
857 (almost) no new labels should be created. */
859 /* A map from basic block index to the leading label of that block. */
860 static struct label_record
865 /* True if the label is referenced from somewhere. */
869 /* Callback for for_each_eh_region. Helper for cleanup_dead_labels. */
871 update_eh_label (struct eh_region
*region
)
873 tree old_label
= get_eh_region_tree_label (region
);
877 basic_block bb
= label_to_block (old_label
);
879 /* ??? After optimizing, there may be EH regions with labels
880 that have already been removed from the function body, so
881 there is no basic block for them. */
885 new_label
= label_for_bb
[bb
->index
].label
;
886 label_for_bb
[bb
->index
].used
= true;
887 set_eh_region_tree_label (region
, new_label
);
891 /* Given LABEL return the first label in the same basic block. */
893 main_block_label (tree label
)
895 basic_block bb
= label_to_block (label
);
896 tree main_label
= label_for_bb
[bb
->index
].label
;
898 /* label_to_block possibly inserted undefined label into the chain. */
901 label_for_bb
[bb
->index
].label
= label
;
905 label_for_bb
[bb
->index
].used
= true;
909 /* Cleanup redundant labels. This is a three-step process:
910 1) Find the leading label for each block.
911 2) Redirect all references to labels to the leading labels.
912 3) Cleanup all useless labels. */
915 cleanup_dead_labels (void)
918 label_for_bb
= XCNEWVEC (struct label_record
, last_basic_block
);
920 /* Find a suitable label for each block. We use the first user-defined
921 label if there is one, or otherwise just the first label we see. */
924 block_stmt_iterator i
;
926 for (i
= bsi_start (bb
); !bsi_end_p (i
); bsi_next (&i
))
928 tree label
, stmt
= bsi_stmt (i
);
930 if (TREE_CODE (stmt
) != LABEL_EXPR
)
933 label
= LABEL_EXPR_LABEL (stmt
);
935 /* If we have not yet seen a label for the current block,
936 remember this one and see if there are more labels. */
937 if (!label_for_bb
[bb
->index
].label
)
939 label_for_bb
[bb
->index
].label
= label
;
943 /* If we did see a label for the current block already, but it
944 is an artificially created label, replace it if the current
945 label is a user defined label. */
946 if (!DECL_ARTIFICIAL (label
)
947 && DECL_ARTIFICIAL (label_for_bb
[bb
->index
].label
))
949 label_for_bb
[bb
->index
].label
= label
;
955 /* Now redirect all jumps/branches to the selected label.
956 First do so for each block ending in a control statement. */
959 tree stmt
= last_stmt (bb
);
963 switch (TREE_CODE (stmt
))
967 tree true_branch
, false_branch
;
969 true_branch
= COND_EXPR_THEN (stmt
);
970 false_branch
= COND_EXPR_ELSE (stmt
);
973 GOTO_DESTINATION (true_branch
)
974 = main_block_label (GOTO_DESTINATION (true_branch
));
976 GOTO_DESTINATION (false_branch
)
977 = main_block_label (GOTO_DESTINATION (false_branch
));
985 tree vec
= SWITCH_LABELS (stmt
);
986 size_t n
= TREE_VEC_LENGTH (vec
);
988 /* Replace all destination labels. */
989 for (i
= 0; i
< n
; ++i
)
991 tree elt
= TREE_VEC_ELT (vec
, i
);
992 tree label
= main_block_label (CASE_LABEL (elt
));
993 CASE_LABEL (elt
) = label
;
998 /* We have to handle GOTO_EXPRs until they're removed, and we don't
999 remove them until after we've created the CFG edges. */
1001 if (! computed_goto_p (stmt
))
1003 GOTO_DESTINATION (stmt
)
1004 = main_block_label (GOTO_DESTINATION (stmt
));
1013 for_each_eh_region (update_eh_label
);
1015 /* Finally, purge dead labels. All user-defined labels and labels that
1016 can be the target of non-local gotos and labels which have their
1017 address taken are preserved. */
1020 block_stmt_iterator i
;
1021 tree label_for_this_bb
= label_for_bb
[bb
->index
].label
;
1023 if (!label_for_this_bb
)
1026 /* If the main label of the block is unused, we may still remove it. */
1027 if (!label_for_bb
[bb
->index
].used
)
1028 label_for_this_bb
= NULL
;
1030 for (i
= bsi_start (bb
); !bsi_end_p (i
); )
1032 tree label
, stmt
= bsi_stmt (i
);
1034 if (TREE_CODE (stmt
) != LABEL_EXPR
)
1037 label
= LABEL_EXPR_LABEL (stmt
);
1039 if (label
== label_for_this_bb
1040 || ! DECL_ARTIFICIAL (label
)
1041 || DECL_NONLOCAL (label
)
1042 || FORCED_LABEL (label
))
1045 bsi_remove (&i
, true);
1049 free (label_for_bb
);
1052 /* Look for blocks ending in a multiway branch (a SWITCH_EXPR in GIMPLE),
1053 and scan the sorted vector of cases. Combine the ones jumping to the
1055 Eg. three separate entries 1: 2: 3: become one entry 1..3: */
1058 group_case_labels (void)
1064 tree stmt
= last_stmt (bb
);
1065 if (stmt
&& TREE_CODE (stmt
) == SWITCH_EXPR
)
1067 tree labels
= SWITCH_LABELS (stmt
);
1068 int old_size
= TREE_VEC_LENGTH (labels
);
1069 int i
, j
, new_size
= old_size
;
1070 tree default_case
= TREE_VEC_ELT (labels
, old_size
- 1);
1073 /* The default label is always the last case in a switch
1074 statement after gimplification. */
1075 default_label
= CASE_LABEL (default_case
);
1077 /* Look for possible opportunities to merge cases.
1078 Ignore the last element of the label vector because it
1079 must be the default case. */
1081 while (i
< old_size
- 1)
1083 tree base_case
, base_label
, base_high
;
1084 base_case
= TREE_VEC_ELT (labels
, i
);
1086 gcc_assert (base_case
);
1087 base_label
= CASE_LABEL (base_case
);
1089 /* Discard cases that have the same destination as the
1091 if (base_label
== default_label
)
1093 TREE_VEC_ELT (labels
, i
) = NULL_TREE
;
1099 base_high
= CASE_HIGH (base_case
) ?
1100 CASE_HIGH (base_case
) : CASE_LOW (base_case
);
1102 /* Try to merge case labels. Break out when we reach the end
1103 of the label vector or when we cannot merge the next case
1104 label with the current one. */
1105 while (i
< old_size
- 1)
1107 tree merge_case
= TREE_VEC_ELT (labels
, i
);
1108 tree merge_label
= CASE_LABEL (merge_case
);
1109 tree t
= int_const_binop (PLUS_EXPR
, base_high
,
1110 integer_one_node
, 1);
1112 /* Merge the cases if they jump to the same place,
1113 and their ranges are consecutive. */
1114 if (merge_label
== base_label
1115 && tree_int_cst_equal (CASE_LOW (merge_case
), t
))
1117 base_high
= CASE_HIGH (merge_case
) ?
1118 CASE_HIGH (merge_case
) : CASE_LOW (merge_case
);
1119 CASE_HIGH (base_case
) = base_high
;
1120 TREE_VEC_ELT (labels
, i
) = NULL_TREE
;
1129 /* Compress the case labels in the label vector, and adjust the
1130 length of the vector. */
1131 for (i
= 0, j
= 0; i
< new_size
; i
++)
1133 while (! TREE_VEC_ELT (labels
, j
))
1135 TREE_VEC_ELT (labels
, i
) = TREE_VEC_ELT (labels
, j
++);
1137 TREE_VEC_LENGTH (labels
) = new_size
;
1142 /* Checks whether we can merge block B into block A. */
1145 tree_can_merge_blocks_p (basic_block a
, basic_block b
)
1148 block_stmt_iterator bsi
;
1151 if (!single_succ_p (a
))
1154 if (single_succ_edge (a
)->flags
& EDGE_ABNORMAL
)
1157 if (single_succ (a
) != b
)
1160 if (!single_pred_p (b
))
1163 if (b
== EXIT_BLOCK_PTR
)
1166 /* If A ends by a statement causing exceptions or something similar, we
1167 cannot merge the blocks. */
1168 /* This CONST_CAST is okay because last_stmt doesn't modify its
1169 argument and the return value is assign to a const_tree. */
1170 stmt
= last_stmt (CONST_CAST_BB (a
));
1171 if (stmt
&& stmt_ends_bb_p (stmt
))
1174 /* Do not allow a block with only a non-local label to be merged. */
1175 if (stmt
&& TREE_CODE (stmt
) == LABEL_EXPR
1176 && DECL_NONLOCAL (LABEL_EXPR_LABEL (stmt
)))
1179 /* It must be possible to eliminate all phi nodes in B. If ssa form
1180 is not up-to-date, we cannot eliminate any phis; however, if only
1181 some symbols as whole are marked for renaming, this is not a problem,
1182 as phi nodes for those symbols are irrelevant in updating anyway. */
1183 phi
= phi_nodes (b
);
1186 if (name_mappings_registered_p ())
1189 for (; phi
; phi
= PHI_CHAIN (phi
))
1190 if (!is_gimple_reg (PHI_RESULT (phi
))
1191 && !may_propagate_copy (PHI_RESULT (phi
), PHI_ARG_DEF (phi
, 0)))
1195 /* Do not remove user labels. */
1196 for (bsi
= bsi_start (b
); !bsi_end_p (bsi
); bsi_next (&bsi
))
1198 stmt
= bsi_stmt (bsi
);
1199 if (TREE_CODE (stmt
) != LABEL_EXPR
)
1201 if (!DECL_ARTIFICIAL (LABEL_EXPR_LABEL (stmt
)))
1205 /* Protect the loop latches. */
1207 && b
->loop_father
->latch
== b
)
1213 /* Replaces all uses of NAME by VAL. */
1216 replace_uses_by (tree name
, tree val
)
1218 imm_use_iterator imm_iter
;
1223 FOR_EACH_IMM_USE_STMT (stmt
, imm_iter
, name
)
1225 if (TREE_CODE (stmt
) != PHI_NODE
)
1226 push_stmt_changes (&stmt
);
1228 FOR_EACH_IMM_USE_ON_STMT (use
, imm_iter
)
1230 replace_exp (use
, val
);
1232 if (TREE_CODE (stmt
) == PHI_NODE
)
1234 e
= PHI_ARG_EDGE (stmt
, PHI_ARG_INDEX_FROM_USE (use
));
1235 if (e
->flags
& EDGE_ABNORMAL
)
1237 /* This can only occur for virtual operands, since
1238 for the real ones SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name))
1239 would prevent replacement. */
1240 gcc_assert (!is_gimple_reg (name
));
1241 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (val
) = 1;
1246 if (TREE_CODE (stmt
) != PHI_NODE
)
1250 fold_stmt_inplace (stmt
);
1251 if (cfgcleanup_altered_bbs
)
1252 bitmap_set_bit (cfgcleanup_altered_bbs
, bb_for_stmt (stmt
)->index
);
1254 /* FIXME. This should go in pop_stmt_changes. */
1255 rhs
= get_rhs (stmt
);
1256 if (TREE_CODE (rhs
) == ADDR_EXPR
)
1257 recompute_tree_invariant_for_addr_expr (rhs
);
1259 maybe_clean_or_replace_eh_stmt (stmt
, stmt
);
1261 pop_stmt_changes (&stmt
);
1265 gcc_assert (has_zero_uses (name
));
1267 /* Also update the trees stored in loop structures. */
1273 FOR_EACH_LOOP (li
, loop
, 0)
1275 substitute_in_loop_info (loop
, name
, val
);
1280 /* Merge block B into block A. */
1283 tree_merge_blocks (basic_block a
, basic_block b
)
1285 block_stmt_iterator bsi
;
1286 tree_stmt_iterator last
;
1290 fprintf (dump_file
, "Merging blocks %d and %d\n", a
->index
, b
->index
);
1292 /* Remove all single-valued PHI nodes from block B of the form
1293 V_i = PHI <V_j> by propagating V_j to all the uses of V_i. */
1295 for (phi
= phi_nodes (b
); phi
; phi
= phi_nodes (b
))
1297 tree def
= PHI_RESULT (phi
), use
= PHI_ARG_DEF (phi
, 0);
1299 bool may_replace_uses
= may_propagate_copy (def
, use
);
1301 /* In case we maintain loop closed ssa form, do not propagate arguments
1302 of loop exit phi nodes. */
1304 && loops_state_satisfies_p (LOOP_CLOSED_SSA
)
1305 && is_gimple_reg (def
)
1306 && TREE_CODE (use
) == SSA_NAME
1307 && a
->loop_father
!= b
->loop_father
)
1308 may_replace_uses
= false;
1310 if (!may_replace_uses
)
1312 gcc_assert (is_gimple_reg (def
));
1314 /* Note that just emitting the copies is fine -- there is no problem
1315 with ordering of phi nodes. This is because A is the single
1316 predecessor of B, therefore results of the phi nodes cannot
1317 appear as arguments of the phi nodes. */
1318 copy
= build_gimple_modify_stmt (def
, use
);
1319 bsi_insert_after (&bsi
, copy
, BSI_NEW_STMT
);
1320 SSA_NAME_DEF_STMT (def
) = copy
;
1321 remove_phi_node (phi
, NULL
, false);
1325 replace_uses_by (def
, use
);
1326 remove_phi_node (phi
, NULL
, true);
1330 /* Ensure that B follows A. */
1331 move_block_after (b
, a
);
1333 gcc_assert (single_succ_edge (a
)->flags
& EDGE_FALLTHRU
);
1334 gcc_assert (!last_stmt (a
) || !stmt_ends_bb_p (last_stmt (a
)));
1336 /* Remove labels from B and set bb_for_stmt to A for other statements. */
1337 for (bsi
= bsi_start (b
); !bsi_end_p (bsi
);)
1339 if (TREE_CODE (bsi_stmt (bsi
)) == LABEL_EXPR
)
1341 tree label
= bsi_stmt (bsi
);
1343 bsi_remove (&bsi
, false);
1344 /* Now that we can thread computed gotos, we might have
1345 a situation where we have a forced label in block B
1346 However, the label at the start of block B might still be
1347 used in other ways (think about the runtime checking for
1348 Fortran assigned gotos). So we can not just delete the
1349 label. Instead we move the label to the start of block A. */
1350 if (FORCED_LABEL (LABEL_EXPR_LABEL (label
)))
1352 block_stmt_iterator dest_bsi
= bsi_start (a
);
1353 bsi_insert_before (&dest_bsi
, label
, BSI_NEW_STMT
);
1358 change_bb_for_stmt (bsi_stmt (bsi
), a
);
1363 /* Merge the chains. */
1364 last
= tsi_last (bb_stmt_list (a
));
1365 tsi_link_after (&last
, bb_stmt_list (b
), TSI_NEW_STMT
);
1366 set_bb_stmt_list (b
, NULL_TREE
);
1368 if (cfgcleanup_altered_bbs
)
1369 bitmap_set_bit (cfgcleanup_altered_bbs
, a
->index
);
1373 /* Return the one of two successors of BB that is not reachable by a
1374 reached by a complex edge, if there is one. Else, return BB. We use
1375 this in optimizations that use post-dominators for their heuristics,
1376 to catch the cases in C++ where function calls are involved. */
1379 single_noncomplex_succ (basic_block bb
)
1382 if (EDGE_COUNT (bb
->succs
) != 2)
1385 e0
= EDGE_SUCC (bb
, 0);
1386 e1
= EDGE_SUCC (bb
, 1);
1387 if (e0
->flags
& EDGE_COMPLEX
)
1389 if (e1
->flags
& EDGE_COMPLEX
)
1396 /* Walk the function tree removing unnecessary statements.
1398 * Empty statement nodes are removed
1400 * Unnecessary TRY_FINALLY and TRY_CATCH blocks are removed
1402 * Unnecessary COND_EXPRs are removed
1404 * Some unnecessary BIND_EXPRs are removed
1406 Clearly more work could be done. The trick is doing the analysis
1407 and removal fast enough to be a net improvement in compile times.
1409 Note that when we remove a control structure such as a COND_EXPR
1410 BIND_EXPR, or TRY block, we will need to repeat this optimization pass
1411 to ensure we eliminate all the useless code. */
1422 static void remove_useless_stmts_1 (tree
*, struct rus_data
*);
1425 remove_useless_stmts_warn_notreached (tree stmt
)
1427 if (EXPR_HAS_LOCATION (stmt
))
1429 location_t loc
= EXPR_LOCATION (stmt
);
1430 if (LOCATION_LINE (loc
) > 0)
1432 warning (OPT_Wunreachable_code
, "%Hwill never be executed", &loc
);
1437 switch (TREE_CODE (stmt
))
1439 case STATEMENT_LIST
:
1441 tree_stmt_iterator i
;
1442 for (i
= tsi_start (stmt
); !tsi_end_p (i
); tsi_next (&i
))
1443 if (remove_useless_stmts_warn_notreached (tsi_stmt (i
)))
1449 if (remove_useless_stmts_warn_notreached (COND_EXPR_COND (stmt
)))
1451 if (remove_useless_stmts_warn_notreached (COND_EXPR_THEN (stmt
)))
1453 if (remove_useless_stmts_warn_notreached (COND_EXPR_ELSE (stmt
)))
1457 case TRY_FINALLY_EXPR
:
1458 case TRY_CATCH_EXPR
:
1459 if (remove_useless_stmts_warn_notreached (TREE_OPERAND (stmt
, 0)))
1461 if (remove_useless_stmts_warn_notreached (TREE_OPERAND (stmt
, 1)))
1466 return remove_useless_stmts_warn_notreached (CATCH_BODY (stmt
));
1467 case EH_FILTER_EXPR
:
1468 return remove_useless_stmts_warn_notreached (EH_FILTER_FAILURE (stmt
));
1470 return remove_useless_stmts_warn_notreached (BIND_EXPR_BLOCK (stmt
));
1473 /* Not a live container. */
1481 remove_useless_stmts_cond (tree
*stmt_p
, struct rus_data
*data
)
1483 tree then_clause
, else_clause
, cond
;
1484 bool save_has_label
, then_has_label
, else_has_label
;
1486 save_has_label
= data
->has_label
;
1487 data
->has_label
= false;
1488 data
->last_goto
= NULL
;
1490 remove_useless_stmts_1 (&COND_EXPR_THEN (*stmt_p
), data
);
1492 then_has_label
= data
->has_label
;
1493 data
->has_label
= false;
1494 data
->last_goto
= NULL
;
1496 remove_useless_stmts_1 (&COND_EXPR_ELSE (*stmt_p
), data
);
1498 else_has_label
= data
->has_label
;
1499 data
->has_label
= save_has_label
| then_has_label
| else_has_label
;
1501 then_clause
= COND_EXPR_THEN (*stmt_p
);
1502 else_clause
= COND_EXPR_ELSE (*stmt_p
);
1503 cond
= fold (COND_EXPR_COND (*stmt_p
));
1505 /* If neither arm does anything at all, we can remove the whole IF. */
1506 if (!TREE_SIDE_EFFECTS (then_clause
) && !TREE_SIDE_EFFECTS (else_clause
))
1508 *stmt_p
= build_empty_stmt ();
1509 data
->repeat
= true;
1512 /* If there are no reachable statements in an arm, then we can
1513 zap the entire conditional. */
1514 else if (integer_nonzerop (cond
) && !else_has_label
)
1516 if (warn_notreached
)
1517 remove_useless_stmts_warn_notreached (else_clause
);
1518 *stmt_p
= then_clause
;
1519 data
->repeat
= true;
1521 else if (integer_zerop (cond
) && !then_has_label
)
1523 if (warn_notreached
)
1524 remove_useless_stmts_warn_notreached (then_clause
);
1525 *stmt_p
= else_clause
;
1526 data
->repeat
= true;
1529 /* Check a couple of simple things on then/else with single stmts. */
1532 tree then_stmt
= expr_only (then_clause
);
1533 tree else_stmt
= expr_only (else_clause
);
1535 /* Notice branches to a common destination. */
1536 if (then_stmt
&& else_stmt
1537 && TREE_CODE (then_stmt
) == GOTO_EXPR
1538 && TREE_CODE (else_stmt
) == GOTO_EXPR
1539 && (GOTO_DESTINATION (then_stmt
) == GOTO_DESTINATION (else_stmt
)))
1541 *stmt_p
= then_stmt
;
1542 data
->repeat
= true;
1545 /* If the THEN/ELSE clause merely assigns a value to a variable or
1546 parameter which is already known to contain that value, then
1547 remove the useless THEN/ELSE clause. */
1548 else if (TREE_CODE (cond
) == VAR_DECL
|| TREE_CODE (cond
) == PARM_DECL
)
1551 && TREE_CODE (else_stmt
) == GIMPLE_MODIFY_STMT
1552 && GIMPLE_STMT_OPERAND (else_stmt
, 0) == cond
1553 && integer_zerop (GIMPLE_STMT_OPERAND (else_stmt
, 1)))
1554 COND_EXPR_ELSE (*stmt_p
) = alloc_stmt_list ();
1556 else if ((TREE_CODE (cond
) == EQ_EXPR
|| TREE_CODE (cond
) == NE_EXPR
)
1557 && (TREE_CODE (TREE_OPERAND (cond
, 0)) == VAR_DECL
1558 || TREE_CODE (TREE_OPERAND (cond
, 0)) == PARM_DECL
)
1559 && TREE_CONSTANT (TREE_OPERAND (cond
, 1)))
1561 tree stmt
= (TREE_CODE (cond
) == EQ_EXPR
1562 ? then_stmt
: else_stmt
);
1563 tree
*location
= (TREE_CODE (cond
) == EQ_EXPR
1564 ? &COND_EXPR_THEN (*stmt_p
)
1565 : &COND_EXPR_ELSE (*stmt_p
));
1568 && TREE_CODE (stmt
) == GIMPLE_MODIFY_STMT
1569 && GIMPLE_STMT_OPERAND (stmt
, 0) == TREE_OPERAND (cond
, 0)
1570 && GIMPLE_STMT_OPERAND (stmt
, 1) == TREE_OPERAND (cond
, 1))
1571 *location
= alloc_stmt_list ();
1575 /* Protect GOTOs in the arm of COND_EXPRs from being removed. They
1576 would be re-introduced during lowering. */
1577 data
->last_goto
= NULL
;
1582 remove_useless_stmts_tf (tree
*stmt_p
, struct rus_data
*data
)
1584 bool save_may_branch
, save_may_throw
;
1585 bool this_may_branch
, this_may_throw
;
1587 /* Collect may_branch and may_throw information for the body only. */
1588 save_may_branch
= data
->may_branch
;
1589 save_may_throw
= data
->may_throw
;
1590 data
->may_branch
= false;
1591 data
->may_throw
= false;
1592 data
->last_goto
= NULL
;
1594 remove_useless_stmts_1 (&TREE_OPERAND (*stmt_p
, 0), data
);
1596 this_may_branch
= data
->may_branch
;
1597 this_may_throw
= data
->may_throw
;
1598 data
->may_branch
|= save_may_branch
;
1599 data
->may_throw
|= save_may_throw
;
1600 data
->last_goto
= NULL
;
1602 remove_useless_stmts_1 (&TREE_OPERAND (*stmt_p
, 1), data
);
1604 /* If the body is empty, then we can emit the FINALLY block without
1605 the enclosing TRY_FINALLY_EXPR. */
1606 if (!TREE_SIDE_EFFECTS (TREE_OPERAND (*stmt_p
, 0)))
1608 *stmt_p
= TREE_OPERAND (*stmt_p
, 1);
1609 data
->repeat
= true;
1612 /* If the handler is empty, then we can emit the TRY block without
1613 the enclosing TRY_FINALLY_EXPR. */
1614 else if (!TREE_SIDE_EFFECTS (TREE_OPERAND (*stmt_p
, 1)))
1616 *stmt_p
= TREE_OPERAND (*stmt_p
, 0);
1617 data
->repeat
= true;
1620 /* If the body neither throws, nor branches, then we can safely
1621 string the TRY and FINALLY blocks together. */
1622 else if (!this_may_branch
&& !this_may_throw
)
1624 tree stmt
= *stmt_p
;
1625 *stmt_p
= TREE_OPERAND (stmt
, 0);
1626 append_to_statement_list (TREE_OPERAND (stmt
, 1), stmt_p
);
1627 data
->repeat
= true;
1633 remove_useless_stmts_tc (tree
*stmt_p
, struct rus_data
*data
)
1635 bool save_may_throw
, this_may_throw
;
1636 tree_stmt_iterator i
;
1639 /* Collect may_throw information for the body only. */
1640 save_may_throw
= data
->may_throw
;
1641 data
->may_throw
= false;
1642 data
->last_goto
= NULL
;
1644 remove_useless_stmts_1 (&TREE_OPERAND (*stmt_p
, 0), data
);
1646 this_may_throw
= data
->may_throw
;
1647 data
->may_throw
= save_may_throw
;
1649 /* If the body cannot throw, then we can drop the entire TRY_CATCH_EXPR. */
1650 if (!this_may_throw
)
1652 if (warn_notreached
)
1653 remove_useless_stmts_warn_notreached (TREE_OPERAND (*stmt_p
, 1));
1654 *stmt_p
= TREE_OPERAND (*stmt_p
, 0);
1655 data
->repeat
= true;
1659 /* Process the catch clause specially. We may be able to tell that
1660 no exceptions propagate past this point. */
1662 this_may_throw
= true;
1663 i
= tsi_start (TREE_OPERAND (*stmt_p
, 1));
1664 stmt
= tsi_stmt (i
);
1665 data
->last_goto
= NULL
;
1667 switch (TREE_CODE (stmt
))
1670 for (; !tsi_end_p (i
); tsi_next (&i
))
1672 stmt
= tsi_stmt (i
);
1673 /* If we catch all exceptions, then the body does not
1674 propagate exceptions past this point. */
1675 if (CATCH_TYPES (stmt
) == NULL
)
1676 this_may_throw
= false;
1677 data
->last_goto
= NULL
;
1678 remove_useless_stmts_1 (&CATCH_BODY (stmt
), data
);
1682 case EH_FILTER_EXPR
:
1683 if (EH_FILTER_MUST_NOT_THROW (stmt
))
1684 this_may_throw
= false;
1685 else if (EH_FILTER_TYPES (stmt
) == NULL
)
1686 this_may_throw
= false;
1687 remove_useless_stmts_1 (&EH_FILTER_FAILURE (stmt
), data
);
1691 /* Otherwise this is a cleanup. */
1692 remove_useless_stmts_1 (&TREE_OPERAND (*stmt_p
, 1), data
);
1694 /* If the cleanup is empty, then we can emit the TRY block without
1695 the enclosing TRY_CATCH_EXPR. */
1696 if (!TREE_SIDE_EFFECTS (TREE_OPERAND (*stmt_p
, 1)))
1698 *stmt_p
= TREE_OPERAND (*stmt_p
, 0);
1699 data
->repeat
= true;
1703 data
->may_throw
|= this_may_throw
;
1708 remove_useless_stmts_bind (tree
*stmt_p
, struct rus_data
*data
)
1712 /* First remove anything underneath the BIND_EXPR. */
1713 remove_useless_stmts_1 (&BIND_EXPR_BODY (*stmt_p
), data
);
1715 /* If the BIND_EXPR has no variables, then we can pull everything
1716 up one level and remove the BIND_EXPR, unless this is the toplevel
1717 BIND_EXPR for the current function or an inlined function.
1719 When this situation occurs we will want to apply this
1720 optimization again. */
1721 block
= BIND_EXPR_BLOCK (*stmt_p
);
1722 if (BIND_EXPR_VARS (*stmt_p
) == NULL_TREE
1723 && *stmt_p
!= DECL_SAVED_TREE (current_function_decl
)
1725 || ! BLOCK_ABSTRACT_ORIGIN (block
)
1726 || (TREE_CODE (BLOCK_ABSTRACT_ORIGIN (block
))
1729 *stmt_p
= BIND_EXPR_BODY (*stmt_p
);
1730 data
->repeat
= true;
1736 remove_useless_stmts_goto (tree
*stmt_p
, struct rus_data
*data
)
1738 tree dest
= GOTO_DESTINATION (*stmt_p
);
1740 data
->may_branch
= true;
1741 data
->last_goto
= NULL
;
1743 /* Record the last goto expr, so that we can delete it if unnecessary. */
1744 if (TREE_CODE (dest
) == LABEL_DECL
)
1745 data
->last_goto
= stmt_p
;
1750 remove_useless_stmts_label (tree
*stmt_p
, struct rus_data
*data
)
1752 tree label
= LABEL_EXPR_LABEL (*stmt_p
);
1754 data
->has_label
= true;
1756 /* We do want to jump across non-local label receiver code. */
1757 if (DECL_NONLOCAL (label
))
1758 data
->last_goto
= NULL
;
1760 else if (data
->last_goto
&& GOTO_DESTINATION (*data
->last_goto
) == label
)
1762 *data
->last_goto
= build_empty_stmt ();
1763 data
->repeat
= true;
1766 /* ??? Add something here to delete unused labels. */
1770 /* If the function is "const" or "pure", then clear TREE_SIDE_EFFECTS on its
1771 decl. This allows us to eliminate redundant or useless
1772 calls to "const" functions.
1774 Gimplifier already does the same operation, but we may notice functions
1775 being const and pure once their calls has been gimplified, so we need
1776 to update the flag. */
1779 update_call_expr_flags (tree call
)
1781 tree decl
= get_callee_fndecl (call
);
1784 if (call_expr_flags (call
) & (ECF_CONST
| ECF_PURE
))
1785 TREE_SIDE_EFFECTS (call
) = 0;
1786 if (TREE_NOTHROW (decl
))
1787 TREE_NOTHROW (call
) = 1;
1791 /* T is CALL_EXPR. Set current_function_calls_* flags. */
1794 notice_special_calls (tree t
)
1796 int flags
= call_expr_flags (t
);
1798 if (flags
& ECF_MAY_BE_ALLOCA
)
1799 current_function_calls_alloca
= true;
1800 if (flags
& ECF_RETURNS_TWICE
)
1801 current_function_calls_setjmp
= true;
1805 /* Clear flags set by notice_special_calls. Used by dead code removal
1806 to update the flags. */
1809 clear_special_calls (void)
1811 current_function_calls_alloca
= false;
1812 current_function_calls_setjmp
= false;
1817 remove_useless_stmts_1 (tree
*tp
, struct rus_data
*data
)
1821 switch (TREE_CODE (t
))
1824 remove_useless_stmts_cond (tp
, data
);
1827 case TRY_FINALLY_EXPR
:
1828 remove_useless_stmts_tf (tp
, data
);
1831 case TRY_CATCH_EXPR
:
1832 remove_useless_stmts_tc (tp
, data
);
1836 remove_useless_stmts_bind (tp
, data
);
1840 remove_useless_stmts_goto (tp
, data
);
1844 remove_useless_stmts_label (tp
, data
);
1849 data
->last_goto
= NULL
;
1850 data
->may_branch
= true;
1855 data
->last_goto
= NULL
;
1856 notice_special_calls (t
);
1857 update_call_expr_flags (t
);
1858 if (tree_could_throw_p (t
))
1859 data
->may_throw
= true;
1865 case GIMPLE_MODIFY_STMT
:
1866 data
->last_goto
= NULL
;
1868 op
= get_call_expr_in (t
);
1871 update_call_expr_flags (op
);
1872 notice_special_calls (op
);
1874 if (tree_could_throw_p (t
))
1875 data
->may_throw
= true;
1878 case STATEMENT_LIST
:
1880 tree_stmt_iterator i
= tsi_start (t
);
1881 while (!tsi_end_p (i
))
1884 if (IS_EMPTY_STMT (t
))
1890 remove_useless_stmts_1 (tsi_stmt_ptr (i
), data
);
1893 if (TREE_CODE (t
) == STATEMENT_LIST
)
1895 tsi_link_before (&i
, t
, TSI_SAME_STMT
);
1905 data
->last_goto
= NULL
;
1909 data
->last_goto
= NULL
;
1915 remove_useless_stmts (void)
1917 struct rus_data data
;
1919 clear_special_calls ();
1923 memset (&data
, 0, sizeof (data
));
1924 remove_useless_stmts_1 (&DECL_SAVED_TREE (current_function_decl
), &data
);
1926 while (data
.repeat
);
1931 struct tree_opt_pass pass_remove_useless_stmts
=
1933 "useless", /* name */
1935 remove_useless_stmts
, /* execute */
1938 0, /* static_pass_number */
1940 PROP_gimple_any
, /* properties_required */
1941 0, /* properties_provided */
1942 0, /* properties_destroyed */
1943 0, /* todo_flags_start */
1944 TODO_dump_func
, /* todo_flags_finish */
1948 /* Remove PHI nodes associated with basic block BB and all edges out of BB. */
1951 remove_phi_nodes_and_edges_for_unreachable_block (basic_block bb
)
1955 /* Since this block is no longer reachable, we can just delete all
1956 of its PHI nodes. */
1957 phi
= phi_nodes (bb
);
1960 tree next
= PHI_CHAIN (phi
);
1961 remove_phi_node (phi
, NULL_TREE
, true);
1965 /* Remove edges to BB's successors. */
1966 while (EDGE_COUNT (bb
->succs
) > 0)
1967 remove_edge (EDGE_SUCC (bb
, 0));
1971 /* Remove statements of basic block BB. */
1974 remove_bb (basic_block bb
)
1976 block_stmt_iterator i
;
1977 #ifdef USE_MAPPED_LOCATION
1978 source_location loc
= UNKNOWN_LOCATION
;
1980 source_locus loc
= 0;
1985 fprintf (dump_file
, "Removing basic block %d\n", bb
->index
);
1986 if (dump_flags
& TDF_DETAILS
)
1988 dump_bb (bb
, dump_file
, 0);
1989 fprintf (dump_file
, "\n");
1995 struct loop
*loop
= bb
->loop_father
;
1997 /* If a loop gets removed, clean up the information associated
1999 if (loop
->latch
== bb
2000 || loop
->header
== bb
)
2001 free_numbers_of_iterations_estimates_loop (loop
);
2004 /* Remove all the instructions in the block. */
2005 if (bb_stmt_list (bb
) != NULL_TREE
)
2007 for (i
= bsi_start (bb
); !bsi_end_p (i
);)
2009 tree stmt
= bsi_stmt (i
);
2010 if (TREE_CODE (stmt
) == LABEL_EXPR
2011 && (FORCED_LABEL (LABEL_EXPR_LABEL (stmt
))
2012 || DECL_NONLOCAL (LABEL_EXPR_LABEL (stmt
))))
2015 block_stmt_iterator new_bsi
;
2017 /* A non-reachable non-local label may still be referenced.
2018 But it no longer needs to carry the extra semantics of
2020 if (DECL_NONLOCAL (LABEL_EXPR_LABEL (stmt
)))
2022 DECL_NONLOCAL (LABEL_EXPR_LABEL (stmt
)) = 0;
2023 FORCED_LABEL (LABEL_EXPR_LABEL (stmt
)) = 1;
2026 new_bb
= bb
->prev_bb
;
2027 new_bsi
= bsi_start (new_bb
);
2028 bsi_remove (&i
, false);
2029 bsi_insert_before (&new_bsi
, stmt
, BSI_NEW_STMT
);
2033 /* Release SSA definitions if we are in SSA. Note that we
2034 may be called when not in SSA. For example,
2035 final_cleanup calls this function via
2036 cleanup_tree_cfg. */
2037 if (gimple_in_ssa_p (cfun
))
2038 release_defs (stmt
);
2040 bsi_remove (&i
, true);
2043 /* Don't warn for removed gotos. Gotos are often removed due to
2044 jump threading, thus resulting in bogus warnings. Not great,
2045 since this way we lose warnings for gotos in the original
2046 program that are indeed unreachable. */
2047 if (TREE_CODE (stmt
) != GOTO_EXPR
&& EXPR_HAS_LOCATION (stmt
) && !loc
)
2049 #ifdef USE_MAPPED_LOCATION
2050 if (EXPR_HAS_LOCATION (stmt
))
2051 loc
= EXPR_LOCATION (stmt
);
2054 t
= EXPR_LOCUS (stmt
);
2055 if (t
&& LOCATION_LINE (*t
) > 0)
2062 /* If requested, give a warning that the first statement in the
2063 block is unreachable. We walk statements backwards in the
2064 loop above, so the last statement we process is the first statement
2066 #ifdef USE_MAPPED_LOCATION
2067 if (loc
> BUILTINS_LOCATION
&& LOCATION_LINE (loc
) > 0)
2068 warning (OPT_Wunreachable_code
, "%Hwill never be executed", &loc
);
2071 warning (OPT_Wunreachable_code
, "%Hwill never be executed", loc
);
2074 remove_phi_nodes_and_edges_for_unreachable_block (bb
);
2079 /* Given a basic block BB ending with COND_EXPR or SWITCH_EXPR, and a
2080 predicate VAL, return the edge that will be taken out of the block.
2081 If VAL does not match a unique edge, NULL is returned. */
2084 find_taken_edge (basic_block bb
, tree val
)
2088 stmt
= last_stmt (bb
);
2091 gcc_assert (is_ctrl_stmt (stmt
));
2094 if (! is_gimple_min_invariant (val
))
2097 if (TREE_CODE (stmt
) == COND_EXPR
)
2098 return find_taken_edge_cond_expr (bb
, val
);
2100 if (TREE_CODE (stmt
) == SWITCH_EXPR
)
2101 return find_taken_edge_switch_expr (bb
, val
);
2103 if (computed_goto_p (stmt
))
2105 /* Only optimize if the argument is a label, if the argument is
2106 not a label then we can not construct a proper CFG.
2108 It may be the case that we only need to allow the LABEL_REF to
2109 appear inside an ADDR_EXPR, but we also allow the LABEL_REF to
2110 appear inside a LABEL_EXPR just to be safe. */
2111 if ((TREE_CODE (val
) == ADDR_EXPR
|| TREE_CODE (val
) == LABEL_EXPR
)
2112 && TREE_CODE (TREE_OPERAND (val
, 0)) == LABEL_DECL
)
2113 return find_taken_edge_computed_goto (bb
, TREE_OPERAND (val
, 0));
2120 /* Given a constant value VAL and the entry block BB to a GOTO_EXPR
2121 statement, determine which of the outgoing edges will be taken out of the
2122 block. Return NULL if either edge may be taken. */
2125 find_taken_edge_computed_goto (basic_block bb
, tree val
)
2130 dest
= label_to_block (val
);
2133 e
= find_edge (bb
, dest
);
2134 gcc_assert (e
!= NULL
);
2140 /* Given a constant value VAL and the entry block BB to a COND_EXPR
2141 statement, determine which of the two edges will be taken out of the
2142 block. Return NULL if either edge may be taken. */
2145 find_taken_edge_cond_expr (basic_block bb
, tree val
)
2147 edge true_edge
, false_edge
;
2149 extract_true_false_edges_from_block (bb
, &true_edge
, &false_edge
);
2151 gcc_assert (TREE_CODE (val
) == INTEGER_CST
);
2152 return (integer_zerop (val
) ? false_edge
: true_edge
);
2155 /* Given an INTEGER_CST VAL and the entry block BB to a SWITCH_EXPR
2156 statement, determine which edge will be taken out of the block. Return
2157 NULL if any edge may be taken. */
2160 find_taken_edge_switch_expr (basic_block bb
, tree val
)
2162 tree switch_expr
, taken_case
;
2163 basic_block dest_bb
;
2166 switch_expr
= last_stmt (bb
);
2167 taken_case
= find_case_label_for_value (switch_expr
, val
);
2168 dest_bb
= label_to_block (CASE_LABEL (taken_case
));
2170 e
= find_edge (bb
, dest_bb
);
2176 /* Return the CASE_LABEL_EXPR that SWITCH_EXPR will take for VAL.
2177 We can make optimal use here of the fact that the case labels are
2178 sorted: We can do a binary search for a case matching VAL. */
2181 find_case_label_for_value (tree switch_expr
, tree val
)
2183 tree vec
= SWITCH_LABELS (switch_expr
);
2184 size_t low
, high
, n
= TREE_VEC_LENGTH (vec
);
2185 tree default_case
= TREE_VEC_ELT (vec
, n
- 1);
2187 for (low
= -1, high
= n
- 1; high
- low
> 1; )
2189 size_t i
= (high
+ low
) / 2;
2190 tree t
= TREE_VEC_ELT (vec
, i
);
2193 /* Cache the result of comparing CASE_LOW and val. */
2194 cmp
= tree_int_cst_compare (CASE_LOW (t
), val
);
2201 if (CASE_HIGH (t
) == NULL
)
2203 /* A singe-valued case label. */
2209 /* A case range. We can only handle integer ranges. */
2210 if (cmp
<= 0 && tree_int_cst_compare (CASE_HIGH (t
), val
) >= 0)
2215 return default_case
;
2221 /*---------------------------------------------------------------------------
2223 ---------------------------------------------------------------------------*/
2225 /* Dump tree-specific information of block BB to file OUTF. */
2228 tree_dump_bb (basic_block bb
, FILE *outf
, int indent
)
2230 dump_generic_bb (outf
, bb
, indent
, TDF_VOPS
|TDF_MEMSYMS
);
2234 /* Dump a basic block on stderr. */
2237 debug_tree_bb (basic_block bb
)
2239 dump_bb (bb
, stderr
, 0);
2243 /* Dump basic block with index N on stderr. */
2246 debug_tree_bb_n (int n
)
2248 debug_tree_bb (BASIC_BLOCK (n
));
2249 return BASIC_BLOCK (n
);
2253 /* Dump the CFG on stderr.
2255 FLAGS are the same used by the tree dumping functions
2256 (see TDF_* in tree-pass.h). */
2259 debug_tree_cfg (int flags
)
2261 dump_tree_cfg (stderr
, flags
);
2265 /* Dump the program showing basic block boundaries on the given FILE.
2267 FLAGS are the same used by the tree dumping functions (see TDF_* in
2271 dump_tree_cfg (FILE *file
, int flags
)
2273 if (flags
& TDF_DETAILS
)
2275 const char *funcname
2276 = lang_hooks
.decl_printable_name (current_function_decl
, 2);
2279 fprintf (file
, ";; Function %s\n\n", funcname
);
2280 fprintf (file
, ";; \n%d basic blocks, %d edges, last basic block %d.\n\n",
2281 n_basic_blocks
, n_edges
, last_basic_block
);
2283 brief_dump_cfg (file
);
2284 fprintf (file
, "\n");
2287 if (flags
& TDF_STATS
)
2288 dump_cfg_stats (file
);
2290 dump_function_to_file (current_function_decl
, file
, flags
| TDF_BLOCKS
);
2294 /* Dump CFG statistics on FILE. */
2297 dump_cfg_stats (FILE *file
)
2299 static long max_num_merged_labels
= 0;
2300 unsigned long size
, total
= 0;
2303 const char * const fmt_str
= "%-30s%-13s%12s\n";
2304 const char * const fmt_str_1
= "%-30s%13d%11lu%c\n";
2305 const char * const fmt_str_2
= "%-30s%13ld%11lu%c\n";
2306 const char * const fmt_str_3
= "%-43s%11lu%c\n";
2307 const char *funcname
2308 = lang_hooks
.decl_printable_name (current_function_decl
, 2);
2311 fprintf (file
, "\nCFG Statistics for %s\n\n", funcname
);
2313 fprintf (file
, "---------------------------------------------------------\n");
2314 fprintf (file
, fmt_str
, "", " Number of ", "Memory");
2315 fprintf (file
, fmt_str
, "", " instances ", "used ");
2316 fprintf (file
, "---------------------------------------------------------\n");
2318 size
= n_basic_blocks
* sizeof (struct basic_block_def
);
2320 fprintf (file
, fmt_str_1
, "Basic blocks", n_basic_blocks
,
2321 SCALE (size
), LABEL (size
));
2325 num_edges
+= EDGE_COUNT (bb
->succs
);
2326 size
= num_edges
* sizeof (struct edge_def
);
2328 fprintf (file
, fmt_str_2
, "Edges", num_edges
, SCALE (size
), LABEL (size
));
2330 fprintf (file
, "---------------------------------------------------------\n");
2331 fprintf (file
, fmt_str_3
, "Total memory used by CFG data", SCALE (total
),
2333 fprintf (file
, "---------------------------------------------------------\n");
2334 fprintf (file
, "\n");
2336 if (cfg_stats
.num_merged_labels
> max_num_merged_labels
)
2337 max_num_merged_labels
= cfg_stats
.num_merged_labels
;
2339 fprintf (file
, "Coalesced label blocks: %ld (Max so far: %ld)\n",
2340 cfg_stats
.num_merged_labels
, max_num_merged_labels
);
2342 fprintf (file
, "\n");
2346 /* Dump CFG statistics on stderr. Keep extern so that it's always
2347 linked in the final executable. */
2350 debug_cfg_stats (void)
2352 dump_cfg_stats (stderr
);
2356 /* Dump the flowgraph to a .vcg FILE. */
2359 tree_cfg2vcg (FILE *file
)
2364 const char *funcname
2365 = lang_hooks
.decl_printable_name (current_function_decl
, 2);
2367 /* Write the file header. */
2368 fprintf (file
, "graph: { title: \"%s\"\n", funcname
);
2369 fprintf (file
, "node: { title: \"ENTRY\" label: \"ENTRY\" }\n");
2370 fprintf (file
, "node: { title: \"EXIT\" label: \"EXIT\" }\n");
2372 /* Write blocks and edges. */
2373 FOR_EACH_EDGE (e
, ei
, ENTRY_BLOCK_PTR
->succs
)
2375 fprintf (file
, "edge: { sourcename: \"ENTRY\" targetname: \"%d\"",
2378 if (e
->flags
& EDGE_FAKE
)
2379 fprintf (file
, " linestyle: dotted priority: 10");
2381 fprintf (file
, " linestyle: solid priority: 100");
2383 fprintf (file
, " }\n");
2389 enum tree_code head_code
, end_code
;
2390 const char *head_name
, *end_name
;
2393 tree first
= first_stmt (bb
);
2394 tree last
= last_stmt (bb
);
2398 head_code
= TREE_CODE (first
);
2399 head_name
= tree_code_name
[head_code
];
2400 head_line
= get_lineno (first
);
2403 head_name
= "no-statement";
2407 end_code
= TREE_CODE (last
);
2408 end_name
= tree_code_name
[end_code
];
2409 end_line
= get_lineno (last
);
2412 end_name
= "no-statement";
2414 fprintf (file
, "node: { title: \"%d\" label: \"#%d\\n%s (%d)\\n%s (%d)\"}\n",
2415 bb
->index
, bb
->index
, head_name
, head_line
, end_name
,
2418 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
2420 if (e
->dest
== EXIT_BLOCK_PTR
)
2421 fprintf (file
, "edge: { sourcename: \"%d\" targetname: \"EXIT\"", bb
->index
);
2423 fprintf (file
, "edge: { sourcename: \"%d\" targetname: \"%d\"", bb
->index
, e
->dest
->index
);
2425 if (e
->flags
& EDGE_FAKE
)
2426 fprintf (file
, " priority: 10 linestyle: dotted");
2428 fprintf (file
, " priority: 100 linestyle: solid");
2430 fprintf (file
, " }\n");
2433 if (bb
->next_bb
!= EXIT_BLOCK_PTR
)
2437 fputs ("}\n\n", file
);
2442 /*---------------------------------------------------------------------------
2443 Miscellaneous helpers
2444 ---------------------------------------------------------------------------*/
2446 /* Return true if T represents a stmt that always transfers control. */
2449 is_ctrl_stmt (const_tree t
)
2451 return (TREE_CODE (t
) == COND_EXPR
2452 || TREE_CODE (t
) == SWITCH_EXPR
2453 || TREE_CODE (t
) == GOTO_EXPR
2454 || TREE_CODE (t
) == RETURN_EXPR
2455 || TREE_CODE (t
) == RESX_EXPR
);
2459 /* Return true if T is a statement that may alter the flow of control
2460 (e.g., a call to a non-returning function). */
2463 is_ctrl_altering_stmt (const_tree t
)
2468 call
= get_call_expr_in (CONST_CAST_TREE (t
));
2471 /* A non-pure/const CALL_EXPR alters flow control if the current
2472 function has nonlocal labels. */
2473 if (TREE_SIDE_EFFECTS (call
) && current_function_has_nonlocal_label
)
2476 /* A CALL_EXPR also alters control flow if it does not return. */
2477 if (call_expr_flags (call
) & ECF_NORETURN
)
2481 /* OpenMP directives alter control flow. */
2482 if (OMP_DIRECTIVE_P (t
))
2485 /* If a statement can throw, it alters control flow. */
2486 return tree_can_throw_internal (t
);
2490 /* Return true if T is a computed goto. */
2493 computed_goto_p (const_tree t
)
2495 return (TREE_CODE (t
) == GOTO_EXPR
2496 && TREE_CODE (GOTO_DESTINATION (t
)) != LABEL_DECL
);
2500 /* Return true if T is a simple local goto. */
2503 simple_goto_p (const_tree t
)
2505 return (TREE_CODE (t
) == GOTO_EXPR
2506 && TREE_CODE (GOTO_DESTINATION (t
)) == LABEL_DECL
);
2510 /* Return true if T can make an abnormal transfer of control flow.
2511 Transfers of control flow associated with EH are excluded. */
2514 tree_can_make_abnormal_goto (const_tree t
)
2516 if (computed_goto_p (t
))
2518 if (TREE_CODE (t
) == GIMPLE_MODIFY_STMT
)
2519 t
= GIMPLE_STMT_OPERAND (t
, 1);
2520 if (TREE_CODE (t
) == WITH_SIZE_EXPR
)
2521 t
= TREE_OPERAND (t
, 0);
2522 if (TREE_CODE (t
) == CALL_EXPR
)
2523 return TREE_SIDE_EFFECTS (t
) && current_function_has_nonlocal_label
;
2528 /* Return true if T should start a new basic block. PREV_T is the
2529 statement preceding T. It is used when T is a label or a case label.
2530 Labels should only start a new basic block if their previous statement
2531 wasn't a label. Otherwise, sequence of labels would generate
2532 unnecessary basic blocks that only contain a single label. */
2535 stmt_starts_bb_p (const_tree t
, const_tree prev_t
)
2540 /* LABEL_EXPRs start a new basic block only if the preceding
2541 statement wasn't a label of the same type. This prevents the
2542 creation of consecutive blocks that have nothing but a single
2544 if (TREE_CODE (t
) == LABEL_EXPR
)
2546 /* Nonlocal and computed GOTO targets always start a new block. */
2547 if (DECL_NONLOCAL (LABEL_EXPR_LABEL (t
))
2548 || FORCED_LABEL (LABEL_EXPR_LABEL (t
)))
2551 if (prev_t
&& TREE_CODE (prev_t
) == LABEL_EXPR
)
2553 if (DECL_NONLOCAL (LABEL_EXPR_LABEL (prev_t
)))
2556 cfg_stats
.num_merged_labels
++;
2567 /* Return true if T should end a basic block. */
2570 stmt_ends_bb_p (const_tree t
)
2572 return is_ctrl_stmt (t
) || is_ctrl_altering_stmt (t
);
2575 /* Remove block annotations and other datastructures. */
2578 delete_tree_cfg_annotations (void)
2581 block_stmt_iterator bsi
;
2583 /* Remove annotations from every tree in the function. */
2585 for (bsi
= bsi_start (bb
); !bsi_end_p (bsi
); bsi_next (&bsi
))
2587 tree stmt
= bsi_stmt (bsi
);
2588 ggc_free (stmt
->base
.ann
);
2589 stmt
->base
.ann
= NULL
;
2591 label_to_block_map
= NULL
;
2595 /* Return the first statement in basic block BB. */
2598 first_stmt (basic_block bb
)
2600 block_stmt_iterator i
= bsi_start (bb
);
2601 return !bsi_end_p (i
) ? bsi_stmt (i
) : NULL_TREE
;
2604 /* Return the last statement in basic block BB. */
2607 last_stmt (basic_block bb
)
2609 block_stmt_iterator b
= bsi_last (bb
);
2610 return !bsi_end_p (b
) ? bsi_stmt (b
) : NULL_TREE
;
2613 /* Return the last statement of an otherwise empty block. Return NULL
2614 if the block is totally empty, or if it contains more than one
2618 last_and_only_stmt (basic_block bb
)
2620 block_stmt_iterator i
= bsi_last (bb
);
2626 last
= bsi_stmt (i
);
2631 /* Empty statements should no longer appear in the instruction stream.
2632 Everything that might have appeared before should be deleted by
2633 remove_useless_stmts, and the optimizers should just bsi_remove
2634 instead of smashing with build_empty_stmt.
2636 Thus the only thing that should appear here in a block containing
2637 one executable statement is a label. */
2638 prev
= bsi_stmt (i
);
2639 if (TREE_CODE (prev
) == LABEL_EXPR
)
2646 /* Mark BB as the basic block holding statement T. */
2649 set_bb_for_stmt (tree t
, basic_block bb
)
2651 if (TREE_CODE (t
) == PHI_NODE
)
2653 else if (TREE_CODE (t
) == STATEMENT_LIST
)
2655 tree_stmt_iterator i
;
2656 for (i
= tsi_start (t
); !tsi_end_p (i
); tsi_next (&i
))
2657 set_bb_for_stmt (tsi_stmt (i
), bb
);
2661 stmt_ann_t ann
= get_stmt_ann (t
);
2664 /* If the statement is a label, add the label to block-to-labels map
2665 so that we can speed up edge creation for GOTO_EXPRs. */
2666 if (TREE_CODE (t
) == LABEL_EXPR
)
2670 t
= LABEL_EXPR_LABEL (t
);
2671 uid
= LABEL_DECL_UID (t
);
2674 unsigned old_len
= VEC_length (basic_block
, label_to_block_map
);
2675 LABEL_DECL_UID (t
) = uid
= cfun
->last_label_uid
++;
2676 if (old_len
<= (unsigned) uid
)
2678 unsigned new_len
= 3 * uid
/ 2;
2680 VEC_safe_grow_cleared (basic_block
, gc
, label_to_block_map
,
2685 /* We're moving an existing label. Make sure that we've
2686 removed it from the old block. */
2688 || !VEC_index (basic_block
, label_to_block_map
, uid
));
2689 VEC_replace (basic_block
, label_to_block_map
, uid
, bb
);
2694 /* Faster version of set_bb_for_stmt that assume that statement is being moved
2695 from one basic block to another.
2696 For BB splitting we can run into quadratic case, so performance is quite
2697 important and knowing that the tables are big enough, change_bb_for_stmt
2698 can inline as leaf function. */
2700 change_bb_for_stmt (tree t
, basic_block bb
)
2702 get_stmt_ann (t
)->bb
= bb
;
2703 if (TREE_CODE (t
) == LABEL_EXPR
)
2704 VEC_replace (basic_block
, label_to_block_map
,
2705 LABEL_DECL_UID (LABEL_EXPR_LABEL (t
)), bb
);
2708 /* Finds iterator for STMT. */
2710 extern block_stmt_iterator
2711 bsi_for_stmt (tree stmt
)
2713 block_stmt_iterator bsi
;
2715 for (bsi
= bsi_start (bb_for_stmt (stmt
)); !bsi_end_p (bsi
); bsi_next (&bsi
))
2716 if (bsi_stmt (bsi
) == stmt
)
2722 /* Mark statement T as modified, and update it. */
2724 update_modified_stmts (tree t
)
2726 if (!ssa_operands_active ())
2728 if (TREE_CODE (t
) == STATEMENT_LIST
)
2730 tree_stmt_iterator i
;
2732 for (i
= tsi_start (t
); !tsi_end_p (i
); tsi_next (&i
))
2734 stmt
= tsi_stmt (i
);
2735 update_stmt_if_modified (stmt
);
2739 update_stmt_if_modified (t
);
2742 /* Insert statement (or statement list) T before the statement
2743 pointed-to by iterator I. M specifies how to update iterator I
2744 after insertion (see enum bsi_iterator_update). */
2747 bsi_insert_before (block_stmt_iterator
*i
, tree t
, enum bsi_iterator_update m
)
2749 set_bb_for_stmt (t
, i
->bb
);
2750 update_modified_stmts (t
);
2751 tsi_link_before (&i
->tsi
, t
, m
);
2755 /* Insert statement (or statement list) T after the statement
2756 pointed-to by iterator I. M specifies how to update iterator I
2757 after insertion (see enum bsi_iterator_update). */
2760 bsi_insert_after (block_stmt_iterator
*i
, tree t
, enum bsi_iterator_update m
)
2762 set_bb_for_stmt (t
, i
->bb
);
2763 update_modified_stmts (t
);
2764 tsi_link_after (&i
->tsi
, t
, m
);
2768 /* Remove the statement pointed to by iterator I. The iterator is updated
2769 to the next statement.
2771 When REMOVE_EH_INFO is true we remove the statement pointed to by
2772 iterator I from the EH tables. Otherwise we do not modify the EH
2775 Generally, REMOVE_EH_INFO should be true when the statement is going to
2776 be removed from the IL and not reinserted elsewhere. */
2779 bsi_remove (block_stmt_iterator
*i
, bool remove_eh_info
)
2781 tree t
= bsi_stmt (*i
);
2782 set_bb_for_stmt (t
, NULL
);
2783 delink_stmt_imm_use (t
);
2784 tsi_delink (&i
->tsi
);
2785 mark_stmt_modified (t
);
2788 remove_stmt_from_eh_region (t
);
2789 gimple_remove_stmt_histograms (cfun
, t
);
2794 /* Move the statement at FROM so it comes right after the statement at TO. */
2797 bsi_move_after (block_stmt_iterator
*from
, block_stmt_iterator
*to
)
2799 tree stmt
= bsi_stmt (*from
);
2800 bsi_remove (from
, false);
2801 /* We must have BSI_NEW_STMT here, as bsi_move_after is sometimes used to
2802 move statements to an empty block. */
2803 bsi_insert_after (to
, stmt
, BSI_NEW_STMT
);
2807 /* Move the statement at FROM so it comes right before the statement at TO. */
2810 bsi_move_before (block_stmt_iterator
*from
, block_stmt_iterator
*to
)
2812 tree stmt
= bsi_stmt (*from
);
2813 bsi_remove (from
, false);
2814 /* For consistency with bsi_move_after, it might be better to have
2815 BSI_NEW_STMT here; however, that breaks several places that expect
2816 that TO does not change. */
2817 bsi_insert_before (to
, stmt
, BSI_SAME_STMT
);
2821 /* Move the statement at FROM to the end of basic block BB. */
2824 bsi_move_to_bb_end (block_stmt_iterator
*from
, basic_block bb
)
2826 block_stmt_iterator last
= bsi_last (bb
);
2828 /* Have to check bsi_end_p because it could be an empty block. */
2829 if (!bsi_end_p (last
) && is_ctrl_stmt (bsi_stmt (last
)))
2830 bsi_move_before (from
, &last
);
2832 bsi_move_after (from
, &last
);
2836 /* Replace the contents of the statement pointed to by iterator BSI
2837 with STMT. If UPDATE_EH_INFO is true, the exception handling
2838 information of the original statement is moved to the new statement. */
2841 bsi_replace (const block_stmt_iterator
*bsi
, tree stmt
, bool update_eh_info
)
2844 tree orig_stmt
= bsi_stmt (*bsi
);
2846 if (stmt
== orig_stmt
)
2848 SET_EXPR_LOCUS (stmt
, EXPR_LOCUS (orig_stmt
));
2849 set_bb_for_stmt (stmt
, bsi
->bb
);
2851 /* Preserve EH region information from the original statement, if
2852 requested by the caller. */
2855 eh_region
= lookup_stmt_eh_region (orig_stmt
);
2858 remove_stmt_from_eh_region (orig_stmt
);
2859 add_stmt_to_eh_region (stmt
, eh_region
);
2863 gimple_duplicate_stmt_histograms (cfun
, stmt
, cfun
, orig_stmt
);
2864 gimple_remove_stmt_histograms (cfun
, orig_stmt
);
2865 delink_stmt_imm_use (orig_stmt
);
2866 *bsi_stmt_ptr (*bsi
) = stmt
;
2867 mark_stmt_modified (stmt
);
2868 update_modified_stmts (stmt
);
2872 /* Insert the statement pointed-to by BSI into edge E. Every attempt
2873 is made to place the statement in an existing basic block, but
2874 sometimes that isn't possible. When it isn't possible, the edge is
2875 split and the statement is added to the new block.
2877 In all cases, the returned *BSI points to the correct location. The
2878 return value is true if insertion should be done after the location,
2879 or false if it should be done before the location. If new basic block
2880 has to be created, it is stored in *NEW_BB. */
2883 tree_find_edge_insert_loc (edge e
, block_stmt_iterator
*bsi
,
2884 basic_block
*new_bb
)
2886 basic_block dest
, src
;
2892 /* If the destination has one predecessor which has no PHI nodes,
2893 insert there. Except for the exit block.
2895 The requirement for no PHI nodes could be relaxed. Basically we
2896 would have to examine the PHIs to prove that none of them used
2897 the value set by the statement we want to insert on E. That
2898 hardly seems worth the effort. */
2899 if (single_pred_p (dest
)
2900 && ! phi_nodes (dest
)
2901 && dest
!= EXIT_BLOCK_PTR
)
2903 *bsi
= bsi_start (dest
);
2904 if (bsi_end_p (*bsi
))
2907 /* Make sure we insert after any leading labels. */
2908 tmp
= bsi_stmt (*bsi
);
2909 while (TREE_CODE (tmp
) == LABEL_EXPR
)
2912 if (bsi_end_p (*bsi
))
2914 tmp
= bsi_stmt (*bsi
);
2917 if (bsi_end_p (*bsi
))
2919 *bsi
= bsi_last (dest
);
2926 /* If the source has one successor, the edge is not abnormal and
2927 the last statement does not end a basic block, insert there.
2928 Except for the entry block. */
2930 if ((e
->flags
& EDGE_ABNORMAL
) == 0
2931 && single_succ_p (src
)
2932 && src
!= ENTRY_BLOCK_PTR
)
2934 *bsi
= bsi_last (src
);
2935 if (bsi_end_p (*bsi
))
2938 tmp
= bsi_stmt (*bsi
);
2939 if (!stmt_ends_bb_p (tmp
))
2942 /* Insert code just before returning the value. We may need to decompose
2943 the return in the case it contains non-trivial operand. */
2944 if (TREE_CODE (tmp
) == RETURN_EXPR
)
2946 tree op
= TREE_OPERAND (tmp
, 0);
2947 if (op
&& !is_gimple_val (op
))
2949 gcc_assert (TREE_CODE (op
) == GIMPLE_MODIFY_STMT
);
2950 bsi_insert_before (bsi
, op
, BSI_NEW_STMT
);
2951 TREE_OPERAND (tmp
, 0) = GIMPLE_STMT_OPERAND (op
, 0);
2958 /* Otherwise, create a new basic block, and split this edge. */
2959 dest
= split_edge (e
);
2962 e
= single_pred_edge (dest
);
2967 /* This routine will commit all pending edge insertions, creating any new
2968 basic blocks which are necessary. */
2971 bsi_commit_edge_inserts (void)
2977 bsi_commit_one_edge_insert (single_succ_edge (ENTRY_BLOCK_PTR
), NULL
);
2980 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
2981 bsi_commit_one_edge_insert (e
, NULL
);
2985 /* Commit insertions pending at edge E. If a new block is created, set NEW_BB
2986 to this block, otherwise set it to NULL. */
2989 bsi_commit_one_edge_insert (edge e
, basic_block
*new_bb
)
2993 if (PENDING_STMT (e
))
2995 block_stmt_iterator bsi
;
2996 tree stmt
= PENDING_STMT (e
);
2998 PENDING_STMT (e
) = NULL_TREE
;
3000 if (tree_find_edge_insert_loc (e
, &bsi
, new_bb
))
3001 bsi_insert_after (&bsi
, stmt
, BSI_NEW_STMT
);
3003 bsi_insert_before (&bsi
, stmt
, BSI_NEW_STMT
);
3008 /* Add STMT to the pending list of edge E. No actual insertion is
3009 made until a call to bsi_commit_edge_inserts () is made. */
3012 bsi_insert_on_edge (edge e
, tree stmt
)
3014 append_to_statement_list (stmt
, &PENDING_STMT (e
));
3017 /* Similar to bsi_insert_on_edge+bsi_commit_edge_inserts. If a new
3018 block has to be created, it is returned. */
3021 bsi_insert_on_edge_immediate (edge e
, tree stmt
)
3023 block_stmt_iterator bsi
;
3024 basic_block new_bb
= NULL
;
3026 gcc_assert (!PENDING_STMT (e
));
3028 if (tree_find_edge_insert_loc (e
, &bsi
, &new_bb
))
3029 bsi_insert_after (&bsi
, stmt
, BSI_NEW_STMT
);
3031 bsi_insert_before (&bsi
, stmt
, BSI_NEW_STMT
);
3036 /*---------------------------------------------------------------------------
3037 Tree specific functions for CFG manipulation
3038 ---------------------------------------------------------------------------*/
3040 /* Reinstall those PHI arguments queued in OLD_EDGE to NEW_EDGE. */
3043 reinstall_phi_args (edge new_edge
, edge old_edge
)
3047 if (!PENDING_STMT (old_edge
))
3050 for (var
= PENDING_STMT (old_edge
), phi
= phi_nodes (new_edge
->dest
);
3052 var
= TREE_CHAIN (var
), phi
= PHI_CHAIN (phi
))
3054 tree result
= TREE_PURPOSE (var
);
3055 tree arg
= TREE_VALUE (var
);
3057 gcc_assert (result
== PHI_RESULT (phi
));
3059 add_phi_arg (phi
, arg
, new_edge
);
3062 PENDING_STMT (old_edge
) = NULL
;
3065 /* Returns the basic block after which the new basic block created
3066 by splitting edge EDGE_IN should be placed. Tries to keep the new block
3067 near its "logical" location. This is of most help to humans looking
3068 at debugging dumps. */
3071 split_edge_bb_loc (edge edge_in
)
3073 basic_block dest
= edge_in
->dest
;
3075 if (dest
->prev_bb
&& find_edge (dest
->prev_bb
, dest
))
3076 return edge_in
->src
;
3078 return dest
->prev_bb
;
3081 /* Split a (typically critical) edge EDGE_IN. Return the new block.
3082 Abort on abnormal edges. */
3085 tree_split_edge (edge edge_in
)
3087 basic_block new_bb
, after_bb
, dest
;
3090 /* Abnormal edges cannot be split. */
3091 gcc_assert (!(edge_in
->flags
& EDGE_ABNORMAL
));
3093 dest
= edge_in
->dest
;
3095 after_bb
= split_edge_bb_loc (edge_in
);
3097 new_bb
= create_empty_bb (after_bb
);
3098 new_bb
->frequency
= EDGE_FREQUENCY (edge_in
);
3099 new_bb
->count
= edge_in
->count
;
3100 new_edge
= make_edge (new_bb
, dest
, EDGE_FALLTHRU
);
3101 new_edge
->probability
= REG_BR_PROB_BASE
;
3102 new_edge
->count
= edge_in
->count
;
3104 e
= redirect_edge_and_branch (edge_in
, new_bb
);
3105 gcc_assert (e
== edge_in
);
3106 reinstall_phi_args (new_edge
, e
);
3111 /* Callback for walk_tree, check that all elements with address taken are
3112 properly noticed as such. The DATA is an int* that is 1 if TP was seen
3113 inside a PHI node. */
3116 verify_expr (tree
*tp
, int *walk_subtrees
, void *data ATTRIBUTE_UNUSED
)
3119 bool in_phi
= (data
!= NULL
);
3124 /* Check operand N for being valid GIMPLE and give error MSG if not. */
3125 #define CHECK_OP(N, MSG) \
3126 do { if (!is_gimple_val (TREE_OPERAND (t, N))) \
3127 { error (MSG); return TREE_OPERAND (t, N); }} while (0)
3129 switch (TREE_CODE (t
))
3132 if (SSA_NAME_IN_FREE_LIST (t
))
3134 error ("SSA name in freelist but still referenced");
3140 x
= fold (ASSERT_EXPR_COND (t
));
3141 if (x
== boolean_false_node
)
3143 error ("ASSERT_EXPR with an always-false condition");
3151 case GIMPLE_MODIFY_STMT
:
3152 x
= GIMPLE_STMT_OPERAND (t
, 0);
3153 if (TREE_CODE (x
) == BIT_FIELD_REF
3154 && is_gimple_reg (TREE_OPERAND (x
, 0)))
3156 error ("GIMPLE register modified with BIT_FIELD_REF");
3165 bool old_side_effects
;
3168 bool new_side_effects
;
3170 /* ??? tree-ssa-alias.c may have overlooked dead PHI nodes, missing
3171 dead PHIs that take the address of something. But if the PHI
3172 result is dead, the fact that it takes the address of anything
3173 is irrelevant. Because we can not tell from here if a PHI result
3174 is dead, we just skip this check for PHIs altogether. This means
3175 we may be missing "valid" checks, but what can you do?
3176 This was PR19217. */
3180 old_invariant
= TREE_INVARIANT (t
);
3181 old_constant
= TREE_CONSTANT (t
);
3182 old_side_effects
= TREE_SIDE_EFFECTS (t
);
3184 recompute_tree_invariant_for_addr_expr (t
);
3185 new_invariant
= TREE_INVARIANT (t
);
3186 new_side_effects
= TREE_SIDE_EFFECTS (t
);
3187 new_constant
= TREE_CONSTANT (t
);
3189 if (old_invariant
!= new_invariant
)
3191 error ("invariant not recomputed when ADDR_EXPR changed");
3195 if (old_constant
!= new_constant
)
3197 error ("constant not recomputed when ADDR_EXPR changed");
3200 if (old_side_effects
!= new_side_effects
)
3202 error ("side effects not recomputed when ADDR_EXPR changed");
3206 /* Skip any references (they will be checked when we recurse down the
3207 tree) and ensure that any variable used as a prefix is marked
3209 for (x
= TREE_OPERAND (t
, 0);
3210 handled_component_p (x
);
3211 x
= TREE_OPERAND (x
, 0))
3214 if (TREE_CODE (x
) != VAR_DECL
&& TREE_CODE (x
) != PARM_DECL
)
3216 if (!TREE_ADDRESSABLE (x
))
3218 error ("address taken, but ADDRESSABLE bit not set");
3225 x
= COND_EXPR_COND (t
);
3226 if (!INTEGRAL_TYPE_P (TREE_TYPE (x
)))
3228 error ("non-integral used in condition");
3231 if (!is_gimple_condexpr (x
))
3233 error ("invalid conditional operand");
3240 case FIX_TRUNC_EXPR
:
3245 case NON_LVALUE_EXPR
:
3246 case TRUTH_NOT_EXPR
:
3247 CHECK_OP (0, "invalid operand to unary operator");
3254 case ARRAY_RANGE_REF
:
3256 case VIEW_CONVERT_EXPR
:
3257 /* We have a nest of references. Verify that each of the operands
3258 that determine where to reference is either a constant or a variable,
3259 verify that the base is valid, and then show we've already checked
3261 while (handled_component_p (t
))
3263 if (TREE_CODE (t
) == COMPONENT_REF
&& TREE_OPERAND (t
, 2))
3264 CHECK_OP (2, "invalid COMPONENT_REF offset operator");
3265 else if (TREE_CODE (t
) == ARRAY_REF
3266 || TREE_CODE (t
) == ARRAY_RANGE_REF
)
3268 CHECK_OP (1, "invalid array index");
3269 if (TREE_OPERAND (t
, 2))
3270 CHECK_OP (2, "invalid array lower bound");
3271 if (TREE_OPERAND (t
, 3))
3272 CHECK_OP (3, "invalid array stride");
3274 else if (TREE_CODE (t
) == BIT_FIELD_REF
)
3276 CHECK_OP (1, "invalid operand to BIT_FIELD_REF");
3277 CHECK_OP (2, "invalid operand to BIT_FIELD_REF");
3280 t
= TREE_OPERAND (t
, 0);
3283 if (!CONSTANT_CLASS_P (t
) && !is_gimple_lvalue (t
))
3285 error ("invalid reference prefix");
3292 /* PLUS_EXPR and MINUS_EXPR don't work on pointers, they should be done using
3293 POINTER_PLUS_EXPR. */
3294 if (POINTER_TYPE_P (TREE_TYPE (t
)))
3296 error ("invalid operand to plus/minus, type is a pointer");
3299 CHECK_OP (0, "invalid operand to binary operator");
3300 CHECK_OP (1, "invalid operand to binary operator");
3303 case POINTER_PLUS_EXPR
:
3304 /* Check to make sure the first operand is a pointer or reference type. */
3305 if (!POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (t
, 0))))
3307 error ("invalid operand to pointer plus, first operand is not a pointer");
3310 /* Check to make sure the second operand is an integer with type of
3312 if (!useless_type_conversion_p (sizetype
,
3313 TREE_TYPE (TREE_OPERAND (t
, 1))))
3315 error ("invalid operand to pointer plus, second operand is not an "
3316 "integer with type of sizetype.");
3326 case UNORDERED_EXPR
:
3335 case TRUNC_DIV_EXPR
:
3337 case FLOOR_DIV_EXPR
:
3338 case ROUND_DIV_EXPR
:
3339 case TRUNC_MOD_EXPR
:
3341 case FLOOR_MOD_EXPR
:
3342 case ROUND_MOD_EXPR
:
3344 case EXACT_DIV_EXPR
:
3354 CHECK_OP (0, "invalid operand to binary operator");
3355 CHECK_OP (1, "invalid operand to binary operator");
3359 if (TREE_CONSTANT (t
) && TREE_CODE (TREE_TYPE (t
)) == VECTOR_TYPE
)
3371 /* Verifies if EXPR is a valid GIMPLE unary expression. Returns true
3372 if there is an error, otherwise false. */
3375 verify_gimple_unary_expr (const_tree expr
)
3377 tree op
= TREE_OPERAND (expr
, 0);
3378 tree type
= TREE_TYPE (expr
);
3380 if (!is_gimple_val (op
))
3382 error ("invalid operand in unary expression");
3386 /* For general unary expressions we have the operations type
3387 as the effective type the operation is carried out on. So all
3388 we need to require is that the operand is trivially convertible
3390 if (!useless_type_conversion_p (type
, TREE_TYPE (op
)))
3392 error ("type mismatch in unary expression");
3393 debug_generic_expr (type
);
3394 debug_generic_expr (TREE_TYPE (op
));
3401 /* Verifies if EXPR is a valid GIMPLE binary expression. Returns true
3402 if there is an error, otherwise false. */
3405 verify_gimple_binary_expr (const_tree expr
)
3407 tree op0
= TREE_OPERAND (expr
, 0);
3408 tree op1
= TREE_OPERAND (expr
, 1);
3409 tree type
= TREE_TYPE (expr
);
3411 if (!is_gimple_val (op0
) || !is_gimple_val (op1
))
3413 error ("invalid operands in binary expression");
3417 /* For general binary expressions we have the operations type
3418 as the effective type the operation is carried out on. So all
3419 we need to require is that both operands are trivially convertible
3421 if (!useless_type_conversion_p (type
, TREE_TYPE (op0
))
3422 || !useless_type_conversion_p (type
, TREE_TYPE (op1
)))
3424 error ("type mismatch in binary expression");
3425 debug_generic_stmt (type
);
3426 debug_generic_stmt (TREE_TYPE (op0
));
3427 debug_generic_stmt (TREE_TYPE (op1
));
3434 /* Verify if EXPR is either a GIMPLE ID or a GIMPLE indirect reference.
3435 Returns true if there is an error, otherwise false. */
3438 verify_gimple_min_lval (tree expr
)
3442 if (is_gimple_id (expr
))
3445 if (TREE_CODE (expr
) != INDIRECT_REF
3446 && TREE_CODE (expr
) != ALIGN_INDIRECT_REF
3447 && TREE_CODE (expr
) != MISALIGNED_INDIRECT_REF
)
3449 error ("invalid expression for min lvalue");
3453 op
= TREE_OPERAND (expr
, 0);
3454 if (!is_gimple_val (op
))
3456 error ("invalid operand in indirect reference");
3457 debug_generic_stmt (op
);
3460 if (!useless_type_conversion_p (TREE_TYPE (expr
),
3461 TREE_TYPE (TREE_TYPE (op
))))
3463 error ("type mismatch in indirect reference");
3464 debug_generic_stmt (TREE_TYPE (expr
));
3465 debug_generic_stmt (TREE_TYPE (TREE_TYPE (op
)));
3472 /* Verify if EXPR is a valid GIMPLE reference expression. Returns true
3473 if there is an error, otherwise false. */
3476 verify_gimple_reference (tree expr
)
3478 while (handled_component_p (expr
))
3480 tree op
= TREE_OPERAND (expr
, 0);
3482 if (TREE_CODE (expr
) == ARRAY_REF
3483 || TREE_CODE (expr
) == ARRAY_RANGE_REF
)
3485 if (!is_gimple_val (TREE_OPERAND (expr
, 1))
3486 || (TREE_OPERAND (expr
, 2)
3487 && !is_gimple_val (TREE_OPERAND (expr
, 2)))
3488 || (TREE_OPERAND (expr
, 3)
3489 && !is_gimple_val (TREE_OPERAND (expr
, 3))))
3491 error ("invalid operands to array reference");
3492 debug_generic_stmt (expr
);
3497 /* Verify if the reference array element types are compatible. */
3498 if (TREE_CODE (expr
) == ARRAY_REF
3499 && !useless_type_conversion_p (TREE_TYPE (expr
),
3500 TREE_TYPE (TREE_TYPE (op
))))
3502 error ("type mismatch in array reference");
3503 debug_generic_stmt (TREE_TYPE (expr
));
3504 debug_generic_stmt (TREE_TYPE (TREE_TYPE (op
)));
3507 if (TREE_CODE (expr
) == ARRAY_RANGE_REF
3508 && !useless_type_conversion_p (TREE_TYPE (TREE_TYPE (expr
)),
3509 TREE_TYPE (TREE_TYPE (op
))))
3511 error ("type mismatch in array range reference");
3512 debug_generic_stmt (TREE_TYPE (TREE_TYPE (expr
)));
3513 debug_generic_stmt (TREE_TYPE (TREE_TYPE (op
)));
3517 if ((TREE_CODE (expr
) == REALPART_EXPR
3518 || TREE_CODE (expr
) == IMAGPART_EXPR
)
3519 && !useless_type_conversion_p (TREE_TYPE (expr
),
3520 TREE_TYPE (TREE_TYPE (op
))))
3522 error ("type mismatch in real/imagpart reference");
3523 debug_generic_stmt (TREE_TYPE (expr
));
3524 debug_generic_stmt (TREE_TYPE (TREE_TYPE (op
)));
3528 if (TREE_CODE (expr
) == COMPONENT_REF
3529 && !useless_type_conversion_p (TREE_TYPE (expr
),
3530 TREE_TYPE (TREE_OPERAND (expr
, 1))))
3532 error ("type mismatch in component reference");
3533 debug_generic_stmt (TREE_TYPE (expr
));
3534 debug_generic_stmt (TREE_TYPE (TREE_OPERAND (expr
, 1)));
3538 /* For VIEW_CONVERT_EXPRs which are allowed here, too, there
3539 is nothing to verify. Gross mismatches at most invoke
3540 undefined behavior. */
3545 return verify_gimple_min_lval (expr
);
3548 /* Returns true if there is one pointer type in TYPE_POINTER_TO (SRC_OBJ)
3549 list of pointer-to types that is trivially convertible to DEST. */
3552 one_pointer_to_useless_type_conversion_p (tree dest
, tree src_obj
)
3556 if (!TYPE_POINTER_TO (src_obj
))
3559 for (src
= TYPE_POINTER_TO (src_obj
); src
; src
= TYPE_NEXT_PTR_TO (src
))
3560 if (useless_type_conversion_p (dest
, src
))
3566 /* Verify the GIMPLE expression EXPR. Returns true if there is an
3567 error, otherwise false. */
3570 verify_gimple_expr (tree expr
)
3572 tree type
= TREE_TYPE (expr
);
3574 if (is_gimple_val (expr
))
3577 /* Special codes we cannot handle via their class. */
3578 switch (TREE_CODE (expr
))
3583 tree op
= TREE_OPERAND (expr
, 0);
3584 if (!is_gimple_val (op
))
3586 error ("invalid operand in conversion");
3590 /* Allow conversions between integral types and between
3592 if ((INTEGRAL_TYPE_P (type
) && INTEGRAL_TYPE_P (TREE_TYPE (op
)))
3593 || (POINTER_TYPE_P (type
) && POINTER_TYPE_P (TREE_TYPE (op
))))
3596 /* Allow conversions between integral types and pointers only if
3597 there is no sign or zero extension involved. */
3598 if (((POINTER_TYPE_P (type
) && INTEGRAL_TYPE_P (TREE_TYPE (op
)))
3599 || (POINTER_TYPE_P (TREE_TYPE (op
)) && INTEGRAL_TYPE_P (type
)))
3600 && TYPE_PRECISION (type
) == TYPE_PRECISION (TREE_TYPE (op
)))
3603 /* Allow conversion from integer to offset type and vice versa. */
3604 if ((TREE_CODE (type
) == OFFSET_TYPE
3605 && TREE_CODE (TREE_TYPE (op
)) == INTEGER_TYPE
)
3606 || (TREE_CODE (type
) == INTEGER_TYPE
3607 && TREE_CODE (TREE_TYPE (op
)) == OFFSET_TYPE
))
3610 /* Otherwise assert we are converting between types of the
3612 if (TREE_CODE (type
) != TREE_CODE (TREE_TYPE (op
)))
3614 error ("invalid types in nop conversion");
3615 debug_generic_expr (type
);
3616 debug_generic_expr (TREE_TYPE (op
));
3625 tree op
= TREE_OPERAND (expr
, 0);
3626 if (!is_gimple_val (op
))
3628 error ("invalid operand in int to float conversion");
3631 if (!INTEGRAL_TYPE_P (TREE_TYPE (op
))
3632 || !SCALAR_FLOAT_TYPE_P (type
))
3634 error ("invalid types in conversion to floating point");
3635 debug_generic_expr (type
);
3636 debug_generic_expr (TREE_TYPE (op
));
3642 case FIX_TRUNC_EXPR
:
3644 tree op
= TREE_OPERAND (expr
, 0);
3645 if (!is_gimple_val (op
))
3647 error ("invalid operand in float to int conversion");
3650 if (!INTEGRAL_TYPE_P (type
)
3651 || !SCALAR_FLOAT_TYPE_P (TREE_TYPE (op
)))
3653 error ("invalid types in conversion to integer");
3654 debug_generic_expr (type
);
3655 debug_generic_expr (TREE_TYPE (op
));
3663 tree op0
= TREE_OPERAND (expr
, 0);
3664 tree op1
= TREE_OPERAND (expr
, 1);
3665 if (!is_gimple_val (op0
) || !is_gimple_val (op1
))
3667 error ("invalid operands in complex expression");
3670 if (!TREE_CODE (type
) == COMPLEX_TYPE
3671 || !(TREE_CODE (TREE_TYPE (op0
)) == INTEGER_TYPE
3672 || SCALAR_FLOAT_TYPE_P (TREE_TYPE (op0
)))
3673 || !(TREE_CODE (TREE_TYPE (op1
)) == INTEGER_TYPE
3674 || SCALAR_FLOAT_TYPE_P (TREE_TYPE (op1
)))
3675 || !useless_type_conversion_p (TREE_TYPE (type
),
3677 || !useless_type_conversion_p (TREE_TYPE (type
),
3680 error ("type mismatch in complex expression");
3681 debug_generic_stmt (TREE_TYPE (expr
));
3682 debug_generic_stmt (TREE_TYPE (op0
));
3683 debug_generic_stmt (TREE_TYPE (op1
));
3691 /* This is used like COMPLEX_EXPR but for vectors. */
3692 if (TREE_CODE (type
) != VECTOR_TYPE
)
3694 error ("constructor not allowed for non-vector types");
3695 debug_generic_stmt (type
);
3698 /* FIXME: verify constructor arguments. */
3707 tree op0
= TREE_OPERAND (expr
, 0);
3708 tree op1
= TREE_OPERAND (expr
, 1);
3709 if (!is_gimple_val (op0
) || !is_gimple_val (op1
))
3711 error ("invalid operands in shift expression");
3714 if (!TREE_CODE (TREE_TYPE (op1
)) == INTEGER_TYPE
3715 || !useless_type_conversion_p (type
, TREE_TYPE (op0
)))
3717 error ("type mismatch in shift expression");
3718 debug_generic_stmt (TREE_TYPE (expr
));
3719 debug_generic_stmt (TREE_TYPE (op0
));
3720 debug_generic_stmt (TREE_TYPE (op1
));
3729 tree op0
= TREE_OPERAND (expr
, 0);
3730 tree op1
= TREE_OPERAND (expr
, 1);
3731 if (POINTER_TYPE_P (type
)
3732 || POINTER_TYPE_P (TREE_TYPE (op0
))
3733 || POINTER_TYPE_P (TREE_TYPE (op1
)))
3735 error ("invalid (pointer) operands to plus/minus");
3738 /* Continue with generic binary expression handling. */
3742 case POINTER_PLUS_EXPR
:
3744 tree op0
= TREE_OPERAND (expr
, 0);
3745 tree op1
= TREE_OPERAND (expr
, 1);
3746 if (!is_gimple_val (op0
) || !is_gimple_val (op1
))
3748 error ("invalid operands in pointer plus expression");
3751 if (!POINTER_TYPE_P (TREE_TYPE (op0
))
3752 || !useless_type_conversion_p (type
, TREE_TYPE (op0
))
3753 || !useless_type_conversion_p (sizetype
, TREE_TYPE (op1
)))
3755 error ("type mismatch in pointer plus expression");
3756 debug_generic_stmt (type
);
3757 debug_generic_stmt (TREE_TYPE (op0
));
3758 debug_generic_stmt (TREE_TYPE (op1
));
3766 tree op0
= TREE_OPERAND (expr
, 0);
3767 tree op1
= TREE_OPERAND (expr
, 1);
3768 tree op2
= TREE_OPERAND (expr
, 2);
3769 if ((!is_gimple_val (op1
)
3770 && TREE_CODE (TREE_TYPE (op1
)) != VOID_TYPE
)
3771 || (!is_gimple_val (op2
)
3772 && TREE_CODE (TREE_TYPE (op2
)) != VOID_TYPE
))
3774 error ("invalid operands in conditional expression");
3777 if (!INTEGRAL_TYPE_P (TREE_TYPE (op0
))
3778 || (TREE_CODE (TREE_TYPE (op1
)) != VOID_TYPE
3779 && !useless_type_conversion_p (type
, TREE_TYPE (op1
)))
3780 || (TREE_CODE (TREE_TYPE (op2
)) != VOID_TYPE
3781 && !useless_type_conversion_p (type
, TREE_TYPE (op2
))))
3783 error ("type mismatch in conditional expression");
3784 debug_generic_stmt (type
);
3785 debug_generic_stmt (TREE_TYPE (op0
));
3786 debug_generic_stmt (TREE_TYPE (op1
));
3787 debug_generic_stmt (TREE_TYPE (op2
));
3790 return verify_gimple_expr (op0
);
3795 tree op
= TREE_OPERAND (expr
, 0);
3796 if (!is_gimple_addressable (op
))
3798 error ("invalid operand in unary expression");
3801 if (!one_pointer_to_useless_type_conversion_p (type
, TREE_TYPE (op
))
3802 /* FIXME: a longstanding wart, &a == &a[0]. */
3803 && (TREE_CODE (TREE_TYPE (op
)) != ARRAY_TYPE
3804 || !one_pointer_to_useless_type_conversion_p (type
,
3805 TREE_TYPE (TREE_TYPE (op
)))))
3807 error ("type mismatch in address expression");
3808 debug_generic_stmt (TREE_TYPE (expr
));
3809 debug_generic_stmt (TYPE_POINTER_TO (TREE_TYPE (op
)));
3813 return verify_gimple_reference (op
);
3816 case TRUTH_ANDIF_EXPR
:
3817 case TRUTH_ORIF_EXPR
:
3818 case TRUTH_AND_EXPR
:
3820 case TRUTH_XOR_EXPR
:
3822 tree op0
= TREE_OPERAND (expr
, 0);
3823 tree op1
= TREE_OPERAND (expr
, 1);
3825 if (!is_gimple_val (op0
) || !is_gimple_val (op1
))
3827 error ("invalid operands in truth expression");
3831 /* We allow any kind of integral typed argument and result. */
3832 if (!INTEGRAL_TYPE_P (TREE_TYPE (op0
))
3833 || !INTEGRAL_TYPE_P (TREE_TYPE (op1
))
3834 || !INTEGRAL_TYPE_P (type
))
3836 error ("type mismatch in binary truth expression");
3837 debug_generic_stmt (type
);
3838 debug_generic_stmt (TREE_TYPE (op0
));
3839 debug_generic_stmt (TREE_TYPE (op1
));
3846 case TRUTH_NOT_EXPR
:
3848 tree op
= TREE_OPERAND (expr
, 0);
3850 if (!is_gimple_val (op
))
3852 error ("invalid operand in unary not");
3856 /* For TRUTH_NOT_EXPR we can have any kind of integral
3857 typed arguments and results. */
3858 if (!INTEGRAL_TYPE_P (TREE_TYPE (op
))
3859 || !INTEGRAL_TYPE_P (type
))
3861 error ("type mismatch in not expression");
3862 debug_generic_expr (TREE_TYPE (expr
));
3863 debug_generic_expr (TREE_TYPE (op
));
3871 /* FIXME. The C frontend passes unpromoted arguments in case it
3872 didn't see a function declaration before the call. */
3882 /* Generic handling via classes. */
3883 switch (TREE_CODE_CLASS (TREE_CODE (expr
)))
3886 return verify_gimple_unary_expr (expr
);
3889 return verify_gimple_binary_expr (expr
);
3892 return verify_gimple_reference (expr
);
3894 case tcc_comparison
:
3896 tree op0
= TREE_OPERAND (expr
, 0);
3897 tree op1
= TREE_OPERAND (expr
, 1);
3898 if (!is_gimple_val (op0
) || !is_gimple_val (op1
))
3900 error ("invalid operands in comparison expression");
3903 /* For comparisons we do not have the operations type as the
3904 effective type the comparison is carried out in. Instead
3905 we require that either the first operand is trivially
3906 convertible into the second, or the other way around.
3907 The resulting type of a comparison may be any integral type.
3908 Because we special-case pointers to void we allow
3909 comparisons of pointers with the same mode as well. */
3910 if ((!useless_type_conversion_p (TREE_TYPE (op0
), TREE_TYPE (op1
))
3911 && !useless_type_conversion_p (TREE_TYPE (op1
), TREE_TYPE (op0
))
3912 && (!POINTER_TYPE_P (TREE_TYPE (op0
))
3913 || !POINTER_TYPE_P (TREE_TYPE (op1
))
3914 || TYPE_MODE (TREE_TYPE (op0
)) != TYPE_MODE (TREE_TYPE (op1
))))
3915 || !INTEGRAL_TYPE_P (type
))
3917 error ("type mismatch in comparison expression");
3918 debug_generic_stmt (TREE_TYPE (expr
));
3919 debug_generic_stmt (TREE_TYPE (op0
));
3920 debug_generic_stmt (TREE_TYPE (op1
));
3933 /* Verify the GIMPLE assignment statement STMT. Returns true if there
3934 is an error, otherwise false. */
3937 verify_gimple_modify_stmt (const_tree stmt
)
3939 tree lhs
= GIMPLE_STMT_OPERAND (stmt
, 0);
3940 tree rhs
= GIMPLE_STMT_OPERAND (stmt
, 1);
3942 gcc_assert (TREE_CODE (stmt
) == GIMPLE_MODIFY_STMT
);
3944 if (!useless_type_conversion_p (TREE_TYPE (lhs
),
3947 error ("non-trivial conversion at assignment");
3948 debug_generic_expr (TREE_TYPE (lhs
));
3949 debug_generic_expr (TREE_TYPE (rhs
));
3953 /* Loads/stores from/to a variable are ok. */
3954 if ((is_gimple_val (lhs
)
3955 && is_gimple_variable (rhs
))
3956 || (is_gimple_val (rhs
)
3957 && is_gimple_variable (lhs
)))
3960 /* Aggregate copies are ok. */
3961 if (!is_gimple_reg_type (TREE_TYPE (lhs
))
3962 && !is_gimple_reg_type (TREE_TYPE (rhs
)))
3965 /* We might get 'loads' from a parameter which is not a gimple value. */
3966 if (TREE_CODE (rhs
) == PARM_DECL
)
3967 return verify_gimple_expr (lhs
);
3969 if (!is_gimple_variable (lhs
)
3970 && verify_gimple_expr (lhs
))
3973 if (!is_gimple_variable (rhs
)
3974 && verify_gimple_expr (rhs
))
3980 /* Verify the GIMPLE statement STMT. Returns true if there is an
3981 error, otherwise false. */
3984 verify_gimple_stmt (tree stmt
)
3986 if (!is_gimple_stmt (stmt
))
3988 error ("is not a valid GIMPLE statement");
3992 if (OMP_DIRECTIVE_P (stmt
))
3994 /* OpenMP directives are validated by the FE and never operated
3995 on by the optimizers. Furthermore, OMP_FOR may contain
3996 non-gimple expressions when the main index variable has had
3997 its address taken. This does not affect the loop itself
3998 because the header of an OMP_FOR is merely used to determine
3999 how to setup the parallel iteration. */
4003 switch (TREE_CODE (stmt
))
4005 case GIMPLE_MODIFY_STMT
:
4006 return verify_gimple_modify_stmt (stmt
);
4013 if (!is_gimple_val (TREE_OPERAND (stmt
, 0)))
4015 error ("invalid operand to switch statement");
4016 debug_generic_expr (TREE_OPERAND (stmt
, 0));
4022 tree op
= TREE_OPERAND (stmt
, 0);
4024 if (TREE_CODE (TREE_TYPE (stmt
)) != VOID_TYPE
)
4026 error ("type error in return expression");
4031 || TREE_CODE (op
) == RESULT_DECL
)
4034 return verify_gimple_modify_stmt (op
);
4039 return verify_gimple_expr (stmt
);
4042 case CHANGE_DYNAMIC_TYPE_EXPR
:
4051 /* Verify the GIMPLE statements inside the statement list STMTS.
4052 Returns true if there were any errors. */
4055 verify_gimple_2 (tree stmts
)
4057 tree_stmt_iterator tsi
;
4060 for (tsi
= tsi_start (stmts
); !tsi_end_p (tsi
); tsi_next (&tsi
))
4062 tree stmt
= tsi_stmt (tsi
);
4064 switch (TREE_CODE (stmt
))
4067 err
|= verify_gimple_2 (BIND_EXPR_BODY (stmt
));
4070 case TRY_CATCH_EXPR
:
4071 case TRY_FINALLY_EXPR
:
4072 err
|= verify_gimple_2 (TREE_OPERAND (stmt
, 0));
4073 err
|= verify_gimple_2 (TREE_OPERAND (stmt
, 1));
4077 err
|= verify_gimple_2 (CATCH_BODY (stmt
));
4080 case EH_FILTER_EXPR
:
4081 err
|= verify_gimple_2 (EH_FILTER_FAILURE (stmt
));
4086 bool err2
= verify_gimple_stmt (stmt
);
4088 debug_generic_expr (stmt
);
4098 /* Verify the GIMPLE statements inside the statement list STMTS. */
4101 verify_gimple_1 (tree stmts
)
4103 if (verify_gimple_2 (stmts
))
4104 internal_error ("verify_gimple failed");
4107 /* Verify the GIMPLE statements inside the current function. */
4110 verify_gimple (void)
4112 verify_gimple_1 (BIND_EXPR_BODY (DECL_SAVED_TREE (cfun
->decl
)));
4115 /* Verify STMT, return true if STMT is not in GIMPLE form.
4116 TODO: Implement type checking. */
4119 verify_stmt (tree stmt
, bool last_in_block
)
4123 if (OMP_DIRECTIVE_P (stmt
))
4125 /* OpenMP directives are validated by the FE and never operated
4126 on by the optimizers. Furthermore, OMP_FOR may contain
4127 non-gimple expressions when the main index variable has had
4128 its address taken. This does not affect the loop itself
4129 because the header of an OMP_FOR is merely used to determine
4130 how to setup the parallel iteration. */
4134 if (!is_gimple_stmt (stmt
))
4136 error ("is not a valid GIMPLE statement");
4140 addr
= walk_tree (&stmt
, verify_expr
, NULL
, NULL
);
4143 debug_generic_stmt (addr
);
4147 /* If the statement is marked as part of an EH region, then it is
4148 expected that the statement could throw. Verify that when we
4149 have optimizations that simplify statements such that we prove
4150 that they cannot throw, that we update other data structures
4152 if (lookup_stmt_eh_region (stmt
) >= 0)
4154 if (!tree_could_throw_p (stmt
))
4156 error ("statement marked for throw, but doesn%'t");
4159 if (!last_in_block
&& tree_can_throw_internal (stmt
))
4161 error ("statement marked for throw in middle of block");
4169 debug_generic_stmt (stmt
);
4174 /* Return true when the T can be shared. */
4177 tree_node_can_be_shared (tree t
)
4179 if (IS_TYPE_OR_DECL_P (t
)
4180 || is_gimple_min_invariant (t
)
4181 || TREE_CODE (t
) == SSA_NAME
4182 || t
== error_mark_node
4183 || TREE_CODE (t
) == IDENTIFIER_NODE
)
4186 if (TREE_CODE (t
) == CASE_LABEL_EXPR
)
4189 while (((TREE_CODE (t
) == ARRAY_REF
|| TREE_CODE (t
) == ARRAY_RANGE_REF
)
4190 && is_gimple_min_invariant (TREE_OPERAND (t
, 1)))
4191 || TREE_CODE (t
) == COMPONENT_REF
4192 || TREE_CODE (t
) == REALPART_EXPR
4193 || TREE_CODE (t
) == IMAGPART_EXPR
)
4194 t
= TREE_OPERAND (t
, 0);
4203 /* Called via walk_trees. Verify tree sharing. */
4206 verify_node_sharing (tree
* tp
, int *walk_subtrees
, void *data
)
4208 struct pointer_set_t
*visited
= (struct pointer_set_t
*) data
;
4210 if (tree_node_can_be_shared (*tp
))
4212 *walk_subtrees
= false;
4216 if (pointer_set_insert (visited
, *tp
))
4223 /* Helper function for verify_gimple_tuples. */
4226 verify_gimple_tuples_1 (tree
*tp
, int *walk_subtrees ATTRIBUTE_UNUSED
,
4227 void *data ATTRIBUTE_UNUSED
)
4229 switch (TREE_CODE (*tp
))
4232 error ("unexpected non-tuple");
4242 /* Verify that there are no trees that should have been converted to
4243 gimple tuples. Return true if T contains a node that should have
4244 been converted to a gimple tuple, but hasn't. */
4247 verify_gimple_tuples (tree t
)
4249 return walk_tree (&t
, verify_gimple_tuples_1
, NULL
, NULL
) != NULL
;
4252 static bool eh_error_found
;
4254 verify_eh_throw_stmt_node (void **slot
, void *data
)
4256 struct throw_stmt_node
*node
= (struct throw_stmt_node
*)*slot
;
4257 struct pointer_set_t
*visited
= (struct pointer_set_t
*) data
;
4259 if (!pointer_set_contains (visited
, node
->stmt
))
4261 error ("Dead STMT in EH table");
4262 debug_generic_stmt (node
->stmt
);
4263 eh_error_found
= true;
4268 /* Verify the GIMPLE statement chain. */
4274 block_stmt_iterator bsi
;
4276 struct pointer_set_t
*visited
, *visited_stmts
;
4279 timevar_push (TV_TREE_STMT_VERIFY
);
4280 visited
= pointer_set_create ();
4281 visited_stmts
= pointer_set_create ();
4288 for (phi
= phi_nodes (bb
); phi
; phi
= PHI_CHAIN (phi
))
4290 int phi_num_args
= PHI_NUM_ARGS (phi
);
4292 pointer_set_insert (visited_stmts
, phi
);
4293 if (bb_for_stmt (phi
) != bb
)
4295 error ("bb_for_stmt (phi) is set to a wrong basic block");
4299 for (i
= 0; i
< phi_num_args
; i
++)
4301 tree t
= PHI_ARG_DEF (phi
, i
);
4306 error ("missing PHI def");
4307 debug_generic_stmt (phi
);
4311 /* Addressable variables do have SSA_NAMEs but they
4312 are not considered gimple values. */
4313 else if (TREE_CODE (t
) != SSA_NAME
4314 && TREE_CODE (t
) != FUNCTION_DECL
4315 && !is_gimple_val (t
))
4317 error ("PHI def is not a GIMPLE value");
4318 debug_generic_stmt (phi
);
4319 debug_generic_stmt (t
);
4323 addr
= walk_tree (&t
, verify_expr
, (void *) 1, NULL
);
4326 debug_generic_stmt (addr
);
4330 addr
= walk_tree (&t
, verify_node_sharing
, visited
, NULL
);
4333 error ("incorrect sharing of tree nodes");
4334 debug_generic_stmt (phi
);
4335 debug_generic_stmt (addr
);
4341 for (bsi
= bsi_start (bb
); !bsi_end_p (bsi
); )
4343 tree stmt
= bsi_stmt (bsi
);
4345 pointer_set_insert (visited_stmts
, stmt
);
4346 err
|= verify_gimple_tuples (stmt
);
4348 if (bb_for_stmt (stmt
) != bb
)
4350 error ("bb_for_stmt (stmt) is set to a wrong basic block");
4355 err
|= verify_stmt (stmt
, bsi_end_p (bsi
));
4356 addr
= walk_tree (&stmt
, verify_node_sharing
, visited
, NULL
);
4359 error ("incorrect sharing of tree nodes");
4360 debug_generic_stmt (stmt
);
4361 debug_generic_stmt (addr
);
4366 eh_error_found
= false;
4367 if (get_eh_throw_stmt_table (cfun
))
4368 htab_traverse (get_eh_throw_stmt_table (cfun
),
4369 verify_eh_throw_stmt_node
,
4372 if (err
| eh_error_found
)
4373 internal_error ("verify_stmts failed");
4375 pointer_set_destroy (visited
);
4376 pointer_set_destroy (visited_stmts
);
4377 verify_histograms ();
4378 timevar_pop (TV_TREE_STMT_VERIFY
);
4382 /* Verifies that the flow information is OK. */
4385 tree_verify_flow_info (void)
4389 block_stmt_iterator bsi
;
4394 if (ENTRY_BLOCK_PTR
->il
.tree
)
4396 error ("ENTRY_BLOCK has IL associated with it");
4400 if (EXIT_BLOCK_PTR
->il
.tree
)
4402 error ("EXIT_BLOCK has IL associated with it");
4406 FOR_EACH_EDGE (e
, ei
, EXIT_BLOCK_PTR
->preds
)
4407 if (e
->flags
& EDGE_FALLTHRU
)
4409 error ("fallthru to exit from bb %d", e
->src
->index
);
4415 bool found_ctrl_stmt
= false;
4419 /* Skip labels on the start of basic block. */
4420 for (bsi
= bsi_start (bb
); !bsi_end_p (bsi
); bsi_next (&bsi
))
4422 tree prev_stmt
= stmt
;
4424 stmt
= bsi_stmt (bsi
);
4426 if (TREE_CODE (stmt
) != LABEL_EXPR
)
4429 if (prev_stmt
&& DECL_NONLOCAL (LABEL_EXPR_LABEL (stmt
)))
4431 error ("nonlocal label ");
4432 print_generic_expr (stderr
, LABEL_EXPR_LABEL (stmt
), 0);
4433 fprintf (stderr
, " is not first in a sequence of labels in bb %d",
4438 if (label_to_block (LABEL_EXPR_LABEL (stmt
)) != bb
)
4441 print_generic_expr (stderr
, LABEL_EXPR_LABEL (stmt
), 0);
4442 fprintf (stderr
, " to block does not match in bb %d",
4447 if (decl_function_context (LABEL_EXPR_LABEL (stmt
))
4448 != current_function_decl
)
4451 print_generic_expr (stderr
, LABEL_EXPR_LABEL (stmt
), 0);
4452 fprintf (stderr
, " has incorrect context in bb %d",
4458 /* Verify that body of basic block BB is free of control flow. */
4459 for (; !bsi_end_p (bsi
); bsi_next (&bsi
))
4461 tree stmt
= bsi_stmt (bsi
);
4463 if (found_ctrl_stmt
)
4465 error ("control flow in the middle of basic block %d",
4470 if (stmt_ends_bb_p (stmt
))
4471 found_ctrl_stmt
= true;
4473 if (TREE_CODE (stmt
) == LABEL_EXPR
)
4476 print_generic_expr (stderr
, LABEL_EXPR_LABEL (stmt
), 0);
4477 fprintf (stderr
, " in the middle of basic block %d", bb
->index
);
4482 bsi
= bsi_last (bb
);
4483 if (bsi_end_p (bsi
))
4486 stmt
= bsi_stmt (bsi
);
4488 err
|= verify_eh_edges (stmt
);
4490 if (is_ctrl_stmt (stmt
))
4492 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
4493 if (e
->flags
& EDGE_FALLTHRU
)
4495 error ("fallthru edge after a control statement in bb %d",
4501 if (TREE_CODE (stmt
) != COND_EXPR
)
4503 /* Verify that there are no edges with EDGE_TRUE/FALSE_FLAG set
4504 after anything else but if statement. */
4505 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
4506 if (e
->flags
& (EDGE_TRUE_VALUE
| EDGE_FALSE_VALUE
))
4508 error ("true/false edge after a non-COND_EXPR in bb %d",
4514 switch (TREE_CODE (stmt
))
4521 if (COND_EXPR_THEN (stmt
) != NULL_TREE
4522 || COND_EXPR_ELSE (stmt
) != NULL_TREE
)
4524 error ("COND_EXPR with code in branches at the end of bb %d",
4529 extract_true_false_edges_from_block (bb
, &true_edge
, &false_edge
);
4531 if (!true_edge
|| !false_edge
4532 || !(true_edge
->flags
& EDGE_TRUE_VALUE
)
4533 || !(false_edge
->flags
& EDGE_FALSE_VALUE
)
4534 || (true_edge
->flags
& (EDGE_FALLTHRU
| EDGE_ABNORMAL
))
4535 || (false_edge
->flags
& (EDGE_FALLTHRU
| EDGE_ABNORMAL
))
4536 || EDGE_COUNT (bb
->succs
) >= 3)
4538 error ("wrong outgoing edge flags at end of bb %d",
4546 if (simple_goto_p (stmt
))
4548 error ("explicit goto at end of bb %d", bb
->index
);
4553 /* FIXME. We should double check that the labels in the
4554 destination blocks have their address taken. */
4555 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
4556 if ((e
->flags
& (EDGE_FALLTHRU
| EDGE_TRUE_VALUE
4557 | EDGE_FALSE_VALUE
))
4558 || !(e
->flags
& EDGE_ABNORMAL
))
4560 error ("wrong outgoing edge flags at end of bb %d",
4568 if (!single_succ_p (bb
)
4569 || (single_succ_edge (bb
)->flags
4570 & (EDGE_FALLTHRU
| EDGE_ABNORMAL
4571 | EDGE_TRUE_VALUE
| EDGE_FALSE_VALUE
)))
4573 error ("wrong outgoing edge flags at end of bb %d", bb
->index
);
4576 if (single_succ (bb
) != EXIT_BLOCK_PTR
)
4578 error ("return edge does not point to exit in bb %d",
4591 vec
= SWITCH_LABELS (stmt
);
4592 n
= TREE_VEC_LENGTH (vec
);
4594 /* Mark all the destination basic blocks. */
4595 for (i
= 0; i
< n
; ++i
)
4597 tree lab
= CASE_LABEL (TREE_VEC_ELT (vec
, i
));
4598 basic_block label_bb
= label_to_block (lab
);
4600 gcc_assert (!label_bb
->aux
|| label_bb
->aux
== (void *)1);
4601 label_bb
->aux
= (void *)1;
4604 /* Verify that the case labels are sorted. */
4605 prev
= TREE_VEC_ELT (vec
, 0);
4606 for (i
= 1; i
< n
- 1; ++i
)
4608 tree c
= TREE_VEC_ELT (vec
, i
);
4611 error ("found default case not at end of case vector");
4615 if (! tree_int_cst_lt (CASE_LOW (prev
), CASE_LOW (c
)))
4617 error ("case labels not sorted: ");
4618 print_generic_expr (stderr
, prev
, 0);
4619 fprintf (stderr
," is greater than ");
4620 print_generic_expr (stderr
, c
, 0);
4621 fprintf (stderr
," but comes before it.\n");
4626 if (CASE_LOW (TREE_VEC_ELT (vec
, n
- 1)))
4628 error ("no default case found at end of case vector");
4632 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
4636 error ("extra outgoing edge %d->%d",
4637 bb
->index
, e
->dest
->index
);
4640 e
->dest
->aux
= (void *)2;
4641 if ((e
->flags
& (EDGE_FALLTHRU
| EDGE_ABNORMAL
4642 | EDGE_TRUE_VALUE
| EDGE_FALSE_VALUE
)))
4644 error ("wrong outgoing edge flags at end of bb %d",
4650 /* Check that we have all of them. */
4651 for (i
= 0; i
< n
; ++i
)
4653 tree lab
= CASE_LABEL (TREE_VEC_ELT (vec
, i
));
4654 basic_block label_bb
= label_to_block (lab
);
4656 if (label_bb
->aux
!= (void *)2)
4658 error ("missing edge %i->%i",
4659 bb
->index
, label_bb
->index
);
4664 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
4665 e
->dest
->aux
= (void *)0;
4672 if (dom_info_state (CDI_DOMINATORS
) >= DOM_NO_FAST_QUERY
)
4673 verify_dominators (CDI_DOMINATORS
);
4679 /* Updates phi nodes after creating a forwarder block joined
4680 by edge FALLTHRU. */
4683 tree_make_forwarder_block (edge fallthru
)
4687 basic_block dummy
, bb
;
4688 tree phi
, new_phi
, var
;
4690 dummy
= fallthru
->src
;
4691 bb
= fallthru
->dest
;
4693 if (single_pred_p (bb
))
4696 /* If we redirected a branch we must create new PHI nodes at the
4698 for (phi
= phi_nodes (dummy
); phi
; phi
= PHI_CHAIN (phi
))
4700 var
= PHI_RESULT (phi
);
4701 new_phi
= create_phi_node (var
, bb
);
4702 SSA_NAME_DEF_STMT (var
) = new_phi
;
4703 SET_PHI_RESULT (phi
, make_ssa_name (SSA_NAME_VAR (var
), phi
));
4704 add_phi_arg (new_phi
, PHI_RESULT (phi
), fallthru
);
4707 /* Ensure that the PHI node chain is in the same order. */
4708 set_phi_nodes (bb
, phi_reverse (phi_nodes (bb
)));
4710 /* Add the arguments we have stored on edges. */
4711 FOR_EACH_EDGE (e
, ei
, bb
->preds
)
4716 flush_pending_stmts (e
);
4721 /* Return a non-special label in the head of basic block BLOCK.
4722 Create one if it doesn't exist. */
4725 tree_block_label (basic_block bb
)
4727 block_stmt_iterator i
, s
= bsi_start (bb
);
4731 for (i
= s
; !bsi_end_p (i
); first
= false, bsi_next (&i
))
4733 stmt
= bsi_stmt (i
);
4734 if (TREE_CODE (stmt
) != LABEL_EXPR
)
4736 label
= LABEL_EXPR_LABEL (stmt
);
4737 if (!DECL_NONLOCAL (label
))
4740 bsi_move_before (&i
, &s
);
4745 label
= create_artificial_label ();
4746 stmt
= build1 (LABEL_EXPR
, void_type_node
, label
);
4747 bsi_insert_before (&s
, stmt
, BSI_NEW_STMT
);
4752 /* Attempt to perform edge redirection by replacing a possibly complex
4753 jump instruction by a goto or by removing the jump completely.
4754 This can apply only if all edges now point to the same block. The
4755 parameters and return values are equivalent to
4756 redirect_edge_and_branch. */
4759 tree_try_redirect_by_replacing_jump (edge e
, basic_block target
)
4761 basic_block src
= e
->src
;
4762 block_stmt_iterator b
;
4765 /* We can replace or remove a complex jump only when we have exactly
4767 if (EDGE_COUNT (src
->succs
) != 2
4768 /* Verify that all targets will be TARGET. Specifically, the
4769 edge that is not E must also go to TARGET. */
4770 || EDGE_SUCC (src
, EDGE_SUCC (src
, 0) == e
)->dest
!= target
)
4776 stmt
= bsi_stmt (b
);
4778 if (TREE_CODE (stmt
) == COND_EXPR
4779 || TREE_CODE (stmt
) == SWITCH_EXPR
)
4781 bsi_remove (&b
, true);
4782 e
= ssa_redirect_edge (e
, target
);
4783 e
->flags
= EDGE_FALLTHRU
;
4791 /* Redirect E to DEST. Return NULL on failure. Otherwise, return the
4792 edge representing the redirected branch. */
4795 tree_redirect_edge_and_branch (edge e
, basic_block dest
)
4797 basic_block bb
= e
->src
;
4798 block_stmt_iterator bsi
;
4802 if (e
->flags
& EDGE_ABNORMAL
)
4805 if (e
->src
!= ENTRY_BLOCK_PTR
4806 && (ret
= tree_try_redirect_by_replacing_jump (e
, dest
)))
4809 if (e
->dest
== dest
)
4812 bsi
= bsi_last (bb
);
4813 stmt
= bsi_end_p (bsi
) ? NULL
: bsi_stmt (bsi
);
4815 switch (stmt
? TREE_CODE (stmt
) : ERROR_MARK
)
4818 /* For COND_EXPR, we only need to redirect the edge. */
4822 /* No non-abnormal edges should lead from a non-simple goto, and
4823 simple ones should be represented implicitly. */
4828 tree cases
= get_cases_for_edge (e
, stmt
);
4829 tree label
= tree_block_label (dest
);
4831 /* If we have a list of cases associated with E, then use it
4832 as it's a lot faster than walking the entire case vector. */
4835 edge e2
= find_edge (e
->src
, dest
);
4842 CASE_LABEL (cases
) = label
;
4843 cases
= TREE_CHAIN (cases
);
4846 /* If there was already an edge in the CFG, then we need
4847 to move all the cases associated with E to E2. */
4850 tree cases2
= get_cases_for_edge (e2
, stmt
);
4852 TREE_CHAIN (last
) = TREE_CHAIN (cases2
);
4853 TREE_CHAIN (cases2
) = first
;
4858 tree vec
= SWITCH_LABELS (stmt
);
4859 size_t i
, n
= TREE_VEC_LENGTH (vec
);
4861 for (i
= 0; i
< n
; i
++)
4863 tree elt
= TREE_VEC_ELT (vec
, i
);
4865 if (label_to_block (CASE_LABEL (elt
)) == e
->dest
)
4866 CASE_LABEL (elt
) = label
;
4874 bsi_remove (&bsi
, true);
4875 e
->flags
|= EDGE_FALLTHRU
;
4880 case OMP_SECTIONS_SWITCH
:
4882 /* The edges from OMP constructs can be simply redirected. */
4886 /* Otherwise it must be a fallthru edge, and we don't need to
4887 do anything besides redirecting it. */
4888 gcc_assert (e
->flags
& EDGE_FALLTHRU
);
4892 /* Update/insert PHI nodes as necessary. */
4894 /* Now update the edges in the CFG. */
4895 e
= ssa_redirect_edge (e
, dest
);
4900 /* Returns true if it is possible to remove edge E by redirecting
4901 it to the destination of the other edge from E->src. */
4904 tree_can_remove_branch_p (const_edge e
)
4906 if (e
->flags
& EDGE_ABNORMAL
)
4912 /* Simple wrapper, as we can always redirect fallthru edges. */
4915 tree_redirect_edge_and_branch_force (edge e
, basic_block dest
)
4917 e
= tree_redirect_edge_and_branch (e
, dest
);
4924 /* Splits basic block BB after statement STMT (but at least after the
4925 labels). If STMT is NULL, BB is split just after the labels. */
4928 tree_split_block (basic_block bb
, void *stmt
)
4930 block_stmt_iterator bsi
;
4931 tree_stmt_iterator tsi_tgt
;
4937 new_bb
= create_empty_bb (bb
);
4939 /* Redirect the outgoing edges. */
4940 new_bb
->succs
= bb
->succs
;
4942 FOR_EACH_EDGE (e
, ei
, new_bb
->succs
)
4945 if (stmt
&& TREE_CODE ((tree
) stmt
) == LABEL_EXPR
)
4948 /* Move everything from BSI to the new basic block. */
4949 for (bsi
= bsi_start (bb
); !bsi_end_p (bsi
); bsi_next (&bsi
))
4951 act
= bsi_stmt (bsi
);
4952 if (TREE_CODE (act
) == LABEL_EXPR
)
4965 if (bsi_end_p (bsi
))
4968 /* Split the statement list - avoid re-creating new containers as this
4969 brings ugly quadratic memory consumption in the inliner.
4970 (We are still quadratic since we need to update stmt BB pointers,
4972 list
= tsi_split_statement_list_before (&bsi
.tsi
);
4973 set_bb_stmt_list (new_bb
, list
);
4974 for (tsi_tgt
= tsi_start (list
);
4975 !tsi_end_p (tsi_tgt
); tsi_next (&tsi_tgt
))
4976 change_bb_for_stmt (tsi_stmt (tsi_tgt
), new_bb
);
4982 /* Moves basic block BB after block AFTER. */
4985 tree_move_block_after (basic_block bb
, basic_block after
)
4987 if (bb
->prev_bb
== after
)
4991 link_block (bb
, after
);
4997 /* Return true if basic_block can be duplicated. */
5000 tree_can_duplicate_bb_p (const_basic_block bb ATTRIBUTE_UNUSED
)
5006 /* Create a duplicate of the basic block BB. NOTE: This does not
5007 preserve SSA form. */
5010 tree_duplicate_bb (basic_block bb
)
5013 block_stmt_iterator bsi
, bsi_tgt
;
5016 new_bb
= create_empty_bb (EXIT_BLOCK_PTR
->prev_bb
);
5018 /* Copy the PHI nodes. We ignore PHI node arguments here because
5019 the incoming edges have not been setup yet. */
5020 for (phi
= phi_nodes (bb
); phi
; phi
= PHI_CHAIN (phi
))
5022 tree copy
= create_phi_node (PHI_RESULT (phi
), new_bb
);
5023 create_new_def_for (PHI_RESULT (copy
), copy
, PHI_RESULT_PTR (copy
));
5026 /* Keep the chain of PHI nodes in the same order so that they can be
5027 updated by ssa_redirect_edge. */
5028 set_phi_nodes (new_bb
, phi_reverse (phi_nodes (new_bb
)));
5030 bsi_tgt
= bsi_start (new_bb
);
5031 for (bsi
= bsi_start (bb
); !bsi_end_p (bsi
); bsi_next (&bsi
))
5033 def_operand_p def_p
;
5034 ssa_op_iter op_iter
;
5038 stmt
= bsi_stmt (bsi
);
5039 if (TREE_CODE (stmt
) == LABEL_EXPR
)
5042 /* Create a new copy of STMT and duplicate STMT's virtual
5044 copy
= unshare_expr (stmt
);
5045 bsi_insert_after (&bsi_tgt
, copy
, BSI_NEW_STMT
);
5046 copy_virtual_operands (copy
, stmt
);
5047 region
= lookup_stmt_eh_region (stmt
);
5049 add_stmt_to_eh_region (copy
, region
);
5050 gimple_duplicate_stmt_histograms (cfun
, copy
, cfun
, stmt
);
5052 /* Create new names for all the definitions created by COPY and
5053 add replacement mappings for each new name. */
5054 FOR_EACH_SSA_DEF_OPERAND (def_p
, copy
, op_iter
, SSA_OP_ALL_DEFS
)
5055 create_new_def_for (DEF_FROM_PTR (def_p
), copy
, def_p
);
5061 /* Adds phi node arguments for edge E_COPY after basic block duplication. */
5064 add_phi_args_after_copy_edge (edge e_copy
)
5066 basic_block bb
, bb_copy
= e_copy
->src
, dest
;
5069 tree phi
, phi_copy
, phi_next
, def
;
5071 if (!phi_nodes (e_copy
->dest
))
5074 bb
= bb_copy
->flags
& BB_DUPLICATED
? get_bb_original (bb_copy
) : bb_copy
;
5076 if (e_copy
->dest
->flags
& BB_DUPLICATED
)
5077 dest
= get_bb_original (e_copy
->dest
);
5079 dest
= e_copy
->dest
;
5081 e
= find_edge (bb
, dest
);
5084 /* During loop unrolling the target of the latch edge is copied.
5085 In this case we are not looking for edge to dest, but to
5086 duplicated block whose original was dest. */
5087 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
5089 if ((e
->dest
->flags
& BB_DUPLICATED
)
5090 && get_bb_original (e
->dest
) == dest
)
5094 gcc_assert (e
!= NULL
);
5097 for (phi
= phi_nodes (e
->dest
), phi_copy
= phi_nodes (e_copy
->dest
);
5099 phi
= phi_next
, phi_copy
= PHI_CHAIN (phi_copy
))
5101 phi_next
= PHI_CHAIN (phi
);
5102 def
= PHI_ARG_DEF_FROM_EDGE (phi
, e
);
5103 add_phi_arg (phi_copy
, def
, e_copy
);
5108 /* Basic block BB_COPY was created by code duplication. Add phi node
5109 arguments for edges going out of BB_COPY. The blocks that were
5110 duplicated have BB_DUPLICATED set. */
5113 add_phi_args_after_copy_bb (basic_block bb_copy
)
5118 FOR_EACH_EDGE (e_copy
, ei
, bb_copy
->succs
)
5120 add_phi_args_after_copy_edge (e_copy
);
5124 /* Blocks in REGION_COPY array of length N_REGION were created by
5125 duplication of basic blocks. Add phi node arguments for edges
5126 going from these blocks. If E_COPY is not NULL, also add
5127 phi node arguments for its destination.*/
5130 add_phi_args_after_copy (basic_block
*region_copy
, unsigned n_region
,
5135 for (i
= 0; i
< n_region
; i
++)
5136 region_copy
[i
]->flags
|= BB_DUPLICATED
;
5138 for (i
= 0; i
< n_region
; i
++)
5139 add_phi_args_after_copy_bb (region_copy
[i
]);
5141 add_phi_args_after_copy_edge (e_copy
);
5143 for (i
= 0; i
< n_region
; i
++)
5144 region_copy
[i
]->flags
&= ~BB_DUPLICATED
;
5147 /* Duplicates a REGION (set of N_REGION basic blocks) with just a single
5148 important exit edge EXIT. By important we mean that no SSA name defined
5149 inside region is live over the other exit edges of the region. All entry
5150 edges to the region must go to ENTRY->dest. The edge ENTRY is redirected
5151 to the duplicate of the region. SSA form, dominance and loop information
5152 is updated. The new basic blocks are stored to REGION_COPY in the same
5153 order as they had in REGION, provided that REGION_COPY is not NULL.
5154 The function returns false if it is unable to copy the region,
5158 tree_duplicate_sese_region (edge entry
, edge exit
,
5159 basic_block
*region
, unsigned n_region
,
5160 basic_block
*region_copy
)
5163 bool free_region_copy
= false, copying_header
= false;
5164 struct loop
*loop
= entry
->dest
->loop_father
;
5166 VEC (basic_block
, heap
) *doms
;
5168 int total_freq
= 0, entry_freq
= 0;
5169 gcov_type total_count
= 0, entry_count
= 0;
5171 if (!can_copy_bbs_p (region
, n_region
))
5174 /* Some sanity checking. Note that we do not check for all possible
5175 missuses of the functions. I.e. if you ask to copy something weird,
5176 it will work, but the state of structures probably will not be
5178 for (i
= 0; i
< n_region
; i
++)
5180 /* We do not handle subloops, i.e. all the blocks must belong to the
5182 if (region
[i
]->loop_father
!= loop
)
5185 if (region
[i
] != entry
->dest
5186 && region
[i
] == loop
->header
)
5190 set_loop_copy (loop
, loop
);
5192 /* In case the function is used for loop header copying (which is the primary
5193 use), ensure that EXIT and its copy will be new latch and entry edges. */
5194 if (loop
->header
== entry
->dest
)
5196 copying_header
= true;
5197 set_loop_copy (loop
, loop_outer (loop
));
5199 if (!dominated_by_p (CDI_DOMINATORS
, loop
->latch
, exit
->src
))
5202 for (i
= 0; i
< n_region
; i
++)
5203 if (region
[i
] != exit
->src
5204 && dominated_by_p (CDI_DOMINATORS
, region
[i
], exit
->src
))
5210 region_copy
= XNEWVEC (basic_block
, n_region
);
5211 free_region_copy
= true;
5214 gcc_assert (!need_ssa_update_p ());
5216 /* Record blocks outside the region that are dominated by something
5219 initialize_original_copy_tables ();
5221 doms
= get_dominated_by_region (CDI_DOMINATORS
, region
, n_region
);
5223 if (entry
->dest
->count
)
5225 total_count
= entry
->dest
->count
;
5226 entry_count
= entry
->count
;
5227 /* Fix up corner cases, to avoid division by zero or creation of negative
5229 if (entry_count
> total_count
)
5230 entry_count
= total_count
;
5234 total_freq
= entry
->dest
->frequency
;
5235 entry_freq
= EDGE_FREQUENCY (entry
);
5236 /* Fix up corner cases, to avoid division by zero or creation of negative
5238 if (total_freq
== 0)
5240 else if (entry_freq
> total_freq
)
5241 entry_freq
= total_freq
;
5244 copy_bbs (region
, n_region
, region_copy
, &exit
, 1, &exit_copy
, loop
,
5245 split_edge_bb_loc (entry
));
5248 scale_bbs_frequencies_gcov_type (region
, n_region
,
5249 total_count
- entry_count
,
5251 scale_bbs_frequencies_gcov_type (region_copy
, n_region
, entry_count
,
5256 scale_bbs_frequencies_int (region
, n_region
, total_freq
- entry_freq
,
5258 scale_bbs_frequencies_int (region_copy
, n_region
, entry_freq
, total_freq
);
5263 loop
->header
= exit
->dest
;
5264 loop
->latch
= exit
->src
;
5267 /* Redirect the entry and add the phi node arguments. */
5268 redirected
= redirect_edge_and_branch (entry
, get_bb_copy (entry
->dest
));
5269 gcc_assert (redirected
!= NULL
);
5270 flush_pending_stmts (entry
);
5272 /* Concerning updating of dominators: We must recount dominators
5273 for entry block and its copy. Anything that is outside of the
5274 region, but was dominated by something inside needs recounting as
5276 set_immediate_dominator (CDI_DOMINATORS
, entry
->dest
, entry
->src
);
5277 VEC_safe_push (basic_block
, heap
, doms
, get_bb_original (entry
->dest
));
5278 iterate_fix_dominators (CDI_DOMINATORS
, doms
, false);
5279 VEC_free (basic_block
, heap
, doms
);
5281 /* Add the other PHI node arguments. */
5282 add_phi_args_after_copy (region_copy
, n_region
, NULL
);
5284 /* Update the SSA web. */
5285 update_ssa (TODO_update_ssa
);
5287 if (free_region_copy
)
5290 free_original_copy_tables ();
5294 /* Duplicates REGION consisting of N_REGION blocks. The new blocks
5295 are stored to REGION_COPY in the same order in that they appear
5296 in REGION, if REGION_COPY is not NULL. ENTRY is the entry to
5297 the region, EXIT an exit from it. The condition guarding EXIT
5298 is moved to ENTRY. Returns true if duplication succeeds, false
5324 tree_duplicate_sese_tail (edge entry
, edge exit
,
5325 basic_block
*region
, unsigned n_region
,
5326 basic_block
*region_copy
)
5329 bool free_region_copy
= false;
5330 struct loop
*loop
= exit
->dest
->loop_father
;
5331 struct loop
*orig_loop
= entry
->dest
->loop_father
;
5332 basic_block switch_bb
, entry_bb
, nentry_bb
;
5333 VEC (basic_block
, heap
) *doms
;
5334 int total_freq
= 0, exit_freq
= 0;
5335 gcov_type total_count
= 0, exit_count
= 0;
5336 edge exits
[2], nexits
[2], e
;
5337 block_stmt_iterator bsi
;
5341 gcc_assert (EDGE_COUNT (exit
->src
->succs
) == 2);
5343 exits
[1] = EDGE_SUCC (exit
->src
, EDGE_SUCC (exit
->src
, 0) == exit
);
5345 if (!can_copy_bbs_p (region
, n_region
))
5348 /* Some sanity checking. Note that we do not check for all possible
5349 missuses of the functions. I.e. if you ask to copy something weird
5350 (e.g., in the example, if there is a jump from inside to the middle
5351 of some_code, or come_code defines some of the values used in cond)
5352 it will work, but the resulting code will not be correct. */
5353 for (i
= 0; i
< n_region
; i
++)
5355 /* We do not handle subloops, i.e. all the blocks must belong to the
5357 if (region
[i
]->loop_father
!= orig_loop
)
5360 if (region
[i
] == orig_loop
->latch
)
5364 initialize_original_copy_tables ();
5365 set_loop_copy (orig_loop
, loop
);
5369 region_copy
= XNEWVEC (basic_block
, n_region
);
5370 free_region_copy
= true;
5373 gcc_assert (!need_ssa_update_p ());
5375 /* Record blocks outside the region that are dominated by something
5377 doms
= get_dominated_by_region (CDI_DOMINATORS
, region
, n_region
);
5379 if (exit
->src
->count
)
5381 total_count
= exit
->src
->count
;
5382 exit_count
= exit
->count
;
5383 /* Fix up corner cases, to avoid division by zero or creation of negative
5385 if (exit_count
> total_count
)
5386 exit_count
= total_count
;
5390 total_freq
= exit
->src
->frequency
;
5391 exit_freq
= EDGE_FREQUENCY (exit
);
5392 /* Fix up corner cases, to avoid division by zero or creation of negative
5394 if (total_freq
== 0)
5396 if (exit_freq
> total_freq
)
5397 exit_freq
= total_freq
;
5400 copy_bbs (region
, n_region
, region_copy
, exits
, 2, nexits
, orig_loop
,
5401 split_edge_bb_loc (exit
));
5404 scale_bbs_frequencies_gcov_type (region
, n_region
,
5405 total_count
- exit_count
,
5407 scale_bbs_frequencies_gcov_type (region_copy
, n_region
, exit_count
,
5412 scale_bbs_frequencies_int (region
, n_region
, total_freq
- exit_freq
,
5414 scale_bbs_frequencies_int (region_copy
, n_region
, exit_freq
, total_freq
);
5417 /* Create the switch block, and put the exit condition to it. */
5418 entry_bb
= entry
->dest
;
5419 nentry_bb
= get_bb_copy (entry_bb
);
5420 if (!last_stmt (entry
->src
)
5421 || !stmt_ends_bb_p (last_stmt (entry
->src
)))
5422 switch_bb
= entry
->src
;
5424 switch_bb
= split_edge (entry
);
5425 set_immediate_dominator (CDI_DOMINATORS
, nentry_bb
, switch_bb
);
5427 bsi
= bsi_last (switch_bb
);
5428 cond
= last_stmt (exit
->src
);
5429 gcc_assert (TREE_CODE (cond
) == COND_EXPR
);
5430 bsi_insert_after (&bsi
, unshare_expr (cond
), BSI_NEW_STMT
);
5432 sorig
= single_succ_edge (switch_bb
);
5433 sorig
->flags
= exits
[1]->flags
;
5434 snew
= make_edge (switch_bb
, nentry_bb
, exits
[0]->flags
);
5436 /* Register the new edge from SWITCH_BB in loop exit lists. */
5437 rescan_loop_exit (snew
, true, false);
5439 /* Add the PHI node arguments. */
5440 add_phi_args_after_copy (region_copy
, n_region
, snew
);
5442 /* Get rid of now superfluous conditions and associated edges (and phi node
5444 e
= redirect_edge_and_branch (exits
[0], exits
[1]->dest
);
5445 PENDING_STMT (e
) = NULL_TREE
;
5446 e
= redirect_edge_and_branch (nexits
[1], nexits
[0]->dest
);
5447 PENDING_STMT (e
) = NULL_TREE
;
5449 /* Anything that is outside of the region, but was dominated by something
5450 inside needs to update dominance info. */
5451 iterate_fix_dominators (CDI_DOMINATORS
, doms
, false);
5452 VEC_free (basic_block
, heap
, doms
);
5454 /* Update the SSA web. */
5455 update_ssa (TODO_update_ssa
);
5457 if (free_region_copy
)
5460 free_original_copy_tables ();
5465 DEF_VEC_P(basic_block);
5466 DEF_VEC_ALLOC_P(basic_block,heap);
5469 /* Add all the blocks dominated by ENTRY to the array BBS_P. Stop
5470 adding blocks when the dominator traversal reaches EXIT. This
5471 function silently assumes that ENTRY strictly dominates EXIT. */
5474 gather_blocks_in_sese_region (basic_block entry
, basic_block exit
,
5475 VEC(basic_block
,heap
) **bbs_p
)
5479 for (son
= first_dom_son (CDI_DOMINATORS
, entry
);
5481 son
= next_dom_son (CDI_DOMINATORS
, son
))
5483 VEC_safe_push (basic_block
, heap
, *bbs_p
, son
);
5485 gather_blocks_in_sese_region (son
, exit
, bbs_p
);
5489 /* Replaces *TP with a duplicate (belonging to function TO_CONTEXT).
5490 The duplicates are recorded in VARS_MAP. */
5493 replace_by_duplicate_decl (tree
*tp
, struct pointer_map_t
*vars_map
,
5496 tree t
= *tp
, new_t
;
5497 struct function
*f
= DECL_STRUCT_FUNCTION (to_context
);
5500 if (DECL_CONTEXT (t
) == to_context
)
5503 loc
= pointer_map_contains (vars_map
, t
);
5507 loc
= pointer_map_insert (vars_map
, t
);
5511 new_t
= copy_var_decl (t
, DECL_NAME (t
), TREE_TYPE (t
));
5512 f
->unexpanded_var_list
5513 = tree_cons (NULL_TREE
, new_t
, f
->unexpanded_var_list
);
5517 gcc_assert (TREE_CODE (t
) == CONST_DECL
);
5518 new_t
= copy_node (t
);
5520 DECL_CONTEXT (new_t
) = to_context
;
5530 /* Creates an ssa name in TO_CONTEXT equivalent to NAME.
5531 VARS_MAP maps old ssa names and var_decls to the new ones. */
5534 replace_ssa_name (tree name
, struct pointer_map_t
*vars_map
,
5538 tree new_name
, decl
= SSA_NAME_VAR (name
);
5540 gcc_assert (is_gimple_reg (name
));
5542 loc
= pointer_map_contains (vars_map
, name
);
5546 replace_by_duplicate_decl (&decl
, vars_map
, to_context
);
5548 push_cfun (DECL_STRUCT_FUNCTION (to_context
));
5549 if (gimple_in_ssa_p (cfun
))
5550 add_referenced_var (decl
);
5552 new_name
= make_ssa_name (decl
, SSA_NAME_DEF_STMT (name
));
5553 if (SSA_NAME_IS_DEFAULT_DEF (name
))
5554 set_default_def (decl
, new_name
);
5557 loc
= pointer_map_insert (vars_map
, name
);
5571 struct pointer_map_t
*vars_map
;
5572 htab_t new_label_map
;
5576 /* Helper for move_block_to_fn. Set TREE_BLOCK in every expression
5577 contained in *TP and change the DECL_CONTEXT of every local
5578 variable referenced in *TP. */
5581 move_stmt_r (tree
*tp
, int *walk_subtrees
, void *data
)
5583 struct move_stmt_d
*p
= (struct move_stmt_d
*) data
;
5587 && (EXPR_P (t
) || GIMPLE_STMT_P (t
)))
5588 TREE_BLOCK (t
) = p
->block
;
5590 if (OMP_DIRECTIVE_P (t
)
5591 && TREE_CODE (t
) != OMP_RETURN
5592 && TREE_CODE (t
) != OMP_CONTINUE
)
5594 /* Do not remap variables inside OMP directives. Variables
5595 referenced in clauses and directive header belong to the
5596 parent function and should not be moved into the child
5598 bool save_remap_decls_p
= p
->remap_decls_p
;
5599 p
->remap_decls_p
= false;
5602 walk_tree (&OMP_BODY (t
), move_stmt_r
, p
, NULL
);
5604 p
->remap_decls_p
= save_remap_decls_p
;
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
= htab_find_with_hash (p
->new_label_map
, &in
, DECL_UID (t
));
5621 DECL_CONTEXT (t
) = p
->to_context
;
5623 else if (p
->remap_decls_p
)
5625 /* Replace T with its duplicate. T should no longer appear in the
5626 parent function, so this looks wasteful; however, it may appear
5627 in referenced_vars, and more importantly, as virtual operands of
5628 statements, and in alias lists of other variables. It would be
5629 quite difficult to expunge it from all those places. ??? It might
5630 suffice to do this for addressable variables. */
5631 if ((TREE_CODE (t
) == VAR_DECL
5632 && !is_global_var (t
))
5633 || TREE_CODE (t
) == CONST_DECL
)
5634 replace_by_duplicate_decl (tp
, p
->vars_map
, p
->to_context
);
5637 && gimple_in_ssa_p (cfun
))
5639 push_cfun (DECL_STRUCT_FUNCTION (p
->to_context
));
5640 add_referenced_var (*tp
);
5646 else if (TYPE_P (t
))
5652 /* Marks virtual operands of all statements in basic blocks BBS for
5656 mark_virtual_ops_in_region (VEC (basic_block
,heap
) *bbs
)
5659 block_stmt_iterator bsi
;
5663 for (i
= 0; VEC_iterate (basic_block
, bbs
, i
, bb
); i
++)
5665 for (phi
= phi_nodes (bb
); phi
; phi
= PHI_CHAIN (phi
))
5666 mark_virtual_ops_for_renaming (phi
);
5668 for (bsi
= bsi_start (bb
); !bsi_end_p (bsi
); bsi_next (&bsi
))
5669 mark_virtual_ops_for_renaming (bsi_stmt (bsi
));
5673 /* Move basic block BB from function CFUN to function DEST_FN. The
5674 block is moved out of the original linked list and placed after
5675 block AFTER in the new list. Also, the block is removed from the
5676 original array of blocks and placed in DEST_FN's array of blocks.
5677 If UPDATE_EDGE_COUNT_P is true, the edge counts on both CFGs is
5678 updated to reflect the moved edges.
5680 The local variables are remapped to new instances, VARS_MAP is used
5681 to record the mapping. */
5684 move_block_to_fn (struct function
*dest_cfun
, basic_block bb
,
5685 basic_block after
, bool update_edge_count_p
,
5686 struct pointer_map_t
*vars_map
, htab_t new_label_map
,
5689 struct control_flow_graph
*cfg
;
5692 block_stmt_iterator si
;
5693 struct move_stmt_d d
;
5694 unsigned old_len
, new_len
;
5697 /* Remove BB from dominance structures. */
5698 delete_from_dominance_info (CDI_DOMINATORS
, bb
);
5700 remove_bb_from_loops (bb
);
5702 /* Link BB to the new linked list. */
5703 move_block_after (bb
, after
);
5705 /* Update the edge count in the corresponding flowgraphs. */
5706 if (update_edge_count_p
)
5707 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
5709 cfun
->cfg
->x_n_edges
--;
5710 dest_cfun
->cfg
->x_n_edges
++;
5713 /* Remove BB from the original basic block array. */
5714 VEC_replace (basic_block
, cfun
->cfg
->x_basic_block_info
, bb
->index
, NULL
);
5715 cfun
->cfg
->x_n_basic_blocks
--;
5717 /* Grow DEST_CFUN's basic block array if needed. */
5718 cfg
= dest_cfun
->cfg
;
5719 cfg
->x_n_basic_blocks
++;
5720 if (bb
->index
>= cfg
->x_last_basic_block
)
5721 cfg
->x_last_basic_block
= bb
->index
+ 1;
5723 old_len
= VEC_length (basic_block
, cfg
->x_basic_block_info
);
5724 if ((unsigned) cfg
->x_last_basic_block
>= old_len
)
5726 new_len
= cfg
->x_last_basic_block
+ (cfg
->x_last_basic_block
+ 3) / 4;
5727 VEC_safe_grow_cleared (basic_block
, gc
, cfg
->x_basic_block_info
,
5731 VEC_replace (basic_block
, cfg
->x_basic_block_info
,
5734 /* Remap the variables in phi nodes. */
5735 for (phi
= phi_nodes (bb
); phi
; phi
= next_phi
)
5738 tree op
= PHI_RESULT (phi
);
5741 next_phi
= PHI_CHAIN (phi
);
5742 if (!is_gimple_reg (op
))
5744 /* Remove the phi nodes for virtual operands (alias analysis will be
5745 run for the new function, anyway). */
5746 remove_phi_node (phi
, NULL
, true);
5750 SET_PHI_RESULT (phi
, replace_ssa_name (op
, vars_map
, dest_cfun
->decl
));
5751 FOR_EACH_PHI_ARG (use
, phi
, oi
, SSA_OP_USE
)
5753 op
= USE_FROM_PTR (use
);
5754 if (TREE_CODE (op
) == SSA_NAME
)
5755 SET_USE (use
, replace_ssa_name (op
, vars_map
, dest_cfun
->decl
));
5759 /* The statements in BB need to be associated with a new TREE_BLOCK.
5760 Labels need to be associated with a new label-to-block map. */
5761 memset (&d
, 0, sizeof (d
));
5762 d
.vars_map
= vars_map
;
5763 d
.from_context
= cfun
->decl
;
5764 d
.to_context
= dest_cfun
->decl
;
5765 d
.new_label_map
= new_label_map
;
5767 for (si
= bsi_start (bb
); !bsi_end_p (si
); bsi_next (&si
))
5769 tree stmt
= bsi_stmt (si
);
5772 d
.remap_decls_p
= true;
5773 if (TREE_BLOCK (stmt
))
5774 d
.block
= DECL_INITIAL (dest_cfun
->decl
);
5776 walk_tree (&stmt
, move_stmt_r
, &d
, NULL
);
5778 if (TREE_CODE (stmt
) == LABEL_EXPR
)
5780 tree label
= LABEL_EXPR_LABEL (stmt
);
5781 int uid
= LABEL_DECL_UID (label
);
5783 gcc_assert (uid
> -1);
5785 old_len
= VEC_length (basic_block
, cfg
->x_label_to_block_map
);
5786 if (old_len
<= (unsigned) uid
)
5788 new_len
= 3 * uid
/ 2;
5789 VEC_safe_grow_cleared (basic_block
, gc
,
5790 cfg
->x_label_to_block_map
, new_len
);
5793 VEC_replace (basic_block
, cfg
->x_label_to_block_map
, uid
, bb
);
5794 VEC_replace (basic_block
, cfun
->cfg
->x_label_to_block_map
, uid
, NULL
);
5796 gcc_assert (DECL_CONTEXT (label
) == dest_cfun
->decl
);
5798 if (uid
>= dest_cfun
->last_label_uid
)
5799 dest_cfun
->last_label_uid
= uid
+ 1;
5801 else if (TREE_CODE (stmt
) == RESX_EXPR
&& eh_offset
!= 0)
5802 TREE_OPERAND (stmt
, 0) =
5803 build_int_cst (NULL_TREE
,
5804 TREE_INT_CST_LOW (TREE_OPERAND (stmt
, 0))
5807 region
= lookup_stmt_eh_region (stmt
);
5810 add_stmt_to_eh_region_fn (dest_cfun
, stmt
, region
+ eh_offset
);
5811 remove_stmt_from_eh_region (stmt
);
5812 gimple_duplicate_stmt_histograms (dest_cfun
, stmt
, cfun
, stmt
);
5813 gimple_remove_stmt_histograms (cfun
, stmt
);
5816 /* We cannot leave any operands allocated from the operand caches of
5817 the current function. */
5818 free_stmt_operands (stmt
);
5819 push_cfun (dest_cfun
);
5825 /* Examine the statements in BB (which is in SRC_CFUN); find and return
5826 the outermost EH region. Use REGION as the incoming base EH region. */
5829 find_outermost_region_in_block (struct function
*src_cfun
,
5830 basic_block bb
, int region
)
5832 block_stmt_iterator si
;
5834 for (si
= bsi_start (bb
); !bsi_end_p (si
); bsi_next (&si
))
5836 tree stmt
= bsi_stmt (si
);
5839 if (TREE_CODE (stmt
) == RESX_EXPR
)
5840 stmt_region
= TREE_INT_CST_LOW (TREE_OPERAND (stmt
, 0));
5842 stmt_region
= lookup_stmt_eh_region_fn (src_cfun
, stmt
);
5843 if (stmt_region
> 0)
5846 region
= stmt_region
;
5847 else if (stmt_region
!= region
)
5849 region
= eh_region_outermost (src_cfun
, stmt_region
, region
);
5850 gcc_assert (region
!= -1);
5859 new_label_mapper (tree decl
, void *data
)
5861 htab_t hash
= (htab_t
) data
;
5865 gcc_assert (TREE_CODE (decl
) == LABEL_DECL
);
5867 m
= xmalloc (sizeof (struct tree_map
));
5868 m
->hash
= DECL_UID (decl
);
5869 m
->base
.from
= decl
;
5870 m
->to
= create_artificial_label ();
5871 LABEL_DECL_UID (m
->to
) = LABEL_DECL_UID (decl
);
5873 slot
= htab_find_slot_with_hash (hash
, m
, m
->hash
, INSERT
);
5874 gcc_assert (*slot
== NULL
);
5881 /* Move a single-entry, single-exit region delimited by ENTRY_BB and
5882 EXIT_BB to function DEST_CFUN. The whole region is replaced by a
5883 single basic block in the original CFG and the new basic block is
5884 returned. DEST_CFUN must not have a CFG yet.
5886 Note that the region need not be a pure SESE region. Blocks inside
5887 the region may contain calls to abort/exit. The only restriction
5888 is that ENTRY_BB should be the only entry point and it must
5891 All local variables referenced in the region are assumed to be in
5892 the corresponding BLOCK_VARS and unexpanded variable lists
5893 associated with DEST_CFUN. */
5896 move_sese_region_to_fn (struct function
*dest_cfun
, basic_block entry_bb
,
5897 basic_block exit_bb
)
5899 VEC(basic_block
,heap
) *bbs
, *dom_bbs
;
5900 basic_block dom_entry
= get_immediate_dominator (CDI_DOMINATORS
, entry_bb
);
5901 basic_block after
, bb
, *entry_pred
, *exit_succ
, abb
;
5902 struct function
*saved_cfun
= cfun
;
5903 int *entry_flag
, *exit_flag
, eh_offset
;
5904 unsigned *entry_prob
, *exit_prob
;
5905 unsigned i
, num_entry_edges
, num_exit_edges
;
5908 htab_t new_label_map
;
5909 struct pointer_map_t
*vars_map
;
5910 struct loop
*loop
= entry_bb
->loop_father
;
5912 /* If ENTRY does not strictly dominate EXIT, this cannot be an SESE
5914 gcc_assert (entry_bb
!= exit_bb
5916 || dominated_by_p (CDI_DOMINATORS
, exit_bb
, entry_bb
)));
5918 /* Collect all the blocks in the region. Manually add ENTRY_BB
5919 because it won't be added by dfs_enumerate_from. */
5921 VEC_safe_push (basic_block
, heap
, bbs
, entry_bb
);
5922 gather_blocks_in_sese_region (entry_bb
, exit_bb
, &bbs
);
5924 /* The blocks that used to be dominated by something in BBS will now be
5925 dominated by the new block. */
5926 dom_bbs
= get_dominated_by_region (CDI_DOMINATORS
,
5927 VEC_address (basic_block
, bbs
),
5928 VEC_length (basic_block
, bbs
));
5930 /* Detach ENTRY_BB and EXIT_BB from CFUN->CFG. We need to remember
5931 the predecessor edges to ENTRY_BB and the successor edges to
5932 EXIT_BB so that we can re-attach them to the new basic block that
5933 will replace the region. */
5934 num_entry_edges
= EDGE_COUNT (entry_bb
->preds
);
5935 entry_pred
= (basic_block
*) xcalloc (num_entry_edges
, sizeof (basic_block
));
5936 entry_flag
= (int *) xcalloc (num_entry_edges
, sizeof (int));
5937 entry_prob
= XNEWVEC (unsigned, num_entry_edges
);
5939 for (ei
= ei_start (entry_bb
->preds
); (e
= ei_safe_edge (ei
)) != NULL
;)
5941 entry_prob
[i
] = e
->probability
;
5942 entry_flag
[i
] = e
->flags
;
5943 entry_pred
[i
++] = e
->src
;
5949 num_exit_edges
= EDGE_COUNT (exit_bb
->succs
);
5950 exit_succ
= (basic_block
*) xcalloc (num_exit_edges
,
5951 sizeof (basic_block
));
5952 exit_flag
= (int *) xcalloc (num_exit_edges
, sizeof (int));
5953 exit_prob
= XNEWVEC (unsigned, num_exit_edges
);
5955 for (ei
= ei_start (exit_bb
->succs
); (e
= ei_safe_edge (ei
)) != NULL
;)
5957 exit_prob
[i
] = e
->probability
;
5958 exit_flag
[i
] = e
->flags
;
5959 exit_succ
[i
++] = e
->dest
;
5971 /* Switch context to the child function to initialize DEST_FN's CFG. */
5972 gcc_assert (dest_cfun
->cfg
== NULL
);
5973 push_cfun (dest_cfun
);
5975 init_empty_tree_cfg ();
5977 /* Initialize EH information for the new function. */
5979 new_label_map
= NULL
;
5984 for (i
= 0; VEC_iterate (basic_block
, bbs
, i
, bb
); i
++)
5985 region
= find_outermost_region_in_block (saved_cfun
, bb
, region
);
5987 init_eh_for_function ();
5990 new_label_map
= htab_create (17, tree_map_hash
, tree_map_eq
, free
);
5991 eh_offset
= duplicate_eh_regions (saved_cfun
, new_label_mapper
,
5992 new_label_map
, region
, 0);
5998 /* The ssa form for virtual operands in the source function will have to
5999 be repaired. We do not care for the real operands -- the sese region
6000 must be closed with respect to those. */
6001 mark_virtual_ops_in_region (bbs
);
6003 /* Move blocks from BBS into DEST_CFUN. */
6004 gcc_assert (VEC_length (basic_block
, bbs
) >= 2);
6005 after
= dest_cfun
->cfg
->x_entry_block_ptr
;
6006 vars_map
= pointer_map_create ();
6007 for (i
= 0; VEC_iterate (basic_block
, bbs
, i
, bb
); i
++)
6009 /* No need to update edge counts on the last block. It has
6010 already been updated earlier when we detached the region from
6011 the original CFG. */
6012 move_block_to_fn (dest_cfun
, bb
, after
, bb
!= exit_bb
, vars_map
,
6013 new_label_map
, eh_offset
);
6018 htab_delete (new_label_map
);
6019 pointer_map_destroy (vars_map
);
6021 /* Rewire the entry and exit blocks. The successor to the entry
6022 block turns into the successor of DEST_FN's ENTRY_BLOCK_PTR in
6023 the child function. Similarly, the predecessor of DEST_FN's
6024 EXIT_BLOCK_PTR turns into the predecessor of EXIT_BLOCK_PTR. We
6025 need to switch CFUN between DEST_CFUN and SAVED_CFUN so that the
6026 various CFG manipulation function get to the right CFG.
6028 FIXME, this is silly. The CFG ought to become a parameter to
6030 push_cfun (dest_cfun
);
6031 make_edge (ENTRY_BLOCK_PTR
, entry_bb
, EDGE_FALLTHRU
);
6033 make_edge (exit_bb
, EXIT_BLOCK_PTR
, 0);
6036 /* Back in the original function, the SESE region has disappeared,
6037 create a new basic block in its place. */
6038 bb
= create_empty_bb (entry_pred
[0]);
6040 add_bb_to_loop (bb
, loop
);
6041 for (i
= 0; i
< num_entry_edges
; i
++)
6043 e
= make_edge (entry_pred
[i
], bb
, entry_flag
[i
]);
6044 e
->probability
= entry_prob
[i
];
6047 for (i
= 0; i
< num_exit_edges
; i
++)
6049 e
= make_edge (bb
, exit_succ
[i
], exit_flag
[i
]);
6050 e
->probability
= exit_prob
[i
];
6053 set_immediate_dominator (CDI_DOMINATORS
, bb
, dom_entry
);
6054 for (i
= 0; VEC_iterate (basic_block
, dom_bbs
, i
, abb
); i
++)
6055 set_immediate_dominator (CDI_DOMINATORS
, abb
, bb
);
6056 VEC_free (basic_block
, heap
, dom_bbs
);
6067 VEC_free (basic_block
, heap
, bbs
);
6073 /* Dump FUNCTION_DECL FN to file FILE using FLAGS (see TDF_* in tree.h) */
6076 dump_function_to_file (tree fn
, FILE *file
, int flags
)
6078 tree arg
, vars
, var
;
6079 struct function
*dsf
;
6080 bool ignore_topmost_bind
= false, any_var
= false;
6084 fprintf (file
, "%s (", lang_hooks
.decl_printable_name (fn
, 2));
6086 arg
= DECL_ARGUMENTS (fn
);
6089 print_generic_expr (file
, arg
, dump_flags
);
6090 if (TREE_CHAIN (arg
))
6091 fprintf (file
, ", ");
6092 arg
= TREE_CHAIN (arg
);
6094 fprintf (file
, ")\n");
6096 dsf
= DECL_STRUCT_FUNCTION (fn
);
6097 if (dsf
&& (flags
& TDF_DETAILS
))
6098 dump_eh_tree (file
, dsf
);
6100 if (flags
& TDF_RAW
)
6102 dump_node (fn
, TDF_SLIM
| flags
, file
);
6106 /* Switch CFUN to point to FN. */
6107 push_cfun (DECL_STRUCT_FUNCTION (fn
));
6109 /* When GIMPLE is lowered, the variables are no longer available in
6110 BIND_EXPRs, so display them separately. */
6111 if (cfun
&& cfun
->decl
== fn
&& cfun
->unexpanded_var_list
)
6113 ignore_topmost_bind
= true;
6115 fprintf (file
, "{\n");
6116 for (vars
= cfun
->unexpanded_var_list
; vars
; vars
= TREE_CHAIN (vars
))
6118 var
= TREE_VALUE (vars
);
6120 print_generic_decl (file
, var
, flags
);
6121 fprintf (file
, "\n");
6127 if (cfun
&& cfun
->decl
== fn
&& cfun
->cfg
&& basic_block_info
)
6129 /* Make a CFG based dump. */
6130 check_bb_profile (ENTRY_BLOCK_PTR
, file
);
6131 if (!ignore_topmost_bind
)
6132 fprintf (file
, "{\n");
6134 if (any_var
&& n_basic_blocks
)
6135 fprintf (file
, "\n");
6138 dump_generic_bb (file
, bb
, 2, flags
);
6140 fprintf (file
, "}\n");
6141 check_bb_profile (EXIT_BLOCK_PTR
, file
);
6147 /* Make a tree based dump. */
6148 chain
= DECL_SAVED_TREE (fn
);
6150 if (chain
&& TREE_CODE (chain
) == BIND_EXPR
)
6152 if (ignore_topmost_bind
)
6154 chain
= BIND_EXPR_BODY (chain
);
6162 if (!ignore_topmost_bind
)
6163 fprintf (file
, "{\n");
6168 fprintf (file
, "\n");
6170 print_generic_stmt_indented (file
, chain
, flags
, indent
);
6171 if (ignore_topmost_bind
)
6172 fprintf (file
, "}\n");
6175 fprintf (file
, "\n\n");
6182 /* Dump FUNCTION_DECL FN to stderr using FLAGS (see TDF_* in tree.h) */
6185 debug_function (tree fn
, int flags
)
6187 dump_function_to_file (fn
, stderr
, flags
);
6191 /* Pretty print of the loops intermediate representation. */
6192 static void print_loop (FILE *, struct loop
*, int);
6193 static void print_pred_bbs (FILE *, basic_block bb
);
6194 static void print_succ_bbs (FILE *, basic_block bb
);
6197 /* Print on FILE the indexes for the predecessors of basic_block BB. */
6200 print_pred_bbs (FILE *file
, basic_block bb
)
6205 FOR_EACH_EDGE (e
, ei
, bb
->preds
)
6206 fprintf (file
, "bb_%d ", e
->src
->index
);
6210 /* Print on FILE the indexes for the successors of basic_block BB. */
6213 print_succ_bbs (FILE *file
, basic_block bb
)
6218 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
6219 fprintf (file
, "bb_%d ", e
->dest
->index
);
6223 /* Pretty print LOOP on FILE, indented INDENT spaces. */
6226 print_loop (FILE *file
, struct loop
*loop
, int indent
)
6234 s_indent
= (char *) alloca ((size_t) indent
+ 1);
6235 memset ((void *) s_indent
, ' ', (size_t) indent
);
6236 s_indent
[indent
] = '\0';
6238 /* Print the loop's header. */
6239 fprintf (file
, "%sloop_%d\n", s_indent
, loop
->num
);
6241 /* Print the loop's body. */
6242 fprintf (file
, "%s{\n", s_indent
);
6244 if (bb
->loop_father
== loop
)
6246 /* Print the basic_block's header. */
6247 fprintf (file
, "%s bb_%d (preds = {", s_indent
, bb
->index
);
6248 print_pred_bbs (file
, bb
);
6249 fprintf (file
, "}, succs = {");
6250 print_succ_bbs (file
, bb
);
6251 fprintf (file
, "})\n");
6253 /* Print the basic_block's body. */
6254 fprintf (file
, "%s {\n", s_indent
);
6255 tree_dump_bb (bb
, file
, indent
+ 4);
6256 fprintf (file
, "%s }\n", s_indent
);
6259 print_loop (file
, loop
->inner
, indent
+ 2);
6260 fprintf (file
, "%s}\n", s_indent
);
6261 print_loop (file
, loop
->next
, indent
);
6265 /* Follow a CFG edge from the entry point of the program, and on entry
6266 of a loop, pretty print the loop structure on FILE. */
6269 print_loop_ir (FILE *file
)
6273 bb
= BASIC_BLOCK (NUM_FIXED_BLOCKS
);
6274 if (bb
&& bb
->loop_father
)
6275 print_loop (file
, bb
->loop_father
, 0);
6279 /* Debugging loops structure at tree level. */
6282 debug_loop_ir (void)
6284 print_loop_ir (stderr
);
6288 /* Return true if BB ends with a call, possibly followed by some
6289 instructions that must stay with the call. Return false,
6293 tree_block_ends_with_call_p (basic_block bb
)
6295 block_stmt_iterator bsi
= bsi_last (bb
);
6296 return get_call_expr_in (bsi_stmt (bsi
)) != NULL
;
6300 /* Return true if BB ends with a conditional branch. Return false,
6304 tree_block_ends_with_condjump_p (const_basic_block bb
)
6306 /* This CONST_CAST is okay because last_stmt doesn't modify its
6307 argument and the return value is not modified. */
6308 const_tree stmt
= last_stmt (CONST_CAST_BB(bb
));
6309 return (stmt
&& TREE_CODE (stmt
) == COND_EXPR
);
6313 /* Return true if we need to add fake edge to exit at statement T.
6314 Helper function for tree_flow_call_edges_add. */
6317 need_fake_edge_p (tree t
)
6321 /* NORETURN and LONGJMP calls already have an edge to exit.
6322 CONST and PURE calls do not need one.
6323 We don't currently check for CONST and PURE here, although
6324 it would be a good idea, because those attributes are
6325 figured out from the RTL in mark_constant_function, and
6326 the counter incrementation code from -fprofile-arcs
6327 leads to different results from -fbranch-probabilities. */
6328 call
= get_call_expr_in (t
);
6330 && !(call_expr_flags (call
) & ECF_NORETURN
))
6333 if (TREE_CODE (t
) == ASM_EXPR
6334 && (ASM_VOLATILE_P (t
) || ASM_INPUT_P (t
)))
6341 /* Add fake edges to the function exit for any non constant and non
6342 noreturn calls, volatile inline assembly in the bitmap of blocks
6343 specified by BLOCKS or to the whole CFG if BLOCKS is zero. Return
6344 the number of blocks that were split.
6346 The goal is to expose cases in which entering a basic block does
6347 not imply that all subsequent instructions must be executed. */
6350 tree_flow_call_edges_add (sbitmap blocks
)
6353 int blocks_split
= 0;
6354 int last_bb
= last_basic_block
;
6355 bool check_last_block
= false;
6357 if (n_basic_blocks
== NUM_FIXED_BLOCKS
)
6361 check_last_block
= true;
6363 check_last_block
= TEST_BIT (blocks
, EXIT_BLOCK_PTR
->prev_bb
->index
);
6365 /* In the last basic block, before epilogue generation, there will be
6366 a fallthru edge to EXIT. Special care is required if the last insn
6367 of the last basic block is a call because make_edge folds duplicate
6368 edges, which would result in the fallthru edge also being marked
6369 fake, which would result in the fallthru edge being removed by
6370 remove_fake_edges, which would result in an invalid CFG.
6372 Moreover, we can't elide the outgoing fake edge, since the block
6373 profiler needs to take this into account in order to solve the minimal
6374 spanning tree in the case that the call doesn't return.
6376 Handle this by adding a dummy instruction in a new last basic block. */
6377 if (check_last_block
)
6379 basic_block bb
= EXIT_BLOCK_PTR
->prev_bb
;
6380 block_stmt_iterator bsi
= bsi_last (bb
);
6382 if (!bsi_end_p (bsi
))
6385 if (t
&& need_fake_edge_p (t
))
6389 e
= find_edge (bb
, EXIT_BLOCK_PTR
);
6392 bsi_insert_on_edge (e
, build_empty_stmt ());
6393 bsi_commit_edge_inserts ();
6398 /* Now add fake edges to the function exit for any non constant
6399 calls since there is no way that we can determine if they will
6401 for (i
= 0; i
< last_bb
; i
++)
6403 basic_block bb
= BASIC_BLOCK (i
);
6404 block_stmt_iterator bsi
;
6405 tree stmt
, last_stmt
;
6410 if (blocks
&& !TEST_BIT (blocks
, i
))
6413 bsi
= bsi_last (bb
);
6414 if (!bsi_end_p (bsi
))
6416 last_stmt
= bsi_stmt (bsi
);
6419 stmt
= bsi_stmt (bsi
);
6420 if (need_fake_edge_p (stmt
))
6423 /* The handling above of the final block before the
6424 epilogue should be enough to verify that there is
6425 no edge to the exit block in CFG already.
6426 Calling make_edge in such case would cause us to
6427 mark that edge as fake and remove it later. */
6428 #ifdef ENABLE_CHECKING
6429 if (stmt
== last_stmt
)
6431 e
= find_edge (bb
, EXIT_BLOCK_PTR
);
6432 gcc_assert (e
== NULL
);
6436 /* Note that the following may create a new basic block
6437 and renumber the existing basic blocks. */
6438 if (stmt
!= last_stmt
)
6440 e
= split_block (bb
, stmt
);
6444 make_edge (bb
, EXIT_BLOCK_PTR
, EDGE_FAKE
);
6448 while (!bsi_end_p (bsi
));
6453 verify_flow_info ();
6455 return blocks_split
;
6458 /* Purge dead abnormal call edges from basic block BB. */
6461 tree_purge_dead_abnormal_call_edges (basic_block bb
)
6463 bool changed
= tree_purge_dead_eh_edges (bb
);
6465 if (current_function_has_nonlocal_label
)
6467 tree stmt
= last_stmt (bb
);
6471 if (!(stmt
&& tree_can_make_abnormal_goto (stmt
)))
6472 for (ei
= ei_start (bb
->succs
); (e
= ei_safe_edge (ei
)); )
6474 if (e
->flags
& EDGE_ABNORMAL
)
6483 /* See tree_purge_dead_eh_edges below. */
6485 free_dominance_info (CDI_DOMINATORS
);
6491 /* Stores all basic blocks dominated by BB to DOM_BBS. */
6494 get_all_dominated_blocks (basic_block bb
, VEC (basic_block
, heap
) **dom_bbs
)
6498 VEC_safe_push (basic_block
, heap
, *dom_bbs
, bb
);
6499 for (son
= first_dom_son (CDI_DOMINATORS
, bb
);
6501 son
= next_dom_son (CDI_DOMINATORS
, son
))
6502 get_all_dominated_blocks (son
, dom_bbs
);
6505 /* Removes edge E and all the blocks dominated by it, and updates dominance
6506 information. The IL in E->src needs to be updated separately.
6507 If dominance info is not available, only the edge E is removed.*/
6510 remove_edge_and_dominated_blocks (edge e
)
6512 VEC (basic_block
, heap
) *bbs_to_remove
= NULL
;
6513 VEC (basic_block
, heap
) *bbs_to_fix_dom
= NULL
;
6517 bool none_removed
= false;
6519 basic_block bb
, dbb
;
6522 if (!dom_info_available_p (CDI_DOMINATORS
))
6528 /* No updating is needed for edges to exit. */
6529 if (e
->dest
== EXIT_BLOCK_PTR
)
6531 if (cfgcleanup_altered_bbs
)
6532 bitmap_set_bit (cfgcleanup_altered_bbs
, e
->src
->index
);
6537 /* First, we find the basic blocks to remove. If E->dest has a predecessor
6538 that is not dominated by E->dest, then this set is empty. Otherwise,
6539 all the basic blocks dominated by E->dest are removed.
6541 Also, to DF_IDOM we store the immediate dominators of the blocks in
6542 the dominance frontier of E (i.e., of the successors of the
6543 removed blocks, if there are any, and of E->dest otherwise). */
6544 FOR_EACH_EDGE (f
, ei
, e
->dest
->preds
)
6549 if (!dominated_by_p (CDI_DOMINATORS
, f
->src
, e
->dest
))
6551 none_removed
= true;
6556 df
= BITMAP_ALLOC (NULL
);
6557 df_idom
= BITMAP_ALLOC (NULL
);
6560 bitmap_set_bit (df_idom
,
6561 get_immediate_dominator (CDI_DOMINATORS
, e
->dest
)->index
);
6564 get_all_dominated_blocks (e
->dest
, &bbs_to_remove
);
6565 for (i
= 0; VEC_iterate (basic_block
, bbs_to_remove
, i
, bb
); i
++)
6567 FOR_EACH_EDGE (f
, ei
, bb
->succs
)
6569 if (f
->dest
!= EXIT_BLOCK_PTR
)
6570 bitmap_set_bit (df
, f
->dest
->index
);
6573 for (i
= 0; VEC_iterate (basic_block
, bbs_to_remove
, i
, bb
); i
++)
6574 bitmap_clear_bit (df
, bb
->index
);
6576 EXECUTE_IF_SET_IN_BITMAP (df
, 0, i
, bi
)
6578 bb
= BASIC_BLOCK (i
);
6579 bitmap_set_bit (df_idom
,
6580 get_immediate_dominator (CDI_DOMINATORS
, bb
)->index
);
6584 if (cfgcleanup_altered_bbs
)
6586 /* Record the set of the altered basic blocks. */
6587 bitmap_set_bit (cfgcleanup_altered_bbs
, e
->src
->index
);
6588 bitmap_ior_into (cfgcleanup_altered_bbs
, df
);
6591 /* Remove E and the cancelled blocks. */
6596 for (i
= 0; VEC_iterate (basic_block
, bbs_to_remove
, i
, bb
); i
++)
6597 delete_basic_block (bb
);
6600 /* Update the dominance information. The immediate dominator may change only
6601 for blocks whose immediate dominator belongs to DF_IDOM:
6603 Suppose that idom(X) = Y before removal of E and idom(X) != Y after the
6604 removal. Let Z the arbitrary block such that idom(Z) = Y and
6605 Z dominates X after the removal. Before removal, there exists a path P
6606 from Y to X that avoids Z. Let F be the last edge on P that is
6607 removed, and let W = F->dest. Before removal, idom(W) = Y (since Y
6608 dominates W, and because of P, Z does not dominate W), and W belongs to
6609 the dominance frontier of E. Therefore, Y belongs to DF_IDOM. */
6610 EXECUTE_IF_SET_IN_BITMAP (df_idom
, 0, i
, bi
)
6612 bb
= BASIC_BLOCK (i
);
6613 for (dbb
= first_dom_son (CDI_DOMINATORS
, bb
);
6615 dbb
= next_dom_son (CDI_DOMINATORS
, dbb
))
6616 VEC_safe_push (basic_block
, heap
, bbs_to_fix_dom
, dbb
);
6619 iterate_fix_dominators (CDI_DOMINATORS
, bbs_to_fix_dom
, true);
6622 BITMAP_FREE (df_idom
);
6623 VEC_free (basic_block
, heap
, bbs_to_remove
);
6624 VEC_free (basic_block
, heap
, bbs_to_fix_dom
);
6627 /* Purge dead EH edges from basic block BB. */
6630 tree_purge_dead_eh_edges (basic_block bb
)
6632 bool changed
= false;
6635 tree stmt
= last_stmt (bb
);
6637 if (stmt
&& tree_can_throw_internal (stmt
))
6640 for (ei
= ei_start (bb
->succs
); (e
= ei_safe_edge (ei
)); )
6642 if (e
->flags
& EDGE_EH
)
6644 remove_edge_and_dominated_blocks (e
);
6655 tree_purge_all_dead_eh_edges (const_bitmap blocks
)
6657 bool changed
= false;
6661 EXECUTE_IF_SET_IN_BITMAP (blocks
, 0, i
, bi
)
6663 changed
|= tree_purge_dead_eh_edges (BASIC_BLOCK (i
));
6669 /* This function is called whenever a new edge is created or
6673 tree_execute_on_growing_pred (edge e
)
6675 basic_block bb
= e
->dest
;
6678 reserve_phi_args_for_new_edge (bb
);
6681 /* This function is called immediately before edge E is removed from
6682 the edge vector E->dest->preds. */
6685 tree_execute_on_shrinking_pred (edge e
)
6687 if (phi_nodes (e
->dest
))
6688 remove_phi_args (e
);
6691 /*---------------------------------------------------------------------------
6692 Helper functions for Loop versioning
6693 ---------------------------------------------------------------------------*/
6695 /* Adjust phi nodes for 'first' basic block. 'second' basic block is a copy
6696 of 'first'. Both of them are dominated by 'new_head' basic block. When
6697 'new_head' was created by 'second's incoming edge it received phi arguments
6698 on the edge by split_edge(). Later, additional edge 'e' was created to
6699 connect 'new_head' and 'first'. Now this routine adds phi args on this
6700 additional edge 'e' that new_head to second edge received as part of edge
6705 tree_lv_adjust_loop_header_phi (basic_block first
, basic_block second
,
6706 basic_block new_head
, edge e
)
6709 edge e2
= find_edge (new_head
, second
);
6711 /* Because NEW_HEAD has been created by splitting SECOND's incoming
6712 edge, we should always have an edge from NEW_HEAD to SECOND. */
6713 gcc_assert (e2
!= NULL
);
6715 /* Browse all 'second' basic block phi nodes and add phi args to
6716 edge 'e' for 'first' head. PHI args are always in correct order. */
6718 for (phi2
= phi_nodes (second
), phi1
= phi_nodes (first
);
6720 phi2
= PHI_CHAIN (phi2
), phi1
= PHI_CHAIN (phi1
))
6722 tree def
= PHI_ARG_DEF (phi2
, e2
->dest_idx
);
6723 add_phi_arg (phi1
, def
, e
);
6727 /* Adds a if else statement to COND_BB with condition COND_EXPR.
6728 SECOND_HEAD is the destination of the THEN and FIRST_HEAD is
6729 the destination of the ELSE part. */
6731 tree_lv_add_condition_to_bb (basic_block first_head ATTRIBUTE_UNUSED
,
6732 basic_block second_head ATTRIBUTE_UNUSED
,
6733 basic_block cond_bb
, void *cond_e
)
6735 block_stmt_iterator bsi
;
6736 tree new_cond_expr
= NULL_TREE
;
6737 tree cond_expr
= (tree
) cond_e
;
6740 /* Build new conditional expr */
6741 new_cond_expr
= build3 (COND_EXPR
, void_type_node
, cond_expr
,
6742 NULL_TREE
, NULL_TREE
);
6744 /* Add new cond in cond_bb. */
6745 bsi
= bsi_start (cond_bb
);
6746 bsi_insert_after (&bsi
, new_cond_expr
, BSI_NEW_STMT
);
6747 /* Adjust edges appropriately to connect new head with first head
6748 as well as second head. */
6749 e0
= single_succ_edge (cond_bb
);
6750 e0
->flags
&= ~EDGE_FALLTHRU
;
6751 e0
->flags
|= EDGE_FALSE_VALUE
;
6754 struct cfg_hooks tree_cfg_hooks
= {
6756 tree_verify_flow_info
,
6757 tree_dump_bb
, /* dump_bb */
6758 create_bb
, /* create_basic_block */
6759 tree_redirect_edge_and_branch
,/* redirect_edge_and_branch */
6760 tree_redirect_edge_and_branch_force
,/* redirect_edge_and_branch_force */
6761 tree_can_remove_branch_p
, /* can_remove_branch_p */
6762 remove_bb
, /* delete_basic_block */
6763 tree_split_block
, /* split_block */
6764 tree_move_block_after
, /* move_block_after */
6765 tree_can_merge_blocks_p
, /* can_merge_blocks_p */
6766 tree_merge_blocks
, /* merge_blocks */
6767 tree_predict_edge
, /* predict_edge */
6768 tree_predicted_by_p
, /* predicted_by_p */
6769 tree_can_duplicate_bb_p
, /* can_duplicate_block_p */
6770 tree_duplicate_bb
, /* duplicate_block */
6771 tree_split_edge
, /* split_edge */
6772 tree_make_forwarder_block
, /* make_forward_block */
6773 NULL
, /* tidy_fallthru_edge */
6774 tree_block_ends_with_call_p
, /* block_ends_with_call_p */
6775 tree_block_ends_with_condjump_p
, /* block_ends_with_condjump_p */
6776 tree_flow_call_edges_add
, /* flow_call_edges_add */
6777 tree_execute_on_growing_pred
, /* execute_on_growing_pred */
6778 tree_execute_on_shrinking_pred
, /* execute_on_shrinking_pred */
6779 tree_duplicate_loop_to_header_edge
, /* duplicate loop for trees */
6780 tree_lv_add_condition_to_bb
, /* lv_add_condition_to_bb */
6781 tree_lv_adjust_loop_header_phi
, /* lv_adjust_loop_header_phi*/
6782 extract_true_false_edges_from_block
, /* extract_cond_bb_edges */
6783 flush_pending_stmts
/* flush_pending_stmts */
6787 /* Split all critical edges. */
6790 split_critical_edges (void)
6796 /* split_edge can redirect edges out of SWITCH_EXPRs, which can get
6797 expensive. So we want to enable recording of edge to CASE_LABEL_EXPR
6798 mappings around the calls to split_edge. */
6799 start_recording_case_labels ();
6802 FOR_EACH_EDGE (e
, ei
, bb
->succs
)
6803 if (EDGE_CRITICAL_P (e
) && !(e
->flags
& EDGE_ABNORMAL
))
6808 end_recording_case_labels ();
6812 struct tree_opt_pass pass_split_crit_edges
=
6814 "crited", /* name */
6816 split_critical_edges
, /* execute */
6819 0, /* static_pass_number */
6820 TV_TREE_SPLIT_EDGES
, /* tv_id */
6821 PROP_cfg
, /* properties required */
6822 PROP_no_crit_edges
, /* properties_provided */
6823 0, /* properties_destroyed */
6824 0, /* todo_flags_start */
6825 TODO_dump_func
, /* todo_flags_finish */
6830 /* Return EXP if it is a valid GIMPLE rvalue, else gimplify it into
6831 a temporary, make sure and register it to be renamed if necessary,
6832 and finally return the temporary. Put the statements to compute
6833 EXP before the current statement in BSI. */
6836 gimplify_val (block_stmt_iterator
*bsi
, tree type
, tree exp
)
6838 tree t
, new_stmt
, orig_stmt
;
6840 if (is_gimple_val (exp
))
6843 t
= make_rename_temp (type
, NULL
);
6844 new_stmt
= build_gimple_modify_stmt (t
, exp
);
6846 orig_stmt
= bsi_stmt (*bsi
);
6847 SET_EXPR_LOCUS (new_stmt
, EXPR_LOCUS (orig_stmt
));
6848 TREE_BLOCK (new_stmt
) = TREE_BLOCK (orig_stmt
);
6850 bsi_insert_before (bsi
, new_stmt
, BSI_SAME_STMT
);
6851 if (gimple_in_ssa_p (cfun
))
6852 mark_symbols_for_renaming (new_stmt
);
6857 /* Build a ternary operation and gimplify it. Emit code before BSI.
6858 Return the gimple_val holding the result. */
6861 gimplify_build3 (block_stmt_iterator
*bsi
, enum tree_code code
,
6862 tree type
, tree a
, tree b
, tree c
)
6866 ret
= fold_build3 (code
, type
, a
, b
, c
);
6869 return gimplify_val (bsi
, type
, ret
);
6872 /* Build a binary operation and gimplify it. Emit code before BSI.
6873 Return the gimple_val holding the result. */
6876 gimplify_build2 (block_stmt_iterator
*bsi
, enum tree_code code
,
6877 tree type
, tree a
, tree b
)
6881 ret
= fold_build2 (code
, type
, a
, b
);
6884 return gimplify_val (bsi
, type
, ret
);
6887 /* Build a unary operation and gimplify it. Emit code before BSI.
6888 Return the gimple_val holding the result. */
6891 gimplify_build1 (block_stmt_iterator
*bsi
, enum tree_code code
, tree type
,
6896 ret
= fold_build1 (code
, type
, a
);
6899 return gimplify_val (bsi
, type
, ret
);
6904 /* Emit return warnings. */
6907 execute_warn_function_return (void)
6909 #ifdef USE_MAPPED_LOCATION
6910 source_location location
;
6918 /* If we have a path to EXIT, then we do return. */
6919 if (TREE_THIS_VOLATILE (cfun
->decl
)
6920 && EDGE_COUNT (EXIT_BLOCK_PTR
->preds
) > 0)
6922 #ifdef USE_MAPPED_LOCATION
6923 location
= UNKNOWN_LOCATION
;
6927 FOR_EACH_EDGE (e
, ei
, EXIT_BLOCK_PTR
->preds
)
6929 last
= last_stmt (e
->src
);
6930 if (TREE_CODE (last
) == RETURN_EXPR
6931 #ifdef USE_MAPPED_LOCATION
6932 && (location
= EXPR_LOCATION (last
)) != UNKNOWN_LOCATION
)
6934 && (locus
= EXPR_LOCUS (last
)) != NULL
)
6938 #ifdef USE_MAPPED_LOCATION
6939 if (location
== UNKNOWN_LOCATION
)
6940 location
= cfun
->function_end_locus
;
6941 warning (0, "%H%<noreturn%> function does return", &location
);
6944 locus
= &cfun
->function_end_locus
;
6945 warning (0, "%H%<noreturn%> function does return", locus
);
6949 /* If we see "return;" in some basic block, then we do reach the end
6950 without returning a value. */
6951 else if (warn_return_type
6952 && !TREE_NO_WARNING (cfun
->decl
)
6953 && EDGE_COUNT (EXIT_BLOCK_PTR
->preds
) > 0
6954 && !VOID_TYPE_P (TREE_TYPE (TREE_TYPE (cfun
->decl
))))
6956 FOR_EACH_EDGE (e
, ei
, EXIT_BLOCK_PTR
->preds
)
6958 tree last
= last_stmt (e
->src
);
6959 if (TREE_CODE (last
) == RETURN_EXPR
6960 && TREE_OPERAND (last
, 0) == NULL
6961 && !TREE_NO_WARNING (last
))
6963 #ifdef USE_MAPPED_LOCATION
6964 location
= EXPR_LOCATION (last
);
6965 if (location
== UNKNOWN_LOCATION
)
6966 location
= cfun
->function_end_locus
;
6967 warning (OPT_Wreturn_type
, "%Hcontrol reaches end of non-void function", &location
);
6969 locus
= EXPR_LOCUS (last
);
6971 locus
= &cfun
->function_end_locus
;
6972 warning (OPT_Wreturn_type
, "%Hcontrol reaches end of non-void function", locus
);
6974 TREE_NO_WARNING (cfun
->decl
) = 1;
6983 /* Given a basic block B which ends with a conditional and has
6984 precisely two successors, determine which of the edges is taken if
6985 the conditional is true and which is taken if the conditional is
6986 false. Set TRUE_EDGE and FALSE_EDGE appropriately. */
6989 extract_true_false_edges_from_block (basic_block b
,
6993 edge e
= EDGE_SUCC (b
, 0);
6995 if (e
->flags
& EDGE_TRUE_VALUE
)
6998 *false_edge
= EDGE_SUCC (b
, 1);
7003 *true_edge
= EDGE_SUCC (b
, 1);
7007 struct tree_opt_pass pass_warn_function_return
=
7011 execute_warn_function_return
, /* execute */
7014 0, /* static_pass_number */
7016 PROP_cfg
, /* properties_required */
7017 0, /* properties_provided */
7018 0, /* properties_destroyed */
7019 0, /* todo_flags_start */
7020 0, /* todo_flags_finish */
7024 /* Emit noreturn warnings. */
7027 execute_warn_function_noreturn (void)
7029 if (warn_missing_noreturn
7030 && !TREE_THIS_VOLATILE (cfun
->decl
)
7031 && EDGE_COUNT (EXIT_BLOCK_PTR
->preds
) == 0
7032 && !lang_hooks
.function
.missing_noreturn_ok_p (cfun
->decl
))
7033 warning (OPT_Wmissing_noreturn
, "%Jfunction might be possible candidate "
7034 "for attribute %<noreturn%>",
7039 struct tree_opt_pass pass_warn_function_noreturn
=
7043 execute_warn_function_noreturn
, /* execute */
7046 0, /* static_pass_number */
7048 PROP_cfg
, /* properties_required */
7049 0, /* properties_provided */
7050 0, /* properties_destroyed */
7051 0, /* todo_flags_start */
7052 0, /* todo_flags_finish */