blob: 145d2b89e62dce075903cb73234fd726e8fcec2f [file] [log] [blame]
Josef Bacik5103e942007-11-16 11:45:54 -05001/*
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>
Jim Owens0279b4c2009-02-04 09:29:13 -050024#include <linux/security.h>
Christoph Hellwig996a7102013-12-20 05:16:43 -080025#include <linux/posix_acl_xattr.h>
Josef Bacik5103e942007-11-16 11:45:54 -050026#include "ctree.h"
27#include "btrfs_inode.h"
28#include "transaction.h"
29#include "xattr.h"
30#include "disk-io.h"
Filipe David Borba Manana63541922014-01-07 11:47:46 +000031#include "props.h"
Filipe Manana5f5bc6b2014-11-09 08:38:39 +000032#include "locking.h"
Josef Bacik33268ea2008-07-24 12:16:36 -040033
Josef Bacik33268ea2008-07-24 12:16:36 -040034
Christoph Hellwig95819c02008-08-28 06:21:17 -040035ssize_t __btrfs_getxattr(struct inode *inode, const char *name,
36 void *buffer, size_t size)
Josef Bacik5103e942007-11-16 11:45:54 -050037{
38 struct btrfs_dir_item *di;
39 struct btrfs_root *root = BTRFS_I(inode)->root;
40 struct btrfs_path *path;
41 struct extent_buffer *leaf;
Josef Bacik5103e942007-11-16 11:45:54 -050042 int ret = 0;
43 unsigned long data_ptr;
Josef Bacik5103e942007-11-16 11:45:54 -050044
45 path = btrfs_alloc_path();
Christoph Hellwig95819c02008-08-28 06:21:17 -040046 if (!path)
Josef Bacik5103e942007-11-16 11:45:54 -050047 return -ENOMEM;
Josef Bacik5103e942007-11-16 11:45:54 -050048
Josef Bacik5103e942007-11-16 11:45:54 -050049 /* lookup the xattr by name */
Li Zefan33345d012011-04-20 10:31:50 +080050 di = btrfs_lookup_xattr(NULL, root, path, btrfs_ino(inode), name,
Josef Bacik5103e942007-11-16 11:45:54 -050051 strlen(name), 0);
Josef Bacik07060402009-01-21 10:49:16 -050052 if (!di) {
Josef Bacik5103e942007-11-16 11:45:54 -050053 ret = -ENODATA;
54 goto out;
Josef Bacik07060402009-01-21 10:49:16 -050055 } else if (IS_ERR(di)) {
56 ret = PTR_ERR(di);
57 goto out;
Josef Bacik5103e942007-11-16 11:45:54 -050058 }
59
60 leaf = path->nodes[0];
61 /* if size is 0, that means we want the size of the attr */
62 if (!size) {
63 ret = btrfs_dir_data_len(leaf, di);
64 goto out;
65 }
66
67 /* now get the data out of our dir_item */
68 if (btrfs_dir_data_len(leaf, di) > size) {
69 ret = -ERANGE;
70 goto out;
71 }
Josef Bacik07060402009-01-21 10:49:16 -050072
73 /*
74 * The way things are packed into the leaf is like this
75 * |struct btrfs_dir_item|name|data|
76 * where name is the xattr name, so security.foo, and data is the
77 * content of the xattr. data_ptr points to the location in memory
78 * where the data starts in the in memory leaf
79 */
Josef Bacik5103e942007-11-16 11:45:54 -050080 data_ptr = (unsigned long)((char *)(di + 1) +
81 btrfs_dir_name_len(leaf, di));
82 read_extent_buffer(leaf, buffer, data_ptr,
Josef Bacik3acd7ee2007-11-19 10:18:19 -050083 btrfs_dir_data_len(leaf, di));
Josef Bacik5103e942007-11-16 11:45:54 -050084 ret = btrfs_dir_data_len(leaf, di);
85
86out:
Josef Bacik5103e942007-11-16 11:45:54 -050087 btrfs_free_path(path);
88 return ret;
89}
90
Yan, Zhengf34f57a2009-11-12 09:35:27 +000091static int do_setxattr(struct btrfs_trans_handle *trans,
92 struct inode *inode, const char *name,
93 const void *value, size_t size, int flags)
Josef Bacik5103e942007-11-16 11:45:54 -050094{
Filipe Manana5f5bc6b2014-11-09 08:38:39 +000095 struct btrfs_dir_item *di = NULL;
Josef Bacik5103e942007-11-16 11:45:54 -050096 struct btrfs_root *root = BTRFS_I(inode)->root;
Josef Bacik5103e942007-11-16 11:45:54 -050097 struct btrfs_path *path;
Yan, Zhengf34f57a2009-11-12 09:35:27 +000098 size_t name_len = strlen(name);
99 int ret = 0;
100
101 if (name_len + size > BTRFS_MAX_XATTR_SIZE(root))
102 return -ENOSPC;
Josef Bacik5103e942007-11-16 11:45:54 -0500103
104 path = btrfs_alloc_path();
Christoph Hellwig95819c02008-08-28 06:21:17 -0400105 if (!path)
Josef Bacik5103e942007-11-16 11:45:54 -0500106 return -ENOMEM;
Filipe Manana5f5bc6b2014-11-09 08:38:39 +0000107 path->skip_release_on_error = 1;
Josef Bacik5103e942007-11-16 11:45:54 -0500108
Filipe Manana5f5bc6b2014-11-09 08:38:39 +0000109 if (!value) {
110 di = btrfs_lookup_xattr(trans, root, path, btrfs_ino(inode),
111 name, name_len, -1);
112 if (!di && (flags & XATTR_REPLACE))
113 ret = -ENODATA;
Filipe Manana5cdf83e2015-02-23 19:50:49 +0000114 else if (IS_ERR(di))
115 ret = PTR_ERR(di);
Filipe Manana5f5bc6b2014-11-09 08:38:39 +0000116 else if (di)
117 ret = btrfs_delete_one_dir_name(trans, root, path, di);
118 goto out;
119 }
120
121 /*
122 * For a replace we can't just do the insert blindly.
123 * Do a lookup first (read-only btrfs_search_slot), and return if xattr
124 * doesn't exist. If it exists, fall down below to the insert/replace
125 * path - we can't race with a concurrent xattr delete, because the VFS
126 * locks the inode's i_mutex before calling setxattr or removexattr.
127 */
Josef Bacikfa092002011-05-27 12:06:11 -0400128 if (flags & XATTR_REPLACE) {
Al Viro59551022016-01-22 15:40:57 -0500129 ASSERT(inode_is_locked(inode));
Filipe Manana5f5bc6b2014-11-09 08:38:39 +0000130 di = btrfs_lookup_xattr(NULL, root, path, btrfs_ino(inode),
131 name, name_len, 0);
Filipe Manana5cdf83e2015-02-23 19:50:49 +0000132 if (!di)
Josef Bacik33268ea2008-07-24 12:16:36 -0400133 ret = -ENODATA;
Filipe Manana5cdf83e2015-02-23 19:50:49 +0000134 else if (IS_ERR(di))
135 ret = PTR_ERR(di);
136 if (ret)
Josef Bacik33268ea2008-07-24 12:16:36 -0400137 goto out;
Josef Bacikfa092002011-05-27 12:06:11 -0400138 btrfs_release_path(path);
Filipe Manana5f5bc6b2014-11-09 08:38:39 +0000139 di = NULL;
Josef Bacik5103e942007-11-16 11:45:54 -0500140 }
141
Li Zefan33345d012011-04-20 10:31:50 +0800142 ret = btrfs_insert_xattr_item(trans, root, path, btrfs_ino(inode),
Yan, Zhengf34f57a2009-11-12 09:35:27 +0000143 name, name_len, value, size);
Filipe Manana5f5bc6b2014-11-09 08:38:39 +0000144 if (ret == -EOVERFLOW) {
145 /*
146 * We have an existing item in a leaf, split_leaf couldn't
147 * expand it. That item might have or not a dir_item that
148 * matches our target xattr, so lets check.
149 */
150 ret = 0;
151 btrfs_assert_tree_locked(path->nodes[0]);
152 di = btrfs_match_dir_item_name(root, path, name, name_len);
153 if (!di && !(flags & XATTR_REPLACE)) {
154 ret = -ENOSPC;
155 goto out;
156 }
157 } else if (ret == -EEXIST) {
158 ret = 0;
159 di = btrfs_match_dir_item_name(root, path, name, name_len);
160 ASSERT(di); /* logic error */
161 } else if (ret) {
162 goto out;
163 }
164
165 if (di && (flags & XATTR_CREATE)) {
Josef Baciked3ee9f2011-10-13 13:09:22 -0400166 ret = -EEXIST;
Filipe Manana5f5bc6b2014-11-09 08:38:39 +0000167 goto out;
168 }
Josef Baciked3ee9f2011-10-13 13:09:22 -0400169
Filipe Manana5f5bc6b2014-11-09 08:38:39 +0000170 if (di) {
Josef Bacikfa092002011-05-27 12:06:11 -0400171 /*
Filipe Manana5f5bc6b2014-11-09 08:38:39 +0000172 * We're doing a replace, and it must be atomic, that is, at
173 * any point in time we have either the old or the new xattr
174 * value in the tree. We don't want readers (getxattr and
175 * listxattrs) to miss a value, this is specially important
176 * for ACLs.
Josef Bacikfa092002011-05-27 12:06:11 -0400177 */
Filipe Manana5f5bc6b2014-11-09 08:38:39 +0000178 const int slot = path->slots[0];
179 struct extent_buffer *leaf = path->nodes[0];
180 const u16 old_data_len = btrfs_dir_data_len(leaf, di);
181 const u32 item_size = btrfs_item_size_nr(leaf, slot);
182 const u32 data_size = sizeof(*di) + name_len + size;
183 struct btrfs_item *item;
184 unsigned long data_ptr;
185 char *ptr;
186
187 if (size > old_data_len) {
188 if (btrfs_leaf_free_space(root, leaf) <
189 (size - old_data_len)) {
190 ret = -ENOSPC;
191 goto out;
192 }
Josef Bacikfa092002011-05-27 12:06:11 -0400193 }
194
Filipe Manana5f5bc6b2014-11-09 08:38:39 +0000195 if (old_data_len + name_len + sizeof(*di) == item_size) {
196 /* No other xattrs packed in the same leaf item. */
197 if (size > old_data_len)
198 btrfs_extend_item(root, path,
199 size - old_data_len);
200 else if (size < old_data_len)
201 btrfs_truncate_item(root, path, data_size, 1);
202 } else {
203 /* There are other xattrs packed in the same item. */
204 ret = btrfs_delete_one_dir_name(trans, root, path, di);
205 if (ret)
206 goto out;
207 btrfs_extend_item(root, path, data_size);
Josef Bacikfa092002011-05-27 12:06:11 -0400208 }
Filipe Manana5f5bc6b2014-11-09 08:38:39 +0000209
210 item = btrfs_item_nr(slot);
211 ptr = btrfs_item_ptr(leaf, slot, char);
212 ptr += btrfs_item_size(leaf, item) - data_size;
213 di = (struct btrfs_dir_item *)ptr;
214 btrfs_set_dir_data_len(leaf, di, size);
215 data_ptr = ((unsigned long)(di + 1)) + name_len;
216 write_extent_buffer(leaf, value, data_ptr, size);
217 btrfs_mark_buffer_dirty(leaf);
218 } else {
219 /*
220 * Insert, and we had space for the xattr, so path->slots[0] is
221 * where our xattr dir_item is and btrfs_insert_xattr_item()
222 * filled it.
223 */
Josef Bacikfa092002011-05-27 12:06:11 -0400224 }
Yan, Zhengf34f57a2009-11-12 09:35:27 +0000225out:
226 btrfs_free_path(path);
227 return ret;
228}
229
David Sterba48150532011-09-11 10:52:25 -0400230/*
231 * @value: "" makes the attribute to empty, NULL removes it
232 */
Yan, Zhengf34f57a2009-11-12 09:35:27 +0000233int __btrfs_setxattr(struct btrfs_trans_handle *trans,
234 struct inode *inode, const char *name,
235 const void *value, size_t size, int flags)
236{
237 struct btrfs_root *root = BTRFS_I(inode)->root;
238 int ret;
239
240 if (trans)
241 return do_setxattr(trans, inode, name, value, size, flags);
242
Yan, Zhenga22285a2010-05-16 10:48:46 -0400243 trans = btrfs_start_transaction(root, 2);
244 if (IS_ERR(trans))
245 return PTR_ERR(trans);
Yan, Zhengf34f57a2009-11-12 09:35:27 +0000246
Yan, Zhengf34f57a2009-11-12 09:35:27 +0000247 ret = do_setxattr(trans, inode, name, value, size, flags);
Josef Bacik5103e942007-11-16 11:45:54 -0500248 if (ret)
249 goto out;
Josef Bacik5103e942007-11-16 11:45:54 -0500250
Josef Bacik0c4d2d92012-04-05 15:03:02 -0400251 inode_inc_iversion(inode);
Deepa Dinamani04b285f2016-02-06 23:57:21 -0800252 inode->i_ctime = current_fs_time(inode->i_sb);
Josef Bacike9976152012-10-11 15:53:56 -0400253 set_bit(BTRFS_INODE_COPY_EVERYTHING, &BTRFS_I(inode)->runtime_flags);
Yan, Zhengf34f57a2009-11-12 09:35:27 +0000254 ret = btrfs_update_inode(trans, root, inode);
255 BUG_ON(ret);
Josef Bacik5103e942007-11-16 11:45:54 -0500256out:
Josef Bacik7ad85bb2012-01-12 19:10:12 -0500257 btrfs_end_transaction(trans, root);
Josef Bacik5103e942007-11-16 11:45:54 -0500258 return ret;
259}
260
261ssize_t btrfs_listxattr(struct dentry *dentry, char *buffer, size_t size)
262{
Filipe Mananadaac7ba2016-02-21 15:03:02 +0000263 struct btrfs_key key;
David Howells2b0143b2015-03-17 22:25:59 +0000264 struct inode *inode = d_inode(dentry);
Josef Bacik5103e942007-11-16 11:45:54 -0500265 struct btrfs_root *root = BTRFS_I(inode)->root;
266 struct btrfs_path *path;
Filipe Mananadaac7ba2016-02-21 15:03:02 +0000267 int ret = 0;
Christoph Hellwigeaa47d82008-08-28 06:21:16 -0400268 size_t total_size = 0, size_left = size;
Josef Bacik5103e942007-11-16 11:45:54 -0500269
270 /*
271 * ok we want all objects associated with this id.
272 * NOTE: we set key.offset = 0; because we want to start with the
273 * first xattr that we find and walk forward
274 */
Li Zefan33345d012011-04-20 10:31:50 +0800275 key.objectid = btrfs_ino(inode);
David Sterba962a2982014-06-04 18:41:45 +0200276 key.type = BTRFS_XATTR_ITEM_KEY;
Josef Bacik5103e942007-11-16 11:45:54 -0500277 key.offset = 0;
278
279 path = btrfs_alloc_path();
Josef Bacik5103e942007-11-16 11:45:54 -0500280 if (!path)
281 return -ENOMEM;
David Sterbae4058b52015-11-27 16:31:35 +0100282 path->reada = READA_FORWARD;
Josef Bacik5103e942007-11-16 11:45:54 -0500283
Josef Bacik5103e942007-11-16 11:45:54 -0500284 /* search for our xattrs */
285 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
286 if (ret < 0)
287 goto err;
Li Zefan2e6a0032011-03-17 15:17:59 +0800288
Josef Bacik5103e942007-11-16 11:45:54 -0500289 while (1) {
Filipe Mananadaac7ba2016-02-21 15:03:02 +0000290 struct extent_buffer *leaf;
291 int slot;
292 struct btrfs_dir_item *di;
293 struct btrfs_key found_key;
294 u32 item_size;
295 u32 cur;
296
Josef Bacik5103e942007-11-16 11:45:54 -0500297 leaf = path->nodes[0];
Josef Bacik5103e942007-11-16 11:45:54 -0500298 slot = path->slots[0];
299
300 /* this is where we start walking through the path */
Li Zefan2e6a0032011-03-17 15:17:59 +0800301 if (slot >= btrfs_header_nritems(leaf)) {
Josef Bacik5103e942007-11-16 11:45:54 -0500302 /*
303 * if we've reached the last slot in this leaf we need
304 * to go to the next leaf and reset everything
305 */
Li Zefan2e6a0032011-03-17 15:17:59 +0800306 ret = btrfs_next_leaf(root, path);
307 if (ret < 0)
308 goto err;
309 else if (ret > 0)
310 break;
311 continue;
Josef Bacik5103e942007-11-16 11:45:54 -0500312 }
Josef Bacik5103e942007-11-16 11:45:54 -0500313
Josef Bacik5103e942007-11-16 11:45:54 -0500314 btrfs_item_key_to_cpu(leaf, &found_key, slot);
315
316 /* check to make sure this item is what we want */
317 if (found_key.objectid != key.objectid)
318 break;
Filipe Mananaf1cd1f02015-11-09 18:06:38 +0000319 if (found_key.type > BTRFS_XATTR_ITEM_KEY)
Josef Bacik5103e942007-11-16 11:45:54 -0500320 break;
Filipe Mananaf1cd1f02015-11-09 18:06:38 +0000321 if (found_key.type < BTRFS_XATTR_ITEM_KEY)
Filipe Mananadaac7ba2016-02-21 15:03:02 +0000322 goto next_item;
Josef Bacik5103e942007-11-16 11:45:54 -0500323
324 di = btrfs_item_ptr(leaf, slot, struct btrfs_dir_item);
Filipe Mananadaac7ba2016-02-21 15:03:02 +0000325 item_size = btrfs_item_size_nr(leaf, slot);
326 cur = 0;
327 while (cur < item_size) {
328 u16 name_len = btrfs_dir_name_len(leaf, di);
329 u16 data_len = btrfs_dir_data_len(leaf, di);
330 u32 this_len = sizeof(*di) + name_len + data_len;
331 unsigned long name_ptr = (unsigned long)(di + 1);
Josef Bacik5103e942007-11-16 11:45:54 -0500332
Filipe Mananadaac7ba2016-02-21 15:03:02 +0000333 if (verify_dir_item(root, leaf, di)) {
334 ret = -EIO;
335 goto err;
336 }
Josef Bacik5103e942007-11-16 11:45:54 -0500337
Filipe Mananadaac7ba2016-02-21 15:03:02 +0000338 total_size += name_len + 1;
339 /*
340 * We are just looking for how big our buffer needs to
341 * be.
342 */
343 if (!size)
344 goto next;
Josef Bacik5103e942007-11-16 11:45:54 -0500345
Filipe Mananadaac7ba2016-02-21 15:03:02 +0000346 if (!buffer || (name_len + 1) > size_left) {
347 ret = -ERANGE;
348 goto err;
349 }
Josef Bacik5103e942007-11-16 11:45:54 -0500350
Filipe Mananadaac7ba2016-02-21 15:03:02 +0000351 read_extent_buffer(leaf, buffer, name_ptr, name_len);
352 buffer[name_len] = '\0';
Christoph Hellwigeaa47d82008-08-28 06:21:16 -0400353
Filipe Mananadaac7ba2016-02-21 15:03:02 +0000354 size_left -= name_len + 1;
355 buffer += name_len + 1;
Li Zefan2e6a0032011-03-17 15:17:59 +0800356next:
Filipe Mananadaac7ba2016-02-21 15:03:02 +0000357 cur += this_len;
358 di = (struct btrfs_dir_item *)((char *)di + this_len);
359 }
360next_item:
Li Zefan2e6a0032011-03-17 15:17:59 +0800361 path->slots[0]++;
Josef Bacik5103e942007-11-16 11:45:54 -0500362 }
363 ret = total_size;
364
365err:
Josef Bacik5103e942007-11-16 11:45:54 -0500366 btrfs_free_path(path);
367
368 return ret;
369}
370
Andreas Gruenbacher9172abb2015-12-02 14:44:37 +0100371static int btrfs_xattr_handler_get(const struct xattr_handler *handler,
372 struct dentry *dentry, const char *name,
373 void *buffer, size_t size)
374{
375 struct inode *inode = d_inode(dentry);
376
377 name = xattr_full_name(handler, name);
378 return __btrfs_getxattr(inode, name, buffer, size);
379}
380
381static int btrfs_xattr_handler_set(const struct xattr_handler *handler,
382 struct dentry *dentry, const char *name,
383 const void *buffer, size_t size,
384 int flags)
385{
386 struct inode *inode = d_inode(dentry);
387
388 name = xattr_full_name(handler, name);
389 return __btrfs_setxattr(NULL, inode, name, buffer, size, flags);
390}
391
392static int btrfs_xattr_handler_set_prop(const struct xattr_handler *handler,
393 struct dentry *dentry,
394 const char *name, const void *value,
395 size_t size, int flags)
396{
397 name = xattr_full_name(handler, name);
398 return btrfs_set_prop(d_inode(dentry), name, value, size, flags);
399}
400
401static const struct xattr_handler btrfs_security_xattr_handler = {
402 .prefix = XATTR_SECURITY_PREFIX,
403 .get = btrfs_xattr_handler_get,
404 .set = btrfs_xattr_handler_set,
405};
406
407static const struct xattr_handler btrfs_trusted_xattr_handler = {
408 .prefix = XATTR_TRUSTED_PREFIX,
409 .get = btrfs_xattr_handler_get,
410 .set = btrfs_xattr_handler_set,
411};
412
413static const struct xattr_handler btrfs_user_xattr_handler = {
414 .prefix = XATTR_USER_PREFIX,
415 .get = btrfs_xattr_handler_get,
416 .set = btrfs_xattr_handler_set,
417};
418
419static const struct xattr_handler btrfs_btrfs_xattr_handler = {
420 .prefix = XATTR_BTRFS_PREFIX,
421 .get = btrfs_xattr_handler_get,
422 .set = btrfs_xattr_handler_set_prop,
423};
424
Stephen Hemmingerf01cbd32010-05-13 17:53:15 -0700425const struct xattr_handler *btrfs_xattr_handlers[] = {
Andreas Gruenbacher9172abb2015-12-02 14:44:37 +0100426 &btrfs_security_xattr_handler,
Chris Mason0eda2942009-10-13 13:50:18 -0400427#ifdef CONFIG_BTRFS_FS_POSIX_ACL
Christoph Hellwig996a7102013-12-20 05:16:43 -0800428 &posix_acl_access_xattr_handler,
429 &posix_acl_default_xattr_handler,
Christoph Hellwig95819c02008-08-28 06:21:17 -0400430#endif
Andreas Gruenbacher9172abb2015-12-02 14:44:37 +0100431 &btrfs_trusted_xattr_handler,
432 &btrfs_user_xattr_handler,
433 &btrfs_btrfs_xattr_handler,
Christoph Hellwig95819c02008-08-28 06:21:17 -0400434 NULL,
435};
436
Christoph Hellwig95819c02008-08-28 06:21:17 -0400437int btrfs_setxattr(struct dentry *dentry, const char *name, const void *value,
438 size_t size, int flags)
439{
David Howells2b0143b2015-03-17 22:25:59 +0000440 struct btrfs_root *root = BTRFS_I(d_inode(dentry))->root;
Li Zefanb83cc962010-12-20 16:04:08 +0800441
Li Zefanb83cc962010-12-20 16:04:08 +0800442 if (btrfs_root_readonly(root))
443 return -EROFS;
Andreas Gruenbacher9172abb2015-12-02 14:44:37 +0100444 return generic_setxattr(dentry, name, value, size, flags);
Christoph Hellwig95819c02008-08-28 06:21:17 -0400445}
446
447int btrfs_removexattr(struct dentry *dentry, const char *name)
448{
David Howells2b0143b2015-03-17 22:25:59 +0000449 struct btrfs_root *root = BTRFS_I(d_inode(dentry))->root;
Li Zefanb83cc962010-12-20 16:04:08 +0800450
Li Zefanb83cc962010-12-20 16:04:08 +0800451 if (btrfs_root_readonly(root))
452 return -EROFS;
Andreas Gruenbacher9172abb2015-12-02 14:44:37 +0100453 return generic_removexattr(dentry, name);
Christoph Hellwig95819c02008-08-28 06:21:17 -0400454}
Jim Owens0279b4c2009-02-04 09:29:13 -0500455
Eric Sandeen48a3b632013-04-25 20:41:01 +0000456static int btrfs_initxattrs(struct inode *inode,
457 const struct xattr *xattr_array, void *fs_info)
Mimi Zohar9d8f13b2011-06-06 15:29:25 -0400458{
459 const struct xattr *xattr;
460 struct btrfs_trans_handle *trans = fs_info;
461 char *name;
462 int err = 0;
463
464 for (xattr = xattr_array; xattr->name != NULL; xattr++) {
465 name = kmalloc(XATTR_SECURITY_PREFIX_LEN +
David Sterba39a27ec2015-12-03 12:49:48 +0100466 strlen(xattr->name) + 1, GFP_KERNEL);
Mimi Zohar9d8f13b2011-06-06 15:29:25 -0400467 if (!name) {
468 err = -ENOMEM;
469 break;
470 }
471 strcpy(name, XATTR_SECURITY_PREFIX);
472 strcpy(name + XATTR_SECURITY_PREFIX_LEN, xattr->name);
473 err = __btrfs_setxattr(trans, inode, name,
474 xattr->value, xattr->value_len, 0);
475 kfree(name);
476 if (err < 0)
477 break;
478 }
479 return err;
480}
481
Yan, Zhengf34f57a2009-11-12 09:35:27 +0000482int btrfs_xattr_security_init(struct btrfs_trans_handle *trans,
Eric Paris2a7dba32011-02-01 11:05:39 -0500483 struct inode *inode, struct inode *dir,
484 const struct qstr *qstr)
Jim Owens0279b4c2009-02-04 09:29:13 -0500485{
Mimi Zohar9d8f13b2011-06-06 15:29:25 -0400486 return security_inode_init_security(inode, dir, qstr,
487 &btrfs_initxattrs, trans);
Jim Owens0279b4c2009-02-04 09:29:13 -0500488}