Home
last modified time | relevance | path

Searched refs:unode (Results 1 – 3 of 3) sorted by relevance

/fs/btrfs/
A Dulist.c135 const struct ulist_node *unode = rb_entry(node, struct ulist_node, rb_node); in ulist_node_val_key_cmp() local
137 if (unode->val < *val) in ulist_node_val_key_cmp()
139 else if (unode->val > *val) in ulist_node_val_key_cmp()
164 const struct ulist_node *unode = rb_entry(new, struct ulist_node, rb_node); in ulist_node_val_cmp() local
166 return ulist_node_val_key_cmp(&unode->val, existing); in ulist_node_val_cmp()
A Dqgroup.c2732 struct ulist_node *unode; in qgroup_update_refcnt() local
2739 while ((unode = ulist_next(roots, &uiter))) { in qgroup_update_refcnt()
2742 qg = find_qgroup_rb(fs_info, unode->val); in qgroup_update_refcnt()
2892 struct ulist_node *unode; in maybe_fs_roots() local
2900 unode = ulist_next(roots, &uiter); in maybe_fs_roots()
2901 if (!unode) in maybe_fs_roots()
2909 return btrfs_is_fstree(unode->val); in maybe_fs_roots()
4281 struct ulist_node *unode; in qgroup_free_reserved_data() local
4293 u64 range_start = unode->val; in qgroup_free_reserved_data()
4597 struct ulist_node *unode; in btrfs_qgroup_check_reserved_leak() local
[all …]
/fs/hpfs/
A Danode.c246 struct anode *unode; in hpfs_add_sector_to_btree() local
247 if ((unode = hpfs_map_anode(s, le32_to_cpu(ranode->u.internal[n].down), &bh1))) { in hpfs_add_sector_to_btree()
248 unode->up = cpu_to_le32(ra); in hpfs_add_sector_to_btree()
249 unode->btree.flags &= ~BP_fnode_parent; in hpfs_add_sector_to_btree()

Completed in 14 milliseconds