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