178   uint64_t endOffset() const { return EndOffset; }  in endOffset()  function in __anon241d746d0111::Slice
201     if (endOffset() > RHS.endOffset())  in operator <()
218            beginOffset() == RHS.beginOffset() && endOffset() == RHS.endOffset();  in operator ==()
393   uint64_t endOffset() const { return EndOffset; }  in endOffset()  function in llvm::sroa::Partition
482                                              return S->endOffset() <=  in advance()
488                               return S->endOffset() == MaxSplitSliceEndOffset;  in advance()
493                               return S->endOffset() <= MaxSplitSliceEndOffset;  in advance()
512         if (S.isSplittable() && S.endOffset() > P.EndOffset) {  in advance()
515               std::max(S.endOffset(), MaxSplitSliceEndOffset);  in advance()
545     P.EndOffset = P.SI->endOffset();  in advance()
559           P.EndOffset = std::max(P.EndOffset, P.SJ->endOffset());  in advance()
576       P.EndOffset = std::max(P.EndOffset, P.SJ->endOffset());  in advance()
1076   OS << Indent << "[" << I->beginOffset() << "," << I->endOffset() << ")"  in printSlice()
1121     if (I->beginOffset() != B->beginOffset() || I->endOffset() != EndOffset)  in findCommonType()
1787       std::min(S.endOffset(), P.endOffset()) - P.beginOffset();  in isVectorPromotionViableForSlice()
1818     if (P.beginOffset() > S.beginOffset() || P.endOffset() < S.endOffset()) {  in isVectorPromotionViableForSlice()
1828     if (P.beginOffset() > S.beginOffset() || P.endOffset() < S.endOffset()) {  in isVectorPromotionViableForSlice()
1868         S.endOffset() == P.endOffset()) {  in isVectorPromotionViable()
1966   uint64_t RelEnd = S.endOffset() - AllocBeginOffset;  in isIntegerWideningViableForSlice()
2309     EndOffset = I->endOffset();  in visit()
3601       if (!S.isSplittable() || S.endOffset() <= P.endOffset()) {  in presplitLoadsAndStores()
3612       assert(P.endOffset() > S.beginOffset() &&  in presplitLoadsAndStores()
3657       Offsets.Splits.push_back(P.endOffset() - S.beginOffset());  in presplitLoadsAndStores()
3678       if (S->endOffset() > P.endOffset())  in presplitLoadsAndStores()
3679         Offsets.Splits.push_back(P.endOffset() - Offsets.S->beginOffset());  in presplitLoadsAndStores()
3780     assert(LoadSize == Offsets.S->endOffset() - Offsets.S->beginOffset() &&  in presplitLoadsAndStores()
3816                         << ", " << NewSlices.back().endOffset()  in presplitLoadsAndStores()
3902     assert(StoreSize == Offsets.S->endOffset() - Offsets.S->beginOffset() &&  in presplitLoadsAndStores()
3962                         << ", " << NewSlices.back().endOffset()  in presplitLoadsAndStores()
4054   if (Type *CommonUseTy = findCommonType(P.begin(), P.end(), P.endOffset()))  in rewritePartition()
4110                     << "[" << P.beginOffset() << "," << P.endOffset()  in rewritePartition()
4122                                P.endOffset(), IsIntegerPromotable, VecTy,  in rewritePartition()
4217            O < S.endOffset() && O < AllocaSize; O++)  in splitAlloca()
4225           (S.endOffset() > AllocaSize || SplittableOffset[S.endOffset()]))  in splitAlloca()
4242       if (S.beginOffset() == 0 && S.endOffset() >= AllocaSize)  in splitAlloca()