Lines Matching refs:InsertRes
104 /// split the node, populate InsertRes with info about the split, and return
106 bool DoInsertion(unsigned FileIndex, int Delta, InsertResult *InsertRes);
108 void DoSplit(InsertResult &InsertRes);
180 /// split the node, populate InsertRes with info about the split, and return
183 InsertResult *InsertRes) {
218 assert(InsertRes && "No result location specified");
219 DoSplit(*InsertRes);
221 if (InsertRes->Split.FileLoc > FileIndex)
222 InsertRes->LHS->DoInsertion(FileIndex, Delta, 0 /*can't fail*/);
224 InsertRes->RHS->DoInsertion(FileIndex, Delta, 0 /*can't fail*/);
230 if (!IN->Children[i]->DoInsertion(FileIndex, Delta, InsertRes))
242 IN->Children[i] = InsertRes->LHS;
243 IN->Children[i+1] = InsertRes->RHS;
247 Values[i] = InsertRes->Split;
255 IN->Children[i] = InsertRes->LHS;
256 DeltaTreeNode *SubRHS = InsertRes->RHS;
257 SourceDelta SubSplit = InsertRes->Split;
260 DoSplit(*InsertRes);
264 if (SubSplit.FileLoc < InsertRes->Split.FileLoc)
265 InsertSide = cast<DeltaTreeInteriorNode>(InsertRes->LHS);
267 InsertSide = cast<DeltaTreeInteriorNode>(InsertRes->RHS);
295 /// Return the pieces in InsertRes.
296 void DeltaTreeNode::DoSplit(InsertResult &InsertRes) {
329 InsertRes.LHS = this;
330 InsertRes.RHS = NewNode;
331 InsertRes.Split = Values[WidthFactor-1];
458 DeltaTreeNode::InsertResult InsertRes;
459 if (MyRoot->DoInsertion(FileIndex, Delta, &InsertRes)) {
460 Root = MyRoot = new DeltaTreeInteriorNode(InsertRes);
