Lines Matching refs:Access
1 //===- LoopAccessAnalysis.cpp - Loop Access Analysis Implementation --------==//
65 "loop-access analysis (default = 100)"),
302 MemoryDepChecker::MemAccessInfo Access(Pointers[I].PointerValue,
306 auto LeaderI = DepCands.findValue(DepCands.getLeaderValue(Access));
422 /// \brief Read or write access location.
481 /// \brief Go over all memory access and check whether runtime pointer checks
496 /// An alias set tracker to partition the access set by underlying object and
547 // We assign a consecutive id to access from different alias sets.
554 // We assign consecutive id to access from different dependence sets.
562 MemAccessInfo Access(Ptr, IsWrite);
578 Value *Leader = DepCands.getLeaderValue(Access).getPointer();
584 // Each access has its own dependence set.
680 // Map of pointers to last access encountered.
684 // Set of access to check after all writes have been processed.
696 // For a single memory access in AliasSetTracker, Accesses may contain
704 // If we're using the deferred access set, then it contains only
713 "Alias-set pointer not in the access set?");
715 MemAccessInfo Access(Ptr, IsWrite);
716 DepCands.insert(Access);
724 DeferredAccesses.insert(Access);
733 CheckDeps.insert(Access);
756 DepCands.unionSets(Access, Prev->second);
758 ObjToLastAccess[UnderlyingObj] = Access;
821 /// \brief Check whether the access through \p Ptr has a constant stride.
855 // to access the pointer value "0" which is undefined behavior in address
887 // Strided access.
1082 DEBUG(dbgs() << "Pointer access with non-constant stride\n");
1225 // Get the relevant memory access set.
1233 // Check every access pair.
1283 MemAccessInfo Access(Ptr, isWrite);
1284 auto &IndexVector = Accesses.find(Access)->second;
1847 static const char laa_name[] = "Loop Access Analysis";
