2 * Copyright (C) International Business Machines Corp., 2000-2003
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
21 #include <linux/xattr.h>
22 #include "jfs_incore.h"
23 #include "jfs_superblock.h"
25 #include "jfs_debug.h"
26 #include "jfs_dinode.h"
27 #include "jfs_extent.h"
28 #include "jfs_metapage.h"
29 #include "jfs_xattr.h"
32 * jfs_xattr.c: extended attribute service
38 * Extended attribute lists (jfs_ea_list) consist of an overall size (32 bit
39 * value) and a variable (0 or more) number of extended attribute
40 * entries. Each extended attribute entry (jfs_ea) is a <name,value> double
41 * where <name> is constructed from a null-terminated ascii string
42 * (1 ... 255 bytes in the name) and <value> is arbitrary 8 bit data
43 * (1 ... 65535 bytes). The in-memory format is
45 * 0 1 2 4 4 + namelen + 1
46 * +-------+--------+--------+----------------+-------------------+
47 * | Flags | Name | Value | Name String \0 | Data . . . . |
48 * | | Length | Length | | |
49 * +-------+--------+--------+----------------+-------------------+
51 * A jfs_ea_list then is structured as
53 * 0 4 4 + EA_SIZE(ea1)
54 * +------------+-------------------+--------------------+-----
55 * | Overall EA | First FEA Element | Second FEA Element | .....
57 * +------------+-------------------+--------------------+-----
61 * FEALISTs are stored on disk using blocks allocated by dbAlloc() and
62 * written directly. An EA list may be in-lined in the inode if there is
63 * sufficient room available.
67 int flag; /* Indicates what storage xattr points to */
68 int max_size; /* largest xattr that fits in current buffer */
69 dxd_t new_ea; /* dxd to replace ea when modifying xattr */
70 struct metapage *mp; /* metapage containing ea list */
71 struct jfs_ea_list *xattr; /* buffer containing ea list */
75 * ea_buffer.flag values
77 #define EA_INLINE 0x0001
78 #define EA_EXTENT 0x0002
80 #define EA_MALLOC 0x0008
83 #define XATTR_SYSTEM_PREFIX "system."
84 #define XATTR_SYSTEM_PREFIX_LEN (sizeof (XATTR_SYSTEM_PREFIX) - 1)
86 #define XATTR_USER_PREFIX "user."
87 #define XATTR_USER_PREFIX_LEN (sizeof (XATTR_USER_PREFIX) - 1)
89 #define XATTR_OS2_PREFIX "os2."
90 #define XATTR_OS2_PREFIX_LEN (sizeof (XATTR_OS2_PREFIX) - 1)
93 * These three routines are used to recognize on-disk extended attributes
94 * that are in a recognized namespace. If the attribute is not recognized,
95 * "os2." is prepended to the name
97 static inline int is_os2_xattr(struct jfs_ea *ea)
100 * Check for "system."
102 if ((ea->namelen >= XATTR_SYSTEM_PREFIX_LEN) &&
103 !strncmp(ea->name, XATTR_SYSTEM_PREFIX, XATTR_SYSTEM_PREFIX_LEN))
108 if ((ea->namelen >= XATTR_USER_PREFIX_LEN) &&
109 !strncmp(ea->name, XATTR_USER_PREFIX, XATTR_USER_PREFIX_LEN))
112 * Add any other valid namespace prefixes here
116 * We assume it's OS/2's flat namespace
121 static inline int name_size(struct jfs_ea *ea)
123 if (is_os2_xattr(ea))
124 return ea->namelen + XATTR_OS2_PREFIX_LEN;
129 static inline int copy_name(char *buffer, struct jfs_ea *ea)
131 int len = ea->namelen;
133 if (is_os2_xattr(ea)) {
134 memcpy(buffer, XATTR_OS2_PREFIX, XATTR_OS2_PREFIX_LEN);
135 buffer += XATTR_OS2_PREFIX_LEN;
136 len += XATTR_OS2_PREFIX_LEN;
138 memcpy(buffer, ea->name, ea->namelen);
139 buffer[ea->namelen] = 0;
144 /* Forward references */
145 static void ea_release(struct inode *inode, struct ea_buffer *ea_buf);
148 * NAME: ea_write_inline
150 * FUNCTION: Attempt to write an EA inline if area is available
153 * Already verified that the specified EA is small enough to fit inline
157 * ealist - EA list pointer
158 * size - size of ealist in bytes
159 * ea - dxd_t structure to be filled in with necessary EA information
160 * if we successfully copy the EA inline
163 * Checks if the inode's inline area is available. If so, copies EA inline
164 * and sets <ea> fields appropriately. Otherwise, returns failure, EA will
165 * have to be put into an extent.
167 * RETURNS: 0 for successful copy to inline area; -1 if area not available
169 static int ea_write_inline(struct inode *ip, struct jfs_ea_list *ealist,
170 int size, dxd_t * ea)
172 struct jfs_inode_info *ji = JFS_IP(ip);
175 * Make sure we have an EA -- the NULL EA list is valid, but you
178 if (ealist && size > sizeof (struct jfs_ea_list)) {
179 assert(size <= sizeof (ji->i_inline_ea));
182 * See if the space is available or if it is already being
183 * used for an inline EA.
185 if (!(ji->mode2 & INLINEEA) && !(ji->ea.flag & DXD_INLINE))
191 memcpy(ji->i_inline_ea, ealist, size);
192 ea->flag = DXD_INLINE;
193 ji->mode2 &= ~INLINEEA;
200 /* Free up INLINE area */
201 if (ji->ea.flag & DXD_INLINE)
202 ji->mode2 |= INLINEEA;
205 mark_inode_dirty(ip);
212 * FUNCTION: Write an EA for an inode
214 * PRE CONDITIONS: EA has been verified
218 * ealist - EA list pointer
219 * size - size of ealist in bytes
220 * ea - dxd_t structure to be filled in appropriately with where the
223 * NOTES: Will write EA inline if able to, otherwise allocates blocks for an
224 * extent and synchronously writes it to those blocks.
226 * RETURNS: 0 for success; Anything else indicates failure
228 static int ea_write(struct inode *ip, struct jfs_ea_list *ealist, int size,
231 struct super_block *sb = ip->i_sb;
232 struct jfs_inode_info *ji = JFS_IP(ip);
233 struct jfs_sb_info *sbi = JFS_SBI(sb);
243 * Quick check to see if this is an in-linable EA. Short EAs
244 * and empty EAs are all in-linable, provided the space exists.
246 if (!ealist || size <= sizeof (ji->i_inline_ea)) {
247 if (!ea_write_inline(ip, ealist, size, ea))
251 /* figure out how many blocks we need */
252 nblocks = (size + (sb->s_blocksize - 1)) >> sb->s_blocksize_bits;
254 rc = dbAlloc(ip, INOHINT(ip), nblocks, &blkno);
259 * Now have nblocks worth of storage to stuff into the FEALIST.
260 * loop over the FEALIST copying data into the buffer one page at
263 cp = (char *) ealist;
265 for (i = 0; i < nblocks; i += sbi->nbperpage) {
267 * Determine how many bytes for this request, and round up to
268 * the nearest aggregate block size
270 nb = min(PSIZE, nbytes);
272 ((((nb + sb->s_blocksize - 1)) >> sb->s_blocksize_bits))
273 << sb->s_blocksize_bits;
275 if (!(mp = get_metapage(ip, blkno + i, bytes_to_write, 1))) {
280 memcpy(mp->data, cp, nb);
283 * We really need a way to propagate errors for
284 * forced writes like this one. --hch
286 * (__write_metapage => release_metapage => flush_metapage)
289 if ((rc = flush_metapage(mp))) {
291 * the write failed -- this means that the buffer
292 * is still assigned and the blocks are not being
293 * used. this seems like the best error recovery
306 ea->flag = DXD_EXTENT;
307 DXDsize(ea, le32_to_cpu(ealist->size));
308 DXDlength(ea, nblocks);
309 DXDaddress(ea, blkno);
311 /* Free up INLINE area */
312 if (ji->ea.flag & DXD_INLINE)
313 ji->mode2 |= INLINEEA;
318 dbFree(ip, blkno, nblocks);
323 * NAME: ea_read_inline
325 * FUNCTION: Read an inlined EA into user's buffer
329 * ealist - Pointer to buffer to fill in with EA
333 static int ea_read_inline(struct inode *ip, struct jfs_ea_list *ealist)
335 struct jfs_inode_info *ji = JFS_IP(ip);
336 int ea_size = sizeDXD(&ji->ea);
344 if ((sizeDXD(&ji->ea) > sizeof (ji->i_inline_ea)))
346 if (le32_to_cpu(((struct jfs_ea_list *) &ji->i_inline_ea)->size)
350 memcpy(ealist, ji->i_inline_ea, ea_size);
357 * FUNCTION: copy EA data into user's buffer
361 * ealist - Pointer to buffer to fill in with EA
363 * NOTES: If EA is inline calls ea_read_inline() to copy EA.
365 * RETURNS: 0 for success; other indicates failure
367 static int ea_read(struct inode *ip, struct jfs_ea_list *ealist)
369 struct super_block *sb = ip->i_sb;
370 struct jfs_inode_info *ji = JFS_IP(ip);
371 struct jfs_sb_info *sbi = JFS_SBI(sb);
374 char *cp = (char *) ealist;
380 /* quick check for in-line EA */
381 if (ji->ea.flag & DXD_INLINE)
382 return ea_read_inline(ip, ealist);
384 nbytes = sizeDXD(&ji->ea);
386 jfs_error(sb, "ea_read: nbytes is 0");
391 * Figure out how many blocks were allocated when this EA list was
392 * originally written to disk.
394 nblocks = lengthDXD(&ji->ea) << sbi->l2nbperpage;
395 blkno = addressDXD(&ji->ea) << sbi->l2nbperpage;
398 * I have found the disk blocks which were originally used to store
399 * the FEALIST. now i loop over each contiguous block copying the
400 * data into the buffer.
402 for (i = 0; i < nblocks; i += sbi->nbperpage) {
404 * Determine how many bytes for this request, and round up to
405 * the nearest aggregate block size
407 nb = min(PSIZE, nbytes);
409 ((((nb + sb->s_blocksize - 1)) >> sb->s_blocksize_bits))
410 << sb->s_blocksize_bits;
412 if (!(mp = read_metapage(ip, blkno + i, bytes_to_read, 1)))
415 memcpy(cp, mp->data, nb);
416 release_metapage(mp);
428 * FUNCTION: Returns buffer containing existing extended attributes.
429 * The size of the buffer will be the larger of the existing
430 * attributes size, or min_size.
432 * The buffer, which may be inlined in the inode or in the
433 * page cache must be release by calling ea_release or ea_put
436 * inode - Inode pointer
437 * ea_buf - Structure to be populated with ealist and its metadata
438 * min_size- minimum size of buffer to be returned
440 * RETURNS: 0 for success; Other indicates failure
442 static int ea_get(struct inode *inode, struct ea_buffer *ea_buf, int min_size)
444 struct jfs_inode_info *ji = JFS_IP(inode);
445 struct super_block *sb = inode->i_sb;
447 int ea_size = sizeDXD(&ji->ea);
448 int blocks_needed, current_blocks;
452 /* When fsck.jfs clears a bad ea, it doesn't clear the size */
453 if (ji->ea.flag == 0)
459 ea_buf->max_size = 0;
460 ea_buf->xattr = NULL;
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);
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;
484 if (!(ji->ea.flag & DXD_EXTENT)) {
485 jfs_error(sb, "ea_get: invalid ea.flag)");
488 current_blocks = (ea_size + sb->s_blocksize - 1) >>
489 sb->s_blocksize_bits;
491 size = max(min_size, ea_size);
495 * To keep the rest of the code simple. Allocate a
496 * contiguous buffer to work with
498 ea_buf->xattr = kmalloc(size, GFP_KERNEL);
499 if (ea_buf->xattr == NULL)
502 ea_buf->flag = EA_MALLOC;
503 ea_buf->max_size = (size + sb->s_blocksize - 1) &
504 ~(sb->s_blocksize - 1);
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 rc = dbAlloc(inode, INOHINT(inode), (s64) blocks_needed,
525 DXDlength(&ea_buf->new_ea, blocks_needed);
526 DXDaddress(&ea_buf->new_ea, blkno);
527 ea_buf->new_ea.flag = DXD_EXTENT;
528 DXDsize(&ea_buf->new_ea, min_size);
530 ea_buf->flag = EA_EXTENT | EA_NEW;
532 ea_buf->mp = get_metapage(inode, blkno,
533 blocks_needed << sb->s_blocksize_bits,
535 if (ea_buf->mp == NULL) {
536 dbFree(inode, blkno, (s64) blocks_needed);
539 ea_buf->xattr = ea_buf->mp->data;
540 ea_buf->max_size = (min_size + sb->s_blocksize - 1) &
541 ~(sb->s_blocksize - 1);
544 if ((rc = ea_read(inode, ea_buf->xattr))) {
545 discard_metapage(ea_buf->mp);
546 dbFree(inode, blkno, (s64) blocks_needed);
551 ea_buf->flag = EA_EXTENT;
552 ea_buf->mp = read_metapage(inode, addressDXD(&ji->ea),
553 lengthDXD(&ji->ea) << sb->s_blocksize_bits,
555 if (ea_buf->mp == NULL)
557 ea_buf->xattr = ea_buf->mp->data;
558 ea_buf->max_size = (ea_size + sb->s_blocksize - 1) &
559 ~(sb->s_blocksize - 1);
562 if (EALIST_SIZE(ea_buf->xattr) != ea_size) {
563 printk(KERN_ERR "ea_get: invalid extended attribute\n");
564 dump_mem("xattr", ea_buf->xattr, ea_size);
565 ea_release(inode, ea_buf);
572 static void ea_release(struct inode *inode, struct ea_buffer *ea_buf)
574 if (ea_buf->flag & EA_MALLOC)
575 kfree(ea_buf->xattr);
576 else if (ea_buf->flag & EA_EXTENT) {
578 release_metapage(ea_buf->mp);
580 if (ea_buf->flag & EA_NEW)
581 dbFree(inode, addressDXD(&ea_buf->new_ea),
582 lengthDXD(&ea_buf->new_ea));
586 static int ea_put(struct inode *inode, struct ea_buffer *ea_buf, int new_size)
588 struct jfs_inode_info *ji = JFS_IP(inode);
589 unsigned long old_blocks, new_blocks;
594 ea_release(inode, ea_buf);
596 } else if (ea_buf->flag & EA_INLINE) {
597 assert(new_size <= sizeof (ji->i_inline_ea));
598 ji->mode2 &= ~INLINEEA;
599 ea_buf->new_ea.flag = DXD_INLINE;
600 DXDsize(&ea_buf->new_ea, new_size);
601 DXDaddress(&ea_buf->new_ea, 0);
602 DXDlength(&ea_buf->new_ea, 0);
603 } else if (ea_buf->flag & EA_MALLOC) {
604 rc = ea_write(inode, ea_buf->xattr, new_size, &ea_buf->new_ea);
605 kfree(ea_buf->xattr);
606 } else if (ea_buf->flag & EA_NEW) {
607 /* We have already allocated a new dxd */
608 flush_metapage(ea_buf->mp);
610 /* ->xattr must point to original ea's metapage */
611 rc = ea_write(inode, ea_buf->xattr, new_size, &ea_buf->new_ea);
612 discard_metapage(ea_buf->mp);
617 tid = txBegin(inode->i_sb, 0);
618 down(&ji->commit_sem);
620 old_blocks = new_blocks = 0;
622 if (ji->ea.flag & DXD_EXTENT) {
623 invalidate_dxd_metapages(inode, ji->ea);
624 old_blocks = lengthDXD(&ji->ea);
628 txEA(tid, inode, &ji->ea, &ea_buf->new_ea);
629 if (ea_buf->new_ea.flag & DXD_EXTENT) {
630 new_blocks = lengthDXD(&ea_buf->new_ea);
631 if (ji->ea.flag & DXD_INLINE)
632 ji->mode2 |= INLINEEA;
634 ji->ea = ea_buf->new_ea;
636 txEA(tid, inode, &ji->ea, 0);
637 if (ji->ea.flag & DXD_INLINE)
638 ji->mode2 |= INLINEEA;
643 inode->i_blocks += LBLK2PBLK(inode->i_sb, new_blocks - old_blocks);
644 rc = txCommit(tid, 1, &inode, 0);
651 static int can_set_xattr(struct inode *inode, const char *name,
652 void *value, size_t value_len)
654 if (IS_RDONLY(inode))
657 if (IS_IMMUTABLE(inode) || IS_APPEND(inode) || S_ISLNK(inode->i_mode))
660 if((strncmp(name, XATTR_USER_PREFIX, XATTR_USER_PREFIX_LEN) != 0) &&
661 (strncmp(name, XATTR_OS2_PREFIX, XATTR_OS2_PREFIX_LEN) != 0))
664 if (!S_ISREG(inode->i_mode) &&
665 (!S_ISDIR(inode->i_mode) || inode->i_mode &S_ISVTX))
668 return permission(inode, MAY_WRITE);
671 int __jfs_setxattr(struct inode *inode, const char *name, void *value,
672 size_t value_len, int flags)
674 struct jfs_ea_list *ealist;
675 struct jfs_ea *ea, *old_ea = NULL, *next_ea = NULL;
676 struct ea_buffer ea_buf;
680 int namelen = strlen(name);
681 char *os2name = NULL;
686 if ((rc = can_set_xattr(inode, name, value, value_len)))
689 if (strncmp(name, XATTR_OS2_PREFIX, XATTR_OS2_PREFIX_LEN) == 0) {
690 os2name = kmalloc(namelen - XATTR_OS2_PREFIX_LEN + 1,
694 strcpy(os2name, name + XATTR_OS2_PREFIX_LEN);
696 namelen -= XATTR_OS2_PREFIX_LEN;
699 xattr_size = ea_get(inode, &ea_buf, 0);
700 if (xattr_size < 0) {
706 ealist = (struct jfs_ea_list *) ea_buf.xattr;
707 new_size = sizeof (struct jfs_ea_list);
710 for (ea = FIRST_EA(ealist); ea < END_EALIST(ealist);
712 if ((namelen == ea->namelen) &&
713 (memcmp(name, ea->name, namelen) == 0)) {
715 if (flags & XATTR_CREATE) {
720 old_ea_size = EA_SIZE(ea);
721 next_ea = NEXT_EA(ea);
723 new_size += EA_SIZE(ea);
728 if (flags & XATTR_REPLACE) {
738 new_size += sizeof (struct jfs_ea) + namelen + 1 + value_len;
740 if (new_size > ea_buf.max_size) {
742 * We need to allocate more space for merged ea list.
743 * We should only have loop to again: once.
745 ea_release(inode, &ea_buf);
746 xattr_size = ea_get(inode, &ea_buf, new_size);
747 if (xattr_size < 0) {
754 /* Remove old ea of the same name */
756 /* number of bytes following target EA */
757 length = (char *) END_EALIST(ealist) - (char *) next_ea;
759 memmove(old_ea, next_ea, length);
760 xattr_size -= old_ea_size;
763 /* Add new entry to the end */
766 /* Completely new ea list */
767 xattr_size = sizeof (struct jfs_ea_list);
769 ea = (struct jfs_ea *) ((char *) ealist + xattr_size);
771 ea->namelen = namelen;
772 ea->valuelen = (cpu_to_le16(value_len));
773 memcpy(ea->name, name, namelen);
774 ea->name[namelen] = 0;
776 memcpy(&ea->name[namelen + 1], value, value_len);
777 xattr_size += EA_SIZE(ea);
780 /* DEBUG - If we did this right, these number match */
781 if (xattr_size != new_size) {
783 "jfs_xsetattr: xattr_size = %d, new_size = %d\n",
784 xattr_size, new_size);
791 * If we're left with an empty list, there's no ea
793 if (new_size == sizeof (struct jfs_ea_list))
796 ealist->size = cpu_to_le32(new_size);
798 rc = ea_put(inode, &ea_buf, new_size);
802 ea_release(inode, &ea_buf);
810 int jfs_setxattr(struct dentry *dentry, const char *name, void *value,
811 size_t value_len, int flags)
813 if (value == NULL) { /* empty EA, do not remove */
818 return __jfs_setxattr(dentry->d_inode, name, value, value_len, flags);
821 static inline int can_get_xattr(struct inode *inode, const char *name)
823 if(strncmp(name, XATTR_SYSTEM_PREFIX, XATTR_SYSTEM_PREFIX_LEN) == 0)
825 return permission(inode, MAY_READ);
828 ssize_t __jfs_getxattr(struct inode *inode, const char *name, void *data,
831 struct jfs_ea_list *ealist;
833 struct ea_buffer ea_buf;
836 int namelen = strlen(name);
837 char *os2name = NULL;
841 if ((rc = can_get_xattr(inode, name)))
844 if (strncmp(name, XATTR_OS2_PREFIX, XATTR_OS2_PREFIX_LEN) == 0) {
845 os2name = kmalloc(namelen - XATTR_OS2_PREFIX_LEN + 1,
849 strcpy(os2name, name + XATTR_OS2_PREFIX_LEN);
851 namelen -= XATTR_OS2_PREFIX_LEN;
854 xattr_size = ea_get(inode, &ea_buf, 0);
855 if (xattr_size < 0) {
863 ealist = (struct jfs_ea_list *) ea_buf.xattr;
865 /* Find the named attribute */
866 for (ea = FIRST_EA(ealist); ea < END_EALIST(ealist); ea = NEXT_EA(ea))
867 if ((namelen == ea->namelen) &&
868 memcmp(name, ea->name, namelen) == 0) {
870 size = le16_to_cpu(ea->valuelen);
873 else if (size > buf_size) {
877 value = ((char *) &ea->name) + ea->namelen + 1;
878 memcpy(data, value, size);
884 ea_release(inode, &ea_buf);
892 ssize_t jfs_getxattr(struct dentry *dentry, const char *name, void *data,
895 return __jfs_getxattr(dentry->d_inode, name, data, buf_size);
898 ssize_t jfs_listxattr(struct dentry * dentry, char *data, size_t buf_size)
900 struct inode *inode = dentry->d_inode;
904 struct jfs_ea_list *ealist;
906 struct ea_buffer ea_buf;
908 xattr_size = ea_get(inode, &ea_buf, 0);
909 if (xattr_size < 0) {
917 ealist = (struct jfs_ea_list *) ea_buf.xattr;
919 /* compute required size of list */
920 for (ea = FIRST_EA(ealist); ea < END_EALIST(ealist); ea = NEXT_EA(ea))
921 size += name_size(ea) + 1;
926 if (size > buf_size) {
931 /* Copy attribute names to buffer */
933 for (ea = FIRST_EA(ealist); ea < END_EALIST(ealist); ea = NEXT_EA(ea)) {
934 int namelen = copy_name(buffer, ea);
935 buffer += namelen + 1;
939 ea_release(inode, &ea_buf);
944 int jfs_removexattr(struct dentry *dentry, const char *name)
946 return __jfs_setxattr(dentry->d_inode, name, 0, 0, XATTR_REPLACE);