2 * Copyright (c) 2000-2003,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_inode_item.h"
37 #include "xfs_dir_leaf.h"
38 #include "xfs_dir2_data.h"
39 #include "xfs_dir2_leaf.h"
40 #include "xfs_dir2_block.h"
41 #include "xfs_dir2_trace.h"
42 #include "xfs_error.h"
45 * Local function prototypes.
47 static void xfs_dir2_block_log_leaf(xfs_trans_t *tp, xfs_dabuf_t *bp, int first,
49 static void xfs_dir2_block_log_tail(xfs_trans_t *tp, xfs_dabuf_t *bp);
50 static int xfs_dir2_block_lookup_int(xfs_da_args_t *args, xfs_dabuf_t **bpp,
52 static int xfs_dir2_block_sort(const void *a, const void *b);
55 * Add an entry to a block directory.
58 xfs_dir2_block_addname(
59 xfs_da_args_t *args) /* directory op arguments */
61 xfs_dir2_data_free_t *bf; /* bestfree table in block */
62 xfs_dir2_block_t *block; /* directory block structure */
63 xfs_dir2_leaf_entry_t *blp; /* block leaf entries */
64 xfs_dabuf_t *bp; /* buffer for block */
65 xfs_dir2_block_tail_t *btp; /* block tail */
66 int compact; /* need to compact leaf ents */
67 xfs_dir2_data_entry_t *dep; /* block data entry */
68 xfs_inode_t *dp; /* directory inode */
69 xfs_dir2_data_unused_t *dup; /* block unused entry */
70 int error; /* error return value */
71 xfs_dir2_data_unused_t *enddup=NULL; /* unused at end of data */
72 xfs_dahash_t hash; /* hash value of found entry */
73 int high; /* high index for binary srch */
74 int highstale; /* high stale index */
75 int lfloghigh=0; /* last final leaf to log */
76 int lfloglow=0; /* first final leaf to log */
77 int len; /* length of the new entry */
78 int low; /* low index for binary srch */
79 int lowstale; /* low stale index */
80 int mid=0; /* midpoint for binary srch */
81 xfs_mount_t *mp; /* filesystem mount point */
82 int needlog; /* need to log header */
83 int needscan; /* need to rescan freespace */
84 xfs_dir2_data_off_t *tagp; /* pointer to tag value */
85 xfs_trans_t *tp; /* transaction structure */
87 xfs_dir2_trace_args("block_addname", args);
92 * Read the (one and only) directory block into dabuf bp.
95 xfs_da_read_buf(tp, dp, mp->m_dirdatablk, -1, &bp, XFS_DATA_FORK))) {
101 * Check the magic number, corrupted if wrong.
103 if (unlikely(be32_to_cpu(block->hdr.magic) != XFS_DIR2_BLOCK_MAGIC)) {
104 XFS_CORRUPTION_ERROR("xfs_dir2_block_addname",
105 XFS_ERRLEVEL_LOW, mp, block);
106 xfs_da_brelse(tp, bp);
107 return XFS_ERROR(EFSCORRUPTED);
109 len = XFS_DIR2_DATA_ENTSIZE(args->namelen);
111 * Set up pointers to parts of the block.
113 bf = block->hdr.bestfree;
114 btp = XFS_DIR2_BLOCK_TAIL_P(mp, block);
115 blp = XFS_DIR2_BLOCK_LEAF_P(btp);
117 * No stale entries? Need space for entry and new leaf.
121 * Tag just before the first leaf entry.
123 tagp = (xfs_dir2_data_off_t *)blp - 1;
125 * Data object just before the first leaf entry.
127 enddup = (xfs_dir2_data_unused_t *)((char *)block + INT_GET(*tagp, ARCH_CONVERT));
129 * If it's not free then can't do this add without cleaning up:
130 * the space before the first leaf entry needs to be free so it
131 * can be expanded to hold the pointer to the new entry.
133 if (INT_GET(enddup->freetag, ARCH_CONVERT) != XFS_DIR2_DATA_FREE_TAG)
136 * Check out the biggest freespace and see if it's the same one.
139 dup = (xfs_dir2_data_unused_t *)
140 ((char *)block + be16_to_cpu(bf[0].offset));
143 * It is the biggest freespace, is it too small
144 * to hold the new leaf too?
146 if (INT_GET(dup->length, ARCH_CONVERT) < len + (uint)sizeof(*blp)) {
148 * Yes, we use the second-largest
149 * entry instead if it works.
151 if (be16_to_cpu(bf[1].length) >= len)
152 dup = (xfs_dir2_data_unused_t *)
154 be16_to_cpu(bf[1].offset));
160 * Not the same free entry,
161 * just check its length.
163 if (INT_GET(dup->length, ARCH_CONVERT) < len) {
171 * If there are stale entries we'll use one for the leaf.
172 * Is the biggest entry enough to avoid compaction?
174 else if (be16_to_cpu(bf[0].length) >= len) {
175 dup = (xfs_dir2_data_unused_t *)
176 ((char *)block + be16_to_cpu(bf[0].offset));
180 * Will need to compact to make this work.
184 * Tag just before the first leaf entry.
186 tagp = (xfs_dir2_data_off_t *)blp - 1;
188 * Data object just before the first leaf entry.
190 dup = (xfs_dir2_data_unused_t *)((char *)block + INT_GET(*tagp, ARCH_CONVERT));
192 * If it's not free then the data will go where the
193 * leaf data starts now, if it works at all.
195 if (INT_GET(dup->freetag, ARCH_CONVERT) == XFS_DIR2_DATA_FREE_TAG) {
196 if (INT_GET(dup->length, ARCH_CONVERT) + (INT_GET(btp->stale, ARCH_CONVERT) - 1) *
197 (uint)sizeof(*blp) < len)
199 } else if ((INT_GET(btp->stale, ARCH_CONVERT) - 1) * (uint)sizeof(*blp) < len)
202 dup = (xfs_dir2_data_unused_t *)blp;
206 * If this isn't a real add, we're done with the buffer.
209 xfs_da_brelse(tp, bp);
211 * If we don't have space for the new entry & leaf ...
215 * Not trying to actually do anything, or don't have
216 * a space reservation: return no-space.
218 if (args->justcheck || args->total == 0)
219 return XFS_ERROR(ENOSPC);
221 * Convert to the next larger format.
222 * Then add the new entry in that format.
224 error = xfs_dir2_block_to_leaf(args, bp);
228 return xfs_dir2_leaf_addname(args);
231 * Just checking, and it would work, so say so.
235 needlog = needscan = 0;
237 * If need to compact the leaf entries, do it now.
238 * Leave the highest-numbered stale entry stale.
239 * XXX should be the one closest to mid but mid is not yet computed.
242 int fromidx; /* source leaf index */
243 int toidx; /* target leaf index */
245 for (fromidx = toidx = INT_GET(btp->count, ARCH_CONVERT) - 1,
246 highstale = lfloghigh = -1;
249 if (INT_GET(blp[fromidx].address, ARCH_CONVERT) == XFS_DIR2_NULL_DATAPTR) {
259 blp[toidx] = blp[fromidx];
262 lfloglow = toidx + 1 - (INT_GET(btp->stale, ARCH_CONVERT) - 1);
263 lfloghigh -= INT_GET(btp->stale, ARCH_CONVERT) - 1;
264 INT_MOD(btp->count, ARCH_CONVERT, -(INT_GET(btp->stale, ARCH_CONVERT) - 1));
265 xfs_dir2_data_make_free(tp, bp,
266 (xfs_dir2_data_aoff_t)((char *)blp - (char *)block),
267 (xfs_dir2_data_aoff_t)((INT_GET(btp->stale, ARCH_CONVERT) - 1) * sizeof(*blp)),
268 &needlog, &needscan);
269 blp += INT_GET(btp->stale, ARCH_CONVERT) - 1;
270 INT_SET(btp->stale, ARCH_CONVERT, 1);
272 * If we now need to rebuild the bestfree map, do so.
273 * This needs to happen before the next call to use_free.
276 xfs_dir2_data_freescan(mp, (xfs_dir2_data_t *)block,
282 * Set leaf logging boundaries to impossible state.
283 * For the no-stale case they're set explicitly.
285 else if (INT_GET(btp->stale, ARCH_CONVERT)) {
286 lfloglow = INT_GET(btp->count, ARCH_CONVERT);
290 * Find the slot that's first lower than our hash value, -1 if none.
292 for (low = 0, high = INT_GET(btp->count, ARCH_CONVERT) - 1; low <= high; ) {
293 mid = (low + high) >> 1;
294 if ((hash = INT_GET(blp[mid].hashval, ARCH_CONVERT)) == args->hashval)
296 if (hash < args->hashval)
301 while (mid >= 0 && INT_GET(blp[mid].hashval, ARCH_CONVERT) >= args->hashval) {
305 * No stale entries, will use enddup space to hold new leaf.
309 * Mark the space needed for the new leaf entry, now in use.
311 xfs_dir2_data_use_free(tp, bp, enddup,
312 (xfs_dir2_data_aoff_t)
313 ((char *)enddup - (char *)block + INT_GET(enddup->length, ARCH_CONVERT) -
315 (xfs_dir2_data_aoff_t)sizeof(*blp),
316 &needlog, &needscan);
318 * Update the tail (entry count).
320 INT_MOD(btp->count, ARCH_CONVERT, +1);
322 * If we now need to rebuild the bestfree map, do so.
323 * This needs to happen before the next call to use_free.
326 xfs_dir2_data_freescan(mp, (xfs_dir2_data_t *)block,
331 * Adjust pointer to the first leaf entry, we're about to move
332 * the table up one to open up space for the new leaf entry.
333 * Then adjust our index to match.
338 memmove(blp, &blp[1], mid * sizeof(*blp));
343 * Use a stale leaf for our new entry.
348 INT_GET(blp[lowstale].address, ARCH_CONVERT) != XFS_DIR2_NULL_DATAPTR;
351 for (highstale = mid + 1;
352 highstale < INT_GET(btp->count, ARCH_CONVERT) &&
353 INT_GET(blp[highstale].address, ARCH_CONVERT) != XFS_DIR2_NULL_DATAPTR &&
354 (lowstale < 0 || mid - lowstale > highstale - mid);
358 * Move entries toward the low-numbered stale entry.
361 (highstale == INT_GET(btp->count, ARCH_CONVERT) ||
362 mid - lowstale <= highstale - mid)) {
364 memmove(&blp[lowstale], &blp[lowstale + 1],
365 (mid - lowstale) * sizeof(*blp));
366 lfloglow = MIN(lowstale, lfloglow);
367 lfloghigh = MAX(mid, lfloghigh);
370 * Move entries toward the high-numbered stale entry.
373 ASSERT(highstale < INT_GET(btp->count, ARCH_CONVERT));
376 memmove(&blp[mid + 1], &blp[mid],
377 (highstale - mid) * sizeof(*blp));
378 lfloglow = MIN(mid, lfloglow);
379 lfloghigh = MAX(highstale, lfloghigh);
381 INT_MOD(btp->stale, ARCH_CONVERT, -1);
384 * Point to the new data entry.
386 dep = (xfs_dir2_data_entry_t *)dup;
388 * Fill in the leaf entry.
390 INT_SET(blp[mid].hashval, ARCH_CONVERT, args->hashval);
391 INT_SET(blp[mid].address, ARCH_CONVERT, XFS_DIR2_BYTE_TO_DATAPTR(mp, (char *)dep - (char *)block));
392 xfs_dir2_block_log_leaf(tp, bp, lfloglow, lfloghigh);
394 * Mark space for the data entry used.
396 xfs_dir2_data_use_free(tp, bp, dup,
397 (xfs_dir2_data_aoff_t)((char *)dup - (char *)block),
398 (xfs_dir2_data_aoff_t)len, &needlog, &needscan);
400 * Create the new data entry.
402 INT_SET(dep->inumber, ARCH_CONVERT, args->inumber);
403 dep->namelen = args->namelen;
404 memcpy(dep->name, args->name, args->namelen);
405 tagp = XFS_DIR2_DATA_ENTRY_TAG_P(dep);
406 INT_SET(*tagp, ARCH_CONVERT, (xfs_dir2_data_off_t)((char *)dep - (char *)block));
408 * Clean up the bestfree array and log the header, tail, and entry.
411 xfs_dir2_data_freescan(mp, (xfs_dir2_data_t *)block, &needlog,
414 xfs_dir2_data_log_header(tp, bp);
415 xfs_dir2_block_log_tail(tp, bp);
416 xfs_dir2_data_log_entry(tp, bp, dep);
417 xfs_dir2_data_check(dp, bp);
423 * Readdir for block directories.
426 xfs_dir2_block_getdents(
427 xfs_trans_t *tp, /* transaction (NULL) */
428 xfs_inode_t *dp, /* incore inode */
429 uio_t *uio, /* caller's buffer control */
430 int *eofp, /* eof reached? (out) */
431 xfs_dirent_t *dbp, /* caller's buffer */
432 xfs_dir2_put_t put) /* abi's formatting function */
434 xfs_dir2_block_t *block; /* directory block structure */
435 xfs_dabuf_t *bp; /* buffer for block */
436 xfs_dir2_block_tail_t *btp; /* block tail */
437 xfs_dir2_data_entry_t *dep; /* block data entry */
438 xfs_dir2_data_unused_t *dup; /* block unused entry */
439 char *endptr; /* end of the data entries */
440 int error; /* error return value */
441 xfs_mount_t *mp; /* filesystem mount point */
442 xfs_dir2_put_args_t p; /* arg package for put rtn */
443 char *ptr; /* current data entry */
444 int wantoff; /* starting block offset */
448 * If the block number in the offset is out of range, we're done.
450 if (XFS_DIR2_DATAPTR_TO_DB(mp, uio->uio_offset) > mp->m_dirdatablk) {
455 * Can't read the block, give up, else get dabuf in bp.
458 xfs_da_read_buf(tp, dp, mp->m_dirdatablk, -1, &bp, XFS_DATA_FORK))) {
463 * Extract the byte offset we start at from the seek pointer.
464 * We'll skip entries before this.
466 wantoff = XFS_DIR2_DATAPTR_TO_OFF(mp, uio->uio_offset);
468 xfs_dir2_data_check(dp, bp);
470 * Set up values for the loop.
472 btp = XFS_DIR2_BLOCK_TAIL_P(mp, block);
473 ptr = (char *)block->u;
474 endptr = (char *)XFS_DIR2_BLOCK_LEAF_P(btp);
479 * Loop over the data portion of the block.
480 * Each object is a real entry (dep) or an unused one (dup).
482 while (ptr < endptr) {
483 dup = (xfs_dir2_data_unused_t *)ptr;
487 if (INT_GET(dup->freetag, ARCH_CONVERT) == XFS_DIR2_DATA_FREE_TAG) {
488 ptr += INT_GET(dup->length, ARCH_CONVERT);
492 dep = (xfs_dir2_data_entry_t *)ptr;
495 * Bump pointer for the next iteration.
497 ptr += XFS_DIR2_DATA_ENTSIZE(dep->namelen);
499 * The entry is before the desired starting point, skip it.
501 if ((char *)dep - (char *)block < wantoff)
504 * Set up argument structure for put routine.
506 p.namelen = dep->namelen;
508 p.cook = XFS_DIR2_DB_OFF_TO_DATAPTR(mp, mp->m_dirdatablk,
509 ptr - (char *)block);
510 p.ino = INT_GET(dep->inumber, ARCH_CONVERT);
512 p.ino += mp->m_inoadd;
514 p.name = (char *)dep->name;
517 * Put the entry in the caller's buffer.
522 * If it didn't fit, set the final offset to here & return.
526 XFS_DIR2_DB_OFF_TO_DATAPTR(mp, mp->m_dirdatablk,
527 (char *)dep - (char *)block);
528 xfs_da_brelse(tp, bp);
534 * Reached the end of the block.
535 * Set the offset to a nonexistent block 1 and return.
540 XFS_DIR2_DB_OFF_TO_DATAPTR(mp, mp->m_dirdatablk + 1, 0);
542 xfs_da_brelse(tp, bp);
548 * Log leaf entries from the block.
551 xfs_dir2_block_log_leaf(
552 xfs_trans_t *tp, /* transaction structure */
553 xfs_dabuf_t *bp, /* block buffer */
554 int first, /* index of first logged leaf */
555 int last) /* index of last logged leaf */
557 xfs_dir2_block_t *block; /* directory block structure */
558 xfs_dir2_leaf_entry_t *blp; /* block leaf entries */
559 xfs_dir2_block_tail_t *btp; /* block tail */
560 xfs_mount_t *mp; /* filesystem mount point */
564 btp = XFS_DIR2_BLOCK_TAIL_P(mp, block);
565 blp = XFS_DIR2_BLOCK_LEAF_P(btp);
566 xfs_da_log_buf(tp, bp, (uint)((char *)&blp[first] - (char *)block),
567 (uint)((char *)&blp[last + 1] - (char *)block - 1));
571 * Log the block tail.
574 xfs_dir2_block_log_tail(
575 xfs_trans_t *tp, /* transaction structure */
576 xfs_dabuf_t *bp) /* block buffer */
578 xfs_dir2_block_t *block; /* directory block structure */
579 xfs_dir2_block_tail_t *btp; /* block tail */
580 xfs_mount_t *mp; /* filesystem mount point */
584 btp = XFS_DIR2_BLOCK_TAIL_P(mp, block);
585 xfs_da_log_buf(tp, bp, (uint)((char *)btp - (char *)block),
586 (uint)((char *)(btp + 1) - (char *)block - 1));
590 * Look up an entry in the block. This is the external routine,
591 * xfs_dir2_block_lookup_int does the real work.
594 xfs_dir2_block_lookup(
595 xfs_da_args_t *args) /* dir lookup arguments */
597 xfs_dir2_block_t *block; /* block structure */
598 xfs_dir2_leaf_entry_t *blp; /* block leaf entries */
599 xfs_dabuf_t *bp; /* block buffer */
600 xfs_dir2_block_tail_t *btp; /* block tail */
601 xfs_dir2_data_entry_t *dep; /* block data entry */
602 xfs_inode_t *dp; /* incore inode */
603 int ent; /* entry index */
604 int error; /* error return value */
605 xfs_mount_t *mp; /* filesystem mount point */
607 xfs_dir2_trace_args("block_lookup", args);
609 * Get the buffer, look up the entry.
610 * If not found (ENOENT) then return, have no buffer.
612 if ((error = xfs_dir2_block_lookup_int(args, &bp, &ent)))
617 xfs_dir2_data_check(dp, bp);
618 btp = XFS_DIR2_BLOCK_TAIL_P(mp, block);
619 blp = XFS_DIR2_BLOCK_LEAF_P(btp);
621 * Get the offset from the leaf entry, to point to the data.
623 dep = (xfs_dir2_data_entry_t *)
624 ((char *)block + XFS_DIR2_DATAPTR_TO_OFF(mp, INT_GET(blp[ent].address, ARCH_CONVERT)));
626 * Fill in inode number, release the block.
628 args->inumber = INT_GET(dep->inumber, ARCH_CONVERT);
629 xfs_da_brelse(args->trans, bp);
630 return XFS_ERROR(EEXIST);
634 * Internal block lookup routine.
636 static int /* error */
637 xfs_dir2_block_lookup_int(
638 xfs_da_args_t *args, /* dir lookup arguments */
639 xfs_dabuf_t **bpp, /* returned block buffer */
640 int *entno) /* returned entry number */
642 xfs_dir2_dataptr_t addr; /* data entry address */
643 xfs_dir2_block_t *block; /* block structure */
644 xfs_dir2_leaf_entry_t *blp; /* block leaf entries */
645 xfs_dabuf_t *bp; /* block buffer */
646 xfs_dir2_block_tail_t *btp; /* block tail */
647 xfs_dir2_data_entry_t *dep; /* block data entry */
648 xfs_inode_t *dp; /* incore inode */
649 int error; /* error return value */
650 xfs_dahash_t hash; /* found hash value */
651 int high; /* binary search high index */
652 int low; /* binary search low index */
653 int mid; /* binary search current idx */
654 xfs_mount_t *mp; /* filesystem mount point */
655 xfs_trans_t *tp; /* transaction pointer */
661 * Read the buffer, return error if we can't get it.
664 xfs_da_read_buf(tp, dp, mp->m_dirdatablk, -1, &bp, XFS_DATA_FORK))) {
669 xfs_dir2_data_check(dp, bp);
670 btp = XFS_DIR2_BLOCK_TAIL_P(mp, block);
671 blp = XFS_DIR2_BLOCK_LEAF_P(btp);
673 * Loop doing a binary search for our hash value.
674 * Find our entry, ENOENT if it's not there.
676 for (low = 0, high = INT_GET(btp->count, ARCH_CONVERT) - 1; ; ) {
678 mid = (low + high) >> 1;
679 if ((hash = INT_GET(blp[mid].hashval, ARCH_CONVERT)) == args->hashval)
681 if (hash < args->hashval)
686 ASSERT(args->oknoent);
687 xfs_da_brelse(tp, bp);
688 return XFS_ERROR(ENOENT);
692 * Back up to the first one with the right hash value.
694 while (mid > 0 && INT_GET(blp[mid - 1].hashval, ARCH_CONVERT) == args->hashval) {
698 * Now loop forward through all the entries with the
699 * right hash value looking for our name.
702 if ((addr = INT_GET(blp[mid].address, ARCH_CONVERT)) == XFS_DIR2_NULL_DATAPTR)
705 * Get pointer to the entry from the leaf.
707 dep = (xfs_dir2_data_entry_t *)
708 ((char *)block + XFS_DIR2_DATAPTR_TO_OFF(mp, addr));
710 * Compare, if it's right give back buffer & entry number.
712 if (dep->namelen == args->namelen &&
713 dep->name[0] == args->name[0] &&
714 memcmp(dep->name, args->name, args->namelen) == 0) {
719 } while (++mid < INT_GET(btp->count, ARCH_CONVERT) && INT_GET(blp[mid].hashval, ARCH_CONVERT) == hash);
721 * No match, release the buffer and return ENOENT.
723 ASSERT(args->oknoent);
724 xfs_da_brelse(tp, bp);
725 return XFS_ERROR(ENOENT);
729 * Remove an entry from a block format directory.
730 * If that makes the block small enough to fit in shortform, transform it.
733 xfs_dir2_block_removename(
734 xfs_da_args_t *args) /* directory operation args */
736 xfs_dir2_block_t *block; /* block structure */
737 xfs_dir2_leaf_entry_t *blp; /* block leaf pointer */
738 xfs_dabuf_t *bp; /* block buffer */
739 xfs_dir2_block_tail_t *btp; /* block tail */
740 xfs_dir2_data_entry_t *dep; /* block data entry */
741 xfs_inode_t *dp; /* incore inode */
742 int ent; /* block leaf entry index */
743 int error; /* error return value */
744 xfs_mount_t *mp; /* filesystem mount point */
745 int needlog; /* need to log block header */
746 int needscan; /* need to fixup bestfree */
747 xfs_dir2_sf_hdr_t sfh; /* shortform header */
748 int size; /* shortform size */
749 xfs_trans_t *tp; /* transaction pointer */
751 xfs_dir2_trace_args("block_removename", args);
753 * Look up the entry in the block. Gets the buffer and entry index.
754 * It will always be there, the vnodeops level does a lookup first.
756 if ((error = xfs_dir2_block_lookup_int(args, &bp, &ent))) {
763 btp = XFS_DIR2_BLOCK_TAIL_P(mp, block);
764 blp = XFS_DIR2_BLOCK_LEAF_P(btp);
766 * Point to the data entry using the leaf entry.
768 dep = (xfs_dir2_data_entry_t *)
769 ((char *)block + XFS_DIR2_DATAPTR_TO_OFF(mp, INT_GET(blp[ent].address, ARCH_CONVERT)));
771 * Mark the data entry's space free.
773 needlog = needscan = 0;
774 xfs_dir2_data_make_free(tp, bp,
775 (xfs_dir2_data_aoff_t)((char *)dep - (char *)block),
776 XFS_DIR2_DATA_ENTSIZE(dep->namelen), &needlog, &needscan);
778 * Fix up the block tail.
780 INT_MOD(btp->stale, ARCH_CONVERT, +1);
781 xfs_dir2_block_log_tail(tp, bp);
783 * Remove the leaf entry by marking it stale.
785 INT_SET(blp[ent].address, ARCH_CONVERT, XFS_DIR2_NULL_DATAPTR);
786 xfs_dir2_block_log_leaf(tp, bp, ent, ent);
788 * Fix up bestfree, log the header if necessary.
791 xfs_dir2_data_freescan(mp, (xfs_dir2_data_t *)block, &needlog,
794 xfs_dir2_data_log_header(tp, bp);
795 xfs_dir2_data_check(dp, bp);
797 * See if the size as a shortform is good enough.
799 if ((size = xfs_dir2_block_sfsize(dp, block, &sfh)) >
800 XFS_IFORK_DSIZE(dp)) {
805 * If it works, do the conversion.
807 return xfs_dir2_block_to_sf(args, bp, size, &sfh);
811 * Replace an entry in a V2 block directory.
812 * Change the inode number to the new value.
815 xfs_dir2_block_replace(
816 xfs_da_args_t *args) /* directory operation args */
818 xfs_dir2_block_t *block; /* block structure */
819 xfs_dir2_leaf_entry_t *blp; /* block leaf entries */
820 xfs_dabuf_t *bp; /* block buffer */
821 xfs_dir2_block_tail_t *btp; /* block tail */
822 xfs_dir2_data_entry_t *dep; /* block data entry */
823 xfs_inode_t *dp; /* incore inode */
824 int ent; /* leaf entry index */
825 int error; /* error return value */
826 xfs_mount_t *mp; /* filesystem mount point */
828 xfs_dir2_trace_args("block_replace", args);
830 * Lookup the entry in the directory. Get buffer and entry index.
831 * This will always succeed since the caller has already done a lookup.
833 if ((error = xfs_dir2_block_lookup_int(args, &bp, &ent))) {
839 btp = XFS_DIR2_BLOCK_TAIL_P(mp, block);
840 blp = XFS_DIR2_BLOCK_LEAF_P(btp);
842 * Point to the data entry we need to change.
844 dep = (xfs_dir2_data_entry_t *)
845 ((char *)block + XFS_DIR2_DATAPTR_TO_OFF(mp, INT_GET(blp[ent].address, ARCH_CONVERT)));
846 ASSERT(INT_GET(dep->inumber, ARCH_CONVERT) != args->inumber);
848 * Change the inode number to the new value.
850 INT_SET(dep->inumber, ARCH_CONVERT, args->inumber);
851 xfs_dir2_data_log_entry(args->trans, bp, dep);
852 xfs_dir2_data_check(dp, bp);
858 * Qsort comparison routine for the block leaf entries.
860 static int /* sort order */
862 const void *a, /* first leaf entry */
863 const void *b) /* second leaf entry */
865 const xfs_dir2_leaf_entry_t *la; /* first leaf entry */
866 const xfs_dir2_leaf_entry_t *lb; /* second leaf entry */
870 return INT_GET(la->hashval, ARCH_CONVERT) < INT_GET(lb->hashval, ARCH_CONVERT) ? -1 :
871 (INT_GET(la->hashval, ARCH_CONVERT) > INT_GET(lb->hashval, ARCH_CONVERT) ? 1 : 0);
875 * Convert a V2 leaf directory to a V2 block directory if possible.
878 xfs_dir2_leaf_to_block(
879 xfs_da_args_t *args, /* operation arguments */
880 xfs_dabuf_t *lbp, /* leaf buffer */
881 xfs_dabuf_t *dbp) /* data buffer */
883 __be16 *bestsp; /* leaf bests table */
884 xfs_dir2_block_t *block; /* block structure */
885 xfs_dir2_block_tail_t *btp; /* block tail */
886 xfs_inode_t *dp; /* incore directory inode */
887 xfs_dir2_data_unused_t *dup; /* unused data entry */
888 int error; /* error return value */
889 int from; /* leaf from index */
890 xfs_dir2_leaf_t *leaf; /* leaf structure */
891 xfs_dir2_leaf_entry_t *lep; /* leaf entry */
892 xfs_dir2_leaf_tail_t *ltp; /* leaf tail structure */
893 xfs_mount_t *mp; /* file system mount point */
894 int needlog; /* need to log data header */
895 int needscan; /* need to scan for bestfree */
896 xfs_dir2_sf_hdr_t sfh; /* shortform header */
897 int size; /* bytes used */
898 xfs_dir2_data_off_t *tagp; /* end of entry (tag) */
899 int to; /* block/leaf to index */
900 xfs_trans_t *tp; /* transaction pointer */
902 xfs_dir2_trace_args_bb("leaf_to_block", args, lbp, dbp);
907 ASSERT(INT_GET(leaf->hdr.info.magic, ARCH_CONVERT) == XFS_DIR2_LEAF1_MAGIC);
908 ltp = XFS_DIR2_LEAF_TAIL_P(mp, leaf);
910 * If there are data blocks other than the first one, take this
911 * opportunity to remove trailing empty data blocks that may have
912 * been left behind during no-space-reservation operations.
913 * These will show up in the leaf bests table.
915 while (dp->i_d.di_size > mp->m_dirblksize) {
916 bestsp = XFS_DIR2_LEAF_BESTS_P(ltp);
917 if (be16_to_cpu(bestsp[INT_GET(ltp->bestcount, ARCH_CONVERT) - 1]) ==
918 mp->m_dirblksize - (uint)sizeof(block->hdr)) {
920 xfs_dir2_leaf_trim_data(args, lbp,
921 (xfs_dir2_db_t)(INT_GET(ltp->bestcount, ARCH_CONVERT) - 1))))
929 * Read the data block if we don't already have it, give up if it fails.
932 (error = xfs_da_read_buf(tp, dp, mp->m_dirdatablk, -1, &dbp,
937 ASSERT(be32_to_cpu(block->hdr.magic) == XFS_DIR2_DATA_MAGIC);
939 * Size of the "leaf" area in the block.
941 size = (uint)sizeof(block->tail) +
942 (uint)sizeof(*lep) * (INT_GET(leaf->hdr.count, ARCH_CONVERT) - INT_GET(leaf->hdr.stale, ARCH_CONVERT));
944 * Look at the last data entry.
946 tagp = (xfs_dir2_data_off_t *)((char *)block + mp->m_dirblksize) - 1;
947 dup = (xfs_dir2_data_unused_t *)((char *)block + INT_GET(*tagp, ARCH_CONVERT));
949 * If it's not free or is too short we can't do it.
951 if (INT_GET(dup->freetag, ARCH_CONVERT) != XFS_DIR2_DATA_FREE_TAG || INT_GET(dup->length, ARCH_CONVERT) < size) {
956 * Start converting it to block form.
958 block->hdr.magic = cpu_to_be32(XFS_DIR2_BLOCK_MAGIC);
962 * Use up the space at the end of the block (blp/btp).
964 xfs_dir2_data_use_free(tp, dbp, dup, mp->m_dirblksize - size, size,
965 &needlog, &needscan);
967 * Initialize the block tail.
969 btp = XFS_DIR2_BLOCK_TAIL_P(mp, block);
970 INT_SET(btp->count, ARCH_CONVERT, INT_GET(leaf->hdr.count, ARCH_CONVERT) - INT_GET(leaf->hdr.stale, ARCH_CONVERT));
972 xfs_dir2_block_log_tail(tp, dbp);
974 * Initialize the block leaf area. We compact out stale entries.
976 lep = XFS_DIR2_BLOCK_LEAF_P(btp);
977 for (from = to = 0; from < INT_GET(leaf->hdr.count, ARCH_CONVERT); from++) {
978 if (INT_GET(leaf->ents[from].address, ARCH_CONVERT) == XFS_DIR2_NULL_DATAPTR)
980 lep[to++] = leaf->ents[from];
982 ASSERT(to == INT_GET(btp->count, ARCH_CONVERT));
983 xfs_dir2_block_log_leaf(tp, dbp, 0, INT_GET(btp->count, ARCH_CONVERT) - 1);
985 * Scan the bestfree if we need it and log the data block header.
988 xfs_dir2_data_freescan(mp, (xfs_dir2_data_t *)block, &needlog,
991 xfs_dir2_data_log_header(tp, dbp);
993 * Pitch the old leaf block.
995 error = xfs_da_shrink_inode(args, mp->m_dirleafblk, lbp);
1001 * Now see if the resulting block can be shrunken to shortform.
1003 if ((size = xfs_dir2_block_sfsize(dp, block, &sfh)) >
1004 XFS_IFORK_DSIZE(dp)) {
1008 return xfs_dir2_block_to_sf(args, dbp, size, &sfh);
1011 xfs_da_buf_done(lbp);
1013 xfs_da_buf_done(dbp);
1018 * Convert the shortform directory to block form.
1021 xfs_dir2_sf_to_block(
1022 xfs_da_args_t *args) /* operation arguments */
1024 xfs_dir2_db_t blkno; /* dir-relative block # (0) */
1025 xfs_dir2_block_t *block; /* block structure */
1026 xfs_dir2_leaf_entry_t *blp; /* block leaf entries */
1027 xfs_dabuf_t *bp; /* block buffer */
1028 xfs_dir2_block_tail_t *btp; /* block tail pointer */
1029 char *buf; /* sf buffer */
1031 xfs_dir2_data_entry_t *dep; /* data entry pointer */
1032 xfs_inode_t *dp; /* incore directory inode */
1033 int dummy; /* trash */
1034 xfs_dir2_data_unused_t *dup; /* unused entry pointer */
1035 int endoffset; /* end of data objects */
1036 int error; /* error return value */
1038 xfs_mount_t *mp; /* filesystem mount point */
1039 int needlog; /* need to log block header */
1040 int needscan; /* need to scan block freespc */
1041 int newoffset; /* offset from current entry */
1042 int offset; /* target block offset */
1043 xfs_dir2_sf_entry_t *sfep; /* sf entry pointer */
1044 xfs_dir2_sf_t *sfp; /* shortform structure */
1045 xfs_dir2_data_off_t *tagp; /* end of data entry */
1046 xfs_trans_t *tp; /* transaction pointer */
1048 xfs_dir2_trace_args("sf_to_block", args);
1052 ASSERT(dp->i_df.if_flags & XFS_IFINLINE);
1054 * Bomb out if the shortform directory is way too short.
1056 if (dp->i_d.di_size < offsetof(xfs_dir2_sf_hdr_t, parent)) {
1057 ASSERT(XFS_FORCED_SHUTDOWN(mp));
1058 return XFS_ERROR(EIO);
1060 ASSERT(dp->i_df.if_bytes == dp->i_d.di_size);
1061 ASSERT(dp->i_df.if_u1.if_data != NULL);
1062 sfp = (xfs_dir2_sf_t *)dp->i_df.if_u1.if_data;
1063 ASSERT(dp->i_d.di_size >= XFS_DIR2_SF_HDR_SIZE(sfp->hdr.i8count));
1065 * Copy the directory into the stack buffer.
1066 * Then pitch the incore inode data so we can make extents.
1069 buf_len = dp->i_df.if_bytes;
1070 buf = kmem_alloc(dp->i_df.if_bytes, KM_SLEEP);
1072 memcpy(buf, sfp, dp->i_df.if_bytes);
1073 xfs_idata_realloc(dp, -dp->i_df.if_bytes, XFS_DATA_FORK);
1074 dp->i_d.di_size = 0;
1075 xfs_trans_log_inode(tp, dp, XFS_ILOG_CORE);
1077 * Reset pointer - old sfp is gone.
1079 sfp = (xfs_dir2_sf_t *)buf;
1081 * Add block 0 to the inode.
1083 error = xfs_dir2_grow_inode(args, XFS_DIR2_DATA_SPACE, &blkno);
1085 kmem_free(buf, buf_len);
1089 * Initialize the data block.
1091 error = xfs_dir2_data_init(args, blkno, &bp);
1093 kmem_free(buf, buf_len);
1097 block->hdr.magic = cpu_to_be32(XFS_DIR2_BLOCK_MAGIC);
1099 * Compute size of block "tail" area.
1101 i = (uint)sizeof(*btp) +
1102 (INT_GET(sfp->hdr.count, ARCH_CONVERT) + 2) * (uint)sizeof(xfs_dir2_leaf_entry_t);
1104 * The whole thing is initialized to free by the init routine.
1105 * Say we're using the leaf and tail area.
1107 dup = (xfs_dir2_data_unused_t *)block->u;
1108 needlog = needscan = 0;
1109 xfs_dir2_data_use_free(tp, bp, dup, mp->m_dirblksize - i, i, &needlog,
1111 ASSERT(needscan == 0);
1115 btp = XFS_DIR2_BLOCK_TAIL_P(mp, block);
1116 INT_SET(btp->count, ARCH_CONVERT, INT_GET(sfp->hdr.count, ARCH_CONVERT) + 2); /* ., .. */
1118 blp = XFS_DIR2_BLOCK_LEAF_P(btp);
1119 endoffset = (uint)((char *)blp - (char *)block);
1121 * Remove the freespace, we'll manage it.
1123 xfs_dir2_data_use_free(tp, bp, dup,
1124 (xfs_dir2_data_aoff_t)((char *)dup - (char *)block),
1125 INT_GET(dup->length, ARCH_CONVERT), &needlog, &needscan);
1127 * Create entry for .
1129 dep = (xfs_dir2_data_entry_t *)
1130 ((char *)block + XFS_DIR2_DATA_DOT_OFFSET);
1131 INT_SET(dep->inumber, ARCH_CONVERT, dp->i_ino);
1134 tagp = XFS_DIR2_DATA_ENTRY_TAG_P(dep);
1135 INT_SET(*tagp, ARCH_CONVERT, (xfs_dir2_data_off_t)((char *)dep - (char *)block));
1136 xfs_dir2_data_log_entry(tp, bp, dep);
1137 INT_SET(blp[0].hashval, ARCH_CONVERT, xfs_dir_hash_dot);
1138 INT_SET(blp[0].address, ARCH_CONVERT, XFS_DIR2_BYTE_TO_DATAPTR(mp, (char *)dep - (char *)block));
1140 * Create entry for ..
1142 dep = (xfs_dir2_data_entry_t *)
1143 ((char *)block + XFS_DIR2_DATA_DOTDOT_OFFSET);
1144 INT_SET(dep->inumber, ARCH_CONVERT, XFS_DIR2_SF_GET_INUMBER(sfp, &sfp->hdr.parent));
1146 dep->name[0] = dep->name[1] = '.';
1147 tagp = XFS_DIR2_DATA_ENTRY_TAG_P(dep);
1148 INT_SET(*tagp, ARCH_CONVERT, (xfs_dir2_data_off_t)((char *)dep - (char *)block));
1149 xfs_dir2_data_log_entry(tp, bp, dep);
1150 INT_SET(blp[1].hashval, ARCH_CONVERT, xfs_dir_hash_dotdot);
1151 INT_SET(blp[1].address, ARCH_CONVERT, XFS_DIR2_BYTE_TO_DATAPTR(mp, (char *)dep - (char *)block));
1152 offset = XFS_DIR2_DATA_FIRST_OFFSET;
1154 * Loop over existing entries, stuff them in.
1156 if ((i = 0) == INT_GET(sfp->hdr.count, ARCH_CONVERT))
1159 sfep = XFS_DIR2_SF_FIRSTENTRY(sfp);
1161 * Need to preserve the existing offset values in the sf directory.
1162 * Insert holes (unused entries) where necessary.
1164 while (offset < endoffset) {
1166 * sfep is null when we reach the end of the list.
1169 newoffset = endoffset;
1171 newoffset = XFS_DIR2_SF_GET_OFFSET(sfep);
1173 * There should be a hole here, make one.
1175 if (offset < newoffset) {
1176 dup = (xfs_dir2_data_unused_t *)
1177 ((char *)block + offset);
1178 INT_SET(dup->freetag, ARCH_CONVERT, XFS_DIR2_DATA_FREE_TAG);
1179 INT_SET(dup->length, ARCH_CONVERT, newoffset - offset);
1180 INT_SET(*XFS_DIR2_DATA_UNUSED_TAG_P(dup), ARCH_CONVERT,
1181 (xfs_dir2_data_off_t)
1182 ((char *)dup - (char *)block));
1183 xfs_dir2_data_log_unused(tp, bp, dup);
1184 (void)xfs_dir2_data_freeinsert((xfs_dir2_data_t *)block,
1186 offset += INT_GET(dup->length, ARCH_CONVERT);
1190 * Copy a real entry.
1192 dep = (xfs_dir2_data_entry_t *)((char *)block + newoffset);
1193 INT_SET(dep->inumber, ARCH_CONVERT, XFS_DIR2_SF_GET_INUMBER(sfp,
1194 XFS_DIR2_SF_INUMBERP(sfep)));
1195 dep->namelen = sfep->namelen;
1196 memcpy(dep->name, sfep->name, dep->namelen);
1197 tagp = XFS_DIR2_DATA_ENTRY_TAG_P(dep);
1198 INT_SET(*tagp, ARCH_CONVERT, (xfs_dir2_data_off_t)((char *)dep - (char *)block));
1199 xfs_dir2_data_log_entry(tp, bp, dep);
1200 INT_SET(blp[2 + i].hashval, ARCH_CONVERT, xfs_da_hashname((char *)sfep->name, sfep->namelen));
1201 INT_SET(blp[2 + i].address, ARCH_CONVERT, XFS_DIR2_BYTE_TO_DATAPTR(mp,
1202 (char *)dep - (char *)block));
1203 offset = (int)((char *)(tagp + 1) - (char *)block);
1204 if (++i == INT_GET(sfp->hdr.count, ARCH_CONVERT))
1207 sfep = XFS_DIR2_SF_NEXTENTRY(sfp, sfep);
1209 /* Done with the temporary buffer */
1210 kmem_free(buf, buf_len);
1212 * Sort the leaf entries by hash value.
1214 xfs_sort(blp, INT_GET(btp->count, ARCH_CONVERT), sizeof(*blp), xfs_dir2_block_sort);
1216 * Log the leaf entry area and tail.
1217 * Already logged the header in data_init, ignore needlog.
1219 ASSERT(needscan == 0);
1220 xfs_dir2_block_log_leaf(tp, bp, 0, INT_GET(btp->count, ARCH_CONVERT) - 1);
1221 xfs_dir2_block_log_tail(tp, bp);
1222 xfs_dir2_data_check(dp, bp);
1223 xfs_da_buf_done(bp);