Lines Matching defs:node
18 * visiting a node twice. The pseudo-code could look like this:
27 * do something useful with the node;
63 struct ulist_node *node;
66 list_for_each_entry_safe(node, next, &ulist->nodes, list) {
67 kfree(node);
135 static void ulist_rbtree_erase(struct ulist *ulist, struct ulist_node *node)
137 rb_erase(&node->rb_node, &ulist->root);
138 list_del(&node->list);
139 kfree(node);
195 struct ulist_node *node;
197 node = ulist_rbtree_search(ulist, val);
198 if (node) {
200 *old_aux = node->aux;
203 node = kmalloc(sizeof(*node), gfp_mask);
204 if (!node)
207 node->val = val;
208 node->aux = aux;
210 ret = ulist_rbtree_insert(ulist, node);
212 list_add_tail(&node->list, &ulist->nodes);
219 * ulist_del - delete one node from ulist
220 * @ulist: ulist to remove node from
230 struct ulist_node *node;
232 node = ulist_rbtree_search(ulist, val);
234 if (!node)
237 if (node->aux != aux)
241 ulist_rbtree_erase(ulist, node);
263 struct ulist_node *node;
274 node = list_entry(uiter->cur_list, struct ulist_node, list);
275 return node;