31 static struct rb_node *tree_insert(struct rb_root *root, u64 file_offset,  in tree_insert()
32 				   struct rb_node *node)  in tree_insert()
34 	struct rb_node **p = &root->rb_node;  in tree_insert()
35 	struct rb_node *parent = NULL;  in tree_insert()
40 		entry = rb_entry(parent, struct btrfs_ordered_extent, rb_node);  in tree_insert()
67 static struct rb_node *__tree_search(struct rb_root *root, u64 file_offset,  in __tree_search()
68 				     struct rb_node **prev_ret)  in __tree_search()
70 	struct rb_node *n = root->rb_node;  in __tree_search()
71 	struct rb_node *prev = NULL;  in __tree_search()
72 	struct rb_node *test;  in __tree_search()
77 		entry = rb_entry(n, struct btrfs_ordered_extent, rb_node);  in __tree_search()
96 				      rb_node);  in __tree_search()
104 				      rb_node);  in __tree_search()
110 				      rb_node);  in __tree_search()
141 static inline struct rb_node *tree_search(struct btrfs_ordered_inode_tree *tree,  in tree_search()
145 	struct rb_node *prev = NULL;  in tree_search()
146 	struct rb_node *ret;  in tree_search()
151 				 rb_node);  in tree_search()
181 	struct rb_node *node;  in __btrfs_add_ordered_extent()
220 			   &entry->rb_node);  in __btrfs_add_ordered_extent()
308 	struct rb_node *node;  in btrfs_dec_test_first_ordered_pending()
324 	entry = rb_entry(node, struct btrfs_ordered_extent, rb_node);  in btrfs_dec_test_first_ordered_pending()
378 	struct rb_node *node;  in btrfs_dec_test_ordered_pending()
396 	entry = rb_entry(node, struct btrfs_ordered_extent, rb_node);  in btrfs_dec_test_ordered_pending()
443 		ASSERT(RB_EMPTY_NODE(&entry->rb_node));  in btrfs_put_ordered_extent()
467 	struct rb_node *node;  in btrfs_remove_ordered_extent()
482 	node = &entry->rb_node;  in btrfs_remove_ordered_extent()
712 	struct rb_node *node;  in btrfs_lookup_ordered_extent()
721 	entry = rb_entry(node, struct btrfs_ordered_extent, rb_node);  in btrfs_lookup_ordered_extent()
738 	struct rb_node *node;  in btrfs_lookup_ordered_range()
751 		entry = rb_entry(node, struct btrfs_ordered_extent, rb_node);  in btrfs_lookup_ordered_range()
779 	struct rb_node *node;  in btrfs_lookup_first_ordered_extent()
788 	entry = rb_entry(node, struct btrfs_ordered_extent, rb_node);  in btrfs_lookup_first_ordered_extent()
806 	struct rb_node *node;  in btrfs_ordered_update_i_size()
807 	struct rb_node *prev = NULL;  in btrfs_ordered_update_i_size()
862 		node = rb_prev(&ordered->rb_node);  in btrfs_ordered_update_i_size()
871 					rb_node);  in btrfs_ordered_update_i_size()
877 		test = rb_entry(node, struct btrfs_ordered_extent, rb_node);  in btrfs_ordered_update_i_size()