]>
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 | ||
9078a3e1 CM |
130 | static int write_one_cache_group(struct btrfs_trans_handle *trans, |
131 | struct btrfs_root *root, | |
132 | struct btrfs_path *path, | |
133 | struct btrfs_block_group_cache *cache) | |
134 | { | |
135 | int ret; | |
136 | int pending_ret; | |
137 | struct btrfs_root *extent_root = root->fs_info->extent_root; | |
138 | struct btrfs_block_group_item *bi; | |
139 | struct btrfs_key ins; | |
140 | ||
141 | find_free_extent(trans, extent_root, 0, 0, (u64)-1, &ins); | |
142 | ret = btrfs_search_slot(trans, extent_root, &cache->key, path, 0, 1); | |
143 | BUG_ON(ret); | |
144 | bi = btrfs_item_ptr(btrfs_buffer_leaf(path->nodes[0]), path->slots[0], | |
145 | struct btrfs_block_group_item); | |
146 | memcpy(bi, &cache->item, sizeof(*bi)); | |
147 | mark_buffer_dirty(path->nodes[0]); | |
148 | btrfs_release_path(extent_root, path); | |
149 | ||
150 | finish_current_insert(trans, extent_root); | |
151 | pending_ret = del_pending_extents(trans, extent_root); | |
152 | if (ret) | |
153 | return ret; | |
154 | if (pending_ret) | |
155 | return pending_ret; | |
156 | return 0; | |
157 | ||
158 | } | |
159 | ||
160 | int btrfs_write_dirty_block_groups(struct btrfs_trans_handle *trans, | |
161 | struct btrfs_root *root) | |
162 | { | |
163 | struct btrfs_block_group_cache *cache[8]; | |
164 | int ret; | |
165 | int err = 0; | |
166 | int werr = 0; | |
167 | struct radix_tree_root *radix = &root->fs_info->block_group_radix; | |
168 | int i; | |
169 | struct btrfs_path *path; | |
170 | ||
171 | path = btrfs_alloc_path(); | |
172 | if (!path) | |
173 | return -ENOMEM; | |
174 | ||
175 | while(1) { | |
176 | ret = radix_tree_gang_lookup_tag(radix, (void **)cache, | |
177 | 0, ARRAY_SIZE(cache), | |
178 | BTRFS_BLOCK_GROUP_DIRTY); | |
179 | if (!ret) | |
180 | break; | |
181 | for (i = 0; i < ret; i++) { | |
182 | radix_tree_tag_clear(radix, cache[i]->key.objectid + | |
183 | cache[i]->key.offset - 1, | |
184 | BTRFS_BLOCK_GROUP_DIRTY); | |
185 | err = write_one_cache_group(trans, root, | |
186 | path, cache[i]); | |
187 | if (err) | |
188 | werr = err; | |
189 | } | |
190 | } | |
191 | btrfs_free_path(path); | |
192 | return werr; | |
193 | } | |
194 | ||
195 | static int update_block_group(struct btrfs_trans_handle *trans, | |
196 | struct btrfs_root *root, | |
197 | u64 blocknr, u64 num, int alloc) | |
198 | { | |
199 | struct btrfs_block_group_cache *cache; | |
200 | struct btrfs_fs_info *info = root->fs_info; | |
201 | u64 total = num; | |
202 | u64 old_val; | |
203 | u64 block_in_group; | |
204 | int ret; | |
205 | while(total) { | |
206 | ret = radix_tree_gang_lookup(&info->block_group_radix, | |
207 | (void **)&cache, blocknr, 1); | |
208 | if (!ret) | |
209 | return -1; | |
210 | block_in_group = blocknr - cache->key.objectid; | |
211 | WARN_ON(block_in_group > cache->key.offset); | |
212 | radix_tree_tag_set(&info->block_group_radix, | |
213 | cache->key.objectid + cache->key.offset - 1, | |
214 | BTRFS_BLOCK_GROUP_DIRTY); | |
215 | ||
216 | old_val = btrfs_block_group_used(&cache->item); | |
217 | num = min(total, cache->key.offset - block_in_group); | |
218 | total -= num; | |
219 | blocknr += num; | |
220 | if (alloc) | |
221 | old_val += num; | |
222 | else | |
223 | old_val -= num; | |
224 | btrfs_set_block_group_used(&cache->item, old_val); | |
225 | } | |
226 | return 0; | |
227 | } | |
228 | ||
e089f05c CM |
229 | int btrfs_finish_extent_commit(struct btrfs_trans_handle *trans, struct |
230 | btrfs_root *root) | |
a28ec197 | 231 | { |
8ef97622 | 232 | unsigned long gang[8]; |
88fd146c | 233 | u64 first = 0; |
a28ec197 CM |
234 | int ret; |
235 | int i; | |
8ef97622 | 236 | struct radix_tree_root *pinned_radix = &root->fs_info->pinned_radix; |
a28ec197 CM |
237 | |
238 | while(1) { | |
8ef97622 CM |
239 | ret = find_first_radix_bit(pinned_radix, gang, |
240 | ARRAY_SIZE(gang)); | |
a28ec197 CM |
241 | if (!ret) |
242 | break; | |
88fd146c | 243 | if (!first) |
8ef97622 | 244 | first = gang[0]; |
0579da42 | 245 | for (i = 0; i < ret; i++) { |
8ef97622 | 246 | clear_radix_bit(pinned_radix, gang[i]); |
0579da42 | 247 | } |
a28ec197 | 248 | } |
d5719762 CM |
249 | if (root->fs_info->last_insert.objectid > first) |
250 | root->fs_info->last_insert.objectid = first; | |
9f5fae2f | 251 | root->fs_info->last_insert.offset = 0; |
a28ec197 CM |
252 | return 0; |
253 | } | |
254 | ||
e089f05c CM |
255 | static int finish_current_insert(struct btrfs_trans_handle *trans, struct |
256 | btrfs_root *extent_root) | |
037e6390 | 257 | { |
e2fa7227 | 258 | struct btrfs_key ins; |
234b63a0 | 259 | struct btrfs_extent_item extent_item; |
037e6390 CM |
260 | int i; |
261 | int ret; | |
1261ec42 CM |
262 | u64 super_blocks_used; |
263 | struct btrfs_fs_info *info = extent_root->fs_info; | |
037e6390 | 264 | |
cf27e1ee | 265 | btrfs_set_extent_refs(&extent_item, 1); |
037e6390 CM |
266 | ins.offset = 1; |
267 | ins.flags = 0; | |
62e2749e | 268 | btrfs_set_key_type(&ins, BTRFS_EXTENT_ITEM_KEY); |
5d0c3e60 | 269 | btrfs_set_extent_owner(&extent_item, extent_root->root_key.objectid); |
037e6390 | 270 | |
f2458e1d CM |
271 | for (i = 0; i < extent_root->fs_info->extent_tree_insert_nr; i++) { |
272 | ins.objectid = extent_root->fs_info->extent_tree_insert[i]; | |
1261ec42 CM |
273 | super_blocks_used = btrfs_super_blocks_used(info->disk_super); |
274 | btrfs_set_super_blocks_used(info->disk_super, | |
275 | super_blocks_used + 1); | |
e089f05c CM |
276 | ret = btrfs_insert_item(trans, extent_root, &ins, &extent_item, |
277 | sizeof(extent_item)); | |
037e6390 CM |
278 | BUG_ON(ret); |
279 | } | |
f2458e1d CM |
280 | extent_root->fs_info->extent_tree_insert_nr = 0; |
281 | extent_root->fs_info->extent_tree_prealloc_nr = 0; | |
037e6390 CM |
282 | return 0; |
283 | } | |
284 | ||
8ef97622 | 285 | static int pin_down_block(struct btrfs_root *root, u64 blocknr, int pending) |
e20d96d6 CM |
286 | { |
287 | int err; | |
78fae27e | 288 | struct btrfs_header *header; |
8ef97622 CM |
289 | struct buffer_head *bh; |
290 | ||
f4b9aa8d | 291 | if (!pending) { |
d98237b3 | 292 | bh = btrfs_find_tree_block(root, blocknr); |
2c90e5d6 CM |
293 | if (bh) { |
294 | if (buffer_uptodate(bh)) { | |
295 | u64 transid = | |
296 | root->fs_info->running_transaction->transid; | |
297 | header = btrfs_buffer_header(bh); | |
298 | if (btrfs_header_generation(header) == | |
299 | transid) { | |
300 | btrfs_block_release(root, bh); | |
301 | return 0; | |
302 | } | |
f4b9aa8d | 303 | } |
d6025579 | 304 | btrfs_block_release(root, bh); |
8ef97622 | 305 | } |
8ef97622 | 306 | err = set_radix_bit(&root->fs_info->pinned_radix, blocknr); |
f4b9aa8d CM |
307 | } else { |
308 | err = set_radix_bit(&root->fs_info->pending_del_radix, blocknr); | |
309 | } | |
8ef97622 | 310 | BUG_ON(err); |
e20d96d6 CM |
311 | return 0; |
312 | } | |
313 | ||
fec577fb | 314 | /* |
a28ec197 | 315 | * remove an extent from the root, returns 0 on success |
fec577fb | 316 | */ |
e089f05c | 317 | static int __free_extent(struct btrfs_trans_handle *trans, struct btrfs_root |
78fae27e | 318 | *root, u64 blocknr, u64 num_blocks, int pin) |
a28ec197 | 319 | { |
5caf2a00 | 320 | struct btrfs_path *path; |
e2fa7227 | 321 | struct btrfs_key key; |
1261ec42 CM |
322 | struct btrfs_fs_info *info = root->fs_info; |
323 | struct btrfs_root *extent_root = info->extent_root; | |
a28ec197 | 324 | int ret; |
234b63a0 | 325 | struct btrfs_extent_item *ei; |
e2fa7227 | 326 | struct btrfs_key ins; |
cf27e1ee | 327 | u32 refs; |
037e6390 | 328 | |
a28ec197 CM |
329 | key.objectid = blocknr; |
330 | key.flags = 0; | |
62e2749e | 331 | btrfs_set_key_type(&key, BTRFS_EXTENT_ITEM_KEY); |
a28ec197 CM |
332 | key.offset = num_blocks; |
333 | ||
e089f05c | 334 | find_free_extent(trans, root, 0, 0, (u64)-1, &ins); |
5caf2a00 CM |
335 | path = btrfs_alloc_path(); |
336 | BUG_ON(!path); | |
337 | btrfs_init_path(path); | |
5f26f772 | 338 | |
5caf2a00 | 339 | ret = btrfs_search_slot(trans, extent_root, &key, path, -1, 1); |
a28ec197 | 340 | if (ret) { |
2e635a27 | 341 | printk("failed to find %Lu\n", key.objectid); |
234b63a0 | 342 | btrfs_print_tree(extent_root, extent_root->node); |
2e635a27 | 343 | printk("failed to find %Lu\n", key.objectid); |
a28ec197 CM |
344 | BUG(); |
345 | } | |
5caf2a00 | 346 | ei = btrfs_item_ptr(btrfs_buffer_leaf(path->nodes[0]), path->slots[0], |
123abc88 | 347 | struct btrfs_extent_item); |
a28ec197 | 348 | BUG_ON(ei->refs == 0); |
cf27e1ee CM |
349 | refs = btrfs_extent_refs(ei) - 1; |
350 | btrfs_set_extent_refs(ei, refs); | |
5caf2a00 | 351 | btrfs_mark_buffer_dirty(path->nodes[0]); |
cf27e1ee | 352 | if (refs == 0) { |
1261ec42 | 353 | u64 super_blocks_used; |
78fae27e CM |
354 | |
355 | if (pin) { | |
8ef97622 | 356 | ret = pin_down_block(root, blocknr, 0); |
78fae27e CM |
357 | BUG_ON(ret); |
358 | } | |
359 | ||
1261ec42 CM |
360 | super_blocks_used = btrfs_super_blocks_used(info->disk_super); |
361 | btrfs_set_super_blocks_used(info->disk_super, | |
362 | super_blocks_used - num_blocks); | |
5caf2a00 | 363 | ret = btrfs_del_item(trans, extent_root, path); |
a28ec197 CM |
364 | if (ret) |
365 | BUG(); | |
9078a3e1 CM |
366 | ret = update_block_group(trans, root, blocknr, num_blocks, 0); |
367 | BUG_ON(ret); | |
a28ec197 | 368 | } |
5caf2a00 CM |
369 | btrfs_release_path(extent_root, path); |
370 | btrfs_free_path(path); | |
e089f05c | 371 | finish_current_insert(trans, extent_root); |
a28ec197 CM |
372 | return ret; |
373 | } | |
374 | ||
a28ec197 CM |
375 | /* |
376 | * find all the blocks marked as pending in the radix tree and remove | |
377 | * them from the extent map | |
378 | */ | |
e089f05c CM |
379 | static int del_pending_extents(struct btrfs_trans_handle *trans, struct |
380 | btrfs_root *extent_root) | |
a28ec197 CM |
381 | { |
382 | int ret; | |
e20d96d6 CM |
383 | int wret; |
384 | int err = 0; | |
8ef97622 | 385 | unsigned long gang[4]; |
a28ec197 | 386 | int i; |
8ef97622 CM |
387 | struct radix_tree_root *pending_radix; |
388 | struct radix_tree_root *pinned_radix; | |
389 | ||
390 | pending_radix = &extent_root->fs_info->pending_del_radix; | |
391 | pinned_radix = &extent_root->fs_info->pinned_radix; | |
a28ec197 CM |
392 | |
393 | while(1) { | |
8ef97622 CM |
394 | ret = find_first_radix_bit(pending_radix, gang, |
395 | ARRAY_SIZE(gang)); | |
a28ec197 CM |
396 | if (!ret) |
397 | break; | |
398 | for (i = 0; i < ret; i++) { | |
8ef97622 CM |
399 | wret = set_radix_bit(pinned_radix, gang[i]); |
400 | BUG_ON(wret); | |
401 | wret = clear_radix_bit(pending_radix, gang[i]); | |
402 | BUG_ON(wret); | |
d5719762 | 403 | wret = __free_extent(trans, extent_root, |
8ef97622 | 404 | gang[i], 1, 0); |
e20d96d6 CM |
405 | if (wret) |
406 | err = wret; | |
fec577fb CM |
407 | } |
408 | } | |
e20d96d6 | 409 | return err; |
fec577fb CM |
410 | } |
411 | ||
412 | /* | |
413 | * remove an extent from the root, returns 0 on success | |
414 | */ | |
e089f05c CM |
415 | int btrfs_free_extent(struct btrfs_trans_handle *trans, struct btrfs_root |
416 | *root, u64 blocknr, u64 num_blocks, int pin) | |
fec577fb | 417 | { |
9f5fae2f | 418 | struct btrfs_root *extent_root = root->fs_info->extent_root; |
fec577fb CM |
419 | int pending_ret; |
420 | int ret; | |
a28ec197 | 421 | |
fec577fb | 422 | if (root == extent_root) { |
8ef97622 | 423 | pin_down_block(root, blocknr, 1); |
fec577fb CM |
424 | return 0; |
425 | } | |
78fae27e | 426 | ret = __free_extent(trans, root, blocknr, num_blocks, pin); |
e20d96d6 | 427 | pending_ret = del_pending_extents(trans, root->fs_info->extent_root); |
fec577fb CM |
428 | return ret ? ret : pending_ret; |
429 | } | |
430 | ||
431 | /* | |
432 | * walks the btree of allocated extents and find a hole of a given size. | |
433 | * The key ins is changed to record the hole: | |
434 | * ins->objectid == block start | |
62e2749e | 435 | * ins->flags = BTRFS_EXTENT_ITEM_KEY |
fec577fb CM |
436 | * ins->offset == number of blocks |
437 | * Any available blocks before search_start are skipped. | |
438 | */ | |
e089f05c CM |
439 | static int find_free_extent(struct btrfs_trans_handle *trans, struct btrfs_root |
440 | *orig_root, u64 num_blocks, u64 search_start, u64 | |
441 | search_end, struct btrfs_key *ins) | |
fec577fb | 442 | { |
5caf2a00 | 443 | struct btrfs_path *path; |
e2fa7227 | 444 | struct btrfs_key key; |
fec577fb CM |
445 | int ret; |
446 | u64 hole_size = 0; | |
447 | int slot = 0; | |
e20d96d6 | 448 | u64 last_block = 0; |
037e6390 | 449 | u64 test_block; |
fec577fb | 450 | int start_found; |
234b63a0 | 451 | struct btrfs_leaf *l; |
9f5fae2f | 452 | struct btrfs_root * root = orig_root->fs_info->extent_root; |
f2458e1d | 453 | struct btrfs_fs_info *info = root->fs_info; |
0579da42 | 454 | int total_needed = num_blocks; |
f2458e1d CM |
455 | int total_found = 0; |
456 | int fill_prealloc = 0; | |
e20d96d6 | 457 | int level; |
fec577fb | 458 | |
b1a4d965 CM |
459 | path = btrfs_alloc_path(); |
460 | ins->flags = 0; | |
461 | btrfs_set_key_type(ins, BTRFS_EXTENT_ITEM_KEY); | |
462 | ||
e20d96d6 | 463 | level = btrfs_header_level(btrfs_buffer_header(root->node)); |
f2458e1d CM |
464 | if (num_blocks == 0) { |
465 | fill_prealloc = 1; | |
466 | num_blocks = 1; | |
467 | total_needed = min(level + 2, BTRFS_MAX_LEVEL) * 3; | |
468 | } | |
f2458e1d CM |
469 | if (info->last_insert.objectid > search_start) |
470 | search_start = info->last_insert.objectid; | |
62e2749e | 471 | |
fec577fb | 472 | check_failed: |
5caf2a00 | 473 | btrfs_init_path(path); |
fec577fb CM |
474 | ins->objectid = search_start; |
475 | ins->offset = 0; | |
fec577fb | 476 | start_found = 0; |
5caf2a00 | 477 | ret = btrfs_search_slot(trans, root, ins, path, 0, 0); |
0f70abe2 CM |
478 | if (ret < 0) |
479 | goto error; | |
aa5d6bed | 480 | |
5caf2a00 CM |
481 | if (path->slots[0] > 0) |
482 | path->slots[0]--; | |
0579da42 | 483 | |
fec577fb | 484 | while (1) { |
5caf2a00 CM |
485 | l = btrfs_buffer_leaf(path->nodes[0]); |
486 | slot = path->slots[0]; | |
7518a238 | 487 | if (slot >= btrfs_header_nritems(&l->header)) { |
f2458e1d CM |
488 | if (fill_prealloc) { |
489 | info->extent_tree_prealloc_nr = 0; | |
490 | total_found = 0; | |
491 | } | |
5caf2a00 | 492 | ret = btrfs_next_leaf(root, path); |
fec577fb CM |
493 | if (ret == 0) |
494 | continue; | |
0f70abe2 CM |
495 | if (ret < 0) |
496 | goto error; | |
fec577fb CM |
497 | if (!start_found) { |
498 | ins->objectid = search_start; | |
f2458e1d | 499 | ins->offset = (u64)-1 - search_start; |
fec577fb CM |
500 | start_found = 1; |
501 | goto check_pending; | |
502 | } | |
503 | ins->objectid = last_block > search_start ? | |
504 | last_block : search_start; | |
f2458e1d | 505 | ins->offset = (u64)-1 - ins->objectid; |
fec577fb CM |
506 | goto check_pending; |
507 | } | |
e2fa7227 | 508 | btrfs_disk_key_to_cpu(&key, &l->items[slot].key); |
9078a3e1 CM |
509 | if (btrfs_key_type(&key) != BTRFS_EXTENT_ITEM_KEY) |
510 | goto next; | |
e2fa7227 | 511 | if (key.objectid >= search_start) { |
fec577fb | 512 | if (start_found) { |
0579da42 CM |
513 | if (last_block < search_start) |
514 | last_block = search_start; | |
e2fa7227 | 515 | hole_size = key.objectid - last_block; |
f2458e1d | 516 | if (hole_size > num_blocks) { |
fec577fb | 517 | ins->objectid = last_block; |
037e6390 | 518 | ins->offset = hole_size; |
fec577fb CM |
519 | goto check_pending; |
520 | } | |
0579da42 | 521 | } |
fec577fb | 522 | } |
0579da42 | 523 | start_found = 1; |
e2fa7227 | 524 | last_block = key.objectid + key.offset; |
9078a3e1 | 525 | next: |
5caf2a00 | 526 | path->slots[0]++; |
fec577fb CM |
527 | } |
528 | // FIXME -ENOSPC | |
529 | check_pending: | |
530 | /* we have to make sure we didn't find an extent that has already | |
531 | * been allocated by the map tree or the original allocation | |
532 | */ | |
5caf2a00 | 533 | btrfs_release_path(root, path); |
fec577fb | 534 | BUG_ON(ins->objectid < search_start); |
037e6390 | 535 | for (test_block = ins->objectid; |
f2458e1d CM |
536 | test_block < ins->objectid + num_blocks; test_block++) { |
537 | if (test_radix_bit(&info->pinned_radix, test_block)) { | |
037e6390 | 538 | search_start = test_block + 1; |
fec577fb CM |
539 | goto check_failed; |
540 | } | |
541 | } | |
f2458e1d CM |
542 | if (!fill_prealloc && info->extent_tree_insert_nr) { |
543 | u64 last = | |
544 | info->extent_tree_insert[info->extent_tree_insert_nr - 1]; | |
545 | if (ins->objectid + num_blocks > | |
546 | info->extent_tree_insert[0] && | |
547 | ins->objectid <= last) { | |
548 | search_start = last + 1; | |
549 | WARN_ON(1); | |
550 | goto check_failed; | |
551 | } | |
552 | } | |
553 | if (!fill_prealloc && info->extent_tree_prealloc_nr) { | |
554 | u64 first = | |
555 | info->extent_tree_prealloc[info->extent_tree_prealloc_nr - 1]; | |
556 | if (ins->objectid + num_blocks > first && | |
557 | ins->objectid <= info->extent_tree_prealloc[0]) { | |
558 | search_start = info->extent_tree_prealloc[0] + 1; | |
559 | WARN_ON(1); | |
560 | goto check_failed; | |
561 | } | |
562 | } | |
563 | if (fill_prealloc) { | |
564 | int nr; | |
565 | test_block = ins->objectid; | |
566 | while(test_block < ins->objectid + ins->offset && | |
567 | total_found < total_needed) { | |
568 | nr = total_needed - total_found - 1; | |
569 | BUG_ON(nr < 0); | |
570 | root->fs_info->extent_tree_prealloc[nr] = | |
571 | test_block; | |
572 | total_found++; | |
573 | test_block++; | |
574 | } | |
575 | if (total_found < total_needed) { | |
576 | search_start = test_block; | |
577 | goto check_failed; | |
578 | } | |
579 | root->fs_info->extent_tree_prealloc_nr = total_found; | |
580 | } | |
9f5fae2f | 581 | root->fs_info->last_insert.objectid = ins->objectid; |
037e6390 | 582 | ins->offset = num_blocks; |
5caf2a00 | 583 | btrfs_free_path(path); |
fec577fb | 584 | return 0; |
0f70abe2 | 585 | error: |
5caf2a00 CM |
586 | btrfs_release_path(root, path); |
587 | btrfs_free_path(path); | |
0f70abe2 | 588 | return ret; |
fec577fb | 589 | } |
fec577fb CM |
590 | /* |
591 | * finds a free extent and does all the dirty work required for allocation | |
592 | * returns the key for the extent through ins, and a tree buffer for | |
593 | * the first block of the extent through buf. | |
594 | * | |
595 | * returns 0 if everything worked, non-zero otherwise. | |
596 | */ | |
4d775673 CM |
597 | int btrfs_alloc_extent(struct btrfs_trans_handle *trans, |
598 | struct btrfs_root *root, u64 owner, | |
c62a1920 | 599 | u64 num_blocks, u64 search_start, |
4d775673 | 600 | u64 search_end, struct btrfs_key *ins) |
fec577fb CM |
601 | { |
602 | int ret; | |
603 | int pending_ret; | |
1261ec42 CM |
604 | u64 super_blocks_used; |
605 | struct btrfs_fs_info *info = root->fs_info; | |
606 | struct btrfs_root *extent_root = info->extent_root; | |
234b63a0 | 607 | struct btrfs_extent_item extent_item; |
f2458e1d | 608 | struct btrfs_key prealloc_key; |
037e6390 | 609 | |
cf27e1ee | 610 | btrfs_set_extent_refs(&extent_item, 1); |
4d775673 | 611 | btrfs_set_extent_owner(&extent_item, owner); |
fec577fb | 612 | |
037e6390 | 613 | if (root == extent_root) { |
f2458e1d CM |
614 | int nr; |
615 | BUG_ON(info->extent_tree_prealloc_nr == 0); | |
037e6390 | 616 | BUG_ON(num_blocks != 1); |
037e6390 | 617 | ins->offset = 1; |
f2458e1d CM |
618 | info->extent_tree_prealloc_nr--; |
619 | nr = info->extent_tree_prealloc_nr; | |
620 | ins->objectid = info->extent_tree_prealloc[nr]; | |
621 | info->extent_tree_insert[info->extent_tree_insert_nr++] = | |
622 | ins->objectid; | |
9078a3e1 CM |
623 | ret = update_block_group(trans, root, |
624 | ins->objectid, ins->offset, 1); | |
625 | BUG_ON(ret); | |
fec577fb CM |
626 | return 0; |
627 | } | |
f2458e1d | 628 | /* do the real allocation */ |
e089f05c | 629 | ret = find_free_extent(trans, root, num_blocks, search_start, |
037e6390 CM |
630 | search_end, ins); |
631 | if (ret) | |
632 | return ret; | |
fec577fb | 633 | |
f2458e1d CM |
634 | /* then do prealloc for the extent tree */ |
635 | ret = find_free_extent(trans, root, 0, ins->objectid + ins->offset, | |
636 | search_end, &prealloc_key); | |
637 | if (ret) | |
638 | return ret; | |
639 | ||
1261ec42 CM |
640 | super_blocks_used = btrfs_super_blocks_used(info->disk_super); |
641 | btrfs_set_super_blocks_used(info->disk_super, super_blocks_used + | |
642 | num_blocks); | |
e089f05c CM |
643 | ret = btrfs_insert_item(trans, extent_root, ins, &extent_item, |
644 | sizeof(extent_item)); | |
037e6390 | 645 | |
e089f05c | 646 | finish_current_insert(trans, extent_root); |
e20d96d6 | 647 | pending_ret = del_pending_extents(trans, extent_root); |
037e6390 CM |
648 | if (ret) |
649 | return ret; | |
650 | if (pending_ret) | |
651 | return pending_ret; | |
9078a3e1 | 652 | ret = update_block_group(trans, root, ins->objectid, ins->offset, 1); |
037e6390 | 653 | return 0; |
fec577fb CM |
654 | } |
655 | ||
656 | /* | |
657 | * helper function to allocate a block for a given tree | |
658 | * returns the tree buffer or NULL. | |
659 | */ | |
e20d96d6 | 660 | struct buffer_head *btrfs_alloc_free_block(struct btrfs_trans_handle *trans, |
4d775673 | 661 | struct btrfs_root *root) |
fec577fb | 662 | { |
e2fa7227 | 663 | struct btrfs_key ins; |
fec577fb | 664 | int ret; |
e20d96d6 | 665 | struct buffer_head *buf; |
fec577fb | 666 | |
4d775673 | 667 | ret = btrfs_alloc_extent(trans, root, root->root_key.objectid, |
4d775673 | 668 | 1, 0, (unsigned long)-1, &ins); |
fec577fb CM |
669 | if (ret) { |
670 | BUG(); | |
671 | return NULL; | |
672 | } | |
9078a3e1 | 673 | BUG_ON(ret); |
d98237b3 | 674 | buf = btrfs_find_create_tree_block(root, ins.objectid); |
df2ce34c | 675 | set_buffer_uptodate(buf); |
fec577fb CM |
676 | return buf; |
677 | } | |
a28ec197 | 678 | |
6407bf6d CM |
679 | static int drop_leaf_ref(struct btrfs_trans_handle *trans, |
680 | struct btrfs_root *root, struct buffer_head *cur) | |
681 | { | |
682 | struct btrfs_disk_key *key; | |
683 | struct btrfs_leaf *leaf; | |
684 | struct btrfs_file_extent_item *fi; | |
685 | int i; | |
686 | int nritems; | |
687 | int ret; | |
688 | ||
689 | BUG_ON(!btrfs_is_leaf(btrfs_buffer_node(cur))); | |
690 | leaf = btrfs_buffer_leaf(cur); | |
691 | nritems = btrfs_header_nritems(&leaf->header); | |
692 | for (i = 0; i < nritems; i++) { | |
693 | key = &leaf->items[i].key; | |
694 | if (btrfs_disk_key_type(key) != BTRFS_EXTENT_DATA_KEY) | |
695 | continue; | |
696 | fi = btrfs_item_ptr(leaf, i, struct btrfs_file_extent_item); | |
236454df CM |
697 | if (btrfs_file_extent_type(fi) == BTRFS_FILE_EXTENT_INLINE) |
698 | continue; | |
6407bf6d CM |
699 | /* |
700 | * FIXME make sure to insert a trans record that | |
701 | * repeats the snapshot del on crash | |
702 | */ | |
703 | ret = btrfs_free_extent(trans, root, | |
704 | btrfs_file_extent_disk_blocknr(fi), | |
705 | btrfs_file_extent_disk_num_blocks(fi), | |
706 | 0); | |
707 | BUG_ON(ret); | |
708 | } | |
709 | return 0; | |
710 | } | |
711 | ||
9aca1d51 CM |
712 | /* |
713 | * helper function for drop_snapshot, this walks down the tree dropping ref | |
714 | * counts as it goes. | |
715 | */ | |
e089f05c CM |
716 | static int walk_down_tree(struct btrfs_trans_handle *trans, struct btrfs_root |
717 | *root, struct btrfs_path *path, int *level) | |
20524f02 | 718 | { |
e20d96d6 CM |
719 | struct buffer_head *next; |
720 | struct buffer_head *cur; | |
20524f02 CM |
721 | u64 blocknr; |
722 | int ret; | |
723 | u32 refs; | |
724 | ||
5caf2a00 CM |
725 | WARN_ON(*level < 0); |
726 | WARN_ON(*level >= BTRFS_MAX_LEVEL); | |
b18c6685 | 727 | ret = lookup_extent_ref(trans, root, bh_blocknr(path->nodes[*level]), |
6407bf6d | 728 | 1, &refs); |
20524f02 CM |
729 | BUG_ON(ret); |
730 | if (refs > 1) | |
731 | goto out; | |
9aca1d51 CM |
732 | /* |
733 | * walk down to the last node level and free all the leaves | |
734 | */ | |
6407bf6d | 735 | while(*level >= 0) { |
5caf2a00 CM |
736 | WARN_ON(*level < 0); |
737 | WARN_ON(*level >= BTRFS_MAX_LEVEL); | |
20524f02 | 738 | cur = path->nodes[*level]; |
2c90e5d6 CM |
739 | if (btrfs_header_level(btrfs_buffer_header(cur)) != *level) |
740 | WARN_ON(1); | |
7518a238 | 741 | if (path->slots[*level] >= |
e20d96d6 | 742 | btrfs_header_nritems(btrfs_buffer_header(cur))) |
20524f02 | 743 | break; |
6407bf6d CM |
744 | if (*level == 0) { |
745 | ret = drop_leaf_ref(trans, root, cur); | |
746 | BUG_ON(ret); | |
747 | break; | |
748 | } | |
e20d96d6 CM |
749 | blocknr = btrfs_node_blockptr(btrfs_buffer_node(cur), |
750 | path->slots[*level]); | |
b18c6685 | 751 | ret = lookup_extent_ref(trans, root, blocknr, 1, &refs); |
6407bf6d CM |
752 | BUG_ON(ret); |
753 | if (refs != 1) { | |
20524f02 | 754 | path->slots[*level]++; |
e089f05c | 755 | ret = btrfs_free_extent(trans, root, blocknr, 1, 1); |
20524f02 CM |
756 | BUG_ON(ret); |
757 | continue; | |
758 | } | |
20524f02 | 759 | next = read_tree_block(root, blocknr); |
5caf2a00 | 760 | WARN_ON(*level <= 0); |
83e15a28 | 761 | if (path->nodes[*level-1]) |
234b63a0 | 762 | btrfs_block_release(root, path->nodes[*level-1]); |
20524f02 | 763 | path->nodes[*level-1] = next; |
e20d96d6 | 764 | *level = btrfs_header_level(btrfs_buffer_header(next)); |
20524f02 CM |
765 | path->slots[*level] = 0; |
766 | } | |
767 | out: | |
5caf2a00 CM |
768 | WARN_ON(*level < 0); |
769 | WARN_ON(*level >= BTRFS_MAX_LEVEL); | |
6407bf6d | 770 | ret = btrfs_free_extent(trans, root, |
7eccb903 | 771 | bh_blocknr(path->nodes[*level]), 1, 1); |
234b63a0 | 772 | btrfs_block_release(root, path->nodes[*level]); |
20524f02 CM |
773 | path->nodes[*level] = NULL; |
774 | *level += 1; | |
775 | BUG_ON(ret); | |
776 | return 0; | |
777 | } | |
778 | ||
9aca1d51 CM |
779 | /* |
780 | * helper for dropping snapshots. This walks back up the tree in the path | |
781 | * to find the first node higher up where we haven't yet gone through | |
782 | * all the slots | |
783 | */ | |
e089f05c CM |
784 | static int walk_up_tree(struct btrfs_trans_handle *trans, struct btrfs_root |
785 | *root, struct btrfs_path *path, int *level) | |
20524f02 CM |
786 | { |
787 | int i; | |
788 | int slot; | |
789 | int ret; | |
234b63a0 | 790 | for(i = *level; i < BTRFS_MAX_LEVEL - 1 && path->nodes[i]; i++) { |
20524f02 | 791 | slot = path->slots[i]; |
e20d96d6 CM |
792 | if (slot < btrfs_header_nritems( |
793 | btrfs_buffer_header(path->nodes[i])) - 1) { | |
20524f02 CM |
794 | path->slots[i]++; |
795 | *level = i; | |
796 | return 0; | |
797 | } else { | |
e089f05c | 798 | ret = btrfs_free_extent(trans, root, |
7eccb903 | 799 | bh_blocknr(path->nodes[*level]), |
e089f05c | 800 | 1, 1); |
6407bf6d | 801 | BUG_ON(ret); |
234b63a0 | 802 | btrfs_block_release(root, path->nodes[*level]); |
83e15a28 | 803 | path->nodes[*level] = NULL; |
20524f02 | 804 | *level = i + 1; |
20524f02 CM |
805 | } |
806 | } | |
807 | return 1; | |
808 | } | |
809 | ||
9aca1d51 CM |
810 | /* |
811 | * drop the reference count on the tree rooted at 'snap'. This traverses | |
812 | * the tree freeing any blocks that have a ref count of zero after being | |
813 | * decremented. | |
814 | */ | |
e089f05c | 815 | int btrfs_drop_snapshot(struct btrfs_trans_handle *trans, struct btrfs_root |
e20d96d6 | 816 | *root, struct buffer_head *snap) |
20524f02 | 817 | { |
3768f368 | 818 | int ret = 0; |
9aca1d51 | 819 | int wret; |
20524f02 | 820 | int level; |
5caf2a00 | 821 | struct btrfs_path *path; |
20524f02 CM |
822 | int i; |
823 | int orig_level; | |
824 | ||
5caf2a00 CM |
825 | path = btrfs_alloc_path(); |
826 | BUG_ON(!path); | |
827 | btrfs_init_path(path); | |
20524f02 | 828 | |
e20d96d6 | 829 | level = btrfs_header_level(btrfs_buffer_header(snap)); |
20524f02 | 830 | orig_level = level; |
5caf2a00 CM |
831 | path->nodes[level] = snap; |
832 | path->slots[level] = 0; | |
20524f02 | 833 | while(1) { |
5caf2a00 | 834 | wret = walk_down_tree(trans, root, path, &level); |
9aca1d51 | 835 | if (wret > 0) |
20524f02 | 836 | break; |
9aca1d51 CM |
837 | if (wret < 0) |
838 | ret = wret; | |
839 | ||
5caf2a00 | 840 | wret = walk_up_tree(trans, root, path, &level); |
9aca1d51 | 841 | if (wret > 0) |
20524f02 | 842 | break; |
9aca1d51 CM |
843 | if (wret < 0) |
844 | ret = wret; | |
20524f02 | 845 | } |
83e15a28 | 846 | for (i = 0; i <= orig_level; i++) { |
5caf2a00 CM |
847 | if (path->nodes[i]) { |
848 | btrfs_block_release(root, path->nodes[i]); | |
83e15a28 | 849 | } |
20524f02 | 850 | } |
5caf2a00 | 851 | btrfs_free_path(path); |
9aca1d51 | 852 | return ret; |
20524f02 | 853 | } |
9078a3e1 CM |
854 | |
855 | int btrfs_free_block_groups(struct btrfs_fs_info *info) | |
856 | { | |
857 | int ret; | |
858 | struct btrfs_block_group_cache *cache[8]; | |
859 | int i; | |
860 | ||
861 | while(1) { | |
862 | ret = radix_tree_gang_lookup(&info->block_group_radix, | |
863 | (void **)cache, 0, | |
864 | ARRAY_SIZE(cache)); | |
865 | if (!ret) | |
866 | break; | |
867 | for (i = 0; i < ret; i++) { | |
868 | radix_tree_delete(&info->block_group_radix, | |
869 | cache[i]->key.objectid + | |
870 | cache[i]->key.offset - 1); | |
871 | kfree(cache[i]); | |
872 | } | |
873 | } | |
874 | return 0; | |
875 | } | |
876 | ||
877 | int btrfs_read_block_groups(struct btrfs_root *root) | |
878 | { | |
879 | struct btrfs_path *path; | |
880 | int ret; | |
881 | int err = 0; | |
882 | struct btrfs_block_group_item *bi; | |
883 | struct btrfs_block_group_cache *cache; | |
884 | struct btrfs_key key; | |
885 | struct btrfs_key found_key; | |
886 | struct btrfs_leaf *leaf; | |
887 | u64 group_size_blocks = BTRFS_BLOCK_GROUP_SIZE / root->blocksize; | |
888 | ||
889 | root = root->fs_info->extent_root; | |
890 | key.objectid = 0; | |
891 | key.offset = group_size_blocks; | |
892 | key.flags = 0; | |
893 | btrfs_set_key_type(&key, BTRFS_BLOCK_GROUP_ITEM_KEY); | |
894 | ||
895 | path = btrfs_alloc_path(); | |
896 | if (!path) | |
897 | return -ENOMEM; | |
898 | ||
899 | while(1) { | |
900 | ret = btrfs_search_slot(NULL, root->fs_info->extent_root, | |
901 | &key, path, 0, 0); | |
902 | if (ret != 0) { | |
903 | err = ret; | |
904 | break; | |
905 | } | |
906 | leaf = btrfs_buffer_leaf(path->nodes[0]); | |
907 | btrfs_disk_key_to_cpu(&found_key, | |
908 | &leaf->items[path->slots[0]].key); | |
909 | cache = kmalloc(sizeof(*cache), GFP_NOFS); | |
910 | if (!cache) { | |
911 | err = -1; | |
912 | break; | |
913 | } | |
914 | bi = btrfs_item_ptr(leaf, path->slots[0], | |
915 | struct btrfs_block_group_item); | |
916 | memcpy(&cache->item, bi, sizeof(*bi)); | |
917 | memcpy(&cache->key, &found_key, sizeof(found_key)); | |
918 | key.objectid = found_key.objectid + found_key.offset; | |
919 | btrfs_release_path(root, path); | |
920 | ret = radix_tree_insert(&root->fs_info->block_group_radix, | |
921 | found_key.objectid + | |
922 | found_key.offset - 1, | |
923 | (void *)cache); | |
924 | BUG_ON(ret); | |
925 | if (key.objectid >= | |
926 | btrfs_super_total_blocks(root->fs_info->disk_super)) | |
927 | break; | |
928 | } | |
929 | ||
930 | btrfs_free_path(path); | |
931 | return 0; | |
932 | } |