Home
last modified time | relevance | path

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

/fs/btrfs/
Dtree-defrag.c53 struct extent_buffer *root_node; in btrfs_defrag_leaves() local
56 root_node = btrfs_lock_root_node(root); in btrfs_defrag_leaves()
57 nritems = btrfs_header_nritems(root_node); in btrfs_defrag_leaves()
60 btrfs_node_key_to_cpu(root_node, &root->defrag_max, in btrfs_defrag_leaves()
62 btrfs_tree_unlock(root_node); in btrfs_defrag_leaves()
63 free_extent_buffer(root_node); in btrfs_defrag_leaves()
Dbackref.c2003 struct ulist_node *root_node = NULL; local
2040 while (!ret && (root_node = ulist_next(roots, &root_uiter))) {
2043 root_node->val, ref_node->val,
2048 root_node->val,
/fs/nfs/
Ddir.c2647 struct rb_root *root_node = &nfsi->access_cache; in __nfs_access_zap_cache() local
2652 while ((n = rb_first(root_node)) != NULL) { in __nfs_access_zap_cache()
2654 rb_erase(n, root_node); in __nfs_access_zap_cache()
2786 struct rb_root *root_node = &nfsi->access_cache; in nfs_access_add_rbtree() local
2787 struct rb_node **p = &root_node->rb_node; in nfs_access_add_rbtree()
2806 rb_insert_color(&set->rb_node, root_node); in nfs_access_add_rbtree()
2811 rb_replace_node(parent, &set->rb_node, root_node); in nfs_access_add_rbtree()