Loading...
1// SPDX-License-Identifier: GPL-2.0
2/*
3 * Copyright (C) 2007 Oracle. All rights reserved.
4 */
5
6#include "ctree.h"
7#include "disk-io.h"
8#include "transaction.h"
9#include "print-tree.h"
10
11struct btrfs_inode_ref *btrfs_find_name_in_backref(struct extent_buffer *leaf,
12 int slot, const char *name,
13 int name_len)
14{
15 struct btrfs_inode_ref *ref;
16 unsigned long ptr;
17 unsigned long name_ptr;
18 u32 item_size;
19 u32 cur_offset = 0;
20 int len;
21
22 item_size = btrfs_item_size_nr(leaf, slot);
23 ptr = btrfs_item_ptr_offset(leaf, slot);
24 while (cur_offset < item_size) {
25 ref = (struct btrfs_inode_ref *)(ptr + cur_offset);
26 len = btrfs_inode_ref_name_len(leaf, ref);
27 name_ptr = (unsigned long)(ref + 1);
28 cur_offset += len + sizeof(*ref);
29 if (len != name_len)
30 continue;
31 if (memcmp_extent_buffer(leaf, name, name_ptr, name_len) == 0)
32 return ref;
33 }
34 return NULL;
35}
36
37struct btrfs_inode_extref *btrfs_find_name_in_ext_backref(
38 struct extent_buffer *leaf, int slot, u64 ref_objectid,
39 const char *name, int name_len)
40{
41 struct btrfs_inode_extref *extref;
42 unsigned long ptr;
43 unsigned long name_ptr;
44 u32 item_size;
45 u32 cur_offset = 0;
46 int ref_name_len;
47
48 item_size = btrfs_item_size_nr(leaf, slot);
49 ptr = btrfs_item_ptr_offset(leaf, slot);
50
51 /*
52 * Search all extended backrefs in this item. We're only
53 * looking through any collisions so most of the time this is
54 * just going to compare against one buffer. If all is well,
55 * we'll return success and the inode ref object.
56 */
57 while (cur_offset < item_size) {
58 extref = (struct btrfs_inode_extref *) (ptr + cur_offset);
59 name_ptr = (unsigned long)(&extref->name);
60 ref_name_len = btrfs_inode_extref_name_len(leaf, extref);
61
62 if (ref_name_len == name_len &&
63 btrfs_inode_extref_parent(leaf, extref) == ref_objectid &&
64 (memcmp_extent_buffer(leaf, name, name_ptr, name_len) == 0))
65 return extref;
66
67 cur_offset += ref_name_len + sizeof(*extref);
68 }
69 return NULL;
70}
71
72/* Returns NULL if no extref found */
73struct btrfs_inode_extref *
74btrfs_lookup_inode_extref(struct btrfs_trans_handle *trans,
75 struct btrfs_root *root,
76 struct btrfs_path *path,
77 const char *name, int name_len,
78 u64 inode_objectid, u64 ref_objectid, int ins_len,
79 int cow)
80{
81 int ret;
82 struct btrfs_key key;
83
84 key.objectid = inode_objectid;
85 key.type = BTRFS_INODE_EXTREF_KEY;
86 key.offset = btrfs_extref_hash(ref_objectid, name, name_len);
87
88 ret = btrfs_search_slot(trans, root, &key, path, ins_len, cow);
89 if (ret < 0)
90 return ERR_PTR(ret);
91 if (ret > 0)
92 return NULL;
93 return btrfs_find_name_in_ext_backref(path->nodes[0], path->slots[0],
94 ref_objectid, name, name_len);
95
96}
97
98static int btrfs_del_inode_extref(struct btrfs_trans_handle *trans,
99 struct btrfs_root *root,
100 const char *name, int name_len,
101 u64 inode_objectid, u64 ref_objectid,
102 u64 *index)
103{
104 struct btrfs_path *path;
105 struct btrfs_key key;
106 struct btrfs_inode_extref *extref;
107 struct extent_buffer *leaf;
108 int ret;
109 int del_len = name_len + sizeof(*extref);
110 unsigned long ptr;
111 unsigned long item_start;
112 u32 item_size;
113
114 key.objectid = inode_objectid;
115 key.type = BTRFS_INODE_EXTREF_KEY;
116 key.offset = btrfs_extref_hash(ref_objectid, name, name_len);
117
118 path = btrfs_alloc_path();
119 if (!path)
120 return -ENOMEM;
121
122 path->leave_spinning = 1;
123
124 ret = btrfs_search_slot(trans, root, &key, path, -1, 1);
125 if (ret > 0)
126 ret = -ENOENT;
127 if (ret < 0)
128 goto out;
129
130 /*
131 * Sanity check - did we find the right item for this name?
132 * This should always succeed so error here will make the FS
133 * readonly.
134 */
135 extref = btrfs_find_name_in_ext_backref(path->nodes[0], path->slots[0],
136 ref_objectid, name, name_len);
137 if (!extref) {
138 btrfs_handle_fs_error(root->fs_info, -ENOENT, NULL);
139 ret = -EROFS;
140 goto out;
141 }
142
143 leaf = path->nodes[0];
144 item_size = btrfs_item_size_nr(leaf, path->slots[0]);
145 if (index)
146 *index = btrfs_inode_extref_index(leaf, extref);
147
148 if (del_len == item_size) {
149 /*
150 * Common case only one ref in the item, remove the
151 * whole item.
152 */
153 ret = btrfs_del_item(trans, root, path);
154 goto out;
155 }
156
157 ptr = (unsigned long)extref;
158 item_start = btrfs_item_ptr_offset(leaf, path->slots[0]);
159
160 memmove_extent_buffer(leaf, ptr, ptr + del_len,
161 item_size - (ptr + del_len - item_start));
162
163 btrfs_truncate_item(path, item_size - del_len, 1);
164
165out:
166 btrfs_free_path(path);
167
168 return ret;
169}
170
171int btrfs_del_inode_ref(struct btrfs_trans_handle *trans,
172 struct btrfs_root *root,
173 const char *name, int name_len,
174 u64 inode_objectid, u64 ref_objectid, u64 *index)
175{
176 struct btrfs_path *path;
177 struct btrfs_key key;
178 struct btrfs_inode_ref *ref;
179 struct extent_buffer *leaf;
180 unsigned long ptr;
181 unsigned long item_start;
182 u32 item_size;
183 u32 sub_item_len;
184 int ret;
185 int search_ext_refs = 0;
186 int del_len = name_len + sizeof(*ref);
187
188 key.objectid = inode_objectid;
189 key.offset = ref_objectid;
190 key.type = BTRFS_INODE_REF_KEY;
191
192 path = btrfs_alloc_path();
193 if (!path)
194 return -ENOMEM;
195
196 path->leave_spinning = 1;
197
198 ret = btrfs_search_slot(trans, root, &key, path, -1, 1);
199 if (ret > 0) {
200 ret = -ENOENT;
201 search_ext_refs = 1;
202 goto out;
203 } else if (ret < 0) {
204 goto out;
205 }
206
207 ref = btrfs_find_name_in_backref(path->nodes[0], path->slots[0], name,
208 name_len);
209 if (!ref) {
210 ret = -ENOENT;
211 search_ext_refs = 1;
212 goto out;
213 }
214 leaf = path->nodes[0];
215 item_size = btrfs_item_size_nr(leaf, path->slots[0]);
216
217 if (index)
218 *index = btrfs_inode_ref_index(leaf, ref);
219
220 if (del_len == item_size) {
221 ret = btrfs_del_item(trans, root, path);
222 goto out;
223 }
224 ptr = (unsigned long)ref;
225 sub_item_len = name_len + sizeof(*ref);
226 item_start = btrfs_item_ptr_offset(leaf, path->slots[0]);
227 memmove_extent_buffer(leaf, ptr, ptr + sub_item_len,
228 item_size - (ptr + sub_item_len - item_start));
229 btrfs_truncate_item(path, item_size - sub_item_len, 1);
230out:
231 btrfs_free_path(path);
232
233 if (search_ext_refs) {
234 /*
235 * No refs were found, or we could not find the
236 * name in our ref array. Find and remove the extended
237 * inode ref then.
238 */
239 return btrfs_del_inode_extref(trans, root, name, name_len,
240 inode_objectid, ref_objectid, index);
241 }
242
243 return ret;
244}
245
246/*
247 * btrfs_insert_inode_extref() - Inserts an extended inode ref into a tree.
248 *
249 * The caller must have checked against BTRFS_LINK_MAX already.
250 */
251static int btrfs_insert_inode_extref(struct btrfs_trans_handle *trans,
252 struct btrfs_root *root,
253 const char *name, int name_len,
254 u64 inode_objectid, u64 ref_objectid, u64 index)
255{
256 struct btrfs_inode_extref *extref;
257 int ret;
258 int ins_len = name_len + sizeof(*extref);
259 unsigned long ptr;
260 struct btrfs_path *path;
261 struct btrfs_key key;
262 struct extent_buffer *leaf;
263 struct btrfs_item *item;
264
265 key.objectid = inode_objectid;
266 key.type = BTRFS_INODE_EXTREF_KEY;
267 key.offset = btrfs_extref_hash(ref_objectid, name, name_len);
268
269 path = btrfs_alloc_path();
270 if (!path)
271 return -ENOMEM;
272
273 path->leave_spinning = 1;
274 ret = btrfs_insert_empty_item(trans, root, path, &key,
275 ins_len);
276 if (ret == -EEXIST) {
277 if (btrfs_find_name_in_ext_backref(path->nodes[0],
278 path->slots[0],
279 ref_objectid,
280 name, name_len))
281 goto out;
282
283 btrfs_extend_item(path, ins_len);
284 ret = 0;
285 }
286 if (ret < 0)
287 goto out;
288
289 leaf = path->nodes[0];
290 item = btrfs_item_nr(path->slots[0]);
291 ptr = (unsigned long)btrfs_item_ptr(leaf, path->slots[0], char);
292 ptr += btrfs_item_size(leaf, item) - ins_len;
293 extref = (struct btrfs_inode_extref *)ptr;
294
295 btrfs_set_inode_extref_name_len(path->nodes[0], extref, name_len);
296 btrfs_set_inode_extref_index(path->nodes[0], extref, index);
297 btrfs_set_inode_extref_parent(path->nodes[0], extref, ref_objectid);
298
299 ptr = (unsigned long)&extref->name;
300 write_extent_buffer(path->nodes[0], name, ptr, name_len);
301 btrfs_mark_buffer_dirty(path->nodes[0]);
302
303out:
304 btrfs_free_path(path);
305 return ret;
306}
307
308/* Will return 0, -ENOMEM, -EMLINK, or -EEXIST or anything from the CoW path */
309int btrfs_insert_inode_ref(struct btrfs_trans_handle *trans,
310 struct btrfs_root *root,
311 const char *name, int name_len,
312 u64 inode_objectid, u64 ref_objectid, u64 index)
313{
314 struct btrfs_fs_info *fs_info = root->fs_info;
315 struct btrfs_path *path;
316 struct btrfs_key key;
317 struct btrfs_inode_ref *ref;
318 unsigned long ptr;
319 int ret;
320 int ins_len = name_len + sizeof(*ref);
321
322 key.objectid = inode_objectid;
323 key.offset = ref_objectid;
324 key.type = BTRFS_INODE_REF_KEY;
325
326 path = btrfs_alloc_path();
327 if (!path)
328 return -ENOMEM;
329
330 path->leave_spinning = 1;
331 path->skip_release_on_error = 1;
332 ret = btrfs_insert_empty_item(trans, root, path, &key,
333 ins_len);
334 if (ret == -EEXIST) {
335 u32 old_size;
336 ref = btrfs_find_name_in_backref(path->nodes[0], path->slots[0],
337 name, name_len);
338 if (ref)
339 goto out;
340
341 old_size = btrfs_item_size_nr(path->nodes[0], path->slots[0]);
342 btrfs_extend_item(path, ins_len);
343 ref = btrfs_item_ptr(path->nodes[0], path->slots[0],
344 struct btrfs_inode_ref);
345 ref = (struct btrfs_inode_ref *)((unsigned long)ref + old_size);
346 btrfs_set_inode_ref_name_len(path->nodes[0], ref, name_len);
347 btrfs_set_inode_ref_index(path->nodes[0], ref, index);
348 ptr = (unsigned long)(ref + 1);
349 ret = 0;
350 } else if (ret < 0) {
351 if (ret == -EOVERFLOW) {
352 if (btrfs_find_name_in_backref(path->nodes[0],
353 path->slots[0],
354 name, name_len))
355 ret = -EEXIST;
356 else
357 ret = -EMLINK;
358 }
359 goto out;
360 } else {
361 ref = btrfs_item_ptr(path->nodes[0], path->slots[0],
362 struct btrfs_inode_ref);
363 btrfs_set_inode_ref_name_len(path->nodes[0], ref, name_len);
364 btrfs_set_inode_ref_index(path->nodes[0], ref, index);
365 ptr = (unsigned long)(ref + 1);
366 }
367 write_extent_buffer(path->nodes[0], name, ptr, name_len);
368 btrfs_mark_buffer_dirty(path->nodes[0]);
369
370out:
371 btrfs_free_path(path);
372
373 if (ret == -EMLINK) {
374 struct btrfs_super_block *disk_super = fs_info->super_copy;
375 /* We ran out of space in the ref array. Need to
376 * add an extended ref. */
377 if (btrfs_super_incompat_flags(disk_super)
378 & BTRFS_FEATURE_INCOMPAT_EXTENDED_IREF)
379 ret = btrfs_insert_inode_extref(trans, root, name,
380 name_len,
381 inode_objectid,
382 ref_objectid, index);
383 }
384
385 return ret;
386}
387
388int btrfs_insert_empty_inode(struct btrfs_trans_handle *trans,
389 struct btrfs_root *root,
390 struct btrfs_path *path, u64 objectid)
391{
392 struct btrfs_key key;
393 int ret;
394 key.objectid = objectid;
395 key.type = BTRFS_INODE_ITEM_KEY;
396 key.offset = 0;
397
398 ret = btrfs_insert_empty_item(trans, root, path, &key,
399 sizeof(struct btrfs_inode_item));
400 return ret;
401}
402
403int btrfs_lookup_inode(struct btrfs_trans_handle *trans, struct btrfs_root
404 *root, struct btrfs_path *path,
405 struct btrfs_key *location, int mod)
406{
407 int ins_len = mod < 0 ? -1 : 0;
408 int cow = mod != 0;
409 int ret;
410 int slot;
411 struct extent_buffer *leaf;
412 struct btrfs_key found_key;
413
414 ret = btrfs_search_slot(trans, root, location, path, ins_len, cow);
415 if (ret > 0 && location->type == BTRFS_ROOT_ITEM_KEY &&
416 location->offset == (u64)-1 && path->slots[0] != 0) {
417 slot = path->slots[0] - 1;
418 leaf = path->nodes[0];
419 btrfs_item_key_to_cpu(leaf, &found_key, slot);
420 if (found_key.objectid == location->objectid &&
421 found_key.type == location->type) {
422 path->slots[0]--;
423 return 0;
424 }
425 }
426 return ret;
427}
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
19#include "ctree.h"
20#include "disk-io.h"
21#include "transaction.h"
22
23static int find_name_in_backref(struct btrfs_path *path, const char *name,
24 int name_len, struct btrfs_inode_ref **ref_ret)
25{
26 struct extent_buffer *leaf;
27 struct btrfs_inode_ref *ref;
28 unsigned long ptr;
29 unsigned long name_ptr;
30 u32 item_size;
31 u32 cur_offset = 0;
32 int len;
33
34 leaf = path->nodes[0];
35 item_size = btrfs_item_size_nr(leaf, path->slots[0]);
36 ptr = btrfs_item_ptr_offset(leaf, path->slots[0]);
37 while (cur_offset < item_size) {
38 ref = (struct btrfs_inode_ref *)(ptr + cur_offset);
39 len = btrfs_inode_ref_name_len(leaf, ref);
40 name_ptr = (unsigned long)(ref + 1);
41 cur_offset += len + sizeof(*ref);
42 if (len != name_len)
43 continue;
44 if (memcmp_extent_buffer(leaf, name, name_ptr, name_len) == 0) {
45 *ref_ret = ref;
46 return 1;
47 }
48 }
49 return 0;
50}
51
52struct btrfs_inode_ref *
53btrfs_lookup_inode_ref(struct btrfs_trans_handle *trans,
54 struct btrfs_root *root,
55 struct btrfs_path *path,
56 const char *name, int name_len,
57 u64 inode_objectid, u64 ref_objectid, int mod)
58{
59 struct btrfs_key key;
60 struct btrfs_inode_ref *ref;
61 int ins_len = mod < 0 ? -1 : 0;
62 int cow = mod != 0;
63 int ret;
64
65 key.objectid = inode_objectid;
66 key.type = BTRFS_INODE_REF_KEY;
67 key.offset = ref_objectid;
68
69 ret = btrfs_search_slot(trans, root, &key, path, ins_len, cow);
70 if (ret < 0)
71 return ERR_PTR(ret);
72 if (ret > 0)
73 return NULL;
74 if (!find_name_in_backref(path, name, name_len, &ref))
75 return NULL;
76 return ref;
77}
78
79int btrfs_del_inode_ref(struct btrfs_trans_handle *trans,
80 struct btrfs_root *root,
81 const char *name, int name_len,
82 u64 inode_objectid, u64 ref_objectid, u64 *index)
83{
84 struct btrfs_path *path;
85 struct btrfs_key key;
86 struct btrfs_inode_ref *ref;
87 struct extent_buffer *leaf;
88 unsigned long ptr;
89 unsigned long item_start;
90 u32 item_size;
91 u32 sub_item_len;
92 int ret;
93 int del_len = name_len + sizeof(*ref);
94
95 key.objectid = inode_objectid;
96 key.offset = ref_objectid;
97 btrfs_set_key_type(&key, BTRFS_INODE_REF_KEY);
98
99 path = btrfs_alloc_path();
100 if (!path)
101 return -ENOMEM;
102
103 path->leave_spinning = 1;
104
105 ret = btrfs_search_slot(trans, root, &key, path, -1, 1);
106 if (ret > 0) {
107 ret = -ENOENT;
108 goto out;
109 } else if (ret < 0) {
110 goto out;
111 }
112 if (!find_name_in_backref(path, name, name_len, &ref)) {
113 ret = -ENOENT;
114 goto out;
115 }
116 leaf = path->nodes[0];
117 item_size = btrfs_item_size_nr(leaf, path->slots[0]);
118
119 if (index)
120 *index = btrfs_inode_ref_index(leaf, ref);
121
122 if (del_len == item_size) {
123 ret = btrfs_del_item(trans, root, path);
124 goto out;
125 }
126 ptr = (unsigned long)ref;
127 sub_item_len = name_len + sizeof(*ref);
128 item_start = btrfs_item_ptr_offset(leaf, path->slots[0]);
129 memmove_extent_buffer(leaf, ptr, ptr + sub_item_len,
130 item_size - (ptr + sub_item_len - item_start));
131 ret = btrfs_truncate_item(trans, root, path,
132 item_size - sub_item_len, 1);
133out:
134 btrfs_free_path(path);
135 return ret;
136}
137
138int btrfs_insert_inode_ref(struct btrfs_trans_handle *trans,
139 struct btrfs_root *root,
140 const char *name, int name_len,
141 u64 inode_objectid, u64 ref_objectid, u64 index)
142{
143 struct btrfs_path *path;
144 struct btrfs_key key;
145 struct btrfs_inode_ref *ref;
146 unsigned long ptr;
147 int ret;
148 int ins_len = name_len + sizeof(*ref);
149
150 key.objectid = inode_objectid;
151 key.offset = ref_objectid;
152 btrfs_set_key_type(&key, BTRFS_INODE_REF_KEY);
153
154 path = btrfs_alloc_path();
155 if (!path)
156 return -ENOMEM;
157
158 path->leave_spinning = 1;
159 ret = btrfs_insert_empty_item(trans, root, path, &key,
160 ins_len);
161 if (ret == -EEXIST) {
162 u32 old_size;
163
164 if (find_name_in_backref(path, name, name_len, &ref))
165 goto out;
166
167 old_size = btrfs_item_size_nr(path->nodes[0], path->slots[0]);
168 ret = btrfs_extend_item(trans, root, path, ins_len);
169 ref = btrfs_item_ptr(path->nodes[0], path->slots[0],
170 struct btrfs_inode_ref);
171 ref = (struct btrfs_inode_ref *)((unsigned long)ref + old_size);
172 btrfs_set_inode_ref_name_len(path->nodes[0], ref, name_len);
173 btrfs_set_inode_ref_index(path->nodes[0], ref, index);
174 ptr = (unsigned long)(ref + 1);
175 ret = 0;
176 } else if (ret < 0) {
177 if (ret == -EOVERFLOW)
178 ret = -EMLINK;
179 goto out;
180 } else {
181 ref = btrfs_item_ptr(path->nodes[0], path->slots[0],
182 struct btrfs_inode_ref);
183 btrfs_set_inode_ref_name_len(path->nodes[0], ref, name_len);
184 btrfs_set_inode_ref_index(path->nodes[0], ref, index);
185 ptr = (unsigned long)(ref + 1);
186 }
187 write_extent_buffer(path->nodes[0], name, ptr, name_len);
188 btrfs_mark_buffer_dirty(path->nodes[0]);
189
190out:
191 btrfs_free_path(path);
192 return ret;
193}
194
195int btrfs_insert_empty_inode(struct btrfs_trans_handle *trans,
196 struct btrfs_root *root,
197 struct btrfs_path *path, u64 objectid)
198{
199 struct btrfs_key key;
200 int ret;
201 key.objectid = objectid;
202 btrfs_set_key_type(&key, BTRFS_INODE_ITEM_KEY);
203 key.offset = 0;
204
205 ret = btrfs_insert_empty_item(trans, root, path, &key,
206 sizeof(struct btrfs_inode_item));
207 return ret;
208}
209
210int btrfs_lookup_inode(struct btrfs_trans_handle *trans, struct btrfs_root
211 *root, struct btrfs_path *path,
212 struct btrfs_key *location, int mod)
213{
214 int ins_len = mod < 0 ? -1 : 0;
215 int cow = mod != 0;
216 int ret;
217 int slot;
218 struct extent_buffer *leaf;
219 struct btrfs_key found_key;
220
221 ret = btrfs_search_slot(trans, root, location, path, ins_len, cow);
222 if (ret > 0 && btrfs_key_type(location) == BTRFS_ROOT_ITEM_KEY &&
223 location->offset == (u64)-1 && path->slots[0] != 0) {
224 slot = path->slots[0] - 1;
225 leaf = path->nodes[0];
226 btrfs_item_key_to_cpu(leaf, &found_key, slot);
227 if (found_key.objectid == location->objectid &&
228 btrfs_key_type(&found_key) == btrfs_key_type(location)) {
229 path->slots[0]--;
230 return 0;
231 }
232 }
233 return ret;
234}