2 * Copyright (c) 2000-2005 Silicon Graphics, Inc.
3 * Copyright (c) 2013 Red Hat, Inc.
6 * This program is free software; you can redistribute it and/or
7 * modify it under the terms of the GNU General Public License as
8 * published by the Free Software Foundation.
10 * This program is distributed in the hope that it would be useful,
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 * GNU General Public License for more details.
15 * You should have received a copy of the GNU General Public License
16 * along with this program; if not, write the Free Software Foundation,
17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
21 #include "xfs_format.h"
22 #include "xfs_log_format.h"
23 #include "xfs_trans_resv.h"
26 #include "xfs_mount.h"
27 #include "xfs_da_format.h"
28 #include "xfs_da_btree.h"
29 #include "xfs_inode.h"
32 #include "xfs_dir2_priv.h"
33 #include "xfs_error.h"
34 #include "xfs_trace.h"
35 #include "xfs_trans.h"
36 #include "xfs_buf_item.h"
37 #include "xfs_cksum.h"
40 * Function declarations.
42 static int xfs_dir2_leafn_add(struct xfs_buf
*bp
, xfs_da_args_t
*args
,
44 static void xfs_dir2_leafn_rebalance(xfs_da_state_t
*state
,
45 xfs_da_state_blk_t
*blk1
,
46 xfs_da_state_blk_t
*blk2
);
47 static int xfs_dir2_leafn_remove(xfs_da_args_t
*args
, struct xfs_buf
*bp
,
48 int index
, xfs_da_state_blk_t
*dblk
,
50 static int xfs_dir2_node_addname_int(xfs_da_args_t
*args
,
51 xfs_da_state_blk_t
*fblk
);
54 * Check internal consistency of a leafn block.
57 #define xfs_dir3_leaf_check(dp, bp) \
59 if (!xfs_dir3_leafn_check((dp), (bp))) \
68 struct xfs_dir2_leaf
*leaf
= bp
->b_addr
;
69 struct xfs_dir3_icleaf_hdr leafhdr
;
71 dp
->d_ops
->leaf_hdr_from_disk(&leafhdr
, leaf
);
73 if (leafhdr
.magic
== XFS_DIR3_LEAFN_MAGIC
) {
74 struct xfs_dir3_leaf_hdr
*leaf3
= bp
->b_addr
;
75 if (be64_to_cpu(leaf3
->info
.blkno
) != bp
->b_bn
)
77 } else if (leafhdr
.magic
!= XFS_DIR2_LEAFN_MAGIC
)
80 return xfs_dir3_leaf_check_int(dp
->i_mount
, dp
, &leafhdr
, leaf
);
83 #define xfs_dir3_leaf_check(dp, bp)
90 struct xfs_mount
*mp
= bp
->b_target
->bt_mount
;
91 struct xfs_dir2_free_hdr
*hdr
= bp
->b_addr
;
93 if (xfs_sb_version_hascrc(&mp
->m_sb
)) {
94 struct xfs_dir3_blk_hdr
*hdr3
= bp
->b_addr
;
96 if (hdr3
->magic
!= cpu_to_be32(XFS_DIR3_FREE_MAGIC
))
98 if (!uuid_equal(&hdr3
->uuid
, &mp
->m_sb
.sb_uuid
))
100 if (be64_to_cpu(hdr3
->blkno
) != bp
->b_bn
)
103 if (hdr
->magic
!= cpu_to_be32(XFS_DIR2_FREE_MAGIC
))
107 /* XXX: should bounds check the xfs_dir3_icfree_hdr here */
113 xfs_dir3_free_read_verify(
116 struct xfs_mount
*mp
= bp
->b_target
->bt_mount
;
118 if (xfs_sb_version_hascrc(&mp
->m_sb
) &&
119 !xfs_buf_verify_cksum(bp
, XFS_DIR3_FREE_CRC_OFF
))
120 xfs_buf_ioerror(bp
, -EFSBADCRC
);
121 else if (!xfs_dir3_free_verify(bp
))
122 xfs_buf_ioerror(bp
, -EFSCORRUPTED
);
125 xfs_verifier_error(bp
);
129 xfs_dir3_free_write_verify(
132 struct xfs_mount
*mp
= bp
->b_target
->bt_mount
;
133 struct xfs_buf_log_item
*bip
= bp
->b_fspriv
;
134 struct xfs_dir3_blk_hdr
*hdr3
= bp
->b_addr
;
136 if (!xfs_dir3_free_verify(bp
)) {
137 xfs_buf_ioerror(bp
, -EFSCORRUPTED
);
138 xfs_verifier_error(bp
);
142 if (!xfs_sb_version_hascrc(&mp
->m_sb
))
146 hdr3
->lsn
= cpu_to_be64(bip
->bli_item
.li_lsn
);
148 xfs_buf_update_cksum(bp
, XFS_DIR3_FREE_CRC_OFF
);
151 const struct xfs_buf_ops xfs_dir3_free_buf_ops
= {
152 .verify_read
= xfs_dir3_free_read_verify
,
153 .verify_write
= xfs_dir3_free_write_verify
,
158 __xfs_dir3_free_read(
159 struct xfs_trans
*tp
,
160 struct xfs_inode
*dp
,
162 xfs_daddr_t mappedbno
,
163 struct xfs_buf
**bpp
)
167 err
= xfs_da_read_buf(tp
, dp
, fbno
, mappedbno
, bpp
,
168 XFS_DATA_FORK
, &xfs_dir3_free_buf_ops
);
170 /* try read returns without an error or *bpp if it lands in a hole */
171 if (!err
&& tp
&& *bpp
)
172 xfs_trans_buf_set_type(tp
, *bpp
, XFS_BLFT_DIR_FREE_BUF
);
178 struct xfs_trans
*tp
,
179 struct xfs_inode
*dp
,
181 struct xfs_buf
**bpp
)
183 return __xfs_dir3_free_read(tp
, dp
, fbno
, -1, bpp
);
187 xfs_dir2_free_try_read(
188 struct xfs_trans
*tp
,
189 struct xfs_inode
*dp
,
191 struct xfs_buf
**bpp
)
193 return __xfs_dir3_free_read(tp
, dp
, fbno
, -2, bpp
);
197 xfs_dir3_free_get_buf(
200 struct xfs_buf
**bpp
)
202 struct xfs_trans
*tp
= args
->trans
;
203 struct xfs_inode
*dp
= args
->dp
;
204 struct xfs_mount
*mp
= dp
->i_mount
;
207 struct xfs_dir3_icfree_hdr hdr
;
209 error
= xfs_da_get_buf(tp
, dp
, xfs_dir2_db_to_da(args
->geo
, fbno
),
210 -1, &bp
, XFS_DATA_FORK
);
214 xfs_trans_buf_set_type(tp
, bp
, XFS_BLFT_DIR_FREE_BUF
);
215 bp
->b_ops
= &xfs_dir3_free_buf_ops
;
218 * Initialize the new block to be empty, and remember
219 * its first slot as our empty slot.
221 memset(bp
->b_addr
, 0, sizeof(struct xfs_dir3_free_hdr
));
222 memset(&hdr
, 0, sizeof(hdr
));
224 if (xfs_sb_version_hascrc(&mp
->m_sb
)) {
225 struct xfs_dir3_free_hdr
*hdr3
= bp
->b_addr
;
227 hdr
.magic
= XFS_DIR3_FREE_MAGIC
;
229 hdr3
->hdr
.blkno
= cpu_to_be64(bp
->b_bn
);
230 hdr3
->hdr
.owner
= cpu_to_be64(dp
->i_ino
);
231 uuid_copy(&hdr3
->hdr
.uuid
, &mp
->m_sb
.sb_uuid
);
233 hdr
.magic
= XFS_DIR2_FREE_MAGIC
;
234 dp
->d_ops
->free_hdr_to_disk(bp
->b_addr
, &hdr
);
240 * Log entries from a freespace block.
243 xfs_dir2_free_log_bests(
244 struct xfs_da_args
*args
,
246 int first
, /* first entry to log */
247 int last
) /* last entry to log */
249 xfs_dir2_free_t
*free
; /* freespace structure */
253 bests
= args
->dp
->d_ops
->free_bests_p(free
);
254 ASSERT(free
->hdr
.magic
== cpu_to_be32(XFS_DIR2_FREE_MAGIC
) ||
255 free
->hdr
.magic
== cpu_to_be32(XFS_DIR3_FREE_MAGIC
));
256 xfs_trans_log_buf(args
->trans
, bp
,
257 (uint
)((char *)&bests
[first
] - (char *)free
),
258 (uint
)((char *)&bests
[last
] - (char *)free
+
259 sizeof(bests
[0]) - 1));
263 * Log header from a freespace block.
266 xfs_dir2_free_log_header(
267 struct xfs_da_args
*args
,
271 xfs_dir2_free_t
*free
; /* freespace structure */
274 ASSERT(free
->hdr
.magic
== cpu_to_be32(XFS_DIR2_FREE_MAGIC
) ||
275 free
->hdr
.magic
== cpu_to_be32(XFS_DIR3_FREE_MAGIC
));
277 xfs_trans_log_buf(args
->trans
, bp
, 0,
278 args
->dp
->d_ops
->free_hdr_size
- 1);
282 * Convert a leaf-format directory to a node-format directory.
283 * We need to change the magic number of the leaf block, and copy
284 * the freespace table out of the leaf block into its own block.
287 xfs_dir2_leaf_to_node(
288 xfs_da_args_t
*args
, /* operation arguments */
289 struct xfs_buf
*lbp
) /* leaf buffer */
291 xfs_inode_t
*dp
; /* incore directory inode */
292 int error
; /* error return value */
293 struct xfs_buf
*fbp
; /* freespace buffer */
294 xfs_dir2_db_t fdb
; /* freespace block number */
295 xfs_dir2_free_t
*free
; /* freespace structure */
296 __be16
*from
; /* pointer to freespace entry */
297 int i
; /* leaf freespace index */
298 xfs_dir2_leaf_t
*leaf
; /* leaf structure */
299 xfs_dir2_leaf_tail_t
*ltp
; /* leaf tail structure */
300 xfs_mount_t
*mp
; /* filesystem mount point */
301 int n
; /* count of live freespc ents */
302 xfs_dir2_data_off_t off
; /* freespace entry value */
303 __be16
*to
; /* pointer to freespace entry */
304 xfs_trans_t
*tp
; /* transaction pointer */
305 struct xfs_dir3_icfree_hdr freehdr
;
307 trace_xfs_dir2_leaf_to_node(args
);
313 * Add a freespace block to the directory.
315 if ((error
= xfs_dir2_grow_inode(args
, XFS_DIR2_FREE_SPACE
, &fdb
))) {
318 ASSERT(fdb
== xfs_dir2_byte_to_db(args
->geo
, XFS_DIR2_FREE_OFFSET
));
320 * Get the buffer for the new freespace block.
322 error
= xfs_dir3_free_get_buf(args
, fdb
, &fbp
);
327 dp
->d_ops
->free_hdr_from_disk(&freehdr
, free
);
329 ltp
= xfs_dir2_leaf_tail_p(args
->geo
, leaf
);
330 ASSERT(be32_to_cpu(ltp
->bestcount
) <=
331 (uint
)dp
->i_d
.di_size
/ args
->geo
->blksize
);
334 * Copy freespace entries from the leaf block to the new block.
335 * Count active entries.
337 from
= xfs_dir2_leaf_bests_p(ltp
);
338 to
= dp
->d_ops
->free_bests_p(free
);
339 for (i
= n
= 0; i
< be32_to_cpu(ltp
->bestcount
); i
++, from
++, to
++) {
340 if ((off
= be16_to_cpu(*from
)) != NULLDATAOFF
)
342 *to
= cpu_to_be16(off
);
346 * Now initialize the freespace block header.
349 freehdr
.nvalid
= be32_to_cpu(ltp
->bestcount
);
351 dp
->d_ops
->free_hdr_to_disk(fbp
->b_addr
, &freehdr
);
352 xfs_dir2_free_log_bests(args
, fbp
, 0, freehdr
.nvalid
- 1);
353 xfs_dir2_free_log_header(args
, fbp
);
356 * Converting the leaf to a leafnode is just a matter of changing the
357 * magic number and the ops. Do the change directly to the buffer as
358 * it's less work (and less code) than decoding the header to host
359 * format and back again.
361 if (leaf
->hdr
.info
.magic
== cpu_to_be16(XFS_DIR2_LEAF1_MAGIC
))
362 leaf
->hdr
.info
.magic
= cpu_to_be16(XFS_DIR2_LEAFN_MAGIC
);
364 leaf
->hdr
.info
.magic
= cpu_to_be16(XFS_DIR3_LEAFN_MAGIC
);
365 lbp
->b_ops
= &xfs_dir3_leafn_buf_ops
;
366 xfs_trans_buf_set_type(tp
, lbp
, XFS_BLFT_DIR_LEAFN_BUF
);
367 xfs_dir3_leaf_log_header(args
, lbp
);
368 xfs_dir3_leaf_check(dp
, lbp
);
373 * Add a leaf entry to a leaf block in a node-form directory.
374 * The other work necessary is done from the caller.
376 static int /* error */
378 struct xfs_buf
*bp
, /* leaf buffer */
379 xfs_da_args_t
*args
, /* operation arguments */
380 int index
) /* insertion pt for new entry */
382 int compact
; /* compacting stale leaves */
383 xfs_inode_t
*dp
; /* incore directory inode */
384 int highstale
; /* next stale entry */
385 xfs_dir2_leaf_t
*leaf
; /* leaf structure */
386 xfs_dir2_leaf_entry_t
*lep
; /* leaf entry */
387 int lfloghigh
; /* high leaf entry logging */
388 int lfloglow
; /* low leaf entry logging */
389 int lowstale
; /* previous stale entry */
390 xfs_mount_t
*mp
; /* filesystem mount point */
391 xfs_trans_t
*tp
; /* transaction pointer */
392 struct xfs_dir3_icleaf_hdr leafhdr
;
393 struct xfs_dir2_leaf_entry
*ents
;
395 trace_xfs_dir2_leafn_add(args
, index
);
401 dp
->d_ops
->leaf_hdr_from_disk(&leafhdr
, leaf
);
402 ents
= dp
->d_ops
->leaf_ents_p(leaf
);
405 * Quick check just to make sure we are not going to index
406 * into other peoples memory
409 return -EFSCORRUPTED
;
412 * If there are already the maximum number of leaf entries in
413 * the block, if there are no stale entries it won't fit.
414 * Caller will do a split. If there are stale entries we'll do
418 if (leafhdr
.count
== dp
->d_ops
->leaf_max_ents(args
->geo
)) {
421 compact
= leafhdr
.stale
> 1;
424 ASSERT(index
== 0 || be32_to_cpu(ents
[index
- 1].hashval
) <= args
->hashval
);
425 ASSERT(index
== leafhdr
.count
||
426 be32_to_cpu(ents
[index
].hashval
) >= args
->hashval
);
428 if (args
->op_flags
& XFS_DA_OP_JUSTCHECK
)
432 * Compact out all but one stale leaf entry. Leaves behind
433 * the entry closest to index.
436 xfs_dir3_leaf_compact_x1(&leafhdr
, ents
, &index
, &lowstale
,
437 &highstale
, &lfloglow
, &lfloghigh
);
438 else if (leafhdr
.stale
) {
440 * Set impossible logging indices for this case.
442 lfloglow
= leafhdr
.count
;
447 * Insert the new entry, log everything.
449 lep
= xfs_dir3_leaf_find_entry(&leafhdr
, ents
, index
, compact
, lowstale
,
450 highstale
, &lfloglow
, &lfloghigh
);
452 lep
->hashval
= cpu_to_be32(args
->hashval
);
453 lep
->address
= cpu_to_be32(xfs_dir2_db_off_to_dataptr(args
->geo
,
454 args
->blkno
, args
->index
));
456 dp
->d_ops
->leaf_hdr_to_disk(leaf
, &leafhdr
);
457 xfs_dir3_leaf_log_header(args
, bp
);
458 xfs_dir3_leaf_log_ents(args
, bp
, lfloglow
, lfloghigh
);
459 xfs_dir3_leaf_check(dp
, bp
);
465 xfs_dir2_free_hdr_check(
466 struct xfs_inode
*dp
,
470 struct xfs_dir3_icfree_hdr hdr
;
472 dp
->d_ops
->free_hdr_from_disk(&hdr
, bp
->b_addr
);
474 ASSERT((hdr
.firstdb
%
475 dp
->d_ops
->free_max_bests(dp
->i_mount
->m_dir_geo
)) == 0);
476 ASSERT(hdr
.firstdb
<= db
);
477 ASSERT(db
< hdr
.firstdb
+ hdr
.nvalid
);
480 #define xfs_dir2_free_hdr_check(dp, bp, db)
484 * Return the last hash value in the leaf.
485 * Stale entries are ok.
487 xfs_dahash_t
/* hash value */
488 xfs_dir2_leafn_lasthash(
489 struct xfs_inode
*dp
,
490 struct xfs_buf
*bp
, /* leaf buffer */
491 int *count
) /* count of entries in leaf */
493 struct xfs_dir2_leaf
*leaf
= bp
->b_addr
;
494 struct xfs_dir2_leaf_entry
*ents
;
495 struct xfs_dir3_icleaf_hdr leafhdr
;
497 dp
->d_ops
->leaf_hdr_from_disk(&leafhdr
, leaf
);
499 ASSERT(leafhdr
.magic
== XFS_DIR2_LEAFN_MAGIC
||
500 leafhdr
.magic
== XFS_DIR3_LEAFN_MAGIC
);
503 *count
= leafhdr
.count
;
507 ents
= dp
->d_ops
->leaf_ents_p(leaf
);
508 return be32_to_cpu(ents
[leafhdr
.count
- 1].hashval
);
512 * Look up a leaf entry for space to add a name in a node-format leaf block.
513 * The extrablk in state is a freespace block.
516 xfs_dir2_leafn_lookup_for_addname(
517 struct xfs_buf
*bp
, /* leaf buffer */
518 xfs_da_args_t
*args
, /* operation arguments */
519 int *indexp
, /* out: leaf entry index */
520 xfs_da_state_t
*state
) /* state to fill in */
522 struct xfs_buf
*curbp
= NULL
; /* current data/free buffer */
523 xfs_dir2_db_t curdb
= -1; /* current data block number */
524 xfs_dir2_db_t curfdb
= -1; /* current free block number */
525 xfs_inode_t
*dp
; /* incore directory inode */
526 int error
; /* error return value */
527 int fi
; /* free entry index */
528 xfs_dir2_free_t
*free
= NULL
; /* free block structure */
529 int index
; /* leaf entry index */
530 xfs_dir2_leaf_t
*leaf
; /* leaf structure */
531 int length
; /* length of new data entry */
532 xfs_dir2_leaf_entry_t
*lep
; /* leaf entry */
533 xfs_mount_t
*mp
; /* filesystem mount point */
534 xfs_dir2_db_t newdb
; /* new data block number */
535 xfs_dir2_db_t newfdb
; /* new free block number */
536 xfs_trans_t
*tp
; /* transaction pointer */
537 struct xfs_dir2_leaf_entry
*ents
;
538 struct xfs_dir3_icleaf_hdr leafhdr
;
544 dp
->d_ops
->leaf_hdr_from_disk(&leafhdr
, leaf
);
545 ents
= dp
->d_ops
->leaf_ents_p(leaf
);
547 xfs_dir3_leaf_check(dp
, bp
);
548 ASSERT(leafhdr
.count
> 0);
551 * Look up the hash value in the leaf entries.
553 index
= xfs_dir2_leaf_search_hash(args
, bp
);
555 * Do we have a buffer coming in?
557 if (state
->extravalid
) {
558 /* If so, it's a free block buffer, get the block number. */
559 curbp
= state
->extrablk
.bp
;
560 curfdb
= state
->extrablk
.blkno
;
561 free
= curbp
->b_addr
;
562 ASSERT(free
->hdr
.magic
== cpu_to_be32(XFS_DIR2_FREE_MAGIC
) ||
563 free
->hdr
.magic
== cpu_to_be32(XFS_DIR3_FREE_MAGIC
));
565 length
= dp
->d_ops
->data_entsize(args
->namelen
);
567 * Loop over leaf entries with the right hash value.
569 for (lep
= &ents
[index
];
570 index
< leafhdr
.count
&& be32_to_cpu(lep
->hashval
) == args
->hashval
;
573 * Skip stale leaf entries.
575 if (be32_to_cpu(lep
->address
) == XFS_DIR2_NULL_DATAPTR
)
578 * Pull the data block number from the entry.
580 newdb
= xfs_dir2_dataptr_to_db(args
->geo
,
581 be32_to_cpu(lep
->address
));
583 * For addname, we're looking for a place to put the new entry.
584 * We want to use a data block with an entry of equal
585 * hash value to ours if there is one with room.
587 * If this block isn't the data block we already have
588 * in hand, take a look at it.
590 if (newdb
!= curdb
) {
595 * Convert the data block to the free block
596 * holding its freespace information.
598 newfdb
= dp
->d_ops
->db_to_fdb(args
->geo
, newdb
);
600 * If it's not the one we have in hand, read it in.
602 if (newfdb
!= curfdb
) {
604 * If we had one before, drop it.
607 xfs_trans_brelse(tp
, curbp
);
609 error
= xfs_dir2_free_read(tp
, dp
,
610 xfs_dir2_db_to_da(args
->geo
,
615 free
= curbp
->b_addr
;
617 xfs_dir2_free_hdr_check(dp
, curbp
, curdb
);
620 * Get the index for our entry.
622 fi
= dp
->d_ops
->db_to_fdindex(args
->geo
, curdb
);
624 * If it has room, return it.
626 bests
= dp
->d_ops
->free_bests_p(free
);
627 if (unlikely(bests
[fi
] == cpu_to_be16(NULLDATAOFF
))) {
628 XFS_ERROR_REPORT("xfs_dir2_leafn_lookup_int",
629 XFS_ERRLEVEL_LOW
, mp
);
630 if (curfdb
!= newfdb
)
631 xfs_trans_brelse(tp
, curbp
);
632 return -EFSCORRUPTED
;
635 if (be16_to_cpu(bests
[fi
]) >= length
)
639 /* Didn't find any space */
642 ASSERT(args
->op_flags
& XFS_DA_OP_OKNOENT
);
644 /* Giving back a free block. */
645 state
->extravalid
= 1;
646 state
->extrablk
.bp
= curbp
;
647 state
->extrablk
.index
= fi
;
648 state
->extrablk
.blkno
= curfdb
;
651 * Important: this magic number is not in the buffer - it's for
652 * buffer type information and therefore only the free/data type
653 * matters here, not whether CRCs are enabled or not.
655 state
->extrablk
.magic
= XFS_DIR2_FREE_MAGIC
;
657 state
->extravalid
= 0;
660 * Return the index, that will be the insertion point.
667 * Look up a leaf entry in a node-format leaf block.
668 * The extrablk in state a data block.
671 xfs_dir2_leafn_lookup_for_entry(
672 struct xfs_buf
*bp
, /* leaf buffer */
673 xfs_da_args_t
*args
, /* operation arguments */
674 int *indexp
, /* out: leaf entry index */
675 xfs_da_state_t
*state
) /* state to fill in */
677 struct xfs_buf
*curbp
= NULL
; /* current data/free buffer */
678 xfs_dir2_db_t curdb
= -1; /* current data block number */
679 xfs_dir2_data_entry_t
*dep
; /* data block entry */
680 xfs_inode_t
*dp
; /* incore directory inode */
681 int error
; /* error return value */
682 int index
; /* leaf entry index */
683 xfs_dir2_leaf_t
*leaf
; /* leaf structure */
684 xfs_dir2_leaf_entry_t
*lep
; /* leaf entry */
685 xfs_mount_t
*mp
; /* filesystem mount point */
686 xfs_dir2_db_t newdb
; /* new data block number */
687 xfs_trans_t
*tp
; /* transaction pointer */
688 enum xfs_dacmp cmp
; /* comparison result */
689 struct xfs_dir2_leaf_entry
*ents
;
690 struct xfs_dir3_icleaf_hdr leafhdr
;
696 dp
->d_ops
->leaf_hdr_from_disk(&leafhdr
, leaf
);
697 ents
= dp
->d_ops
->leaf_ents_p(leaf
);
699 xfs_dir3_leaf_check(dp
, bp
);
700 ASSERT(leafhdr
.count
> 0);
703 * Look up the hash value in the leaf entries.
705 index
= xfs_dir2_leaf_search_hash(args
, bp
);
707 * Do we have a buffer coming in?
709 if (state
->extravalid
) {
710 curbp
= state
->extrablk
.bp
;
711 curdb
= state
->extrablk
.blkno
;
714 * Loop over leaf entries with the right hash value.
716 for (lep
= &ents
[index
];
717 index
< leafhdr
.count
&& be32_to_cpu(lep
->hashval
) == args
->hashval
;
720 * Skip stale leaf entries.
722 if (be32_to_cpu(lep
->address
) == XFS_DIR2_NULL_DATAPTR
)
725 * Pull the data block number from the entry.
727 newdb
= xfs_dir2_dataptr_to_db(args
->geo
,
728 be32_to_cpu(lep
->address
));
730 * Not adding a new entry, so we really want to find
731 * the name given to us.
733 * If it's a different data block, go get it.
735 if (newdb
!= curdb
) {
737 * If we had a block before that we aren't saving
738 * for a CI name, drop it
740 if (curbp
&& (args
->cmpresult
== XFS_CMP_DIFFERENT
||
741 curdb
!= state
->extrablk
.blkno
))
742 xfs_trans_brelse(tp
, curbp
);
744 * If needing the block that is saved with a CI match,
745 * use it otherwise read in the new data block.
747 if (args
->cmpresult
!= XFS_CMP_DIFFERENT
&&
748 newdb
== state
->extrablk
.blkno
) {
749 ASSERT(state
->extravalid
);
750 curbp
= state
->extrablk
.bp
;
752 error
= xfs_dir3_data_read(tp
, dp
,
753 xfs_dir2_db_to_da(args
->geo
,
759 xfs_dir3_data_check(dp
, curbp
);
763 * Point to the data entry.
765 dep
= (xfs_dir2_data_entry_t
*)((char *)curbp
->b_addr
+
766 xfs_dir2_dataptr_to_off(args
->geo
,
767 be32_to_cpu(lep
->address
)));
769 * Compare the entry and if it's an exact match, return
770 * EEXIST immediately. If it's the first case-insensitive
771 * match, store the block & inode number and continue looking.
773 cmp
= mp
->m_dirnameops
->compname(args
, dep
->name
, dep
->namelen
);
774 if (cmp
!= XFS_CMP_DIFFERENT
&& cmp
!= args
->cmpresult
) {
775 /* If there is a CI match block, drop it */
776 if (args
->cmpresult
!= XFS_CMP_DIFFERENT
&&
777 curdb
!= state
->extrablk
.blkno
)
778 xfs_trans_brelse(tp
, state
->extrablk
.bp
);
779 args
->cmpresult
= cmp
;
780 args
->inumber
= be64_to_cpu(dep
->inumber
);
781 args
->filetype
= dp
->d_ops
->data_get_ftype(dep
);
783 state
->extravalid
= 1;
784 state
->extrablk
.bp
= curbp
;
785 state
->extrablk
.blkno
= curdb
;
786 state
->extrablk
.index
= (int)((char *)dep
-
787 (char *)curbp
->b_addr
);
788 state
->extrablk
.magic
= XFS_DIR2_DATA_MAGIC
;
789 curbp
->b_ops
= &xfs_dir3_data_buf_ops
;
790 xfs_trans_buf_set_type(tp
, curbp
, XFS_BLFT_DIR_DATA_BUF
);
791 if (cmp
== XFS_CMP_EXACT
)
795 ASSERT(index
== leafhdr
.count
|| (args
->op_flags
& XFS_DA_OP_OKNOENT
));
797 if (args
->cmpresult
== XFS_CMP_DIFFERENT
) {
798 /* Giving back last used data block. */
799 state
->extravalid
= 1;
800 state
->extrablk
.bp
= curbp
;
801 state
->extrablk
.index
= -1;
802 state
->extrablk
.blkno
= curdb
;
803 state
->extrablk
.magic
= XFS_DIR2_DATA_MAGIC
;
804 curbp
->b_ops
= &xfs_dir3_data_buf_ops
;
805 xfs_trans_buf_set_type(tp
, curbp
, XFS_BLFT_DIR_DATA_BUF
);
807 /* If the curbp is not the CI match block, drop it */
808 if (state
->extrablk
.bp
!= curbp
)
809 xfs_trans_brelse(tp
, curbp
);
812 state
->extravalid
= 0;
819 * Look up a leaf entry in a node-format leaf block.
820 * If this is an addname then the extrablk in state is a freespace block,
821 * otherwise it's a data block.
824 xfs_dir2_leafn_lookup_int(
825 struct xfs_buf
*bp
, /* leaf buffer */
826 xfs_da_args_t
*args
, /* operation arguments */
827 int *indexp
, /* out: leaf entry index */
828 xfs_da_state_t
*state
) /* state to fill in */
830 if (args
->op_flags
& XFS_DA_OP_ADDNAME
)
831 return xfs_dir2_leafn_lookup_for_addname(bp
, args
, indexp
,
833 return xfs_dir2_leafn_lookup_for_entry(bp
, args
, indexp
, state
);
837 * Move count leaf entries from source to destination leaf.
838 * Log entries and headers. Stale entries are preserved.
841 xfs_dir3_leafn_moveents(
842 xfs_da_args_t
*args
, /* operation arguments */
843 struct xfs_buf
*bp_s
, /* source */
844 struct xfs_dir3_icleaf_hdr
*shdr
,
845 struct xfs_dir2_leaf_entry
*sents
,
846 int start_s
,/* source leaf index */
847 struct xfs_buf
*bp_d
, /* destination */
848 struct xfs_dir3_icleaf_hdr
*dhdr
,
849 struct xfs_dir2_leaf_entry
*dents
,
850 int start_d
,/* destination leaf index */
851 int count
) /* count of leaves to copy */
853 int stale
; /* count stale leaves copied */
855 trace_xfs_dir2_leafn_moveents(args
, start_s
, start_d
, count
);
858 * Silently return if nothing to do.
864 * If the destination index is not the end of the current
865 * destination leaf entries, open up a hole in the destination
866 * to hold the new entries.
868 if (start_d
< dhdr
->count
) {
869 memmove(&dents
[start_d
+ count
], &dents
[start_d
],
870 (dhdr
->count
- start_d
) * sizeof(xfs_dir2_leaf_entry_t
));
871 xfs_dir3_leaf_log_ents(args
, bp_d
, start_d
+ count
,
872 count
+ dhdr
->count
- 1);
875 * If the source has stale leaves, count the ones in the copy range
876 * so we can update the header correctly.
879 int i
; /* temp leaf index */
881 for (i
= start_s
, stale
= 0; i
< start_s
+ count
; i
++) {
882 if (sents
[i
].address
==
883 cpu_to_be32(XFS_DIR2_NULL_DATAPTR
))
889 * Copy the leaf entries from source to destination.
891 memcpy(&dents
[start_d
], &sents
[start_s
],
892 count
* sizeof(xfs_dir2_leaf_entry_t
));
893 xfs_dir3_leaf_log_ents(args
, bp_d
, start_d
, start_d
+ count
- 1);
896 * If there are source entries after the ones we copied,
897 * delete the ones we copied by sliding the next ones down.
899 if (start_s
+ count
< shdr
->count
) {
900 memmove(&sents
[start_s
], &sents
[start_s
+ count
],
901 count
* sizeof(xfs_dir2_leaf_entry_t
));
902 xfs_dir3_leaf_log_ents(args
, bp_s
, start_s
, start_s
+ count
- 1);
906 * Update the headers and log them.
908 shdr
->count
-= count
;
909 shdr
->stale
-= stale
;
910 dhdr
->count
+= count
;
911 dhdr
->stale
+= stale
;
915 * Determine the sort order of two leaf blocks.
916 * Returns 1 if both are valid and leaf2 should be before leaf1, else 0.
919 xfs_dir2_leafn_order(
920 struct xfs_inode
*dp
,
921 struct xfs_buf
*leaf1_bp
, /* leaf1 buffer */
922 struct xfs_buf
*leaf2_bp
) /* leaf2 buffer */
924 struct xfs_dir2_leaf
*leaf1
= leaf1_bp
->b_addr
;
925 struct xfs_dir2_leaf
*leaf2
= leaf2_bp
->b_addr
;
926 struct xfs_dir2_leaf_entry
*ents1
;
927 struct xfs_dir2_leaf_entry
*ents2
;
928 struct xfs_dir3_icleaf_hdr hdr1
;
929 struct xfs_dir3_icleaf_hdr hdr2
;
931 dp
->d_ops
->leaf_hdr_from_disk(&hdr1
, leaf1
);
932 dp
->d_ops
->leaf_hdr_from_disk(&hdr2
, leaf2
);
933 ents1
= dp
->d_ops
->leaf_ents_p(leaf1
);
934 ents2
= dp
->d_ops
->leaf_ents_p(leaf2
);
936 if (hdr1
.count
> 0 && hdr2
.count
> 0 &&
937 (be32_to_cpu(ents2
[0].hashval
) < be32_to_cpu(ents1
[0].hashval
) ||
938 be32_to_cpu(ents2
[hdr2
.count
- 1].hashval
) <
939 be32_to_cpu(ents1
[hdr1
.count
- 1].hashval
)))
945 * Rebalance leaf entries between two leaf blocks.
946 * This is actually only called when the second block is new,
947 * though the code deals with the general case.
948 * A new entry will be inserted in one of the blocks, and that
949 * entry is taken into account when balancing.
952 xfs_dir2_leafn_rebalance(
953 xfs_da_state_t
*state
, /* btree cursor */
954 xfs_da_state_blk_t
*blk1
, /* first btree block */
955 xfs_da_state_blk_t
*blk2
) /* second btree block */
957 xfs_da_args_t
*args
; /* operation arguments */
958 int count
; /* count (& direction) leaves */
959 int isleft
; /* new goes in left leaf */
960 xfs_dir2_leaf_t
*leaf1
; /* first leaf structure */
961 xfs_dir2_leaf_t
*leaf2
; /* second leaf structure */
962 int mid
; /* midpoint leaf index */
963 #if defined(DEBUG) || defined(XFS_WARN)
964 int oldstale
; /* old count of stale leaves */
966 int oldsum
; /* old total leaf count */
967 int swap
; /* swapped leaf blocks */
968 struct xfs_dir2_leaf_entry
*ents1
;
969 struct xfs_dir2_leaf_entry
*ents2
;
970 struct xfs_dir3_icleaf_hdr hdr1
;
971 struct xfs_dir3_icleaf_hdr hdr2
;
972 struct xfs_inode
*dp
= state
->args
->dp
;
976 * If the block order is wrong, swap the arguments.
978 if ((swap
= xfs_dir2_leafn_order(dp
, blk1
->bp
, blk2
->bp
))) {
979 xfs_da_state_blk_t
*tmp
; /* temp for block swap */
985 leaf1
= blk1
->bp
->b_addr
;
986 leaf2
= blk2
->bp
->b_addr
;
987 dp
->d_ops
->leaf_hdr_from_disk(&hdr1
, leaf1
);
988 dp
->d_ops
->leaf_hdr_from_disk(&hdr2
, leaf2
);
989 ents1
= dp
->d_ops
->leaf_ents_p(leaf1
);
990 ents2
= dp
->d_ops
->leaf_ents_p(leaf2
);
992 oldsum
= hdr1
.count
+ hdr2
.count
;
993 #if defined(DEBUG) || defined(XFS_WARN)
994 oldstale
= hdr1
.stale
+ hdr2
.stale
;
999 * If the old leaf count was odd then the new one will be even,
1000 * so we need to divide the new count evenly.
1003 xfs_dahash_t midhash
; /* middle entry hash value */
1005 if (mid
>= hdr1
.count
)
1006 midhash
= be32_to_cpu(ents2
[mid
- hdr1
.count
].hashval
);
1008 midhash
= be32_to_cpu(ents1
[mid
].hashval
);
1009 isleft
= args
->hashval
<= midhash
;
1012 * If the old count is even then the new count is odd, so there's
1013 * no preferred side for the new entry.
1014 * Pick the left one.
1019 * Calculate moved entry count. Positive means left-to-right,
1020 * negative means right-to-left. Then move the entries.
1022 count
= hdr1
.count
- mid
+ (isleft
== 0);
1024 xfs_dir3_leafn_moveents(args
, blk1
->bp
, &hdr1
, ents1
,
1025 hdr1
.count
- count
, blk2
->bp
,
1026 &hdr2
, ents2
, 0, count
);
1028 xfs_dir3_leafn_moveents(args
, blk2
->bp
, &hdr2
, ents2
, 0,
1029 blk1
->bp
, &hdr1
, ents1
,
1032 ASSERT(hdr1
.count
+ hdr2
.count
== oldsum
);
1033 ASSERT(hdr1
.stale
+ hdr2
.stale
== oldstale
);
1035 /* log the changes made when moving the entries */
1036 dp
->d_ops
->leaf_hdr_to_disk(leaf1
, &hdr1
);
1037 dp
->d_ops
->leaf_hdr_to_disk(leaf2
, &hdr2
);
1038 xfs_dir3_leaf_log_header(args
, blk1
->bp
);
1039 xfs_dir3_leaf_log_header(args
, blk2
->bp
);
1041 xfs_dir3_leaf_check(dp
, blk1
->bp
);
1042 xfs_dir3_leaf_check(dp
, blk2
->bp
);
1045 * Mark whether we're inserting into the old or new leaf.
1047 if (hdr1
.count
< hdr2
.count
)
1048 state
->inleaf
= swap
;
1049 else if (hdr1
.count
> hdr2
.count
)
1050 state
->inleaf
= !swap
;
1052 state
->inleaf
= swap
^ (blk1
->index
<= hdr1
.count
);
1054 * Adjust the expected index for insertion.
1057 blk2
->index
= blk1
->index
- hdr1
.count
;
1060 * Finally sanity check just to make sure we are not returning a
1063 if (blk2
->index
< 0) {
1066 xfs_alert(dp
->i_mount
,
1067 "%s: picked the wrong leaf? reverting original leaf: blk1->index %d",
1068 __func__
, blk1
->index
);
1073 xfs_dir3_data_block_free(
1074 xfs_da_args_t
*args
,
1075 struct xfs_dir2_data_hdr
*hdr
,
1076 struct xfs_dir2_free
*free
,
1079 struct xfs_buf
*fbp
,
1084 struct xfs_dir3_icfree_hdr freehdr
;
1085 struct xfs_inode
*dp
= args
->dp
;
1087 dp
->d_ops
->free_hdr_from_disk(&freehdr
, free
);
1088 bests
= dp
->d_ops
->free_bests_p(free
);
1091 * Data block is not empty, just set the free entry to the new
1094 bests
[findex
] = cpu_to_be16(longest
);
1095 xfs_dir2_free_log_bests(args
, fbp
, findex
, findex
);
1099 /* One less used entry in the free table. */
1103 * If this was the last entry in the table, we can trim the table size
1104 * back. There might be other entries at the end referring to
1105 * non-existent data blocks, get those too.
1107 if (findex
== freehdr
.nvalid
- 1) {
1108 int i
; /* free entry index */
1110 for (i
= findex
- 1; i
>= 0; i
--) {
1111 if (bests
[i
] != cpu_to_be16(NULLDATAOFF
))
1114 freehdr
.nvalid
= i
+ 1;
1117 /* Not the last entry, just punch it out. */
1118 bests
[findex
] = cpu_to_be16(NULLDATAOFF
);
1122 dp
->d_ops
->free_hdr_to_disk(free
, &freehdr
);
1123 xfs_dir2_free_log_header(args
, fbp
);
1126 * If there are no useful entries left in the block, get rid of the
1129 if (!freehdr
.nused
) {
1132 error
= xfs_dir2_shrink_inode(args
, fdb
, fbp
);
1136 } else if (error
!= -ENOSPC
|| args
->total
!= 0)
1139 * It's possible to get ENOSPC if there is no
1140 * space reservation. In this case some one
1141 * else will eventually get rid of this block.
1145 /* Log the free entry that changed, unless we got rid of it. */
1147 xfs_dir2_free_log_bests(args
, fbp
, findex
, findex
);
1152 * Remove an entry from a node directory.
1153 * This removes the leaf entry and the data entry,
1154 * and updates the free block if necessary.
1156 static int /* error */
1157 xfs_dir2_leafn_remove(
1158 xfs_da_args_t
*args
, /* operation arguments */
1159 struct xfs_buf
*bp
, /* leaf buffer */
1160 int index
, /* leaf entry index */
1161 xfs_da_state_blk_t
*dblk
, /* data block */
1162 int *rval
) /* resulting block needs join */
1164 xfs_dir2_data_hdr_t
*hdr
; /* data block header */
1165 xfs_dir2_db_t db
; /* data block number */
1166 struct xfs_buf
*dbp
; /* data block buffer */
1167 xfs_dir2_data_entry_t
*dep
; /* data block entry */
1168 xfs_inode_t
*dp
; /* incore directory inode */
1169 xfs_dir2_leaf_t
*leaf
; /* leaf structure */
1170 xfs_dir2_leaf_entry_t
*lep
; /* leaf entry */
1171 int longest
; /* longest data free entry */
1172 int off
; /* data block entry offset */
1173 xfs_mount_t
*mp
; /* filesystem mount point */
1174 int needlog
; /* need to log data header */
1175 int needscan
; /* need to rescan data frees */
1176 xfs_trans_t
*tp
; /* transaction pointer */
1177 struct xfs_dir2_data_free
*bf
; /* bestfree table */
1178 struct xfs_dir3_icleaf_hdr leafhdr
;
1179 struct xfs_dir2_leaf_entry
*ents
;
1181 trace_xfs_dir2_leafn_remove(args
, index
);
1187 dp
->d_ops
->leaf_hdr_from_disk(&leafhdr
, leaf
);
1188 ents
= dp
->d_ops
->leaf_ents_p(leaf
);
1191 * Point to the entry we're removing.
1196 * Extract the data block and offset from the entry.
1198 db
= xfs_dir2_dataptr_to_db(args
->geo
, be32_to_cpu(lep
->address
));
1199 ASSERT(dblk
->blkno
== db
);
1200 off
= xfs_dir2_dataptr_to_off(args
->geo
, be32_to_cpu(lep
->address
));
1201 ASSERT(dblk
->index
== off
);
1204 * Kill the leaf entry by marking it stale.
1205 * Log the leaf block changes.
1208 dp
->d_ops
->leaf_hdr_to_disk(leaf
, &leafhdr
);
1209 xfs_dir3_leaf_log_header(args
, bp
);
1211 lep
->address
= cpu_to_be32(XFS_DIR2_NULL_DATAPTR
);
1212 xfs_dir3_leaf_log_ents(args
, bp
, index
, index
);
1215 * Make the data entry free. Keep track of the longest freespace
1216 * in the data block in case it changes.
1220 dep
= (xfs_dir2_data_entry_t
*)((char *)hdr
+ off
);
1221 bf
= dp
->d_ops
->data_bestfree_p(hdr
);
1222 longest
= be16_to_cpu(bf
[0].length
);
1223 needlog
= needscan
= 0;
1224 xfs_dir2_data_make_free(args
, dbp
, off
,
1225 dp
->d_ops
->data_entsize(dep
->namelen
), &needlog
, &needscan
);
1227 * Rescan the data block freespaces for bestfree.
1228 * Log the data block header if needed.
1231 xfs_dir2_data_freescan(dp
, hdr
, &needlog
);
1233 xfs_dir2_data_log_header(args
, dbp
);
1234 xfs_dir3_data_check(dp
, dbp
);
1236 * If the longest data block freespace changes, need to update
1237 * the corresponding freeblock entry.
1239 if (longest
< be16_to_cpu(bf
[0].length
)) {
1240 int error
; /* error return value */
1241 struct xfs_buf
*fbp
; /* freeblock buffer */
1242 xfs_dir2_db_t fdb
; /* freeblock block number */
1243 int findex
; /* index in freeblock entries */
1244 xfs_dir2_free_t
*free
; /* freeblock structure */
1247 * Convert the data block number to a free block,
1248 * read in the free block.
1250 fdb
= dp
->d_ops
->db_to_fdb(args
->geo
, db
);
1251 error
= xfs_dir2_free_read(tp
, dp
,
1252 xfs_dir2_db_to_da(args
->geo
, fdb
),
1259 struct xfs_dir3_icfree_hdr freehdr
;
1260 dp
->d_ops
->free_hdr_from_disk(&freehdr
, free
);
1261 ASSERT(freehdr
.firstdb
== dp
->d_ops
->free_max_bests(args
->geo
) *
1262 (fdb
- xfs_dir2_byte_to_db(args
->geo
,
1263 XFS_DIR2_FREE_OFFSET
)));
1267 * Calculate which entry we need to fix.
1269 findex
= dp
->d_ops
->db_to_fdindex(args
->geo
, db
);
1270 longest
= be16_to_cpu(bf
[0].length
);
1272 * If the data block is now empty we can get rid of it
1275 if (longest
== args
->geo
->blksize
-
1276 dp
->d_ops
->data_entry_offset
) {
1278 * Try to punch out the data block.
1280 error
= xfs_dir2_shrink_inode(args
, db
, dbp
);
1286 * We can get ENOSPC if there's no space reservation.
1287 * In this case just drop the buffer and some one else
1288 * will eventually get rid of the empty block.
1290 else if (!(error
== -ENOSPC
&& args
->total
== 0))
1294 * If we got rid of the data block, we can eliminate that entry
1295 * in the free block.
1297 error
= xfs_dir3_data_block_free(args
, hdr
, free
,
1298 fdb
, findex
, fbp
, longest
);
1303 xfs_dir3_leaf_check(dp
, bp
);
1305 * Return indication of whether this leaf block is empty enough
1306 * to justify trying to join it with a neighbor.
1308 *rval
= (dp
->d_ops
->leaf_hdr_size
+
1309 (uint
)sizeof(ents
[0]) * (leafhdr
.count
- leafhdr
.stale
)) <
1310 args
->geo
->magicpct
;
1315 * Split the leaf entries in the old block into old and new blocks.
1318 xfs_dir2_leafn_split(
1319 xfs_da_state_t
*state
, /* btree cursor */
1320 xfs_da_state_blk_t
*oldblk
, /* original block */
1321 xfs_da_state_blk_t
*newblk
) /* newly created block */
1323 xfs_da_args_t
*args
; /* operation arguments */
1324 xfs_dablk_t blkno
; /* new leaf block number */
1325 int error
; /* error return value */
1326 xfs_mount_t
*mp
; /* filesystem mount point */
1327 struct xfs_inode
*dp
;
1330 * Allocate space for a new leaf node.
1335 ASSERT(oldblk
->magic
== XFS_DIR2_LEAFN_MAGIC
);
1336 error
= xfs_da_grow_inode(args
, &blkno
);
1341 * Initialize the new leaf block.
1343 error
= xfs_dir3_leaf_get_buf(args
, xfs_dir2_da_to_db(args
->geo
, blkno
),
1344 &newblk
->bp
, XFS_DIR2_LEAFN_MAGIC
);
1348 newblk
->blkno
= blkno
;
1349 newblk
->magic
= XFS_DIR2_LEAFN_MAGIC
;
1351 * Rebalance the entries across the two leaves, link the new
1352 * block into the leaves.
1354 xfs_dir2_leafn_rebalance(state
, oldblk
, newblk
);
1355 error
= xfs_da3_blk_link(state
, oldblk
, newblk
);
1360 * Insert the new entry in the correct block.
1363 error
= xfs_dir2_leafn_add(oldblk
->bp
, args
, oldblk
->index
);
1365 error
= xfs_dir2_leafn_add(newblk
->bp
, args
, newblk
->index
);
1367 * Update last hashval in each block since we added the name.
1369 oldblk
->hashval
= xfs_dir2_leafn_lasthash(dp
, oldblk
->bp
, NULL
);
1370 newblk
->hashval
= xfs_dir2_leafn_lasthash(dp
, newblk
->bp
, NULL
);
1371 xfs_dir3_leaf_check(dp
, oldblk
->bp
);
1372 xfs_dir3_leaf_check(dp
, newblk
->bp
);
1377 * Check a leaf block and its neighbors to see if the block should be
1378 * collapsed into one or the other neighbor. Always keep the block
1379 * with the smaller block number.
1380 * If the current block is over 50% full, don't try to join it, return 0.
1381 * If the block is empty, fill in the state structure and return 2.
1382 * If it can be collapsed, fill in the state structure and return 1.
1383 * If nothing can be done, return 0.
1386 xfs_dir2_leafn_toosmall(
1387 xfs_da_state_t
*state
, /* btree cursor */
1388 int *action
) /* resulting action to take */
1390 xfs_da_state_blk_t
*blk
; /* leaf block */
1391 xfs_dablk_t blkno
; /* leaf block number */
1392 struct xfs_buf
*bp
; /* leaf buffer */
1393 int bytes
; /* bytes in use */
1394 int count
; /* leaf live entry count */
1395 int error
; /* error return value */
1396 int forward
; /* sibling block direction */
1397 int i
; /* sibling counter */
1398 xfs_dir2_leaf_t
*leaf
; /* leaf structure */
1399 int rval
; /* result from path_shift */
1400 struct xfs_dir3_icleaf_hdr leafhdr
;
1401 struct xfs_dir2_leaf_entry
*ents
;
1402 struct xfs_inode
*dp
= state
->args
->dp
;
1405 * Check for the degenerate case of the block being over 50% full.
1406 * If so, it's not worth even looking to see if we might be able
1407 * to coalesce with a sibling.
1409 blk
= &state
->path
.blk
[state
->path
.active
- 1];
1410 leaf
= blk
->bp
->b_addr
;
1411 dp
->d_ops
->leaf_hdr_from_disk(&leafhdr
, leaf
);
1412 ents
= dp
->d_ops
->leaf_ents_p(leaf
);
1413 xfs_dir3_leaf_check(dp
, blk
->bp
);
1415 count
= leafhdr
.count
- leafhdr
.stale
;
1416 bytes
= dp
->d_ops
->leaf_hdr_size
+ count
* sizeof(ents
[0]);
1417 if (bytes
> (state
->args
->geo
->blksize
>> 1)) {
1419 * Blk over 50%, don't try to join.
1425 * Check for the degenerate case of the block being empty.
1426 * If the block is empty, we'll simply delete it, no need to
1427 * coalesce it with a sibling block. We choose (arbitrarily)
1428 * to merge with the forward block unless it is NULL.
1432 * Make altpath point to the block we want to keep and
1433 * path point to the block we want to drop (this one).
1435 forward
= (leafhdr
.forw
!= 0);
1436 memcpy(&state
->altpath
, &state
->path
, sizeof(state
->path
));
1437 error
= xfs_da3_path_shift(state
, &state
->altpath
, forward
, 0,
1441 *action
= rval
? 2 : 0;
1445 * Examine each sibling block to see if we can coalesce with
1446 * at least 25% free space to spare. We need to figure out
1447 * whether to merge with the forward or the backward block.
1448 * We prefer coalescing with the lower numbered sibling so as
1449 * to shrink a directory over time.
1451 forward
= leafhdr
.forw
< leafhdr
.back
;
1452 for (i
= 0, bp
= NULL
; i
< 2; forward
= !forward
, i
++) {
1453 struct xfs_dir3_icleaf_hdr hdr2
;
1455 blkno
= forward
? leafhdr
.forw
: leafhdr
.back
;
1459 * Read the sibling leaf block.
1461 error
= xfs_dir3_leafn_read(state
->args
->trans
, dp
,
1467 * Count bytes in the two blocks combined.
1469 count
= leafhdr
.count
- leafhdr
.stale
;
1470 bytes
= state
->args
->geo
->blksize
-
1471 (state
->args
->geo
->blksize
>> 2);
1474 dp
->d_ops
->leaf_hdr_from_disk(&hdr2
, leaf
);
1475 ents
= dp
->d_ops
->leaf_ents_p(leaf
);
1476 count
+= hdr2
.count
- hdr2
.stale
;
1477 bytes
-= count
* sizeof(ents
[0]);
1480 * Fits with at least 25% to spare.
1484 xfs_trans_brelse(state
->args
->trans
, bp
);
1487 * Didn't like either block, give up.
1495 * Make altpath point to the block we want to keep (the lower
1496 * numbered block) and path point to the block we want to drop.
1498 memcpy(&state
->altpath
, &state
->path
, sizeof(state
->path
));
1499 if (blkno
< blk
->blkno
)
1500 error
= xfs_da3_path_shift(state
, &state
->altpath
, forward
, 0,
1503 error
= xfs_da3_path_shift(state
, &state
->path
, forward
, 0,
1508 *action
= rval
? 0 : 1;
1513 * Move all the leaf entries from drop_blk to save_blk.
1514 * This is done as part of a join operation.
1517 xfs_dir2_leafn_unbalance(
1518 xfs_da_state_t
*state
, /* cursor */
1519 xfs_da_state_blk_t
*drop_blk
, /* dead block */
1520 xfs_da_state_blk_t
*save_blk
) /* surviving block */
1522 xfs_da_args_t
*args
; /* operation arguments */
1523 xfs_dir2_leaf_t
*drop_leaf
; /* dead leaf structure */
1524 xfs_dir2_leaf_t
*save_leaf
; /* surviving leaf structure */
1525 struct xfs_dir3_icleaf_hdr savehdr
;
1526 struct xfs_dir3_icleaf_hdr drophdr
;
1527 struct xfs_dir2_leaf_entry
*sents
;
1528 struct xfs_dir2_leaf_entry
*dents
;
1529 struct xfs_inode
*dp
= state
->args
->dp
;
1532 ASSERT(drop_blk
->magic
== XFS_DIR2_LEAFN_MAGIC
);
1533 ASSERT(save_blk
->magic
== XFS_DIR2_LEAFN_MAGIC
);
1534 drop_leaf
= drop_blk
->bp
->b_addr
;
1535 save_leaf
= save_blk
->bp
->b_addr
;
1537 dp
->d_ops
->leaf_hdr_from_disk(&savehdr
, save_leaf
);
1538 dp
->d_ops
->leaf_hdr_from_disk(&drophdr
, drop_leaf
);
1539 sents
= dp
->d_ops
->leaf_ents_p(save_leaf
);
1540 dents
= dp
->d_ops
->leaf_ents_p(drop_leaf
);
1543 * If there are any stale leaf entries, take this opportunity
1547 xfs_dir3_leaf_compact(args
, &drophdr
, drop_blk
->bp
);
1549 xfs_dir3_leaf_compact(args
, &savehdr
, save_blk
->bp
);
1552 * Move the entries from drop to the appropriate end of save.
1554 drop_blk
->hashval
= be32_to_cpu(dents
[drophdr
.count
- 1].hashval
);
1555 if (xfs_dir2_leafn_order(dp
, save_blk
->bp
, drop_blk
->bp
))
1556 xfs_dir3_leafn_moveents(args
, drop_blk
->bp
, &drophdr
, dents
, 0,
1557 save_blk
->bp
, &savehdr
, sents
, 0,
1560 xfs_dir3_leafn_moveents(args
, drop_blk
->bp
, &drophdr
, dents
, 0,
1561 save_blk
->bp
, &savehdr
, sents
,
1562 savehdr
.count
, drophdr
.count
);
1563 save_blk
->hashval
= be32_to_cpu(sents
[savehdr
.count
- 1].hashval
);
1565 /* log the changes made when moving the entries */
1566 dp
->d_ops
->leaf_hdr_to_disk(save_leaf
, &savehdr
);
1567 dp
->d_ops
->leaf_hdr_to_disk(drop_leaf
, &drophdr
);
1568 xfs_dir3_leaf_log_header(args
, save_blk
->bp
);
1569 xfs_dir3_leaf_log_header(args
, drop_blk
->bp
);
1571 xfs_dir3_leaf_check(dp
, save_blk
->bp
);
1572 xfs_dir3_leaf_check(dp
, drop_blk
->bp
);
1576 * Top-level node form directory addname routine.
1579 xfs_dir2_node_addname(
1580 xfs_da_args_t
*args
) /* operation arguments */
1582 xfs_da_state_blk_t
*blk
; /* leaf block for insert */
1583 int error
; /* error return value */
1584 int rval
; /* sub-return value */
1585 xfs_da_state_t
*state
; /* btree cursor */
1587 trace_xfs_dir2_node_addname(args
);
1590 * Allocate and initialize the state (btree cursor).
1592 state
= xfs_da_state_alloc();
1594 state
->mp
= args
->dp
->i_mount
;
1596 * Look up the name. We're not supposed to find it, but
1597 * this gives us the insertion point.
1599 error
= xfs_da3_node_lookup_int(state
, &rval
);
1602 if (rval
!= -ENOENT
) {
1606 * Add the data entry to a data block.
1607 * Extravalid is set to a freeblock found by lookup.
1609 rval
= xfs_dir2_node_addname_int(args
,
1610 state
->extravalid
? &state
->extrablk
: NULL
);
1614 blk
= &state
->path
.blk
[state
->path
.active
- 1];
1615 ASSERT(blk
->magic
== XFS_DIR2_LEAFN_MAGIC
);
1617 * Add the new leaf entry.
1619 rval
= xfs_dir2_leafn_add(blk
->bp
, args
, blk
->index
);
1622 * It worked, fix the hash values up the btree.
1624 if (!(args
->op_flags
& XFS_DA_OP_JUSTCHECK
))
1625 xfs_da3_fixhashpath(state
, &state
->path
);
1628 * It didn't work, we need to split the leaf block.
1630 if (args
->total
== 0) {
1631 ASSERT(rval
== -ENOSPC
);
1635 * Split the leaf block and insert the new entry.
1637 rval
= xfs_da3_split(state
);
1640 xfs_da_state_free(state
);
1645 * Add the data entry for a node-format directory name addition.
1646 * The leaf entry is added in xfs_dir2_leafn_add.
1647 * We may enter with a freespace block that the lookup found.
1649 static int /* error */
1650 xfs_dir2_node_addname_int(
1651 xfs_da_args_t
*args
, /* operation arguments */
1652 xfs_da_state_blk_t
*fblk
) /* optional freespace block */
1654 xfs_dir2_data_hdr_t
*hdr
; /* data block header */
1655 xfs_dir2_db_t dbno
; /* data block number */
1656 struct xfs_buf
*dbp
; /* data block buffer */
1657 xfs_dir2_data_entry_t
*dep
; /* data entry pointer */
1658 xfs_inode_t
*dp
; /* incore directory inode */
1659 xfs_dir2_data_unused_t
*dup
; /* data unused entry pointer */
1660 int error
; /* error return value */
1661 xfs_dir2_db_t fbno
; /* freespace block number */
1662 struct xfs_buf
*fbp
; /* freespace buffer */
1663 int findex
; /* freespace entry index */
1664 xfs_dir2_free_t
*free
=NULL
; /* freespace block structure */
1665 xfs_dir2_db_t ifbno
; /* initial freespace block no */
1666 xfs_dir2_db_t lastfbno
=0; /* highest freespace block no */
1667 int length
; /* length of the new entry */
1668 int logfree
; /* need to log free entry */
1669 xfs_mount_t
*mp
; /* filesystem mount point */
1670 int needlog
; /* need to log data header */
1671 int needscan
; /* need to rescan data frees */
1672 __be16
*tagp
; /* data entry tag pointer */
1673 xfs_trans_t
*tp
; /* transaction pointer */
1675 struct xfs_dir3_icfree_hdr freehdr
;
1676 struct xfs_dir2_data_free
*bf
;
1681 length
= dp
->d_ops
->data_entsize(args
->namelen
);
1683 * If we came in with a freespace block that means that lookup
1684 * found an entry with our hash value. This is the freespace
1685 * block for that data entry.
1690 * Remember initial freespace block number.
1692 ifbno
= fblk
->blkno
;
1694 findex
= fblk
->index
;
1695 bests
= dp
->d_ops
->free_bests_p(free
);
1696 dp
->d_ops
->free_hdr_from_disk(&freehdr
, free
);
1699 * This means the free entry showed that the data block had
1700 * space for our entry, so we remembered it.
1701 * Use that data block.
1704 ASSERT(findex
< freehdr
.nvalid
);
1705 ASSERT(be16_to_cpu(bests
[findex
]) != NULLDATAOFF
);
1706 ASSERT(be16_to_cpu(bests
[findex
]) >= length
);
1707 dbno
= freehdr
.firstdb
+ findex
;
1710 * The data block looked at didn't have enough room.
1711 * We'll start at the beginning of the freespace entries.
1718 * Didn't come in with a freespace block, so no data block.
1726 * If we don't have a data block yet, we're going to scan the
1727 * freespace blocks looking for one. Figure out what the
1728 * highest freespace block number is.
1731 xfs_fileoff_t fo
; /* freespace block number */
1733 if ((error
= xfs_bmap_last_offset(dp
, &fo
, XFS_DATA_FORK
)))
1735 lastfbno
= xfs_dir2_da_to_db(args
->geo
, (xfs_dablk_t
)fo
);
1739 * While we haven't identified a data block, search the freeblock
1740 * data for a good data block. If we find a null freeblock entry,
1741 * indicating a hole in the data blocks, remember that.
1743 while (dbno
== -1) {
1745 * If we don't have a freeblock in hand, get the next one.
1749 * Happens the first time through unless lookup gave
1750 * us a freespace block to start with.
1753 fbno
= xfs_dir2_byte_to_db(args
->geo
,
1754 XFS_DIR2_FREE_OFFSET
);
1756 * If it's ifbno we already looked at it.
1761 * If it's off the end we're done.
1763 if (fbno
>= lastfbno
)
1766 * Read the block. There can be holes in the
1767 * freespace blocks, so this might not succeed.
1768 * This should be really rare, so there's no reason
1771 error
= xfs_dir2_free_try_read(tp
, dp
,
1772 xfs_dir2_db_to_da(args
->geo
, fbno
),
1782 * Look at the current free entry. Is it good enough?
1784 * The bests initialisation should be where the bufer is read in
1785 * the above branch. But gcc is too stupid to realise that bests
1786 * and the freehdr are actually initialised if they are placed
1787 * there, so we have to do it here to avoid warnings. Blech.
1789 bests
= dp
->d_ops
->free_bests_p(free
);
1790 dp
->d_ops
->free_hdr_from_disk(&freehdr
, free
);
1791 if (be16_to_cpu(bests
[findex
]) != NULLDATAOFF
&&
1792 be16_to_cpu(bests
[findex
]) >= length
)
1793 dbno
= freehdr
.firstdb
+ findex
;
1796 * Are we done with the freeblock?
1798 if (++findex
== freehdr
.nvalid
) {
1802 xfs_trans_brelse(tp
, fbp
);
1804 if (fblk
&& fblk
->bp
)
1810 * If we don't have a data block, we need to allocate one and make
1811 * the freespace entries refer to it.
1813 if (unlikely(dbno
== -1)) {
1815 * Not allowed to allocate, return failure.
1817 if ((args
->op_flags
& XFS_DA_OP_JUSTCHECK
) || args
->total
== 0)
1821 * Allocate and initialize the new data block.
1823 if (unlikely((error
= xfs_dir2_grow_inode(args
,
1824 XFS_DIR2_DATA_SPACE
,
1826 (error
= xfs_dir3_data_init(args
, dbno
, &dbp
))))
1830 * If (somehow) we have a freespace block, get rid of it.
1833 xfs_trans_brelse(tp
, fbp
);
1834 if (fblk
&& fblk
->bp
)
1838 * Get the freespace block corresponding to the data block
1839 * that was just allocated.
1841 fbno
= dp
->d_ops
->db_to_fdb(args
->geo
, dbno
);
1842 error
= xfs_dir2_free_try_read(tp
, dp
,
1843 xfs_dir2_db_to_da(args
->geo
, fbno
),
1849 * If there wasn't a freespace block, the read will
1850 * return a NULL fbp. Allocate and initialize a new one.
1853 error
= xfs_dir2_grow_inode(args
, XFS_DIR2_FREE_SPACE
,
1858 if (dp
->d_ops
->db_to_fdb(args
->geo
, dbno
) != fbno
) {
1860 "%s: dir ino %llu needed freesp block %lld for\n"
1861 " data block %lld, got %lld ifbno %llu lastfbno %d",
1862 __func__
, (unsigned long long)dp
->i_ino
,
1863 (long long)dp
->d_ops
->db_to_fdb(
1865 (long long)dbno
, (long long)fbno
,
1866 (unsigned long long)ifbno
, lastfbno
);
1869 " fblk 0x%p blkno %llu index %d magic 0x%x",
1871 (unsigned long long)fblk
->blkno
,
1875 xfs_alert(mp
, " ... fblk is NULL");
1877 XFS_ERROR_REPORT("xfs_dir2_node_addname_int",
1878 XFS_ERRLEVEL_LOW
, mp
);
1879 return -EFSCORRUPTED
;
1883 * Get a buffer for the new block.
1885 error
= xfs_dir3_free_get_buf(args
, fbno
, &fbp
);
1889 bests
= dp
->d_ops
->free_bests_p(free
);
1890 dp
->d_ops
->free_hdr_from_disk(&freehdr
, free
);
1893 * Remember the first slot as our empty slot.
1896 (fbno
- xfs_dir2_byte_to_db(args
->geo
,
1897 XFS_DIR2_FREE_OFFSET
)) *
1898 dp
->d_ops
->free_max_bests(args
->geo
);
1901 bests
= dp
->d_ops
->free_bests_p(free
);
1902 dp
->d_ops
->free_hdr_from_disk(&freehdr
, free
);
1906 * Set the freespace block index from the data block number.
1908 findex
= dp
->d_ops
->db_to_fdindex(args
->geo
, dbno
);
1910 * If it's after the end of the current entries in the
1911 * freespace block, extend that table.
1913 if (findex
>= freehdr
.nvalid
) {
1914 ASSERT(findex
< dp
->d_ops
->free_max_bests(args
->geo
));
1915 freehdr
.nvalid
= findex
+ 1;
1917 * Tag new entry so nused will go up.
1919 bests
[findex
] = cpu_to_be16(NULLDATAOFF
);
1922 * If this entry was for an empty data block
1923 * (this should always be true) then update the header.
1925 if (bests
[findex
] == cpu_to_be16(NULLDATAOFF
)) {
1927 dp
->d_ops
->free_hdr_to_disk(fbp
->b_addr
, &freehdr
);
1928 xfs_dir2_free_log_header(args
, fbp
);
1931 * Update the real value in the table.
1932 * We haven't allocated the data entry yet so this will
1936 bf
= dp
->d_ops
->data_bestfree_p(hdr
);
1937 bests
[findex
] = bf
[0].length
;
1941 * We had a data block so we don't have to make a new one.
1945 * If just checking, we succeeded.
1947 if (args
->op_flags
& XFS_DA_OP_JUSTCHECK
)
1951 * Read the data block in.
1953 error
= xfs_dir3_data_read(tp
, dp
,
1954 xfs_dir2_db_to_da(args
->geo
, dbno
),
1959 bf
= dp
->d_ops
->data_bestfree_p(hdr
);
1962 ASSERT(be16_to_cpu(bf
[0].length
) >= length
);
1964 * Point to the existing unused space.
1966 dup
= (xfs_dir2_data_unused_t
*)
1967 ((char *)hdr
+ be16_to_cpu(bf
[0].offset
));
1968 needscan
= needlog
= 0;
1970 * Mark the first part of the unused space, inuse for us.
1972 xfs_dir2_data_use_free(args
, dbp
, dup
,
1973 (xfs_dir2_data_aoff_t
)((char *)dup
- (char *)hdr
), length
,
1974 &needlog
, &needscan
);
1976 * Fill in the new entry and log it.
1978 dep
= (xfs_dir2_data_entry_t
*)dup
;
1979 dep
->inumber
= cpu_to_be64(args
->inumber
);
1980 dep
->namelen
= args
->namelen
;
1981 memcpy(dep
->name
, args
->name
, dep
->namelen
);
1982 dp
->d_ops
->data_put_ftype(dep
, args
->filetype
);
1983 tagp
= dp
->d_ops
->data_entry_tag_p(dep
);
1984 *tagp
= cpu_to_be16((char *)dep
- (char *)hdr
);
1985 xfs_dir2_data_log_entry(args
, dbp
, dep
);
1987 * Rescan the block for bestfree if needed.
1990 xfs_dir2_data_freescan(dp
, hdr
, &needlog
);
1992 * Log the data block header if needed.
1995 xfs_dir2_data_log_header(args
, dbp
);
1997 * If the freespace entry is now wrong, update it.
1999 bests
= dp
->d_ops
->free_bests_p(free
); /* gcc is so stupid */
2000 if (be16_to_cpu(bests
[findex
]) != be16_to_cpu(bf
[0].length
)) {
2001 bests
[findex
] = bf
[0].length
;
2005 * Log the freespace entry if needed.
2008 xfs_dir2_free_log_bests(args
, fbp
, findex
, findex
);
2010 * Return the data block and offset in args, then drop the data block.
2012 args
->blkno
= (xfs_dablk_t
)dbno
;
2013 args
->index
= be16_to_cpu(*tagp
);
2018 * Lookup an entry in a node-format directory.
2019 * All the real work happens in xfs_da3_node_lookup_int.
2020 * The only real output is the inode number of the entry.
2023 xfs_dir2_node_lookup(
2024 xfs_da_args_t
*args
) /* operation arguments */
2026 int error
; /* error return value */
2027 int i
; /* btree level */
2028 int rval
; /* operation return value */
2029 xfs_da_state_t
*state
; /* btree cursor */
2031 trace_xfs_dir2_node_lookup(args
);
2034 * Allocate and initialize the btree cursor.
2036 state
= xfs_da_state_alloc();
2038 state
->mp
= args
->dp
->i_mount
;
2040 * Fill in the path to the entry in the cursor.
2042 error
= xfs_da3_node_lookup_int(state
, &rval
);
2045 else if (rval
== -ENOENT
&& args
->cmpresult
== XFS_CMP_CASE
) {
2046 /* If a CI match, dup the actual name and return -EEXIST */
2047 xfs_dir2_data_entry_t
*dep
;
2049 dep
= (xfs_dir2_data_entry_t
*)
2050 ((char *)state
->extrablk
.bp
->b_addr
+
2051 state
->extrablk
.index
);
2052 rval
= xfs_dir_cilookup_result(args
, dep
->name
, dep
->namelen
);
2055 * Release the btree blocks and leaf block.
2057 for (i
= 0; i
< state
->path
.active
; i
++) {
2058 xfs_trans_brelse(args
->trans
, state
->path
.blk
[i
].bp
);
2059 state
->path
.blk
[i
].bp
= NULL
;
2062 * Release the data block if we have it.
2064 if (state
->extravalid
&& state
->extrablk
.bp
) {
2065 xfs_trans_brelse(args
->trans
, state
->extrablk
.bp
);
2066 state
->extrablk
.bp
= NULL
;
2068 xfs_da_state_free(state
);
2073 * Remove an entry from a node-format directory.
2076 xfs_dir2_node_removename(
2077 struct xfs_da_args
*args
) /* operation arguments */
2079 struct xfs_da_state_blk
*blk
; /* leaf block */
2080 int error
; /* error return value */
2081 int rval
; /* operation return value */
2082 struct xfs_da_state
*state
; /* btree cursor */
2084 trace_xfs_dir2_node_removename(args
);
2087 * Allocate and initialize the btree cursor.
2089 state
= xfs_da_state_alloc();
2091 state
->mp
= args
->dp
->i_mount
;
2093 /* Look up the entry we're deleting, set up the cursor. */
2094 error
= xfs_da3_node_lookup_int(state
, &rval
);
2098 /* Didn't find it, upper layer screwed up. */
2099 if (rval
!= -EEXIST
) {
2104 blk
= &state
->path
.blk
[state
->path
.active
- 1];
2105 ASSERT(blk
->magic
== XFS_DIR2_LEAFN_MAGIC
);
2106 ASSERT(state
->extravalid
);
2108 * Remove the leaf and data entries.
2109 * Extrablk refers to the data block.
2111 error
= xfs_dir2_leafn_remove(args
, blk
->bp
, blk
->index
,
2112 &state
->extrablk
, &rval
);
2116 * Fix the hash values up the btree.
2118 xfs_da3_fixhashpath(state
, &state
->path
);
2120 * If we need to join leaf blocks, do it.
2122 if (rval
&& state
->path
.active
> 1)
2123 error
= xfs_da3_join(state
);
2125 * If no errors so far, try conversion to leaf format.
2128 error
= xfs_dir2_node_to_leaf(state
);
2130 xfs_da_state_free(state
);
2135 * Replace an entry's inode number in a node-format directory.
2138 xfs_dir2_node_replace(
2139 xfs_da_args_t
*args
) /* operation arguments */
2141 xfs_da_state_blk_t
*blk
; /* leaf block */
2142 xfs_dir2_data_hdr_t
*hdr
; /* data block header */
2143 xfs_dir2_data_entry_t
*dep
; /* data entry changed */
2144 int error
; /* error return value */
2145 int i
; /* btree level */
2146 xfs_ino_t inum
; /* new inode number */
2147 xfs_dir2_leaf_t
*leaf
; /* leaf structure */
2148 xfs_dir2_leaf_entry_t
*lep
; /* leaf entry being changed */
2149 int rval
; /* internal return value */
2150 xfs_da_state_t
*state
; /* btree cursor */
2152 trace_xfs_dir2_node_replace(args
);
2155 * Allocate and initialize the btree cursor.
2157 state
= xfs_da_state_alloc();
2159 state
->mp
= args
->dp
->i_mount
;
2160 inum
= args
->inumber
;
2162 * Lookup the entry to change in the btree.
2164 error
= xfs_da3_node_lookup_int(state
, &rval
);
2169 * It should be found, since the vnodeops layer has looked it up
2170 * and locked it. But paranoia is good.
2172 if (rval
== -EEXIST
) {
2173 struct xfs_dir2_leaf_entry
*ents
;
2175 * Find the leaf entry.
2177 blk
= &state
->path
.blk
[state
->path
.active
- 1];
2178 ASSERT(blk
->magic
== XFS_DIR2_LEAFN_MAGIC
);
2179 leaf
= blk
->bp
->b_addr
;
2180 ents
= args
->dp
->d_ops
->leaf_ents_p(leaf
);
2181 lep
= &ents
[blk
->index
];
2182 ASSERT(state
->extravalid
);
2184 * Point to the data entry.
2186 hdr
= state
->extrablk
.bp
->b_addr
;
2187 ASSERT(hdr
->magic
== cpu_to_be32(XFS_DIR2_DATA_MAGIC
) ||
2188 hdr
->magic
== cpu_to_be32(XFS_DIR3_DATA_MAGIC
));
2189 dep
= (xfs_dir2_data_entry_t
*)
2191 xfs_dir2_dataptr_to_off(args
->geo
,
2192 be32_to_cpu(lep
->address
)));
2193 ASSERT(inum
!= be64_to_cpu(dep
->inumber
));
2195 * Fill in the new inode number and log the entry.
2197 dep
->inumber
= cpu_to_be64(inum
);
2198 args
->dp
->d_ops
->data_put_ftype(dep
, args
->filetype
);
2199 xfs_dir2_data_log_entry(args
, state
->extrablk
.bp
, dep
);
2203 * Didn't find it, and we're holding a data block. Drop it.
2205 else if (state
->extravalid
) {
2206 xfs_trans_brelse(args
->trans
, state
->extrablk
.bp
);
2207 state
->extrablk
.bp
= NULL
;
2210 * Release all the buffers in the cursor.
2212 for (i
= 0; i
< state
->path
.active
; i
++) {
2213 xfs_trans_brelse(args
->trans
, state
->path
.blk
[i
].bp
);
2214 state
->path
.blk
[i
].bp
= NULL
;
2216 xfs_da_state_free(state
);
2221 * Trim off a trailing empty freespace block.
2222 * Return (in rvalp) 1 if we did it, 0 if not.
2225 xfs_dir2_node_trim_free(
2226 xfs_da_args_t
*args
, /* operation arguments */
2227 xfs_fileoff_t fo
, /* free block number */
2228 int *rvalp
) /* out: did something */
2230 struct xfs_buf
*bp
; /* freespace buffer */
2231 xfs_inode_t
*dp
; /* incore directory inode */
2232 int error
; /* error return code */
2233 xfs_dir2_free_t
*free
; /* freespace structure */
2234 xfs_mount_t
*mp
; /* filesystem mount point */
2235 xfs_trans_t
*tp
; /* transaction pointer */
2236 struct xfs_dir3_icfree_hdr freehdr
;
2242 * Read the freespace block.
2244 error
= xfs_dir2_free_try_read(tp
, dp
, fo
, &bp
);
2248 * There can be holes in freespace. If fo is a hole, there's
2254 dp
->d_ops
->free_hdr_from_disk(&freehdr
, free
);
2257 * If there are used entries, there's nothing to do.
2259 if (freehdr
.nused
> 0) {
2260 xfs_trans_brelse(tp
, bp
);
2265 * Blow the block away.
2267 error
= xfs_dir2_shrink_inode(args
,
2268 xfs_dir2_da_to_db(args
->geo
, (xfs_dablk_t
)fo
), bp
);
2271 * Can't fail with ENOSPC since that only happens with no
2272 * space reservation, when breaking up an extent into two
2273 * pieces. This is the last block of an extent.
2275 ASSERT(error
!= -ENOSPC
);
2276 xfs_trans_brelse(tp
, bp
);
2280 * Return that we succeeded.