[mirror_ubuntu-jammy-kernel.git] / fs / btrfs / props.c

// SPDX-License-Identifier: GPL-2.0
/*
 * Copyright (C) 2014 Filipe David Borba Manana <fdmanana@gmail.com>
 */

#include <linux/hashtable.h>
#include "props.h"
#include "btrfs_inode.h"
#include "transaction.h"
#include "ctree.h"
#include "xattr.h"
#include "compression.h"

#define BTRFS_PROP_HANDLERS_HT_BITS 8
static DEFINE_HASHTABLE(prop_handlers_ht, BTRFS_PROP_HANDLERS_HT_BITS);

struct prop_handler {
	struct hlist_node node;
	const char *xattr_name;
	int (*validate)(const char *value, size_t len);
	int (*apply)(struct inode *inode, const char *value, size_t len);
	const char *(*extract)(struct inode *inode);
	int inheritable;
};

static const struct hlist_head *find_prop_handlers_by_hash(const u64 hash)
{
	struct hlist_head *h;

	h = &prop_handlers_ht[hash_min(hash, BTRFS_PROP_HANDLERS_HT_BITS)];
	if (hlist_empty(h))
		return NULL;

	return h;
}

static const struct prop_handler *
find_prop_handler(const char *name,
		  const struct hlist_head *handlers)
{
	struct prop_handler *h;

	if (!handlers) {
		u64 hash = btrfs_name_hash(name, strlen(name));

		handlers = find_prop_handlers_by_hash(hash);
		if (!handlers)
			return NULL;
	}

	hlist_for_each_entry(h, handlers, node)
		if (!strcmp(h->xattr_name, name))
			return h;

	return NULL;
}

int btrfs_validate_prop(const char *name, const char *value, size_t value_len)
{
	const struct prop_handler *handler;

	if (strlen(name) <= XATTR_BTRFS_PREFIX_LEN)
		return -EINVAL;

	handler = find_prop_handler(name, NULL);
	if (!handler)
		return -EINVAL;

	if (value_len == 0)
		return 0;

	return handler->validate(value, value_len);
}

int btrfs_set_prop(struct btrfs_trans_handle *trans, struct inode *inode,
		   const char *name, const char *value, size_t value_len,
		   int flags)
{
	const struct prop_handler *handler;
	int ret;

	handler = find_prop_handler(name, NULL);
	if (!handler)
		return -EINVAL;

	if (value_len == 0) {
		ret = btrfs_setxattr(trans, inode, handler->xattr_name,
				     NULL, 0, flags);
		if (ret)
			return ret;

		ret = handler->apply(inode, NULL, 0);
		ASSERT(ret == 0);

		return ret;
	}

	ret = btrfs_setxattr(trans, inode, handler->xattr_name, value,
			     value_len, flags);
	if (ret)
		return ret;
	ret = handler->apply(inode, value, value_len);
	if (ret) {
		btrfs_setxattr(trans, inode, handler->xattr_name, NULL,
			       0, flags);
		return ret;
	}

	set_bit(BTRFS_INODE_HAS_PROPS, &BTRFS_I(inode)->runtime_flags);

	return 0;
}

