1 /* Alias analysis for trees.
2 Copyright (C) 2004-2019 Free Software Foundation, Inc.
3 Contributed by Diego Novillo <dnovillo@redhat.com>
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3, or (at your option)
12 GCC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
23 #include "coretypes.h"
29 #include "timevar.h" /* for TV_ALIAS_STMT_WALK */
32 #include "tree-pretty-print.h"
34 #include "fold-const.h"
35 #include "langhooks.h"
39 #include "ipa-reference.h"
42 /* Broad overview of how alias analysis on gimple works:
44 Statements clobbering or using memory are linked through the
45 virtual operand factored use-def chain. The virtual operand
46 is unique per function, its symbol is accessible via gimple_vop (cfun).
47 Virtual operands are used for efficiently walking memory statements
48 in the gimple IL and are useful for things like value-numbering as
49 a generation count for memory references.
51 SSA_NAME pointers may have associated points-to information
52 accessible via the SSA_NAME_PTR_INFO macro. Flow-insensitive
53 points-to information is (re-)computed by the TODO_rebuild_alias
54 pass manager todo. Points-to information is also used for more
55 precise tracking of call-clobbered and call-used variables and
56 related disambiguations.
58 This file contains functions for disambiguating memory references,
59 the so called alias-oracle and tools for walking of the gimple IL.
61 The main alias-oracle entry-points are
63 bool stmt_may_clobber_ref_p (gimple *, tree)
65 This function queries if a statement may invalidate (parts of)
66 the memory designated by the reference tree argument.
68 bool ref_maybe_used_by_stmt_p (gimple *, tree)
70 This function queries if a statement may need (parts of) the
71 memory designated by the reference tree argument.
73 There are variants of these functions that only handle the call
74 part of a statement, call_may_clobber_ref_p and ref_maybe_used_by_call_p.
75 Note that these do not disambiguate against a possible call lhs.
77 bool refs_may_alias_p (tree, tree)
79 This function tries to disambiguate two reference trees.
81 bool ptr_deref_may_alias_global_p (tree)
83 This function queries if dereferencing a pointer variable may
86 More low-level disambiguators are available and documented in
87 this file. Low-level disambiguators dealing with points-to
88 information are in tree-ssa-structalias.c. */
90 static int nonoverlapping_refs_since_match_p (tree
, tree
, tree
, tree
, bool);
91 static bool nonoverlapping_component_refs_p (const_tree
, const_tree
);
93 /* Query statistics for the different low-level disambiguators.
94 A high-level query may trigger multiple of them. */
97 unsigned HOST_WIDE_INT refs_may_alias_p_may_alias
;
98 unsigned HOST_WIDE_INT refs_may_alias_p_no_alias
;
99 unsigned HOST_WIDE_INT ref_maybe_used_by_call_p_may_alias
;
100 unsigned HOST_WIDE_INT ref_maybe_used_by_call_p_no_alias
;
101 unsigned HOST_WIDE_INT call_may_clobber_ref_p_may_alias
;
102 unsigned HOST_WIDE_INT call_may_clobber_ref_p_no_alias
;
103 unsigned HOST_WIDE_INT aliasing_component_refs_p_may_alias
;
104 unsigned HOST_WIDE_INT aliasing_component_refs_p_no_alias
;
105 unsigned HOST_WIDE_INT nonoverlapping_component_refs_p_may_alias
;
106 unsigned HOST_WIDE_INT nonoverlapping_component_refs_p_no_alias
;
107 unsigned HOST_WIDE_INT nonoverlapping_refs_since_match_p_may_alias
;
108 unsigned HOST_WIDE_INT nonoverlapping_refs_since_match_p_must_overlap
;
109 unsigned HOST_WIDE_INT nonoverlapping_refs_since_match_p_no_alias
;
113 dump_alias_stats (FILE *s
)
115 fprintf (s
, "\nAlias oracle query stats:\n");
116 fprintf (s
, " refs_may_alias_p: "
117 HOST_WIDE_INT_PRINT_DEC
" disambiguations, "
118 HOST_WIDE_INT_PRINT_DEC
" queries\n",
119 alias_stats
.refs_may_alias_p_no_alias
,
120 alias_stats
.refs_may_alias_p_no_alias
121 + alias_stats
.refs_may_alias_p_may_alias
);
122 fprintf (s
, " ref_maybe_used_by_call_p: "
123 HOST_WIDE_INT_PRINT_DEC
" disambiguations, "
124 HOST_WIDE_INT_PRINT_DEC
" queries\n",
125 alias_stats
.ref_maybe_used_by_call_p_no_alias
,
126 alias_stats
.refs_may_alias_p_no_alias
127 + alias_stats
.ref_maybe_used_by_call_p_may_alias
);
128 fprintf (s
, " call_may_clobber_ref_p: "
129 HOST_WIDE_INT_PRINT_DEC
" disambiguations, "
130 HOST_WIDE_INT_PRINT_DEC
" queries\n",
131 alias_stats
.call_may_clobber_ref_p_no_alias
,
132 alias_stats
.call_may_clobber_ref_p_no_alias
133 + alias_stats
.call_may_clobber_ref_p_may_alias
);
134 fprintf (s
, " nonoverlapping_component_refs_p: "
135 HOST_WIDE_INT_PRINT_DEC
" disambiguations, "
136 HOST_WIDE_INT_PRINT_DEC
" queries\n",
137 alias_stats
.nonoverlapping_component_refs_p_no_alias
,
138 alias_stats
.nonoverlapping_component_refs_p_no_alias
139 + alias_stats
.nonoverlapping_component_refs_p_may_alias
);
140 fprintf (s
, " nonoverlapping_refs_since_match_p: "
141 HOST_WIDE_INT_PRINT_DEC
" disambiguations, "
142 HOST_WIDE_INT_PRINT_DEC
" must overlaps, "
143 HOST_WIDE_INT_PRINT_DEC
" queries\n",
144 alias_stats
.nonoverlapping_refs_since_match_p_no_alias
,
145 alias_stats
.nonoverlapping_refs_since_match_p_must_overlap
,
146 alias_stats
.nonoverlapping_refs_since_match_p_no_alias
147 + alias_stats
.nonoverlapping_refs_since_match_p_may_alias
148 + alias_stats
.nonoverlapping_refs_since_match_p_must_overlap
);
149 fprintf (s
, " aliasing_component_refs_p: "
150 HOST_WIDE_INT_PRINT_DEC
" disambiguations, "
151 HOST_WIDE_INT_PRINT_DEC
" queries\n",
152 alias_stats
.aliasing_component_refs_p_no_alias
,
153 alias_stats
.aliasing_component_refs_p_no_alias
154 + alias_stats
.aliasing_component_refs_p_may_alias
);
155 dump_alias_stats_in_alias_c (s
);
159 /* Return true, if dereferencing PTR may alias with a global variable. */
162 ptr_deref_may_alias_global_p (tree ptr
)
164 struct ptr_info_def
*pi
;
166 /* If we end up with a pointer constant here that may point
168 if (TREE_CODE (ptr
) != SSA_NAME
)
171 pi
= SSA_NAME_PTR_INFO (ptr
);
173 /* If we do not have points-to information for this variable,
178 /* ??? This does not use TBAA to prune globals ptr may not access. */
179 return pt_solution_includes_global (&pi
->pt
);
182 /* Return true if dereferencing PTR may alias DECL.
183 The caller is responsible for applying TBAA to see if PTR
184 may access DECL at all. */
187 ptr_deref_may_alias_decl_p (tree ptr
, tree decl
)
189 struct ptr_info_def
*pi
;
191 /* Conversions are irrelevant for points-to information and
192 data-dependence analysis can feed us those. */
195 /* Anything we do not explicilty handle aliases. */
196 if ((TREE_CODE (ptr
) != SSA_NAME
197 && TREE_CODE (ptr
) != ADDR_EXPR
198 && TREE_CODE (ptr
) != POINTER_PLUS_EXPR
)
199 || !POINTER_TYPE_P (TREE_TYPE (ptr
))
201 && TREE_CODE (decl
) != PARM_DECL
202 && TREE_CODE (decl
) != RESULT_DECL
))
205 /* Disregard pointer offsetting. */
206 if (TREE_CODE (ptr
) == POINTER_PLUS_EXPR
)
210 ptr
= TREE_OPERAND (ptr
, 0);
212 while (TREE_CODE (ptr
) == POINTER_PLUS_EXPR
);
213 return ptr_deref_may_alias_decl_p (ptr
, decl
);
216 /* ADDR_EXPR pointers either just offset another pointer or directly
217 specify the pointed-to set. */
218 if (TREE_CODE (ptr
) == ADDR_EXPR
)
220 tree base
= get_base_address (TREE_OPERAND (ptr
, 0));
222 && (TREE_CODE (base
) == MEM_REF
223 || TREE_CODE (base
) == TARGET_MEM_REF
))
224 ptr
= TREE_OPERAND (base
, 0);
227 return compare_base_decls (base
, decl
) != 0;
229 && CONSTANT_CLASS_P (base
))
235 /* Non-aliased variables cannot be pointed to. */
236 if (!may_be_aliased (decl
))
239 /* If we do not have useful points-to information for this pointer
240 we cannot disambiguate anything else. */
241 pi
= SSA_NAME_PTR_INFO (ptr
);
245 return pt_solution_includes (&pi
->pt
, decl
);
248 /* Return true if dereferenced PTR1 and PTR2 may alias.
249 The caller is responsible for applying TBAA to see if accesses
250 through PTR1 and PTR2 may conflict at all. */
253 ptr_derefs_may_alias_p (tree ptr1
, tree ptr2
)
255 struct ptr_info_def
*pi1
, *pi2
;
257 /* Conversions are irrelevant for points-to information and
258 data-dependence analysis can feed us those. */
262 /* Disregard pointer offsetting. */
263 if (TREE_CODE (ptr1
) == POINTER_PLUS_EXPR
)
267 ptr1
= TREE_OPERAND (ptr1
, 0);
269 while (TREE_CODE (ptr1
) == POINTER_PLUS_EXPR
);
270 return ptr_derefs_may_alias_p (ptr1
, ptr2
);
272 if (TREE_CODE (ptr2
) == POINTER_PLUS_EXPR
)
276 ptr2
= TREE_OPERAND (ptr2
, 0);
278 while (TREE_CODE (ptr2
) == POINTER_PLUS_EXPR
);
279 return ptr_derefs_may_alias_p (ptr1
, ptr2
);
282 /* ADDR_EXPR pointers either just offset another pointer or directly
283 specify the pointed-to set. */
284 if (TREE_CODE (ptr1
) == ADDR_EXPR
)
286 tree base
= get_base_address (TREE_OPERAND (ptr1
, 0));
288 && (TREE_CODE (base
) == MEM_REF
289 || TREE_CODE (base
) == TARGET_MEM_REF
))
290 return ptr_derefs_may_alias_p (TREE_OPERAND (base
, 0), ptr2
);
293 return ptr_deref_may_alias_decl_p (ptr2
, base
);
297 if (TREE_CODE (ptr2
) == ADDR_EXPR
)
299 tree base
= get_base_address (TREE_OPERAND (ptr2
, 0));
301 && (TREE_CODE (base
) == MEM_REF
302 || TREE_CODE (base
) == TARGET_MEM_REF
))
303 return ptr_derefs_may_alias_p (ptr1
, TREE_OPERAND (base
, 0));
306 return ptr_deref_may_alias_decl_p (ptr1
, base
);
311 /* From here we require SSA name pointers. Anything else aliases. */
312 if (TREE_CODE (ptr1
) != SSA_NAME
313 || TREE_CODE (ptr2
) != SSA_NAME
314 || !POINTER_TYPE_P (TREE_TYPE (ptr1
))
315 || !POINTER_TYPE_P (TREE_TYPE (ptr2
)))
318 /* We may end up with two empty points-to solutions for two same pointers.
319 In this case we still want to say both pointers alias, so shortcut
324 /* If we do not have useful points-to information for either pointer
325 we cannot disambiguate anything else. */
326 pi1
= SSA_NAME_PTR_INFO (ptr1
);
327 pi2
= SSA_NAME_PTR_INFO (ptr2
);
331 /* ??? This does not use TBAA to prune decls from the intersection
332 that not both pointers may access. */
333 return pt_solutions_intersect (&pi1
->pt
, &pi2
->pt
);
336 /* Return true if dereferencing PTR may alias *REF.
337 The caller is responsible for applying TBAA to see if PTR
338 may access *REF at all. */
341 ptr_deref_may_alias_ref_p_1 (tree ptr
, ao_ref
*ref
)
343 tree base
= ao_ref_base (ref
);
345 if (TREE_CODE (base
) == MEM_REF
346 || TREE_CODE (base
) == TARGET_MEM_REF
)
347 return ptr_derefs_may_alias_p (ptr
, TREE_OPERAND (base
, 0));
348 else if (DECL_P (base
))
349 return ptr_deref_may_alias_decl_p (ptr
, base
);
354 /* Returns true if PTR1 and PTR2 compare unequal because of points-to. */
357 ptrs_compare_unequal (tree ptr1
, tree ptr2
)
359 /* First resolve the pointers down to a SSA name pointer base or
360 a VAR_DECL, PARM_DECL or RESULT_DECL. This explicitely does
361 not yet try to handle LABEL_DECLs, FUNCTION_DECLs, CONST_DECLs
362 or STRING_CSTs which needs points-to adjustments to track them
363 in the points-to sets. */
364 tree obj1
= NULL_TREE
;
365 tree obj2
= NULL_TREE
;
366 if (TREE_CODE (ptr1
) == ADDR_EXPR
)
368 tree tem
= get_base_address (TREE_OPERAND (ptr1
, 0));
372 || TREE_CODE (tem
) == PARM_DECL
373 || TREE_CODE (tem
) == RESULT_DECL
)
375 else if (TREE_CODE (tem
) == MEM_REF
)
376 ptr1
= TREE_OPERAND (tem
, 0);
378 if (TREE_CODE (ptr2
) == ADDR_EXPR
)
380 tree tem
= get_base_address (TREE_OPERAND (ptr2
, 0));
384 || TREE_CODE (tem
) == PARM_DECL
385 || TREE_CODE (tem
) == RESULT_DECL
)
387 else if (TREE_CODE (tem
) == MEM_REF
)
388 ptr2
= TREE_OPERAND (tem
, 0);
391 /* Canonicalize ptr vs. object. */
392 if (TREE_CODE (ptr1
) == SSA_NAME
&& obj2
)
394 std::swap (ptr1
, ptr2
);
395 std::swap (obj1
, obj2
);
399 /* Other code handles this correctly, no need to duplicate it here. */;
400 else if (obj1
&& TREE_CODE (ptr2
) == SSA_NAME
)
402 struct ptr_info_def
*pi
= SSA_NAME_PTR_INFO (ptr2
);
403 /* We may not use restrict to optimize pointer comparisons.
404 See PR71062. So we have to assume that restrict-pointed-to
405 may be in fact obj1. */
407 || pi
->pt
.vars_contains_restrict
408 || pi
->pt
.vars_contains_interposable
)
411 && (TREE_STATIC (obj1
) || DECL_EXTERNAL (obj1
)))
413 varpool_node
*node
= varpool_node::get (obj1
);
414 /* If obj1 may bind to NULL give up (see below). */
416 || ! node
->nonzero_address ()
417 || ! decl_binds_to_current_def_p (obj1
))
420 return !pt_solution_includes (&pi
->pt
, obj1
);
423 /* ??? We'd like to handle ptr1 != NULL and ptr1 != ptr2
424 but those require pt.null to be conservatively correct. */
429 /* Returns whether reference REF to BASE may refer to global memory. */
432 ref_may_alias_global_p_1 (tree base
)
435 return is_global_var (base
);
436 else if (TREE_CODE (base
) == MEM_REF
437 || TREE_CODE (base
) == TARGET_MEM_REF
)
438 return ptr_deref_may_alias_global_p (TREE_OPERAND (base
, 0));
443 ref_may_alias_global_p (ao_ref
*ref
)
445 tree base
= ao_ref_base (ref
);
446 return ref_may_alias_global_p_1 (base
);
450 ref_may_alias_global_p (tree ref
)
452 tree base
= get_base_address (ref
);
453 return ref_may_alias_global_p_1 (base
);
456 /* Return true whether STMT may clobber global memory. */
459 stmt_may_clobber_global_p (gimple
*stmt
)
463 if (!gimple_vdef (stmt
))
466 /* ??? We can ask the oracle whether an artificial pointer
467 dereference with a pointer with points-to information covering
468 all global memory (what about non-address taken memory?) maybe
469 clobbered by this call. As there is at the moment no convenient
470 way of doing that without generating garbage do some manual
472 ??? We could make a NULL ao_ref argument to the various
473 predicates special, meaning any global memory. */
475 switch (gimple_code (stmt
))
478 lhs
= gimple_assign_lhs (stmt
);
479 return (TREE_CODE (lhs
) != SSA_NAME
480 && ref_may_alias_global_p (lhs
));
489 /* Dump alias information on FILE. */
492 dump_alias_info (FILE *file
)
497 = lang_hooks
.decl_printable_name (current_function_decl
, 2);
500 fprintf (file
, "\n\nAlias information for %s\n\n", funcname
);
502 fprintf (file
, "Aliased symbols\n\n");
504 FOR_EACH_LOCAL_DECL (cfun
, i
, var
)
506 if (may_be_aliased (var
))
507 dump_variable (file
, var
);
510 fprintf (file
, "\nCall clobber information\n");
512 fprintf (file
, "\nESCAPED");
513 dump_points_to_solution (file
, &cfun
->gimple_df
->escaped
);
515 fprintf (file
, "\n\nFlow-insensitive points-to information\n\n");
517 FOR_EACH_SSA_NAME (i
, ptr
, cfun
)
519 struct ptr_info_def
*pi
;
521 if (!POINTER_TYPE_P (TREE_TYPE (ptr
))
522 || SSA_NAME_IN_FREE_LIST (ptr
))
525 pi
= SSA_NAME_PTR_INFO (ptr
);
527 dump_points_to_info_for (file
, ptr
);
530 fprintf (file
, "\n");
534 /* Dump alias information on stderr. */
537 debug_alias_info (void)
539 dump_alias_info (stderr
);
543 /* Dump the points-to set *PT into FILE. */
546 dump_points_to_solution (FILE *file
, struct pt_solution
*pt
)
549 fprintf (file
, ", points-to anything");
552 fprintf (file
, ", points-to non-local");
555 fprintf (file
, ", points-to escaped");
558 fprintf (file
, ", points-to unit escaped");
561 fprintf (file
, ", points-to NULL");
565 fprintf (file
, ", points-to vars: ");
566 dump_decl_set (file
, pt
->vars
);
567 if (pt
->vars_contains_nonlocal
568 || pt
->vars_contains_escaped
569 || pt
->vars_contains_escaped_heap
570 || pt
->vars_contains_restrict
)
572 const char *comma
= "";
573 fprintf (file
, " (");
574 if (pt
->vars_contains_nonlocal
)
576 fprintf (file
, "nonlocal");
579 if (pt
->vars_contains_escaped
)
581 fprintf (file
, "%sescaped", comma
);
584 if (pt
->vars_contains_escaped_heap
)
586 fprintf (file
, "%sescaped heap", comma
);
589 if (pt
->vars_contains_restrict
)
591 fprintf (file
, "%srestrict", comma
);
594 if (pt
->vars_contains_interposable
)
595 fprintf (file
, "%sinterposable", comma
);
602 /* Unified dump function for pt_solution. */
605 debug (pt_solution
&ref
)
607 dump_points_to_solution (stderr
, &ref
);
611 debug (pt_solution
*ptr
)
616 fprintf (stderr
, "<nil>\n");
620 /* Dump points-to information for SSA_NAME PTR into FILE. */
623 dump_points_to_info_for (FILE *file
, tree ptr
)
625 struct ptr_info_def
*pi
= SSA_NAME_PTR_INFO (ptr
);
627 print_generic_expr (file
, ptr
, dump_flags
);
630 dump_points_to_solution (file
, &pi
->pt
);
632 fprintf (file
, ", points-to anything");
634 fprintf (file
, "\n");
638 /* Dump points-to information for VAR into stderr. */
641 debug_points_to_info_for (tree var
)
643 dump_points_to_info_for (stderr
, var
);
647 /* Initializes the alias-oracle reference representation *R from REF. */
650 ao_ref_init (ao_ref
*r
, tree ref
)
657 r
->ref_alias_set
= -1;
658 r
->base_alias_set
= -1;
659 r
->volatile_p
= ref
? TREE_THIS_VOLATILE (ref
) : false;
662 /* Returns the base object of the memory reference *REF. */
665 ao_ref_base (ao_ref
*ref
)
671 ref
->base
= get_ref_base_and_extent (ref
->ref
, &ref
->offset
, &ref
->size
,
672 &ref
->max_size
, &reverse
);
676 /* Returns the base object alias set of the memory reference *REF. */
679 ao_ref_base_alias_set (ao_ref
*ref
)
682 if (ref
->base_alias_set
!= -1)
683 return ref
->base_alias_set
;
687 while (handled_component_p (base_ref
))
688 base_ref
= TREE_OPERAND (base_ref
, 0);
689 ref
->base_alias_set
= get_alias_set (base_ref
);
690 return ref
->base_alias_set
;
693 /* Returns the reference alias set of the memory reference *REF. */
696 ao_ref_alias_set (ao_ref
*ref
)
698 if (ref
->ref_alias_set
!= -1)
699 return ref
->ref_alias_set
;
700 ref
->ref_alias_set
= get_alias_set (ref
->ref
);
701 return ref
->ref_alias_set
;
704 /* Init an alias-oracle reference representation from a gimple pointer
705 PTR and a gimple size SIZE in bytes. If SIZE is NULL_TREE then the
706 size is assumed to be unknown. The access is assumed to be only
707 to or after of the pointer target, not before it. */
710 ao_ref_init_from_ptr_and_size (ao_ref
*ref
, tree ptr
, tree size
)
712 poly_int64 t
, size_hwi
, extra_offset
= 0;
713 ref
->ref
= NULL_TREE
;
714 if (TREE_CODE (ptr
) == SSA_NAME
)
716 gimple
*stmt
= SSA_NAME_DEF_STMT (ptr
);
717 if (gimple_assign_single_p (stmt
)
718 && gimple_assign_rhs_code (stmt
) == ADDR_EXPR
)
719 ptr
= gimple_assign_rhs1 (stmt
);
720 else if (is_gimple_assign (stmt
)
721 && gimple_assign_rhs_code (stmt
) == POINTER_PLUS_EXPR
722 && ptrdiff_tree_p (gimple_assign_rhs2 (stmt
), &extra_offset
))
724 ptr
= gimple_assign_rhs1 (stmt
);
725 extra_offset
*= BITS_PER_UNIT
;
729 if (TREE_CODE (ptr
) == ADDR_EXPR
)
731 ref
->base
= get_addr_base_and_unit_offset (TREE_OPERAND (ptr
, 0), &t
);
733 ref
->offset
= BITS_PER_UNIT
* t
;
738 ref
->base
= get_base_address (TREE_OPERAND (ptr
, 0));
743 gcc_assert (POINTER_TYPE_P (TREE_TYPE (ptr
)));
744 ref
->base
= build2 (MEM_REF
, char_type_node
,
745 ptr
, null_pointer_node
);
748 ref
->offset
+= extra_offset
;
750 && poly_int_tree_p (size
, &size_hwi
)
751 && coeffs_in_range_p (size_hwi
, 0, HOST_WIDE_INT_MAX
/ BITS_PER_UNIT
))
752 ref
->max_size
= ref
->size
= size_hwi
* BITS_PER_UNIT
;
754 ref
->max_size
= ref
->size
= -1;
755 ref
->ref_alias_set
= 0;
756 ref
->base_alias_set
= 0;
757 ref
->volatile_p
= false;
760 /* S1 and S2 are TYPE_SIZE or DECL_SIZE. Compare them:
763 Return 0 if equal or incomparable. */
766 compare_sizes (tree s1
, tree s2
)
774 if (!poly_int_tree_p (s1
, &size1
) || !poly_int_tree_p (s2
, &size2
))
776 if (known_lt (size1
, size2
))
778 if (known_lt (size2
, size1
))
783 /* Compare TYPE1 and TYPE2 by its size.
784 Return -1 if size of TYPE1 < size of TYPE2
785 Return 1 if size of TYPE1 > size of TYPE2
786 Return 0 if types are of equal sizes or we can not compare them. */
789 compare_type_sizes (tree type1
, tree type2
)
791 /* Be conservative for arrays and vectors. We want to support partial
792 overlap on int[3] and int[3] as tested in gcc.dg/torture/alias-2.c. */
793 while (TREE_CODE (type1
) == ARRAY_TYPE
794 || TREE_CODE (type1
) == VECTOR_TYPE
)
795 type1
= TREE_TYPE (type1
);
796 while (TREE_CODE (type2
) == ARRAY_TYPE
797 || TREE_CODE (type2
) == VECTOR_TYPE
)
798 type2
= TREE_TYPE (type2
);
799 return compare_sizes (TYPE_SIZE (type1
), TYPE_SIZE (type2
));
802 /* Return 1 if TYPE1 and TYPE2 are to be considered equivalent for the
803 purpose of TBAA. Return 0 if they are distinct and -1 if we cannot
807 same_type_for_tbaa (tree type1
, tree type2
)
809 type1
= TYPE_MAIN_VARIANT (type1
);
810 type2
= TYPE_MAIN_VARIANT (type2
);
812 /* Handle the most common case first. */
816 /* If we would have to do structural comparison bail out. */
817 if (TYPE_STRUCTURAL_EQUALITY_P (type1
)
818 || TYPE_STRUCTURAL_EQUALITY_P (type2
))
821 /* Compare the canonical types. */
822 if (TYPE_CANONICAL (type1
) == TYPE_CANONICAL (type2
))
825 /* ??? Array types are not properly unified in all cases as we have
826 spurious changes in the index types for example. Removing this
827 causes all sorts of problems with the Fortran frontend. */
828 if (TREE_CODE (type1
) == ARRAY_TYPE
829 && TREE_CODE (type2
) == ARRAY_TYPE
)
832 /* ??? In Ada, an lvalue of an unconstrained type can be used to access an
833 object of one of its constrained subtypes, e.g. when a function with an
834 unconstrained parameter passed by reference is called on an object and
835 inlined. But, even in the case of a fixed size, type and subtypes are
836 not equivalent enough as to share the same TYPE_CANONICAL, since this
837 would mean that conversions between them are useless, whereas they are
838 not (e.g. type and subtypes can have different modes). So, in the end,
839 they are only guaranteed to have the same alias set. */
840 if (get_alias_set (type1
) == get_alias_set (type2
))
843 /* The types are known to be not equal. */
847 /* Return true if TYPE is a composite type (i.e. we may apply one of handled
848 components on it). */
851 type_has_components_p (tree type
)
853 return AGGREGATE_TYPE_P (type
) || VECTOR_TYPE_P (type
)
854 || TREE_CODE (type
) == COMPLEX_TYPE
;
857 /* MATCH1 and MATCH2 which are part of access path of REF1 and REF2
858 respectively are either pointing to same address or are completely
859 disjoint. If PARITAL_OVERLAP is true, assume that outermost arrays may
862 Try to disambiguate using the access path starting from the match
863 and return false if there is no conflict.
865 Helper for aliasing_component_refs_p. */
868 aliasing_matching_component_refs_p (tree match1
, tree ref1
,
869 poly_int64 offset1
, poly_int64 max_size1
,
870 tree match2
, tree ref2
,
871 poly_int64 offset2
, poly_int64 max_size2
,
872 bool partial_overlap
)
874 poly_int64 offadj
, sztmp
, msztmp
;
877 if (!partial_overlap
)
879 get_ref_base_and_extent (match2
, &offadj
, &sztmp
, &msztmp
, &reverse
);
881 get_ref_base_and_extent (match1
, &offadj
, &sztmp
, &msztmp
, &reverse
);
883 if (!ranges_maybe_overlap_p (offset1
, max_size1
, offset2
, max_size2
))
885 ++alias_stats
.aliasing_component_refs_p_no_alias
;
890 int cmp
= nonoverlapping_refs_since_match_p (match1
, ref1
, match2
, ref2
,
893 || (cmp
== -1 && nonoverlapping_component_refs_p (ref1
, ref2
)))
895 ++alias_stats
.aliasing_component_refs_p_no_alias
;
898 ++alias_stats
.aliasing_component_refs_p_may_alias
;
902 /* Return true if REF is reference to zero sized trailing array. I.e.
903 struct foo {int bar; int array[0];} *fooptr;
907 component_ref_to_zero_sized_trailing_array_p (tree ref
)
909 return (TREE_CODE (ref
) == COMPONENT_REF
910 && TREE_CODE (TREE_TYPE (TREE_OPERAND (ref
, 1))) == ARRAY_TYPE
911 && (!TYPE_SIZE (TREE_TYPE (TREE_OPERAND (ref
, 1)))
912 || integer_zerop (TYPE_SIZE (TREE_TYPE (TREE_OPERAND (ref
, 1)))))
913 && array_at_struct_end_p (ref
));
916 /* Worker for aliasing_component_refs_p. Most parameters match parameters of
917 aliasing_component_refs_p.
919 Walk access path REF2 and try to find type matching TYPE1
920 (which is a start of possibly aliasing access path REF1).
921 If match is found, try to disambiguate.
923 Return 0 for sucessful disambiguation.
924 Return 1 if match was found but disambiguation failed
925 Return -1 if there is no match.
926 In this case MAYBE_MATCH is set to 0 if there is no type matching TYPE1
927 in access patch REF2 and -1 if we are not sure. */
930 aliasing_component_refs_walk (tree ref1
, tree type1
, tree base1
,
931 poly_int64 offset1
, poly_int64 max_size1
,
932 tree end_struct_ref1
,
933 tree ref2
, tree base2
,
934 poly_int64 offset2
, poly_int64 max_size2
,
942 /* We walk from inner type to the outer types. If type we see is
943 already too large to be part of type1, terminate the search. */
944 int cmp
= compare_type_sizes (type1
, TREE_TYPE (ref
));
948 || compare_type_sizes (TREE_TYPE (end_struct_ref1
),
949 TREE_TYPE (ref
)) < 0))
951 /* If types may be of same size, see if we can decide about their
955 same_p
= same_type_for_tbaa (TREE_TYPE (ref
), type1
);
958 /* In case we can't decide whether types are same try to
959 continue looking for the exact match.
960 Remember however that we possibly saw a match
961 to bypass the access path continuations tests we do later. */
965 if (!handled_component_p (ref
))
967 ref
= TREE_OPERAND (ref
, 0);
971 bool partial_overlap
= false;
973 /* We assume that arrays can overlap by multiple of their elements
974 size as tested in gcc.dg/torture/alias-2.c.
975 This partial overlap happen only when both arrays are bases of
976 the access and not contained within another component ref.
977 To be safe we also assume partial overlap for VLAs. */
978 if (TREE_CODE (TREE_TYPE (base1
)) == ARRAY_TYPE
979 && (!TYPE_SIZE (TREE_TYPE (base1
))
980 || TREE_CODE (TYPE_SIZE (TREE_TYPE (base1
))) != INTEGER_CST
983 /* Setting maybe_match to true triggers
984 nonoverlapping_component_refs_p test later that still may do
985 useful disambiguation. */
987 partial_overlap
= true;
989 return aliasing_matching_component_refs_p (base1
, ref1
,
998 /* Determine if the two component references REF1 and REF2 which are
999 based on access types TYPE1 and TYPE2 and of which at least one is based
1000 on an indirect reference may alias.
1001 REF1_ALIAS_SET, BASE1_ALIAS_SET, REF2_ALIAS_SET and BASE2_ALIAS_SET
1002 are the respective alias sets. */
1005 aliasing_component_refs_p (tree ref1
,
1006 alias_set_type ref1_alias_set
,
1007 alias_set_type base1_alias_set
,
1008 poly_int64 offset1
, poly_int64 max_size1
,
1010 alias_set_type ref2_alias_set
,
1011 alias_set_type base2_alias_set
,
1012 poly_int64 offset2
, poly_int64 max_size2
)
1014 /* If one reference is a component references through pointers try to find a
1015 common base and apply offset based disambiguation. This handles
1017 struct A { int i; int j; } *q;
1018 struct B { struct A a; int k; } *p;
1019 disambiguating q->i and p->a.j. */
1022 bool maybe_match
= false;
1023 tree end_struct_ref1
= NULL
, end_struct_ref2
= NULL
;
1025 /* Choose bases and base types to search for. */
1027 while (handled_component_p (base1
))
1029 /* Generally access paths are monotous in the size of object. The
1030 exception are trailing arrays of structures. I.e.
1031 struct a {int array[0];};
1033 struct a {int array1[0]; int array[];};
1034 Such struct has size 0 but accesses to a.array may have non-zero size.
1035 In this case the size of TREE_TYPE (base1) is smaller than
1036 size of TREE_TYPE (TREE_OPERNAD (base1, 0)).
1038 Because we compare sizes of arrays just by sizes of their elements,
1039 we only need to care about zero sized array fields here. */
1040 if (component_ref_to_zero_sized_trailing_array_p (base1
))
1042 gcc_checking_assert (!end_struct_ref1
);
1043 end_struct_ref1
= base1
;
1045 if (TREE_CODE (base1
) == VIEW_CONVERT_EXPR
1046 || TREE_CODE (base1
) == BIT_FIELD_REF
)
1047 ref1
= TREE_OPERAND (base1
, 0);
1048 base1
= TREE_OPERAND (base1
, 0);
1050 type1
= TREE_TYPE (base1
);
1052 while (handled_component_p (base2
))
1054 if (component_ref_to_zero_sized_trailing_array_p (base2
))
1056 gcc_checking_assert (!end_struct_ref2
);
1057 end_struct_ref2
= base2
;
1059 if (TREE_CODE (base2
) == VIEW_CONVERT_EXPR
1060 || TREE_CODE (base2
) == BIT_FIELD_REF
)
1061 ref2
= TREE_OPERAND (base2
, 0);
1062 base2
= TREE_OPERAND (base2
, 0);
1064 type2
= TREE_TYPE (base2
);
1066 /* Now search for the type1 in the access path of ref2. This
1067 would be a common base for doing offset based disambiguation on.
1068 This however only makes sense if type2 is big enough to hold type1. */
1069 int cmp_outer
= compare_type_sizes (type2
, type1
);
1071 /* If type2 is big enough to contain type1 walk its access path.
1072 We also need to care of arrays at the end of structs that may extend
1073 beyond the end of structure. */
1076 && compare_type_sizes (TREE_TYPE (end_struct_ref2
), type1
) >= 0))
1078 int res
= aliasing_component_refs_walk (ref1
, type1
, base1
,
1081 ref2
, base2
, offset2
, max_size2
,
1087 /* If we didn't find a common base, try the other way around. */
1090 && compare_type_sizes (TREE_TYPE (end_struct_ref1
), type1
) <= 0))
1092 int res
= aliasing_component_refs_walk (ref2
, type2
, base2
,
1095 ref1
, base1
, offset1
, max_size1
,
1101 /* In the following code we make an assumption that the types in access
1102 paths do not overlap and thus accesses alias only if one path can be
1103 continuation of another. If we was not able to decide about equivalence,
1104 we need to give up. */
1107 if (!nonoverlapping_component_refs_p (ref1
, ref2
))
1109 ++alias_stats
.aliasing_component_refs_p_may_alias
;
1112 ++alias_stats
.aliasing_component_refs_p_no_alias
;
1116 /* If we have two type access paths B1.path1 and B2.path2 they may
1117 only alias if either B1 is in B2.path2 or B2 is in B1.path1.
1118 But we can still have a path that goes B1.path1...B2.path2 with
1119 a part that we do not see. So we can only disambiguate now
1120 if there is no B2 in the tail of path1 and no B1 on the
1122 if (compare_type_sizes (TREE_TYPE (ref2
), type1
) >= 0
1123 && (!end_struct_ref1
1124 || compare_type_sizes (TREE_TYPE (ref2
),
1125 TREE_TYPE (end_struct_ref1
)) >= 0)
1126 && type_has_components_p (TREE_TYPE (ref2
))
1127 && (base1_alias_set
== ref2_alias_set
1128 || alias_set_subset_of (base1_alias_set
, ref2_alias_set
)))
1130 ++alias_stats
.aliasing_component_refs_p_may_alias
;
1133 /* If this is ptr vs. decl then we know there is no ptr ... decl path. */
1134 if (compare_type_sizes (TREE_TYPE (ref1
), type2
) >= 0
1135 && (!end_struct_ref2
1136 || compare_type_sizes (TREE_TYPE (ref1
),
1137 TREE_TYPE (end_struct_ref2
)) >= 0)
1138 && type_has_components_p (TREE_TYPE (ref1
))
1139 && (base2_alias_set
== ref1_alias_set
1140 || alias_set_subset_of (base2_alias_set
, ref1_alias_set
)))
1142 ++alias_stats
.aliasing_component_refs_p_may_alias
;
1145 ++alias_stats
.aliasing_component_refs_p_no_alias
;
1149 /* FIELD1 and FIELD2 are two fields of component refs. We assume
1150 that bases of both component refs are either equivalent or nonoverlapping.
1151 We do not assume that the containers of FIELD1 and FIELD2 are of the
1154 Return 0 in case the base address of component_refs are same then
1155 FIELD1 and FIELD2 have same address. Note that FIELD1 and FIELD2
1156 may not be of same type or size.
1158 Return 1 if FIELD1 and FIELD2 are non-overlapping.
1160 Return -1 otherwise.
1162 Main difference between 0 and -1 is to let
1163 nonoverlapping_component_refs_since_match_p discover the semantically
1164 equivalent part of the access path.
1166 Note that this function is used even with -fno-strict-aliasing
1167 and makes use of no TBAA assumptions. */
1170 nonoverlapping_component_refs_p_1 (const_tree field1
, const_tree field2
)
1172 /* If both fields are of the same type, we could save hard work of
1173 comparing offsets. */
1174 tree type1
= DECL_CONTEXT (field1
);
1175 tree type2
= DECL_CONTEXT (field2
);
1177 if (TREE_CODE (type1
) == RECORD_TYPE
1178 && DECL_BIT_FIELD_REPRESENTATIVE (field1
))
1179 field1
= DECL_BIT_FIELD_REPRESENTATIVE (field1
);
1180 if (TREE_CODE (type2
) == RECORD_TYPE
1181 && DECL_BIT_FIELD_REPRESENTATIVE (field2
))
1182 field2
= DECL_BIT_FIELD_REPRESENTATIVE (field2
);
1184 /* ??? Bitfields can overlap at RTL level so punt on them.
1185 FIXME: RTL expansion should be fixed by adjusting the access path
1186 when producing MEM_ATTRs for MEMs which are wider than
1187 the bitfields similarly as done in set_mem_attrs_minus_bitpos. */
1188 if (DECL_BIT_FIELD (field1
) && DECL_BIT_FIELD (field2
))
1191 /* Assume that different FIELD_DECLs never overlap within a RECORD_TYPE. */
1192 if (type1
== type2
&& TREE_CODE (type1
) == RECORD_TYPE
)
1193 return field1
!= field2
;
1195 /* In common case the offsets and bit offsets will be the same.
1196 However if frontends do not agree on the alignment, they may be
1197 different even if they actually represent same address.
1198 Try the common case first and if that fails calcualte the
1199 actual bit offset. */
1200 if (tree_int_cst_equal (DECL_FIELD_OFFSET (field1
),
1201 DECL_FIELD_OFFSET (field2
))
1202 && tree_int_cst_equal (DECL_FIELD_BIT_OFFSET (field1
),
1203 DECL_FIELD_BIT_OFFSET (field2
)))
1206 /* Note that it may be possible to use component_ref_field_offset
1207 which would provide offsets as trees. However constructing and folding
1208 trees is expensive and does not seem to be worth the compile time
1211 poly_uint64 offset1
, offset2
;
1212 poly_uint64 bit_offset1
, bit_offset2
;
1214 if (poly_int_tree_p (DECL_FIELD_OFFSET (field1
), &offset1
)
1215 && poly_int_tree_p (DECL_FIELD_OFFSET (field2
), &offset2
)
1216 && poly_int_tree_p (DECL_FIELD_BIT_OFFSET (field1
), &bit_offset1
)
1217 && poly_int_tree_p (DECL_FIELD_BIT_OFFSET (field2
), &bit_offset2
))
1219 offset1
= (offset1
<< LOG2_BITS_PER_UNIT
) + bit_offset1
;
1220 offset2
= (offset2
<< LOG2_BITS_PER_UNIT
) + bit_offset2
;
1222 if (known_eq (offset1
, offset2
))
1225 poly_uint64 size1
, size2
;
1227 if (poly_int_tree_p (DECL_SIZE (field1
), &size1
)
1228 && poly_int_tree_p (DECL_SIZE (field2
), &size2
)
1229 && !ranges_maybe_overlap_p (offset1
, size1
, offset2
, size2
))
1232 /* Resort to slower overlap checking by looking for matching types in
1233 the middle of access path. */
1237 /* Return low bound of array. Do not produce new trees
1238 and thus do not care about particular type of integer constant
1239 and placeholder exprs. */
1242 cheap_array_ref_low_bound (tree ref
)
1244 tree domain_type
= TYPE_DOMAIN (TREE_TYPE (TREE_OPERAND (ref
, 0)));
1246 /* Avoid expensive array_ref_low_bound.
1247 low bound is either stored in operand2, or it is TYPE_MIN_VALUE of domain
1248 type or it is zero. */
1249 if (TREE_OPERAND (ref
, 2))
1250 return TREE_OPERAND (ref
, 2);
1251 else if (domain_type
&& TYPE_MIN_VALUE (domain_type
))
1252 return TYPE_MIN_VALUE (domain_type
);
1254 return integer_zero_node
;
1257 /* REF1 and REF2 are ARRAY_REFs with either same base address or which are
1258 completely disjoint.
1260 Return 1 if the refs are non-overlapping.
1261 Return 0 if they are possibly overlapping but if so the overlap again
1262 starts on the same address.
1263 Return -1 otherwise. */
1266 nonoverlapping_array_refs_p (tree ref1
, tree ref2
)
1268 tree index1
= TREE_OPERAND (ref1
, 1);
1269 tree index2
= TREE_OPERAND (ref2
, 1);
1270 tree low_bound1
= cheap_array_ref_low_bound(ref1
);
1271 tree low_bound2
= cheap_array_ref_low_bound(ref2
);
1273 /* Handle zero offsets first: we do not need to match type size in this
1275 if (operand_equal_p (index1
, low_bound1
, 0)
1276 && operand_equal_p (index2
, low_bound2
, 0))
1279 /* If type sizes are different, give up.
1281 Avoid expensive array_ref_element_size.
1282 If operand 3 is present it denotes size in the alignmnet units.
1283 Otherwise size is TYPE_SIZE of the element type.
1284 Handle only common cases where types are of the same "kind". */
1285 if ((TREE_OPERAND (ref1
, 3) == NULL
) != (TREE_OPERAND (ref2
, 3) == NULL
))
1288 tree elmt_type1
= TREE_TYPE (TREE_TYPE (TREE_OPERAND (ref1
, 0)));
1289 tree elmt_type2
= TREE_TYPE (TREE_TYPE (TREE_OPERAND (ref2
, 0)));
1291 if (TREE_OPERAND (ref1
, 3))
1293 if (TYPE_ALIGN (elmt_type1
) != TYPE_ALIGN (elmt_type2
)
1294 || !operand_equal_p (TREE_OPERAND (ref1
, 3),
1295 TREE_OPERAND (ref2
, 3), 0))
1300 if (!operand_equal_p (TYPE_SIZE_UNIT (elmt_type1
),
1301 TYPE_SIZE_UNIT (elmt_type2
), 0))
1305 /* Since we know that type sizes are the same, there is no need to return
1306 -1 after this point. Partial overlap can not be introduced. */
1308 /* We may need to fold trees in this case.
1309 TODO: Handle integer constant case at least. */
1310 if (!operand_equal_p (low_bound1
, low_bound2
, 0))
1313 if (TREE_CODE (index1
) == INTEGER_CST
&& TREE_CODE (index2
) == INTEGER_CST
)
1315 if (tree_int_cst_equal (index1
, index2
))
1319 /* TODO: We can use VRP to further disambiguate here. */
1323 /* Try to disambiguate REF1 and REF2 under the assumption that MATCH1 and
1324 MATCH2 either point to the same address or are disjoint.
1325 MATCH1 and MATCH2 are assumed to be ref in the access path of REF1 and REF2
1326 respectively or NULL in the case we established equivalence of bases.
1327 If PARTIAL_OVERLAP is true assume that the toplevel arrays may actually
1328 overlap by exact multiply of their element size.
1330 This test works by matching the initial segment of the access path
1331 and does not rely on TBAA thus is safe for !flag_strict_aliasing if
1332 match was determined without use of TBAA oracle.
1334 Return 1 if we can determine that component references REF1 and REF2,
1335 that are within a common DECL, cannot overlap.
1337 Return 0 if paths are same and thus there is nothing to disambiguate more
1338 (i.e. there is must alias assuming there is must alias between MATCH1 and
1341 Return -1 if we can not determine 0 or 1 - this happens when we met
1342 non-matching types was met in the path.
1343 In this case it may make sense to continue by other disambiguation
1347 nonoverlapping_refs_since_match_p (tree match1
, tree ref1
,
1348 tree match2
, tree ref2
,
1349 bool partial_overlap
)
1351 /* Early return if there are no references to match, we do not need
1352 to walk the access paths.
1354 Do not consider this as may-alias for stats - it is more useful
1355 to have information how many disambiguations happened provided that
1356 the query was meaningful. */
1358 if (match1
== ref1
|| !handled_component_p (ref1
)
1359 || match2
== ref2
|| !handled_component_p (ref2
))
1362 auto_vec
<tree
, 16> component_refs1
;
1363 auto_vec
<tree
, 16> component_refs2
;
1365 /* Create the stack of handled components for REF1. */
1366 while (handled_component_p (ref1
) && ref1
!= match1
)
1368 if (TREE_CODE (ref1
) == VIEW_CONVERT_EXPR
1369 || TREE_CODE (ref1
) == BIT_FIELD_REF
)
1370 component_refs1
.truncate (0);
1372 component_refs1
.safe_push (ref1
);
1373 ref1
= TREE_OPERAND (ref1
, 0);
1376 /* Create the stack of handled components for REF2. */
1377 while (handled_component_p (ref2
) && ref2
!= match2
)
1379 if (TREE_CODE (ref2
) == VIEW_CONVERT_EXPR
1380 || TREE_CODE (ref2
) == BIT_FIELD_REF
)
1381 component_refs2
.truncate (0);
1383 component_refs2
.safe_push (ref2
);
1384 ref2
= TREE_OPERAND (ref2
, 0);
1387 bool mem_ref1
= TREE_CODE (ref1
) == MEM_REF
&& ref1
!= match1
;
1388 bool mem_ref2
= TREE_CODE (ref2
) == MEM_REF
&& ref2
!= match2
;
1390 /* If only one of access path starts with MEM_REF check that offset is 0
1391 so the addresses stays the same after stripping it.
1392 TODO: In this case we may walk the other access path until we get same
1395 If both starts with MEM_REF, offset has to be same. */
1396 if ((mem_ref1
&& !mem_ref2
&& !integer_zerop (TREE_OPERAND (ref1
, 1)))
1397 || (mem_ref2
&& !mem_ref1
&& !integer_zerop (TREE_OPERAND (ref2
, 1)))
1398 || (mem_ref1
&& mem_ref2
1399 && !tree_int_cst_equal (TREE_OPERAND (ref1
, 1),
1400 TREE_OPERAND (ref2
, 1))))
1402 ++alias_stats
.nonoverlapping_refs_since_match_p_may_alias
;
1406 /* TARGET_MEM_REF are never wrapped in handled components, so we do not need
1407 to handle them here at all. */
1408 gcc_checking_assert (TREE_CODE (ref1
) != TARGET_MEM_REF
1409 && TREE_CODE (ref2
) != TARGET_MEM_REF
);
1411 /* Pop the stacks in parallel and examine the COMPONENT_REFs of the same
1412 rank. This is sufficient because we start from the same DECL and you
1413 cannot reference several fields at a time with COMPONENT_REFs (unlike
1414 with ARRAY_RANGE_REFs for arrays) so you always need the same number
1415 of them to access a sub-component, unless you're in a union, in which
1416 case the return value will precisely be false. */
1419 /* Track if we seen unmatched ref with non-zero offset. In this case
1420 we must look for partial overlaps. */
1421 bool seen_unmatched_ref_p
= false;
1423 /* First match ARRAY_REFs an try to disambiguate. */
1424 if (!component_refs1
.is_empty ()
1425 && !component_refs2
.is_empty ())
1427 unsigned int narray_refs1
=0, narray_refs2
=0;
1429 /* We generally assume that both access paths starts by same sequence
1430 of refs. However if number of array refs is not in sync, try
1431 to recover and pop elts until number match. This helps the case
1432 where one access path starts by array and other by element. */
1433 for (narray_refs1
= 0; narray_refs1
< component_refs1
.length ();
1435 if (TREE_CODE (component_refs1
[component_refs1
.length()
1436 - 1 - narray_refs1
]) != ARRAY_REF
)
1439 for (narray_refs2
= 0; narray_refs2
< component_refs2
.length ();
1441 if (TREE_CODE (component_refs2
[component_refs2
.length()
1442 - 1 - narray_refs2
]) != ARRAY_REF
)
1444 for (; narray_refs1
> narray_refs2
; narray_refs1
--)
1446 ref1
= component_refs1
.pop ();
1448 /* If index is non-zero we need to check whether the reference
1449 does not break the main invariant that bases are either
1450 disjoint or equal. Consider the example:
1452 unsigned char out[][1];
1456 Here bases out and out are same, but after removing the
1457 [i] index, this invariant no longer holds, because
1458 out[i] points to the middle of array out.
1460 TODO: If size of type of the skipped reference is an integer
1461 multiply of the size of type of the other reference this
1462 invariant can be verified, but even then it is not completely
1463 safe with !flag_strict_aliasing if the other reference contains
1464 unbounded array accesses.
1467 if (!operand_equal_p (TREE_OPERAND (ref1
, 1),
1468 cheap_array_ref_low_bound (ref1
), 0))
1471 for (; narray_refs2
> narray_refs1
; narray_refs2
--)
1473 ref2
= component_refs2
.pop ();
1474 if (!operand_equal_p (TREE_OPERAND (ref2
, 1),
1475 cheap_array_ref_low_bound (ref2
), 0))
1478 /* Try to disambiguate matched arrays. */
1479 for (unsigned int i
= 0; i
< narray_refs1
; i
++)
1481 int cmp
= nonoverlapping_array_refs_p (component_refs1
.pop (),
1482 component_refs2
.pop ());
1483 if (cmp
== 1 && !partial_overlap
)
1486 .nonoverlapping_refs_since_match_p_no_alias
;
1489 partial_overlap
= false;
1491 seen_unmatched_ref_p
= true;
1495 /* Next look for component_refs. */
1498 if (component_refs1
.is_empty ())
1501 .nonoverlapping_refs_since_match_p_must_overlap
;
1504 ref1
= component_refs1
.pop ();
1505 if (TREE_CODE (ref1
) != COMPONENT_REF
)
1506 seen_unmatched_ref_p
= true;
1508 while (!RECORD_OR_UNION_TYPE_P (TREE_TYPE (TREE_OPERAND (ref1
, 0))));
1512 if (component_refs2
.is_empty ())
1515 .nonoverlapping_refs_since_match_p_must_overlap
;
1518 ref2
= component_refs2
.pop ();
1519 if (TREE_CODE (ref2
) != COMPONENT_REF
)
1520 seen_unmatched_ref_p
= true;
1522 while (!RECORD_OR_UNION_TYPE_P (TREE_TYPE (TREE_OPERAND (ref2
, 0))));
1524 /* BIT_FIELD_REF and VIEW_CONVERT_EXPR are taken off the vectors
1526 gcc_checking_assert (TREE_CODE (ref1
) == COMPONENT_REF
1527 && TREE_CODE (ref2
) == COMPONENT_REF
);
1529 tree field1
= TREE_OPERAND (ref1
, 1);
1530 tree field2
= TREE_OPERAND (ref2
, 1);
1532 /* ??? We cannot simply use the type of operand #0 of the refs here
1533 as the Fortran compiler smuggles type punning into COMPONENT_REFs
1534 for common blocks instead of using unions like everyone else. */
1535 tree type1
= DECL_CONTEXT (field1
);
1536 tree type2
= DECL_CONTEXT (field2
);
1538 partial_overlap
= false;
1540 /* If we skipped array refs on type of different sizes, we can
1541 no longer be sure that there are not partial overlaps. */
1542 if (seen_unmatched_ref_p
1543 && !operand_equal_p (TYPE_SIZE (type1
), TYPE_SIZE (type2
), 0))
1546 .nonoverlapping_refs_since_match_p_may_alias
;
1550 int cmp
= nonoverlapping_component_refs_p_1 (field1
, field2
);
1554 .nonoverlapping_refs_since_match_p_may_alias
;
1560 .nonoverlapping_refs_since_match_p_no_alias
;
1565 ++alias_stats
.nonoverlapping_refs_since_match_p_must_overlap
;
1569 /* Return TYPE_UID which can be used to match record types we consider
1570 same for TBAA purposes. */
1573 ncr_type_uid (const_tree field
)
1575 /* ??? We cannot simply use the type of operand #0 of the refs here
1576 as the Fortran compiler smuggles type punning into COMPONENT_REFs
1577 for common blocks instead of using unions like everyone else. */
1578 tree type
= DECL_FIELD_CONTEXT (field
);
1579 /* With LTO types considered same_type_for_tbaa_p
1580 from different translation unit may not have same
1581 main variant. They however have same TYPE_CANONICAL. */
1582 if (TYPE_CANONICAL (type
))
1583 return TYPE_UID (TYPE_CANONICAL (type
));
1584 return TYPE_UID (type
);
1587 /* qsort compare function to sort FIELD_DECLs after their
1588 DECL_FIELD_CONTEXT TYPE_UID. */
1591 ncr_compar (const void *field1_
, const void *field2_
)
1593 const_tree field1
= *(const_tree
*) const_cast <void *>(field1_
);
1594 const_tree field2
= *(const_tree
*) const_cast <void *>(field2_
);
1595 unsigned int uid1
= ncr_type_uid (field1
);
1596 unsigned int uid2
= ncr_type_uid (field2
);
1600 else if (uid1
> uid2
)
1605 /* Return true if we can determine that the fields referenced cannot
1606 overlap for any pair of objects. This relies on TBAA. */
1609 nonoverlapping_component_refs_p (const_tree x
, const_tree y
)
1611 /* Early return if we have nothing to do.
1613 Do not consider this as may-alias for stats - it is more useful
1614 to have information how many disambiguations happened provided that
1615 the query was meaningful. */
1616 if (!flag_strict_aliasing
1618 || !handled_component_p (x
)
1619 || !handled_component_p (y
))
1622 auto_vec
<const_tree
, 16> fieldsx
;
1623 while (handled_component_p (x
))
1625 if (TREE_CODE (x
) == COMPONENT_REF
)
1627 tree field
= TREE_OPERAND (x
, 1);
1628 tree type
= DECL_FIELD_CONTEXT (field
);
1629 if (TREE_CODE (type
) == RECORD_TYPE
)
1630 fieldsx
.safe_push (field
);
1632 else if (TREE_CODE (x
) == VIEW_CONVERT_EXPR
1633 || TREE_CODE (x
) == BIT_FIELD_REF
)
1634 fieldsx
.truncate (0);
1635 x
= TREE_OPERAND (x
, 0);
1637 if (fieldsx
.length () == 0)
1639 auto_vec
<const_tree
, 16> fieldsy
;
1640 while (handled_component_p (y
))
1642 if (TREE_CODE (y
) == COMPONENT_REF
)
1644 tree field
= TREE_OPERAND (y
, 1);
1645 tree type
= DECL_FIELD_CONTEXT (field
);
1646 if (TREE_CODE (type
) == RECORD_TYPE
)
1647 fieldsy
.safe_push (TREE_OPERAND (y
, 1));
1649 else if (TREE_CODE (y
) == VIEW_CONVERT_EXPR
1650 || TREE_CODE (y
) == BIT_FIELD_REF
)
1651 fieldsy
.truncate (0);
1652 y
= TREE_OPERAND (y
, 0);
1654 if (fieldsy
.length () == 0)
1656 ++alias_stats
.nonoverlapping_component_refs_p_may_alias
;
1660 /* Most common case first. */
1661 if (fieldsx
.length () == 1
1662 && fieldsy
.length () == 1)
1664 if (same_type_for_tbaa (DECL_FIELD_CONTEXT (fieldsx
[0]),
1665 DECL_FIELD_CONTEXT (fieldsy
[0])) == 1
1666 && nonoverlapping_component_refs_p_1 (fieldsx
[0], fieldsy
[0]) == 1)
1668 ++alias_stats
.nonoverlapping_component_refs_p_no_alias
;
1673 ++alias_stats
.nonoverlapping_component_refs_p_may_alias
;
1678 if (fieldsx
.length () == 2)
1680 if (ncr_compar (&fieldsx
[0], &fieldsx
[1]) == 1)
1681 std::swap (fieldsx
[0], fieldsx
[1]);
1684 fieldsx
.qsort (ncr_compar
);
1686 if (fieldsy
.length () == 2)
1688 if (ncr_compar (&fieldsy
[0], &fieldsy
[1]) == 1)
1689 std::swap (fieldsy
[0], fieldsy
[1]);
1692 fieldsy
.qsort (ncr_compar
);
1694 unsigned i
= 0, j
= 0;
1697 const_tree fieldx
= fieldsx
[i
];
1698 const_tree fieldy
= fieldsy
[j
];
1700 /* We're left with accessing different fields of a structure,
1701 no possible overlap. */
1702 if (same_type_for_tbaa (DECL_FIELD_CONTEXT (fieldx
),
1703 DECL_FIELD_CONTEXT (fieldy
)) == 1
1704 && nonoverlapping_component_refs_p_1 (fieldx
, fieldy
) == 1)
1706 ++alias_stats
.nonoverlapping_component_refs_p_no_alias
;
1710 if (ncr_type_uid (fieldx
) < ncr_type_uid (fieldy
))
1713 if (i
== fieldsx
.length ())
1719 if (j
== fieldsy
.length ())
1725 ++alias_stats
.nonoverlapping_component_refs_p_may_alias
;
1730 /* Return true if two memory references based on the variables BASE1
1731 and BASE2 constrained to [OFFSET1, OFFSET1 + MAX_SIZE1) and
1732 [OFFSET2, OFFSET2 + MAX_SIZE2) may alias. REF1 and REF2
1733 if non-NULL are the complete memory reference trees. */
1736 decl_refs_may_alias_p (tree ref1
, tree base1
,
1737 poly_int64 offset1
, poly_int64 max_size1
,
1739 tree ref2
, tree base2
,
1740 poly_int64 offset2
, poly_int64 max_size2
,
1743 gcc_checking_assert (DECL_P (base1
) && DECL_P (base2
));
1745 /* If both references are based on different variables, they cannot alias. */
1746 if (compare_base_decls (base1
, base2
) == 0)
1749 /* If both references are based on the same variable, they cannot alias if
1750 the accesses do not overlap. */
1751 if (!ranges_maybe_overlap_p (offset1
, max_size1
, offset2
, max_size2
))
1754 /* If there is must alias, there is no use disambiguating further. */
1755 if (known_eq (size1
, max_size1
) && known_eq (size2
, max_size2
))
1758 /* For components with variable position, the above test isn't sufficient,
1759 so we disambiguate component references manually. */
1761 && handled_component_p (ref1
) && handled_component_p (ref2
)
1762 && nonoverlapping_refs_since_match_p (NULL
, ref1
, NULL
, ref2
, false) == 1)
1768 /* Return true if an indirect reference based on *PTR1 constrained
1769 to [OFFSET1, OFFSET1 + MAX_SIZE1) may alias a variable based on BASE2
1770 constrained to [OFFSET2, OFFSET2 + MAX_SIZE2). *PTR1 and BASE2 have
1771 the alias sets BASE1_ALIAS_SET and BASE2_ALIAS_SET which can be -1
1772 in which case they are computed on-demand. REF1 and REF2
1773 if non-NULL are the complete memory reference trees. */
1776 indirect_ref_may_alias_decl_p (tree ref1 ATTRIBUTE_UNUSED
, tree base1
,
1777 poly_int64 offset1
, poly_int64 max_size1
,
1779 alias_set_type ref1_alias_set
,
1780 alias_set_type base1_alias_set
,
1781 tree ref2 ATTRIBUTE_UNUSED
, tree base2
,
1782 poly_int64 offset2
, poly_int64 max_size2
,
1784 alias_set_type ref2_alias_set
,
1785 alias_set_type base2_alias_set
, bool tbaa_p
)
1788 tree ptrtype1
, dbase2
;
1790 gcc_checking_assert ((TREE_CODE (base1
) == MEM_REF
1791 || TREE_CODE (base1
) == TARGET_MEM_REF
)
1794 ptr1
= TREE_OPERAND (base1
, 0);
1795 poly_offset_int moff
= mem_ref_offset (base1
) << LOG2_BITS_PER_UNIT
;
1797 /* If only one reference is based on a variable, they cannot alias if
1798 the pointer access is beyond the extent of the variable access.
1799 (the pointer base cannot validly point to an offset less than zero
1801 ??? IVOPTs creates bases that do not honor this restriction,
1802 so do not apply this optimization for TARGET_MEM_REFs. */
1803 if (TREE_CODE (base1
) != TARGET_MEM_REF
1804 && !ranges_maybe_overlap_p (offset1
+ moff
, -1, offset2
, max_size2
))
1806 /* They also cannot alias if the pointer may not point to the decl. */
1807 if (!ptr_deref_may_alias_decl_p (ptr1
, base2
))
1810 /* Disambiguations that rely on strict aliasing rules follow. */
1811 if (!flag_strict_aliasing
|| !tbaa_p
)
1814 /* If the alias set for a pointer access is zero all bets are off. */
1815 if (base1_alias_set
== 0 || base2_alias_set
== 0)
1818 /* When we are trying to disambiguate an access with a pointer dereference
1819 as base versus one with a decl as base we can use both the size
1820 of the decl and its dynamic type for extra disambiguation.
1821 ??? We do not know anything about the dynamic type of the decl
1822 other than that its alias-set contains base2_alias_set as a subset
1823 which does not help us here. */
1824 /* As we know nothing useful about the dynamic type of the decl just
1825 use the usual conflict check rather than a subset test.
1826 ??? We could introduce -fvery-strict-aliasing when the language
1827 does not allow decls to have a dynamic type that differs from their
1828 static type. Then we can check
1829 !alias_set_subset_of (base1_alias_set, base2_alias_set) instead. */
1830 if (base1_alias_set
!= base2_alias_set
1831 && !alias_sets_conflict_p (base1_alias_set
, base2_alias_set
))
1834 ptrtype1
= TREE_TYPE (TREE_OPERAND (base1
, 1));
1836 /* If the size of the access relevant for TBAA through the pointer
1837 is bigger than the size of the decl we can't possibly access the
1838 decl via that pointer. */
1839 if (/* ??? This in turn may run afoul when a decl of type T which is
1840 a member of union type U is accessed through a pointer to
1841 type U and sizeof T is smaller than sizeof U. */
1842 TREE_CODE (TREE_TYPE (ptrtype1
)) != UNION_TYPE
1843 && TREE_CODE (TREE_TYPE (ptrtype1
)) != QUAL_UNION_TYPE
1844 && compare_sizes (DECL_SIZE (base2
),
1845 TYPE_SIZE (TREE_TYPE (ptrtype1
))) < 0)
1851 /* If the decl is accessed via a MEM_REF, reconstruct the base
1852 we can use for TBAA and an appropriately adjusted offset. */
1854 while (handled_component_p (dbase2
))
1855 dbase2
= TREE_OPERAND (dbase2
, 0);
1856 poly_int64 doffset1
= offset1
;
1857 poly_offset_int doffset2
= offset2
;
1858 if (TREE_CODE (dbase2
) == MEM_REF
1859 || TREE_CODE (dbase2
) == TARGET_MEM_REF
)
1861 doffset2
-= mem_ref_offset (dbase2
) << LOG2_BITS_PER_UNIT
;
1862 tree ptrtype2
= TREE_TYPE (TREE_OPERAND (dbase2
, 1));
1863 /* If second reference is view-converted, give up now. */
1864 if (same_type_for_tbaa (TREE_TYPE (dbase2
), TREE_TYPE (ptrtype2
)) != 1)
1868 /* If first reference is view-converted, give up now. */
1869 if (same_type_for_tbaa (TREE_TYPE (base1
), TREE_TYPE (ptrtype1
)) != 1)
1872 /* If both references are through the same type, they do not alias
1873 if the accesses do not overlap. This does extra disambiguation
1874 for mixed/pointer accesses but requires strict aliasing.
1875 For MEM_REFs we require that the component-ref offset we computed
1876 is relative to the start of the type which we ensure by
1877 comparing rvalue and access type and disregarding the constant
1880 But avoid treating variable length arrays as "objects", instead assume they
1881 can overlap by an exact multiple of their element size.
1882 See gcc.dg/torture/alias-2.c. */
1883 if (((TREE_CODE (base1
) != TARGET_MEM_REF
1884 || (!TMR_INDEX (base1
) && !TMR_INDEX2 (base1
)))
1885 && (TREE_CODE (dbase2
) != TARGET_MEM_REF
1886 || (!TMR_INDEX (dbase2
) && !TMR_INDEX2 (dbase2
))))
1887 && same_type_for_tbaa (TREE_TYPE (base1
), TREE_TYPE (dbase2
)) == 1)
1889 bool partial_overlap
= (TREE_CODE (TREE_TYPE (base1
)) == ARRAY_TYPE
1890 && (TYPE_SIZE (TREE_TYPE (base1
))
1891 && TREE_CODE (TYPE_SIZE (TREE_TYPE (base1
)))
1893 if (!partial_overlap
1894 && !ranges_maybe_overlap_p (doffset1
, max_size1
, doffset2
, max_size2
))
1897 /* If there is must alias, there is no use disambiguating further. */
1898 || (!partial_overlap
1899 && known_eq (size1
, max_size1
) && known_eq (size2
, max_size2
)))
1901 int res
= nonoverlapping_refs_since_match_p (base1
, ref1
, base2
, ref2
,
1904 return !nonoverlapping_component_refs_p (ref1
, ref2
);
1908 /* Do access-path based disambiguation. */
1910 && (handled_component_p (ref1
) || handled_component_p (ref2
)))
1911 return aliasing_component_refs_p (ref1
,
1912 ref1_alias_set
, base1_alias_set
,
1915 ref2_alias_set
, base2_alias_set
,
1916 offset2
, max_size2
);
1921 /* Return true if two indirect references based on *PTR1
1922 and *PTR2 constrained to [OFFSET1, OFFSET1 + MAX_SIZE1) and
1923 [OFFSET2, OFFSET2 + MAX_SIZE2) may alias. *PTR1 and *PTR2 have
1924 the alias sets BASE1_ALIAS_SET and BASE2_ALIAS_SET which can be -1
1925 in which case they are computed on-demand. REF1 and REF2
1926 if non-NULL are the complete memory reference trees. */
1929 indirect_refs_may_alias_p (tree ref1 ATTRIBUTE_UNUSED
, tree base1
,
1930 poly_int64 offset1
, poly_int64 max_size1
,
1932 alias_set_type ref1_alias_set
,
1933 alias_set_type base1_alias_set
,
1934 tree ref2 ATTRIBUTE_UNUSED
, tree base2
,
1935 poly_int64 offset2
, poly_int64 max_size2
,
1937 alias_set_type ref2_alias_set
,
1938 alias_set_type base2_alias_set
, bool tbaa_p
)
1942 tree ptrtype1
, ptrtype2
;
1944 gcc_checking_assert ((TREE_CODE (base1
) == MEM_REF
1945 || TREE_CODE (base1
) == TARGET_MEM_REF
)
1946 && (TREE_CODE (base2
) == MEM_REF
1947 || TREE_CODE (base2
) == TARGET_MEM_REF
));
1949 ptr1
= TREE_OPERAND (base1
, 0);
1950 ptr2
= TREE_OPERAND (base2
, 0);
1952 /* If both bases are based on pointers they cannot alias if they may not
1953 point to the same memory object or if they point to the same object
1954 and the accesses do not overlap. */
1955 if ((!cfun
|| gimple_in_ssa_p (cfun
))
1956 && operand_equal_p (ptr1
, ptr2
, 0)
1957 && (((TREE_CODE (base1
) != TARGET_MEM_REF
1958 || (!TMR_INDEX (base1
) && !TMR_INDEX2 (base1
)))
1959 && (TREE_CODE (base2
) != TARGET_MEM_REF
1960 || (!TMR_INDEX (base2
) && !TMR_INDEX2 (base2
))))
1961 || (TREE_CODE (base1
) == TARGET_MEM_REF
1962 && TREE_CODE (base2
) == TARGET_MEM_REF
1963 && (TMR_STEP (base1
) == TMR_STEP (base2
)
1964 || (TMR_STEP (base1
) && TMR_STEP (base2
)
1965 && operand_equal_p (TMR_STEP (base1
),
1966 TMR_STEP (base2
), 0)))
1967 && (TMR_INDEX (base1
) == TMR_INDEX (base2
)
1968 || (TMR_INDEX (base1
) && TMR_INDEX (base2
)
1969 && operand_equal_p (TMR_INDEX (base1
),
1970 TMR_INDEX (base2
), 0)))
1971 && (TMR_INDEX2 (base1
) == TMR_INDEX2 (base2
)
1972 || (TMR_INDEX2 (base1
) && TMR_INDEX2 (base2
)
1973 && operand_equal_p (TMR_INDEX2 (base1
),
1974 TMR_INDEX2 (base2
), 0))))))
1976 poly_offset_int moff1
= mem_ref_offset (base1
) << LOG2_BITS_PER_UNIT
;
1977 poly_offset_int moff2
= mem_ref_offset (base2
) << LOG2_BITS_PER_UNIT
;
1978 if (!ranges_maybe_overlap_p (offset1
+ moff1
, max_size1
,
1979 offset2
+ moff2
, max_size2
))
1981 /* If there is must alias, there is no use disambiguating further. */
1982 if (known_eq (size1
, max_size1
) && known_eq (size2
, max_size2
))
1986 int res
= nonoverlapping_refs_since_match_p (NULL
, ref1
, NULL
, ref2
,
1992 if (!ptr_derefs_may_alias_p (ptr1
, ptr2
))
1995 /* Disambiguations that rely on strict aliasing rules follow. */
1996 if (!flag_strict_aliasing
|| !tbaa_p
)
1999 ptrtype1
= TREE_TYPE (TREE_OPERAND (base1
, 1));
2000 ptrtype2
= TREE_TYPE (TREE_OPERAND (base2
, 1));
2002 /* If the alias set for a pointer access is zero all bets are off. */
2003 if (base1_alias_set
== 0
2004 || base2_alias_set
== 0)
2007 /* Do type-based disambiguation. */
2008 if (base1_alias_set
!= base2_alias_set
2009 && !alias_sets_conflict_p (base1_alias_set
, base2_alias_set
))
2012 /* If either reference is view-converted, give up now. */
2013 if (same_type_for_tbaa (TREE_TYPE (base1
), TREE_TYPE (ptrtype1
)) != 1
2014 || same_type_for_tbaa (TREE_TYPE (base2
), TREE_TYPE (ptrtype2
)) != 1)
2017 /* If both references are through the same type, they do not alias
2018 if the accesses do not overlap. This does extra disambiguation
2019 for mixed/pointer accesses but requires strict aliasing. */
2020 if ((TREE_CODE (base1
) != TARGET_MEM_REF
2021 || (!TMR_INDEX (base1
) && !TMR_INDEX2 (base1
)))
2022 && (TREE_CODE (base2
) != TARGET_MEM_REF
2023 || (!TMR_INDEX (base2
) && !TMR_INDEX2 (base2
)))
2024 && same_type_for_tbaa (TREE_TYPE (ptrtype1
),
2025 TREE_TYPE (ptrtype2
)) == 1)
2027 /* But avoid treating arrays as "objects", instead assume they
2028 can overlap by an exact multiple of their element size.
2029 See gcc.dg/torture/alias-2.c. */
2030 bool partial_overlap
= TREE_CODE (TREE_TYPE (ptrtype1
)) == ARRAY_TYPE
;
2032 if (!partial_overlap
2033 && !ranges_maybe_overlap_p (offset1
, max_size1
, offset2
, max_size2
))
2036 || (!partial_overlap
2037 && known_eq (size1
, max_size1
) && known_eq (size2
, max_size2
)))
2039 int res
= nonoverlapping_refs_since_match_p (base1
, ref1
, base2
, ref2
,
2042 return !nonoverlapping_component_refs_p (ref1
, ref2
);
2046 /* Do access-path based disambiguation. */
2048 && (handled_component_p (ref1
) || handled_component_p (ref2
)))
2049 return aliasing_component_refs_p (ref1
,
2050 ref1_alias_set
, base1_alias_set
,
2053 ref2_alias_set
, base2_alias_set
,
2054 offset2
, max_size2
);
2059 /* Return true, if the two memory references REF1 and REF2 may alias. */
2062 refs_may_alias_p_2 (ao_ref
*ref1
, ao_ref
*ref2
, bool tbaa_p
)
2065 poly_int64 offset1
= 0, offset2
= 0;
2066 poly_int64 max_size1
= -1, max_size2
= -1;
2067 bool var1_p
, var2_p
, ind1_p
, ind2_p
;
2069 gcc_checking_assert ((!ref1
->ref
2070 || TREE_CODE (ref1
->ref
) == SSA_NAME
2071 || DECL_P (ref1
->ref
)
2072 || TREE_CODE (ref1
->ref
) == STRING_CST
2073 || handled_component_p (ref1
->ref
)
2074 || TREE_CODE (ref1
->ref
) == MEM_REF
2075 || TREE_CODE (ref1
->ref
) == TARGET_MEM_REF
)
2077 || TREE_CODE (ref2
->ref
) == SSA_NAME
2078 || DECL_P (ref2
->ref
)
2079 || TREE_CODE (ref2
->ref
) == STRING_CST
2080 || handled_component_p (ref2
->ref
)
2081 || TREE_CODE (ref2
->ref
) == MEM_REF
2082 || TREE_CODE (ref2
->ref
) == TARGET_MEM_REF
));
2084 /* Decompose the references into their base objects and the access. */
2085 base1
= ao_ref_base (ref1
);
2086 offset1
= ref1
->offset
;
2087 max_size1
= ref1
->max_size
;
2088 base2
= ao_ref_base (ref2
);
2089 offset2
= ref2
->offset
;
2090 max_size2
= ref2
->max_size
;
2092 /* We can end up with registers or constants as bases for example from
2093 *D.1663_44 = VIEW_CONVERT_EXPR<struct DB_LSN>(__tmp$B0F64_59);
2094 which is seen as a struct copy. */
2095 if (TREE_CODE (base1
) == SSA_NAME
2096 || TREE_CODE (base1
) == CONST_DECL
2097 || TREE_CODE (base1
) == CONSTRUCTOR
2098 || TREE_CODE (base1
) == ADDR_EXPR
2099 || CONSTANT_CLASS_P (base1
)
2100 || TREE_CODE (base2
) == SSA_NAME
2101 || TREE_CODE (base2
) == CONST_DECL
2102 || TREE_CODE (base2
) == CONSTRUCTOR
2103 || TREE_CODE (base2
) == ADDR_EXPR
2104 || CONSTANT_CLASS_P (base2
))
2107 /* We can end up referring to code via function and label decls.
2108 As we likely do not properly track code aliases conservatively
2110 if (TREE_CODE (base1
) == FUNCTION_DECL
2111 || TREE_CODE (base1
) == LABEL_DECL
2112 || TREE_CODE (base2
) == FUNCTION_DECL
2113 || TREE_CODE (base2
) == LABEL_DECL
)
2116 /* Two volatile accesses always conflict. */
2117 if (ref1
->volatile_p
2118 && ref2
->volatile_p
)
2121 /* Defer to simple offset based disambiguation if we have
2122 references based on two decls. Do this before defering to
2123 TBAA to handle must-alias cases in conformance with the
2124 GCC extension of allowing type-punning through unions. */
2125 var1_p
= DECL_P (base1
);
2126 var2_p
= DECL_P (base2
);
2127 if (var1_p
&& var2_p
)
2128 return decl_refs_may_alias_p (ref1
->ref
, base1
, offset1
, max_size1
,
2130 ref2
->ref
, base2
, offset2
, max_size2
,
2133 /* Handle restrict based accesses.
2134 ??? ao_ref_base strips inner MEM_REF [&decl], recover from that
2136 tree rbase1
= base1
;
2137 tree rbase2
= base2
;
2142 while (handled_component_p (rbase1
))
2143 rbase1
= TREE_OPERAND (rbase1
, 0);
2149 while (handled_component_p (rbase2
))
2150 rbase2
= TREE_OPERAND (rbase2
, 0);
2152 if (rbase1
&& rbase2
2153 && (TREE_CODE (base1
) == MEM_REF
|| TREE_CODE (base1
) == TARGET_MEM_REF
)
2154 && (TREE_CODE (base2
) == MEM_REF
|| TREE_CODE (base2
) == TARGET_MEM_REF
)
2155 /* If the accesses are in the same restrict clique... */
2156 && MR_DEPENDENCE_CLIQUE (base1
) == MR_DEPENDENCE_CLIQUE (base2
)
2157 /* But based on different pointers they do not alias. */
2158 && MR_DEPENDENCE_BASE (base1
) != MR_DEPENDENCE_BASE (base2
))
2161 ind1_p
= (TREE_CODE (base1
) == MEM_REF
2162 || TREE_CODE (base1
) == TARGET_MEM_REF
);
2163 ind2_p
= (TREE_CODE (base2
) == MEM_REF
2164 || TREE_CODE (base2
) == TARGET_MEM_REF
);
2166 /* Canonicalize the pointer-vs-decl case. */
2167 if (ind1_p
&& var2_p
)
2169 std::swap (offset1
, offset2
);
2170 std::swap (max_size1
, max_size2
);
2171 std::swap (base1
, base2
);
2172 std::swap (ref1
, ref2
);
2179 /* First defer to TBAA if possible. */
2181 && flag_strict_aliasing
2182 && !alias_sets_conflict_p (ao_ref_alias_set (ref1
),
2183 ao_ref_alias_set (ref2
)))
2186 /* If the reference is based on a pointer that points to memory
2187 that may not be written to then the other reference cannot possibly
2189 if ((TREE_CODE (TREE_OPERAND (base2
, 0)) == SSA_NAME
2190 && SSA_NAME_POINTS_TO_READONLY_MEMORY (TREE_OPERAND (base2
, 0)))
2192 && TREE_CODE (TREE_OPERAND (base1
, 0)) == SSA_NAME
2193 && SSA_NAME_POINTS_TO_READONLY_MEMORY (TREE_OPERAND (base1
, 0))))
2196 /* Dispatch to the pointer-vs-decl or pointer-vs-pointer disambiguators. */
2197 if (var1_p
&& ind2_p
)
2198 return indirect_ref_may_alias_decl_p (ref2
->ref
, base2
,
2199 offset2
, max_size2
, ref2
->size
,
2200 ao_ref_alias_set (ref2
),
2201 ao_ref_base_alias_set (ref2
),
2203 offset1
, max_size1
, ref1
->size
,
2204 ao_ref_alias_set (ref1
),
2205 ao_ref_base_alias_set (ref1
),
2207 else if (ind1_p
&& ind2_p
)
2208 return indirect_refs_may_alias_p (ref1
->ref
, base1
,
2209 offset1
, max_size1
, ref1
->size
,
2210 ao_ref_alias_set (ref1
),
2211 ao_ref_base_alias_set (ref1
),
2213 offset2
, max_size2
, ref2
->size
,
2214 ao_ref_alias_set (ref2
),
2215 ao_ref_base_alias_set (ref2
),
2221 /* Return true, if the two memory references REF1 and REF2 may alias
2222 and update statistics. */
2225 refs_may_alias_p_1 (ao_ref
*ref1
, ao_ref
*ref2
, bool tbaa_p
)
2227 bool res
= refs_may_alias_p_2 (ref1
, ref2
, tbaa_p
);
2229 ++alias_stats
.refs_may_alias_p_may_alias
;
2231 ++alias_stats
.refs_may_alias_p_no_alias
;
2236 refs_may_alias_p (tree ref1
, ao_ref
*ref2
, bool tbaa_p
)
2239 ao_ref_init (&r1
, ref1
);
2240 return refs_may_alias_p_1 (&r1
, ref2
, tbaa_p
);
2244 refs_may_alias_p (tree ref1
, tree ref2
, bool tbaa_p
)
2247 ao_ref_init (&r1
, ref1
);
2248 ao_ref_init (&r2
, ref2
);
2249 return refs_may_alias_p_1 (&r1
, &r2
, tbaa_p
);
2252 /* Returns true if there is a anti-dependence for the STORE that
2253 executes after the LOAD. */
2256 refs_anti_dependent_p (tree load
, tree store
)
2259 ao_ref_init (&r1
, load
);
2260 ao_ref_init (&r2
, store
);
2261 return refs_may_alias_p_1 (&r1
, &r2
, false);
2264 /* Returns true if there is a output dependence for the stores
2265 STORE1 and STORE2. */
2268 refs_output_dependent_p (tree store1
, tree store2
)
2271 ao_ref_init (&r1
, store1
);
2272 ao_ref_init (&r2
, store2
);
2273 return refs_may_alias_p_1 (&r1
, &r2
, false);
2276 /* If the call CALL may use the memory reference REF return true,
2277 otherwise return false. */
2280 ref_maybe_used_by_call_p_1 (gcall
*call
, ao_ref
*ref
, bool tbaa_p
)
2284 int flags
= gimple_call_flags (call
);
2286 /* Const functions without a static chain do not implicitly use memory. */
2287 if (!gimple_call_chain (call
)
2288 && (flags
& (ECF_CONST
|ECF_NOVOPS
)))
2291 base
= ao_ref_base (ref
);
2295 /* A call that is not without side-effects might involve volatile
2296 accesses and thus conflicts with all other volatile accesses. */
2297 if (ref
->volatile_p
)
2300 /* If the reference is based on a decl that is not aliased the call
2301 cannot possibly use it. */
2303 && !may_be_aliased (base
)
2304 /* But local statics can be used through recursion. */
2305 && !is_global_var (base
))
2308 callee
= gimple_call_fndecl (call
);
2310 /* Handle those builtin functions explicitly that do not act as
2311 escape points. See tree-ssa-structalias.c:find_func_aliases
2312 for the list of builtins we might need to handle here. */
2313 if (callee
!= NULL_TREE
2314 && gimple_call_builtin_p (call
, BUILT_IN_NORMAL
))
2315 switch (DECL_FUNCTION_CODE (callee
))
2317 /* All the following functions read memory pointed to by
2318 their second argument. strcat/strncat additionally
2319 reads memory pointed to by the first argument. */
2320 case BUILT_IN_STRCAT
:
2321 case BUILT_IN_STRNCAT
:
2324 ao_ref_init_from_ptr_and_size (&dref
,
2325 gimple_call_arg (call
, 0),
2327 if (refs_may_alias_p_1 (&dref
, ref
, false))
2331 case BUILT_IN_STRCPY
:
2332 case BUILT_IN_STRNCPY
:
2333 case BUILT_IN_MEMCPY
:
2334 case BUILT_IN_MEMMOVE
:
2335 case BUILT_IN_MEMPCPY
:
2336 case BUILT_IN_STPCPY
:
2337 case BUILT_IN_STPNCPY
:
2338 case BUILT_IN_TM_MEMCPY
:
2339 case BUILT_IN_TM_MEMMOVE
:
2342 tree size
= NULL_TREE
;
2343 if (gimple_call_num_args (call
) == 3)
2344 size
= gimple_call_arg (call
, 2);
2345 ao_ref_init_from_ptr_and_size (&dref
,
2346 gimple_call_arg (call
, 1),
2348 return refs_may_alias_p_1 (&dref
, ref
, false);
2350 case BUILT_IN_STRCAT_CHK
:
2351 case BUILT_IN_STRNCAT_CHK
:
2354 ao_ref_init_from_ptr_and_size (&dref
,
2355 gimple_call_arg (call
, 0),
2357 if (refs_may_alias_p_1 (&dref
, ref
, false))
2361 case BUILT_IN_STRCPY_CHK
:
2362 case BUILT_IN_STRNCPY_CHK
:
2363 case BUILT_IN_MEMCPY_CHK
:
2364 case BUILT_IN_MEMMOVE_CHK
:
2365 case BUILT_IN_MEMPCPY_CHK
:
2366 case BUILT_IN_STPCPY_CHK
:
2367 case BUILT_IN_STPNCPY_CHK
:
2370 tree size
= NULL_TREE
;
2371 if (gimple_call_num_args (call
) == 4)
2372 size
= gimple_call_arg (call
, 2);
2373 ao_ref_init_from_ptr_and_size (&dref
,
2374 gimple_call_arg (call
, 1),
2376 return refs_may_alias_p_1 (&dref
, ref
, false);
2378 case BUILT_IN_BCOPY
:
2381 tree size
= gimple_call_arg (call
, 2);
2382 ao_ref_init_from_ptr_and_size (&dref
,
2383 gimple_call_arg (call
, 0),
2385 return refs_may_alias_p_1 (&dref
, ref
, false);
2388 /* The following functions read memory pointed to by their
2390 CASE_BUILT_IN_TM_LOAD (1):
2391 CASE_BUILT_IN_TM_LOAD (2):
2392 CASE_BUILT_IN_TM_LOAD (4):
2393 CASE_BUILT_IN_TM_LOAD (8):
2394 CASE_BUILT_IN_TM_LOAD (FLOAT
):
2395 CASE_BUILT_IN_TM_LOAD (DOUBLE
):
2396 CASE_BUILT_IN_TM_LOAD (LDOUBLE
):
2397 CASE_BUILT_IN_TM_LOAD (M64
):
2398 CASE_BUILT_IN_TM_LOAD (M128
):
2399 CASE_BUILT_IN_TM_LOAD (M256
):
2400 case BUILT_IN_TM_LOG
:
2401 case BUILT_IN_TM_LOG_1
:
2402 case BUILT_IN_TM_LOG_2
:
2403 case BUILT_IN_TM_LOG_4
:
2404 case BUILT_IN_TM_LOG_8
:
2405 case BUILT_IN_TM_LOG_FLOAT
:
2406 case BUILT_IN_TM_LOG_DOUBLE
:
2407 case BUILT_IN_TM_LOG_LDOUBLE
:
2408 case BUILT_IN_TM_LOG_M64
:
2409 case BUILT_IN_TM_LOG_M128
:
2410 case BUILT_IN_TM_LOG_M256
:
2411 return ptr_deref_may_alias_ref_p_1 (gimple_call_arg (call
, 0), ref
);
2413 /* These read memory pointed to by the first argument. */
2414 case BUILT_IN_STRDUP
:
2415 case BUILT_IN_STRNDUP
:
2416 case BUILT_IN_REALLOC
:
2419 tree size
= NULL_TREE
;
2420 if (gimple_call_num_args (call
) == 2)
2421 size
= gimple_call_arg (call
, 1);
2422 ao_ref_init_from_ptr_and_size (&dref
,
2423 gimple_call_arg (call
, 0),
2425 return refs_may_alias_p_1 (&dref
, ref
, false);
2427 /* These read memory pointed to by the first argument. */
2428 case BUILT_IN_INDEX
:
2429 case BUILT_IN_STRCHR
:
2430 case BUILT_IN_STRRCHR
:
2433 ao_ref_init_from_ptr_and_size (&dref
,
2434 gimple_call_arg (call
, 0),
2436 return refs_may_alias_p_1 (&dref
, ref
, false);
2438 /* These read memory pointed to by the first argument with size
2439 in the third argument. */
2440 case BUILT_IN_MEMCHR
:
2443 ao_ref_init_from_ptr_and_size (&dref
,
2444 gimple_call_arg (call
, 0),
2445 gimple_call_arg (call
, 2));
2446 return refs_may_alias_p_1 (&dref
, ref
, false);
2448 /* These read memory pointed to by the first and second arguments. */
2449 case BUILT_IN_STRSTR
:
2450 case BUILT_IN_STRPBRK
:
2453 ao_ref_init_from_ptr_and_size (&dref
,
2454 gimple_call_arg (call
, 0),
2456 if (refs_may_alias_p_1 (&dref
, ref
, false))
2458 ao_ref_init_from_ptr_and_size (&dref
,
2459 gimple_call_arg (call
, 1),
2461 return refs_may_alias_p_1 (&dref
, ref
, false);
2464 /* The following builtins do not read from memory. */
2466 case BUILT_IN_MALLOC
:
2467 case BUILT_IN_POSIX_MEMALIGN
:
2468 case BUILT_IN_ALIGNED_ALLOC
:
2469 case BUILT_IN_CALLOC
:
2470 CASE_BUILT_IN_ALLOCA
:
2471 case BUILT_IN_STACK_SAVE
:
2472 case BUILT_IN_STACK_RESTORE
:
2473 case BUILT_IN_MEMSET
:
2474 case BUILT_IN_TM_MEMSET
:
2475 case BUILT_IN_MEMSET_CHK
:
2476 case BUILT_IN_FREXP
:
2477 case BUILT_IN_FREXPF
:
2478 case BUILT_IN_FREXPL
:
2479 case BUILT_IN_GAMMA_R
:
2480 case BUILT_IN_GAMMAF_R
:
2481 case BUILT_IN_GAMMAL_R
:
2482 case BUILT_IN_LGAMMA_R
:
2483 case BUILT_IN_LGAMMAF_R
:
2484 case BUILT_IN_LGAMMAL_R
:
2486 case BUILT_IN_MODFF
:
2487 case BUILT_IN_MODFL
:
2488 case BUILT_IN_REMQUO
:
2489 case BUILT_IN_REMQUOF
:
2490 case BUILT_IN_REMQUOL
:
2491 case BUILT_IN_SINCOS
:
2492 case BUILT_IN_SINCOSF
:
2493 case BUILT_IN_SINCOSL
:
2494 case BUILT_IN_ASSUME_ALIGNED
:
2495 case BUILT_IN_VA_END
:
2497 /* __sync_* builtins and some OpenMP builtins act as threading
2499 #undef DEF_SYNC_BUILTIN
2500 #define DEF_SYNC_BUILTIN(ENUM, NAME, TYPE, ATTRS) case ENUM:
2501 #include "sync-builtins.def"
2502 #undef DEF_SYNC_BUILTIN
2503 case BUILT_IN_GOMP_ATOMIC_START
:
2504 case BUILT_IN_GOMP_ATOMIC_END
:
2505 case BUILT_IN_GOMP_BARRIER
:
2506 case BUILT_IN_GOMP_BARRIER_CANCEL
:
2507 case BUILT_IN_GOMP_TASKWAIT
:
2508 case BUILT_IN_GOMP_TASKGROUP_END
:
2509 case BUILT_IN_GOMP_CRITICAL_START
:
2510 case BUILT_IN_GOMP_CRITICAL_END
:
2511 case BUILT_IN_GOMP_CRITICAL_NAME_START
:
2512 case BUILT_IN_GOMP_CRITICAL_NAME_END
:
2513 case BUILT_IN_GOMP_LOOP_END
:
2514 case BUILT_IN_GOMP_LOOP_END_CANCEL
:
2515 case BUILT_IN_GOMP_ORDERED_START
:
2516 case BUILT_IN_GOMP_ORDERED_END
:
2517 case BUILT_IN_GOMP_SECTIONS_END
:
2518 case BUILT_IN_GOMP_SECTIONS_END_CANCEL
:
2519 case BUILT_IN_GOMP_SINGLE_COPY_START
:
2520 case BUILT_IN_GOMP_SINGLE_COPY_END
:
2524 /* Fallthru to general call handling. */;
2527 /* Check if base is a global static variable that is not read
2529 if (callee
!= NULL_TREE
&& VAR_P (base
) && TREE_STATIC (base
))
2531 struct cgraph_node
*node
= cgraph_node::get (callee
);
2534 /* FIXME: Callee can be an OMP builtin that does not have a call graph
2535 node yet. We should enforce that there are nodes for all decls in the
2536 IL and remove this check instead. */
2538 && (not_read
= ipa_reference_get_not_read_global (node
))
2539 && bitmap_bit_p (not_read
, ipa_reference_var_uid (base
)))
2543 /* Check if the base variable is call-used. */
2546 if (pt_solution_includes (gimple_call_use_set (call
), base
))
2549 else if ((TREE_CODE (base
) == MEM_REF
2550 || TREE_CODE (base
) == TARGET_MEM_REF
)
2551 && TREE_CODE (TREE_OPERAND (base
, 0)) == SSA_NAME
)
2553 struct ptr_info_def
*pi
= SSA_NAME_PTR_INFO (TREE_OPERAND (base
, 0));
2557 if (pt_solutions_intersect (gimple_call_use_set (call
), &pi
->pt
))
2563 /* Inspect call arguments for passed-by-value aliases. */
2565 for (i
= 0; i
< gimple_call_num_args (call
); ++i
)
2567 tree op
= gimple_call_arg (call
, i
);
2568 int flags
= gimple_call_arg_flags (call
, i
);
2570 if (flags
& EAF_UNUSED
)
2573 if (TREE_CODE (op
) == WITH_SIZE_EXPR
)
2574 op
= TREE_OPERAND (op
, 0);
2576 if (TREE_CODE (op
) != SSA_NAME
2577 && !is_gimple_min_invariant (op
))
2580 ao_ref_init (&r
, op
);
2581 if (refs_may_alias_p_1 (&r
, ref
, tbaa_p
))
2590 ref_maybe_used_by_call_p (gcall
*call
, ao_ref
*ref
, bool tbaa_p
)
2593 res
= ref_maybe_used_by_call_p_1 (call
, ref
, tbaa_p
);
2595 ++alias_stats
.ref_maybe_used_by_call_p_may_alias
;
2597 ++alias_stats
.ref_maybe_used_by_call_p_no_alias
;
2602 /* If the statement STMT may use the memory reference REF return
2603 true, otherwise return false. */
2606 ref_maybe_used_by_stmt_p (gimple
*stmt
, ao_ref
*ref
, bool tbaa_p
)
2608 if (is_gimple_assign (stmt
))
2612 /* All memory assign statements are single. */
2613 if (!gimple_assign_single_p (stmt
))
2616 rhs
= gimple_assign_rhs1 (stmt
);
2617 if (is_gimple_reg (rhs
)
2618 || is_gimple_min_invariant (rhs
)
2619 || gimple_assign_rhs_code (stmt
) == CONSTRUCTOR
)
2622 return refs_may_alias_p (rhs
, ref
, tbaa_p
);
2624 else if (is_gimple_call (stmt
))
2625 return ref_maybe_used_by_call_p (as_a
<gcall
*> (stmt
), ref
, tbaa_p
);
2626 else if (greturn
*return_stmt
= dyn_cast
<greturn
*> (stmt
))
2628 tree retval
= gimple_return_retval (return_stmt
);
2630 && TREE_CODE (retval
) != SSA_NAME
2631 && !is_gimple_min_invariant (retval
)
2632 && refs_may_alias_p (retval
, ref
, tbaa_p
))
2634 /* If ref escapes the function then the return acts as a use. */
2635 tree base
= ao_ref_base (ref
);
2638 else if (DECL_P (base
))
2639 return is_global_var (base
);
2640 else if (TREE_CODE (base
) == MEM_REF
2641 || TREE_CODE (base
) == TARGET_MEM_REF
)
2642 return ptr_deref_may_alias_global_p (TREE_OPERAND (base
, 0));
2650 ref_maybe_used_by_stmt_p (gimple
*stmt
, tree ref
, bool tbaa_p
)
2653 ao_ref_init (&r
, ref
);
2654 return ref_maybe_used_by_stmt_p (stmt
, &r
, tbaa_p
);
2657 /* If the call in statement CALL may clobber the memory reference REF
2658 return true, otherwise return false. */
2661 call_may_clobber_ref_p_1 (gcall
*call
, ao_ref
*ref
)
2666 /* If the call is pure or const it cannot clobber anything. */
2667 if (gimple_call_flags (call
)
2668 & (ECF_PURE
|ECF_CONST
|ECF_LOOPING_CONST_OR_PURE
|ECF_NOVOPS
))
2670 if (gimple_call_internal_p (call
))
2671 switch (gimple_call_internal_fn (call
))
2673 /* Treat these internal calls like ECF_PURE for aliasing,
2674 they don't write to any memory the program should care about.
2675 They have important other side-effects, and read memory,
2676 so can't be ECF_NOVOPS. */
2677 case IFN_UBSAN_NULL
:
2678 case IFN_UBSAN_BOUNDS
:
2679 case IFN_UBSAN_VPTR
:
2680 case IFN_UBSAN_OBJECT_SIZE
:
2682 case IFN_ASAN_CHECK
:
2688 base
= ao_ref_base (ref
);
2692 if (TREE_CODE (base
) == SSA_NAME
2693 || CONSTANT_CLASS_P (base
))
2696 /* A call that is not without side-effects might involve volatile
2697 accesses and thus conflicts with all other volatile accesses. */
2698 if (ref
->volatile_p
)
2701 /* If the reference is based on a decl that is not aliased the call
2702 cannot possibly clobber it. */
2704 && !may_be_aliased (base
)
2705 /* But local non-readonly statics can be modified through recursion
2706 or the call may implement a threading barrier which we must
2707 treat as may-def. */
2708 && (TREE_READONLY (base
)
2709 || !is_global_var (base
)))
2712 /* If the reference is based on a pointer that points to memory
2713 that may not be written to then the call cannot possibly clobber it. */
2714 if ((TREE_CODE (base
) == MEM_REF
2715 || TREE_CODE (base
) == TARGET_MEM_REF
)
2716 && TREE_CODE (TREE_OPERAND (base
, 0)) == SSA_NAME
2717 && SSA_NAME_POINTS_TO_READONLY_MEMORY (TREE_OPERAND (base
, 0)))
2720 callee
= gimple_call_fndecl (call
);
2722 /* Handle those builtin functions explicitly that do not act as
2723 escape points. See tree-ssa-structalias.c:find_func_aliases
2724 for the list of builtins we might need to handle here. */
2725 if (callee
!= NULL_TREE
2726 && gimple_call_builtin_p (call
, BUILT_IN_NORMAL
))
2727 switch (DECL_FUNCTION_CODE (callee
))
2729 /* All the following functions clobber memory pointed to by
2730 their first argument. */
2731 case BUILT_IN_STRCPY
:
2732 case BUILT_IN_STRNCPY
:
2733 case BUILT_IN_MEMCPY
:
2734 case BUILT_IN_MEMMOVE
:
2735 case BUILT_IN_MEMPCPY
:
2736 case BUILT_IN_STPCPY
:
2737 case BUILT_IN_STPNCPY
:
2738 case BUILT_IN_STRCAT
:
2739 case BUILT_IN_STRNCAT
:
2740 case BUILT_IN_MEMSET
:
2741 case BUILT_IN_TM_MEMSET
:
2742 CASE_BUILT_IN_TM_STORE (1):
2743 CASE_BUILT_IN_TM_STORE (2):
2744 CASE_BUILT_IN_TM_STORE (4):
2745 CASE_BUILT_IN_TM_STORE (8):
2746 CASE_BUILT_IN_TM_STORE (FLOAT
):
2747 CASE_BUILT_IN_TM_STORE (DOUBLE
):
2748 CASE_BUILT_IN_TM_STORE (LDOUBLE
):
2749 CASE_BUILT_IN_TM_STORE (M64
):
2750 CASE_BUILT_IN_TM_STORE (M128
):
2751 CASE_BUILT_IN_TM_STORE (M256
):
2752 case BUILT_IN_TM_MEMCPY
:
2753 case BUILT_IN_TM_MEMMOVE
:
2756 tree size
= NULL_TREE
;
2757 /* Don't pass in size for strncat, as the maximum size
2758 is strlen (dest) + n + 1 instead of n, resp.
2759 n + 1 at dest + strlen (dest), but strlen (dest) isn't
2761 if (gimple_call_num_args (call
) == 3
2762 && DECL_FUNCTION_CODE (callee
) != BUILT_IN_STRNCAT
)
2763 size
= gimple_call_arg (call
, 2);
2764 ao_ref_init_from_ptr_and_size (&dref
,
2765 gimple_call_arg (call
, 0),
2767 return refs_may_alias_p_1 (&dref
, ref
, false);
2769 case BUILT_IN_STRCPY_CHK
:
2770 case BUILT_IN_STRNCPY_CHK
:
2771 case BUILT_IN_MEMCPY_CHK
:
2772 case BUILT_IN_MEMMOVE_CHK
:
2773 case BUILT_IN_MEMPCPY_CHK
:
2774 case BUILT_IN_STPCPY_CHK
:
2775 case BUILT_IN_STPNCPY_CHK
:
2776 case BUILT_IN_STRCAT_CHK
:
2777 case BUILT_IN_STRNCAT_CHK
:
2778 case BUILT_IN_MEMSET_CHK
:
2781 tree size
= NULL_TREE
;
2782 /* Don't pass in size for __strncat_chk, as the maximum size
2783 is strlen (dest) + n + 1 instead of n, resp.
2784 n + 1 at dest + strlen (dest), but strlen (dest) isn't
2786 if (gimple_call_num_args (call
) == 4
2787 && DECL_FUNCTION_CODE (callee
) != BUILT_IN_STRNCAT_CHK
)
2788 size
= gimple_call_arg (call
, 2);
2789 ao_ref_init_from_ptr_and_size (&dref
,
2790 gimple_call_arg (call
, 0),
2792 return refs_may_alias_p_1 (&dref
, ref
, false);
2794 case BUILT_IN_BCOPY
:
2797 tree size
= gimple_call_arg (call
, 2);
2798 ao_ref_init_from_ptr_and_size (&dref
,
2799 gimple_call_arg (call
, 1),
2801 return refs_may_alias_p_1 (&dref
, ref
, false);
2803 /* Allocating memory does not have any side-effects apart from
2804 being the definition point for the pointer. */
2805 case BUILT_IN_MALLOC
:
2806 case BUILT_IN_ALIGNED_ALLOC
:
2807 case BUILT_IN_CALLOC
:
2808 case BUILT_IN_STRDUP
:
2809 case BUILT_IN_STRNDUP
:
2810 /* Unix98 specifies that errno is set on allocation failure. */
2812 && targetm
.ref_may_alias_errno (ref
))
2815 case BUILT_IN_STACK_SAVE
:
2816 CASE_BUILT_IN_ALLOCA
:
2817 case BUILT_IN_ASSUME_ALIGNED
:
2819 /* But posix_memalign stores a pointer into the memory pointed to
2820 by its first argument. */
2821 case BUILT_IN_POSIX_MEMALIGN
:
2823 tree ptrptr
= gimple_call_arg (call
, 0);
2825 ao_ref_init_from_ptr_and_size (&dref
, ptrptr
,
2826 TYPE_SIZE_UNIT (ptr_type_node
));
2827 return (refs_may_alias_p_1 (&dref
, ref
, false)
2829 && targetm
.ref_may_alias_errno (ref
)));
2831 /* Freeing memory kills the pointed-to memory. More importantly
2832 the call has to serve as a barrier for moving loads and stores
2835 case BUILT_IN_VA_END
:
2837 tree ptr
= gimple_call_arg (call
, 0);
2838 return ptr_deref_may_alias_ref_p_1 (ptr
, ref
);
2840 /* Realloc serves both as allocation point and deallocation point. */
2841 case BUILT_IN_REALLOC
:
2843 tree ptr
= gimple_call_arg (call
, 0);
2844 /* Unix98 specifies that errno is set on allocation failure. */
2845 return ((flag_errno_math
2846 && targetm
.ref_may_alias_errno (ref
))
2847 || ptr_deref_may_alias_ref_p_1 (ptr
, ref
));
2849 case BUILT_IN_GAMMA_R
:
2850 case BUILT_IN_GAMMAF_R
:
2851 case BUILT_IN_GAMMAL_R
:
2852 case BUILT_IN_LGAMMA_R
:
2853 case BUILT_IN_LGAMMAF_R
:
2854 case BUILT_IN_LGAMMAL_R
:
2856 tree out
= gimple_call_arg (call
, 1);
2857 if (ptr_deref_may_alias_ref_p_1 (out
, ref
))
2859 if (flag_errno_math
)
2863 case BUILT_IN_FREXP
:
2864 case BUILT_IN_FREXPF
:
2865 case BUILT_IN_FREXPL
:
2867 case BUILT_IN_MODFF
:
2868 case BUILT_IN_MODFL
:
2870 tree out
= gimple_call_arg (call
, 1);
2871 return ptr_deref_may_alias_ref_p_1 (out
, ref
);
2873 case BUILT_IN_REMQUO
:
2874 case BUILT_IN_REMQUOF
:
2875 case BUILT_IN_REMQUOL
:
2877 tree out
= gimple_call_arg (call
, 2);
2878 if (ptr_deref_may_alias_ref_p_1 (out
, ref
))
2880 if (flag_errno_math
)
2884 case BUILT_IN_SINCOS
:
2885 case BUILT_IN_SINCOSF
:
2886 case BUILT_IN_SINCOSL
:
2888 tree sin
= gimple_call_arg (call
, 1);
2889 tree cos
= gimple_call_arg (call
, 2);
2890 return (ptr_deref_may_alias_ref_p_1 (sin
, ref
)
2891 || ptr_deref_may_alias_ref_p_1 (cos
, ref
));
2893 /* __sync_* builtins and some OpenMP builtins act as threading
2895 #undef DEF_SYNC_BUILTIN
2896 #define DEF_SYNC_BUILTIN(ENUM, NAME, TYPE, ATTRS) case ENUM:
2897 #include "sync-builtins.def"
2898 #undef DEF_SYNC_BUILTIN
2899 case BUILT_IN_GOMP_ATOMIC_START
:
2900 case BUILT_IN_GOMP_ATOMIC_END
:
2901 case BUILT_IN_GOMP_BARRIER
:
2902 case BUILT_IN_GOMP_BARRIER_CANCEL
:
2903 case BUILT_IN_GOMP_TASKWAIT
:
2904 case BUILT_IN_GOMP_TASKGROUP_END
:
2905 case BUILT_IN_GOMP_CRITICAL_START
:
2906 case BUILT_IN_GOMP_CRITICAL_END
:
2907 case BUILT_IN_GOMP_CRITICAL_NAME_START
:
2908 case BUILT_IN_GOMP_CRITICAL_NAME_END
:
2909 case BUILT_IN_GOMP_LOOP_END
:
2910 case BUILT_IN_GOMP_LOOP_END_CANCEL
:
2911 case BUILT_IN_GOMP_ORDERED_START
:
2912 case BUILT_IN_GOMP_ORDERED_END
:
2913 case BUILT_IN_GOMP_SECTIONS_END
:
2914 case BUILT_IN_GOMP_SECTIONS_END_CANCEL
:
2915 case BUILT_IN_GOMP_SINGLE_COPY_START
:
2916 case BUILT_IN_GOMP_SINGLE_COPY_END
:
2919 /* Fallthru to general call handling. */;
2922 /* Check if base is a global static variable that is not written
2924 if (callee
!= NULL_TREE
&& VAR_P (base
) && TREE_STATIC (base
))
2926 struct cgraph_node
*node
= cgraph_node::get (callee
);
2930 && (not_written
= ipa_reference_get_not_written_global (node
))
2931 && bitmap_bit_p (not_written
, ipa_reference_var_uid (base
)))
2935 /* Check if the base variable is call-clobbered. */
2937 return pt_solution_includes (gimple_call_clobber_set (call
), base
);
2938 else if ((TREE_CODE (base
) == MEM_REF
2939 || TREE_CODE (base
) == TARGET_MEM_REF
)
2940 && TREE_CODE (TREE_OPERAND (base
, 0)) == SSA_NAME
)
2942 struct ptr_info_def
*pi
= SSA_NAME_PTR_INFO (TREE_OPERAND (base
, 0));
2946 return pt_solutions_intersect (gimple_call_clobber_set (call
), &pi
->pt
);
2952 /* If the call in statement CALL may clobber the memory reference REF
2953 return true, otherwise return false. */
2956 call_may_clobber_ref_p (gcall
*call
, tree ref
)
2960 ao_ref_init (&r
, ref
);
2961 res
= call_may_clobber_ref_p_1 (call
, &r
);
2963 ++alias_stats
.call_may_clobber_ref_p_may_alias
;
2965 ++alias_stats
.call_may_clobber_ref_p_no_alias
;
2970 /* If the statement STMT may clobber the memory reference REF return true,
2971 otherwise return false. */
2974 stmt_may_clobber_ref_p_1 (gimple
*stmt
, ao_ref
*ref
, bool tbaa_p
)
2976 if (is_gimple_call (stmt
))
2978 tree lhs
= gimple_call_lhs (stmt
);
2980 && TREE_CODE (lhs
) != SSA_NAME
)
2983 ao_ref_init (&r
, lhs
);
2984 if (refs_may_alias_p_1 (ref
, &r
, tbaa_p
))
2988 return call_may_clobber_ref_p_1 (as_a
<gcall
*> (stmt
), ref
);
2990 else if (gimple_assign_single_p (stmt
))
2992 tree lhs
= gimple_assign_lhs (stmt
);
2993 if (TREE_CODE (lhs
) != SSA_NAME
)
2996 ao_ref_init (&r
, lhs
);
2997 return refs_may_alias_p_1 (ref
, &r
, tbaa_p
);
3000 else if (gimple_code (stmt
) == GIMPLE_ASM
)
3007 stmt_may_clobber_ref_p (gimple
*stmt
, tree ref
, bool tbaa_p
)
3010 ao_ref_init (&r
, ref
);
3011 return stmt_may_clobber_ref_p_1 (stmt
, &r
, tbaa_p
);
3014 /* Return true if store1 and store2 described by corresponding tuples
3015 <BASE, OFFSET, SIZE, MAX_SIZE> have the same size and store to the same
3019 same_addr_size_stores_p (tree base1
, poly_int64 offset1
, poly_int64 size1
,
3020 poly_int64 max_size1
,
3021 tree base2
, poly_int64 offset2
, poly_int64 size2
,
3022 poly_int64 max_size2
)
3024 /* Offsets need to be 0. */
3025 if (maybe_ne (offset1
, 0)
3026 || maybe_ne (offset2
, 0))
3029 bool base1_obj_p
= SSA_VAR_P (base1
);
3030 bool base2_obj_p
= SSA_VAR_P (base2
);
3032 /* We need one object. */
3033 if (base1_obj_p
== base2_obj_p
)
3035 tree obj
= base1_obj_p
? base1
: base2
;
3037 /* And we need one MEM_REF. */
3038 bool base1_memref_p
= TREE_CODE (base1
) == MEM_REF
;
3039 bool base2_memref_p
= TREE_CODE (base2
) == MEM_REF
;
3040 if (base1_memref_p
== base2_memref_p
)
3042 tree memref
= base1_memref_p
? base1
: base2
;
3044 /* Sizes need to be valid. */
3045 if (!known_size_p (max_size1
)
3046 || !known_size_p (max_size2
)
3047 || !known_size_p (size1
)
3048 || !known_size_p (size2
))
3051 /* Max_size needs to match size. */
3052 if (maybe_ne (max_size1
, size1
)
3053 || maybe_ne (max_size2
, size2
))
3056 /* Sizes need to match. */
3057 if (maybe_ne (size1
, size2
))
3061 /* Check that memref is a store to pointer with singleton points-to info. */
3062 if (!integer_zerop (TREE_OPERAND (memref
, 1)))
3064 tree ptr
= TREE_OPERAND (memref
, 0);
3065 if (TREE_CODE (ptr
) != SSA_NAME
)
3067 struct ptr_info_def
*pi
= SSA_NAME_PTR_INFO (ptr
);
3068 unsigned int pt_uid
;
3070 || !pt_solution_singleton_or_null_p (&pi
->pt
, &pt_uid
))
3073 /* Be conservative with non-call exceptions when the address might
3075 if (cfun
->can_throw_non_call_exceptions
&& pi
->pt
.null
)
3078 /* Check that ptr points relative to obj. */
3079 unsigned int obj_uid
= DECL_PT_UID (obj
);
3080 if (obj_uid
!= pt_uid
)
3083 /* Check that the object size is the same as the store size. That ensures us
3084 that ptr points to the start of obj. */
3085 return (DECL_SIZE (obj
)
3086 && poly_int_tree_p (DECL_SIZE (obj
))
3087 && known_eq (wi::to_poly_offset (DECL_SIZE (obj
)), size1
));
3090 /* If STMT kills the memory reference REF return true, otherwise
3094 stmt_kills_ref_p (gimple
*stmt
, ao_ref
*ref
)
3096 if (!ao_ref_base (ref
))
3099 if (gimple_has_lhs (stmt
)
3100 && TREE_CODE (gimple_get_lhs (stmt
)) != SSA_NAME
3101 /* The assignment is not necessarily carried out if it can throw
3102 and we can catch it in the current function where we could inspect
3104 ??? We only need to care about the RHS throwing. For aggregate
3105 assignments or similar calls and non-call exceptions the LHS
3106 might throw as well. */
3107 && !stmt_can_throw_internal (cfun
, stmt
))
3109 tree lhs
= gimple_get_lhs (stmt
);
3110 /* If LHS is literally a base of the access we are done. */
3113 tree base
= ref
->ref
;
3114 tree innermost_dropped_array_ref
= NULL_TREE
;
3115 if (handled_component_p (base
))
3117 tree saved_lhs0
= NULL_TREE
;
3118 if (handled_component_p (lhs
))
3120 saved_lhs0
= TREE_OPERAND (lhs
, 0);
3121 TREE_OPERAND (lhs
, 0) = integer_zero_node
;
3125 /* Just compare the outermost handled component, if
3126 they are equal we have found a possible common
3128 tree saved_base0
= TREE_OPERAND (base
, 0);
3129 TREE_OPERAND (base
, 0) = integer_zero_node
;
3130 bool res
= operand_equal_p (lhs
, base
, 0);
3131 TREE_OPERAND (base
, 0) = saved_base0
;
3134 /* Remember if we drop an array-ref that we need to
3135 double-check not being at struct end. */
3136 if (TREE_CODE (base
) == ARRAY_REF
3137 || TREE_CODE (base
) == ARRAY_RANGE_REF
)
3138 innermost_dropped_array_ref
= base
;
3139 /* Otherwise drop handled components of the access. */
3142 while (handled_component_p (base
));
3144 TREE_OPERAND (lhs
, 0) = saved_lhs0
;
3146 /* Finally check if the lhs has the same address and size as the
3147 base candidate of the access. Watch out if we have dropped
3148 an array-ref that was at struct end, this means ref->ref may
3149 be outside of the TYPE_SIZE of its base. */
3150 if ((! innermost_dropped_array_ref
3151 || ! array_at_struct_end_p (innermost_dropped_array_ref
))
3153 || (((TYPE_SIZE (TREE_TYPE (lhs
))
3154 == TYPE_SIZE (TREE_TYPE (base
)))
3155 || (TYPE_SIZE (TREE_TYPE (lhs
))
3156 && TYPE_SIZE (TREE_TYPE (base
))
3157 && operand_equal_p (TYPE_SIZE (TREE_TYPE (lhs
)),
3158 TYPE_SIZE (TREE_TYPE (base
)),
3160 && operand_equal_p (lhs
, base
,
3162 | OEP_MATCH_SIDE_EFFECTS
))))
3166 /* Now look for non-literal equal bases with the restriction of
3167 handling constant offset and size. */
3168 /* For a must-alias check we need to be able to constrain
3169 the access properly. */
3170 if (!ref
->max_size_known_p ())
3172 poly_int64 size
, offset
, max_size
, ref_offset
= ref
->offset
;
3174 tree base
= get_ref_base_and_extent (lhs
, &offset
, &size
, &max_size
,
3176 /* We can get MEM[symbol: sZ, index: D.8862_1] here,
3177 so base == ref->base does not always hold. */
3178 if (base
!= ref
->base
)
3180 /* Try using points-to info. */
3181 if (same_addr_size_stores_p (base
, offset
, size
, max_size
, ref
->base
,
3182 ref
->offset
, ref
->size
, ref
->max_size
))
3185 /* If both base and ref->base are MEM_REFs, only compare the
3186 first operand, and if the second operand isn't equal constant,
3187 try to add the offsets into offset and ref_offset. */
3188 if (TREE_CODE (base
) == MEM_REF
&& TREE_CODE (ref
->base
) == MEM_REF
3189 && TREE_OPERAND (base
, 0) == TREE_OPERAND (ref
->base
, 0))
3191 if (!tree_int_cst_equal (TREE_OPERAND (base
, 1),
3192 TREE_OPERAND (ref
->base
, 1)))
3194 poly_offset_int off1
= mem_ref_offset (base
);
3195 off1
<<= LOG2_BITS_PER_UNIT
;
3197 poly_offset_int off2
= mem_ref_offset (ref
->base
);
3198 off2
<<= LOG2_BITS_PER_UNIT
;
3200 if (!off1
.to_shwi (&offset
) || !off2
.to_shwi (&ref_offset
))
3207 /* For a must-alias check we need to be able to constrain
3208 the access properly. */
3209 if (known_eq (size
, max_size
)
3210 && known_subrange_p (ref_offset
, ref
->max_size
, offset
, size
))
3214 if (is_gimple_call (stmt
))
3216 tree callee
= gimple_call_fndecl (stmt
);
3217 if (callee
!= NULL_TREE
3218 && gimple_call_builtin_p (stmt
, BUILT_IN_NORMAL
))
3219 switch (DECL_FUNCTION_CODE (callee
))
3223 tree ptr
= gimple_call_arg (stmt
, 0);
3224 tree base
= ao_ref_base (ref
);
3225 if (base
&& TREE_CODE (base
) == MEM_REF
3226 && TREE_OPERAND (base
, 0) == ptr
)
3231 case BUILT_IN_MEMCPY
:
3232 case BUILT_IN_MEMPCPY
:
3233 case BUILT_IN_MEMMOVE
:
3234 case BUILT_IN_MEMSET
:
3235 case BUILT_IN_MEMCPY_CHK
:
3236 case BUILT_IN_MEMPCPY_CHK
:
3237 case BUILT_IN_MEMMOVE_CHK
:
3238 case BUILT_IN_MEMSET_CHK
:
3239 case BUILT_IN_STRNCPY
:
3240 case BUILT_IN_STPNCPY
:
3241 case BUILT_IN_CALLOC
:
3243 /* For a must-alias check we need to be able to constrain
3244 the access properly. */
3245 if (!ref
->max_size_known_p ())
3250 /* In execution order a calloc call will never kill
3251 anything. However, DSE will (ab)use this interface
3252 to ask if a calloc call writes the same memory locations
3253 as a later assignment, memset, etc. So handle calloc
3254 in the expected way. */
3255 if (DECL_FUNCTION_CODE (callee
) == BUILT_IN_CALLOC
)
3257 tree arg0
= gimple_call_arg (stmt
, 0);
3258 tree arg1
= gimple_call_arg (stmt
, 1);
3259 if (TREE_CODE (arg0
) != INTEGER_CST
3260 || TREE_CODE (arg1
) != INTEGER_CST
)
3263 dest
= gimple_call_lhs (stmt
);
3264 len
= fold_build2 (MULT_EXPR
, TREE_TYPE (arg0
), arg0
, arg1
);
3268 dest
= gimple_call_arg (stmt
, 0);
3269 len
= gimple_call_arg (stmt
, 2);
3271 if (!poly_int_tree_p (len
))
3273 tree rbase
= ref
->base
;
3274 poly_offset_int roffset
= ref
->offset
;
3276 ao_ref_init_from_ptr_and_size (&dref
, dest
, len
);
3277 tree base
= ao_ref_base (&dref
);
3278 poly_offset_int offset
= dref
.offset
;
3279 if (!base
|| !known_size_p (dref
.size
))
3281 if (TREE_CODE (base
) == MEM_REF
)
3283 if (TREE_CODE (rbase
) != MEM_REF
)
3285 // Compare pointers.
3286 offset
+= mem_ref_offset (base
) << LOG2_BITS_PER_UNIT
;
3287 roffset
+= mem_ref_offset (rbase
) << LOG2_BITS_PER_UNIT
;
3288 base
= TREE_OPERAND (base
, 0);
3289 rbase
= TREE_OPERAND (rbase
, 0);
3292 && known_subrange_p (roffset
, ref
->max_size
, offset
,
3293 wi::to_poly_offset (len
)
3294 << LOG2_BITS_PER_UNIT
))
3299 case BUILT_IN_VA_END
:
3301 tree ptr
= gimple_call_arg (stmt
, 0);
3302 if (TREE_CODE (ptr
) == ADDR_EXPR
)
3304 tree base
= ao_ref_base (ref
);
3305 if (TREE_OPERAND (ptr
, 0) == base
)
3318 stmt_kills_ref_p (gimple
*stmt
, tree ref
)
3321 ao_ref_init (&r
, ref
);
3322 return stmt_kills_ref_p (stmt
, &r
);
3326 /* Walk the virtual use-def chain of VUSE until hitting the virtual operand
3327 TARGET or a statement clobbering the memory reference REF in which
3328 case false is returned. The walk starts with VUSE, one argument of PHI. */
3331 maybe_skip_until (gimple
*phi
, tree
&target
, basic_block target_bb
,
3332 ao_ref
*ref
, tree vuse
, bool tbaa_p
, unsigned int &limit
,
3333 bitmap
*visited
, bool abort_on_visited
,
3334 void *(*translate
)(ao_ref
*, tree
, void *, translate_flags
*),
3335 translate_flags disambiguate_only
,
3338 basic_block bb
= gimple_bb (phi
);
3341 *visited
= BITMAP_ALLOC (NULL
);
3343 bitmap_set_bit (*visited
, SSA_NAME_VERSION (PHI_RESULT (phi
)));
3345 /* Walk until we hit the target. */
3346 while (vuse
!= target
)
3348 gimple
*def_stmt
= SSA_NAME_DEF_STMT (vuse
);
3349 /* If we are searching for the target VUSE by walking up to
3350 TARGET_BB dominating the original PHI we are finished once
3351 we reach a default def or a definition in a block dominating
3352 that block. Update TARGET and return. */
3354 && (gimple_nop_p (def_stmt
)
3355 || dominated_by_p (CDI_DOMINATORS
,
3356 target_bb
, gimple_bb (def_stmt
))))
3362 /* Recurse for PHI nodes. */
3363 if (gimple_code (def_stmt
) == GIMPLE_PHI
)
3365 /* An already visited PHI node ends the walk successfully. */
3366 if (bitmap_bit_p (*visited
, SSA_NAME_VERSION (PHI_RESULT (def_stmt
))))
3367 return !abort_on_visited
;
3368 vuse
= get_continuation_for_phi (def_stmt
, ref
, tbaa_p
, limit
,
3369 visited
, abort_on_visited
,
3370 translate
, data
, disambiguate_only
);
3375 else if (gimple_nop_p (def_stmt
))
3379 /* A clobbering statement or the end of the IL ends it failing. */
3380 if ((int)limit
<= 0)
3383 if (stmt_may_clobber_ref_p_1 (def_stmt
, ref
, tbaa_p
))
3385 translate_flags tf
= disambiguate_only
;
3387 && (*translate
) (ref
, vuse
, data
, &tf
) == NULL
)
3393 /* If we reach a new basic-block see if we already skipped it
3394 in a previous walk that ended successfully. */
3395 if (gimple_bb (def_stmt
) != bb
)
3397 if (!bitmap_set_bit (*visited
, SSA_NAME_VERSION (vuse
)))
3398 return !abort_on_visited
;
3399 bb
= gimple_bb (def_stmt
);
3401 vuse
= gimple_vuse (def_stmt
);
3407 /* Starting from a PHI node for the virtual operand of the memory reference
3408 REF find a continuation virtual operand that allows to continue walking
3409 statements dominating PHI skipping only statements that cannot possibly
3410 clobber REF. Decrements LIMIT for each alias disambiguation done
3411 and aborts the walk, returning NULL_TREE if it reaches zero.
3412 Returns NULL_TREE if no suitable virtual operand can be found. */
3415 get_continuation_for_phi (gimple
*phi
, ao_ref
*ref
, bool tbaa_p
,
3416 unsigned int &limit
, bitmap
*visited
,
3417 bool abort_on_visited
,
3418 void *(*translate
)(ao_ref
*, tree
, void *,
3421 translate_flags disambiguate_only
)
3423 unsigned nargs
= gimple_phi_num_args (phi
);
3425 /* Through a single-argument PHI we can simply look through. */
3427 return PHI_ARG_DEF (phi
, 0);
3429 /* For two or more arguments try to pairwise skip non-aliasing code
3430 until we hit the phi argument definition that dominates the other one. */
3431 basic_block phi_bb
= gimple_bb (phi
);
3435 /* Find a candidate for the virtual operand which definition
3436 dominates those of all others. */
3437 /* First look if any of the args themselves satisfy this. */
3438 for (i
= 0; i
< nargs
; ++i
)
3440 arg0
= PHI_ARG_DEF (phi
, i
);
3441 if (SSA_NAME_IS_DEFAULT_DEF (arg0
))
3443 basic_block def_bb
= gimple_bb (SSA_NAME_DEF_STMT (arg0
));
3444 if (def_bb
!= phi_bb
3445 && dominated_by_p (CDI_DOMINATORS
, phi_bb
, def_bb
))
3449 /* If not, look if we can reach such candidate by walking defs
3450 until we hit the immediate dominator. maybe_skip_until will
3452 basic_block dom
= get_immediate_dominator (CDI_DOMINATORS
, phi_bb
);
3454 /* Then check against the (to be) found candidate. */
3455 for (i
= 0; i
< nargs
; ++i
)
3457 arg1
= PHI_ARG_DEF (phi
, i
);
3460 else if (! maybe_skip_until (phi
, arg0
, dom
, ref
, arg1
, tbaa_p
,
3464 /* Do not valueize when walking over
3468 gimple_bb (SSA_NAME_DEF_STMT (arg1
)),
3471 : disambiguate_only
, data
))
3478 /* Based on the memory reference REF and its virtual use VUSE call
3479 WALKER for each virtual use that is equivalent to VUSE, including VUSE
3480 itself. That is, for each virtual use for which its defining statement
3481 does not clobber REF.
3483 WALKER is called with REF, the current virtual use and DATA. If
3484 WALKER returns non-NULL the walk stops and its result is returned.
3485 At the end of a non-successful walk NULL is returned.
3487 TRANSLATE if non-NULL is called with a pointer to REF, the virtual
3488 use which definition is a statement that may clobber REF and DATA.
3489 If TRANSLATE returns (void *)-1 the walk stops and NULL is returned.
3490 If TRANSLATE returns non-NULL the walk stops and its result is returned.
3491 If TRANSLATE returns NULL the walk continues and TRANSLATE is supposed
3492 to adjust REF and *DATA to make that valid.
3494 VALUEIZE if non-NULL is called with the next VUSE that is considered
3495 and return value is substituted for that. This can be used to
3496 implement optimistic value-numbering for example. Note that the
3497 VUSE argument is assumed to be valueized already.
3499 LIMIT specifies the number of alias queries we are allowed to do,
3500 the walk stops when it reaches zero and NULL is returned. LIMIT
3501 is decremented by the number of alias queries (plus adjustments
3502 done by the callbacks) upon return.
3504 TODO: Cache the vector of equivalent vuses per ref, vuse pair. */
3507 walk_non_aliased_vuses (ao_ref
*ref
, tree vuse
, bool tbaa_p
,
3508 void *(*walker
)(ao_ref
*, tree
, void *),
3509 void *(*translate
)(ao_ref
*, tree
, void *,
3511 tree (*valueize
)(tree
),
3512 unsigned &limit
, void *data
)
3514 bitmap visited
= NULL
;
3516 bool translated
= false;
3518 timevar_push (TV_ALIAS_STMT_WALK
);
3524 /* ??? Do we want to account this to TV_ALIAS_STMT_WALK? */
3525 res
= (*walker
) (ref
, vuse
, data
);
3527 if (res
== (void *)-1)
3532 /* Lookup succeeded. */
3533 else if (res
!= NULL
)
3538 vuse
= valueize (vuse
);
3545 def_stmt
= SSA_NAME_DEF_STMT (vuse
);
3546 if (gimple_nop_p (def_stmt
))
3548 else if (gimple_code (def_stmt
) == GIMPLE_PHI
)
3549 vuse
= get_continuation_for_phi (def_stmt
, ref
, tbaa_p
, limit
,
3550 &visited
, translated
, translate
, data
);
3553 if ((int)limit
<= 0)
3559 if (stmt_may_clobber_ref_p_1 (def_stmt
, ref
, tbaa_p
))
3563 translate_flags disambiguate_only
= TR_TRANSLATE
;
3564 res
= (*translate
) (ref
, vuse
, data
, &disambiguate_only
);
3565 /* Failed lookup and translation. */
3566 if (res
== (void *)-1)
3571 /* Lookup succeeded. */
3572 else if (res
!= NULL
)
3574 /* Translation succeeded, continue walking. */
3575 translated
= translated
|| disambiguate_only
== TR_TRANSLATE
;
3577 vuse
= gimple_vuse (def_stmt
);
3583 BITMAP_FREE (visited
);
3585 timevar_pop (TV_ALIAS_STMT_WALK
);
3591 /* Based on the memory reference REF call WALKER for each vdef which
3592 defining statement may clobber REF, starting with VDEF. If REF
3593 is NULL_TREE, each defining statement is visited.
3595 WALKER is called with REF, the current vdef and DATA. If WALKER
3596 returns true the walk is stopped, otherwise it continues.
3598 If function entry is reached, FUNCTION_ENTRY_REACHED is set to true.
3599 The pointer may be NULL and then we do not track this information.
3601 At PHI nodes walk_aliased_vdefs forks into one walk for reach
3602 PHI argument (but only one walk continues on merge points), the
3603 return value is true if any of the walks was successful.
3605 The function returns the number of statements walked or -1 if
3606 LIMIT stmts were walked and the walk was aborted at this point.
3607 If LIMIT is zero the walk is not aborted. */
3610 walk_aliased_vdefs_1 (ao_ref
*ref
, tree vdef
,
3611 bool (*walker
)(ao_ref
*, tree
, void *), void *data
,
3612 bitmap
*visited
, unsigned int cnt
,
3613 bool *function_entry_reached
, unsigned limit
)
3617 gimple
*def_stmt
= SSA_NAME_DEF_STMT (vdef
);
3620 && !bitmap_set_bit (*visited
, SSA_NAME_VERSION (vdef
)))
3623 if (gimple_nop_p (def_stmt
))
3625 if (function_entry_reached
)
3626 *function_entry_reached
= true;
3629 else if (gimple_code (def_stmt
) == GIMPLE_PHI
)
3633 *visited
= BITMAP_ALLOC (NULL
);
3634 for (i
= 0; i
< gimple_phi_num_args (def_stmt
); ++i
)
3636 int res
= walk_aliased_vdefs_1 (ref
,
3637 gimple_phi_arg_def (def_stmt
, i
),
3638 walker
, data
, visited
, cnt
,
3639 function_entry_reached
, limit
);
3647 /* ??? Do we want to account this to TV_ALIAS_STMT_WALK? */
3652 || stmt_may_clobber_ref_p_1 (def_stmt
, ref
))
3653 && (*walker
) (ref
, vdef
, data
))
3656 vdef
= gimple_vuse (def_stmt
);
3662 walk_aliased_vdefs (ao_ref
*ref
, tree vdef
,
3663 bool (*walker
)(ao_ref
*, tree
, void *), void *data
,
3665 bool *function_entry_reached
, unsigned int limit
)
3667 bitmap local_visited
= NULL
;
3670 timevar_push (TV_ALIAS_STMT_WALK
);
3672 if (function_entry_reached
)
3673 *function_entry_reached
= false;
3675 ret
= walk_aliased_vdefs_1 (ref
, vdef
, walker
, data
,
3676 visited
? visited
: &local_visited
, 0,
3677 function_entry_reached
, limit
);
3679 BITMAP_FREE (local_visited
);
3681 timevar_pop (TV_ALIAS_STMT_WALK
);