2 * Copyright (C) 2007 Red Hat. All rights reserved.
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.
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.
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.
19 #include <linux/init.h>
21 #include <linux/slab.h>
22 #include <linux/rwsem.h>
23 #include <linux/xattr.h>
24 #include <linux/security.h>
26 #include "btrfs_inode.h"
27 #include "transaction.h"
32 ssize_t __btrfs_getxattr(struct inode *inode, const char *name,
33 void *buffer, size_t size)
35 struct btrfs_dir_item *di;
36 struct btrfs_root *root = BTRFS_I(inode)->root;
37 struct btrfs_path *path;
38 struct extent_buffer *leaf;
40 unsigned long data_ptr;
42 path = btrfs_alloc_path();
46 /* lookup the xattr by name */
47 di = btrfs_lookup_xattr(NULL, root, path, btrfs_ino(inode), name,
52 } else if (IS_ERR(di)) {
57 leaf = path->nodes[0];
58 /* if size is 0, that means we want the size of the attr */
60 ret = btrfs_dir_data_len(leaf, di);
64 /* now get the data out of our dir_item */
65 if (btrfs_dir_data_len(leaf, di) > size) {
71 * The way things are packed into the leaf is like this
72 * |struct btrfs_dir_item|name|data|
73 * where name is the xattr name, so security.foo, and data is the
74 * content of the xattr. data_ptr points to the location in memory
75 * where the data starts in the in memory leaf
77 data_ptr = (unsigned long)((char *)(di + 1) +
78 btrfs_dir_name_len(leaf, di));
79 read_extent_buffer(leaf, buffer, data_ptr,
80 btrfs_dir_data_len(leaf, di));
81 ret = btrfs_dir_data_len(leaf, di);
84 btrfs_free_path(path);
88 static int do_setxattr(struct btrfs_trans_handle *trans,
89 struct inode *inode, const char *name,
90 const void *value, size_t size, int flags)
92 struct btrfs_dir_item *di;
93 struct btrfs_root *root = BTRFS_I(inode)->root;
94 struct btrfs_path *path;
95 size_t name_len = strlen(name);
98 if (name_len + size > BTRFS_MAX_XATTR_SIZE(root))
101 path = btrfs_alloc_path();
105 if (flags & XATTR_REPLACE) {
106 di = btrfs_lookup_xattr(trans, root, path, btrfs_ino(inode), name,
115 ret = btrfs_delete_one_dir_name(trans, root, path, di);
118 btrfs_release_path(path);
121 * remove the attribute
126 di = btrfs_lookup_xattr(NULL, root, path, btrfs_ino(inode),
134 btrfs_release_path(path);
138 ret = btrfs_insert_xattr_item(trans, root, path, btrfs_ino(inode),
139 name, name_len, value, size);
141 * If we're setting an xattr to a new value but the new value is say
142 * exactly BTRFS_MAX_XATTR_SIZE, we could end up with EOVERFLOW getting
143 * back from split_leaf. This is because it thinks we'll be extending
144 * the existing item size, but we're asking for enough space to add the
145 * item itself. So if we get EOVERFLOW just set ret to EEXIST and let
146 * the rest of the function figure it out.
148 if (ret == -EOVERFLOW)
151 if (ret == -EEXIST) {
152 if (flags & XATTR_CREATE)
155 * We can't use the path we already have since we won't have the
156 * proper locking for a delete, so release the path and
157 * re-lookup to delete the thing.
159 btrfs_release_path(path);
160 di = btrfs_lookup_xattr(trans, root, path, btrfs_ino(inode),
166 /* Shouldn't happen but just in case... */
167 btrfs_release_path(path);
171 ret = btrfs_delete_one_dir_name(trans, root, path, di);
176 * We have a value to set, so go back and try to insert it now.
179 btrfs_release_path(path);
184 btrfs_free_path(path);
189 * @value: "" makes the attribute to empty, NULL removes it
191 int __btrfs_setxattr(struct btrfs_trans_handle *trans,
192 struct inode *inode, const char *name,
193 const void *value, size_t size, int flags)
195 struct btrfs_root *root = BTRFS_I(inode)->root;
199 return do_setxattr(trans, inode, name, value, size, flags);
201 trans = btrfs_start_transaction(root, 2);
203 return PTR_ERR(trans);
205 ret = do_setxattr(trans, inode, name, value, size, flags);
209 inode_inc_iversion(inode);
210 inode->i_ctime = CURRENT_TIME;
211 set_bit(BTRFS_INODE_COPY_EVERYTHING, &BTRFS_I(inode)->runtime_flags);
212 ret = btrfs_update_inode(trans, root, inode);
215 btrfs_end_transaction(trans, root);
219 ssize_t btrfs_listxattr(struct dentry *dentry, char *buffer, size_t size)
221 struct btrfs_key key, found_key;
222 struct inode *inode = dentry->d_inode;
223 struct btrfs_root *root = BTRFS_I(inode)->root;
224 struct btrfs_path *path;
225 struct extent_buffer *leaf;
226 struct btrfs_dir_item *di;
228 size_t total_size = 0, size_left = size;
229 unsigned long name_ptr;
233 * ok we want all objects associated with this id.
234 * NOTE: we set key.offset = 0; because we want to start with the
235 * first xattr that we find and walk forward
237 key.objectid = btrfs_ino(inode);
238 btrfs_set_key_type(&key, BTRFS_XATTR_ITEM_KEY);
241 path = btrfs_alloc_path();
246 /* search for our xattrs */
247 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
252 leaf = path->nodes[0];
253 slot = path->slots[0];
255 /* this is where we start walking through the path */
256 if (slot >= btrfs_header_nritems(leaf)) {
258 * if we've reached the last slot in this leaf we need
259 * to go to the next leaf and reset everything
261 ret = btrfs_next_leaf(root, path);
269 btrfs_item_key_to_cpu(leaf, &found_key, slot);
271 /* check to make sure this item is what we want */
272 if (found_key.objectid != key.objectid)
274 if (btrfs_key_type(&found_key) != BTRFS_XATTR_ITEM_KEY)
277 di = btrfs_item_ptr(leaf, slot, struct btrfs_dir_item);
278 if (verify_dir_item(root, leaf, di))
281 name_len = btrfs_dir_name_len(leaf, di);
282 total_size += name_len + 1;
284 /* we are just looking for how big our buffer needs to be */
288 if (!buffer || (name_len + 1) > size_left) {
293 name_ptr = (unsigned long)(di + 1);
294 read_extent_buffer(leaf, buffer, name_ptr, name_len);
295 buffer[name_len] = '\0';
297 size_left -= name_len + 1;
298 buffer += name_len + 1;
305 btrfs_free_path(path);
311 * List of handlers for synthetic system.* attributes. All real ondisk
312 * attributes are handled directly.
314 const struct xattr_handler *btrfs_xattr_handlers[] = {
315 #ifdef CONFIG_BTRFS_FS_POSIX_ACL
316 &btrfs_xattr_acl_access_handler,
317 &btrfs_xattr_acl_default_handler,
323 * Check if the attribute is in a supported namespace.
325 * This applied after the check for the synthetic attributes in the system
328 static bool btrfs_is_valid_xattr(const char *name)
330 return !strncmp(name, XATTR_SECURITY_PREFIX,
331 XATTR_SECURITY_PREFIX_LEN) ||
332 !strncmp(name, XATTR_SYSTEM_PREFIX, XATTR_SYSTEM_PREFIX_LEN) ||
333 !strncmp(name, XATTR_TRUSTED_PREFIX, XATTR_TRUSTED_PREFIX_LEN) ||
334 !strncmp(name, XATTR_USER_PREFIX, XATTR_USER_PREFIX_LEN);
337 ssize_t btrfs_getxattr(struct dentry *dentry, const char *name,
338 void *buffer, size_t size)
341 * If this is a request for a synthetic attribute in the system.*
342 * namespace use the generic infrastructure to resolve a handler
343 * for it via sb->s_xattr.
345 if (!strncmp(name, XATTR_SYSTEM_PREFIX, XATTR_SYSTEM_PREFIX_LEN))
346 return generic_getxattr(dentry, name, buffer, size);
348 if (!btrfs_is_valid_xattr(name))
350 return __btrfs_getxattr(dentry->d_inode, name, buffer, size);
353 int btrfs_setxattr(struct dentry *dentry, const char *name, const void *value,
354 size_t size, int flags)
356 struct btrfs_root *root = BTRFS_I(dentry->d_inode)->root;
359 * The permission on security.* and system.* is not checked
362 if (btrfs_root_readonly(root))
366 * If this is a request for a synthetic attribute in the system.*
367 * namespace use the generic infrastructure to resolve a handler
368 * for it via sb->s_xattr.
370 if (!strncmp(name, XATTR_SYSTEM_PREFIX, XATTR_SYSTEM_PREFIX_LEN))
371 return generic_setxattr(dentry, name, value, size, flags);
373 if (!btrfs_is_valid_xattr(name))
377 value = ""; /* empty EA, do not remove */
379 return __btrfs_setxattr(NULL, dentry->d_inode, name, value, size,
383 int btrfs_removexattr(struct dentry *dentry, const char *name)
385 struct btrfs_root *root = BTRFS_I(dentry->d_inode)->root;
388 * The permission on security.* and system.* is not checked
391 if (btrfs_root_readonly(root))
395 * If this is a request for a synthetic attribute in the system.*
396 * namespace use the generic infrastructure to resolve a handler
397 * for it via sb->s_xattr.
399 if (!strncmp(name, XATTR_SYSTEM_PREFIX, XATTR_SYSTEM_PREFIX_LEN))
400 return generic_removexattr(dentry, name);
402 if (!btrfs_is_valid_xattr(name))
405 return __btrfs_setxattr(NULL, dentry->d_inode, name, NULL, 0,
409 static int btrfs_initxattrs(struct inode *inode,
410 const struct xattr *xattr_array, void *fs_info)
412 const struct xattr *xattr;
413 struct btrfs_trans_handle *trans = fs_info;
417 for (xattr = xattr_array; xattr->name != NULL; xattr++) {
418 name = kmalloc(XATTR_SECURITY_PREFIX_LEN +
419 strlen(xattr->name) + 1, GFP_NOFS);
424 strcpy(name, XATTR_SECURITY_PREFIX);
425 strcpy(name + XATTR_SECURITY_PREFIX_LEN, xattr->name);
426 err = __btrfs_setxattr(trans, inode, name,
427 xattr->value, xattr->value_len, 0);
435 int btrfs_xattr_security_init(struct btrfs_trans_handle *trans,
436 struct inode *inode, struct inode *dir,
437 const struct qstr *qstr)
439 return security_inode_init_security(inode, dir, qstr,
440 &btrfs_initxattrs, trans);