Home
last modified time | relevance | path

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

/linux-4.4.14/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 void ulist_rbtree_erase(struct ulist *ulist, struct ulist_node *node) in ulist_rbtree_erase()
144 static int ulist_rbtree_insert(struct ulist *ulist, struct ulist_node *ins) in ulist_rbtree_insert()
148 struct ulist_node *cur = NULL; in ulist_rbtree_insert()
152 cur = rb_entry(parent, struct ulist_node, rb_node); in ulist_rbtree_insert()
195 struct ulist_node *node; in ulist_add_merge()
[all …]
Dulist.h31 struct ulist_node { struct
76 struct ulist_node *ulist_next(struct ulist *ulist,
Dbackref.c435 struct ulist_node *node; in __resolve_indirect_refs()
1141 struct ulist_node *node = NULL;
1204 struct ulist_node *node = NULL;
1271 struct ulist_node *node;
1678 struct ulist_node *ref_node = NULL;
1679 struct ulist_node *root_node = NULL;
Dqgroup.c1050 struct ulist_node *unode; in __qgroup_excl_accounting()
1493 struct ulist_node *unode; in qgroup_update_refcnt()
1495 struct ulist_node *tmp_unode; in qgroup_update_refcnt()
1584 struct ulist_node *unode; in qgroup_update_counters()
2044 struct ulist_node *unode; in qgroup_reserve()
2123 struct ulist_node *unode; in btrfs_qgroup_free_refroot()
2515 struct ulist_node *unode; in btrfs_qgroup_reserve_data()
2662 struct ulist_node *unode; in btrfs_qgroup_check_reserved_leak()