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_types.h"
24 #include "xfs_trans.h"
27 #include "xfs_mount.h"
28 #include "xfs_da_btree.h"
29 #include "xfs_bmap_btree.h"
30 #include "xfs_alloc_btree.h"
31 #include "xfs_ialloc_btree.h"
32 #include "xfs_alloc.h"
33 #include "xfs_btree.h"
34 #include "xfs_attr_sf.h"
35 #include "xfs_attr_remote.h"
36 #include "xfs_dinode.h"
37 #include "xfs_inode.h"
38 #include "xfs_inode_item.h"
41 #include "xfs_attr_leaf.h"
42 #include "xfs_error.h"
43 #include "xfs_trace.h"
44 #include "xfs_buf_item.h"
45 #include "xfs_cksum.h"
51 * Routines to implement leaf blocks of attributes as Btrees of hashed names.
54 /*========================================================================
55 * Function prototypes for the kernel.
56 *========================================================================*/
59 * Routines used for growing the Btree.
61 STATIC
int xfs_attr3_leaf_create(struct xfs_da_args
*args
,
62 xfs_dablk_t which_block
, struct xfs_buf
**bpp
);
63 STATIC
int xfs_attr3_leaf_add_work(struct xfs_buf
*leaf_buffer
,
64 struct xfs_attr3_icleaf_hdr
*ichdr
,
65 struct xfs_da_args
*args
, int freemap_index
);
66 STATIC
void xfs_attr3_leaf_compact(struct xfs_da_args
*args
,
67 struct xfs_attr3_icleaf_hdr
*ichdr
,
68 struct xfs_buf
*leaf_buffer
);
69 STATIC
void xfs_attr3_leaf_rebalance(xfs_da_state_t
*state
,
70 xfs_da_state_blk_t
*blk1
,
71 xfs_da_state_blk_t
*blk2
);
72 STATIC
int xfs_attr3_leaf_figure_balance(xfs_da_state_t
*state
,
73 xfs_da_state_blk_t
*leaf_blk_1
,
74 struct xfs_attr3_icleaf_hdr
*ichdr1
,
75 xfs_da_state_blk_t
*leaf_blk_2
,
76 struct xfs_attr3_icleaf_hdr
*ichdr2
,
77 int *number_entries_in_blk1
,
78 int *number_usedbytes_in_blk1
);
81 * Routines used for shrinking the Btree.
83 STATIC
int xfs_attr3_node_inactive(xfs_trans_t
**trans
, xfs_inode_t
*dp
,
84 struct xfs_buf
*bp
, int level
);
85 STATIC
int xfs_attr3_leaf_inactive(xfs_trans_t
**trans
, xfs_inode_t
*dp
,
87 STATIC
int xfs_attr3_leaf_freextent(xfs_trans_t
**trans
, xfs_inode_t
*dp
,
88 xfs_dablk_t blkno
, int blkcnt
);
93 STATIC
void xfs_attr3_leaf_moveents(struct xfs_attr_leafblock
*src_leaf
,
94 struct xfs_attr3_icleaf_hdr
*src_ichdr
, int src_start
,
95 struct xfs_attr_leafblock
*dst_leaf
,
96 struct xfs_attr3_icleaf_hdr
*dst_ichdr
, int dst_start
,
97 int move_count
, struct xfs_mount
*mp
);
98 STATIC
int xfs_attr_leaf_entsize(xfs_attr_leafblock_t
*leaf
, int index
);
101 xfs_attr3_leaf_hdr_from_disk(
102 struct xfs_attr3_icleaf_hdr
*to
,
103 struct xfs_attr_leafblock
*from
)
107 ASSERT(from
->hdr
.info
.magic
== cpu_to_be16(XFS_ATTR_LEAF_MAGIC
) ||
108 from
->hdr
.info
.magic
== cpu_to_be16(XFS_ATTR3_LEAF_MAGIC
));
110 if (from
->hdr
.info
.magic
== cpu_to_be16(XFS_ATTR3_LEAF_MAGIC
)) {
111 struct xfs_attr3_leaf_hdr
*hdr3
= (struct xfs_attr3_leaf_hdr
*)from
;
113 to
->forw
= be32_to_cpu(hdr3
->info
.hdr
.forw
);
114 to
->back
= be32_to_cpu(hdr3
->info
.hdr
.back
);
115 to
->magic
= be16_to_cpu(hdr3
->info
.hdr
.magic
);
116 to
->count
= be16_to_cpu(hdr3
->count
);
117 to
->usedbytes
= be16_to_cpu(hdr3
->usedbytes
);
118 to
->firstused
= be16_to_cpu(hdr3
->firstused
);
119 to
->holes
= hdr3
->holes
;
121 for (i
= 0; i
< XFS_ATTR_LEAF_MAPSIZE
; i
++) {
122 to
->freemap
[i
].base
= be16_to_cpu(hdr3
->freemap
[i
].base
);
123 to
->freemap
[i
].size
= be16_to_cpu(hdr3
->freemap
[i
].size
);
127 to
->forw
= be32_to_cpu(from
->hdr
.info
.forw
);
128 to
->back
= be32_to_cpu(from
->hdr
.info
.back
);
129 to
->magic
= be16_to_cpu(from
->hdr
.info
.magic
);
130 to
->count
= be16_to_cpu(from
->hdr
.count
);
131 to
->usedbytes
= be16_to_cpu(from
->hdr
.usedbytes
);
132 to
->firstused
= be16_to_cpu(from
->hdr
.firstused
);
133 to
->holes
= from
->hdr
.holes
;
135 for (i
= 0; i
< XFS_ATTR_LEAF_MAPSIZE
; i
++) {
136 to
->freemap
[i
].base
= be16_to_cpu(from
->hdr
.freemap
[i
].base
);
137 to
->freemap
[i
].size
= be16_to_cpu(from
->hdr
.freemap
[i
].size
);
142 xfs_attr3_leaf_hdr_to_disk(
143 struct xfs_attr_leafblock
*to
,
144 struct xfs_attr3_icleaf_hdr
*from
)
148 ASSERT(from
->magic
== XFS_ATTR_LEAF_MAGIC
||
149 from
->magic
== XFS_ATTR3_LEAF_MAGIC
);
151 if (from
->magic
== XFS_ATTR3_LEAF_MAGIC
) {
152 struct xfs_attr3_leaf_hdr
*hdr3
= (struct xfs_attr3_leaf_hdr
*)to
;
154 hdr3
->info
.hdr
.forw
= cpu_to_be32(from
->forw
);
155 hdr3
->info
.hdr
.back
= cpu_to_be32(from
->back
);
156 hdr3
->info
.hdr
.magic
= cpu_to_be16(from
->magic
);
157 hdr3
->count
= cpu_to_be16(from
->count
);
158 hdr3
->usedbytes
= cpu_to_be16(from
->usedbytes
);
159 hdr3
->firstused
= cpu_to_be16(from
->firstused
);
160 hdr3
->holes
= from
->holes
;
163 for (i
= 0; i
< XFS_ATTR_LEAF_MAPSIZE
; i
++) {
164 hdr3
->freemap
[i
].base
= cpu_to_be16(from
->freemap
[i
].base
);
165 hdr3
->freemap
[i
].size
= cpu_to_be16(from
->freemap
[i
].size
);
169 to
->hdr
.info
.forw
= cpu_to_be32(from
->forw
);
170 to
->hdr
.info
.back
= cpu_to_be32(from
->back
);
171 to
->hdr
.info
.magic
= cpu_to_be16(from
->magic
);
172 to
->hdr
.count
= cpu_to_be16(from
->count
);
173 to
->hdr
.usedbytes
= cpu_to_be16(from
->usedbytes
);
174 to
->hdr
.firstused
= cpu_to_be16(from
->firstused
);
175 to
->hdr
.holes
= from
->holes
;
178 for (i
= 0; i
< XFS_ATTR_LEAF_MAPSIZE
; i
++) {
179 to
->hdr
.freemap
[i
].base
= cpu_to_be16(from
->freemap
[i
].base
);
180 to
->hdr
.freemap
[i
].size
= cpu_to_be16(from
->freemap
[i
].size
);
185 xfs_attr3_leaf_verify(
188 struct xfs_mount
*mp
= bp
->b_target
->bt_mount
;
189 struct xfs_attr_leafblock
*leaf
= bp
->b_addr
;
190 struct xfs_attr3_icleaf_hdr ichdr
;
192 xfs_attr3_leaf_hdr_from_disk(&ichdr
, leaf
);
194 if (xfs_sb_version_hascrc(&mp
->m_sb
)) {
195 struct xfs_da3_node_hdr
*hdr3
= bp
->b_addr
;
197 if (ichdr
.magic
!= XFS_ATTR3_LEAF_MAGIC
)
200 if (!uuid_equal(&hdr3
->info
.uuid
, &mp
->m_sb
.sb_uuid
))
202 if (be64_to_cpu(hdr3
->info
.blkno
) != bp
->b_bn
)
205 if (ichdr
.magic
!= XFS_ATTR_LEAF_MAGIC
)
208 if (ichdr
.count
== 0)
211 /* XXX: need to range check rest of attr header values */
212 /* XXX: hash order check? */
218 xfs_attr3_leaf_write_verify(
221 struct xfs_mount
*mp
= bp
->b_target
->bt_mount
;
222 struct xfs_buf_log_item
*bip
= bp
->b_fspriv
;
223 struct xfs_attr3_leaf_hdr
*hdr3
= bp
->b_addr
;
225 if (!xfs_attr3_leaf_verify(bp
)) {
226 XFS_CORRUPTION_ERROR(__func__
, XFS_ERRLEVEL_LOW
, mp
, bp
->b_addr
);
227 xfs_buf_ioerror(bp
, EFSCORRUPTED
);
231 if (!xfs_sb_version_hascrc(&mp
->m_sb
))
235 hdr3
->info
.lsn
= cpu_to_be64(bip
->bli_item
.li_lsn
);
237 xfs_update_cksum(bp
->b_addr
, BBTOB(bp
->b_length
), XFS_ATTR3_LEAF_CRC_OFF
);
241 * leaf/node format detection on trees is sketchy, so a node read can be done on
242 * leaf level blocks when detection identifies the tree as a node format tree
243 * incorrectly. In this case, we need to swap the verifier to match the correct
244 * format of the block being read.
247 xfs_attr3_leaf_read_verify(
250 struct xfs_mount
*mp
= bp
->b_target
->bt_mount
;
252 if ((xfs_sb_version_hascrc(&mp
->m_sb
) &&
253 !xfs_verify_cksum(bp
->b_addr
, BBTOB(bp
->b_length
),
254 XFS_ATTR3_LEAF_CRC_OFF
)) ||
255 !xfs_attr3_leaf_verify(bp
)) {
256 XFS_CORRUPTION_ERROR(__func__
, XFS_ERRLEVEL_LOW
, mp
, bp
->b_addr
);
257 xfs_buf_ioerror(bp
, EFSCORRUPTED
);
261 const struct xfs_buf_ops xfs_attr3_leaf_buf_ops
= {
262 .verify_read
= xfs_attr3_leaf_read_verify
,
263 .verify_write
= xfs_attr3_leaf_write_verify
,
268 struct xfs_trans
*tp
,
269 struct xfs_inode
*dp
,
271 xfs_daddr_t mappedbno
,
272 struct xfs_buf
**bpp
)
276 err
= xfs_da_read_buf(tp
, dp
, bno
, mappedbno
, bpp
,
277 XFS_ATTR_FORK
, &xfs_attr3_leaf_buf_ops
);
279 xfs_trans_buf_set_type(tp
, *bpp
, XFS_BLFT_ATTR_LEAF_BUF
);
283 /*========================================================================
284 * Namespace helper routines
285 *========================================================================*/
288 * If namespace bits don't match return 0.
289 * If all match then return 1.
292 xfs_attr_namesp_match(int arg_flags
, int ondisk_flags
)
294 return XFS_ATTR_NSP_ONDISK(ondisk_flags
) == XFS_ATTR_NSP_ARGS_TO_ONDISK(arg_flags
);
298 /*========================================================================
299 * External routines when attribute fork size < XFS_LITINO(mp).
300 *========================================================================*/
303 * Query whether the requested number of additional bytes of extended
304 * attribute space will be able to fit inline.
306 * Returns zero if not, else the di_forkoff fork offset to be used in the
307 * literal area for attribute data once the new bytes have been added.
309 * di_forkoff must be 8 byte aligned, hence is stored as a >>3 value;
310 * special case for dev/uuid inodes, they have fixed size data forks.
313 xfs_attr_shortform_bytesfit(xfs_inode_t
*dp
, int bytes
)
316 int minforkoff
; /* lower limit on valid forkoff locations */
317 int maxforkoff
; /* upper limit on valid forkoff locations */
319 xfs_mount_t
*mp
= dp
->i_mount
;
322 offset
= (XFS_LITINO(mp
, dp
->i_d
.di_version
) - bytes
) >> 3;
324 switch (dp
->i_d
.di_format
) {
325 case XFS_DINODE_FMT_DEV
:
326 minforkoff
= roundup(sizeof(xfs_dev_t
), 8) >> 3;
327 return (offset
>= minforkoff
) ? minforkoff
: 0;
328 case XFS_DINODE_FMT_UUID
:
329 minforkoff
= roundup(sizeof(uuid_t
), 8) >> 3;
330 return (offset
>= minforkoff
) ? minforkoff
: 0;
334 * If the requested numbers of bytes is smaller or equal to the
335 * current attribute fork size we can always proceed.
337 * Note that if_bytes in the data fork might actually be larger than
338 * the current data fork size is due to delalloc extents. In that
339 * case either the extent count will go down when they are converted
340 * to real extents, or the delalloc conversion will take care of the
341 * literal area rebalancing.
343 if (bytes
<= XFS_IFORK_ASIZE(dp
))
344 return dp
->i_d
.di_forkoff
;
347 * For attr2 we can try to move the forkoff if there is space in the
348 * literal area, but for the old format we are done if there is no
349 * space in the fixed attribute fork.
351 if (!(mp
->m_flags
& XFS_MOUNT_ATTR2
))
354 dsize
= dp
->i_df
.if_bytes
;
356 switch (dp
->i_d
.di_format
) {
357 case XFS_DINODE_FMT_EXTENTS
:
359 * If there is no attr fork and the data fork is extents,
360 * determine if creating the default attr fork will result
361 * in the extents form migrating to btree. If so, the
362 * minimum offset only needs to be the space required for
365 if (!dp
->i_d
.di_forkoff
&& dp
->i_df
.if_bytes
>
366 xfs_default_attroffset(dp
))
367 dsize
= XFS_BMDR_SPACE_CALC(MINDBTPTRS
);
369 case XFS_DINODE_FMT_BTREE
:
371 * If we have a data btree then keep forkoff if we have one,
372 * otherwise we are adding a new attr, so then we set
373 * minforkoff to where the btree root can finish so we have
374 * plenty of room for attrs
376 if (dp
->i_d
.di_forkoff
) {
377 if (offset
< dp
->i_d
.di_forkoff
)
379 return dp
->i_d
.di_forkoff
;
381 dsize
= XFS_BMAP_BROOT_SPACE(mp
, dp
->i_df
.if_broot
);
386 * A data fork btree root must have space for at least
387 * MINDBTPTRS key/ptr pairs if the data fork is small or empty.
389 minforkoff
= MAX(dsize
, XFS_BMDR_SPACE_CALC(MINDBTPTRS
));
390 minforkoff
= roundup(minforkoff
, 8) >> 3;
392 /* attr fork btree root can have at least this many key/ptr pairs */
393 maxforkoff
= XFS_LITINO(mp
, dp
->i_d
.di_version
) -
394 XFS_BMDR_SPACE_CALC(MINABTPTRS
);
395 maxforkoff
= maxforkoff
>> 3; /* rounded down */
397 if (offset
>= maxforkoff
)
399 if (offset
>= minforkoff
)
405 * Switch on the ATTR2 superblock bit (implies also FEATURES2)
408 xfs_sbversion_add_attr2(xfs_mount_t
*mp
, xfs_trans_t
*tp
)
410 if ((mp
->m_flags
& XFS_MOUNT_ATTR2
) &&
411 !(xfs_sb_version_hasattr2(&mp
->m_sb
))) {
412 spin_lock(&mp
->m_sb_lock
);
413 if (!xfs_sb_version_hasattr2(&mp
->m_sb
)) {
414 xfs_sb_version_addattr2(&mp
->m_sb
);
415 spin_unlock(&mp
->m_sb_lock
);
416 xfs_mod_sb(tp
, XFS_SB_VERSIONNUM
| XFS_SB_FEATURES2
);
418 spin_unlock(&mp
->m_sb_lock
);
423 * Create the initial contents of a shortform attribute list.
426 xfs_attr_shortform_create(xfs_da_args_t
*args
)
428 xfs_attr_sf_hdr_t
*hdr
;
432 trace_xfs_attr_sf_create(args
);
438 ASSERT(ifp
->if_bytes
== 0);
439 if (dp
->i_d
.di_aformat
== XFS_DINODE_FMT_EXTENTS
) {
440 ifp
->if_flags
&= ~XFS_IFEXTENTS
; /* just in case */
441 dp
->i_d
.di_aformat
= XFS_DINODE_FMT_LOCAL
;
442 ifp
->if_flags
|= XFS_IFINLINE
;
444 ASSERT(ifp
->if_flags
& XFS_IFINLINE
);
446 xfs_idata_realloc(dp
, sizeof(*hdr
), XFS_ATTR_FORK
);
447 hdr
= (xfs_attr_sf_hdr_t
*)ifp
->if_u1
.if_data
;
449 hdr
->totsize
= cpu_to_be16(sizeof(*hdr
));
450 xfs_trans_log_inode(args
->trans
, dp
, XFS_ILOG_CORE
| XFS_ILOG_ADATA
);
454 * Add a name/value pair to the shortform attribute list.
455 * Overflow from the inode has already been checked for.
458 xfs_attr_shortform_add(xfs_da_args_t
*args
, int forkoff
)
460 xfs_attr_shortform_t
*sf
;
461 xfs_attr_sf_entry_t
*sfe
;
467 trace_xfs_attr_sf_add(args
);
471 dp
->i_d
.di_forkoff
= forkoff
;
474 ASSERT(ifp
->if_flags
& XFS_IFINLINE
);
475 sf
= (xfs_attr_shortform_t
*)ifp
->if_u1
.if_data
;
477 for (i
= 0; i
< sf
->hdr
.count
; sfe
= XFS_ATTR_SF_NEXTENTRY(sfe
), i
++) {
479 if (sfe
->namelen
!= args
->namelen
)
481 if (memcmp(args
->name
, sfe
->nameval
, args
->namelen
) != 0)
483 if (!xfs_attr_namesp_match(args
->flags
, sfe
->flags
))
489 offset
= (char *)sfe
- (char *)sf
;
490 size
= XFS_ATTR_SF_ENTSIZE_BYNAME(args
->namelen
, args
->valuelen
);
491 xfs_idata_realloc(dp
, size
, XFS_ATTR_FORK
);
492 sf
= (xfs_attr_shortform_t
*)ifp
->if_u1
.if_data
;
493 sfe
= (xfs_attr_sf_entry_t
*)((char *)sf
+ offset
);
495 sfe
->namelen
= args
->namelen
;
496 sfe
->valuelen
= args
->valuelen
;
497 sfe
->flags
= XFS_ATTR_NSP_ARGS_TO_ONDISK(args
->flags
);
498 memcpy(sfe
->nameval
, args
->name
, args
->namelen
);
499 memcpy(&sfe
->nameval
[args
->namelen
], args
->value
, args
->valuelen
);
501 be16_add_cpu(&sf
->hdr
.totsize
, size
);
502 xfs_trans_log_inode(args
->trans
, dp
, XFS_ILOG_CORE
| XFS_ILOG_ADATA
);
504 xfs_sbversion_add_attr2(mp
, args
->trans
);
508 * After the last attribute is removed revert to original inode format,
509 * making all literal area available to the data fork once more.
513 struct xfs_inode
*ip
,
514 struct xfs_trans
*tp
)
516 xfs_idestroy_fork(ip
, XFS_ATTR_FORK
);
517 ip
->i_d
.di_forkoff
= 0;
518 ip
->i_d
.di_aformat
= XFS_DINODE_FMT_EXTENTS
;
520 ASSERT(ip
->i_d
.di_anextents
== 0);
521 ASSERT(ip
->i_afp
== NULL
);
523 xfs_trans_log_inode(tp
, ip
, XFS_ILOG_CORE
);
527 * Remove an attribute from the shortform attribute list structure.
530 xfs_attr_shortform_remove(xfs_da_args_t
*args
)
532 xfs_attr_shortform_t
*sf
;
533 xfs_attr_sf_entry_t
*sfe
;
534 int base
, size
=0, end
, totsize
, i
;
538 trace_xfs_attr_sf_remove(args
);
542 base
= sizeof(xfs_attr_sf_hdr_t
);
543 sf
= (xfs_attr_shortform_t
*)dp
->i_afp
->if_u1
.if_data
;
546 for (i
= 0; i
< end
; sfe
= XFS_ATTR_SF_NEXTENTRY(sfe
),
548 size
= XFS_ATTR_SF_ENTSIZE(sfe
);
549 if (sfe
->namelen
!= args
->namelen
)
551 if (memcmp(sfe
->nameval
, args
->name
, args
->namelen
) != 0)
553 if (!xfs_attr_namesp_match(args
->flags
, sfe
->flags
))
558 return(XFS_ERROR(ENOATTR
));
561 * Fix up the attribute fork data, covering the hole
564 totsize
= be16_to_cpu(sf
->hdr
.totsize
);
566 memmove(&((char *)sf
)[base
], &((char *)sf
)[end
], totsize
- end
);
568 be16_add_cpu(&sf
->hdr
.totsize
, -size
);
571 * Fix up the start offset of the attribute fork
574 if (totsize
== sizeof(xfs_attr_sf_hdr_t
) &&
575 (mp
->m_flags
& XFS_MOUNT_ATTR2
) &&
576 (dp
->i_d
.di_format
!= XFS_DINODE_FMT_BTREE
) &&
577 !(args
->op_flags
& XFS_DA_OP_ADDNAME
)) {
578 xfs_attr_fork_reset(dp
, args
->trans
);
580 xfs_idata_realloc(dp
, -size
, XFS_ATTR_FORK
);
581 dp
->i_d
.di_forkoff
= xfs_attr_shortform_bytesfit(dp
, totsize
);
582 ASSERT(dp
->i_d
.di_forkoff
);
583 ASSERT(totsize
> sizeof(xfs_attr_sf_hdr_t
) ||
584 (args
->op_flags
& XFS_DA_OP_ADDNAME
) ||
585 !(mp
->m_flags
& XFS_MOUNT_ATTR2
) ||
586 dp
->i_d
.di_format
== XFS_DINODE_FMT_BTREE
);
587 xfs_trans_log_inode(args
->trans
, dp
,
588 XFS_ILOG_CORE
| XFS_ILOG_ADATA
);
591 xfs_sbversion_add_attr2(mp
, args
->trans
);
597 * Look up a name in a shortform attribute list structure.
601 xfs_attr_shortform_lookup(xfs_da_args_t
*args
)
603 xfs_attr_shortform_t
*sf
;
604 xfs_attr_sf_entry_t
*sfe
;
608 trace_xfs_attr_sf_lookup(args
);
610 ifp
= args
->dp
->i_afp
;
611 ASSERT(ifp
->if_flags
& XFS_IFINLINE
);
612 sf
= (xfs_attr_shortform_t
*)ifp
->if_u1
.if_data
;
614 for (i
= 0; i
< sf
->hdr
.count
;
615 sfe
= XFS_ATTR_SF_NEXTENTRY(sfe
), i
++) {
616 if (sfe
->namelen
!= args
->namelen
)
618 if (memcmp(args
->name
, sfe
->nameval
, args
->namelen
) != 0)
620 if (!xfs_attr_namesp_match(args
->flags
, sfe
->flags
))
622 return(XFS_ERROR(EEXIST
));
624 return(XFS_ERROR(ENOATTR
));
628 * Look up a name in a shortform attribute list structure.
632 xfs_attr_shortform_getvalue(xfs_da_args_t
*args
)
634 xfs_attr_shortform_t
*sf
;
635 xfs_attr_sf_entry_t
*sfe
;
638 ASSERT(args
->dp
->i_d
.di_aformat
== XFS_IFINLINE
);
639 sf
= (xfs_attr_shortform_t
*)args
->dp
->i_afp
->if_u1
.if_data
;
641 for (i
= 0; i
< sf
->hdr
.count
;
642 sfe
= XFS_ATTR_SF_NEXTENTRY(sfe
), i
++) {
643 if (sfe
->namelen
!= args
->namelen
)
645 if (memcmp(args
->name
, sfe
->nameval
, args
->namelen
) != 0)
647 if (!xfs_attr_namesp_match(args
->flags
, sfe
->flags
))
649 if (args
->flags
& ATTR_KERNOVAL
) {
650 args
->valuelen
= sfe
->valuelen
;
651 return(XFS_ERROR(EEXIST
));
653 if (args
->valuelen
< sfe
->valuelen
) {
654 args
->valuelen
= sfe
->valuelen
;
655 return(XFS_ERROR(ERANGE
));
657 args
->valuelen
= sfe
->valuelen
;
658 memcpy(args
->value
, &sfe
->nameval
[args
->namelen
],
660 return(XFS_ERROR(EEXIST
));
662 return(XFS_ERROR(ENOATTR
));
666 * Convert from using the shortform to the leaf.
669 xfs_attr_shortform_to_leaf(xfs_da_args_t
*args
)
672 xfs_attr_shortform_t
*sf
;
673 xfs_attr_sf_entry_t
*sfe
;
681 trace_xfs_attr_sf_to_leaf(args
);
685 sf
= (xfs_attr_shortform_t
*)ifp
->if_u1
.if_data
;
686 size
= be16_to_cpu(sf
->hdr
.totsize
);
687 tmpbuffer
= kmem_alloc(size
, KM_SLEEP
);
688 ASSERT(tmpbuffer
!= NULL
);
689 memcpy(tmpbuffer
, ifp
->if_u1
.if_data
, size
);
690 sf
= (xfs_attr_shortform_t
*)tmpbuffer
;
692 xfs_idata_realloc(dp
, -size
, XFS_ATTR_FORK
);
694 error
= xfs_da_grow_inode(args
, &blkno
);
697 * If we hit an IO error middle of the transaction inside
698 * grow_inode(), we may have inconsistent data. Bail out.
702 xfs_idata_realloc(dp
, size
, XFS_ATTR_FORK
); /* try to put */
703 memcpy(ifp
->if_u1
.if_data
, tmpbuffer
, size
); /* it back */
708 error
= xfs_attr3_leaf_create(args
, blkno
, &bp
);
710 error
= xfs_da_shrink_inode(args
, 0, bp
);
714 xfs_idata_realloc(dp
, size
, XFS_ATTR_FORK
); /* try to put */
715 memcpy(ifp
->if_u1
.if_data
, tmpbuffer
, size
); /* it back */
719 memset((char *)&nargs
, 0, sizeof(nargs
));
721 nargs
.firstblock
= args
->firstblock
;
722 nargs
.flist
= args
->flist
;
723 nargs
.total
= args
->total
;
724 nargs
.whichfork
= XFS_ATTR_FORK
;
725 nargs
.trans
= args
->trans
;
726 nargs
.op_flags
= XFS_DA_OP_OKNOENT
;
729 for (i
= 0; i
< sf
->hdr
.count
; i
++) {
730 nargs
.name
= sfe
->nameval
;
731 nargs
.namelen
= sfe
->namelen
;
732 nargs
.value
= &sfe
->nameval
[nargs
.namelen
];
733 nargs
.valuelen
= sfe
->valuelen
;
734 nargs
.hashval
= xfs_da_hashname(sfe
->nameval
,
736 nargs
.flags
= XFS_ATTR_NSP_ONDISK_TO_ARGS(sfe
->flags
);
737 error
= xfs_attr3_leaf_lookup_int(bp
, &nargs
); /* set a->index */
738 ASSERT(error
== ENOATTR
);
739 error
= xfs_attr3_leaf_add(bp
, &nargs
);
740 ASSERT(error
!= ENOSPC
);
743 sfe
= XFS_ATTR_SF_NEXTENTRY(sfe
);
748 kmem_free(tmpbuffer
);
753 xfs_attr_shortform_compare(const void *a
, const void *b
)
755 xfs_attr_sf_sort_t
*sa
, *sb
;
757 sa
= (xfs_attr_sf_sort_t
*)a
;
758 sb
= (xfs_attr_sf_sort_t
*)b
;
759 if (sa
->hash
< sb
->hash
) {
761 } else if (sa
->hash
> sb
->hash
) {
764 return(sa
->entno
- sb
->entno
);
769 #define XFS_ISRESET_CURSOR(cursor) \
770 (!((cursor)->initted) && !((cursor)->hashval) && \
771 !((cursor)->blkno) && !((cursor)->offset))
773 * Copy out entries of shortform attribute lists for attr_list().
774 * Shortform attribute lists are not stored in hashval sorted order.
775 * If the output buffer is not large enough to hold them all, then we
776 * we have to calculate each entries' hashvalue and sort them before
777 * we can begin returning them to the user.
781 xfs_attr_shortform_list(xfs_attr_list_context_t
*context
)
783 attrlist_cursor_kern_t
*cursor
;
784 xfs_attr_sf_sort_t
*sbuf
, *sbp
;
785 xfs_attr_shortform_t
*sf
;
786 xfs_attr_sf_entry_t
*sfe
;
788 int sbsize
, nsbuf
, count
, i
;
791 ASSERT(context
!= NULL
);
794 ASSERT(dp
->i_afp
!= NULL
);
795 sf
= (xfs_attr_shortform_t
*)dp
->i_afp
->if_u1
.if_data
;
799 cursor
= context
->cursor
;
800 ASSERT(cursor
!= NULL
);
802 trace_xfs_attr_list_sf(context
);
805 * If the buffer is large enough and the cursor is at the start,
806 * do not bother with sorting since we will return everything in
807 * one buffer and another call using the cursor won't need to be
809 * Note the generous fudge factor of 16 overhead bytes per entry.
810 * If bufsize is zero then put_listent must be a search function
811 * and can just scan through what we have.
813 if (context
->bufsize
== 0 ||
814 (XFS_ISRESET_CURSOR(cursor
) &&
815 (dp
->i_afp
->if_bytes
+ sf
->hdr
.count
* 16) < context
->bufsize
)) {
816 for (i
= 0, sfe
= &sf
->list
[0]; i
< sf
->hdr
.count
; i
++) {
817 error
= context
->put_listent(context
,
822 &sfe
->nameval
[sfe
->namelen
]);
825 * Either search callback finished early or
826 * didn't fit it all in the buffer after all.
828 if (context
->seen_enough
)
833 sfe
= XFS_ATTR_SF_NEXTENTRY(sfe
);
835 trace_xfs_attr_list_sf_all(context
);
839 /* do no more for a search callback */
840 if (context
->bufsize
== 0)
844 * It didn't all fit, so we have to sort everything on hashval.
846 sbsize
= sf
->hdr
.count
* sizeof(*sbuf
);
847 sbp
= sbuf
= kmem_alloc(sbsize
, KM_SLEEP
| KM_NOFS
);
850 * Scan the attribute list for the rest of the entries, storing
851 * the relevant info from only those that match into a buffer.
854 for (i
= 0, sfe
= &sf
->list
[0]; i
< sf
->hdr
.count
; i
++) {
856 ((char *)sfe
< (char *)sf
) ||
857 ((char *)sfe
>= ((char *)sf
+ dp
->i_afp
->if_bytes
)))) {
858 XFS_CORRUPTION_ERROR("xfs_attr_shortform_list",
860 context
->dp
->i_mount
, sfe
);
862 return XFS_ERROR(EFSCORRUPTED
);
866 sbp
->hash
= xfs_da_hashname(sfe
->nameval
, sfe
->namelen
);
867 sbp
->name
= sfe
->nameval
;
868 sbp
->namelen
= sfe
->namelen
;
869 /* These are bytes, and both on-disk, don't endian-flip */
870 sbp
->valuelen
= sfe
->valuelen
;
871 sbp
->flags
= sfe
->flags
;
872 sfe
= XFS_ATTR_SF_NEXTENTRY(sfe
);
878 * Sort the entries on hash then entno.
880 xfs_sort(sbuf
, nsbuf
, sizeof(*sbuf
), xfs_attr_shortform_compare
);
883 * Re-find our place IN THE SORTED LIST.
888 for (sbp
= sbuf
, i
= 0; i
< nsbuf
; i
++, sbp
++) {
889 if (sbp
->hash
== cursor
->hashval
) {
890 if (cursor
->offset
== count
) {
894 } else if (sbp
->hash
> cursor
->hashval
) {
904 * Loop putting entries into the user buffer.
906 for ( ; i
< nsbuf
; i
++, sbp
++) {
907 if (cursor
->hashval
!= sbp
->hash
) {
908 cursor
->hashval
= sbp
->hash
;
911 error
= context
->put_listent(context
,
916 &sbp
->name
[sbp
->namelen
]);
919 if (context
->seen_enough
)
929 * Check a leaf attribute block to see if all the entries would fit into
930 * a shortform attribute list.
933 xfs_attr_shortform_allfit(
935 struct xfs_inode
*dp
)
937 struct xfs_attr_leafblock
*leaf
;
938 struct xfs_attr_leaf_entry
*entry
;
939 xfs_attr_leaf_name_local_t
*name_loc
;
940 struct xfs_attr3_icleaf_hdr leafhdr
;
945 xfs_attr3_leaf_hdr_from_disk(&leafhdr
, leaf
);
946 entry
= xfs_attr3_leaf_entryp(leaf
);
948 bytes
= sizeof(struct xfs_attr_sf_hdr
);
949 for (i
= 0; i
< leafhdr
.count
; entry
++, i
++) {
950 if (entry
->flags
& XFS_ATTR_INCOMPLETE
)
951 continue; /* don't copy partial entries */
952 if (!(entry
->flags
& XFS_ATTR_LOCAL
))
954 name_loc
= xfs_attr3_leaf_name_local(leaf
, i
);
955 if (name_loc
->namelen
>= XFS_ATTR_SF_ENTSIZE_MAX
)
957 if (be16_to_cpu(name_loc
->valuelen
) >= XFS_ATTR_SF_ENTSIZE_MAX
)
959 bytes
+= sizeof(struct xfs_attr_sf_entry
) - 1
961 + be16_to_cpu(name_loc
->valuelen
);
963 if ((dp
->i_mount
->m_flags
& XFS_MOUNT_ATTR2
) &&
964 (dp
->i_d
.di_format
!= XFS_DINODE_FMT_BTREE
) &&
965 (bytes
== sizeof(struct xfs_attr_sf_hdr
)))
967 return xfs_attr_shortform_bytesfit(dp
, bytes
);
971 * Convert a leaf attribute list to shortform attribute list
974 xfs_attr3_leaf_to_shortform(
976 struct xfs_da_args
*args
,
979 struct xfs_attr_leafblock
*leaf
;
980 struct xfs_attr3_icleaf_hdr ichdr
;
981 struct xfs_attr_leaf_entry
*entry
;
982 struct xfs_attr_leaf_name_local
*name_loc
;
983 struct xfs_da_args nargs
;
984 struct xfs_inode
*dp
= args
->dp
;
989 trace_xfs_attr_leaf_to_sf(args
);
991 tmpbuffer
= kmem_alloc(XFS_LBSIZE(dp
->i_mount
), KM_SLEEP
);
995 memcpy(tmpbuffer
, bp
->b_addr
, XFS_LBSIZE(dp
->i_mount
));
997 leaf
= (xfs_attr_leafblock_t
*)tmpbuffer
;
998 xfs_attr3_leaf_hdr_from_disk(&ichdr
, leaf
);
999 entry
= xfs_attr3_leaf_entryp(leaf
);
1001 /* XXX (dgc): buffer is about to be marked stale - why zero it? */
1002 memset(bp
->b_addr
, 0, XFS_LBSIZE(dp
->i_mount
));
1005 * Clean out the prior contents of the attribute list.
1007 error
= xfs_da_shrink_inode(args
, 0, bp
);
1011 if (forkoff
== -1) {
1012 ASSERT(dp
->i_mount
->m_flags
& XFS_MOUNT_ATTR2
);
1013 ASSERT(dp
->i_d
.di_format
!= XFS_DINODE_FMT_BTREE
);
1014 xfs_attr_fork_reset(dp
, args
->trans
);
1018 xfs_attr_shortform_create(args
);
1021 * Copy the attributes
1023 memset((char *)&nargs
, 0, sizeof(nargs
));
1025 nargs
.firstblock
= args
->firstblock
;
1026 nargs
.flist
= args
->flist
;
1027 nargs
.total
= args
->total
;
1028 nargs
.whichfork
= XFS_ATTR_FORK
;
1029 nargs
.trans
= args
->trans
;
1030 nargs
.op_flags
= XFS_DA_OP_OKNOENT
;
1032 for (i
= 0; i
< ichdr
.count
; entry
++, i
++) {
1033 if (entry
->flags
& XFS_ATTR_INCOMPLETE
)
1034 continue; /* don't copy partial entries */
1035 if (!entry
->nameidx
)
1037 ASSERT(entry
->flags
& XFS_ATTR_LOCAL
);
1038 name_loc
= xfs_attr3_leaf_name_local(leaf
, i
);
1039 nargs
.name
= name_loc
->nameval
;
1040 nargs
.namelen
= name_loc
->namelen
;
1041 nargs
.value
= &name_loc
->nameval
[nargs
.namelen
];
1042 nargs
.valuelen
= be16_to_cpu(name_loc
->valuelen
);
1043 nargs
.hashval
= be32_to_cpu(entry
->hashval
);
1044 nargs
.flags
= XFS_ATTR_NSP_ONDISK_TO_ARGS(entry
->flags
);
1045 xfs_attr_shortform_add(&nargs
, forkoff
);
1050 kmem_free(tmpbuffer
);
1055 * Convert from using a single leaf to a root node and a leaf.
1058 xfs_attr3_leaf_to_node(
1059 struct xfs_da_args
*args
)
1061 struct xfs_attr_leafblock
*leaf
;
1062 struct xfs_attr3_icleaf_hdr icleafhdr
;
1063 struct xfs_attr_leaf_entry
*entries
;
1064 struct xfs_da_node_entry
*btree
;
1065 struct xfs_da3_icnode_hdr icnodehdr
;
1066 struct xfs_da_intnode
*node
;
1067 struct xfs_inode
*dp
= args
->dp
;
1068 struct xfs_mount
*mp
= dp
->i_mount
;
1069 struct xfs_buf
*bp1
= NULL
;
1070 struct xfs_buf
*bp2
= NULL
;
1074 trace_xfs_attr_leaf_to_node(args
);
1076 error
= xfs_da_grow_inode(args
, &blkno
);
1079 error
= xfs_attr3_leaf_read(args
->trans
, dp
, 0, -1, &bp1
);
1083 error
= xfs_da_get_buf(args
->trans
, dp
, blkno
, -1, &bp2
, XFS_ATTR_FORK
);
1087 /* copy leaf to new buffer, update identifiers */
1088 xfs_trans_buf_set_type(args
->trans
, bp2
, XFS_BLFT_ATTR_LEAF_BUF
);
1089 bp2
->b_ops
= bp1
->b_ops
;
1090 memcpy(bp2
->b_addr
, bp1
->b_addr
, XFS_LBSIZE(mp
));
1091 if (xfs_sb_version_hascrc(&mp
->m_sb
)) {
1092 struct xfs_da3_blkinfo
*hdr3
= bp2
->b_addr
;
1093 hdr3
->blkno
= cpu_to_be64(bp2
->b_bn
);
1095 xfs_trans_log_buf(args
->trans
, bp2
, 0, XFS_LBSIZE(mp
) - 1);
1098 * Set up the new root node.
1100 error
= xfs_da3_node_create(args
, 0, 1, &bp1
, XFS_ATTR_FORK
);
1104 xfs_da3_node_hdr_from_disk(&icnodehdr
, node
);
1105 btree
= xfs_da3_node_tree_p(node
);
1108 xfs_attr3_leaf_hdr_from_disk(&icleafhdr
, leaf
);
1109 entries
= xfs_attr3_leaf_entryp(leaf
);
1111 /* both on-disk, don't endian-flip twice */
1112 btree
[0].hashval
= entries
[icleafhdr
.count
- 1].hashval
;
1113 btree
[0].before
= cpu_to_be32(blkno
);
1114 icnodehdr
.count
= 1;
1115 xfs_da3_node_hdr_to_disk(node
, &icnodehdr
);
1116 xfs_trans_log_buf(args
->trans
, bp1
, 0, XFS_LBSIZE(mp
) - 1);
1123 /*========================================================================
1124 * Routines used for growing the Btree.
1125 *========================================================================*/
1128 * Create the initial contents of a leaf attribute list
1129 * or a leaf in a node attribute list.
1132 xfs_attr3_leaf_create(
1133 struct xfs_da_args
*args
,
1135 struct xfs_buf
**bpp
)
1137 struct xfs_attr_leafblock
*leaf
;
1138 struct xfs_attr3_icleaf_hdr ichdr
;
1139 struct xfs_inode
*dp
= args
->dp
;
1140 struct xfs_mount
*mp
= dp
->i_mount
;
1144 trace_xfs_attr_leaf_create(args
);
1146 error
= xfs_da_get_buf(args
->trans
, args
->dp
, blkno
, -1, &bp
,
1150 bp
->b_ops
= &xfs_attr3_leaf_buf_ops
;
1151 xfs_trans_buf_set_type(args
->trans
, bp
, XFS_BLFT_ATTR_LEAF_BUF
);
1153 memset(leaf
, 0, XFS_LBSIZE(mp
));
1155 memset(&ichdr
, 0, sizeof(ichdr
));
1156 ichdr
.firstused
= XFS_LBSIZE(mp
);
1158 if (xfs_sb_version_hascrc(&mp
->m_sb
)) {
1159 struct xfs_da3_blkinfo
*hdr3
= bp
->b_addr
;
1161 ichdr
.magic
= XFS_ATTR3_LEAF_MAGIC
;
1163 hdr3
->blkno
= cpu_to_be64(bp
->b_bn
);
1164 hdr3
->owner
= cpu_to_be64(dp
->i_ino
);
1165 uuid_copy(&hdr3
->uuid
, &mp
->m_sb
.sb_uuid
);
1167 ichdr
.freemap
[0].base
= sizeof(struct xfs_attr3_leaf_hdr
);
1169 ichdr
.magic
= XFS_ATTR_LEAF_MAGIC
;
1170 ichdr
.freemap
[0].base
= sizeof(struct xfs_attr_leaf_hdr
);
1172 ichdr
.freemap
[0].size
= ichdr
.firstused
- ichdr
.freemap
[0].base
;
1174 xfs_attr3_leaf_hdr_to_disk(leaf
, &ichdr
);
1175 xfs_trans_log_buf(args
->trans
, bp
, 0, XFS_LBSIZE(mp
) - 1);
1182 * Split the leaf node, rebalance, then add the new entry.
1185 xfs_attr3_leaf_split(
1186 struct xfs_da_state
*state
,
1187 struct xfs_da_state_blk
*oldblk
,
1188 struct xfs_da_state_blk
*newblk
)
1193 trace_xfs_attr_leaf_split(state
->args
);
1196 * Allocate space for a new leaf node.
1198 ASSERT(oldblk
->magic
== XFS_ATTR_LEAF_MAGIC
);
1199 error
= xfs_da_grow_inode(state
->args
, &blkno
);
1202 error
= xfs_attr3_leaf_create(state
->args
, blkno
, &newblk
->bp
);
1205 newblk
->blkno
= blkno
;
1206 newblk
->magic
= XFS_ATTR_LEAF_MAGIC
;
1209 * Rebalance the entries across the two leaves.
1210 * NOTE: rebalance() currently depends on the 2nd block being empty.
1212 xfs_attr3_leaf_rebalance(state
, oldblk
, newblk
);
1213 error
= xfs_da3_blk_link(state
, oldblk
, newblk
);
1218 * Save info on "old" attribute for "atomic rename" ops, leaf_add()
1219 * modifies the index/blkno/rmtblk/rmtblkcnt fields to show the
1220 * "new" attrs info. Will need the "old" info to remove it later.
1222 * Insert the "new" entry in the correct block.
1224 if (state
->inleaf
) {
1225 trace_xfs_attr_leaf_add_old(state
->args
);
1226 error
= xfs_attr3_leaf_add(oldblk
->bp
, state
->args
);
1228 trace_xfs_attr_leaf_add_new(state
->args
);
1229 error
= xfs_attr3_leaf_add(newblk
->bp
, state
->args
);
1233 * Update last hashval in each block since we added the name.
1235 oldblk
->hashval
= xfs_attr_leaf_lasthash(oldblk
->bp
, NULL
);
1236 newblk
->hashval
= xfs_attr_leaf_lasthash(newblk
->bp
, NULL
);
1241 * Add a name to the leaf attribute list structure.
1246 struct xfs_da_args
*args
)
1248 struct xfs_attr_leafblock
*leaf
;
1249 struct xfs_attr3_icleaf_hdr ichdr
;
1256 trace_xfs_attr_leaf_add(args
);
1259 xfs_attr3_leaf_hdr_from_disk(&ichdr
, leaf
);
1260 ASSERT(args
->index
>= 0 && args
->index
<= ichdr
.count
);
1261 entsize
= xfs_attr_leaf_newentsize(args
->namelen
, args
->valuelen
,
1262 args
->trans
->t_mountp
->m_sb
.sb_blocksize
, NULL
);
1265 * Search through freemap for first-fit on new name length.
1266 * (may need to figure in size of entry struct too)
1268 tablesize
= (ichdr
.count
+ 1) * sizeof(xfs_attr_leaf_entry_t
)
1269 + xfs_attr3_leaf_hdr_size(leaf
);
1270 for (sum
= 0, i
= XFS_ATTR_LEAF_MAPSIZE
- 1; i
>= 0; i
--) {
1271 if (tablesize
> ichdr
.firstused
) {
1272 sum
+= ichdr
.freemap
[i
].size
;
1275 if (!ichdr
.freemap
[i
].size
)
1276 continue; /* no space in this map */
1278 if (ichdr
.freemap
[i
].base
< ichdr
.firstused
)
1279 tmp
+= sizeof(xfs_attr_leaf_entry_t
);
1280 if (ichdr
.freemap
[i
].size
>= tmp
) {
1281 tmp
= xfs_attr3_leaf_add_work(bp
, &ichdr
, args
, i
);
1284 sum
+= ichdr
.freemap
[i
].size
;
1288 * If there are no holes in the address space of the block,
1289 * and we don't have enough freespace, then compaction will do us
1290 * no good and we should just give up.
1292 if (!ichdr
.holes
&& sum
< entsize
)
1293 return XFS_ERROR(ENOSPC
);
1296 * Compact the entries to coalesce free space.
1297 * This may change the hdr->count via dropping INCOMPLETE entries.
1299 xfs_attr3_leaf_compact(args
, &ichdr
, bp
);
1302 * After compaction, the block is guaranteed to have only one
1303 * free region, in freemap[0]. If it is not big enough, give up.
1305 if (ichdr
.freemap
[0].size
< (entsize
+ sizeof(xfs_attr_leaf_entry_t
))) {
1310 tmp
= xfs_attr3_leaf_add_work(bp
, &ichdr
, args
, 0);
1313 xfs_attr3_leaf_hdr_to_disk(leaf
, &ichdr
);
1314 xfs_trans_log_buf(args
->trans
, bp
,
1315 XFS_DA_LOGRANGE(leaf
, &leaf
->hdr
,
1316 xfs_attr3_leaf_hdr_size(leaf
)));
1321 * Add a name to a leaf attribute list structure.
1324 xfs_attr3_leaf_add_work(
1326 struct xfs_attr3_icleaf_hdr
*ichdr
,
1327 struct xfs_da_args
*args
,
1330 struct xfs_attr_leafblock
*leaf
;
1331 struct xfs_attr_leaf_entry
*entry
;
1332 struct xfs_attr_leaf_name_local
*name_loc
;
1333 struct xfs_attr_leaf_name_remote
*name_rmt
;
1334 struct xfs_mount
*mp
;
1338 trace_xfs_attr_leaf_add_work(args
);
1341 ASSERT(mapindex
>= 0 && mapindex
< XFS_ATTR_LEAF_MAPSIZE
);
1342 ASSERT(args
->index
>= 0 && args
->index
<= ichdr
->count
);
1345 * Force open some space in the entry array and fill it in.
1347 entry
= &xfs_attr3_leaf_entryp(leaf
)[args
->index
];
1348 if (args
->index
< ichdr
->count
) {
1349 tmp
= ichdr
->count
- args
->index
;
1350 tmp
*= sizeof(xfs_attr_leaf_entry_t
);
1351 memmove(entry
+ 1, entry
, tmp
);
1352 xfs_trans_log_buf(args
->trans
, bp
,
1353 XFS_DA_LOGRANGE(leaf
, entry
, tmp
+ sizeof(*entry
)));
1358 * Allocate space for the new string (at the end of the run).
1360 mp
= args
->trans
->t_mountp
;
1361 ASSERT(ichdr
->freemap
[mapindex
].base
< XFS_LBSIZE(mp
));
1362 ASSERT((ichdr
->freemap
[mapindex
].base
& 0x3) == 0);
1363 ASSERT(ichdr
->freemap
[mapindex
].size
>=
1364 xfs_attr_leaf_newentsize(args
->namelen
, args
->valuelen
,
1365 mp
->m_sb
.sb_blocksize
, NULL
));
1366 ASSERT(ichdr
->freemap
[mapindex
].size
< XFS_LBSIZE(mp
));
1367 ASSERT((ichdr
->freemap
[mapindex
].size
& 0x3) == 0);
1369 ichdr
->freemap
[mapindex
].size
-=
1370 xfs_attr_leaf_newentsize(args
->namelen
, args
->valuelen
,
1371 mp
->m_sb
.sb_blocksize
, &tmp
);
1373 entry
->nameidx
= cpu_to_be16(ichdr
->freemap
[mapindex
].base
+
1374 ichdr
->freemap
[mapindex
].size
);
1375 entry
->hashval
= cpu_to_be32(args
->hashval
);
1376 entry
->flags
= tmp
? XFS_ATTR_LOCAL
: 0;
1377 entry
->flags
|= XFS_ATTR_NSP_ARGS_TO_ONDISK(args
->flags
);
1378 if (args
->op_flags
& XFS_DA_OP_RENAME
) {
1379 entry
->flags
|= XFS_ATTR_INCOMPLETE
;
1380 if ((args
->blkno2
== args
->blkno
) &&
1381 (args
->index2
<= args
->index
)) {
1385 xfs_trans_log_buf(args
->trans
, bp
,
1386 XFS_DA_LOGRANGE(leaf
, entry
, sizeof(*entry
)));
1387 ASSERT((args
->index
== 0) ||
1388 (be32_to_cpu(entry
->hashval
) >= be32_to_cpu((entry
-1)->hashval
)));
1389 ASSERT((args
->index
== ichdr
->count
- 1) ||
1390 (be32_to_cpu(entry
->hashval
) <= be32_to_cpu((entry
+1)->hashval
)));
1393 * For "remote" attribute values, simply note that we need to
1394 * allocate space for the "remote" value. We can't actually
1395 * allocate the extents in this transaction, and we can't decide
1396 * which blocks they should be as we might allocate more blocks
1397 * as part of this transaction (a split operation for example).
1399 if (entry
->flags
& XFS_ATTR_LOCAL
) {
1400 name_loc
= xfs_attr3_leaf_name_local(leaf
, args
->index
);
1401 name_loc
->namelen
= args
->namelen
;
1402 name_loc
->valuelen
= cpu_to_be16(args
->valuelen
);
1403 memcpy((char *)name_loc
->nameval
, args
->name
, args
->namelen
);
1404 memcpy((char *)&name_loc
->nameval
[args
->namelen
], args
->value
,
1405 be16_to_cpu(name_loc
->valuelen
));
1407 name_rmt
= xfs_attr3_leaf_name_remote(leaf
, args
->index
);
1408 name_rmt
->namelen
= args
->namelen
;
1409 memcpy((char *)name_rmt
->name
, args
->name
, args
->namelen
);
1410 entry
->flags
|= XFS_ATTR_INCOMPLETE
;
1412 name_rmt
->valuelen
= 0;
1413 name_rmt
->valueblk
= 0;
1415 args
->rmtblkcnt
= XFS_B_TO_FSB(mp
, args
->valuelen
);
1417 xfs_trans_log_buf(args
->trans
, bp
,
1418 XFS_DA_LOGRANGE(leaf
, xfs_attr3_leaf_name(leaf
, args
->index
),
1419 xfs_attr_leaf_entsize(leaf
, args
->index
)));
1422 * Update the control info for this leaf node
1424 if (be16_to_cpu(entry
->nameidx
) < ichdr
->firstused
)
1425 ichdr
->firstused
= be16_to_cpu(entry
->nameidx
);
1427 ASSERT(ichdr
->firstused
>= ichdr
->count
* sizeof(xfs_attr_leaf_entry_t
)
1428 + xfs_attr3_leaf_hdr_size(leaf
));
1429 tmp
= (ichdr
->count
- 1) * sizeof(xfs_attr_leaf_entry_t
)
1430 + xfs_attr3_leaf_hdr_size(leaf
);
1432 for (i
= 0; i
< XFS_ATTR_LEAF_MAPSIZE
; i
++) {
1433 if (ichdr
->freemap
[i
].base
== tmp
) {
1434 ichdr
->freemap
[i
].base
+= sizeof(xfs_attr_leaf_entry_t
);
1435 ichdr
->freemap
[i
].size
-= sizeof(xfs_attr_leaf_entry_t
);
1438 ichdr
->usedbytes
+= xfs_attr_leaf_entsize(leaf
, args
->index
);
1443 * Garbage collect a leaf attribute list block by copying it to a new buffer.
1446 xfs_attr3_leaf_compact(
1447 struct xfs_da_args
*args
,
1448 struct xfs_attr3_icleaf_hdr
*ichdr_d
,
1451 xfs_attr_leafblock_t
*leaf_s
, *leaf_d
;
1452 struct xfs_attr3_icleaf_hdr ichdr_s
;
1453 struct xfs_trans
*trans
= args
->trans
;
1454 struct xfs_mount
*mp
= trans
->t_mountp
;
1457 trace_xfs_attr_leaf_compact(args
);
1459 tmpbuffer
= kmem_alloc(XFS_LBSIZE(mp
), KM_SLEEP
);
1460 ASSERT(tmpbuffer
!= NULL
);
1461 memcpy(tmpbuffer
, bp
->b_addr
, XFS_LBSIZE(mp
));
1462 memset(bp
->b_addr
, 0, XFS_LBSIZE(mp
));
1465 * Copy basic information
1467 leaf_s
= (xfs_attr_leafblock_t
*)tmpbuffer
;
1468 leaf_d
= bp
->b_addr
;
1469 ichdr_s
= *ichdr_d
; /* struct copy */
1470 ichdr_d
->firstused
= XFS_LBSIZE(mp
);
1471 ichdr_d
->usedbytes
= 0;
1474 ichdr_d
->freemap
[0].base
= xfs_attr3_leaf_hdr_size(leaf_s
);
1475 ichdr_d
->freemap
[0].size
= ichdr_d
->firstused
- ichdr_d
->freemap
[0].base
;
1478 * Copy all entry's in the same (sorted) order,
1479 * but allocate name/value pairs packed and in sequence.
1481 xfs_attr3_leaf_moveents(leaf_s
, &ichdr_s
, 0, leaf_d
, ichdr_d
, 0,
1484 * this logs the entire buffer, but the caller must write the header
1485 * back to the buffer when it is finished modifying it.
1487 xfs_trans_log_buf(trans
, bp
, 0, XFS_LBSIZE(mp
) - 1);
1489 kmem_free(tmpbuffer
);
1493 * Compare two leaf blocks "order".
1494 * Return 0 unless leaf2 should go before leaf1.
1497 xfs_attr3_leaf_order(
1498 struct xfs_buf
*leaf1_bp
,
1499 struct xfs_attr3_icleaf_hdr
*leaf1hdr
,
1500 struct xfs_buf
*leaf2_bp
,
1501 struct xfs_attr3_icleaf_hdr
*leaf2hdr
)
1503 struct xfs_attr_leaf_entry
*entries1
;
1504 struct xfs_attr_leaf_entry
*entries2
;
1506 entries1
= xfs_attr3_leaf_entryp(leaf1_bp
->b_addr
);
1507 entries2
= xfs_attr3_leaf_entryp(leaf2_bp
->b_addr
);
1508 if (leaf1hdr
->count
> 0 && leaf2hdr
->count
> 0 &&
1509 ((be32_to_cpu(entries2
[0].hashval
) <
1510 be32_to_cpu(entries1
[0].hashval
)) ||
1511 (be32_to_cpu(entries2
[leaf2hdr
->count
- 1].hashval
) <
1512 be32_to_cpu(entries1
[leaf1hdr
->count
- 1].hashval
)))) {
1519 xfs_attr_leaf_order(
1520 struct xfs_buf
*leaf1_bp
,
1521 struct xfs_buf
*leaf2_bp
)
1523 struct xfs_attr3_icleaf_hdr ichdr1
;
1524 struct xfs_attr3_icleaf_hdr ichdr2
;
1526 xfs_attr3_leaf_hdr_from_disk(&ichdr1
, leaf1_bp
->b_addr
);
1527 xfs_attr3_leaf_hdr_from_disk(&ichdr2
, leaf2_bp
->b_addr
);
1528 return xfs_attr3_leaf_order(leaf1_bp
, &ichdr1
, leaf2_bp
, &ichdr2
);
1532 * Redistribute the attribute list entries between two leaf nodes,
1533 * taking into account the size of the new entry.
1535 * NOTE: if new block is empty, then it will get the upper half of the
1536 * old block. At present, all (one) callers pass in an empty second block.
1538 * This code adjusts the args->index/blkno and args->index2/blkno2 fields
1539 * to match what it is doing in splitting the attribute leaf block. Those
1540 * values are used in "atomic rename" operations on attributes. Note that
1541 * the "new" and "old" values can end up in different blocks.
1544 xfs_attr3_leaf_rebalance(
1545 struct xfs_da_state
*state
,
1546 struct xfs_da_state_blk
*blk1
,
1547 struct xfs_da_state_blk
*blk2
)
1549 struct xfs_da_args
*args
;
1550 struct xfs_attr_leafblock
*leaf1
;
1551 struct xfs_attr_leafblock
*leaf2
;
1552 struct xfs_attr3_icleaf_hdr ichdr1
;
1553 struct xfs_attr3_icleaf_hdr ichdr2
;
1554 struct xfs_attr_leaf_entry
*entries1
;
1555 struct xfs_attr_leaf_entry
*entries2
;
1563 * Set up environment.
1565 ASSERT(blk1
->magic
== XFS_ATTR_LEAF_MAGIC
);
1566 ASSERT(blk2
->magic
== XFS_ATTR_LEAF_MAGIC
);
1567 leaf1
= blk1
->bp
->b_addr
;
1568 leaf2
= blk2
->bp
->b_addr
;
1569 xfs_attr3_leaf_hdr_from_disk(&ichdr1
, leaf1
);
1570 xfs_attr3_leaf_hdr_from_disk(&ichdr2
, leaf2
);
1571 ASSERT(ichdr2
.count
== 0);
1574 trace_xfs_attr_leaf_rebalance(args
);
1577 * Check ordering of blocks, reverse if it makes things simpler.
1579 * NOTE: Given that all (current) callers pass in an empty
1580 * second block, this code should never set "swap".
1583 if (xfs_attr3_leaf_order(blk1
->bp
, &ichdr1
, blk2
->bp
, &ichdr2
)) {
1584 struct xfs_da_state_blk
*tmp_blk
;
1585 struct xfs_attr3_icleaf_hdr tmp_ichdr
;
1591 /* struct copies to swap them rather than reconverting */
1596 leaf1
= blk1
->bp
->b_addr
;
1597 leaf2
= blk2
->bp
->b_addr
;
1602 * Examine entries until we reduce the absolute difference in
1603 * byte usage between the two blocks to a minimum. Then get
1604 * the direction to copy and the number of elements to move.
1606 * "inleaf" is true if the new entry should be inserted into blk1.
1607 * If "swap" is also true, then reverse the sense of "inleaf".
1609 state
->inleaf
= xfs_attr3_leaf_figure_balance(state
, blk1
, &ichdr1
,
1613 state
->inleaf
= !state
->inleaf
;
1616 * Move any entries required from leaf to leaf:
1618 if (count
< ichdr1
.count
) {
1620 * Figure the total bytes to be added to the destination leaf.
1622 /* number entries being moved */
1623 count
= ichdr1
.count
- count
;
1624 space
= ichdr1
.usedbytes
- totallen
;
1625 space
+= count
* sizeof(xfs_attr_leaf_entry_t
);
1628 * leaf2 is the destination, compact it if it looks tight.
1630 max
= ichdr2
.firstused
- xfs_attr3_leaf_hdr_size(leaf1
);
1631 max
-= ichdr2
.count
* sizeof(xfs_attr_leaf_entry_t
);
1633 xfs_attr3_leaf_compact(args
, &ichdr2
, blk2
->bp
);
1636 * Move high entries from leaf1 to low end of leaf2.
1638 xfs_attr3_leaf_moveents(leaf1
, &ichdr1
, ichdr1
.count
- count
,
1639 leaf2
, &ichdr2
, 0, count
, state
->mp
);
1641 } else if (count
> ichdr1
.count
) {
1643 * I assert that since all callers pass in an empty
1644 * second buffer, this code should never execute.
1649 * Figure the total bytes to be added to the destination leaf.
1651 /* number entries being moved */
1652 count
-= ichdr1
.count
;
1653 space
= totallen
- ichdr1
.usedbytes
;
1654 space
+= count
* sizeof(xfs_attr_leaf_entry_t
);
1657 * leaf1 is the destination, compact it if it looks tight.
1659 max
= ichdr1
.firstused
- xfs_attr3_leaf_hdr_size(leaf1
);
1660 max
-= ichdr1
.count
* sizeof(xfs_attr_leaf_entry_t
);
1662 xfs_attr3_leaf_compact(args
, &ichdr1
, blk1
->bp
);
1665 * Move low entries from leaf2 to high end of leaf1.
1667 xfs_attr3_leaf_moveents(leaf2
, &ichdr2
, 0, leaf1
, &ichdr1
,
1668 ichdr1
.count
, count
, state
->mp
);
1671 xfs_attr3_leaf_hdr_to_disk(leaf1
, &ichdr1
);
1672 xfs_attr3_leaf_hdr_to_disk(leaf2
, &ichdr2
);
1673 xfs_trans_log_buf(args
->trans
, blk1
->bp
, 0, state
->blocksize
-1);
1674 xfs_trans_log_buf(args
->trans
, blk2
->bp
, 0, state
->blocksize
-1);
1677 * Copy out last hashval in each block for B-tree code.
1679 entries1
= xfs_attr3_leaf_entryp(leaf1
);
1680 entries2
= xfs_attr3_leaf_entryp(leaf2
);
1681 blk1
->hashval
= be32_to_cpu(entries1
[ichdr1
.count
- 1].hashval
);
1682 blk2
->hashval
= be32_to_cpu(entries2
[ichdr2
.count
- 1].hashval
);
1685 * Adjust the expected index for insertion.
1686 * NOTE: this code depends on the (current) situation that the
1687 * second block was originally empty.
1689 * If the insertion point moved to the 2nd block, we must adjust
1690 * the index. We must also track the entry just following the
1691 * new entry for use in an "atomic rename" operation, that entry
1692 * is always the "old" entry and the "new" entry is what we are
1693 * inserting. The index/blkno fields refer to the "old" entry,
1694 * while the index2/blkno2 fields refer to the "new" entry.
1696 if (blk1
->index
> ichdr1
.count
) {
1697 ASSERT(state
->inleaf
== 0);
1698 blk2
->index
= blk1
->index
- ichdr1
.count
;
1699 args
->index
= args
->index2
= blk2
->index
;
1700 args
->blkno
= args
->blkno2
= blk2
->blkno
;
1701 } else if (blk1
->index
== ichdr1
.count
) {
1702 if (state
->inleaf
) {
1703 args
->index
= blk1
->index
;
1704 args
->blkno
= blk1
->blkno
;
1706 args
->blkno2
= blk2
->blkno
;
1709 * On a double leaf split, the original attr location
1710 * is already stored in blkno2/index2, so don't
1711 * overwrite it overwise we corrupt the tree.
1713 blk2
->index
= blk1
->index
- ichdr1
.count
;
1714 args
->index
= blk2
->index
;
1715 args
->blkno
= blk2
->blkno
;
1716 if (!state
->extravalid
) {
1718 * set the new attr location to match the old
1719 * one and let the higher level split code
1720 * decide where in the leaf to place it.
1722 args
->index2
= blk2
->index
;
1723 args
->blkno2
= blk2
->blkno
;
1727 ASSERT(state
->inleaf
== 1);
1728 args
->index
= args
->index2
= blk1
->index
;
1729 args
->blkno
= args
->blkno2
= blk1
->blkno
;
1734 * Examine entries until we reduce the absolute difference in
1735 * byte usage between the two blocks to a minimum.
1736 * GROT: Is this really necessary? With other than a 512 byte blocksize,
1737 * GROT: there will always be enough room in either block for a new entry.
1738 * GROT: Do a double-split for this case?
1741 xfs_attr3_leaf_figure_balance(
1742 struct xfs_da_state
*state
,
1743 struct xfs_da_state_blk
*blk1
,
1744 struct xfs_attr3_icleaf_hdr
*ichdr1
,
1745 struct xfs_da_state_blk
*blk2
,
1746 struct xfs_attr3_icleaf_hdr
*ichdr2
,
1750 struct xfs_attr_leafblock
*leaf1
= blk1
->bp
->b_addr
;
1751 struct xfs_attr_leafblock
*leaf2
= blk2
->bp
->b_addr
;
1752 struct xfs_attr_leaf_entry
*entry
;
1763 * Examine entries until we reduce the absolute difference in
1764 * byte usage between the two blocks to a minimum.
1766 max
= ichdr1
->count
+ ichdr2
->count
;
1767 half
= (max
+ 1) * sizeof(*entry
);
1768 half
+= ichdr1
->usedbytes
+ ichdr2
->usedbytes
+
1769 xfs_attr_leaf_newentsize(state
->args
->namelen
,
1770 state
->args
->valuelen
,
1771 state
->blocksize
, NULL
);
1773 lastdelta
= state
->blocksize
;
1774 entry
= xfs_attr3_leaf_entryp(leaf1
);
1775 for (count
= index
= 0; count
< max
; entry
++, index
++, count
++) {
1777 #define XFS_ATTR_ABS(A) (((A) < 0) ? -(A) : (A))
1779 * The new entry is in the first block, account for it.
1781 if (count
== blk1
->index
) {
1782 tmp
= totallen
+ sizeof(*entry
) +
1783 xfs_attr_leaf_newentsize(
1784 state
->args
->namelen
,
1785 state
->args
->valuelen
,
1786 state
->blocksize
, NULL
);
1787 if (XFS_ATTR_ABS(half
- tmp
) > lastdelta
)
1789 lastdelta
= XFS_ATTR_ABS(half
- tmp
);
1795 * Wrap around into the second block if necessary.
1797 if (count
== ichdr1
->count
) {
1799 entry
= xfs_attr3_leaf_entryp(leaf1
);
1804 * Figure out if next leaf entry would be too much.
1806 tmp
= totallen
+ sizeof(*entry
) + xfs_attr_leaf_entsize(leaf1
,
1808 if (XFS_ATTR_ABS(half
- tmp
) > lastdelta
)
1810 lastdelta
= XFS_ATTR_ABS(half
- tmp
);
1816 * Calculate the number of usedbytes that will end up in lower block.
1817 * If new entry not in lower block, fix up the count.
1819 totallen
-= count
* sizeof(*entry
);
1821 totallen
-= sizeof(*entry
) +
1822 xfs_attr_leaf_newentsize(
1823 state
->args
->namelen
,
1824 state
->args
->valuelen
,
1825 state
->blocksize
, NULL
);
1829 *usedbytesarg
= totallen
;
1833 /*========================================================================
1834 * Routines used for shrinking the Btree.
1835 *========================================================================*/
1838 * Check a leaf block and its neighbors to see if the block should be
1839 * collapsed into one or the other neighbor. Always keep the block
1840 * with the smaller block number.
1841 * If the current block is over 50% full, don't try to join it, return 0.
1842 * If the block is empty, fill in the state structure and return 2.
1843 * If it can be collapsed, fill in the state structure and return 1.
1844 * If nothing can be done, return 0.
1846 * GROT: allow for INCOMPLETE entries in calculation.
1849 xfs_attr3_leaf_toosmall(
1850 struct xfs_da_state
*state
,
1853 struct xfs_attr_leafblock
*leaf
;
1854 struct xfs_da_state_blk
*blk
;
1855 struct xfs_attr3_icleaf_hdr ichdr
;
1864 trace_xfs_attr_leaf_toosmall(state
->args
);
1867 * Check for the degenerate case of the block being over 50% full.
1868 * If so, it's not worth even looking to see if we might be able
1869 * to coalesce with a sibling.
1871 blk
= &state
->path
.blk
[ state
->path
.active
-1 ];
1872 leaf
= blk
->bp
->b_addr
;
1873 xfs_attr3_leaf_hdr_from_disk(&ichdr
, leaf
);
1874 bytes
= xfs_attr3_leaf_hdr_size(leaf
) +
1875 ichdr
.count
* sizeof(xfs_attr_leaf_entry_t
) +
1877 if (bytes
> (state
->blocksize
>> 1)) {
1878 *action
= 0; /* blk over 50%, don't try to join */
1883 * Check for the degenerate case of the block being empty.
1884 * If the block is empty, we'll simply delete it, no need to
1885 * coalesce it with a sibling block. We choose (arbitrarily)
1886 * to merge with the forward block unless it is NULL.
1888 if (ichdr
.count
== 0) {
1890 * Make altpath point to the block we want to keep and
1891 * path point to the block we want to drop (this one).
1893 forward
= (ichdr
.forw
!= 0);
1894 memcpy(&state
->altpath
, &state
->path
, sizeof(state
->path
));
1895 error
= xfs_da3_path_shift(state
, &state
->altpath
, forward
,
1908 * Examine each sibling block to see if we can coalesce with
1909 * at least 25% free space to spare. We need to figure out
1910 * whether to merge with the forward or the backward block.
1911 * We prefer coalescing with the lower numbered sibling so as
1912 * to shrink an attribute list over time.
1914 /* start with smaller blk num */
1915 forward
= ichdr
.forw
< ichdr
.back
;
1916 for (i
= 0; i
< 2; forward
= !forward
, i
++) {
1917 struct xfs_attr3_icleaf_hdr ichdr2
;
1924 error
= xfs_attr3_leaf_read(state
->args
->trans
, state
->args
->dp
,
1929 xfs_attr3_leaf_hdr_from_disk(&ichdr2
, bp
->b_addr
);
1931 bytes
= state
->blocksize
- (state
->blocksize
>> 2) -
1932 ichdr
.usedbytes
- ichdr2
.usedbytes
-
1933 ((ichdr
.count
+ ichdr2
.count
) *
1934 sizeof(xfs_attr_leaf_entry_t
)) -
1935 xfs_attr3_leaf_hdr_size(leaf
);
1937 xfs_trans_brelse(state
->args
->trans
, bp
);
1939 break; /* fits with at least 25% to spare */
1947 * Make altpath point to the block we want to keep (the lower
1948 * numbered block) and path point to the block we want to drop.
1950 memcpy(&state
->altpath
, &state
->path
, sizeof(state
->path
));
1951 if (blkno
< blk
->blkno
) {
1952 error
= xfs_da3_path_shift(state
, &state
->altpath
, forward
,
1955 error
= xfs_da3_path_shift(state
, &state
->path
, forward
,
1969 * Remove a name from the leaf attribute list structure.
1971 * Return 1 if leaf is less than 37% full, 0 if >= 37% full.
1972 * If two leaves are 37% full, when combined they will leave 25% free.
1975 xfs_attr3_leaf_remove(
1977 struct xfs_da_args
*args
)
1979 struct xfs_attr_leafblock
*leaf
;
1980 struct xfs_attr3_icleaf_hdr ichdr
;
1981 struct xfs_attr_leaf_entry
*entry
;
1982 struct xfs_mount
*mp
= args
->trans
->t_mountp
;
1991 trace_xfs_attr_leaf_remove(args
);
1994 xfs_attr3_leaf_hdr_from_disk(&ichdr
, leaf
);
1996 ASSERT(ichdr
.count
> 0 && ichdr
.count
< XFS_LBSIZE(mp
) / 8);
1997 ASSERT(args
->index
>= 0 && args
->index
< ichdr
.count
);
1998 ASSERT(ichdr
.firstused
>= ichdr
.count
* sizeof(*entry
) +
1999 xfs_attr3_leaf_hdr_size(leaf
));
2001 entry
= &xfs_attr3_leaf_entryp(leaf
)[args
->index
];
2003 ASSERT(be16_to_cpu(entry
->nameidx
) >= ichdr
.firstused
);
2004 ASSERT(be16_to_cpu(entry
->nameidx
) < XFS_LBSIZE(mp
));
2007 * Scan through free region table:
2008 * check for adjacency of free'd entry with an existing one,
2009 * find smallest free region in case we need to replace it,
2010 * adjust any map that borders the entry table,
2012 tablesize
= ichdr
.count
* sizeof(xfs_attr_leaf_entry_t
)
2013 + xfs_attr3_leaf_hdr_size(leaf
);
2014 tmp
= ichdr
.freemap
[0].size
;
2015 before
= after
= -1;
2016 smallest
= XFS_ATTR_LEAF_MAPSIZE
- 1;
2017 entsize
= xfs_attr_leaf_entsize(leaf
, args
->index
);
2018 for (i
= 0; i
< XFS_ATTR_LEAF_MAPSIZE
; i
++) {
2019 ASSERT(ichdr
.freemap
[i
].base
< XFS_LBSIZE(mp
));
2020 ASSERT(ichdr
.freemap
[i
].size
< XFS_LBSIZE(mp
));
2021 if (ichdr
.freemap
[i
].base
== tablesize
) {
2022 ichdr
.freemap
[i
].base
-= sizeof(xfs_attr_leaf_entry_t
);
2023 ichdr
.freemap
[i
].size
+= sizeof(xfs_attr_leaf_entry_t
);
2026 if (ichdr
.freemap
[i
].base
+ ichdr
.freemap
[i
].size
==
2027 be16_to_cpu(entry
->nameidx
)) {
2029 } else if (ichdr
.freemap
[i
].base
==
2030 (be16_to_cpu(entry
->nameidx
) + entsize
)) {
2032 } else if (ichdr
.freemap
[i
].size
< tmp
) {
2033 tmp
= ichdr
.freemap
[i
].size
;
2039 * Coalesce adjacent freemap regions,
2040 * or replace the smallest region.
2042 if ((before
>= 0) || (after
>= 0)) {
2043 if ((before
>= 0) && (after
>= 0)) {
2044 ichdr
.freemap
[before
].size
+= entsize
;
2045 ichdr
.freemap
[before
].size
+= ichdr
.freemap
[after
].size
;
2046 ichdr
.freemap
[after
].base
= 0;
2047 ichdr
.freemap
[after
].size
= 0;
2048 } else if (before
>= 0) {
2049 ichdr
.freemap
[before
].size
+= entsize
;
2051 ichdr
.freemap
[after
].base
= be16_to_cpu(entry
->nameidx
);
2052 ichdr
.freemap
[after
].size
+= entsize
;
2056 * Replace smallest region (if it is smaller than free'd entry)
2058 if (ichdr
.freemap
[smallest
].size
< entsize
) {
2059 ichdr
.freemap
[smallest
].base
= be16_to_cpu(entry
->nameidx
);
2060 ichdr
.freemap
[smallest
].size
= entsize
;
2065 * Did we remove the first entry?
2067 if (be16_to_cpu(entry
->nameidx
) == ichdr
.firstused
)
2073 * Compress the remaining entries and zero out the removed stuff.
2075 memset(xfs_attr3_leaf_name(leaf
, args
->index
), 0, entsize
);
2076 ichdr
.usedbytes
-= entsize
;
2077 xfs_trans_log_buf(args
->trans
, bp
,
2078 XFS_DA_LOGRANGE(leaf
, xfs_attr3_leaf_name(leaf
, args
->index
),
2081 tmp
= (ichdr
.count
- args
->index
) * sizeof(xfs_attr_leaf_entry_t
);
2082 memmove(entry
, entry
+ 1, tmp
);
2084 xfs_trans_log_buf(args
->trans
, bp
,
2085 XFS_DA_LOGRANGE(leaf
, entry
, tmp
+ sizeof(xfs_attr_leaf_entry_t
)));
2087 entry
= &xfs_attr3_leaf_entryp(leaf
)[ichdr
.count
];
2088 memset(entry
, 0, sizeof(xfs_attr_leaf_entry_t
));
2091 * If we removed the first entry, re-find the first used byte
2092 * in the name area. Note that if the entry was the "firstused",
2093 * then we don't have a "hole" in our block resulting from
2094 * removing the name.
2097 tmp
= XFS_LBSIZE(mp
);
2098 entry
= xfs_attr3_leaf_entryp(leaf
);
2099 for (i
= ichdr
.count
- 1; i
>= 0; entry
++, i
--) {
2100 ASSERT(be16_to_cpu(entry
->nameidx
) >= ichdr
.firstused
);
2101 ASSERT(be16_to_cpu(entry
->nameidx
) < XFS_LBSIZE(mp
));
2103 if (be16_to_cpu(entry
->nameidx
) < tmp
)
2104 tmp
= be16_to_cpu(entry
->nameidx
);
2106 ichdr
.firstused
= tmp
;
2107 if (!ichdr
.firstused
)
2108 ichdr
.firstused
= tmp
- XFS_ATTR_LEAF_NAME_ALIGN
;
2110 ichdr
.holes
= 1; /* mark as needing compaction */
2112 xfs_attr3_leaf_hdr_to_disk(leaf
, &ichdr
);
2113 xfs_trans_log_buf(args
->trans
, bp
,
2114 XFS_DA_LOGRANGE(leaf
, &leaf
->hdr
,
2115 xfs_attr3_leaf_hdr_size(leaf
)));
2118 * Check if leaf is less than 50% full, caller may want to
2119 * "join" the leaf with a sibling if so.
2121 tmp
= ichdr
.usedbytes
+ xfs_attr3_leaf_hdr_size(leaf
) +
2122 ichdr
.count
* sizeof(xfs_attr_leaf_entry_t
);
2124 return tmp
< mp
->m_attr_magicpct
; /* leaf is < 37% full */
2128 * Move all the attribute list entries from drop_leaf into save_leaf.
2131 xfs_attr3_leaf_unbalance(
2132 struct xfs_da_state
*state
,
2133 struct xfs_da_state_blk
*drop_blk
,
2134 struct xfs_da_state_blk
*save_blk
)
2136 struct xfs_attr_leafblock
*drop_leaf
= drop_blk
->bp
->b_addr
;
2137 struct xfs_attr_leafblock
*save_leaf
= save_blk
->bp
->b_addr
;
2138 struct xfs_attr3_icleaf_hdr drophdr
;
2139 struct xfs_attr3_icleaf_hdr savehdr
;
2140 struct xfs_attr_leaf_entry
*entry
;
2141 struct xfs_mount
*mp
= state
->mp
;
2143 trace_xfs_attr_leaf_unbalance(state
->args
);
2145 drop_leaf
= drop_blk
->bp
->b_addr
;
2146 save_leaf
= save_blk
->bp
->b_addr
;
2147 xfs_attr3_leaf_hdr_from_disk(&drophdr
, drop_leaf
);
2148 xfs_attr3_leaf_hdr_from_disk(&savehdr
, save_leaf
);
2149 entry
= xfs_attr3_leaf_entryp(drop_leaf
);
2152 * Save last hashval from dying block for later Btree fixup.
2154 drop_blk
->hashval
= be32_to_cpu(entry
[drophdr
.count
- 1].hashval
);
2157 * Check if we need a temp buffer, or can we do it in place.
2158 * Note that we don't check "leaf" for holes because we will
2159 * always be dropping it, toosmall() decided that for us already.
2161 if (savehdr
.holes
== 0) {
2163 * dest leaf has no holes, so we add there. May need
2164 * to make some room in the entry array.
2166 if (xfs_attr3_leaf_order(save_blk
->bp
, &savehdr
,
2167 drop_blk
->bp
, &drophdr
)) {
2168 xfs_attr3_leaf_moveents(drop_leaf
, &drophdr
, 0,
2169 save_leaf
, &savehdr
, 0,
2172 xfs_attr3_leaf_moveents(drop_leaf
, &drophdr
, 0,
2173 save_leaf
, &savehdr
,
2174 savehdr
.count
, drophdr
.count
, mp
);
2178 * Destination has holes, so we make a temporary copy
2179 * of the leaf and add them both to that.
2181 struct xfs_attr_leafblock
*tmp_leaf
;
2182 struct xfs_attr3_icleaf_hdr tmphdr
;
2184 tmp_leaf
= kmem_zalloc(state
->blocksize
, KM_SLEEP
);
2187 * Copy the header into the temp leaf so that all the stuff
2188 * not in the incore header is present and gets copied back in
2189 * once we've moved all the entries.
2191 memcpy(tmp_leaf
, save_leaf
, xfs_attr3_leaf_hdr_size(save_leaf
));
2193 memset(&tmphdr
, 0, sizeof(tmphdr
));
2194 tmphdr
.magic
= savehdr
.magic
;
2195 tmphdr
.forw
= savehdr
.forw
;
2196 tmphdr
.back
= savehdr
.back
;
2197 tmphdr
.firstused
= state
->blocksize
;
2199 /* write the header to the temp buffer to initialise it */
2200 xfs_attr3_leaf_hdr_to_disk(tmp_leaf
, &tmphdr
);
2202 if (xfs_attr3_leaf_order(save_blk
->bp
, &savehdr
,
2203 drop_blk
->bp
, &drophdr
)) {
2204 xfs_attr3_leaf_moveents(drop_leaf
, &drophdr
, 0,
2205 tmp_leaf
, &tmphdr
, 0,
2207 xfs_attr3_leaf_moveents(save_leaf
, &savehdr
, 0,
2208 tmp_leaf
, &tmphdr
, tmphdr
.count
,
2211 xfs_attr3_leaf_moveents(save_leaf
, &savehdr
, 0,
2212 tmp_leaf
, &tmphdr
, 0,
2214 xfs_attr3_leaf_moveents(drop_leaf
, &drophdr
, 0,
2215 tmp_leaf
, &tmphdr
, tmphdr
.count
,
2218 memcpy(save_leaf
, tmp_leaf
, state
->blocksize
);
2219 savehdr
= tmphdr
; /* struct copy */
2220 kmem_free(tmp_leaf
);
2223 xfs_attr3_leaf_hdr_to_disk(save_leaf
, &savehdr
);
2224 xfs_trans_log_buf(state
->args
->trans
, save_blk
->bp
, 0,
2225 state
->blocksize
- 1);
2228 * Copy out last hashval in each block for B-tree code.
2230 entry
= xfs_attr3_leaf_entryp(save_leaf
);
2231 save_blk
->hashval
= be32_to_cpu(entry
[savehdr
.count
- 1].hashval
);
2234 /*========================================================================
2235 * Routines used for finding things in the Btree.
2236 *========================================================================*/
2239 * Look up a name in a leaf attribute list structure.
2240 * This is the internal routine, it uses the caller's buffer.
2242 * Note that duplicate keys are allowed, but only check within the
2243 * current leaf node. The Btree code must check in adjacent leaf nodes.
2245 * Return in args->index the index into the entry[] array of either
2246 * the found entry, or where the entry should have been (insert before
2249 * Don't change the args->value unless we find the attribute.
2252 xfs_attr3_leaf_lookup_int(
2254 struct xfs_da_args
*args
)
2256 struct xfs_attr_leafblock
*leaf
;
2257 struct xfs_attr3_icleaf_hdr ichdr
;
2258 struct xfs_attr_leaf_entry
*entry
;
2259 struct xfs_attr_leaf_entry
*entries
;
2260 struct xfs_attr_leaf_name_local
*name_loc
;
2261 struct xfs_attr_leaf_name_remote
*name_rmt
;
2262 xfs_dahash_t hashval
;
2266 trace_xfs_attr_leaf_lookup(args
);
2269 xfs_attr3_leaf_hdr_from_disk(&ichdr
, leaf
);
2270 entries
= xfs_attr3_leaf_entryp(leaf
);
2271 ASSERT(ichdr
.count
< XFS_LBSIZE(args
->dp
->i_mount
) / 8);
2274 * Binary search. (note: small blocks will skip this loop)
2276 hashval
= args
->hashval
;
2277 probe
= span
= ichdr
.count
/ 2;
2278 for (entry
= &entries
[probe
]; span
> 4; entry
= &entries
[probe
]) {
2280 if (be32_to_cpu(entry
->hashval
) < hashval
)
2282 else if (be32_to_cpu(entry
->hashval
) > hashval
)
2287 ASSERT(probe
>= 0 && (!ichdr
.count
|| probe
< ichdr
.count
));
2288 ASSERT(span
<= 4 || be32_to_cpu(entry
->hashval
) == hashval
);
2291 * Since we may have duplicate hashval's, find the first matching
2292 * hashval in the leaf.
2294 while (probe
> 0 && be32_to_cpu(entry
->hashval
) >= hashval
) {
2298 while (probe
< ichdr
.count
&&
2299 be32_to_cpu(entry
->hashval
) < hashval
) {
2303 if (probe
== ichdr
.count
|| be32_to_cpu(entry
->hashval
) != hashval
) {
2304 args
->index
= probe
;
2305 return XFS_ERROR(ENOATTR
);
2309 * Duplicate keys may be present, so search all of them for a match.
2311 for (; probe
< ichdr
.count
&& (be32_to_cpu(entry
->hashval
) == hashval
);
2314 * GROT: Add code to remove incomplete entries.
2317 * If we are looking for INCOMPLETE entries, show only those.
2318 * If we are looking for complete entries, show only those.
2320 if ((args
->flags
& XFS_ATTR_INCOMPLETE
) !=
2321 (entry
->flags
& XFS_ATTR_INCOMPLETE
)) {
2324 if (entry
->flags
& XFS_ATTR_LOCAL
) {
2325 name_loc
= xfs_attr3_leaf_name_local(leaf
, probe
);
2326 if (name_loc
->namelen
!= args
->namelen
)
2328 if (memcmp(args
->name
, name_loc
->nameval
,
2329 args
->namelen
) != 0)
2331 if (!xfs_attr_namesp_match(args
->flags
, entry
->flags
))
2333 args
->index
= probe
;
2334 return XFS_ERROR(EEXIST
);
2336 name_rmt
= xfs_attr3_leaf_name_remote(leaf
, probe
);
2337 if (name_rmt
->namelen
!= args
->namelen
)
2339 if (memcmp(args
->name
, name_rmt
->name
,
2340 args
->namelen
) != 0)
2342 if (!xfs_attr_namesp_match(args
->flags
, entry
->flags
))
2344 args
->index
= probe
;
2345 args
->valuelen
= be32_to_cpu(name_rmt
->valuelen
);
2346 args
->rmtblkno
= be32_to_cpu(name_rmt
->valueblk
);
2347 args
->rmtblkcnt
= XFS_B_TO_FSB(args
->dp
->i_mount
,
2349 return XFS_ERROR(EEXIST
);
2352 args
->index
= probe
;
2353 return XFS_ERROR(ENOATTR
);
2357 * Get the value associated with an attribute name from a leaf attribute
2361 xfs_attr3_leaf_getvalue(
2363 struct xfs_da_args
*args
)
2365 struct xfs_attr_leafblock
*leaf
;
2366 struct xfs_attr3_icleaf_hdr ichdr
;
2367 struct xfs_attr_leaf_entry
*entry
;
2368 struct xfs_attr_leaf_name_local
*name_loc
;
2369 struct xfs_attr_leaf_name_remote
*name_rmt
;
2373 xfs_attr3_leaf_hdr_from_disk(&ichdr
, leaf
);
2374 ASSERT(ichdr
.count
< XFS_LBSIZE(args
->dp
->i_mount
) / 8);
2375 ASSERT(args
->index
< ichdr
.count
);
2377 entry
= &xfs_attr3_leaf_entryp(leaf
)[args
->index
];
2378 if (entry
->flags
& XFS_ATTR_LOCAL
) {
2379 name_loc
= xfs_attr3_leaf_name_local(leaf
, args
->index
);
2380 ASSERT(name_loc
->namelen
== args
->namelen
);
2381 ASSERT(memcmp(args
->name
, name_loc
->nameval
, args
->namelen
) == 0);
2382 valuelen
= be16_to_cpu(name_loc
->valuelen
);
2383 if (args
->flags
& ATTR_KERNOVAL
) {
2384 args
->valuelen
= valuelen
;
2387 if (args
->valuelen
< valuelen
) {
2388 args
->valuelen
= valuelen
;
2389 return XFS_ERROR(ERANGE
);
2391 args
->valuelen
= valuelen
;
2392 memcpy(args
->value
, &name_loc
->nameval
[args
->namelen
], valuelen
);
2394 name_rmt
= xfs_attr3_leaf_name_remote(leaf
, args
->index
);
2395 ASSERT(name_rmt
->namelen
== args
->namelen
);
2396 ASSERT(memcmp(args
->name
, name_rmt
->name
, args
->namelen
) == 0);
2397 valuelen
= be32_to_cpu(name_rmt
->valuelen
);
2398 args
->rmtblkno
= be32_to_cpu(name_rmt
->valueblk
);
2399 args
->rmtblkcnt
= XFS_B_TO_FSB(args
->dp
->i_mount
, valuelen
);
2400 if (args
->flags
& ATTR_KERNOVAL
) {
2401 args
->valuelen
= valuelen
;
2404 if (args
->valuelen
< valuelen
) {
2405 args
->valuelen
= valuelen
;
2406 return XFS_ERROR(ERANGE
);
2408 args
->valuelen
= valuelen
;
2413 /*========================================================================
2415 *========================================================================*/
2418 * Move the indicated entries from one leaf to another.
2419 * NOTE: this routine modifies both source and destination leaves.
2423 xfs_attr3_leaf_moveents(
2424 struct xfs_attr_leafblock
*leaf_s
,
2425 struct xfs_attr3_icleaf_hdr
*ichdr_s
,
2427 struct xfs_attr_leafblock
*leaf_d
,
2428 struct xfs_attr3_icleaf_hdr
*ichdr_d
,
2431 struct xfs_mount
*mp
)
2433 struct xfs_attr_leaf_entry
*entry_s
;
2434 struct xfs_attr_leaf_entry
*entry_d
;
2440 * Check for nothing to do.
2446 * Set up environment.
2448 ASSERT(ichdr_s
->magic
== XFS_ATTR_LEAF_MAGIC
||
2449 ichdr_s
->magic
== XFS_ATTR3_LEAF_MAGIC
);
2450 ASSERT(ichdr_s
->magic
== ichdr_d
->magic
);
2451 ASSERT(ichdr_s
->count
> 0 && ichdr_s
->count
< XFS_LBSIZE(mp
) / 8);
2452 ASSERT(ichdr_s
->firstused
>= (ichdr_s
->count
* sizeof(*entry_s
))
2453 + xfs_attr3_leaf_hdr_size(leaf_s
));
2454 ASSERT(ichdr_d
->count
< XFS_LBSIZE(mp
) / 8);
2455 ASSERT(ichdr_d
->firstused
>= (ichdr_d
->count
* sizeof(*entry_d
))
2456 + xfs_attr3_leaf_hdr_size(leaf_d
));
2458 ASSERT(start_s
< ichdr_s
->count
);
2459 ASSERT(start_d
<= ichdr_d
->count
);
2460 ASSERT(count
<= ichdr_s
->count
);
2464 * Move the entries in the destination leaf up to make a hole?
2466 if (start_d
< ichdr_d
->count
) {
2467 tmp
= ichdr_d
->count
- start_d
;
2468 tmp
*= sizeof(xfs_attr_leaf_entry_t
);
2469 entry_s
= &xfs_attr3_leaf_entryp(leaf_d
)[start_d
];
2470 entry_d
= &xfs_attr3_leaf_entryp(leaf_d
)[start_d
+ count
];
2471 memmove(entry_d
, entry_s
, tmp
);
2475 * Copy all entry's in the same (sorted) order,
2476 * but allocate attribute info packed and in sequence.
2478 entry_s
= &xfs_attr3_leaf_entryp(leaf_s
)[start_s
];
2479 entry_d
= &xfs_attr3_leaf_entryp(leaf_d
)[start_d
];
2481 for (i
= 0; i
< count
; entry_s
++, entry_d
++, desti
++, i
++) {
2482 ASSERT(be16_to_cpu(entry_s
->nameidx
) >= ichdr_s
->firstused
);
2483 tmp
= xfs_attr_leaf_entsize(leaf_s
, start_s
+ i
);
2486 * Code to drop INCOMPLETE entries. Difficult to use as we
2487 * may also need to change the insertion index. Code turned
2488 * off for 6.2, should be revisited later.
2490 if (entry_s
->flags
& XFS_ATTR_INCOMPLETE
) { /* skip partials? */
2491 memset(xfs_attr3_leaf_name(leaf_s
, start_s
+ i
), 0, tmp
);
2492 ichdr_s
->usedbytes
-= tmp
;
2493 ichdr_s
->count
-= 1;
2494 entry_d
--; /* to compensate for ++ in loop hdr */
2496 if ((start_s
+ i
) < offset
)
2497 result
++; /* insertion index adjustment */
2500 ichdr_d
->firstused
-= tmp
;
2501 /* both on-disk, don't endian flip twice */
2502 entry_d
->hashval
= entry_s
->hashval
;
2503 entry_d
->nameidx
= cpu_to_be16(ichdr_d
->firstused
);
2504 entry_d
->flags
= entry_s
->flags
;
2505 ASSERT(be16_to_cpu(entry_d
->nameidx
) + tmp
2507 memmove(xfs_attr3_leaf_name(leaf_d
, desti
),
2508 xfs_attr3_leaf_name(leaf_s
, start_s
+ i
), tmp
);
2509 ASSERT(be16_to_cpu(entry_s
->nameidx
) + tmp
2511 memset(xfs_attr3_leaf_name(leaf_s
, start_s
+ i
), 0, tmp
);
2512 ichdr_s
->usedbytes
-= tmp
;
2513 ichdr_d
->usedbytes
+= tmp
;
2514 ichdr_s
->count
-= 1;
2515 ichdr_d
->count
+= 1;
2516 tmp
= ichdr_d
->count
* sizeof(xfs_attr_leaf_entry_t
)
2517 + xfs_attr3_leaf_hdr_size(leaf_d
);
2518 ASSERT(ichdr_d
->firstused
>= tmp
);
2525 * Zero out the entries we just copied.
2527 if (start_s
== ichdr_s
->count
) {
2528 tmp
= count
* sizeof(xfs_attr_leaf_entry_t
);
2529 entry_s
= &xfs_attr3_leaf_entryp(leaf_s
)[start_s
];
2530 ASSERT(((char *)entry_s
+ tmp
) <=
2531 ((char *)leaf_s
+ XFS_LBSIZE(mp
)));
2532 memset(entry_s
, 0, tmp
);
2535 * Move the remaining entries down to fill the hole,
2536 * then zero the entries at the top.
2538 tmp
= (ichdr_s
->count
- count
) * sizeof(xfs_attr_leaf_entry_t
);
2539 entry_s
= &xfs_attr3_leaf_entryp(leaf_s
)[start_s
+ count
];
2540 entry_d
= &xfs_attr3_leaf_entryp(leaf_s
)[start_s
];
2541 memmove(entry_d
, entry_s
, tmp
);
2543 tmp
= count
* sizeof(xfs_attr_leaf_entry_t
);
2544 entry_s
= &xfs_attr3_leaf_entryp(leaf_s
)[ichdr_s
->count
];
2545 ASSERT(((char *)entry_s
+ tmp
) <=
2546 ((char *)leaf_s
+ XFS_LBSIZE(mp
)));
2547 memset(entry_s
, 0, tmp
);
2551 * Fill in the freemap information
2553 ichdr_d
->freemap
[0].base
= xfs_attr3_leaf_hdr_size(leaf_d
);
2554 ichdr_d
->freemap
[0].base
+= ichdr_d
->count
* sizeof(xfs_attr_leaf_entry_t
);
2555 ichdr_d
->freemap
[0].size
= ichdr_d
->firstused
- ichdr_d
->freemap
[0].base
;
2556 ichdr_d
->freemap
[1].base
= 0;
2557 ichdr_d
->freemap
[2].base
= 0;
2558 ichdr_d
->freemap
[1].size
= 0;
2559 ichdr_d
->freemap
[2].size
= 0;
2560 ichdr_s
->holes
= 1; /* leaf may not be compact */
2564 * Pick up the last hashvalue from a leaf block.
2567 xfs_attr_leaf_lasthash(
2571 struct xfs_attr3_icleaf_hdr ichdr
;
2572 struct xfs_attr_leaf_entry
*entries
;
2574 xfs_attr3_leaf_hdr_from_disk(&ichdr
, bp
->b_addr
);
2575 entries
= xfs_attr3_leaf_entryp(bp
->b_addr
);
2577 *count
= ichdr
.count
;
2580 return be32_to_cpu(entries
[ichdr
.count
- 1].hashval
);
2584 * Calculate the number of bytes used to store the indicated attribute
2585 * (whether local or remote only calculate bytes in this block).
2588 xfs_attr_leaf_entsize(xfs_attr_leafblock_t
*leaf
, int index
)
2590 struct xfs_attr_leaf_entry
*entries
;
2591 xfs_attr_leaf_name_local_t
*name_loc
;
2592 xfs_attr_leaf_name_remote_t
*name_rmt
;
2595 entries
= xfs_attr3_leaf_entryp(leaf
);
2596 if (entries
[index
].flags
& XFS_ATTR_LOCAL
) {
2597 name_loc
= xfs_attr3_leaf_name_local(leaf
, index
);
2598 size
= xfs_attr_leaf_entsize_local(name_loc
->namelen
,
2599 be16_to_cpu(name_loc
->valuelen
));
2601 name_rmt
= xfs_attr3_leaf_name_remote(leaf
, index
);
2602 size
= xfs_attr_leaf_entsize_remote(name_rmt
->namelen
);
2608 * Calculate the number of bytes that would be required to store the new
2609 * attribute (whether local or remote only calculate bytes in this block).
2610 * This routine decides as a side effect whether the attribute will be
2611 * a "local" or a "remote" attribute.
2614 xfs_attr_leaf_newentsize(int namelen
, int valuelen
, int blocksize
, int *local
)
2618 size
= xfs_attr_leaf_entsize_local(namelen
, valuelen
);
2619 if (size
< xfs_attr_leaf_entsize_local_max(blocksize
)) {
2624 size
= xfs_attr_leaf_entsize_remote(namelen
);
2633 * Copy out attribute list entries for attr_list(), for leaf attribute lists.
2636 xfs_attr3_leaf_list_int(
2638 struct xfs_attr_list_context
*context
)
2640 struct attrlist_cursor_kern
*cursor
;
2641 struct xfs_attr_leafblock
*leaf
;
2642 struct xfs_attr3_icleaf_hdr ichdr
;
2643 struct xfs_attr_leaf_entry
*entries
;
2644 struct xfs_attr_leaf_entry
*entry
;
2648 trace_xfs_attr_list_leaf(context
);
2651 xfs_attr3_leaf_hdr_from_disk(&ichdr
, leaf
);
2652 entries
= xfs_attr3_leaf_entryp(leaf
);
2654 cursor
= context
->cursor
;
2655 cursor
->initted
= 1;
2658 * Re-find our place in the leaf block if this is a new syscall.
2660 if (context
->resynch
) {
2661 entry
= &entries
[0];
2662 for (i
= 0; i
< ichdr
.count
; entry
++, i
++) {
2663 if (be32_to_cpu(entry
->hashval
) == cursor
->hashval
) {
2664 if (cursor
->offset
== context
->dupcnt
) {
2665 context
->dupcnt
= 0;
2669 } else if (be32_to_cpu(entry
->hashval
) >
2671 context
->dupcnt
= 0;
2675 if (i
== ichdr
.count
) {
2676 trace_xfs_attr_list_notfound(context
);
2680 entry
= &entries
[0];
2683 context
->resynch
= 0;
2686 * We have found our place, start copying out the new attributes.
2689 for (; i
< ichdr
.count
; entry
++, i
++) {
2690 if (be32_to_cpu(entry
->hashval
) != cursor
->hashval
) {
2691 cursor
->hashval
= be32_to_cpu(entry
->hashval
);
2695 if (entry
->flags
& XFS_ATTR_INCOMPLETE
)
2696 continue; /* skip incomplete entries */
2698 if (entry
->flags
& XFS_ATTR_LOCAL
) {
2699 xfs_attr_leaf_name_local_t
*name_loc
=
2700 xfs_attr3_leaf_name_local(leaf
, i
);
2702 retval
= context
->put_listent(context
,
2705 (int)name_loc
->namelen
,
2706 be16_to_cpu(name_loc
->valuelen
),
2707 &name_loc
->nameval
[name_loc
->namelen
]);
2711 xfs_attr_leaf_name_remote_t
*name_rmt
=
2712 xfs_attr3_leaf_name_remote(leaf
, i
);
2714 int valuelen
= be32_to_cpu(name_rmt
->valuelen
);
2716 if (context
->put_value
) {
2719 memset((char *)&args
, 0, sizeof(args
));
2720 args
.dp
= context
->dp
;
2721 args
.whichfork
= XFS_ATTR_FORK
;
2722 args
.valuelen
= valuelen
;
2723 args
.value
= kmem_alloc(valuelen
, KM_SLEEP
| KM_NOFS
);
2724 args
.rmtblkno
= be32_to_cpu(name_rmt
->valueblk
);
2725 args
.rmtblkcnt
= XFS_B_TO_FSB(args
.dp
->i_mount
, valuelen
);
2726 retval
= xfs_attr_rmtval_get(&args
);
2729 retval
= context
->put_listent(context
,
2732 (int)name_rmt
->namelen
,
2735 kmem_free(args
.value
);
2737 retval
= context
->put_listent(context
,
2740 (int)name_rmt
->namelen
,
2747 if (context
->seen_enough
)
2751 trace_xfs_attr_list_leaf_end(context
);
2756 /*========================================================================
2757 * Manage the INCOMPLETE flag in a leaf entry
2758 *========================================================================*/
2761 * Clear the INCOMPLETE flag on an entry in a leaf block.
2764 xfs_attr3_leaf_clearflag(
2765 struct xfs_da_args
*args
)
2767 struct xfs_attr_leafblock
*leaf
;
2768 struct xfs_attr_leaf_entry
*entry
;
2769 struct xfs_attr_leaf_name_remote
*name_rmt
;
2773 struct xfs_attr3_icleaf_hdr ichdr
;
2774 xfs_attr_leaf_name_local_t
*name_loc
;
2779 trace_xfs_attr_leaf_clearflag(args
);
2781 * Set up the operation.
2783 error
= xfs_attr3_leaf_read(args
->trans
, args
->dp
, args
->blkno
, -1, &bp
);
2788 entry
= &xfs_attr3_leaf_entryp(leaf
)[args
->index
];
2789 ASSERT(entry
->flags
& XFS_ATTR_INCOMPLETE
);
2792 xfs_attr3_leaf_hdr_from_disk(&ichdr
, leaf
);
2793 ASSERT(args
->index
< ichdr
.count
);
2794 ASSERT(args
->index
>= 0);
2796 if (entry
->flags
& XFS_ATTR_LOCAL
) {
2797 name_loc
= xfs_attr3_leaf_name_local(leaf
, args
->index
);
2798 namelen
= name_loc
->namelen
;
2799 name
= (char *)name_loc
->nameval
;
2801 name_rmt
= xfs_attr3_leaf_name_remote(leaf
, args
->index
);
2802 namelen
= name_rmt
->namelen
;
2803 name
= (char *)name_rmt
->name
;
2805 ASSERT(be32_to_cpu(entry
->hashval
) == args
->hashval
);
2806 ASSERT(namelen
== args
->namelen
);
2807 ASSERT(memcmp(name
, args
->name
, namelen
) == 0);
2810 entry
->flags
&= ~XFS_ATTR_INCOMPLETE
;
2811 xfs_trans_log_buf(args
->trans
, bp
,
2812 XFS_DA_LOGRANGE(leaf
, entry
, sizeof(*entry
)));
2814 if (args
->rmtblkno
) {
2815 ASSERT((entry
->flags
& XFS_ATTR_LOCAL
) == 0);
2816 name_rmt
= xfs_attr3_leaf_name_remote(leaf
, args
->index
);
2817 name_rmt
->valueblk
= cpu_to_be32(args
->rmtblkno
);
2818 name_rmt
->valuelen
= cpu_to_be32(args
->valuelen
);
2819 xfs_trans_log_buf(args
->trans
, bp
,
2820 XFS_DA_LOGRANGE(leaf
, name_rmt
, sizeof(*name_rmt
)));
2824 * Commit the flag value change and start the next trans in series.
2826 return xfs_trans_roll(&args
->trans
, args
->dp
);
2830 * Set the INCOMPLETE flag on an entry in a leaf block.
2833 xfs_attr3_leaf_setflag(
2834 struct xfs_da_args
*args
)
2836 struct xfs_attr_leafblock
*leaf
;
2837 struct xfs_attr_leaf_entry
*entry
;
2838 struct xfs_attr_leaf_name_remote
*name_rmt
;
2842 struct xfs_attr3_icleaf_hdr ichdr
;
2845 trace_xfs_attr_leaf_setflag(args
);
2848 * Set up the operation.
2850 error
= xfs_attr3_leaf_read(args
->trans
, args
->dp
, args
->blkno
, -1, &bp
);
2856 xfs_attr3_leaf_hdr_from_disk(&ichdr
, leaf
);
2857 ASSERT(args
->index
< ichdr
.count
);
2858 ASSERT(args
->index
>= 0);
2860 entry
= &xfs_attr3_leaf_entryp(leaf
)[args
->index
];
2862 ASSERT((entry
->flags
& XFS_ATTR_INCOMPLETE
) == 0);
2863 entry
->flags
|= XFS_ATTR_INCOMPLETE
;
2864 xfs_trans_log_buf(args
->trans
, bp
,
2865 XFS_DA_LOGRANGE(leaf
, entry
, sizeof(*entry
)));
2866 if ((entry
->flags
& XFS_ATTR_LOCAL
) == 0) {
2867 name_rmt
= xfs_attr3_leaf_name_remote(leaf
, args
->index
);
2868 name_rmt
->valueblk
= 0;
2869 name_rmt
->valuelen
= 0;
2870 xfs_trans_log_buf(args
->trans
, bp
,
2871 XFS_DA_LOGRANGE(leaf
, name_rmt
, sizeof(*name_rmt
)));
2875 * Commit the flag value change and start the next trans in series.
2877 return xfs_trans_roll(&args
->trans
, args
->dp
);
2881 * In a single transaction, clear the INCOMPLETE flag on the leaf entry
2882 * given by args->blkno/index and set the INCOMPLETE flag on the leaf
2883 * entry given by args->blkno2/index2.
2885 * Note that they could be in different blocks, or in the same block.
2888 xfs_attr3_leaf_flipflags(
2889 struct xfs_da_args
*args
)
2891 struct xfs_attr_leafblock
*leaf1
;
2892 struct xfs_attr_leafblock
*leaf2
;
2893 struct xfs_attr_leaf_entry
*entry1
;
2894 struct xfs_attr_leaf_entry
*entry2
;
2895 struct xfs_attr_leaf_name_remote
*name_rmt
;
2896 struct xfs_buf
*bp1
;
2897 struct xfs_buf
*bp2
;
2900 struct xfs_attr3_icleaf_hdr ichdr1
;
2901 struct xfs_attr3_icleaf_hdr ichdr2
;
2902 xfs_attr_leaf_name_local_t
*name_loc
;
2903 int namelen1
, namelen2
;
2904 char *name1
, *name2
;
2907 trace_xfs_attr_leaf_flipflags(args
);
2910 * Read the block containing the "old" attr
2912 error
= xfs_attr3_leaf_read(args
->trans
, args
->dp
, args
->blkno
, -1, &bp1
);
2917 * Read the block containing the "new" attr, if it is different
2919 if (args
->blkno2
!= args
->blkno
) {
2920 error
= xfs_attr3_leaf_read(args
->trans
, args
->dp
, args
->blkno2
,
2928 leaf1
= bp1
->b_addr
;
2929 entry1
= &xfs_attr3_leaf_entryp(leaf1
)[args
->index
];
2931 leaf2
= bp2
->b_addr
;
2932 entry2
= &xfs_attr3_leaf_entryp(leaf2
)[args
->index2
];
2935 xfs_attr3_leaf_hdr_from_disk(&ichdr1
, leaf1
);
2936 ASSERT(args
->index
< ichdr1
.count
);
2937 ASSERT(args
->index
>= 0);
2939 xfs_attr3_leaf_hdr_from_disk(&ichdr2
, leaf2
);
2940 ASSERT(args
->index2
< ichdr2
.count
);
2941 ASSERT(args
->index2
>= 0);
2943 if (entry1
->flags
& XFS_ATTR_LOCAL
) {
2944 name_loc
= xfs_attr3_leaf_name_local(leaf1
, args
->index
);
2945 namelen1
= name_loc
->namelen
;
2946 name1
= (char *)name_loc
->nameval
;
2948 name_rmt
= xfs_attr3_leaf_name_remote(leaf1
, args
->index
);
2949 namelen1
= name_rmt
->namelen
;
2950 name1
= (char *)name_rmt
->name
;
2952 if (entry2
->flags
& XFS_ATTR_LOCAL
) {
2953 name_loc
= xfs_attr3_leaf_name_local(leaf2
, args
->index2
);
2954 namelen2
= name_loc
->namelen
;
2955 name2
= (char *)name_loc
->nameval
;
2957 name_rmt
= xfs_attr3_leaf_name_remote(leaf2
, args
->index2
);
2958 namelen2
= name_rmt
->namelen
;
2959 name2
= (char *)name_rmt
->name
;
2961 ASSERT(be32_to_cpu(entry1
->hashval
) == be32_to_cpu(entry2
->hashval
));
2962 ASSERT(namelen1
== namelen2
);
2963 ASSERT(memcmp(name1
, name2
, namelen1
) == 0);
2966 ASSERT(entry1
->flags
& XFS_ATTR_INCOMPLETE
);
2967 ASSERT((entry2
->flags
& XFS_ATTR_INCOMPLETE
) == 0);
2969 entry1
->flags
&= ~XFS_ATTR_INCOMPLETE
;
2970 xfs_trans_log_buf(args
->trans
, bp1
,
2971 XFS_DA_LOGRANGE(leaf1
, entry1
, sizeof(*entry1
)));
2972 if (args
->rmtblkno
) {
2973 ASSERT((entry1
->flags
& XFS_ATTR_LOCAL
) == 0);
2974 name_rmt
= xfs_attr3_leaf_name_remote(leaf1
, args
->index
);
2975 name_rmt
->valueblk
= cpu_to_be32(args
->rmtblkno
);
2976 name_rmt
->valuelen
= cpu_to_be32(args
->valuelen
);
2977 xfs_trans_log_buf(args
->trans
, bp1
,
2978 XFS_DA_LOGRANGE(leaf1
, name_rmt
, sizeof(*name_rmt
)));
2981 entry2
->flags
|= XFS_ATTR_INCOMPLETE
;
2982 xfs_trans_log_buf(args
->trans
, bp2
,
2983 XFS_DA_LOGRANGE(leaf2
, entry2
, sizeof(*entry2
)));
2984 if ((entry2
->flags
& XFS_ATTR_LOCAL
) == 0) {
2985 name_rmt
= xfs_attr3_leaf_name_remote(leaf2
, args
->index2
);
2986 name_rmt
->valueblk
= 0;
2987 name_rmt
->valuelen
= 0;
2988 xfs_trans_log_buf(args
->trans
, bp2
,
2989 XFS_DA_LOGRANGE(leaf2
, name_rmt
, sizeof(*name_rmt
)));
2993 * Commit the flag value change and start the next trans in series.
2995 error
= xfs_trans_roll(&args
->trans
, args
->dp
);
3000 /*========================================================================
3001 * Indiscriminately delete the entire attribute fork
3002 *========================================================================*/
3005 * Recurse (gasp!) through the attribute nodes until we find leaves.
3006 * We're doing a depth-first traversal in order to invalidate everything.
3009 xfs_attr3_root_inactive(
3010 struct xfs_trans
**trans
,
3011 struct xfs_inode
*dp
)
3013 struct xfs_da_blkinfo
*info
;
3019 * Read block 0 to see what we have to work with.
3020 * We only get here if we have extents, since we remove
3021 * the extents in reverse order the extent containing
3022 * block 0 must still be there.
3024 error
= xfs_da3_node_read(*trans
, dp
, 0, -1, &bp
, XFS_ATTR_FORK
);
3030 * Invalidate the tree, even if the "tree" is only a single leaf block.
3031 * This is a depth-first traversal!
3034 switch (info
->magic
) {
3035 case cpu_to_be16(XFS_DA_NODE_MAGIC
):
3036 case cpu_to_be16(XFS_DA3_NODE_MAGIC
):
3037 error
= xfs_attr3_node_inactive(trans
, dp
, bp
, 1);
3039 case cpu_to_be16(XFS_ATTR_LEAF_MAGIC
):
3040 case cpu_to_be16(XFS_ATTR3_LEAF_MAGIC
):
3041 error
= xfs_attr3_leaf_inactive(trans
, dp
, bp
);
3044 error
= XFS_ERROR(EIO
);
3045 xfs_trans_brelse(*trans
, bp
);
3052 * Invalidate the incore copy of the root block.
3054 error
= xfs_da_get_buf(*trans
, dp
, 0, blkno
, &bp
, XFS_ATTR_FORK
);
3057 xfs_trans_binval(*trans
, bp
); /* remove from cache */
3059 * Commit the invalidate and start the next transaction.
3061 error
= xfs_trans_roll(trans
, dp
);
3067 * Recurse (gasp!) through the attribute nodes until we find leaves.
3068 * We're doing a depth-first traversal in order to invalidate everything.
3071 xfs_attr3_node_inactive(
3072 struct xfs_trans
**trans
,
3073 struct xfs_inode
*dp
,
3077 xfs_da_blkinfo_t
*info
;
3078 xfs_da_intnode_t
*node
;
3079 xfs_dablk_t child_fsb
;
3080 xfs_daddr_t parent_blkno
, child_blkno
;
3082 struct xfs_buf
*child_bp
;
3083 struct xfs_da_node_entry
*btree
;
3084 struct xfs_da3_icnode_hdr ichdr
;
3087 * Since this code is recursive (gasp!) we must protect ourselves.
3089 if (level
> XFS_DA_NODE_MAXDEPTH
) {
3090 xfs_trans_brelse(*trans
, bp
); /* no locks for later trans */
3091 return XFS_ERROR(EIO
);
3095 xfs_da3_node_hdr_from_disk(&ichdr
, node
);
3096 parent_blkno
= bp
->b_bn
;
3098 xfs_trans_brelse(*trans
, bp
);
3101 btree
= xfs_da3_node_tree_p(node
);
3102 child_fsb
= be32_to_cpu(btree
[0].before
);
3103 xfs_trans_brelse(*trans
, bp
); /* no locks for later trans */
3106 * If this is the node level just above the leaves, simply loop
3107 * over the leaves removing all of them. If this is higher up
3108 * in the tree, recurse downward.
3110 for (i
= 0; i
< ichdr
.count
; i
++) {
3112 * Read the subsidiary block to see what we have to work with.
3113 * Don't do this in a transaction. This is a depth-first
3114 * traversal of the tree so we may deal with many blocks
3115 * before we come back to this one.
3117 error
= xfs_da3_node_read(*trans
, dp
, child_fsb
, -2, &child_bp
,
3122 /* save for re-read later */
3123 child_blkno
= XFS_BUF_ADDR(child_bp
);
3126 * Invalidate the subtree, however we have to.
3128 info
= child_bp
->b_addr
;
3129 switch (info
->magic
) {
3130 case cpu_to_be16(XFS_DA_NODE_MAGIC
):
3131 case cpu_to_be16(XFS_DA3_NODE_MAGIC
):
3132 error
= xfs_attr3_node_inactive(trans
, dp
,
3133 child_bp
, level
+ 1);
3135 case cpu_to_be16(XFS_ATTR_LEAF_MAGIC
):
3136 case cpu_to_be16(XFS_ATTR3_LEAF_MAGIC
):
3137 error
= xfs_attr3_leaf_inactive(trans
, dp
,
3141 error
= XFS_ERROR(EIO
);
3142 xfs_trans_brelse(*trans
, child_bp
);
3149 * Remove the subsidiary block from the cache
3152 error
= xfs_da_get_buf(*trans
, dp
, 0, child_blkno
,
3153 &child_bp
, XFS_ATTR_FORK
);
3156 xfs_trans_binval(*trans
, child_bp
);
3160 * If we're not done, re-read the parent to get the next
3161 * child block number.
3163 if (i
+ 1 < ichdr
.count
) {
3164 error
= xfs_da3_node_read(*trans
, dp
, 0, parent_blkno
,
3165 &bp
, XFS_ATTR_FORK
);
3168 child_fsb
= be32_to_cpu(btree
[i
+ 1].before
);
3169 xfs_trans_brelse(*trans
, bp
);
3172 * Atomically commit the whole invalidate stuff.
3174 error
= xfs_trans_roll(trans
, dp
);
3183 * Invalidate all of the "remote" value regions pointed to by a particular
3185 * Note that we must release the lock on the buffer so that we are not
3186 * caught holding something that the logging code wants to flush to disk.
3189 xfs_attr3_leaf_inactive(
3190 struct xfs_trans
**trans
,
3191 struct xfs_inode
*dp
,
3194 struct xfs_attr_leafblock
*leaf
;
3195 struct xfs_attr3_icleaf_hdr ichdr
;
3196 struct xfs_attr_leaf_entry
*entry
;
3197 struct xfs_attr_leaf_name_remote
*name_rmt
;
3198 struct xfs_attr_inactive_list
*list
;
3199 struct xfs_attr_inactive_list
*lp
;
3207 xfs_attr3_leaf_hdr_from_disk(&ichdr
, leaf
);
3210 * Count the number of "remote" value extents.
3213 entry
= xfs_attr3_leaf_entryp(leaf
);
3214 for (i
= 0; i
< ichdr
.count
; entry
++, i
++) {
3215 if (be16_to_cpu(entry
->nameidx
) &&
3216 ((entry
->flags
& XFS_ATTR_LOCAL
) == 0)) {
3217 name_rmt
= xfs_attr3_leaf_name_remote(leaf
, i
);
3218 if (name_rmt
->valueblk
)
3224 * If there are no "remote" values, we're done.
3227 xfs_trans_brelse(*trans
, bp
);
3232 * Allocate storage for a list of all the "remote" value extents.
3234 size
= count
* sizeof(xfs_attr_inactive_list_t
);
3235 list
= kmem_alloc(size
, KM_SLEEP
);
3238 * Identify each of the "remote" value extents.
3241 entry
= xfs_attr3_leaf_entryp(leaf
);
3242 for (i
= 0; i
< ichdr
.count
; entry
++, i
++) {
3243 if (be16_to_cpu(entry
->nameidx
) &&
3244 ((entry
->flags
& XFS_ATTR_LOCAL
) == 0)) {
3245 name_rmt
= xfs_attr3_leaf_name_remote(leaf
, i
);
3246 if (name_rmt
->valueblk
) {
3247 lp
->valueblk
= be32_to_cpu(name_rmt
->valueblk
);
3248 lp
->valuelen
= XFS_B_TO_FSB(dp
->i_mount
,
3249 be32_to_cpu(name_rmt
->valuelen
));
3254 xfs_trans_brelse(*trans
, bp
); /* unlock for trans. in freextent() */
3257 * Invalidate each of the "remote" value extents.
3260 for (lp
= list
, i
= 0; i
< count
; i
++, lp
++) {
3261 tmp
= xfs_attr3_leaf_freextent(trans
, dp
,
3262 lp
->valueblk
, lp
->valuelen
);
3265 error
= tmp
; /* save only the 1st errno */
3273 * Look at all the extents for this logical region,
3274 * invalidate any buffers that are incore/in transactions.
3277 xfs_attr3_leaf_freextent(
3278 struct xfs_trans
**trans
,
3279 struct xfs_inode
*dp
,
3283 struct xfs_bmbt_irec map
;
3293 * Roll through the "value", invalidating the attribute value's
3298 while (tblkcnt
> 0) {
3300 * Try to remember where we decided to put the value.
3303 error
= xfs_bmapi_read(dp
, (xfs_fileoff_t
)tblkno
, tblkcnt
,
3304 &map
, &nmap
, XFS_BMAPI_ATTRFORK
);
3309 ASSERT(map
.br_startblock
!= DELAYSTARTBLOCK
);
3312 * If it's a hole, these are already unmapped
3313 * so there's nothing to invalidate.
3315 if (map
.br_startblock
!= HOLESTARTBLOCK
) {
3317 dblkno
= XFS_FSB_TO_DADDR(dp
->i_mount
,
3319 dblkcnt
= XFS_FSB_TO_BB(dp
->i_mount
,
3321 bp
= xfs_trans_get_buf(*trans
,
3322 dp
->i_mount
->m_ddev_targp
,
3323 dblkno
, dblkcnt
, 0);
3326 xfs_trans_binval(*trans
, bp
);
3328 * Roll to next transaction.
3330 error
= xfs_trans_roll(trans
, dp
);
3335 tblkno
+= map
.br_blockcount
;
3336 tblkcnt
-= map
.br_blockcount
;