1 /* Miscellaneous SSA utility functions.
2 Copyright (C) 2001, 2002, 2003, 2004 Free Software Foundation, Inc.
4 This file is part of GCC.
6 GCC is free software; you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation; either version 2, or (at your option)
11 GCC is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with GCC; see the file COPYING. If not, write to
18 the Free Software Foundation, 59 Temple Place - Suite 330,
19 Boston, MA 02111-1307, USA. */
23 #include "coretypes.h"
30 #include "langhooks.h"
31 #include "hard-reg-set.h"
32 #include "basic-block.h"
37 #include "diagnostic.h"
39 #include "tree-flow.h"
40 #include "tree-gimple.h"
41 #include "tree-inline.h"
44 #include "tree-alias-common.h"
46 #include "tree-dump.h"
47 #include "tree-pass.h"
50 /* Remove edge E and remove the corresponding arguments from the PHI nodes
51 in E's destination block. */
54 ssa_remove_edge (edge e
)
58 /* Remove the appropriate PHI arguments in E's destination block. */
59 for (phi
= phi_nodes (e
->dest
); phi
; phi
= next
)
61 next
= PHI_CHAIN (phi
);
62 remove_phi_arg (phi
, e
->src
);
68 /* Remove remove the corresponding arguments from the PHI nodes
69 in E's destination block and redirect it to DEST. Return redirected edge.
70 The list of removed arguments is stored in PENDING_STMT (e). */
73 ssa_redirect_edge (edge e
, basic_block dest
)
76 tree list
= NULL
, *last
= &list
;
80 /* Remove the appropriate PHI arguments in E's destination block. */
81 for (phi
= phi_nodes (e
->dest
); phi
; phi
= next
)
83 next
= PHI_CHAIN (phi
);
85 i
= phi_arg_from_edge (phi
, e
);
89 src
= PHI_ARG_DEF (phi
, i
);
90 dst
= PHI_RESULT (phi
);
91 node
= build_tree_list (dst
, src
);
93 last
= &TREE_CHAIN (node
);
95 remove_phi_arg_num (phi
, i
);
98 e
= redirect_edge_succ_nodup (e
, dest
);
99 PENDING_STMT (e
) = list
;
105 /* Return true if the definition of SSA_NAME at block BB is malformed.
107 STMT is the statement where SSA_NAME is created.
109 DEFINITION_BLOCK is an array of basic blocks indexed by SSA_NAME version
110 numbers. If DEFINITION_BLOCK[SSA_NAME_VERSION] is set, it means that the
111 block in that array slot contains the definition of SSA_NAME. */
114 verify_def (basic_block bb
, basic_block
*definition_block
, tree ssa_name
,
119 if (TREE_CODE (ssa_name
) != SSA_NAME
)
121 error ("Expected an SSA_NAME object");
122 debug_generic_stmt (ssa_name
);
123 debug_generic_stmt (stmt
);
126 if (definition_block
[SSA_NAME_VERSION (ssa_name
)])
128 error ("SSA_NAME created in two different blocks %i and %i",
129 definition_block
[SSA_NAME_VERSION (ssa_name
)]->index
, bb
->index
);
130 fprintf (stderr
, "SSA_NAME: ");
131 debug_generic_stmt (ssa_name
);
132 debug_generic_stmt (stmt
);
136 definition_block
[SSA_NAME_VERSION (ssa_name
)] = bb
;
138 if (SSA_NAME_DEF_STMT (ssa_name
) != stmt
)
140 error ("SSA_NAME_DEF_STMT is wrong");
141 fprintf (stderr
, "SSA_NAME: ");
142 debug_generic_stmt (ssa_name
);
143 fprintf (stderr
, "Expected definition statement:\n");
144 debug_generic_stmt (SSA_NAME_DEF_STMT (ssa_name
));
145 fprintf (stderr
, "\nActual definition statement:\n");
146 debug_generic_stmt (stmt
);
154 /* Return true if the use of SSA_NAME at statement STMT in block BB is
157 DEF_BB is the block where SSA_NAME was found to be created.
159 IDOM contains immediate dominator information for the flowgraph.
161 CHECK_ABNORMAL is true if the caller wants to check whether this use
162 is flowing through an abnormal edge (only used when checking PHI
166 verify_use (basic_block bb
, basic_block def_bb
, tree ssa_name
,
167 tree stmt
, bool check_abnormal
)
171 if (IS_EMPTY_STMT (SSA_NAME_DEF_STMT (ssa_name
)))
172 ; /* Nothing to do. */
175 error ("Missing definition");
178 else if (bb
!= def_bb
179 && !dominated_by_p (CDI_DOMINATORS
, bb
, def_bb
))
181 error ("Definition in block %i does not dominate use in block %i",
182 def_bb
->index
, bb
->index
);
187 && !SSA_NAME_OCCURS_IN_ABNORMAL_PHI (ssa_name
))
189 error ("SSA_NAME_OCCURS_IN_ABNORMAL_PHI should be set");
195 fprintf (stderr
, "for SSA_NAME: ");
196 debug_generic_stmt (ssa_name
);
197 fprintf (stderr
, "in statement:\n");
198 debug_generic_stmt (stmt
);
205 /* Return true if any of the arguments for PHI node PHI at block BB is
208 IDOM contains immediate dominator information for the flowgraph.
210 DEFINITION_BLOCK is an array of basic blocks indexed by SSA_NAME version
211 numbers. If DEFINITION_BLOCK[SSA_NAME_VERSION] is set, it means that the
212 block in that array slot contains the definition of SSA_NAME. */
215 verify_phi_args (tree phi
, basic_block bb
, basic_block
*definition_block
)
219 int i
, phi_num_args
= PHI_NUM_ARGS (phi
);
221 /* Mark all the incoming edges. */
222 for (e
= bb
->pred
; e
; e
= e
->pred_next
)
225 for (i
= 0; i
< phi_num_args
; i
++)
227 tree op
= PHI_ARG_DEF (phi
, i
);
229 e
= PHI_ARG_EDGE (phi
, i
);
231 if (TREE_CODE (op
) == SSA_NAME
)
232 err
|= verify_use (e
->src
, definition_block
[SSA_NAME_VERSION (op
)], op
,
233 phi
, e
->flags
& EDGE_ABNORMAL
);
237 error ("Wrong edge %d->%d for PHI argument\n",
238 e
->src
->index
, e
->dest
->index
, bb
->index
);
242 if (e
->aux
== (void *) 0)
244 error ("PHI argument flowing through dead edge %d->%d\n",
245 e
->src
->index
, e
->dest
->index
);
249 if (e
->aux
== (void *) 2)
251 error ("PHI argument duplicated for edge %d->%d\n", e
->src
->index
,
258 fprintf (stderr
, "PHI argument\n");
259 debug_generic_stmt (op
);
265 for (e
= bb
->pred
; e
; e
= e
->pred_next
)
267 if (e
->aux
!= (void *) 2)
269 error ("No argument flowing through edge %d->%d\n", e
->src
->index
,
278 fprintf (stderr
, "for PHI node\n");
279 debug_generic_stmt (phi
);
287 /* Verify common invariants in the SSA web.
288 TODO: verify the variable annotations. */
295 basic_block
*definition_block
= xcalloc (num_ssa_names
, sizeof (basic_block
));
297 timevar_push (TV_TREE_SSA_VERIFY
);
299 calculate_dominance_info (CDI_DOMINATORS
);
301 /* Verify and register all the SSA_NAME definitions found in the
306 block_stmt_iterator bsi
;
308 for (phi
= phi_nodes (bb
); phi
; phi
= PHI_CHAIN (phi
))
309 err
|= verify_def (bb
, definition_block
, PHI_RESULT (phi
), phi
);
311 for (bsi
= bsi_start (bb
); !bsi_end_p (bsi
); bsi_next (&bsi
))
316 v_may_def_optype v_may_defs
;
317 v_must_def_optype v_must_defs
;
320 stmt
= bsi_stmt (bsi
);
321 ann
= stmt_ann (stmt
);
322 get_stmt_operands (stmt
);
324 v_may_defs
= V_MAY_DEF_OPS (ann
);
325 if (ann
->makes_aliased_stores
&& NUM_V_MAY_DEFS (v_may_defs
) == 0)
326 error ("Makes aliased stores, but no V_MAY_DEFS");
328 for (j
= 0; j
< NUM_V_MAY_DEFS (v_may_defs
); j
++)
330 tree op
= V_MAY_DEF_RESULT (v_may_defs
, j
);
331 if (is_gimple_reg (op
))
333 error ("Found a virtual definition for a GIMPLE register");
334 debug_generic_stmt (op
);
335 debug_generic_stmt (stmt
);
338 err
|= verify_def (bb
, definition_block
, op
, stmt
);
341 v_must_defs
= STMT_V_MUST_DEF_OPS (stmt
);
342 for (j
= 0; j
< NUM_V_MUST_DEFS (v_must_defs
); j
++)
344 tree op
= V_MUST_DEF_OP (v_must_defs
, j
);
345 if (is_gimple_reg (op
))
347 error ("Found a virtual must-def for a GIMPLE register");
348 debug_generic_stmt (op
);
349 debug_generic_stmt (stmt
);
352 err
|= verify_def (bb
, definition_block
, op
, stmt
);
355 defs
= DEF_OPS (ann
);
356 for (j
= 0; j
< NUM_DEFS (defs
); j
++)
358 tree op
= DEF_OP (defs
, j
);
359 if (TREE_CODE (op
) == SSA_NAME
&& !is_gimple_reg (op
))
361 error ("Found a real definition for a non-GIMPLE register");
362 debug_generic_stmt (op
);
363 debug_generic_stmt (stmt
);
366 err
|= verify_def (bb
, definition_block
, op
, stmt
);
372 /* Now verify all the uses and make sure they agree with the definitions
373 found in the previous pass. */
378 block_stmt_iterator bsi
;
380 /* Make sure that all edges have a clear 'aux' field. */
381 for (e
= bb
->pred
; e
; e
= e
->pred_next
)
385 error ("AUX pointer initialized for edge %d->%d\n", e
->src
->index
,
391 /* Verify the arguments for every PHI node in the block. */
392 for (phi
= phi_nodes (bb
); phi
; phi
= PHI_CHAIN (phi
))
393 err
|= verify_phi_args (phi
, bb
, definition_block
);
395 /* Now verify all the uses and vuses in every statement of the block.
397 Remember, the RHS of a V_MAY_DEF is a use as well. */
398 for (bsi
= bsi_start (bb
); !bsi_end_p (bsi
); bsi_next (&bsi
))
400 tree stmt
= bsi_stmt (bsi
);
401 stmt_ann_t ann
= stmt_ann (stmt
);
404 v_may_def_optype v_may_defs
;
407 vuses
= VUSE_OPS (ann
);
408 for (j
= 0; j
< NUM_VUSES (vuses
); j
++)
410 tree op
= VUSE_OP (vuses
, j
);
412 if (is_gimple_reg (op
))
414 error ("Found a virtual use for a GIMPLE register");
415 debug_generic_stmt (op
);
416 debug_generic_stmt (stmt
);
419 err
|= verify_use (bb
, definition_block
[SSA_NAME_VERSION (op
)],
423 v_may_defs
= V_MAY_DEF_OPS (ann
);
424 for (j
= 0; j
< NUM_V_MAY_DEFS (v_may_defs
); j
++)
426 tree op
= V_MAY_DEF_OP (v_may_defs
, j
);
428 if (is_gimple_reg (op
))
430 error ("Found a virtual use for a GIMPLE register");
431 debug_generic_stmt (op
);
432 debug_generic_stmt (stmt
);
435 err
|= verify_use (bb
, definition_block
[SSA_NAME_VERSION (op
)],
439 uses
= USE_OPS (ann
);
440 for (j
= 0; j
< NUM_USES (uses
); j
++)
442 tree op
= USE_OP (uses
, j
);
444 if (TREE_CODE (op
) == SSA_NAME
&& !is_gimple_reg (op
))
446 error ("Found a real use of a non-GIMPLE register");
447 debug_generic_stmt (op
);
448 debug_generic_stmt (stmt
);
451 err
|= verify_use (bb
, definition_block
[SSA_NAME_VERSION (op
)],
457 free (definition_block
);
459 timevar_pop (TV_TREE_SSA_VERIFY
);
462 internal_error ("verify_ssa failed.");
466 /* Set the USED bit in the annotation for T. */
476 switch (TREE_CODE (t
))
484 t
= TREE_OPERAND (t
, 0);
492 if (TREE_CODE (t
) == SSA_NAME
)
493 t
= SSA_NAME_VAR (t
);
495 var_ann (t
)->used
= 1;
499 /* Initialize global DFA and SSA structures. */
504 VARRAY_TREE_INIT (referenced_vars
, 20, "referenced_vars");
505 call_clobbered_vars
= BITMAP_XMALLOC ();
506 init_ssa_operands ();
509 global_var
= NULL_TREE
;
510 aliases_computed_p
= false;
514 /* Deallocate memory associated with SSA data structures for FNDECL. */
517 delete_tree_ssa (void)
521 block_stmt_iterator bsi
;
523 /* Remove annotations from every tree in the function. */
525 for (bsi
= bsi_start (bb
); !bsi_end_p (bsi
); bsi_next (&bsi
))
526 bsi_stmt (bsi
)->common
.ann
= NULL
;
528 /* Remove annotations from every referenced variable. */
531 for (i
= 0; i
< num_referenced_vars
; i
++)
532 referenced_var (i
)->common
.ann
= NULL
;
533 referenced_vars
= NULL
;
538 fini_ssa_operands ();
540 global_var
= NULL_TREE
;
541 BITMAP_XFREE (call_clobbered_vars
);
542 call_clobbered_vars
= NULL
;
543 aliases_computed_p
= false;
547 /* Return true if EXPR is a useless type conversion, otherwise return
551 tree_ssa_useless_type_conversion_1 (tree outer_type
, tree inner_type
)
553 /* If the inner and outer types are effectively the same, then
554 strip the type conversion and enter the equivalence into
556 if (inner_type
== outer_type
557 || (lang_hooks
.types_compatible_p (inner_type
, outer_type
)))
560 /* If both types are pointers and the outer type is a (void *), then
561 the conversion is not necessary. The opposite is not true since
562 that conversion would result in a loss of information if the
563 equivalence was used. Consider an indirect function call where
564 we need to know the exact type of the function to correctly
565 implement the ABI. */
566 else if (POINTER_TYPE_P (inner_type
)
567 && POINTER_TYPE_P (outer_type
)
568 && TREE_CODE (TREE_TYPE (outer_type
)) == VOID_TYPE
)
571 /* Pointers and references are equivalent once we get to GENERIC,
572 so strip conversions that just switch between them. */
573 else if (POINTER_TYPE_P (inner_type
)
574 && POINTER_TYPE_P (outer_type
)
575 && lang_hooks
.types_compatible_p (TREE_TYPE (inner_type
),
576 TREE_TYPE (outer_type
)))
579 /* If both the inner and outer types are integral types, then the
580 conversion is not necessary if they have the same mode and
581 signedness and precision. Note that type _Bool can have size of
582 4 (only happens on powerpc-darwin right now but can happen on any
583 target that defines BOOL_TYPE_SIZE to be INT_TYPE_SIZE) and a
584 precision of 1 while unsigned int is the same expect for a
585 precision of 4 so testing of precision is necessary. */
586 else if (INTEGRAL_TYPE_P (inner_type
)
587 && INTEGRAL_TYPE_P (outer_type
)
588 && TYPE_MODE (inner_type
) == TYPE_MODE (outer_type
)
589 && TYPE_UNSIGNED (inner_type
) == TYPE_UNSIGNED (outer_type
)
590 && TYPE_PRECISION (inner_type
) == TYPE_PRECISION (outer_type
))
593 /* Recurse for complex types. */
594 else if (TREE_CODE (inner_type
) == COMPLEX_TYPE
595 && TREE_CODE (outer_type
) == COMPLEX_TYPE
596 && tree_ssa_useless_type_conversion_1 (TREE_TYPE (outer_type
),
597 TREE_TYPE (inner_type
)))
603 /* Return true if EXPR is a useless type conversion, otherwise return
607 tree_ssa_useless_type_conversion (tree expr
)
609 /* If we have an assignment that merely uses a NOP_EXPR to change
610 the top of the RHS to the type of the LHS and the type conversion
611 is "safe", then strip away the type conversion so that we can
612 enter LHS = RHS into the const_and_copies table. */
613 if (TREE_CODE (expr
) == NOP_EXPR
|| TREE_CODE (expr
) == CONVERT_EXPR
)
614 return tree_ssa_useless_type_conversion_1 (TREE_TYPE (expr
),
615 TREE_TYPE (TREE_OPERAND (expr
,
623 /* Internal helper for walk_use_def_chains. VAR, FN and DATA are as
624 described in walk_use_def_chains. VISITED is a bitmap used to mark
625 visited SSA_NAMEs to avoid infinite loops. */
628 walk_use_def_chains_1 (tree var
, walk_use_def_chains_fn fn
, void *data
,
633 if (bitmap_bit_p (visited
, SSA_NAME_VERSION (var
)))
636 bitmap_set_bit (visited
, SSA_NAME_VERSION (var
));
638 def_stmt
= SSA_NAME_DEF_STMT (var
);
640 if (TREE_CODE (def_stmt
) != PHI_NODE
)
642 /* If we reached the end of the use-def chain, call FN. */
643 return (*fn
) (var
, def_stmt
, data
);
649 /* Otherwise, follow use-def links out of each PHI argument and call
650 FN after visiting each one. */
651 for (i
= 0; i
< PHI_NUM_ARGS (def_stmt
); i
++)
653 tree arg
= PHI_ARG_DEF (def_stmt
, i
);
654 if (TREE_CODE (arg
) == SSA_NAME
655 && walk_use_def_chains_1 (arg
, fn
, data
, visited
))
658 if ((*fn
) (arg
, def_stmt
, data
))
667 /* Walk use-def chains starting at the SSA variable VAR. Call function FN
668 at each reaching definition found. FN takes three arguments: VAR, its
669 defining statement (DEF_STMT) and a generic pointer to whatever state
670 information that FN may want to maintain (DATA). FN is able to stop the
671 walk by returning true, otherwise in order to continue the walk, FN
674 Note, that if DEF_STMT is a PHI node, the semantics are slightly
675 different. For each argument ARG of the PHI node, this function will:
677 1- Walk the use-def chains for ARG.
678 2- Call (*FN) (ARG, PHI, DATA).
680 Note how the first argument to FN is no longer the original variable
681 VAR, but the PHI argument currently being examined. If FN wants to get
682 at VAR, it should call PHI_RESULT (PHI). */
685 walk_use_def_chains (tree var
, walk_use_def_chains_fn fn
, void *data
)
689 #if defined ENABLE_CHECKING
690 if (TREE_CODE (var
) != SSA_NAME
)
694 def_stmt
= SSA_NAME_DEF_STMT (var
);
696 /* We only need to recurse if the reaching definition comes from a PHI
698 if (TREE_CODE (def_stmt
) != PHI_NODE
)
699 (*fn
) (var
, def_stmt
, data
);
702 bitmap visited
= BITMAP_XMALLOC ();
703 walk_use_def_chains_1 (var
, fn
, data
, visited
);
704 BITMAP_XFREE (visited
);
709 /* Replaces immediate uses of VAR by REPL. */
712 replace_immediate_uses (tree var
, tree repl
)
716 v_may_def_optype v_may_defs
;
722 df
= get_immediate_uses (SSA_NAME_DEF_STMT (var
));
723 n
= num_immediate_uses (df
);
725 for (i
= 0; i
< n
; i
++)
727 stmt
= immediate_use (df
, i
);
728 ann
= stmt_ann (stmt
);
730 if (TREE_CODE (stmt
) == PHI_NODE
)
732 for (j
= 0; j
< PHI_NUM_ARGS (stmt
); j
++)
733 if (PHI_ARG_DEF (stmt
, j
) == var
)
735 PHI_ARG_DEF (stmt
, j
) = repl
;
736 if (TREE_CODE (repl
) == SSA_NAME
737 && PHI_ARG_EDGE (stmt
, j
)->flags
& EDGE_ABNORMAL
)
738 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (repl
) = 1;
744 get_stmt_operands (stmt
);
745 if (is_gimple_reg (SSA_NAME_VAR (var
)))
747 uses
= USE_OPS (ann
);
748 for (j
= 0; j
< (int) NUM_USES (uses
); j
++)
749 if (USE_OP (uses
, j
) == var
)
750 propagate_value (USE_OP_PTR (uses
, j
), repl
);
754 vuses
= VUSE_OPS (ann
);
755 for (j
= 0; j
< (int) NUM_VUSES (vuses
); j
++)
756 if (VUSE_OP (vuses
, j
) == var
)
757 propagate_value (VUSE_OP_PTR (vuses
, j
), repl
);
759 v_may_defs
= V_MAY_DEF_OPS (ann
);
760 for (j
= 0; j
< (int) NUM_V_MAY_DEFS (v_may_defs
); j
++)
761 if (V_MAY_DEF_OP (v_may_defs
, j
) == var
)
762 propagate_value (V_MAY_DEF_OP_PTR (v_may_defs
, j
), repl
);
767 /* If REPL is a pointer, it may have different memory tags associated
768 with it. For instance, VAR may have had a name tag while REPL
769 only had a type tag. In these cases, the virtual operands (if
770 any) in the statement will refer to different symbols which need
772 if (POINTER_TYPE_P (TREE_TYPE (repl
)))
773 mark_new_vars_to_rename (stmt
, vars_to_rename
);
777 /* Raises value of phi node PHI by joining it with VAL. Processes immediate
778 uses of PHI recursively. */
781 raise_value (tree phi
, tree val
, tree
*eq_to
)
784 tree var
= PHI_RESULT (phi
), stmt
;
785 int ver
= SSA_NAME_VERSION (var
);
788 if (eq_to
[ver
] == var
)
791 switch (TREE_CODE (val
))
798 if (TREE_CODE (TREE_TYPE (var
)) != POINTER_TYPE
)
802 /* Do not propagate pointer constants. This might require folding
803 things like *&foo and rewriting the ssa, which is not worth the
810 if (operand_equal_p (eq_to
[ver
], val
, 0))
818 df
= get_immediate_uses (SSA_NAME_DEF_STMT (var
));
819 n
= num_immediate_uses (df
);
821 for (i
= 0; i
< n
; i
++)
823 stmt
= immediate_use (df
, i
);
825 if (TREE_CODE (stmt
) != PHI_NODE
)
828 raise_value (stmt
, eq_to
[ver
], eq_to
);
832 /* Removes redundant phi nodes.
834 A redundant PHI node is a PHI node where all of its PHI arguments
835 are the same value, excluding any PHI arguments which are the same
838 A redundant PHI node is effectively a copy, so we forward copy propagate
839 which removes all uses of the destination of the PHI node then
840 finally we delete the redundant PHI node.
842 Note that if we can not copy propagate the PHI node, then the PHI
843 will not be removed. Thus we do not have to worry about dependencies
844 between PHIs and the problems serializing PHIs into copies creates.
846 The most important effect of this pass is to remove degenerate PHI
847 nodes created by removing unreachable code. */
850 kill_redundant_phi_nodes (void)
855 tree phi
, t
, stmt
, var
;
857 /* The EQ_TO array holds the current value of the ssa name in the
866 Bottom is represented by NULL and top by the variable itself.
868 Once the dataflow stabilizes, we know that the phi nodes we need to keep
869 are exactly those with top as their result.
871 The remaining phi nodes have their uses replaced with their value
872 in the lattice and the phi node itself is removed. */
873 eq_to
= xcalloc (num_ssa_names
, sizeof (tree
));
875 /* We have had cases where computing immediate uses takes a
876 significant amount of compile time. If we run into such
877 problems here, we may want to only compute immediate uses for
878 a subset of all the SSA_NAMEs instead of computing it for
879 all of the SSA_NAMEs. */
880 compute_immediate_uses (TDFA_USE_OPS
| TDFA_USE_VOPS
, NULL
);
884 for (phi
= phi_nodes (bb
); phi
; phi
= PHI_CHAIN (phi
))
886 var
= PHI_RESULT (phi
);
888 /* If the destination of the PHI is associated with an
889 abnormal edge, then we can not propagate this PHI away. */
890 if (SSA_NAME_OCCURS_IN_ABNORMAL_PHI (var
))
892 raise_value (phi
, var
, eq_to
);
896 for (i
= 0; i
< (unsigned) PHI_NUM_ARGS (phi
); i
++)
898 t
= PHI_ARG_DEF (phi
, i
);
900 if (TREE_CODE (t
) != SSA_NAME
)
902 raise_value (phi
, t
, eq_to
);
906 stmt
= SSA_NAME_DEF_STMT (t
);
908 /* If any particular PHI argument is associated with
909 an abnormal edge, then we know that we should not
910 be propagating away this PHI. Go ahead and raise
911 the result of this PHI to the top of the lattice. */
912 if (SSA_NAME_OCCURS_IN_ABNORMAL_PHI (t
))
914 raise_value (phi
, var
, eq_to
);
918 /* If the defining statement for this argument is not a
919 phi node then we need to recursively start the forward
920 dataflow starting with PHI. */
921 if (TREE_CODE (stmt
) != PHI_NODE
)
923 eq_to
[SSA_NAME_VERSION (t
)] = t
;
924 raise_value (phi
, t
, eq_to
);
930 /* Now propagate the values. */
931 for (i
= 0; i
< num_ssa_names
; i
++)
933 && eq_to
[i
] != ssa_name (i
))
934 replace_immediate_uses (ssa_name (i
), eq_to
[i
]);
936 /* And remove the dead phis. */
937 for (i
= 0; i
< num_ssa_names
; i
++)
939 && eq_to
[i
] != ssa_name (i
))
941 stmt
= SSA_NAME_DEF_STMT (ssa_name (i
));
942 remove_phi_node (stmt
, 0, bb_for_stmt (stmt
));
949 struct tree_opt_pass pass_redundant_phi
=
953 kill_redundant_phi_nodes
, /* execute */
956 0, /* static_pass_number */
958 PROP_cfg
| PROP_ssa
, /* properties_required */
959 0, /* properties_provided */
960 0, /* properties_destroyed */
961 0, /* todo_flags_start */
962 TODO_dump_func
| TODO_rename_vars
963 | TODO_ggc_collect
| TODO_verify_ssa
/* todo_flags_finish */
966 /* Emit warnings for uninitialized variables. This is done in two passes.
968 The first pass notices real uses of SSA names with default definitions.
969 Such uses are unconditionally uninitialized, and we can be certain that
970 such a use is a mistake. This pass is run before most optimizations,
971 so that we catch as many as we can.
973 The second pass follows PHI nodes to find uses that are potentially
974 uninitialized. In this case we can't necessarily prove that the use
975 is really uninitialized. This pass is run after most optimizations,
976 so that we thread as many jumps and possible, and delete as much dead
977 code as possible, in order to reduce false positives. We also look
978 again for plain uninitialized variables, since optimization may have
979 changed conditionally uninitialized to unconditionally uninitialized. */
981 /* Emit a warning for T, an SSA_NAME, being uninitialized. The exact
982 warning text is in MSGID and LOCUS may contain a location or be null. */
985 warn_uninit (tree t
, const char *msgid
, location_t
*locus
)
987 tree var
= SSA_NAME_VAR (t
);
988 tree def
= SSA_NAME_DEF_STMT (t
);
990 /* Default uses (indicated by an empty definition statement),
991 are uninitialized. */
992 if (!IS_EMPTY_STMT (def
))
995 /* Except for PARMs of course, which are always initialized. */
996 if (TREE_CODE (var
) == PARM_DECL
)
999 /* Hard register variables get their initial value from the ether. */
1000 if (DECL_HARD_REGISTER (var
))
1003 /* TREE_NO_WARNING either means we already warned, or the front end
1004 wishes to suppress the warning. */
1005 if (TREE_NO_WARNING (var
))
1009 locus
= &DECL_SOURCE_LOCATION (var
);
1010 warning (msgid
, locus
, var
);
1011 TREE_NO_WARNING (var
) = 1;
1014 /* Called via walk_tree, look for SSA_NAMEs that have empty definitions
1015 and warn about them. */
1018 warn_uninitialized_var (tree
*tp
, int *walk_subtrees
, void *data
)
1020 location_t
*locus
= data
;
1023 /* We only do data flow with SSA_NAMEs, so that's all we can warn about. */
1024 if (TREE_CODE (t
) == SSA_NAME
)
1026 warn_uninit (t
, "%H'%D' is used uninitialized in this function", locus
);
1029 else if (DECL_P (t
) || TYPE_P (t
))
1035 /* Look for inputs to PHI that are SSA_NAMEs that have empty definitions
1036 and warn about them. */
1039 warn_uninitialized_phi (tree phi
)
1041 int i
, n
= PHI_NUM_ARGS (phi
);
1043 /* Don't look at memory tags. */
1044 if (!is_gimple_reg (PHI_RESULT (phi
)))
1047 for (i
= 0; i
< n
; ++i
)
1049 tree op
= PHI_ARG_DEF (phi
, i
);
1050 if (TREE_CODE (op
) == SSA_NAME
)
1051 warn_uninit (op
, "%H'%D' may be used uninitialized in this function",
1057 execute_early_warn_uninitialized (void)
1059 block_stmt_iterator bsi
;
1063 for (bsi
= bsi_start (bb
); !bsi_end_p (bsi
); bsi_next (&bsi
))
1064 walk_tree (bsi_stmt_ptr (bsi
), warn_uninitialized_var
,
1065 EXPR_LOCUS (bsi_stmt (bsi
)), NULL
);
1069 execute_late_warn_uninitialized (void)
1074 /* Re-do the plain uninitialized variable check, as optimization may have
1075 straightened control flow. Do this first so that we don't accidentally
1076 get a "may be" warning when we'd have seen an "is" warning later. */
1077 execute_early_warn_uninitialized ();
1080 for (phi
= phi_nodes (bb
); phi
; phi
= PHI_CHAIN (phi
))
1081 warn_uninitialized_phi (phi
);
1085 gate_warn_uninitialized (void)
1087 return warn_uninitialized
!= 0;
1090 struct tree_opt_pass pass_early_warn_uninitialized
=
1093 gate_warn_uninitialized
, /* gate */
1094 execute_early_warn_uninitialized
, /* execute */
1097 0, /* static_pass_number */
1099 PROP_ssa
, /* properties_required */
1100 0, /* properties_provided */
1101 0, /* properties_destroyed */
1102 0, /* todo_flags_start */
1103 0 /* todo_flags_finish */
1106 struct tree_opt_pass pass_late_warn_uninitialized
=
1109 gate_warn_uninitialized
, /* gate */
1110 execute_late_warn_uninitialized
, /* execute */
1113 0, /* static_pass_number */
1115 PROP_ssa
, /* properties_required */
1116 0, /* properties_provided */
1117 0, /* properties_destroyed */
1118 0, /* todo_flags_start */
1119 0 /* todo_flags_finish */