Commit | Line | Data |
---|---|---|
1da177e4 LT |
1 | /* |
2 | * Copyright (C) International Business Machines Corp., 2000-2004 | |
3 | * Copyright (C) Christoph Hellwig, 2002 | |
4 | * | |
5 | * This program is free software; you can redistribute it and/or modify | |
6 | * it under the terms of the GNU General Public License as published by | |
63f83c9f | 7 | * the Free Software Foundation; either version 2 of the License, or |
1da177e4 | 8 | * (at your option) any later version. |
63f83c9f | 9 | * |
1da177e4 LT |
10 | * This program is distributed in the hope that it will be useful, |
11 | * but WITHOUT ANY WARRANTY; without even the implied warranty of | |
12 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See | |
13 | * the GNU General Public License for more details. | |
14 | * | |
15 | * You should have received a copy of the GNU General Public License | |
63f83c9f | 16 | * along with this program; if not, write to the Free Software |
1da177e4 LT |
17 | * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA |
18 | */ | |
19 | ||
16f7e0fe | 20 | #include <linux/capability.h> |
1da177e4 LT |
21 | #include <linux/fs.h> |
22 | #include <linux/xattr.h> | |
9a59f452 | 23 | #include <linux/posix_acl_xattr.h> |
5a0e3ad6 | 24 | #include <linux/slab.h> |
1da177e4 | 25 | #include <linux/quotaops.h> |
1d15b10f | 26 | #include <linux/security.h> |
1da177e4 LT |
27 | #include "jfs_incore.h" |
28 | #include "jfs_superblock.h" | |
29 | #include "jfs_dmap.h" | |
30 | #include "jfs_debug.h" | |
31 | #include "jfs_dinode.h" | |
32 | #include "jfs_extent.h" | |
33 | #include "jfs_metapage.h" | |
34 | #include "jfs_xattr.h" | |
35 | #include "jfs_acl.h" | |
36 | ||
37 | /* | |
38 | * jfs_xattr.c: extended attribute service | |
39 | * | |
40 | * Overall design -- | |
41 | * | |
42 | * Format: | |
43 | * | |
44 | * Extended attribute lists (jfs_ea_list) consist of an overall size (32 bit | |
45 | * value) and a variable (0 or more) number of extended attribute | |
46 | * entries. Each extended attribute entry (jfs_ea) is a <name,value> double | |
47 | * where <name> is constructed from a null-terminated ascii string | |
48 | * (1 ... 255 bytes in the name) and <value> is arbitrary 8 bit data | |
49 | * (1 ... 65535 bytes). The in-memory format is | |
50 | * | |
51 | * 0 1 2 4 4 + namelen + 1 | |
52 | * +-------+--------+--------+----------------+-------------------+ | |
53 | * | Flags | Name | Value | Name String \0 | Data . . . . | | |
54 | * | | Length | Length | | | | |
55 | * +-------+--------+--------+----------------+-------------------+ | |
56 | * | |
57 | * A jfs_ea_list then is structured as | |
58 | * | |
59 | * 0 4 4 + EA_SIZE(ea1) | |
60 | * +------------+-------------------+--------------------+----- | |
63f83c9f | 61 | * | Overall EA | First FEA Element | Second FEA Element | ..... |
1da177e4 LT |
62 | * | List Size | | | |
63 | * +------------+-------------------+--------------------+----- | |
64 | * | |
65 | * On-disk: | |
66 | * | |
f720e3ba DK |
67 | * FEALISTs are stored on disk using blocks allocated by dbAlloc() and |
68 | * written directly. An EA list may be in-lined in the inode if there is | |
69 | * sufficient room available. | |
1da177e4 LT |
70 | */ |
71 | ||
72 | struct ea_buffer { | |
73 | int flag; /* Indicates what storage xattr points to */ | |
74 | int max_size; /* largest xattr that fits in current buffer */ | |
75 | dxd_t new_ea; /* dxd to replace ea when modifying xattr */ | |
76 | struct metapage *mp; /* metapage containing ea list */ | |
77 | struct jfs_ea_list *xattr; /* buffer containing ea list */ | |
78 | }; | |
79 | ||
80 | /* | |
81 | * ea_buffer.flag values | |
82 | */ | |
83 | #define EA_INLINE 0x0001 | |
84 | #define EA_EXTENT 0x0002 | |
85 | #define EA_NEW 0x0004 | |
86 | #define EA_MALLOC 0x0008 | |
87 | ||
1da177e4 | 88 | |
aca0fa34 DK |
89 | static int is_known_namespace(const char *name) |
90 | { | |
91 | if (strncmp(name, XATTR_SYSTEM_PREFIX, XATTR_SYSTEM_PREFIX_LEN) && | |
92 | strncmp(name, XATTR_USER_PREFIX, XATTR_USER_PREFIX_LEN) && | |
93 | strncmp(name, XATTR_SECURITY_PREFIX, XATTR_SECURITY_PREFIX_LEN) && | |
94 | strncmp(name, XATTR_TRUSTED_PREFIX, XATTR_TRUSTED_PREFIX_LEN)) | |
95 | return false; | |
96 | ||
97 | return true; | |
98 | } | |
99 | ||
1da177e4 LT |
100 | /* |
101 | * These three routines are used to recognize on-disk extended attributes | |
102 | * that are in a recognized namespace. If the attribute is not recognized, | |
103 | * "os2." is prepended to the name | |
104 | */ | |
aca0fa34 | 105 | static int is_os2_xattr(struct jfs_ea *ea) |
1da177e4 | 106 | { |
aca0fa34 | 107 | return !is_known_namespace(ea->name); |
1da177e4 LT |
108 | } |
109 | ||
110 | static inline int name_size(struct jfs_ea *ea) | |
111 | { | |
112 | if (is_os2_xattr(ea)) | |
113 | return ea->namelen + XATTR_OS2_PREFIX_LEN; | |
114 | else | |
115 | return ea->namelen; | |
116 | } | |
117 | ||
118 | static inline int copy_name(char *buffer, struct jfs_ea *ea) | |
119 | { | |
120 | int len = ea->namelen; | |
121 | ||
122 | if (is_os2_xattr(ea)) { | |
123 | memcpy(buffer, XATTR_OS2_PREFIX, XATTR_OS2_PREFIX_LEN); | |
124 | buffer += XATTR_OS2_PREFIX_LEN; | |
125 | len += XATTR_OS2_PREFIX_LEN; | |
126 | } | |
127 | memcpy(buffer, ea->name, ea->namelen); | |
128 | buffer[ea->namelen] = 0; | |
129 | ||
130 | return len; | |
131 | } | |
132 | ||
133 | /* Forward references */ | |
134 | static void ea_release(struct inode *inode, struct ea_buffer *ea_buf); | |
135 | ||
136 | /* | |
137 | * NAME: ea_write_inline | |
63f83c9f | 138 | * |
1da177e4 | 139 | * FUNCTION: Attempt to write an EA inline if area is available |
63f83c9f | 140 | * |
1da177e4 LT |
141 | * PRE CONDITIONS: |
142 | * Already verified that the specified EA is small enough to fit inline | |
143 | * | |
144 | * PARAMETERS: | |
145 | * ip - Inode pointer | |
146 | * ealist - EA list pointer | |
147 | * size - size of ealist in bytes | |
148 | * ea - dxd_t structure to be filled in with necessary EA information | |
149 | * if we successfully copy the EA inline | |
150 | * | |
151 | * NOTES: | |
152 | * Checks if the inode's inline area is available. If so, copies EA inline | |
153 | * and sets <ea> fields appropriately. Otherwise, returns failure, EA will | |
154 | * have to be put into an extent. | |
155 | * | |
156 | * RETURNS: 0 for successful copy to inline area; -1 if area not available | |
157 | */ | |
158 | static int ea_write_inline(struct inode *ip, struct jfs_ea_list *ealist, | |
159 | int size, dxd_t * ea) | |
160 | { | |
161 | struct jfs_inode_info *ji = JFS_IP(ip); | |
162 | ||
163 | /* | |
164 | * Make sure we have an EA -- the NULL EA list is valid, but you | |
165 | * can't copy it! | |
166 | */ | |
167 | if (ealist && size > sizeof (struct jfs_ea_list)) { | |
168 | assert(size <= sizeof (ji->i_inline_ea)); | |
169 | ||
170 | /* | |
171 | * See if the space is available or if it is already being | |
172 | * used for an inline EA. | |
173 | */ | |
174 | if (!(ji->mode2 & INLINEEA) && !(ji->ea.flag & DXD_INLINE)) | |
175 | return -EPERM; | |
176 | ||
177 | DXDsize(ea, size); | |
178 | DXDlength(ea, 0); | |
179 | DXDaddress(ea, 0); | |
180 | memcpy(ji->i_inline_ea, ealist, size); | |
181 | ea->flag = DXD_INLINE; | |
182 | ji->mode2 &= ~INLINEEA; | |
183 | } else { | |
184 | ea->flag = 0; | |
185 | DXDsize(ea, 0); | |
186 | DXDlength(ea, 0); | |
187 | DXDaddress(ea, 0); | |
188 | ||
189 | /* Free up INLINE area */ | |
190 | if (ji->ea.flag & DXD_INLINE) | |
191 | ji->mode2 |= INLINEEA; | |
192 | } | |
193 | ||
194 | return 0; | |
195 | } | |
196 | ||
197 | /* | |
198 | * NAME: ea_write | |
63f83c9f | 199 | * |
1da177e4 | 200 | * FUNCTION: Write an EA for an inode |
63f83c9f DK |
201 | * |
202 | * PRE CONDITIONS: EA has been verified | |
1da177e4 LT |
203 | * |
204 | * PARAMETERS: | |
205 | * ip - Inode pointer | |
206 | * ealist - EA list pointer | |
207 | * size - size of ealist in bytes | |
208 | * ea - dxd_t structure to be filled in appropriately with where the | |
209 | * EA was copied | |
210 | * | |
211 | * NOTES: Will write EA inline if able to, otherwise allocates blocks for an | |
212 | * extent and synchronously writes it to those blocks. | |
213 | * | |
214 | * RETURNS: 0 for success; Anything else indicates failure | |
215 | */ | |
216 | static int ea_write(struct inode *ip, struct jfs_ea_list *ealist, int size, | |
217 | dxd_t * ea) | |
218 | { | |
219 | struct super_block *sb = ip->i_sb; | |
220 | struct jfs_inode_info *ji = JFS_IP(ip); | |
221 | struct jfs_sb_info *sbi = JFS_SBI(sb); | |
222 | int nblocks; | |
223 | s64 blkno; | |
224 | int rc = 0, i; | |
225 | char *cp; | |
226 | s32 nbytes, nb; | |
227 | s32 bytes_to_write; | |
228 | struct metapage *mp; | |
229 | ||
230 | /* | |
231 | * Quick check to see if this is an in-linable EA. Short EAs | |
232 | * and empty EAs are all in-linable, provided the space exists. | |
233 | */ | |
234 | if (!ealist || size <= sizeof (ji->i_inline_ea)) { | |
235 | if (!ea_write_inline(ip, ealist, size, ea)) | |
236 | return 0; | |
237 | } | |
238 | ||
239 | /* figure out how many blocks we need */ | |
240 | nblocks = (size + (sb->s_blocksize - 1)) >> sb->s_blocksize_bits; | |
241 | ||
242 | /* Allocate new blocks to quota. */ | |
5dd4056d CH |
243 | rc = dquot_alloc_block(ip, nblocks); |
244 | if (rc) | |
245 | return rc; | |
1da177e4 LT |
246 | |
247 | rc = dbAlloc(ip, INOHINT(ip), nblocks, &blkno); | |
248 | if (rc) { | |
249 | /*Rollback quota allocation. */ | |
5dd4056d | 250 | dquot_free_block(ip, nblocks); |
1da177e4 LT |
251 | return rc; |
252 | } | |
253 | ||
254 | /* | |
255 | * Now have nblocks worth of storage to stuff into the FEALIST. | |
256 | * loop over the FEALIST copying data into the buffer one page at | |
257 | * a time. | |
258 | */ | |
259 | cp = (char *) ealist; | |
260 | nbytes = size; | |
261 | for (i = 0; i < nblocks; i += sbi->nbperpage) { | |
262 | /* | |
263 | * Determine how many bytes for this request, and round up to | |
264 | * the nearest aggregate block size | |
265 | */ | |
266 | nb = min(PSIZE, nbytes); | |
267 | bytes_to_write = | |
268 | ((((nb + sb->s_blocksize - 1)) >> sb->s_blocksize_bits)) | |
269 | << sb->s_blocksize_bits; | |
270 | ||
271 | if (!(mp = get_metapage(ip, blkno + i, bytes_to_write, 1))) { | |
272 | rc = -EIO; | |
273 | goto failed; | |
274 | } | |
275 | ||
276 | memcpy(mp->data, cp, nb); | |
277 | ||
278 | /* | |
279 | * We really need a way to propagate errors for | |
280 | * forced writes like this one. --hch | |
281 | * | |
282 | * (__write_metapage => release_metapage => flush_metapage) | |
283 | */ | |
284 | #ifdef _JFS_FIXME | |
285 | if ((rc = flush_metapage(mp))) { | |
286 | /* | |
287 | * the write failed -- this means that the buffer | |
288 | * is still assigned and the blocks are not being | |
289 | * used. this seems like the best error recovery | |
290 | * we can get ... | |
291 | */ | |
292 | goto failed; | |
293 | } | |
294 | #else | |
295 | flush_metapage(mp); | |
296 | #endif | |
297 | ||
298 | cp += PSIZE; | |
299 | nbytes -= nb; | |
300 | } | |
301 | ||
302 | ea->flag = DXD_EXTENT; | |
303 | DXDsize(ea, le32_to_cpu(ealist->size)); | |
304 | DXDlength(ea, nblocks); | |
305 | DXDaddress(ea, blkno); | |
306 | ||
307 | /* Free up INLINE area */ | |
308 | if (ji->ea.flag & DXD_INLINE) | |
309 | ji->mode2 |= INLINEEA; | |
310 | ||
311 | return 0; | |
312 | ||
313 | failed: | |
314 | /* Rollback quota allocation. */ | |
5dd4056d | 315 | dquot_free_block(ip, nblocks); |
1da177e4 LT |
316 | |
317 | dbFree(ip, blkno, nblocks); | |
318 | return rc; | |
319 | } | |
320 | ||
321 | /* | |
322 | * NAME: ea_read_inline | |
63f83c9f | 323 | * |
1da177e4 | 324 | * FUNCTION: Read an inlined EA into user's buffer |
63f83c9f | 325 | * |
1da177e4 LT |
326 | * PARAMETERS: |
327 | * ip - Inode pointer | |
328 | * ealist - Pointer to buffer to fill in with EA | |
329 | * | |
330 | * RETURNS: 0 | |
331 | */ | |
332 | static int ea_read_inline(struct inode *ip, struct jfs_ea_list *ealist) | |
333 | { | |
334 | struct jfs_inode_info *ji = JFS_IP(ip); | |
335 | int ea_size = sizeDXD(&ji->ea); | |
336 | ||
337 | if (ea_size == 0) { | |
338 | ealist->size = 0; | |
339 | return 0; | |
340 | } | |
341 | ||
342 | /* Sanity Check */ | |
343 | if ((sizeDXD(&ji->ea) > sizeof (ji->i_inline_ea))) | |
344 | return -EIO; | |
345 | if (le32_to_cpu(((struct jfs_ea_list *) &ji->i_inline_ea)->size) | |
346 | != ea_size) | |
347 | return -EIO; | |
348 | ||
349 | memcpy(ealist, ji->i_inline_ea, ea_size); | |
350 | return 0; | |
351 | } | |
352 | ||
353 | /* | |
354 | * NAME: ea_read | |
63f83c9f | 355 | * |
1da177e4 | 356 | * FUNCTION: copy EA data into user's buffer |
63f83c9f | 357 | * |
1da177e4 LT |
358 | * PARAMETERS: |
359 | * ip - Inode pointer | |
360 | * ealist - Pointer to buffer to fill in with EA | |
361 | * | |
362 | * NOTES: If EA is inline calls ea_read_inline() to copy EA. | |
363 | * | |
364 | * RETURNS: 0 for success; other indicates failure | |
365 | */ | |
366 | static int ea_read(struct inode *ip, struct jfs_ea_list *ealist) | |
367 | { | |
368 | struct super_block *sb = ip->i_sb; | |
369 | struct jfs_inode_info *ji = JFS_IP(ip); | |
370 | struct jfs_sb_info *sbi = JFS_SBI(sb); | |
371 | int nblocks; | |
372 | s64 blkno; | |
373 | char *cp = (char *) ealist; | |
374 | int i; | |
375 | int nbytes, nb; | |
376 | s32 bytes_to_read; | |
377 | struct metapage *mp; | |
378 | ||
379 | /* quick check for in-line EA */ | |
380 | if (ji->ea.flag & DXD_INLINE) | |
381 | return ea_read_inline(ip, ealist); | |
382 | ||
383 | nbytes = sizeDXD(&ji->ea); | |
384 | if (!nbytes) { | |
385 | jfs_error(sb, "ea_read: nbytes is 0"); | |
386 | return -EIO; | |
387 | } | |
388 | ||
63f83c9f | 389 | /* |
1da177e4 LT |
390 | * Figure out how many blocks were allocated when this EA list was |
391 | * originally written to disk. | |
392 | */ | |
393 | nblocks = lengthDXD(&ji->ea) << sbi->l2nbperpage; | |
394 | blkno = addressDXD(&ji->ea) << sbi->l2nbperpage; | |
395 | ||
396 | /* | |
397 | * I have found the disk blocks which were originally used to store | |
398 | * the FEALIST. now i loop over each contiguous block copying the | |
399 | * data into the buffer. | |
400 | */ | |
401 | for (i = 0; i < nblocks; i += sbi->nbperpage) { | |
402 | /* | |
403 | * Determine how many bytes for this request, and round up to | |
404 | * the nearest aggregate block size | |
405 | */ | |
406 | nb = min(PSIZE, nbytes); | |
407 | bytes_to_read = | |
408 | ((((nb + sb->s_blocksize - 1)) >> sb->s_blocksize_bits)) | |
409 | << sb->s_blocksize_bits; | |
410 | ||
411 | if (!(mp = read_metapage(ip, blkno + i, bytes_to_read, 1))) | |
412 | return -EIO; | |
413 | ||
414 | memcpy(cp, mp->data, nb); | |
415 | release_metapage(mp); | |
416 | ||
417 | cp += PSIZE; | |
418 | nbytes -= nb; | |
419 | } | |
420 | ||
421 | return 0; | |
422 | } | |
423 | ||
424 | /* | |
425 | * NAME: ea_get | |
63f83c9f | 426 | * |
1da177e4 LT |
427 | * FUNCTION: Returns buffer containing existing extended attributes. |
428 | * The size of the buffer will be the larger of the existing | |
429 | * attributes size, or min_size. | |
430 | * | |
431 | * The buffer, which may be inlined in the inode or in the | |
63f83c9f DK |
432 | * page cache must be release by calling ea_release or ea_put |
433 | * | |
1da177e4 LT |
434 | * PARAMETERS: |
435 | * inode - Inode pointer | |
436 | * ea_buf - Structure to be populated with ealist and its metadata | |
437 | * min_size- minimum size of buffer to be returned | |
438 | * | |
439 | * RETURNS: 0 for success; Other indicates failure | |
440 | */ | |
441 | static int ea_get(struct inode *inode, struct ea_buffer *ea_buf, int min_size) | |
442 | { | |
443 | struct jfs_inode_info *ji = JFS_IP(inode); | |
444 | struct super_block *sb = inode->i_sb; | |
445 | int size; | |
446 | int ea_size = sizeDXD(&ji->ea); | |
447 | int blocks_needed, current_blocks; | |
448 | s64 blkno; | |
449 | int rc; | |
450 | int quota_allocation = 0; | |
451 | ||
452 | /* When fsck.jfs clears a bad ea, it doesn't clear the size */ | |
453 | if (ji->ea.flag == 0) | |
454 | ea_size = 0; | |
455 | ||
456 | if (ea_size == 0) { | |
457 | if (min_size == 0) { | |
458 | ea_buf->flag = 0; | |
459 | ea_buf->max_size = 0; | |
460 | ea_buf->xattr = NULL; | |
461 | return 0; | |
462 | } | |
463 | if ((min_size <= sizeof (ji->i_inline_ea)) && | |
464 | (ji->mode2 & INLINEEA)) { | |
465 | ea_buf->flag = EA_INLINE | EA_NEW; | |
466 | ea_buf->max_size = sizeof (ji->i_inline_ea); | |
467 | ea_buf->xattr = (struct jfs_ea_list *) ji->i_inline_ea; | |
468 | DXDlength(&ea_buf->new_ea, 0); | |
469 | DXDaddress(&ea_buf->new_ea, 0); | |
470 | ea_buf->new_ea.flag = DXD_INLINE; | |
471 | DXDsize(&ea_buf->new_ea, min_size); | |
472 | return 0; | |
473 | } | |
474 | current_blocks = 0; | |
475 | } else if (ji->ea.flag & DXD_INLINE) { | |
476 | if (min_size <= sizeof (ji->i_inline_ea)) { | |
477 | ea_buf->flag = EA_INLINE; | |
478 | ea_buf->max_size = sizeof (ji->i_inline_ea); | |
479 | ea_buf->xattr = (struct jfs_ea_list *) ji->i_inline_ea; | |
480 | goto size_check; | |
481 | } | |
482 | current_blocks = 0; | |
483 | } else { | |
484 | if (!(ji->ea.flag & DXD_EXTENT)) { | |
485 | jfs_error(sb, "ea_get: invalid ea.flag)"); | |
486 | return -EIO; | |
487 | } | |
488 | current_blocks = (ea_size + sb->s_blocksize - 1) >> | |
489 | sb->s_blocksize_bits; | |
490 | } | |
491 | size = max(min_size, ea_size); | |
492 | ||
493 | if (size > PSIZE) { | |
494 | /* | |
495 | * To keep the rest of the code simple. Allocate a | |
496 | * contiguous buffer to work with | |
497 | */ | |
498 | ea_buf->xattr = kmalloc(size, GFP_KERNEL); | |
499 | if (ea_buf->xattr == NULL) | |
500 | return -ENOMEM; | |
501 | ||
502 | ea_buf->flag = EA_MALLOC; | |
503 | ea_buf->max_size = (size + sb->s_blocksize - 1) & | |
504 | ~(sb->s_blocksize - 1); | |
505 | ||
506 | if (ea_size == 0) | |
507 | return 0; | |
508 | ||
509 | if ((rc = ea_read(inode, ea_buf->xattr))) { | |
510 | kfree(ea_buf->xattr); | |
511 | ea_buf->xattr = NULL; | |
512 | return rc; | |
513 | } | |
514 | goto size_check; | |
515 | } | |
516 | blocks_needed = (min_size + sb->s_blocksize - 1) >> | |
517 | sb->s_blocksize_bits; | |
518 | ||
519 | if (blocks_needed > current_blocks) { | |
520 | /* Allocate new blocks to quota. */ | |
5dd4056d CH |
521 | rc = dquot_alloc_block(inode, blocks_needed); |
522 | if (rc) | |
1da177e4 LT |
523 | return -EDQUOT; |
524 | ||
525 | quota_allocation = blocks_needed; | |
526 | ||
527 | rc = dbAlloc(inode, INOHINT(inode), (s64) blocks_needed, | |
528 | &blkno); | |
529 | if (rc) | |
530 | goto clean_up; | |
531 | ||
532 | DXDlength(&ea_buf->new_ea, blocks_needed); | |
533 | DXDaddress(&ea_buf->new_ea, blkno); | |
534 | ea_buf->new_ea.flag = DXD_EXTENT; | |
535 | DXDsize(&ea_buf->new_ea, min_size); | |
536 | ||
537 | ea_buf->flag = EA_EXTENT | EA_NEW; | |
538 | ||
539 | ea_buf->mp = get_metapage(inode, blkno, | |
540 | blocks_needed << sb->s_blocksize_bits, | |
541 | 1); | |
542 | if (ea_buf->mp == NULL) { | |
543 | dbFree(inode, blkno, (s64) blocks_needed); | |
544 | rc = -EIO; | |
545 | goto clean_up; | |
546 | } | |
547 | ea_buf->xattr = ea_buf->mp->data; | |
548 | ea_buf->max_size = (min_size + sb->s_blocksize - 1) & | |
549 | ~(sb->s_blocksize - 1); | |
550 | if (ea_size == 0) | |
551 | return 0; | |
552 | if ((rc = ea_read(inode, ea_buf->xattr))) { | |
553 | discard_metapage(ea_buf->mp); | |
554 | dbFree(inode, blkno, (s64) blocks_needed); | |
555 | goto clean_up; | |
556 | } | |
557 | goto size_check; | |
558 | } | |
559 | ea_buf->flag = EA_EXTENT; | |
560 | ea_buf->mp = read_metapage(inode, addressDXD(&ji->ea), | |
561 | lengthDXD(&ji->ea) << sb->s_blocksize_bits, | |
562 | 1); | |
563 | if (ea_buf->mp == NULL) { | |
564 | rc = -EIO; | |
565 | goto clean_up; | |
566 | } | |
567 | ea_buf->xattr = ea_buf->mp->data; | |
568 | ea_buf->max_size = (ea_size + sb->s_blocksize - 1) & | |
569 | ~(sb->s_blocksize - 1); | |
570 | ||
571 | size_check: | |
572 | if (EALIST_SIZE(ea_buf->xattr) != ea_size) { | |
573 | printk(KERN_ERR "ea_get: invalid extended attribute\n"); | |
288e4d83 DK |
574 | print_hex_dump(KERN_ERR, "", DUMP_PREFIX_ADDRESS, 16, 1, |
575 | ea_buf->xattr, ea_size, 1); | |
1da177e4 LT |
576 | ea_release(inode, ea_buf); |
577 | rc = -EIO; | |
578 | goto clean_up; | |
579 | } | |
580 | ||
581 | return ea_size; | |
582 | ||
583 | clean_up: | |
584 | /* Rollback quota allocation */ | |
585 | if (quota_allocation) | |
5dd4056d | 586 | dquot_free_block(inode, quota_allocation); |
1da177e4 LT |
587 | |
588 | return (rc); | |
589 | } | |
590 | ||
591 | static void ea_release(struct inode *inode, struct ea_buffer *ea_buf) | |
592 | { | |
593 | if (ea_buf->flag & EA_MALLOC) | |
594 | kfree(ea_buf->xattr); | |
595 | else if (ea_buf->flag & EA_EXTENT) { | |
596 | assert(ea_buf->mp); | |
597 | release_metapage(ea_buf->mp); | |
598 | ||
599 | if (ea_buf->flag & EA_NEW) | |
600 | dbFree(inode, addressDXD(&ea_buf->new_ea), | |
601 | lengthDXD(&ea_buf->new_ea)); | |
602 | } | |
603 | } | |
604 | ||
4f4b401b DK |
605 | static int ea_put(tid_t tid, struct inode *inode, struct ea_buffer *ea_buf, |
606 | int new_size) | |
1da177e4 LT |
607 | { |
608 | struct jfs_inode_info *ji = JFS_IP(inode); | |
609 | unsigned long old_blocks, new_blocks; | |
610 | int rc = 0; | |
1da177e4 LT |
611 | |
612 | if (new_size == 0) { | |
613 | ea_release(inode, ea_buf); | |
614 | ea_buf = NULL; | |
615 | } else if (ea_buf->flag & EA_INLINE) { | |
616 | assert(new_size <= sizeof (ji->i_inline_ea)); | |
617 | ji->mode2 &= ~INLINEEA; | |
618 | ea_buf->new_ea.flag = DXD_INLINE; | |
619 | DXDsize(&ea_buf->new_ea, new_size); | |
620 | DXDaddress(&ea_buf->new_ea, 0); | |
621 | DXDlength(&ea_buf->new_ea, 0); | |
622 | } else if (ea_buf->flag & EA_MALLOC) { | |
623 | rc = ea_write(inode, ea_buf->xattr, new_size, &ea_buf->new_ea); | |
624 | kfree(ea_buf->xattr); | |
625 | } else if (ea_buf->flag & EA_NEW) { | |
626 | /* We have already allocated a new dxd */ | |
627 | flush_metapage(ea_buf->mp); | |
628 | } else { | |
629 | /* ->xattr must point to original ea's metapage */ | |
630 | rc = ea_write(inode, ea_buf->xattr, new_size, &ea_buf->new_ea); | |
631 | discard_metapage(ea_buf->mp); | |
632 | } | |
633 | if (rc) | |
634 | return rc; | |
635 | ||
1da177e4 LT |
636 | old_blocks = new_blocks = 0; |
637 | ||
638 | if (ji->ea.flag & DXD_EXTENT) { | |
639 | invalidate_dxd_metapages(inode, ji->ea); | |
640 | old_blocks = lengthDXD(&ji->ea); | |
641 | } | |
642 | ||
643 | if (ea_buf) { | |
644 | txEA(tid, inode, &ji->ea, &ea_buf->new_ea); | |
645 | if (ea_buf->new_ea.flag & DXD_EXTENT) { | |
646 | new_blocks = lengthDXD(&ea_buf->new_ea); | |
647 | if (ji->ea.flag & DXD_INLINE) | |
648 | ji->mode2 |= INLINEEA; | |
649 | } | |
650 | ji->ea = ea_buf->new_ea; | |
651 | } else { | |
652 | txEA(tid, inode, &ji->ea, NULL); | |
653 | if (ji->ea.flag & DXD_INLINE) | |
654 | ji->mode2 |= INLINEEA; | |
655 | ji->ea.flag = 0; | |
656 | ji->ea.size = 0; | |
657 | } | |
658 | ||
659 | /* If old blocks exist, they must be removed from quota allocation. */ | |
660 | if (old_blocks) | |
5dd4056d | 661 | dquot_free_block(inode, old_blocks); |
1da177e4 LT |
662 | |
663 | inode->i_ctime = CURRENT_TIME; | |
1da177e4 | 664 | |
4f4b401b | 665 | return 0; |
1da177e4 LT |
666 | } |
667 | ||
668 | /* | |
669 | * can_set_system_xattr | |
670 | * | |
671 | * This code is specific to the system.* namespace. It contains policy | |
672 | * which doesn't belong in the main xattr codepath. | |
673 | */ | |
674 | static int can_set_system_xattr(struct inode *inode, const char *name, | |
675 | const void *value, size_t value_len) | |
676 | { | |
677 | #ifdef CONFIG_JFS_POSIX_ACL | |
678 | struct posix_acl *acl; | |
679 | int rc; | |
680 | ||
2e149670 | 681 | if (!inode_owner_or_capable(inode)) |
1da177e4 LT |
682 | return -EPERM; |
683 | ||
684 | /* | |
9a59f452 | 685 | * POSIX_ACL_XATTR_ACCESS is tied to i_mode |
1da177e4 | 686 | */ |
9a59f452 | 687 | if (strcmp(name, POSIX_ACL_XATTR_ACCESS) == 0) { |
5f3a4a28 | 688 | acl = posix_acl_from_xattr(&init_user_ns, value, value_len); |
1da177e4 LT |
689 | if (IS_ERR(acl)) { |
690 | rc = PTR_ERR(acl); | |
691 | printk(KERN_ERR "posix_acl_from_xattr returned %d\n", | |
692 | rc); | |
693 | return rc; | |
694 | } | |
695 | if (acl) { | |
dd2421b5 JK |
696 | struct posix_acl *old_acl = acl; |
697 | rc = posix_acl_update_mode(inode, &inode->i_mode, &acl); | |
698 | posix_acl_release(old_acl); | |
1da177e4 LT |
699 | if (rc < 0) { |
700 | printk(KERN_ERR | |
701 | "posix_acl_equiv_mode returned %d\n", | |
702 | rc); | |
703 | return rc; | |
704 | } | |
1da177e4 LT |
705 | mark_inode_dirty(inode); |
706 | } | |
707 | /* | |
708 | * We're changing the ACL. Get rid of the cached one | |
709 | */ | |
073aaa1b | 710 | forget_cached_acl(inode, ACL_TYPE_ACCESS); |
1da177e4 LT |
711 | |
712 | return 0; | |
9a59f452 | 713 | } else if (strcmp(name, POSIX_ACL_XATTR_DEFAULT) == 0) { |
5f3a4a28 | 714 | acl = posix_acl_from_xattr(&init_user_ns, value, value_len); |
1da177e4 LT |
715 | if (IS_ERR(acl)) { |
716 | rc = PTR_ERR(acl); | |
717 | printk(KERN_ERR "posix_acl_from_xattr returned %d\n", | |
718 | rc); | |
719 | return rc; | |
720 | } | |
721 | posix_acl_release(acl); | |
722 | ||
723 | /* | |
724 | * We're changing the default ACL. Get rid of the cached one | |
725 | */ | |
073aaa1b | 726 | forget_cached_acl(inode, ACL_TYPE_DEFAULT); |
1da177e4 LT |
727 | |
728 | return 0; | |
729 | } | |
730 | #endif /* CONFIG_JFS_POSIX_ACL */ | |
731 | return -EOPNOTSUPP; | |
732 | } | |
733 | ||
d572b879 DK |
734 | /* |
735 | * Most of the permission checking is done by xattr_permission in the vfs. | |
736 | * The local file system is responsible for handling the system.* namespace. | |
737 | * We also need to verify that this is a namespace that we recognize. | |
738 | */ | |
1da177e4 LT |
739 | static int can_set_xattr(struct inode *inode, const char *name, |
740 | const void *value, size_t value_len) | |
741 | { | |
44a0033f | 742 | if (!strncmp(name, XATTR_SYSTEM_PREFIX, XATTR_SYSTEM_PREFIX_LEN)) |
1da177e4 LT |
743 | return can_set_system_xattr(inode, name, value, value_len); |
744 | ||
aca0fa34 DK |
745 | if (!strncmp(name, XATTR_OS2_PREFIX, XATTR_OS2_PREFIX_LEN)) { |
746 | /* | |
747 | * This makes sure that we aren't trying to set an | |
748 | * attribute in a different namespace by prefixing it | |
749 | * with "os2." | |
750 | */ | |
751 | if (is_known_namespace(name + XATTR_OS2_PREFIX_LEN)) | |
752 | return -EOPNOTSUPP; | |
753 | return 0; | |
754 | } | |
755 | ||
44a0033f CH |
756 | /* |
757 | * Don't allow setting an attribute in an unknown namespace. | |
758 | */ | |
759 | if (strncmp(name, XATTR_TRUSTED_PREFIX, XATTR_TRUSTED_PREFIX_LEN) && | |
760 | strncmp(name, XATTR_SECURITY_PREFIX, XATTR_SECURITY_PREFIX_LEN) && | |
aca0fa34 | 761 | strncmp(name, XATTR_USER_PREFIX, XATTR_USER_PREFIX_LEN)) |
1da177e4 LT |
762 | return -EOPNOTSUPP; |
763 | ||
44a0033f | 764 | return 0; |
1da177e4 LT |
765 | } |
766 | ||
4f4b401b DK |
767 | int __jfs_setxattr(tid_t tid, struct inode *inode, const char *name, |
768 | const void *value, size_t value_len, int flags) | |
1da177e4 LT |
769 | { |
770 | struct jfs_ea_list *ealist; | |
771 | struct jfs_ea *ea, *old_ea = NULL, *next_ea = NULL; | |
772 | struct ea_buffer ea_buf; | |
773 | int old_ea_size = 0; | |
774 | int xattr_size; | |
775 | int new_size; | |
776 | int namelen = strlen(name); | |
777 | char *os2name = NULL; | |
778 | int found = 0; | |
779 | int rc; | |
780 | int length; | |
781 | ||
1da177e4 LT |
782 | if (strncmp(name, XATTR_OS2_PREFIX, XATTR_OS2_PREFIX_LEN) == 0) { |
783 | os2name = kmalloc(namelen - XATTR_OS2_PREFIX_LEN + 1, | |
784 | GFP_KERNEL); | |
785 | if (!os2name) | |
786 | return -ENOMEM; | |
787 | strcpy(os2name, name + XATTR_OS2_PREFIX_LEN); | |
788 | name = os2name; | |
789 | namelen -= XATTR_OS2_PREFIX_LEN; | |
790 | } | |
791 | ||
792 | down_write(&JFS_IP(inode)->xattr_sem); | |
793 | ||
794 | xattr_size = ea_get(inode, &ea_buf, 0); | |
795 | if (xattr_size < 0) { | |
796 | rc = xattr_size; | |
797 | goto out; | |
798 | } | |
799 | ||
800 | again: | |
801 | ealist = (struct jfs_ea_list *) ea_buf.xattr; | |
802 | new_size = sizeof (struct jfs_ea_list); | |
803 | ||
804 | if (xattr_size) { | |
805 | for (ea = FIRST_EA(ealist); ea < END_EALIST(ealist); | |
806 | ea = NEXT_EA(ea)) { | |
807 | if ((namelen == ea->namelen) && | |
808 | (memcmp(name, ea->name, namelen) == 0)) { | |
809 | found = 1; | |
810 | if (flags & XATTR_CREATE) { | |
811 | rc = -EEXIST; | |
812 | goto release; | |
813 | } | |
814 | old_ea = ea; | |
815 | old_ea_size = EA_SIZE(ea); | |
816 | next_ea = NEXT_EA(ea); | |
817 | } else | |
818 | new_size += EA_SIZE(ea); | |
819 | } | |
820 | } | |
821 | ||
822 | if (!found) { | |
823 | if (flags & XATTR_REPLACE) { | |
824 | rc = -ENODATA; | |
825 | goto release; | |
826 | } | |
827 | if (value == NULL) { | |
828 | rc = 0; | |
829 | goto release; | |
830 | } | |
831 | } | |
832 | if (value) | |
833 | new_size += sizeof (struct jfs_ea) + namelen + 1 + value_len; | |
834 | ||
835 | if (new_size > ea_buf.max_size) { | |
836 | /* | |
837 | * We need to allocate more space for merged ea list. | |
838 | * We should only have loop to again: once. | |
839 | */ | |
840 | ea_release(inode, &ea_buf); | |
841 | xattr_size = ea_get(inode, &ea_buf, new_size); | |
842 | if (xattr_size < 0) { | |
843 | rc = xattr_size; | |
844 | goto out; | |
845 | } | |
846 | goto again; | |
847 | } | |
848 | ||
849 | /* Remove old ea of the same name */ | |
850 | if (found) { | |
851 | /* number of bytes following target EA */ | |
852 | length = (char *) END_EALIST(ealist) - (char *) next_ea; | |
853 | if (length > 0) | |
854 | memmove(old_ea, next_ea, length); | |
855 | xattr_size -= old_ea_size; | |
856 | } | |
857 | ||
858 | /* Add new entry to the end */ | |
859 | if (value) { | |
860 | if (xattr_size == 0) | |
861 | /* Completely new ea list */ | |
862 | xattr_size = sizeof (struct jfs_ea_list); | |
863 | ||
864 | ea = (struct jfs_ea *) ((char *) ealist + xattr_size); | |
865 | ea->flag = 0; | |
866 | ea->namelen = namelen; | |
867 | ea->valuelen = (cpu_to_le16(value_len)); | |
868 | memcpy(ea->name, name, namelen); | |
869 | ea->name[namelen] = 0; | |
870 | if (value_len) | |
871 | memcpy(&ea->name[namelen + 1], value, value_len); | |
872 | xattr_size += EA_SIZE(ea); | |
873 | } | |
874 | ||
875 | /* DEBUG - If we did this right, these number match */ | |
876 | if (xattr_size != new_size) { | |
877 | printk(KERN_ERR | |
878 | "jfs_xsetattr: xattr_size = %d, new_size = %d\n", | |
879 | xattr_size, new_size); | |
880 | ||
881 | rc = -EINVAL; | |
882 | goto release; | |
883 | } | |
884 | ||
885 | /* | |
886 | * If we're left with an empty list, there's no ea | |
887 | */ | |
888 | if (new_size == sizeof (struct jfs_ea_list)) | |
889 | new_size = 0; | |
890 | ||
891 | ealist->size = cpu_to_le32(new_size); | |
892 | ||
4f4b401b | 893 | rc = ea_put(tid, inode, &ea_buf, new_size); |
1da177e4 LT |
894 | |
895 | goto out; | |
896 | release: | |
897 | ea_release(inode, &ea_buf); | |
898 | out: | |
899 | up_write(&JFS_IP(inode)->xattr_sem); | |
900 | ||
259692bd | 901 | kfree(os2name); |
1da177e4 LT |
902 | |
903 | return rc; | |
904 | } | |
905 | ||
906 | int jfs_setxattr(struct dentry *dentry, const char *name, const void *value, | |
907 | size_t value_len, int flags) | |
908 | { | |
4f4b401b DK |
909 | struct inode *inode = dentry->d_inode; |
910 | struct jfs_inode_info *ji = JFS_IP(inode); | |
911 | int rc; | |
912 | tid_t tid; | |
913 | ||
914 | if ((rc = can_set_xattr(inode, name, value, value_len))) | |
915 | return rc; | |
916 | ||
1da177e4 LT |
917 | if (value == NULL) { /* empty EA, do not remove */ |
918 | value = ""; | |
919 | value_len = 0; | |
920 | } | |
921 | ||
4f4b401b | 922 | tid = txBegin(inode->i_sb, 0); |
1de87444 | 923 | mutex_lock(&ji->commit_mutex); |
4f4b401b DK |
924 | rc = __jfs_setxattr(tid, dentry->d_inode, name, value, value_len, |
925 | flags); | |
926 | if (!rc) | |
927 | rc = txCommit(tid, 1, &inode, 0); | |
928 | txEnd(tid); | |
1de87444 | 929 | mutex_unlock(&ji->commit_mutex); |
4f4b401b DK |
930 | |
931 | return rc; | |
1da177e4 LT |
932 | } |
933 | ||
1da177e4 LT |
934 | ssize_t __jfs_getxattr(struct inode *inode, const char *name, void *data, |
935 | size_t buf_size) | |
936 | { | |
937 | struct jfs_ea_list *ealist; | |
938 | struct jfs_ea *ea; | |
939 | struct ea_buffer ea_buf; | |
940 | int xattr_size; | |
941 | ssize_t size; | |
942 | int namelen = strlen(name); | |
1da177e4 LT |
943 | char *value; |
944 | ||
1da177e4 LT |
945 | down_read(&JFS_IP(inode)->xattr_sem); |
946 | ||
947 | xattr_size = ea_get(inode, &ea_buf, 0); | |
948 | ||
949 | if (xattr_size < 0) { | |
950 | size = xattr_size; | |
951 | goto out; | |
952 | } | |
953 | ||
954 | if (xattr_size == 0) | |
955 | goto not_found; | |
956 | ||
957 | ealist = (struct jfs_ea_list *) ea_buf.xattr; | |
958 | ||
959 | /* Find the named attribute */ | |
960 | for (ea = FIRST_EA(ealist); ea < END_EALIST(ealist); ea = NEXT_EA(ea)) | |
961 | if ((namelen == ea->namelen) && | |
962 | memcmp(name, ea->name, namelen) == 0) { | |
963 | /* Found it */ | |
964 | size = le16_to_cpu(ea->valuelen); | |
965 | if (!data) | |
966 | goto release; | |
967 | else if (size > buf_size) { | |
968 | size = -ERANGE; | |
969 | goto release; | |
970 | } | |
971 | value = ((char *) &ea->name) + ea->namelen + 1; | |
972 | memcpy(data, value, size); | |
973 | goto release; | |
974 | } | |
975 | not_found: | |
976 | size = -ENODATA; | |
977 | release: | |
978 | ea_release(inode, &ea_buf); | |
979 | out: | |
980 | up_read(&JFS_IP(inode)->xattr_sem); | |
981 | ||
1da177e4 LT |
982 | return size; |
983 | } | |
984 | ||
985 | ssize_t jfs_getxattr(struct dentry *dentry, const char *name, void *data, | |
986 | size_t buf_size) | |
987 | { | |
988 | int err; | |
989 | ||
aca0fa34 DK |
990 | if (strncmp(name, XATTR_OS2_PREFIX, XATTR_OS2_PREFIX_LEN) == 0) { |
991 | /* | |
992 | * skip past "os2." prefix | |
993 | */ | |
994 | name += XATTR_OS2_PREFIX_LEN; | |
995 | /* | |
996 | * Don't allow retrieving properly prefixed attributes | |
997 | * by prepending them with "os2." | |
998 | */ | |
999 | if (is_known_namespace(name)) | |
1000 | return -EOPNOTSUPP; | |
1001 | } | |
1002 | ||
1da177e4 LT |
1003 | err = __jfs_getxattr(dentry->d_inode, name, data, buf_size); |
1004 | ||
1005 | return err; | |
1006 | } | |
1007 | ||
1008 | /* | |
1009 | * No special permissions are needed to list attributes except for trusted.* | |
1010 | */ | |
1011 | static inline int can_list(struct jfs_ea *ea) | |
1012 | { | |
1013 | return (strncmp(ea->name, XATTR_TRUSTED_PREFIX, | |
1014 | XATTR_TRUSTED_PREFIX_LEN) || | |
1015 | capable(CAP_SYS_ADMIN)); | |
1016 | } | |
1017 | ||
1018 | ssize_t jfs_listxattr(struct dentry * dentry, char *data, size_t buf_size) | |
1019 | { | |
1020 | struct inode *inode = dentry->d_inode; | |
1021 | char *buffer; | |
1022 | ssize_t size = 0; | |
1023 | int xattr_size; | |
1024 | struct jfs_ea_list *ealist; | |
1025 | struct jfs_ea *ea; | |
1026 | struct ea_buffer ea_buf; | |
1027 | ||
1028 | down_read(&JFS_IP(inode)->xattr_sem); | |
1029 | ||
1030 | xattr_size = ea_get(inode, &ea_buf, 0); | |
1031 | if (xattr_size < 0) { | |
1032 | size = xattr_size; | |
1033 | goto out; | |
1034 | } | |
1035 | ||
1036 | if (xattr_size == 0) | |
1037 | goto release; | |
1038 | ||
1039 | ealist = (struct jfs_ea_list *) ea_buf.xattr; | |
1040 | ||
1041 | /* compute required size of list */ | |
1042 | for (ea = FIRST_EA(ealist); ea < END_EALIST(ealist); ea = NEXT_EA(ea)) { | |
63f83c9f | 1043 | if (can_list(ea)) |
1da177e4 LT |
1044 | size += name_size(ea) + 1; |
1045 | } | |
1046 | ||
1047 | if (!data) | |
1048 | goto release; | |
1049 | ||
1050 | if (size > buf_size) { | |
1051 | size = -ERANGE; | |
1052 | goto release; | |
1053 | } | |
1054 | ||
1055 | /* Copy attribute names to buffer */ | |
1056 | buffer = data; | |
1057 | for (ea = FIRST_EA(ealist); ea < END_EALIST(ealist); ea = NEXT_EA(ea)) { | |
63f83c9f | 1058 | if (can_list(ea)) { |
1da177e4 LT |
1059 | int namelen = copy_name(buffer, ea); |
1060 | buffer += namelen + 1; | |
1061 | } | |
1062 | } | |
1063 | ||
1064 | release: | |
1065 | ea_release(inode, &ea_buf); | |
1066 | out: | |
1067 | up_read(&JFS_IP(inode)->xattr_sem); | |
1068 | return size; | |
1069 | } | |
1070 | ||
1071 | int jfs_removexattr(struct dentry *dentry, const char *name) | |
1072 | { | |
4f4b401b DK |
1073 | struct inode *inode = dentry->d_inode; |
1074 | struct jfs_inode_info *ji = JFS_IP(inode); | |
1075 | int rc; | |
1076 | tid_t tid; | |
1077 | ||
1078 | if ((rc = can_set_xattr(inode, name, NULL, 0))) | |
1079 | return rc; | |
1080 | ||
1081 | tid = txBegin(inode->i_sb, 0); | |
1de87444 | 1082 | mutex_lock(&ji->commit_mutex); |
4f4b401b DK |
1083 | rc = __jfs_setxattr(tid, dentry->d_inode, name, NULL, 0, XATTR_REPLACE); |
1084 | if (!rc) | |
1085 | rc = txCommit(tid, 1, &inode, 0); | |
1086 | txEnd(tid); | |
1de87444 | 1087 | mutex_unlock(&ji->commit_mutex); |
4f4b401b DK |
1088 | |
1089 | return rc; | |
1da177e4 | 1090 | } |
1d15b10f DK |
1091 | |
1092 | #ifdef CONFIG_JFS_SECURITY | |
9d8f13ba MZ |
1093 | int jfs_initxattrs(struct inode *inode, const struct xattr *xattr_array, |
1094 | void *fs_info) | |
1d15b10f | 1095 | { |
9d8f13ba MZ |
1096 | const struct xattr *xattr; |
1097 | tid_t *tid = fs_info; | |
1d15b10f | 1098 | char *name; |
9d8f13ba MZ |
1099 | int err = 0; |
1100 | ||
1101 | for (xattr = xattr_array; xattr->name != NULL; xattr++) { | |
1102 | name = kmalloc(XATTR_SECURITY_PREFIX_LEN + | |
1103 | strlen(xattr->name) + 1, GFP_NOFS); | |
1104 | if (!name) { | |
1105 | err = -ENOMEM; | |
1106 | break; | |
1107 | } | |
1108 | strcpy(name, XATTR_SECURITY_PREFIX); | |
1109 | strcpy(name + XATTR_SECURITY_PREFIX_LEN, xattr->name); | |
1110 | ||
1111 | err = __jfs_setxattr(*tid, inode, name, | |
1112 | xattr->value, xattr->value_len, 0); | |
1113 | kfree(name); | |
1114 | if (err < 0) | |
1115 | break; | |
1d15b10f | 1116 | } |
9d8f13ba MZ |
1117 | return err; |
1118 | } | |
1d15b10f | 1119 | |
9d8f13ba MZ |
1120 | int jfs_init_security(tid_t tid, struct inode *inode, struct inode *dir, |
1121 | const struct qstr *qstr) | |
1122 | { | |
1123 | return security_inode_init_security(inode, dir, qstr, | |
1124 | &jfs_initxattrs, &tid); | |
1d15b10f DK |
1125 | } |
1126 | #endif |