Lines Matching defs:node
63 DictNode *node, *next;
65 for( node = dict->head.next; node != &dict->head; node = next ) {
66 next = node->next;
67 memFree( node );
73 DictNode *dictInsertBefore( Dict *dict, DictNode *node, DictKey key )
78 node = node->prev;
79 } while( node->key != NULL && ! (*dict->leq)(dict->frame, node->key, key));
85 newNode->next = node->next;
86 node->next->prev = newNode;
87 newNode->prev = node;
88 node->next = newNode;
94 void dictDelete( Dict *dict, DictNode *node ) /*ARGSUSED*/
96 node->next->prev = node->prev;
97 node->prev->next = node->next;
98 memFree( node );
104 DictNode *node = &dict->head;
107 node = node->next;
108 } while( node->key != NULL && ! (*dict->leq)(dict->frame, key, node->key));
110 return node;