static int iterate_object_props(struct btrfs_root *root,
				struct btrfs_path *path,
				u64 objectid,
				void (*iterator)(void *,
						 const struct prop_handler *,
						 const char *,
						 size_t),
				void *ctx)
{
	int ret;
	char *name_buf = NULL;
	char *value_buf = NULL;
	int name_buf_len = 0;
	int value_buf_len = 0;

	while (1) {
		struct btrfs_key key;
		struct btrfs_dir_item *di;
		struct extent_buffer *leaf;
		u32 total_len, cur, this_len;
		int slot;
		const struct hlist_head *handlers;

		slot = path->slots[0];
		leaf = path->nodes[0];

		if (slot >= btrfs_header_nritems(leaf)) {
			ret = btrfs_next_leaf(root, path);
			if (ret < 0)
				goto out;
			else if (ret > 0)
				break;
			continue;
		}

		btrfs_item_key_to_cpu(leaf, &key, slot);
		if (key.objectid != objectid)
			break;
		if (key.type != BTRFS_XATTR_ITEM_KEY)
			break;

		handlers = find_prop_handlers_by_hash(key.offset);
		if (!handlers)
			goto next_slot;

		di = btrfs_item_ptr(leaf, slot, struct btrfs_dir_item);
		cur = 0;
		total_len = btrfs_item_size_nr(leaf, slot);

		while (cur < total_len) {
			u32 name_len = btrfs_dir_name_len(leaf, di);
			u32 data_len = btrfs_dir_data_len(leaf, di);
			unsigned long name_ptr, data_ptr;
			const struct prop_handler *handler;

			this_len = sizeof(*di) + name_len + data_len;
			name_ptr = (unsigned long)(di + 1);
			data_ptr = name_ptr + name_len;

			if (name_len <= XATTR_BTRFS_PREFIX_LEN ||
			    memcmp_extent_buffer(leaf, XATTR_BTRFS_PREFIX,
						 name_ptr,
						 XATTR_BTRFS_PREFIX_LEN))
				goto next_dir_item;

			if (name_len >= name_buf_len) {
				kfree(name_buf);
				name_buf_len = name_len + 1;
				name_buf = kmalloc(name_buf_len, GFP_NOFS);
				if (!name_buf) {
					ret = -ENOMEM;
					goto out;
				}
			}
			read_extent_buffer(leaf, name_buf, name_ptr, name_len);
			name_buf[name_len] = '\0';

			handler = find_prop_handler(name_buf, handlers);
			if (!handler)
				goto next_dir_item;

			if (data_len > value_buf_len) {
				kfree(value_buf);
				value_buf_len = data_len;
				value_buf = kmalloc(data_len, GFP_NOFS);
				if (!value_buf) {
					ret = -ENOMEM;
					goto out;
				}
			}
			read_extent_buffer(leaf, value_buf, data_ptr, data_len);

			iterator(ctx, handler, value_buf, data_len);
next_dir_item:
			cur += this_len;
			di = (struct btrfs_dir_item *)((char *) di + this_len);
		}

next_slot:
		path->slots[0]++;
	}

	ret = 0;
out:
	btrfs_release_path(path);
	kfree(name_buf);
	kfree(value_buf);

	return ret;
}

static void inode_prop_iterator(void *ctx,
				const struct prop_handler *handler,
				const char *value,
				size_t len)
{
	struct inode *inode = ctx;
	struct btrfs_root *root = BTRFS_I(inode)->root;
	int ret;

	ret = handler->apply(inode, value, len);
	if (unlikely(ret))
		btrfs_warn(root->fs_info,
			   "error applying prop %s to ino %llu (root %llu): %d",
			   handler->xattr_name, btrfs_ino(BTRFS_I(inode)),
			   root->root_key.objectid, ret);
	else
		set_bit(BTRFS_INODE_HAS_PROPS, &BTRFS_I(inode)->runtime_flags);
}

int btrfs_load_inode_props(struct inode *inode, struct btrfs_path *path)
{
	struct btrfs_root *root = BTRFS_I(inode)->root;
	u64 ino = btrfs_ino(BTRFS_I(inode));
	int ret;

	ret = iterate_object_props(root, path, ino, inode_prop_iterator, inode);

	return ret;
}

static int prop_compression_validate(const char *value, size_t len)
{
	if (!value)
		return 0;

	if (btrfs_compress_is_valid_type(value, len))
		return 0;

	return -EINVAL;
}

static int prop_compression_apply(struct inode *inode, const char *value,
				  size_t len)
{
	struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
	int type;

	if (len == 0) {
		BTRFS_I(inode)->flags |= BTRFS_INODE_NOCOMPRESS;
		BTRFS_I(inode)->flags &= ~BTRFS_INODE_COMPRESS;
		BTRFS_I(inode)->prop_compress = BTRFS_COMPRESS_NONE;

		return 0;
	}

	if (!strncmp("lzo", value, 3)) {
		type = BTRFS_COMPRESS_LZO;
		btrfs_set_fs_incompat(fs_info, COMPRESS_LZO);
	} else if (!strncmp("zlib", value, 4)) {
		type = BTRFS_COMPRESS_ZLIB;
	} else if (!strncmp("zstd", value, 4)) {
		type = BTRFS_COMPRESS_ZSTD;
		btrfs_set_fs_incompat(fs_info, COMPRESS_ZSTD);
	} else {
		return -EINVAL;
	}

	BTRFS_I(inode)->flags &= ~BTRFS_INODE_NOCOMPRESS;
	BTRFS_I(inode)->flags |= BTRFS_INODE_COMPRESS;
	BTRFS_I(inode)->prop_compress = type;

	return 0;
}

