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 | */ | |
18 | ||
ec6b910f | 19 | #include <linux/sched.h> |
fec577fb CM |
20 | #include "ctree.h" |
21 | #include "disk-io.h" | |
22 | #include "print-tree.h" | |
e089f05c | 23 | #include "transaction.h" |
fec577fb | 24 | |
96b5179d CM |
25 | #define BLOCK_GROUP_DATA EXTENT_WRITEBACK |
26 | #define BLOCK_GROUP_METADATA EXTENT_UPTODATE | |
27 | #define BLOCK_GROUP_DIRTY EXTENT_DIRTY | |
28 | ||
e089f05c CM |
29 | static int finish_current_insert(struct btrfs_trans_handle *trans, struct |
30 | btrfs_root *extent_root); | |
e20d96d6 CM |
31 | static int del_pending_extents(struct btrfs_trans_handle *trans, struct |
32 | btrfs_root *extent_root); | |
fec577fb | 33 | |
e37c9e69 CM |
34 | static int cache_block_group(struct btrfs_root *root, |
35 | struct btrfs_block_group_cache *block_group) | |
36 | { | |
37 | struct btrfs_path *path; | |
38 | int ret; | |
39 | struct btrfs_key key; | |
5f39d397 | 40 | struct extent_buffer *leaf; |
f510cfec | 41 | struct extent_map_tree *free_space_cache; |
e37c9e69 | 42 | int slot; |
e37c9e69 CM |
43 | u64 last = 0; |
44 | u64 hole_size; | |
7d7d6068 | 45 | u64 first_free; |
e37c9e69 CM |
46 | int found = 0; |
47 | ||
48 | root = root->fs_info->extent_root; | |
f510cfec | 49 | free_space_cache = &root->fs_info->free_space_cache; |
e37c9e69 CM |
50 | |
51 | if (block_group->cached) | |
52 | return 0; | |
f510cfec | 53 | |
e37c9e69 CM |
54 | path = btrfs_alloc_path(); |
55 | if (!path) | |
56 | return -ENOMEM; | |
7d7d6068 | 57 | |
2cc58cf2 | 58 | path->reada = 2; |
7d7d6068 | 59 | first_free = block_group->key.objectid; |
e37c9e69 | 60 | key.objectid = block_group->key.objectid; |
e37c9e69 | 61 | key.offset = 0; |
7d7d6068 | 62 | |
e37c9e69 CM |
63 | btrfs_set_key_type(&key, BTRFS_EXTENT_ITEM_KEY); |
64 | ret = btrfs_search_slot(NULL, root, &key, path, 0, 0); | |
7d7d6068 | 65 | |
e37c9e69 CM |
66 | if (ret < 0) |
67 | return ret; | |
7d7d6068 | 68 | |
e37c9e69 CM |
69 | if (ret && path->slots[0] > 0) |
70 | path->slots[0]--; | |
7d7d6068 | 71 | |
e37c9e69 | 72 | while(1) { |
5f39d397 | 73 | leaf = path->nodes[0]; |
e37c9e69 | 74 | slot = path->slots[0]; |
5f39d397 | 75 | if (slot >= btrfs_header_nritems(leaf)) { |
e37c9e69 | 76 | ret = btrfs_next_leaf(root, path); |
54aa1f4d CM |
77 | if (ret < 0) |
78 | goto err; | |
de428b63 | 79 | if (ret == 0) { |
e37c9e69 | 80 | continue; |
de428b63 | 81 | } else { |
e37c9e69 CM |
82 | break; |
83 | } | |
84 | } | |
7d7d6068 | 85 | |
5f39d397 | 86 | btrfs_item_key_to_cpu(leaf, &key, slot); |
7d7d6068 Y |
87 | if (key.objectid < block_group->key.objectid) { |
88 | if (key.objectid + key.offset > first_free) | |
89 | first_free = key.objectid + key.offset; | |
90 | goto next; | |
91 | } | |
92 | ||
e37c9e69 CM |
93 | if (key.objectid >= block_group->key.objectid + |
94 | block_group->key.offset) { | |
e37c9e69 CM |
95 | break; |
96 | } | |
7d7d6068 | 97 | |
e37c9e69 CM |
98 | if (btrfs_key_type(&key) == BTRFS_EXTENT_ITEM_KEY) { |
99 | if (!found) { | |
7d7d6068 | 100 | last = first_free; |
e37c9e69 | 101 | found = 1; |
e37c9e69 | 102 | } |
f510cfec CM |
103 | if (key.objectid > last) { |
104 | hole_size = key.objectid - last; | |
105 | set_extent_dirty(free_space_cache, last, | |
106 | last + hole_size - 1, | |
107 | GFP_NOFS); | |
7d7d6068 Y |
108 | } |
109 | last = key.objectid + key.offset; | |
e37c9e69 | 110 | } |
7d7d6068 | 111 | next: |
e37c9e69 CM |
112 | path->slots[0]++; |
113 | } | |
114 | ||
7d7d6068 Y |
115 | if (!found) |
116 | last = first_free; | |
117 | if (block_group->key.objectid + | |
118 | block_group->key.offset > last) { | |
119 | hole_size = block_group->key.objectid + | |
120 | block_group->key.offset - last; | |
f510cfec CM |
121 | set_extent_dirty(free_space_cache, last, |
122 | last + hole_size - 1, GFP_NOFS); | |
7d7d6068 | 123 | } |
e37c9e69 | 124 | block_group->cached = 1; |
54aa1f4d | 125 | err: |
e37c9e69 CM |
126 | btrfs_free_path(path); |
127 | return 0; | |
128 | } | |
129 | ||
5276aeda CM |
130 | struct btrfs_block_group_cache *btrfs_lookup_block_group(struct |
131 | btrfs_fs_info *info, | |
db94535d | 132 | u64 bytenr) |
be744175 | 133 | { |
96b5179d CM |
134 | struct extent_map_tree *block_group_cache; |
135 | struct btrfs_block_group_cache *block_group = NULL; | |
136 | u64 ptr; | |
137 | u64 start; | |
138 | u64 end; | |
be744175 CM |
139 | int ret; |
140 | ||
96b5179d CM |
141 | block_group_cache = &info->block_group_cache; |
142 | ret = find_first_extent_bit(block_group_cache, | |
db94535d | 143 | bytenr, &start, &end, |
96b5179d | 144 | BLOCK_GROUP_DATA | BLOCK_GROUP_METADATA); |
be744175 | 145 | if (ret) { |
96b5179d | 146 | return NULL; |
be744175 | 147 | } |
96b5179d CM |
148 | ret = get_state_private(block_group_cache, start, &ptr); |
149 | if (ret) | |
150 | return NULL; | |
151 | ||
ae2f5411 | 152 | block_group = (struct btrfs_block_group_cache *)(unsigned long)ptr; |
96b5179d CM |
153 | |
154 | ||
db94535d | 155 | if (block_group->key.objectid <= bytenr && bytenr <= |
96b5179d CM |
156 | block_group->key.objectid + block_group->key.offset) |
157 | return block_group; | |
158 | ||
be744175 CM |
159 | return NULL; |
160 | } | |
e37c9e69 CM |
161 | static u64 find_search_start(struct btrfs_root *root, |
162 | struct btrfs_block_group_cache **cache_ret, | |
5e5745dc Y |
163 | u64 search_start, int num, |
164 | int data, int full_scan) | |
e37c9e69 | 165 | { |
e37c9e69 CM |
166 | int ret; |
167 | struct btrfs_block_group_cache *cache = *cache_ret; | |
e19caa5f | 168 | u64 last; |
f510cfec CM |
169 | u64 start = 0; |
170 | u64 end = 0; | |
257d0ce3 | 171 | u64 cache_miss = 0; |
f84a8b36 | 172 | int wrapped = 0; |
e37c9e69 | 173 | |
e37c9e69 | 174 | again: |
54aa1f4d CM |
175 | ret = cache_block_group(root, cache); |
176 | if (ret) | |
177 | goto out; | |
f84a8b36 | 178 | |
e19caa5f CM |
179 | last = max(search_start, cache->key.objectid); |
180 | ||
e37c9e69 | 181 | while(1) { |
f510cfec CM |
182 | ret = find_first_extent_bit(&root->fs_info->free_space_cache, |
183 | last, &start, &end, EXTENT_DIRTY); | |
e19caa5f | 184 | if (ret) { |
257d0ce3 CM |
185 | if (!cache_miss) |
186 | cache_miss = last; | |
e19caa5f CM |
187 | goto new_group; |
188 | } | |
f510cfec CM |
189 | |
190 | start = max(last, start); | |
191 | last = end + 1; | |
257d0ce3 CM |
192 | if (last - start < num) { |
193 | if (last == cache->key.objectid + cache->key.offset) | |
194 | cache_miss = start; | |
f510cfec | 195 | continue; |
257d0ce3 CM |
196 | } |
197 | if (data != BTRFS_BLOCK_GROUP_MIXED && | |
198 | start + num >= cache->key.objectid + cache->key.offset) | |
e37c9e69 | 199 | goto new_group; |
f510cfec | 200 | return start; |
e37c9e69 CM |
201 | } |
202 | out: | |
1a5bc167 | 203 | return search_start; |
e37c9e69 CM |
204 | |
205 | new_group: | |
e19caa5f | 206 | last = cache->key.objectid + cache->key.offset; |
f84a8b36 | 207 | wrapped: |
e19caa5f | 208 | cache = btrfs_lookup_block_group(root->fs_info, last); |
e37c9e69 | 209 | if (!cache) { |
f84a8b36 CM |
210 | if (!wrapped) { |
211 | wrapped = 1; | |
212 | last = search_start; | |
213 | data = BTRFS_BLOCK_GROUP_MIXED; | |
214 | goto wrapped; | |
215 | } | |
1a5bc167 | 216 | return search_start; |
e37c9e69 | 217 | } |
257d0ce3 CM |
218 | if (cache_miss && !cache->cached) { |
219 | cache_block_group(root, cache); | |
220 | last = cache_miss; | |
257d0ce3 CM |
221 | cache = btrfs_lookup_block_group(root->fs_info, last); |
222 | } | |
5e5745dc Y |
223 | if (!full_scan) |
224 | cache = btrfs_find_block_group(root, cache, last, data, 0); | |
e37c9e69 | 225 | *cache_ret = cache; |
257d0ce3 | 226 | cache_miss = 0; |
e37c9e69 CM |
227 | goto again; |
228 | } | |
229 | ||
84f54cfa CM |
230 | static u64 div_factor(u64 num, int factor) |
231 | { | |
257d0ce3 CM |
232 | if (factor == 10) |
233 | return num; | |
84f54cfa CM |
234 | num *= factor; |
235 | do_div(num, 10); | |
236 | return num; | |
237 | } | |
238 | ||
31f3c99b CM |
239 | struct btrfs_block_group_cache *btrfs_find_block_group(struct btrfs_root *root, |
240 | struct btrfs_block_group_cache | |
be744175 | 241 | *hint, u64 search_start, |
de428b63 | 242 | int data, int owner) |
cd1bc465 | 243 | { |
96b5179d CM |
244 | struct btrfs_block_group_cache *cache; |
245 | struct extent_map_tree *block_group_cache; | |
31f3c99b | 246 | struct btrfs_block_group_cache *found_group = NULL; |
cd1bc465 CM |
247 | struct btrfs_fs_info *info = root->fs_info; |
248 | u64 used; | |
31f3c99b CM |
249 | u64 last = 0; |
250 | u64 hint_last; | |
96b5179d CM |
251 | u64 start; |
252 | u64 end; | |
253 | u64 free_check; | |
254 | u64 ptr; | |
255 | int bit; | |
cd1bc465 | 256 | int ret; |
31f3c99b | 257 | int full_search = 0; |
de428b63 | 258 | int factor = 8; |
1e2677e0 | 259 | int data_swap = 0; |
de428b63 | 260 | |
96b5179d CM |
261 | block_group_cache = &info->block_group_cache; |
262 | ||
de428b63 | 263 | if (!owner) |
f84a8b36 | 264 | factor = 8; |
be744175 | 265 | |
257d0ce3 | 266 | if (data == BTRFS_BLOCK_GROUP_MIXED) { |
f84a8b36 | 267 | bit = BLOCK_GROUP_DATA | BLOCK_GROUP_METADATA; |
257d0ce3 CM |
268 | factor = 10; |
269 | } else if (data) | |
96b5179d CM |
270 | bit = BLOCK_GROUP_DATA; |
271 | else | |
272 | bit = BLOCK_GROUP_METADATA; | |
be744175 CM |
273 | |
274 | if (search_start) { | |
275 | struct btrfs_block_group_cache *shint; | |
5276aeda | 276 | shint = btrfs_lookup_block_group(info, search_start); |
f84a8b36 CM |
277 | if (shint && (shint->data == data || |
278 | shint->data == BTRFS_BLOCK_GROUP_MIXED)) { | |
be744175 | 279 | used = btrfs_block_group_used(&shint->item); |
324ae4df Y |
280 | if (used + shint->pinned < |
281 | div_factor(shint->key.offset, factor)) { | |
be744175 CM |
282 | return shint; |
283 | } | |
284 | } | |
285 | } | |
f84a8b36 CM |
286 | if (hint && (hint->data == data || |
287 | hint->data == BTRFS_BLOCK_GROUP_MIXED)) { | |
31f3c99b | 288 | used = btrfs_block_group_used(&hint->item); |
324ae4df Y |
289 | if (used + hint->pinned < |
290 | div_factor(hint->key.offset, factor)) { | |
31f3c99b CM |
291 | return hint; |
292 | } | |
e19caa5f | 293 | last = hint->key.objectid + hint->key.offset; |
31f3c99b CM |
294 | hint_last = last; |
295 | } else { | |
e37c9e69 CM |
296 | if (hint) |
297 | hint_last = max(hint->key.objectid, search_start); | |
298 | else | |
299 | hint_last = search_start; | |
300 | ||
301 | last = hint_last; | |
31f3c99b | 302 | } |
31f3c99b | 303 | again: |
cd1bc465 | 304 | while(1) { |
96b5179d CM |
305 | ret = find_first_extent_bit(block_group_cache, last, |
306 | &start, &end, bit); | |
307 | if (ret) | |
cd1bc465 | 308 | break; |
96b5179d CM |
309 | |
310 | ret = get_state_private(block_group_cache, start, &ptr); | |
311 | if (ret) | |
312 | break; | |
313 | ||
ae2f5411 | 314 | cache = (struct btrfs_block_group_cache *)(unsigned long)ptr; |
96b5179d CM |
315 | last = cache->key.objectid + cache->key.offset; |
316 | used = btrfs_block_group_used(&cache->item); | |
317 | ||
318 | if (full_search) | |
319 | free_check = cache->key.offset; | |
320 | else | |
321 | free_check = div_factor(cache->key.offset, factor); | |
324ae4df | 322 | if (used + cache->pinned < free_check) { |
96b5179d CM |
323 | found_group = cache; |
324 | goto found; | |
cd1bc465 | 325 | } |
de428b63 | 326 | cond_resched(); |
cd1bc465 | 327 | } |
31f3c99b | 328 | if (!full_search) { |
be744175 | 329 | last = search_start; |
31f3c99b CM |
330 | full_search = 1; |
331 | goto again; | |
332 | } | |
1e2677e0 | 333 | if (!data_swap) { |
1e2677e0 | 334 | data_swap = 1; |
96b5179d | 335 | bit = BLOCK_GROUP_DATA | BLOCK_GROUP_METADATA; |
1e2677e0 CM |
336 | last = search_start; |
337 | goto again; | |
338 | } | |
be744175 | 339 | found: |
31f3c99b | 340 | return found_group; |
cd1bc465 CM |
341 | } |
342 | ||
b18c6685 CM |
343 | int btrfs_inc_extent_ref(struct btrfs_trans_handle *trans, |
344 | struct btrfs_root *root, | |
db94535d | 345 | u64 bytenr, u64 num_bytes) |
02217ed2 | 346 | { |
5caf2a00 | 347 | struct btrfs_path *path; |
02217ed2 | 348 | int ret; |
e2fa7227 | 349 | struct btrfs_key key; |
5f39d397 | 350 | struct extent_buffer *l; |
234b63a0 | 351 | struct btrfs_extent_item *item; |
cf27e1ee | 352 | u32 refs; |
037e6390 | 353 | |
db94535d | 354 | WARN_ON(num_bytes < root->sectorsize); |
5caf2a00 | 355 | path = btrfs_alloc_path(); |
54aa1f4d CM |
356 | if (!path) |
357 | return -ENOMEM; | |
26b8003f | 358 | |
db94535d | 359 | key.objectid = bytenr; |
62e2749e | 360 | btrfs_set_key_type(&key, BTRFS_EXTENT_ITEM_KEY); |
db94535d | 361 | key.offset = num_bytes; |
5caf2a00 | 362 | ret = btrfs_search_slot(trans, root->fs_info->extent_root, &key, path, |
9f5fae2f | 363 | 0, 1); |
54aa1f4d CM |
364 | if (ret < 0) |
365 | return ret; | |
a429e513 | 366 | if (ret != 0) { |
a28ec197 | 367 | BUG(); |
a429e513 | 368 | } |
02217ed2 | 369 | BUG_ON(ret != 0); |
5f39d397 | 370 | l = path->nodes[0]; |
5caf2a00 | 371 | item = btrfs_item_ptr(l, path->slots[0], struct btrfs_extent_item); |
5f39d397 CM |
372 | refs = btrfs_extent_refs(l, item); |
373 | btrfs_set_extent_refs(l, item, refs + 1); | |
5caf2a00 | 374 | btrfs_mark_buffer_dirty(path->nodes[0]); |
a28ec197 | 375 | |
5caf2a00 CM |
376 | btrfs_release_path(root->fs_info->extent_root, path); |
377 | btrfs_free_path(path); | |
9f5fae2f | 378 | finish_current_insert(trans, root->fs_info->extent_root); |
e20d96d6 | 379 | del_pending_extents(trans, root->fs_info->extent_root); |
02217ed2 CM |
380 | return 0; |
381 | } | |
382 | ||
e9d0b13b CM |
383 | int btrfs_extent_post_op(struct btrfs_trans_handle *trans, |
384 | struct btrfs_root *root) | |
385 | { | |
386 | finish_current_insert(trans, root->fs_info->extent_root); | |
387 | del_pending_extents(trans, root->fs_info->extent_root); | |
388 | return 0; | |
389 | } | |
390 | ||
b18c6685 | 391 | static int lookup_extent_ref(struct btrfs_trans_handle *trans, |
db94535d CM |
392 | struct btrfs_root *root, u64 bytenr, |
393 | u64 num_bytes, u32 *refs) | |
a28ec197 | 394 | { |
5caf2a00 | 395 | struct btrfs_path *path; |
a28ec197 | 396 | int ret; |
e2fa7227 | 397 | struct btrfs_key key; |
5f39d397 | 398 | struct extent_buffer *l; |
234b63a0 | 399 | struct btrfs_extent_item *item; |
5caf2a00 | 400 | |
db94535d | 401 | WARN_ON(num_bytes < root->sectorsize); |
5caf2a00 | 402 | path = btrfs_alloc_path(); |
db94535d CM |
403 | key.objectid = bytenr; |
404 | key.offset = num_bytes; | |
62e2749e | 405 | btrfs_set_key_type(&key, BTRFS_EXTENT_ITEM_KEY); |
5caf2a00 | 406 | ret = btrfs_search_slot(trans, root->fs_info->extent_root, &key, path, |
9f5fae2f | 407 | 0, 0); |
54aa1f4d CM |
408 | if (ret < 0) |
409 | goto out; | |
5f39d397 CM |
410 | if (ret != 0) { |
411 | btrfs_print_leaf(root, path->nodes[0]); | |
db94535d | 412 | printk("failed to find block number %Lu\n", bytenr); |
a28ec197 | 413 | BUG(); |
5f39d397 CM |
414 | } |
415 | l = path->nodes[0]; | |
5caf2a00 | 416 | item = btrfs_item_ptr(l, path->slots[0], struct btrfs_extent_item); |
5f39d397 | 417 | *refs = btrfs_extent_refs(l, item); |
54aa1f4d | 418 | out: |
5caf2a00 | 419 | btrfs_free_path(path); |
a28ec197 CM |
420 | return 0; |
421 | } | |
422 | ||
c5739bba CM |
423 | int btrfs_inc_root_ref(struct btrfs_trans_handle *trans, |
424 | struct btrfs_root *root) | |
425 | { | |
db94535d CM |
426 | return btrfs_inc_extent_ref(trans, root, root->node->start, |
427 | root->node->len); | |
c5739bba CM |
428 | } |
429 | ||
e089f05c | 430 | int btrfs_inc_ref(struct btrfs_trans_handle *trans, struct btrfs_root *root, |
5f39d397 | 431 | struct extent_buffer *buf) |
02217ed2 | 432 | { |
db94535d | 433 | u64 bytenr; |
5f39d397 CM |
434 | u32 nritems; |
435 | struct btrfs_key key; | |
6407bf6d | 436 | struct btrfs_file_extent_item *fi; |
02217ed2 | 437 | int i; |
db94535d | 438 | int level; |
6407bf6d | 439 | int ret; |
54aa1f4d CM |
440 | int faili; |
441 | int err; | |
a28ec197 | 442 | |
3768f368 | 443 | if (!root->ref_cows) |
a28ec197 | 444 | return 0; |
5f39d397 | 445 | |
db94535d | 446 | level = btrfs_header_level(buf); |
5f39d397 CM |
447 | nritems = btrfs_header_nritems(buf); |
448 | for (i = 0; i < nritems; i++) { | |
db94535d CM |
449 | if (level == 0) { |
450 | u64 disk_bytenr; | |
5f39d397 CM |
451 | btrfs_item_key_to_cpu(buf, &key, i); |
452 | if (btrfs_key_type(&key) != BTRFS_EXTENT_DATA_KEY) | |
6407bf6d | 453 | continue; |
5f39d397 | 454 | fi = btrfs_item_ptr(buf, i, |
6407bf6d | 455 | struct btrfs_file_extent_item); |
5f39d397 | 456 | if (btrfs_file_extent_type(buf, fi) == |
236454df CM |
457 | BTRFS_FILE_EXTENT_INLINE) |
458 | continue; | |
db94535d CM |
459 | disk_bytenr = btrfs_file_extent_disk_bytenr(buf, fi); |
460 | if (disk_bytenr == 0) | |
3a686375 | 461 | continue; |
db94535d CM |
462 | ret = btrfs_inc_extent_ref(trans, root, disk_bytenr, |
463 | btrfs_file_extent_disk_num_bytes(buf, fi)); | |
54aa1f4d CM |
464 | if (ret) { |
465 | faili = i; | |
466 | goto fail; | |
467 | } | |
6407bf6d | 468 | } else { |
db94535d CM |
469 | bytenr = btrfs_node_blockptr(buf, i); |
470 | ret = btrfs_inc_extent_ref(trans, root, bytenr, | |
471 | btrfs_level_size(root, level - 1)); | |
54aa1f4d CM |
472 | if (ret) { |
473 | faili = i; | |
474 | goto fail; | |
475 | } | |
6407bf6d | 476 | } |
02217ed2 CM |
477 | } |
478 | return 0; | |
54aa1f4d | 479 | fail: |
ccd467d6 | 480 | WARN_ON(1); |
54aa1f4d | 481 | for (i =0; i < faili; i++) { |
db94535d CM |
482 | if (level == 0) { |
483 | u64 disk_bytenr; | |
5f39d397 CM |
484 | btrfs_item_key_to_cpu(buf, &key, i); |
485 | if (btrfs_key_type(&key) != BTRFS_EXTENT_DATA_KEY) | |
54aa1f4d | 486 | continue; |
5f39d397 | 487 | fi = btrfs_item_ptr(buf, i, |
54aa1f4d | 488 | struct btrfs_file_extent_item); |
5f39d397 | 489 | if (btrfs_file_extent_type(buf, fi) == |
54aa1f4d CM |
490 | BTRFS_FILE_EXTENT_INLINE) |
491 | continue; | |
db94535d CM |
492 | disk_bytenr = btrfs_file_extent_disk_bytenr(buf, fi); |
493 | if (disk_bytenr == 0) | |
54aa1f4d | 494 | continue; |
db94535d CM |
495 | err = btrfs_free_extent(trans, root, disk_bytenr, |
496 | btrfs_file_extent_disk_num_bytes(buf, | |
5f39d397 | 497 | fi), 0); |
54aa1f4d CM |
498 | BUG_ON(err); |
499 | } else { | |
db94535d CM |
500 | bytenr = btrfs_node_blockptr(buf, i); |
501 | err = btrfs_free_extent(trans, root, bytenr, | |
502 | btrfs_level_size(root, level - 1), 0); | |
54aa1f4d CM |
503 | BUG_ON(err); |
504 | } | |
505 | } | |
506 | return ret; | |
02217ed2 CM |
507 | } |
508 | ||
9078a3e1 CM |
509 | static int write_one_cache_group(struct btrfs_trans_handle *trans, |
510 | struct btrfs_root *root, | |
511 | struct btrfs_path *path, | |
512 | struct btrfs_block_group_cache *cache) | |
513 | { | |
514 | int ret; | |
515 | int pending_ret; | |
516 | struct btrfs_root *extent_root = root->fs_info->extent_root; | |
5f39d397 CM |
517 | unsigned long bi; |
518 | struct extent_buffer *leaf; | |
9078a3e1 | 519 | |
9078a3e1 | 520 | ret = btrfs_search_slot(trans, extent_root, &cache->key, path, 0, 1); |
54aa1f4d CM |
521 | if (ret < 0) |
522 | goto fail; | |
9078a3e1 | 523 | BUG_ON(ret); |
5f39d397 CM |
524 | |
525 | leaf = path->nodes[0]; | |
526 | bi = btrfs_item_ptr_offset(leaf, path->slots[0]); | |
527 | write_extent_buffer(leaf, &cache->item, bi, sizeof(cache->item)); | |
528 | btrfs_mark_buffer_dirty(leaf); | |
9078a3e1 | 529 | btrfs_release_path(extent_root, path); |
54aa1f4d | 530 | fail: |
9078a3e1 CM |
531 | finish_current_insert(trans, extent_root); |
532 | pending_ret = del_pending_extents(trans, extent_root); | |
533 | if (ret) | |
534 | return ret; | |
535 | if (pending_ret) | |
536 | return pending_ret; | |
537 | return 0; | |
538 | ||
539 | } | |
540 | ||
96b5179d CM |
541 | int btrfs_write_dirty_block_groups(struct btrfs_trans_handle *trans, |
542 | struct btrfs_root *root) | |
9078a3e1 | 543 | { |
96b5179d CM |
544 | struct extent_map_tree *block_group_cache; |
545 | struct btrfs_block_group_cache *cache; | |
9078a3e1 CM |
546 | int ret; |
547 | int err = 0; | |
548 | int werr = 0; | |
9078a3e1 | 549 | struct btrfs_path *path; |
96b5179d CM |
550 | u64 last = 0; |
551 | u64 start; | |
552 | u64 end; | |
553 | u64 ptr; | |
9078a3e1 | 554 | |
96b5179d | 555 | block_group_cache = &root->fs_info->block_group_cache; |
9078a3e1 CM |
556 | path = btrfs_alloc_path(); |
557 | if (!path) | |
558 | return -ENOMEM; | |
559 | ||
560 | while(1) { | |
96b5179d CM |
561 | ret = find_first_extent_bit(block_group_cache, last, |
562 | &start, &end, BLOCK_GROUP_DIRTY); | |
563 | if (ret) | |
9078a3e1 | 564 | break; |
54aa1f4d | 565 | |
96b5179d CM |
566 | last = end + 1; |
567 | ret = get_state_private(block_group_cache, start, &ptr); | |
568 | if (ret) | |
569 | break; | |
570 | ||
ae2f5411 | 571 | cache = (struct btrfs_block_group_cache *)(unsigned long)ptr; |
96b5179d CM |
572 | err = write_one_cache_group(trans, root, |
573 | path, cache); | |
574 | /* | |
575 | * if we fail to write the cache group, we want | |
576 | * to keep it marked dirty in hopes that a later | |
577 | * write will work | |
578 | */ | |
579 | if (err) { | |
580 | werr = err; | |
581 | continue; | |
9078a3e1 | 582 | } |
96b5179d CM |
583 | clear_extent_bits(block_group_cache, start, end, |
584 | BLOCK_GROUP_DIRTY, GFP_NOFS); | |
9078a3e1 CM |
585 | } |
586 | btrfs_free_path(path); | |
587 | return werr; | |
588 | } | |
589 | ||
590 | static int update_block_group(struct btrfs_trans_handle *trans, | |
591 | struct btrfs_root *root, | |
db94535d CM |
592 | u64 bytenr, u64 num_bytes, int alloc, |
593 | int mark_free, int data) | |
9078a3e1 CM |
594 | { |
595 | struct btrfs_block_group_cache *cache; | |
596 | struct btrfs_fs_info *info = root->fs_info; | |
db94535d | 597 | u64 total = num_bytes; |
9078a3e1 | 598 | u64 old_val; |
db94535d | 599 | u64 byte_in_group; |
96b5179d CM |
600 | u64 start; |
601 | u64 end; | |
3e1ad54f | 602 | |
9078a3e1 | 603 | while(total) { |
db94535d | 604 | cache = btrfs_lookup_block_group(info, bytenr); |
3e1ad54f | 605 | if (!cache) { |
9078a3e1 | 606 | return -1; |
cd1bc465 | 607 | } |
db94535d CM |
608 | byte_in_group = bytenr - cache->key.objectid; |
609 | WARN_ON(byte_in_group > cache->key.offset); | |
96b5179d CM |
610 | start = cache->key.objectid; |
611 | end = start + cache->key.offset - 1; | |
612 | set_extent_bits(&info->block_group_cache, start, end, | |
613 | BLOCK_GROUP_DIRTY, GFP_NOFS); | |
9078a3e1 CM |
614 | |
615 | old_val = btrfs_block_group_used(&cache->item); | |
db94535d | 616 | num_bytes = min(total, cache->key.offset - byte_in_group); |
cd1bc465 | 617 | if (alloc) { |
1e2677e0 | 618 | if (cache->data != data && |
84f54cfa | 619 | old_val < (cache->key.offset >> 1)) { |
96b5179d CM |
620 | int bit_to_clear; |
621 | int bit_to_set; | |
96b5179d | 622 | cache->data = data; |
1e2677e0 | 623 | if (data) { |
b97f9203 Y |
624 | bit_to_clear = BLOCK_GROUP_METADATA; |
625 | bit_to_set = BLOCK_GROUP_DATA; | |
f84a8b36 CM |
626 | cache->item.flags &= |
627 | ~BTRFS_BLOCK_GROUP_MIXED; | |
1e2677e0 CM |
628 | cache->item.flags |= |
629 | BTRFS_BLOCK_GROUP_DATA; | |
630 | } else { | |
b97f9203 Y |
631 | bit_to_clear = BLOCK_GROUP_DATA; |
632 | bit_to_set = BLOCK_GROUP_METADATA; | |
f84a8b36 CM |
633 | cache->item.flags &= |
634 | ~BTRFS_BLOCK_GROUP_MIXED; | |
1e2677e0 CM |
635 | cache->item.flags &= |
636 | ~BTRFS_BLOCK_GROUP_DATA; | |
637 | } | |
96b5179d CM |
638 | clear_extent_bits(&info->block_group_cache, |
639 | start, end, bit_to_clear, | |
640 | GFP_NOFS); | |
641 | set_extent_bits(&info->block_group_cache, | |
642 | start, end, bit_to_set, | |
643 | GFP_NOFS); | |
f84a8b36 CM |
644 | } else if (cache->data != data && |
645 | cache->data != BTRFS_BLOCK_GROUP_MIXED) { | |
646 | cache->data = BTRFS_BLOCK_GROUP_MIXED; | |
647 | set_extent_bits(&info->block_group_cache, | |
648 | start, end, | |
649 | BLOCK_GROUP_DATA | | |
650 | BLOCK_GROUP_METADATA, | |
651 | GFP_NOFS); | |
1e2677e0 | 652 | } |
db94535d | 653 | old_val += num_bytes; |
cd1bc465 | 654 | } else { |
db94535d | 655 | old_val -= num_bytes; |
f510cfec CM |
656 | if (mark_free) { |
657 | set_extent_dirty(&info->free_space_cache, | |
db94535d | 658 | bytenr, bytenr + num_bytes - 1, |
f510cfec | 659 | GFP_NOFS); |
e37c9e69 | 660 | } |
cd1bc465 | 661 | } |
9078a3e1 | 662 | btrfs_set_block_group_used(&cache->item, old_val); |
db94535d CM |
663 | total -= num_bytes; |
664 | bytenr += num_bytes; | |
9078a3e1 CM |
665 | } |
666 | return 0; | |
667 | } | |
324ae4df Y |
668 | static int update_pinned_extents(struct btrfs_root *root, |
669 | u64 bytenr, u64 num, int pin) | |
670 | { | |
671 | u64 len; | |
672 | struct btrfs_block_group_cache *cache; | |
673 | struct btrfs_fs_info *fs_info = root->fs_info; | |
674 | ||
675 | if (pin) { | |
676 | set_extent_dirty(&fs_info->pinned_extents, | |
677 | bytenr, bytenr + num - 1, GFP_NOFS); | |
678 | } else { | |
679 | clear_extent_dirty(&fs_info->pinned_extents, | |
680 | bytenr, bytenr + num - 1, GFP_NOFS); | |
681 | } | |
682 | while (num > 0) { | |
683 | cache = btrfs_lookup_block_group(fs_info, bytenr); | |
684 | WARN_ON(!cache); | |
685 | len = min(num, cache->key.offset - | |
686 | (bytenr - cache->key.objectid)); | |
687 | if (pin) { | |
688 | cache->pinned += len; | |
689 | fs_info->total_pinned += len; | |
690 | } else { | |
691 | cache->pinned -= len; | |
692 | fs_info->total_pinned -= len; | |
693 | } | |
694 | bytenr += len; | |
695 | num -= len; | |
696 | } | |
697 | return 0; | |
698 | } | |
9078a3e1 | 699 | |
1a5bc167 | 700 | int btrfs_copy_pinned(struct btrfs_root *root, struct extent_map_tree *copy) |
ccd467d6 | 701 | { |
ccd467d6 | 702 | u64 last = 0; |
1a5bc167 CM |
703 | u64 start; |
704 | u64 end; | |
705 | struct extent_map_tree *pinned_extents = &root->fs_info->pinned_extents; | |
ccd467d6 | 706 | int ret; |
ccd467d6 CM |
707 | |
708 | while(1) { | |
1a5bc167 CM |
709 | ret = find_first_extent_bit(pinned_extents, last, |
710 | &start, &end, EXTENT_DIRTY); | |
711 | if (ret) | |
ccd467d6 | 712 | break; |
1a5bc167 CM |
713 | set_extent_dirty(copy, start, end, GFP_NOFS); |
714 | last = end + 1; | |
ccd467d6 CM |
715 | } |
716 | return 0; | |
717 | } | |
718 | ||
719 | int btrfs_finish_extent_commit(struct btrfs_trans_handle *trans, | |
720 | struct btrfs_root *root, | |
1a5bc167 | 721 | struct extent_map_tree *unpin) |
a28ec197 | 722 | { |
1a5bc167 CM |
723 | u64 start; |
724 | u64 end; | |
a28ec197 | 725 | int ret; |
f510cfec | 726 | struct extent_map_tree *free_space_cache; |
f510cfec | 727 | free_space_cache = &root->fs_info->free_space_cache; |
a28ec197 CM |
728 | |
729 | while(1) { | |
1a5bc167 CM |
730 | ret = find_first_extent_bit(unpin, 0, &start, &end, |
731 | EXTENT_DIRTY); | |
732 | if (ret) | |
a28ec197 | 733 | break; |
324ae4df | 734 | update_pinned_extents(root, start, end + 1 - start, 0); |
1a5bc167 CM |
735 | clear_extent_dirty(unpin, start, end, GFP_NOFS); |
736 | set_extent_dirty(free_space_cache, start, end, GFP_NOFS); | |
a28ec197 CM |
737 | } |
738 | return 0; | |
739 | } | |
740 | ||
e089f05c CM |
741 | static int finish_current_insert(struct btrfs_trans_handle *trans, struct |
742 | btrfs_root *extent_root) | |
037e6390 | 743 | { |
e2fa7227 | 744 | struct btrfs_key ins; |
234b63a0 | 745 | struct btrfs_extent_item extent_item; |
037e6390 | 746 | int ret; |
1a5bc167 CM |
747 | int err = 0; |
748 | u64 start; | |
749 | u64 end; | |
1261ec42 | 750 | struct btrfs_fs_info *info = extent_root->fs_info; |
037e6390 | 751 | |
5f39d397 | 752 | btrfs_set_stack_extent_refs(&extent_item, 1); |
62e2749e | 753 | btrfs_set_key_type(&ins, BTRFS_EXTENT_ITEM_KEY); |
5f39d397 CM |
754 | btrfs_set_stack_extent_owner(&extent_item, |
755 | extent_root->root_key.objectid); | |
037e6390 | 756 | |
26b8003f | 757 | while(1) { |
1a5bc167 CM |
758 | ret = find_first_extent_bit(&info->extent_ins, 0, &start, |
759 | &end, EXTENT_LOCKED); | |
760 | if (ret) | |
26b8003f CM |
761 | break; |
762 | ||
1a5bc167 CM |
763 | ins.objectid = start; |
764 | ins.offset = end + 1 - start; | |
765 | err = btrfs_insert_item(trans, extent_root, &ins, | |
766 | &extent_item, sizeof(extent_item)); | |
767 | clear_extent_bits(&info->extent_ins, start, end, EXTENT_LOCKED, | |
768 | GFP_NOFS); | |
037e6390 | 769 | } |
037e6390 CM |
770 | return 0; |
771 | } | |
772 | ||
db94535d CM |
773 | static int pin_down_bytes(struct btrfs_root *root, u64 bytenr, u32 num_bytes, |
774 | int pending) | |
e20d96d6 | 775 | { |
1a5bc167 | 776 | int err = 0; |
5f39d397 | 777 | struct extent_buffer *buf; |
8ef97622 | 778 | |
f4b9aa8d | 779 | if (!pending) { |
db94535d | 780 | buf = btrfs_find_tree_block(root, bytenr, num_bytes); |
5f39d397 CM |
781 | if (buf) { |
782 | if (btrfs_buffer_uptodate(buf)) { | |
2c90e5d6 CM |
783 | u64 transid = |
784 | root->fs_info->running_transaction->transid; | |
5f39d397 CM |
785 | if (btrfs_header_generation(buf) == transid) { |
786 | free_extent_buffer(buf); | |
c549228f | 787 | return 1; |
2c90e5d6 | 788 | } |
f4b9aa8d | 789 | } |
5f39d397 | 790 | free_extent_buffer(buf); |
8ef97622 | 791 | } |
324ae4df | 792 | update_pinned_extents(root, bytenr, num_bytes, 1); |
f4b9aa8d | 793 | } else { |
1a5bc167 | 794 | set_extent_bits(&root->fs_info->pending_del, |
db94535d CM |
795 | bytenr, bytenr + num_bytes - 1, |
796 | EXTENT_LOCKED, GFP_NOFS); | |
f4b9aa8d | 797 | } |
be744175 | 798 | BUG_ON(err < 0); |
e20d96d6 CM |
799 | return 0; |
800 | } | |
801 | ||
fec577fb | 802 | /* |
a28ec197 | 803 | * remove an extent from the root, returns 0 on success |
fec577fb | 804 | */ |
e089f05c | 805 | static int __free_extent(struct btrfs_trans_handle *trans, struct btrfs_root |
db94535d | 806 | *root, u64 bytenr, u64 num_bytes, int pin, |
e37c9e69 | 807 | int mark_free) |
a28ec197 | 808 | { |
5caf2a00 | 809 | struct btrfs_path *path; |
e2fa7227 | 810 | struct btrfs_key key; |
1261ec42 CM |
811 | struct btrfs_fs_info *info = root->fs_info; |
812 | struct btrfs_root *extent_root = info->extent_root; | |
5f39d397 | 813 | struct extent_buffer *leaf; |
a28ec197 | 814 | int ret; |
234b63a0 | 815 | struct btrfs_extent_item *ei; |
cf27e1ee | 816 | u32 refs; |
037e6390 | 817 | |
db94535d | 818 | key.objectid = bytenr; |
62e2749e | 819 | btrfs_set_key_type(&key, BTRFS_EXTENT_ITEM_KEY); |
db94535d | 820 | key.offset = num_bytes; |
a28ec197 | 821 | |
5caf2a00 | 822 | path = btrfs_alloc_path(); |
54aa1f4d CM |
823 | if (!path) |
824 | return -ENOMEM; | |
5f26f772 | 825 | |
54aa1f4d CM |
826 | ret = btrfs_search_slot(trans, extent_root, &key, path, -1, 1); |
827 | if (ret < 0) | |
828 | return ret; | |
829 | BUG_ON(ret); | |
5f39d397 CM |
830 | |
831 | leaf = path->nodes[0]; | |
832 | ei = btrfs_item_ptr(leaf, path->slots[0], | |
123abc88 | 833 | struct btrfs_extent_item); |
5f39d397 CM |
834 | refs = btrfs_extent_refs(leaf, ei); |
835 | BUG_ON(refs == 0); | |
836 | refs -= 1; | |
837 | btrfs_set_extent_refs(leaf, ei, refs); | |
838 | btrfs_mark_buffer_dirty(leaf); | |
839 | ||
cf27e1ee | 840 | if (refs == 0) { |
db94535d CM |
841 | u64 super_used; |
842 | u64 root_used; | |
78fae27e CM |
843 | |
844 | if (pin) { | |
db94535d | 845 | ret = pin_down_bytes(root, bytenr, num_bytes, 0); |
c549228f Y |
846 | if (ret > 0) |
847 | mark_free = 1; | |
848 | BUG_ON(ret < 0); | |
78fae27e CM |
849 | } |
850 | ||
58176a96 | 851 | /* block accounting for super block */ |
db94535d CM |
852 | super_used = btrfs_super_bytes_used(&info->super_copy); |
853 | btrfs_set_super_bytes_used(&info->super_copy, | |
854 | super_used - num_bytes); | |
58176a96 JB |
855 | |
856 | /* block accounting for root item */ | |
db94535d | 857 | root_used = btrfs_root_used(&root->root_item); |
5f39d397 | 858 | btrfs_set_root_used(&root->root_item, |
db94535d | 859 | root_used - num_bytes); |
58176a96 | 860 | |
5caf2a00 | 861 | ret = btrfs_del_item(trans, extent_root, path); |
54aa1f4d CM |
862 | if (ret) { |
863 | return ret; | |
864 | } | |
db94535d | 865 | ret = update_block_group(trans, root, bytenr, num_bytes, 0, |
1e2677e0 | 866 | mark_free, 0); |
9078a3e1 | 867 | BUG_ON(ret); |
a28ec197 | 868 | } |
5caf2a00 | 869 | btrfs_free_path(path); |
e089f05c | 870 | finish_current_insert(trans, extent_root); |
a28ec197 CM |
871 | return ret; |
872 | } | |
873 | ||
a28ec197 CM |
874 | /* |
875 | * find all the blocks marked as pending in the radix tree and remove | |
876 | * them from the extent map | |
877 | */ | |
e089f05c CM |
878 | static int del_pending_extents(struct btrfs_trans_handle *trans, struct |
879 | btrfs_root *extent_root) | |
a28ec197 CM |
880 | { |
881 | int ret; | |
e20d96d6 | 882 | int err = 0; |
1a5bc167 CM |
883 | u64 start; |
884 | u64 end; | |
885 | struct extent_map_tree *pending_del; | |
886 | struct extent_map_tree *pinned_extents; | |
8ef97622 | 887 | |
1a5bc167 CM |
888 | pending_del = &extent_root->fs_info->pending_del; |
889 | pinned_extents = &extent_root->fs_info->pinned_extents; | |
a28ec197 CM |
890 | |
891 | while(1) { | |
1a5bc167 CM |
892 | ret = find_first_extent_bit(pending_del, 0, &start, &end, |
893 | EXTENT_LOCKED); | |
894 | if (ret) | |
a28ec197 | 895 | break; |
324ae4df | 896 | update_pinned_extents(extent_root, start, end + 1 - start, 1); |
1a5bc167 CM |
897 | clear_extent_bits(pending_del, start, end, EXTENT_LOCKED, |
898 | GFP_NOFS); | |
899 | ret = __free_extent(trans, extent_root, | |
900 | start, end + 1 - start, 0, 0); | |
901 | if (ret) | |
902 | err = ret; | |
fec577fb | 903 | } |
e20d96d6 | 904 | return err; |
fec577fb CM |
905 | } |
906 | ||
907 | /* | |
908 | * remove an extent from the root, returns 0 on success | |
909 | */ | |
e089f05c | 910 | int btrfs_free_extent(struct btrfs_trans_handle *trans, struct btrfs_root |
db94535d | 911 | *root, u64 bytenr, u64 num_bytes, int pin) |
fec577fb | 912 | { |
9f5fae2f | 913 | struct btrfs_root *extent_root = root->fs_info->extent_root; |
fec577fb CM |
914 | int pending_ret; |
915 | int ret; | |
a28ec197 | 916 | |
db94535d | 917 | WARN_ON(num_bytes < root->sectorsize); |
fec577fb | 918 | if (root == extent_root) { |
db94535d | 919 | pin_down_bytes(root, bytenr, num_bytes, 1); |
fec577fb CM |
920 | return 0; |
921 | } | |
db94535d | 922 | ret = __free_extent(trans, root, bytenr, num_bytes, pin, pin == 0); |
e20d96d6 | 923 | pending_ret = del_pending_extents(trans, root->fs_info->extent_root); |
fec577fb CM |
924 | return ret ? ret : pending_ret; |
925 | } | |
926 | ||
927 | /* | |
928 | * walks the btree of allocated extents and find a hole of a given size. | |
929 | * The key ins is changed to record the hole: | |
930 | * ins->objectid == block start | |
62e2749e | 931 | * ins->flags = BTRFS_EXTENT_ITEM_KEY |
fec577fb CM |
932 | * ins->offset == number of blocks |
933 | * Any available blocks before search_start are skipped. | |
934 | */ | |
e089f05c | 935 | static int find_free_extent(struct btrfs_trans_handle *trans, struct btrfs_root |
db94535d CM |
936 | *orig_root, u64 num_bytes, u64 empty_size, |
937 | u64 search_start, u64 search_end, u64 hint_byte, | |
f2654de4 CM |
938 | struct btrfs_key *ins, u64 exclude_start, |
939 | u64 exclude_nr, int data) | |
fec577fb | 940 | { |
5caf2a00 | 941 | struct btrfs_path *path; |
e2fa7227 | 942 | struct btrfs_key key; |
fec577fb CM |
943 | int ret; |
944 | u64 hole_size = 0; | |
945 | int slot = 0; | |
db94535d | 946 | u64 last_byte = 0; |
be744175 | 947 | u64 orig_search_start = search_start; |
fec577fb | 948 | int start_found; |
5f39d397 | 949 | struct extent_buffer *l; |
9f5fae2f | 950 | struct btrfs_root * root = orig_root->fs_info->extent_root; |
f2458e1d | 951 | struct btrfs_fs_info *info = root->fs_info; |
db94535d | 952 | u64 total_needed = num_bytes; |
e20d96d6 | 953 | int level; |
be08c1b9 | 954 | struct btrfs_block_group_cache *block_group; |
be744175 | 955 | int full_scan = 0; |
fbdc762b | 956 | int wrapped = 0; |
f84a8b36 | 957 | u64 cached_start; |
fec577fb | 958 | |
db94535d | 959 | WARN_ON(num_bytes < root->sectorsize); |
b1a4d965 CM |
960 | btrfs_set_key_type(ins, BTRFS_EXTENT_ITEM_KEY); |
961 | ||
5f39d397 CM |
962 | level = btrfs_header_level(root->node); |
963 | ||
257d0ce3 CM |
964 | if (num_bytes >= 96 * 1024 * 1024 && hint_byte) { |
965 | data = BTRFS_BLOCK_GROUP_MIXED; | |
966 | } | |
967 | ||
3e1ad54f | 968 | if (search_end == (u64)-1) |
db94535d CM |
969 | search_end = btrfs_super_total_bytes(&info->super_copy); |
970 | if (hint_byte) { | |
971 | block_group = btrfs_lookup_block_group(info, hint_byte); | |
be744175 | 972 | block_group = btrfs_find_block_group(root, block_group, |
db94535d | 973 | hint_byte, data, 1); |
be744175 CM |
974 | } else { |
975 | block_group = btrfs_find_block_group(root, | |
976 | trans->block_group, 0, | |
de428b63 | 977 | data, 1); |
be744175 CM |
978 | } |
979 | ||
6702ed49 | 980 | total_needed += empty_size; |
e011599b | 981 | path = btrfs_alloc_path(); |
be744175 | 982 | check_failed: |
5e5745dc Y |
983 | search_start = find_search_start(root, &block_group, search_start, |
984 | total_needed, data, full_scan); | |
f84a8b36 | 985 | cached_start = search_start; |
5caf2a00 | 986 | btrfs_init_path(path); |
fec577fb CM |
987 | ins->objectid = search_start; |
988 | ins->offset = 0; | |
fec577fb | 989 | start_found = 0; |
2cc58cf2 | 990 | path->reada = 2; |
e37c9e69 | 991 | |
5caf2a00 | 992 | ret = btrfs_search_slot(trans, root, ins, path, 0, 0); |
0f70abe2 CM |
993 | if (ret < 0) |
994 | goto error; | |
aa5d6bed | 995 | |
e37c9e69 | 996 | if (path->slots[0] > 0) { |
5caf2a00 | 997 | path->slots[0]--; |
e37c9e69 CM |
998 | } |
999 | ||
5f39d397 CM |
1000 | l = path->nodes[0]; |
1001 | btrfs_item_key_to_cpu(l, &key, path->slots[0]); | |
1002 | ||
e37c9e69 CM |
1003 | /* |
1004 | * a rare case, go back one key if we hit a block group item | |
1005 | * instead of an extent item | |
1006 | */ | |
1007 | if (btrfs_key_type(&key) != BTRFS_EXTENT_ITEM_KEY && | |
1008 | key.objectid + key.offset >= search_start) { | |
1009 | ins->objectid = key.objectid; | |
1010 | ins->offset = key.offset - 1; | |
1011 | btrfs_release_path(root, path); | |
1012 | ret = btrfs_search_slot(trans, root, ins, path, 0, 0); | |
1013 | if (ret < 0) | |
1014 | goto error; | |
1015 | ||
1016 | if (path->slots[0] > 0) { | |
1017 | path->slots[0]--; | |
1018 | } | |
1019 | } | |
0579da42 | 1020 | |
fec577fb | 1021 | while (1) { |
5f39d397 | 1022 | l = path->nodes[0]; |
5caf2a00 | 1023 | slot = path->slots[0]; |
5f39d397 | 1024 | if (slot >= btrfs_header_nritems(l)) { |
5caf2a00 | 1025 | ret = btrfs_next_leaf(root, path); |
fec577fb CM |
1026 | if (ret == 0) |
1027 | continue; | |
0f70abe2 CM |
1028 | if (ret < 0) |
1029 | goto error; | |
e19caa5f CM |
1030 | |
1031 | search_start = max(search_start, | |
1032 | block_group->key.objectid); | |
fec577fb CM |
1033 | if (!start_found) { |
1034 | ins->objectid = search_start; | |
3e1ad54f | 1035 | ins->offset = search_end - search_start; |
fec577fb CM |
1036 | start_found = 1; |
1037 | goto check_pending; | |
1038 | } | |
db94535d CM |
1039 | ins->objectid = last_byte > search_start ? |
1040 | last_byte : search_start; | |
3e1ad54f | 1041 | ins->offset = search_end - ins->objectid; |
e19caa5f | 1042 | BUG_ON(ins->objectid >= search_end); |
fec577fb CM |
1043 | goto check_pending; |
1044 | } | |
5f39d397 | 1045 | btrfs_item_key_to_cpu(l, &key, slot); |
96b5179d | 1046 | |
db94535d | 1047 | if (key.objectid >= search_start && key.objectid > last_byte && |
e37c9e69 | 1048 | start_found) { |
db94535d CM |
1049 | if (last_byte < search_start) |
1050 | last_byte = search_start; | |
1051 | hole_size = key.objectid - last_byte; | |
1052 | if (hole_size >= num_bytes) { | |
1053 | ins->objectid = last_byte; | |
e37c9e69 CM |
1054 | ins->offset = hole_size; |
1055 | goto check_pending; | |
0579da42 | 1056 | } |
fec577fb | 1057 | } |
96b5179d CM |
1058 | if (btrfs_key_type(&key) != BTRFS_EXTENT_ITEM_KEY) { |
1059 | if (!start_found) { | |
db94535d | 1060 | last_byte = key.objectid; |
96b5179d CM |
1061 | start_found = 1; |
1062 | } | |
e37c9e69 | 1063 | goto next; |
96b5179d CM |
1064 | } |
1065 | ||
e37c9e69 | 1066 | |
0579da42 | 1067 | start_found = 1; |
db94535d | 1068 | last_byte = key.objectid + key.offset; |
f510cfec | 1069 | |
257d0ce3 CM |
1070 | if (!full_scan && data != BTRFS_BLOCK_GROUP_MIXED && |
1071 | last_byte >= block_group->key.objectid + | |
be744175 CM |
1072 | block_group->key.offset) { |
1073 | btrfs_release_path(root, path); | |
1074 | search_start = block_group->key.objectid + | |
e19caa5f | 1075 | block_group->key.offset; |
be744175 CM |
1076 | goto new_group; |
1077 | } | |
9078a3e1 | 1078 | next: |
5caf2a00 | 1079 | path->slots[0]++; |
de428b63 | 1080 | cond_resched(); |
fec577fb | 1081 | } |
fec577fb CM |
1082 | check_pending: |
1083 | /* we have to make sure we didn't find an extent that has already | |
1084 | * been allocated by the map tree or the original allocation | |
1085 | */ | |
5caf2a00 | 1086 | btrfs_release_path(root, path); |
fec577fb | 1087 | BUG_ON(ins->objectid < search_start); |
e37c9e69 | 1088 | |
db94535d | 1089 | if (ins->objectid + num_bytes >= search_end) |
cf67582b CM |
1090 | goto enospc; |
1091 | ||
257d0ce3 CM |
1092 | if (!full_scan && data != BTRFS_BLOCK_GROUP_MIXED && |
1093 | ins->objectid + num_bytes >= block_group-> | |
e19caa5f CM |
1094 | key.objectid + block_group->key.offset) { |
1095 | search_start = block_group->key.objectid + | |
1096 | block_group->key.offset; | |
1097 | goto new_group; | |
1098 | } | |
1a5bc167 | 1099 | if (test_range_bit(&info->extent_ins, ins->objectid, |
db94535d CM |
1100 | ins->objectid + num_bytes -1, EXTENT_LOCKED, 0)) { |
1101 | search_start = ins->objectid + num_bytes; | |
1a5bc167 CM |
1102 | goto new_group; |
1103 | } | |
1104 | if (test_range_bit(&info->pinned_extents, ins->objectid, | |
db94535d CM |
1105 | ins->objectid + num_bytes -1, EXTENT_DIRTY, 0)) { |
1106 | search_start = ins->objectid + num_bytes; | |
1a5bc167 | 1107 | goto new_group; |
fec577fb | 1108 | } |
db94535d | 1109 | if (exclude_nr > 0 && (ins->objectid + num_bytes > exclude_start && |
f2654de4 CM |
1110 | ins->objectid < exclude_start + exclude_nr)) { |
1111 | search_start = exclude_start + exclude_nr; | |
1112 | goto new_group; | |
1113 | } | |
e37c9e69 | 1114 | if (!data) { |
5276aeda | 1115 | block_group = btrfs_lookup_block_group(info, ins->objectid); |
26b8003f CM |
1116 | if (block_group) |
1117 | trans->block_group = block_group; | |
f2458e1d | 1118 | } |
db94535d | 1119 | ins->offset = num_bytes; |
5caf2a00 | 1120 | btrfs_free_path(path); |
fec577fb | 1121 | return 0; |
be744175 CM |
1122 | |
1123 | new_group: | |
db94535d | 1124 | if (search_start + num_bytes >= search_end) { |
cf67582b | 1125 | enospc: |
be744175 | 1126 | search_start = orig_search_start; |
fbdc762b CM |
1127 | if (full_scan) { |
1128 | ret = -ENOSPC; | |
1129 | goto error; | |
1130 | } | |
6702ed49 CM |
1131 | if (wrapped) { |
1132 | if (!full_scan) | |
1133 | total_needed -= empty_size; | |
fbdc762b | 1134 | full_scan = 1; |
6702ed49 | 1135 | } else |
fbdc762b | 1136 | wrapped = 1; |
be744175 | 1137 | } |
5276aeda | 1138 | block_group = btrfs_lookup_block_group(info, search_start); |
fbdc762b | 1139 | cond_resched(); |
be744175 CM |
1140 | if (!full_scan) |
1141 | block_group = btrfs_find_block_group(root, block_group, | |
de428b63 | 1142 | search_start, data, 0); |
be744175 CM |
1143 | goto check_failed; |
1144 | ||
0f70abe2 | 1145 | error: |
5caf2a00 CM |
1146 | btrfs_release_path(root, path); |
1147 | btrfs_free_path(path); | |
0f70abe2 | 1148 | return ret; |
fec577fb | 1149 | } |
fec577fb CM |
1150 | /* |
1151 | * finds a free extent and does all the dirty work required for allocation | |
1152 | * returns the key for the extent through ins, and a tree buffer for | |
1153 | * the first block of the extent through buf. | |
1154 | * | |
1155 | * returns 0 if everything worked, non-zero otherwise. | |
1156 | */ | |
4d775673 CM |
1157 | int btrfs_alloc_extent(struct btrfs_trans_handle *trans, |
1158 | struct btrfs_root *root, u64 owner, | |
db94535d | 1159 | u64 num_bytes, u64 empty_size, u64 hint_byte, |
be08c1b9 | 1160 | u64 search_end, struct btrfs_key *ins, int data) |
fec577fb CM |
1161 | { |
1162 | int ret; | |
1163 | int pending_ret; | |
db94535d | 1164 | u64 super_used, root_used; |
fbdc762b | 1165 | u64 search_start = 0; |
1261ec42 CM |
1166 | struct btrfs_fs_info *info = root->fs_info; |
1167 | struct btrfs_root *extent_root = info->extent_root; | |
234b63a0 | 1168 | struct btrfs_extent_item extent_item; |
037e6390 | 1169 | |
5f39d397 CM |
1170 | btrfs_set_stack_extent_refs(&extent_item, 1); |
1171 | btrfs_set_stack_extent_owner(&extent_item, owner); | |
fec577fb | 1172 | |
db94535d CM |
1173 | WARN_ON(num_bytes < root->sectorsize); |
1174 | ret = find_free_extent(trans, root, num_bytes, empty_size, | |
1175 | search_start, search_end, hint_byte, ins, | |
26b8003f CM |
1176 | trans->alloc_exclude_start, |
1177 | trans->alloc_exclude_nr, data); | |
ccd467d6 | 1178 | BUG_ON(ret); |
f2654de4 CM |
1179 | if (ret) |
1180 | return ret; | |
fec577fb | 1181 | |
58176a96 | 1182 | /* block accounting for super block */ |
db94535d CM |
1183 | super_used = btrfs_super_bytes_used(&info->super_copy); |
1184 | btrfs_set_super_bytes_used(&info->super_copy, super_used + num_bytes); | |
26b8003f | 1185 | |
58176a96 | 1186 | /* block accounting for root item */ |
db94535d CM |
1187 | root_used = btrfs_root_used(&root->root_item); |
1188 | btrfs_set_root_used(&root->root_item, root_used + num_bytes); | |
58176a96 | 1189 | |
f510cfec CM |
1190 | clear_extent_dirty(&root->fs_info->free_space_cache, |
1191 | ins->objectid, ins->objectid + ins->offset - 1, | |
1192 | GFP_NOFS); | |
1193 | ||
26b8003f | 1194 | if (root == extent_root) { |
1a5bc167 CM |
1195 | set_extent_bits(&root->fs_info->extent_ins, ins->objectid, |
1196 | ins->objectid + ins->offset - 1, | |
1197 | EXTENT_LOCKED, GFP_NOFS); | |
e19caa5f | 1198 | WARN_ON(data == 1); |
26b8003f CM |
1199 | goto update_block; |
1200 | } | |
1201 | ||
1202 | WARN_ON(trans->alloc_exclude_nr); | |
1203 | trans->alloc_exclude_start = ins->objectid; | |
1204 | trans->alloc_exclude_nr = ins->offset; | |
e089f05c CM |
1205 | ret = btrfs_insert_item(trans, extent_root, ins, &extent_item, |
1206 | sizeof(extent_item)); | |
037e6390 | 1207 | |
26b8003f CM |
1208 | trans->alloc_exclude_start = 0; |
1209 | trans->alloc_exclude_nr = 0; | |
1210 | ||
ccd467d6 | 1211 | BUG_ON(ret); |
e089f05c | 1212 | finish_current_insert(trans, extent_root); |
e20d96d6 | 1213 | pending_ret = del_pending_extents(trans, extent_root); |
f510cfec | 1214 | |
e37c9e69 | 1215 | if (ret) { |
037e6390 | 1216 | return ret; |
e37c9e69 CM |
1217 | } |
1218 | if (pending_ret) { | |
037e6390 | 1219 | return pending_ret; |
e37c9e69 | 1220 | } |
26b8003f CM |
1221 | |
1222 | update_block: | |
1e2677e0 CM |
1223 | ret = update_block_group(trans, root, ins->objectid, ins->offset, 1, 0, |
1224 | data); | |
fabb5681 | 1225 | BUG_ON(ret); |
037e6390 | 1226 | return 0; |
fec577fb CM |
1227 | } |
1228 | ||
1229 | /* | |
1230 | * helper function to allocate a block for a given tree | |
1231 | * returns the tree buffer or NULL. | |
1232 | */ | |
5f39d397 | 1233 | struct extent_buffer *btrfs_alloc_free_block(struct btrfs_trans_handle *trans, |
db94535d CM |
1234 | struct btrfs_root *root, |
1235 | u32 blocksize, u64 hint, | |
5f39d397 | 1236 | u64 empty_size) |
fec577fb | 1237 | { |
e2fa7227 | 1238 | struct btrfs_key ins; |
fec577fb | 1239 | int ret; |
5f39d397 | 1240 | struct extent_buffer *buf; |
fec577fb | 1241 | |
4d775673 | 1242 | ret = btrfs_alloc_extent(trans, root, root->root_key.objectid, |
db94535d CM |
1243 | blocksize, empty_size, hint, |
1244 | (u64)-1, &ins, 0); | |
fec577fb | 1245 | if (ret) { |
54aa1f4d CM |
1246 | BUG_ON(ret > 0); |
1247 | return ERR_PTR(ret); | |
fec577fb | 1248 | } |
db94535d | 1249 | buf = btrfs_find_create_tree_block(root, ins.objectid, blocksize); |
54aa1f4d | 1250 | if (!buf) { |
db94535d | 1251 | btrfs_free_extent(trans, root, ins.objectid, blocksize, 0); |
54aa1f4d CM |
1252 | return ERR_PTR(-ENOMEM); |
1253 | } | |
5f39d397 CM |
1254 | btrfs_set_buffer_uptodate(buf); |
1255 | set_extent_dirty(&trans->transaction->dirty_pages, buf->start, | |
1256 | buf->start + buf->len - 1, GFP_NOFS); | |
19c00ddc CM |
1257 | set_extent_bits(&BTRFS_I(root->fs_info->btree_inode)->extent_tree, |
1258 | buf->start, buf->start + buf->len - 1, | |
1259 | EXTENT_CSUM, GFP_NOFS); | |
1260 | buf->flags |= EXTENT_CSUM; | |
6b80053d | 1261 | btrfs_set_buffer_defrag(buf); |
d3c2fdcf | 1262 | trans->blocks_used++; |
fec577fb CM |
1263 | return buf; |
1264 | } | |
a28ec197 | 1265 | |
6407bf6d | 1266 | static int drop_leaf_ref(struct btrfs_trans_handle *trans, |
5f39d397 | 1267 | struct btrfs_root *root, struct extent_buffer *leaf) |
6407bf6d | 1268 | { |
5f39d397 | 1269 | struct btrfs_key key; |
6407bf6d CM |
1270 | struct btrfs_file_extent_item *fi; |
1271 | int i; | |
1272 | int nritems; | |
1273 | int ret; | |
1274 | ||
5f39d397 CM |
1275 | BUG_ON(!btrfs_is_leaf(leaf)); |
1276 | nritems = btrfs_header_nritems(leaf); | |
6407bf6d | 1277 | for (i = 0; i < nritems; i++) { |
db94535d | 1278 | u64 disk_bytenr; |
5f39d397 CM |
1279 | |
1280 | btrfs_item_key_to_cpu(leaf, &key, i); | |
1281 | if (btrfs_key_type(&key) != BTRFS_EXTENT_DATA_KEY) | |
6407bf6d CM |
1282 | continue; |
1283 | fi = btrfs_item_ptr(leaf, i, struct btrfs_file_extent_item); | |
5f39d397 CM |
1284 | if (btrfs_file_extent_type(leaf, fi) == |
1285 | BTRFS_FILE_EXTENT_INLINE) | |
236454df | 1286 | continue; |
6407bf6d CM |
1287 | /* |
1288 | * FIXME make sure to insert a trans record that | |
1289 | * repeats the snapshot del on crash | |
1290 | */ | |
db94535d CM |
1291 | disk_bytenr = btrfs_file_extent_disk_bytenr(leaf, fi); |
1292 | if (disk_bytenr == 0) | |
3a686375 | 1293 | continue; |
db94535d CM |
1294 | ret = btrfs_free_extent(trans, root, disk_bytenr, |
1295 | btrfs_file_extent_disk_num_bytes(leaf, fi), 0); | |
6407bf6d CM |
1296 | BUG_ON(ret); |
1297 | } | |
1298 | return 0; | |
1299 | } | |
1300 | ||
e011599b | 1301 | static void reada_walk_down(struct btrfs_root *root, |
5f39d397 | 1302 | struct extent_buffer *node) |
e011599b CM |
1303 | { |
1304 | int i; | |
1305 | u32 nritems; | |
db94535d | 1306 | u64 bytenr; |
e011599b CM |
1307 | int ret; |
1308 | u32 refs; | |
db94535d CM |
1309 | int level; |
1310 | u32 blocksize; | |
e011599b | 1311 | |
5f39d397 | 1312 | nritems = btrfs_header_nritems(node); |
db94535d | 1313 | level = btrfs_header_level(node); |
e011599b | 1314 | for (i = 0; i < nritems; i++) { |
db94535d CM |
1315 | bytenr = btrfs_node_blockptr(node, i); |
1316 | blocksize = btrfs_level_size(root, level - 1); | |
1317 | ret = lookup_extent_ref(NULL, root, bytenr, blocksize, &refs); | |
e011599b CM |
1318 | BUG_ON(ret); |
1319 | if (refs != 1) | |
1320 | continue; | |
409eb95d | 1321 | mutex_unlock(&root->fs_info->fs_mutex); |
db94535d | 1322 | ret = readahead_tree_block(root, bytenr, blocksize); |
409eb95d CM |
1323 | cond_resched(); |
1324 | mutex_lock(&root->fs_info->fs_mutex); | |
e011599b CM |
1325 | if (ret) |
1326 | break; | |
1327 | } | |
1328 | } | |
1329 | ||
9aca1d51 CM |
1330 | /* |
1331 | * helper function for drop_snapshot, this walks down the tree dropping ref | |
1332 | * counts as it goes. | |
1333 | */ | |
e089f05c CM |
1334 | static int walk_down_tree(struct btrfs_trans_handle *trans, struct btrfs_root |
1335 | *root, struct btrfs_path *path, int *level) | |
20524f02 | 1336 | { |
5f39d397 CM |
1337 | struct extent_buffer *next; |
1338 | struct extent_buffer *cur; | |
db94535d CM |
1339 | u64 bytenr; |
1340 | u32 blocksize; | |
20524f02 CM |
1341 | int ret; |
1342 | u32 refs; | |
1343 | ||
5caf2a00 CM |
1344 | WARN_ON(*level < 0); |
1345 | WARN_ON(*level >= BTRFS_MAX_LEVEL); | |
5f39d397 | 1346 | ret = lookup_extent_ref(trans, root, |
db94535d CM |
1347 | path->nodes[*level]->start, |
1348 | path->nodes[*level]->len, &refs); | |
20524f02 CM |
1349 | BUG_ON(ret); |
1350 | if (refs > 1) | |
1351 | goto out; | |
e011599b | 1352 | |
9aca1d51 CM |
1353 | /* |
1354 | * walk down to the last node level and free all the leaves | |
1355 | */ | |
6407bf6d | 1356 | while(*level >= 0) { |
5caf2a00 CM |
1357 | WARN_ON(*level < 0); |
1358 | WARN_ON(*level >= BTRFS_MAX_LEVEL); | |
20524f02 | 1359 | cur = path->nodes[*level]; |
e011599b CM |
1360 | |
1361 | if (*level > 0 && path->slots[*level] == 0) | |
5f39d397 | 1362 | reada_walk_down(root, cur); |
e011599b | 1363 | |
5f39d397 | 1364 | if (btrfs_header_level(cur) != *level) |
2c90e5d6 | 1365 | WARN_ON(1); |
e011599b | 1366 | |
7518a238 | 1367 | if (path->slots[*level] >= |
5f39d397 | 1368 | btrfs_header_nritems(cur)) |
20524f02 | 1369 | break; |
6407bf6d CM |
1370 | if (*level == 0) { |
1371 | ret = drop_leaf_ref(trans, root, cur); | |
1372 | BUG_ON(ret); | |
1373 | break; | |
1374 | } | |
db94535d CM |
1375 | bytenr = btrfs_node_blockptr(cur, path->slots[*level]); |
1376 | blocksize = btrfs_level_size(root, *level - 1); | |
1377 | ret = lookup_extent_ref(trans, root, bytenr, blocksize, &refs); | |
6407bf6d CM |
1378 | BUG_ON(ret); |
1379 | if (refs != 1) { | |
20524f02 | 1380 | path->slots[*level]++; |
db94535d CM |
1381 | ret = btrfs_free_extent(trans, root, bytenr, |
1382 | blocksize, 1); | |
20524f02 CM |
1383 | BUG_ON(ret); |
1384 | continue; | |
1385 | } | |
db94535d | 1386 | next = btrfs_find_tree_block(root, bytenr, blocksize); |
5f39d397 CM |
1387 | if (!next || !btrfs_buffer_uptodate(next)) { |
1388 | free_extent_buffer(next); | |
e9d0b13b | 1389 | mutex_unlock(&root->fs_info->fs_mutex); |
db94535d | 1390 | next = read_tree_block(root, bytenr, blocksize); |
e9d0b13b CM |
1391 | mutex_lock(&root->fs_info->fs_mutex); |
1392 | ||
1393 | /* we dropped the lock, check one more time */ | |
db94535d CM |
1394 | ret = lookup_extent_ref(trans, root, bytenr, |
1395 | blocksize, &refs); | |
e9d0b13b CM |
1396 | BUG_ON(ret); |
1397 | if (refs != 1) { | |
1398 | path->slots[*level]++; | |
5f39d397 | 1399 | free_extent_buffer(next); |
e9d0b13b | 1400 | ret = btrfs_free_extent(trans, root, |
db94535d | 1401 | bytenr, blocksize, 1); |
e9d0b13b CM |
1402 | BUG_ON(ret); |
1403 | continue; | |
1404 | } | |
1405 | } | |
5caf2a00 | 1406 | WARN_ON(*level <= 0); |
83e15a28 | 1407 | if (path->nodes[*level-1]) |
5f39d397 | 1408 | free_extent_buffer(path->nodes[*level-1]); |
20524f02 | 1409 | path->nodes[*level-1] = next; |
5f39d397 | 1410 | *level = btrfs_header_level(next); |
20524f02 CM |
1411 | path->slots[*level] = 0; |
1412 | } | |
1413 | out: | |
5caf2a00 CM |
1414 | WARN_ON(*level < 0); |
1415 | WARN_ON(*level >= BTRFS_MAX_LEVEL); | |
db94535d CM |
1416 | ret = btrfs_free_extent(trans, root, path->nodes[*level]->start, |
1417 | path->nodes[*level]->len, 1); | |
5f39d397 | 1418 | free_extent_buffer(path->nodes[*level]); |
20524f02 CM |
1419 | path->nodes[*level] = NULL; |
1420 | *level += 1; | |
1421 | BUG_ON(ret); | |
1422 | return 0; | |
1423 | } | |
1424 | ||
9aca1d51 CM |
1425 | /* |
1426 | * helper for dropping snapshots. This walks back up the tree in the path | |
1427 | * to find the first node higher up where we haven't yet gone through | |
1428 | * all the slots | |
1429 | */ | |
e089f05c CM |
1430 | static int walk_up_tree(struct btrfs_trans_handle *trans, struct btrfs_root |
1431 | *root, struct btrfs_path *path, int *level) | |
20524f02 CM |
1432 | { |
1433 | int i; | |
1434 | int slot; | |
1435 | int ret; | |
9f3a7427 CM |
1436 | struct btrfs_root_item *root_item = &root->root_item; |
1437 | ||
234b63a0 | 1438 | for(i = *level; i < BTRFS_MAX_LEVEL - 1 && path->nodes[i]; i++) { |
20524f02 | 1439 | slot = path->slots[i]; |
5f39d397 CM |
1440 | if (slot < btrfs_header_nritems(path->nodes[i]) - 1) { |
1441 | struct extent_buffer *node; | |
1442 | struct btrfs_disk_key disk_key; | |
1443 | node = path->nodes[i]; | |
20524f02 CM |
1444 | path->slots[i]++; |
1445 | *level = i; | |
9f3a7427 | 1446 | WARN_ON(*level == 0); |
5f39d397 | 1447 | btrfs_node_key(node, &disk_key, path->slots[i]); |
9f3a7427 | 1448 | memcpy(&root_item->drop_progress, |
5f39d397 | 1449 | &disk_key, sizeof(disk_key)); |
9f3a7427 | 1450 | root_item->drop_level = i; |
20524f02 CM |
1451 | return 0; |
1452 | } else { | |
e089f05c | 1453 | ret = btrfs_free_extent(trans, root, |
db94535d CM |
1454 | path->nodes[*level]->start, |
1455 | path->nodes[*level]->len, 1); | |
6407bf6d | 1456 | BUG_ON(ret); |
5f39d397 | 1457 | free_extent_buffer(path->nodes[*level]); |
83e15a28 | 1458 | path->nodes[*level] = NULL; |
20524f02 | 1459 | *level = i + 1; |
20524f02 CM |
1460 | } |
1461 | } | |
1462 | return 1; | |
1463 | } | |
1464 | ||
9aca1d51 CM |
1465 | /* |
1466 | * drop the reference count on the tree rooted at 'snap'. This traverses | |
1467 | * the tree freeing any blocks that have a ref count of zero after being | |
1468 | * decremented. | |
1469 | */ | |
e089f05c | 1470 | int btrfs_drop_snapshot(struct btrfs_trans_handle *trans, struct btrfs_root |
9f3a7427 | 1471 | *root) |
20524f02 | 1472 | { |
3768f368 | 1473 | int ret = 0; |
9aca1d51 | 1474 | int wret; |
20524f02 | 1475 | int level; |
5caf2a00 | 1476 | struct btrfs_path *path; |
20524f02 CM |
1477 | int i; |
1478 | int orig_level; | |
9f3a7427 | 1479 | struct btrfs_root_item *root_item = &root->root_item; |
20524f02 | 1480 | |
5caf2a00 CM |
1481 | path = btrfs_alloc_path(); |
1482 | BUG_ON(!path); | |
20524f02 | 1483 | |
5f39d397 | 1484 | level = btrfs_header_level(root->node); |
20524f02 | 1485 | orig_level = level; |
9f3a7427 CM |
1486 | if (btrfs_disk_key_objectid(&root_item->drop_progress) == 0) { |
1487 | path->nodes[level] = root->node; | |
f510cfec | 1488 | extent_buffer_get(root->node); |
9f3a7427 CM |
1489 | path->slots[level] = 0; |
1490 | } else { | |
1491 | struct btrfs_key key; | |
5f39d397 CM |
1492 | struct btrfs_disk_key found_key; |
1493 | struct extent_buffer *node; | |
6702ed49 | 1494 | |
9f3a7427 | 1495 | btrfs_disk_key_to_cpu(&key, &root_item->drop_progress); |
6702ed49 CM |
1496 | level = root_item->drop_level; |
1497 | path->lowest_level = level; | |
9f3a7427 | 1498 | wret = btrfs_search_slot(NULL, root, &key, path, 0, 0); |
6702ed49 | 1499 | if (wret < 0) { |
9f3a7427 CM |
1500 | ret = wret; |
1501 | goto out; | |
1502 | } | |
5f39d397 CM |
1503 | node = path->nodes[level]; |
1504 | btrfs_node_key(node, &found_key, path->slots[level]); | |
1505 | WARN_ON(memcmp(&found_key, &root_item->drop_progress, | |
1506 | sizeof(found_key))); | |
9f3a7427 | 1507 | } |
20524f02 | 1508 | while(1) { |
5caf2a00 | 1509 | wret = walk_down_tree(trans, root, path, &level); |
9aca1d51 | 1510 | if (wret > 0) |
20524f02 | 1511 | break; |
9aca1d51 CM |
1512 | if (wret < 0) |
1513 | ret = wret; | |
1514 | ||
5caf2a00 | 1515 | wret = walk_up_tree(trans, root, path, &level); |
9aca1d51 | 1516 | if (wret > 0) |
20524f02 | 1517 | break; |
9aca1d51 CM |
1518 | if (wret < 0) |
1519 | ret = wret; | |
409eb95d | 1520 | ret = -EAGAIN; |
409eb95d | 1521 | break; |
20524f02 | 1522 | } |
83e15a28 | 1523 | for (i = 0; i <= orig_level; i++) { |
5caf2a00 | 1524 | if (path->nodes[i]) { |
5f39d397 | 1525 | free_extent_buffer(path->nodes[i]); |
0f82731f | 1526 | path->nodes[i] = NULL; |
83e15a28 | 1527 | } |
20524f02 | 1528 | } |
9f3a7427 | 1529 | out: |
5caf2a00 | 1530 | btrfs_free_path(path); |
9aca1d51 | 1531 | return ret; |
20524f02 | 1532 | } |
9078a3e1 | 1533 | |
96b5179d | 1534 | int btrfs_free_block_groups(struct btrfs_fs_info *info) |
9078a3e1 | 1535 | { |
96b5179d CM |
1536 | u64 start; |
1537 | u64 end; | |
b97f9203 | 1538 | u64 ptr; |
9078a3e1 | 1539 | int ret; |
9078a3e1 | 1540 | while(1) { |
96b5179d CM |
1541 | ret = find_first_extent_bit(&info->block_group_cache, 0, |
1542 | &start, &end, (unsigned int)-1); | |
1543 | if (ret) | |
9078a3e1 | 1544 | break; |
b97f9203 Y |
1545 | ret = get_state_private(&info->block_group_cache, start, &ptr); |
1546 | if (!ret) | |
1547 | kfree((void *)(unsigned long)ptr); | |
96b5179d CM |
1548 | clear_extent_bits(&info->block_group_cache, start, |
1549 | end, (unsigned int)-1, GFP_NOFS); | |
9078a3e1 | 1550 | } |
e37c9e69 | 1551 | while(1) { |
f510cfec CM |
1552 | ret = find_first_extent_bit(&info->free_space_cache, 0, |
1553 | &start, &end, EXTENT_DIRTY); | |
1554 | if (ret) | |
e37c9e69 | 1555 | break; |
f510cfec CM |
1556 | clear_extent_dirty(&info->free_space_cache, start, |
1557 | end, GFP_NOFS); | |
e37c9e69 | 1558 | } |
be744175 CM |
1559 | return 0; |
1560 | } | |
1561 | ||
9078a3e1 CM |
1562 | int btrfs_read_block_groups(struct btrfs_root *root) |
1563 | { | |
1564 | struct btrfs_path *path; | |
1565 | int ret; | |
1566 | int err = 0; | |
96b5179d | 1567 | int bit; |
9078a3e1 | 1568 | struct btrfs_block_group_cache *cache; |
be744175 | 1569 | struct btrfs_fs_info *info = root->fs_info; |
96b5179d | 1570 | struct extent_map_tree *block_group_cache; |
9078a3e1 CM |
1571 | struct btrfs_key key; |
1572 | struct btrfs_key found_key; | |
5f39d397 | 1573 | struct extent_buffer *leaf; |
96b5179d CM |
1574 | |
1575 | block_group_cache = &info->block_group_cache; | |
9078a3e1 | 1576 | |
be744175 | 1577 | root = info->extent_root; |
9078a3e1 | 1578 | key.objectid = 0; |
db94535d | 1579 | key.offset = BTRFS_BLOCK_GROUP_SIZE; |
9078a3e1 CM |
1580 | btrfs_set_key_type(&key, BTRFS_BLOCK_GROUP_ITEM_KEY); |
1581 | ||
1582 | path = btrfs_alloc_path(); | |
1583 | if (!path) | |
1584 | return -ENOMEM; | |
1585 | ||
1586 | while(1) { | |
be744175 | 1587 | ret = btrfs_search_slot(NULL, info->extent_root, |
9078a3e1 CM |
1588 | &key, path, 0, 0); |
1589 | if (ret != 0) { | |
1590 | err = ret; | |
1591 | break; | |
1592 | } | |
5f39d397 CM |
1593 | leaf = path->nodes[0]; |
1594 | btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]); | |
9078a3e1 CM |
1595 | cache = kmalloc(sizeof(*cache), GFP_NOFS); |
1596 | if (!cache) { | |
1597 | err = -1; | |
1598 | break; | |
1599 | } | |
3e1ad54f | 1600 | |
5f39d397 CM |
1601 | read_extent_buffer(leaf, &cache->item, |
1602 | btrfs_item_ptr_offset(leaf, path->slots[0]), | |
1603 | sizeof(cache->item)); | |
9078a3e1 | 1604 | memcpy(&cache->key, &found_key, sizeof(found_key)); |
e37c9e69 | 1605 | cache->cached = 0; |
324ae4df | 1606 | cache->pinned = 0; |
9078a3e1 CM |
1607 | key.objectid = found_key.objectid + found_key.offset; |
1608 | btrfs_release_path(root, path); | |
5f39d397 | 1609 | |
f84a8b36 CM |
1610 | if (cache->item.flags & BTRFS_BLOCK_GROUP_MIXED) { |
1611 | bit = BLOCK_GROUP_DATA | BLOCK_GROUP_METADATA; | |
1612 | cache->data = BTRFS_BLOCK_GROUP_MIXED; | |
1613 | } else if (cache->item.flags & BTRFS_BLOCK_GROUP_DATA) { | |
96b5179d | 1614 | bit = BLOCK_GROUP_DATA; |
f84a8b36 | 1615 | cache->data = BTRFS_BLOCK_GROUP_DATA; |
96b5179d CM |
1616 | } else { |
1617 | bit = BLOCK_GROUP_METADATA; | |
1618 | cache->data = 0; | |
31f3c99b | 1619 | } |
96b5179d CM |
1620 | |
1621 | /* use EXTENT_LOCKED to prevent merging */ | |
1622 | set_extent_bits(block_group_cache, found_key.objectid, | |
1623 | found_key.objectid + found_key.offset - 1, | |
1624 | bit | EXTENT_LOCKED, GFP_NOFS); | |
1625 | set_state_private(block_group_cache, found_key.objectid, | |
ae2f5411 | 1626 | (unsigned long)cache); |
96b5179d | 1627 | |
9078a3e1 | 1628 | if (key.objectid >= |
db94535d | 1629 | btrfs_super_total_bytes(&info->super_copy)) |
9078a3e1 CM |
1630 | break; |
1631 | } | |
1632 | ||
1633 | btrfs_free_path(path); | |
1634 | return 0; | |
1635 | } |