51 	RB_CLEAR_NODE(&em->rb_node);  in alloc_extent_map()
84 	rb_erase(&em->rb_node, &inode->extent_tree.root);  in remove_em()
85 	RB_CLEAR_NODE(&em->rb_node);  in remove_em()
93 	struct rb_node **p = &root->rb_node;  in tree_insert()
94 	struct rb_node *parent = NULL;  in tree_insert()
96 	struct rb_node *orig_parent = NULL;  in tree_insert()
101 		entry = rb_entry(parent, struct extent_map, rb_node);  in tree_insert()
114 		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()
124 		entry = rb_entry(parent, struct extent_map, rb_node);  in tree_insert()
130 	rb_link_node(&em->rb_node, orig_parent, p);  in tree_insert()
131 	rb_insert_color(&em->rb_node, root);  in tree_insert()
139 static struct rb_node *__tree_search(struct rb_root *root, u64 offset,  in __tree_search()
140 				     struct rb_node **prev_or_next_ret)  in __tree_search()
142 	struct rb_node *n = root->rb_node;  in __tree_search()
143 	struct rb_node *prev = NULL;  in __tree_search()
144 	struct rb_node *orig_prev = NULL;  in __tree_search()
151 		entry = rb_entry(n, struct extent_map, rb_node);  in __tree_search()
166 		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()
182 		prev_entry = rb_entry(prev, struct extent_map, rb_node);  in __tree_search()
346 	struct rb_node *rb;  in try_merge_map()
363 		rb = rb_prev(&em->rb_node);  in try_merge_map()
365 			merge = rb_entry(rb, struct extent_map, 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()
516 	struct rb_node *rb_node;  in __lookup_extent_mapping()  local
517 	struct rb_node *prev_or_next = NULL;  in __lookup_extent_mapping()
520 	rb_node = __tree_search(&tree->root, start, &prev_or_next);  in __lookup_extent_mapping()
521 	if (!rb_node) {  in __lookup_extent_mapping()
523 			rb_node = prev_or_next;  in __lookup_extent_mapping()
528 	em = rb_entry(rb_node, struct extent_map, rb_node);  in __lookup_extent_mapping()
611 	rb_replace_node(&cur->rb_node, &new->rb_node, &tree->root);  in replace_extent_mapping()
612 	RB_CLEAR_NODE(&cur->rb_node);  in replace_extent_mapping()
619 	struct rb_node *next;  in next_extent_map()
621 	next = rb_next(&em->rb_node);  in next_extent_map()
624 	return container_of(next, struct extent_map, rb_node);  in next_extent_map()
629 	struct rb_node *prev;  in prev_extent_map()
631 	prev = rb_prev(&em->rb_node);  in prev_extent_map()
634 	return container_of(prev, struct extent_map, rb_node);  in prev_extent_map()
765 	struct rb_node *node;  in drop_all_extent_maps_fast()
771 		struct rb_node *next = rb_next(node);  in drop_all_extent_maps_fast()
773 		em = rb_entry(node, struct extent_map, rb_node);  in drop_all_extent_maps_fast()
1129 	struct rb_node *node;  in btrfs_scan_inode()
1152 		struct rb_node *next = rb_next(node);  in btrfs_scan_inode()
1155 		em = rb_entry(node, struct extent_map, rb_node);  in btrfs_scan_inode()