2 * Copyright (c) 2000-2003,2005 Silicon Graphics, Inc.
5 * This program is free software; you can redistribute it and/or
6 * modify it under the terms of the GNU General Public License as
7 * published by the Free Software Foundation.
9 * This program is distributed in the hope that it would be useful,
10 * but WITHOUT ANY WARRANTY; without even the implied warranty of
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12 * GNU General Public License for more details.
14 * You should have received a copy of the GNU General Public License
15 * along with this program; if not, write the Free Software Foundation,
16 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
20 #include "xfs_types.h"
23 #include "xfs_trans.h"
26 #include "xfs_mount.h"
27 #include "xfs_da_btree.h"
28 #include "xfs_bmap_btree.h"
29 #include "xfs_dinode.h"
30 #include "xfs_inode.h"
32 #include "xfs_dir2_format.h"
33 #include "xfs_dir2_priv.h"
34 #include "xfs_error.h"
35 #include "xfs_trace.h"
38 * Local function declarations.
41 static void xfs_dir2_leaf_check(struct xfs_inode
*dp
, struct xfs_buf
*bp
);
43 #define xfs_dir2_leaf_check(dp, bp)
45 static int xfs_dir2_leaf_lookup_int(xfs_da_args_t
*args
, struct xfs_buf
**lbpp
,
46 int *indexp
, struct xfs_buf
**dbpp
);
47 static void xfs_dir2_leaf_log_bests(struct xfs_trans
*tp
, struct xfs_buf
*bp
,
49 static void xfs_dir2_leaf_log_tail(struct xfs_trans
*tp
, struct xfs_buf
*bp
);
56 struct xfs_mount
*mp
= bp
->b_target
->bt_mount
;
57 struct xfs_dir2_leaf_hdr
*hdr
= bp
->b_addr
;
60 block_ok
= hdr
->info
.magic
== magic
;
62 XFS_CORRUPTION_ERROR(__func__
, XFS_ERRLEVEL_LOW
, mp
, hdr
);
63 xfs_buf_ioerror(bp
, EFSCORRUPTED
);
71 xfs_dir2_leaf1_verify(
74 xfs_dir2_leaf_verify(bp
, cpu_to_be16(XFS_DIR2_LEAF1_MAGIC
));
78 xfs_dir2_leafn_verify(
81 xfs_dir2_leaf_verify(bp
, cpu_to_be16(XFS_DIR2_LEAFN_MAGIC
));
89 xfs_daddr_t mappedbno
,
92 return xfs_da_read_buf(tp
, dp
, fbno
, mappedbno
, bpp
,
93 XFS_DATA_FORK
, xfs_dir2_leaf1_verify
);
101 xfs_daddr_t mappedbno
,
102 struct xfs_buf
**bpp
)
104 return xfs_da_read_buf(tp
, dp
, fbno
, mappedbno
, bpp
,
105 XFS_DATA_FORK
, xfs_dir2_leafn_verify
);
109 * Convert a block form directory to a leaf form directory.
112 xfs_dir2_block_to_leaf(
113 xfs_da_args_t
*args
, /* operation arguments */
114 struct xfs_buf
*dbp
) /* input block's buffer */
116 __be16
*bestsp
; /* leaf's bestsp entries */
117 xfs_dablk_t blkno
; /* leaf block's bno */
118 xfs_dir2_data_hdr_t
*hdr
; /* block header */
119 xfs_dir2_leaf_entry_t
*blp
; /* block's leaf entries */
120 xfs_dir2_block_tail_t
*btp
; /* block's tail */
121 xfs_inode_t
*dp
; /* incore directory inode */
122 int error
; /* error return code */
123 struct xfs_buf
*lbp
; /* leaf block's buffer */
124 xfs_dir2_db_t ldb
; /* leaf block's bno */
125 xfs_dir2_leaf_t
*leaf
; /* leaf structure */
126 xfs_dir2_leaf_tail_t
*ltp
; /* leaf's tail */
127 xfs_mount_t
*mp
; /* filesystem mount point */
128 int needlog
; /* need to log block header */
129 int needscan
; /* need to rescan bestfree */
130 xfs_trans_t
*tp
; /* transaction pointer */
132 trace_xfs_dir2_block_to_leaf(args
);
138 * Add the leaf block to the inode.
139 * This interface will only put blocks in the leaf/node range.
140 * Since that's empty now, we'll get the root (block 0 in range).
142 if ((error
= xfs_da_grow_inode(args
, &blkno
))) {
145 ldb
= xfs_dir2_da_to_db(mp
, blkno
);
146 ASSERT(ldb
== XFS_DIR2_LEAF_FIRSTDB(mp
));
148 * Initialize the leaf block, get a buffer for it.
150 if ((error
= xfs_dir2_leaf_init(args
, ldb
, &lbp
, XFS_DIR2_LEAF1_MAGIC
))) {
156 xfs_dir2_data_check(dp
, dbp
);
157 btp
= xfs_dir2_block_tail_p(mp
, hdr
);
158 blp
= xfs_dir2_block_leaf_p(btp
);
160 * Set the counts in the leaf header.
162 leaf
->hdr
.count
= cpu_to_be16(be32_to_cpu(btp
->count
));
163 leaf
->hdr
.stale
= cpu_to_be16(be32_to_cpu(btp
->stale
));
165 * Could compact these but I think we always do the conversion
166 * after squeezing out stale entries.
168 memcpy(leaf
->ents
, blp
, be32_to_cpu(btp
->count
) * sizeof(xfs_dir2_leaf_entry_t
));
169 xfs_dir2_leaf_log_ents(tp
, lbp
, 0, be16_to_cpu(leaf
->hdr
.count
) - 1);
173 * Make the space formerly occupied by the leaf entries and block
176 xfs_dir2_data_make_free(tp
, dbp
,
177 (xfs_dir2_data_aoff_t
)((char *)blp
- (char *)hdr
),
178 (xfs_dir2_data_aoff_t
)((char *)hdr
+ mp
->m_dirblksize
-
180 &needlog
, &needscan
);
182 * Fix up the block header, make it a data block.
184 hdr
->magic
= cpu_to_be32(XFS_DIR2_DATA_MAGIC
);
186 xfs_dir2_data_freescan(mp
, hdr
, &needlog
);
188 * Set up leaf tail and bests table.
190 ltp
= xfs_dir2_leaf_tail_p(mp
, leaf
);
191 ltp
->bestcount
= cpu_to_be32(1);
192 bestsp
= xfs_dir2_leaf_bests_p(ltp
);
193 bestsp
[0] = hdr
->bestfree
[0].length
;
195 * Log the data header and leaf bests table.
198 xfs_dir2_data_log_header(tp
, dbp
);
199 xfs_dir2_leaf_check(dp
, lbp
);
200 xfs_dir2_data_check(dp
, dbp
);
201 xfs_dir2_leaf_log_bests(tp
, lbp
, 0, 0);
206 xfs_dir2_leaf_find_stale(
207 struct xfs_dir2_leaf
*leaf
,
213 * Find the first stale entry before our index, if any.
215 for (*lowstale
= index
- 1; *lowstale
>= 0; --*lowstale
) {
216 if (leaf
->ents
[*lowstale
].address
==
217 cpu_to_be32(XFS_DIR2_NULL_DATAPTR
))
222 * Find the first stale entry at or after our index, if any.
223 * Stop if the result would require moving more entries than using
226 for (*highstale
= index
;
227 *highstale
< be16_to_cpu(leaf
->hdr
.count
);
229 if (leaf
->ents
[*highstale
].address
==
230 cpu_to_be32(XFS_DIR2_NULL_DATAPTR
))
232 if (*lowstale
>= 0 && index
- *lowstale
<= *highstale
- index
)
237 struct xfs_dir2_leaf_entry
*
238 xfs_dir2_leaf_find_entry(
239 xfs_dir2_leaf_t
*leaf
, /* leaf structure */
240 int index
, /* leaf table position */
241 int compact
, /* need to compact leaves */
242 int lowstale
, /* index of prev stale leaf */
243 int highstale
, /* index of next stale leaf */
244 int *lfloglow
, /* low leaf logging index */
245 int *lfloghigh
) /* high leaf logging index */
247 if (!leaf
->hdr
.stale
) {
248 xfs_dir2_leaf_entry_t
*lep
; /* leaf entry table pointer */
251 * Now we need to make room to insert the leaf entry.
253 * If there are no stale entries, just insert a hole at index.
255 lep
= &leaf
->ents
[index
];
256 if (index
< be16_to_cpu(leaf
->hdr
.count
))
257 memmove(lep
+ 1, lep
,
258 (be16_to_cpu(leaf
->hdr
.count
) - index
) *
262 * Record low and high logging indices for the leaf.
265 *lfloghigh
= be16_to_cpu(leaf
->hdr
.count
);
266 be16_add_cpu(&leaf
->hdr
.count
, 1);
271 * There are stale entries.
273 * We will use one of them for the new entry. It's probably not at
274 * the right location, so we'll have to shift some up or down first.
276 * If we didn't compact before, we need to find the nearest stale
277 * entries before and after our insertion point.
280 xfs_dir2_leaf_find_stale(leaf
, index
, &lowstale
, &highstale
);
283 * If the low one is better, use it.
286 (highstale
== be16_to_cpu(leaf
->hdr
.count
) ||
287 index
- lowstale
- 1 < highstale
- index
)) {
288 ASSERT(index
- lowstale
- 1 >= 0);
289 ASSERT(leaf
->ents
[lowstale
].address
==
290 cpu_to_be32(XFS_DIR2_NULL_DATAPTR
));
293 * Copy entries up to cover the stale entry and make room
296 if (index
- lowstale
- 1 > 0) {
297 memmove(&leaf
->ents
[lowstale
],
298 &leaf
->ents
[lowstale
+ 1],
299 (index
- lowstale
- 1) *
300 sizeof(xfs_dir2_leaf_entry_t
));
302 *lfloglow
= MIN(lowstale
, *lfloglow
);
303 *lfloghigh
= MAX(index
- 1, *lfloghigh
);
304 be16_add_cpu(&leaf
->hdr
.stale
, -1);
305 return &leaf
->ents
[index
- 1];
309 * The high one is better, so use that one.
311 ASSERT(highstale
- index
>= 0);
312 ASSERT(leaf
->ents
[highstale
].address
==
313 cpu_to_be32(XFS_DIR2_NULL_DATAPTR
));
316 * Copy entries down to cover the stale entry and make room for the
319 if (highstale
- index
> 0) {
320 memmove(&leaf
->ents
[index
+ 1],
322 (highstale
- index
) * sizeof(xfs_dir2_leaf_entry_t
));
324 *lfloglow
= MIN(index
, *lfloglow
);
325 *lfloghigh
= MAX(highstale
, *lfloghigh
);
326 be16_add_cpu(&leaf
->hdr
.stale
, -1);
327 return &leaf
->ents
[index
];
331 * Add an entry to a leaf form directory.
334 xfs_dir2_leaf_addname(
335 xfs_da_args_t
*args
) /* operation arguments */
337 __be16
*bestsp
; /* freespace table in leaf */
338 int compact
; /* need to compact leaves */
339 xfs_dir2_data_hdr_t
*hdr
; /* data block header */
340 struct xfs_buf
*dbp
; /* data block buffer */
341 xfs_dir2_data_entry_t
*dep
; /* data block entry */
342 xfs_inode_t
*dp
; /* incore directory inode */
343 xfs_dir2_data_unused_t
*dup
; /* data unused entry */
344 int error
; /* error return value */
345 int grown
; /* allocated new data block */
346 int highstale
; /* index of next stale leaf */
347 int i
; /* temporary, index */
348 int index
; /* leaf table position */
349 struct xfs_buf
*lbp
; /* leaf's buffer */
350 xfs_dir2_leaf_t
*leaf
; /* leaf structure */
351 int length
; /* length of new entry */
352 xfs_dir2_leaf_entry_t
*lep
; /* leaf entry table pointer */
353 int lfloglow
; /* low leaf logging index */
354 int lfloghigh
; /* high leaf logging index */
355 int lowstale
; /* index of prev stale leaf */
356 xfs_dir2_leaf_tail_t
*ltp
; /* leaf tail pointer */
357 xfs_mount_t
*mp
; /* filesystem mount point */
358 int needbytes
; /* leaf block bytes needed */
359 int needlog
; /* need to log data header */
360 int needscan
; /* need to rescan data free */
361 __be16
*tagp
; /* end of data entry */
362 xfs_trans_t
*tp
; /* transaction pointer */
363 xfs_dir2_db_t use_block
; /* data block number */
365 trace_xfs_dir2_leaf_addname(args
);
371 error
= xfs_dir2_leaf_read(tp
, dp
, mp
->m_dirleafblk
, -1, &lbp
);
376 * Look up the entry by hash value and name.
377 * We know it's not there, our caller has already done a lookup.
378 * So the index is of the entry to insert in front of.
379 * But if there are dup hash values the index is of the first of those.
381 index
= xfs_dir2_leaf_search_hash(args
, lbp
);
383 ltp
= xfs_dir2_leaf_tail_p(mp
, leaf
);
384 bestsp
= xfs_dir2_leaf_bests_p(ltp
);
385 length
= xfs_dir2_data_entsize(args
->namelen
);
387 * See if there are any entries with the same hash value
388 * and space in their block for the new entry.
389 * This is good because it puts multiple same-hash value entries
390 * in a data block, improving the lookup of those entries.
392 for (use_block
= -1, lep
= &leaf
->ents
[index
];
393 index
< be16_to_cpu(leaf
->hdr
.count
) && be32_to_cpu(lep
->hashval
) == args
->hashval
;
395 if (be32_to_cpu(lep
->address
) == XFS_DIR2_NULL_DATAPTR
)
397 i
= xfs_dir2_dataptr_to_db(mp
, be32_to_cpu(lep
->address
));
398 ASSERT(i
< be32_to_cpu(ltp
->bestcount
));
399 ASSERT(bestsp
[i
] != cpu_to_be16(NULLDATAOFF
));
400 if (be16_to_cpu(bestsp
[i
]) >= length
) {
406 * Didn't find a block yet, linear search all the data blocks.
408 if (use_block
== -1) {
409 for (i
= 0; i
< be32_to_cpu(ltp
->bestcount
); i
++) {
411 * Remember a block we see that's missing.
413 if (bestsp
[i
] == cpu_to_be16(NULLDATAOFF
) &&
416 else if (be16_to_cpu(bestsp
[i
]) >= length
) {
423 * How many bytes do we need in the leaf block?
426 if (!leaf
->hdr
.stale
)
427 needbytes
+= sizeof(xfs_dir2_leaf_entry_t
);
429 needbytes
+= sizeof(xfs_dir2_data_off_t
);
432 * Now kill use_block if it refers to a missing block, so we
433 * can use it as an indication of allocation needed.
435 if (use_block
!= -1 && bestsp
[use_block
] == cpu_to_be16(NULLDATAOFF
))
438 * If we don't have enough free bytes but we can make enough
439 * by compacting out stale entries, we'll do that.
441 if ((char *)bestsp
- (char *)&leaf
->ents
[be16_to_cpu(leaf
->hdr
.count
)] <
442 needbytes
&& be16_to_cpu(leaf
->hdr
.stale
) > 1) {
446 * Otherwise if we don't have enough free bytes we need to
447 * convert to node form.
449 else if ((char *)bestsp
- (char *)&leaf
->ents
[be16_to_cpu(
450 leaf
->hdr
.count
)] < needbytes
) {
452 * Just checking or no space reservation, give up.
454 if ((args
->op_flags
& XFS_DA_OP_JUSTCHECK
) ||
456 xfs_trans_brelse(tp
, lbp
);
457 return XFS_ERROR(ENOSPC
);
460 * Convert to node form.
462 error
= xfs_dir2_leaf_to_node(args
, lbp
);
466 * Then add the new entry.
468 return xfs_dir2_node_addname(args
);
471 * Otherwise it will fit without compaction.
476 * If just checking, then it will fit unless we needed to allocate
479 if (args
->op_flags
& XFS_DA_OP_JUSTCHECK
) {
480 xfs_trans_brelse(tp
, lbp
);
481 return use_block
== -1 ? XFS_ERROR(ENOSPC
) : 0;
484 * If no allocations are allowed, return now before we've
487 if (args
->total
== 0 && use_block
== -1) {
488 xfs_trans_brelse(tp
, lbp
);
489 return XFS_ERROR(ENOSPC
);
492 * Need to compact the leaf entries, removing stale ones.
493 * Leave one stale entry behind - the one closest to our
494 * insertion index - and we'll shift that one to our insertion
498 xfs_dir2_leaf_compact_x1(lbp
, &index
, &lowstale
, &highstale
,
499 &lfloglow
, &lfloghigh
);
502 * There are stale entries, so we'll need log-low and log-high
503 * impossibly bad values later.
505 else if (be16_to_cpu(leaf
->hdr
.stale
)) {
506 lfloglow
= be16_to_cpu(leaf
->hdr
.count
);
510 * If there was no data block space found, we need to allocate
513 if (use_block
== -1) {
515 * Add the new data block.
517 if ((error
= xfs_dir2_grow_inode(args
, XFS_DIR2_DATA_SPACE
,
519 xfs_trans_brelse(tp
, lbp
);
523 * Initialize the block.
525 if ((error
= xfs_dir2_data_init(args
, use_block
, &dbp
))) {
526 xfs_trans_brelse(tp
, lbp
);
530 * If we're adding a new data block on the end we need to
531 * extend the bests table. Copy it up one entry.
533 if (use_block
>= be32_to_cpu(ltp
->bestcount
)) {
535 memmove(&bestsp
[0], &bestsp
[1],
536 be32_to_cpu(ltp
->bestcount
) * sizeof(bestsp
[0]));
537 be32_add_cpu(<p
->bestcount
, 1);
538 xfs_dir2_leaf_log_tail(tp
, lbp
);
539 xfs_dir2_leaf_log_bests(tp
, lbp
, 0, be32_to_cpu(ltp
->bestcount
) - 1);
542 * If we're filling in a previously empty block just log it.
545 xfs_dir2_leaf_log_bests(tp
, lbp
, use_block
, use_block
);
547 bestsp
[use_block
] = hdr
->bestfree
[0].length
;
551 * Already had space in some data block.
552 * Just read that one in.
554 error
= xfs_dir2_data_read(tp
, dp
,
555 xfs_dir2_db_to_da(mp
, use_block
),
558 xfs_trans_brelse(tp
, lbp
);
565 * Point to the biggest freespace in our data block.
567 dup
= (xfs_dir2_data_unused_t
*)
568 ((char *)hdr
+ be16_to_cpu(hdr
->bestfree
[0].offset
));
569 ASSERT(be16_to_cpu(dup
->length
) >= length
);
570 needscan
= needlog
= 0;
572 * Mark the initial part of our freespace in use for the new entry.
574 xfs_dir2_data_use_free(tp
, dbp
, dup
,
575 (xfs_dir2_data_aoff_t
)((char *)dup
- (char *)hdr
), length
,
576 &needlog
, &needscan
);
578 * Initialize our new entry (at last).
580 dep
= (xfs_dir2_data_entry_t
*)dup
;
581 dep
->inumber
= cpu_to_be64(args
->inumber
);
582 dep
->namelen
= args
->namelen
;
583 memcpy(dep
->name
, args
->name
, dep
->namelen
);
584 tagp
= xfs_dir2_data_entry_tag_p(dep
);
585 *tagp
= cpu_to_be16((char *)dep
- (char *)hdr
);
587 * Need to scan fix up the bestfree table.
590 xfs_dir2_data_freescan(mp
, hdr
, &needlog
);
592 * Need to log the data block's header.
595 xfs_dir2_data_log_header(tp
, dbp
);
596 xfs_dir2_data_log_entry(tp
, dbp
, dep
);
598 * If the bests table needs to be changed, do it.
599 * Log the change unless we've already done that.
601 if (be16_to_cpu(bestsp
[use_block
]) != be16_to_cpu(hdr
->bestfree
[0].length
)) {
602 bestsp
[use_block
] = hdr
->bestfree
[0].length
;
604 xfs_dir2_leaf_log_bests(tp
, lbp
, use_block
, use_block
);
607 lep
= xfs_dir2_leaf_find_entry(leaf
, index
, compact
, lowstale
,
608 highstale
, &lfloglow
, &lfloghigh
);
611 * Fill in the new leaf entry.
613 lep
->hashval
= cpu_to_be32(args
->hashval
);
614 lep
->address
= cpu_to_be32(xfs_dir2_db_off_to_dataptr(mp
, use_block
,
615 be16_to_cpu(*tagp
)));
617 * Log the leaf fields and give up the buffers.
619 xfs_dir2_leaf_log_header(tp
, lbp
);
620 xfs_dir2_leaf_log_ents(tp
, lbp
, lfloglow
, lfloghigh
);
621 xfs_dir2_leaf_check(dp
, lbp
);
622 xfs_dir2_data_check(dp
, dbp
);
628 * Check the internal consistency of a leaf1 block.
629 * Pop an assert if something is wrong.
633 struct xfs_inode
*dp
, /* incore directory inode */
634 struct xfs_buf
*bp
) /* leaf's buffer */
636 int i
; /* leaf index */
637 xfs_dir2_leaf_t
*leaf
; /* leaf structure */
638 xfs_dir2_leaf_tail_t
*ltp
; /* leaf tail pointer */
639 xfs_mount_t
*mp
; /* filesystem mount point */
640 int stale
; /* count of stale leaves */
644 ASSERT(leaf
->hdr
.info
.magic
== cpu_to_be16(XFS_DIR2_LEAF1_MAGIC
));
646 * This value is not restrictive enough.
647 * Should factor in the size of the bests table as well.
648 * We can deduce a value for that from di_size.
650 ASSERT(be16_to_cpu(leaf
->hdr
.count
) <= xfs_dir2_max_leaf_ents(mp
));
651 ltp
= xfs_dir2_leaf_tail_p(mp
, leaf
);
653 * Leaves and bests don't overlap.
655 ASSERT((char *)&leaf
->ents
[be16_to_cpu(leaf
->hdr
.count
)] <=
656 (char *)xfs_dir2_leaf_bests_p(ltp
));
658 * Check hash value order, count stale entries.
660 for (i
= stale
= 0; i
< be16_to_cpu(leaf
->hdr
.count
); i
++) {
661 if (i
+ 1 < be16_to_cpu(leaf
->hdr
.count
))
662 ASSERT(be32_to_cpu(leaf
->ents
[i
].hashval
) <=
663 be32_to_cpu(leaf
->ents
[i
+ 1].hashval
));
664 if (leaf
->ents
[i
].address
== cpu_to_be32(XFS_DIR2_NULL_DATAPTR
))
667 ASSERT(be16_to_cpu(leaf
->hdr
.stale
) == stale
);
672 * Compact out any stale entries in the leaf.
673 * Log the header and changed leaf entries, if any.
676 xfs_dir2_leaf_compact(
677 xfs_da_args_t
*args
, /* operation arguments */
678 struct xfs_buf
*bp
) /* leaf buffer */
680 int from
; /* source leaf index */
681 xfs_dir2_leaf_t
*leaf
; /* leaf structure */
682 int loglow
; /* first leaf entry to log */
683 int to
; /* target leaf index */
686 if (!leaf
->hdr
.stale
) {
690 * Compress out the stale entries in place.
692 for (from
= to
= 0, loglow
= -1; from
< be16_to_cpu(leaf
->hdr
.count
); from
++) {
693 if (leaf
->ents
[from
].address
==
694 cpu_to_be32(XFS_DIR2_NULL_DATAPTR
))
697 * Only actually copy the entries that are different.
702 leaf
->ents
[to
] = leaf
->ents
[from
];
707 * Update and log the header, log the leaf entries.
709 ASSERT(be16_to_cpu(leaf
->hdr
.stale
) == from
- to
);
710 be16_add_cpu(&leaf
->hdr
.count
, -(be16_to_cpu(leaf
->hdr
.stale
)));
712 xfs_dir2_leaf_log_header(args
->trans
, bp
);
714 xfs_dir2_leaf_log_ents(args
->trans
, bp
, loglow
, to
- 1);
718 * Compact the leaf entries, removing stale ones.
719 * Leave one stale entry behind - the one closest to our
720 * insertion index - and the caller will shift that one to our insertion
722 * Return new insertion index, where the remaining stale entry is,
723 * and leaf logging indices.
726 xfs_dir2_leaf_compact_x1(
727 struct xfs_buf
*bp
, /* leaf buffer */
728 int *indexp
, /* insertion index */
729 int *lowstalep
, /* out: stale entry before us */
730 int *highstalep
, /* out: stale entry after us */
731 int *lowlogp
, /* out: low log index */
732 int *highlogp
) /* out: high log index */
734 int from
; /* source copy index */
735 int highstale
; /* stale entry at/after index */
736 int index
; /* insertion index */
737 int keepstale
; /* source index of kept stale */
738 xfs_dir2_leaf_t
*leaf
; /* leaf structure */
739 int lowstale
; /* stale entry before index */
740 int newindex
=0; /* new insertion index */
741 int to
; /* destination copy index */
744 ASSERT(be16_to_cpu(leaf
->hdr
.stale
) > 1);
747 xfs_dir2_leaf_find_stale(leaf
, index
, &lowstale
, &highstale
);
750 * Pick the better of lowstale and highstale.
753 (highstale
== be16_to_cpu(leaf
->hdr
.count
) ||
754 index
- lowstale
<= highstale
- index
))
755 keepstale
= lowstale
;
757 keepstale
= highstale
;
759 * Copy the entries in place, removing all the stale entries
762 for (from
= to
= 0; from
< be16_to_cpu(leaf
->hdr
.count
); from
++) {
764 * Notice the new value of index.
768 if (from
!= keepstale
&&
769 leaf
->ents
[from
].address
==
770 cpu_to_be32(XFS_DIR2_NULL_DATAPTR
)) {
776 * Record the new keepstale value for the insertion.
778 if (from
== keepstale
)
779 lowstale
= highstale
= to
;
781 * Copy only the entries that have moved.
784 leaf
->ents
[to
] = leaf
->ents
[from
];
789 * If the insertion point was past the last entry,
790 * set the new insertion point accordingly.
796 * Adjust the leaf header values.
798 be16_add_cpu(&leaf
->hdr
.count
, -(from
- to
));
799 leaf
->hdr
.stale
= cpu_to_be16(1);
801 * Remember the low/high stale value only in the "right"
804 if (lowstale
>= newindex
)
807 highstale
= be16_to_cpu(leaf
->hdr
.count
);
808 *highlogp
= be16_to_cpu(leaf
->hdr
.count
) - 1;
809 *lowstalep
= lowstale
;
810 *highstalep
= highstale
;
813 struct xfs_dir2_leaf_map_info
{
814 xfs_extlen_t map_blocks
; /* number of fsbs in map */
815 xfs_dablk_t map_off
; /* last mapped file offset */
816 int map_size
; /* total entries in *map */
817 int map_valid
; /* valid entries in *map */
818 int nmap
; /* mappings to ask xfs_bmapi */
819 xfs_dir2_db_t curdb
; /* db for current block */
820 int ra_current
; /* number of read-ahead blks */
821 int ra_index
; /* *map index for read-ahead */
822 int ra_offset
; /* map entry offset for ra */
823 int ra_want
; /* readahead count wanted */
824 struct xfs_bmbt_irec map
[]; /* map vector for blocks */
828 xfs_dir2_leaf_readbuf(
829 struct xfs_inode
*dp
,
831 struct xfs_dir2_leaf_map_info
*mip
,
832 xfs_dir2_off_t
*curoff
,
833 struct xfs_buf
**bpp
)
835 struct xfs_mount
*mp
= dp
->i_mount
;
836 struct xfs_buf
*bp
= *bpp
;
837 struct xfs_bmbt_irec
*map
= mip
->map
;
844 * If we have a buffer, we need to release it and
845 * take it out of the mapping.
849 xfs_trans_brelse(NULL
, bp
);
851 mip
->map_blocks
-= mp
->m_dirblkfsbs
;
853 * Loop to get rid of the extents for the
856 for (i
= mp
->m_dirblkfsbs
; i
> 0; ) {
857 j
= min_t(int, map
->br_blockcount
, i
);
858 map
->br_blockcount
-= j
;
859 map
->br_startblock
+= j
;
860 map
->br_startoff
+= j
;
862 * If mapping is done, pitch it from
865 if (!map
->br_blockcount
&& --mip
->map_valid
)
866 memmove(&map
[0], &map
[1],
867 sizeof(map
[0]) * mip
->map_valid
);
873 * Recalculate the readahead blocks wanted.
875 mip
->ra_want
= howmany(bufsize
+ mp
->m_dirblksize
,
876 mp
->m_sb
.sb_blocksize
) - 1;
877 ASSERT(mip
->ra_want
>= 0);
880 * If we don't have as many as we want, and we haven't
881 * run out of data blocks, get some more mappings.
883 if (1 + mip
->ra_want
> mip
->map_blocks
&&
884 mip
->map_off
< xfs_dir2_byte_to_da(mp
, XFS_DIR2_LEAF_OFFSET
)) {
886 * Get more bmaps, fill in after the ones
887 * we already have in the table.
889 mip
->nmap
= mip
->map_size
- mip
->map_valid
;
890 error
= xfs_bmapi_read(dp
, mip
->map_off
,
891 xfs_dir2_byte_to_da(mp
, XFS_DIR2_LEAF_OFFSET
) -
893 &map
[mip
->map_valid
], &mip
->nmap
, 0);
896 * Don't know if we should ignore this or try to return an
897 * error. The trouble with returning errors is that readdir
898 * will just stop without actually passing the error through.
904 * If we got all the mappings we asked for, set the final map
905 * offset based on the last bmap value received. Otherwise,
906 * we've reached the end.
908 if (mip
->nmap
== mip
->map_size
- mip
->map_valid
) {
909 i
= mip
->map_valid
+ mip
->nmap
- 1;
910 mip
->map_off
= map
[i
].br_startoff
+ map
[i
].br_blockcount
;
912 mip
->map_off
= xfs_dir2_byte_to_da(mp
,
913 XFS_DIR2_LEAF_OFFSET
);
916 * Look for holes in the mapping, and eliminate them. Count up
919 for (i
= mip
->map_valid
; i
< mip
->map_valid
+ mip
->nmap
; ) {
920 if (map
[i
].br_startblock
== HOLESTARTBLOCK
) {
922 length
= mip
->map_valid
+ mip
->nmap
- i
;
924 memmove(&map
[i
], &map
[i
+ 1],
925 sizeof(map
[i
]) * length
);
927 mip
->map_blocks
+= map
[i
].br_blockcount
;
931 mip
->map_valid
+= mip
->nmap
;
935 * No valid mappings, so no more data blocks.
937 if (!mip
->map_valid
) {
938 *curoff
= xfs_dir2_da_to_byte(mp
, mip
->map_off
);
943 * Read the directory block starting at the first mapping.
945 mip
->curdb
= xfs_dir2_da_to_db(mp
, map
->br_startoff
);
946 error
= xfs_dir2_data_read(NULL
, dp
, map
->br_startoff
,
947 map
->br_blockcount
>= mp
->m_dirblkfsbs
?
948 XFS_FSB_TO_DADDR(mp
, map
->br_startblock
) : -1, &bp
);
951 * Should just skip over the data block instead of giving up.
957 * Adjust the current amount of read-ahead: we just read a block that
961 mip
->ra_current
-= mp
->m_dirblkfsbs
;
964 * Do we need more readahead?
966 for (mip
->ra_index
= mip
->ra_offset
= i
= 0;
967 mip
->ra_want
> mip
->ra_current
&& i
< mip
->map_blocks
;
968 i
+= mp
->m_dirblkfsbs
) {
969 ASSERT(mip
->ra_index
< mip
->map_valid
);
971 * Read-ahead a contiguous directory block.
973 if (i
> mip
->ra_current
&&
974 map
[mip
->ra_index
].br_blockcount
>= mp
->m_dirblkfsbs
) {
975 xfs_buf_readahead(mp
->m_ddev_targp
,
977 map
[mip
->ra_index
].br_startblock
+
979 (int)BTOBB(mp
->m_dirblksize
), NULL
);
984 * Read-ahead a non-contiguous directory block. This doesn't
985 * use our mapping, but this is a very rare case.
987 else if (i
> mip
->ra_current
) {
988 xfs_da_reada_buf(NULL
, dp
,
989 map
[mip
->ra_index
].br_startoff
+
991 XFS_DATA_FORK
, NULL
);
996 * Advance offset through the mapping table.
998 for (j
= 0; j
< mp
->m_dirblkfsbs
; j
++) {
1000 * The rest of this extent but not more than a dir
1003 length
= min_t(int, mp
->m_dirblkfsbs
,
1004 map
[mip
->ra_index
].br_blockcount
-
1007 mip
->ra_offset
+= length
;
1010 * Advance to the next mapping if this one is used up.
1012 if (mip
->ra_offset
== map
[mip
->ra_index
].br_blockcount
) {
1025 * Getdents (readdir) for leaf and node directories.
1026 * This reads the data blocks only, so is the same for both forms.
1029 xfs_dir2_leaf_getdents(
1030 xfs_inode_t
*dp
, /* incore directory inode */
1036 struct xfs_buf
*bp
= NULL
; /* data block buffer */
1037 xfs_dir2_data_hdr_t
*hdr
; /* data block header */
1038 xfs_dir2_data_entry_t
*dep
; /* data entry */
1039 xfs_dir2_data_unused_t
*dup
; /* unused entry */
1040 int error
= 0; /* error return value */
1041 int length
; /* temporary length value */
1042 xfs_mount_t
*mp
; /* filesystem mount point */
1043 int byteoff
; /* offset in current block */
1044 xfs_dir2_off_t curoff
; /* current overall offset */
1045 xfs_dir2_off_t newoff
; /* new curoff after new blk */
1046 char *ptr
= NULL
; /* pointer to current data */
1047 struct xfs_dir2_leaf_map_info
*map_info
;
1050 * If the offset is at or past the largest allowed value,
1051 * give up right away.
1053 if (*offset
>= XFS_DIR2_MAX_DATAPTR
)
1059 * Set up to bmap a number of blocks based on the caller's
1060 * buffer size, the directory block size, and the filesystem
1063 length
= howmany(bufsize
+ mp
->m_dirblksize
,
1064 mp
->m_sb
.sb_blocksize
);
1065 map_info
= kmem_zalloc(offsetof(struct xfs_dir2_leaf_map_info
, map
) +
1066 (length
* sizeof(struct xfs_bmbt_irec
)),
1068 map_info
->map_size
= length
;
1071 * Inside the loop we keep the main offset value as a byte offset
1072 * in the directory file.
1074 curoff
= xfs_dir2_dataptr_to_byte(mp
, *offset
);
1077 * Force this conversion through db so we truncate the offset
1078 * down to get the start of the data block.
1080 map_info
->map_off
= xfs_dir2_db_to_da(mp
,
1081 xfs_dir2_byte_to_db(mp
, curoff
));
1084 * Loop over directory entries until we reach the end offset.
1085 * Get more blocks and readahead as necessary.
1087 while (curoff
< XFS_DIR2_LEAF_OFFSET
) {
1089 * If we have no buffer, or we're off the end of the
1090 * current buffer, need to get another one.
1092 if (!bp
|| ptr
>= (char *)bp
->b_addr
+ mp
->m_dirblksize
) {
1094 error
= xfs_dir2_leaf_readbuf(dp
, bufsize
, map_info
,
1096 if (error
|| !map_info
->map_valid
)
1100 * Having done a read, we need to set a new offset.
1102 newoff
= xfs_dir2_db_off_to_byte(mp
, map_info
->curdb
, 0);
1104 * Start of the current block.
1106 if (curoff
< newoff
)
1109 * Make sure we're in the right block.
1111 else if (curoff
> newoff
)
1112 ASSERT(xfs_dir2_byte_to_db(mp
, curoff
) ==
1115 xfs_dir2_data_check(dp
, bp
);
1117 * Find our position in the block.
1119 ptr
= (char *)(hdr
+ 1);
1120 byteoff
= xfs_dir2_byte_to_off(mp
, curoff
);
1122 * Skip past the header.
1125 curoff
+= (uint
)sizeof(*hdr
);
1127 * Skip past entries until we reach our offset.
1130 while ((char *)ptr
- (char *)hdr
< byteoff
) {
1131 dup
= (xfs_dir2_data_unused_t
*)ptr
;
1133 if (be16_to_cpu(dup
->freetag
)
1134 == XFS_DIR2_DATA_FREE_TAG
) {
1136 length
= be16_to_cpu(dup
->length
);
1140 dep
= (xfs_dir2_data_entry_t
*)ptr
;
1142 xfs_dir2_data_entsize(dep
->namelen
);
1146 * Now set our real offset.
1149 xfs_dir2_db_off_to_byte(mp
,
1150 xfs_dir2_byte_to_db(mp
, curoff
),
1151 (char *)ptr
- (char *)hdr
);
1152 if (ptr
>= (char *)hdr
+ mp
->m_dirblksize
) {
1158 * We have a pointer to an entry.
1161 dup
= (xfs_dir2_data_unused_t
*)ptr
;
1163 * No, it's unused, skip over it.
1165 if (be16_to_cpu(dup
->freetag
) == XFS_DIR2_DATA_FREE_TAG
) {
1166 length
= be16_to_cpu(dup
->length
);
1172 dep
= (xfs_dir2_data_entry_t
*)ptr
;
1173 length
= xfs_dir2_data_entsize(dep
->namelen
);
1175 if (filldir(dirent
, (char *)dep
->name
, dep
->namelen
,
1176 xfs_dir2_byte_to_dataptr(mp
, curoff
) & 0x7fffffff,
1177 be64_to_cpu(dep
->inumber
), DT_UNKNOWN
))
1181 * Advance to next entry in the block.
1185 /* bufsize may have just been a guess; don't go negative */
1186 bufsize
= bufsize
> length
? bufsize
- length
: 0;
1190 * All done. Set output offset value to current offset.
1192 if (curoff
> xfs_dir2_dataptr_to_byte(mp
, XFS_DIR2_MAX_DATAPTR
))
1193 *offset
= XFS_DIR2_MAX_DATAPTR
& 0x7fffffff;
1195 *offset
= xfs_dir2_byte_to_dataptr(mp
, curoff
) & 0x7fffffff;
1196 kmem_free(map_info
);
1198 xfs_trans_brelse(NULL
, bp
);
1203 * Initialize a new leaf block, leaf1 or leafn magic accepted.
1207 xfs_da_args_t
*args
, /* operation arguments */
1208 xfs_dir2_db_t bno
, /* directory block number */
1209 struct xfs_buf
**bpp
, /* out: leaf buffer */
1210 int magic
) /* magic number for block */
1212 struct xfs_buf
*bp
; /* leaf buffer */
1213 xfs_inode_t
*dp
; /* incore directory inode */
1214 int error
; /* error return code */
1215 xfs_dir2_leaf_t
*leaf
; /* leaf structure */
1216 xfs_dir2_leaf_tail_t
*ltp
; /* leaf tail structure */
1217 xfs_mount_t
*mp
; /* filesystem mount point */
1218 xfs_trans_t
*tp
; /* transaction pointer */
1224 ASSERT(bno
>= XFS_DIR2_LEAF_FIRSTDB(mp
) &&
1225 bno
< XFS_DIR2_FREE_FIRSTDB(mp
));
1227 * Get the buffer for the block.
1229 error
= xfs_da_get_buf(tp
, dp
, xfs_dir2_db_to_da(mp
, bno
), -1, &bp
,
1237 * Initialize the header.
1239 leaf
->hdr
.info
.magic
= cpu_to_be16(magic
);
1240 leaf
->hdr
.info
.forw
= 0;
1241 leaf
->hdr
.info
.back
= 0;
1242 leaf
->hdr
.count
= 0;
1243 leaf
->hdr
.stale
= 0;
1244 xfs_dir2_leaf_log_header(tp
, bp
);
1246 * If it's a leaf-format directory initialize the tail.
1247 * In this case our caller has the real bests table to copy into
1250 if (magic
== XFS_DIR2_LEAF1_MAGIC
) {
1251 ltp
= xfs_dir2_leaf_tail_p(mp
, leaf
);
1253 xfs_dir2_leaf_log_tail(tp
, bp
);
1260 * Log the bests entries indicated from a leaf1 block.
1263 xfs_dir2_leaf_log_bests(
1264 xfs_trans_t
*tp
, /* transaction pointer */
1265 struct xfs_buf
*bp
, /* leaf buffer */
1266 int first
, /* first entry to log */
1267 int last
) /* last entry to log */
1269 __be16
*firstb
; /* pointer to first entry */
1270 __be16
*lastb
; /* pointer to last entry */
1271 xfs_dir2_leaf_t
*leaf
; /* leaf structure */
1272 xfs_dir2_leaf_tail_t
*ltp
; /* leaf tail structure */
1275 ASSERT(leaf
->hdr
.info
.magic
== cpu_to_be16(XFS_DIR2_LEAF1_MAGIC
));
1276 ltp
= xfs_dir2_leaf_tail_p(tp
->t_mountp
, leaf
);
1277 firstb
= xfs_dir2_leaf_bests_p(ltp
) + first
;
1278 lastb
= xfs_dir2_leaf_bests_p(ltp
) + last
;
1279 xfs_trans_log_buf(tp
, bp
, (uint
)((char *)firstb
- (char *)leaf
),
1280 (uint
)((char *)lastb
- (char *)leaf
+ sizeof(*lastb
) - 1));
1284 * Log the leaf entries indicated from a leaf1 or leafn block.
1287 xfs_dir2_leaf_log_ents(
1288 xfs_trans_t
*tp
, /* transaction pointer */
1289 struct xfs_buf
*bp
, /* leaf buffer */
1290 int first
, /* first entry to log */
1291 int last
) /* last entry to log */
1293 xfs_dir2_leaf_entry_t
*firstlep
; /* pointer to first entry */
1294 xfs_dir2_leaf_entry_t
*lastlep
; /* pointer to last entry */
1295 xfs_dir2_leaf_t
*leaf
; /* leaf structure */
1298 ASSERT(leaf
->hdr
.info
.magic
== cpu_to_be16(XFS_DIR2_LEAF1_MAGIC
) ||
1299 leaf
->hdr
.info
.magic
== cpu_to_be16(XFS_DIR2_LEAFN_MAGIC
));
1300 firstlep
= &leaf
->ents
[first
];
1301 lastlep
= &leaf
->ents
[last
];
1302 xfs_trans_log_buf(tp
, bp
, (uint
)((char *)firstlep
- (char *)leaf
),
1303 (uint
)((char *)lastlep
- (char *)leaf
+ sizeof(*lastlep
) - 1));
1307 * Log the header of the leaf1 or leafn block.
1310 xfs_dir2_leaf_log_header(
1311 struct xfs_trans
*tp
,
1314 xfs_dir2_leaf_t
*leaf
; /* leaf structure */
1317 ASSERT(leaf
->hdr
.info
.magic
== cpu_to_be16(XFS_DIR2_LEAF1_MAGIC
) ||
1318 leaf
->hdr
.info
.magic
== cpu_to_be16(XFS_DIR2_LEAFN_MAGIC
));
1319 xfs_trans_log_buf(tp
, bp
, (uint
)((char *)&leaf
->hdr
- (char *)leaf
),
1320 (uint
)(sizeof(leaf
->hdr
) - 1));
1324 * Log the tail of the leaf1 block.
1327 xfs_dir2_leaf_log_tail(
1328 struct xfs_trans
*tp
,
1331 xfs_dir2_leaf_t
*leaf
; /* leaf structure */
1332 xfs_dir2_leaf_tail_t
*ltp
; /* leaf tail structure */
1333 xfs_mount_t
*mp
; /* filesystem mount point */
1337 ASSERT(leaf
->hdr
.info
.magic
== cpu_to_be16(XFS_DIR2_LEAF1_MAGIC
));
1338 ltp
= xfs_dir2_leaf_tail_p(mp
, leaf
);
1339 xfs_trans_log_buf(tp
, bp
, (uint
)((char *)ltp
- (char *)leaf
),
1340 (uint
)(mp
->m_dirblksize
- 1));
1344 * Look up the entry referred to by args in the leaf format directory.
1345 * Most of the work is done by the xfs_dir2_leaf_lookup_int routine which
1346 * is also used by the node-format code.
1349 xfs_dir2_leaf_lookup(
1350 xfs_da_args_t
*args
) /* operation arguments */
1352 struct xfs_buf
*dbp
; /* data block buffer */
1353 xfs_dir2_data_entry_t
*dep
; /* data block entry */
1354 xfs_inode_t
*dp
; /* incore directory inode */
1355 int error
; /* error return code */
1356 int index
; /* found entry index */
1357 struct xfs_buf
*lbp
; /* leaf buffer */
1358 xfs_dir2_leaf_t
*leaf
; /* leaf structure */
1359 xfs_dir2_leaf_entry_t
*lep
; /* leaf entry */
1360 xfs_trans_t
*tp
; /* transaction pointer */
1362 trace_xfs_dir2_leaf_lookup(args
);
1365 * Look up name in the leaf block, returning both buffers and index.
1367 if ((error
= xfs_dir2_leaf_lookup_int(args
, &lbp
, &index
, &dbp
))) {
1372 xfs_dir2_leaf_check(dp
, lbp
);
1375 * Get to the leaf entry and contained data entry address.
1377 lep
= &leaf
->ents
[index
];
1379 * Point to the data entry.
1381 dep
= (xfs_dir2_data_entry_t
*)
1382 ((char *)dbp
->b_addr
+
1383 xfs_dir2_dataptr_to_off(dp
->i_mount
, be32_to_cpu(lep
->address
)));
1385 * Return the found inode number & CI name if appropriate
1387 args
->inumber
= be64_to_cpu(dep
->inumber
);
1388 error
= xfs_dir_cilookup_result(args
, dep
->name
, dep
->namelen
);
1389 xfs_trans_brelse(tp
, dbp
);
1390 xfs_trans_brelse(tp
, lbp
);
1391 return XFS_ERROR(error
);
1395 * Look up name/hash in the leaf block.
1396 * Fill in indexp with the found index, and dbpp with the data buffer.
1397 * If not found dbpp will be NULL, and ENOENT comes back.
1398 * lbpp will always be filled in with the leaf buffer unless there's an error.
1400 static int /* error */
1401 xfs_dir2_leaf_lookup_int(
1402 xfs_da_args_t
*args
, /* operation arguments */
1403 struct xfs_buf
**lbpp
, /* out: leaf buffer */
1404 int *indexp
, /* out: index in leaf block */
1405 struct xfs_buf
**dbpp
) /* out: data buffer */
1407 xfs_dir2_db_t curdb
= -1; /* current data block number */
1408 struct xfs_buf
*dbp
= NULL
; /* data buffer */
1409 xfs_dir2_data_entry_t
*dep
; /* data entry */
1410 xfs_inode_t
*dp
; /* incore directory inode */
1411 int error
; /* error return code */
1412 int index
; /* index in leaf block */
1413 struct xfs_buf
*lbp
; /* leaf buffer */
1414 xfs_dir2_leaf_entry_t
*lep
; /* leaf entry */
1415 xfs_dir2_leaf_t
*leaf
; /* leaf structure */
1416 xfs_mount_t
*mp
; /* filesystem mount point */
1417 xfs_dir2_db_t newdb
; /* new data block number */
1418 xfs_trans_t
*tp
; /* transaction pointer */
1419 xfs_dir2_db_t cidb
= -1; /* case match data block no. */
1420 enum xfs_dacmp cmp
; /* name compare result */
1426 error
= xfs_dir2_leaf_read(tp
, dp
, mp
->m_dirleafblk
, -1, &lbp
);
1432 xfs_dir2_leaf_check(dp
, lbp
);
1434 * Look for the first leaf entry with our hash value.
1436 index
= xfs_dir2_leaf_search_hash(args
, lbp
);
1438 * Loop over all the entries with the right hash value
1439 * looking to match the name.
1441 for (lep
= &leaf
->ents
[index
]; index
< be16_to_cpu(leaf
->hdr
.count
) &&
1442 be32_to_cpu(lep
->hashval
) == args
->hashval
;
1445 * Skip over stale leaf entries.
1447 if (be32_to_cpu(lep
->address
) == XFS_DIR2_NULL_DATAPTR
)
1450 * Get the new data block number.
1452 newdb
= xfs_dir2_dataptr_to_db(mp
, be32_to_cpu(lep
->address
));
1454 * If it's not the same as the old data block number,
1455 * need to pitch the old one and read the new one.
1457 if (newdb
!= curdb
) {
1459 xfs_trans_brelse(tp
, dbp
);
1460 error
= xfs_dir2_data_read(tp
, dp
,
1461 xfs_dir2_db_to_da(mp
, newdb
),
1464 xfs_trans_brelse(tp
, lbp
);
1470 * Point to the data entry.
1472 dep
= (xfs_dir2_data_entry_t
*)((char *)dbp
->b_addr
+
1473 xfs_dir2_dataptr_to_off(mp
, be32_to_cpu(lep
->address
)));
1475 * Compare name and if it's an exact match, return the index
1476 * and buffer. If it's the first case-insensitive match, store
1477 * the index and buffer and continue looking for an exact match.
1479 cmp
= mp
->m_dirnameops
->compname(args
, dep
->name
, dep
->namelen
);
1480 if (cmp
!= XFS_CMP_DIFFERENT
&& cmp
!= args
->cmpresult
) {
1481 args
->cmpresult
= cmp
;
1483 /* case exact match: return the current buffer. */
1484 if (cmp
== XFS_CMP_EXACT
) {
1491 ASSERT(args
->op_flags
& XFS_DA_OP_OKNOENT
);
1493 * Here, we can only be doing a lookup (not a rename or remove).
1494 * If a case-insensitive match was found earlier, re-read the
1495 * appropriate data block if required and return it.
1497 if (args
->cmpresult
== XFS_CMP_CASE
) {
1499 if (cidb
!= curdb
) {
1500 xfs_trans_brelse(tp
, dbp
);
1501 error
= xfs_dir2_data_read(tp
, dp
,
1502 xfs_dir2_db_to_da(mp
, cidb
),
1505 xfs_trans_brelse(tp
, lbp
);
1513 * No match found, return ENOENT.
1517 xfs_trans_brelse(tp
, dbp
);
1518 xfs_trans_brelse(tp
, lbp
);
1519 return XFS_ERROR(ENOENT
);
1523 * Remove an entry from a leaf format directory.
1526 xfs_dir2_leaf_removename(
1527 xfs_da_args_t
*args
) /* operation arguments */
1529 __be16
*bestsp
; /* leaf block best freespace */
1530 xfs_dir2_data_hdr_t
*hdr
; /* data block header */
1531 xfs_dir2_db_t db
; /* data block number */
1532 struct xfs_buf
*dbp
; /* data block buffer */
1533 xfs_dir2_data_entry_t
*dep
; /* data entry structure */
1534 xfs_inode_t
*dp
; /* incore directory inode */
1535 int error
; /* error return code */
1536 xfs_dir2_db_t i
; /* temporary data block # */
1537 int index
; /* index into leaf entries */
1538 struct xfs_buf
*lbp
; /* leaf buffer */
1539 xfs_dir2_leaf_t
*leaf
; /* leaf structure */
1540 xfs_dir2_leaf_entry_t
*lep
; /* leaf entry */
1541 xfs_dir2_leaf_tail_t
*ltp
; /* leaf tail structure */
1542 xfs_mount_t
*mp
; /* filesystem mount point */
1543 int needlog
; /* need to log data header */
1544 int needscan
; /* need to rescan data frees */
1545 xfs_dir2_data_off_t oldbest
; /* old value of best free */
1546 xfs_trans_t
*tp
; /* transaction pointer */
1548 trace_xfs_dir2_leaf_removename(args
);
1551 * Lookup the leaf entry, get the leaf and data blocks read in.
1553 if ((error
= xfs_dir2_leaf_lookup_int(args
, &lbp
, &index
, &dbp
))) {
1561 xfs_dir2_data_check(dp
, dbp
);
1563 * Point to the leaf entry, use that to point to the data entry.
1565 lep
= &leaf
->ents
[index
];
1566 db
= xfs_dir2_dataptr_to_db(mp
, be32_to_cpu(lep
->address
));
1567 dep
= (xfs_dir2_data_entry_t
*)
1568 ((char *)hdr
+ xfs_dir2_dataptr_to_off(mp
, be32_to_cpu(lep
->address
)));
1569 needscan
= needlog
= 0;
1570 oldbest
= be16_to_cpu(hdr
->bestfree
[0].length
);
1571 ltp
= xfs_dir2_leaf_tail_p(mp
, leaf
);
1572 bestsp
= xfs_dir2_leaf_bests_p(ltp
);
1573 ASSERT(be16_to_cpu(bestsp
[db
]) == oldbest
);
1575 * Mark the former data entry unused.
1577 xfs_dir2_data_make_free(tp
, dbp
,
1578 (xfs_dir2_data_aoff_t
)((char *)dep
- (char *)hdr
),
1579 xfs_dir2_data_entsize(dep
->namelen
), &needlog
, &needscan
);
1581 * We just mark the leaf entry stale by putting a null in it.
1583 be16_add_cpu(&leaf
->hdr
.stale
, 1);
1584 xfs_dir2_leaf_log_header(tp
, lbp
);
1585 lep
->address
= cpu_to_be32(XFS_DIR2_NULL_DATAPTR
);
1586 xfs_dir2_leaf_log_ents(tp
, lbp
, index
, index
);
1588 * Scan the freespace in the data block again if necessary,
1589 * log the data block header if necessary.
1592 xfs_dir2_data_freescan(mp
, hdr
, &needlog
);
1594 xfs_dir2_data_log_header(tp
, dbp
);
1596 * If the longest freespace in the data block has changed,
1597 * put the new value in the bests table and log that.
1599 if (be16_to_cpu(hdr
->bestfree
[0].length
) != oldbest
) {
1600 bestsp
[db
] = hdr
->bestfree
[0].length
;
1601 xfs_dir2_leaf_log_bests(tp
, lbp
, db
, db
);
1603 xfs_dir2_data_check(dp
, dbp
);
1605 * If the data block is now empty then get rid of the data block.
1607 if (be16_to_cpu(hdr
->bestfree
[0].length
) ==
1608 mp
->m_dirblksize
- (uint
)sizeof(*hdr
)) {
1609 ASSERT(db
!= mp
->m_dirdatablk
);
1610 if ((error
= xfs_dir2_shrink_inode(args
, db
, dbp
))) {
1612 * Nope, can't get rid of it because it caused
1613 * allocation of a bmap btree block to do so.
1614 * Just go on, returning success, leaving the
1615 * empty block in place.
1617 if (error
== ENOSPC
&& args
->total
== 0)
1619 xfs_dir2_leaf_check(dp
, lbp
);
1624 * If this is the last data block then compact the
1625 * bests table by getting rid of entries.
1627 if (db
== be32_to_cpu(ltp
->bestcount
) - 1) {
1629 * Look for the last active entry (i).
1631 for (i
= db
- 1; i
> 0; i
--) {
1632 if (bestsp
[i
] != cpu_to_be16(NULLDATAOFF
))
1636 * Copy the table down so inactive entries at the
1639 memmove(&bestsp
[db
- i
], bestsp
,
1640 (be32_to_cpu(ltp
->bestcount
) - (db
- i
)) * sizeof(*bestsp
));
1641 be32_add_cpu(<p
->bestcount
, -(db
- i
));
1642 xfs_dir2_leaf_log_tail(tp
, lbp
);
1643 xfs_dir2_leaf_log_bests(tp
, lbp
, 0, be32_to_cpu(ltp
->bestcount
) - 1);
1645 bestsp
[db
] = cpu_to_be16(NULLDATAOFF
);
1648 * If the data block was not the first one, drop it.
1650 else if (db
!= mp
->m_dirdatablk
)
1653 xfs_dir2_leaf_check(dp
, lbp
);
1655 * See if we can convert to block form.
1657 return xfs_dir2_leaf_to_block(args
, lbp
, dbp
);
1661 * Replace the inode number in a leaf format directory entry.
1664 xfs_dir2_leaf_replace(
1665 xfs_da_args_t
*args
) /* operation arguments */
1667 struct xfs_buf
*dbp
; /* data block buffer */
1668 xfs_dir2_data_entry_t
*dep
; /* data block entry */
1669 xfs_inode_t
*dp
; /* incore directory inode */
1670 int error
; /* error return code */
1671 int index
; /* index of leaf entry */
1672 struct xfs_buf
*lbp
; /* leaf buffer */
1673 xfs_dir2_leaf_t
*leaf
; /* leaf structure */
1674 xfs_dir2_leaf_entry_t
*lep
; /* leaf entry */
1675 xfs_trans_t
*tp
; /* transaction pointer */
1677 trace_xfs_dir2_leaf_replace(args
);
1680 * Look up the entry.
1682 if ((error
= xfs_dir2_leaf_lookup_int(args
, &lbp
, &index
, &dbp
))) {
1688 * Point to the leaf entry, get data address from it.
1690 lep
= &leaf
->ents
[index
];
1692 * Point to the data entry.
1694 dep
= (xfs_dir2_data_entry_t
*)
1695 ((char *)dbp
->b_addr
+
1696 xfs_dir2_dataptr_to_off(dp
->i_mount
, be32_to_cpu(lep
->address
)));
1697 ASSERT(args
->inumber
!= be64_to_cpu(dep
->inumber
));
1699 * Put the new inode number in, log it.
1701 dep
->inumber
= cpu_to_be64(args
->inumber
);
1703 xfs_dir2_data_log_entry(tp
, dbp
, dep
);
1704 xfs_dir2_leaf_check(dp
, lbp
);
1705 xfs_trans_brelse(tp
, lbp
);
1710 * Return index in the leaf block (lbp) which is either the first
1711 * one with this hash value, or if there are none, the insert point
1712 * for that hash value.
1714 int /* index value */
1715 xfs_dir2_leaf_search_hash(
1716 xfs_da_args_t
*args
, /* operation arguments */
1717 struct xfs_buf
*lbp
) /* leaf buffer */
1719 xfs_dahash_t hash
=0; /* hash from this entry */
1720 xfs_dahash_t hashwant
; /* hash value looking for */
1721 int high
; /* high leaf index */
1722 int low
; /* low leaf index */
1723 xfs_dir2_leaf_t
*leaf
; /* leaf structure */
1724 xfs_dir2_leaf_entry_t
*lep
; /* leaf entry */
1725 int mid
=0; /* current leaf index */
1729 if (!leaf
->hdr
.count
)
1733 * Note, the table cannot be empty, so we have to go through the loop.
1734 * Binary search the leaf entries looking for our hash value.
1736 for (lep
= leaf
->ents
, low
= 0, high
= be16_to_cpu(leaf
->hdr
.count
) - 1,
1737 hashwant
= args
->hashval
;
1739 mid
= (low
+ high
) >> 1;
1740 if ((hash
= be32_to_cpu(lep
[mid
].hashval
)) == hashwant
)
1742 if (hash
< hashwant
)
1748 * Found one, back up through all the equal hash values.
1750 if (hash
== hashwant
) {
1751 while (mid
> 0 && be32_to_cpu(lep
[mid
- 1].hashval
) == hashwant
) {
1756 * Need to point to an entry higher than ours.
1758 else if (hash
< hashwant
)
1764 * Trim off a trailing data block. We know it's empty since the leaf
1765 * freespace table says so.
1768 xfs_dir2_leaf_trim_data(
1769 xfs_da_args_t
*args
, /* operation arguments */
1770 struct xfs_buf
*lbp
, /* leaf buffer */
1771 xfs_dir2_db_t db
) /* data block number */
1773 __be16
*bestsp
; /* leaf bests table */
1774 struct xfs_buf
*dbp
; /* data block buffer */
1775 xfs_inode_t
*dp
; /* incore directory inode */
1776 int error
; /* error return value */
1777 xfs_dir2_leaf_t
*leaf
; /* leaf structure */
1778 xfs_dir2_leaf_tail_t
*ltp
; /* leaf tail structure */
1779 xfs_mount_t
*mp
; /* filesystem mount point */
1780 xfs_trans_t
*tp
; /* transaction pointer */
1786 * Read the offending data block. We need its buffer.
1788 error
= xfs_dir2_data_read(tp
, dp
, xfs_dir2_db_to_da(mp
, db
), -1, &dbp
);
1793 ltp
= xfs_dir2_leaf_tail_p(mp
, leaf
);
1797 struct xfs_dir2_data_hdr
*hdr
= dbp
->b_addr
;
1799 ASSERT(hdr
->magic
== cpu_to_be32(XFS_DIR2_DATA_MAGIC
));
1800 ASSERT(be16_to_cpu(hdr
->bestfree
[0].length
) ==
1801 mp
->m_dirblksize
- (uint
)sizeof(*hdr
));
1802 ASSERT(db
== be32_to_cpu(ltp
->bestcount
) - 1);
1807 * Get rid of the data block.
1809 if ((error
= xfs_dir2_shrink_inode(args
, db
, dbp
))) {
1810 ASSERT(error
!= ENOSPC
);
1811 xfs_trans_brelse(tp
, dbp
);
1815 * Eliminate the last bests entry from the table.
1817 bestsp
= xfs_dir2_leaf_bests_p(ltp
);
1818 be32_add_cpu(<p
->bestcount
, -1);
1819 memmove(&bestsp
[1], &bestsp
[0], be32_to_cpu(ltp
->bestcount
) * sizeof(*bestsp
));
1820 xfs_dir2_leaf_log_tail(tp
, lbp
);
1821 xfs_dir2_leaf_log_bests(tp
, lbp
, 0, be32_to_cpu(ltp
->bestcount
) - 1);
1825 static inline size_t
1827 struct xfs_dir2_leaf_hdr
*hdr
,
1832 entries
= be16_to_cpu(hdr
->count
) - be16_to_cpu(hdr
->stale
);
1833 return sizeof(xfs_dir2_leaf_hdr_t
) +
1834 entries
* sizeof(xfs_dir2_leaf_entry_t
) +
1835 counts
* sizeof(xfs_dir2_data_off_t
) +
1836 sizeof(xfs_dir2_leaf_tail_t
);
1840 * Convert node form directory to leaf form directory.
1841 * The root of the node form dir needs to already be a LEAFN block.
1842 * Just return if we can't do anything.
1845 xfs_dir2_node_to_leaf(
1846 xfs_da_state_t
*state
) /* directory operation state */
1848 xfs_da_args_t
*args
; /* operation arguments */
1849 xfs_inode_t
*dp
; /* incore directory inode */
1850 int error
; /* error return code */
1851 struct xfs_buf
*fbp
; /* buffer for freespace block */
1852 xfs_fileoff_t fo
; /* freespace file offset */
1853 xfs_dir2_free_t
*free
; /* freespace structure */
1854 struct xfs_buf
*lbp
; /* buffer for leaf block */
1855 xfs_dir2_leaf_tail_t
*ltp
; /* tail of leaf structure */
1856 xfs_dir2_leaf_t
*leaf
; /* leaf structure */
1857 xfs_mount_t
*mp
; /* filesystem mount point */
1858 int rval
; /* successful free trim? */
1859 xfs_trans_t
*tp
; /* transaction pointer */
1862 * There's more than a leaf level in the btree, so there must
1863 * be multiple leafn blocks. Give up.
1865 if (state
->path
.active
> 1)
1869 trace_xfs_dir2_node_to_leaf(args
);
1875 * Get the last offset in the file.
1877 if ((error
= xfs_bmap_last_offset(tp
, dp
, &fo
, XFS_DATA_FORK
))) {
1880 fo
-= mp
->m_dirblkfsbs
;
1882 * If there are freespace blocks other than the first one,
1883 * take this opportunity to remove trailing empty freespace blocks
1884 * that may have been left behind during no-space-reservation
1887 while (fo
> mp
->m_dirfreeblk
) {
1888 if ((error
= xfs_dir2_node_trim_free(args
, fo
, &rval
))) {
1892 fo
-= mp
->m_dirblkfsbs
;
1897 * Now find the block just before the freespace block.
1899 if ((error
= xfs_bmap_last_before(tp
, dp
, &fo
, XFS_DATA_FORK
))) {
1903 * If it's not the single leaf block, give up.
1905 if (XFS_FSB_TO_B(mp
, fo
) > XFS_DIR2_LEAF_OFFSET
+ mp
->m_dirblksize
)
1907 lbp
= state
->path
.blk
[0].bp
;
1909 ASSERT(leaf
->hdr
.info
.magic
== cpu_to_be16(XFS_DIR2_LEAFN_MAGIC
));
1911 * Read the freespace block.
1913 error
= xfs_dir2_free_read(tp
, dp
, mp
->m_dirfreeblk
, &fbp
);
1917 ASSERT(free
->hdr
.magic
== cpu_to_be32(XFS_DIR2_FREE_MAGIC
));
1918 ASSERT(!free
->hdr
.firstdb
);
1921 * Now see if the leafn and free data will fit in a leaf1.
1922 * If not, release the buffer and give up.
1924 if (xfs_dir2_leaf_size(&leaf
->hdr
, be32_to_cpu(free
->hdr
.nvalid
)) >
1926 xfs_trans_brelse(tp
, fbp
);
1931 * If the leaf has any stale entries in it, compress them out.
1932 * The compact routine will log the header.
1934 if (be16_to_cpu(leaf
->hdr
.stale
))
1935 xfs_dir2_leaf_compact(args
, lbp
);
1937 xfs_dir2_leaf_log_header(tp
, lbp
);
1938 leaf
->hdr
.info
.magic
= cpu_to_be16(XFS_DIR2_LEAF1_MAGIC
);
1940 * Set up the leaf tail from the freespace block.
1942 ltp
= xfs_dir2_leaf_tail_p(mp
, leaf
);
1943 ltp
->bestcount
= free
->hdr
.nvalid
;
1945 * Set up the leaf bests table.
1947 memcpy(xfs_dir2_leaf_bests_p(ltp
), free
->bests
,
1948 be32_to_cpu(ltp
->bestcount
) * sizeof(xfs_dir2_data_off_t
));
1949 xfs_dir2_leaf_log_bests(tp
, lbp
, 0, be32_to_cpu(ltp
->bestcount
) - 1);
1950 xfs_dir2_leaf_log_tail(tp
, lbp
);
1951 xfs_dir2_leaf_check(dp
, lbp
);
1953 * Get rid of the freespace block.
1955 error
= xfs_dir2_shrink_inode(args
, XFS_DIR2_FREE_FIRSTDB(mp
), fbp
);
1958 * This can't fail here because it can only happen when
1959 * punching out the middle of an extent, and this is an
1962 ASSERT(error
!= ENOSPC
);
1967 * Now see if we can convert the single-leaf directory
1968 * down to a block form directory.
1969 * This routine always kills the dabuf for the leaf, so
1970 * eliminate it from the path.
1972 error
= xfs_dir2_leaf_to_block(args
, lbp
, NULL
);
1973 state
->path
.blk
[0].bp
= NULL
;