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 +
44 l->items[path.slots[0]].offset);
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 l->items[path.slots[0]].offset);
72 release_path(root->extent_root, &path);
76 int btrfs_inc_ref(struct ctree_root *root, struct tree_buffer *buf)
81 if (root == root->extent_root)
83 if (btrfs_is_leaf(&buf->node))
86 for (i = 0; i < btrfs_header_nritems(&buf->node.header); i++) {
87 blocknr = buf->node.blockptrs[i];
88 inc_block_ref(root, blocknr);
93 int btrfs_finish_extent_commit(struct ctree_root *root)
95 struct ctree_root *extent_root = root->extent_root;
96 unsigned long gang[8];
101 ret = radix_tree_gang_lookup(&extent_root->pinned_radix,
106 for (i = 0; i < ret; i++) {
107 radix_tree_delete(&extent_root->pinned_radix, gang[i]);
110 extent_root->last_insert.objectid = 0;
111 extent_root->last_insert.offset = 0;
115 static int finish_current_insert(struct ctree_root *extent_root)
117 struct btrfs_key ins;
118 struct extent_item extent_item;
122 extent_item.refs = 1;
124 btrfs_header_parentid(&extent_root->node->node.header);
128 for (i = 0; i < extent_root->current_insert.flags; i++) {
129 ins.objectid = extent_root->current_insert.objectid + i;
130 ret = insert_item(extent_root, &ins, &extent_item,
131 sizeof(extent_item));
134 extent_root->current_insert.offset = 0;
139 * remove an extent from the root, returns 0 on success
141 int __free_extent(struct ctree_root *root, u64 blocknr, u64 num_blocks)
143 struct ctree_path path;
144 struct btrfs_key key;
145 struct ctree_root *extent_root = root->extent_root;
148 struct extent_item *ei;
149 struct btrfs_key ins;
151 key.objectid = blocknr;
153 key.offset = num_blocks;
155 find_free_extent(root, 0, 0, (u64)-1, &ins);
157 ret = search_slot(extent_root, &key, &path, -1, 1);
159 printf("failed to find %Lu\n", key.objectid);
160 print_tree(extent_root, extent_root->node);
161 printf("failed to find %Lu\n", key.objectid);
164 item = path.nodes[0]->leaf.items + path.slots[0];
165 ei = (struct extent_item *)(path.nodes[0]->leaf.data + item->offset);
166 BUG_ON(ei->refs == 0);
169 if (root == extent_root) {
171 radix_tree_preload(GFP_KERNEL);
172 err = radix_tree_insert(&extent_root->pinned_radix,
173 blocknr, (void *)blocknr);
175 radix_tree_preload_end();
177 ret = del_item(extent_root, &path);
178 if (root != extent_root &&
179 extent_root->last_insert.objectid < blocknr)
180 extent_root->last_insert.objectid = blocknr;
184 release_path(extent_root, &path);
185 finish_current_insert(extent_root);
190 * find all the blocks marked as pending in the radix tree and remove
191 * them from the extent map
193 static int del_pending_extents(struct ctree_root *extent_root)
196 struct tree_buffer *gang[4];
200 ret = radix_tree_gang_lookup_tag(&extent_root->cache_radix,
203 CTREE_EXTENT_PENDING_DEL);
206 for (i = 0; i < ret; i++) {
207 ret = __free_extent(extent_root, gang[i]->blocknr, 1);
208 radix_tree_tag_clear(&extent_root->cache_radix,
210 CTREE_EXTENT_PENDING_DEL);
211 tree_block_release(extent_root, gang[i]);
217 static int run_pending(struct ctree_root *extent_root)
219 while(radix_tree_tagged(&extent_root->cache_radix,
220 CTREE_EXTENT_PENDING_DEL))
221 del_pending_extents(extent_root);
227 * remove an extent from the root, returns 0 on success
229 int free_extent(struct ctree_root *root, u64 blocknr, u64 num_blocks)
231 struct btrfs_key key;
232 struct ctree_root *extent_root = root->extent_root;
233 struct tree_buffer *t;
237 if (root == extent_root) {
238 t = find_tree_block(root, blocknr);
239 radix_tree_tag_set(&root->cache_radix, blocknr,
240 CTREE_EXTENT_PENDING_DEL);
243 key.objectid = blocknr;
245 key.offset = num_blocks;
246 ret = __free_extent(root, blocknr, num_blocks);
247 pending_ret = run_pending(root->extent_root);
248 return ret ? ret : pending_ret;
252 * walks the btree of allocated extents and find a hole of a given size.
253 * The key ins is changed to record the hole:
254 * ins->objectid == block start
256 * ins->offset == number of blocks
257 * Any available blocks before search_start are skipped.
259 static int find_free_extent(struct ctree_root *orig_root, u64 num_blocks,
260 u64 search_start, u64 search_end,
261 struct btrfs_key *ins)
263 struct ctree_path path;
264 struct btrfs_key key;
272 struct ctree_root * root = orig_root->extent_root;
273 int total_needed = num_blocks;
275 total_needed += (btrfs_header_level(&root->node->node.header) + 1) * 3;
276 if (root->last_insert.objectid > search_start)
277 search_start = root->last_insert.objectid;
280 ins->objectid = search_start;
284 ret = search_slot(root, ins, &path, 0, 0);
288 if (path.slots[0] > 0)
292 l = &path.nodes[0]->leaf;
293 slot = path.slots[0];
294 if (slot >= btrfs_header_nritems(&l->header)) {
295 ret = next_leaf(root, &path);
301 ins->objectid = search_start;
302 ins->offset = (u64)-1;
306 ins->objectid = last_block > search_start ?
307 last_block : search_start;
308 ins->offset = (u64)-1;
311 btrfs_disk_key_to_cpu(&key, &l->items[slot].key);
312 if (key.objectid >= search_start) {
314 if (last_block < search_start)
315 last_block = search_start;
316 hole_size = key.objectid - last_block;
317 if (hole_size > total_needed) {
318 ins->objectid = last_block;
319 ins->offset = hole_size;
325 last_block = key.objectid + key.offset;
330 /* we have to make sure we didn't find an extent that has already
331 * been allocated by the map tree or the original allocation
333 release_path(root, &path);
334 BUG_ON(ins->objectid < search_start);
335 for (test_block = ins->objectid;
336 test_block < ins->objectid + total_needed; test_block++) {
337 if (radix_tree_lookup(&root->pinned_radix, test_block)) {
338 search_start = test_block + 1;
342 BUG_ON(root->current_insert.offset);
343 root->current_insert.offset = total_needed - num_blocks;
344 root->current_insert.objectid = ins->objectid + num_blocks;
345 root->current_insert.flags = 0;
346 root->last_insert.objectid = ins->objectid;
347 ins->offset = num_blocks;
350 release_path(root, &path);
355 * finds a free extent and does all the dirty work required for allocation
356 * returns the key for the extent through ins, and a tree buffer for
357 * the first block of the extent through buf.
359 * returns 0 if everything worked, non-zero otherwise.
361 int alloc_extent(struct ctree_root *root, u64 num_blocks, u64 search_start,
362 u64 search_end, u64 owner, struct btrfs_key *ins)
366 struct ctree_root *extent_root = root->extent_root;
367 struct extent_item extent_item;
369 extent_item.refs = 1;
370 extent_item.owner = owner;
372 if (root == extent_root) {
373 BUG_ON(extent_root->current_insert.offset == 0);
374 BUG_ON(num_blocks != 1);
375 BUG_ON(extent_root->current_insert.flags ==
376 extent_root->current_insert.offset);
378 ins->objectid = extent_root->current_insert.objectid +
379 extent_root->current_insert.flags++;
382 ret = find_free_extent(root, num_blocks, search_start,
387 ret = insert_item(extent_root, ins, &extent_item,
388 sizeof(extent_item));
390 finish_current_insert(extent_root);
391 pending_ret = run_pending(extent_root);
400 * helper function to allocate a block for a given tree
401 * returns the tree buffer or NULL.
403 struct tree_buffer *alloc_free_block(struct ctree_root *root)
405 struct btrfs_key ins;
407 struct tree_buffer *buf;
409 ret = alloc_extent(root, 1, 0, (unsigned long)-1,
410 btrfs_header_parentid(&root->node->node.header),
416 buf = find_tree_block(root, ins.objectid);
417 dirty_tree_block(root, buf);
421 int walk_down_tree(struct ctree_root *root, struct ctree_path *path, int *level)
423 struct tree_buffer *next;
424 struct tree_buffer *cur;
429 ret = lookup_block_ref(root, path->nodes[*level]->blocknr, &refs);
434 cur = path->nodes[*level];
435 if (path->slots[*level] >=
436 btrfs_header_nritems(&cur->node.header))
438 blocknr = cur->node.blockptrs[path->slots[*level]];
439 ret = lookup_block_ref(root, blocknr, &refs);
440 if (refs != 1 || *level == 1) {
441 path->slots[*level]++;
442 ret = free_extent(root, blocknr, 1);
447 next = read_tree_block(root, blocknr);
448 if (path->nodes[*level-1])
449 tree_block_release(root, path->nodes[*level-1]);
450 path->nodes[*level-1] = next;
451 *level = btrfs_header_level(&next->node.header);
452 path->slots[*level] = 0;
455 ret = free_extent(root, path->nodes[*level]->blocknr, 1);
456 tree_block_release(root, path->nodes[*level]);
457 path->nodes[*level] = NULL;
463 int walk_up_tree(struct ctree_root *root, struct ctree_path *path, int *level)
468 for(i = *level; i < MAX_LEVEL - 1 && path->nodes[i]; i++) {
469 slot = path->slots[i];
471 btrfs_header_nritems(&path->nodes[i]->node.header)- 1) {
476 ret = free_extent(root,
477 path->nodes[*level]->blocknr, 1);
478 tree_block_release(root, path->nodes[*level]);
479 path->nodes[*level] = NULL;
487 int btrfs_drop_snapshot(struct ctree_root *root, struct tree_buffer *snap)
491 struct ctree_path path;
497 level = btrfs_header_level(&snap->node.header);
499 path.nodes[level] = snap;
500 path.slots[level] = 0;
502 ret = walk_down_tree(root, &path, &level);
505 ret = walk_up_tree(root, &path, &level);
509 for (i = 0; i <= orig_level; i++) {
511 tree_block_release(root, path.nodes[i]);