[deliverable/linux.git] / fs / btrfs / xattr.c

/*
 * Copyright (C) 2007 Red Hat.  All rights reserved.
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public
 * License v2 as published by the Free Software Foundation.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
 * General Public License for more details.
 *
 * You should have received a copy of the GNU General Public
 * License along with this program; if not, write to the
 * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
 * Boston, MA 021110-1307, USA.
 */

#include <linux/init.h>
#include <linux/fs.h>
#include <linux/slab.h>
#include <linux/rwsem.h>
#include <linux/xattr.h>
#include <linux/security.h>
#include "ctree.h"
#include "btrfs_inode.h"
#include "transaction.h"
#include "xattr.h"
#include "disk-io.h"


ssize_t __btrfs_getxattr(struct inode *inode, const char *name,
				void *buffer, size_t size)
{
	struct btrfs_dir_item *di;
	struct btrfs_root *root = BTRFS_I(inode)->root;
	struct btrfs_path *path;
	struct extent_buffer *leaf;
	int ret = 0;
	unsigned long data_ptr;

	path = btrfs_alloc_path();
	if (!path)
		return -ENOMEM;

	/* lookup the xattr by name */
	di = btrfs_lookup_xattr(NULL, root, path, inode->i_ino, name,
				strlen(name), 0);
	if (!di) {
		ret = -ENODATA;
		goto out;
	} else if (IS_ERR(di)) {
		ret = PTR_ERR(di);
		goto out;
	}

	leaf = path->nodes[0];
	/* if size is 0, that means we want the size of the attr */
	if (!size) {
		ret = btrfs_dir_data_len(leaf, di);
		goto out;
	}

	/* now get the data out of our dir_item */
	if (btrfs_dir_data_len(leaf, di) > size) {
		ret = -ERANGE;
		goto out;
	}

	/*
	 * The way things are packed into the leaf is like this
	 * |struct btrfs_dir_item|name|data|
	 * where name is the xattr name, so security.foo, and data is the
	 * content of the xattr.  data_ptr points to the location in memory
	 * where the data starts in the in memory leaf
	 */
	data_ptr = (unsigned long)((char *)(di + 1) +
				   btrfs_dir_name_len(leaf, di));
	read_extent_buffer(leaf, buffer, data_ptr,
			   btrfs_dir_data_len(leaf, di));
	ret = btrfs_dir_data_len(leaf, di);

out:
	btrfs_free_path(path);
	return ret;
}

int __btrfs_setxattr(struct inode *inode, const char *name,
			    const void *value, size_t size, int flags)
{
	struct btrfs_dir_item *di;
	struct btrfs_root *root = BTRFS_I(inode)->root;
	struct btrfs_trans_handle *trans;
	struct btrfs_path *path;
	int ret = 0, mod = 0;

	path = btrfs_alloc_path();
	if (!path)
		return -ENOMEM;

	trans = btrfs_join_transaction(root, 1);
	btrfs_set_trans_block_group(trans, inode);

	/* first lets see if we already have this xattr */
	di = btrfs_lookup_xattr(trans, root, path, inode->i_ino, name,
				strlen(name), -1);
	if (IS_ERR(di)) {
		ret = PTR_ERR(di);
		goto out;
	}

	/* ok we already have this xattr, lets remove it */
	if (di) {
		/* if we want create only exit */
		if (flags & XATTR_CREATE) {
			ret = -EEXIST;
			goto out;
		}

		ret = btrfs_delete_one_dir_name(trans, root, path, di);
		if (ret)
			goto out;
		btrfs_release_path(root, path);

		/* if we don't have a value then we are removing the xattr */
		if (!value) {
			mod = 1;
			goto out;
		}
	} else {
		btrfs_release_path(root, path);

		if (flags & XATTR_REPLACE) {
			/* we couldn't find the attr to replace */
			ret = -ENODATA;
			goto out;
		}
	}

	/* ok we have to create a completely new xattr */
	ret = btrfs_insert_xattr_item(trans, root, name, strlen(name),
				      value, size, inode->i_ino);
	if (ret)
		goto out;
	mod = 1;

out:
	if (mod) {
		inode->i_ctime = CURRENT_TIME;
		ret = btrfs_update_inode(trans, root, inode);
	}

	btrfs_end_transaction(trans, root);
	btrfs_free_path(path);
	return ret;
}

