33 static struct rb_node *tree_insert(struct rb_root *root, u64 file_offset,  in tree_insert()
34 				   struct rb_node *node)  in tree_insert()
36 	struct rb_node **p = &root->rb_node;  in tree_insert()
37 	struct rb_node *parent = NULL;  in tree_insert()
42 		entry = rb_entry(parent, struct btrfs_ordered_extent, rb_node);  in tree_insert()
61 static struct rb_node *__tree_search(struct rb_root *root, u64 file_offset,  in __tree_search()
62 				     struct rb_node **prev_ret)  in __tree_search()
64 	struct rb_node *n = root->rb_node;  in __tree_search()
65 	struct rb_node *prev = NULL;  in __tree_search()
66 	struct rb_node *test;  in __tree_search()
71 		entry = rb_entry(n, struct btrfs_ordered_extent, rb_node);  in __tree_search()
90 				      rb_node);  in __tree_search()
98 				      rb_node);  in __tree_search()
104 				      rb_node);  in __tree_search()
124 static inline struct rb_node *tree_search(struct btrfs_ordered_inode_tree *tree,  in tree_search()
128 	struct rb_node *prev = NULL;  in tree_search()
129 	struct rb_node *ret;  in tree_search()
134 				 rb_node);  in tree_search()
172 	struct rb_node *node;  in btrfs_add_ordered_extent()
228 			   &entry->rb_node);  in btrfs_add_ordered_extent()
303 	struct rb_node *node;  in btrfs_mark_ordered_io_finished()
328 		entry = rb_entry(node, struct btrfs_ordered_extent, rb_node);  in btrfs_mark_ordered_io_finished()
341 					 rb_node);  in btrfs_mark_ordered_io_finished()
442 	struct rb_node *node;  in btrfs_dec_test_ordered_pending()
457 	entry = rb_entry(node, struct btrfs_ordered_extent, rb_node);  in btrfs_dec_test_ordered_pending()
502 		ASSERT(RB_EMPTY_NODE(&entry->rb_node));  in btrfs_put_ordered_extent()
525 	struct rb_node *node;  in btrfs_remove_ordered_extent()
555 	node = &entry->rb_node;  in btrfs_remove_ordered_extent()
825 	struct rb_node *node;  in btrfs_lookup_ordered_extent()
835 	entry = rb_entry(node, struct btrfs_ordered_extent, rb_node);  in btrfs_lookup_ordered_extent()
854 	struct rb_node *node;  in btrfs_lookup_ordered_range()
867 		entry = rb_entry(node, struct btrfs_ordered_extent, rb_node);  in btrfs_lookup_ordered_range()
897 	struct rb_node *n;  in btrfs_get_ordered_extents_for_logging()
905 		ordered = rb_entry(n, struct btrfs_ordered_extent, rb_node);  in btrfs_get_ordered_extents_for_logging()
926 	struct rb_node *node;  in btrfs_lookup_first_ordered_extent()
935 	entry = rb_entry(node, struct btrfs_ordered_extent, rb_node);  in btrfs_lookup_first_ordered_extent()
956 	struct rb_node *node;  in btrfs_lookup_first_ordered_range()
957 	struct rb_node *cur;  in btrfs_lookup_first_ordered_range()
958 	struct rb_node *prev;  in btrfs_lookup_first_ordered_range()
959 	struct rb_node *next;  in btrfs_lookup_first_ordered_range()
963 	node = tree->tree.rb_node;  in btrfs_lookup_first_ordered_range()
971 		entry = rb_entry(node, struct btrfs_ordered_extent, rb_node);  in btrfs_lookup_first_ordered_range()
990 	cur = &entry->rb_node;  in btrfs_lookup_first_ordered_range()
1000 		entry = rb_entry(prev, struct btrfs_ordered_extent, rb_node);  in btrfs_lookup_first_ordered_range()
1005 		entry = rb_entry(next, struct btrfs_ordered_extent, rb_node);  in btrfs_lookup_first_ordered_range()
1116 	struct rb_node *node;  in btrfs_split_ordered_extent()
1124 	node = &ordered->rb_node;  in btrfs_split_ordered_extent()
1137 	node = tree_insert(&tree->tree, ordered->file_offset, &ordered->rb_node);  in btrfs_split_ordered_extent()