Lines Matching full:node
52 NE_HASHNODE *node, *next;
62 node = my_hash->nodes[x];
63 while (node)
65 next = node->next;
66 free(node);
67 node = next;
79 NE_HASHNODE **node;
81 node = _hash_lookup_node(hash, key, &hashv);
83 if (*node)
85 (*node)->value = value;
89 *node = (NE_HASHNODE *) malloc(sizeof(NE_HASHNODE));
90 if (node == NULL)
93 (*node)->hashv = hashv;
94 (*node)->key = key;
95 (*node)->value = value;
96 (*node)->next = NULL;
105 NE_HASHNODE *node;
107 node = *_hash_lookup_node(hash, key, NULL);
109 return (node) ? node->value : NULL;
114 NE_HASHNODE **node, *remove;
117 node = _hash_lookup_node(hash, key, NULL);
118 if (*node)
120 remove = *node;
121 *node = remove->next;
131 NE_HASHNODE *node;
133 node = *_hash_lookup_node(hash, key, NULL);
135 if (node) return 1;
141 NE_HASHNODE **node = 0;
146 node = _hash_lookup_node(hash, key, NULL);
148 if (*node)
150 bucket = (*node)->hashv & (hash->size - 1);
163 if (*node)
165 if ((*node)->next)
167 *key = (*node)->next->key;
168 return (*node)->next->value;
189 NE_HASHNODE **node;
196 node = &(hash->nodes[bucket]);
200 while (*node && !(hash->comp_func((*node)->key, key)))
201 node = &(*node)->next;
206 while (*node && (*node)->key != key)
207 node = &(*node)->next;
210 /* ne_warn("Node %x", node); */
211 return node;
