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
21 #include "xfs_format.h"
22 #include "xfs_log_format.h"
23 #include "xfs_trans_resv.h"
25 #include "xfs_mount.h"
26 #include "xfs_da_format.h"
27 #include "xfs_da_btree.h"
28 #include "xfs_inode.h"
31 #include "xfs_dir2_priv.h"
32 #include "xfs_error.h"
33 #include "xfs_trace.h"
34 #include "xfs_trans.h"
35 #include "xfs_buf_item.h"
36 #include "xfs_cksum.h"
39 * Local function declarations.
41 static int xfs_dir2_leaf_lookup_int(xfs_da_args_t
*args
, struct xfs_buf
**lbpp
,
42 int *indexp
, struct xfs_buf
**dbpp
);
43 static void xfs_dir3_leaf_log_bests(struct xfs_da_args
*args
,
44 struct xfs_buf
*bp
, int first
, int last
);
45 static void xfs_dir3_leaf_log_tail(struct xfs_da_args
*args
,
49 * Check the internal consistency of a leaf1 block.
50 * Pop an assert if something is wrong.
53 #define xfs_dir3_leaf_check(dp, bp) \
55 if (!xfs_dir3_leaf1_check((dp), (bp))) \
64 struct xfs_dir2_leaf
*leaf
= bp
->b_addr
;
65 struct xfs_dir3_icleaf_hdr leafhdr
;
67 dp
->d_ops
->leaf_hdr_from_disk(&leafhdr
, leaf
);
69 if (leafhdr
.magic
== XFS_DIR3_LEAF1_MAGIC
) {
70 struct xfs_dir3_leaf_hdr
*leaf3
= bp
->b_addr
;
71 if (be64_to_cpu(leaf3
->info
.blkno
) != bp
->b_bn
)
73 } else if (leafhdr
.magic
!= XFS_DIR2_LEAF1_MAGIC
)
76 return xfs_dir3_leaf_check_int(dp
->i_mount
, dp
, &leafhdr
, leaf
);
79 #define xfs_dir3_leaf_check(dp, bp)
83 xfs_dir3_leaf_check_int(
86 struct xfs_dir3_icleaf_hdr
*hdr
,
87 struct xfs_dir2_leaf
*leaf
)
89 struct xfs_dir2_leaf_entry
*ents
;
90 xfs_dir2_leaf_tail_t
*ltp
;
93 const struct xfs_dir_ops
*ops
;
94 struct xfs_dir3_icleaf_hdr leafhdr
;
95 struct xfs_da_geometry
*geo
= mp
->m_dir_geo
;
98 * we can be passed a null dp here from a verifier, so we need to go the
99 * hard way to get them.
101 ops
= xfs_dir_get_ops(mp
, dp
);
104 ops
->leaf_hdr_from_disk(&leafhdr
, leaf
);
108 ents
= ops
->leaf_ents_p(leaf
);
109 ltp
= xfs_dir2_leaf_tail_p(geo
, leaf
);
112 * XXX (dgc): This value is not restrictive enough.
113 * Should factor in the size of the bests table as well.
114 * We can deduce a value for that from di_size.
116 if (hdr
->count
> ops
->leaf_max_ents(geo
))
119 /* Leaves and bests don't overlap in leaf format. */
120 if ((hdr
->magic
== XFS_DIR2_LEAF1_MAGIC
||
121 hdr
->magic
== XFS_DIR3_LEAF1_MAGIC
) &&
122 (char *)&ents
[hdr
->count
] > (char *)xfs_dir2_leaf_bests_p(ltp
))
125 /* Check hash value order, count stale entries. */
126 for (i
= stale
= 0; i
< hdr
->count
; i
++) {
127 if (i
+ 1 < hdr
->count
) {
128 if (be32_to_cpu(ents
[i
].hashval
) >
129 be32_to_cpu(ents
[i
+ 1].hashval
))
132 if (ents
[i
].address
== cpu_to_be32(XFS_DIR2_NULL_DATAPTR
))
135 if (hdr
->stale
!= stale
)
141 * We verify the magic numbers before decoding the leaf header so that on debug
142 * kernels we don't get assertion failures in xfs_dir3_leaf_hdr_from_disk() due
143 * to incorrect magic numbers.
146 xfs_dir3_leaf_verify(
150 struct xfs_mount
*mp
= bp
->b_target
->bt_mount
;
151 struct xfs_dir2_leaf
*leaf
= bp
->b_addr
;
153 ASSERT(magic
== XFS_DIR2_LEAF1_MAGIC
|| magic
== XFS_DIR2_LEAFN_MAGIC
);
155 if (xfs_sb_version_hascrc(&mp
->m_sb
)) {
156 struct xfs_dir3_leaf_hdr
*leaf3
= bp
->b_addr
;
159 magic3
= (magic
== XFS_DIR2_LEAF1_MAGIC
) ? XFS_DIR3_LEAF1_MAGIC
160 : XFS_DIR3_LEAFN_MAGIC
;
162 if (leaf3
->info
.hdr
.magic
!= cpu_to_be16(magic3
))
164 if (!uuid_equal(&leaf3
->info
.uuid
, &mp
->m_sb
.sb_uuid
))
166 if (be64_to_cpu(leaf3
->info
.blkno
) != bp
->b_bn
)
169 if (leaf
->hdr
.info
.magic
!= cpu_to_be16(magic
))
173 return xfs_dir3_leaf_check_int(mp
, NULL
, NULL
, leaf
);
181 struct xfs_mount
*mp
= bp
->b_target
->bt_mount
;
183 if (xfs_sb_version_hascrc(&mp
->m_sb
) &&
184 !xfs_buf_verify_cksum(bp
, XFS_DIR3_LEAF_CRC_OFF
))
185 xfs_buf_ioerror(bp
, -EFSBADCRC
);
186 else if (!xfs_dir3_leaf_verify(bp
, magic
))
187 xfs_buf_ioerror(bp
, -EFSCORRUPTED
);
190 xfs_verifier_error(bp
);
198 struct xfs_mount
*mp
= bp
->b_target
->bt_mount
;
199 struct xfs_buf_log_item
*bip
= bp
->b_fspriv
;
200 struct xfs_dir3_leaf_hdr
*hdr3
= bp
->b_addr
;
202 if (!xfs_dir3_leaf_verify(bp
, magic
)) {
203 xfs_buf_ioerror(bp
, -EFSCORRUPTED
);
204 xfs_verifier_error(bp
);
208 if (!xfs_sb_version_hascrc(&mp
->m_sb
))
212 hdr3
->info
.lsn
= cpu_to_be64(bip
->bli_item
.li_lsn
);
214 xfs_buf_update_cksum(bp
, XFS_DIR3_LEAF_CRC_OFF
);
218 xfs_dir3_leaf1_read_verify(
221 __read_verify(bp
, XFS_DIR2_LEAF1_MAGIC
);
225 xfs_dir3_leaf1_write_verify(
228 __write_verify(bp
, XFS_DIR2_LEAF1_MAGIC
);
232 xfs_dir3_leafn_read_verify(
235 __read_verify(bp
, XFS_DIR2_LEAFN_MAGIC
);
239 xfs_dir3_leafn_write_verify(
242 __write_verify(bp
, XFS_DIR2_LEAFN_MAGIC
);
245 const struct xfs_buf_ops xfs_dir3_leaf1_buf_ops
= {
246 .verify_read
= xfs_dir3_leaf1_read_verify
,
247 .verify_write
= xfs_dir3_leaf1_write_verify
,
250 const struct xfs_buf_ops xfs_dir3_leafn_buf_ops
= {
251 .verify_read
= xfs_dir3_leafn_read_verify
,
252 .verify_write
= xfs_dir3_leafn_write_verify
,
257 struct xfs_trans
*tp
,
258 struct xfs_inode
*dp
,
260 xfs_daddr_t mappedbno
,
261 struct xfs_buf
**bpp
)
265 err
= xfs_da_read_buf(tp
, dp
, fbno
, mappedbno
, bpp
,
266 XFS_DATA_FORK
, &xfs_dir3_leaf1_buf_ops
);
268 xfs_trans_buf_set_type(tp
, *bpp
, XFS_BLFT_DIR_LEAF1_BUF
);
274 struct xfs_trans
*tp
,
275 struct xfs_inode
*dp
,
277 xfs_daddr_t mappedbno
,
278 struct xfs_buf
**bpp
)
282 err
= xfs_da_read_buf(tp
, dp
, fbno
, mappedbno
, bpp
,
283 XFS_DATA_FORK
, &xfs_dir3_leafn_buf_ops
);
285 xfs_trans_buf_set_type(tp
, *bpp
, XFS_BLFT_DIR_LEAFN_BUF
);
290 * Initialize a new leaf block, leaf1 or leafn magic accepted.
294 struct xfs_mount
*mp
,
295 struct xfs_trans
*tp
,
300 struct xfs_dir2_leaf
*leaf
= bp
->b_addr
;
302 ASSERT(type
== XFS_DIR2_LEAF1_MAGIC
|| type
== XFS_DIR2_LEAFN_MAGIC
);
304 if (xfs_sb_version_hascrc(&mp
->m_sb
)) {
305 struct xfs_dir3_leaf_hdr
*leaf3
= bp
->b_addr
;
307 memset(leaf3
, 0, sizeof(*leaf3
));
309 leaf3
->info
.hdr
.magic
= (type
== XFS_DIR2_LEAF1_MAGIC
)
310 ? cpu_to_be16(XFS_DIR3_LEAF1_MAGIC
)
311 : cpu_to_be16(XFS_DIR3_LEAFN_MAGIC
);
312 leaf3
->info
.blkno
= cpu_to_be64(bp
->b_bn
);
313 leaf3
->info
.owner
= cpu_to_be64(owner
);
314 uuid_copy(&leaf3
->info
.uuid
, &mp
->m_sb
.sb_uuid
);
316 memset(leaf
, 0, sizeof(*leaf
));
317 leaf
->hdr
.info
.magic
= cpu_to_be16(type
);
321 * If it's a leaf-format directory initialize the tail.
322 * Caller is responsible for initialising the bests table.
324 if (type
== XFS_DIR2_LEAF1_MAGIC
) {
325 struct xfs_dir2_leaf_tail
*ltp
;
327 ltp
= xfs_dir2_leaf_tail_p(mp
->m_dir_geo
, leaf
);
329 bp
->b_ops
= &xfs_dir3_leaf1_buf_ops
;
330 xfs_trans_buf_set_type(tp
, bp
, XFS_BLFT_DIR_LEAF1_BUF
);
332 bp
->b_ops
= &xfs_dir3_leafn_buf_ops
;
333 xfs_trans_buf_set_type(tp
, bp
, XFS_BLFT_DIR_LEAFN_BUF
);
338 xfs_dir3_leaf_get_buf(
341 struct xfs_buf
**bpp
,
344 struct xfs_inode
*dp
= args
->dp
;
345 struct xfs_trans
*tp
= args
->trans
;
346 struct xfs_mount
*mp
= dp
->i_mount
;
350 ASSERT(magic
== XFS_DIR2_LEAF1_MAGIC
|| magic
== XFS_DIR2_LEAFN_MAGIC
);
351 ASSERT(bno
>= xfs_dir2_byte_to_db(args
->geo
, XFS_DIR2_LEAF_OFFSET
) &&
352 bno
< xfs_dir2_byte_to_db(args
->geo
, XFS_DIR2_FREE_OFFSET
));
354 error
= xfs_da_get_buf(tp
, dp
, xfs_dir2_db_to_da(args
->geo
, bno
),
355 -1, &bp
, XFS_DATA_FORK
);
359 xfs_dir3_leaf_init(mp
, tp
, bp
, dp
->i_ino
, magic
);
360 xfs_dir3_leaf_log_header(args
, bp
);
361 if (magic
== XFS_DIR2_LEAF1_MAGIC
)
362 xfs_dir3_leaf_log_tail(args
, bp
);
368 * Convert a block form directory to a leaf form directory.
371 xfs_dir2_block_to_leaf(
372 xfs_da_args_t
*args
, /* operation arguments */
373 struct xfs_buf
*dbp
) /* input block's buffer */
375 __be16
*bestsp
; /* leaf's bestsp entries */
376 xfs_dablk_t blkno
; /* leaf block's bno */
377 xfs_dir2_data_hdr_t
*hdr
; /* block header */
378 xfs_dir2_leaf_entry_t
*blp
; /* block's leaf entries */
379 xfs_dir2_block_tail_t
*btp
; /* block's tail */
380 xfs_inode_t
*dp
; /* incore directory inode */
381 int error
; /* error return code */
382 struct xfs_buf
*lbp
; /* leaf block's buffer */
383 xfs_dir2_db_t ldb
; /* leaf block's bno */
384 xfs_dir2_leaf_t
*leaf
; /* leaf structure */
385 xfs_dir2_leaf_tail_t
*ltp
; /* leaf's tail */
386 xfs_mount_t
*mp
; /* filesystem mount point */
387 int needlog
; /* need to log block header */
388 int needscan
; /* need to rescan bestfree */
389 xfs_trans_t
*tp
; /* transaction pointer */
390 struct xfs_dir2_data_free
*bf
;
391 struct xfs_dir2_leaf_entry
*ents
;
392 struct xfs_dir3_icleaf_hdr leafhdr
;
394 trace_xfs_dir2_block_to_leaf(args
);
400 * Add the leaf block to the inode.
401 * This interface will only put blocks in the leaf/node range.
402 * Since that's empty now, we'll get the root (block 0 in range).
404 if ((error
= xfs_da_grow_inode(args
, &blkno
))) {
407 ldb
= xfs_dir2_da_to_db(args
->geo
, blkno
);
408 ASSERT(ldb
== xfs_dir2_byte_to_db(args
->geo
, XFS_DIR2_LEAF_OFFSET
));
410 * Initialize the leaf block, get a buffer for it.
412 error
= xfs_dir3_leaf_get_buf(args
, ldb
, &lbp
, XFS_DIR2_LEAF1_MAGIC
);
418 xfs_dir3_data_check(dp
, dbp
);
419 btp
= xfs_dir2_block_tail_p(args
->geo
, hdr
);
420 blp
= xfs_dir2_block_leaf_p(btp
);
421 bf
= dp
->d_ops
->data_bestfree_p(hdr
);
422 ents
= dp
->d_ops
->leaf_ents_p(leaf
);
425 * Set the counts in the leaf header.
427 dp
->d_ops
->leaf_hdr_from_disk(&leafhdr
, leaf
);
428 leafhdr
.count
= be32_to_cpu(btp
->count
);
429 leafhdr
.stale
= be32_to_cpu(btp
->stale
);
430 dp
->d_ops
->leaf_hdr_to_disk(leaf
, &leafhdr
);
431 xfs_dir3_leaf_log_header(args
, lbp
);
434 * Could compact these but I think we always do the conversion
435 * after squeezing out stale entries.
437 memcpy(ents
, blp
, be32_to_cpu(btp
->count
) * sizeof(xfs_dir2_leaf_entry_t
));
438 xfs_dir3_leaf_log_ents(args
, lbp
, 0, leafhdr
.count
- 1);
442 * Make the space formerly occupied by the leaf entries and block
445 xfs_dir2_data_make_free(args
, dbp
,
446 (xfs_dir2_data_aoff_t
)((char *)blp
- (char *)hdr
),
447 (xfs_dir2_data_aoff_t
)((char *)hdr
+ args
->geo
->blksize
-
449 &needlog
, &needscan
);
451 * Fix up the block header, make it a data block.
453 dbp
->b_ops
= &xfs_dir3_data_buf_ops
;
454 xfs_trans_buf_set_type(tp
, dbp
, XFS_BLFT_DIR_DATA_BUF
);
455 if (hdr
->magic
== cpu_to_be32(XFS_DIR2_BLOCK_MAGIC
))
456 hdr
->magic
= cpu_to_be32(XFS_DIR2_DATA_MAGIC
);
458 hdr
->magic
= cpu_to_be32(XFS_DIR3_DATA_MAGIC
);
461 xfs_dir2_data_freescan(dp
, hdr
, &needlog
);
463 * Set up leaf tail and bests table.
465 ltp
= xfs_dir2_leaf_tail_p(args
->geo
, leaf
);
466 ltp
->bestcount
= cpu_to_be32(1);
467 bestsp
= xfs_dir2_leaf_bests_p(ltp
);
468 bestsp
[0] = bf
[0].length
;
470 * Log the data header and leaf bests table.
473 xfs_dir2_data_log_header(args
, dbp
);
474 xfs_dir3_leaf_check(dp
, lbp
);
475 xfs_dir3_data_check(dp
, dbp
);
476 xfs_dir3_leaf_log_bests(args
, lbp
, 0, 0);
481 xfs_dir3_leaf_find_stale(
482 struct xfs_dir3_icleaf_hdr
*leafhdr
,
483 struct xfs_dir2_leaf_entry
*ents
,
489 * Find the first stale entry before our index, if any.
491 for (*lowstale
= index
- 1; *lowstale
>= 0; --*lowstale
) {
492 if (ents
[*lowstale
].address
==
493 cpu_to_be32(XFS_DIR2_NULL_DATAPTR
))
498 * Find the first stale entry at or after our index, if any.
499 * Stop if the result would require moving more entries than using
502 for (*highstale
= index
; *highstale
< leafhdr
->count
; ++*highstale
) {
503 if (ents
[*highstale
].address
==
504 cpu_to_be32(XFS_DIR2_NULL_DATAPTR
))
506 if (*lowstale
>= 0 && index
- *lowstale
<= *highstale
- index
)
511 struct xfs_dir2_leaf_entry
*
512 xfs_dir3_leaf_find_entry(
513 struct xfs_dir3_icleaf_hdr
*leafhdr
,
514 struct xfs_dir2_leaf_entry
*ents
,
515 int index
, /* leaf table position */
516 int compact
, /* need to compact leaves */
517 int lowstale
, /* index of prev stale leaf */
518 int highstale
, /* index of next stale leaf */
519 int *lfloglow
, /* low leaf logging index */
520 int *lfloghigh
) /* high leaf logging index */
522 if (!leafhdr
->stale
) {
523 xfs_dir2_leaf_entry_t
*lep
; /* leaf entry table pointer */
526 * Now we need to make room to insert the leaf entry.
528 * If there are no stale entries, just insert a hole at index.
531 if (index
< leafhdr
->count
)
532 memmove(lep
+ 1, lep
,
533 (leafhdr
->count
- index
) * sizeof(*lep
));
536 * Record low and high logging indices for the leaf.
539 *lfloghigh
= leafhdr
->count
++;
544 * There are stale entries.
546 * We will use one of them for the new entry. It's probably not at
547 * the right location, so we'll have to shift some up or down first.
549 * If we didn't compact before, we need to find the nearest stale
550 * entries before and after our insertion point.
553 xfs_dir3_leaf_find_stale(leafhdr
, ents
, index
,
554 &lowstale
, &highstale
);
557 * If the low one is better, use it.
560 (highstale
== leafhdr
->count
||
561 index
- lowstale
- 1 < highstale
- index
)) {
562 ASSERT(index
- lowstale
- 1 >= 0);
563 ASSERT(ents
[lowstale
].address
==
564 cpu_to_be32(XFS_DIR2_NULL_DATAPTR
));
567 * Copy entries up to cover the stale entry and make room
570 if (index
- lowstale
- 1 > 0) {
571 memmove(&ents
[lowstale
], &ents
[lowstale
+ 1],
572 (index
- lowstale
- 1) *
573 sizeof(xfs_dir2_leaf_entry_t
));
575 *lfloglow
= MIN(lowstale
, *lfloglow
);
576 *lfloghigh
= MAX(index
- 1, *lfloghigh
);
578 return &ents
[index
- 1];
582 * The high one is better, so use that one.
584 ASSERT(highstale
- index
>= 0);
585 ASSERT(ents
[highstale
].address
== cpu_to_be32(XFS_DIR2_NULL_DATAPTR
));
588 * Copy entries down to cover the stale entry and make room for the
591 if (highstale
- index
> 0) {
592 memmove(&ents
[index
+ 1], &ents
[index
],
593 (highstale
- index
) * sizeof(xfs_dir2_leaf_entry_t
));
595 *lfloglow
= MIN(index
, *lfloglow
);
596 *lfloghigh
= MAX(highstale
, *lfloghigh
);
602 * Add an entry to a leaf form directory.
605 xfs_dir2_leaf_addname(
606 xfs_da_args_t
*args
) /* operation arguments */
608 __be16
*bestsp
; /* freespace table in leaf */
609 int compact
; /* need to compact leaves */
610 xfs_dir2_data_hdr_t
*hdr
; /* data block header */
611 struct xfs_buf
*dbp
; /* data block buffer */
612 xfs_dir2_data_entry_t
*dep
; /* data block entry */
613 xfs_inode_t
*dp
; /* incore directory inode */
614 xfs_dir2_data_unused_t
*dup
; /* data unused entry */
615 int error
; /* error return value */
616 int grown
; /* allocated new data block */
617 int highstale
; /* index of next stale leaf */
618 int i
; /* temporary, index */
619 int index
; /* leaf table position */
620 struct xfs_buf
*lbp
; /* leaf's buffer */
621 xfs_dir2_leaf_t
*leaf
; /* leaf structure */
622 int length
; /* length of new entry */
623 xfs_dir2_leaf_entry_t
*lep
; /* leaf entry table pointer */
624 int lfloglow
; /* low leaf logging index */
625 int lfloghigh
; /* high leaf logging index */
626 int lowstale
; /* index of prev stale leaf */
627 xfs_dir2_leaf_tail_t
*ltp
; /* leaf tail pointer */
628 xfs_mount_t
*mp
; /* filesystem mount point */
629 int needbytes
; /* leaf block bytes needed */
630 int needlog
; /* need to log data header */
631 int needscan
; /* need to rescan data free */
632 __be16
*tagp
; /* end of data entry */
633 xfs_trans_t
*tp
; /* transaction pointer */
634 xfs_dir2_db_t use_block
; /* data block number */
635 struct xfs_dir2_data_free
*bf
; /* bestfree table */
636 struct xfs_dir2_leaf_entry
*ents
;
637 struct xfs_dir3_icleaf_hdr leafhdr
;
639 trace_xfs_dir2_leaf_addname(args
);
645 error
= xfs_dir3_leaf_read(tp
, dp
, args
->geo
->leafblk
, -1, &lbp
);
650 * Look up the entry by hash value and name.
651 * We know it's not there, our caller has already done a lookup.
652 * So the index is of the entry to insert in front of.
653 * But if there are dup hash values the index is of the first of those.
655 index
= xfs_dir2_leaf_search_hash(args
, lbp
);
657 ltp
= xfs_dir2_leaf_tail_p(args
->geo
, leaf
);
658 ents
= dp
->d_ops
->leaf_ents_p(leaf
);
659 dp
->d_ops
->leaf_hdr_from_disk(&leafhdr
, leaf
);
660 bestsp
= xfs_dir2_leaf_bests_p(ltp
);
661 length
= dp
->d_ops
->data_entsize(args
->namelen
);
664 * See if there are any entries with the same hash value
665 * and space in their block for the new entry.
666 * This is good because it puts multiple same-hash value entries
667 * in a data block, improving the lookup of those entries.
669 for (use_block
= -1, lep
= &ents
[index
];
670 index
< leafhdr
.count
&& be32_to_cpu(lep
->hashval
) == args
->hashval
;
672 if (be32_to_cpu(lep
->address
) == XFS_DIR2_NULL_DATAPTR
)
674 i
= xfs_dir2_dataptr_to_db(args
->geo
, be32_to_cpu(lep
->address
));
675 ASSERT(i
< be32_to_cpu(ltp
->bestcount
));
676 ASSERT(bestsp
[i
] != cpu_to_be16(NULLDATAOFF
));
677 if (be16_to_cpu(bestsp
[i
]) >= length
) {
683 * Didn't find a block yet, linear search all the data blocks.
685 if (use_block
== -1) {
686 for (i
= 0; i
< be32_to_cpu(ltp
->bestcount
); i
++) {
688 * Remember a block we see that's missing.
690 if (bestsp
[i
] == cpu_to_be16(NULLDATAOFF
) &&
693 else if (be16_to_cpu(bestsp
[i
]) >= length
) {
700 * How many bytes do we need in the leaf block?
704 needbytes
+= sizeof(xfs_dir2_leaf_entry_t
);
706 needbytes
+= sizeof(xfs_dir2_data_off_t
);
709 * Now kill use_block if it refers to a missing block, so we
710 * can use it as an indication of allocation needed.
712 if (use_block
!= -1 && bestsp
[use_block
] == cpu_to_be16(NULLDATAOFF
))
715 * If we don't have enough free bytes but we can make enough
716 * by compacting out stale entries, we'll do that.
718 if ((char *)bestsp
- (char *)&ents
[leafhdr
.count
] < needbytes
&&
723 * Otherwise if we don't have enough free bytes we need to
724 * convert to node form.
726 else if ((char *)bestsp
- (char *)&ents
[leafhdr
.count
] < needbytes
) {
728 * Just checking or no space reservation, give up.
730 if ((args
->op_flags
& XFS_DA_OP_JUSTCHECK
) ||
732 xfs_trans_brelse(tp
, lbp
);
736 * Convert to node form.
738 error
= xfs_dir2_leaf_to_node(args
, lbp
);
742 * Then add the new entry.
744 return xfs_dir2_node_addname(args
);
747 * Otherwise it will fit without compaction.
752 * If just checking, then it will fit unless we needed to allocate
755 if (args
->op_flags
& XFS_DA_OP_JUSTCHECK
) {
756 xfs_trans_brelse(tp
, lbp
);
757 return use_block
== -1 ? -ENOSPC
: 0;
760 * If no allocations are allowed, return now before we've
763 if (args
->total
== 0 && use_block
== -1) {
764 xfs_trans_brelse(tp
, lbp
);
768 * Need to compact the leaf entries, removing stale ones.
769 * Leave one stale entry behind - the one closest to our
770 * insertion index - and we'll shift that one to our insertion
774 xfs_dir3_leaf_compact_x1(&leafhdr
, ents
, &index
, &lowstale
,
775 &highstale
, &lfloglow
, &lfloghigh
);
778 * There are stale entries, so we'll need log-low and log-high
779 * impossibly bad values later.
781 else if (leafhdr
.stale
) {
782 lfloglow
= leafhdr
.count
;
786 * If there was no data block space found, we need to allocate
789 if (use_block
== -1) {
791 * Add the new data block.
793 if ((error
= xfs_dir2_grow_inode(args
, XFS_DIR2_DATA_SPACE
,
795 xfs_trans_brelse(tp
, lbp
);
799 * Initialize the block.
801 if ((error
= xfs_dir3_data_init(args
, use_block
, &dbp
))) {
802 xfs_trans_brelse(tp
, lbp
);
806 * If we're adding a new data block on the end we need to
807 * extend the bests table. Copy it up one entry.
809 if (use_block
>= be32_to_cpu(ltp
->bestcount
)) {
811 memmove(&bestsp
[0], &bestsp
[1],
812 be32_to_cpu(ltp
->bestcount
) * sizeof(bestsp
[0]));
813 be32_add_cpu(<p
->bestcount
, 1);
814 xfs_dir3_leaf_log_tail(args
, lbp
);
815 xfs_dir3_leaf_log_bests(args
, lbp
, 0,
816 be32_to_cpu(ltp
->bestcount
) - 1);
819 * If we're filling in a previously empty block just log it.
822 xfs_dir3_leaf_log_bests(args
, lbp
, use_block
, use_block
);
824 bf
= dp
->d_ops
->data_bestfree_p(hdr
);
825 bestsp
[use_block
] = bf
[0].length
;
829 * Already had space in some data block.
830 * Just read that one in.
832 error
= xfs_dir3_data_read(tp
, dp
,
833 xfs_dir2_db_to_da(args
->geo
, use_block
),
836 xfs_trans_brelse(tp
, lbp
);
840 bf
= dp
->d_ops
->data_bestfree_p(hdr
);
844 * Point to the biggest freespace in our data block.
846 dup
= (xfs_dir2_data_unused_t
*)
847 ((char *)hdr
+ be16_to_cpu(bf
[0].offset
));
848 ASSERT(be16_to_cpu(dup
->length
) >= length
);
849 needscan
= needlog
= 0;
851 * Mark the initial part of our freespace in use for the new entry.
853 xfs_dir2_data_use_free(args
, dbp
, dup
,
854 (xfs_dir2_data_aoff_t
)((char *)dup
- (char *)hdr
), length
,
855 &needlog
, &needscan
);
857 * Initialize our new entry (at last).
859 dep
= (xfs_dir2_data_entry_t
*)dup
;
860 dep
->inumber
= cpu_to_be64(args
->inumber
);
861 dep
->namelen
= args
->namelen
;
862 memcpy(dep
->name
, args
->name
, dep
->namelen
);
863 dp
->d_ops
->data_put_ftype(dep
, args
->filetype
);
864 tagp
= dp
->d_ops
->data_entry_tag_p(dep
);
865 *tagp
= cpu_to_be16((char *)dep
- (char *)hdr
);
867 * Need to scan fix up the bestfree table.
870 xfs_dir2_data_freescan(dp
, hdr
, &needlog
);
872 * Need to log the data block's header.
875 xfs_dir2_data_log_header(args
, dbp
);
876 xfs_dir2_data_log_entry(args
, dbp
, dep
);
878 * If the bests table needs to be changed, do it.
879 * Log the change unless we've already done that.
881 if (be16_to_cpu(bestsp
[use_block
]) != be16_to_cpu(bf
[0].length
)) {
882 bestsp
[use_block
] = bf
[0].length
;
884 xfs_dir3_leaf_log_bests(args
, lbp
, use_block
, use_block
);
887 lep
= xfs_dir3_leaf_find_entry(&leafhdr
, ents
, index
, compact
, lowstale
,
888 highstale
, &lfloglow
, &lfloghigh
);
891 * Fill in the new leaf entry.
893 lep
->hashval
= cpu_to_be32(args
->hashval
);
894 lep
->address
= cpu_to_be32(
895 xfs_dir2_db_off_to_dataptr(args
->geo
, use_block
,
896 be16_to_cpu(*tagp
)));
898 * Log the leaf fields and give up the buffers.
900 dp
->d_ops
->leaf_hdr_to_disk(leaf
, &leafhdr
);
901 xfs_dir3_leaf_log_header(args
, lbp
);
902 xfs_dir3_leaf_log_ents(args
, lbp
, lfloglow
, lfloghigh
);
903 xfs_dir3_leaf_check(dp
, lbp
);
904 xfs_dir3_data_check(dp
, dbp
);
909 * Compact out any stale entries in the leaf.
910 * Log the header and changed leaf entries, if any.
913 xfs_dir3_leaf_compact(
914 xfs_da_args_t
*args
, /* operation arguments */
915 struct xfs_dir3_icleaf_hdr
*leafhdr
,
916 struct xfs_buf
*bp
) /* leaf buffer */
918 int from
; /* source leaf index */
919 xfs_dir2_leaf_t
*leaf
; /* leaf structure */
920 int loglow
; /* first leaf entry to log */
921 int to
; /* target leaf index */
922 struct xfs_dir2_leaf_entry
*ents
;
923 struct xfs_inode
*dp
= args
->dp
;
930 * Compress out the stale entries in place.
932 ents
= dp
->d_ops
->leaf_ents_p(leaf
);
933 for (from
= to
= 0, loglow
= -1; from
< leafhdr
->count
; from
++) {
934 if (ents
[from
].address
== cpu_to_be32(XFS_DIR2_NULL_DATAPTR
))
937 * Only actually copy the entries that are different.
942 ents
[to
] = ents
[from
];
947 * Update and log the header, log the leaf entries.
949 ASSERT(leafhdr
->stale
== from
- to
);
950 leafhdr
->count
-= leafhdr
->stale
;
953 dp
->d_ops
->leaf_hdr_to_disk(leaf
, leafhdr
);
954 xfs_dir3_leaf_log_header(args
, bp
);
956 xfs_dir3_leaf_log_ents(args
, bp
, loglow
, to
- 1);
960 * Compact the leaf entries, removing stale ones.
961 * Leave one stale entry behind - the one closest to our
962 * insertion index - and the caller will shift that one to our insertion
964 * Return new insertion index, where the remaining stale entry is,
965 * and leaf logging indices.
968 xfs_dir3_leaf_compact_x1(
969 struct xfs_dir3_icleaf_hdr
*leafhdr
,
970 struct xfs_dir2_leaf_entry
*ents
,
971 int *indexp
, /* insertion index */
972 int *lowstalep
, /* out: stale entry before us */
973 int *highstalep
, /* out: stale entry after us */
974 int *lowlogp
, /* out: low log index */
975 int *highlogp
) /* out: high log index */
977 int from
; /* source copy index */
978 int highstale
; /* stale entry at/after index */
979 int index
; /* insertion index */
980 int keepstale
; /* source index of kept stale */
981 int lowstale
; /* stale entry before index */
982 int newindex
=0; /* new insertion index */
983 int to
; /* destination copy index */
985 ASSERT(leafhdr
->stale
> 1);
988 xfs_dir3_leaf_find_stale(leafhdr
, ents
, index
, &lowstale
, &highstale
);
991 * Pick the better of lowstale and highstale.
994 (highstale
== leafhdr
->count
||
995 index
- lowstale
<= highstale
- index
))
996 keepstale
= lowstale
;
998 keepstale
= highstale
;
1000 * Copy the entries in place, removing all the stale entries
1003 for (from
= to
= 0; from
< leafhdr
->count
; from
++) {
1005 * Notice the new value of index.
1009 if (from
!= keepstale
&&
1010 ents
[from
].address
== cpu_to_be32(XFS_DIR2_NULL_DATAPTR
)) {
1016 * Record the new keepstale value for the insertion.
1018 if (from
== keepstale
)
1019 lowstale
= highstale
= to
;
1021 * Copy only the entries that have moved.
1024 ents
[to
] = ents
[from
];
1029 * If the insertion point was past the last entry,
1030 * set the new insertion point accordingly.
1036 * Adjust the leaf header values.
1038 leafhdr
->count
-= from
- to
;
1041 * Remember the low/high stale value only in the "right"
1044 if (lowstale
>= newindex
)
1047 highstale
= leafhdr
->count
;
1048 *highlogp
= leafhdr
->count
- 1;
1049 *lowstalep
= lowstale
;
1050 *highstalep
= highstale
;
1054 * Log the bests entries indicated from a leaf1 block.
1057 xfs_dir3_leaf_log_bests(
1058 struct xfs_da_args
*args
,
1059 struct xfs_buf
*bp
, /* leaf buffer */
1060 int first
, /* first entry to log */
1061 int last
) /* last entry to log */
1063 __be16
*firstb
; /* pointer to first entry */
1064 __be16
*lastb
; /* pointer to last entry */
1065 struct xfs_dir2_leaf
*leaf
= bp
->b_addr
;
1066 xfs_dir2_leaf_tail_t
*ltp
; /* leaf tail structure */
1068 ASSERT(leaf
->hdr
.info
.magic
== cpu_to_be16(XFS_DIR2_LEAF1_MAGIC
) ||
1069 leaf
->hdr
.info
.magic
== cpu_to_be16(XFS_DIR3_LEAF1_MAGIC
));
1071 ltp
= xfs_dir2_leaf_tail_p(args
->geo
, leaf
);
1072 firstb
= xfs_dir2_leaf_bests_p(ltp
) + first
;
1073 lastb
= xfs_dir2_leaf_bests_p(ltp
) + last
;
1074 xfs_trans_log_buf(args
->trans
, bp
,
1075 (uint
)((char *)firstb
- (char *)leaf
),
1076 (uint
)((char *)lastb
- (char *)leaf
+ sizeof(*lastb
) - 1));
1080 * Log the leaf entries indicated from a leaf1 or leafn block.
1083 xfs_dir3_leaf_log_ents(
1084 struct xfs_da_args
*args
,
1089 xfs_dir2_leaf_entry_t
*firstlep
; /* pointer to first entry */
1090 xfs_dir2_leaf_entry_t
*lastlep
; /* pointer to last entry */
1091 struct xfs_dir2_leaf
*leaf
= bp
->b_addr
;
1092 struct xfs_dir2_leaf_entry
*ents
;
1094 ASSERT(leaf
->hdr
.info
.magic
== cpu_to_be16(XFS_DIR2_LEAF1_MAGIC
) ||
1095 leaf
->hdr
.info
.magic
== cpu_to_be16(XFS_DIR3_LEAF1_MAGIC
) ||
1096 leaf
->hdr
.info
.magic
== cpu_to_be16(XFS_DIR2_LEAFN_MAGIC
) ||
1097 leaf
->hdr
.info
.magic
== cpu_to_be16(XFS_DIR3_LEAFN_MAGIC
));
1099 ents
= args
->dp
->d_ops
->leaf_ents_p(leaf
);
1100 firstlep
= &ents
[first
];
1101 lastlep
= &ents
[last
];
1102 xfs_trans_log_buf(args
->trans
, bp
,
1103 (uint
)((char *)firstlep
- (char *)leaf
),
1104 (uint
)((char *)lastlep
- (char *)leaf
+ sizeof(*lastlep
) - 1));
1108 * Log the header of the leaf1 or leafn block.
1111 xfs_dir3_leaf_log_header(
1112 struct xfs_da_args
*args
,
1115 struct xfs_dir2_leaf
*leaf
= bp
->b_addr
;
1117 ASSERT(leaf
->hdr
.info
.magic
== cpu_to_be16(XFS_DIR2_LEAF1_MAGIC
) ||
1118 leaf
->hdr
.info
.magic
== cpu_to_be16(XFS_DIR3_LEAF1_MAGIC
) ||
1119 leaf
->hdr
.info
.magic
== cpu_to_be16(XFS_DIR2_LEAFN_MAGIC
) ||
1120 leaf
->hdr
.info
.magic
== cpu_to_be16(XFS_DIR3_LEAFN_MAGIC
));
1122 xfs_trans_log_buf(args
->trans
, bp
,
1123 (uint
)((char *)&leaf
->hdr
- (char *)leaf
),
1124 args
->dp
->d_ops
->leaf_hdr_size
- 1);
1128 * Log the tail of the leaf1 block.
1131 xfs_dir3_leaf_log_tail(
1132 struct xfs_da_args
*args
,
1135 struct xfs_dir2_leaf
*leaf
= bp
->b_addr
;
1136 xfs_dir2_leaf_tail_t
*ltp
; /* leaf tail structure */
1138 ASSERT(leaf
->hdr
.info
.magic
== cpu_to_be16(XFS_DIR2_LEAF1_MAGIC
) ||
1139 leaf
->hdr
.info
.magic
== cpu_to_be16(XFS_DIR3_LEAF1_MAGIC
) ||
1140 leaf
->hdr
.info
.magic
== cpu_to_be16(XFS_DIR2_LEAFN_MAGIC
) ||
1141 leaf
->hdr
.info
.magic
== cpu_to_be16(XFS_DIR3_LEAFN_MAGIC
));
1143 ltp
= xfs_dir2_leaf_tail_p(args
->geo
, leaf
);
1144 xfs_trans_log_buf(args
->trans
, bp
, (uint
)((char *)ltp
- (char *)leaf
),
1145 (uint
)(args
->geo
->blksize
- 1));
1149 * Look up the entry referred to by args in the leaf format directory.
1150 * Most of the work is done by the xfs_dir2_leaf_lookup_int routine which
1151 * is also used by the node-format code.
1154 xfs_dir2_leaf_lookup(
1155 xfs_da_args_t
*args
) /* operation arguments */
1157 struct xfs_buf
*dbp
; /* data block buffer */
1158 xfs_dir2_data_entry_t
*dep
; /* data block entry */
1159 xfs_inode_t
*dp
; /* incore directory inode */
1160 int error
; /* error return code */
1161 int index
; /* found entry index */
1162 struct xfs_buf
*lbp
; /* leaf buffer */
1163 xfs_dir2_leaf_t
*leaf
; /* leaf structure */
1164 xfs_dir2_leaf_entry_t
*lep
; /* leaf entry */
1165 xfs_trans_t
*tp
; /* transaction pointer */
1166 struct xfs_dir2_leaf_entry
*ents
;
1168 trace_xfs_dir2_leaf_lookup(args
);
1171 * Look up name in the leaf block, returning both buffers and index.
1173 if ((error
= xfs_dir2_leaf_lookup_int(args
, &lbp
, &index
, &dbp
))) {
1178 xfs_dir3_leaf_check(dp
, lbp
);
1180 ents
= dp
->d_ops
->leaf_ents_p(leaf
);
1182 * Get to the leaf entry and contained data entry address.
1187 * Point to the data entry.
1189 dep
= (xfs_dir2_data_entry_t
*)
1190 ((char *)dbp
->b_addr
+
1191 xfs_dir2_dataptr_to_off(args
->geo
, be32_to_cpu(lep
->address
)));
1193 * Return the found inode number & CI name if appropriate
1195 args
->inumber
= be64_to_cpu(dep
->inumber
);
1196 args
->filetype
= dp
->d_ops
->data_get_ftype(dep
);
1197 error
= xfs_dir_cilookup_result(args
, dep
->name
, dep
->namelen
);
1198 xfs_trans_brelse(tp
, dbp
);
1199 xfs_trans_brelse(tp
, lbp
);
1204 * Look up name/hash in the leaf block.
1205 * Fill in indexp with the found index, and dbpp with the data buffer.
1206 * If not found dbpp will be NULL, and ENOENT comes back.
1207 * lbpp will always be filled in with the leaf buffer unless there's an error.
1209 static int /* error */
1210 xfs_dir2_leaf_lookup_int(
1211 xfs_da_args_t
*args
, /* operation arguments */
1212 struct xfs_buf
**lbpp
, /* out: leaf buffer */
1213 int *indexp
, /* out: index in leaf block */
1214 struct xfs_buf
**dbpp
) /* out: data buffer */
1216 xfs_dir2_db_t curdb
= -1; /* current data block number */
1217 struct xfs_buf
*dbp
= NULL
; /* data buffer */
1218 xfs_dir2_data_entry_t
*dep
; /* data entry */
1219 xfs_inode_t
*dp
; /* incore directory inode */
1220 int error
; /* error return code */
1221 int index
; /* index in leaf block */
1222 struct xfs_buf
*lbp
; /* leaf buffer */
1223 xfs_dir2_leaf_entry_t
*lep
; /* leaf entry */
1224 xfs_dir2_leaf_t
*leaf
; /* leaf structure */
1225 xfs_mount_t
*mp
; /* filesystem mount point */
1226 xfs_dir2_db_t newdb
; /* new data block number */
1227 xfs_trans_t
*tp
; /* transaction pointer */
1228 xfs_dir2_db_t cidb
= -1; /* case match data block no. */
1229 enum xfs_dacmp cmp
; /* name compare result */
1230 struct xfs_dir2_leaf_entry
*ents
;
1231 struct xfs_dir3_icleaf_hdr leafhdr
;
1237 error
= xfs_dir3_leaf_read(tp
, dp
, args
->geo
->leafblk
, -1, &lbp
);
1243 xfs_dir3_leaf_check(dp
, lbp
);
1244 ents
= dp
->d_ops
->leaf_ents_p(leaf
);
1245 dp
->d_ops
->leaf_hdr_from_disk(&leafhdr
, leaf
);
1248 * Look for the first leaf entry with our hash value.
1250 index
= xfs_dir2_leaf_search_hash(args
, lbp
);
1252 * Loop over all the entries with the right hash value
1253 * looking to match the name.
1255 for (lep
= &ents
[index
];
1256 index
< leafhdr
.count
&& be32_to_cpu(lep
->hashval
) == args
->hashval
;
1259 * Skip over stale leaf entries.
1261 if (be32_to_cpu(lep
->address
) == XFS_DIR2_NULL_DATAPTR
)
1264 * Get the new data block number.
1266 newdb
= xfs_dir2_dataptr_to_db(args
->geo
,
1267 be32_to_cpu(lep
->address
));
1269 * If it's not the same as the old data block number,
1270 * need to pitch the old one and read the new one.
1272 if (newdb
!= curdb
) {
1274 xfs_trans_brelse(tp
, dbp
);
1275 error
= xfs_dir3_data_read(tp
, dp
,
1276 xfs_dir2_db_to_da(args
->geo
, newdb
),
1279 xfs_trans_brelse(tp
, lbp
);
1285 * Point to the data entry.
1287 dep
= (xfs_dir2_data_entry_t
*)((char *)dbp
->b_addr
+
1288 xfs_dir2_dataptr_to_off(args
->geo
,
1289 be32_to_cpu(lep
->address
)));
1291 * Compare name and if it's an exact match, return the index
1292 * and buffer. If it's the first case-insensitive match, store
1293 * the index and buffer and continue looking for an exact match.
1295 cmp
= mp
->m_dirnameops
->compname(args
, dep
->name
, dep
->namelen
);
1296 if (cmp
!= XFS_CMP_DIFFERENT
&& cmp
!= args
->cmpresult
) {
1297 args
->cmpresult
= cmp
;
1299 /* case exact match: return the current buffer. */
1300 if (cmp
== XFS_CMP_EXACT
) {
1307 ASSERT(args
->op_flags
& XFS_DA_OP_OKNOENT
);
1309 * Here, we can only be doing a lookup (not a rename or remove).
1310 * If a case-insensitive match was found earlier, re-read the
1311 * appropriate data block if required and return it.
1313 if (args
->cmpresult
== XFS_CMP_CASE
) {
1315 if (cidb
!= curdb
) {
1316 xfs_trans_brelse(tp
, dbp
);
1317 error
= xfs_dir3_data_read(tp
, dp
,
1318 xfs_dir2_db_to_da(args
->geo
, cidb
),
1321 xfs_trans_brelse(tp
, lbp
);
1329 * No match found, return -ENOENT.
1333 xfs_trans_brelse(tp
, dbp
);
1334 xfs_trans_brelse(tp
, lbp
);
1339 * Remove an entry from a leaf format directory.
1342 xfs_dir2_leaf_removename(
1343 xfs_da_args_t
*args
) /* operation arguments */
1345 __be16
*bestsp
; /* leaf block best freespace */
1346 xfs_dir2_data_hdr_t
*hdr
; /* data block header */
1347 xfs_dir2_db_t db
; /* data block number */
1348 struct xfs_buf
*dbp
; /* data block buffer */
1349 xfs_dir2_data_entry_t
*dep
; /* data entry structure */
1350 xfs_inode_t
*dp
; /* incore directory inode */
1351 int error
; /* error return code */
1352 xfs_dir2_db_t i
; /* temporary data block # */
1353 int index
; /* index into leaf entries */
1354 struct xfs_buf
*lbp
; /* leaf buffer */
1355 xfs_dir2_leaf_t
*leaf
; /* leaf structure */
1356 xfs_dir2_leaf_entry_t
*lep
; /* leaf entry */
1357 xfs_dir2_leaf_tail_t
*ltp
; /* leaf tail structure */
1358 xfs_mount_t
*mp
; /* filesystem mount point */
1359 int needlog
; /* need to log data header */
1360 int needscan
; /* need to rescan data frees */
1361 xfs_dir2_data_off_t oldbest
; /* old value of best free */
1362 xfs_trans_t
*tp
; /* transaction pointer */
1363 struct xfs_dir2_data_free
*bf
; /* bestfree table */
1364 struct xfs_dir2_leaf_entry
*ents
;
1365 struct xfs_dir3_icleaf_hdr leafhdr
;
1367 trace_xfs_dir2_leaf_removename(args
);
1370 * Lookup the leaf entry, get the leaf and data blocks read in.
1372 if ((error
= xfs_dir2_leaf_lookup_int(args
, &lbp
, &index
, &dbp
))) {
1380 xfs_dir3_data_check(dp
, dbp
);
1381 bf
= dp
->d_ops
->data_bestfree_p(hdr
);
1382 dp
->d_ops
->leaf_hdr_from_disk(&leafhdr
, leaf
);
1383 ents
= dp
->d_ops
->leaf_ents_p(leaf
);
1385 * Point to the leaf entry, use that to point to the data entry.
1388 db
= xfs_dir2_dataptr_to_db(args
->geo
, be32_to_cpu(lep
->address
));
1389 dep
= (xfs_dir2_data_entry_t
*)((char *)hdr
+
1390 xfs_dir2_dataptr_to_off(args
->geo
, be32_to_cpu(lep
->address
)));
1391 needscan
= needlog
= 0;
1392 oldbest
= be16_to_cpu(bf
[0].length
);
1393 ltp
= xfs_dir2_leaf_tail_p(args
->geo
, leaf
);
1394 bestsp
= xfs_dir2_leaf_bests_p(ltp
);
1395 ASSERT(be16_to_cpu(bestsp
[db
]) == oldbest
);
1397 * Mark the former data entry unused.
1399 xfs_dir2_data_make_free(args
, dbp
,
1400 (xfs_dir2_data_aoff_t
)((char *)dep
- (char *)hdr
),
1401 dp
->d_ops
->data_entsize(dep
->namelen
), &needlog
, &needscan
);
1403 * We just mark the leaf entry stale by putting a null in it.
1406 dp
->d_ops
->leaf_hdr_to_disk(leaf
, &leafhdr
);
1407 xfs_dir3_leaf_log_header(args
, lbp
);
1409 lep
->address
= cpu_to_be32(XFS_DIR2_NULL_DATAPTR
);
1410 xfs_dir3_leaf_log_ents(args
, lbp
, index
, index
);
1413 * Scan the freespace in the data block again if necessary,
1414 * log the data block header if necessary.
1417 xfs_dir2_data_freescan(dp
, hdr
, &needlog
);
1419 xfs_dir2_data_log_header(args
, dbp
);
1421 * If the longest freespace in the data block has changed,
1422 * put the new value in the bests table and log that.
1424 if (be16_to_cpu(bf
[0].length
) != oldbest
) {
1425 bestsp
[db
] = bf
[0].length
;
1426 xfs_dir3_leaf_log_bests(args
, lbp
, db
, db
);
1428 xfs_dir3_data_check(dp
, dbp
);
1430 * If the data block is now empty then get rid of the data block.
1432 if (be16_to_cpu(bf
[0].length
) ==
1433 args
->geo
->blksize
- dp
->d_ops
->data_entry_offset
) {
1434 ASSERT(db
!= args
->geo
->datablk
);
1435 if ((error
= xfs_dir2_shrink_inode(args
, db
, dbp
))) {
1437 * Nope, can't get rid of it because it caused
1438 * allocation of a bmap btree block to do so.
1439 * Just go on, returning success, leaving the
1440 * empty block in place.
1442 if (error
== -ENOSPC
&& args
->total
== 0)
1444 xfs_dir3_leaf_check(dp
, lbp
);
1449 * If this is the last data block then compact the
1450 * bests table by getting rid of entries.
1452 if (db
== be32_to_cpu(ltp
->bestcount
) - 1) {
1454 * Look for the last active entry (i).
1456 for (i
= db
- 1; i
> 0; i
--) {
1457 if (bestsp
[i
] != cpu_to_be16(NULLDATAOFF
))
1461 * Copy the table down so inactive entries at the
1464 memmove(&bestsp
[db
- i
], bestsp
,
1465 (be32_to_cpu(ltp
->bestcount
) - (db
- i
)) * sizeof(*bestsp
));
1466 be32_add_cpu(<p
->bestcount
, -(db
- i
));
1467 xfs_dir3_leaf_log_tail(args
, lbp
);
1468 xfs_dir3_leaf_log_bests(args
, lbp
, 0,
1469 be32_to_cpu(ltp
->bestcount
) - 1);
1471 bestsp
[db
] = cpu_to_be16(NULLDATAOFF
);
1474 * If the data block was not the first one, drop it.
1476 else if (db
!= args
->geo
->datablk
)
1479 xfs_dir3_leaf_check(dp
, lbp
);
1481 * See if we can convert to block form.
1483 return xfs_dir2_leaf_to_block(args
, lbp
, dbp
);
1487 * Replace the inode number in a leaf format directory entry.
1490 xfs_dir2_leaf_replace(
1491 xfs_da_args_t
*args
) /* operation arguments */
1493 struct xfs_buf
*dbp
; /* data block buffer */
1494 xfs_dir2_data_entry_t
*dep
; /* data block entry */
1495 xfs_inode_t
*dp
; /* incore directory inode */
1496 int error
; /* error return code */
1497 int index
; /* index of leaf entry */
1498 struct xfs_buf
*lbp
; /* leaf buffer */
1499 xfs_dir2_leaf_t
*leaf
; /* leaf structure */
1500 xfs_dir2_leaf_entry_t
*lep
; /* leaf entry */
1501 xfs_trans_t
*tp
; /* transaction pointer */
1502 struct xfs_dir2_leaf_entry
*ents
;
1504 trace_xfs_dir2_leaf_replace(args
);
1507 * Look up the entry.
1509 if ((error
= xfs_dir2_leaf_lookup_int(args
, &lbp
, &index
, &dbp
))) {
1514 ents
= dp
->d_ops
->leaf_ents_p(leaf
);
1516 * Point to the leaf entry, get data address from it.
1520 * Point to the data entry.
1522 dep
= (xfs_dir2_data_entry_t
*)
1523 ((char *)dbp
->b_addr
+
1524 xfs_dir2_dataptr_to_off(args
->geo
, be32_to_cpu(lep
->address
)));
1525 ASSERT(args
->inumber
!= be64_to_cpu(dep
->inumber
));
1527 * Put the new inode number in, log it.
1529 dep
->inumber
= cpu_to_be64(args
->inumber
);
1530 dp
->d_ops
->data_put_ftype(dep
, args
->filetype
);
1532 xfs_dir2_data_log_entry(args
, dbp
, dep
);
1533 xfs_dir3_leaf_check(dp
, lbp
);
1534 xfs_trans_brelse(tp
, lbp
);
1539 * Return index in the leaf block (lbp) which is either the first
1540 * one with this hash value, or if there are none, the insert point
1541 * for that hash value.
1543 int /* index value */
1544 xfs_dir2_leaf_search_hash(
1545 xfs_da_args_t
*args
, /* operation arguments */
1546 struct xfs_buf
*lbp
) /* leaf buffer */
1548 xfs_dahash_t hash
=0; /* hash from this entry */
1549 xfs_dahash_t hashwant
; /* hash value looking for */
1550 int high
; /* high leaf index */
1551 int low
; /* low leaf index */
1552 xfs_dir2_leaf_t
*leaf
; /* leaf structure */
1553 xfs_dir2_leaf_entry_t
*lep
; /* leaf entry */
1554 int mid
=0; /* current leaf index */
1555 struct xfs_dir2_leaf_entry
*ents
;
1556 struct xfs_dir3_icleaf_hdr leafhdr
;
1559 ents
= args
->dp
->d_ops
->leaf_ents_p(leaf
);
1560 args
->dp
->d_ops
->leaf_hdr_from_disk(&leafhdr
, leaf
);
1563 * Note, the table cannot be empty, so we have to go through the loop.
1564 * Binary search the leaf entries looking for our hash value.
1566 for (lep
= ents
, low
= 0, high
= leafhdr
.count
- 1,
1567 hashwant
= args
->hashval
;
1569 mid
= (low
+ high
) >> 1;
1570 if ((hash
= be32_to_cpu(lep
[mid
].hashval
)) == hashwant
)
1572 if (hash
< hashwant
)
1578 * Found one, back up through all the equal hash values.
1580 if (hash
== hashwant
) {
1581 while (mid
> 0 && be32_to_cpu(lep
[mid
- 1].hashval
) == hashwant
) {
1586 * Need to point to an entry higher than ours.
1588 else if (hash
< hashwant
)
1594 * Trim off a trailing data block. We know it's empty since the leaf
1595 * freespace table says so.
1598 xfs_dir2_leaf_trim_data(
1599 xfs_da_args_t
*args
, /* operation arguments */
1600 struct xfs_buf
*lbp
, /* leaf buffer */
1601 xfs_dir2_db_t db
) /* data block number */
1603 __be16
*bestsp
; /* leaf bests table */
1604 struct xfs_buf
*dbp
; /* data block buffer */
1605 xfs_inode_t
*dp
; /* incore directory inode */
1606 int error
; /* error return value */
1607 xfs_dir2_leaf_t
*leaf
; /* leaf structure */
1608 xfs_dir2_leaf_tail_t
*ltp
; /* leaf tail structure */
1609 xfs_mount_t
*mp
; /* filesystem mount point */
1610 xfs_trans_t
*tp
; /* transaction pointer */
1616 * Read the offending data block. We need its buffer.
1618 error
= xfs_dir3_data_read(tp
, dp
, xfs_dir2_db_to_da(args
->geo
, db
),
1624 ltp
= xfs_dir2_leaf_tail_p(args
->geo
, leaf
);
1628 struct xfs_dir2_data_hdr
*hdr
= dbp
->b_addr
;
1629 struct xfs_dir2_data_free
*bf
= dp
->d_ops
->data_bestfree_p(hdr
);
1631 ASSERT(hdr
->magic
== cpu_to_be32(XFS_DIR2_DATA_MAGIC
) ||
1632 hdr
->magic
== cpu_to_be32(XFS_DIR3_DATA_MAGIC
));
1633 ASSERT(be16_to_cpu(bf
[0].length
) ==
1634 args
->geo
->blksize
- dp
->d_ops
->data_entry_offset
);
1635 ASSERT(db
== be32_to_cpu(ltp
->bestcount
) - 1);
1640 * Get rid of the data block.
1642 if ((error
= xfs_dir2_shrink_inode(args
, db
, dbp
))) {
1643 ASSERT(error
!= -ENOSPC
);
1644 xfs_trans_brelse(tp
, dbp
);
1648 * Eliminate the last bests entry from the table.
1650 bestsp
= xfs_dir2_leaf_bests_p(ltp
);
1651 be32_add_cpu(<p
->bestcount
, -1);
1652 memmove(&bestsp
[1], &bestsp
[0], be32_to_cpu(ltp
->bestcount
) * sizeof(*bestsp
));
1653 xfs_dir3_leaf_log_tail(args
, lbp
);
1654 xfs_dir3_leaf_log_bests(args
, lbp
, 0, be32_to_cpu(ltp
->bestcount
) - 1);
1658 static inline size_t
1660 struct xfs_dir3_icleaf_hdr
*hdr
,
1666 entries
= hdr
->count
- hdr
->stale
;
1667 if (hdr
->magic
== XFS_DIR2_LEAF1_MAGIC
||
1668 hdr
->magic
== XFS_DIR2_LEAFN_MAGIC
)
1669 hdrsize
= sizeof(struct xfs_dir2_leaf_hdr
);
1671 hdrsize
= sizeof(struct xfs_dir3_leaf_hdr
);
1673 return hdrsize
+ entries
* sizeof(xfs_dir2_leaf_entry_t
)
1674 + counts
* sizeof(xfs_dir2_data_off_t
)
1675 + sizeof(xfs_dir2_leaf_tail_t
);
1679 * Convert node form directory to leaf form directory.
1680 * The root of the node form dir needs to already be a LEAFN block.
1681 * Just return if we can't do anything.
1684 xfs_dir2_node_to_leaf(
1685 xfs_da_state_t
*state
) /* directory operation state */
1687 xfs_da_args_t
*args
; /* operation arguments */
1688 xfs_inode_t
*dp
; /* incore directory inode */
1689 int error
; /* error return code */
1690 struct xfs_buf
*fbp
; /* buffer for freespace block */
1691 xfs_fileoff_t fo
; /* freespace file offset */
1692 xfs_dir2_free_t
*free
; /* freespace structure */
1693 struct xfs_buf
*lbp
; /* buffer for leaf block */
1694 xfs_dir2_leaf_tail_t
*ltp
; /* tail of leaf structure */
1695 xfs_dir2_leaf_t
*leaf
; /* leaf structure */
1696 xfs_mount_t
*mp
; /* filesystem mount point */
1697 int rval
; /* successful free trim? */
1698 xfs_trans_t
*tp
; /* transaction pointer */
1699 struct xfs_dir3_icleaf_hdr leafhdr
;
1700 struct xfs_dir3_icfree_hdr freehdr
;
1703 * There's more than a leaf level in the btree, so there must
1704 * be multiple leafn blocks. Give up.
1706 if (state
->path
.active
> 1)
1710 trace_xfs_dir2_node_to_leaf(args
);
1716 * Get the last offset in the file.
1718 if ((error
= xfs_bmap_last_offset(dp
, &fo
, XFS_DATA_FORK
))) {
1721 fo
-= args
->geo
->fsbcount
;
1723 * If there are freespace blocks other than the first one,
1724 * take this opportunity to remove trailing empty freespace blocks
1725 * that may have been left behind during no-space-reservation
1728 while (fo
> args
->geo
->freeblk
) {
1729 if ((error
= xfs_dir2_node_trim_free(args
, fo
, &rval
))) {
1733 fo
-= args
->geo
->fsbcount
;
1738 * Now find the block just before the freespace block.
1740 if ((error
= xfs_bmap_last_before(tp
, dp
, &fo
, XFS_DATA_FORK
))) {
1744 * If it's not the single leaf block, give up.
1746 if (XFS_FSB_TO_B(mp
, fo
) > XFS_DIR2_LEAF_OFFSET
+ args
->geo
->blksize
)
1748 lbp
= state
->path
.blk
[0].bp
;
1750 dp
->d_ops
->leaf_hdr_from_disk(&leafhdr
, leaf
);
1752 ASSERT(leafhdr
.magic
== XFS_DIR2_LEAFN_MAGIC
||
1753 leafhdr
.magic
== XFS_DIR3_LEAFN_MAGIC
);
1756 * Read the freespace block.
1758 error
= xfs_dir2_free_read(tp
, dp
, args
->geo
->freeblk
, &fbp
);
1762 dp
->d_ops
->free_hdr_from_disk(&freehdr
, free
);
1764 ASSERT(!freehdr
.firstdb
);
1767 * Now see if the leafn and free data will fit in a leaf1.
1768 * If not, release the buffer and give up.
1770 if (xfs_dir3_leaf_size(&leafhdr
, freehdr
.nvalid
) > args
->geo
->blksize
) {
1771 xfs_trans_brelse(tp
, fbp
);
1776 * If the leaf has any stale entries in it, compress them out.
1779 xfs_dir3_leaf_compact(args
, &leafhdr
, lbp
);
1781 lbp
->b_ops
= &xfs_dir3_leaf1_buf_ops
;
1782 xfs_trans_buf_set_type(tp
, lbp
, XFS_BLFT_DIR_LEAF1_BUF
);
1783 leafhdr
.magic
= (leafhdr
.magic
== XFS_DIR2_LEAFN_MAGIC
)
1784 ? XFS_DIR2_LEAF1_MAGIC
1785 : XFS_DIR3_LEAF1_MAGIC
;
1788 * Set up the leaf tail from the freespace block.
1790 ltp
= xfs_dir2_leaf_tail_p(args
->geo
, leaf
);
1791 ltp
->bestcount
= cpu_to_be32(freehdr
.nvalid
);
1794 * Set up the leaf bests table.
1796 memcpy(xfs_dir2_leaf_bests_p(ltp
), dp
->d_ops
->free_bests_p(free
),
1797 freehdr
.nvalid
* sizeof(xfs_dir2_data_off_t
));
1799 dp
->d_ops
->leaf_hdr_to_disk(leaf
, &leafhdr
);
1800 xfs_dir3_leaf_log_header(args
, lbp
);
1801 xfs_dir3_leaf_log_bests(args
, lbp
, 0, be32_to_cpu(ltp
->bestcount
) - 1);
1802 xfs_dir3_leaf_log_tail(args
, lbp
);
1803 xfs_dir3_leaf_check(dp
, lbp
);
1806 * Get rid of the freespace block.
1808 error
= xfs_dir2_shrink_inode(args
,
1809 xfs_dir2_byte_to_db(args
->geo
, XFS_DIR2_FREE_OFFSET
),
1813 * This can't fail here because it can only happen when
1814 * punching out the middle of an extent, and this is an
1817 ASSERT(error
!= -ENOSPC
);
1822 * Now see if we can convert the single-leaf directory
1823 * down to a block form directory.
1824 * This routine always kills the dabuf for the leaf, so
1825 * eliminate it from the path.
1827 error
= xfs_dir2_leaf_to_block(args
, lbp
, NULL
);
1828 state
->path
.blk
[0].bp
= NULL
;