| /openbsd/gnu/llvm/clang/include/clang/AST/ |
| H A D | DependenceFlags.h | 106 class Dependence { in LLVM_COMMON_DEPENDENCE()
145 Dependence() : V(None) {} in LLVM_COMMON_DEPENDENCE()
147 Dependence(TypeDependence D) in LLVM_COMMON_DEPENDENCE()
154 Dependence(ExprDependence D) in LLVM_COMMON_DEPENDENCE()
180 Dependence syntactic() { in LLVM_COMMON_DEPENDENCE()
181 Dependence Result = *this; in LLVM_COMMON_DEPENDENCE()
188 Dependence semantic() { in LLVM_COMMON_DEPENDENCE()
189 Dependence Result = *this; in LLVM_COMMON_DEPENDENCE()
254 return Dependence(D).expr(); in toExprDependenceAsWritten()
260 return Dependence(D).expr(); in toExprDependence()
[all …]
|
| H A D | Type.h | 1585 unsigned Dependence : llvm::BitWidth<TypeDependence>;
1950 Type(TypeClass tc, QualType canon, TypeDependence Dependence)
1958 TypeBits.Dependence = static_cast<unsigned>(Dependence);
1969 TypeBits.Dependence = static_cast<unsigned>(D);
2298 return static_cast<TypeDependence>(TypeBits.Dependence);
3932 TypeDependence Dependence, ExtInfo Info)
3933 : Type(tc, Canonical, Dependence), ResultType(res) {
5595 QualType Canonical, TypeDependence Dependence)
5596 : Type(tc, Canonical, Dependence) {
|
| /openbsd/gnu/llvm/llvm/include/llvm/Analysis/ |
| H A D | DependenceAnalysis.h | 71 class Dependence {
73 Dependence(Dependence &&) = default;
74 Dependence &operator=(Dependence &&) = default;
77 Dependence(Instruction *Source, Instruction *Destination) in Dependence() function
79 virtual ~Dependence() = default;
196 const Dependence *getNextSuccessor() const { return NextSuccessor; } in getNextSuccessor()
214 const Dependence *NextPredecessor = nullptr, *NextSuccessor = nullptr;
226 class FullDependence final : public Dependence {
309 std::unique_ptr<Dependence> depends(Instruction *Src,
353 const SCEV *getSplitIteration(const Dependence &Dep, unsigned Level);
[all …]
|
| H A D | LoopAccessAnalysis.h | 108 struct Dependence { struct
147 Dependence(unsigned Source, unsigned Destination, DepType Type) in Dependence() argument
221 const SmallVectorImpl<Dependence> *getDependences() const { in getDependences()
303 SmallVector<Dependence, 8> Dependences;
317 Dependence::DepType isDependent(const MemAccessInfo &A, unsigned AIdx,
840 inline Instruction *MemoryDepChecker::Dependence::getSource( in getSource()
845 inline Instruction *MemoryDepChecker::Dependence::getDestination( in getDestination()
|
| H A D | DDG.h | 257 using DependenceList = SmallVector<std::unique_ptr<Dependence>, 1>;
470 interleaveComma(Deps, OS, [&](const std::unique_ptr<Dependence> &D) { in getDependenceString()
|
| /openbsd/gnu/llvm/llvm/lib/Analysis/ |
| H A D | DependenceAnalysis.cpp | 230 bool Dependence::isInput() const { in isInput()
236 bool Dependence::isOutput() const { in isOutput()
242 bool Dependence::isFlow() const { in isFlow()
248 bool Dependence::isAnti() const { in isAnti()
315 if (Direction & Dependence::DVEntry::LT) in normalize()
317 if (Direction & Dependence::DVEntry::GT) in normalize()
2711 case Dependence::DVEntry::LT: in exploreDirections()
2714 case Dependence::DVEntry::EQ: in exploreDirections()
2717 case Dependence::DVEntry::GT: in exploreDirections()
2720 case Dependence::DVEntry::ALL: in exploreDirections()
[all …]
|
| H A D | LoopAccessAnalysis.cpp | 1843 return Dependence::NoDep; in isDependent()
1848 return Dependence::Unknown; in isDependent()
1882 return Dependence::Unknown; in isDependent()
1894 return Dependence::NoDep; in isDependent()
1900 return Dependence::Unknown; in isDependent()
1910 return Dependence::NoDep; in isDependent()
1924 return Dependence::Forward; in isDependent()
1933 return Dependence::Unknown; in isDependent()
1941 return Dependence::Unknown; in isDependent()
1983 return Dependence::Backward; in isDependent()
[all …]
|
| H A D | DependenceGraphBuilder.cpp | 344 if (D->getDirection(Level) == Dependence::DVEntry::EQ) in createMemoryDependencyEdges()
346 else if (D->getDirection(Level) == Dependence::DVEntry::GT) { in createMemoryDependencyEdges()
351 } else if (D->getDirection(Level) == Dependence::DVEntry::LT) in createMemoryDependencyEdges()
|
| H A D | LoopCacheAnalysis.cpp | 226 std::unique_ptr<Dependence> D = in hasTemporalReuse()
|
| /openbsd/gnu/llvm/llvm/lib/Transforms/Utils/ |
| H A D | LoopUnrollAndJam.cpp | 648 bool Sequentialized, Dependence *D) { in preservesForwardDependence()
654 if (JammedDir == Dependence::DVEntry::LT) in preservesForwardDependence()
657 if (JammedDir & Dependence::DVEntry::GT) in preservesForwardDependence()
666 bool Sequentialized, Dependence *D) { in preservesBackwardDependence()
671 if (JammedDir == Dependence::DVEntry::GT) in preservesBackwardDependence()
674 if (JammedDir & Dependence::DVEntry::LT) in preservesBackwardDependence()
712 std::unique_ptr<Dependence> D = DI.depends(Src, Dst, true); in checkDependency()
729 if (!(D->getDirection(CurLoopDepth) & Dependence::DVEntry::EQ)) in checkDependency()
737 if (UnrollDirection == Dependence::DVEntry::EQ) in checkDependency()
740 if (UnrollDirection & Dependence::DVEntry::LT && in checkDependency()
[all …]
|
| /openbsd/gnu/llvm/llvm/docs/DependenceGraphs/ |
| H A D | index.rst | 2 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…
|
| /openbsd/gnu/llvm/llvm/lib/CodeGen/ |
| H A D | ImplicitNullChecks.cpp | 212 MachineBasicBlock *NullSucc, MachineInstr *&Dependence);
514 MachineInstr *&Dependence) { in canHoistInst() argument
520 Dependence = nullptr; in canHoistInst()
545 Dependence = DependenceMI; in canHoistInst()
682 MachineInstr *Dependence; in analyzeBlockForNullChecks() local
687 canHoistInst(&MI, InstsSeenSoFar, NullSucc, Dependence)) { in analyzeBlockForNullChecks()
689 NullSucc, Dependence); in analyzeBlockForNullChecks()
|
| /openbsd/gnu/llvm/llvm/lib/Target/Hexagon/ |
| H A D | HexagonVLIWPacketizer.cpp | 1034 Dependence = false; in initPacketizerState()
1342 if (Dependence) in isLegalToPacketizeTogether()
1350 if (Dependence) in isLegalToPacketizeTogether()
1357 if (Dependence) in isLegalToPacketizeTogether()
1376 Dependence = true; in isLegalToPacketizeTogether()
1389 Dependence = true; in isLegalToPacketizeTogether()
1395 Dependence = true; in isLegalToPacketizeTogether()
1401 if (Dependence) in isLegalToPacketizeTogether()
1490 Dependence = true; in isLegalToPacketizeTogether()
1635 Dependence = true; in isLegalToPacketizeTogether()
[all …]
|
| H A D | HexagonVLIWPacketizer.h | 45 bool Dependence; variable
|
| /openbsd/gnu/llvm/llvm/docs/ |
| H A D | Reference.rst | 197 :doc:`Dependence Graphs <DependenceGraphs/index>`
199 the DDG (Data Dependence Graph).
|
| H A D | Passes.rst | 88 ``-da``: Dependence Analysis
91 Dependence analysis framework, which is used to detect dependences in memory
247 ``-memdep``: Memory Dependence Analysis
847 :ref:`Dependence Analysis <passes-da>` for proving the transformations are safe.
|
| H A D | AliasAnalysis.rst | 675 Memory Dependence Analysis
685 using the Memory Dependence Analysis interface instead. MemDep is a lazy,
|
| H A D | WritingAnLLVMPass.rst | 1053 Memory Dependence Analysis
1086 Memory Dependence Analysis
1127 Memory Dependence Analysis
|
| H A D | MemorySSA.rst | 493 …ers' Meeting: S. Baziotis & S. Moll - Finding Your Way Around the LLVM Dependence Analysis Zoo <ht…
|
| H A D | SymbolizerMarkupFormat.rst | 64 Dependence on Build IDs
|
| H A D | ConvergenceAndUniformity.rst | 269 Dependence on Cycles Headers
|
| /openbsd/gnu/llvm/llvm/lib/Transforms/Scalar/ |
| H A D | LoopDistribute.cpp | 614 using Dependence = MemoryDepChecker::Dependence; typedef in __anon15fb75190111::MemoryInstructionDependences
631 const SmallVectorImpl<Dependence> &Dependences) { in MemoryInstructionDependences()
|
| H A D | LoopInterchange.cpp | 147 if (Dir == Dependence::DVEntry::LT || in populateDependencyMatrix()
148 Dir == Dependence::DVEntry::LE) in populateDependencyMatrix()
150 else if (Dir == Dependence::DVEntry::GT || in populateDependencyMatrix()
151 Dir == Dependence::DVEntry::GE) in populateDependencyMatrix()
153 else if (Dir == Dependence::DVEntry::EQ) in populateDependencyMatrix()
|
| H A D | LoopLoadElimination.cpp | 192 if (Dep.Type == MemoryDepChecker::Dependence::Unknown) { in findStoreToLoadDependences()
|
| /openbsd/gnu/gcc/gcc/doc/ |
| H A D | tree-ssa.texi | 1198 Control Dependence Graph. ACM Transactions on Programming Languages
|