1 /* Control flow functions for trees.
2 Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009,
3 2010, 2011, 2012 Free Software Foundation, Inc.
4 Contributed by Diego Novillo <dnovillo@redhat.com>
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 3, or (at your option)
13 GCC is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
24 #include "coretypes.h"
28 #include "basic-block.h"
32 #include "gimple-pretty-print.h"
33 #include "tree-flow.h"
34 #include "tree-dump.h"
35 #include "tree-pass.h"
36 #include "diagnostic-core.h"
39 #include "tree-ssa-propagate.h"
40 #include "value-prof.h"
41 #include "pointer-set.h"
42 #include "tree-inline.h"
45 /* This file contains functions for building the Control Flow Graph (CFG)
46 for a function tree. */
48 /* Local declarations. */
50 /* Initial capacity for the basic block array. */
51 static const int initial_cfg_capacity = 20;
53 /* This hash table allows us to efficiently lookup all CASE_LABEL_EXPRs
54 which use a particular edge. The CASE_LABEL_EXPRs are chained together
55 via their CASE_CHAIN field, which we clear after we're done with the
56 hash table to prevent problems with duplication of GIMPLE_SWITCHes.
58 Access to this list of CASE_LABEL_EXPRs allows us to efficiently
59 update the case vector in response to edge redirections.
61 Right now this table is set up and torn down at key points in the
62 compilation process. It would be nice if we could make the table
63 more persistent. The key is getting notification of changes to
64 the CFG (particularly edge removal, creation and redirection). */
66 static struct pointer_map_t *edge_to_cases;
68 /* If we record edge_to_cases, this bitmap will hold indexes
69 of basic blocks that end in a GIMPLE_SWITCH which we touched
70 due to edge manipulations. */
72 static bitmap touched_switch_bbs;
77 long num_merged_labels;
80 static struct cfg_stats_d cfg_stats;
82 /* Nonzero if we found a computed goto while building basic blocks. */
83 static bool found_computed_goto;
85 /* Hash table to store last discriminator assigned for each locus. */
86 struct locus_discrim_map
91 static htab_t discriminator_per_locus;
93 /* Basic blocks and flowgraphs. */
94 static void make_blocks (gimple_seq);
95 static void factor_computed_gotos (void);
98 static void make_edges (void);
99 static void make_cond_expr_edges (basic_block);
100 static void make_gimple_switch_edges (basic_block);
101 static void make_goto_expr_edges (basic_block);
102 static void make_gimple_asm_edges (basic_block);
103 static unsigned int locus_map_hash (const void *);
104 static int locus_map_eq (const void *, const void *);
105 static void assign_discriminator (location_t, basic_block);
106 static edge gimple_redirect_edge_and_branch (edge, basic_block);
107 static edge gimple_try_redirect_by_replacing_jump (edge, basic_block);
108 static unsigned int split_critical_edges (void);
110 /* Various helpers. */
111 static inline bool stmt_starts_bb_p (gimple, gimple);
112 static int gimple_verify_flow_info (void);
113 static void gimple_make_forwarder_block (edge);
114 static void gimple_cfg2vcg (FILE *);
115 static gimple first_non_label_stmt (basic_block);
116 static bool verify_gimple_transaction (gimple);
118 /* Flowgraph optimization and cleanup. */
119 static void gimple_merge_blocks (basic_block, basic_block);
120 static bool gimple_can_merge_blocks_p (basic_block, basic_block);
121 static void remove_bb (basic_block);
122 static edge find_taken_edge_computed_goto (basic_block, tree);
123 static edge find_taken_edge_cond_expr (basic_block, tree);
124 static edge find_taken_edge_switch_expr (basic_block, tree);
125 static tree find_case_label_for_value (gimple, tree);
128 init_empty_tree_cfg_for_function (struct function *fn)
130 /* Initialize the basic block array. */
132 profile_status_for_function (fn) = PROFILE_ABSENT;
133 n_basic_blocks_for_function (fn) = NUM_FIXED_BLOCKS;
134 last_basic_block_for_function (fn) = NUM_FIXED_BLOCKS;
135 basic_block_info_for_function (fn)
136 = VEC_alloc (basic_block, gc, initial_cfg_capacity);
137 VEC_safe_grow_cleared (basic_block, gc,
138 basic_block_info_for_function (fn),
139 initial_cfg_capacity);
141 /* Build a mapping of labels to their associated blocks. */
142 label_to_block_map_for_function (fn)
143 = VEC_alloc (basic_block, gc, initial_cfg_capacity);
144 VEC_safe_grow_cleared (basic_block, gc,
145 label_to_block_map_for_function (fn),
146 initial_cfg_capacity);
148 SET_BASIC_BLOCK_FOR_FUNCTION (fn, ENTRY_BLOCK,
149 ENTRY_BLOCK_PTR_FOR_FUNCTION (fn));
150 SET_BASIC_BLOCK_FOR_FUNCTION (fn, EXIT_BLOCK,
151 EXIT_BLOCK_PTR_FOR_FUNCTION (fn));
153 ENTRY_BLOCK_PTR_FOR_FUNCTION (fn)->next_bb
154 = EXIT_BLOCK_PTR_FOR_FUNCTION (fn);
155 EXIT_BLOCK_PTR_FOR_FUNCTION (fn)->prev_bb
156 = ENTRY_BLOCK_PTR_FOR_FUNCTION (fn);
160 init_empty_tree_cfg (void)
162 init_empty_tree_cfg_for_function (cfun);
165 /*---------------------------------------------------------------------------
167 ---------------------------------------------------------------------------*/
169 /* Entry point to the CFG builder for trees. SEQ is the sequence of
170 statements to be added to the flowgraph. */
173 build_gimple_cfg (gimple_seq seq)
175 /* Register specific gimple functions. */
176 gimple_register_cfg_hooks ();
178 memset ((void *) &cfg_stats, 0, sizeof (cfg_stats));
180 init_empty_tree_cfg ();
182 found_computed_goto = 0;
185 /* Computed gotos are hell to deal with, especially if there are
186 lots of them with a large number of destinations. So we factor
187 them to a common computed goto location before we build the
188 edge list. After we convert back to normal form, we will un-factor
189 the computed gotos since factoring introduces an unwanted jump. */
190 if (found_computed_goto)
191 factor_computed_gotos ();
193 /* Make sure there is always at least one block, even if it's empty. */
194 if (n_basic_blocks == NUM_FIXED_BLOCKS)
195 create_empty_bb (ENTRY_BLOCK_PTR);
197 /* Adjust the size of the array. */
198 if (VEC_length (basic_block, basic_block_info) < (size_t) n_basic_blocks)
199 VEC_safe_grow_cleared (basic_block, gc, basic_block_info, n_basic_blocks);
201 /* To speed up statement iterator walks, we first purge dead labels. */
202 cleanup_dead_labels ();
204 /* Group case nodes to reduce the number of edges.
205 We do this after cleaning up dead labels because otherwise we miss
206 a lot of obvious case merging opportunities. */
207 group_case_labels ();
209 /* Create the edges of the flowgraph. */
210 discriminator_per_locus = htab_create (13, locus_map_hash, locus_map_eq,
213 cleanup_dead_labels ();
214 htab_delete (discriminator_per_locus);
216 /* Debugging dumps. */
218 /* Write the flowgraph to a VCG file. */
220 int local_dump_flags;
221 FILE *vcg_file = dump_begin (TDI_vcg, &local_dump_flags);
224 gimple_cfg2vcg (vcg_file);
225 dump_end (TDI_vcg, vcg_file);
231 execute_build_cfg (void)
233 gimple_seq body = gimple_body (current_function_decl);
235 build_gimple_cfg (body);
236 gimple_set_body (current_function_decl, NULL);
237 if (dump_file && (dump_flags & TDF_DETAILS))
239 fprintf (dump_file, "Scope blocks:\n");
240 dump_scope_blocks (dump_file, dump_flags);
245 struct gimple_opt_pass pass_build_cfg =
251 execute_build_cfg, /* execute */
254 0, /* static_pass_number */
255 TV_TREE_CFG, /* tv_id */
256 PROP_gimple_leh, /* properties_required */
257 PROP_cfg, /* properties_provided */
258 0, /* properties_destroyed */
259 0, /* todo_flags_start */
260 TODO_verify_stmts | TODO_cleanup_cfg /* todo_flags_finish */
265 /* Return true if T is a computed goto. */
268 computed_goto_p (gimple t)
270 return (gimple_code (t) == GIMPLE_GOTO
271 && TREE_CODE (gimple_goto_dest (t)) != LABEL_DECL);
275 /* Search the CFG for any computed gotos. If found, factor them to a
276 common computed goto site. Also record the location of that site so
277 that we can un-factor the gotos after we have converted back to
281 factor_computed_gotos (void)
284 tree factored_label_decl = NULL;
286 gimple factored_computed_goto_label = NULL;
287 gimple factored_computed_goto = NULL;
289 /* We know there are one or more computed gotos in this function.
290 Examine the last statement in each basic block to see if the block
291 ends with a computed goto. */
295 gimple_stmt_iterator gsi = gsi_last_bb (bb);
301 last = gsi_stmt (gsi);
303 /* Ignore the computed goto we create when we factor the original
305 if (last == factored_computed_goto)
308 /* If the last statement is a computed goto, factor it. */
309 if (computed_goto_p (last))
313 /* The first time we find a computed goto we need to create
314 the factored goto block and the variable each original
315 computed goto will use for their goto destination. */
316 if (!factored_computed_goto)
318 basic_block new_bb = create_empty_bb (bb);
319 gimple_stmt_iterator new_gsi = gsi_start_bb (new_bb);
321 /* Create the destination of the factored goto. Each original
322 computed goto will put its desired destination into this
323 variable and jump to the label we create immediately
325 var = create_tmp_var (ptr_type_node, "gotovar");
327 /* Build a label for the new block which will contain the
328 factored computed goto. */
329 factored_label_decl = create_artificial_label (UNKNOWN_LOCATION);
330 factored_computed_goto_label
331 = gimple_build_label (factored_label_decl);
332 gsi_insert_after (&new_gsi, factored_computed_goto_label,
335 /* Build our new computed goto. */
336 factored_computed_goto = gimple_build_goto (var);
337 gsi_insert_after (&new_gsi, factored_computed_goto, GSI_NEW_STMT);
340 /* Copy the original computed goto's destination into VAR. */
341 assignment = gimple_build_assign (var, gimple_goto_dest (last));
342 gsi_insert_before (&gsi, assignment, GSI_SAME_STMT);
344 /* And re-vector the computed goto to the new destination. */
345 gimple_goto_set_dest (last, factored_label_decl);
351 /* Build a flowgraph for the sequence of stmts SEQ. */
354 make_blocks (gimple_seq seq)
356 gimple_stmt_iterator i = gsi_start (seq);
358 bool start_new_block = true;
359 bool first_stmt_of_seq = true;
360 basic_block bb = ENTRY_BLOCK_PTR;
362 while (!gsi_end_p (i))
369 /* If the statement starts a new basic block or if we have determined
370 in a previous pass that we need to create a new block for STMT, do
372 if (start_new_block || stmt_starts_bb_p (stmt, prev_stmt))
374 if (!first_stmt_of_seq)
375 gsi_split_seq_before (&i, &seq);
376 bb = create_basic_block (seq, NULL, bb);
377 start_new_block = false;
380 /* Now add STMT to BB and create the subgraphs for special statement
382 gimple_set_bb (stmt, bb);
384 if (computed_goto_p (stmt))
385 found_computed_goto = true;
387 /* If STMT is a basic block terminator, set START_NEW_BLOCK for the
389 if (stmt_ends_bb_p (stmt))
391 /* If the stmt can make abnormal goto use a new temporary
392 for the assignment to the LHS. This makes sure the old value
393 of the LHS is available on the abnormal edge. Otherwise
394 we will end up with overlapping life-ranges for abnormal
396 if (gimple_has_lhs (stmt)
397 && stmt_can_make_abnormal_goto (stmt)
398 && is_gimple_reg_type (TREE_TYPE (gimple_get_lhs (stmt))))
400 tree lhs = gimple_get_lhs (stmt);
401 tree tmp = create_tmp_var (TREE_TYPE (lhs), NULL);
402 gimple s = gimple_build_assign (lhs, tmp);
403 gimple_set_location (s, gimple_location (stmt));
404 gimple_set_block (s, gimple_block (stmt));
405 gimple_set_lhs (stmt, tmp);
406 if (TREE_CODE (TREE_TYPE (tmp)) == COMPLEX_TYPE
407 || TREE_CODE (TREE_TYPE (tmp)) == VECTOR_TYPE)
408 DECL_GIMPLE_REG_P (tmp) = 1;
409 gsi_insert_after (&i, s, GSI_SAME_STMT);
411 start_new_block = true;
415 first_stmt_of_seq = false;
420 /* Create and return a new empty basic block after bb AFTER. */
423 create_bb (void *h, void *e, basic_block after)
429 /* Create and initialize a new basic block. Since alloc_block uses
430 GC allocation that clears memory to allocate a basic block, we do
431 not have to clear the newly allocated basic block here. */
434 bb->index = last_basic_block;
436 set_bb_seq (bb, h ? (gimple_seq) h : NULL);
438 /* Add the new block to the linked list of blocks. */
439 link_block (bb, after);
441 /* Grow the basic block array if needed. */
442 if ((size_t) last_basic_block == VEC_length (basic_block, basic_block_info))
444 size_t new_size = last_basic_block + (last_basic_block + 3) / 4;
445 VEC_safe_grow_cleared (basic_block, gc, basic_block_info, new_size);
448 /* Add the newly created block to the array. */
449 SET_BASIC_BLOCK (last_basic_block, bb);
458 /*---------------------------------------------------------------------------
460 ---------------------------------------------------------------------------*/
462 /* Fold COND_EXPR_COND of each COND_EXPR. */
465 fold_cond_expr_cond (void)
471 gimple stmt = last_stmt (bb);
473 if (stmt && gimple_code (stmt) == GIMPLE_COND)
475 location_t loc = gimple_location (stmt);
479 fold_defer_overflow_warnings ();
480 cond = fold_binary_loc (loc, gimple_cond_code (stmt), boolean_type_node,
481 gimple_cond_lhs (stmt), gimple_cond_rhs (stmt));
484 zerop = integer_zerop (cond);
485 onep = integer_onep (cond);
488 zerop = onep = false;
490 fold_undefer_overflow_warnings (zerop || onep,
492 WARN_STRICT_OVERFLOW_CONDITIONAL);
494 gimple_cond_make_false (stmt);
496 gimple_cond_make_true (stmt);
501 /* Join all the blocks in the flowgraph. */
507 struct omp_region *cur_region = NULL;
509 /* Create an edge from entry to the first block with executable
511 make_edge (ENTRY_BLOCK_PTR, BASIC_BLOCK (NUM_FIXED_BLOCKS), EDGE_FALLTHRU);
513 /* Traverse the basic block array placing edges. */
516 gimple last = last_stmt (bb);
521 enum gimple_code code = gimple_code (last);
525 make_goto_expr_edges (bb);
529 make_edge (bb, EXIT_BLOCK_PTR, 0);
533 make_cond_expr_edges (bb);
537 make_gimple_switch_edges (bb);
541 make_eh_edges (last);
544 case GIMPLE_EH_DISPATCH:
545 fallthru = make_eh_dispatch_edges (last);
549 /* If this function receives a nonlocal goto, then we need to
550 make edges from this call site to all the nonlocal goto
552 if (stmt_can_make_abnormal_goto (last))
553 make_abnormal_goto_edges (bb, true);
555 /* If this statement has reachable exception handlers, then
556 create abnormal edges to them. */
557 make_eh_edges (last);
559 /* BUILTIN_RETURN is really a return statement. */
560 if (gimple_call_builtin_p (last, BUILT_IN_RETURN))
561 make_edge (bb, EXIT_BLOCK_PTR, 0), fallthru = false;
562 /* Some calls are known not to return. */
564 fallthru = !(gimple_call_flags (last) & ECF_NORETURN);
568 /* A GIMPLE_ASSIGN may throw internally and thus be considered
570 if (is_ctrl_altering_stmt (last))
571 make_eh_edges (last);
576 make_gimple_asm_edges (bb);
580 case GIMPLE_OMP_PARALLEL:
581 case GIMPLE_OMP_TASK:
583 case GIMPLE_OMP_SINGLE:
584 case GIMPLE_OMP_MASTER:
585 case GIMPLE_OMP_ORDERED:
586 case GIMPLE_OMP_CRITICAL:
587 case GIMPLE_OMP_SECTION:
588 cur_region = new_omp_region (bb, code, cur_region);
592 case GIMPLE_OMP_SECTIONS:
593 cur_region = new_omp_region (bb, code, cur_region);
597 case GIMPLE_OMP_SECTIONS_SWITCH:
601 case GIMPLE_OMP_ATOMIC_LOAD:
602 case GIMPLE_OMP_ATOMIC_STORE:
606 case GIMPLE_OMP_RETURN:
607 /* In the case of a GIMPLE_OMP_SECTION, the edge will go
608 somewhere other than the next block. This will be
610 cur_region->exit = bb;
611 fallthru = cur_region->type != GIMPLE_OMP_SECTION;
612 cur_region = cur_region->outer;
615 case GIMPLE_OMP_CONTINUE:
616 cur_region->cont = bb;
617 switch (cur_region->type)
620 /* Mark all GIMPLE_OMP_FOR and GIMPLE_OMP_CONTINUE
621 succs edges as abnormal to prevent splitting
623 single_succ_edge (cur_region->entry)->flags |= EDGE_ABNORMAL;
624 /* Make the loopback edge. */
625 make_edge (bb, single_succ (cur_region->entry),
628 /* Create an edge from GIMPLE_OMP_FOR to exit, which
629 corresponds to the case that the body of the loop
630 is not executed at all. */
631 make_edge (cur_region->entry, bb->next_bb, EDGE_ABNORMAL);
632 make_edge (bb, bb->next_bb, EDGE_FALLTHRU | EDGE_ABNORMAL);
636 case GIMPLE_OMP_SECTIONS:
637 /* Wire up the edges into and out of the nested sections. */
639 basic_block switch_bb = single_succ (cur_region->entry);
641 struct omp_region *i;
642 for (i = cur_region->inner; i ; i = i->next)
644 gcc_assert (i->type == GIMPLE_OMP_SECTION);
645 make_edge (switch_bb, i->entry, 0);
646 make_edge (i->exit, bb, EDGE_FALLTHRU);
649 /* Make the loopback edge to the block with
650 GIMPLE_OMP_SECTIONS_SWITCH. */
651 make_edge (bb, switch_bb, 0);
653 /* Make the edge from the switch to exit. */
654 make_edge (switch_bb, bb->next_bb, 0);
664 case GIMPLE_TRANSACTION:
666 tree abort_label = gimple_transaction_label (last);
668 make_edge (bb, label_to_block (abort_label), 0);
674 gcc_assert (!stmt_ends_bb_p (last));
683 make_edge (bb, bb->next_bb, EDGE_FALLTHRU);
685 assign_discriminator (gimple_location (last), bb->next_bb);
692 /* Fold COND_EXPR_COND of each COND_EXPR. */
693 fold_cond_expr_cond ();
696 /* Trivial hash function for a location_t. ITEM is a pointer to
697 a hash table entry that maps a location_t to a discriminator. */
700 locus_map_hash (const void *item)
702 return ((const struct locus_discrim_map *) item)->locus;
705 /* Equality function for the locus-to-discriminator map. VA and VB
706 point to the two hash table entries to compare. */
709 locus_map_eq (const void *va, const void *vb)
711 const struct locus_discrim_map *a = (const struct locus_discrim_map *) va;
712 const struct locus_discrim_map *b = (const struct locus_discrim_map *) vb;
713 return a->locus == b->locus;
716 /* Find the next available discriminator value for LOCUS. The
717 discriminator distinguishes among several basic blocks that
718 share a common locus, allowing for more accurate sample-based
722 next_discriminator_for_locus (location_t locus)
724 struct locus_discrim_map item;
725 struct locus_discrim_map **slot;
728 item.discriminator = 0;
729 slot = (struct locus_discrim_map **)
730 htab_find_slot_with_hash (discriminator_per_locus, (void *) &item,
731 (hashval_t) locus, INSERT);
733 if (*slot == HTAB_EMPTY_ENTRY)
735 *slot = XNEW (struct locus_discrim_map);
737 (*slot)->locus = locus;
738 (*slot)->discriminator = 0;
740 (*slot)->discriminator++;
741 return (*slot)->discriminator;
744 /* Return TRUE if LOCUS1 and LOCUS2 refer to the same source line. */
747 same_line_p (location_t locus1, location_t locus2)
749 expanded_location from, to;
751 if (locus1 == locus2)
754 from = expand_location (locus1);
755 to = expand_location (locus2);
757 if (from.line != to.line)
759 if (from.file == to.file)
761 return (from.file != NULL
763 && filename_cmp (from.file, to.file) == 0);
766 /* Assign a unique discriminator value to block BB if it begins at the same
767 LOCUS as its predecessor block. */
770 assign_discriminator (location_t locus, basic_block bb)
772 gimple first_in_to_bb, last_in_to_bb;
774 if (locus == 0 || bb->discriminator != 0)
777 first_in_to_bb = first_non_label_stmt (bb);
778 last_in_to_bb = last_stmt (bb);
779 if ((first_in_to_bb && same_line_p (locus, gimple_location (first_in_to_bb)))
780 || (last_in_to_bb && same_line_p (locus, gimple_location (last_in_to_bb))))
781 bb->discriminator = next_discriminator_for_locus (locus);
784 /* Create the edges for a GIMPLE_COND starting at block BB. */
787 make_cond_expr_edges (basic_block bb)
789 gimple entry = last_stmt (bb);
790 gimple then_stmt, else_stmt;
791 basic_block then_bb, else_bb;
792 tree then_label, else_label;
794 location_t entry_locus;
797 gcc_assert (gimple_code (entry) == GIMPLE_COND);
799 entry_locus = gimple_location (entry);
801 /* Entry basic blocks for each component. */
802 then_label = gimple_cond_true_label (entry);
803 else_label = gimple_cond_false_label (entry);
804 then_bb = label_to_block (then_label);
805 else_bb = label_to_block (else_label);
806 then_stmt = first_stmt (then_bb);
807 else_stmt = first_stmt (else_bb);
809 e = make_edge (bb, then_bb, EDGE_TRUE_VALUE);
810 assign_discriminator (entry_locus, then_bb);
811 e->goto_locus = gimple_location (then_stmt);
812 e = make_edge (bb, else_bb, EDGE_FALSE_VALUE);
815 assign_discriminator (entry_locus, else_bb);
816 e->goto_locus = gimple_location (else_stmt);
819 /* We do not need the labels anymore. */
820 gimple_cond_set_true_label (entry, NULL_TREE);
821 gimple_cond_set_false_label (entry, NULL_TREE);
825 /* Called for each element in the hash table (P) as we delete the
826 edge to cases hash table.
828 Clear all the TREE_CHAINs to prevent problems with copying of
829 SWITCH_EXPRs and structure sharing rules, then free the hash table
833 edge_to_cases_cleanup (const void *key ATTRIBUTE_UNUSED, void **value,
834 void *data ATTRIBUTE_UNUSED)
838 for (t = (tree) *value; t; t = next)
840 next = CASE_CHAIN (t);
841 CASE_CHAIN (t) = NULL;
848 /* Start recording information mapping edges to case labels. */
851 start_recording_case_labels (void)
853 gcc_assert (edge_to_cases == NULL);
854 edge_to_cases = pointer_map_create ();
855 touched_switch_bbs = BITMAP_ALLOC (NULL);
858 /* Return nonzero if we are recording information for case labels. */
861 recording_case_labels_p (void)
863 return (edge_to_cases != NULL);
866 /* Stop recording information mapping edges to case labels and
867 remove any information we have recorded. */
869 end_recording_case_labels (void)
873 pointer_map_traverse (edge_to_cases, edge_to_cases_cleanup, NULL);
874 pointer_map_destroy (edge_to_cases);
875 edge_to_cases = NULL;
876 EXECUTE_IF_SET_IN_BITMAP (touched_switch_bbs, 0, i, bi)
878 basic_block bb = BASIC_BLOCK (i);
881 gimple stmt = last_stmt (bb);
882 if (stmt && gimple_code (stmt) == GIMPLE_SWITCH)
883 group_case_labels_stmt (stmt);
886 BITMAP_FREE (touched_switch_bbs);
889 /* If we are inside a {start,end}_recording_cases block, then return
890 a chain of CASE_LABEL_EXPRs from T which reference E.
892 Otherwise return NULL. */
895 get_cases_for_edge (edge e, gimple t)
900 /* If we are not recording cases, then we do not have CASE_LABEL_EXPR
901 chains available. Return NULL so the caller can detect this case. */
902 if (!recording_case_labels_p ())
905 slot = pointer_map_contains (edge_to_cases, e);
909 /* If we did not find E in the hash table, then this must be the first
910 time we have been queried for information about E & T. Add all the
911 elements from T to the hash table then perform the query again. */
913 n = gimple_switch_num_labels (t);
914 for (i = 0; i < n; i++)
916 tree elt = gimple_switch_label (t, i);
917 tree lab = CASE_LABEL (elt);
918 basic_block label_bb = label_to_block (lab);
919 edge this_edge = find_edge (e->src, label_bb);
921 /* Add it to the chain of CASE_LABEL_EXPRs referencing E, or create
923 slot = pointer_map_insert (edge_to_cases, this_edge);
924 CASE_CHAIN (elt) = (tree) *slot;
928 return (tree) *pointer_map_contains (edge_to_cases, e);
931 /* Create the edges for a GIMPLE_SWITCH starting at block BB. */
934 make_gimple_switch_edges (basic_block bb)
936 gimple entry = last_stmt (bb);
937 location_t entry_locus;
940 entry_locus = gimple_location (entry);
942 n = gimple_switch_num_labels (entry);
944 for (i = 0; i < n; ++i)
946 tree lab = CASE_LABEL (gimple_switch_label (entry, i));
947 basic_block label_bb = label_to_block (lab);
948 make_edge (bb, label_bb, 0);
949 assign_discriminator (entry_locus, label_bb);
954 /* Return the basic block holding label DEST. */
957 label_to_block_fn (struct function *ifun, tree dest)
959 int uid = LABEL_DECL_UID (dest);
961 /* We would die hard when faced by an undefined label. Emit a label to
962 the very first basic block. This will hopefully make even the dataflow
963 and undefined variable warnings quite right. */
964 if (seen_error () && uid < 0)
966 gimple_stmt_iterator gsi = gsi_start_bb (BASIC_BLOCK (NUM_FIXED_BLOCKS));
969 stmt = gimple_build_label (dest);
970 gsi_insert_before (&gsi, stmt, GSI_NEW_STMT);
971 uid = LABEL_DECL_UID (dest);
973 if (VEC_length (basic_block, ifun->cfg->x_label_to_block_map)
974 <= (unsigned int) uid)
976 return VEC_index (basic_block, ifun->cfg->x_label_to_block_map, uid);
979 /* Create edges for an abnormal goto statement at block BB. If FOR_CALL
980 is true, the source statement is a CALL_EXPR instead of a GOTO_EXPR. */
983 make_abnormal_goto_edges (basic_block bb, bool for_call)
985 basic_block target_bb;
986 gimple_stmt_iterator gsi;
988 FOR_EACH_BB (target_bb)
989 for (gsi = gsi_start_bb (target_bb); !gsi_end_p (gsi); gsi_next (&gsi))
991 gimple label_stmt = gsi_stmt (gsi);
994 if (gimple_code (label_stmt) != GIMPLE_LABEL)
997 target = gimple_label_label (label_stmt);
999 /* Make an edge to every label block that has been marked as a
1000 potential target for a computed goto or a non-local goto. */
1001 if ((FORCED_LABEL (target) && !for_call)
1002 || (DECL_NONLOCAL (target) && for_call))
1004 make_edge (bb, target_bb, EDGE_ABNORMAL);
1010 /* Create edges for a goto statement at block BB. */
1013 make_goto_expr_edges (basic_block bb)
1015 gimple_stmt_iterator last = gsi_last_bb (bb);
1016 gimple goto_t = gsi_stmt (last);
1018 /* A simple GOTO creates normal edges. */
1019 if (simple_goto_p (goto_t))
1021 tree dest = gimple_goto_dest (goto_t);
1022 basic_block label_bb = label_to_block (dest);
1023 edge e = make_edge (bb, label_bb, EDGE_FALLTHRU);
1024 e->goto_locus = gimple_location (goto_t);
1025 assign_discriminator (e->goto_locus, label_bb);
1026 gsi_remove (&last, true);
1030 /* A computed GOTO creates abnormal edges. */
1031 make_abnormal_goto_edges (bb, false);
1034 /* Create edges for an asm statement with labels at block BB. */
1037 make_gimple_asm_edges (basic_block bb)
1039 gimple stmt = last_stmt (bb);
1040 location_t stmt_loc = gimple_location (stmt);
1041 int i, n = gimple_asm_nlabels (stmt);
1043 for (i = 0; i < n; ++i)
1045 tree label = TREE_VALUE (gimple_asm_label_op (stmt, i));
1046 basic_block label_bb = label_to_block (label);
1047 make_edge (bb, label_bb, 0);
1048 assign_discriminator (stmt_loc, label_bb);
1052 /*---------------------------------------------------------------------------
1054 ---------------------------------------------------------------------------*/
1056 /* Cleanup useless labels in basic blocks. This is something we wish
1057 to do early because it allows us to group case labels before creating
1058 the edges for the CFG, and it speeds up block statement iterators in
1059 all passes later on.
1060 We rerun this pass after CFG is created, to get rid of the labels that
1061 are no longer referenced. After then we do not run it any more, since
1062 (almost) no new labels should be created. */
1064 /* A map from basic block index to the leading label of that block. */
1065 static struct label_record
1070 /* True if the label is referenced from somewhere. */
1074 /* Given LABEL return the first label in the same basic block. */
1077 main_block_label (tree label)
1079 basic_block bb = label_to_block (label);
1080 tree main_label = label_for_bb[bb->index].label;
1082 /* label_to_block possibly inserted undefined label into the chain. */
1085 label_for_bb[bb->index].label = label;
1089 label_for_bb[bb->index].used = true;
1093 /* Clean up redundant labels within the exception tree. */
1096 cleanup_dead_labels_eh (void)
1103 if (cfun->eh == NULL)
1106 for (i = 1; VEC_iterate (eh_landing_pad, cfun->eh->lp_array, i, lp); ++i)
1107 if (lp && lp->post_landing_pad)
1109 lab = main_block_label (lp->post_landing_pad);
1110 if (lab != lp->post_landing_pad)
1112 EH_LANDING_PAD_NR (lp->post_landing_pad) = 0;
1113 EH_LANDING_PAD_NR (lab) = lp->index;
1117 FOR_ALL_EH_REGION (r)
1121 case ERT_MUST_NOT_THROW:
1127 for (c = r->u.eh_try.first_catch; c ; c = c->next_catch)
1131 c->label = main_block_label (lab);
1136 case ERT_ALLOWED_EXCEPTIONS:
1137 lab = r->u.allowed.label;
1139 r->u.allowed.label = main_block_label (lab);
1145 /* Cleanup redundant labels. This is a three-step process:
1146 1) Find the leading label for each block.
1147 2) Redirect all references to labels to the leading labels.
1148 3) Cleanup all useless labels. */
1151 cleanup_dead_labels (void)
1154 label_for_bb = XCNEWVEC (struct label_record, last_basic_block);
1156 /* Find a suitable label for each block. We use the first user-defined
1157 label if there is one, or otherwise just the first label we see. */
1160 gimple_stmt_iterator i;
1162 for (i = gsi_start_bb (bb); !gsi_end_p (i); gsi_next (&i))
1165 gimple stmt = gsi_stmt (i);
1167 if (gimple_code (stmt) != GIMPLE_LABEL)
1170 label = gimple_label_label (stmt);
1172 /* If we have not yet seen a label for the current block,
1173 remember this one and see if there are more labels. */
1174 if (!label_for_bb[bb->index].label)
1176 label_for_bb[bb->index].label = label;
1180 /* If we did see a label for the current block already, but it
1181 is an artificially created label, replace it if the current
1182 label is a user defined label. */
1183 if (!DECL_ARTIFICIAL (label)
1184 && DECL_ARTIFICIAL (label_for_bb[bb->index].label))
1186 label_for_bb[bb->index].label = label;
1192 /* Now redirect all jumps/branches to the selected label.
1193 First do so for each block ending in a control statement. */
1196 gimple stmt = last_stmt (bb);
1197 tree label, new_label;
1202 switch (gimple_code (stmt))
1205 label = gimple_cond_true_label (stmt);
1208 new_label = main_block_label (label);
1209 if (new_label != label)
1210 gimple_cond_set_true_label (stmt, new_label);
1213 label = gimple_cond_false_label (stmt);
1216 new_label = main_block_label (label);
1217 if (new_label != label)
1218 gimple_cond_set_false_label (stmt, new_label);
1224 size_t i, n = gimple_switch_num_labels (stmt);
1226 /* Replace all destination labels. */
1227 for (i = 0; i < n; ++i)
1229 tree case_label = gimple_switch_label (stmt, i);
1230 label = CASE_LABEL (case_label);
1231 new_label = main_block_label (label);
1232 if (new_label != label)
1233 CASE_LABEL (case_label) = new_label;
1240 int i, n = gimple_asm_nlabels (stmt);
1242 for (i = 0; i < n; ++i)
1244 tree cons = gimple_asm_label_op (stmt, i);
1245 tree label = main_block_label (TREE_VALUE (cons));
1246 TREE_VALUE (cons) = label;
1251 /* We have to handle gotos until they're removed, and we don't
1252 remove them until after we've created the CFG edges. */
1254 if (!computed_goto_p (stmt))
1256 label = gimple_goto_dest (stmt);
1257 new_label = main_block_label (label);
1258 if (new_label != label)
1259 gimple_goto_set_dest (stmt, new_label);
1263 case GIMPLE_TRANSACTION:
1265 tree label = gimple_transaction_label (stmt);
1268 tree new_label = main_block_label (label);
1269 if (new_label != label)
1270 gimple_transaction_set_label (stmt, new_label);
1280 /* Do the same for the exception region tree labels. */
1281 cleanup_dead_labels_eh ();
1283 /* Finally, purge dead labels. All user-defined labels and labels that
1284 can be the target of non-local gotos and labels which have their
1285 address taken are preserved. */
1288 gimple_stmt_iterator i;
1289 tree label_for_this_bb = label_for_bb[bb->index].label;
1291 if (!label_for_this_bb)
1294 /* If the main label of the block is unused, we may still remove it. */
1295 if (!label_for_bb[bb->index].used)
1296 label_for_this_bb = NULL;
1298 for (i = gsi_start_bb (bb); !gsi_end_p (i); )
1301 gimple stmt = gsi_stmt (i);
1303 if (gimple_code (stmt) != GIMPLE_LABEL)
1306 label = gimple_label_label (stmt);
1308 if (label == label_for_this_bb
1309 || !DECL_ARTIFICIAL (label)
1310 || DECL_NONLOCAL (label)
1311 || FORCED_LABEL (label))
1314 gsi_remove (&i, true);
1318 free (label_for_bb);
1321 /* Scan the sorted vector of cases in STMT (a GIMPLE_SWITCH) and combine
1322 the ones jumping to the same label.
1323 Eg. three separate entries 1: 2: 3: become one entry 1..3: */
1326 group_case_labels_stmt (gimple stmt)
1328 int old_size = gimple_switch_num_labels (stmt);
1329 int i, j, new_size = old_size;
1330 basic_block default_bb = NULL;
1332 default_bb = label_to_block (CASE_LABEL (gimple_switch_default_label (stmt)));
1334 /* Look for possible opportunities to merge cases. */
1336 while (i < old_size)
1338 tree base_case, base_high;
1339 basic_block base_bb;
1341 base_case = gimple_switch_label (stmt, i);
1343 gcc_assert (base_case);
1344 base_bb = label_to_block (CASE_LABEL (base_case));
1346 /* Discard cases that have the same destination as the
1348 if (base_bb == default_bb)
1350 gimple_switch_set_label (stmt, i, NULL_TREE);
1356 base_high = CASE_HIGH (base_case)
1357 ? CASE_HIGH (base_case)
1358 : CASE_LOW (base_case);
1361 /* Try to merge case labels. Break out when we reach the end
1362 of the label vector or when we cannot merge the next case
1363 label with the current one. */
1364 while (i < old_size)
1366 tree merge_case = gimple_switch_label (stmt, i);
1367 basic_block merge_bb = label_to_block (CASE_LABEL (merge_case));
1368 double_int bhp1 = tree_to_double_int (base_high) + double_int_one;
1370 /* Merge the cases if they jump to the same place,
1371 and their ranges are consecutive. */
1372 if (merge_bb == base_bb
1373 && tree_to_double_int (CASE_LOW (merge_case)) == bhp1)
1375 base_high = CASE_HIGH (merge_case) ?
1376 CASE_HIGH (merge_case) : CASE_LOW (merge_case);
1377 CASE_HIGH (base_case) = base_high;
1378 gimple_switch_set_label (stmt, i, NULL_TREE);
1387 /* Compress the case labels in the label vector, and adjust the
1388 length of the vector. */
1389 for (i = 0, j = 0; i < new_size; i++)
1391 while (! gimple_switch_label (stmt, j))
1393 gimple_switch_set_label (stmt, i,
1394 gimple_switch_label (stmt, j++));
1397 gcc_assert (new_size <= old_size);
1398 gimple_switch_set_num_labels (stmt, new_size);
1401 /* Look for blocks ending in a multiway branch (a GIMPLE_SWITCH),
1402 and scan the sorted vector of cases. Combine the ones jumping to the
1406 group_case_labels (void)
1412 gimple stmt = last_stmt (bb);
1413 if (stmt && gimple_code (stmt) == GIMPLE_SWITCH)
1414 group_case_labels_stmt (stmt);
1418 /* Checks whether we can merge block B into block A. */
1421 gimple_can_merge_blocks_p (basic_block a, basic_block b)
1424 gimple_stmt_iterator gsi;
1426 if (!single_succ_p (a))
1429 if (single_succ_edge (a)->flags & EDGE_COMPLEX)
1432 if (single_succ (a) != b)
1435 if (!single_pred_p (b))
1438 if (b == EXIT_BLOCK_PTR)
1441 /* If A ends by a statement causing exceptions or something similar, we
1442 cannot merge the blocks. */
1443 stmt = last_stmt (a);
1444 if (stmt && stmt_ends_bb_p (stmt))
1447 /* Do not allow a block with only a non-local label to be merged. */
1449 && gimple_code (stmt) == GIMPLE_LABEL
1450 && DECL_NONLOCAL (gimple_label_label (stmt)))
1453 /* Examine the labels at the beginning of B. */
1454 for (gsi = gsi_start_bb (b); !gsi_end_p (gsi); gsi_next (&gsi))
1457 stmt = gsi_stmt (gsi);
1458 if (gimple_code (stmt) != GIMPLE_LABEL)
1460 lab = gimple_label_label (stmt);
1462 /* Do not remove user forced labels or for -O0 any user labels. */
1463 if (!DECL_ARTIFICIAL (lab) && (!optimize || FORCED_LABEL (lab)))
1467 /* Protect the loop latches. */
1468 if (current_loops && b->loop_father->latch == b)
1471 /* It must be possible to eliminate all phi nodes in B. If ssa form
1472 is not up-to-date and a name-mapping is registered, we cannot eliminate
1473 any phis. Symbols marked for renaming are never a problem though. */
1474 for (gsi = gsi_start_phis (b); !gsi_end_p (gsi); gsi_next (&gsi))
1476 gimple phi = gsi_stmt (gsi);
1477 /* Technically only new names matter. */
1478 if (name_registered_for_update_p (PHI_RESULT (phi)))
1482 /* When not optimizing, don't merge if we'd lose goto_locus. */
1484 && single_succ_edge (a)->goto_locus != UNKNOWN_LOCATION)
1486 location_t goto_locus = single_succ_edge (a)->goto_locus;
1487 gimple_stmt_iterator prev, next;
1488 prev = gsi_last_nondebug_bb (a);
1489 next = gsi_after_labels (b);
1490 if (!gsi_end_p (next) && is_gimple_debug (gsi_stmt (next)))
1491 gsi_next_nondebug (&next);
1492 if ((gsi_end_p (prev)
1493 || gimple_location (gsi_stmt (prev)) != goto_locus)
1494 && (gsi_end_p (next)
1495 || gimple_location (gsi_stmt (next)) != goto_locus))
1502 /* Return true if the var whose chain of uses starts at PTR has no
1505 has_zero_uses_1 (const ssa_use_operand_t *head)
1507 const ssa_use_operand_t *ptr;
1509 for (ptr = head->next; ptr != head; ptr = ptr->next)
1510 if (!is_gimple_debug (USE_STMT (ptr)))
1516 /* Return true if the var whose chain of uses starts at PTR has a
1517 single nondebug use. Set USE_P and STMT to that single nondebug
1518 use, if so, or to NULL otherwise. */
1520 single_imm_use_1 (const ssa_use_operand_t *head,
1521 use_operand_p *use_p, gimple *stmt)
1523 ssa_use_operand_t *ptr, *single_use = 0;
1525 for (ptr = head->next; ptr != head; ptr = ptr->next)
1526 if (!is_gimple_debug (USE_STMT (ptr)))
1537 *use_p = single_use;
1540 *stmt = single_use ? single_use->loc.stmt : NULL;
1542 return !!single_use;
1545 /* Replaces all uses of NAME by VAL. */
1548 replace_uses_by (tree name, tree val)
1550 imm_use_iterator imm_iter;
1555 FOR_EACH_IMM_USE_STMT (stmt, imm_iter, name)
1557 FOR_EACH_IMM_USE_ON_STMT (use, imm_iter)
1559 replace_exp (use, val);
1561 if (gimple_code (stmt) == GIMPLE_PHI)
1563 e = gimple_phi_arg_edge (stmt, PHI_ARG_INDEX_FROM_USE (use));
1564 if (e->flags & EDGE_ABNORMAL)
1566 /* This can only occur for virtual operands, since
1567 for the real ones SSA_NAME_OCCURS_IN_ABNORMAL_PHI (name))
1568 would prevent replacement. */
1569 gcc_checking_assert (virtual_operand_p (name));
1570 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (val) = 1;
1575 if (gimple_code (stmt) != GIMPLE_PHI)
1577 gimple_stmt_iterator gsi = gsi_for_stmt (stmt);
1578 gimple orig_stmt = stmt;
1581 /* Mark the block if we changed the last stmt in it. */
1582 if (cfgcleanup_altered_bbs
1583 && stmt_ends_bb_p (stmt))
1584 bitmap_set_bit (cfgcleanup_altered_bbs, gimple_bb (stmt)->index);
1586 /* FIXME. It shouldn't be required to keep TREE_CONSTANT
1587 on ADDR_EXPRs up-to-date on GIMPLE. Propagation will
1588 only change sth from non-invariant to invariant, and only
1589 when propagating constants. */
1590 if (is_gimple_min_invariant (val))
1591 for (i = 0; i < gimple_num_ops (stmt); i++)
1593 tree op = gimple_op (stmt, i);
1594 /* Operands may be empty here. For example, the labels
1595 of a GIMPLE_COND are nulled out following the creation
1596 of the corresponding CFG edges. */
1597 if (op && TREE_CODE (op) == ADDR_EXPR)
1598 recompute_tree_invariant_for_addr_expr (op);
1601 if (fold_stmt (&gsi))
1602 stmt = gsi_stmt (gsi);
1604 if (maybe_clean_or_replace_eh_stmt (orig_stmt, stmt))
1605 gimple_purge_dead_eh_edges (gimple_bb (stmt));
1611 gcc_checking_assert (has_zero_uses (name));
1613 /* Also update the trees stored in loop structures. */
1619 FOR_EACH_LOOP (li, loop, 0)
1621 substitute_in_loop_info (loop, name, val);
1626 /* Merge block B into block A. */
1629 gimple_merge_blocks (basic_block a, basic_block b)
1631 gimple_stmt_iterator last, gsi, psi;
1634 fprintf (dump_file, "Merging blocks %d and %d\n", a->index, b->index);
1636 /* Remove all single-valued PHI nodes from block B of the form
1637 V_i = PHI <V_j> by propagating V_j to all the uses of V_i. */
1638 gsi = gsi_last_bb (a);
1639 for (psi = gsi_start_phis (b); !gsi_end_p (psi); )
1641 gimple phi = gsi_stmt (psi);
1642 tree def = gimple_phi_result (phi), use = gimple_phi_arg_def (phi, 0);
1644 bool may_replace_uses = (virtual_operand_p (def)
1645 || may_propagate_copy (def, use));
1647 /* In case we maintain loop closed ssa form, do not propagate arguments
1648 of loop exit phi nodes. */
1650 && loops_state_satisfies_p (LOOP_CLOSED_SSA)
1651 && !virtual_operand_p (def)
1652 && TREE_CODE (use) == SSA_NAME
1653 && a->loop_father != b->loop_father)
1654 may_replace_uses = false;
1656 if (!may_replace_uses)
1658 gcc_assert (!virtual_operand_p (def));
1660 /* Note that just emitting the copies is fine -- there is no problem
1661 with ordering of phi nodes. This is because A is the single
1662 predecessor of B, therefore results of the phi nodes cannot
1663 appear as arguments of the phi nodes. */
1664 copy = gimple_build_assign (def, use);
1665 gsi_insert_after (&gsi, copy, GSI_NEW_STMT);
1666 remove_phi_node (&psi, false);
1670 /* If we deal with a PHI for virtual operands, we can simply
1671 propagate these without fussing with folding or updating
1673 if (virtual_operand_p (def))
1675 imm_use_iterator iter;
1676 use_operand_p use_p;
1679 FOR_EACH_IMM_USE_STMT (stmt, iter, def)
1680 FOR_EACH_IMM_USE_ON_STMT (use_p, iter)
1681 SET_USE (use_p, use);
1683 if (SSA_NAME_OCCURS_IN_ABNORMAL_PHI (def))
1684 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (use) = 1;
1687 replace_uses_by (def, use);
1689 remove_phi_node (&psi, true);
1693 /* Ensure that B follows A. */
1694 move_block_after (b, a);
1696 gcc_assert (single_succ_edge (a)->flags & EDGE_FALLTHRU);
1697 gcc_assert (!last_stmt (a) || !stmt_ends_bb_p (last_stmt (a)));
1699 /* Remove labels from B and set gimple_bb to A for other statements. */
1700 for (gsi = gsi_start_bb (b); !gsi_end_p (gsi);)
1702 gimple stmt = gsi_stmt (gsi);
1703 if (gimple_code (stmt) == GIMPLE_LABEL)
1705 tree label = gimple_label_label (stmt);
1708 gsi_remove (&gsi, false);
1710 /* Now that we can thread computed gotos, we might have
1711 a situation where we have a forced label in block B
1712 However, the label at the start of block B might still be
1713 used in other ways (think about the runtime checking for
1714 Fortran assigned gotos). So we can not just delete the
1715 label. Instead we move the label to the start of block A. */
1716 if (FORCED_LABEL (label))
1718 gimple_stmt_iterator dest_gsi = gsi_start_bb (a);
1719 gsi_insert_before (&dest_gsi, stmt, GSI_NEW_STMT);
1721 /* Other user labels keep around in a form of a debug stmt. */
1722 else if (!DECL_ARTIFICIAL (label) && MAY_HAVE_DEBUG_STMTS)
1724 gimple dbg = gimple_build_debug_bind (label,
1727 gimple_debug_bind_reset_value (dbg);
1728 gsi_insert_before (&gsi, dbg, GSI_SAME_STMT);
1731 lp_nr = EH_LANDING_PAD_NR (label);
1734 eh_landing_pad lp = get_eh_landing_pad_from_number (lp_nr);
1735 lp->post_landing_pad = NULL;
1740 gimple_set_bb (stmt, a);
1745 /* Merge the sequences. */
1746 last = gsi_last_bb (a);
1747 gsi_insert_seq_after (&last, bb_seq (b), GSI_NEW_STMT);
1748 set_bb_seq (b, NULL);
1750 if (cfgcleanup_altered_bbs)
1751 bitmap_set_bit (cfgcleanup_altered_bbs, a->index);
1755 /* Return the one of two successors of BB that is not reachable by a
1756 complex edge, if there is one. Else, return BB. We use
1757 this in optimizations that use post-dominators for their heuristics,
1758 to catch the cases in C++ where function calls are involved. */
1761 single_noncomplex_succ (basic_block bb)
1764 if (EDGE_COUNT (bb->succs) != 2)
1767 e0 = EDGE_SUCC (bb, 0);
1768 e1 = EDGE_SUCC (bb, 1);
1769 if (e0->flags & EDGE_COMPLEX)
1771 if (e1->flags & EDGE_COMPLEX)
1777 /* T is CALL_EXPR. Set current_function_calls_* flags. */
1780 notice_special_calls (gimple call)
1782 int flags = gimple_call_flags (call);
1784 if (flags & ECF_MAY_BE_ALLOCA)
1785 cfun->calls_alloca = true;
1786 if (flags & ECF_RETURNS_TWICE)
1787 cfun->calls_setjmp = true;
1791 /* Clear flags set by notice_special_calls. Used by dead code removal
1792 to update the flags. */
1795 clear_special_calls (void)
1797 cfun->calls_alloca = false;
1798 cfun->calls_setjmp = false;
1801 /* Remove PHI nodes associated with basic block BB and all edges out of BB. */
1804 remove_phi_nodes_and_edges_for_unreachable_block (basic_block bb)
1806 /* Since this block is no longer reachable, we can just delete all
1807 of its PHI nodes. */
1808 remove_phi_nodes (bb);
1810 /* Remove edges to BB's successors. */
1811 while (EDGE_COUNT (bb->succs) > 0)
1812 remove_edge (EDGE_SUCC (bb, 0));
1816 /* Remove statements of basic block BB. */
1819 remove_bb (basic_block bb)
1821 gimple_stmt_iterator i;
1825 fprintf (dump_file, "Removing basic block %d\n", bb->index);
1826 if (dump_flags & TDF_DETAILS)
1828 dump_bb (dump_file, bb, 0, dump_flags);
1829 fprintf (dump_file, "\n");
1835 struct loop *loop = bb->loop_father;
1837 /* If a loop gets removed, clean up the information associated
1839 if (loop->latch == bb
1840 || loop->header == bb)
1841 free_numbers_of_iterations_estimates_loop (loop);
1844 /* Remove all the instructions in the block. */
1845 if (bb_seq (bb) != NULL)
1847 /* Walk backwards so as to get a chance to substitute all
1848 released DEFs into debug stmts. See
1849 eliminate_unnecessary_stmts() in tree-ssa-dce.c for more
1851 for (i = gsi_last_bb (bb); !gsi_end_p (i);)
1853 gimple stmt = gsi_stmt (i);
1854 if (gimple_code (stmt) == GIMPLE_LABEL
1855 && (FORCED_LABEL (gimple_label_label (stmt))
1856 || DECL_NONLOCAL (gimple_label_label (stmt))))
1859 gimple_stmt_iterator new_gsi;
1861 /* A non-reachable non-local label may still be referenced.
1862 But it no longer needs to carry the extra semantics of
1864 if (DECL_NONLOCAL (gimple_label_label (stmt)))
1866 DECL_NONLOCAL (gimple_label_label (stmt)) = 0;
1867 FORCED_LABEL (gimple_label_label (stmt)) = 1;
1870 new_bb = bb->prev_bb;
1871 new_gsi = gsi_start_bb (new_bb);
1872 gsi_remove (&i, false);
1873 gsi_insert_before (&new_gsi, stmt, GSI_NEW_STMT);
1877 /* Release SSA definitions if we are in SSA. Note that we
1878 may be called when not in SSA. For example,
1879 final_cleanup calls this function via
1880 cleanup_tree_cfg. */
1881 if (gimple_in_ssa_p (cfun))
1882 release_defs (stmt);
1884 gsi_remove (&i, true);
1888 i = gsi_last_bb (bb);
1894 remove_phi_nodes_and_edges_for_unreachable_block (bb);
1895 bb->il.gimple.seq = NULL;
1896 bb->il.gimple.phi_nodes = NULL;
1900 /* Given a basic block BB ending with COND_EXPR or SWITCH_EXPR, and a
1901 predicate VAL, return the edge that will be taken out of the block.
1902 If VAL does not match a unique edge, NULL is returned. */
1905 find_taken_edge (basic_block bb, tree val)
1909 stmt = last_stmt (bb);
1912 gcc_assert (is_ctrl_stmt (stmt));
1917 if (!is_gimple_min_invariant (val))
1920 if (gimple_code (stmt) == GIMPLE_COND)
1921 return find_taken_edge_cond_expr (bb, val);
1923 if (gimple_code (stmt) == GIMPLE_SWITCH)
1924 return find_taken_edge_switch_expr (bb, val);
1926 if (computed_goto_p (stmt))
1928 /* Only optimize if the argument is a label, if the argument is
1929 not a label then we can not construct a proper CFG.
1931 It may be the case that we only need to allow the LABEL_REF to
1932 appear inside an ADDR_EXPR, but we also allow the LABEL_REF to
1933 appear inside a LABEL_EXPR just to be safe. */
1934 if ((TREE_CODE (val) == ADDR_EXPR || TREE_CODE (val) == LABEL_EXPR)
1935 && TREE_CODE (TREE_OPERAND (val, 0)) == LABEL_DECL)
1936 return find_taken_edge_computed_goto (bb, TREE_OPERAND (val, 0));
1943 /* Given a constant value VAL and the entry block BB to a GOTO_EXPR
1944 statement, determine which of the outgoing edges will be taken out of the
1945 block. Return NULL if either edge may be taken. */
1948 find_taken_edge_computed_goto (basic_block bb, tree val)
1953 dest = label_to_block (val);
1956 e = find_edge (bb, dest);
1957 gcc_assert (e != NULL);
1963 /* Given a constant value VAL and the entry block BB to a COND_EXPR
1964 statement, determine which of the two edges will be taken out of the
1965 block. Return NULL if either edge may be taken. */
1968 find_taken_edge_cond_expr (basic_block bb, tree val)
1970 edge true_edge, false_edge;
1972 extract_true_false_edges_from_block (bb, &true_edge, &false_edge);
1974 gcc_assert (TREE_CODE (val) == INTEGER_CST);
1975 return (integer_zerop (val) ? false_edge : true_edge);
1978 /* Given an INTEGER_CST VAL and the entry block BB to a SWITCH_EXPR
1979 statement, determine which edge will be taken out of the block. Return
1980 NULL if any edge may be taken. */
1983 find_taken_edge_switch_expr (basic_block bb, tree val)
1985 basic_block dest_bb;
1990 switch_stmt = last_stmt (bb);
1991 taken_case = find_case_label_for_value (switch_stmt, val);
1992 dest_bb = label_to_block (CASE_LABEL (taken_case));
1994 e = find_edge (bb, dest_bb);
2000 /* Return the CASE_LABEL_EXPR that SWITCH_STMT will take for VAL.
2001 We can make optimal use here of the fact that the case labels are
2002 sorted: We can do a binary search for a case matching VAL. */
2005 find_case_label_for_value (gimple switch_stmt, tree val)
2007 size_t low, high, n = gimple_switch_num_labels (switch_stmt);
2008 tree default_case = gimple_switch_default_label (switch_stmt);
2010 for (low = 0, high = n; high - low > 1; )
2012 size_t i = (high + low) / 2;
2013 tree t = gimple_switch_label (switch_stmt, i);
2016 /* Cache the result of comparing CASE_LOW and val. */
2017 cmp = tree_int_cst_compare (CASE_LOW (t), val);
2024 if (CASE_HIGH (t) == NULL)
2026 /* A singe-valued case label. */
2032 /* A case range. We can only handle integer ranges. */
2033 if (cmp <= 0 && tree_int_cst_compare (CASE_HIGH (t), val) >= 0)
2038 return default_case;
2042 /* Dump a basic block on stderr. */
2045 gimple_debug_bb (basic_block bb)
2047 dump_bb (stderr, bb, 0, TDF_VOPS|TDF_MEMSYMS|TDF_BLOCKS);
2051 /* Dump basic block with index N on stderr. */
2054 gimple_debug_bb_n (int n)
2056 gimple_debug_bb (BASIC_BLOCK (n));
2057 return BASIC_BLOCK (n);
2061 /* Dump the CFG on stderr.
2063 FLAGS are the same used by the tree dumping functions
2064 (see TDF_* in tree-pass.h). */
2067 gimple_debug_cfg (int flags)
2069 gimple_dump_cfg (stderr, flags);
2073 /* Dump the program showing basic block boundaries on the given FILE.
2075 FLAGS are the same used by the tree dumping functions (see TDF_* in
2079 gimple_dump_cfg (FILE *file, int flags)
2081 if (flags & TDF_DETAILS)
2083 dump_function_header (file, current_function_decl, flags);
2084 fprintf (file, ";; \n%d basic blocks, %d edges, last basic block %d.\n\n",
2085 n_basic_blocks, n_edges, last_basic_block);
2087 brief_dump_cfg (file, flags | TDF_COMMENT);
2088 fprintf (file, "\n");
2091 if (flags & TDF_STATS)
2092 dump_cfg_stats (file);
2094 dump_function_to_file (current_function_decl, file, flags | TDF_BLOCKS);
2098 /* Dump CFG statistics on FILE. */
2101 dump_cfg_stats (FILE *file)
2103 static long max_num_merged_labels = 0;
2104 unsigned long size, total = 0;
2107 const char * const fmt_str = "%-30s%-13s%12s\n";
2108 const char * const fmt_str_1 = "%-30s%13d%11lu%c\n";
2109 const char * const fmt_str_2 = "%-30s%13ld%11lu%c\n";
2110 const char * const fmt_str_3 = "%-43s%11lu%c\n";
2111 const char *funcname = current_function_name ();
2113 fprintf (file, "\nCFG Statistics for %s\n\n", funcname);
2115 fprintf (file, "---------------------------------------------------------\n");
2116 fprintf (file, fmt_str, "", " Number of ", "Memory");
2117 fprintf (file, fmt_str, "", " instances ", "used ");
2118 fprintf (file, "---------------------------------------------------------\n");
2120 size = n_basic_blocks * sizeof (struct basic_block_def);
2122 fprintf (file, fmt_str_1, "Basic blocks", n_basic_blocks,
2123 SCALE (size), LABEL (size));
2127 num_edges += EDGE_COUNT (bb->succs);
2128 size = num_edges * sizeof (struct edge_def);
2130 fprintf (file, fmt_str_2, "Edges", num_edges, SCALE (size), LABEL (size));
2132 fprintf (file, "---------------------------------------------------------\n");
2133 fprintf (file, fmt_str_3, "Total memory used by CFG data", SCALE (total),
2135 fprintf (file, "---------------------------------------------------------\n");
2136 fprintf (file, "\n");
2138 if (cfg_stats.num_merged_labels > max_num_merged_labels)
2139 max_num_merged_labels = cfg_stats.num_merged_labels;
2141 fprintf (file, "Coalesced label blocks: %ld (Max so far: %ld)\n",
2142 cfg_stats.num_merged_labels, max_num_merged_labels);
2144 fprintf (file, "\n");
2148 /* Dump CFG statistics on stderr. Keep extern so that it's always
2149 linked in the final executable. */
2152 debug_cfg_stats (void)
2154 dump_cfg_stats (stderr);
2158 /* Dump the flowgraph to a .vcg FILE. */
2161 gimple_cfg2vcg (FILE *file)
2166 const char *funcname = current_function_name ();
2168 /* Write the file header. */
2169 fprintf (file, "graph: { title: \"%s\"\n", funcname);
2170 fprintf (file, "node: { title: \"ENTRY\" label: \"ENTRY\" }\n");
2171 fprintf (file, "node: { title: \"EXIT\" label: \"EXIT\" }\n");
2173 /* Write blocks and edges. */
2174 FOR_EACH_EDGE (e, ei, ENTRY_BLOCK_PTR->succs)
2176 fprintf (file, "edge: { sourcename: \"ENTRY\" targetname: \"%d\"",
2179 if (e->flags & EDGE_FAKE)
2180 fprintf (file, " linestyle: dotted priority: 10");
2182 fprintf (file, " linestyle: solid priority: 100");
2184 fprintf (file, " }\n");
2190 enum gimple_code head_code, end_code;
2191 const char *head_name, *end_name;
2194 gimple first = first_stmt (bb);
2195 gimple last = last_stmt (bb);
2199 head_code = gimple_code (first);
2200 head_name = gimple_code_name[head_code];
2201 head_line = get_lineno (first);
2204 head_name = "no-statement";
2208 end_code = gimple_code (last);
2209 end_name = gimple_code_name[end_code];
2210 end_line = get_lineno (last);
2213 end_name = "no-statement";
2215 fprintf (file, "node: { title: \"%d\" label: \"#%d\\n%s (%d)\\n%s (%d)\"}\n",
2216 bb->index, bb->index, head_name, head_line, end_name,
2219 FOR_EACH_EDGE (e, ei, bb->succs)
2221 if (e->dest == EXIT_BLOCK_PTR)
2222 fprintf (file, "edge: { sourcename: \"%d\" targetname: \"EXIT\"", bb->index);
2224 fprintf (file, "edge: { sourcename: \"%d\" targetname: \"%d\"", bb->index, e->dest->index);
2226 if (e->flags & EDGE_FAKE)
2227 fprintf (file, " priority: 10 linestyle: dotted");
2229 fprintf (file, " priority: 100 linestyle: solid");
2231 fprintf (file, " }\n");
2234 if (bb->next_bb != EXIT_BLOCK_PTR)
2238 fputs ("}\n\n", file);
2243 /*---------------------------------------------------------------------------
2244 Miscellaneous helpers
2245 ---------------------------------------------------------------------------*/
2247 /* Return true if T, a GIMPLE_CALL, can make an abnormal transfer of control
2248 flow. Transfers of control flow associated with EH are excluded. */
2251 call_can_make_abnormal_goto (gimple t)
2253 /* If the function has no non-local labels, then a call cannot make an
2254 abnormal transfer of control. */
2255 if (!cfun->has_nonlocal_label)
2258 /* Likewise if the call has no side effects. */
2259 if (!gimple_has_side_effects (t))
2262 /* Likewise if the called function is leaf. */
2263 if (gimple_call_flags (t) & ECF_LEAF)
2270 /* Return true if T can make an abnormal transfer of control flow.
2271 Transfers of control flow associated with EH are excluded. */
2274 stmt_can_make_abnormal_goto (gimple t)
2276 if (computed_goto_p (t))
2278 if (is_gimple_call (t))
2279 return call_can_make_abnormal_goto (t);
2284 /* Return true if T represents a stmt that always transfers control. */
2287 is_ctrl_stmt (gimple t)
2289 switch (gimple_code (t))
2303 /* Return true if T is a statement that may alter the flow of control
2304 (e.g., a call to a non-returning function). */
2307 is_ctrl_altering_stmt (gimple t)
2311 switch (gimple_code (t))
2315 int flags = gimple_call_flags (t);
2317 /* A call alters control flow if it can make an abnormal goto. */
2318 if (call_can_make_abnormal_goto (t))
2321 /* A call also alters control flow if it does not return. */
2322 if (flags & ECF_NORETURN)
2325 /* TM ending statements have backedges out of the transaction.
2326 Return true so we split the basic block containing them.
2327 Note that the TM_BUILTIN test is merely an optimization. */
2328 if ((flags & ECF_TM_BUILTIN)
2329 && is_tm_ending_fndecl (gimple_call_fndecl (t)))
2332 /* BUILT_IN_RETURN call is same as return statement. */
2333 if (gimple_call_builtin_p (t, BUILT_IN_RETURN))
2338 case GIMPLE_EH_DISPATCH:
2339 /* EH_DISPATCH branches to the individual catch handlers at
2340 this level of a try or allowed-exceptions region. It can
2341 fallthru to the next statement as well. */
2345 if (gimple_asm_nlabels (t) > 0)
2350 /* OpenMP directives alter control flow. */
2353 case GIMPLE_TRANSACTION:
2354 /* A transaction start alters control flow. */
2361 /* If a statement can throw, it alters control flow. */
2362 return stmt_can_throw_internal (t);
2366 /* Return true if T is a simple local goto. */
2369 simple_goto_p (gimple t)
2371 return (gimple_code (t) == GIMPLE_GOTO
2372 && TREE_CODE (gimple_goto_dest (t)) == LABEL_DECL);
2376 /* Return true if STMT should start a new basic block. PREV_STMT is
2377 the statement preceding STMT. It is used when STMT is a label or a
2378 case label. Labels should only start a new basic block if their
2379 previous statement wasn't a label. Otherwise, sequence of labels
2380 would generate unnecessary basic blocks that only contain a single
2384 stmt_starts_bb_p (gimple stmt, gimple prev_stmt)
2389 /* Labels start a new basic block only if the preceding statement
2390 wasn't a label of the same type. This prevents the creation of
2391 consecutive blocks that have nothing but a single label. */
2392 if (gimple_code (stmt) == GIMPLE_LABEL)
2394 /* Nonlocal and computed GOTO targets always start a new block. */
2395 if (DECL_NONLOCAL (gimple_label_label (stmt))
2396 || FORCED_LABEL (gimple_label_label (stmt)))
2399 if (prev_stmt && gimple_code (prev_stmt) == GIMPLE_LABEL)
2401 if (DECL_NONLOCAL (gimple_label_label (prev_stmt)))
2404 cfg_stats.num_merged_labels++;
2415 /* Return true if T should end a basic block. */
2418 stmt_ends_bb_p (gimple t)
2420 return is_ctrl_stmt (t) || is_ctrl_altering_stmt (t);
2423 /* Remove block annotations and other data structures. */
2426 delete_tree_cfg_annotations (void)
2428 label_to_block_map = NULL;
2432 /* Return the first statement in basic block BB. */
2435 first_stmt (basic_block bb)
2437 gimple_stmt_iterator i = gsi_start_bb (bb);
2440 while (!gsi_end_p (i) && is_gimple_debug ((stmt = gsi_stmt (i))))
2448 /* Return the first non-label statement in basic block BB. */
2451 first_non_label_stmt (basic_block bb)
2453 gimple_stmt_iterator i = gsi_start_bb (bb);
2454 while (!gsi_end_p (i) && gimple_code (gsi_stmt (i)) == GIMPLE_LABEL)
2456 return !gsi_end_p (i) ? gsi_stmt (i) : NULL;
2459 /* Return the last statement in basic block BB. */
2462 last_stmt (basic_block bb)
2464 gimple_stmt_iterator i = gsi_last_bb (bb);
2467 while (!gsi_end_p (i) && is_gimple_debug ((stmt = gsi_stmt (i))))
2475 /* Return the last statement of an otherwise empty block. Return NULL
2476 if the block is totally empty, or if it contains more than one
2480 last_and_only_stmt (basic_block bb)
2482 gimple_stmt_iterator i = gsi_last_nondebug_bb (bb);
2488 last = gsi_stmt (i);
2489 gsi_prev_nondebug (&i);
2493 /* Empty statements should no longer appear in the instruction stream.
2494 Everything that might have appeared before should be deleted by
2495 remove_useless_stmts, and the optimizers should just gsi_remove
2496 instead of smashing with build_empty_stmt.
2498 Thus the only thing that should appear here in a block containing
2499 one executable statement is a label. */
2500 prev = gsi_stmt (i);
2501 if (gimple_code (prev) == GIMPLE_LABEL)
2507 /* Reinstall those PHI arguments queued in OLD_EDGE to NEW_EDGE. */
2510 reinstall_phi_args (edge new_edge, edge old_edge)
2512 edge_var_map_vector v;
2515 gimple_stmt_iterator phis;
2517 v = redirect_edge_var_map_vector (old_edge);
2521 for (i = 0, phis = gsi_start_phis (new_edge->dest);
2522 VEC_iterate (edge_var_map, v, i, vm) && !gsi_end_p (phis);
2523 i++, gsi_next (&phis))
2525 gimple phi = gsi_stmt (phis);
2526 tree result = redirect_edge_var_map_result (vm);
2527 tree arg = redirect_edge_var_map_def (vm);
2529 gcc_assert (result == gimple_phi_result (phi));
2531 add_phi_arg (phi, arg, new_edge, redirect_edge_var_map_location (vm));
2534 redirect_edge_var_map_clear (old_edge);
2537 /* Returns the basic block after which the new basic block created
2538 by splitting edge EDGE_IN should be placed. Tries to keep the new block
2539 near its "logical" location. This is of most help to humans looking
2540 at debugging dumps. */
2543 split_edge_bb_loc (edge edge_in)
2545 basic_block dest = edge_in->dest;
2546 basic_block dest_prev = dest->prev_bb;
2550 edge e = find_edge (dest_prev, dest);
2551 if (e && !(e->flags & EDGE_COMPLEX))
2552 return edge_in->src;
2557 /* Split a (typically critical) edge EDGE_IN. Return the new block.
2558 Abort on abnormal edges. */
2561 gimple_split_edge (edge edge_in)
2563 basic_block new_bb, after_bb, dest;
2566 /* Abnormal edges cannot be split. */
2567 gcc_assert (!(edge_in->flags & EDGE_ABNORMAL));
2569 dest = edge_in->dest;
2571 after_bb = split_edge_bb_loc (edge_in);
2573 new_bb = create_empty_bb (after_bb);
2574 new_bb->frequency = EDGE_FREQUENCY (edge_in);
2575 new_bb->count = edge_in->count;
2576 new_edge = make_edge (new_bb, dest, EDGE_FALLTHRU);
2577 new_edge->probability = REG_BR_PROB_BASE;
2578 new_edge->count = edge_in->count;
2580 e = redirect_edge_and_branch (edge_in, new_bb);
2581 gcc_assert (e == edge_in);
2582 reinstall_phi_args (new_edge, e);
2588 /* Verify properties of the address expression T with base object BASE. */
2591 verify_address (tree t, tree base)
2594 bool old_side_effects;
2596 bool new_side_effects;
2598 old_constant = TREE_CONSTANT (t);
2599 old_side_effects = TREE_SIDE_EFFECTS (t);
2601 recompute_tree_invariant_for_addr_expr (t);
2602 new_side_effects = TREE_SIDE_EFFECTS (t);
2603 new_constant = TREE_CONSTANT (t);
2605 if (old_constant != new_constant)
2607 error ("constant not recomputed when ADDR_EXPR changed");
2610 if (old_side_effects != new_side_effects)
2612 error ("side effects not recomputed when ADDR_EXPR changed");
2616 if (!(TREE_CODE (base) == VAR_DECL
2617 || TREE_CODE (base) == PARM_DECL
2618 || TREE_CODE (base) == RESULT_DECL))
2621 if (DECL_GIMPLE_REG_P (base))
2623 error ("DECL_GIMPLE_REG_P set on a variable with address taken");
2630 /* Callback for walk_tree, check that all elements with address taken are
2631 properly noticed as such. The DATA is an int* that is 1 if TP was seen
2632 inside a PHI node. */
2635 verify_expr (tree *tp, int *walk_subtrees, void *data ATTRIBUTE_UNUSED)
2642 /* Check operand N for being valid GIMPLE and give error MSG if not. */
2643 #define CHECK_OP(N, MSG) \
2644 do { if (!is_gimple_val (TREE_OPERAND (t, N))) \
2645 { error (MSG); return TREE_OPERAND (t, N); }} while (0)
2647 switch (TREE_CODE (t))
2650 if (SSA_NAME_IN_FREE_LIST (t))
2652 error ("SSA name in freelist but still referenced");
2658 error ("INDIRECT_REF in gimple IL");
2662 x = TREE_OPERAND (t, 0);
2663 if (!POINTER_TYPE_P (TREE_TYPE (x))
2664 || !is_gimple_mem_ref_addr (x))
2666 error ("invalid first operand of MEM_REF");
2669 if (TREE_CODE (TREE_OPERAND (t, 1)) != INTEGER_CST
2670 || !POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (t, 1))))
2672 error ("invalid offset operand of MEM_REF");
2673 return TREE_OPERAND (t, 1);
2675 if (TREE_CODE (x) == ADDR_EXPR
2676 && (x = verify_address (x, TREE_OPERAND (x, 0))))
2682 x = fold (ASSERT_EXPR_COND (t));
2683 if (x == boolean_false_node)
2685 error ("ASSERT_EXPR with an always-false condition");
2691 error ("MODIFY_EXPR not expected while having tuples");
2698 gcc_assert (is_gimple_address (t));
2700 /* Skip any references (they will be checked when we recurse down the
2701 tree) and ensure that any variable used as a prefix is marked
2703 for (x = TREE_OPERAND (t, 0);
2704 handled_component_p (x);
2705 x = TREE_OPERAND (x, 0))
2708 if ((tem = verify_address (t, x)))
2711 if (!(TREE_CODE (x) == VAR_DECL
2712 || TREE_CODE (x) == PARM_DECL
2713 || TREE_CODE (x) == RESULT_DECL))
2716 if (!TREE_ADDRESSABLE (x))
2718 error ("address taken, but ADDRESSABLE bit not set");
2726 x = COND_EXPR_COND (t);
2727 if (!INTEGRAL_TYPE_P (TREE_TYPE (x)))
2729 error ("non-integral used in condition");
2732 if (!is_gimple_condexpr (x))
2734 error ("invalid conditional operand");
2739 case NON_LVALUE_EXPR:
2740 case TRUTH_NOT_EXPR:
2744 case FIX_TRUNC_EXPR:
2749 CHECK_OP (0, "invalid operand to unary operator");
2756 case ARRAY_RANGE_REF:
2758 case VIEW_CONVERT_EXPR:
2759 /* We have a nest of references. Verify that each of the operands
2760 that determine where to reference is either a constant or a variable,
2761 verify that the base is valid, and then show we've already checked
2763 while (handled_component_p (t))
2765 if (TREE_CODE (t) == COMPONENT_REF && TREE_OPERAND (t, 2))
2766 CHECK_OP (2, "invalid COMPONENT_REF offset operator");
2767 else if (TREE_CODE (t) == ARRAY_REF
2768 || TREE_CODE (t) == ARRAY_RANGE_REF)
2770 CHECK_OP (1, "invalid array index");
2771 if (TREE_OPERAND (t, 2))
2772 CHECK_OP (2, "invalid array lower bound");
2773 if (TREE_OPERAND (t, 3))
2774 CHECK_OP (3, "invalid array stride");
2776 else if (TREE_CODE (t) == BIT_FIELD_REF)
2778 if (!host_integerp (TREE_OPERAND (t, 1), 1)
2779 || !host_integerp (TREE_OPERAND (t, 2), 1))
2781 error ("invalid position or size operand to BIT_FIELD_REF");
2784 if (INTEGRAL_TYPE_P (TREE_TYPE (t))
2785 && (TYPE_PRECISION (TREE_TYPE (t))
2786 != TREE_INT_CST_LOW (TREE_OPERAND (t, 1))))
2788 error ("integral result type precision does not match "
2789 "field size of BIT_FIELD_REF");
2792 else if (!INTEGRAL_TYPE_P (TREE_TYPE (t))
2793 && !AGGREGATE_TYPE_P (TREE_TYPE (t))
2794 && TYPE_MODE (TREE_TYPE (t)) != BLKmode
2795 && (GET_MODE_PRECISION (TYPE_MODE (TREE_TYPE (t)))
2796 != TREE_INT_CST_LOW (TREE_OPERAND (t, 1))))
2798 error ("mode precision of non-integral result does not "
2799 "match field size of BIT_FIELD_REF");
2804 t = TREE_OPERAND (t, 0);
2807 if (!is_gimple_min_invariant (t) && !is_gimple_lvalue (t))
2809 error ("invalid reference prefix");
2816 /* PLUS_EXPR and MINUS_EXPR don't work on pointers, they should be done using
2817 POINTER_PLUS_EXPR. */
2818 if (POINTER_TYPE_P (TREE_TYPE (t)))
2820 error ("invalid operand to plus/minus, type is a pointer");
2823 CHECK_OP (0, "invalid operand to binary operator");
2824 CHECK_OP (1, "invalid operand to binary operator");
2827 case POINTER_PLUS_EXPR:
2828 /* Check to make sure the first operand is a pointer or reference type. */
2829 if (!POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (t, 0))))
2831 error ("invalid operand to pointer plus, first operand is not a pointer");
2834 /* Check to make sure the second operand is a ptrofftype. */
2835 if (!ptrofftype_p (TREE_TYPE (TREE_OPERAND (t, 1))))
2837 error ("invalid operand to pointer plus, second operand is not an "
2838 "integer type of appropriate width");
2848 case UNORDERED_EXPR:
2857 case TRUNC_DIV_EXPR:
2859 case FLOOR_DIV_EXPR:
2860 case ROUND_DIV_EXPR:
2861 case TRUNC_MOD_EXPR:
2863 case FLOOR_MOD_EXPR:
2864 case ROUND_MOD_EXPR:
2866 case EXACT_DIV_EXPR:
2876 CHECK_OP (0, "invalid operand to binary operator");
2877 CHECK_OP (1, "invalid operand to binary operator");
2881 if (TREE_CONSTANT (t) && TREE_CODE (TREE_TYPE (t)) == VECTOR_TYPE)
2885 case CASE_LABEL_EXPR:
2888 error ("invalid CASE_CHAIN");
2902 /* Verify if EXPR is either a GIMPLE ID or a GIMPLE indirect reference.
2903 Returns true if there is an error, otherwise false. */
2906 verify_types_in_gimple_min_lval (tree expr)
2910 if (is_gimple_id (expr))
2913 if (TREE_CODE (expr) != TARGET_MEM_REF
2914 && TREE_CODE (expr) != MEM_REF)
2916 error ("invalid expression for min lvalue");
2920 /* TARGET_MEM_REFs are strange beasts. */
2921 if (TREE_CODE (expr) == TARGET_MEM_REF)
2924 op = TREE_OPERAND (expr, 0);
2925 if (!is_gimple_val (op))
2927 error ("invalid operand in indirect reference");
2928 debug_generic_stmt (op);
2931 /* Memory references now generally can involve a value conversion. */
2936 /* Verify if EXPR is a valid GIMPLE reference expression. If
2937 REQUIRE_LVALUE is true verifies it is an lvalue. Returns true
2938 if there is an error, otherwise false. */
2941 verify_types_in_gimple_reference (tree expr, bool require_lvalue)
2943 while (handled_component_p (expr))
2945 tree op = TREE_OPERAND (expr, 0);
2947 if (TREE_CODE (expr) == ARRAY_REF
2948 || TREE_CODE (expr) == ARRAY_RANGE_REF)
2950 if (!is_gimple_val (TREE_OPERAND (expr, 1))
2951 || (TREE_OPERAND (expr, 2)
2952 && !is_gimple_val (TREE_OPERAND (expr, 2)))
2953 || (TREE_OPERAND (expr, 3)
2954 && !is_gimple_val (TREE_OPERAND (expr, 3))))
2956 error ("invalid operands to array reference");
2957 debug_generic_stmt (expr);
2962 /* Verify if the reference array element types are compatible. */
2963 if (TREE_CODE (expr) == ARRAY_REF
2964 && !useless_type_conversion_p (TREE_TYPE (expr),
2965 TREE_TYPE (TREE_TYPE (op))))
2967 error ("type mismatch in array reference");
2968 debug_generic_stmt (TREE_TYPE (expr));
2969 debug_generic_stmt (TREE_TYPE (TREE_TYPE (op)));
2972 if (TREE_CODE (expr) == ARRAY_RANGE_REF
2973 && !useless_type_conversion_p (TREE_TYPE (TREE_TYPE (expr)),
2974 TREE_TYPE (TREE_TYPE (op))))
2976 error ("type mismatch in array range reference");
2977 debug_generic_stmt (TREE_TYPE (TREE_TYPE (expr)));
2978 debug_generic_stmt (TREE_TYPE (TREE_TYPE (op)));
2982 if ((TREE_CODE (expr) == REALPART_EXPR
2983 || TREE_CODE (expr) == IMAGPART_EXPR)
2984 && !useless_type_conversion_p (TREE_TYPE (expr),
2985 TREE_TYPE (TREE_TYPE (op))))
2987 error ("type mismatch in real/imagpart reference");
2988 debug_generic_stmt (TREE_TYPE (expr));
2989 debug_generic_stmt (TREE_TYPE (TREE_TYPE (op)));
2993 if (TREE_CODE (expr) == COMPONENT_REF
2994 && !useless_type_conversion_p (TREE_TYPE (expr),
2995 TREE_TYPE (TREE_OPERAND (expr, 1))))
2997 error ("type mismatch in component reference");
2998 debug_generic_stmt (TREE_TYPE (expr));
2999 debug_generic_stmt (TREE_TYPE (TREE_OPERAND (expr, 1)));
3003 if (TREE_CODE (expr) == VIEW_CONVERT_EXPR)
3005 /* For VIEW_CONVERT_EXPRs which are allowed here too, we only check
3006 that their operand is not an SSA name or an invariant when
3007 requiring an lvalue (this usually means there is a SRA or IPA-SRA
3008 bug). Otherwise there is nothing to verify, gross mismatches at
3009 most invoke undefined behavior. */
3011 && (TREE_CODE (op) == SSA_NAME
3012 || is_gimple_min_invariant (op)))
3014 error ("conversion of an SSA_NAME on the left hand side");
3015 debug_generic_stmt (expr);
3018 else if (TREE_CODE (op) == SSA_NAME
3019 && TYPE_SIZE (TREE_TYPE (expr)) != TYPE_SIZE (TREE_TYPE (op)))
3021 error ("conversion of register to a different size");
3022 debug_generic_stmt (expr);
3025 else if (!handled_component_p (op))
3032 if (TREE_CODE (expr) == MEM_REF)
3034 if (!is_gimple_mem_ref_addr (TREE_OPERAND (expr, 0)))
3036 error ("invalid address operand in MEM_REF");
3037 debug_generic_stmt (expr);
3040 if (TREE_CODE (TREE_OPERAND (expr, 1)) != INTEGER_CST
3041 || !POINTER_TYPE_P (TREE_TYPE (TREE_OPERAND (expr, 1))))
3043 error ("invalid offset operand in MEM_REF");
3044 debug_generic_stmt (expr);
3048 else if (TREE_CODE (expr) == TARGET_MEM_REF)
3050 if (!TMR_BASE (expr)
3051 || !is_gimple_mem_ref_addr (TMR_BASE (expr)))
3053 error ("invalid address operand in TARGET_MEM_REF");
3056 if (!TMR_OFFSET (expr)
3057 || TREE_CODE (TMR_OFFSET (expr)) != INTEGER_CST
3058 || !POINTER_TYPE_P (TREE_TYPE (TMR_OFFSET (expr))))
3060 error ("invalid offset operand in TARGET_MEM_REF");
3061 debug_generic_stmt (expr);
3066 return ((require_lvalue || !is_gimple_min_invariant (expr))
3067 && verify_types_in_gimple_min_lval (expr));
3070 /* Returns true if there is one pointer type in TYPE_POINTER_TO (SRC_OBJ)
3071 list of pointer-to types that is trivially convertible to DEST. */
3074 one_pointer_to_useless_type_conversion_p (tree dest, tree src_obj)
3078 if (!TYPE_POINTER_TO (src_obj))
3081 for (src = TYPE_POINTER_TO (src_obj); src; src = TYPE_NEXT_PTR_TO (src))
3082 if (useless_type_conversion_p (dest, src))
3088 /* Return true if TYPE1 is a fixed-point type and if conversions to and
3089 from TYPE2 can be handled by FIXED_CONVERT_EXPR. */
3092 valid_fixed_convert_types_p (tree type1, tree type2)
3094 return (FIXED_POINT_TYPE_P (type1)
3095 && (INTEGRAL_TYPE_P (type2)
3096 || SCALAR_FLOAT_TYPE_P (type2)
3097 || FIXED_POINT_TYPE_P (type2)));
3100 /* Verify the contents of a GIMPLE_CALL STMT. Returns true when there
3101 is a problem, otherwise false. */
3104 verify_gimple_call (gimple stmt)
3106 tree fn = gimple_call_fn (stmt);
3107 tree fntype, fndecl;
3110 if (gimple_call_internal_p (stmt))
3114 error ("gimple call has two targets");
3115 debug_generic_stmt (fn);
3123 error ("gimple call has no target");
3128 if (fn && !is_gimple_call_addr (fn))
3130 error ("invalid function in gimple call");
3131 debug_generic_stmt (fn);
3136 && (!POINTER_TYPE_P (TREE_TYPE (fn))
3137 || (TREE_CODE (TREE_TYPE (TREE_TYPE (fn))) != FUNCTION_TYPE
3138 && TREE_CODE (TREE_TYPE (TREE_TYPE (fn))) != METHOD_TYPE)))
3140 error ("non-function in gimple call");
3144 fndecl = gimple_call_fndecl (stmt);
3146 && TREE_CODE (fndecl) == FUNCTION_DECL
3147 && DECL_LOOPING_CONST_OR_PURE_P (fndecl)
3148 && !DECL_PURE_P (fndecl)
3149 && !TREE_READONLY (fndecl))
3151 error ("invalid pure const state for function");
3155 if (gimple_call_lhs (stmt)
3156 && (!is_gimple_lvalue (gimple_call_lhs (stmt))
3157 || verify_types_in_gimple_reference (gimple_call_lhs (stmt), true)))
3159 error ("invalid LHS in gimple call");
3163 if (gimple_call_lhs (stmt) && gimple_call_noreturn_p (stmt))
3165 error ("LHS in noreturn call");
3169 fntype = gimple_call_fntype (stmt);
3171 && gimple_call_lhs (stmt)
3172 && !useless_type_conversion_p (TREE_TYPE (gimple_call_lhs (stmt)),
3174 /* ??? At least C++ misses conversions at assignments from
3175 void * call results.
3176 ??? Java is completely off. Especially with functions
3177 returning java.lang.Object.
3178 For now simply allow arbitrary pointer type conversions. */
3179 && !(POINTER_TYPE_P (TREE_TYPE (gimple_call_lhs (stmt)))
3180 && POINTER_TYPE_P (TREE_TYPE (fntype))))
3182 error ("invalid conversion in gimple call");
3183 debug_generic_stmt (TREE_TYPE (gimple_call_lhs (stmt)));
3184 debug_generic_stmt (TREE_TYPE (fntype));
3188 if (gimple_call_chain (stmt)
3189 && !is_gimple_val (gimple_call_chain (stmt)))
3191 error ("invalid static chain in gimple call");
3192 debug_generic_stmt (gimple_call_chain (stmt));
3196 /* If there is a static chain argument, this should not be an indirect
3197 call, and the decl should have DECL_STATIC_CHAIN set. */
3198 if (gimple_call_chain (stmt))
3200 if (!gimple_call_fndecl (stmt))
3202 error ("static chain in indirect gimple call");
3205 fn = TREE_OPERAND (fn, 0);
3207 if (!DECL_STATIC_CHAIN (fn))
3209 error ("static chain with function that doesn%'t use one");
3214 /* ??? The C frontend passes unpromoted arguments in case it
3215 didn't see a function declaration before the call. So for now
3216 leave the call arguments mostly unverified. Once we gimplify
3217 unit-at-a-time we have a chance to fix this. */
3219 for (i = 0; i < gimple_call_num_args (stmt); ++i)
3221 tree arg = gimple_call_arg (stmt, i);
3222 if ((is_gimple_reg_type (TREE_TYPE (arg))
3223 && !is_gimple_val (arg))
3224 || (!is_gimple_reg_type (TREE_TYPE (arg))
3225 && !is_gimple_lvalue (arg)))
3227 error ("invalid argument to gimple call");
3228 debug_generic_expr (arg);
3236 /* Verifies the gimple comparison with the result type TYPE and
3237 the operands OP0 and OP1. */
3240 verify_gimple_comparison (tree type, tree op0, tree op1)
3242 tree op0_type = TREE_TYPE (op0);
3243 tree op1_type = TREE_TYPE (op1);
3245 if (!is_gimple_val (op0) || !is_gimple_val (op1))
3247 error ("invalid operands in gimple comparison");
3251 /* For comparisons we do not have the operations type as the
3252 effective type the comparison is carried out in. Instead
3253 we require that either the first operand is trivially
3254 convertible into the second, or the other way around.
3255 Because we special-case pointers to void we allow
3256 comparisons of pointers with the same mode as well. */
3257 if (!useless_type_conversion_p (op0_type, op1_type)
3258 && !useless_type_conversion_p (op1_type, op0_type)
3259 && (!POINTER_TYPE_P (op0_type)
3260 || !POINTER_TYPE_P (op1_type)
3261 || TYPE_MODE (op0_type) != TYPE_MODE (op1_type)))
3263 error ("mismatching comparison operand types");
3264 debug_generic_expr (op0_type);
3265 debug_generic_expr (op1_type);
3269 /* The resulting type of a comparison may be an effective boolean type. */
3270 if (INTEGRAL_TYPE_P (type)
3271 && (TREE_CODE (type) == BOOLEAN_TYPE
3272 || TYPE_PRECISION (type) == 1))
3274 /* Or an integer vector type with the same size and element count
3275 as the comparison operand types. */
3276 else if (TREE_CODE (type) == VECTOR_TYPE
3277 && TREE_CODE (TREE_TYPE (type)) == INTEGER_TYPE)
3279 if (TREE_CODE (op0_type) != VECTOR_TYPE
3280 || TREE_CODE (op1_type) != VECTOR_TYPE)
3282 error ("non-vector operands in vector comparison");
3283 debug_generic_expr (op0_type);
3284 debug_generic_expr (op1_type);
3288 if (TYPE_VECTOR_SUBPARTS (type) != TYPE_VECTOR_SUBPARTS (op0_type)
3289 || (GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (type)))
3290 != GET_MODE_SIZE (TYPE_MODE (TREE_TYPE (op0_type)))))
3292 error ("invalid vector comparison resulting type");
3293 debug_generic_expr (type);
3299 error ("bogus comparison result type");
3300 debug_generic_expr (type);
3307 /* Verify a gimple assignment statement STMT with an unary rhs.
3308 Returns true if anything is wrong. */
3311 verify_gimple_assign_unary (gimple stmt)
3313 enum tree_code rhs_code = gimple_assign_rhs_code (stmt);
3314 tree lhs = gimple_assign_lhs (stmt);
3315 tree lhs_type = TREE_TYPE (lhs);
3316 tree rhs1 = gimple_assign_rhs1 (stmt);
3317 tree rhs1_type = TREE_TYPE (rhs1);
3319 if (!is_gimple_reg (lhs))
3321 error ("non-register as LHS of unary operation");
3325 if (!is_gimple_val (rhs1))
3327 error ("invalid operand in unary operation");
3331 /* First handle conversions. */
3336 /* Allow conversions from pointer type to integral type only if
3337 there is no sign or zero extension involved.
3338 For targets were the precision of ptrofftype doesn't match that
3339 of pointers we need to allow arbitrary conversions to ptrofftype. */
3340 if ((POINTER_TYPE_P (lhs_type)
3341 && INTEGRAL_TYPE_P (rhs1_type))
3342 || (POINTER_TYPE_P (rhs1_type)
3343 && INTEGRAL_TYPE_P (lhs_type)
3344 && (TYPE_PRECISION (rhs1_type) >= TYPE_PRECISION (lhs_type)
3345 || ptrofftype_p (sizetype))))
3348 /* Allow conversion from integral to offset type and vice versa. */
3349 if ((TREE_CODE (lhs_type) == OFFSET_TYPE
3350 && INTEGRAL_TYPE_P (rhs1_type))
3351 || (INTEGRAL_TYPE_P (lhs_type)
3352 && TREE_CODE (rhs1_type) == OFFSET_TYPE))
3355 /* Otherwise assert we are converting between types of the
3357 if (INTEGRAL_TYPE_P (lhs_type) != INTEGRAL_TYPE_P (rhs1_type))
3359 error ("invalid types in nop conversion");
3360 debug_generic_expr (lhs_type);
3361 debug_generic_expr (rhs1_type);
3368 case ADDR_SPACE_CONVERT_EXPR:
3370 if (!POINTER_TYPE_P (rhs1_type) || !POINTER_TYPE_P (lhs_type)
3371 || (TYPE_ADDR_SPACE (TREE_TYPE (rhs1_type))
3372 == TYPE_ADDR_SPACE (TREE_TYPE (lhs_type))))
3374 error ("invalid types in address space conversion");
3375 debug_generic_expr (lhs_type);
3376 debug_generic_expr (rhs1_type);
3383 case FIXED_CONVERT_EXPR:
3385 if (!valid_fixed_convert_types_p (lhs_type, rhs1_type)
3386 && !valid_fixed_convert_types_p (rhs1_type, lhs_type))
3388 error ("invalid types in fixed-point conversion");
3389 debug_generic_expr (lhs_type);
3390 debug_generic_expr (rhs1_type);
3399 if ((!INTEGRAL_TYPE_P (rhs1_type) || !SCALAR_FLOAT_TYPE_P (lhs_type))
3400 && (!VECTOR_INTEGER_TYPE_P (rhs1_type)
3401 || !VECTOR_FLOAT_TYPE_P(lhs_type)))
3403 error ("invalid types in conversion to floating point");
3404 debug_generic_expr (lhs_type);
3405 debug_generic_expr (rhs1_type);
3412 case FIX_TRUNC_EXPR:
3414 if ((!INTEGRAL_TYPE_P (lhs_type) || !SCALAR_FLOAT_TYPE_P (rhs1_type))
3415 && (!VECTOR_INTEGER_TYPE_P (lhs_type)
3416 || !VECTOR_FLOAT_TYPE_P(rhs1_type)))
3418 error ("invalid types in conversion to integer");
3419 debug_generic_expr (lhs_type);
3420 debug_generic_expr (rhs1_type);
3427 case VEC_UNPACK_HI_EXPR:
3428 case VEC_UNPACK_LO_EXPR:
3429 case REDUC_MAX_EXPR:
3430 case REDUC_MIN_EXPR:
3431 case REDUC_PLUS_EXPR:
3432 case VEC_UNPACK_FLOAT_HI_EXPR:
3433 case VEC_UNPACK_FLOAT_LO_EXPR:
3441 case NON_LVALUE_EXPR:
3449 /* For the remaining codes assert there is no conversion involved. */
3450 if (!useless_type_conversion_p (lhs_type, rhs1_type))
3452 error ("non-trivial conversion in unary operation");
3453 debug_generic_expr (lhs_type);
3454 debug_generic_expr (rhs1_type);
3461 /* Verify a gimple assignment statement STMT with a binary rhs.
3462 Returns true if anything is wrong. */
3465 verify_gimple_assign_binary (gimple stmt)
3467 enum tree_code rhs_code = gimple_assign_rhs_code (stmt);
3468 tree lhs = gimple_assign_lhs (stmt);
3469 tree lhs_type = TREE_TYPE (lhs);
3470 tree rhs1 = gimple_assign_rhs1 (stmt);
3471 tree rhs1_type = TREE_TYPE (rhs1);
3472 tree rhs2 = gimple_assign_rhs2 (stmt);
3473 tree rhs2_type = TREE_TYPE (rhs2);
3475 if (!is_gimple_reg (lhs))
3477 error ("non-register as LHS of binary operation");
3481 if (!is_gimple_val (rhs1)
3482 || !is_gimple_val (rhs2))
3484 error ("invalid operands in binary operation");
3488 /* First handle operations that involve different types. */
3493 if (TREE_CODE (lhs_type) != COMPLEX_TYPE
3494 || !(INTEGRAL_TYPE_P (rhs1_type)
3495 || SCALAR_FLOAT_TYPE_P (rhs1_type))
3496 || !(INTEGRAL_TYPE_P (rhs2_type)
3497 || SCALAR_FLOAT_TYPE_P (rhs2_type)))
3499 error ("type mismatch in complex expression");
3500 debug_generic_expr (lhs_type);
3501 debug_generic_expr (rhs1_type);
3502 debug_generic_expr (rhs2_type);
3514 /* Shifts and rotates are ok on integral types, fixed point
3515 types and integer vector types. */
3516 if ((!INTEGRAL_TYPE_P (rhs1_type)
3517 && !FIXED_POINT_TYPE_P (rhs1_type)
3518 && !(TREE_CODE (rhs1_type) == VECTOR_TYPE
3519 && INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type))))
3520 || (!INTEGRAL_TYPE_P (rhs2_type)
3521 /* Vector shifts of vectors are also ok. */
3522 && !(TREE_CODE (rhs1_type) == VECTOR_TYPE
3523 && INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type))
3524 && TREE_CODE (rhs2_type) == VECTOR_TYPE
3525 && INTEGRAL_TYPE_P (TREE_TYPE (rhs2_type))))
3526 || !useless_type_conversion_p (lhs_type, rhs1_type))
3528 error ("type mismatch in shift expression");
3529 debug_generic_expr (lhs_type);
3530 debug_generic_expr (rhs1_type);
3531 debug_generic_expr (rhs2_type);
3538 case VEC_LSHIFT_EXPR:
3539 case VEC_RSHIFT_EXPR:
3541 if (TREE_CODE (rhs1_type) != VECTOR_TYPE
3542 || !(INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type))
3543 || POINTER_TYPE_P (TREE_TYPE (rhs1_type))
3544 || FIXED_POINT_TYPE_P (TREE_TYPE (rhs1_type))
3545 || SCALAR_FLOAT_TYPE_P (TREE_TYPE (rhs1_type)))
3546 || (!INTEGRAL_TYPE_P (rhs2_type)
3547 && (TREE_CODE (rhs2_type) != VECTOR_TYPE
3548 || !INTEGRAL_TYPE_P (TREE_TYPE (rhs2_type))))
3549 || !useless_type_conversion_p (lhs_type, rhs1_type))
3551 error ("type mismatch in vector shift expression");
3552 debug_generic_expr (lhs_type);
3553 debug_generic_expr (rhs1_type);
3554 debug_generic_expr (rhs2_type);
3557 /* For shifting a vector of non-integral components we
3558 only allow shifting by a constant multiple of the element size. */
3559 if (!INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type))
3560 && (TREE_CODE (rhs2) != INTEGER_CST
3561 || !div_if_zero_remainder (EXACT_DIV_EXPR, rhs2,
3562 TYPE_SIZE (TREE_TYPE (rhs1_type)))))
3564 error ("non-element sized vector shift of floating point vector");
3571 case WIDEN_LSHIFT_EXPR:
3573 if (!INTEGRAL_TYPE_P (lhs_type)
3574 || !INTEGRAL_TYPE_P (rhs1_type)
3575 || TREE_CODE (rhs2) != INTEGER_CST
3576 || (2 * TYPE_PRECISION (rhs1_type) > TYPE_PRECISION (lhs_type)))
3578 error ("type mismatch in widening vector shift expression");
3579 debug_generic_expr (lhs_type);
3580 debug_generic_expr (rhs1_type);
3581 debug_generic_expr (rhs2_type);
3588 case VEC_WIDEN_LSHIFT_HI_EXPR:
3589 case VEC_WIDEN_LSHIFT_LO_EXPR:
3591 if (TREE_CODE (rhs1_type) != VECTOR_TYPE
3592 || TREE_CODE (lhs_type) != VECTOR_TYPE
3593 || !INTEGRAL_TYPE_P (TREE_TYPE (rhs1_type))
3594 || !INTEGRAL_TYPE_P (TREE_TYPE (lhs_type))
3595 || TREE_CODE (rhs2) != INTEGER_CST
3596 || (2 * TYPE_PRECISION (TREE_TYPE (rhs1_type))
3597 > TYPE_PRECISION (TREE_TYPE (lhs_type))))
3599 error ("type mismatch in widening vector shift expression");
3600 debug_generic_expr (lhs_type);
3601 debug_generic_expr (rhs1_type);
3602 debug_generic_expr (rhs2_type);
3612 /* We use regular PLUS_EXPR and MINUS_EXPR for vectors.
3613 ??? This just makes the checker happy and may not be what is
3615 if (TREE_CODE (lhs_type) == VECTOR_TYPE
3616 && POINTER_TYPE_P (TREE_TYPE (lhs_type)))
3618 if (TREE_CODE (rhs1_type) != VECTOR_TYPE
3619 || TREE_CODE (rhs2_type) != VECTOR_TYPE)
3621 error ("invalid non-vector operands to vector valued plus");
3624 lhs_type = TREE_TYPE (lhs_type);
3625 rhs1_type = TREE_TYPE (rhs1_type);
3626 rhs2_type = TREE_TYPE (rhs2_type);
3627 /* PLUS_EXPR is commutative, so we might end up canonicalizing
3628 the pointer to 2nd place. */
3629 if (POINTER_TYPE_P (rhs2_type))
3631 tree tem = rhs1_type;
3632 rhs1_type = rhs2_type;
3635 goto do_pointer_plus_expr_check;
3637 if (POINTER_TYPE_P (lhs_type)
3638 || POINTER_TYPE_P (rhs1_type)
3639 || POINTER_TYPE_P (rhs2_type))
3641 error ("invalid (pointer) operands to plus/minus");
3645 /* Continue with generic binary expression handling. */
3649 case POINTER_PLUS_EXPR:
3651 do_pointer_plus_expr_check:
3652 if (!POINTER_TYPE_P (rhs1_type)
3653 || !useless_type_conversion_p (lhs_type, rhs1_type)
3654 || !ptrofftype_p (rhs2_type))
3656 error ("type mismatch in pointer plus expression");
3657 debug_generic_stmt (lhs_type);
3658 debug_generic_stmt (rhs1_type);
3659 debug_generic_stmt (rhs2_type);
3666 case TRUTH_ANDIF_EXPR:
3667 case TRUTH_ORIF_EXPR:
3668 case TRUTH_AND_EXPR:
3670 case TRUTH_XOR_EXPR:
3680 case UNORDERED_EXPR:
3688 /* Comparisons are also binary, but the result type is not
3689 connected to the operand types. */
3690 return verify_gimple_comparison (lhs_type, rhs1, rhs2);
3692 case WIDEN_MULT_EXPR:
3693 if (TREE_CODE (lhs_type) != INTEGER_TYPE)
3695 return ((2 * TYPE_PRECISION (rhs1_type) > TYPE_PRECISION (lhs_type))
3696 || (TYPE_PRECISION (rhs1_type) != TYPE_PRECISION (rhs2_type)));
3698 case WIDEN_SUM_EXPR:
3699 case VEC_WIDEN_MULT_HI_EXPR:
3700 case VEC_WIDEN_MULT_LO_EXPR:
3701 case VEC_WIDEN_MULT_EVEN_EXPR:
3702 case VEC_WIDEN_MULT_ODD_EXPR:
3703 case VEC_PACK_TRUNC_EXPR:
3704 case VEC_PACK_SAT_EXPR:
3705 case VEC_PACK_FIX_TRUNC_EXPR:
3710 case MULT_HIGHPART_EXPR:
3711 case TRUNC_DIV_EXPR:
3713 case FLOOR_DIV_EXPR:
3714 case ROUND_DIV_EXPR:
3715 case TRUNC_MOD_EXPR:
3717 case FLOOR_MOD_EXPR:
3718 case ROUND_MOD_EXPR:
3720 case EXACT_DIV_EXPR:
3726 /* Continue with generic binary expression handling. */
3733 if (!useless_type_conversion_p (lhs_type, rhs1_type)
3734 || !useless_type_conversion_p (lhs_type, rhs2_type))
3736 error ("type mismatch in binary expression");
3737 debug_generic_stmt (lhs_type);
3738 debug_generic_stmt (rhs1_type);
3739 debug_generic_stmt (rhs2_type);
3746 /* Verify a gimple assignment statement STMT with a ternary rhs.
3747 Returns true if anything is wrong. */
3750 verify_gimple_assign_ternary (gimple stmt)
3752 enum tree_code rhs_code = gimple_assign_rhs_code (stmt);
3753 tree lhs = gimple_assign_lhs (stmt);
3754 tree lhs_type = TREE_TYPE (lhs);
3755 tree rhs1 = gimple_assign_rhs1 (stmt);
3756 tree rhs1_type = TREE_TYPE (rhs1);
3757 tree rhs2 = gimple_assign_rhs2 (stmt);
3758 tree rhs2_type = TREE_TYPE (rhs2);
3759 tree rhs3 = gimple_assign_rhs3 (stmt);
3760 tree rhs3_type = TREE_TYPE (rhs3);
3762 if (!is_gimple_reg (lhs))
3764 error ("non-register as LHS of ternary operation");
3768 if (((rhs_code == VEC_COND_EXPR || rhs_code == COND_EXPR)
3769 ? !is_gimple_condexpr (rhs1) : !is_gimple_val (rhs1))
3770 || !is_gimple_val (rhs2)
3771 || !is_gimple_val (rhs3))
3773 error ("invalid operands in ternary operation");
3777 /* First handle operations that involve different types. */
3780 case WIDEN_MULT_PLUS_EXPR:
3781 case WIDEN_MULT_MINUS_EXPR:
3782 if ((!INTEGRAL_TYPE_P (rhs1_type)
3783 && !FIXED_POINT_TYPE_P (rhs1_type))
3784 || !useless_type_conversion_p (rhs1_type, rhs2_type)
3785 || !useless_type_conversion_p (lhs_type, rhs3_type)
3786 || 2 * TYPE_PRECISION (rhs1_type) > TYPE_PRECISION (lhs_type)
3787 || TYPE_PRECISION (rhs1_type) != TYPE_PRECISION (rhs2_type))
3789 error ("type mismatch in widening multiply-accumulate expression");
3790 debug_generic_expr (lhs_type);
3791 debug_generic_expr (rhs1_type);
3792 debug_generic_expr (rhs2_type);
3793 debug_generic_expr (rhs3_type);
3799 if (!useless_type_conversion_p (lhs_type, rhs1_type)
3800 || !useless_type_conversion_p (lhs_type, rhs2_type)
3801 || !useless_type_conversion_p (lhs_type, rhs3_type))
3803 error ("type mismatch in fused multiply-add expression");
3804 debug_generic_expr (lhs_type);
3805 debug_generic_expr (rhs1_type);
3806 debug_generic_expr (rhs2_type);
3807 debug_generic_expr (rhs3_type);
3814 if (!useless_type_conversion_p (lhs_type, rhs2_type)
3815 || !useless_type_conversion_p (lhs_type, rhs3_type))
3817 error ("type mismatch in conditional expression");
3818 debug_generic_expr (lhs_type);
3819 debug_generic_expr (rhs2_type);
3820 debug_generic_expr (rhs3_type);
3826 if (!useless_type_conversion_p (lhs_type, rhs1_type)
3827 || !useless_type_conversion_p (lhs_type, rhs2_type))
3829 error ("type mismatch in vector permute expression");
3830 debug_generic_expr (lhs_type);
3831 debug_generic_expr (rhs1_type);
3832 debug_generic_expr (rhs2_type);
3833 debug_generic_expr (rhs3_type);
3837 if (TREE_CODE (rhs1_type) != VECTOR_TYPE
3838 || TREE_CODE (rhs2_type) != VECTOR_TYPE
3839 || TREE_CODE (rhs3_type) != VECTOR_TYPE)
3841 error ("vector types expected in vector permute expression");
3842 debug_generic_expr (lhs_type);
3843 debug_generic_expr (rhs1_type);
3844 debug_generic_expr (rhs2_type);
3845 debug_generic_expr (rhs3_type);
3849 if (TYPE_VECTOR_SUBPARTS (rhs1_type) != TYPE_VECTOR_SUBPARTS (rhs2_type)
3850 || TYPE_VECTOR_SUBPARTS (rhs2_type)
3851 != TYPE_VECTOR_SUBPARTS (rhs3_type)
3852 || TYPE_VECTOR_SUBPARTS (rhs3_type)
3853 != TYPE_VECTOR_SUBPARTS (lhs_type))
3855 error ("vectors with different element number found "
3856 "in vector permute expression");
3857 debug_generic_expr (lhs_type);
3858 debug_generic_expr (rhs1_type);
3859 debug_generic_expr (rhs2_type);
3860 debug_generic_expr (rhs3_type);
3864 if (TREE_CODE (TREE_TYPE (rhs3_type)) != INTEGER_TYPE
3865 || GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (rhs3_type)))
3866 != GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (rhs1_type))))
3868 error ("invalid mask type in vector permute expression");
3869 debug_generic_expr (lhs_type);
3870 debug_generic_expr (rhs1_type);
3871 debug_generic_expr (rhs2_type);
3872 debug_generic_expr (rhs3_type);
3879 case REALIGN_LOAD_EXPR:
3889 /* Verify a gimple assignment statement STMT with a single rhs.
3890 Returns true if anything is wrong. */
3893 verify_gimple_assign_single (gimple stmt)
3895 enum tree_code rhs_code = gimple_assign_rhs_code (stmt);
3896 tree lhs = gimple_assign_lhs (stmt);
3897 tree lhs_type = TREE_TYPE (lhs);
3898 tree rhs1 = gimple_assign_rhs1 (stmt);
3899 tree rhs1_type = TREE_TYPE (rhs1);
3902 if (!useless_type_conversion_p (lhs_type, rhs1_type))
3904 error ("non-trivial conversion at assignment");
3905 debug_generic_expr (lhs_type);
3906 debug_generic_expr (rhs1_type);
3910 if (gimple_clobber_p (stmt)
3913 error ("non-decl LHS in clobber statement");
3914 debug_generic_expr (lhs);
3918 if (handled_component_p (lhs))
3919 res |= verify_types_in_gimple_reference (lhs, true);
3921 /* Special codes we cannot handle via their class. */
3926 tree op = TREE_OPERAND (rhs1, 0);
3927 if (!is_gimple_addressable (op))
3929 error ("invalid operand in unary expression");
3933 /* Technically there is no longer a need for matching types, but
3934 gimple hygiene asks for this check. In LTO we can end up
3935 combining incompatible units and thus end up with addresses
3936 of globals that change their type to a common one. */
3938 && !types_compatible_p (TREE_TYPE (op),
3939 TREE_TYPE (TREE_TYPE (rhs1)))
3940 && !one_pointer_to_useless_type_conversion_p (TREE_TYPE (rhs1),
3943 error ("type mismatch in address expression");
3944 debug_generic_stmt (TREE_TYPE (rhs1));
3945 debug_generic_stmt (TREE_TYPE (op));
3949 return verify_types_in_gimple_reference (op, true);
3954 error ("INDIRECT_REF in gimple IL");
3960 case ARRAY_RANGE_REF:
3961 case VIEW_CONVERT_EXPR:
3964 case TARGET_MEM_REF:
3966 if (!is_gimple_reg (lhs)
3967 && is_gimple_reg_type (TREE_TYPE (lhs)))
3969 error ("invalid rhs for gimple memory store");
3970 debug_generic_stmt (lhs);
3971 debug_generic_stmt (rhs1);
3974 return res || verify_types_in_gimple_reference (rhs1, false);
3986 /* tcc_declaration */
3991 if (!is_gimple_reg (lhs)
3992 && !is_gimple_reg (rhs1)
3993 && is_gimple_reg_type (TREE_TYPE (lhs)))
3995 error ("invalid rhs for gimple memory store");
3996 debug_generic_stmt (lhs);
3997 debug_generic_stmt (rhs1);
4005 case WITH_SIZE_EXPR:
4015 /* Verify the contents of a GIMPLE_ASSIGN STMT. Returns true when there
4016 is a problem, otherwise false. */
4019 verify_gimple_assign (gimple stmt)
4021 switch (gimple_assign_rhs_class (stmt))
4023 case GIMPLE_SINGLE_RHS:
4024 return verify_gimple_assign_single (stmt);
4026 case GIMPLE_UNARY_RHS:
4027 return verify_gimple_assign_unary (stmt);
4029 case GIMPLE_BINARY_RHS:
4030 return verify_gimple_assign_binary (stmt);
4032 case GIMPLE_TERNARY_RHS:
4033 return verify_gimple_assign_ternary (stmt);
4040 /* Verify the contents of a GIMPLE_RETURN STMT. Returns true when there
4041 is a problem, otherwise false. */
4044 verify_gimple_return (gimple stmt)
4046 tree op = gimple_return_retval (stmt);
4047 tree restype = TREE_TYPE (TREE_TYPE (cfun->decl));
4049 /* We cannot test for present return values as we do not fix up missing
4050 return values from the original source. */
4054 if (!is_gimple_val (op)
4055 && TREE_CODE (op) != RESULT_DECL)
4057 error ("invalid operand in return statement");
4058 debug_generic_stmt (op);
4062 if ((TREE_CODE (op) == RESULT_DECL
4063 && DECL_BY_REFERENCE (op))
4064 || (TREE_CODE (op) == SSA_NAME
4065 && SSA_NAME_VAR (op)
4066 && TREE_CODE (SSA_NAME_VAR (op)) == RESULT_DECL
4067 && DECL_BY_REFERENCE (SSA_NAME_VAR (op))))
4068 op = TREE_TYPE (op);
4070 if (!useless_type_conversion_p (restype, TREE_TYPE (op)))
4072 error ("invalid conversion in return statement");
4073 debug_generic_stmt (restype);
4074 debug_generic_stmt (TREE_TYPE (op));
4082 /* Verify the contents of a GIMPLE_GOTO STMT. Returns true when there
4083 is a problem, otherwise false. */
4086 verify_gimple_goto (gimple stmt)
4088 tree dest = gimple_goto_dest (stmt);
4090 /* ??? We have two canonical forms of direct goto destinations, a
4091 bare LABEL_DECL and an ADDR_EXPR of a LABEL_DECL. */
4092 if (TREE_CODE (dest) != LABEL_DECL
4093 && (!is_gimple_val (dest)
4094 || !POINTER_TYPE_P (TREE_TYPE (dest))))
4096 error ("goto destination is neither a label nor a pointer");
4103 /* Verify the contents of a GIMPLE_SWITCH STMT. Returns true when there
4104 is a problem, otherwise false. */
4107 verify_gimple_switch (gimple stmt)
4110 tree elt, prev_upper_bound = NULL_TREE;
4111 tree index_type, elt_type = NULL_TREE;
4113 if (!is_gimple_val (gimple_switch_index (stmt)))
4115 error ("invalid operand to switch statement");
4116 debug_generic_stmt (gimple_switch_index (stmt));
4120 index_type = TREE_TYPE (gimple_switch_index (stmt));
4121 if (! INTEGRAL_TYPE_P (index_type))
4123 error ("non-integral type switch statement");
4124 debug_generic_expr (index_type);
4128 elt = gimple_switch_label (stmt, 0);
4129 if (CASE_LOW (elt) != NULL_TREE || CASE_HIGH (elt) != NULL_TREE)
4131 error ("invalid default case label in switch statement");
4132 debug_generic_expr (elt);
4136 n = gimple_switch_num_labels (stmt);
4137 for (i = 1; i < n; i++)
4139 elt = gimple_switch_label (stmt, i);
4141 if (! CASE_LOW (elt))
4143 error ("invalid case label in switch statement");
4144 debug_generic_expr (elt);
4148 && ! tree_int_cst_lt (CASE_LOW (elt), CASE_HIGH (elt)))
4150 error ("invalid case range in switch statement");
4151 debug_generic_expr (elt);
4157 if (TREE_TYPE (CASE_LOW (elt)) != elt_type
4158 || (CASE_HIGH (elt) && TREE_TYPE (CASE_HIGH (elt)) != elt_type))
4160 error ("type mismatch for case label in switch statement");
4161 debug_generic_expr (elt);
4167 elt_type = TREE_TYPE (CASE_LOW (elt));
4168 if (TYPE_PRECISION (index_type) < TYPE_PRECISION (elt_type))
4170 error ("type precision mismatch in switch statement");
4175 if (prev_upper_bound)
4177 if (! tree_int_cst_lt (prev_upper_bound, CASE_LOW (elt)))
4179 error ("case labels not sorted in switch statement");
4184 prev_upper_bound = CASE_HIGH (elt);
4185 if (! prev_upper_bound)
4186 prev_upper_bound = CASE_LOW (elt);
4192 /* Verify a gimple debug statement STMT.
4193 Returns true if anything is wrong. */
4196 verify_gimple_debug (gimple stmt ATTRIBUTE_UNUSED)
4198 /* There isn't much that could be wrong in a gimple debug stmt. A
4199 gimple debug bind stmt, for example, maps a tree, that's usually
4200 a VAR_DECL or a PARM_DECL, but that could also be some scalarized
4201 component or member of an aggregate type, to another tree, that
4202 can be an arbitrary expression. These stmts expand into debug
4203 insns, and are converted to debug notes by var-tracking.c. */
4207 /* Verify a gimple label statement STMT.
4208 Returns true if anything is wrong. */
4211 verify_gimple_label (gimple stmt)
4213 tree decl = gimple_label_label (stmt);
4217 if (TREE_CODE (decl) != LABEL_DECL)
4220 uid = LABEL_DECL_UID (decl);
4223 || VEC_index (basic_block,
4224 label_to_block_map, uid) != gimple_bb (stmt)))
4226 error ("incorrect entry in label_to_block_map");
4230 uid = EH_LANDING_PAD_NR (decl);
4233 eh_landing_pad lp = get_eh_landing_pad_from_number (uid);
4234 if (decl != lp->post_landing_pad)
4236 error ("incorrect setting of landing pad number");
4244 /* Verify the GIMPLE statement STMT. Returns true if there is an
4245 error, otherwise false. */
4248 verify_gimple_stmt (gimple stmt)
4250 switch (gimple_code (stmt))
4253 return verify_gimple_assign (stmt);
4256 return verify_gimple_label (stmt);
4259 return verify_gimple_call (stmt);
4262 if (TREE_CODE_CLASS (gimple_cond_code (stmt)) != tcc_comparison)
4264 error ("invalid comparison code in gimple cond");
4267 if (!(!gimple_cond_true_label (stmt)
4268 || TREE_CODE (gimple_cond_true_label (stmt)) == LABEL_DECL)
4269 || !(!gimple_cond_false_label (stmt)
4270 || TREE_CODE (gimple_cond_false_label (stmt)) == LABEL_DECL))
4272 error ("invalid labels in gimple cond");
4276 return verify_gimple_comparison (boolean_type_node,
4277 gimple_cond_lhs (stmt),
4278 gimple_cond_rhs (stmt));
4281 return verify_gimple_goto (stmt);
4284 return verify_gimple_switch (stmt);
4287 return verify_gimple_return (stmt);
4292 case GIMPLE_TRANSACTION:
4293 return verify_gimple_transaction (stmt);
4295 /* Tuples that do not have tree operands. */
4297 case GIMPLE_PREDICT:
4299 case GIMPLE_EH_DISPATCH:
4300 case GIMPLE_EH_MUST_NOT_THROW:
4304 /* OpenMP directives are validated by the FE and never operated
4305 on by the optimizers. Furthermore, GIMPLE_OMP_FOR may contain
4306 non-gimple expressions when the main index variable has had
4307 its address taken. This does not affect the loop itself
4308 because the header of an GIMPLE_OMP_FOR is merely used to determine
4309 how to setup the parallel iteration. */
4313 return verify_gimple_debug (stmt);
4320 /* Verify the contents of a GIMPLE_PHI. Returns true if there is a problem,
4321 and false otherwise. */
4324 verify_gimple_phi (gimple phi)
4328 tree phi_result = gimple_phi_result (phi);
4333 error ("invalid PHI result");
4337 virtual_p = virtual_operand_p (phi_result);
4338 if (TREE_CODE (phi_result) != SSA_NAME
4340 && SSA_NAME_VAR (phi_result) != gimple_vop (cfun)))
4342 error ("invalid PHI result");
4346 for (i = 0; i < gimple_phi_num_args (phi); i++)
4348 tree t = gimple_phi_arg_def (phi, i);
4352 error ("missing PHI def");
4356 /* Addressable variables do have SSA_NAMEs but they
4357 are not considered gimple values. */
4358 else if ((TREE_CODE (t) == SSA_NAME
4359 && virtual_p != virtual_operand_p (t))
4361 && (TREE_CODE (t) != SSA_NAME
4362 || SSA_NAME_VAR (t) != gimple_vop (cfun)))
4364 && !is_gimple_val (t)))
4366 error ("invalid PHI argument");
4367 debug_generic_expr (t);
4370 #ifdef ENABLE_TYPES_CHECKING
4371 if (!useless_type_conversion_p (TREE_TYPE (phi_result), TREE_TYPE (t)))
4373 error ("incompatible types in PHI argument %u", i);
4374 debug_generic_stmt (TREE_TYPE (phi_result));
4375 debug_generic_stmt (TREE_TYPE (t));
4384 /* Verify the GIMPLE statements inside the sequence STMTS. */
4387 verify_gimple_in_seq_2 (gimple_seq stmts)
4389 gimple_stmt_iterator ittr;
4392 for (ittr = gsi_start (stmts); !gsi_end_p (ittr); gsi_next (&ittr))
4394 gimple stmt = gsi_stmt (ittr);
4396 switch (gimple_code (stmt))
4399 err |= verify_gimple_in_seq_2 (gimple_bind_body (stmt));
4403 err |= verify_gimple_in_seq_2 (gimple_try_eval (stmt));
4404 err |= verify_gimple_in_seq_2 (gimple_try_cleanup (stmt));
4407 case GIMPLE_EH_FILTER:
4408 err |= verify_gimple_in_seq_2 (gimple_eh_filter_failure (stmt));
4411 case GIMPLE_EH_ELSE:
4412 err |= verify_gimple_in_seq_2 (gimple_eh_else_n_body (stmt));
4413 err |= verify_gimple_in_seq_2 (gimple_eh_else_e_body (stmt));
4417 err |= verify_gimple_in_seq_2 (gimple_catch_handler (stmt));
4420 case GIMPLE_TRANSACTION:
4421 err |= verify_gimple_transaction (stmt);
4426 bool err2 = verify_gimple_stmt (stmt);
4428 debug_gimple_stmt (stmt);
4437 /* Verify the contents of a GIMPLE_TRANSACTION. Returns true if there
4438 is a problem, otherwise false. */
4441 verify_gimple_transaction (gimple stmt)
4443 tree lab = gimple_transaction_label (stmt);
4444 if (lab != NULL && TREE_CODE (lab) != LABEL_DECL)
4446 return verify_gimple_in_seq_2 (gimple_transaction_body (stmt));
4450 /* Verify the GIMPLE statements inside the statement list STMTS. */
4453 verify_gimple_in_seq (gimple_seq stmts)
4455 timevar_push (TV_TREE_STMT_VERIFY);
4456 if (verify_gimple_in_seq_2 (stmts))
4457 internal_error ("verify_gimple failed");
4458 timevar_pop (TV_TREE_STMT_VERIFY);
4461 /* Return true when the T can be shared. */
4464 tree_node_can_be_shared (tree t)
4466 if (IS_TYPE_OR_DECL_P (t)
4467 || is_gimple_min_invariant (t)
4468 || TREE_CODE (t) == SSA_NAME
4469 || t == error_mark_node
4470 || TREE_CODE (t) == IDENTIFIER_NODE)
4473 if (TREE_CODE (t) == CASE_LABEL_EXPR)
4476 while (((TREE_CODE (t) == ARRAY_REF || TREE_CODE (t) == ARRAY_RANGE_REF)
4477 && is_gimple_min_invariant (TREE_OPERAND (t, 1)))
4478 || TREE_CODE (t) == COMPONENT_REF
4479 || TREE_CODE (t) == REALPART_EXPR
4480 || TREE_CODE (t) == IMAGPART_EXPR)
4481 t = TREE_OPERAND (t, 0);
4489 /* Called via walk_gimple_stmt. Verify tree sharing. */
4492 verify_node_sharing (tree *tp, int *walk_subtrees, void *data)
4494 struct walk_stmt_info *wi = (struct walk_stmt_info *) data;
4495 struct pointer_set_t *visited = (struct pointer_set_t *) wi->info;
4497 if (tree_node_can_be_shared (*tp))
4499 *walk_subtrees = false;
4503 if (pointer_set_insert (visited, *tp))
4509 static bool eh_error_found;
4511 verify_eh_throw_stmt_node (void **slot, void *data)
4513 struct throw_stmt_node *node = (struct throw_stmt_node *)*slot;
4514 struct pointer_set_t *visited = (struct pointer_set_t *) data;
4516 if (!pointer_set_contains (visited, node->stmt))
4518 error ("dead STMT in EH table");
4519 debug_gimple_stmt (node->stmt);
4520 eh_error_found = true;
4525 /* Verify the GIMPLE statements in the CFG of FN. */
4528 verify_gimple_in_cfg (struct function *fn)
4532 struct pointer_set_t *visited, *visited_stmts;
4534 timevar_push (TV_TREE_STMT_VERIFY);
4535 visited = pointer_set_create ();
4536 visited_stmts = pointer_set_create ();
4538 FOR_EACH_BB_FN (bb, fn)
4540 gimple_stmt_iterator gsi;
4542 for (gsi = gsi_start_phis (bb); !gsi_end_p (gsi); gsi_next (&gsi))
4544 gimple phi = gsi_stmt (gsi);
4548 pointer_set_insert (visited_stmts, phi);
4550 if (gimple_bb (phi) != bb)
4552 error ("gimple_bb (phi) is set to a wrong basic block");
4556 err2 |= verify_gimple_phi (phi);
4558 for (i = 0; i < gimple_phi_num_args (phi); i++)
4560 tree arg = gimple_phi_arg_def (phi, i);
4561 tree addr = walk_tree (&arg, verify_node_sharing, visited, NULL);
4564 error ("incorrect sharing of tree nodes");
4565 debug_generic_expr (addr);
4571 debug_gimple_stmt (phi);
4575 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
4577 gimple stmt = gsi_stmt (gsi);
4579 struct walk_stmt_info wi;
4583 pointer_set_insert (visited_stmts, stmt);
4585 if (gimple_bb (stmt) != bb)
4587 error ("gimple_bb (stmt) is set to a wrong basic block");
4591 err2 |= verify_gimple_stmt (stmt);
4593 memset (&wi, 0, sizeof (wi));
4594 wi.info = (void *) visited;
4595 addr = walk_gimple_op (stmt, verify_node_sharing, &wi);
4598 error ("incorrect sharing of tree nodes");
4599 debug_generic_expr (addr);
4603 /* ??? Instead of not checking these stmts at all the walker
4604 should know its context via wi. */
4605 if (!is_gimple_debug (stmt)
4606 && !is_gimple_omp (stmt))
4608 memset (&wi, 0, sizeof (wi));
4609 addr = walk_gimple_op (stmt, verify_expr, &wi);
4612 debug_generic_expr (addr);
4613 inform (gimple_location (stmt), "in statement");
4618 /* If the statement is marked as part of an EH region, then it is
4619 expected that the statement could throw. Verify that when we
4620 have optimizations that simplify statements such that we prove
4621 that they cannot throw, that we update other data structures
4623 lp_nr = lookup_stmt_eh_lp (stmt);
4626 if (!stmt_could_throw_p (stmt))
4628 error ("statement marked for throw, but doesn%'t");
4632 && !gsi_one_before_end_p (gsi)
4633 && stmt_can_throw_internal (stmt))
4635 error ("statement marked for throw in middle of block");
4641 debug_gimple_stmt (stmt);
4646 eh_error_found = false;
4647 if (get_eh_throw_stmt_table (cfun))
4648 htab_traverse (get_eh_throw_stmt_table (cfun),
4649 verify_eh_throw_stmt_node,
4652 if (err || eh_error_found)
4653 internal_error ("verify_gimple failed");
4655 pointer_set_destroy (visited);
4656 pointer_set_destroy (visited_stmts);
4657 verify_histograms ();
4658 timevar_pop (TV_TREE_STMT_VERIFY);
4662 /* Verifies that the flow information is OK. */
4665 gimple_verify_flow_info (void)
4669 gimple_stmt_iterator gsi;
4674 if (ENTRY_BLOCK_PTR->il.gimple.seq || ENTRY_BLOCK_PTR->il.gimple.phi_nodes)
4676 error ("ENTRY_BLOCK has IL associated with it");
4680 if (EXIT_BLOCK_PTR->il.gimple.seq || EXIT_BLOCK_PTR->il.gimple.phi_nodes)
4682 error ("EXIT_BLOCK has IL associated with it");
4686 FOR_EACH_EDGE (e, ei, EXIT_BLOCK_PTR->preds)
4687 if (e->flags & EDGE_FALLTHRU)
4689 error ("fallthru to exit from bb %d", e->src->index);
4695 bool found_ctrl_stmt = false;
4699 /* Skip labels on the start of basic block. */
4700 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
4703 gimple prev_stmt = stmt;
4705 stmt = gsi_stmt (gsi);
4707 if (gimple_code (stmt) != GIMPLE_LABEL)
4710 label = gimple_label_label (stmt);
4711 if (prev_stmt && DECL_NONLOCAL (label))
4713 error ("nonlocal label ");
4714 print_generic_expr (stderr, label, 0);
4715 fprintf (stderr, " is not first in a sequence of labels in bb %d",
4720 if (prev_stmt && EH_LANDING_PAD_NR (label) != 0)
4722 error ("EH landing pad label ");
4723 print_generic_expr (stderr, label, 0);
4724 fprintf (stderr, " is not first in a sequence of labels in bb %d",
4729 if (label_to_block (label) != bb)
4732 print_generic_expr (stderr, label, 0);
4733 fprintf (stderr, " to block does not match in bb %d",
4738 if (decl_function_context (label) != current_function_decl)
4741 print_generic_expr (stderr, label, 0);
4742 fprintf (stderr, " has incorrect context in bb %d",
4748 /* Verify that body of basic block BB is free of control flow. */
4749 for (; !gsi_end_p (gsi); gsi_next (&gsi))
4751 gimple stmt = gsi_stmt (gsi);
4753 if (found_ctrl_stmt)
4755 error ("control flow in the middle of basic block %d",
4760 if (stmt_ends_bb_p (stmt))
4761 found_ctrl_stmt = true;
4763 if (gimple_code (stmt) == GIMPLE_LABEL)
4766 print_generic_expr (stderr, gimple_label_label (stmt), 0);
4767 fprintf (stderr, " in the middle of basic block %d", bb->index);
4772 gsi = gsi_last_bb (bb);
4773 if (gsi_end_p (gsi))
4776 stmt = gsi_stmt (gsi);
4778 if (gimple_code (stmt) == GIMPLE_LABEL)
4781 err |= verify_eh_edges (stmt);
4783 if (is_ctrl_stmt (stmt))
4785 FOR_EACH_EDGE (e, ei, bb->succs)
4786 if (e->flags & EDGE_FALLTHRU)
4788 error ("fallthru edge after a control statement in bb %d",
4794 if (gimple_code (stmt) != GIMPLE_COND)
4796 /* Verify that there are no edges with EDGE_TRUE/FALSE_FLAG set
4797 after anything else but if statement. */
4798 FOR_EACH_EDGE (e, ei, bb->succs)
4799 if (e->flags & (EDGE_TRUE_VALUE | EDGE_FALSE_VALUE))
4801 error ("true/false edge after a non-GIMPLE_COND in bb %d",
4807 switch (gimple_code (stmt))
4814 extract_true_false_edges_from_block (bb, &true_edge, &false_edge);
4818 || !(true_edge->flags & EDGE_TRUE_VALUE)
4819 || !(false_edge->flags & EDGE_FALSE_VALUE)
4820 || (true_edge->flags & (EDGE_FALLTHRU | EDGE_ABNORMAL))
4821 || (false_edge->flags & (EDGE_FALLTHRU | EDGE_ABNORMAL))
4822 || EDGE_COUNT (bb->succs) >= 3)
4824 error ("wrong outgoing edge flags at end of bb %d",
4832 if (simple_goto_p (stmt))
4834 error ("explicit goto at end of bb %d", bb->index);
4839 /* FIXME. We should double check that the labels in the
4840 destination blocks have their address taken. */
4841 FOR_EACH_EDGE (e, ei, bb->succs)
4842 if ((e->flags & (EDGE_FALLTHRU | EDGE_TRUE_VALUE
4843 | EDGE_FALSE_VALUE))
4844 || !(e->flags & EDGE_ABNORMAL))
4846 error ("wrong outgoing edge flags at end of bb %d",
4854 if (!gimple_call_builtin_p (stmt, BUILT_IN_RETURN))
4856 /* ... fallthru ... */
4858 if (!single_succ_p (bb)
4859 || (single_succ_edge (bb)->flags
4860 & (EDGE_FALLTHRU | EDGE_ABNORMAL
4861 | EDGE_TRUE_VALUE | EDGE_FALSE_VALUE)))
4863 error ("wrong outgoing edge flags at end of bb %d", bb->index);
4866 if (single_succ (bb) != EXIT_BLOCK_PTR)
4868 error ("return edge does not point to exit in bb %d",
4880 n = gimple_switch_num_labels (stmt);
4882 /* Mark all the destination basic blocks. */
4883 for (i = 0; i < n; ++i)
4885 tree lab = CASE_LABEL (gimple_switch_label (stmt, i));
4886 basic_block label_bb = label_to_block (lab);
4887 gcc_assert (!label_bb->aux || label_bb->aux == (void *)1);
4888 label_bb->aux = (void *)1;
4891 /* Verify that the case labels are sorted. */
4892 prev = gimple_switch_label (stmt, 0);
4893 for (i = 1; i < n; ++i)
4895 tree c = gimple_switch_label (stmt, i);
4898 error ("found default case not at the start of "
4904 && !tree_int_cst_lt (CASE_LOW (prev), CASE_LOW (c)))
4906 error ("case labels not sorted: ");
4907 print_generic_expr (stderr, prev, 0);
4908 fprintf (stderr," is greater than ");
4909 print_generic_expr (stderr, c, 0);
4910 fprintf (stderr," but comes before it.\n");
4915 /* VRP will remove the default case if it can prove it will
4916 never be executed. So do not verify there always exists
4917 a default case here. */
4919 FOR_EACH_EDGE (e, ei, bb->succs)
4923 error ("extra outgoing edge %d->%d",
4924 bb->index, e->dest->index);
4928 e->dest->aux = (void *)2;
4929 if ((e->flags & (EDGE_FALLTHRU | EDGE_ABNORMAL
4930 | EDGE_TRUE_VALUE | EDGE_FALSE_VALUE)))
4932 error ("wrong outgoing edge flags at end of bb %d",
4938 /* Check that we have all of them. */
4939 for (i = 0; i < n; ++i)
4941 tree lab = CASE_LABEL (gimple_switch_label (stmt, i));
4942 basic_block label_bb = label_to_block (lab);
4944 if (label_bb->aux != (void *)2)
4946 error ("missing edge %i->%i", bb->index, label_bb->index);
4951 FOR_EACH_EDGE (e, ei, bb->succs)
4952 e->dest->aux = (void *)0;
4956 case GIMPLE_EH_DISPATCH:
4957 err |= verify_eh_dispatch_edge (stmt);
4965 if (dom_info_state (CDI_DOMINATORS) >= DOM_NO_FAST_QUERY)
4966 verify_dominators (CDI_DOMINATORS);
4972 /* Updates phi nodes after creating a forwarder block joined
4973 by edge FALLTHRU. */
4976 gimple_make_forwarder_block (edge fallthru)
4980 basic_block dummy, bb;
4982 gimple_stmt_iterator gsi;
4984 dummy = fallthru->src;
4985 bb = fallthru->dest;
4987 if (single_pred_p (bb))
4990 /* If we redirected a branch we must create new PHI nodes at the
4992 for (gsi = gsi_start_phis (dummy); !gsi_end_p (gsi); gsi_next (&gsi))
4994 gimple phi, new_phi;
4996 phi = gsi_stmt (gsi);
4997 var = gimple_phi_result (phi);
4998 new_phi = create_phi_node (var, bb);
4999 gimple_phi_set_result (phi, copy_ssa_name (var, phi));
5000 add_phi_arg (new_phi, gimple_phi_result (phi), fallthru,
5004 /* Add the arguments we have stored on edges. */
5005 FOR_EACH_EDGE (e, ei, bb->preds)
5010 flush_pending_stmts (e);
5015 /* Return a non-special label in the head of basic block BLOCK.
5016 Create one if it doesn't exist. */
5019 gimple_block_label (basic_block bb)
5021 gimple_stmt_iterator i, s = gsi_start_bb (bb);
5026 for (i = s; !gsi_end_p (i); first = false, gsi_next (&i))
5028 stmt = gsi_stmt (i);
5029 if (gimple_code (stmt) != GIMPLE_LABEL)
5031 label = gimple_label_label (stmt);
5032 if (!DECL_NONLOCAL (label))
5035 gsi_move_before (&i, &s);
5040 label = create_artificial_label (UNKNOWN_LOCATION);
5041 stmt = gimple_build_label (label);
5042 gsi_insert_before (&s, stmt, GSI_NEW_STMT);
5047 /* Attempt to perform edge redirection by replacing a possibly complex
5048 jump instruction by a goto or by removing the jump completely.
5049 This can apply only if all edges now point to the same block. The
5050 parameters and return values are equivalent to
5051 redirect_edge_and_branch. */
5054 gimple_try_redirect_by_replacing_jump (edge e, basic_block target)
5056 basic_block src = e->src;
5057 gimple_stmt_iterator i;
5060 /* We can replace or remove a complex jump only when we have exactly
5062 if (EDGE_COUNT (src->succs) != 2
5063 /* Verify that all targets will be TARGET. Specifically, the
5064 edge that is not E must also go to TARGET. */
5065 || EDGE_SUCC (src, EDGE_SUCC (src, 0) == e)->dest != target)
5068 i = gsi_last_bb (src);
5072 stmt = gsi_stmt (i);
5074 if (gimple_code (stmt) == GIMPLE_COND || gimple_code (stmt) == GIMPLE_SWITCH)
5076 gsi_remove (&i, true);
5077 e = ssa_redirect_edge (e, target);
5078 e->flags = EDGE_FALLTHRU;
5086 /* Redirect E to DEST. Return NULL on failure. Otherwise, return the
5087 edge representing the redirected branch. */
5090 gimple_redirect_edge_and_branch (edge e, basic_block dest)
5092 basic_block bb = e->src;
5093 gimple_stmt_iterator gsi;
5097 if (e->flags & EDGE_ABNORMAL)
5100 if (e->dest == dest)
5103 if (e->flags & EDGE_EH)
5104 return redirect_eh_edge (e, dest);
5106 if (e->src != ENTRY_BLOCK_PTR)
5108 ret = gimple_try_redirect_by_replacing_jump (e, dest);
5113 gsi = gsi_last_bb (bb);
5114 stmt = gsi_end_p (gsi) ? NULL : gsi_stmt (gsi);
5116 switch (stmt ? gimple_code (stmt) : GIMPLE_ERROR_MARK)
5119 /* For COND_EXPR, we only need to redirect the edge. */
5123 /* No non-abnormal edges should lead from a non-simple goto, and
5124 simple ones should be represented implicitly. */
5129 tree label = gimple_block_label (dest);
5130 tree cases = get_cases_for_edge (e, stmt);
5132 /* If we have a list of cases associated with E, then use it
5133 as it's a lot faster than walking the entire case vector. */
5136 edge e2 = find_edge (e->src, dest);
5143 CASE_LABEL (cases) = label;
5144 cases = CASE_CHAIN (cases);
5147 /* If there was already an edge in the CFG, then we need
5148 to move all the cases associated with E to E2. */
5151 tree cases2 = get_cases_for_edge (e2, stmt);
5153 CASE_CHAIN (last) = CASE_CHAIN (cases2);
5154 CASE_CHAIN (cases2) = first;
5156 bitmap_set_bit (touched_switch_bbs, gimple_bb (stmt)->index);
5160 size_t i, n = gimple_switch_num_labels (stmt);
5162 for (i = 0; i < n; i++)
5164 tree elt = gimple_switch_label (stmt, i);
5165 if (label_to_block (CASE_LABEL (elt)) == e->dest)
5166 CASE_LABEL (elt) = label;
5174 int i, n = gimple_asm_nlabels (stmt);
5177 for (i = 0; i < n; ++i)
5179 tree cons = gimple_asm_label_op (stmt, i);
5180 if (label_to_block (TREE_VALUE (cons)) == e->dest)
5183 label = gimple_block_label (dest);
5184 TREE_VALUE (cons) = label;
5188 /* If we didn't find any label matching the former edge in the
5189 asm labels, we must be redirecting the fallthrough
5191 gcc_assert (label || (e->flags & EDGE_FALLTHRU));
5196 gsi_remove (&gsi, true);
5197 e->flags |= EDGE_FALLTHRU;
5200 case GIMPLE_OMP_RETURN:
5201 case GIMPLE_OMP_CONTINUE:
5202 case GIMPLE_OMP_SECTIONS_SWITCH:
5203 case GIMPLE_OMP_FOR:
5204 /* The edges from OMP constructs can be simply redirected. */
5207 case GIMPLE_EH_DISPATCH:
5208 if (!(e->flags & EDGE_FALLTHRU))
5209 redirect_eh_dispatch_edge (stmt, e, dest);
5212 case GIMPLE_TRANSACTION:
5213 /* The ABORT edge has a stored label associated with it, otherwise
5214 the edges are simply redirectable. */
5216 gimple_transaction_set_label (stmt, gimple_block_label (dest));
5220 /* Otherwise it must be a fallthru edge, and we don't need to
5221 do anything besides redirecting it. */
5222 gcc_assert (e->flags & EDGE_FALLTHRU);
5226 /* Update/insert PHI nodes as necessary. */
5228 /* Now update the edges in the CFG. */
5229 e = ssa_redirect_edge (e, dest);
5234 /* Returns true if it is possible to remove edge E by redirecting
5235 it to the destination of the other edge from E->src. */
5238 gimple_can_remove_branch_p (const_edge e)
5240 if (e->flags & (EDGE_ABNORMAL | EDGE_EH))
5246 /* Simple wrapper, as we can always redirect fallthru edges. */
5249 gimple_redirect_edge_and_branch_force (edge e, basic_block dest)
5251 e = gimple_redirect_edge_and_branch (e, dest);
5258 /* Splits basic block BB after statement STMT (but at least after the
5259 labels). If STMT is NULL, BB is split just after the labels. */
5262 gimple_split_block (basic_block bb, void *stmt)
5264 gimple_stmt_iterator gsi;
5265 gimple_stmt_iterator gsi_tgt;
5272 new_bb = create_empty_bb (bb);
5274 /* Redirect the outgoing edges. */
5275 new_bb->succs = bb->succs;
5277 FOR_EACH_EDGE (e, ei, new_bb->succs)
5280 if (stmt && gimple_code ((gimple) stmt) == GIMPLE_LABEL)
5283 /* Move everything from GSI to the new basic block. */
5284 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
5286 act = gsi_stmt (gsi);
5287 if (gimple_code (act) == GIMPLE_LABEL)
5300 if (gsi_end_p (gsi))
5303 /* Split the statement list - avoid re-creating new containers as this
5304 brings ugly quadratic memory consumption in the inliner.
5305 (We are still quadratic since we need to update stmt BB pointers,
5307 gsi_split_seq_before (&gsi, &list);
5308 set_bb_seq (new_bb, list);
5309 for (gsi_tgt = gsi_start (list);
5310 !gsi_end_p (gsi_tgt); gsi_next (&gsi_tgt))
5311 gimple_set_bb (gsi_stmt (gsi_tgt), new_bb);
5317 /* Moves basic block BB after block AFTER. */
5320 gimple_move_block_after (basic_block bb, basic_block after)
5322 if (bb->prev_bb == after)
5326 link_block (bb, after);
5332 /* Return TRUE if block BB has no executable statements, otherwise return
5336 gimple_empty_block_p (basic_block bb)
5338 /* BB must have no executable statements. */
5339 gimple_stmt_iterator gsi = gsi_after_labels (bb);
5342 if (gsi_end_p (gsi))
5344 if (is_gimple_debug (gsi_stmt (gsi)))
5345 gsi_next_nondebug (&gsi);
5346 return gsi_end_p (gsi);
5350 /* Split a basic block if it ends with a conditional branch and if the
5351 other part of the block is not empty. */
5354 gimple_split_block_before_cond_jump (basic_block bb)
5356 gimple last, split_point;
5357 gimple_stmt_iterator gsi = gsi_last_nondebug_bb (bb);
5358 if (gsi_end_p (gsi))
5360 last = gsi_stmt (gsi);
5361 if (gimple_code (last) != GIMPLE_COND
5362 && gimple_code (last) != GIMPLE_SWITCH)
5364 gsi_prev_nondebug (&gsi);
5365 split_point = gsi_stmt (gsi);
5366 return split_block (bb, split_point)->dest;
5370 /* Return true if basic_block can be duplicated. */
5373 gimple_can_duplicate_bb_p (const_basic_block bb ATTRIBUTE_UNUSED)
5378 /* Create a duplicate of the basic block BB. NOTE: This does not
5379 preserve SSA form. */
5382 gimple_duplicate_bb (basic_block bb)
5385 gimple_stmt_iterator gsi, gsi_tgt;
5386 gimple_seq phis = phi_nodes (bb);
5387 gimple phi, stmt, copy;
5389 new_bb = create_empty_bb (EXIT_BLOCK_PTR->prev_bb);
5391 /* Copy the PHI nodes. We ignore PHI node arguments here because
5392 the incoming edges have not been setup yet. */
5393 for (gsi = gsi_start (phis); !gsi_end_p (gsi); gsi_next (&gsi))
5395 phi = gsi_stmt (gsi);
5396 copy = create_phi_node (NULL_TREE, new_bb);
5397 create_new_def_for (gimple_phi_result (phi), copy,
5398 gimple_phi_result_ptr (copy));
5401 gsi_tgt = gsi_start_bb (new_bb);
5402 for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
5404 def_operand_p def_p;
5405 ssa_op_iter op_iter;
5408 stmt = gsi_stmt (gsi);
5409 if (gimple_code (stmt) == GIMPLE_LABEL)
5412 /* Don't duplicate label debug stmts. */
5413 if (gimple_debug_bind_p (stmt)
5414 && TREE_CODE (gimple_debug_bind_get_var (stmt))
5418 /* Create a new copy of STMT and duplicate STMT's virtual
5420 copy = gimple_copy (stmt);
5421 gsi_insert_after (&gsi_tgt, copy, GSI_NEW_STMT);
5423 maybe_duplicate_eh_stmt (copy, stmt);
5424 gimple_duplicate_stmt_histograms (cfun, copy, cfun, stmt);
5426 /* When copying around a stmt writing into a local non-user
5427 aggregate, make sure it won't share stack slot with other
5429 lhs = gimple_get_lhs (stmt);
5430 if (lhs && TREE_CODE (lhs) != SSA_NAME)
5432 tree base = get_base_address (lhs);
5434 && (TREE_CODE (base) == VAR_DECL
5435 || TREE_CODE (base) == RESULT_DECL)
5436 && DECL_IGNORED_P (base)
5437 && !TREE_STATIC (base)
5438 && !DECL_EXTERNAL (base)
5439 && (TREE_CODE (base) != VAR_DECL
5440 || !DECL_HAS_VALUE_EXPR_P (base)))
5441 DECL_NONSHAREABLE (base) = 1;
5444 /* Create new names for all the definitions created by COPY and
5445 add replacement mappings for each new name. */
5446 FOR_EACH_SSA_DEF_OPERAND (def_p, copy, op_iter, SSA_OP_ALL_DEFS)
5447 create_new_def_for (DEF_FROM_PTR (def_p), copy, def_p);
5453 /* Adds phi node arguments for edge E_COPY after basic block duplication. */
5456 add_phi_args_after_copy_edge (edge e_copy)
5458 basic_block bb, bb_copy = e_copy->src, dest;
5461 gimple phi, phi_copy;
5463 gimple_stmt_iterator psi, psi_copy;
5465 if (gimple_seq_empty_p (phi_nodes (e_copy->dest)))
5468 bb = bb_copy->flags & BB_DUPLICATED ? get_bb_original (bb_copy) : bb_copy;
5470 if (e_copy->dest->flags & BB_DUPLICATED)
5471 dest = get_bb_original (e_copy->dest);
5473 dest = e_copy->dest;
5475 e = find_edge (bb, dest);
5478 /* During loop unrolling the target of the latch edge is copied.
5479 In this case we are not looking for edge to dest, but to
5480 duplicated block whose original was dest. */
5481 FOR_EACH_EDGE (e, ei, bb->succs)
5483 if ((e->dest->flags & BB_DUPLICATED)
5484 && get_bb_original (e->dest) == dest)
5488 gcc_assert (e != NULL);
5491 for (psi = gsi_start_phis (e->dest),
5492 psi_copy = gsi_start_phis (e_copy->dest);
5494 gsi_next (&psi), gsi_next (&psi_copy))
5496 phi = gsi_stmt (psi);
5497 phi_copy = gsi_stmt (psi_copy);
5498 def = PHI_ARG_DEF_FROM_EDGE (phi, e);
5499 add_phi_arg (phi_copy, def, e_copy,
5500 gimple_phi_arg_location_from_edge (phi, e));
5505 /* Basic block BB_COPY was created by code duplication. Add phi node
5506 arguments for edges going out of BB_COPY. The blocks that were
5507 duplicated have BB_DUPLICATED set. */
5510 add_phi_args_after_copy_bb (basic_block bb_copy)
5515 FOR_EACH_EDGE (e_copy, ei, bb_copy->succs)
5517 add_phi_args_after_copy_edge (e_copy);
5521 /* Blocks in REGION_COPY array of length N_REGION were created by
5522 duplication of basic blocks. Add phi node arguments for edges
5523 going from these blocks. If E_COPY is not NULL, also add
5524 phi node arguments for its destination.*/
5527 add_phi_args_after_copy (basic_block *region_copy, unsigned n_region,
5532 for (i = 0; i < n_region; i++)
5533 region_copy[i]->flags |= BB_DUPLICATED;
5535 for (i = 0; i < n_region; i++)
5536 add_phi_args_after_copy_bb (region_copy[i]);
5538 add_phi_args_after_copy_edge (e_copy);
5540 for (i = 0; i < n_region; i++)
5541 region_copy[i]->flags &= ~BB_DUPLICATED;
5544 /* Duplicates a REGION (set of N_REGION basic blocks) with just a single
5545 important exit edge EXIT. By important we mean that no SSA name defined
5546 inside region is live over the other exit edges of the region. All entry
5547 edges to the region must go to ENTRY->dest. The edge ENTRY is redirected
5548 to the duplicate of the region. Dominance and loop information is
5549 updated, but not the SSA web. The new basic blocks are stored to
5550 REGION_COPY in the same order as they had in REGION, provided that
5551 REGION_COPY is not NULL.
5552 The function returns false if it is unable to copy the region,
5556 gimple_duplicate_sese_region (edge entry, edge exit,
5557 basic_block *region, unsigned n_region,
5558 basic_block *region_copy)
5561 bool free_region_copy = false, copying_header = false;
5562 struct loop *loop = entry->dest->loop_father;
5564 VEC (basic_block, heap) *doms;
5566 int total_freq = 0, entry_freq = 0;
5567 gcov_type total_count = 0, entry_count = 0;
5569 if (!can_copy_bbs_p (region, n_region))
5572 /* Some sanity checking. Note that we do not check for all possible
5573 missuses of the functions. I.e. if you ask to copy something weird,
5574 it will work, but the state of structures probably will not be
5576 for (i = 0; i < n_region; i++)
5578 /* We do not handle subloops, i.e. all the blocks must belong to the
5580 if (region[i]->loop_father != loop)
5583 if (region[i] != entry->dest
5584 && region[i] == loop->header)
5588 set_loop_copy (loop, loop);
5590 /* In case the function is used for loop header copying (which is the primary
5591 use), ensure that EXIT and its copy will be new latch and entry edges. */
5592 if (loop->header == entry->dest)
5594 copying_header = true;
5595 set_loop_copy (loop, loop_outer (loop));
5597 if (!dominated_by_p (CDI_DOMINATORS, loop->latch, exit->src))
5600 for (i = 0; i < n_region; i++)
5601 if (region[i] != exit->src
5602 && dominated_by_p (CDI_DOMINATORS, region[i], exit->src))
5608 region_copy = XNEWVEC (basic_block, n_region);
5609 free_region_copy = true;
5612 /* Record blocks outside the region that are dominated by something
5615 initialize_original_copy_tables ();
5617 doms = get_dominated_by_region (CDI_DOMINATORS, region, n_region);
5619 if (entry->dest->count)
5621 total_count = entry->dest->count;
5622 entry_count = entry->count;
5623 /* Fix up corner cases, to avoid division by zero or creation of negative
5625 if (entry_count > total_count)
5626 entry_count = total_count;
5630 total_freq = entry->dest->frequency;
5631 entry_freq = EDGE_FREQUENCY (entry);
5632 /* Fix up corner cases, to avoid division by zero or creation of negative
5634 if (total_freq == 0)
5636 else if (entry_freq > total_freq)
5637 entry_freq = total_freq;
5640 copy_bbs (region, n_region, region_copy, &exit, 1, &exit_copy, loop,
5641 split_edge_bb_loc (entry));
5644 scale_bbs_frequencies_gcov_type (region, n_region,
5645 total_count - entry_count,
5647 scale_bbs_frequencies_gcov_type (region_copy, n_region, entry_count,
5652 scale_bbs_frequencies_int (region, n_region, total_freq - entry_freq,
5654 scale_bbs_frequencies_int (region_copy, n_region, entry_freq, total_freq);
5659 loop->header = exit->dest;
5660 loop->latch = exit->src;
5663 /* Redirect the entry and add the phi node arguments. */
5664 redirected = redirect_edge_and_branch (entry, get_bb_copy (entry->dest));
5665 gcc_assert (redirected != NULL);
5666 flush_pending_stmts (entry);
5668 /* Concerning updating of dominators: We must recount dominators
5669 for entry block and its copy. Anything that is outside of the
5670 region, but was dominated by something inside needs recounting as
5672 set_immediate_dominator (CDI_DOMINATORS, entry->dest, entry->src);
5673 VEC_safe_push (basic_block, heap, doms, get_bb_original (entry->dest));
5674 iterate_fix_dominators (CDI_DOMINATORS, doms, false);
5675 VEC_free (basic_block, heap, doms);
5677 /* Add the other PHI node arguments. */
5678 add_phi_args_after_copy (region_copy, n_region, NULL);
5680 if (free_region_copy)
5683 free_original_copy_tables ();
5687 /* Checks if BB is part of the region defined by N_REGION BBS. */
5689 bb_part_of_region_p (basic_block bb, basic_block* bbs, unsigned n_region)
5693 for (n = 0; n < n_region; n++)
5701 /* Duplicates REGION consisting of N_REGION blocks. The new blocks
5702 are stored to REGION_COPY in the same order in that they appear
5703 in REGION, if REGION_COPY is not NULL. ENTRY is the entry to
5704 the region, EXIT an exit from it. The condition guarding EXIT
5705 is moved to ENTRY. Returns true if duplication succeeds, false
5731 gimple_duplicate_sese_tail (edge entry ATTRIBUTE_UNUSED, edge exit ATTRIBUTE_UNUSED,
5732 basic_block *region ATTRIBUTE_UNUSED, unsigned n_region ATTRIBUTE_UNUSED,
5733 basic_block *region_copy ATTRIBUTE_UNUSED)
5736 bool free_region_copy = false;
5737 struct loop *loop = exit->dest->loop_father;
5738 struct loop *orig_loop = entry->dest->loop_father;
5739 basic_block switch_bb, entry_bb, nentry_bb;
5740 VEC (basic_block, heap) *doms;
5741 int total_freq = 0, exit_freq = 0;
5742 gcov_type total_count = 0, exit_count = 0;
5743 edge exits[2], nexits[2], e;
5744 gimple_stmt_iterator gsi;
5747 basic_block exit_bb;
5748 gimple_stmt_iterator psi;
5751 struct loop *target, *aloop, *cloop;
5753 gcc_assert (EDGE_COUNT (exit->src->succs) == 2);
5755 exits[1] = EDGE_SUCC (exit->src, EDGE_SUCC (exit->src, 0) == exit);
5757 if (!can_copy_bbs_p (region, n_region))
5760 initialize_original_copy_tables ();
5761 set_loop_copy (orig_loop, loop);
5764 for (aloop = orig_loop->inner; aloop; aloop = aloop->next)
5766 if (bb_part_of_region_p (aloop->header, region, n_region))
5768 cloop = duplicate_loop (aloop, target);
5769 duplicate_subloops (aloop, cloop);
5775 region_copy = XNEWVEC (basic_block, n_region);
5776 free_region_copy = true;
5779 gcc_assert (!need_ssa_update_p (cfun));
5781 /* Record blocks outside the region that are dominated by something
5783 doms = get_dominated_by_region (CDI_DOMINATORS, region, n_region);
5785 if (exit->src->count)
5787 total_count = exit->src->count;
5788 exit_count = exit->count;
5789 /* Fix up corner cases, to avoid division by zero or creation of negative
5791 if (exit_count > total_count)
5792 exit_count = total_count;
5796 total_freq = exit->src->frequency;
5797 exit_freq = EDGE_FREQUENCY (exit);
5798 /* Fix up corner cases, to avoid division by zero or creation of negative
5800 if (total_freq == 0)
5802 if (exit_freq > total_freq)
5803 exit_freq = total_freq;
5806 copy_bbs (region, n_region, region_copy, exits, 2, nexits, orig_loop,
5807 split_edge_bb_loc (exit));
5810 scale_bbs_frequencies_gcov_type (region, n_region,
5811 total_count - exit_count,
5813 scale_bbs_frequencies_gcov_type (region_copy, n_region, exit_count,
5818 scale_bbs_frequencies_int (region, n_region, total_freq - exit_freq,
5820 scale_bbs_frequencies_int (region_copy, n_region, exit_freq, total_freq);
5823 /* Create the switch block, and put the exit condition to it. */
5824 entry_bb = entry->dest;
5825 nentry_bb = get_bb_copy (entry_bb);
5826 if (!last_stmt (entry->src)
5827 || !stmt_ends_bb_p (last_stmt (entry->src)))
5828 switch_bb = entry->src;
5830 switch_bb = split_edge (entry);
5831 set_immediate_dominator (CDI_DOMINATORS, nentry_bb, switch_bb);
5833 gsi = gsi_last_bb (switch_bb);
5834 cond_stmt = last_stmt (exit->src);
5835 gcc_assert (gimple_code (cond_stmt) == GIMPLE_COND);
5836 cond_stmt = gimple_copy (cond_stmt);
5838 gsi_insert_after (&gsi, cond_stmt, GSI_NEW_STMT);
5840 sorig = single_succ_edge (switch_bb);
5841 sorig->flags = exits[1]->flags;
5842 snew = make_edge (switch_bb, nentry_bb, exits[0]->flags);
5844 /* Register the new edge from SWITCH_BB in loop exit lists. */
5845 rescan_loop_exit (snew, true, false);
5847 /* Add the PHI node arguments. */
5848 add_phi_args_after_copy (region_copy, n_region, snew);
5850 /* Get rid of now superfluous conditions and associated edges (and phi node
5852 exit_bb = exit->dest;
5854 e = redirect_edge_and_branch (exits[0], exits[1]->dest);
5855 PENDING_STMT (e) = NULL;
5857 /* The latch of ORIG_LOOP was copied, and so was the backedge
5858 to the original header. We redirect this backedge to EXIT_BB. */
5859 for (i = 0; i < n_region; i++)
5860 if (get_bb_original (region_copy[i]) == orig_loop->latch)
5862 gcc_assert (single_succ_edge (region_copy[i]));
5863 e = redirect_edge_and_branch (single_succ_edge (region_copy[i]), exit_bb);
5864 PENDING_STMT (e) = NULL;
5865 for (psi = gsi_start_phis (exit_bb);
5869 phi = gsi_stmt (psi);
5870 def = PHI_ARG_DEF (phi, nexits[0]->dest_idx);
5871 add_phi_arg (phi, def, e, gimple_phi_arg_location_from_edge (phi, e));
5874 e = redirect_edge_and_branch (nexits[1], nexits[0]->dest);
5875 PENDING_STMT (e) = NULL;
5877 /* Anything that is outside of the region, but was dominated by something
5878 inside needs to update dominance info. */
5879 iterate_fix_dominators (CDI_DOMINATORS, doms, false);
5880 VEC_free (basic_block, heap, doms);
5881 /* Update the SSA web. */
5882 update_ssa (TODO_update_ssa);
5884 if (free_region_copy)
5887 free_original_copy_tables ();
5891 /* Add all the blocks dominated by ENTRY to the array BBS_P. Stop
5892 adding blocks when the dominator traversal reaches EXIT. This
5893 function silently assumes that ENTRY strictly dominates EXIT. */
5896 gather_blocks_in_sese_region (basic_block entry, basic_block exit,
5897 VEC(basic_block,heap) **bbs_p)
5901 for (son = first_dom_son (CDI_DOMINATORS, entry);
5903 son = next_dom_son (CDI_DOMINATORS, son))
5905 VEC_safe_push (basic_block, heap, *bbs_p, son);
5907 gather_blocks_in_sese_region (son, exit, bbs_p);
5911 /* Replaces *TP with a duplicate (belonging to function TO_CONTEXT).
5912 The duplicates are recorded in VARS_MAP. */
5915 replace_by_duplicate_decl (tree *tp, struct pointer_map_t *vars_map,
5918 tree t = *tp, new_t;
5919 struct function *f = DECL_STRUCT_FUNCTION (to_context);
5922 if (DECL_CONTEXT (t) == to_context)
5925 loc = pointer_map_contains (vars_map, t);
5929 loc = pointer_map_insert (vars_map, t);
5933 new_t = copy_var_decl (t, DECL_NAME (t), TREE_TYPE (t));
5934 add_local_decl (f, new_t);
5938 gcc_assert (TREE_CODE (t) == CONST_DECL);
5939 new_t = copy_node (t);
5941 DECL_CONTEXT (new_t) = to_context;
5946 new_t = (tree) *loc;
5952 /* Creates an ssa name in TO_CONTEXT equivalent to NAME.
5953 VARS_MAP maps old ssa names and var_decls to the new ones. */
5956 replace_ssa_name (tree name, struct pointer_map_t *vars_map,
5962 gcc_assert (!virtual_operand_p (name));
5964 loc = pointer_map_contains (vars_map, name);
5968 tree decl = SSA_NAME_VAR (name);
5971 replace_by_duplicate_decl (&decl, vars_map, to_context);
5972 new_name = make_ssa_name_fn (DECL_STRUCT_FUNCTION (to_context),
5973 decl, SSA_NAME_DEF_STMT (name));
5974 if (SSA_NAME_IS_DEFAULT_DEF (name))
5975 set_ssa_default_def (DECL_STRUCT_FUNCTION (to_context),
5979 new_name = copy_ssa_name_fn (DECL_STRUCT_FUNCTION (to_context),
5980 name, SSA_NAME_DEF_STMT (name));
5982 loc = pointer_map_insert (vars_map, name);
5986 new_name = (tree) *loc;
5997 struct pointer_map_t *vars_map;
5998 htab_t new_label_map;
5999 struct pointer_map_t *eh_map;
6003 /* Helper for move_block_to_fn. Set TREE_BLOCK in every expression
6004 contained in *TP if it has been ORIG_BLOCK previously and change the
6005 DECL_CONTEXT of every local variable referenced in *TP. */
6008 move_stmt_op (tree *tp, int *walk_subtrees, void *data)
6010 struct walk_stmt_info *wi = (struct walk_stmt_info *) data;
6011 struct move_stmt_d *p = (struct move_stmt_d *) wi->info;
6016 if (TREE_BLOCK (t) == p->orig_block
6017 || (p->orig_block == NULL_TREE
6018 && TREE_BLOCK (t) == NULL_TREE))
6019 TREE_SET_BLOCK (t, p->new_block);
6021 else if (DECL_P (t) || TREE_CODE (t) == SSA_NAME)
6023 if (TREE_CODE (t) == SSA_NAME)
6024 *tp = replace_ssa_name (t, p->vars_map, p->to_context);
6025 else if (TREE_CODE (t) == LABEL_DECL)
6027 if (p->new_label_map)
6029 struct tree_map in, *out;
6031 out = (struct tree_map *)
6032 htab_find_with_hash (p->new_label_map, &in, DECL_UID (t));
6037 DECL_CONTEXT (t) = p->to_context;
6039 else if (p->remap_decls_p)
6041 /* Replace T with its duplicate. T should no longer appear in the
6042 parent function, so this looks wasteful; however, it may appear
6043 in referenced_vars, and more importantly, as virtual operands of
6044 statements, and in alias lists of other variables. It would be
6045 quite difficult to expunge it from all those places. ??? It might
6046 suffice to do this for addressable variables. */
6047 if ((TREE_CODE (t) == VAR_DECL
6048 && !is_global_var (t))
6049 || TREE_CODE (t) == CONST_DECL)
6050 replace_by_duplicate_decl (tp, p->vars_map, p->to_context);
6054 else if (TYPE_P (t))
6060 /* Helper for move_stmt_r. Given an EH region number for the source
6061 function, map that to the duplicate EH regio number in the dest. */
6064 move_stmt_eh_region_nr (int old_nr, struct move_stmt_d *p)
6066 eh_region old_r, new_r;
6069 old_r = get_eh_region_from_number (old_nr);
6070 slot = pointer_map_contains (p->eh_map, old_r);
6071 new_r = (eh_region) *slot;
6073 return new_r->index;
6076 /* Similar, but operate on INTEGER_CSTs. */
6079 move_stmt_eh_region_tree_nr (tree old_t_nr, struct move_stmt_d *p)
6083 old_nr = tree_low_cst (old_t_nr, 0);
6084 new_nr = move_stmt_eh_region_nr (old_nr, p);
6086 return build_int_cst (integer_type_node, new_nr);
6089 /* Like move_stmt_op, but for gimple statements.
6091 Helper for move_block_to_fn. Set GIMPLE_BLOCK in every expression
6092 contained in the current statement in *GSI_P and change the
6093 DECL_CONTEXT of every local variable referenced in the current
6097 move_stmt_r (gimple_stmt_iterator *gsi_p, bool *handled_ops_p,
6098 struct walk_stmt_info *wi)
6100 struct move_stmt_d *p = (struct move_stmt_d *) wi->info;
6101 gimple stmt = gsi_stmt (*gsi_p);
6102 tree block = gimple_block (stmt);
6104 if (p->orig_block == NULL_TREE
6105 || block == p->orig_block
6106 || block == NULL_TREE)
6107 gimple_set_block (stmt, p->new_block);
6108 #ifdef ENABLE_CHECKING
6109 else if (block != p->new_block)
6111 while (block && block != p->orig_block)
6112 block = BLOCK_SUPERCONTEXT (block);
6117 switch (gimple_code (stmt))
6120 /* Remap the region numbers for __builtin_eh_{pointer,filter}. */
6122 tree r, fndecl = gimple_call_fndecl (stmt);
6123 if (fndecl && DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_NORMAL)
6124 switch (DECL_FUNCTION_CODE (fndecl))
6126 case BUILT_IN_EH_COPY_VALUES:
6127 r = gimple_call_arg (stmt, 1);
6128 r = move_stmt_eh_region_tree_nr (r, p);
6129 gimple_call_set_arg (stmt, 1, r);
6132 case BUILT_IN_EH_POINTER:
6133 case BUILT_IN_EH_FILTER:
6134 r = gimple_call_arg (stmt, 0);
6135 r = move_stmt_eh_region_tree_nr (r, p);
6136 gimple_call_set_arg (stmt, 0, r);
6147 int r = gimple_resx_region (stmt);
6148 r = move_stmt_eh_region_nr (r, p);
6149 gimple_resx_set_region (stmt, r);
6153 case GIMPLE_EH_DISPATCH:
6155 int r = gimple_eh_dispatch_region (stmt);
6156 r = move_stmt_eh_region_nr (r, p);
6157 gimple_eh_dispatch_set_region (stmt, r);
6161 case GIMPLE_OMP_RETURN:
6162 case GIMPLE_OMP_CONTINUE:
6165 if (is_gimple_omp (stmt))
6167 /* Do not remap variables inside OMP directives. Variables
6168 referenced in clauses and directive header belong to the
6169 parent function and should not be moved into the child
6171 bool save_remap_decls_p = p->remap_decls_p;
6172 p->remap_decls_p = false;
6173 *handled_ops_p = true;
6175 walk_gimple_seq_mod (gimple_omp_body_ptr (stmt), move_stmt_r,
6178 p->remap_decls_p = save_remap_decls_p;
6186 /* Move basic block BB from function CFUN to function DEST_FN. The
6187 block is moved out of the original linked list and placed after
6188 block AFTER in the new list. Also, the block is removed from the
6189 original array of blocks and placed in DEST_FN's array of blocks.
6190 If UPDATE_EDGE_COUNT_P is true, the edge counts on both CFGs is
6191 updated to reflect the moved edges.
6193 The local variables are remapped to new instances, VARS_MAP is used
6194 to record the mapping. */
6197 move_block_to_fn (struct function *dest_cfun, basic_block bb,
6198 basic_block after, bool update_edge_count_p,
6199 struct move_stmt_d *d)
6201 struct control_flow_graph *cfg;
6204 gimple_stmt_iterator si;
6205 unsigned old_len, new_len;
6207 /* Remove BB from dominance structures. */
6208 delete_from_dominance_info (CDI_DOMINATORS, bb);
6210 remove_bb_from_loops (bb);
6212 /* Link BB to the new linked list. */
6213 move_block_after (bb, after);
6215 /* Update the edge count in the corresponding flowgraphs. */
6216 if (update_edge_count_p)
6217 FOR_EACH_EDGE (e, ei, bb->succs)
6219 cfun->cfg->x_n_edges--;
6220 dest_cfun->cfg->x_n_edges++;
6223 /* Remove BB from the original basic block array. */
6224 VEC_replace (basic_block, cfun->cfg->x_basic_block_info, bb->index, NULL);
6225 cfun->cfg->x_n_basic_blocks--;
6227 /* Grow DEST_CFUN's basic block array if needed. */
6228 cfg = dest_cfun->cfg;
6229 cfg->x_n_basic_blocks++;
6230 if (bb->index >= cfg->x_last_basic_block)
6231 cfg->x_last_basic_block = bb->index + 1;
6233 old_len = VEC_length (basic_block, cfg->x_basic_block_info);
6234 if ((unsigned) cfg->x_last_basic_block >= old_len)
6236 new_len = cfg->x_last_basic_block + (cfg->x_last_basic_block + 3) / 4;
6237 VEC_safe_grow_cleared (basic_block, gc, cfg->x_basic_block_info,
6241 VEC_replace (basic_block, cfg->x_basic_block_info,
6244 /* Remap the variables in phi nodes. */
6245 for (si = gsi_start_phis (bb); !gsi_end_p (si); )
6247 gimple phi = gsi_stmt (si);
6249 tree op = PHI_RESULT (phi);
6252 if (virtual_operand_p (op))
6254 /* Remove the phi nodes for virtual operands (alias analysis will be
6255 run for the new function, anyway). */
6256 remove_phi_node (&si, true);
6260 SET_PHI_RESULT (phi,
6261 replace_ssa_name (op, d->vars_map, dest_cfun->decl));
6262 FOR_EACH_PHI_ARG (use, phi, oi, SSA_OP_USE)
6264 op = USE_FROM_PTR (use);
6265 if (TREE_CODE (op) == SSA_NAME)
6266 SET_USE (use, replace_ssa_name (op, d->vars_map, dest_cfun->decl));
6272 for (si = gsi_start_bb (bb); !gsi_end_p (si); gsi_next (&si))
6274 gimple stmt = gsi_stmt (si);
6275 struct walk_stmt_info wi;
6277 memset (&wi, 0, sizeof (wi));
6279 walk_gimple_stmt (&si, move_stmt_r, move_stmt_op, &wi);
6281 if (gimple_code (stmt) == GIMPLE_LABEL)
6283 tree label = gimple_label_label (stmt);
6284 int uid = LABEL_DECL_UID (label);
6286 gcc_assert (uid > -1);
6288 old_len = VEC_length (basic_block, cfg->x_label_to_block_map);
6289 if (old_len <= (unsigned) uid)
6291 new_len = 3 * uid / 2 + 1;
6292 VEC_safe_grow_cleared (basic_block, gc,
6293 cfg->x_label_to_block_map, new_len);
6296 VEC_replace (basic_block, cfg->x_label_to_block_map, uid, bb);
6297 VEC_replace (basic_block, cfun->cfg->x_label_to_block_map, uid, NULL);
6299 gcc_assert (DECL_CONTEXT (label) == dest_cfun->decl);
6301 if (uid >= dest_cfun->cfg->last_label_uid)
6302 dest_cfun->cfg->last_label_uid = uid + 1;
6305 maybe_duplicate_eh_stmt_fn (dest_cfun, stmt, cfun, stmt, d->eh_map, 0);
6306 remove_stmt_from_eh_lp_fn (cfun, stmt);
6308 gimple_duplicate_stmt_histograms (dest_cfun, stmt, cfun, stmt);
6309 gimple_remove_stmt_histograms (cfun, stmt);
6311 /* We cannot leave any operands allocated from the operand caches of
6312 the current function. */
6313 free_stmt_operands (stmt);
6314 push_cfun (dest_cfun);
6319 FOR_EACH_EDGE (e, ei, bb->succs)
6320 if (e->goto_locus != UNKNOWN_LOCATION)
6322 tree block = LOCATION_BLOCK (e->goto_locus);
6323 if (d->orig_block == NULL_TREE
6324 || block == d->orig_block)
6325 e->goto_locus = d->new_block ?
6326 COMBINE_LOCATION_DATA (line_table, e->goto_locus, d->new_block) :
6327 LOCATION_LOCUS (e->goto_locus);
6328 #ifdef ENABLE_CHECKING
6329 else if (block != d->new_block)
6331 while (block && block != d->orig_block)
6332 block = BLOCK_SUPERCONTEXT (block);
6339 /* Examine the statements in BB (which is in SRC_CFUN); find and return
6340 the outermost EH region. Use REGION as the incoming base EH region. */
6343 find_outermost_region_in_block (struct function *src_cfun,
6344 basic_block bb, eh_region region)
6346 gimple_stmt_iterator si;
6348 for (si = gsi_start_bb (bb); !gsi_end_p (si); gsi_next (&si))
6350 gimple stmt = gsi_stmt (si);
6351 eh_region stmt_region;
6354 lp_nr = lookup_stmt_eh_lp_fn (src_cfun, stmt);
6355 stmt_region = get_eh_region_from_lp_number_fn (src_cfun, lp_nr);
6359 region = stmt_region;
6360 else if (stmt_region != region)
6362 region = eh_region_outermost (src_cfun, stmt_region, region);
6363 gcc_assert (region != NULL);
6372 new_label_mapper (tree decl, void *data)
6374 htab_t hash = (htab_t) data;
6378 gcc_assert (TREE_CODE (decl) == LABEL_DECL);
6380 m = XNEW (struct tree_map);
6381 m->hash = DECL_UID (decl);
6382 m->base.from = decl;
6383 m->to = create_artificial_label (UNKNOWN_LOCATION);
6384 LABEL_DECL_UID (m->to) = LABEL_DECL_UID (decl);
6385 if (LABEL_DECL_UID (m->to) >= cfun->cfg->last_label_uid)
6386 cfun->cfg->last_label_uid = LABEL_DECL_UID (m->to) + 1;
6388 slot = htab_find_slot_with_hash (hash, m, m->hash, INSERT);
6389 gcc_assert (*slot == NULL);
6396 /* Change DECL_CONTEXT of all BLOCK_VARS in block, including
6400 replace_block_vars_by_duplicates (tree block, struct pointer_map_t *vars_map,
6405 for (tp = &BLOCK_VARS (block); *tp; tp = &DECL_CHAIN (*tp))
6408 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != CONST_DECL)
6410 replace_by_duplicate_decl (&t, vars_map, to_context);
6413 if (TREE_CODE (*tp) == VAR_DECL && DECL_HAS_VALUE_EXPR_P (*tp))
6415 SET_DECL_VALUE_EXPR (t, DECL_VALUE_EXPR (*tp));
6416 DECL_HAS_VALUE_EXPR_P (t) = 1;
6418 DECL_CHAIN (t) = DECL_CHAIN (*tp);
6423 for (block = BLOCK_SUBBLOCKS (block); block; block = BLOCK_CHAIN (block))
6424 replace_block_vars_by_duplicates (block, vars_map, to_context);
6427 /* Move a single-entry, single-exit region delimited by ENTRY_BB and
6428 EXIT_BB to function DEST_CFUN. The whole region is replaced by a
6429 single basic block in the original CFG and the new basic block is
6430 returned. DEST_CFUN must not have a CFG yet.
6432 Note that the region need not be a pure SESE region. Blocks inside
6433 the region may contain calls to abort/exit. The only restriction
6434 is that ENTRY_BB should be the only entry point and it must
6437 Change TREE_BLOCK of all statements in ORIG_BLOCK to the new
6438 functions outermost BLOCK, move all subblocks of ORIG_BLOCK
6439 to the new function.
6441 All local variables referenced in the region are assumed to be in
6442 the corresponding BLOCK_VARS and unexpanded variable lists
6443 associated with DEST_CFUN. */
6446 move_sese_region_to_fn (struct function *dest_cfun, basic_block entry_bb,
6447 basic_block exit_bb, tree orig_block)
6449 VEC(basic_block,heap) *bbs, *dom_bbs;
6450 basic_block dom_entry = get_immediate_dominator (CDI_DOMINATORS, entry_bb);
6451 basic_block after, bb, *entry_pred, *exit_succ, abb;
6452 struct function *saved_cfun = cfun;
6453 int *entry_flag, *exit_flag;
6454 unsigned *entry_prob, *exit_prob;
6455 unsigned i, num_entry_edges, num_exit_edges;
6458 htab_t new_label_map;
6459 struct pointer_map_t *vars_map, *eh_map;
6460 struct loop *loop = entry_bb->loop_father;
6461 struct move_stmt_d d;
6463 /* If ENTRY does not strictly dominate EXIT, this cannot be an SESE
6465 gcc_assert (entry_bb != exit_bb
6467 || dominated_by_p (CDI_DOMINATORS, exit_bb, entry_bb)));
6469 /* Collect all the blocks in the region. Manually add ENTRY_BB
6470 because it won't be added by dfs_enumerate_from. */
6472 VEC_safe_push (basic_block, heap, bbs, entry_bb);
6473 gather_blocks_in_sese_region (entry_bb, exit_bb, &bbs);
6475 /* The blocks that used to be dominated by something in BBS will now be
6476 dominated by the new block. */
6477 dom_bbs = get_dominated_by_region (CDI_DOMINATORS,
6478 VEC_address (basic_block, bbs),
6479 VEC_length (basic_block, bbs));
6481 /* Detach ENTRY_BB and EXIT_BB from CFUN->CFG. We need to remember
6482 the predecessor edges to ENTRY_BB and the successor edges to
6483 EXIT_BB so that we can re-attach them to the new basic block that
6484 will replace the region. */
6485 num_entry_edges = EDGE_COUNT (entry_bb->preds);
6486 entry_pred = XNEWVEC (basic_block, num_entry_edges);
6487 entry_flag = XNEWVEC (int, num_entry_edges);
6488 entry_prob = XNEWVEC (unsigned, num_entry_edges);
6490 for (ei = ei_start (entry_bb->preds); (e = ei_safe_edge (ei)) != NULL;)
6492 entry_prob[i] = e->probability;
6493 entry_flag[i] = e->flags;
6494 entry_pred[i++] = e->src;
6500 num_exit_edges = EDGE_COUNT (exit_bb->succs);
6501 exit_succ = XNEWVEC (basic_block, num_exit_edges);
6502 exit_flag = XNEWVEC (int, num_exit_edges);
6503 exit_prob = XNEWVEC (unsigned, num_exit_edges);
6505 for (ei = ei_start (exit_bb->succs); (e = ei_safe_edge (ei)) != NULL;)
6507 exit_prob[i] = e->probability;
6508 exit_flag[i] = e->flags;
6509 exit_succ[i++] = e->dest;
6521 /* Switch context to the child function to initialize DEST_FN's CFG. */
6522 gcc_assert (dest_cfun->cfg == NULL);
6523 push_cfun (dest_cfun);
6525 init_empty_tree_cfg ();
6527 /* Initialize EH information for the new function. */
6529 new_label_map = NULL;
6532 eh_region region = NULL;
6534 FOR_EACH_VEC_ELT (basic_block, bbs, i, bb)
6535 region = find_outermost_region_in_block (saved_cfun, bb, region);
6537 init_eh_for_function ();
6540 new_label_map = htab_create (17, tree_map_hash, tree_map_eq, free);
6541 eh_map = duplicate_eh_regions (saved_cfun, region, 0,
6542 new_label_mapper, new_label_map);
6548 /* Move blocks from BBS into DEST_CFUN. */
6549 gcc_assert (VEC_length (basic_block, bbs) >= 2);
6550 after = dest_cfun->cfg->x_entry_block_ptr;
6551 vars_map = pointer_map_create ();
6553 memset (&d, 0, sizeof (d));
6554 d.orig_block = orig_block;
6555 d.new_block = DECL_INITIAL (dest_cfun->decl);
6556 d.from_context = cfun->decl;
6557 d.to_context = dest_cfun->decl;
6558 d.vars_map = vars_map;
6559 d.new_label_map = new_label_map;
6561 d.remap_decls_p = true;
6563 FOR_EACH_VEC_ELT (basic_block, bbs, i, bb)
6565 /* No need to update edge counts on the last block. It has
6566 already been updated earlier when we detached the region from
6567 the original CFG. */
6568 move_block_to_fn (dest_cfun, bb, after, bb != exit_bb, &d);
6572 /* Rewire BLOCK_SUBBLOCKS of orig_block. */
6576 gcc_assert (BLOCK_SUBBLOCKS (DECL_INITIAL (dest_cfun->decl))
6578 BLOCK_SUBBLOCKS (DECL_INITIAL (dest_cfun->decl))
6579 = BLOCK_SUBBLOCKS (orig_block);
6580 for (block = BLOCK_SUBBLOCKS (orig_block);
6581 block; block = BLOCK_CHAIN (block))
6582 BLOCK_SUPERCONTEXT (block) = DECL_INITIAL (dest_cfun->decl);
6583 BLOCK_SUBBLOCKS (orig_block) = NULL_TREE;
6586 replace_block_vars_by_duplicates (DECL_INITIAL (dest_cfun->decl),
6587 vars_map, dest_cfun->decl);
6590 htab_delete (new_label_map);
6592 pointer_map_destroy (eh_map);
6593 pointer_map_destroy (vars_map);
6595 /* Rewire the entry and exit blocks. The successor to the entry
6596 block turns into the successor of DEST_FN's ENTRY_BLOCK_PTR in
6597 the child function. Similarly, the predecessor of DEST_FN's
6598 EXIT_BLOCK_PTR turns into the predecessor of EXIT_BLOCK_PTR. We
6599 need to switch CFUN between DEST_CFUN and SAVED_CFUN so that the
6600 various CFG manipulation function get to the right CFG.
6602 FIXME, this is silly. The CFG ought to become a parameter to
6604 push_cfun (dest_cfun);
6605 make_edge (ENTRY_BLOCK_PTR, entry_bb, EDGE_FALLTHRU);
6607 make_edge (exit_bb, EXIT_BLOCK_PTR, 0);
6610 /* Back in the original function, the SESE region has disappeared,
6611 create a new basic block in its place. */
6612 bb = create_empty_bb (entry_pred[0]);
6614 add_bb_to_loop (bb, loop);
6615 for (i = 0; i < num_entry_edges; i++)
6617 e = make_edge (entry_pred[i], bb, entry_flag[i]);
6618 e->probability = entry_prob[i];
6621 for (i = 0; i < num_exit_edges; i++)
6623 e = make_edge (bb, exit_succ[i], exit_flag[i]);
6624 e->probability = exit_prob[i];
6627 set_immediate_dominator (CDI_DOMINATORS, bb, dom_entry);
6628 FOR_EACH_VEC_ELT (basic_block, dom_bbs, i, abb)
6629 set_immediate_dominator (CDI_DOMINATORS, abb, bb);
6630 VEC_free (basic_block, heap, dom_bbs);
6641 VEC_free (basic_block, heap, bbs);
6647 /* Dump FUNCTION_DECL FN to file FILE using FLAGS (see TDF_* in tree-pass.h)
6651 dump_function_to_file (tree fndecl, FILE *file, int flags)
6653 tree arg, var, old_current_fndecl = current_function_decl;
6654 struct function *dsf;
6655 bool ignore_topmost_bind = false, any_var = false;
6658 bool tmclone = (TREE_CODE (fndecl) == FUNCTION_DECL
6659 && decl_is_tm_clone (fndecl));
6660 struct function *fun = DECL_STRUCT_FUNCTION (fndecl);
6662 current_function_decl = fndecl;
6663 fprintf (file, "%s %s(", function_name (fun), tmclone ? "[tm-clone] " : "");
6665 arg = DECL_ARGUMENTS (fndecl);
6668 print_generic_expr (file, TREE_TYPE (arg), dump_flags);
6669 fprintf (file, " ");
6670 print_generic_expr (file, arg, dump_flags);
6671 if (flags & TDF_VERBOSE)
6672 print_node (file, "", arg, 4);
6673 if (DECL_CHAIN (arg))
6674 fprintf (file, ", ");
6675 arg = DECL_CHAIN (arg);
6677 fprintf (file, ")\n");
6679 if (flags & TDF_VERBOSE)
6680 print_node (file, "", fndecl, 2);
6682 dsf = DECL_STRUCT_FUNCTION (fndecl);
6683 if (dsf && (flags & TDF_EH))
6684 dump_eh_tree (file, dsf);
6686 if (flags & TDF_RAW && !gimple_has_body_p (fndecl))
6688 dump_node (fndecl, TDF_SLIM | flags, file);
6689 current_function_decl = old_current_fndecl;
6693 /* When GIMPLE is lowered, the variables are no longer available in
6694 BIND_EXPRs, so display them separately. */
6695 if (fun && fun->decl == fndecl && (fun->curr_properties & PROP_gimple_lcf))
6698 ignore_topmost_bind = true;
6700 fprintf (file, "{\n");
6701 if (!VEC_empty (tree, fun->local_decls))
6702 FOR_EACH_LOCAL_DECL (fun, ix, var)
6704 print_generic_decl (file, var, flags);
6705 if (flags & TDF_VERBOSE)
6706 print_node (file, "", var, 4);
6707 fprintf (file, "\n");
6711 if (gimple_in_ssa_p (cfun))
6712 for (ix = 1; ix < num_ssa_names; ++ix)
6714 tree name = ssa_name (ix);
6715 if (name && !SSA_NAME_VAR (name))
6717 fprintf (file, " ");
6718 print_generic_expr (file, TREE_TYPE (name), flags);
6719 fprintf (file, " ");
6720 print_generic_expr (file, name, flags);
6721 fprintf (file, ";\n");
6728 if (fun && fun->decl == fndecl && fun->cfg
6729 && basic_block_info_for_function (fun))
6731 /* If the CFG has been built, emit a CFG-based dump. */
6732 if (!ignore_topmost_bind)
6733 fprintf (file, "{\n");
6735 if (any_var && n_basic_blocks_for_function (fun))
6736 fprintf (file, "\n");
6738 FOR_EACH_BB_FN (bb, fun)
6739 dump_bb (file, bb, 2, flags | TDF_COMMENT);
6741 fprintf (file, "}\n");
6743 else if (DECL_SAVED_TREE (fndecl) == NULL)
6745 /* The function is now in GIMPLE form but the CFG has not been
6746 built yet. Emit the single sequence of GIMPLE statements
6747 that make up its body. */
6748 gimple_seq body = gimple_body (fndecl);
6750 if (gimple_seq_first_stmt (body)
6751 && gimple_seq_first_stmt (body) == gimple_seq_last_stmt (body)
6752 && gimple_code (gimple_seq_first_stmt (body)) == GIMPLE_BIND)
6753 print_gimple_seq (file, body, 0, flags);
6756 if (!ignore_topmost_bind)
6757 fprintf (file, "{\n");
6760 fprintf (file, "\n");
6762 print_gimple_seq (file, body, 2, flags);
6763 fprintf (file, "}\n");
6770 /* Make a tree based dump. */
6771 chain = DECL_SAVED_TREE (fndecl);
6772 if (chain && TREE_CODE (chain) == BIND_EXPR)
6774 if (ignore_topmost_bind)
6776 chain = BIND_EXPR_BODY (chain);
6784 if (!ignore_topmost_bind)
6785 fprintf (file, "{\n");
6790 fprintf (file, "\n");
6792 print_generic_stmt_indented (file, chain, flags, indent);
6793 if (ignore_topmost_bind)
6794 fprintf (file, "}\n");
6797 if (flags & TDF_ENUMERATE_LOCALS)
6798 dump_enumerated_decls (file, flags);
6799 fprintf (file, "\n\n");
6801 current_function_decl = old_current_fndecl;
6804 /* Dump FUNCTION_DECL FN to stderr using FLAGS (see TDF_* in tree.h) */
6807 debug_function (tree fn, int flags)
6809 dump_function_to_file (fn, stderr, flags);
6813 /* Print on FILE the indexes for the predecessors of basic_block BB. */
6816 print_pred_bbs (FILE *file, basic_block bb)
6821 FOR_EACH_EDGE (e, ei, bb->preds)
6822 fprintf (file, "bb_%d ", e->src->index);
6826 /* Print on FILE the indexes for the successors of basic_block BB. */
6829 print_succ_bbs (FILE *file, basic_block bb)
6834 FOR_EACH_EDGE (e, ei, bb->succs)
6835 fprintf (file, "bb_%d ", e->dest->index);
6838 /* Print to FILE the basic block BB following the VERBOSITY level. */
6841 print_loops_bb (FILE *file, basic_block bb, int indent, int verbosity)
6843 char *s_indent = (char *) alloca ((size_t) indent + 1);
6844 memset ((void *) s_indent, ' ', (size_t) indent);
6845 s_indent[indent] = '\0';
6847 /* Print basic_block's header. */
6850 fprintf (file, "%s bb_%d (preds = {", s_indent, bb->index);
6851 print_pred_bbs (file, bb);
6852 fprintf (file, "}, succs = {");
6853 print_succ_bbs (file, bb);
6854 fprintf (file, "})\n");
6857 /* Print basic_block's body. */
6860 fprintf (file, "%s {\n", s_indent);
6861 dump_bb (file, bb, indent + 4, TDF_VOPS|TDF_MEMSYMS);
6862 fprintf (file, "%s }\n", s_indent);
6866 static void print_loop_and_siblings (FILE *, struct loop *, int, int);
6868 /* Pretty print LOOP on FILE, indented INDENT spaces. Following
6869 VERBOSITY level this outputs the contents of the loop, or just its
6873 print_loop (FILE *file, struct loop *loop, int indent, int verbosity)
6881 s_indent = (char *) alloca ((size_t) indent + 1);
6882 memset ((void *) s_indent, ' ', (size_t) indent);
6883 s_indent[indent] = '\0';
6885 /* Print loop's header. */
6886 fprintf (file, "%sloop_%d (", s_indent, loop->num);
6888 fprintf (file, "header = %d", loop->header->index);
6891 fprintf (file, "deleted)\n");
6895 fprintf (file, ", latch = %d", loop->latch->index);
6897 fprintf (file, ", multiple latches");
6898 fprintf (file, ", niter = ");
6899 print_generic_expr (file, loop->nb_iterations, 0);
6901 if (loop->any_upper_bound)
6903 fprintf (file, ", upper_bound = ");
6904 dump_double_int (file, loop->nb_iterations_upper_bound, true);
6907 if (loop->any_estimate)
6909 fprintf (file, ", estimate = ");
6910 dump_double_int (file, loop->nb_iterations_estimate, true);
6912 fprintf (file, ")\n");
6914 /* Print loop's body. */
6917 fprintf (file, "%s{\n", s_indent);
6919 if (bb->loop_father == loop)
6920 print_loops_bb (file, bb, indent, verbosity);
6922 print_loop_and_siblings (file, loop->inner, indent + 2, verbosity);
6923 fprintf (file, "%s}\n", s_indent);
6927 /* Print the LOOP and its sibling loops on FILE, indented INDENT
6928 spaces. Following VERBOSITY level this outputs the contents of the
6929 loop, or just its structure. */
6932 print_loop_and_siblings (FILE *file, struct loop *loop, int indent, int verbosity)
6937 print_loop (file, loop, indent, verbosity);
6938 print_loop_and_siblings (file, loop->next, indent, verbosity);
6941 /* Follow a CFG edge from the entry point of the program, and on entry
6942 of a loop, pretty print the loop structure on FILE. */
6945 print_loops (FILE *file, int verbosity)
6949 bb = ENTRY_BLOCK_PTR;
6950 if (bb && bb->loop_father)
6951 print_loop_and_siblings (file, bb->loop_father, 0, verbosity);
6955 /* Debugging loops structure at tree level, at some VERBOSITY level. */
6958 debug_loops (int verbosity)
6960 print_loops (stderr, verbosity);
6963 /* Print on stderr the code of LOOP, at some VERBOSITY level. */
6966 debug_loop (struct loop *loop, int verbosity)
6968 print_loop (stderr, loop, 0, verbosity);
6971 /* Print on stderr the code of loop number NUM, at some VERBOSITY
6975 debug_loop_num (unsigned num, int verbosity)
6977 debug_loop (get_loop (num), verbosity);
6980 /* Return true if BB ends with a call, possibly followed by some
6981 instructions that must stay with the call. Return false,
6985 gimple_block_ends_with_call_p (basic_block bb)
6987 gimple_stmt_iterator gsi = gsi_last_nondebug_bb (bb);
6988 return !gsi_end_p (gsi) && is_gimple_call (gsi_stmt (gsi));
6992 /* Return true if BB ends with a conditional branch. Return false,
6996 gimple_block_ends_with_condjump_p (const_basic_block bb)
6998 gimple stmt = last_stmt (CONST_CAST_BB (bb));
6999 return (stmt && gimple_code (stmt) == GIMPLE_COND);
7003 /* Return true if we need to add fake edge to exit at statement T.
7004 Helper function for gimple_flow_call_edges_add. */
7007 need_fake_edge_p (gimple t)
7009 tree fndecl = NULL_TREE;
7012 /* NORETURN and LONGJMP calls already have an edge to exit.
7013 CONST and PURE calls do not need one.
7014 We don't currently check for CONST and PURE here, although
7015 it would be a good idea, because those attributes are
7016 figured out from the RTL in mark_constant_function, and
7017 the counter incrementation code from -fprofile-arcs
7018 leads to different results from -fbranch-probabilities. */
7019 if (is_gimple_call (t))
7021 fndecl = gimple_call_fndecl (t);
7022 call_flags = gimple_call_flags (t);
7025 if (is_gimple_call (t)
7027 && DECL_BUILT_IN (fndecl)
7028 && (call_flags & ECF_NOTHROW)
7029 && !(call_flags & ECF_RETURNS_TWICE)
7030 /* fork() doesn't really return twice, but the effect of
7031 wrapping it in __gcov_fork() which calls __gcov_flush()
7032 and clears the counters before forking has the same
7033 effect as returning twice. Force a fake edge. */
7034 && !(DECL_BUILT_IN_CLASS (fndecl) == BUILT_IN_NORMAL
7035 && DECL_FUNCTION_CODE (fndecl) == BUILT_IN_FORK))
7038 if (is_gimple_call (t))
7044 if (!(call_flags & ECF_NORETURN))
7048 FOR_EACH_EDGE (e, ei, bb->succs)
7049 if ((e->flags & EDGE_FAKE) == 0)
7053 if (gimple_code (t) == GIMPLE_ASM
7054 && (gimple_asm_volatile_p (t) || gimple_asm_input_p (t)))
7061 /* Add fake edges to the function exit for any non constant and non
7062 noreturn calls (or noreturn calls with EH/abnormal edges),
7063 volatile inline assembly in the bitmap of blocks specified by BLOCKS
7064 or to the whole CFG if BLOCKS is zero. Return the number of blocks
7067 The goal is to expose cases in which entering a basic block does
7068 not imply that all subsequent instructions must be executed. */
7071 gimple_flow_call_edges_add (sbitmap blocks)
7074 int blocks_split = 0;
7075 int last_bb = last_basic_block;
7076 bool check_last_block = false;
7078 if (n_basic_blocks == NUM_FIXED_BLOCKS)
7082 check_last_block = true;
7084 check_last_block = TEST_BIT (blocks, EXIT_BLOCK_PTR->prev_bb->index);
7086 /* In the last basic block, before epilogue generation, there will be
7087 a fallthru edge to EXIT. Special care is required if the last insn
7088 of the last basic block is a call because make_edge folds duplicate
7089 edges, which would result in the fallthru edge also being marked
7090 fake, which would result in the fallthru edge being removed by
7091 remove_fake_edges, which would result in an invalid CFG.
7093 Moreover, we can't elide the outgoing fake edge, since the block
7094 profiler needs to take this into account in order to solve the minimal
7095 spanning tree in the case that the call doesn't return.
7097 Handle this by adding a dummy instruction in a new last basic block. */
7098 if (check_last_block)
7100 basic_block bb = EXIT_BLOCK_PTR->prev_bb;
7101 gimple_stmt_iterator gsi = gsi_last_nondebug_bb (bb);
7104 if (!gsi_end_p (gsi))
7107 if (t && need_fake_edge_p (t))
7111 e = find_edge (bb, EXIT_BLOCK_PTR);
7114 gsi_insert_on_edge (e, gimple_build_nop ());
7115 gsi_commit_edge_inserts ();
7120 /* Now add fake edges to the function exit for any non constant
7121 calls since there is no way that we can determine if they will
7123 for (i = 0; i < last_bb; i++)
7125 basic_block bb = BASIC_BLOCK (i);
7126 gimple_stmt_iterator gsi;
7127 gimple stmt, last_stmt;
7132 if (blocks && !TEST_BIT (blocks, i))
7135 gsi = gsi_last_nondebug_bb (bb);
7136 if (!gsi_end_p (gsi))
7138 last_stmt = gsi_stmt (gsi);
7141 stmt = gsi_stmt (gsi);
7142 if (need_fake_edge_p (stmt))
7146 /* The handling above of the final block before the
7147 epilogue should be enough to verify that there is
7148 no edge to the exit block in CFG already.
7149 Calling make_edge in such case would cause us to
7150 mark that edge as fake and remove it later. */
7151 #ifdef ENABLE_CHECKING
7152 if (stmt == last_stmt)
7154 e = find_edge (bb, EXIT_BLOCK_PTR);
7155 gcc_assert (e == NULL);
7159 /* Note that the following may create a new basic block
7160 and renumber the existing basic blocks. */
7161 if (stmt != last_stmt)
7163 e = split_block (bb, stmt);
7167 make_edge (bb, EXIT_BLOCK_PTR, EDGE_FAKE);
7171 while (!gsi_end_p (gsi));
7176 verify_flow_info ();
7178 return blocks_split;
7181 /* Removes edge E and all the blocks dominated by it, and updates dominance
7182 information. The IL in E->src needs to be updated separately.
7183 If dominance info is not available, only the edge E is removed.*/
7186 remove_edge_and_dominated_blocks (edge e)
7188 VEC (basic_block, heap) *bbs_to_remove = NULL;
7189 VEC (basic_block, heap) *bbs_to_fix_dom = NULL;
7193 bool none_removed = false;
7195 basic_block bb, dbb;
7198 if (!dom_info_available_p (CDI_DOMINATORS))
7204 /* No updating is needed for edges to exit. */
7205 if (e->dest == EXIT_BLOCK_PTR)
7207 if (cfgcleanup_altered_bbs)
7208 bitmap_set_bit (cfgcleanup_altered_bbs, e->src->index);
7213 /* First, we find the basic blocks to remove. If E->dest has a predecessor
7214 that is not dominated by E->dest, then this set is empty. Otherwise,
7215 all the basic blocks dominated by E->dest are removed.
7217 Also, to DF_IDOM we store the immediate dominators of the blocks in
7218 the dominance frontier of E (i.e., of the successors of the
7219 removed blocks, if there are any, and of E->dest otherwise). */
7220 FOR_EACH_EDGE (f, ei, e->dest->preds)
7225 if (!dominated_by_p (CDI_DOMINATORS, f->src, e->dest))
7227 none_removed = true;
7232 df = BITMAP_ALLOC (NULL);
7233 df_idom = BITMAP_ALLOC (NULL);
7236 bitmap_set_bit (df_idom,
7237 get_immediate_dominator (CDI_DOMINATORS, e->dest)->index);
7240 bbs_to_remove = get_all_dominated_blocks (CDI_DOMINATORS, e->dest);
7241 FOR_EACH_VEC_ELT (basic_block, bbs_to_remove, i, bb)
7243 FOR_EACH_EDGE (f, ei, bb->succs)
7245 if (f->dest != EXIT_BLOCK_PTR)
7246 bitmap_set_bit (df, f->dest->index);
7249 FOR_EACH_VEC_ELT (basic_block, bbs_to_remove, i, bb)
7250 bitmap_clear_bit (df, bb->index);
7252 EXECUTE_IF_SET_IN_BITMAP (df, 0, i, bi)
7254 bb = BASIC_BLOCK (i);
7255 bitmap_set_bit (df_idom,
7256 get_immediate_dominator (CDI_DOMINATORS, bb)->index);
7260 if (cfgcleanup_altered_bbs)
7262 /* Record the set of the altered basic blocks. */
7263 bitmap_set_bit (cfgcleanup_altered_bbs, e->src->index);
7264 bitmap_ior_into (cfgcleanup_altered_bbs, df);
7267 /* Remove E and the cancelled blocks. */
7272 /* Walk backwards so as to get a chance to substitute all
7273 released DEFs into debug stmts. See
7274 eliminate_unnecessary_stmts() in tree-ssa-dce.c for more
7276 for (i = VEC_length (basic_block, bbs_to_remove); i-- > 0; )
7277 delete_basic_block (VEC_index (basic_block, bbs_to_remove, i));
7280 /* Update the dominance information. The immediate dominator may change only
7281 for blocks whose immediate dominator belongs to DF_IDOM:
7283 Suppose that idom(X) = Y before removal of E and idom(X) != Y after the
7284 removal. Let Z the arbitrary block such that idom(Z) = Y and
7285 Z dominates X after the removal. Before removal, there exists a path P
7286 from Y to X that avoids Z. Let F be the last edge on P that is
7287 removed, and let W = F->dest. Before removal, idom(W) = Y (since Y
7288 dominates W, and because of P, Z does not dominate W), and W belongs to
7289 the dominance frontier of E. Therefore, Y belongs to DF_IDOM. */
7290 EXECUTE_IF_SET_IN_BITMAP (df_idom, 0, i, bi)
7292 bb = BASIC_BLOCK (i);
7293 for (dbb = first_dom_son (CDI_DOMINATORS, bb);
7295 dbb = next_dom_son (CDI_DOMINATORS, dbb))
7296 VEC_safe_push (basic_block, heap, bbs_to_fix_dom, dbb);
7299 iterate_fix_dominators (CDI_DOMINATORS, bbs_to_fix_dom, true);
7302 BITMAP_FREE (df_idom);
7303 VEC_free (basic_block, heap, bbs_to_remove);
7304 VEC_free (basic_block, heap, bbs_to_fix_dom);
7307 /* Purge dead EH edges from basic block BB. */
7310 gimple_purge_dead_eh_edges (basic_block bb)
7312 bool changed = false;
7315 gimple stmt = last_stmt (bb);
7317 if (stmt && stmt_can_throw_internal (stmt))
7320 for (ei = ei_start (bb->succs); (e = ei_safe_edge (ei)); )
7322 if (e->flags & EDGE_EH)
7324 remove_edge_and_dominated_blocks (e);
7334 /* Purge dead EH edges from basic block listed in BLOCKS. */
7337 gimple_purge_all_dead_eh_edges (const_bitmap blocks)
7339 bool changed = false;
7343 EXECUTE_IF_SET_IN_BITMAP (blocks, 0, i, bi)
7345 basic_block bb = BASIC_BLOCK (i);
7347 /* Earlier gimple_purge_dead_eh_edges could have removed
7348 this basic block already. */
7349 gcc_assert (bb || changed);
7351 changed |= gimple_purge_dead_eh_edges (bb);
7357 /* Purge dead abnormal call edges from basic block BB. */
7360 gimple_purge_dead_abnormal_call_edges (basic_block bb)
7362 bool changed = false;
7365 gimple stmt = last_stmt (bb);
7367 if (!cfun->has_nonlocal_label)
7370 if (stmt && stmt_can_make_abnormal_goto (stmt))
7373 for (ei = ei_start (bb->succs); (e = ei_safe_edge (ei)); )
7375 if (e->flags & EDGE_ABNORMAL)
7377 remove_edge_and_dominated_blocks (e);
7387 /* Purge dead abnormal call edges from basic block listed in BLOCKS. */
7390 gimple_purge_all_dead_abnormal_call_edges (const_bitmap blocks)
7392 bool changed = false;
7396 EXECUTE_IF_SET_IN_BITMAP (blocks, 0, i, bi)
7398 basic_block bb = BASIC_BLOCK (i);
7400 /* Earlier gimple_purge_dead_abnormal_call_edges could have removed
7401 this basic block already. */
7402 gcc_assert (bb || changed);
7404 changed |= gimple_purge_dead_abnormal_call_edges (bb);
7410 /* This function is called whenever a new edge is created or
7414 gimple_execute_on_growing_pred (edge e)
7416 basic_block bb = e->dest;
7418 if (!gimple_seq_empty_p (phi_nodes (bb)))
7419 reserve_phi_args_for_new_edge (bb);
7422 /* This function is called immediately before edge E is removed from
7423 the edge vector E->dest->preds. */
7426 gimple_execute_on_shrinking_pred (edge e)
7428 if (!gimple_seq_empty_p (phi_nodes (e->dest)))
7429 remove_phi_args (e);
7432 /*---------------------------------------------------------------------------
7433 Helper functions for Loop versioning
7434 ---------------------------------------------------------------------------*/
7436 /* Adjust phi nodes for 'first' basic block. 'second' basic block is a copy
7437 of 'first'. Both of them are dominated by 'new_head' basic block. When
7438 'new_head' was created by 'second's incoming edge it received phi arguments
7439 on the edge by split_edge(). Later, additional edge 'e' was created to
7440 connect 'new_head' and 'first'. Now this routine adds phi args on this
7441 additional edge 'e' that new_head to second edge received as part of edge
7445 gimple_lv_adjust_loop_header_phi (basic_block first, basic_block second,
7446 basic_block new_head, edge e)
7449 gimple_stmt_iterator psi1, psi2;
7451 edge e2 = find_edge (new_head, second);
7453 /* Because NEW_HEAD has been created by splitting SECOND's incoming
7454 edge, we should always have an edge from NEW_HEAD to SECOND. */
7455 gcc_assert (e2 != NULL);
7457 /* Browse all 'second' basic block phi nodes and add phi args to
7458 edge 'e' for 'first' head. PHI args are always in correct order. */
7460 for (psi2 = gsi_start_phis (second),
7461 psi1 = gsi_start_phis (first);
7462 !gsi_end_p (psi2) && !gsi_end_p (psi1);
7463 gsi_next (&psi2), gsi_next (&psi1))
7465 phi1 = gsi_stmt (psi1);
7466 phi2 = gsi_stmt (psi2);
7467 def = PHI_ARG_DEF (phi2, e2->dest_idx);
7468 add_phi_arg (phi1, def, e, gimple_phi_arg_location_from_edge (phi2, e2));
7473 /* Adds a if else statement to COND_BB with condition COND_EXPR.
7474 SECOND_HEAD is the destination of the THEN and FIRST_HEAD is
7475 the destination of the ELSE part. */
7478 gimple_lv_add_condition_to_bb (basic_block first_head ATTRIBUTE_UNUSED,
7479 basic_block second_head ATTRIBUTE_UNUSED,
7480 basic_block cond_bb, void *cond_e)
7482 gimple_stmt_iterator gsi;
7483 gimple new_cond_expr;
7484 tree cond_expr = (tree) cond_e;
7487 /* Build new conditional expr */
7488 new_cond_expr = gimple_build_cond_from_tree (cond_expr,
7489 NULL_TREE, NULL_TREE);
7491 /* Add new cond in cond_bb. */
7492 gsi = gsi_last_bb (cond_bb);
7493 gsi_insert_after (&gsi, new_cond_expr, GSI_NEW_STMT);
7495 /* Adjust edges appropriately to connect new head with first head
7496 as well as second head. */
7497 e0 = single_succ_edge (cond_bb);
7498 e0->flags &= ~EDGE_FALLTHRU;
7499 e0->flags |= EDGE_FALSE_VALUE;
7502 struct cfg_hooks gimple_cfg_hooks = {
7504 gimple_verify_flow_info,
7505 gimple_dump_bb, /* dump_bb */
7506 create_bb, /* create_basic_block */
7507 gimple_redirect_edge_and_branch, /* redirect_edge_and_branch */
7508 gimple_redirect_edge_and_branch_force, /* redirect_edge_and_branch_force */
7509 gimple_can_remove_branch_p, /* can_remove_branch_p */
7510 remove_bb, /* delete_basic_block */
7511 gimple_split_block, /* split_block */
7512 gimple_move_block_after, /* move_block_after */
7513 gimple_can_merge_blocks_p, /* can_merge_blocks_p */
7514 gimple_merge_blocks, /* merge_blocks */
7515 gimple_predict_edge, /* predict_edge */
7516 gimple_predicted_by_p, /* predicted_by_p */
7517 gimple_can_duplicate_bb_p, /* can_duplicate_block_p */
7518 gimple_duplicate_bb, /* duplicate_block */
7519 gimple_split_edge, /* split_edge */
7520 gimple_make_forwarder_block, /* make_forward_block */
7521 NULL, /* tidy_fallthru_edge */
7522 NULL, /* force_nonfallthru */
7523 gimple_block_ends_with_call_p,/* block_ends_with_call_p */
7524 gimple_block_ends_with_condjump_p, /* block_ends_with_condjump_p */
7525 gimple_flow_call_edges_add, /* flow_call_edges_add */
7526 gimple_execute_on_growing_pred, /* execute_on_growing_pred */
7527 gimple_execute_on_shrinking_pred, /* execute_on_shrinking_pred */
7528 gimple_duplicate_loop_to_header_edge, /* duplicate loop for trees */
7529 gimple_lv_add_condition_to_bb, /* lv_add_condition_to_bb */
7530 gimple_lv_adjust_loop_header_phi, /* lv_adjust_loop_header_phi*/
7531 extract_true_false_edges_from_block, /* extract_cond_bb_edges */
7532 flush_pending_stmts, /* flush_pending_stmts */
7533 gimple_empty_block_p, /* block_empty_p */
7534 gimple_split_block_before_cond_jump, /* split_block_before_cond_jump */
7538 /* Split all critical edges. */
7541 split_critical_edges (void)
7547 /* split_edge can redirect edges out of SWITCH_EXPRs, which can get
7548 expensive. So we want to enable recording of edge to CASE_LABEL_EXPR
7549 mappings around the calls to split_edge. */
7550 start_recording_case_labels ();
7553 FOR_EACH_EDGE (e, ei, bb->succs)
7555 if (EDGE_CRITICAL_P (e) && !(e->flags & EDGE_ABNORMAL))
7557 /* PRE inserts statements to edges and expects that
7558 since split_critical_edges was done beforehand, committing edge
7559 insertions will not split more edges. In addition to critical
7560 edges we must split edges that have multiple successors and
7561 end by control flow statements, such as RESX.
7562 Go ahead and split them too. This matches the logic in
7563 gimple_find_edge_insert_loc. */
7564 else if ((!single_pred_p (e->dest)
7565 || !gimple_seq_empty_p (phi_nodes (e->dest))
7566 || e->dest == EXIT_BLOCK_PTR)
7567 && e->src != ENTRY_BLOCK_PTR
7568 && !(e->flags & EDGE_ABNORMAL))
7570 gimple_stmt_iterator gsi;
7572 gsi = gsi_last_bb (e->src);
7573 if (!gsi_end_p (gsi)
7574 && stmt_ends_bb_p (gsi_stmt (gsi))
7575 && (gimple_code (gsi_stmt (gsi)) != GIMPLE_RETURN
7576 && !gimple_call_builtin_p (gsi_stmt (gsi),
7582 end_recording_case_labels ();
7586 struct gimple_opt_pass pass_split_crit_edges =
7590 "crited", /* name */
7592 split_critical_edges, /* execute */
7595 0, /* static_pass_number */
7596 TV_TREE_SPLIT_EDGES, /* tv_id */
7597 PROP_cfg, /* properties required */
7598 PROP_no_crit_edges, /* properties_provided */
7599 0, /* properties_destroyed */
7600 0, /* todo_flags_start */
7601 TODO_verify_flow /* todo_flags_finish */
7606 /* Build a ternary operation and gimplify it. Emit code before GSI.
7607 Return the gimple_val holding the result. */
7610 gimplify_build3 (gimple_stmt_iterator *gsi, enum tree_code code,
7611 tree type, tree a, tree b, tree c)
7614 location_t loc = gimple_location (gsi_stmt (*gsi));
7616 ret = fold_build3_loc (loc, code, type, a, b, c);
7619 return force_gimple_operand_gsi (gsi, ret, true, NULL, true,
7623 /* Build a binary operation and gimplify it. Emit code before GSI.
7624 Return the gimple_val holding the result. */
7627 gimplify_build2 (gimple_stmt_iterator *gsi, enum tree_code code,
7628 tree type, tree a, tree b)
7632 ret = fold_build2_loc (gimple_location (gsi_stmt (*gsi)), code, type, a, b);
7635 return force_gimple_operand_gsi (gsi, ret, true, NULL, true,
7639 /* Build a unary operation and gimplify it. Emit code before GSI.
7640 Return the gimple_val holding the result. */
7643 gimplify_build1 (gimple_stmt_iterator *gsi, enum tree_code code, tree type,
7648 ret = fold_build1_loc (gimple_location (gsi_stmt (*gsi)), code, type, a);
7651 return force_gimple_operand_gsi (gsi, ret, true, NULL, true,
7657 /* Emit return warnings. */
7660 execute_warn_function_return (void)
7662 source_location location;
7667 if (!targetm.warn_func_return (cfun->decl))
7670 /* If we have a path to EXIT, then we do return. */
7671 if (TREE_THIS_VOLATILE (cfun->decl)
7672 && EDGE_COUNT (EXIT_BLOCK_PTR->preds) > 0)
7674 location = UNKNOWN_LOCATION;
7675 FOR_EACH_EDGE (e, ei, EXIT_BLOCK_PTR->preds)
7677 last = last_stmt (e->src);
7678 if ((gimple_code (last) == GIMPLE_RETURN
7679 || gimple_call_builtin_p (last, BUILT_IN_RETURN))
7680 && (location = gimple_location (last)) != UNKNOWN_LOCATION)
7683 if (location == UNKNOWN_LOCATION)
7684 location = cfun->function_end_locus;
7685 warning_at (location, 0, "%<noreturn%> function does return");
7688 /* If we see "return;" in some basic block, then we do reach the end
7689 without returning a value. */
7690 else if (warn_return_type
7691 && !TREE_NO_WARNING (cfun->decl)
7692 && EDGE_COUNT (EXIT_BLOCK_PTR->preds) > 0
7693 && !VOID_TYPE_P (TREE_TYPE (TREE_TYPE (cfun->decl))))
7695 FOR_EACH_EDGE (e, ei, EXIT_BLOCK_PTR->preds)
7697 gimple last = last_stmt (e->src);
7698 if (gimple_code (last) == GIMPLE_RETURN
7699 && gimple_return_retval (last) == NULL
7700 && !gimple_no_warning_p (last))
7702 location = gimple_location (last);
7703 if (location == UNKNOWN_LOCATION)
7704 location = cfun->function_end_locus;
7705 warning_at (location, OPT_Wreturn_type, "control reaches end of non-void function");
7706 TREE_NO_WARNING (cfun->decl) = 1;
7715 /* Given a basic block B which ends with a conditional and has
7716 precisely two successors, determine which of the edges is taken if
7717 the conditional is true and which is taken if the conditional is
7718 false. Set TRUE_EDGE and FALSE_EDGE appropriately. */
7721 extract_true_false_edges_from_block (basic_block b,
7725 edge e = EDGE_SUCC (b, 0);
7727 if (e->flags & EDGE_TRUE_VALUE)
7730 *false_edge = EDGE_SUCC (b, 1);
7735 *true_edge = EDGE_SUCC (b, 1);
7739 struct gimple_opt_pass pass_warn_function_return =
7743 "*warn_function_return", /* name */
7745 execute_warn_function_return, /* execute */
7748 0, /* static_pass_number */
7749 TV_NONE, /* tv_id */
7750 PROP_cfg, /* properties_required */
7751 0, /* properties_provided */
7752 0, /* properties_destroyed */
7753 0, /* todo_flags_start */
7754 0 /* todo_flags_finish */
7758 /* Emit noreturn warnings. */
7761 execute_warn_function_noreturn (void)
7763 if (!TREE_THIS_VOLATILE (current_function_decl)
7764 && EDGE_COUNT (EXIT_BLOCK_PTR->preds) == 0)
7765 warn_function_noreturn (current_function_decl);
7770 gate_warn_function_noreturn (void)
7772 return warn_suggest_attribute_noreturn;
7775 struct gimple_opt_pass pass_warn_function_noreturn =
7779 "*warn_function_noreturn", /* name */
7780 gate_warn_function_noreturn, /* gate */
7781 execute_warn_function_noreturn, /* execute */
7784 0, /* static_pass_number */
7785 TV_NONE, /* tv_id */
7786 PROP_cfg, /* properties_required */
7787 0, /* properties_provided */
7788 0, /* properties_destroyed */
7789 0, /* todo_flags_start */
7790 0 /* todo_flags_finish */
7795 /* Walk a gimplified function and warn for functions whose return value is
7796 ignored and attribute((warn_unused_result)) is set. This is done before
7797 inlining, so we don't have to worry about that. */
7800 do_warn_unused_result (gimple_seq seq)
7803 gimple_stmt_iterator i;
7805 for (i = gsi_start (seq); !gsi_end_p (i); gsi_next (&i))
7807 gimple g = gsi_stmt (i);
7809 switch (gimple_code (g))
7812 do_warn_unused_result (gimple_bind_body (g));
7815 do_warn_unused_result (gimple_try_eval (g));
7816 do_warn_unused_result (gimple_try_cleanup (g));
7819 do_warn_unused_result (gimple_catch_handler (g));
7821 case GIMPLE_EH_FILTER:
7822 do_warn_unused_result (gimple_eh_filter_failure (g));
7826 if (gimple_call_lhs (g))
7828 if (gimple_call_internal_p (g))
7831 /* This is a naked call, as opposed to a GIMPLE_CALL with an
7832 LHS. All calls whose value is ignored should be
7833 represented like this. Look for the attribute. */
7834 fdecl = gimple_call_fndecl (g);
7835 ftype = gimple_call_fntype (g);
7837 if (lookup_attribute ("warn_unused_result", TYPE_ATTRIBUTES (ftype)))
7839 location_t loc = gimple_location (g);
7842 warning_at (loc, OPT_Wunused_result,
7843 "ignoring return value of %qD, "
7844 "declared with attribute warn_unused_result",
7847 warning_at (loc, OPT_Wunused_result,
7848 "ignoring return value of function "
7849 "declared with attribute warn_unused_result");
7854 /* Not a container, not a call, or a call whose value is used. */
7861 run_warn_unused_result (void)
7863 do_warn_unused_result (gimple_body (current_function_decl));
7868 gate_warn_unused_result (void)
7870 return flag_warn_unused_result;
7873 struct gimple_opt_pass pass_warn_unused_result =
7877 "*warn_unused_result", /* name */
7878 gate_warn_unused_result, /* gate */
7879 run_warn_unused_result, /* execute */
7882 0, /* static_pass_number */
7883 TV_NONE, /* tv_id */
7884 PROP_gimple_any, /* properties_required */
7885 0, /* properties_provided */
7886 0, /* properties_destroyed */
7887 0, /* todo_flags_start */
7888 0, /* todo_flags_finish */
7893 /* Garbage collection support for edge_def. */
7895 extern void gt_ggc_mx (tree&);
7896 extern void gt_ggc_mx (gimple&);
7897 extern void gt_ggc_mx (rtx&);
7898 extern void gt_ggc_mx (basic_block&);
7901 gt_ggc_mx (edge_def *e)
7903 tree block = LOCATION_BLOCK (e->goto_locus);
7905 gt_ggc_mx (e->dest);
7906 if (current_ir_type () == IR_GIMPLE)
7907 gt_ggc_mx (e->insns.g);
7909 gt_ggc_mx (e->insns.r);
7913 /* PCH support for edge_def. */
7915 extern void gt_pch_nx (tree&);
7916 extern void gt_pch_nx (gimple&);
7917 extern void gt_pch_nx (rtx&);
7918 extern void gt_pch_nx (basic_block&);
7921 gt_pch_nx (edge_def *e)
7923 tree block = LOCATION_BLOCK (e->goto_locus);
7925 gt_pch_nx (e->dest);
7926 if (current_ir_type () == IR_GIMPLE)
7927 gt_pch_nx (e->insns.g);
7929 gt_pch_nx (e->insns.r);
7934 gt_pch_nx (edge_def *e, gt_pointer_operator op, void *cookie)
7936 tree block = LOCATION_BLOCK (e->goto_locus);
7937 op (&(e->src), cookie);
7938 op (&(e->dest), cookie);
7939 if (current_ir_type () == IR_GIMPLE)
7940 op (&(e->insns.g), cookie);
7942 op (&(e->insns.r), cookie);
7943 op (&(block), cookie);