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"
27 #include "xfs_dmapi.h"
28 #include "xfs_mount.h"
29 #include "xfs_da_btree.h"
30 #include "xfs_bmap_btree.h"
31 #include "xfs_dir2_sf.h"
32 #include "xfs_attr_sf.h"
33 #include "xfs_dinode.h"
34 #include "xfs_inode.h"
35 #include "xfs_inode_item.h"
36 #include "xfs_dir2_data.h"
37 #include "xfs_dir2_leaf.h"
38 #include "xfs_dir2_block.h"
39 #include "xfs_dir2_trace.h"
40 #include "xfs_error.h"
43 * Local function prototypes.
45 static void xfs_dir2_block_log_leaf(xfs_trans_t
*tp
, xfs_dabuf_t
*bp
, int first
,
47 static void xfs_dir2_block_log_tail(xfs_trans_t
*tp
, xfs_dabuf_t
*bp
);
48 static int xfs_dir2_block_lookup_int(xfs_da_args_t
*args
, xfs_dabuf_t
**bpp
,
50 static int xfs_dir2_block_sort(const void *a
, const void *b
);
52 static xfs_dahash_t xfs_dir_hash_dot
, xfs_dir_hash_dotdot
;
55 * One-time startup routine called from xfs_init().
60 xfs_dir_hash_dot
= xfs_da_hashname(".", 1);
61 xfs_dir_hash_dotdot
= xfs_da_hashname("..", 2);
65 * Add an entry to a block directory.
68 xfs_dir2_block_addname(
69 xfs_da_args_t
*args
) /* directory op arguments */
71 xfs_dir2_data_free_t
*bf
; /* bestfree table in block */
72 xfs_dir2_block_t
*block
; /* directory block structure */
73 xfs_dir2_leaf_entry_t
*blp
; /* block leaf entries */
74 xfs_dabuf_t
*bp
; /* buffer for block */
75 xfs_dir2_block_tail_t
*btp
; /* block tail */
76 int compact
; /* need to compact leaf ents */
77 xfs_dir2_data_entry_t
*dep
; /* block data entry */
78 xfs_inode_t
*dp
; /* directory inode */
79 xfs_dir2_data_unused_t
*dup
; /* block unused entry */
80 int error
; /* error return value */
81 xfs_dir2_data_unused_t
*enddup
=NULL
; /* unused at end of data */
82 xfs_dahash_t hash
; /* hash value of found entry */
83 int high
; /* high index for binary srch */
84 int highstale
; /* high stale index */
85 int lfloghigh
=0; /* last final leaf to log */
86 int lfloglow
=0; /* first final leaf to log */
87 int len
; /* length of the new entry */
88 int low
; /* low index for binary srch */
89 int lowstale
; /* low stale index */
90 int mid
=0; /* midpoint for binary srch */
91 xfs_mount_t
*mp
; /* filesystem mount point */
92 int needlog
; /* need to log header */
93 int needscan
; /* need to rescan freespace */
94 __be16
*tagp
; /* pointer to tag value */
95 xfs_trans_t
*tp
; /* transaction structure */
97 xfs_dir2_trace_args("block_addname", args
);
102 * Read the (one and only) directory block into dabuf bp.
105 xfs_da_read_buf(tp
, dp
, mp
->m_dirdatablk
, -1, &bp
, XFS_DATA_FORK
))) {
111 * Check the magic number, corrupted if wrong.
113 if (unlikely(be32_to_cpu(block
->hdr
.magic
) != XFS_DIR2_BLOCK_MAGIC
)) {
114 XFS_CORRUPTION_ERROR("xfs_dir2_block_addname",
115 XFS_ERRLEVEL_LOW
, mp
, block
);
116 xfs_da_brelse(tp
, bp
);
117 return XFS_ERROR(EFSCORRUPTED
);
119 len
= xfs_dir2_data_entsize(args
->namelen
);
121 * Set up pointers to parts of the block.
123 bf
= block
->hdr
.bestfree
;
124 btp
= xfs_dir2_block_tail_p(mp
, block
);
125 blp
= xfs_dir2_block_leaf_p(btp
);
127 * No stale entries? Need space for entry and new leaf.
131 * Tag just before the first leaf entry.
133 tagp
= (__be16
*)blp
- 1;
135 * Data object just before the first leaf entry.
137 enddup
= (xfs_dir2_data_unused_t
*)((char *)block
+ be16_to_cpu(*tagp
));
139 * If it's not free then can't do this add without cleaning up:
140 * the space before the first leaf entry needs to be free so it
141 * can be expanded to hold the pointer to the new entry.
143 if (be16_to_cpu(enddup
->freetag
) != XFS_DIR2_DATA_FREE_TAG
)
146 * Check out the biggest freespace and see if it's the same one.
149 dup
= (xfs_dir2_data_unused_t
*)
150 ((char *)block
+ be16_to_cpu(bf
[0].offset
));
153 * It is the biggest freespace, is it too small
154 * to hold the new leaf too?
156 if (be16_to_cpu(dup
->length
) < len
+ (uint
)sizeof(*blp
)) {
158 * Yes, we use the second-largest
159 * entry instead if it works.
161 if (be16_to_cpu(bf
[1].length
) >= len
)
162 dup
= (xfs_dir2_data_unused_t
*)
164 be16_to_cpu(bf
[1].offset
));
170 * Not the same free entry,
171 * just check its length.
173 if (be16_to_cpu(dup
->length
) < len
) {
181 * If there are stale entries we'll use one for the leaf.
182 * Is the biggest entry enough to avoid compaction?
184 else if (be16_to_cpu(bf
[0].length
) >= len
) {
185 dup
= (xfs_dir2_data_unused_t
*)
186 ((char *)block
+ be16_to_cpu(bf
[0].offset
));
190 * Will need to compact to make this work.
194 * Tag just before the first leaf entry.
196 tagp
= (__be16
*)blp
- 1;
198 * Data object just before the first leaf entry.
200 dup
= (xfs_dir2_data_unused_t
*)((char *)block
+ be16_to_cpu(*tagp
));
202 * If it's not free then the data will go where the
203 * leaf data starts now, if it works at all.
205 if (be16_to_cpu(dup
->freetag
) == XFS_DIR2_DATA_FREE_TAG
) {
206 if (be16_to_cpu(dup
->length
) + (be32_to_cpu(btp
->stale
) - 1) *
207 (uint
)sizeof(*blp
) < len
)
209 } else if ((be32_to_cpu(btp
->stale
) - 1) * (uint
)sizeof(*blp
) < len
)
212 dup
= (xfs_dir2_data_unused_t
*)blp
;
216 * If this isn't a real add, we're done with the buffer.
218 if (args
->op_flags
& XFS_DA_OP_JUSTCHECK
)
219 xfs_da_brelse(tp
, bp
);
221 * If we don't have space for the new entry & leaf ...
225 * Not trying to actually do anything, or don't have
226 * a space reservation: return no-space.
228 if ((args
->op_flags
& XFS_DA_OP_JUSTCHECK
) || args
->total
== 0)
229 return XFS_ERROR(ENOSPC
);
231 * Convert to the next larger format.
232 * Then add the new entry in that format.
234 error
= xfs_dir2_block_to_leaf(args
, bp
);
238 return xfs_dir2_leaf_addname(args
);
241 * Just checking, and it would work, so say so.
243 if (args
->op_flags
& XFS_DA_OP_JUSTCHECK
)
245 needlog
= needscan
= 0;
247 * If need to compact the leaf entries, do it now.
248 * Leave the highest-numbered stale entry stale.
249 * XXX should be the one closest to mid but mid is not yet computed.
252 int fromidx
; /* source leaf index */
253 int toidx
; /* target leaf index */
255 for (fromidx
= toidx
= be32_to_cpu(btp
->count
) - 1,
256 highstale
= lfloghigh
= -1;
259 if (be32_to_cpu(blp
[fromidx
].address
) == XFS_DIR2_NULL_DATAPTR
) {
269 blp
[toidx
] = blp
[fromidx
];
272 lfloglow
= toidx
+ 1 - (be32_to_cpu(btp
->stale
) - 1);
273 lfloghigh
-= be32_to_cpu(btp
->stale
) - 1;
274 be32_add_cpu(&btp
->count
, -(be32_to_cpu(btp
->stale
) - 1));
275 xfs_dir2_data_make_free(tp
, bp
,
276 (xfs_dir2_data_aoff_t
)((char *)blp
- (char *)block
),
277 (xfs_dir2_data_aoff_t
)((be32_to_cpu(btp
->stale
) - 1) * sizeof(*blp
)),
278 &needlog
, &needscan
);
279 blp
+= be32_to_cpu(btp
->stale
) - 1;
280 btp
->stale
= cpu_to_be32(1);
282 * If we now need to rebuild the bestfree map, do so.
283 * This needs to happen before the next call to use_free.
286 xfs_dir2_data_freescan(mp
, (xfs_dir2_data_t
*)block
, &needlog
);
291 * Set leaf logging boundaries to impossible state.
292 * For the no-stale case they're set explicitly.
294 else if (btp
->stale
) {
295 lfloglow
= be32_to_cpu(btp
->count
);
299 * Find the slot that's first lower than our hash value, -1 if none.
301 for (low
= 0, high
= be32_to_cpu(btp
->count
) - 1; low
<= high
; ) {
302 mid
= (low
+ high
) >> 1;
303 if ((hash
= be32_to_cpu(blp
[mid
].hashval
)) == args
->hashval
)
305 if (hash
< args
->hashval
)
310 while (mid
>= 0 && be32_to_cpu(blp
[mid
].hashval
) >= args
->hashval
) {
314 * No stale entries, will use enddup space to hold new leaf.
318 * Mark the space needed for the new leaf entry, now in use.
320 xfs_dir2_data_use_free(tp
, bp
, enddup
,
321 (xfs_dir2_data_aoff_t
)
322 ((char *)enddup
- (char *)block
+ be16_to_cpu(enddup
->length
) -
324 (xfs_dir2_data_aoff_t
)sizeof(*blp
),
325 &needlog
, &needscan
);
327 * Update the tail (entry count).
329 be32_add_cpu(&btp
->count
, 1);
331 * If we now need to rebuild the bestfree map, do so.
332 * This needs to happen before the next call to use_free.
335 xfs_dir2_data_freescan(mp
, (xfs_dir2_data_t
*)block
,
340 * Adjust pointer to the first leaf entry, we're about to move
341 * the table up one to open up space for the new leaf entry.
342 * Then adjust our index to match.
347 memmove(blp
, &blp
[1], mid
* sizeof(*blp
));
352 * Use a stale leaf for our new entry.
357 be32_to_cpu(blp
[lowstale
].address
) != XFS_DIR2_NULL_DATAPTR
;
360 for (highstale
= mid
+ 1;
361 highstale
< be32_to_cpu(btp
->count
) &&
362 be32_to_cpu(blp
[highstale
].address
) != XFS_DIR2_NULL_DATAPTR
&&
363 (lowstale
< 0 || mid
- lowstale
> highstale
- mid
);
367 * Move entries toward the low-numbered stale entry.
370 (highstale
== be32_to_cpu(btp
->count
) ||
371 mid
- lowstale
<= highstale
- mid
)) {
373 memmove(&blp
[lowstale
], &blp
[lowstale
+ 1],
374 (mid
- lowstale
) * sizeof(*blp
));
375 lfloglow
= MIN(lowstale
, lfloglow
);
376 lfloghigh
= MAX(mid
, lfloghigh
);
379 * Move entries toward the high-numbered stale entry.
382 ASSERT(highstale
< be32_to_cpu(btp
->count
));
385 memmove(&blp
[mid
+ 1], &blp
[mid
],
386 (highstale
- mid
) * sizeof(*blp
));
387 lfloglow
= MIN(mid
, lfloglow
);
388 lfloghigh
= MAX(highstale
, lfloghigh
);
390 be32_add_cpu(&btp
->stale
, -1);
393 * Point to the new data entry.
395 dep
= (xfs_dir2_data_entry_t
*)dup
;
397 * Fill in the leaf entry.
399 blp
[mid
].hashval
= cpu_to_be32(args
->hashval
);
400 blp
[mid
].address
= cpu_to_be32(xfs_dir2_byte_to_dataptr(mp
,
401 (char *)dep
- (char *)block
));
402 xfs_dir2_block_log_leaf(tp
, bp
, lfloglow
, lfloghigh
);
404 * Mark space for the data entry used.
406 xfs_dir2_data_use_free(tp
, bp
, dup
,
407 (xfs_dir2_data_aoff_t
)((char *)dup
- (char *)block
),
408 (xfs_dir2_data_aoff_t
)len
, &needlog
, &needscan
);
410 * Create the new data entry.
412 dep
->inumber
= cpu_to_be64(args
->inumber
);
413 dep
->namelen
= args
->namelen
;
414 memcpy(dep
->name
, args
->name
, args
->namelen
);
415 tagp
= xfs_dir2_data_entry_tag_p(dep
);
416 *tagp
= cpu_to_be16((char *)dep
- (char *)block
);
418 * Clean up the bestfree array and log the header, tail, and entry.
421 xfs_dir2_data_freescan(mp
, (xfs_dir2_data_t
*)block
, &needlog
);
423 xfs_dir2_data_log_header(tp
, bp
);
424 xfs_dir2_block_log_tail(tp
, bp
);
425 xfs_dir2_data_log_entry(tp
, bp
, dep
);
426 xfs_dir2_data_check(dp
, bp
);
432 * Readdir for block directories.
435 xfs_dir2_block_getdents(
436 xfs_inode_t
*dp
, /* incore inode */
441 xfs_dir2_block_t
*block
; /* directory block structure */
442 xfs_dabuf_t
*bp
; /* buffer for block */
443 xfs_dir2_block_tail_t
*btp
; /* block tail */
444 xfs_dir2_data_entry_t
*dep
; /* block data entry */
445 xfs_dir2_data_unused_t
*dup
; /* block unused entry */
446 char *endptr
; /* end of the data entries */
447 int error
; /* error return value */
448 xfs_mount_t
*mp
; /* filesystem mount point */
449 char *ptr
; /* current data entry */
450 int wantoff
; /* starting block offset */
455 * If the block number in the offset is out of range, we're done.
457 if (xfs_dir2_dataptr_to_db(mp
, *offset
) > mp
->m_dirdatablk
) {
461 * Can't read the block, give up, else get dabuf in bp.
463 error
= xfs_da_read_buf(NULL
, dp
, mp
->m_dirdatablk
, -1,
470 * Extract the byte offset we start at from the seek pointer.
471 * We'll skip entries before this.
473 wantoff
= xfs_dir2_dataptr_to_off(mp
, *offset
);
475 xfs_dir2_data_check(dp
, bp
);
477 * Set up values for the loop.
479 btp
= xfs_dir2_block_tail_p(mp
, block
);
480 ptr
= (char *)block
->u
;
481 endptr
= (char *)xfs_dir2_block_leaf_p(btp
);
484 * Loop over the data portion of the block.
485 * Each object is a real entry (dep) or an unused one (dup).
487 while (ptr
< endptr
) {
488 dup
= (xfs_dir2_data_unused_t
*)ptr
;
492 if (be16_to_cpu(dup
->freetag
) == XFS_DIR2_DATA_FREE_TAG
) {
493 ptr
+= be16_to_cpu(dup
->length
);
497 dep
= (xfs_dir2_data_entry_t
*)ptr
;
500 * Bump pointer for the next iteration.
502 ptr
+= xfs_dir2_data_entsize(dep
->namelen
);
504 * The entry is before the desired starting point, skip it.
506 if ((char *)dep
- (char *)block
< wantoff
)
509 cook
= xfs_dir2_db_off_to_dataptr(mp
, mp
->m_dirdatablk
,
510 (char *)dep
- (char *)block
);
513 * If it didn't fit, set the final offset to here & return.
515 if (filldir(dirent
, dep
->name
, dep
->namelen
, cook
& 0x7fffffff,
516 be64_to_cpu(dep
->inumber
), DT_UNKNOWN
)) {
517 *offset
= cook
& 0x7fffffff;
518 xfs_da_brelse(NULL
, bp
);
524 * Reached the end of the block.
525 * Set the offset to a non-existent block 1 and return.
527 *offset
= xfs_dir2_db_off_to_dataptr(mp
, mp
->m_dirdatablk
+ 1, 0) &
529 xfs_da_brelse(NULL
, bp
);
534 * Log leaf entries from the block.
537 xfs_dir2_block_log_leaf(
538 xfs_trans_t
*tp
, /* transaction structure */
539 xfs_dabuf_t
*bp
, /* block buffer */
540 int first
, /* index of first logged leaf */
541 int last
) /* index of last logged leaf */
543 xfs_dir2_block_t
*block
; /* directory block structure */
544 xfs_dir2_leaf_entry_t
*blp
; /* block leaf entries */
545 xfs_dir2_block_tail_t
*btp
; /* block tail */
546 xfs_mount_t
*mp
; /* filesystem mount point */
550 btp
= xfs_dir2_block_tail_p(mp
, block
);
551 blp
= xfs_dir2_block_leaf_p(btp
);
552 xfs_da_log_buf(tp
, bp
, (uint
)((char *)&blp
[first
] - (char *)block
),
553 (uint
)((char *)&blp
[last
+ 1] - (char *)block
- 1));
557 * Log the block tail.
560 xfs_dir2_block_log_tail(
561 xfs_trans_t
*tp
, /* transaction structure */
562 xfs_dabuf_t
*bp
) /* block buffer */
564 xfs_dir2_block_t
*block
; /* directory block structure */
565 xfs_dir2_block_tail_t
*btp
; /* block tail */
566 xfs_mount_t
*mp
; /* filesystem mount point */
570 btp
= xfs_dir2_block_tail_p(mp
, block
);
571 xfs_da_log_buf(tp
, bp
, (uint
)((char *)btp
- (char *)block
),
572 (uint
)((char *)(btp
+ 1) - (char *)block
- 1));
576 * Look up an entry in the block. This is the external routine,
577 * xfs_dir2_block_lookup_int does the real work.
580 xfs_dir2_block_lookup(
581 xfs_da_args_t
*args
) /* dir lookup arguments */
583 xfs_dir2_block_t
*block
; /* block structure */
584 xfs_dir2_leaf_entry_t
*blp
; /* block leaf entries */
585 xfs_dabuf_t
*bp
; /* block buffer */
586 xfs_dir2_block_tail_t
*btp
; /* block tail */
587 xfs_dir2_data_entry_t
*dep
; /* block data entry */
588 xfs_inode_t
*dp
; /* incore inode */
589 int ent
; /* entry index */
590 int error
; /* error return value */
591 xfs_mount_t
*mp
; /* filesystem mount point */
593 xfs_dir2_trace_args("block_lookup", args
);
595 * Get the buffer, look up the entry.
596 * If not found (ENOENT) then return, have no buffer.
598 if ((error
= xfs_dir2_block_lookup_int(args
, &bp
, &ent
)))
603 xfs_dir2_data_check(dp
, bp
);
604 btp
= xfs_dir2_block_tail_p(mp
, block
);
605 blp
= xfs_dir2_block_leaf_p(btp
);
607 * Get the offset from the leaf entry, to point to the data.
609 dep
= (xfs_dir2_data_entry_t
*)((char *)block
+
610 xfs_dir2_dataptr_to_off(mp
, be32_to_cpu(blp
[ent
].address
)));
612 * Fill in inode number, CI name if appropriate, release the block.
614 args
->inumber
= be64_to_cpu(dep
->inumber
);
615 error
= xfs_dir_cilookup_result(args
, dep
->name
, dep
->namelen
);
616 xfs_da_brelse(args
->trans
, bp
);
617 return XFS_ERROR(error
);
621 * Internal block lookup routine.
623 static int /* error */
624 xfs_dir2_block_lookup_int(
625 xfs_da_args_t
*args
, /* dir lookup arguments */
626 xfs_dabuf_t
**bpp
, /* returned block buffer */
627 int *entno
) /* returned entry number */
629 xfs_dir2_dataptr_t addr
; /* data entry address */
630 xfs_dir2_block_t
*block
; /* block structure */
631 xfs_dir2_leaf_entry_t
*blp
; /* block leaf entries */
632 xfs_dabuf_t
*bp
; /* block buffer */
633 xfs_dir2_block_tail_t
*btp
; /* block tail */
634 xfs_dir2_data_entry_t
*dep
; /* block data entry */
635 xfs_inode_t
*dp
; /* incore inode */
636 int error
; /* error return value */
637 xfs_dahash_t hash
; /* found hash value */
638 int high
; /* binary search high index */
639 int low
; /* binary search low index */
640 int mid
; /* binary search current idx */
641 xfs_mount_t
*mp
; /* filesystem mount point */
642 xfs_trans_t
*tp
; /* transaction pointer */
643 enum xfs_dacmp cmp
; /* comparison result */
649 * Read the buffer, return error if we can't get it.
652 xfs_da_read_buf(tp
, dp
, mp
->m_dirdatablk
, -1, &bp
, XFS_DATA_FORK
))) {
657 xfs_dir2_data_check(dp
, bp
);
658 btp
= xfs_dir2_block_tail_p(mp
, block
);
659 blp
= xfs_dir2_block_leaf_p(btp
);
661 * Loop doing a binary search for our hash value.
662 * Find our entry, ENOENT if it's not there.
664 for (low
= 0, high
= be32_to_cpu(btp
->count
) - 1; ; ) {
666 mid
= (low
+ high
) >> 1;
667 if ((hash
= be32_to_cpu(blp
[mid
].hashval
)) == args
->hashval
)
669 if (hash
< args
->hashval
)
674 ASSERT(args
->op_flags
& XFS_DA_OP_OKNOENT
);
675 xfs_da_brelse(tp
, bp
);
676 return XFS_ERROR(ENOENT
);
680 * Back up to the first one with the right hash value.
682 while (mid
> 0 && be32_to_cpu(blp
[mid
- 1].hashval
) == args
->hashval
) {
686 * Now loop forward through all the entries with the
687 * right hash value looking for our name.
690 if ((addr
= be32_to_cpu(blp
[mid
].address
)) == XFS_DIR2_NULL_DATAPTR
)
693 * Get pointer to the entry from the leaf.
695 dep
= (xfs_dir2_data_entry_t
*)
696 ((char *)block
+ xfs_dir2_dataptr_to_off(mp
, addr
));
698 * Compare name and if it's an exact match, return the index
699 * and buffer. If it's the first case-insensitive match, store
700 * the index and buffer and continue looking for an exact match.
702 cmp
= mp
->m_dirnameops
->compname(args
, dep
->name
, dep
->namelen
);
703 if (cmp
!= XFS_CMP_DIFFERENT
&& cmp
!= args
->cmpresult
) {
704 args
->cmpresult
= cmp
;
707 if (cmp
== XFS_CMP_EXACT
)
710 } while (++mid
< be32_to_cpu(btp
->count
) &&
711 be32_to_cpu(blp
[mid
].hashval
) == hash
);
713 ASSERT(args
->op_flags
& XFS_DA_OP_OKNOENT
);
715 * Here, we can only be doing a lookup (not a rename or replace).
716 * If a case-insensitive match was found earlier, return success.
718 if (args
->cmpresult
== XFS_CMP_CASE
)
721 * No match, release the buffer and return ENOENT.
723 xfs_da_brelse(tp
, bp
);
724 return XFS_ERROR(ENOENT
);
728 * Remove an entry from a block format directory.
729 * If that makes the block small enough to fit in shortform, transform it.
732 xfs_dir2_block_removename(
733 xfs_da_args_t
*args
) /* directory operation args */
735 xfs_dir2_block_t
*block
; /* block structure */
736 xfs_dir2_leaf_entry_t
*blp
; /* block leaf pointer */
737 xfs_dabuf_t
*bp
; /* block buffer */
738 xfs_dir2_block_tail_t
*btp
; /* block tail */
739 xfs_dir2_data_entry_t
*dep
; /* block data entry */
740 xfs_inode_t
*dp
; /* incore inode */
741 int ent
; /* block leaf entry index */
742 int error
; /* error return value */
743 xfs_mount_t
*mp
; /* filesystem mount point */
744 int needlog
; /* need to log block header */
745 int needscan
; /* need to fixup bestfree */
746 xfs_dir2_sf_hdr_t sfh
; /* shortform header */
747 int size
; /* shortform size */
748 xfs_trans_t
*tp
; /* transaction pointer */
750 xfs_dir2_trace_args("block_removename", args
);
752 * Look up the entry in the block. Gets the buffer and entry index.
753 * It will always be there, the vnodeops level does a lookup first.
755 if ((error
= xfs_dir2_block_lookup_int(args
, &bp
, &ent
))) {
762 btp
= xfs_dir2_block_tail_p(mp
, block
);
763 blp
= xfs_dir2_block_leaf_p(btp
);
765 * Point to the data entry using the leaf entry.
767 dep
= (xfs_dir2_data_entry_t
*)
768 ((char *)block
+ xfs_dir2_dataptr_to_off(mp
, be32_to_cpu(blp
[ent
].address
)));
770 * Mark the data entry's space free.
772 needlog
= needscan
= 0;
773 xfs_dir2_data_make_free(tp
, bp
,
774 (xfs_dir2_data_aoff_t
)((char *)dep
- (char *)block
),
775 xfs_dir2_data_entsize(dep
->namelen
), &needlog
, &needscan
);
777 * Fix up the block tail.
779 be32_add_cpu(&btp
->stale
, 1);
780 xfs_dir2_block_log_tail(tp
, bp
);
782 * Remove the leaf entry by marking it stale.
784 blp
[ent
].address
= cpu_to_be32(XFS_DIR2_NULL_DATAPTR
);
785 xfs_dir2_block_log_leaf(tp
, bp
, ent
, ent
);
787 * Fix up bestfree, log the header if necessary.
790 xfs_dir2_data_freescan(mp
, (xfs_dir2_data_t
*)block
, &needlog
);
792 xfs_dir2_data_log_header(tp
, bp
);
793 xfs_dir2_data_check(dp
, bp
);
795 * See if the size as a shortform is good enough.
797 if ((size
= xfs_dir2_block_sfsize(dp
, block
, &sfh
)) >
798 XFS_IFORK_DSIZE(dp
)) {
803 * If it works, do the conversion.
805 return xfs_dir2_block_to_sf(args
, bp
, size
, &sfh
);
809 * Replace an entry in a V2 block directory.
810 * Change the inode number to the new value.
813 xfs_dir2_block_replace(
814 xfs_da_args_t
*args
) /* directory operation args */
816 xfs_dir2_block_t
*block
; /* block structure */
817 xfs_dir2_leaf_entry_t
*blp
; /* block leaf entries */
818 xfs_dabuf_t
*bp
; /* block buffer */
819 xfs_dir2_block_tail_t
*btp
; /* block tail */
820 xfs_dir2_data_entry_t
*dep
; /* block data entry */
821 xfs_inode_t
*dp
; /* incore inode */
822 int ent
; /* leaf entry index */
823 int error
; /* error return value */
824 xfs_mount_t
*mp
; /* filesystem mount point */
826 xfs_dir2_trace_args("block_replace", args
);
828 * Lookup the entry in the directory. Get buffer and entry index.
829 * This will always succeed since the caller has already done a lookup.
831 if ((error
= xfs_dir2_block_lookup_int(args
, &bp
, &ent
))) {
837 btp
= xfs_dir2_block_tail_p(mp
, block
);
838 blp
= xfs_dir2_block_leaf_p(btp
);
840 * Point to the data entry we need to change.
842 dep
= (xfs_dir2_data_entry_t
*)
843 ((char *)block
+ xfs_dir2_dataptr_to_off(mp
, be32_to_cpu(blp
[ent
].address
)));
844 ASSERT(be64_to_cpu(dep
->inumber
) != args
->inumber
);
846 * Change the inode number to the new value.
848 dep
->inumber
= cpu_to_be64(args
->inumber
);
849 xfs_dir2_data_log_entry(args
->trans
, bp
, dep
);
850 xfs_dir2_data_check(dp
, bp
);
856 * Qsort comparison routine for the block leaf entries.
858 static int /* sort order */
860 const void *a
, /* first leaf entry */
861 const void *b
) /* second leaf entry */
863 const xfs_dir2_leaf_entry_t
*la
; /* first leaf entry */
864 const xfs_dir2_leaf_entry_t
*lb
; /* second leaf entry */
868 return be32_to_cpu(la
->hashval
) < be32_to_cpu(lb
->hashval
) ? -1 :
869 (be32_to_cpu(la
->hashval
) > be32_to_cpu(lb
->hashval
) ? 1 : 0);
873 * Convert a V2 leaf directory to a V2 block directory if possible.
876 xfs_dir2_leaf_to_block(
877 xfs_da_args_t
*args
, /* operation arguments */
878 xfs_dabuf_t
*lbp
, /* leaf buffer */
879 xfs_dabuf_t
*dbp
) /* data buffer */
881 __be16
*bestsp
; /* leaf bests table */
882 xfs_dir2_block_t
*block
; /* block structure */
883 xfs_dir2_block_tail_t
*btp
; /* block tail */
884 xfs_inode_t
*dp
; /* incore directory inode */
885 xfs_dir2_data_unused_t
*dup
; /* unused data entry */
886 int error
; /* error return value */
887 int from
; /* leaf from index */
888 xfs_dir2_leaf_t
*leaf
; /* leaf structure */
889 xfs_dir2_leaf_entry_t
*lep
; /* leaf entry */
890 xfs_dir2_leaf_tail_t
*ltp
; /* leaf tail structure */
891 xfs_mount_t
*mp
; /* file system mount point */
892 int needlog
; /* need to log data header */
893 int needscan
; /* need to scan for bestfree */
894 xfs_dir2_sf_hdr_t sfh
; /* shortform header */
895 int size
; /* bytes used */
896 __be16
*tagp
; /* end of entry (tag) */
897 int to
; /* block/leaf to index */
898 xfs_trans_t
*tp
; /* transaction pointer */
900 xfs_dir2_trace_args_bb("leaf_to_block", args
, lbp
, dbp
);
905 ASSERT(be16_to_cpu(leaf
->hdr
.info
.magic
) == XFS_DIR2_LEAF1_MAGIC
);
906 ltp
= xfs_dir2_leaf_tail_p(mp
, leaf
);
908 * If there are data blocks other than the first one, take this
909 * opportunity to remove trailing empty data blocks that may have
910 * been left behind during no-space-reservation operations.
911 * These will show up in the leaf bests table.
913 while (dp
->i_d
.di_size
> mp
->m_dirblksize
) {
914 bestsp
= xfs_dir2_leaf_bests_p(ltp
);
915 if (be16_to_cpu(bestsp
[be32_to_cpu(ltp
->bestcount
) - 1]) ==
916 mp
->m_dirblksize
- (uint
)sizeof(block
->hdr
)) {
918 xfs_dir2_leaf_trim_data(args
, lbp
,
919 (xfs_dir2_db_t
)(be32_to_cpu(ltp
->bestcount
) - 1))))
927 * Read the data block if we don't already have it, give up if it fails.
930 (error
= xfs_da_read_buf(tp
, dp
, mp
->m_dirdatablk
, -1, &dbp
,
935 ASSERT(be32_to_cpu(block
->hdr
.magic
) == XFS_DIR2_DATA_MAGIC
);
937 * Size of the "leaf" area in the block.
939 size
= (uint
)sizeof(block
->tail
) +
940 (uint
)sizeof(*lep
) * (be16_to_cpu(leaf
->hdr
.count
) - be16_to_cpu(leaf
->hdr
.stale
));
942 * Look at the last data entry.
944 tagp
= (__be16
*)((char *)block
+ mp
->m_dirblksize
) - 1;
945 dup
= (xfs_dir2_data_unused_t
*)((char *)block
+ be16_to_cpu(*tagp
));
947 * If it's not free or is too short we can't do it.
949 if (be16_to_cpu(dup
->freetag
) != XFS_DIR2_DATA_FREE_TAG
||
950 be16_to_cpu(dup
->length
) < size
) {
955 * Start converting it to block form.
957 block
->hdr
.magic
= cpu_to_be32(XFS_DIR2_BLOCK_MAGIC
);
961 * Use up the space at the end of the block (blp/btp).
963 xfs_dir2_data_use_free(tp
, dbp
, dup
, mp
->m_dirblksize
- size
, size
,
964 &needlog
, &needscan
);
966 * Initialize the block tail.
968 btp
= xfs_dir2_block_tail_p(mp
, block
);
969 btp
->count
= cpu_to_be32(be16_to_cpu(leaf
->hdr
.count
) - be16_to_cpu(leaf
->hdr
.stale
));
971 xfs_dir2_block_log_tail(tp
, dbp
);
973 * Initialize the block leaf area. We compact out stale entries.
975 lep
= xfs_dir2_block_leaf_p(btp
);
976 for (from
= to
= 0; from
< be16_to_cpu(leaf
->hdr
.count
); from
++) {
977 if (be32_to_cpu(leaf
->ents
[from
].address
) == XFS_DIR2_NULL_DATAPTR
)
979 lep
[to
++] = leaf
->ents
[from
];
981 ASSERT(to
== be32_to_cpu(btp
->count
));
982 xfs_dir2_block_log_leaf(tp
, dbp
, 0, be32_to_cpu(btp
->count
) - 1);
984 * Scan the bestfree if we need it and log the data block header.
987 xfs_dir2_data_freescan(mp
, (xfs_dir2_data_t
*)block
, &needlog
);
989 xfs_dir2_data_log_header(tp
, dbp
);
991 * Pitch the old leaf block.
993 error
= xfs_da_shrink_inode(args
, mp
->m_dirleafblk
, lbp
);
999 * Now see if the resulting block can be shrunken to shortform.
1001 if ((size
= xfs_dir2_block_sfsize(dp
, block
, &sfh
)) >
1002 XFS_IFORK_DSIZE(dp
)) {
1006 return xfs_dir2_block_to_sf(args
, dbp
, size
, &sfh
);
1009 xfs_da_buf_done(lbp
);
1011 xfs_da_buf_done(dbp
);
1016 * Convert the shortform directory to block form.
1019 xfs_dir2_sf_to_block(
1020 xfs_da_args_t
*args
) /* operation arguments */
1022 xfs_dir2_db_t blkno
; /* dir-relative block # (0) */
1023 xfs_dir2_block_t
*block
; /* block structure */
1024 xfs_dir2_leaf_entry_t
*blp
; /* block leaf entries */
1025 xfs_dabuf_t
*bp
; /* block buffer */
1026 xfs_dir2_block_tail_t
*btp
; /* block tail pointer */
1027 char *buf
; /* sf buffer */
1029 xfs_dir2_data_entry_t
*dep
; /* data entry pointer */
1030 xfs_inode_t
*dp
; /* incore directory inode */
1031 int dummy
; /* trash */
1032 xfs_dir2_data_unused_t
*dup
; /* unused entry pointer */
1033 int endoffset
; /* end of data objects */
1034 int error
; /* error return value */
1036 xfs_mount_t
*mp
; /* filesystem mount point */
1037 int needlog
; /* need to log block header */
1038 int needscan
; /* need to scan block freespc */
1039 int newoffset
; /* offset from current entry */
1040 int offset
; /* target block offset */
1041 xfs_dir2_sf_entry_t
*sfep
; /* sf entry pointer */
1042 xfs_dir2_sf_t
*sfp
; /* shortform structure */
1043 __be16
*tagp
; /* end of data entry */
1044 xfs_trans_t
*tp
; /* transaction pointer */
1045 struct xfs_name name
;
1047 xfs_dir2_trace_args("sf_to_block", args
);
1051 ASSERT(dp
->i_df
.if_flags
& XFS_IFINLINE
);
1053 * Bomb out if the shortform directory is way too short.
1055 if (dp
->i_d
.di_size
< offsetof(xfs_dir2_sf_hdr_t
, parent
)) {
1056 ASSERT(XFS_FORCED_SHUTDOWN(mp
));
1057 return XFS_ERROR(EIO
);
1059 ASSERT(dp
->i_df
.if_bytes
== dp
->i_d
.di_size
);
1060 ASSERT(dp
->i_df
.if_u1
.if_data
!= NULL
);
1061 sfp
= (xfs_dir2_sf_t
*)dp
->i_df
.if_u1
.if_data
;
1062 ASSERT(dp
->i_d
.di_size
>= xfs_dir2_sf_hdr_size(sfp
->hdr
.i8count
));
1064 * Copy the directory into the stack buffer.
1065 * Then pitch the incore inode data so we can make extents.
1068 buf_len
= dp
->i_df
.if_bytes
;
1069 buf
= kmem_alloc(dp
->i_df
.if_bytes
, KM_SLEEP
);
1071 memcpy(buf
, sfp
, dp
->i_df
.if_bytes
);
1072 xfs_idata_realloc(dp
, -dp
->i_df
.if_bytes
, XFS_DATA_FORK
);
1073 dp
->i_d
.di_size
= 0;
1074 xfs_trans_log_inode(tp
, dp
, XFS_ILOG_CORE
);
1076 * Reset pointer - old sfp is gone.
1078 sfp
= (xfs_dir2_sf_t
*)buf
;
1080 * Add block 0 to the inode.
1082 error
= xfs_dir2_grow_inode(args
, XFS_DIR2_DATA_SPACE
, &blkno
);
1088 * Initialize the data block.
1090 error
= xfs_dir2_data_init(args
, blkno
, &bp
);
1096 block
->hdr
.magic
= cpu_to_be32(XFS_DIR2_BLOCK_MAGIC
);
1098 * Compute size of block "tail" area.
1100 i
= (uint
)sizeof(*btp
) +
1101 (sfp
->hdr
.count
+ 2) * (uint
)sizeof(xfs_dir2_leaf_entry_t
);
1103 * The whole thing is initialized to free by the init routine.
1104 * Say we're using the leaf and tail area.
1106 dup
= (xfs_dir2_data_unused_t
*)block
->u
;
1107 needlog
= needscan
= 0;
1108 xfs_dir2_data_use_free(tp
, bp
, dup
, mp
->m_dirblksize
- i
, i
, &needlog
,
1110 ASSERT(needscan
== 0);
1114 btp
= xfs_dir2_block_tail_p(mp
, block
);
1115 btp
->count
= cpu_to_be32(sfp
->hdr
.count
+ 2); /* ., .. */
1117 blp
= xfs_dir2_block_leaf_p(btp
);
1118 endoffset
= (uint
)((char *)blp
- (char *)block
);
1120 * Remove the freespace, we'll manage it.
1122 xfs_dir2_data_use_free(tp
, bp
, dup
,
1123 (xfs_dir2_data_aoff_t
)((char *)dup
- (char *)block
),
1124 be16_to_cpu(dup
->length
), &needlog
, &needscan
);
1126 * Create entry for .
1128 dep
= (xfs_dir2_data_entry_t
*)
1129 ((char *)block
+ XFS_DIR2_DATA_DOT_OFFSET
);
1130 dep
->inumber
= cpu_to_be64(dp
->i_ino
);
1133 tagp
= xfs_dir2_data_entry_tag_p(dep
);
1134 *tagp
= cpu_to_be16((char *)dep
- (char *)block
);
1135 xfs_dir2_data_log_entry(tp
, bp
, dep
);
1136 blp
[0].hashval
= cpu_to_be32(xfs_dir_hash_dot
);
1137 blp
[0].address
= cpu_to_be32(xfs_dir2_byte_to_dataptr(mp
,
1138 (char *)dep
- (char *)block
));
1140 * Create entry for ..
1142 dep
= (xfs_dir2_data_entry_t
*)
1143 ((char *)block
+ XFS_DIR2_DATA_DOTDOT_OFFSET
);
1144 dep
->inumber
= cpu_to_be64(xfs_dir2_sf_get_inumber(sfp
, &sfp
->hdr
.parent
));
1146 dep
->name
[0] = dep
->name
[1] = '.';
1147 tagp
= xfs_dir2_data_entry_tag_p(dep
);
1148 *tagp
= cpu_to_be16((char *)dep
- (char *)block
);
1149 xfs_dir2_data_log_entry(tp
, bp
, dep
);
1150 blp
[1].hashval
= cpu_to_be32(xfs_dir_hash_dotdot
);
1151 blp
[1].address
= cpu_to_be32(xfs_dir2_byte_to_dataptr(mp
,
1152 (char *)dep
- (char *)block
));
1153 offset
= XFS_DIR2_DATA_FIRST_OFFSET
;
1155 * Loop over existing entries, stuff them in.
1157 if ((i
= 0) == sfp
->hdr
.count
)
1160 sfep
= xfs_dir2_sf_firstentry(sfp
);
1162 * Need to preserve the existing offset values in the sf directory.
1163 * Insert holes (unused entries) where necessary.
1165 while (offset
< endoffset
) {
1167 * sfep is null when we reach the end of the list.
1170 newoffset
= endoffset
;
1172 newoffset
= xfs_dir2_sf_get_offset(sfep
);
1174 * There should be a hole here, make one.
1176 if (offset
< newoffset
) {
1177 dup
= (xfs_dir2_data_unused_t
*)
1178 ((char *)block
+ offset
);
1179 dup
->freetag
= cpu_to_be16(XFS_DIR2_DATA_FREE_TAG
);
1180 dup
->length
= cpu_to_be16(newoffset
- offset
);
1181 *xfs_dir2_data_unused_tag_p(dup
) = cpu_to_be16(
1182 ((char *)dup
- (char *)block
));
1183 xfs_dir2_data_log_unused(tp
, bp
, dup
);
1184 (void)xfs_dir2_data_freeinsert((xfs_dir2_data_t
*)block
,
1186 offset
+= be16_to_cpu(dup
->length
);
1190 * Copy a real entry.
1192 dep
= (xfs_dir2_data_entry_t
*)((char *)block
+ newoffset
);
1193 dep
->inumber
= cpu_to_be64(xfs_dir2_sf_get_inumber(sfp
,
1194 xfs_dir2_sf_inumberp(sfep
)));
1195 dep
->namelen
= sfep
->namelen
;
1196 memcpy(dep
->name
, sfep
->name
, dep
->namelen
);
1197 tagp
= xfs_dir2_data_entry_tag_p(dep
);
1198 *tagp
= cpu_to_be16((char *)dep
- (char *)block
);
1199 xfs_dir2_data_log_entry(tp
, bp
, dep
);
1200 name
.name
= sfep
->name
;
1201 name
.len
= sfep
->namelen
;
1202 blp
[2 + i
].hashval
= cpu_to_be32(mp
->m_dirnameops
->
1204 blp
[2 + i
].address
= cpu_to_be32(xfs_dir2_byte_to_dataptr(mp
,
1205 (char *)dep
- (char *)block
));
1206 offset
= (int)((char *)(tagp
+ 1) - (char *)block
);
1207 if (++i
== sfp
->hdr
.count
)
1210 sfep
= xfs_dir2_sf_nextentry(sfp
, sfep
);
1212 /* Done with the temporary buffer */
1215 * Sort the leaf entries by hash value.
1217 xfs_sort(blp
, be32_to_cpu(btp
->count
), sizeof(*blp
), xfs_dir2_block_sort
);
1219 * Log the leaf entry area and tail.
1220 * Already logged the header in data_init, ignore needlog.
1222 ASSERT(needscan
== 0);
1223 xfs_dir2_block_log_leaf(tp
, bp
, 0, be32_to_cpu(btp
->count
) - 1);
1224 xfs_dir2_block_log_tail(tp
, bp
);
1225 xfs_dir2_data_check(dp
, bp
);
1226 xfs_da_buf_done(bp
);