Home
last modified time | relevance | path

Searched refs:ulist_node (Results 1 – 5 of 5) sorted by relevance

/linux-4.1.27/fs/btrfs/
Dulist.c63 struct ulist_node *node; in ulist_fini()
64 struct ulist_node *next; in ulist_fini()
118 static struct ulist_node *ulist_rbtree_search(struct ulist *ulist, u64 val) in ulist_rbtree_search()
121 struct ulist_node *u = NULL; in ulist_rbtree_search()
124 u = rb_entry(n, struct ulist_node, rb_node); in ulist_rbtree_search()
135 static int ulist_rbtree_insert(struct ulist *ulist, struct ulist_node *ins) in ulist_rbtree_insert()
139 struct ulist_node *cur = NULL; in ulist_rbtree_insert()
143 cur = rb_entry(parent, struct ulist_node, rb_node); in ulist_rbtree_insert()
186 struct ulist_node *node; in ulist_add_merge()
228 struct ulist_node *ulist_next(struct ulist *ulist, struct ulist_iterator *uiter) in ulist_next()
[all …]
Dulist.h31 struct ulist_node { struct
75 struct ulist_node *ulist_next(struct ulist *ulist,
Dqgroup.c1017 struct ulist_node *unode; in __qgroup_excl_accounting()
1567 struct ulist_node *unode; in qgroup_calc_old_refcnt()
1569 struct ulist_node *tmp_unode; in qgroup_calc_old_refcnt()
1656 struct ulist_node *unode; in qgroup_account_deleted_refs()
1751 struct ulist_node *unode; in qgroup_calc_new_refcnt()
1803 struct ulist_node *unode; in qgroup_adjust_counters()
1882 struct ulist_node *unode; in check_existing_refs()
2066 struct ulist_node *unode; in qgroup_subtree_accounting()
2494 struct ulist_node *unode; in btrfs_qgroup_reserve()
2573 struct ulist_node *unode; in btrfs_qgroup_free()
Dbackref.c392 struct ulist_node *node; in __resolve_indirect_refs()
1093 struct ulist_node *node = NULL;
1156 struct ulist_node *node = NULL;
1223 struct ulist_node *node;
1630 struct ulist_node *ref_node = NULL;
1631 struct ulist_node *root_node = NULL;
Dioctl.c3060 struct ulist_node *root_node = NULL; in check_ref()