ssize_t btrfs_listxattr(struct dentry *dentry, char *buffer, size_t size)
{
	struct btrfs_key key, found_key;
	struct inode *inode = dentry->d_inode;
	struct btrfs_root *root = BTRFS_I(inode)->root;
	struct btrfs_path *path;
	struct btrfs_item *item;
	struct extent_buffer *leaf;
	struct btrfs_dir_item *di;
	int ret = 0, slot, advance;
	size_t total_size = 0, size_left = size;
	unsigned long name_ptr;
	size_t name_len;
	u32 nritems;

	/*
	 * ok we want all objects associated with this id.
	 * NOTE: we set key.offset = 0; because we want to start with the
	 * first xattr that we find and walk forward
	 */
	key.objectid = inode->i_ino;
	btrfs_set_key_type(&key, BTRFS_XATTR_ITEM_KEY);
	key.offset = 0;

	path = btrfs_alloc_path();
	if (!path)
		return -ENOMEM;
	path->reada = 2;

	/* search for our xattrs */
	ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
	if (ret < 0)
		goto err;
	advance = 0;
	while (1) {
		leaf = path->nodes[0];
		nritems = btrfs_header_nritems(leaf);
		slot = path->slots[0];

		/* this is where we start walking through the path */
		if (advance || slot >= nritems) {
			/*
			 * if we've reached the last slot in this leaf we need
			 * to go to the next leaf and reset everything
			 */
			if (slot >= nritems-1) {
				ret = btrfs_next_leaf(root, path);
				if (ret)
					break;
				leaf = path->nodes[0];
				nritems = btrfs_header_nritems(leaf);
				slot = path->slots[0];
			} else {
				/*
				 * just walking through the slots on this leaf
				 */
				slot++;
				path->slots[0]++;
			}
		}
		advance = 1;

		item = btrfs_item_nr(leaf, slot);
		btrfs_item_key_to_cpu(leaf, &found_key, slot);

		/* check to make sure this item is what we want */
		if (found_key.objectid != key.objectid)
			break;
		if (btrfs_key_type(&found_key) != BTRFS_XATTR_ITEM_KEY)
			break;

		di = btrfs_item_ptr(leaf, slot, struct btrfs_dir_item);

		name_len = btrfs_dir_name_len(leaf, di);
		total_size += name_len + 1;

		/* we are just looking for how big our buffer needs to be */
		if (!size)
			continue;

		if (!buffer || (name_len + 1) > size_left) {
			ret = -ERANGE;
			goto err;
		}

		name_ptr = (unsigned long)(di + 1);
		read_extent_buffer(leaf, buffer, name_ptr, name_len);
		buffer[name_len] = '\0';

		size_left -= name_len + 1;
		buffer += name_len + 1;
	}
	ret = total_size;

err:
	btrfs_free_path(path);

	return ret;
}

/*
 * List of handlers for synthetic system.* attributes.  All real ondisk
 * attributes are handled directly.
 */
struct xattr_handler *btrfs_xattr_handlers[] = {
#ifdef CONFIG_BTRFS_POSIX_ACL
	&btrfs_xattr_acl_access_handler,
	&btrfs_xattr_acl_default_handler,
#endif
	NULL,
};

/*
 * Check if the attribute is in a supported namespace.
 *
 * This applied after the check for the synthetic attributes in the system
 * namespace.
 */
static bool btrfs_is_valid_xattr(const char *name)
{
	return !strncmp(name, XATTR_SECURITY_PREFIX,
			XATTR_SECURITY_PREFIX_LEN) ||
	       !strncmp(name, XATTR_SYSTEM_PREFIX, XATTR_SYSTEM_PREFIX_LEN) ||
	       !strncmp(name, XATTR_TRUSTED_PREFIX, XATTR_TRUSTED_PREFIX_LEN) ||
	       !strncmp(name, XATTR_USER_PREFIX, XATTR_USER_PREFIX_LEN);
}

