Lines Matching defs:Stride

1491   int64_t Stride = StepVal / Size;
1497     return Stride;
1502     return Stride;
1511     return Stride;
1518       (Stride == 1 || Stride == -1))
1519     return Stride;
1527     return Stride;
1842 /// Check the dependence for two accesses with the same stride \p Stride.
1847 static bool areStridedAccessesIndependent(uint64_t Distance, uint64_t Stride,
1849   assert(Stride > 1 && "The stride must be greater than 1");
1875   return ScaledDist % Stride;
2148   // front needs TypeByteSize * Stride. Vectorizing the last iteration needs
2947   LLVM_DEBUG(dbgs() << "  Ptr: " << *Ptr << " Stride: " << *StrideExpr << "\n");
2954   // Avoid adding the "Stride == 1" predicate when we know that
2955   // Stride >= Trip-Count. Such a predicate will effectively optimize a single
2956   // or zero iteration loop, as Trip-Count <= Stride == 1.
2970   // The Stride can be positive/negative, so we sign extend Stride;
2984   // "Stride >= TripCount" is equivalent to checking:
2985   // Stride - MaxBTC> 0
2988         dbgs() << "LAA: Stride>=TripCount; No point in versioning as the "
2989                   "Stride==1 predicate will imply that the loop executes "