174   if (DeltaTreeInteriorNode *IN = dyn_cast<DeltaTreeInteriorNode>(this))  in RecomputeFullDeltaLocally()  local
176       NewFullDelta += IN->getChild(i)->getFullDelta();  in RecomputeFullDeltaLocally()
231   DeltaTreeInteriorNode *IN = cast<DeltaTreeInteriorNode>(this);  in DoInsertion()  local
232   if (!IN->Children[i]->DoInsertion(FileIndex, Delta, InsertRes))  in DoInsertion()
242       memmove(&IN->Children[i+2], &IN->Children[i+1],  in DoInsertion()
243               (e-i)*sizeof(IN->Children[0]));  in DoInsertion()
244     IN->Children[i] = InsertRes->LHS;  in DoInsertion()
245     IN->Children[i+1] = InsertRes->RHS;  in DoInsertion()
257   IN->Children[i] = InsertRes->LHS;  in DoInsertion()
283             (e-i)*sizeof(IN->Children[0]));  in DoInsertion()
308   if (DeltaTreeInteriorNode *IN = dyn_cast<DeltaTreeInteriorNode>(this)) {  in DoSplit()  local
312     memcpy(&New->Children[0], &IN->Children[WidthFactor],  in DoSplit()
313            WidthFactor*sizeof(IN->Children[0]));  in DoSplit()
348   const DeltaTreeInteriorNode *IN = dyn_cast<DeltaTreeInteriorNode>(N);  in VerifyTree()  local
349   if (IN == 0) {  in VerifyTree()
365   for (unsigned i = 0, e = IN->getNumValuesUsed(); i != e; ++i) {  in VerifyTree()
367     const DeltaTreeNode *IChild = IN->getChild(i);  in VerifyTree()
369       assert(IN->getValue(i-1).FileLoc < IVal.FileLoc);  in VerifyTree()
378     assert(IN->getChild(i+1)->getValue(0).FileLoc > IVal.FileLoc);  in VerifyTree()
382   FullDelta += IN->getChild(IN->getNumValuesUsed())->getFullDelta();  in VerifyTree()
431     const DeltaTreeInteriorNode *IN = dyn_cast<DeltaTreeInteriorNode>(Node);  in getDeltaAt()  local
432     if (!IN) return Result;  in getDeltaAt()
437       Result += IN->getChild(i)->getFullDelta();  in getDeltaAt()
444       return Result+IN->getChild(NumValsGreater)->getFullDelta();  in getDeltaAt()
448     Node = IN->getChild(NumValsGreater);  in getDeltaAt()