]> gcc.gnu.org Git - gcc.git/blame - gcc/tree-ssa-copy.c
expr.h (canonicalize_condition, [...]): Add an int argument.
[gcc.git] / gcc / tree-ssa-copy.c
CommitLineData
6de9cd9a
DN
1/* Const/copy propagation and SSA_NAME replacement support routines.
2 Copyright (C) 2004 Free Software Foundation, Inc.
3
4This file is part of GCC.
5
6GCC is free software; you can redistribute it and/or modify
7it under the terms of the GNU General Public License as published by
8the Free Software Foundation; either version 2, or (at your option)
9any later version.
10
11GCC is distributed in the hope that it will be useful,
12but WITHOUT ANY WARRANTY; without even the implied warranty of
13MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14GNU General Public License for more details.
15
16You should have received a copy of the GNU General Public License
17along with GCC; see the file COPYING. If not, write to
18the Free Software Foundation, 59 Temple Place - Suite 330,
19Boston, MA 02111-1307, USA. */
20
21#include "config.h"
22#include "system.h"
23#include "coretypes.h"
24#include "tm.h"
25#include "tree.h"
26#include "flags.h"
27#include "rtl.h"
28#include "tm_p.h"
29#include "ggc.h"
30#include "basic-block.h"
31#include "output.h"
32#include "errors.h"
33#include "expr.h"
34#include "function.h"
35#include "diagnostic.h"
36#include "timevar.h"
37#include "tree-dump.h"
38#include "tree-flow.h"
39#include "tree-pass.h"
40#include "langhooks.h"
41
42/* This file provides a handful of interfaces for performing const/copy
43 propagation and simple expression replacement which keep variable
44 annotations up-to-date.
45
46 We require that for any copy operation where the RHS and LHS have
47 a non-null memory tag that the memory tag be the same. It is OK
48 for one or both of the memory tags to be NULL.
49
50 We also require tracking if a variable is dereferenced in a load or
51 store operation.
52
53 We enforce these requirements by having all copy propagation and
54 replacements of one SSA_NAME with a different SSA_NAME to use the
55 APIs defined in this file. */
56
6de9cd9a 57
63b88252
RH
58/* Return true if we may propagate ORIG into DEST, false otherwise. */
59
60bool
61may_propagate_copy (tree dest, tree orig)
62{
63 tree type_d = TREE_TYPE (dest);
64 tree type_o = TREE_TYPE (orig);
65
66 /* Do not copy between types for which we *do* need a conversion. */
67 if (!tree_ssa_useless_type_conversion_1 (type_d, type_o))
68 return false;
69
70 /* FIXME. GIMPLE is allowing pointer assignments and comparisons of
71 pointers that have different alias sets. This means that these
72 pointers will have different memory tags associated to them.
73
74 If we allow copy propagation in these cases, statements de-referencing
75 the new pointer will now have a reference to a different memory tag
76 with potentially incorrect SSA information.
77
78 This was showing up in libjava/java/util/zip/ZipFile.java with code
79 like:
80
81 struct java.io.BufferedInputStream *T.660;
82 struct java.io.BufferedInputStream *T.647;
83 struct java.io.InputStream *is;
84 struct java.io.InputStream *is.662;
85 [ ... ]
86 T.660 = T.647;
87 is = T.660; <-- This ought to be type-casted
88 is.662 = is;
89
90 Also, f/name.c exposed a similar problem with a COND_EXPR predicate
91 that was causing DOM to generate and equivalence with two pointers of
92 alias-incompatible types:
93
94 struct _ffename_space *n;
95 struct _ffename *ns;
96 [ ... ]
97 if (n == ns)
98 goto lab;
99 ...
100 lab:
101 return n;
102
103 I think that GIMPLE should emit the appropriate type-casts. For the
104 time being, blocking copy-propagation in these cases is the safe thing
105 to do. */
106 if (TREE_CODE (dest) == SSA_NAME && TREE_CODE (orig) == SSA_NAME
107 && POINTER_TYPE_P (type_d) && POINTER_TYPE_P (type_o))
108 {
109 tree mt_dest = var_ann (SSA_NAME_VAR (dest))->type_mem_tag;
110 tree mt_orig = var_ann (SSA_NAME_VAR (orig))->type_mem_tag;
111 if (mt_dest && mt_orig && mt_dest != mt_orig)
112 return false;
bbc630f5
DN
113 else if (!lang_hooks.types_compatible_p (type_d, type_o))
114 return false;
63b88252
RH
115 }
116
117 /* If the destination is a SSA_NAME for a virtual operand, then we have
118 some special cases to handle. */
119 if (TREE_CODE (dest) == SSA_NAME && !is_gimple_reg (dest))
120 {
121 /* If both operands are SSA_NAMEs referring to virtual operands, then
122 we can always propagate. */
123 if (TREE_CODE (orig) == SSA_NAME)
124 {
125 if (!is_gimple_reg (orig))
126 return true;
127
128#ifdef ENABLE_CHECKING
129 /* If we have one real and one virtual operand, then something has
130 gone terribly wrong. */
131 if (is_gimple_reg (orig))
132 abort ();
133#endif
134 }
135
136 /* We have a "copy" from something like a constant into a virtual
137 operand. Reject these. */
138 return false;
139 }
140
141 /* If ORIG flows in from an abnormal edge, it cannot be propagated. */
142 if (TREE_CODE (orig) == SSA_NAME
143 && SSA_NAME_OCCURS_IN_ABNORMAL_PHI (orig))
144 return false;
145
146 /* If DEST is an SSA_NAME that flows from an abnormal edge or if it
147 represents a hard register, then it cannot be replaced. */
148 if (TREE_CODE (dest) == SSA_NAME
149 && (SSA_NAME_OCCURS_IN_ABNORMAL_PHI (dest)
150 || DECL_HARD_REGISTER (SSA_NAME_VAR (dest))))
151 return false;
152
153 /* Anything else is OK. */
154 return true;
155}
156
6de9cd9a 157
bbc630f5
DN
158/* Given two SSA_NAMEs pointers ORIG and NEW such that we are copy
159 propagating NEW into ORIG, consolidate aliasing information so that
160 they both share the same memory tags. */
6de9cd9a
DN
161
162static void
bbc630f5 163merge_alias_info (tree orig, tree new)
6de9cd9a 164{
bbc630f5
DN
165 tree new_sym = SSA_NAME_VAR (new);
166 tree orig_sym = SSA_NAME_VAR (orig);
167 var_ann_t new_ann = var_ann (new_sym);
168 var_ann_t orig_ann = var_ann (orig_sym);
169
6de9cd9a 170#if defined ENABLE_CHECKING
bbc630f5
DN
171 if (!POINTER_TYPE_P (TREE_TYPE (orig))
172 || !POINTER_TYPE_P (TREE_TYPE (new))
173 || !lang_hooks.types_compatible_p (TREE_TYPE (orig), TREE_TYPE (new)))
6de9cd9a 174 abort ();
6de9cd9a 175
bbc630f5
DN
176 /* If the pointed-to alias sets are different, these two pointers
177 would never have the same memory tag. In this case, NEW should
178 not have been propagated into ORIG. */
179 if (get_alias_set (TREE_TYPE (TREE_TYPE (new_sym)))
180 != get_alias_set (TREE_TYPE (TREE_TYPE (orig_sym))))
181 abort ();
182#endif
6de9cd9a 183
bbc630f5
DN
184 /* Merge type-based alias info. */
185 if (new_ann->type_mem_tag == NULL_TREE)
186 new_ann->type_mem_tag = orig_ann->type_mem_tag;
187 else if (orig_ann->type_mem_tag == NULL_TREE)
188 orig_ann->type_mem_tag = new_ann->type_mem_tag;
189 else if (new_ann->type_mem_tag != orig_ann->type_mem_tag)
190 abort ();
d00ad49b
AM
191}
192
6de9cd9a
DN
193
194/* Common code for propagate_value and replace_exp.
195
d00ad49b
AM
196 Replace use operand OP_P with VAL. FOR_PROPAGATION indicates if the
197 replacement is done to propagate a value or not. */
6de9cd9a
DN
198
199static void
bbc630f5
DN
200replace_exp_1 (use_operand_p op_p, tree val,
201 bool for_propagation ATTRIBUTE_UNUSED)
6de9cd9a 202{
bbc630f5
DN
203 tree op = USE_FROM_PTR (op_p);
204
205#if defined ENABLE_CHECKING
206 if (for_propagation
207 && TREE_CODE (op) == SSA_NAME
208 && TREE_CODE (val) == SSA_NAME
209 && !may_propagate_copy (op, val))
210 abort ();
211#endif
212
6de9cd9a
DN
213 if (TREE_CODE (val) == SSA_NAME)
214 {
bbc630f5
DN
215 if (TREE_CODE (op) == SSA_NAME && POINTER_TYPE_P (TREE_TYPE (op)))
216 merge_alias_info (op, val);
d00ad49b 217 SET_USE (op_p, val);
6de9cd9a
DN
218 }
219 else
d00ad49b 220 SET_USE (op_p, lhd_unsave_expr_now (val));
6de9cd9a
DN
221}
222
ff2ad0f7 223
6de9cd9a
DN
224/* Propagate the value VAL (assumed to be a constant or another SSA_NAME)
225 into the operand pointed by OP_P.
226
227 Use this version for const/copy propagation as it will perform additional
228 checks to ensure validity of the const/copy propagation. */
229
230void
d00ad49b 231propagate_value (use_operand_p op_p, tree val)
6de9cd9a
DN
232{
233 replace_exp_1 (op_p, val, true);
234}
235
ff2ad0f7 236
d00ad49b
AM
237/* Propagate the value VAL (assumed to be a constant or another SSA_NAME)
238 into the tree pointed by OP_P.
239
240 Use this version for const/copy propagation when SSA operands are not
241 available. It will perform the additional checks to ensure validity of
242 the const/copy propagation, but will not update any operand information.
243 Be sure to mark the stmt as modified. */
244
245void
246propagate_tree_value (tree *op_p, tree val)
247{
bbc630f5
DN
248#if defined ENABLE_CHECKING
249 if (TREE_CODE (val) == SSA_NAME
250 && TREE_CODE (*op_p) == SSA_NAME
251 && !may_propagate_copy (*op_p, val))
252 abort ();
253#endif
254
d00ad49b
AM
255 if (TREE_CODE (val) == SSA_NAME)
256 {
bbc630f5
DN
257 if (TREE_CODE (*op_p) == SSA_NAME && POINTER_TYPE_P (TREE_TYPE (*op_p)))
258 merge_alias_info (*op_p, val);
d00ad49b
AM
259 *op_p = val;
260 }
261 else
262 *op_p = lhd_unsave_expr_now (val);
263}
264
ff2ad0f7 265
6de9cd9a
DN
266/* Replace *OP_P with value VAL (assumed to be a constant or another SSA_NAME).
267
268 Use this version when not const/copy propagating values. For example,
269 PRE uses this version when building expressions as they would appear
270 in specific blocks taking into account actions of PHI nodes. */
271
272void
d00ad49b 273replace_exp (use_operand_p op_p, tree val)
6de9cd9a
DN
274{
275 replace_exp_1 (op_p, val, false);
276}
This page took 0.203157 seconds and 5 git commands to generate.