37 				   struct rb_node *node)  in tree_insert()  argument
55 	rb_link_node(node, parent, p);  in tree_insert()
56 	rb_insert_color(node, root);  in tree_insert()
214 	struct rb_node *node;  in insert_ordered_extent()  local
225 	node = tree_insert(&inode->ordered_tree, entry->file_offset,  in insert_ordered_extent()
227 	if (unlikely(node))  in insert_ordered_extent()
466 	struct rb_node *node;  in btrfs_mark_ordered_io_finished()  local
481 		node = ordered_tree_search(inode, cur);  in btrfs_mark_ordered_io_finished()
483 		if (!node)  in btrfs_mark_ordered_io_finished()
486 		entry = rb_entry(node, struct btrfs_ordered_extent, rb_node);  in btrfs_mark_ordered_io_finished()
494 			node = rb_next(node);  in btrfs_mark_ordered_io_finished()
496 			if (!node)  in btrfs_mark_ordered_io_finished()
498 			entry = rb_entry(node, struct btrfs_ordered_extent,  in btrfs_mark_ordered_io_finished()
558 	struct rb_node *node;  in btrfs_dec_test_ordered_pending()  local
569 	node = ordered_tree_search(inode, file_offset);  in btrfs_dec_test_ordered_pending()
570 	if (!node)  in btrfs_dec_test_ordered_pending()
573 	entry = rb_entry(node, struct btrfs_ordered_extent, rb_node);  in btrfs_dec_test_ordered_pending()
640 	struct rb_node *node;  in btrfs_remove_ordered_extent()  local
671 	node = &entry->rb_node;  in btrfs_remove_ordered_extent()
672 	rb_erase(node, &btrfs_inode->ordered_tree);  in btrfs_remove_ordered_extent()
673 	RB_CLEAR_NODE(node);  in btrfs_remove_ordered_extent()
674 	if (btrfs_inode->ordered_tree_last == node)  in btrfs_remove_ordered_extent()
961 	struct rb_node *node;  in btrfs_lookup_ordered_extent()  local
966 	node = ordered_tree_search(inode, file_offset);  in btrfs_lookup_ordered_extent()
967 	if (!node)  in btrfs_lookup_ordered_extent()
970 	entry = rb_entry(node, struct btrfs_ordered_extent, rb_node);  in btrfs_lookup_ordered_extent()
988 	struct rb_node *node;  in btrfs_lookup_ordered_range()  local
992 	node = ordered_tree_search(inode, file_offset);  in btrfs_lookup_ordered_range()
993 	if (!node) {  in btrfs_lookup_ordered_range()
994 		node = ordered_tree_search(inode, file_offset + len);  in btrfs_lookup_ordered_range()
995 		if (!node)  in btrfs_lookup_ordered_range()
1000 		entry = rb_entry(node, struct btrfs_ordered_extent, rb_node);  in btrfs_lookup_ordered_range()
1009 		node = rb_next(node);  in btrfs_lookup_ordered_range()
1010 		if (!node)  in btrfs_lookup_ordered_range()
1057 	struct rb_node *node;  in btrfs_lookup_first_ordered_extent()  local
1061 	node = ordered_tree_search(inode, file_offset);  in btrfs_lookup_first_ordered_extent()
1062 	if (!node)  in btrfs_lookup_first_ordered_extent()
1065 	entry = rb_entry(node, struct btrfs_ordered_extent, rb_node);  in btrfs_lookup_first_ordered_extent()
1085 	struct rb_node *node;  in btrfs_lookup_first_ordered_range()  local
1092 	node = inode->ordered_tree.rb_node;  in btrfs_lookup_first_ordered_range()
1099 	while (node) {  in btrfs_lookup_first_ordered_range()
1100 		entry = rb_entry(node, struct btrfs_ordered_extent, rb_node);  in btrfs_lookup_first_ordered_range()
1103 			node = node->rb_left;  in btrfs_lookup_first_ordered_range()
1105 			node = node->rb_right;  in btrfs_lookup_first_ordered_range()
1232 	struct rb_node *node;  in btrfs_split_ordered_extent()  local
1330 	node = tree_insert(&inode->ordered_tree, new->file_offset, &new->rb_node);  in btrfs_split_ordered_extent()
1331 	if (unlikely(node))  in btrfs_split_ordered_extent()