Home
last modified time | relevance | path

Searched refs:Dependence (Results 1 – 25 of 32) sorted by relevance

12

/netbsd-src/external/apache2/llvm/dist/clang/include/clang/AST/
H A DDependenceFlags.h106 class Dependence { in LLVM_COMMON_DEPENDENCE()
137 Dependence() : V(None) {} in LLVM_COMMON_DEPENDENCE()
139 Dependence(TypeDependence D) in LLVM_COMMON_DEPENDENCE()
146 Dependence(ExprDependence D) in LLVM_COMMON_DEPENDENCE()
153 Dependence(NestedNameSpecifierDependence D) : in LLVM_COMMON_DEPENDENCE()
159 Dependence(TemplateArgumentDependence D) in LLVM_COMMON_DEPENDENCE()
165 Dependence(TemplateNameDependence D) in LLVM_COMMON_DEPENDENCE()
172 Dependence syntactic() { in LLVM_COMMON_DEPENDENCE()
173 Dependence Result = *this; in LLVM_COMMON_DEPENDENCE()
232 return Dependence(TA).expr(); in toExprDependence()
[all …]
H A DType.h1504 unsigned Dependence : llvm::BitWidth<TypeDependence>;
1818 Type(TypeClass tc, QualType canon, TypeDependence Dependence)
1826 TypeBits.Dependence = static_cast<unsigned>(Dependence);
1837 TypeBits.Dependence = static_cast<unsigned>(D);
2158 return static_cast<TypeDependence>(TypeBits.Dependence);
3801 TypeDependence Dependence, ExtInfo Info)
3802 : Type(tc, Canonical, Dependence), ResultType(res) {
5360 QualType Canonical, TypeDependence Dependence)
5361 : Type(tc, Canonical, Dependence) {
/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/
H A DDependenceAnalysis.h71 class Dependence {
73 Dependence(Dependence &&) = default;
74 Dependence &operator=(Dependence &&) = default;
77 Dependence(Instruction *Source, in Dependence() function
83 virtual ~Dependence() {} in ~Dependence()
183 const Dependence *getNextPredecessor() const { return NextPredecessor; } in getNextPredecessor()
187 const Dependence *getNextSuccessor() const { return NextSuccessor; } in getNextSuccessor()
191 void setNextPredecessor(const Dependence *pred) { NextPredecessor = pred; } in setNextPredecessor()
195 void setNextSuccessor(const Dependence *succ) { NextSuccessor = succ; } in setNextSuccessor()
203 const Dependence *NextPredecessor, *NextSuccessor;
[all …]
H A DLoopAccessAnalysis.h108 struct Dependence { struct
147 Dependence(unsigned Source, unsigned Destination, DepType Type) in Dependence() argument
234 const SmallVectorImpl<Dependence> *getDependences() const { in getDependences()
305 SmallVector<Dependence, 8> Dependences;
319 Dependence::DepType isDependent(const MemAccessInfo &A, unsigned AIdx,
770 inline Instruction *MemoryDepChecker::Dependence::getSource( in getSource()
775 inline Instruction *MemoryDepChecker::Dependence::getDestination( in getDestination()
H A DDDG.h267 using DependenceList = SmallVector<std::unique_ptr<Dependence>, 1>;
481 interleaveComma(Deps, OS, [&](const std::unique_ptr<Dependence> &D) { in getDependenceString()
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Analysis/
H A DDependenceAnalysis.cpp221 bool Dependence::isInput() const { in isInput()
227 bool Dependence::isOutput() const { in isOutput()
233 bool Dependence::isFlow() const { in isFlow()
239 bool Dependence::isAnti() const { in isAnti()
248 bool Dependence::isScalar(unsigned level) const { in isScalar()
259 : Dependence(Source, Destination), Levels(CommonLevels), in FullDependence()
591 void Dependence::dump(raw_ostream &OS) const { in dump()
1200 Result.DV[Level].Direction &= Dependence::DVEntry::LT; in strongSIVtest()
1202 Result.DV[Level].Direction &= Dependence::DVEntry::GT; in strongSIVtest()
1204 Result.DV[Level].Direction &= Dependence::DVEntry::EQ; in strongSIVtest()
[all …]
H A DLoopAccessAnalysis.cpp1247 MemoryDepChecker::Dependence::isSafeForVectorization(DepType Type) { in isSafeForVectorization()
1264 bool MemoryDepChecker::Dependence::isBackward() const { in isBackward()
1280 bool MemoryDepChecker::Dependence::isPossiblyBackward() const { in isPossiblyBackward()
1284 bool MemoryDepChecker::Dependence::isForward() const { in isForward()
1452 MemoryDepChecker::Dependence::DepType
1465 return Dependence::NoDep; in isDependent()
1470 return Dependence::Unknown; in isDependent()
1500 return Dependence::Unknown; in isDependent()
1514 return Dependence::NoDep; in isDependent()
1518 return Dependence::Unknown; in isDependent()
[all …]
H A DDependenceGraphBuilder.cpp343 if (D->getDirection(Level) == Dependence::DVEntry::EQ) in createMemoryDependencyEdges()
345 else if (D->getDirection(Level) == Dependence::DVEntry::GT) { in createMemoryDependencyEdges()
350 } else if (D->getDirection(Level) == Dependence::DVEntry::LT) in createMemoryDependencyEdges()
H A DLoopCacheAnalysis.cpp218 std::unique_ptr<Dependence> D = in hasTemporalReuse()
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Transforms/Utils/
H A DLoopUnrollAndJam.cpp658 bool Sequentialized, Dependence *D) { in preservesForwardDependence()
664 if (JammedDir == Dependence::DVEntry::LT) in preservesForwardDependence()
667 if (JammedDir & Dependence::DVEntry::GT) in preservesForwardDependence()
676 bool Sequentialized, Dependence *D) { in preservesBackwardDependence()
681 if (JammedDir == Dependence::DVEntry::GT) in preservesBackwardDependence()
684 if (JammedDir & Dependence::DVEntry::LT) in preservesBackwardDependence()
722 std::unique_ptr<Dependence> D = DI.depends(Src, Dst, true); in checkDependency()
739 if (!(D->getDirection(CurLoopDepth) & Dependence::DVEntry::EQ)) in checkDependency()
747 if (UnrollDirection == Dependence::DVEntry::EQ) in checkDependency()
750 if (UnrollDirection & Dependence::DVEntry::LT && in checkDependency()
[all …]
/netbsd-src/external/apache2/llvm/dist/llvm/docs/DependenceGraphs/
H A Dindex.rst2 Dependence Graphs in LLVM
10 Dependence graphs are useful tools in compilers for analyzing relationships
20 Data Dependence Graph
22 In its simplest form the Data Dependence Graph (or DDG) represents data
59 Program Dependence Graph
62 The Program Dependence Graph (or PDG) has a similar structure as the
140 …cal University) and JOE D. WARREN (Rice University), 1987. The Program Dependence Graph and Its Us…
/netbsd-src/external/apache2/llvm/dist/llvm/lib/CodeGen/
H A DImplicitNullChecks.cpp214 MachineBasicBlock *NullSucc, MachineInstr *&Dependence);
516 MachineInstr *&Dependence) { in canHoistInst() argument
522 Dependence = nullptr; in canHoistInst()
547 Dependence = DependenceMI; in canHoistInst()
684 MachineInstr *Dependence; in analyzeBlockForNullChecks() local
689 canHoistInst(&MI, InstsSeenSoFar, NullSucc, Dependence)) { in analyzeBlockForNullChecks()
691 NullSucc, Dependence); in analyzeBlockForNullChecks()
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Target/Hexagon/
H A DHexagonVLIWPacketizer.cpp1035 Dependence = false; in initPacketizerState()
1335 Dependence = hasDeadDependence(I, J) || hasControlDependence(I, J); in isLegalToPacketizeTogether()
1336 if (Dependence) in isLegalToPacketizeTogether()
1343 Dependence = hasRegMaskDependence(I, J); in isLegalToPacketizeTogether()
1344 if (Dependence) in isLegalToPacketizeTogether()
1350 Dependence = hasDualStoreDependence(I, J); in isLegalToPacketizeTogether()
1351 if (Dependence) in isLegalToPacketizeTogether()
1370 Dependence = true; in isLegalToPacketizeTogether()
1383 Dependence = true; in isLegalToPacketizeTogether()
1389 Dependence = true; in isLegalToPacketizeTogether()
[all …]
H A DHexagonVLIWPacketizer.h45 bool Dependence; variable
/netbsd-src/external/apache2/llvm/dist/llvm/docs/
H A DReference.rst191 :doc:`Dependence Graphs <DependenceGraphs/index>`
193 the DDG (Data Dependence Graph).
H A DPasses.rst88 ``-da``: Dependence Analysis
91 Dependence analysis framework, which is used to detect dependences in memory
241 ``-memdep``: Memory Dependence Analysis
846 :ref:`Dependence Analysis <passes-da>` for proving the transformations are safe.
H A DAliasAnalysis.rst665 Memory Dependence Analysis
675 using the Memory Dependence Analysis interface instead. MemDep is a lazy,
H A DMemorySSA.rst415 …ers' Meeting: S. Baziotis & S. Moll - Finding Your Way Around the LLVM Dependence Analysis Zoo <ht…
H A DWritingAnLLVMPass.rst1070 Memory Dependence Analysis
1103 Memory Dependence Analysis
1144 Memory Dependence Analysis
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/
H A DLoopInterchange.cpp156 if (Dir == Dependence::DVEntry::LT || in populateDependencyMatrix()
157 Dir == Dependence::DVEntry::LE) in populateDependencyMatrix()
159 else if (Dir == Dependence::DVEntry::GT || in populateDependencyMatrix()
160 Dir == Dependence::DVEntry::GE) in populateDependencyMatrix()
162 else if (Dir == Dependence::DVEntry::EQ) in populateDependencyMatrix()
H A DLoopDistribute.cpp618 using Dependence = MemoryDepChecker::Dependence; typedef in __anon51f880570111::MemoryInstructionDependences
635 const SmallVectorImpl<Dependence> &Dependences) { in MemoryInstructionDependences()
H A DLoopLoadElimination.cpp194 if (Dep.Type == MemoryDepChecker::Dependence::Unknown) { in findStoreToLoadDependences()
/netbsd-src/external/bsd/libevent/dist/
H A Dwhatsnew-2.0.txt85 1) Dependence on the "current" event_base. In an application with
/netbsd-src/external/bsd/ntp/dist/sntp/libevent/
H A Dwhatsnew-2.0.txt85 1) Dependence on the "current" event_base. In an application with
/netbsd-src/external/gpl3/gcc/dist/gcc/doc/
H A Dtree-ssa.texi449 Control Dependence Graph. ACM Transactions on Programming Languages

12