Lines Matching refs:rb_node
51 RB_CLEAR_NODE(&em->rb_node); in alloc_extent_map()
90 struct rb_node **p = &root->rb_node; in tree_insert()
91 struct rb_node *parent = NULL; in tree_insert()
93 struct rb_node *orig_parent = NULL; in tree_insert()
98 entry = rb_entry(parent, struct extent_map, rb_node); in tree_insert()
111 entry = rb_entry(parent, struct extent_map, rb_node); in tree_insert()
118 entry = rb_entry(parent, struct extent_map, rb_node); in tree_insert()
121 entry = rb_entry(parent, struct extent_map, rb_node); in tree_insert()
127 rb_link_node(&em->rb_node, orig_parent, p); in tree_insert()
128 rb_insert_color(&em->rb_node, root); in tree_insert()
136 static struct rb_node *__tree_search(struct rb_root *root, u64 offset, in __tree_search()
137 struct rb_node **prev_or_next_ret) in __tree_search()
139 struct rb_node *n = root->rb_node; in __tree_search()
140 struct rb_node *prev = NULL; in __tree_search()
141 struct rb_node *orig_prev = NULL; in __tree_search()
148 entry = rb_entry(n, struct extent_map, rb_node); in __tree_search()
163 prev_entry = rb_entry(prev, struct extent_map, rb_node); in __tree_search()
176 prev_entry = rb_entry(prev, struct extent_map, rb_node); in __tree_search()
179 prev_entry = rb_entry(prev, struct extent_map, rb_node); in __tree_search()
344 struct rb_node *rb; in try_merge_map()
361 rb = rb_prev(&em->rb_node); in try_merge_map()
363 merge = rb_entry(rb, struct extent_map, rb_node); in try_merge_map()
374 rb_erase(&merge->rb_node, &tree->root); in try_merge_map()
375 RB_CLEAR_NODE(&merge->rb_node); in try_merge_map()
381 rb = rb_next(&em->rb_node); in try_merge_map()
383 merge = rb_entry(rb, struct extent_map, rb_node); in try_merge_map()
389 rb_erase(&merge->rb_node, &tree->root); in try_merge_map()
390 RB_CLEAR_NODE(&merge->rb_node); in try_merge_map()
518 struct rb_node *rb_node; in __lookup_extent_mapping() local
519 struct rb_node *prev_or_next = NULL; in __lookup_extent_mapping()
522 rb_node = __tree_search(&tree->root, start, &prev_or_next); in __lookup_extent_mapping()
523 if (!rb_node) { in __lookup_extent_mapping()
525 rb_node = prev_or_next; in __lookup_extent_mapping()
530 em = rb_entry(rb_node, struct extent_map, rb_node); in __lookup_extent_mapping()
591 rb_erase(&em->rb_node, &tree->root); in remove_extent_mapping()
594 RB_CLEAR_NODE(&em->rb_node); in remove_extent_mapping()
615 rb_replace_node(&cur->rb_node, &new->rb_node, &tree->root); in replace_extent_mapping()
616 RB_CLEAR_NODE(&cur->rb_node); in replace_extent_mapping()
623 struct rb_node *next; in next_extent_map()
625 next = rb_next(&em->rb_node); in next_extent_map()
628 return container_of(next, struct extent_map, rb_node); in next_extent_map()
633 struct rb_node *prev; in prev_extent_map()
635 prev = rb_prev(&em->rb_node); in prev_extent_map()
638 return container_of(prev, struct extent_map, rb_node); in prev_extent_map()
769 struct rb_node *node; in drop_all_extent_maps_fast()
775 struct rb_node *next = rb_next(node); in drop_all_extent_maps_fast()
777 em = rb_entry(node, struct extent_map, rb_node); in drop_all_extent_maps_fast()
1134 struct rb_node *node; in btrfs_scan_inode()
1171 struct rb_node *next = rb_next(node); in btrfs_scan_inode()
1174 em = rb_entry(node, struct extent_map, rb_node); in btrfs_scan_inode()