Lines Matching defs:Buckets

270     bool chainCommoning(Loop *L, SmallVector<Bucket, 16> &Buckets);
289     /// Add a candidate to candidates \p Buckets if diff between candidate and
290     /// one base in \p Buckets matches \p isValidDiff.
292                          SmallVector<Bucket, 16> &Buckets,
296     /// Prepare all candidates in \p Buckets for update form.
297     bool updateFormPrep(Loop *L, SmallVector<Bucket, 16> &Buckets);
299     /// Prepare all candidates in \p Buckets for displacement form, now for
301     bool dispFormPrep(Loop *L, SmallVector<Bucket, 16> &Buckets, PrepForm Form);
529                                           SmallVector<Bucket, 16> &Buckets) {
532   if (Buckets.empty())
537   for (auto &Bucket : Buckets) {
836     Instruction *MemI, const SCEV *LSCEV, SmallVector<Bucket, 16> &Buckets,
843   for (auto &B : Buckets) {
856     if (Buckets.size() == MaxCandidateNum) {
861     Buckets.push_back(Bucket(LSCEV, MemI));
870   SmallVector<Bucket, 16> Buckets;
896         addOneCandidate(&J, LSCEV, Buckets, isValidDiff, MaxCandidateNum);
898   return Buckets;
1097                                        SmallVector<Bucket, 16> &Buckets) {
1099   if (Buckets.empty())
1102   for (auto &Bucket : Buckets)
1115                                         SmallVector<Bucket, 16> &Buckets,
1119   if (Buckets.empty())
1123   for (auto &Bucket : Buckets) {
1489   SmallVector<Bucket, 16> Buckets =
1494   if (!Buckets.empty())
1495     MadeChange |= chainCommoning(L, Buckets);