]>
Commit | Line | Data |
---|---|---|
9ae8ffe7 | 1 | /* Alias analysis for GNU C |
62e5bf5d | 2 | Copyright (C) 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, |
757e8ba2 | 3 | 2007, 2008, 2009, 2010, 2011, 2012 Free Software Foundation, Inc. |
9ae8ffe7 JL |
4 | Contributed by John Carr (jfc@mit.edu). |
5 | ||
1322177d | 6 | This file is part of GCC. |
9ae8ffe7 | 7 | |
1322177d LB |
8 | GCC is free software; you can redistribute it and/or modify it under |
9 | the terms of the GNU General Public License as published by the Free | |
9dcd6f09 | 10 | Software Foundation; either version 3, or (at your option) any later |
1322177d | 11 | version. |
9ae8ffe7 | 12 | |
1322177d LB |
13 | GCC is distributed in the hope that it will be useful, but WITHOUT ANY |
14 | WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
15 | FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
16 | for more details. | |
9ae8ffe7 JL |
17 | |
18 | You should have received a copy of the GNU General Public License | |
9dcd6f09 NC |
19 | along with GCC; see the file COPYING3. If not see |
20 | <http://www.gnu.org/licenses/>. */ | |
9ae8ffe7 JL |
21 | |
22 | #include "config.h" | |
670ee920 | 23 | #include "system.h" |
4977bab6 ZW |
24 | #include "coretypes.h" |
25 | #include "tm.h" | |
9ae8ffe7 | 26 | #include "rtl.h" |
7790df19 | 27 | #include "tree.h" |
6baf1cc8 | 28 | #include "tm_p.h" |
49ad7cfa | 29 | #include "function.h" |
78528714 JQ |
30 | #include "alias.h" |
31 | #include "emit-rtl.h" | |
9ae8ffe7 JL |
32 | #include "regs.h" |
33 | #include "hard-reg-set.h" | |
e004f2f7 | 34 | #include "basic-block.h" |
9ae8ffe7 | 35 | #include "flags.h" |
718f9c0f | 36 | #include "diagnostic-core.h" |
eab5c70a | 37 | #include "cselib.h" |
3932261a | 38 | #include "splay-tree.h" |
ac606739 | 39 | #include "ggc.h" |
d23c55c2 | 40 | #include "langhooks.h" |
0d446150 | 41 | #include "timevar.h" |
7ee2468b | 42 | #include "dumpfile.h" |
ab780373 | 43 | #include "target.h" |
b255a036 | 44 | #include "cgraph.h" |
6fb5fa3c | 45 | #include "df.h" |
55b34b5f RG |
46 | #include "tree-ssa-alias.h" |
47 | #include "pointer-set.h" | |
48 | #include "tree-flow.h" | |
ea900239 DB |
49 | |
50 | /* The aliasing API provided here solves related but different problems: | |
51 | ||
c22cacf3 | 52 | Say there exists (in c) |
ea900239 DB |
53 | |
54 | struct X { | |
55 | struct Y y1; | |
56 | struct Z z2; | |
57 | } x1, *px1, *px2; | |
58 | ||
59 | struct Y y2, *py; | |
60 | struct Z z2, *pz; | |
61 | ||
62 | ||
308a3fe2 | 63 | py = &x1.y1; |
ea900239 DB |
64 | px2 = &x1; |
65 | ||
66 | Consider the four questions: | |
67 | ||
68 | Can a store to x1 interfere with px2->y1? | |
69 | Can a store to x1 interfere with px2->z2? | |
ea900239 DB |
70 | Can a store to x1 change the value pointed to by with py? |
71 | Can a store to x1 change the value pointed to by with pz? | |
72 | ||
73 | The answer to these questions can be yes, yes, yes, and maybe. | |
74 | ||
75 | The first two questions can be answered with a simple examination | |
76 | of the type system. If structure X contains a field of type Y then | |
073a8998 | 77 | a store through a pointer to an X can overwrite any field that is |
ea900239 DB |
78 | contained (recursively) in an X (unless we know that px1 != px2). |
79 | ||
308a3fe2 DS |
80 | The last two questions can be solved in the same way as the first |
81 | two questions but this is too conservative. The observation is | |
82 | that in some cases we can know which (if any) fields are addressed | |
83 | and if those addresses are used in bad ways. This analysis may be | |
84 | language specific. In C, arbitrary operations may be applied to | |
85 | pointers. However, there is some indication that this may be too | |
86 | conservative for some C++ types. | |
ea900239 DB |
87 | |
88 | The pass ipa-type-escape does this analysis for the types whose | |
c22cacf3 | 89 | instances do not escape across the compilation boundary. |
ea900239 DB |
90 | |
91 | Historically in GCC, these two problems were combined and a single | |
308a3fe2 | 92 | data structure that was used to represent the solution to these |
ea900239 | 93 | problems. We now have two similar but different data structures, |
308a3fe2 DS |
94 | The data structure to solve the last two questions is similar to |
95 | the first, but does not contain the fields whose address are never | |
96 | taken. For types that do escape the compilation unit, the data | |
97 | structures will have identical information. | |
ea900239 | 98 | */ |
3932261a MM |
99 | |
100 | /* The alias sets assigned to MEMs assist the back-end in determining | |
101 | which MEMs can alias which other MEMs. In general, two MEMs in | |
ac3d9668 RK |
102 | different alias sets cannot alias each other, with one important |
103 | exception. Consider something like: | |
3932261a | 104 | |
01d28c3f | 105 | struct S { int i; double d; }; |
3932261a MM |
106 | |
107 | a store to an `S' can alias something of either type `int' or type | |
108 | `double'. (However, a store to an `int' cannot alias a `double' | |
109 | and vice versa.) We indicate this via a tree structure that looks | |
110 | like: | |
c22cacf3 MS |
111 | struct S |
112 | / \ | |
3932261a | 113 | / \ |
c22cacf3 MS |
114 | |/_ _\| |
115 | int double | |
3932261a | 116 | |
ac3d9668 RK |
117 | (The arrows are directed and point downwards.) |
118 | In this situation we say the alias set for `struct S' is the | |
119 | `superset' and that those for `int' and `double' are `subsets'. | |
120 | ||
3bdf5ad1 RK |
121 | To see whether two alias sets can point to the same memory, we must |
122 | see if either alias set is a subset of the other. We need not trace | |
95bd1dd7 | 123 | past immediate descendants, however, since we propagate all |
3bdf5ad1 | 124 | grandchildren up one level. |
3932261a MM |
125 | |
126 | Alias set zero is implicitly a superset of all other alias sets. | |
127 | However, this is no actual entry for alias set zero. It is an | |
128 | error to attempt to explicitly construct a subset of zero. */ | |
129 | ||
7e5487a2 | 130 | struct GTY(()) alias_set_entry_d { |
3932261a | 131 | /* The alias set number, as stored in MEM_ALIAS_SET. */ |
4862826d | 132 | alias_set_type alias_set; |
3932261a | 133 | |
4c067742 RG |
134 | /* Nonzero if would have a child of zero: this effectively makes this |
135 | alias set the same as alias set zero. */ | |
136 | int has_zero_child; | |
137 | ||
3932261a | 138 | /* The children of the alias set. These are not just the immediate |
95bd1dd7 | 139 | children, but, in fact, all descendants. So, if we have: |
3932261a | 140 | |
ca7fd9cd | 141 | struct T { struct S s; float f; } |
3932261a MM |
142 | |
143 | continuing our example above, the children here will be all of | |
144 | `int', `double', `float', and `struct S'. */ | |
b604074c | 145 | splay_tree GTY((param1_is (int), param2_is (int))) children; |
b604074c | 146 | }; |
7e5487a2 | 147 | typedef struct alias_set_entry_d *alias_set_entry; |
9ae8ffe7 | 148 | |
ed7a4b4b | 149 | static int rtx_equal_for_memref_p (const_rtx, const_rtx); |
4682ae04 | 150 | static int memrefs_conflict_p (int, rtx, int, rtx, HOST_WIDE_INT); |
7bc980e1 | 151 | static void record_set (rtx, const_rtx, void *); |
4682ae04 AJ |
152 | static int base_alias_check (rtx, rtx, enum machine_mode, |
153 | enum machine_mode); | |
154 | static rtx find_base_value (rtx); | |
4f588890 | 155 | static int mems_in_disjoint_alias_sets_p (const_rtx, const_rtx); |
4682ae04 | 156 | static int insert_subset_children (splay_tree_node, void*); |
4862826d | 157 | static alias_set_entry get_alias_set_entry (alias_set_type); |
175a7536 | 158 | static bool nonoverlapping_component_refs_p (const_rtx, const_rtx); |
4682ae04 | 159 | static tree decl_for_component_ref (tree); |
4f588890 | 160 | static int write_dependence_p (const_rtx, const_rtx, int); |
4682ae04 | 161 | |
aa317c97 | 162 | static void memory_modified_1 (rtx, const_rtx, void *); |
9ae8ffe7 JL |
163 | |
164 | /* Set up all info needed to perform alias analysis on memory references. */ | |
165 | ||
d4b60170 | 166 | /* Returns the size in bytes of the mode of X. */ |
9ae8ffe7 JL |
167 | #define SIZE_FOR_MODE(X) (GET_MODE_SIZE (GET_MODE (X))) |
168 | ||
ea64ef27 | 169 | /* Cap the number of passes we make over the insns propagating alias |
131db6b8 SB |
170 | information through set chains. |
171 | ??? 10 is a completely arbitrary choice. This should be based on the | |
172 | maximum loop depth in the CFG, but we do not have this information | |
173 | available (even if current_loops _is_ available). */ | |
ea64ef27 | 174 | #define MAX_ALIAS_LOOP_PASSES 10 |
ca7fd9cd | 175 | |
9ae8ffe7 JL |
176 | /* reg_base_value[N] gives an address to which register N is related. |
177 | If all sets after the first add or subtract to the current value | |
178 | or otherwise modify it so it does not point to a different top level | |
179 | object, reg_base_value[N] is equal to the address part of the source | |
2a2c8203 JC |
180 | of the first set. |
181 | ||
182 | A base address can be an ADDRESS, SYMBOL_REF, or LABEL_REF. ADDRESS | |
9fc37b2b | 183 | expressions represent three types of base: |
b3b5ad95 | 184 | |
9fc37b2b RS |
185 | 1. incoming arguments. There is just one ADDRESS to represent all |
186 | arguments, since we do not know at this level whether accesses | |
187 | based on different arguments can alias. The ADDRESS has id 0. | |
b3b5ad95 | 188 | |
9fc37b2b RS |
189 | 2. stack_pointer_rtx, frame_pointer_rtx, hard_frame_pointer_rtx |
190 | (if distinct from frame_pointer_rtx) and arg_pointer_rtx. | |
191 | Each of these rtxes has a separate ADDRESS associated with it, | |
192 | each with a negative id. | |
193 | ||
194 | GCC is (and is required to be) precise in which register it | |
195 | chooses to access a particular region of stack. We can therefore | |
196 | assume that accesses based on one of these rtxes do not alias | |
197 | accesses based on another of these rtxes. | |
198 | ||
199 | 3. bases that are derived from malloc()ed memory (REG_NOALIAS). | |
200 | Each such piece of memory has a separate ADDRESS associated | |
201 | with it, each with an id greater than 0. | |
202 | ||
203 | Accesses based on one ADDRESS do not alias accesses based on other | |
204 | ADDRESSes. Accesses based on ADDRESSes in groups (2) and (3) do not | |
205 | alias globals either; the ADDRESSes have Pmode to indicate this. | |
206 | The ADDRESS in group (1) _may_ alias globals; it has VOIDmode to | |
207 | indicate this. */ | |
2a2c8203 | 208 | |
08c79682 | 209 | static GTY(()) VEC(rtx,gc) *reg_base_value; |
ac606739 | 210 | static rtx *new_reg_base_value; |
c582d54a | 211 | |
9fc37b2b RS |
212 | /* The single VOIDmode ADDRESS that represents all argument bases. |
213 | It has id 0. */ | |
214 | static GTY(()) rtx arg_base_value; | |
215 | ||
216 | /* Used to allocate unique ids to each REG_NOALIAS ADDRESS. */ | |
217 | static int unique_id; | |
218 | ||
c582d54a JH |
219 | /* We preserve the copy of old array around to avoid amount of garbage |
220 | produced. About 8% of garbage produced were attributed to this | |
221 | array. */ | |
08c79682 | 222 | static GTY((deletable)) VEC(rtx,gc) *old_reg_base_value; |
d4b60170 | 223 | |
9e412ca3 RS |
224 | /* Values of XINT (address, 0) of Pmode ADDRESS rtxes for special |
225 | registers. */ | |
226 | #define UNIQUE_BASE_VALUE_SP -1 | |
227 | #define UNIQUE_BASE_VALUE_ARGP -2 | |
228 | #define UNIQUE_BASE_VALUE_FP -3 | |
229 | #define UNIQUE_BASE_VALUE_HFP -4 | |
230 | ||
7bf84454 RS |
231 | #define static_reg_base_value \ |
232 | (this_target_rtl->x_static_reg_base_value) | |
bf1660a6 | 233 | |
08c79682 KH |
234 | #define REG_BASE_VALUE(X) \ |
235 | (REGNO (X) < VEC_length (rtx, reg_base_value) \ | |
236 | ? VEC_index (rtx, reg_base_value, REGNO (X)) : 0) | |
9ae8ffe7 | 237 | |
c13e8210 | 238 | /* Vector indexed by N giving the initial (unchanging) value known for |
9ff3c7ca | 239 | pseudo-register N. This vector is initialized in init_alias_analysis, |
bb1acb3e | 240 | and does not change until end_alias_analysis is called. */ |
9ff3c7ca | 241 | static GTY(()) VEC(rtx,gc) *reg_known_value; |
9ae8ffe7 JL |
242 | |
243 | /* Vector recording for each reg_known_value whether it is due to a | |
244 | REG_EQUIV note. Future passes (viz., reload) may replace the | |
245 | pseudo with the equivalent expression and so we account for the | |
ac3d9668 RK |
246 | dependences that would be introduced if that happens. |
247 | ||
248 | The REG_EQUIV notes created in assign_parms may mention the arg | |
249 | pointer, and there are explicit insns in the RTL that modify the | |
250 | arg pointer. Thus we must ensure that such insns don't get | |
251 | scheduled across each other because that would invalidate the | |
252 | REG_EQUIV notes. One could argue that the REG_EQUIV notes are | |
253 | wrong, but solving the problem in the scheduler will likely give | |
254 | better code, so we do it here. */ | |
9ff3c7ca | 255 | static sbitmap reg_known_equiv_p; |
9ae8ffe7 | 256 | |
2a2c8203 JC |
257 | /* True when scanning insns from the start of the rtl to the |
258 | NOTE_INSN_FUNCTION_BEG note. */ | |
83bbd9b6 | 259 | static bool copying_arguments; |
9ae8ffe7 | 260 | |
1a5640b4 KH |
261 | DEF_VEC_P(alias_set_entry); |
262 | DEF_VEC_ALLOC_P(alias_set_entry,gc); | |
263 | ||
3932261a | 264 | /* The splay-tree used to store the various alias set entries. */ |
1a5640b4 | 265 | static GTY (()) VEC(alias_set_entry,gc) *alias_sets; |
ac3d9668 | 266 | \f |
55b34b5f RG |
267 | /* Build a decomposed reference object for querying the alias-oracle |
268 | from the MEM rtx and store it in *REF. | |
269 | Returns false if MEM is not suitable for the alias-oracle. */ | |
270 | ||
271 | static bool | |
272 | ao_ref_from_mem (ao_ref *ref, const_rtx mem) | |
273 | { | |
274 | tree expr = MEM_EXPR (mem); | |
275 | tree base; | |
276 | ||
277 | if (!expr) | |
278 | return false; | |
279 | ||
280 | ao_ref_init (ref, expr); | |
281 | ||
282 | /* Get the base of the reference and see if we have to reject or | |
283 | adjust it. */ | |
284 | base = ao_ref_base (ref); | |
285 | if (base == NULL_TREE) | |
286 | return false; | |
287 | ||
366f945f RG |
288 | /* The tree oracle doesn't like to have these. */ |
289 | if (TREE_CODE (base) == FUNCTION_DECL | |
290 | || TREE_CODE (base) == LABEL_DECL) | |
291 | return false; | |
292 | ||
55b34b5f RG |
293 | /* If this is a pointer dereference of a non-SSA_NAME punt. |
294 | ??? We could replace it with a pointer to anything. */ | |
70f34814 RG |
295 | if ((INDIRECT_REF_P (base) |
296 | || TREE_CODE (base) == MEM_REF) | |
55b34b5f RG |
297 | && TREE_CODE (TREE_OPERAND (base, 0)) != SSA_NAME) |
298 | return false; | |
d15adbeb RG |
299 | if (TREE_CODE (base) == TARGET_MEM_REF |
300 | && TMR_BASE (base) | |
301 | && TREE_CODE (TMR_BASE (base)) != SSA_NAME) | |
302 | return false; | |
55b34b5f RG |
303 | |
304 | /* If this is a reference based on a partitioned decl replace the | |
305 | base with an INDIRECT_REF of the pointer representative we | |
306 | created during stack slot partitioning. */ | |
307 | if (TREE_CODE (base) == VAR_DECL | |
308 | && ! TREE_STATIC (base) | |
309 | && cfun->gimple_df->decls_to_pointers != NULL) | |
310 | { | |
311 | void *namep; | |
312 | namep = pointer_map_contains (cfun->gimple_df->decls_to_pointers, base); | |
313 | if (namep) | |
70f34814 | 314 | ref->base = build_simple_mem_ref (*(tree *)namep); |
55b34b5f | 315 | } |
d15adbeb | 316 | else if (TREE_CODE (base) == TARGET_MEM_REF |
4d948885 RG |
317 | && TREE_CODE (TMR_BASE (base)) == ADDR_EXPR |
318 | && TREE_CODE (TREE_OPERAND (TMR_BASE (base), 0)) == VAR_DECL | |
319 | && ! TREE_STATIC (TREE_OPERAND (TMR_BASE (base), 0)) | |
d15adbeb RG |
320 | && cfun->gimple_df->decls_to_pointers != NULL) |
321 | { | |
322 | void *namep; | |
323 | namep = pointer_map_contains (cfun->gimple_df->decls_to_pointers, | |
4d948885 | 324 | TREE_OPERAND (TMR_BASE (base), 0)); |
d15adbeb RG |
325 | if (namep) |
326 | ref->base = build_simple_mem_ref (*(tree *)namep); | |
327 | } | |
55b34b5f RG |
328 | |
329 | ref->ref_alias_set = MEM_ALIAS_SET (mem); | |
330 | ||
f68396a1 RG |
331 | /* If MEM_OFFSET or MEM_SIZE are unknown what we got from MEM_EXPR |
332 | is conservative, so trust it. */ | |
527210c4 | 333 | if (!MEM_OFFSET_KNOWN_P (mem) |
f5541398 | 334 | || !MEM_SIZE_KNOWN_P (mem)) |
f68396a1 | 335 | return true; |
366f945f | 336 | |
b0e96404 RG |
337 | /* If the base decl is a parameter we can have negative MEM_OFFSET in |
338 | case of promoted subregs on bigendian targets. Trust the MEM_EXPR | |
339 | here. */ | |
527210c4 RS |
340 | if (MEM_OFFSET (mem) < 0 |
341 | && (MEM_SIZE (mem) + MEM_OFFSET (mem)) * BITS_PER_UNIT == ref->size) | |
b0e96404 RG |
342 | return true; |
343 | ||
f68396a1 RG |
344 | /* Otherwise continue and refine size and offset we got from analyzing |
345 | MEM_EXPR by using MEM_SIZE and MEM_OFFSET. */ | |
346 | ||
527210c4 | 347 | ref->offset += MEM_OFFSET (mem) * BITS_PER_UNIT; |
f5541398 | 348 | ref->size = MEM_SIZE (mem) * BITS_PER_UNIT; |
b0e96404 RG |
349 | |
350 | /* The MEM may extend into adjacent fields, so adjust max_size if | |
351 | necessary. */ | |
352 | if (ref->max_size != -1 | |
353 | && ref->size > ref->max_size) | |
354 | ref->max_size = ref->size; | |
355 | ||
356 | /* If MEM_OFFSET and MEM_SIZE get us outside of the base object of | |
357 | the MEM_EXPR punt. This happens for STRICT_ALIGNMENT targets a lot. */ | |
358 | if (MEM_EXPR (mem) != get_spill_slot_decl (false) | |
359 | && (ref->offset < 0 | |
360 | || (DECL_P (ref->base) | |
361 | && (!host_integerp (DECL_SIZE (ref->base), 1) | |
362 | || (TREE_INT_CST_LOW (DECL_SIZE ((ref->base))) | |
363 | < (unsigned HOST_WIDE_INT)(ref->offset + ref->size)))))) | |
364 | return false; | |
55b34b5f RG |
365 | |
366 | return true; | |
367 | } | |
368 | ||
369 | /* Query the alias-oracle on whether the two memory rtx X and MEM may | |
370 | alias. If TBAA_P is set also apply TBAA. Returns true if the | |
371 | two rtxen may alias, false otherwise. */ | |
372 | ||
373 | static bool | |
374 | rtx_refs_may_alias_p (const_rtx x, const_rtx mem, bool tbaa_p) | |
375 | { | |
376 | ao_ref ref1, ref2; | |
377 | ||
378 | if (!ao_ref_from_mem (&ref1, x) | |
379 | || !ao_ref_from_mem (&ref2, mem)) | |
380 | return true; | |
381 | ||
55e3bc4c RG |
382 | return refs_may_alias_p_1 (&ref1, &ref2, |
383 | tbaa_p | |
384 | && MEM_ALIAS_SET (x) != 0 | |
385 | && MEM_ALIAS_SET (mem) != 0); | |
55b34b5f RG |
386 | } |
387 | ||
3932261a MM |
388 | /* Returns a pointer to the alias set entry for ALIAS_SET, if there is |
389 | such an entry, or NULL otherwise. */ | |
390 | ||
9ddb66ca | 391 | static inline alias_set_entry |
4862826d | 392 | get_alias_set_entry (alias_set_type alias_set) |
3932261a | 393 | { |
1a5640b4 | 394 | return VEC_index (alias_set_entry, alias_sets, alias_set); |
3932261a MM |
395 | } |
396 | ||
ac3d9668 RK |
397 | /* Returns nonzero if the alias sets for MEM1 and MEM2 are such that |
398 | the two MEMs cannot alias each other. */ | |
3932261a | 399 | |
9ddb66ca | 400 | static inline int |
4f588890 | 401 | mems_in_disjoint_alias_sets_p (const_rtx mem1, const_rtx mem2) |
3932261a | 402 | { |
3932261a MM |
403 | /* Perform a basic sanity check. Namely, that there are no alias sets |
404 | if we're not using strict aliasing. This helps to catch bugs | |
405 | whereby someone uses PUT_CODE, but doesn't clear MEM_ALIAS_SET, or | |
406 | where a MEM is allocated in some way other than by the use of | |
407 | gen_rtx_MEM, and the MEM_ALIAS_SET is not cleared. If we begin to | |
408 | use alias sets to indicate that spilled registers cannot alias each | |
409 | other, we might need to remove this check. */ | |
298e6adc NS |
410 | gcc_assert (flag_strict_aliasing |
411 | || (!MEM_ALIAS_SET (mem1) && !MEM_ALIAS_SET (mem2))); | |
3932261a | 412 | |
1da68f56 RK |
413 | return ! alias_sets_conflict_p (MEM_ALIAS_SET (mem1), MEM_ALIAS_SET (mem2)); |
414 | } | |
3932261a | 415 | |
1da68f56 RK |
416 | /* Insert the NODE into the splay tree given by DATA. Used by |
417 | record_alias_subset via splay_tree_foreach. */ | |
418 | ||
419 | static int | |
4682ae04 | 420 | insert_subset_children (splay_tree_node node, void *data) |
1da68f56 RK |
421 | { |
422 | splay_tree_insert ((splay_tree) data, node->key, node->value); | |
423 | ||
424 | return 0; | |
425 | } | |
426 | ||
c58936b6 DB |
427 | /* Return true if the first alias set is a subset of the second. */ |
428 | ||
429 | bool | |
4862826d | 430 | alias_set_subset_of (alias_set_type set1, alias_set_type set2) |
c58936b6 DB |
431 | { |
432 | alias_set_entry ase; | |
433 | ||
434 | /* Everything is a subset of the "aliases everything" set. */ | |
435 | if (set2 == 0) | |
436 | return true; | |
437 | ||
438 | /* Otherwise, check if set1 is a subset of set2. */ | |
439 | ase = get_alias_set_entry (set2); | |
440 | if (ase != 0 | |
038a39d1 | 441 | && (ase->has_zero_child |
a7a512be RG |
442 | || splay_tree_lookup (ase->children, |
443 | (splay_tree_key) set1))) | |
c58936b6 DB |
444 | return true; |
445 | return false; | |
446 | } | |
447 | ||
1da68f56 RK |
448 | /* Return 1 if the two specified alias sets may conflict. */ |
449 | ||
450 | int | |
4862826d | 451 | alias_sets_conflict_p (alias_set_type set1, alias_set_type set2) |
1da68f56 RK |
452 | { |
453 | alias_set_entry ase; | |
454 | ||
836f7794 EB |
455 | /* The easy case. */ |
456 | if (alias_sets_must_conflict_p (set1, set2)) | |
1da68f56 | 457 | return 1; |
3932261a | 458 | |
3bdf5ad1 | 459 | /* See if the first alias set is a subset of the second. */ |
1da68f56 | 460 | ase = get_alias_set_entry (set1); |
2bf105ab RK |
461 | if (ase != 0 |
462 | && (ase->has_zero_child | |
463 | || splay_tree_lookup (ase->children, | |
1da68f56 RK |
464 | (splay_tree_key) set2))) |
465 | return 1; | |
3932261a MM |
466 | |
467 | /* Now do the same, but with the alias sets reversed. */ | |
1da68f56 | 468 | ase = get_alias_set_entry (set2); |
2bf105ab RK |
469 | if (ase != 0 |
470 | && (ase->has_zero_child | |
471 | || splay_tree_lookup (ase->children, | |
1da68f56 RK |
472 | (splay_tree_key) set1))) |
473 | return 1; | |
3932261a | 474 | |
1da68f56 | 475 | /* The two alias sets are distinct and neither one is the |
836f7794 | 476 | child of the other. Therefore, they cannot conflict. */ |
1da68f56 | 477 | return 0; |
3932261a | 478 | } |
5399d643 | 479 | |
836f7794 | 480 | /* Return 1 if the two specified alias sets will always conflict. */ |
5399d643 JW |
481 | |
482 | int | |
4862826d | 483 | alias_sets_must_conflict_p (alias_set_type set1, alias_set_type set2) |
5399d643 JW |
484 | { |
485 | if (set1 == 0 || set2 == 0 || set1 == set2) | |
486 | return 1; | |
487 | ||
488 | return 0; | |
489 | } | |
490 | ||
1da68f56 RK |
491 | /* Return 1 if any MEM object of type T1 will always conflict (using the |
492 | dependency routines in this file) with any MEM object of type T2. | |
493 | This is used when allocating temporary storage. If T1 and/or T2 are | |
494 | NULL_TREE, it means we know nothing about the storage. */ | |
495 | ||
496 | int | |
4682ae04 | 497 | objects_must_conflict_p (tree t1, tree t2) |
1da68f56 | 498 | { |
4862826d | 499 | alias_set_type set1, set2; |
82d610ec | 500 | |
e8ea2809 RK |
501 | /* If neither has a type specified, we don't know if they'll conflict |
502 | because we may be using them to store objects of various types, for | |
503 | example the argument and local variables areas of inlined functions. */ | |
981a4c34 | 504 | if (t1 == 0 && t2 == 0) |
e8ea2809 RK |
505 | return 0; |
506 | ||
1da68f56 RK |
507 | /* If they are the same type, they must conflict. */ |
508 | if (t1 == t2 | |
509 | /* Likewise if both are volatile. */ | |
510 | || (t1 != 0 && TYPE_VOLATILE (t1) && t2 != 0 && TYPE_VOLATILE (t2))) | |
511 | return 1; | |
512 | ||
82d610ec RK |
513 | set1 = t1 ? get_alias_set (t1) : 0; |
514 | set2 = t2 ? get_alias_set (t2) : 0; | |
1da68f56 | 515 | |
836f7794 EB |
516 | /* We can't use alias_sets_conflict_p because we must make sure |
517 | that every subtype of t1 will conflict with every subtype of | |
82d610ec RK |
518 | t2 for which a pair of subobjects of these respective subtypes |
519 | overlaps on the stack. */ | |
836f7794 | 520 | return alias_sets_must_conflict_p (set1, set2); |
1da68f56 RK |
521 | } |
522 | \f | |
2039d7aa RH |
523 | /* Return true if all nested component references handled by |
524 | get_inner_reference in T are such that we should use the alias set | |
525 | provided by the object at the heart of T. | |
526 | ||
527 | This is true for non-addressable components (which don't have their | |
528 | own alias set), as well as components of objects in alias set zero. | |
529 | This later point is a special case wherein we wish to override the | |
530 | alias set used by the component, but we don't have per-FIELD_DECL | |
531 | assignable alias sets. */ | |
532 | ||
533 | bool | |
22ea9ec0 | 534 | component_uses_parent_alias_set (const_tree t) |
6e24b709 | 535 | { |
afe84921 RH |
536 | while (1) |
537 | { | |
2039d7aa | 538 | /* If we're at the end, it vacuously uses its own alias set. */ |
afe84921 | 539 | if (!handled_component_p (t)) |
2039d7aa | 540 | return false; |
afe84921 RH |
541 | |
542 | switch (TREE_CODE (t)) | |
543 | { | |
544 | case COMPONENT_REF: | |
545 | if (DECL_NONADDRESSABLE_P (TREE_OPERAND (t, 1))) | |
2039d7aa | 546 | return true; |
afe84921 RH |
547 | break; |
548 | ||
549 | case ARRAY_REF: | |
550 | case ARRAY_RANGE_REF: | |
551 | if (TYPE_NONALIASED_COMPONENT (TREE_TYPE (TREE_OPERAND (t, 0)))) | |
2039d7aa | 552 | return true; |
afe84921 RH |
553 | break; |
554 | ||
555 | case REALPART_EXPR: | |
556 | case IMAGPART_EXPR: | |
557 | break; | |
558 | ||
559 | default: | |
560 | /* Bitfields and casts are never addressable. */ | |
2039d7aa | 561 | return true; |
afe84921 RH |
562 | } |
563 | ||
564 | t = TREE_OPERAND (t, 0); | |
2039d7aa RH |
565 | if (get_alias_set (TREE_TYPE (t)) == 0) |
566 | return true; | |
afe84921 | 567 | } |
6e24b709 RK |
568 | } |
569 | ||
5006671f RG |
570 | /* Return the alias set for the memory pointed to by T, which may be |
571 | either a type or an expression. Return -1 if there is nothing | |
572 | special about dereferencing T. */ | |
573 | ||
574 | static alias_set_type | |
575 | get_deref_alias_set_1 (tree t) | |
576 | { | |
577 | /* If we're not doing any alias analysis, just assume everything | |
578 | aliases everything else. */ | |
579 | if (!flag_strict_aliasing) | |
580 | return 0; | |
581 | ||
5b21f0f3 | 582 | /* All we care about is the type. */ |
5006671f | 583 | if (! TYPE_P (t)) |
5b21f0f3 | 584 | t = TREE_TYPE (t); |
5006671f RG |
585 | |
586 | /* If we have an INDIRECT_REF via a void pointer, we don't | |
587 | know anything about what that might alias. Likewise if the | |
588 | pointer is marked that way. */ | |
589 | if (TREE_CODE (TREE_TYPE (t)) == VOID_TYPE | |
590 | || TYPE_REF_CAN_ALIAS_ALL (t)) | |
591 | return 0; | |
592 | ||
593 | return -1; | |
594 | } | |
595 | ||
596 | /* Return the alias set for the memory pointed to by T, which may be | |
597 | either a type or an expression. */ | |
598 | ||
599 | alias_set_type | |
600 | get_deref_alias_set (tree t) | |
601 | { | |
602 | alias_set_type set = get_deref_alias_set_1 (t); | |
603 | ||
604 | /* Fall back to the alias-set of the pointed-to type. */ | |
605 | if (set == -1) | |
606 | { | |
607 | if (! TYPE_P (t)) | |
608 | t = TREE_TYPE (t); | |
609 | set = get_alias_set (TREE_TYPE (t)); | |
610 | } | |
611 | ||
612 | return set; | |
613 | } | |
614 | ||
3bdf5ad1 RK |
615 | /* Return the alias set for T, which may be either a type or an |
616 | expression. Call language-specific routine for help, if needed. */ | |
617 | ||
4862826d | 618 | alias_set_type |
4682ae04 | 619 | get_alias_set (tree t) |
3bdf5ad1 | 620 | { |
4862826d | 621 | alias_set_type set; |
3bdf5ad1 RK |
622 | |
623 | /* If we're not doing any alias analysis, just assume everything | |
624 | aliases everything else. Also return 0 if this or its type is | |
625 | an error. */ | |
626 | if (! flag_strict_aliasing || t == error_mark_node | |
627 | || (! TYPE_P (t) | |
628 | && (TREE_TYPE (t) == 0 || TREE_TYPE (t) == error_mark_node))) | |
629 | return 0; | |
630 | ||
631 | /* We can be passed either an expression or a type. This and the | |
f47e9b4e RK |
632 | language-specific routine may make mutually-recursive calls to each other |
633 | to figure out what to do. At each juncture, we see if this is a tree | |
634 | that the language may need to handle specially. First handle things that | |
738cc472 | 635 | aren't types. */ |
f824e5c3 | 636 | if (! TYPE_P (t)) |
3bdf5ad1 | 637 | { |
ebcc3d93 | 638 | tree inner; |
738cc472 | 639 | |
70f34814 RG |
640 | /* Give the language a chance to do something with this tree |
641 | before we look at it. */ | |
8ac61af7 | 642 | STRIP_NOPS (t); |
ae2bcd98 | 643 | set = lang_hooks.get_alias_set (t); |
8ac61af7 RK |
644 | if (set != -1) |
645 | return set; | |
646 | ||
70f34814 | 647 | /* Get the base object of the reference. */ |
ebcc3d93 | 648 | inner = t; |
6fce44af | 649 | while (handled_component_p (inner)) |
738cc472 | 650 | { |
70f34814 RG |
651 | /* If there is a VIEW_CONVERT_EXPR in the chain we cannot use |
652 | the type of any component references that wrap it to | |
653 | determine the alias-set. */ | |
654 | if (TREE_CODE (inner) == VIEW_CONVERT_EXPR) | |
655 | t = TREE_OPERAND (inner, 0); | |
6fce44af | 656 | inner = TREE_OPERAND (inner, 0); |
738cc472 RK |
657 | } |
658 | ||
70f34814 RG |
659 | /* Handle pointer dereferences here, they can override the |
660 | alias-set. */ | |
1b096a0a | 661 | if (INDIRECT_REF_P (inner)) |
738cc472 | 662 | { |
5006671f RG |
663 | set = get_deref_alias_set_1 (TREE_OPERAND (inner, 0)); |
664 | if (set != -1) | |
665 | return set; | |
738cc472 | 666 | } |
4b228e61 RG |
667 | else if (TREE_CODE (inner) == TARGET_MEM_REF) |
668 | return get_deref_alias_set (TMR_OFFSET (inner)); | |
70f34814 RG |
669 | else if (TREE_CODE (inner) == MEM_REF) |
670 | { | |
671 | set = get_deref_alias_set_1 (TREE_OPERAND (inner, 1)); | |
672 | if (set != -1) | |
673 | return set; | |
674 | } | |
675 | ||
676 | /* If the innermost reference is a MEM_REF that has a | |
677 | conversion embedded treat it like a VIEW_CONVERT_EXPR above, | |
678 | using the memory access type for determining the alias-set. */ | |
679 | if (TREE_CODE (inner) == MEM_REF | |
7be7d292 EB |
680 | && TYPE_MAIN_VARIANT (TREE_TYPE (inner)) |
681 | != TYPE_MAIN_VARIANT | |
682 | (TREE_TYPE (TREE_TYPE (TREE_OPERAND (inner, 1))))) | |
70f34814 | 683 | return get_deref_alias_set (TREE_OPERAND (inner, 1)); |
738cc472 RK |
684 | |
685 | /* Otherwise, pick up the outermost object that we could have a pointer | |
6fce44af | 686 | to, processing conversions as above. */ |
2039d7aa | 687 | while (component_uses_parent_alias_set (t)) |
f47e9b4e | 688 | { |
6fce44af | 689 | t = TREE_OPERAND (t, 0); |
8ac61af7 RK |
690 | STRIP_NOPS (t); |
691 | } | |
f824e5c3 | 692 | |
738cc472 RK |
693 | /* If we've already determined the alias set for a decl, just return |
694 | it. This is necessary for C++ anonymous unions, whose component | |
695 | variables don't look like union members (boo!). */ | |
5755cd38 | 696 | if (TREE_CODE (t) == VAR_DECL |
3c0cb5de | 697 | && DECL_RTL_SET_P (t) && MEM_P (DECL_RTL (t))) |
5755cd38 JM |
698 | return MEM_ALIAS_SET (DECL_RTL (t)); |
699 | ||
f824e5c3 RK |
700 | /* Now all we care about is the type. */ |
701 | t = TREE_TYPE (t); | |
3bdf5ad1 RK |
702 | } |
703 | ||
3bdf5ad1 | 704 | /* Variant qualifiers don't affect the alias set, so get the main |
daad0278 | 705 | variant. */ |
3bdf5ad1 | 706 | t = TYPE_MAIN_VARIANT (t); |
daad0278 RG |
707 | |
708 | /* Always use the canonical type as well. If this is a type that | |
709 | requires structural comparisons to identify compatible types | |
710 | use alias set zero. */ | |
711 | if (TYPE_STRUCTURAL_EQUALITY_P (t)) | |
cb9c2485 JM |
712 | { |
713 | /* Allow the language to specify another alias set for this | |
714 | type. */ | |
715 | set = lang_hooks.get_alias_set (t); | |
716 | if (set != -1) | |
717 | return set; | |
718 | return 0; | |
719 | } | |
7be7d292 | 720 | |
daad0278 | 721 | t = TYPE_CANONICAL (t); |
7be7d292 | 722 | |
96d91dcf RG |
723 | /* The canonical type should not require structural equality checks. */ |
724 | gcc_checking_assert (!TYPE_STRUCTURAL_EQUALITY_P (t)); | |
daad0278 RG |
725 | |
726 | /* If this is a type with a known alias set, return it. */ | |
738cc472 | 727 | if (TYPE_ALIAS_SET_KNOWN_P (t)) |
3bdf5ad1 RK |
728 | return TYPE_ALIAS_SET (t); |
729 | ||
36784d0e RG |
730 | /* We don't want to set TYPE_ALIAS_SET for incomplete types. */ |
731 | if (!COMPLETE_TYPE_P (t)) | |
732 | { | |
733 | /* For arrays with unknown size the conservative answer is the | |
734 | alias set of the element type. */ | |
735 | if (TREE_CODE (t) == ARRAY_TYPE) | |
736 | return get_alias_set (TREE_TYPE (t)); | |
737 | ||
738 | /* But return zero as a conservative answer for incomplete types. */ | |
739 | return 0; | |
740 | } | |
741 | ||
3bdf5ad1 | 742 | /* See if the language has special handling for this type. */ |
ae2bcd98 | 743 | set = lang_hooks.get_alias_set (t); |
8ac61af7 | 744 | if (set != -1) |
738cc472 | 745 | return set; |
2bf105ab | 746 | |
3bdf5ad1 RK |
747 | /* There are no objects of FUNCTION_TYPE, so there's no point in |
748 | using up an alias set for them. (There are, of course, pointers | |
749 | and references to functions, but that's different.) */ | |
7be7d292 | 750 | else if (TREE_CODE (t) == FUNCTION_TYPE || TREE_CODE (t) == METHOD_TYPE) |
3bdf5ad1 | 751 | set = 0; |
74d86f4f RH |
752 | |
753 | /* Unless the language specifies otherwise, let vector types alias | |
754 | their components. This avoids some nasty type punning issues in | |
755 | normal usage. And indeed lets vectors be treated more like an | |
756 | array slice. */ | |
757 | else if (TREE_CODE (t) == VECTOR_TYPE) | |
758 | set = get_alias_set (TREE_TYPE (t)); | |
759 | ||
4653cae5 RG |
760 | /* Unless the language specifies otherwise, treat array types the |
761 | same as their components. This avoids the asymmetry we get | |
762 | through recording the components. Consider accessing a | |
763 | character(kind=1) through a reference to a character(kind=1)[1:1]. | |
764 | Or consider if we want to assign integer(kind=4)[0:D.1387] and | |
765 | integer(kind=4)[4] the same alias set or not. | |
766 | Just be pragmatic here and make sure the array and its element | |
767 | type get the same alias set assigned. */ | |
7be7d292 | 768 | else if (TREE_CODE (t) == ARRAY_TYPE && !TYPE_NONALIASED_COMPONENT (t)) |
4653cae5 RG |
769 | set = get_alias_set (TREE_TYPE (t)); |
770 | ||
0ceb0201 RG |
771 | /* From the former common C and C++ langhook implementation: |
772 | ||
773 | Unfortunately, there is no canonical form of a pointer type. | |
774 | In particular, if we have `typedef int I', then `int *', and | |
775 | `I *' are different types. So, we have to pick a canonical | |
776 | representative. We do this below. | |
777 | ||
778 | Technically, this approach is actually more conservative that | |
779 | it needs to be. In particular, `const int *' and `int *' | |
780 | should be in different alias sets, according to the C and C++ | |
781 | standard, since their types are not the same, and so, | |
782 | technically, an `int **' and `const int **' cannot point at | |
783 | the same thing. | |
784 | ||
785 | But, the standard is wrong. In particular, this code is | |
786 | legal C++: | |
787 | ||
788 | int *ip; | |
789 | int **ipp = &ip; | |
790 | const int* const* cipp = ipp; | |
791 | And, it doesn't make sense for that to be legal unless you | |
792 | can dereference IPP and CIPP. So, we ignore cv-qualifiers on | |
793 | the pointed-to types. This issue has been reported to the | |
794 | C++ committee. | |
795 | ||
796 | In addition to the above canonicalization issue, with LTO | |
797 | we should also canonicalize `T (*)[]' to `T *' avoiding | |
798 | alias issues with pointer-to element types and pointer-to | |
799 | array types. | |
800 | ||
801 | Likewise we need to deal with the situation of incomplete | |
802 | pointed-to types and make `*(struct X **)&a' and | |
803 | `*(struct X {} **)&a' alias. Otherwise we will have to | |
804 | guarantee that all pointer-to incomplete type variants | |
805 | will be replaced by pointer-to complete type variants if | |
806 | they are available. | |
807 | ||
808 | With LTO the convenient situation of using `void *' to | |
809 | access and store any pointer type will also become | |
810 | more apparent (and `void *' is just another pointer-to | |
811 | incomplete type). Assigning alias-set zero to `void *' | |
812 | and all pointer-to incomplete types is a not appealing | |
813 | solution. Assigning an effective alias-set zero only | |
814 | affecting pointers might be - by recording proper subset | |
815 | relationships of all pointer alias-sets. | |
816 | ||
817 | Pointer-to function types are another grey area which | |
818 | needs caution. Globbing them all into one alias-set | |
819 | or the above effective zero set would work. | |
820 | ||
821 | For now just assign the same alias-set to all pointers. | |
822 | That's simple and avoids all the above problems. */ | |
823 | else if (POINTER_TYPE_P (t) | |
824 | && t != ptr_type_node) | |
96d91dcf | 825 | set = get_alias_set (ptr_type_node); |
0ceb0201 | 826 | |
7be7d292 | 827 | /* Otherwise make a new alias set for this type. */ |
3bdf5ad1 | 828 | else |
96d91dcf RG |
829 | { |
830 | /* Each canonical type gets its own alias set, so canonical types | |
831 | shouldn't form a tree. It doesn't really matter for types | |
832 | we handle specially above, so only check it where it possibly | |
833 | would result in a bogus alias set. */ | |
834 | gcc_checking_assert (TYPE_CANONICAL (t) == t); | |
835 | ||
836 | set = new_alias_set (); | |
837 | } | |
3bdf5ad1 RK |
838 | |
839 | TYPE_ALIAS_SET (t) = set; | |
2bf105ab | 840 | |
7be7d292 EB |
841 | /* If this is an aggregate type or a complex type, we must record any |
842 | component aliasing information. */ | |
1d79fd2c | 843 | if (AGGREGATE_TYPE_P (t) || TREE_CODE (t) == COMPLEX_TYPE) |
2bf105ab RK |
844 | record_component_aliases (t); |
845 | ||
3bdf5ad1 RK |
846 | return set; |
847 | } | |
848 | ||
849 | /* Return a brand-new alias set. */ | |
850 | ||
4862826d | 851 | alias_set_type |
4682ae04 | 852 | new_alias_set (void) |
3bdf5ad1 | 853 | { |
3bdf5ad1 | 854 | if (flag_strict_aliasing) |
9ddb66ca | 855 | { |
1a5640b4 | 856 | if (alias_sets == 0) |
f32682ca DN |
857 | VEC_safe_push (alias_set_entry, gc, alias_sets, 0); |
858 | VEC_safe_push (alias_set_entry, gc, alias_sets, 0); | |
1a5640b4 | 859 | return VEC_length (alias_set_entry, alias_sets) - 1; |
9ddb66ca | 860 | } |
3bdf5ad1 RK |
861 | else |
862 | return 0; | |
863 | } | |
3932261a | 864 | |
01d28c3f JM |
865 | /* Indicate that things in SUBSET can alias things in SUPERSET, but that |
866 | not everything that aliases SUPERSET also aliases SUBSET. For example, | |
867 | in C, a store to an `int' can alias a load of a structure containing an | |
868 | `int', and vice versa. But it can't alias a load of a 'double' member | |
869 | of the same structure. Here, the structure would be the SUPERSET and | |
870 | `int' the SUBSET. This relationship is also described in the comment at | |
871 | the beginning of this file. | |
872 | ||
873 | This function should be called only once per SUPERSET/SUBSET pair. | |
3932261a MM |
874 | |
875 | It is illegal for SUPERSET to be zero; everything is implicitly a | |
876 | subset of alias set zero. */ | |
877 | ||
794511d2 | 878 | void |
4862826d | 879 | record_alias_subset (alias_set_type superset, alias_set_type subset) |
3932261a MM |
880 | { |
881 | alias_set_entry superset_entry; | |
882 | alias_set_entry subset_entry; | |
883 | ||
f47e9b4e RK |
884 | /* It is possible in complex type situations for both sets to be the same, |
885 | in which case we can ignore this operation. */ | |
886 | if (superset == subset) | |
887 | return; | |
888 | ||
298e6adc | 889 | gcc_assert (superset); |
3932261a MM |
890 | |
891 | superset_entry = get_alias_set_entry (superset); | |
ca7fd9cd | 892 | if (superset_entry == 0) |
3932261a MM |
893 | { |
894 | /* Create an entry for the SUPERSET, so that we have a place to | |
895 | attach the SUBSET. */ | |
a9429e29 | 896 | superset_entry = ggc_alloc_cleared_alias_set_entry_d (); |
3932261a | 897 | superset_entry->alias_set = superset; |
ca7fd9cd | 898 | superset_entry->children |
a9429e29 LB |
899 | = splay_tree_new_ggc (splay_tree_compare_ints, |
900 | ggc_alloc_splay_tree_scalar_scalar_splay_tree_s, | |
901 | ggc_alloc_splay_tree_scalar_scalar_splay_tree_node_s); | |
570eb5c8 | 902 | superset_entry->has_zero_child = 0; |
1a5640b4 | 903 | VEC_replace (alias_set_entry, alias_sets, superset, superset_entry); |
3932261a MM |
904 | } |
905 | ||
2bf105ab RK |
906 | if (subset == 0) |
907 | superset_entry->has_zero_child = 1; | |
908 | else | |
909 | { | |
910 | subset_entry = get_alias_set_entry (subset); | |
911 | /* If there is an entry for the subset, enter all of its children | |
912 | (if they are not already present) as children of the SUPERSET. */ | |
ca7fd9cd | 913 | if (subset_entry) |
2bf105ab RK |
914 | { |
915 | if (subset_entry->has_zero_child) | |
916 | superset_entry->has_zero_child = 1; | |
d4b60170 | 917 | |
2bf105ab RK |
918 | splay_tree_foreach (subset_entry->children, insert_subset_children, |
919 | superset_entry->children); | |
920 | } | |
3932261a | 921 | |
2bf105ab | 922 | /* Enter the SUBSET itself as a child of the SUPERSET. */ |
ca7fd9cd | 923 | splay_tree_insert (superset_entry->children, |
2bf105ab RK |
924 | (splay_tree_key) subset, 0); |
925 | } | |
3932261a MM |
926 | } |
927 | ||
a0c33338 RK |
928 | /* Record that component types of TYPE, if any, are part of that type for |
929 | aliasing purposes. For record types, we only record component types | |
b5487346 EB |
930 | for fields that are not marked non-addressable. For array types, we |
931 | only record the component type if it is not marked non-aliased. */ | |
a0c33338 RK |
932 | |
933 | void | |
4682ae04 | 934 | record_component_aliases (tree type) |
a0c33338 | 935 | { |
4862826d | 936 | alias_set_type superset = get_alias_set (type); |
a0c33338 RK |
937 | tree field; |
938 | ||
939 | if (superset == 0) | |
940 | return; | |
941 | ||
942 | switch (TREE_CODE (type)) | |
943 | { | |
a0c33338 RK |
944 | case RECORD_TYPE: |
945 | case UNION_TYPE: | |
946 | case QUAL_UNION_TYPE: | |
6614fd40 | 947 | /* Recursively record aliases for the base classes, if there are any. */ |
fa743e8c | 948 | if (TYPE_BINFO (type)) |
ca7fd9cd KH |
949 | { |
950 | int i; | |
fa743e8c | 951 | tree binfo, base_binfo; |
c22cacf3 | 952 | |
fa743e8c NS |
953 | for (binfo = TYPE_BINFO (type), i = 0; |
954 | BINFO_BASE_ITERATE (binfo, i, base_binfo); i++) | |
955 | record_alias_subset (superset, | |
956 | get_alias_set (BINFO_TYPE (base_binfo))); | |
ca7fd9cd | 957 | } |
910ad8de | 958 | for (field = TYPE_FIELDS (type); field != 0; field = DECL_CHAIN (field)) |
b5487346 | 959 | if (TREE_CODE (field) == FIELD_DECL && !DECL_NONADDRESSABLE_P (field)) |
2bf105ab | 960 | record_alias_subset (superset, get_alias_set (TREE_TYPE (field))); |
a0c33338 RK |
961 | break; |
962 | ||
1d79fd2c JW |
963 | case COMPLEX_TYPE: |
964 | record_alias_subset (superset, get_alias_set (TREE_TYPE (type))); | |
965 | break; | |
966 | ||
4653cae5 RG |
967 | /* VECTOR_TYPE and ARRAY_TYPE share the alias set with their |
968 | element type. */ | |
969 | ||
a0c33338 RK |
970 | default: |
971 | break; | |
972 | } | |
973 | } | |
974 | ||
3bdf5ad1 RK |
975 | /* Allocate an alias set for use in storing and reading from the varargs |
976 | spill area. */ | |
977 | ||
4862826d | 978 | static GTY(()) alias_set_type varargs_set = -1; |
f103e34d | 979 | |
4862826d | 980 | alias_set_type |
4682ae04 | 981 | get_varargs_alias_set (void) |
3bdf5ad1 | 982 | { |
cd3ce9b4 JM |
983 | #if 1 |
984 | /* We now lower VA_ARG_EXPR, and there's currently no way to attach the | |
985 | varargs alias set to an INDIRECT_REF (FIXME!), so we can't | |
986 | consistently use the varargs alias set for loads from the varargs | |
987 | area. So don't use it anywhere. */ | |
988 | return 0; | |
989 | #else | |
f103e34d GK |
990 | if (varargs_set == -1) |
991 | varargs_set = new_alias_set (); | |
3bdf5ad1 | 992 | |
f103e34d | 993 | return varargs_set; |
cd3ce9b4 | 994 | #endif |
3bdf5ad1 RK |
995 | } |
996 | ||
997 | /* Likewise, but used for the fixed portions of the frame, e.g., register | |
998 | save areas. */ | |
999 | ||
4862826d | 1000 | static GTY(()) alias_set_type frame_set = -1; |
f103e34d | 1001 | |
4862826d | 1002 | alias_set_type |
4682ae04 | 1003 | get_frame_alias_set (void) |
3bdf5ad1 | 1004 | { |
f103e34d GK |
1005 | if (frame_set == -1) |
1006 | frame_set = new_alias_set (); | |
3bdf5ad1 | 1007 | |
f103e34d | 1008 | return frame_set; |
3bdf5ad1 RK |
1009 | } |
1010 | ||
9fc37b2b RS |
1011 | /* Create a new, unique base with id ID. */ |
1012 | ||
1013 | static rtx | |
1014 | unique_base_value (HOST_WIDE_INT id) | |
1015 | { | |
1016 | return gen_rtx_ADDRESS (Pmode, id); | |
1017 | } | |
1018 | ||
1019 | /* Return true if accesses based on any other base value cannot alias | |
1020 | those based on X. */ | |
1021 | ||
1022 | static bool | |
1023 | unique_base_value_p (rtx x) | |
1024 | { | |
1025 | return GET_CODE (x) == ADDRESS && GET_MODE (x) == Pmode; | |
1026 | } | |
1027 | ||
1028 | /* Return true if X is known to be a base value. */ | |
1029 | ||
1030 | static bool | |
1031 | known_base_value_p (rtx x) | |
1032 | { | |
1033 | switch (GET_CODE (x)) | |
1034 | { | |
1035 | case LABEL_REF: | |
1036 | case SYMBOL_REF: | |
1037 | return true; | |
1038 | ||
1039 | case ADDRESS: | |
1040 | /* Arguments may or may not be bases; we don't know for sure. */ | |
1041 | return GET_MODE (x) != VOIDmode; | |
1042 | ||
1043 | default: | |
1044 | return false; | |
1045 | } | |
1046 | } | |
1047 | ||
2a2c8203 JC |
1048 | /* Inside SRC, the source of a SET, find a base address. */ |
1049 | ||
9ae8ffe7 | 1050 | static rtx |
4682ae04 | 1051 | find_base_value (rtx src) |
9ae8ffe7 | 1052 | { |
713f41f9 | 1053 | unsigned int regno; |
0aacc8ed | 1054 | |
53451050 RS |
1055 | #if defined (FIND_BASE_TERM) |
1056 | /* Try machine-dependent ways to find the base term. */ | |
1057 | src = FIND_BASE_TERM (src); | |
1058 | #endif | |
1059 | ||
9ae8ffe7 JL |
1060 | switch (GET_CODE (src)) |
1061 | { | |
1062 | case SYMBOL_REF: | |
1063 | case LABEL_REF: | |
1064 | return src; | |
1065 | ||
1066 | case REG: | |
fb6754f0 | 1067 | regno = REGNO (src); |
d4b60170 | 1068 | /* At the start of a function, argument registers have known base |
2a2c8203 JC |
1069 | values which may be lost later. Returning an ADDRESS |
1070 | expression here allows optimization based on argument values | |
1071 | even when the argument registers are used for other purposes. */ | |
713f41f9 BS |
1072 | if (regno < FIRST_PSEUDO_REGISTER && copying_arguments) |
1073 | return new_reg_base_value[regno]; | |
73774bc7 | 1074 | |
eaf407a5 | 1075 | /* If a pseudo has a known base value, return it. Do not do this |
9b462c42 RH |
1076 | for non-fixed hard regs since it can result in a circular |
1077 | dependency chain for registers which have values at function entry. | |
eaf407a5 JL |
1078 | |
1079 | The test above is not sufficient because the scheduler may move | |
1080 | a copy out of an arg reg past the NOTE_INSN_FUNCTION_BEGIN. */ | |
9b462c42 | 1081 | if ((regno >= FIRST_PSEUDO_REGISTER || fixed_regs[regno]) |
08c79682 | 1082 | && regno < VEC_length (rtx, reg_base_value)) |
83bbd9b6 RH |
1083 | { |
1084 | /* If we're inside init_alias_analysis, use new_reg_base_value | |
1085 | to reduce the number of relaxation iterations. */ | |
1afdf91c | 1086 | if (new_reg_base_value && new_reg_base_value[regno] |
6fb5fa3c | 1087 | && DF_REG_DEF_COUNT (regno) == 1) |
83bbd9b6 RH |
1088 | return new_reg_base_value[regno]; |
1089 | ||
08c79682 KH |
1090 | if (VEC_index (rtx, reg_base_value, regno)) |
1091 | return VEC_index (rtx, reg_base_value, regno); | |
83bbd9b6 | 1092 | } |
73774bc7 | 1093 | |
e3f049a8 | 1094 | return 0; |
9ae8ffe7 JL |
1095 | |
1096 | case MEM: | |
1097 | /* Check for an argument passed in memory. Only record in the | |
1098 | copying-arguments block; it is too hard to track changes | |
1099 | otherwise. */ | |
1100 | if (copying_arguments | |
1101 | && (XEXP (src, 0) == arg_pointer_rtx | |
1102 | || (GET_CODE (XEXP (src, 0)) == PLUS | |
1103 | && XEXP (XEXP (src, 0), 0) == arg_pointer_rtx))) | |
9fc37b2b | 1104 | return arg_base_value; |
9ae8ffe7 JL |
1105 | return 0; |
1106 | ||
1107 | case CONST: | |
1108 | src = XEXP (src, 0); | |
1109 | if (GET_CODE (src) != PLUS && GET_CODE (src) != MINUS) | |
1110 | break; | |
d4b60170 | 1111 | |
ec5c56db | 1112 | /* ... fall through ... */ |
2a2c8203 | 1113 | |
9ae8ffe7 JL |
1114 | case PLUS: |
1115 | case MINUS: | |
2a2c8203 | 1116 | { |
ec907dd8 JL |
1117 | rtx temp, src_0 = XEXP (src, 0), src_1 = XEXP (src, 1); |
1118 | ||
0134bf2d DE |
1119 | /* If either operand is a REG that is a known pointer, then it |
1120 | is the base. */ | |
1121 | if (REG_P (src_0) && REG_POINTER (src_0)) | |
1122 | return find_base_value (src_0); | |
1123 | if (REG_P (src_1) && REG_POINTER (src_1)) | |
1124 | return find_base_value (src_1); | |
1125 | ||
ec907dd8 JL |
1126 | /* If either operand is a REG, then see if we already have |
1127 | a known value for it. */ | |
0134bf2d | 1128 | if (REG_P (src_0)) |
ec907dd8 JL |
1129 | { |
1130 | temp = find_base_value (src_0); | |
d4b60170 | 1131 | if (temp != 0) |
ec907dd8 JL |
1132 | src_0 = temp; |
1133 | } | |
1134 | ||
0134bf2d | 1135 | if (REG_P (src_1)) |
ec907dd8 JL |
1136 | { |
1137 | temp = find_base_value (src_1); | |
d4b60170 | 1138 | if (temp!= 0) |
ec907dd8 JL |
1139 | src_1 = temp; |
1140 | } | |
2a2c8203 | 1141 | |
0134bf2d DE |
1142 | /* If either base is named object or a special address |
1143 | (like an argument or stack reference), then use it for the | |
1144 | base term. */ | |
9fc37b2b | 1145 | if (src_0 != 0 && known_base_value_p (src_0)) |
0134bf2d DE |
1146 | return src_0; |
1147 | ||
9fc37b2b | 1148 | if (src_1 != 0 && known_base_value_p (src_1)) |
0134bf2d DE |
1149 | return src_1; |
1150 | ||
d4b60170 | 1151 | /* Guess which operand is the base address: |
ec907dd8 JL |
1152 | If either operand is a symbol, then it is the base. If |
1153 | either operand is a CONST_INT, then the other is the base. */ | |
481683e1 | 1154 | if (CONST_INT_P (src_1) || CONSTANT_P (src_0)) |
2a2c8203 | 1155 | return find_base_value (src_0); |
481683e1 | 1156 | else if (CONST_INT_P (src_0) || CONSTANT_P (src_1)) |
ec907dd8 JL |
1157 | return find_base_value (src_1); |
1158 | ||
9ae8ffe7 | 1159 | return 0; |
2a2c8203 JC |
1160 | } |
1161 | ||
1162 | case LO_SUM: | |
1163 | /* The standard form is (lo_sum reg sym) so look only at the | |
1164 | second operand. */ | |
1165 | return find_base_value (XEXP (src, 1)); | |
9ae8ffe7 JL |
1166 | |
1167 | case AND: | |
1168 | /* If the second operand is constant set the base | |
ec5c56db | 1169 | address to the first operand. */ |
481683e1 | 1170 | if (CONST_INT_P (XEXP (src, 1)) && INTVAL (XEXP (src, 1)) != 0) |
2a2c8203 | 1171 | return find_base_value (XEXP (src, 0)); |
9ae8ffe7 JL |
1172 | return 0; |
1173 | ||
61f0131c | 1174 | case TRUNCATE: |
5932a4d4 | 1175 | /* As we do not know which address space the pointer is referring to, we can |
d4ebfa65 BE |
1176 | handle this only if the target does not support different pointer or |
1177 | address modes depending on the address space. */ | |
1178 | if (!target_default_pointer_address_modes_p ()) | |
1179 | break; | |
61f0131c R |
1180 | if (GET_MODE_SIZE (GET_MODE (src)) < GET_MODE_SIZE (Pmode)) |
1181 | break; | |
1182 | /* Fall through. */ | |
9ae8ffe7 | 1183 | case HIGH: |
d288e53d DE |
1184 | case PRE_INC: |
1185 | case PRE_DEC: | |
1186 | case POST_INC: | |
1187 | case POST_DEC: | |
1188 | case PRE_MODIFY: | |
1189 | case POST_MODIFY: | |
2a2c8203 | 1190 | return find_base_value (XEXP (src, 0)); |
1d300e19 | 1191 | |
0aacc8ed RK |
1192 | case ZERO_EXTEND: |
1193 | case SIGN_EXTEND: /* used for NT/Alpha pointers */ | |
5932a4d4 | 1194 | /* As we do not know which address space the pointer is referring to, we can |
d4ebfa65 BE |
1195 | handle this only if the target does not support different pointer or |
1196 | address modes depending on the address space. */ | |
1197 | if (!target_default_pointer_address_modes_p ()) | |
1198 | break; | |
1199 | ||
0aacc8ed RK |
1200 | { |
1201 | rtx temp = find_base_value (XEXP (src, 0)); | |
1202 | ||
5ae6cd0d | 1203 | if (temp != 0 && CONSTANT_P (temp)) |
0aacc8ed | 1204 | temp = convert_memory_address (Pmode, temp); |
0aacc8ed RK |
1205 | |
1206 | return temp; | |
1207 | } | |
1208 | ||
1d300e19 KG |
1209 | default: |
1210 | break; | |
9ae8ffe7 JL |
1211 | } |
1212 | ||
1213 | return 0; | |
1214 | } | |
1215 | ||
9fc37b2b RS |
1216 | /* Called from init_alias_analysis indirectly through note_stores, |
1217 | or directly if DEST is a register with a REG_NOALIAS note attached. | |
1218 | SET is null in the latter case. */ | |
9ae8ffe7 | 1219 | |
d4b60170 | 1220 | /* While scanning insns to find base values, reg_seen[N] is nonzero if |
9ae8ffe7 | 1221 | register N has been set in this function. */ |
d630245f | 1222 | static sbitmap reg_seen; |
9ae8ffe7 | 1223 | |
2a2c8203 | 1224 | static void |
7bc980e1 | 1225 | record_set (rtx dest, const_rtx set, void *data ATTRIBUTE_UNUSED) |
9ae8ffe7 | 1226 | { |
b3694847 | 1227 | unsigned regno; |
9ae8ffe7 | 1228 | rtx src; |
c28b4e40 | 1229 | int n; |
9ae8ffe7 | 1230 | |
f8cfc6aa | 1231 | if (!REG_P (dest)) |
9ae8ffe7 JL |
1232 | return; |
1233 | ||
fb6754f0 | 1234 | regno = REGNO (dest); |
9ae8ffe7 | 1235 | |
7a40b8b1 | 1236 | gcc_checking_assert (regno < VEC_length (rtx, reg_base_value)); |
ac606739 | 1237 | |
c28b4e40 JW |
1238 | /* If this spans multiple hard registers, then we must indicate that every |
1239 | register has an unusable value. */ | |
1240 | if (regno < FIRST_PSEUDO_REGISTER) | |
66fd46b6 | 1241 | n = hard_regno_nregs[regno][GET_MODE (dest)]; |
c28b4e40 JW |
1242 | else |
1243 | n = 1; | |
1244 | if (n != 1) | |
1245 | { | |
1246 | while (--n >= 0) | |
1247 | { | |
d630245f | 1248 | SET_BIT (reg_seen, regno + n); |
c28b4e40 JW |
1249 | new_reg_base_value[regno + n] = 0; |
1250 | } | |
1251 | return; | |
1252 | } | |
1253 | ||
9ae8ffe7 JL |
1254 | if (set) |
1255 | { | |
1256 | /* A CLOBBER wipes out any old value but does not prevent a previously | |
1257 | unset register from acquiring a base address (i.e. reg_seen is not | |
1258 | set). */ | |
1259 | if (GET_CODE (set) == CLOBBER) | |
1260 | { | |
ec907dd8 | 1261 | new_reg_base_value[regno] = 0; |
9ae8ffe7 JL |
1262 | return; |
1263 | } | |
1264 | src = SET_SRC (set); | |
1265 | } | |
1266 | else | |
1267 | { | |
9fc37b2b | 1268 | /* There's a REG_NOALIAS note against DEST. */ |
d630245f | 1269 | if (TEST_BIT (reg_seen, regno)) |
9ae8ffe7 | 1270 | { |
ec907dd8 | 1271 | new_reg_base_value[regno] = 0; |
9ae8ffe7 JL |
1272 | return; |
1273 | } | |
d630245f | 1274 | SET_BIT (reg_seen, regno); |
9fc37b2b | 1275 | new_reg_base_value[regno] = unique_base_value (unique_id++); |
9ae8ffe7 JL |
1276 | return; |
1277 | } | |
1278 | ||
5da6f168 RS |
1279 | /* If this is not the first set of REGNO, see whether the new value |
1280 | is related to the old one. There are two cases of interest: | |
1281 | ||
1282 | (1) The register might be assigned an entirely new value | |
1283 | that has the same base term as the original set. | |
1284 | ||
1285 | (2) The set might be a simple self-modification that | |
1286 | cannot change REGNO's base value. | |
1287 | ||
1288 | If neither case holds, reject the original base value as invalid. | |
1289 | Note that the following situation is not detected: | |
1290 | ||
c22cacf3 | 1291 | extern int x, y; int *p = &x; p += (&y-&x); |
5da6f168 | 1292 | |
9ae8ffe7 JL |
1293 | ANSI C does not allow computing the difference of addresses |
1294 | of distinct top level objects. */ | |
5da6f168 RS |
1295 | if (new_reg_base_value[regno] != 0 |
1296 | && find_base_value (src) != new_reg_base_value[regno]) | |
9ae8ffe7 JL |
1297 | switch (GET_CODE (src)) |
1298 | { | |
2a2c8203 | 1299 | case LO_SUM: |
9ae8ffe7 JL |
1300 | case MINUS: |
1301 | if (XEXP (src, 0) != dest && XEXP (src, 1) != dest) | |
ec907dd8 | 1302 | new_reg_base_value[regno] = 0; |
9ae8ffe7 | 1303 | break; |
61f0131c R |
1304 | case PLUS: |
1305 | /* If the value we add in the PLUS is also a valid base value, | |
1306 | this might be the actual base value, and the original value | |
1307 | an index. */ | |
1308 | { | |
1309 | rtx other = NULL_RTX; | |
1310 | ||
1311 | if (XEXP (src, 0) == dest) | |
1312 | other = XEXP (src, 1); | |
1313 | else if (XEXP (src, 1) == dest) | |
1314 | other = XEXP (src, 0); | |
1315 | ||
1316 | if (! other || find_base_value (other)) | |
1317 | new_reg_base_value[regno] = 0; | |
1318 | break; | |
1319 | } | |
9ae8ffe7 | 1320 | case AND: |
481683e1 | 1321 | if (XEXP (src, 0) != dest || !CONST_INT_P (XEXP (src, 1))) |
ec907dd8 | 1322 | new_reg_base_value[regno] = 0; |
9ae8ffe7 | 1323 | break; |
9ae8ffe7 | 1324 | default: |
ec907dd8 | 1325 | new_reg_base_value[regno] = 0; |
9ae8ffe7 JL |
1326 | break; |
1327 | } | |
1328 | /* If this is the first set of a register, record the value. */ | |
1329 | else if ((regno >= FIRST_PSEUDO_REGISTER || ! fixed_regs[regno]) | |
d630245f | 1330 | && ! TEST_BIT (reg_seen, regno) && new_reg_base_value[regno] == 0) |
ec907dd8 | 1331 | new_reg_base_value[regno] = find_base_value (src); |
9ae8ffe7 | 1332 | |
d630245f | 1333 | SET_BIT (reg_seen, regno); |
9ae8ffe7 JL |
1334 | } |
1335 | ||
8fd0a474 AM |
1336 | /* Return REG_BASE_VALUE for REGNO. Selective scheduler uses this to avoid |
1337 | using hard registers with non-null REG_BASE_VALUE for renaming. */ | |
1338 | rtx | |
1339 | get_reg_base_value (unsigned int regno) | |
1340 | { | |
1341 | return VEC_index (rtx, reg_base_value, regno); | |
1342 | } | |
1343 | ||
bb1acb3e RH |
1344 | /* If a value is known for REGNO, return it. */ |
1345 | ||
c22cacf3 | 1346 | rtx |
bb1acb3e RH |
1347 | get_reg_known_value (unsigned int regno) |
1348 | { | |
1349 | if (regno >= FIRST_PSEUDO_REGISTER) | |
1350 | { | |
1351 | regno -= FIRST_PSEUDO_REGISTER; | |
9ff3c7ca SB |
1352 | if (regno < VEC_length (rtx, reg_known_value)) |
1353 | return VEC_index (rtx, reg_known_value, regno); | |
bb1acb3e RH |
1354 | } |
1355 | return NULL; | |
43fe47ca JW |
1356 | } |
1357 | ||
bb1acb3e RH |
1358 | /* Set it. */ |
1359 | ||
1360 | static void | |
1361 | set_reg_known_value (unsigned int regno, rtx val) | |
1362 | { | |
1363 | if (regno >= FIRST_PSEUDO_REGISTER) | |
1364 | { | |
1365 | regno -= FIRST_PSEUDO_REGISTER; | |
9ff3c7ca SB |
1366 | if (regno < VEC_length (rtx, reg_known_value)) |
1367 | VEC_replace (rtx, reg_known_value, regno, val); | |
bb1acb3e RH |
1368 | } |
1369 | } | |
1370 | ||
1371 | /* Similarly for reg_known_equiv_p. */ | |
1372 | ||
1373 | bool | |
1374 | get_reg_known_equiv_p (unsigned int regno) | |
1375 | { | |
1376 | if (regno >= FIRST_PSEUDO_REGISTER) | |
1377 | { | |
1378 | regno -= FIRST_PSEUDO_REGISTER; | |
9ff3c7ca SB |
1379 | if (regno < VEC_length (rtx, reg_known_value)) |
1380 | return TEST_BIT (reg_known_equiv_p, regno); | |
bb1acb3e RH |
1381 | } |
1382 | return false; | |
1383 | } | |
1384 | ||
1385 | static void | |
1386 | set_reg_known_equiv_p (unsigned int regno, bool val) | |
1387 | { | |
1388 | if (regno >= FIRST_PSEUDO_REGISTER) | |
1389 | { | |
1390 | regno -= FIRST_PSEUDO_REGISTER; | |
9ff3c7ca SB |
1391 | if (regno < VEC_length (rtx, reg_known_value)) |
1392 | { | |
1393 | if (val) | |
1394 | SET_BIT (reg_known_equiv_p, regno); | |
1395 | else | |
1396 | RESET_BIT (reg_known_equiv_p, regno); | |
1397 | } | |
bb1acb3e RH |
1398 | } |
1399 | } | |
1400 | ||
1401 | ||
db048faf MM |
1402 | /* Returns a canonical version of X, from the point of view alias |
1403 | analysis. (For example, if X is a MEM whose address is a register, | |
1404 | and the register has a known value (say a SYMBOL_REF), then a MEM | |
1405 | whose address is the SYMBOL_REF is returned.) */ | |
1406 | ||
1407 | rtx | |
4682ae04 | 1408 | canon_rtx (rtx x) |
9ae8ffe7 JL |
1409 | { |
1410 | /* Recursively look for equivalences. */ | |
f8cfc6aa | 1411 | if (REG_P (x) && REGNO (x) >= FIRST_PSEUDO_REGISTER) |
bb1acb3e RH |
1412 | { |
1413 | rtx t = get_reg_known_value (REGNO (x)); | |
1414 | if (t == x) | |
1415 | return x; | |
1416 | if (t) | |
1417 | return canon_rtx (t); | |
1418 | } | |
1419 | ||
1420 | if (GET_CODE (x) == PLUS) | |
9ae8ffe7 JL |
1421 | { |
1422 | rtx x0 = canon_rtx (XEXP (x, 0)); | |
1423 | rtx x1 = canon_rtx (XEXP (x, 1)); | |
1424 | ||
1425 | if (x0 != XEXP (x, 0) || x1 != XEXP (x, 1)) | |
1426 | { | |
481683e1 | 1427 | if (CONST_INT_P (x0)) |
0a81f074 | 1428 | return plus_constant (GET_MODE (x), x1, INTVAL (x0)); |
481683e1 | 1429 | else if (CONST_INT_P (x1)) |
0a81f074 | 1430 | return plus_constant (GET_MODE (x), x0, INTVAL (x1)); |
38a448ca | 1431 | return gen_rtx_PLUS (GET_MODE (x), x0, x1); |
9ae8ffe7 JL |
1432 | } |
1433 | } | |
d4b60170 | 1434 | |
9ae8ffe7 JL |
1435 | /* This gives us much better alias analysis when called from |
1436 | the loop optimizer. Note we want to leave the original | |
1437 | MEM alone, but need to return the canonicalized MEM with | |
1438 | all the flags with their original values. */ | |
3c0cb5de | 1439 | else if (MEM_P (x)) |
f1ec5147 | 1440 | x = replace_equiv_address_nv (x, canon_rtx (XEXP (x, 0))); |
d4b60170 | 1441 | |
9ae8ffe7 JL |
1442 | return x; |
1443 | } | |
1444 | ||
1445 | /* Return 1 if X and Y are identical-looking rtx's. | |
45183e03 | 1446 | Expect that X and Y has been already canonicalized. |
9ae8ffe7 JL |
1447 | |
1448 | We use the data in reg_known_value above to see if two registers with | |
1449 | different numbers are, in fact, equivalent. */ | |
1450 | ||
1451 | static int | |
ed7a4b4b | 1452 | rtx_equal_for_memref_p (const_rtx x, const_rtx y) |
9ae8ffe7 | 1453 | { |
b3694847 SS |
1454 | int i; |
1455 | int j; | |
1456 | enum rtx_code code; | |
1457 | const char *fmt; | |
9ae8ffe7 JL |
1458 | |
1459 | if (x == 0 && y == 0) | |
1460 | return 1; | |
1461 | if (x == 0 || y == 0) | |
1462 | return 0; | |
d4b60170 | 1463 | |
9ae8ffe7 JL |
1464 | if (x == y) |
1465 | return 1; | |
1466 | ||
1467 | code = GET_CODE (x); | |
1468 | /* Rtx's of different codes cannot be equal. */ | |
1469 | if (code != GET_CODE (y)) | |
1470 | return 0; | |
1471 | ||
1472 | /* (MULT:SI x y) and (MULT:HI x y) are NOT equivalent. | |
1473 | (REG:SI x) and (REG:HI x) are NOT equivalent. */ | |
1474 | ||
1475 | if (GET_MODE (x) != GET_MODE (y)) | |
1476 | return 0; | |
1477 | ||
db048faf MM |
1478 | /* Some RTL can be compared without a recursive examination. */ |
1479 | switch (code) | |
1480 | { | |
1481 | case REG: | |
1482 | return REGNO (x) == REGNO (y); | |
1483 | ||
1484 | case LABEL_REF: | |
1485 | return XEXP (x, 0) == XEXP (y, 0); | |
ca7fd9cd | 1486 | |
db048faf MM |
1487 | case SYMBOL_REF: |
1488 | return XSTR (x, 0) == XSTR (y, 0); | |
1489 | ||
40e02b4a | 1490 | case VALUE: |
d8116890 | 1491 | CASE_CONST_UNIQUE: |
db048faf MM |
1492 | /* There's no need to compare the contents of CONST_DOUBLEs or |
1493 | CONST_INTs because pointer equality is a good enough | |
1494 | comparison for these nodes. */ | |
1495 | return 0; | |
1496 | ||
db048faf MM |
1497 | default: |
1498 | break; | |
1499 | } | |
9ae8ffe7 | 1500 | |
45183e03 JH |
1501 | /* canon_rtx knows how to handle plus. No need to canonicalize. */ |
1502 | if (code == PLUS) | |
9ae8ffe7 JL |
1503 | return ((rtx_equal_for_memref_p (XEXP (x, 0), XEXP (y, 0)) |
1504 | && rtx_equal_for_memref_p (XEXP (x, 1), XEXP (y, 1))) | |
1505 | || (rtx_equal_for_memref_p (XEXP (x, 0), XEXP (y, 1)) | |
1506 | && rtx_equal_for_memref_p (XEXP (x, 1), XEXP (y, 0)))); | |
45183e03 JH |
1507 | /* For commutative operations, the RTX match if the operand match in any |
1508 | order. Also handle the simple binary and unary cases without a loop. */ | |
ec8e098d | 1509 | if (COMMUTATIVE_P (x)) |
45183e03 JH |
1510 | { |
1511 | rtx xop0 = canon_rtx (XEXP (x, 0)); | |
1512 | rtx yop0 = canon_rtx (XEXP (y, 0)); | |
1513 | rtx yop1 = canon_rtx (XEXP (y, 1)); | |
1514 | ||
1515 | return ((rtx_equal_for_memref_p (xop0, yop0) | |
1516 | && rtx_equal_for_memref_p (canon_rtx (XEXP (x, 1)), yop1)) | |
1517 | || (rtx_equal_for_memref_p (xop0, yop1) | |
1518 | && rtx_equal_for_memref_p (canon_rtx (XEXP (x, 1)), yop0))); | |
1519 | } | |
ec8e098d | 1520 | else if (NON_COMMUTATIVE_P (x)) |
45183e03 JH |
1521 | { |
1522 | return (rtx_equal_for_memref_p (canon_rtx (XEXP (x, 0)), | |
4682ae04 | 1523 | canon_rtx (XEXP (y, 0))) |
45183e03 JH |
1524 | && rtx_equal_for_memref_p (canon_rtx (XEXP (x, 1)), |
1525 | canon_rtx (XEXP (y, 1)))); | |
1526 | } | |
ec8e098d | 1527 | else if (UNARY_P (x)) |
45183e03 | 1528 | return rtx_equal_for_memref_p (canon_rtx (XEXP (x, 0)), |
4682ae04 | 1529 | canon_rtx (XEXP (y, 0))); |
9ae8ffe7 JL |
1530 | |
1531 | /* Compare the elements. If any pair of corresponding elements | |
de12be17 JC |
1532 | fail to match, return 0 for the whole things. |
1533 | ||
1534 | Limit cases to types which actually appear in addresses. */ | |
9ae8ffe7 JL |
1535 | |
1536 | fmt = GET_RTX_FORMAT (code); | |
1537 | for (i = GET_RTX_LENGTH (code) - 1; i >= 0; i--) | |
1538 | { | |
1539 | switch (fmt[i]) | |
1540 | { | |
9ae8ffe7 JL |
1541 | case 'i': |
1542 | if (XINT (x, i) != XINT (y, i)) | |
1543 | return 0; | |
1544 | break; | |
1545 | ||
9ae8ffe7 JL |
1546 | case 'E': |
1547 | /* Two vectors must have the same length. */ | |
1548 | if (XVECLEN (x, i) != XVECLEN (y, i)) | |
1549 | return 0; | |
1550 | ||
1551 | /* And the corresponding elements must match. */ | |
1552 | for (j = 0; j < XVECLEN (x, i); j++) | |
45183e03 JH |
1553 | if (rtx_equal_for_memref_p (canon_rtx (XVECEXP (x, i, j)), |
1554 | canon_rtx (XVECEXP (y, i, j))) == 0) | |
9ae8ffe7 JL |
1555 | return 0; |
1556 | break; | |
1557 | ||
1558 | case 'e': | |
45183e03 JH |
1559 | if (rtx_equal_for_memref_p (canon_rtx (XEXP (x, i)), |
1560 | canon_rtx (XEXP (y, i))) == 0) | |
9ae8ffe7 JL |
1561 | return 0; |
1562 | break; | |
1563 | ||
3237ac18 AH |
1564 | /* This can happen for asm operands. */ |
1565 | case 's': | |
1566 | if (strcmp (XSTR (x, i), XSTR (y, i))) | |
1567 | return 0; | |
1568 | break; | |
1569 | ||
aee21ba9 JL |
1570 | /* This can happen for an asm which clobbers memory. */ |
1571 | case '0': | |
1572 | break; | |
1573 | ||
9ae8ffe7 JL |
1574 | /* It is believed that rtx's at this level will never |
1575 | contain anything but integers and other rtx's, | |
1576 | except for within LABEL_REFs and SYMBOL_REFs. */ | |
1577 | default: | |
298e6adc | 1578 | gcc_unreachable (); |
9ae8ffe7 JL |
1579 | } |
1580 | } | |
1581 | return 1; | |
1582 | } | |
1583 | ||
9e412ca3 | 1584 | static rtx |
4682ae04 | 1585 | find_base_term (rtx x) |
9ae8ffe7 | 1586 | { |
eab5c70a | 1587 | cselib_val *val; |
6f2ffb4b AO |
1588 | struct elt_loc_list *l, *f; |
1589 | rtx ret; | |
eab5c70a | 1590 | |
b949ea8b JW |
1591 | #if defined (FIND_BASE_TERM) |
1592 | /* Try machine-dependent ways to find the base term. */ | |
1593 | x = FIND_BASE_TERM (x); | |
1594 | #endif | |
1595 | ||
9ae8ffe7 JL |
1596 | switch (GET_CODE (x)) |
1597 | { | |
1598 | case REG: | |
1599 | return REG_BASE_VALUE (x); | |
1600 | ||
d288e53d | 1601 | case TRUNCATE: |
5932a4d4 | 1602 | /* As we do not know which address space the pointer is referring to, we can |
d4ebfa65 BE |
1603 | handle this only if the target does not support different pointer or |
1604 | address modes depending on the address space. */ | |
1605 | if (!target_default_pointer_address_modes_p ()) | |
1606 | return 0; | |
d288e53d | 1607 | if (GET_MODE_SIZE (GET_MODE (x)) < GET_MODE_SIZE (Pmode)) |
ca7fd9cd | 1608 | return 0; |
d288e53d | 1609 | /* Fall through. */ |
9ae8ffe7 | 1610 | case HIGH: |
6d849a2a JL |
1611 | case PRE_INC: |
1612 | case PRE_DEC: | |
1613 | case POST_INC: | |
1614 | case POST_DEC: | |
d288e53d DE |
1615 | case PRE_MODIFY: |
1616 | case POST_MODIFY: | |
6d849a2a JL |
1617 | return find_base_term (XEXP (x, 0)); |
1618 | ||
1abade85 RK |
1619 | case ZERO_EXTEND: |
1620 | case SIGN_EXTEND: /* Used for Alpha/NT pointers */ | |
5932a4d4 | 1621 | /* As we do not know which address space the pointer is referring to, we can |
d4ebfa65 BE |
1622 | handle this only if the target does not support different pointer or |
1623 | address modes depending on the address space. */ | |
1624 | if (!target_default_pointer_address_modes_p ()) | |
1625 | return 0; | |
1626 | ||
1abade85 RK |
1627 | { |
1628 | rtx temp = find_base_term (XEXP (x, 0)); | |
1629 | ||
5ae6cd0d | 1630 | if (temp != 0 && CONSTANT_P (temp)) |
1abade85 | 1631 | temp = convert_memory_address (Pmode, temp); |
1abade85 RK |
1632 | |
1633 | return temp; | |
1634 | } | |
1635 | ||
eab5c70a BS |
1636 | case VALUE: |
1637 | val = CSELIB_VAL_PTR (x); | |
6f2ffb4b AO |
1638 | ret = NULL_RTX; |
1639 | ||
40e02b4a | 1640 | if (!val) |
6f2ffb4b AO |
1641 | return ret; |
1642 | ||
0fe03ac3 JJ |
1643 | if (cselib_sp_based_value_p (val)) |
1644 | return static_reg_base_value[STACK_POINTER_REGNUM]; | |
1645 | ||
6f2ffb4b AO |
1646 | f = val->locs; |
1647 | /* Temporarily reset val->locs to avoid infinite recursion. */ | |
1648 | val->locs = NULL; | |
1649 | ||
1650 | for (l = f; l; l = l->next) | |
1651 | if (GET_CODE (l->loc) == VALUE | |
1652 | && CSELIB_VAL_PTR (l->loc)->locs | |
1653 | && !CSELIB_VAL_PTR (l->loc)->locs->next | |
1654 | && CSELIB_VAL_PTR (l->loc)->locs->loc == x) | |
1655 | continue; | |
1656 | else if ((ret = find_base_term (l->loc)) != 0) | |
1657 | break; | |
1658 | ||
1659 | val->locs = f; | |
1660 | return ret; | |
eab5c70a | 1661 | |
023f059b JJ |
1662 | case LO_SUM: |
1663 | /* The standard form is (lo_sum reg sym) so look only at the | |
1664 | second operand. */ | |
1665 | return find_base_term (XEXP (x, 1)); | |
1666 | ||
9ae8ffe7 JL |
1667 | case CONST: |
1668 | x = XEXP (x, 0); | |
1669 | if (GET_CODE (x) != PLUS && GET_CODE (x) != MINUS) | |
1670 | return 0; | |
938d968e | 1671 | /* Fall through. */ |
9ae8ffe7 JL |
1672 | case PLUS: |
1673 | case MINUS: | |
1674 | { | |
3c567fae JL |
1675 | rtx tmp1 = XEXP (x, 0); |
1676 | rtx tmp2 = XEXP (x, 1); | |
1677 | ||
f5143c46 | 1678 | /* This is a little bit tricky since we have to determine which of |
3c567fae JL |
1679 | the two operands represents the real base address. Otherwise this |
1680 | routine may return the index register instead of the base register. | |
1681 | ||
1682 | That may cause us to believe no aliasing was possible, when in | |
1683 | fact aliasing is possible. | |
1684 | ||
1685 | We use a few simple tests to guess the base register. Additional | |
1686 | tests can certainly be added. For example, if one of the operands | |
1687 | is a shift or multiply, then it must be the index register and the | |
1688 | other operand is the base register. */ | |
ca7fd9cd | 1689 | |
b949ea8b JW |
1690 | if (tmp1 == pic_offset_table_rtx && CONSTANT_P (tmp2)) |
1691 | return find_base_term (tmp2); | |
1692 | ||
3c567fae JL |
1693 | /* If either operand is known to be a pointer, then use it |
1694 | to determine the base term. */ | |
3502dc9c | 1695 | if (REG_P (tmp1) && REG_POINTER (tmp1)) |
7eba2d1f LM |
1696 | { |
1697 | rtx base = find_base_term (tmp1); | |
1698 | if (base) | |
1699 | return base; | |
1700 | } | |
3c567fae | 1701 | |
3502dc9c | 1702 | if (REG_P (tmp2) && REG_POINTER (tmp2)) |
7eba2d1f LM |
1703 | { |
1704 | rtx base = find_base_term (tmp2); | |
1705 | if (base) | |
1706 | return base; | |
1707 | } | |
3c567fae JL |
1708 | |
1709 | /* Neither operand was known to be a pointer. Go ahead and find the | |
1710 | base term for both operands. */ | |
1711 | tmp1 = find_base_term (tmp1); | |
1712 | tmp2 = find_base_term (tmp2); | |
1713 | ||
1714 | /* If either base term is named object or a special address | |
1715 | (like an argument or stack reference), then use it for the | |
1716 | base term. */ | |
9fc37b2b | 1717 | if (tmp1 != 0 && known_base_value_p (tmp1)) |
3c567fae JL |
1718 | return tmp1; |
1719 | ||
9fc37b2b | 1720 | if (tmp2 != 0 && known_base_value_p (tmp2)) |
3c567fae JL |
1721 | return tmp2; |
1722 | ||
1723 | /* We could not determine which of the two operands was the | |
1724 | base register and which was the index. So we can determine | |
1725 | nothing from the base alias check. */ | |
1726 | return 0; | |
9ae8ffe7 JL |
1727 | } |
1728 | ||
1729 | case AND: | |
481683e1 | 1730 | if (CONST_INT_P (XEXP (x, 1)) && INTVAL (XEXP (x, 1)) != 0) |
d288e53d | 1731 | return find_base_term (XEXP (x, 0)); |
9ae8ffe7 JL |
1732 | return 0; |
1733 | ||
1734 | case SYMBOL_REF: | |
1735 | case LABEL_REF: | |
1736 | return x; | |
1737 | ||
1738 | default: | |
1739 | return 0; | |
1740 | } | |
1741 | } | |
1742 | ||
9e412ca3 RS |
1743 | /* Return true if accesses to address X may alias accesses based |
1744 | on the stack pointer. */ | |
1745 | ||
1746 | bool | |
1747 | may_be_sp_based_p (rtx x) | |
1748 | { | |
1749 | rtx base = find_base_term (x); | |
1750 | return !base || base == static_reg_base_value[STACK_POINTER_REGNUM]; | |
1751 | } | |
1752 | ||
9ae8ffe7 JL |
1753 | /* Return 0 if the addresses X and Y are known to point to different |
1754 | objects, 1 if they might be pointers to the same object. */ | |
1755 | ||
1756 | static int | |
4682ae04 AJ |
1757 | base_alias_check (rtx x, rtx y, enum machine_mode x_mode, |
1758 | enum machine_mode y_mode) | |
9ae8ffe7 JL |
1759 | { |
1760 | rtx x_base = find_base_term (x); | |
1761 | rtx y_base = find_base_term (y); | |
1762 | ||
1c72c7f6 JC |
1763 | /* If the address itself has no known base see if a known equivalent |
1764 | value has one. If either address still has no known base, nothing | |
1765 | is known about aliasing. */ | |
1766 | if (x_base == 0) | |
1767 | { | |
1768 | rtx x_c; | |
d4b60170 | 1769 | |
1c72c7f6 JC |
1770 | if (! flag_expensive_optimizations || (x_c = canon_rtx (x)) == x) |
1771 | return 1; | |
d4b60170 | 1772 | |
1c72c7f6 JC |
1773 | x_base = find_base_term (x_c); |
1774 | if (x_base == 0) | |
1775 | return 1; | |
1776 | } | |
9ae8ffe7 | 1777 | |
1c72c7f6 JC |
1778 | if (y_base == 0) |
1779 | { | |
1780 | rtx y_c; | |
1781 | if (! flag_expensive_optimizations || (y_c = canon_rtx (y)) == y) | |
1782 | return 1; | |
d4b60170 | 1783 | |
1c72c7f6 JC |
1784 | y_base = find_base_term (y_c); |
1785 | if (y_base == 0) | |
1786 | return 1; | |
1787 | } | |
1788 | ||
1789 | /* If the base addresses are equal nothing is known about aliasing. */ | |
1790 | if (rtx_equal_p (x_base, y_base)) | |
9ae8ffe7 JL |
1791 | return 1; |
1792 | ||
435da628 UB |
1793 | /* The base addresses are different expressions. If they are not accessed |
1794 | via AND, there is no conflict. We can bring knowledge of object | |
1795 | alignment into play here. For example, on alpha, "char a, b;" can | |
1796 | alias one another, though "char a; long b;" cannot. AND addesses may | |
1797 | implicitly alias surrounding objects; i.e. unaligned access in DImode | |
1798 | via AND address can alias all surrounding object types except those | |
1799 | with aligment 8 or higher. */ | |
1800 | if (GET_CODE (x) == AND && GET_CODE (y) == AND) | |
1801 | return 1; | |
1802 | if (GET_CODE (x) == AND | |
481683e1 | 1803 | && (!CONST_INT_P (XEXP (x, 1)) |
435da628 UB |
1804 | || (int) GET_MODE_UNIT_SIZE (y_mode) < -INTVAL (XEXP (x, 1)))) |
1805 | return 1; | |
1806 | if (GET_CODE (y) == AND | |
481683e1 | 1807 | && (!CONST_INT_P (XEXP (y, 1)) |
435da628 UB |
1808 | || (int) GET_MODE_UNIT_SIZE (x_mode) < -INTVAL (XEXP (y, 1)))) |
1809 | return 1; | |
1810 | ||
1811 | /* Differing symbols not accessed via AND never alias. */ | |
9ae8ffe7 | 1812 | if (GET_CODE (x_base) != ADDRESS && GET_CODE (y_base) != ADDRESS) |
435da628 | 1813 | return 0; |
9ae8ffe7 | 1814 | |
9fc37b2b | 1815 | if (unique_base_value_p (x_base) || unique_base_value_p (y_base)) |
9ae8ffe7 JL |
1816 | return 0; |
1817 | ||
0d3c82d6 | 1818 | return 1; |
9ae8ffe7 JL |
1819 | } |
1820 | ||
a5628378 AO |
1821 | /* Callback for for_each_rtx, that returns 1 upon encountering a VALUE |
1822 | whose UID is greater than the int uid that D points to. */ | |
1823 | ||
1824 | static int | |
1825 | refs_newer_value_cb (rtx *x, void *d) | |
1826 | { | |
1827 | if (GET_CODE (*x) == VALUE && CSELIB_VAL_PTR (*x)->uid > *(int *)d) | |
1828 | return 1; | |
1829 | ||
1830 | return 0; | |
1831 | } | |
1832 | ||
1833 | /* Return TRUE if EXPR refers to a VALUE whose uid is greater than | |
1834 | that of V. */ | |
1835 | ||
1836 | static bool | |
1837 | refs_newer_value_p (rtx expr, rtx v) | |
1838 | { | |
1839 | int minuid = CSELIB_VAL_PTR (v)->uid; | |
1840 | ||
1841 | return for_each_rtx (&expr, refs_newer_value_cb, &minuid); | |
1842 | } | |
1843 | ||
eab5c70a BS |
1844 | /* Convert the address X into something we can use. This is done by returning |
1845 | it unchanged unless it is a value; in the latter case we call cselib to get | |
1846 | a more useful rtx. */ | |
3bdf5ad1 | 1847 | |
a13d4ebf | 1848 | rtx |
4682ae04 | 1849 | get_addr (rtx x) |
eab5c70a BS |
1850 | { |
1851 | cselib_val *v; | |
1852 | struct elt_loc_list *l; | |
1853 | ||
1854 | if (GET_CODE (x) != VALUE) | |
1855 | return x; | |
1856 | v = CSELIB_VAL_PTR (x); | |
40e02b4a JH |
1857 | if (v) |
1858 | { | |
0f68ba3e AO |
1859 | bool have_equivs = cselib_have_permanent_equivalences (); |
1860 | if (have_equivs) | |
1861 | v = canonical_cselib_val (v); | |
40e02b4a JH |
1862 | for (l = v->locs; l; l = l->next) |
1863 | if (CONSTANT_P (l->loc)) | |
1864 | return l->loc; | |
1865 | for (l = v->locs; l; l = l->next) | |
0f68ba3e AO |
1866 | if (!REG_P (l->loc) && !MEM_P (l->loc) |
1867 | /* Avoid infinite recursion when potentially dealing with | |
1868 | var-tracking artificial equivalences, by skipping the | |
1869 | equivalences themselves, and not choosing expressions | |
1870 | that refer to newer VALUEs. */ | |
1871 | && (!have_equivs | |
1872 | || (GET_CODE (l->loc) != VALUE | |
1873 | && !refs_newer_value_p (l->loc, x)))) | |
a5628378 | 1874 | return l->loc; |
0f68ba3e AO |
1875 | if (have_equivs) |
1876 | { | |
1877 | for (l = v->locs; l; l = l->next) | |
1878 | if (REG_P (l->loc) | |
1879 | || (GET_CODE (l->loc) != VALUE | |
1880 | && !refs_newer_value_p (l->loc, x))) | |
1881 | return l->loc; | |
1882 | /* Return the canonical value. */ | |
1883 | return v->val_rtx; | |
1884 | } | |
1885 | if (v->locs) | |
1886 | return v->locs->loc; | |
40e02b4a | 1887 | } |
eab5c70a BS |
1888 | return x; |
1889 | } | |
1890 | ||
39cec1ac MH |
1891 | /* Return the address of the (N_REFS + 1)th memory reference to ADDR |
1892 | where SIZE is the size in bytes of the memory reference. If ADDR | |
1893 | is not modified by the memory reference then ADDR is returned. */ | |
1894 | ||
04e2b4d3 | 1895 | static rtx |
4682ae04 | 1896 | addr_side_effect_eval (rtx addr, int size, int n_refs) |
39cec1ac MH |
1897 | { |
1898 | int offset = 0; | |
ca7fd9cd | 1899 | |
39cec1ac MH |
1900 | switch (GET_CODE (addr)) |
1901 | { | |
1902 | case PRE_INC: | |
1903 | offset = (n_refs + 1) * size; | |
1904 | break; | |
1905 | case PRE_DEC: | |
1906 | offset = -(n_refs + 1) * size; | |
1907 | break; | |
1908 | case POST_INC: | |
1909 | offset = n_refs * size; | |
1910 | break; | |
1911 | case POST_DEC: | |
1912 | offset = -n_refs * size; | |
1913 | break; | |
1914 | ||
1915 | default: | |
1916 | return addr; | |
1917 | } | |
ca7fd9cd | 1918 | |
39cec1ac | 1919 | if (offset) |
45183e03 | 1920 | addr = gen_rtx_PLUS (GET_MODE (addr), XEXP (addr, 0), |
c22cacf3 | 1921 | GEN_INT (offset)); |
39cec1ac MH |
1922 | else |
1923 | addr = XEXP (addr, 0); | |
45183e03 | 1924 | addr = canon_rtx (addr); |
39cec1ac MH |
1925 | |
1926 | return addr; | |
1927 | } | |
1928 | ||
f47e08d9 RG |
1929 | /* Return one if X and Y (memory addresses) reference the |
1930 | same location in memory or if the references overlap. | |
1931 | Return zero if they do not overlap, else return | |
1932 | minus one in which case they still might reference the same location. | |
1933 | ||
1934 | C is an offset accumulator. When | |
9ae8ffe7 JL |
1935 | C is nonzero, we are testing aliases between X and Y + C. |
1936 | XSIZE is the size in bytes of the X reference, | |
1937 | similarly YSIZE is the size in bytes for Y. | |
45183e03 | 1938 | Expect that canon_rtx has been already called for X and Y. |
9ae8ffe7 JL |
1939 | |
1940 | If XSIZE or YSIZE is zero, we do not know the amount of memory being | |
1941 | referenced (the reference was BLKmode), so make the most pessimistic | |
1942 | assumptions. | |
1943 | ||
c02f035f RH |
1944 | If XSIZE or YSIZE is negative, we may access memory outside the object |
1945 | being referenced as a side effect. This can happen when using AND to | |
1946 | align memory references, as is done on the Alpha. | |
1947 | ||
9ae8ffe7 | 1948 | Nice to notice that varying addresses cannot conflict with fp if no |
f47e08d9 RG |
1949 | local variables had their addresses taken, but that's too hard now. |
1950 | ||
1951 | ??? Contrary to the tree alias oracle this does not return | |
1952 | one for X + non-constant and Y + non-constant when X and Y are equal. | |
1953 | If that is fixed the TBAA hack for union type-punning can be removed. */ | |
9ae8ffe7 | 1954 | |
9ae8ffe7 | 1955 | static int |
4682ae04 | 1956 | memrefs_conflict_p (int xsize, rtx x, int ysize, rtx y, HOST_WIDE_INT c) |
9ae8ffe7 | 1957 | { |
eab5c70a | 1958 | if (GET_CODE (x) == VALUE) |
5312b066 JJ |
1959 | { |
1960 | if (REG_P (y)) | |
1961 | { | |
24f8d71e JJ |
1962 | struct elt_loc_list *l = NULL; |
1963 | if (CSELIB_VAL_PTR (x)) | |
a5628378 AO |
1964 | for (l = canonical_cselib_val (CSELIB_VAL_PTR (x))->locs; |
1965 | l; l = l->next) | |
24f8d71e JJ |
1966 | if (REG_P (l->loc) && rtx_equal_for_memref_p (l->loc, y)) |
1967 | break; | |
5312b066 JJ |
1968 | if (l) |
1969 | x = y; | |
1970 | else | |
1971 | x = get_addr (x); | |
1972 | } | |
1973 | /* Don't call get_addr if y is the same VALUE. */ | |
1974 | else if (x != y) | |
1975 | x = get_addr (x); | |
1976 | } | |
eab5c70a | 1977 | if (GET_CODE (y) == VALUE) |
5312b066 JJ |
1978 | { |
1979 | if (REG_P (x)) | |
1980 | { | |
24f8d71e JJ |
1981 | struct elt_loc_list *l = NULL; |
1982 | if (CSELIB_VAL_PTR (y)) | |
a5628378 AO |
1983 | for (l = canonical_cselib_val (CSELIB_VAL_PTR (y))->locs; |
1984 | l; l = l->next) | |
24f8d71e JJ |
1985 | if (REG_P (l->loc) && rtx_equal_for_memref_p (l->loc, x)) |
1986 | break; | |
5312b066 JJ |
1987 | if (l) |
1988 | y = x; | |
1989 | else | |
1990 | y = get_addr (y); | |
1991 | } | |
1992 | /* Don't call get_addr if x is the same VALUE. */ | |
1993 | else if (y != x) | |
1994 | y = get_addr (y); | |
1995 | } | |
9ae8ffe7 JL |
1996 | if (GET_CODE (x) == HIGH) |
1997 | x = XEXP (x, 0); | |
1998 | else if (GET_CODE (x) == LO_SUM) | |
1999 | x = XEXP (x, 1); | |
2000 | else | |
45183e03 | 2001 | x = addr_side_effect_eval (x, xsize, 0); |
9ae8ffe7 JL |
2002 | if (GET_CODE (y) == HIGH) |
2003 | y = XEXP (y, 0); | |
2004 | else if (GET_CODE (y) == LO_SUM) | |
2005 | y = XEXP (y, 1); | |
2006 | else | |
45183e03 | 2007 | y = addr_side_effect_eval (y, ysize, 0); |
9ae8ffe7 JL |
2008 | |
2009 | if (rtx_equal_for_memref_p (x, y)) | |
2010 | { | |
c02f035f | 2011 | if (xsize <= 0 || ysize <= 0) |
9ae8ffe7 JL |
2012 | return 1; |
2013 | if (c >= 0 && xsize > c) | |
2014 | return 1; | |
2015 | if (c < 0 && ysize+c > 0) | |
2016 | return 1; | |
2017 | return 0; | |
2018 | } | |
2019 | ||
6e73e666 JC |
2020 | /* This code used to check for conflicts involving stack references and |
2021 | globals but the base address alias code now handles these cases. */ | |
9ae8ffe7 JL |
2022 | |
2023 | if (GET_CODE (x) == PLUS) | |
2024 | { | |
2025 | /* The fact that X is canonicalized means that this | |
2026 | PLUS rtx is canonicalized. */ | |
2027 | rtx x0 = XEXP (x, 0); | |
2028 | rtx x1 = XEXP (x, 1); | |
2029 | ||
2030 | if (GET_CODE (y) == PLUS) | |
2031 | { | |
2032 | /* The fact that Y is canonicalized means that this | |
2033 | PLUS rtx is canonicalized. */ | |
2034 | rtx y0 = XEXP (y, 0); | |
2035 | rtx y1 = XEXP (y, 1); | |
2036 | ||
2037 | if (rtx_equal_for_memref_p (x1, y1)) | |
2038 | return memrefs_conflict_p (xsize, x0, ysize, y0, c); | |
2039 | if (rtx_equal_for_memref_p (x0, y0)) | |
2040 | return memrefs_conflict_p (xsize, x1, ysize, y1, c); | |
481683e1 | 2041 | if (CONST_INT_P (x1)) |
63be02db | 2042 | { |
481683e1 | 2043 | if (CONST_INT_P (y1)) |
63be02db JM |
2044 | return memrefs_conflict_p (xsize, x0, ysize, y0, |
2045 | c - INTVAL (x1) + INTVAL (y1)); | |
2046 | else | |
2047 | return memrefs_conflict_p (xsize, x0, ysize, y, | |
2048 | c - INTVAL (x1)); | |
2049 | } | |
481683e1 | 2050 | else if (CONST_INT_P (y1)) |
9ae8ffe7 JL |
2051 | return memrefs_conflict_p (xsize, x, ysize, y0, c + INTVAL (y1)); |
2052 | ||
f47e08d9 | 2053 | return -1; |
9ae8ffe7 | 2054 | } |
481683e1 | 2055 | else if (CONST_INT_P (x1)) |
9ae8ffe7 JL |
2056 | return memrefs_conflict_p (xsize, x0, ysize, y, c - INTVAL (x1)); |
2057 | } | |
2058 | else if (GET_CODE (y) == PLUS) | |
2059 | { | |
2060 | /* The fact that Y is canonicalized means that this | |
2061 | PLUS rtx is canonicalized. */ | |
2062 | rtx y0 = XEXP (y, 0); | |
2063 | rtx y1 = XEXP (y, 1); | |
2064 | ||
481683e1 | 2065 | if (CONST_INT_P (y1)) |
9ae8ffe7 JL |
2066 | return memrefs_conflict_p (xsize, x, ysize, y0, c + INTVAL (y1)); |
2067 | else | |
f47e08d9 | 2068 | return -1; |
9ae8ffe7 JL |
2069 | } |
2070 | ||
2071 | if (GET_CODE (x) == GET_CODE (y)) | |
2072 | switch (GET_CODE (x)) | |
2073 | { | |
2074 | case MULT: | |
2075 | { | |
2076 | /* Handle cases where we expect the second operands to be the | |
2077 | same, and check only whether the first operand would conflict | |
2078 | or not. */ | |
2079 | rtx x0, y0; | |
2080 | rtx x1 = canon_rtx (XEXP (x, 1)); | |
2081 | rtx y1 = canon_rtx (XEXP (y, 1)); | |
2082 | if (! rtx_equal_for_memref_p (x1, y1)) | |
f47e08d9 | 2083 | return -1; |
9ae8ffe7 JL |
2084 | x0 = canon_rtx (XEXP (x, 0)); |
2085 | y0 = canon_rtx (XEXP (y, 0)); | |
2086 | if (rtx_equal_for_memref_p (x0, y0)) | |
2087 | return (xsize == 0 || ysize == 0 | |
2088 | || (c >= 0 && xsize > c) || (c < 0 && ysize+c > 0)); | |
2089 | ||
2090 | /* Can't properly adjust our sizes. */ | |
481683e1 | 2091 | if (!CONST_INT_P (x1)) |
f47e08d9 | 2092 | return -1; |
9ae8ffe7 JL |
2093 | xsize /= INTVAL (x1); |
2094 | ysize /= INTVAL (x1); | |
2095 | c /= INTVAL (x1); | |
2096 | return memrefs_conflict_p (xsize, x0, ysize, y0, c); | |
2097 | } | |
1d300e19 KG |
2098 | |
2099 | default: | |
2100 | break; | |
9ae8ffe7 JL |
2101 | } |
2102 | ||
a9bf4fe2 AO |
2103 | /* Deal with alignment ANDs by adjusting offset and size so as to |
2104 | cover the maximum range, without taking any previously known | |
2105 | alignment into account. */ | |
481683e1 | 2106 | if (GET_CODE (x) == AND && CONST_INT_P (XEXP (x, 1))) |
56ee9281 | 2107 | { |
a9bf4fe2 AO |
2108 | HOST_WIDE_INT sc = INTVAL (XEXP (x, 1)); |
2109 | unsigned HOST_WIDE_INT uc = sc; | |
2110 | if (xsize > 0 && sc < 0 && -uc == (uc & -uc)) | |
2111 | { | |
2112 | xsize -= sc + 1; | |
fe8fb1c4 | 2113 | c -= sc + 1; |
a9bf4fe2 AO |
2114 | return memrefs_conflict_p (xsize, canon_rtx (XEXP (x, 0)), |
2115 | ysize, y, c); | |
2116 | } | |
56ee9281 | 2117 | } |
481683e1 | 2118 | if (GET_CODE (y) == AND && CONST_INT_P (XEXP (y, 1))) |
c02f035f | 2119 | { |
a9bf4fe2 AO |
2120 | HOST_WIDE_INT sc = INTVAL (XEXP (y, 1)); |
2121 | unsigned HOST_WIDE_INT uc = sc; | |
2122 | if (ysize > 0 && sc < 0 && -uc == (uc & -uc)) | |
2123 | { | |
2124 | ysize -= sc + 1; | |
fe8fb1c4 | 2125 | c += sc + 1; |
a9bf4fe2 AO |
2126 | return memrefs_conflict_p (xsize, x, |
2127 | ysize, canon_rtx (XEXP (y, 0)), c); | |
2128 | } | |
c02f035f | 2129 | } |
9ae8ffe7 JL |
2130 | |
2131 | if (CONSTANT_P (x)) | |
2132 | { | |
481683e1 | 2133 | if (CONST_INT_P (x) && CONST_INT_P (y)) |
9ae8ffe7 JL |
2134 | { |
2135 | c += (INTVAL (y) - INTVAL (x)); | |
c02f035f | 2136 | return (xsize <= 0 || ysize <= 0 |
9ae8ffe7 JL |
2137 | || (c >= 0 && xsize > c) || (c < 0 && ysize+c > 0)); |
2138 | } | |
2139 | ||
2140 | if (GET_CODE (x) == CONST) | |
2141 | { | |
2142 | if (GET_CODE (y) == CONST) | |
2143 | return memrefs_conflict_p (xsize, canon_rtx (XEXP (x, 0)), | |
2144 | ysize, canon_rtx (XEXP (y, 0)), c); | |
2145 | else | |
2146 | return memrefs_conflict_p (xsize, canon_rtx (XEXP (x, 0)), | |
2147 | ysize, y, c); | |
2148 | } | |
2149 | if (GET_CODE (y) == CONST) | |
2150 | return memrefs_conflict_p (xsize, x, ysize, | |
2151 | canon_rtx (XEXP (y, 0)), c); | |
2152 | ||
2153 | if (CONSTANT_P (y)) | |
b949ea8b | 2154 | return (xsize <= 0 || ysize <= 0 |
c02f035f | 2155 | || (rtx_equal_for_memref_p (x, y) |
b949ea8b | 2156 | && ((c >= 0 && xsize > c) || (c < 0 && ysize+c > 0)))); |
9ae8ffe7 | 2157 | |
f47e08d9 | 2158 | return -1; |
9ae8ffe7 | 2159 | } |
f47e08d9 RG |
2160 | |
2161 | return -1; | |
9ae8ffe7 JL |
2162 | } |
2163 | ||
2164 | /* Functions to compute memory dependencies. | |
2165 | ||
2166 | Since we process the insns in execution order, we can build tables | |
2167 | to keep track of what registers are fixed (and not aliased), what registers | |
2168 | are varying in known ways, and what registers are varying in unknown | |
2169 | ways. | |
2170 | ||
2171 | If both memory references are volatile, then there must always be a | |
2172 | dependence between the two references, since their order can not be | |
2173 | changed. A volatile and non-volatile reference can be interchanged | |
ca7fd9cd | 2174 | though. |
9ae8ffe7 | 2175 | |
53d9622b RS |
2176 | We also must allow AND addresses, because they may generate accesses |
2177 | outside the object being referenced. This is used to generate aligned | |
2178 | addresses from unaligned addresses, for instance, the alpha | |
dc1618bc | 2179 | storeqi_unaligned pattern. */ |
9ae8ffe7 JL |
2180 | |
2181 | /* Read dependence: X is read after read in MEM takes place. There can | |
96672a3e RH |
2182 | only be a dependence here if both reads are volatile, or if either is |
2183 | an explicit barrier. */ | |
9ae8ffe7 JL |
2184 | |
2185 | int | |
4f588890 | 2186 | read_dependence (const_rtx mem, const_rtx x) |
9ae8ffe7 | 2187 | { |
96672a3e RH |
2188 | if (MEM_VOLATILE_P (x) && MEM_VOLATILE_P (mem)) |
2189 | return true; | |
2190 | if (MEM_ALIAS_SET (x) == ALIAS_SET_MEMORY_BARRIER | |
2191 | || MEM_ALIAS_SET (mem) == ALIAS_SET_MEMORY_BARRIER) | |
2192 | return true; | |
2193 | return false; | |
9ae8ffe7 JL |
2194 | } |
2195 | ||
998d7deb RH |
2196 | /* Return true if we can determine that the fields referenced cannot |
2197 | overlap for any pair of objects. */ | |
2198 | ||
2199 | static bool | |
175a7536 | 2200 | nonoverlapping_component_refs_p (const_rtx rtlx, const_rtx rtly) |
998d7deb | 2201 | { |
175a7536 | 2202 | const_tree x = MEM_EXPR (rtlx), y = MEM_EXPR (rtly); |
4f588890 | 2203 | const_tree fieldx, fieldy, typex, typey, orig_y; |
998d7deb | 2204 | |
175a7536 MM |
2205 | if (!flag_strict_aliasing |
2206 | || !x || !y | |
2207 | || TREE_CODE (x) != COMPONENT_REF | |
2208 | || TREE_CODE (y) != COMPONENT_REF) | |
4c7af939 AB |
2209 | return false; |
2210 | ||
998d7deb RH |
2211 | do |
2212 | { | |
2213 | /* The comparison has to be done at a common type, since we don't | |
d6a7951f | 2214 | know how the inheritance hierarchy works. */ |
998d7deb RH |
2215 | orig_y = y; |
2216 | do | |
2217 | { | |
2218 | fieldx = TREE_OPERAND (x, 1); | |
c05a0766 | 2219 | typex = TYPE_MAIN_VARIANT (DECL_FIELD_CONTEXT (fieldx)); |
998d7deb RH |
2220 | |
2221 | y = orig_y; | |
2222 | do | |
2223 | { | |
2224 | fieldy = TREE_OPERAND (y, 1); | |
c05a0766 | 2225 | typey = TYPE_MAIN_VARIANT (DECL_FIELD_CONTEXT (fieldy)); |
998d7deb RH |
2226 | |
2227 | if (typex == typey) | |
2228 | goto found; | |
2229 | ||
2230 | y = TREE_OPERAND (y, 0); | |
2231 | } | |
2232 | while (y && TREE_CODE (y) == COMPONENT_REF); | |
2233 | ||
2234 | x = TREE_OPERAND (x, 0); | |
2235 | } | |
2236 | while (x && TREE_CODE (x) == COMPONENT_REF); | |
998d7deb | 2237 | /* Never found a common type. */ |
c05a0766 | 2238 | return false; |
998d7deb RH |
2239 | |
2240 | found: | |
2241 | /* If we're left with accessing different fields of a structure, | |
2242 | then no overlap. */ | |
2243 | if (TREE_CODE (typex) == RECORD_TYPE | |
2244 | && fieldx != fieldy) | |
2245 | return true; | |
2246 | ||
2247 | /* The comparison on the current field failed. If we're accessing | |
2248 | a very nested structure, look at the next outer level. */ | |
2249 | x = TREE_OPERAND (x, 0); | |
2250 | y = TREE_OPERAND (y, 0); | |
2251 | } | |
2252 | while (x && y | |
2253 | && TREE_CODE (x) == COMPONENT_REF | |
2254 | && TREE_CODE (y) == COMPONENT_REF); | |
ca7fd9cd | 2255 | |
998d7deb RH |
2256 | return false; |
2257 | } | |
2258 | ||
2259 | /* Look at the bottom of the COMPONENT_REF list for a DECL, and return it. */ | |
2260 | ||
2261 | static tree | |
4682ae04 | 2262 | decl_for_component_ref (tree x) |
998d7deb RH |
2263 | { |
2264 | do | |
2265 | { | |
2266 | x = TREE_OPERAND (x, 0); | |
2267 | } | |
2268 | while (x && TREE_CODE (x) == COMPONENT_REF); | |
2269 | ||
2270 | return x && DECL_P (x) ? x : NULL_TREE; | |
2271 | } | |
2272 | ||
527210c4 RS |
2273 | /* Walk up the COMPONENT_REF list in X and adjust *OFFSET to compensate |
2274 | for the offset of the field reference. *KNOWN_P says whether the | |
2275 | offset is known. */ | |
998d7deb | 2276 | |
527210c4 RS |
2277 | static void |
2278 | adjust_offset_for_component_ref (tree x, bool *known_p, | |
2279 | HOST_WIDE_INT *offset) | |
998d7deb | 2280 | { |
527210c4 RS |
2281 | if (!*known_p) |
2282 | return; | |
ca7fd9cd | 2283 | do |
998d7deb | 2284 | { |
527210c4 | 2285 | tree xoffset = component_ref_field_offset (x); |
998d7deb RH |
2286 | tree field = TREE_OPERAND (x, 1); |
2287 | ||
527210c4 RS |
2288 | if (! host_integerp (xoffset, 1)) |
2289 | { | |
2290 | *known_p = false; | |
2291 | return; | |
2292 | } | |
2293 | *offset += (tree_low_cst (xoffset, 1) | |
998d7deb RH |
2294 | + (tree_low_cst (DECL_FIELD_BIT_OFFSET (field), 1) |
2295 | / BITS_PER_UNIT)); | |
2296 | ||
2297 | x = TREE_OPERAND (x, 0); | |
2298 | } | |
2299 | while (x && TREE_CODE (x) == COMPONENT_REF); | |
998d7deb RH |
2300 | } |
2301 | ||
95bd1dd7 | 2302 | /* Return nonzero if we can determine the exprs corresponding to memrefs |
c6ea834c BM |
2303 | X and Y and they do not overlap. |
2304 | If LOOP_VARIANT is set, skip offset-based disambiguation */ | |
a4311dfe | 2305 | |
2e4e39f6 | 2306 | int |
c6ea834c | 2307 | nonoverlapping_memrefs_p (const_rtx x, const_rtx y, bool loop_invariant) |
a4311dfe | 2308 | { |
998d7deb | 2309 | tree exprx = MEM_EXPR (x), expry = MEM_EXPR (y); |
a4311dfe RK |
2310 | rtx rtlx, rtly; |
2311 | rtx basex, basey; | |
527210c4 RS |
2312 | bool moffsetx_known_p, moffsety_known_p; |
2313 | HOST_WIDE_INT moffsetx = 0, moffsety = 0; | |
a4311dfe RK |
2314 | HOST_WIDE_INT offsetx = 0, offsety = 0, sizex, sizey, tem; |
2315 | ||
998d7deb RH |
2316 | /* Unless both have exprs, we can't tell anything. */ |
2317 | if (exprx == 0 || expry == 0) | |
2318 | return 0; | |
2b22e382 RG |
2319 | |
2320 | /* For spill-slot accesses make sure we have valid offsets. */ | |
2321 | if ((exprx == get_spill_slot_decl (false) | |
527210c4 | 2322 | && ! MEM_OFFSET_KNOWN_P (x)) |
2b22e382 | 2323 | || (expry == get_spill_slot_decl (false) |
527210c4 | 2324 | && ! MEM_OFFSET_KNOWN_P (y))) |
2b22e382 | 2325 | return 0; |
c22cacf3 | 2326 | |
998d7deb | 2327 | /* If the field reference test failed, look at the DECLs involved. */ |
527210c4 RS |
2328 | moffsetx_known_p = MEM_OFFSET_KNOWN_P (x); |
2329 | if (moffsetx_known_p) | |
2330 | moffsetx = MEM_OFFSET (x); | |
998d7deb RH |
2331 | if (TREE_CODE (exprx) == COMPONENT_REF) |
2332 | { | |
2e0c984c RG |
2333 | tree t = decl_for_component_ref (exprx); |
2334 | if (! t) | |
2335 | return 0; | |
527210c4 | 2336 | adjust_offset_for_component_ref (exprx, &moffsetx_known_p, &moffsetx); |
2e0c984c | 2337 | exprx = t; |
998d7deb | 2338 | } |
c67a1cf6 | 2339 | |
527210c4 RS |
2340 | moffsety_known_p = MEM_OFFSET_KNOWN_P (y); |
2341 | if (moffsety_known_p) | |
2342 | moffsety = MEM_OFFSET (y); | |
998d7deb RH |
2343 | if (TREE_CODE (expry) == COMPONENT_REF) |
2344 | { | |
2e0c984c RG |
2345 | tree t = decl_for_component_ref (expry); |
2346 | if (! t) | |
2347 | return 0; | |
527210c4 | 2348 | adjust_offset_for_component_ref (expry, &moffsety_known_p, &moffsety); |
2e0c984c | 2349 | expry = t; |
998d7deb RH |
2350 | } |
2351 | ||
2352 | if (! DECL_P (exprx) || ! DECL_P (expry)) | |
a4311dfe RK |
2353 | return 0; |
2354 | ||
1307c758 RG |
2355 | /* With invalid code we can end up storing into the constant pool. |
2356 | Bail out to avoid ICEing when creating RTL for this. | |
2357 | See gfortran.dg/lto/20091028-2_0.f90. */ | |
2358 | if (TREE_CODE (exprx) == CONST_DECL | |
2359 | || TREE_CODE (expry) == CONST_DECL) | |
2360 | return 1; | |
2361 | ||
998d7deb RH |
2362 | rtlx = DECL_RTL (exprx); |
2363 | rtly = DECL_RTL (expry); | |
a4311dfe | 2364 | |
1edcd60b RK |
2365 | /* If either RTL is not a MEM, it must be a REG or CONCAT, meaning they |
2366 | can't overlap unless they are the same because we never reuse that part | |
2367 | of the stack frame used for locals for spilled pseudos. */ | |
3c0cb5de | 2368 | if ((!MEM_P (rtlx) || !MEM_P (rtly)) |
1edcd60b | 2369 | && ! rtx_equal_p (rtlx, rtly)) |
a4311dfe RK |
2370 | return 1; |
2371 | ||
5932a4d4 | 2372 | /* If we have MEMs referring to different address spaces (which can |
09e881c9 BE |
2373 | potentially overlap), we cannot easily tell from the addresses |
2374 | whether the references overlap. */ | |
2375 | if (MEM_P (rtlx) && MEM_P (rtly) | |
2376 | && MEM_ADDR_SPACE (rtlx) != MEM_ADDR_SPACE (rtly)) | |
2377 | return 0; | |
2378 | ||
a4311dfe RK |
2379 | /* Get the base and offsets of both decls. If either is a register, we |
2380 | know both are and are the same, so use that as the base. The only | |
2381 | we can avoid overlap is if we can deduce that they are nonoverlapping | |
2382 | pieces of that decl, which is very rare. */ | |
3c0cb5de | 2383 | basex = MEM_P (rtlx) ? XEXP (rtlx, 0) : rtlx; |
481683e1 | 2384 | if (GET_CODE (basex) == PLUS && CONST_INT_P (XEXP (basex, 1))) |
a4311dfe RK |
2385 | offsetx = INTVAL (XEXP (basex, 1)), basex = XEXP (basex, 0); |
2386 | ||
3c0cb5de | 2387 | basey = MEM_P (rtly) ? XEXP (rtly, 0) : rtly; |
481683e1 | 2388 | if (GET_CODE (basey) == PLUS && CONST_INT_P (XEXP (basey, 1))) |
a4311dfe RK |
2389 | offsety = INTVAL (XEXP (basey, 1)), basey = XEXP (basey, 0); |
2390 | ||
d746694a | 2391 | /* If the bases are different, we know they do not overlap if both |
ca7fd9cd | 2392 | are constants or if one is a constant and the other a pointer into the |
d746694a RK |
2393 | stack frame. Otherwise a different base means we can't tell if they |
2394 | overlap or not. */ | |
2395 | if (! rtx_equal_p (basex, basey)) | |
ca7fd9cd KH |
2396 | return ((CONSTANT_P (basex) && CONSTANT_P (basey)) |
2397 | || (CONSTANT_P (basex) && REG_P (basey) | |
2398 | && REGNO_PTR_FRAME_P (REGNO (basey))) | |
2399 | || (CONSTANT_P (basey) && REG_P (basex) | |
2400 | && REGNO_PTR_FRAME_P (REGNO (basex)))); | |
a4311dfe | 2401 | |
c6ea834c BM |
2402 | /* Offset based disambiguation not appropriate for loop invariant */ |
2403 | if (loop_invariant) | |
2404 | return 0; | |
2405 | ||
3c0cb5de | 2406 | sizex = (!MEM_P (rtlx) ? (int) GET_MODE_SIZE (GET_MODE (rtlx)) |
f5541398 | 2407 | : MEM_SIZE_KNOWN_P (rtlx) ? MEM_SIZE (rtlx) |
a4311dfe | 2408 | : -1); |
3c0cb5de | 2409 | sizey = (!MEM_P (rtly) ? (int) GET_MODE_SIZE (GET_MODE (rtly)) |
f5541398 RS |
2410 | : MEM_SIZE_KNOWN_P (rtly) ? MEM_SIZE (rtly) |
2411 | : -1); | |
a4311dfe | 2412 | |
0af5bc3e RK |
2413 | /* If we have an offset for either memref, it can update the values computed |
2414 | above. */ | |
527210c4 RS |
2415 | if (moffsetx_known_p) |
2416 | offsetx += moffsetx, sizex -= moffsetx; | |
2417 | if (moffsety_known_p) | |
2418 | offsety += moffsety, sizey -= moffsety; | |
a4311dfe | 2419 | |
0af5bc3e | 2420 | /* If a memref has both a size and an offset, we can use the smaller size. |
efc981bb | 2421 | We can't do this if the offset isn't known because we must view this |
0af5bc3e | 2422 | memref as being anywhere inside the DECL's MEM. */ |
527210c4 | 2423 | if (MEM_SIZE_KNOWN_P (x) && moffsetx_known_p) |
f5541398 | 2424 | sizex = MEM_SIZE (x); |
527210c4 | 2425 | if (MEM_SIZE_KNOWN_P (y) && moffsety_known_p) |
f5541398 | 2426 | sizey = MEM_SIZE (y); |
a4311dfe RK |
2427 | |
2428 | /* Put the values of the memref with the lower offset in X's values. */ | |
2429 | if (offsetx > offsety) | |
2430 | { | |
2431 | tem = offsetx, offsetx = offsety, offsety = tem; | |
2432 | tem = sizex, sizex = sizey, sizey = tem; | |
2433 | } | |
2434 | ||
2435 | /* If we don't know the size of the lower-offset value, we can't tell | |
2436 | if they conflict. Otherwise, we do the test. */ | |
a6f7c915 | 2437 | return sizex >= 0 && offsety >= offsetx + sizex; |
a4311dfe RK |
2438 | } |
2439 | ||
9362286d SB |
2440 | /* Helper for true_dependence and canon_true_dependence. |
2441 | Checks for true dependence: X is read after store in MEM takes place. | |
9ae8ffe7 | 2442 | |
9362286d SB |
2443 | If MEM_CANONICALIZED is FALSE, then X_ADDR and MEM_ADDR should be |
2444 | NULL_RTX, and the canonical addresses of MEM and X are both computed | |
2445 | here. If MEM_CANONICALIZED, then MEM must be already canonicalized. | |
2446 | ||
2447 | If X_ADDR is non-NULL, it is used in preference of XEXP (x, 0). | |
2448 | ||
2449 | Returns 1 if there is a true dependence, 0 otherwise. */ | |
2450 | ||
2451 | static int | |
2452 | true_dependence_1 (const_rtx mem, enum machine_mode mem_mode, rtx mem_addr, | |
53d9622b | 2453 | const_rtx x, rtx x_addr, bool mem_canonicalized) |
9ae8ffe7 | 2454 | { |
49982682 | 2455 | rtx base; |
f47e08d9 | 2456 | int ret; |
9ae8ffe7 | 2457 | |
9362286d SB |
2458 | gcc_checking_assert (mem_canonicalized ? (mem_addr != NULL_RTX) |
2459 | : (mem_addr == NULL_RTX && x_addr == NULL_RTX)); | |
2460 | ||
9ae8ffe7 JL |
2461 | if (MEM_VOLATILE_P (x) && MEM_VOLATILE_P (mem)) |
2462 | return 1; | |
2463 | ||
c4484b8f | 2464 | /* (mem:BLK (scratch)) is a special mechanism to conflict with everything. |
ac3768f6 | 2465 | This is used in epilogue deallocation functions, and in cselib. */ |
c4484b8f RH |
2466 | if (GET_MODE (x) == BLKmode && GET_CODE (XEXP (x, 0)) == SCRATCH) |
2467 | return 1; | |
2468 | if (GET_MODE (mem) == BLKmode && GET_CODE (XEXP (mem, 0)) == SCRATCH) | |
2469 | return 1; | |
9cd9e512 RH |
2470 | if (MEM_ALIAS_SET (x) == ALIAS_SET_MEMORY_BARRIER |
2471 | || MEM_ALIAS_SET (mem) == ALIAS_SET_MEMORY_BARRIER) | |
2472 | return 1; | |
c4484b8f | 2473 | |
389fdba0 RH |
2474 | /* Read-only memory is by definition never modified, and therefore can't |
2475 | conflict with anything. We don't expect to find read-only set on MEM, | |
41806d92 | 2476 | but stupid user tricks can produce them, so don't die. */ |
389fdba0 | 2477 | if (MEM_READONLY_P (x)) |
9ae8ffe7 JL |
2478 | return 0; |
2479 | ||
5932a4d4 | 2480 | /* If we have MEMs referring to different address spaces (which can |
09e881c9 BE |
2481 | potentially overlap), we cannot easily tell from the addresses |
2482 | whether the references overlap. */ | |
2483 | if (MEM_ADDR_SPACE (mem) != MEM_ADDR_SPACE (x)) | |
2484 | return 1; | |
2485 | ||
9362286d SB |
2486 | if (! mem_addr) |
2487 | { | |
2488 | mem_addr = XEXP (mem, 0); | |
2489 | if (mem_mode == VOIDmode) | |
2490 | mem_mode = GET_MODE (mem); | |
2491 | } | |
2492 | ||
2493 | if (! x_addr) | |
2147c71c | 2494 | { |
a522de15 SB |
2495 | x_addr = XEXP (x, 0); |
2496 | if (!((GET_CODE (x_addr) == VALUE | |
2497 | && GET_CODE (mem_addr) != VALUE | |
2498 | && reg_mentioned_p (x_addr, mem_addr)) | |
2499 | || (GET_CODE (x_addr) != VALUE | |
2500 | && GET_CODE (mem_addr) == VALUE | |
2501 | && reg_mentioned_p (mem_addr, x_addr)))) | |
2502 | { | |
2503 | x_addr = get_addr (x_addr); | |
2504 | if (! mem_canonicalized) | |
2505 | mem_addr = get_addr (mem_addr); | |
2506 | } | |
2147c71c | 2507 | } |
eab5c70a | 2508 | |
55efb413 JW |
2509 | base = find_base_term (x_addr); |
2510 | if (base && (GET_CODE (base) == LABEL_REF | |
2511 | || (GET_CODE (base) == SYMBOL_REF | |
2512 | && CONSTANT_POOL_ADDRESS_P (base)))) | |
2513 | return 0; | |
2514 | ||
eab5c70a | 2515 | if (! base_alias_check (x_addr, mem_addr, GET_MODE (x), mem_mode)) |
1c72c7f6 JC |
2516 | return 0; |
2517 | ||
eab5c70a | 2518 | x_addr = canon_rtx (x_addr); |
9362286d SB |
2519 | if (!mem_canonicalized) |
2520 | mem_addr = canon_rtx (mem_addr); | |
6e73e666 | 2521 | |
f47e08d9 RG |
2522 | if ((ret = memrefs_conflict_p (GET_MODE_SIZE (mem_mode), mem_addr, |
2523 | SIZE_FOR_MODE (x), x_addr, 0)) != -1) | |
2524 | return ret; | |
2525 | ||
a95b3cc7 | 2526 | if (mems_in_disjoint_alias_sets_p (x, mem)) |
f47e08d9 RG |
2527 | return 0; |
2528 | ||
c6ea834c | 2529 | if (nonoverlapping_memrefs_p (mem, x, false)) |
0211b6ab | 2530 | return 0; |
175a7536 MM |
2531 | |
2532 | if (nonoverlapping_component_refs_p (mem, x)) | |
2533 | return 0; | |
0211b6ab | 2534 | |
55b34b5f | 2535 | return rtx_refs_may_alias_p (x, mem, true); |
a13d4ebf AM |
2536 | } |
2537 | ||
9362286d SB |
2538 | /* True dependence: X is read after store in MEM takes place. */ |
2539 | ||
2540 | int | |
53d9622b | 2541 | true_dependence (const_rtx mem, enum machine_mode mem_mode, const_rtx x) |
9362286d SB |
2542 | { |
2543 | return true_dependence_1 (mem, mem_mode, NULL_RTX, | |
53d9622b | 2544 | x, NULL_RTX, /*mem_canonicalized=*/false); |
9362286d SB |
2545 | } |
2546 | ||
a13d4ebf | 2547 | /* Canonical true dependence: X is read after store in MEM takes place. |
ca7fd9cd KH |
2548 | Variant of true_dependence which assumes MEM has already been |
2549 | canonicalized (hence we no longer do that here). | |
9362286d SB |
2550 | The mem_addr argument has been added, since true_dependence_1 computed |
2551 | this value prior to canonicalizing. */ | |
a13d4ebf AM |
2552 | |
2553 | int | |
4f588890 | 2554 | canon_true_dependence (const_rtx mem, enum machine_mode mem_mode, rtx mem_addr, |
53d9622b | 2555 | const_rtx x, rtx x_addr) |
a13d4ebf | 2556 | { |
9362286d | 2557 | return true_dependence_1 (mem, mem_mode, mem_addr, |
53d9622b | 2558 | x, x_addr, /*mem_canonicalized=*/true); |
9ae8ffe7 JL |
2559 | } |
2560 | ||
da7d8304 | 2561 | /* Returns nonzero if a write to X might alias a previous read from |
389fdba0 | 2562 | (or, if WRITEP is nonzero, a write to) MEM. */ |
9ae8ffe7 | 2563 | |
2c72b78f | 2564 | static int |
4f588890 | 2565 | write_dependence_p (const_rtx mem, const_rtx x, int writep) |
9ae8ffe7 | 2566 | { |
6e73e666 | 2567 | rtx x_addr, mem_addr; |
49982682 | 2568 | rtx base; |
f47e08d9 | 2569 | int ret; |
6e73e666 | 2570 | |
9ae8ffe7 JL |
2571 | if (MEM_VOLATILE_P (x) && MEM_VOLATILE_P (mem)) |
2572 | return 1; | |
2573 | ||
c4484b8f RH |
2574 | /* (mem:BLK (scratch)) is a special mechanism to conflict with everything. |
2575 | This is used in epilogue deallocation functions. */ | |
2576 | if (GET_MODE (x) == BLKmode && GET_CODE (XEXP (x, 0)) == SCRATCH) | |
2577 | return 1; | |
2578 | if (GET_MODE (mem) == BLKmode && GET_CODE (XEXP (mem, 0)) == SCRATCH) | |
2579 | return 1; | |
9cd9e512 RH |
2580 | if (MEM_ALIAS_SET (x) == ALIAS_SET_MEMORY_BARRIER |
2581 | || MEM_ALIAS_SET (mem) == ALIAS_SET_MEMORY_BARRIER) | |
2582 | return 1; | |
c4484b8f | 2583 | |
389fdba0 RH |
2584 | /* A read from read-only memory can't conflict with read-write memory. */ |
2585 | if (!writep && MEM_READONLY_P (mem)) | |
2586 | return 0; | |
55efb413 | 2587 | |
5932a4d4 | 2588 | /* If we have MEMs referring to different address spaces (which can |
09e881c9 BE |
2589 | potentially overlap), we cannot easily tell from the addresses |
2590 | whether the references overlap. */ | |
2591 | if (MEM_ADDR_SPACE (mem) != MEM_ADDR_SPACE (x)) | |
2592 | return 1; | |
2593 | ||
2147c71c L |
2594 | x_addr = XEXP (x, 0); |
2595 | mem_addr = XEXP (mem, 0); | |
2596 | if (!((GET_CODE (x_addr) == VALUE | |
2597 | && GET_CODE (mem_addr) != VALUE | |
2598 | && reg_mentioned_p (x_addr, mem_addr)) | |
2599 | || (GET_CODE (x_addr) != VALUE | |
2600 | && GET_CODE (mem_addr) == VALUE | |
2601 | && reg_mentioned_p (mem_addr, x_addr)))) | |
2602 | { | |
2603 | x_addr = get_addr (x_addr); | |
2604 | mem_addr = get_addr (mem_addr); | |
2605 | } | |
55efb413 | 2606 | |
49982682 JW |
2607 | if (! writep) |
2608 | { | |
55efb413 | 2609 | base = find_base_term (mem_addr); |
49982682 JW |
2610 | if (base && (GET_CODE (base) == LABEL_REF |
2611 | || (GET_CODE (base) == SYMBOL_REF | |
2612 | && CONSTANT_POOL_ADDRESS_P (base)))) | |
2613 | return 0; | |
2614 | } | |
2615 | ||
eab5c70a BS |
2616 | if (! base_alias_check (x_addr, mem_addr, GET_MODE (x), |
2617 | GET_MODE (mem))) | |
41472af8 MM |
2618 | return 0; |
2619 | ||
eab5c70a BS |
2620 | x_addr = canon_rtx (x_addr); |
2621 | mem_addr = canon_rtx (mem_addr); | |
6e73e666 | 2622 | |
f47e08d9 RG |
2623 | if ((ret = memrefs_conflict_p (SIZE_FOR_MODE (mem), mem_addr, |
2624 | SIZE_FOR_MODE (x), x_addr, 0)) != -1) | |
2625 | return ret; | |
2626 | ||
c6ea834c | 2627 | if (nonoverlapping_memrefs_p (x, mem, false)) |
c6df88cb MM |
2628 | return 0; |
2629 | ||
55b34b5f | 2630 | return rtx_refs_may_alias_p (x, mem, false); |
c6df88cb MM |
2631 | } |
2632 | ||
2633 | /* Anti dependence: X is written after read in MEM takes place. */ | |
2634 | ||
2635 | int | |
4f588890 | 2636 | anti_dependence (const_rtx mem, const_rtx x) |
c6df88cb | 2637 | { |
389fdba0 | 2638 | return write_dependence_p (mem, x, /*writep=*/0); |
9ae8ffe7 JL |
2639 | } |
2640 | ||
2641 | /* Output dependence: X is written after store in MEM takes place. */ | |
2642 | ||
2643 | int | |
4f588890 | 2644 | output_dependence (const_rtx mem, const_rtx x) |
9ae8ffe7 | 2645 | { |
389fdba0 | 2646 | return write_dependence_p (mem, x, /*writep=*/1); |
9ae8ffe7 | 2647 | } |
c14b9960 | 2648 | \f |
6e73e666 | 2649 | |
c6ea834c BM |
2650 | |
2651 | /* Check whether X may be aliased with MEM. Don't do offset-based | |
2652 | memory disambiguation & TBAA. */ | |
2653 | int | |
2654 | may_alias_p (const_rtx mem, const_rtx x) | |
2655 | { | |
2656 | rtx x_addr, mem_addr; | |
c6ea834c BM |
2657 | |
2658 | if (MEM_VOLATILE_P (x) && MEM_VOLATILE_P (mem)) | |
2659 | return 1; | |
2660 | ||
a95b3cc7 RG |
2661 | /* (mem:BLK (scratch)) is a special mechanism to conflict with everything. |
2662 | This is used in epilogue deallocation functions. */ | |
2663 | if (GET_MODE (x) == BLKmode && GET_CODE (XEXP (x, 0)) == SCRATCH) | |
2664 | return 1; | |
2665 | if (GET_MODE (mem) == BLKmode && GET_CODE (XEXP (mem, 0)) == SCRATCH) | |
c6ea834c | 2666 | return 1; |
c6ea834c BM |
2667 | if (MEM_ALIAS_SET (x) == ALIAS_SET_MEMORY_BARRIER |
2668 | || MEM_ALIAS_SET (mem) == ALIAS_SET_MEMORY_BARRIER) | |
2669 | return 1; | |
2670 | ||
2671 | /* Read-only memory is by definition never modified, and therefore can't | |
2672 | conflict with anything. We don't expect to find read-only set on MEM, | |
2673 | but stupid user tricks can produce them, so don't die. */ | |
2674 | if (MEM_READONLY_P (x)) | |
2675 | return 0; | |
2676 | ||
5932a4d4 | 2677 | /* If we have MEMs referring to different address spaces (which can |
c6ea834c BM |
2678 | potentially overlap), we cannot easily tell from the addresses |
2679 | whether the references overlap. */ | |
2680 | if (MEM_ADDR_SPACE (mem) != MEM_ADDR_SPACE (x)) | |
2681 | return 1; | |
2682 | ||
2683 | x_addr = XEXP (x, 0); | |
2684 | mem_addr = XEXP (mem, 0); | |
2685 | if (!((GET_CODE (x_addr) == VALUE | |
2686 | && GET_CODE (mem_addr) != VALUE | |
2687 | && reg_mentioned_p (x_addr, mem_addr)) | |
2688 | || (GET_CODE (x_addr) != VALUE | |
2689 | && GET_CODE (mem_addr) == VALUE | |
2690 | && reg_mentioned_p (mem_addr, x_addr)))) | |
2691 | { | |
2692 | x_addr = get_addr (x_addr); | |
2693 | mem_addr = get_addr (mem_addr); | |
2694 | } | |
2695 | ||
2696 | if (! base_alias_check (x_addr, mem_addr, GET_MODE (x), GET_MODE (mem_addr))) | |
2697 | return 0; | |
2698 | ||
2699 | x_addr = canon_rtx (x_addr); | |
2700 | mem_addr = canon_rtx (mem_addr); | |
2701 | ||
2702 | if (nonoverlapping_memrefs_p (mem, x, true)) | |
2703 | return 0; | |
2704 | ||
c6ea834c BM |
2705 | /* TBAA not valid for loop_invarint */ |
2706 | return rtx_refs_may_alias_p (x, mem, false); | |
2707 | } | |
2708 | ||
6e73e666 | 2709 | void |
b5deb7b6 | 2710 | init_alias_target (void) |
6e73e666 | 2711 | { |
b3694847 | 2712 | int i; |
6e73e666 | 2713 | |
9fc37b2b RS |
2714 | if (!arg_base_value) |
2715 | arg_base_value = gen_rtx_ADDRESS (VOIDmode, 0); | |
2716 | ||
b5deb7b6 SL |
2717 | memset (static_reg_base_value, 0, sizeof static_reg_base_value); |
2718 | ||
6e73e666 JC |
2719 | for (i = 0; i < FIRST_PSEUDO_REGISTER; i++) |
2720 | /* Check whether this register can hold an incoming pointer | |
2721 | argument. FUNCTION_ARG_REGNO_P tests outgoing register | |
ec5c56db | 2722 | numbers, so translate if necessary due to register windows. */ |
6e73e666 JC |
2723 | if (FUNCTION_ARG_REGNO_P (OUTGOING_REGNO (i)) |
2724 | && HARD_REGNO_MODE_OK (i, Pmode)) | |
9fc37b2b RS |
2725 | static_reg_base_value[i] = arg_base_value; |
2726 | ||
757e8ba2 JJ |
2727 | static_reg_base_value[STACK_POINTER_REGNUM] |
2728 | = unique_base_value (UNIQUE_BASE_VALUE_SP); | |
2729 | static_reg_base_value[ARG_POINTER_REGNUM] | |
2730 | = unique_base_value (UNIQUE_BASE_VALUE_ARGP); | |
2731 | static_reg_base_value[FRAME_POINTER_REGNUM] | |
2732 | = unique_base_value (UNIQUE_BASE_VALUE_FP); | |
e3339d0f | 2733 | #if !HARD_FRAME_POINTER_IS_FRAME_POINTER |
757e8ba2 JJ |
2734 | static_reg_base_value[HARD_FRAME_POINTER_REGNUM] |
2735 | = unique_base_value (UNIQUE_BASE_VALUE_HFP); | |
bf1660a6 JL |
2736 | #endif |
2737 | } | |
2738 | ||
7b52eede JH |
2739 | /* Set MEMORY_MODIFIED when X modifies DATA (that is assumed |
2740 | to be memory reference. */ | |
2741 | static bool memory_modified; | |
2742 | static void | |
aa317c97 | 2743 | memory_modified_1 (rtx x, const_rtx pat ATTRIBUTE_UNUSED, void *data) |
7b52eede | 2744 | { |
3c0cb5de | 2745 | if (MEM_P (x)) |
7b52eede | 2746 | { |
9678086d | 2747 | if (anti_dependence (x, (const_rtx)data) || output_dependence (x, (const_rtx)data)) |
7b52eede JH |
2748 | memory_modified = true; |
2749 | } | |
2750 | } | |
2751 | ||
2752 | ||
2753 | /* Return true when INSN possibly modify memory contents of MEM | |
454ff5cb | 2754 | (i.e. address can be modified). */ |
7b52eede | 2755 | bool |
9678086d | 2756 | memory_modified_in_insn_p (const_rtx mem, const_rtx insn) |
7b52eede JH |
2757 | { |
2758 | if (!INSN_P (insn)) | |
2759 | return false; | |
2760 | memory_modified = false; | |
aa317c97 | 2761 | note_stores (PATTERN (insn), memory_modified_1, CONST_CAST_RTX(mem)); |
7b52eede JH |
2762 | return memory_modified; |
2763 | } | |
2764 | ||
a7b159a4 AH |
2765 | /* Return TRUE if the destination of a set is rtx identical to |
2766 | ITEM. */ | |
2767 | static inline bool | |
2768 | set_dest_equal_p (const_rtx set, const_rtx item) | |
2769 | { | |
2770 | rtx dest = SET_DEST (set); | |
2771 | return rtx_equal_p (dest, item); | |
2772 | } | |
2773 | ||
2774 | /* Like memory_modified_in_insn_p, but return TRUE if INSN will | |
2775 | *DEFINITELY* modify the memory contents of MEM. */ | |
2776 | bool | |
2777 | memory_must_be_modified_in_insn_p (const_rtx mem, const_rtx insn) | |
2778 | { | |
2779 | if (!INSN_P (insn)) | |
2780 | return false; | |
2781 | insn = PATTERN (insn); | |
2782 | if (GET_CODE (insn) == SET) | |
2783 | return set_dest_equal_p (insn, mem); | |
2784 | else if (GET_CODE (insn) == PARALLEL) | |
2785 | { | |
2786 | int i; | |
2787 | for (i = 0; i < XVECLEN (insn, 0); i++) | |
2788 | { | |
2789 | rtx sub = XVECEXP (insn, 0, i); | |
2790 | if (GET_CODE (sub) == SET | |
2791 | && set_dest_equal_p (sub, mem)) | |
2792 | return true; | |
2793 | } | |
2794 | } | |
2795 | return false; | |
2796 | } | |
2797 | ||
c13e8210 MM |
2798 | /* Initialize the aliasing machinery. Initialize the REG_KNOWN_VALUE |
2799 | array. */ | |
2800 | ||
9ae8ffe7 | 2801 | void |
4682ae04 | 2802 | init_alias_analysis (void) |
9ae8ffe7 | 2803 | { |
c582d54a | 2804 | unsigned int maxreg = max_reg_num (); |
ea64ef27 | 2805 | int changed, pass; |
b3694847 SS |
2806 | int i; |
2807 | unsigned int ui; | |
9ff3c7ca | 2808 | rtx insn, val; |
131db6b8 SB |
2809 | int rpo_cnt; |
2810 | int *rpo; | |
9ae8ffe7 | 2811 | |
0d446150 JH |
2812 | timevar_push (TV_ALIAS_ANALYSIS); |
2813 | ||
9ff3c7ca SB |
2814 | reg_known_value = VEC_alloc (rtx, gc, maxreg - FIRST_PSEUDO_REGISTER); |
2815 | reg_known_equiv_p = sbitmap_alloc (maxreg - FIRST_PSEUDO_REGISTER); | |
9ae8ffe7 | 2816 | |
08c79682 | 2817 | /* If we have memory allocated from the previous run, use it. */ |
c582d54a | 2818 | if (old_reg_base_value) |
08c79682 KH |
2819 | reg_base_value = old_reg_base_value; |
2820 | ||
2821 | if (reg_base_value) | |
2822 | VEC_truncate (rtx, reg_base_value, 0); | |
2823 | ||
a590ac65 | 2824 | VEC_safe_grow_cleared (rtx, gc, reg_base_value, maxreg); |
ac606739 | 2825 | |
5ed6ace5 | 2826 | new_reg_base_value = XNEWVEC (rtx, maxreg); |
d630245f | 2827 | reg_seen = sbitmap_alloc (maxreg); |
ec907dd8 JL |
2828 | |
2829 | /* The basic idea is that each pass through this loop will use the | |
2830 | "constant" information from the previous pass to propagate alias | |
2831 | information through another level of assignments. | |
2832 | ||
131db6b8 SB |
2833 | The propagation is done on the CFG in reverse post-order, to propagate |
2834 | things forward as far as possible in each iteration. | |
2835 | ||
ec907dd8 JL |
2836 | This could get expensive if the assignment chains are long. Maybe |
2837 | we should throttle the number of iterations, possibly based on | |
6e73e666 | 2838 | the optimization level or flag_expensive_optimizations. |
ec907dd8 JL |
2839 | |
2840 | We could propagate more information in the first pass by making use | |
6fb5fa3c | 2841 | of DF_REG_DEF_COUNT to determine immediately that the alias information |
ea64ef27 JL |
2842 | for a pseudo is "constant". |
2843 | ||
2844 | A program with an uninitialized variable can cause an infinite loop | |
2845 | here. Instead of doing a full dataflow analysis to detect such problems | |
2846 | we just cap the number of iterations for the loop. | |
2847 | ||
2848 | The state of the arrays for the set chain in question does not matter | |
2849 | since the program has undefined behavior. */ | |
6e73e666 | 2850 | |
131db6b8 SB |
2851 | rpo = XNEWVEC (int, n_basic_blocks); |
2852 | rpo_cnt = pre_and_rev_post_order_compute (NULL, rpo, false); | |
2853 | ||
ea64ef27 | 2854 | pass = 0; |
6e73e666 | 2855 | do |
ec907dd8 JL |
2856 | { |
2857 | /* Assume nothing will change this iteration of the loop. */ | |
2858 | changed = 0; | |
2859 | ||
ec907dd8 | 2860 | /* We want to assign the same IDs each iteration of this loop, so |
9fc37b2b RS |
2861 | start counting from one each iteration of the loop. */ |
2862 | unique_id = 1; | |
ec907dd8 | 2863 | |
f5143c46 | 2864 | /* We're at the start of the function each iteration through the |
ec907dd8 | 2865 | loop, so we're copying arguments. */ |
83bbd9b6 | 2866 | copying_arguments = true; |
9ae8ffe7 | 2867 | |
6e73e666 | 2868 | /* Wipe the potential alias information clean for this pass. */ |
c582d54a | 2869 | memset (new_reg_base_value, 0, maxreg * sizeof (rtx)); |
8072f69c | 2870 | |
6e73e666 | 2871 | /* Wipe the reg_seen array clean. */ |
d630245f | 2872 | sbitmap_zero (reg_seen); |
9ae8ffe7 | 2873 | |
6e73e666 JC |
2874 | /* Mark all hard registers which may contain an address. |
2875 | The stack, frame and argument pointers may contain an address. | |
2876 | An argument register which can hold a Pmode value may contain | |
2877 | an address even if it is not in BASE_REGS. | |
8072f69c | 2878 | |
6e73e666 JC |
2879 | The address expression is VOIDmode for an argument and |
2880 | Pmode for other registers. */ | |
2881 | ||
7f243674 JL |
2882 | memcpy (new_reg_base_value, static_reg_base_value, |
2883 | FIRST_PSEUDO_REGISTER * sizeof (rtx)); | |
6e73e666 | 2884 | |
ec907dd8 | 2885 | /* Walk the insns adding values to the new_reg_base_value array. */ |
131db6b8 | 2886 | for (i = 0; i < rpo_cnt; i++) |
9ae8ffe7 | 2887 | { |
131db6b8 SB |
2888 | basic_block bb = BASIC_BLOCK (rpo[i]); |
2889 | FOR_BB_INSNS (bb, insn) | |
ec907dd8 | 2890 | { |
131db6b8 SB |
2891 | if (NONDEBUG_INSN_P (insn)) |
2892 | { | |
2893 | rtx note, set; | |
efc9bd41 RK |
2894 | |
2895 | #if defined (HAVE_prologue) || defined (HAVE_epilogue) | |
131db6b8 SB |
2896 | /* The prologue/epilogue insns are not threaded onto the |
2897 | insn chain until after reload has completed. Thus, | |
2898 | there is no sense wasting time checking if INSN is in | |
2899 | the prologue/epilogue until after reload has completed. */ | |
2900 | if (reload_completed | |
2901 | && prologue_epilogue_contains (insn)) | |
2902 | continue; | |
efc9bd41 RK |
2903 | #endif |
2904 | ||
131db6b8 SB |
2905 | /* If this insn has a noalias note, process it, Otherwise, |
2906 | scan for sets. A simple set will have no side effects | |
2907 | which could change the base value of any other register. */ | |
6e73e666 | 2908 | |
131db6b8 SB |
2909 | if (GET_CODE (PATTERN (insn)) == SET |
2910 | && REG_NOTES (insn) != 0 | |
2911 | && find_reg_note (insn, REG_NOALIAS, NULL_RTX)) | |
2912 | record_set (SET_DEST (PATTERN (insn)), NULL_RTX, NULL); | |
2913 | else | |
2914 | note_stores (PATTERN (insn), record_set, NULL); | |
6e73e666 | 2915 | |
131db6b8 | 2916 | set = single_set (insn); |
6e73e666 | 2917 | |
131db6b8 SB |
2918 | if (set != 0 |
2919 | && REG_P (SET_DEST (set)) | |
2920 | && REGNO (SET_DEST (set)) >= FIRST_PSEUDO_REGISTER) | |
713f41f9 | 2921 | { |
131db6b8 SB |
2922 | unsigned int regno = REGNO (SET_DEST (set)); |
2923 | rtx src = SET_SRC (set); | |
2924 | rtx t; | |
2925 | ||
2926 | note = find_reg_equal_equiv_note (insn); | |
2927 | if (note && REG_NOTE_KIND (note) == REG_EQUAL | |
2928 | && DF_REG_DEF_COUNT (regno) != 1) | |
2929 | note = NULL_RTX; | |
2930 | ||
2931 | if (note != NULL_RTX | |
2932 | && GET_CODE (XEXP (note, 0)) != EXPR_LIST | |
2933 | && ! rtx_varies_p (XEXP (note, 0), 1) | |
2934 | && ! reg_overlap_mentioned_p (SET_DEST (set), | |
2935 | XEXP (note, 0))) | |
2936 | { | |
2937 | set_reg_known_value (regno, XEXP (note, 0)); | |
2938 | set_reg_known_equiv_p (regno, | |
2939 | REG_NOTE_KIND (note) == REG_EQUIV); | |
2940 | } | |
2941 | else if (DF_REG_DEF_COUNT (regno) == 1 | |
2942 | && GET_CODE (src) == PLUS | |
2943 | && REG_P (XEXP (src, 0)) | |
2944 | && (t = get_reg_known_value (REGNO (XEXP (src, 0)))) | |
2945 | && CONST_INT_P (XEXP (src, 1))) | |
2946 | { | |
2947 | t = plus_constant (GET_MODE (src), t, | |
2948 | INTVAL (XEXP (src, 1))); | |
2949 | set_reg_known_value (regno, t); | |
2950 | set_reg_known_equiv_p (regno, false); | |
2951 | } | |
2952 | else if (DF_REG_DEF_COUNT (regno) == 1 | |
2953 | && ! rtx_varies_p (src, 1)) | |
2954 | { | |
2955 | set_reg_known_value (regno, src); | |
2956 | set_reg_known_equiv_p (regno, false); | |
2957 | } | |
713f41f9 | 2958 | } |
6e73e666 | 2959 | } |
131db6b8 SB |
2960 | else if (NOTE_P (insn) |
2961 | && NOTE_KIND (insn) == NOTE_INSN_FUNCTION_BEG) | |
2962 | copying_arguments = false; | |
ec907dd8 | 2963 | } |
6e73e666 | 2964 | } |
ec907dd8 | 2965 | |
6e73e666 | 2966 | /* Now propagate values from new_reg_base_value to reg_base_value. */ |
62e5bf5d | 2967 | gcc_assert (maxreg == (unsigned int) max_reg_num ()); |
c22cacf3 | 2968 | |
c582d54a | 2969 | for (ui = 0; ui < maxreg; ui++) |
6e73e666 | 2970 | { |
e51712db | 2971 | if (new_reg_base_value[ui] |
08c79682 | 2972 | && new_reg_base_value[ui] != VEC_index (rtx, reg_base_value, ui) |
c582d54a | 2973 | && ! rtx_equal_p (new_reg_base_value[ui], |
08c79682 | 2974 | VEC_index (rtx, reg_base_value, ui))) |
ec907dd8 | 2975 | { |
08c79682 | 2976 | VEC_replace (rtx, reg_base_value, ui, new_reg_base_value[ui]); |
6e73e666 | 2977 | changed = 1; |
ec907dd8 | 2978 | } |
9ae8ffe7 | 2979 | } |
9ae8ffe7 | 2980 | } |
6e73e666 | 2981 | while (changed && ++pass < MAX_ALIAS_LOOP_PASSES); |
131db6b8 | 2982 | XDELETEVEC (rpo); |
9ae8ffe7 JL |
2983 | |
2984 | /* Fill in the remaining entries. */ | |
9ff3c7ca SB |
2985 | FOR_EACH_VEC_ELT (rtx, reg_known_value, i, val) |
2986 | { | |
2987 | int regno = i + FIRST_PSEUDO_REGISTER; | |
2988 | if (! val) | |
2989 | set_reg_known_value (regno, regno_reg_rtx[regno]); | |
2990 | } | |
9ae8ffe7 | 2991 | |
e05e2395 MM |
2992 | /* Clean up. */ |
2993 | free (new_reg_base_value); | |
ec907dd8 | 2994 | new_reg_base_value = 0; |
d630245f | 2995 | sbitmap_free (reg_seen); |
9ae8ffe7 | 2996 | reg_seen = 0; |
0d446150 | 2997 | timevar_pop (TV_ALIAS_ANALYSIS); |
9ae8ffe7 JL |
2998 | } |
2999 | ||
61630b27 JJ |
3000 | /* Equate REG_BASE_VALUE (reg1) to REG_BASE_VALUE (reg2). |
3001 | Special API for var-tracking pass purposes. */ | |
3002 | ||
3003 | void | |
3004 | vt_equate_reg_base_value (const_rtx reg1, const_rtx reg2) | |
3005 | { | |
3006 | VEC_replace (rtx, reg_base_value, REGNO (reg1), REG_BASE_VALUE (reg2)); | |
3007 | } | |
3008 | ||
9ae8ffe7 | 3009 | void |
4682ae04 | 3010 | end_alias_analysis (void) |
9ae8ffe7 | 3011 | { |
c582d54a | 3012 | old_reg_base_value = reg_base_value; |
9ff3c7ca SB |
3013 | VEC_free (rtx, gc, reg_known_value); |
3014 | sbitmap_free (reg_known_equiv_p); | |
9ae8ffe7 | 3015 | } |
e2500fed GK |
3016 | |
3017 | #include "gt-alias.h" |