36 static struct rb_node *tree_insert(struct rb_root *root, u64 file_offset,  in tree_insert()
37 				   struct rb_node *node)  in tree_insert()
39 	struct rb_node **p = &root->rb_node;  in tree_insert()
40 	struct rb_node *parent = NULL;  in tree_insert()
45 		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()
127 static inline struct rb_node *tree_search(struct btrfs_ordered_inode_tree *tree,  in tree_search()
131 	struct rb_node *prev = NULL;  in tree_search()
132 	struct rb_node *ret;  in tree_search()
137 				 rb_node);  in tree_search()
214 	struct rb_node *node;  in insert_ordered_extent()
225 	node = tree_insert(&tree->tree, entry->file_offset, &entry->rb_node);  in insert_ordered_extent()
408 	struct rb_node *node;  in btrfs_mark_ordered_io_finished()
428 		entry = rb_entry(node, struct btrfs_ordered_extent, rb_node);  in btrfs_mark_ordered_io_finished()
441 					 rb_node);  in btrfs_mark_ordered_io_finished()
501 	struct rb_node *node;  in btrfs_dec_test_ordered_pending()
516 	entry = rb_entry(node, struct btrfs_ordered_extent, rb_node);  in btrfs_dec_test_ordered_pending()
561 		ASSERT(RB_EMPTY_NODE(&entry->rb_node));  in btrfs_put_ordered_extent()
584 	struct rb_node *node;  in btrfs_remove_ordered_extent()
614 	node = &entry->rb_node;  in btrfs_remove_ordered_extent()
879 	struct rb_node *node;  in btrfs_lookup_ordered_extent()
889 	entry = rb_entry(node, struct btrfs_ordered_extent, rb_node);  in btrfs_lookup_ordered_extent()
908 	struct rb_node *node;  in btrfs_lookup_ordered_range()
921 		entry = rb_entry(node, struct btrfs_ordered_extent, rb_node);  in btrfs_lookup_ordered_range()
951 	struct rb_node *n;  in btrfs_get_ordered_extents_for_logging()
959 		ordered = rb_entry(n, struct btrfs_ordered_extent, rb_node);  in btrfs_get_ordered_extents_for_logging()
980 	struct rb_node *node;  in btrfs_lookup_first_ordered_extent()
989 	entry = rb_entry(node, struct btrfs_ordered_extent, rb_node);  in btrfs_lookup_first_ordered_extent()
1010 	struct rb_node *node;  in btrfs_lookup_first_ordered_range()
1011 	struct rb_node *cur;  in btrfs_lookup_first_ordered_range()
1012 	struct rb_node *prev;  in btrfs_lookup_first_ordered_range()
1013 	struct rb_node *next;  in btrfs_lookup_first_ordered_range()
1017 	node = tree->tree.rb_node;  in btrfs_lookup_first_ordered_range()
1025 		entry = rb_entry(node, struct btrfs_ordered_extent, rb_node);  in btrfs_lookup_first_ordered_range()
1044 	cur = &entry->rb_node;  in btrfs_lookup_first_ordered_range()
1054 		entry = rb_entry(prev, struct btrfs_ordered_extent, rb_node);  in btrfs_lookup_first_ordered_range()
1059 		entry = rb_entry(next, struct btrfs_ordered_extent, rb_node);  in btrfs_lookup_first_ordered_range()
1158 	struct rb_node *node;  in btrfs_split_ordered_extent()
1192 	node = &ordered->rb_node;  in btrfs_split_ordered_extent()
1227 	node = tree_insert(&tree->tree, ordered->file_offset, &ordered->rb_node);  in btrfs_split_ordered_extent()
1233 	node = tree_insert(&tree->tree, new->file_offset, &new->rb_node);  in btrfs_split_ordered_extent()