xfs_attr.h 6.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155
  1. /*
  2. * Copyright (c) 2000,2002-2003,2005 Silicon Graphics, Inc.
  3. * All Rights Reserved.
  4. *
  5. * This program is free software; you can redistribute it and/or
  6. * modify it under the terms of the GNU General Public License as
  7. * published by the Free Software Foundation.
  8. *
  9. * This program is distributed in the hope that it would be useful,
  10. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  11. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  12. * GNU General Public License for more details.
  13. *
  14. * You should have received a copy of the GNU General Public License
  15. * along with this program; if not, write the Free Software Foundation,
  16. * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
  17. */
  18. #ifndef __XFS_ATTR_H__
  19. #define __XFS_ATTR_H__
  20. struct xfs_inode;
  21. struct xfs_da_args;
  22. struct xfs_attr_list_context;
  23. /*
  24. * Large attribute lists are structured around Btrees where all the data
  25. * elements are in the leaf nodes. Attribute names are hashed into an int,
  26. * then that int is used as the index into the Btree. Since the hashval
  27. * of an attribute name may not be unique, we may have duplicate keys.
  28. * The internal links in the Btree are logical block offsets into the file.
  29. *
  30. * Small attribute lists use a different format and are packed as tightly
  31. * as possible so as to fit into the literal area of the inode.
  32. */
  33. /*========================================================================
  34. * External interfaces
  35. *========================================================================*/
  36. #define ATTR_DONTFOLLOW 0x0001 /* -- unused, from IRIX -- */
  37. #define ATTR_ROOT 0x0002 /* use attrs in root (trusted) namespace */
  38. #define ATTR_TRUST 0x0004 /* -- unused, from IRIX -- */
  39. #define ATTR_SECURE 0x0008 /* use attrs in security namespace */
  40. #define ATTR_CREATE 0x0010 /* pure create: fail if attr already exists */
  41. #define ATTR_REPLACE 0x0020 /* pure set: fail if attr does not exist */
  42. #define ATTR_KERNOTIME 0x1000 /* [kernel] don't update inode timestamps */
  43. #define ATTR_KERNOVAL 0x2000 /* [kernel] get attr size only, not value */
  44. #define XFS_ATTR_FLAGS \
  45. { ATTR_DONTFOLLOW, "DONTFOLLOW" }, \
  46. { ATTR_ROOT, "ROOT" }, \
  47. { ATTR_TRUST, "TRUST" }, \
  48. { ATTR_SECURE, "SECURE" }, \
  49. { ATTR_CREATE, "CREATE" }, \
  50. { ATTR_REPLACE, "REPLACE" }, \
  51. { ATTR_KERNOTIME, "KERNOTIME" }, \
  52. { ATTR_KERNOVAL, "KERNOVAL" }
  53. /*
  54. * The maximum size (into the kernel or returned from the kernel) of an
  55. * attribute value or the buffer used for an attr_list() call. Larger
  56. * sizes will result in an ERANGE return code.
  57. */
  58. #define ATTR_MAX_VALUELEN (64*1024) /* max length of a value */
  59. /*
  60. * Define how lists of attribute names are returned to the user from
  61. * the attr_list() call. A large, 32bit aligned, buffer is passed in
  62. * along with its size. We put an array of offsets at the top that each
  63. * reference an attrlist_ent_t and pack the attrlist_ent_t's at the bottom.
  64. */
  65. typedef struct attrlist {
  66. __s32 al_count; /* number of entries in attrlist */
  67. __s32 al_more; /* T/F: more attrs (do call again) */
  68. __s32 al_offset[1]; /* byte offsets of attrs [var-sized] */
  69. } attrlist_t;
  70. /*
  71. * Show the interesting info about one attribute. This is what the
  72. * al_offset[i] entry points to.
  73. */
  74. typedef struct attrlist_ent { /* data from attr_list() */
  75. __u32 a_valuelen; /* number bytes in value of attr */
  76. char a_name[1]; /* attr name (NULL terminated) */
  77. } attrlist_ent_t;
  78. /*
  79. * Given a pointer to the (char*) buffer containing the attr_list() result,
  80. * and an index, return a pointer to the indicated attribute in the buffer.
  81. */
  82. #define ATTR_ENTRY(buffer, index) \
  83. ((attrlist_ent_t *) \
  84. &((char *)buffer)[ ((attrlist_t *)(buffer))->al_offset[index] ])
  85. /*
  86. * Kernel-internal version of the attrlist cursor.
  87. */
  88. typedef struct attrlist_cursor_kern {
  89. __u32 hashval; /* hash value of next entry to add */
  90. __u32 blkno; /* block containing entry (suggestion) */
  91. __u32 offset; /* offset in list of equal-hashvals */
  92. __u16 pad1; /* padding to match user-level */
  93. __u8 pad2; /* padding to match user-level */
  94. __u8 initted; /* T/F: cursor has been initialized */
  95. } attrlist_cursor_kern_t;
  96. /*========================================================================
  97. * Structure used to pass context around among the routines.
  98. *========================================================================*/
  99. /* Return 0 on success, or -errno; other state communicated via *context */
  100. typedef int (*put_listent_func_t)(struct xfs_attr_list_context *, int,
  101. unsigned char *, int, int, unsigned char *);
  102. typedef struct xfs_attr_list_context {
  103. struct xfs_inode *dp; /* inode */
  104. struct attrlist_cursor_kern *cursor; /* position in list */
  105. char *alist; /* output buffer */
  106. int seen_enough; /* T/F: seen enough of list? */
  107. ssize_t count; /* num used entries */
  108. int dupcnt; /* count dup hashvals seen */
  109. int bufsize; /* total buffer size */
  110. int firstu; /* first used byte in buffer */
  111. int flags; /* from VOP call */
  112. int resynch; /* T/F: resynch with cursor */
  113. int put_value; /* T/F: need value for listent */
  114. put_listent_func_t put_listent; /* list output fmt function */
  115. int index; /* index into output buffer */
  116. } xfs_attr_list_context_t;
  117. /*========================================================================
  118. * Function prototypes for the kernel.
  119. *========================================================================*/
  120. /*
  121. * Overall external interface routines.
  122. */
  123. int xfs_attr_inactive(struct xfs_inode *dp);
  124. int xfs_attr_list_int(struct xfs_attr_list_context *);
  125. int xfs_inode_hasattr(struct xfs_inode *ip);
  126. int xfs_attr_get(struct xfs_inode *ip, const unsigned char *name,
  127. unsigned char *value, int *valuelenp, int flags);
  128. int xfs_attr_set(struct xfs_inode *dp, const unsigned char *name,
  129. unsigned char *value, int valuelen, int flags);
  130. int xfs_attr_remove(struct xfs_inode *dp, const unsigned char *name, int flags);
  131. int xfs_attr_list(struct xfs_inode *dp, char *buffer, int bufsize,
  132. int flags, struct attrlist_cursor_kern *cursor);
  133. #endif /* __XFS_ATTR_H__ */