2 * Copyright (c) 2000-2002,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"
24 #include "xfs_mount.h"
25 #include "xfs_da_format.h"
26 #include "xfs_da_btree.h"
27 #include "xfs_inode.h"
29 #include "xfs_dir2_priv.h"
30 #include "xfs_error.h"
31 #include "xfs_trans.h"
32 #include "xfs_buf_item.h"
33 #include "xfs_cksum.h"
36 * Check the consistency of the data block.
37 * The input can also be a block-format directory.
38 * Return 0 is the buffer is good, otherwise an error.
41 __xfs_dir3_data_check(
42 struct xfs_inode
*dp
, /* incore inode pointer */
43 struct xfs_buf
*bp
) /* data block's buffer */
45 xfs_dir2_dataptr_t addr
; /* addr for leaf lookup */
46 xfs_dir2_data_free_t
*bf
; /* bestfree table */
47 xfs_dir2_block_tail_t
*btp
=NULL
; /* block tail */
48 int count
; /* count of entries found */
49 xfs_dir2_data_hdr_t
*hdr
; /* data block header */
50 xfs_dir2_data_entry_t
*dep
; /* data entry */
51 xfs_dir2_data_free_t
*dfp
; /* bestfree entry */
52 xfs_dir2_data_unused_t
*dup
; /* unused entry */
53 char *endp
; /* end of useful data */
54 int freeseen
; /* mask of bestfrees seen */
55 xfs_dahash_t hash
; /* hash of current name */
56 int i
; /* leaf index */
57 int lastfree
; /* last entry was unused */
58 xfs_dir2_leaf_entry_t
*lep
=NULL
; /* block leaf entries */
59 xfs_mount_t
*mp
; /* filesystem mount point */
60 char *p
; /* current data position */
61 int stale
; /* count of stale leaves */
63 const struct xfs_dir_ops
*ops
;
64 struct xfs_da_geometry
*geo
;
66 mp
= bp
->b_target
->bt_mount
;
70 * We can be passed a null dp here from a verifier, so we need to go the
71 * hard way to get them.
73 ops
= xfs_dir_get_ops(mp
, dp
);
76 p
= (char *)ops
->data_entry_p(hdr
);
79 case cpu_to_be32(XFS_DIR3_BLOCK_MAGIC
):
80 case cpu_to_be32(XFS_DIR2_BLOCK_MAGIC
):
81 btp
= xfs_dir2_block_tail_p(geo
, hdr
);
82 lep
= xfs_dir2_block_leaf_p(btp
);
86 * The number of leaf entries is limited by the size of the
87 * block and the amount of space used by the data entries.
88 * We don't know how much space is used by the data entries yet,
89 * so just ensure that the count falls somewhere inside the
92 XFS_WANT_CORRUPTED_RETURN(mp
, be32_to_cpu(btp
->count
) <
93 ((char *)btp
- p
) / sizeof(struct xfs_dir2_leaf_entry
));
95 case cpu_to_be32(XFS_DIR3_DATA_MAGIC
):
96 case cpu_to_be32(XFS_DIR2_DATA_MAGIC
):
97 endp
= (char *)hdr
+ geo
->blksize
;
100 XFS_ERROR_REPORT("Bad Magic", XFS_ERRLEVEL_LOW
, mp
);
101 return -EFSCORRUPTED
;
105 * Account for zero bestfree entries.
107 bf
= ops
->data_bestfree_p(hdr
);
108 count
= lastfree
= freeseen
= 0;
110 XFS_WANT_CORRUPTED_RETURN(mp
, !bf
[0].offset
);
114 XFS_WANT_CORRUPTED_RETURN(mp
, !bf
[1].offset
);
118 XFS_WANT_CORRUPTED_RETURN(mp
, !bf
[2].offset
);
122 XFS_WANT_CORRUPTED_RETURN(mp
, be16_to_cpu(bf
[0].length
) >=
123 be16_to_cpu(bf
[1].length
));
124 XFS_WANT_CORRUPTED_RETURN(mp
, be16_to_cpu(bf
[1].length
) >=
125 be16_to_cpu(bf
[2].length
));
127 * Loop over the data/unused entries.
130 dup
= (xfs_dir2_data_unused_t
*)p
;
132 * If it's unused, look for the space in the bestfree table.
133 * If we find it, account for that, else make sure it
134 * doesn't need to be there.
136 if (be16_to_cpu(dup
->freetag
) == XFS_DIR2_DATA_FREE_TAG
) {
137 XFS_WANT_CORRUPTED_RETURN(mp
, lastfree
== 0);
138 XFS_WANT_CORRUPTED_RETURN(mp
,
139 be16_to_cpu(*xfs_dir2_data_unused_tag_p(dup
)) ==
140 (char *)dup
- (char *)hdr
);
141 dfp
= xfs_dir2_data_freefind(hdr
, bf
, dup
);
144 XFS_WANT_CORRUPTED_RETURN(mp
,
145 (freeseen
& (1 << i
)) == 0);
148 XFS_WANT_CORRUPTED_RETURN(mp
,
149 be16_to_cpu(dup
->length
) <=
150 be16_to_cpu(bf
[2].length
));
152 p
+= be16_to_cpu(dup
->length
);
157 * It's a real entry. Validate the fields.
158 * If this is a block directory then make sure it's
159 * in the leaf section of the block.
160 * The linear search is crude but this is DEBUG code.
162 dep
= (xfs_dir2_data_entry_t
*)p
;
163 XFS_WANT_CORRUPTED_RETURN(mp
, dep
->namelen
!= 0);
164 XFS_WANT_CORRUPTED_RETURN(mp
,
165 !xfs_dir_ino_validate(mp
, be64_to_cpu(dep
->inumber
)));
166 XFS_WANT_CORRUPTED_RETURN(mp
,
167 be16_to_cpu(*ops
->data_entry_tag_p(dep
)) ==
168 (char *)dep
- (char *)hdr
);
169 XFS_WANT_CORRUPTED_RETURN(mp
,
170 ops
->data_get_ftype(dep
) < XFS_DIR3_FT_MAX
);
173 if (hdr
->magic
== cpu_to_be32(XFS_DIR2_BLOCK_MAGIC
) ||
174 hdr
->magic
== cpu_to_be32(XFS_DIR3_BLOCK_MAGIC
)) {
175 addr
= xfs_dir2_db_off_to_dataptr(geo
, geo
->datablk
,
176 (xfs_dir2_data_aoff_t
)
177 ((char *)dep
- (char *)hdr
));
178 name
.name
= dep
->name
;
179 name
.len
= dep
->namelen
;
180 hash
= mp
->m_dirnameops
->hashname(&name
);
181 for (i
= 0; i
< be32_to_cpu(btp
->count
); i
++) {
182 if (be32_to_cpu(lep
[i
].address
) == addr
&&
183 be32_to_cpu(lep
[i
].hashval
) == hash
)
186 XFS_WANT_CORRUPTED_RETURN(mp
,
187 i
< be32_to_cpu(btp
->count
));
189 p
+= ops
->data_entsize(dep
->namelen
);
192 * Need to have seen all the entries and all the bestfree slots.
194 XFS_WANT_CORRUPTED_RETURN(mp
, freeseen
== 7);
195 if (hdr
->magic
== cpu_to_be32(XFS_DIR2_BLOCK_MAGIC
) ||
196 hdr
->magic
== cpu_to_be32(XFS_DIR3_BLOCK_MAGIC
)) {
197 for (i
= stale
= 0; i
< be32_to_cpu(btp
->count
); i
++) {
198 if (lep
[i
].address
==
199 cpu_to_be32(XFS_DIR2_NULL_DATAPTR
))
202 XFS_WANT_CORRUPTED_RETURN(mp
,
203 be32_to_cpu(lep
[i
].hashval
) >=
204 be32_to_cpu(lep
[i
- 1].hashval
));
206 XFS_WANT_CORRUPTED_RETURN(mp
, count
==
207 be32_to_cpu(btp
->count
) - be32_to_cpu(btp
->stale
));
208 XFS_WANT_CORRUPTED_RETURN(mp
, stale
== be32_to_cpu(btp
->stale
));
214 xfs_dir3_data_verify(
217 struct xfs_mount
*mp
= bp
->b_target
->bt_mount
;
218 struct xfs_dir3_blk_hdr
*hdr3
= bp
->b_addr
;
220 if (xfs_sb_version_hascrc(&mp
->m_sb
)) {
221 if (hdr3
->magic
!= cpu_to_be32(XFS_DIR3_DATA_MAGIC
))
223 if (!uuid_equal(&hdr3
->uuid
, &mp
->m_sb
.sb_meta_uuid
))
225 if (be64_to_cpu(hdr3
->blkno
) != bp
->b_bn
)
228 if (hdr3
->magic
!= cpu_to_be32(XFS_DIR2_DATA_MAGIC
))
231 if (__xfs_dir3_data_check(NULL
, bp
))
237 * Readahead of the first block of the directory when it is opened is completely
238 * oblivious to the format of the directory. Hence we can either get a block
239 * format buffer or a data format buffer on readahead.
242 xfs_dir3_data_reada_verify(
245 struct xfs_dir2_data_hdr
*hdr
= bp
->b_addr
;
247 switch (hdr
->magic
) {
248 case cpu_to_be32(XFS_DIR2_BLOCK_MAGIC
):
249 case cpu_to_be32(XFS_DIR3_BLOCK_MAGIC
):
250 bp
->b_ops
= &xfs_dir3_block_buf_ops
;
251 bp
->b_ops
->verify_read(bp
);
253 case cpu_to_be32(XFS_DIR2_DATA_MAGIC
):
254 case cpu_to_be32(XFS_DIR3_DATA_MAGIC
):
255 bp
->b_ops
= &xfs_dir3_data_buf_ops
;
256 bp
->b_ops
->verify_read(bp
);
259 xfs_buf_ioerror(bp
, -EFSCORRUPTED
);
260 xfs_verifier_error(bp
);
266 xfs_dir3_data_read_verify(
269 struct xfs_mount
*mp
= bp
->b_target
->bt_mount
;
271 if (xfs_sb_version_hascrc(&mp
->m_sb
) &&
272 !xfs_buf_verify_cksum(bp
, XFS_DIR3_DATA_CRC_OFF
))
273 xfs_buf_ioerror(bp
, -EFSBADCRC
);
274 else if (!xfs_dir3_data_verify(bp
))
275 xfs_buf_ioerror(bp
, -EFSCORRUPTED
);
278 xfs_verifier_error(bp
);
282 xfs_dir3_data_write_verify(
285 struct xfs_mount
*mp
= bp
->b_target
->bt_mount
;
286 struct xfs_buf_log_item
*bip
= bp
->b_fspriv
;
287 struct xfs_dir3_blk_hdr
*hdr3
= bp
->b_addr
;
289 if (!xfs_dir3_data_verify(bp
)) {
290 xfs_buf_ioerror(bp
, -EFSCORRUPTED
);
291 xfs_verifier_error(bp
);
295 if (!xfs_sb_version_hascrc(&mp
->m_sb
))
299 hdr3
->lsn
= cpu_to_be64(bip
->bli_item
.li_lsn
);
301 xfs_buf_update_cksum(bp
, XFS_DIR3_DATA_CRC_OFF
);
304 const struct xfs_buf_ops xfs_dir3_data_buf_ops
= {
305 .verify_read
= xfs_dir3_data_read_verify
,
306 .verify_write
= xfs_dir3_data_write_verify
,
309 static const struct xfs_buf_ops xfs_dir3_data_reada_buf_ops
= {
310 .verify_read
= xfs_dir3_data_reada_verify
,
311 .verify_write
= xfs_dir3_data_write_verify
,
317 struct xfs_trans
*tp
,
318 struct xfs_inode
*dp
,
320 xfs_daddr_t mapped_bno
,
321 struct xfs_buf
**bpp
)
325 err
= xfs_da_read_buf(tp
, dp
, bno
, mapped_bno
, bpp
,
326 XFS_DATA_FORK
, &xfs_dir3_data_buf_ops
);
328 xfs_trans_buf_set_type(tp
, *bpp
, XFS_BLFT_DIR_DATA_BUF
);
333 xfs_dir3_data_readahead(
334 struct xfs_inode
*dp
,
336 xfs_daddr_t mapped_bno
)
338 return xfs_da_reada_buf(dp
, bno
, mapped_bno
,
339 XFS_DATA_FORK
, &xfs_dir3_data_reada_buf_ops
);
343 * Given a data block and an unused entry from that block,
344 * return the bestfree entry if any that corresponds to it.
346 xfs_dir2_data_free_t
*
347 xfs_dir2_data_freefind(
348 struct xfs_dir2_data_hdr
*hdr
, /* data block header */
349 struct xfs_dir2_data_free
*bf
, /* bestfree table pointer */
350 struct xfs_dir2_data_unused
*dup
) /* unused space */
352 xfs_dir2_data_free_t
*dfp
; /* bestfree entry */
353 xfs_dir2_data_aoff_t off
; /* offset value needed */
355 int matched
; /* matched the value */
356 int seenzero
; /* saw a 0 bestfree entry */
359 off
= (xfs_dir2_data_aoff_t
)((char *)dup
- (char *)hdr
);
363 * Validate some consistency in the bestfree table.
364 * Check order, non-overlapping entries, and if we find the
365 * one we're looking for it has to be exact.
367 ASSERT(hdr
->magic
== cpu_to_be32(XFS_DIR2_DATA_MAGIC
) ||
368 hdr
->magic
== cpu_to_be32(XFS_DIR3_DATA_MAGIC
) ||
369 hdr
->magic
== cpu_to_be32(XFS_DIR2_BLOCK_MAGIC
) ||
370 hdr
->magic
== cpu_to_be32(XFS_DIR3_BLOCK_MAGIC
));
371 for (dfp
= &bf
[0], seenzero
= matched
= 0;
372 dfp
< &bf
[XFS_DIR2_DATA_FD_COUNT
];
375 ASSERT(!dfp
->length
);
379 ASSERT(seenzero
== 0);
380 if (be16_to_cpu(dfp
->offset
) == off
) {
382 ASSERT(dfp
->length
== dup
->length
);
383 } else if (off
< be16_to_cpu(dfp
->offset
))
384 ASSERT(off
+ be16_to_cpu(dup
->length
) <= be16_to_cpu(dfp
->offset
));
386 ASSERT(be16_to_cpu(dfp
->offset
) + be16_to_cpu(dfp
->length
) <= off
);
387 ASSERT(matched
|| be16_to_cpu(dfp
->length
) >= be16_to_cpu(dup
->length
));
389 ASSERT(be16_to_cpu(dfp
[-1].length
) >= be16_to_cpu(dfp
[0].length
));
393 * If this is smaller than the smallest bestfree entry,
394 * it can't be there since they're sorted.
396 if (be16_to_cpu(dup
->length
) <
397 be16_to_cpu(bf
[XFS_DIR2_DATA_FD_COUNT
- 1].length
))
400 * Look at the three bestfree entries for our guy.
402 for (dfp
= &bf
[0]; dfp
< &bf
[XFS_DIR2_DATA_FD_COUNT
]; dfp
++) {
405 if (be16_to_cpu(dfp
->offset
) == off
)
409 * Didn't find it. This only happens if there are duplicate lengths.
415 * Insert an unused-space entry into the bestfree table.
417 xfs_dir2_data_free_t
* /* entry inserted */
418 xfs_dir2_data_freeinsert(
419 struct xfs_dir2_data_hdr
*hdr
, /* data block pointer */
420 struct xfs_dir2_data_free
*dfp
, /* bestfree table pointer */
421 struct xfs_dir2_data_unused
*dup
, /* unused space */
422 int *loghead
) /* log the data header (out) */
424 xfs_dir2_data_free_t
new; /* new bestfree entry */
426 ASSERT(hdr
->magic
== cpu_to_be32(XFS_DIR2_DATA_MAGIC
) ||
427 hdr
->magic
== cpu_to_be32(XFS_DIR2_BLOCK_MAGIC
) ||
428 hdr
->magic
== cpu_to_be32(XFS_DIR3_DATA_MAGIC
) ||
429 hdr
->magic
== cpu_to_be32(XFS_DIR3_BLOCK_MAGIC
));
431 new.length
= dup
->length
;
432 new.offset
= cpu_to_be16((char *)dup
- (char *)hdr
);
435 * Insert at position 0, 1, or 2; or not at all.
437 if (be16_to_cpu(new.length
) > be16_to_cpu(dfp
[0].length
)) {
444 if (be16_to_cpu(new.length
) > be16_to_cpu(dfp
[1].length
)) {
450 if (be16_to_cpu(new.length
) > be16_to_cpu(dfp
[2].length
)) {
459 * Remove a bestfree entry from the table.
462 xfs_dir2_data_freeremove(
463 struct xfs_dir2_data_hdr
*hdr
, /* data block header */
464 struct xfs_dir2_data_free
*bf
, /* bestfree table pointer */
465 struct xfs_dir2_data_free
*dfp
, /* bestfree entry pointer */
466 int *loghead
) /* out: log data header */
469 ASSERT(hdr
->magic
== cpu_to_be32(XFS_DIR2_DATA_MAGIC
) ||
470 hdr
->magic
== cpu_to_be32(XFS_DIR2_BLOCK_MAGIC
) ||
471 hdr
->magic
== cpu_to_be32(XFS_DIR3_DATA_MAGIC
) ||
472 hdr
->magic
== cpu_to_be32(XFS_DIR3_BLOCK_MAGIC
));
475 * It's the first entry, slide the next 2 up.
482 * It's the second entry, slide the 3rd entry up.
484 else if (dfp
== &bf
[1])
487 * Must be the last entry.
490 ASSERT(dfp
== &bf
[2]);
492 * Clear the 3rd entry, must be zero now.
500 * Given a data block, reconstruct its bestfree map.
503 xfs_dir2_data_freescan(
504 struct xfs_inode
*dp
,
505 struct xfs_dir2_data_hdr
*hdr
,
508 xfs_dir2_block_tail_t
*btp
; /* block tail */
509 xfs_dir2_data_entry_t
*dep
; /* active data entry */
510 xfs_dir2_data_unused_t
*dup
; /* unused data entry */
511 struct xfs_dir2_data_free
*bf
;
512 char *endp
; /* end of block's data */
513 char *p
; /* current entry pointer */
514 struct xfs_da_geometry
*geo
= dp
->i_mount
->m_dir_geo
;
516 ASSERT(hdr
->magic
== cpu_to_be32(XFS_DIR2_DATA_MAGIC
) ||
517 hdr
->magic
== cpu_to_be32(XFS_DIR3_DATA_MAGIC
) ||
518 hdr
->magic
== cpu_to_be32(XFS_DIR2_BLOCK_MAGIC
) ||
519 hdr
->magic
== cpu_to_be32(XFS_DIR3_BLOCK_MAGIC
));
522 * Start by clearing the table.
524 bf
= dp
->d_ops
->data_bestfree_p(hdr
);
525 memset(bf
, 0, sizeof(*bf
) * XFS_DIR2_DATA_FD_COUNT
);
530 p
= (char *)dp
->d_ops
->data_entry_p(hdr
);
531 if (hdr
->magic
== cpu_to_be32(XFS_DIR2_BLOCK_MAGIC
) ||
532 hdr
->magic
== cpu_to_be32(XFS_DIR3_BLOCK_MAGIC
)) {
533 btp
= xfs_dir2_block_tail_p(geo
, hdr
);
534 endp
= (char *)xfs_dir2_block_leaf_p(btp
);
536 endp
= (char *)hdr
+ geo
->blksize
;
538 * Loop over the block's entries.
541 dup
= (xfs_dir2_data_unused_t
*)p
;
543 * If it's a free entry, insert it.
545 if (be16_to_cpu(dup
->freetag
) == XFS_DIR2_DATA_FREE_TAG
) {
546 ASSERT((char *)dup
- (char *)hdr
==
547 be16_to_cpu(*xfs_dir2_data_unused_tag_p(dup
)));
548 xfs_dir2_data_freeinsert(hdr
, bf
, dup
, loghead
);
549 p
+= be16_to_cpu(dup
->length
);
552 * For active entries, check their tags and skip them.
555 dep
= (xfs_dir2_data_entry_t
*)p
;
556 ASSERT((char *)dep
- (char *)hdr
==
557 be16_to_cpu(*dp
->d_ops
->data_entry_tag_p(dep
)));
558 p
+= dp
->d_ops
->data_entsize(dep
->namelen
);
564 * Initialize a data block at the given block number in the directory.
565 * Give back the buffer for the created block.
569 xfs_da_args_t
*args
, /* directory operation args */
570 xfs_dir2_db_t blkno
, /* logical dir block number */
571 struct xfs_buf
**bpp
) /* output block buffer */
573 struct xfs_buf
*bp
; /* block buffer */
574 xfs_dir2_data_hdr_t
*hdr
; /* data block header */
575 xfs_inode_t
*dp
; /* incore directory inode */
576 xfs_dir2_data_unused_t
*dup
; /* unused entry pointer */
577 struct xfs_dir2_data_free
*bf
;
578 int error
; /* error return value */
579 int i
; /* bestfree index */
580 xfs_mount_t
*mp
; /* filesystem mount point */
581 xfs_trans_t
*tp
; /* transaction pointer */
588 * Get the buffer set up for the block.
590 error
= xfs_da_get_buf(tp
, dp
, xfs_dir2_db_to_da(args
->geo
, blkno
),
591 -1, &bp
, XFS_DATA_FORK
);
594 bp
->b_ops
= &xfs_dir3_data_buf_ops
;
595 xfs_trans_buf_set_type(tp
, bp
, XFS_BLFT_DIR_DATA_BUF
);
598 * Initialize the header.
601 if (xfs_sb_version_hascrc(&mp
->m_sb
)) {
602 struct xfs_dir3_blk_hdr
*hdr3
= bp
->b_addr
;
604 memset(hdr3
, 0, sizeof(*hdr3
));
605 hdr3
->magic
= cpu_to_be32(XFS_DIR3_DATA_MAGIC
);
606 hdr3
->blkno
= cpu_to_be64(bp
->b_bn
);
607 hdr3
->owner
= cpu_to_be64(dp
->i_ino
);
608 uuid_copy(&hdr3
->uuid
, &mp
->m_sb
.sb_meta_uuid
);
611 hdr
->magic
= cpu_to_be32(XFS_DIR2_DATA_MAGIC
);
613 bf
= dp
->d_ops
->data_bestfree_p(hdr
);
614 bf
[0].offset
= cpu_to_be16(dp
->d_ops
->data_entry_offset
);
615 for (i
= 1; i
< XFS_DIR2_DATA_FD_COUNT
; i
++) {
621 * Set up an unused entry for the block's body.
623 dup
= dp
->d_ops
->data_unused_p(hdr
);
624 dup
->freetag
= cpu_to_be16(XFS_DIR2_DATA_FREE_TAG
);
626 t
= args
->geo
->blksize
- (uint
)dp
->d_ops
->data_entry_offset
;
627 bf
[0].length
= cpu_to_be16(t
);
628 dup
->length
= cpu_to_be16(t
);
629 *xfs_dir2_data_unused_tag_p(dup
) = cpu_to_be16((char *)dup
- (char *)hdr
);
631 * Log it and return it.
633 xfs_dir2_data_log_header(args
, bp
);
634 xfs_dir2_data_log_unused(args
, bp
, dup
);
640 * Log an active data entry from the block.
643 xfs_dir2_data_log_entry(
644 struct xfs_da_args
*args
,
646 xfs_dir2_data_entry_t
*dep
) /* data entry pointer */
648 struct xfs_dir2_data_hdr
*hdr
= bp
->b_addr
;
650 ASSERT(hdr
->magic
== cpu_to_be32(XFS_DIR2_DATA_MAGIC
) ||
651 hdr
->magic
== cpu_to_be32(XFS_DIR3_DATA_MAGIC
) ||
652 hdr
->magic
== cpu_to_be32(XFS_DIR2_BLOCK_MAGIC
) ||
653 hdr
->magic
== cpu_to_be32(XFS_DIR3_BLOCK_MAGIC
));
655 xfs_trans_log_buf(args
->trans
, bp
, (uint
)((char *)dep
- (char *)hdr
),
656 (uint
)((char *)(args
->dp
->d_ops
->data_entry_tag_p(dep
) + 1) -
661 * Log a data block header.
664 xfs_dir2_data_log_header(
665 struct xfs_da_args
*args
,
669 struct xfs_dir2_data_hdr
*hdr
= bp
->b_addr
;
671 ASSERT(hdr
->magic
== cpu_to_be32(XFS_DIR2_DATA_MAGIC
) ||
672 hdr
->magic
== cpu_to_be32(XFS_DIR3_DATA_MAGIC
) ||
673 hdr
->magic
== cpu_to_be32(XFS_DIR2_BLOCK_MAGIC
) ||
674 hdr
->magic
== cpu_to_be32(XFS_DIR3_BLOCK_MAGIC
));
677 xfs_trans_log_buf(args
->trans
, bp
, 0,
678 args
->dp
->d_ops
->data_entry_offset
- 1);
682 * Log a data unused entry.
685 xfs_dir2_data_log_unused(
686 struct xfs_da_args
*args
,
688 xfs_dir2_data_unused_t
*dup
) /* data unused pointer */
690 xfs_dir2_data_hdr_t
*hdr
= bp
->b_addr
;
692 ASSERT(hdr
->magic
== cpu_to_be32(XFS_DIR2_DATA_MAGIC
) ||
693 hdr
->magic
== cpu_to_be32(XFS_DIR3_DATA_MAGIC
) ||
694 hdr
->magic
== cpu_to_be32(XFS_DIR2_BLOCK_MAGIC
) ||
695 hdr
->magic
== cpu_to_be32(XFS_DIR3_BLOCK_MAGIC
));
698 * Log the first part of the unused entry.
700 xfs_trans_log_buf(args
->trans
, bp
, (uint
)((char *)dup
- (char *)hdr
),
701 (uint
)((char *)&dup
->length
+ sizeof(dup
->length
) -
704 * Log the end (tag) of the unused entry.
706 xfs_trans_log_buf(args
->trans
, bp
,
707 (uint
)((char *)xfs_dir2_data_unused_tag_p(dup
) - (char *)hdr
),
708 (uint
)((char *)xfs_dir2_data_unused_tag_p(dup
) - (char *)hdr
+
709 sizeof(xfs_dir2_data_off_t
) - 1));
713 * Make a byte range in the data block unused.
714 * Its current contents are unimportant.
717 xfs_dir2_data_make_free(
718 struct xfs_da_args
*args
,
720 xfs_dir2_data_aoff_t offset
, /* starting byte offset */
721 xfs_dir2_data_aoff_t len
, /* length in bytes */
722 int *needlogp
, /* out: log header */
723 int *needscanp
) /* out: regen bestfree */
725 xfs_dir2_data_hdr_t
*hdr
; /* data block pointer */
726 xfs_dir2_data_free_t
*dfp
; /* bestfree pointer */
727 char *endptr
; /* end of data area */
728 int needscan
; /* need to regen bestfree */
729 xfs_dir2_data_unused_t
*newdup
; /* new unused entry */
730 xfs_dir2_data_unused_t
*postdup
; /* unused entry after us */
731 xfs_dir2_data_unused_t
*prevdup
; /* unused entry before us */
732 struct xfs_dir2_data_free
*bf
;
737 * Figure out where the end of the data area is.
739 if (hdr
->magic
== cpu_to_be32(XFS_DIR2_DATA_MAGIC
) ||
740 hdr
->magic
== cpu_to_be32(XFS_DIR3_DATA_MAGIC
))
741 endptr
= (char *)hdr
+ args
->geo
->blksize
;
743 xfs_dir2_block_tail_t
*btp
; /* block tail */
745 ASSERT(hdr
->magic
== cpu_to_be32(XFS_DIR2_BLOCK_MAGIC
) ||
746 hdr
->magic
== cpu_to_be32(XFS_DIR3_BLOCK_MAGIC
));
747 btp
= xfs_dir2_block_tail_p(args
->geo
, hdr
);
748 endptr
= (char *)xfs_dir2_block_leaf_p(btp
);
751 * If this isn't the start of the block, then back up to
752 * the previous entry and see if it's free.
754 if (offset
> args
->dp
->d_ops
->data_entry_offset
) {
755 __be16
*tagp
; /* tag just before us */
757 tagp
= (__be16
*)((char *)hdr
+ offset
) - 1;
758 prevdup
= (xfs_dir2_data_unused_t
*)((char *)hdr
+ be16_to_cpu(*tagp
));
759 if (be16_to_cpu(prevdup
->freetag
) != XFS_DIR2_DATA_FREE_TAG
)
764 * If this isn't the end of the block, see if the entry after
767 if ((char *)hdr
+ offset
+ len
< endptr
) {
769 (xfs_dir2_data_unused_t
*)((char *)hdr
+ offset
+ len
);
770 if (be16_to_cpu(postdup
->freetag
) != XFS_DIR2_DATA_FREE_TAG
)
774 ASSERT(*needscanp
== 0);
777 * Previous and following entries are both free,
778 * merge everything into a single free entry.
780 bf
= args
->dp
->d_ops
->data_bestfree_p(hdr
);
781 if (prevdup
&& postdup
) {
782 xfs_dir2_data_free_t
*dfp2
; /* another bestfree pointer */
785 * See if prevdup and/or postdup are in bestfree table.
787 dfp
= xfs_dir2_data_freefind(hdr
, bf
, prevdup
);
788 dfp2
= xfs_dir2_data_freefind(hdr
, bf
, postdup
);
790 * We need a rescan unless there are exactly 2 free entries
791 * namely our two. Then we know what's happening, otherwise
792 * since the third bestfree is there, there might be more
795 needscan
= (bf
[2].length
!= 0);
797 * Fix up the new big freespace.
799 be16_add_cpu(&prevdup
->length
, len
+ be16_to_cpu(postdup
->length
));
800 *xfs_dir2_data_unused_tag_p(prevdup
) =
801 cpu_to_be16((char *)prevdup
- (char *)hdr
);
802 xfs_dir2_data_log_unused(args
, bp
, prevdup
);
805 * Has to be the case that entries 0 and 1 are
806 * dfp and dfp2 (don't know which is which), and
808 * Remove entry 1 first then entry 0.
816 xfs_dir2_data_freeremove(hdr
, bf
, dfp2
, needlogp
);
817 xfs_dir2_data_freeremove(hdr
, bf
, dfp
, needlogp
);
819 * Now insert the new entry.
821 dfp
= xfs_dir2_data_freeinsert(hdr
, bf
, prevdup
,
823 ASSERT(dfp
== &bf
[0]);
824 ASSERT(dfp
->length
== prevdup
->length
);
825 ASSERT(!dfp
[1].length
);
826 ASSERT(!dfp
[2].length
);
830 * The entry before us is free, merge with it.
833 dfp
= xfs_dir2_data_freefind(hdr
, bf
, prevdup
);
834 be16_add_cpu(&prevdup
->length
, len
);
835 *xfs_dir2_data_unused_tag_p(prevdup
) =
836 cpu_to_be16((char *)prevdup
- (char *)hdr
);
837 xfs_dir2_data_log_unused(args
, bp
, prevdup
);
839 * If the previous entry was in the table, the new entry
840 * is longer, so it will be in the table too. Remove
841 * the old one and add the new one.
844 xfs_dir2_data_freeremove(hdr
, bf
, dfp
, needlogp
);
845 xfs_dir2_data_freeinsert(hdr
, bf
, prevdup
, needlogp
);
848 * Otherwise we need a scan if the new entry is big enough.
851 needscan
= be16_to_cpu(prevdup
->length
) >
852 be16_to_cpu(bf
[2].length
);
856 * The following entry is free, merge with it.
859 dfp
= xfs_dir2_data_freefind(hdr
, bf
, postdup
);
860 newdup
= (xfs_dir2_data_unused_t
*)((char *)hdr
+ offset
);
861 newdup
->freetag
= cpu_to_be16(XFS_DIR2_DATA_FREE_TAG
);
862 newdup
->length
= cpu_to_be16(len
+ be16_to_cpu(postdup
->length
));
863 *xfs_dir2_data_unused_tag_p(newdup
) =
864 cpu_to_be16((char *)newdup
- (char *)hdr
);
865 xfs_dir2_data_log_unused(args
, bp
, newdup
);
867 * If the following entry was in the table, the new entry
868 * is longer, so it will be in the table too. Remove
869 * the old one and add the new one.
872 xfs_dir2_data_freeremove(hdr
, bf
, dfp
, needlogp
);
873 xfs_dir2_data_freeinsert(hdr
, bf
, newdup
, needlogp
);
876 * Otherwise we need a scan if the new entry is big enough.
879 needscan
= be16_to_cpu(newdup
->length
) >
880 be16_to_cpu(bf
[2].length
);
884 * Neither neighbor is free. Make a new entry.
887 newdup
= (xfs_dir2_data_unused_t
*)((char *)hdr
+ offset
);
888 newdup
->freetag
= cpu_to_be16(XFS_DIR2_DATA_FREE_TAG
);
889 newdup
->length
= cpu_to_be16(len
);
890 *xfs_dir2_data_unused_tag_p(newdup
) =
891 cpu_to_be16((char *)newdup
- (char *)hdr
);
892 xfs_dir2_data_log_unused(args
, bp
, newdup
);
893 xfs_dir2_data_freeinsert(hdr
, bf
, newdup
, needlogp
);
895 *needscanp
= needscan
;
899 * Take a byte range out of an existing unused space and make it un-free.
902 xfs_dir2_data_use_free(
903 struct xfs_da_args
*args
,
905 xfs_dir2_data_unused_t
*dup
, /* unused entry */
906 xfs_dir2_data_aoff_t offset
, /* starting offset to use */
907 xfs_dir2_data_aoff_t len
, /* length to use */
908 int *needlogp
, /* out: need to log header */
909 int *needscanp
) /* out: need regen bestfree */
911 xfs_dir2_data_hdr_t
*hdr
; /* data block header */
912 xfs_dir2_data_free_t
*dfp
; /* bestfree pointer */
913 int matchback
; /* matches end of freespace */
914 int matchfront
; /* matches start of freespace */
915 int needscan
; /* need to regen bestfree */
916 xfs_dir2_data_unused_t
*newdup
; /* new unused entry */
917 xfs_dir2_data_unused_t
*newdup2
; /* another new unused entry */
918 int oldlen
; /* old unused entry's length */
919 struct xfs_dir2_data_free
*bf
;
922 ASSERT(hdr
->magic
== cpu_to_be32(XFS_DIR2_DATA_MAGIC
) ||
923 hdr
->magic
== cpu_to_be32(XFS_DIR3_DATA_MAGIC
) ||
924 hdr
->magic
== cpu_to_be32(XFS_DIR2_BLOCK_MAGIC
) ||
925 hdr
->magic
== cpu_to_be32(XFS_DIR3_BLOCK_MAGIC
));
926 ASSERT(be16_to_cpu(dup
->freetag
) == XFS_DIR2_DATA_FREE_TAG
);
927 ASSERT(offset
>= (char *)dup
- (char *)hdr
);
928 ASSERT(offset
+ len
<= (char *)dup
+ be16_to_cpu(dup
->length
) - (char *)hdr
);
929 ASSERT((char *)dup
- (char *)hdr
== be16_to_cpu(*xfs_dir2_data_unused_tag_p(dup
)));
931 * Look up the entry in the bestfree table.
933 oldlen
= be16_to_cpu(dup
->length
);
934 bf
= args
->dp
->d_ops
->data_bestfree_p(hdr
);
935 dfp
= xfs_dir2_data_freefind(hdr
, bf
, dup
);
936 ASSERT(dfp
|| oldlen
<= be16_to_cpu(bf
[2].length
));
938 * Check for alignment with front and back of the entry.
940 matchfront
= (char *)dup
- (char *)hdr
== offset
;
941 matchback
= (char *)dup
+ oldlen
- (char *)hdr
== offset
+ len
;
942 ASSERT(*needscanp
== 0);
945 * If we matched it exactly we just need to get rid of it from
946 * the bestfree table.
948 if (matchfront
&& matchback
) {
950 needscan
= (bf
[2].offset
!= 0);
952 xfs_dir2_data_freeremove(hdr
, bf
, dfp
,
957 * We match the first part of the entry.
958 * Make a new entry with the remaining freespace.
960 else if (matchfront
) {
961 newdup
= (xfs_dir2_data_unused_t
*)((char *)hdr
+ offset
+ len
);
962 newdup
->freetag
= cpu_to_be16(XFS_DIR2_DATA_FREE_TAG
);
963 newdup
->length
= cpu_to_be16(oldlen
- len
);
964 *xfs_dir2_data_unused_tag_p(newdup
) =
965 cpu_to_be16((char *)newdup
- (char *)hdr
);
966 xfs_dir2_data_log_unused(args
, bp
, newdup
);
968 * If it was in the table, remove it and add the new one.
971 xfs_dir2_data_freeremove(hdr
, bf
, dfp
, needlogp
);
972 dfp
= xfs_dir2_data_freeinsert(hdr
, bf
, newdup
,
975 ASSERT(dfp
->length
== newdup
->length
);
976 ASSERT(be16_to_cpu(dfp
->offset
) == (char *)newdup
- (char *)hdr
);
978 * If we got inserted at the last slot,
979 * that means we don't know if there was a better
980 * choice for the last slot, or not. Rescan.
982 needscan
= dfp
== &bf
[2];
986 * We match the last part of the entry.
987 * Trim the allocated space off the tail of the entry.
989 else if (matchback
) {
991 newdup
->length
= cpu_to_be16(((char *)hdr
+ offset
) - (char *)newdup
);
992 *xfs_dir2_data_unused_tag_p(newdup
) =
993 cpu_to_be16((char *)newdup
- (char *)hdr
);
994 xfs_dir2_data_log_unused(args
, bp
, newdup
);
996 * If it was in the table, remove it and add the new one.
999 xfs_dir2_data_freeremove(hdr
, bf
, dfp
, needlogp
);
1000 dfp
= xfs_dir2_data_freeinsert(hdr
, bf
, newdup
,
1002 ASSERT(dfp
!= NULL
);
1003 ASSERT(dfp
->length
== newdup
->length
);
1004 ASSERT(be16_to_cpu(dfp
->offset
) == (char *)newdup
- (char *)hdr
);
1006 * If we got inserted at the last slot,
1007 * that means we don't know if there was a better
1008 * choice for the last slot, or not. Rescan.
1010 needscan
= dfp
== &bf
[2];
1014 * Poking out the middle of an entry.
1015 * Make two new entries.
1019 newdup
->length
= cpu_to_be16(((char *)hdr
+ offset
) - (char *)newdup
);
1020 *xfs_dir2_data_unused_tag_p(newdup
) =
1021 cpu_to_be16((char *)newdup
- (char *)hdr
);
1022 xfs_dir2_data_log_unused(args
, bp
, newdup
);
1023 newdup2
= (xfs_dir2_data_unused_t
*)((char *)hdr
+ offset
+ len
);
1024 newdup2
->freetag
= cpu_to_be16(XFS_DIR2_DATA_FREE_TAG
);
1025 newdup2
->length
= cpu_to_be16(oldlen
- len
- be16_to_cpu(newdup
->length
));
1026 *xfs_dir2_data_unused_tag_p(newdup2
) =
1027 cpu_to_be16((char *)newdup2
- (char *)hdr
);
1028 xfs_dir2_data_log_unused(args
, bp
, newdup2
);
1030 * If the old entry was in the table, we need to scan
1031 * if the 3rd entry was valid, since these entries
1032 * are smaller than the old one.
1033 * If we don't need to scan that means there were 1 or 2
1034 * entries in the table, and removing the old and adding
1035 * the 2 new will work.
1038 needscan
= (bf
[2].length
!= 0);
1040 xfs_dir2_data_freeremove(hdr
, bf
, dfp
,
1042 xfs_dir2_data_freeinsert(hdr
, bf
, newdup
,
1044 xfs_dir2_data_freeinsert(hdr
, bf
, newdup2
,
1049 *needscanp
= needscan
;