ssize_t btrfs_getxattr(struct dentry *dentry, const char *name,
		       void *buffer, size_t size)
{
	/*
	 * If this is a request for a synthetic attribute in the system.*
	 * namespace use the generic infrastructure to resolve a handler
	 * for it via sb->s_xattr.
	 */
	if (!strncmp(name, XATTR_SYSTEM_PREFIX, XATTR_SYSTEM_PREFIX_LEN))
		return generic_getxattr(dentry, name, buffer, size);

	if (!btrfs_is_valid_xattr(name))
		return -EOPNOTSUPP;
	return __btrfs_getxattr(dentry->d_inode, name, buffer, size);
}

int btrfs_setxattr(struct dentry *dentry, const char *name, const void *value,
		   size_t size, int flags)
{
	/*
	 * If this is a request for a synthetic attribute in the system.*
	 * namespace use the generic infrastructure to resolve a handler
	 * for it via sb->s_xattr.
	 */
	if (!strncmp(name, XATTR_SYSTEM_PREFIX, XATTR_SYSTEM_PREFIX_LEN))
		return generic_setxattr(dentry, name, value, size, flags);

	if (!btrfs_is_valid_xattr(name))
		return -EOPNOTSUPP;

	if (size == 0)
		value = "";  /* empty EA, do not remove */
	return __btrfs_setxattr(dentry->d_inode, name, value, size, flags);
}

int btrfs_removexattr(struct dentry *dentry, const char *name)
{
	/*
	 * If this is a request for a synthetic attribute in the system.*
	 * namespace use the generic infrastructure to resolve a handler
	 * for it via sb->s_xattr.
	 */
	if (!strncmp(name, XATTR_SYSTEM_PREFIX, XATTR_SYSTEM_PREFIX_LEN))
		return generic_removexattr(dentry, name);

	if (!btrfs_is_valid_xattr(name))
		return -EOPNOTSUPP;
	return __btrfs_setxattr(dentry->d_inode, name, NULL, 0, XATTR_REPLACE);
}

int btrfs_xattr_security_init(struct inode *inode, struct inode *dir)
{
	int err;
	size_t len;
	void *value;
	char *suffix;
	char *name;

	err = security_inode_init_security(inode, dir, &suffix, &value, &len);
	if (err) {
		if (err == -EOPNOTSUPP)
			return 0;
		return err;
	}

	name = kmalloc(XATTR_SECURITY_PREFIX_LEN + strlen(suffix) + 1,
		       GFP_NOFS);
	if (!name) {
		err = -ENOMEM;
	} else {
		strcpy(name, XATTR_SECURITY_PREFIX);
		strcpy(name + XATTR_SECURITY_PREFIX_LEN, suffix);
		err = __btrfs_setxattr(inode, name, value, len, 0);
		kfree(name);
	}

	kfree(suffix);
	kfree(value);
	return err;
}
Commit	Line	Data
5103e947 JB	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>
0279b4cd	24	#include <linux/security.h>
5103e947 JB	25	#include "ctree.h"
	26	#include "btrfs_inode.h"
	27	#include "transaction.h"
	28	#include "xattr.h"
	29	#include "disk-io.h"
