HomeSort by: relevance | last modified time | path
    Searched refs:LAA (Results 1 - 4 of 4) sorted by relevancy

  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/
LoopLoadElimination.cpp 174 /// Note that no candidate is returned if LAA has failed to analyze the loop
243 /// Here, we rely on LAA to include the relevant loop-independent dependences.
244 /// LAA is known to omit these in the very simple case when the read and the
247 /// However, we know that this is not the case here, i.e. we can rely on LAA
256 /// LAA will perform dependence analysis here because there are two
661 auto &LAA = getAnalysis<LoopAccessLegacyAnalysis>();
672 [&LAA](Loop &L) -> const LoopAccessInfo & { return LAA.getInfo(&L); });
LoopDistribute.cpp 1019 auto *LAA = &getAnalysis<LoopAccessLegacyAnalysis>();
1024 [&](Loop &L) -> const LoopAccessInfo & { return LAA->getInfo(&L); };
  /src/external/apache2/llvm/dist/llvm/lib/Analysis/
LoopAccessAnalysis.cpp 166 LLVM_DEBUG(dbgs() << "LAA: Replacing SCEV: " << *OrigSCEV
693 LLVM_DEBUG(dbgs() << "LAA: Found a runtime check ptr:" << *Ptr << '\n');
759 LLVM_DEBUG(dbgs() << "LAA: Can't find bounds for ptr:"
821 dbgs() << "LAA: Runtime check would require comparison between"
831 LLVM_DEBUG(dbgs() << "LAA: We need to do " << RtCheck.getNumberOfChecks()
850 LLVM_DEBUG(dbgs() << "LAA: Processing memory accesses...\n");
852 LLVM_DEBUG(dbgs() << "LAA: Accesses(" << Accesses.size() << "):\n");
1026 LLVM_DEBUG(dbgs() << "LAA: Bad stride - Not a pointer to a scalar type"
1038 LLVM_DEBUG(dbgs() << "LAA: Bad stride - Not an AddRecExpr pointer " << *Ptr
1045 LLVM_DEBUG(dbgs() << "LAA: Bad stride - Not striding over innermost loop
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Vectorize/
LoopVectorize.cpp 2190 auto *LAA = &getAnalysis<LoopAccessLegacyAnalysis>();
2196 [&](Loop &L) -> const LoopAccessInfo & { return LAA->getInfo(&L); };
5697 // Get the maximum safe dependence distance in bits computed by LAA.

Completed in 30 milliseconds