/linux-master/fs/btrfs/ |
H A D | defrag.c | 26 struct rb_node rb_node; member in struct:inode_defrag 77 struct rb_node **p; 78 struct rb_node *parent = NULL; 81 p = &fs_info->defrag_inodes.rb_node; 84 entry = rb_entry(parent, struct inode_defrag, rb_node); 105 rb_link_node(&defrag->rb_node, parent, p); 106 rb_insert_color(&defrag->rb_node, &fs_info->defrag_inodes); 179 struct rb_node *p; 180 struct rb_node *paren [all...] |
H A D | delayed-inode.c | 333 RB_CLEAR_NODE(&item->rb_node); 354 struct rb_node *node = root->rb_node; 359 rb_node); 374 struct rb_node **p, *node; 375 struct rb_node *parent_node = NULL; 385 p = &root->rb_root.rb_node; 386 node = &ins->rb_node; 391 rb_node); 432 if (RB_EMPTY_NODE(&delayed_item->rb_node)) [all...] |
H A D | delayed-inode.h | 84 struct rb_node rb_node; member in struct:btrfs_delayed_item
|
H A D | delayed-ref.c | 385 struct rb_node *node) 387 struct rb_node **p = &root->rb_root.rb_node; 388 struct rb_node *parent_node = NULL; 419 struct rb_node **p = &root->rb_root.rb_node; 420 struct rb_node *node = &ins->ref_node; 421 struct rb_node *parent_node = NULL; 450 struct rb_node *n; 472 struct rb_node * [all...] |
H A D | delayed-ref.h | 34 struct rb_node ref_node; 91 struct rb_node href_node;
|
H A D | disk-io.c | 659 RB_CLEAR_NODE(&root->rb_node); 750 static int global_root_cmp(struct rb_node *a_node, const struct rb_node *b_node) 752 const struct btrfs_root *a = rb_entry(a_node, struct btrfs_root, rb_node); 753 const struct btrfs_root *b = rb_entry(b_node, struct btrfs_root, rb_node); 758 static int global_root_key_cmp(const void *k, const struct rb_node *node) 761 const struct btrfs_root *root = rb_entry(node, struct btrfs_root, rb_node); 769 struct rb_node *tmp; 773 tmp = rb_find_add(&root->rb_node, &fs_info->global_root_tree, global_root_cmp); 789 rb_erase(&root->rb_node, [all...] |
H A D | extent-io-tree.c | 14 return !RB_EMPTY_NODE(&state->rb_node); 140 rbtree_postorder_for_each_entry_safe(state, tmp, &root, rb_node) { 142 RB_CLEAR_NODE(&state->rb_node); 174 RB_CLEAR_NODE(&state->rb_node); 222 struct rb_node *next = rb_next(&state->rb_node); 225 return rb_entry(next, struct extent_state, rb_node); 232 struct rb_node *next = rb_prev(&state->rb_node); 235 return rb_entry(next, struct extent_state, rb_node); [all...] |
H A D | extent-io-tree.h | 118 struct rb_node rb_node; member in struct:extent_state
|
H A D | extent-tree.c | 2176 struct rb_node *n = root->rb_node; 2184 entry = rb_entry(n, struct btrfs_delayed_ref_node, rb_node); 2189 entry = rb_entry(n, struct btrfs_delayed_ref_node, rb_node); 2192 n = root->rb_node; 2195 entry = rb_entry(n, struct btrfs_delayed_ref_node, rb_node); 2298 struct rb_node *node; 2607 struct rb_node *leftmost;
|
H A D | extent_map.c | 50 RB_CLEAR_NODE(&em->rb_node); 81 struct rb_node **p = &root->rb_root.rb_node; 82 struct rb_node *parent = NULL; 84 struct rb_node *orig_parent = NULL; 90 entry = rb_entry(parent, struct extent_map, rb_node); 105 entry = rb_entry(parent, struct extent_map, rb_node); 112 entry = rb_entry(parent, struct extent_map, rb_node); 115 entry = rb_entry(parent, struct extent_map, rb_node); 121 rb_link_node(&em->rb_node, orig_paren 409 struct rb_node *rb_node; local [all...] |
H A D | extent_map.h | 44 struct rb_node rb_node; member in struct:extent_map 114 return !RB_EMPTY_NODE(&em->rb_node);
|
H A D | free-space-cache.c | 66 struct rb_node *node; 904 struct rb_node *n; 1080 struct rb_node *node = rb_first(&ctl->free_space_offset); 1592 struct rb_node **p; 1593 struct rb_node *parent = NULL; 1604 p = &root->rb_node; 1687 static bool entry_less(struct rb_node *node, const struct rb_node *parent) 1707 struct rb_node *n = ctl->free_space_offset.rb_node; [all...] |
H A D | free-space-cache.h | 37 struct rb_node offset_index; 38 struct rb_node bytes_index;
|
H A D | free-space-tree.c | 1166 struct rb_node *node; 1320 struct rb_node *node;
|
H A D | inode.c | 4436 struct rb_node *node; 4437 struct rb_node *prev; 4447 node = root->inode_tree.rb_node; 4451 entry = rb_entry(node, struct btrfs_inode, rb_node); 4462 entry = rb_entry(prev, struct btrfs_inode, rb_node); 4471 entry = rb_entry(node, struct btrfs_inode, rb_node); 5156 struct rb_node *node; 5188 state = rb_entry(node, struct extent_state, rb_node); 5516 struct rb_node **p; 5517 struct rb_node *paren [all...] |
H A D | misc.h | 65 struct rb_node rb_node; member in struct:rb_simple_node 69 static inline struct rb_node *rb_simple_search(struct rb_root *root, u64 bytenr) 71 struct rb_node *node = root->rb_node; 75 entry = rb_entry(node, struct rb_simple_node, rb_node); 93 * Return the rb_node that start at or after @bytenr. If there is no entry at 96 static inline struct rb_node *rb_simple_search_first(struct rb_root *root, 99 struct rb_node *node = root->rb_node, *re [all...] |
H A D | ordered-data.c | 35 static struct rb_node *tree_insert(struct rb_root *root, u64 file_offset, 36 struct rb_node *node) 38 struct rb_node **p = &root->rb_node; 39 struct rb_node *parent = NULL; 44 entry = rb_entry(parent, struct btrfs_ordered_extent, rb_node); 63 static struct rb_node *__tree_search(struct rb_root *root, u64 file_offset, 64 struct rb_node **prev_ret) 66 struct rb_node *n = root->rb_node; [all...] |
H A D | ordered-data.h | 145 struct rb_node rb_node; member in struct:btrfs_ordered_extent
|
H A D | qgroup.c | 177 struct rb_node *n = fs_info->qgroup_tree.rb_node; 204 struct rb_node **p = &fs_info->qgroup_tree.rb_node; 205 struct rb_node *parent = NULL; 593 struct rb_node *node; 630 struct rb_node *n; 1894 struct rb_node **p = &delayed_refs->dirty_extent_root.rb_node; 1895 struct rb_node *parent_nod [all...] |
H A D | qgroup.h | 129 struct rb_node node; 147 struct rb_node node; 267 struct rb_node node; /* tree of qgroups */
|
H A D | ref-verify.c | 25 struct rb_node node; 39 struct rb_node node; 74 struct rb_node node; 81 struct rb_node **p = &root->rb_node; 82 struct rb_node *parent_node = NULL; 103 struct rb_node *n; 106 n = root->rb_node; 122 struct rb_node **p = &root->rb_node; [all...] |
H A D | relocation.c | 93 struct rb_node rb_node; member in struct:mapping_node::__anon1702 109 struct rb_node rb_node; member in struct:tree_block::__anon1703 237 struct rb_node *rb_node; local 238 rb_erase(&node->rb_node, &cache->rb_root); 240 rb_node = rb_simple_insert(&cache->rb_root, node->bytenr, &node->rb_node); 241 if (rb_node) 360 struct rb_node *rb_node; local 555 struct rb_node *rb_node; local 634 struct rb_node *rb_node; local 667 struct rb_node *rb_node; local 711 struct rb_node *rb_node; local 2106 struct rb_node *rb_node; local 3236 struct rb_node *rb_node; local [all...] |
H A D | send.c | 310 struct rb_node node; 319 struct rb_node node; 332 struct rb_node node; 3032 struct rb_node node; 3125 struct rb_node **p = &sctx->orphan_dirs.rb_node; 3126 struct rb_node *parent = NULL; 3160 struct rb_node *n = sctx->orphan_dirs.rb_node; 3341 struct rb_node ** [all...] |
/linux-master/fs/btrfs/tests/ |
H A D | extent-io-tests.c | 93 struct rb_node *node; 101 state = rb_entry(node, struct extent_state, rb_node);
|
H A D | extent-map-tests.c | 17 struct rb_node *node; 22 em = rb_entry(node, struct extent_map, rb_node); 534 struct rb_node *n; 540 struct extent_map *entry = rb_entry(n, struct extent_map, rb_node);
|