static const char *prop_compression_extract(struct inode *inode)
{
	switch (BTRFS_I(inode)->prop_compress) {
	case BTRFS_COMPRESS_ZLIB:
	case BTRFS_COMPRESS_LZO:
	case BTRFS_COMPRESS_ZSTD:
		return btrfs_compress_type2str(BTRFS_I(inode)->prop_compress);
	default:
		break;
	}

	return NULL;
}

static struct prop_handler prop_handlers[] = {
	{
		.xattr_name = XATTR_BTRFS_PREFIX "compression",
		.validate = prop_compression_validate,
		.apply = prop_compression_apply,
		.extract = prop_compression_extract,
		.inheritable = 1
	},
};

static int inherit_props(struct btrfs_trans_handle *trans,
			 struct inode *inode,
			 struct inode *parent)
{
	struct btrfs_root *root = BTRFS_I(inode)->root;
	struct btrfs_fs_info *fs_info = root->fs_info;
	int ret;
	int i;
	bool need_reserve = false;

	if (!test_bit(BTRFS_INODE_HAS_PROPS,
		      &BTRFS_I(parent)->runtime_flags))
		return 0;

	for (i = 0; i < ARRAY_SIZE(prop_handlers); i++) {
		const struct prop_handler *h = &prop_handlers[i];
		const char *value;
		u64 num_bytes = 0;

		if (!h->inheritable)
			continue;

		value = h->extract(parent);
		if (!value)
			continue;

		/*
		 * This is not strictly necessary as the property should be
		 * valid, but in case it isn't, don't propagate it futher.
		 */
		ret = h->validate(value, strlen(value));
		if (ret)
			continue;

		/*
		 * Currently callers should be reserving 1 item for properties,
		 * since we only have 1 property that we currently support.  If
		 * we add more in the future we need to try and reserve more
		 * space for them.  But we should also revisit how we do space
		 * reservations if we do add more properties in the future.
		 */
		if (need_reserve) {
			num_bytes = btrfs_calc_insert_metadata_size(fs_info, 1);
			ret = btrfs_block_rsv_add(root, trans->block_rsv,
					num_bytes, BTRFS_RESERVE_NO_FLUSH);
			if (ret)
				return ret;
		}

		ret = btrfs_setxattr(trans, inode, h->xattr_name, value,
				     strlen(value), 0);
		if (!ret) {
			ret = h->apply(inode, value, strlen(value));
			if (ret)
				btrfs_setxattr(trans, inode, h->xattr_name,
					       NULL, 0, 0);
			else
				set_bit(BTRFS_INODE_HAS_PROPS,
					&BTRFS_I(inode)->runtime_flags);
		}

		if (need_reserve) {
			btrfs_block_rsv_release(fs_info, trans->block_rsv,
					num_bytes);
			if (ret)
				return ret;
		}
		need_reserve = true;
	}

	return 0;
}

int btrfs_inode_inherit_props(struct btrfs_trans_handle *trans,
			      struct inode *inode,
			      struct inode *dir)
{
	if (!dir)
		return 0;

	return inherit_props(trans, inode, dir);
}

int btrfs_subvol_inherit_props(struct btrfs_trans_handle *trans,
			       struct btrfs_root *root,
			       struct btrfs_root *parent_root)
{
	struct super_block *sb = root->fs_info->sb;
	struct btrfs_key key;
	struct inode *parent_inode, *child_inode;
	int ret;

	key.objectid = BTRFS_FIRST_FREE_OBJECTID;
	key.type = BTRFS_INODE_ITEM_KEY;
	key.offset = 0;

	parent_inode = btrfs_iget(sb, &key, parent_root);
	if (IS_ERR(parent_inode))
		return PTR_ERR(parent_inode);

	child_inode = btrfs_iget(sb, &key, root);
	if (IS_ERR(child_inode)) {
		iput(parent_inode);
		return PTR_ERR(child_inode);
	}

	ret = inherit_props(trans, child_inode, parent_inode);
	iput(child_inode);
	iput(parent_inode);

	return ret;
}

