Searched refs:Dependences (Results 1 – 5 of 5) sorted by relevance
289 SetVector<DepChain *> Dependences; member in __anon8cdab83e0111::HexagonVectorLoopCarriedReuse451 for (auto *D : Dependences) { in findValueToReuse()668 Dependences.clear(); in doVLCR()678 llvm::for_each(Dependences, std::default_delete<DepChain>()); in doVLCR()722 for (auto *D : Dependences) { in getDepChainBtwn()739 Dependences.insert(D); in findLoopCarriedDeps()743 LLVM_DEBUG(dbgs() << "Found " << Dependences.size() << " dependences\n"); in findLoopCarriedDeps()744 LLVM_DEBUG(for (size_t i = 0; i < Dependences.size(); in findLoopCarriedDeps()745 ++i) { dbgs() << *Dependences[i] << "\n"; }); in findLoopCarriedDeps()
641 DenseMap<Instruction *, SmallPtrSet<Instruction *, 2>> Dependences; variable753 return Dependences.find(Src) == Dependences.end() || in canReorderMemAccessesForInterleavedGroups()754 !Dependences.lookup(Src).count(Sink); in canReorderMemAccessesForInterleavedGroups()766 Dependences[Dep.getSource(*LAI)].insert(Dep.getDestination(*LAI)); in collectDependences()
231 return RecordDependences ? &Dependences : nullptr; in getDependences()234 void clearDependences() { Dependences.clear(); } in clearDependences()301 SmallVector<Dependence, 8> Dependences; variable
636 const SmallVectorImpl<Dependence> &Dependences) { in MemoryInstructionDependences() argument640 for (auto &Dep : Dependences) in MemoryInstructionDependences()690 auto *Dependences = LAI->getDepChecker().getDependences(); in processLoop() local691 if (!Dependences || Dependences->empty()) in processLoop()717 *Dependences); in processLoop()
1690 Dependences.push_back(Dependence(A.second, B.second, Type)); in areDepsSafe()1692 if (Dependences.size() >= MaxDependences) { in areDepsSafe()1694 Dependences.clear(); in areDepsSafe()1708 LLVM_DEBUG(dbgs() << "Total Dependences: " << Dependences.size() << "\n"); in areDepsSafe()2375 if (auto *Dependences = DepChecker->getDependences()) { in print() local2377 for (auto &Dep : *Dependences) { in print()