2 * Copyright (c) 2000,2002,2005 Silicon Graphics, Inc.
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.
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.
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
18 #ifndef __XFS_ATTR_SF_H__
19 #define __XFS_ATTR_SF_H__
22 * Attribute storage when stored inside the inode.
24 * Small attribute lists are packed as tightly as possible so as
25 * to fit into the literal area of the inode.
31 * Entries are packed toward the top as tight as possible.
33 typedef struct xfs_attr_shortform {
34 struct xfs_attr_sf_hdr { /* constant-structure header block */
35 __be16 totsize; /* total bytes in shortform list */
36 __u8 count; /* count of active entries */
38 struct xfs_attr_sf_entry {
39 __uint8_t namelen; /* actual length of name (no NULL) */
40 __uint8_t valuelen; /* actual length of value (no NULL) */
41 __uint8_t flags; /* flags bits (see xfs_attr_leaf.h) */
42 __uint8_t nameval[1]; /* name & value bytes concatenated */
43 } list[1]; /* variable sized array */
44 } xfs_attr_shortform_t;
45 typedef struct xfs_attr_sf_hdr xfs_attr_sf_hdr_t;
46 typedef struct xfs_attr_sf_entry xfs_attr_sf_entry_t;
49 * We generate this then sort it, attr_list() must return things in hash-order.
51 typedef struct xfs_attr_sf_sort {
52 __uint8_t entno; /* entry number in original list */
53 __uint8_t namelen; /* length of name value (no null) */
54 __uint8_t valuelen; /* length of value */
55 __uint8_t flags; /* flags bits (see xfs_attr_leaf.h) */
56 xfs_dahash_t hash; /* this entry's hash value */
57 char *name; /* name value, pointer into buffer */
60 #define XFS_ATTR_SF_ENTSIZE_BYNAME(nlen,vlen) /* space name/value uses */ \
61 (((int)sizeof(xfs_attr_sf_entry_t)-1 + (nlen)+(vlen)))
62 #define XFS_ATTR_SF_ENTSIZE_MAX /* max space for name&value */ \
63 ((1 << (NBBY*(int)sizeof(__uint8_t))) - 1)
64 #define XFS_ATTR_SF_ENTSIZE(sfep) /* space an entry uses */ \
65 ((int)sizeof(xfs_attr_sf_entry_t)-1 + (sfep)->namelen+(sfep)->valuelen)
66 #define XFS_ATTR_SF_NEXTENTRY(sfep) /* next entry in struct */ \
67 ((xfs_attr_sf_entry_t *)((char *)(sfep) + XFS_ATTR_SF_ENTSIZE(sfep)))
68 #define XFS_ATTR_SF_TOTSIZE(dp) /* total space in use */ \
69 (be16_to_cpu(((xfs_attr_shortform_t *) \
70 ((dp)->i_afp->if_u1.if_data))->hdr.totsize))
72 #if defined(XFS_ATTR_TRACE)
74 * Kernel tracing support for attribute lists
76 struct xfs_attr_list_context;
77 struct xfs_da_intnode;
78 struct xfs_da_node_entry;
79 struct xfs_attr_leafblock;
81 #define XFS_ATTR_TRACE_SIZE 4096 /* size of global trace buffer */
82 extern ktrace_t *xfs_attr_trace_buf;
87 #define XFS_ATTR_KTRACE_L_C 1 /* context */
88 #define XFS_ATTR_KTRACE_L_CN 2 /* context, node */
89 #define XFS_ATTR_KTRACE_L_CB 3 /* context, btree */
90 #define XFS_ATTR_KTRACE_L_CL 4 /* context, leaf */
92 void xfs_attr_trace_l_c(char *where, struct xfs_attr_list_context *context);
93 void xfs_attr_trace_l_cn(char *where, struct xfs_attr_list_context *context,
94 struct xfs_da_intnode *node);
95 void xfs_attr_trace_l_cb(char *where, struct xfs_attr_list_context *context,
96 struct xfs_da_node_entry *btree);
97 void xfs_attr_trace_l_cl(char *where, struct xfs_attr_list_context *context,
98 struct xfs_attr_leafblock *leaf);
99 void xfs_attr_trace_enter(int type, char *where,
100 struct xfs_attr_list_context *context,
101 __psunsigned_t a13, __psunsigned_t a14,
104 #define xfs_attr_trace_l_c(w,c)
105 #define xfs_attr_trace_l_cn(w,c,n)
106 #define xfs_attr_trace_l_cb(w,c,b)
107 #define xfs_attr_trace_l_cl(w,c,l)
108 #endif /* XFS_ATTR_TRACE */
110 #endif /* __XFS_ATTR_SF_H__ */