Cross Reference: /ast/src/lib/libtk/generic/tkTextBTree.c

Lines Matching defs:Node
38 typedef struct Node {
39     struct Node *parentPtr;		/* Pointer to parent node, or NULL if
41     struct Node *nextPtr;		/* Next in list of siblings with the
51 	struct Node *nodePtr;		/* Used if level > 0. */
57 } Node;
73     Node *rootPtr;			/* Pointer to root of B-tree. */
115 static void		ChangeNodeToggleCount _ANSI_ARGS_((Node *nodePtr,
125 static void		CheckNodeConsistency _ANSI_ARGS_((Node *nodePtr));
128 static void		DestroyNode _ANSI_ARGS_((Node *nodePtr));
131 static void		Rebalance _ANSI_ARGS_((BTree *treePtr, Node *nodePtr));
132 static void		RecomputeNodeCounts _ANSI_ARGS_((Node *nodePtr));
215     register Node *rootPtr;
226     rootPtr = (Node *) ckalloc(sizeof(Node));
312     register Node *nodePtr;
329 	register Node *childPtr;
402     register Node *nodePtr;
657     Node *curNodePtr, *nodePtr;
718 		Node *parentPtr;
724 		    Node *prevNodePtr = parentPtr->children.nodePtr;
832     register Node *nodePtr;
897     register Node *nodePtr;
949     register Node *nodePtr;
950     register Node *node2Ptr;
973 	if (nodePtr == (Node *) NULL || nodePtr->parentPtr == (Node *) NULL) {
988 	nodePtr = (Node *)NULL;
1022     register Node *nodePtr, *parentPtr, *nodePtr2;
1313     register Node *nodePtr;		/* Node whose toggle count for a tag
1320     register Node *node2Ptr;
1324     if (tagPtr->tagRootPtr == (Node *) NULL) {
1400 		Node *rootNodePtr = tagPtr->tagRootPtr;
1427 	tagPtr->tagRootPtr = (Node *) NULL;
1438 		node2Ptr != (Node *)NULL ;
1501     register Node *nodePtr;
1508     if (nodePtr == (Node *) NULL) {
1518 	for (nodePtr = nodePtr->children.nodePtr ; nodePtr != (Node *) NULL;
1582     register Node *nodePtr, *lastNodePtr;
1589     if (nodePtr == (Node *) NULL) {
1600 		nodePtr != (Node *) NULL; nodePtr = nodePtr->nextPtr) {
1879     register Node *nodePtr;
2043     register Node *nodePtr, *node2Ptr, *prevNodePtr;
2251     register Node *nodePtr;
2309 	register Node *siblingPtr;
2366     register Node *nodePtr;
2418 	register Node *siblingPtr;
2547     register Node *nodePtr;
2562 	if (nodePtr == (Node *) NULL) {
2686     register Node *nodePtr;		/* Node whose subtree should be
2689     register Node *childNodePtr;
2849     register Node *nodePtr;		/* Node that may be out of balance. */
2858 	register Node *newPtr, *childPtr;
2877 		    newPtr = (Node *) ckalloc(sizeof(Node));
2888 		newPtr = (Node *) ckalloc(sizeof(Node));
2923 	    register Node *otherPtr;
2924 	    Node *halfwayNodePtr = NULL;	/* Initialization needed only */
3003 		register Node *childPtr;
3078     register Node *nodePtr;		/* Node whose tag summary information
3082     register Node *childPtr;