835         // If we've finished all splits, this is easy.  in advance()
3751     /// This method recursively splits an aggregate op (load or store) into
3752     /// scalar or vector ops. It splits recursively until it hits a single value
4315   // We need to accumulate the splits required of each load or store where we  in presplitLoadsAndStores()
4321     std::vector<uint64_t> Splits;  in presplitLoadsAndStores()  member
4395       assert(Offsets.Splits.empty() &&  in presplitLoadsAndStores()
4396              "Should not have splits the first time we see an instruction!");  in presplitLoadsAndStores()
4398       Offsets.Splits.push_back(P.endOffset() - S.beginOffset());  in presplitLoadsAndStores()
4411       assert(!Offsets.Splits.empty() &&  in presplitLoadsAndStores()
4412              "Cannot have an empty set of splits on the second partition!");  in presplitLoadsAndStores()
4413       assert(Offsets.Splits.back() ==  in presplitLoadsAndStores()
4420         Offsets.Splits.push_back(P.endOffset() - Offsets.S->beginOffset());  in presplitLoadsAndStores()
4425   // such loads and stores, we can only pre-split them if their splits exactly  in presplitLoadsAndStores()
4448     if (LoadOffsets.Splits == StoreOffsets.Splits)  in presplitLoadsAndStores()
4451     LLVM_DEBUG(dbgs() << "    Mismatched splits for load and store:\n"  in presplitLoadsAndStores()
4456     // with mismatched relative splits. Just give up on them  in presplitLoadsAndStores()
4493   // pre-split, and the specific splits needed for them. We actually do the  in presplitLoadsAndStores()
4522     uint64_t PartOffset = 0, PartSize = Offsets.Splits.front();  in presplitLoadsAndStores()
4523     int Idx = 0, Size = Offsets.Splits.size();  in presplitLoadsAndStores()
4551       // See if we've handled all the splits.  in presplitLoadsAndStores()
4556       PartOffset = Offsets.Splits[Idx];  in presplitLoadsAndStores()
4558       PartSize = (Idx < Size ? Offsets.Splits[Idx] : SliceSize) - PartOffset;  in presplitLoadsAndStores()
4582         uint64_t PartOffset = Idx == 0 ? 0 : Offsets.Splits[Idx - 1];  in presplitLoadsAndStores()
4657       assert(SplitLoads->size() == Offsets.Splits.size() + 1 &&  in presplitLoadsAndStores()
4658              "Too few split loads for the number of splits in the store!");  in presplitLoadsAndStores()
4663     uint64_t PartOffset = 0, PartSize = Offsets.Splits.front();  in presplitLoadsAndStores()
4664     int Idx = 0, Size = Offsets.Splits.size();  in presplitLoadsAndStores()
4713       // See if we've finished all the splits.  in presplitLoadsAndStores()
4718       PartOffset = Offsets.Splits[Idx];  in presplitLoadsAndStores()
4720       PartSize = (Idx < Size ? Offsets.Splits[Idx] : StoreSize) - PartOffset;  in presplitLoadsAndStores()
4745     // should handle the merging, and this uncovers SSA splits which is more  in presplitLoadsAndStores()
4747     // split and removed eventually, and the splits will be merged by any  in presplitLoadsAndStores()