Lines Matching defs:parentPtr

39     struct Node *parentPtr;		/* Pointer to parent node, or NULL if
229 rootPtr->parentPtr = NULL;
237 linePtr->parentPtr = rootPtr;
247 linePtr2->parentPtr = rootPtr;
463 newLinePtr->parentPtr = linePtr->parentPtr;
490 for (nodePtr = linePtr->parentPtr ; nodePtr != NULL;
491 nodePtr = nodePtr->parentPtr) {
494 nodePtr = linePtr->parentPtr;
684 curNodePtr = curLinePtr->parentPtr;
697 if (curNodePtr == index1Ptr->linePtr->parentPtr) {
703 nodePtr = nodePtr->parentPtr) {
718 Node *parentPtr;
720 parentPtr = curNodePtr->parentPtr;
721 if (parentPtr->children.nodePtr == curNodePtr) {
722 parentPtr->children.nodePtr = curNodePtr->nextPtr;
724 Node *prevNodePtr = parentPtr->children.nodePtr;
730 parentPtr->numChildren--;
732 curNodePtr = parentPtr;
734 curNodePtr = curLinePtr->parentPtr;
773 curNodePtr = index2Ptr->linePtr->parentPtr;
775 nodePtr = nodePtr->parentPtr) {
802 Rebalance((BTree *) index1Ptr->tree, index1Ptr->linePtr->parentPtr);
909 for (nodePtr = linePtr->parentPtr; ; nodePtr = nodePtr->parentPtr) {
914 if (nodePtr->parentPtr == NULL) {
956 prevPtr = linePtr->parentPtr->children.linePtr; /* First line at leaf */
972 for (nodePtr = linePtr->parentPtr; ; nodePtr = nodePtr->parentPtr) {
973 if (nodePtr == (Node *) NULL || nodePtr->parentPtr == (Node *) NULL) {
976 if (nodePtr != nodePtr->parentPtr->children.nodePtr) {
980 for (node2Ptr = nodePtr->parentPtr->children.nodePtr; ;
1022 register Node *nodePtr, *parentPtr, *nodePtr2;
1030 nodePtr = linePtr->parentPtr;
1046 for (parentPtr = nodePtr->parentPtr ; parentPtr != NULL;
1047 nodePtr = parentPtr, parentPtr = parentPtr->parentPtr) {
1048 for (nodePtr2 = parentPtr->children.nodePtr; nodePtr2 != nodePtr;
1227 ChangeNodeToggleCount(search.curIndex.linePtr->parentPtr,
1342 for ( ; nodePtr != tagPtr->tagRootPtr; nodePtr = nodePtr->parentPtr) {
1406 rootNodePtr = rootNodePtr->parentPtr;
1920 nodePtr = searchPtr->curIndex.linePtr->parentPtr;
1944 if (nodePtr->parentPtr == NULL ||
1945 nodePtr->parentPtr == searchPtr->tagPtr->tagRootPtr) {
1948 nodePtr = nodePtr->parentPtr;
2114 nodePtr = searchPtr->curIndex.linePtr->parentPtr;
2141 node2Ptr = nodePtr->parentPtr->children.nodePtr ;
2162 nodePtr = nodePtr->parentPtr;
2163 if (nodePtr->parentPtr == NULL ||
2284 for (siblingLinePtr = indexPtr->linePtr->parentPtr->children.linePtr;
2307 for (nodePtr = indexPtr->linePtr->parentPtr; nodePtr->parentPtr != NULL;
2308 nodePtr = nodePtr->parentPtr) {
2312 for (siblingPtr = nodePtr->parentPtr->children.nodePtr;
2399 for (siblingLinePtr = indexPtr->linePtr->parentPtr->children.linePtr;
2416 for (nodePtr = indexPtr->linePtr->parentPtr; nodePtr->parentPtr != NULL;
2417 nodePtr = nodePtr->parentPtr) {
2421 for (siblingPtr = nodePtr->parentPtr->children.nodePtr;
2695 if (nodePtr->parentPtr != NULL) {
2713 if (linePtr->parentPtr != nodePtr) {
2741 if (childNodePtr->parentPtr != nodePtr) {
2857 for ( ; nodePtr != NULL; nodePtr = nodePtr->parentPtr) {
2876 if (nodePtr->parentPtr == NULL) {
2878 newPtr->parentPtr = NULL;
2889 newPtr->parentPtr = nodePtr->parentPtr;
2913 nodePtr->parentPtr->numChildren++;
2936 if (nodePtr->parentPtr == NULL) {
2939 treePtr->rootPtr->parentPtr = NULL;
2951 if (nodePtr->parentPtr->numChildren < 2) {
2952 Rebalance(treePtr, nodePtr->parentPtr);
2962 for (otherPtr = nodePtr->parentPtr->children.nodePtr;
3029 nodePtr->parentPtr->numChildren--;
3070 * Also, all of the childrens' parentPtr fields are made to point
3110 linePtr->parentPtr = nodePtr;
3141 childPtr->parentPtr = nodePtr;
3179 summaryPtr->tagPtr->tagRootPtr = nodePtr->parentPtr;
3442 ChangeNodeToggleCount(linePtr->parentPtr,
3501 ChangeNodeToggleCount(linePtr->parentPtr,
3513 ChangeNodeToggleCount(linePtr->parentPtr,
3544 ChangeNodeToggleCount(linePtr->parentPtr,
3582 needSummary = (segPtr->body.toggle.tagPtr->tagRootPtr != linePtr->parentPtr);
3583 for (summaryPtr = linePtr->parentPtr->summaryPtr; ;