Commit | Line | Data |
---|---|---|
2e635a27 | 1 | #include <linux/module.h> |
fec577fb CM |
2 | #include "ctree.h" |
3 | #include "disk-io.h" | |
4 | #include "print-tree.h" | |
e089f05c | 5 | #include "transaction.h" |
fec577fb | 6 | |
e089f05c CM |
7 | static int find_free_extent(struct btrfs_trans_handle *trans, struct btrfs_root |
8 | *orig_root, u64 num_blocks, u64 search_start, u64 | |
9 | search_end, struct btrfs_key *ins); | |
10 | static int finish_current_insert(struct btrfs_trans_handle *trans, struct | |
11 | btrfs_root *extent_root); | |
e20d96d6 CM |
12 | static int del_pending_extents(struct btrfs_trans_handle *trans, struct |
13 | btrfs_root *extent_root); | |
fec577fb | 14 | |
e089f05c | 15 | static int inc_block_ref(struct btrfs_trans_handle *trans, struct btrfs_root |
6407bf6d | 16 | *root, u64 blocknr, u64 num_blocks) |
02217ed2 | 17 | { |
5caf2a00 | 18 | struct btrfs_path *path; |
02217ed2 | 19 | int ret; |
e2fa7227 | 20 | struct btrfs_key key; |
234b63a0 CM |
21 | struct btrfs_leaf *l; |
22 | struct btrfs_extent_item *item; | |
e2fa7227 | 23 | struct btrfs_key ins; |
cf27e1ee | 24 | u32 refs; |
037e6390 | 25 | |
9f5fae2f CM |
26 | find_free_extent(trans, root->fs_info->extent_root, 0, 0, (u64)-1, |
27 | &ins); | |
5caf2a00 CM |
28 | path = btrfs_alloc_path(); |
29 | BUG_ON(!path); | |
30 | btrfs_init_path(path); | |
02217ed2 CM |
31 | key.objectid = blocknr; |
32 | key.flags = 0; | |
62e2749e | 33 | btrfs_set_key_type(&key, BTRFS_EXTENT_ITEM_KEY); |
6407bf6d | 34 | key.offset = num_blocks; |
5caf2a00 | 35 | ret = btrfs_search_slot(trans, root->fs_info->extent_root, &key, path, |
9f5fae2f | 36 | 0, 1); |
a28ec197 CM |
37 | if (ret != 0) |
38 | BUG(); | |
02217ed2 | 39 | BUG_ON(ret != 0); |
5caf2a00 CM |
40 | l = btrfs_buffer_leaf(path->nodes[0]); |
41 | item = btrfs_item_ptr(l, path->slots[0], struct btrfs_extent_item); | |
cf27e1ee CM |
42 | refs = btrfs_extent_refs(item); |
43 | btrfs_set_extent_refs(item, refs + 1); | |
5caf2a00 | 44 | btrfs_mark_buffer_dirty(path->nodes[0]); |
a28ec197 | 45 | |
5caf2a00 CM |
46 | btrfs_release_path(root->fs_info->extent_root, path); |
47 | btrfs_free_path(path); | |
9f5fae2f | 48 | finish_current_insert(trans, root->fs_info->extent_root); |
e20d96d6 | 49 | del_pending_extents(trans, root->fs_info->extent_root); |
02217ed2 CM |
50 | return 0; |
51 | } | |
52 | ||
e089f05c | 53 | static int lookup_block_ref(struct btrfs_trans_handle *trans, struct btrfs_root |
6407bf6d | 54 | *root, u64 blocknr, u64 num_blocks, u32 *refs) |
a28ec197 | 55 | { |
5caf2a00 | 56 | struct btrfs_path *path; |
a28ec197 | 57 | int ret; |
e2fa7227 | 58 | struct btrfs_key key; |
234b63a0 CM |
59 | struct btrfs_leaf *l; |
60 | struct btrfs_extent_item *item; | |
5caf2a00 CM |
61 | |
62 | path = btrfs_alloc_path(); | |
63 | btrfs_init_path(path); | |
a28ec197 | 64 | key.objectid = blocknr; |
6407bf6d | 65 | key.offset = num_blocks; |
62e2749e CM |
66 | key.flags = 0; |
67 | btrfs_set_key_type(&key, BTRFS_EXTENT_ITEM_KEY); | |
5caf2a00 | 68 | ret = btrfs_search_slot(trans, root->fs_info->extent_root, &key, path, |
9f5fae2f | 69 | 0, 0); |
a28ec197 CM |
70 | if (ret != 0) |
71 | BUG(); | |
5caf2a00 CM |
72 | l = btrfs_buffer_leaf(path->nodes[0]); |
73 | item = btrfs_item_ptr(l, path->slots[0], struct btrfs_extent_item); | |
cf27e1ee | 74 | *refs = btrfs_extent_refs(item); |
5caf2a00 CM |
75 | btrfs_release_path(root->fs_info->extent_root, path); |
76 | btrfs_free_path(path); | |
a28ec197 CM |
77 | return 0; |
78 | } | |
79 | ||
e089f05c | 80 | int btrfs_inc_ref(struct btrfs_trans_handle *trans, struct btrfs_root *root, |
e20d96d6 | 81 | struct buffer_head *buf) |
02217ed2 CM |
82 | { |
83 | u64 blocknr; | |
e20d96d6 | 84 | struct btrfs_node *buf_node; |
6407bf6d CM |
85 | struct btrfs_leaf *buf_leaf; |
86 | struct btrfs_disk_key *key; | |
87 | struct btrfs_file_extent_item *fi; | |
02217ed2 | 88 | int i; |
6407bf6d CM |
89 | int leaf; |
90 | int ret; | |
a28ec197 | 91 | |
3768f368 | 92 | if (!root->ref_cows) |
a28ec197 | 93 | return 0; |
e20d96d6 | 94 | buf_node = btrfs_buffer_node(buf); |
6407bf6d CM |
95 | leaf = btrfs_is_leaf(buf_node); |
96 | buf_leaf = btrfs_buffer_leaf(buf); | |
e20d96d6 | 97 | for (i = 0; i < btrfs_header_nritems(&buf_node->header); i++) { |
6407bf6d CM |
98 | if (leaf) { |
99 | key = &buf_leaf->items[i].key; | |
100 | if (btrfs_disk_key_type(key) != BTRFS_EXTENT_DATA_KEY) | |
101 | continue; | |
102 | fi = btrfs_item_ptr(buf_leaf, i, | |
103 | struct btrfs_file_extent_item); | |
104 | ret = inc_block_ref(trans, root, | |
105 | btrfs_file_extent_disk_blocknr(fi), | |
106 | btrfs_file_extent_disk_num_blocks(fi)); | |
107 | BUG_ON(ret); | |
108 | } else { | |
109 | blocknr = btrfs_node_blockptr(buf_node, i); | |
110 | ret = inc_block_ref(trans, root, blocknr, 1); | |
111 | BUG_ON(ret); | |
112 | } | |
02217ed2 CM |
113 | } |
114 | return 0; | |
115 | } | |
116 | ||
e089f05c CM |
117 | int btrfs_finish_extent_commit(struct btrfs_trans_handle *trans, struct |
118 | btrfs_root *root) | |
a28ec197 | 119 | { |
8ef97622 | 120 | unsigned long gang[8]; |
88fd146c | 121 | u64 first = 0; |
a28ec197 CM |
122 | int ret; |
123 | int i; | |
8ef97622 | 124 | struct radix_tree_root *pinned_radix = &root->fs_info->pinned_radix; |
a28ec197 CM |
125 | |
126 | while(1) { | |
8ef97622 CM |
127 | ret = find_first_radix_bit(pinned_radix, gang, |
128 | ARRAY_SIZE(gang)); | |
a28ec197 CM |
129 | if (!ret) |
130 | break; | |
88fd146c | 131 | if (!first) |
8ef97622 | 132 | first = gang[0]; |
0579da42 | 133 | for (i = 0; i < ret; i++) { |
8ef97622 | 134 | clear_radix_bit(pinned_radix, gang[i]); |
0579da42 | 135 | } |
a28ec197 | 136 | } |
d5719762 CM |
137 | if (root->fs_info->last_insert.objectid > first) |
138 | root->fs_info->last_insert.objectid = first; | |
9f5fae2f | 139 | root->fs_info->last_insert.offset = 0; |
a28ec197 CM |
140 | return 0; |
141 | } | |
142 | ||
e089f05c CM |
143 | static int finish_current_insert(struct btrfs_trans_handle *trans, struct |
144 | btrfs_root *extent_root) | |
037e6390 | 145 | { |
e2fa7227 | 146 | struct btrfs_key ins; |
234b63a0 | 147 | struct btrfs_extent_item extent_item; |
037e6390 CM |
148 | int i; |
149 | int ret; | |
1261ec42 CM |
150 | u64 super_blocks_used; |
151 | struct btrfs_fs_info *info = extent_root->fs_info; | |
037e6390 | 152 | |
cf27e1ee CM |
153 | btrfs_set_extent_refs(&extent_item, 1); |
154 | btrfs_set_extent_owner(&extent_item, | |
e20d96d6 | 155 | btrfs_header_parentid(btrfs_buffer_header(extent_root->node))); |
037e6390 CM |
156 | ins.offset = 1; |
157 | ins.flags = 0; | |
62e2749e | 158 | btrfs_set_key_type(&ins, BTRFS_EXTENT_ITEM_KEY); |
037e6390 | 159 | |
9f5fae2f CM |
160 | for (i = 0; i < extent_root->fs_info->current_insert.flags; i++) { |
161 | ins.objectid = extent_root->fs_info->current_insert.objectid + | |
162 | i; | |
1261ec42 CM |
163 | super_blocks_used = btrfs_super_blocks_used(info->disk_super); |
164 | btrfs_set_super_blocks_used(info->disk_super, | |
165 | super_blocks_used + 1); | |
e089f05c CM |
166 | ret = btrfs_insert_item(trans, extent_root, &ins, &extent_item, |
167 | sizeof(extent_item)); | |
037e6390 CM |
168 | BUG_ON(ret); |
169 | } | |
9f5fae2f | 170 | extent_root->fs_info->current_insert.offset = 0; |
037e6390 CM |
171 | return 0; |
172 | } | |
173 | ||
8ef97622 | 174 | static int pin_down_block(struct btrfs_root *root, u64 blocknr, int pending) |
e20d96d6 CM |
175 | { |
176 | int err; | |
78fae27e | 177 | struct btrfs_header *header; |
8ef97622 CM |
178 | struct buffer_head *bh; |
179 | ||
f4b9aa8d | 180 | if (!pending) { |
d98237b3 | 181 | bh = btrfs_find_tree_block(root, blocknr); |
2c90e5d6 CM |
182 | if (bh) { |
183 | if (buffer_uptodate(bh)) { | |
184 | u64 transid = | |
185 | root->fs_info->running_transaction->transid; | |
186 | header = btrfs_buffer_header(bh); | |
187 | if (btrfs_header_generation(header) == | |
188 | transid) { | |
189 | btrfs_block_release(root, bh); | |
190 | return 0; | |
191 | } | |
f4b9aa8d | 192 | } |
d6025579 | 193 | btrfs_block_release(root, bh); |
8ef97622 | 194 | } |
8ef97622 | 195 | err = set_radix_bit(&root->fs_info->pinned_radix, blocknr); |
f4b9aa8d CM |
196 | } else { |
197 | err = set_radix_bit(&root->fs_info->pending_del_radix, blocknr); | |
198 | } | |
8ef97622 | 199 | BUG_ON(err); |
e20d96d6 CM |
200 | return 0; |
201 | } | |
202 | ||
fec577fb | 203 | /* |
a28ec197 | 204 | * remove an extent from the root, returns 0 on success |
fec577fb | 205 | */ |
e089f05c | 206 | static int __free_extent(struct btrfs_trans_handle *trans, struct btrfs_root |
78fae27e | 207 | *root, u64 blocknr, u64 num_blocks, int pin) |
a28ec197 | 208 | { |
5caf2a00 | 209 | struct btrfs_path *path; |
e2fa7227 | 210 | struct btrfs_key key; |
1261ec42 CM |
211 | struct btrfs_fs_info *info = root->fs_info; |
212 | struct btrfs_root *extent_root = info->extent_root; | |
a28ec197 | 213 | int ret; |
234b63a0 | 214 | struct btrfs_extent_item *ei; |
e2fa7227 | 215 | struct btrfs_key ins; |
cf27e1ee | 216 | u32 refs; |
037e6390 | 217 | |
a28ec197 CM |
218 | key.objectid = blocknr; |
219 | key.flags = 0; | |
62e2749e | 220 | btrfs_set_key_type(&key, BTRFS_EXTENT_ITEM_KEY); |
a28ec197 CM |
221 | key.offset = num_blocks; |
222 | ||
e089f05c | 223 | find_free_extent(trans, root, 0, 0, (u64)-1, &ins); |
5caf2a00 CM |
224 | path = btrfs_alloc_path(); |
225 | BUG_ON(!path); | |
226 | btrfs_init_path(path); | |
227 | ret = btrfs_search_slot(trans, extent_root, &key, path, -1, 1); | |
a28ec197 | 228 | if (ret) { |
2e635a27 | 229 | printk("failed to find %Lu\n", key.objectid); |
234b63a0 | 230 | btrfs_print_tree(extent_root, extent_root->node); |
2e635a27 | 231 | printk("failed to find %Lu\n", key.objectid); |
a28ec197 CM |
232 | BUG(); |
233 | } | |
5caf2a00 | 234 | ei = btrfs_item_ptr(btrfs_buffer_leaf(path->nodes[0]), path->slots[0], |
123abc88 | 235 | struct btrfs_extent_item); |
a28ec197 | 236 | BUG_ON(ei->refs == 0); |
cf27e1ee CM |
237 | refs = btrfs_extent_refs(ei) - 1; |
238 | btrfs_set_extent_refs(ei, refs); | |
5caf2a00 | 239 | btrfs_mark_buffer_dirty(path->nodes[0]); |
cf27e1ee | 240 | if (refs == 0) { |
1261ec42 | 241 | u64 super_blocks_used; |
78fae27e CM |
242 | |
243 | if (pin) { | |
8ef97622 | 244 | ret = pin_down_block(root, blocknr, 0); |
78fae27e CM |
245 | BUG_ON(ret); |
246 | } | |
247 | ||
1261ec42 CM |
248 | super_blocks_used = btrfs_super_blocks_used(info->disk_super); |
249 | btrfs_set_super_blocks_used(info->disk_super, | |
250 | super_blocks_used - num_blocks); | |
5caf2a00 | 251 | ret = btrfs_del_item(trans, extent_root, path); |
a28ec197 CM |
252 | if (ret) |
253 | BUG(); | |
254 | } | |
5caf2a00 CM |
255 | btrfs_release_path(extent_root, path); |
256 | btrfs_free_path(path); | |
e089f05c | 257 | finish_current_insert(trans, extent_root); |
a28ec197 CM |
258 | return ret; |
259 | } | |
260 | ||
a28ec197 CM |
261 | /* |
262 | * find all the blocks marked as pending in the radix tree and remove | |
263 | * them from the extent map | |
264 | */ | |
e089f05c CM |
265 | static int del_pending_extents(struct btrfs_trans_handle *trans, struct |
266 | btrfs_root *extent_root) | |
a28ec197 CM |
267 | { |
268 | int ret; | |
e20d96d6 CM |
269 | int wret; |
270 | int err = 0; | |
8ef97622 | 271 | unsigned long gang[4]; |
a28ec197 | 272 | int i; |
8ef97622 CM |
273 | struct radix_tree_root *pending_radix; |
274 | struct radix_tree_root *pinned_radix; | |
275 | ||
276 | pending_radix = &extent_root->fs_info->pending_del_radix; | |
277 | pinned_radix = &extent_root->fs_info->pinned_radix; | |
a28ec197 CM |
278 | |
279 | while(1) { | |
8ef97622 CM |
280 | ret = find_first_radix_bit(pending_radix, gang, |
281 | ARRAY_SIZE(gang)); | |
a28ec197 CM |
282 | if (!ret) |
283 | break; | |
284 | for (i = 0; i < ret; i++) { | |
8ef97622 CM |
285 | wret = set_radix_bit(pinned_radix, gang[i]); |
286 | BUG_ON(wret); | |
287 | wret = clear_radix_bit(pending_radix, gang[i]); | |
288 | BUG_ON(wret); | |
d5719762 | 289 | wret = __free_extent(trans, extent_root, |
8ef97622 | 290 | gang[i], 1, 0); |
e20d96d6 CM |
291 | if (wret) |
292 | err = wret; | |
fec577fb CM |
293 | } |
294 | } | |
e20d96d6 | 295 | return err; |
fec577fb CM |
296 | } |
297 | ||
298 | /* | |
299 | * remove an extent from the root, returns 0 on success | |
300 | */ | |
e089f05c CM |
301 | int btrfs_free_extent(struct btrfs_trans_handle *trans, struct btrfs_root |
302 | *root, u64 blocknr, u64 num_blocks, int pin) | |
fec577fb | 303 | { |
9f5fae2f | 304 | struct btrfs_root *extent_root = root->fs_info->extent_root; |
fec577fb CM |
305 | int pending_ret; |
306 | int ret; | |
a28ec197 | 307 | |
fec577fb | 308 | if (root == extent_root) { |
8ef97622 | 309 | pin_down_block(root, blocknr, 1); |
fec577fb CM |
310 | return 0; |
311 | } | |
78fae27e | 312 | ret = __free_extent(trans, root, blocknr, num_blocks, pin); |
e20d96d6 | 313 | pending_ret = del_pending_extents(trans, root->fs_info->extent_root); |
fec577fb CM |
314 | return ret ? ret : pending_ret; |
315 | } | |
316 | ||
317 | /* | |
318 | * walks the btree of allocated extents and find a hole of a given size. | |
319 | * The key ins is changed to record the hole: | |
320 | * ins->objectid == block start | |
62e2749e | 321 | * ins->flags = BTRFS_EXTENT_ITEM_KEY |
fec577fb CM |
322 | * ins->offset == number of blocks |
323 | * Any available blocks before search_start are skipped. | |
324 | */ | |
e089f05c CM |
325 | static int find_free_extent(struct btrfs_trans_handle *trans, struct btrfs_root |
326 | *orig_root, u64 num_blocks, u64 search_start, u64 | |
327 | search_end, struct btrfs_key *ins) | |
fec577fb | 328 | { |
5caf2a00 | 329 | struct btrfs_path *path; |
e2fa7227 | 330 | struct btrfs_key key; |
fec577fb CM |
331 | int ret; |
332 | u64 hole_size = 0; | |
333 | int slot = 0; | |
e20d96d6 | 334 | u64 last_block = 0; |
037e6390 | 335 | u64 test_block; |
fec577fb | 336 | int start_found; |
234b63a0 | 337 | struct btrfs_leaf *l; |
9f5fae2f | 338 | struct btrfs_root * root = orig_root->fs_info->extent_root; |
0579da42 | 339 | int total_needed = num_blocks; |
e20d96d6 | 340 | int level; |
fec577fb | 341 | |
b1a4d965 CM |
342 | path = btrfs_alloc_path(); |
343 | ins->flags = 0; | |
344 | btrfs_set_key_type(ins, BTRFS_EXTENT_ITEM_KEY); | |
345 | ||
e20d96d6 CM |
346 | level = btrfs_header_level(btrfs_buffer_header(root->node)); |
347 | total_needed += (level + 1) * 3; | |
b1a4d965 CM |
348 | if (root->fs_info->last_insert.objectid == 0 && search_end == (u64)-1) { |
349 | struct btrfs_disk_key *last_key; | |
350 | btrfs_init_path(path); | |
351 | ins->objectid = (u64)-1; | |
352 | ins->offset = (u64)-1; | |
353 | ret = btrfs_search_slot(trans, root, ins, path, 0, 0); | |
354 | if (ret < 0) | |
355 | goto error; | |
356 | BUG_ON(ret == 0); | |
357 | if (path->slots[0] > 0) | |
358 | path->slots[0]--; | |
359 | l = btrfs_buffer_leaf(path->nodes[0]); | |
360 | last_key = &l->items[path->slots[0]].key; | |
361 | search_start = btrfs_disk_key_objectid(last_key); | |
362 | } | |
9f5fae2f CM |
363 | if (root->fs_info->last_insert.objectid > search_start) |
364 | search_start = root->fs_info->last_insert.objectid; | |
62e2749e | 365 | |
5caf2a00 | 366 | path = btrfs_alloc_path(); |
62e2749e | 367 | |
fec577fb | 368 | check_failed: |
5caf2a00 | 369 | btrfs_init_path(path); |
fec577fb CM |
370 | ins->objectid = search_start; |
371 | ins->offset = 0; | |
fec577fb | 372 | start_found = 0; |
5caf2a00 | 373 | ret = btrfs_search_slot(trans, root, ins, path, 0, 0); |
0f70abe2 CM |
374 | if (ret < 0) |
375 | goto error; | |
aa5d6bed | 376 | |
5caf2a00 CM |
377 | if (path->slots[0] > 0) |
378 | path->slots[0]--; | |
0579da42 | 379 | |
fec577fb | 380 | while (1) { |
5caf2a00 CM |
381 | l = btrfs_buffer_leaf(path->nodes[0]); |
382 | slot = path->slots[0]; | |
7518a238 | 383 | if (slot >= btrfs_header_nritems(&l->header)) { |
5caf2a00 | 384 | ret = btrfs_next_leaf(root, path); |
fec577fb CM |
385 | if (ret == 0) |
386 | continue; | |
0f70abe2 CM |
387 | if (ret < 0) |
388 | goto error; | |
fec577fb CM |
389 | if (!start_found) { |
390 | ins->objectid = search_start; | |
037e6390 | 391 | ins->offset = (u64)-1; |
fec577fb CM |
392 | start_found = 1; |
393 | goto check_pending; | |
394 | } | |
395 | ins->objectid = last_block > search_start ? | |
396 | last_block : search_start; | |
037e6390 | 397 | ins->offset = (u64)-1; |
fec577fb CM |
398 | goto check_pending; |
399 | } | |
e2fa7227 CM |
400 | btrfs_disk_key_to_cpu(&key, &l->items[slot].key); |
401 | if (key.objectid >= search_start) { | |
fec577fb | 402 | if (start_found) { |
0579da42 CM |
403 | if (last_block < search_start) |
404 | last_block = search_start; | |
e2fa7227 | 405 | hole_size = key.objectid - last_block; |
037e6390 | 406 | if (hole_size > total_needed) { |
fec577fb | 407 | ins->objectid = last_block; |
037e6390 | 408 | ins->offset = hole_size; |
fec577fb CM |
409 | goto check_pending; |
410 | } | |
0579da42 | 411 | } |
fec577fb | 412 | } |
0579da42 | 413 | start_found = 1; |
e2fa7227 | 414 | last_block = key.objectid + key.offset; |
5caf2a00 | 415 | path->slots[0]++; |
fec577fb CM |
416 | } |
417 | // FIXME -ENOSPC | |
418 | check_pending: | |
419 | /* we have to make sure we didn't find an extent that has already | |
420 | * been allocated by the map tree or the original allocation | |
421 | */ | |
5caf2a00 | 422 | btrfs_release_path(root, path); |
fec577fb | 423 | BUG_ON(ins->objectid < search_start); |
037e6390 CM |
424 | for (test_block = ins->objectid; |
425 | test_block < ins->objectid + total_needed; test_block++) { | |
8ef97622 | 426 | if (test_radix_bit(&root->fs_info->pinned_radix, |
9f5fae2f | 427 | test_block)) { |
037e6390 | 428 | search_start = test_block + 1; |
fec577fb CM |
429 | goto check_failed; |
430 | } | |
431 | } | |
9f5fae2f CM |
432 | BUG_ON(root->fs_info->current_insert.offset); |
433 | root->fs_info->current_insert.offset = total_needed - num_blocks; | |
434 | root->fs_info->current_insert.objectid = ins->objectid + num_blocks; | |
435 | root->fs_info->current_insert.flags = 0; | |
436 | root->fs_info->last_insert.objectid = ins->objectid; | |
037e6390 | 437 | ins->offset = num_blocks; |
5caf2a00 | 438 | btrfs_free_path(path); |
fec577fb | 439 | return 0; |
0f70abe2 | 440 | error: |
5caf2a00 CM |
441 | btrfs_release_path(root, path); |
442 | btrfs_free_path(path); | |
0f70abe2 | 443 | return ret; |
fec577fb CM |
444 | } |
445 | ||
fec577fb CM |
446 | /* |
447 | * finds a free extent and does all the dirty work required for allocation | |
448 | * returns the key for the extent through ins, and a tree buffer for | |
449 | * the first block of the extent through buf. | |
450 | * | |
451 | * returns 0 if everything worked, non-zero otherwise. | |
452 | */ | |
dee26a9f | 453 | int btrfs_alloc_extent(struct btrfs_trans_handle *trans, struct btrfs_root |
e089f05c CM |
454 | *root, u64 num_blocks, u64 search_start, u64 |
455 | search_end, u64 owner, struct btrfs_key *ins) | |
fec577fb CM |
456 | { |
457 | int ret; | |
458 | int pending_ret; | |
1261ec42 CM |
459 | u64 super_blocks_used; |
460 | struct btrfs_fs_info *info = root->fs_info; | |
461 | struct btrfs_root *extent_root = info->extent_root; | |
234b63a0 | 462 | struct btrfs_extent_item extent_item; |
037e6390 | 463 | |
cf27e1ee CM |
464 | btrfs_set_extent_refs(&extent_item, 1); |
465 | btrfs_set_extent_owner(&extent_item, owner); | |
fec577fb | 466 | |
037e6390 | 467 | if (root == extent_root) { |
9f5fae2f | 468 | BUG_ON(extent_root->fs_info->current_insert.offset == 0); |
037e6390 | 469 | BUG_ON(num_blocks != 1); |
9f5fae2f CM |
470 | BUG_ON(extent_root->fs_info->current_insert.flags == |
471 | extent_root->fs_info->current_insert.offset); | |
037e6390 | 472 | ins->offset = 1; |
9f5fae2f CM |
473 | ins->objectid = extent_root->fs_info->current_insert.objectid + |
474 | extent_root->fs_info->current_insert.flags++; | |
fec577fb CM |
475 | return 0; |
476 | } | |
e089f05c | 477 | ret = find_free_extent(trans, root, num_blocks, search_start, |
037e6390 CM |
478 | search_end, ins); |
479 | if (ret) | |
480 | return ret; | |
fec577fb | 481 | |
1261ec42 CM |
482 | super_blocks_used = btrfs_super_blocks_used(info->disk_super); |
483 | btrfs_set_super_blocks_used(info->disk_super, super_blocks_used + | |
484 | num_blocks); | |
e089f05c CM |
485 | ret = btrfs_insert_item(trans, extent_root, ins, &extent_item, |
486 | sizeof(extent_item)); | |
037e6390 | 487 | |
e089f05c | 488 | finish_current_insert(trans, extent_root); |
e20d96d6 | 489 | pending_ret = del_pending_extents(trans, extent_root); |
037e6390 CM |
490 | if (ret) |
491 | return ret; | |
492 | if (pending_ret) | |
493 | return pending_ret; | |
494 | return 0; | |
fec577fb CM |
495 | } |
496 | ||
497 | /* | |
498 | * helper function to allocate a block for a given tree | |
499 | * returns the tree buffer or NULL. | |
500 | */ | |
e20d96d6 | 501 | struct buffer_head *btrfs_alloc_free_block(struct btrfs_trans_handle *trans, |
e089f05c | 502 | struct btrfs_root *root) |
fec577fb | 503 | { |
e2fa7227 | 504 | struct btrfs_key ins; |
fec577fb | 505 | int ret; |
e20d96d6 | 506 | struct buffer_head *buf; |
fec577fb | 507 | |
dee26a9f | 508 | ret = btrfs_alloc_extent(trans, root, 1, 0, (unsigned long)-1, |
e20d96d6 | 509 | btrfs_header_parentid(btrfs_buffer_header(root->node)), &ins); |
fec577fb CM |
510 | if (ret) { |
511 | BUG(); | |
512 | return NULL; | |
513 | } | |
d98237b3 | 514 | buf = btrfs_find_create_tree_block(root, ins.objectid); |
df2ce34c | 515 | set_buffer_uptodate(buf); |
fec577fb CM |
516 | return buf; |
517 | } | |
a28ec197 | 518 | |
6407bf6d CM |
519 | static int drop_leaf_ref(struct btrfs_trans_handle *trans, |
520 | struct btrfs_root *root, struct buffer_head *cur) | |
521 | { | |
522 | struct btrfs_disk_key *key; | |
523 | struct btrfs_leaf *leaf; | |
524 | struct btrfs_file_extent_item *fi; | |
525 | int i; | |
526 | int nritems; | |
527 | int ret; | |
528 | ||
529 | BUG_ON(!btrfs_is_leaf(btrfs_buffer_node(cur))); | |
530 | leaf = btrfs_buffer_leaf(cur); | |
531 | nritems = btrfs_header_nritems(&leaf->header); | |
532 | for (i = 0; i < nritems; i++) { | |
533 | key = &leaf->items[i].key; | |
534 | if (btrfs_disk_key_type(key) != BTRFS_EXTENT_DATA_KEY) | |
535 | continue; | |
536 | fi = btrfs_item_ptr(leaf, i, struct btrfs_file_extent_item); | |
537 | /* | |
538 | * FIXME make sure to insert a trans record that | |
539 | * repeats the snapshot del on crash | |
540 | */ | |
541 | ret = btrfs_free_extent(trans, root, | |
542 | btrfs_file_extent_disk_blocknr(fi), | |
543 | btrfs_file_extent_disk_num_blocks(fi), | |
544 | 0); | |
545 | BUG_ON(ret); | |
546 | } | |
547 | return 0; | |
548 | } | |
549 | ||
9aca1d51 CM |
550 | /* |
551 | * helper function for drop_snapshot, this walks down the tree dropping ref | |
552 | * counts as it goes. | |
553 | */ | |
e089f05c CM |
554 | static int walk_down_tree(struct btrfs_trans_handle *trans, struct btrfs_root |
555 | *root, struct btrfs_path *path, int *level) | |
20524f02 | 556 | { |
e20d96d6 CM |
557 | struct buffer_head *next; |
558 | struct buffer_head *cur; | |
20524f02 CM |
559 | u64 blocknr; |
560 | int ret; | |
561 | u32 refs; | |
562 | ||
5caf2a00 CM |
563 | WARN_ON(*level < 0); |
564 | WARN_ON(*level >= BTRFS_MAX_LEVEL); | |
e20d96d6 | 565 | ret = lookup_block_ref(trans, root, path->nodes[*level]->b_blocknr, |
6407bf6d | 566 | 1, &refs); |
20524f02 CM |
567 | BUG_ON(ret); |
568 | if (refs > 1) | |
569 | goto out; | |
9aca1d51 CM |
570 | /* |
571 | * walk down to the last node level and free all the leaves | |
572 | */ | |
6407bf6d | 573 | while(*level >= 0) { |
5caf2a00 CM |
574 | WARN_ON(*level < 0); |
575 | WARN_ON(*level >= BTRFS_MAX_LEVEL); | |
20524f02 | 576 | cur = path->nodes[*level]; |
2c90e5d6 CM |
577 | if (btrfs_header_level(btrfs_buffer_header(cur)) != *level) |
578 | WARN_ON(1); | |
7518a238 | 579 | if (path->slots[*level] >= |
e20d96d6 | 580 | btrfs_header_nritems(btrfs_buffer_header(cur))) |
20524f02 | 581 | break; |
6407bf6d CM |
582 | if (*level == 0) { |
583 | ret = drop_leaf_ref(trans, root, cur); | |
584 | BUG_ON(ret); | |
585 | break; | |
586 | } | |
e20d96d6 CM |
587 | blocknr = btrfs_node_blockptr(btrfs_buffer_node(cur), |
588 | path->slots[*level]); | |
6407bf6d CM |
589 | ret = lookup_block_ref(trans, root, blocknr, 1, &refs); |
590 | BUG_ON(ret); | |
591 | if (refs != 1) { | |
20524f02 | 592 | path->slots[*level]++; |
e089f05c | 593 | ret = btrfs_free_extent(trans, root, blocknr, 1, 1); |
20524f02 CM |
594 | BUG_ON(ret); |
595 | continue; | |
596 | } | |
20524f02 | 597 | next = read_tree_block(root, blocknr); |
5caf2a00 | 598 | WARN_ON(*level <= 0); |
83e15a28 | 599 | if (path->nodes[*level-1]) |
234b63a0 | 600 | btrfs_block_release(root, path->nodes[*level-1]); |
20524f02 | 601 | path->nodes[*level-1] = next; |
e20d96d6 | 602 | *level = btrfs_header_level(btrfs_buffer_header(next)); |
20524f02 CM |
603 | path->slots[*level] = 0; |
604 | } | |
605 | out: | |
5caf2a00 CM |
606 | WARN_ON(*level < 0); |
607 | WARN_ON(*level >= BTRFS_MAX_LEVEL); | |
6407bf6d CM |
608 | ret = btrfs_free_extent(trans, root, |
609 | path->nodes[*level]->b_blocknr, 1, 1); | |
234b63a0 | 610 | btrfs_block_release(root, path->nodes[*level]); |
20524f02 CM |
611 | path->nodes[*level] = NULL; |
612 | *level += 1; | |
613 | BUG_ON(ret); | |
614 | return 0; | |
615 | } | |
616 | ||
9aca1d51 CM |
617 | /* |
618 | * helper for dropping snapshots. This walks back up the tree in the path | |
619 | * to find the first node higher up where we haven't yet gone through | |
620 | * all the slots | |
621 | */ | |
e089f05c CM |
622 | static int walk_up_tree(struct btrfs_trans_handle *trans, struct btrfs_root |
623 | *root, struct btrfs_path *path, int *level) | |
20524f02 CM |
624 | { |
625 | int i; | |
626 | int slot; | |
627 | int ret; | |
234b63a0 | 628 | for(i = *level; i < BTRFS_MAX_LEVEL - 1 && path->nodes[i]; i++) { |
20524f02 | 629 | slot = path->slots[i]; |
e20d96d6 CM |
630 | if (slot < btrfs_header_nritems( |
631 | btrfs_buffer_header(path->nodes[i])) - 1) { | |
20524f02 CM |
632 | path->slots[i]++; |
633 | *level = i; | |
634 | return 0; | |
635 | } else { | |
e089f05c | 636 | ret = btrfs_free_extent(trans, root, |
e20d96d6 | 637 | path->nodes[*level]->b_blocknr, |
e089f05c | 638 | 1, 1); |
6407bf6d | 639 | BUG_ON(ret); |
234b63a0 | 640 | btrfs_block_release(root, path->nodes[*level]); |
83e15a28 | 641 | path->nodes[*level] = NULL; |
20524f02 | 642 | *level = i + 1; |
20524f02 CM |
643 | } |
644 | } | |
645 | return 1; | |
646 | } | |
647 | ||
9aca1d51 CM |
648 | /* |
649 | * drop the reference count on the tree rooted at 'snap'. This traverses | |
650 | * the tree freeing any blocks that have a ref count of zero after being | |
651 | * decremented. | |
652 | */ | |
e089f05c | 653 | int btrfs_drop_snapshot(struct btrfs_trans_handle *trans, struct btrfs_root |
e20d96d6 | 654 | *root, struct buffer_head *snap) |
20524f02 | 655 | { |
3768f368 | 656 | int ret = 0; |
9aca1d51 | 657 | int wret; |
20524f02 | 658 | int level; |
5caf2a00 | 659 | struct btrfs_path *path; |
20524f02 CM |
660 | int i; |
661 | int orig_level; | |
662 | ||
5caf2a00 CM |
663 | path = btrfs_alloc_path(); |
664 | BUG_ON(!path); | |
665 | btrfs_init_path(path); | |
20524f02 | 666 | |
e20d96d6 | 667 | level = btrfs_header_level(btrfs_buffer_header(snap)); |
20524f02 | 668 | orig_level = level; |
5caf2a00 CM |
669 | path->nodes[level] = snap; |
670 | path->slots[level] = 0; | |
20524f02 | 671 | while(1) { |
5caf2a00 | 672 | wret = walk_down_tree(trans, root, path, &level); |
9aca1d51 | 673 | if (wret > 0) |
20524f02 | 674 | break; |
9aca1d51 CM |
675 | if (wret < 0) |
676 | ret = wret; | |
677 | ||
5caf2a00 | 678 | wret = walk_up_tree(trans, root, path, &level); |
9aca1d51 | 679 | if (wret > 0) |
20524f02 | 680 | break; |
9aca1d51 CM |
681 | if (wret < 0) |
682 | ret = wret; | |
20524f02 | 683 | } |
83e15a28 | 684 | for (i = 0; i <= orig_level; i++) { |
5caf2a00 CM |
685 | if (path->nodes[i]) { |
686 | btrfs_block_release(root, path->nodes[i]); | |
83e15a28 | 687 | } |
20524f02 | 688 | } |
5caf2a00 | 689 | btrfs_free_path(path); |
9aca1d51 | 690 | return ret; |
20524f02 | 691 | } |