33268eaf	30
5103e947	31
95819c05 CH	32	ssize_t __btrfs_getxattr(struct inode inode, const char name,
95819c05 CH	33	void *buffer, size_t size)
5103e947 JB	34	{
	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;
5103e947 JB	39	int ret = 0;
5103e947 JB	40	unsigned long data_ptr;
5103e947 JB	41
5103e947 JB	42	path = btrfs_alloc_path();
95819c05	43	if (!path)
5103e947	44	return -ENOMEM;
5103e947	45
5103e947 JB	46	/* lookup the xattr by name */
	47	di = btrfs_lookup_xattr(NULL, root, path, inode->i_ino, name,
	48	strlen(name), 0);
07060404	49	if (!di) {
5103e947 JB	50	ret = -ENODATA;
5103e947 JB	51	goto out;
07060404 JB	52	} else if (IS_ERR(di)) {
	53	ret = PTR_ERR(di);
	54	goto out;
5103e947 JB	55	}
	56
	57	leaf = path->nodes[0];
	58	/* if size is 0, that means we want the size of the attr */
	59	if (!size) {
	60	ret = btrfs_dir_data_len(leaf, di);
	61	goto out;
	62	}
	63
	64	/* now get the data out of our dir_item */
	65	if (btrfs_dir_data_len(leaf, di) > size) {
	66	ret = -ERANGE;
	67	goto out;
	68	}
07060404 JB	69
	70	/*
	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
	76	*/
5103e947 JB	77	data_ptr = (unsigned long)((char *)(di + 1) +
	78	btrfs_dir_name_len(leaf, di));
	79	read_extent_buffer(leaf, buffer, data_ptr,
3acd7ee8	80	btrfs_dir_data_len(leaf, di));
5103e947 JB	81	ret = btrfs_dir_data_len(leaf, di);
	82
	83	out:
5103e947 JB	84	btrfs_free_path(path);
	85	return ret;
	86	}
	87
