2 * Copyright (c) 2000-2003,2005 Silicon Graphics, Inc.
3 * Copyright (c) 2013 Red Hat, Inc.
6 * This program is free software; you can redistribute it and/or
7 * modify it under the terms of the GNU General Public License as
8 * published by the Free Software Foundation.
10 * This program is distributed in the hope that it would be useful,
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 * GNU General Public License for more details.
15 * You should have received a copy of the GNU General Public License
16 * along with this program; if not, write the Free Software Foundation,
17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
19 #include "libxfs_priv.h"
21 #include "xfs_format.h"
22 #include "xfs_log_format.h"
23 #include "xfs_trans_resv.h"
24 #include "xfs_mount.h"
25 #include "xfs_da_format.h"
26 #include "xfs_da_btree.h"
27 #include "xfs_inode.h"
28 #include "xfs_trans.h"
31 #include "xfs_dir2_priv.h"
32 #include "xfs_trace.h"
33 #include "xfs_cksum.h"
36 * Local function prototypes.
38 static void xfs_dir2_block_log_leaf(xfs_trans_t
*tp
, struct xfs_buf
*bp
,
40 static void xfs_dir2_block_log_tail(xfs_trans_t
*tp
, struct xfs_buf
*bp
);
41 static int xfs_dir2_block_lookup_int(xfs_da_args_t
*args
, struct xfs_buf
**bpp
,
43 static int xfs_dir2_block_sort(const void *a
, const void *b
);
45 static xfs_dahash_t xfs_dir_hash_dot
, xfs_dir_hash_dotdot
;
48 * One-time startup routine called from xfs_init().
53 xfs_dir_hash_dot
= xfs_da_hashname((unsigned char *)".", 1);
54 xfs_dir_hash_dotdot
= xfs_da_hashname((unsigned char *)"..", 2);
58 xfs_dir3_block_verify(
61 struct xfs_mount
*mp
= bp
->b_target
->bt_mount
;
62 struct xfs_dir3_blk_hdr
*hdr3
= bp
->b_addr
;
64 if (xfs_sb_version_hascrc(&mp
->m_sb
)) {
65 if (hdr3
->magic
!= cpu_to_be32(XFS_DIR3_BLOCK_MAGIC
))
67 if (!uuid_equal(&hdr3
->uuid
, &mp
->m_sb
.sb_uuid
))
69 if (be64_to_cpu(hdr3
->blkno
) != bp
->b_bn
)
72 if (hdr3
->magic
!= cpu_to_be32(XFS_DIR2_BLOCK_MAGIC
))
75 if (__xfs_dir3_data_check(NULL
, bp
))
81 xfs_dir3_block_read_verify(
84 struct xfs_mount
*mp
= bp
->b_target
->bt_mount
;
86 if (xfs_sb_version_hascrc(&mp
->m_sb
) &&
87 !xfs_buf_verify_cksum(bp
, XFS_DIR3_DATA_CRC_OFF
))
88 xfs_buf_ioerror(bp
, -EFSBADCRC
);
89 else if (!xfs_dir3_block_verify(bp
))
90 xfs_buf_ioerror(bp
, -EFSCORRUPTED
);
93 xfs_verifier_error(bp
);
97 xfs_dir3_block_write_verify(
100 struct xfs_mount
*mp
= bp
->b_target
->bt_mount
;
101 struct xfs_buf_log_item
*bip
= bp
->b_fspriv
;
102 struct xfs_dir3_blk_hdr
*hdr3
= bp
->b_addr
;
104 if (!xfs_dir3_block_verify(bp
)) {
105 xfs_buf_ioerror(bp
, -EFSCORRUPTED
);
106 xfs_verifier_error(bp
);
110 if (!xfs_sb_version_hascrc(&mp
->m_sb
))
114 hdr3
->lsn
= cpu_to_be64(bip
->bli_item
.li_lsn
);
116 xfs_buf_update_cksum(bp
, XFS_DIR3_DATA_CRC_OFF
);
119 const struct xfs_buf_ops xfs_dir3_block_buf_ops
= {
120 .verify_read
= xfs_dir3_block_read_verify
,
121 .verify_write
= xfs_dir3_block_write_verify
,
126 struct xfs_trans
*tp
,
127 struct xfs_inode
*dp
,
128 struct xfs_buf
**bpp
)
130 struct xfs_mount
*mp
= dp
->i_mount
;
133 err
= xfs_da_read_buf(tp
, dp
, mp
->m_dir_geo
->datablk
, -1, bpp
,
134 XFS_DATA_FORK
, &xfs_dir3_block_buf_ops
);
136 xfs_trans_buf_set_type(tp
, *bpp
, XFS_BLFT_DIR_BLOCK_BUF
);
142 struct xfs_mount
*mp
,
143 struct xfs_trans
*tp
,
145 struct xfs_inode
*dp
)
147 struct xfs_dir3_blk_hdr
*hdr3
= bp
->b_addr
;
149 bp
->b_ops
= &xfs_dir3_block_buf_ops
;
150 xfs_trans_buf_set_type(tp
, bp
, XFS_BLFT_DIR_BLOCK_BUF
);
152 if (xfs_sb_version_hascrc(&mp
->m_sb
)) {
153 memset(hdr3
, 0, sizeof(*hdr3
));
154 hdr3
->magic
= cpu_to_be32(XFS_DIR3_BLOCK_MAGIC
);
155 hdr3
->blkno
= cpu_to_be64(bp
->b_bn
);
156 hdr3
->owner
= cpu_to_be64(dp
->i_ino
);
157 uuid_copy(&hdr3
->uuid
, &mp
->m_sb
.sb_uuid
);
161 hdr3
->magic
= cpu_to_be32(XFS_DIR2_BLOCK_MAGIC
);
165 xfs_dir2_block_need_space(
166 struct xfs_inode
*dp
,
167 struct xfs_dir2_data_hdr
*hdr
,
168 struct xfs_dir2_block_tail
*btp
,
169 struct xfs_dir2_leaf_entry
*blp
,
171 struct xfs_dir2_data_unused
**dupp
,
172 struct xfs_dir2_data_unused
**enddupp
,
176 struct xfs_dir2_data_free
*bf
;
178 struct xfs_dir2_data_unused
*dup
= NULL
;
179 struct xfs_dir2_data_unused
*enddup
= NULL
;
182 bf
= dp
->d_ops
->data_bestfree_p(hdr
);
185 * If there are stale entries we'll use one for the leaf.
188 if (be16_to_cpu(bf
[0].length
) >= len
) {
190 * The biggest entry enough to avoid compaction.
192 dup
= (xfs_dir2_data_unused_t
*)
193 ((char *)hdr
+ be16_to_cpu(bf
[0].offset
));
198 * Will need to compact to make this work.
199 * Tag just before the first leaf entry.
202 tagp
= (__be16
*)blp
- 1;
204 /* Data object just before the first leaf entry. */
205 dup
= (xfs_dir2_data_unused_t
*)((char *)hdr
+ be16_to_cpu(*tagp
));
208 * If it's not free then the data will go where the
209 * leaf data starts now, if it works at all.
211 if (be16_to_cpu(dup
->freetag
) == XFS_DIR2_DATA_FREE_TAG
) {
212 if (be16_to_cpu(dup
->length
) + (be32_to_cpu(btp
->stale
) - 1) *
213 (uint
)sizeof(*blp
) < len
)
215 } else if ((be32_to_cpu(btp
->stale
) - 1) * (uint
)sizeof(*blp
) < len
)
218 dup
= (xfs_dir2_data_unused_t
*)blp
;
223 * no stale entries, so just use free space.
224 * Tag just before the first leaf entry.
226 tagp
= (__be16
*)blp
- 1;
228 /* Data object just before the first leaf entry. */
229 enddup
= (xfs_dir2_data_unused_t
*)((char *)hdr
+ be16_to_cpu(*tagp
));
232 * If it's not free then can't do this add without cleaning up:
233 * the space before the first leaf entry needs to be free so it
234 * can be expanded to hold the pointer to the new entry.
236 if (be16_to_cpu(enddup
->freetag
) == XFS_DIR2_DATA_FREE_TAG
) {
238 * Check out the biggest freespace and see if it's the same one.
240 dup
= (xfs_dir2_data_unused_t
*)
241 ((char *)hdr
+ be16_to_cpu(bf
[0].offset
));
244 * Not the same free entry, just check its length.
246 if (be16_to_cpu(dup
->length
) < len
)
252 * It is the biggest freespace, can it hold the leaf too?
254 if (be16_to_cpu(dup
->length
) < len
+ (uint
)sizeof(*blp
)) {
256 * Yes, use the second-largest entry instead if it works.
258 if (be16_to_cpu(bf
[1].length
) >= len
)
259 dup
= (xfs_dir2_data_unused_t
*)
260 ((char *)hdr
+ be16_to_cpu(bf
[1].offset
));
272 * compact the leaf entries.
273 * Leave the highest-numbered stale entry stale.
274 * XXX should be the one closest to mid but mid is not yet computed.
277 xfs_dir2_block_compact(
278 struct xfs_da_args
*args
,
280 struct xfs_dir2_data_hdr
*hdr
,
281 struct xfs_dir2_block_tail
*btp
,
282 struct xfs_dir2_leaf_entry
*blp
,
287 int fromidx
; /* source leaf index */
288 int toidx
; /* target leaf index */
290 int highstale
; /* high stale index */
292 fromidx
= toidx
= be32_to_cpu(btp
->count
) - 1;
293 highstale
= *lfloghigh
= -1;
294 for (; fromidx
>= 0; fromidx
--) {
295 if (blp
[fromidx
].address
== cpu_to_be32(XFS_DIR2_NULL_DATAPTR
)) {
299 if (*lfloghigh
== -1)
305 blp
[toidx
] = blp
[fromidx
];
308 *lfloglow
= toidx
+ 1 - (be32_to_cpu(btp
->stale
) - 1);
309 *lfloghigh
-= be32_to_cpu(btp
->stale
) - 1;
310 be32_add_cpu(&btp
->count
, -(be32_to_cpu(btp
->stale
) - 1));
311 xfs_dir2_data_make_free(args
, bp
,
312 (xfs_dir2_data_aoff_t
)((char *)blp
- (char *)hdr
),
313 (xfs_dir2_data_aoff_t
)((be32_to_cpu(btp
->stale
) - 1) * sizeof(*blp
)),
315 btp
->stale
= cpu_to_be32(1);
317 * If we now need to rebuild the bestfree map, do so.
318 * This needs to happen before the next call to use_free.
321 xfs_dir2_data_freescan(args
->dp
, hdr
, needlog
);
325 * Add an entry to a block directory.
328 xfs_dir2_block_addname(
329 xfs_da_args_t
*args
) /* directory op arguments */
331 xfs_dir2_data_hdr_t
*hdr
; /* block header */
332 xfs_dir2_leaf_entry_t
*blp
; /* block leaf entries */
333 struct xfs_buf
*bp
; /* buffer for block */
334 xfs_dir2_block_tail_t
*btp
; /* block tail */
335 int compact
; /* need to compact leaf ents */
336 xfs_dir2_data_entry_t
*dep
; /* block data entry */
337 xfs_inode_t
*dp
; /* directory inode */
338 xfs_dir2_data_unused_t
*dup
; /* block unused entry */
339 int error
; /* error return value */
340 xfs_dir2_data_unused_t
*enddup
=NULL
; /* unused at end of data */
341 xfs_dahash_t hash
; /* hash value of found entry */
342 int high
; /* high index for binary srch */
343 int highstale
; /* high stale index */
344 int lfloghigh
=0; /* last final leaf to log */
345 int lfloglow
=0; /* first final leaf to log */
346 int len
; /* length of the new entry */
347 int low
; /* low index for binary srch */
348 int lowstale
; /* low stale index */
349 int mid
=0; /* midpoint for binary srch */
350 int needlog
; /* need to log header */
351 int needscan
; /* need to rescan freespace */
352 __be16
*tagp
; /* pointer to tag value */
353 xfs_trans_t
*tp
; /* transaction structure */
355 trace_xfs_dir2_block_addname(args
);
360 /* Read the (one and only) directory block into bp. */
361 error
= xfs_dir3_block_read(tp
, dp
, &bp
);
365 len
= dp
->d_ops
->data_entsize(args
->namelen
);
368 * Set up pointers to parts of the block.
371 btp
= xfs_dir2_block_tail_p(args
->geo
, hdr
);
372 blp
= xfs_dir2_block_leaf_p(btp
);
375 * Find out if we can reuse stale entries or whether we need extra
376 * space for entry and new leaf.
378 xfs_dir2_block_need_space(dp
, hdr
, btp
, blp
, &tagp
, &dup
,
379 &enddup
, &compact
, len
);
382 * Done everything we need for a space check now.
384 if (args
->op_flags
& XFS_DA_OP_JUSTCHECK
) {
385 xfs_trans_brelse(tp
, bp
);
392 * If we don't have space for the new entry & leaf ...
395 /* Don't have a space reservation: return no-space. */
396 if (args
->total
== 0)
399 * Convert to the next larger format.
400 * Then add the new entry in that format.
402 error
= xfs_dir2_block_to_leaf(args
, bp
);
405 return xfs_dir2_leaf_addname(args
);
408 needlog
= needscan
= 0;
411 * If need to compact the leaf entries, do it now.
414 xfs_dir2_block_compact(args
, bp
, hdr
, btp
, blp
, &needlog
,
415 &lfloghigh
, &lfloglow
);
416 /* recalculate blp post-compaction */
417 blp
= xfs_dir2_block_leaf_p(btp
);
418 } else if (btp
->stale
) {
420 * Set leaf logging boundaries to impossible state.
421 * For the no-stale case they're set explicitly.
423 lfloglow
= be32_to_cpu(btp
->count
);
428 * Find the slot that's first lower than our hash value, -1 if none.
430 for (low
= 0, high
= be32_to_cpu(btp
->count
) - 1; low
<= high
; ) {
431 mid
= (low
+ high
) >> 1;
432 if ((hash
= be32_to_cpu(blp
[mid
].hashval
)) == args
->hashval
)
434 if (hash
< args
->hashval
)
439 while (mid
>= 0 && be32_to_cpu(blp
[mid
].hashval
) >= args
->hashval
) {
443 * No stale entries, will use enddup space to hold new leaf.
447 * Mark the space needed for the new leaf entry, now in use.
449 xfs_dir2_data_use_free(args
, bp
, enddup
,
450 (xfs_dir2_data_aoff_t
)
451 ((char *)enddup
- (char *)hdr
+ be16_to_cpu(enddup
->length
) -
453 (xfs_dir2_data_aoff_t
)sizeof(*blp
),
454 &needlog
, &needscan
);
456 * Update the tail (entry count).
458 be32_add_cpu(&btp
->count
, 1);
460 * If we now need to rebuild the bestfree map, do so.
461 * This needs to happen before the next call to use_free.
464 xfs_dir2_data_freescan(dp
, hdr
, &needlog
);
468 * Adjust pointer to the first leaf entry, we're about to move
469 * the table up one to open up space for the new leaf entry.
470 * Then adjust our index to match.
475 memmove(blp
, &blp
[1], mid
* sizeof(*blp
));
480 * Use a stale leaf for our new entry.
485 blp
[lowstale
].address
!=
486 cpu_to_be32(XFS_DIR2_NULL_DATAPTR
);
489 for (highstale
= mid
+ 1;
490 highstale
< be32_to_cpu(btp
->count
) &&
491 blp
[highstale
].address
!=
492 cpu_to_be32(XFS_DIR2_NULL_DATAPTR
) &&
493 (lowstale
< 0 || mid
- lowstale
> highstale
- mid
);
497 * Move entries toward the low-numbered stale entry.
500 (highstale
== be32_to_cpu(btp
->count
) ||
501 mid
- lowstale
<= highstale
- mid
)) {
503 memmove(&blp
[lowstale
], &blp
[lowstale
+ 1],
504 (mid
- lowstale
) * sizeof(*blp
));
505 lfloglow
= MIN(lowstale
, lfloglow
);
506 lfloghigh
= MAX(mid
, lfloghigh
);
509 * Move entries toward the high-numbered stale entry.
512 ASSERT(highstale
< be32_to_cpu(btp
->count
));
515 memmove(&blp
[mid
+ 1], &blp
[mid
],
516 (highstale
- mid
) * sizeof(*blp
));
517 lfloglow
= MIN(mid
, lfloglow
);
518 lfloghigh
= MAX(highstale
, lfloghigh
);
520 be32_add_cpu(&btp
->stale
, -1);
523 * Point to the new data entry.
525 dep
= (xfs_dir2_data_entry_t
*)dup
;
527 * Fill in the leaf entry.
529 blp
[mid
].hashval
= cpu_to_be32(args
->hashval
);
530 blp
[mid
].address
= cpu_to_be32(xfs_dir2_byte_to_dataptr(
531 (char *)dep
- (char *)hdr
));
532 xfs_dir2_block_log_leaf(tp
, bp
, lfloglow
, lfloghigh
);
534 * Mark space for the data entry used.
536 xfs_dir2_data_use_free(args
, bp
, dup
,
537 (xfs_dir2_data_aoff_t
)((char *)dup
- (char *)hdr
),
538 (xfs_dir2_data_aoff_t
)len
, &needlog
, &needscan
);
540 * Create the new data entry.
542 dep
->inumber
= cpu_to_be64(args
->inumber
);
543 dep
->namelen
= args
->namelen
;
544 memcpy(dep
->name
, args
->name
, args
->namelen
);
545 dp
->d_ops
->data_put_ftype(dep
, args
->filetype
);
546 tagp
= dp
->d_ops
->data_entry_tag_p(dep
);
547 *tagp
= cpu_to_be16((char *)dep
- (char *)hdr
);
549 * Clean up the bestfree array and log the header, tail, and entry.
552 xfs_dir2_data_freescan(dp
, hdr
, &needlog
);
554 xfs_dir2_data_log_header(args
, bp
);
555 xfs_dir2_block_log_tail(tp
, bp
);
556 xfs_dir2_data_log_entry(args
, bp
, dep
);
557 xfs_dir3_data_check(dp
, bp
);
562 * Log leaf entries from the block.
565 xfs_dir2_block_log_leaf(
566 xfs_trans_t
*tp
, /* transaction structure */
567 struct xfs_buf
*bp
, /* block buffer */
568 int first
, /* index of first logged leaf */
569 int last
) /* index of last logged leaf */
571 xfs_dir2_data_hdr_t
*hdr
= bp
->b_addr
;
572 xfs_dir2_leaf_entry_t
*blp
;
573 xfs_dir2_block_tail_t
*btp
;
575 btp
= xfs_dir2_block_tail_p(tp
->t_mountp
->m_dir_geo
, hdr
);
576 blp
= xfs_dir2_block_leaf_p(btp
);
577 xfs_trans_log_buf(tp
, bp
, (uint
)((char *)&blp
[first
] - (char *)hdr
),
578 (uint
)((char *)&blp
[last
+ 1] - (char *)hdr
- 1));
582 * Log the block tail.
585 xfs_dir2_block_log_tail(
586 xfs_trans_t
*tp
, /* transaction structure */
587 struct xfs_buf
*bp
) /* block buffer */
589 xfs_dir2_data_hdr_t
*hdr
= bp
->b_addr
;
590 xfs_dir2_block_tail_t
*btp
;
592 btp
= xfs_dir2_block_tail_p(tp
->t_mountp
->m_dir_geo
, hdr
);
593 xfs_trans_log_buf(tp
, bp
, (uint
)((char *)btp
- (char *)hdr
),
594 (uint
)((char *)(btp
+ 1) - (char *)hdr
- 1));
598 * Look up an entry in the block. This is the external routine,
599 * xfs_dir2_block_lookup_int does the real work.
602 xfs_dir2_block_lookup(
603 xfs_da_args_t
*args
) /* dir lookup arguments */
605 xfs_dir2_data_hdr_t
*hdr
; /* block header */
606 xfs_dir2_leaf_entry_t
*blp
; /* block leaf entries */
607 struct xfs_buf
*bp
; /* block buffer */
608 xfs_dir2_block_tail_t
*btp
; /* block tail */
609 xfs_dir2_data_entry_t
*dep
; /* block data entry */
610 xfs_inode_t
*dp
; /* incore inode */
611 int ent
; /* entry index */
612 int error
; /* error return value */
614 trace_xfs_dir2_block_lookup(args
);
617 * Get the buffer, look up the entry.
618 * If not found (ENOENT) then return, have no buffer.
620 if ((error
= xfs_dir2_block_lookup_int(args
, &bp
, &ent
)))
624 xfs_dir3_data_check(dp
, bp
);
625 btp
= xfs_dir2_block_tail_p(args
->geo
, hdr
);
626 blp
= xfs_dir2_block_leaf_p(btp
);
628 * Get the offset from the leaf entry, to point to the data.
630 dep
= (xfs_dir2_data_entry_t
*)((char *)hdr
+
631 xfs_dir2_dataptr_to_off(args
->geo
,
632 be32_to_cpu(blp
[ent
].address
)));
634 * Fill in inode number, CI name if appropriate, release the block.
636 args
->inumber
= be64_to_cpu(dep
->inumber
);
637 args
->filetype
= dp
->d_ops
->data_get_ftype(dep
);
638 error
= xfs_dir_cilookup_result(args
, dep
->name
, dep
->namelen
);
639 xfs_trans_brelse(args
->trans
, bp
);
644 * Internal block lookup routine.
646 static int /* error */
647 xfs_dir2_block_lookup_int(
648 xfs_da_args_t
*args
, /* dir lookup arguments */
649 struct xfs_buf
**bpp
, /* returned block buffer */
650 int *entno
) /* returned entry number */
652 xfs_dir2_dataptr_t addr
; /* data entry address */
653 xfs_dir2_data_hdr_t
*hdr
; /* block header */
654 xfs_dir2_leaf_entry_t
*blp
; /* block leaf entries */
655 struct xfs_buf
*bp
; /* block buffer */
656 xfs_dir2_block_tail_t
*btp
; /* block tail */
657 xfs_dir2_data_entry_t
*dep
; /* block data entry */
658 xfs_inode_t
*dp
; /* incore inode */
659 int error
; /* error return value */
660 xfs_dahash_t hash
; /* found hash value */
661 int high
; /* binary search high index */
662 int low
; /* binary search low index */
663 int mid
; /* binary search current idx */
664 xfs_mount_t
*mp
; /* filesystem mount point */
665 xfs_trans_t
*tp
; /* transaction pointer */
666 enum xfs_dacmp cmp
; /* comparison result */
672 error
= xfs_dir3_block_read(tp
, dp
, &bp
);
677 xfs_dir3_data_check(dp
, bp
);
678 btp
= xfs_dir2_block_tail_p(args
->geo
, hdr
);
679 blp
= xfs_dir2_block_leaf_p(btp
);
681 * Loop doing a binary search for our hash value.
682 * Find our entry, ENOENT if it's not there.
684 for (low
= 0, high
= be32_to_cpu(btp
->count
) - 1; ; ) {
686 mid
= (low
+ high
) >> 1;
687 if ((hash
= be32_to_cpu(blp
[mid
].hashval
)) == args
->hashval
)
689 if (hash
< args
->hashval
)
694 ASSERT(args
->op_flags
& XFS_DA_OP_OKNOENT
);
695 xfs_trans_brelse(tp
, bp
);
700 * Back up to the first one with the right hash value.
702 while (mid
> 0 && be32_to_cpu(blp
[mid
- 1].hashval
) == args
->hashval
) {
706 * Now loop forward through all the entries with the
707 * right hash value looking for our name.
710 if ((addr
= be32_to_cpu(blp
[mid
].address
)) == XFS_DIR2_NULL_DATAPTR
)
713 * Get pointer to the entry from the leaf.
715 dep
= (xfs_dir2_data_entry_t
*)
716 ((char *)hdr
+ xfs_dir2_dataptr_to_off(args
->geo
, addr
));
718 * Compare name and if it's an exact match, return the index
719 * and buffer. If it's the first case-insensitive match, store
720 * the index and buffer and continue looking for an exact match.
722 cmp
= mp
->m_dirnameops
->compname(args
, dep
->name
, dep
->namelen
);
723 if (cmp
!= XFS_CMP_DIFFERENT
&& cmp
!= args
->cmpresult
) {
724 args
->cmpresult
= cmp
;
727 if (cmp
== XFS_CMP_EXACT
)
730 } while (++mid
< be32_to_cpu(btp
->count
) &&
731 be32_to_cpu(blp
[mid
].hashval
) == hash
);
733 ASSERT(args
->op_flags
& XFS_DA_OP_OKNOENT
);
735 * Here, we can only be doing a lookup (not a rename or replace).
736 * If a case-insensitive match was found earlier, return success.
738 if (args
->cmpresult
== XFS_CMP_CASE
)
741 * No match, release the buffer and return ENOENT.
743 xfs_trans_brelse(tp
, bp
);
748 * Remove an entry from a block format directory.
749 * If that makes the block small enough to fit in shortform, transform it.
752 xfs_dir2_block_removename(
753 xfs_da_args_t
*args
) /* directory operation args */
755 xfs_dir2_data_hdr_t
*hdr
; /* block header */
756 xfs_dir2_leaf_entry_t
*blp
; /* block leaf pointer */
757 struct xfs_buf
*bp
; /* block buffer */
758 xfs_dir2_block_tail_t
*btp
; /* block tail */
759 xfs_dir2_data_entry_t
*dep
; /* block data entry */
760 xfs_inode_t
*dp
; /* incore inode */
761 int ent
; /* block leaf entry index */
762 int error
; /* error return value */
763 int needlog
; /* need to log block header */
764 int needscan
; /* need to fixup bestfree */
765 xfs_dir2_sf_hdr_t sfh
; /* shortform header */
766 int size
; /* shortform size */
767 xfs_trans_t
*tp
; /* transaction pointer */
769 trace_xfs_dir2_block_removename(args
);
772 * Look up the entry in the block. Gets the buffer and entry index.
773 * It will always be there, the vnodeops level does a lookup first.
775 if ((error
= xfs_dir2_block_lookup_int(args
, &bp
, &ent
))) {
781 btp
= xfs_dir2_block_tail_p(args
->geo
, hdr
);
782 blp
= xfs_dir2_block_leaf_p(btp
);
784 * Point to the data entry using the leaf entry.
786 dep
= (xfs_dir2_data_entry_t
*)((char *)hdr
+
787 xfs_dir2_dataptr_to_off(args
->geo
,
788 be32_to_cpu(blp
[ent
].address
)));
790 * Mark the data entry's space free.
792 needlog
= needscan
= 0;
793 xfs_dir2_data_make_free(args
, bp
,
794 (xfs_dir2_data_aoff_t
)((char *)dep
- (char *)hdr
),
795 dp
->d_ops
->data_entsize(dep
->namelen
), &needlog
, &needscan
);
797 * Fix up the block tail.
799 be32_add_cpu(&btp
->stale
, 1);
800 xfs_dir2_block_log_tail(tp
, bp
);
802 * Remove the leaf entry by marking it stale.
804 blp
[ent
].address
= cpu_to_be32(XFS_DIR2_NULL_DATAPTR
);
805 xfs_dir2_block_log_leaf(tp
, bp
, ent
, ent
);
807 * Fix up bestfree, log the header if necessary.
810 xfs_dir2_data_freescan(dp
, hdr
, &needlog
);
812 xfs_dir2_data_log_header(args
, bp
);
813 xfs_dir3_data_check(dp
, bp
);
815 * See if the size as a shortform is good enough.
817 size
= xfs_dir2_block_sfsize(dp
, hdr
, &sfh
);
818 if (size
> XFS_IFORK_DSIZE(dp
))
822 * If it works, do the conversion.
824 return xfs_dir2_block_to_sf(args
, bp
, size
, &sfh
);
828 * Replace an entry in a V2 block directory.
829 * Change the inode number to the new value.
832 xfs_dir2_block_replace(
833 xfs_da_args_t
*args
) /* directory operation args */
835 xfs_dir2_data_hdr_t
*hdr
; /* block header */
836 xfs_dir2_leaf_entry_t
*blp
; /* block leaf entries */
837 struct xfs_buf
*bp
; /* block buffer */
838 xfs_dir2_block_tail_t
*btp
; /* block tail */
839 xfs_dir2_data_entry_t
*dep
; /* block data entry */
840 xfs_inode_t
*dp
; /* incore inode */
841 int ent
; /* leaf entry index */
842 int error
; /* error return value */
844 trace_xfs_dir2_block_replace(args
);
847 * Lookup the entry in the directory. Get buffer and entry index.
848 * This will always succeed since the caller has already done a lookup.
850 if ((error
= xfs_dir2_block_lookup_int(args
, &bp
, &ent
))) {
855 btp
= xfs_dir2_block_tail_p(args
->geo
, hdr
);
856 blp
= xfs_dir2_block_leaf_p(btp
);
858 * Point to the data entry we need to change.
860 dep
= (xfs_dir2_data_entry_t
*)((char *)hdr
+
861 xfs_dir2_dataptr_to_off(args
->geo
,
862 be32_to_cpu(blp
[ent
].address
)));
863 ASSERT(be64_to_cpu(dep
->inumber
) != args
->inumber
);
865 * Change the inode number to the new value.
867 dep
->inumber
= cpu_to_be64(args
->inumber
);
868 dp
->d_ops
->data_put_ftype(dep
, args
->filetype
);
869 xfs_dir2_data_log_entry(args
, bp
, dep
);
870 xfs_dir3_data_check(dp
, bp
);
875 * Qsort comparison routine for the block leaf entries.
877 static int /* sort order */
879 const void *a
, /* first leaf entry */
880 const void *b
) /* second leaf entry */
882 const xfs_dir2_leaf_entry_t
*la
; /* first leaf entry */
883 const xfs_dir2_leaf_entry_t
*lb
; /* second leaf entry */
887 return be32_to_cpu(la
->hashval
) < be32_to_cpu(lb
->hashval
) ? -1 :
888 (be32_to_cpu(la
->hashval
) > be32_to_cpu(lb
->hashval
) ? 1 : 0);
892 * Convert a V2 leaf directory to a V2 block directory if possible.
895 xfs_dir2_leaf_to_block(
896 xfs_da_args_t
*args
, /* operation arguments */
897 struct xfs_buf
*lbp
, /* leaf buffer */
898 struct xfs_buf
*dbp
) /* data buffer */
900 __be16
*bestsp
; /* leaf bests table */
901 xfs_dir2_data_hdr_t
*hdr
; /* block header */
902 xfs_dir2_block_tail_t
*btp
; /* block tail */
903 xfs_inode_t
*dp
; /* incore directory inode */
904 xfs_dir2_data_unused_t
*dup
; /* unused data entry */
905 int error
; /* error return value */
906 int from
; /* leaf from index */
907 xfs_dir2_leaf_t
*leaf
; /* leaf structure */
908 xfs_dir2_leaf_entry_t
*lep
; /* leaf entry */
909 xfs_dir2_leaf_tail_t
*ltp
; /* leaf tail structure */
910 xfs_mount_t
*mp
; /* file system mount point */
911 int needlog
; /* need to log data header */
912 int needscan
; /* need to scan for bestfree */
913 xfs_dir2_sf_hdr_t sfh
; /* shortform header */
914 int size
; /* bytes used */
915 __be16
*tagp
; /* end of entry (tag) */
916 int to
; /* block/leaf to index */
917 xfs_trans_t
*tp
; /* transaction pointer */
918 struct xfs_dir2_leaf_entry
*ents
;
919 struct xfs_dir3_icleaf_hdr leafhdr
;
921 trace_xfs_dir2_leaf_to_block(args
);
927 dp
->d_ops
->leaf_hdr_from_disk(&leafhdr
, leaf
);
928 ents
= dp
->d_ops
->leaf_ents_p(leaf
);
929 ltp
= xfs_dir2_leaf_tail_p(args
->geo
, leaf
);
931 ASSERT(leafhdr
.magic
== XFS_DIR2_LEAF1_MAGIC
||
932 leafhdr
.magic
== XFS_DIR3_LEAF1_MAGIC
);
934 * If there are data blocks other than the first one, take this
935 * opportunity to remove trailing empty data blocks that may have
936 * been left behind during no-space-reservation operations.
937 * These will show up in the leaf bests table.
939 while (dp
->i_d
.di_size
> args
->geo
->blksize
) {
942 hdrsz
= dp
->d_ops
->data_entry_offset
;
943 bestsp
= xfs_dir2_leaf_bests_p(ltp
);
944 if (be16_to_cpu(bestsp
[be32_to_cpu(ltp
->bestcount
) - 1]) ==
945 args
->geo
->blksize
- hdrsz
) {
947 xfs_dir2_leaf_trim_data(args
, lbp
,
948 (xfs_dir2_db_t
)(be32_to_cpu(ltp
->bestcount
) - 1))))
954 * Read the data block if we don't already have it, give up if it fails.
957 error
= xfs_dir3_data_read(tp
, dp
, args
->geo
->datablk
, -1, &dbp
);
962 ASSERT(hdr
->magic
== cpu_to_be32(XFS_DIR2_DATA_MAGIC
) ||
963 hdr
->magic
== cpu_to_be32(XFS_DIR3_DATA_MAGIC
));
966 * Size of the "leaf" area in the block.
968 size
= (uint
)sizeof(xfs_dir2_block_tail_t
) +
969 (uint
)sizeof(*lep
) * (leafhdr
.count
- leafhdr
.stale
);
971 * Look at the last data entry.
973 tagp
= (__be16
*)((char *)hdr
+ args
->geo
->blksize
) - 1;
974 dup
= (xfs_dir2_data_unused_t
*)((char *)hdr
+ be16_to_cpu(*tagp
));
976 * If it's not free or is too short we can't do it.
978 if (be16_to_cpu(dup
->freetag
) != XFS_DIR2_DATA_FREE_TAG
||
979 be16_to_cpu(dup
->length
) < size
)
983 * Start converting it to block form.
985 xfs_dir3_block_init(mp
, tp
, dbp
, dp
);
990 * Use up the space at the end of the block (blp/btp).
992 xfs_dir2_data_use_free(args
, dbp
, dup
, args
->geo
->blksize
- size
, size
,
993 &needlog
, &needscan
);
995 * Initialize the block tail.
997 btp
= xfs_dir2_block_tail_p(args
->geo
, hdr
);
998 btp
->count
= cpu_to_be32(leafhdr
.count
- leafhdr
.stale
);
1000 xfs_dir2_block_log_tail(tp
, dbp
);
1002 * Initialize the block leaf area. We compact out stale entries.
1004 lep
= xfs_dir2_block_leaf_p(btp
);
1005 for (from
= to
= 0; from
< leafhdr
.count
; from
++) {
1006 if (ents
[from
].address
== cpu_to_be32(XFS_DIR2_NULL_DATAPTR
))
1008 lep
[to
++] = ents
[from
];
1010 ASSERT(to
== be32_to_cpu(btp
->count
));
1011 xfs_dir2_block_log_leaf(tp
, dbp
, 0, be32_to_cpu(btp
->count
) - 1);
1013 * Scan the bestfree if we need it and log the data block header.
1016 xfs_dir2_data_freescan(dp
, hdr
, &needlog
);
1018 xfs_dir2_data_log_header(args
, dbp
);
1020 * Pitch the old leaf block.
1022 error
= xfs_da_shrink_inode(args
, args
->geo
->leafblk
, lbp
);
1027 * Now see if the resulting block can be shrunken to shortform.
1029 size
= xfs_dir2_block_sfsize(dp
, hdr
, &sfh
);
1030 if (size
> XFS_IFORK_DSIZE(dp
))
1033 return xfs_dir2_block_to_sf(args
, dbp
, size
, &sfh
);
1037 * Convert the shortform directory to block form.
1040 xfs_dir2_sf_to_block(
1041 xfs_da_args_t
*args
) /* operation arguments */
1043 xfs_dir2_db_t blkno
; /* dir-relative block # (0) */
1044 xfs_dir2_data_hdr_t
*hdr
; /* block header */
1045 xfs_dir2_leaf_entry_t
*blp
; /* block leaf entries */
1046 struct xfs_buf
*bp
; /* block buffer */
1047 xfs_dir2_block_tail_t
*btp
; /* block tail pointer */
1048 xfs_dir2_data_entry_t
*dep
; /* data entry pointer */
1049 xfs_inode_t
*dp
; /* incore directory inode */
1050 int dummy
; /* trash */
1051 xfs_dir2_data_unused_t
*dup
; /* unused entry pointer */
1052 int endoffset
; /* end of data objects */
1053 int error
; /* error return value */
1055 xfs_mount_t
*mp
; /* filesystem mount point */
1056 int needlog
; /* need to log block header */
1057 int needscan
; /* need to scan block freespc */
1058 int newoffset
; /* offset from current entry */
1059 int offset
; /* target block offset */
1060 xfs_dir2_sf_entry_t
*sfep
; /* sf entry pointer */
1061 xfs_dir2_sf_hdr_t
*oldsfp
; /* old shortform header */
1062 xfs_dir2_sf_hdr_t
*sfp
; /* shortform header */
1063 __be16
*tagp
; /* end of data entry */
1064 xfs_trans_t
*tp
; /* transaction pointer */
1065 struct xfs_name name
;
1066 struct xfs_ifork
*ifp
;
1068 trace_xfs_dir2_sf_to_block(args
);
1073 ifp
= XFS_IFORK_PTR(dp
, XFS_DATA_FORK
);
1074 ASSERT(ifp
->if_flags
& XFS_IFINLINE
);
1076 * Bomb out if the shortform directory is way too short.
1078 if (dp
->i_d
.di_size
< offsetof(xfs_dir2_sf_hdr_t
, parent
)) {
1079 ASSERT(XFS_FORCED_SHUTDOWN(mp
));
1083 oldsfp
= (xfs_dir2_sf_hdr_t
*)ifp
->if_u1
.if_data
;
1085 ASSERT(ifp
->if_bytes
== dp
->i_d
.di_size
);
1086 ASSERT(ifp
->if_u1
.if_data
!= NULL
);
1087 ASSERT(dp
->i_d
.di_size
>= xfs_dir2_sf_hdr_size(oldsfp
->i8count
));
1088 ASSERT(dp
->i_d
.di_nextents
== 0);
1091 * Copy the directory into a temporary buffer.
1092 * Then pitch the incore inode data so we can make extents.
1094 sfp
= kmem_alloc(ifp
->if_bytes
, KM_SLEEP
);
1095 memcpy(sfp
, oldsfp
, ifp
->if_bytes
);
1097 xfs_idata_realloc(dp
, -ifp
->if_bytes
, XFS_DATA_FORK
);
1098 xfs_bmap_local_to_extents_empty(dp
, XFS_DATA_FORK
);
1099 dp
->i_d
.di_size
= 0;
1102 * Add block 0 to the inode.
1104 error
= xfs_dir2_grow_inode(args
, XFS_DIR2_DATA_SPACE
, &blkno
);
1110 * Initialize the data block, then convert it to block format.
1112 error
= xfs_dir3_data_init(args
, blkno
, &bp
);
1117 xfs_dir3_block_init(mp
, tp
, bp
, dp
);
1121 * Compute size of block "tail" area.
1123 i
= (uint
)sizeof(*btp
) +
1124 (sfp
->count
+ 2) * (uint
)sizeof(xfs_dir2_leaf_entry_t
);
1126 * The whole thing is initialized to free by the init routine.
1127 * Say we're using the leaf and tail area.
1129 dup
= dp
->d_ops
->data_unused_p(hdr
);
1130 needlog
= needscan
= 0;
1131 xfs_dir2_data_use_free(args
, bp
, dup
, args
->geo
->blksize
- i
,
1132 i
, &needlog
, &needscan
);
1133 ASSERT(needscan
== 0);
1137 btp
= xfs_dir2_block_tail_p(args
->geo
, hdr
);
1138 btp
->count
= cpu_to_be32(sfp
->count
+ 2); /* ., .. */
1140 blp
= xfs_dir2_block_leaf_p(btp
);
1141 endoffset
= (uint
)((char *)blp
- (char *)hdr
);
1143 * Remove the freespace, we'll manage it.
1145 xfs_dir2_data_use_free(args
, bp
, dup
,
1146 (xfs_dir2_data_aoff_t
)((char *)dup
- (char *)hdr
),
1147 be16_to_cpu(dup
->length
), &needlog
, &needscan
);
1149 * Create entry for .
1151 dep
= dp
->d_ops
->data_dot_entry_p(hdr
);
1152 dep
->inumber
= cpu_to_be64(dp
->i_ino
);
1155 dp
->d_ops
->data_put_ftype(dep
, XFS_DIR3_FT_DIR
);
1156 tagp
= dp
->d_ops
->data_entry_tag_p(dep
);
1157 *tagp
= cpu_to_be16((char *)dep
- (char *)hdr
);
1158 xfs_dir2_data_log_entry(args
, bp
, dep
);
1159 blp
[0].hashval
= cpu_to_be32(xfs_dir_hash_dot
);
1160 blp
[0].address
= cpu_to_be32(xfs_dir2_byte_to_dataptr(
1161 (char *)dep
- (char *)hdr
));
1163 * Create entry for ..
1165 dep
= dp
->d_ops
->data_dotdot_entry_p(hdr
);
1166 dep
->inumber
= cpu_to_be64(dp
->d_ops
->sf_get_parent_ino(sfp
));
1168 dep
->name
[0] = dep
->name
[1] = '.';
1169 dp
->d_ops
->data_put_ftype(dep
, XFS_DIR3_FT_DIR
);
1170 tagp
= dp
->d_ops
->data_entry_tag_p(dep
);
1171 *tagp
= cpu_to_be16((char *)dep
- (char *)hdr
);
1172 xfs_dir2_data_log_entry(args
, bp
, dep
);
1173 blp
[1].hashval
= cpu_to_be32(xfs_dir_hash_dotdot
);
1174 blp
[1].address
= cpu_to_be32(xfs_dir2_byte_to_dataptr(
1175 (char *)dep
- (char *)hdr
));
1176 offset
= dp
->d_ops
->data_first_offset
;
1178 * Loop over existing entries, stuff them in.
1184 sfep
= xfs_dir2_sf_firstentry(sfp
);
1186 * Need to preserve the existing offset values in the sf directory.
1187 * Insert holes (unused entries) where necessary.
1189 while (offset
< endoffset
) {
1191 * sfep is null when we reach the end of the list.
1194 newoffset
= endoffset
;
1196 newoffset
= xfs_dir2_sf_get_offset(sfep
);
1198 * There should be a hole here, make one.
1200 if (offset
< newoffset
) {
1201 dup
= (xfs_dir2_data_unused_t
*)((char *)hdr
+ offset
);
1202 dup
->freetag
= cpu_to_be16(XFS_DIR2_DATA_FREE_TAG
);
1203 dup
->length
= cpu_to_be16(newoffset
- offset
);
1204 *xfs_dir2_data_unused_tag_p(dup
) = cpu_to_be16(
1205 ((char *)dup
- (char *)hdr
));
1206 xfs_dir2_data_log_unused(args
, bp
, dup
);
1207 xfs_dir2_data_freeinsert(hdr
,
1208 dp
->d_ops
->data_bestfree_p(hdr
),
1210 offset
+= be16_to_cpu(dup
->length
);
1214 * Copy a real entry.
1216 dep
= (xfs_dir2_data_entry_t
*)((char *)hdr
+ newoffset
);
1217 dep
->inumber
= cpu_to_be64(dp
->d_ops
->sf_get_ino(sfp
, sfep
));
1218 dep
->namelen
= sfep
->namelen
;
1219 dp
->d_ops
->data_put_ftype(dep
, dp
->d_ops
->sf_get_ftype(sfep
));
1220 memcpy(dep
->name
, sfep
->name
, dep
->namelen
);
1221 tagp
= dp
->d_ops
->data_entry_tag_p(dep
);
1222 *tagp
= cpu_to_be16((char *)dep
- (char *)hdr
);
1223 xfs_dir2_data_log_entry(args
, bp
, dep
);
1224 name
.name
= sfep
->name
;
1225 name
.len
= sfep
->namelen
;
1226 blp
[2 + i
].hashval
= cpu_to_be32(mp
->m_dirnameops
->
1228 blp
[2 + i
].address
= cpu_to_be32(xfs_dir2_byte_to_dataptr(
1229 (char *)dep
- (char *)hdr
));
1230 offset
= (int)((char *)(tagp
+ 1) - (char *)hdr
);
1231 if (++i
== sfp
->count
)
1234 sfep
= dp
->d_ops
->sf_nextentry(sfp
, sfep
);
1236 /* Done with the temporary buffer */
1239 * Sort the leaf entries by hash value.
1241 xfs_sort(blp
, be32_to_cpu(btp
->count
), sizeof(*blp
), xfs_dir2_block_sort
);
1243 * Log the leaf entry area and tail.
1244 * Already logged the header in data_init, ignore needlog.
1246 ASSERT(needscan
== 0);
1247 xfs_dir2_block_log_leaf(tp
, bp
, 0, be32_to_cpu(btp
->count
) - 1);
1248 xfs_dir2_block_log_tail(tp
, bp
);
1249 xfs_dir3_data_check(dp
, bp
);