Lines Matching refs:node
63 struct ulist_node *node; in ulist_fini() local
66 list_for_each_entry_safe(node, next, &ulist->nodes, list) { in ulist_fini()
67 kfree(node); in ulist_fini()
186 struct ulist_node *node; in ulist_add_merge() local
188 node = ulist_rbtree_search(ulist, val); in ulist_add_merge()
189 if (node) { in ulist_add_merge()
191 *old_aux = node->aux; in ulist_add_merge()
194 node = kmalloc(sizeof(*node), gfp_mask); in ulist_add_merge()
195 if (!node) in ulist_add_merge()
198 node->val = val; in ulist_add_merge()
199 node->aux = aux; in ulist_add_merge()
201 node->seqnum = ulist->nnodes; in ulist_add_merge()
204 ret = ulist_rbtree_insert(ulist, node); in ulist_add_merge()
206 list_add_tail(&node->list, &ulist->nodes); in ulist_add_merge()
230 struct ulist_node *node; in ulist_next() local
244 node = list_entry(uiter->cur_list, struct ulist_node, list); in ulist_next()
246 ASSERT(node->seqnum == uiter->i); in ulist_next()
250 return node; in ulist_next()