Josef Bacik | 0f9dd46 | 2008-09-23 13:14:11 -0400 | [diff] [blame] | 1 | /* |
| 2 | * Copyright (C) 2008 Red Hat. All rights reserved. |
| 3 | * |
| 4 | * This program is free software; you can redistribute it and/or |
| 5 | * modify it under the terms of the GNU General Public |
| 6 | * License v2 as published by the Free Software Foundation. |
| 7 | * |
| 8 | * This program is distributed in the hope that it will be useful, |
| 9 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
| 10 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU |
| 11 | * General Public License for more details. |
| 12 | * |
| 13 | * You should have received a copy of the GNU General Public |
| 14 | * License along with this program; if not, write to the |
| 15 | * Free Software Foundation, Inc., 59 Temple Place - Suite 330, |
| 16 | * Boston, MA 021110-1307, USA. |
| 17 | */ |
| 18 | |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 19 | #include <linux/pagemap.h> |
Josef Bacik | 0f9dd46 | 2008-09-23 13:14:11 -0400 | [diff] [blame] | 20 | #include <linux/sched.h> |
Tejun Heo | 5a0e3ad | 2010-03-24 17:04:11 +0900 | [diff] [blame] | 21 | #include <linux/slab.h> |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 22 | #include <linux/math64.h> |
Josef Bacik | 6ab6060 | 2011-08-08 08:24:46 -0400 | [diff] [blame] | 23 | #include <linux/ratelimit.h> |
Josef Bacik | 0f9dd46 | 2008-09-23 13:14:11 -0400 | [diff] [blame] | 24 | #include "ctree.h" |
Chris Mason | fa9c0d79 | 2009-04-03 09:47:43 -0400 | [diff] [blame] | 25 | #include "free-space-cache.h" |
| 26 | #include "transaction.h" |
Josef Bacik | 0af3d00 | 2010-06-21 14:48:16 -0400 | [diff] [blame] | 27 | #include "disk-io.h" |
Josef Bacik | 43be214 | 2011-04-01 14:55:00 +0000 | [diff] [blame] | 28 | #include "extent_io.h" |
Li Zefan | 581bb05 | 2011-04-20 10:06:11 +0800 | [diff] [blame] | 29 | #include "inode-map.h" |
Chris Mason | fa9c0d79 | 2009-04-03 09:47:43 -0400 | [diff] [blame] | 30 | |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 31 | #define BITS_PER_BITMAP (PAGE_CACHE_SIZE * 8) |
| 32 | #define MAX_CACHE_BYTES_PER_GIG (32 * 1024) |
| 33 | |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 34 | static int link_free_space(struct btrfs_free_space_ctl *ctl, |
Josef Bacik | 0cb59c9 | 2010-07-02 12:14:14 -0400 | [diff] [blame] | 35 | struct btrfs_free_space *info); |
Josef Bacik | cd023e7 | 2012-05-14 10:06:40 -0400 | [diff] [blame] | 36 | static void unlink_free_space(struct btrfs_free_space_ctl *ctl, |
| 37 | struct btrfs_free_space *info); |
Josef Bacik | 0cb59c9 | 2010-07-02 12:14:14 -0400 | [diff] [blame] | 38 | |
Li Zefan | 0414efa | 2011-04-20 10:20:14 +0800 | [diff] [blame] | 39 | static struct inode *__lookup_free_space_inode(struct btrfs_root *root, |
| 40 | struct btrfs_path *path, |
| 41 | u64 offset) |
Josef Bacik | 0af3d00 | 2010-06-21 14:48:16 -0400 | [diff] [blame] | 42 | { |
| 43 | struct btrfs_key key; |
| 44 | struct btrfs_key location; |
| 45 | struct btrfs_disk_key disk_key; |
| 46 | struct btrfs_free_space_header *header; |
| 47 | struct extent_buffer *leaf; |
| 48 | struct inode *inode = NULL; |
| 49 | int ret; |
| 50 | |
Josef Bacik | 0af3d00 | 2010-06-21 14:48:16 -0400 | [diff] [blame] | 51 | key.objectid = BTRFS_FREE_SPACE_OBJECTID; |
Li Zefan | 0414efa | 2011-04-20 10:20:14 +0800 | [diff] [blame] | 52 | key.offset = offset; |
Josef Bacik | 0af3d00 | 2010-06-21 14:48:16 -0400 | [diff] [blame] | 53 | key.type = 0; |
| 54 | |
| 55 | ret = btrfs_search_slot(NULL, root, &key, path, 0, 0); |
| 56 | if (ret < 0) |
| 57 | return ERR_PTR(ret); |
| 58 | if (ret > 0) { |
David Sterba | b3b4aa7 | 2011-04-21 01:20:15 +0200 | [diff] [blame] | 59 | btrfs_release_path(path); |
Josef Bacik | 0af3d00 | 2010-06-21 14:48:16 -0400 | [diff] [blame] | 60 | return ERR_PTR(-ENOENT); |
| 61 | } |
| 62 | |
| 63 | leaf = path->nodes[0]; |
| 64 | header = btrfs_item_ptr(leaf, path->slots[0], |
| 65 | struct btrfs_free_space_header); |
| 66 | btrfs_free_space_key(leaf, header, &disk_key); |
| 67 | btrfs_disk_key_to_cpu(&location, &disk_key); |
David Sterba | b3b4aa7 | 2011-04-21 01:20:15 +0200 | [diff] [blame] | 68 | btrfs_release_path(path); |
Josef Bacik | 0af3d00 | 2010-06-21 14:48:16 -0400 | [diff] [blame] | 69 | |
| 70 | inode = btrfs_iget(root->fs_info->sb, &location, root, NULL); |
| 71 | if (!inode) |
| 72 | return ERR_PTR(-ENOENT); |
| 73 | if (IS_ERR(inode)) |
| 74 | return inode; |
| 75 | if (is_bad_inode(inode)) { |
| 76 | iput(inode); |
| 77 | return ERR_PTR(-ENOENT); |
| 78 | } |
| 79 | |
Al Viro | 528c032 | 2012-04-13 11:03:55 -0400 | [diff] [blame] | 80 | mapping_set_gfp_mask(inode->i_mapping, |
| 81 | mapping_gfp_mask(inode->i_mapping) & ~__GFP_FS); |
Miao Xie | adae52b | 2011-03-31 09:43:23 +0000 | [diff] [blame] | 82 | |
Li Zefan | 0414efa | 2011-04-20 10:20:14 +0800 | [diff] [blame] | 83 | return inode; |
| 84 | } |
| 85 | |
| 86 | struct inode *lookup_free_space_inode(struct btrfs_root *root, |
| 87 | struct btrfs_block_group_cache |
| 88 | *block_group, struct btrfs_path *path) |
| 89 | { |
| 90 | struct inode *inode = NULL; |
Josef Bacik | 5b0e95b | 2011-10-06 08:58:24 -0400 | [diff] [blame] | 91 | u32 flags = BTRFS_INODE_NODATASUM | BTRFS_INODE_NODATACOW; |
Li Zefan | 0414efa | 2011-04-20 10:20:14 +0800 | [diff] [blame] | 92 | |
| 93 | spin_lock(&block_group->lock); |
| 94 | if (block_group->inode) |
| 95 | inode = igrab(block_group->inode); |
| 96 | spin_unlock(&block_group->lock); |
| 97 | if (inode) |
| 98 | return inode; |
| 99 | |
| 100 | inode = __lookup_free_space_inode(root, path, |
| 101 | block_group->key.objectid); |
| 102 | if (IS_ERR(inode)) |
| 103 | return inode; |
| 104 | |
Josef Bacik | 0af3d00 | 2010-06-21 14:48:16 -0400 | [diff] [blame] | 105 | spin_lock(&block_group->lock); |
Josef Bacik | 5b0e95b | 2011-10-06 08:58:24 -0400 | [diff] [blame] | 106 | if (!((BTRFS_I(inode)->flags & flags) == flags)) { |
Simon Kirby | c2cf52e | 2013-03-19 22:41:23 +0000 | [diff] [blame] | 107 | btrfs_info(root->fs_info, |
| 108 | "Old style space inode found, converting."); |
Josef Bacik | 5b0e95b | 2011-10-06 08:58:24 -0400 | [diff] [blame] | 109 | BTRFS_I(inode)->flags |= BTRFS_INODE_NODATASUM | |
| 110 | BTRFS_INODE_NODATACOW; |
Josef Bacik | 2f35612 | 2011-06-10 15:31:13 -0400 | [diff] [blame] | 111 | block_group->disk_cache_state = BTRFS_DC_CLEAR; |
| 112 | } |
| 113 | |
Josef Bacik | 300e4f8 | 2011-08-29 14:06:00 -0400 | [diff] [blame] | 114 | if (!block_group->iref) { |
Josef Bacik | 0af3d00 | 2010-06-21 14:48:16 -0400 | [diff] [blame] | 115 | block_group->inode = igrab(inode); |
| 116 | block_group->iref = 1; |
| 117 | } |
| 118 | spin_unlock(&block_group->lock); |
| 119 | |
| 120 | return inode; |
| 121 | } |
| 122 | |
Eric Sandeen | 48a3b63 | 2013-04-25 20:41:01 +0000 | [diff] [blame] | 123 | static int __create_free_space_inode(struct btrfs_root *root, |
| 124 | struct btrfs_trans_handle *trans, |
| 125 | struct btrfs_path *path, |
| 126 | u64 ino, u64 offset) |
Josef Bacik | 0af3d00 | 2010-06-21 14:48:16 -0400 | [diff] [blame] | 127 | { |
| 128 | struct btrfs_key key; |
| 129 | struct btrfs_disk_key disk_key; |
| 130 | struct btrfs_free_space_header *header; |
| 131 | struct btrfs_inode_item *inode_item; |
| 132 | struct extent_buffer *leaf; |
Josef Bacik | 5b0e95b | 2011-10-06 08:58:24 -0400 | [diff] [blame] | 133 | u64 flags = BTRFS_INODE_NOCOMPRESS | BTRFS_INODE_PREALLOC; |
Josef Bacik | 0af3d00 | 2010-06-21 14:48:16 -0400 | [diff] [blame] | 134 | int ret; |
| 135 | |
Li Zefan | 0414efa | 2011-04-20 10:20:14 +0800 | [diff] [blame] | 136 | ret = btrfs_insert_empty_inode(trans, root, path, ino); |
Josef Bacik | 0af3d00 | 2010-06-21 14:48:16 -0400 | [diff] [blame] | 137 | if (ret) |
| 138 | return ret; |
| 139 | |
Josef Bacik | 5b0e95b | 2011-10-06 08:58:24 -0400 | [diff] [blame] | 140 | /* We inline crc's for the free disk space cache */ |
| 141 | if (ino != BTRFS_FREE_INO_OBJECTID) |
| 142 | flags |= BTRFS_INODE_NODATASUM | BTRFS_INODE_NODATACOW; |
| 143 | |
Josef Bacik | 0af3d00 | 2010-06-21 14:48:16 -0400 | [diff] [blame] | 144 | leaf = path->nodes[0]; |
| 145 | inode_item = btrfs_item_ptr(leaf, path->slots[0], |
| 146 | struct btrfs_inode_item); |
| 147 | btrfs_item_key(leaf, &disk_key, path->slots[0]); |
| 148 | memset_extent_buffer(leaf, 0, (unsigned long)inode_item, |
| 149 | sizeof(*inode_item)); |
| 150 | btrfs_set_inode_generation(leaf, inode_item, trans->transid); |
| 151 | btrfs_set_inode_size(leaf, inode_item, 0); |
| 152 | btrfs_set_inode_nbytes(leaf, inode_item, 0); |
| 153 | btrfs_set_inode_uid(leaf, inode_item, 0); |
| 154 | btrfs_set_inode_gid(leaf, inode_item, 0); |
| 155 | btrfs_set_inode_mode(leaf, inode_item, S_IFREG | 0600); |
Josef Bacik | 5b0e95b | 2011-10-06 08:58:24 -0400 | [diff] [blame] | 156 | btrfs_set_inode_flags(leaf, inode_item, flags); |
Josef Bacik | 0af3d00 | 2010-06-21 14:48:16 -0400 | [diff] [blame] | 157 | btrfs_set_inode_nlink(leaf, inode_item, 1); |
| 158 | btrfs_set_inode_transid(leaf, inode_item, trans->transid); |
Li Zefan | 0414efa | 2011-04-20 10:20:14 +0800 | [diff] [blame] | 159 | btrfs_set_inode_block_group(leaf, inode_item, offset); |
Josef Bacik | 0af3d00 | 2010-06-21 14:48:16 -0400 | [diff] [blame] | 160 | btrfs_mark_buffer_dirty(leaf); |
David Sterba | b3b4aa7 | 2011-04-21 01:20:15 +0200 | [diff] [blame] | 161 | btrfs_release_path(path); |
Josef Bacik | 0af3d00 | 2010-06-21 14:48:16 -0400 | [diff] [blame] | 162 | |
| 163 | key.objectid = BTRFS_FREE_SPACE_OBJECTID; |
Li Zefan | 0414efa | 2011-04-20 10:20:14 +0800 | [diff] [blame] | 164 | key.offset = offset; |
Josef Bacik | 0af3d00 | 2010-06-21 14:48:16 -0400 | [diff] [blame] | 165 | key.type = 0; |
| 166 | |
| 167 | ret = btrfs_insert_empty_item(trans, root, path, &key, |
| 168 | sizeof(struct btrfs_free_space_header)); |
| 169 | if (ret < 0) { |
David Sterba | b3b4aa7 | 2011-04-21 01:20:15 +0200 | [diff] [blame] | 170 | btrfs_release_path(path); |
Josef Bacik | 0af3d00 | 2010-06-21 14:48:16 -0400 | [diff] [blame] | 171 | return ret; |
| 172 | } |
| 173 | leaf = path->nodes[0]; |
| 174 | header = btrfs_item_ptr(leaf, path->slots[0], |
| 175 | struct btrfs_free_space_header); |
| 176 | memset_extent_buffer(leaf, 0, (unsigned long)header, sizeof(*header)); |
| 177 | btrfs_set_free_space_key(leaf, header, &disk_key); |
| 178 | btrfs_mark_buffer_dirty(leaf); |
David Sterba | b3b4aa7 | 2011-04-21 01:20:15 +0200 | [diff] [blame] | 179 | btrfs_release_path(path); |
Josef Bacik | 0af3d00 | 2010-06-21 14:48:16 -0400 | [diff] [blame] | 180 | |
| 181 | return 0; |
| 182 | } |
| 183 | |
Li Zefan | 0414efa | 2011-04-20 10:20:14 +0800 | [diff] [blame] | 184 | int create_free_space_inode(struct btrfs_root *root, |
| 185 | struct btrfs_trans_handle *trans, |
| 186 | struct btrfs_block_group_cache *block_group, |
| 187 | struct btrfs_path *path) |
| 188 | { |
| 189 | int ret; |
| 190 | u64 ino; |
| 191 | |
| 192 | ret = btrfs_find_free_objectid(root, &ino); |
| 193 | if (ret < 0) |
| 194 | return ret; |
| 195 | |
| 196 | return __create_free_space_inode(root, trans, path, ino, |
| 197 | block_group->key.objectid); |
| 198 | } |
| 199 | |
Miao Xie | 7b61cd9 | 2013-05-13 13:55:09 +0000 | [diff] [blame] | 200 | int btrfs_check_trunc_cache_free_space(struct btrfs_root *root, |
| 201 | struct btrfs_block_rsv *rsv) |
Josef Bacik | 0af3d00 | 2010-06-21 14:48:16 -0400 | [diff] [blame] | 202 | { |
Josef Bacik | c817431 | 2011-11-02 09:29:35 -0400 | [diff] [blame] | 203 | u64 needed_bytes; |
Miao Xie | 7b61cd9 | 2013-05-13 13:55:09 +0000 | [diff] [blame] | 204 | int ret; |
Josef Bacik | c817431 | 2011-11-02 09:29:35 -0400 | [diff] [blame] | 205 | |
| 206 | /* 1 for slack space, 1 for updating the inode */ |
| 207 | needed_bytes = btrfs_calc_trunc_metadata_size(root, 1) + |
| 208 | btrfs_calc_trans_metadata_size(root, 1); |
| 209 | |
Miao Xie | 7b61cd9 | 2013-05-13 13:55:09 +0000 | [diff] [blame] | 210 | spin_lock(&rsv->lock); |
| 211 | if (rsv->reserved < needed_bytes) |
| 212 | ret = -ENOSPC; |
| 213 | else |
| 214 | ret = 0; |
| 215 | spin_unlock(&rsv->lock); |
Wei Yongjun | 4b286cd | 2013-05-21 02:39:21 +0000 | [diff] [blame] | 216 | return ret; |
Miao Xie | 7b61cd9 | 2013-05-13 13:55:09 +0000 | [diff] [blame] | 217 | } |
| 218 | |
| 219 | int btrfs_truncate_free_space_cache(struct btrfs_root *root, |
| 220 | struct btrfs_trans_handle *trans, |
| 221 | struct btrfs_path *path, |
| 222 | struct inode *inode) |
| 223 | { |
Miao Xie | 7b61cd9 | 2013-05-13 13:55:09 +0000 | [diff] [blame] | 224 | int ret = 0; |
Josef Bacik | 0af3d00 | 2010-06-21 14:48:16 -0400 | [diff] [blame] | 225 | |
Josef Bacik | 0af3d00 | 2010-06-21 14:48:16 -0400 | [diff] [blame] | 226 | btrfs_i_size_write(inode, 0); |
Kirill A. Shutemov | 7caef26 | 2013-09-12 15:13:56 -0700 | [diff] [blame] | 227 | truncate_pagecache(inode, 0); |
Josef Bacik | 0af3d00 | 2010-06-21 14:48:16 -0400 | [diff] [blame] | 228 | |
| 229 | /* |
| 230 | * We don't need an orphan item because truncating the free space cache |
| 231 | * will never be split across transactions. |
| 232 | */ |
| 233 | ret = btrfs_truncate_inode_items(trans, root, inode, |
| 234 | 0, BTRFS_EXTENT_DATA_KEY); |
| 235 | if (ret) { |
Jeff Mahoney | 79787ea | 2012-03-12 16:03:00 +0100 | [diff] [blame] | 236 | btrfs_abort_transaction(trans, root, ret); |
Josef Bacik | 0af3d00 | 2010-06-21 14:48:16 -0400 | [diff] [blame] | 237 | return ret; |
| 238 | } |
| 239 | |
Li Zefan | 82d5902 | 2011-04-20 10:33:24 +0800 | [diff] [blame] | 240 | ret = btrfs_update_inode(trans, root, inode); |
Jeff Mahoney | 79787ea | 2012-03-12 16:03:00 +0100 | [diff] [blame] | 241 | if (ret) |
| 242 | btrfs_abort_transaction(trans, root, ret); |
Josef Bacik | c817431 | 2011-11-02 09:29:35 -0400 | [diff] [blame] | 243 | |
Li Zefan | 82d5902 | 2011-04-20 10:33:24 +0800 | [diff] [blame] | 244 | return ret; |
Josef Bacik | 0af3d00 | 2010-06-21 14:48:16 -0400 | [diff] [blame] | 245 | } |
| 246 | |
Josef Bacik | 9d66e23 | 2010-08-25 16:54:15 -0400 | [diff] [blame] | 247 | static int readahead_cache(struct inode *inode) |
| 248 | { |
| 249 | struct file_ra_state *ra; |
| 250 | unsigned long last_index; |
| 251 | |
| 252 | ra = kzalloc(sizeof(*ra), GFP_NOFS); |
| 253 | if (!ra) |
| 254 | return -ENOMEM; |
| 255 | |
| 256 | file_ra_state_init(ra, inode->i_mapping); |
| 257 | last_index = (i_size_read(inode) - 1) >> PAGE_CACHE_SHIFT; |
| 258 | |
| 259 | page_cache_sync_readahead(inode->i_mapping, ra, NULL, 0, last_index); |
| 260 | |
| 261 | kfree(ra); |
| 262 | |
| 263 | return 0; |
| 264 | } |
| 265 | |
Josef Bacik | a67509c | 2011-10-05 15:18:58 -0400 | [diff] [blame] | 266 | struct io_ctl { |
| 267 | void *cur, *orig; |
| 268 | struct page *page; |
| 269 | struct page **pages; |
| 270 | struct btrfs_root *root; |
| 271 | unsigned long size; |
| 272 | int index; |
| 273 | int num_pages; |
Josef Bacik | 5b0e95b | 2011-10-06 08:58:24 -0400 | [diff] [blame] | 274 | unsigned check_crcs:1; |
Josef Bacik | a67509c | 2011-10-05 15:18:58 -0400 | [diff] [blame] | 275 | }; |
| 276 | |
| 277 | static int io_ctl_init(struct io_ctl *io_ctl, struct inode *inode, |
| 278 | struct btrfs_root *root) |
| 279 | { |
| 280 | memset(io_ctl, 0, sizeof(struct io_ctl)); |
| 281 | io_ctl->num_pages = (i_size_read(inode) + PAGE_CACHE_SIZE - 1) >> |
| 282 | PAGE_CACHE_SHIFT; |
| 283 | io_ctl->pages = kzalloc(sizeof(struct page *) * io_ctl->num_pages, |
| 284 | GFP_NOFS); |
| 285 | if (!io_ctl->pages) |
| 286 | return -ENOMEM; |
| 287 | io_ctl->root = root; |
Josef Bacik | 5b0e95b | 2011-10-06 08:58:24 -0400 | [diff] [blame] | 288 | if (btrfs_ino(inode) != BTRFS_FREE_INO_OBJECTID) |
| 289 | io_ctl->check_crcs = 1; |
Josef Bacik | a67509c | 2011-10-05 15:18:58 -0400 | [diff] [blame] | 290 | return 0; |
| 291 | } |
| 292 | |
| 293 | static void io_ctl_free(struct io_ctl *io_ctl) |
| 294 | { |
| 295 | kfree(io_ctl->pages); |
| 296 | } |
| 297 | |
| 298 | static void io_ctl_unmap_page(struct io_ctl *io_ctl) |
| 299 | { |
| 300 | if (io_ctl->cur) { |
| 301 | kunmap(io_ctl->page); |
| 302 | io_ctl->cur = NULL; |
| 303 | io_ctl->orig = NULL; |
| 304 | } |
| 305 | } |
| 306 | |
| 307 | static void io_ctl_map_page(struct io_ctl *io_ctl, int clear) |
| 308 | { |
Josef Bacik | b12d686 | 2013-08-26 17:14:08 -0400 | [diff] [blame] | 309 | ASSERT(io_ctl->index < io_ctl->num_pages); |
Josef Bacik | a67509c | 2011-10-05 15:18:58 -0400 | [diff] [blame] | 310 | io_ctl->page = io_ctl->pages[io_ctl->index++]; |
| 311 | io_ctl->cur = kmap(io_ctl->page); |
| 312 | io_ctl->orig = io_ctl->cur; |
| 313 | io_ctl->size = PAGE_CACHE_SIZE; |
| 314 | if (clear) |
| 315 | memset(io_ctl->cur, 0, PAGE_CACHE_SIZE); |
| 316 | } |
| 317 | |
| 318 | static void io_ctl_drop_pages(struct io_ctl *io_ctl) |
| 319 | { |
| 320 | int i; |
| 321 | |
| 322 | io_ctl_unmap_page(io_ctl); |
| 323 | |
| 324 | for (i = 0; i < io_ctl->num_pages; i++) { |
Li Zefan | a1ee5a4 | 2012-01-09 14:27:42 +0800 | [diff] [blame] | 325 | if (io_ctl->pages[i]) { |
| 326 | ClearPageChecked(io_ctl->pages[i]); |
| 327 | unlock_page(io_ctl->pages[i]); |
| 328 | page_cache_release(io_ctl->pages[i]); |
| 329 | } |
Josef Bacik | a67509c | 2011-10-05 15:18:58 -0400 | [diff] [blame] | 330 | } |
| 331 | } |
| 332 | |
| 333 | static int io_ctl_prepare_pages(struct io_ctl *io_ctl, struct inode *inode, |
| 334 | int uptodate) |
| 335 | { |
| 336 | struct page *page; |
| 337 | gfp_t mask = btrfs_alloc_write_mask(inode->i_mapping); |
| 338 | int i; |
| 339 | |
| 340 | for (i = 0; i < io_ctl->num_pages; i++) { |
| 341 | page = find_or_create_page(inode->i_mapping, i, mask); |
| 342 | if (!page) { |
| 343 | io_ctl_drop_pages(io_ctl); |
| 344 | return -ENOMEM; |
| 345 | } |
| 346 | io_ctl->pages[i] = page; |
| 347 | if (uptodate && !PageUptodate(page)) { |
| 348 | btrfs_readpage(NULL, page); |
| 349 | lock_page(page); |
| 350 | if (!PageUptodate(page)) { |
| 351 | printk(KERN_ERR "btrfs: error reading free " |
| 352 | "space cache\n"); |
| 353 | io_ctl_drop_pages(io_ctl); |
| 354 | return -EIO; |
| 355 | } |
| 356 | } |
| 357 | } |
| 358 | |
Josef Bacik | f7d61dc | 2011-11-15 09:31:24 -0500 | [diff] [blame] | 359 | for (i = 0; i < io_ctl->num_pages; i++) { |
| 360 | clear_page_dirty_for_io(io_ctl->pages[i]); |
| 361 | set_page_extent_mapped(io_ctl->pages[i]); |
| 362 | } |
| 363 | |
Josef Bacik | a67509c | 2011-10-05 15:18:58 -0400 | [diff] [blame] | 364 | return 0; |
| 365 | } |
| 366 | |
| 367 | static void io_ctl_set_generation(struct io_ctl *io_ctl, u64 generation) |
| 368 | { |
Al Viro | 528c032 | 2012-04-13 11:03:55 -0400 | [diff] [blame] | 369 | __le64 *val; |
Josef Bacik | a67509c | 2011-10-05 15:18:58 -0400 | [diff] [blame] | 370 | |
| 371 | io_ctl_map_page(io_ctl, 1); |
| 372 | |
| 373 | /* |
Josef Bacik | 5b0e95b | 2011-10-06 08:58:24 -0400 | [diff] [blame] | 374 | * Skip the csum areas. If we don't check crcs then we just have a |
| 375 | * 64bit chunk at the front of the first page. |
Josef Bacik | a67509c | 2011-10-05 15:18:58 -0400 | [diff] [blame] | 376 | */ |
Josef Bacik | 5b0e95b | 2011-10-06 08:58:24 -0400 | [diff] [blame] | 377 | if (io_ctl->check_crcs) { |
| 378 | io_ctl->cur += (sizeof(u32) * io_ctl->num_pages); |
| 379 | io_ctl->size -= sizeof(u64) + (sizeof(u32) * io_ctl->num_pages); |
| 380 | } else { |
| 381 | io_ctl->cur += sizeof(u64); |
| 382 | io_ctl->size -= sizeof(u64) * 2; |
| 383 | } |
Josef Bacik | a67509c | 2011-10-05 15:18:58 -0400 | [diff] [blame] | 384 | |
| 385 | val = io_ctl->cur; |
| 386 | *val = cpu_to_le64(generation); |
| 387 | io_ctl->cur += sizeof(u64); |
Josef Bacik | a67509c | 2011-10-05 15:18:58 -0400 | [diff] [blame] | 388 | } |
| 389 | |
| 390 | static int io_ctl_check_generation(struct io_ctl *io_ctl, u64 generation) |
| 391 | { |
Al Viro | 528c032 | 2012-04-13 11:03:55 -0400 | [diff] [blame] | 392 | __le64 *gen; |
Josef Bacik | a67509c | 2011-10-05 15:18:58 -0400 | [diff] [blame] | 393 | |
Josef Bacik | 5b0e95b | 2011-10-06 08:58:24 -0400 | [diff] [blame] | 394 | /* |
| 395 | * Skip the crc area. If we don't check crcs then we just have a 64bit |
| 396 | * chunk at the front of the first page. |
| 397 | */ |
| 398 | if (io_ctl->check_crcs) { |
| 399 | io_ctl->cur += sizeof(u32) * io_ctl->num_pages; |
| 400 | io_ctl->size -= sizeof(u64) + |
| 401 | (sizeof(u32) * io_ctl->num_pages); |
| 402 | } else { |
| 403 | io_ctl->cur += sizeof(u64); |
| 404 | io_ctl->size -= sizeof(u64) * 2; |
| 405 | } |
Josef Bacik | a67509c | 2011-10-05 15:18:58 -0400 | [diff] [blame] | 406 | |
Josef Bacik | a67509c | 2011-10-05 15:18:58 -0400 | [diff] [blame] | 407 | gen = io_ctl->cur; |
| 408 | if (le64_to_cpu(*gen) != generation) { |
| 409 | printk_ratelimited(KERN_ERR "btrfs: space cache generation " |
| 410 | "(%Lu) does not match inode (%Lu)\n", *gen, |
| 411 | generation); |
| 412 | io_ctl_unmap_page(io_ctl); |
| 413 | return -EIO; |
| 414 | } |
| 415 | io_ctl->cur += sizeof(u64); |
Josef Bacik | 5b0e95b | 2011-10-06 08:58:24 -0400 | [diff] [blame] | 416 | return 0; |
| 417 | } |
| 418 | |
| 419 | static void io_ctl_set_crc(struct io_ctl *io_ctl, int index) |
| 420 | { |
| 421 | u32 *tmp; |
| 422 | u32 crc = ~(u32)0; |
| 423 | unsigned offset = 0; |
| 424 | |
| 425 | if (!io_ctl->check_crcs) { |
| 426 | io_ctl_unmap_page(io_ctl); |
| 427 | return; |
| 428 | } |
| 429 | |
| 430 | if (index == 0) |
Justin P. Mattock | cb54f25 | 2011-11-21 08:43:28 -0800 | [diff] [blame] | 431 | offset = sizeof(u32) * io_ctl->num_pages; |
Josef Bacik | 5b0e95b | 2011-10-06 08:58:24 -0400 | [diff] [blame] | 432 | |
Liu Bo | b049668 | 2013-03-14 14:57:45 +0000 | [diff] [blame] | 433 | crc = btrfs_csum_data(io_ctl->orig + offset, crc, |
Josef Bacik | 5b0e95b | 2011-10-06 08:58:24 -0400 | [diff] [blame] | 434 | PAGE_CACHE_SIZE - offset); |
| 435 | btrfs_csum_final(crc, (char *)&crc); |
| 436 | io_ctl_unmap_page(io_ctl); |
| 437 | tmp = kmap(io_ctl->pages[0]); |
| 438 | tmp += index; |
| 439 | *tmp = crc; |
| 440 | kunmap(io_ctl->pages[0]); |
| 441 | } |
| 442 | |
| 443 | static int io_ctl_check_crc(struct io_ctl *io_ctl, int index) |
| 444 | { |
| 445 | u32 *tmp, val; |
| 446 | u32 crc = ~(u32)0; |
| 447 | unsigned offset = 0; |
| 448 | |
| 449 | if (!io_ctl->check_crcs) { |
| 450 | io_ctl_map_page(io_ctl, 0); |
| 451 | return 0; |
| 452 | } |
| 453 | |
| 454 | if (index == 0) |
| 455 | offset = sizeof(u32) * io_ctl->num_pages; |
| 456 | |
| 457 | tmp = kmap(io_ctl->pages[0]); |
| 458 | tmp += index; |
| 459 | val = *tmp; |
| 460 | kunmap(io_ctl->pages[0]); |
| 461 | |
| 462 | io_ctl_map_page(io_ctl, 0); |
Liu Bo | b049668 | 2013-03-14 14:57:45 +0000 | [diff] [blame] | 463 | crc = btrfs_csum_data(io_ctl->orig + offset, crc, |
Josef Bacik | 5b0e95b | 2011-10-06 08:58:24 -0400 | [diff] [blame] | 464 | PAGE_CACHE_SIZE - offset); |
| 465 | btrfs_csum_final(crc, (char *)&crc); |
| 466 | if (val != crc) { |
| 467 | printk_ratelimited(KERN_ERR "btrfs: csum mismatch on free " |
| 468 | "space cache\n"); |
| 469 | io_ctl_unmap_page(io_ctl); |
| 470 | return -EIO; |
| 471 | } |
| 472 | |
Josef Bacik | a67509c | 2011-10-05 15:18:58 -0400 | [diff] [blame] | 473 | return 0; |
| 474 | } |
| 475 | |
| 476 | static int io_ctl_add_entry(struct io_ctl *io_ctl, u64 offset, u64 bytes, |
| 477 | void *bitmap) |
| 478 | { |
| 479 | struct btrfs_free_space_entry *entry; |
| 480 | |
| 481 | if (!io_ctl->cur) |
| 482 | return -ENOSPC; |
| 483 | |
| 484 | entry = io_ctl->cur; |
| 485 | entry->offset = cpu_to_le64(offset); |
| 486 | entry->bytes = cpu_to_le64(bytes); |
| 487 | entry->type = (bitmap) ? BTRFS_FREE_SPACE_BITMAP : |
| 488 | BTRFS_FREE_SPACE_EXTENT; |
| 489 | io_ctl->cur += sizeof(struct btrfs_free_space_entry); |
| 490 | io_ctl->size -= sizeof(struct btrfs_free_space_entry); |
| 491 | |
| 492 | if (io_ctl->size >= sizeof(struct btrfs_free_space_entry)) |
| 493 | return 0; |
| 494 | |
Josef Bacik | 5b0e95b | 2011-10-06 08:58:24 -0400 | [diff] [blame] | 495 | io_ctl_set_crc(io_ctl, io_ctl->index - 1); |
Josef Bacik | a67509c | 2011-10-05 15:18:58 -0400 | [diff] [blame] | 496 | |
| 497 | /* No more pages to map */ |
| 498 | if (io_ctl->index >= io_ctl->num_pages) |
| 499 | return 0; |
| 500 | |
| 501 | /* map the next page */ |
| 502 | io_ctl_map_page(io_ctl, 1); |
| 503 | return 0; |
| 504 | } |
| 505 | |
| 506 | static int io_ctl_add_bitmap(struct io_ctl *io_ctl, void *bitmap) |
| 507 | { |
| 508 | if (!io_ctl->cur) |
| 509 | return -ENOSPC; |
| 510 | |
| 511 | /* |
| 512 | * If we aren't at the start of the current page, unmap this one and |
| 513 | * map the next one if there is any left. |
| 514 | */ |
| 515 | if (io_ctl->cur != io_ctl->orig) { |
Josef Bacik | 5b0e95b | 2011-10-06 08:58:24 -0400 | [diff] [blame] | 516 | io_ctl_set_crc(io_ctl, io_ctl->index - 1); |
Josef Bacik | a67509c | 2011-10-05 15:18:58 -0400 | [diff] [blame] | 517 | if (io_ctl->index >= io_ctl->num_pages) |
| 518 | return -ENOSPC; |
| 519 | io_ctl_map_page(io_ctl, 0); |
| 520 | } |
| 521 | |
| 522 | memcpy(io_ctl->cur, bitmap, PAGE_CACHE_SIZE); |
Josef Bacik | 5b0e95b | 2011-10-06 08:58:24 -0400 | [diff] [blame] | 523 | io_ctl_set_crc(io_ctl, io_ctl->index - 1); |
Josef Bacik | a67509c | 2011-10-05 15:18:58 -0400 | [diff] [blame] | 524 | if (io_ctl->index < io_ctl->num_pages) |
| 525 | io_ctl_map_page(io_ctl, 0); |
| 526 | return 0; |
| 527 | } |
| 528 | |
| 529 | static void io_ctl_zero_remaining_pages(struct io_ctl *io_ctl) |
| 530 | { |
Josef Bacik | 5b0e95b | 2011-10-06 08:58:24 -0400 | [diff] [blame] | 531 | /* |
| 532 | * If we're not on the boundary we know we've modified the page and we |
| 533 | * need to crc the page. |
| 534 | */ |
| 535 | if (io_ctl->cur != io_ctl->orig) |
| 536 | io_ctl_set_crc(io_ctl, io_ctl->index - 1); |
| 537 | else |
| 538 | io_ctl_unmap_page(io_ctl); |
Josef Bacik | a67509c | 2011-10-05 15:18:58 -0400 | [diff] [blame] | 539 | |
| 540 | while (io_ctl->index < io_ctl->num_pages) { |
| 541 | io_ctl_map_page(io_ctl, 1); |
Josef Bacik | 5b0e95b | 2011-10-06 08:58:24 -0400 | [diff] [blame] | 542 | io_ctl_set_crc(io_ctl, io_ctl->index - 1); |
Josef Bacik | a67509c | 2011-10-05 15:18:58 -0400 | [diff] [blame] | 543 | } |
| 544 | } |
| 545 | |
Josef Bacik | 5b0e95b | 2011-10-06 08:58:24 -0400 | [diff] [blame] | 546 | static int io_ctl_read_entry(struct io_ctl *io_ctl, |
| 547 | struct btrfs_free_space *entry, u8 *type) |
Josef Bacik | a67509c | 2011-10-05 15:18:58 -0400 | [diff] [blame] | 548 | { |
| 549 | struct btrfs_free_space_entry *e; |
Josef Bacik | 2f120c0 | 2011-11-10 20:45:05 -0500 | [diff] [blame] | 550 | int ret; |
| 551 | |
| 552 | if (!io_ctl->cur) { |
| 553 | ret = io_ctl_check_crc(io_ctl, io_ctl->index); |
| 554 | if (ret) |
| 555 | return ret; |
| 556 | } |
Josef Bacik | a67509c | 2011-10-05 15:18:58 -0400 | [diff] [blame] | 557 | |
| 558 | e = io_ctl->cur; |
| 559 | entry->offset = le64_to_cpu(e->offset); |
| 560 | entry->bytes = le64_to_cpu(e->bytes); |
Josef Bacik | 5b0e95b | 2011-10-06 08:58:24 -0400 | [diff] [blame] | 561 | *type = e->type; |
Josef Bacik | a67509c | 2011-10-05 15:18:58 -0400 | [diff] [blame] | 562 | io_ctl->cur += sizeof(struct btrfs_free_space_entry); |
| 563 | io_ctl->size -= sizeof(struct btrfs_free_space_entry); |
| 564 | |
| 565 | if (io_ctl->size >= sizeof(struct btrfs_free_space_entry)) |
Josef Bacik | 5b0e95b | 2011-10-06 08:58:24 -0400 | [diff] [blame] | 566 | return 0; |
Josef Bacik | a67509c | 2011-10-05 15:18:58 -0400 | [diff] [blame] | 567 | |
| 568 | io_ctl_unmap_page(io_ctl); |
| 569 | |
Josef Bacik | 2f120c0 | 2011-11-10 20:45:05 -0500 | [diff] [blame] | 570 | return 0; |
Josef Bacik | a67509c | 2011-10-05 15:18:58 -0400 | [diff] [blame] | 571 | } |
| 572 | |
Josef Bacik | 5b0e95b | 2011-10-06 08:58:24 -0400 | [diff] [blame] | 573 | static int io_ctl_read_bitmap(struct io_ctl *io_ctl, |
| 574 | struct btrfs_free_space *entry) |
Josef Bacik | a67509c | 2011-10-05 15:18:58 -0400 | [diff] [blame] | 575 | { |
Josef Bacik | 5b0e95b | 2011-10-06 08:58:24 -0400 | [diff] [blame] | 576 | int ret; |
| 577 | |
Josef Bacik | 5b0e95b | 2011-10-06 08:58:24 -0400 | [diff] [blame] | 578 | ret = io_ctl_check_crc(io_ctl, io_ctl->index); |
| 579 | if (ret) |
| 580 | return ret; |
| 581 | |
Josef Bacik | a67509c | 2011-10-05 15:18:58 -0400 | [diff] [blame] | 582 | memcpy(entry->bitmap, io_ctl->cur, PAGE_CACHE_SIZE); |
| 583 | io_ctl_unmap_page(io_ctl); |
Josef Bacik | 5b0e95b | 2011-10-06 08:58:24 -0400 | [diff] [blame] | 584 | |
| 585 | return 0; |
Josef Bacik | a67509c | 2011-10-05 15:18:58 -0400 | [diff] [blame] | 586 | } |
| 587 | |
Josef Bacik | cd023e7 | 2012-05-14 10:06:40 -0400 | [diff] [blame] | 588 | /* |
| 589 | * Since we attach pinned extents after the fact we can have contiguous sections |
| 590 | * of free space that are split up in entries. This poses a problem with the |
| 591 | * tree logging stuff since it could have allocated across what appears to be 2 |
| 592 | * entries since we would have merged the entries when adding the pinned extents |
| 593 | * back to the free space cache. So run through the space cache that we just |
| 594 | * loaded and merge contiguous entries. This will make the log replay stuff not |
| 595 | * blow up and it will make for nicer allocator behavior. |
| 596 | */ |
| 597 | static void merge_space_tree(struct btrfs_free_space_ctl *ctl) |
| 598 | { |
| 599 | struct btrfs_free_space *e, *prev = NULL; |
| 600 | struct rb_node *n; |
| 601 | |
| 602 | again: |
| 603 | spin_lock(&ctl->tree_lock); |
| 604 | for (n = rb_first(&ctl->free_space_offset); n; n = rb_next(n)) { |
| 605 | e = rb_entry(n, struct btrfs_free_space, offset_index); |
| 606 | if (!prev) |
| 607 | goto next; |
| 608 | if (e->bitmap || prev->bitmap) |
| 609 | goto next; |
| 610 | if (prev->offset + prev->bytes == e->offset) { |
| 611 | unlink_free_space(ctl, prev); |
| 612 | unlink_free_space(ctl, e); |
| 613 | prev->bytes += e->bytes; |
| 614 | kmem_cache_free(btrfs_free_space_cachep, e); |
| 615 | link_free_space(ctl, prev); |
| 616 | prev = NULL; |
| 617 | spin_unlock(&ctl->tree_lock); |
| 618 | goto again; |
| 619 | } |
| 620 | next: |
| 621 | prev = e; |
| 622 | } |
| 623 | spin_unlock(&ctl->tree_lock); |
| 624 | } |
| 625 | |
Eric Sandeen | 48a3b63 | 2013-04-25 20:41:01 +0000 | [diff] [blame] | 626 | static int __load_free_space_cache(struct btrfs_root *root, struct inode *inode, |
| 627 | struct btrfs_free_space_ctl *ctl, |
| 628 | struct btrfs_path *path, u64 offset) |
Josef Bacik | 9d66e23 | 2010-08-25 16:54:15 -0400 | [diff] [blame] | 629 | { |
Josef Bacik | 9d66e23 | 2010-08-25 16:54:15 -0400 | [diff] [blame] | 630 | struct btrfs_free_space_header *header; |
| 631 | struct extent_buffer *leaf; |
Josef Bacik | a67509c | 2011-10-05 15:18:58 -0400 | [diff] [blame] | 632 | struct io_ctl io_ctl; |
Josef Bacik | 9d66e23 | 2010-08-25 16:54:15 -0400 | [diff] [blame] | 633 | struct btrfs_key key; |
Josef Bacik | a67509c | 2011-10-05 15:18:58 -0400 | [diff] [blame] | 634 | struct btrfs_free_space *e, *n; |
Josef Bacik | 9d66e23 | 2010-08-25 16:54:15 -0400 | [diff] [blame] | 635 | struct list_head bitmaps; |
| 636 | u64 num_entries; |
| 637 | u64 num_bitmaps; |
| 638 | u64 generation; |
Josef Bacik | a67509c | 2011-10-05 15:18:58 -0400 | [diff] [blame] | 639 | u8 type; |
Josef Bacik | f6a3982 | 2011-06-06 10:50:35 -0400 | [diff] [blame] | 640 | int ret = 0; |
Josef Bacik | 9d66e23 | 2010-08-25 16:54:15 -0400 | [diff] [blame] | 641 | |
| 642 | INIT_LIST_HEAD(&bitmaps); |
| 643 | |
Josef Bacik | 9d66e23 | 2010-08-25 16:54:15 -0400 | [diff] [blame] | 644 | /* Nothing in the space cache, goodbye */ |
Li Zefan | 0414efa | 2011-04-20 10:20:14 +0800 | [diff] [blame] | 645 | if (!i_size_read(inode)) |
Josef Bacik | a67509c | 2011-10-05 15:18:58 -0400 | [diff] [blame] | 646 | return 0; |
Josef Bacik | 9d66e23 | 2010-08-25 16:54:15 -0400 | [diff] [blame] | 647 | |
| 648 | key.objectid = BTRFS_FREE_SPACE_OBJECTID; |
Li Zefan | 0414efa | 2011-04-20 10:20:14 +0800 | [diff] [blame] | 649 | key.offset = offset; |
Josef Bacik | 9d66e23 | 2010-08-25 16:54:15 -0400 | [diff] [blame] | 650 | key.type = 0; |
| 651 | |
| 652 | ret = btrfs_search_slot(NULL, root, &key, path, 0, 0); |
Li Zefan | 0414efa | 2011-04-20 10:20:14 +0800 | [diff] [blame] | 653 | if (ret < 0) |
Josef Bacik | a67509c | 2011-10-05 15:18:58 -0400 | [diff] [blame] | 654 | return 0; |
Li Zefan | 0414efa | 2011-04-20 10:20:14 +0800 | [diff] [blame] | 655 | else if (ret > 0) { |
Chris Mason | 945d896 | 2011-05-22 12:33:42 -0400 | [diff] [blame] | 656 | btrfs_release_path(path); |
Josef Bacik | a67509c | 2011-10-05 15:18:58 -0400 | [diff] [blame] | 657 | return 0; |
Josef Bacik | 9d66e23 | 2010-08-25 16:54:15 -0400 | [diff] [blame] | 658 | } |
| 659 | |
Li Zefan | 0414efa | 2011-04-20 10:20:14 +0800 | [diff] [blame] | 660 | ret = -1; |
| 661 | |
Josef Bacik | 9d66e23 | 2010-08-25 16:54:15 -0400 | [diff] [blame] | 662 | leaf = path->nodes[0]; |
| 663 | header = btrfs_item_ptr(leaf, path->slots[0], |
| 664 | struct btrfs_free_space_header); |
| 665 | num_entries = btrfs_free_space_entries(leaf, header); |
| 666 | num_bitmaps = btrfs_free_space_bitmaps(leaf, header); |
| 667 | generation = btrfs_free_space_generation(leaf, header); |
Chris Mason | 945d896 | 2011-05-22 12:33:42 -0400 | [diff] [blame] | 668 | btrfs_release_path(path); |
Josef Bacik | 9d66e23 | 2010-08-25 16:54:15 -0400 | [diff] [blame] | 669 | |
| 670 | if (BTRFS_I(inode)->generation != generation) { |
Simon Kirby | c2cf52e | 2013-03-19 22:41:23 +0000 | [diff] [blame] | 671 | btrfs_err(root->fs_info, |
| 672 | "free space inode generation (%llu) " |
| 673 | "did not match free space cache generation (%llu)", |
Geert Uytterhoeven | c1c9ff7 | 2013-08-20 13:20:07 +0200 | [diff] [blame] | 674 | BTRFS_I(inode)->generation, generation); |
Josef Bacik | a67509c | 2011-10-05 15:18:58 -0400 | [diff] [blame] | 675 | return 0; |
Josef Bacik | 9d66e23 | 2010-08-25 16:54:15 -0400 | [diff] [blame] | 676 | } |
| 677 | |
| 678 | if (!num_entries) |
Josef Bacik | a67509c | 2011-10-05 15:18:58 -0400 | [diff] [blame] | 679 | return 0; |
Josef Bacik | 9d66e23 | 2010-08-25 16:54:15 -0400 | [diff] [blame] | 680 | |
Li Zefan | 706efc6 | 2012-01-09 14:36:28 +0800 | [diff] [blame] | 681 | ret = io_ctl_init(&io_ctl, inode, root); |
| 682 | if (ret) |
| 683 | return ret; |
| 684 | |
Josef Bacik | 9d66e23 | 2010-08-25 16:54:15 -0400 | [diff] [blame] | 685 | ret = readahead_cache(inode); |
Li Zefan | 0414efa | 2011-04-20 10:20:14 +0800 | [diff] [blame] | 686 | if (ret) |
Josef Bacik | 9d66e23 | 2010-08-25 16:54:15 -0400 | [diff] [blame] | 687 | goto out; |
Josef Bacik | 9d66e23 | 2010-08-25 16:54:15 -0400 | [diff] [blame] | 688 | |
Josef Bacik | a67509c | 2011-10-05 15:18:58 -0400 | [diff] [blame] | 689 | ret = io_ctl_prepare_pages(&io_ctl, inode, 1); |
| 690 | if (ret) |
| 691 | goto out; |
Josef Bacik | 9d66e23 | 2010-08-25 16:54:15 -0400 | [diff] [blame] | 692 | |
Josef Bacik | 5b0e95b | 2011-10-06 08:58:24 -0400 | [diff] [blame] | 693 | ret = io_ctl_check_crc(&io_ctl, 0); |
| 694 | if (ret) |
| 695 | goto free_cache; |
| 696 | |
Josef Bacik | a67509c | 2011-10-05 15:18:58 -0400 | [diff] [blame] | 697 | ret = io_ctl_check_generation(&io_ctl, generation); |
| 698 | if (ret) |
| 699 | goto free_cache; |
Josef Bacik | 9d66e23 | 2010-08-25 16:54:15 -0400 | [diff] [blame] | 700 | |
Josef Bacik | a67509c | 2011-10-05 15:18:58 -0400 | [diff] [blame] | 701 | while (num_entries) { |
| 702 | e = kmem_cache_zalloc(btrfs_free_space_cachep, |
| 703 | GFP_NOFS); |
| 704 | if (!e) |
Josef Bacik | 9d66e23 | 2010-08-25 16:54:15 -0400 | [diff] [blame] | 705 | goto free_cache; |
Josef Bacik | 9d66e23 | 2010-08-25 16:54:15 -0400 | [diff] [blame] | 706 | |
Josef Bacik | 5b0e95b | 2011-10-06 08:58:24 -0400 | [diff] [blame] | 707 | ret = io_ctl_read_entry(&io_ctl, e, &type); |
| 708 | if (ret) { |
| 709 | kmem_cache_free(btrfs_free_space_cachep, e); |
| 710 | goto free_cache; |
| 711 | } |
| 712 | |
Josef Bacik | a67509c | 2011-10-05 15:18:58 -0400 | [diff] [blame] | 713 | if (!e->bytes) { |
| 714 | kmem_cache_free(btrfs_free_space_cachep, e); |
| 715 | goto free_cache; |
Josef Bacik | 9d66e23 | 2010-08-25 16:54:15 -0400 | [diff] [blame] | 716 | } |
Josef Bacik | 9d66e23 | 2010-08-25 16:54:15 -0400 | [diff] [blame] | 717 | |
Josef Bacik | a67509c | 2011-10-05 15:18:58 -0400 | [diff] [blame] | 718 | if (type == BTRFS_FREE_SPACE_EXTENT) { |
| 719 | spin_lock(&ctl->tree_lock); |
| 720 | ret = link_free_space(ctl, e); |
| 721 | spin_unlock(&ctl->tree_lock); |
| 722 | if (ret) { |
Simon Kirby | c2cf52e | 2013-03-19 22:41:23 +0000 | [diff] [blame] | 723 | btrfs_err(root->fs_info, |
| 724 | "Duplicate entries in free space cache, dumping"); |
Josef Bacik | dc89e98 | 2011-01-28 17:05:48 -0500 | [diff] [blame] | 725 | kmem_cache_free(btrfs_free_space_cachep, e); |
Josef Bacik | 9d66e23 | 2010-08-25 16:54:15 -0400 | [diff] [blame] | 726 | goto free_cache; |
| 727 | } |
Josef Bacik | a67509c | 2011-10-05 15:18:58 -0400 | [diff] [blame] | 728 | } else { |
Josef Bacik | b12d686 | 2013-08-26 17:14:08 -0400 | [diff] [blame] | 729 | ASSERT(num_bitmaps); |
Josef Bacik | a67509c | 2011-10-05 15:18:58 -0400 | [diff] [blame] | 730 | num_bitmaps--; |
| 731 | e->bitmap = kzalloc(PAGE_CACHE_SIZE, GFP_NOFS); |
| 732 | if (!e->bitmap) { |
| 733 | kmem_cache_free( |
| 734 | btrfs_free_space_cachep, e); |
| 735 | goto free_cache; |
Josef Bacik | 9d66e23 | 2010-08-25 16:54:15 -0400 | [diff] [blame] | 736 | } |
Josef Bacik | a67509c | 2011-10-05 15:18:58 -0400 | [diff] [blame] | 737 | spin_lock(&ctl->tree_lock); |
| 738 | ret = link_free_space(ctl, e); |
| 739 | ctl->total_bitmaps++; |
| 740 | ctl->op->recalc_thresholds(ctl); |
| 741 | spin_unlock(&ctl->tree_lock); |
| 742 | if (ret) { |
Simon Kirby | c2cf52e | 2013-03-19 22:41:23 +0000 | [diff] [blame] | 743 | btrfs_err(root->fs_info, |
| 744 | "Duplicate entries in free space cache, dumping"); |
Josef Bacik | a67509c | 2011-10-05 15:18:58 -0400 | [diff] [blame] | 745 | kmem_cache_free(btrfs_free_space_cachep, e); |
| 746 | goto free_cache; |
| 747 | } |
| 748 | list_add_tail(&e->list, &bitmaps); |
Josef Bacik | 9d66e23 | 2010-08-25 16:54:15 -0400 | [diff] [blame] | 749 | } |
| 750 | |
Josef Bacik | a67509c | 2011-10-05 15:18:58 -0400 | [diff] [blame] | 751 | num_entries--; |
Josef Bacik | 9d66e23 | 2010-08-25 16:54:15 -0400 | [diff] [blame] | 752 | } |
| 753 | |
Josef Bacik | 2f120c0 | 2011-11-10 20:45:05 -0500 | [diff] [blame] | 754 | io_ctl_unmap_page(&io_ctl); |
| 755 | |
Josef Bacik | a67509c | 2011-10-05 15:18:58 -0400 | [diff] [blame] | 756 | /* |
| 757 | * We add the bitmaps at the end of the entries in order that |
| 758 | * the bitmap entries are added to the cache. |
| 759 | */ |
| 760 | list_for_each_entry_safe(e, n, &bitmaps, list) { |
| 761 | list_del_init(&e->list); |
Josef Bacik | 5b0e95b | 2011-10-06 08:58:24 -0400 | [diff] [blame] | 762 | ret = io_ctl_read_bitmap(&io_ctl, e); |
| 763 | if (ret) |
| 764 | goto free_cache; |
Josef Bacik | a67509c | 2011-10-05 15:18:58 -0400 | [diff] [blame] | 765 | } |
| 766 | |
| 767 | io_ctl_drop_pages(&io_ctl); |
Josef Bacik | cd023e7 | 2012-05-14 10:06:40 -0400 | [diff] [blame] | 768 | merge_space_tree(ctl); |
Josef Bacik | 9d66e23 | 2010-08-25 16:54:15 -0400 | [diff] [blame] | 769 | ret = 1; |
| 770 | out: |
Josef Bacik | a67509c | 2011-10-05 15:18:58 -0400 | [diff] [blame] | 771 | io_ctl_free(&io_ctl); |
Josef Bacik | 9d66e23 | 2010-08-25 16:54:15 -0400 | [diff] [blame] | 772 | return ret; |
Josef Bacik | 9d66e23 | 2010-08-25 16:54:15 -0400 | [diff] [blame] | 773 | free_cache: |
Josef Bacik | a67509c | 2011-10-05 15:18:58 -0400 | [diff] [blame] | 774 | io_ctl_drop_pages(&io_ctl); |
Li Zefan | 0414efa | 2011-04-20 10:20:14 +0800 | [diff] [blame] | 775 | __btrfs_remove_free_space_cache(ctl); |
Josef Bacik | 9d66e23 | 2010-08-25 16:54:15 -0400 | [diff] [blame] | 776 | goto out; |
| 777 | } |
| 778 | |
Li Zefan | 0414efa | 2011-04-20 10:20:14 +0800 | [diff] [blame] | 779 | int load_free_space_cache(struct btrfs_fs_info *fs_info, |
| 780 | struct btrfs_block_group_cache *block_group) |
Josef Bacik | 0cb59c9 | 2010-07-02 12:14:14 -0400 | [diff] [blame] | 781 | { |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 782 | struct btrfs_free_space_ctl *ctl = block_group->free_space_ctl; |
Li Zefan | 0414efa | 2011-04-20 10:20:14 +0800 | [diff] [blame] | 783 | struct btrfs_root *root = fs_info->tree_root; |
| 784 | struct inode *inode; |
| 785 | struct btrfs_path *path; |
Josef Bacik | 5b0e95b | 2011-10-06 08:58:24 -0400 | [diff] [blame] | 786 | int ret = 0; |
Li Zefan | 0414efa | 2011-04-20 10:20:14 +0800 | [diff] [blame] | 787 | bool matched; |
| 788 | u64 used = btrfs_block_group_used(&block_group->item); |
| 789 | |
| 790 | /* |
Li Zefan | 0414efa | 2011-04-20 10:20:14 +0800 | [diff] [blame] | 791 | * If this block group has been marked to be cleared for one reason or |
| 792 | * another then we can't trust the on disk cache, so just return. |
| 793 | */ |
| 794 | spin_lock(&block_group->lock); |
| 795 | if (block_group->disk_cache_state != BTRFS_DC_WRITTEN) { |
| 796 | spin_unlock(&block_group->lock); |
| 797 | return 0; |
| 798 | } |
| 799 | spin_unlock(&block_group->lock); |
| 800 | |
| 801 | path = btrfs_alloc_path(); |
| 802 | if (!path) |
| 803 | return 0; |
Josef Bacik | d53ba47 | 2012-04-12 16:03:57 -0400 | [diff] [blame] | 804 | path->search_commit_root = 1; |
| 805 | path->skip_locking = 1; |
Li Zefan | 0414efa | 2011-04-20 10:20:14 +0800 | [diff] [blame] | 806 | |
| 807 | inode = lookup_free_space_inode(root, block_group, path); |
| 808 | if (IS_ERR(inode)) { |
| 809 | btrfs_free_path(path); |
| 810 | return 0; |
| 811 | } |
| 812 | |
Josef Bacik | 5b0e95b | 2011-10-06 08:58:24 -0400 | [diff] [blame] | 813 | /* We may have converted the inode and made the cache invalid. */ |
| 814 | spin_lock(&block_group->lock); |
| 815 | if (block_group->disk_cache_state != BTRFS_DC_WRITTEN) { |
| 816 | spin_unlock(&block_group->lock); |
Tsutomu Itoh | a7e221e | 2012-02-14 17:12:23 +0900 | [diff] [blame] | 817 | btrfs_free_path(path); |
Josef Bacik | 5b0e95b | 2011-10-06 08:58:24 -0400 | [diff] [blame] | 818 | goto out; |
| 819 | } |
| 820 | spin_unlock(&block_group->lock); |
| 821 | |
Li Zefan | 0414efa | 2011-04-20 10:20:14 +0800 | [diff] [blame] | 822 | ret = __load_free_space_cache(fs_info->tree_root, inode, ctl, |
| 823 | path, block_group->key.objectid); |
| 824 | btrfs_free_path(path); |
| 825 | if (ret <= 0) |
| 826 | goto out; |
| 827 | |
| 828 | spin_lock(&ctl->tree_lock); |
| 829 | matched = (ctl->free_space == (block_group->key.offset - used - |
| 830 | block_group->bytes_super)); |
| 831 | spin_unlock(&ctl->tree_lock); |
| 832 | |
| 833 | if (!matched) { |
| 834 | __btrfs_remove_free_space_cache(ctl); |
Simon Kirby | c2cf52e | 2013-03-19 22:41:23 +0000 | [diff] [blame] | 835 | btrfs_err(fs_info, "block group %llu has wrong amount of free space", |
| 836 | block_group->key.objectid); |
Li Zefan | 0414efa | 2011-04-20 10:20:14 +0800 | [diff] [blame] | 837 | ret = -1; |
| 838 | } |
| 839 | out: |
| 840 | if (ret < 0) { |
| 841 | /* This cache is bogus, make sure it gets cleared */ |
| 842 | spin_lock(&block_group->lock); |
| 843 | block_group->disk_cache_state = BTRFS_DC_CLEAR; |
| 844 | spin_unlock(&block_group->lock); |
Li Zefan | 82d5902 | 2011-04-20 10:33:24 +0800 | [diff] [blame] | 845 | ret = 0; |
Li Zefan | 0414efa | 2011-04-20 10:20:14 +0800 | [diff] [blame] | 846 | |
Simon Kirby | c2cf52e | 2013-03-19 22:41:23 +0000 | [diff] [blame] | 847 | btrfs_err(fs_info, "failed to load free space cache for block group %llu", |
| 848 | block_group->key.objectid); |
Li Zefan | 0414efa | 2011-04-20 10:20:14 +0800 | [diff] [blame] | 849 | } |
| 850 | |
| 851 | iput(inode); |
| 852 | return ret; |
| 853 | } |
| 854 | |
Josef Bacik | c09544e | 2011-08-30 10:19:10 -0400 | [diff] [blame] | 855 | /** |
| 856 | * __btrfs_write_out_cache - write out cached info to an inode |
| 857 | * @root - the root the inode belongs to |
| 858 | * @ctl - the free space cache we are going to write out |
| 859 | * @block_group - the block_group for this cache if it belongs to a block_group |
| 860 | * @trans - the trans handle |
| 861 | * @path - the path to use |
| 862 | * @offset - the offset for the key we'll insert |
| 863 | * |
| 864 | * This function writes out a free space cache struct to disk for quick recovery |
| 865 | * on mount. This will return 0 if it was successfull in writing the cache out, |
| 866 | * and -1 if it was not. |
| 867 | */ |
Eric Sandeen | 48a3b63 | 2013-04-25 20:41:01 +0000 | [diff] [blame] | 868 | static int __btrfs_write_out_cache(struct btrfs_root *root, struct inode *inode, |
| 869 | struct btrfs_free_space_ctl *ctl, |
| 870 | struct btrfs_block_group_cache *block_group, |
| 871 | struct btrfs_trans_handle *trans, |
| 872 | struct btrfs_path *path, u64 offset) |
Josef Bacik | 0cb59c9 | 2010-07-02 12:14:14 -0400 | [diff] [blame] | 873 | { |
| 874 | struct btrfs_free_space_header *header; |
| 875 | struct extent_buffer *leaf; |
Josef Bacik | 0cb59c9 | 2010-07-02 12:14:14 -0400 | [diff] [blame] | 876 | struct rb_node *node; |
| 877 | struct list_head *pos, *n; |
Josef Bacik | 0cb59c9 | 2010-07-02 12:14:14 -0400 | [diff] [blame] | 878 | struct extent_state *cached_state = NULL; |
Josef Bacik | 43be214 | 2011-04-01 14:55:00 +0000 | [diff] [blame] | 879 | struct btrfs_free_cluster *cluster = NULL; |
| 880 | struct extent_io_tree *unpin = NULL; |
Josef Bacik | a67509c | 2011-10-05 15:18:58 -0400 | [diff] [blame] | 881 | struct io_ctl io_ctl; |
Josef Bacik | 0cb59c9 | 2010-07-02 12:14:14 -0400 | [diff] [blame] | 882 | struct list_head bitmap_list; |
| 883 | struct btrfs_key key; |
Li Zefan | db804f2 | 2012-01-10 16:41:01 +0800 | [diff] [blame] | 884 | u64 start, extent_start, extent_end, len; |
Josef Bacik | 0cb59c9 | 2010-07-02 12:14:14 -0400 | [diff] [blame] | 885 | int entries = 0; |
| 886 | int bitmaps = 0; |
Josef Bacik | c09544e | 2011-08-30 10:19:10 -0400 | [diff] [blame] | 887 | int ret; |
| 888 | int err = -1; |
Josef Bacik | 0cb59c9 | 2010-07-02 12:14:14 -0400 | [diff] [blame] | 889 | |
Josef Bacik | 0cb59c9 | 2010-07-02 12:14:14 -0400 | [diff] [blame] | 890 | INIT_LIST_HEAD(&bitmap_list); |
| 891 | |
Li Zefan | 0414efa | 2011-04-20 10:20:14 +0800 | [diff] [blame] | 892 | if (!i_size_read(inode)) |
| 893 | return -1; |
Josef Bacik | 2b20982 | 2010-12-03 13:17:53 -0500 | [diff] [blame] | 894 | |
Li Zefan | 706efc6 | 2012-01-09 14:36:28 +0800 | [diff] [blame] | 895 | ret = io_ctl_init(&io_ctl, inode, root); |
| 896 | if (ret) |
| 897 | return -1; |
Josef Bacik | be1a12a | 2011-04-06 13:05:22 -0400 | [diff] [blame] | 898 | |
Josef Bacik | 43be214 | 2011-04-01 14:55:00 +0000 | [diff] [blame] | 899 | /* Get the cluster for this block_group if it exists */ |
Li Zefan | 0414efa | 2011-04-20 10:20:14 +0800 | [diff] [blame] | 900 | if (block_group && !list_empty(&block_group->cluster_list)) |
Josef Bacik | 43be214 | 2011-04-01 14:55:00 +0000 | [diff] [blame] | 901 | cluster = list_entry(block_group->cluster_list.next, |
| 902 | struct btrfs_free_cluster, |
| 903 | block_group_list); |
| 904 | |
Josef Bacik | a67509c | 2011-10-05 15:18:58 -0400 | [diff] [blame] | 905 | /* Lock all pages first so we can lock the extent safely. */ |
| 906 | io_ctl_prepare_pages(&io_ctl, inode, 0); |
Josef Bacik | 0cb59c9 | 2010-07-02 12:14:14 -0400 | [diff] [blame] | 907 | |
Josef Bacik | 0cb59c9 | 2010-07-02 12:14:14 -0400 | [diff] [blame] | 908 | lock_extent_bits(&BTRFS_I(inode)->io_tree, 0, i_size_read(inode) - 1, |
Jeff Mahoney | d008237 | 2012-03-01 14:57:19 +0100 | [diff] [blame] | 909 | 0, &cached_state); |
Josef Bacik | 0cb59c9 | 2010-07-02 12:14:14 -0400 | [diff] [blame] | 910 | |
Josef Bacik | f75b130 | 2011-10-05 10:00:18 -0400 | [diff] [blame] | 911 | node = rb_first(&ctl->free_space_offset); |
| 912 | if (!node && cluster) { |
| 913 | node = rb_first(&cluster->root); |
| 914 | cluster = NULL; |
| 915 | } |
| 916 | |
Josef Bacik | 5b0e95b | 2011-10-06 08:58:24 -0400 | [diff] [blame] | 917 | /* Make sure we can fit our crcs into the first page */ |
| 918 | if (io_ctl.check_crcs && |
Josef Bacik | 73e1e61 | 2013-05-08 16:44:57 -0400 | [diff] [blame] | 919 | (io_ctl.num_pages * sizeof(u32)) >= PAGE_CACHE_SIZE) |
Josef Bacik | 5b0e95b | 2011-10-06 08:58:24 -0400 | [diff] [blame] | 920 | goto out_nospc; |
Josef Bacik | 5b0e95b | 2011-10-06 08:58:24 -0400 | [diff] [blame] | 921 | |
Josef Bacik | a67509c | 2011-10-05 15:18:58 -0400 | [diff] [blame] | 922 | io_ctl_set_generation(&io_ctl, trans->transid); |
| 923 | |
Josef Bacik | 0cb59c9 | 2010-07-02 12:14:14 -0400 | [diff] [blame] | 924 | /* Write out the extent entries */ |
Josef Bacik | a67509c | 2011-10-05 15:18:58 -0400 | [diff] [blame] | 925 | while (node) { |
| 926 | struct btrfs_free_space *e; |
Josef Bacik | 0cb59c9 | 2010-07-02 12:14:14 -0400 | [diff] [blame] | 927 | |
Josef Bacik | a67509c | 2011-10-05 15:18:58 -0400 | [diff] [blame] | 928 | e = rb_entry(node, struct btrfs_free_space, offset_index); |
| 929 | entries++; |
Josef Bacik | 43be214 | 2011-04-01 14:55:00 +0000 | [diff] [blame] | 930 | |
Josef Bacik | a67509c | 2011-10-05 15:18:58 -0400 | [diff] [blame] | 931 | ret = io_ctl_add_entry(&io_ctl, e->offset, e->bytes, |
| 932 | e->bitmap); |
| 933 | if (ret) |
| 934 | goto out_nospc; |
| 935 | |
| 936 | if (e->bitmap) { |
| 937 | list_add_tail(&e->list, &bitmap_list); |
| 938 | bitmaps++; |
| 939 | } |
| 940 | node = rb_next(node); |
| 941 | if (!node && cluster) { |
| 942 | node = rb_first(&cluster->root); |
| 943 | cluster = NULL; |
| 944 | } |
| 945 | } |
| 946 | |
| 947 | /* |
| 948 | * We want to add any pinned extents to our free space cache |
| 949 | * so we don't leak the space |
| 950 | */ |
Li Zefan | db804f2 | 2012-01-10 16:41:01 +0800 | [diff] [blame] | 951 | |
| 952 | /* |
| 953 | * We shouldn't have switched the pinned extents yet so this is the |
| 954 | * right one |
| 955 | */ |
| 956 | unpin = root->fs_info->pinned_extents; |
| 957 | |
| 958 | if (block_group) |
| 959 | start = block_group->key.objectid; |
| 960 | |
Josef Bacik | a67509c | 2011-10-05 15:18:58 -0400 | [diff] [blame] | 961 | while (block_group && (start < block_group->key.objectid + |
| 962 | block_group->key.offset)) { |
Li Zefan | db804f2 | 2012-01-10 16:41:01 +0800 | [diff] [blame] | 963 | ret = find_first_extent_bit(unpin, start, |
| 964 | &extent_start, &extent_end, |
Josef Bacik | e613887 | 2012-09-27 17:07:30 -0400 | [diff] [blame] | 965 | EXTENT_DIRTY, NULL); |
Josef Bacik | a67509c | 2011-10-05 15:18:58 -0400 | [diff] [blame] | 966 | if (ret) { |
| 967 | ret = 0; |
Josef Bacik | be1a12a | 2011-04-06 13:05:22 -0400 | [diff] [blame] | 968 | break; |
| 969 | } |
| 970 | |
Josef Bacik | a67509c | 2011-10-05 15:18:58 -0400 | [diff] [blame] | 971 | /* This pinned extent is out of our range */ |
Li Zefan | db804f2 | 2012-01-10 16:41:01 +0800 | [diff] [blame] | 972 | if (extent_start >= block_group->key.objectid + |
Josef Bacik | a67509c | 2011-10-05 15:18:58 -0400 | [diff] [blame] | 973 | block_group->key.offset) |
| 974 | break; |
Josef Bacik | 0cb59c9 | 2010-07-02 12:14:14 -0400 | [diff] [blame] | 975 | |
Li Zefan | db804f2 | 2012-01-10 16:41:01 +0800 | [diff] [blame] | 976 | extent_start = max(extent_start, start); |
| 977 | extent_end = min(block_group->key.objectid + |
| 978 | block_group->key.offset, extent_end + 1); |
| 979 | len = extent_end - extent_start; |
Josef Bacik | 0cb59c9 | 2010-07-02 12:14:14 -0400 | [diff] [blame] | 980 | |
Josef Bacik | a67509c | 2011-10-05 15:18:58 -0400 | [diff] [blame] | 981 | entries++; |
Li Zefan | db804f2 | 2012-01-10 16:41:01 +0800 | [diff] [blame] | 982 | ret = io_ctl_add_entry(&io_ctl, extent_start, len, NULL); |
Josef Bacik | a67509c | 2011-10-05 15:18:58 -0400 | [diff] [blame] | 983 | if (ret) |
| 984 | goto out_nospc; |
Josef Bacik | 2f35612 | 2011-06-10 15:31:13 -0400 | [diff] [blame] | 985 | |
Li Zefan | db804f2 | 2012-01-10 16:41:01 +0800 | [diff] [blame] | 986 | start = extent_end; |
Josef Bacik | a67509c | 2011-10-05 15:18:58 -0400 | [diff] [blame] | 987 | } |
Josef Bacik | 0cb59c9 | 2010-07-02 12:14:14 -0400 | [diff] [blame] | 988 | |
| 989 | /* Write out the bitmaps */ |
| 990 | list_for_each_safe(pos, n, &bitmap_list) { |
Josef Bacik | 0cb59c9 | 2010-07-02 12:14:14 -0400 | [diff] [blame] | 991 | struct btrfs_free_space *entry = |
| 992 | list_entry(pos, struct btrfs_free_space, list); |
| 993 | |
Josef Bacik | a67509c | 2011-10-05 15:18:58 -0400 | [diff] [blame] | 994 | ret = io_ctl_add_bitmap(&io_ctl, entry->bitmap); |
| 995 | if (ret) |
| 996 | goto out_nospc; |
Josef Bacik | 0cb59c9 | 2010-07-02 12:14:14 -0400 | [diff] [blame] | 997 | list_del_init(&entry->list); |
Josef Bacik | be1a12a | 2011-04-06 13:05:22 -0400 | [diff] [blame] | 998 | } |
| 999 | |
Josef Bacik | 0cb59c9 | 2010-07-02 12:14:14 -0400 | [diff] [blame] | 1000 | /* Zero out the rest of the pages just to make sure */ |
Josef Bacik | a67509c | 2011-10-05 15:18:58 -0400 | [diff] [blame] | 1001 | io_ctl_zero_remaining_pages(&io_ctl); |
Josef Bacik | 0cb59c9 | 2010-07-02 12:14:14 -0400 | [diff] [blame] | 1002 | |
Josef Bacik | a67509c | 2011-10-05 15:18:58 -0400 | [diff] [blame] | 1003 | ret = btrfs_dirty_pages(root, inode, io_ctl.pages, io_ctl.num_pages, |
| 1004 | 0, i_size_read(inode), &cached_state); |
| 1005 | io_ctl_drop_pages(&io_ctl); |
Josef Bacik | 0cb59c9 | 2010-07-02 12:14:14 -0400 | [diff] [blame] | 1006 | unlock_extent_cached(&BTRFS_I(inode)->io_tree, 0, |
| 1007 | i_size_read(inode) - 1, &cached_state, GFP_NOFS); |
| 1008 | |
Josef Bacik | c09544e | 2011-08-30 10:19:10 -0400 | [diff] [blame] | 1009 | if (ret) |
Josef Bacik | 2f35612 | 2011-06-10 15:31:13 -0400 | [diff] [blame] | 1010 | goto out; |
Josef Bacik | be1a12a | 2011-04-06 13:05:22 -0400 | [diff] [blame] | 1011 | |
Josef Bacik | be1a12a | 2011-04-06 13:05:22 -0400 | [diff] [blame] | 1012 | |
Josef Bacik | 5fd0204 | 2012-05-02 14:00:54 -0400 | [diff] [blame] | 1013 | btrfs_wait_ordered_range(inode, 0, (u64)-1); |
Josef Bacik | 0cb59c9 | 2010-07-02 12:14:14 -0400 | [diff] [blame] | 1014 | |
| 1015 | key.objectid = BTRFS_FREE_SPACE_OBJECTID; |
Li Zefan | 0414efa | 2011-04-20 10:20:14 +0800 | [diff] [blame] | 1016 | key.offset = offset; |
Josef Bacik | 0cb59c9 | 2010-07-02 12:14:14 -0400 | [diff] [blame] | 1017 | key.type = 0; |
| 1018 | |
Josef Bacik | a9b5fcd | 2011-08-19 12:06:12 -0400 | [diff] [blame] | 1019 | ret = btrfs_search_slot(trans, root, &key, path, 0, 1); |
Josef Bacik | 0cb59c9 | 2010-07-02 12:14:14 -0400 | [diff] [blame] | 1020 | if (ret < 0) { |
Josef Bacik | a67509c | 2011-10-05 15:18:58 -0400 | [diff] [blame] | 1021 | clear_extent_bit(&BTRFS_I(inode)->io_tree, 0, inode->i_size - 1, |
Josef Bacik | 5b0e95b | 2011-10-06 08:58:24 -0400 | [diff] [blame] | 1022 | EXTENT_DIRTY | EXTENT_DELALLOC, 0, 0, NULL, |
| 1023 | GFP_NOFS); |
Josef Bacik | 2f35612 | 2011-06-10 15:31:13 -0400 | [diff] [blame] | 1024 | goto out; |
Josef Bacik | 0cb59c9 | 2010-07-02 12:14:14 -0400 | [diff] [blame] | 1025 | } |
| 1026 | leaf = path->nodes[0]; |
| 1027 | if (ret > 0) { |
| 1028 | struct btrfs_key found_key; |
Josef Bacik | b12d686 | 2013-08-26 17:14:08 -0400 | [diff] [blame] | 1029 | ASSERT(path->slots[0]); |
Josef Bacik | 0cb59c9 | 2010-07-02 12:14:14 -0400 | [diff] [blame] | 1030 | path->slots[0]--; |
| 1031 | btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]); |
| 1032 | if (found_key.objectid != BTRFS_FREE_SPACE_OBJECTID || |
Li Zefan | 0414efa | 2011-04-20 10:20:14 +0800 | [diff] [blame] | 1033 | found_key.offset != offset) { |
Josef Bacik | a67509c | 2011-10-05 15:18:58 -0400 | [diff] [blame] | 1034 | clear_extent_bit(&BTRFS_I(inode)->io_tree, 0, |
| 1035 | inode->i_size - 1, |
Josef Bacik | 5b0e95b | 2011-10-06 08:58:24 -0400 | [diff] [blame] | 1036 | EXTENT_DIRTY | EXTENT_DELALLOC, 0, 0, |
| 1037 | NULL, GFP_NOFS); |
David Sterba | b3b4aa7 | 2011-04-21 01:20:15 +0200 | [diff] [blame] | 1038 | btrfs_release_path(path); |
Josef Bacik | 2f35612 | 2011-06-10 15:31:13 -0400 | [diff] [blame] | 1039 | goto out; |
Josef Bacik | 0cb59c9 | 2010-07-02 12:14:14 -0400 | [diff] [blame] | 1040 | } |
| 1041 | } |
Josef Bacik | 549b4fd | 2011-10-05 16:33:53 -0400 | [diff] [blame] | 1042 | |
| 1043 | BTRFS_I(inode)->generation = trans->transid; |
Josef Bacik | 0cb59c9 | 2010-07-02 12:14:14 -0400 | [diff] [blame] | 1044 | header = btrfs_item_ptr(leaf, path->slots[0], |
| 1045 | struct btrfs_free_space_header); |
| 1046 | btrfs_set_free_space_entries(leaf, header, entries); |
| 1047 | btrfs_set_free_space_bitmaps(leaf, header, bitmaps); |
| 1048 | btrfs_set_free_space_generation(leaf, header, trans->transid); |
| 1049 | btrfs_mark_buffer_dirty(leaf); |
David Sterba | b3b4aa7 | 2011-04-21 01:20:15 +0200 | [diff] [blame] | 1050 | btrfs_release_path(path); |
Josef Bacik | 0cb59c9 | 2010-07-02 12:14:14 -0400 | [diff] [blame] | 1051 | |
Josef Bacik | c09544e | 2011-08-30 10:19:10 -0400 | [diff] [blame] | 1052 | err = 0; |
Josef Bacik | 2f35612 | 2011-06-10 15:31:13 -0400 | [diff] [blame] | 1053 | out: |
Josef Bacik | a67509c | 2011-10-05 15:18:58 -0400 | [diff] [blame] | 1054 | io_ctl_free(&io_ctl); |
Josef Bacik | c09544e | 2011-08-30 10:19:10 -0400 | [diff] [blame] | 1055 | if (err) { |
Josef Bacik | a67509c | 2011-10-05 15:18:58 -0400 | [diff] [blame] | 1056 | invalidate_inode_pages2(inode->i_mapping); |
Josef Bacik | 0cb59c9 | 2010-07-02 12:14:14 -0400 | [diff] [blame] | 1057 | BTRFS_I(inode)->generation = 0; |
| 1058 | } |
Josef Bacik | 0cb59c9 | 2010-07-02 12:14:14 -0400 | [diff] [blame] | 1059 | btrfs_update_inode(trans, root, inode); |
Josef Bacik | c09544e | 2011-08-30 10:19:10 -0400 | [diff] [blame] | 1060 | return err; |
Josef Bacik | a67509c | 2011-10-05 15:18:58 -0400 | [diff] [blame] | 1061 | |
| 1062 | out_nospc: |
| 1063 | list_for_each_safe(pos, n, &bitmap_list) { |
| 1064 | struct btrfs_free_space *entry = |
| 1065 | list_entry(pos, struct btrfs_free_space, list); |
| 1066 | list_del_init(&entry->list); |
| 1067 | } |
| 1068 | io_ctl_drop_pages(&io_ctl); |
| 1069 | unlock_extent_cached(&BTRFS_I(inode)->io_tree, 0, |
| 1070 | i_size_read(inode) - 1, &cached_state, GFP_NOFS); |
| 1071 | goto out; |
Li Zefan | 0414efa | 2011-04-20 10:20:14 +0800 | [diff] [blame] | 1072 | } |
| 1073 | |
| 1074 | int btrfs_write_out_cache(struct btrfs_root *root, |
| 1075 | struct btrfs_trans_handle *trans, |
| 1076 | struct btrfs_block_group_cache *block_group, |
| 1077 | struct btrfs_path *path) |
| 1078 | { |
| 1079 | struct btrfs_free_space_ctl *ctl = block_group->free_space_ctl; |
| 1080 | struct inode *inode; |
| 1081 | int ret = 0; |
| 1082 | |
| 1083 | root = root->fs_info->tree_root; |
| 1084 | |
| 1085 | spin_lock(&block_group->lock); |
| 1086 | if (block_group->disk_cache_state < BTRFS_DC_SETUP) { |
| 1087 | spin_unlock(&block_group->lock); |
| 1088 | return 0; |
| 1089 | } |
| 1090 | spin_unlock(&block_group->lock); |
| 1091 | |
| 1092 | inode = lookup_free_space_inode(root, block_group, path); |
| 1093 | if (IS_ERR(inode)) |
| 1094 | return 0; |
| 1095 | |
| 1096 | ret = __btrfs_write_out_cache(root, inode, ctl, block_group, trans, |
| 1097 | path, block_group->key.objectid); |
Josef Bacik | c09544e | 2011-08-30 10:19:10 -0400 | [diff] [blame] | 1098 | if (ret) { |
Li Zefan | 0414efa | 2011-04-20 10:20:14 +0800 | [diff] [blame] | 1099 | spin_lock(&block_group->lock); |
| 1100 | block_group->disk_cache_state = BTRFS_DC_ERROR; |
| 1101 | spin_unlock(&block_group->lock); |
Li Zefan | 82d5902 | 2011-04-20 10:33:24 +0800 | [diff] [blame] | 1102 | ret = 0; |
Josef Bacik | c09544e | 2011-08-30 10:19:10 -0400 | [diff] [blame] | 1103 | #ifdef DEBUG |
Simon Kirby | c2cf52e | 2013-03-19 22:41:23 +0000 | [diff] [blame] | 1104 | btrfs_err(root->fs_info, |
| 1105 | "failed to write free space cache for block group %llu", |
| 1106 | block_group->key.objectid); |
Josef Bacik | c09544e | 2011-08-30 10:19:10 -0400 | [diff] [blame] | 1107 | #endif |
Li Zefan | 0414efa | 2011-04-20 10:20:14 +0800 | [diff] [blame] | 1108 | } |
| 1109 | |
Josef Bacik | 0cb59c9 | 2010-07-02 12:14:14 -0400 | [diff] [blame] | 1110 | iput(inode); |
| 1111 | return ret; |
| 1112 | } |
| 1113 | |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 1114 | static inline unsigned long offset_to_bit(u64 bitmap_start, u32 unit, |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1115 | u64 offset) |
| 1116 | { |
Josef Bacik | b12d686 | 2013-08-26 17:14:08 -0400 | [diff] [blame] | 1117 | ASSERT(offset >= bitmap_start); |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1118 | offset -= bitmap_start; |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 1119 | return (unsigned long)(div_u64(offset, unit)); |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1120 | } |
| 1121 | |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 1122 | static inline unsigned long bytes_to_bits(u64 bytes, u32 unit) |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1123 | { |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 1124 | return (unsigned long)(div_u64(bytes, unit)); |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1125 | } |
| 1126 | |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 1127 | static inline u64 offset_to_bitmap(struct btrfs_free_space_ctl *ctl, |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1128 | u64 offset) |
| 1129 | { |
| 1130 | u64 bitmap_start; |
| 1131 | u64 bytes_per_bitmap; |
| 1132 | |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 1133 | bytes_per_bitmap = BITS_PER_BITMAP * ctl->unit; |
| 1134 | bitmap_start = offset - ctl->start; |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1135 | bitmap_start = div64_u64(bitmap_start, bytes_per_bitmap); |
| 1136 | bitmap_start *= bytes_per_bitmap; |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 1137 | bitmap_start += ctl->start; |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1138 | |
| 1139 | return bitmap_start; |
| 1140 | } |
Josef Bacik | 0f9dd46 | 2008-09-23 13:14:11 -0400 | [diff] [blame] | 1141 | |
| 1142 | static int tree_insert_offset(struct rb_root *root, u64 offset, |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1143 | struct rb_node *node, int bitmap) |
Josef Bacik | 0f9dd46 | 2008-09-23 13:14:11 -0400 | [diff] [blame] | 1144 | { |
| 1145 | struct rb_node **p = &root->rb_node; |
| 1146 | struct rb_node *parent = NULL; |
| 1147 | struct btrfs_free_space *info; |
| 1148 | |
| 1149 | while (*p) { |
| 1150 | parent = *p; |
| 1151 | info = rb_entry(parent, struct btrfs_free_space, offset_index); |
| 1152 | |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1153 | if (offset < info->offset) { |
Josef Bacik | 0f9dd46 | 2008-09-23 13:14:11 -0400 | [diff] [blame] | 1154 | p = &(*p)->rb_left; |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1155 | } else if (offset > info->offset) { |
Josef Bacik | 0f9dd46 | 2008-09-23 13:14:11 -0400 | [diff] [blame] | 1156 | p = &(*p)->rb_right; |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1157 | } else { |
| 1158 | /* |
| 1159 | * we could have a bitmap entry and an extent entry |
| 1160 | * share the same offset. If this is the case, we want |
| 1161 | * the extent entry to always be found first if we do a |
| 1162 | * linear search through the tree, since we want to have |
| 1163 | * the quickest allocation time, and allocating from an |
| 1164 | * extent is faster than allocating from a bitmap. So |
| 1165 | * if we're inserting a bitmap and we find an entry at |
| 1166 | * this offset, we want to go right, or after this entry |
| 1167 | * logically. If we are inserting an extent and we've |
| 1168 | * found a bitmap, we want to go left, or before |
| 1169 | * logically. |
| 1170 | */ |
| 1171 | if (bitmap) { |
Josef Bacik | 207dde8 | 2011-05-13 14:49:23 -0400 | [diff] [blame] | 1172 | if (info->bitmap) { |
| 1173 | WARN_ON_ONCE(1); |
| 1174 | return -EEXIST; |
| 1175 | } |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1176 | p = &(*p)->rb_right; |
| 1177 | } else { |
Josef Bacik | 207dde8 | 2011-05-13 14:49:23 -0400 | [diff] [blame] | 1178 | if (!info->bitmap) { |
| 1179 | WARN_ON_ONCE(1); |
| 1180 | return -EEXIST; |
| 1181 | } |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1182 | p = &(*p)->rb_left; |
| 1183 | } |
| 1184 | } |
Josef Bacik | 0f9dd46 | 2008-09-23 13:14:11 -0400 | [diff] [blame] | 1185 | } |
| 1186 | |
| 1187 | rb_link_node(node, parent, p); |
| 1188 | rb_insert_color(node, root); |
| 1189 | |
| 1190 | return 0; |
| 1191 | } |
| 1192 | |
| 1193 | /* |
Josef Bacik | 70cb074 | 2009-04-03 10:14:19 -0400 | [diff] [blame] | 1194 | * searches the tree for the given offset. |
| 1195 | * |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1196 | * fuzzy - If this is set, then we are trying to make an allocation, and we just |
| 1197 | * want a section that has at least bytes size and comes at or after the given |
| 1198 | * offset. |
Josef Bacik | 0f9dd46 | 2008-09-23 13:14:11 -0400 | [diff] [blame] | 1199 | */ |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1200 | static struct btrfs_free_space * |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 1201 | tree_search_offset(struct btrfs_free_space_ctl *ctl, |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1202 | u64 offset, int bitmap_only, int fuzzy) |
Josef Bacik | 0f9dd46 | 2008-09-23 13:14:11 -0400 | [diff] [blame] | 1203 | { |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 1204 | struct rb_node *n = ctl->free_space_offset.rb_node; |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1205 | struct btrfs_free_space *entry, *prev = NULL; |
Josef Bacik | 0f9dd46 | 2008-09-23 13:14:11 -0400 | [diff] [blame] | 1206 | |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1207 | /* find entry that is closest to the 'offset' */ |
| 1208 | while (1) { |
| 1209 | if (!n) { |
| 1210 | entry = NULL; |
Josef Bacik | 0f9dd46 | 2008-09-23 13:14:11 -0400 | [diff] [blame] | 1211 | break; |
| 1212 | } |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1213 | |
| 1214 | entry = rb_entry(n, struct btrfs_free_space, offset_index); |
| 1215 | prev = entry; |
| 1216 | |
| 1217 | if (offset < entry->offset) |
| 1218 | n = n->rb_left; |
| 1219 | else if (offset > entry->offset) |
| 1220 | n = n->rb_right; |
| 1221 | else |
| 1222 | break; |
Josef Bacik | 0f9dd46 | 2008-09-23 13:14:11 -0400 | [diff] [blame] | 1223 | } |
| 1224 | |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1225 | if (bitmap_only) { |
| 1226 | if (!entry) |
| 1227 | return NULL; |
| 1228 | if (entry->bitmap) |
| 1229 | return entry; |
Josef Bacik | 0f9dd46 | 2008-09-23 13:14:11 -0400 | [diff] [blame] | 1230 | |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1231 | /* |
| 1232 | * bitmap entry and extent entry may share same offset, |
| 1233 | * in that case, bitmap entry comes after extent entry. |
| 1234 | */ |
| 1235 | n = rb_next(n); |
| 1236 | if (!n) |
| 1237 | return NULL; |
| 1238 | entry = rb_entry(n, struct btrfs_free_space, offset_index); |
| 1239 | if (entry->offset != offset) |
| 1240 | return NULL; |
Josef Bacik | 0f9dd46 | 2008-09-23 13:14:11 -0400 | [diff] [blame] | 1241 | |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1242 | WARN_ON(!entry->bitmap); |
| 1243 | return entry; |
| 1244 | } else if (entry) { |
| 1245 | if (entry->bitmap) { |
Josef Bacik | 0f9dd46 | 2008-09-23 13:14:11 -0400 | [diff] [blame] | 1246 | /* |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1247 | * if previous extent entry covers the offset, |
| 1248 | * we should return it instead of the bitmap entry |
Josef Bacik | 0f9dd46 | 2008-09-23 13:14:11 -0400 | [diff] [blame] | 1249 | */ |
Miao Xie | de6c411 | 2012-10-18 08:18:01 +0000 | [diff] [blame] | 1250 | n = rb_prev(&entry->offset_index); |
| 1251 | if (n) { |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1252 | prev = rb_entry(n, struct btrfs_free_space, |
| 1253 | offset_index); |
Miao Xie | de6c411 | 2012-10-18 08:18:01 +0000 | [diff] [blame] | 1254 | if (!prev->bitmap && |
| 1255 | prev->offset + prev->bytes > offset) |
| 1256 | entry = prev; |
Josef Bacik | 0f9dd46 | 2008-09-23 13:14:11 -0400 | [diff] [blame] | 1257 | } |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1258 | } |
| 1259 | return entry; |
| 1260 | } |
| 1261 | |
| 1262 | if (!prev) |
| 1263 | return NULL; |
| 1264 | |
| 1265 | /* find last entry before the 'offset' */ |
| 1266 | entry = prev; |
| 1267 | if (entry->offset > offset) { |
| 1268 | n = rb_prev(&entry->offset_index); |
| 1269 | if (n) { |
| 1270 | entry = rb_entry(n, struct btrfs_free_space, |
| 1271 | offset_index); |
Josef Bacik | b12d686 | 2013-08-26 17:14:08 -0400 | [diff] [blame] | 1272 | ASSERT(entry->offset <= offset); |
Josef Bacik | 0f9dd46 | 2008-09-23 13:14:11 -0400 | [diff] [blame] | 1273 | } else { |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1274 | if (fuzzy) |
| 1275 | return entry; |
| 1276 | else |
| 1277 | return NULL; |
Josef Bacik | 0f9dd46 | 2008-09-23 13:14:11 -0400 | [diff] [blame] | 1278 | } |
| 1279 | } |
| 1280 | |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1281 | if (entry->bitmap) { |
Miao Xie | de6c411 | 2012-10-18 08:18:01 +0000 | [diff] [blame] | 1282 | n = rb_prev(&entry->offset_index); |
| 1283 | if (n) { |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1284 | prev = rb_entry(n, struct btrfs_free_space, |
| 1285 | offset_index); |
Miao Xie | de6c411 | 2012-10-18 08:18:01 +0000 | [diff] [blame] | 1286 | if (!prev->bitmap && |
| 1287 | prev->offset + prev->bytes > offset) |
| 1288 | return prev; |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1289 | } |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 1290 | if (entry->offset + BITS_PER_BITMAP * ctl->unit > offset) |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1291 | return entry; |
| 1292 | } else if (entry->offset + entry->bytes > offset) |
| 1293 | return entry; |
| 1294 | |
| 1295 | if (!fuzzy) |
| 1296 | return NULL; |
| 1297 | |
| 1298 | while (1) { |
| 1299 | if (entry->bitmap) { |
| 1300 | if (entry->offset + BITS_PER_BITMAP * |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 1301 | ctl->unit > offset) |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1302 | break; |
| 1303 | } else { |
| 1304 | if (entry->offset + entry->bytes > offset) |
| 1305 | break; |
| 1306 | } |
| 1307 | |
| 1308 | n = rb_next(&entry->offset_index); |
| 1309 | if (!n) |
| 1310 | return NULL; |
| 1311 | entry = rb_entry(n, struct btrfs_free_space, offset_index); |
| 1312 | } |
| 1313 | return entry; |
Josef Bacik | 0f9dd46 | 2008-09-23 13:14:11 -0400 | [diff] [blame] | 1314 | } |
| 1315 | |
Li Zefan | f333adb | 2010-11-09 14:57:39 +0800 | [diff] [blame] | 1316 | static inline void |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 1317 | __unlink_free_space(struct btrfs_free_space_ctl *ctl, |
Li Zefan | f333adb | 2010-11-09 14:57:39 +0800 | [diff] [blame] | 1318 | struct btrfs_free_space *info) |
Josef Bacik | 0f9dd46 | 2008-09-23 13:14:11 -0400 | [diff] [blame] | 1319 | { |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 1320 | rb_erase(&info->offset_index, &ctl->free_space_offset); |
| 1321 | ctl->free_extents--; |
Li Zefan | f333adb | 2010-11-09 14:57:39 +0800 | [diff] [blame] | 1322 | } |
| 1323 | |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 1324 | static void unlink_free_space(struct btrfs_free_space_ctl *ctl, |
Li Zefan | f333adb | 2010-11-09 14:57:39 +0800 | [diff] [blame] | 1325 | struct btrfs_free_space *info) |
| 1326 | { |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 1327 | __unlink_free_space(ctl, info); |
| 1328 | ctl->free_space -= info->bytes; |
Josef Bacik | 0f9dd46 | 2008-09-23 13:14:11 -0400 | [diff] [blame] | 1329 | } |
| 1330 | |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 1331 | static int link_free_space(struct btrfs_free_space_ctl *ctl, |
Josef Bacik | 0f9dd46 | 2008-09-23 13:14:11 -0400 | [diff] [blame] | 1332 | struct btrfs_free_space *info) |
| 1333 | { |
| 1334 | int ret = 0; |
| 1335 | |
Josef Bacik | b12d686 | 2013-08-26 17:14:08 -0400 | [diff] [blame] | 1336 | ASSERT(info->bytes || info->bitmap); |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 1337 | ret = tree_insert_offset(&ctl->free_space_offset, info->offset, |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1338 | &info->offset_index, (info->bitmap != NULL)); |
Josef Bacik | 0f9dd46 | 2008-09-23 13:14:11 -0400 | [diff] [blame] | 1339 | if (ret) |
| 1340 | return ret; |
| 1341 | |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 1342 | ctl->free_space += info->bytes; |
| 1343 | ctl->free_extents++; |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1344 | return ret; |
| 1345 | } |
| 1346 | |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 1347 | static void recalculate_thresholds(struct btrfs_free_space_ctl *ctl) |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1348 | { |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 1349 | struct btrfs_block_group_cache *block_group = ctl->private; |
Josef Bacik | 25891f7 | 2009-09-11 16:11:20 -0400 | [diff] [blame] | 1350 | u64 max_bytes; |
| 1351 | u64 bitmap_bytes; |
| 1352 | u64 extent_bytes; |
Li Zefan | 8eb2d82 | 2010-11-09 14:48:01 +0800 | [diff] [blame] | 1353 | u64 size = block_group->key.offset; |
Wang Sheng-Hui | 9600976 | 2012-11-30 06:30:14 +0000 | [diff] [blame] | 1354 | u64 bytes_per_bg = BITS_PER_BITMAP * ctl->unit; |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 1355 | int max_bitmaps = div64_u64(size + bytes_per_bg - 1, bytes_per_bg); |
| 1356 | |
Josef Bacik | dde5740 | 2013-02-12 14:07:51 -0500 | [diff] [blame] | 1357 | max_bitmaps = max(max_bitmaps, 1); |
| 1358 | |
Josef Bacik | b12d686 | 2013-08-26 17:14:08 -0400 | [diff] [blame] | 1359 | ASSERT(ctl->total_bitmaps <= max_bitmaps); |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1360 | |
| 1361 | /* |
| 1362 | * The goal is to keep the total amount of memory used per 1gb of space |
| 1363 | * at or below 32k, so we need to adjust how much memory we allow to be |
| 1364 | * used by extent based free space tracking |
| 1365 | */ |
Li Zefan | 8eb2d82 | 2010-11-09 14:48:01 +0800 | [diff] [blame] | 1366 | if (size < 1024 * 1024 * 1024) |
| 1367 | max_bytes = MAX_CACHE_BYTES_PER_GIG; |
| 1368 | else |
| 1369 | max_bytes = MAX_CACHE_BYTES_PER_GIG * |
| 1370 | div64_u64(size, 1024 * 1024 * 1024); |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1371 | |
Josef Bacik | 25891f7 | 2009-09-11 16:11:20 -0400 | [diff] [blame] | 1372 | /* |
| 1373 | * we want to account for 1 more bitmap than what we have so we can make |
| 1374 | * sure we don't go over our overall goal of MAX_CACHE_BYTES_PER_GIG as |
| 1375 | * we add more bitmaps. |
| 1376 | */ |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 1377 | bitmap_bytes = (ctl->total_bitmaps + 1) * PAGE_CACHE_SIZE; |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1378 | |
Josef Bacik | 25891f7 | 2009-09-11 16:11:20 -0400 | [diff] [blame] | 1379 | if (bitmap_bytes >= max_bytes) { |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 1380 | ctl->extents_thresh = 0; |
Josef Bacik | 25891f7 | 2009-09-11 16:11:20 -0400 | [diff] [blame] | 1381 | return; |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1382 | } |
Josef Bacik | 25891f7 | 2009-09-11 16:11:20 -0400 | [diff] [blame] | 1383 | |
| 1384 | /* |
| 1385 | * we want the extent entry threshold to always be at most 1/2 the maxw |
| 1386 | * bytes we can have, or whatever is less than that. |
| 1387 | */ |
| 1388 | extent_bytes = max_bytes - bitmap_bytes; |
| 1389 | extent_bytes = min_t(u64, extent_bytes, div64_u64(max_bytes, 2)); |
| 1390 | |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 1391 | ctl->extents_thresh = |
Josef Bacik | 25891f7 | 2009-09-11 16:11:20 -0400 | [diff] [blame] | 1392 | div64_u64(extent_bytes, (sizeof(struct btrfs_free_space))); |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1393 | } |
| 1394 | |
Miao Xie | bb3ac5a | 2011-08-05 09:32:35 +0000 | [diff] [blame] | 1395 | static inline void __bitmap_clear_bits(struct btrfs_free_space_ctl *ctl, |
| 1396 | struct btrfs_free_space *info, |
| 1397 | u64 offset, u64 bytes) |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1398 | { |
Li Zefan | f38b6e7 | 2011-03-14 13:40:51 +0800 | [diff] [blame] | 1399 | unsigned long start, count; |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1400 | |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 1401 | start = offset_to_bit(info->offset, ctl->unit, offset); |
| 1402 | count = bytes_to_bits(bytes, ctl->unit); |
Josef Bacik | b12d686 | 2013-08-26 17:14:08 -0400 | [diff] [blame] | 1403 | ASSERT(start + count <= BITS_PER_BITMAP); |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1404 | |
Li Zefan | f38b6e7 | 2011-03-14 13:40:51 +0800 | [diff] [blame] | 1405 | bitmap_clear(info->bitmap, start, count); |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1406 | |
| 1407 | info->bytes -= bytes; |
Miao Xie | bb3ac5a | 2011-08-05 09:32:35 +0000 | [diff] [blame] | 1408 | } |
| 1409 | |
| 1410 | static void bitmap_clear_bits(struct btrfs_free_space_ctl *ctl, |
| 1411 | struct btrfs_free_space *info, u64 offset, |
| 1412 | u64 bytes) |
| 1413 | { |
| 1414 | __bitmap_clear_bits(ctl, info, offset, bytes); |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 1415 | ctl->free_space -= bytes; |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1416 | } |
| 1417 | |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 1418 | static void bitmap_set_bits(struct btrfs_free_space_ctl *ctl, |
Josef Bacik | 817d52f | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1419 | struct btrfs_free_space *info, u64 offset, |
| 1420 | u64 bytes) |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1421 | { |
Li Zefan | f38b6e7 | 2011-03-14 13:40:51 +0800 | [diff] [blame] | 1422 | unsigned long start, count; |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1423 | |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 1424 | start = offset_to_bit(info->offset, ctl->unit, offset); |
| 1425 | count = bytes_to_bits(bytes, ctl->unit); |
Josef Bacik | b12d686 | 2013-08-26 17:14:08 -0400 | [diff] [blame] | 1426 | ASSERT(start + count <= BITS_PER_BITMAP); |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1427 | |
Li Zefan | f38b6e7 | 2011-03-14 13:40:51 +0800 | [diff] [blame] | 1428 | bitmap_set(info->bitmap, start, count); |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1429 | |
| 1430 | info->bytes += bytes; |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 1431 | ctl->free_space += bytes; |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1432 | } |
| 1433 | |
Miao Xie | a482039 | 2013-09-09 13:19:42 +0800 | [diff] [blame] | 1434 | /* |
| 1435 | * If we can not find suitable extent, we will use bytes to record |
| 1436 | * the size of the max extent. |
| 1437 | */ |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 1438 | static int search_bitmap(struct btrfs_free_space_ctl *ctl, |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1439 | struct btrfs_free_space *bitmap_info, u64 *offset, |
| 1440 | u64 *bytes) |
| 1441 | { |
| 1442 | unsigned long found_bits = 0; |
Miao Xie | a482039 | 2013-09-09 13:19:42 +0800 | [diff] [blame] | 1443 | unsigned long max_bits = 0; |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1444 | unsigned long bits, i; |
| 1445 | unsigned long next_zero; |
Miao Xie | a482039 | 2013-09-09 13:19:42 +0800 | [diff] [blame] | 1446 | unsigned long extent_bits; |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1447 | |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 1448 | i = offset_to_bit(bitmap_info->offset, ctl->unit, |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1449 | max_t(u64, *offset, bitmap_info->offset)); |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 1450 | bits = bytes_to_bits(*bytes, ctl->unit); |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1451 | |
Wei Yongjun | ebb3dad | 2012-09-13 20:29:02 -0600 | [diff] [blame] | 1452 | for_each_set_bit_from(i, bitmap_info->bitmap, BITS_PER_BITMAP) { |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1453 | next_zero = find_next_zero_bit(bitmap_info->bitmap, |
| 1454 | BITS_PER_BITMAP, i); |
Miao Xie | a482039 | 2013-09-09 13:19:42 +0800 | [diff] [blame] | 1455 | extent_bits = next_zero - i; |
| 1456 | if (extent_bits >= bits) { |
| 1457 | found_bits = extent_bits; |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1458 | break; |
Miao Xie | a482039 | 2013-09-09 13:19:42 +0800 | [diff] [blame] | 1459 | } else if (extent_bits > max_bits) { |
| 1460 | max_bits = extent_bits; |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1461 | } |
| 1462 | i = next_zero; |
| 1463 | } |
| 1464 | |
| 1465 | if (found_bits) { |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 1466 | *offset = (u64)(i * ctl->unit) + bitmap_info->offset; |
| 1467 | *bytes = (u64)(found_bits) * ctl->unit; |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1468 | return 0; |
| 1469 | } |
| 1470 | |
Miao Xie | a482039 | 2013-09-09 13:19:42 +0800 | [diff] [blame] | 1471 | *bytes = (u64)(max_bits) * ctl->unit; |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1472 | return -1; |
| 1473 | } |
| 1474 | |
Miao Xie | a482039 | 2013-09-09 13:19:42 +0800 | [diff] [blame] | 1475 | /* Cache the size of the max extent in bytes */ |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 1476 | static struct btrfs_free_space * |
David Woodhouse | 53b381b | 2013-01-29 18:40:14 -0500 | [diff] [blame] | 1477 | find_free_space(struct btrfs_free_space_ctl *ctl, u64 *offset, u64 *bytes, |
Miao Xie | a482039 | 2013-09-09 13:19:42 +0800 | [diff] [blame] | 1478 | unsigned long align, u64 *max_extent_size) |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1479 | { |
| 1480 | struct btrfs_free_space *entry; |
| 1481 | struct rb_node *node; |
David Woodhouse | 53b381b | 2013-01-29 18:40:14 -0500 | [diff] [blame] | 1482 | u64 tmp; |
| 1483 | u64 align_off; |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1484 | int ret; |
| 1485 | |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 1486 | if (!ctl->free_space_offset.rb_node) |
Miao Xie | a482039 | 2013-09-09 13:19:42 +0800 | [diff] [blame] | 1487 | goto out; |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1488 | |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 1489 | entry = tree_search_offset(ctl, offset_to_bitmap(ctl, *offset), 0, 1); |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1490 | if (!entry) |
Miao Xie | a482039 | 2013-09-09 13:19:42 +0800 | [diff] [blame] | 1491 | goto out; |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1492 | |
| 1493 | for (node = &entry->offset_index; node; node = rb_next(node)) { |
| 1494 | entry = rb_entry(node, struct btrfs_free_space, offset_index); |
Miao Xie | a482039 | 2013-09-09 13:19:42 +0800 | [diff] [blame] | 1495 | if (entry->bytes < *bytes) { |
| 1496 | if (entry->bytes > *max_extent_size) |
| 1497 | *max_extent_size = entry->bytes; |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1498 | continue; |
Miao Xie | a482039 | 2013-09-09 13:19:42 +0800 | [diff] [blame] | 1499 | } |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1500 | |
David Woodhouse | 53b381b | 2013-01-29 18:40:14 -0500 | [diff] [blame] | 1501 | /* make sure the space returned is big enough |
| 1502 | * to match our requested alignment |
| 1503 | */ |
| 1504 | if (*bytes >= align) { |
Miao Xie | a482039 | 2013-09-09 13:19:42 +0800 | [diff] [blame] | 1505 | tmp = entry->offset - ctl->start + align - 1; |
David Woodhouse | 53b381b | 2013-01-29 18:40:14 -0500 | [diff] [blame] | 1506 | do_div(tmp, align); |
| 1507 | tmp = tmp * align + ctl->start; |
| 1508 | align_off = tmp - entry->offset; |
| 1509 | } else { |
| 1510 | align_off = 0; |
| 1511 | tmp = entry->offset; |
| 1512 | } |
| 1513 | |
Miao Xie | a482039 | 2013-09-09 13:19:42 +0800 | [diff] [blame] | 1514 | if (entry->bytes < *bytes + align_off) { |
| 1515 | if (entry->bytes > *max_extent_size) |
| 1516 | *max_extent_size = entry->bytes; |
David Woodhouse | 53b381b | 2013-01-29 18:40:14 -0500 | [diff] [blame] | 1517 | continue; |
Miao Xie | a482039 | 2013-09-09 13:19:42 +0800 | [diff] [blame] | 1518 | } |
David Woodhouse | 53b381b | 2013-01-29 18:40:14 -0500 | [diff] [blame] | 1519 | |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1520 | if (entry->bitmap) { |
Miao Xie | a482039 | 2013-09-09 13:19:42 +0800 | [diff] [blame] | 1521 | u64 size = *bytes; |
| 1522 | |
| 1523 | ret = search_bitmap(ctl, entry, &tmp, &size); |
David Woodhouse | 53b381b | 2013-01-29 18:40:14 -0500 | [diff] [blame] | 1524 | if (!ret) { |
| 1525 | *offset = tmp; |
Miao Xie | a482039 | 2013-09-09 13:19:42 +0800 | [diff] [blame] | 1526 | *bytes = size; |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1527 | return entry; |
Miao Xie | a482039 | 2013-09-09 13:19:42 +0800 | [diff] [blame] | 1528 | } else if (size > *max_extent_size) { |
| 1529 | *max_extent_size = size; |
David Woodhouse | 53b381b | 2013-01-29 18:40:14 -0500 | [diff] [blame] | 1530 | } |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1531 | continue; |
| 1532 | } |
| 1533 | |
David Woodhouse | 53b381b | 2013-01-29 18:40:14 -0500 | [diff] [blame] | 1534 | *offset = tmp; |
| 1535 | *bytes = entry->bytes - align_off; |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1536 | return entry; |
| 1537 | } |
Miao Xie | a482039 | 2013-09-09 13:19:42 +0800 | [diff] [blame] | 1538 | out: |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1539 | return NULL; |
| 1540 | } |
| 1541 | |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 1542 | static void add_new_bitmap(struct btrfs_free_space_ctl *ctl, |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1543 | struct btrfs_free_space *info, u64 offset) |
| 1544 | { |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 1545 | info->offset = offset_to_bitmap(ctl, offset); |
Josef Bacik | f019f42 | 2009-09-11 16:11:20 -0400 | [diff] [blame] | 1546 | info->bytes = 0; |
Alexandre Oliva | f2d0f67 | 2011-11-28 12:04:43 -0200 | [diff] [blame] | 1547 | INIT_LIST_HEAD(&info->list); |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 1548 | link_free_space(ctl, info); |
| 1549 | ctl->total_bitmaps++; |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1550 | |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 1551 | ctl->op->recalc_thresholds(ctl); |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1552 | } |
| 1553 | |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 1554 | static void free_bitmap(struct btrfs_free_space_ctl *ctl, |
Li Zefan | edf6e2d | 2010-11-09 14:50:07 +0800 | [diff] [blame] | 1555 | struct btrfs_free_space *bitmap_info) |
| 1556 | { |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 1557 | unlink_free_space(ctl, bitmap_info); |
Li Zefan | edf6e2d | 2010-11-09 14:50:07 +0800 | [diff] [blame] | 1558 | kfree(bitmap_info->bitmap); |
Josef Bacik | dc89e98 | 2011-01-28 17:05:48 -0500 | [diff] [blame] | 1559 | kmem_cache_free(btrfs_free_space_cachep, bitmap_info); |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 1560 | ctl->total_bitmaps--; |
| 1561 | ctl->op->recalc_thresholds(ctl); |
Li Zefan | edf6e2d | 2010-11-09 14:50:07 +0800 | [diff] [blame] | 1562 | } |
| 1563 | |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 1564 | static noinline int remove_from_bitmap(struct btrfs_free_space_ctl *ctl, |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1565 | struct btrfs_free_space *bitmap_info, |
| 1566 | u64 *offset, u64 *bytes) |
| 1567 | { |
| 1568 | u64 end; |
Josef Bacik | 6606bb9 | 2009-07-31 11:03:58 -0400 | [diff] [blame] | 1569 | u64 search_start, search_bytes; |
| 1570 | int ret; |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1571 | |
| 1572 | again: |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 1573 | end = bitmap_info->offset + (u64)(BITS_PER_BITMAP * ctl->unit) - 1; |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1574 | |
Josef Bacik | 6606bb9 | 2009-07-31 11:03:58 -0400 | [diff] [blame] | 1575 | /* |
Josef Bacik | bdb7d30 | 2012-06-27 15:10:56 -0400 | [diff] [blame] | 1576 | * We need to search for bits in this bitmap. We could only cover some |
| 1577 | * of the extent in this bitmap thanks to how we add space, so we need |
| 1578 | * to search for as much as it as we can and clear that amount, and then |
| 1579 | * go searching for the next bit. |
Josef Bacik | 6606bb9 | 2009-07-31 11:03:58 -0400 | [diff] [blame] | 1580 | */ |
| 1581 | search_start = *offset; |
Josef Bacik | bdb7d30 | 2012-06-27 15:10:56 -0400 | [diff] [blame] | 1582 | search_bytes = ctl->unit; |
Josef Bacik | 13dbc08 | 2011-02-03 02:39:52 +0000 | [diff] [blame] | 1583 | search_bytes = min(search_bytes, end - search_start + 1); |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 1584 | ret = search_bitmap(ctl, bitmap_info, &search_start, &search_bytes); |
Josef Bacik | b50c6e2 | 2013-04-25 15:55:30 -0400 | [diff] [blame] | 1585 | if (ret < 0 || search_start != *offset) |
| 1586 | return -EINVAL; |
Josef Bacik | 6606bb9 | 2009-07-31 11:03:58 -0400 | [diff] [blame] | 1587 | |
Josef Bacik | bdb7d30 | 2012-06-27 15:10:56 -0400 | [diff] [blame] | 1588 | /* We may have found more bits than what we need */ |
| 1589 | search_bytes = min(search_bytes, *bytes); |
| 1590 | |
| 1591 | /* Cannot clear past the end of the bitmap */ |
| 1592 | search_bytes = min(search_bytes, end - search_start + 1); |
| 1593 | |
| 1594 | bitmap_clear_bits(ctl, bitmap_info, search_start, search_bytes); |
| 1595 | *offset += search_bytes; |
| 1596 | *bytes -= search_bytes; |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1597 | |
| 1598 | if (*bytes) { |
Josef Bacik | 6606bb9 | 2009-07-31 11:03:58 -0400 | [diff] [blame] | 1599 | struct rb_node *next = rb_next(&bitmap_info->offset_index); |
Li Zefan | edf6e2d | 2010-11-09 14:50:07 +0800 | [diff] [blame] | 1600 | if (!bitmap_info->bytes) |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 1601 | free_bitmap(ctl, bitmap_info); |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1602 | |
Josef Bacik | 6606bb9 | 2009-07-31 11:03:58 -0400 | [diff] [blame] | 1603 | /* |
| 1604 | * no entry after this bitmap, but we still have bytes to |
| 1605 | * remove, so something has gone wrong. |
| 1606 | */ |
| 1607 | if (!next) |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1608 | return -EINVAL; |
| 1609 | |
Josef Bacik | 6606bb9 | 2009-07-31 11:03:58 -0400 | [diff] [blame] | 1610 | bitmap_info = rb_entry(next, struct btrfs_free_space, |
| 1611 | offset_index); |
| 1612 | |
| 1613 | /* |
| 1614 | * if the next entry isn't a bitmap we need to return to let the |
| 1615 | * extent stuff do its work. |
| 1616 | */ |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1617 | if (!bitmap_info->bitmap) |
| 1618 | return -EAGAIN; |
| 1619 | |
Josef Bacik | 6606bb9 | 2009-07-31 11:03:58 -0400 | [diff] [blame] | 1620 | /* |
| 1621 | * Ok the next item is a bitmap, but it may not actually hold |
| 1622 | * the information for the rest of this free space stuff, so |
| 1623 | * look for it, and if we don't find it return so we can try |
| 1624 | * everything over again. |
| 1625 | */ |
| 1626 | search_start = *offset; |
Josef Bacik | bdb7d30 | 2012-06-27 15:10:56 -0400 | [diff] [blame] | 1627 | search_bytes = ctl->unit; |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 1628 | ret = search_bitmap(ctl, bitmap_info, &search_start, |
Josef Bacik | 6606bb9 | 2009-07-31 11:03:58 -0400 | [diff] [blame] | 1629 | &search_bytes); |
| 1630 | if (ret < 0 || search_start != *offset) |
| 1631 | return -EAGAIN; |
| 1632 | |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1633 | goto again; |
Li Zefan | edf6e2d | 2010-11-09 14:50:07 +0800 | [diff] [blame] | 1634 | } else if (!bitmap_info->bytes) |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 1635 | free_bitmap(ctl, bitmap_info); |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1636 | |
| 1637 | return 0; |
| 1638 | } |
| 1639 | |
Josef Bacik | 2cdc342 | 2011-05-27 14:07:49 -0400 | [diff] [blame] | 1640 | static u64 add_bytes_to_bitmap(struct btrfs_free_space_ctl *ctl, |
| 1641 | struct btrfs_free_space *info, u64 offset, |
| 1642 | u64 bytes) |
| 1643 | { |
| 1644 | u64 bytes_to_set = 0; |
| 1645 | u64 end; |
| 1646 | |
| 1647 | end = info->offset + (u64)(BITS_PER_BITMAP * ctl->unit); |
| 1648 | |
| 1649 | bytes_to_set = min(end - offset, bytes); |
| 1650 | |
| 1651 | bitmap_set_bits(ctl, info, offset, bytes_to_set); |
| 1652 | |
| 1653 | return bytes_to_set; |
| 1654 | |
| 1655 | } |
| 1656 | |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 1657 | static bool use_bitmap(struct btrfs_free_space_ctl *ctl, |
| 1658 | struct btrfs_free_space *info) |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1659 | { |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 1660 | struct btrfs_block_group_cache *block_group = ctl->private; |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1661 | |
| 1662 | /* |
| 1663 | * If we are below the extents threshold then we can add this as an |
| 1664 | * extent, and don't have to deal with the bitmap |
| 1665 | */ |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 1666 | if (ctl->free_extents < ctl->extents_thresh) { |
Josef Bacik | 32cb084 | 2011-03-18 16:16:21 -0400 | [diff] [blame] | 1667 | /* |
| 1668 | * If this block group has some small extents we don't want to |
| 1669 | * use up all of our free slots in the cache with them, we want |
| 1670 | * to reserve them to larger extents, however if we have plent |
| 1671 | * of cache left then go ahead an dadd them, no sense in adding |
| 1672 | * the overhead of a bitmap if we don't have to. |
| 1673 | */ |
| 1674 | if (info->bytes <= block_group->sectorsize * 4) { |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 1675 | if (ctl->free_extents * 2 <= ctl->extents_thresh) |
| 1676 | return false; |
Josef Bacik | 32cb084 | 2011-03-18 16:16:21 -0400 | [diff] [blame] | 1677 | } else { |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 1678 | return false; |
Josef Bacik | 32cb084 | 2011-03-18 16:16:21 -0400 | [diff] [blame] | 1679 | } |
| 1680 | } |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1681 | |
| 1682 | /* |
Josef Bacik | dde5740 | 2013-02-12 14:07:51 -0500 | [diff] [blame] | 1683 | * The original block groups from mkfs can be really small, like 8 |
| 1684 | * megabytes, so don't bother with a bitmap for those entries. However |
| 1685 | * some block groups can be smaller than what a bitmap would cover but |
| 1686 | * are still large enough that they could overflow the 32k memory limit, |
| 1687 | * so allow those block groups to still be allowed to have a bitmap |
| 1688 | * entry. |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1689 | */ |
Josef Bacik | dde5740 | 2013-02-12 14:07:51 -0500 | [diff] [blame] | 1690 | if (((BITS_PER_BITMAP * ctl->unit) >> 1) > block_group->key.offset) |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 1691 | return false; |
| 1692 | |
| 1693 | return true; |
| 1694 | } |
| 1695 | |
Josef Bacik | 2cdc342 | 2011-05-27 14:07:49 -0400 | [diff] [blame] | 1696 | static struct btrfs_free_space_op free_space_op = { |
| 1697 | .recalc_thresholds = recalculate_thresholds, |
| 1698 | .use_bitmap = use_bitmap, |
| 1699 | }; |
| 1700 | |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 1701 | static int insert_into_bitmap(struct btrfs_free_space_ctl *ctl, |
| 1702 | struct btrfs_free_space *info) |
| 1703 | { |
| 1704 | struct btrfs_free_space *bitmap_info; |
Josef Bacik | 2cdc342 | 2011-05-27 14:07:49 -0400 | [diff] [blame] | 1705 | struct btrfs_block_group_cache *block_group = NULL; |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 1706 | int added = 0; |
Josef Bacik | 2cdc342 | 2011-05-27 14:07:49 -0400 | [diff] [blame] | 1707 | u64 bytes, offset, bytes_added; |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 1708 | int ret; |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1709 | |
| 1710 | bytes = info->bytes; |
| 1711 | offset = info->offset; |
| 1712 | |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 1713 | if (!ctl->op->use_bitmap(ctl, info)) |
| 1714 | return 0; |
| 1715 | |
Josef Bacik | 2cdc342 | 2011-05-27 14:07:49 -0400 | [diff] [blame] | 1716 | if (ctl->op == &free_space_op) |
| 1717 | block_group = ctl->private; |
Chris Mason | 38e8788 | 2011-06-10 16:36:57 -0400 | [diff] [blame] | 1718 | again: |
Josef Bacik | 2cdc342 | 2011-05-27 14:07:49 -0400 | [diff] [blame] | 1719 | /* |
| 1720 | * Since we link bitmaps right into the cluster we need to see if we |
| 1721 | * have a cluster here, and if so and it has our bitmap we need to add |
| 1722 | * the free space to that bitmap. |
| 1723 | */ |
| 1724 | if (block_group && !list_empty(&block_group->cluster_list)) { |
| 1725 | struct btrfs_free_cluster *cluster; |
| 1726 | struct rb_node *node; |
| 1727 | struct btrfs_free_space *entry; |
| 1728 | |
| 1729 | cluster = list_entry(block_group->cluster_list.next, |
| 1730 | struct btrfs_free_cluster, |
| 1731 | block_group_list); |
| 1732 | spin_lock(&cluster->lock); |
| 1733 | node = rb_first(&cluster->root); |
| 1734 | if (!node) { |
| 1735 | spin_unlock(&cluster->lock); |
Chris Mason | 38e8788 | 2011-06-10 16:36:57 -0400 | [diff] [blame] | 1736 | goto no_cluster_bitmap; |
Josef Bacik | 2cdc342 | 2011-05-27 14:07:49 -0400 | [diff] [blame] | 1737 | } |
| 1738 | |
| 1739 | entry = rb_entry(node, struct btrfs_free_space, offset_index); |
| 1740 | if (!entry->bitmap) { |
| 1741 | spin_unlock(&cluster->lock); |
Chris Mason | 38e8788 | 2011-06-10 16:36:57 -0400 | [diff] [blame] | 1742 | goto no_cluster_bitmap; |
Josef Bacik | 2cdc342 | 2011-05-27 14:07:49 -0400 | [diff] [blame] | 1743 | } |
| 1744 | |
| 1745 | if (entry->offset == offset_to_bitmap(ctl, offset)) { |
| 1746 | bytes_added = add_bytes_to_bitmap(ctl, entry, |
| 1747 | offset, bytes); |
| 1748 | bytes -= bytes_added; |
| 1749 | offset += bytes_added; |
| 1750 | } |
| 1751 | spin_unlock(&cluster->lock); |
| 1752 | if (!bytes) { |
| 1753 | ret = 1; |
| 1754 | goto out; |
| 1755 | } |
| 1756 | } |
Chris Mason | 38e8788 | 2011-06-10 16:36:57 -0400 | [diff] [blame] | 1757 | |
| 1758 | no_cluster_bitmap: |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 1759 | bitmap_info = tree_search_offset(ctl, offset_to_bitmap(ctl, offset), |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1760 | 1, 0); |
| 1761 | if (!bitmap_info) { |
Josef Bacik | b12d686 | 2013-08-26 17:14:08 -0400 | [diff] [blame] | 1762 | ASSERT(added == 0); |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1763 | goto new_bitmap; |
| 1764 | } |
| 1765 | |
Josef Bacik | 2cdc342 | 2011-05-27 14:07:49 -0400 | [diff] [blame] | 1766 | bytes_added = add_bytes_to_bitmap(ctl, bitmap_info, offset, bytes); |
| 1767 | bytes -= bytes_added; |
| 1768 | offset += bytes_added; |
| 1769 | added = 0; |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1770 | |
| 1771 | if (!bytes) { |
| 1772 | ret = 1; |
| 1773 | goto out; |
| 1774 | } else |
| 1775 | goto again; |
| 1776 | |
| 1777 | new_bitmap: |
| 1778 | if (info && info->bitmap) { |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 1779 | add_new_bitmap(ctl, info, offset); |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1780 | added = 1; |
| 1781 | info = NULL; |
| 1782 | goto again; |
| 1783 | } else { |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 1784 | spin_unlock(&ctl->tree_lock); |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1785 | |
| 1786 | /* no pre-allocated info, allocate a new one */ |
| 1787 | if (!info) { |
Josef Bacik | dc89e98 | 2011-01-28 17:05:48 -0500 | [diff] [blame] | 1788 | info = kmem_cache_zalloc(btrfs_free_space_cachep, |
| 1789 | GFP_NOFS); |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1790 | if (!info) { |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 1791 | spin_lock(&ctl->tree_lock); |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1792 | ret = -ENOMEM; |
| 1793 | goto out; |
| 1794 | } |
| 1795 | } |
| 1796 | |
| 1797 | /* allocate the bitmap */ |
| 1798 | info->bitmap = kzalloc(PAGE_CACHE_SIZE, GFP_NOFS); |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 1799 | spin_lock(&ctl->tree_lock); |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1800 | if (!info->bitmap) { |
| 1801 | ret = -ENOMEM; |
| 1802 | goto out; |
| 1803 | } |
| 1804 | goto again; |
| 1805 | } |
| 1806 | |
| 1807 | out: |
| 1808 | if (info) { |
| 1809 | if (info->bitmap) |
| 1810 | kfree(info->bitmap); |
Josef Bacik | dc89e98 | 2011-01-28 17:05:48 -0500 | [diff] [blame] | 1811 | kmem_cache_free(btrfs_free_space_cachep, info); |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1812 | } |
Josef Bacik | 0f9dd46 | 2008-09-23 13:14:11 -0400 | [diff] [blame] | 1813 | |
| 1814 | return ret; |
| 1815 | } |
| 1816 | |
Chris Mason | 945d896 | 2011-05-22 12:33:42 -0400 | [diff] [blame] | 1817 | static bool try_merge_free_space(struct btrfs_free_space_ctl *ctl, |
Li Zefan | f333adb | 2010-11-09 14:57:39 +0800 | [diff] [blame] | 1818 | struct btrfs_free_space *info, bool update_stat) |
Josef Bacik | 0f9dd46 | 2008-09-23 13:14:11 -0400 | [diff] [blame] | 1819 | { |
Li Zefan | 120d66e | 2010-11-09 14:56:50 +0800 | [diff] [blame] | 1820 | struct btrfs_free_space *left_info; |
| 1821 | struct btrfs_free_space *right_info; |
| 1822 | bool merged = false; |
| 1823 | u64 offset = info->offset; |
| 1824 | u64 bytes = info->bytes; |
Josef Bacik | 6226cb0a | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 1825 | |
Josef Bacik | 0f9dd46 | 2008-09-23 13:14:11 -0400 | [diff] [blame] | 1826 | /* |
| 1827 | * first we want to see if there is free space adjacent to the range we |
| 1828 | * are adding, if there is remove that struct and add a new one to |
| 1829 | * cover the entire range |
| 1830 | */ |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 1831 | right_info = tree_search_offset(ctl, offset + bytes, 0, 0); |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1832 | if (right_info && rb_prev(&right_info->offset_index)) |
| 1833 | left_info = rb_entry(rb_prev(&right_info->offset_index), |
| 1834 | struct btrfs_free_space, offset_index); |
| 1835 | else |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 1836 | left_info = tree_search_offset(ctl, offset - 1, 0, 0); |
Josef Bacik | 0f9dd46 | 2008-09-23 13:14:11 -0400 | [diff] [blame] | 1837 | |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1838 | if (right_info && !right_info->bitmap) { |
Li Zefan | f333adb | 2010-11-09 14:57:39 +0800 | [diff] [blame] | 1839 | if (update_stat) |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 1840 | unlink_free_space(ctl, right_info); |
Li Zefan | f333adb | 2010-11-09 14:57:39 +0800 | [diff] [blame] | 1841 | else |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 1842 | __unlink_free_space(ctl, right_info); |
Josef Bacik | 6226cb0a | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 1843 | info->bytes += right_info->bytes; |
Josef Bacik | dc89e98 | 2011-01-28 17:05:48 -0500 | [diff] [blame] | 1844 | kmem_cache_free(btrfs_free_space_cachep, right_info); |
Li Zefan | 120d66e | 2010-11-09 14:56:50 +0800 | [diff] [blame] | 1845 | merged = true; |
Josef Bacik | 0f9dd46 | 2008-09-23 13:14:11 -0400 | [diff] [blame] | 1846 | } |
| 1847 | |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1848 | if (left_info && !left_info->bitmap && |
| 1849 | left_info->offset + left_info->bytes == offset) { |
Li Zefan | f333adb | 2010-11-09 14:57:39 +0800 | [diff] [blame] | 1850 | if (update_stat) |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 1851 | unlink_free_space(ctl, left_info); |
Li Zefan | f333adb | 2010-11-09 14:57:39 +0800 | [diff] [blame] | 1852 | else |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 1853 | __unlink_free_space(ctl, left_info); |
Josef Bacik | 6226cb0a | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 1854 | info->offset = left_info->offset; |
| 1855 | info->bytes += left_info->bytes; |
Josef Bacik | dc89e98 | 2011-01-28 17:05:48 -0500 | [diff] [blame] | 1856 | kmem_cache_free(btrfs_free_space_cachep, left_info); |
Li Zefan | 120d66e | 2010-11-09 14:56:50 +0800 | [diff] [blame] | 1857 | merged = true; |
Josef Bacik | 0f9dd46 | 2008-09-23 13:14:11 -0400 | [diff] [blame] | 1858 | } |
| 1859 | |
Li Zefan | 120d66e | 2010-11-09 14:56:50 +0800 | [diff] [blame] | 1860 | return merged; |
| 1861 | } |
| 1862 | |
Li Zefan | 581bb05 | 2011-04-20 10:06:11 +0800 | [diff] [blame] | 1863 | int __btrfs_add_free_space(struct btrfs_free_space_ctl *ctl, |
| 1864 | u64 offset, u64 bytes) |
Li Zefan | 120d66e | 2010-11-09 14:56:50 +0800 | [diff] [blame] | 1865 | { |
| 1866 | struct btrfs_free_space *info; |
| 1867 | int ret = 0; |
| 1868 | |
Josef Bacik | dc89e98 | 2011-01-28 17:05:48 -0500 | [diff] [blame] | 1869 | info = kmem_cache_zalloc(btrfs_free_space_cachep, GFP_NOFS); |
Li Zefan | 120d66e | 2010-11-09 14:56:50 +0800 | [diff] [blame] | 1870 | if (!info) |
| 1871 | return -ENOMEM; |
| 1872 | |
| 1873 | info->offset = offset; |
| 1874 | info->bytes = bytes; |
| 1875 | |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 1876 | spin_lock(&ctl->tree_lock); |
Li Zefan | 120d66e | 2010-11-09 14:56:50 +0800 | [diff] [blame] | 1877 | |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 1878 | if (try_merge_free_space(ctl, info, true)) |
Li Zefan | 120d66e | 2010-11-09 14:56:50 +0800 | [diff] [blame] | 1879 | goto link; |
| 1880 | |
| 1881 | /* |
| 1882 | * There was no extent directly to the left or right of this new |
| 1883 | * extent then we know we're going to have to allocate a new extent, so |
| 1884 | * before we do that see if we need to drop this into a bitmap |
| 1885 | */ |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 1886 | ret = insert_into_bitmap(ctl, info); |
Li Zefan | 120d66e | 2010-11-09 14:56:50 +0800 | [diff] [blame] | 1887 | if (ret < 0) { |
| 1888 | goto out; |
| 1889 | } else if (ret) { |
| 1890 | ret = 0; |
| 1891 | goto out; |
| 1892 | } |
| 1893 | link: |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 1894 | ret = link_free_space(ctl, info); |
Josef Bacik | 0f9dd46 | 2008-09-23 13:14:11 -0400 | [diff] [blame] | 1895 | if (ret) |
Josef Bacik | dc89e98 | 2011-01-28 17:05:48 -0500 | [diff] [blame] | 1896 | kmem_cache_free(btrfs_free_space_cachep, info); |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1897 | out: |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 1898 | spin_unlock(&ctl->tree_lock); |
Josef Bacik | 6226cb0a | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 1899 | |
Josef Bacik | 0f9dd46 | 2008-09-23 13:14:11 -0400 | [diff] [blame] | 1900 | if (ret) { |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1901 | printk(KERN_CRIT "btrfs: unable to add free space :%d\n", ret); |
Josef Bacik | b12d686 | 2013-08-26 17:14:08 -0400 | [diff] [blame] | 1902 | ASSERT(ret != -EEXIST); |
Josef Bacik | 0f9dd46 | 2008-09-23 13:14:11 -0400 | [diff] [blame] | 1903 | } |
| 1904 | |
Josef Bacik | 0f9dd46 | 2008-09-23 13:14:11 -0400 | [diff] [blame] | 1905 | return ret; |
| 1906 | } |
| 1907 | |
Josef Bacik | 6226cb0a | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 1908 | int btrfs_remove_free_space(struct btrfs_block_group_cache *block_group, |
| 1909 | u64 offset, u64 bytes) |
Josef Bacik | 0f9dd46 | 2008-09-23 13:14:11 -0400 | [diff] [blame] | 1910 | { |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 1911 | struct btrfs_free_space_ctl *ctl = block_group->free_space_ctl; |
Josef Bacik | 0f9dd46 | 2008-09-23 13:14:11 -0400 | [diff] [blame] | 1912 | struct btrfs_free_space *info; |
Josef Bacik | b017511 | 2012-12-18 11:39:19 -0500 | [diff] [blame] | 1913 | int ret; |
| 1914 | bool re_search = false; |
Josef Bacik | 0f9dd46 | 2008-09-23 13:14:11 -0400 | [diff] [blame] | 1915 | |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 1916 | spin_lock(&ctl->tree_lock); |
Josef Bacik | 6226cb0a | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 1917 | |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1918 | again: |
Josef Bacik | b017511 | 2012-12-18 11:39:19 -0500 | [diff] [blame] | 1919 | ret = 0; |
Josef Bacik | bdb7d30 | 2012-06-27 15:10:56 -0400 | [diff] [blame] | 1920 | if (!bytes) |
| 1921 | goto out_lock; |
| 1922 | |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 1923 | info = tree_search_offset(ctl, offset, 0, 0); |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1924 | if (!info) { |
Josef Bacik | 6606bb9 | 2009-07-31 11:03:58 -0400 | [diff] [blame] | 1925 | /* |
| 1926 | * oops didn't find an extent that matched the space we wanted |
| 1927 | * to remove, look for a bitmap instead |
| 1928 | */ |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 1929 | info = tree_search_offset(ctl, offset_to_bitmap(ctl, offset), |
Josef Bacik | 6606bb9 | 2009-07-31 11:03:58 -0400 | [diff] [blame] | 1930 | 1, 0); |
| 1931 | if (!info) { |
Josef Bacik | b017511 | 2012-12-18 11:39:19 -0500 | [diff] [blame] | 1932 | /* |
| 1933 | * If we found a partial bit of our free space in a |
| 1934 | * bitmap but then couldn't find the other part this may |
| 1935 | * be a problem, so WARN about it. |
Chris Mason | 24a7031 | 2011-11-21 09:39:11 -0500 | [diff] [blame] | 1936 | */ |
Josef Bacik | b017511 | 2012-12-18 11:39:19 -0500 | [diff] [blame] | 1937 | WARN_ON(re_search); |
Josef Bacik | 6606bb9 | 2009-07-31 11:03:58 -0400 | [diff] [blame] | 1938 | goto out_lock; |
| 1939 | } |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1940 | } |
| 1941 | |
Josef Bacik | b017511 | 2012-12-18 11:39:19 -0500 | [diff] [blame] | 1942 | re_search = false; |
Josef Bacik | bdb7d30 | 2012-06-27 15:10:56 -0400 | [diff] [blame] | 1943 | if (!info->bitmap) { |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 1944 | unlink_free_space(ctl, info); |
Josef Bacik | bdb7d30 | 2012-06-27 15:10:56 -0400 | [diff] [blame] | 1945 | if (offset == info->offset) { |
| 1946 | u64 to_free = min(bytes, info->bytes); |
Josef Bacik | 0f9dd46 | 2008-09-23 13:14:11 -0400 | [diff] [blame] | 1947 | |
Josef Bacik | bdb7d30 | 2012-06-27 15:10:56 -0400 | [diff] [blame] | 1948 | info->bytes -= to_free; |
| 1949 | info->offset += to_free; |
| 1950 | if (info->bytes) { |
| 1951 | ret = link_free_space(ctl, info); |
| 1952 | WARN_ON(ret); |
| 1953 | } else { |
| 1954 | kmem_cache_free(btrfs_free_space_cachep, info); |
| 1955 | } |
Josef Bacik | 0f9dd46 | 2008-09-23 13:14:11 -0400 | [diff] [blame] | 1956 | |
Josef Bacik | bdb7d30 | 2012-06-27 15:10:56 -0400 | [diff] [blame] | 1957 | offset += to_free; |
| 1958 | bytes -= to_free; |
| 1959 | goto again; |
| 1960 | } else { |
| 1961 | u64 old_end = info->bytes + info->offset; |
Chris Mason | 9b49c9b | 2008-09-24 11:23:25 -0400 | [diff] [blame] | 1962 | |
Josef Bacik | bdb7d30 | 2012-06-27 15:10:56 -0400 | [diff] [blame] | 1963 | info->bytes = offset - info->offset; |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 1964 | ret = link_free_space(ctl, info); |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1965 | WARN_ON(ret); |
| 1966 | if (ret) |
| 1967 | goto out_lock; |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1968 | |
Josef Bacik | bdb7d30 | 2012-06-27 15:10:56 -0400 | [diff] [blame] | 1969 | /* Not enough bytes in this entry to satisfy us */ |
| 1970 | if (old_end < offset + bytes) { |
| 1971 | bytes -= old_end - offset; |
| 1972 | offset = old_end; |
| 1973 | goto again; |
| 1974 | } else if (old_end == offset + bytes) { |
| 1975 | /* all done */ |
| 1976 | goto out_lock; |
| 1977 | } |
| 1978 | spin_unlock(&ctl->tree_lock); |
| 1979 | |
| 1980 | ret = btrfs_add_free_space(block_group, offset + bytes, |
| 1981 | old_end - (offset + bytes)); |
| 1982 | WARN_ON(ret); |
| 1983 | goto out; |
| 1984 | } |
Josef Bacik | 0f9dd46 | 2008-09-23 13:14:11 -0400 | [diff] [blame] | 1985 | } |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1986 | |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 1987 | ret = remove_from_bitmap(ctl, info, &offset, &bytes); |
Josef Bacik | b017511 | 2012-12-18 11:39:19 -0500 | [diff] [blame] | 1988 | if (ret == -EAGAIN) { |
| 1989 | re_search = true; |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1990 | goto again; |
Josef Bacik | b017511 | 2012-12-18 11:39:19 -0500 | [diff] [blame] | 1991 | } |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 1992 | out_lock: |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 1993 | spin_unlock(&ctl->tree_lock); |
Josef Bacik | 0f9dd46 | 2008-09-23 13:14:11 -0400 | [diff] [blame] | 1994 | out: |
Josef Bacik | 2517920 | 2008-10-29 14:49:05 -0400 | [diff] [blame] | 1995 | return ret; |
| 1996 | } |
| 1997 | |
Josef Bacik | 0f9dd46 | 2008-09-23 13:14:11 -0400 | [diff] [blame] | 1998 | void btrfs_dump_free_space(struct btrfs_block_group_cache *block_group, |
| 1999 | u64 bytes) |
| 2000 | { |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 2001 | struct btrfs_free_space_ctl *ctl = block_group->free_space_ctl; |
Josef Bacik | 0f9dd46 | 2008-09-23 13:14:11 -0400 | [diff] [blame] | 2002 | struct btrfs_free_space *info; |
| 2003 | struct rb_node *n; |
| 2004 | int count = 0; |
| 2005 | |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 2006 | for (n = rb_first(&ctl->free_space_offset); n; n = rb_next(n)) { |
Josef Bacik | 0f9dd46 | 2008-09-23 13:14:11 -0400 | [diff] [blame] | 2007 | info = rb_entry(n, struct btrfs_free_space, offset_index); |
Liu Bo | f6175ef | 2012-07-06 03:31:36 -0600 | [diff] [blame] | 2008 | if (info->bytes >= bytes && !block_group->ro) |
Josef Bacik | 0f9dd46 | 2008-09-23 13:14:11 -0400 | [diff] [blame] | 2009 | count++; |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 2010 | printk(KERN_CRIT "entry offset %llu, bytes %llu, bitmap %s\n", |
Geert Uytterhoeven | c1c9ff7 | 2013-08-20 13:20:07 +0200 | [diff] [blame] | 2011 | info->offset, info->bytes, |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 2012 | (info->bitmap) ? "yes" : "no"); |
Josef Bacik | 0f9dd46 | 2008-09-23 13:14:11 -0400 | [diff] [blame] | 2013 | } |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 2014 | printk(KERN_INFO "block group has cluster?: %s\n", |
| 2015 | list_empty(&block_group->cluster_list) ? "no" : "yes"); |
Josef Bacik | 0f9dd46 | 2008-09-23 13:14:11 -0400 | [diff] [blame] | 2016 | printk(KERN_INFO "%d blocks of free space at or bigger than bytes is" |
| 2017 | "\n", count); |
| 2018 | } |
| 2019 | |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 2020 | void btrfs_init_free_space_ctl(struct btrfs_block_group_cache *block_group) |
Josef Bacik | 0f9dd46 | 2008-09-23 13:14:11 -0400 | [diff] [blame] | 2021 | { |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 2022 | struct btrfs_free_space_ctl *ctl = block_group->free_space_ctl; |
Josef Bacik | 0f9dd46 | 2008-09-23 13:14:11 -0400 | [diff] [blame] | 2023 | |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 2024 | spin_lock_init(&ctl->tree_lock); |
| 2025 | ctl->unit = block_group->sectorsize; |
| 2026 | ctl->start = block_group->key.objectid; |
| 2027 | ctl->private = block_group; |
| 2028 | ctl->op = &free_space_op; |
Josef Bacik | 0f9dd46 | 2008-09-23 13:14:11 -0400 | [diff] [blame] | 2029 | |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 2030 | /* |
| 2031 | * we only want to have 32k of ram per block group for keeping |
| 2032 | * track of free space, and if we pass 1/2 of that we want to |
| 2033 | * start converting things over to using bitmaps |
| 2034 | */ |
| 2035 | ctl->extents_thresh = ((1024 * 32) / 2) / |
| 2036 | sizeof(struct btrfs_free_space); |
Josef Bacik | 0f9dd46 | 2008-09-23 13:14:11 -0400 | [diff] [blame] | 2037 | } |
| 2038 | |
Chris Mason | fa9c0d79 | 2009-04-03 09:47:43 -0400 | [diff] [blame] | 2039 | /* |
| 2040 | * for a given cluster, put all of its extents back into the free |
| 2041 | * space cache. If the block group passed doesn't match the block group |
| 2042 | * pointed to by the cluster, someone else raced in and freed the |
| 2043 | * cluster already. In that case, we just return without changing anything |
| 2044 | */ |
| 2045 | static int |
| 2046 | __btrfs_return_cluster_to_free_space( |
| 2047 | struct btrfs_block_group_cache *block_group, |
| 2048 | struct btrfs_free_cluster *cluster) |
| 2049 | { |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 2050 | struct btrfs_free_space_ctl *ctl = block_group->free_space_ctl; |
Chris Mason | fa9c0d79 | 2009-04-03 09:47:43 -0400 | [diff] [blame] | 2051 | struct btrfs_free_space *entry; |
| 2052 | struct rb_node *node; |
| 2053 | |
| 2054 | spin_lock(&cluster->lock); |
| 2055 | if (cluster->block_group != block_group) |
| 2056 | goto out; |
| 2057 | |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 2058 | cluster->block_group = NULL; |
Chris Mason | fa9c0d79 | 2009-04-03 09:47:43 -0400 | [diff] [blame] | 2059 | cluster->window_start = 0; |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 2060 | list_del_init(&cluster->block_group_list); |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 2061 | |
Chris Mason | fa9c0d79 | 2009-04-03 09:47:43 -0400 | [diff] [blame] | 2062 | node = rb_first(&cluster->root); |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 2063 | while (node) { |
Josef Bacik | 4e69b59 | 2011-03-21 10:11:24 -0400 | [diff] [blame] | 2064 | bool bitmap; |
| 2065 | |
Chris Mason | fa9c0d79 | 2009-04-03 09:47:43 -0400 | [diff] [blame] | 2066 | entry = rb_entry(node, struct btrfs_free_space, offset_index); |
| 2067 | node = rb_next(&entry->offset_index); |
| 2068 | rb_erase(&entry->offset_index, &cluster->root); |
Josef Bacik | 4e69b59 | 2011-03-21 10:11:24 -0400 | [diff] [blame] | 2069 | |
| 2070 | bitmap = (entry->bitmap != NULL); |
| 2071 | if (!bitmap) |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 2072 | try_merge_free_space(ctl, entry, false); |
| 2073 | tree_insert_offset(&ctl->free_space_offset, |
Josef Bacik | 4e69b59 | 2011-03-21 10:11:24 -0400 | [diff] [blame] | 2074 | entry->offset, &entry->offset_index, bitmap); |
Chris Mason | fa9c0d79 | 2009-04-03 09:47:43 -0400 | [diff] [blame] | 2075 | } |
Eric Paris | 6bef4d3 | 2010-02-23 19:43:04 +0000 | [diff] [blame] | 2076 | cluster->root = RB_ROOT; |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 2077 | |
Chris Mason | fa9c0d79 | 2009-04-03 09:47:43 -0400 | [diff] [blame] | 2078 | out: |
| 2079 | spin_unlock(&cluster->lock); |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 2080 | btrfs_put_block_group(block_group); |
Chris Mason | fa9c0d79 | 2009-04-03 09:47:43 -0400 | [diff] [blame] | 2081 | return 0; |
| 2082 | } |
| 2083 | |
Eric Sandeen | 48a3b63 | 2013-04-25 20:41:01 +0000 | [diff] [blame] | 2084 | static void __btrfs_remove_free_space_cache_locked( |
| 2085 | struct btrfs_free_space_ctl *ctl) |
Josef Bacik | 0f9dd46 | 2008-09-23 13:14:11 -0400 | [diff] [blame] | 2086 | { |
| 2087 | struct btrfs_free_space *info; |
| 2088 | struct rb_node *node; |
Li Zefan | 581bb05 | 2011-04-20 10:06:11 +0800 | [diff] [blame] | 2089 | |
Li Zefan | 581bb05 | 2011-04-20 10:06:11 +0800 | [diff] [blame] | 2090 | while ((node = rb_last(&ctl->free_space_offset)) != NULL) { |
| 2091 | info = rb_entry(node, struct btrfs_free_space, offset_index); |
Josef Bacik | 9b90f51 | 2011-06-24 16:02:51 +0000 | [diff] [blame] | 2092 | if (!info->bitmap) { |
| 2093 | unlink_free_space(ctl, info); |
| 2094 | kmem_cache_free(btrfs_free_space_cachep, info); |
| 2095 | } else { |
| 2096 | free_bitmap(ctl, info); |
| 2097 | } |
Li Zefan | 581bb05 | 2011-04-20 10:06:11 +0800 | [diff] [blame] | 2098 | if (need_resched()) { |
| 2099 | spin_unlock(&ctl->tree_lock); |
| 2100 | cond_resched(); |
| 2101 | spin_lock(&ctl->tree_lock); |
| 2102 | } |
| 2103 | } |
Chris Mason | 0965537 | 2011-05-21 09:27:38 -0400 | [diff] [blame] | 2104 | } |
| 2105 | |
| 2106 | void __btrfs_remove_free_space_cache(struct btrfs_free_space_ctl *ctl) |
| 2107 | { |
| 2108 | spin_lock(&ctl->tree_lock); |
| 2109 | __btrfs_remove_free_space_cache_locked(ctl); |
Li Zefan | 581bb05 | 2011-04-20 10:06:11 +0800 | [diff] [blame] | 2110 | spin_unlock(&ctl->tree_lock); |
| 2111 | } |
| 2112 | |
Josef Bacik | 0f9dd46 | 2008-09-23 13:14:11 -0400 | [diff] [blame] | 2113 | void btrfs_remove_free_space_cache(struct btrfs_block_group_cache *block_group) |
| 2114 | { |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 2115 | struct btrfs_free_space_ctl *ctl = block_group->free_space_ctl; |
Chris Mason | fa9c0d79 | 2009-04-03 09:47:43 -0400 | [diff] [blame] | 2116 | struct btrfs_free_cluster *cluster; |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 2117 | struct list_head *head; |
Josef Bacik | 0f9dd46 | 2008-09-23 13:14:11 -0400 | [diff] [blame] | 2118 | |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 2119 | spin_lock(&ctl->tree_lock); |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 2120 | while ((head = block_group->cluster_list.next) != |
| 2121 | &block_group->cluster_list) { |
| 2122 | cluster = list_entry(head, struct btrfs_free_cluster, |
| 2123 | block_group_list); |
Chris Mason | fa9c0d79 | 2009-04-03 09:47:43 -0400 | [diff] [blame] | 2124 | |
| 2125 | WARN_ON(cluster->block_group != block_group); |
| 2126 | __btrfs_return_cluster_to_free_space(block_group, cluster); |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 2127 | if (need_resched()) { |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 2128 | spin_unlock(&ctl->tree_lock); |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 2129 | cond_resched(); |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 2130 | spin_lock(&ctl->tree_lock); |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 2131 | } |
Chris Mason | fa9c0d79 | 2009-04-03 09:47:43 -0400 | [diff] [blame] | 2132 | } |
Chris Mason | 0965537 | 2011-05-21 09:27:38 -0400 | [diff] [blame] | 2133 | __btrfs_remove_free_space_cache_locked(ctl); |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 2134 | spin_unlock(&ctl->tree_lock); |
Chris Mason | fa9c0d79 | 2009-04-03 09:47:43 -0400 | [diff] [blame] | 2135 | |
Josef Bacik | 0f9dd46 | 2008-09-23 13:14:11 -0400 | [diff] [blame] | 2136 | } |
| 2137 | |
Josef Bacik | 6226cb0a | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 2138 | u64 btrfs_find_space_for_alloc(struct btrfs_block_group_cache *block_group, |
Miao Xie | a482039 | 2013-09-09 13:19:42 +0800 | [diff] [blame] | 2139 | u64 offset, u64 bytes, u64 empty_size, |
| 2140 | u64 *max_extent_size) |
Josef Bacik | 0f9dd46 | 2008-09-23 13:14:11 -0400 | [diff] [blame] | 2141 | { |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 2142 | struct btrfs_free_space_ctl *ctl = block_group->free_space_ctl; |
Josef Bacik | 6226cb0a | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 2143 | struct btrfs_free_space *entry = NULL; |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 2144 | u64 bytes_search = bytes + empty_size; |
Josef Bacik | 6226cb0a | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 2145 | u64 ret = 0; |
David Woodhouse | 53b381b | 2013-01-29 18:40:14 -0500 | [diff] [blame] | 2146 | u64 align_gap = 0; |
| 2147 | u64 align_gap_len = 0; |
Josef Bacik | 0f9dd46 | 2008-09-23 13:14:11 -0400 | [diff] [blame] | 2148 | |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 2149 | spin_lock(&ctl->tree_lock); |
David Woodhouse | 53b381b | 2013-01-29 18:40:14 -0500 | [diff] [blame] | 2150 | entry = find_free_space(ctl, &offset, &bytes_search, |
Miao Xie | a482039 | 2013-09-09 13:19:42 +0800 | [diff] [blame] | 2151 | block_group->full_stripe_len, max_extent_size); |
Josef Bacik | 6226cb0a | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 2152 | if (!entry) |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 2153 | goto out; |
| 2154 | |
| 2155 | ret = offset; |
| 2156 | if (entry->bitmap) { |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 2157 | bitmap_clear_bits(ctl, entry, offset, bytes); |
Li Zefan | edf6e2d | 2010-11-09 14:50:07 +0800 | [diff] [blame] | 2158 | if (!entry->bytes) |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 2159 | free_bitmap(ctl, entry); |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 2160 | } else { |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 2161 | unlink_free_space(ctl, entry); |
David Woodhouse | 53b381b | 2013-01-29 18:40:14 -0500 | [diff] [blame] | 2162 | align_gap_len = offset - entry->offset; |
| 2163 | align_gap = entry->offset; |
| 2164 | |
| 2165 | entry->offset = offset + bytes; |
| 2166 | WARN_ON(entry->bytes < bytes + align_gap_len); |
| 2167 | |
| 2168 | entry->bytes -= bytes + align_gap_len; |
Josef Bacik | 6226cb0a | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 2169 | if (!entry->bytes) |
Josef Bacik | dc89e98 | 2011-01-28 17:05:48 -0500 | [diff] [blame] | 2170 | kmem_cache_free(btrfs_free_space_cachep, entry); |
Josef Bacik | 6226cb0a | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 2171 | else |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 2172 | link_free_space(ctl, entry); |
Josef Bacik | 6226cb0a | 2009-04-03 10:14:18 -0400 | [diff] [blame] | 2173 | } |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 2174 | out: |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 2175 | spin_unlock(&ctl->tree_lock); |
Josef Bacik | 817d52f | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 2176 | |
David Woodhouse | 53b381b | 2013-01-29 18:40:14 -0500 | [diff] [blame] | 2177 | if (align_gap_len) |
| 2178 | __btrfs_add_free_space(ctl, align_gap, align_gap_len); |
Josef Bacik | 0f9dd46 | 2008-09-23 13:14:11 -0400 | [diff] [blame] | 2179 | return ret; |
| 2180 | } |
Chris Mason | fa9c0d79 | 2009-04-03 09:47:43 -0400 | [diff] [blame] | 2181 | |
| 2182 | /* |
| 2183 | * given a cluster, put all of its extents back into the free space |
| 2184 | * cache. If a block group is passed, this function will only free |
| 2185 | * a cluster that belongs to the passed block group. |
| 2186 | * |
| 2187 | * Otherwise, it'll get a reference on the block group pointed to by the |
| 2188 | * cluster and remove the cluster from it. |
| 2189 | */ |
| 2190 | int btrfs_return_cluster_to_free_space( |
| 2191 | struct btrfs_block_group_cache *block_group, |
| 2192 | struct btrfs_free_cluster *cluster) |
| 2193 | { |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 2194 | struct btrfs_free_space_ctl *ctl; |
Chris Mason | fa9c0d79 | 2009-04-03 09:47:43 -0400 | [diff] [blame] | 2195 | int ret; |
| 2196 | |
| 2197 | /* first, get a safe pointer to the block group */ |
| 2198 | spin_lock(&cluster->lock); |
| 2199 | if (!block_group) { |
| 2200 | block_group = cluster->block_group; |
| 2201 | if (!block_group) { |
| 2202 | spin_unlock(&cluster->lock); |
| 2203 | return 0; |
| 2204 | } |
| 2205 | } else if (cluster->block_group != block_group) { |
| 2206 | /* someone else has already freed it don't redo their work */ |
| 2207 | spin_unlock(&cluster->lock); |
| 2208 | return 0; |
| 2209 | } |
| 2210 | atomic_inc(&block_group->count); |
| 2211 | spin_unlock(&cluster->lock); |
| 2212 | |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 2213 | ctl = block_group->free_space_ctl; |
| 2214 | |
Chris Mason | fa9c0d79 | 2009-04-03 09:47:43 -0400 | [diff] [blame] | 2215 | /* now return any extents the cluster had on it */ |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 2216 | spin_lock(&ctl->tree_lock); |
Chris Mason | fa9c0d79 | 2009-04-03 09:47:43 -0400 | [diff] [blame] | 2217 | ret = __btrfs_return_cluster_to_free_space(block_group, cluster); |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 2218 | spin_unlock(&ctl->tree_lock); |
Chris Mason | fa9c0d79 | 2009-04-03 09:47:43 -0400 | [diff] [blame] | 2219 | |
| 2220 | /* finally drop our ref */ |
| 2221 | btrfs_put_block_group(block_group); |
| 2222 | return ret; |
| 2223 | } |
| 2224 | |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 2225 | static u64 btrfs_alloc_from_bitmap(struct btrfs_block_group_cache *block_group, |
| 2226 | struct btrfs_free_cluster *cluster, |
Josef Bacik | 4e69b59 | 2011-03-21 10:11:24 -0400 | [diff] [blame] | 2227 | struct btrfs_free_space *entry, |
Miao Xie | a482039 | 2013-09-09 13:19:42 +0800 | [diff] [blame] | 2228 | u64 bytes, u64 min_start, |
| 2229 | u64 *max_extent_size) |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 2230 | { |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 2231 | struct btrfs_free_space_ctl *ctl = block_group->free_space_ctl; |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 2232 | int err; |
| 2233 | u64 search_start = cluster->window_start; |
| 2234 | u64 search_bytes = bytes; |
| 2235 | u64 ret = 0; |
| 2236 | |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 2237 | search_start = min_start; |
| 2238 | search_bytes = bytes; |
| 2239 | |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 2240 | err = search_bitmap(ctl, entry, &search_start, &search_bytes); |
Miao Xie | a482039 | 2013-09-09 13:19:42 +0800 | [diff] [blame] | 2241 | if (err) { |
| 2242 | if (search_bytes > *max_extent_size) |
| 2243 | *max_extent_size = search_bytes; |
Josef Bacik | 4e69b59 | 2011-03-21 10:11:24 -0400 | [diff] [blame] | 2244 | return 0; |
Miao Xie | a482039 | 2013-09-09 13:19:42 +0800 | [diff] [blame] | 2245 | } |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 2246 | |
| 2247 | ret = search_start; |
Miao Xie | bb3ac5a | 2011-08-05 09:32:35 +0000 | [diff] [blame] | 2248 | __bitmap_clear_bits(ctl, entry, ret, bytes); |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 2249 | |
| 2250 | return ret; |
| 2251 | } |
| 2252 | |
Chris Mason | fa9c0d79 | 2009-04-03 09:47:43 -0400 | [diff] [blame] | 2253 | /* |
| 2254 | * given a cluster, try to allocate 'bytes' from it, returns 0 |
| 2255 | * if it couldn't find anything suitably large, or a logical disk offset |
| 2256 | * if things worked out |
| 2257 | */ |
| 2258 | u64 btrfs_alloc_from_cluster(struct btrfs_block_group_cache *block_group, |
| 2259 | struct btrfs_free_cluster *cluster, u64 bytes, |
Miao Xie | a482039 | 2013-09-09 13:19:42 +0800 | [diff] [blame] | 2260 | u64 min_start, u64 *max_extent_size) |
Chris Mason | fa9c0d79 | 2009-04-03 09:47:43 -0400 | [diff] [blame] | 2261 | { |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 2262 | struct btrfs_free_space_ctl *ctl = block_group->free_space_ctl; |
Chris Mason | fa9c0d79 | 2009-04-03 09:47:43 -0400 | [diff] [blame] | 2263 | struct btrfs_free_space *entry = NULL; |
| 2264 | struct rb_node *node; |
| 2265 | u64 ret = 0; |
| 2266 | |
| 2267 | spin_lock(&cluster->lock); |
| 2268 | if (bytes > cluster->max_size) |
| 2269 | goto out; |
| 2270 | |
| 2271 | if (cluster->block_group != block_group) |
| 2272 | goto out; |
| 2273 | |
| 2274 | node = rb_first(&cluster->root); |
| 2275 | if (!node) |
| 2276 | goto out; |
| 2277 | |
| 2278 | entry = rb_entry(node, struct btrfs_free_space, offset_index); |
Chris Mason | fa9c0d79 | 2009-04-03 09:47:43 -0400 | [diff] [blame] | 2279 | while(1) { |
Miao Xie | a482039 | 2013-09-09 13:19:42 +0800 | [diff] [blame] | 2280 | if (entry->bytes < bytes && entry->bytes > *max_extent_size) |
| 2281 | *max_extent_size = entry->bytes; |
| 2282 | |
Josef Bacik | 4e69b59 | 2011-03-21 10:11:24 -0400 | [diff] [blame] | 2283 | if (entry->bytes < bytes || |
| 2284 | (!entry->bitmap && entry->offset < min_start)) { |
Chris Mason | fa9c0d79 | 2009-04-03 09:47:43 -0400 | [diff] [blame] | 2285 | node = rb_next(&entry->offset_index); |
| 2286 | if (!node) |
| 2287 | break; |
| 2288 | entry = rb_entry(node, struct btrfs_free_space, |
| 2289 | offset_index); |
| 2290 | continue; |
| 2291 | } |
Chris Mason | fa9c0d79 | 2009-04-03 09:47:43 -0400 | [diff] [blame] | 2292 | |
Josef Bacik | 4e69b59 | 2011-03-21 10:11:24 -0400 | [diff] [blame] | 2293 | if (entry->bitmap) { |
| 2294 | ret = btrfs_alloc_from_bitmap(block_group, |
| 2295 | cluster, entry, bytes, |
Miao Xie | a482039 | 2013-09-09 13:19:42 +0800 | [diff] [blame] | 2296 | cluster->window_start, |
| 2297 | max_extent_size); |
Josef Bacik | 4e69b59 | 2011-03-21 10:11:24 -0400 | [diff] [blame] | 2298 | if (ret == 0) { |
Josef Bacik | 4e69b59 | 2011-03-21 10:11:24 -0400 | [diff] [blame] | 2299 | node = rb_next(&entry->offset_index); |
| 2300 | if (!node) |
| 2301 | break; |
| 2302 | entry = rb_entry(node, struct btrfs_free_space, |
| 2303 | offset_index); |
| 2304 | continue; |
| 2305 | } |
Josef Bacik | 9b23062 | 2012-01-26 15:01:12 -0500 | [diff] [blame] | 2306 | cluster->window_start += bytes; |
Josef Bacik | 4e69b59 | 2011-03-21 10:11:24 -0400 | [diff] [blame] | 2307 | } else { |
Josef Bacik | 4e69b59 | 2011-03-21 10:11:24 -0400 | [diff] [blame] | 2308 | ret = entry->offset; |
| 2309 | |
| 2310 | entry->offset += bytes; |
| 2311 | entry->bytes -= bytes; |
| 2312 | } |
Chris Mason | fa9c0d79 | 2009-04-03 09:47:43 -0400 | [diff] [blame] | 2313 | |
Li Zefan | 5e71b5d | 2010-11-09 14:55:34 +0800 | [diff] [blame] | 2314 | if (entry->bytes == 0) |
Chris Mason | fa9c0d79 | 2009-04-03 09:47:43 -0400 | [diff] [blame] | 2315 | rb_erase(&entry->offset_index, &cluster->root); |
Chris Mason | fa9c0d79 | 2009-04-03 09:47:43 -0400 | [diff] [blame] | 2316 | break; |
| 2317 | } |
| 2318 | out: |
| 2319 | spin_unlock(&cluster->lock); |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 2320 | |
Li Zefan | 5e71b5d | 2010-11-09 14:55:34 +0800 | [diff] [blame] | 2321 | if (!ret) |
| 2322 | return 0; |
| 2323 | |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 2324 | spin_lock(&ctl->tree_lock); |
Li Zefan | 5e71b5d | 2010-11-09 14:55:34 +0800 | [diff] [blame] | 2325 | |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 2326 | ctl->free_space -= bytes; |
Li Zefan | 5e71b5d | 2010-11-09 14:55:34 +0800 | [diff] [blame] | 2327 | if (entry->bytes == 0) { |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 2328 | ctl->free_extents--; |
Josef Bacik | 4e69b59 | 2011-03-21 10:11:24 -0400 | [diff] [blame] | 2329 | if (entry->bitmap) { |
| 2330 | kfree(entry->bitmap); |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 2331 | ctl->total_bitmaps--; |
| 2332 | ctl->op->recalc_thresholds(ctl); |
Josef Bacik | 4e69b59 | 2011-03-21 10:11:24 -0400 | [diff] [blame] | 2333 | } |
Josef Bacik | dc89e98 | 2011-01-28 17:05:48 -0500 | [diff] [blame] | 2334 | kmem_cache_free(btrfs_free_space_cachep, entry); |
Li Zefan | 5e71b5d | 2010-11-09 14:55:34 +0800 | [diff] [blame] | 2335 | } |
| 2336 | |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 2337 | spin_unlock(&ctl->tree_lock); |
Li Zefan | 5e71b5d | 2010-11-09 14:55:34 +0800 | [diff] [blame] | 2338 | |
Chris Mason | fa9c0d79 | 2009-04-03 09:47:43 -0400 | [diff] [blame] | 2339 | return ret; |
| 2340 | } |
| 2341 | |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 2342 | static int btrfs_bitmap_cluster(struct btrfs_block_group_cache *block_group, |
| 2343 | struct btrfs_free_space *entry, |
| 2344 | struct btrfs_free_cluster *cluster, |
Alexandre Oliva | 1bb9190 | 2011-10-14 12:10:36 -0300 | [diff] [blame] | 2345 | u64 offset, u64 bytes, |
| 2346 | u64 cont1_bytes, u64 min_bytes) |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 2347 | { |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 2348 | struct btrfs_free_space_ctl *ctl = block_group->free_space_ctl; |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 2349 | unsigned long next_zero; |
| 2350 | unsigned long i; |
Alexandre Oliva | 1bb9190 | 2011-10-14 12:10:36 -0300 | [diff] [blame] | 2351 | unsigned long want_bits; |
| 2352 | unsigned long min_bits; |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 2353 | unsigned long found_bits; |
| 2354 | unsigned long start = 0; |
| 2355 | unsigned long total_found = 0; |
Josef Bacik | 4e69b59 | 2011-03-21 10:11:24 -0400 | [diff] [blame] | 2356 | int ret; |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 2357 | |
Wang Sheng-Hui | 9600976 | 2012-11-30 06:30:14 +0000 | [diff] [blame] | 2358 | i = offset_to_bit(entry->offset, ctl->unit, |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 2359 | max_t(u64, offset, entry->offset)); |
Wang Sheng-Hui | 9600976 | 2012-11-30 06:30:14 +0000 | [diff] [blame] | 2360 | want_bits = bytes_to_bits(bytes, ctl->unit); |
| 2361 | min_bits = bytes_to_bits(min_bytes, ctl->unit); |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 2362 | |
| 2363 | again: |
| 2364 | found_bits = 0; |
Wei Yongjun | ebb3dad | 2012-09-13 20:29:02 -0600 | [diff] [blame] | 2365 | for_each_set_bit_from(i, entry->bitmap, BITS_PER_BITMAP) { |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 2366 | next_zero = find_next_zero_bit(entry->bitmap, |
| 2367 | BITS_PER_BITMAP, i); |
Alexandre Oliva | 1bb9190 | 2011-10-14 12:10:36 -0300 | [diff] [blame] | 2368 | if (next_zero - i >= min_bits) { |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 2369 | found_bits = next_zero - i; |
| 2370 | break; |
| 2371 | } |
| 2372 | i = next_zero; |
| 2373 | } |
| 2374 | |
| 2375 | if (!found_bits) |
Josef Bacik | 4e69b59 | 2011-03-21 10:11:24 -0400 | [diff] [blame] | 2376 | return -ENOSPC; |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 2377 | |
Alexandre Oliva | 1bb9190 | 2011-10-14 12:10:36 -0300 | [diff] [blame] | 2378 | if (!total_found) { |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 2379 | start = i; |
Alexandre Oliva | b78d09b | 2011-11-30 13:43:00 -0500 | [diff] [blame] | 2380 | cluster->max_size = 0; |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 2381 | } |
| 2382 | |
| 2383 | total_found += found_bits; |
| 2384 | |
Wang Sheng-Hui | 9600976 | 2012-11-30 06:30:14 +0000 | [diff] [blame] | 2385 | if (cluster->max_size < found_bits * ctl->unit) |
| 2386 | cluster->max_size = found_bits * ctl->unit; |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 2387 | |
Alexandre Oliva | 1bb9190 | 2011-10-14 12:10:36 -0300 | [diff] [blame] | 2388 | if (total_found < want_bits || cluster->max_size < cont1_bytes) { |
| 2389 | i = next_zero + 1; |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 2390 | goto again; |
| 2391 | } |
| 2392 | |
Wang Sheng-Hui | 9600976 | 2012-11-30 06:30:14 +0000 | [diff] [blame] | 2393 | cluster->window_start = start * ctl->unit + entry->offset; |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 2394 | rb_erase(&entry->offset_index, &ctl->free_space_offset); |
Josef Bacik | 4e69b59 | 2011-03-21 10:11:24 -0400 | [diff] [blame] | 2395 | ret = tree_insert_offset(&cluster->root, entry->offset, |
| 2396 | &entry->offset_index, 1); |
Josef Bacik | b12d686 | 2013-08-26 17:14:08 -0400 | [diff] [blame] | 2397 | ASSERT(!ret); /* -EEXIST; Logic error */ |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 2398 | |
Josef Bacik | 3f7de03 | 2011-11-10 08:29:20 -0500 | [diff] [blame] | 2399 | trace_btrfs_setup_cluster(block_group, cluster, |
Wang Sheng-Hui | 9600976 | 2012-11-30 06:30:14 +0000 | [diff] [blame] | 2400 | total_found * ctl->unit, 1); |
Josef Bacik | 9630308 | 2009-07-13 21:29:25 -0400 | [diff] [blame] | 2401 | return 0; |
| 2402 | } |
| 2403 | |
Chris Mason | fa9c0d79 | 2009-04-03 09:47:43 -0400 | [diff] [blame] | 2404 | /* |
Josef Bacik | 4e69b59 | 2011-03-21 10:11:24 -0400 | [diff] [blame] | 2405 | * This searches the block group for just extents to fill the cluster with. |
Alexandre Oliva | 1bb9190 | 2011-10-14 12:10:36 -0300 | [diff] [blame] | 2406 | * Try to find a cluster with at least bytes total bytes, at least one |
| 2407 | * extent of cont1_bytes, and other clusters of at least min_bytes. |
Josef Bacik | 4e69b59 | 2011-03-21 10:11:24 -0400 | [diff] [blame] | 2408 | */ |
Josef Bacik | 3de85bb | 2011-05-25 13:07:37 -0400 | [diff] [blame] | 2409 | static noinline int |
| 2410 | setup_cluster_no_bitmap(struct btrfs_block_group_cache *block_group, |
| 2411 | struct btrfs_free_cluster *cluster, |
| 2412 | struct list_head *bitmaps, u64 offset, u64 bytes, |
Alexandre Oliva | 1bb9190 | 2011-10-14 12:10:36 -0300 | [diff] [blame] | 2413 | u64 cont1_bytes, u64 min_bytes) |
Josef Bacik | 4e69b59 | 2011-03-21 10:11:24 -0400 | [diff] [blame] | 2414 | { |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 2415 | struct btrfs_free_space_ctl *ctl = block_group->free_space_ctl; |
Josef Bacik | 4e69b59 | 2011-03-21 10:11:24 -0400 | [diff] [blame] | 2416 | struct btrfs_free_space *first = NULL; |
| 2417 | struct btrfs_free_space *entry = NULL; |
Josef Bacik | 4e69b59 | 2011-03-21 10:11:24 -0400 | [diff] [blame] | 2418 | struct btrfs_free_space *last; |
| 2419 | struct rb_node *node; |
| 2420 | u64 window_start; |
| 2421 | u64 window_free; |
| 2422 | u64 max_extent; |
Josef Bacik | 3f7de03 | 2011-11-10 08:29:20 -0500 | [diff] [blame] | 2423 | u64 total_size = 0; |
Josef Bacik | 4e69b59 | 2011-03-21 10:11:24 -0400 | [diff] [blame] | 2424 | |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 2425 | entry = tree_search_offset(ctl, offset, 0, 1); |
Josef Bacik | 4e69b59 | 2011-03-21 10:11:24 -0400 | [diff] [blame] | 2426 | if (!entry) |
| 2427 | return -ENOSPC; |
| 2428 | |
| 2429 | /* |
| 2430 | * We don't want bitmaps, so just move along until we find a normal |
| 2431 | * extent entry. |
| 2432 | */ |
Alexandre Oliva | 1bb9190 | 2011-10-14 12:10:36 -0300 | [diff] [blame] | 2433 | while (entry->bitmap || entry->bytes < min_bytes) { |
| 2434 | if (entry->bitmap && list_empty(&entry->list)) |
Josef Bacik | 86d4a77 | 2011-05-25 13:03:16 -0400 | [diff] [blame] | 2435 | list_add_tail(&entry->list, bitmaps); |
Josef Bacik | 4e69b59 | 2011-03-21 10:11:24 -0400 | [diff] [blame] | 2436 | node = rb_next(&entry->offset_index); |
| 2437 | if (!node) |
| 2438 | return -ENOSPC; |
| 2439 | entry = rb_entry(node, struct btrfs_free_space, offset_index); |
| 2440 | } |
| 2441 | |
| 2442 | window_start = entry->offset; |
| 2443 | window_free = entry->bytes; |
| 2444 | max_extent = entry->bytes; |
| 2445 | first = entry; |
| 2446 | last = entry; |
Josef Bacik | 4e69b59 | 2011-03-21 10:11:24 -0400 | [diff] [blame] | 2447 | |
Alexandre Oliva | 1bb9190 | 2011-10-14 12:10:36 -0300 | [diff] [blame] | 2448 | for (node = rb_next(&entry->offset_index); node; |
| 2449 | node = rb_next(&entry->offset_index)) { |
Josef Bacik | 4e69b59 | 2011-03-21 10:11:24 -0400 | [diff] [blame] | 2450 | entry = rb_entry(node, struct btrfs_free_space, offset_index); |
| 2451 | |
Josef Bacik | 86d4a77 | 2011-05-25 13:03:16 -0400 | [diff] [blame] | 2452 | if (entry->bitmap) { |
| 2453 | if (list_empty(&entry->list)) |
| 2454 | list_add_tail(&entry->list, bitmaps); |
Josef Bacik | 4e69b59 | 2011-03-21 10:11:24 -0400 | [diff] [blame] | 2455 | continue; |
Josef Bacik | 86d4a77 | 2011-05-25 13:03:16 -0400 | [diff] [blame] | 2456 | } |
| 2457 | |
Alexandre Oliva | 1bb9190 | 2011-10-14 12:10:36 -0300 | [diff] [blame] | 2458 | if (entry->bytes < min_bytes) |
| 2459 | continue; |
| 2460 | |
| 2461 | last = entry; |
| 2462 | window_free += entry->bytes; |
| 2463 | if (entry->bytes > max_extent) |
Josef Bacik | 4e69b59 | 2011-03-21 10:11:24 -0400 | [diff] [blame] | 2464 | max_extent = entry->bytes; |
Josef Bacik | 4e69b59 | 2011-03-21 10:11:24 -0400 | [diff] [blame] | 2465 | } |
| 2466 | |
Alexandre Oliva | 1bb9190 | 2011-10-14 12:10:36 -0300 | [diff] [blame] | 2467 | if (window_free < bytes || max_extent < cont1_bytes) |
| 2468 | return -ENOSPC; |
| 2469 | |
Josef Bacik | 4e69b59 | 2011-03-21 10:11:24 -0400 | [diff] [blame] | 2470 | cluster->window_start = first->offset; |
| 2471 | |
| 2472 | node = &first->offset_index; |
| 2473 | |
| 2474 | /* |
| 2475 | * now we've found our entries, pull them out of the free space |
| 2476 | * cache and put them into the cluster rbtree |
| 2477 | */ |
| 2478 | do { |
| 2479 | int ret; |
| 2480 | |
| 2481 | entry = rb_entry(node, struct btrfs_free_space, offset_index); |
| 2482 | node = rb_next(&entry->offset_index); |
Alexandre Oliva | 1bb9190 | 2011-10-14 12:10:36 -0300 | [diff] [blame] | 2483 | if (entry->bitmap || entry->bytes < min_bytes) |
Josef Bacik | 4e69b59 | 2011-03-21 10:11:24 -0400 | [diff] [blame] | 2484 | continue; |
| 2485 | |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 2486 | rb_erase(&entry->offset_index, &ctl->free_space_offset); |
Josef Bacik | 4e69b59 | 2011-03-21 10:11:24 -0400 | [diff] [blame] | 2487 | ret = tree_insert_offset(&cluster->root, entry->offset, |
| 2488 | &entry->offset_index, 0); |
Josef Bacik | 3f7de03 | 2011-11-10 08:29:20 -0500 | [diff] [blame] | 2489 | total_size += entry->bytes; |
Josef Bacik | b12d686 | 2013-08-26 17:14:08 -0400 | [diff] [blame] | 2490 | ASSERT(!ret); /* -EEXIST; Logic error */ |
Josef Bacik | 4e69b59 | 2011-03-21 10:11:24 -0400 | [diff] [blame] | 2491 | } while (node && entry != last); |
| 2492 | |
| 2493 | cluster->max_size = max_extent; |
Josef Bacik | 3f7de03 | 2011-11-10 08:29:20 -0500 | [diff] [blame] | 2494 | trace_btrfs_setup_cluster(block_group, cluster, total_size, 0); |
Josef Bacik | 4e69b59 | 2011-03-21 10:11:24 -0400 | [diff] [blame] | 2495 | return 0; |
| 2496 | } |
| 2497 | |
| 2498 | /* |
| 2499 | * This specifically looks for bitmaps that may work in the cluster, we assume |
| 2500 | * that we have already failed to find extents that will work. |
| 2501 | */ |
Josef Bacik | 3de85bb | 2011-05-25 13:07:37 -0400 | [diff] [blame] | 2502 | static noinline int |
| 2503 | setup_cluster_bitmap(struct btrfs_block_group_cache *block_group, |
| 2504 | struct btrfs_free_cluster *cluster, |
| 2505 | struct list_head *bitmaps, u64 offset, u64 bytes, |
Alexandre Oliva | 1bb9190 | 2011-10-14 12:10:36 -0300 | [diff] [blame] | 2506 | u64 cont1_bytes, u64 min_bytes) |
Josef Bacik | 4e69b59 | 2011-03-21 10:11:24 -0400 | [diff] [blame] | 2507 | { |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 2508 | struct btrfs_free_space_ctl *ctl = block_group->free_space_ctl; |
Josef Bacik | 4e69b59 | 2011-03-21 10:11:24 -0400 | [diff] [blame] | 2509 | struct btrfs_free_space *entry; |
Josef Bacik | 4e69b59 | 2011-03-21 10:11:24 -0400 | [diff] [blame] | 2510 | int ret = -ENOSPC; |
Li Zefan | 0f0fbf1 | 2011-11-20 07:33:38 -0500 | [diff] [blame] | 2511 | u64 bitmap_offset = offset_to_bitmap(ctl, offset); |
Josef Bacik | 4e69b59 | 2011-03-21 10:11:24 -0400 | [diff] [blame] | 2512 | |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 2513 | if (ctl->total_bitmaps == 0) |
Josef Bacik | 4e69b59 | 2011-03-21 10:11:24 -0400 | [diff] [blame] | 2514 | return -ENOSPC; |
| 2515 | |
Josef Bacik | 86d4a77 | 2011-05-25 13:03:16 -0400 | [diff] [blame] | 2516 | /* |
Li Zefan | 0f0fbf1 | 2011-11-20 07:33:38 -0500 | [diff] [blame] | 2517 | * The bitmap that covers offset won't be in the list unless offset |
| 2518 | * is just its start offset. |
| 2519 | */ |
| 2520 | entry = list_first_entry(bitmaps, struct btrfs_free_space, list); |
| 2521 | if (entry->offset != bitmap_offset) { |
| 2522 | entry = tree_search_offset(ctl, bitmap_offset, 1, 0); |
| 2523 | if (entry && list_empty(&entry->list)) |
| 2524 | list_add(&entry->list, bitmaps); |
| 2525 | } |
| 2526 | |
Josef Bacik | 86d4a77 | 2011-05-25 13:03:16 -0400 | [diff] [blame] | 2527 | list_for_each_entry(entry, bitmaps, list) { |
Josef Bacik | 357b978 | 2012-01-26 15:01:11 -0500 | [diff] [blame] | 2528 | if (entry->bytes < bytes) |
Josef Bacik | 86d4a77 | 2011-05-25 13:03:16 -0400 | [diff] [blame] | 2529 | continue; |
| 2530 | ret = btrfs_bitmap_cluster(block_group, entry, cluster, offset, |
Alexandre Oliva | 1bb9190 | 2011-10-14 12:10:36 -0300 | [diff] [blame] | 2531 | bytes, cont1_bytes, min_bytes); |
Josef Bacik | 86d4a77 | 2011-05-25 13:03:16 -0400 | [diff] [blame] | 2532 | if (!ret) |
| 2533 | return 0; |
| 2534 | } |
| 2535 | |
| 2536 | /* |
Li Zefan | 52621cb | 2011-11-20 07:33:38 -0500 | [diff] [blame] | 2537 | * The bitmaps list has all the bitmaps that record free space |
| 2538 | * starting after offset, so no more search is required. |
Josef Bacik | 86d4a77 | 2011-05-25 13:03:16 -0400 | [diff] [blame] | 2539 | */ |
Li Zefan | 52621cb | 2011-11-20 07:33:38 -0500 | [diff] [blame] | 2540 | return -ENOSPC; |
Josef Bacik | 4e69b59 | 2011-03-21 10:11:24 -0400 | [diff] [blame] | 2541 | } |
| 2542 | |
| 2543 | /* |
Chris Mason | fa9c0d79 | 2009-04-03 09:47:43 -0400 | [diff] [blame] | 2544 | * here we try to find a cluster of blocks in a block group. The goal |
Alexandre Oliva | 1bb9190 | 2011-10-14 12:10:36 -0300 | [diff] [blame] | 2545 | * is to find at least bytes+empty_size. |
Chris Mason | fa9c0d79 | 2009-04-03 09:47:43 -0400 | [diff] [blame] | 2546 | * We might not find them all in one contiguous area. |
| 2547 | * |
| 2548 | * returns zero and sets up cluster if things worked out, otherwise |
| 2549 | * it returns -enospc |
| 2550 | */ |
Josef Bacik | 0036158 | 2013-08-14 14:02:47 -0400 | [diff] [blame] | 2551 | int btrfs_find_space_cluster(struct btrfs_root *root, |
Chris Mason | fa9c0d79 | 2009-04-03 09:47:43 -0400 | [diff] [blame] | 2552 | struct btrfs_block_group_cache *block_group, |
| 2553 | struct btrfs_free_cluster *cluster, |
| 2554 | u64 offset, u64 bytes, u64 empty_size) |
| 2555 | { |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 2556 | struct btrfs_free_space_ctl *ctl = block_group->free_space_ctl; |
Josef Bacik | 86d4a77 | 2011-05-25 13:03:16 -0400 | [diff] [blame] | 2557 | struct btrfs_free_space *entry, *tmp; |
Li Zefan | 52621cb | 2011-11-20 07:33:38 -0500 | [diff] [blame] | 2558 | LIST_HEAD(bitmaps); |
Chris Mason | fa9c0d79 | 2009-04-03 09:47:43 -0400 | [diff] [blame] | 2559 | u64 min_bytes; |
Alexandre Oliva | 1bb9190 | 2011-10-14 12:10:36 -0300 | [diff] [blame] | 2560 | u64 cont1_bytes; |
Chris Mason | fa9c0d79 | 2009-04-03 09:47:43 -0400 | [diff] [blame] | 2561 | int ret; |
| 2562 | |
Alexandre Oliva | 1bb9190 | 2011-10-14 12:10:36 -0300 | [diff] [blame] | 2563 | /* |
| 2564 | * Choose the minimum extent size we'll require for this |
| 2565 | * cluster. For SSD_SPREAD, don't allow any fragmentation. |
| 2566 | * For metadata, allow allocates with smaller extents. For |
| 2567 | * data, keep it dense. |
| 2568 | */ |
Chris Mason | 451d758 | 2009-06-09 20:28:34 -0400 | [diff] [blame] | 2569 | if (btrfs_test_opt(root, SSD_SPREAD)) { |
Alexandre Oliva | 1bb9190 | 2011-10-14 12:10:36 -0300 | [diff] [blame] | 2570 | cont1_bytes = min_bytes = bytes + empty_size; |
Chris Mason | 451d758 | 2009-06-09 20:28:34 -0400 | [diff] [blame] | 2571 | } else if (block_group->flags & BTRFS_BLOCK_GROUP_METADATA) { |
Alexandre Oliva | 1bb9190 | 2011-10-14 12:10:36 -0300 | [diff] [blame] | 2572 | cont1_bytes = bytes; |
| 2573 | min_bytes = block_group->sectorsize; |
| 2574 | } else { |
| 2575 | cont1_bytes = max(bytes, (bytes + empty_size) >> 2); |
| 2576 | min_bytes = block_group->sectorsize; |
| 2577 | } |
Chris Mason | fa9c0d79 | 2009-04-03 09:47:43 -0400 | [diff] [blame] | 2578 | |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 2579 | spin_lock(&ctl->tree_lock); |
Josef Bacik | 7d0d2e8 | 2011-03-18 15:13:42 -0400 | [diff] [blame] | 2580 | |
| 2581 | /* |
| 2582 | * If we know we don't have enough space to make a cluster don't even |
| 2583 | * bother doing all the work to try and find one. |
| 2584 | */ |
Alexandre Oliva | 1bb9190 | 2011-10-14 12:10:36 -0300 | [diff] [blame] | 2585 | if (ctl->free_space < bytes) { |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 2586 | spin_unlock(&ctl->tree_lock); |
Josef Bacik | 7d0d2e8 | 2011-03-18 15:13:42 -0400 | [diff] [blame] | 2587 | return -ENOSPC; |
| 2588 | } |
| 2589 | |
Chris Mason | fa9c0d79 | 2009-04-03 09:47:43 -0400 | [diff] [blame] | 2590 | spin_lock(&cluster->lock); |
| 2591 | |
| 2592 | /* someone already found a cluster, hooray */ |
| 2593 | if (cluster->block_group) { |
| 2594 | ret = 0; |
| 2595 | goto out; |
| 2596 | } |
Josef Bacik | 4e69b59 | 2011-03-21 10:11:24 -0400 | [diff] [blame] | 2597 | |
Josef Bacik | 3f7de03 | 2011-11-10 08:29:20 -0500 | [diff] [blame] | 2598 | trace_btrfs_find_cluster(block_group, offset, bytes, empty_size, |
| 2599 | min_bytes); |
| 2600 | |
| 2601 | INIT_LIST_HEAD(&bitmaps); |
Josef Bacik | 86d4a77 | 2011-05-25 13:03:16 -0400 | [diff] [blame] | 2602 | ret = setup_cluster_no_bitmap(block_group, cluster, &bitmaps, offset, |
Alexandre Oliva | 1bb9190 | 2011-10-14 12:10:36 -0300 | [diff] [blame] | 2603 | bytes + empty_size, |
| 2604 | cont1_bytes, min_bytes); |
Josef Bacik | 4e69b59 | 2011-03-21 10:11:24 -0400 | [diff] [blame] | 2605 | if (ret) |
Josef Bacik | 86d4a77 | 2011-05-25 13:03:16 -0400 | [diff] [blame] | 2606 | ret = setup_cluster_bitmap(block_group, cluster, &bitmaps, |
Alexandre Oliva | 1bb9190 | 2011-10-14 12:10:36 -0300 | [diff] [blame] | 2607 | offset, bytes + empty_size, |
| 2608 | cont1_bytes, min_bytes); |
Josef Bacik | 86d4a77 | 2011-05-25 13:03:16 -0400 | [diff] [blame] | 2609 | |
| 2610 | /* Clear our temporary list */ |
| 2611 | list_for_each_entry_safe(entry, tmp, &bitmaps, list) |
| 2612 | list_del_init(&entry->list); |
Josef Bacik | 4e69b59 | 2011-03-21 10:11:24 -0400 | [diff] [blame] | 2613 | |
| 2614 | if (!ret) { |
| 2615 | atomic_inc(&block_group->count); |
| 2616 | list_add_tail(&cluster->block_group_list, |
| 2617 | &block_group->cluster_list); |
| 2618 | cluster->block_group = block_group; |
Josef Bacik | 3f7de03 | 2011-11-10 08:29:20 -0500 | [diff] [blame] | 2619 | } else { |
| 2620 | trace_btrfs_failed_cluster_setup(block_group); |
Chris Mason | fa9c0d79 | 2009-04-03 09:47:43 -0400 | [diff] [blame] | 2621 | } |
Chris Mason | fa9c0d79 | 2009-04-03 09:47:43 -0400 | [diff] [blame] | 2622 | out: |
| 2623 | spin_unlock(&cluster->lock); |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 2624 | spin_unlock(&ctl->tree_lock); |
Chris Mason | fa9c0d79 | 2009-04-03 09:47:43 -0400 | [diff] [blame] | 2625 | |
| 2626 | return ret; |
| 2627 | } |
| 2628 | |
| 2629 | /* |
| 2630 | * simple code to zero out a cluster |
| 2631 | */ |
| 2632 | void btrfs_init_free_cluster(struct btrfs_free_cluster *cluster) |
| 2633 | { |
| 2634 | spin_lock_init(&cluster->lock); |
| 2635 | spin_lock_init(&cluster->refill_lock); |
Eric Paris | 6bef4d3 | 2010-02-23 19:43:04 +0000 | [diff] [blame] | 2636 | cluster->root = RB_ROOT; |
Chris Mason | fa9c0d79 | 2009-04-03 09:47:43 -0400 | [diff] [blame] | 2637 | cluster->max_size = 0; |
| 2638 | INIT_LIST_HEAD(&cluster->block_group_list); |
| 2639 | cluster->block_group = NULL; |
| 2640 | } |
| 2641 | |
Li Zefan | 7fe1e64 | 2011-12-29 14:47:27 +0800 | [diff] [blame] | 2642 | static int do_trimming(struct btrfs_block_group_cache *block_group, |
| 2643 | u64 *total_trimmed, u64 start, u64 bytes, |
| 2644 | u64 reserved_start, u64 reserved_bytes) |
| 2645 | { |
| 2646 | struct btrfs_space_info *space_info = block_group->space_info; |
| 2647 | struct btrfs_fs_info *fs_info = block_group->fs_info; |
| 2648 | int ret; |
| 2649 | int update = 0; |
| 2650 | u64 trimmed = 0; |
| 2651 | |
| 2652 | spin_lock(&space_info->lock); |
| 2653 | spin_lock(&block_group->lock); |
| 2654 | if (!block_group->ro) { |
| 2655 | block_group->reserved += reserved_bytes; |
| 2656 | space_info->bytes_reserved += reserved_bytes; |
| 2657 | update = 1; |
| 2658 | } |
| 2659 | spin_unlock(&block_group->lock); |
| 2660 | spin_unlock(&space_info->lock); |
| 2661 | |
| 2662 | ret = btrfs_error_discard_extent(fs_info->extent_root, |
| 2663 | start, bytes, &trimmed); |
| 2664 | if (!ret) |
| 2665 | *total_trimmed += trimmed; |
| 2666 | |
| 2667 | btrfs_add_free_space(block_group, reserved_start, reserved_bytes); |
| 2668 | |
| 2669 | if (update) { |
| 2670 | spin_lock(&space_info->lock); |
| 2671 | spin_lock(&block_group->lock); |
| 2672 | if (block_group->ro) |
| 2673 | space_info->bytes_readonly += reserved_bytes; |
| 2674 | block_group->reserved -= reserved_bytes; |
| 2675 | space_info->bytes_reserved -= reserved_bytes; |
| 2676 | spin_unlock(&space_info->lock); |
| 2677 | spin_unlock(&block_group->lock); |
| 2678 | } |
| 2679 | |
| 2680 | return ret; |
| 2681 | } |
| 2682 | |
| 2683 | static int trim_no_bitmap(struct btrfs_block_group_cache *block_group, |
| 2684 | u64 *total_trimmed, u64 start, u64 end, u64 minlen) |
Li Dongyang | f7039b1 | 2011-03-24 10:24:28 +0000 | [diff] [blame] | 2685 | { |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 2686 | struct btrfs_free_space_ctl *ctl = block_group->free_space_ctl; |
Li Zefan | 7fe1e64 | 2011-12-29 14:47:27 +0800 | [diff] [blame] | 2687 | struct btrfs_free_space *entry; |
| 2688 | struct rb_node *node; |
Li Dongyang | f7039b1 | 2011-03-24 10:24:28 +0000 | [diff] [blame] | 2689 | int ret = 0; |
Li Zefan | 7fe1e64 | 2011-12-29 14:47:27 +0800 | [diff] [blame] | 2690 | u64 extent_start; |
| 2691 | u64 extent_bytes; |
| 2692 | u64 bytes; |
Li Dongyang | f7039b1 | 2011-03-24 10:24:28 +0000 | [diff] [blame] | 2693 | |
| 2694 | while (start < end) { |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 2695 | spin_lock(&ctl->tree_lock); |
Li Dongyang | f7039b1 | 2011-03-24 10:24:28 +0000 | [diff] [blame] | 2696 | |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 2697 | if (ctl->free_space < minlen) { |
| 2698 | spin_unlock(&ctl->tree_lock); |
Li Dongyang | f7039b1 | 2011-03-24 10:24:28 +0000 | [diff] [blame] | 2699 | break; |
| 2700 | } |
| 2701 | |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 2702 | entry = tree_search_offset(ctl, start, 0, 1); |
Li Zefan | 7fe1e64 | 2011-12-29 14:47:27 +0800 | [diff] [blame] | 2703 | if (!entry) { |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 2704 | spin_unlock(&ctl->tree_lock); |
Li Dongyang | f7039b1 | 2011-03-24 10:24:28 +0000 | [diff] [blame] | 2705 | break; |
| 2706 | } |
| 2707 | |
Li Zefan | 7fe1e64 | 2011-12-29 14:47:27 +0800 | [diff] [blame] | 2708 | /* skip bitmaps */ |
| 2709 | while (entry->bitmap) { |
| 2710 | node = rb_next(&entry->offset_index); |
| 2711 | if (!node) { |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 2712 | spin_unlock(&ctl->tree_lock); |
Li Zefan | 7fe1e64 | 2011-12-29 14:47:27 +0800 | [diff] [blame] | 2713 | goto out; |
Li Dongyang | f7039b1 | 2011-03-24 10:24:28 +0000 | [diff] [blame] | 2714 | } |
Li Zefan | 7fe1e64 | 2011-12-29 14:47:27 +0800 | [diff] [blame] | 2715 | entry = rb_entry(node, struct btrfs_free_space, |
| 2716 | offset_index); |
Li Dongyang | f7039b1 | 2011-03-24 10:24:28 +0000 | [diff] [blame] | 2717 | } |
| 2718 | |
Li Zefan | 7fe1e64 | 2011-12-29 14:47:27 +0800 | [diff] [blame] | 2719 | if (entry->offset >= end) { |
| 2720 | spin_unlock(&ctl->tree_lock); |
| 2721 | break; |
| 2722 | } |
| 2723 | |
| 2724 | extent_start = entry->offset; |
| 2725 | extent_bytes = entry->bytes; |
| 2726 | start = max(start, extent_start); |
| 2727 | bytes = min(extent_start + extent_bytes, end) - start; |
| 2728 | if (bytes < minlen) { |
| 2729 | spin_unlock(&ctl->tree_lock); |
| 2730 | goto next; |
| 2731 | } |
| 2732 | |
| 2733 | unlink_free_space(ctl, entry); |
| 2734 | kmem_cache_free(btrfs_free_space_cachep, entry); |
| 2735 | |
Li Zefan | 34d52cb | 2011-03-29 13:46:06 +0800 | [diff] [blame] | 2736 | spin_unlock(&ctl->tree_lock); |
Li Dongyang | f7039b1 | 2011-03-24 10:24:28 +0000 | [diff] [blame] | 2737 | |
Li Zefan | 7fe1e64 | 2011-12-29 14:47:27 +0800 | [diff] [blame] | 2738 | ret = do_trimming(block_group, total_trimmed, start, bytes, |
| 2739 | extent_start, extent_bytes); |
| 2740 | if (ret) |
| 2741 | break; |
| 2742 | next: |
Li Dongyang | f7039b1 | 2011-03-24 10:24:28 +0000 | [diff] [blame] | 2743 | start += bytes; |
Li Dongyang | f7039b1 | 2011-03-24 10:24:28 +0000 | [diff] [blame] | 2744 | |
| 2745 | if (fatal_signal_pending(current)) { |
| 2746 | ret = -ERESTARTSYS; |
| 2747 | break; |
| 2748 | } |
| 2749 | |
| 2750 | cond_resched(); |
| 2751 | } |
Li Zefan | 7fe1e64 | 2011-12-29 14:47:27 +0800 | [diff] [blame] | 2752 | out: |
| 2753 | return ret; |
| 2754 | } |
| 2755 | |
| 2756 | static int trim_bitmaps(struct btrfs_block_group_cache *block_group, |
| 2757 | u64 *total_trimmed, u64 start, u64 end, u64 minlen) |
| 2758 | { |
| 2759 | struct btrfs_free_space_ctl *ctl = block_group->free_space_ctl; |
| 2760 | struct btrfs_free_space *entry; |
| 2761 | int ret = 0; |
| 2762 | int ret2; |
| 2763 | u64 bytes; |
| 2764 | u64 offset = offset_to_bitmap(ctl, start); |
| 2765 | |
| 2766 | while (offset < end) { |
| 2767 | bool next_bitmap = false; |
| 2768 | |
| 2769 | spin_lock(&ctl->tree_lock); |
| 2770 | |
| 2771 | if (ctl->free_space < minlen) { |
| 2772 | spin_unlock(&ctl->tree_lock); |
| 2773 | break; |
| 2774 | } |
| 2775 | |
| 2776 | entry = tree_search_offset(ctl, offset, 1, 0); |
| 2777 | if (!entry) { |
| 2778 | spin_unlock(&ctl->tree_lock); |
| 2779 | next_bitmap = true; |
| 2780 | goto next; |
| 2781 | } |
| 2782 | |
| 2783 | bytes = minlen; |
| 2784 | ret2 = search_bitmap(ctl, entry, &start, &bytes); |
| 2785 | if (ret2 || start >= end) { |
| 2786 | spin_unlock(&ctl->tree_lock); |
| 2787 | next_bitmap = true; |
| 2788 | goto next; |
| 2789 | } |
| 2790 | |
| 2791 | bytes = min(bytes, end - start); |
| 2792 | if (bytes < minlen) { |
| 2793 | spin_unlock(&ctl->tree_lock); |
| 2794 | goto next; |
| 2795 | } |
| 2796 | |
| 2797 | bitmap_clear_bits(ctl, entry, start, bytes); |
| 2798 | if (entry->bytes == 0) |
| 2799 | free_bitmap(ctl, entry); |
| 2800 | |
| 2801 | spin_unlock(&ctl->tree_lock); |
| 2802 | |
| 2803 | ret = do_trimming(block_group, total_trimmed, start, bytes, |
| 2804 | start, bytes); |
| 2805 | if (ret) |
| 2806 | break; |
| 2807 | next: |
| 2808 | if (next_bitmap) { |
| 2809 | offset += BITS_PER_BITMAP * ctl->unit; |
| 2810 | } else { |
| 2811 | start += bytes; |
| 2812 | if (start >= offset + BITS_PER_BITMAP * ctl->unit) |
| 2813 | offset += BITS_PER_BITMAP * ctl->unit; |
| 2814 | } |
| 2815 | |
| 2816 | if (fatal_signal_pending(current)) { |
| 2817 | ret = -ERESTARTSYS; |
| 2818 | break; |
| 2819 | } |
| 2820 | |
| 2821 | cond_resched(); |
| 2822 | } |
| 2823 | |
| 2824 | return ret; |
| 2825 | } |
| 2826 | |
| 2827 | int btrfs_trim_block_group(struct btrfs_block_group_cache *block_group, |
| 2828 | u64 *trimmed, u64 start, u64 end, u64 minlen) |
| 2829 | { |
| 2830 | int ret; |
| 2831 | |
| 2832 | *trimmed = 0; |
| 2833 | |
| 2834 | ret = trim_no_bitmap(block_group, trimmed, start, end, minlen); |
| 2835 | if (ret) |
| 2836 | return ret; |
| 2837 | |
| 2838 | ret = trim_bitmaps(block_group, trimmed, start, end, minlen); |
Li Dongyang | f7039b1 | 2011-03-24 10:24:28 +0000 | [diff] [blame] | 2839 | |
| 2840 | return ret; |
| 2841 | } |
Li Zefan | 581bb05 | 2011-04-20 10:06:11 +0800 | [diff] [blame] | 2842 | |
| 2843 | /* |
| 2844 | * Find the left-most item in the cache tree, and then return the |
| 2845 | * smallest inode number in the item. |
| 2846 | * |
| 2847 | * Note: the returned inode number may not be the smallest one in |
| 2848 | * the tree, if the left-most item is a bitmap. |
| 2849 | */ |
| 2850 | u64 btrfs_find_ino_for_alloc(struct btrfs_root *fs_root) |
| 2851 | { |
| 2852 | struct btrfs_free_space_ctl *ctl = fs_root->free_ino_ctl; |
| 2853 | struct btrfs_free_space *entry = NULL; |
| 2854 | u64 ino = 0; |
| 2855 | |
| 2856 | spin_lock(&ctl->tree_lock); |
| 2857 | |
| 2858 | if (RB_EMPTY_ROOT(&ctl->free_space_offset)) |
| 2859 | goto out; |
| 2860 | |
| 2861 | entry = rb_entry(rb_first(&ctl->free_space_offset), |
| 2862 | struct btrfs_free_space, offset_index); |
| 2863 | |
| 2864 | if (!entry->bitmap) { |
| 2865 | ino = entry->offset; |
| 2866 | |
| 2867 | unlink_free_space(ctl, entry); |
| 2868 | entry->offset++; |
| 2869 | entry->bytes--; |
| 2870 | if (!entry->bytes) |
| 2871 | kmem_cache_free(btrfs_free_space_cachep, entry); |
| 2872 | else |
| 2873 | link_free_space(ctl, entry); |
| 2874 | } else { |
| 2875 | u64 offset = 0; |
| 2876 | u64 count = 1; |
| 2877 | int ret; |
| 2878 | |
| 2879 | ret = search_bitmap(ctl, entry, &offset, &count); |
Jeff Mahoney | 79787ea | 2012-03-12 16:03:00 +0100 | [diff] [blame] | 2880 | /* Logic error; Should be empty if it can't find anything */ |
Josef Bacik | b12d686 | 2013-08-26 17:14:08 -0400 | [diff] [blame] | 2881 | ASSERT(!ret); |
Li Zefan | 581bb05 | 2011-04-20 10:06:11 +0800 | [diff] [blame] | 2882 | |
| 2883 | ino = offset; |
| 2884 | bitmap_clear_bits(ctl, entry, offset, 1); |
| 2885 | if (entry->bytes == 0) |
| 2886 | free_bitmap(ctl, entry); |
| 2887 | } |
| 2888 | out: |
| 2889 | spin_unlock(&ctl->tree_lock); |
| 2890 | |
| 2891 | return ino; |
| 2892 | } |
Li Zefan | 82d5902 | 2011-04-20 10:33:24 +0800 | [diff] [blame] | 2893 | |
| 2894 | struct inode *lookup_free_ino_inode(struct btrfs_root *root, |
| 2895 | struct btrfs_path *path) |
| 2896 | { |
| 2897 | struct inode *inode = NULL; |
| 2898 | |
| 2899 | spin_lock(&root->cache_lock); |
| 2900 | if (root->cache_inode) |
| 2901 | inode = igrab(root->cache_inode); |
| 2902 | spin_unlock(&root->cache_lock); |
| 2903 | if (inode) |
| 2904 | return inode; |
| 2905 | |
| 2906 | inode = __lookup_free_space_inode(root, path, 0); |
| 2907 | if (IS_ERR(inode)) |
| 2908 | return inode; |
| 2909 | |
| 2910 | spin_lock(&root->cache_lock); |
David Sterba | 7841cb2 | 2011-05-31 18:07:27 +0200 | [diff] [blame] | 2911 | if (!btrfs_fs_closing(root->fs_info)) |
Li Zefan | 82d5902 | 2011-04-20 10:33:24 +0800 | [diff] [blame] | 2912 | root->cache_inode = igrab(inode); |
| 2913 | spin_unlock(&root->cache_lock); |
| 2914 | |
| 2915 | return inode; |
| 2916 | } |
| 2917 | |
| 2918 | int create_free_ino_inode(struct btrfs_root *root, |
| 2919 | struct btrfs_trans_handle *trans, |
| 2920 | struct btrfs_path *path) |
| 2921 | { |
| 2922 | return __create_free_space_inode(root, trans, path, |
| 2923 | BTRFS_FREE_INO_OBJECTID, 0); |
| 2924 | } |
| 2925 | |
| 2926 | int load_free_ino_cache(struct btrfs_fs_info *fs_info, struct btrfs_root *root) |
| 2927 | { |
| 2928 | struct btrfs_free_space_ctl *ctl = root->free_ino_ctl; |
| 2929 | struct btrfs_path *path; |
| 2930 | struct inode *inode; |
| 2931 | int ret = 0; |
| 2932 | u64 root_gen = btrfs_root_generation(&root->root_item); |
| 2933 | |
Chris Mason | 4b9465c | 2011-06-03 09:36:29 -0400 | [diff] [blame] | 2934 | if (!btrfs_test_opt(root, INODE_MAP_CACHE)) |
| 2935 | return 0; |
| 2936 | |
Li Zefan | 82d5902 | 2011-04-20 10:33:24 +0800 | [diff] [blame] | 2937 | /* |
| 2938 | * If we're unmounting then just return, since this does a search on the |
| 2939 | * normal root and not the commit root and we could deadlock. |
| 2940 | */ |
David Sterba | 7841cb2 | 2011-05-31 18:07:27 +0200 | [diff] [blame] | 2941 | if (btrfs_fs_closing(fs_info)) |
Li Zefan | 82d5902 | 2011-04-20 10:33:24 +0800 | [diff] [blame] | 2942 | return 0; |
| 2943 | |
| 2944 | path = btrfs_alloc_path(); |
| 2945 | if (!path) |
| 2946 | return 0; |
| 2947 | |
| 2948 | inode = lookup_free_ino_inode(root, path); |
| 2949 | if (IS_ERR(inode)) |
| 2950 | goto out; |
| 2951 | |
| 2952 | if (root_gen != BTRFS_I(inode)->generation) |
| 2953 | goto out_put; |
| 2954 | |
| 2955 | ret = __load_free_space_cache(root, inode, ctl, path, 0); |
| 2956 | |
| 2957 | if (ret < 0) |
Simon Kirby | c2cf52e | 2013-03-19 22:41:23 +0000 | [diff] [blame] | 2958 | btrfs_err(fs_info, |
| 2959 | "failed to load free ino cache for root %llu", |
| 2960 | root->root_key.objectid); |
Li Zefan | 82d5902 | 2011-04-20 10:33:24 +0800 | [diff] [blame] | 2961 | out_put: |
| 2962 | iput(inode); |
| 2963 | out: |
| 2964 | btrfs_free_path(path); |
| 2965 | return ret; |
| 2966 | } |
| 2967 | |
| 2968 | int btrfs_write_out_ino_cache(struct btrfs_root *root, |
| 2969 | struct btrfs_trans_handle *trans, |
| 2970 | struct btrfs_path *path) |
| 2971 | { |
| 2972 | struct btrfs_free_space_ctl *ctl = root->free_ino_ctl; |
| 2973 | struct inode *inode; |
| 2974 | int ret; |
| 2975 | |
Chris Mason | 4b9465c | 2011-06-03 09:36:29 -0400 | [diff] [blame] | 2976 | if (!btrfs_test_opt(root, INODE_MAP_CACHE)) |
| 2977 | return 0; |
| 2978 | |
Li Zefan | 82d5902 | 2011-04-20 10:33:24 +0800 | [diff] [blame] | 2979 | inode = lookup_free_ino_inode(root, path); |
| 2980 | if (IS_ERR(inode)) |
| 2981 | return 0; |
| 2982 | |
| 2983 | ret = __btrfs_write_out_cache(root, inode, ctl, NULL, trans, path, 0); |
Josef Bacik | c09544e | 2011-08-30 10:19:10 -0400 | [diff] [blame] | 2984 | if (ret) { |
| 2985 | btrfs_delalloc_release_metadata(inode, inode->i_size); |
| 2986 | #ifdef DEBUG |
Simon Kirby | c2cf52e | 2013-03-19 22:41:23 +0000 | [diff] [blame] | 2987 | btrfs_err(root->fs_info, |
| 2988 | "failed to write free ino cache for root %llu", |
| 2989 | root->root_key.objectid); |
Josef Bacik | c09544e | 2011-08-30 10:19:10 -0400 | [diff] [blame] | 2990 | #endif |
| 2991 | } |
Li Zefan | 82d5902 | 2011-04-20 10:33:24 +0800 | [diff] [blame] | 2992 | |
| 2993 | iput(inode); |
| 2994 | return ret; |
| 2995 | } |
Josef Bacik | 74255aa | 2013-03-15 09:47:08 -0400 | [diff] [blame] | 2996 | |
| 2997 | #ifdef CONFIG_BTRFS_FS_RUN_SANITY_TESTS |
Josef Bacik | dc11dd5d | 2013-08-14 15:05:12 -0400 | [diff] [blame] | 2998 | /* |
| 2999 | * Use this if you need to make a bitmap or extent entry specifically, it |
| 3000 | * doesn't do any of the merging that add_free_space does, this acts a lot like |
| 3001 | * how the free space cache loading stuff works, so you can get really weird |
| 3002 | * configurations. |
| 3003 | */ |
| 3004 | int test_add_free_space_entry(struct btrfs_block_group_cache *cache, |
| 3005 | u64 offset, u64 bytes, bool bitmap) |
Josef Bacik | 74255aa | 2013-03-15 09:47:08 -0400 | [diff] [blame] | 3006 | { |
Josef Bacik | dc11dd5d | 2013-08-14 15:05:12 -0400 | [diff] [blame] | 3007 | struct btrfs_free_space_ctl *ctl = cache->free_space_ctl; |
| 3008 | struct btrfs_free_space *info = NULL, *bitmap_info; |
| 3009 | void *map = NULL; |
| 3010 | u64 bytes_added; |
| 3011 | int ret; |
Josef Bacik | 74255aa | 2013-03-15 09:47:08 -0400 | [diff] [blame] | 3012 | |
Josef Bacik | dc11dd5d | 2013-08-14 15:05:12 -0400 | [diff] [blame] | 3013 | again: |
| 3014 | if (!info) { |
| 3015 | info = kmem_cache_zalloc(btrfs_free_space_cachep, GFP_NOFS); |
| 3016 | if (!info) |
| 3017 | return -ENOMEM; |
Josef Bacik | 74255aa | 2013-03-15 09:47:08 -0400 | [diff] [blame] | 3018 | } |
| 3019 | |
Josef Bacik | dc11dd5d | 2013-08-14 15:05:12 -0400 | [diff] [blame] | 3020 | if (!bitmap) { |
| 3021 | spin_lock(&ctl->tree_lock); |
| 3022 | info->offset = offset; |
| 3023 | info->bytes = bytes; |
| 3024 | ret = link_free_space(ctl, info); |
| 3025 | spin_unlock(&ctl->tree_lock); |
| 3026 | if (ret) |
| 3027 | kmem_cache_free(btrfs_free_space_cachep, info); |
| 3028 | return ret; |
| 3029 | } |
Josef Bacik | 74255aa | 2013-03-15 09:47:08 -0400 | [diff] [blame] | 3030 | |
Josef Bacik | dc11dd5d | 2013-08-14 15:05:12 -0400 | [diff] [blame] | 3031 | if (!map) { |
| 3032 | map = kzalloc(PAGE_CACHE_SIZE, GFP_NOFS); |
| 3033 | if (!map) { |
| 3034 | kmem_cache_free(btrfs_free_space_cachep, info); |
| 3035 | return -ENOMEM; |
| 3036 | } |
| 3037 | } |
Josef Bacik | 74255aa | 2013-03-15 09:47:08 -0400 | [diff] [blame] | 3038 | |
Josef Bacik | dc11dd5d | 2013-08-14 15:05:12 -0400 | [diff] [blame] | 3039 | spin_lock(&ctl->tree_lock); |
| 3040 | bitmap_info = tree_search_offset(ctl, offset_to_bitmap(ctl, offset), |
| 3041 | 1, 0); |
| 3042 | if (!bitmap_info) { |
| 3043 | info->bitmap = map; |
| 3044 | map = NULL; |
| 3045 | add_new_bitmap(ctl, info, offset); |
| 3046 | bitmap_info = info; |
| 3047 | } |
Josef Bacik | 74255aa | 2013-03-15 09:47:08 -0400 | [diff] [blame] | 3048 | |
Josef Bacik | dc11dd5d | 2013-08-14 15:05:12 -0400 | [diff] [blame] | 3049 | bytes_added = add_bytes_to_bitmap(ctl, bitmap_info, offset, bytes); |
| 3050 | bytes -= bytes_added; |
| 3051 | offset += bytes_added; |
| 3052 | spin_unlock(&ctl->tree_lock); |
| 3053 | |
| 3054 | if (bytes) |
| 3055 | goto again; |
| 3056 | |
| 3057 | if (map) |
| 3058 | kfree(map); |
| 3059 | return 0; |
Josef Bacik | 74255aa | 2013-03-15 09:47:08 -0400 | [diff] [blame] | 3060 | } |
| 3061 | |
| 3062 | /* |
| 3063 | * Checks to see if the given range is in the free space cache. This is really |
| 3064 | * just used to check the absence of space, so if there is free space in the |
| 3065 | * range at all we will return 1. |
| 3066 | */ |
Josef Bacik | dc11dd5d | 2013-08-14 15:05:12 -0400 | [diff] [blame] | 3067 | int test_check_exists(struct btrfs_block_group_cache *cache, |
| 3068 | u64 offset, u64 bytes) |
Josef Bacik | 74255aa | 2013-03-15 09:47:08 -0400 | [diff] [blame] | 3069 | { |
| 3070 | struct btrfs_free_space_ctl *ctl = cache->free_space_ctl; |
| 3071 | struct btrfs_free_space *info; |
| 3072 | int ret = 0; |
| 3073 | |
| 3074 | spin_lock(&ctl->tree_lock); |
| 3075 | info = tree_search_offset(ctl, offset, 0, 0); |
| 3076 | if (!info) { |
| 3077 | info = tree_search_offset(ctl, offset_to_bitmap(ctl, offset), |
| 3078 | 1, 0); |
| 3079 | if (!info) |
| 3080 | goto out; |
| 3081 | } |
| 3082 | |
| 3083 | have_info: |
| 3084 | if (info->bitmap) { |
| 3085 | u64 bit_off, bit_bytes; |
| 3086 | struct rb_node *n; |
| 3087 | struct btrfs_free_space *tmp; |
| 3088 | |
| 3089 | bit_off = offset; |
| 3090 | bit_bytes = ctl->unit; |
| 3091 | ret = search_bitmap(ctl, info, &bit_off, &bit_bytes); |
| 3092 | if (!ret) { |
| 3093 | if (bit_off == offset) { |
| 3094 | ret = 1; |
| 3095 | goto out; |
| 3096 | } else if (bit_off > offset && |
| 3097 | offset + bytes > bit_off) { |
| 3098 | ret = 1; |
| 3099 | goto out; |
| 3100 | } |
| 3101 | } |
| 3102 | |
| 3103 | n = rb_prev(&info->offset_index); |
| 3104 | while (n) { |
| 3105 | tmp = rb_entry(n, struct btrfs_free_space, |
| 3106 | offset_index); |
| 3107 | if (tmp->offset + tmp->bytes < offset) |
| 3108 | break; |
| 3109 | if (offset + bytes < tmp->offset) { |
| 3110 | n = rb_prev(&info->offset_index); |
| 3111 | continue; |
| 3112 | } |
| 3113 | info = tmp; |
| 3114 | goto have_info; |
| 3115 | } |
| 3116 | |
| 3117 | n = rb_next(&info->offset_index); |
| 3118 | while (n) { |
| 3119 | tmp = rb_entry(n, struct btrfs_free_space, |
| 3120 | offset_index); |
| 3121 | if (offset + bytes < tmp->offset) |
| 3122 | break; |
| 3123 | if (tmp->offset + tmp->bytes < offset) { |
| 3124 | n = rb_next(&info->offset_index); |
| 3125 | continue; |
| 3126 | } |
| 3127 | info = tmp; |
| 3128 | goto have_info; |
| 3129 | } |
| 3130 | |
| 3131 | goto out; |
| 3132 | } |
| 3133 | |
| 3134 | if (info->offset == offset) { |
| 3135 | ret = 1; |
| 3136 | goto out; |
| 3137 | } |
| 3138 | |
| 3139 | if (offset > info->offset && offset < info->offset + info->bytes) |
| 3140 | ret = 1; |
| 3141 | out: |
| 3142 | spin_unlock(&ctl->tree_lock); |
| 3143 | return ret; |
| 3144 | } |
Josef Bacik | dc11dd5d | 2013-08-14 15:05:12 -0400 | [diff] [blame] | 3145 | #endif /* CONFIG_BTRFS_FS_RUN_SANITY_TESTS */ |