539   uint64_t endOffset() const { return EndOffset; }  in endOffset()  function in __anondf5662880411::Slice
562     if (endOffset() > RHS.endOffset())  in operator <()
579            beginOffset() == RHS.beginOffset() && endOffset() == RHS.endOffset();  in operator ==()
753   uint64_t endOffset() const { return EndOffset; }  in endOffset()  function in __anondf5662880411::Partition
843                        [&](Slice *S) { return S->endOffset() <= P.EndOffset; });  in advance()
846                               return S->endOffset() == MaxSplitSliceEndOffset;  in advance()
851                               return S->endOffset() <= MaxSplitSliceEndOffset;  in advance()
870         if (S.isSplittable() && S.endOffset() > P.EndOffset) {  in advance()
873               std::max(S.endOffset(), MaxSplitSliceEndOffset);  in advance()
903     P.EndOffset = P.SI->endOffset();  in advance()
917           P.EndOffset = std::max(P.EndOffset, P.SJ->endOffset());  in advance()
934       P.EndOffset = std::max(P.EndOffset, P.SJ->endOffset());  in advance()
1430   OS << Indent << "[" << I->beginOffset() << "," << I->endOffset() << ")"  in printSlice()
1475     if (I->beginOffset() != B->beginOffset() || I->endOffset() != EndOffset)  in findCommonType()
2033   uint64_t EndOffset = std::min(S.endOffset(), P.endOffset()) - P.beginOffset();  in isVectorPromotionViableForSlice()
2065     if (P.beginOffset() > S.beginOffset() || P.endOffset() < S.endOffset()) {  in isVectorPromotionViableForSlice()
2078     if (P.beginOffset() > S.beginOffset() || P.endOffset() < S.endOffset()) {  in isVectorPromotionViableForSlice()
2307                                   S.endOffset() != P.endOffset())) {  in isVectorPromotionViable()
2314     if (S.beginOffset() == P.beginOffset() && S.endOffset() == P.endOffset())  in isVectorPromotionViable()
2344   uint64_t RelEnd = S.endOffset() - AllocBeginOffset;  in isIntegerWideningViableForSlice()
2707     EndOffset = I->endOffset();  in visit()
4342       if (!S.isSplittable() || S.endOffset() <= P.endOffset()) {  in presplitLoadsAndStores()
4353       assert(P.endOffset() > S.beginOffset() &&  in presplitLoadsAndStores()
4398       Offsets.Splits.push_back(P.endOffset() - S.beginOffset());  in presplitLoadsAndStores()
4419       if (S->endOffset() > P.endOffset())  in presplitLoadsAndStores()
4420         Offsets.Splits.push_back(P.endOffset() - Offsets.S->beginOffset());  in presplitLoadsAndStores()
4507     unsigned SliceSize = Offsets.S->endOffset() - Offsets.S->beginOffset();  in presplitLoadsAndStores()
4548                         << ", " << NewSlices.back().endOffset()  in presplitLoadsAndStores()
4641     assert(StoreSize == Offsets.S->endOffset() - Offsets.S->beginOffset() &&  in presplitLoadsAndStores()
4707                         << ", " << NewSlices.back().endOffset()  in presplitLoadsAndStores()
4798       findCommonType(P.begin(), P.end(), P.endOffset());  in rewritePartition()
4874                     << "," << P.endOffset() << ") to: " << *NewAI << "\n");  in rewritePartition()
4885                                P.endOffset(), IsIntegerPromotable, VecTy,  in rewritePartition()
5233            O < S.endOffset() && O < AllocaSize; O++)  in splitAlloca()
5241           (S.endOffset() > AllocaSize || SplittableOffset[S.endOffset()]))  in splitAlloca()
5257       if (S.beginOffset() == 0 && S.endOffset() >= AllocaSize)  in splitAlloca()