void __init btrfs_props_init(void)
{
	int i;

	for (i = 0; i < ARRAY_SIZE(prop_handlers); i++) {
		struct prop_handler *p = &prop_handlers[i];
		u64 h = btrfs_name_hash(p->xattr_name, strlen(p->xattr_name));

		hash_add(prop_handlers_ht, &p->node, h);
	}
}
Commit	Line	Data
c1d7c514	1	// SPDX-License-Identifier: GPL-2.0
63541927 FDBM	2	/*
63541927 FDBM	3	* Copyright (C) 2014 Filipe David Borba Manana <fdmanana@gmail.com>
63541927 FDBM	4	*/
	5
	6	#include <linux/hashtable.h>
	7	#include "props.h"
	8	#include "btrfs_inode.h"
63541927	9	#include "transaction.h"
9678c543	10	#include "ctree.h"
63541927	11	#include "xattr.h"
ebb8765b	12	#include "compression.h"
63541927 FDBM	13
	14	#define BTRFS_PROP_HANDLERS_HT_BITS 8
	15	static DEFINE_HASHTABLE(prop_handlers_ht, BTRFS_PROP_HANDLERS_HT_BITS);
	16
	17	struct prop_handler {
	18	struct hlist_node node;
	19	const char *xattr_name;
	20	int (validate)(const char value, size_t len);
	21	int (apply)(struct inode inode, const char *value, size_t len);
	22	const char (extract)(struct inode *inode);
	23	int inheritable;
	24	};
	25
63541927 FDBM	26	static const struct hlist_head *find_prop_handlers_by_hash(const u64 hash)
	27	{
	28	struct hlist_head *h;
	29
	30	h = &prop_handlers_ht[hash_min(hash, BTRFS_PROP_HANDLERS_HT_BITS)];
	31	if (hlist_empty(h))
	32	return NULL;
	33
	34	return h;
	35	}
	36
	37	static const struct prop_handler *
	38	find_prop_handler(const char *name,
	39	const struct hlist_head *handlers)
	40	{
	41	struct prop_handler *h;
	42
	43	if (!handlers) {
	44	u64 hash = btrfs_name_hash(name, strlen(name));
	45
	46	handlers = find_prop_handlers_by_hash(hash);
	47	if (!handlers)
	48	return NULL;
	49	}
	50
	51	hlist_for_each_entry(h, handlers, node)
	52	if (!strcmp(h->xattr_name, name))
	53	return h;
	54
	55	return NULL;
	56	}
	57
f22125e5 AJ	58	int btrfs_validate_prop(const char name, const char value, size_t value_len)
	59	{
	60	const struct prop_handler *handler;
	61
	62	if (strlen(name) <= XATTR_BTRFS_PREFIX_LEN)
	63	return -EINVAL;
	64
	65	handler = find_prop_handler(name, NULL);
	66	if (!handler)
	67	return -EINVAL;
	68
	69	if (value_len == 0)
	70	return 0;
	71
	72	return handler->validate(value, value_len);
	73	}
	74
cd31af15 AJ	75	int btrfs_set_prop(struct btrfs_trans_handle trans, struct inode inode,
	76	const char name, const char value, size_t value_len,
	77	int flags)
63541927 FDBM	78	{
	79	const struct prop_handler *handler;
	80	int ret;
	81
63541927 FDBM	82	handler = find_prop_handler(name, NULL);
	83	if (!handler)
	84	return -EINVAL;
	85
	86	if (value_len == 0) {
da9b6ec8 AJ	87	ret = btrfs_setxattr(trans, inode, handler->xattr_name,
da9b6ec8 AJ	88	NULL, 0, flags);
63541927 FDBM	89	if (ret)
	90	return ret;
	91
	92	ret = handler->apply(inode, NULL, 0);
	93	ASSERT(ret == 0);
	94
	95	return ret;
	96	}
	97
da9b6ec8 AJ	98	ret = btrfs_setxattr(trans, inode, handler->xattr_name, value,
da9b6ec8 AJ	99	value_len, flags);
63541927 FDBM	100	if (ret)
	101	return ret;
	102	ret = handler->apply(inode, value, value_len);
	103	if (ret) {
da9b6ec8 AJ	104	btrfs_setxattr(trans, inode, handler->xattr_name, NULL,
da9b6ec8 AJ	105	0, flags);
63541927 FDBM	106	return ret;
	107	}
	108
	109	set_bit(BTRFS_INODE_HAS_PROPS, &BTRFS_I(inode)->runtime_flags);
	110
	111	return 0;
	112	}
	113