95819c05 CH	88	int __btrfs_setxattr(struct inode inode, const char name,
95819c05 CH	89	const void *value, size_t size, int flags)
5103e947 JB	90	{
	91	struct btrfs_dir_item *di;
	92	struct btrfs_root *root = BTRFS_I(inode)->root;
	93	struct btrfs_trans_handle *trans;
	94	struct btrfs_path *path;
5103e947	95	int ret = 0, mod = 0;
5103e947 JB	96
5103e947 JB	97	path = btrfs_alloc_path();
95819c05	98	if (!path)
5103e947	99	return -ENOMEM;
5103e947	100
81144949	101	trans = btrfs_join_transaction(root, 1);
5103e947 JB	102	btrfs_set_trans_block_group(trans, inode);
	103
	104	/* first lets see if we already have this xattr */
	105	di = btrfs_lookup_xattr(trans, root, path, inode->i_ino, name,
	106	strlen(name), -1);
	107	if (IS_ERR(di)) {
	108	ret = PTR_ERR(di);
	109	goto out;
	110	}
	111
	112	/* ok we already have this xattr, lets remove it */
	113	if (di) {
	114	/* if we want create only exit */
	115	if (flags & XATTR_CREATE) {
	116	ret = -EEXIST;
	117	goto out;
	118	}
	119
	120	ret = btrfs_delete_one_dir_name(trans, root, path, di);
	121	if (ret)
	122	goto out;
	123	btrfs_release_path(root, path);
	124
	125	/* if we don't have a value then we are removing the xattr */
	126	if (!value) {
	127	mod = 1;
	128	goto out;
	129	}
33268eaf JB	130	} else {
	131	btrfs_release_path(root, path);
	132
	133	if (flags & XATTR_REPLACE) {
	134	/* we couldn't find the attr to replace */
	135	ret = -ENODATA;
	136	goto out;
	137	}
5103e947 JB	138	}
	139
	140	/* ok we have to create a completely new xattr */
	141	ret = btrfs_insert_xattr_item(trans, root, name, strlen(name),
	142	value, size, inode->i_ino);
	143	if (ret)
	144	goto out;
	145	mod = 1;
	146
	147	out:
	148	if (mod) {
	149	inode->i_ctime = CURRENT_TIME;
	150	ret = btrfs_update_inode(trans, root, inode);
	151	}
	152
	153	btrfs_end_transaction(trans, root);
5103e947	154	btrfs_free_path(path);
5103e947 JB	155	return ret;
	156	}
	157
	158	ssize_t btrfs_listxattr(struct dentry dentry, char buffer, size_t size)
	159	{
	160	struct btrfs_key key, found_key;
	161	struct inode *inode = dentry->d_inode;
	162	struct btrfs_root *root = BTRFS_I(inode)->root;
	163	struct btrfs_path *path;
	164	struct btrfs_item *item;
	165	struct extent_buffer *leaf;
	166	struct btrfs_dir_item *di;
5103e947	167	int ret = 0, slot, advance;
eaa47d86	168	size_t total_size = 0, size_left = size;
5103e947	169	unsigned long name_ptr;
eaa47d86	170	size_t name_len;
5103e947 JB	171	u32 nritems;
	172
	173	/*
	174	* ok we want all objects associated with this id.
	175	* NOTE: we set key.offset = 0; because we want to start with the
	176	* first xattr that we find and walk forward
	177	*/
	178	key.objectid = inode->i_ino;
	179	btrfs_set_key_type(&key, BTRFS_XATTR_ITEM_KEY);
	180	key.offset = 0;
	181
	182	path = btrfs_alloc_path();
5103e947 JB	183	if (!path)
5103e947 JB	184	return -ENOMEM;
1caf9342	185	path->reada = 2;
5103e947	186
5103e947 JB	187	/* search for our xattrs */
	188	ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
	189	if (ret < 0)
	190	goto err;
5103e947 JB	191	advance = 0;
	192	while (1) {
	193	leaf = path->nodes[0];
	194	nritems = btrfs_header_nritems(leaf);
	195	slot = path->slots[0];
	196
	197	/* this is where we start walking through the path */
	198	if (advance \|\| slot >= nritems) {
	199	/*
	200	* if we've reached the last slot in this leaf we need
	201	* to go to the next leaf and reset everything
	202	*/
	203	if (slot >= nritems-1) {
	204	ret = btrfs_next_leaf(root, path);
	205	if (ret)
	206	break;
	207	leaf = path->nodes[0];
	208	nritems = btrfs_header_nritems(leaf);
	209	slot = path->slots[0];
	210	} else {
	211	/*
	212	* just walking through the slots on this leaf
	213	*/
	214	slot++;
	215	path->slots[0]++;
	216	}
	217	}
	218	advance = 1;
	219
	220	item = btrfs_item_nr(leaf, slot);
	221	btrfs_item_key_to_cpu(leaf, &found_key, slot);
	222
	223	/* check to make sure this item is what we want */
	224	if (found_key.objectid != key.objectid)
	225	break;
	226	if (btrfs_key_type(&found_key) != BTRFS_XATTR_ITEM_KEY)
	227	break;
	228
	229	di = btrfs_item_ptr(leaf, slot, struct btrfs_dir_item);
	230
eaa47d86 CH	231	name_len = btrfs_dir_name_len(leaf, di);
eaa47d86 CH	232	total_size += name_len + 1;
5103e947 JB	233
	234	/* we are just looking for how big our buffer needs to be */
	235	if (!size)
	236	continue;
	237
eaa47d86	238	if (!buffer \|\| (name_len + 1) > size_left) {
5103e947	239	ret = -ERANGE;
b16281c3	240	goto err;
5103e947 JB	241	}
5103e947 JB	242
eaa47d86 CH	243	name_ptr = (unsigned long)(di + 1);
	244	read_extent_buffer(leaf, buffer, name_ptr, name_len);
	245	buffer[name_len] = '\0';
	246
	247	size_left -= name_len + 1;
	248	buffer += name_len + 1;
5103e947 JB	249	}
	250	ret = total_size;
	251
	252	err:
5103e947 JB	253	btrfs_free_path(path);
	254
	255	return ret;
	256	}
	257
