Lines Matching full:numbytes
116 /// erase - Remove NumBytes from this node at the specified offset. We are
118 void erase(unsigned Offset, unsigned NumBytes);
218 /// erase - Remove NumBytes from this node at the specified offset. We are
220 void erase(unsigned Offset, unsigned NumBytes);
334 /// erase - Remove NumBytes from this node at the specified offset. We are
336 void RopePieceBTreeLeaf::erase(unsigned Offset, unsigned NumBytes) {
347 // Figure out how many pieces completely cover 'NumBytes'. We want to remove
349 for (; Offset+NumBytes > PieceOffs+getPiece(i).size(); ++i)
353 if (Offset+NumBytes == PieceOffs+getPiece(i).size())
368 NumBytes -= CoverBytes;
373 if (NumBytes == 0) return;
377 assert(getPiece(StartPiece).size() > NumBytes);
378 Pieces[StartPiece].StartOffs += NumBytes;
380 // The size of this node just shrunk by NumBytes.
381 Size -= NumBytes;
454 /// erase - Remove NumBytes from this node at the specified offset. We are
456 void erase(unsigned Offset, unsigned NumBytes);
563 /// erase - Remove NumBytes from this node at the specified offset. We are
565 void RopePieceBTreeInterior::erase(unsigned Offset, unsigned NumBytes) {
566 // This will shrink this node by NumBytes.
567 Size -= NumBytes;
576 while (NumBytes) {
581 if (Offset+NumBytes < CurChild->size()) {
582 CurChild->erase(Offset, NumBytes);
591 NumBytes -= BytesFromChild;
600 NumBytes -= CurChild->size();
647 /// erase - Remove NumBytes from this node at the specified offset. We are
649 void RopePieceBTreeNode::erase(unsigned Offset, unsigned NumBytes) {
650 assert(Offset+NumBytes <= size() && "Invalid offset to erase!");
652 return Leaf->erase(Offset, NumBytes);
653 return cast<RopePieceBTreeInterior>(this)->erase(Offset, NumBytes);
749 void RopePieceBTree::erase(unsigned Offset, unsigned NumBytes) {
755 getRoot(Root)->erase(Offset, NumBytes);
