Lines Matching refs:node
66 struct ulist_node *node; in ulist_release() local
69 list_for_each_entry_safe(node, next, &ulist->nodes, list) { in ulist_release()
70 kfree(node); in ulist_release()
132 static int ulist_node_val_key_cmp(const void *key, const struct rb_node *node) in ulist_node_val_key_cmp() argument
135 const struct ulist_node *unode = rb_entry(node, struct ulist_node, rb_node); in ulist_node_val_key_cmp()
147 struct rb_node *node; in ulist_rbtree_search() local
149 node = rb_find(&val, &ulist->root, ulist_node_val_key_cmp); in ulist_rbtree_search()
150 return rb_entry_safe(node, struct ulist_node, rb_node); in ulist_rbtree_search()
153 static void ulist_rbtree_erase(struct ulist *ulist, struct ulist_node *node) in ulist_rbtree_erase() argument
155 rb_erase(&node->rb_node, &ulist->root); in ulist_rbtree_erase()
156 list_del(&node->list); in ulist_rbtree_erase()
157 kfree(node); in ulist_rbtree_erase()
171 struct rb_node *node; in ulist_rbtree_insert() local
173 node = rb_find_add(&ins->rb_node, &ulist->root, ulist_node_val_cmp); in ulist_rbtree_insert()
174 if (node) in ulist_rbtree_insert()
209 struct ulist_node *node; in ulist_add_merge() local
211 node = ulist_rbtree_search(ulist, val); in ulist_add_merge()
212 if (node) { in ulist_add_merge()
214 *old_aux = node->aux; in ulist_add_merge()
219 node = ulist->prealloc; in ulist_add_merge()
222 node = kmalloc(sizeof(*node), gfp_mask); in ulist_add_merge()
223 if (!node) in ulist_add_merge()
227 node->val = val; in ulist_add_merge()
228 node->aux = aux; in ulist_add_merge()
230 ret = ulist_rbtree_insert(ulist, node); in ulist_add_merge()
232 list_add_tail(&node->list, &ulist->nodes); in ulist_add_merge()
251 struct ulist_node *node; in ulist_del() local
253 node = ulist_rbtree_search(ulist, val); in ulist_del()
255 if (!node) in ulist_del()
258 if (node->aux != aux) in ulist_del()
262 ulist_rbtree_erase(ulist, node); in ulist_del()
285 struct ulist_node *node; in ulist_next() local
296 node = list_entry(uiter->cur_list, struct ulist_node, list); in ulist_next()
297 return node; in ulist_next()