Commit | Line | Data |
---|---|---|
6cbd5570 CM |
1 | /* |
2 | * Copyright (C) 2007 Oracle. 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 | */ | |
ec6b910f | 18 | #include <linux/sched.h> |
edbd8d4e | 19 | #include <linux/pagemap.h> |
ec44a35c | 20 | #include <linux/writeback.h> |
21af804c | 21 | #include <linux/blkdev.h> |
74493f7a | 22 | #include "hash.h" |
a5eb62e3 | 23 | #include "crc32c.h" |
fec577fb CM |
24 | #include "ctree.h" |
25 | #include "disk-io.h" | |
26 | #include "print-tree.h" | |
e089f05c | 27 | #include "transaction.h" |
0b86a832 | 28 | #include "volumes.h" |
925baedd | 29 | #include "locking.h" |
31153d81 | 30 | #include "ref-cache.h" |
fec577fb | 31 | |
0b86a832 | 32 | #define BLOCK_GROUP_DATA EXTENT_WRITEBACK |
96b5179d | 33 | #define BLOCK_GROUP_METADATA EXTENT_UPTODATE |
0b86a832 CM |
34 | #define BLOCK_GROUP_SYSTEM EXTENT_NEW |
35 | ||
96b5179d CM |
36 | #define BLOCK_GROUP_DIRTY EXTENT_DIRTY |
37 | ||
e089f05c CM |
38 | static int finish_current_insert(struct btrfs_trans_handle *trans, struct |
39 | btrfs_root *extent_root); | |
e20d96d6 CM |
40 | static int del_pending_extents(struct btrfs_trans_handle *trans, struct |
41 | btrfs_root *extent_root); | |
925baedd CM |
42 | static struct btrfs_block_group_cache * |
43 | __btrfs_find_block_group(struct btrfs_root *root, | |
44 | struct btrfs_block_group_cache *hint, | |
45 | u64 search_start, int data, int owner); | |
d548ee51 | 46 | |
925baedd CM |
47 | void maybe_lock_mutex(struct btrfs_root *root) |
48 | { | |
49 | if (root != root->fs_info->extent_root && | |
50 | root != root->fs_info->chunk_root && | |
51 | root != root->fs_info->dev_root) { | |
52 | mutex_lock(&root->fs_info->alloc_mutex); | |
53 | } | |
54 | } | |
55 | ||
56 | void maybe_unlock_mutex(struct btrfs_root *root) | |
57 | { | |
58 | if (root != root->fs_info->extent_root && | |
59 | root != root->fs_info->chunk_root && | |
60 | root != root->fs_info->dev_root) { | |
61 | mutex_unlock(&root->fs_info->alloc_mutex); | |
62 | } | |
63 | } | |
fec577fb | 64 | |
e37c9e69 CM |
65 | static int cache_block_group(struct btrfs_root *root, |
66 | struct btrfs_block_group_cache *block_group) | |
67 | { | |
68 | struct btrfs_path *path; | |
69 | int ret; | |
70 | struct btrfs_key key; | |
5f39d397 | 71 | struct extent_buffer *leaf; |
d1310b2e | 72 | struct extent_io_tree *free_space_cache; |
e37c9e69 | 73 | int slot; |
e37c9e69 CM |
74 | u64 last = 0; |
75 | u64 hole_size; | |
7d7d6068 | 76 | u64 first_free; |
e37c9e69 CM |
77 | int found = 0; |
78 | ||
00f5c795 CM |
79 | if (!block_group) |
80 | return 0; | |
81 | ||
e37c9e69 | 82 | root = root->fs_info->extent_root; |
f510cfec | 83 | free_space_cache = &root->fs_info->free_space_cache; |
e37c9e69 CM |
84 | |
85 | if (block_group->cached) | |
86 | return 0; | |
f510cfec | 87 | |
e37c9e69 CM |
88 | path = btrfs_alloc_path(); |
89 | if (!path) | |
90 | return -ENOMEM; | |
7d7d6068 | 91 | |
2cc58cf2 | 92 | path->reada = 2; |
5cd57b2c CM |
93 | /* |
94 | * we get into deadlocks with paths held by callers of this function. | |
95 | * since the alloc_mutex is protecting things right now, just | |
96 | * skip the locking here | |
97 | */ | |
98 | path->skip_locking = 1; | |
7d7d6068 | 99 | first_free = block_group->key.objectid; |
e37c9e69 | 100 | key.objectid = block_group->key.objectid; |
e37c9e69 CM |
101 | key.offset = 0; |
102 | btrfs_set_key_type(&key, BTRFS_EXTENT_ITEM_KEY); | |
103 | ret = btrfs_search_slot(NULL, root, &key, path, 0, 0); | |
104 | if (ret < 0) | |
105 | return ret; | |
0b86a832 | 106 | ret = btrfs_previous_item(root, path, 0, BTRFS_EXTENT_ITEM_KEY); |
d548ee51 Y |
107 | if (ret < 0) |
108 | return ret; | |
109 | if (ret == 0) { | |
110 | leaf = path->nodes[0]; | |
111 | btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); | |
112 | if (key.objectid + key.offset > first_free) | |
113 | first_free = key.objectid + key.offset; | |
114 | } | |
e37c9e69 | 115 | while(1) { |
5f39d397 | 116 | leaf = path->nodes[0]; |
e37c9e69 | 117 | slot = path->slots[0]; |
5f39d397 | 118 | if (slot >= btrfs_header_nritems(leaf)) { |
e37c9e69 | 119 | ret = btrfs_next_leaf(root, path); |
54aa1f4d CM |
120 | if (ret < 0) |
121 | goto err; | |
de428b63 | 122 | if (ret == 0) { |
e37c9e69 | 123 | continue; |
de428b63 | 124 | } else { |
e37c9e69 CM |
125 | break; |
126 | } | |
127 | } | |
5f39d397 | 128 | btrfs_item_key_to_cpu(leaf, &key, slot); |
7d7d6068 | 129 | if (key.objectid < block_group->key.objectid) { |
7d7d6068 Y |
130 | goto next; |
131 | } | |
e37c9e69 CM |
132 | if (key.objectid >= block_group->key.objectid + |
133 | block_group->key.offset) { | |
e37c9e69 CM |
134 | break; |
135 | } | |
7d7d6068 | 136 | |
e37c9e69 CM |
137 | if (btrfs_key_type(&key) == BTRFS_EXTENT_ITEM_KEY) { |
138 | if (!found) { | |
7d7d6068 | 139 | last = first_free; |
e37c9e69 | 140 | found = 1; |
e37c9e69 | 141 | } |
f510cfec CM |
142 | if (key.objectid > last) { |
143 | hole_size = key.objectid - last; | |
144 | set_extent_dirty(free_space_cache, last, | |
145 | last + hole_size - 1, | |
146 | GFP_NOFS); | |
7d7d6068 Y |
147 | } |
148 | last = key.objectid + key.offset; | |
e37c9e69 | 149 | } |
7d7d6068 | 150 | next: |
e37c9e69 CM |
151 | path->slots[0]++; |
152 | } | |
153 | ||
7d7d6068 Y |
154 | if (!found) |
155 | last = first_free; | |
156 | if (block_group->key.objectid + | |
157 | block_group->key.offset > last) { | |
158 | hole_size = block_group->key.objectid + | |
159 | block_group->key.offset - last; | |
f510cfec CM |
160 | set_extent_dirty(free_space_cache, last, |
161 | last + hole_size - 1, GFP_NOFS); | |
7d7d6068 | 162 | } |
e37c9e69 | 163 | block_group->cached = 1; |
54aa1f4d | 164 | err: |
e37c9e69 CM |
165 | btrfs_free_path(path); |
166 | return 0; | |
167 | } | |
168 | ||
0ef3e66b CM |
169 | struct btrfs_block_group_cache *btrfs_lookup_first_block_group(struct |
170 | btrfs_fs_info *info, | |
171 | u64 bytenr) | |
172 | { | |
173 | struct extent_io_tree *block_group_cache; | |
174 | struct btrfs_block_group_cache *block_group = NULL; | |
175 | u64 ptr; | |
176 | u64 start; | |
177 | u64 end; | |
178 | int ret; | |
179 | ||
180 | bytenr = max_t(u64, bytenr, | |
181 | BTRFS_SUPER_INFO_OFFSET + BTRFS_SUPER_INFO_SIZE); | |
182 | block_group_cache = &info->block_group_cache; | |
183 | ret = find_first_extent_bit(block_group_cache, | |
184 | bytenr, &start, &end, | |
185 | BLOCK_GROUP_DATA | BLOCK_GROUP_METADATA | | |
186 | BLOCK_GROUP_SYSTEM); | |
187 | if (ret) { | |
188 | return NULL; | |
189 | } | |
190 | ret = get_state_private(block_group_cache, start, &ptr); | |
191 | if (ret) | |
192 | return NULL; | |
193 | ||
194 | block_group = (struct btrfs_block_group_cache *)(unsigned long)ptr; | |
195 | return block_group; | |
196 | } | |
197 | ||
5276aeda CM |
198 | struct btrfs_block_group_cache *btrfs_lookup_block_group(struct |
199 | btrfs_fs_info *info, | |
db94535d | 200 | u64 bytenr) |
be744175 | 201 | { |
d1310b2e | 202 | struct extent_io_tree *block_group_cache; |
96b5179d CM |
203 | struct btrfs_block_group_cache *block_group = NULL; |
204 | u64 ptr; | |
205 | u64 start; | |
206 | u64 end; | |
be744175 CM |
207 | int ret; |
208 | ||
a061fc8d CM |
209 | bytenr = max_t(u64, bytenr, |
210 | BTRFS_SUPER_INFO_OFFSET + BTRFS_SUPER_INFO_SIZE); | |
96b5179d CM |
211 | block_group_cache = &info->block_group_cache; |
212 | ret = find_first_extent_bit(block_group_cache, | |
db94535d | 213 | bytenr, &start, &end, |
0b86a832 CM |
214 | BLOCK_GROUP_DATA | BLOCK_GROUP_METADATA | |
215 | BLOCK_GROUP_SYSTEM); | |
be744175 | 216 | if (ret) { |
96b5179d | 217 | return NULL; |
be744175 | 218 | } |
96b5179d CM |
219 | ret = get_state_private(block_group_cache, start, &ptr); |
220 | if (ret) | |
221 | return NULL; | |
222 | ||
ae2f5411 | 223 | block_group = (struct btrfs_block_group_cache *)(unsigned long)ptr; |
5cf66426 | 224 | if (block_group->key.objectid <= bytenr && bytenr < |
96b5179d CM |
225 | block_group->key.objectid + block_group->key.offset) |
226 | return block_group; | |
be744175 CM |
227 | return NULL; |
228 | } | |
0b86a832 CM |
229 | |
230 | static int block_group_bits(struct btrfs_block_group_cache *cache, u64 bits) | |
231 | { | |
593060d7 | 232 | return (cache->flags & bits) == bits; |
0b86a832 CM |
233 | } |
234 | ||
235 | static int noinline find_search_start(struct btrfs_root *root, | |
98ed5174 | 236 | struct btrfs_block_group_cache **cache_ret, |
0ef3e66b | 237 | u64 *start_ret, u64 num, int data) |
e37c9e69 | 238 | { |
e37c9e69 CM |
239 | int ret; |
240 | struct btrfs_block_group_cache *cache = *cache_ret; | |
d7fc640e | 241 | struct extent_io_tree *free_space_cache; |
7d1660d4 | 242 | struct extent_state *state; |
e19caa5f | 243 | u64 last; |
f510cfec | 244 | u64 start = 0; |
257d0ce3 | 245 | u64 cache_miss = 0; |
c31f8830 | 246 | u64 total_fs_bytes; |
0b86a832 | 247 | u64 search_start = *start_ret; |
f84a8b36 | 248 | int wrapped = 0; |
e37c9e69 | 249 | |
7d9eb12c | 250 | WARN_ON(!mutex_is_locked(&root->fs_info->alloc_mutex)); |
c31f8830 | 251 | total_fs_bytes = btrfs_super_total_bytes(&root->fs_info->super_copy); |
d7fc640e CM |
252 | free_space_cache = &root->fs_info->free_space_cache; |
253 | ||
0ef3e66b CM |
254 | if (!cache) |
255 | goto out; | |
256 | ||
e37c9e69 | 257 | again: |
54aa1f4d | 258 | ret = cache_block_group(root, cache); |
0ef3e66b | 259 | if (ret) { |
54aa1f4d | 260 | goto out; |
0ef3e66b | 261 | } |
f84a8b36 | 262 | |
e19caa5f | 263 | last = max(search_start, cache->key.objectid); |
0ef3e66b | 264 | if (!block_group_bits(cache, data) || cache->ro) |
0b86a832 | 265 | goto new_group; |
e19caa5f | 266 | |
7d1660d4 CM |
267 | spin_lock_irq(&free_space_cache->lock); |
268 | state = find_first_extent_bit_state(free_space_cache, last, EXTENT_DIRTY); | |
e37c9e69 | 269 | while(1) { |
7d1660d4 | 270 | if (!state) { |
257d0ce3 CM |
271 | if (!cache_miss) |
272 | cache_miss = last; | |
7d1660d4 | 273 | spin_unlock_irq(&free_space_cache->lock); |
e19caa5f CM |
274 | goto new_group; |
275 | } | |
f510cfec | 276 | |
7d1660d4 CM |
277 | start = max(last, state->start); |
278 | last = state->end + 1; | |
257d0ce3 | 279 | if (last - start < num) { |
7d1660d4 CM |
280 | do { |
281 | state = extent_state_next(state); | |
282 | } while(state && !(state->state & EXTENT_DIRTY)); | |
f510cfec | 283 | continue; |
257d0ce3 | 284 | } |
7d1660d4 | 285 | spin_unlock_irq(&free_space_cache->lock); |
0ef3e66b | 286 | if (cache->ro) { |
8f18cf13 | 287 | goto new_group; |
0ef3e66b | 288 | } |
0b86a832 | 289 | if (start + num > cache->key.objectid + cache->key.offset) |
e37c9e69 | 290 | goto new_group; |
8790d502 | 291 | if (!block_group_bits(cache, data)) { |
611f0e00 | 292 | printk("block group bits don't match %Lu %d\n", cache->flags, data); |
8790d502 | 293 | } |
0b86a832 CM |
294 | *start_ret = start; |
295 | return 0; | |
8790d502 CM |
296 | } |
297 | out: | |
1a2b2ac7 CM |
298 | cache = btrfs_lookup_block_group(root->fs_info, search_start); |
299 | if (!cache) { | |
0b86a832 | 300 | printk("Unable to find block group for %Lu\n", search_start); |
1a2b2ac7 | 301 | WARN_ON(1); |
1a2b2ac7 | 302 | } |
0b86a832 | 303 | return -ENOSPC; |
e37c9e69 CM |
304 | |
305 | new_group: | |
e19caa5f | 306 | last = cache->key.objectid + cache->key.offset; |
f84a8b36 | 307 | wrapped: |
0ef3e66b | 308 | cache = btrfs_lookup_first_block_group(root->fs_info, last); |
c31f8830 | 309 | if (!cache || cache->key.objectid >= total_fs_bytes) { |
0e4de584 | 310 | no_cache: |
f84a8b36 CM |
311 | if (!wrapped) { |
312 | wrapped = 1; | |
313 | last = search_start; | |
f84a8b36 CM |
314 | goto wrapped; |
315 | } | |
1a2b2ac7 | 316 | goto out; |
e37c9e69 | 317 | } |
257d0ce3 CM |
318 | if (cache_miss && !cache->cached) { |
319 | cache_block_group(root, cache); | |
320 | last = cache_miss; | |
0ef3e66b | 321 | cache = btrfs_lookup_first_block_group(root->fs_info, last); |
257d0ce3 | 322 | } |
0ef3e66b | 323 | cache_miss = 0; |
c286ac48 | 324 | cache = btrfs_find_block_group(root, cache, last, data, 0); |
0e4de584 CM |
325 | if (!cache) |
326 | goto no_cache; | |
e37c9e69 CM |
327 | *cache_ret = cache; |
328 | goto again; | |
329 | } | |
330 | ||
84f54cfa CM |
331 | static u64 div_factor(u64 num, int factor) |
332 | { | |
257d0ce3 CM |
333 | if (factor == 10) |
334 | return num; | |
84f54cfa CM |
335 | num *= factor; |
336 | do_div(num, 10); | |
337 | return num; | |
338 | } | |
339 | ||
6324fbf3 CM |
340 | static int block_group_state_bits(u64 flags) |
341 | { | |
342 | int bits = 0; | |
343 | if (flags & BTRFS_BLOCK_GROUP_DATA) | |
344 | bits |= BLOCK_GROUP_DATA; | |
345 | if (flags & BTRFS_BLOCK_GROUP_METADATA) | |
346 | bits |= BLOCK_GROUP_METADATA; | |
347 | if (flags & BTRFS_BLOCK_GROUP_SYSTEM) | |
348 | bits |= BLOCK_GROUP_SYSTEM; | |
349 | return bits; | |
350 | } | |
351 | ||
925baedd CM |
352 | static struct btrfs_block_group_cache * |
353 | __btrfs_find_block_group(struct btrfs_root *root, | |
354 | struct btrfs_block_group_cache *hint, | |
355 | u64 search_start, int data, int owner) | |
cd1bc465 | 356 | { |
96b5179d | 357 | struct btrfs_block_group_cache *cache; |
d1310b2e | 358 | struct extent_io_tree *block_group_cache; |
31f3c99b | 359 | struct btrfs_block_group_cache *found_group = NULL; |
cd1bc465 CM |
360 | struct btrfs_fs_info *info = root->fs_info; |
361 | u64 used; | |
31f3c99b | 362 | u64 last = 0; |
96b5179d CM |
363 | u64 start; |
364 | u64 end; | |
365 | u64 free_check; | |
366 | u64 ptr; | |
367 | int bit; | |
cd1bc465 | 368 | int ret; |
31f3c99b | 369 | int full_search = 0; |
bce4eae9 | 370 | int factor = 10; |
0ef3e66b | 371 | int wrapped = 0; |
de428b63 | 372 | |
96b5179d CM |
373 | block_group_cache = &info->block_group_cache; |
374 | ||
a236aed1 CM |
375 | if (data & BTRFS_BLOCK_GROUP_METADATA) |
376 | factor = 9; | |
be744175 | 377 | |
6324fbf3 | 378 | bit = block_group_state_bits(data); |
be744175 | 379 | |
0ef3e66b | 380 | if (search_start) { |
be744175 | 381 | struct btrfs_block_group_cache *shint; |
0ef3e66b | 382 | shint = btrfs_lookup_first_block_group(info, search_start); |
8f18cf13 | 383 | if (shint && block_group_bits(shint, data) && !shint->ro) { |
c286ac48 | 384 | spin_lock(&shint->lock); |
be744175 | 385 | used = btrfs_block_group_used(&shint->item); |
324ae4df Y |
386 | if (used + shint->pinned < |
387 | div_factor(shint->key.offset, factor)) { | |
c286ac48 | 388 | spin_unlock(&shint->lock); |
be744175 CM |
389 | return shint; |
390 | } | |
c286ac48 | 391 | spin_unlock(&shint->lock); |
be744175 CM |
392 | } |
393 | } | |
0ef3e66b | 394 | if (hint && !hint->ro && block_group_bits(hint, data)) { |
c286ac48 | 395 | spin_lock(&hint->lock); |
31f3c99b | 396 | used = btrfs_block_group_used(&hint->item); |
324ae4df Y |
397 | if (used + hint->pinned < |
398 | div_factor(hint->key.offset, factor)) { | |
c286ac48 | 399 | spin_unlock(&hint->lock); |
31f3c99b CM |
400 | return hint; |
401 | } | |
c286ac48 | 402 | spin_unlock(&hint->lock); |
e19caa5f | 403 | last = hint->key.objectid + hint->key.offset; |
31f3c99b | 404 | } else { |
e37c9e69 | 405 | if (hint) |
0ef3e66b | 406 | last = max(hint->key.objectid, search_start); |
e37c9e69 | 407 | else |
0ef3e66b | 408 | last = search_start; |
31f3c99b | 409 | } |
31f3c99b | 410 | again: |
cd1bc465 | 411 | while(1) { |
96b5179d CM |
412 | ret = find_first_extent_bit(block_group_cache, last, |
413 | &start, &end, bit); | |
414 | if (ret) | |
cd1bc465 | 415 | break; |
96b5179d CM |
416 | |
417 | ret = get_state_private(block_group_cache, start, &ptr); | |
0ef3e66b CM |
418 | if (ret) { |
419 | last = end + 1; | |
420 | continue; | |
421 | } | |
96b5179d | 422 | |
ae2f5411 | 423 | cache = (struct btrfs_block_group_cache *)(unsigned long)ptr; |
c286ac48 | 424 | spin_lock(&cache->lock); |
96b5179d CM |
425 | last = cache->key.objectid + cache->key.offset; |
426 | used = btrfs_block_group_used(&cache->item); | |
427 | ||
8f18cf13 | 428 | if (!cache->ro && block_group_bits(cache, data)) { |
0ef3e66b | 429 | free_check = div_factor(cache->key.offset, factor); |
8790d502 CM |
430 | if (used + cache->pinned < free_check) { |
431 | found_group = cache; | |
c286ac48 | 432 | spin_unlock(&cache->lock); |
8790d502 CM |
433 | goto found; |
434 | } | |
6324fbf3 | 435 | } |
c286ac48 | 436 | spin_unlock(&cache->lock); |
de428b63 | 437 | cond_resched(); |
cd1bc465 | 438 | } |
0ef3e66b CM |
439 | if (!wrapped) { |
440 | last = search_start; | |
441 | wrapped = 1; | |
442 | goto again; | |
443 | } | |
444 | if (!full_search && factor < 10) { | |
be744175 | 445 | last = search_start; |
31f3c99b | 446 | full_search = 1; |
0ef3e66b | 447 | factor = 10; |
31f3c99b CM |
448 | goto again; |
449 | } | |
be744175 | 450 | found: |
31f3c99b | 451 | return found_group; |
cd1bc465 CM |
452 | } |
453 | ||
925baedd CM |
454 | struct btrfs_block_group_cache *btrfs_find_block_group(struct btrfs_root *root, |
455 | struct btrfs_block_group_cache | |
456 | *hint, u64 search_start, | |
457 | int data, int owner) | |
458 | { | |
459 | ||
460 | struct btrfs_block_group_cache *ret; | |
925baedd | 461 | ret = __btrfs_find_block_group(root, hint, search_start, data, owner); |
925baedd CM |
462 | return ret; |
463 | } | |
7bb86316 | 464 | static u64 hash_extent_ref(u64 root_objectid, u64 ref_generation, |
74493f7a CM |
465 | u64 owner, u64 owner_offset) |
466 | { | |
467 | u32 high_crc = ~(u32)0; | |
468 | u32 low_crc = ~(u32)0; | |
469 | __le64 lenum; | |
74493f7a | 470 | lenum = cpu_to_le64(root_objectid); |
a5eb62e3 | 471 | high_crc = btrfs_crc32c(high_crc, &lenum, sizeof(lenum)); |
7bb86316 | 472 | lenum = cpu_to_le64(ref_generation); |
a5eb62e3 | 473 | low_crc = btrfs_crc32c(low_crc, &lenum, sizeof(lenum)); |
21a4989d CM |
474 | if (owner >= BTRFS_FIRST_FREE_OBJECTID) { |
475 | lenum = cpu_to_le64(owner); | |
a5eb62e3 | 476 | low_crc = btrfs_crc32c(low_crc, &lenum, sizeof(lenum)); |
21a4989d | 477 | lenum = cpu_to_le64(owner_offset); |
a5eb62e3 | 478 | low_crc = btrfs_crc32c(low_crc, &lenum, sizeof(lenum)); |
21a4989d | 479 | } |
74493f7a CM |
480 | return ((u64)high_crc << 32) | (u64)low_crc; |
481 | } | |
482 | ||
7bb86316 CM |
483 | static int match_extent_ref(struct extent_buffer *leaf, |
484 | struct btrfs_extent_ref *disk_ref, | |
485 | struct btrfs_extent_ref *cpu_ref) | |
486 | { | |
487 | int ret; | |
488 | int len; | |
489 | ||
490 | if (cpu_ref->objectid) | |
491 | len = sizeof(*cpu_ref); | |
492 | else | |
493 | len = 2 * sizeof(u64); | |
494 | ret = memcmp_extent_buffer(leaf, cpu_ref, (unsigned long)disk_ref, | |
495 | len); | |
496 | return ret == 0; | |
497 | } | |
498 | ||
e02119d5 CM |
499 | /* simple helper to search for an existing extent at a given offset */ |
500 | int btrfs_lookup_extent(struct btrfs_root *root, struct btrfs_path *path, | |
501 | u64 start, u64 len) | |
502 | { | |
503 | int ret; | |
504 | struct btrfs_key key; | |
505 | ||
506 | maybe_lock_mutex(root); | |
507 | key.objectid = start; | |
508 | key.offset = len; | |
509 | btrfs_set_key_type(&key, BTRFS_EXTENT_ITEM_KEY); | |
510 | ret = btrfs_search_slot(NULL, root->fs_info->extent_root, &key, path, | |
511 | 0, 0); | |
512 | maybe_unlock_mutex(root); | |
513 | return ret; | |
514 | } | |
515 | ||
98ed5174 CM |
516 | static int noinline lookup_extent_backref(struct btrfs_trans_handle *trans, |
517 | struct btrfs_root *root, | |
518 | struct btrfs_path *path, u64 bytenr, | |
519 | u64 root_objectid, | |
520 | u64 ref_generation, u64 owner, | |
521 | u64 owner_offset, int del) | |
74493f7a CM |
522 | { |
523 | u64 hash; | |
524 | struct btrfs_key key; | |
7bb86316 | 525 | struct btrfs_key found_key; |
74493f7a | 526 | struct btrfs_extent_ref ref; |
7bb86316 CM |
527 | struct extent_buffer *leaf; |
528 | struct btrfs_extent_ref *disk_ref; | |
529 | int ret; | |
530 | int ret2; | |
531 | ||
532 | btrfs_set_stack_ref_root(&ref, root_objectid); | |
533 | btrfs_set_stack_ref_generation(&ref, ref_generation); | |
534 | btrfs_set_stack_ref_objectid(&ref, owner); | |
535 | btrfs_set_stack_ref_offset(&ref, owner_offset); | |
536 | ||
537 | hash = hash_extent_ref(root_objectid, ref_generation, owner, | |
538 | owner_offset); | |
539 | key.offset = hash; | |
540 | key.objectid = bytenr; | |
541 | key.type = BTRFS_EXTENT_REF_KEY; | |
542 | ||
543 | while (1) { | |
544 | ret = btrfs_search_slot(trans, root, &key, path, | |
545 | del ? -1 : 0, del); | |
546 | if (ret < 0) | |
547 | goto out; | |
548 | leaf = path->nodes[0]; | |
549 | if (ret != 0) { | |
550 | u32 nritems = btrfs_header_nritems(leaf); | |
551 | if (path->slots[0] >= nritems) { | |
552 | ret2 = btrfs_next_leaf(root, path); | |
553 | if (ret2) | |
554 | goto out; | |
555 | leaf = path->nodes[0]; | |
556 | } | |
557 | btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]); | |
558 | if (found_key.objectid != bytenr || | |
559 | found_key.type != BTRFS_EXTENT_REF_KEY) | |
560 | goto out; | |
561 | key.offset = found_key.offset; | |
562 | if (del) { | |
563 | btrfs_release_path(root, path); | |
564 | continue; | |
565 | } | |
566 | } | |
567 | disk_ref = btrfs_item_ptr(path->nodes[0], | |
568 | path->slots[0], | |
569 | struct btrfs_extent_ref); | |
570 | if (match_extent_ref(path->nodes[0], disk_ref, &ref)) { | |
571 | ret = 0; | |
572 | goto out; | |
573 | } | |
574 | btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]); | |
575 | key.offset = found_key.offset + 1; | |
576 | btrfs_release_path(root, path); | |
577 | } | |
578 | out: | |
579 | return ret; | |
580 | } | |
581 | ||
d8d5f3e1 CM |
582 | /* |
583 | * Back reference rules. Back refs have three main goals: | |
584 | * | |
585 | * 1) differentiate between all holders of references to an extent so that | |
586 | * when a reference is dropped we can make sure it was a valid reference | |
587 | * before freeing the extent. | |
588 | * | |
589 | * 2) Provide enough information to quickly find the holders of an extent | |
590 | * if we notice a given block is corrupted or bad. | |
591 | * | |
592 | * 3) Make it easy to migrate blocks for FS shrinking or storage pool | |
593 | * maintenance. This is actually the same as #2, but with a slightly | |
594 | * different use case. | |
595 | * | |
596 | * File extents can be referenced by: | |
597 | * | |
598 | * - multiple snapshots, subvolumes, or different generations in one subvol | |
599 | * - different files inside a single subvolume (in theory, not implemented yet) | |
600 | * - different offsets inside a file (bookend extents in file.c) | |
601 | * | |
602 | * The extent ref structure has fields for: | |
603 | * | |
604 | * - Objectid of the subvolume root | |
605 | * - Generation number of the tree holding the reference | |
606 | * - objectid of the file holding the reference | |
607 | * - offset in the file corresponding to the key holding the reference | |
608 | * | |
609 | * When a file extent is allocated the fields are filled in: | |
610 | * (root_key.objectid, trans->transid, inode objectid, offset in file) | |
611 | * | |
612 | * When a leaf is cow'd new references are added for every file extent found | |
613 | * in the leaf. It looks the same as the create case, but trans->transid | |
614 | * will be different when the block is cow'd. | |
615 | * | |
616 | * (root_key.objectid, trans->transid, inode objectid, offset in file) | |
617 | * | |
618 | * When a file extent is removed either during snapshot deletion or file | |
619 | * truncation, the corresponding back reference is found | |
620 | * by searching for: | |
621 | * | |
622 | * (btrfs_header_owner(leaf), btrfs_header_generation(leaf), | |
623 | * inode objectid, offset in file) | |
624 | * | |
625 | * Btree extents can be referenced by: | |
626 | * | |
627 | * - Different subvolumes | |
628 | * - Different generations of the same subvolume | |
629 | * | |
630 | * Storing sufficient information for a full reverse mapping of a btree | |
631 | * block would require storing the lowest key of the block in the backref, | |
632 | * and it would require updating that lowest key either before write out or | |
633 | * every time it changed. Instead, the objectid of the lowest key is stored | |
634 | * along with the level of the tree block. This provides a hint | |
635 | * about where in the btree the block can be found. Searches through the | |
636 | * btree only need to look for a pointer to that block, so they stop one | |
637 | * level higher than the level recorded in the backref. | |
638 | * | |
639 | * Some btrees do not do reference counting on their extents. These | |
640 | * include the extent tree and the tree of tree roots. Backrefs for these | |
641 | * trees always have a generation of zero. | |
642 | * | |
643 | * When a tree block is created, back references are inserted: | |
644 | * | |
f6dbff55 | 645 | * (root->root_key.objectid, trans->transid or zero, level, lowest_key_objectid) |
d8d5f3e1 CM |
646 | * |
647 | * When a tree block is cow'd in a reference counted root, | |
648 | * new back references are added for all the blocks it points to. | |
649 | * These are of the form (trans->transid will have increased since creation): | |
650 | * | |
f6dbff55 | 651 | * (root->root_key.objectid, trans->transid, level, lowest_key_objectid) |
d8d5f3e1 CM |
652 | * |
653 | * Because the lowest_key_objectid and the level are just hints | |
654 | * they are not used when backrefs are deleted. When a backref is deleted: | |
655 | * | |
656 | * if backref was for a tree root: | |
657 | * root_objectid = root->root_key.objectid | |
658 | * else | |
659 | * root_objectid = btrfs_header_owner(parent) | |
660 | * | |
661 | * (root_objectid, btrfs_header_generation(parent) or zero, 0, 0) | |
662 | * | |
663 | * Back Reference Key hashing: | |
664 | * | |
665 | * Back references have four fields, each 64 bits long. Unfortunately, | |
666 | * This is hashed into a single 64 bit number and placed into the key offset. | |
667 | * The key objectid corresponds to the first byte in the extent, and the | |
668 | * key type is set to BTRFS_EXTENT_REF_KEY | |
669 | */ | |
7bb86316 CM |
670 | int btrfs_insert_extent_backref(struct btrfs_trans_handle *trans, |
671 | struct btrfs_root *root, | |
672 | struct btrfs_path *path, u64 bytenr, | |
673 | u64 root_objectid, u64 ref_generation, | |
674 | u64 owner, u64 owner_offset) | |
675 | { | |
676 | u64 hash; | |
677 | struct btrfs_key key; | |
678 | struct btrfs_extent_ref ref; | |
679 | struct btrfs_extent_ref *disk_ref; | |
74493f7a CM |
680 | int ret; |
681 | ||
682 | btrfs_set_stack_ref_root(&ref, root_objectid); | |
7bb86316 | 683 | btrfs_set_stack_ref_generation(&ref, ref_generation); |
74493f7a CM |
684 | btrfs_set_stack_ref_objectid(&ref, owner); |
685 | btrfs_set_stack_ref_offset(&ref, owner_offset); | |
686 | ||
7bb86316 CM |
687 | hash = hash_extent_ref(root_objectid, ref_generation, owner, |
688 | owner_offset); | |
74493f7a CM |
689 | key.offset = hash; |
690 | key.objectid = bytenr; | |
691 | key.type = BTRFS_EXTENT_REF_KEY; | |
692 | ||
693 | ret = btrfs_insert_empty_item(trans, root, path, &key, sizeof(ref)); | |
694 | while (ret == -EEXIST) { | |
7bb86316 CM |
695 | disk_ref = btrfs_item_ptr(path->nodes[0], path->slots[0], |
696 | struct btrfs_extent_ref); | |
697 | if (match_extent_ref(path->nodes[0], disk_ref, &ref)) | |
698 | goto out; | |
699 | key.offset++; | |
700 | btrfs_release_path(root, path); | |
701 | ret = btrfs_insert_empty_item(trans, root, path, &key, | |
702 | sizeof(ref)); | |
74493f7a | 703 | } |
7bb86316 CM |
704 | if (ret) |
705 | goto out; | |
706 | disk_ref = btrfs_item_ptr(path->nodes[0], path->slots[0], | |
707 | struct btrfs_extent_ref); | |
708 | write_extent_buffer(path->nodes[0], &ref, (unsigned long)disk_ref, | |
709 | sizeof(ref)); | |
710 | btrfs_mark_buffer_dirty(path->nodes[0]); | |
711 | out: | |
712 | btrfs_release_path(root, path); | |
713 | return ret; | |
74493f7a CM |
714 | } |
715 | ||
925baedd | 716 | static int __btrfs_inc_extent_ref(struct btrfs_trans_handle *trans, |
b18c6685 | 717 | struct btrfs_root *root, |
74493f7a | 718 | u64 bytenr, u64 num_bytes, |
7bb86316 | 719 | u64 root_objectid, u64 ref_generation, |
74493f7a | 720 | u64 owner, u64 owner_offset) |
02217ed2 | 721 | { |
5caf2a00 | 722 | struct btrfs_path *path; |
02217ed2 | 723 | int ret; |
e2fa7227 | 724 | struct btrfs_key key; |
5f39d397 | 725 | struct extent_buffer *l; |
234b63a0 | 726 | struct btrfs_extent_item *item; |
cf27e1ee | 727 | u32 refs; |
037e6390 | 728 | |
db94535d | 729 | WARN_ON(num_bytes < root->sectorsize); |
5caf2a00 | 730 | path = btrfs_alloc_path(); |
54aa1f4d CM |
731 | if (!path) |
732 | return -ENOMEM; | |
26b8003f | 733 | |
3c12ac72 | 734 | path->reada = 1; |
db94535d | 735 | key.objectid = bytenr; |
62e2749e | 736 | btrfs_set_key_type(&key, BTRFS_EXTENT_ITEM_KEY); |
db94535d | 737 | key.offset = num_bytes; |
5caf2a00 | 738 | ret = btrfs_search_slot(trans, root->fs_info->extent_root, &key, path, |
9f5fae2f | 739 | 0, 1); |
54aa1f4d CM |
740 | if (ret < 0) |
741 | return ret; | |
a429e513 | 742 | if (ret != 0) { |
a28ec197 | 743 | BUG(); |
a429e513 | 744 | } |
02217ed2 | 745 | BUG_ON(ret != 0); |
5f39d397 | 746 | l = path->nodes[0]; |
5caf2a00 | 747 | item = btrfs_item_ptr(l, path->slots[0], struct btrfs_extent_item); |
5f39d397 CM |
748 | refs = btrfs_extent_refs(l, item); |
749 | btrfs_set_extent_refs(l, item, refs + 1); | |
5caf2a00 | 750 | btrfs_mark_buffer_dirty(path->nodes[0]); |
a28ec197 | 751 | |
5caf2a00 | 752 | btrfs_release_path(root->fs_info->extent_root, path); |
7bb86316 | 753 | |
3c12ac72 | 754 | path->reada = 1; |
7bb86316 CM |
755 | ret = btrfs_insert_extent_backref(trans, root->fs_info->extent_root, |
756 | path, bytenr, root_objectid, | |
757 | ref_generation, owner, owner_offset); | |
758 | BUG_ON(ret); | |
9f5fae2f | 759 | finish_current_insert(trans, root->fs_info->extent_root); |
e20d96d6 | 760 | del_pending_extents(trans, root->fs_info->extent_root); |
74493f7a CM |
761 | |
762 | btrfs_free_path(path); | |
02217ed2 CM |
763 | return 0; |
764 | } | |
765 | ||
925baedd CM |
766 | int btrfs_inc_extent_ref(struct btrfs_trans_handle *trans, |
767 | struct btrfs_root *root, | |
768 | u64 bytenr, u64 num_bytes, | |
769 | u64 root_objectid, u64 ref_generation, | |
770 | u64 owner, u64 owner_offset) | |
771 | { | |
772 | int ret; | |
773 | ||
774 | mutex_lock(&root->fs_info->alloc_mutex); | |
775 | ret = __btrfs_inc_extent_ref(trans, root, bytenr, num_bytes, | |
776 | root_objectid, ref_generation, | |
777 | owner, owner_offset); | |
778 | mutex_unlock(&root->fs_info->alloc_mutex); | |
779 | return ret; | |
780 | } | |
781 | ||
e9d0b13b CM |
782 | int btrfs_extent_post_op(struct btrfs_trans_handle *trans, |
783 | struct btrfs_root *root) | |
784 | { | |
785 | finish_current_insert(trans, root->fs_info->extent_root); | |
786 | del_pending_extents(trans, root->fs_info->extent_root); | |
787 | return 0; | |
788 | } | |
789 | ||
b18c6685 | 790 | static int lookup_extent_ref(struct btrfs_trans_handle *trans, |
db94535d CM |
791 | struct btrfs_root *root, u64 bytenr, |
792 | u64 num_bytes, u32 *refs) | |
a28ec197 | 793 | { |
5caf2a00 | 794 | struct btrfs_path *path; |
a28ec197 | 795 | int ret; |
e2fa7227 | 796 | struct btrfs_key key; |
5f39d397 | 797 | struct extent_buffer *l; |
234b63a0 | 798 | struct btrfs_extent_item *item; |
5caf2a00 | 799 | |
db94535d | 800 | WARN_ON(num_bytes < root->sectorsize); |
5caf2a00 | 801 | path = btrfs_alloc_path(); |
3c12ac72 | 802 | path->reada = 1; |
db94535d CM |
803 | key.objectid = bytenr; |
804 | key.offset = num_bytes; | |
62e2749e | 805 | btrfs_set_key_type(&key, BTRFS_EXTENT_ITEM_KEY); |
5caf2a00 | 806 | ret = btrfs_search_slot(trans, root->fs_info->extent_root, &key, path, |
9f5fae2f | 807 | 0, 0); |
54aa1f4d CM |
808 | if (ret < 0) |
809 | goto out; | |
5f39d397 CM |
810 | if (ret != 0) { |
811 | btrfs_print_leaf(root, path->nodes[0]); | |
db94535d | 812 | printk("failed to find block number %Lu\n", bytenr); |
a28ec197 | 813 | BUG(); |
5f39d397 CM |
814 | } |
815 | l = path->nodes[0]; | |
5caf2a00 | 816 | item = btrfs_item_ptr(l, path->slots[0], struct btrfs_extent_item); |
5f39d397 | 817 | *refs = btrfs_extent_refs(l, item); |
54aa1f4d | 818 | out: |
5caf2a00 | 819 | btrfs_free_path(path); |
a28ec197 CM |
820 | return 0; |
821 | } | |
822 | ||
f321e491 YZ |
823 | |
824 | static int get_reference_status(struct btrfs_root *root, u64 bytenr, | |
825 | u64 parent_gen, u64 ref_objectid, | |
826 | u64 *min_generation, u32 *ref_count) | |
be20aa9d CM |
827 | { |
828 | struct btrfs_root *extent_root = root->fs_info->extent_root; | |
829 | struct btrfs_path *path; | |
f321e491 YZ |
830 | struct extent_buffer *leaf; |
831 | struct btrfs_extent_ref *ref_item; | |
832 | struct btrfs_key key; | |
833 | struct btrfs_key found_key; | |
56b453c9 | 834 | u64 root_objectid = root->root_key.objectid; |
f321e491 | 835 | u64 ref_generation; |
be20aa9d CM |
836 | u32 nritems; |
837 | int ret; | |
925baedd | 838 | |
be20aa9d CM |
839 | key.objectid = bytenr; |
840 | key.offset = 0; | |
f321e491 | 841 | key.type = BTRFS_EXTENT_ITEM_KEY; |
be20aa9d | 842 | |
f321e491 YZ |
843 | path = btrfs_alloc_path(); |
844 | mutex_lock(&root->fs_info->alloc_mutex); | |
be20aa9d CM |
845 | ret = btrfs_search_slot(NULL, extent_root, &key, path, 0, 0); |
846 | if (ret < 0) | |
847 | goto out; | |
848 | BUG_ON(ret == 0); | |
849 | ||
f321e491 YZ |
850 | leaf = path->nodes[0]; |
851 | btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]); | |
be20aa9d CM |
852 | |
853 | if (found_key.objectid != bytenr || | |
854 | found_key.type != BTRFS_EXTENT_ITEM_KEY) { | |
f321e491 | 855 | ret = 1; |
be20aa9d CM |
856 | goto out; |
857 | } | |
858 | ||
f321e491 YZ |
859 | *ref_count = 0; |
860 | *min_generation = (u64)-1; | |
861 | ||
be20aa9d | 862 | while (1) { |
f321e491 YZ |
863 | leaf = path->nodes[0]; |
864 | nritems = btrfs_header_nritems(leaf); | |
be20aa9d CM |
865 | if (path->slots[0] >= nritems) { |
866 | ret = btrfs_next_leaf(extent_root, path); | |
f321e491 YZ |
867 | if (ret < 0) |
868 | goto out; | |
be20aa9d CM |
869 | if (ret == 0) |
870 | continue; | |
871 | break; | |
872 | } | |
f321e491 | 873 | btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]); |
be20aa9d CM |
874 | if (found_key.objectid != bytenr) |
875 | break; | |
bd09835d | 876 | |
be20aa9d CM |
877 | if (found_key.type != BTRFS_EXTENT_REF_KEY) { |
878 | path->slots[0]++; | |
879 | continue; | |
880 | } | |
881 | ||
f321e491 | 882 | ref_item = btrfs_item_ptr(leaf, path->slots[0], |
be20aa9d | 883 | struct btrfs_extent_ref); |
f321e491 YZ |
884 | ref_generation = btrfs_ref_generation(leaf, ref_item); |
885 | /* | |
886 | * For (parent_gen > 0 && parent_gen > ref_gen): | |
887 | * | |
bcc63abb Y |
888 | * we reach here through the oldest root, therefore |
889 | * all other reference from same snapshot should have | |
f321e491 YZ |
890 | * a larger generation. |
891 | */ | |
892 | if ((root_objectid != btrfs_ref_root(leaf, ref_item)) || | |
893 | (parent_gen > 0 && parent_gen > ref_generation) || | |
894 | (ref_objectid >= BTRFS_FIRST_FREE_OBJECTID && | |
895 | ref_objectid != btrfs_ref_objectid(leaf, ref_item))) { | |
896 | if (ref_count) | |
897 | *ref_count = 2; | |
898 | break; | |
a68d5933 | 899 | } |
f321e491 YZ |
900 | |
901 | *ref_count = 1; | |
902 | if (*min_generation > ref_generation) | |
903 | *min_generation = ref_generation; | |
904 | ||
be20aa9d CM |
905 | path->slots[0]++; |
906 | } | |
f321e491 YZ |
907 | ret = 0; |
908 | out: | |
909 | mutex_unlock(&root->fs_info->alloc_mutex); | |
910 | btrfs_free_path(path); | |
911 | return ret; | |
912 | } | |
913 | ||
7ea394f1 YZ |
914 | int btrfs_cross_ref_exists(struct btrfs_trans_handle *trans, |
915 | struct btrfs_root *root, | |
f321e491 YZ |
916 | struct btrfs_key *key, u64 bytenr) |
917 | { | |
f321e491 YZ |
918 | struct btrfs_root *old_root; |
919 | struct btrfs_path *path = NULL; | |
920 | struct extent_buffer *eb; | |
921 | struct btrfs_file_extent_item *item; | |
922 | u64 ref_generation; | |
923 | u64 min_generation; | |
924 | u64 extent_start; | |
925 | u32 ref_count; | |
926 | int level; | |
927 | int ret; | |
928 | ||
7ea394f1 | 929 | BUG_ON(trans == NULL); |
f321e491 YZ |
930 | BUG_ON(key->type != BTRFS_EXTENT_DATA_KEY); |
931 | ret = get_reference_status(root, bytenr, 0, key->objectid, | |
932 | &min_generation, &ref_count); | |
933 | if (ret) | |
934 | return ret; | |
935 | ||
936 | if (ref_count != 1) | |
937 | return 1; | |
938 | ||
f321e491 YZ |
939 | old_root = root->dirty_root->root; |
940 | ref_generation = old_root->root_key.offset; | |
941 | ||
942 | /* all references are created in running transaction */ | |
943 | if (min_generation > ref_generation) { | |
944 | ret = 0; | |
bbaf549e CM |
945 | goto out; |
946 | } | |
f321e491 YZ |
947 | |
948 | path = btrfs_alloc_path(); | |
949 | if (!path) { | |
950 | ret = -ENOMEM; | |
be20aa9d CM |
951 | goto out; |
952 | } | |
f321e491 YZ |
953 | |
954 | path->skip_locking = 1; | |
955 | /* if no item found, the extent is referenced by other snapshot */ | |
956 | ret = btrfs_search_slot(NULL, old_root, key, path, 0, 0); | |
957 | if (ret) | |
be20aa9d | 958 | goto out; |
be20aa9d | 959 | |
f321e491 YZ |
960 | eb = path->nodes[0]; |
961 | item = btrfs_item_ptr(eb, path->slots[0], | |
962 | struct btrfs_file_extent_item); | |
963 | if (btrfs_file_extent_type(eb, item) != BTRFS_FILE_EXTENT_REG || | |
964 | btrfs_file_extent_disk_bytenr(eb, item) != bytenr) { | |
965 | ret = 1; | |
966 | goto out; | |
967 | } | |
968 | ||
969 | for (level = BTRFS_MAX_LEVEL - 1; level >= -1; level--) { | |
970 | if (level >= 0) { | |
971 | eb = path->nodes[level]; | |
972 | if (!eb) | |
973 | continue; | |
974 | extent_start = eb->start; | |
bcc63abb | 975 | } else |
f321e491 YZ |
976 | extent_start = bytenr; |
977 | ||
978 | ret = get_reference_status(root, extent_start, ref_generation, | |
979 | 0, &min_generation, &ref_count); | |
980 | if (ret) | |
981 | goto out; | |
982 | ||
983 | if (ref_count != 1) { | |
984 | ret = 1; | |
985 | goto out; | |
986 | } | |
987 | if (level >= 0) | |
988 | ref_generation = btrfs_header_generation(eb); | |
989 | } | |
990 | ret = 0; | |
be20aa9d | 991 | out: |
f321e491 YZ |
992 | if (path) |
993 | btrfs_free_path(path); | |
f321e491 | 994 | return ret; |
be20aa9d | 995 | } |
c5739bba | 996 | |
e089f05c | 997 | int btrfs_inc_ref(struct btrfs_trans_handle *trans, struct btrfs_root *root, |
31153d81 | 998 | struct extent_buffer *buf, int cache_ref) |
02217ed2 | 999 | { |
db94535d | 1000 | u64 bytenr; |
5f39d397 CM |
1001 | u32 nritems; |
1002 | struct btrfs_key key; | |
6407bf6d | 1003 | struct btrfs_file_extent_item *fi; |
02217ed2 | 1004 | int i; |
db94535d | 1005 | int level; |
6407bf6d | 1006 | int ret; |
54aa1f4d | 1007 | int faili; |
31153d81 | 1008 | int nr_file_extents = 0; |
a28ec197 | 1009 | |
3768f368 | 1010 | if (!root->ref_cows) |
a28ec197 | 1011 | return 0; |
5f39d397 | 1012 | |
db94535d | 1013 | level = btrfs_header_level(buf); |
5f39d397 CM |
1014 | nritems = btrfs_header_nritems(buf); |
1015 | for (i = 0; i < nritems; i++) { | |
e34a5b4f | 1016 | cond_resched(); |
db94535d CM |
1017 | if (level == 0) { |
1018 | u64 disk_bytenr; | |
5f39d397 CM |
1019 | btrfs_item_key_to_cpu(buf, &key, i); |
1020 | if (btrfs_key_type(&key) != BTRFS_EXTENT_DATA_KEY) | |
6407bf6d | 1021 | continue; |
5f39d397 | 1022 | fi = btrfs_item_ptr(buf, i, |
6407bf6d | 1023 | struct btrfs_file_extent_item); |
5f39d397 | 1024 | if (btrfs_file_extent_type(buf, fi) == |
236454df CM |
1025 | BTRFS_FILE_EXTENT_INLINE) |
1026 | continue; | |
db94535d CM |
1027 | disk_bytenr = btrfs_file_extent_disk_bytenr(buf, fi); |
1028 | if (disk_bytenr == 0) | |
3a686375 | 1029 | continue; |
4a096752 | 1030 | |
31153d81 YZ |
1031 | if (buf != root->commit_root) |
1032 | nr_file_extents++; | |
1033 | ||
4a096752 | 1034 | mutex_lock(&root->fs_info->alloc_mutex); |
925baedd | 1035 | ret = __btrfs_inc_extent_ref(trans, root, disk_bytenr, |
7bb86316 CM |
1036 | btrfs_file_extent_disk_num_bytes(buf, fi), |
1037 | root->root_key.objectid, trans->transid, | |
1038 | key.objectid, key.offset); | |
4a096752 | 1039 | mutex_unlock(&root->fs_info->alloc_mutex); |
54aa1f4d CM |
1040 | if (ret) { |
1041 | faili = i; | |
4a096752 | 1042 | WARN_ON(1); |
54aa1f4d CM |
1043 | goto fail; |
1044 | } | |
6407bf6d | 1045 | } else { |
db94535d | 1046 | bytenr = btrfs_node_blockptr(buf, i); |
6caab489 | 1047 | btrfs_node_key_to_cpu(buf, &key, i); |
4a096752 CM |
1048 | |
1049 | mutex_lock(&root->fs_info->alloc_mutex); | |
925baedd | 1050 | ret = __btrfs_inc_extent_ref(trans, root, bytenr, |
7bb86316 CM |
1051 | btrfs_level_size(root, level - 1), |
1052 | root->root_key.objectid, | |
f6dbff55 CM |
1053 | trans->transid, |
1054 | level - 1, key.objectid); | |
4a096752 | 1055 | mutex_unlock(&root->fs_info->alloc_mutex); |
54aa1f4d CM |
1056 | if (ret) { |
1057 | faili = i; | |
4a096752 | 1058 | WARN_ON(1); |
54aa1f4d CM |
1059 | goto fail; |
1060 | } | |
6407bf6d | 1061 | } |
02217ed2 | 1062 | } |
31153d81 YZ |
1063 | /* cache orignal leaf block's references */ |
1064 | if (level == 0 && cache_ref && buf != root->commit_root) { | |
1065 | struct btrfs_leaf_ref *ref; | |
1066 | struct btrfs_extent_info *info; | |
1067 | ||
bcc63abb | 1068 | ref = btrfs_alloc_leaf_ref(root, nr_file_extents); |
31153d81 YZ |
1069 | if (!ref) { |
1070 | WARN_ON(1); | |
1071 | goto out; | |
1072 | } | |
1073 | ||
47ac14fa | 1074 | ref->root_gen = root->root_key.offset; |
31153d81 YZ |
1075 | ref->bytenr = buf->start; |
1076 | ref->owner = btrfs_header_owner(buf); | |
1077 | ref->generation = btrfs_header_generation(buf); | |
1078 | ref->nritems = nr_file_extents; | |
1079 | info = ref->extents; | |
bcc63abb | 1080 | |
31153d81 YZ |
1081 | for (i = 0; nr_file_extents > 0 && i < nritems; i++) { |
1082 | u64 disk_bytenr; | |
1083 | btrfs_item_key_to_cpu(buf, &key, i); | |
1084 | if (btrfs_key_type(&key) != BTRFS_EXTENT_DATA_KEY) | |
1085 | continue; | |
1086 | fi = btrfs_item_ptr(buf, i, | |
1087 | struct btrfs_file_extent_item); | |
1088 | if (btrfs_file_extent_type(buf, fi) == | |
1089 | BTRFS_FILE_EXTENT_INLINE) | |
1090 | continue; | |
1091 | disk_bytenr = btrfs_file_extent_disk_bytenr(buf, fi); | |
1092 | if (disk_bytenr == 0) | |
1093 | continue; | |
1094 | ||
1095 | info->bytenr = disk_bytenr; | |
1096 | info->num_bytes = | |
1097 | btrfs_file_extent_disk_num_bytes(buf, fi); | |
1098 | info->objectid = key.objectid; | |
1099 | info->offset = key.offset; | |
1100 | info++; | |
1101 | } | |
1102 | ||
1103 | BUG_ON(!root->ref_tree); | |
1104 | ret = btrfs_add_leaf_ref(root, ref); | |
1105 | WARN_ON(ret); | |
bcc63abb | 1106 | btrfs_free_leaf_ref(root, ref); |
31153d81 YZ |
1107 | } |
1108 | out: | |
02217ed2 | 1109 | return 0; |
54aa1f4d | 1110 | fail: |
ccd467d6 | 1111 | WARN_ON(1); |
7bb86316 | 1112 | #if 0 |
54aa1f4d | 1113 | for (i =0; i < faili; i++) { |
db94535d CM |
1114 | if (level == 0) { |
1115 | u64 disk_bytenr; | |
5f39d397 CM |
1116 | btrfs_item_key_to_cpu(buf, &key, i); |
1117 | if (btrfs_key_type(&key) != BTRFS_EXTENT_DATA_KEY) | |
54aa1f4d | 1118 | continue; |
5f39d397 | 1119 | fi = btrfs_item_ptr(buf, i, |
54aa1f4d | 1120 | struct btrfs_file_extent_item); |
5f39d397 | 1121 | if (btrfs_file_extent_type(buf, fi) == |
54aa1f4d CM |
1122 | BTRFS_FILE_EXTENT_INLINE) |
1123 | continue; | |
db94535d CM |
1124 | disk_bytenr = btrfs_file_extent_disk_bytenr(buf, fi); |
1125 | if (disk_bytenr == 0) | |
54aa1f4d | 1126 | continue; |
db94535d CM |
1127 | err = btrfs_free_extent(trans, root, disk_bytenr, |
1128 | btrfs_file_extent_disk_num_bytes(buf, | |
5f39d397 | 1129 | fi), 0); |
54aa1f4d CM |
1130 | BUG_ON(err); |
1131 | } else { | |
db94535d CM |
1132 | bytenr = btrfs_node_blockptr(buf, i); |
1133 | err = btrfs_free_extent(trans, root, bytenr, | |
1134 | btrfs_level_size(root, level - 1), 0); | |
54aa1f4d CM |
1135 | BUG_ON(err); |
1136 | } | |
1137 | } | |
7bb86316 | 1138 | #endif |
54aa1f4d | 1139 | return ret; |
02217ed2 CM |
1140 | } |
1141 | ||
9078a3e1 CM |
1142 | static int write_one_cache_group(struct btrfs_trans_handle *trans, |
1143 | struct btrfs_root *root, | |
1144 | struct btrfs_path *path, | |
1145 | struct btrfs_block_group_cache *cache) | |
1146 | { | |
1147 | int ret; | |
1148 | int pending_ret; | |
1149 | struct btrfs_root *extent_root = root->fs_info->extent_root; | |
5f39d397 CM |
1150 | unsigned long bi; |
1151 | struct extent_buffer *leaf; | |
9078a3e1 | 1152 | |
9078a3e1 | 1153 | ret = btrfs_search_slot(trans, extent_root, &cache->key, path, 0, 1); |
54aa1f4d CM |
1154 | if (ret < 0) |
1155 | goto fail; | |
9078a3e1 | 1156 | BUG_ON(ret); |
5f39d397 CM |
1157 | |
1158 | leaf = path->nodes[0]; | |
1159 | bi = btrfs_item_ptr_offset(leaf, path->slots[0]); | |
1160 | write_extent_buffer(leaf, &cache->item, bi, sizeof(cache->item)); | |
1161 | btrfs_mark_buffer_dirty(leaf); | |
9078a3e1 | 1162 | btrfs_release_path(extent_root, path); |
54aa1f4d | 1163 | fail: |
9078a3e1 CM |
1164 | finish_current_insert(trans, extent_root); |
1165 | pending_ret = del_pending_extents(trans, extent_root); | |
1166 | if (ret) | |
1167 | return ret; | |
1168 | if (pending_ret) | |
1169 | return pending_ret; | |
1170 | return 0; | |
1171 | ||
1172 | } | |
1173 | ||
96b5179d CM |
1174 | int btrfs_write_dirty_block_groups(struct btrfs_trans_handle *trans, |
1175 | struct btrfs_root *root) | |
9078a3e1 | 1176 | { |
d1310b2e | 1177 | struct extent_io_tree *block_group_cache; |
96b5179d | 1178 | struct btrfs_block_group_cache *cache; |
9078a3e1 CM |
1179 | int ret; |
1180 | int err = 0; | |
1181 | int werr = 0; | |
9078a3e1 | 1182 | struct btrfs_path *path; |
96b5179d CM |
1183 | u64 last = 0; |
1184 | u64 start; | |
1185 | u64 end; | |
1186 | u64 ptr; | |
9078a3e1 | 1187 | |
96b5179d | 1188 | block_group_cache = &root->fs_info->block_group_cache; |
9078a3e1 CM |
1189 | path = btrfs_alloc_path(); |
1190 | if (!path) | |
1191 | return -ENOMEM; | |
1192 | ||
925baedd | 1193 | mutex_lock(&root->fs_info->alloc_mutex); |
9078a3e1 | 1194 | while(1) { |
96b5179d CM |
1195 | ret = find_first_extent_bit(block_group_cache, last, |
1196 | &start, &end, BLOCK_GROUP_DIRTY); | |
1197 | if (ret) | |
9078a3e1 | 1198 | break; |
54aa1f4d | 1199 | |
96b5179d CM |
1200 | last = end + 1; |
1201 | ret = get_state_private(block_group_cache, start, &ptr); | |
1202 | if (ret) | |
1203 | break; | |
ae2f5411 | 1204 | cache = (struct btrfs_block_group_cache *)(unsigned long)ptr; |
96b5179d CM |
1205 | err = write_one_cache_group(trans, root, |
1206 | path, cache); | |
1207 | /* | |
1208 | * if we fail to write the cache group, we want | |
1209 | * to keep it marked dirty in hopes that a later | |
1210 | * write will work | |
1211 | */ | |
1212 | if (err) { | |
1213 | werr = err; | |
1214 | continue; | |
9078a3e1 | 1215 | } |
96b5179d CM |
1216 | clear_extent_bits(block_group_cache, start, end, |
1217 | BLOCK_GROUP_DIRTY, GFP_NOFS); | |
9078a3e1 CM |
1218 | } |
1219 | btrfs_free_path(path); | |
925baedd | 1220 | mutex_unlock(&root->fs_info->alloc_mutex); |
9078a3e1 CM |
1221 | return werr; |
1222 | } | |
1223 | ||
6324fbf3 CM |
1224 | static struct btrfs_space_info *__find_space_info(struct btrfs_fs_info *info, |
1225 | u64 flags) | |
1226 | { | |
1227 | struct list_head *head = &info->space_info; | |
1228 | struct list_head *cur; | |
1229 | struct btrfs_space_info *found; | |
1230 | list_for_each(cur, head) { | |
1231 | found = list_entry(cur, struct btrfs_space_info, list); | |
1232 | if (found->flags == flags) | |
1233 | return found; | |
1234 | } | |
1235 | return NULL; | |
1236 | ||
1237 | } | |
1238 | ||
593060d7 CM |
1239 | static int update_space_info(struct btrfs_fs_info *info, u64 flags, |
1240 | u64 total_bytes, u64 bytes_used, | |
1241 | struct btrfs_space_info **space_info) | |
1242 | { | |
1243 | struct btrfs_space_info *found; | |
1244 | ||
1245 | found = __find_space_info(info, flags); | |
1246 | if (found) { | |
1247 | found->total_bytes += total_bytes; | |
1248 | found->bytes_used += bytes_used; | |
8f18cf13 | 1249 | found->full = 0; |
593060d7 CM |
1250 | *space_info = found; |
1251 | return 0; | |
1252 | } | |
1253 | found = kmalloc(sizeof(*found), GFP_NOFS); | |
1254 | if (!found) | |
1255 | return -ENOMEM; | |
1256 | ||
1257 | list_add(&found->list, &info->space_info); | |
1258 | found->flags = flags; | |
1259 | found->total_bytes = total_bytes; | |
1260 | found->bytes_used = bytes_used; | |
1261 | found->bytes_pinned = 0; | |
1262 | found->full = 0; | |
0ef3e66b | 1263 | found->force_alloc = 0; |
593060d7 CM |
1264 | *space_info = found; |
1265 | return 0; | |
1266 | } | |
1267 | ||
8790d502 CM |
1268 | static void set_avail_alloc_bits(struct btrfs_fs_info *fs_info, u64 flags) |
1269 | { | |
1270 | u64 extra_flags = flags & (BTRFS_BLOCK_GROUP_RAID0 | | |
611f0e00 | 1271 | BTRFS_BLOCK_GROUP_RAID1 | |
321aecc6 | 1272 | BTRFS_BLOCK_GROUP_RAID10 | |
611f0e00 | 1273 | BTRFS_BLOCK_GROUP_DUP); |
8790d502 CM |
1274 | if (extra_flags) { |
1275 | if (flags & BTRFS_BLOCK_GROUP_DATA) | |
1276 | fs_info->avail_data_alloc_bits |= extra_flags; | |
1277 | if (flags & BTRFS_BLOCK_GROUP_METADATA) | |
1278 | fs_info->avail_metadata_alloc_bits |= extra_flags; | |
1279 | if (flags & BTRFS_BLOCK_GROUP_SYSTEM) | |
1280 | fs_info->avail_system_alloc_bits |= extra_flags; | |
1281 | } | |
1282 | } | |
593060d7 | 1283 | |
a061fc8d | 1284 | static u64 reduce_alloc_profile(struct btrfs_root *root, u64 flags) |
ec44a35c | 1285 | { |
a061fc8d CM |
1286 | u64 num_devices = root->fs_info->fs_devices->num_devices; |
1287 | ||
1288 | if (num_devices == 1) | |
1289 | flags &= ~(BTRFS_BLOCK_GROUP_RAID1 | BTRFS_BLOCK_GROUP_RAID0); | |
1290 | if (num_devices < 4) | |
1291 | flags &= ~BTRFS_BLOCK_GROUP_RAID10; | |
1292 | ||
ec44a35c CM |
1293 | if ((flags & BTRFS_BLOCK_GROUP_DUP) && |
1294 | (flags & (BTRFS_BLOCK_GROUP_RAID1 | | |
a061fc8d | 1295 | BTRFS_BLOCK_GROUP_RAID10))) { |
ec44a35c | 1296 | flags &= ~BTRFS_BLOCK_GROUP_DUP; |
a061fc8d | 1297 | } |
ec44a35c CM |
1298 | |
1299 | if ((flags & BTRFS_BLOCK_GROUP_RAID1) && | |
a061fc8d | 1300 | (flags & BTRFS_BLOCK_GROUP_RAID10)) { |
ec44a35c | 1301 | flags &= ~BTRFS_BLOCK_GROUP_RAID1; |
a061fc8d | 1302 | } |
ec44a35c CM |
1303 | |
1304 | if ((flags & BTRFS_BLOCK_GROUP_RAID0) && | |
1305 | ((flags & BTRFS_BLOCK_GROUP_RAID1) | | |
1306 | (flags & BTRFS_BLOCK_GROUP_RAID10) | | |
1307 | (flags & BTRFS_BLOCK_GROUP_DUP))) | |
1308 | flags &= ~BTRFS_BLOCK_GROUP_RAID0; | |
1309 | return flags; | |
1310 | } | |
1311 | ||
6324fbf3 CM |
1312 | static int do_chunk_alloc(struct btrfs_trans_handle *trans, |
1313 | struct btrfs_root *extent_root, u64 alloc_bytes, | |
0ef3e66b | 1314 | u64 flags, int force) |
6324fbf3 CM |
1315 | { |
1316 | struct btrfs_space_info *space_info; | |
1317 | u64 thresh; | |
1318 | u64 start; | |
1319 | u64 num_bytes; | |
1320 | int ret; | |
1321 | ||
a061fc8d | 1322 | flags = reduce_alloc_profile(extent_root, flags); |
ec44a35c | 1323 | |
6324fbf3 | 1324 | space_info = __find_space_info(extent_root->fs_info, flags); |
593060d7 CM |
1325 | if (!space_info) { |
1326 | ret = update_space_info(extent_root->fs_info, flags, | |
1327 | 0, 0, &space_info); | |
1328 | BUG_ON(ret); | |
1329 | } | |
6324fbf3 CM |
1330 | BUG_ON(!space_info); |
1331 | ||
0ef3e66b CM |
1332 | if (space_info->force_alloc) { |
1333 | force = 1; | |
1334 | space_info->force_alloc = 0; | |
1335 | } | |
6324fbf3 | 1336 | if (space_info->full) |
925baedd | 1337 | goto out; |
6324fbf3 | 1338 | |
8790d502 | 1339 | thresh = div_factor(space_info->total_bytes, 6); |
0ef3e66b CM |
1340 | if (!force && |
1341 | (space_info->bytes_used + space_info->bytes_pinned + alloc_bytes) < | |
6324fbf3 | 1342 | thresh) |
925baedd | 1343 | goto out; |
6324fbf3 | 1344 | |
925baedd | 1345 | mutex_lock(&extent_root->fs_info->chunk_mutex); |
6324fbf3 CM |
1346 | ret = btrfs_alloc_chunk(trans, extent_root, &start, &num_bytes, flags); |
1347 | if (ret == -ENOSPC) { | |
1348 | printk("space info full %Lu\n", flags); | |
1349 | space_info->full = 1; | |
a74a4b97 | 1350 | goto out_unlock; |
6324fbf3 | 1351 | } |
6324fbf3 CM |
1352 | BUG_ON(ret); |
1353 | ||
1354 | ret = btrfs_make_block_group(trans, extent_root, 0, flags, | |
e17cade2 | 1355 | BTRFS_FIRST_CHUNK_TREE_OBJECTID, start, num_bytes); |
6324fbf3 | 1356 | BUG_ON(ret); |
a74a4b97 | 1357 | out_unlock: |
333db94c | 1358 | mutex_unlock(&extent_root->fs_info->chunk_mutex); |
a74a4b97 | 1359 | out: |
6324fbf3 CM |
1360 | return 0; |
1361 | } | |
1362 | ||
9078a3e1 CM |
1363 | static int update_block_group(struct btrfs_trans_handle *trans, |
1364 | struct btrfs_root *root, | |
db94535d | 1365 | u64 bytenr, u64 num_bytes, int alloc, |
0b86a832 | 1366 | int mark_free) |
9078a3e1 CM |
1367 | { |
1368 | struct btrfs_block_group_cache *cache; | |
1369 | struct btrfs_fs_info *info = root->fs_info; | |
db94535d | 1370 | u64 total = num_bytes; |
9078a3e1 | 1371 | u64 old_val; |
db94535d | 1372 | u64 byte_in_group; |
96b5179d CM |
1373 | u64 start; |
1374 | u64 end; | |
3e1ad54f | 1375 | |
7d9eb12c | 1376 | WARN_ON(!mutex_is_locked(&root->fs_info->alloc_mutex)); |
9078a3e1 | 1377 | while(total) { |
db94535d | 1378 | cache = btrfs_lookup_block_group(info, bytenr); |
3e1ad54f | 1379 | if (!cache) { |
9078a3e1 | 1380 | return -1; |
cd1bc465 | 1381 | } |
db94535d CM |
1382 | byte_in_group = bytenr - cache->key.objectid; |
1383 | WARN_ON(byte_in_group > cache->key.offset); | |
96b5179d CM |
1384 | start = cache->key.objectid; |
1385 | end = start + cache->key.offset - 1; | |
1386 | set_extent_bits(&info->block_group_cache, start, end, | |
1387 | BLOCK_GROUP_DIRTY, GFP_NOFS); | |
9078a3e1 | 1388 | |
c286ac48 | 1389 | spin_lock(&cache->lock); |
9078a3e1 | 1390 | old_val = btrfs_block_group_used(&cache->item); |
db94535d | 1391 | num_bytes = min(total, cache->key.offset - byte_in_group); |
cd1bc465 | 1392 | if (alloc) { |
db94535d | 1393 | old_val += num_bytes; |
6324fbf3 | 1394 | cache->space_info->bytes_used += num_bytes; |
c286ac48 CM |
1395 | btrfs_set_block_group_used(&cache->item, old_val); |
1396 | spin_unlock(&cache->lock); | |
cd1bc465 | 1397 | } else { |
db94535d | 1398 | old_val -= num_bytes; |
6324fbf3 | 1399 | cache->space_info->bytes_used -= num_bytes; |
c286ac48 CM |
1400 | btrfs_set_block_group_used(&cache->item, old_val); |
1401 | spin_unlock(&cache->lock); | |
f510cfec CM |
1402 | if (mark_free) { |
1403 | set_extent_dirty(&info->free_space_cache, | |
db94535d | 1404 | bytenr, bytenr + num_bytes - 1, |
f510cfec | 1405 | GFP_NOFS); |
e37c9e69 | 1406 | } |
cd1bc465 | 1407 | } |
db94535d CM |
1408 | total -= num_bytes; |
1409 | bytenr += num_bytes; | |
9078a3e1 CM |
1410 | } |
1411 | return 0; | |
1412 | } | |
6324fbf3 | 1413 | |
a061fc8d CM |
1414 | static u64 first_logical_byte(struct btrfs_root *root, u64 search_start) |
1415 | { | |
1416 | u64 start; | |
1417 | u64 end; | |
1418 | int ret; | |
1419 | ret = find_first_extent_bit(&root->fs_info->block_group_cache, | |
1420 | search_start, &start, &end, | |
1421 | BLOCK_GROUP_DATA | BLOCK_GROUP_METADATA | | |
1422 | BLOCK_GROUP_SYSTEM); | |
1423 | if (ret) | |
1424 | return 0; | |
1425 | return start; | |
1426 | } | |
1427 | ||
1428 | ||
e02119d5 | 1429 | int btrfs_update_pinned_extents(struct btrfs_root *root, |
324ae4df Y |
1430 | u64 bytenr, u64 num, int pin) |
1431 | { | |
1432 | u64 len; | |
1433 | struct btrfs_block_group_cache *cache; | |
1434 | struct btrfs_fs_info *fs_info = root->fs_info; | |
1435 | ||
7d9eb12c | 1436 | WARN_ON(!mutex_is_locked(&root->fs_info->alloc_mutex)); |
324ae4df Y |
1437 | if (pin) { |
1438 | set_extent_dirty(&fs_info->pinned_extents, | |
1439 | bytenr, bytenr + num - 1, GFP_NOFS); | |
1440 | } else { | |
1441 | clear_extent_dirty(&fs_info->pinned_extents, | |
1442 | bytenr, bytenr + num - 1, GFP_NOFS); | |
1443 | } | |
1444 | while (num > 0) { | |
1445 | cache = btrfs_lookup_block_group(fs_info, bytenr); | |
a061fc8d CM |
1446 | if (!cache) { |
1447 | u64 first = first_logical_byte(root, bytenr); | |
1448 | WARN_ON(first < bytenr); | |
1449 | len = min(first - bytenr, num); | |
1450 | } else { | |
1451 | len = min(num, cache->key.offset - | |
1452 | (bytenr - cache->key.objectid)); | |
1453 | } | |
324ae4df | 1454 | if (pin) { |
a061fc8d | 1455 | if (cache) { |
c286ac48 | 1456 | spin_lock(&cache->lock); |
a061fc8d CM |
1457 | cache->pinned += len; |
1458 | cache->space_info->bytes_pinned += len; | |
c286ac48 | 1459 | spin_unlock(&cache->lock); |
a061fc8d | 1460 | } |
324ae4df Y |
1461 | fs_info->total_pinned += len; |
1462 | } else { | |
a061fc8d | 1463 | if (cache) { |
c286ac48 | 1464 | spin_lock(&cache->lock); |
a061fc8d CM |
1465 | cache->pinned -= len; |
1466 | cache->space_info->bytes_pinned -= len; | |
c286ac48 | 1467 | spin_unlock(&cache->lock); |
a061fc8d | 1468 | } |
324ae4df Y |
1469 | fs_info->total_pinned -= len; |
1470 | } | |
1471 | bytenr += len; | |
1472 | num -= len; | |
1473 | } | |
1474 | return 0; | |
1475 | } | |
9078a3e1 | 1476 | |
d1310b2e | 1477 | int btrfs_copy_pinned(struct btrfs_root *root, struct extent_io_tree *copy) |
ccd467d6 | 1478 | { |
ccd467d6 | 1479 | u64 last = 0; |
1a5bc167 CM |
1480 | u64 start; |
1481 | u64 end; | |
d1310b2e | 1482 | struct extent_io_tree *pinned_extents = &root->fs_info->pinned_extents; |
ccd467d6 | 1483 | int ret; |
ccd467d6 CM |
1484 | |
1485 | while(1) { | |
1a5bc167 CM |
1486 | ret = find_first_extent_bit(pinned_extents, last, |
1487 | &start, &end, EXTENT_DIRTY); | |
1488 | if (ret) | |
ccd467d6 | 1489 | break; |
1a5bc167 CM |
1490 | set_extent_dirty(copy, start, end, GFP_NOFS); |
1491 | last = end + 1; | |
ccd467d6 CM |
1492 | } |
1493 | return 0; | |
1494 | } | |
1495 | ||
1496 | int btrfs_finish_extent_commit(struct btrfs_trans_handle *trans, | |
1497 | struct btrfs_root *root, | |
d1310b2e | 1498 | struct extent_io_tree *unpin) |
a28ec197 | 1499 | { |
1a5bc167 CM |
1500 | u64 start; |
1501 | u64 end; | |
a28ec197 | 1502 | int ret; |
d1310b2e | 1503 | struct extent_io_tree *free_space_cache; |
f510cfec | 1504 | free_space_cache = &root->fs_info->free_space_cache; |
a28ec197 | 1505 | |
925baedd | 1506 | mutex_lock(&root->fs_info->alloc_mutex); |
a28ec197 | 1507 | while(1) { |
1a5bc167 CM |
1508 | ret = find_first_extent_bit(unpin, 0, &start, &end, |
1509 | EXTENT_DIRTY); | |
1510 | if (ret) | |
a28ec197 | 1511 | break; |
e02119d5 | 1512 | btrfs_update_pinned_extents(root, start, end + 1 - start, 0); |
1a5bc167 CM |
1513 | clear_extent_dirty(unpin, start, end, GFP_NOFS); |
1514 | set_extent_dirty(free_space_cache, start, end, GFP_NOFS); | |
c286ac48 CM |
1515 | if (need_resched()) { |
1516 | mutex_unlock(&root->fs_info->alloc_mutex); | |
1517 | cond_resched(); | |
1518 | mutex_lock(&root->fs_info->alloc_mutex); | |
1519 | } | |
a28ec197 | 1520 | } |
925baedd | 1521 | mutex_unlock(&root->fs_info->alloc_mutex); |
a28ec197 CM |
1522 | return 0; |
1523 | } | |
1524 | ||
98ed5174 CM |
1525 | static int finish_current_insert(struct btrfs_trans_handle *trans, |
1526 | struct btrfs_root *extent_root) | |
037e6390 | 1527 | { |
7bb86316 CM |
1528 | u64 start; |
1529 | u64 end; | |
1530 | struct btrfs_fs_info *info = extent_root->fs_info; | |
d8d5f3e1 | 1531 | struct extent_buffer *eb; |
7bb86316 | 1532 | struct btrfs_path *path; |
e2fa7227 | 1533 | struct btrfs_key ins; |
d8d5f3e1 | 1534 | struct btrfs_disk_key first; |
234b63a0 | 1535 | struct btrfs_extent_item extent_item; |
037e6390 | 1536 | int ret; |
d8d5f3e1 | 1537 | int level; |
1a5bc167 | 1538 | int err = 0; |
037e6390 | 1539 | |
7d9eb12c | 1540 | WARN_ON(!mutex_is_locked(&extent_root->fs_info->alloc_mutex)); |
5f39d397 | 1541 | btrfs_set_stack_extent_refs(&extent_item, 1); |
62e2749e | 1542 | btrfs_set_key_type(&ins, BTRFS_EXTENT_ITEM_KEY); |
7bb86316 | 1543 | path = btrfs_alloc_path(); |
037e6390 | 1544 | |
26b8003f | 1545 | while(1) { |
1a5bc167 CM |
1546 | ret = find_first_extent_bit(&info->extent_ins, 0, &start, |
1547 | &end, EXTENT_LOCKED); | |
1548 | if (ret) | |
26b8003f CM |
1549 | break; |
1550 | ||
1a5bc167 CM |
1551 | ins.objectid = start; |
1552 | ins.offset = end + 1 - start; | |
1553 | err = btrfs_insert_item(trans, extent_root, &ins, | |
1554 | &extent_item, sizeof(extent_item)); | |
1555 | clear_extent_bits(&info->extent_ins, start, end, EXTENT_LOCKED, | |
1556 | GFP_NOFS); | |
c286ac48 | 1557 | |
e02119d5 | 1558 | eb = btrfs_find_create_tree_block(extent_root, ins.objectid, |
c286ac48 CM |
1559 | ins.offset); |
1560 | ||
e02119d5 | 1561 | if (!btrfs_buffer_uptodate(eb, trans->transid)) |
c286ac48 | 1562 | btrfs_read_buffer(eb, trans->transid); |
c286ac48 | 1563 | |
925baedd | 1564 | btrfs_tree_lock(eb); |
d8d5f3e1 CM |
1565 | level = btrfs_header_level(eb); |
1566 | if (level == 0) { | |
1567 | btrfs_item_key(eb, &first, 0); | |
1568 | } else { | |
1569 | btrfs_node_key(eb, &first, 0); | |
1570 | } | |
925baedd CM |
1571 | btrfs_tree_unlock(eb); |
1572 | free_extent_buffer(eb); | |
1573 | /* | |
1574 | * the first key is just a hint, so the race we've created | |
1575 | * against reading it is fine | |
1576 | */ | |
7bb86316 CM |
1577 | err = btrfs_insert_extent_backref(trans, extent_root, path, |
1578 | start, extent_root->root_key.objectid, | |
f6dbff55 CM |
1579 | 0, level, |
1580 | btrfs_disk_key_objectid(&first)); | |
7bb86316 | 1581 | BUG_ON(err); |
c286ac48 CM |
1582 | if (need_resched()) { |
1583 | mutex_unlock(&extent_root->fs_info->alloc_mutex); | |
1584 | cond_resched(); | |
1585 | mutex_lock(&extent_root->fs_info->alloc_mutex); | |
1586 | } | |
037e6390 | 1587 | } |
7bb86316 | 1588 | btrfs_free_path(path); |
037e6390 CM |
1589 | return 0; |
1590 | } | |
1591 | ||
db94535d | 1592 | static int pin_down_bytes(struct btrfs_root *root, u64 bytenr, u32 num_bytes, |
4bef0848 | 1593 | int is_data, int pending) |
e20d96d6 | 1594 | { |
1a5bc167 | 1595 | int err = 0; |
8ef97622 | 1596 | |
7d9eb12c | 1597 | WARN_ON(!mutex_is_locked(&root->fs_info->alloc_mutex)); |
f4b9aa8d | 1598 | if (!pending) { |
925baedd | 1599 | struct extent_buffer *buf; |
4bef0848 CM |
1600 | |
1601 | if (is_data) | |
1602 | goto pinit; | |
1603 | ||
db94535d | 1604 | buf = btrfs_find_tree_block(root, bytenr, num_bytes); |
5f39d397 | 1605 | if (buf) { |
e02119d5 CM |
1606 | /* we can reuse a block if it hasn't been written |
1607 | * and it is from this transaction. We can't | |
1608 | * reuse anything from the tree log root because | |
1609 | * it has tiny sub-transactions. | |
1610 | */ | |
974e35a8 Y |
1611 | if (btrfs_buffer_uptodate(buf, 0) && |
1612 | btrfs_try_tree_lock(buf)) { | |
2c90e5d6 CM |
1613 | u64 transid = |
1614 | root->fs_info->running_transaction->transid; | |
dc17ff8f CM |
1615 | u64 header_transid = |
1616 | btrfs_header_generation(buf); | |
e02119d5 CM |
1617 | if (btrfs_header_owner(buf) != |
1618 | BTRFS_TREE_LOG_OBJECTID && | |
1619 | header_transid == transid && | |
6bc34676 CM |
1620 | !btrfs_header_flag(buf, |
1621 | BTRFS_HEADER_FLAG_WRITTEN)) { | |
55c69072 | 1622 | clean_tree_block(NULL, root, buf); |
925baedd | 1623 | btrfs_tree_unlock(buf); |
5f39d397 | 1624 | free_extent_buffer(buf); |
c549228f | 1625 | return 1; |
2c90e5d6 | 1626 | } |
925baedd | 1627 | btrfs_tree_unlock(buf); |
f4b9aa8d | 1628 | } |
5f39d397 | 1629 | free_extent_buffer(buf); |
8ef97622 | 1630 | } |
4bef0848 | 1631 | pinit: |
e02119d5 | 1632 | btrfs_update_pinned_extents(root, bytenr, num_bytes, 1); |
f4b9aa8d | 1633 | } else { |
1a5bc167 | 1634 | set_extent_bits(&root->fs_info->pending_del, |
db94535d CM |
1635 | bytenr, bytenr + num_bytes - 1, |
1636 | EXTENT_LOCKED, GFP_NOFS); | |
f4b9aa8d | 1637 | } |
be744175 | 1638 | BUG_ON(err < 0); |
e20d96d6 CM |
1639 | return 0; |
1640 | } | |
1641 | ||
fec577fb | 1642 | /* |
a28ec197 | 1643 | * remove an extent from the root, returns 0 on success |
fec577fb | 1644 | */ |
e089f05c | 1645 | static int __free_extent(struct btrfs_trans_handle *trans, struct btrfs_root |
7bb86316 CM |
1646 | *root, u64 bytenr, u64 num_bytes, |
1647 | u64 root_objectid, u64 ref_generation, | |
1648 | u64 owner_objectid, u64 owner_offset, int pin, | |
e37c9e69 | 1649 | int mark_free) |
a28ec197 | 1650 | { |
5caf2a00 | 1651 | struct btrfs_path *path; |
e2fa7227 | 1652 | struct btrfs_key key; |
1261ec42 CM |
1653 | struct btrfs_fs_info *info = root->fs_info; |
1654 | struct btrfs_root *extent_root = info->extent_root; | |
5f39d397 | 1655 | struct extent_buffer *leaf; |
a28ec197 | 1656 | int ret; |
952fccac CM |
1657 | int extent_slot = 0; |
1658 | int found_extent = 0; | |
1659 | int num_to_del = 1; | |
234b63a0 | 1660 | struct btrfs_extent_item *ei; |
cf27e1ee | 1661 | u32 refs; |
037e6390 | 1662 | |
7d9eb12c | 1663 | WARN_ON(!mutex_is_locked(&root->fs_info->alloc_mutex)); |
db94535d | 1664 | key.objectid = bytenr; |
62e2749e | 1665 | btrfs_set_key_type(&key, BTRFS_EXTENT_ITEM_KEY); |
db94535d | 1666 | key.offset = num_bytes; |
5caf2a00 | 1667 | path = btrfs_alloc_path(); |
54aa1f4d CM |
1668 | if (!path) |
1669 | return -ENOMEM; | |
5f26f772 | 1670 | |
3c12ac72 | 1671 | path->reada = 1; |
7bb86316 CM |
1672 | ret = lookup_extent_backref(trans, extent_root, path, |
1673 | bytenr, root_objectid, | |
1674 | ref_generation, | |
1675 | owner_objectid, owner_offset, 1); | |
1676 | if (ret == 0) { | |
952fccac CM |
1677 | struct btrfs_key found_key; |
1678 | extent_slot = path->slots[0]; | |
1679 | while(extent_slot > 0) { | |
1680 | extent_slot--; | |
1681 | btrfs_item_key_to_cpu(path->nodes[0], &found_key, | |
1682 | extent_slot); | |
1683 | if (found_key.objectid != bytenr) | |
1684 | break; | |
1685 | if (found_key.type == BTRFS_EXTENT_ITEM_KEY && | |
1686 | found_key.offset == num_bytes) { | |
1687 | found_extent = 1; | |
1688 | break; | |
1689 | } | |
1690 | if (path->slots[0] - extent_slot > 5) | |
1691 | break; | |
1692 | } | |
1693 | if (!found_extent) | |
1694 | ret = btrfs_del_item(trans, extent_root, path); | |
7bb86316 CM |
1695 | } else { |
1696 | btrfs_print_leaf(extent_root, path->nodes[0]); | |
1697 | WARN_ON(1); | |
1698 | printk("Unable to find ref byte nr %Lu root %Lu " | |
1699 | " gen %Lu owner %Lu offset %Lu\n", bytenr, | |
1700 | root_objectid, ref_generation, owner_objectid, | |
1701 | owner_offset); | |
1702 | } | |
952fccac CM |
1703 | if (!found_extent) { |
1704 | btrfs_release_path(extent_root, path); | |
1705 | ret = btrfs_search_slot(trans, extent_root, &key, path, -1, 1); | |
1706 | if (ret < 0) | |
1707 | return ret; | |
1708 | BUG_ON(ret); | |
1709 | extent_slot = path->slots[0]; | |
1710 | } | |
5f39d397 CM |
1711 | |
1712 | leaf = path->nodes[0]; | |
952fccac | 1713 | ei = btrfs_item_ptr(leaf, extent_slot, |
123abc88 | 1714 | struct btrfs_extent_item); |
5f39d397 CM |
1715 | refs = btrfs_extent_refs(leaf, ei); |
1716 | BUG_ON(refs == 0); | |
1717 | refs -= 1; | |
1718 | btrfs_set_extent_refs(leaf, ei, refs); | |
952fccac | 1719 | |
5f39d397 CM |
1720 | btrfs_mark_buffer_dirty(leaf); |
1721 | ||
952fccac CM |
1722 | if (refs == 0 && found_extent && path->slots[0] == extent_slot + 1) { |
1723 | /* if the back ref and the extent are next to each other | |
1724 | * they get deleted below in one shot | |
1725 | */ | |
1726 | path->slots[0] = extent_slot; | |
1727 | num_to_del = 2; | |
1728 | } else if (found_extent) { | |
1729 | /* otherwise delete the extent back ref */ | |
1730 | ret = btrfs_del_item(trans, extent_root, path); | |
1731 | BUG_ON(ret); | |
1732 | /* if refs are 0, we need to setup the path for deletion */ | |
1733 | if (refs == 0) { | |
1734 | btrfs_release_path(extent_root, path); | |
1735 | ret = btrfs_search_slot(trans, extent_root, &key, path, | |
1736 | -1, 1); | |
1737 | if (ret < 0) | |
1738 | return ret; | |
1739 | BUG_ON(ret); | |
1740 | } | |
1741 | } | |
1742 | ||
cf27e1ee | 1743 | if (refs == 0) { |
db94535d CM |
1744 | u64 super_used; |
1745 | u64 root_used; | |
21af804c DW |
1746 | #ifdef BIO_RW_DISCARD |
1747 | u64 map_length = num_bytes; | |
1748 | struct btrfs_multi_bio *multi = NULL; | |
1749 | #endif | |
78fae27e CM |
1750 | |
1751 | if (pin) { | |
4bef0848 CM |
1752 | ret = pin_down_bytes(root, bytenr, num_bytes, |
1753 | owner_objectid >= BTRFS_FIRST_FREE_OBJECTID, 0); | |
c549228f Y |
1754 | if (ret > 0) |
1755 | mark_free = 1; | |
1756 | BUG_ON(ret < 0); | |
78fae27e CM |
1757 | } |
1758 | ||
58176a96 | 1759 | /* block accounting for super block */ |
a2135011 | 1760 | spin_lock_irq(&info->delalloc_lock); |
db94535d CM |
1761 | super_used = btrfs_super_bytes_used(&info->super_copy); |
1762 | btrfs_set_super_bytes_used(&info->super_copy, | |
1763 | super_used - num_bytes); | |
a2135011 | 1764 | spin_unlock_irq(&info->delalloc_lock); |
58176a96 JB |
1765 | |
1766 | /* block accounting for root item */ | |
db94535d | 1767 | root_used = btrfs_root_used(&root->root_item); |
5f39d397 | 1768 | btrfs_set_root_used(&root->root_item, |
db94535d | 1769 | root_used - num_bytes); |
952fccac CM |
1770 | ret = btrfs_del_items(trans, extent_root, path, path->slots[0], |
1771 | num_to_del); | |
54aa1f4d CM |
1772 | if (ret) { |
1773 | return ret; | |
1774 | } | |
db94535d | 1775 | ret = update_block_group(trans, root, bytenr, num_bytes, 0, |
0b86a832 | 1776 | mark_free); |
9078a3e1 | 1777 | BUG_ON(ret); |
21af804c DW |
1778 | |
1779 | #ifdef BIO_RW_DISCARD | |
1780 | /* Tell the block device(s) that the sectors can be discarded */ | |
1781 | ret = btrfs_map_block(&root->fs_info->mapping_tree, READ, | |
1782 | bytenr, &map_length, &multi, 0); | |
1783 | if (!ret) { | |
1784 | struct btrfs_bio_stripe *stripe = multi->stripes; | |
1785 | int i; | |
1786 | ||
1787 | if (map_length > num_bytes) | |
1788 | map_length = num_bytes; | |
1789 | ||
1790 | for (i = 0; i < multi->num_stripes; i++, stripe++) { | |
1791 | blkdev_issue_discard(stripe->dev->bdev, | |
1792 | stripe->physical >> 9, | |
1793 | map_length >> 9); | |
1794 | } | |
1795 | kfree(multi); | |
1796 | } | |
1797 | #endif | |
a28ec197 | 1798 | } |
5caf2a00 | 1799 | btrfs_free_path(path); |
e089f05c | 1800 | finish_current_insert(trans, extent_root); |
a28ec197 CM |
1801 | return ret; |
1802 | } | |
1803 | ||
a28ec197 CM |
1804 | /* |
1805 | * find all the blocks marked as pending in the radix tree and remove | |
1806 | * them from the extent map | |
1807 | */ | |
e089f05c CM |
1808 | static int del_pending_extents(struct btrfs_trans_handle *trans, struct |
1809 | btrfs_root *extent_root) | |
a28ec197 CM |
1810 | { |
1811 | int ret; | |
e20d96d6 | 1812 | int err = 0; |
1a5bc167 CM |
1813 | u64 start; |
1814 | u64 end; | |
d1310b2e CM |
1815 | struct extent_io_tree *pending_del; |
1816 | struct extent_io_tree *pinned_extents; | |
8ef97622 | 1817 | |
7d9eb12c | 1818 | WARN_ON(!mutex_is_locked(&extent_root->fs_info->alloc_mutex)); |
1a5bc167 CM |
1819 | pending_del = &extent_root->fs_info->pending_del; |
1820 | pinned_extents = &extent_root->fs_info->pinned_extents; | |
a28ec197 CM |
1821 | |
1822 | while(1) { | |
1a5bc167 CM |
1823 | ret = find_first_extent_bit(pending_del, 0, &start, &end, |
1824 | EXTENT_LOCKED); | |
1825 | if (ret) | |
a28ec197 | 1826 | break; |
1a5bc167 CM |
1827 | clear_extent_bits(pending_del, start, end, EXTENT_LOCKED, |
1828 | GFP_NOFS); | |
c286ac48 CM |
1829 | if (!test_range_bit(&extent_root->fs_info->extent_ins, |
1830 | start, end, EXTENT_LOCKED, 0)) { | |
e02119d5 | 1831 | btrfs_update_pinned_extents(extent_root, start, |
c286ac48 CM |
1832 | end + 1 - start, 1); |
1833 | ret = __free_extent(trans, extent_root, | |
1834 | start, end + 1 - start, | |
1835 | extent_root->root_key.objectid, | |
1836 | 0, 0, 0, 0, 0); | |
1837 | } else { | |
1838 | clear_extent_bits(&extent_root->fs_info->extent_ins, | |
1839 | start, end, EXTENT_LOCKED, GFP_NOFS); | |
1840 | } | |
1a5bc167 CM |
1841 | if (ret) |
1842 | err = ret; | |
c286ac48 CM |
1843 | |
1844 | if (need_resched()) { | |
1845 | mutex_unlock(&extent_root->fs_info->alloc_mutex); | |
1846 | cond_resched(); | |
1847 | mutex_lock(&extent_root->fs_info->alloc_mutex); | |
1848 | } | |
fec577fb | 1849 | } |
e20d96d6 | 1850 | return err; |
fec577fb CM |
1851 | } |
1852 | ||
1853 | /* | |
1854 | * remove an extent from the root, returns 0 on success | |
1855 | */ | |
925baedd CM |
1856 | static int __btrfs_free_extent(struct btrfs_trans_handle *trans, |
1857 | struct btrfs_root *root, u64 bytenr, | |
1858 | u64 num_bytes, u64 root_objectid, | |
1859 | u64 ref_generation, u64 owner_objectid, | |
1860 | u64 owner_offset, int pin) | |
fec577fb | 1861 | { |
9f5fae2f | 1862 | struct btrfs_root *extent_root = root->fs_info->extent_root; |
fec577fb CM |
1863 | int pending_ret; |
1864 | int ret; | |
a28ec197 | 1865 | |
db94535d | 1866 | WARN_ON(num_bytes < root->sectorsize); |
7bb86316 CM |
1867 | if (!root->ref_cows) |
1868 | ref_generation = 0; | |
1869 | ||
fec577fb | 1870 | if (root == extent_root) { |
4bef0848 | 1871 | pin_down_bytes(root, bytenr, num_bytes, 0, 1); |
fec577fb CM |
1872 | return 0; |
1873 | } | |
4bef0848 CM |
1874 | /* if metadata always pin */ |
1875 | if (owner_objectid < BTRFS_FIRST_FREE_OBJECTID) | |
1876 | pin = 1; | |
1877 | ||
1878 | /* if data pin when any transaction has committed this */ | |
1879 | if (ref_generation != trans->transid) | |
1880 | pin = 1; | |
1881 | ||
7bb86316 CM |
1882 | ret = __free_extent(trans, root, bytenr, num_bytes, root_objectid, |
1883 | ref_generation, owner_objectid, owner_offset, | |
1884 | pin, pin == 0); | |
ee6e6504 CM |
1885 | |
1886 | finish_current_insert(trans, root->fs_info->extent_root); | |
e20d96d6 | 1887 | pending_ret = del_pending_extents(trans, root->fs_info->extent_root); |
fec577fb CM |
1888 | return ret ? ret : pending_ret; |
1889 | } | |
1890 | ||
925baedd CM |
1891 | int btrfs_free_extent(struct btrfs_trans_handle *trans, |
1892 | struct btrfs_root *root, u64 bytenr, | |
1893 | u64 num_bytes, u64 root_objectid, | |
1894 | u64 ref_generation, u64 owner_objectid, | |
1895 | u64 owner_offset, int pin) | |
1896 | { | |
1897 | int ret; | |
1898 | ||
1899 | maybe_lock_mutex(root); | |
1900 | ret = __btrfs_free_extent(trans, root, bytenr, num_bytes, | |
1901 | root_objectid, ref_generation, | |
1902 | owner_objectid, owner_offset, pin); | |
1903 | maybe_unlock_mutex(root); | |
1904 | return ret; | |
1905 | } | |
1906 | ||
87ee04eb CM |
1907 | static u64 stripe_align(struct btrfs_root *root, u64 val) |
1908 | { | |
1909 | u64 mask = ((u64)root->stripesize - 1); | |
1910 | u64 ret = (val + mask) & ~mask; | |
1911 | return ret; | |
1912 | } | |
1913 | ||
fec577fb CM |
1914 | /* |
1915 | * walks the btree of allocated extents and find a hole of a given size. | |
1916 | * The key ins is changed to record the hole: | |
1917 | * ins->objectid == block start | |
62e2749e | 1918 | * ins->flags = BTRFS_EXTENT_ITEM_KEY |
fec577fb CM |
1919 | * ins->offset == number of blocks |
1920 | * Any available blocks before search_start are skipped. | |
1921 | */ | |
98ed5174 CM |
1922 | static int noinline find_free_extent(struct btrfs_trans_handle *trans, |
1923 | struct btrfs_root *orig_root, | |
1924 | u64 num_bytes, u64 empty_size, | |
1925 | u64 search_start, u64 search_end, | |
1926 | u64 hint_byte, struct btrfs_key *ins, | |
1927 | u64 exclude_start, u64 exclude_nr, | |
1928 | int data) | |
fec577fb | 1929 | { |
87ee04eb | 1930 | int ret; |
a061fc8d | 1931 | u64 orig_search_start; |
9f5fae2f | 1932 | struct btrfs_root * root = orig_root->fs_info->extent_root; |
f2458e1d | 1933 | struct btrfs_fs_info *info = root->fs_info; |
db94535d | 1934 | u64 total_needed = num_bytes; |
239b14b3 | 1935 | u64 *last_ptr = NULL; |
be08c1b9 | 1936 | struct btrfs_block_group_cache *block_group; |
be744175 | 1937 | int full_scan = 0; |
fbdc762b | 1938 | int wrapped = 0; |
0ef3e66b | 1939 | int chunk_alloc_done = 0; |
239b14b3 | 1940 | int empty_cluster = 2 * 1024 * 1024; |
0ef3e66b | 1941 | int allowed_chunk_alloc = 0; |
fec577fb | 1942 | |
db94535d | 1943 | WARN_ON(num_bytes < root->sectorsize); |
b1a4d965 CM |
1944 | btrfs_set_key_type(ins, BTRFS_EXTENT_ITEM_KEY); |
1945 | ||
0ef3e66b CM |
1946 | if (orig_root->ref_cows || empty_size) |
1947 | allowed_chunk_alloc = 1; | |
1948 | ||
239b14b3 CM |
1949 | if (data & BTRFS_BLOCK_GROUP_METADATA) { |
1950 | last_ptr = &root->fs_info->last_alloc; | |
8790d502 | 1951 | empty_cluster = 256 * 1024; |
239b14b3 CM |
1952 | } |
1953 | ||
1954 | if ((data & BTRFS_BLOCK_GROUP_DATA) && btrfs_test_opt(root, SSD)) { | |
1955 | last_ptr = &root->fs_info->last_data_alloc; | |
1956 | } | |
e02119d5 CM |
1957 | if (root->root_key.objectid == BTRFS_TREE_LOG_OBJECTID) { |
1958 | last_ptr = &root->fs_info->last_log_alloc; | |
1959 | if (!last_ptr == 0 && root->fs_info->last_alloc) { | |
1960 | *last_ptr = root->fs_info->last_alloc + empty_cluster; | |
1961 | } | |
1962 | } | |
239b14b3 CM |
1963 | |
1964 | if (last_ptr) { | |
1965 | if (*last_ptr) | |
1966 | hint_byte = *last_ptr; | |
1967 | else { | |
1968 | empty_size += empty_cluster; | |
1969 | } | |
1970 | } | |
1971 | ||
a061fc8d CM |
1972 | search_start = max(search_start, first_logical_byte(root, 0)); |
1973 | orig_search_start = search_start; | |
1974 | ||
7f93bf8d CM |
1975 | if (search_end == (u64)-1) |
1976 | search_end = btrfs_super_total_bytes(&info->super_copy); | |
0b86a832 | 1977 | |
db94535d | 1978 | if (hint_byte) { |
0ef3e66b | 1979 | block_group = btrfs_lookup_first_block_group(info, hint_byte); |
1a2b2ac7 CM |
1980 | if (!block_group) |
1981 | hint_byte = search_start; | |
c286ac48 | 1982 | block_group = btrfs_find_block_group(root, block_group, |
db94535d | 1983 | hint_byte, data, 1); |
239b14b3 CM |
1984 | if (last_ptr && *last_ptr == 0 && block_group) |
1985 | hint_byte = block_group->key.objectid; | |
be744175 | 1986 | } else { |
c286ac48 | 1987 | block_group = btrfs_find_block_group(root, |
1a2b2ac7 CM |
1988 | trans->block_group, |
1989 | search_start, data, 1); | |
be744175 | 1990 | } |
239b14b3 | 1991 | search_start = max(search_start, hint_byte); |
be744175 | 1992 | |
6702ed49 | 1993 | total_needed += empty_size; |
0b86a832 | 1994 | |
be744175 | 1995 | check_failed: |
70b043f0 | 1996 | if (!block_group) { |
0ef3e66b CM |
1997 | block_group = btrfs_lookup_first_block_group(info, |
1998 | search_start); | |
70b043f0 | 1999 | if (!block_group) |
0ef3e66b | 2000 | block_group = btrfs_lookup_first_block_group(info, |
70b043f0 CM |
2001 | orig_search_start); |
2002 | } | |
0ef3e66b CM |
2003 | if (full_scan && !chunk_alloc_done) { |
2004 | if (allowed_chunk_alloc) { | |
2005 | do_chunk_alloc(trans, root, | |
2006 | num_bytes + 2 * 1024 * 1024, data, 1); | |
2007 | allowed_chunk_alloc = 0; | |
2008 | } else if (block_group && block_group_bits(block_group, data)) { | |
2009 | block_group->space_info->force_alloc = 1; | |
2010 | } | |
2011 | chunk_alloc_done = 1; | |
2012 | } | |
0b86a832 CM |
2013 | ret = find_search_start(root, &block_group, &search_start, |
2014 | total_needed, data); | |
239b14b3 CM |
2015 | if (ret == -ENOSPC && last_ptr && *last_ptr) { |
2016 | *last_ptr = 0; | |
0ef3e66b CM |
2017 | block_group = btrfs_lookup_first_block_group(info, |
2018 | orig_search_start); | |
239b14b3 CM |
2019 | search_start = orig_search_start; |
2020 | ret = find_search_start(root, &block_group, &search_start, | |
2021 | total_needed, data); | |
2022 | } | |
2023 | if (ret == -ENOSPC) | |
2024 | goto enospc; | |
0b86a832 | 2025 | if (ret) |
d548ee51 | 2026 | goto error; |
e19caa5f | 2027 | |
239b14b3 CM |
2028 | if (last_ptr && *last_ptr && search_start != *last_ptr) { |
2029 | *last_ptr = 0; | |
2030 | if (!empty_size) { | |
2031 | empty_size += empty_cluster; | |
2032 | total_needed += empty_size; | |
2033 | } | |
0ef3e66b | 2034 | block_group = btrfs_lookup_first_block_group(info, |
239b14b3 CM |
2035 | orig_search_start); |
2036 | search_start = orig_search_start; | |
2037 | ret = find_search_start(root, &block_group, | |
2038 | &search_start, total_needed, data); | |
2039 | if (ret == -ENOSPC) | |
2040 | goto enospc; | |
2041 | if (ret) | |
2042 | goto error; | |
2043 | } | |
2044 | ||
0b86a832 CM |
2045 | search_start = stripe_align(root, search_start); |
2046 | ins->objectid = search_start; | |
2047 | ins->offset = num_bytes; | |
e37c9e69 | 2048 | |
db94535d | 2049 | if (ins->objectid + num_bytes >= search_end) |
cf67582b | 2050 | goto enospc; |
0b86a832 CM |
2051 | |
2052 | if (ins->objectid + num_bytes > | |
2053 | block_group->key.objectid + block_group->key.offset) { | |
e19caa5f CM |
2054 | search_start = block_group->key.objectid + |
2055 | block_group->key.offset; | |
2056 | goto new_group; | |
2057 | } | |
0b86a832 | 2058 | |
1a5bc167 | 2059 | if (test_range_bit(&info->extent_ins, ins->objectid, |
db94535d CM |
2060 | ins->objectid + num_bytes -1, EXTENT_LOCKED, 0)) { |
2061 | search_start = ins->objectid + num_bytes; | |
1a5bc167 CM |
2062 | goto new_group; |
2063 | } | |
0b86a832 | 2064 | |
1a5bc167 | 2065 | if (test_range_bit(&info->pinned_extents, ins->objectid, |
db94535d CM |
2066 | ins->objectid + num_bytes -1, EXTENT_DIRTY, 0)) { |
2067 | search_start = ins->objectid + num_bytes; | |
1a5bc167 | 2068 | goto new_group; |
fec577fb | 2069 | } |
0b86a832 | 2070 | |
db94535d | 2071 | if (exclude_nr > 0 && (ins->objectid + num_bytes > exclude_start && |
f2654de4 CM |
2072 | ins->objectid < exclude_start + exclude_nr)) { |
2073 | search_start = exclude_start + exclude_nr; | |
2074 | goto new_group; | |
2075 | } | |
0b86a832 | 2076 | |
6324fbf3 | 2077 | if (!(data & BTRFS_BLOCK_GROUP_DATA)) { |
5276aeda | 2078 | block_group = btrfs_lookup_block_group(info, ins->objectid); |
26b8003f CM |
2079 | if (block_group) |
2080 | trans->block_group = block_group; | |
f2458e1d | 2081 | } |
db94535d | 2082 | ins->offset = num_bytes; |
239b14b3 CM |
2083 | if (last_ptr) { |
2084 | *last_ptr = ins->objectid + ins->offset; | |
2085 | if (*last_ptr == | |
2086 | btrfs_super_total_bytes(&root->fs_info->super_copy)) { | |
2087 | *last_ptr = 0; | |
2088 | } | |
2089 | } | |
fec577fb | 2090 | return 0; |
be744175 CM |
2091 | |
2092 | new_group: | |
db94535d | 2093 | if (search_start + num_bytes >= search_end) { |
cf67582b | 2094 | enospc: |
be744175 | 2095 | search_start = orig_search_start; |
fbdc762b CM |
2096 | if (full_scan) { |
2097 | ret = -ENOSPC; | |
2098 | goto error; | |
2099 | } | |
6702ed49 CM |
2100 | if (wrapped) { |
2101 | if (!full_scan) | |
2102 | total_needed -= empty_size; | |
fbdc762b | 2103 | full_scan = 1; |
6702ed49 | 2104 | } else |
fbdc762b | 2105 | wrapped = 1; |
be744175 | 2106 | } |
0ef3e66b | 2107 | block_group = btrfs_lookup_first_block_group(info, search_start); |
fbdc762b | 2108 | cond_resched(); |
c286ac48 | 2109 | block_group = btrfs_find_block_group(root, block_group, |
1a2b2ac7 | 2110 | search_start, data, 0); |
be744175 CM |
2111 | goto check_failed; |
2112 | ||
0f70abe2 | 2113 | error: |
0f70abe2 | 2114 | return ret; |
fec577fb | 2115 | } |
ec44a35c | 2116 | |
e6dcd2dc CM |
2117 | static int __btrfs_reserve_extent(struct btrfs_trans_handle *trans, |
2118 | struct btrfs_root *root, | |
2119 | u64 num_bytes, u64 min_alloc_size, | |
2120 | u64 empty_size, u64 hint_byte, | |
2121 | u64 search_end, struct btrfs_key *ins, | |
2122 | u64 data) | |
fec577fb CM |
2123 | { |
2124 | int ret; | |
fbdc762b | 2125 | u64 search_start = 0; |
8790d502 | 2126 | u64 alloc_profile; |
1261ec42 | 2127 | struct btrfs_fs_info *info = root->fs_info; |
925baedd | 2128 | |
6324fbf3 | 2129 | if (data) { |
8790d502 CM |
2130 | alloc_profile = info->avail_data_alloc_bits & |
2131 | info->data_alloc_profile; | |
2132 | data = BTRFS_BLOCK_GROUP_DATA | alloc_profile; | |
6324fbf3 | 2133 | } else if (root == root->fs_info->chunk_root) { |
8790d502 CM |
2134 | alloc_profile = info->avail_system_alloc_bits & |
2135 | info->system_alloc_profile; | |
2136 | data = BTRFS_BLOCK_GROUP_SYSTEM | alloc_profile; | |
6324fbf3 | 2137 | } else { |
8790d502 CM |
2138 | alloc_profile = info->avail_metadata_alloc_bits & |
2139 | info->metadata_alloc_profile; | |
2140 | data = BTRFS_BLOCK_GROUP_METADATA | alloc_profile; | |
6324fbf3 | 2141 | } |
98d20f67 | 2142 | again: |
a061fc8d | 2143 | data = reduce_alloc_profile(root, data); |
0ef3e66b CM |
2144 | /* |
2145 | * the only place that sets empty_size is btrfs_realloc_node, which | |
2146 | * is not called recursively on allocations | |
2147 | */ | |
2148 | if (empty_size || root->ref_cows) { | |
593060d7 | 2149 | if (!(data & BTRFS_BLOCK_GROUP_METADATA)) { |
6324fbf3 | 2150 | ret = do_chunk_alloc(trans, root->fs_info->extent_root, |
0ef3e66b CM |
2151 | 2 * 1024 * 1024, |
2152 | BTRFS_BLOCK_GROUP_METADATA | | |
2153 | (info->metadata_alloc_profile & | |
2154 | info->avail_metadata_alloc_bits), 0); | |
6324fbf3 CM |
2155 | BUG_ON(ret); |
2156 | } | |
2157 | ret = do_chunk_alloc(trans, root->fs_info->extent_root, | |
0ef3e66b | 2158 | num_bytes + 2 * 1024 * 1024, data, 0); |
6324fbf3 CM |
2159 | BUG_ON(ret); |
2160 | } | |
0b86a832 | 2161 | |
db94535d CM |
2162 | WARN_ON(num_bytes < root->sectorsize); |
2163 | ret = find_free_extent(trans, root, num_bytes, empty_size, | |
2164 | search_start, search_end, hint_byte, ins, | |
26b8003f CM |
2165 | trans->alloc_exclude_start, |
2166 | trans->alloc_exclude_nr, data); | |
3b951516 | 2167 | |
98d20f67 CM |
2168 | if (ret == -ENOSPC && num_bytes > min_alloc_size) { |
2169 | num_bytes = num_bytes >> 1; | |
2170 | num_bytes = max(num_bytes, min_alloc_size); | |
0ef3e66b CM |
2171 | do_chunk_alloc(trans, root->fs_info->extent_root, |
2172 | num_bytes, data, 1); | |
98d20f67 CM |
2173 | goto again; |
2174 | } | |
ec44a35c CM |
2175 | if (ret) { |
2176 | printk("allocation failed flags %Lu\n", data); | |
925baedd | 2177 | BUG(); |
925baedd | 2178 | } |
e6dcd2dc CM |
2179 | clear_extent_dirty(&root->fs_info->free_space_cache, |
2180 | ins->objectid, ins->objectid + ins->offset - 1, | |
2181 | GFP_NOFS); | |
2182 | return 0; | |
2183 | } | |
2184 | ||
65b51a00 CM |
2185 | int btrfs_free_reserved_extent(struct btrfs_root *root, u64 start, u64 len) |
2186 | { | |
2187 | maybe_lock_mutex(root); | |
2188 | set_extent_dirty(&root->fs_info->free_space_cache, | |
2189 | start, start + len - 1, GFP_NOFS); | |
2190 | maybe_unlock_mutex(root); | |
2191 | return 0; | |
2192 | } | |
2193 | ||
e6dcd2dc CM |
2194 | int btrfs_reserve_extent(struct btrfs_trans_handle *trans, |
2195 | struct btrfs_root *root, | |
2196 | u64 num_bytes, u64 min_alloc_size, | |
2197 | u64 empty_size, u64 hint_byte, | |
2198 | u64 search_end, struct btrfs_key *ins, | |
2199 | u64 data) | |
2200 | { | |
2201 | int ret; | |
2202 | maybe_lock_mutex(root); | |
2203 | ret = __btrfs_reserve_extent(trans, root, num_bytes, min_alloc_size, | |
2204 | empty_size, hint_byte, search_end, ins, | |
2205 | data); | |
2206 | maybe_unlock_mutex(root); | |
2207 | return ret; | |
2208 | } | |
2209 | ||
2210 | static int __btrfs_alloc_reserved_extent(struct btrfs_trans_handle *trans, | |
2211 | struct btrfs_root *root, | |
2212 | u64 root_objectid, u64 ref_generation, | |
2213 | u64 owner, u64 owner_offset, | |
2214 | struct btrfs_key *ins) | |
2215 | { | |
2216 | int ret; | |
2217 | int pending_ret; | |
2218 | u64 super_used; | |
2219 | u64 root_used; | |
2220 | u64 num_bytes = ins->offset; | |
2221 | u32 sizes[2]; | |
2222 | struct btrfs_fs_info *info = root->fs_info; | |
2223 | struct btrfs_root *extent_root = info->extent_root; | |
2224 | struct btrfs_extent_item *extent_item; | |
2225 | struct btrfs_extent_ref *ref; | |
2226 | struct btrfs_path *path; | |
2227 | struct btrfs_key keys[2]; | |
fec577fb | 2228 | |
58176a96 | 2229 | /* block accounting for super block */ |
a2135011 | 2230 | spin_lock_irq(&info->delalloc_lock); |
db94535d CM |
2231 | super_used = btrfs_super_bytes_used(&info->super_copy); |
2232 | btrfs_set_super_bytes_used(&info->super_copy, super_used + num_bytes); | |
a2135011 | 2233 | spin_unlock_irq(&info->delalloc_lock); |
26b8003f | 2234 | |
58176a96 | 2235 | /* block accounting for root item */ |
db94535d CM |
2236 | root_used = btrfs_root_used(&root->root_item); |
2237 | btrfs_set_root_used(&root->root_item, root_used + num_bytes); | |
58176a96 | 2238 | |
26b8003f | 2239 | if (root == extent_root) { |
1a5bc167 CM |
2240 | set_extent_bits(&root->fs_info->extent_ins, ins->objectid, |
2241 | ins->objectid + ins->offset - 1, | |
2242 | EXTENT_LOCKED, GFP_NOFS); | |
26b8003f CM |
2243 | goto update_block; |
2244 | } | |
2245 | ||
47e4bb98 CM |
2246 | memcpy(&keys[0], ins, sizeof(*ins)); |
2247 | keys[1].offset = hash_extent_ref(root_objectid, ref_generation, | |
2248 | owner, owner_offset); | |
2249 | keys[1].objectid = ins->objectid; | |
2250 | keys[1].type = BTRFS_EXTENT_REF_KEY; | |
2251 | sizes[0] = sizeof(*extent_item); | |
2252 | sizes[1] = sizeof(*ref); | |
7bb86316 CM |
2253 | |
2254 | path = btrfs_alloc_path(); | |
2255 | BUG_ON(!path); | |
47e4bb98 CM |
2256 | |
2257 | ret = btrfs_insert_empty_items(trans, extent_root, path, keys, | |
2258 | sizes, 2); | |
26b8003f | 2259 | |
ccd467d6 | 2260 | BUG_ON(ret); |
47e4bb98 CM |
2261 | extent_item = btrfs_item_ptr(path->nodes[0], path->slots[0], |
2262 | struct btrfs_extent_item); | |
2263 | btrfs_set_extent_refs(path->nodes[0], extent_item, 1); | |
2264 | ref = btrfs_item_ptr(path->nodes[0], path->slots[0] + 1, | |
2265 | struct btrfs_extent_ref); | |
2266 | ||
2267 | btrfs_set_ref_root(path->nodes[0], ref, root_objectid); | |
2268 | btrfs_set_ref_generation(path->nodes[0], ref, ref_generation); | |
2269 | btrfs_set_ref_objectid(path->nodes[0], ref, owner); | |
2270 | btrfs_set_ref_offset(path->nodes[0], ref, owner_offset); | |
2271 | ||
2272 | btrfs_mark_buffer_dirty(path->nodes[0]); | |
2273 | ||
2274 | trans->alloc_exclude_start = 0; | |
2275 | trans->alloc_exclude_nr = 0; | |
7bb86316 | 2276 | btrfs_free_path(path); |
e089f05c | 2277 | finish_current_insert(trans, extent_root); |
e20d96d6 | 2278 | pending_ret = del_pending_extents(trans, extent_root); |
f510cfec | 2279 | |
925baedd CM |
2280 | if (ret) |
2281 | goto out; | |
e37c9e69 | 2282 | if (pending_ret) { |
925baedd CM |
2283 | ret = pending_ret; |
2284 | goto out; | |
e37c9e69 | 2285 | } |
26b8003f CM |
2286 | |
2287 | update_block: | |
0b86a832 | 2288 | ret = update_block_group(trans, root, ins->objectid, ins->offset, 1, 0); |
f5947066 CM |
2289 | if (ret) { |
2290 | printk("update block group failed for %Lu %Lu\n", | |
2291 | ins->objectid, ins->offset); | |
2292 | BUG(); | |
2293 | } | |
925baedd | 2294 | out: |
e6dcd2dc CM |
2295 | return ret; |
2296 | } | |
2297 | ||
2298 | int btrfs_alloc_reserved_extent(struct btrfs_trans_handle *trans, | |
2299 | struct btrfs_root *root, | |
2300 | u64 root_objectid, u64 ref_generation, | |
2301 | u64 owner, u64 owner_offset, | |
2302 | struct btrfs_key *ins) | |
2303 | { | |
2304 | int ret; | |
2305 | maybe_lock_mutex(root); | |
2306 | ret = __btrfs_alloc_reserved_extent(trans, root, root_objectid, | |
2307 | ref_generation, owner, | |
2308 | owner_offset, ins); | |
2309 | maybe_unlock_mutex(root); | |
2310 | return ret; | |
2311 | } | |
e02119d5 CM |
2312 | |
2313 | /* | |
2314 | * this is used by the tree logging recovery code. It records that | |
2315 | * an extent has been allocated and makes sure to clear the free | |
2316 | * space cache bits as well | |
2317 | */ | |
2318 | int btrfs_alloc_logged_extent(struct btrfs_trans_handle *trans, | |
2319 | struct btrfs_root *root, | |
2320 | u64 root_objectid, u64 ref_generation, | |
2321 | u64 owner, u64 owner_offset, | |
2322 | struct btrfs_key *ins) | |
2323 | { | |
2324 | int ret; | |
2325 | struct btrfs_block_group_cache *block_group; | |
2326 | ||
2327 | maybe_lock_mutex(root); | |
2328 | block_group = btrfs_lookup_block_group(root->fs_info, ins->objectid); | |
2329 | cache_block_group(root, block_group); | |
2330 | ||
2331 | clear_extent_dirty(&root->fs_info->free_space_cache, | |
2332 | ins->objectid, ins->objectid + ins->offset - 1, | |
2333 | GFP_NOFS); | |
2334 | ret = __btrfs_alloc_reserved_extent(trans, root, root_objectid, | |
2335 | ref_generation, owner, | |
2336 | owner_offset, ins); | |
2337 | maybe_unlock_mutex(root); | |
2338 | return ret; | |
2339 | } | |
2340 | ||
e6dcd2dc CM |
2341 | /* |
2342 | * finds a free extent and does all the dirty work required for allocation | |
2343 | * returns the key for the extent through ins, and a tree buffer for | |
2344 | * the first block of the extent through buf. | |
2345 | * | |
2346 | * returns 0 if everything worked, non-zero otherwise. | |
2347 | */ | |
2348 | int btrfs_alloc_extent(struct btrfs_trans_handle *trans, | |
2349 | struct btrfs_root *root, | |
2350 | u64 num_bytes, u64 min_alloc_size, | |
2351 | u64 root_objectid, u64 ref_generation, | |
2352 | u64 owner, u64 owner_offset, | |
2353 | u64 empty_size, u64 hint_byte, | |
2354 | u64 search_end, struct btrfs_key *ins, u64 data) | |
2355 | { | |
2356 | int ret; | |
2357 | ||
2358 | maybe_lock_mutex(root); | |
2359 | ||
2360 | ret = __btrfs_reserve_extent(trans, root, num_bytes, | |
2361 | min_alloc_size, empty_size, hint_byte, | |
2362 | search_end, ins, data); | |
2363 | BUG_ON(ret); | |
2364 | ret = __btrfs_alloc_reserved_extent(trans, root, root_objectid, | |
2365 | ref_generation, owner, | |
2366 | owner_offset, ins); | |
2367 | BUG_ON(ret); | |
2368 | ||
925baedd CM |
2369 | maybe_unlock_mutex(root); |
2370 | return ret; | |
fec577fb | 2371 | } |
65b51a00 CM |
2372 | |
2373 | struct extent_buffer *btrfs_init_new_buffer(struct btrfs_trans_handle *trans, | |
2374 | struct btrfs_root *root, | |
2375 | u64 bytenr, u32 blocksize) | |
2376 | { | |
2377 | struct extent_buffer *buf; | |
2378 | ||
2379 | buf = btrfs_find_create_tree_block(root, bytenr, blocksize); | |
2380 | if (!buf) | |
2381 | return ERR_PTR(-ENOMEM); | |
2382 | btrfs_set_header_generation(buf, trans->transid); | |
2383 | btrfs_tree_lock(buf); | |
2384 | clean_tree_block(trans, root, buf); | |
2385 | btrfs_set_buffer_uptodate(buf); | |
2386 | set_extent_dirty(&trans->transaction->dirty_pages, buf->start, | |
2387 | buf->start + buf->len - 1, GFP_NOFS); | |
2388 | trans->blocks_used++; | |
2389 | return buf; | |
2390 | } | |
2391 | ||
fec577fb CM |
2392 | /* |
2393 | * helper function to allocate a block for a given tree | |
2394 | * returns the tree buffer or NULL. | |
2395 | */ | |
5f39d397 | 2396 | struct extent_buffer *btrfs_alloc_free_block(struct btrfs_trans_handle *trans, |
7bb86316 CM |
2397 | struct btrfs_root *root, |
2398 | u32 blocksize, | |
2399 | u64 root_objectid, | |
2400 | u64 ref_generation, | |
2401 | u64 first_objectid, | |
2402 | int level, | |
2403 | u64 hint, | |
5f39d397 | 2404 | u64 empty_size) |
fec577fb | 2405 | { |
e2fa7227 | 2406 | struct btrfs_key ins; |
fec577fb | 2407 | int ret; |
5f39d397 | 2408 | struct extent_buffer *buf; |
fec577fb | 2409 | |
98d20f67 | 2410 | ret = btrfs_alloc_extent(trans, root, blocksize, blocksize, |
7bb86316 | 2411 | root_objectid, ref_generation, |
f6dbff55 | 2412 | level, first_objectid, empty_size, hint, |
db94535d | 2413 | (u64)-1, &ins, 0); |
fec577fb | 2414 | if (ret) { |
54aa1f4d CM |
2415 | BUG_ON(ret > 0); |
2416 | return ERR_PTR(ret); | |
fec577fb | 2417 | } |
55c69072 | 2418 | |
65b51a00 | 2419 | buf = btrfs_init_new_buffer(trans, root, ins.objectid, blocksize); |
fec577fb CM |
2420 | return buf; |
2421 | } | |
a28ec197 | 2422 | |
e02119d5 CM |
2423 | int btrfs_drop_leaf_ref(struct btrfs_trans_handle *trans, |
2424 | struct btrfs_root *root, struct extent_buffer *leaf) | |
6407bf6d | 2425 | { |
7bb86316 CM |
2426 | u64 leaf_owner; |
2427 | u64 leaf_generation; | |
5f39d397 | 2428 | struct btrfs_key key; |
6407bf6d CM |
2429 | struct btrfs_file_extent_item *fi; |
2430 | int i; | |
2431 | int nritems; | |
2432 | int ret; | |
2433 | ||
5f39d397 CM |
2434 | BUG_ON(!btrfs_is_leaf(leaf)); |
2435 | nritems = btrfs_header_nritems(leaf); | |
7bb86316 CM |
2436 | leaf_owner = btrfs_header_owner(leaf); |
2437 | leaf_generation = btrfs_header_generation(leaf); | |
2438 | ||
6407bf6d | 2439 | for (i = 0; i < nritems; i++) { |
db94535d | 2440 | u64 disk_bytenr; |
e34a5b4f | 2441 | cond_resched(); |
5f39d397 CM |
2442 | |
2443 | btrfs_item_key_to_cpu(leaf, &key, i); | |
2444 | if (btrfs_key_type(&key) != BTRFS_EXTENT_DATA_KEY) | |
6407bf6d CM |
2445 | continue; |
2446 | fi = btrfs_item_ptr(leaf, i, struct btrfs_file_extent_item); | |
5f39d397 CM |
2447 | if (btrfs_file_extent_type(leaf, fi) == |
2448 | BTRFS_FILE_EXTENT_INLINE) | |
236454df | 2449 | continue; |
6407bf6d CM |
2450 | /* |
2451 | * FIXME make sure to insert a trans record that | |
2452 | * repeats the snapshot del on crash | |
2453 | */ | |
db94535d CM |
2454 | disk_bytenr = btrfs_file_extent_disk_bytenr(leaf, fi); |
2455 | if (disk_bytenr == 0) | |
3a686375 | 2456 | continue; |
4a096752 CM |
2457 | |
2458 | mutex_lock(&root->fs_info->alloc_mutex); | |
925baedd | 2459 | ret = __btrfs_free_extent(trans, root, disk_bytenr, |
7bb86316 CM |
2460 | btrfs_file_extent_disk_num_bytes(leaf, fi), |
2461 | leaf_owner, leaf_generation, | |
2462 | key.objectid, key.offset, 0); | |
4a096752 | 2463 | mutex_unlock(&root->fs_info->alloc_mutex); |
2dd3e67b CM |
2464 | |
2465 | atomic_inc(&root->fs_info->throttle_gen); | |
2466 | wake_up(&root->fs_info->transaction_throttle); | |
2467 | cond_resched(); | |
2468 | ||
6407bf6d CM |
2469 | BUG_ON(ret); |
2470 | } | |
2471 | return 0; | |
2472 | } | |
2473 | ||
e02119d5 CM |
2474 | static int noinline cache_drop_leaf_ref(struct btrfs_trans_handle *trans, |
2475 | struct btrfs_root *root, | |
2476 | struct btrfs_leaf_ref *ref) | |
31153d81 YZ |
2477 | { |
2478 | int i; | |
2479 | int ret; | |
2480 | struct btrfs_extent_info *info = ref->extents; | |
2481 | ||
31153d81 YZ |
2482 | for (i = 0; i < ref->nritems; i++) { |
2483 | mutex_lock(&root->fs_info->alloc_mutex); | |
2484 | ret = __btrfs_free_extent(trans, root, | |
2485 | info->bytenr, info->num_bytes, | |
2486 | ref->owner, ref->generation, | |
2487 | info->objectid, info->offset, 0); | |
2488 | mutex_unlock(&root->fs_info->alloc_mutex); | |
2dd3e67b CM |
2489 | |
2490 | atomic_inc(&root->fs_info->throttle_gen); | |
2491 | wake_up(&root->fs_info->transaction_throttle); | |
2492 | cond_resched(); | |
2493 | ||
31153d81 YZ |
2494 | BUG_ON(ret); |
2495 | info++; | |
2496 | } | |
31153d81 YZ |
2497 | |
2498 | return 0; | |
2499 | } | |
2500 | ||
333db94c CM |
2501 | int drop_snap_lookup_refcount(struct btrfs_root *root, u64 start, u64 len, |
2502 | u32 *refs) | |
2503 | { | |
017e5369 | 2504 | int ret; |
f87f057b | 2505 | |
017e5369 | 2506 | ret = lookup_extent_ref(NULL, root, start, len, refs); |
f87f057b CM |
2507 | BUG_ON(ret); |
2508 | ||
2509 | #if 0 // some debugging code in case we see problems here | |
2510 | /* if the refs count is one, it won't get increased again. But | |
2511 | * if the ref count is > 1, someone may be decreasing it at | |
2512 | * the same time we are. | |
2513 | */ | |
2514 | if (*refs != 1) { | |
2515 | struct extent_buffer *eb = NULL; | |
2516 | eb = btrfs_find_create_tree_block(root, start, len); | |
2517 | if (eb) | |
2518 | btrfs_tree_lock(eb); | |
2519 | ||
2520 | mutex_lock(&root->fs_info->alloc_mutex); | |
2521 | ret = lookup_extent_ref(NULL, root, start, len, refs); | |
2522 | BUG_ON(ret); | |
2523 | mutex_unlock(&root->fs_info->alloc_mutex); | |
2524 | ||
2525 | if (eb) { | |
2526 | btrfs_tree_unlock(eb); | |
2527 | free_extent_buffer(eb); | |
2528 | } | |
2529 | if (*refs == 1) { | |
2530 | printk("block %llu went down to one during drop_snap\n", | |
2531 | (unsigned long long)start); | |
2532 | } | |
2533 | ||
2534 | } | |
2535 | #endif | |
2536 | ||
e7a84565 | 2537 | cond_resched(); |
017e5369 | 2538 | return ret; |
333db94c CM |
2539 | } |
2540 | ||
9aca1d51 CM |
2541 | /* |
2542 | * helper function for drop_snapshot, this walks down the tree dropping ref | |
2543 | * counts as it goes. | |
2544 | */ | |
98ed5174 CM |
2545 | static int noinline walk_down_tree(struct btrfs_trans_handle *trans, |
2546 | struct btrfs_root *root, | |
2547 | struct btrfs_path *path, int *level) | |
20524f02 | 2548 | { |
7bb86316 CM |
2549 | u64 root_owner; |
2550 | u64 root_gen; | |
2551 | u64 bytenr; | |
ca7a79ad | 2552 | u64 ptr_gen; |
5f39d397 CM |
2553 | struct extent_buffer *next; |
2554 | struct extent_buffer *cur; | |
7bb86316 | 2555 | struct extent_buffer *parent; |
31153d81 | 2556 | struct btrfs_leaf_ref *ref; |
db94535d | 2557 | u32 blocksize; |
20524f02 CM |
2558 | int ret; |
2559 | u32 refs; | |
2560 | ||
5caf2a00 CM |
2561 | WARN_ON(*level < 0); |
2562 | WARN_ON(*level >= BTRFS_MAX_LEVEL); | |
333db94c | 2563 | ret = drop_snap_lookup_refcount(root, path->nodes[*level]->start, |
db94535d | 2564 | path->nodes[*level]->len, &refs); |
20524f02 CM |
2565 | BUG_ON(ret); |
2566 | if (refs > 1) | |
2567 | goto out; | |
e011599b | 2568 | |
9aca1d51 CM |
2569 | /* |
2570 | * walk down to the last node level and free all the leaves | |
2571 | */ | |
6407bf6d | 2572 | while(*level >= 0) { |
5caf2a00 CM |
2573 | WARN_ON(*level < 0); |
2574 | WARN_ON(*level >= BTRFS_MAX_LEVEL); | |
20524f02 | 2575 | cur = path->nodes[*level]; |
e011599b | 2576 | |
5f39d397 | 2577 | if (btrfs_header_level(cur) != *level) |
2c90e5d6 | 2578 | WARN_ON(1); |
e011599b | 2579 | |
7518a238 | 2580 | if (path->slots[*level] >= |
5f39d397 | 2581 | btrfs_header_nritems(cur)) |
20524f02 | 2582 | break; |
6407bf6d | 2583 | if (*level == 0) { |
e02119d5 | 2584 | ret = btrfs_drop_leaf_ref(trans, root, cur); |
6407bf6d CM |
2585 | BUG_ON(ret); |
2586 | break; | |
2587 | } | |
db94535d | 2588 | bytenr = btrfs_node_blockptr(cur, path->slots[*level]); |
ca7a79ad | 2589 | ptr_gen = btrfs_node_ptr_generation(cur, path->slots[*level]); |
db94535d | 2590 | blocksize = btrfs_level_size(root, *level - 1); |
925baedd | 2591 | |
333db94c | 2592 | ret = drop_snap_lookup_refcount(root, bytenr, blocksize, &refs); |
6407bf6d CM |
2593 | BUG_ON(ret); |
2594 | if (refs != 1) { | |
7bb86316 CM |
2595 | parent = path->nodes[*level]; |
2596 | root_owner = btrfs_header_owner(parent); | |
2597 | root_gen = btrfs_header_generation(parent); | |
20524f02 | 2598 | path->slots[*level]++; |
f87f057b CM |
2599 | |
2600 | mutex_lock(&root->fs_info->alloc_mutex); | |
925baedd | 2601 | ret = __btrfs_free_extent(trans, root, bytenr, |
7bb86316 CM |
2602 | blocksize, root_owner, |
2603 | root_gen, 0, 0, 1); | |
20524f02 | 2604 | BUG_ON(ret); |
f87f057b | 2605 | mutex_unlock(&root->fs_info->alloc_mutex); |
18e35e0a CM |
2606 | |
2607 | atomic_inc(&root->fs_info->throttle_gen); | |
2608 | wake_up(&root->fs_info->transaction_throttle); | |
2dd3e67b | 2609 | cond_resched(); |
18e35e0a | 2610 | |
20524f02 CM |
2611 | continue; |
2612 | } | |
f87f057b CM |
2613 | /* |
2614 | * at this point, we have a single ref, and since the | |
2615 | * only place referencing this extent is a dead root | |
2616 | * the reference count should never go higher. | |
2617 | * So, we don't need to check it again | |
2618 | */ | |
31153d81 YZ |
2619 | if (*level == 1) { |
2620 | struct btrfs_key key; | |
2621 | btrfs_node_key_to_cpu(cur, &key, path->slots[*level]); | |
017e5369 | 2622 | ref = btrfs_lookup_leaf_ref(root, bytenr); |
31153d81 | 2623 | if (ref) { |
e02119d5 | 2624 | ret = cache_drop_leaf_ref(trans, root, ref); |
31153d81 YZ |
2625 | BUG_ON(ret); |
2626 | btrfs_remove_leaf_ref(root, ref); | |
bcc63abb | 2627 | btrfs_free_leaf_ref(root, ref); |
31153d81 YZ |
2628 | *level = 0; |
2629 | break; | |
2630 | } | |
37d1aeee CM |
2631 | if (printk_ratelimit()) |
2632 | printk("leaf ref miss for bytenr %llu\n", | |
2633 | (unsigned long long)bytenr); | |
31153d81 | 2634 | } |
db94535d | 2635 | next = btrfs_find_tree_block(root, bytenr, blocksize); |
1259ab75 | 2636 | if (!next || !btrfs_buffer_uptodate(next, ptr_gen)) { |
5f39d397 | 2637 | free_extent_buffer(next); |
333db94c | 2638 | |
ca7a79ad CM |
2639 | next = read_tree_block(root, bytenr, blocksize, |
2640 | ptr_gen); | |
e7a84565 | 2641 | cond_resched(); |
f87f057b CM |
2642 | #if 0 |
2643 | /* | |
2644 | * this is a debugging check and can go away | |
2645 | * the ref should never go all the way down to 1 | |
2646 | * at this point | |
2647 | */ | |
e6dcd2dc CM |
2648 | ret = lookup_extent_ref(NULL, root, bytenr, blocksize, |
2649 | &refs); | |
e9d0b13b | 2650 | BUG_ON(ret); |
f87f057b CM |
2651 | WARN_ON(refs != 1); |
2652 | #endif | |
e9d0b13b | 2653 | } |
5caf2a00 | 2654 | WARN_ON(*level <= 0); |
83e15a28 | 2655 | if (path->nodes[*level-1]) |
5f39d397 | 2656 | free_extent_buffer(path->nodes[*level-1]); |
20524f02 | 2657 | path->nodes[*level-1] = next; |
5f39d397 | 2658 | *level = btrfs_header_level(next); |
20524f02 | 2659 | path->slots[*level] = 0; |
2dd3e67b | 2660 | cond_resched(); |
20524f02 CM |
2661 | } |
2662 | out: | |
5caf2a00 CM |
2663 | WARN_ON(*level < 0); |
2664 | WARN_ON(*level >= BTRFS_MAX_LEVEL); | |
7bb86316 CM |
2665 | |
2666 | if (path->nodes[*level] == root->node) { | |
7bb86316 | 2667 | parent = path->nodes[*level]; |
31153d81 | 2668 | bytenr = path->nodes[*level]->start; |
7bb86316 CM |
2669 | } else { |
2670 | parent = path->nodes[*level + 1]; | |
31153d81 | 2671 | bytenr = btrfs_node_blockptr(parent, path->slots[*level + 1]); |
7bb86316 CM |
2672 | } |
2673 | ||
31153d81 YZ |
2674 | blocksize = btrfs_level_size(root, *level); |
2675 | root_owner = btrfs_header_owner(parent); | |
7bb86316 | 2676 | root_gen = btrfs_header_generation(parent); |
31153d81 | 2677 | |
f87f057b | 2678 | mutex_lock(&root->fs_info->alloc_mutex); |
31153d81 YZ |
2679 | ret = __btrfs_free_extent(trans, root, bytenr, blocksize, |
2680 | root_owner, root_gen, 0, 0, 1); | |
5f39d397 | 2681 | free_extent_buffer(path->nodes[*level]); |
20524f02 CM |
2682 | path->nodes[*level] = NULL; |
2683 | *level += 1; | |
2684 | BUG_ON(ret); | |
925baedd | 2685 | mutex_unlock(&root->fs_info->alloc_mutex); |
f87f057b | 2686 | |
e7a84565 | 2687 | cond_resched(); |
20524f02 CM |
2688 | return 0; |
2689 | } | |
2690 | ||
9aca1d51 CM |
2691 | /* |
2692 | * helper for dropping snapshots. This walks back up the tree in the path | |
2693 | * to find the first node higher up where we haven't yet gone through | |
2694 | * all the slots | |
2695 | */ | |
98ed5174 CM |
2696 | static int noinline walk_up_tree(struct btrfs_trans_handle *trans, |
2697 | struct btrfs_root *root, | |
2698 | struct btrfs_path *path, int *level) | |
20524f02 | 2699 | { |
7bb86316 CM |
2700 | u64 root_owner; |
2701 | u64 root_gen; | |
2702 | struct btrfs_root_item *root_item = &root->root_item; | |
20524f02 CM |
2703 | int i; |
2704 | int slot; | |
2705 | int ret; | |
9f3a7427 | 2706 | |
234b63a0 | 2707 | for(i = *level; i < BTRFS_MAX_LEVEL - 1 && path->nodes[i]; i++) { |
20524f02 | 2708 | slot = path->slots[i]; |
5f39d397 CM |
2709 | if (slot < btrfs_header_nritems(path->nodes[i]) - 1) { |
2710 | struct extent_buffer *node; | |
2711 | struct btrfs_disk_key disk_key; | |
2712 | node = path->nodes[i]; | |
20524f02 CM |
2713 | path->slots[i]++; |
2714 | *level = i; | |
9f3a7427 | 2715 | WARN_ON(*level == 0); |
5f39d397 | 2716 | btrfs_node_key(node, &disk_key, path->slots[i]); |
9f3a7427 | 2717 | memcpy(&root_item->drop_progress, |
5f39d397 | 2718 | &disk_key, sizeof(disk_key)); |
9f3a7427 | 2719 | root_item->drop_level = i; |
20524f02 CM |
2720 | return 0; |
2721 | } else { | |
7bb86316 CM |
2722 | if (path->nodes[*level] == root->node) { |
2723 | root_owner = root->root_key.objectid; | |
2724 | root_gen = | |
2725 | btrfs_header_generation(path->nodes[*level]); | |
2726 | } else { | |
2727 | struct extent_buffer *node; | |
2728 | node = path->nodes[*level + 1]; | |
2729 | root_owner = btrfs_header_owner(node); | |
2730 | root_gen = btrfs_header_generation(node); | |
2731 | } | |
e089f05c | 2732 | ret = btrfs_free_extent(trans, root, |
db94535d | 2733 | path->nodes[*level]->start, |
7bb86316 CM |
2734 | path->nodes[*level]->len, |
2735 | root_owner, root_gen, 0, 0, 1); | |
6407bf6d | 2736 | BUG_ON(ret); |
5f39d397 | 2737 | free_extent_buffer(path->nodes[*level]); |
83e15a28 | 2738 | path->nodes[*level] = NULL; |
20524f02 | 2739 | *level = i + 1; |
20524f02 CM |
2740 | } |
2741 | } | |
2742 | return 1; | |
2743 | } | |
2744 | ||
9aca1d51 CM |
2745 | /* |
2746 | * drop the reference count on the tree rooted at 'snap'. This traverses | |
2747 | * the tree freeing any blocks that have a ref count of zero after being | |
2748 | * decremented. | |
2749 | */ | |
e089f05c | 2750 | int btrfs_drop_snapshot(struct btrfs_trans_handle *trans, struct btrfs_root |
9f3a7427 | 2751 | *root) |
20524f02 | 2752 | { |
3768f368 | 2753 | int ret = 0; |
9aca1d51 | 2754 | int wret; |
20524f02 | 2755 | int level; |
5caf2a00 | 2756 | struct btrfs_path *path; |
20524f02 CM |
2757 | int i; |
2758 | int orig_level; | |
9f3a7427 | 2759 | struct btrfs_root_item *root_item = &root->root_item; |
20524f02 | 2760 | |
a2135011 | 2761 | WARN_ON(!mutex_is_locked(&root->fs_info->drop_mutex)); |
5caf2a00 CM |
2762 | path = btrfs_alloc_path(); |
2763 | BUG_ON(!path); | |
20524f02 | 2764 | |
5f39d397 | 2765 | level = btrfs_header_level(root->node); |
20524f02 | 2766 | orig_level = level; |
9f3a7427 CM |
2767 | if (btrfs_disk_key_objectid(&root_item->drop_progress) == 0) { |
2768 | path->nodes[level] = root->node; | |
f510cfec | 2769 | extent_buffer_get(root->node); |
9f3a7427 CM |
2770 | path->slots[level] = 0; |
2771 | } else { | |
2772 | struct btrfs_key key; | |
5f39d397 CM |
2773 | struct btrfs_disk_key found_key; |
2774 | struct extent_buffer *node; | |
6702ed49 | 2775 | |
9f3a7427 | 2776 | btrfs_disk_key_to_cpu(&key, &root_item->drop_progress); |
6702ed49 CM |
2777 | level = root_item->drop_level; |
2778 | path->lowest_level = level; | |
9f3a7427 | 2779 | wret = btrfs_search_slot(NULL, root, &key, path, 0, 0); |
6702ed49 | 2780 | if (wret < 0) { |
9f3a7427 CM |
2781 | ret = wret; |
2782 | goto out; | |
2783 | } | |
5f39d397 CM |
2784 | node = path->nodes[level]; |
2785 | btrfs_node_key(node, &found_key, path->slots[level]); | |
2786 | WARN_ON(memcmp(&found_key, &root_item->drop_progress, | |
2787 | sizeof(found_key))); | |
7d9eb12c CM |
2788 | /* |
2789 | * unlock our path, this is safe because only this | |
2790 | * function is allowed to delete this snapshot | |
2791 | */ | |
925baedd CM |
2792 | for (i = 0; i < BTRFS_MAX_LEVEL; i++) { |
2793 | if (path->nodes[i] && path->locks[i]) { | |
2794 | path->locks[i] = 0; | |
2795 | btrfs_tree_unlock(path->nodes[i]); | |
2796 | } | |
2797 | } | |
9f3a7427 | 2798 | } |
20524f02 | 2799 | while(1) { |
5caf2a00 | 2800 | wret = walk_down_tree(trans, root, path, &level); |
9aca1d51 | 2801 | if (wret > 0) |
20524f02 | 2802 | break; |
9aca1d51 CM |
2803 | if (wret < 0) |
2804 | ret = wret; | |
2805 | ||
5caf2a00 | 2806 | wret = walk_up_tree(trans, root, path, &level); |
9aca1d51 | 2807 | if (wret > 0) |
20524f02 | 2808 | break; |
9aca1d51 CM |
2809 | if (wret < 0) |
2810 | ret = wret; | |
e7a84565 CM |
2811 | if (trans->transaction->in_commit) { |
2812 | ret = -EAGAIN; | |
2813 | break; | |
2814 | } | |
18e35e0a | 2815 | atomic_inc(&root->fs_info->throttle_gen); |
017e5369 | 2816 | wake_up(&root->fs_info->transaction_throttle); |
20524f02 | 2817 | } |
83e15a28 | 2818 | for (i = 0; i <= orig_level; i++) { |
5caf2a00 | 2819 | if (path->nodes[i]) { |
5f39d397 | 2820 | free_extent_buffer(path->nodes[i]); |
0f82731f | 2821 | path->nodes[i] = NULL; |
83e15a28 | 2822 | } |
20524f02 | 2823 | } |
9f3a7427 | 2824 | out: |
5caf2a00 | 2825 | btrfs_free_path(path); |
9aca1d51 | 2826 | return ret; |
20524f02 | 2827 | } |
9078a3e1 | 2828 | |
96b5179d | 2829 | int btrfs_free_block_groups(struct btrfs_fs_info *info) |
9078a3e1 | 2830 | { |
96b5179d CM |
2831 | u64 start; |
2832 | u64 end; | |
b97f9203 | 2833 | u64 ptr; |
9078a3e1 | 2834 | int ret; |
925baedd CM |
2835 | |
2836 | mutex_lock(&info->alloc_mutex); | |
9078a3e1 | 2837 | while(1) { |
96b5179d CM |
2838 | ret = find_first_extent_bit(&info->block_group_cache, 0, |
2839 | &start, &end, (unsigned int)-1); | |
2840 | if (ret) | |
9078a3e1 | 2841 | break; |
b97f9203 Y |
2842 | ret = get_state_private(&info->block_group_cache, start, &ptr); |
2843 | if (!ret) | |
2844 | kfree((void *)(unsigned long)ptr); | |
96b5179d CM |
2845 | clear_extent_bits(&info->block_group_cache, start, |
2846 | end, (unsigned int)-1, GFP_NOFS); | |
9078a3e1 | 2847 | } |
e37c9e69 | 2848 | while(1) { |
f510cfec CM |
2849 | ret = find_first_extent_bit(&info->free_space_cache, 0, |
2850 | &start, &end, EXTENT_DIRTY); | |
2851 | if (ret) | |
e37c9e69 | 2852 | break; |
f510cfec CM |
2853 | clear_extent_dirty(&info->free_space_cache, start, |
2854 | end, GFP_NOFS); | |
e37c9e69 | 2855 | } |
925baedd | 2856 | mutex_unlock(&info->alloc_mutex); |
be744175 CM |
2857 | return 0; |
2858 | } | |
2859 | ||
8e7bf94f CM |
2860 | static unsigned long calc_ra(unsigned long start, unsigned long last, |
2861 | unsigned long nr) | |
2862 | { | |
2863 | return min(last, start + nr - 1); | |
2864 | } | |
2865 | ||
98ed5174 CM |
2866 | static int noinline relocate_inode_pages(struct inode *inode, u64 start, |
2867 | u64 len) | |
edbd8d4e CM |
2868 | { |
2869 | u64 page_start; | |
2870 | u64 page_end; | |
edbd8d4e | 2871 | unsigned long last_index; |
edbd8d4e CM |
2872 | unsigned long i; |
2873 | struct page *page; | |
d1310b2e | 2874 | struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree; |
4313b399 | 2875 | struct file_ra_state *ra; |
8e7bf94f CM |
2876 | unsigned long total_read = 0; |
2877 | unsigned long ra_pages; | |
3eaa2885 | 2878 | struct btrfs_ordered_extent *ordered; |
a061fc8d | 2879 | struct btrfs_trans_handle *trans; |
4313b399 CM |
2880 | |
2881 | ra = kzalloc(sizeof(*ra), GFP_NOFS); | |
edbd8d4e CM |
2882 | |
2883 | mutex_lock(&inode->i_mutex); | |
4313b399 | 2884 | i = start >> PAGE_CACHE_SHIFT; |
edbd8d4e CM |
2885 | last_index = (start + len - 1) >> PAGE_CACHE_SHIFT; |
2886 | ||
8e7bf94f CM |
2887 | ra_pages = BTRFS_I(inode)->root->fs_info->bdi.ra_pages; |
2888 | ||
4313b399 | 2889 | file_ra_state_init(ra, inode->i_mapping); |
edbd8d4e | 2890 | |
4313b399 | 2891 | for (; i <= last_index; i++) { |
8e7bf94f CM |
2892 | if (total_read % ra_pages == 0) { |
2893 | btrfs_force_ra(inode->i_mapping, ra, NULL, i, | |
2894 | calc_ra(i, last_index, ra_pages)); | |
2895 | } | |
2896 | total_read++; | |
3eaa2885 CM |
2897 | again: |
2898 | if (((u64)i << PAGE_CACHE_SHIFT) > i_size_read(inode)) | |
a061fc8d | 2899 | goto truncate_racing; |
edbd8d4e | 2900 | page = grab_cache_page(inode->i_mapping, i); |
a061fc8d | 2901 | if (!page) { |
edbd8d4e | 2902 | goto out_unlock; |
a061fc8d | 2903 | } |
edbd8d4e CM |
2904 | if (!PageUptodate(page)) { |
2905 | btrfs_readpage(NULL, page); | |
2906 | lock_page(page); | |
2907 | if (!PageUptodate(page)) { | |
2908 | unlock_page(page); | |
2909 | page_cache_release(page); | |
2910 | goto out_unlock; | |
2911 | } | |
2912 | } | |
ec44a35c | 2913 | wait_on_page_writeback(page); |
3eaa2885 | 2914 | |
edbd8d4e CM |
2915 | page_start = (u64)page->index << PAGE_CACHE_SHIFT; |
2916 | page_end = page_start + PAGE_CACHE_SIZE - 1; | |
d1310b2e | 2917 | lock_extent(io_tree, page_start, page_end, GFP_NOFS); |
edbd8d4e | 2918 | |
3eaa2885 CM |
2919 | ordered = btrfs_lookup_ordered_extent(inode, page_start); |
2920 | if (ordered) { | |
2921 | unlock_extent(io_tree, page_start, page_end, GFP_NOFS); | |
2922 | unlock_page(page); | |
2923 | page_cache_release(page); | |
2924 | btrfs_start_ordered_extent(inode, ordered, 1); | |
2925 | btrfs_put_ordered_extent(ordered); | |
2926 | goto again; | |
2927 | } | |
2928 | set_page_extent_mapped(page); | |
2929 | ||
f87f057b CM |
2930 | /* |
2931 | * make sure page_mkwrite is called for this page if userland | |
2932 | * wants to change it from mmap | |
2933 | */ | |
2934 | clear_page_dirty_for_io(page); | |
3eaa2885 | 2935 | |
ea8c2819 | 2936 | btrfs_set_extent_delalloc(inode, page_start, page_end); |
a061fc8d | 2937 | set_page_dirty(page); |
edbd8d4e | 2938 | |
d1310b2e | 2939 | unlock_extent(io_tree, page_start, page_end, GFP_NOFS); |
edbd8d4e CM |
2940 | unlock_page(page); |
2941 | page_cache_release(page); | |
2942 | } | |
2943 | ||
2944 | out_unlock: | |
3eaa2885 CM |
2945 | /* we have to start the IO in order to get the ordered extents |
2946 | * instantiated. This allows the relocation to code to wait | |
2947 | * for all the ordered extents to hit the disk. | |
2948 | * | |
2949 | * Otherwise, it would constantly loop over the same extents | |
2950 | * because the old ones don't get deleted until the IO is | |
2951 | * started | |
2952 | */ | |
2953 | btrfs_fdatawrite_range(inode->i_mapping, start, start + len - 1, | |
2954 | WB_SYNC_NONE); | |
ec44a35c | 2955 | kfree(ra); |
a061fc8d CM |
2956 | trans = btrfs_start_transaction(BTRFS_I(inode)->root, 1); |
2957 | if (trans) { | |
a061fc8d CM |
2958 | btrfs_end_transaction(trans, BTRFS_I(inode)->root); |
2959 | mark_inode_dirty(inode); | |
2960 | } | |
edbd8d4e CM |
2961 | mutex_unlock(&inode->i_mutex); |
2962 | return 0; | |
a061fc8d CM |
2963 | |
2964 | truncate_racing: | |
2965 | vmtruncate(inode, inode->i_size); | |
2966 | balance_dirty_pages_ratelimited_nr(inode->i_mapping, | |
2967 | total_read); | |
2968 | goto out_unlock; | |
edbd8d4e CM |
2969 | } |
2970 | ||
bf4ef679 CM |
2971 | /* |
2972 | * The back references tell us which tree holds a ref on a block, | |
2973 | * but it is possible for the tree root field in the reference to | |
2974 | * reflect the original root before a snapshot was made. In this | |
2975 | * case we should search through all the children of a given root | |
2976 | * to find potential holders of references on a block. | |
2977 | * | |
2978 | * Instead, we do something a little less fancy and just search | |
2979 | * all the roots for a given key/block combination. | |
2980 | */ | |
2981 | static int find_root_for_ref(struct btrfs_root *root, | |
2982 | struct btrfs_path *path, | |
2983 | struct btrfs_key *key0, | |
2984 | int level, | |
2985 | int file_key, | |
2986 | struct btrfs_root **found_root, | |
2987 | u64 bytenr) | |
2988 | { | |
2989 | struct btrfs_key root_location; | |
2990 | struct btrfs_root *cur_root = *found_root; | |
2991 | struct btrfs_file_extent_item *file_extent; | |
2992 | u64 root_search_start = BTRFS_FS_TREE_OBJECTID; | |
2993 | u64 found_bytenr; | |
2994 | int ret; | |
bf4ef679 CM |
2995 | |
2996 | root_location.offset = (u64)-1; | |
2997 | root_location.type = BTRFS_ROOT_ITEM_KEY; | |
2998 | path->lowest_level = level; | |
2999 | path->reada = 0; | |
3000 | while(1) { | |
3001 | ret = btrfs_search_slot(NULL, cur_root, key0, path, 0, 0); | |
3002 | found_bytenr = 0; | |
3003 | if (ret == 0 && file_key) { | |
3004 | struct extent_buffer *leaf = path->nodes[0]; | |
3005 | file_extent = btrfs_item_ptr(leaf, path->slots[0], | |
3006 | struct btrfs_file_extent_item); | |
3007 | if (btrfs_file_extent_type(leaf, file_extent) == | |
3008 | BTRFS_FILE_EXTENT_REG) { | |
3009 | found_bytenr = | |
3010 | btrfs_file_extent_disk_bytenr(leaf, | |
3011 | file_extent); | |
3012 | } | |
323da79c | 3013 | } else if (!file_key) { |
bf4ef679 CM |
3014 | if (path->nodes[level]) |
3015 | found_bytenr = path->nodes[level]->start; | |
3016 | } | |
3017 | ||
bf4ef679 CM |
3018 | btrfs_release_path(cur_root, path); |
3019 | ||
3020 | if (found_bytenr == bytenr) { | |
3021 | *found_root = cur_root; | |
3022 | ret = 0; | |
3023 | goto out; | |
3024 | } | |
3025 | ret = btrfs_search_root(root->fs_info->tree_root, | |
3026 | root_search_start, &root_search_start); | |
3027 | if (ret) | |
3028 | break; | |
3029 | ||
3030 | root_location.objectid = root_search_start; | |
3031 | cur_root = btrfs_read_fs_root_no_name(root->fs_info, | |
3032 | &root_location); | |
3033 | if (!cur_root) { | |
3034 | ret = 1; | |
3035 | break; | |
3036 | } | |
3037 | } | |
3038 | out: | |
3039 | path->lowest_level = 0; | |
3040 | return ret; | |
3041 | } | |
3042 | ||
4313b399 CM |
3043 | /* |
3044 | * note, this releases the path | |
3045 | */ | |
98ed5174 | 3046 | static int noinline relocate_one_reference(struct btrfs_root *extent_root, |
edbd8d4e | 3047 | struct btrfs_path *path, |
0ef3e66b CM |
3048 | struct btrfs_key *extent_key, |
3049 | u64 *last_file_objectid, | |
3050 | u64 *last_file_offset, | |
3051 | u64 *last_file_root, | |
3052 | u64 last_extent) | |
edbd8d4e CM |
3053 | { |
3054 | struct inode *inode; | |
3055 | struct btrfs_root *found_root; | |
bf4ef679 CM |
3056 | struct btrfs_key root_location; |
3057 | struct btrfs_key found_key; | |
4313b399 CM |
3058 | struct btrfs_extent_ref *ref; |
3059 | u64 ref_root; | |
3060 | u64 ref_gen; | |
3061 | u64 ref_objectid; | |
3062 | u64 ref_offset; | |
edbd8d4e | 3063 | int ret; |
bf4ef679 | 3064 | int level; |
edbd8d4e | 3065 | |
7d9eb12c CM |
3066 | WARN_ON(!mutex_is_locked(&extent_root->fs_info->alloc_mutex)); |
3067 | ||
4313b399 CM |
3068 | ref = btrfs_item_ptr(path->nodes[0], path->slots[0], |
3069 | struct btrfs_extent_ref); | |
3070 | ref_root = btrfs_ref_root(path->nodes[0], ref); | |
3071 | ref_gen = btrfs_ref_generation(path->nodes[0], ref); | |
3072 | ref_objectid = btrfs_ref_objectid(path->nodes[0], ref); | |
3073 | ref_offset = btrfs_ref_offset(path->nodes[0], ref); | |
3074 | btrfs_release_path(extent_root, path); | |
3075 | ||
bf4ef679 | 3076 | root_location.objectid = ref_root; |
edbd8d4e | 3077 | if (ref_gen == 0) |
bf4ef679 | 3078 | root_location.offset = 0; |
edbd8d4e | 3079 | else |
bf4ef679 CM |
3080 | root_location.offset = (u64)-1; |
3081 | root_location.type = BTRFS_ROOT_ITEM_KEY; | |
edbd8d4e CM |
3082 | |
3083 | found_root = btrfs_read_fs_root_no_name(extent_root->fs_info, | |
bf4ef679 | 3084 | &root_location); |
edbd8d4e | 3085 | BUG_ON(!found_root); |
7d9eb12c | 3086 | mutex_unlock(&extent_root->fs_info->alloc_mutex); |
edbd8d4e CM |
3087 | |
3088 | if (ref_objectid >= BTRFS_FIRST_FREE_OBJECTID) { | |
bf4ef679 CM |
3089 | found_key.objectid = ref_objectid; |
3090 | found_key.type = BTRFS_EXTENT_DATA_KEY; | |
3091 | found_key.offset = ref_offset; | |
3092 | level = 0; | |
3093 | ||
0ef3e66b CM |
3094 | if (last_extent == extent_key->objectid && |
3095 | *last_file_objectid == ref_objectid && | |
3096 | *last_file_offset == ref_offset && | |
3097 | *last_file_root == ref_root) | |
3098 | goto out; | |
3099 | ||
bf4ef679 CM |
3100 | ret = find_root_for_ref(extent_root, path, &found_key, |
3101 | level, 1, &found_root, | |
3102 | extent_key->objectid); | |
3103 | ||
3104 | if (ret) | |
3105 | goto out; | |
3106 | ||
0ef3e66b CM |
3107 | if (last_extent == extent_key->objectid && |
3108 | *last_file_objectid == ref_objectid && | |
3109 | *last_file_offset == ref_offset && | |
3110 | *last_file_root == ref_root) | |
3111 | goto out; | |
3112 | ||
edbd8d4e CM |
3113 | inode = btrfs_iget_locked(extent_root->fs_info->sb, |
3114 | ref_objectid, found_root); | |
3115 | if (inode->i_state & I_NEW) { | |
3116 | /* the inode and parent dir are two different roots */ | |
3117 | BTRFS_I(inode)->root = found_root; | |
3118 | BTRFS_I(inode)->location.objectid = ref_objectid; | |
3119 | BTRFS_I(inode)->location.type = BTRFS_INODE_ITEM_KEY; | |
3120 | BTRFS_I(inode)->location.offset = 0; | |
3121 | btrfs_read_locked_inode(inode); | |
3122 | unlock_new_inode(inode); | |
3123 | ||
3124 | } | |
3125 | /* this can happen if the reference is not against | |
3126 | * the latest version of the tree root | |
3127 | */ | |
7d9eb12c | 3128 | if (is_bad_inode(inode)) |
edbd8d4e | 3129 | goto out; |
7d9eb12c | 3130 | |
0ef3e66b CM |
3131 | *last_file_objectid = inode->i_ino; |
3132 | *last_file_root = found_root->root_key.objectid; | |
3133 | *last_file_offset = ref_offset; | |
3134 | ||
edbd8d4e | 3135 | relocate_inode_pages(inode, ref_offset, extent_key->offset); |
edbd8d4e | 3136 | iput(inode); |
edbd8d4e CM |
3137 | } else { |
3138 | struct btrfs_trans_handle *trans; | |
edbd8d4e | 3139 | struct extent_buffer *eb; |
7d9eb12c | 3140 | int needs_lock = 0; |
edbd8d4e | 3141 | |
edbd8d4e | 3142 | eb = read_tree_block(found_root, extent_key->objectid, |
ca7a79ad | 3143 | extent_key->offset, 0); |
925baedd | 3144 | btrfs_tree_lock(eb); |
edbd8d4e CM |
3145 | level = btrfs_header_level(eb); |
3146 | ||
3147 | if (level == 0) | |
3148 | btrfs_item_key_to_cpu(eb, &found_key, 0); | |
3149 | else | |
3150 | btrfs_node_key_to_cpu(eb, &found_key, 0); | |
3151 | ||
925baedd | 3152 | btrfs_tree_unlock(eb); |
edbd8d4e CM |
3153 | free_extent_buffer(eb); |
3154 | ||
bf4ef679 CM |
3155 | ret = find_root_for_ref(extent_root, path, &found_key, |
3156 | level, 0, &found_root, | |
3157 | extent_key->objectid); | |
3158 | ||
3159 | if (ret) | |
3160 | goto out; | |
3161 | ||
7d9eb12c CM |
3162 | /* |
3163 | * right here almost anything could happen to our key, | |
3164 | * but that's ok. The cow below will either relocate it | |
3165 | * or someone else will have relocated it. Either way, | |
3166 | * it is in a different spot than it was before and | |
3167 | * we're happy. | |
3168 | */ | |
3169 | ||
bf4ef679 CM |
3170 | trans = btrfs_start_transaction(found_root, 1); |
3171 | ||
7d9eb12c CM |
3172 | if (found_root == extent_root->fs_info->extent_root || |
3173 | found_root == extent_root->fs_info->chunk_root || | |
3174 | found_root == extent_root->fs_info->dev_root) { | |
3175 | needs_lock = 1; | |
3176 | mutex_lock(&extent_root->fs_info->alloc_mutex); | |
3177 | } | |
3178 | ||
edbd8d4e | 3179 | path->lowest_level = level; |
8f662a76 | 3180 | path->reada = 2; |
edbd8d4e CM |
3181 | ret = btrfs_search_slot(trans, found_root, &found_key, path, |
3182 | 0, 1); | |
3183 | path->lowest_level = 0; | |
edbd8d4e | 3184 | btrfs_release_path(found_root, path); |
7d9eb12c | 3185 | |
0ef3e66b CM |
3186 | if (found_root == found_root->fs_info->extent_root) |
3187 | btrfs_extent_post_op(trans, found_root); | |
7d9eb12c CM |
3188 | if (needs_lock) |
3189 | mutex_unlock(&extent_root->fs_info->alloc_mutex); | |
3190 | ||
edbd8d4e | 3191 | btrfs_end_transaction(trans, found_root); |
edbd8d4e | 3192 | |
7d9eb12c | 3193 | } |
edbd8d4e | 3194 | out: |
7d9eb12c | 3195 | mutex_lock(&extent_root->fs_info->alloc_mutex); |
edbd8d4e CM |
3196 | return 0; |
3197 | } | |
3198 | ||
a061fc8d CM |
3199 | static int noinline del_extent_zero(struct btrfs_root *extent_root, |
3200 | struct btrfs_path *path, | |
3201 | struct btrfs_key *extent_key) | |
3202 | { | |
3203 | int ret; | |
3204 | struct btrfs_trans_handle *trans; | |
3205 | ||
3206 | trans = btrfs_start_transaction(extent_root, 1); | |
3207 | ret = btrfs_search_slot(trans, extent_root, extent_key, path, -1, 1); | |
3208 | if (ret > 0) { | |
3209 | ret = -EIO; | |
3210 | goto out; | |
3211 | } | |
3212 | if (ret < 0) | |
3213 | goto out; | |
3214 | ret = btrfs_del_item(trans, extent_root, path); | |
3215 | out: | |
3216 | btrfs_end_transaction(trans, extent_root); | |
3217 | return ret; | |
3218 | } | |
3219 | ||
98ed5174 CM |
3220 | static int noinline relocate_one_extent(struct btrfs_root *extent_root, |
3221 | struct btrfs_path *path, | |
3222 | struct btrfs_key *extent_key) | |
edbd8d4e CM |
3223 | { |
3224 | struct btrfs_key key; | |
3225 | struct btrfs_key found_key; | |
edbd8d4e | 3226 | struct extent_buffer *leaf; |
0ef3e66b CM |
3227 | u64 last_file_objectid = 0; |
3228 | u64 last_file_root = 0; | |
3229 | u64 last_file_offset = (u64)-1; | |
3230 | u64 last_extent = 0; | |
edbd8d4e CM |
3231 | u32 nritems; |
3232 | u32 item_size; | |
3233 | int ret = 0; | |
3234 | ||
a061fc8d CM |
3235 | if (extent_key->objectid == 0) { |
3236 | ret = del_extent_zero(extent_root, path, extent_key); | |
3237 | goto out; | |
3238 | } | |
edbd8d4e CM |
3239 | key.objectid = extent_key->objectid; |
3240 | key.type = BTRFS_EXTENT_REF_KEY; | |
3241 | key.offset = 0; | |
3242 | ||
3243 | while(1) { | |
3244 | ret = btrfs_search_slot(NULL, extent_root, &key, path, 0, 0); | |
3245 | ||
edbd8d4e CM |
3246 | if (ret < 0) |
3247 | goto out; | |
3248 | ||
3249 | ret = 0; | |
3250 | leaf = path->nodes[0]; | |
3251 | nritems = btrfs_header_nritems(leaf); | |
a061fc8d CM |
3252 | if (path->slots[0] == nritems) { |
3253 | ret = btrfs_next_leaf(extent_root, path); | |
3254 | if (ret > 0) { | |
3255 | ret = 0; | |
3256 | goto out; | |
3257 | } | |
3258 | if (ret < 0) | |
3259 | goto out; | |
bf4ef679 | 3260 | leaf = path->nodes[0]; |
a061fc8d | 3261 | } |
edbd8d4e CM |
3262 | |
3263 | btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]); | |
a061fc8d | 3264 | if (found_key.objectid != extent_key->objectid) { |
edbd8d4e | 3265 | break; |
a061fc8d | 3266 | } |
edbd8d4e | 3267 | |
a061fc8d | 3268 | if (found_key.type != BTRFS_EXTENT_REF_KEY) { |
edbd8d4e | 3269 | break; |
a061fc8d | 3270 | } |
edbd8d4e CM |
3271 | |
3272 | key.offset = found_key.offset + 1; | |
3273 | item_size = btrfs_item_size_nr(leaf, path->slots[0]); | |
3274 | ||
0ef3e66b CM |
3275 | ret = relocate_one_reference(extent_root, path, extent_key, |
3276 | &last_file_objectid, | |
3277 | &last_file_offset, | |
3278 | &last_file_root, last_extent); | |
edbd8d4e CM |
3279 | if (ret) |
3280 | goto out; | |
0ef3e66b | 3281 | last_extent = extent_key->objectid; |
edbd8d4e CM |
3282 | } |
3283 | ret = 0; | |
3284 | out: | |
3285 | btrfs_release_path(extent_root, path); | |
3286 | return ret; | |
3287 | } | |
3288 | ||
ec44a35c CM |
3289 | static u64 update_block_group_flags(struct btrfs_root *root, u64 flags) |
3290 | { | |
3291 | u64 num_devices; | |
3292 | u64 stripped = BTRFS_BLOCK_GROUP_RAID0 | | |
3293 | BTRFS_BLOCK_GROUP_RAID1 | BTRFS_BLOCK_GROUP_RAID10; | |
3294 | ||
a061fc8d | 3295 | num_devices = root->fs_info->fs_devices->num_devices; |
ec44a35c CM |
3296 | if (num_devices == 1) { |
3297 | stripped |= BTRFS_BLOCK_GROUP_DUP; | |
3298 | stripped = flags & ~stripped; | |
3299 | ||
3300 | /* turn raid0 into single device chunks */ | |
3301 | if (flags & BTRFS_BLOCK_GROUP_RAID0) | |
3302 | return stripped; | |
3303 | ||
3304 | /* turn mirroring into duplication */ | |
3305 | if (flags & (BTRFS_BLOCK_GROUP_RAID1 | | |
3306 | BTRFS_BLOCK_GROUP_RAID10)) | |
3307 | return stripped | BTRFS_BLOCK_GROUP_DUP; | |
3308 | return flags; | |
3309 | } else { | |
3310 | /* they already had raid on here, just return */ | |
ec44a35c CM |
3311 | if (flags & stripped) |
3312 | return flags; | |
3313 | ||
3314 | stripped |= BTRFS_BLOCK_GROUP_DUP; | |
3315 | stripped = flags & ~stripped; | |
3316 | ||
3317 | /* switch duplicated blocks with raid1 */ | |
3318 | if (flags & BTRFS_BLOCK_GROUP_DUP) | |
3319 | return stripped | BTRFS_BLOCK_GROUP_RAID1; | |
3320 | ||
3321 | /* turn single device chunks into raid0 */ | |
3322 | return stripped | BTRFS_BLOCK_GROUP_RAID0; | |
3323 | } | |
3324 | return flags; | |
3325 | } | |
3326 | ||
0ef3e66b CM |
3327 | int __alloc_chunk_for_shrink(struct btrfs_root *root, |
3328 | struct btrfs_block_group_cache *shrink_block_group, | |
3329 | int force) | |
3330 | { | |
3331 | struct btrfs_trans_handle *trans; | |
3332 | u64 new_alloc_flags; | |
3333 | u64 calc; | |
3334 | ||
c286ac48 | 3335 | spin_lock(&shrink_block_group->lock); |
0ef3e66b | 3336 | if (btrfs_block_group_used(&shrink_block_group->item) > 0) { |
c286ac48 | 3337 | spin_unlock(&shrink_block_group->lock); |
7d9eb12c | 3338 | mutex_unlock(&root->fs_info->alloc_mutex); |
c286ac48 | 3339 | |
0ef3e66b | 3340 | trans = btrfs_start_transaction(root, 1); |
7d9eb12c | 3341 | mutex_lock(&root->fs_info->alloc_mutex); |
c286ac48 | 3342 | spin_lock(&shrink_block_group->lock); |
7d9eb12c | 3343 | |
0ef3e66b CM |
3344 | new_alloc_flags = update_block_group_flags(root, |
3345 | shrink_block_group->flags); | |
3346 | if (new_alloc_flags != shrink_block_group->flags) { | |
3347 | calc = | |
3348 | btrfs_block_group_used(&shrink_block_group->item); | |
3349 | } else { | |
3350 | calc = shrink_block_group->key.offset; | |
3351 | } | |
c286ac48 CM |
3352 | spin_unlock(&shrink_block_group->lock); |
3353 | ||
0ef3e66b CM |
3354 | do_chunk_alloc(trans, root->fs_info->extent_root, |
3355 | calc + 2 * 1024 * 1024, new_alloc_flags, force); | |
7d9eb12c CM |
3356 | |
3357 | mutex_unlock(&root->fs_info->alloc_mutex); | |
0ef3e66b | 3358 | btrfs_end_transaction(trans, root); |
7d9eb12c | 3359 | mutex_lock(&root->fs_info->alloc_mutex); |
c286ac48 CM |
3360 | } else |
3361 | spin_unlock(&shrink_block_group->lock); | |
0ef3e66b CM |
3362 | return 0; |
3363 | } | |
3364 | ||
8f18cf13 | 3365 | int btrfs_shrink_extent_tree(struct btrfs_root *root, u64 shrink_start) |
edbd8d4e CM |
3366 | { |
3367 | struct btrfs_trans_handle *trans; | |
3368 | struct btrfs_root *tree_root = root->fs_info->tree_root; | |
3369 | struct btrfs_path *path; | |
3370 | u64 cur_byte; | |
3371 | u64 total_found; | |
8f18cf13 CM |
3372 | u64 shrink_last_byte; |
3373 | struct btrfs_block_group_cache *shrink_block_group; | |
edbd8d4e | 3374 | struct btrfs_fs_info *info = root->fs_info; |
edbd8d4e | 3375 | struct btrfs_key key; |
73e48b27 | 3376 | struct btrfs_key found_key; |
edbd8d4e CM |
3377 | struct extent_buffer *leaf; |
3378 | u32 nritems; | |
3379 | int ret; | |
a061fc8d | 3380 | int progress; |
edbd8d4e | 3381 | |
925baedd | 3382 | mutex_lock(&root->fs_info->alloc_mutex); |
8f18cf13 CM |
3383 | shrink_block_group = btrfs_lookup_block_group(root->fs_info, |
3384 | shrink_start); | |
3385 | BUG_ON(!shrink_block_group); | |
3386 | ||
0ef3e66b CM |
3387 | shrink_last_byte = shrink_block_group->key.objectid + |
3388 | shrink_block_group->key.offset; | |
8f18cf13 CM |
3389 | |
3390 | shrink_block_group->space_info->total_bytes -= | |
3391 | shrink_block_group->key.offset; | |
edbd8d4e CM |
3392 | path = btrfs_alloc_path(); |
3393 | root = root->fs_info->extent_root; | |
8f662a76 | 3394 | path->reada = 2; |
edbd8d4e | 3395 | |
323da79c CM |
3396 | printk("btrfs relocating block group %llu flags %llu\n", |
3397 | (unsigned long long)shrink_start, | |
3398 | (unsigned long long)shrink_block_group->flags); | |
3399 | ||
0ef3e66b CM |
3400 | __alloc_chunk_for_shrink(root, shrink_block_group, 1); |
3401 | ||
edbd8d4e | 3402 | again: |
323da79c | 3403 | |
8f18cf13 CM |
3404 | shrink_block_group->ro = 1; |
3405 | ||
edbd8d4e | 3406 | total_found = 0; |
a061fc8d | 3407 | progress = 0; |
8f18cf13 | 3408 | key.objectid = shrink_start; |
edbd8d4e CM |
3409 | key.offset = 0; |
3410 | key.type = 0; | |
73e48b27 | 3411 | cur_byte = key.objectid; |
4313b399 | 3412 | |
ea8c2819 CM |
3413 | mutex_unlock(&root->fs_info->alloc_mutex); |
3414 | ||
3415 | btrfs_start_delalloc_inodes(root); | |
7ea394f1 | 3416 | btrfs_wait_ordered_extents(tree_root, 0); |
ea8c2819 CM |
3417 | |
3418 | mutex_lock(&root->fs_info->alloc_mutex); | |
3419 | ||
73e48b27 Y |
3420 | ret = btrfs_search_slot(NULL, root, &key, path, 0, 0); |
3421 | if (ret < 0) | |
3422 | goto out; | |
3423 | ||
0b86a832 | 3424 | ret = btrfs_previous_item(root, path, 0, BTRFS_EXTENT_ITEM_KEY); |
73e48b27 Y |
3425 | if (ret < 0) |
3426 | goto out; | |
8f18cf13 | 3427 | |
73e48b27 Y |
3428 | if (ret == 0) { |
3429 | leaf = path->nodes[0]; | |
3430 | btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]); | |
8f18cf13 CM |
3431 | if (found_key.objectid + found_key.offset > shrink_start && |
3432 | found_key.objectid < shrink_last_byte) { | |
73e48b27 Y |
3433 | cur_byte = found_key.objectid; |
3434 | key.objectid = cur_byte; | |
3435 | } | |
3436 | } | |
3437 | btrfs_release_path(root, path); | |
3438 | ||
3439 | while(1) { | |
edbd8d4e CM |
3440 | ret = btrfs_search_slot(NULL, root, &key, path, 0, 0); |
3441 | if (ret < 0) | |
3442 | goto out; | |
73e48b27 | 3443 | |
7d9eb12c | 3444 | next: |
edbd8d4e | 3445 | leaf = path->nodes[0]; |
73e48b27 | 3446 | nritems = btrfs_header_nritems(leaf); |
73e48b27 Y |
3447 | if (path->slots[0] >= nritems) { |
3448 | ret = btrfs_next_leaf(root, path); | |
3449 | if (ret < 0) | |
3450 | goto out; | |
3451 | if (ret == 1) { | |
3452 | ret = 0; | |
3453 | break; | |
edbd8d4e | 3454 | } |
73e48b27 Y |
3455 | leaf = path->nodes[0]; |
3456 | nritems = btrfs_header_nritems(leaf); | |
edbd8d4e | 3457 | } |
73e48b27 Y |
3458 | |
3459 | btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]); | |
725c8463 | 3460 | |
8f18cf13 CM |
3461 | if (found_key.objectid >= shrink_last_byte) |
3462 | break; | |
3463 | ||
725c8463 CM |
3464 | if (progress && need_resched()) { |
3465 | memcpy(&key, &found_key, sizeof(key)); | |
725c8463 | 3466 | cond_resched(); |
725c8463 CM |
3467 | btrfs_release_path(root, path); |
3468 | btrfs_search_slot(NULL, root, &key, path, 0, 0); | |
3469 | progress = 0; | |
3470 | goto next; | |
3471 | } | |
3472 | progress = 1; | |
3473 | ||
73e48b27 Y |
3474 | if (btrfs_key_type(&found_key) != BTRFS_EXTENT_ITEM_KEY || |
3475 | found_key.objectid + found_key.offset <= cur_byte) { | |
0ef3e66b CM |
3476 | memcpy(&key, &found_key, sizeof(key)); |
3477 | key.offset++; | |
edbd8d4e | 3478 | path->slots[0]++; |
edbd8d4e CM |
3479 | goto next; |
3480 | } | |
73e48b27 | 3481 | |
edbd8d4e CM |
3482 | total_found++; |
3483 | cur_byte = found_key.objectid + found_key.offset; | |
3484 | key.objectid = cur_byte; | |
3485 | btrfs_release_path(root, path); | |
3486 | ret = relocate_one_extent(root, path, &found_key); | |
0ef3e66b | 3487 | __alloc_chunk_for_shrink(root, shrink_block_group, 0); |
edbd8d4e CM |
3488 | } |
3489 | ||
3490 | btrfs_release_path(root, path); | |
3491 | ||
3492 | if (total_found > 0) { | |
323da79c CM |
3493 | printk("btrfs relocate found %llu last extent was %llu\n", |
3494 | (unsigned long long)total_found, | |
3495 | (unsigned long long)found_key.objectid); | |
7d9eb12c | 3496 | mutex_unlock(&root->fs_info->alloc_mutex); |
edbd8d4e CM |
3497 | trans = btrfs_start_transaction(tree_root, 1); |
3498 | btrfs_commit_transaction(trans, tree_root); | |
3499 | ||
edbd8d4e | 3500 | btrfs_clean_old_snapshots(tree_root); |
edbd8d4e | 3501 | |
ea8c2819 | 3502 | btrfs_start_delalloc_inodes(root); |
7ea394f1 | 3503 | btrfs_wait_ordered_extents(tree_root, 0); |
3eaa2885 | 3504 | |
edbd8d4e CM |
3505 | trans = btrfs_start_transaction(tree_root, 1); |
3506 | btrfs_commit_transaction(trans, tree_root); | |
7d9eb12c | 3507 | mutex_lock(&root->fs_info->alloc_mutex); |
edbd8d4e CM |
3508 | goto again; |
3509 | } | |
3510 | ||
8f18cf13 CM |
3511 | /* |
3512 | * we've freed all the extents, now remove the block | |
3513 | * group item from the tree | |
3514 | */ | |
7d9eb12c CM |
3515 | mutex_unlock(&root->fs_info->alloc_mutex); |
3516 | ||
edbd8d4e | 3517 | trans = btrfs_start_transaction(root, 1); |
c286ac48 | 3518 | |
7d9eb12c | 3519 | mutex_lock(&root->fs_info->alloc_mutex); |
8f18cf13 | 3520 | memcpy(&key, &shrink_block_group->key, sizeof(key)); |
1372f8e6 | 3521 | |
8f18cf13 CM |
3522 | ret = btrfs_search_slot(trans, root, &key, path, -1, 1); |
3523 | if (ret > 0) | |
3524 | ret = -EIO; | |
8e8a1e31 JB |
3525 | if (ret < 0) { |
3526 | btrfs_end_transaction(trans, root); | |
8f18cf13 | 3527 | goto out; |
8e8a1e31 | 3528 | } |
73e48b27 | 3529 | |
0ef3e66b CM |
3530 | clear_extent_bits(&info->block_group_cache, key.objectid, |
3531 | key.objectid + key.offset - 1, | |
8f18cf13 | 3532 | (unsigned int)-1, GFP_NOFS); |
edbd8d4e | 3533 | |
0ef3e66b CM |
3534 | |
3535 | clear_extent_bits(&info->free_space_cache, | |
3536 | key.objectid, key.objectid + key.offset - 1, | |
3537 | (unsigned int)-1, GFP_NOFS); | |
3538 | ||
d7a029a8 | 3539 | /* |
0ef3e66b CM |
3540 | memset(shrink_block_group, 0, sizeof(*shrink_block_group)); |
3541 | kfree(shrink_block_group); | |
d7a029a8 | 3542 | */ |
0ef3e66b | 3543 | |
8f18cf13 | 3544 | btrfs_del_item(trans, root, path); |
7d9eb12c CM |
3545 | btrfs_release_path(root, path); |
3546 | mutex_unlock(&root->fs_info->alloc_mutex); | |
edbd8d4e | 3547 | btrfs_commit_transaction(trans, root); |
0ef3e66b | 3548 | |
7d9eb12c CM |
3549 | mutex_lock(&root->fs_info->alloc_mutex); |
3550 | ||
0ef3e66b CM |
3551 | /* the code to unpin extents might set a few bits in the free |
3552 | * space cache for this range again | |
3553 | */ | |
3554 | clear_extent_bits(&info->free_space_cache, | |
3555 | key.objectid, key.objectid + key.offset - 1, | |
3556 | (unsigned int)-1, GFP_NOFS); | |
edbd8d4e CM |
3557 | out: |
3558 | btrfs_free_path(path); | |
925baedd | 3559 | mutex_unlock(&root->fs_info->alloc_mutex); |
edbd8d4e CM |
3560 | return ret; |
3561 | } | |
3562 | ||
0b86a832 CM |
3563 | int find_first_block_group(struct btrfs_root *root, struct btrfs_path *path, |
3564 | struct btrfs_key *key) | |
3565 | { | |
925baedd | 3566 | int ret = 0; |
0b86a832 CM |
3567 | struct btrfs_key found_key; |
3568 | struct extent_buffer *leaf; | |
3569 | int slot; | |
edbd8d4e | 3570 | |
0b86a832 CM |
3571 | ret = btrfs_search_slot(NULL, root, key, path, 0, 0); |
3572 | if (ret < 0) | |
925baedd CM |
3573 | goto out; |
3574 | ||
0b86a832 CM |
3575 | while(1) { |
3576 | slot = path->slots[0]; | |
edbd8d4e | 3577 | leaf = path->nodes[0]; |
0b86a832 CM |
3578 | if (slot >= btrfs_header_nritems(leaf)) { |
3579 | ret = btrfs_next_leaf(root, path); | |
3580 | if (ret == 0) | |
3581 | continue; | |
3582 | if (ret < 0) | |
925baedd | 3583 | goto out; |
0b86a832 | 3584 | break; |
edbd8d4e | 3585 | } |
0b86a832 | 3586 | btrfs_item_key_to_cpu(leaf, &found_key, slot); |
edbd8d4e | 3587 | |
0b86a832 | 3588 | if (found_key.objectid >= key->objectid && |
925baedd CM |
3589 | found_key.type == BTRFS_BLOCK_GROUP_ITEM_KEY) { |
3590 | ret = 0; | |
3591 | goto out; | |
3592 | } | |
0b86a832 | 3593 | path->slots[0]++; |
edbd8d4e | 3594 | } |
0b86a832 | 3595 | ret = -ENOENT; |
925baedd | 3596 | out: |
0b86a832 | 3597 | return ret; |
edbd8d4e CM |
3598 | } |
3599 | ||
9078a3e1 CM |
3600 | int btrfs_read_block_groups(struct btrfs_root *root) |
3601 | { | |
3602 | struct btrfs_path *path; | |
3603 | int ret; | |
96b5179d | 3604 | int bit; |
9078a3e1 | 3605 | struct btrfs_block_group_cache *cache; |
be744175 | 3606 | struct btrfs_fs_info *info = root->fs_info; |
6324fbf3 | 3607 | struct btrfs_space_info *space_info; |
d1310b2e | 3608 | struct extent_io_tree *block_group_cache; |
9078a3e1 CM |
3609 | struct btrfs_key key; |
3610 | struct btrfs_key found_key; | |
5f39d397 | 3611 | struct extent_buffer *leaf; |
96b5179d CM |
3612 | |
3613 | block_group_cache = &info->block_group_cache; | |
be744175 | 3614 | root = info->extent_root; |
9078a3e1 | 3615 | key.objectid = 0; |
0b86a832 | 3616 | key.offset = 0; |
9078a3e1 | 3617 | btrfs_set_key_type(&key, BTRFS_BLOCK_GROUP_ITEM_KEY); |
9078a3e1 CM |
3618 | path = btrfs_alloc_path(); |
3619 | if (!path) | |
3620 | return -ENOMEM; | |
3621 | ||
925baedd | 3622 | mutex_lock(&root->fs_info->alloc_mutex); |
9078a3e1 | 3623 | while(1) { |
0b86a832 CM |
3624 | ret = find_first_block_group(root, path, &key); |
3625 | if (ret > 0) { | |
3626 | ret = 0; | |
3627 | goto error; | |
9078a3e1 | 3628 | } |
0b86a832 CM |
3629 | if (ret != 0) |
3630 | goto error; | |
3631 | ||
5f39d397 CM |
3632 | leaf = path->nodes[0]; |
3633 | btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]); | |
8f18cf13 | 3634 | cache = kzalloc(sizeof(*cache), GFP_NOFS); |
9078a3e1 | 3635 | if (!cache) { |
0b86a832 | 3636 | ret = -ENOMEM; |
9078a3e1 CM |
3637 | break; |
3638 | } | |
3e1ad54f | 3639 | |
c286ac48 | 3640 | spin_lock_init(&cache->lock); |
5f39d397 CM |
3641 | read_extent_buffer(leaf, &cache->item, |
3642 | btrfs_item_ptr_offset(leaf, path->slots[0]), | |
3643 | sizeof(cache->item)); | |
9078a3e1 | 3644 | memcpy(&cache->key, &found_key, sizeof(found_key)); |
0b86a832 | 3645 | |
9078a3e1 CM |
3646 | key.objectid = found_key.objectid + found_key.offset; |
3647 | btrfs_release_path(root, path); | |
0b86a832 CM |
3648 | cache->flags = btrfs_block_group_flags(&cache->item); |
3649 | bit = 0; | |
3650 | if (cache->flags & BTRFS_BLOCK_GROUP_DATA) { | |
96b5179d | 3651 | bit = BLOCK_GROUP_DATA; |
0b86a832 CM |
3652 | } else if (cache->flags & BTRFS_BLOCK_GROUP_SYSTEM) { |
3653 | bit = BLOCK_GROUP_SYSTEM; | |
3654 | } else if (cache->flags & BTRFS_BLOCK_GROUP_METADATA) { | |
96b5179d | 3655 | bit = BLOCK_GROUP_METADATA; |
31f3c99b | 3656 | } |
8790d502 | 3657 | set_avail_alloc_bits(info, cache->flags); |
96b5179d | 3658 | |
6324fbf3 CM |
3659 | ret = update_space_info(info, cache->flags, found_key.offset, |
3660 | btrfs_block_group_used(&cache->item), | |
3661 | &space_info); | |
3662 | BUG_ON(ret); | |
3663 | cache->space_info = space_info; | |
3664 | ||
96b5179d CM |
3665 | /* use EXTENT_LOCKED to prevent merging */ |
3666 | set_extent_bits(block_group_cache, found_key.objectid, | |
3667 | found_key.objectid + found_key.offset - 1, | |
c286ac48 | 3668 | EXTENT_LOCKED, GFP_NOFS); |
96b5179d | 3669 | set_state_private(block_group_cache, found_key.objectid, |
ae2f5411 | 3670 | (unsigned long)cache); |
c286ac48 CM |
3671 | set_extent_bits(block_group_cache, found_key.objectid, |
3672 | found_key.objectid + found_key.offset - 1, | |
3673 | bit | EXTENT_LOCKED, GFP_NOFS); | |
9078a3e1 | 3674 | if (key.objectid >= |
db94535d | 3675 | btrfs_super_total_bytes(&info->super_copy)) |
9078a3e1 CM |
3676 | break; |
3677 | } | |
0b86a832 CM |
3678 | ret = 0; |
3679 | error: | |
9078a3e1 | 3680 | btrfs_free_path(path); |
925baedd | 3681 | mutex_unlock(&root->fs_info->alloc_mutex); |
0b86a832 | 3682 | return ret; |
9078a3e1 | 3683 | } |
6324fbf3 CM |
3684 | |
3685 | int btrfs_make_block_group(struct btrfs_trans_handle *trans, | |
3686 | struct btrfs_root *root, u64 bytes_used, | |
e17cade2 | 3687 | u64 type, u64 chunk_objectid, u64 chunk_offset, |
6324fbf3 CM |
3688 | u64 size) |
3689 | { | |
3690 | int ret; | |
3691 | int bit = 0; | |
3692 | struct btrfs_root *extent_root; | |
3693 | struct btrfs_block_group_cache *cache; | |
3694 | struct extent_io_tree *block_group_cache; | |
3695 | ||
7d9eb12c | 3696 | WARN_ON(!mutex_is_locked(&root->fs_info->alloc_mutex)); |
6324fbf3 CM |
3697 | extent_root = root->fs_info->extent_root; |
3698 | block_group_cache = &root->fs_info->block_group_cache; | |
3699 | ||
e02119d5 CM |
3700 | root->fs_info->last_trans_new_blockgroup = trans->transid; |
3701 | ||
8f18cf13 | 3702 | cache = kzalloc(sizeof(*cache), GFP_NOFS); |
6324fbf3 | 3703 | BUG_ON(!cache); |
e17cade2 | 3704 | cache->key.objectid = chunk_offset; |
6324fbf3 | 3705 | cache->key.offset = size; |
c286ac48 | 3706 | spin_lock_init(&cache->lock); |
6324fbf3 | 3707 | btrfs_set_key_type(&cache->key, BTRFS_BLOCK_GROUP_ITEM_KEY); |
0ef3e66b | 3708 | |
6324fbf3 | 3709 | btrfs_set_block_group_used(&cache->item, bytes_used); |
6324fbf3 CM |
3710 | btrfs_set_block_group_chunk_objectid(&cache->item, chunk_objectid); |
3711 | cache->flags = type; | |
3712 | btrfs_set_block_group_flags(&cache->item, type); | |
3713 | ||
3714 | ret = update_space_info(root->fs_info, cache->flags, size, bytes_used, | |
3715 | &cache->space_info); | |
3716 | BUG_ON(ret); | |
3717 | ||
d18a2c44 | 3718 | bit = block_group_state_bits(type); |
e17cade2 CM |
3719 | set_extent_bits(block_group_cache, chunk_offset, |
3720 | chunk_offset + size - 1, | |
c286ac48 | 3721 | EXTENT_LOCKED, GFP_NOFS); |
e17cade2 CM |
3722 | set_state_private(block_group_cache, chunk_offset, |
3723 | (unsigned long)cache); | |
c286ac48 CM |
3724 | set_extent_bits(block_group_cache, chunk_offset, |
3725 | chunk_offset + size - 1, | |
3726 | bit | EXTENT_LOCKED, GFP_NOFS); | |
3727 | ||
6324fbf3 CM |
3728 | ret = btrfs_insert_item(trans, extent_root, &cache->key, &cache->item, |
3729 | sizeof(cache->item)); | |
3730 | BUG_ON(ret); | |
3731 | ||
3732 | finish_current_insert(trans, extent_root); | |
3733 | ret = del_pending_extents(trans, extent_root); | |
3734 | BUG_ON(ret); | |
d18a2c44 | 3735 | set_avail_alloc_bits(extent_root->fs_info, type); |
925baedd | 3736 | |
6324fbf3 CM |
3737 | return 0; |
3738 | } |