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