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 xfs_dir2_block_verify(
63 struct xfs_mount
*mp
= bp
->b_target
->bt_mount
;
64 struct xfs_dir2_data_hdr
*hdr
= bp
->b_addr
;
67 block_ok
= hdr
->magic
== cpu_to_be32(XFS_DIR2_BLOCK_MAGIC
);
68 block_ok
= block_ok
&& __xfs_dir2_data_check(NULL
, bp
) == 0;
71 XFS_CORRUPTION_ERROR(__func__
, XFS_ERRLEVEL_LOW
, mp
, hdr
);
72 xfs_buf_ioerror(bp
, EFSCORRUPTED
);
77 xfs_dir2_block_read_verify(
80 xfs_dir2_block_verify(bp
);
84 xfs_dir2_block_write_verify(
87 xfs_dir2_block_verify(bp
);
90 const struct xfs_buf_ops xfs_dir2_block_buf_ops
= {
91 .verify_read
= xfs_dir2_block_read_verify
,
92 .verify_write
= xfs_dir2_block_write_verify
,
101 struct xfs_mount
*mp
= dp
->i_mount
;
103 return xfs_da_read_buf(tp
, dp
, mp
->m_dirdatablk
, -1, bpp
,
104 XFS_DATA_FORK
, &xfs_dir2_block_buf_ops
);
108 xfs_dir2_block_need_space(
109 struct xfs_dir2_data_hdr
*hdr
,
110 struct xfs_dir2_block_tail
*btp
,
111 struct xfs_dir2_leaf_entry
*blp
,
113 struct xfs_dir2_data_unused
**dupp
,
114 struct xfs_dir2_data_unused
**enddupp
,
118 struct xfs_dir2_data_free
*bf
;
120 struct xfs_dir2_data_unused
*dup
= NULL
;
121 struct xfs_dir2_data_unused
*enddup
= NULL
;
127 * If there are stale entries we'll use one for the leaf.
130 if (be16_to_cpu(bf
[0].length
) >= len
) {
132 * The biggest entry enough to avoid compaction.
134 dup
= (xfs_dir2_data_unused_t
*)
135 ((char *)hdr
+ be16_to_cpu(bf
[0].offset
));
140 * Will need to compact to make this work.
141 * Tag just before the first leaf entry.
144 tagp
= (__be16
*)blp
- 1;
146 /* Data object just before the first leaf entry. */
147 dup
= (xfs_dir2_data_unused_t
*)((char *)hdr
+ be16_to_cpu(*tagp
));
150 * If it's not free then the data will go where the
151 * leaf data starts now, if it works at all.
153 if (be16_to_cpu(dup
->freetag
) == XFS_DIR2_DATA_FREE_TAG
) {
154 if (be16_to_cpu(dup
->length
) + (be32_to_cpu(btp
->stale
) - 1) *
155 (uint
)sizeof(*blp
) < len
)
157 } else if ((be32_to_cpu(btp
->stale
) - 1) * (uint
)sizeof(*blp
) < len
)
160 dup
= (xfs_dir2_data_unused_t
*)blp
;
165 * no stale entries, so just use free space.
166 * Tag just before the first leaf entry.
168 tagp
= (__be16
*)blp
- 1;
170 /* Data object just before the first leaf entry. */
171 enddup
= (xfs_dir2_data_unused_t
*)((char *)hdr
+ be16_to_cpu(*tagp
));
174 * If it's not free then can't do this add without cleaning up:
175 * the space before the first leaf entry needs to be free so it
176 * can be expanded to hold the pointer to the new entry.
178 if (be16_to_cpu(enddup
->freetag
) == XFS_DIR2_DATA_FREE_TAG
) {
180 * Check out the biggest freespace and see if it's the same one.
182 dup
= (xfs_dir2_data_unused_t
*)
183 ((char *)hdr
+ be16_to_cpu(bf
[0].offset
));
186 * Not the same free entry, just check its length.
188 if (be16_to_cpu(dup
->length
) < len
)
194 * It is the biggest freespace, can it hold the leaf too?
196 if (be16_to_cpu(dup
->length
) < len
+ (uint
)sizeof(*blp
)) {
198 * Yes, use the second-largest entry instead if it works.
200 if (be16_to_cpu(bf
[1].length
) >= len
)
201 dup
= (xfs_dir2_data_unused_t
*)
202 ((char *)hdr
+ be16_to_cpu(bf
[1].offset
));
214 * compact the leaf entries.
215 * Leave the highest-numbered stale entry stale.
216 * XXX should be the one closest to mid but mid is not yet computed.
219 xfs_dir2_block_compact(
220 struct xfs_trans
*tp
,
222 struct xfs_dir2_data_hdr
*hdr
,
223 struct xfs_dir2_block_tail
*btp
,
224 struct xfs_dir2_leaf_entry
*blp
,
229 int fromidx
; /* source leaf index */
230 int toidx
; /* target leaf index */
232 int highstale
; /* high stale index */
234 fromidx
= toidx
= be32_to_cpu(btp
->count
) - 1;
235 highstale
= *lfloghigh
= -1;
236 for (; fromidx
>= 0; fromidx
--) {
237 if (blp
[fromidx
].address
== cpu_to_be32(XFS_DIR2_NULL_DATAPTR
)) {
241 if (*lfloghigh
== -1)
247 blp
[toidx
] = blp
[fromidx
];
250 *lfloglow
= toidx
+ 1 - (be32_to_cpu(btp
->stale
) - 1);
251 *lfloghigh
-= be32_to_cpu(btp
->stale
) - 1;
252 be32_add_cpu(&btp
->count
, -(be32_to_cpu(btp
->stale
) - 1));
253 xfs_dir2_data_make_free(tp
, bp
,
254 (xfs_dir2_data_aoff_t
)((char *)blp
- (char *)hdr
),
255 (xfs_dir2_data_aoff_t
)((be32_to_cpu(btp
->stale
) - 1) * sizeof(*blp
)),
257 blp
+= be32_to_cpu(btp
->stale
) - 1;
258 btp
->stale
= cpu_to_be32(1);
260 * If we now need to rebuild the bestfree map, do so.
261 * This needs to happen before the next call to use_free.
264 xfs_dir2_data_freescan(tp
->t_mountp
, hdr
, needlog
);
268 * Add an entry to a block directory.
271 xfs_dir2_block_addname(
272 xfs_da_args_t
*args
) /* directory op arguments */
274 xfs_dir2_data_hdr_t
*hdr
; /* block header */
275 xfs_dir2_leaf_entry_t
*blp
; /* block leaf entries */
276 struct xfs_buf
*bp
; /* buffer for block */
277 xfs_dir2_block_tail_t
*btp
; /* block tail */
278 int compact
; /* need to compact leaf ents */
279 xfs_dir2_data_entry_t
*dep
; /* block data entry */
280 xfs_inode_t
*dp
; /* directory inode */
281 xfs_dir2_data_unused_t
*dup
; /* block unused entry */
282 int error
; /* error return value */
283 xfs_dir2_data_unused_t
*enddup
=NULL
; /* unused at end of data */
284 xfs_dahash_t hash
; /* hash value of found entry */
285 int high
; /* high index for binary srch */
286 int highstale
; /* high stale index */
287 int lfloghigh
=0; /* last final leaf to log */
288 int lfloglow
=0; /* first final leaf to log */
289 int len
; /* length of the new entry */
290 int low
; /* low index for binary srch */
291 int lowstale
; /* low stale index */
292 int mid
=0; /* midpoint for binary srch */
293 xfs_mount_t
*mp
; /* filesystem mount point */
294 int needlog
; /* need to log header */
295 int needscan
; /* need to rescan freespace */
296 __be16
*tagp
; /* pointer to tag value */
297 xfs_trans_t
*tp
; /* transaction structure */
299 trace_xfs_dir2_block_addname(args
);
305 /* Read the (one and only) directory block into bp. */
306 error
= xfs_dir2_block_read(tp
, dp
, &bp
);
310 len
= xfs_dir2_data_entsize(args
->namelen
);
313 * Set up pointers to parts of the block.
316 btp
= xfs_dir2_block_tail_p(mp
, hdr
);
317 blp
= xfs_dir2_block_leaf_p(btp
);
320 * Find out if we can reuse stale entries or whether we need extra
321 * space for entry and new leaf.
323 xfs_dir2_block_need_space(hdr
, btp
, blp
, &tagp
, &dup
,
324 &enddup
, &compact
, len
);
327 * Done everything we need for a space check now.
329 if (args
->op_flags
& XFS_DA_OP_JUSTCHECK
) {
330 xfs_trans_brelse(tp
, bp
);
332 return XFS_ERROR(ENOSPC
);
337 * If we don't have space for the new entry & leaf ...
340 /* Don't have a space reservation: return no-space. */
341 if (args
->total
== 0)
342 return XFS_ERROR(ENOSPC
);
344 * Convert to the next larger format.
345 * Then add the new entry in that format.
347 error
= xfs_dir2_block_to_leaf(args
, bp
);
350 return xfs_dir2_leaf_addname(args
);
353 needlog
= needscan
= 0;
356 * If need to compact the leaf entries, do it now.
359 xfs_dir2_block_compact(tp
, bp
, hdr
, btp
, blp
, &needlog
,
360 &lfloghigh
, &lfloglow
);
361 /* recalculate blp post-compaction */
362 blp
= xfs_dir2_block_leaf_p(btp
);
363 } else if (btp
->stale
) {
365 * Set leaf logging boundaries to impossible state.
366 * For the no-stale case they're set explicitly.
368 lfloglow
= be32_to_cpu(btp
->count
);
373 * Find the slot that's first lower than our hash value, -1 if none.
375 for (low
= 0, high
= be32_to_cpu(btp
->count
) - 1; low
<= high
; ) {
376 mid
= (low
+ high
) >> 1;
377 if ((hash
= be32_to_cpu(blp
[mid
].hashval
)) == args
->hashval
)
379 if (hash
< args
->hashval
)
384 while (mid
>= 0 && be32_to_cpu(blp
[mid
].hashval
) >= args
->hashval
) {
388 * No stale entries, will use enddup space to hold new leaf.
392 * Mark the space needed for the new leaf entry, now in use.
394 xfs_dir2_data_use_free(tp
, bp
, enddup
,
395 (xfs_dir2_data_aoff_t
)
396 ((char *)enddup
- (char *)hdr
+ be16_to_cpu(enddup
->length
) -
398 (xfs_dir2_data_aoff_t
)sizeof(*blp
),
399 &needlog
, &needscan
);
401 * Update the tail (entry count).
403 be32_add_cpu(&btp
->count
, 1);
405 * If we now need to rebuild the bestfree map, do so.
406 * This needs to happen before the next call to use_free.
409 xfs_dir2_data_freescan(mp
, hdr
, &needlog
);
413 * Adjust pointer to the first leaf entry, we're about to move
414 * the table up one to open up space for the new leaf entry.
415 * Then adjust our index to match.
420 memmove(blp
, &blp
[1], mid
* sizeof(*blp
));
425 * Use a stale leaf for our new entry.
430 blp
[lowstale
].address
!=
431 cpu_to_be32(XFS_DIR2_NULL_DATAPTR
);
434 for (highstale
= mid
+ 1;
435 highstale
< be32_to_cpu(btp
->count
) &&
436 blp
[highstale
].address
!=
437 cpu_to_be32(XFS_DIR2_NULL_DATAPTR
) &&
438 (lowstale
< 0 || mid
- lowstale
> highstale
- mid
);
442 * Move entries toward the low-numbered stale entry.
445 (highstale
== be32_to_cpu(btp
->count
) ||
446 mid
- lowstale
<= highstale
- mid
)) {
448 memmove(&blp
[lowstale
], &blp
[lowstale
+ 1],
449 (mid
- lowstale
) * sizeof(*blp
));
450 lfloglow
= MIN(lowstale
, lfloglow
);
451 lfloghigh
= MAX(mid
, lfloghigh
);
454 * Move entries toward the high-numbered stale entry.
457 ASSERT(highstale
< be32_to_cpu(btp
->count
));
460 memmove(&blp
[mid
+ 1], &blp
[mid
],
461 (highstale
- mid
) * sizeof(*blp
));
462 lfloglow
= MIN(mid
, lfloglow
);
463 lfloghigh
= MAX(highstale
, lfloghigh
);
465 be32_add_cpu(&btp
->stale
, -1);
468 * Point to the new data entry.
470 dep
= (xfs_dir2_data_entry_t
*)dup
;
472 * Fill in the leaf entry.
474 blp
[mid
].hashval
= cpu_to_be32(args
->hashval
);
475 blp
[mid
].address
= cpu_to_be32(xfs_dir2_byte_to_dataptr(mp
,
476 (char *)dep
- (char *)hdr
));
477 xfs_dir2_block_log_leaf(tp
, bp
, lfloglow
, lfloghigh
);
479 * Mark space for the data entry used.
481 xfs_dir2_data_use_free(tp
, bp
, dup
,
482 (xfs_dir2_data_aoff_t
)((char *)dup
- (char *)hdr
),
483 (xfs_dir2_data_aoff_t
)len
, &needlog
, &needscan
);
485 * Create the new data entry.
487 dep
->inumber
= cpu_to_be64(args
->inumber
);
488 dep
->namelen
= args
->namelen
;
489 memcpy(dep
->name
, args
->name
, args
->namelen
);
490 tagp
= xfs_dir2_data_entry_tag_p(dep
);
491 *tagp
= cpu_to_be16((char *)dep
- (char *)hdr
);
493 * Clean up the bestfree array and log the header, tail, and entry.
496 xfs_dir2_data_freescan(mp
, hdr
, &needlog
);
498 xfs_dir2_data_log_header(tp
, bp
);
499 xfs_dir2_block_log_tail(tp
, bp
);
500 xfs_dir2_data_log_entry(tp
, bp
, dep
);
501 xfs_dir2_data_check(dp
, bp
);
506 * Readdir for block directories.
509 xfs_dir2_block_getdents(
510 xfs_inode_t
*dp
, /* incore inode */
515 xfs_dir2_data_hdr_t
*hdr
; /* block header */
516 struct xfs_buf
*bp
; /* buffer for block */
517 xfs_dir2_block_tail_t
*btp
; /* block tail */
518 xfs_dir2_data_entry_t
*dep
; /* block data entry */
519 xfs_dir2_data_unused_t
*dup
; /* block unused entry */
520 char *endptr
; /* end of the data entries */
521 int error
; /* error return value */
522 xfs_mount_t
*mp
; /* filesystem mount point */
523 char *ptr
; /* current data entry */
524 int wantoff
; /* starting block offset */
529 * If the block number in the offset is out of range, we're done.
531 if (xfs_dir2_dataptr_to_db(mp
, *offset
) > mp
->m_dirdatablk
)
534 error
= xfs_dir2_block_read(NULL
, dp
, &bp
);
539 * Extract the byte offset we start at from the seek pointer.
540 * We'll skip entries before this.
542 wantoff
= xfs_dir2_dataptr_to_off(mp
, *offset
);
544 xfs_dir2_data_check(dp
, bp
);
546 * Set up values for the loop.
548 btp
= xfs_dir2_block_tail_p(mp
, hdr
);
549 ptr
= (char *)(hdr
+ 1);
550 endptr
= (char *)xfs_dir2_block_leaf_p(btp
);
553 * Loop over the data portion of the block.
554 * Each object is a real entry (dep) or an unused one (dup).
556 while (ptr
< endptr
) {
557 dup
= (xfs_dir2_data_unused_t
*)ptr
;
561 if (be16_to_cpu(dup
->freetag
) == XFS_DIR2_DATA_FREE_TAG
) {
562 ptr
+= be16_to_cpu(dup
->length
);
566 dep
= (xfs_dir2_data_entry_t
*)ptr
;
569 * Bump pointer for the next iteration.
571 ptr
+= xfs_dir2_data_entsize(dep
->namelen
);
573 * The entry is before the desired starting point, skip it.
575 if ((char *)dep
- (char *)hdr
< wantoff
)
578 cook
= xfs_dir2_db_off_to_dataptr(mp
, mp
->m_dirdatablk
,
579 (char *)dep
- (char *)hdr
);
582 * If it didn't fit, set the final offset to here & return.
584 if (filldir(dirent
, (char *)dep
->name
, dep
->namelen
,
585 cook
& 0x7fffffff, be64_to_cpu(dep
->inumber
),
587 *offset
= cook
& 0x7fffffff;
588 xfs_trans_brelse(NULL
, bp
);
594 * Reached the end of the block.
595 * Set the offset to a non-existent block 1 and return.
597 *offset
= xfs_dir2_db_off_to_dataptr(mp
, mp
->m_dirdatablk
+ 1, 0) &
599 xfs_trans_brelse(NULL
, bp
);
604 * Log leaf entries from the block.
607 xfs_dir2_block_log_leaf(
608 xfs_trans_t
*tp
, /* transaction structure */
609 struct xfs_buf
*bp
, /* block buffer */
610 int first
, /* index of first logged leaf */
611 int last
) /* index of last logged leaf */
613 xfs_dir2_data_hdr_t
*hdr
= bp
->b_addr
;
614 xfs_dir2_leaf_entry_t
*blp
;
615 xfs_dir2_block_tail_t
*btp
;
617 btp
= xfs_dir2_block_tail_p(tp
->t_mountp
, hdr
);
618 blp
= xfs_dir2_block_leaf_p(btp
);
619 xfs_trans_log_buf(tp
, bp
, (uint
)((char *)&blp
[first
] - (char *)hdr
),
620 (uint
)((char *)&blp
[last
+ 1] - (char *)hdr
- 1));
624 * Log the block tail.
627 xfs_dir2_block_log_tail(
628 xfs_trans_t
*tp
, /* transaction structure */
629 struct xfs_buf
*bp
) /* block buffer */
631 xfs_dir2_data_hdr_t
*hdr
= bp
->b_addr
;
632 xfs_dir2_block_tail_t
*btp
;
634 btp
= xfs_dir2_block_tail_p(tp
->t_mountp
, hdr
);
635 xfs_trans_log_buf(tp
, bp
, (uint
)((char *)btp
- (char *)hdr
),
636 (uint
)((char *)(btp
+ 1) - (char *)hdr
- 1));
640 * Look up an entry in the block. This is the external routine,
641 * xfs_dir2_block_lookup_int does the real work.
644 xfs_dir2_block_lookup(
645 xfs_da_args_t
*args
) /* dir lookup arguments */
647 xfs_dir2_data_hdr_t
*hdr
; /* block header */
648 xfs_dir2_leaf_entry_t
*blp
; /* block leaf entries */
649 struct xfs_buf
*bp
; /* block buffer */
650 xfs_dir2_block_tail_t
*btp
; /* block tail */
651 xfs_dir2_data_entry_t
*dep
; /* block data entry */
652 xfs_inode_t
*dp
; /* incore inode */
653 int ent
; /* entry index */
654 int error
; /* error return value */
655 xfs_mount_t
*mp
; /* filesystem mount point */
657 trace_xfs_dir2_block_lookup(args
);
660 * Get the buffer, look up the entry.
661 * If not found (ENOENT) then return, have no buffer.
663 if ((error
= xfs_dir2_block_lookup_int(args
, &bp
, &ent
)))
668 xfs_dir2_data_check(dp
, bp
);
669 btp
= xfs_dir2_block_tail_p(mp
, hdr
);
670 blp
= xfs_dir2_block_leaf_p(btp
);
672 * Get the offset from the leaf entry, to point to the data.
674 dep
= (xfs_dir2_data_entry_t
*)((char *)hdr
+
675 xfs_dir2_dataptr_to_off(mp
, be32_to_cpu(blp
[ent
].address
)));
677 * Fill in inode number, CI name if appropriate, release the block.
679 args
->inumber
= be64_to_cpu(dep
->inumber
);
680 error
= xfs_dir_cilookup_result(args
, dep
->name
, dep
->namelen
);
681 xfs_trans_brelse(args
->trans
, bp
);
682 return XFS_ERROR(error
);
686 * Internal block lookup routine.
688 static int /* error */
689 xfs_dir2_block_lookup_int(
690 xfs_da_args_t
*args
, /* dir lookup arguments */
691 struct xfs_buf
**bpp
, /* returned block buffer */
692 int *entno
) /* returned entry number */
694 xfs_dir2_dataptr_t addr
; /* data entry address */
695 xfs_dir2_data_hdr_t
*hdr
; /* block header */
696 xfs_dir2_leaf_entry_t
*blp
; /* block leaf entries */
697 struct xfs_buf
*bp
; /* block buffer */
698 xfs_dir2_block_tail_t
*btp
; /* block tail */
699 xfs_dir2_data_entry_t
*dep
; /* block data entry */
700 xfs_inode_t
*dp
; /* incore inode */
701 int error
; /* error return value */
702 xfs_dahash_t hash
; /* found hash value */
703 int high
; /* binary search high index */
704 int low
; /* binary search low index */
705 int mid
; /* binary search current idx */
706 xfs_mount_t
*mp
; /* filesystem mount point */
707 xfs_trans_t
*tp
; /* transaction pointer */
708 enum xfs_dacmp cmp
; /* comparison result */
714 error
= xfs_dir2_block_read(tp
, dp
, &bp
);
719 xfs_dir2_data_check(dp
, bp
);
720 btp
= xfs_dir2_block_tail_p(mp
, hdr
);
721 blp
= xfs_dir2_block_leaf_p(btp
);
723 * Loop doing a binary search for our hash value.
724 * Find our entry, ENOENT if it's not there.
726 for (low
= 0, high
= be32_to_cpu(btp
->count
) - 1; ; ) {
728 mid
= (low
+ high
) >> 1;
729 if ((hash
= be32_to_cpu(blp
[mid
].hashval
)) == args
->hashval
)
731 if (hash
< args
->hashval
)
736 ASSERT(args
->op_flags
& XFS_DA_OP_OKNOENT
);
737 xfs_trans_brelse(tp
, bp
);
738 return XFS_ERROR(ENOENT
);
742 * Back up to the first one with the right hash value.
744 while (mid
> 0 && be32_to_cpu(blp
[mid
- 1].hashval
) == args
->hashval
) {
748 * Now loop forward through all the entries with the
749 * right hash value looking for our name.
752 if ((addr
= be32_to_cpu(blp
[mid
].address
)) == XFS_DIR2_NULL_DATAPTR
)
755 * Get pointer to the entry from the leaf.
757 dep
= (xfs_dir2_data_entry_t
*)
758 ((char *)hdr
+ xfs_dir2_dataptr_to_off(mp
, addr
));
760 * Compare name and if it's an exact match, return the index
761 * and buffer. If it's the first case-insensitive match, store
762 * the index and buffer and continue looking for an exact match.
764 cmp
= mp
->m_dirnameops
->compname(args
, dep
->name
, dep
->namelen
);
765 if (cmp
!= XFS_CMP_DIFFERENT
&& cmp
!= args
->cmpresult
) {
766 args
->cmpresult
= cmp
;
769 if (cmp
== XFS_CMP_EXACT
)
772 } while (++mid
< be32_to_cpu(btp
->count
) &&
773 be32_to_cpu(blp
[mid
].hashval
) == hash
);
775 ASSERT(args
->op_flags
& XFS_DA_OP_OKNOENT
);
777 * Here, we can only be doing a lookup (not a rename or replace).
778 * If a case-insensitive match was found earlier, return success.
780 if (args
->cmpresult
== XFS_CMP_CASE
)
783 * No match, release the buffer and return ENOENT.
785 xfs_trans_brelse(tp
, bp
);
786 return XFS_ERROR(ENOENT
);
790 * Remove an entry from a block format directory.
791 * If that makes the block small enough to fit in shortform, transform it.
794 xfs_dir2_block_removename(
795 xfs_da_args_t
*args
) /* directory operation args */
797 xfs_dir2_data_hdr_t
*hdr
; /* block header */
798 xfs_dir2_leaf_entry_t
*blp
; /* block leaf pointer */
799 struct xfs_buf
*bp
; /* block buffer */
800 xfs_dir2_block_tail_t
*btp
; /* block tail */
801 xfs_dir2_data_entry_t
*dep
; /* block data entry */
802 xfs_inode_t
*dp
; /* incore inode */
803 int ent
; /* block leaf entry index */
804 int error
; /* error return value */
805 xfs_mount_t
*mp
; /* filesystem mount point */
806 int needlog
; /* need to log block header */
807 int needscan
; /* need to fixup bestfree */
808 xfs_dir2_sf_hdr_t sfh
; /* shortform header */
809 int size
; /* shortform size */
810 xfs_trans_t
*tp
; /* transaction pointer */
812 trace_xfs_dir2_block_removename(args
);
815 * Look up the entry in the block. Gets the buffer and entry index.
816 * It will always be there, the vnodeops level does a lookup first.
818 if ((error
= xfs_dir2_block_lookup_int(args
, &bp
, &ent
))) {
825 btp
= xfs_dir2_block_tail_p(mp
, hdr
);
826 blp
= xfs_dir2_block_leaf_p(btp
);
828 * Point to the data entry using the leaf entry.
830 dep
= (xfs_dir2_data_entry_t
*)
831 ((char *)hdr
+ xfs_dir2_dataptr_to_off(mp
, be32_to_cpu(blp
[ent
].address
)));
833 * Mark the data entry's space free.
835 needlog
= needscan
= 0;
836 xfs_dir2_data_make_free(tp
, bp
,
837 (xfs_dir2_data_aoff_t
)((char *)dep
- (char *)hdr
),
838 xfs_dir2_data_entsize(dep
->namelen
), &needlog
, &needscan
);
840 * Fix up the block tail.
842 be32_add_cpu(&btp
->stale
, 1);
843 xfs_dir2_block_log_tail(tp
, bp
);
845 * Remove the leaf entry by marking it stale.
847 blp
[ent
].address
= cpu_to_be32(XFS_DIR2_NULL_DATAPTR
);
848 xfs_dir2_block_log_leaf(tp
, bp
, ent
, ent
);
850 * Fix up bestfree, log the header if necessary.
853 xfs_dir2_data_freescan(mp
, hdr
, &needlog
);
855 xfs_dir2_data_log_header(tp
, bp
);
856 xfs_dir2_data_check(dp
, bp
);
858 * See if the size as a shortform is good enough.
860 size
= xfs_dir2_block_sfsize(dp
, hdr
, &sfh
);
861 if (size
> XFS_IFORK_DSIZE(dp
))
865 * If it works, do the conversion.
867 return xfs_dir2_block_to_sf(args
, bp
, size
, &sfh
);
871 * Replace an entry in a V2 block directory.
872 * Change the inode number to the new value.
875 xfs_dir2_block_replace(
876 xfs_da_args_t
*args
) /* directory operation args */
878 xfs_dir2_data_hdr_t
*hdr
; /* block header */
879 xfs_dir2_leaf_entry_t
*blp
; /* block leaf entries */
880 struct xfs_buf
*bp
; /* block buffer */
881 xfs_dir2_block_tail_t
*btp
; /* block tail */
882 xfs_dir2_data_entry_t
*dep
; /* block data entry */
883 xfs_inode_t
*dp
; /* incore inode */
884 int ent
; /* leaf entry index */
885 int error
; /* error return value */
886 xfs_mount_t
*mp
; /* filesystem mount point */
888 trace_xfs_dir2_block_replace(args
);
891 * Lookup the entry in the directory. Get buffer and entry index.
892 * This will always succeed since the caller has already done a lookup.
894 if ((error
= xfs_dir2_block_lookup_int(args
, &bp
, &ent
))) {
900 btp
= xfs_dir2_block_tail_p(mp
, hdr
);
901 blp
= xfs_dir2_block_leaf_p(btp
);
903 * Point to the data entry we need to change.
905 dep
= (xfs_dir2_data_entry_t
*)
906 ((char *)hdr
+ xfs_dir2_dataptr_to_off(mp
, be32_to_cpu(blp
[ent
].address
)));
907 ASSERT(be64_to_cpu(dep
->inumber
) != args
->inumber
);
909 * Change the inode number to the new value.
911 dep
->inumber
= cpu_to_be64(args
->inumber
);
912 xfs_dir2_data_log_entry(args
->trans
, bp
, dep
);
913 xfs_dir2_data_check(dp
, bp
);
918 * Qsort comparison routine for the block leaf entries.
920 static int /* sort order */
922 const void *a
, /* first leaf entry */
923 const void *b
) /* second leaf entry */
925 const xfs_dir2_leaf_entry_t
*la
; /* first leaf entry */
926 const xfs_dir2_leaf_entry_t
*lb
; /* second leaf entry */
930 return be32_to_cpu(la
->hashval
) < be32_to_cpu(lb
->hashval
) ? -1 :
931 (be32_to_cpu(la
->hashval
) > be32_to_cpu(lb
->hashval
) ? 1 : 0);
935 * Convert a V2 leaf directory to a V2 block directory if possible.
938 xfs_dir2_leaf_to_block(
939 xfs_da_args_t
*args
, /* operation arguments */
940 struct xfs_buf
*lbp
, /* leaf buffer */
941 struct xfs_buf
*dbp
) /* data buffer */
943 __be16
*bestsp
; /* leaf bests table */
944 xfs_dir2_data_hdr_t
*hdr
; /* block header */
945 xfs_dir2_block_tail_t
*btp
; /* block tail */
946 xfs_inode_t
*dp
; /* incore directory inode */
947 xfs_dir2_data_unused_t
*dup
; /* unused data entry */
948 int error
; /* error return value */
949 int from
; /* leaf from index */
950 xfs_dir2_leaf_t
*leaf
; /* leaf structure */
951 xfs_dir2_leaf_entry_t
*lep
; /* leaf entry */
952 xfs_dir2_leaf_tail_t
*ltp
; /* leaf tail structure */
953 xfs_mount_t
*mp
; /* file system mount point */
954 int needlog
; /* need to log data header */
955 int needscan
; /* need to scan for bestfree */
956 xfs_dir2_sf_hdr_t sfh
; /* shortform header */
957 int size
; /* bytes used */
958 __be16
*tagp
; /* end of entry (tag) */
959 int to
; /* block/leaf to index */
960 xfs_trans_t
*tp
; /* transaction pointer */
962 trace_xfs_dir2_leaf_to_block(args
);
968 ASSERT(leaf
->hdr
.info
.magic
== cpu_to_be16(XFS_DIR2_LEAF1_MAGIC
));
969 ltp
= xfs_dir2_leaf_tail_p(mp
, leaf
);
971 * If there are data blocks other than the first one, take this
972 * opportunity to remove trailing empty data blocks that may have
973 * been left behind during no-space-reservation operations.
974 * These will show up in the leaf bests table.
976 while (dp
->i_d
.di_size
> mp
->m_dirblksize
) {
977 bestsp
= xfs_dir2_leaf_bests_p(ltp
);
978 if (be16_to_cpu(bestsp
[be32_to_cpu(ltp
->bestcount
) - 1]) ==
979 mp
->m_dirblksize
- (uint
)sizeof(*hdr
)) {
981 xfs_dir2_leaf_trim_data(args
, lbp
,
982 (xfs_dir2_db_t
)(be32_to_cpu(ltp
->bestcount
) - 1))))
988 * Read the data block if we don't already have it, give up if it fails.
991 error
= xfs_dir2_data_read(tp
, dp
, mp
->m_dirdatablk
, -1, &dbp
);
996 ASSERT(hdr
->magic
== cpu_to_be32(XFS_DIR2_DATA_MAGIC
));
998 * Size of the "leaf" area in the block.
1000 size
= (uint
)sizeof(xfs_dir2_block_tail_t
) +
1001 (uint
)sizeof(*lep
) * (be16_to_cpu(leaf
->hdr
.count
) - be16_to_cpu(leaf
->hdr
.stale
));
1003 * Look at the last data entry.
1005 tagp
= (__be16
*)((char *)hdr
+ mp
->m_dirblksize
) - 1;
1006 dup
= (xfs_dir2_data_unused_t
*)((char *)hdr
+ be16_to_cpu(*tagp
));
1008 * If it's not free or is too short we can't do it.
1010 if (be16_to_cpu(dup
->freetag
) != XFS_DIR2_DATA_FREE_TAG
||
1011 be16_to_cpu(dup
->length
) < size
)
1015 * Start converting it to block form.
1017 dbp
->b_ops
= &xfs_dir2_block_buf_ops
;
1018 hdr
->magic
= cpu_to_be32(XFS_DIR2_BLOCK_MAGIC
);
1022 * Use up the space at the end of the block (blp/btp).
1024 xfs_dir2_data_use_free(tp
, dbp
, dup
, mp
->m_dirblksize
- size
, size
,
1025 &needlog
, &needscan
);
1027 * Initialize the block tail.
1029 btp
= xfs_dir2_block_tail_p(mp
, hdr
);
1030 btp
->count
= cpu_to_be32(be16_to_cpu(leaf
->hdr
.count
) - be16_to_cpu(leaf
->hdr
.stale
));
1032 xfs_dir2_block_log_tail(tp
, dbp
);
1034 * Initialize the block leaf area. We compact out stale entries.
1036 lep
= xfs_dir2_block_leaf_p(btp
);
1037 for (from
= to
= 0; from
< be16_to_cpu(leaf
->hdr
.count
); from
++) {
1038 if (leaf
->ents
[from
].address
==
1039 cpu_to_be32(XFS_DIR2_NULL_DATAPTR
))
1041 lep
[to
++] = leaf
->ents
[from
];
1043 ASSERT(to
== be32_to_cpu(btp
->count
));
1044 xfs_dir2_block_log_leaf(tp
, dbp
, 0, be32_to_cpu(btp
->count
) - 1);
1046 * Scan the bestfree if we need it and log the data block header.
1049 xfs_dir2_data_freescan(mp
, hdr
, &needlog
);
1051 xfs_dir2_data_log_header(tp
, dbp
);
1053 * Pitch the old leaf block.
1055 error
= xfs_da_shrink_inode(args
, mp
->m_dirleafblk
, lbp
);
1060 * Now see if the resulting block can be shrunken to shortform.
1062 size
= xfs_dir2_block_sfsize(dp
, hdr
, &sfh
);
1063 if (size
> XFS_IFORK_DSIZE(dp
))
1066 return xfs_dir2_block_to_sf(args
, dbp
, size
, &sfh
);
1070 * Convert the shortform directory to block form.
1073 xfs_dir2_sf_to_block(
1074 xfs_da_args_t
*args
) /* operation arguments */
1076 xfs_dir2_db_t blkno
; /* dir-relative block # (0) */
1077 xfs_dir2_data_hdr_t
*hdr
; /* block header */
1078 xfs_dir2_leaf_entry_t
*blp
; /* block leaf entries */
1079 struct xfs_buf
*bp
; /* block buffer */
1080 xfs_dir2_block_tail_t
*btp
; /* block tail pointer */
1081 xfs_dir2_data_entry_t
*dep
; /* data entry pointer */
1082 xfs_inode_t
*dp
; /* incore directory inode */
1083 int dummy
; /* trash */
1084 xfs_dir2_data_unused_t
*dup
; /* unused entry pointer */
1085 int endoffset
; /* end of data objects */
1086 int error
; /* error return value */
1088 xfs_mount_t
*mp
; /* filesystem mount point */
1089 int needlog
; /* need to log block header */
1090 int needscan
; /* need to scan block freespc */
1091 int newoffset
; /* offset from current entry */
1092 int offset
; /* target block offset */
1093 xfs_dir2_sf_entry_t
*sfep
; /* sf entry pointer */
1094 xfs_dir2_sf_hdr_t
*oldsfp
; /* old shortform header */
1095 xfs_dir2_sf_hdr_t
*sfp
; /* shortform header */
1096 __be16
*tagp
; /* end of data entry */
1097 xfs_trans_t
*tp
; /* transaction pointer */
1098 struct xfs_name name
;
1100 trace_xfs_dir2_sf_to_block(args
);
1105 ASSERT(dp
->i_df
.if_flags
& XFS_IFINLINE
);
1107 * Bomb out if the shortform directory is way too short.
1109 if (dp
->i_d
.di_size
< offsetof(xfs_dir2_sf_hdr_t
, parent
)) {
1110 ASSERT(XFS_FORCED_SHUTDOWN(mp
));
1111 return XFS_ERROR(EIO
);
1114 oldsfp
= (xfs_dir2_sf_hdr_t
*)dp
->i_df
.if_u1
.if_data
;
1116 ASSERT(dp
->i_df
.if_bytes
== dp
->i_d
.di_size
);
1117 ASSERT(dp
->i_df
.if_u1
.if_data
!= NULL
);
1118 ASSERT(dp
->i_d
.di_size
>= xfs_dir2_sf_hdr_size(oldsfp
->i8count
));
1121 * Copy the directory into a temporary buffer.
1122 * Then pitch the incore inode data so we can make extents.
1124 sfp
= kmem_alloc(dp
->i_df
.if_bytes
, KM_SLEEP
);
1125 memcpy(sfp
, oldsfp
, dp
->i_df
.if_bytes
);
1127 xfs_idata_realloc(dp
, -dp
->i_df
.if_bytes
, XFS_DATA_FORK
);
1128 dp
->i_d
.di_size
= 0;
1129 xfs_trans_log_inode(tp
, dp
, XFS_ILOG_CORE
);
1132 * Add block 0 to the inode.
1134 error
= xfs_dir2_grow_inode(args
, XFS_DIR2_DATA_SPACE
, &blkno
);
1140 * Initialize the data block.
1142 error
= xfs_dir2_data_init(args
, blkno
, &bp
);
1147 bp
->b_ops
= &xfs_dir2_block_buf_ops
;
1149 hdr
->magic
= cpu_to_be32(XFS_DIR2_BLOCK_MAGIC
);
1151 * Compute size of block "tail" area.
1153 i
= (uint
)sizeof(*btp
) +
1154 (sfp
->count
+ 2) * (uint
)sizeof(xfs_dir2_leaf_entry_t
);
1156 * The whole thing is initialized to free by the init routine.
1157 * Say we're using the leaf and tail area.
1159 dup
= (xfs_dir2_data_unused_t
*)(hdr
+ 1);
1160 needlog
= needscan
= 0;
1161 xfs_dir2_data_use_free(tp
, bp
, dup
, mp
->m_dirblksize
- i
, i
, &needlog
,
1163 ASSERT(needscan
== 0);
1167 btp
= xfs_dir2_block_tail_p(mp
, hdr
);
1168 btp
->count
= cpu_to_be32(sfp
->count
+ 2); /* ., .. */
1170 blp
= xfs_dir2_block_leaf_p(btp
);
1171 endoffset
= (uint
)((char *)blp
- (char *)hdr
);
1173 * Remove the freespace, we'll manage it.
1175 xfs_dir2_data_use_free(tp
, bp
, dup
,
1176 (xfs_dir2_data_aoff_t
)((char *)dup
- (char *)hdr
),
1177 be16_to_cpu(dup
->length
), &needlog
, &needscan
);
1179 * Create entry for .
1181 dep
= (xfs_dir2_data_entry_t
*)
1182 ((char *)hdr
+ XFS_DIR2_DATA_DOT_OFFSET
);
1183 dep
->inumber
= cpu_to_be64(dp
->i_ino
);
1186 tagp
= xfs_dir2_data_entry_tag_p(dep
);
1187 *tagp
= cpu_to_be16((char *)dep
- (char *)hdr
);
1188 xfs_dir2_data_log_entry(tp
, bp
, dep
);
1189 blp
[0].hashval
= cpu_to_be32(xfs_dir_hash_dot
);
1190 blp
[0].address
= cpu_to_be32(xfs_dir2_byte_to_dataptr(mp
,
1191 (char *)dep
- (char *)hdr
));
1193 * Create entry for ..
1195 dep
= (xfs_dir2_data_entry_t
*)
1196 ((char *)hdr
+ XFS_DIR2_DATA_DOTDOT_OFFSET
);
1197 dep
->inumber
= cpu_to_be64(xfs_dir2_sf_get_parent_ino(sfp
));
1199 dep
->name
[0] = dep
->name
[1] = '.';
1200 tagp
= xfs_dir2_data_entry_tag_p(dep
);
1201 *tagp
= cpu_to_be16((char *)dep
- (char *)hdr
);
1202 xfs_dir2_data_log_entry(tp
, bp
, dep
);
1203 blp
[1].hashval
= cpu_to_be32(xfs_dir_hash_dotdot
);
1204 blp
[1].address
= cpu_to_be32(xfs_dir2_byte_to_dataptr(mp
,
1205 (char *)dep
- (char *)hdr
));
1206 offset
= XFS_DIR2_DATA_FIRST_OFFSET
;
1208 * Loop over existing entries, stuff them in.
1214 sfep
= xfs_dir2_sf_firstentry(sfp
);
1216 * Need to preserve the existing offset values in the sf directory.
1217 * Insert holes (unused entries) where necessary.
1219 while (offset
< endoffset
) {
1221 * sfep is null when we reach the end of the list.
1224 newoffset
= endoffset
;
1226 newoffset
= xfs_dir2_sf_get_offset(sfep
);
1228 * There should be a hole here, make one.
1230 if (offset
< newoffset
) {
1231 dup
= (xfs_dir2_data_unused_t
*)((char *)hdr
+ offset
);
1232 dup
->freetag
= cpu_to_be16(XFS_DIR2_DATA_FREE_TAG
);
1233 dup
->length
= cpu_to_be16(newoffset
- offset
);
1234 *xfs_dir2_data_unused_tag_p(dup
) = cpu_to_be16(
1235 ((char *)dup
- (char *)hdr
));
1236 xfs_dir2_data_log_unused(tp
, bp
, dup
);
1237 xfs_dir2_data_freeinsert(hdr
, dup
, &dummy
);
1238 offset
+= be16_to_cpu(dup
->length
);
1242 * Copy a real entry.
1244 dep
= (xfs_dir2_data_entry_t
*)((char *)hdr
+ newoffset
);
1245 dep
->inumber
= cpu_to_be64(xfs_dir2_sfe_get_ino(sfp
, sfep
));
1246 dep
->namelen
= sfep
->namelen
;
1247 memcpy(dep
->name
, sfep
->name
, dep
->namelen
);
1248 tagp
= xfs_dir2_data_entry_tag_p(dep
);
1249 *tagp
= cpu_to_be16((char *)dep
- (char *)hdr
);
1250 xfs_dir2_data_log_entry(tp
, bp
, dep
);
1251 name
.name
= sfep
->name
;
1252 name
.len
= sfep
->namelen
;
1253 blp
[2 + i
].hashval
= cpu_to_be32(mp
->m_dirnameops
->
1255 blp
[2 + i
].address
= cpu_to_be32(xfs_dir2_byte_to_dataptr(mp
,
1256 (char *)dep
- (char *)hdr
));
1257 offset
= (int)((char *)(tagp
+ 1) - (char *)hdr
);
1258 if (++i
== sfp
->count
)
1261 sfep
= xfs_dir2_sf_nextentry(sfp
, sfep
);
1263 /* Done with the temporary buffer */
1266 * Sort the leaf entries by hash value.
1268 xfs_sort(blp
, be32_to_cpu(btp
->count
), sizeof(*blp
), xfs_dir2_block_sort
);
1270 * Log the leaf entry area and tail.
1271 * Already logged the header in data_init, ignore needlog.
1273 ASSERT(needscan
== 0);
1274 xfs_dir2_block_log_leaf(tp
, bp
, 0, be32_to_cpu(btp
->count
) - 1);
1275 xfs_dir2_block_log_tail(tp
, bp
);
1276 xfs_dir2_data_check(dp
, bp
);