Lines Matching refs:rb_node
52 RB_CLEAR_NODE(&em->rb_node); in alloc_extent_map()
86 struct rb_node **p = &root->rb_root.rb_node; in tree_insert()
87 struct rb_node *parent = NULL; in tree_insert()
89 struct rb_node *orig_parent = NULL; in tree_insert()
95 entry = rb_entry(parent, struct extent_map, rb_node); in tree_insert()
110 entry = rb_entry(parent, struct extent_map, rb_node); in tree_insert()
117 entry = rb_entry(parent, struct extent_map, rb_node); in tree_insert()
120 entry = rb_entry(parent, struct extent_map, rb_node); in tree_insert()
126 rb_link_node(&em->rb_node, orig_parent, p); in tree_insert()
127 rb_insert_color_cached(&em->rb_node, root, leftmost); in tree_insert()
135 static struct rb_node *__tree_search(struct rb_root *root, u64 offset, in __tree_search()
136 struct rb_node **prev_or_next_ret) in __tree_search()
138 struct rb_node *n = root->rb_node; in __tree_search()
139 struct rb_node *prev = NULL; in __tree_search()
140 struct rb_node *orig_prev = NULL; in __tree_search()
147 entry = rb_entry(n, struct extent_map, rb_node); in __tree_search()
162 prev_entry = rb_entry(prev, struct extent_map, rb_node); in __tree_search()
175 prev_entry = rb_entry(prev, struct extent_map, rb_node); in __tree_search()
178 prev_entry = rb_entry(prev, struct extent_map, rb_node); in __tree_search()
234 struct rb_node *rb; in try_merge_map()
248 rb = rb_prev(&em->rb_node); in try_merge_map()
250 merge = rb_entry(rb, struct extent_map, rb_node); in try_merge_map()
262 rb_erase_cached(&merge->rb_node, &tree->map); in try_merge_map()
263 RB_CLEAR_NODE(&merge->rb_node); in try_merge_map()
268 rb = rb_next(&em->rb_node); in try_merge_map()
270 merge = rb_entry(rb, struct extent_map, rb_node); in try_merge_map()
274 rb_erase_cached(&merge->rb_node, &tree->map); in try_merge_map()
275 RB_CLEAR_NODE(&merge->rb_node); in try_merge_map()
426 struct rb_node *rb_node; in __lookup_extent_mapping() local
427 struct rb_node *prev_or_next = NULL; in __lookup_extent_mapping()
430 rb_node = __tree_search(&tree->map.rb_root, start, &prev_or_next); in __lookup_extent_mapping()
431 if (!rb_node) { in __lookup_extent_mapping()
433 rb_node = prev_or_next; in __lookup_extent_mapping()
438 em = rb_entry(rb_node, struct extent_map, rb_node); in __lookup_extent_mapping()
497 rb_erase_cached(&em->rb_node, &tree->map); in remove_extent_mapping()
502 RB_CLEAR_NODE(&em->rb_node); in remove_extent_mapping()
516 rb_replace_node_cached(&cur->rb_node, &new->rb_node, &tree->map); in replace_extent_mapping()
517 RB_CLEAR_NODE(&cur->rb_node); in replace_extent_mapping()
524 struct rb_node *next; in next_extent_map()
526 next = rb_next(&em->rb_node); in next_extent_map()
529 return container_of(next, struct extent_map, rb_node); in next_extent_map()
534 struct rb_node *prev; in prev_extent_map()
536 prev = rb_prev(&em->rb_node); in prev_extent_map()
539 return container_of(prev, struct extent_map, rb_node); in prev_extent_map()
678 struct rb_node *node; in drop_all_extent_maps_fast()
681 em = rb_entry(node, struct extent_map, rb_node); in drop_all_extent_maps_fast()