hollalinux
/
linux-sg2042
mirror of https://github.com/sophgo/linux-riscv.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

xfs: avoid usage of struct xfs_dir2_data 

In most places we can simply pass around and use the struct xfs_dir2_data_hdr,
which is the first and most important member of struct xfs_dir2_data instead
of the full structure.

Signed-off-by: Christoph Hellwig <hch@lst.de>
Reviewed-by: Alex Elder <aelder@sgi.com>
Reviewed-by: Dave Chinner <dchinner@redhat.com>
This commit is contained in:
Christoph Hellwig 2011-07-08 14:35:38 +02:00
parent a64b041797
commit c2066e2662
6 changed files with 236 additions and 231 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

11
fs/xfs/xfs_da_btree.c
View File

@ -2079,16 +2079,13 @@ xfs_da_do_buf(
* For read_buf, check the magic number. * For read_buf, check the magic number.
*/ */
if (caller == 1) { if (caller == 1) {
xfs_dir2_data_t *data; xfs_dir2_data_hdr_t *hdr = rbp->data;
xfs_dir2_free_t *free; xfs_dir2_free_t *free = rbp->data;
xfs_da_blkinfo_t *info; xfs_da_blkinfo_t *info = rbp->data;
uint magic, magic1; uint magic, magic1;
info = rbp->data;
data = rbp->data;
free = rbp->data;
magic = be16_to_cpu(info->magic); magic = be16_to_cpu(info->magic);
magic1 = be32_to_cpu(data->hdr.magic); magic1 = be32_to_cpu(hdr->magic);
if (unlikely( if (unlikely(
XFS_TEST_ERROR((magic != XFS_DA_NODE_MAGIC) && XFS_TEST_ERROR((magic != XFS_DA_NODE_MAGIC) &&
(magic != XFS_ATTR_LEAF_MAGIC) && (magic != XFS_ATTR_LEAF_MAGIC) &&

14
fs/xfs/xfs_dir2_block.c
View File

@ -282,7 +282,7 @@ xfs_dir2_block_addname(
* This needs to happen before the next call to use_free. * This needs to happen before the next call to use_free.
*/ */
if (needscan) { if (needscan) {
xfs_dir2_data_freescan(mp, (xfs_dir2_data_t *)hdr, &needlog); xfs_dir2_data_freescan(mp, hdr, &needlog);
needscan = 0; needscan = 0;
} }
} }
@ -331,8 +331,7 @@ xfs_dir2_block_addname(
* This needs to happen before the next call to use_free. * This needs to happen before the next call to use_free.
*/ */
if (needscan) { if (needscan) {
xfs_dir2_data_freescan(mp, (xfs_dir2_data_t *)hdr, xfs_dir2_data_freescan(mp, hdr, &needlog);
&needlog);
needscan = 0; needscan = 0;
} }
/* /*
@ -417,7 +416,7 @@ xfs_dir2_block_addname(
* Clean up the bestfree array and log the header, tail, and entry. * Clean up the bestfree array and log the header, tail, and entry.
*/ */
if (needscan) if (needscan)
xfs_dir2_data_freescan(mp, (xfs_dir2_data_t *)hdr, &needlog); xfs_dir2_data_freescan(mp, hdr, &needlog);
if (needlog) if (needlog)
xfs_dir2_data_log_header(tp, bp); xfs_dir2_data_log_header(tp, bp);
xfs_dir2_block_log_tail(tp, bp); xfs_dir2_block_log_tail(tp, bp);
@ -783,7 +782,7 @@ xfs_dir2_block_removename(
* Fix up bestfree, log the header if necessary. * Fix up bestfree, log the header if necessary.
*/ */
if (needscan) if (needscan)
xfs_dir2_data_freescan(mp, (xfs_dir2_data_t *)hdr, &needlog); xfs_dir2_data_freescan(mp, hdr, &needlog);
if (needlog) if (needlog)
xfs_dir2_data_log_header(tp, bp); xfs_dir2_data_log_header(tp, bp);
xfs_dir2_data_check(dp, bp); xfs_dir2_data_check(dp, bp);
@ -982,7 +981,7 @@ xfs_dir2_leaf_to_block(
* Scan the bestfree if we need it and log the data block header. * Scan the bestfree if we need it and log the data block header.
*/ */
if (needscan) if (needscan)
xfs_dir2_data_freescan(mp, (xfs_dir2_data_t *)hdr, &needlog); xfs_dir2_data_freescan(mp, hdr, &needlog);
if (needlog) if (needlog)
xfs_dir2_data_log_header(tp, dbp); xfs_dir2_data_log_header(tp, dbp);
/* /*
@ -1177,8 +1176,7 @@ xfs_dir2_sf_to_block(
*xfs_dir2_data_unused_tag_p(dup) = cpu_to_be16( *xfs_dir2_data_unused_tag_p(dup) = cpu_to_be16(
((char *)dup - (char *)hdr)); ((char *)dup - (char *)hdr));
xfs_dir2_data_log_unused(tp, bp, dup); xfs_dir2_data_log_unused(tp, bp, dup);
(void)xfs_dir2_data_freeinsert((xfs_dir2_data_t *)hdr, xfs_dir2_data_freeinsert(hdr, dup, &dummy);
dup, &dummy);
offset += be16_to_cpu(dup->length); offset += be16_to_cpu(dup->length);
continue; continue;
} }

306
fs/xfs/xfs_dir2_data.c
View File

@ -35,6 +35,9 @@
#include "xfs_dir2_block.h" #include "xfs_dir2_block.h"
#include "xfs_error.h" #include "xfs_error.h"
STATIC xfs_dir2_data_free_t *
xfs_dir2_data_freefind(xfs_dir2_data_hdr_t *hdr, xfs_dir2_data_unused_t *dup);
#ifdef DEBUG #ifdef DEBUG
/* /*
* Check the consistency of the data block. * Check the consistency of the data block.
@ -51,6 +54,7 @@ xfs_dir2_data_check(
xfs_dir2_block_tail_t *btp=NULL; /* block tail */ xfs_dir2_block_tail_t *btp=NULL; /* block tail */
int count; /* count of entries found */ int count; /* count of entries found */
xfs_dir2_data_t *d; /* data block pointer */ xfs_dir2_data_t *d; /* data block pointer */
xfs_dir2_data_hdr_t *hdr; /* data block header */
xfs_dir2_data_entry_t *dep; /* data entry */ xfs_dir2_data_entry_t *dep; /* data entry */
xfs_dir2_data_free_t *dfp; /* bestfree entry */ xfs_dir2_data_free_t *dfp; /* bestfree entry */
xfs_dir2_data_unused_t *dup; /* unused entry */ xfs_dir2_data_unused_t *dup; /* unused entry */
@ -67,16 +71,19 @@ xfs_dir2_data_check(
mp = dp->i_mount; mp = dp->i_mount;
d = bp->data; d = bp->data;
ASSERT(be32_to_cpu(d->hdr.magic) == XFS_DIR2_DATA_MAGIC || hdr = &d->hdr;
be32_to_cpu(d->hdr.magic) == XFS_DIR2_BLOCK_MAGIC); bf = hdr->bestfree;
bf = d->hdr.bestfree;
p = (char *)d->u; p = (char *)d->u;
if (be32_to_cpu(d->hdr.magic) == XFS_DIR2_BLOCK_MAGIC) {
btp = xfs_dir2_block_tail_p(mp, &d->hdr); if (be32_to_cpu(hdr->magic) == XFS_DIR2_BLOCK_MAGIC) {
btp = xfs_dir2_block_tail_p(mp, hdr);
lep = xfs_dir2_block_leaf_p(btp); lep = xfs_dir2_block_leaf_p(btp);
endp = (char *)lep; endp = (char *)lep;
} else } else {
endp = (char *)d + mp->m_dirblksize; ASSERT(hdr->magic == cpu_to_be32(XFS_DIR2_DATA_MAGIC));
endp = (char *)hdr + mp->m_dirblksize;
}
count = lastfree = freeseen = 0; count = lastfree = freeseen = 0;
/* /*
* Account for zero bestfree entries. * Account for zero bestfree entries.
@ -108,8 +115,8 @@ xfs_dir2_data_check(
if (be16_to_cpu(dup->freetag) == XFS_DIR2_DATA_FREE_TAG) { if (be16_to_cpu(dup->freetag) == XFS_DIR2_DATA_FREE_TAG) {
ASSERT(lastfree == 0); ASSERT(lastfree == 0);
ASSERT(be16_to_cpu(*xfs_dir2_data_unused_tag_p(dup)) == ASSERT(be16_to_cpu(*xfs_dir2_data_unused_tag_p(dup)) ==
(char *)dup - (char *)d); (char *)dup - (char *)hdr);
dfp = xfs_dir2_data_freefind(d, dup); dfp = xfs_dir2_data_freefind(hdr, dup);
if (dfp) { if (dfp) {
i = (int)(dfp - bf); i = (int)(dfp - bf);
ASSERT((freeseen & (1 << i)) == 0); ASSERT((freeseen & (1 << i)) == 0);
@ -132,13 +139,13 @@ xfs_dir2_data_check(
ASSERT(dep->namelen != 0); ASSERT(dep->namelen != 0);
ASSERT(xfs_dir_ino_validate(mp, be64_to_cpu(dep->inumber)) == 0); ASSERT(xfs_dir_ino_validate(mp, be64_to_cpu(dep->inumber)) == 0);
ASSERT(be16_to_cpu(*xfs_dir2_data_entry_tag_p(dep)) == ASSERT(be16_to_cpu(*xfs_dir2_data_entry_tag_p(dep)) ==
(char *)dep - (char *)d); (char *)dep - (char *)hdr);
count++; count++;
lastfree = 0; lastfree = 0;
if (be32_to_cpu(d->hdr.magic) == XFS_DIR2_BLOCK_MAGIC) { if (be32_to_cpu(hdr->magic) == XFS_DIR2_BLOCK_MAGIC) {
addr = xfs_dir2_db_off_to_dataptr(mp, mp->m_dirdatablk, addr = xfs_dir2_db_off_to_dataptr(mp, mp->m_dirdatablk,
(xfs_dir2_data_aoff_t) (xfs_dir2_data_aoff_t)
((char *)dep - (char *)d)); ((char *)dep - (char *)hdr));
name.name = dep->name; name.name = dep->name;
name.len = dep->namelen; name.len = dep->namelen;
hash = mp->m_dirnameops->hashname(&name); hash = mp->m_dirnameops->hashname(&name);
@ -155,7 +162,7 @@ xfs_dir2_data_check(
* Need to have seen all the entries and all the bestfree slots. * Need to have seen all the entries and all the bestfree slots.
*/ */
ASSERT(freeseen == 7); ASSERT(freeseen == 7);
if (be32_to_cpu(d->hdr.magic) == XFS_DIR2_BLOCK_MAGIC) { if (be32_to_cpu(hdr->magic) == XFS_DIR2_BLOCK_MAGIC) {
for (i = stale = 0; i < be32_to_cpu(btp->count); i++) { for (i = stale = 0; i < be32_to_cpu(btp->count); i++) {
if (be32_to_cpu(lep[i].address) == XFS_DIR2_NULL_DATAPTR) if (be32_to_cpu(lep[i].address) == XFS_DIR2_NULL_DATAPTR)
stale++; stale++;
@ -172,9 +179,9 @@ xfs_dir2_data_check(
* Given a data block and an unused entry from that block, * Given a data block and an unused entry from that block,
* return the bestfree entry if any that corresponds to it. * return the bestfree entry if any that corresponds to it.
*/ */
xfs_dir2_data_free_t * STATIC xfs_dir2_data_free_t *
xfs_dir2_data_freefind( xfs_dir2_data_freefind(
xfs_dir2_data_t *d, /* data block */ xfs_dir2_data_hdr_t *hdr, /* data block */
xfs_dir2_data_unused_t *dup) /* data unused entry */ xfs_dir2_data_unused_t *dup) /* data unused entry */
{ {
xfs_dir2_data_free_t *dfp; /* bestfree entry */ xfs_dir2_data_free_t *dfp; /* bestfree entry */
@ -184,17 +191,17 @@ xfs_dir2_data_freefind(
int seenzero; /* saw a 0 bestfree entry */ int seenzero; /* saw a 0 bestfree entry */
#endif #endif
off = (xfs_dir2_data_aoff_t)((char *)dup - (char *)d); off = (xfs_dir2_data_aoff_t)((char *)dup - (char *)hdr);
#if defined(DEBUG) && defined(__KERNEL__) #if defined(DEBUG) && defined(__KERNEL__)
/* /*
* Validate some consistency in the bestfree table. * Validate some consistency in the bestfree table.
* Check order, non-overlapping entries, and if we find the * Check order, non-overlapping entries, and if we find the
* one we're looking for it has to be exact. * one we're looking for it has to be exact.
*/ */
ASSERT(be32_to_cpu(d->hdr.magic) == XFS_DIR2_DATA_MAGIC || ASSERT(be32_to_cpu(hdr->magic) == XFS_DIR2_DATA_MAGIC ||
be32_to_cpu(d->hdr.magic) == XFS_DIR2_BLOCK_MAGIC); be32_to_cpu(hdr->magic) == XFS_DIR2_BLOCK_MAGIC);
for (dfp = &d->hdr.bestfree[0], seenzero = matched = 0; for (dfp = &hdr->bestfree[0], seenzero = matched = 0;
dfp < &d->hdr.bestfree[XFS_DIR2_DATA_FD_COUNT]; dfp < &hdr->bestfree[XFS_DIR2_DATA_FD_COUNT];
dfp++) { dfp++) {
if (!dfp->offset) { if (!dfp->offset) {
ASSERT(!dfp->length); ASSERT(!dfp->length);
@ -210,7 +217,7 @@ xfs_dir2_data_freefind(
else else
ASSERT(be16_to_cpu(dfp->offset) + be16_to_cpu(dfp->length) <= off); ASSERT(be16_to_cpu(dfp->offset) + be16_to_cpu(dfp->length) <= off);
ASSERT(matched || be16_to_cpu(dfp->length) >= be16_to_cpu(dup->length)); ASSERT(matched || be16_to_cpu(dfp->length) >= be16_to_cpu(dup->length));
if (dfp > &d->hdr.bestfree[0]) if (dfp > &hdr->bestfree[0])
ASSERT(be16_to_cpu(dfp[-1].length) >= be16_to_cpu(dfp[0].length)); ASSERT(be16_to_cpu(dfp[-1].length) >= be16_to_cpu(dfp[0].length));
} }
#endif #endif
@ -219,13 +226,13 @@ xfs_dir2_data_freefind(
* it can't be there since they're sorted. * it can't be there since they're sorted.
*/ */
if (be16_to_cpu(dup->length) < if (be16_to_cpu(dup->length) <
be16_to_cpu(d->hdr.bestfree[XFS_DIR2_DATA_FD_COUNT - 1].length)) be16_to_cpu(hdr->bestfree[XFS_DIR2_DATA_FD_COUNT - 1].length))
return NULL; return NULL;
/* /*
* Look at the three bestfree entries for our guy. * Look at the three bestfree entries for our guy.
*/ */
for (dfp = &d->hdr.bestfree[0]; for (dfp = &hdr->bestfree[0];
dfp < &d->hdr.bestfree[XFS_DIR2_DATA_FD_COUNT]; dfp < &hdr->bestfree[XFS_DIR2_DATA_FD_COUNT];
dfp++) { dfp++) {
if (!dfp->offset) if (!dfp->offset)
return NULL; return NULL;
@ -243,7 +250,7 @@ xfs_dir2_data_freefind(
*/ */
xfs_dir2_data_free_t * /* entry inserted */ xfs_dir2_data_free_t * /* entry inserted */
xfs_dir2_data_freeinsert( xfs_dir2_data_freeinsert(
xfs_dir2_data_t *d, /* data block pointer */ xfs_dir2_data_hdr_t *hdr, /* data block pointer */
xfs_dir2_data_unused_t *dup, /* unused space */ xfs_dir2_data_unused_t *dup, /* unused space */
int *loghead) /* log the data header (out) */ int *loghead) /* log the data header (out) */
{ {
@ -251,12 +258,13 @@ xfs_dir2_data_freeinsert(
xfs_dir2_data_free_t new; /* new bestfree entry */ xfs_dir2_data_free_t new; /* new bestfree entry */
#ifdef __KERNEL__ #ifdef __KERNEL__
ASSERT(be32_to_cpu(d->hdr.magic) == XFS_DIR2_DATA_MAGIC || ASSERT(be32_to_cpu(hdr->magic) == XFS_DIR2_DATA_MAGIC ||
be32_to_cpu(d->hdr.magic) == XFS_DIR2_BLOCK_MAGIC); be32_to_cpu(hdr->magic) == XFS_DIR2_BLOCK_MAGIC);
#endif #endif
dfp = d->hdr.bestfree; dfp = hdr->bestfree;
new.length = dup->length; new.length = dup->length;
new.offset = cpu_to_be16((char *)dup - (char *)d); new.offset = cpu_to_be16((char *)dup - (char *)hdr);
/* /*
* Insert at position 0, 1, or 2; or not at all. * Insert at position 0, 1, or 2; or not at all.
*/ */
@ -286,36 +294,36 @@ xfs_dir2_data_freeinsert(
*/ */
STATIC void STATIC void
xfs_dir2_data_freeremove( xfs_dir2_data_freeremove(
xfs_dir2_data_t *d, /* data block pointer */ xfs_dir2_data_hdr_t *hdr, /* data block header */
xfs_dir2_data_free_t *dfp, /* bestfree entry pointer */ xfs_dir2_data_free_t *dfp, /* bestfree entry pointer */
int *loghead) /* out: log data header */ int *loghead) /* out: log data header */
{ {
#ifdef __KERNEL__ #ifdef __KERNEL__
ASSERT(be32_to_cpu(d->hdr.magic) == XFS_DIR2_DATA_MAGIC || ASSERT(be32_to_cpu(hdr->magic) == XFS_DIR2_DATA_MAGIC ||
be32_to_cpu(d->hdr.magic) == XFS_DIR2_BLOCK_MAGIC); be32_to_cpu(hdr->magic) == XFS_DIR2_BLOCK_MAGIC);
#endif #endif
/* /*
* It's the first entry, slide the next 2 up. * It's the first entry, slide the next 2 up.
*/ */
if (dfp == &d->hdr.bestfree[0]) { if (dfp == &hdr->bestfree[0]) {
d->hdr.bestfree[0] = d->hdr.bestfree[1]; hdr->bestfree[0] = hdr->bestfree[1];
d->hdr.bestfree[1] = d->hdr.bestfree[2]; hdr->bestfree[1] = hdr->bestfree[2];
} }
/* /*
* It's the second entry, slide the 3rd entry up. * It's the second entry, slide the 3rd entry up.
*/ */
else if (dfp == &d->hdr.bestfree[1]) else if (dfp == &hdr->bestfree[1])
d->hdr.bestfree[1] = d->hdr.bestfree[2]; hdr->bestfree[1] = hdr->bestfree[2];
/* /*
* Must be the last entry. * Must be the last entry.
*/ */
else else
ASSERT(dfp == &d->hdr.bestfree[2]); ASSERT(dfp == &hdr->bestfree[2]);
/* /*
* Clear the 3rd entry, must be zero now. * Clear the 3rd entry, must be zero now.
*/ */
d->hdr.bestfree[2].length = 0; hdr->bestfree[2].length = 0;
d->hdr.bestfree[2].offset = 0; hdr->bestfree[2].offset = 0;
*loghead = 1; *loghead = 1;
} }
@ -325,9 +333,10 @@ xfs_dir2_data_freeremove(
void void
xfs_dir2_data_freescan( xfs_dir2_data_freescan(
xfs_mount_t *mp, /* filesystem mount point */ xfs_mount_t *mp, /* filesystem mount point */
xfs_dir2_data_t *d, /* data block pointer */ xfs_dir2_data_hdr_t *hdr, /* data block header */
int *loghead) /* out: log data header */ int *loghead) /* out: log data header */
{ {
xfs_dir2_data_t *d = (xfs_dir2_data_t *)hdr;
xfs_dir2_block_tail_t *btp; /* block tail */ xfs_dir2_block_tail_t *btp; /* block tail */
xfs_dir2_data_entry_t *dep; /* active data entry */ xfs_dir2_data_entry_t *dep; /* active data entry */
xfs_dir2_data_unused_t *dup; /* unused data entry */ xfs_dir2_data_unused_t *dup; /* unused data entry */
@ -335,23 +344,23 @@ xfs_dir2_data_freescan(
char *p; /* current entry pointer */ char *p; /* current entry pointer */
#ifdef __KERNEL__ #ifdef __KERNEL__
ASSERT(be32_to_cpu(d->hdr.magic) == XFS_DIR2_DATA_MAGIC || ASSERT(be32_to_cpu(hdr->magic) == XFS_DIR2_DATA_MAGIC ||
be32_to_cpu(d->hdr.magic) == XFS_DIR2_BLOCK_MAGIC); be32_to_cpu(hdr->magic) == XFS_DIR2_BLOCK_MAGIC);
#endif #endif
/* /*
* Start by clearing the table. * Start by clearing the table.
*/ */
memset(d->hdr.bestfree, 0, sizeof(d->hdr.bestfree)); memset(hdr->bestfree, 0, sizeof(hdr->bestfree));
*loghead = 1; *loghead = 1;
/* /*
* Set up pointers. * Set up pointers.
*/ */
p = (char *)d->u; p = (char *)d->u;
if (be32_to_cpu(d->hdr.magic) == XFS_DIR2_BLOCK_MAGIC) { if (be32_to_cpu(hdr->magic) == XFS_DIR2_BLOCK_MAGIC) {
btp = xfs_dir2_block_tail_p(mp, &d->hdr); btp = xfs_dir2_block_tail_p(mp, hdr);
endp = (char *)xfs_dir2_block_leaf_p(btp); endp = (char *)xfs_dir2_block_leaf_p(btp);
} else } else
endp = (char *)d + mp->m_dirblksize; endp = (char *)hdr + mp->m_dirblksize;
/* /*
* Loop over the block's entries. * Loop over the block's entries.
*/ */
@ -361,9 +370,9 @@ xfs_dir2_data_freescan(
* If it's a free entry, insert it. * If it's a free entry, insert it.
*/ */
if (be16_to_cpu(dup->freetag) == XFS_DIR2_DATA_FREE_TAG) { if (be16_to_cpu(dup->freetag) == XFS_DIR2_DATA_FREE_TAG) {
ASSERT((char *)dup - (char *)d == ASSERT((char *)dup - (char *)hdr ==
be16_to_cpu(*xfs_dir2_data_unused_tag_p(dup))); be16_to_cpu(*xfs_dir2_data_unused_tag_p(dup)));
xfs_dir2_data_freeinsert(d, dup, loghead); xfs_dir2_data_freeinsert(hdr, dup, loghead);
p += be16_to_cpu(dup->length); p += be16_to_cpu(dup->length);
} }
/* /*
@ -371,7 +380,7 @@ xfs_dir2_data_freescan(
*/ */
else { else {
dep = (xfs_dir2_data_entry_t *)p; dep = (xfs_dir2_data_entry_t *)p;
ASSERT((char *)dep - (char *)d == ASSERT((char *)dep - (char *)hdr ==
be16_to_cpu(*xfs_dir2_data_entry_tag_p(dep))); be16_to_cpu(*xfs_dir2_data_entry_tag_p(dep)));
p += xfs_dir2_data_entsize(dep->namelen); p += xfs_dir2_data_entsize(dep->namelen);
} }
@ -390,6 +399,7 @@ xfs_dir2_data_init(
{ {
xfs_dabuf_t *bp; /* block buffer */ xfs_dabuf_t *bp; /* block buffer */
xfs_dir2_data_t *d; /* pointer to block */ xfs_dir2_data_t *d; /* pointer to block */
xfs_dir2_data_hdr_t *hdr; /* data block header */
xfs_inode_t *dp; /* incore directory inode */ xfs_inode_t *dp; /* incore directory inode */
xfs_dir2_data_unused_t *dup; /* unused entry pointer */ xfs_dir2_data_unused_t *dup; /* unused entry pointer */
int error; /* error return value */ int error; /* error return value */
@ -410,26 +420,29 @@ xfs_dir2_data_init(
return error; return error;
} }
ASSERT(bp != NULL); ASSERT(bp != NULL);
/* /*
* Initialize the header. * Initialize the header.
*/ */
d = bp->data; d = bp->data;
d->hdr.magic = cpu_to_be32(XFS_DIR2_DATA_MAGIC); hdr = &d->hdr;
d->hdr.bestfree[0].offset = cpu_to_be16(sizeof(d->hdr)); hdr->magic = cpu_to_be32(XFS_DIR2_DATA_MAGIC);
hdr->bestfree[0].offset = cpu_to_be16(sizeof(*hdr));
for (i = 1; i < XFS_DIR2_DATA_FD_COUNT; i++) { for (i = 1; i < XFS_DIR2_DATA_FD_COUNT; i++) {
d->hdr.bestfree[i].length = 0; hdr->bestfree[i].length = 0;
d->hdr.bestfree[i].offset = 0; hdr->bestfree[i].offset = 0;
} }
/* /*
* Set up an unused entry for the block's body. * Set up an unused entry for the block's body.
*/ */
dup = &d->u[0].unused; dup = &d->u[0].unused;
dup->freetag = cpu_to_be16(XFS_DIR2_DATA_FREE_TAG); dup->freetag = cpu_to_be16(XFS_DIR2_DATA_FREE_TAG);
t=mp->m_dirblksize - (uint)sizeof(d->hdr); t = mp->m_dirblksize - (uint)sizeof(*hdr);
d->hdr.bestfree[0].length = cpu_to_be16(t); hdr->bestfree[0].length = cpu_to_be16(t);
dup->length = cpu_to_be16(t); dup->length = cpu_to_be16(t);
*xfs_dir2_data_unused_tag_p(dup) = cpu_to_be16((char *)dup - (char *)d); *xfs_dir2_data_unused_tag_p(dup) = cpu_to_be16((char *)dup - (char *)hdr);
/* /*
* Log it and return it. * Log it and return it.
*/ */
@ -448,14 +461,14 @@ xfs_dir2_data_log_entry(
xfs_dabuf_t *bp, /* block buffer */ xfs_dabuf_t *bp, /* block buffer */
xfs_dir2_data_entry_t *dep) /* data entry pointer */ xfs_dir2_data_entry_t *dep) /* data entry pointer */
{ {
xfs_dir2_data_t *d; /* data block pointer */ xfs_dir2_data_hdr_t *hdr = bp->data;
d = bp->data; ASSERT(be32_to_cpu(hdr->magic) == XFS_DIR2_DATA_MAGIC ||
ASSERT(be32_to_cpu(d->hdr.magic) == XFS_DIR2_DATA_MAGIC || be32_to_cpu(hdr->magic) == XFS_DIR2_BLOCK_MAGIC);
be32_to_cpu(d->hdr.magic) == XFS_DIR2_BLOCK_MAGIC);
xfs_da_log_buf(tp, bp, (uint)((char *)dep - (char *)d), xfs_da_log_buf(tp, bp, (uint)((char *)dep - (char *)hdr),
(uint)((char *)(xfs_dir2_data_entry_tag_p(dep) + 1) - (uint)((char *)(xfs_dir2_data_entry_tag_p(dep) + 1) -
(char *)d - 1)); (char *)hdr - 1));
} }
/* /*
@ -466,13 +479,12 @@ xfs_dir2_data_log_header(
xfs_trans_t *tp, /* transaction pointer */ xfs_trans_t *tp, /* transaction pointer */
xfs_dabuf_t *bp) /* block buffer */ xfs_dabuf_t *bp) /* block buffer */
{ {
xfs_dir2_data_t *d; /* data block pointer */ xfs_dir2_data_hdr_t *hdr = bp->data;
d = bp->data; ASSERT(be32_to_cpu(hdr->magic) == XFS_DIR2_DATA_MAGIC ||
ASSERT(be32_to_cpu(d->hdr.magic) == XFS_DIR2_DATA_MAGIC || be32_to_cpu(hdr->magic) == XFS_DIR2_BLOCK_MAGIC);
be32_to_cpu(d->hdr.magic) == XFS_DIR2_BLOCK_MAGIC);
xfs_da_log_buf(tp, bp, (uint)((char *)&d->hdr - (char *)d), xfs_da_log_buf(tp, bp, 0, sizeof(*hdr) - 1);
(uint)(sizeof(d->hdr) - 1));
} }
/* /*
@ -484,23 +496,23 @@ xfs_dir2_data_log_unused(
xfs_dabuf_t *bp, /* block buffer */ xfs_dabuf_t *bp, /* block buffer */
xfs_dir2_data_unused_t *dup) /* data unused pointer */ xfs_dir2_data_unused_t *dup) /* data unused pointer */
{ {
xfs_dir2_data_t *d; /* data block pointer */ xfs_dir2_data_hdr_t *hdr = bp->data;
ASSERT(be32_to_cpu(hdr->magic) == XFS_DIR2_DATA_MAGIC ||
be32_to_cpu(hdr->magic) == XFS_DIR2_BLOCK_MAGIC);
d = bp->data;
ASSERT(be32_to_cpu(d->hdr.magic) == XFS_DIR2_DATA_MAGIC ||
be32_to_cpu(d->hdr.magic) == XFS_DIR2_BLOCK_MAGIC);
/* /*
* Log the first part of the unused entry. * Log the first part of the unused entry.
*/ */
xfs_da_log_buf(tp, bp, (uint)((char *)dup - (char *)d), xfs_da_log_buf(tp, bp, (uint)((char *)dup - (char *)hdr),
(uint)((char *)&dup->length + sizeof(dup->length) - (uint)((char *)&dup->length + sizeof(dup->length) -
1 - (char *)d)); 1 - (char *)hdr));
/* /*
* Log the end (tag) of the unused entry. * Log the end (tag) of the unused entry.
*/ */
xfs_da_log_buf(tp, bp, xfs_da_log_buf(tp, bp,
(uint)((char *)xfs_dir2_data_unused_tag_p(dup) - (char *)d), (uint)((char *)xfs_dir2_data_unused_tag_p(dup) - (char *)hdr),
(uint)((char *)xfs_dir2_data_unused_tag_p(dup) - (char *)d + (uint)((char *)xfs_dir2_data_unused_tag_p(dup) - (char *)hdr +
sizeof(xfs_dir2_data_off_t) - 1)); sizeof(xfs_dir2_data_off_t) - 1));
} }
@ -517,7 +529,7 @@ xfs_dir2_data_make_free(
int *needlogp, /* out: log header */ int *needlogp, /* out: log header */
int *needscanp) /* out: regen bestfree */ int *needscanp) /* out: regen bestfree */
{ {
xfs_dir2_data_t *d; /* data block pointer */ xfs_dir2_data_hdr_t *hdr; /* data block pointer */
xfs_dir2_data_free_t *dfp; /* bestfree pointer */ xfs_dir2_data_free_t *dfp; /* bestfree pointer */
char *endptr; /* end of data area */ char *endptr; /* end of data area */
xfs_mount_t *mp; /* filesystem mount point */ xfs_mount_t *mp; /* filesystem mount point */
@ -527,28 +539,29 @@ xfs_dir2_data_make_free(
xfs_dir2_data_unused_t *prevdup; /* unused entry before us */ xfs_dir2_data_unused_t *prevdup; /* unused entry before us */
mp = tp->t_mountp; mp = tp->t_mountp;
d = bp->data; hdr = bp->data;
/* /*
* Figure out where the end of the data area is. * Figure out where the end of the data area is.
*/ */
if (be32_to_cpu(d->hdr.magic) == XFS_DIR2_DATA_MAGIC) if (be32_to_cpu(hdr->magic) == XFS_DIR2_DATA_MAGIC)
endptr = (char *)d + mp->m_dirblksize; endptr = (char *)hdr + mp->m_dirblksize;
else { else {
xfs_dir2_block_tail_t *btp; /* block tail */ xfs_dir2_block_tail_t *btp; /* block tail */
ASSERT(be32_to_cpu(d->hdr.magic) == XFS_DIR2_BLOCK_MAGIC); ASSERT(be32_to_cpu(hdr->magic) == XFS_DIR2_BLOCK_MAGIC);
btp = xfs_dir2_block_tail_p(mp, &d->hdr); btp = xfs_dir2_block_tail_p(mp, hdr);
endptr = (char *)xfs_dir2_block_leaf_p(btp); endptr = (char *)xfs_dir2_block_leaf_p(btp);
} }
/* /*
* If this isn't the start of the block, then back up to * If this isn't the start of the block, then back up to
* the previous entry and see if it's free. * the previous entry and see if it's free.
*/ */
if (offset > sizeof(d->hdr)) { if (offset > sizeof(*hdr)) {
__be16 *tagp; /* tag just before us */ __be16 *tagp; /* tag just before us */
tagp = (__be16 *)((char *)d + offset) - 1; tagp = (__be16 *)((char *)hdr + offset) - 1;
prevdup = (xfs_dir2_data_unused_t *)((char *)d + be16_to_cpu(*tagp)); prevdup = (xfs_dir2_data_unused_t *)((char *)hdr + be16_to_cpu(*tagp));
if (be16_to_cpu(prevdup->freetag) != XFS_DIR2_DATA_FREE_TAG) if (be16_to_cpu(prevdup->freetag) != XFS_DIR2_DATA_FREE_TAG)
prevdup = NULL; prevdup = NULL;
} else } else
@ -557,9 +570,9 @@ xfs_dir2_data_make_free(
* If this isn't the end of the block, see if the entry after * If this isn't the end of the block, see if the entry after
* us is free. * us is free.
*/ */
if ((char *)d + offset + len < endptr) { if ((char *)hdr + offset + len < endptr) {
postdup = postdup =
(xfs_dir2_data_unused_t *)((char *)d + offset + len); (xfs_dir2_data_unused_t *)((char *)hdr + offset + len);
if (be16_to_cpu(postdup->freetag) != XFS_DIR2_DATA_FREE_TAG) if (be16_to_cpu(postdup->freetag) != XFS_DIR2_DATA_FREE_TAG)
postdup = NULL; postdup = NULL;
} else } else
@ -576,21 +589,21 @@ xfs_dir2_data_make_free(
/* /*
* See if prevdup and/or postdup are in bestfree table. * See if prevdup and/or postdup are in bestfree table.
*/ */
dfp = xfs_dir2_data_freefind(d, prevdup); dfp = xfs_dir2_data_freefind(hdr, prevdup);
dfp2 = xfs_dir2_data_freefind(d, postdup); dfp2 = xfs_dir2_data_freefind(hdr, postdup);
/* /*
* We need a rescan unless there are exactly 2 free entries * We need a rescan unless there are exactly 2 free entries
* namely our two. Then we know what's happening, otherwise * namely our two. Then we know what's happening, otherwise
* since the third bestfree is there, there might be more * since the third bestfree is there, there might be more
* entries. * entries.
*/ */
needscan = (d->hdr.bestfree[2].length != 0); needscan = (hdr->bestfree[2].length != 0);
/* /*
* Fix up the new big freespace. * Fix up the new big freespace.
*/ */
be16_add_cpu(&prevdup->length, len + be16_to_cpu(postdup->length)); be16_add_cpu(&prevdup->length, len + be16_to_cpu(postdup->length));
*xfs_dir2_data_unused_tag_p(prevdup) = *xfs_dir2_data_unused_tag_p(prevdup) =
cpu_to_be16((char *)prevdup - (char *)d); cpu_to_be16((char *)prevdup - (char *)hdr);
xfs_dir2_data_log_unused(tp, bp, prevdup); xfs_dir2_data_log_unused(tp, bp, prevdup);
if (!needscan) { if (!needscan) {
/* /*
@ -600,18 +613,18 @@ xfs_dir2_data_make_free(
* Remove entry 1 first then entry 0. * Remove entry 1 first then entry 0.
*/ */
ASSERT(dfp && dfp2); ASSERT(dfp && dfp2);
if (dfp == &d->hdr.bestfree[1]) { if (dfp == &hdr->bestfree[1]) {
dfp = &d->hdr.bestfree[0]; dfp = &hdr->bestfree[0];
ASSERT(dfp2 == dfp); ASSERT(dfp2 == dfp);
dfp2 = &d->hdr.bestfree[1]; dfp2 = &hdr->bestfree[1];
} }
xfs_dir2_data_freeremove(d, dfp2, needlogp); xfs_dir2_data_freeremove(hdr, dfp2, needlogp);
xfs_dir2_data_freeremove(d, dfp, needlogp); xfs_dir2_data_freeremove(hdr, dfp, needlogp);
/* /*
* Now insert the new entry. * Now insert the new entry.
*/ */
dfp = xfs_dir2_data_freeinsert(d, prevdup, needlogp); dfp = xfs_dir2_data_freeinsert(hdr, prevdup, needlogp);
ASSERT(dfp == &d->hdr.bestfree[0]); ASSERT(dfp == &hdr->bestfree[0]);
ASSERT(dfp->length == prevdup->length); ASSERT(dfp->length == prevdup->length);
ASSERT(!dfp[1].length); ASSERT(!dfp[1].length);
ASSERT(!dfp[2].length); ASSERT(!dfp[2].length);
@ -621,10 +634,10 @@ xfs_dir2_data_make_free(
* The entry before us is free, merge with it. * The entry before us is free, merge with it.
*/ */
else if (prevdup) { else if (prevdup) {
dfp = xfs_dir2_data_freefind(d, prevdup); dfp = xfs_dir2_data_freefind(hdr, prevdup);
be16_add_cpu(&prevdup->length, len); be16_add_cpu(&prevdup->length, len);
*xfs_dir2_data_unused_tag_p(prevdup) = *xfs_dir2_data_unused_tag_p(prevdup) =
cpu_to_be16((char *)prevdup - (char *)d); cpu_to_be16((char *)prevdup - (char *)hdr);
xfs_dir2_data_log_unused(tp, bp, prevdup); xfs_dir2_data_log_unused(tp, bp, prevdup);
/* /*
* If the previous entry was in the table, the new entry * If the previous entry was in the table, the new entry
@ -632,27 +645,27 @@ xfs_dir2_data_make_free(
* the old one and add the new one. * the old one and add the new one.
*/ */
if (dfp) { if (dfp) {
xfs_dir2_data_freeremove(d, dfp, needlogp); xfs_dir2_data_freeremove(hdr, dfp, needlogp);
(void)xfs_dir2_data_freeinsert(d, prevdup, needlogp); xfs_dir2_data_freeinsert(hdr, prevdup, needlogp);
} }
/* /*
* Otherwise we need a scan if the new entry is big enough. * Otherwise we need a scan if the new entry is big enough.
*/ */
else { else {
needscan = be16_to_cpu(prevdup->length) > needscan = be16_to_cpu(prevdup->length) >
be16_to_cpu(d->hdr.bestfree[2].length); be16_to_cpu(hdr->bestfree[2].length);
} }
} }
/* /*
* The following entry is free, merge with it. * The following entry is free, merge with it.
*/ */
else if (postdup) { else if (postdup) {
dfp = xfs_dir2_data_freefind(d, postdup); dfp = xfs_dir2_data_freefind(hdr, postdup);
newdup = (xfs_dir2_data_unused_t *)((char *)d + offset); newdup = (xfs_dir2_data_unused_t *)((char *)hdr + offset);
newdup->freetag = cpu_to_be16(XFS_DIR2_DATA_FREE_TAG); newdup->freetag = cpu_to_be16(XFS_DIR2_DATA_FREE_TAG);
newdup->length = cpu_to_be16(len + be16_to_cpu(postdup->length)); newdup->length = cpu_to_be16(len + be16_to_cpu(postdup->length));
*xfs_dir2_data_unused_tag_p(newdup) = *xfs_dir2_data_unused_tag_p(newdup) =
cpu_to_be16((char *)newdup - (char *)d); cpu_to_be16((char *)newdup - (char *)hdr);
xfs_dir2_data_log_unused(tp, bp, newdup); xfs_dir2_data_log_unused(tp, bp, newdup);
/* /*
* If the following entry was in the table, the new entry * If the following entry was in the table, the new entry
@ -660,28 +673,28 @@ xfs_dir2_data_make_free(
* the old one and add the new one. * the old one and add the new one.
*/ */
if (dfp) { if (dfp) {
xfs_dir2_data_freeremove(d, dfp, needlogp); xfs_dir2_data_freeremove(hdr, dfp, needlogp);
(void)xfs_dir2_data_freeinsert(d, newdup, needlogp); xfs_dir2_data_freeinsert(hdr, newdup, needlogp);
} }
/* /*
* Otherwise we need a scan if the new entry is big enough. * Otherwise we need a scan if the new entry is big enough.
*/ */
else { else {
needscan = be16_to_cpu(newdup->length) > needscan = be16_to_cpu(newdup->length) >
be16_to_cpu(d->hdr.bestfree[2].length); be16_to_cpu(hdr->bestfree[2].length);
} }
} }
/* /*
* Neither neighbor is free. Make a new entry. * Neither neighbor is free. Make a new entry.
*/ */
else { else {
newdup = (xfs_dir2_data_unused_t *)((char *)d + offset); newdup = (xfs_dir2_data_unused_t *)((char *)hdr + offset);
newdup->freetag = cpu_to_be16(XFS_DIR2_DATA_FREE_TAG); newdup->freetag = cpu_to_be16(XFS_DIR2_DATA_FREE_TAG);
newdup->length = cpu_to_be16(len); newdup->length = cpu_to_be16(len);
*xfs_dir2_data_unused_tag_p(newdup) = *xfs_dir2_data_unused_tag_p(newdup) =
cpu_to_be16((char *)newdup - (char *)d); cpu_to_be16((char *)newdup - (char *)hdr);
xfs_dir2_data_log_unused(tp, bp, newdup); xfs_dir2_data_log_unused(tp, bp, newdup);
(void)xfs_dir2_data_freeinsert(d, newdup, needlogp); xfs_dir2_data_freeinsert(hdr, newdup, needlogp);
} }
*needscanp = needscan; *needscanp = needscan;
} }
@ -699,7 +712,7 @@ xfs_dir2_data_use_free(
int *needlogp, /* out: need to log header */ int *needlogp, /* out: need to log header */
int *needscanp) /* out: need regen bestfree */ int *needscanp) /* out: need regen bestfree */
{ {
xfs_dir2_data_t *d; /* data block */ xfs_dir2_data_hdr_t *hdr; /* data block header */
xfs_dir2_data_free_t *dfp; /* bestfree pointer */ xfs_dir2_data_free_t *dfp; /* bestfree pointer */
int matchback; /* matches end of freespace */ int matchback; /* matches end of freespace */
int matchfront; /* matches start of freespace */ int matchfront; /* matches start of freespace */
@ -708,24 +721,24 @@ xfs_dir2_data_use_free(
xfs_dir2_data_unused_t *newdup2; /* another new unused entry */ xfs_dir2_data_unused_t *newdup2; /* another new unused entry */
int oldlen; /* old unused entry's length */ int oldlen; /* old unused entry's length */
d = bp->data; hdr = bp->data;
ASSERT(be32_to_cpu(d->hdr.magic) == XFS_DIR2_DATA_MAGIC || ASSERT(be32_to_cpu(hdr->magic) == XFS_DIR2_DATA_MAGIC ||
be32_to_cpu(d->hdr.magic) == XFS_DIR2_BLOCK_MAGIC); be32_to_cpu(hdr->magic) == XFS_DIR2_BLOCK_MAGIC);
ASSERT(be16_to_cpu(dup->freetag) == XFS_DIR2_DATA_FREE_TAG); ASSERT(be16_to_cpu(dup->freetag) == XFS_DIR2_DATA_FREE_TAG);
ASSERT(offset >= (char *)dup - (char *)d); ASSERT(offset >= (char *)dup - (char *)hdr);
ASSERT(offset + len <= (char *)dup + be16_to_cpu(dup->length) - (char *)d); ASSERT(offset + len <= (char *)dup + be16_to_cpu(dup->length) - (char *)hdr);
ASSERT((char *)dup - (char *)d == be16_to_cpu(*xfs_dir2_data_unused_tag_p(dup))); ASSERT((char *)dup - (char *)hdr == be16_to_cpu(*xfs_dir2_data_unused_tag_p(dup)));
/* /*
* Look up the entry in the bestfree table. * Look up the entry in the bestfree table.
*/ */
dfp = xfs_dir2_data_freefind(d, dup); dfp = xfs_dir2_data_freefind(hdr, dup);
oldlen = be16_to_cpu(dup->length); oldlen = be16_to_cpu(dup->length);
ASSERT(dfp || oldlen <= be16_to_cpu(d->hdr.bestfree[2].length)); ASSERT(dfp || oldlen <= be16_to_cpu(hdr->bestfree[2].length));
/* /*
* Check for alignment with front and back of the entry. * Check for alignment with front and back of the entry.
*/ */
matchfront = (char *)dup - (char *)d == offset; matchfront = (char *)dup - (char *)hdr == offset;
matchback = (char *)dup + oldlen - (char *)d == offset + len; matchback = (char *)dup + oldlen - (char *)hdr == offset + len;
ASSERT(*needscanp == 0); ASSERT(*needscanp == 0);
needscan = 0; needscan = 0;
/* /*
@ -734,9 +747,9 @@ xfs_dir2_data_use_free(
*/ */
if (matchfront && matchback) { if (matchfront && matchback) {
if (dfp) { if (dfp) {
needscan = (d->hdr.bestfree[2].offset != 0); needscan = (hdr->bestfree[2].offset != 0);
if (!needscan) if (!needscan)
xfs_dir2_data_freeremove(d, dfp, needlogp); xfs_dir2_data_freeremove(hdr, dfp, needlogp);
} }
} }
/* /*
@ -744,27 +757,27 @@ xfs_dir2_data_use_free(
* Make a new entry with the remaining freespace. * Make a new entry with the remaining freespace.
*/ */
else if (matchfront) { else if (matchfront) {
newdup = (xfs_dir2_data_unused_t *)((char *)d + offset + len); newdup = (xfs_dir2_data_unused_t *)((char *)hdr + offset + len);
newdup->freetag = cpu_to_be16(XFS_DIR2_DATA_FREE_TAG); newdup->freetag = cpu_to_be16(XFS_DIR2_DATA_FREE_TAG);
newdup->length = cpu_to_be16(oldlen - len); newdup->length = cpu_to_be16(oldlen - len);
*xfs_dir2_data_unused_tag_p(newdup) = *xfs_dir2_data_unused_tag_p(newdup) =
cpu_to_be16((char *)newdup - (char *)d); cpu_to_be16((char *)newdup - (char *)hdr);
xfs_dir2_data_log_unused(tp, bp, newdup); xfs_dir2_data_log_unused(tp, bp, newdup);
/* /*
* If it was in the table, remove it and add the new one. * If it was in the table, remove it and add the new one.
*/ */
if (dfp) { if (dfp) {
xfs_dir2_data_freeremove(d, dfp, needlogp); xfs_dir2_data_freeremove(hdr, dfp, needlogp);
dfp = xfs_dir2_data_freeinsert(d, newdup, needlogp); dfp = xfs_dir2_data_freeinsert(hdr, newdup, needlogp);
ASSERT(dfp != NULL); ASSERT(dfp != NULL);
ASSERT(dfp->length == newdup->length); ASSERT(dfp->length == newdup->length);
ASSERT(be16_to_cpu(dfp->offset) == (char *)newdup - (char *)d); ASSERT(be16_to_cpu(dfp->offset) == (char *)newdup - (char *)hdr);
/* /*
* If we got inserted at the last slot, * If we got inserted at the last slot,
* that means we don't know if there was a better * that means we don't know if there was a better
* choice for the last slot, or not. Rescan. * choice for the last slot, or not. Rescan.
*/ */
needscan = dfp == &d->hdr.bestfree[2]; needscan = dfp == &hdr->bestfree[2];
} }
} }
/* /*
@ -773,25 +786,25 @@ xfs_dir2_data_use_free(
*/ */
else if (matchback) { else if (matchback) {
newdup = dup; newdup = dup;
newdup->length = cpu_to_be16(((char *)d + offset) - (char *)newdup); newdup->length = cpu_to_be16(((char *)hdr + offset) - (char *)newdup);
*xfs_dir2_data_unused_tag_p(newdup) = *xfs_dir2_data_unused_tag_p(newdup) =
cpu_to_be16((char *)newdup - (char *)d); cpu_to_be16((char *)newdup - (char *)hdr);
xfs_dir2_data_log_unused(tp, bp, newdup); xfs_dir2_data_log_unused(tp, bp, newdup);
/* /*
* If it was in the table, remove it and add the new one. * If it was in the table, remove it and add the new one.
*/ */
if (dfp) { if (dfp) {
xfs_dir2_data_freeremove(d, dfp, needlogp); xfs_dir2_data_freeremove(hdr, dfp, needlogp);
dfp = xfs_dir2_data_freeinsert(d, newdup, needlogp); dfp = xfs_dir2_data_freeinsert(hdr, newdup, needlogp);
ASSERT(dfp != NULL); ASSERT(dfp != NULL);
ASSERT(dfp->length == newdup->length); ASSERT(dfp->length == newdup->length);
ASSERT(be16_to_cpu(dfp->offset) == (char *)newdup - (char *)d); ASSERT(be16_to_cpu(dfp->offset) == (char *)newdup - (char *)hdr);
/* /*
* If we got inserted at the last slot, * If we got inserted at the last slot,
* that means we don't know if there was a better * that means we don't know if there was a better
* choice for the last slot, or not. Rescan. * choice for the last slot, or not. Rescan.
*/ */
needscan = dfp == &d->hdr.bestfree[2]; needscan = dfp == &hdr->bestfree[2];
} }
} }
/* /*
@ -800,15 +813,15 @@ xfs_dir2_data_use_free(
*/ */
else { else {
newdup = dup; newdup = dup;
newdup->length = cpu_to_be16(((char *)d + offset) - (char *)newdup); newdup->length = cpu_to_be16(((char *)hdr + offset) - (char *)newdup);
*xfs_dir2_data_unused_tag_p(newdup) = *xfs_dir2_data_unused_tag_p(newdup) =
cpu_to_be16((char *)newdup - (char *)d); cpu_to_be16((char *)newdup - (char *)hdr);
xfs_dir2_data_log_unused(tp, bp, newdup); xfs_dir2_data_log_unused(tp, bp, newdup);
newdup2 = (xfs_dir2_data_unused_t *)((char *)d + offset + len); newdup2 = (xfs_dir2_data_unused_t *)((char *)hdr + offset + len);
newdup2->freetag = cpu_to_be16(XFS_DIR2_DATA_FREE_TAG); newdup2->freetag = cpu_to_be16(XFS_DIR2_DATA_FREE_TAG);
newdup2->length = cpu_to_be16(oldlen - len - be16_to_cpu(newdup->length)); newdup2->length = cpu_to_be16(oldlen - len - be16_to_cpu(newdup->length));
*xfs_dir2_data_unused_tag_p(newdup2) = *xfs_dir2_data_unused_tag_p(newdup2) =
cpu_to_be16((char *)newdup2 - (char *)d); cpu_to_be16((char *)newdup2 - (char *)hdr);
xfs_dir2_data_log_unused(tp, bp, newdup2); xfs_dir2_data_log_unused(tp, bp, newdup2);
/* /*
* If the old entry was in the table, we need to scan * If the old entry was in the table, we need to scan
@ -819,12 +832,11 @@ xfs_dir2_data_use_free(
* the 2 new will work. * the 2 new will work.
*/ */
if (dfp) { if (dfp) {
needscan = (d->hdr.bestfree[2].length != 0); needscan = (hdr->bestfree[2].length != 0);
if (!needscan) { if (!needscan) {
xfs_dir2_data_freeremove(d, dfp, needlogp); xfs_dir2_data_freeremove(hdr, dfp, needlogp);
(void)xfs_dir2_data_freeinsert(d, newdup, xfs_dir2_data_freeinsert(hdr, newdup, needlogp);
needlogp); xfs_dir2_data_freeinsert(hdr, newdup2,
(void)xfs_dir2_data_freeinsert(d, newdup2,
needlogp); needlogp);
} }
} }

8
fs/xfs/xfs_dir2_data.h
View File

@ -157,12 +157,10 @@ extern void xfs_dir2_data_check(struct xfs_inode *dp, struct xfs_dabuf *bp);
#else #else
#define xfs_dir2_data_check(dp,bp) #define xfs_dir2_data_check(dp,bp)
#endif #endif
extern xfs_dir2_data_free_t *xfs_dir2_data_freefind(xfs_dir2_data_t *d, extern xfs_dir2_data_free_t *xfs_dir2_data_freeinsert(xfs_dir2_data_hdr_t *hdr,
xfs_dir2_data_unused_t *dup);
extern xfs_dir2_data_free_t *xfs_dir2_data_freeinsert(xfs_dir2_data_t *d,
xfs_dir2_data_unused_t *dup, int *loghead); xfs_dir2_data_unused_t *dup, int *loghead);
extern void xfs_dir2_data_freescan(struct xfs_mount *mp, xfs_dir2_data_t *d, extern void xfs_dir2_data_freescan(struct xfs_mount *mp,
int *loghead); xfs_dir2_data_hdr_t *hdr, int *loghead);
extern int xfs_dir2_data_init(struct xfs_da_args *args, xfs_dir2_db_t blkno, extern int xfs_dir2_data_init(struct xfs_da_args *args, xfs_dir2_db_t blkno,
struct xfs_dabuf **bpp); struct xfs_dabuf **bpp);
extern void xfs_dir2_data_log_entry(struct xfs_trans *tp, struct xfs_dabuf *bp, extern void xfs_dir2_data_log_entry(struct xfs_trans *tp, struct xfs_dabuf *bp,

76
fs/xfs/xfs_dir2_leaf.c
View File

@ -132,7 +132,7 @@ xfs_dir2_block_to_leaf(
*/ */
hdr->magic = cpu_to_be32(XFS_DIR2_DATA_MAGIC); hdr->magic = cpu_to_be32(XFS_DIR2_DATA_MAGIC);
if (needscan) if (needscan)
xfs_dir2_data_freescan(mp, (xfs_dir2_data_t *)hdr, &needlog); xfs_dir2_data_freescan(mp, hdr, &needlog);
/* /*
* Set up leaf tail and bests table. * Set up leaf tail and bests table.
*/ */
@ -278,7 +278,7 @@ xfs_dir2_leaf_addname(
{ {
__be16 *bestsp; /* freespace table in leaf */ __be16 *bestsp; /* freespace table in leaf */
int compact; /* need to compact leaves */ int compact; /* need to compact leaves */
xfs_dir2_data_t *data; /* data block structure */ xfs_dir2_data_hdr_t *hdr; /* data block header */
xfs_dabuf_t *dbp; /* data block buffer */ xfs_dabuf_t *dbp; /* data block buffer */
xfs_dir2_data_entry_t *dep; /* data block entry */ xfs_dir2_data_entry_t *dep; /* data block entry */
xfs_inode_t *dp; /* incore directory inode */ xfs_inode_t *dp; /* incore directory inode */
@ -486,8 +486,8 @@ xfs_dir2_leaf_addname(
*/ */
else else
xfs_dir2_leaf_log_bests(tp, lbp, use_block, use_block); xfs_dir2_leaf_log_bests(tp, lbp, use_block, use_block);
data = dbp->data; hdr = dbp->data;
bestsp[use_block] = data->hdr.bestfree[0].length; bestsp[use_block] = hdr->bestfree[0].length;
grown = 1; grown = 1;
} }
/* /*
@ -501,7 +501,7 @@ xfs_dir2_leaf_addname(
xfs_da_brelse(tp, lbp); xfs_da_brelse(tp, lbp);
return error; return error;
} }
data = dbp->data; hdr = dbp->data;
grown = 0; grown = 0;
} }
xfs_dir2_data_check(dp, dbp); xfs_dir2_data_check(dp, dbp);
@ -509,14 +509,14 @@ xfs_dir2_leaf_addname(
* Point to the biggest freespace in our data block. * Point to the biggest freespace in our data block.
*/ */
dup = (xfs_dir2_data_unused_t *) dup = (xfs_dir2_data_unused_t *)
((char *)data + be16_to_cpu(data->hdr.bestfree[0].offset)); ((char *)hdr + be16_to_cpu(hdr->bestfree[0].offset));
ASSERT(be16_to_cpu(dup->length) >= length); ASSERT(be16_to_cpu(dup->length) >= length);
needscan = needlog = 0; needscan = needlog = 0;
/* /*
* Mark the initial part of our freespace in use for the new entry. * Mark the initial part of our freespace in use for the new entry.
*/ */
xfs_dir2_data_use_free(tp, dbp, dup, xfs_dir2_data_use_free(tp, dbp, dup,
(xfs_dir2_data_aoff_t)((char *)dup - (char *)data), length, (xfs_dir2_data_aoff_t)((char *)dup - (char *)hdr), length,
&needlog, &needscan); &needlog, &needscan);
/* /*
* Initialize our new entry (at last). * Initialize our new entry (at last).
@ -526,12 +526,12 @@ xfs_dir2_leaf_addname(
dep->namelen = args->namelen; dep->namelen = args->namelen;
memcpy(dep->name, args->name, dep->namelen); memcpy(dep->name, args->name, dep->namelen);
tagp = xfs_dir2_data_entry_tag_p(dep); tagp = xfs_dir2_data_entry_tag_p(dep);
*tagp = cpu_to_be16((char *)dep - (char *)data); *tagp = cpu_to_be16((char *)dep - (char *)hdr);
/* /*
* Need to scan fix up the bestfree table. * Need to scan fix up the bestfree table.
*/ */
if (needscan) if (needscan)
xfs_dir2_data_freescan(mp, data, &needlog); xfs_dir2_data_freescan(mp, hdr, &needlog);
/* /*
* Need to log the data block's header. * Need to log the data block's header.
*/ */
@ -542,8 +542,8 @@ xfs_dir2_leaf_addname(
* If the bests table needs to be changed, do it. * If the bests table needs to be changed, do it.
* Log the change unless we've already done that. * Log the change unless we've already done that.
*/ */
if (be16_to_cpu(bestsp[use_block]) != be16_to_cpu(data->hdr.bestfree[0].length)) { if (be16_to_cpu(bestsp[use_block]) != be16_to_cpu(hdr->bestfree[0].length)) {
bestsp[use_block] = data->hdr.bestfree[0].length; bestsp[use_block] = hdr->bestfree[0].length;
if (!grown) if (!grown)
xfs_dir2_leaf_log_bests(tp, lbp, use_block, use_block); xfs_dir2_leaf_log_bests(tp, lbp, use_block, use_block);
} }
@ -786,6 +786,7 @@ xfs_dir2_leaf_getdents(
xfs_dir2_db_t curdb; /* db for current block */ xfs_dir2_db_t curdb; /* db for current block */
xfs_dir2_off_t curoff; /* current overall offset */ xfs_dir2_off_t curoff; /* current overall offset */
xfs_dir2_data_t *data; /* data block structure */ xfs_dir2_data_t *data; /* data block structure */
xfs_dir2_data_hdr_t *hdr; /* data block header */
xfs_dir2_data_entry_t *dep; /* data entry */ xfs_dir2_data_entry_t *dep; /* data entry */
xfs_dir2_data_unused_t *dup; /* unused entry */ xfs_dir2_data_unused_t *dup; /* unused entry */
int error = 0; /* error return value */ int error = 0; /* error return value */
@ -1044,6 +1045,7 @@ xfs_dir2_leaf_getdents(
ASSERT(xfs_dir2_byte_to_db(mp, curoff) == ASSERT(xfs_dir2_byte_to_db(mp, curoff) ==
curdb); curdb);
data = bp->data; data = bp->data;
hdr = &data->hdr;
xfs_dir2_data_check(dp, bp); xfs_dir2_data_check(dp, bp);
/* /*
* Find our position in the block. * Find our position in the block.
@ -1054,12 +1056,12 @@ xfs_dir2_leaf_getdents(
* Skip past the header. * Skip past the header.
*/ */
if (byteoff == 0) if (byteoff == 0)
curoff += (uint)sizeof(data->hdr); curoff += (uint)sizeof(*hdr);
/* /*
* Skip past entries until we reach our offset. * Skip past entries until we reach our offset.
*/ */
else { else {
while ((char *)ptr - (char *)data < byteoff) { while ((char *)ptr - (char *)hdr < byteoff) {
dup = (xfs_dir2_data_unused_t *)ptr; dup = (xfs_dir2_data_unused_t *)ptr;
if (be16_to_cpu(dup->freetag) if (be16_to_cpu(dup->freetag)
@ -1080,8 +1082,8 @@ xfs_dir2_leaf_getdents(
curoff = curoff =
xfs_dir2_db_off_to_byte(mp, xfs_dir2_db_off_to_byte(mp,
xfs_dir2_byte_to_db(mp, curoff), xfs_dir2_byte_to_db(mp, curoff),
(char *)ptr - (char *)data); (char *)ptr - (char *)hdr);
if (ptr >= (char *)data + mp->m_dirblksize) { if (ptr >= (char *)hdr + mp->m_dirblksize) {
continue; continue;
} }
} }
@ -1462,7 +1464,7 @@ xfs_dir2_leaf_removename(
xfs_da_args_t *args) /* operation arguments */ xfs_da_args_t *args) /* operation arguments */
{ {
__be16 *bestsp; /* leaf block best freespace */ __be16 *bestsp; /* leaf block best freespace */
xfs_dir2_data_t *data; /* data block structure */ xfs_dir2_data_hdr_t *hdr; /* data block header */
xfs_dir2_db_t db; /* data block number */ xfs_dir2_db_t db; /* data block number */
xfs_dabuf_t *dbp; /* data block buffer */ xfs_dabuf_t *dbp; /* data block buffer */
xfs_dir2_data_entry_t *dep; /* data entry structure */ xfs_dir2_data_entry_t *dep; /* data entry structure */
@ -1492,7 +1494,7 @@ xfs_dir2_leaf_removename(
tp = args->trans; tp = args->trans;
mp = dp->i_mount; mp = dp->i_mount;
leaf = lbp->data; leaf = lbp->data;
data = dbp->data; hdr = dbp->data;
xfs_dir2_data_check(dp, dbp); xfs_dir2_data_check(dp, dbp);
/* /*
* Point to the leaf entry, use that to point to the data entry. * Point to the leaf entry, use that to point to the data entry.
@ -1500,9 +1502,9 @@ xfs_dir2_leaf_removename(
lep = &leaf->ents[index]; lep = &leaf->ents[index];
db = xfs_dir2_dataptr_to_db(mp, be32_to_cpu(lep->address)); db = xfs_dir2_dataptr_to_db(mp, be32_to_cpu(lep->address));
dep = (xfs_dir2_data_entry_t *) dep = (xfs_dir2_data_entry_t *)
((char *)data + xfs_dir2_dataptr_to_off(mp, be32_to_cpu(lep->address))); ((char *)hdr + xfs_dir2_dataptr_to_off(mp, be32_to_cpu(lep->address)));
needscan = needlog = 0; needscan = needlog = 0;
oldbest = be16_to_cpu(data->hdr.bestfree[0].length); oldbest = be16_to_cpu(hdr->bestfree[0].length);
ltp = xfs_dir2_leaf_tail_p(mp, leaf); ltp = xfs_dir2_leaf_tail_p(mp, leaf);
bestsp = xfs_dir2_leaf_bests_p(ltp); bestsp = xfs_dir2_leaf_bests_p(ltp);
ASSERT(be16_to_cpu(bestsp[db]) == oldbest); ASSERT(be16_to_cpu(bestsp[db]) == oldbest);
@ -1510,7 +1512,7 @@ xfs_dir2_leaf_removename(
* Mark the former data entry unused. * Mark the former data entry unused.
*/ */
xfs_dir2_data_make_free(tp, dbp, xfs_dir2_data_make_free(tp, dbp,
(xfs_dir2_data_aoff_t)((char *)dep - (char *)data), (xfs_dir2_data_aoff_t)((char *)dep - (char *)hdr),
xfs_dir2_data_entsize(dep->namelen), &needlog, &needscan); xfs_dir2_data_entsize(dep->namelen), &needlog, &needscan);
/* /*
* We just mark the leaf entry stale by putting a null in it. * We just mark the leaf entry stale by putting a null in it.
@ -1524,23 +1526,23 @@ xfs_dir2_leaf_removename(
* log the data block header if necessary. * log the data block header if necessary.
*/ */
if (needscan) if (needscan)
xfs_dir2_data_freescan(mp, data, &needlog); xfs_dir2_data_freescan(mp, hdr, &needlog);
if (needlog) if (needlog)
xfs_dir2_data_log_header(tp, dbp); xfs_dir2_data_log_header(tp, dbp);
/* /*
* If the longest freespace in the data block has changed, * If the longest freespace in the data block has changed,
* put the new value in the bests table and log that. * put the new value in the bests table and log that.
*/ */
if (be16_to_cpu(data->hdr.bestfree[0].length) != oldbest) { if (be16_to_cpu(hdr->bestfree[0].length) != oldbest) {
bestsp[db] = data->hdr.bestfree[0].length; bestsp[db] = hdr->bestfree[0].length;
xfs_dir2_leaf_log_bests(tp, lbp, db, db); xfs_dir2_leaf_log_bests(tp, lbp, db, db);
} }
xfs_dir2_data_check(dp, dbp); xfs_dir2_data_check(dp, dbp);
/* /*
* If the data block is now empty then get rid of the data block. * If the data block is now empty then get rid of the data block.
*/ */
if (be16_to_cpu(data->hdr.bestfree[0].length) == if (be16_to_cpu(hdr->bestfree[0].length) ==
mp->m_dirblksize - (uint)sizeof(data->hdr)) { mp->m_dirblksize - (uint)sizeof(*hdr)) {
ASSERT(db != mp->m_dirdatablk); ASSERT(db != mp->m_dirdatablk);
if ((error = xfs_dir2_shrink_inode(args, db, dbp))) { if ((error = xfs_dir2_shrink_inode(args, db, dbp))) {
/* /*
@ -1711,9 +1713,6 @@ xfs_dir2_leaf_trim_data(
xfs_dir2_db_t db) /* data block number */ xfs_dir2_db_t db) /* data block number */
{ {
__be16 *bestsp; /* leaf bests table */ __be16 *bestsp; /* leaf bests table */
#ifdef DEBUG
xfs_dir2_data_t *data; /* data block structure */
#endif
xfs_dabuf_t *dbp; /* data block buffer */ xfs_dabuf_t *dbp; /* data block buffer */
xfs_inode_t *dp; /* incore directory inode */ xfs_inode_t *dp; /* incore directory inode */
int error; /* error return value */ int error; /* error return value */
@ -1732,20 +1731,21 @@ xfs_dir2_leaf_trim_data(
XFS_DATA_FORK))) { XFS_DATA_FORK))) {
return error; return error;
} }
#ifdef DEBUG
data = dbp->data;
ASSERT(be32_to_cpu(data->hdr.magic) == XFS_DIR2_DATA_MAGIC);
#endif
/* this seems to be an error
* data is only valid if DEBUG is defined?
* RMC 09/08/1999
*/
leaf = lbp->data; leaf = lbp->data;
ltp = xfs_dir2_leaf_tail_p(mp, leaf); ltp = xfs_dir2_leaf_tail_p(mp, leaf);
ASSERT(be16_to_cpu(data->hdr.bestfree[0].length) ==
mp->m_dirblksize - (uint)sizeof(data->hdr)); #ifdef DEBUG
{
struct xfs_dir2_data_hdr *hdr = dbp->data;
ASSERT(be32_to_cpu(hdr->magic) == XFS_DIR2_DATA_MAGIC);
ASSERT(be16_to_cpu(hdr->bestfree[0].length) ==
mp->m_dirblksize - (uint)sizeof(*hdr));
ASSERT(db == be32_to_cpu(ltp->bestcount) - 1); ASSERT(db == be32_to_cpu(ltp->bestcount) - 1);
}
#endif
/* /*
* Get rid of the data block. * Get rid of the data block.
*/ */

50
fs/xfs/xfs_dir2_node.c
View File

@ -842,7 +842,7 @@ xfs_dir2_leafn_remove(
xfs_da_state_blk_t *dblk, /* data block */ xfs_da_state_blk_t *dblk, /* data block */
int *rval) /* resulting block needs join */ int *rval) /* resulting block needs join */
{ {
xfs_dir2_data_t *data; /* data block structure */ xfs_dir2_data_hdr_t *hdr; /* data block header */
xfs_dir2_db_t db; /* data block number */ xfs_dir2_db_t db; /* data block number */
xfs_dabuf_t *dbp; /* data block buffer */ xfs_dabuf_t *dbp; /* data block buffer */
xfs_dir2_data_entry_t *dep; /* data block entry */ xfs_dir2_data_entry_t *dep; /* data block entry */
@ -887,9 +887,9 @@ xfs_dir2_leafn_remove(
* in the data block in case it changes. * in the data block in case it changes.
*/ */
dbp = dblk->bp; dbp = dblk->bp;
data = dbp->data; hdr = dbp->data;
dep = (xfs_dir2_data_entry_t *)((char *)data + off); dep = (xfs_dir2_data_entry_t *)((char *)hdr + off);
longest = be16_to_cpu(data->hdr.bestfree[0].length); longest = be16_to_cpu(hdr->bestfree[0].length);
needlog = needscan = 0; needlog = needscan = 0;
xfs_dir2_data_make_free(tp, dbp, off, xfs_dir2_data_make_free(tp, dbp, off,
xfs_dir2_data_entsize(dep->namelen), &needlog, &needscan); xfs_dir2_data_entsize(dep->namelen), &needlog, &needscan);
@ -898,7 +898,7 @@ xfs_dir2_leafn_remove(
* Log the data block header if needed. * Log the data block header if needed.
*/ */
if (needscan) if (needscan)
xfs_dir2_data_freescan(mp, data, &needlog); xfs_dir2_data_freescan(mp, hdr, &needlog);
if (needlog) if (needlog)
xfs_dir2_data_log_header(tp, dbp); xfs_dir2_data_log_header(tp, dbp);
xfs_dir2_data_check(dp, dbp); xfs_dir2_data_check(dp, dbp);
@ -906,7 +906,7 @@ xfs_dir2_leafn_remove(
* If the longest data block freespace changes, need to update * If the longest data block freespace changes, need to update
* the corresponding freeblock entry. * the corresponding freeblock entry.
*/ */
if (longest < be16_to_cpu(data->hdr.bestfree[0].length)) { if (longest < be16_to_cpu(hdr->bestfree[0].length)) {
int error; /* error return value */ int error; /* error return value */
xfs_dabuf_t *fbp; /* freeblock buffer */ xfs_dabuf_t *fbp; /* freeblock buffer */
xfs_dir2_db_t fdb; /* freeblock block number */ xfs_dir2_db_t fdb; /* freeblock block number */
@ -932,19 +932,19 @@ xfs_dir2_leafn_remove(
* Calculate which entry we need to fix. * Calculate which entry we need to fix.
*/ */
findex = xfs_dir2_db_to_fdindex(mp, db); findex = xfs_dir2_db_to_fdindex(mp, db);
longest = be16_to_cpu(data->hdr.bestfree[0].length); longest = be16_to_cpu(hdr->bestfree[0].length);
/* /*
* If the data block is now empty we can get rid of it * If the data block is now empty we can get rid of it
* (usually). * (usually).
*/ */
if (longest == mp->m_dirblksize - (uint)sizeof(data->hdr)) { if (longest == mp->m_dirblksize - (uint)sizeof(*hdr)) {
/* /*
* Try to punch out the data block. * Try to punch out the data block.
*/ */
error = xfs_dir2_shrink_inode(args, db, dbp); error = xfs_dir2_shrink_inode(args, db, dbp);
if (error == 0) { if (error == 0) {
dblk->bp = NULL; dblk->bp = NULL;
data = NULL; hdr = NULL;
} }
/* /*
* We can get ENOSPC if there's no space reservation. * We can get ENOSPC if there's no space reservation.
@ -960,7 +960,7 @@ xfs_dir2_leafn_remove(
* If we got rid of the data block, we can eliminate that entry * If we got rid of the data block, we can eliminate that entry
* in the free block. * in the free block.
*/ */
if (data == NULL) { if (hdr == NULL) {
/* /*
* One less used entry in the free table. * One less used entry in the free table.
*/ */
@ -1356,7 +1356,7 @@ xfs_dir2_node_addname_int(
xfs_da_args_t *args, /* operation arguments */ xfs_da_args_t *args, /* operation arguments */
xfs_da_state_blk_t *fblk) /* optional freespace block */ xfs_da_state_blk_t *fblk) /* optional freespace block */
{ {
xfs_dir2_data_t *data; /* data block structure */ xfs_dir2_data_hdr_t *hdr; /* data block header */
xfs_dir2_db_t dbno; /* data block number */ xfs_dir2_db_t dbno; /* data block number */
xfs_dabuf_t *dbp; /* data block buffer */ xfs_dabuf_t *dbp; /* data block buffer */
xfs_dir2_data_entry_t *dep; /* data entry pointer */ xfs_dir2_data_entry_t *dep; /* data entry pointer */
@ -1641,8 +1641,8 @@ xfs_dir2_node_addname_int(
* We haven't allocated the data entry yet so this will * We haven't allocated the data entry yet so this will
* change again. * change again.
*/ */
data = dbp->data; hdr = dbp->data;
free->bests[findex] = data->hdr.bestfree[0].length; free->bests[findex] = hdr->bestfree[0].length;
logfree = 1; logfree = 1;
} }
/* /*
@ -1667,21 +1667,21 @@ xfs_dir2_node_addname_int(
xfs_da_buf_done(fbp); xfs_da_buf_done(fbp);
return error; return error;
} }
data = dbp->data; hdr = dbp->data;
logfree = 0; logfree = 0;
} }
ASSERT(be16_to_cpu(data->hdr.bestfree[0].length) >= length); ASSERT(be16_to_cpu(hdr->bestfree[0].length) >= length);
/* /*
* Point to the existing unused space. * Point to the existing unused space.
*/ */
dup = (xfs_dir2_data_unused_t *) dup = (xfs_dir2_data_unused_t *)
((char *)data + be16_to_cpu(data->hdr.bestfree[0].offset)); ((char *)hdr + be16_to_cpu(hdr->bestfree[0].offset));
needscan = needlog = 0; needscan = needlog = 0;
/* /*
* Mark the first part of the unused space, inuse for us. * Mark the first part of the unused space, inuse for us.
*/ */
xfs_dir2_data_use_free(tp, dbp, dup, xfs_dir2_data_use_free(tp, dbp, dup,
(xfs_dir2_data_aoff_t)((char *)dup - (char *)data), length, (xfs_dir2_data_aoff_t)((char *)dup - (char *)hdr), length,
&needlog, &needscan); &needlog, &needscan);
/* /*
* Fill in the new entry and log it. * Fill in the new entry and log it.
@ -1691,13 +1691,13 @@ xfs_dir2_node_addname_int(
dep->namelen = args->namelen; dep->namelen = args->namelen;
memcpy(dep->name, args->name, dep->namelen); memcpy(dep->name, args->name, dep->namelen);
tagp = xfs_dir2_data_entry_tag_p(dep); tagp = xfs_dir2_data_entry_tag_p(dep);
*tagp = cpu_to_be16((char *)dep - (char *)data); *tagp = cpu_to_be16((char *)dep - (char *)hdr);
xfs_dir2_data_log_entry(tp, dbp, dep); xfs_dir2_data_log_entry(tp, dbp, dep);
/* /*
* Rescan the block for bestfree if needed. * Rescan the block for bestfree if needed.
*/ */
if (needscan) if (needscan)
xfs_dir2_data_freescan(mp, data, &needlog); xfs_dir2_data_freescan(mp, hdr, &needlog);
/* /*
* Log the data block header if needed. * Log the data block header if needed.
*/ */
@ -1706,8 +1706,8 @@ xfs_dir2_node_addname_int(
/* /*
* If the freespace entry is now wrong, update it. * If the freespace entry is now wrong, update it.
*/ */
if (be16_to_cpu(free->bests[findex]) != be16_to_cpu(data->hdr.bestfree[0].length)) { if (be16_to_cpu(free->bests[findex]) != be16_to_cpu(hdr->bestfree[0].length)) {
free->bests[findex] = data->hdr.bestfree[0].length; free->bests[findex] = hdr->bestfree[0].length;
logfree = 1; logfree = 1;
} }
/* /*
@ -1857,7 +1857,7 @@ xfs_dir2_node_replace(
xfs_da_args_t *args) /* operation arguments */ xfs_da_args_t *args) /* operation arguments */
{ {
xfs_da_state_blk_t *blk; /* leaf block */ xfs_da_state_blk_t *blk; /* leaf block */
xfs_dir2_data_t *data; /* data block structure */ xfs_dir2_data_hdr_t *hdr; /* data block header */
xfs_dir2_data_entry_t *dep; /* data entry changed */ xfs_dir2_data_entry_t *dep; /* data entry changed */
int error; /* error return value */ int error; /* error return value */
int i; /* btree level */ int i; /* btree level */
@ -1901,10 +1901,10 @@ xfs_dir2_node_replace(
/* /*
* Point to the data entry. * Point to the data entry.
*/ */
data = state->extrablk.bp->data; hdr = state->extrablk.bp->data;
ASSERT(be32_to_cpu(data->hdr.magic) == XFS_DIR2_DATA_MAGIC); ASSERT(be32_to_cpu(hdr->magic) == XFS_DIR2_DATA_MAGIC);
dep = (xfs_dir2_data_entry_t *) dep = (xfs_dir2_data_entry_t *)
((char *)data + ((char *)hdr +
xfs_dir2_dataptr_to_off(state->mp, be32_to_cpu(lep->address))); xfs_dir2_dataptr_to_off(state->mp, be32_to_cpu(lep->address)));
ASSERT(inum != be64_to_cpu(dep->inumber)); ASSERT(inum != be64_to_cpu(dep->inumber));
/* /*