3 #include "kerncompat.h"
4 #include "radix-tree.h"
7 #include "print-tree.h"
9 static int find_free_extent(struct ctree_root *orig_root, u64 num_blocks,
10 u64 search_start, u64 search_end,
11 struct btrfs_key *ins);
12 static int finish_current_insert(struct ctree_root *extent_root);
13 static int run_pending(struct ctree_root *extent_root);
16 * pending extents are blocks that we're trying to allocate in the extent
17 * map while trying to grow the map because of other allocations. To avoid
18 * recursing, they are tagged in the radix tree and cleaned up after
19 * other allocations are done. The pending tag is also used in the same
22 #define CTREE_EXTENT_PENDING_DEL 0
24 static int inc_block_ref(struct ctree_root *root, u64 blocknr)
26 struct ctree_path path;
30 struct extent_item *item;
33 find_free_extent(root->extent_root, 0, 0, (u64)-1, &ins);
35 key.objectid = blocknr;
38 ret = search_slot(root->extent_root, &key, &path, 0, 1);
42 l = &path.nodes[0]->leaf;
43 item = (struct extent_item *)(l->data + btrfs_item_offset(l->items +
47 BUG_ON(list_empty(&path.nodes[0]->dirty));
48 release_path(root->extent_root, &path);
49 finish_current_insert(root->extent_root);
50 run_pending(root->extent_root);
54 static int lookup_block_ref(struct ctree_root *root, u64 blocknr, u32 *refs)
56 struct ctree_path path;
60 struct extent_item *item;
62 key.objectid = blocknr;
65 ret = search_slot(root->extent_root, &key, &path, 0, 0);
68 l = &path.nodes[0]->leaf;
69 item = (struct extent_item *)(l->data +
70 btrfs_item_offset(l->items +
73 release_path(root->extent_root, &path);
77 int btrfs_inc_ref(struct ctree_root *root, struct tree_buffer *buf)
82 if (root == root->extent_root)
84 if (btrfs_is_leaf(&buf->node))
87 for (i = 0; i < btrfs_header_nritems(&buf->node.header); i++) {
88 blocknr = buf->node.blockptrs[i];
89 inc_block_ref(root, blocknr);
94 int btrfs_finish_extent_commit(struct ctree_root *root)
96 struct ctree_root *extent_root = root->extent_root;
97 unsigned long gang[8];
102 ret = radix_tree_gang_lookup(&extent_root->pinned_radix,
107 for (i = 0; i < ret; i++) {
108 radix_tree_delete(&extent_root->pinned_radix, gang[i]);
111 extent_root->last_insert.objectid = 0;
112 extent_root->last_insert.offset = 0;
116 static int finish_current_insert(struct ctree_root *extent_root)
118 struct btrfs_key ins;
119 struct extent_item extent_item;
123 extent_item.refs = 1;
125 btrfs_header_parentid(&extent_root->node->node.header);
129 for (i = 0; i < extent_root->current_insert.flags; i++) {
130 ins.objectid = extent_root->current_insert.objectid + i;
131 ret = insert_item(extent_root, &ins, &extent_item,
132 sizeof(extent_item));
135 extent_root->current_insert.offset = 0;
140 * remove an extent from the root, returns 0 on success
142 int __free_extent(struct ctree_root *root, u64 blocknr, u64 num_blocks)
144 struct ctree_path path;
145 struct btrfs_key key;
146 struct ctree_root *extent_root = root->extent_root;
148 struct btrfs_item *item;
149 struct extent_item *ei;
150 struct btrfs_key ins;
152 key.objectid = blocknr;
154 key.offset = num_blocks;
156 find_free_extent(root, 0, 0, (u64)-1, &ins);
158 ret = search_slot(extent_root, &key, &path, -1, 1);
160 printf("failed to find %Lu\n", key.objectid);
161 print_tree(extent_root, extent_root->node);
162 printf("failed to find %Lu\n", key.objectid);
165 item = path.nodes[0]->leaf.items + path.slots[0];
166 ei = (struct extent_item *)(path.nodes[0]->leaf.data +
167 btrfs_item_offset(item));
168 BUG_ON(ei->refs == 0);
171 if (root == extent_root) {
173 radix_tree_preload(GFP_KERNEL);
174 err = radix_tree_insert(&extent_root->pinned_radix,
175 blocknr, (void *)blocknr);
177 radix_tree_preload_end();
179 ret = del_item(extent_root, &path);
180 if (root != extent_root &&
181 extent_root->last_insert.objectid < blocknr)
182 extent_root->last_insert.objectid = blocknr;
186 release_path(extent_root, &path);
187 finish_current_insert(extent_root);
192 * find all the blocks marked as pending in the radix tree and remove
193 * them from the extent map
195 static int del_pending_extents(struct ctree_root *extent_root)
198 struct tree_buffer *gang[4];
202 ret = radix_tree_gang_lookup_tag(&extent_root->cache_radix,
205 CTREE_EXTENT_PENDING_DEL);
208 for (i = 0; i < ret; i++) {
209 ret = __free_extent(extent_root, gang[i]->blocknr, 1);
210 radix_tree_tag_clear(&extent_root->cache_radix,
212 CTREE_EXTENT_PENDING_DEL);
213 tree_block_release(extent_root, gang[i]);
219 static int run_pending(struct ctree_root *extent_root)
221 while(radix_tree_tagged(&extent_root->cache_radix,
222 CTREE_EXTENT_PENDING_DEL))
223 del_pending_extents(extent_root);
229 * remove an extent from the root, returns 0 on success
231 int free_extent(struct ctree_root *root, u64 blocknr, u64 num_blocks)
233 struct btrfs_key key;
234 struct ctree_root *extent_root = root->extent_root;
235 struct tree_buffer *t;
239 if (root == extent_root) {
240 t = find_tree_block(root, blocknr);
241 radix_tree_tag_set(&root->cache_radix, blocknr,
242 CTREE_EXTENT_PENDING_DEL);
245 key.objectid = blocknr;
247 key.offset = num_blocks;
248 ret = __free_extent(root, blocknr, num_blocks);
249 pending_ret = run_pending(root->extent_root);
250 return ret ? ret : pending_ret;
254 * walks the btree of allocated extents and find a hole of a given size.
255 * The key ins is changed to record the hole:
256 * ins->objectid == block start
258 * ins->offset == number of blocks
259 * Any available blocks before search_start are skipped.
261 static int find_free_extent(struct ctree_root *orig_root, u64 num_blocks,
262 u64 search_start, u64 search_end,
263 struct btrfs_key *ins)
265 struct ctree_path path;
266 struct btrfs_key key;
274 struct ctree_root * root = orig_root->extent_root;
275 int total_needed = num_blocks;
277 total_needed += (btrfs_header_level(&root->node->node.header) + 1) * 3;
278 if (root->last_insert.objectid > search_start)
279 search_start = root->last_insert.objectid;
282 ins->objectid = search_start;
286 ret = search_slot(root, ins, &path, 0, 0);
290 if (path.slots[0] > 0)
294 l = &path.nodes[0]->leaf;
295 slot = path.slots[0];
296 if (slot >= btrfs_header_nritems(&l->header)) {
297 ret = next_leaf(root, &path);
303 ins->objectid = search_start;
304 ins->offset = (u64)-1;
308 ins->objectid = last_block > search_start ?
309 last_block : search_start;
310 ins->offset = (u64)-1;
313 btrfs_disk_key_to_cpu(&key, &l->items[slot].key);
314 if (key.objectid >= search_start) {
316 if (last_block < search_start)
317 last_block = search_start;
318 hole_size = key.objectid - last_block;
319 if (hole_size > total_needed) {
320 ins->objectid = last_block;
321 ins->offset = hole_size;
327 last_block = key.objectid + key.offset;
332 /* we have to make sure we didn't find an extent that has already
333 * been allocated by the map tree or the original allocation
335 release_path(root, &path);
336 BUG_ON(ins->objectid < search_start);
337 for (test_block = ins->objectid;
338 test_block < ins->objectid + total_needed; test_block++) {
339 if (radix_tree_lookup(&root->pinned_radix, test_block)) {
340 search_start = test_block + 1;
344 BUG_ON(root->current_insert.offset);
345 root->current_insert.offset = total_needed - num_blocks;
346 root->current_insert.objectid = ins->objectid + num_blocks;
347 root->current_insert.flags = 0;
348 root->last_insert.objectid = ins->objectid;
349 ins->offset = num_blocks;
352 release_path(root, &path);
357 * finds a free extent and does all the dirty work required for allocation
358 * returns the key for the extent through ins, and a tree buffer for
359 * the first block of the extent through buf.
361 * returns 0 if everything worked, non-zero otherwise.
363 int alloc_extent(struct ctree_root *root, u64 num_blocks, u64 search_start,
364 u64 search_end, u64 owner, struct btrfs_key *ins)
368 struct ctree_root *extent_root = root->extent_root;
369 struct extent_item extent_item;
371 extent_item.refs = 1;
372 extent_item.owner = owner;
374 if (root == extent_root) {
375 BUG_ON(extent_root->current_insert.offset == 0);
376 BUG_ON(num_blocks != 1);
377 BUG_ON(extent_root->current_insert.flags ==
378 extent_root->current_insert.offset);
380 ins->objectid = extent_root->current_insert.objectid +
381 extent_root->current_insert.flags++;
384 ret = find_free_extent(root, num_blocks, search_start,
389 ret = insert_item(extent_root, ins, &extent_item,
390 sizeof(extent_item));
392 finish_current_insert(extent_root);
393 pending_ret = run_pending(extent_root);
402 * helper function to allocate a block for a given tree
403 * returns the tree buffer or NULL.
405 struct tree_buffer *alloc_free_block(struct ctree_root *root)
407 struct btrfs_key ins;
409 struct tree_buffer *buf;
411 ret = alloc_extent(root, 1, 0, (unsigned long)-1,
412 btrfs_header_parentid(&root->node->node.header),
418 buf = find_tree_block(root, ins.objectid);
419 dirty_tree_block(root, buf);
423 int walk_down_tree(struct ctree_root *root, struct ctree_path *path, int *level)
425 struct tree_buffer *next;
426 struct tree_buffer *cur;
431 ret = lookup_block_ref(root, path->nodes[*level]->blocknr, &refs);
436 cur = path->nodes[*level];
437 if (path->slots[*level] >=
438 btrfs_header_nritems(&cur->node.header))
440 blocknr = cur->node.blockptrs[path->slots[*level]];
441 ret = lookup_block_ref(root, blocknr, &refs);
442 if (refs != 1 || *level == 1) {
443 path->slots[*level]++;
444 ret = free_extent(root, blocknr, 1);
449 next = read_tree_block(root, blocknr);
450 if (path->nodes[*level-1])
451 tree_block_release(root, path->nodes[*level-1]);
452 path->nodes[*level-1] = next;
453 *level = btrfs_header_level(&next->node.header);
454 path->slots[*level] = 0;
457 ret = free_extent(root, path->nodes[*level]->blocknr, 1);
458 tree_block_release(root, path->nodes[*level]);
459 path->nodes[*level] = NULL;
465 int walk_up_tree(struct ctree_root *root, struct ctree_path *path, int *level)
470 for(i = *level; i < MAX_LEVEL - 1 && path->nodes[i]; i++) {
471 slot = path->slots[i];
473 btrfs_header_nritems(&path->nodes[i]->node.header)- 1) {
478 ret = free_extent(root,
479 path->nodes[*level]->blocknr, 1);
480 tree_block_release(root, path->nodes[*level]);
481 path->nodes[*level] = NULL;
489 int btrfs_drop_snapshot(struct ctree_root *root, struct tree_buffer *snap)
493 struct ctree_path path;
499 level = btrfs_header_level(&snap->node.header);
501 path.nodes[level] = snap;
502 path.slots[level] = 0;
504 ret = walk_down_tree(root, &path, &level);
507 ret = walk_up_tree(root, &path, &level);
511 for (i = 0; i <= orig_level; i++) {
513 tree_block_release(root, path.nodes[i]);