Loading...
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>
24#include <linux/security.h>
25#include "ctree.h"
26#include "btrfs_inode.h"
27#include "transaction.h"
28#include "xattr.h"
29#include "disk-io.h"
30
31
32ssize_t __btrfs_getxattr(struct inode *inode, const char *name,
33 void *buffer, size_t size)
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;
39 int ret = 0;
40 unsigned long data_ptr;
41
42 path = btrfs_alloc_path();
43 if (!path)
44 return -ENOMEM;
45
46 /* lookup the xattr by name */
47 di = btrfs_lookup_xattr(NULL, root, path, btrfs_ino(inode), name,
48 strlen(name), 0);
49 if (!di) {
50 ret = -ENODATA;
51 goto out;
52 } else if (IS_ERR(di)) {
53 ret = PTR_ERR(di);
54 goto out;
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 }
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 */
77 data_ptr = (unsigned long)((char *)(di + 1) +
78 btrfs_dir_name_len(leaf, di));
79 read_extent_buffer(leaf, buffer, data_ptr,
80 btrfs_dir_data_len(leaf, di));
81 ret = btrfs_dir_data_len(leaf, di);
82
83out:
84 btrfs_free_path(path);
85 return ret;
86}
87
88static int do_setxattr(struct btrfs_trans_handle *trans,
89 struct inode *inode, const char *name,
90 const void *value, size_t size, int flags)
91{
92 struct btrfs_dir_item *di;
93 struct btrfs_root *root = BTRFS_I(inode)->root;
94 struct btrfs_path *path;
95 size_t name_len = strlen(name);
96 int ret = 0;
97
98 if (name_len + size > BTRFS_MAX_XATTR_SIZE(root))
99 return -ENOSPC;
100
101 path = btrfs_alloc_path();
102 if (!path)
103 return -ENOMEM;
104
105 if (flags & XATTR_REPLACE) {
106 di = btrfs_lookup_xattr(trans, root, path, btrfs_ino(inode), name,
107 name_len, -1);
108 if (IS_ERR(di)) {
109 ret = PTR_ERR(di);
110 goto out;
111 } else if (!di) {
112 ret = -ENODATA;
113 goto out;
114 }
115 ret = btrfs_delete_one_dir_name(trans, root, path, di);
116 if (ret)
117 goto out;
118 btrfs_release_path(path);
119
120 /*
121 * remove the attribute
122 */
123 if (!value)
124 goto out;
125 }
126
127again:
128 ret = btrfs_insert_xattr_item(trans, root, path, btrfs_ino(inode),
129 name, name_len, value, size);
130 /*
131 * If we're setting an xattr to a new value but the new value is say
132 * exactly BTRFS_MAX_XATTR_SIZE, we could end up with EOVERFLOW getting
133 * back from split_leaf. This is because it thinks we'll be extending
134 * the existing item size, but we're asking for enough space to add the
135 * item itself. So if we get EOVERFLOW just set ret to EEXIST and let
136 * the rest of the function figure it out.
137 */
138 if (ret == -EOVERFLOW)
139 ret = -EEXIST;
140
141 if (ret == -EEXIST) {
142 if (flags & XATTR_CREATE)
143 goto out;
144 /*
145 * We can't use the path we already have since we won't have the
146 * proper locking for a delete, so release the path and
147 * re-lookup to delete the thing.
148 */
149 btrfs_release_path(path);
150 di = btrfs_lookup_xattr(trans, root, path, btrfs_ino(inode),
151 name, name_len, -1);
152 if (IS_ERR(di)) {
153 ret = PTR_ERR(di);
154 goto out;
155 } else if (!di) {
156 /* Shouldn't happen but just in case... */
157 btrfs_release_path(path);
158 goto again;
159 }
160
161 ret = btrfs_delete_one_dir_name(trans, root, path, di);
162 if (ret)
163 goto out;
164
165 /*
166 * We have a value to set, so go back and try to insert it now.
167 */
168 if (value) {
169 btrfs_release_path(path);
170 goto again;
171 }
172 }
173out:
174 btrfs_free_path(path);
175 return ret;
176}
177
178/*
179 * @value: "" makes the attribute to empty, NULL removes it
180 */
181int __btrfs_setxattr(struct btrfs_trans_handle *trans,
182 struct inode *inode, const char *name,
183 const void *value, size_t size, int flags)
184{
185 struct btrfs_root *root = BTRFS_I(inode)->root;
186 int ret;
187
188 if (trans)
189 return do_setxattr(trans, inode, name, value, size, flags);
190
191 trans = btrfs_start_transaction(root, 2);
192 if (IS_ERR(trans))
193 return PTR_ERR(trans);
194
195 ret = do_setxattr(trans, inode, name, value, size, flags);
196 if (ret)
197 goto out;
198
199 inode_inc_iversion(inode);
200 inode->i_ctime = CURRENT_TIME;
201 ret = btrfs_update_inode(trans, root, inode);
202 BUG_ON(ret);
203out:
204 btrfs_end_transaction(trans, root);
205 return ret;
206}
207
208ssize_t btrfs_listxattr(struct dentry *dentry, char *buffer, size_t size)
209{
210 struct btrfs_key key, found_key;
211 struct inode *inode = dentry->d_inode;
212 struct btrfs_root *root = BTRFS_I(inode)->root;
213 struct btrfs_path *path;
214 struct extent_buffer *leaf;
215 struct btrfs_dir_item *di;
216 int ret = 0, slot;
217 size_t total_size = 0, size_left = size;
218 unsigned long name_ptr;
219 size_t name_len;
220
221 /*
222 * ok we want all objects associated with this id.
223 * NOTE: we set key.offset = 0; because we want to start with the
224 * first xattr that we find and walk forward
225 */
226 key.objectid = btrfs_ino(inode);
227 btrfs_set_key_type(&key, BTRFS_XATTR_ITEM_KEY);
228 key.offset = 0;
229
230 path = btrfs_alloc_path();
231 if (!path)
232 return -ENOMEM;
233 path->reada = 2;
234
235 /* search for our xattrs */
236 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
237 if (ret < 0)
238 goto err;
239
240 while (1) {
241 leaf = path->nodes[0];
242 slot = path->slots[0];
243
244 /* this is where we start walking through the path */
245 if (slot >= btrfs_header_nritems(leaf)) {
246 /*
247 * if we've reached the last slot in this leaf we need
248 * to go to the next leaf and reset everything
249 */
250 ret = btrfs_next_leaf(root, path);
251 if (ret < 0)
252 goto err;
253 else if (ret > 0)
254 break;
255 continue;
256 }
257
258 btrfs_item_key_to_cpu(leaf, &found_key, slot);
259
260 /* check to make sure this item is what we want */
261 if (found_key.objectid != key.objectid)
262 break;
263 if (btrfs_key_type(&found_key) != BTRFS_XATTR_ITEM_KEY)
264 break;
265
266 di = btrfs_item_ptr(leaf, slot, struct btrfs_dir_item);
267 if (verify_dir_item(root, leaf, di))
268 continue;
269
270 name_len = btrfs_dir_name_len(leaf, di);
271 total_size += name_len + 1;
272
273 /* we are just looking for how big our buffer needs to be */
274 if (!size)
275 goto next;
276
277 if (!buffer || (name_len + 1) > size_left) {
278 ret = -ERANGE;
279 goto err;
280 }
281
282 name_ptr = (unsigned long)(di + 1);
283 read_extent_buffer(leaf, buffer, name_ptr, name_len);
284 buffer[name_len] = '\0';
285
286 size_left -= name_len + 1;
287 buffer += name_len + 1;
288next:
289 path->slots[0]++;
290 }
291 ret = total_size;
292
293err:
294 btrfs_free_path(path);
295
296 return ret;
297}
298
299/*
300 * List of handlers for synthetic system.* attributes. All real ondisk
301 * attributes are handled directly.
302 */
303const struct xattr_handler *btrfs_xattr_handlers[] = {
304#ifdef CONFIG_BTRFS_FS_POSIX_ACL
305 &btrfs_xattr_acl_access_handler,
306 &btrfs_xattr_acl_default_handler,
307#endif
308 NULL,
309};
310
311/*
312 * Check if the attribute is in a supported namespace.
313 *
314 * This applied after the check for the synthetic attributes in the system
315 * namespace.
316 */
317static bool btrfs_is_valid_xattr(const char *name)
318{
319 return !strncmp(name, XATTR_SECURITY_PREFIX,
320 XATTR_SECURITY_PREFIX_LEN) ||
321 !strncmp(name, XATTR_SYSTEM_PREFIX, XATTR_SYSTEM_PREFIX_LEN) ||
322 !strncmp(name, XATTR_TRUSTED_PREFIX, XATTR_TRUSTED_PREFIX_LEN) ||
323 !strncmp(name, XATTR_USER_PREFIX, XATTR_USER_PREFIX_LEN);
324}
325
326ssize_t btrfs_getxattr(struct dentry *dentry, const char *name,
327 void *buffer, size_t size)
328{
329 /*
330 * If this is a request for a synthetic attribute in the system.*
331 * namespace use the generic infrastructure to resolve a handler
332 * for it via sb->s_xattr.
333 */
334 if (!strncmp(name, XATTR_SYSTEM_PREFIX, XATTR_SYSTEM_PREFIX_LEN))
335 return generic_getxattr(dentry, name, buffer, size);
336
337 if (!btrfs_is_valid_xattr(name))
338 return -EOPNOTSUPP;
339 return __btrfs_getxattr(dentry->d_inode, name, buffer, size);
340}
341
342int btrfs_setxattr(struct dentry *dentry, const char *name, const void *value,
343 size_t size, int flags)
344{
345 struct btrfs_root *root = BTRFS_I(dentry->d_inode)->root;
346
347 /*
348 * The permission on security.* and system.* is not checked
349 * in permission().
350 */
351 if (btrfs_root_readonly(root))
352 return -EROFS;
353
354 /*
355 * If this is a request for a synthetic attribute in the system.*
356 * namespace use the generic infrastructure to resolve a handler
357 * for it via sb->s_xattr.
358 */
359 if (!strncmp(name, XATTR_SYSTEM_PREFIX, XATTR_SYSTEM_PREFIX_LEN))
360 return generic_setxattr(dentry, name, value, size, flags);
361
362 if (!btrfs_is_valid_xattr(name))
363 return -EOPNOTSUPP;
364
365 if (size == 0)
366 value = ""; /* empty EA, do not remove */
367
368 return __btrfs_setxattr(NULL, dentry->d_inode, name, value, size,
369 flags);
370}
371
372int btrfs_removexattr(struct dentry *dentry, const char *name)
373{
374 struct btrfs_root *root = BTRFS_I(dentry->d_inode)->root;
375
376 /*
377 * The permission on security.* and system.* is not checked
378 * in permission().
379 */
380 if (btrfs_root_readonly(root))
381 return -EROFS;
382
383 /*
384 * If this is a request for a synthetic attribute in the system.*
385 * namespace use the generic infrastructure to resolve a handler
386 * for it via sb->s_xattr.
387 */
388 if (!strncmp(name, XATTR_SYSTEM_PREFIX, XATTR_SYSTEM_PREFIX_LEN))
389 return generic_removexattr(dentry, name);
390
391 if (!btrfs_is_valid_xattr(name))
392 return -EOPNOTSUPP;
393
394 return __btrfs_setxattr(NULL, dentry->d_inode, name, NULL, 0,
395 XATTR_REPLACE);
396}
397
398int btrfs_initxattrs(struct inode *inode, const struct xattr *xattr_array,
399 void *fs_info)
400{
401 const struct xattr *xattr;
402 struct btrfs_trans_handle *trans = fs_info;
403 char *name;
404 int err = 0;
405
406 for (xattr = xattr_array; xattr->name != NULL; xattr++) {
407 name = kmalloc(XATTR_SECURITY_PREFIX_LEN +
408 strlen(xattr->name) + 1, GFP_NOFS);
409 if (!name) {
410 err = -ENOMEM;
411 break;
412 }
413 strcpy(name, XATTR_SECURITY_PREFIX);
414 strcpy(name + XATTR_SECURITY_PREFIX_LEN, xattr->name);
415 err = __btrfs_setxattr(trans, inode, name,
416 xattr->value, xattr->value_len, 0);
417 kfree(name);
418 if (err < 0)
419 break;
420 }
421 return err;
422}
423
424int btrfs_xattr_security_init(struct btrfs_trans_handle *trans,
425 struct inode *inode, struct inode *dir,
426 const struct qstr *qstr)
427{
428 return security_inode_init_security(inode, dir, qstr,
429 &btrfs_initxattrs, trans);
430}
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>
24#include <linux/security.h>
25#include <linux/posix_acl_xattr.h>
26#include "ctree.h"
27#include "btrfs_inode.h"
28#include "transaction.h"
29#include "xattr.h"
30#include "disk-io.h"
31#include "props.h"
32#include "locking.h"
33
34
35ssize_t __btrfs_getxattr(struct inode *inode, const char *name,
36 void *buffer, size_t size)
37{
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;
42 int ret = 0;
43 unsigned long data_ptr;
44
45 path = btrfs_alloc_path();
46 if (!path)
47 return -ENOMEM;
48
49 /* lookup the xattr by name */
50 di = btrfs_lookup_xattr(NULL, root, path, btrfs_ino(inode), name,
51 strlen(name), 0);
52 if (!di) {
53 ret = -ENODATA;
54 goto out;
55 } else if (IS_ERR(di)) {
56 ret = PTR_ERR(di);
57 goto out;
58 }
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 }
72
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 */
80 data_ptr = (unsigned long)((char *)(di + 1) +
81 btrfs_dir_name_len(leaf, di));
82 read_extent_buffer(leaf, buffer, data_ptr,
83 btrfs_dir_data_len(leaf, di));
84 ret = btrfs_dir_data_len(leaf, di);
85
86out:
87 btrfs_free_path(path);
88 return ret;
89}
90
91static int do_setxattr(struct btrfs_trans_handle *trans,
92 struct inode *inode, const char *name,
93 const void *value, size_t size, int flags)
94{
95 struct btrfs_dir_item *di = NULL;
96 struct btrfs_root *root = BTRFS_I(inode)->root;
97 struct btrfs_fs_info *fs_info = root->fs_info;
98 struct btrfs_path *path;
99 size_t name_len = strlen(name);
100 int ret = 0;
101
102 if (name_len + size > BTRFS_MAX_XATTR_SIZE(root->fs_info))
103 return -ENOSPC;
104
105 path = btrfs_alloc_path();
106 if (!path)
107 return -ENOMEM;
108 path->skip_release_on_error = 1;
109
110 if (!value) {
111 di = btrfs_lookup_xattr(trans, root, path, btrfs_ino(inode),
112 name, name_len, -1);
113 if (!di && (flags & XATTR_REPLACE))
114 ret = -ENODATA;
115 else if (IS_ERR(di))
116 ret = PTR_ERR(di);
117 else if (di)
118 ret = btrfs_delete_one_dir_name(trans, root, path, di);
119 goto out;
120 }
121
122 /*
123 * For a replace we can't just do the insert blindly.
124 * Do a lookup first (read-only btrfs_search_slot), and return if xattr
125 * doesn't exist. If it exists, fall down below to the insert/replace
126 * path - we can't race with a concurrent xattr delete, because the VFS
127 * locks the inode's i_mutex before calling setxattr or removexattr.
128 */
129 if (flags & XATTR_REPLACE) {
130 ASSERT(inode_is_locked(inode));
131 di = btrfs_lookup_xattr(NULL, root, path, btrfs_ino(inode),
132 name, name_len, 0);
133 if (!di)
134 ret = -ENODATA;
135 else if (IS_ERR(di))
136 ret = PTR_ERR(di);
137 if (ret)
138 goto out;
139 btrfs_release_path(path);
140 di = NULL;
141 }
142
143 ret = btrfs_insert_xattr_item(trans, root, path, btrfs_ino(inode),
144 name, name_len, value, size);
145 if (ret == -EOVERFLOW) {
146 /*
147 * We have an existing item in a leaf, split_leaf couldn't
148 * expand it. That item might have or not a dir_item that
149 * matches our target xattr, so lets check.
150 */
151 ret = 0;
152 btrfs_assert_tree_locked(path->nodes[0]);
153 di = btrfs_match_dir_item_name(fs_info, path, name, name_len);
154 if (!di && !(flags & XATTR_REPLACE)) {
155 ret = -ENOSPC;
156 goto out;
157 }
158 } else if (ret == -EEXIST) {
159 ret = 0;
160 di = btrfs_match_dir_item_name(fs_info, path, name, name_len);
161 ASSERT(di); /* logic error */
162 } else if (ret) {
163 goto out;
164 }
165
166 if (di && (flags & XATTR_CREATE)) {
167 ret = -EEXIST;
168 goto out;
169 }
170
171 if (di) {
172 /*
173 * We're doing a replace, and it must be atomic, that is, at
174 * any point in time we have either the old or the new xattr
175 * value in the tree. We don't want readers (getxattr and
176 * listxattrs) to miss a value, this is specially important
177 * for ACLs.
178 */
179 const int slot = path->slots[0];
180 struct extent_buffer *leaf = path->nodes[0];
181 const u16 old_data_len = btrfs_dir_data_len(leaf, di);
182 const u32 item_size = btrfs_item_size_nr(leaf, slot);
183 const u32 data_size = sizeof(*di) + name_len + size;
184 struct btrfs_item *item;
185 unsigned long data_ptr;
186 char *ptr;
187
188 if (size > old_data_len) {
189 if (btrfs_leaf_free_space(fs_info, leaf) <
190 (size - old_data_len)) {
191 ret = -ENOSPC;
192 goto out;
193 }
194 }
195
196 if (old_data_len + name_len + sizeof(*di) == item_size) {
197 /* No other xattrs packed in the same leaf item. */
198 if (size > old_data_len)
199 btrfs_extend_item(fs_info, path,
200 size - old_data_len);
201 else if (size < old_data_len)
202 btrfs_truncate_item(fs_info, path,
203 data_size, 1);
204 } else {
205 /* There are other xattrs packed in the same item. */
206 ret = btrfs_delete_one_dir_name(trans, root, path, di);
207 if (ret)
208 goto out;
209 btrfs_extend_item(fs_info, path, data_size);
210 }
211
212 item = btrfs_item_nr(slot);
213 ptr = btrfs_item_ptr(leaf, slot, char);
214 ptr += btrfs_item_size(leaf, item) - data_size;
215 di = (struct btrfs_dir_item *)ptr;
216 btrfs_set_dir_data_len(leaf, di, size);
217 data_ptr = ((unsigned long)(di + 1)) + name_len;
218 write_extent_buffer(leaf, value, data_ptr, size);
219 btrfs_mark_buffer_dirty(leaf);
220 } else {
221 /*
222 * Insert, and we had space for the xattr, so path->slots[0] is
223 * where our xattr dir_item is and btrfs_insert_xattr_item()
224 * filled it.
225 */
226 }
227out:
228 btrfs_free_path(path);
229 return ret;
230}
231
232/*
233 * @value: "" makes the attribute to empty, NULL removes it
234 */
235int __btrfs_setxattr(struct btrfs_trans_handle *trans,
236 struct inode *inode, const char *name,
237 const void *value, size_t size, int flags)
238{
239 struct btrfs_root *root = BTRFS_I(inode)->root;
240 int ret;
241
242 if (btrfs_root_readonly(root))
243 return -EROFS;
244
245 if (trans)
246 return do_setxattr(trans, inode, name, value, size, flags);
247
248 trans = btrfs_start_transaction(root, 2);
249 if (IS_ERR(trans))
250 return PTR_ERR(trans);
251
252 ret = do_setxattr(trans, inode, name, value, size, flags);
253 if (ret)
254 goto out;
255
256 inode_inc_iversion(inode);
257 inode->i_ctime = current_time(inode);
258 set_bit(BTRFS_INODE_COPY_EVERYTHING, &BTRFS_I(inode)->runtime_flags);
259 ret = btrfs_update_inode(trans, root, inode);
260 BUG_ON(ret);
261out:
262 btrfs_end_transaction(trans);
263 return ret;
264}
265
266ssize_t btrfs_listxattr(struct dentry *dentry, char *buffer, size_t size)
267{
268 struct btrfs_key key;
269 struct inode *inode = d_inode(dentry);
270 struct btrfs_fs_info *fs_info = btrfs_sb(inode->i_sb);
271 struct btrfs_root *root = BTRFS_I(inode)->root;
272 struct btrfs_path *path;
273 int ret = 0;
274 size_t total_size = 0, size_left = size;
275
276 /*
277 * ok we want all objects associated with this id.
278 * NOTE: we set key.offset = 0; because we want to start with the
279 * first xattr that we find and walk forward
280 */
281 key.objectid = btrfs_ino(inode);
282 key.type = BTRFS_XATTR_ITEM_KEY;
283 key.offset = 0;
284
285 path = btrfs_alloc_path();
286 if (!path)
287 return -ENOMEM;
288 path->reada = READA_FORWARD;
289
290 /* search for our xattrs */
291 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
292 if (ret < 0)
293 goto err;
294
295 while (1) {
296 struct extent_buffer *leaf;
297 int slot;
298 struct btrfs_dir_item *di;
299 struct btrfs_key found_key;
300 u32 item_size;
301 u32 cur;
302
303 leaf = path->nodes[0];
304 slot = path->slots[0];
305
306 /* this is where we start walking through the path */
307 if (slot >= btrfs_header_nritems(leaf)) {
308 /*
309 * if we've reached the last slot in this leaf we need
310 * to go to the next leaf and reset everything
311 */
312 ret = btrfs_next_leaf(root, path);
313 if (ret < 0)
314 goto err;
315 else if (ret > 0)
316 break;
317 continue;
318 }
319
320 btrfs_item_key_to_cpu(leaf, &found_key, slot);
321
322 /* check to make sure this item is what we want */
323 if (found_key.objectid != key.objectid)
324 break;
325 if (found_key.type > BTRFS_XATTR_ITEM_KEY)
326 break;
327 if (found_key.type < BTRFS_XATTR_ITEM_KEY)
328 goto next_item;
329
330 di = btrfs_item_ptr(leaf, slot, struct btrfs_dir_item);
331 item_size = btrfs_item_size_nr(leaf, slot);
332 cur = 0;
333 while (cur < item_size) {
334 u16 name_len = btrfs_dir_name_len(leaf, di);
335 u16 data_len = btrfs_dir_data_len(leaf, di);
336 u32 this_len = sizeof(*di) + name_len + data_len;
337 unsigned long name_ptr = (unsigned long)(di + 1);
338
339 if (verify_dir_item(fs_info, leaf, di)) {
340 ret = -EIO;
341 goto err;
342 }
343
344 total_size += name_len + 1;
345 /*
346 * We are just looking for how big our buffer needs to
347 * be.
348 */
349 if (!size)
350 goto next;
351
352 if (!buffer || (name_len + 1) > size_left) {
353 ret = -ERANGE;
354 goto err;
355 }
356
357 read_extent_buffer(leaf, buffer, name_ptr, name_len);
358 buffer[name_len] = '\0';
359
360 size_left -= name_len + 1;
361 buffer += name_len + 1;
362next:
363 cur += this_len;
364 di = (struct btrfs_dir_item *)((char *)di + this_len);
365 }
366next_item:
367 path->slots[0]++;
368 }
369 ret = total_size;
370
371err:
372 btrfs_free_path(path);
373
374 return ret;
375}
376
377static int btrfs_xattr_handler_get(const struct xattr_handler *handler,
378 struct dentry *unused, struct inode *inode,
379 const char *name, void *buffer, size_t size)
380{
381 name = xattr_full_name(handler, name);
382 return __btrfs_getxattr(inode, name, buffer, size);
383}
384
385static int btrfs_xattr_handler_set(const struct xattr_handler *handler,
386 struct dentry *unused, struct inode *inode,
387 const char *name, const void *buffer,
388 size_t size, int flags)
389{
390 name = xattr_full_name(handler, name);
391 return __btrfs_setxattr(NULL, inode, name, buffer, size, flags);
392}
393
394static int btrfs_xattr_handler_set_prop(const struct xattr_handler *handler,
395 struct dentry *unused, struct inode *inode,
396 const char *name, const void *value,
397 size_t size, int flags)
398{
399 name = xattr_full_name(handler, name);
400 return btrfs_set_prop(inode, name, value, size, flags);
401}
402
403static const struct xattr_handler btrfs_security_xattr_handler = {
404 .prefix = XATTR_SECURITY_PREFIX,
405 .get = btrfs_xattr_handler_get,
406 .set = btrfs_xattr_handler_set,
407};
408
409static const struct xattr_handler btrfs_trusted_xattr_handler = {
410 .prefix = XATTR_TRUSTED_PREFIX,
411 .get = btrfs_xattr_handler_get,
412 .set = btrfs_xattr_handler_set,
413};
414
415static const struct xattr_handler btrfs_user_xattr_handler = {
416 .prefix = XATTR_USER_PREFIX,
417 .get = btrfs_xattr_handler_get,
418 .set = btrfs_xattr_handler_set,
419};
420
421static const struct xattr_handler btrfs_btrfs_xattr_handler = {
422 .prefix = XATTR_BTRFS_PREFIX,
423 .get = btrfs_xattr_handler_get,
424 .set = btrfs_xattr_handler_set_prop,
425};
426
427const struct xattr_handler *btrfs_xattr_handlers[] = {
428 &btrfs_security_xattr_handler,
429#ifdef CONFIG_BTRFS_FS_POSIX_ACL
430 &posix_acl_access_xattr_handler,
431 &posix_acl_default_xattr_handler,
432#endif
433 &btrfs_trusted_xattr_handler,
434 &btrfs_user_xattr_handler,
435 &btrfs_btrfs_xattr_handler,
436 NULL,
437};
438
439static int btrfs_initxattrs(struct inode *inode,
440 const struct xattr *xattr_array, void *fs_info)
441{
442 const struct xattr *xattr;
443 struct btrfs_trans_handle *trans = fs_info;
444 char *name;
445 int err = 0;
446
447 for (xattr = xattr_array; xattr->name != NULL; xattr++) {
448 name = kmalloc(XATTR_SECURITY_PREFIX_LEN +
449 strlen(xattr->name) + 1, GFP_KERNEL);
450 if (!name) {
451 err = -ENOMEM;
452 break;
453 }
454 strcpy(name, XATTR_SECURITY_PREFIX);
455 strcpy(name + XATTR_SECURITY_PREFIX_LEN, xattr->name);
456 err = __btrfs_setxattr(trans, inode, name,
457 xattr->value, xattr->value_len, 0);
458 kfree(name);
459 if (err < 0)
460 break;
461 }
462 return err;
463}
464
465int btrfs_xattr_security_init(struct btrfs_trans_handle *trans,
466 struct inode *inode, struct inode *dir,
467 const struct qstr *qstr)
468{
469 return security_inode_init_security(inode, dir, qstr,
470 &btrfs_initxattrs, trans);
471}