Lines Matching refs:node
156 ares__llist_node_t *node;
157 for (node = ares__llist_node_first(htable->buckets[i]); node != NULL;
158 node = ares__llist_node_next(node)) {
159 out[cnt++] = ares__llist_node_val(node);
177 ares__llist_node_t *node = NULL;
179 for (node = ares__llist_node_first(htable->buckets[idx]); node != NULL;
180 node = ares__llist_node_next(node)) {
181 if (htable->key_eq(key, htable->bucket_key(ares__llist_node_val(node)))) {
186 return node;
233 ares__llist_node_t *node;
256 while ((node = ares__llist_node_first(htable->buckets[i])) != NULL) {
257 const void *val = ares__llist_node_val(node);
282 ares__llist_node_move_parent_first(node, buckets[idx]);
316 ares__llist_node_t *node = NULL;
328 node = ares__htable_find(htable, idx, key);
329 if (node != NULL) {
330 ares__llist_node_replace(node, bucket);
353 node = ares__llist_insert_first(htable->buckets[idx], bucket);
354 if (node == NULL) {
383 ares__llist_node_t *node;
391 node = ares__htable_find(htable, idx, key);
392 if (node == NULL) {
399 if (ares__llist_len(ares__llist_node_parent(node)) > 1) {
403 ares__llist_node_destroy(node);