free_space_offset  644 fs/btrfs/free-space-cache.c 	for (n = rb_first(&ctl->free_space_offset); n; n = rb_next(n)) {
free_space_offset  929 fs/btrfs/free-space-cache.c 	struct rb_node *node = rb_first(&ctl->free_space_offset);
free_space_offset 1511 fs/btrfs/free-space-cache.c 	struct rb_node *n = ctl->free_space_offset.rb_node;
free_space_offset 1627 fs/btrfs/free-space-cache.c 	rb_erase(&info->offset_index, &ctl->free_space_offset);
free_space_offset 1644 fs/btrfs/free-space-cache.c 	ret = tree_insert_offset(&ctl->free_space_offset, info->offset,
free_space_offset 1817 fs/btrfs/free-space-cache.c 	if (!ctl->free_space_offset.rb_node)
free_space_offset 2497 fs/btrfs/free-space-cache.c 	for (n = rb_first(&ctl->free_space_offset); n; n = rb_next(n)) {
free_space_offset 2570 fs/btrfs/free-space-cache.c 		tree_insert_offset(&ctl->free_space_offset,
free_space_offset 2587 fs/btrfs/free-space-cache.c 	while ((node = rb_last(&ctl->free_space_offset)) != NULL) {
free_space_offset 2902 fs/btrfs/free-space-cache.c 	rb_erase(&entry->offset_index, &ctl->free_space_offset);
free_space_offset 2992 fs/btrfs/free-space-cache.c 		rb_erase(&entry->offset_index, &ctl->free_space_offset);
free_space_offset 3441 fs/btrfs/free-space-cache.c 	if (RB_EMPTY_ROOT(&ctl->free_space_offset))
free_space_offset 3444 fs/btrfs/free-space-cache.c 	entry = rb_entry(rb_first(&ctl->free_space_offset),
free_space_offset   20 fs/btrfs/free-space-cache.h 	struct rb_root free_space_offset;
free_space_offset  254 fs/btrfs/inode-map.c 	struct rb_root *rbroot = &root->free_ino_pinned->free_space_offset;
free_space_offset  303 fs/btrfs/inode-map.c 	n = rb_last(&ctl->free_space_offset);