Lines Matching defs:node
19 * visiting a node twice. The pseudo-code could look like this:
28 * do something useful with the node;
66 struct ulist_node *node;
69 list_for_each_entry_safe(node, next, &ulist->nodes, list) {
70 kfree(node);
141 static void ulist_rbtree_erase(struct ulist *ulist, struct ulist_node *node)
143 rb_erase(&node->rb_node, &ulist->root);
144 list_del(&node->list);
145 kfree(node);
202 struct ulist_node *node;
204 node = ulist_rbtree_search(ulist, val);
205 if (node) {
207 *old_aux = node->aux;
210 node = kmalloc(sizeof(*node), gfp_mask);
211 if (!node)
214 node->val = val;
215 node->aux = aux;
217 ret = ulist_rbtree_insert(ulist, node);
219 list_add_tail(&node->list, &ulist->nodes);
226 * ulist_del - delete one node from ulist
227 * @ulist: ulist to remove node from
237 struct ulist_node *node;
239 node = ulist_rbtree_search(ulist, val);
241 if (!node)
244 if (node->aux != aux)
248 ulist_rbtree_erase(ulist, node);
271 struct ulist_node *node;
282 node = list_entry(uiter->cur_list, struct ulist_node, list);
283 return node;