63541927 FDBM	114	static int iterate_object_props(struct btrfs_root *root,
	115	struct btrfs_path *path,
	116	u64 objectid,
	117	void (iterator)(void ,
	118	const struct prop_handler *,
	119	const char *,
	120	size_t),
	121	void *ctx)
	122	{
	123	int ret;
	124	char *name_buf = NULL;
	125	char *value_buf = NULL;
	126	int name_buf_len = 0;
	127	int value_buf_len = 0;
	128
	129	while (1) {
	130	struct btrfs_key key;
	131	struct btrfs_dir_item *di;
	132	struct extent_buffer *leaf;
	133	u32 total_len, cur, this_len;
	134	int slot;
	135	const struct hlist_head *handlers;
	136
	137	slot = path->slots[0];
	138	leaf = path->nodes[0];
	139
	140	if (slot >= btrfs_header_nritems(leaf)) {
	141	ret = btrfs_next_leaf(root, path);
	142	if (ret < 0)
	143	goto out;
	144	else if (ret > 0)
	145	break;
	146	continue;
	147	}
	148
	149	btrfs_item_key_to_cpu(leaf, &key, slot);
	150	if (key.objectid != objectid)
	151	break;
	152	if (key.type != BTRFS_XATTR_ITEM_KEY)
	153	break;
	154
	155	handlers = find_prop_handlers_by_hash(key.offset);
	156	if (!handlers)
	157	goto next_slot;
	158
	159	di = btrfs_item_ptr(leaf, slot, struct btrfs_dir_item);
	160	cur = 0;
	161	total_len = btrfs_item_size_nr(leaf, slot);
	162
	163	while (cur < total_len) {
	164	u32 name_len = btrfs_dir_name_len(leaf, di);
	165	u32 data_len = btrfs_dir_data_len(leaf, di);
	166	unsigned long name_ptr, data_ptr;
	167	const struct prop_handler *handler;
	168
	169	this_len = sizeof(*di) + name_len + data_len;
	170	name_ptr = (unsigned long)(di + 1);
	171	data_ptr = name_ptr + name_len;
	172
	173	if (name_len <= XATTR_BTRFS_PREFIX_LEN \|\|
	174	memcmp_extent_buffer(leaf, XATTR_BTRFS_PREFIX,
	175	name_ptr,
	176	XATTR_BTRFS_PREFIX_LEN))
	177	goto next_dir_item;
178
179	if (name_len >= name_buf_len) {
180	kfree(name_buf);
181	name_buf_len = name_len + 1;
182	name_buf = kmalloc(name_buf_len, GFP_NOFS);
183	if (!name_buf) {
184	ret = -ENOMEM;
185	goto out;
186	}
187	}
188	read_extent_buffer(leaf, name_buf, name_ptr, name_len);
189	name_buf[name_len] = '\0';
190
191	handler = find_prop_handler(name_buf, handlers);
192	if (!handler)
193	goto next_dir_item;
194
195	if (data_len > value_buf_len) {
196	kfree(value_buf);
197	value_buf_len = data_len;
198	value_buf = kmalloc(data_len, GFP_NOFS);
199	if (!value_buf) {
200	ret = -ENOMEM;
201	goto out;
202	}
203	}
204	read_extent_buffer(leaf, value_buf, data_ptr, data_len);
205
206	iterator(ctx, handler, value_buf, data_len);
207	next_dir_item:
208	cur += this_len;
209	di = (struct btrfs_dir_item )((char ) di + this_len);
210	}
211
212	next_slot:
213	path->slots[0]++;
214	}
215
216	ret = 0;
217	out:
218	btrfs_release_path(path);
219	kfree(name_buf);
220	kfree(value_buf);
221
222	return ret;
223	}
224
225	static void inode_prop_iterator(void *ctx,
226	const struct prop_handler *handler,
227	const char *value,
228	size_t len)
229	{
230	struct inode *inode = ctx;
231	struct btrfs_root *root = BTRFS_I(inode)->root;
232	int ret;
233
234	ret = handler->apply(inode, value, len);
235	if (unlikely(ret))
236	btrfs_warn(root->fs_info,
237	"error applying prop %s to ino %llu (root %llu): %d",
4a0cc7ca	238	handler->xattr_name, btrfs_ino(BTRFS_I(inode)),
63541927 FDBM	239	root->root_key.objectid, ret);
	240	else
	241	set_bit(BTRFS_INODE_HAS_PROPS, &BTRFS_I(inode)->runtime_flags);
	242	}
	243
	244	int btrfs_load_inode_props(struct inode inode, struct btrfs_path path)
	245	{
	246	struct btrfs_root *root = BTRFS_I(inode)->root;
4a0cc7ca	247	u64 ino = btrfs_ino(BTRFS_I(inode));
63541927 FDBM	248	int ret;
	249
	250	ret = iterate_object_props(root, path, ino, inode_prop_iterator, inode);
	251
	252	return ret;
	253	}
	254
