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
20 #include "xfs_types.h"
23 #include "xfs_trans.h"
27 #include "xfs_dmapi.h"
28 #include "xfs_mount.h"
29 #include "xfs_da_btree.h"
30 #include "xfs_bmap_btree.h"
31 #include "xfs_dir_sf.h"
32 #include "xfs_dir2_sf.h"
33 #include "xfs_attr_sf.h"
34 #include "xfs_dinode.h"
35 #include "xfs_inode.h"
36 #include "xfs_dir_leaf.h"
37 #include "xfs_dir2_data.h"
38 #include "xfs_dir2_leaf.h"
39 #include "xfs_dir2_block.h"
40 #include "xfs_error.h"
44 * Check the consistency of the data block.
45 * The input can also be a block-format directory.
46 * Pop an assert if we find anything bad.
50 xfs_inode_t *dp, /* incore inode pointer */
51 xfs_dabuf_t *bp) /* data block's buffer */
53 xfs_dir2_dataptr_t addr; /* addr for leaf lookup */
54 xfs_dir2_data_free_t *bf; /* bestfree table */
55 xfs_dir2_block_tail_t *btp=NULL; /* block tail */
56 int count; /* count of entries found */
57 xfs_dir2_data_t *d; /* data block pointer */
58 xfs_dir2_data_entry_t *dep; /* data entry */
59 xfs_dir2_data_free_t *dfp; /* bestfree entry */
60 xfs_dir2_data_unused_t *dup; /* unused entry */
61 char *endp; /* end of useful data */
62 int freeseen; /* mask of bestfrees seen */
63 xfs_dahash_t hash; /* hash of current name */
64 int i; /* leaf index */
65 int lastfree; /* last entry was unused */
66 xfs_dir2_leaf_entry_t *lep=NULL; /* block leaf entries */
67 xfs_mount_t *mp; /* filesystem mount point */
68 char *p; /* current data position */
69 int stale; /* count of stale leaves */
73 ASSERT(be32_to_cpu(d->hdr.magic) == XFS_DIR2_DATA_MAGIC ||
74 be32_to_cpu(d->hdr.magic) == XFS_DIR2_BLOCK_MAGIC);
77 if (be32_to_cpu(d->hdr.magic) == XFS_DIR2_BLOCK_MAGIC) {
78 btp = XFS_DIR2_BLOCK_TAIL_P(mp, (xfs_dir2_block_t *)d);
79 lep = XFS_DIR2_BLOCK_LEAF_P(btp);
82 endp = (char *)d + mp->m_dirblksize;
83 count = lastfree = freeseen = 0;
85 * Account for zero bestfree entries.
88 ASSERT(!bf[0].offset);
92 ASSERT(!bf[1].offset);
96 ASSERT(!bf[2].offset);
99 ASSERT(be16_to_cpu(bf[0].length) >= be16_to_cpu(bf[1].length));
100 ASSERT(be16_to_cpu(bf[1].length) >= be16_to_cpu(bf[2].length));
102 * Loop over the data/unused entries.
105 dup = (xfs_dir2_data_unused_t *)p;
107 * If it's unused, look for the space in the bestfree table.
108 * If we find it, account for that, else make sure it
109 * doesn't need to be there.
111 if (be16_to_cpu(dup->freetag) == XFS_DIR2_DATA_FREE_TAG) {
112 ASSERT(lastfree == 0);
113 ASSERT(INT_GET(*XFS_DIR2_DATA_UNUSED_TAG_P(dup), ARCH_CONVERT) ==
114 (char *)dup - (char *)d);
115 dfp = xfs_dir2_data_freefind(d, dup);
118 ASSERT((freeseen & (1 << i)) == 0);
121 ASSERT(be16_to_cpu(dup->length) <=
122 be16_to_cpu(bf[2].length));
124 p += be16_to_cpu(dup->length);
129 * It's a real entry. Validate the fields.
130 * If this is a block directory then make sure it's
131 * in the leaf section of the block.
132 * The linear search is crude but this is DEBUG code.
134 dep = (xfs_dir2_data_entry_t *)p;
135 ASSERT(dep->namelen != 0);
136 ASSERT(xfs_dir_ino_validate(mp, INT_GET(dep->inumber, ARCH_CONVERT)) == 0);
137 ASSERT(INT_GET(*XFS_DIR2_DATA_ENTRY_TAG_P(dep), ARCH_CONVERT) ==
138 (char *)dep - (char *)d);
141 if (be32_to_cpu(d->hdr.magic) == XFS_DIR2_BLOCK_MAGIC) {
142 addr = XFS_DIR2_DB_OFF_TO_DATAPTR(mp, mp->m_dirdatablk,
143 (xfs_dir2_data_aoff_t)
144 ((char *)dep - (char *)d));
145 hash = xfs_da_hashname((char *)dep->name, dep->namelen);
146 for (i = 0; i < INT_GET(btp->count, ARCH_CONVERT); i++) {
147 if (INT_GET(lep[i].address, ARCH_CONVERT) == addr &&
148 INT_GET(lep[i].hashval, ARCH_CONVERT) == hash)
151 ASSERT(i < INT_GET(btp->count, ARCH_CONVERT));
153 p += XFS_DIR2_DATA_ENTSIZE(dep->namelen);
156 * Need to have seen all the entries and all the bestfree slots.
158 ASSERT(freeseen == 7);
159 if (be32_to_cpu(d->hdr.magic) == XFS_DIR2_BLOCK_MAGIC) {
160 for (i = stale = 0; i < INT_GET(btp->count, ARCH_CONVERT); i++) {
161 if (INT_GET(lep[i].address, ARCH_CONVERT) == XFS_DIR2_NULL_DATAPTR)
164 ASSERT(INT_GET(lep[i].hashval, ARCH_CONVERT) >= INT_GET(lep[i - 1].hashval, ARCH_CONVERT));
166 ASSERT(count == INT_GET(btp->count, ARCH_CONVERT) - INT_GET(btp->stale, ARCH_CONVERT));
167 ASSERT(stale == INT_GET(btp->stale, ARCH_CONVERT));
173 * Given a data block and an unused entry from that block,
174 * return the bestfree entry if any that corresponds to it.
176 xfs_dir2_data_free_t *
177 xfs_dir2_data_freefind(
178 xfs_dir2_data_t *d, /* data block */
179 xfs_dir2_data_unused_t *dup) /* data unused entry */
181 xfs_dir2_data_free_t *dfp; /* bestfree entry */
182 xfs_dir2_data_aoff_t off; /* offset value needed */
183 #if defined(DEBUG) && defined(__KERNEL__)
184 int matched; /* matched the value */
185 int seenzero; /* saw a 0 bestfree entry */
188 off = (xfs_dir2_data_aoff_t)((char *)dup - (char *)d);
189 #if defined(DEBUG) && defined(__KERNEL__)
191 * Validate some consistency in the bestfree table.
192 * Check order, non-overlapping entries, and if we find the
193 * one we're looking for it has to be exact.
195 ASSERT(be32_to_cpu(d->hdr.magic) == XFS_DIR2_DATA_MAGIC ||
196 be32_to_cpu(d->hdr.magic) == XFS_DIR2_BLOCK_MAGIC);
197 for (dfp = &d->hdr.bestfree[0], seenzero = matched = 0;
198 dfp < &d->hdr.bestfree[XFS_DIR2_DATA_FD_COUNT];
201 ASSERT(!dfp->length);
205 ASSERT(seenzero == 0);
206 if (be16_to_cpu(dfp->offset) == off) {
208 ASSERT(dfp->length == dup->length);
209 } else if (off < be16_to_cpu(dfp->offset))
210 ASSERT(off + be16_to_cpu(dup->length) <= be16_to_cpu(dfp->offset));
212 ASSERT(be16_to_cpu(dfp->offset) + be16_to_cpu(dfp->length) <= off);
213 ASSERT(matched || be16_to_cpu(dfp->length) >= be16_to_cpu(dup->length));
214 if (dfp > &d->hdr.bestfree[0])
215 ASSERT(be16_to_cpu(dfp[-1].length) >= be16_to_cpu(dfp[0].length));
219 * If this is smaller than the smallest bestfree entry,
220 * it can't be there since they're sorted.
222 if (be16_to_cpu(dup->length) <
223 be16_to_cpu(d->hdr.bestfree[XFS_DIR2_DATA_FD_COUNT - 1].length))
226 * Look at the three bestfree entries for our guy.
228 for (dfp = &d->hdr.bestfree[0];
229 dfp < &d->hdr.bestfree[XFS_DIR2_DATA_FD_COUNT];
233 if (be16_to_cpu(dfp->offset) == off)
237 * Didn't find it. This only happens if there are duplicate lengths.
243 * Insert an unused-space entry into the bestfree table.
245 xfs_dir2_data_free_t * /* entry inserted */
246 xfs_dir2_data_freeinsert(
247 xfs_dir2_data_t *d, /* data block pointer */
248 xfs_dir2_data_unused_t *dup, /* unused space */
249 int *loghead) /* log the data header (out) */
251 xfs_dir2_data_free_t *dfp; /* bestfree table pointer */
252 xfs_dir2_data_free_t new; /* new bestfree entry */
255 ASSERT(be32_to_cpu(d->hdr.magic) == XFS_DIR2_DATA_MAGIC ||
256 be32_to_cpu(d->hdr.magic) == XFS_DIR2_BLOCK_MAGIC);
258 dfp = d->hdr.bestfree;
259 new.length = dup->length;
260 new.offset = cpu_to_be16((char *)dup - (char *)d);
262 * Insert at position 0, 1, or 2; or not at all.
264 if (be16_to_cpu(new.length) > be16_to_cpu(dfp[0].length)) {
271 if (be16_to_cpu(new.length) > be16_to_cpu(dfp[1].length)) {
277 if (be16_to_cpu(new.length) > be16_to_cpu(dfp[2].length)) {
286 * Remove a bestfree entry from the table.
289 xfs_dir2_data_freeremove(
290 xfs_dir2_data_t *d, /* data block pointer */
291 xfs_dir2_data_free_t *dfp, /* bestfree entry pointer */
292 int *loghead) /* out: log data header */
295 ASSERT(be32_to_cpu(d->hdr.magic) == XFS_DIR2_DATA_MAGIC ||
296 be32_to_cpu(d->hdr.magic) == XFS_DIR2_BLOCK_MAGIC);
299 * It's the first entry, slide the next 2 up.
301 if (dfp == &d->hdr.bestfree[0]) {
302 d->hdr.bestfree[0] = d->hdr.bestfree[1];
303 d->hdr.bestfree[1] = d->hdr.bestfree[2];
306 * It's the second entry, slide the 3rd entry up.
308 else if (dfp == &d->hdr.bestfree[1])
309 d->hdr.bestfree[1] = d->hdr.bestfree[2];
311 * Must be the last entry.
314 ASSERT(dfp == &d->hdr.bestfree[2]);
316 * Clear the 3rd entry, must be zero now.
318 d->hdr.bestfree[2].length = 0;
319 d->hdr.bestfree[2].offset = 0;
324 * Given a data block, reconstruct its bestfree map.
327 xfs_dir2_data_freescan(
328 xfs_mount_t *mp, /* filesystem mount point */
329 xfs_dir2_data_t *d, /* data block pointer */
330 int *loghead, /* out: log data header */
331 char *aendp) /* in: caller's endp */
333 xfs_dir2_block_tail_t *btp; /* block tail */
334 xfs_dir2_data_entry_t *dep; /* active data entry */
335 xfs_dir2_data_unused_t *dup; /* unused data entry */
336 char *endp; /* end of block's data */
337 char *p; /* current entry pointer */
340 ASSERT(be32_to_cpu(d->hdr.magic) == XFS_DIR2_DATA_MAGIC ||
341 be32_to_cpu(d->hdr.magic) == XFS_DIR2_BLOCK_MAGIC);
344 * Start by clearing the table.
346 memset(d->hdr.bestfree, 0, sizeof(d->hdr.bestfree));
354 else if (be32_to_cpu(d->hdr.magic) == XFS_DIR2_BLOCK_MAGIC) {
355 btp = XFS_DIR2_BLOCK_TAIL_P(mp, (xfs_dir2_block_t *)d);
356 endp = (char *)XFS_DIR2_BLOCK_LEAF_P(btp);
358 endp = (char *)d + mp->m_dirblksize;
360 * Loop over the block's entries.
363 dup = (xfs_dir2_data_unused_t *)p;
365 * If it's a free entry, insert it.
367 if (be16_to_cpu(dup->freetag) == XFS_DIR2_DATA_FREE_TAG) {
368 ASSERT((char *)dup - (char *)d ==
369 INT_GET(*XFS_DIR2_DATA_UNUSED_TAG_P(dup), ARCH_CONVERT));
370 xfs_dir2_data_freeinsert(d, dup, loghead);
371 p += be16_to_cpu(dup->length);
374 * For active entries, check their tags and skip them.
377 dep = (xfs_dir2_data_entry_t *)p;
378 ASSERT((char *)dep - (char *)d ==
379 INT_GET(*XFS_DIR2_DATA_ENTRY_TAG_P(dep), ARCH_CONVERT));
380 p += XFS_DIR2_DATA_ENTSIZE(dep->namelen);
386 * Initialize a data block at the given block number in the directory.
387 * Give back the buffer for the created block.
391 xfs_da_args_t *args, /* directory operation args */
392 xfs_dir2_db_t blkno, /* logical dir block number */
393 xfs_dabuf_t **bpp) /* output block buffer */
395 xfs_dabuf_t *bp; /* block buffer */
396 xfs_dir2_data_t *d; /* pointer to block */
397 xfs_inode_t *dp; /* incore directory inode */
398 xfs_dir2_data_unused_t *dup; /* unused entry pointer */
399 int error; /* error return value */
400 int i; /* bestfree index */
401 xfs_mount_t *mp; /* filesystem mount point */
402 xfs_trans_t *tp; /* transaction pointer */
409 * Get the buffer set up for the block.
411 error = xfs_da_get_buf(tp, dp, XFS_DIR2_DB_TO_DA(mp, blkno), -1, &bp,
418 * Initialize the header.
421 d->hdr.magic = cpu_to_be32(XFS_DIR2_DATA_MAGIC);
422 d->hdr.bestfree[0].offset = cpu_to_be16(sizeof(d->hdr));
423 for (i = 1; i < XFS_DIR2_DATA_FD_COUNT; i++) {
424 d->hdr.bestfree[i].length = 0;
425 d->hdr.bestfree[i].offset = 0;
428 * Set up an unused entry for the block's body.
430 dup = &d->u[0].unused;
431 dup->freetag = cpu_to_be16(XFS_DIR2_DATA_FREE_TAG);
433 t=mp->m_dirblksize - (uint)sizeof(d->hdr);
434 d->hdr.bestfree[0].length = cpu_to_be16(t);
435 dup->length = cpu_to_be16(t);
436 INT_SET(*XFS_DIR2_DATA_UNUSED_TAG_P(dup), ARCH_CONVERT,
437 (xfs_dir2_data_off_t)((char *)dup - (char *)d));
439 * Log it and return it.
441 xfs_dir2_data_log_header(tp, bp);
442 xfs_dir2_data_log_unused(tp, bp, dup);
448 * Log an active data entry from the block.
451 xfs_dir2_data_log_entry(
452 xfs_trans_t *tp, /* transaction pointer */
453 xfs_dabuf_t *bp, /* block buffer */
454 xfs_dir2_data_entry_t *dep) /* data entry pointer */
456 xfs_dir2_data_t *d; /* data block pointer */
459 ASSERT(be32_to_cpu(d->hdr.magic) == XFS_DIR2_DATA_MAGIC ||
460 be32_to_cpu(d->hdr.magic) == XFS_DIR2_BLOCK_MAGIC);
461 xfs_da_log_buf(tp, bp, (uint)((char *)dep - (char *)d),
462 (uint)((char *)(XFS_DIR2_DATA_ENTRY_TAG_P(dep) + 1) -
467 * Log a data block header.
470 xfs_dir2_data_log_header(
471 xfs_trans_t *tp, /* transaction pointer */
472 xfs_dabuf_t *bp) /* block buffer */
474 xfs_dir2_data_t *d; /* data block pointer */
477 ASSERT(be32_to_cpu(d->hdr.magic) == XFS_DIR2_DATA_MAGIC ||
478 be32_to_cpu(d->hdr.magic) == XFS_DIR2_BLOCK_MAGIC);
479 xfs_da_log_buf(tp, bp, (uint)((char *)&d->hdr - (char *)d),
480 (uint)(sizeof(d->hdr) - 1));
484 * Log a data unused entry.
487 xfs_dir2_data_log_unused(
488 xfs_trans_t *tp, /* transaction pointer */
489 xfs_dabuf_t *bp, /* block buffer */
490 xfs_dir2_data_unused_t *dup) /* data unused pointer */
492 xfs_dir2_data_t *d; /* data block pointer */
495 ASSERT(be32_to_cpu(d->hdr.magic) == XFS_DIR2_DATA_MAGIC ||
496 be32_to_cpu(d->hdr.magic) == XFS_DIR2_BLOCK_MAGIC);
498 * Log the first part of the unused entry.
500 xfs_da_log_buf(tp, bp, (uint)((char *)dup - (char *)d),
501 (uint)((char *)&dup->length + sizeof(dup->length) -
504 * Log the end (tag) of the unused entry.
506 xfs_da_log_buf(tp, bp,
507 (uint)((char *)XFS_DIR2_DATA_UNUSED_TAG_P(dup) - (char *)d),
508 (uint)((char *)XFS_DIR2_DATA_UNUSED_TAG_P(dup) - (char *)d +
509 sizeof(xfs_dir2_data_off_t) - 1));
513 * Make a byte range in the data block unused.
514 * Its current contents are unimportant.
517 xfs_dir2_data_make_free(
518 xfs_trans_t *tp, /* transaction pointer */
519 xfs_dabuf_t *bp, /* block buffer */
520 xfs_dir2_data_aoff_t offset, /* starting byte offset */
521 xfs_dir2_data_aoff_t len, /* length in bytes */
522 int *needlogp, /* out: log header */
523 int *needscanp) /* out: regen bestfree */
525 xfs_dir2_data_t *d; /* data block pointer */
526 xfs_dir2_data_free_t *dfp; /* bestfree pointer */
527 char *endptr; /* end of data area */
528 xfs_mount_t *mp; /* filesystem mount point */
529 int needscan; /* need to regen bestfree */
530 xfs_dir2_data_unused_t *newdup; /* new unused entry */
531 xfs_dir2_data_unused_t *postdup; /* unused entry after us */
532 xfs_dir2_data_unused_t *prevdup; /* unused entry before us */
537 * Figure out where the end of the data area is.
539 if (be32_to_cpu(d->hdr.magic) == XFS_DIR2_DATA_MAGIC)
540 endptr = (char *)d + mp->m_dirblksize;
542 xfs_dir2_block_tail_t *btp; /* block tail */
544 ASSERT(be32_to_cpu(d->hdr.magic) == XFS_DIR2_BLOCK_MAGIC);
545 btp = XFS_DIR2_BLOCK_TAIL_P(mp, (xfs_dir2_block_t *)d);
546 endptr = (char *)XFS_DIR2_BLOCK_LEAF_P(btp);
549 * If this isn't the start of the block, then back up to
550 * the previous entry and see if it's free.
552 if (offset > sizeof(d->hdr)) {
553 xfs_dir2_data_off_t *tagp; /* tag just before us */
555 tagp = (xfs_dir2_data_off_t *)((char *)d + offset) - 1;
556 prevdup = (xfs_dir2_data_unused_t *)((char *)d + INT_GET(*tagp, ARCH_CONVERT));
557 if (be16_to_cpu(prevdup->freetag) != XFS_DIR2_DATA_FREE_TAG)
562 * If this isn't the end of the block, see if the entry after
565 if ((char *)d + offset + len < endptr) {
567 (xfs_dir2_data_unused_t *)((char *)d + offset + len);
568 if (be16_to_cpu(postdup->freetag) != XFS_DIR2_DATA_FREE_TAG)
572 ASSERT(*needscanp == 0);
575 * Previous and following entries are both free,
576 * merge everything into a single free entry.
578 if (prevdup && postdup) {
579 xfs_dir2_data_free_t *dfp2; /* another bestfree pointer */
582 * See if prevdup and/or postdup are in bestfree table.
584 dfp = xfs_dir2_data_freefind(d, prevdup);
585 dfp2 = xfs_dir2_data_freefind(d, postdup);
587 * We need a rescan unless there are exactly 2 free entries
588 * namely our two. Then we know what's happening, otherwise
589 * since the third bestfree is there, there might be more
592 needscan = (d->hdr.bestfree[2].length != 0);
594 * Fix up the new big freespace.
596 be16_add(&prevdup->length, len + be16_to_cpu(postdup->length));
597 INT_SET(*XFS_DIR2_DATA_UNUSED_TAG_P(prevdup), ARCH_CONVERT,
598 (xfs_dir2_data_off_t)((char *)prevdup - (char *)d));
599 xfs_dir2_data_log_unused(tp, bp, prevdup);
602 * Has to be the case that entries 0 and 1 are
603 * dfp and dfp2 (don't know which is which), and
605 * Remove entry 1 first then entry 0.
608 if (dfp == &d->hdr.bestfree[1]) {
609 dfp = &d->hdr.bestfree[0];
611 dfp2 = &d->hdr.bestfree[1];
613 xfs_dir2_data_freeremove(d, dfp2, needlogp);
614 xfs_dir2_data_freeremove(d, dfp, needlogp);
616 * Now insert the new entry.
618 dfp = xfs_dir2_data_freeinsert(d, prevdup, needlogp);
619 ASSERT(dfp == &d->hdr.bestfree[0]);
620 ASSERT(dfp->length == prevdup->length);
621 ASSERT(!dfp[1].length);
622 ASSERT(!dfp[2].length);
626 * The entry before us is free, merge with it.
629 dfp = xfs_dir2_data_freefind(d, prevdup);
630 be16_add(&prevdup->length, len);
631 INT_SET(*XFS_DIR2_DATA_UNUSED_TAG_P(prevdup), ARCH_CONVERT,
632 (xfs_dir2_data_off_t)((char *)prevdup - (char *)d));
633 xfs_dir2_data_log_unused(tp, bp, prevdup);
635 * If the previous entry was in the table, the new entry
636 * is longer, so it will be in the table too. Remove
637 * the old one and add the new one.
640 xfs_dir2_data_freeremove(d, dfp, needlogp);
641 (void)xfs_dir2_data_freeinsert(d, prevdup, needlogp);
644 * Otherwise we need a scan if the new entry is big enough.
647 needscan = be16_to_cpu(prevdup->length) >
648 be16_to_cpu(d->hdr.bestfree[2].length);
652 * The following entry is free, merge with it.
655 dfp = xfs_dir2_data_freefind(d, postdup);
656 newdup = (xfs_dir2_data_unused_t *)((char *)d + offset);
657 newdup->freetag = cpu_to_be16(XFS_DIR2_DATA_FREE_TAG);
658 newdup->length = cpu_to_be16(len + be16_to_cpu(postdup->length));
659 INT_SET(*XFS_DIR2_DATA_UNUSED_TAG_P(newdup), ARCH_CONVERT,
660 (xfs_dir2_data_off_t)((char *)newdup - (char *)d));
661 xfs_dir2_data_log_unused(tp, bp, newdup);
663 * If the following entry was in the table, the new entry
664 * is longer, so it will be in the table too. Remove
665 * the old one and add the new one.
668 xfs_dir2_data_freeremove(d, dfp, needlogp);
669 (void)xfs_dir2_data_freeinsert(d, newdup, needlogp);
672 * Otherwise we need a scan if the new entry is big enough.
675 needscan = be16_to_cpu(newdup->length) >
676 be16_to_cpu(d->hdr.bestfree[2].length);
680 * Neither neighbor is free. Make a new entry.
683 newdup = (xfs_dir2_data_unused_t *)((char *)d + offset);
684 newdup->freetag = cpu_to_be16(XFS_DIR2_DATA_FREE_TAG);
685 newdup->length = cpu_to_be16(len);
686 INT_SET(*XFS_DIR2_DATA_UNUSED_TAG_P(newdup), ARCH_CONVERT,
687 (xfs_dir2_data_off_t)((char *)newdup - (char *)d));
688 xfs_dir2_data_log_unused(tp, bp, newdup);
689 (void)xfs_dir2_data_freeinsert(d, newdup, needlogp);
691 *needscanp = needscan;
695 * Take a byte range out of an existing unused space and make it un-free.
698 xfs_dir2_data_use_free(
699 xfs_trans_t *tp, /* transaction pointer */
700 xfs_dabuf_t *bp, /* data block buffer */
701 xfs_dir2_data_unused_t *dup, /* unused entry */
702 xfs_dir2_data_aoff_t offset, /* starting offset to use */
703 xfs_dir2_data_aoff_t len, /* length to use */
704 int *needlogp, /* out: need to log header */
705 int *needscanp) /* out: need regen bestfree */
707 xfs_dir2_data_t *d; /* data block */
708 xfs_dir2_data_free_t *dfp; /* bestfree pointer */
709 int matchback; /* matches end of freespace */
710 int matchfront; /* matches start of freespace */
711 int needscan; /* need to regen bestfree */
712 xfs_dir2_data_unused_t *newdup; /* new unused entry */
713 xfs_dir2_data_unused_t *newdup2; /* another new unused entry */
714 int oldlen; /* old unused entry's length */
717 ASSERT(be32_to_cpu(d->hdr.magic) == XFS_DIR2_DATA_MAGIC ||
718 be32_to_cpu(d->hdr.magic) == XFS_DIR2_BLOCK_MAGIC);
719 ASSERT(be16_to_cpu(dup->freetag) == XFS_DIR2_DATA_FREE_TAG);
720 ASSERT(offset >= (char *)dup - (char *)d);
721 ASSERT(offset + len <= (char *)dup + be16_to_cpu(dup->length) - (char *)d);
722 ASSERT((char *)dup - (char *)d == INT_GET(*XFS_DIR2_DATA_UNUSED_TAG_P(dup), ARCH_CONVERT));
724 * Look up the entry in the bestfree table.
726 dfp = xfs_dir2_data_freefind(d, dup);
727 oldlen = be16_to_cpu(dup->length);
728 ASSERT(dfp || oldlen <= be16_to_cpu(d->hdr.bestfree[2].length));
730 * Check for alignment with front and back of the entry.
732 matchfront = (char *)dup - (char *)d == offset;
733 matchback = (char *)dup + oldlen - (char *)d == offset + len;
734 ASSERT(*needscanp == 0);
737 * If we matched it exactly we just need to get rid of it from
738 * the bestfree table.
740 if (matchfront && matchback) {
742 needscan = (d->hdr.bestfree[2].offset != 0);
744 xfs_dir2_data_freeremove(d, dfp, needlogp);
748 * We match the first part of the entry.
749 * Make a new entry with the remaining freespace.
751 else if (matchfront) {
752 newdup = (xfs_dir2_data_unused_t *)((char *)d + offset + len);
753 newdup->freetag = cpu_to_be16(XFS_DIR2_DATA_FREE_TAG);
754 newdup->length = cpu_to_be16(oldlen - len);
755 INT_SET(*XFS_DIR2_DATA_UNUSED_TAG_P(newdup), ARCH_CONVERT,
756 (xfs_dir2_data_off_t)((char *)newdup - (char *)d));
757 xfs_dir2_data_log_unused(tp, bp, newdup);
759 * If it was in the table, remove it and add the new one.
762 xfs_dir2_data_freeremove(d, dfp, needlogp);
763 dfp = xfs_dir2_data_freeinsert(d, newdup, needlogp);
765 ASSERT(dfp->length == newdup->length);
766 ASSERT(be16_to_cpu(dfp->offset) == (char *)newdup - (char *)d);
768 * If we got inserted at the last slot,
769 * that means we don't know if there was a better
770 * choice for the last slot, or not. Rescan.
772 needscan = dfp == &d->hdr.bestfree[2];
776 * We match the last part of the entry.
777 * Trim the allocated space off the tail of the entry.
779 else if (matchback) {
781 newdup->length = cpu_to_be16(((char *)d + offset) - (char *)newdup);
782 INT_SET(*XFS_DIR2_DATA_UNUSED_TAG_P(newdup), ARCH_CONVERT,
783 (xfs_dir2_data_off_t)((char *)newdup - (char *)d));
784 xfs_dir2_data_log_unused(tp, bp, newdup);
786 * If it was in the table, remove it and add the new one.
789 xfs_dir2_data_freeremove(d, dfp, needlogp);
790 dfp = xfs_dir2_data_freeinsert(d, newdup, needlogp);
792 ASSERT(dfp->length == newdup->length);
793 ASSERT(be16_to_cpu(dfp->offset) == (char *)newdup - (char *)d);
795 * If we got inserted at the last slot,
796 * that means we don't know if there was a better
797 * choice for the last slot, or not. Rescan.
799 needscan = dfp == &d->hdr.bestfree[2];
803 * Poking out the middle of an entry.
804 * Make two new entries.
808 newdup->length = cpu_to_be16(((char *)d + offset) - (char *)newdup);
809 INT_SET(*XFS_DIR2_DATA_UNUSED_TAG_P(newdup), ARCH_CONVERT,
810 (xfs_dir2_data_off_t)((char *)newdup - (char *)d));
811 xfs_dir2_data_log_unused(tp, bp, newdup);
812 newdup2 = (xfs_dir2_data_unused_t *)((char *)d + offset + len);
813 newdup2->freetag = cpu_to_be16(XFS_DIR2_DATA_FREE_TAG);
814 newdup2->length = cpu_to_be16(oldlen - len - be16_to_cpu(newdup->length));
815 INT_SET(*XFS_DIR2_DATA_UNUSED_TAG_P(newdup2), ARCH_CONVERT,
816 (xfs_dir2_data_off_t)((char *)newdup2 - (char *)d));
817 xfs_dir2_data_log_unused(tp, bp, newdup2);
819 * If the old entry was in the table, we need to scan
820 * if the 3rd entry was valid, since these entries
821 * are smaller than the old one.
822 * If we don't need to scan that means there were 1 or 2
823 * entries in the table, and removing the old and adding
824 * the 2 new will work.
827 needscan = (d->hdr.bestfree[2].length != 0);
829 xfs_dir2_data_freeremove(d, dfp, needlogp);
830 (void)xfs_dir2_data_freeinsert(d, newdup,
832 (void)xfs_dir2_data_freeinsert(d, newdup2,
837 *needscanp = needscan;