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

  /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/Analysis/
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,
  /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 44 milliseconds