3dcf96c7 AJ	255	static int prop_compression_validate(const char *value, size_t len)
	256	{
	257	if (!value)
	258	return 0;
	259
aa53e3bf	260	if (btrfs_compress_is_valid_type(value, len))
3dcf96c7 AJ	261	return 0;
	262
	263	return -EINVAL;
	264	}
	265
	266	static int prop_compression_apply(struct inode inode, const char value,
	267	size_t len)
	268	{
	269	struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
	270	int type;
	271
	272	if (len == 0) {
	273	BTRFS_I(inode)->flags \|= BTRFS_INODE_NOCOMPRESS;
	274	BTRFS_I(inode)->flags &= ~BTRFS_INODE_COMPRESS;
	275	BTRFS_I(inode)->prop_compress = BTRFS_COMPRESS_NONE;
	276
	277	return 0;
	278	}
	279
	280	if (!strncmp("lzo", value, 3)) {
	281	type = BTRFS_COMPRESS_LZO;
	282	btrfs_set_fs_incompat(fs_info, COMPRESS_LZO);
	283	} else if (!strncmp("zlib", value, 4)) {
	284	type = BTRFS_COMPRESS_ZLIB;
	285	} else if (!strncmp("zstd", value, 4)) {
	286	type = BTRFS_COMPRESS_ZSTD;
	287	btrfs_set_fs_incompat(fs_info, COMPRESS_ZSTD);
	288	} else {
	289	return -EINVAL;
	290	}
	291
	292	BTRFS_I(inode)->flags &= ~BTRFS_INODE_NOCOMPRESS;
	293	BTRFS_I(inode)->flags \|= BTRFS_INODE_COMPRESS;
	294	BTRFS_I(inode)->prop_compress = type;
	295
	296	return 0;
	297	}
	298
	299	static const char prop_compression_extract(struct inode inode)
	300	{
	301	switch (BTRFS_I(inode)->prop_compress) {
	302	case BTRFS_COMPRESS_ZLIB:
	303	case BTRFS_COMPRESS_LZO:
	304	case BTRFS_COMPRESS_ZSTD:
	305	return btrfs_compress_type2str(BTRFS_I(inode)->prop_compress);
	306	default:
	307	break;
	308	}
	309
	310	return NULL;
	311	}
	312
	313	static struct prop_handler prop_handlers[] = {
	314	{
	315	.xattr_name = XATTR_BTRFS_PREFIX "compression",
	316	.validate = prop_compression_validate,
	317	.apply = prop_compression_apply,
	318	.extract = prop_compression_extract,
	319	.inheritable = 1
	320	},
	321	};
	322
