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"
22 #include "xfs_trans.h"
25 #include "xfs_mount.h"
26 #include "xfs_da_btree.h"
27 #include "xfs_bmap_btree.h"
28 #include "xfs_dinode.h"
29 #include "xfs_inode.h"
30 #include "xfs_inode_item.h"
32 #include "xfs_dir2_format.h"
33 #include "xfs_dir2_priv.h"
34 #include "xfs_error.h"
35 #include "xfs_trace.h"
38 * Local function prototypes.
40 static void xfs_dir2_block_log_leaf(xfs_trans_t
*tp
, struct xfs_buf
*bp
,
42 static void xfs_dir2_block_log_tail(xfs_trans_t
*tp
, struct xfs_buf
*bp
);
43 static int xfs_dir2_block_lookup_int(xfs_da_args_t
*args
, struct xfs_buf
**bpp
,
45 static int xfs_dir2_block_sort(const void *a
, const void *b
);
47 static xfs_dahash_t xfs_dir_hash_dot
, xfs_dir_hash_dotdot
;
50 * One-time startup routine called from xfs_init().
55 xfs_dir_hash_dot
= xfs_da_hashname((unsigned char *)".", 1);
56 xfs_dir_hash_dotdot
= xfs_da_hashname((unsigned char *)"..", 2);
60 * Add an entry to a block directory.
63 xfs_dir2_block_addname(
64 xfs_da_args_t
*args
) /* directory op arguments */
66 xfs_dir2_data_free_t
*bf
; /* bestfree table in block */
67 xfs_dir2_data_hdr_t
*hdr
; /* block header */
68 xfs_dir2_leaf_entry_t
*blp
; /* block leaf entries */
69 struct xfs_buf
*bp
; /* buffer for block */
70 xfs_dir2_block_tail_t
*btp
; /* block tail */
71 int compact
; /* need to compact leaf ents */
72 xfs_dir2_data_entry_t
*dep
; /* block data entry */
73 xfs_inode_t
*dp
; /* directory inode */
74 xfs_dir2_data_unused_t
*dup
; /* block unused entry */
75 int error
; /* error return value */
76 xfs_dir2_data_unused_t
*enddup
=NULL
; /* unused at end of data */
77 xfs_dahash_t hash
; /* hash value of found entry */
78 int high
; /* high index for binary srch */
79 int highstale
; /* high stale index */
80 int lfloghigh
=0; /* last final leaf to log */
81 int lfloglow
=0; /* first final leaf to log */
82 int len
; /* length of the new entry */
83 int low
; /* low index for binary srch */
84 int lowstale
; /* low stale index */
85 int mid
=0; /* midpoint for binary srch */
86 xfs_mount_t
*mp
; /* filesystem mount point */
87 int needlog
; /* need to log header */
88 int needscan
; /* need to rescan freespace */
89 __be16
*tagp
; /* pointer to tag value */
90 xfs_trans_t
*tp
; /* transaction structure */
92 trace_xfs_dir2_block_addname(args
);
98 * Read the (one and only) directory block into dabuf bp.
101 xfs_da_read_buf(tp
, dp
, mp
->m_dirdatablk
, -1, &bp
, XFS_DATA_FORK
))) {
107 * Check the magic number, corrupted if wrong.
109 if (unlikely(hdr
->magic
!= cpu_to_be32(XFS_DIR2_BLOCK_MAGIC
))) {
110 XFS_CORRUPTION_ERROR("xfs_dir2_block_addname",
111 XFS_ERRLEVEL_LOW
, mp
, hdr
);
112 xfs_trans_brelse(tp
, bp
);
113 return XFS_ERROR(EFSCORRUPTED
);
115 len
= xfs_dir2_data_entsize(args
->namelen
);
117 * Set up pointers to parts of the block.
120 btp
= xfs_dir2_block_tail_p(mp
, hdr
);
121 blp
= xfs_dir2_block_leaf_p(btp
);
123 * No stale entries? Need space for entry and new leaf.
127 * Tag just before the first leaf entry.
129 tagp
= (__be16
*)blp
- 1;
131 * Data object just before the first leaf entry.
133 enddup
= (xfs_dir2_data_unused_t
*)((char *)hdr
+ be16_to_cpu(*tagp
));
135 * If it's not free then can't do this add without cleaning up:
136 * the space before the first leaf entry needs to be free so it
137 * can be expanded to hold the pointer to the new entry.
139 if (be16_to_cpu(enddup
->freetag
) != XFS_DIR2_DATA_FREE_TAG
)
142 * Check out the biggest freespace and see if it's the same one.
145 dup
= (xfs_dir2_data_unused_t
*)
146 ((char *)hdr
+ be16_to_cpu(bf
[0].offset
));
149 * It is the biggest freespace, is it too small
150 * to hold the new leaf too?
152 if (be16_to_cpu(dup
->length
) < len
+ (uint
)sizeof(*blp
)) {
154 * Yes, we use the second-largest
155 * entry instead if it works.
157 if (be16_to_cpu(bf
[1].length
) >= len
)
158 dup
= (xfs_dir2_data_unused_t
*)
160 be16_to_cpu(bf
[1].offset
));
166 * Not the same free entry,
167 * just check its length.
169 if (be16_to_cpu(dup
->length
) < len
) {
177 * If there are stale entries we'll use one for the leaf.
178 * Is the biggest entry enough to avoid compaction?
180 else if (be16_to_cpu(bf
[0].length
) >= len
) {
181 dup
= (xfs_dir2_data_unused_t
*)
182 ((char *)hdr
+ be16_to_cpu(bf
[0].offset
));
186 * Will need to compact to make this work.
190 * Tag just before the first leaf entry.
192 tagp
= (__be16
*)blp
- 1;
194 * Data object just before the first leaf entry.
196 dup
= (xfs_dir2_data_unused_t
*)((char *)hdr
+ be16_to_cpu(*tagp
));
198 * If it's not free then the data will go where the
199 * leaf data starts now, if it works at all.
201 if (be16_to_cpu(dup
->freetag
) == XFS_DIR2_DATA_FREE_TAG
) {
202 if (be16_to_cpu(dup
->length
) + (be32_to_cpu(btp
->stale
) - 1) *
203 (uint
)sizeof(*blp
) < len
)
205 } else if ((be32_to_cpu(btp
->stale
) - 1) * (uint
)sizeof(*blp
) < len
)
208 dup
= (xfs_dir2_data_unused_t
*)blp
;
212 * If this isn't a real add, we're done with the buffer.
214 if (args
->op_flags
& XFS_DA_OP_JUSTCHECK
)
215 xfs_trans_brelse(tp
, bp
);
217 * If we don't have space for the new entry & leaf ...
221 * Not trying to actually do anything, or don't have
222 * a space reservation: return no-space.
224 if ((args
->op_flags
& XFS_DA_OP_JUSTCHECK
) || args
->total
== 0)
225 return XFS_ERROR(ENOSPC
);
227 * Convert to the next larger format.
228 * Then add the new entry in that format.
230 error
= xfs_dir2_block_to_leaf(args
, bp
);
233 return xfs_dir2_leaf_addname(args
);
236 * Just checking, and it would work, so say so.
238 if (args
->op_flags
& XFS_DA_OP_JUSTCHECK
)
240 needlog
= needscan
= 0;
242 * If need to compact the leaf entries, do it now.
243 * Leave the highest-numbered stale entry stale.
244 * XXX should be the one closest to mid but mid is not yet computed.
247 int fromidx
; /* source leaf index */
248 int toidx
; /* target leaf index */
250 for (fromidx
= toidx
= be32_to_cpu(btp
->count
) - 1,
251 highstale
= lfloghigh
= -1;
254 if (blp
[fromidx
].address
==
255 cpu_to_be32(XFS_DIR2_NULL_DATAPTR
)) {
265 blp
[toidx
] = blp
[fromidx
];
268 lfloglow
= toidx
+ 1 - (be32_to_cpu(btp
->stale
) - 1);
269 lfloghigh
-= be32_to_cpu(btp
->stale
) - 1;
270 be32_add_cpu(&btp
->count
, -(be32_to_cpu(btp
->stale
) - 1));
271 xfs_dir2_data_make_free(tp
, bp
,
272 (xfs_dir2_data_aoff_t
)((char *)blp
- (char *)hdr
),
273 (xfs_dir2_data_aoff_t
)((be32_to_cpu(btp
->stale
) - 1) * sizeof(*blp
)),
274 &needlog
, &needscan
);
275 blp
+= be32_to_cpu(btp
->stale
) - 1;
276 btp
->stale
= cpu_to_be32(1);
278 * If we now need to rebuild the bestfree map, do so.
279 * This needs to happen before the next call to use_free.
282 xfs_dir2_data_freescan(mp
, hdr
, &needlog
);
287 * Set leaf logging boundaries to impossible state.
288 * For the no-stale case they're set explicitly.
290 else if (btp
->stale
) {
291 lfloglow
= be32_to_cpu(btp
->count
);
295 * Find the slot that's first lower than our hash value, -1 if none.
297 for (low
= 0, high
= be32_to_cpu(btp
->count
) - 1; low
<= high
; ) {
298 mid
= (low
+ high
) >> 1;
299 if ((hash
= be32_to_cpu(blp
[mid
].hashval
)) == args
->hashval
)
301 if (hash
< args
->hashval
)
306 while (mid
>= 0 && be32_to_cpu(blp
[mid
].hashval
) >= args
->hashval
) {
310 * No stale entries, will use enddup space to hold new leaf.
314 * Mark the space needed for the new leaf entry, now in use.
316 xfs_dir2_data_use_free(tp
, bp
, enddup
,
317 (xfs_dir2_data_aoff_t
)
318 ((char *)enddup
- (char *)hdr
+ be16_to_cpu(enddup
->length
) -
320 (xfs_dir2_data_aoff_t
)sizeof(*blp
),
321 &needlog
, &needscan
);
323 * Update the tail (entry count).
325 be32_add_cpu(&btp
->count
, 1);
327 * If we now need to rebuild the bestfree map, do so.
328 * This needs to happen before the next call to use_free.
331 xfs_dir2_data_freescan(mp
, hdr
, &needlog
);
335 * Adjust pointer to the first leaf entry, we're about to move
336 * the table up one to open up space for the new leaf entry.
337 * Then adjust our index to match.
342 memmove(blp
, &blp
[1], mid
* sizeof(*blp
));
347 * Use a stale leaf for our new entry.
352 blp
[lowstale
].address
!=
353 cpu_to_be32(XFS_DIR2_NULL_DATAPTR
);
356 for (highstale
= mid
+ 1;
357 highstale
< be32_to_cpu(btp
->count
) &&
358 blp
[highstale
].address
!=
359 cpu_to_be32(XFS_DIR2_NULL_DATAPTR
) &&
360 (lowstale
< 0 || mid
- lowstale
> highstale
- mid
);
364 * Move entries toward the low-numbered stale entry.
367 (highstale
== be32_to_cpu(btp
->count
) ||
368 mid
- lowstale
<= highstale
- mid
)) {
370 memmove(&blp
[lowstale
], &blp
[lowstale
+ 1],
371 (mid
- lowstale
) * sizeof(*blp
));
372 lfloglow
= MIN(lowstale
, lfloglow
);
373 lfloghigh
= MAX(mid
, lfloghigh
);
376 * Move entries toward the high-numbered stale entry.
379 ASSERT(highstale
< be32_to_cpu(btp
->count
));
382 memmove(&blp
[mid
+ 1], &blp
[mid
],
383 (highstale
- mid
) * sizeof(*blp
));
384 lfloglow
= MIN(mid
, lfloglow
);
385 lfloghigh
= MAX(highstale
, lfloghigh
);
387 be32_add_cpu(&btp
->stale
, -1);
390 * Point to the new data entry.
392 dep
= (xfs_dir2_data_entry_t
*)dup
;
394 * Fill in the leaf entry.
396 blp
[mid
].hashval
= cpu_to_be32(args
->hashval
);
397 blp
[mid
].address
= cpu_to_be32(xfs_dir2_byte_to_dataptr(mp
,
398 (char *)dep
- (char *)hdr
));
399 xfs_dir2_block_log_leaf(tp
, bp
, lfloglow
, lfloghigh
);
401 * Mark space for the data entry used.
403 xfs_dir2_data_use_free(tp
, bp
, dup
,
404 (xfs_dir2_data_aoff_t
)((char *)dup
- (char *)hdr
),
405 (xfs_dir2_data_aoff_t
)len
, &needlog
, &needscan
);
407 * Create the new data entry.
409 dep
->inumber
= cpu_to_be64(args
->inumber
);
410 dep
->namelen
= args
->namelen
;
411 memcpy(dep
->name
, args
->name
, args
->namelen
);
412 tagp
= xfs_dir2_data_entry_tag_p(dep
);
413 *tagp
= cpu_to_be16((char *)dep
- (char *)hdr
);
415 * Clean up the bestfree array and log the header, tail, and entry.
418 xfs_dir2_data_freescan(mp
, hdr
, &needlog
);
420 xfs_dir2_data_log_header(tp
, bp
);
421 xfs_dir2_block_log_tail(tp
, bp
);
422 xfs_dir2_data_log_entry(tp
, bp
, dep
);
423 xfs_dir2_data_check(dp
, bp
);
428 * Readdir for block directories.
431 xfs_dir2_block_getdents(
432 xfs_inode_t
*dp
, /* incore inode */
437 xfs_dir2_data_hdr_t
*hdr
; /* block header */
438 struct xfs_buf
*bp
; /* buffer for block */
439 xfs_dir2_block_tail_t
*btp
; /* block tail */
440 xfs_dir2_data_entry_t
*dep
; /* block data entry */
441 xfs_dir2_data_unused_t
*dup
; /* block unused entry */
442 char *endptr
; /* end of the data entries */
443 int error
; /* error return value */
444 xfs_mount_t
*mp
; /* filesystem mount point */
445 char *ptr
; /* current data entry */
446 int wantoff
; /* starting block offset */
451 * If the block number in the offset is out of range, we're done.
453 if (xfs_dir2_dataptr_to_db(mp
, *offset
) > mp
->m_dirdatablk
) {
457 * Can't read the block, give up, else get dabuf in bp.
459 error
= xfs_da_read_buf(NULL
, dp
, mp
->m_dirdatablk
, -1,
466 * Extract the byte offset we start at from the seek pointer.
467 * We'll skip entries before this.
469 wantoff
= xfs_dir2_dataptr_to_off(mp
, *offset
);
471 xfs_dir2_data_check(dp
, bp
);
473 * Set up values for the loop.
475 btp
= xfs_dir2_block_tail_p(mp
, hdr
);
476 ptr
= (char *)(hdr
+ 1);
477 endptr
= (char *)xfs_dir2_block_leaf_p(btp
);
480 * Loop over the data portion of the block.
481 * Each object is a real entry (dep) or an unused one (dup).
483 while (ptr
< endptr
) {
484 dup
= (xfs_dir2_data_unused_t
*)ptr
;
488 if (be16_to_cpu(dup
->freetag
) == XFS_DIR2_DATA_FREE_TAG
) {
489 ptr
+= be16_to_cpu(dup
->length
);
493 dep
= (xfs_dir2_data_entry_t
*)ptr
;
496 * Bump pointer for the next iteration.
498 ptr
+= xfs_dir2_data_entsize(dep
->namelen
);
500 * The entry is before the desired starting point, skip it.
502 if ((char *)dep
- (char *)hdr
< wantoff
)
505 cook
= xfs_dir2_db_off_to_dataptr(mp
, mp
->m_dirdatablk
,
506 (char *)dep
- (char *)hdr
);
509 * If it didn't fit, set the final offset to here & return.
511 if (filldir(dirent
, (char *)dep
->name
, dep
->namelen
,
512 cook
& 0x7fffffff, be64_to_cpu(dep
->inumber
),
514 *offset
= cook
& 0x7fffffff;
515 xfs_trans_brelse(NULL
, bp
);
521 * Reached the end of the block.
522 * Set the offset to a non-existent block 1 and return.
524 *offset
= xfs_dir2_db_off_to_dataptr(mp
, mp
->m_dirdatablk
+ 1, 0) &
526 xfs_trans_brelse(NULL
, bp
);
531 * Log leaf entries from the block.
534 xfs_dir2_block_log_leaf(
535 xfs_trans_t
*tp
, /* transaction structure */
536 struct xfs_buf
*bp
, /* block buffer */
537 int first
, /* index of first logged leaf */
538 int last
) /* index of last logged leaf */
540 xfs_dir2_data_hdr_t
*hdr
= bp
->b_addr
;
541 xfs_dir2_leaf_entry_t
*blp
;
542 xfs_dir2_block_tail_t
*btp
;
544 btp
= xfs_dir2_block_tail_p(tp
->t_mountp
, hdr
);
545 blp
= xfs_dir2_block_leaf_p(btp
);
546 xfs_trans_log_buf(tp
, bp
, (uint
)((char *)&blp
[first
] - (char *)hdr
),
547 (uint
)((char *)&blp
[last
+ 1] - (char *)hdr
- 1));
551 * Log the block tail.
554 xfs_dir2_block_log_tail(
555 xfs_trans_t
*tp
, /* transaction structure */
556 struct xfs_buf
*bp
) /* block buffer */
558 xfs_dir2_data_hdr_t
*hdr
= bp
->b_addr
;
559 xfs_dir2_block_tail_t
*btp
;
561 btp
= xfs_dir2_block_tail_p(tp
->t_mountp
, hdr
);
562 xfs_trans_log_buf(tp
, bp
, (uint
)((char *)btp
- (char *)hdr
),
563 (uint
)((char *)(btp
+ 1) - (char *)hdr
- 1));
567 * Look up an entry in the block. This is the external routine,
568 * xfs_dir2_block_lookup_int does the real work.
571 xfs_dir2_block_lookup(
572 xfs_da_args_t
*args
) /* dir lookup arguments */
574 xfs_dir2_data_hdr_t
*hdr
; /* block header */
575 xfs_dir2_leaf_entry_t
*blp
; /* block leaf entries */
576 struct xfs_buf
*bp
; /* block buffer */
577 xfs_dir2_block_tail_t
*btp
; /* block tail */
578 xfs_dir2_data_entry_t
*dep
; /* block data entry */
579 xfs_inode_t
*dp
; /* incore inode */
580 int ent
; /* entry index */
581 int error
; /* error return value */
582 xfs_mount_t
*mp
; /* filesystem mount point */
584 trace_xfs_dir2_block_lookup(args
);
587 * Get the buffer, look up the entry.
588 * If not found (ENOENT) then return, have no buffer.
590 if ((error
= xfs_dir2_block_lookup_int(args
, &bp
, &ent
)))
595 xfs_dir2_data_check(dp
, bp
);
596 btp
= xfs_dir2_block_tail_p(mp
, hdr
);
597 blp
= xfs_dir2_block_leaf_p(btp
);
599 * Get the offset from the leaf entry, to point to the data.
601 dep
= (xfs_dir2_data_entry_t
*)((char *)hdr
+
602 xfs_dir2_dataptr_to_off(mp
, be32_to_cpu(blp
[ent
].address
)));
604 * Fill in inode number, CI name if appropriate, release the block.
606 args
->inumber
= be64_to_cpu(dep
->inumber
);
607 error
= xfs_dir_cilookup_result(args
, dep
->name
, dep
->namelen
);
608 xfs_trans_brelse(args
->trans
, bp
);
609 return XFS_ERROR(error
);
613 * Internal block lookup routine.
615 static int /* error */
616 xfs_dir2_block_lookup_int(
617 xfs_da_args_t
*args
, /* dir lookup arguments */
618 struct xfs_buf
**bpp
, /* returned block buffer */
619 int *entno
) /* returned entry number */
621 xfs_dir2_dataptr_t addr
; /* data entry address */
622 xfs_dir2_data_hdr_t
*hdr
; /* block header */
623 xfs_dir2_leaf_entry_t
*blp
; /* block leaf entries */
624 struct xfs_buf
*bp
; /* block buffer */
625 xfs_dir2_block_tail_t
*btp
; /* block tail */
626 xfs_dir2_data_entry_t
*dep
; /* block data entry */
627 xfs_inode_t
*dp
; /* incore inode */
628 int error
; /* error return value */
629 xfs_dahash_t hash
; /* found hash value */
630 int high
; /* binary search high index */
631 int low
; /* binary search low index */
632 int mid
; /* binary search current idx */
633 xfs_mount_t
*mp
; /* filesystem mount point */
634 xfs_trans_t
*tp
; /* transaction pointer */
635 enum xfs_dacmp cmp
; /* comparison result */
641 * Read the buffer, return error if we can't get it.
644 xfs_da_read_buf(tp
, dp
, mp
->m_dirdatablk
, -1, &bp
, XFS_DATA_FORK
))) {
649 xfs_dir2_data_check(dp
, bp
);
650 btp
= xfs_dir2_block_tail_p(mp
, hdr
);
651 blp
= xfs_dir2_block_leaf_p(btp
);
653 * Loop doing a binary search for our hash value.
654 * Find our entry, ENOENT if it's not there.
656 for (low
= 0, high
= be32_to_cpu(btp
->count
) - 1; ; ) {
658 mid
= (low
+ high
) >> 1;
659 if ((hash
= be32_to_cpu(blp
[mid
].hashval
)) == args
->hashval
)
661 if (hash
< args
->hashval
)
666 ASSERT(args
->op_flags
& XFS_DA_OP_OKNOENT
);
667 xfs_trans_brelse(tp
, bp
);
668 return XFS_ERROR(ENOENT
);
672 * Back up to the first one with the right hash value.
674 while (mid
> 0 && be32_to_cpu(blp
[mid
- 1].hashval
) == args
->hashval
) {
678 * Now loop forward through all the entries with the
679 * right hash value looking for our name.
682 if ((addr
= be32_to_cpu(blp
[mid
].address
)) == XFS_DIR2_NULL_DATAPTR
)
685 * Get pointer to the entry from the leaf.
687 dep
= (xfs_dir2_data_entry_t
*)
688 ((char *)hdr
+ xfs_dir2_dataptr_to_off(mp
, addr
));
690 * Compare name and if it's an exact match, return the index
691 * and buffer. If it's the first case-insensitive match, store
692 * the index and buffer and continue looking for an exact match.
694 cmp
= mp
->m_dirnameops
->compname(args
, dep
->name
, dep
->namelen
);
695 if (cmp
!= XFS_CMP_DIFFERENT
&& cmp
!= args
->cmpresult
) {
696 args
->cmpresult
= cmp
;
699 if (cmp
== XFS_CMP_EXACT
)
702 } while (++mid
< be32_to_cpu(btp
->count
) &&
703 be32_to_cpu(blp
[mid
].hashval
) == hash
);
705 ASSERT(args
->op_flags
& XFS_DA_OP_OKNOENT
);
707 * Here, we can only be doing a lookup (not a rename or replace).
708 * If a case-insensitive match was found earlier, return success.
710 if (args
->cmpresult
== XFS_CMP_CASE
)
713 * No match, release the buffer and return ENOENT.
715 xfs_trans_brelse(tp
, bp
);
716 return XFS_ERROR(ENOENT
);
720 * Remove an entry from a block format directory.
721 * If that makes the block small enough to fit in shortform, transform it.
724 xfs_dir2_block_removename(
725 xfs_da_args_t
*args
) /* directory operation args */
727 xfs_dir2_data_hdr_t
*hdr
; /* block header */
728 xfs_dir2_leaf_entry_t
*blp
; /* block leaf pointer */
729 struct xfs_buf
*bp
; /* block buffer */
730 xfs_dir2_block_tail_t
*btp
; /* block tail */
731 xfs_dir2_data_entry_t
*dep
; /* block data entry */
732 xfs_inode_t
*dp
; /* incore inode */
733 int ent
; /* block leaf entry index */
734 int error
; /* error return value */
735 xfs_mount_t
*mp
; /* filesystem mount point */
736 int needlog
; /* need to log block header */
737 int needscan
; /* need to fixup bestfree */
738 xfs_dir2_sf_hdr_t sfh
; /* shortform header */
739 int size
; /* shortform size */
740 xfs_trans_t
*tp
; /* transaction pointer */
742 trace_xfs_dir2_block_removename(args
);
745 * Look up the entry in the block. Gets the buffer and entry index.
746 * It will always be there, the vnodeops level does a lookup first.
748 if ((error
= xfs_dir2_block_lookup_int(args
, &bp
, &ent
))) {
755 btp
= xfs_dir2_block_tail_p(mp
, hdr
);
756 blp
= xfs_dir2_block_leaf_p(btp
);
758 * Point to the data entry using the leaf entry.
760 dep
= (xfs_dir2_data_entry_t
*)
761 ((char *)hdr
+ xfs_dir2_dataptr_to_off(mp
, be32_to_cpu(blp
[ent
].address
)));
763 * Mark the data entry's space free.
765 needlog
= needscan
= 0;
766 xfs_dir2_data_make_free(tp
, bp
,
767 (xfs_dir2_data_aoff_t
)((char *)dep
- (char *)hdr
),
768 xfs_dir2_data_entsize(dep
->namelen
), &needlog
, &needscan
);
770 * Fix up the block tail.
772 be32_add_cpu(&btp
->stale
, 1);
773 xfs_dir2_block_log_tail(tp
, bp
);
775 * Remove the leaf entry by marking it stale.
777 blp
[ent
].address
= cpu_to_be32(XFS_DIR2_NULL_DATAPTR
);
778 xfs_dir2_block_log_leaf(tp
, bp
, ent
, ent
);
780 * Fix up bestfree, log the header if necessary.
783 xfs_dir2_data_freescan(mp
, hdr
, &needlog
);
785 xfs_dir2_data_log_header(tp
, bp
);
786 xfs_dir2_data_check(dp
, bp
);
788 * See if the size as a shortform is good enough.
790 size
= xfs_dir2_block_sfsize(dp
, hdr
, &sfh
);
791 if (size
> XFS_IFORK_DSIZE(dp
))
795 * If it works, do the conversion.
797 return xfs_dir2_block_to_sf(args
, bp
, size
, &sfh
);
801 * Replace an entry in a V2 block directory.
802 * Change the inode number to the new value.
805 xfs_dir2_block_replace(
806 xfs_da_args_t
*args
) /* directory operation args */
808 xfs_dir2_data_hdr_t
*hdr
; /* block header */
809 xfs_dir2_leaf_entry_t
*blp
; /* block leaf entries */
810 struct xfs_buf
*bp
; /* block buffer */
811 xfs_dir2_block_tail_t
*btp
; /* block tail */
812 xfs_dir2_data_entry_t
*dep
; /* block data entry */
813 xfs_inode_t
*dp
; /* incore inode */
814 int ent
; /* leaf entry index */
815 int error
; /* error return value */
816 xfs_mount_t
*mp
; /* filesystem mount point */
818 trace_xfs_dir2_block_replace(args
);
821 * Lookup the entry in the directory. Get buffer and entry index.
822 * This will always succeed since the caller has already done a lookup.
824 if ((error
= xfs_dir2_block_lookup_int(args
, &bp
, &ent
))) {
830 btp
= xfs_dir2_block_tail_p(mp
, hdr
);
831 blp
= xfs_dir2_block_leaf_p(btp
);
833 * Point to the data entry we need to change.
835 dep
= (xfs_dir2_data_entry_t
*)
836 ((char *)hdr
+ xfs_dir2_dataptr_to_off(mp
, be32_to_cpu(blp
[ent
].address
)));
837 ASSERT(be64_to_cpu(dep
->inumber
) != args
->inumber
);
839 * Change the inode number to the new value.
841 dep
->inumber
= cpu_to_be64(args
->inumber
);
842 xfs_dir2_data_log_entry(args
->trans
, bp
, dep
);
843 xfs_dir2_data_check(dp
, bp
);
848 * Qsort comparison routine for the block leaf entries.
850 static int /* sort order */
852 const void *a
, /* first leaf entry */
853 const void *b
) /* second leaf entry */
855 const xfs_dir2_leaf_entry_t
*la
; /* first leaf entry */
856 const xfs_dir2_leaf_entry_t
*lb
; /* second leaf entry */
860 return be32_to_cpu(la
->hashval
) < be32_to_cpu(lb
->hashval
) ? -1 :
861 (be32_to_cpu(la
->hashval
) > be32_to_cpu(lb
->hashval
) ? 1 : 0);
865 * Convert a V2 leaf directory to a V2 block directory if possible.
868 xfs_dir2_leaf_to_block(
869 xfs_da_args_t
*args
, /* operation arguments */
870 struct xfs_buf
*lbp
, /* leaf buffer */
871 struct xfs_buf
*dbp
) /* data buffer */
873 __be16
*bestsp
; /* leaf bests table */
874 xfs_dir2_data_hdr_t
*hdr
; /* block header */
875 xfs_dir2_block_tail_t
*btp
; /* block tail */
876 xfs_inode_t
*dp
; /* incore directory inode */
877 xfs_dir2_data_unused_t
*dup
; /* unused data entry */
878 int error
; /* error return value */
879 int from
; /* leaf from index */
880 xfs_dir2_leaf_t
*leaf
; /* leaf structure */
881 xfs_dir2_leaf_entry_t
*lep
; /* leaf entry */
882 xfs_dir2_leaf_tail_t
*ltp
; /* leaf tail structure */
883 xfs_mount_t
*mp
; /* file system mount point */
884 int needlog
; /* need to log data header */
885 int needscan
; /* need to scan for bestfree */
886 xfs_dir2_sf_hdr_t sfh
; /* shortform header */
887 int size
; /* bytes used */
888 __be16
*tagp
; /* end of entry (tag) */
889 int to
; /* block/leaf to index */
890 xfs_trans_t
*tp
; /* transaction pointer */
892 trace_xfs_dir2_leaf_to_block(args
);
898 ASSERT(leaf
->hdr
.info
.magic
== cpu_to_be16(XFS_DIR2_LEAF1_MAGIC
));
899 ltp
= xfs_dir2_leaf_tail_p(mp
, leaf
);
901 * If there are data blocks other than the first one, take this
902 * opportunity to remove trailing empty data blocks that may have
903 * been left behind during no-space-reservation operations.
904 * These will show up in the leaf bests table.
906 while (dp
->i_d
.di_size
> mp
->m_dirblksize
) {
907 bestsp
= xfs_dir2_leaf_bests_p(ltp
);
908 if (be16_to_cpu(bestsp
[be32_to_cpu(ltp
->bestcount
) - 1]) ==
909 mp
->m_dirblksize
- (uint
)sizeof(*hdr
)) {
911 xfs_dir2_leaf_trim_data(args
, lbp
,
912 (xfs_dir2_db_t
)(be32_to_cpu(ltp
->bestcount
) - 1))))
918 * Read the data block if we don't already have it, give up if it fails.
921 (error
= xfs_da_read_buf(tp
, dp
, mp
->m_dirdatablk
, -1, &dbp
,
926 ASSERT(hdr
->magic
== cpu_to_be32(XFS_DIR2_DATA_MAGIC
));
928 * Size of the "leaf" area in the block.
930 size
= (uint
)sizeof(xfs_dir2_block_tail_t
) +
931 (uint
)sizeof(*lep
) * (be16_to_cpu(leaf
->hdr
.count
) - be16_to_cpu(leaf
->hdr
.stale
));
933 * Look at the last data entry.
935 tagp
= (__be16
*)((char *)hdr
+ mp
->m_dirblksize
) - 1;
936 dup
= (xfs_dir2_data_unused_t
*)((char *)hdr
+ be16_to_cpu(*tagp
));
938 * If it's not free or is too short we can't do it.
940 if (be16_to_cpu(dup
->freetag
) != XFS_DIR2_DATA_FREE_TAG
||
941 be16_to_cpu(dup
->length
) < size
)
945 * Start converting it to block form.
947 hdr
->magic
= cpu_to_be32(XFS_DIR2_BLOCK_MAGIC
);
951 * Use up the space at the end of the block (blp/btp).
953 xfs_dir2_data_use_free(tp
, dbp
, dup
, mp
->m_dirblksize
- size
, size
,
954 &needlog
, &needscan
);
956 * Initialize the block tail.
958 btp
= xfs_dir2_block_tail_p(mp
, hdr
);
959 btp
->count
= cpu_to_be32(be16_to_cpu(leaf
->hdr
.count
) - be16_to_cpu(leaf
->hdr
.stale
));
961 xfs_dir2_block_log_tail(tp
, dbp
);
963 * Initialize the block leaf area. We compact out stale entries.
965 lep
= xfs_dir2_block_leaf_p(btp
);
966 for (from
= to
= 0; from
< be16_to_cpu(leaf
->hdr
.count
); from
++) {
967 if (leaf
->ents
[from
].address
==
968 cpu_to_be32(XFS_DIR2_NULL_DATAPTR
))
970 lep
[to
++] = leaf
->ents
[from
];
972 ASSERT(to
== be32_to_cpu(btp
->count
));
973 xfs_dir2_block_log_leaf(tp
, dbp
, 0, be32_to_cpu(btp
->count
) - 1);
975 * Scan the bestfree if we need it and log the data block header.
978 xfs_dir2_data_freescan(mp
, hdr
, &needlog
);
980 xfs_dir2_data_log_header(tp
, dbp
);
982 * Pitch the old leaf block.
984 error
= xfs_da_shrink_inode(args
, mp
->m_dirleafblk
, lbp
);
989 * Now see if the resulting block can be shrunken to shortform.
991 size
= xfs_dir2_block_sfsize(dp
, hdr
, &sfh
);
992 if (size
> XFS_IFORK_DSIZE(dp
))
995 return xfs_dir2_block_to_sf(args
, dbp
, size
, &sfh
);
999 * Convert the shortform directory to block form.
1002 xfs_dir2_sf_to_block(
1003 xfs_da_args_t
*args
) /* operation arguments */
1005 xfs_dir2_db_t blkno
; /* dir-relative block # (0) */
1006 xfs_dir2_data_hdr_t
*hdr
; /* block header */
1007 xfs_dir2_leaf_entry_t
*blp
; /* block leaf entries */
1008 struct xfs_buf
*bp
; /* block buffer */
1009 xfs_dir2_block_tail_t
*btp
; /* block tail pointer */
1010 xfs_dir2_data_entry_t
*dep
; /* data entry pointer */
1011 xfs_inode_t
*dp
; /* incore directory inode */
1012 int dummy
; /* trash */
1013 xfs_dir2_data_unused_t
*dup
; /* unused entry pointer */
1014 int endoffset
; /* end of data objects */
1015 int error
; /* error return value */
1017 xfs_mount_t
*mp
; /* filesystem mount point */
1018 int needlog
; /* need to log block header */
1019 int needscan
; /* need to scan block freespc */
1020 int newoffset
; /* offset from current entry */
1021 int offset
; /* target block offset */
1022 xfs_dir2_sf_entry_t
*sfep
; /* sf entry pointer */
1023 xfs_dir2_sf_hdr_t
*oldsfp
; /* old shortform header */
1024 xfs_dir2_sf_hdr_t
*sfp
; /* shortform header */
1025 __be16
*tagp
; /* end of data entry */
1026 xfs_trans_t
*tp
; /* transaction pointer */
1027 struct xfs_name name
;
1029 trace_xfs_dir2_sf_to_block(args
);
1034 ASSERT(dp
->i_df
.if_flags
& XFS_IFINLINE
);
1036 * Bomb out if the shortform directory is way too short.
1038 if (dp
->i_d
.di_size
< offsetof(xfs_dir2_sf_hdr_t
, parent
)) {
1039 ASSERT(XFS_FORCED_SHUTDOWN(mp
));
1040 return XFS_ERROR(EIO
);
1043 oldsfp
= (xfs_dir2_sf_hdr_t
*)dp
->i_df
.if_u1
.if_data
;
1045 ASSERT(dp
->i_df
.if_bytes
== dp
->i_d
.di_size
);
1046 ASSERT(dp
->i_df
.if_u1
.if_data
!= NULL
);
1047 ASSERT(dp
->i_d
.di_size
>= xfs_dir2_sf_hdr_size(oldsfp
->i8count
));
1050 * Copy the directory into a temporary buffer.
1051 * Then pitch the incore inode data so we can make extents.
1053 sfp
= kmem_alloc(dp
->i_df
.if_bytes
, KM_SLEEP
);
1054 memcpy(sfp
, oldsfp
, dp
->i_df
.if_bytes
);
1056 xfs_idata_realloc(dp
, -dp
->i_df
.if_bytes
, XFS_DATA_FORK
);
1057 dp
->i_d
.di_size
= 0;
1058 xfs_trans_log_inode(tp
, dp
, XFS_ILOG_CORE
);
1061 * Add block 0 to the inode.
1063 error
= xfs_dir2_grow_inode(args
, XFS_DIR2_DATA_SPACE
, &blkno
);
1069 * Initialize the data block.
1071 error
= xfs_dir2_data_init(args
, blkno
, &bp
);
1077 hdr
->magic
= cpu_to_be32(XFS_DIR2_BLOCK_MAGIC
);
1079 * Compute size of block "tail" area.
1081 i
= (uint
)sizeof(*btp
) +
1082 (sfp
->count
+ 2) * (uint
)sizeof(xfs_dir2_leaf_entry_t
);
1084 * The whole thing is initialized to free by the init routine.
1085 * Say we're using the leaf and tail area.
1087 dup
= (xfs_dir2_data_unused_t
*)(hdr
+ 1);
1088 needlog
= needscan
= 0;
1089 xfs_dir2_data_use_free(tp
, bp
, dup
, mp
->m_dirblksize
- i
, i
, &needlog
,
1091 ASSERT(needscan
== 0);
1095 btp
= xfs_dir2_block_tail_p(mp
, hdr
);
1096 btp
->count
= cpu_to_be32(sfp
->count
+ 2); /* ., .. */
1098 blp
= xfs_dir2_block_leaf_p(btp
);
1099 endoffset
= (uint
)((char *)blp
- (char *)hdr
);
1101 * Remove the freespace, we'll manage it.
1103 xfs_dir2_data_use_free(tp
, bp
, dup
,
1104 (xfs_dir2_data_aoff_t
)((char *)dup
- (char *)hdr
),
1105 be16_to_cpu(dup
->length
), &needlog
, &needscan
);
1107 * Create entry for .
1109 dep
= (xfs_dir2_data_entry_t
*)
1110 ((char *)hdr
+ XFS_DIR2_DATA_DOT_OFFSET
);
1111 dep
->inumber
= cpu_to_be64(dp
->i_ino
);
1114 tagp
= xfs_dir2_data_entry_tag_p(dep
);
1115 *tagp
= cpu_to_be16((char *)dep
- (char *)hdr
);
1116 xfs_dir2_data_log_entry(tp
, bp
, dep
);
1117 blp
[0].hashval
= cpu_to_be32(xfs_dir_hash_dot
);
1118 blp
[0].address
= cpu_to_be32(xfs_dir2_byte_to_dataptr(mp
,
1119 (char *)dep
- (char *)hdr
));
1121 * Create entry for ..
1123 dep
= (xfs_dir2_data_entry_t
*)
1124 ((char *)hdr
+ XFS_DIR2_DATA_DOTDOT_OFFSET
);
1125 dep
->inumber
= cpu_to_be64(xfs_dir2_sf_get_parent_ino(sfp
));
1127 dep
->name
[0] = dep
->name
[1] = '.';
1128 tagp
= xfs_dir2_data_entry_tag_p(dep
);
1129 *tagp
= cpu_to_be16((char *)dep
- (char *)hdr
);
1130 xfs_dir2_data_log_entry(tp
, bp
, dep
);
1131 blp
[1].hashval
= cpu_to_be32(xfs_dir_hash_dotdot
);
1132 blp
[1].address
= cpu_to_be32(xfs_dir2_byte_to_dataptr(mp
,
1133 (char *)dep
- (char *)hdr
));
1134 offset
= XFS_DIR2_DATA_FIRST_OFFSET
;
1136 * Loop over existing entries, stuff them in.
1142 sfep
= xfs_dir2_sf_firstentry(sfp
);
1144 * Need to preserve the existing offset values in the sf directory.
1145 * Insert holes (unused entries) where necessary.
1147 while (offset
< endoffset
) {
1149 * sfep is null when we reach the end of the list.
1152 newoffset
= endoffset
;
1154 newoffset
= xfs_dir2_sf_get_offset(sfep
);
1156 * There should be a hole here, make one.
1158 if (offset
< newoffset
) {
1159 dup
= (xfs_dir2_data_unused_t
*)((char *)hdr
+ offset
);
1160 dup
->freetag
= cpu_to_be16(XFS_DIR2_DATA_FREE_TAG
);
1161 dup
->length
= cpu_to_be16(newoffset
- offset
);
1162 *xfs_dir2_data_unused_tag_p(dup
) = cpu_to_be16(
1163 ((char *)dup
- (char *)hdr
));
1164 xfs_dir2_data_log_unused(tp
, bp
, dup
);
1165 xfs_dir2_data_freeinsert(hdr
, dup
, &dummy
);
1166 offset
+= be16_to_cpu(dup
->length
);
1170 * Copy a real entry.
1172 dep
= (xfs_dir2_data_entry_t
*)((char *)hdr
+ newoffset
);
1173 dep
->inumber
= cpu_to_be64(xfs_dir2_sfe_get_ino(sfp
, sfep
));
1174 dep
->namelen
= sfep
->namelen
;
1175 memcpy(dep
->name
, sfep
->name
, dep
->namelen
);
1176 tagp
= xfs_dir2_data_entry_tag_p(dep
);
1177 *tagp
= cpu_to_be16((char *)dep
- (char *)hdr
);
1178 xfs_dir2_data_log_entry(tp
, bp
, dep
);
1179 name
.name
= sfep
->name
;
1180 name
.len
= sfep
->namelen
;
1181 blp
[2 + i
].hashval
= cpu_to_be32(mp
->m_dirnameops
->
1183 blp
[2 + i
].address
= cpu_to_be32(xfs_dir2_byte_to_dataptr(mp
,
1184 (char *)dep
- (char *)hdr
));
1185 offset
= (int)((char *)(tagp
+ 1) - (char *)hdr
);
1186 if (++i
== sfp
->count
)
1189 sfep
= xfs_dir2_sf_nextentry(sfp
, sfep
);
1191 /* Done with the temporary buffer */
1194 * Sort the leaf entries by hash value.
1196 xfs_sort(blp
, be32_to_cpu(btp
->count
), sizeof(*blp
), xfs_dir2_block_sort
);
1198 * Log the leaf entry area and tail.
1199 * Already logged the header in data_init, ignore needlog.
1201 ASSERT(needscan
== 0);
1202 xfs_dir2_block_log_leaf(tp
, bp
, 0, be32_to_cpu(btp
->count
) - 1);
1203 xfs_dir2_block_log_tail(tp
, bp
);
1204 xfs_dir2_data_check(dp
, bp
);