110     RopePieceBTreeNode *split(unsigned Offset);
118     RopePieceBTreeNode *insert(unsigned Offset, const RopePiece &R);
122     void erase(unsigned Offset, unsigned NumBytes);
210     RopePieceBTreeNode *split(unsigned Offset);
218     RopePieceBTreeNode *insert(unsigned Offset, const RopePiece &R);
222     void erase(unsigned Offset, unsigned NumBytes);
237 RopePieceBTreeNode *RopePieceBTreeLeaf::split(unsigned Offset) {  in split()  argument
240   if (Offset == 0 || Offset == size()) {  in split()
248   while (Offset >= PieceOffs+Pieces[i].size()) {  in split()
255   if (PieceOffs == Offset)  in split()
260   unsigned IntraPieceOffset = Offset-PieceOffs;  in split()
269   return insert(Offset, Tail);  in split()
277 RopePieceBTreeNode *RopePieceBTreeLeaf::insert(unsigned Offset,  in insert()  argument
284     if (Offset == size()) {  in insert()
289       for (; Offset > SlotOffs; ++i)  in insert()
291       assert(SlotOffs == Offset && "Split didn't occur before insertion!");  in insert()
329   if (this->size() >= Offset)  in insert()
330     this->insert(Offset, R);  in insert()
332     NewNode->insert(Offset - this->size(), R);  in insert()
338 void RopePieceBTreeLeaf::erase(unsigned Offset, unsigned NumBytes) {  in erase()  argument
343   for (; Offset > PieceOffs; ++i)  in erase()
345   assert(PieceOffs == Offset && "Split didn't occur before erase!");  in erase()
351   for (; Offset+NumBytes > PieceOffs+getPiece(i).size(); ++i)  in erase()
355   if (Offset+NumBytes == PieceOffs+getPiece(i).size()) {  in erase()
371     unsigned CoverBytes = PieceOffs-Offset;  in erase()
447     RopePieceBTreeNode *split(unsigned Offset);
455     RopePieceBTreeNode *insert(unsigned Offset, const RopePiece &R);
463     void erase(unsigned Offset, unsigned NumBytes);
478 RopePieceBTreeNode *RopePieceBTreeInterior::split(unsigned Offset) {  in split()  argument
480   if (Offset == 0 || Offset == size())  in split()
485   for (; Offset >= ChildOffset+getChild(i)->size(); ++i)  in split()
489   if (ChildOffset == Offset)  in split()
493   if (RopePieceBTreeNode *RHS = getChild(i)->split(Offset-ChildOffset))  in split()
504 RopePieceBTreeNode *RopePieceBTreeInterior::insert(unsigned Offset,  in insert()  argument
511   if (Offset == size()) {  in insert()
516     for (; Offset > ChildOffs+getChild(i)->size(); ++i)  in insert()
523   if (RopePieceBTreeNode *RHS = getChild(i)->insert(Offset-ChildOffs, R))  in insert()
573 void RopePieceBTreeInterior::erase(unsigned Offset, unsigned NumBytes) {  in erase()  argument
579   for (; Offset >= getChild(i)->size(); ++i)  in erase()
580     Offset -= getChild(i)->size();  in erase()
589     if (Offset+NumBytes < CurChild->size()) {  in erase()
590       CurChild->erase(Offset, NumBytes);  in erase()
596     if (Offset) {  in erase()
597       unsigned BytesFromChild = CurChild->size()-Offset;  in erase()
598       CurChild->erase(Offset, BytesFromChild);  in erase()
601       Offset = 0;  in erase()
634 RopePieceBTreeNode *RopePieceBTreeNode::split(unsigned Offset) {  in split()  argument
635   assert(Offset <= size() && "Invalid offset to split!");  in split()
637     return Leaf->split(Offset);  in split()
638   return cast<RopePieceBTreeInterior>(this)->split(Offset);  in split()
647 RopePieceBTreeNode *RopePieceBTreeNode::insert(unsigned Offset,  in insert()  argument
649   assert(Offset <= size() && "Invalid offset to insert!");  in insert()
651     return Leaf->insert(Offset, R);  in insert()
652   return cast<RopePieceBTreeInterior>(this)->insert(Offset, R);  in insert()
657 void RopePieceBTreeNode::erase(unsigned Offset, unsigned NumBytes) {  in erase()  argument
658   assert(Offset+NumBytes <= size() && "Invalid offset to erase!");  in erase()
660     return Leaf->erase(Offset, NumBytes);  in erase()
661   return cast<RopePieceBTreeInterior>(this)->erase(Offset, NumBytes);  in erase()
748 void RopePieceBTree::insert(unsigned Offset, const RopePiece &R) {  in insert()  argument
750   if (RopePieceBTreeNode *RHS = getRoot(Root)->split(Offset))  in insert()
754   if (RopePieceBTreeNode *RHS = getRoot(Root)->insert(Offset, R))  in insert()
758 void RopePieceBTree::erase(unsigned Offset, unsigned NumBytes) {  in erase()  argument
760   if (RopePieceBTreeNode *RHS = getRoot(Root)->split(Offset))  in erase()
764   getRoot(Root)->erase(Offset, NumBytes);  in erase()