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