Lines Matching defs:node
28 * This macro compares two node keys i and j and returns:
102 struct Curl_tree *node)
106 if(node == NULL)
112 /* There already exists a node in the tree with the very same key. Build
113 a linked list of nodes. We make the new 'node' struct the new master
114 node and make the previous node the first one in the 'same' list. */
116 node->same = t;
117 node->key = i;
118 node->smaller = t->smaller;
119 node->larger = t->larger;
121 t->smaller = node; /* in the sub node for this same key, we use the
123 node */
125 t->key = KEY_NOTUSED; /* and we set the key in the sub node to NOTUSED
126 to quickly identify this node as a subnode */
128 return node; /* new root node */
133 node->smaller = node->larger = NULL;
136 node->smaller = t->smaller;
137 node->larger = t;
142 node->larger = t->larger;
143 node->smaller = t;
146 node->key = i;
148 node->same = NULL; /* no identical node (yet) */
149 return node;
152 /* Finds and deletes the best-fit node from the tree. Return a pointer to the
153 resulting tree. best-fit means the node with the given or lower key */
167 /* too big node, try the smaller chain */
183 /* 'x' is the new root node */
211 /* Deletes the very node we point out from the tree if it's there. Stores a
217 * NOTE: when the last node of the tree is removed, there's no tree left so
235 links to the parent node. */
253 /* First make sure that we got the same root node as the one we want
254 to remove, as otherwise we might be trying to remove a node that
258 succession of a node with key != KEY_NOTUSED && same != NULL
259 could return the same key but a different node. */
264 remove the root node of a list of nodes with identical keys. */
267 /* 'x' is the new root node, we just make it use the root node's
275 /* Remove the root node */