2 * Copyright (C) 2014 Filipe David Borba Manana <fdmanana@gmail.com>
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/hashtable.h>
21 #include "btrfs_inode.h"
23 #include "transaction.h"
26 #define BTRFS_PROP_HANDLERS_HT_BITS 8
27 static DEFINE_HASHTABLE(prop_handlers_ht, BTRFS_PROP_HANDLERS_HT_BITS);
30 struct hlist_node node;
31 const char *xattr_name;
32 int (*validate)(const char *value, size_t len);
33 int (*apply)(struct inode *inode, const char *value, size_t len);
34 const char *(*extract)(struct inode *inode);
38 static int prop_compression_validate(const char *value, size_t len);
39 static int prop_compression_apply(struct inode *inode,
42 static const char *prop_compression_extract(struct inode *inode);
44 static struct prop_handler prop_handlers[] = {
46 .xattr_name = XATTR_BTRFS_PREFIX "compression",
47 .validate = prop_compression_validate,
48 .apply = prop_compression_apply,
49 .extract = prop_compression_extract,
57 void __init btrfs_props_init(void)
59 struct prop_handler *p;
61 hash_init(prop_handlers_ht);
63 for (p = &prop_handlers[0]; p->xattr_name; p++) {
64 u64 h = btrfs_name_hash(p->xattr_name, strlen(p->xattr_name));
66 hash_add(prop_handlers_ht, &p->node, h);
70 static const struct hlist_head *find_prop_handlers_by_hash(const u64 hash)
74 h = &prop_handlers_ht[hash_min(hash, BTRFS_PROP_HANDLERS_HT_BITS)];
81 static const struct prop_handler *
82 find_prop_handler(const char *name,
83 const struct hlist_head *handlers)
85 struct prop_handler *h;
88 u64 hash = btrfs_name_hash(name, strlen(name));
90 handlers = find_prop_handlers_by_hash(hash);
95 hlist_for_each_entry(h, handlers, node)
96 if (!strcmp(h->xattr_name, name))
102 static int __btrfs_set_prop(struct btrfs_trans_handle *trans,
109 const struct prop_handler *handler;
112 if (strlen(name) <= XATTR_BTRFS_PREFIX_LEN)
115 handler = find_prop_handler(name, NULL);
119 if (value_len == 0) {
120 ret = __btrfs_setxattr(trans, inode, handler->xattr_name,
125 ret = handler->apply(inode, NULL, 0);
131 ret = handler->validate(value, value_len);
134 ret = __btrfs_setxattr(trans, inode, handler->xattr_name,
135 value, value_len, flags);
138 ret = handler->apply(inode, value, value_len);
140 __btrfs_setxattr(trans, inode, handler->xattr_name,
145 set_bit(BTRFS_INODE_HAS_PROPS, &BTRFS_I(inode)->runtime_flags);
150 int btrfs_set_prop(struct inode *inode,
156 return __btrfs_set_prop(NULL, inode, name, value, value_len, flags);
159 static int iterate_object_props(struct btrfs_root *root,
160 struct btrfs_path *path,
162 void (*iterator)(void *,
163 const struct prop_handler *,
169 char *name_buf = NULL;
170 char *value_buf = NULL;
171 int name_buf_len = 0;
172 int value_buf_len = 0;
175 struct btrfs_key key;
176 struct btrfs_dir_item *di;
177 struct extent_buffer *leaf;
178 u32 total_len, cur, this_len;
180 const struct hlist_head *handlers;
182 slot = path->slots[0];
183 leaf = path->nodes[0];
185 if (slot >= btrfs_header_nritems(leaf)) {
186 ret = btrfs_next_leaf(root, path);
194 btrfs_item_key_to_cpu(leaf, &key, slot);
195 if (key.objectid != objectid)
197 if (key.type != BTRFS_XATTR_ITEM_KEY)
200 handlers = find_prop_handlers_by_hash(key.offset);
204 di = btrfs_item_ptr(leaf, slot, struct btrfs_dir_item);
206 total_len = btrfs_item_size_nr(leaf, slot);
208 while (cur < total_len) {
209 u32 name_len = btrfs_dir_name_len(leaf, di);
210 u32 data_len = btrfs_dir_data_len(leaf, di);
211 unsigned long name_ptr, data_ptr;
212 const struct prop_handler *handler;
214 this_len = sizeof(*di) + name_len + data_len;
215 name_ptr = (unsigned long)(di + 1);
216 data_ptr = name_ptr + name_len;
218 if (name_len <= XATTR_BTRFS_PREFIX_LEN ||
219 memcmp_extent_buffer(leaf, XATTR_BTRFS_PREFIX,
221 XATTR_BTRFS_PREFIX_LEN))
224 if (name_len >= name_buf_len) {
226 name_buf_len = name_len + 1;
227 name_buf = kmalloc(name_buf_len, GFP_NOFS);
233 read_extent_buffer(leaf, name_buf, name_ptr, name_len);
234 name_buf[name_len] = '\0';
236 handler = find_prop_handler(name_buf, handlers);
240 if (data_len > value_buf_len) {
242 value_buf_len = data_len;
243 value_buf = kmalloc(data_len, GFP_NOFS);
249 read_extent_buffer(leaf, value_buf, data_ptr, data_len);
251 iterator(ctx, handler, value_buf, data_len);
254 di = (struct btrfs_dir_item *)((char *) di + this_len);
263 btrfs_release_path(path);
270 static void inode_prop_iterator(void *ctx,
271 const struct prop_handler *handler,
275 struct inode *inode = ctx;
276 struct btrfs_root *root = BTRFS_I(inode)->root;
279 ret = handler->apply(inode, value, len);
281 btrfs_warn(root->fs_info,
282 "error applying prop %s to ino %llu (root %llu): %d",
283 handler->xattr_name, btrfs_ino(inode),
284 root->root_key.objectid, ret);
286 set_bit(BTRFS_INODE_HAS_PROPS, &BTRFS_I(inode)->runtime_flags);
289 int btrfs_load_inode_props(struct inode *inode, struct btrfs_path *path)
291 struct btrfs_root *root = BTRFS_I(inode)->root;
292 u64 ino = btrfs_ino(inode);
295 ret = iterate_object_props(root, path, ino, inode_prop_iterator, inode);
300 static int inherit_props(struct btrfs_trans_handle *trans,
302 struct inode *parent)
304 const struct prop_handler *h;
305 struct btrfs_root *root = BTRFS_I(inode)->root;
308 if (!test_bit(BTRFS_INODE_HAS_PROPS,
309 &BTRFS_I(parent)->runtime_flags))
312 for (h = &prop_handlers[0]; h->xattr_name; h++) {
319 value = h->extract(parent);
323 num_bytes = btrfs_calc_trans_metadata_size(root, 1);
324 ret = btrfs_block_rsv_add(root, trans->block_rsv,
325 num_bytes, BTRFS_RESERVE_NO_FLUSH);
328 ret = __btrfs_set_prop(trans, inode, h->xattr_name,
329 value, strlen(value), 0);
330 btrfs_block_rsv_release(root, trans->block_rsv, num_bytes);
339 int btrfs_inode_inherit_props(struct btrfs_trans_handle *trans,
346 return inherit_props(trans, inode, dir);
349 int btrfs_subvol_inherit_props(struct btrfs_trans_handle *trans,
350 struct btrfs_root *root,
351 struct btrfs_root *parent_root)
353 struct btrfs_key key;
354 struct inode *parent_inode, *child_inode;
357 key.objectid = BTRFS_FIRST_FREE_OBJECTID;
358 key.type = BTRFS_INODE_ITEM_KEY;
361 parent_inode = btrfs_iget(parent_root->fs_info->sb, &key,
363 if (IS_ERR(parent_inode))
364 return PTR_ERR(parent_inode);
366 child_inode = btrfs_iget(root->fs_info->sb, &key, root, NULL);
367 if (IS_ERR(child_inode)) {
369 return PTR_ERR(child_inode);
372 ret = inherit_props(trans, child_inode, parent_inode);
379 static int prop_compression_validate(const char *value, size_t len)
381 if (!strncmp("lzo", value, len))
383 else if (!strncmp("zlib", value, len))
389 static int prop_compression_apply(struct inode *inode,
396 BTRFS_I(inode)->flags |= BTRFS_INODE_NOCOMPRESS;
397 BTRFS_I(inode)->flags &= ~BTRFS_INODE_COMPRESS;
398 BTRFS_I(inode)->force_compress = BTRFS_COMPRESS_NONE;
403 if (!strncmp("lzo", value, len))
404 type = BTRFS_COMPRESS_LZO;
405 else if (!strncmp("zlib", value, len))
406 type = BTRFS_COMPRESS_ZLIB;
410 BTRFS_I(inode)->flags &= ~BTRFS_INODE_NOCOMPRESS;
411 BTRFS_I(inode)->flags |= BTRFS_INODE_COMPRESS;
412 BTRFS_I(inode)->force_compress = type;
417 static const char *prop_compression_extract(struct inode *inode)
419 switch (BTRFS_I(inode)->force_compress) {
420 case BTRFS_COMPRESS_ZLIB:
422 case BTRFS_COMPRESS_LZO: