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 *ordered_tree_search(struct btrfs_inode *inode,  in ordered_tree_search()
130 	struct rb_node *prev = NULL;  in ordered_tree_search()
131 	struct rb_node *ret;  in ordered_tree_search()
136 				 rb_node);  in ordered_tree_search()
214 	struct rb_node *node;  in insert_ordered_extent()
226 			   &entry->rb_node);  in insert_ordered_extent()
466 	struct rb_node *node;  in btrfs_mark_ordered_io_finished()
486 		entry = rb_entry(node, struct btrfs_ordered_extent, rb_node);  in btrfs_mark_ordered_io_finished()
499 					 rb_node);  in btrfs_mark_ordered_io_finished()
558 	struct rb_node *node;  in btrfs_dec_test_ordered_pending()
573 	entry = rb_entry(node, struct btrfs_ordered_extent, rb_node);  in btrfs_dec_test_ordered_pending()
618 		ASSERT(RB_EMPTY_NODE(&entry->rb_node));  in btrfs_put_ordered_extent()
640 	struct rb_node *node;  in btrfs_remove_ordered_extent()
671 	node = &entry->rb_node;  in btrfs_remove_ordered_extent()
948 	struct rb_node *node;  in btrfs_lookup_ordered_extent()
957 	entry = rb_entry(node, struct btrfs_ordered_extent, rb_node);  in btrfs_lookup_ordered_extent()
975 	struct rb_node *node;  in btrfs_lookup_ordered_range()
987 		entry = rb_entry(node, struct btrfs_ordered_extent, rb_node);  in btrfs_lookup_ordered_range()
1016 	struct rb_node *n;  in btrfs_get_ordered_extents_for_logging()
1024 		ordered = rb_entry(n, struct btrfs_ordered_extent, rb_node);  in btrfs_get_ordered_extents_for_logging()
1044 	struct rb_node *node;  in btrfs_lookup_first_ordered_extent()
1052 	entry = rb_entry(node, struct btrfs_ordered_extent, rb_node);  in btrfs_lookup_first_ordered_extent()
1072 	struct rb_node *node;  in btrfs_lookup_first_ordered_range()
1073 	struct rb_node *cur;  in btrfs_lookup_first_ordered_range()
1074 	struct rb_node *prev;  in btrfs_lookup_first_ordered_range()
1075 	struct rb_node *next;  in btrfs_lookup_first_ordered_range()
1079 	node = inode->ordered_tree.rb_node;  in btrfs_lookup_first_ordered_range()
1087 		entry = rb_entry(node, struct btrfs_ordered_extent, rb_node);  in btrfs_lookup_first_ordered_range()
1106 	cur = &entry->rb_node;  in btrfs_lookup_first_ordered_range()
1116 		entry = rb_entry(prev, struct btrfs_ordered_extent, rb_node);  in btrfs_lookup_first_ordered_range()
1121 		entry = rb_entry(next, struct btrfs_ordered_extent, rb_node);  in btrfs_lookup_first_ordered_range()
1219 	struct rb_node *node;  in btrfs_split_ordered_extent()
1305 	node = tree_insert(&inode->ordered_tree, new->file_offset, &new->rb_node);  in btrfs_split_ordered_extent()