| /llvm-project-15.0.7/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 …]
|
| /llvm-project-15.0.7/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;
184 const Dependence *getNextSuccessor() const { return NextSuccessor; } in getNextSuccessor()
200 const Dependence *NextPredecessor = nullptr, *NextSuccessor = nullptr;
212 class FullDependence final : public Dependence {
285 std::unique_ptr<Dependence> depends(Instruction *Src,
329 const SCEV *getSplitIteration(const Dependence &Dep, unsigned Level);
[all …]
|
| H A D | LoopAccessAnalysis.h | 107 struct Dependence { struct
146 Dependence(unsigned Source, unsigned Destination, DepType Type) in Dependence() argument
220 const SmallVectorImpl<Dependence> *getDependences() const { in getDependences()
302 SmallVector<Dependence, 8> Dependences;
316 Dependence::DepType isDependent(const MemAccessInfo &A, unsigned AIdx,
826 inline Instruction *MemoryDepChecker::Dependence::getSource( in getSource()
831 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()
|
| /llvm-project-15.0.7/llvm/lib/Analysis/ |
| H A D | DependenceAnalysis.cpp | 223 bool Dependence::isInput() const { in isInput()
229 bool Dependence::isOutput() const { in isOutput()
235 bool Dependence::isFlow() const { in isFlow()
241 bool Dependence::isAnti() const { in isAnti()
1633 NewDirection |= Dependence::DVEntry::EQ; in exactSIVtest()
1637 NewDirection |= Dependence::DVEntry::GT; in exactSIVtest()
2648 case Dependence::DVEntry::LT: in exploreDirections()
2651 case Dependence::DVEntry::EQ: in exploreDirections()
2654 case Dependence::DVEntry::GT: in exploreDirections()
2657 case Dependence::DVEntry::ALL: in exploreDirections()
[all …]
|
| H A D | LoopAccessAnalysis.cpp | 1790 return Dependence::NoDep; in isDependent()
1795 return Dependence::Unknown; in isDependent()
1828 return Dependence::Unknown; in isDependent()
1842 return Dependence::NoDep; in isDependent()
1846 return Dependence::Unknown; in isDependent()
1856 return Dependence::NoDep; in isDependent()
1870 return Dependence::Forward; in isDependent()
1879 return Dependence::Unknown; in isDependent()
1887 return Dependence::Unknown; in isDependent()
1929 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()
|
| /llvm-project-15.0.7/llvm/test/Analysis/DependenceAnalysis/ |
| H A D | Banerjee.ll | 18 ; CHECK: 'Dependence Analysis' for function 'banerjee0':
26 ; DELIN: 'Dependence Analysis' for function 'banerjee0':
78 ; CHECK: 'Dependence Analysis' for function 'banerjee1':
86 ; DELIN: 'Dependence Analysis' for function 'banerjee1':
153 ; CHECK: 'Dependence Analysis' for function 'banerjee2':
161 ; DELIN: 'Dependence Analysis' for function 'banerjee2':
212 ; CHECK: 'Dependence Analysis' for function 'banerjee3':
220 ; DELIN: 'Dependence Analysis' for function 'banerjee3':
271 ; CHECK: 'Dependence Analysis' for function 'banerjee4':
279 ; DELIN: 'Dependence Analysis' for function 'banerjee4':
[all …]
|
| H A D | SymbolicRDIV.ll | 19 ; CHECK: 'Dependence Analysis' for function 'symbolicrdiv0'
82 ; CHECK: 'Dependence Analysis' for function 'symbolicrdiv1'
147 ; CHECK: 'Dependence Analysis' for function 'symbolicrdiv2'
210 ; CHECK: 'Dependence Analysis' for function 'symbolicrdiv3'
271 ; CHECK: 'Dependence Analysis' for function 'symbolicrdiv4'
333 ; CHECK: 'Dependence Analysis' for function 'symbolicrdiv5'
395 ; CHECK: 'Dependence Analysis' for function 'symbolicrdiv6'
|
| H A D | MismatchingNestLevels.ll | 11 ; CHECK-LABEL: 'Dependence Analysis' for function 'test1':
56 ; CHECK-LABEL: 'Dependence Analysis' for function 'test2':
127 ; CHECK-LABEL: 'Dependence Analysis' for function 'test3':
|
| H A D | NonCanonicalizedSubscript.ll | 16 ; DELIN-LABEL: 'Dependence Analysis' for function 'i32_subscript'
51 ; DELIN-LABEL: 'Dependence Analysis' for function 'coupled_miv_type_mismatch'
|
| H A D | PR21585.ll | 28 ; the Dependence Analyzer attempted to zero extend a type to a smaller
|
| H A D | AA.ll | 4 ; CHECK-LABEL: 'Dependence Analysis' for function 'test_no_noalias'
|
| /llvm-project-15.0.7/llvm/lib/Transforms/Utils/ |
| H A D | LoopUnrollAndJam.cpp | 653 bool Sequentialized, Dependence *D) { in preservesForwardDependence()
659 if (JammedDir == Dependence::DVEntry::LT) in preservesForwardDependence()
662 if (JammedDir & Dependence::DVEntry::GT) in preservesForwardDependence()
671 bool Sequentialized, Dependence *D) { in preservesBackwardDependence()
676 if (JammedDir == Dependence::DVEntry::GT) in preservesBackwardDependence()
679 if (JammedDir & Dependence::DVEntry::LT) in preservesBackwardDependence()
717 std::unique_ptr<Dependence> D = DI.depends(Src, Dst, true); in checkDependency()
734 if (!(D->getDirection(CurLoopDepth) & Dependence::DVEntry::EQ)) in checkDependency()
742 if (UnrollDirection == Dependence::DVEntry::EQ) in checkDependency()
745 if (UnrollDirection & Dependence::DVEntry::LT && in checkDependency()
[all …]
|
| /llvm-project-15.0.7/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…
|
| /llvm-project-15.0.7/llvm/lib/CodeGen/ |
| H A D | ImplicitNullChecks.cpp | 214 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()
|
| /llvm-project-15.0.7/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
|
| /llvm-project-15.0.7/llvm/test/Transforms/LoopVectorize/ |
| H A D | memory-dep-remarks.ll | 40 ; // a) Dependence::NoDep
75 ; // b) Dependence::Forward
109 ; // c) Dependence::BackwardVectorizable
142 ; // d) Dependence::Backward
184 ; // e) Dependence::ForwardButPreventsForwarding
222 ; // f) Dependence::BackwardVectorizableButPreventsForwarding
262 ; // g) Dependence::Unknown
|
| H A D | memdep-fold-tail.ll | 11 ; Dependence distance here is 3 iterations.
|
| /llvm-project-15.0.7/llvm/docs/ |
| H A D | Reference.rst | 195 :doc:`Dependence Graphs <DependenceGraphs/index>`
197 the DDG (Data Dependence Graph).
|
| /llvm-project-15.0.7/llvm/test/Transforms/LoopInterchange/ |
| H A D | loop-interchange-optimization-remarks.ll | 63 ; CHECK-NEXT: Name: Dependence
123 ; CHECK-NEXT: Name: Dependence
242 ; CHECK-NEXT: Name: Dependence
|
| H A D | currentLimitation.ll | 23 ; CHECK: Name: Dependence
|
| /llvm-project-15.0.7/llvm/lib/Transforms/Scalar/ |
| H A D | LoopDistribute.cpp | 617 using Dependence = MemoryDepChecker::Dependence; typedef in __anon4e01e93c0111::MemoryInstructionDependences
634 const SmallVectorImpl<Dependence> &Dependences) { in MemoryInstructionDependences()
|
| H A D | LoopInterchange.cpp | 153 if (Dir == Dependence::DVEntry::LT || in populateDependencyMatrix()
154 Dir == Dependence::DVEntry::LE) in populateDependencyMatrix()
156 else if (Dir == Dependence::DVEntry::GT || in populateDependencyMatrix()
157 Dir == Dependence::DVEntry::GE) in populateDependencyMatrix()
159 else if (Dir == Dependence::DVEntry::EQ) in populateDependencyMatrix()
|