1 /* Alias analysis for trees.
2 Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009
3 Free Software Foundation, Inc.
4 Contributed by Diego Novillo <dnovillo@redhat.com>
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 3, or (at your option)
13 GCC is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
24 #include "coretypes.h"
29 #include "hard-reg-set.h"
30 #include "basic-block.h"
34 #include "langhooks.h"
37 #include "diagnostic.h"
38 #include "tree-dump.h"
40 #include "tree-flow.h"
41 #include "tree-inline.h"
42 #include "tree-pass.h"
45 #include "ipa-type-escape.h"
49 #include "pointer-set.h"
50 #include "alloc-pool.h"
51 #include "tree-ssa-alias.h"
53 /* Broad overview of how alias analysis on gimple works:
55 Statements clobbering or using memory are linked through the
56 virtual operand factored use-def chain. The virtual operand
57 is unique per function, its symbol is accessible via gimple_vop (cfun).
58 Virtual operands are used for efficiently walking memory statements
59 in the gimple IL and are useful for things like value-numbering as
60 a generation count for memory references.
62 SSA_NAME pointers may have associated points-to information
63 accessible via the SSA_NAME_PTR_INFO macro. Flow-insensitive
64 points-to information is (re-)computed by the TODO_rebuild_alias
65 pass manager todo. Points-to information is also used for more
66 precise tracking of call-clobbered and call-used variables and
67 related disambiguations.
69 This file contains functions for disambiguating memory references,
70 the so called alias-oracle and tools for walking of the gimple IL.
72 The main alias-oracle entry-points are
74 bool stmt_may_clobber_ref_p (gimple, tree)
76 This function queries if a statement may invalidate (parts of)
77 the memory designated by the reference tree argument.
79 bool ref_maybe_used_by_stmt_p (gimple, tree)
81 This function queries if a statement may need (parts of) the
82 memory designated by the reference tree argument.
84 There are variants of these functions that only handle the call
85 part of a statement, call_may_clobber_ref_p and ref_maybe_used_by_call_p.
86 Note that these do not disambiguate against a possible call lhs.
88 bool refs_may_alias_p (tree, tree)
90 This function tries to disambiguate two reference trees.
92 bool ptr_deref_may_alias_global_p (tree)
94 This function queries if dereferencing a pointer variable may
97 More low-level disambiguators are available and documented in
98 this file. Low-level disambiguators dealing with points-to
99 information are in tree-ssa-structalias.c. */
102 /* Query statistics for the different low-level disambiguators.
103 A high-level query may trigger multiple of them. */
106 unsigned HOST_WIDE_INT refs_may_alias_p_may_alias
;
107 unsigned HOST_WIDE_INT refs_may_alias_p_no_alias
;
108 unsigned HOST_WIDE_INT ref_maybe_used_by_call_p_may_alias
;
109 unsigned HOST_WIDE_INT ref_maybe_used_by_call_p_no_alias
;
110 unsigned HOST_WIDE_INT call_may_clobber_ref_p_may_alias
;
111 unsigned HOST_WIDE_INT call_may_clobber_ref_p_no_alias
;
115 dump_alias_stats (FILE *s
)
117 fprintf (s
, "\nAlias oracle query stats:\n");
118 fprintf (s
, " refs_may_alias_p: "
119 HOST_WIDE_INT_PRINT_DEC
" disambiguations, "
120 HOST_WIDE_INT_PRINT_DEC
" queries\n",
121 alias_stats
.refs_may_alias_p_no_alias
,
122 alias_stats
.refs_may_alias_p_no_alias
123 + alias_stats
.refs_may_alias_p_may_alias
);
124 fprintf (s
, " ref_maybe_used_by_call_p: "
125 HOST_WIDE_INT_PRINT_DEC
" disambiguations, "
126 HOST_WIDE_INT_PRINT_DEC
" queries\n",
127 alias_stats
.ref_maybe_used_by_call_p_no_alias
,
128 alias_stats
.refs_may_alias_p_no_alias
129 + alias_stats
.ref_maybe_used_by_call_p_may_alias
);
130 fprintf (s
, " call_may_clobber_ref_p: "
131 HOST_WIDE_INT_PRINT_DEC
" disambiguations, "
132 HOST_WIDE_INT_PRINT_DEC
" queries\n",
133 alias_stats
.call_may_clobber_ref_p_no_alias
,
134 alias_stats
.call_may_clobber_ref_p_no_alias
135 + alias_stats
.call_may_clobber_ref_p_may_alias
);
139 /* Return true, if dereferencing PTR may alias with a global variable. */
142 ptr_deref_may_alias_global_p (tree ptr
)
144 struct ptr_info_def
*pi
;
146 /* If we end up with a pointer constant here that may point
148 if (TREE_CODE (ptr
) != SSA_NAME
)
151 pi
= SSA_NAME_PTR_INFO (ptr
);
153 /* If we do not have points-to information for this variable,
158 /* ??? This does not use TBAA to prune globals ptr may not access. */
159 return pt_solution_includes_global (&pi
->pt
);
162 /* Return true if dereferencing PTR may alias DECL.
163 The caller is responsible for applying TBAA to see if PTR
164 may access DECL at all. */
167 ptr_deref_may_alias_decl_p (tree ptr
, tree decl
)
169 struct ptr_info_def
*pi
;
171 gcc_assert ((TREE_CODE (ptr
) == SSA_NAME
172 || TREE_CODE (ptr
) == ADDR_EXPR
173 || TREE_CODE (ptr
) == INTEGER_CST
)
174 && (TREE_CODE (decl
) == VAR_DECL
175 || TREE_CODE (decl
) == PARM_DECL
176 || TREE_CODE (decl
) == RESULT_DECL
));
178 /* Non-aliased variables can not be pointed to. */
179 if (!may_be_aliased (decl
))
182 /* ADDR_EXPR pointers either just offset another pointer or directly
183 specify the pointed-to set. */
184 if (TREE_CODE (ptr
) == ADDR_EXPR
)
186 tree base
= get_base_address (TREE_OPERAND (ptr
, 0));
188 && INDIRECT_REF_P (base
))
189 ptr
= TREE_OPERAND (base
, 0);
192 return operand_equal_p (base
, decl
, 0);
194 && CONSTANT_CLASS_P (base
))
200 /* We can end up with dereferencing constant pointers.
201 Just bail out in this case. */
202 if (TREE_CODE (ptr
) == INTEGER_CST
)
205 /* If we do not have useful points-to information for this pointer
206 we cannot disambiguate anything else. */
207 pi
= SSA_NAME_PTR_INFO (ptr
);
211 /* If the decl can be used as a restrict tag and we have a restrict
212 pointer and that pointers points-to set doesn't contain this decl
213 then they can't alias. */
214 if (DECL_RESTRICTED_P (decl
)
215 && TYPE_RESTRICT (TREE_TYPE (ptr
))
216 && pi
->pt
.vars_contains_restrict
)
217 return bitmap_bit_p (pi
->pt
.vars
, DECL_UID (decl
));
219 return pt_solution_includes (&pi
->pt
, decl
);
222 /* Return true if dereferenced PTR1 and PTR2 may alias.
223 The caller is responsible for applying TBAA to see if accesses
224 through PTR1 and PTR2 may conflict at all. */
227 ptr_derefs_may_alias_p (tree ptr1
, tree ptr2
)
229 struct ptr_info_def
*pi1
, *pi2
;
231 gcc_assert ((TREE_CODE (ptr1
) == SSA_NAME
232 || TREE_CODE (ptr1
) == ADDR_EXPR
233 || TREE_CODE (ptr1
) == INTEGER_CST
)
234 && (TREE_CODE (ptr2
) == SSA_NAME
235 || TREE_CODE (ptr2
) == ADDR_EXPR
236 || TREE_CODE (ptr2
) == INTEGER_CST
));
238 /* ADDR_EXPR pointers either just offset another pointer or directly
239 specify the pointed-to set. */
240 if (TREE_CODE (ptr1
) == ADDR_EXPR
)
242 tree base
= get_base_address (TREE_OPERAND (ptr1
, 0));
244 && INDIRECT_REF_P (base
))
245 ptr1
= TREE_OPERAND (base
, 0);
248 return ptr_deref_may_alias_decl_p (ptr2
, base
);
252 if (TREE_CODE (ptr2
) == ADDR_EXPR
)
254 tree base
= get_base_address (TREE_OPERAND (ptr2
, 0));
256 && INDIRECT_REF_P (base
))
257 ptr2
= TREE_OPERAND (base
, 0);
260 return ptr_deref_may_alias_decl_p (ptr1
, base
);
265 /* We can end up with dereferencing constant pointers.
266 Just bail out in this case. */
267 if (TREE_CODE (ptr1
) == INTEGER_CST
268 || TREE_CODE (ptr2
) == INTEGER_CST
)
271 /* We may end up with two empty points-to solutions for two same pointers.
272 In this case we still want to say both pointers alias, so shortcut
277 /* If we do not have useful points-to information for either pointer
278 we cannot disambiguate anything else. */
279 pi1
= SSA_NAME_PTR_INFO (ptr1
);
280 pi2
= SSA_NAME_PTR_INFO (ptr2
);
284 /* If both pointers are restrict-qualified try to disambiguate
285 with restrict information. */
286 if (TYPE_RESTRICT (TREE_TYPE (ptr1
))
287 && TYPE_RESTRICT (TREE_TYPE (ptr2
))
288 && !pt_solutions_same_restrict_base (&pi1
->pt
, &pi2
->pt
))
291 /* ??? This does not use TBAA to prune decls from the intersection
292 that not both pointers may access. */
293 return pt_solutions_intersect (&pi1
->pt
, &pi2
->pt
);
296 /* Return true if dereferencing PTR may alias *REF.
297 The caller is responsible for applying TBAA to see if PTR
298 may access *REF at all. */
301 ptr_deref_may_alias_ref_p_1 (tree ptr
, ao_ref
*ref
)
303 tree base
= ao_ref_base (ref
);
305 if (INDIRECT_REF_P (base
))
306 return ptr_derefs_may_alias_p (ptr
, TREE_OPERAND (base
, 0));
307 else if (SSA_VAR_P (base
))
308 return ptr_deref_may_alias_decl_p (ptr
, base
);
314 /* Dump alias information on FILE. */
317 dump_alias_info (FILE *file
)
321 = lang_hooks
.decl_printable_name (current_function_decl
, 2);
322 referenced_var_iterator rvi
;
325 fprintf (file
, "\n\nAlias information for %s\n\n", funcname
);
327 fprintf (file
, "Aliased symbols\n\n");
329 FOR_EACH_REFERENCED_VAR (var
, rvi
)
331 if (may_be_aliased (var
))
332 dump_variable (file
, var
);
335 fprintf (file
, "\nCall clobber information\n");
337 fprintf (file
, "\nESCAPED");
338 dump_points_to_solution (file
, &cfun
->gimple_df
->escaped
);
339 fprintf (file
, "\nCALLUSED");
340 dump_points_to_solution (file
, &cfun
->gimple_df
->callused
);
342 fprintf (file
, "\n\nFlow-insensitive points-to information\n\n");
344 for (i
= 1; i
< num_ssa_names
; i
++)
346 tree ptr
= ssa_name (i
);
347 struct ptr_info_def
*pi
;
350 || SSA_NAME_IN_FREE_LIST (ptr
))
353 pi
= SSA_NAME_PTR_INFO (ptr
);
355 dump_points_to_info_for (file
, ptr
);
358 fprintf (file
, "\n");
362 /* Dump alias information on stderr. */
365 debug_alias_info (void)
367 dump_alias_info (stderr
);
371 /* Return the alias information associated with pointer T. It creates a
372 new instance if none existed. */
374 struct ptr_info_def
*
375 get_ptr_info (tree t
)
377 struct ptr_info_def
*pi
;
379 gcc_assert (POINTER_TYPE_P (TREE_TYPE (t
)));
381 pi
= SSA_NAME_PTR_INFO (t
);
384 pi
= GGC_CNEW (struct ptr_info_def
);
385 pt_solution_reset (&pi
->pt
);
386 SSA_NAME_PTR_INFO (t
) = pi
;
392 /* Dump the points-to set *PT into FILE. */
395 dump_points_to_solution (FILE *file
, struct pt_solution
*pt
)
398 fprintf (file
, ", points-to anything");
401 fprintf (file
, ", points-to non-local");
404 fprintf (file
, ", points-to escaped");
407 fprintf (file
, ", points-to NULL");
411 fprintf (file
, ", points-to vars: ");
412 dump_decl_set (file
, pt
->vars
);
413 if (pt
->vars_contains_global
)
414 fprintf (file
, " (includes global vars)");
418 /* Dump points-to information for SSA_NAME PTR into FILE. */
421 dump_points_to_info_for (FILE *file
, tree ptr
)
423 struct ptr_info_def
*pi
= SSA_NAME_PTR_INFO (ptr
);
425 print_generic_expr (file
, ptr
, dump_flags
);
428 dump_points_to_solution (file
, &pi
->pt
);
430 fprintf (file
, ", points-to anything");
432 fprintf (file
, "\n");
436 /* Dump points-to information for VAR into stderr. */
439 debug_points_to_info_for (tree var
)
441 dump_points_to_info_for (stderr
, var
);
445 /* Initializes the alias-oracle reference representation *R from REF. */
448 ao_ref_init (ao_ref
*r
, tree ref
)
455 r
->ref_alias_set
= -1;
456 r
->base_alias_set
= -1;
459 /* Returns the base object of the memory reference *REF. */
462 ao_ref_base (ao_ref
*ref
)
466 ref
->base
= get_ref_base_and_extent (ref
->ref
, &ref
->offset
, &ref
->size
,
471 /* Returns the base object alias set of the memory reference *REF. */
473 static alias_set_type ATTRIBUTE_UNUSED
474 ao_ref_base_alias_set (ao_ref
*ref
)
476 if (ref
->base_alias_set
!= -1)
477 return ref
->base_alias_set
;
478 ref
->base_alias_set
= get_alias_set (ao_ref_base (ref
));
479 return ref
->base_alias_set
;
482 /* Returns the reference alias set of the memory reference *REF. */
485 ao_ref_alias_set (ao_ref
*ref
)
487 if (ref
->ref_alias_set
!= -1)
488 return ref
->ref_alias_set
;
489 ref
->ref_alias_set
= get_alias_set (ref
->ref
);
490 return ref
->ref_alias_set
;
493 /* Init an alias-oracle reference representation from a gimple pointer
494 PTR and a gimple size SIZE in bytes. If SIZE is NULL_TREE the the
495 size is assumed to be unknown. The access is assumed to be only
496 to or after of the pointer target, not before it. */
499 ao_ref_init_from_ptr_and_size (ao_ref
*ref
, tree ptr
, tree size
)
501 HOST_WIDE_INT t1
, t2
;
502 ref
->ref
= NULL_TREE
;
503 if (TREE_CODE (ptr
) == ADDR_EXPR
)
504 ref
->base
= get_ref_base_and_extent (TREE_OPERAND (ptr
, 0),
505 &ref
->offset
, &t1
, &t2
);
508 ref
->base
= build1 (INDIRECT_REF
, char_type_node
, ptr
);
512 && host_integerp (size
, 0)
513 && TREE_INT_CST_LOW (size
) * 8 / 8 == TREE_INT_CST_LOW (size
))
514 ref
->max_size
= ref
->size
= TREE_INT_CST_LOW (size
) * 8;
516 ref
->max_size
= ref
->size
= -1;
517 ref
->ref_alias_set
= 0;
518 ref
->base_alias_set
= 0;
521 /* Return 1 if TYPE1 and TYPE2 are to be considered equivalent for the
522 purpose of TBAA. Return 0 if they are distinct and -1 if we cannot
526 same_type_for_tbaa (tree type1
, tree type2
)
528 type1
= TYPE_MAIN_VARIANT (type1
);
529 type2
= TYPE_MAIN_VARIANT (type2
);
531 /* If we would have to do structural comparison bail out. */
532 if (TYPE_STRUCTURAL_EQUALITY_P (type1
)
533 || TYPE_STRUCTURAL_EQUALITY_P (type2
))
536 /* Compare the canonical types. */
537 if (TYPE_CANONICAL (type1
) == TYPE_CANONICAL (type2
))
540 /* ??? Array types are not properly unified in all cases as we have
541 spurious changes in the index types for example. Removing this
542 causes all sorts of problems with the Fortran frontend. */
543 if (TREE_CODE (type1
) == ARRAY_TYPE
544 && TREE_CODE (type2
) == ARRAY_TYPE
)
547 /* The types are known to be not equal. */
551 /* Determine if the two component references REF1 and REF2 which are
552 based on access types TYPE1 and TYPE2 and of which at least one is based
553 on an indirect reference may alias. */
556 aliasing_component_refs_p (tree ref1
, tree type1
,
557 HOST_WIDE_INT offset1
, HOST_WIDE_INT max_size1
,
558 tree ref2
, tree type2
,
559 HOST_WIDE_INT offset2
, HOST_WIDE_INT max_size2
)
561 /* If one reference is a component references through pointers try to find a
562 common base and apply offset based disambiguation. This handles
564 struct A { int i; int j; } *q;
565 struct B { struct A a; int k; } *p;
566 disambiguating q->i and p->a.j. */
570 /* Now search for the type1 in the access path of ref2. This
571 would be a common base for doing offset based disambiguation on. */
573 while (handled_component_p (*refp
)
574 && same_type_for_tbaa (TREE_TYPE (*refp
), type1
) == 0)
575 refp
= &TREE_OPERAND (*refp
, 0);
576 same_p
= same_type_for_tbaa (TREE_TYPE (*refp
), type1
);
577 /* If we couldn't compare types we have to bail out. */
580 else if (same_p
== 1)
582 HOST_WIDE_INT offadj
, sztmp
, msztmp
;
583 get_ref_base_and_extent (*refp
, &offadj
, &sztmp
, &msztmp
);
585 return ranges_overlap_p (offset1
, max_size1
, offset2
, max_size2
);
587 /* If we didn't find a common base, try the other way around. */
589 while (handled_component_p (*refp
)
590 && same_type_for_tbaa (TREE_TYPE (*refp
), type2
) == 0)
591 refp
= &TREE_OPERAND (*refp
, 0);
592 same_p
= same_type_for_tbaa (TREE_TYPE (*refp
), type2
);
593 /* If we couldn't compare types we have to bail out. */
596 else if (same_p
== 1)
598 HOST_WIDE_INT offadj
, sztmp
, msztmp
;
599 get_ref_base_and_extent (*refp
, &offadj
, &sztmp
, &msztmp
);
601 return ranges_overlap_p (offset1
, max_size1
, offset2
, max_size2
);
604 /* We haven't found any common base to apply offset-based disambiguation.
606 1. The base access types have the same alias set. This can happen
607 in Ada when a function with an unconstrained parameter passed by
608 reference is called on a constrained object and inlined: the types
609 have the same alias set but aren't equivalent. The references may
611 2. The base access types don't have the same alias set, i.e. one set
612 is a subset of the other. We have proved that B1 is not in the
613 access path B2.path and that B2 is not in the access path B1.path
614 so the references may not alias. */
615 return get_alias_set (type1
) == get_alias_set (type2
);
618 /* Return true if two memory references based on the variables BASE1
619 and BASE2 constrained to [OFFSET1, OFFSET1 + MAX_SIZE1) and
620 [OFFSET2, OFFSET2 + MAX_SIZE2) may alias. */
623 decl_refs_may_alias_p (tree base1
,
624 HOST_WIDE_INT offset1
, HOST_WIDE_INT max_size1
,
626 HOST_WIDE_INT offset2
, HOST_WIDE_INT max_size2
)
628 gcc_assert (SSA_VAR_P (base1
) && SSA_VAR_P (base2
));
630 /* If both references are based on different variables, they cannot alias. */
631 if (!operand_equal_p (base1
, base2
, 0))
634 /* If both references are based on the same variable, they cannot alias if
635 the accesses do not overlap. */
636 return ranges_overlap_p (offset1
, max_size1
, offset2
, max_size2
);
639 /* Return true if an indirect reference based on *PTR1 constrained
640 to [OFFSET1, OFFSET1 + MAX_SIZE1) may alias a variable based on BASE2
641 constrained to [OFFSET2, OFFSET2 + MAX_SIZE2). *PTR1 and BASE2 have
642 the alias sets BASE1_ALIAS_SET and BASE2_ALIAS_SET which can be -1
643 in which case they are computed on-demand. REF1 and REF2
644 if non-NULL are the complete memory reference trees. */
647 indirect_ref_may_alias_decl_p (tree ref1
, tree ptr1
,
648 HOST_WIDE_INT offset1
, HOST_WIDE_INT max_size1
,
649 alias_set_type base1_alias_set
,
650 tree ref2
, tree base2
,
651 HOST_WIDE_INT offset2
, HOST_WIDE_INT max_size2
,
652 alias_set_type base2_alias_set
)
654 /* If only one reference is based on a variable, they cannot alias if
655 the pointer access is beyond the extent of the variable access.
656 (the pointer base cannot validly point to an offset less than zero
658 They also cannot alias if the pointer may not point to the decl. */
660 && !ranges_overlap_p (offset1
, max_size1
, 0, offset2
+ max_size2
))
662 if (!ptr_deref_may_alias_decl_p (ptr1
, base2
))
665 /* Disambiguations that rely on strict aliasing rules follow. */
666 if (!flag_strict_aliasing
)
669 /* If the alias set for a pointer access is zero all bets are off. */
670 if (base1_alias_set
== -1)
671 base1_alias_set
= get_deref_alias_set (ptr1
);
672 if (base1_alias_set
== 0)
674 if (base2_alias_set
== -1)
675 base2_alias_set
= get_alias_set (base2
);
677 /* If both references are through the same type, they do not alias
678 if the accesses do not overlap. This does extra disambiguation
679 for mixed/pointer accesses but requires strict aliasing. */
680 if (same_type_for_tbaa (TREE_TYPE (TREE_TYPE (ptr1
)),
681 TREE_TYPE (base2
)) == 1)
682 return ranges_overlap_p (offset1
, max_size1
, offset2
, max_size2
);
684 /* The only way to access a variable is through a pointer dereference
685 of the same alias set or a subset of it. */
686 if (base1_alias_set
!= base2_alias_set
687 && !alias_set_subset_of (base1_alias_set
, base2_alias_set
))
690 /* Do access-path based disambiguation. */
692 && handled_component_p (ref1
)
693 && handled_component_p (ref2
))
694 return aliasing_component_refs_p (ref1
, TREE_TYPE (TREE_TYPE (ptr1
)),
696 ref2
, TREE_TYPE (base2
),
702 /* Return true if two indirect references based on *PTR1
703 and *PTR2 constrained to [OFFSET1, OFFSET1 + MAX_SIZE1) and
704 [OFFSET2, OFFSET2 + MAX_SIZE2) may alias. *PTR1 and *PTR2 have
705 the alias sets BASE1_ALIAS_SET and BASE2_ALIAS_SET which can be -1
706 in which case they are computed on-demand. REF1 and REF2
707 if non-NULL are the complete memory reference trees. */
710 indirect_refs_may_alias_p (tree ref1
, tree ptr1
,
711 HOST_WIDE_INT offset1
, HOST_WIDE_INT max_size1
,
712 alias_set_type base1_alias_set
,
713 tree ref2
, tree ptr2
,
714 HOST_WIDE_INT offset2
, HOST_WIDE_INT max_size2
,
715 alias_set_type base2_alias_set
)
717 /* If both bases are based on pointers they cannot alias if they may not
718 point to the same memory object or if they point to the same object
719 and the accesses do not overlap. */
720 if (operand_equal_p (ptr1
, ptr2
, 0))
721 return ranges_overlap_p (offset1
, max_size1
, offset2
, max_size2
);
722 if (!ptr_derefs_may_alias_p (ptr1
, ptr2
))
725 /* Disambiguations that rely on strict aliasing rules follow. */
726 if (!flag_strict_aliasing
)
729 /* If the alias set for a pointer access is zero all bets are off. */
730 if (base1_alias_set
== -1)
731 base1_alias_set
= get_deref_alias_set (ptr1
);
732 if (base1_alias_set
== 0)
734 if (base2_alias_set
== -1)
735 base2_alias_set
= get_deref_alias_set (ptr2
);
736 if (base2_alias_set
== 0)
739 /* If both references are through the same type, they do not alias
740 if the accesses do not overlap. This does extra disambiguation
741 for mixed/pointer accesses but requires strict aliasing. */
742 if (same_type_for_tbaa (TREE_TYPE (TREE_TYPE (ptr1
)),
743 TREE_TYPE (TREE_TYPE (ptr2
))) == 1)
744 return ranges_overlap_p (offset1
, max_size1
, offset2
, max_size2
);
746 /* Do type-based disambiguation. */
747 if (base1_alias_set
!= base2_alias_set
748 && !alias_sets_conflict_p (base1_alias_set
, base2_alias_set
))
751 /* Do access-path based disambiguation. */
753 && handled_component_p (ref1
)
754 && handled_component_p (ref2
))
755 return aliasing_component_refs_p (ref1
, TREE_TYPE (TREE_TYPE (ptr1
)),
757 ref2
, TREE_TYPE (TREE_TYPE (ptr2
)),
763 /* Return true, if the two memory references REF1 and REF2 may alias. */
766 refs_may_alias_p_1 (ao_ref
*ref1
, ao_ref
*ref2
, bool tbaa_p
)
769 HOST_WIDE_INT offset1
= 0, offset2
= 0;
770 HOST_WIDE_INT max_size1
= -1, max_size2
= -1;
771 bool var1_p
, var2_p
, ind1_p
, ind2_p
;
774 gcc_assert ((!ref1
->ref
775 || SSA_VAR_P (ref1
->ref
)
776 || handled_component_p (ref1
->ref
)
777 || INDIRECT_REF_P (ref1
->ref
)
778 || TREE_CODE (ref1
->ref
) == TARGET_MEM_REF
779 || TREE_CODE (ref1
->ref
) == CONST_DECL
)
781 || SSA_VAR_P (ref2
->ref
)
782 || handled_component_p (ref2
->ref
)
783 || INDIRECT_REF_P (ref2
->ref
)
784 || TREE_CODE (ref2
->ref
) == TARGET_MEM_REF
785 || TREE_CODE (ref2
->ref
) == CONST_DECL
));
787 /* Decompose the references into their base objects and the access. */
788 base1
= ao_ref_base (ref1
);
789 offset1
= ref1
->offset
;
790 max_size1
= ref1
->max_size
;
791 base2
= ao_ref_base (ref2
);
792 offset2
= ref2
->offset
;
793 max_size2
= ref2
->max_size
;
795 /* We can end up with registers or constants as bases for example from
796 *D.1663_44 = VIEW_CONVERT_EXPR<struct DB_LSN>(__tmp$B0F64_59);
797 which is seen as a struct copy. */
798 if (TREE_CODE (base1
) == SSA_NAME
799 || TREE_CODE (base2
) == SSA_NAME
800 || TREE_CODE (base1
) == CONST_DECL
801 || TREE_CODE (base2
) == CONST_DECL
802 || is_gimple_min_invariant (base1
)
803 || is_gimple_min_invariant (base2
))
806 /* We can end up refering to code via function decls. As we likely
807 do not properly track code aliases conservatively bail out. */
808 if (TREE_CODE (base1
) == FUNCTION_DECL
809 || TREE_CODE (base2
) == FUNCTION_DECL
)
812 /* Defer to simple offset based disambiguation if we have
813 references based on two decls. Do this before defering to
814 TBAA to handle must-alias cases in conformance with the
815 GCC extension of allowing type-punning through unions. */
816 var1_p
= SSA_VAR_P (base1
);
817 var2_p
= SSA_VAR_P (base2
);
818 if (var1_p
&& var2_p
)
819 return decl_refs_may_alias_p (base1
, offset1
, max_size1
,
820 base2
, offset2
, max_size2
);
822 /* First defer to TBAA if possible. */
824 && flag_strict_aliasing
825 && !alias_sets_conflict_p (ao_ref_alias_set (ref1
),
826 ao_ref_alias_set (ref2
)))
829 /* If one reference is a TARGET_MEM_REF weird things are allowed. Still
830 TBAA disambiguation based on the access type is possible, so bail
831 out only after that check. */
832 if ((ref1
->ref
&& TREE_CODE (ref1
->ref
) == TARGET_MEM_REF
)
833 || (ref2
->ref
&& TREE_CODE (ref2
->ref
) == TARGET_MEM_REF
))
836 /* Dispatch to the pointer-vs-decl or pointer-vs-pointer disambiguators. */
837 ind1_p
= INDIRECT_REF_P (base1
);
838 ind2_p
= INDIRECT_REF_P (base2
);
839 set
= tbaa_p
? -1 : 0;
840 if (var1_p
&& ind2_p
)
841 return indirect_ref_may_alias_decl_p (ref2
->ref
, TREE_OPERAND (base2
, 0),
842 offset2
, max_size2
, set
,
844 offset1
, max_size1
, set
);
845 else if (ind1_p
&& var2_p
)
846 return indirect_ref_may_alias_decl_p (ref1
->ref
, TREE_OPERAND (base1
, 0),
847 offset1
, max_size1
, set
,
849 offset2
, max_size2
, set
);
850 else if (ind1_p
&& ind2_p
)
851 return indirect_refs_may_alias_p (ref1
->ref
, TREE_OPERAND (base1
, 0),
852 offset1
, max_size1
, set
,
853 ref2
->ref
, TREE_OPERAND (base2
, 0),
854 offset2
, max_size2
, set
);
860 refs_may_alias_p (tree ref1
, tree ref2
)
864 ao_ref_init (&r1
, ref1
);
865 ao_ref_init (&r2
, ref2
);
866 res
= refs_may_alias_p_1 (&r1
, &r2
, true);
868 ++alias_stats
.refs_may_alias_p_may_alias
;
870 ++alias_stats
.refs_may_alias_p_no_alias
;
874 /* Returns true if there is a anti-dependence for the STORE that
875 executes after the LOAD. */
878 refs_anti_dependent_p (tree load
, tree store
)
881 ao_ref_init (&r1
, load
);
882 ao_ref_init (&r2
, store
);
883 return refs_may_alias_p_1 (&r1
, &r2
, false);
886 /* Returns true if there is a output dependence for the stores
887 STORE1 and STORE2. */
890 refs_output_dependent_p (tree store1
, tree store2
)
893 ao_ref_init (&r1
, store1
);
894 ao_ref_init (&r2
, store2
);
895 return refs_may_alias_p_1 (&r1
, &r2
, false);
898 /* If the call CALL may use the memory reference REF return true,
899 otherwise return false. */
902 ref_maybe_used_by_call_p_1 (gimple call
, ao_ref
*ref
)
906 int flags
= gimple_call_flags (call
);
908 /* Const functions without a static chain do not implicitly use memory. */
909 if (!gimple_call_chain (call
)
910 && (flags
& (ECF_CONST
|ECF_NOVOPS
)))
913 base
= ao_ref_base (ref
);
917 /* If the reference is based on a decl that is not aliased the call
918 cannot possibly use it. */
920 && !may_be_aliased (base
)
921 /* But local statics can be used through recursion. */
922 && !is_global_var (base
))
925 callee
= gimple_call_fndecl (call
);
927 /* Handle those builtin functions explicitly that do not act as
928 escape points. See tree-ssa-structalias.c:find_func_aliases
929 for the list of builtins we might need to handle here. */
930 if (callee
!= NULL_TREE
931 && DECL_BUILT_IN_CLASS (callee
) == BUILT_IN_NORMAL
)
932 switch (DECL_FUNCTION_CODE (callee
))
934 /* All the following functions clobber memory pointed to by
935 their first argument. */
936 case BUILT_IN_STRCPY
:
937 case BUILT_IN_STRNCPY
:
938 case BUILT_IN_MEMCPY
:
939 case BUILT_IN_MEMMOVE
:
940 case BUILT_IN_MEMPCPY
:
941 case BUILT_IN_STPCPY
:
942 case BUILT_IN_STPNCPY
:
943 case BUILT_IN_STRCAT
:
944 case BUILT_IN_STRNCAT
:
947 tree size
= NULL_TREE
;
948 if (gimple_call_num_args (call
) == 3)
949 size
= gimple_call_arg (call
, 2);
950 ao_ref_init_from_ptr_and_size (&dref
,
951 gimple_call_arg (call
, 1),
953 return refs_may_alias_p_1 (&dref
, ref
, false);
958 tree size
= gimple_call_arg (call
, 2);
959 ao_ref_init_from_ptr_and_size (&dref
,
960 gimple_call_arg (call
, 0),
962 return refs_may_alias_p_1 (&dref
, ref
, false);
964 /* The following builtins do not read from memory. */
966 case BUILT_IN_MEMSET
:
968 case BUILT_IN_FREXPF
:
969 case BUILT_IN_FREXPL
:
970 case BUILT_IN_GAMMA_R
:
971 case BUILT_IN_GAMMAF_R
:
972 case BUILT_IN_GAMMAL_R
:
973 case BUILT_IN_LGAMMA_R
:
974 case BUILT_IN_LGAMMAF_R
:
975 case BUILT_IN_LGAMMAL_R
:
979 case BUILT_IN_REMQUO
:
980 case BUILT_IN_REMQUOF
:
981 case BUILT_IN_REMQUOL
:
982 case BUILT_IN_SINCOS
:
983 case BUILT_IN_SINCOSF
:
984 case BUILT_IN_SINCOSL
:
988 /* Fallthru to general call handling. */;
991 /* Check if base is a global static variable that is not read
993 if (TREE_CODE (base
) == VAR_DECL
994 && TREE_STATIC (base
)
995 && !TREE_PUBLIC (base
))
999 if (callee
!= NULL_TREE
1001 = ipa_reference_get_not_read_global (cgraph_node (callee
)))
1002 && bitmap_bit_p (not_read
, DECL_UID (base
)))
1006 /* If the base variable is call-used or call-clobbered then
1008 if (flags
& (ECF_PURE
|ECF_CONST
|ECF_LOOPING_CONST_OR_PURE
|ECF_NOVOPS
))
1012 if (is_call_used (base
))
1015 else if (INDIRECT_REF_P (base
)
1016 && TREE_CODE (TREE_OPERAND (base
, 0)) == SSA_NAME
)
1018 struct ptr_info_def
*pi
= SSA_NAME_PTR_INFO (TREE_OPERAND (base
, 0));
1022 if (pt_solution_includes_global (&pi
->pt
)
1023 || pt_solutions_intersect (&cfun
->gimple_df
->callused
, &pi
->pt
)
1024 || pt_solutions_intersect (&cfun
->gimple_df
->escaped
, &pi
->pt
))
1034 if (is_call_clobbered (base
))
1037 else if (INDIRECT_REF_P (base
)
1038 && TREE_CODE (TREE_OPERAND (base
, 0)) == SSA_NAME
)
1040 struct ptr_info_def
*pi
= SSA_NAME_PTR_INFO (TREE_OPERAND (base
, 0));
1044 if (pt_solution_includes_global (&pi
->pt
)
1045 || pt_solutions_intersect (&cfun
->gimple_df
->escaped
, &pi
->pt
))
1052 /* Inspect call arguments for passed-by-value aliases. */
1054 for (i
= 0; i
< gimple_call_num_args (call
); ++i
)
1056 tree op
= gimple_call_arg (call
, i
);
1058 if (TREE_CODE (op
) == WITH_SIZE_EXPR
)
1059 op
= TREE_OPERAND (op
, 0);
1061 if (TREE_CODE (op
) != SSA_NAME
1062 && !is_gimple_min_invariant (op
))
1065 ao_ref_init (&r
, op
);
1066 if (refs_may_alias_p_1 (&r
, ref
, true))
1075 ref_maybe_used_by_call_p (gimple call
, tree ref
)
1079 ao_ref_init (&r
, ref
);
1080 res
= ref_maybe_used_by_call_p_1 (call
, &r
);
1082 ++alias_stats
.ref_maybe_used_by_call_p_may_alias
;
1084 ++alias_stats
.ref_maybe_used_by_call_p_no_alias
;
1089 /* If the statement STMT may use the memory reference REF return
1090 true, otherwise return false. */
1093 ref_maybe_used_by_stmt_p (gimple stmt
, tree ref
)
1095 if (is_gimple_assign (stmt
))
1099 /* All memory assign statements are single. */
1100 if (!gimple_assign_single_p (stmt
))
1103 rhs
= gimple_assign_rhs1 (stmt
);
1104 if (is_gimple_reg (rhs
)
1105 || is_gimple_min_invariant (rhs
)
1106 || gimple_assign_rhs_code (stmt
) == CONSTRUCTOR
)
1109 return refs_may_alias_p (rhs
, ref
);
1111 else if (is_gimple_call (stmt
))
1112 return ref_maybe_used_by_call_p (stmt
, ref
);
1117 /* If the call in statement CALL may clobber the memory reference REF
1118 return true, otherwise return false. */
1121 call_may_clobber_ref_p_1 (gimple call
, ao_ref
*ref
)
1126 /* If the call is pure or const it cannot clobber anything. */
1127 if (gimple_call_flags (call
)
1128 & (ECF_PURE
|ECF_CONST
|ECF_LOOPING_CONST_OR_PURE
|ECF_NOVOPS
))
1131 base
= ao_ref_base (ref
);
1135 if (TREE_CODE (base
) == SSA_NAME
1136 || CONSTANT_CLASS_P (base
))
1139 /* If the reference is based on a decl that is not aliased the call
1140 cannot possibly clobber it. */
1142 && !may_be_aliased (base
)
1143 /* But local non-readonly statics can be modified through recursion
1144 or the call may implement a threading barrier which we must
1145 treat as may-def. */
1146 && (TREE_READONLY (base
)
1147 || !is_global_var (base
)))
1150 callee
= gimple_call_fndecl (call
);
1152 /* Handle those builtin functions explicitly that do not act as
1153 escape points. See tree-ssa-structalias.c:find_func_aliases
1154 for the list of builtins we might need to handle here. */
1155 if (callee
!= NULL_TREE
1156 && DECL_BUILT_IN_CLASS (callee
) == BUILT_IN_NORMAL
)
1157 switch (DECL_FUNCTION_CODE (callee
))
1159 /* All the following functions clobber memory pointed to by
1160 their first argument. */
1161 case BUILT_IN_STRCPY
:
1162 case BUILT_IN_STRNCPY
:
1163 case BUILT_IN_MEMCPY
:
1164 case BUILT_IN_MEMMOVE
:
1165 case BUILT_IN_MEMPCPY
:
1166 case BUILT_IN_STPCPY
:
1167 case BUILT_IN_STPNCPY
:
1168 case BUILT_IN_STRCAT
:
1169 case BUILT_IN_STRNCAT
:
1170 case BUILT_IN_MEMSET
:
1173 tree size
= NULL_TREE
;
1174 if (gimple_call_num_args (call
) == 3)
1175 size
= gimple_call_arg (call
, 2);
1176 ao_ref_init_from_ptr_and_size (&dref
,
1177 gimple_call_arg (call
, 0),
1179 return refs_may_alias_p_1 (&dref
, ref
, false);
1181 case BUILT_IN_BCOPY
:
1184 tree size
= gimple_call_arg (call
, 2);
1185 ao_ref_init_from_ptr_and_size (&dref
,
1186 gimple_call_arg (call
, 1),
1188 return refs_may_alias_p_1 (&dref
, ref
, false);
1190 /* Freeing memory kills the pointed-to memory. More importantly
1191 the call has to serve as a barrier for moving loads and stores
1195 tree ptr
= gimple_call_arg (call
, 0);
1196 return ptr_deref_may_alias_ref_p_1 (ptr
, ref
);
1198 case BUILT_IN_GAMMA_R
:
1199 case BUILT_IN_GAMMAF_R
:
1200 case BUILT_IN_GAMMAL_R
:
1201 case BUILT_IN_LGAMMA_R
:
1202 case BUILT_IN_LGAMMAF_R
:
1203 case BUILT_IN_LGAMMAL_R
:
1205 tree out
= gimple_call_arg (call
, 1);
1206 if (ptr_deref_may_alias_ref_p_1 (out
, ref
))
1208 if (flag_errno_math
)
1212 case BUILT_IN_FREXP
:
1213 case BUILT_IN_FREXPF
:
1214 case BUILT_IN_FREXPL
:
1216 case BUILT_IN_MODFF
:
1217 case BUILT_IN_MODFL
:
1219 tree out
= gimple_call_arg (call
, 1);
1220 return ptr_deref_may_alias_ref_p_1 (out
, ref
);
1222 case BUILT_IN_REMQUO
:
1223 case BUILT_IN_REMQUOF
:
1224 case BUILT_IN_REMQUOL
:
1226 tree out
= gimple_call_arg (call
, 2);
1227 if (ptr_deref_may_alias_ref_p_1 (out
, ref
))
1229 if (flag_errno_math
)
1233 case BUILT_IN_SINCOS
:
1234 case BUILT_IN_SINCOSF
:
1235 case BUILT_IN_SINCOSL
:
1237 tree sin
= gimple_call_arg (call
, 1);
1238 tree cos
= gimple_call_arg (call
, 2);
1239 return (ptr_deref_may_alias_ref_p_1 (sin
, ref
)
1240 || ptr_deref_may_alias_ref_p_1 (cos
, ref
));
1243 /* Fallthru to general call handling. */;
1246 /* Check if base is a global static variable that is not written
1248 if (callee
!= NULL_TREE
1249 && TREE_CODE (base
) == VAR_DECL
1250 && TREE_STATIC (base
)
1251 && !TREE_PUBLIC (base
))
1256 = ipa_reference_get_not_written_global (cgraph_node (callee
)))
1257 && bitmap_bit_p (not_written
, DECL_UID (base
)))
1262 return is_call_clobbered (base
);
1263 else if (INDIRECT_REF_P (base
)
1264 && TREE_CODE (TREE_OPERAND (base
, 0)) == SSA_NAME
)
1266 struct ptr_info_def
*pi
= SSA_NAME_PTR_INFO (TREE_OPERAND (base
, 0));
1270 return (pt_solution_includes_global (&pi
->pt
)
1271 || pt_solutions_intersect (&cfun
->gimple_df
->escaped
, &pi
->pt
));
1277 static bool ATTRIBUTE_UNUSED
1278 call_may_clobber_ref_p (gimple call
, tree ref
)
1282 ao_ref_init (&r
, ref
);
1283 res
= call_may_clobber_ref_p_1 (call
, &r
);
1285 ++alias_stats
.call_may_clobber_ref_p_may_alias
;
1287 ++alias_stats
.call_may_clobber_ref_p_no_alias
;
1292 /* If the statement STMT may clobber the memory reference REF return true,
1293 otherwise return false. */
1296 stmt_may_clobber_ref_p_1 (gimple stmt
, ao_ref
*ref
)
1298 if (is_gimple_call (stmt
))
1300 tree lhs
= gimple_call_lhs (stmt
);
1302 && !is_gimple_reg (lhs
))
1305 ao_ref_init (&r
, lhs
);
1306 if (refs_may_alias_p_1 (ref
, &r
, true))
1310 return call_may_clobber_ref_p_1 (stmt
, ref
);
1312 else if (is_gimple_assign (stmt
))
1315 ao_ref_init (&r
, gimple_assign_lhs (stmt
));
1316 return refs_may_alias_p_1 (ref
, &r
, true);
1318 else if (gimple_code (stmt
) == GIMPLE_ASM
)
1325 stmt_may_clobber_ref_p (gimple stmt
, tree ref
)
1328 ao_ref_init (&r
, ref
);
1329 return stmt_may_clobber_ref_p_1 (stmt
, &r
);
1333 /* Walk the virtual use-def chain of VUSE until hitting the virtual operand
1334 TARGET or a statement clobbering the memory reference REF in which
1335 case false is returned. The walk starts with VUSE, one argument of PHI. */
1338 maybe_skip_until (gimple phi
, tree target
, ao_ref
*ref
,
1339 tree vuse
, bitmap
*visited
)
1342 *visited
= BITMAP_ALLOC (NULL
);
1344 bitmap_set_bit (*visited
, SSA_NAME_VERSION (PHI_RESULT (phi
)));
1346 /* Walk until we hit the target. */
1347 while (vuse
!= target
)
1349 gimple def_stmt
= SSA_NAME_DEF_STMT (vuse
);
1350 /* Recurse for PHI nodes. */
1351 if (gimple_code (def_stmt
) == GIMPLE_PHI
)
1353 /* An already visited PHI node ends the walk successfully. */
1354 if (bitmap_bit_p (*visited
, SSA_NAME_VERSION (PHI_RESULT (def_stmt
))))
1356 vuse
= get_continuation_for_phi (def_stmt
, ref
, visited
);
1361 /* A clobbering statement or the end of the IL ends it failing. */
1362 else if (gimple_nop_p (def_stmt
)
1363 || stmt_may_clobber_ref_p_1 (def_stmt
, ref
))
1365 vuse
= gimple_vuse (def_stmt
);
1370 /* Starting from a PHI node for the virtual operand of the memory reference
1371 REF find a continuation virtual operand that allows to continue walking
1372 statements dominating PHI skipping only statements that cannot possibly
1373 clobber REF. Returns NULL_TREE if no suitable virtual operand can
1377 get_continuation_for_phi (gimple phi
, ao_ref
*ref
, bitmap
*visited
)
1379 unsigned nargs
= gimple_phi_num_args (phi
);
1381 /* Through a single-argument PHI we can simply look through. */
1383 return PHI_ARG_DEF (phi
, 0);
1385 /* For two arguments try to skip non-aliasing code until we hit
1386 the phi argument definition that dominates the other one. */
1389 tree arg0
= PHI_ARG_DEF (phi
, 0);
1390 tree arg1
= PHI_ARG_DEF (phi
, 1);
1391 gimple def0
= SSA_NAME_DEF_STMT (arg0
);
1392 gimple def1
= SSA_NAME_DEF_STMT (arg1
);
1397 else if (gimple_nop_p (def0
)
1398 || (!gimple_nop_p (def1
)
1399 && dominated_by_p (CDI_DOMINATORS
,
1400 gimple_bb (def1
), gimple_bb (def0
))))
1402 if (maybe_skip_until (phi
, arg0
, ref
, arg1
, visited
))
1405 else if (gimple_nop_p (def1
)
1406 || dominated_by_p (CDI_DOMINATORS
,
1407 gimple_bb (def0
), gimple_bb (def1
)))
1409 if (maybe_skip_until (phi
, arg1
, ref
, arg0
, visited
))
1412 /* Special case of a diamond:
1414 goto (cond) ? L1 : L2
1415 L1: store1 = ... #MEM_2 = vuse(MEM_1)
1417 L2: store2 = ... #MEM_3 = vuse(MEM_1)
1418 L3: MEM_4 = PHI<MEM_2, MEM_3>
1419 We were called with the PHI at L3, MEM_2 and MEM_3 don't
1420 dominate each other, but still we can easily skip this PHI node
1421 if we recognize that the vuse MEM operand is the same for both,
1422 and that we can skip both statements (they don't clobber us).
1423 This is still linear. Don't use maybe_skip_until, that might
1424 potentially be slow. */
1425 else if ((common_vuse
= gimple_vuse (def0
))
1426 && common_vuse
== gimple_vuse (def1
))
1428 if (!stmt_may_clobber_ref_p_1 (def0
, ref
)
1429 && !stmt_may_clobber_ref_p_1 (def1
, ref
))
1437 /* Based on the memory reference REF and its virtual use VUSE call
1438 WALKER for each virtual use that is equivalent to VUSE, including VUSE
1439 itself. That is, for each virtual use for which its defining statement
1440 does not clobber REF.
1442 WALKER is called with REF, the current virtual use and DATA. If
1443 WALKER returns non-NULL the walk stops and its result is returned.
1444 At the end of a non-successful walk NULL is returned.
1446 TRANSLATE if non-NULL is called with a pointer to REF, the virtual
1447 use which definition is a statement that may clobber REF and DATA.
1448 If TRANSLATE returns (void *)-1 the walk stops and NULL is returned.
1449 If TRANSLATE returns non-NULL the walk stops and its result is returned.
1450 If TRANSLATE returns NULL the walk continues and TRANSLATE is supposed
1451 to adjust REF and *DATA to make that valid.
1453 TODO: Cache the vector of equivalent vuses per ref, vuse pair. */
1456 walk_non_aliased_vuses (ao_ref
*ref
, tree vuse
,
1457 void *(*walker
)(ao_ref
*, tree
, void *),
1458 void *(*translate
)(ao_ref
*, tree
, void *), void *data
)
1460 bitmap visited
= NULL
;
1463 timevar_push (TV_ALIAS_STMT_WALK
);
1469 /* ??? Do we want to account this to TV_ALIAS_STMT_WALK? */
1470 res
= (*walker
) (ref
, vuse
, data
);
1474 def_stmt
= SSA_NAME_DEF_STMT (vuse
);
1475 if (gimple_nop_p (def_stmt
))
1477 else if (gimple_code (def_stmt
) == GIMPLE_PHI
)
1478 vuse
= get_continuation_for_phi (def_stmt
, ref
, &visited
);
1481 if (stmt_may_clobber_ref_p_1 (def_stmt
, ref
))
1485 res
= (*translate
) (ref
, vuse
, data
);
1486 /* Failed lookup and translation. */
1487 if (res
== (void *)-1)
1492 /* Lookup succeeded. */
1493 else if (res
!= NULL
)
1495 /* Translation succeeded, continue walking. */
1497 vuse
= gimple_vuse (def_stmt
);
1503 BITMAP_FREE (visited
);
1505 timevar_pop (TV_ALIAS_STMT_WALK
);
1511 /* Based on the memory reference REF call WALKER for each vdef which
1512 defining statement may clobber REF, starting with VDEF. If REF
1513 is NULL_TREE, each defining statement is visited.
1515 WALKER is called with REF, the current vdef and DATA. If WALKER
1516 returns true the walk is stopped, otherwise it continues.
1518 At PHI nodes walk_aliased_vdefs forks into one walk for reach
1519 PHI argument (but only one walk continues on merge points), the
1520 return value is true if any of the walks was successful.
1522 The function returns the number of statements walked. */
1525 walk_aliased_vdefs_1 (ao_ref
*ref
, tree vdef
,
1526 bool (*walker
)(ao_ref
*, tree
, void *), void *data
,
1527 bitmap
*visited
, unsigned int cnt
)
1531 gimple def_stmt
= SSA_NAME_DEF_STMT (vdef
);
1534 && !bitmap_set_bit (*visited
, SSA_NAME_VERSION (vdef
)))
1537 if (gimple_nop_p (def_stmt
))
1539 else if (gimple_code (def_stmt
) == GIMPLE_PHI
)
1543 *visited
= BITMAP_ALLOC (NULL
);
1544 for (i
= 0; i
< gimple_phi_num_args (def_stmt
); ++i
)
1545 cnt
+= walk_aliased_vdefs_1 (ref
, gimple_phi_arg_def (def_stmt
, i
),
1546 walker
, data
, visited
, 0);
1550 /* ??? Do we want to account this to TV_ALIAS_STMT_WALK? */
1553 || stmt_may_clobber_ref_p_1 (def_stmt
, ref
))
1554 && (*walker
) (ref
, vdef
, data
))
1557 vdef
= gimple_vuse (def_stmt
);
1563 walk_aliased_vdefs (ao_ref
*ref
, tree vdef
,
1564 bool (*walker
)(ao_ref
*, tree
, void *), void *data
,
1567 bitmap local_visited
= NULL
;
1570 timevar_push (TV_ALIAS_STMT_WALK
);
1572 ret
= walk_aliased_vdefs_1 (ref
, vdef
, walker
, data
,
1573 visited
? visited
: &local_visited
, 0);
1575 BITMAP_FREE (local_visited
);
1577 timevar_pop (TV_ALIAS_STMT_WALK
);