2 * Copyright (C) International Business Machines Corp., 2000-2004
3 * Copyright (C) Christoph Hellwig, 2002
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
7 * the Free Software Foundation; either version 2 of the License, or
8 * (at your option) any later version.
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.
15 * You should have received a copy of the GNU General Public License
16 * along with this program; if not, write to the Free Software
17 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
20 #include <linux/capability.h>
22 #include <linux/xattr.h>
23 #include <linux/posix_acl_xattr.h>
24 #include <linux/slab.h>
25 #include <linux/quotaops.h>
26 #include <linux/security.h>
27 #include "jfs_incore.h"
28 #include "jfs_superblock.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"
38 * jfs_xattr.c: extended attribute service
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
51 * 0 1 2 4 4 + namelen + 1
52 * +-------+--------+--------+----------------+-------------------+
53 * | Flags | Name | Value | Name String \0 | Data . . . . |
54 * | | Length | Length | | |
55 * +-------+--------+--------+----------------+-------------------+
57 * A jfs_ea_list then is structured as
59 * 0 4 4 + EA_SIZE(ea1)
60 * +------------+-------------------+--------------------+-----
61 * | Overall EA | First FEA Element | Second FEA Element | .....
63 * +------------+-------------------+--------------------+-----
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.
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 */
81 * ea_buffer.flag values
83 #define EA_INLINE 0x0001
84 #define EA_EXTENT 0x0002
86 #define EA_MALLOC 0x0008
90 * Mapping of on-disk attribute names: for on-disk attribute names with an
91 * unknown prefix (not "system.", "user.", "security.", or "trusted."), the
92 * prefix "os2." is prepended. On the way back to disk, "os2." prefixes are
93 * stripped and we make sure that the remaining name does not start with one
94 * of the know prefixes.
97 static int is_known_namespace(const char *name)
99 if (strncmp(name, XATTR_SYSTEM_PREFIX, XATTR_SYSTEM_PREFIX_LEN) &&
100 strncmp(name, XATTR_USER_PREFIX, XATTR_USER_PREFIX_LEN) &&
101 strncmp(name, XATTR_SECURITY_PREFIX, XATTR_SECURITY_PREFIX_LEN) &&
102 strncmp(name, XATTR_TRUSTED_PREFIX, XATTR_TRUSTED_PREFIX_LEN))
108 static inline int name_size(struct jfs_ea *ea)
110 if (is_known_namespace(ea->name))
113 return ea->namelen + XATTR_OS2_PREFIX_LEN;
116 static inline int copy_name(char *buffer, struct jfs_ea *ea)
118 int len = ea->namelen;
120 if (!is_known_namespace(ea->name)) {
121 memcpy(buffer, XATTR_OS2_PREFIX, XATTR_OS2_PREFIX_LEN);
122 buffer += XATTR_OS2_PREFIX_LEN;
123 len += XATTR_OS2_PREFIX_LEN;
125 memcpy(buffer, ea->name, ea->namelen);
126 buffer[ea->namelen] = 0;
131 /* Forward references */
132 static void ea_release(struct inode *inode, struct ea_buffer *ea_buf);
135 * NAME: ea_write_inline
137 * FUNCTION: Attempt to write an EA inline if area is available
140 * Already verified that the specified EA is small enough to fit inline
144 * ealist - EA list pointer
145 * size - size of ealist in bytes
146 * ea - dxd_t structure to be filled in with necessary EA information
147 * if we successfully copy the EA inline
150 * Checks if the inode's inline area is available. If so, copies EA inline
151 * and sets <ea> fields appropriately. Otherwise, returns failure, EA will
152 * have to be put into an extent.
154 * RETURNS: 0 for successful copy to inline area; -1 if area not available
156 static int ea_write_inline(struct inode *ip, struct jfs_ea_list *ealist,
157 int size, dxd_t * ea)
159 struct jfs_inode_info *ji = JFS_IP(ip);
162 * Make sure we have an EA -- the NULL EA list is valid, but you
165 if (ealist && size > sizeof (struct jfs_ea_list)) {
166 assert(size <= sizeof (ji->i_inline_ea));
169 * See if the space is available or if it is already being
170 * used for an inline EA.
172 if (!(ji->mode2 & INLINEEA) && !(ji->ea.flag & DXD_INLINE))
178 memcpy(ji->i_inline_ea, ealist, size);
179 ea->flag = DXD_INLINE;
180 ji->mode2 &= ~INLINEEA;
187 /* Free up INLINE area */
188 if (ji->ea.flag & DXD_INLINE)
189 ji->mode2 |= INLINEEA;
198 * FUNCTION: Write an EA for an inode
200 * PRE CONDITIONS: EA has been verified
204 * ealist - EA list pointer
205 * size - size of ealist in bytes
206 * ea - dxd_t structure to be filled in appropriately with where the
209 * NOTES: Will write EA inline if able to, otherwise allocates blocks for an
210 * extent and synchronously writes it to those blocks.
212 * RETURNS: 0 for success; Anything else indicates failure
214 static int ea_write(struct inode *ip, struct jfs_ea_list *ealist, int size,
217 struct super_block *sb = ip->i_sb;
218 struct jfs_inode_info *ji = JFS_IP(ip);
219 struct jfs_sb_info *sbi = JFS_SBI(sb);
229 * Quick check to see if this is an in-linable EA. Short EAs
230 * and empty EAs are all in-linable, provided the space exists.
232 if (!ealist || size <= sizeof (ji->i_inline_ea)) {
233 if (!ea_write_inline(ip, ealist, size, ea))
237 /* figure out how many blocks we need */
238 nblocks = (size + (sb->s_blocksize - 1)) >> sb->s_blocksize_bits;
240 /* Allocate new blocks to quota. */
241 rc = dquot_alloc_block(ip, nblocks);
245 rc = dbAlloc(ip, INOHINT(ip), nblocks, &blkno);
247 /*Rollback quota allocation. */
248 dquot_free_block(ip, nblocks);
253 * Now have nblocks worth of storage to stuff into the FEALIST.
254 * loop over the FEALIST copying data into the buffer one page at
257 cp = (char *) ealist;
259 for (i = 0; i < nblocks; i += sbi->nbperpage) {
261 * Determine how many bytes for this request, and round up to
262 * the nearest aggregate block size
264 nb = min(PSIZE, nbytes);
266 ((((nb + sb->s_blocksize - 1)) >> sb->s_blocksize_bits))
267 << sb->s_blocksize_bits;
269 if (!(mp = get_metapage(ip, blkno + i, bytes_to_write, 1))) {
274 memcpy(mp->data, cp, nb);
277 * We really need a way to propagate errors for
278 * forced writes like this one. --hch
280 * (__write_metapage => release_metapage => flush_metapage)
283 if ((rc = flush_metapage(mp))) {
285 * the write failed -- this means that the buffer
286 * is still assigned and the blocks are not being
287 * used. this seems like the best error recovery
300 ea->flag = DXD_EXTENT;
301 DXDsize(ea, le32_to_cpu(ealist->size));
302 DXDlength(ea, nblocks);
303 DXDaddress(ea, blkno);
305 /* Free up INLINE area */
306 if (ji->ea.flag & DXD_INLINE)
307 ji->mode2 |= INLINEEA;
312 /* Rollback quota allocation. */
313 dquot_free_block(ip, nblocks);
315 dbFree(ip, blkno, nblocks);
320 * NAME: ea_read_inline
322 * FUNCTION: Read an inlined EA into user's buffer
326 * ealist - Pointer to buffer to fill in with EA
330 static int ea_read_inline(struct inode *ip, struct jfs_ea_list *ealist)
332 struct jfs_inode_info *ji = JFS_IP(ip);
333 int ea_size = sizeDXD(&ji->ea);
341 if ((sizeDXD(&ji->ea) > sizeof (ji->i_inline_ea)))
343 if (le32_to_cpu(((struct jfs_ea_list *) &ji->i_inline_ea)->size)
347 memcpy(ealist, ji->i_inline_ea, ea_size);
354 * FUNCTION: copy EA data into user's buffer
358 * ealist - Pointer to buffer to fill in with EA
360 * NOTES: If EA is inline calls ea_read_inline() to copy EA.
362 * RETURNS: 0 for success; other indicates failure
364 static int ea_read(struct inode *ip, struct jfs_ea_list *ealist)
366 struct super_block *sb = ip->i_sb;
367 struct jfs_inode_info *ji = JFS_IP(ip);
368 struct jfs_sb_info *sbi = JFS_SBI(sb);
371 char *cp = (char *) ealist;
377 /* quick check for in-line EA */
378 if (ji->ea.flag & DXD_INLINE)
379 return ea_read_inline(ip, ealist);
381 nbytes = sizeDXD(&ji->ea);
383 jfs_error(sb, "nbytes is 0\n");
388 * Figure out how many blocks were allocated when this EA list was
389 * originally written to disk.
391 nblocks = lengthDXD(&ji->ea) << sbi->l2nbperpage;
392 blkno = addressDXD(&ji->ea) << sbi->l2nbperpage;
395 * I have found the disk blocks which were originally used to store
396 * the FEALIST. now i loop over each contiguous block copying the
397 * data into the buffer.
399 for (i = 0; i < nblocks; i += sbi->nbperpage) {
401 * Determine how many bytes for this request, and round up to
402 * the nearest aggregate block size
404 nb = min(PSIZE, nbytes);
406 ((((nb + sb->s_blocksize - 1)) >> sb->s_blocksize_bits))
407 << sb->s_blocksize_bits;
409 if (!(mp = read_metapage(ip, blkno + i, bytes_to_read, 1)))
412 memcpy(cp, mp->data, nb);
413 release_metapage(mp);
425 * FUNCTION: Returns buffer containing existing extended attributes.
426 * The size of the buffer will be the larger of the existing
427 * attributes size, or min_size.
429 * The buffer, which may be inlined in the inode or in the
430 * page cache must be release by calling ea_release or ea_put
433 * inode - Inode pointer
434 * ea_buf - Structure to be populated with ealist and its metadata
435 * min_size- minimum size of buffer to be returned
437 * RETURNS: 0 for success; Other indicates failure
439 static int ea_get(struct inode *inode, struct ea_buffer *ea_buf, int min_size)
441 struct jfs_inode_info *ji = JFS_IP(inode);
442 struct super_block *sb = inode->i_sb;
444 int ea_size = sizeDXD(&ji->ea);
445 int blocks_needed, current_blocks;
448 int quota_allocation = 0;
450 /* When fsck.jfs clears a bad ea, it doesn't clear the size */
451 if (ji->ea.flag == 0)
457 ea_buf->max_size = 0;
458 ea_buf->xattr = NULL;
461 if ((min_size <= sizeof (ji->i_inline_ea)) &&
462 (ji->mode2 & INLINEEA)) {
463 ea_buf->flag = EA_INLINE | EA_NEW;
464 ea_buf->max_size = sizeof (ji->i_inline_ea);
465 ea_buf->xattr = (struct jfs_ea_list *) ji->i_inline_ea;
466 DXDlength(&ea_buf->new_ea, 0);
467 DXDaddress(&ea_buf->new_ea, 0);
468 ea_buf->new_ea.flag = DXD_INLINE;
469 DXDsize(&ea_buf->new_ea, min_size);
473 } else if (ji->ea.flag & DXD_INLINE) {
474 if (min_size <= sizeof (ji->i_inline_ea)) {
475 ea_buf->flag = EA_INLINE;
476 ea_buf->max_size = sizeof (ji->i_inline_ea);
477 ea_buf->xattr = (struct jfs_ea_list *) ji->i_inline_ea;
482 if (!(ji->ea.flag & DXD_EXTENT)) {
483 jfs_error(sb, "invalid ea.flag\n");
486 current_blocks = (ea_size + sb->s_blocksize - 1) >>
487 sb->s_blocksize_bits;
489 size = max(min_size, ea_size);
493 * To keep the rest of the code simple. Allocate a
494 * contiguous buffer to work with. Make the buffer large
495 * enough to make use of the whole extent.
497 ea_buf->max_size = (size + sb->s_blocksize - 1) &
498 ~(sb->s_blocksize - 1);
500 ea_buf->xattr = kmalloc(ea_buf->max_size, GFP_KERNEL);
501 if (ea_buf->xattr == NULL)
504 ea_buf->flag = EA_MALLOC;
509 if ((rc = ea_read(inode, ea_buf->xattr))) {
510 kfree(ea_buf->xattr);
511 ea_buf->xattr = NULL;
516 blocks_needed = (min_size + sb->s_blocksize - 1) >>
517 sb->s_blocksize_bits;
519 if (blocks_needed > current_blocks) {
520 /* Allocate new blocks to quota. */
521 rc = dquot_alloc_block(inode, blocks_needed);
525 quota_allocation = blocks_needed;
527 rc = dbAlloc(inode, INOHINT(inode), (s64) blocks_needed,
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);
537 ea_buf->flag = EA_EXTENT | EA_NEW;
539 ea_buf->mp = get_metapage(inode, blkno,
540 blocks_needed << sb->s_blocksize_bits,
542 if (ea_buf->mp == NULL) {
543 dbFree(inode, blkno, (s64) blocks_needed);
547 ea_buf->xattr = ea_buf->mp->data;
548 ea_buf->max_size = (min_size + sb->s_blocksize - 1) &
549 ~(sb->s_blocksize - 1);
552 if ((rc = ea_read(inode, ea_buf->xattr))) {
553 discard_metapage(ea_buf->mp);
554 dbFree(inode, blkno, (s64) blocks_needed);
559 ea_buf->flag = EA_EXTENT;
560 ea_buf->mp = read_metapage(inode, addressDXD(&ji->ea),
561 lengthDXD(&ji->ea) << sb->s_blocksize_bits,
563 if (ea_buf->mp == NULL) {
567 ea_buf->xattr = ea_buf->mp->data;
568 ea_buf->max_size = (ea_size + sb->s_blocksize - 1) &
569 ~(sb->s_blocksize - 1);
572 if (EALIST_SIZE(ea_buf->xattr) != ea_size) {
573 printk(KERN_ERR "ea_get: invalid extended attribute\n");
574 print_hex_dump(KERN_ERR, "", DUMP_PREFIX_ADDRESS, 16, 1,
575 ea_buf->xattr, ea_size, 1);
576 ea_release(inode, ea_buf);
584 /* Rollback quota allocation */
585 if (quota_allocation)
586 dquot_free_block(inode, quota_allocation);
591 static void ea_release(struct inode *inode, struct ea_buffer *ea_buf)
593 if (ea_buf->flag & EA_MALLOC)
594 kfree(ea_buf->xattr);
595 else if (ea_buf->flag & EA_EXTENT) {
597 release_metapage(ea_buf->mp);
599 if (ea_buf->flag & EA_NEW)
600 dbFree(inode, addressDXD(&ea_buf->new_ea),
601 lengthDXD(&ea_buf->new_ea));
605 static int ea_put(tid_t tid, struct inode *inode, struct ea_buffer *ea_buf,
608 struct jfs_inode_info *ji = JFS_IP(inode);
609 unsigned long old_blocks, new_blocks;
613 ea_release(inode, ea_buf);
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);
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);
636 old_blocks = new_blocks = 0;
638 if (ji->ea.flag & DXD_EXTENT) {
639 invalidate_dxd_metapages(inode, ji->ea);
640 old_blocks = lengthDXD(&ji->ea);
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;
650 ji->ea = ea_buf->new_ea;
652 txEA(tid, inode, &ji->ea, NULL);
653 if (ji->ea.flag & DXD_INLINE)
654 ji->mode2 |= INLINEEA;
659 /* If old blocks exist, they must be removed from quota allocation. */
661 dquot_free_block(inode, old_blocks);
663 inode->i_ctime = current_time(inode);
668 int __jfs_setxattr(tid_t tid, struct inode *inode, const char *name,
669 const void *value, size_t value_len, int flags)
671 struct jfs_ea_list *ealist;
672 struct jfs_ea *ea, *old_ea = NULL, *next_ea = NULL;
673 struct ea_buffer ea_buf;
677 int namelen = strlen(name);
682 down_write(&JFS_IP(inode)->xattr_sem);
684 xattr_size = ea_get(inode, &ea_buf, 0);
685 if (xattr_size < 0) {
691 ealist = (struct jfs_ea_list *) ea_buf.xattr;
692 new_size = sizeof (struct jfs_ea_list);
695 for (ea = FIRST_EA(ealist); ea < END_EALIST(ealist);
697 if ((namelen == ea->namelen) &&
698 (memcmp(name, ea->name, namelen) == 0)) {
700 if (flags & XATTR_CREATE) {
705 old_ea_size = EA_SIZE(ea);
706 next_ea = NEXT_EA(ea);
708 new_size += EA_SIZE(ea);
713 if (flags & XATTR_REPLACE) {
723 new_size += sizeof (struct jfs_ea) + namelen + 1 + value_len;
725 if (new_size > ea_buf.max_size) {
727 * We need to allocate more space for merged ea list.
728 * We should only have loop to again: once.
730 ea_release(inode, &ea_buf);
731 xattr_size = ea_get(inode, &ea_buf, new_size);
732 if (xattr_size < 0) {
739 /* Remove old ea of the same name */
741 /* number of bytes following target EA */
742 length = (char *) END_EALIST(ealist) - (char *) next_ea;
744 memmove(old_ea, next_ea, length);
745 xattr_size -= old_ea_size;
748 /* Add new entry to the end */
751 /* Completely new ea list */
752 xattr_size = sizeof (struct jfs_ea_list);
755 * The size of EA value is limitted by on-disk format up to
756 * __le16, there would be an overflow if the size is equal
757 * to XATTR_SIZE_MAX (65536). In order to avoid this issue,
758 * we can pre-checkup the value size against USHRT_MAX, and
759 * return -E2BIG in this case, which is consistent with the
760 * VFS setxattr interface.
762 if (value_len >= USHRT_MAX) {
767 ea = (struct jfs_ea *) ((char *) ealist + xattr_size);
769 ea->namelen = namelen;
770 ea->valuelen = (cpu_to_le16(value_len));
771 memcpy(ea->name, name, namelen);
772 ea->name[namelen] = 0;
774 memcpy(&ea->name[namelen + 1], value, value_len);
775 xattr_size += EA_SIZE(ea);
778 /* DEBUG - If we did this right, these number match */
779 if (xattr_size != new_size) {
781 "__jfs_setxattr: xattr_size = %d, new_size = %d\n",
782 xattr_size, new_size);
789 * If we're left with an empty list, there's no ea
791 if (new_size == sizeof (struct jfs_ea_list))
794 ealist->size = cpu_to_le32(new_size);
796 rc = ea_put(tid, inode, &ea_buf, new_size);
800 ea_release(inode, &ea_buf);
802 up_write(&JFS_IP(inode)->xattr_sem);
807 ssize_t __jfs_getxattr(struct inode *inode, const char *name, void *data,
810 struct jfs_ea_list *ealist;
812 struct ea_buffer ea_buf;
815 int namelen = strlen(name);
818 down_read(&JFS_IP(inode)->xattr_sem);
820 xattr_size = ea_get(inode, &ea_buf, 0);
822 if (xattr_size < 0) {
830 ealist = (struct jfs_ea_list *) ea_buf.xattr;
832 /* Find the named attribute */
833 for (ea = FIRST_EA(ealist); ea < END_EALIST(ealist); ea = NEXT_EA(ea))
834 if ((namelen == ea->namelen) &&
835 memcmp(name, ea->name, namelen) == 0) {
837 size = le16_to_cpu(ea->valuelen);
840 else if (size > buf_size) {
844 value = ((char *) &ea->name) + ea->namelen + 1;
845 memcpy(data, value, size);
851 ea_release(inode, &ea_buf);
853 up_read(&JFS_IP(inode)->xattr_sem);
859 * No special permissions are needed to list attributes except for trusted.*
861 static inline int can_list(struct jfs_ea *ea)
863 return (strncmp(ea->name, XATTR_TRUSTED_PREFIX,
864 XATTR_TRUSTED_PREFIX_LEN) ||
865 capable(CAP_SYS_ADMIN));
868 ssize_t jfs_listxattr(struct dentry * dentry, char *data, size_t buf_size)
870 struct inode *inode = d_inode(dentry);
874 struct jfs_ea_list *ealist;
876 struct ea_buffer ea_buf;
878 down_read(&JFS_IP(inode)->xattr_sem);
880 xattr_size = ea_get(inode, &ea_buf, 0);
881 if (xattr_size < 0) {
889 ealist = (struct jfs_ea_list *) ea_buf.xattr;
891 /* compute required size of list */
892 for (ea = FIRST_EA(ealist); ea < END_EALIST(ealist); ea = NEXT_EA(ea)) {
894 size += name_size(ea) + 1;
900 if (size > buf_size) {
905 /* Copy attribute names to buffer */
907 for (ea = FIRST_EA(ealist); ea < END_EALIST(ealist); ea = NEXT_EA(ea)) {
909 int namelen = copy_name(buffer, ea);
910 buffer += namelen + 1;
915 ea_release(inode, &ea_buf);
917 up_read(&JFS_IP(inode)->xattr_sem);
921 static int __jfs_xattr_set(struct inode *inode, const char *name,
922 const void *value, size_t size, int flags)
924 struct jfs_inode_info *ji = JFS_IP(inode);
928 tid = txBegin(inode->i_sb, 0);
929 mutex_lock(&ji->commit_mutex);
930 rc = __jfs_setxattr(tid, inode, name, value, size, flags);
932 rc = txCommit(tid, 1, &inode, 0);
934 mutex_unlock(&ji->commit_mutex);
939 static int jfs_xattr_get(const struct xattr_handler *handler,
940 struct dentry *unused, struct inode *inode,
941 const char *name, void *value, size_t size)
943 name = xattr_full_name(handler, name);
944 return __jfs_getxattr(inode, name, value, size);
947 static int jfs_xattr_set(const struct xattr_handler *handler,
948 struct dentry *unused, struct inode *inode,
949 const char *name, const void *value,
950 size_t size, int flags)
952 name = xattr_full_name(handler, name);
953 return __jfs_xattr_set(inode, name, value, size, flags);
956 static int jfs_xattr_get_os2(const struct xattr_handler *handler,
957 struct dentry *unused, struct inode *inode,
958 const char *name, void *value, size_t size)
960 if (is_known_namespace(name))
962 return __jfs_getxattr(inode, name, value, size);
965 static int jfs_xattr_set_os2(const struct xattr_handler *handler,
966 struct dentry *unused, struct inode *inode,
967 const char *name, const void *value,
968 size_t size, int flags)
970 if (is_known_namespace(name))
972 return __jfs_xattr_set(inode, name, value, size, flags);
975 static const struct xattr_handler jfs_user_xattr_handler = {
976 .prefix = XATTR_USER_PREFIX,
977 .get = jfs_xattr_get,
978 .set = jfs_xattr_set,
981 static const struct xattr_handler jfs_os2_xattr_handler = {
982 .prefix = XATTR_OS2_PREFIX,
983 .get = jfs_xattr_get_os2,
984 .set = jfs_xattr_set_os2,
987 static const struct xattr_handler jfs_security_xattr_handler = {
988 .prefix = XATTR_SECURITY_PREFIX,
989 .get = jfs_xattr_get,
990 .set = jfs_xattr_set,
993 static const struct xattr_handler jfs_trusted_xattr_handler = {
994 .prefix = XATTR_TRUSTED_PREFIX,
995 .get = jfs_xattr_get,
996 .set = jfs_xattr_set,
999 const struct xattr_handler *jfs_xattr_handlers[] = {
1000 #ifdef CONFIG_JFS_POSIX_ACL
1001 &posix_acl_access_xattr_handler,
1002 &posix_acl_default_xattr_handler,
1004 &jfs_os2_xattr_handler,
1005 &jfs_user_xattr_handler,
1006 &jfs_security_xattr_handler,
1007 &jfs_trusted_xattr_handler,
1012 #ifdef CONFIG_JFS_SECURITY
1013 static int jfs_initxattrs(struct inode *inode, const struct xattr *xattr_array,
1016 const struct xattr *xattr;
1017 tid_t *tid = fs_info;
1021 for (xattr = xattr_array; xattr->name != NULL; xattr++) {
1022 name = kmalloc(XATTR_SECURITY_PREFIX_LEN +
1023 strlen(xattr->name) + 1, GFP_NOFS);
1028 strcpy(name, XATTR_SECURITY_PREFIX);
1029 strcpy(name + XATTR_SECURITY_PREFIX_LEN, xattr->name);
1031 err = __jfs_setxattr(*tid, inode, name,
1032 xattr->value, xattr->value_len, 0);
1040 int jfs_init_security(tid_t tid, struct inode *inode, struct inode *dir,
1041 const struct qstr *qstr)
1043 return security_inode_init_security(inode, dir, qstr,
1044 &jfs_initxattrs, &tid);