Lines Matching refs:parentPtr

39     struct Node *parentPtr;		/* Pointer to parent node, or NULL if  member
228 rootPtr->parentPtr = NULL;
236 linePtr->parentPtr = rootPtr;
246 linePtr2->parentPtr = rootPtr;
458 newLinePtr->parentPtr = linePtr->parentPtr;
485 for (nodePtr = linePtr->parentPtr ; nodePtr != NULL;
486 nodePtr = nodePtr->parentPtr) {
489 nodePtr = linePtr->parentPtr;
676 curNodePtr = curLinePtr->parentPtr;
689 if (curNodePtr == index1Ptr->linePtr->parentPtr) {
695 nodePtr = nodePtr->parentPtr) {
710 Node *parentPtr; local
712 parentPtr = curNodePtr->parentPtr;
713 if (parentPtr->children.nodePtr == curNodePtr) {
714 parentPtr->children.nodePtr = curNodePtr->nextPtr;
716 Node *prevNodePtr = parentPtr->children.nodePtr;
722 parentPtr->numChildren--;
724 curNodePtr = parentPtr;
726 curNodePtr = curLinePtr->parentPtr;
765 curNodePtr = index2Ptr->linePtr->parentPtr;
767 nodePtr = nodePtr->parentPtr) {
794 Rebalance((BTree *) index1Ptr->tree, index1Ptr->linePtr->parentPtr);
899 for (nodePtr = linePtr->parentPtr; ; nodePtr = nodePtr->parentPtr) {
904 if (nodePtr->parentPtr == NULL) {
945 prevPtr = linePtr->parentPtr->children.linePtr; /* First line at leaf */
961 for (nodePtr = linePtr->parentPtr; ; nodePtr = nodePtr->parentPtr) {
962 if (nodePtr == (Node *) NULL || nodePtr->parentPtr == (Node *) NULL) {
965 if (nodePtr != nodePtr->parentPtr->children.nodePtr) {
969 for (node2Ptr = nodePtr->parentPtr->children.nodePtr; ;
1010 register Node *nodePtr, *parentPtr, *nodePtr2; local
1018 nodePtr = linePtr->parentPtr;
1034 for (parentPtr = nodePtr->parentPtr ; parentPtr != NULL;
1035 nodePtr = parentPtr, parentPtr = parentPtr->parentPtr) {
1036 for (nodePtr2 = parentPtr->children.nodePtr; nodePtr2 != nodePtr;
1212 ChangeNodeToggleCount(search.curIndex.linePtr->parentPtr,
1326 for ( ; nodePtr != tagPtr->tagRootPtr; nodePtr = nodePtr->parentPtr) {
1390 rootNodePtr = rootNodePtr->parentPtr;
1899 nodePtr = searchPtr->curIndex.linePtr->parentPtr;
1923 if (nodePtr->parentPtr == NULL ||
1924 nodePtr->parentPtr == searchPtr->tagPtr->tagRootPtr) {
1927 nodePtr = nodePtr->parentPtr;
2092 nodePtr = searchPtr->curIndex.linePtr->parentPtr;
2119 node2Ptr = nodePtr->parentPtr->children.nodePtr ;
2140 nodePtr = nodePtr->parentPtr;
2141 if (nodePtr->parentPtr == NULL ||
2261 for (siblingLinePtr = indexPtr->linePtr->parentPtr->children.linePtr;
2284 for (nodePtr = indexPtr->linePtr->parentPtr; nodePtr->parentPtr != NULL;
2285 nodePtr = nodePtr->parentPtr) {
2289 for (siblingPtr = nodePtr->parentPtr->children.nodePtr;
2375 for (siblingLinePtr = indexPtr->linePtr->parentPtr->children.linePtr;
2392 for (nodePtr = indexPtr->linePtr->parentPtr; nodePtr->parentPtr != NULL;
2393 nodePtr = nodePtr->parentPtr) {
2397 for (siblingPtr = nodePtr->parentPtr->children.nodePtr;
2668 if (nodePtr->parentPtr != NULL) {
2686 if (linePtr->parentPtr != nodePtr) {
2714 if (childNodePtr->parentPtr != nodePtr) {
2829 for ( ; nodePtr != NULL; nodePtr = nodePtr->parentPtr) {
2848 if (nodePtr->parentPtr == NULL) {
2850 newPtr->parentPtr = NULL;
2861 newPtr->parentPtr = nodePtr->parentPtr;
2885 nodePtr->parentPtr->numChildren++;
2908 if (nodePtr->parentPtr == NULL) {
2911 treePtr->rootPtr->parentPtr = NULL;
2923 if (nodePtr->parentPtr->numChildren < 2) {
2924 Rebalance(treePtr, nodePtr->parentPtr);
2934 for (otherPtr = nodePtr->parentPtr->children.nodePtr;
3001 nodePtr->parentPtr->numChildren--;
3081 linePtr->parentPtr = nodePtr;
3112 childPtr->parentPtr = nodePtr;
3150 summaryPtr->tagPtr->tagRootPtr = nodePtr->parentPtr;
3407 ChangeNodeToggleCount(linePtr->parentPtr,
3465 ChangeNodeToggleCount(linePtr->parentPtr,
3477 ChangeNodeToggleCount(linePtr->parentPtr,
3507 ChangeNodeToggleCount(linePtr->parentPtr,
3544 needSummary = (segPtr->body.toggle.tagPtr->tagRootPtr != linePtr->parentPtr);
3545 for (summaryPtr = linePtr->parentPtr->summaryPtr; ;