Chris Mason | 6cbd557 | 2007-06-12 09:07:21 -0400 | [diff] [blame] | 1 | /* |
| 2 | * Copyright (C) 2007 Oracle. All rights reserved. |
| 3 | * |
| 4 | * This program is free software; you can redistribute it and/or |
| 5 | * modify it under the terms of the GNU General Public |
| 6 | * License v2 as published by the Free Software Foundation. |
| 7 | * |
| 8 | * This program is distributed in the hope that it will be useful, |
| 9 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
| 10 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU |
| 11 | * General Public License for more details. |
| 12 | * |
| 13 | * You should have received a copy of the GNU General Public |
| 14 | * License along with this program; if not, write to the |
| 15 | * Free Software Foundation, Inc., 59 Temple Place - Suite 330, |
| 16 | * Boston, MA 021110-1307, USA. |
| 17 | */ |
| 18 | |
Chris Mason | 3768f36 | 2007-03-13 16:47:54 -0400 | [diff] [blame] | 19 | #include "ctree.h" |
Chris Mason | 5eda7b5 | 2007-06-22 14:16:25 -0400 | [diff] [blame] | 20 | #include "transaction.h" |
Chris Mason | 3768f36 | 2007-03-13 16:47:54 -0400 | [diff] [blame] | 21 | #include "disk-io.h" |
| 22 | #include "print-tree.h" |
| 23 | |
Chris Mason | bf4ef67 | 2008-05-08 13:26:18 -0400 | [diff] [blame] | 24 | /* |
Chris Mason | d352ac6 | 2008-09-29 15:18:18 -0400 | [diff] [blame] | 25 | * search forward for a root, starting with objectid 'search_start' |
| 26 | * if a root key is found, the objectid we find is filled into 'found_objectid' |
| 27 | * and 0 is returned. < 0 is returned on error, 1 if there is nothing |
| 28 | * left in the tree. |
Chris Mason | bf4ef67 | 2008-05-08 13:26:18 -0400 | [diff] [blame] | 29 | */ |
| 30 | int btrfs_search_root(struct btrfs_root *root, u64 search_start, |
| 31 | u64 *found_objectid) |
| 32 | { |
| 33 | struct btrfs_path *path; |
| 34 | struct btrfs_key search_key; |
| 35 | int ret; |
| 36 | |
| 37 | root = root->fs_info->tree_root; |
| 38 | search_key.objectid = search_start; |
| 39 | search_key.type = (u8)-1; |
| 40 | search_key.offset = (u64)-1; |
| 41 | |
| 42 | path = btrfs_alloc_path(); |
| 43 | BUG_ON(!path); |
| 44 | again: |
| 45 | ret = btrfs_search_slot(NULL, root, &search_key, path, 0, 0); |
| 46 | if (ret < 0) |
| 47 | goto out; |
| 48 | if (ret == 0) { |
| 49 | ret = 1; |
| 50 | goto out; |
| 51 | } |
| 52 | if (path->slots[0] >= btrfs_header_nritems(path->nodes[0])) { |
| 53 | ret = btrfs_next_leaf(root, path); |
| 54 | if (ret) |
| 55 | goto out; |
| 56 | } |
| 57 | btrfs_item_key_to_cpu(path->nodes[0], &search_key, path->slots[0]); |
| 58 | if (search_key.type != BTRFS_ROOT_ITEM_KEY) { |
| 59 | search_key.offset++; |
| 60 | btrfs_release_path(root, path); |
| 61 | goto again; |
| 62 | } |
| 63 | ret = 0; |
| 64 | *found_objectid = search_key.objectid; |
| 65 | |
| 66 | out: |
| 67 | btrfs_free_path(path); |
| 68 | return ret; |
| 69 | } |
| 70 | |
Chris Mason | d352ac6 | 2008-09-29 15:18:18 -0400 | [diff] [blame] | 71 | /* |
| 72 | * lookup the root with the highest offset for a given objectid. The key we do |
| 73 | * find is copied into 'key'. If we find something return 0, otherwise 1, < 0 |
| 74 | * on error. |
| 75 | */ |
Chris Mason | 3768f36 | 2007-03-13 16:47:54 -0400 | [diff] [blame] | 76 | int btrfs_find_last_root(struct btrfs_root *root, u64 objectid, |
| 77 | struct btrfs_root_item *item, struct btrfs_key *key) |
| 78 | { |
Chris Mason | 5caf2a0 | 2007-04-02 11:20:42 -0400 | [diff] [blame] | 79 | struct btrfs_path *path; |
Chris Mason | 3768f36 | 2007-03-13 16:47:54 -0400 | [diff] [blame] | 80 | struct btrfs_key search_key; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 81 | struct btrfs_key found_key; |
| 82 | struct extent_buffer *l; |
Chris Mason | 3768f36 | 2007-03-13 16:47:54 -0400 | [diff] [blame] | 83 | int ret; |
| 84 | int slot; |
| 85 | |
| 86 | search_key.objectid = objectid; |
Chris Mason | 0660b5a | 2008-11-17 20:37:39 -0500 | [diff] [blame^] | 87 | search_key.type = BTRFS_ROOT_ITEM_KEY; |
Chris Mason | 5eda7b5 | 2007-06-22 14:16:25 -0400 | [diff] [blame] | 88 | search_key.offset = (u64)-1; |
Chris Mason | 3768f36 | 2007-03-13 16:47:54 -0400 | [diff] [blame] | 89 | |
Chris Mason | 5caf2a0 | 2007-04-02 11:20:42 -0400 | [diff] [blame] | 90 | path = btrfs_alloc_path(); |
| 91 | BUG_ON(!path); |
Chris Mason | 5caf2a0 | 2007-04-02 11:20:42 -0400 | [diff] [blame] | 92 | ret = btrfs_search_slot(NULL, root, &search_key, path, 0, 0); |
Chris Mason | 3768f36 | 2007-03-13 16:47:54 -0400 | [diff] [blame] | 93 | if (ret < 0) |
| 94 | goto out; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 95 | |
Chris Mason | 3768f36 | 2007-03-13 16:47:54 -0400 | [diff] [blame] | 96 | BUG_ON(ret == 0); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 97 | l = path->nodes[0]; |
Chris Mason | 5caf2a0 | 2007-04-02 11:20:42 -0400 | [diff] [blame] | 98 | BUG_ON(path->slots[0] == 0); |
| 99 | slot = path->slots[0] - 1; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 100 | btrfs_item_key_to_cpu(l, &found_key, slot); |
| 101 | if (found_key.objectid != objectid) { |
Chris Mason | 3768f36 | 2007-03-13 16:47:54 -0400 | [diff] [blame] | 102 | ret = 1; |
| 103 | goto out; |
| 104 | } |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 105 | read_extent_buffer(l, item, btrfs_item_ptr_offset(l, slot), |
| 106 | sizeof(*item)); |
| 107 | memcpy(key, &found_key, sizeof(found_key)); |
Chris Mason | 3768f36 | 2007-03-13 16:47:54 -0400 | [diff] [blame] | 108 | ret = 0; |
| 109 | out: |
Chris Mason | 5caf2a0 | 2007-04-02 11:20:42 -0400 | [diff] [blame] | 110 | btrfs_free_path(path); |
Chris Mason | 3768f36 | 2007-03-13 16:47:54 -0400 | [diff] [blame] | 111 | return ret; |
| 112 | } |
| 113 | |
Chris Mason | d352ac6 | 2008-09-29 15:18:18 -0400 | [diff] [blame] | 114 | /* |
| 115 | * copy the data in 'item' into the btree |
| 116 | */ |
Chris Mason | e089f05 | 2007-03-16 16:20:31 -0400 | [diff] [blame] | 117 | int btrfs_update_root(struct btrfs_trans_handle *trans, struct btrfs_root |
| 118 | *root, struct btrfs_key *key, struct btrfs_root_item |
| 119 | *item) |
Chris Mason | 3768f36 | 2007-03-13 16:47:54 -0400 | [diff] [blame] | 120 | { |
Chris Mason | 5caf2a0 | 2007-04-02 11:20:42 -0400 | [diff] [blame] | 121 | struct btrfs_path *path; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 122 | struct extent_buffer *l; |
Chris Mason | 3768f36 | 2007-03-13 16:47:54 -0400 | [diff] [blame] | 123 | int ret; |
| 124 | int slot; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 125 | unsigned long ptr; |
Chris Mason | 3768f36 | 2007-03-13 16:47:54 -0400 | [diff] [blame] | 126 | |
Chris Mason | 5caf2a0 | 2007-04-02 11:20:42 -0400 | [diff] [blame] | 127 | path = btrfs_alloc_path(); |
| 128 | BUG_ON(!path); |
Chris Mason | 5caf2a0 | 2007-04-02 11:20:42 -0400 | [diff] [blame] | 129 | ret = btrfs_search_slot(trans, root, key, path, 0, 1); |
Chris Mason | 3768f36 | 2007-03-13 16:47:54 -0400 | [diff] [blame] | 130 | if (ret < 0) |
| 131 | goto out; |
Chris Mason | d666746 | 2008-01-03 14:51:00 -0500 | [diff] [blame] | 132 | |
| 133 | if (ret != 0) { |
| 134 | btrfs_print_leaf(root, path->nodes[0]); |
| 135 | printk("unable to update root key %Lu %u %Lu\n", |
| 136 | key->objectid, key->type, key->offset); |
| 137 | BUG_ON(1); |
| 138 | } |
| 139 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 140 | l = path->nodes[0]; |
Chris Mason | 5caf2a0 | 2007-04-02 11:20:42 -0400 | [diff] [blame] | 141 | slot = path->slots[0]; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 142 | ptr = btrfs_item_ptr_offset(l, slot); |
| 143 | write_extent_buffer(l, item, ptr, sizeof(*item)); |
Chris Mason | 5caf2a0 | 2007-04-02 11:20:42 -0400 | [diff] [blame] | 144 | btrfs_mark_buffer_dirty(path->nodes[0]); |
Chris Mason | 3768f36 | 2007-03-13 16:47:54 -0400 | [diff] [blame] | 145 | out: |
Chris Mason | 5caf2a0 | 2007-04-02 11:20:42 -0400 | [diff] [blame] | 146 | btrfs_release_path(root, path); |
| 147 | btrfs_free_path(path); |
Chris Mason | 3768f36 | 2007-03-13 16:47:54 -0400 | [diff] [blame] | 148 | return ret; |
| 149 | } |
| 150 | |
Chris Mason | e089f05 | 2007-03-16 16:20:31 -0400 | [diff] [blame] | 151 | int btrfs_insert_root(struct btrfs_trans_handle *trans, struct btrfs_root |
| 152 | *root, struct btrfs_key *key, struct btrfs_root_item |
| 153 | *item) |
Chris Mason | 3768f36 | 2007-03-13 16:47:54 -0400 | [diff] [blame] | 154 | { |
| 155 | int ret; |
Chris Mason | e089f05 | 2007-03-16 16:20:31 -0400 | [diff] [blame] | 156 | ret = btrfs_insert_item(trans, root, key, item, sizeof(*item)); |
Chris Mason | 3768f36 | 2007-03-13 16:47:54 -0400 | [diff] [blame] | 157 | return ret; |
| 158 | } |
| 159 | |
Chris Mason | d352ac6 | 2008-09-29 15:18:18 -0400 | [diff] [blame] | 160 | /* |
| 161 | * at mount time we want to find all the old transaction snapshots that were in |
| 162 | * the process of being deleted if we crashed. This is any root item with an offset |
| 163 | * lower than the latest root. They need to be queued for deletion to finish |
| 164 | * what was happening when we crashed. |
| 165 | */ |
Chris Mason | 5ce14bb | 2007-09-11 11:15:39 -0400 | [diff] [blame] | 166 | int btrfs_find_dead_roots(struct btrfs_root *root, u64 objectid, |
| 167 | struct btrfs_root *latest) |
Chris Mason | 5eda7b5 | 2007-06-22 14:16:25 -0400 | [diff] [blame] | 168 | { |
| 169 | struct btrfs_root *dead_root; |
| 170 | struct btrfs_item *item; |
| 171 | struct btrfs_root_item *ri; |
| 172 | struct btrfs_key key; |
Chris Mason | a7a16fd | 2008-06-26 10:34:20 -0400 | [diff] [blame] | 173 | struct btrfs_key found_key; |
Chris Mason | 5eda7b5 | 2007-06-22 14:16:25 -0400 | [diff] [blame] | 174 | struct btrfs_path *path; |
| 175 | int ret; |
| 176 | u32 nritems; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 177 | struct extent_buffer *leaf; |
Chris Mason | 5eda7b5 | 2007-06-22 14:16:25 -0400 | [diff] [blame] | 178 | int slot; |
| 179 | |
Chris Mason | 5ce14bb | 2007-09-11 11:15:39 -0400 | [diff] [blame] | 180 | key.objectid = objectid; |
Chris Mason | 5eda7b5 | 2007-06-22 14:16:25 -0400 | [diff] [blame] | 181 | btrfs_set_key_type(&key, BTRFS_ROOT_ITEM_KEY); |
| 182 | key.offset = 0; |
| 183 | path = btrfs_alloc_path(); |
| 184 | if (!path) |
| 185 | return -ENOMEM; |
Chris Mason | a7a16fd | 2008-06-26 10:34:20 -0400 | [diff] [blame] | 186 | |
| 187 | again: |
Chris Mason | 5eda7b5 | 2007-06-22 14:16:25 -0400 | [diff] [blame] | 188 | ret = btrfs_search_slot(NULL, root, &key, path, 0, 0); |
| 189 | if (ret < 0) |
| 190 | goto err; |
| 191 | while(1) { |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 192 | leaf = path->nodes[0]; |
| 193 | nritems = btrfs_header_nritems(leaf); |
Chris Mason | 5eda7b5 | 2007-06-22 14:16:25 -0400 | [diff] [blame] | 194 | slot = path->slots[0]; |
| 195 | if (slot >= nritems) { |
| 196 | ret = btrfs_next_leaf(root, path); |
| 197 | if (ret) |
| 198 | break; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 199 | leaf = path->nodes[0]; |
| 200 | nritems = btrfs_header_nritems(leaf); |
Chris Mason | 5eda7b5 | 2007-06-22 14:16:25 -0400 | [diff] [blame] | 201 | slot = path->slots[0]; |
| 202 | } |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 203 | item = btrfs_item_nr(leaf, slot); |
| 204 | btrfs_item_key_to_cpu(leaf, &key, slot); |
Chris Mason | 5eda7b5 | 2007-06-22 14:16:25 -0400 | [diff] [blame] | 205 | if (btrfs_key_type(&key) != BTRFS_ROOT_ITEM_KEY) |
| 206 | goto next; |
Chris Mason | 5ce14bb | 2007-09-11 11:15:39 -0400 | [diff] [blame] | 207 | |
| 208 | if (key.objectid < objectid) |
| 209 | goto next; |
| 210 | |
| 211 | if (key.objectid > objectid) |
| 212 | break; |
| 213 | |
Chris Mason | 5eda7b5 | 2007-06-22 14:16:25 -0400 | [diff] [blame] | 214 | ri = btrfs_item_ptr(leaf, slot, struct btrfs_root_item); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 215 | if (btrfs_disk_root_refs(leaf, ri) != 0) |
Chris Mason | 5eda7b5 | 2007-06-22 14:16:25 -0400 | [diff] [blame] | 216 | goto next; |
Chris Mason | 5ce14bb | 2007-09-11 11:15:39 -0400 | [diff] [blame] | 217 | |
Chris Mason | a7a16fd | 2008-06-26 10:34:20 -0400 | [diff] [blame] | 218 | memcpy(&found_key, &key, sizeof(key)); |
| 219 | key.offset++; |
| 220 | btrfs_release_path(root, path); |
Chris Mason | e02119d | 2008-09-05 16:13:11 -0400 | [diff] [blame] | 221 | dead_root = |
| 222 | btrfs_read_fs_root_no_radix(root->fs_info->tree_root, |
| 223 | &found_key); |
Aneesh | a1f3963 | 2007-07-11 10:03:27 -0400 | [diff] [blame] | 224 | if (IS_ERR(dead_root)) { |
| 225 | ret = PTR_ERR(dead_root); |
Chris Mason | 5eda7b5 | 2007-06-22 14:16:25 -0400 | [diff] [blame] | 226 | goto err; |
| 227 | } |
Chris Mason | 5ce14bb | 2007-09-11 11:15:39 -0400 | [diff] [blame] | 228 | |
Zheng Yan | 1a40e23 | 2008-09-26 10:09:34 -0400 | [diff] [blame] | 229 | if (objectid == BTRFS_TREE_RELOC_OBJECTID) |
| 230 | ret = btrfs_add_dead_reloc_root(dead_root); |
| 231 | else |
| 232 | ret = btrfs_add_dead_root(dead_root, latest); |
Chris Mason | 5eda7b5 | 2007-06-22 14:16:25 -0400 | [diff] [blame] | 233 | if (ret) |
| 234 | goto err; |
Chris Mason | a7a16fd | 2008-06-26 10:34:20 -0400 | [diff] [blame] | 235 | goto again; |
Chris Mason | 5eda7b5 | 2007-06-22 14:16:25 -0400 | [diff] [blame] | 236 | next: |
| 237 | slot++; |
| 238 | path->slots[0]++; |
| 239 | } |
| 240 | ret = 0; |
| 241 | err: |
| 242 | btrfs_free_path(path); |
| 243 | return ret; |
| 244 | } |
| 245 | |
Chris Mason | d352ac6 | 2008-09-29 15:18:18 -0400 | [diff] [blame] | 246 | /* drop the root item for 'key' from 'root' */ |
Chris Mason | e089f05 | 2007-03-16 16:20:31 -0400 | [diff] [blame] | 247 | int btrfs_del_root(struct btrfs_trans_handle *trans, struct btrfs_root *root, |
| 248 | struct btrfs_key *key) |
Chris Mason | 3768f36 | 2007-03-13 16:47:54 -0400 | [diff] [blame] | 249 | { |
Chris Mason | 5caf2a0 | 2007-04-02 11:20:42 -0400 | [diff] [blame] | 250 | struct btrfs_path *path; |
Chris Mason | 3768f36 | 2007-03-13 16:47:54 -0400 | [diff] [blame] | 251 | int ret; |
Chris Mason | c5739bb | 2007-04-10 09:27:04 -0400 | [diff] [blame] | 252 | u32 refs; |
| 253 | struct btrfs_root_item *ri; |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 254 | struct extent_buffer *leaf; |
Chris Mason | 3768f36 | 2007-03-13 16:47:54 -0400 | [diff] [blame] | 255 | |
Chris Mason | 5caf2a0 | 2007-04-02 11:20:42 -0400 | [diff] [blame] | 256 | path = btrfs_alloc_path(); |
| 257 | BUG_ON(!path); |
Chris Mason | 5caf2a0 | 2007-04-02 11:20:42 -0400 | [diff] [blame] | 258 | ret = btrfs_search_slot(trans, root, key, path, -1, 1); |
Chris Mason | 3768f36 | 2007-03-13 16:47:54 -0400 | [diff] [blame] | 259 | if (ret < 0) |
| 260 | goto out; |
Chris Mason | edbd8d4 | 2007-12-21 16:27:24 -0500 | [diff] [blame] | 261 | if (ret) { |
| 262 | btrfs_print_leaf(root, path->nodes[0]); |
| 263 | printk("failed to del %Lu %u %Lu\n", key->objectid, key->type, key->offset); |
| 264 | |
| 265 | } |
Chris Mason | 3768f36 | 2007-03-13 16:47:54 -0400 | [diff] [blame] | 266 | BUG_ON(ret != 0); |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 267 | leaf = path->nodes[0]; |
| 268 | ri = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_root_item); |
Chris Mason | c5739bb | 2007-04-10 09:27:04 -0400 | [diff] [blame] | 269 | |
Chris Mason | 5f39d39 | 2007-10-15 16:14:19 -0400 | [diff] [blame] | 270 | refs = btrfs_disk_root_refs(leaf, ri); |
Chris Mason | 5eda7b5 | 2007-06-22 14:16:25 -0400 | [diff] [blame] | 271 | BUG_ON(refs != 0); |
| 272 | ret = btrfs_del_item(trans, root, path); |
Chris Mason | 3768f36 | 2007-03-13 16:47:54 -0400 | [diff] [blame] | 273 | out: |
Chris Mason | 5caf2a0 | 2007-04-02 11:20:42 -0400 | [diff] [blame] | 274 | btrfs_release_path(root, path); |
| 275 | btrfs_free_path(path); |
Chris Mason | 3768f36 | 2007-03-13 16:47:54 -0400 | [diff] [blame] | 276 | return ret; |
| 277 | } |
Chris Mason | 0660b5a | 2008-11-17 20:37:39 -0500 | [diff] [blame^] | 278 | |
| 279 | int btrfs_del_root_ref(struct btrfs_trans_handle *trans, |
| 280 | struct btrfs_root *tree_root, |
| 281 | u64 root_id, u8 type, u64 ref_id) |
| 282 | { |
| 283 | struct btrfs_key key; |
| 284 | int ret; |
| 285 | struct btrfs_path *path; |
| 286 | |
| 287 | path = btrfs_alloc_path(); |
| 288 | |
| 289 | key.objectid = root_id; |
| 290 | key.type = type; |
| 291 | key.offset = ref_id; |
| 292 | |
| 293 | ret = btrfs_search_slot(trans, tree_root, &key, path, -1, 1); |
| 294 | BUG_ON(ret); |
| 295 | |
| 296 | ret = btrfs_del_item(trans, tree_root, path); |
| 297 | BUG_ON(ret); |
| 298 | |
| 299 | btrfs_free_path(path); |
| 300 | return ret; |
| 301 | } |
| 302 | |
| 303 | /* |
| 304 | * add a btrfs_root_ref item. type is either BTRFS_ROOT_REF_KEY |
| 305 | * or BTRFS_ROOT_BACKREF_KEY. |
| 306 | * |
| 307 | * The dirid, sequence, name and name_len refer to the directory entry |
| 308 | * that is referencing the root. |
| 309 | * |
| 310 | * For a forward ref, the root_id is the id of the tree referencing |
| 311 | * the root and ref_id is the id of the subvol or snapshot. |
| 312 | * |
| 313 | * For a back ref the root_id is the id of the subvol or snapshot and |
| 314 | * ref_id is the id of the tree referencing it. |
| 315 | */ |
| 316 | int btrfs_add_root_ref(struct btrfs_trans_handle *trans, |
| 317 | struct btrfs_root *tree_root, |
| 318 | u64 root_id, u8 type, u64 ref_id, |
| 319 | u64 dirid, u64 sequence, |
| 320 | const char *name, int name_len) |
| 321 | { |
| 322 | struct btrfs_key key; |
| 323 | int ret; |
| 324 | struct btrfs_path *path; |
| 325 | struct btrfs_root_ref *ref; |
| 326 | struct extent_buffer *leaf; |
| 327 | unsigned long ptr; |
| 328 | |
| 329 | |
| 330 | path = btrfs_alloc_path(); |
| 331 | |
| 332 | key.objectid = root_id; |
| 333 | key.type = type; |
| 334 | key.offset = ref_id; |
| 335 | |
| 336 | ret = btrfs_insert_empty_item(trans, tree_root, path, &key, |
| 337 | sizeof(*ref) + name_len); |
| 338 | BUG_ON(ret); |
| 339 | |
| 340 | leaf = path->nodes[0]; |
| 341 | ref = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_root_ref); |
| 342 | btrfs_set_root_ref_dirid(leaf, ref, dirid); |
| 343 | btrfs_set_root_ref_sequence(leaf, ref, sequence); |
| 344 | btrfs_set_root_ref_name_len(leaf, ref, name_len); |
| 345 | ptr = (unsigned long)(ref + 1); |
| 346 | write_extent_buffer(leaf, name, ptr, name_len); |
| 347 | btrfs_mark_buffer_dirty(leaf); |
| 348 | |
| 349 | btrfs_free_path(path); |
| 350 | return ret; |
| 351 | } |