Commit | Line | Data |
---|---|---|
c1d7c514 | 1 | // SPDX-License-Identifier: GPL-2.0 |
5103e947 JB |
2 | /* |
3 | * Copyright (C) 2007 Red Hat. All rights reserved. | |
5103e947 JB |
4 | */ |
5 | ||
6 | #include <linux/init.h> | |
7 | #include <linux/fs.h> | |
8 | #include <linux/slab.h> | |
9 | #include <linux/rwsem.h> | |
10 | #include <linux/xattr.h> | |
0279b4cd | 11 | #include <linux/security.h> |
996a710d | 12 | #include <linux/posix_acl_xattr.h> |
ae5e165d | 13 | #include <linux/iversion.h> |
827aa18e | 14 | #include <linux/sched/mm.h> |
5103e947 JB |
15 | #include "ctree.h" |
16 | #include "btrfs_inode.h" | |
17 | #include "transaction.h" | |
18 | #include "xattr.h" | |
19 | #include "disk-io.h" | |
63541927 | 20 | #include "props.h" |
5f5bc6b1 | 21 | #include "locking.h" |
33268eaf | 22 | |
bcadd705 | 23 | int btrfs_getxattr(struct inode *inode, const char *name, |
95819c05 | 24 | void *buffer, size_t size) |
5103e947 JB |
25 | { |
26 | struct btrfs_dir_item *di; | |
27 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
28 | struct btrfs_path *path; | |
29 | struct extent_buffer *leaf; | |
5103e947 JB |
30 | int ret = 0; |
31 | unsigned long data_ptr; | |
5103e947 JB |
32 | |
33 | path = btrfs_alloc_path(); | |
95819c05 | 34 | if (!path) |
5103e947 | 35 | return -ENOMEM; |
5103e947 | 36 | |
5103e947 | 37 | /* lookup the xattr by name */ |
f85b7379 DS |
38 | di = btrfs_lookup_xattr(NULL, root, path, btrfs_ino(BTRFS_I(inode)), |
39 | name, strlen(name), 0); | |
07060404 | 40 | if (!di) { |
5103e947 JB |
41 | ret = -ENODATA; |
42 | goto out; | |
07060404 JB |
43 | } else if (IS_ERR(di)) { |
44 | ret = PTR_ERR(di); | |
45 | goto out; | |
5103e947 JB |
46 | } |
47 | ||
48 | leaf = path->nodes[0]; | |
49 | /* if size is 0, that means we want the size of the attr */ | |
50 | if (!size) { | |
51 | ret = btrfs_dir_data_len(leaf, di); | |
52 | goto out; | |
53 | } | |
54 | ||
55 | /* now get the data out of our dir_item */ | |
56 | if (btrfs_dir_data_len(leaf, di) > size) { | |
57 | ret = -ERANGE; | |
58 | goto out; | |
59 | } | |
07060404 JB |
60 | |
61 | /* | |
62 | * The way things are packed into the leaf is like this | |
63 | * |struct btrfs_dir_item|name|data| | |
64 | * where name is the xattr name, so security.foo, and data is the | |
65 | * content of the xattr. data_ptr points to the location in memory | |
66 | * where the data starts in the in memory leaf | |
67 | */ | |
5103e947 JB |
68 | data_ptr = (unsigned long)((char *)(di + 1) + |
69 | btrfs_dir_name_len(leaf, di)); | |
70 | read_extent_buffer(leaf, buffer, data_ptr, | |
3acd7ee8 | 71 | btrfs_dir_data_len(leaf, di)); |
5103e947 JB |
72 | ret = btrfs_dir_data_len(leaf, di); |
73 | ||
74 | out: | |
5103e947 JB |
75 | btrfs_free_path(path); |
76 | return ret; | |
77 | } | |
78 | ||
3e125a74 AJ |
79 | int btrfs_setxattr(struct btrfs_trans_handle *trans, struct inode *inode, |
80 | const char *name, const void *value, size_t size, int flags) | |
5103e947 | 81 | { |
5f5bc6b1 | 82 | struct btrfs_dir_item *di = NULL; |
5103e947 | 83 | struct btrfs_root *root = BTRFS_I(inode)->root; |
2ff7e61e | 84 | struct btrfs_fs_info *fs_info = root->fs_info; |
5103e947 | 85 | struct btrfs_path *path; |
f34f57a3 YZ |
86 | size_t name_len = strlen(name); |
87 | int ret = 0; | |
88 | ||
04e6863b AJ |
89 | ASSERT(trans); |
90 | ||
da17066c | 91 | if (name_len + size > BTRFS_MAX_XATTR_SIZE(root->fs_info)) |
f34f57a3 | 92 | return -ENOSPC; |
5103e947 JB |
93 | |
94 | path = btrfs_alloc_path(); | |
95819c05 | 95 | if (!path) |
5103e947 | 96 | return -ENOMEM; |
5f5bc6b1 FM |
97 | path->skip_release_on_error = 1; |
98 | ||
99 | if (!value) { | |
f85b7379 DS |
100 | di = btrfs_lookup_xattr(trans, root, path, |
101 | btrfs_ino(BTRFS_I(inode)), name, name_len, -1); | |
5f5bc6b1 FM |
102 | if (!di && (flags & XATTR_REPLACE)) |
103 | ret = -ENODATA; | |
5cdf83ed FM |
104 | else if (IS_ERR(di)) |
105 | ret = PTR_ERR(di); | |
5f5bc6b1 FM |
106 | else if (di) |
107 | ret = btrfs_delete_one_dir_name(trans, root, path, di); | |
108 | goto out; | |
109 | } | |
5103e947 | 110 | |
5f5bc6b1 FM |
111 | /* |
112 | * For a replace we can't just do the insert blindly. | |
113 | * Do a lookup first (read-only btrfs_search_slot), and return if xattr | |
114 | * doesn't exist. If it exists, fall down below to the insert/replace | |
115 | * path - we can't race with a concurrent xattr delete, because the VFS | |
116 | * locks the inode's i_mutex before calling setxattr or removexattr. | |
117 | */ | |
fa09200b | 118 | if (flags & XATTR_REPLACE) { |
5955102c | 119 | ASSERT(inode_is_locked(inode)); |
f85b7379 DS |
120 | di = btrfs_lookup_xattr(NULL, root, path, |
121 | btrfs_ino(BTRFS_I(inode)), name, name_len, 0); | |
5cdf83ed | 122 | if (!di) |
fa09200b | 123 | ret = -ENODATA; |
5cdf83ed FM |
124 | else if (IS_ERR(di)) |
125 | ret = PTR_ERR(di); | |
126 | if (ret) | |
5103e947 | 127 | goto out; |
b3b4aa74 | 128 | btrfs_release_path(path); |
5f5bc6b1 FM |
129 | di = NULL; |
130 | } | |
4815053a | 131 | |
4a0cc7ca | 132 | ret = btrfs_insert_xattr_item(trans, root, path, btrfs_ino(BTRFS_I(inode)), |
5f5bc6b1 FM |
133 | name, name_len, value, size); |
134 | if (ret == -EOVERFLOW) { | |
4815053a | 135 | /* |
5f5bc6b1 FM |
136 | * We have an existing item in a leaf, split_leaf couldn't |
137 | * expand it. That item might have or not a dir_item that | |
138 | * matches our target xattr, so lets check. | |
4815053a | 139 | */ |
5f5bc6b1 | 140 | ret = 0; |
49d0c642 | 141 | btrfs_assert_tree_write_locked(path->nodes[0]); |
2ff7e61e | 142 | di = btrfs_match_dir_item_name(fs_info, path, name, name_len); |
5f5bc6b1 FM |
143 | if (!di && !(flags & XATTR_REPLACE)) { |
144 | ret = -ENOSPC; | |
01e6deb2 LB |
145 | goto out; |
146 | } | |
5f5bc6b1 FM |
147 | } else if (ret == -EEXIST) { |
148 | ret = 0; | |
2ff7e61e | 149 | di = btrfs_match_dir_item_name(fs_info, path, name, name_len); |
5f5bc6b1 FM |
150 | ASSERT(di); /* logic error */ |
151 | } else if (ret) { | |
152 | goto out; | |
fa09200b | 153 | } |
5103e947 | 154 | |
5f5bc6b1 | 155 | if (di && (flags & XATTR_CREATE)) { |
ed3ee9f4 | 156 | ret = -EEXIST; |
5f5bc6b1 FM |
157 | goto out; |
158 | } | |
ed3ee9f4 | 159 | |
5f5bc6b1 | 160 | if (di) { |
fa09200b | 161 | /* |
5f5bc6b1 FM |
162 | * We're doing a replace, and it must be atomic, that is, at |
163 | * any point in time we have either the old or the new xattr | |
164 | * value in the tree. We don't want readers (getxattr and | |
165 | * listxattrs) to miss a value, this is specially important | |
166 | * for ACLs. | |
fa09200b | 167 | */ |
5f5bc6b1 FM |
168 | const int slot = path->slots[0]; |
169 | struct extent_buffer *leaf = path->nodes[0]; | |
170 | const u16 old_data_len = btrfs_dir_data_len(leaf, di); | |
3212fa14 | 171 | const u32 item_size = btrfs_item_size(leaf, slot); |
5f5bc6b1 | 172 | const u32 data_size = sizeof(*di) + name_len + size; |
5f5bc6b1 FM |
173 | unsigned long data_ptr; |
174 | char *ptr; | |
175 | ||
176 | if (size > old_data_len) { | |
e902baac | 177 | if (btrfs_leaf_free_space(leaf) < |
5f5bc6b1 FM |
178 | (size - old_data_len)) { |
179 | ret = -ENOSPC; | |
180 | goto out; | |
181 | } | |
fa09200b | 182 | } |
33268eaf | 183 | |
5f5bc6b1 FM |
184 | if (old_data_len + name_len + sizeof(*di) == item_size) { |
185 | /* No other xattrs packed in the same leaf item. */ | |
186 | if (size > old_data_len) | |
c71dd880 | 187 | btrfs_extend_item(path, size - old_data_len); |
5f5bc6b1 | 188 | else if (size < old_data_len) |
78ac4f9e | 189 | btrfs_truncate_item(path, data_size, 1); |
5f5bc6b1 FM |
190 | } else { |
191 | /* There are other xattrs packed in the same item. */ | |
192 | ret = btrfs_delete_one_dir_name(trans, root, path, di); | |
193 | if (ret) | |
194 | goto out; | |
c71dd880 | 195 | btrfs_extend_item(path, data_size); |
5f5bc6b1 | 196 | } |
fa09200b | 197 | |
5f5bc6b1 | 198 | ptr = btrfs_item_ptr(leaf, slot, char); |
3212fa14 | 199 | ptr += btrfs_item_size(leaf, slot) - data_size; |
5f5bc6b1 FM |
200 | di = (struct btrfs_dir_item *)ptr; |
201 | btrfs_set_dir_data_len(leaf, di, size); | |
202 | data_ptr = ((unsigned long)(di + 1)) + name_len; | |
203 | write_extent_buffer(leaf, value, data_ptr, size); | |
204 | btrfs_mark_buffer_dirty(leaf); | |
205 | } else { | |
fa09200b | 206 | /* |
5f5bc6b1 FM |
207 | * Insert, and we had space for the xattr, so path->slots[0] is |
208 | * where our xattr dir_item is and btrfs_insert_xattr_item() | |
209 | * filled it. | |
fa09200b | 210 | */ |
5103e947 | 211 | } |
f34f57a3 YZ |
212 | out: |
213 | btrfs_free_path(path); | |
f2f121ab | 214 | if (!ret) { |
3763771c FM |
215 | set_bit(BTRFS_INODE_COPY_EVERYTHING, |
216 | &BTRFS_I(inode)->runtime_flags); | |
f2f121ab FM |
217 | clear_bit(BTRFS_INODE_NO_XATTRS, &BTRFS_I(inode)->runtime_flags); |
218 | } | |
f34f57a3 YZ |
219 | return ret; |
220 | } | |
221 | ||
4815053a DS |
222 | /* |
223 | * @value: "" makes the attribute to empty, NULL removes it | |
224 | */ | |
e3de9b15 | 225 | int btrfs_setxattr_trans(struct inode *inode, const char *name, |
cac237ae | 226 | const void *value, size_t size, int flags) |
f34f57a3 YZ |
227 | { |
228 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
e3de9b15 | 229 | struct btrfs_trans_handle *trans; |
fd57a98d | 230 | const bool start_trans = (current->journal_info == NULL); |
f34f57a3 YZ |
231 | int ret; |
232 | ||
fd57a98d FM |
233 | if (start_trans) { |
234 | /* | |
235 | * 1 unit for inserting/updating/deleting the xattr | |
236 | * 1 unit for the inode item update | |
237 | */ | |
238 | trans = btrfs_start_transaction(root, 2); | |
239 | if (IS_ERR(trans)) | |
240 | return PTR_ERR(trans); | |
241 | } else { | |
242 | /* | |
243 | * This can happen when smack is enabled and a directory is being | |
244 | * created. It happens through d_instantiate_new(), which calls | |
245 | * smack_d_instantiate(), which in turn calls __vfs_setxattr() to | |
246 | * set the transmute xattr (XATTR_NAME_SMACKTRANSMUTE) on the | |
247 | * inode. We have already reserved space for the xattr and inode | |
248 | * update at btrfs_mkdir(), so just use the transaction handle. | |
249 | * We don't join or start a transaction, as that will reset the | |
250 | * block_rsv of the handle and trigger a warning for the start | |
251 | * case. | |
252 | */ | |
253 | ASSERT(strncmp(name, XATTR_SECURITY_PREFIX, | |
254 | XATTR_SECURITY_PREFIX_LEN) == 0); | |
255 | trans = current->journal_info; | |
256 | } | |
5103e947 | 257 | |
2d74fa3e | 258 | ret = btrfs_setxattr(trans, inode, name, value, size, flags); |
f34f57a3 YZ |
259 | if (ret) |
260 | goto out; | |
261 | ||
0c4d2d95 | 262 | inode_inc_iversion(inode); |
c2050a45 | 263 | inode->i_ctime = current_time(inode); |
9a56fcd1 | 264 | ret = btrfs_update_inode(trans, root, BTRFS_I(inode)); |
193b4e83 FM |
265 | if (ret) |
266 | btrfs_abort_transaction(trans, ret); | |
f34f57a3 | 267 | out: |
fd57a98d FM |
268 | if (start_trans) |
269 | btrfs_end_transaction(trans); | |
5103e947 JB |
270 | return ret; |
271 | } | |
272 | ||
273 | ssize_t btrfs_listxattr(struct dentry *dentry, char *buffer, size_t size) | |
274 | { | |
daac7ba6 | 275 | struct btrfs_key key; |
2b0143b5 | 276 | struct inode *inode = d_inode(dentry); |
5103e947 JB |
277 | struct btrfs_root *root = BTRFS_I(inode)->root; |
278 | struct btrfs_path *path; | |
daac7ba6 | 279 | int ret = 0; |
eaa47d86 | 280 | size_t total_size = 0, size_left = size; |
5103e947 JB |
281 | |
282 | /* | |
283 | * ok we want all objects associated with this id. | |
284 | * NOTE: we set key.offset = 0; because we want to start with the | |
285 | * first xattr that we find and walk forward | |
286 | */ | |
4a0cc7ca | 287 | key.objectid = btrfs_ino(BTRFS_I(inode)); |
962a298f | 288 | key.type = BTRFS_XATTR_ITEM_KEY; |
5103e947 JB |
289 | key.offset = 0; |
290 | ||
291 | path = btrfs_alloc_path(); | |
5103e947 JB |
292 | if (!path) |
293 | return -ENOMEM; | |
e4058b54 | 294 | path->reada = READA_FORWARD; |
5103e947 | 295 | |
5103e947 JB |
296 | /* search for our xattrs */ |
297 | ret = btrfs_search_slot(NULL, root, &key, path, 0, 0); | |
298 | if (ret < 0) | |
299 | goto err; | |
2e6a0035 | 300 | |
5103e947 | 301 | while (1) { |
daac7ba6 FM |
302 | struct extent_buffer *leaf; |
303 | int slot; | |
304 | struct btrfs_dir_item *di; | |
305 | struct btrfs_key found_key; | |
306 | u32 item_size; | |
307 | u32 cur; | |
308 | ||
5103e947 | 309 | leaf = path->nodes[0]; |
5103e947 JB |
310 | slot = path->slots[0]; |
311 | ||
312 | /* this is where we start walking through the path */ | |
2e6a0035 | 313 | if (slot >= btrfs_header_nritems(leaf)) { |
5103e947 JB |
314 | /* |
315 | * if we've reached the last slot in this leaf we need | |
316 | * to go to the next leaf and reset everything | |
317 | */ | |
2e6a0035 LZ |
318 | ret = btrfs_next_leaf(root, path); |
319 | if (ret < 0) | |
320 | goto err; | |
321 | else if (ret > 0) | |
322 | break; | |
323 | continue; | |
5103e947 | 324 | } |
5103e947 | 325 | |
5103e947 JB |
326 | btrfs_item_key_to_cpu(leaf, &found_key, slot); |
327 | ||
328 | /* check to make sure this item is what we want */ | |
329 | if (found_key.objectid != key.objectid) | |
330 | break; | |
f1cd1f0b | 331 | if (found_key.type > BTRFS_XATTR_ITEM_KEY) |
5103e947 | 332 | break; |
f1cd1f0b | 333 | if (found_key.type < BTRFS_XATTR_ITEM_KEY) |
daac7ba6 | 334 | goto next_item; |
5103e947 JB |
335 | |
336 | di = btrfs_item_ptr(leaf, slot, struct btrfs_dir_item); | |
3212fa14 | 337 | item_size = btrfs_item_size(leaf, slot); |
daac7ba6 FM |
338 | cur = 0; |
339 | while (cur < item_size) { | |
340 | u16 name_len = btrfs_dir_name_len(leaf, di); | |
341 | u16 data_len = btrfs_dir_data_len(leaf, di); | |
342 | u32 this_len = sizeof(*di) + name_len + data_len; | |
343 | unsigned long name_ptr = (unsigned long)(di + 1); | |
344 | ||
daac7ba6 FM |
345 | total_size += name_len + 1; |
346 | /* | |
347 | * We are just looking for how big our buffer needs to | |
348 | * be. | |
349 | */ | |
350 | if (!size) | |
351 | goto next; | |
5103e947 | 352 | |
daac7ba6 FM |
353 | if (!buffer || (name_len + 1) > size_left) { |
354 | ret = -ERANGE; | |
355 | goto err; | |
356 | } | |
5103e947 | 357 | |
daac7ba6 FM |
358 | read_extent_buffer(leaf, buffer, name_ptr, name_len); |
359 | buffer[name_len] = '\0'; | |
eaa47d86 | 360 | |
daac7ba6 FM |
361 | size_left -= name_len + 1; |
362 | buffer += name_len + 1; | |
2e6a0035 | 363 | next: |
daac7ba6 FM |
364 | cur += this_len; |
365 | di = (struct btrfs_dir_item *)((char *)di + this_len); | |
366 | } | |
367 | next_item: | |
2e6a0035 | 368 | path->slots[0]++; |
5103e947 JB |
369 | } |
370 | ret = total_size; | |
371 | ||
372 | err: | |
5103e947 JB |
373 | btrfs_free_path(path); |
374 | ||
375 | return ret; | |
376 | } | |
377 | ||
9172abbc | 378 | static int btrfs_xattr_handler_get(const struct xattr_handler *handler, |
b296821a AV |
379 | struct dentry *unused, struct inode *inode, |
380 | const char *name, void *buffer, size_t size) | |
95819c05 | 381 | { |
9172abbc | 382 | name = xattr_full_name(handler, name); |
7852781d | 383 | return btrfs_getxattr(inode, name, buffer, size); |
69a32ac5 CM |
384 | } |
385 | ||
9172abbc | 386 | static int btrfs_xattr_handler_set(const struct xattr_handler *handler, |
e65ce2a5 | 387 | struct user_namespace *mnt_userns, |
59301226 AV |
388 | struct dentry *unused, struct inode *inode, |
389 | const char *name, const void *buffer, | |
390 | size_t size, int flags) | |
95819c05 | 391 | { |
9172abbc | 392 | name = xattr_full_name(handler, name); |
e3de9b15 | 393 | return btrfs_setxattr_trans(inode, name, buffer, size, flags); |
9172abbc | 394 | } |
5103e947 | 395 | |
9172abbc | 396 | static int btrfs_xattr_handler_set_prop(const struct xattr_handler *handler, |
e65ce2a5 | 397 | struct user_namespace *mnt_userns, |
59301226 | 398 | struct dentry *unused, struct inode *inode, |
9172abbc AG |
399 | const char *name, const void *value, |
400 | size_t size, int flags) | |
401 | { | |
f22125e5 | 402 | int ret; |
b3f6a4be AJ |
403 | struct btrfs_trans_handle *trans; |
404 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
f22125e5 | 405 | |
9172abbc | 406 | name = xattr_full_name(handler, name); |
0e852ab8 | 407 | ret = btrfs_validate_prop(BTRFS_I(inode), name, value, size); |
f22125e5 AJ |
408 | if (ret) |
409 | return ret; | |
b3f6a4be | 410 | |
4b73c55f FM |
411 | if (btrfs_ignore_prop(BTRFS_I(inode), name)) |
412 | return 0; | |
413 | ||
b3f6a4be AJ |
414 | trans = btrfs_start_transaction(root, 2); |
415 | if (IS_ERR(trans)) | |
416 | return PTR_ERR(trans); | |
417 | ||
418 | ret = btrfs_set_prop(trans, inode, name, value, size, flags); | |
419 | if (!ret) { | |
420 | inode_inc_iversion(inode); | |
421 | inode->i_ctime = current_time(inode); | |
9a56fcd1 | 422 | ret = btrfs_update_inode(trans, root, BTRFS_I(inode)); |
193b4e83 FM |
423 | if (ret) |
424 | btrfs_abort_transaction(trans, ret); | |
b3f6a4be AJ |
425 | } |
426 | ||
427 | btrfs_end_transaction(trans); | |
428 | ||
429 | return ret; | |
95819c05 | 430 | } |
5103e947 | 431 | |
9172abbc AG |
432 | static const struct xattr_handler btrfs_security_xattr_handler = { |
433 | .prefix = XATTR_SECURITY_PREFIX, | |
434 | .get = btrfs_xattr_handler_get, | |
435 | .set = btrfs_xattr_handler_set, | |
436 | }; | |
437 | ||
438 | static const struct xattr_handler btrfs_trusted_xattr_handler = { | |
439 | .prefix = XATTR_TRUSTED_PREFIX, | |
440 | .get = btrfs_xattr_handler_get, | |
441 | .set = btrfs_xattr_handler_set, | |
442 | }; | |
443 | ||
444 | static const struct xattr_handler btrfs_user_xattr_handler = { | |
445 | .prefix = XATTR_USER_PREFIX, | |
446 | .get = btrfs_xattr_handler_get, | |
447 | .set = btrfs_xattr_handler_set, | |
448 | }; | |
449 | ||
450 | static const struct xattr_handler btrfs_btrfs_xattr_handler = { | |
451 | .prefix = XATTR_BTRFS_PREFIX, | |
452 | .get = btrfs_xattr_handler_get, | |
453 | .set = btrfs_xattr_handler_set_prop, | |
454 | }; | |
455 | ||
456 | const struct xattr_handler *btrfs_xattr_handlers[] = { | |
457 | &btrfs_security_xattr_handler, | |
458 | #ifdef CONFIG_BTRFS_FS_POSIX_ACL | |
459 | &posix_acl_access_xattr_handler, | |
460 | &posix_acl_default_xattr_handler, | |
461 | #endif | |
462 | &btrfs_trusted_xattr_handler, | |
463 | &btrfs_user_xattr_handler, | |
464 | &btrfs_btrfs_xattr_handler, | |
465 | NULL, | |
466 | }; | |
467 | ||
48a3b636 | 468 | static int btrfs_initxattrs(struct inode *inode, |
419a6f30 | 469 | const struct xattr *xattr_array, void *fs_private) |
0279b4cd | 470 | { |
419a6f30 | 471 | struct btrfs_trans_handle *trans = fs_private; |
9d8f13ba | 472 | const struct xattr *xattr; |
827aa18e | 473 | unsigned int nofs_flag; |
0279b4cd | 474 | char *name; |
9d8f13ba | 475 | int err = 0; |
0279b4cd | 476 | |
827aa18e FM |
477 | /* |
478 | * We're holding a transaction handle, so use a NOFS memory allocation | |
479 | * context to avoid deadlock if reclaim happens. | |
480 | */ | |
481 | nofs_flag = memalloc_nofs_save(); | |
9d8f13ba MZ |
482 | for (xattr = xattr_array; xattr->name != NULL; xattr++) { |
483 | name = kmalloc(XATTR_SECURITY_PREFIX_LEN + | |
39a27ec1 | 484 | strlen(xattr->name) + 1, GFP_KERNEL); |
9d8f13ba MZ |
485 | if (!name) { |
486 | err = -ENOMEM; | |
487 | break; | |
488 | } | |
0279b4cd | 489 | strcpy(name, XATTR_SECURITY_PREFIX); |
9d8f13ba | 490 | strcpy(name + XATTR_SECURITY_PREFIX_LEN, xattr->name); |
04e6863b AJ |
491 | err = btrfs_setxattr(trans, inode, name, xattr->value, |
492 | xattr->value_len, 0); | |
0279b4cd | 493 | kfree(name); |
9d8f13ba MZ |
494 | if (err < 0) |
495 | break; | |
0279b4cd | 496 | } |
827aa18e | 497 | memalloc_nofs_restore(nofs_flag); |
0279b4cd JO |
498 | return err; |
499 | } | |
9d8f13ba MZ |
500 | |
501 | int btrfs_xattr_security_init(struct btrfs_trans_handle *trans, | |
502 | struct inode *inode, struct inode *dir, | |
503 | const struct qstr *qstr) | |
504 | { | |
505 | return security_inode_init_security(inode, dir, qstr, | |
506 | &btrfs_initxattrs, trans); | |
507 | } |