Lines Matching refs:Pointers
620 /// check that a group of pointers do not overlap.
627 Pointers.clear();
640 /// Holds the pointers that we need to check.
641 SmallVector<TrackingVH<Value>, 2> Pointers;
648 /// Holds the id of the set of pointers that could be dependent because of a
807 /// variables can be pointers.
818 /// We need to check that all of the pointers in this list are disjoint
1411 Pointers.push_back(Ptr);
1916 unsigned NumPointers = PtrRtCheck->Pointers.size();
1925 Value *Ptr = PtrRtCheck->Pointers[i];
1952 // No need to check if two readonly pointers intersect.
1956 // Only need to check pointers between two different dependency sets.
1965 "Trying to bounds check pointers with different address spaces");
3317 // A list of pointers that we can safely read and write to.
3877 /// \brief Check whether we can check the pointers at runtime for
3887 // Process read-write pointers first.
3889 // Next, process read pointers.
3915 /// Map of pointers to last access encountered.
3921 /// Set of pointers that are read only.
3961 // Find pointers with computable bounds. We are going to use this information
3990 // don't have wrapping pointers.
4021 // If the pointers that we would use for the bounds comparison have different
4026 unsigned NumPointers = RtCheck.Pointers.size();
4029 // Only need to check pointers between two different dependency sets.
4033 Value *PtrI = RtCheck.Pointers[i];
4034 Value *PtrJ = RtCheck.Pointers[j];
4054 // We process the set twice: first we process read-write pointers, last we
4055 // process read-only pointers. This allows us to skip dependence tests for
4056 // read-only pointers.
4066 // Memorize read-only pointers for later processing and skip them in the
4068 // pointers). Note: we also mark pointer that are not consecutive as
4069 // "read-only" pointers (so that we check "a[b[i]] +="). Hence, we need the
4122 // Create sets of pointers connected by shared underlying objects.
4142 /// locations with different underlying pointers are "must-not alias".
4553 PtrRtCheck.Pointers.clear();
4612 // Next, we find the pointers that they use.
4615 // care if the pointers are *restrict*.
4624 // Holds the analyzed pointers. We don't want to call GetUnderlyingObjects
4690 // Find pointers with computable bounds. We are going to use this information
4701 // If we only have one set of dependences to check pointers among we don't
4706 // Check that we did not collect too many pointers or found an unsizeable
4746 // Check that we did not collect too many pointers or found an unsizeable
