167   uint64_t endOffset() const { return EndOffset; }  in endOffset()  function in __anon157c633c0111::Slice
190     if (endOffset() > RHS.endOffset())  in operator <()
207            beginOffset() == RHS.beginOffset() && endOffset() == RHS.endOffset();  in operator ==()
383   uint64_t endOffset() const { return EndOffset; }  in endOffset()  function in llvm::sroa::Partition
471                        [&](Slice *S) { return S->endOffset() <= P.EndOffset; });  in advance()
474                               return S->endOffset() == MaxSplitSliceEndOffset;  in advance()
479                               return S->endOffset() <= MaxSplitSliceEndOffset;  in advance()
498         if (S.isSplittable() && S.endOffset() > P.EndOffset) {  in advance()
501               std::max(S.endOffset(), MaxSplitSliceEndOffset);  in advance()
531     P.EndOffset = P.SI->endOffset();  in advance()
545           P.EndOffset = std::max(P.EndOffset, P.SJ->endOffset());  in advance()
562       P.EndOffset = std::max(P.EndOffset, P.SJ->endOffset());  in advance()
1100   OS << Indent << "[" << I->beginOffset() << "," << I->endOffset() << ")"  in printSlice()
1145     if (I->beginOffset() != B->beginOffset() || I->endOffset() != EndOffset)  in findCommonType()
1829       std::min(S.endOffset(), P.endOffset()) - P.beginOffset();  in isVectorPromotionViableForSlice()
1861     if (P.beginOffset() > S.beginOffset() || P.endOffset() < S.endOffset()) {  in isVectorPromotionViableForSlice()
1871     if (P.beginOffset() > S.beginOffset() || P.endOffset() < S.endOffset()) {  in isVectorPromotionViableForSlice()
1920         S.endOffset() == P.endOffset()) {  in isVectorPromotionViable()
2018   uint64_t RelEnd = S.endOffset() - AllocBeginOffset;  in isIntegerWideningViableForSlice()
2367     EndOffset = I->endOffset();  in visit()
3842       if (!S.isSplittable() || S.endOffset() <= P.endOffset()) {  in presplitLoadsAndStores()
3853       assert(P.endOffset() > S.beginOffset() &&  in presplitLoadsAndStores()
3898       Offsets.Splits.push_back(P.endOffset() - S.beginOffset());  in presplitLoadsAndStores()
3919       if (S->endOffset() > P.endOffset())  in presplitLoadsAndStores()
3920         Offsets.Splits.push_back(P.endOffset() - Offsets.S->beginOffset());  in presplitLoadsAndStores()
4012     assert(LoadSize == Offsets.S->endOffset() - Offsets.S->beginOffset() &&  in presplitLoadsAndStores()
4049                         << ", " << NewSlices.back().endOffset()  in presplitLoadsAndStores()
4137     assert(StoreSize == Offsets.S->endOffset() - Offsets.S->beginOffset() &&  in presplitLoadsAndStores()
4203                         << ", " << NewSlices.back().endOffset()  in presplitLoadsAndStores()
4293       findCommonType(P.begin(), P.end(), P.endOffset());  in rewritePartition()
4350                     << "[" << P.beginOffset() << "," << P.endOffset()  in rewritePartition()
4362                                P.endOffset(), IsIntegerPromotable, VecTy,  in rewritePartition()
4465            O < S.endOffset() && O < AllocaSize; O++)  in splitAlloca()
4473           (S.endOffset() > AllocaSize || SplittableOffset[S.endOffset()]))  in splitAlloca()
4490       if (S.beginOffset() == 0 && S.endOffset() >= AllocaSize)  in splitAlloca()