Lines Matching refs:NumBytes

116     /// erase - Remove NumBytes from this node at the specified offset.  We are
118 void erase(unsigned Offset, unsigned NumBytes);
220 /// erase - Remove NumBytes from this node at the specified offset. We are
222 void erase(unsigned Offset, unsigned NumBytes);
337 /// erase - Remove NumBytes from this node at the specified offset. We are
339 void RopePieceBTreeLeaf::erase(unsigned Offset, unsigned NumBytes) {
350 // Figure out how many pieces completely cover 'NumBytes'. We want to remove
352 for (; Offset+NumBytes > PieceOffs+getPiece(i).size(); ++i)
356 if (Offset+NumBytes == PieceOffs+getPiece(i).size())
371 NumBytes -= CoverBytes;
376 if (NumBytes == 0) return;
380 assert(getPiece(StartPiece).size() > NumBytes);
381 Pieces[StartPiece].StartOffs += NumBytes;
383 // The size of this node just shrunk by NumBytes.
384 Size -= NumBytes;
457 /// erase - Remove NumBytes from this node at the specified offset. We are
459 void erase(unsigned Offset, unsigned NumBytes);
567 /// erase - Remove NumBytes from this node at the specified offset. We are
569 void RopePieceBTreeInterior::erase(unsigned Offset, unsigned NumBytes) {
570 // This will shrink this node by NumBytes.
571 Size -= NumBytes;
580 while (NumBytes) {
585 if (Offset+NumBytes < CurChild->size()) {
586 CurChild->erase(Offset, NumBytes);
595 NumBytes -= BytesFromChild;
604 NumBytes -= CurChild->size();
651 /// erase - Remove NumBytes from this node at the specified offset. We are
653 void RopePieceBTreeNode::erase(unsigned Offset, unsigned NumBytes) {
654 assert(Offset+NumBytes <= size() && "Invalid offset to erase!");
656 return Leaf->erase(Offset, NumBytes);
657 return cast<RopePieceBTreeInterior>(this)->erase(Offset, NumBytes);
753 void RopePieceBTree::erase(unsigned Offset, unsigned NumBytes) {
759 getRoot(Root)->erase(Offset, NumBytes);