63541927 FDBM	323	static int inherit_props(struct btrfs_trans_handle *trans,
	324	struct inode *inode,
	325	struct inode *parent)
	326	{
63541927	327	struct btrfs_root *root = BTRFS_I(inode)->root;
2ff7e61e	328	struct btrfs_fs_info *fs_info = root->fs_info;
63541927	329	int ret;
619ed392	330	int i;
d7400ee1	331	bool need_reserve = false;
63541927 FDBM	332
	333	if (!test_bit(BTRFS_INODE_HAS_PROPS,
	334	&BTRFS_I(parent)->runtime_flags))
	335	return 0;
	336
619ed392 BL	337	for (i = 0; i < ARRAY_SIZE(prop_handlers); i++) {
619ed392 BL	338	const struct prop_handler *h = &prop_handlers[i];
63541927	339	const char *value;
6c64460c	340	u64 num_bytes = 0;
63541927 FDBM	341
	342	if (!h->inheritable)
	343	continue;
	344
	345	value = h->extract(parent);
	346	if (!value)
	347	continue;
	348
8b4d1efc AJ	349	/*
	350	* This is not strictly necessary as the property should be
	351	* valid, but in case it isn't, don't propagate it futher.
	352	*/
	353	ret = h->validate(value, strlen(value));
	354	if (ret)
	355	continue;
	356
d7400ee1 JB	357	/*
	358	* Currently callers should be reserving 1 item for properties,
	359	* since we only have 1 property that we currently support. If
	360	* we add more in the future we need to try and reserve more
	361	* space for them. But we should also revisit how we do space
	362	* reservations if we do add more properties in the future.
	363	*/
	364	if (need_reserve) {
2bd36e7b	365	num_bytes = btrfs_calc_insert_metadata_size(fs_info, 1);
d7400ee1 JB	366	ret = btrfs_block_rsv_add(root, trans->block_rsv,
	367	num_bytes, BTRFS_RESERVE_NO_FLUSH);
	368	if (ret)
	369	return ret;
	370	}
8b4d1efc	371
04e6863b AJ	372	ret = btrfs_setxattr(trans, inode, h->xattr_name, value,
04e6863b AJ	373	strlen(value), 0);
8b4d1efc AJ	374	if (!ret) {
	375	ret = h->apply(inode, value, strlen(value));
	376	if (ret)
04e6863b AJ	377	btrfs_setxattr(trans, inode, h->xattr_name,
04e6863b AJ	378	NULL, 0, 0);
8b4d1efc AJ	379	else
	380	set_bit(BTRFS_INODE_HAS_PROPS,
	381	&BTRFS_I(inode)->runtime_flags);
	382	}
	383
d7400ee1 JB	384	if (need_reserve) {
	385	btrfs_block_rsv_release(fs_info, trans->block_rsv,
	386	num_bytes);
	387	if (ret)
	388	return ret;
	389	}
	390	need_reserve = true;
63541927	391	}
8b4d1efc AJ	392
8b4d1efc AJ	393	return 0;
63541927 FDBM	394	}
	395
	396	int btrfs_inode_inherit_props(struct btrfs_trans_handle *trans,
	397	struct inode *inode,
	398	struct inode *dir)
	399	{
	400	if (!dir)
	401	return 0;
	402
	403	return inherit_props(trans, inode, dir);
	404	}
	405
	406	int btrfs_subvol_inherit_props(struct btrfs_trans_handle *trans,
	407	struct btrfs_root *root,
	408	struct btrfs_root *parent_root)
	409	{
bd6c57dd	410	struct super_block *sb = root->fs_info->sb;
63541927 FDBM	411	struct btrfs_key key;
	412	struct inode parent_inode, child_inode;
	413	int ret;
	414
	415	key.objectid = BTRFS_FIRST_FREE_OBJECTID;
	416	key.type = BTRFS_INODE_ITEM_KEY;
	417	key.offset = 0;
	418
4c66e0d4	419	parent_inode = btrfs_iget(sb, &key, parent_root);
63541927 FDBM	420	if (IS_ERR(parent_inode))
	421	return PTR_ERR(parent_inode);
	422
4c66e0d4	423	child_inode = btrfs_iget(sb, &key, root);
63541927 FDBM	424	if (IS_ERR(child_inode)) {
	425	iput(parent_inode);
	426	return PTR_ERR(child_inode);
	427	}
	428
	429	ret = inherit_props(trans, child_inode, parent_inode);
	430	iput(child_inode);
	431	iput(parent_inode);
	432
	433	return ret;
	434	}
	435
3dcf96c7	436	void __init btrfs_props_init(void)
63541927	437	{
3dcf96c7	438	int i;
63541927	439
3dcf96c7 AJ	440	for (i = 0; i < ARRAY_SIZE(prop_handlers); i++) {
	441	struct prop_handler *p = &prop_handlers[i];
	442	u64 h = btrfs_name_hash(p->xattr_name, strlen(p->xattr_name));
63541927	443
3dcf96c7	444	hash_add(prop_handlers_ht, &p->node, h);
63541927	445	}
63541927	446	}
e8c9f186	447