b.liu | e958203 | 2025-04-17 19:18:16 +0800 | [diff] [blame^] | 1 | // SPDX-License-Identifier: GPL-2.0 |
| 2 | /* |
| 3 | * Copyright (c) 2000,2002,2005 Silicon Graphics, Inc. |
| 4 | * All Rights Reserved. |
| 5 | */ |
| 6 | #ifndef __XFS_ATTR_SF_H__ |
| 7 | #define __XFS_ATTR_SF_H__ |
| 8 | |
| 9 | /* |
| 10 | * Attribute storage when stored inside the inode. |
| 11 | * |
| 12 | * Small attribute lists are packed as tightly as possible so as |
| 13 | * to fit into the literal area of the inode. |
| 14 | */ |
| 15 | typedef struct xfs_attr_sf_hdr xfs_attr_sf_hdr_t; |
| 16 | typedef struct xfs_attr_sf_entry xfs_attr_sf_entry_t; |
| 17 | |
| 18 | /* |
| 19 | * We generate this then sort it, attr_list() must return things in hash-order. |
| 20 | */ |
| 21 | typedef struct xfs_attr_sf_sort { |
| 22 | uint8_t entno; /* entry number in original list */ |
| 23 | uint8_t namelen; /* length of name value (no null) */ |
| 24 | uint8_t valuelen; /* length of value */ |
| 25 | uint8_t flags; /* flags bits (see xfs_attr_leaf.h) */ |
| 26 | xfs_dahash_t hash; /* this entry's hash value */ |
| 27 | unsigned char *name; /* name value, pointer into buffer */ |
| 28 | } xfs_attr_sf_sort_t; |
| 29 | |
| 30 | #define XFS_ATTR_SF_ENTSIZE_BYNAME(nlen,vlen) /* space name/value uses */ \ |
| 31 | (((int)sizeof(xfs_attr_sf_entry_t)-1 + (nlen)+(vlen))) |
| 32 | #define XFS_ATTR_SF_ENTSIZE_MAX /* max space for name&value */ \ |
| 33 | ((1 << (NBBY*(int)sizeof(uint8_t))) - 1) |
| 34 | #define XFS_ATTR_SF_ENTSIZE(sfep) /* space an entry uses */ \ |
| 35 | ((int)sizeof(xfs_attr_sf_entry_t)-1 + (sfep)->namelen+(sfep)->valuelen) |
| 36 | #define XFS_ATTR_SF_NEXTENTRY(sfep) /* next entry in struct */ \ |
| 37 | ((xfs_attr_sf_entry_t *)((char *)(sfep) + XFS_ATTR_SF_ENTSIZE(sfep))) |
| 38 | #define XFS_ATTR_SF_TOTSIZE(dp) /* total space in use */ \ |
| 39 | (be16_to_cpu(((xfs_attr_shortform_t *) \ |
| 40 | ((dp)->i_afp->if_u1.if_data))->hdr.totsize)) |
| 41 | |
| 42 | #endif /* __XFS_ATTR_SF_H__ */ |