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

  /src/external/apache2/llvm/dist/llvm/lib/Analysis/
LoopAccessAnalysis.cpp 110 /// This enables versioning on the strides of symbolically striding memory
193 const ValueToValueMap &Strides,
196 const SCEV *Sc = replaceSymbolicStrideSCEV(PSE, Strides, Ptr);
539 const ValueToValueMap &Strides,
551 Loop *TheLoop, const ValueToValueMap &Strides,
624 const ValueToValueMap &Strides, Value *Ptr,
626 const SCEV *PtrScev = replaceSymbolicStrideSCEV(PSE, Strides, Ptr);
645 const ValueToValueMap &Strides, Value *Ptr, Loop *L) {
650 int64_t Stride = getPtrStride(PSE, Ptr, L, Strides);
1455 const ValueToValueMap &Strides) {
    [all...]
VectorUtils.cpp 193 /// strides "a[i*stride]". Returns the symbolic stride, or null otherwise.
949 const ValueToValueMap &Strides) {
974 int64_t Stride = getPtrStride(PSE, Ptr, TheLoop, Strides,
977 const SCEV *Scev = replaceSymbolicStrideSCEV(PSE, Strides, Ptr);
1023 const ValueToValueMap &Strides = LAI->getSymbolicStrides();
1027 collectConstStrideAccesses(AccessStrideInfo, Strides);
1222 if (!getPtrStride(PSE, FirstMemberPtr, TheLoop, Strides, /*Assume=*/false,
1233 if (!getPtrStride(PSE, LastMemberPtr, TheLoop, Strides, /*Assume=*/false,
ScalarEvolution.cpp 11318 // strides if we can prove that the loop is not an infinite loop with side
11625 SmallVectorImpl<const SCEV *> &Strides;
11628 : SE(SE), Strides(S) {}
11632 Strides.push_back(AR->getStepRecurrence(SE));
11743 /// 1) The strides of AddRec expressions.
11747 SmallVector<const SCEV *, 4> Strides;
11748 SCEVCollectStrides StrideCollector(*this, Strides);
11752 dbgs() << "Strides:\n";
11753 for (const SCEV *S : Strides)
11757 for (const SCEV *S : Strides) {
    [all...]
  /src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/
LoopAccessAnalysis.h 200 const ValueToValueMap &Strides);
321 const ValueToValueMap &Strides);
415 /// The method might also version the pointer stride according to \p Strides,
418 unsigned ASId, const ValueToValueMap &Strides,
570 /// If an access has a symbolic strides, this maps the pointer value to
610 /// Collect memory access with loop invariant strides.
644 /// If an access has a symbolic strides, this maps the pointer value to
648 /// Set of symbolic strides values.
VectorUtils.h 340 /// strides "a[i*stride]". Returns the symbolic stride, or null otherwise.
736 /// groups. Substitute symbolic strides using \p Strides.
793 /// by versioning strides of pointers).
865 const ValueToValueMap &Strides);
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Vectorize/
LoopVectorizationLegality.cpp 407 const ValueToValueMap &Strides =
415 int Stride = getPtrStride(PSE, Ptr, TheLoop, Strides, CanAddPredicate, false);
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/
LoopStrengthReduce.cpp 560 /// not include register uses implied by non-constant addrec strides.
1930 /// Interesting factors between use strides.
2432 // strides could be a legal scale.
2657 SmallSetVector<const SCEV *, 4> Strides;
2659 // Collect interesting types and strides.
2667 // Add strides for mentioned loops.
2673 Strides.insert(AR->getStepRecurrence(SE));
2681 // Compute interesting factors from the set of interesting strides.
2683 I = Strides.begin(), E = Strides.end(); I != E; ++I
    [all...]
  /src/external/apache2/llvm/dist/clang/lib/CodeGen/
CGOpenMPRuntime.cpp 7159 MapNonContiguousArrayTy Strides;
7184 NonContigInfo.Strides.append(CurInfo.NonContigInfo.Strides.begin(),
7185 CurInfo.NonContigInfo.Strides.end());
8205 CombinedInfo.NonContigInfo.Strides.push_back(CurStrides);
9253 CGF.EmitStoreOfScalar(NonContigInfo.Strides[L][RevIdx], StrideLVal);

Completed in 71 milliseconds