ulist_node
struct ulist_node *node;
struct ulist_node *node;
struct ulist_node *ref_node;
struct ulist_node *root_node;
unode_aux_to_inode_list(struct ulist_node *node)
struct ulist_node *node;
struct ulist_node *node;
#define EXTENT_CHANGESET_BYTES_ONLY ((struct ulist_node *)1)
struct ulist_node *unode;
struct ulist_node *unode;
struct ulist_node *entry;
entry = rb_entry(node, struct ulist_node, rb_node);
entry = rb_entry(rb_prev(&entry->rb_node), struct ulist_node,
entry = rb_entry(node, struct ulist_node, rb_node);
struct ulist_node *unode;
struct ulist_node *unode;
struct ulist_node *ref_node = NULL;
struct ulist_node *node;
const struct ulist_node *unode = rb_entry(node, struct ulist_node, rb_node);
static struct ulist_node *ulist_rbtree_search(struct ulist *ulist, u64 val)
return rb_entry_safe(node, struct ulist_node, rb_node);
static void ulist_rbtree_erase(struct ulist *ulist, struct ulist_node *node)
const struct ulist_node *unode = rb_entry(new, struct ulist_node, rb_node);
static int ulist_rbtree_insert(struct ulist *ulist, struct ulist_node *ins)
struct ulist_node *node;
struct ulist_node *node;
struct ulist_node *ulist_next(const struct ulist *ulist, struct ulist_iterator *uiter)
struct ulist_node *node;
node = list_entry(uiter->cur_list, struct ulist_node, list);
struct ulist_node *node;
struct ulist_node *next;
struct ulist_node *prealloc;
struct ulist_node *ulist_next(const struct ulist *ulist,