5103e947	258	/*
95819c05 CH	259	* List of handlers for synthetic system.* attributes. All real ondisk
	260	* attributes are handled directly.
	261	*/
	262	struct xattr_handler *btrfs_xattr_handlers[] = {
3baf0bed	263	#ifdef CONFIG_BTRFS_POSIX_ACL
95819c05 CH	264	&btrfs_xattr_acl_access_handler,
	265	&btrfs_xattr_acl_default_handler,
	266	#endif
	267	NULL,
	268	};
	269
	270	/*
	271	* Check if the attribute is in a supported namespace.
	272	*
	273	* This applied after the check for the synthetic attributes in the system
	274	* namespace.
5103e947	275	*/
95819c05 CH	276	static bool btrfs_is_valid_xattr(const char *name)
95819c05 CH	277	{
d397712b CM	278	return !strncmp(name, XATTR_SECURITY_PREFIX,
d397712b CM	279	XATTR_SECURITY_PREFIX_LEN) \|\|
95819c05 CH	280	!strncmp(name, XATTR_SYSTEM_PREFIX, XATTR_SYSTEM_PREFIX_LEN) \|\|
	281	!strncmp(name, XATTR_TRUSTED_PREFIX, XATTR_TRUSTED_PREFIX_LEN) \|\|
	282	!strncmp(name, XATTR_USER_PREFIX, XATTR_USER_PREFIX_LEN);
69a32ac5 CM	283	}
69a32ac5 CM	284
95819c05 CH	285	ssize_t btrfs_getxattr(struct dentry dentry, const char name,
	286	void *buffer, size_t size)
	287	{
	288	/*
	289	* If this is a request for a synthetic attribute in the system.*
	290	* namespace use the generic infrastructure to resolve a handler
	291	* for it via sb->s_xattr.
	292	*/
	293	if (!strncmp(name, XATTR_SYSTEM_PREFIX, XATTR_SYSTEM_PREFIX_LEN))
	294	return generic_getxattr(dentry, name, buffer, size);
5103e947	295
95819c05 CH	296	if (!btrfs_is_valid_xattr(name))
	297	return -EOPNOTSUPP;
	298	return __btrfs_getxattr(dentry->d_inode, name, buffer, size);
	299	}
5103e947	300
95819c05 CH	301	int btrfs_setxattr(struct dentry dentry, const char name, const void *value,
	302	size_t size, int flags)
	303	{
	304	/*
	305	* If this is a request for a synthetic attribute in the system.*
	306	* namespace use the generic infrastructure to resolve a handler
	307	* for it via sb->s_xattr.
	308	*/
	309	if (!strncmp(name, XATTR_SYSTEM_PREFIX, XATTR_SYSTEM_PREFIX_LEN))
	310	return generic_setxattr(dentry, name, value, size, flags);
5103e947	311
95819c05 CH	312	if (!btrfs_is_valid_xattr(name))
95819c05 CH	313	return -EOPNOTSUPP;
5103e947	314
95819c05 CH	315	if (size == 0)
	316	value = ""; /* empty EA, do not remove */
	317	return __btrfs_setxattr(dentry->d_inode, name, value, size, flags);
	318	}
	319
	320	int btrfs_removexattr(struct dentry dentry, const char name)
	321	{
	322	/*
	323	* If this is a request for a synthetic attribute in the system.*
	324	* namespace use the generic infrastructure to resolve a handler
	325	* for it via sb->s_xattr.
	326	*/
	327	if (!strncmp(name, XATTR_SYSTEM_PREFIX, XATTR_SYSTEM_PREFIX_LEN))
	328	return generic_removexattr(dentry, name);
	329
	330	if (!btrfs_is_valid_xattr(name))
	331	return -EOPNOTSUPP;
	332	return __btrfs_setxattr(dentry->d_inode, name, NULL, 0, XATTR_REPLACE);
	333	}
0279b4cd JO	334
	335	int btrfs_xattr_security_init(struct inode inode, struct inode dir)
	336	{
	337	int err;
	338	size_t len;
	339	void *value;
	340	char *suffix;
	341	char *name;
	342
	343	err = security_inode_init_security(inode, dir, &suffix, &value, &len);
	344	if (err) {
	345	if (err == -EOPNOTSUPP)
	346	return 0;
	347	return err;
	348	}
	349
	350	name = kmalloc(XATTR_SECURITY_PREFIX_LEN + strlen(suffix) + 1,
	351	GFP_NOFS);
	352	if (!name) {
	353	err = -ENOMEM;
	354	} else {
	355	strcpy(name, XATTR_SECURITY_PREFIX);
	356	strcpy(name + XATTR_SECURITY_PREFIX_LEN, suffix);
	357	err = __btrfs_setxattr(inode, name, value, len, 0);
	358	kfree(name);
	359	}
	360
	361	kfree(suffix);
	362	kfree(value);
	363	return err;
	364	}