Lines Matching refs:curNodePtr
657 Node *curNodePtr, *nodePtr;
684 curNodePtr = curLinePtr->parentPtr;
697 if (curNodePtr == index1Ptr->linePtr->parentPtr) {
700 curNodePtr->children.linePtr = curLinePtr->nextPtr;
702 for (nodePtr = curNodePtr; nodePtr != NULL;
706 curNodePtr->numChildren--;
717 while (curNodePtr->numChildren == 0) {
720 parentPtr = curNodePtr->parentPtr;
721 if (parentPtr->children.nodePtr == curNodePtr) {
722 parentPtr->children.nodePtr = curNodePtr->nextPtr;
725 while (prevNodePtr->nextPtr != curNodePtr) {
728 prevNodePtr->nextPtr = curNodePtr->nextPtr;
731 ckfree((char *) curNodePtr);
732 curNodePtr = parentPtr;
734 curNodePtr = curLinePtr->parentPtr;
773 curNodePtr = index2Ptr->linePtr->parentPtr;
774 for (nodePtr = curNodePtr; nodePtr != NULL;
778 curNodePtr->numChildren--;
779 prevLinePtr = curNodePtr->children.linePtr;
781 curNodePtr->children.linePtr = index2Ptr->linePtr->nextPtr;
789 Rebalance((BTree *) index2Ptr->tree, curNodePtr);