Chris Mason | fec577f | 2007-02-26 10:40:21 -0500 | [diff] [blame] | 1 | #include <stdio.h> |
| 2 | #include <stdlib.h> |
| 3 | #include "kerncompat.h" |
| 4 | #include "radix-tree.h" |
| 5 | #include "ctree.h" |
| 6 | #include "disk-io.h" |
| 7 | #include "print-tree.h" |
| 8 | |
Chris Mason | 234b63a | 2007-03-13 10:46:10 -0400 | [diff] [blame] | 9 | static int find_free_extent(struct btrfs_root *orig_root, u64 num_blocks, |
Chris Mason | e2fa722 | 2007-03-12 16:22:34 -0400 | [diff] [blame] | 10 | u64 search_start, u64 search_end, |
| 11 | struct btrfs_key *ins); |
Chris Mason | 234b63a | 2007-03-13 10:46:10 -0400 | [diff] [blame] | 12 | static int finish_current_insert(struct btrfs_root *extent_root); |
| 13 | static int run_pending(struct btrfs_root *extent_root); |
Chris Mason | 037e639 | 2007-03-07 11:50:24 -0500 | [diff] [blame] | 14 | |
Chris Mason | fec577f | 2007-02-26 10:40:21 -0500 | [diff] [blame] | 15 | /* |
| 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 |
| 20 | * manner for deletes. |
| 21 | */ |
Chris Mason | 037e639 | 2007-03-07 11:50:24 -0500 | [diff] [blame] | 22 | #define CTREE_EXTENT_PENDING_DEL 0 |
Chris Mason | fec577f | 2007-02-26 10:40:21 -0500 | [diff] [blame] | 23 | |
Chris Mason | 234b63a | 2007-03-13 10:46:10 -0400 | [diff] [blame] | 24 | static int inc_block_ref(struct btrfs_root *root, u64 blocknr) |
Chris Mason | 02217ed | 2007-03-02 16:08:05 -0500 | [diff] [blame] | 25 | { |
Chris Mason | 234b63a | 2007-03-13 10:46:10 -0400 | [diff] [blame] | 26 | struct btrfs_path path; |
Chris Mason | 02217ed | 2007-03-02 16:08:05 -0500 | [diff] [blame] | 27 | int ret; |
Chris Mason | e2fa722 | 2007-03-12 16:22:34 -0400 | [diff] [blame] | 28 | struct btrfs_key key; |
Chris Mason | 234b63a | 2007-03-13 10:46:10 -0400 | [diff] [blame] | 29 | struct btrfs_leaf *l; |
| 30 | struct btrfs_extent_item *item; |
Chris Mason | e2fa722 | 2007-03-12 16:22:34 -0400 | [diff] [blame] | 31 | struct btrfs_key ins; |
Chris Mason | cf27e1e | 2007-03-13 09:49:06 -0400 | [diff] [blame] | 32 | u32 refs; |
Chris Mason | 037e639 | 2007-03-07 11:50:24 -0500 | [diff] [blame] | 33 | |
| 34 | find_free_extent(root->extent_root, 0, 0, (u64)-1, &ins); |
Chris Mason | 234b63a | 2007-03-13 10:46:10 -0400 | [diff] [blame] | 35 | btrfs_init_path(&path); |
Chris Mason | 02217ed | 2007-03-02 16:08:05 -0500 | [diff] [blame] | 36 | key.objectid = blocknr; |
| 37 | key.flags = 0; |
Chris Mason | 62e2749 | 2007-03-15 12:56:47 -0400 | [diff] [blame] | 38 | btrfs_set_key_type(&key, BTRFS_EXTENT_ITEM_KEY); |
Chris Mason | 02217ed | 2007-03-02 16:08:05 -0500 | [diff] [blame] | 39 | key.offset = 1; |
Chris Mason | 234b63a | 2007-03-13 10:46:10 -0400 | [diff] [blame] | 40 | ret = btrfs_search_slot(root->extent_root, &key, &path, 0, 1); |
Chris Mason | a28ec19 | 2007-03-06 20:08:01 -0500 | [diff] [blame] | 41 | if (ret != 0) |
| 42 | BUG(); |
Chris Mason | 02217ed | 2007-03-02 16:08:05 -0500 | [diff] [blame] | 43 | BUG_ON(ret != 0); |
| 44 | l = &path.nodes[0]->leaf; |
Chris Mason | 4beb1b8 | 2007-03-14 10:31:29 -0400 | [diff] [blame] | 45 | item = btrfs_item_ptr(l, path.slots[0], struct btrfs_extent_item); |
Chris Mason | cf27e1e | 2007-03-13 09:49:06 -0400 | [diff] [blame] | 46 | refs = btrfs_extent_refs(item); |
| 47 | btrfs_set_extent_refs(item, refs + 1); |
Chris Mason | a28ec19 | 2007-03-06 20:08:01 -0500 | [diff] [blame] | 48 | |
Chris Mason | 02217ed | 2007-03-02 16:08:05 -0500 | [diff] [blame] | 49 | BUG_ON(list_empty(&path.nodes[0]->dirty)); |
Chris Mason | 234b63a | 2007-03-13 10:46:10 -0400 | [diff] [blame] | 50 | btrfs_release_path(root->extent_root, &path); |
Chris Mason | 037e639 | 2007-03-07 11:50:24 -0500 | [diff] [blame] | 51 | finish_current_insert(root->extent_root); |
| 52 | run_pending(root->extent_root); |
Chris Mason | 02217ed | 2007-03-02 16:08:05 -0500 | [diff] [blame] | 53 | return 0; |
| 54 | } |
| 55 | |
Chris Mason | 234b63a | 2007-03-13 10:46:10 -0400 | [diff] [blame] | 56 | static int lookup_block_ref(struct btrfs_root *root, u64 blocknr, u32 *refs) |
Chris Mason | a28ec19 | 2007-03-06 20:08:01 -0500 | [diff] [blame] | 57 | { |
Chris Mason | 234b63a | 2007-03-13 10:46:10 -0400 | [diff] [blame] | 58 | struct btrfs_path path; |
Chris Mason | a28ec19 | 2007-03-06 20:08:01 -0500 | [diff] [blame] | 59 | int ret; |
Chris Mason | e2fa722 | 2007-03-12 16:22:34 -0400 | [diff] [blame] | 60 | struct btrfs_key key; |
Chris Mason | 234b63a | 2007-03-13 10:46:10 -0400 | [diff] [blame] | 61 | struct btrfs_leaf *l; |
| 62 | struct btrfs_extent_item *item; |
| 63 | btrfs_init_path(&path); |
Chris Mason | a28ec19 | 2007-03-06 20:08:01 -0500 | [diff] [blame] | 64 | key.objectid = blocknr; |
Chris Mason | a28ec19 | 2007-03-06 20:08:01 -0500 | [diff] [blame] | 65 | key.offset = 1; |
Chris Mason | 62e2749 | 2007-03-15 12:56:47 -0400 | [diff] [blame] | 66 | key.flags = 0; |
| 67 | btrfs_set_key_type(&key, BTRFS_EXTENT_ITEM_KEY); |
Chris Mason | 234b63a | 2007-03-13 10:46:10 -0400 | [diff] [blame] | 68 | ret = btrfs_search_slot(root->extent_root, &key, &path, 0, 0); |
Chris Mason | a28ec19 | 2007-03-06 20:08:01 -0500 | [diff] [blame] | 69 | if (ret != 0) |
| 70 | BUG(); |
| 71 | l = &path.nodes[0]->leaf; |
Chris Mason | 4beb1b8 | 2007-03-14 10:31:29 -0400 | [diff] [blame] | 72 | item = btrfs_item_ptr(l, path.slots[0], struct btrfs_extent_item); |
Chris Mason | cf27e1e | 2007-03-13 09:49:06 -0400 | [diff] [blame] | 73 | *refs = btrfs_extent_refs(item); |
Chris Mason | 234b63a | 2007-03-13 10:46:10 -0400 | [diff] [blame] | 74 | btrfs_release_path(root->extent_root, &path); |
Chris Mason | a28ec19 | 2007-03-06 20:08:01 -0500 | [diff] [blame] | 75 | return 0; |
| 76 | } |
| 77 | |
Chris Mason | 234b63a | 2007-03-13 10:46:10 -0400 | [diff] [blame] | 78 | int btrfs_inc_ref(struct btrfs_root *root, struct btrfs_buffer *buf) |
Chris Mason | 02217ed | 2007-03-02 16:08:05 -0500 | [diff] [blame] | 79 | { |
| 80 | u64 blocknr; |
| 81 | int i; |
Chris Mason | a28ec19 | 2007-03-06 20:08:01 -0500 | [diff] [blame] | 82 | |
Chris Mason | 3768f36 | 2007-03-13 16:47:54 -0400 | [diff] [blame] | 83 | if (!root->ref_cows) |
Chris Mason | a28ec19 | 2007-03-06 20:08:01 -0500 | [diff] [blame] | 84 | return 0; |
Chris Mason | 7518a23 | 2007-03-12 12:01:18 -0400 | [diff] [blame] | 85 | if (btrfs_is_leaf(&buf->node)) |
Chris Mason | a28ec19 | 2007-03-06 20:08:01 -0500 | [diff] [blame] | 86 | return 0; |
| 87 | |
Chris Mason | 7518a23 | 2007-03-12 12:01:18 -0400 | [diff] [blame] | 88 | for (i = 0; i < btrfs_header_nritems(&buf->node.header); i++) { |
Chris Mason | 1d4f8a0 | 2007-03-13 09:28:32 -0400 | [diff] [blame] | 89 | blocknr = btrfs_node_blockptr(&buf->node, i); |
Chris Mason | 02217ed | 2007-03-02 16:08:05 -0500 | [diff] [blame] | 90 | inc_block_ref(root, blocknr); |
| 91 | } |
| 92 | return 0; |
| 93 | } |
| 94 | |
Chris Mason | 234b63a | 2007-03-13 10:46:10 -0400 | [diff] [blame] | 95 | int btrfs_finish_extent_commit(struct btrfs_root *root) |
Chris Mason | a28ec19 | 2007-03-06 20:08:01 -0500 | [diff] [blame] | 96 | { |
Chris Mason | a28ec19 | 2007-03-06 20:08:01 -0500 | [diff] [blame] | 97 | unsigned long gang[8]; |
Chris Mason | 88fd146 | 2007-03-16 08:56:18 -0400 | [diff] [blame^] | 98 | u64 first = 0; |
Chris Mason | a28ec19 | 2007-03-06 20:08:01 -0500 | [diff] [blame] | 99 | int ret; |
| 100 | int i; |
| 101 | |
| 102 | while(1) { |
Chris Mason | 3768f36 | 2007-03-13 16:47:54 -0400 | [diff] [blame] | 103 | ret = radix_tree_gang_lookup(&root->pinned_radix, |
Chris Mason | a28ec19 | 2007-03-06 20:08:01 -0500 | [diff] [blame] | 104 | (void **)gang, 0, |
| 105 | ARRAY_SIZE(gang)); |
| 106 | if (!ret) |
| 107 | break; |
Chris Mason | 88fd146 | 2007-03-16 08:56:18 -0400 | [diff] [blame^] | 108 | if (!first) |
| 109 | first = gang[0]; |
Chris Mason | 0579da4 | 2007-03-07 16:15:30 -0500 | [diff] [blame] | 110 | for (i = 0; i < ret; i++) { |
Chris Mason | 3768f36 | 2007-03-13 16:47:54 -0400 | [diff] [blame] | 111 | radix_tree_delete(&root->pinned_radix, gang[i]); |
Chris Mason | 0579da4 | 2007-03-07 16:15:30 -0500 | [diff] [blame] | 112 | } |
Chris Mason | a28ec19 | 2007-03-06 20:08:01 -0500 | [diff] [blame] | 113 | } |
Chris Mason | 88fd146 | 2007-03-16 08:56:18 -0400 | [diff] [blame^] | 114 | root->last_insert.objectid = first; |
Chris Mason | 3768f36 | 2007-03-13 16:47:54 -0400 | [diff] [blame] | 115 | root->last_insert.offset = 0; |
Chris Mason | a28ec19 | 2007-03-06 20:08:01 -0500 | [diff] [blame] | 116 | return 0; |
| 117 | } |
| 118 | |
Chris Mason | 234b63a | 2007-03-13 10:46:10 -0400 | [diff] [blame] | 119 | static int finish_current_insert(struct btrfs_root *extent_root) |
Chris Mason | 037e639 | 2007-03-07 11:50:24 -0500 | [diff] [blame] | 120 | { |
Chris Mason | e2fa722 | 2007-03-12 16:22:34 -0400 | [diff] [blame] | 121 | struct btrfs_key ins; |
Chris Mason | 234b63a | 2007-03-13 10:46:10 -0400 | [diff] [blame] | 122 | struct btrfs_extent_item extent_item; |
Chris Mason | 037e639 | 2007-03-07 11:50:24 -0500 | [diff] [blame] | 123 | int i; |
| 124 | int ret; |
| 125 | |
Chris Mason | cf27e1e | 2007-03-13 09:49:06 -0400 | [diff] [blame] | 126 | btrfs_set_extent_refs(&extent_item, 1); |
| 127 | btrfs_set_extent_owner(&extent_item, |
| 128 | btrfs_header_parentid(&extent_root->node->node.header)); |
Chris Mason | 037e639 | 2007-03-07 11:50:24 -0500 | [diff] [blame] | 129 | ins.offset = 1; |
| 130 | ins.flags = 0; |
Chris Mason | 62e2749 | 2007-03-15 12:56:47 -0400 | [diff] [blame] | 131 | btrfs_set_key_type(&ins, BTRFS_EXTENT_ITEM_KEY); |
Chris Mason | 037e639 | 2007-03-07 11:50:24 -0500 | [diff] [blame] | 132 | |
| 133 | for (i = 0; i < extent_root->current_insert.flags; i++) { |
| 134 | ins.objectid = extent_root->current_insert.objectid + i; |
Chris Mason | 234b63a | 2007-03-13 10:46:10 -0400 | [diff] [blame] | 135 | ret = btrfs_insert_item(extent_root, &ins, &extent_item, |
Chris Mason | 037e639 | 2007-03-07 11:50:24 -0500 | [diff] [blame] | 136 | sizeof(extent_item)); |
| 137 | BUG_ON(ret); |
| 138 | } |
| 139 | extent_root->current_insert.offset = 0; |
| 140 | return 0; |
| 141 | } |
| 142 | |
Chris Mason | a28ec19 | 2007-03-06 20:08:01 -0500 | [diff] [blame] | 143 | /* |
| 144 | * remove an extent from the root, returns 0 on success |
| 145 | */ |
Chris Mason | 88fd146 | 2007-03-16 08:56:18 -0400 | [diff] [blame^] | 146 | static int __free_extent(struct btrfs_root *root, u64 blocknr, u64 num_blocks, |
| 147 | int pin) |
Chris Mason | a28ec19 | 2007-03-06 20:08:01 -0500 | [diff] [blame] | 148 | { |
Chris Mason | 234b63a | 2007-03-13 10:46:10 -0400 | [diff] [blame] | 149 | struct btrfs_path path; |
Chris Mason | e2fa722 | 2007-03-12 16:22:34 -0400 | [diff] [blame] | 150 | struct btrfs_key key; |
Chris Mason | 234b63a | 2007-03-13 10:46:10 -0400 | [diff] [blame] | 151 | struct btrfs_root *extent_root = root->extent_root; |
Chris Mason | a28ec19 | 2007-03-06 20:08:01 -0500 | [diff] [blame] | 152 | int ret; |
Chris Mason | 234b63a | 2007-03-13 10:46:10 -0400 | [diff] [blame] | 153 | struct btrfs_extent_item *ei; |
Chris Mason | e2fa722 | 2007-03-12 16:22:34 -0400 | [diff] [blame] | 154 | struct btrfs_key ins; |
Chris Mason | cf27e1e | 2007-03-13 09:49:06 -0400 | [diff] [blame] | 155 | u32 refs; |
Chris Mason | 037e639 | 2007-03-07 11:50:24 -0500 | [diff] [blame] | 156 | |
Chris Mason | 88fd146 | 2007-03-16 08:56:18 -0400 | [diff] [blame^] | 157 | BUG_ON(pin && num_blocks != 1); |
Chris Mason | a28ec19 | 2007-03-06 20:08:01 -0500 | [diff] [blame] | 158 | key.objectid = blocknr; |
| 159 | key.flags = 0; |
Chris Mason | 62e2749 | 2007-03-15 12:56:47 -0400 | [diff] [blame] | 160 | btrfs_set_key_type(&key, BTRFS_EXTENT_ITEM_KEY); |
Chris Mason | a28ec19 | 2007-03-06 20:08:01 -0500 | [diff] [blame] | 161 | key.offset = num_blocks; |
| 162 | |
Chris Mason | 037e639 | 2007-03-07 11:50:24 -0500 | [diff] [blame] | 163 | find_free_extent(root, 0, 0, (u64)-1, &ins); |
Chris Mason | 234b63a | 2007-03-13 10:46:10 -0400 | [diff] [blame] | 164 | btrfs_init_path(&path); |
| 165 | ret = btrfs_search_slot(extent_root, &key, &path, -1, 1); |
Chris Mason | a28ec19 | 2007-03-06 20:08:01 -0500 | [diff] [blame] | 166 | if (ret) { |
| 167 | printf("failed to find %Lu\n", key.objectid); |
Chris Mason | 234b63a | 2007-03-13 10:46:10 -0400 | [diff] [blame] | 168 | btrfs_print_tree(extent_root, extent_root->node); |
Chris Mason | a28ec19 | 2007-03-06 20:08:01 -0500 | [diff] [blame] | 169 | printf("failed to find %Lu\n", key.objectid); |
| 170 | BUG(); |
| 171 | } |
Chris Mason | 123abc8 | 2007-03-14 14:14:43 -0400 | [diff] [blame] | 172 | ei = btrfs_item_ptr(&path.nodes[0]->leaf, path.slots[0], |
| 173 | struct btrfs_extent_item); |
Chris Mason | a28ec19 | 2007-03-06 20:08:01 -0500 | [diff] [blame] | 174 | BUG_ON(ei->refs == 0); |
Chris Mason | cf27e1e | 2007-03-13 09:49:06 -0400 | [diff] [blame] | 175 | refs = btrfs_extent_refs(ei) - 1; |
| 176 | btrfs_set_extent_refs(ei, refs); |
| 177 | if (refs == 0) { |
Chris Mason | 88fd146 | 2007-03-16 08:56:18 -0400 | [diff] [blame^] | 178 | if (pin) { |
Chris Mason | a28ec19 | 2007-03-06 20:08:01 -0500 | [diff] [blame] | 179 | int err; |
| 180 | radix_tree_preload(GFP_KERNEL); |
| 181 | err = radix_tree_insert(&extent_root->pinned_radix, |
| 182 | blocknr, (void *)blocknr); |
| 183 | BUG_ON(err); |
| 184 | radix_tree_preload_end(); |
| 185 | } |
Chris Mason | 234b63a | 2007-03-13 10:46:10 -0400 | [diff] [blame] | 186 | ret = btrfs_del_item(extent_root, &path); |
Chris Mason | 88fd146 | 2007-03-16 08:56:18 -0400 | [diff] [blame^] | 187 | if (!pin && extent_root->last_insert.objectid > blocknr) |
Chris Mason | 0579da4 | 2007-03-07 16:15:30 -0500 | [diff] [blame] | 188 | extent_root->last_insert.objectid = blocknr; |
Chris Mason | a28ec19 | 2007-03-06 20:08:01 -0500 | [diff] [blame] | 189 | if (ret) |
| 190 | BUG(); |
| 191 | } |
Chris Mason | 234b63a | 2007-03-13 10:46:10 -0400 | [diff] [blame] | 192 | btrfs_release_path(extent_root, &path); |
Chris Mason | 037e639 | 2007-03-07 11:50:24 -0500 | [diff] [blame] | 193 | finish_current_insert(extent_root); |
Chris Mason | a28ec19 | 2007-03-06 20:08:01 -0500 | [diff] [blame] | 194 | return ret; |
| 195 | } |
| 196 | |
| 197 | /* |
Chris Mason | fec577f | 2007-02-26 10:40:21 -0500 | [diff] [blame] | 198 | * find all the blocks marked as pending in the radix tree and remove |
| 199 | * them from the extent map |
| 200 | */ |
Chris Mason | 234b63a | 2007-03-13 10:46:10 -0400 | [diff] [blame] | 201 | static int del_pending_extents(struct btrfs_root *extent_root) |
Chris Mason | fec577f | 2007-02-26 10:40:21 -0500 | [diff] [blame] | 202 | { |
| 203 | int ret; |
Chris Mason | 234b63a | 2007-03-13 10:46:10 -0400 | [diff] [blame] | 204 | struct btrfs_buffer *gang[4]; |
Chris Mason | fec577f | 2007-02-26 10:40:21 -0500 | [diff] [blame] | 205 | int i; |
Chris Mason | fec577f | 2007-02-26 10:40:21 -0500 | [diff] [blame] | 206 | |
| 207 | while(1) { |
| 208 | ret = radix_tree_gang_lookup_tag(&extent_root->cache_radix, |
| 209 | (void **)gang, 0, |
| 210 | ARRAY_SIZE(gang), |
Chris Mason | a28ec19 | 2007-03-06 20:08:01 -0500 | [diff] [blame] | 211 | CTREE_EXTENT_PENDING_DEL); |
Chris Mason | fec577f | 2007-02-26 10:40:21 -0500 | [diff] [blame] | 212 | if (!ret) |
| 213 | break; |
| 214 | for (i = 0; i < ret; i++) { |
Chris Mason | 88fd146 | 2007-03-16 08:56:18 -0400 | [diff] [blame^] | 215 | ret = __free_extent(extent_root, |
| 216 | gang[i]->blocknr, 1, 1); |
Chris Mason | fec577f | 2007-02-26 10:40:21 -0500 | [diff] [blame] | 217 | radix_tree_tag_clear(&extent_root->cache_radix, |
| 218 | gang[i]->blocknr, |
Chris Mason | a28ec19 | 2007-03-06 20:08:01 -0500 | [diff] [blame] | 219 | CTREE_EXTENT_PENDING_DEL); |
Chris Mason | 234b63a | 2007-03-13 10:46:10 -0400 | [diff] [blame] | 220 | btrfs_block_release(extent_root, gang[i]); |
Chris Mason | fec577f | 2007-02-26 10:40:21 -0500 | [diff] [blame] | 221 | } |
| 222 | } |
| 223 | return 0; |
| 224 | } |
| 225 | |
Chris Mason | 234b63a | 2007-03-13 10:46:10 -0400 | [diff] [blame] | 226 | static int run_pending(struct btrfs_root *extent_root) |
Chris Mason | a28ec19 | 2007-03-06 20:08:01 -0500 | [diff] [blame] | 227 | { |
| 228 | while(radix_tree_tagged(&extent_root->cache_radix, |
Chris Mason | 037e639 | 2007-03-07 11:50:24 -0500 | [diff] [blame] | 229 | CTREE_EXTENT_PENDING_DEL)) |
Chris Mason | a28ec19 | 2007-03-06 20:08:01 -0500 | [diff] [blame] | 230 | del_pending_extents(extent_root); |
Chris Mason | a28ec19 | 2007-03-06 20:08:01 -0500 | [diff] [blame] | 231 | return 0; |
| 232 | } |
| 233 | |
| 234 | |
Chris Mason | fec577f | 2007-02-26 10:40:21 -0500 | [diff] [blame] | 235 | /* |
| 236 | * remove an extent from the root, returns 0 on success |
| 237 | */ |
Chris Mason | 88fd146 | 2007-03-16 08:56:18 -0400 | [diff] [blame^] | 238 | int btrfs_free_extent(struct btrfs_root *root, u64 blocknr, u64 num_blocks, |
| 239 | int pin) |
Chris Mason | fec577f | 2007-02-26 10:40:21 -0500 | [diff] [blame] | 240 | { |
Chris Mason | 234b63a | 2007-03-13 10:46:10 -0400 | [diff] [blame] | 241 | struct btrfs_root *extent_root = root->extent_root; |
| 242 | struct btrfs_buffer *t; |
Chris Mason | fec577f | 2007-02-26 10:40:21 -0500 | [diff] [blame] | 243 | int pending_ret; |
| 244 | int ret; |
Chris Mason | a28ec19 | 2007-03-06 20:08:01 -0500 | [diff] [blame] | 245 | |
| 246 | if (root == extent_root) { |
| 247 | t = find_tree_block(root, blocknr); |
Chris Mason | 037e639 | 2007-03-07 11:50:24 -0500 | [diff] [blame] | 248 | radix_tree_tag_set(&root->cache_radix, blocknr, |
Chris Mason | a28ec19 | 2007-03-06 20:08:01 -0500 | [diff] [blame] | 249 | CTREE_EXTENT_PENDING_DEL); |
Chris Mason | a28ec19 | 2007-03-06 20:08:01 -0500 | [diff] [blame] | 250 | return 0; |
| 251 | } |
Chris Mason | 88fd146 | 2007-03-16 08:56:18 -0400 | [diff] [blame^] | 252 | ret = __free_extent(root, blocknr, num_blocks, pin); |
Chris Mason | a28ec19 | 2007-03-06 20:08:01 -0500 | [diff] [blame] | 253 | pending_ret = run_pending(root->extent_root); |
Chris Mason | fec577f | 2007-02-26 10:40:21 -0500 | [diff] [blame] | 254 | return ret ? ret : pending_ret; |
| 255 | } |
| 256 | |
| 257 | /* |
| 258 | * walks the btree of allocated extents and find a hole of a given size. |
| 259 | * The key ins is changed to record the hole: |
| 260 | * ins->objectid == block start |
Chris Mason | 62e2749 | 2007-03-15 12:56:47 -0400 | [diff] [blame] | 261 | * ins->flags = BTRFS_EXTENT_ITEM_KEY |
Chris Mason | fec577f | 2007-02-26 10:40:21 -0500 | [diff] [blame] | 262 | * ins->offset == number of blocks |
| 263 | * Any available blocks before search_start are skipped. |
| 264 | */ |
Chris Mason | 234b63a | 2007-03-13 10:46:10 -0400 | [diff] [blame] | 265 | static int find_free_extent(struct btrfs_root *orig_root, u64 num_blocks, |
Chris Mason | e2fa722 | 2007-03-12 16:22:34 -0400 | [diff] [blame] | 266 | u64 search_start, u64 search_end, |
| 267 | struct btrfs_key *ins) |
Chris Mason | fec577f | 2007-02-26 10:40:21 -0500 | [diff] [blame] | 268 | { |
Chris Mason | 234b63a | 2007-03-13 10:46:10 -0400 | [diff] [blame] | 269 | struct btrfs_path path; |
Chris Mason | e2fa722 | 2007-03-12 16:22:34 -0400 | [diff] [blame] | 270 | struct btrfs_key key; |
Chris Mason | fec577f | 2007-02-26 10:40:21 -0500 | [diff] [blame] | 271 | int ret; |
| 272 | u64 hole_size = 0; |
| 273 | int slot = 0; |
| 274 | u64 last_block; |
Chris Mason | 037e639 | 2007-03-07 11:50:24 -0500 | [diff] [blame] | 275 | u64 test_block; |
Chris Mason | fec577f | 2007-02-26 10:40:21 -0500 | [diff] [blame] | 276 | int start_found; |
Chris Mason | 234b63a | 2007-03-13 10:46:10 -0400 | [diff] [blame] | 277 | struct btrfs_leaf *l; |
| 278 | struct btrfs_root * root = orig_root->extent_root; |
Chris Mason | 0579da4 | 2007-03-07 16:15:30 -0500 | [diff] [blame] | 279 | int total_needed = num_blocks; |
Chris Mason | fec577f | 2007-02-26 10:40:21 -0500 | [diff] [blame] | 280 | |
Chris Mason | 7518a23 | 2007-03-12 12:01:18 -0400 | [diff] [blame] | 281 | total_needed += (btrfs_header_level(&root->node->node.header) + 1) * 3; |
Chris Mason | 0579da4 | 2007-03-07 16:15:30 -0500 | [diff] [blame] | 282 | if (root->last_insert.objectid > search_start) |
| 283 | search_start = root->last_insert.objectid; |
Chris Mason | 62e2749 | 2007-03-15 12:56:47 -0400 | [diff] [blame] | 284 | |
| 285 | ins->flags = 0; |
| 286 | btrfs_set_key_type(ins, BTRFS_EXTENT_ITEM_KEY); |
| 287 | |
Chris Mason | fec577f | 2007-02-26 10:40:21 -0500 | [diff] [blame] | 288 | check_failed: |
Chris Mason | 234b63a | 2007-03-13 10:46:10 -0400 | [diff] [blame] | 289 | btrfs_init_path(&path); |
Chris Mason | fec577f | 2007-02-26 10:40:21 -0500 | [diff] [blame] | 290 | ins->objectid = search_start; |
| 291 | ins->offset = 0; |
Chris Mason | fec577f | 2007-02-26 10:40:21 -0500 | [diff] [blame] | 292 | start_found = 0; |
Chris Mason | 234b63a | 2007-03-13 10:46:10 -0400 | [diff] [blame] | 293 | ret = btrfs_search_slot(root, ins, &path, 0, 0); |
Chris Mason | 0f70abe | 2007-02-28 16:46:22 -0500 | [diff] [blame] | 294 | if (ret < 0) |
| 295 | goto error; |
Chris Mason | aa5d6be | 2007-02-28 16:35:06 -0500 | [diff] [blame] | 296 | |
Chris Mason | 0579da4 | 2007-03-07 16:15:30 -0500 | [diff] [blame] | 297 | if (path.slots[0] > 0) |
| 298 | path.slots[0]--; |
| 299 | |
Chris Mason | fec577f | 2007-02-26 10:40:21 -0500 | [diff] [blame] | 300 | while (1) { |
| 301 | l = &path.nodes[0]->leaf; |
| 302 | slot = path.slots[0]; |
Chris Mason | 7518a23 | 2007-03-12 12:01:18 -0400 | [diff] [blame] | 303 | if (slot >= btrfs_header_nritems(&l->header)) { |
Chris Mason | 234b63a | 2007-03-13 10:46:10 -0400 | [diff] [blame] | 304 | ret = btrfs_next_leaf(root, &path); |
Chris Mason | fec577f | 2007-02-26 10:40:21 -0500 | [diff] [blame] | 305 | if (ret == 0) |
| 306 | continue; |
Chris Mason | 0f70abe | 2007-02-28 16:46:22 -0500 | [diff] [blame] | 307 | if (ret < 0) |
| 308 | goto error; |
Chris Mason | fec577f | 2007-02-26 10:40:21 -0500 | [diff] [blame] | 309 | if (!start_found) { |
| 310 | ins->objectid = search_start; |
Chris Mason | 037e639 | 2007-03-07 11:50:24 -0500 | [diff] [blame] | 311 | ins->offset = (u64)-1; |
Chris Mason | fec577f | 2007-02-26 10:40:21 -0500 | [diff] [blame] | 312 | start_found = 1; |
| 313 | goto check_pending; |
| 314 | } |
| 315 | ins->objectid = last_block > search_start ? |
| 316 | last_block : search_start; |
Chris Mason | 037e639 | 2007-03-07 11:50:24 -0500 | [diff] [blame] | 317 | ins->offset = (u64)-1; |
Chris Mason | fec577f | 2007-02-26 10:40:21 -0500 | [diff] [blame] | 318 | goto check_pending; |
| 319 | } |
Chris Mason | e2fa722 | 2007-03-12 16:22:34 -0400 | [diff] [blame] | 320 | btrfs_disk_key_to_cpu(&key, &l->items[slot].key); |
| 321 | if (key.objectid >= search_start) { |
Chris Mason | fec577f | 2007-02-26 10:40:21 -0500 | [diff] [blame] | 322 | if (start_found) { |
Chris Mason | 0579da4 | 2007-03-07 16:15:30 -0500 | [diff] [blame] | 323 | if (last_block < search_start) |
| 324 | last_block = search_start; |
Chris Mason | e2fa722 | 2007-03-12 16:22:34 -0400 | [diff] [blame] | 325 | hole_size = key.objectid - last_block; |
Chris Mason | 037e639 | 2007-03-07 11:50:24 -0500 | [diff] [blame] | 326 | if (hole_size > total_needed) { |
Chris Mason | fec577f | 2007-02-26 10:40:21 -0500 | [diff] [blame] | 327 | ins->objectid = last_block; |
Chris Mason | 037e639 | 2007-03-07 11:50:24 -0500 | [diff] [blame] | 328 | ins->offset = hole_size; |
Chris Mason | fec577f | 2007-02-26 10:40:21 -0500 | [diff] [blame] | 329 | goto check_pending; |
| 330 | } |
Chris Mason | 0579da4 | 2007-03-07 16:15:30 -0500 | [diff] [blame] | 331 | } |
Chris Mason | fec577f | 2007-02-26 10:40:21 -0500 | [diff] [blame] | 332 | } |
Chris Mason | 0579da4 | 2007-03-07 16:15:30 -0500 | [diff] [blame] | 333 | start_found = 1; |
Chris Mason | e2fa722 | 2007-03-12 16:22:34 -0400 | [diff] [blame] | 334 | last_block = key.objectid + key.offset; |
Chris Mason | fec577f | 2007-02-26 10:40:21 -0500 | [diff] [blame] | 335 | path.slots[0]++; |
| 336 | } |
| 337 | // FIXME -ENOSPC |
| 338 | check_pending: |
| 339 | /* we have to make sure we didn't find an extent that has already |
| 340 | * been allocated by the map tree or the original allocation |
| 341 | */ |
Chris Mason | 234b63a | 2007-03-13 10:46:10 -0400 | [diff] [blame] | 342 | btrfs_release_path(root, &path); |
Chris Mason | fec577f | 2007-02-26 10:40:21 -0500 | [diff] [blame] | 343 | BUG_ON(ins->objectid < search_start); |
Chris Mason | 037e639 | 2007-03-07 11:50:24 -0500 | [diff] [blame] | 344 | for (test_block = ins->objectid; |
| 345 | test_block < ins->objectid + total_needed; test_block++) { |
| 346 | if (radix_tree_lookup(&root->pinned_radix, test_block)) { |
| 347 | search_start = test_block + 1; |
Chris Mason | fec577f | 2007-02-26 10:40:21 -0500 | [diff] [blame] | 348 | goto check_failed; |
| 349 | } |
| 350 | } |
Chris Mason | 037e639 | 2007-03-07 11:50:24 -0500 | [diff] [blame] | 351 | BUG_ON(root->current_insert.offset); |
Chris Mason | 0579da4 | 2007-03-07 16:15:30 -0500 | [diff] [blame] | 352 | root->current_insert.offset = total_needed - num_blocks; |
Chris Mason | 037e639 | 2007-03-07 11:50:24 -0500 | [diff] [blame] | 353 | root->current_insert.objectid = ins->objectid + num_blocks; |
| 354 | root->current_insert.flags = 0; |
Chris Mason | 0579da4 | 2007-03-07 16:15:30 -0500 | [diff] [blame] | 355 | root->last_insert.objectid = ins->objectid; |
Chris Mason | 037e639 | 2007-03-07 11:50:24 -0500 | [diff] [blame] | 356 | ins->offset = num_blocks; |
Chris Mason | fec577f | 2007-02-26 10:40:21 -0500 | [diff] [blame] | 357 | return 0; |
Chris Mason | 0f70abe | 2007-02-28 16:46:22 -0500 | [diff] [blame] | 358 | error: |
Chris Mason | 234b63a | 2007-03-13 10:46:10 -0400 | [diff] [blame] | 359 | btrfs_release_path(root, &path); |
Chris Mason | 0f70abe | 2007-02-28 16:46:22 -0500 | [diff] [blame] | 360 | return ret; |
Chris Mason | fec577f | 2007-02-26 10:40:21 -0500 | [diff] [blame] | 361 | } |
| 362 | |
| 363 | /* |
Chris Mason | fec577f | 2007-02-26 10:40:21 -0500 | [diff] [blame] | 364 | * finds a free extent and does all the dirty work required for allocation |
| 365 | * returns the key for the extent through ins, and a tree buffer for |
| 366 | * the first block of the extent through buf. |
| 367 | * |
| 368 | * returns 0 if everything worked, non-zero otherwise. |
| 369 | */ |
Chris Mason | 9aca1d5 | 2007-03-13 11:09:37 -0400 | [diff] [blame] | 370 | static int alloc_extent(struct btrfs_root *root, u64 num_blocks, |
| 371 | u64 search_start, u64 search_end, u64 owner, |
| 372 | struct btrfs_key *ins) |
Chris Mason | fec577f | 2007-02-26 10:40:21 -0500 | [diff] [blame] | 373 | { |
| 374 | int ret; |
| 375 | int pending_ret; |
Chris Mason | 234b63a | 2007-03-13 10:46:10 -0400 | [diff] [blame] | 376 | struct btrfs_root *extent_root = root->extent_root; |
| 377 | struct btrfs_extent_item extent_item; |
Chris Mason | 037e639 | 2007-03-07 11:50:24 -0500 | [diff] [blame] | 378 | |
Chris Mason | cf27e1e | 2007-03-13 09:49:06 -0400 | [diff] [blame] | 379 | btrfs_set_extent_refs(&extent_item, 1); |
| 380 | btrfs_set_extent_owner(&extent_item, owner); |
Chris Mason | fec577f | 2007-02-26 10:40:21 -0500 | [diff] [blame] | 381 | |
Chris Mason | 037e639 | 2007-03-07 11:50:24 -0500 | [diff] [blame] | 382 | if (root == extent_root) { |
| 383 | BUG_ON(extent_root->current_insert.offset == 0); |
| 384 | BUG_ON(num_blocks != 1); |
| 385 | BUG_ON(extent_root->current_insert.flags == |
| 386 | extent_root->current_insert.offset); |
| 387 | ins->offset = 1; |
| 388 | ins->objectid = extent_root->current_insert.objectid + |
| 389 | extent_root->current_insert.flags++; |
Chris Mason | fec577f | 2007-02-26 10:40:21 -0500 | [diff] [blame] | 390 | return 0; |
| 391 | } |
Chris Mason | 037e639 | 2007-03-07 11:50:24 -0500 | [diff] [blame] | 392 | ret = find_free_extent(root, num_blocks, search_start, |
| 393 | search_end, ins); |
| 394 | if (ret) |
| 395 | return ret; |
Chris Mason | fec577f | 2007-02-26 10:40:21 -0500 | [diff] [blame] | 396 | |
Chris Mason | 234b63a | 2007-03-13 10:46:10 -0400 | [diff] [blame] | 397 | ret = btrfs_insert_item(extent_root, ins, &extent_item, |
Chris Mason | 037e639 | 2007-03-07 11:50:24 -0500 | [diff] [blame] | 398 | sizeof(extent_item)); |
| 399 | |
| 400 | finish_current_insert(extent_root); |
| 401 | pending_ret = run_pending(extent_root); |
| 402 | if (ret) |
| 403 | return ret; |
| 404 | if (pending_ret) |
| 405 | return pending_ret; |
| 406 | return 0; |
Chris Mason | fec577f | 2007-02-26 10:40:21 -0500 | [diff] [blame] | 407 | } |
| 408 | |
| 409 | /* |
| 410 | * helper function to allocate a block for a given tree |
| 411 | * returns the tree buffer or NULL. |
| 412 | */ |
Chris Mason | 234b63a | 2007-03-13 10:46:10 -0400 | [diff] [blame] | 413 | struct btrfs_buffer *btrfs_alloc_free_block(struct btrfs_root *root) |
Chris Mason | fec577f | 2007-02-26 10:40:21 -0500 | [diff] [blame] | 414 | { |
Chris Mason | e2fa722 | 2007-03-12 16:22:34 -0400 | [diff] [blame] | 415 | struct btrfs_key ins; |
Chris Mason | fec577f | 2007-02-26 10:40:21 -0500 | [diff] [blame] | 416 | int ret; |
Chris Mason | 234b63a | 2007-03-13 10:46:10 -0400 | [diff] [blame] | 417 | struct btrfs_buffer *buf; |
Chris Mason | fec577f | 2007-02-26 10:40:21 -0500 | [diff] [blame] | 418 | |
| 419 | ret = alloc_extent(root, 1, 0, (unsigned long)-1, |
Chris Mason | 7518a23 | 2007-03-12 12:01:18 -0400 | [diff] [blame] | 420 | btrfs_header_parentid(&root->node->node.header), |
Chris Mason | 037e639 | 2007-03-07 11:50:24 -0500 | [diff] [blame] | 421 | &ins); |
Chris Mason | fec577f | 2007-02-26 10:40:21 -0500 | [diff] [blame] | 422 | if (ret) { |
| 423 | BUG(); |
| 424 | return NULL; |
| 425 | } |
Chris Mason | 037e639 | 2007-03-07 11:50:24 -0500 | [diff] [blame] | 426 | buf = find_tree_block(root, ins.objectid); |
| 427 | dirty_tree_block(root, buf); |
Chris Mason | fec577f | 2007-02-26 10:40:21 -0500 | [diff] [blame] | 428 | return buf; |
| 429 | } |
Chris Mason | a28ec19 | 2007-03-06 20:08:01 -0500 | [diff] [blame] | 430 | |
Chris Mason | 9aca1d5 | 2007-03-13 11:09:37 -0400 | [diff] [blame] | 431 | /* |
| 432 | * helper function for drop_snapshot, this walks down the tree dropping ref |
| 433 | * counts as it goes. |
| 434 | */ |
| 435 | static int walk_down_tree(struct btrfs_root *root, |
| 436 | struct btrfs_path *path, int *level) |
Chris Mason | 20524f0 | 2007-03-10 06:35:47 -0500 | [diff] [blame] | 437 | { |
Chris Mason | 234b63a | 2007-03-13 10:46:10 -0400 | [diff] [blame] | 438 | struct btrfs_buffer *next; |
| 439 | struct btrfs_buffer *cur; |
Chris Mason | 20524f0 | 2007-03-10 06:35:47 -0500 | [diff] [blame] | 440 | u64 blocknr; |
| 441 | int ret; |
| 442 | u32 refs; |
| 443 | |
| 444 | ret = lookup_block_ref(root, path->nodes[*level]->blocknr, &refs); |
| 445 | BUG_ON(ret); |
| 446 | if (refs > 1) |
| 447 | goto out; |
Chris Mason | 9aca1d5 | 2007-03-13 11:09:37 -0400 | [diff] [blame] | 448 | /* |
| 449 | * walk down to the last node level and free all the leaves |
| 450 | */ |
Chris Mason | 20524f0 | 2007-03-10 06:35:47 -0500 | [diff] [blame] | 451 | while(*level > 0) { |
| 452 | cur = path->nodes[*level]; |
Chris Mason | 7518a23 | 2007-03-12 12:01:18 -0400 | [diff] [blame] | 453 | if (path->slots[*level] >= |
| 454 | btrfs_header_nritems(&cur->node.header)) |
Chris Mason | 20524f0 | 2007-03-10 06:35:47 -0500 | [diff] [blame] | 455 | break; |
Chris Mason | 1d4f8a0 | 2007-03-13 09:28:32 -0400 | [diff] [blame] | 456 | blocknr = btrfs_node_blockptr(&cur->node, path->slots[*level]); |
Chris Mason | 20524f0 | 2007-03-10 06:35:47 -0500 | [diff] [blame] | 457 | ret = lookup_block_ref(root, blocknr, &refs); |
| 458 | if (refs != 1 || *level == 1) { |
| 459 | path->slots[*level]++; |
Chris Mason | 88fd146 | 2007-03-16 08:56:18 -0400 | [diff] [blame^] | 460 | ret = btrfs_free_extent(root, blocknr, 1, 1); |
Chris Mason | 20524f0 | 2007-03-10 06:35:47 -0500 | [diff] [blame] | 461 | BUG_ON(ret); |
| 462 | continue; |
| 463 | } |
| 464 | BUG_ON(ret); |
| 465 | next = read_tree_block(root, blocknr); |
Chris Mason | 83e15a2 | 2007-03-12 09:03:27 -0400 | [diff] [blame] | 466 | if (path->nodes[*level-1]) |
Chris Mason | 234b63a | 2007-03-13 10:46:10 -0400 | [diff] [blame] | 467 | btrfs_block_release(root, path->nodes[*level-1]); |
Chris Mason | 20524f0 | 2007-03-10 06:35:47 -0500 | [diff] [blame] | 468 | path->nodes[*level-1] = next; |
Chris Mason | 7518a23 | 2007-03-12 12:01:18 -0400 | [diff] [blame] | 469 | *level = btrfs_header_level(&next->node.header); |
Chris Mason | 20524f0 | 2007-03-10 06:35:47 -0500 | [diff] [blame] | 470 | path->slots[*level] = 0; |
| 471 | } |
| 472 | out: |
Chris Mason | 88fd146 | 2007-03-16 08:56:18 -0400 | [diff] [blame^] | 473 | ret = btrfs_free_extent(root, path->nodes[*level]->blocknr, 1, 1); |
Chris Mason | 234b63a | 2007-03-13 10:46:10 -0400 | [diff] [blame] | 474 | btrfs_block_release(root, path->nodes[*level]); |
Chris Mason | 20524f0 | 2007-03-10 06:35:47 -0500 | [diff] [blame] | 475 | path->nodes[*level] = NULL; |
| 476 | *level += 1; |
| 477 | BUG_ON(ret); |
| 478 | return 0; |
| 479 | } |
| 480 | |
Chris Mason | 9aca1d5 | 2007-03-13 11:09:37 -0400 | [diff] [blame] | 481 | /* |
| 482 | * helper for dropping snapshots. This walks back up the tree in the path |
| 483 | * to find the first node higher up where we haven't yet gone through |
| 484 | * all the slots |
| 485 | */ |
| 486 | static int walk_up_tree(struct btrfs_root *root, struct btrfs_path *path, |
| 487 | int *level) |
Chris Mason | 20524f0 | 2007-03-10 06:35:47 -0500 | [diff] [blame] | 488 | { |
| 489 | int i; |
| 490 | int slot; |
| 491 | int ret; |
Chris Mason | 234b63a | 2007-03-13 10:46:10 -0400 | [diff] [blame] | 492 | for(i = *level; i < BTRFS_MAX_LEVEL - 1 && path->nodes[i]; i++) { |
Chris Mason | 20524f0 | 2007-03-10 06:35:47 -0500 | [diff] [blame] | 493 | slot = path->slots[i]; |
Chris Mason | 7518a23 | 2007-03-12 12:01:18 -0400 | [diff] [blame] | 494 | if (slot < |
| 495 | btrfs_header_nritems(&path->nodes[i]->node.header)- 1) { |
Chris Mason | 20524f0 | 2007-03-10 06:35:47 -0500 | [diff] [blame] | 496 | path->slots[i]++; |
| 497 | *level = i; |
| 498 | return 0; |
| 499 | } else { |
Chris Mason | 234b63a | 2007-03-13 10:46:10 -0400 | [diff] [blame] | 500 | ret = btrfs_free_extent(root, |
Chris Mason | 88fd146 | 2007-03-16 08:56:18 -0400 | [diff] [blame^] | 501 | path->nodes[*level]->blocknr, 1, 1); |
Chris Mason | 234b63a | 2007-03-13 10:46:10 -0400 | [diff] [blame] | 502 | btrfs_block_release(root, path->nodes[*level]); |
Chris Mason | 83e15a2 | 2007-03-12 09:03:27 -0400 | [diff] [blame] | 503 | path->nodes[*level] = NULL; |
Chris Mason | 20524f0 | 2007-03-10 06:35:47 -0500 | [diff] [blame] | 504 | *level = i + 1; |
| 505 | BUG_ON(ret); |
| 506 | } |
| 507 | } |
| 508 | return 1; |
| 509 | } |
| 510 | |
Chris Mason | 9aca1d5 | 2007-03-13 11:09:37 -0400 | [diff] [blame] | 511 | /* |
| 512 | * drop the reference count on the tree rooted at 'snap'. This traverses |
| 513 | * the tree freeing any blocks that have a ref count of zero after being |
| 514 | * decremented. |
| 515 | */ |
Chris Mason | 234b63a | 2007-03-13 10:46:10 -0400 | [diff] [blame] | 516 | int btrfs_drop_snapshot(struct btrfs_root *root, struct btrfs_buffer *snap) |
Chris Mason | 20524f0 | 2007-03-10 06:35:47 -0500 | [diff] [blame] | 517 | { |
Chris Mason | 3768f36 | 2007-03-13 16:47:54 -0400 | [diff] [blame] | 518 | int ret = 0; |
Chris Mason | 9aca1d5 | 2007-03-13 11:09:37 -0400 | [diff] [blame] | 519 | int wret; |
Chris Mason | 20524f0 | 2007-03-10 06:35:47 -0500 | [diff] [blame] | 520 | int level; |
Chris Mason | 234b63a | 2007-03-13 10:46:10 -0400 | [diff] [blame] | 521 | struct btrfs_path path; |
Chris Mason | 20524f0 | 2007-03-10 06:35:47 -0500 | [diff] [blame] | 522 | int i; |
| 523 | int orig_level; |
| 524 | |
Chris Mason | 234b63a | 2007-03-13 10:46:10 -0400 | [diff] [blame] | 525 | btrfs_init_path(&path); |
Chris Mason | 20524f0 | 2007-03-10 06:35:47 -0500 | [diff] [blame] | 526 | |
Chris Mason | 7518a23 | 2007-03-12 12:01:18 -0400 | [diff] [blame] | 527 | level = btrfs_header_level(&snap->node.header); |
Chris Mason | 20524f0 | 2007-03-10 06:35:47 -0500 | [diff] [blame] | 528 | orig_level = level; |
| 529 | path.nodes[level] = snap; |
| 530 | path.slots[level] = 0; |
| 531 | while(1) { |
Chris Mason | 9aca1d5 | 2007-03-13 11:09:37 -0400 | [diff] [blame] | 532 | wret = walk_down_tree(root, &path, &level); |
| 533 | if (wret > 0) |
Chris Mason | 20524f0 | 2007-03-10 06:35:47 -0500 | [diff] [blame] | 534 | break; |
Chris Mason | 9aca1d5 | 2007-03-13 11:09:37 -0400 | [diff] [blame] | 535 | if (wret < 0) |
| 536 | ret = wret; |
| 537 | |
| 538 | wret = walk_up_tree(root, &path, &level); |
| 539 | if (wret > 0) |
Chris Mason | 20524f0 | 2007-03-10 06:35:47 -0500 | [diff] [blame] | 540 | break; |
Chris Mason | 9aca1d5 | 2007-03-13 11:09:37 -0400 | [diff] [blame] | 541 | if (wret < 0) |
| 542 | ret = wret; |
Chris Mason | 20524f0 | 2007-03-10 06:35:47 -0500 | [diff] [blame] | 543 | } |
Chris Mason | 83e15a2 | 2007-03-12 09:03:27 -0400 | [diff] [blame] | 544 | for (i = 0; i <= orig_level; i++) { |
| 545 | if (path.nodes[i]) { |
Chris Mason | 234b63a | 2007-03-13 10:46:10 -0400 | [diff] [blame] | 546 | btrfs_block_release(root, path.nodes[i]); |
Chris Mason | 83e15a2 | 2007-03-12 09:03:27 -0400 | [diff] [blame] | 547 | } |
Chris Mason | 20524f0 | 2007-03-10 06:35:47 -0500 | [diff] [blame] | 548 | } |
Chris Mason | 9aca1d5 | 2007-03-13 11:09:37 -0400 | [diff] [blame] | 549 | return ret; |
Chris Mason | 20524f0 | 2007-03-10 06:35:47 -0500 | [diff] [blame] | 550 | } |