Loading...
1// SPDX-License-Identifier: GPL-2.0
2/*
3 * Copyright (C) 2007 Red Hat. All rights reserved.
4 */
5
6#include <linux/init.h>
7#include <linux/fs.h>
8#include <linux/slab.h>
9#include <linux/rwsem.h>
10#include <linux/xattr.h>
11#include <linux/security.h>
12#include <linux/posix_acl_xattr.h>
13#include <linux/iversion.h>
14#include <linux/sched/mm.h>
15#include "ctree.h"
16#include "fs.h"
17#include "messages.h"
18#include "btrfs_inode.h"
19#include "transaction.h"
20#include "xattr.h"
21#include "disk-io.h"
22#include "props.h"
23#include "locking.h"
24#include "accessors.h"
25#include "dir-item.h"
26
27int btrfs_getxattr(struct inode *inode, const char *name,
28 void *buffer, size_t size)
29{
30 struct btrfs_dir_item *di;
31 struct btrfs_root *root = BTRFS_I(inode)->root;
32 struct btrfs_path *path;
33 struct extent_buffer *leaf;
34 int ret = 0;
35 unsigned long data_ptr;
36
37 path = btrfs_alloc_path();
38 if (!path)
39 return -ENOMEM;
40
41 /* lookup the xattr by name */
42 di = btrfs_lookup_xattr(NULL, root, path, btrfs_ino(BTRFS_I(inode)),
43 name, strlen(name), 0);
44 if (!di) {
45 ret = -ENODATA;
46 goto out;
47 } else if (IS_ERR(di)) {
48 ret = PTR_ERR(di);
49 goto out;
50 }
51
52 leaf = path->nodes[0];
53 /* if size is 0, that means we want the size of the attr */
54 if (!size) {
55 ret = btrfs_dir_data_len(leaf, di);
56 goto out;
57 }
58
59 /* now get the data out of our dir_item */
60 if (btrfs_dir_data_len(leaf, di) > size) {
61 ret = -ERANGE;
62 goto out;
63 }
64
65 /*
66 * The way things are packed into the leaf is like this
67 * |struct btrfs_dir_item|name|data|
68 * where name is the xattr name, so security.foo, and data is the
69 * content of the xattr. data_ptr points to the location in memory
70 * where the data starts in the in memory leaf
71 */
72 data_ptr = (unsigned long)((char *)(di + 1) +
73 btrfs_dir_name_len(leaf, di));
74 read_extent_buffer(leaf, buffer, data_ptr,
75 btrfs_dir_data_len(leaf, di));
76 ret = btrfs_dir_data_len(leaf, di);
77
78out:
79 btrfs_free_path(path);
80 return ret;
81}
82
83int btrfs_setxattr(struct btrfs_trans_handle *trans, struct inode *inode,
84 const char *name, const void *value, size_t size, int flags)
85{
86 struct btrfs_dir_item *di = NULL;
87 struct btrfs_root *root = BTRFS_I(inode)->root;
88 struct btrfs_fs_info *fs_info = root->fs_info;
89 struct btrfs_path *path;
90 size_t name_len = strlen(name);
91 int ret = 0;
92
93 ASSERT(trans);
94
95 if (name_len + size > BTRFS_MAX_XATTR_SIZE(root->fs_info))
96 return -ENOSPC;
97
98 path = btrfs_alloc_path();
99 if (!path)
100 return -ENOMEM;
101 path->skip_release_on_error = 1;
102
103 if (!value) {
104 di = btrfs_lookup_xattr(trans, root, path,
105 btrfs_ino(BTRFS_I(inode)), name, name_len, -1);
106 if (!di && (flags & XATTR_REPLACE))
107 ret = -ENODATA;
108 else if (IS_ERR(di))
109 ret = PTR_ERR(di);
110 else if (di)
111 ret = btrfs_delete_one_dir_name(trans, root, path, di);
112 goto out;
113 }
114
115 /*
116 * For a replace we can't just do the insert blindly.
117 * Do a lookup first (read-only btrfs_search_slot), and return if xattr
118 * doesn't exist. If it exists, fall down below to the insert/replace
119 * path - we can't race with a concurrent xattr delete, because the VFS
120 * locks the inode's i_mutex before calling setxattr or removexattr.
121 */
122 if (flags & XATTR_REPLACE) {
123 ASSERT(inode_is_locked(inode));
124 di = btrfs_lookup_xattr(NULL, root, path,
125 btrfs_ino(BTRFS_I(inode)), name, name_len, 0);
126 if (!di)
127 ret = -ENODATA;
128 else if (IS_ERR(di))
129 ret = PTR_ERR(di);
130 if (ret)
131 goto out;
132 btrfs_release_path(path);
133 di = NULL;
134 }
135
136 ret = btrfs_insert_xattr_item(trans, root, path, btrfs_ino(BTRFS_I(inode)),
137 name, name_len, value, size);
138 if (ret == -EOVERFLOW) {
139 /*
140 * We have an existing item in a leaf, split_leaf couldn't
141 * expand it. That item might have or not a dir_item that
142 * matches our target xattr, so lets check.
143 */
144 ret = 0;
145 btrfs_assert_tree_write_locked(path->nodes[0]);
146 di = btrfs_match_dir_item_name(fs_info, path, name, name_len);
147 if (!di && !(flags & XATTR_REPLACE)) {
148 ret = -ENOSPC;
149 goto out;
150 }
151 } else if (ret == -EEXIST) {
152 ret = 0;
153 di = btrfs_match_dir_item_name(fs_info, path, name, name_len);
154 ASSERT(di); /* logic error */
155 } else if (ret) {
156 goto out;
157 }
158
159 if (di && (flags & XATTR_CREATE)) {
160 ret = -EEXIST;
161 goto out;
162 }
163
164 if (di) {
165 /*
166 * We're doing a replace, and it must be atomic, that is, at
167 * any point in time we have either the old or the new xattr
168 * value in the tree. We don't want readers (getxattr and
169 * listxattrs) to miss a value, this is specially important
170 * for ACLs.
171 */
172 const int slot = path->slots[0];
173 struct extent_buffer *leaf = path->nodes[0];
174 const u16 old_data_len = btrfs_dir_data_len(leaf, di);
175 const u32 item_size = btrfs_item_size(leaf, slot);
176 const u32 data_size = sizeof(*di) + name_len + size;
177 unsigned long data_ptr;
178 char *ptr;
179
180 if (size > old_data_len) {
181 if (btrfs_leaf_free_space(leaf) <
182 (size - old_data_len)) {
183 ret = -ENOSPC;
184 goto out;
185 }
186 }
187
188 if (old_data_len + name_len + sizeof(*di) == item_size) {
189 /* No other xattrs packed in the same leaf item. */
190 if (size > old_data_len)
191 btrfs_extend_item(path, size - old_data_len);
192 else if (size < old_data_len)
193 btrfs_truncate_item(path, data_size, 1);
194 } else {
195 /* There are other xattrs packed in the same item. */
196 ret = btrfs_delete_one_dir_name(trans, root, path, di);
197 if (ret)
198 goto out;
199 btrfs_extend_item(path, data_size);
200 }
201
202 ptr = btrfs_item_ptr(leaf, slot, char);
203 ptr += btrfs_item_size(leaf, slot) - data_size;
204 di = (struct btrfs_dir_item *)ptr;
205 btrfs_set_dir_data_len(leaf, di, size);
206 data_ptr = ((unsigned long)(di + 1)) + name_len;
207 write_extent_buffer(leaf, value, data_ptr, size);
208 btrfs_mark_buffer_dirty(leaf);
209 } else {
210 /*
211 * Insert, and we had space for the xattr, so path->slots[0] is
212 * where our xattr dir_item is and btrfs_insert_xattr_item()
213 * filled it.
214 */
215 }
216out:
217 btrfs_free_path(path);
218 if (!ret) {
219 set_bit(BTRFS_INODE_COPY_EVERYTHING,
220 &BTRFS_I(inode)->runtime_flags);
221 clear_bit(BTRFS_INODE_NO_XATTRS, &BTRFS_I(inode)->runtime_flags);
222 }
223 return ret;
224}
225
226/*
227 * @value: "" makes the attribute to empty, NULL removes it
228 */
229int btrfs_setxattr_trans(struct inode *inode, const char *name,
230 const void *value, size_t size, int flags)
231{
232 struct btrfs_root *root = BTRFS_I(inode)->root;
233 struct btrfs_trans_handle *trans;
234 const bool start_trans = (current->journal_info == NULL);
235 int ret;
236
237 if (start_trans) {
238 /*
239 * 1 unit for inserting/updating/deleting the xattr
240 * 1 unit for the inode item update
241 */
242 trans = btrfs_start_transaction(root, 2);
243 if (IS_ERR(trans))
244 return PTR_ERR(trans);
245 } else {
246 /*
247 * This can happen when smack is enabled and a directory is being
248 * created. It happens through d_instantiate_new(), which calls
249 * smack_d_instantiate(), which in turn calls __vfs_setxattr() to
250 * set the transmute xattr (XATTR_NAME_SMACKTRANSMUTE) on the
251 * inode. We have already reserved space for the xattr and inode
252 * update at btrfs_mkdir(), so just use the transaction handle.
253 * We don't join or start a transaction, as that will reset the
254 * block_rsv of the handle and trigger a warning for the start
255 * case.
256 */
257 ASSERT(strncmp(name, XATTR_SECURITY_PREFIX,
258 XATTR_SECURITY_PREFIX_LEN) == 0);
259 trans = current->journal_info;
260 }
261
262 ret = btrfs_setxattr(trans, inode, name, value, size, flags);
263 if (ret)
264 goto out;
265
266 inode_inc_iversion(inode);
267 inode->i_ctime = current_time(inode);
268 ret = btrfs_update_inode(trans, root, BTRFS_I(inode));
269 if (ret)
270 btrfs_abort_transaction(trans, ret);
271out:
272 if (start_trans)
273 btrfs_end_transaction(trans);
274 return ret;
275}
276
277ssize_t btrfs_listxattr(struct dentry *dentry, char *buffer, size_t size)
278{
279 struct btrfs_key found_key;
280 struct btrfs_key key;
281 struct inode *inode = d_inode(dentry);
282 struct btrfs_root *root = BTRFS_I(inode)->root;
283 struct btrfs_path *path;
284 int iter_ret = 0;
285 int ret = 0;
286 size_t total_size = 0, size_left = size;
287
288 /*
289 * ok we want all objects associated with this id.
290 * NOTE: we set key.offset = 0; because we want to start with the
291 * first xattr that we find and walk forward
292 */
293 key.objectid = btrfs_ino(BTRFS_I(inode));
294 key.type = BTRFS_XATTR_ITEM_KEY;
295 key.offset = 0;
296
297 path = btrfs_alloc_path();
298 if (!path)
299 return -ENOMEM;
300 path->reada = READA_FORWARD;
301
302 /* search for our xattrs */
303 btrfs_for_each_slot(root, &key, &found_key, path, iter_ret) {
304 struct extent_buffer *leaf;
305 int slot;
306 struct btrfs_dir_item *di;
307 u32 item_size;
308 u32 cur;
309
310 leaf = path->nodes[0];
311 slot = path->slots[0];
312
313 /* check to make sure this item is what we want */
314 if (found_key.objectid != key.objectid)
315 break;
316 if (found_key.type > BTRFS_XATTR_ITEM_KEY)
317 break;
318 if (found_key.type < BTRFS_XATTR_ITEM_KEY)
319 continue;
320
321 di = btrfs_item_ptr(leaf, slot, struct btrfs_dir_item);
322 item_size = btrfs_item_size(leaf, slot);
323 cur = 0;
324 while (cur < item_size) {
325 u16 name_len = btrfs_dir_name_len(leaf, di);
326 u16 data_len = btrfs_dir_data_len(leaf, di);
327 u32 this_len = sizeof(*di) + name_len + data_len;
328 unsigned long name_ptr = (unsigned long)(di + 1);
329
330 total_size += name_len + 1;
331 /*
332 * We are just looking for how big our buffer needs to
333 * be.
334 */
335 if (!size)
336 goto next;
337
338 if (!buffer || (name_len + 1) > size_left) {
339 iter_ret = -ERANGE;
340 break;
341 }
342
343 read_extent_buffer(leaf, buffer, name_ptr, name_len);
344 buffer[name_len] = '\0';
345
346 size_left -= name_len + 1;
347 buffer += name_len + 1;
348next:
349 cur += this_len;
350 di = (struct btrfs_dir_item *)((char *)di + this_len);
351 }
352 }
353
354 if (iter_ret < 0)
355 ret = iter_ret;
356 else
357 ret = total_size;
358
359 btrfs_free_path(path);
360
361 return ret;
362}
363
364static int btrfs_xattr_handler_get(const struct xattr_handler *handler,
365 struct dentry *unused, struct inode *inode,
366 const char *name, void *buffer, size_t size)
367{
368 name = xattr_full_name(handler, name);
369 return btrfs_getxattr(inode, name, buffer, size);
370}
371
372static int btrfs_xattr_handler_set(const struct xattr_handler *handler,
373 struct user_namespace *mnt_userns,
374 struct dentry *unused, struct inode *inode,
375 const char *name, const void *buffer,
376 size_t size, int flags)
377{
378 if (btrfs_root_readonly(BTRFS_I(inode)->root))
379 return -EROFS;
380
381 name = xattr_full_name(handler, name);
382 return btrfs_setxattr_trans(inode, name, buffer, size, flags);
383}
384
385static int btrfs_xattr_handler_set_prop(const struct xattr_handler *handler,
386 struct user_namespace *mnt_userns,
387 struct dentry *unused, struct inode *inode,
388 const char *name, const void *value,
389 size_t size, int flags)
390{
391 int ret;
392 struct btrfs_trans_handle *trans;
393 struct btrfs_root *root = BTRFS_I(inode)->root;
394
395 name = xattr_full_name(handler, name);
396 ret = btrfs_validate_prop(BTRFS_I(inode), name, value, size);
397 if (ret)
398 return ret;
399
400 if (btrfs_ignore_prop(BTRFS_I(inode), name))
401 return 0;
402
403 trans = btrfs_start_transaction(root, 2);
404 if (IS_ERR(trans))
405 return PTR_ERR(trans);
406
407 ret = btrfs_set_prop(trans, inode, name, value, size, flags);
408 if (!ret) {
409 inode_inc_iversion(inode);
410 inode->i_ctime = current_time(inode);
411 ret = btrfs_update_inode(trans, root, BTRFS_I(inode));
412 if (ret)
413 btrfs_abort_transaction(trans, ret);
414 }
415
416 btrfs_end_transaction(trans);
417
418 return ret;
419}
420
421static const struct xattr_handler btrfs_security_xattr_handler = {
422 .prefix = XATTR_SECURITY_PREFIX,
423 .get = btrfs_xattr_handler_get,
424 .set = btrfs_xattr_handler_set,
425};
426
427static const struct xattr_handler btrfs_trusted_xattr_handler = {
428 .prefix = XATTR_TRUSTED_PREFIX,
429 .get = btrfs_xattr_handler_get,
430 .set = btrfs_xattr_handler_set,
431};
432
433static const struct xattr_handler btrfs_user_xattr_handler = {
434 .prefix = XATTR_USER_PREFIX,
435 .get = btrfs_xattr_handler_get,
436 .set = btrfs_xattr_handler_set,
437};
438
439static const struct xattr_handler btrfs_btrfs_xattr_handler = {
440 .prefix = XATTR_BTRFS_PREFIX,
441 .get = btrfs_xattr_handler_get,
442 .set = btrfs_xattr_handler_set_prop,
443};
444
445const struct xattr_handler *btrfs_xattr_handlers[] = {
446 &btrfs_security_xattr_handler,
447#ifdef CONFIG_BTRFS_FS_POSIX_ACL
448 &posix_acl_access_xattr_handler,
449 &posix_acl_default_xattr_handler,
450#endif
451 &btrfs_trusted_xattr_handler,
452 &btrfs_user_xattr_handler,
453 &btrfs_btrfs_xattr_handler,
454 NULL,
455};
456
457static int btrfs_initxattrs(struct inode *inode,
458 const struct xattr *xattr_array, void *fs_private)
459{
460 struct btrfs_trans_handle *trans = fs_private;
461 const struct xattr *xattr;
462 unsigned int nofs_flag;
463 char *name;
464 int err = 0;
465
466 /*
467 * We're holding a transaction handle, so use a NOFS memory allocation
468 * context to avoid deadlock if reclaim happens.
469 */
470 nofs_flag = memalloc_nofs_save();
471 for (xattr = xattr_array; xattr->name != NULL; xattr++) {
472 name = kmalloc(XATTR_SECURITY_PREFIX_LEN +
473 strlen(xattr->name) + 1, GFP_KERNEL);
474 if (!name) {
475 err = -ENOMEM;
476 break;
477 }
478 strcpy(name, XATTR_SECURITY_PREFIX);
479 strcpy(name + XATTR_SECURITY_PREFIX_LEN, xattr->name);
480 err = btrfs_setxattr(trans, inode, name, xattr->value,
481 xattr->value_len, 0);
482 kfree(name);
483 if (err < 0)
484 break;
485 }
486 memalloc_nofs_restore(nofs_flag);
487 return err;
488}
489
490int btrfs_xattr_security_init(struct btrfs_trans_handle *trans,
491 struct inode *inode, struct inode *dir,
492 const struct qstr *qstr)
493{
494 return security_inode_init_security(inode, dir, qstr,
495 &btrfs_initxattrs, trans);
496}
1/*
2 * Copyright (C) 2007 Red Hat. 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 <linux/init.h>
20#include <linux/fs.h>
21#include <linux/slab.h>
22#include <linux/rwsem.h>
23#include <linux/xattr.h>
24#include <linux/security.h>
25#include <linux/posix_acl_xattr.h>
26#include "ctree.h"
27#include "btrfs_inode.h"
28#include "transaction.h"
29#include "xattr.h"
30#include "disk-io.h"
31#include "props.h"
32#include "locking.h"
33
34
35ssize_t __btrfs_getxattr(struct inode *inode, const char *name,
36 void *buffer, size_t size)
37{
38 struct btrfs_dir_item *di;
39 struct btrfs_root *root = BTRFS_I(inode)->root;
40 struct btrfs_path *path;
41 struct extent_buffer *leaf;
42 int ret = 0;
43 unsigned long data_ptr;
44
45 path = btrfs_alloc_path();
46 if (!path)
47 return -ENOMEM;
48
49 /* lookup the xattr by name */
50 di = btrfs_lookup_xattr(NULL, root, path, btrfs_ino(inode), name,
51 strlen(name), 0);
52 if (!di) {
53 ret = -ENODATA;
54 goto out;
55 } else if (IS_ERR(di)) {
56 ret = PTR_ERR(di);
57 goto out;
58 }
59
60 leaf = path->nodes[0];
61 /* if size is 0, that means we want the size of the attr */
62 if (!size) {
63 ret = btrfs_dir_data_len(leaf, di);
64 goto out;
65 }
66
67 /* now get the data out of our dir_item */
68 if (btrfs_dir_data_len(leaf, di) > size) {
69 ret = -ERANGE;
70 goto out;
71 }
72
73 /*
74 * The way things are packed into the leaf is like this
75 * |struct btrfs_dir_item|name|data|
76 * where name is the xattr name, so security.foo, and data is the
77 * content of the xattr. data_ptr points to the location in memory
78 * where the data starts in the in memory leaf
79 */
80 data_ptr = (unsigned long)((char *)(di + 1) +
81 btrfs_dir_name_len(leaf, di));
82 read_extent_buffer(leaf, buffer, data_ptr,
83 btrfs_dir_data_len(leaf, di));
84 ret = btrfs_dir_data_len(leaf, di);
85
86out:
87 btrfs_free_path(path);
88 return ret;
89}
90
91static int do_setxattr(struct btrfs_trans_handle *trans,
92 struct inode *inode, const char *name,
93 const void *value, size_t size, int flags)
94{
95 struct btrfs_dir_item *di = NULL;
96 struct btrfs_root *root = BTRFS_I(inode)->root;
97 struct btrfs_fs_info *fs_info = root->fs_info;
98 struct btrfs_path *path;
99 size_t name_len = strlen(name);
100 int ret = 0;
101
102 if (name_len + size > BTRFS_MAX_XATTR_SIZE(root->fs_info))
103 return -ENOSPC;
104
105 path = btrfs_alloc_path();
106 if (!path)
107 return -ENOMEM;
108 path->skip_release_on_error = 1;
109
110 if (!value) {
111 di = btrfs_lookup_xattr(trans, root, path, btrfs_ino(inode),
112 name, name_len, -1);
113 if (!di && (flags & XATTR_REPLACE))
114 ret = -ENODATA;
115 else if (IS_ERR(di))
116 ret = PTR_ERR(di);
117 else if (di)
118 ret = btrfs_delete_one_dir_name(trans, root, path, di);
119 goto out;
120 }
121
122 /*
123 * For a replace we can't just do the insert blindly.
124 * Do a lookup first (read-only btrfs_search_slot), and return if xattr
125 * doesn't exist. If it exists, fall down below to the insert/replace
126 * path - we can't race with a concurrent xattr delete, because the VFS
127 * locks the inode's i_mutex before calling setxattr or removexattr.
128 */
129 if (flags & XATTR_REPLACE) {
130 ASSERT(inode_is_locked(inode));
131 di = btrfs_lookup_xattr(NULL, root, path, btrfs_ino(inode),
132 name, name_len, 0);
133 if (!di)
134 ret = -ENODATA;
135 else if (IS_ERR(di))
136 ret = PTR_ERR(di);
137 if (ret)
138 goto out;
139 btrfs_release_path(path);
140 di = NULL;
141 }
142
143 ret = btrfs_insert_xattr_item(trans, root, path, btrfs_ino(inode),
144 name, name_len, value, size);
145 if (ret == -EOVERFLOW) {
146 /*
147 * We have an existing item in a leaf, split_leaf couldn't
148 * expand it. That item might have or not a dir_item that
149 * matches our target xattr, so lets check.
150 */
151 ret = 0;
152 btrfs_assert_tree_locked(path->nodes[0]);
153 di = btrfs_match_dir_item_name(fs_info, path, name, name_len);
154 if (!di && !(flags & XATTR_REPLACE)) {
155 ret = -ENOSPC;
156 goto out;
157 }
158 } else if (ret == -EEXIST) {
159 ret = 0;
160 di = btrfs_match_dir_item_name(fs_info, path, name, name_len);
161 ASSERT(di); /* logic error */
162 } else if (ret) {
163 goto out;
164 }
165
166 if (di && (flags & XATTR_CREATE)) {
167 ret = -EEXIST;
168 goto out;
169 }
170
171 if (di) {
172 /*
173 * We're doing a replace, and it must be atomic, that is, at
174 * any point in time we have either the old or the new xattr
175 * value in the tree. We don't want readers (getxattr and
176 * listxattrs) to miss a value, this is specially important
177 * for ACLs.
178 */
179 const int slot = path->slots[0];
180 struct extent_buffer *leaf = path->nodes[0];
181 const u16 old_data_len = btrfs_dir_data_len(leaf, di);
182 const u32 item_size = btrfs_item_size_nr(leaf, slot);
183 const u32 data_size = sizeof(*di) + name_len + size;
184 struct btrfs_item *item;
185 unsigned long data_ptr;
186 char *ptr;
187
188 if (size > old_data_len) {
189 if (btrfs_leaf_free_space(fs_info, leaf) <
190 (size - old_data_len)) {
191 ret = -ENOSPC;
192 goto out;
193 }
194 }
195
196 if (old_data_len + name_len + sizeof(*di) == item_size) {
197 /* No other xattrs packed in the same leaf item. */
198 if (size > old_data_len)
199 btrfs_extend_item(fs_info, path,
200 size - old_data_len);
201 else if (size < old_data_len)
202 btrfs_truncate_item(fs_info, path,
203 data_size, 1);
204 } else {
205 /* There are other xattrs packed in the same item. */
206 ret = btrfs_delete_one_dir_name(trans, root, path, di);
207 if (ret)
208 goto out;
209 btrfs_extend_item(fs_info, path, data_size);
210 }
211
212 item = btrfs_item_nr(slot);
213 ptr = btrfs_item_ptr(leaf, slot, char);
214 ptr += btrfs_item_size(leaf, item) - data_size;
215 di = (struct btrfs_dir_item *)ptr;
216 btrfs_set_dir_data_len(leaf, di, size);
217 data_ptr = ((unsigned long)(di + 1)) + name_len;
218 write_extent_buffer(leaf, value, data_ptr, size);
219 btrfs_mark_buffer_dirty(leaf);
220 } else {
221 /*
222 * Insert, and we had space for the xattr, so path->slots[0] is
223 * where our xattr dir_item is and btrfs_insert_xattr_item()
224 * filled it.
225 */
226 }
227out:
228 btrfs_free_path(path);
229 return ret;
230}
231
232/*
233 * @value: "" makes the attribute to empty, NULL removes it
234 */
235int __btrfs_setxattr(struct btrfs_trans_handle *trans,
236 struct inode *inode, const char *name,
237 const void *value, size_t size, int flags)
238{
239 struct btrfs_root *root = BTRFS_I(inode)->root;
240 int ret;
241
242 if (btrfs_root_readonly(root))
243 return -EROFS;
244
245 if (trans)
246 return do_setxattr(trans, inode, name, value, size, flags);
247
248 trans = btrfs_start_transaction(root, 2);
249 if (IS_ERR(trans))
250 return PTR_ERR(trans);
251
252 ret = do_setxattr(trans, inode, name, value, size, flags);
253 if (ret)
254 goto out;
255
256 inode_inc_iversion(inode);
257 inode->i_ctime = current_time(inode);
258 set_bit(BTRFS_INODE_COPY_EVERYTHING, &BTRFS_I(inode)->runtime_flags);
259 ret = btrfs_update_inode(trans, root, inode);
260 BUG_ON(ret);
261out:
262 btrfs_end_transaction(trans);
263 return ret;
264}
265
266ssize_t btrfs_listxattr(struct dentry *dentry, char *buffer, size_t size)
267{
268 struct btrfs_key key;
269 struct inode *inode = d_inode(dentry);
270 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
271 struct btrfs_root *root = BTRFS_I(inode)->root;
272 struct btrfs_path *path;
273 int ret = 0;
274 size_t total_size = 0, size_left = size;
275
276 /*
277 * ok we want all objects associated with this id.
278 * NOTE: we set key.offset = 0; because we want to start with the
279 * first xattr that we find and walk forward
280 */
281 key.objectid = btrfs_ino(inode);
282 key.type = BTRFS_XATTR_ITEM_KEY;
283 key.offset = 0;
284
285 path = btrfs_alloc_path();
286 if (!path)
287 return -ENOMEM;
288 path->reada = READA_FORWARD;
289
290 /* search for our xattrs */
291 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
292 if (ret < 0)
293 goto err;
294
295 while (1) {
296 struct extent_buffer *leaf;
297 int slot;
298 struct btrfs_dir_item *di;
299 struct btrfs_key found_key;
300 u32 item_size;
301 u32 cur;
302
303 leaf = path->nodes[0];
304 slot = path->slots[0];
305
306 /* this is where we start walking through the path */
307 if (slot >= btrfs_header_nritems(leaf)) {
308 /*
309 * if we've reached the last slot in this leaf we need
310 * to go to the next leaf and reset everything
311 */
312 ret = btrfs_next_leaf(root, path);
313 if (ret < 0)
314 goto err;
315 else if (ret > 0)
316 break;
317 continue;
318 }
319
320 btrfs_item_key_to_cpu(leaf, &found_key, slot);
321
322 /* check to make sure this item is what we want */
323 if (found_key.objectid != key.objectid)
324 break;
325 if (found_key.type > BTRFS_XATTR_ITEM_KEY)
326 break;
327 if (found_key.type < BTRFS_XATTR_ITEM_KEY)
328 goto next_item;
329
330 di = btrfs_item_ptr(leaf, slot, struct btrfs_dir_item);
331 item_size = btrfs_item_size_nr(leaf, slot);
332 cur = 0;
333 while (cur < item_size) {
334 u16 name_len = btrfs_dir_name_len(leaf, di);
335 u16 data_len = btrfs_dir_data_len(leaf, di);
336 u32 this_len = sizeof(*di) + name_len + data_len;
337 unsigned long name_ptr = (unsigned long)(di + 1);
338
339 if (verify_dir_item(fs_info, leaf, di)) {
340 ret = -EIO;
341 goto err;
342 }
343
344 total_size += name_len + 1;
345 /*
346 * We are just looking for how big our buffer needs to
347 * be.
348 */
349 if (!size)
350 goto next;
351
352 if (!buffer || (name_len + 1) > size_left) {
353 ret = -ERANGE;
354 goto err;
355 }
356
357 read_extent_buffer(leaf, buffer, name_ptr, name_len);
358 buffer[name_len] = '\0';
359
360 size_left -= name_len + 1;
361 buffer += name_len + 1;
362next:
363 cur += this_len;
364 di = (struct btrfs_dir_item *)((char *)di + this_len);
365 }
366next_item:
367 path->slots[0]++;
368 }
369 ret = total_size;
370
371err:
372 btrfs_free_path(path);
373
374 return ret;
375}
376
377static int btrfs_xattr_handler_get(const struct xattr_handler *handler,
378 struct dentry *unused, struct inode *inode,
379 const char *name, void *buffer, size_t size)
380{
381 name = xattr_full_name(handler, name);
382 return __btrfs_getxattr(inode, name, buffer, size);
383}
384
385static int btrfs_xattr_handler_set(const struct xattr_handler *handler,
386 struct dentry *unused, struct inode *inode,
387 const char *name, const void *buffer,
388 size_t size, int flags)
389{
390 name = xattr_full_name(handler, name);
391 return __btrfs_setxattr(NULL, inode, name, buffer, size, flags);
392}
393
394static int btrfs_xattr_handler_set_prop(const struct xattr_handler *handler,
395 struct dentry *unused, struct inode *inode,
396 const char *name, const void *value,
397 size_t size, int flags)
398{
399 name = xattr_full_name(handler, name);
400 return btrfs_set_prop(inode, name, value, size, flags);
401}
402
403static const struct xattr_handler btrfs_security_xattr_handler = {
404 .prefix = XATTR_SECURITY_PREFIX,
405 .get = btrfs_xattr_handler_get,
406 .set = btrfs_xattr_handler_set,
407};
408
409static const struct xattr_handler btrfs_trusted_xattr_handler = {
410 .prefix = XATTR_TRUSTED_PREFIX,
411 .get = btrfs_xattr_handler_get,
412 .set = btrfs_xattr_handler_set,
413};
414
415static const struct xattr_handler btrfs_user_xattr_handler = {
416 .prefix = XATTR_USER_PREFIX,
417 .get = btrfs_xattr_handler_get,
418 .set = btrfs_xattr_handler_set,
419};
420
421static const struct xattr_handler btrfs_btrfs_xattr_handler = {
422 .prefix = XATTR_BTRFS_PREFIX,
423 .get = btrfs_xattr_handler_get,
424 .set = btrfs_xattr_handler_set_prop,
425};
426
427const struct xattr_handler *btrfs_xattr_handlers[] = {
428 &btrfs_security_xattr_handler,
429#ifdef CONFIG_BTRFS_FS_POSIX_ACL
430 &posix_acl_access_xattr_handler,
431 &posix_acl_default_xattr_handler,
432#endif
433 &btrfs_trusted_xattr_handler,
434 &btrfs_user_xattr_handler,
435 &btrfs_btrfs_xattr_handler,
436 NULL,
437};
438
439static int btrfs_initxattrs(struct inode *inode,
440 const struct xattr *xattr_array, void *fs_info)
441{
442 const struct xattr *xattr;
443 struct btrfs_trans_handle *trans = fs_info;
444 char *name;
445 int err = 0;
446
447 for (xattr = xattr_array; xattr->name != NULL; xattr++) {
448 name = kmalloc(XATTR_SECURITY_PREFIX_LEN +
449 strlen(xattr->name) + 1, GFP_KERNEL);
450 if (!name) {
451 err = -ENOMEM;
452 break;
453 }
454 strcpy(name, XATTR_SECURITY_PREFIX);
455 strcpy(name + XATTR_SECURITY_PREFIX_LEN, xattr->name);
456 err = __btrfs_setxattr(trans, inode, name,
457 xattr->value, xattr->value_len, 0);
458 kfree(name);
459 if (err < 0)
460 break;
461 }
462 return err;
463}
464
465int btrfs_xattr_security_init(struct btrfs_trans_handle *trans,
466 struct inode *inode, struct inode *dir,
467 const struct qstr *qstr)
468{
469 return security_inode_init_security(inode, dir, qstr,
470 &btrfs_initxattrs, trans);
471}