28 static struct rb_node *tree_insert(struct rb_root *root, u64 file_offset,  in tree_insert()
29 				   struct rb_node *node)  in tree_insert()
31 	struct rb_node **p = &root->rb_node;  in tree_insert()
32 	struct rb_node *parent = NULL;  in tree_insert()
37 		entry = rb_entry(parent, struct btrfs_ordered_extent, rb_node);  in tree_insert()
64 static struct rb_node *__tree_search(struct rb_root *root, u64 file_offset,  in __tree_search()
65 				     struct rb_node **prev_ret)  in __tree_search()
67 	struct rb_node *n = root->rb_node;  in __tree_search()
68 	struct rb_node *prev = NULL;  in __tree_search()
69 	struct rb_node *test;  in __tree_search()
74 		entry = rb_entry(n, struct btrfs_ordered_extent, rb_node);  in __tree_search()
93 				      rb_node);  in __tree_search()
101 				      rb_node);  in __tree_search()
107 				      rb_node);  in __tree_search()
138 static inline struct rb_node *tree_search(struct btrfs_ordered_inode_tree *tree,  in tree_search()
142 	struct rb_node *prev = NULL;  in tree_search()
143 	struct rb_node *ret;  in tree_search()
148 				 rb_node);  in tree_search()
178 	struct rb_node *node;  in __btrfs_add_ordered_extent()
214 			   &entry->rb_node);  in __btrfs_add_ordered_extent()
303 	struct rb_node *node;  in btrfs_dec_test_first_ordered_pending()
319 	entry = rb_entry(node, struct btrfs_ordered_extent, rb_node);  in btrfs_dec_test_first_ordered_pending()
373 	struct rb_node *node;  in btrfs_dec_test_ordered_pending()
391 	entry = rb_entry(node, struct btrfs_ordered_extent, rb_node);  in btrfs_dec_test_ordered_pending()
438 		ASSERT(RB_EMPTY_NODE(&entry->rb_node));  in btrfs_put_ordered_extent()
462 	struct rb_node *node;  in btrfs_remove_ordered_extent()
474 	node = &entry->rb_node;  in btrfs_remove_ordered_extent()
733 	struct rb_node *node;  in btrfs_lookup_ordered_extent()
742 	entry = rb_entry(node, struct btrfs_ordered_extent, rb_node);  in btrfs_lookup_ordered_extent()
759 	struct rb_node *node;  in btrfs_lookup_ordered_range()
772 		entry = rb_entry(node, struct btrfs_ordered_extent, rb_node);  in btrfs_lookup_ordered_range()
800 	struct rb_node *node;  in btrfs_lookup_first_ordered_extent()
809 	entry = rb_entry(node, struct btrfs_ordered_extent, rb_node);  in btrfs_lookup_first_ordered_extent()
827 	struct rb_node *node;  in btrfs_ordered_update_i_size()
828 	struct rb_node *prev = NULL;  in btrfs_ordered_update_i_size()
883 		node = rb_prev(&ordered->rb_node);  in btrfs_ordered_update_i_size()
892 					rb_node);  in btrfs_ordered_update_i_size()
898 		test = rb_entry(node, struct btrfs_ordered_extent, rb_node);  in btrfs_ordered_update_i_size()