ulist_node        586 fs/btrfs/backref.c unode_aux_to_inode_list(struct ulist_node *node)
ulist_node        618 fs/btrfs/backref.c 	struct ulist_node *node;
ulist_node       1341 fs/btrfs/backref.c 	struct ulist_node *node = NULL;
ulist_node       1405 fs/btrfs/backref.c 	struct ulist_node *node = NULL;
ulist_node       1474 fs/btrfs/backref.c 	struct ulist_node *node;
ulist_node       1904 fs/btrfs/backref.c 	struct ulist_node *ref_node = NULL;
ulist_node       1905 fs/btrfs/backref.c 	struct ulist_node *root_node = NULL;
ulist_node        159 fs/btrfs/qgroup.c static inline struct btrfs_qgroup* unode_aux_to_qgroup(struct ulist_node *n)
ulist_node       1146 fs/btrfs/qgroup.c 	struct ulist_node *unode;
ulist_node       2212 fs/btrfs/qgroup.c 	struct ulist_node *unode;
ulist_node       2214 fs/btrfs/qgroup.c 	struct ulist_node *tmp_unode;
ulist_node       2303 fs/btrfs/qgroup.c 	struct ulist_node *unode;
ulist_node       2395 fs/btrfs/qgroup.c 	struct ulist_node *unode;
ulist_node       2888 fs/btrfs/qgroup.c 	struct ulist_node *unode;
ulist_node       2972 fs/btrfs/qgroup.c 	struct ulist_node *unode;
ulist_node       3412 fs/btrfs/qgroup.c 	struct ulist_node *unode;
ulist_node       3467 fs/btrfs/qgroup.c 	struct ulist_node *unode;
ulist_node       3699 fs/btrfs/qgroup.c 	struct ulist_node *unode;
ulist_node       3761 fs/btrfs/qgroup.c 	struct ulist_node *unode;
ulist_node         63 fs/btrfs/ulist.c 	struct ulist_node *node;
ulist_node         64 fs/btrfs/ulist.c 	struct ulist_node *next;
ulist_node        118 fs/btrfs/ulist.c static struct ulist_node *ulist_rbtree_search(struct ulist *ulist, u64 val)
ulist_node        121 fs/btrfs/ulist.c 	struct ulist_node *u = NULL;
ulist_node        124 fs/btrfs/ulist.c 		u = rb_entry(n, struct ulist_node, rb_node);
ulist_node        135 fs/btrfs/ulist.c static void ulist_rbtree_erase(struct ulist *ulist, struct ulist_node *node)
ulist_node        144 fs/btrfs/ulist.c static int ulist_rbtree_insert(struct ulist *ulist, struct ulist_node *ins)
ulist_node        148 fs/btrfs/ulist.c 	struct ulist_node *cur = NULL;
ulist_node        152 fs/btrfs/ulist.c 		cur = rb_entry(parent, struct ulist_node, rb_node);
ulist_node        195 fs/btrfs/ulist.c 	struct ulist_node *node;
ulist_node        230 fs/btrfs/ulist.c 	struct ulist_node *node;
ulist_node        261 fs/btrfs/ulist.c struct ulist_node *ulist_next(struct ulist *ulist, struct ulist_iterator *uiter)
ulist_node        263 fs/btrfs/ulist.c 	struct ulist_node *node;
ulist_node        274 fs/btrfs/ulist.c 	node = list_entry(uiter->cur_list, struct ulist_node, list);
ulist_node         69 fs/btrfs/ulist.h struct ulist_node *ulist_next(struct ulist *ulist,