118 static struct ulist_node *ulist_rbtree_search(struct ulist *ulist, u64 val)  in ulist_rbtree_search()  argument
125 		if (u->val < val)  in ulist_rbtree_search()
127 		else if (u->val > val)  in ulist_rbtree_search()
154 		if (cur->val < ins->val)  in ulist_rbtree_insert()
156 		else if (cur->val > ins->val)  in ulist_rbtree_insert()
186 int ulist_add(struct ulist *ulist, u64 val, u64 aux, gfp_t gfp_mask)  in ulist_add()  argument
188 	return ulist_add_merge(ulist, val, aux, NULL, gfp_mask);  in ulist_add()
191 int ulist_add_merge(struct ulist *ulist, u64 val, u64 aux,  in ulist_add_merge()  argument
197 	node = ulist_rbtree_search(ulist, val);  in ulist_add_merge()
207 	node->val = val;  in ulist_add_merge()
228 int ulist_del(struct ulist *ulist, u64 val, u64 aux)  in ulist_del()  argument
232 	node = ulist_rbtree_search(ulist, val);  in ulist_del()