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"
26 #include "xfs_mount.h"
27 #include "xfs_da_format.h"
28 #include "xfs_da_btree.h"
29 #include "xfs_inode.h"
32 #include "xfs_dir2_priv.h"
33 #include "xfs_error.h"
34 #include "xfs_trace.h"
35 #include "xfs_trans.h"
36 #include "xfs_buf_item.h"
37 #include "xfs_cksum.h"
40 * Local function declarations.
42 static int xfs_dir2_leaf_lookup_int(xfs_da_args_t
*args
, struct xfs_buf
**lbpp
,
43 int *indexp
, struct xfs_buf
**dbpp
);
44 static void xfs_dir3_leaf_log_bests(struct xfs_trans
*tp
, struct xfs_buf
*bp
,
46 static void xfs_dir3_leaf_log_tail(struct xfs_trans
*tp
, struct xfs_buf
*bp
);
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 xfs_dir3_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_hdr_from_disk(
84 struct xfs_dir3_icleaf_hdr
*to
,
85 struct xfs_dir2_leaf
*from
)
87 if (from
->hdr
.info
.magic
== cpu_to_be16(XFS_DIR2_LEAF1_MAGIC
) ||
88 from
->hdr
.info
.magic
== cpu_to_be16(XFS_DIR2_LEAFN_MAGIC
)) {
89 to
->forw
= be32_to_cpu(from
->hdr
.info
.forw
);
90 to
->back
= be32_to_cpu(from
->hdr
.info
.back
);
91 to
->magic
= be16_to_cpu(from
->hdr
.info
.magic
);
92 to
->count
= be16_to_cpu(from
->hdr
.count
);
93 to
->stale
= be16_to_cpu(from
->hdr
.stale
);
95 struct xfs_dir3_leaf_hdr
*hdr3
= (struct xfs_dir3_leaf_hdr
*)from
;
97 to
->forw
= be32_to_cpu(hdr3
->info
.hdr
.forw
);
98 to
->back
= be32_to_cpu(hdr3
->info
.hdr
.back
);
99 to
->magic
= be16_to_cpu(hdr3
->info
.hdr
.magic
);
100 to
->count
= be16_to_cpu(hdr3
->count
);
101 to
->stale
= be16_to_cpu(hdr3
->stale
);
104 ASSERT(to
->magic
== XFS_DIR2_LEAF1_MAGIC
||
105 to
->magic
== XFS_DIR3_LEAF1_MAGIC
||
106 to
->magic
== XFS_DIR2_LEAFN_MAGIC
||
107 to
->magic
== XFS_DIR3_LEAFN_MAGIC
);
111 xfs_dir3_leaf_hdr_to_disk(
112 struct xfs_dir2_leaf
*to
,
113 struct xfs_dir3_icleaf_hdr
*from
)
115 ASSERT(from
->magic
== XFS_DIR2_LEAF1_MAGIC
||
116 from
->magic
== XFS_DIR3_LEAF1_MAGIC
||
117 from
->magic
== XFS_DIR2_LEAFN_MAGIC
||
118 from
->magic
== XFS_DIR3_LEAFN_MAGIC
);
120 if (from
->magic
== XFS_DIR2_LEAF1_MAGIC
||
121 from
->magic
== XFS_DIR2_LEAFN_MAGIC
) {
122 to
->hdr
.info
.forw
= cpu_to_be32(from
->forw
);
123 to
->hdr
.info
.back
= cpu_to_be32(from
->back
);
124 to
->hdr
.info
.magic
= cpu_to_be16(from
->magic
);
125 to
->hdr
.count
= cpu_to_be16(from
->count
);
126 to
->hdr
.stale
= cpu_to_be16(from
->stale
);
128 struct xfs_dir3_leaf_hdr
*hdr3
= (struct xfs_dir3_leaf_hdr
*)to
;
130 hdr3
->info
.hdr
.forw
= cpu_to_be32(from
->forw
);
131 hdr3
->info
.hdr
.back
= cpu_to_be32(from
->back
);
132 hdr3
->info
.hdr
.magic
= cpu_to_be16(from
->magic
);
133 hdr3
->count
= cpu_to_be16(from
->count
);
134 hdr3
->stale
= cpu_to_be16(from
->stale
);
139 xfs_dir3_leaf_check_int(
140 struct xfs_mount
*mp
,
141 struct xfs_inode
*dp
,
142 struct xfs_dir3_icleaf_hdr
*hdr
,
143 struct xfs_dir2_leaf
*leaf
)
145 struct xfs_dir2_leaf_entry
*ents
;
146 xfs_dir2_leaf_tail_t
*ltp
;
149 const struct xfs_dir_ops
*ops
;
152 * we can be passed a null dp here from a verifier, so we need to go the
153 * hard way to get them.
155 ops
= xfs_dir_get_ops(mp
, dp
);
157 ents
= ops
->leaf_ents_p(leaf
);
158 ltp
= xfs_dir2_leaf_tail_p(mp
, leaf
);
161 * XXX (dgc): This value is not restrictive enough.
162 * Should factor in the size of the bests table as well.
163 * We can deduce a value for that from di_size.
165 if (hdr
->count
> ops
->leaf_max_ents(mp
))
168 /* Leaves and bests don't overlap in leaf format. */
169 if ((hdr
->magic
== XFS_DIR2_LEAF1_MAGIC
||
170 hdr
->magic
== XFS_DIR3_LEAF1_MAGIC
) &&
171 (char *)&ents
[hdr
->count
] > (char *)xfs_dir2_leaf_bests_p(ltp
))
174 /* Check hash value order, count stale entries. */
175 for (i
= stale
= 0; i
< hdr
->count
; i
++) {
176 if (i
+ 1 < hdr
->count
) {
177 if (be32_to_cpu(ents
[i
].hashval
) >
178 be32_to_cpu(ents
[i
+ 1].hashval
))
181 if (ents
[i
].address
== cpu_to_be32(XFS_DIR2_NULL_DATAPTR
))
184 if (hdr
->stale
!= stale
)
190 * We verify the magic numbers before decoding the leaf header so that on debug
191 * kernels we don't get assertion failures in xfs_dir3_leaf_hdr_from_disk() due
192 * to incorrect magic numbers.
195 xfs_dir3_leaf_verify(
199 struct xfs_mount
*mp
= bp
->b_target
->bt_mount
;
200 struct xfs_dir2_leaf
*leaf
= bp
->b_addr
;
201 struct xfs_dir3_icleaf_hdr leafhdr
;
203 ASSERT(magic
== XFS_DIR2_LEAF1_MAGIC
|| magic
== XFS_DIR2_LEAFN_MAGIC
);
205 if (xfs_sb_version_hascrc(&mp
->m_sb
)) {
206 struct xfs_dir3_leaf_hdr
*leaf3
= bp
->b_addr
;
209 magic3
= (magic
== XFS_DIR2_LEAF1_MAGIC
) ? XFS_DIR3_LEAF1_MAGIC
210 : XFS_DIR3_LEAFN_MAGIC
;
212 if (leaf3
->info
.hdr
.magic
!= cpu_to_be16(magic3
))
214 if (!uuid_equal(&leaf3
->info
.uuid
, &mp
->m_sb
.sb_uuid
))
216 if (be64_to_cpu(leaf3
->info
.blkno
) != bp
->b_bn
)
219 if (leaf
->hdr
.info
.magic
!= cpu_to_be16(magic
))
223 xfs_dir3_leaf_hdr_from_disk(&leafhdr
, leaf
);
224 return xfs_dir3_leaf_check_int(mp
, NULL
, &leafhdr
, leaf
);
232 struct xfs_mount
*mp
= bp
->b_target
->bt_mount
;
234 if ((xfs_sb_version_hascrc(&mp
->m_sb
) &&
235 !xfs_verify_cksum(bp
->b_addr
, BBTOB(bp
->b_length
),
236 XFS_DIR3_LEAF_CRC_OFF
)) ||
237 !xfs_dir3_leaf_verify(bp
, magic
)) {
238 XFS_CORRUPTION_ERROR(__func__
, XFS_ERRLEVEL_LOW
, mp
, bp
->b_addr
);
239 xfs_buf_ioerror(bp
, EFSCORRUPTED
);
248 struct xfs_mount
*mp
= bp
->b_target
->bt_mount
;
249 struct xfs_buf_log_item
*bip
= bp
->b_fspriv
;
250 struct xfs_dir3_leaf_hdr
*hdr3
= bp
->b_addr
;
252 if (!xfs_dir3_leaf_verify(bp
, magic
)) {
253 XFS_CORRUPTION_ERROR(__func__
, XFS_ERRLEVEL_LOW
, mp
, bp
->b_addr
);
254 xfs_buf_ioerror(bp
, EFSCORRUPTED
);
258 if (!xfs_sb_version_hascrc(&mp
->m_sb
))
262 hdr3
->info
.lsn
= cpu_to_be64(bip
->bli_item
.li_lsn
);
264 xfs_update_cksum(bp
->b_addr
, BBTOB(bp
->b_length
), XFS_DIR3_LEAF_CRC_OFF
);
268 xfs_dir3_leaf1_read_verify(
271 __read_verify(bp
, XFS_DIR2_LEAF1_MAGIC
);
275 xfs_dir3_leaf1_write_verify(
278 __write_verify(bp
, XFS_DIR2_LEAF1_MAGIC
);
282 xfs_dir3_leafn_read_verify(
285 __read_verify(bp
, XFS_DIR2_LEAFN_MAGIC
);
289 xfs_dir3_leafn_write_verify(
292 __write_verify(bp
, XFS_DIR2_LEAFN_MAGIC
);
295 const struct xfs_buf_ops xfs_dir3_leaf1_buf_ops
= {
296 .verify_read
= xfs_dir3_leaf1_read_verify
,
297 .verify_write
= xfs_dir3_leaf1_write_verify
,
300 const struct xfs_buf_ops xfs_dir3_leafn_buf_ops
= {
301 .verify_read
= xfs_dir3_leafn_read_verify
,
302 .verify_write
= xfs_dir3_leafn_write_verify
,
307 struct xfs_trans
*tp
,
308 struct xfs_inode
*dp
,
310 xfs_daddr_t mappedbno
,
311 struct xfs_buf
**bpp
)
315 err
= xfs_da_read_buf(tp
, dp
, fbno
, mappedbno
, bpp
,
316 XFS_DATA_FORK
, &xfs_dir3_leaf1_buf_ops
);
318 xfs_trans_buf_set_type(tp
, *bpp
, XFS_BLFT_DIR_LEAF1_BUF
);
324 struct xfs_trans
*tp
,
325 struct xfs_inode
*dp
,
327 xfs_daddr_t mappedbno
,
328 struct xfs_buf
**bpp
)
332 err
= xfs_da_read_buf(tp
, dp
, fbno
, mappedbno
, bpp
,
333 XFS_DATA_FORK
, &xfs_dir3_leafn_buf_ops
);
335 xfs_trans_buf_set_type(tp
, *bpp
, XFS_BLFT_DIR_LEAFN_BUF
);
340 * Initialize a new leaf block, leaf1 or leafn magic accepted.
344 struct xfs_mount
*mp
,
345 struct xfs_trans
*tp
,
350 struct xfs_dir2_leaf
*leaf
= bp
->b_addr
;
352 ASSERT(type
== XFS_DIR2_LEAF1_MAGIC
|| type
== XFS_DIR2_LEAFN_MAGIC
);
354 if (xfs_sb_version_hascrc(&mp
->m_sb
)) {
355 struct xfs_dir3_leaf_hdr
*leaf3
= bp
->b_addr
;
357 memset(leaf3
, 0, sizeof(*leaf3
));
359 leaf3
->info
.hdr
.magic
= (type
== XFS_DIR2_LEAF1_MAGIC
)
360 ? cpu_to_be16(XFS_DIR3_LEAF1_MAGIC
)
361 : cpu_to_be16(XFS_DIR3_LEAFN_MAGIC
);
362 leaf3
->info
.blkno
= cpu_to_be64(bp
->b_bn
);
363 leaf3
->info
.owner
= cpu_to_be64(owner
);
364 uuid_copy(&leaf3
->info
.uuid
, &mp
->m_sb
.sb_uuid
);
366 memset(leaf
, 0, sizeof(*leaf
));
367 leaf
->hdr
.info
.magic
= cpu_to_be16(type
);
371 * If it's a leaf-format directory initialize the tail.
372 * Caller is responsible for initialising the bests table.
374 if (type
== XFS_DIR2_LEAF1_MAGIC
) {
375 struct xfs_dir2_leaf_tail
*ltp
;
377 ltp
= xfs_dir2_leaf_tail_p(mp
, leaf
);
379 bp
->b_ops
= &xfs_dir3_leaf1_buf_ops
;
380 xfs_trans_buf_set_type(tp
, bp
, XFS_BLFT_DIR_LEAF1_BUF
);
382 bp
->b_ops
= &xfs_dir3_leafn_buf_ops
;
383 xfs_trans_buf_set_type(tp
, bp
, XFS_BLFT_DIR_LEAFN_BUF
);
388 xfs_dir3_leaf_get_buf(
391 struct xfs_buf
**bpp
,
394 struct xfs_inode
*dp
= args
->dp
;
395 struct xfs_trans
*tp
= args
->trans
;
396 struct xfs_mount
*mp
= dp
->i_mount
;
400 ASSERT(magic
== XFS_DIR2_LEAF1_MAGIC
|| magic
== XFS_DIR2_LEAFN_MAGIC
);
401 ASSERT(bno
>= XFS_DIR2_LEAF_FIRSTDB(mp
) &&
402 bno
< XFS_DIR2_FREE_FIRSTDB(mp
));
404 error
= xfs_da_get_buf(tp
, dp
, xfs_dir2_db_to_da(mp
, bno
), -1, &bp
,
409 xfs_dir3_leaf_init(mp
, tp
, bp
, dp
->i_ino
, magic
);
410 xfs_dir3_leaf_log_header(tp
, dp
, bp
);
411 if (magic
== XFS_DIR2_LEAF1_MAGIC
)
412 xfs_dir3_leaf_log_tail(tp
, bp
);
418 * Convert a block form directory to a leaf form directory.
421 xfs_dir2_block_to_leaf(
422 xfs_da_args_t
*args
, /* operation arguments */
423 struct xfs_buf
*dbp
) /* input block's buffer */
425 __be16
*bestsp
; /* leaf's bestsp entries */
426 xfs_dablk_t blkno
; /* leaf block's bno */
427 xfs_dir2_data_hdr_t
*hdr
; /* block header */
428 xfs_dir2_leaf_entry_t
*blp
; /* block's leaf entries */
429 xfs_dir2_block_tail_t
*btp
; /* block's tail */
430 xfs_inode_t
*dp
; /* incore directory inode */
431 int error
; /* error return code */
432 struct xfs_buf
*lbp
; /* leaf block's buffer */
433 xfs_dir2_db_t ldb
; /* leaf block's bno */
434 xfs_dir2_leaf_t
*leaf
; /* leaf structure */
435 xfs_dir2_leaf_tail_t
*ltp
; /* leaf's tail */
436 xfs_mount_t
*mp
; /* filesystem mount point */
437 int needlog
; /* need to log block header */
438 int needscan
; /* need to rescan bestfree */
439 xfs_trans_t
*tp
; /* transaction pointer */
440 struct xfs_dir2_data_free
*bf
;
441 struct xfs_dir2_leaf_entry
*ents
;
442 struct xfs_dir3_icleaf_hdr leafhdr
;
444 trace_xfs_dir2_block_to_leaf(args
);
450 * Add the leaf block to the inode.
451 * This interface will only put blocks in the leaf/node range.
452 * Since that's empty now, we'll get the root (block 0 in range).
454 if ((error
= xfs_da_grow_inode(args
, &blkno
))) {
457 ldb
= xfs_dir2_da_to_db(mp
, blkno
);
458 ASSERT(ldb
== XFS_DIR2_LEAF_FIRSTDB(mp
));
460 * Initialize the leaf block, get a buffer for it.
462 error
= xfs_dir3_leaf_get_buf(args
, ldb
, &lbp
, XFS_DIR2_LEAF1_MAGIC
);
468 xfs_dir3_data_check(dp
, dbp
);
469 btp
= xfs_dir2_block_tail_p(mp
, hdr
);
470 blp
= xfs_dir2_block_leaf_p(btp
);
471 bf
= dp
->d_ops
->data_bestfree_p(hdr
);
472 ents
= dp
->d_ops
->leaf_ents_p(leaf
);
475 * Set the counts in the leaf header.
477 xfs_dir3_leaf_hdr_from_disk(&leafhdr
, leaf
);
478 leafhdr
.count
= be32_to_cpu(btp
->count
);
479 leafhdr
.stale
= be32_to_cpu(btp
->stale
);
480 xfs_dir3_leaf_hdr_to_disk(leaf
, &leafhdr
);
481 xfs_dir3_leaf_log_header(tp
, dp
, lbp
);
484 * Could compact these but I think we always do the conversion
485 * after squeezing out stale entries.
487 memcpy(ents
, blp
, be32_to_cpu(btp
->count
) * sizeof(xfs_dir2_leaf_entry_t
));
488 xfs_dir3_leaf_log_ents(tp
, dp
, lbp
, 0, leafhdr
.count
- 1);
492 * Make the space formerly occupied by the leaf entries and block
495 xfs_dir2_data_make_free(tp
, dp
, dbp
,
496 (xfs_dir2_data_aoff_t
)((char *)blp
- (char *)hdr
),
497 (xfs_dir2_data_aoff_t
)((char *)hdr
+ mp
->m_dirblksize
-
499 &needlog
, &needscan
);
501 * Fix up the block header, make it a data block.
503 dbp
->b_ops
= &xfs_dir3_data_buf_ops
;
504 xfs_trans_buf_set_type(tp
, dbp
, XFS_BLFT_DIR_DATA_BUF
);
505 if (hdr
->magic
== cpu_to_be32(XFS_DIR2_BLOCK_MAGIC
))
506 hdr
->magic
= cpu_to_be32(XFS_DIR2_DATA_MAGIC
);
508 hdr
->magic
= cpu_to_be32(XFS_DIR3_DATA_MAGIC
);
511 xfs_dir2_data_freescan(dp
, hdr
, &needlog
);
513 * Set up leaf tail and bests table.
515 ltp
= xfs_dir2_leaf_tail_p(mp
, leaf
);
516 ltp
->bestcount
= cpu_to_be32(1);
517 bestsp
= xfs_dir2_leaf_bests_p(ltp
);
518 bestsp
[0] = bf
[0].length
;
520 * Log the data header and leaf bests table.
523 xfs_dir2_data_log_header(tp
, dp
, dbp
);
524 xfs_dir3_leaf_check(dp
, lbp
);
525 xfs_dir3_data_check(dp
, dbp
);
526 xfs_dir3_leaf_log_bests(tp
, lbp
, 0, 0);
531 xfs_dir3_leaf_find_stale(
532 struct xfs_dir3_icleaf_hdr
*leafhdr
,
533 struct xfs_dir2_leaf_entry
*ents
,
539 * Find the first stale entry before our index, if any.
541 for (*lowstale
= index
- 1; *lowstale
>= 0; --*lowstale
) {
542 if (ents
[*lowstale
].address
==
543 cpu_to_be32(XFS_DIR2_NULL_DATAPTR
))
548 * Find the first stale entry at or after our index, if any.
549 * Stop if the result would require moving more entries than using
552 for (*highstale
= index
; *highstale
< leafhdr
->count
; ++*highstale
) {
553 if (ents
[*highstale
].address
==
554 cpu_to_be32(XFS_DIR2_NULL_DATAPTR
))
556 if (*lowstale
>= 0 && index
- *lowstale
<= *highstale
- index
)
561 struct xfs_dir2_leaf_entry
*
562 xfs_dir3_leaf_find_entry(
563 struct xfs_dir3_icleaf_hdr
*leafhdr
,
564 struct xfs_dir2_leaf_entry
*ents
,
565 int index
, /* leaf table position */
566 int compact
, /* need to compact leaves */
567 int lowstale
, /* index of prev stale leaf */
568 int highstale
, /* index of next stale leaf */
569 int *lfloglow
, /* low leaf logging index */
570 int *lfloghigh
) /* high leaf logging index */
572 if (!leafhdr
->stale
) {
573 xfs_dir2_leaf_entry_t
*lep
; /* leaf entry table pointer */
576 * Now we need to make room to insert the leaf entry.
578 * If there are no stale entries, just insert a hole at index.
581 if (index
< leafhdr
->count
)
582 memmove(lep
+ 1, lep
,
583 (leafhdr
->count
- index
) * sizeof(*lep
));
586 * Record low and high logging indices for the leaf.
589 *lfloghigh
= leafhdr
->count
++;
594 * There are stale entries.
596 * We will use one of them for the new entry. It's probably not at
597 * the right location, so we'll have to shift some up or down first.
599 * If we didn't compact before, we need to find the nearest stale
600 * entries before and after our insertion point.
603 xfs_dir3_leaf_find_stale(leafhdr
, ents
, index
,
604 &lowstale
, &highstale
);
607 * If the low one is better, use it.
610 (highstale
== leafhdr
->count
||
611 index
- lowstale
- 1 < highstale
- index
)) {
612 ASSERT(index
- lowstale
- 1 >= 0);
613 ASSERT(ents
[lowstale
].address
==
614 cpu_to_be32(XFS_DIR2_NULL_DATAPTR
));
617 * Copy entries up to cover the stale entry and make room
620 if (index
- lowstale
- 1 > 0) {
621 memmove(&ents
[lowstale
], &ents
[lowstale
+ 1],
622 (index
- lowstale
- 1) *
623 sizeof(xfs_dir2_leaf_entry_t
));
625 *lfloglow
= MIN(lowstale
, *lfloglow
);
626 *lfloghigh
= MAX(index
- 1, *lfloghigh
);
628 return &ents
[index
- 1];
632 * The high one is better, so use that one.
634 ASSERT(highstale
- index
>= 0);
635 ASSERT(ents
[highstale
].address
== cpu_to_be32(XFS_DIR2_NULL_DATAPTR
));
638 * Copy entries down to cover the stale entry and make room for the
641 if (highstale
- index
> 0) {
642 memmove(&ents
[index
+ 1], &ents
[index
],
643 (highstale
- index
) * sizeof(xfs_dir2_leaf_entry_t
));
645 *lfloglow
= MIN(index
, *lfloglow
);
646 *lfloghigh
= MAX(highstale
, *lfloghigh
);
652 * Add an entry to a leaf form directory.
655 xfs_dir2_leaf_addname(
656 xfs_da_args_t
*args
) /* operation arguments */
658 __be16
*bestsp
; /* freespace table in leaf */
659 int compact
; /* need to compact leaves */
660 xfs_dir2_data_hdr_t
*hdr
; /* data block header */
661 struct xfs_buf
*dbp
; /* data block buffer */
662 xfs_dir2_data_entry_t
*dep
; /* data block entry */
663 xfs_inode_t
*dp
; /* incore directory inode */
664 xfs_dir2_data_unused_t
*dup
; /* data unused entry */
665 int error
; /* error return value */
666 int grown
; /* allocated new data block */
667 int highstale
; /* index of next stale leaf */
668 int i
; /* temporary, index */
669 int index
; /* leaf table position */
670 struct xfs_buf
*lbp
; /* leaf's buffer */
671 xfs_dir2_leaf_t
*leaf
; /* leaf structure */
672 int length
; /* length of new entry */
673 xfs_dir2_leaf_entry_t
*lep
; /* leaf entry table pointer */
674 int lfloglow
; /* low leaf logging index */
675 int lfloghigh
; /* high leaf logging index */
676 int lowstale
; /* index of prev stale leaf */
677 xfs_dir2_leaf_tail_t
*ltp
; /* leaf tail pointer */
678 xfs_mount_t
*mp
; /* filesystem mount point */
679 int needbytes
; /* leaf block bytes needed */
680 int needlog
; /* need to log data header */
681 int needscan
; /* need to rescan data free */
682 __be16
*tagp
; /* end of data entry */
683 xfs_trans_t
*tp
; /* transaction pointer */
684 xfs_dir2_db_t use_block
; /* data block number */
685 struct xfs_dir2_data_free
*bf
; /* bestfree table */
686 struct xfs_dir2_leaf_entry
*ents
;
687 struct xfs_dir3_icleaf_hdr leafhdr
;
689 trace_xfs_dir2_leaf_addname(args
);
695 error
= xfs_dir3_leaf_read(tp
, dp
, mp
->m_dirleafblk
, -1, &lbp
);
700 * Look up the entry by hash value and name.
701 * We know it's not there, our caller has already done a lookup.
702 * So the index is of the entry to insert in front of.
703 * But if there are dup hash values the index is of the first of those.
705 index
= xfs_dir2_leaf_search_hash(args
, lbp
);
707 ltp
= xfs_dir2_leaf_tail_p(mp
, leaf
);
708 ents
= dp
->d_ops
->leaf_ents_p(leaf
);
709 xfs_dir3_leaf_hdr_from_disk(&leafhdr
, leaf
);
710 bestsp
= xfs_dir2_leaf_bests_p(ltp
);
711 length
= dp
->d_ops
->data_entsize(args
->namelen
);
714 * See if there are any entries with the same hash value
715 * and space in their block for the new entry.
716 * This is good because it puts multiple same-hash value entries
717 * in a data block, improving the lookup of those entries.
719 for (use_block
= -1, lep
= &ents
[index
];
720 index
< leafhdr
.count
&& be32_to_cpu(lep
->hashval
) == args
->hashval
;
722 if (be32_to_cpu(lep
->address
) == XFS_DIR2_NULL_DATAPTR
)
724 i
= xfs_dir2_dataptr_to_db(mp
, be32_to_cpu(lep
->address
));
725 ASSERT(i
< be32_to_cpu(ltp
->bestcount
));
726 ASSERT(bestsp
[i
] != cpu_to_be16(NULLDATAOFF
));
727 if (be16_to_cpu(bestsp
[i
]) >= length
) {
733 * Didn't find a block yet, linear search all the data blocks.
735 if (use_block
== -1) {
736 for (i
= 0; i
< be32_to_cpu(ltp
->bestcount
); i
++) {
738 * Remember a block we see that's missing.
740 if (bestsp
[i
] == cpu_to_be16(NULLDATAOFF
) &&
743 else if (be16_to_cpu(bestsp
[i
]) >= length
) {
750 * How many bytes do we need in the leaf block?
754 needbytes
+= sizeof(xfs_dir2_leaf_entry_t
);
756 needbytes
+= sizeof(xfs_dir2_data_off_t
);
759 * Now kill use_block if it refers to a missing block, so we
760 * can use it as an indication of allocation needed.
762 if (use_block
!= -1 && bestsp
[use_block
] == cpu_to_be16(NULLDATAOFF
))
765 * If we don't have enough free bytes but we can make enough
766 * by compacting out stale entries, we'll do that.
768 if ((char *)bestsp
- (char *)&ents
[leafhdr
.count
] < needbytes
&&
773 * Otherwise if we don't have enough free bytes we need to
774 * convert to node form.
776 else if ((char *)bestsp
- (char *)&ents
[leafhdr
.count
] < needbytes
) {
778 * Just checking or no space reservation, give up.
780 if ((args
->op_flags
& XFS_DA_OP_JUSTCHECK
) ||
782 xfs_trans_brelse(tp
, lbp
);
783 return XFS_ERROR(ENOSPC
);
786 * Convert to node form.
788 error
= xfs_dir2_leaf_to_node(args
, lbp
);
792 * Then add the new entry.
794 return xfs_dir2_node_addname(args
);
797 * Otherwise it will fit without compaction.
802 * If just checking, then it will fit unless we needed to allocate
805 if (args
->op_flags
& XFS_DA_OP_JUSTCHECK
) {
806 xfs_trans_brelse(tp
, lbp
);
807 return use_block
== -1 ? XFS_ERROR(ENOSPC
) : 0;
810 * If no allocations are allowed, return now before we've
813 if (args
->total
== 0 && use_block
== -1) {
814 xfs_trans_brelse(tp
, lbp
);
815 return XFS_ERROR(ENOSPC
);
818 * Need to compact the leaf entries, removing stale ones.
819 * Leave one stale entry behind - the one closest to our
820 * insertion index - and we'll shift that one to our insertion
824 xfs_dir3_leaf_compact_x1(&leafhdr
, ents
, &index
, &lowstale
,
825 &highstale
, &lfloglow
, &lfloghigh
);
828 * There are stale entries, so we'll need log-low and log-high
829 * impossibly bad values later.
831 else if (leafhdr
.stale
) {
832 lfloglow
= leafhdr
.count
;
836 * If there was no data block space found, we need to allocate
839 if (use_block
== -1) {
841 * Add the new data block.
843 if ((error
= xfs_dir2_grow_inode(args
, XFS_DIR2_DATA_SPACE
,
845 xfs_trans_brelse(tp
, lbp
);
849 * Initialize the block.
851 if ((error
= xfs_dir3_data_init(args
, use_block
, &dbp
))) {
852 xfs_trans_brelse(tp
, lbp
);
856 * If we're adding a new data block on the end we need to
857 * extend the bests table. Copy it up one entry.
859 if (use_block
>= be32_to_cpu(ltp
->bestcount
)) {
861 memmove(&bestsp
[0], &bestsp
[1],
862 be32_to_cpu(ltp
->bestcount
) * sizeof(bestsp
[0]));
863 be32_add_cpu(<p
->bestcount
, 1);
864 xfs_dir3_leaf_log_tail(tp
, lbp
);
865 xfs_dir3_leaf_log_bests(tp
, lbp
, 0, be32_to_cpu(ltp
->bestcount
) - 1);
868 * If we're filling in a previously empty block just log it.
871 xfs_dir3_leaf_log_bests(tp
, lbp
, use_block
, use_block
);
873 bf
= dp
->d_ops
->data_bestfree_p(hdr
);
874 bestsp
[use_block
] = bf
[0].length
;
878 * Already had space in some data block.
879 * Just read that one in.
881 error
= xfs_dir3_data_read(tp
, dp
,
882 xfs_dir2_db_to_da(mp
, use_block
),
885 xfs_trans_brelse(tp
, lbp
);
889 bf
= dp
->d_ops
->data_bestfree_p(hdr
);
893 * Point to the biggest freespace in our data block.
895 dup
= (xfs_dir2_data_unused_t
*)
896 ((char *)hdr
+ be16_to_cpu(bf
[0].offset
));
897 ASSERT(be16_to_cpu(dup
->length
) >= length
);
898 needscan
= needlog
= 0;
900 * Mark the initial part of our freespace in use for the new entry.
902 xfs_dir2_data_use_free(tp
, dp
, dbp
, dup
,
903 (xfs_dir2_data_aoff_t
)((char *)dup
- (char *)hdr
), length
,
904 &needlog
, &needscan
);
906 * Initialize our new entry (at last).
908 dep
= (xfs_dir2_data_entry_t
*)dup
;
909 dep
->inumber
= cpu_to_be64(args
->inumber
);
910 dep
->namelen
= args
->namelen
;
911 memcpy(dep
->name
, args
->name
, dep
->namelen
);
912 dp
->d_ops
->data_put_ftype(dep
, args
->filetype
);
913 tagp
= dp
->d_ops
->data_entry_tag_p(dep
);
914 *tagp
= cpu_to_be16((char *)dep
- (char *)hdr
);
916 * Need to scan fix up the bestfree table.
919 xfs_dir2_data_freescan(dp
, hdr
, &needlog
);
921 * Need to log the data block's header.
924 xfs_dir2_data_log_header(tp
, dp
, dbp
);
925 xfs_dir2_data_log_entry(tp
, dp
, dbp
, dep
);
927 * If the bests table needs to be changed, do it.
928 * Log the change unless we've already done that.
930 if (be16_to_cpu(bestsp
[use_block
]) != be16_to_cpu(bf
[0].length
)) {
931 bestsp
[use_block
] = bf
[0].length
;
933 xfs_dir3_leaf_log_bests(tp
, lbp
, use_block
, use_block
);
936 lep
= xfs_dir3_leaf_find_entry(&leafhdr
, ents
, index
, compact
, lowstale
,
937 highstale
, &lfloglow
, &lfloghigh
);
940 * Fill in the new leaf entry.
942 lep
->hashval
= cpu_to_be32(args
->hashval
);
943 lep
->address
= cpu_to_be32(xfs_dir2_db_off_to_dataptr(mp
, use_block
,
944 be16_to_cpu(*tagp
)));
946 * Log the leaf fields and give up the buffers.
948 xfs_dir3_leaf_hdr_to_disk(leaf
, &leafhdr
);
949 xfs_dir3_leaf_log_header(tp
, dp
, lbp
);
950 xfs_dir3_leaf_log_ents(tp
, dp
, lbp
, lfloglow
, lfloghigh
);
951 xfs_dir3_leaf_check(dp
, lbp
);
952 xfs_dir3_data_check(dp
, dbp
);
957 * Compact out any stale entries in the leaf.
958 * Log the header and changed leaf entries, if any.
961 xfs_dir3_leaf_compact(
962 xfs_da_args_t
*args
, /* operation arguments */
963 struct xfs_dir3_icleaf_hdr
*leafhdr
,
964 struct xfs_buf
*bp
) /* leaf buffer */
966 int from
; /* source leaf index */
967 xfs_dir2_leaf_t
*leaf
; /* leaf structure */
968 int loglow
; /* first leaf entry to log */
969 int to
; /* target leaf index */
970 struct xfs_dir2_leaf_entry
*ents
;
977 * Compress out the stale entries in place.
979 ents
= args
->dp
->d_ops
->leaf_ents_p(leaf
);
980 for (from
= to
= 0, loglow
= -1; from
< leafhdr
->count
; from
++) {
981 if (ents
[from
].address
== cpu_to_be32(XFS_DIR2_NULL_DATAPTR
))
984 * Only actually copy the entries that are different.
989 ents
[to
] = ents
[from
];
994 * Update and log the header, log the leaf entries.
996 ASSERT(leafhdr
->stale
== from
- to
);
997 leafhdr
->count
-= leafhdr
->stale
;
1000 xfs_dir3_leaf_hdr_to_disk(leaf
, leafhdr
);
1001 xfs_dir3_leaf_log_header(args
->trans
, args
->dp
, bp
);
1003 xfs_dir3_leaf_log_ents(args
->trans
, args
->dp
, bp
,
1008 * Compact the leaf entries, removing stale ones.
1009 * Leave one stale entry behind - the one closest to our
1010 * insertion index - and the caller will shift that one to our insertion
1012 * Return new insertion index, where the remaining stale entry is,
1013 * and leaf logging indices.
1016 xfs_dir3_leaf_compact_x1(
1017 struct xfs_dir3_icleaf_hdr
*leafhdr
,
1018 struct xfs_dir2_leaf_entry
*ents
,
1019 int *indexp
, /* insertion index */
1020 int *lowstalep
, /* out: stale entry before us */
1021 int *highstalep
, /* out: stale entry after us */
1022 int *lowlogp
, /* out: low log index */
1023 int *highlogp
) /* out: high log index */
1025 int from
; /* source copy index */
1026 int highstale
; /* stale entry at/after index */
1027 int index
; /* insertion index */
1028 int keepstale
; /* source index of kept stale */
1029 int lowstale
; /* stale entry before index */
1030 int newindex
=0; /* new insertion index */
1031 int to
; /* destination copy index */
1033 ASSERT(leafhdr
->stale
> 1);
1036 xfs_dir3_leaf_find_stale(leafhdr
, ents
, index
, &lowstale
, &highstale
);
1039 * Pick the better of lowstale and highstale.
1041 if (lowstale
>= 0 &&
1042 (highstale
== leafhdr
->count
||
1043 index
- lowstale
<= highstale
- index
))
1044 keepstale
= lowstale
;
1046 keepstale
= highstale
;
1048 * Copy the entries in place, removing all the stale entries
1051 for (from
= to
= 0; from
< leafhdr
->count
; from
++) {
1053 * Notice the new value of index.
1057 if (from
!= keepstale
&&
1058 ents
[from
].address
== cpu_to_be32(XFS_DIR2_NULL_DATAPTR
)) {
1064 * Record the new keepstale value for the insertion.
1066 if (from
== keepstale
)
1067 lowstale
= highstale
= to
;
1069 * Copy only the entries that have moved.
1072 ents
[to
] = ents
[from
];
1077 * If the insertion point was past the last entry,
1078 * set the new insertion point accordingly.
1084 * Adjust the leaf header values.
1086 leafhdr
->count
-= from
- to
;
1089 * Remember the low/high stale value only in the "right"
1092 if (lowstale
>= newindex
)
1095 highstale
= leafhdr
->count
;
1096 *highlogp
= leafhdr
->count
- 1;
1097 *lowstalep
= lowstale
;
1098 *highstalep
= highstale
;
1102 * Log the bests entries indicated from a leaf1 block.
1105 xfs_dir3_leaf_log_bests(
1106 xfs_trans_t
*tp
, /* transaction pointer */
1107 struct xfs_buf
*bp
, /* leaf buffer */
1108 int first
, /* first entry to log */
1109 int last
) /* last entry to log */
1111 __be16
*firstb
; /* pointer to first entry */
1112 __be16
*lastb
; /* pointer to last entry */
1113 struct xfs_dir2_leaf
*leaf
= bp
->b_addr
;
1114 xfs_dir2_leaf_tail_t
*ltp
; /* leaf tail structure */
1116 ASSERT(leaf
->hdr
.info
.magic
== cpu_to_be16(XFS_DIR2_LEAF1_MAGIC
) ||
1117 leaf
->hdr
.info
.magic
== cpu_to_be16(XFS_DIR3_LEAF1_MAGIC
));
1119 ltp
= xfs_dir2_leaf_tail_p(tp
->t_mountp
, leaf
);
1120 firstb
= xfs_dir2_leaf_bests_p(ltp
) + first
;
1121 lastb
= xfs_dir2_leaf_bests_p(ltp
) + last
;
1122 xfs_trans_log_buf(tp
, bp
, (uint
)((char *)firstb
- (char *)leaf
),
1123 (uint
)((char *)lastb
- (char *)leaf
+ sizeof(*lastb
) - 1));
1127 * Log the leaf entries indicated from a leaf1 or leafn block.
1130 xfs_dir3_leaf_log_ents(
1131 struct xfs_trans
*tp
,
1132 struct xfs_inode
*dp
,
1137 xfs_dir2_leaf_entry_t
*firstlep
; /* pointer to first entry */
1138 xfs_dir2_leaf_entry_t
*lastlep
; /* pointer to last entry */
1139 struct xfs_dir2_leaf
*leaf
= bp
->b_addr
;
1140 struct xfs_dir2_leaf_entry
*ents
;
1142 ASSERT(leaf
->hdr
.info
.magic
== cpu_to_be16(XFS_DIR2_LEAF1_MAGIC
) ||
1143 leaf
->hdr
.info
.magic
== cpu_to_be16(XFS_DIR3_LEAF1_MAGIC
) ||
1144 leaf
->hdr
.info
.magic
== cpu_to_be16(XFS_DIR2_LEAFN_MAGIC
) ||
1145 leaf
->hdr
.info
.magic
== cpu_to_be16(XFS_DIR3_LEAFN_MAGIC
));
1147 ents
= dp
->d_ops
->leaf_ents_p(leaf
);
1148 firstlep
= &ents
[first
];
1149 lastlep
= &ents
[last
];
1150 xfs_trans_log_buf(tp
, bp
, (uint
)((char *)firstlep
- (char *)leaf
),
1151 (uint
)((char *)lastlep
- (char *)leaf
+ sizeof(*lastlep
) - 1));
1155 * Log the header of the leaf1 or leafn block.
1158 xfs_dir3_leaf_log_header(
1159 struct xfs_trans
*tp
,
1160 struct xfs_inode
*dp
,
1163 struct xfs_dir2_leaf
*leaf
= bp
->b_addr
;
1165 ASSERT(leaf
->hdr
.info
.magic
== cpu_to_be16(XFS_DIR2_LEAF1_MAGIC
) ||
1166 leaf
->hdr
.info
.magic
== cpu_to_be16(XFS_DIR3_LEAF1_MAGIC
) ||
1167 leaf
->hdr
.info
.magic
== cpu_to_be16(XFS_DIR2_LEAFN_MAGIC
) ||
1168 leaf
->hdr
.info
.magic
== cpu_to_be16(XFS_DIR3_LEAFN_MAGIC
));
1170 xfs_trans_log_buf(tp
, bp
, (uint
)((char *)&leaf
->hdr
- (char *)leaf
),
1171 dp
->d_ops
->leaf_hdr_size() - 1);
1175 * Log the tail of the leaf1 block.
1178 xfs_dir3_leaf_log_tail(
1179 struct xfs_trans
*tp
,
1182 struct xfs_dir2_leaf
*leaf
= bp
->b_addr
;
1183 xfs_dir2_leaf_tail_t
*ltp
; /* leaf tail structure */
1184 struct xfs_mount
*mp
= tp
->t_mountp
;
1186 ASSERT(leaf
->hdr
.info
.magic
== cpu_to_be16(XFS_DIR2_LEAF1_MAGIC
) ||
1187 leaf
->hdr
.info
.magic
== cpu_to_be16(XFS_DIR3_LEAF1_MAGIC
) ||
1188 leaf
->hdr
.info
.magic
== cpu_to_be16(XFS_DIR2_LEAFN_MAGIC
) ||
1189 leaf
->hdr
.info
.magic
== cpu_to_be16(XFS_DIR3_LEAFN_MAGIC
));
1191 ltp
= xfs_dir2_leaf_tail_p(mp
, leaf
);
1192 xfs_trans_log_buf(tp
, bp
, (uint
)((char *)ltp
- (char *)leaf
),
1193 (uint
)(mp
->m_dirblksize
- 1));
1197 * Look up the entry referred to by args in the leaf format directory.
1198 * Most of the work is done by the xfs_dir2_leaf_lookup_int routine which
1199 * is also used by the node-format code.
1202 xfs_dir2_leaf_lookup(
1203 xfs_da_args_t
*args
) /* operation arguments */
1205 struct xfs_buf
*dbp
; /* data block buffer */
1206 xfs_dir2_data_entry_t
*dep
; /* data block entry */
1207 xfs_inode_t
*dp
; /* incore directory inode */
1208 int error
; /* error return code */
1209 int index
; /* found entry index */
1210 struct xfs_buf
*lbp
; /* leaf buffer */
1211 xfs_dir2_leaf_t
*leaf
; /* leaf structure */
1212 xfs_dir2_leaf_entry_t
*lep
; /* leaf entry */
1213 xfs_trans_t
*tp
; /* transaction pointer */
1214 struct xfs_dir2_leaf_entry
*ents
;
1216 trace_xfs_dir2_leaf_lookup(args
);
1219 * Look up name in the leaf block, returning both buffers and index.
1221 if ((error
= xfs_dir2_leaf_lookup_int(args
, &lbp
, &index
, &dbp
))) {
1226 xfs_dir3_leaf_check(dp
, lbp
);
1228 ents
= dp
->d_ops
->leaf_ents_p(leaf
);
1230 * Get to the leaf entry and contained data entry address.
1235 * Point to the data entry.
1237 dep
= (xfs_dir2_data_entry_t
*)
1238 ((char *)dbp
->b_addr
+
1239 xfs_dir2_dataptr_to_off(dp
->i_mount
, be32_to_cpu(lep
->address
)));
1241 * Return the found inode number & CI name if appropriate
1243 args
->inumber
= be64_to_cpu(dep
->inumber
);
1244 args
->filetype
= dp
->d_ops
->data_get_ftype(dep
);
1245 error
= xfs_dir_cilookup_result(args
, dep
->name
, dep
->namelen
);
1246 xfs_trans_brelse(tp
, dbp
);
1247 xfs_trans_brelse(tp
, lbp
);
1248 return XFS_ERROR(error
);
1252 * Look up name/hash in the leaf block.
1253 * Fill in indexp with the found index, and dbpp with the data buffer.
1254 * If not found dbpp will be NULL, and ENOENT comes back.
1255 * lbpp will always be filled in with the leaf buffer unless there's an error.
1257 static int /* error */
1258 xfs_dir2_leaf_lookup_int(
1259 xfs_da_args_t
*args
, /* operation arguments */
1260 struct xfs_buf
**lbpp
, /* out: leaf buffer */
1261 int *indexp
, /* out: index in leaf block */
1262 struct xfs_buf
**dbpp
) /* out: data buffer */
1264 xfs_dir2_db_t curdb
= -1; /* current data block number */
1265 struct xfs_buf
*dbp
= NULL
; /* data buffer */
1266 xfs_dir2_data_entry_t
*dep
; /* data entry */
1267 xfs_inode_t
*dp
; /* incore directory inode */
1268 int error
; /* error return code */
1269 int index
; /* index in leaf block */
1270 struct xfs_buf
*lbp
; /* leaf buffer */
1271 xfs_dir2_leaf_entry_t
*lep
; /* leaf entry */
1272 xfs_dir2_leaf_t
*leaf
; /* leaf structure */
1273 xfs_mount_t
*mp
; /* filesystem mount point */
1274 xfs_dir2_db_t newdb
; /* new data block number */
1275 xfs_trans_t
*tp
; /* transaction pointer */
1276 xfs_dir2_db_t cidb
= -1; /* case match data block no. */
1277 enum xfs_dacmp cmp
; /* name compare result */
1278 struct xfs_dir2_leaf_entry
*ents
;
1279 struct xfs_dir3_icleaf_hdr leafhdr
;
1285 error
= xfs_dir3_leaf_read(tp
, dp
, mp
->m_dirleafblk
, -1, &lbp
);
1291 xfs_dir3_leaf_check(dp
, lbp
);
1292 ents
= dp
->d_ops
->leaf_ents_p(leaf
);
1293 xfs_dir3_leaf_hdr_from_disk(&leafhdr
, leaf
);
1296 * Look for the first leaf entry with our hash value.
1298 index
= xfs_dir2_leaf_search_hash(args
, lbp
);
1300 * Loop over all the entries with the right hash value
1301 * looking to match the name.
1303 for (lep
= &ents
[index
];
1304 index
< leafhdr
.count
&& be32_to_cpu(lep
->hashval
) == args
->hashval
;
1307 * Skip over stale leaf entries.
1309 if (be32_to_cpu(lep
->address
) == XFS_DIR2_NULL_DATAPTR
)
1312 * Get the new data block number.
1314 newdb
= xfs_dir2_dataptr_to_db(mp
, be32_to_cpu(lep
->address
));
1316 * If it's not the same as the old data block number,
1317 * need to pitch the old one and read the new one.
1319 if (newdb
!= curdb
) {
1321 xfs_trans_brelse(tp
, dbp
);
1322 error
= xfs_dir3_data_read(tp
, dp
,
1323 xfs_dir2_db_to_da(mp
, newdb
),
1326 xfs_trans_brelse(tp
, lbp
);
1332 * Point to the data entry.
1334 dep
= (xfs_dir2_data_entry_t
*)((char *)dbp
->b_addr
+
1335 xfs_dir2_dataptr_to_off(mp
, be32_to_cpu(lep
->address
)));
1337 * Compare name and if it's an exact match, return the index
1338 * and buffer. If it's the first case-insensitive match, store
1339 * the index and buffer and continue looking for an exact match.
1341 cmp
= mp
->m_dirnameops
->compname(args
, dep
->name
, dep
->namelen
);
1342 if (cmp
!= XFS_CMP_DIFFERENT
&& cmp
!= args
->cmpresult
) {
1343 args
->cmpresult
= cmp
;
1345 /* case exact match: return the current buffer. */
1346 if (cmp
== XFS_CMP_EXACT
) {
1353 ASSERT(args
->op_flags
& XFS_DA_OP_OKNOENT
);
1355 * Here, we can only be doing a lookup (not a rename or remove).
1356 * If a case-insensitive match was found earlier, re-read the
1357 * appropriate data block if required and return it.
1359 if (args
->cmpresult
== XFS_CMP_CASE
) {
1361 if (cidb
!= curdb
) {
1362 xfs_trans_brelse(tp
, dbp
);
1363 error
= xfs_dir3_data_read(tp
, dp
,
1364 xfs_dir2_db_to_da(mp
, cidb
),
1367 xfs_trans_brelse(tp
, lbp
);
1375 * No match found, return ENOENT.
1379 xfs_trans_brelse(tp
, dbp
);
1380 xfs_trans_brelse(tp
, lbp
);
1381 return XFS_ERROR(ENOENT
);
1385 * Remove an entry from a leaf format directory.
1388 xfs_dir2_leaf_removename(
1389 xfs_da_args_t
*args
) /* operation arguments */
1391 __be16
*bestsp
; /* leaf block best freespace */
1392 xfs_dir2_data_hdr_t
*hdr
; /* data block header */
1393 xfs_dir2_db_t db
; /* data block number */
1394 struct xfs_buf
*dbp
; /* data block buffer */
1395 xfs_dir2_data_entry_t
*dep
; /* data entry structure */
1396 xfs_inode_t
*dp
; /* incore directory inode */
1397 int error
; /* error return code */
1398 xfs_dir2_db_t i
; /* temporary data block # */
1399 int index
; /* index into leaf entries */
1400 struct xfs_buf
*lbp
; /* leaf buffer */
1401 xfs_dir2_leaf_t
*leaf
; /* leaf structure */
1402 xfs_dir2_leaf_entry_t
*lep
; /* leaf entry */
1403 xfs_dir2_leaf_tail_t
*ltp
; /* leaf tail structure */
1404 xfs_mount_t
*mp
; /* filesystem mount point */
1405 int needlog
; /* need to log data header */
1406 int needscan
; /* need to rescan data frees */
1407 xfs_dir2_data_off_t oldbest
; /* old value of best free */
1408 xfs_trans_t
*tp
; /* transaction pointer */
1409 struct xfs_dir2_data_free
*bf
; /* bestfree table */
1410 struct xfs_dir2_leaf_entry
*ents
;
1411 struct xfs_dir3_icleaf_hdr leafhdr
;
1413 trace_xfs_dir2_leaf_removename(args
);
1416 * Lookup the leaf entry, get the leaf and data blocks read in.
1418 if ((error
= xfs_dir2_leaf_lookup_int(args
, &lbp
, &index
, &dbp
))) {
1426 xfs_dir3_data_check(dp
, dbp
);
1427 bf
= dp
->d_ops
->data_bestfree_p(hdr
);
1428 xfs_dir3_leaf_hdr_from_disk(&leafhdr
, leaf
);
1429 ents
= dp
->d_ops
->leaf_ents_p(leaf
);
1431 * Point to the leaf entry, use that to point to the data entry.
1434 db
= xfs_dir2_dataptr_to_db(mp
, be32_to_cpu(lep
->address
));
1435 dep
= (xfs_dir2_data_entry_t
*)
1436 ((char *)hdr
+ xfs_dir2_dataptr_to_off(mp
, be32_to_cpu(lep
->address
)));
1437 needscan
= needlog
= 0;
1438 oldbest
= be16_to_cpu(bf
[0].length
);
1439 ltp
= xfs_dir2_leaf_tail_p(mp
, leaf
);
1440 bestsp
= xfs_dir2_leaf_bests_p(ltp
);
1441 ASSERT(be16_to_cpu(bestsp
[db
]) == oldbest
);
1443 * Mark the former data entry unused.
1445 xfs_dir2_data_make_free(tp
, dp
, dbp
,
1446 (xfs_dir2_data_aoff_t
)((char *)dep
- (char *)hdr
),
1447 dp
->d_ops
->data_entsize(dep
->namelen
), &needlog
, &needscan
);
1449 * We just mark the leaf entry stale by putting a null in it.
1452 xfs_dir3_leaf_hdr_to_disk(leaf
, &leafhdr
);
1453 xfs_dir3_leaf_log_header(tp
, dp
, lbp
);
1455 lep
->address
= cpu_to_be32(XFS_DIR2_NULL_DATAPTR
);
1456 xfs_dir3_leaf_log_ents(tp
, dp
, lbp
, index
, index
);
1459 * Scan the freespace in the data block again if necessary,
1460 * log the data block header if necessary.
1463 xfs_dir2_data_freescan(dp
, hdr
, &needlog
);
1465 xfs_dir2_data_log_header(tp
, dp
, dbp
);
1467 * If the longest freespace in the data block has changed,
1468 * put the new value in the bests table and log that.
1470 if (be16_to_cpu(bf
[0].length
) != oldbest
) {
1471 bestsp
[db
] = bf
[0].length
;
1472 xfs_dir3_leaf_log_bests(tp
, lbp
, db
, db
);
1474 xfs_dir3_data_check(dp
, dbp
);
1476 * If the data block is now empty then get rid of the data block.
1478 if (be16_to_cpu(bf
[0].length
) ==
1479 mp
->m_dirblksize
- dp
->d_ops
->data_entry_offset()) {
1480 ASSERT(db
!= mp
->m_dirdatablk
);
1481 if ((error
= xfs_dir2_shrink_inode(args
, db
, dbp
))) {
1483 * Nope, can't get rid of it because it caused
1484 * allocation of a bmap btree block to do so.
1485 * Just go on, returning success, leaving the
1486 * empty block in place.
1488 if (error
== ENOSPC
&& args
->total
== 0)
1490 xfs_dir3_leaf_check(dp
, lbp
);
1495 * If this is the last data block then compact the
1496 * bests table by getting rid of entries.
1498 if (db
== be32_to_cpu(ltp
->bestcount
) - 1) {
1500 * Look for the last active entry (i).
1502 for (i
= db
- 1; i
> 0; i
--) {
1503 if (bestsp
[i
] != cpu_to_be16(NULLDATAOFF
))
1507 * Copy the table down so inactive entries at the
1510 memmove(&bestsp
[db
- i
], bestsp
,
1511 (be32_to_cpu(ltp
->bestcount
) - (db
- i
)) * sizeof(*bestsp
));
1512 be32_add_cpu(<p
->bestcount
, -(db
- i
));
1513 xfs_dir3_leaf_log_tail(tp
, lbp
);
1514 xfs_dir3_leaf_log_bests(tp
, lbp
, 0, be32_to_cpu(ltp
->bestcount
) - 1);
1516 bestsp
[db
] = cpu_to_be16(NULLDATAOFF
);
1519 * If the data block was not the first one, drop it.
1521 else if (db
!= mp
->m_dirdatablk
)
1524 xfs_dir3_leaf_check(dp
, lbp
);
1526 * See if we can convert to block form.
1528 return xfs_dir2_leaf_to_block(args
, lbp
, dbp
);
1532 * Replace the inode number in a leaf format directory entry.
1535 xfs_dir2_leaf_replace(
1536 xfs_da_args_t
*args
) /* operation arguments */
1538 struct xfs_buf
*dbp
; /* data block buffer */
1539 xfs_dir2_data_entry_t
*dep
; /* data block entry */
1540 xfs_inode_t
*dp
; /* incore directory inode */
1541 int error
; /* error return code */
1542 int index
; /* index of leaf entry */
1543 struct xfs_buf
*lbp
; /* leaf buffer */
1544 xfs_dir2_leaf_t
*leaf
; /* leaf structure */
1545 xfs_dir2_leaf_entry_t
*lep
; /* leaf entry */
1546 xfs_trans_t
*tp
; /* transaction pointer */
1547 struct xfs_dir2_leaf_entry
*ents
;
1549 trace_xfs_dir2_leaf_replace(args
);
1552 * Look up the entry.
1554 if ((error
= xfs_dir2_leaf_lookup_int(args
, &lbp
, &index
, &dbp
))) {
1559 ents
= dp
->d_ops
->leaf_ents_p(leaf
);
1561 * Point to the leaf entry, get data address from it.
1565 * Point to the data entry.
1567 dep
= (xfs_dir2_data_entry_t
*)
1568 ((char *)dbp
->b_addr
+
1569 xfs_dir2_dataptr_to_off(dp
->i_mount
, be32_to_cpu(lep
->address
)));
1570 ASSERT(args
->inumber
!= be64_to_cpu(dep
->inumber
));
1572 * Put the new inode number in, log it.
1574 dep
->inumber
= cpu_to_be64(args
->inumber
);
1575 dp
->d_ops
->data_put_ftype(dep
, args
->filetype
);
1577 xfs_dir2_data_log_entry(tp
, dp
, dbp
, dep
);
1578 xfs_dir3_leaf_check(dp
, lbp
);
1579 xfs_trans_brelse(tp
, lbp
);
1584 * Return index in the leaf block (lbp) which is either the first
1585 * one with this hash value, or if there are none, the insert point
1586 * for that hash value.
1588 int /* index value */
1589 xfs_dir2_leaf_search_hash(
1590 xfs_da_args_t
*args
, /* operation arguments */
1591 struct xfs_buf
*lbp
) /* leaf buffer */
1593 xfs_dahash_t hash
=0; /* hash from this entry */
1594 xfs_dahash_t hashwant
; /* hash value looking for */
1595 int high
; /* high leaf index */
1596 int low
; /* low leaf index */
1597 xfs_dir2_leaf_t
*leaf
; /* leaf structure */
1598 xfs_dir2_leaf_entry_t
*lep
; /* leaf entry */
1599 int mid
=0; /* current leaf index */
1600 struct xfs_dir2_leaf_entry
*ents
;
1601 struct xfs_dir3_icleaf_hdr leafhdr
;
1604 ents
= args
->dp
->d_ops
->leaf_ents_p(leaf
);
1605 xfs_dir3_leaf_hdr_from_disk(&leafhdr
, leaf
);
1608 * Note, the table cannot be empty, so we have to go through the loop.
1609 * Binary search the leaf entries looking for our hash value.
1611 for (lep
= ents
, low
= 0, high
= leafhdr
.count
- 1,
1612 hashwant
= args
->hashval
;
1614 mid
= (low
+ high
) >> 1;
1615 if ((hash
= be32_to_cpu(lep
[mid
].hashval
)) == hashwant
)
1617 if (hash
< hashwant
)
1623 * Found one, back up through all the equal hash values.
1625 if (hash
== hashwant
) {
1626 while (mid
> 0 && be32_to_cpu(lep
[mid
- 1].hashval
) == hashwant
) {
1631 * Need to point to an entry higher than ours.
1633 else if (hash
< hashwant
)
1639 * Trim off a trailing data block. We know it's empty since the leaf
1640 * freespace table says so.
1643 xfs_dir2_leaf_trim_data(
1644 xfs_da_args_t
*args
, /* operation arguments */
1645 struct xfs_buf
*lbp
, /* leaf buffer */
1646 xfs_dir2_db_t db
) /* data block number */
1648 __be16
*bestsp
; /* leaf bests table */
1649 struct xfs_buf
*dbp
; /* data block buffer */
1650 xfs_inode_t
*dp
; /* incore directory inode */
1651 int error
; /* error return value */
1652 xfs_dir2_leaf_t
*leaf
; /* leaf structure */
1653 xfs_dir2_leaf_tail_t
*ltp
; /* leaf tail structure */
1654 xfs_mount_t
*mp
; /* filesystem mount point */
1655 xfs_trans_t
*tp
; /* transaction pointer */
1661 * Read the offending data block. We need its buffer.
1663 error
= xfs_dir3_data_read(tp
, dp
, xfs_dir2_db_to_da(mp
, db
), -1, &dbp
);
1668 ltp
= xfs_dir2_leaf_tail_p(mp
, leaf
);
1672 struct xfs_dir2_data_hdr
*hdr
= dbp
->b_addr
;
1673 struct xfs_dir2_data_free
*bf
= dp
->d_ops
->data_bestfree_p(hdr
);
1675 ASSERT(hdr
->magic
== cpu_to_be32(XFS_DIR2_DATA_MAGIC
) ||
1676 hdr
->magic
== cpu_to_be32(XFS_DIR3_DATA_MAGIC
));
1677 ASSERT(be16_to_cpu(bf
[0].length
) ==
1678 mp
->m_dirblksize
- dp
->d_ops
->data_entry_offset());
1679 ASSERT(db
== be32_to_cpu(ltp
->bestcount
) - 1);
1684 * Get rid of the data block.
1686 if ((error
= xfs_dir2_shrink_inode(args
, db
, dbp
))) {
1687 ASSERT(error
!= ENOSPC
);
1688 xfs_trans_brelse(tp
, dbp
);
1692 * Eliminate the last bests entry from the table.
1694 bestsp
= xfs_dir2_leaf_bests_p(ltp
);
1695 be32_add_cpu(<p
->bestcount
, -1);
1696 memmove(&bestsp
[1], &bestsp
[0], be32_to_cpu(ltp
->bestcount
) * sizeof(*bestsp
));
1697 xfs_dir3_leaf_log_tail(tp
, lbp
);
1698 xfs_dir3_leaf_log_bests(tp
, lbp
, 0, be32_to_cpu(ltp
->bestcount
) - 1);
1702 static inline size_t
1704 struct xfs_dir3_icleaf_hdr
*hdr
,
1710 entries
= hdr
->count
- hdr
->stale
;
1711 if (hdr
->magic
== XFS_DIR2_LEAF1_MAGIC
||
1712 hdr
->magic
== XFS_DIR2_LEAFN_MAGIC
)
1713 hdrsize
= sizeof(struct xfs_dir2_leaf_hdr
);
1715 hdrsize
= sizeof(struct xfs_dir3_leaf_hdr
);
1717 return hdrsize
+ entries
* sizeof(xfs_dir2_leaf_entry_t
)
1718 + counts
* sizeof(xfs_dir2_data_off_t
)
1719 + sizeof(xfs_dir2_leaf_tail_t
);
1723 * Convert node form directory to leaf form directory.
1724 * The root of the node form dir needs to already be a LEAFN block.
1725 * Just return if we can't do anything.
1728 xfs_dir2_node_to_leaf(
1729 xfs_da_state_t
*state
) /* directory operation state */
1731 xfs_da_args_t
*args
; /* operation arguments */
1732 xfs_inode_t
*dp
; /* incore directory inode */
1733 int error
; /* error return code */
1734 struct xfs_buf
*fbp
; /* buffer for freespace block */
1735 xfs_fileoff_t fo
; /* freespace file offset */
1736 xfs_dir2_free_t
*free
; /* freespace structure */
1737 struct xfs_buf
*lbp
; /* buffer for leaf block */
1738 xfs_dir2_leaf_tail_t
*ltp
; /* tail of leaf structure */
1739 xfs_dir2_leaf_t
*leaf
; /* leaf structure */
1740 xfs_mount_t
*mp
; /* filesystem mount point */
1741 int rval
; /* successful free trim? */
1742 xfs_trans_t
*tp
; /* transaction pointer */
1743 struct xfs_dir3_icleaf_hdr leafhdr
;
1744 struct xfs_dir3_icfree_hdr freehdr
;
1747 * There's more than a leaf level in the btree, so there must
1748 * be multiple leafn blocks. Give up.
1750 if (state
->path
.active
> 1)
1754 trace_xfs_dir2_node_to_leaf(args
);
1760 * Get the last offset in the file.
1762 if ((error
= xfs_bmap_last_offset(tp
, dp
, &fo
, XFS_DATA_FORK
))) {
1765 fo
-= mp
->m_dirblkfsbs
;
1767 * If there are freespace blocks other than the first one,
1768 * take this opportunity to remove trailing empty freespace blocks
1769 * that may have been left behind during no-space-reservation
1772 while (fo
> mp
->m_dirfreeblk
) {
1773 if ((error
= xfs_dir2_node_trim_free(args
, fo
, &rval
))) {
1777 fo
-= mp
->m_dirblkfsbs
;
1782 * Now find the block just before the freespace block.
1784 if ((error
= xfs_bmap_last_before(tp
, dp
, &fo
, XFS_DATA_FORK
))) {
1788 * If it's not the single leaf block, give up.
1790 if (XFS_FSB_TO_B(mp
, fo
) > XFS_DIR2_LEAF_OFFSET
+ mp
->m_dirblksize
)
1792 lbp
= state
->path
.blk
[0].bp
;
1794 xfs_dir3_leaf_hdr_from_disk(&leafhdr
, leaf
);
1796 ASSERT(leafhdr
.magic
== XFS_DIR2_LEAFN_MAGIC
||
1797 leafhdr
.magic
== XFS_DIR3_LEAFN_MAGIC
);
1800 * Read the freespace block.
1802 error
= xfs_dir2_free_read(tp
, dp
, mp
->m_dirfreeblk
, &fbp
);
1806 xfs_dir3_free_hdr_from_disk(&freehdr
, free
);
1808 ASSERT(!freehdr
.firstdb
);
1811 * Now see if the leafn and free data will fit in a leaf1.
1812 * If not, release the buffer and give up.
1814 if (xfs_dir3_leaf_size(&leafhdr
, freehdr
.nvalid
) > mp
->m_dirblksize
) {
1815 xfs_trans_brelse(tp
, fbp
);
1820 * If the leaf has any stale entries in it, compress them out.
1823 xfs_dir3_leaf_compact(args
, &leafhdr
, lbp
);
1825 lbp
->b_ops
= &xfs_dir3_leaf1_buf_ops
;
1826 xfs_trans_buf_set_type(tp
, lbp
, XFS_BLFT_DIR_LEAF1_BUF
);
1827 leafhdr
.magic
= (leafhdr
.magic
== XFS_DIR2_LEAFN_MAGIC
)
1828 ? XFS_DIR2_LEAF1_MAGIC
1829 : XFS_DIR3_LEAF1_MAGIC
;
1832 * Set up the leaf tail from the freespace block.
1834 ltp
= xfs_dir2_leaf_tail_p(mp
, leaf
);
1835 ltp
->bestcount
= cpu_to_be32(freehdr
.nvalid
);
1838 * Set up the leaf bests table.
1840 memcpy(xfs_dir2_leaf_bests_p(ltp
), xfs_dir3_free_bests_p(mp
, free
),
1841 freehdr
.nvalid
* sizeof(xfs_dir2_data_off_t
));
1843 xfs_dir3_leaf_hdr_to_disk(leaf
, &leafhdr
);
1844 xfs_dir3_leaf_log_header(tp
, dp
, lbp
);
1845 xfs_dir3_leaf_log_bests(tp
, lbp
, 0, be32_to_cpu(ltp
->bestcount
) - 1);
1846 xfs_dir3_leaf_log_tail(tp
, lbp
);
1847 xfs_dir3_leaf_check(dp
, lbp
);
1850 * Get rid of the freespace block.
1852 error
= xfs_dir2_shrink_inode(args
, XFS_DIR2_FREE_FIRSTDB(mp
), fbp
);
1855 * This can't fail here because it can only happen when
1856 * punching out the middle of an extent, and this is an
1859 ASSERT(error
!= ENOSPC
);
1864 * Now see if we can convert the single-leaf directory
1865 * down to a block form directory.
1866 * This routine always kills the dabuf for the leaf, so
1867 * eliminate it from the path.
1869 error
= xfs_dir2_leaf_to_block(args
, lbp
, NULL
);
1870 state
->path
.blk
[0].bp
= NULL
;