1 /* -*- mode: c; c-basic-offset: 8; -*-
2 * vim: noexpandtab sw=8 ts=8 sts=0:
6 * Copyright (C) 2004, 2008 Oracle. All rights reserved.
9 * Lots of code in this file is copy from linux/fs/ext3/xattr.c.
10 * Copyright (C) 2001-2003 Andreas Gruenbacher, <agruen@suse.de>
12 * This program is free software; you can redistribute it and/or
13 * modify it under the terms of the GNU General Public
14 * License version 2 as published by the Free Software Foundation.
16 * This program is distributed in the hope that it will be useful,
17 * but WITHOUT ANY WARRANTY; without even the implied warranty of
18 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
19 * General Public License for more details.
22 #include <linux/capability.h>
24 #include <linux/types.h>
25 #include <linux/slab.h>
26 #include <linux/highmem.h>
27 #include <linux/pagemap.h>
28 #include <linux/uio.h>
29 #include <linux/sched.h>
30 #include <linux/splice.h>
31 #include <linux/mount.h>
32 #include <linux/writeback.h>
33 #include <linux/falloc.h>
34 #include <linux/sort.h>
35 #include <linux/init.h>
36 #include <linux/module.h>
37 #include <linux/string.h>
38 #include <linux/security.h>
40 #include <cluster/masklog.h>
44 #include "blockcheck.h"
54 #include "buffer_head_io.h"
57 #include "refcounttree.h"
59 #include "ocfs2_trace.h"
61 struct ocfs2_xattr_def_value_root
{
62 struct ocfs2_xattr_value_root xv
;
63 struct ocfs2_extent_rec er
;
66 struct ocfs2_xattr_bucket
{
67 /* The inode these xattrs are associated with */
68 struct inode
*bu_inode
;
70 /* The actual buffers that make up the bucket */
71 struct buffer_head
*bu_bhs
[OCFS2_XATTR_MAX_BLOCKS_PER_BUCKET
];
73 /* How many blocks make up one bucket for this filesystem */
77 struct ocfs2_xattr_set_ctxt
{
79 struct ocfs2_alloc_context
*meta_ac
;
80 struct ocfs2_alloc_context
*data_ac
;
81 struct ocfs2_cached_dealloc_ctxt dealloc
;
85 #define OCFS2_XATTR_ROOT_SIZE (sizeof(struct ocfs2_xattr_def_value_root))
86 #define OCFS2_XATTR_INLINE_SIZE 80
87 #define OCFS2_XATTR_HEADER_GAP 4
88 #define OCFS2_XATTR_FREE_IN_IBODY (OCFS2_MIN_XATTR_INLINE_SIZE \
89 - sizeof(struct ocfs2_xattr_header) \
90 - OCFS2_XATTR_HEADER_GAP)
91 #define OCFS2_XATTR_FREE_IN_BLOCK(ptr) ((ptr)->i_sb->s_blocksize \
92 - sizeof(struct ocfs2_xattr_block) \
93 - sizeof(struct ocfs2_xattr_header) \
94 - OCFS2_XATTR_HEADER_GAP)
96 static struct ocfs2_xattr_def_value_root def_xv
= {
97 .xv
.xr_list
.l_count
= cpu_to_le16(1),
100 const struct xattr_handler
*ocfs2_xattr_handlers
[] = {
101 &ocfs2_xattr_user_handler
,
102 &posix_acl_access_xattr_handler
,
103 &posix_acl_default_xattr_handler
,
104 &ocfs2_xattr_trusted_handler
,
105 &ocfs2_xattr_security_handler
,
109 static const struct xattr_handler
*ocfs2_xattr_handler_map
[OCFS2_XATTR_MAX
] = {
110 [OCFS2_XATTR_INDEX_USER
] = &ocfs2_xattr_user_handler
,
111 [OCFS2_XATTR_INDEX_POSIX_ACL_ACCESS
]
112 = &posix_acl_access_xattr_handler
,
113 [OCFS2_XATTR_INDEX_POSIX_ACL_DEFAULT
]
114 = &posix_acl_default_xattr_handler
,
115 [OCFS2_XATTR_INDEX_TRUSTED
] = &ocfs2_xattr_trusted_handler
,
116 [OCFS2_XATTR_INDEX_SECURITY
] = &ocfs2_xattr_security_handler
,
119 struct ocfs2_xattr_info
{
123 const void *xi_value
;
127 struct ocfs2_xattr_search
{
128 struct buffer_head
*inode_bh
;
130 * xattr_bh point to the block buffer head which has extended attribute
131 * when extended attribute in inode, xattr_bh is equal to inode_bh.
133 struct buffer_head
*xattr_bh
;
134 struct ocfs2_xattr_header
*header
;
135 struct ocfs2_xattr_bucket
*bucket
;
138 struct ocfs2_xattr_entry
*here
;
142 /* Operations on struct ocfs2_xa_entry */
144 struct ocfs2_xa_loc_operations
{
148 int (*xlo_journal_access
)(handle_t
*handle
, struct ocfs2_xa_loc
*loc
,
150 void (*xlo_journal_dirty
)(handle_t
*handle
, struct ocfs2_xa_loc
*loc
);
153 * Return a pointer to the appropriate buffer in loc->xl_storage
154 * at the given offset from loc->xl_header.
156 void *(*xlo_offset_pointer
)(struct ocfs2_xa_loc
*loc
, int offset
);
158 /* Can we reuse the existing entry for the new value? */
159 int (*xlo_can_reuse
)(struct ocfs2_xa_loc
*loc
,
160 struct ocfs2_xattr_info
*xi
);
162 /* How much space is needed for the new value? */
163 int (*xlo_check_space
)(struct ocfs2_xa_loc
*loc
,
164 struct ocfs2_xattr_info
*xi
);
167 * Return the offset of the first name+value pair. This is
168 * the start of our downward-filling free space.
170 int (*xlo_get_free_start
)(struct ocfs2_xa_loc
*loc
);
173 * Remove the name+value at this location. Do whatever is
174 * appropriate with the remaining name+value pairs.
176 void (*xlo_wipe_namevalue
)(struct ocfs2_xa_loc
*loc
);
178 /* Fill xl_entry with a new entry */
179 void (*xlo_add_entry
)(struct ocfs2_xa_loc
*loc
, u32 name_hash
);
181 /* Add name+value storage to an entry */
182 void (*xlo_add_namevalue
)(struct ocfs2_xa_loc
*loc
, int size
);
185 * Initialize the value buf's access and bh fields for this entry.
186 * ocfs2_xa_fill_value_buf() will handle the xv pointer.
188 void (*xlo_fill_value_buf
)(struct ocfs2_xa_loc
*loc
,
189 struct ocfs2_xattr_value_buf
*vb
);
193 * Describes an xattr entry location. This is a memory structure
194 * tracking the on-disk structure.
196 struct ocfs2_xa_loc
{
197 /* This xattr belongs to this inode */
198 struct inode
*xl_inode
;
200 /* The ocfs2_xattr_header inside the on-disk storage. Not NULL. */
201 struct ocfs2_xattr_header
*xl_header
;
203 /* Bytes from xl_header to the end of the storage */
207 * The ocfs2_xattr_entry this location describes. If this is
208 * NULL, this location describes the on-disk structure where it
211 struct ocfs2_xattr_entry
*xl_entry
;
214 * Internal housekeeping
217 /* Buffer(s) containing this entry */
220 /* Operations on the storage backing this location */
221 const struct ocfs2_xa_loc_operations
*xl_ops
;
225 * Convenience functions to calculate how much space is needed for a
226 * given name+value pair
228 static int namevalue_size(int name_len
, uint64_t value_len
)
230 if (value_len
> OCFS2_XATTR_INLINE_SIZE
)
231 return OCFS2_XATTR_SIZE(name_len
) + OCFS2_XATTR_ROOT_SIZE
;
233 return OCFS2_XATTR_SIZE(name_len
) + OCFS2_XATTR_SIZE(value_len
);
236 static int namevalue_size_xi(struct ocfs2_xattr_info
*xi
)
238 return namevalue_size(xi
->xi_name_len
, xi
->xi_value_len
);
241 static int namevalue_size_xe(struct ocfs2_xattr_entry
*xe
)
243 u64 value_len
= le64_to_cpu(xe
->xe_value_size
);
245 BUG_ON((value_len
> OCFS2_XATTR_INLINE_SIZE
) &&
246 ocfs2_xattr_is_local(xe
));
247 return namevalue_size(xe
->xe_name_len
, value_len
);
251 static int ocfs2_xattr_bucket_get_name_value(struct super_block
*sb
,
252 struct ocfs2_xattr_header
*xh
,
257 static int ocfs2_xattr_block_find(struct inode
*inode
,
260 struct ocfs2_xattr_search
*xs
);
261 static int ocfs2_xattr_index_block_find(struct inode
*inode
,
262 struct buffer_head
*root_bh
,
265 struct ocfs2_xattr_search
*xs
);
267 static int ocfs2_xattr_tree_list_index_block(struct inode
*inode
,
268 struct buffer_head
*blk_bh
,
272 static int ocfs2_xattr_create_index_block(struct inode
*inode
,
273 struct ocfs2_xattr_search
*xs
,
274 struct ocfs2_xattr_set_ctxt
*ctxt
);
276 static int ocfs2_xattr_set_entry_index_block(struct inode
*inode
,
277 struct ocfs2_xattr_info
*xi
,
278 struct ocfs2_xattr_search
*xs
,
279 struct ocfs2_xattr_set_ctxt
*ctxt
);
281 typedef int (xattr_tree_rec_func
)(struct inode
*inode
,
282 struct buffer_head
*root_bh
,
283 u64 blkno
, u32 cpos
, u32 len
, void *para
);
284 static int ocfs2_iterate_xattr_index_block(struct inode
*inode
,
285 struct buffer_head
*root_bh
,
286 xattr_tree_rec_func
*rec_func
,
288 static int ocfs2_delete_xattr_in_bucket(struct inode
*inode
,
289 struct ocfs2_xattr_bucket
*bucket
,
291 static int ocfs2_rm_xattr_cluster(struct inode
*inode
,
292 struct buffer_head
*root_bh
,
298 static int ocfs2_mv_xattr_buckets(struct inode
*inode
, handle_t
*handle
,
299 u64 src_blk
, u64 last_blk
, u64 to_blk
,
300 unsigned int start_bucket
,
302 static int ocfs2_prepare_refcount_xattr(struct inode
*inode
,
303 struct ocfs2_dinode
*di
,
304 struct ocfs2_xattr_info
*xi
,
305 struct ocfs2_xattr_search
*xis
,
306 struct ocfs2_xattr_search
*xbs
,
307 struct ocfs2_refcount_tree
**ref_tree
,
310 static int ocfs2_get_xattr_tree_value_root(struct super_block
*sb
,
311 struct ocfs2_xattr_bucket
*bucket
,
313 struct ocfs2_xattr_value_root
**xv
,
314 struct buffer_head
**bh
);
316 static inline u16
ocfs2_xattr_buckets_per_cluster(struct ocfs2_super
*osb
)
318 return (1 << osb
->s_clustersize_bits
) / OCFS2_XATTR_BUCKET_SIZE
;
321 static inline u16
ocfs2_blocks_per_xattr_bucket(struct super_block
*sb
)
323 return OCFS2_XATTR_BUCKET_SIZE
/ (1 << sb
->s_blocksize_bits
);
326 #define bucket_blkno(_b) ((_b)->bu_bhs[0]->b_blocknr)
327 #define bucket_block(_b, _n) ((_b)->bu_bhs[(_n)]->b_data)
328 #define bucket_xh(_b) ((struct ocfs2_xattr_header *)bucket_block((_b), 0))
330 static struct ocfs2_xattr_bucket
*ocfs2_xattr_bucket_new(struct inode
*inode
)
332 struct ocfs2_xattr_bucket
*bucket
;
333 int blks
= ocfs2_blocks_per_xattr_bucket(inode
->i_sb
);
335 BUG_ON(blks
> OCFS2_XATTR_MAX_BLOCKS_PER_BUCKET
);
337 bucket
= kzalloc(sizeof(struct ocfs2_xattr_bucket
), GFP_NOFS
);
339 bucket
->bu_inode
= inode
;
340 bucket
->bu_blocks
= blks
;
346 static void ocfs2_xattr_bucket_relse(struct ocfs2_xattr_bucket
*bucket
)
350 for (i
= 0; i
< bucket
->bu_blocks
; i
++) {
351 brelse(bucket
->bu_bhs
[i
]);
352 bucket
->bu_bhs
[i
] = NULL
;
356 static void ocfs2_xattr_bucket_free(struct ocfs2_xattr_bucket
*bucket
)
359 ocfs2_xattr_bucket_relse(bucket
);
360 bucket
->bu_inode
= NULL
;
366 * A bucket that has never been written to disk doesn't need to be
367 * read. We just need the buffer_heads. Don't call this for
368 * buckets that are already on disk. ocfs2_read_xattr_bucket() initializes
371 static int ocfs2_init_xattr_bucket(struct ocfs2_xattr_bucket
*bucket
,
372 u64 xb_blkno
, int new)
376 for (i
= 0; i
< bucket
->bu_blocks
; i
++) {
377 bucket
->bu_bhs
[i
] = sb_getblk(bucket
->bu_inode
->i_sb
,
379 if (!bucket
->bu_bhs
[i
]) {
385 if (!ocfs2_buffer_uptodate(INODE_CACHE(bucket
->bu_inode
),
386 bucket
->bu_bhs
[i
])) {
388 ocfs2_set_new_buffer_uptodate(INODE_CACHE(bucket
->bu_inode
),
391 set_buffer_uptodate(bucket
->bu_bhs
[i
]);
392 ocfs2_set_buffer_uptodate(INODE_CACHE(bucket
->bu_inode
),
399 ocfs2_xattr_bucket_relse(bucket
);
403 /* Read the xattr bucket at xb_blkno */
404 static int ocfs2_read_xattr_bucket(struct ocfs2_xattr_bucket
*bucket
,
409 rc
= ocfs2_read_blocks(INODE_CACHE(bucket
->bu_inode
), xb_blkno
,
410 bucket
->bu_blocks
, bucket
->bu_bhs
, 0,
413 spin_lock(&OCFS2_SB(bucket
->bu_inode
->i_sb
)->osb_xattr_lock
);
414 rc
= ocfs2_validate_meta_ecc_bhs(bucket
->bu_inode
->i_sb
,
417 &bucket_xh(bucket
)->xh_check
);
418 spin_unlock(&OCFS2_SB(bucket
->bu_inode
->i_sb
)->osb_xattr_lock
);
424 ocfs2_xattr_bucket_relse(bucket
);
428 static int ocfs2_xattr_bucket_journal_access(handle_t
*handle
,
429 struct ocfs2_xattr_bucket
*bucket
,
434 for (i
= 0; i
< bucket
->bu_blocks
; i
++) {
435 rc
= ocfs2_journal_access(handle
,
436 INODE_CACHE(bucket
->bu_inode
),
437 bucket
->bu_bhs
[i
], type
);
447 static void ocfs2_xattr_bucket_journal_dirty(handle_t
*handle
,
448 struct ocfs2_xattr_bucket
*bucket
)
452 spin_lock(&OCFS2_SB(bucket
->bu_inode
->i_sb
)->osb_xattr_lock
);
453 ocfs2_compute_meta_ecc_bhs(bucket
->bu_inode
->i_sb
,
454 bucket
->bu_bhs
, bucket
->bu_blocks
,
455 &bucket_xh(bucket
)->xh_check
);
456 spin_unlock(&OCFS2_SB(bucket
->bu_inode
->i_sb
)->osb_xattr_lock
);
458 for (i
= 0; i
< bucket
->bu_blocks
; i
++)
459 ocfs2_journal_dirty(handle
, bucket
->bu_bhs
[i
]);
462 static void ocfs2_xattr_bucket_copy_data(struct ocfs2_xattr_bucket
*dest
,
463 struct ocfs2_xattr_bucket
*src
)
466 int blocksize
= src
->bu_inode
->i_sb
->s_blocksize
;
468 BUG_ON(dest
->bu_blocks
!= src
->bu_blocks
);
469 BUG_ON(dest
->bu_inode
!= src
->bu_inode
);
471 for (i
= 0; i
< src
->bu_blocks
; i
++) {
472 memcpy(bucket_block(dest
, i
), bucket_block(src
, i
),
477 static int ocfs2_validate_xattr_block(struct super_block
*sb
,
478 struct buffer_head
*bh
)
481 struct ocfs2_xattr_block
*xb
=
482 (struct ocfs2_xattr_block
*)bh
->b_data
;
484 trace_ocfs2_validate_xattr_block((unsigned long long)bh
->b_blocknr
);
486 BUG_ON(!buffer_uptodate(bh
));
489 * If the ecc fails, we return the error but otherwise
490 * leave the filesystem running. We know any error is
491 * local to this block.
493 rc
= ocfs2_validate_meta_ecc(sb
, bh
->b_data
, &xb
->xb_check
);
498 * Errors after here are fatal
501 if (!OCFS2_IS_VALID_XATTR_BLOCK(xb
)) {
503 "Extended attribute block #%llu has bad "
505 (unsigned long long)bh
->b_blocknr
, 7,
510 if (le64_to_cpu(xb
->xb_blkno
) != bh
->b_blocknr
) {
512 "Extended attribute block #%llu has an "
513 "invalid xb_blkno of %llu",
514 (unsigned long long)bh
->b_blocknr
,
515 (unsigned long long)le64_to_cpu(xb
->xb_blkno
));
519 if (le32_to_cpu(xb
->xb_fs_generation
) != OCFS2_SB(sb
)->fs_generation
) {
521 "Extended attribute block #%llu has an invalid "
522 "xb_fs_generation of #%u",
523 (unsigned long long)bh
->b_blocknr
,
524 le32_to_cpu(xb
->xb_fs_generation
));
531 static int ocfs2_read_xattr_block(struct inode
*inode
, u64 xb_blkno
,
532 struct buffer_head
**bh
)
535 struct buffer_head
*tmp
= *bh
;
537 rc
= ocfs2_read_block(INODE_CACHE(inode
), xb_blkno
, &tmp
,
538 ocfs2_validate_xattr_block
);
540 /* If ocfs2_read_block() got us a new bh, pass it up. */
547 static inline const char *ocfs2_xattr_prefix(int name_index
)
549 const struct xattr_handler
*handler
= NULL
;
551 if (name_index
> 0 && name_index
< OCFS2_XATTR_MAX
)
552 handler
= ocfs2_xattr_handler_map
[name_index
];
554 return handler
? handler
->prefix
: NULL
;
557 static u32
ocfs2_xattr_name_hash(struct inode
*inode
,
561 /* Get hash value of uuid from super block */
562 u32 hash
= OCFS2_SB(inode
->i_sb
)->uuid_hash
;
565 /* hash extended attribute name */
566 for (i
= 0; i
< name_len
; i
++) {
567 hash
= (hash
<< OCFS2_HASH_SHIFT
) ^
568 (hash
>> (8*sizeof(hash
) - OCFS2_HASH_SHIFT
)) ^
575 static int ocfs2_xattr_entry_real_size(int name_len
, size_t value_len
)
577 return namevalue_size(name_len
, value_len
) +
578 sizeof(struct ocfs2_xattr_entry
);
581 static int ocfs2_xi_entry_usage(struct ocfs2_xattr_info
*xi
)
583 return namevalue_size_xi(xi
) +
584 sizeof(struct ocfs2_xattr_entry
);
587 static int ocfs2_xe_entry_usage(struct ocfs2_xattr_entry
*xe
)
589 return namevalue_size_xe(xe
) +
590 sizeof(struct ocfs2_xattr_entry
);
593 int ocfs2_calc_security_init(struct inode
*dir
,
594 struct ocfs2_security_xattr_info
*si
,
597 struct ocfs2_alloc_context
**xattr_ac
)
600 struct ocfs2_super
*osb
= OCFS2_SB(dir
->i_sb
);
601 int s_size
= ocfs2_xattr_entry_real_size(strlen(si
->name
),
605 * The max space of security xattr taken inline is
606 * 256(name) + 80(value) + 16(entry) = 352 bytes,
607 * So reserve one metadata block for it is ok.
609 if (dir
->i_sb
->s_blocksize
== OCFS2_MIN_BLOCKSIZE
||
610 s_size
> OCFS2_XATTR_FREE_IN_IBODY
) {
611 ret
= ocfs2_reserve_new_metadata_blocks(osb
, 1, xattr_ac
);
616 *xattr_credits
+= OCFS2_XATTR_BLOCK_CREATE_CREDITS
;
619 /* reserve clusters for xattr value which will be set in B tree*/
620 if (si
->value_len
> OCFS2_XATTR_INLINE_SIZE
) {
621 int new_clusters
= ocfs2_clusters_for_bytes(dir
->i_sb
,
624 *xattr_credits
+= ocfs2_clusters_to_blocks(dir
->i_sb
,
626 *want_clusters
+= new_clusters
;
631 int ocfs2_calc_xattr_init(struct inode
*dir
,
632 struct buffer_head
*dir_bh
,
634 struct ocfs2_security_xattr_info
*si
,
640 struct ocfs2_super
*osb
= OCFS2_SB(dir
->i_sb
);
641 int s_size
= 0, a_size
= 0, acl_len
= 0, new_clusters
;
644 s_size
= ocfs2_xattr_entry_real_size(strlen(si
->name
),
647 if (osb
->s_mount_opt
& OCFS2_MOUNT_POSIX_ACL
) {
648 acl_len
= ocfs2_xattr_get_nolock(dir
, dir_bh
,
649 OCFS2_XATTR_INDEX_POSIX_ACL_DEFAULT
,
652 a_size
= ocfs2_xattr_entry_real_size(0, acl_len
);
655 } else if (acl_len
!= 0 && acl_len
!= -ENODATA
) {
661 if (!(s_size
+ a_size
))
665 * The max space of security xattr taken inline is
666 * 256(name) + 80(value) + 16(entry) = 352 bytes,
667 * The max space of acl xattr taken inline is
668 * 80(value) + 16(entry) * 2(if directory) = 192 bytes,
669 * when blocksize = 512, may reserve one more cluser for
670 * xattr bucket, otherwise reserve one metadata block
672 * If this is a new directory with inline data,
673 * we choose to reserve the entire inline area for
674 * directory contents and force an external xattr block.
676 if (dir
->i_sb
->s_blocksize
== OCFS2_MIN_BLOCKSIZE
||
677 (S_ISDIR(mode
) && ocfs2_supports_inline_data(osb
)) ||
678 (s_size
+ a_size
) > OCFS2_XATTR_FREE_IN_IBODY
) {
679 *want_meta
= *want_meta
+ 1;
680 *xattr_credits
+= OCFS2_XATTR_BLOCK_CREATE_CREDITS
;
683 if (dir
->i_sb
->s_blocksize
== OCFS2_MIN_BLOCKSIZE
&&
684 (s_size
+ a_size
) > OCFS2_XATTR_FREE_IN_BLOCK(dir
)) {
686 *xattr_credits
+= ocfs2_blocks_per_xattr_bucket(dir
->i_sb
);
690 * reserve credits and clusters for xattrs which has large value
691 * and have to be set outside
693 if (si
->enable
&& si
->value_len
> OCFS2_XATTR_INLINE_SIZE
) {
694 new_clusters
= ocfs2_clusters_for_bytes(dir
->i_sb
,
696 *xattr_credits
+= ocfs2_clusters_to_blocks(dir
->i_sb
,
698 *want_clusters
+= new_clusters
;
700 if (osb
->s_mount_opt
& OCFS2_MOUNT_POSIX_ACL
&&
701 acl_len
> OCFS2_XATTR_INLINE_SIZE
) {
702 /* for directory, it has DEFAULT and ACCESS two types of acls */
703 new_clusters
= (S_ISDIR(mode
) ? 2 : 1) *
704 ocfs2_clusters_for_bytes(dir
->i_sb
, acl_len
);
705 *xattr_credits
+= ocfs2_clusters_to_blocks(dir
->i_sb
,
707 *want_clusters
+= new_clusters
;
713 static int ocfs2_xattr_extend_allocation(struct inode
*inode
,
715 struct ocfs2_xattr_value_buf
*vb
,
716 struct ocfs2_xattr_set_ctxt
*ctxt
)
718 int status
= 0, credits
;
719 handle_t
*handle
= ctxt
->handle
;
720 enum ocfs2_alloc_restarted why
;
721 u32 prev_clusters
, logical_start
= le32_to_cpu(vb
->vb_xv
->xr_clusters
);
722 struct ocfs2_extent_tree et
;
724 ocfs2_init_xattr_value_extent_tree(&et
, INODE_CACHE(inode
), vb
);
726 while (clusters_to_add
) {
727 trace_ocfs2_xattr_extend_allocation(clusters_to_add
);
729 status
= vb
->vb_access(handle
, INODE_CACHE(inode
), vb
->vb_bh
,
730 OCFS2_JOURNAL_ACCESS_WRITE
);
736 prev_clusters
= le32_to_cpu(vb
->vb_xv
->xr_clusters
);
737 status
= ocfs2_add_clusters_in_btree(handle
,
745 if ((status
< 0) && (status
!= -EAGAIN
)) {
746 if (status
!= -ENOSPC
)
751 ocfs2_journal_dirty(handle
, vb
->vb_bh
);
753 clusters_to_add
-= le32_to_cpu(vb
->vb_xv
->xr_clusters
) -
756 if (why
!= RESTART_NONE
&& clusters_to_add
) {
758 * We can only fail in case the alloc file doesn't give
759 * up enough clusters.
761 BUG_ON(why
== RESTART_META
);
763 credits
= ocfs2_calc_extend_credits(inode
->i_sb
,
764 &vb
->vb_xv
->xr_list
);
765 status
= ocfs2_extend_trans(handle
, credits
);
777 static int __ocfs2_remove_xattr_range(struct inode
*inode
,
778 struct ocfs2_xattr_value_buf
*vb
,
779 u32 cpos
, u32 phys_cpos
, u32 len
,
780 unsigned int ext_flags
,
781 struct ocfs2_xattr_set_ctxt
*ctxt
)
784 u64 phys_blkno
= ocfs2_clusters_to_blocks(inode
->i_sb
, phys_cpos
);
785 handle_t
*handle
= ctxt
->handle
;
786 struct ocfs2_extent_tree et
;
788 ocfs2_init_xattr_value_extent_tree(&et
, INODE_CACHE(inode
), vb
);
790 ret
= vb
->vb_access(handle
, INODE_CACHE(inode
), vb
->vb_bh
,
791 OCFS2_JOURNAL_ACCESS_WRITE
);
797 ret
= ocfs2_remove_extent(handle
, &et
, cpos
, len
, ctxt
->meta_ac
,
804 le32_add_cpu(&vb
->vb_xv
->xr_clusters
, -len
);
805 ocfs2_journal_dirty(handle
, vb
->vb_bh
);
807 if (ext_flags
& OCFS2_EXT_REFCOUNTED
)
808 ret
= ocfs2_decrease_refcount(inode
, handle
,
809 ocfs2_blocks_to_clusters(inode
->i_sb
,
811 len
, ctxt
->meta_ac
, &ctxt
->dealloc
, 1);
813 ret
= ocfs2_cache_cluster_dealloc(&ctxt
->dealloc
,
822 static int ocfs2_xattr_shrink_size(struct inode
*inode
,
825 struct ocfs2_xattr_value_buf
*vb
,
826 struct ocfs2_xattr_set_ctxt
*ctxt
)
829 unsigned int ext_flags
;
830 u32 trunc_len
, cpos
, phys_cpos
, alloc_size
;
833 if (old_clusters
<= new_clusters
)
837 trunc_len
= old_clusters
- new_clusters
;
839 ret
= ocfs2_xattr_get_clusters(inode
, cpos
, &phys_cpos
,
841 &vb
->vb_xv
->xr_list
, &ext_flags
);
847 if (alloc_size
> trunc_len
)
848 alloc_size
= trunc_len
;
850 ret
= __ocfs2_remove_xattr_range(inode
, vb
, cpos
,
851 phys_cpos
, alloc_size
,
858 block
= ocfs2_clusters_to_blocks(inode
->i_sb
, phys_cpos
);
859 ocfs2_remove_xattr_clusters_from_cache(INODE_CACHE(inode
),
862 trunc_len
-= alloc_size
;
869 static int ocfs2_xattr_value_truncate(struct inode
*inode
,
870 struct ocfs2_xattr_value_buf
*vb
,
872 struct ocfs2_xattr_set_ctxt
*ctxt
)
875 u32 new_clusters
= ocfs2_clusters_for_bytes(inode
->i_sb
, len
);
876 u32 old_clusters
= le32_to_cpu(vb
->vb_xv
->xr_clusters
);
878 if (new_clusters
== old_clusters
)
881 if (new_clusters
> old_clusters
)
882 ret
= ocfs2_xattr_extend_allocation(inode
,
883 new_clusters
- old_clusters
,
886 ret
= ocfs2_xattr_shrink_size(inode
,
887 old_clusters
, new_clusters
,
893 static int ocfs2_xattr_list_entry(char *buffer
, size_t size
,
894 size_t *result
, const char *prefix
,
895 const char *name
, int name_len
)
897 char *p
= buffer
+ *result
;
898 int prefix_len
= strlen(prefix
);
899 int total_len
= prefix_len
+ name_len
+ 1;
901 *result
+= total_len
;
903 /* we are just looking for how big our buffer needs to be */
910 memcpy(p
, prefix
, prefix_len
);
911 memcpy(p
+ prefix_len
, name
, name_len
);
912 p
[prefix_len
+ name_len
] = '\0';
917 static int ocfs2_xattr_list_entries(struct inode
*inode
,
918 struct ocfs2_xattr_header
*header
,
919 char *buffer
, size_t buffer_size
)
923 const char *prefix
, *name
;
925 for (i
= 0 ; i
< le16_to_cpu(header
->xh_count
); i
++) {
926 struct ocfs2_xattr_entry
*entry
= &header
->xh_entries
[i
];
927 type
= ocfs2_xattr_get_type(entry
);
928 prefix
= ocfs2_xattr_prefix(type
);
931 name
= (const char *)header
+
932 le16_to_cpu(entry
->xe_name_offset
);
934 ret
= ocfs2_xattr_list_entry(buffer
, buffer_size
,
935 &result
, prefix
, name
,
945 int ocfs2_has_inline_xattr_value_outside(struct inode
*inode
,
946 struct ocfs2_dinode
*di
)
948 struct ocfs2_xattr_header
*xh
;
951 xh
= (struct ocfs2_xattr_header
*)
952 ((void *)di
+ inode
->i_sb
->s_blocksize
-
953 le16_to_cpu(di
->i_xattr_inline_size
));
955 for (i
= 0; i
< le16_to_cpu(xh
->xh_count
); i
++)
956 if (!ocfs2_xattr_is_local(&xh
->xh_entries
[i
]))
962 static int ocfs2_xattr_ibody_list(struct inode
*inode
,
963 struct ocfs2_dinode
*di
,
967 struct ocfs2_xattr_header
*header
= NULL
;
968 struct ocfs2_inode_info
*oi
= OCFS2_I(inode
);
971 if (!(oi
->ip_dyn_features
& OCFS2_INLINE_XATTR_FL
))
974 header
= (struct ocfs2_xattr_header
*)
975 ((void *)di
+ inode
->i_sb
->s_blocksize
-
976 le16_to_cpu(di
->i_xattr_inline_size
));
978 ret
= ocfs2_xattr_list_entries(inode
, header
, buffer
, buffer_size
);
983 static int ocfs2_xattr_block_list(struct inode
*inode
,
984 struct ocfs2_dinode
*di
,
988 struct buffer_head
*blk_bh
= NULL
;
989 struct ocfs2_xattr_block
*xb
;
992 if (!di
->i_xattr_loc
)
995 ret
= ocfs2_read_xattr_block(inode
, le64_to_cpu(di
->i_xattr_loc
),
1002 xb
= (struct ocfs2_xattr_block
*)blk_bh
->b_data
;
1003 if (!(le16_to_cpu(xb
->xb_flags
) & OCFS2_XATTR_INDEXED
)) {
1004 struct ocfs2_xattr_header
*header
= &xb
->xb_attrs
.xb_header
;
1005 ret
= ocfs2_xattr_list_entries(inode
, header
,
1006 buffer
, buffer_size
);
1008 ret
= ocfs2_xattr_tree_list_index_block(inode
, blk_bh
,
1009 buffer
, buffer_size
);
1016 ssize_t
ocfs2_listxattr(struct dentry
*dentry
,
1020 int ret
= 0, i_ret
= 0, b_ret
= 0;
1021 struct buffer_head
*di_bh
= NULL
;
1022 struct ocfs2_dinode
*di
= NULL
;
1023 struct ocfs2_inode_info
*oi
= OCFS2_I(d_inode(dentry
));
1025 if (!ocfs2_supports_xattr(OCFS2_SB(dentry
->d_sb
)))
1028 if (!(oi
->ip_dyn_features
& OCFS2_HAS_XATTR_FL
))
1031 ret
= ocfs2_inode_lock(d_inode(dentry
), &di_bh
, 0);
1037 di
= (struct ocfs2_dinode
*)di_bh
->b_data
;
1039 down_read(&oi
->ip_xattr_sem
);
1040 i_ret
= ocfs2_xattr_ibody_list(d_inode(dentry
), di
, buffer
, size
);
1048 b_ret
= ocfs2_xattr_block_list(d_inode(dentry
), di
,
1053 up_read(&oi
->ip_xattr_sem
);
1054 ocfs2_inode_unlock(d_inode(dentry
), 0);
1058 return i_ret
+ b_ret
;
1061 static int ocfs2_xattr_find_entry(int name_index
,
1063 struct ocfs2_xattr_search
*xs
)
1065 struct ocfs2_xattr_entry
*entry
;
1072 name_len
= strlen(name
);
1074 for (i
= 0; i
< le16_to_cpu(xs
->header
->xh_count
); i
++) {
1075 cmp
= name_index
- ocfs2_xattr_get_type(entry
);
1077 cmp
= name_len
- entry
->xe_name_len
;
1079 cmp
= memcmp(name
, (xs
->base
+
1080 le16_to_cpu(entry
->xe_name_offset
)),
1088 return cmp
? -ENODATA
: 0;
1091 static int ocfs2_xattr_get_value_outside(struct inode
*inode
,
1092 struct ocfs2_xattr_value_root
*xv
,
1096 u32 cpos
, p_cluster
, num_clusters
, bpc
, clusters
;
1099 size_t cplen
, blocksize
;
1100 struct buffer_head
*bh
= NULL
;
1101 struct ocfs2_extent_list
*el
;
1104 clusters
= le32_to_cpu(xv
->xr_clusters
);
1105 bpc
= ocfs2_clusters_to_blocks(inode
->i_sb
, 1);
1106 blocksize
= inode
->i_sb
->s_blocksize
;
1109 while (cpos
< clusters
) {
1110 ret
= ocfs2_xattr_get_clusters(inode
, cpos
, &p_cluster
,
1111 &num_clusters
, el
, NULL
);
1117 blkno
= ocfs2_clusters_to_blocks(inode
->i_sb
, p_cluster
);
1118 /* Copy ocfs2_xattr_value */
1119 for (i
= 0; i
< num_clusters
* bpc
; i
++, blkno
++) {
1120 ret
= ocfs2_read_block(INODE_CACHE(inode
), blkno
,
1127 cplen
= len
>= blocksize
? blocksize
: len
;
1128 memcpy(buffer
, bh
->b_data
, cplen
);
1137 cpos
+= num_clusters
;
1143 static int ocfs2_xattr_ibody_get(struct inode
*inode
,
1148 struct ocfs2_xattr_search
*xs
)
1150 struct ocfs2_inode_info
*oi
= OCFS2_I(inode
);
1151 struct ocfs2_dinode
*di
= (struct ocfs2_dinode
*)xs
->inode_bh
->b_data
;
1152 struct ocfs2_xattr_value_root
*xv
;
1156 if (!(oi
->ip_dyn_features
& OCFS2_INLINE_XATTR_FL
))
1159 xs
->end
= (void *)di
+ inode
->i_sb
->s_blocksize
;
1160 xs
->header
= (struct ocfs2_xattr_header
*)
1161 (xs
->end
- le16_to_cpu(di
->i_xattr_inline_size
));
1162 xs
->base
= (void *)xs
->header
;
1163 xs
->here
= xs
->header
->xh_entries
;
1165 ret
= ocfs2_xattr_find_entry(name_index
, name
, xs
);
1168 size
= le64_to_cpu(xs
->here
->xe_value_size
);
1170 if (size
> buffer_size
)
1172 if (ocfs2_xattr_is_local(xs
->here
)) {
1173 memcpy(buffer
, (void *)xs
->base
+
1174 le16_to_cpu(xs
->here
->xe_name_offset
) +
1175 OCFS2_XATTR_SIZE(xs
->here
->xe_name_len
), size
);
1177 xv
= (struct ocfs2_xattr_value_root
*)
1178 (xs
->base
+ le16_to_cpu(
1179 xs
->here
->xe_name_offset
) +
1180 OCFS2_XATTR_SIZE(xs
->here
->xe_name_len
));
1181 ret
= ocfs2_xattr_get_value_outside(inode
, xv
,
1193 static int ocfs2_xattr_block_get(struct inode
*inode
,
1198 struct ocfs2_xattr_search
*xs
)
1200 struct ocfs2_xattr_block
*xb
;
1201 struct ocfs2_xattr_value_root
*xv
;
1203 int ret
= -ENODATA
, name_offset
, name_len
, i
;
1204 int uninitialized_var(block_off
);
1206 xs
->bucket
= ocfs2_xattr_bucket_new(inode
);
1213 ret
= ocfs2_xattr_block_find(inode
, name_index
, name
, xs
);
1219 if (xs
->not_found
) {
1224 xb
= (struct ocfs2_xattr_block
*)xs
->xattr_bh
->b_data
;
1225 size
= le64_to_cpu(xs
->here
->xe_value_size
);
1228 if (size
> buffer_size
)
1231 name_offset
= le16_to_cpu(xs
->here
->xe_name_offset
);
1232 name_len
= OCFS2_XATTR_SIZE(xs
->here
->xe_name_len
);
1233 i
= xs
->here
- xs
->header
->xh_entries
;
1235 if (le16_to_cpu(xb
->xb_flags
) & OCFS2_XATTR_INDEXED
) {
1236 ret
= ocfs2_xattr_bucket_get_name_value(inode
->i_sb
,
1237 bucket_xh(xs
->bucket
),
1245 xs
->base
= bucket_block(xs
->bucket
, block_off
);
1247 if (ocfs2_xattr_is_local(xs
->here
)) {
1248 memcpy(buffer
, (void *)xs
->base
+
1249 name_offset
+ name_len
, size
);
1251 xv
= (struct ocfs2_xattr_value_root
*)
1252 (xs
->base
+ name_offset
+ name_len
);
1253 ret
= ocfs2_xattr_get_value_outside(inode
, xv
,
1263 ocfs2_xattr_bucket_free(xs
->bucket
);
1265 brelse(xs
->xattr_bh
);
1266 xs
->xattr_bh
= NULL
;
1270 int ocfs2_xattr_get_nolock(struct inode
*inode
,
1271 struct buffer_head
*di_bh
,
1278 struct ocfs2_dinode
*di
= NULL
;
1279 struct ocfs2_inode_info
*oi
= OCFS2_I(inode
);
1280 struct ocfs2_xattr_search xis
= {
1281 .not_found
= -ENODATA
,
1283 struct ocfs2_xattr_search xbs
= {
1284 .not_found
= -ENODATA
,
1287 if (!ocfs2_supports_xattr(OCFS2_SB(inode
->i_sb
)))
1290 if (!(oi
->ip_dyn_features
& OCFS2_HAS_XATTR_FL
))
1293 xis
.inode_bh
= xbs
.inode_bh
= di_bh
;
1294 di
= (struct ocfs2_dinode
*)di_bh
->b_data
;
1296 ret
= ocfs2_xattr_ibody_get(inode
, name_index
, name
, buffer
,
1298 if (ret
== -ENODATA
&& di
->i_xattr_loc
)
1299 ret
= ocfs2_xattr_block_get(inode
, name_index
, name
, buffer
,
1305 /* ocfs2_xattr_get()
1307 * Copy an extended attribute into the buffer provided.
1308 * Buffer is NULL to compute the size of buffer required.
1310 static int ocfs2_xattr_get(struct inode
*inode
,
1317 struct buffer_head
*di_bh
= NULL
;
1319 ret
= ocfs2_inode_lock(inode
, &di_bh
, 0);
1324 down_read(&OCFS2_I(inode
)->ip_xattr_sem
);
1325 ret
= ocfs2_xattr_get_nolock(inode
, di_bh
, name_index
,
1326 name
, buffer
, buffer_size
);
1327 up_read(&OCFS2_I(inode
)->ip_xattr_sem
);
1329 ocfs2_inode_unlock(inode
, 0);
1336 static int __ocfs2_xattr_set_value_outside(struct inode
*inode
,
1338 struct ocfs2_xattr_value_buf
*vb
,
1342 int ret
= 0, i
, cp_len
;
1343 u16 blocksize
= inode
->i_sb
->s_blocksize
;
1344 u32 p_cluster
, num_clusters
;
1345 u32 cpos
= 0, bpc
= ocfs2_clusters_to_blocks(inode
->i_sb
, 1);
1346 u32 clusters
= ocfs2_clusters_for_bytes(inode
->i_sb
, value_len
);
1348 struct buffer_head
*bh
= NULL
;
1349 unsigned int ext_flags
;
1350 struct ocfs2_xattr_value_root
*xv
= vb
->vb_xv
;
1352 BUG_ON(clusters
> le32_to_cpu(xv
->xr_clusters
));
1354 while (cpos
< clusters
) {
1355 ret
= ocfs2_xattr_get_clusters(inode
, cpos
, &p_cluster
,
1356 &num_clusters
, &xv
->xr_list
,
1363 BUG_ON(ext_flags
& OCFS2_EXT_REFCOUNTED
);
1365 blkno
= ocfs2_clusters_to_blocks(inode
->i_sb
, p_cluster
);
1367 for (i
= 0; i
< num_clusters
* bpc
; i
++, blkno
++) {
1368 ret
= ocfs2_read_block(INODE_CACHE(inode
), blkno
,
1375 ret
= ocfs2_journal_access(handle
,
1378 OCFS2_JOURNAL_ACCESS_WRITE
);
1384 cp_len
= value_len
> blocksize
? blocksize
: value_len
;
1385 memcpy(bh
->b_data
, value
, cp_len
);
1386 value_len
-= cp_len
;
1388 if (cp_len
< blocksize
)
1389 memset(bh
->b_data
+ cp_len
, 0,
1390 blocksize
- cp_len
);
1392 ocfs2_journal_dirty(handle
, bh
);
1397 * XXX: do we need to empty all the following
1398 * blocks in this cluster?
1403 cpos
+= num_clusters
;
1411 static int ocfs2_xa_check_space_helper(int needed_space
, int free_start
,
1419 free_space
= free_start
-
1420 sizeof(struct ocfs2_xattr_header
) -
1421 (num_entries
* sizeof(struct ocfs2_xattr_entry
)) -
1422 OCFS2_XATTR_HEADER_GAP
;
1425 if (free_space
< needed_space
)
1431 static int ocfs2_xa_journal_access(handle_t
*handle
, struct ocfs2_xa_loc
*loc
,
1434 return loc
->xl_ops
->xlo_journal_access(handle
, loc
, type
);
1437 static void ocfs2_xa_journal_dirty(handle_t
*handle
, struct ocfs2_xa_loc
*loc
)
1439 loc
->xl_ops
->xlo_journal_dirty(handle
, loc
);
1442 /* Give a pointer into the storage for the given offset */
1443 static void *ocfs2_xa_offset_pointer(struct ocfs2_xa_loc
*loc
, int offset
)
1445 BUG_ON(offset
>= loc
->xl_size
);
1446 return loc
->xl_ops
->xlo_offset_pointer(loc
, offset
);
1450 * Wipe the name+value pair and allow the storage to reclaim it. This
1451 * must be followed by either removal of the entry or a call to
1452 * ocfs2_xa_add_namevalue().
1454 static void ocfs2_xa_wipe_namevalue(struct ocfs2_xa_loc
*loc
)
1456 loc
->xl_ops
->xlo_wipe_namevalue(loc
);
1460 * Find lowest offset to a name+value pair. This is the start of our
1461 * downward-growing free space.
1463 static int ocfs2_xa_get_free_start(struct ocfs2_xa_loc
*loc
)
1465 return loc
->xl_ops
->xlo_get_free_start(loc
);
1468 /* Can we reuse loc->xl_entry for xi? */
1469 static int ocfs2_xa_can_reuse_entry(struct ocfs2_xa_loc
*loc
,
1470 struct ocfs2_xattr_info
*xi
)
1472 return loc
->xl_ops
->xlo_can_reuse(loc
, xi
);
1475 /* How much free space is needed to set the new value */
1476 static int ocfs2_xa_check_space(struct ocfs2_xa_loc
*loc
,
1477 struct ocfs2_xattr_info
*xi
)
1479 return loc
->xl_ops
->xlo_check_space(loc
, xi
);
1482 static void ocfs2_xa_add_entry(struct ocfs2_xa_loc
*loc
, u32 name_hash
)
1484 loc
->xl_ops
->xlo_add_entry(loc
, name_hash
);
1485 loc
->xl_entry
->xe_name_hash
= cpu_to_le32(name_hash
);
1487 * We can't leave the new entry's xe_name_offset at zero or
1488 * add_namevalue() will go nuts. We set it to the size of our
1489 * storage so that it can never be less than any other entry.
1491 loc
->xl_entry
->xe_name_offset
= cpu_to_le16(loc
->xl_size
);
1494 static void ocfs2_xa_add_namevalue(struct ocfs2_xa_loc
*loc
,
1495 struct ocfs2_xattr_info
*xi
)
1497 int size
= namevalue_size_xi(xi
);
1501 loc
->xl_ops
->xlo_add_namevalue(loc
, size
);
1502 loc
->xl_entry
->xe_value_size
= cpu_to_le64(xi
->xi_value_len
);
1503 loc
->xl_entry
->xe_name_len
= xi
->xi_name_len
;
1504 ocfs2_xattr_set_type(loc
->xl_entry
, xi
->xi_name_index
);
1505 ocfs2_xattr_set_local(loc
->xl_entry
,
1506 xi
->xi_value_len
<= OCFS2_XATTR_INLINE_SIZE
);
1508 nameval_offset
= le16_to_cpu(loc
->xl_entry
->xe_name_offset
);
1509 nameval_buf
= ocfs2_xa_offset_pointer(loc
, nameval_offset
);
1510 memset(nameval_buf
, 0, size
);
1511 memcpy(nameval_buf
, xi
->xi_name
, xi
->xi_name_len
);
1514 static void ocfs2_xa_fill_value_buf(struct ocfs2_xa_loc
*loc
,
1515 struct ocfs2_xattr_value_buf
*vb
)
1517 int nameval_offset
= le16_to_cpu(loc
->xl_entry
->xe_name_offset
);
1518 int name_size
= OCFS2_XATTR_SIZE(loc
->xl_entry
->xe_name_len
);
1520 /* Value bufs are for value trees */
1521 BUG_ON(ocfs2_xattr_is_local(loc
->xl_entry
));
1522 BUG_ON(namevalue_size_xe(loc
->xl_entry
) !=
1523 (name_size
+ OCFS2_XATTR_ROOT_SIZE
));
1525 loc
->xl_ops
->xlo_fill_value_buf(loc
, vb
);
1527 (struct ocfs2_xattr_value_root
*)ocfs2_xa_offset_pointer(loc
,
1532 static int ocfs2_xa_block_journal_access(handle_t
*handle
,
1533 struct ocfs2_xa_loc
*loc
, int type
)
1535 struct buffer_head
*bh
= loc
->xl_storage
;
1536 ocfs2_journal_access_func access
;
1538 if (loc
->xl_size
== (bh
->b_size
-
1539 offsetof(struct ocfs2_xattr_block
,
1540 xb_attrs
.xb_header
)))
1541 access
= ocfs2_journal_access_xb
;
1543 access
= ocfs2_journal_access_di
;
1544 return access(handle
, INODE_CACHE(loc
->xl_inode
), bh
, type
);
1547 static void ocfs2_xa_block_journal_dirty(handle_t
*handle
,
1548 struct ocfs2_xa_loc
*loc
)
1550 struct buffer_head
*bh
= loc
->xl_storage
;
1552 ocfs2_journal_dirty(handle
, bh
);
1555 static void *ocfs2_xa_block_offset_pointer(struct ocfs2_xa_loc
*loc
,
1558 return (char *)loc
->xl_header
+ offset
;
1561 static int ocfs2_xa_block_can_reuse(struct ocfs2_xa_loc
*loc
,
1562 struct ocfs2_xattr_info
*xi
)
1565 * Block storage is strict. If the sizes aren't exact, we will
1566 * remove the old one and reinsert the new.
1568 return namevalue_size_xe(loc
->xl_entry
) ==
1569 namevalue_size_xi(xi
);
1572 static int ocfs2_xa_block_get_free_start(struct ocfs2_xa_loc
*loc
)
1574 struct ocfs2_xattr_header
*xh
= loc
->xl_header
;
1575 int i
, count
= le16_to_cpu(xh
->xh_count
);
1576 int offset
, free_start
= loc
->xl_size
;
1578 for (i
= 0; i
< count
; i
++) {
1579 offset
= le16_to_cpu(xh
->xh_entries
[i
].xe_name_offset
);
1580 if (offset
< free_start
)
1581 free_start
= offset
;
1587 static int ocfs2_xa_block_check_space(struct ocfs2_xa_loc
*loc
,
1588 struct ocfs2_xattr_info
*xi
)
1590 int count
= le16_to_cpu(loc
->xl_header
->xh_count
);
1591 int free_start
= ocfs2_xa_get_free_start(loc
);
1592 int needed_space
= ocfs2_xi_entry_usage(xi
);
1595 * Block storage will reclaim the original entry before inserting
1596 * the new value, so we only need the difference. If the new
1597 * entry is smaller than the old one, we don't need anything.
1599 if (loc
->xl_entry
) {
1600 /* Don't need space if we're reusing! */
1601 if (ocfs2_xa_can_reuse_entry(loc
, xi
))
1604 needed_space
-= ocfs2_xe_entry_usage(loc
->xl_entry
);
1606 if (needed_space
< 0)
1608 return ocfs2_xa_check_space_helper(needed_space
, free_start
, count
);
1612 * Block storage for xattrs keeps the name+value pairs compacted. When
1613 * we remove one, we have to shift any that preceded it towards the end.
1615 static void ocfs2_xa_block_wipe_namevalue(struct ocfs2_xa_loc
*loc
)
1618 int namevalue_offset
, first_namevalue_offset
, namevalue_size
;
1619 struct ocfs2_xattr_entry
*entry
= loc
->xl_entry
;
1620 struct ocfs2_xattr_header
*xh
= loc
->xl_header
;
1621 int count
= le16_to_cpu(xh
->xh_count
);
1623 namevalue_offset
= le16_to_cpu(entry
->xe_name_offset
);
1624 namevalue_size
= namevalue_size_xe(entry
);
1625 first_namevalue_offset
= ocfs2_xa_get_free_start(loc
);
1627 /* Shift the name+value pairs */
1628 memmove((char *)xh
+ first_namevalue_offset
+ namevalue_size
,
1629 (char *)xh
+ first_namevalue_offset
,
1630 namevalue_offset
- first_namevalue_offset
);
1631 memset((char *)xh
+ first_namevalue_offset
, 0, namevalue_size
);
1633 /* Now tell xh->xh_entries about it */
1634 for (i
= 0; i
< count
; i
++) {
1635 offset
= le16_to_cpu(xh
->xh_entries
[i
].xe_name_offset
);
1636 if (offset
<= namevalue_offset
)
1637 le16_add_cpu(&xh
->xh_entries
[i
].xe_name_offset
,
1642 * Note that we don't update xh_free_start or xh_name_value_len
1643 * because they're not used in block-stored xattrs.
1647 static void ocfs2_xa_block_add_entry(struct ocfs2_xa_loc
*loc
, u32 name_hash
)
1649 int count
= le16_to_cpu(loc
->xl_header
->xh_count
);
1650 loc
->xl_entry
= &(loc
->xl_header
->xh_entries
[count
]);
1651 le16_add_cpu(&loc
->xl_header
->xh_count
, 1);
1652 memset(loc
->xl_entry
, 0, sizeof(struct ocfs2_xattr_entry
));
1655 static void ocfs2_xa_block_add_namevalue(struct ocfs2_xa_loc
*loc
, int size
)
1657 int free_start
= ocfs2_xa_get_free_start(loc
);
1659 loc
->xl_entry
->xe_name_offset
= cpu_to_le16(free_start
- size
);
1662 static void ocfs2_xa_block_fill_value_buf(struct ocfs2_xa_loc
*loc
,
1663 struct ocfs2_xattr_value_buf
*vb
)
1665 struct buffer_head
*bh
= loc
->xl_storage
;
1667 if (loc
->xl_size
== (bh
->b_size
-
1668 offsetof(struct ocfs2_xattr_block
,
1669 xb_attrs
.xb_header
)))
1670 vb
->vb_access
= ocfs2_journal_access_xb
;
1672 vb
->vb_access
= ocfs2_journal_access_di
;
1677 * Operations for xattrs stored in blocks. This includes inline inode
1678 * storage and unindexed ocfs2_xattr_blocks.
1680 static const struct ocfs2_xa_loc_operations ocfs2_xa_block_loc_ops
= {
1681 .xlo_journal_access
= ocfs2_xa_block_journal_access
,
1682 .xlo_journal_dirty
= ocfs2_xa_block_journal_dirty
,
1683 .xlo_offset_pointer
= ocfs2_xa_block_offset_pointer
,
1684 .xlo_check_space
= ocfs2_xa_block_check_space
,
1685 .xlo_can_reuse
= ocfs2_xa_block_can_reuse
,
1686 .xlo_get_free_start
= ocfs2_xa_block_get_free_start
,
1687 .xlo_wipe_namevalue
= ocfs2_xa_block_wipe_namevalue
,
1688 .xlo_add_entry
= ocfs2_xa_block_add_entry
,
1689 .xlo_add_namevalue
= ocfs2_xa_block_add_namevalue
,
1690 .xlo_fill_value_buf
= ocfs2_xa_block_fill_value_buf
,
1693 static int ocfs2_xa_bucket_journal_access(handle_t
*handle
,
1694 struct ocfs2_xa_loc
*loc
, int type
)
1696 struct ocfs2_xattr_bucket
*bucket
= loc
->xl_storage
;
1698 return ocfs2_xattr_bucket_journal_access(handle
, bucket
, type
);
1701 static void ocfs2_xa_bucket_journal_dirty(handle_t
*handle
,
1702 struct ocfs2_xa_loc
*loc
)
1704 struct ocfs2_xattr_bucket
*bucket
= loc
->xl_storage
;
1706 ocfs2_xattr_bucket_journal_dirty(handle
, bucket
);
1709 static void *ocfs2_xa_bucket_offset_pointer(struct ocfs2_xa_loc
*loc
,
1712 struct ocfs2_xattr_bucket
*bucket
= loc
->xl_storage
;
1713 int block
, block_offset
;
1715 /* The header is at the front of the bucket */
1716 block
= offset
>> loc
->xl_inode
->i_sb
->s_blocksize_bits
;
1717 block_offset
= offset
% loc
->xl_inode
->i_sb
->s_blocksize
;
1719 return bucket_block(bucket
, block
) + block_offset
;
1722 static int ocfs2_xa_bucket_can_reuse(struct ocfs2_xa_loc
*loc
,
1723 struct ocfs2_xattr_info
*xi
)
1725 return namevalue_size_xe(loc
->xl_entry
) >=
1726 namevalue_size_xi(xi
);
1729 static int ocfs2_xa_bucket_get_free_start(struct ocfs2_xa_loc
*loc
)
1731 struct ocfs2_xattr_bucket
*bucket
= loc
->xl_storage
;
1732 return le16_to_cpu(bucket_xh(bucket
)->xh_free_start
);
1735 static int ocfs2_bucket_align_free_start(struct super_block
*sb
,
1736 int free_start
, int size
)
1739 * We need to make sure that the name+value pair fits within
1742 if (((free_start
- size
) >> sb
->s_blocksize_bits
) !=
1743 ((free_start
- 1) >> sb
->s_blocksize_bits
))
1744 free_start
-= free_start
% sb
->s_blocksize
;
1749 static int ocfs2_xa_bucket_check_space(struct ocfs2_xa_loc
*loc
,
1750 struct ocfs2_xattr_info
*xi
)
1753 int count
= le16_to_cpu(loc
->xl_header
->xh_count
);
1754 int free_start
= ocfs2_xa_get_free_start(loc
);
1755 int needed_space
= ocfs2_xi_entry_usage(xi
);
1756 int size
= namevalue_size_xi(xi
);
1757 struct super_block
*sb
= loc
->xl_inode
->i_sb
;
1760 * Bucket storage does not reclaim name+value pairs it cannot
1761 * reuse. They live as holes until the bucket fills, and then
1762 * the bucket is defragmented. However, the bucket can reclaim
1763 * the ocfs2_xattr_entry.
1765 if (loc
->xl_entry
) {
1766 /* Don't need space if we're reusing! */
1767 if (ocfs2_xa_can_reuse_entry(loc
, xi
))
1770 needed_space
-= sizeof(struct ocfs2_xattr_entry
);
1772 BUG_ON(needed_space
< 0);
1774 if (free_start
< size
) {
1779 * First we check if it would fit in the first place.
1780 * Below, we align the free start to a block. This may
1781 * slide us below the minimum gap. By checking unaligned
1782 * first, we avoid that error.
1784 rc
= ocfs2_xa_check_space_helper(needed_space
, free_start
,
1788 free_start
= ocfs2_bucket_align_free_start(sb
, free_start
,
1791 return ocfs2_xa_check_space_helper(needed_space
, free_start
, count
);
1794 static void ocfs2_xa_bucket_wipe_namevalue(struct ocfs2_xa_loc
*loc
)
1796 le16_add_cpu(&loc
->xl_header
->xh_name_value_len
,
1797 -namevalue_size_xe(loc
->xl_entry
));
1800 static void ocfs2_xa_bucket_add_entry(struct ocfs2_xa_loc
*loc
, u32 name_hash
)
1802 struct ocfs2_xattr_header
*xh
= loc
->xl_header
;
1803 int count
= le16_to_cpu(xh
->xh_count
);
1804 int low
= 0, high
= count
- 1, tmp
;
1805 struct ocfs2_xattr_entry
*tmp_xe
;
1808 * We keep buckets sorted by name_hash, so we need to find
1811 while (low
<= high
&& count
) {
1812 tmp
= (low
+ high
) / 2;
1813 tmp_xe
= &xh
->xh_entries
[tmp
];
1815 if (name_hash
> le32_to_cpu(tmp_xe
->xe_name_hash
))
1817 else if (name_hash
< le32_to_cpu(tmp_xe
->xe_name_hash
))
1826 memmove(&xh
->xh_entries
[low
+ 1],
1827 &xh
->xh_entries
[low
],
1828 ((count
- low
) * sizeof(struct ocfs2_xattr_entry
)));
1830 le16_add_cpu(&xh
->xh_count
, 1);
1831 loc
->xl_entry
= &xh
->xh_entries
[low
];
1832 memset(loc
->xl_entry
, 0, sizeof(struct ocfs2_xattr_entry
));
1835 static void ocfs2_xa_bucket_add_namevalue(struct ocfs2_xa_loc
*loc
, int size
)
1837 int free_start
= ocfs2_xa_get_free_start(loc
);
1838 struct ocfs2_xattr_header
*xh
= loc
->xl_header
;
1839 struct super_block
*sb
= loc
->xl_inode
->i_sb
;
1842 free_start
= ocfs2_bucket_align_free_start(sb
, free_start
, size
);
1843 nameval_offset
= free_start
- size
;
1844 loc
->xl_entry
->xe_name_offset
= cpu_to_le16(nameval_offset
);
1845 xh
->xh_free_start
= cpu_to_le16(nameval_offset
);
1846 le16_add_cpu(&xh
->xh_name_value_len
, size
);
1850 static void ocfs2_xa_bucket_fill_value_buf(struct ocfs2_xa_loc
*loc
,
1851 struct ocfs2_xattr_value_buf
*vb
)
1853 struct ocfs2_xattr_bucket
*bucket
= loc
->xl_storage
;
1854 struct super_block
*sb
= loc
->xl_inode
->i_sb
;
1855 int nameval_offset
= le16_to_cpu(loc
->xl_entry
->xe_name_offset
);
1856 int size
= namevalue_size_xe(loc
->xl_entry
);
1857 int block_offset
= nameval_offset
>> sb
->s_blocksize_bits
;
1859 /* Values are not allowed to straddle block boundaries */
1860 BUG_ON(block_offset
!=
1861 ((nameval_offset
+ size
- 1) >> sb
->s_blocksize_bits
));
1862 /* We expect the bucket to be filled in */
1863 BUG_ON(!bucket
->bu_bhs
[block_offset
]);
1865 vb
->vb_access
= ocfs2_journal_access
;
1866 vb
->vb_bh
= bucket
->bu_bhs
[block_offset
];
1869 /* Operations for xattrs stored in buckets. */
1870 static const struct ocfs2_xa_loc_operations ocfs2_xa_bucket_loc_ops
= {
1871 .xlo_journal_access
= ocfs2_xa_bucket_journal_access
,
1872 .xlo_journal_dirty
= ocfs2_xa_bucket_journal_dirty
,
1873 .xlo_offset_pointer
= ocfs2_xa_bucket_offset_pointer
,
1874 .xlo_check_space
= ocfs2_xa_bucket_check_space
,
1875 .xlo_can_reuse
= ocfs2_xa_bucket_can_reuse
,
1876 .xlo_get_free_start
= ocfs2_xa_bucket_get_free_start
,
1877 .xlo_wipe_namevalue
= ocfs2_xa_bucket_wipe_namevalue
,
1878 .xlo_add_entry
= ocfs2_xa_bucket_add_entry
,
1879 .xlo_add_namevalue
= ocfs2_xa_bucket_add_namevalue
,
1880 .xlo_fill_value_buf
= ocfs2_xa_bucket_fill_value_buf
,
1883 static unsigned int ocfs2_xa_value_clusters(struct ocfs2_xa_loc
*loc
)
1885 struct ocfs2_xattr_value_buf vb
;
1887 if (ocfs2_xattr_is_local(loc
->xl_entry
))
1890 ocfs2_xa_fill_value_buf(loc
, &vb
);
1891 return le32_to_cpu(vb
.vb_xv
->xr_clusters
);
1894 static int ocfs2_xa_value_truncate(struct ocfs2_xa_loc
*loc
, u64 bytes
,
1895 struct ocfs2_xattr_set_ctxt
*ctxt
)
1897 int trunc_rc
, access_rc
;
1898 struct ocfs2_xattr_value_buf vb
;
1900 ocfs2_xa_fill_value_buf(loc
, &vb
);
1901 trunc_rc
= ocfs2_xattr_value_truncate(loc
->xl_inode
, &vb
, bytes
,
1905 * The caller of ocfs2_xa_value_truncate() has already called
1906 * ocfs2_xa_journal_access on the loc. However, The truncate code
1907 * calls ocfs2_extend_trans(). This may commit the previous
1908 * transaction and open a new one. If this is a bucket, truncate
1909 * could leave only vb->vb_bh set up for journaling. Meanwhile,
1910 * the caller is expecting to dirty the entire bucket. So we must
1911 * reset the journal work. We do this even if truncate has failed,
1912 * as it could have failed after committing the extend.
1914 access_rc
= ocfs2_xa_journal_access(ctxt
->handle
, loc
,
1915 OCFS2_JOURNAL_ACCESS_WRITE
);
1917 /* Errors in truncate take precedence */
1918 return trunc_rc
? trunc_rc
: access_rc
;
1921 static void ocfs2_xa_remove_entry(struct ocfs2_xa_loc
*loc
)
1924 struct ocfs2_xattr_header
*xh
= loc
->xl_header
;
1925 struct ocfs2_xattr_entry
*entry
= loc
->xl_entry
;
1927 ocfs2_xa_wipe_namevalue(loc
);
1928 loc
->xl_entry
= NULL
;
1930 le16_add_cpu(&xh
->xh_count
, -1);
1931 count
= le16_to_cpu(xh
->xh_count
);
1934 * Only zero out the entry if there are more remaining. This is
1935 * important for an empty bucket, as it keeps track of the
1936 * bucket's hash value. It doesn't hurt empty block storage.
1939 index
= ((char *)entry
- (char *)&xh
->xh_entries
) /
1940 sizeof(struct ocfs2_xattr_entry
);
1941 memmove(&xh
->xh_entries
[index
], &xh
->xh_entries
[index
+ 1],
1942 (count
- index
) * sizeof(struct ocfs2_xattr_entry
));
1943 memset(&xh
->xh_entries
[count
], 0,
1944 sizeof(struct ocfs2_xattr_entry
));
1949 * If we have a problem adjusting the size of an external value during
1950 * ocfs2_xa_prepare_entry() or ocfs2_xa_remove(), we may have an xattr
1951 * in an intermediate state. For example, the value may be partially
1954 * If the value tree hasn't changed, the extend/truncate went nowhere.
1955 * We have nothing to do. The caller can treat it as a straight error.
1957 * If the value tree got partially truncated, we now have a corrupted
1958 * extended attribute. We're going to wipe its entry and leak the
1959 * clusters. Better to leak some storage than leave a corrupt entry.
1961 * If the value tree grew, it obviously didn't grow enough for the
1962 * new entry. We're not going to try and reclaim those clusters either.
1963 * If there was already an external value there (orig_clusters != 0),
1964 * the new clusters are attached safely and we can just leave the old
1965 * value in place. If there was no external value there, we remove
1968 * This way, the xattr block we store in the journal will be consistent.
1969 * If the size change broke because of the journal, no changes will hit
1972 static void ocfs2_xa_cleanup_value_truncate(struct ocfs2_xa_loc
*loc
,
1974 unsigned int orig_clusters
)
1976 unsigned int new_clusters
= ocfs2_xa_value_clusters(loc
);
1977 char *nameval_buf
= ocfs2_xa_offset_pointer(loc
,
1978 le16_to_cpu(loc
->xl_entry
->xe_name_offset
));
1980 if (new_clusters
< orig_clusters
) {
1982 "Partial truncate while %s xattr %.*s. Leaking "
1983 "%u clusters and removing the entry\n",
1984 what
, loc
->xl_entry
->xe_name_len
, nameval_buf
,
1985 orig_clusters
- new_clusters
);
1986 ocfs2_xa_remove_entry(loc
);
1987 } else if (!orig_clusters
) {
1989 "Unable to allocate an external value for xattr "
1990 "%.*s safely. Leaking %u clusters and removing the "
1992 loc
->xl_entry
->xe_name_len
, nameval_buf
,
1993 new_clusters
- orig_clusters
);
1994 ocfs2_xa_remove_entry(loc
);
1995 } else if (new_clusters
> orig_clusters
)
1997 "Unable to grow xattr %.*s safely. %u new clusters "
1998 "have been added, but the value will not be "
2000 loc
->xl_entry
->xe_name_len
, nameval_buf
,
2001 new_clusters
- orig_clusters
);
2004 static int ocfs2_xa_remove(struct ocfs2_xa_loc
*loc
,
2005 struct ocfs2_xattr_set_ctxt
*ctxt
)
2008 unsigned int orig_clusters
;
2010 if (!ocfs2_xattr_is_local(loc
->xl_entry
)) {
2011 orig_clusters
= ocfs2_xa_value_clusters(loc
);
2012 rc
= ocfs2_xa_value_truncate(loc
, 0, ctxt
);
2016 * Since this is remove, we can return 0 if
2017 * ocfs2_xa_cleanup_value_truncate() is going to
2018 * wipe the entry anyway. So we check the
2019 * cluster count as well.
2021 if (orig_clusters
!= ocfs2_xa_value_clusters(loc
))
2023 ocfs2_xa_cleanup_value_truncate(loc
, "removing",
2030 ocfs2_xa_remove_entry(loc
);
2036 static void ocfs2_xa_install_value_root(struct ocfs2_xa_loc
*loc
)
2038 int name_size
= OCFS2_XATTR_SIZE(loc
->xl_entry
->xe_name_len
);
2041 nameval_buf
= ocfs2_xa_offset_pointer(loc
,
2042 le16_to_cpu(loc
->xl_entry
->xe_name_offset
));
2043 memcpy(nameval_buf
+ name_size
, &def_xv
, OCFS2_XATTR_ROOT_SIZE
);
2047 * Take an existing entry and make it ready for the new value. This
2048 * won't allocate space, but it may free space. It should be ready for
2049 * ocfs2_xa_prepare_entry() to finish the work.
2051 static int ocfs2_xa_reuse_entry(struct ocfs2_xa_loc
*loc
,
2052 struct ocfs2_xattr_info
*xi
,
2053 struct ocfs2_xattr_set_ctxt
*ctxt
)
2056 int name_size
= OCFS2_XATTR_SIZE(xi
->xi_name_len
);
2057 unsigned int orig_clusters
;
2059 int xe_local
= ocfs2_xattr_is_local(loc
->xl_entry
);
2060 int xi_local
= xi
->xi_value_len
<= OCFS2_XATTR_INLINE_SIZE
;
2062 BUG_ON(OCFS2_XATTR_SIZE(loc
->xl_entry
->xe_name_len
) !=
2065 nameval_buf
= ocfs2_xa_offset_pointer(loc
,
2066 le16_to_cpu(loc
->xl_entry
->xe_name_offset
));
2068 memset(nameval_buf
+ name_size
, 0,
2069 namevalue_size_xe(loc
->xl_entry
) - name_size
);
2071 ocfs2_xa_install_value_root(loc
);
2073 orig_clusters
= ocfs2_xa_value_clusters(loc
);
2075 rc
= ocfs2_xa_value_truncate(loc
, 0, ctxt
);
2079 memset(nameval_buf
+ name_size
, 0,
2080 namevalue_size_xe(loc
->xl_entry
) -
2082 } else if (le64_to_cpu(loc
->xl_entry
->xe_value_size
) >
2084 rc
= ocfs2_xa_value_truncate(loc
, xi
->xi_value_len
,
2091 ocfs2_xa_cleanup_value_truncate(loc
, "reusing",
2097 loc
->xl_entry
->xe_value_size
= cpu_to_le64(xi
->xi_value_len
);
2098 ocfs2_xattr_set_local(loc
->xl_entry
, xi_local
);
2105 * Prepares loc->xl_entry to receive the new xattr. This includes
2106 * properly setting up the name+value pair region. If loc->xl_entry
2107 * already exists, it will take care of modifying it appropriately.
2109 * Note that this modifies the data. You did journal_access already,
2112 static int ocfs2_xa_prepare_entry(struct ocfs2_xa_loc
*loc
,
2113 struct ocfs2_xattr_info
*xi
,
2115 struct ocfs2_xattr_set_ctxt
*ctxt
)
2118 unsigned int orig_clusters
;
2119 __le64 orig_value_size
= 0;
2121 rc
= ocfs2_xa_check_space(loc
, xi
);
2125 if (loc
->xl_entry
) {
2126 if (ocfs2_xa_can_reuse_entry(loc
, xi
)) {
2127 orig_value_size
= loc
->xl_entry
->xe_value_size
;
2128 rc
= ocfs2_xa_reuse_entry(loc
, xi
, ctxt
);
2134 if (!ocfs2_xattr_is_local(loc
->xl_entry
)) {
2135 orig_clusters
= ocfs2_xa_value_clusters(loc
);
2136 rc
= ocfs2_xa_value_truncate(loc
, 0, ctxt
);
2139 ocfs2_xa_cleanup_value_truncate(loc
,
2145 ocfs2_xa_wipe_namevalue(loc
);
2147 ocfs2_xa_add_entry(loc
, name_hash
);
2150 * If we get here, we have a blank entry. Fill it. We grow our
2151 * name+value pair back from the end.
2153 ocfs2_xa_add_namevalue(loc
, xi
);
2154 if (xi
->xi_value_len
> OCFS2_XATTR_INLINE_SIZE
)
2155 ocfs2_xa_install_value_root(loc
);
2158 if (xi
->xi_value_len
> OCFS2_XATTR_INLINE_SIZE
) {
2159 orig_clusters
= ocfs2_xa_value_clusters(loc
);
2160 rc
= ocfs2_xa_value_truncate(loc
, xi
->xi_value_len
, ctxt
);
2162 ctxt
->set_abort
= 1;
2163 ocfs2_xa_cleanup_value_truncate(loc
, "growing",
2166 * If we were growing an existing value,
2167 * ocfs2_xa_cleanup_value_truncate() won't remove
2168 * the entry. We need to restore the original value
2171 if (loc
->xl_entry
) {
2172 BUG_ON(!orig_value_size
);
2173 loc
->xl_entry
->xe_value_size
= orig_value_size
;
2184 * Store the value portion of the name+value pair. This will skip
2185 * values that are stored externally. Their tree roots were set up
2186 * by ocfs2_xa_prepare_entry().
2188 static int ocfs2_xa_store_value(struct ocfs2_xa_loc
*loc
,
2189 struct ocfs2_xattr_info
*xi
,
2190 struct ocfs2_xattr_set_ctxt
*ctxt
)
2193 int nameval_offset
= le16_to_cpu(loc
->xl_entry
->xe_name_offset
);
2194 int name_size
= OCFS2_XATTR_SIZE(xi
->xi_name_len
);
2196 struct ocfs2_xattr_value_buf vb
;
2198 nameval_buf
= ocfs2_xa_offset_pointer(loc
, nameval_offset
);
2199 if (xi
->xi_value_len
> OCFS2_XATTR_INLINE_SIZE
) {
2200 ocfs2_xa_fill_value_buf(loc
, &vb
);
2201 rc
= __ocfs2_xattr_set_value_outside(loc
->xl_inode
,
2206 memcpy(nameval_buf
+ name_size
, xi
->xi_value
, xi
->xi_value_len
);
2211 static int ocfs2_xa_set(struct ocfs2_xa_loc
*loc
,
2212 struct ocfs2_xattr_info
*xi
,
2213 struct ocfs2_xattr_set_ctxt
*ctxt
)
2216 u32 name_hash
= ocfs2_xattr_name_hash(loc
->xl_inode
, xi
->xi_name
,
2219 ret
= ocfs2_xa_journal_access(ctxt
->handle
, loc
,
2220 OCFS2_JOURNAL_ACCESS_WRITE
);
2227 * From here on out, everything is going to modify the buffer a
2228 * little. Errors are going to leave the xattr header in a
2229 * sane state. Thus, even with errors we dirty the sucker.
2232 /* Don't worry, we are never called with !xi_value and !xl_entry */
2233 if (!xi
->xi_value
) {
2234 ret
= ocfs2_xa_remove(loc
, ctxt
);
2238 ret
= ocfs2_xa_prepare_entry(loc
, xi
, name_hash
, ctxt
);
2245 ret
= ocfs2_xa_store_value(loc
, xi
, ctxt
);
2250 ocfs2_xa_journal_dirty(ctxt
->handle
, loc
);
2256 static void ocfs2_init_dinode_xa_loc(struct ocfs2_xa_loc
*loc
,
2257 struct inode
*inode
,
2258 struct buffer_head
*bh
,
2259 struct ocfs2_xattr_entry
*entry
)
2261 struct ocfs2_dinode
*di
= (struct ocfs2_dinode
*)bh
->b_data
;
2263 BUG_ON(!(OCFS2_I(inode
)->ip_dyn_features
& OCFS2_INLINE_XATTR_FL
));
2265 loc
->xl_inode
= inode
;
2266 loc
->xl_ops
= &ocfs2_xa_block_loc_ops
;
2267 loc
->xl_storage
= bh
;
2268 loc
->xl_entry
= entry
;
2269 loc
->xl_size
= le16_to_cpu(di
->i_xattr_inline_size
);
2271 (struct ocfs2_xattr_header
*)(bh
->b_data
+ bh
->b_size
-
2275 static void ocfs2_init_xattr_block_xa_loc(struct ocfs2_xa_loc
*loc
,
2276 struct inode
*inode
,
2277 struct buffer_head
*bh
,
2278 struct ocfs2_xattr_entry
*entry
)
2280 struct ocfs2_xattr_block
*xb
=
2281 (struct ocfs2_xattr_block
*)bh
->b_data
;
2283 BUG_ON(le16_to_cpu(xb
->xb_flags
) & OCFS2_XATTR_INDEXED
);
2285 loc
->xl_inode
= inode
;
2286 loc
->xl_ops
= &ocfs2_xa_block_loc_ops
;
2287 loc
->xl_storage
= bh
;
2288 loc
->xl_header
= &(xb
->xb_attrs
.xb_header
);
2289 loc
->xl_entry
= entry
;
2290 loc
->xl_size
= bh
->b_size
- offsetof(struct ocfs2_xattr_block
,
2291 xb_attrs
.xb_header
);
2294 static void ocfs2_init_xattr_bucket_xa_loc(struct ocfs2_xa_loc
*loc
,
2295 struct ocfs2_xattr_bucket
*bucket
,
2296 struct ocfs2_xattr_entry
*entry
)
2298 loc
->xl_inode
= bucket
->bu_inode
;
2299 loc
->xl_ops
= &ocfs2_xa_bucket_loc_ops
;
2300 loc
->xl_storage
= bucket
;
2301 loc
->xl_header
= bucket_xh(bucket
);
2302 loc
->xl_entry
= entry
;
2303 loc
->xl_size
= OCFS2_XATTR_BUCKET_SIZE
;
2307 * In xattr remove, if it is stored outside and refcounted, we may have
2308 * the chance to split the refcount tree. So need the allocators.
2310 static int ocfs2_lock_xattr_remove_allocators(struct inode
*inode
,
2311 struct ocfs2_xattr_value_root
*xv
,
2312 struct ocfs2_caching_info
*ref_ci
,
2313 struct buffer_head
*ref_root_bh
,
2314 struct ocfs2_alloc_context
**meta_ac
,
2317 int ret
, meta_add
= 0;
2318 u32 p_cluster
, num_clusters
;
2319 unsigned int ext_flags
;
2322 ret
= ocfs2_xattr_get_clusters(inode
, 0, &p_cluster
,
2331 if (!(ext_flags
& OCFS2_EXT_REFCOUNTED
))
2334 ret
= ocfs2_refcounted_xattr_delete_need(inode
, ref_ci
,
2336 &meta_add
, ref_credits
);
2342 ret
= ocfs2_reserve_new_metadata_blocks(OCFS2_SB(inode
->i_sb
),
2351 static int ocfs2_remove_value_outside(struct inode
*inode
,
2352 struct ocfs2_xattr_value_buf
*vb
,
2353 struct ocfs2_xattr_header
*header
,
2354 struct ocfs2_caching_info
*ref_ci
,
2355 struct buffer_head
*ref_root_bh
)
2357 int ret
= 0, i
, ref_credits
;
2358 struct ocfs2_super
*osb
= OCFS2_SB(inode
->i_sb
);
2359 struct ocfs2_xattr_set_ctxt ctxt
= { NULL
, NULL
, };
2362 ocfs2_init_dealloc_ctxt(&ctxt
.dealloc
);
2364 for (i
= 0; i
< le16_to_cpu(header
->xh_count
); i
++) {
2365 struct ocfs2_xattr_entry
*entry
= &header
->xh_entries
[i
];
2367 if (ocfs2_xattr_is_local(entry
))
2370 val
= (void *)header
+
2371 le16_to_cpu(entry
->xe_name_offset
);
2372 vb
->vb_xv
= (struct ocfs2_xattr_value_root
*)
2373 (val
+ OCFS2_XATTR_SIZE(entry
->xe_name_len
));
2375 ret
= ocfs2_lock_xattr_remove_allocators(inode
, vb
->vb_xv
,
2376 ref_ci
, ref_root_bh
,
2380 ctxt
.handle
= ocfs2_start_trans(osb
, ref_credits
+
2381 ocfs2_remove_extent_credits(osb
->sb
));
2382 if (IS_ERR(ctxt
.handle
)) {
2383 ret
= PTR_ERR(ctxt
.handle
);
2388 ret
= ocfs2_xattr_value_truncate(inode
, vb
, 0, &ctxt
);
2390 ocfs2_commit_trans(osb
, ctxt
.handle
);
2392 ocfs2_free_alloc_context(ctxt
.meta_ac
);
2393 ctxt
.meta_ac
= NULL
;
2404 ocfs2_free_alloc_context(ctxt
.meta_ac
);
2405 ocfs2_schedule_truncate_log_flush(osb
, 1);
2406 ocfs2_run_deallocs(osb
, &ctxt
.dealloc
);
2410 static int ocfs2_xattr_ibody_remove(struct inode
*inode
,
2411 struct buffer_head
*di_bh
,
2412 struct ocfs2_caching_info
*ref_ci
,
2413 struct buffer_head
*ref_root_bh
)
2416 struct ocfs2_dinode
*di
= (struct ocfs2_dinode
*)di_bh
->b_data
;
2417 struct ocfs2_xattr_header
*header
;
2419 struct ocfs2_xattr_value_buf vb
= {
2421 .vb_access
= ocfs2_journal_access_di
,
2424 header
= (struct ocfs2_xattr_header
*)
2425 ((void *)di
+ inode
->i_sb
->s_blocksize
-
2426 le16_to_cpu(di
->i_xattr_inline_size
));
2428 ret
= ocfs2_remove_value_outside(inode
, &vb
, header
,
2429 ref_ci
, ref_root_bh
);
2434 struct ocfs2_rm_xattr_bucket_para
{
2435 struct ocfs2_caching_info
*ref_ci
;
2436 struct buffer_head
*ref_root_bh
;
2439 static int ocfs2_xattr_block_remove(struct inode
*inode
,
2440 struct buffer_head
*blk_bh
,
2441 struct ocfs2_caching_info
*ref_ci
,
2442 struct buffer_head
*ref_root_bh
)
2444 struct ocfs2_xattr_block
*xb
;
2446 struct ocfs2_xattr_value_buf vb
= {
2448 .vb_access
= ocfs2_journal_access_xb
,
2450 struct ocfs2_rm_xattr_bucket_para args
= {
2452 .ref_root_bh
= ref_root_bh
,
2455 xb
= (struct ocfs2_xattr_block
*)blk_bh
->b_data
;
2456 if (!(le16_to_cpu(xb
->xb_flags
) & OCFS2_XATTR_INDEXED
)) {
2457 struct ocfs2_xattr_header
*header
= &(xb
->xb_attrs
.xb_header
);
2458 ret
= ocfs2_remove_value_outside(inode
, &vb
, header
,
2459 ref_ci
, ref_root_bh
);
2461 ret
= ocfs2_iterate_xattr_index_block(inode
,
2463 ocfs2_rm_xattr_cluster
,
2469 static int ocfs2_xattr_free_block(struct inode
*inode
,
2471 struct ocfs2_caching_info
*ref_ci
,
2472 struct buffer_head
*ref_root_bh
)
2474 struct inode
*xb_alloc_inode
;
2475 struct buffer_head
*xb_alloc_bh
= NULL
;
2476 struct buffer_head
*blk_bh
= NULL
;
2477 struct ocfs2_xattr_block
*xb
;
2478 struct ocfs2_super
*osb
= OCFS2_SB(inode
->i_sb
);
2484 ret
= ocfs2_read_xattr_block(inode
, block
, &blk_bh
);
2490 ret
= ocfs2_xattr_block_remove(inode
, blk_bh
, ref_ci
, ref_root_bh
);
2496 xb
= (struct ocfs2_xattr_block
*)blk_bh
->b_data
;
2497 blk
= le64_to_cpu(xb
->xb_blkno
);
2498 bit
= le16_to_cpu(xb
->xb_suballoc_bit
);
2499 if (xb
->xb_suballoc_loc
)
2500 bg_blkno
= le64_to_cpu(xb
->xb_suballoc_loc
);
2502 bg_blkno
= ocfs2_which_suballoc_group(blk
, bit
);
2504 xb_alloc_inode
= ocfs2_get_system_file_inode(osb
,
2505 EXTENT_ALLOC_SYSTEM_INODE
,
2506 le16_to_cpu(xb
->xb_suballoc_slot
));
2507 if (!xb_alloc_inode
) {
2512 mutex_lock(&xb_alloc_inode
->i_mutex
);
2514 ret
= ocfs2_inode_lock(xb_alloc_inode
, &xb_alloc_bh
, 1);
2520 handle
= ocfs2_start_trans(osb
, OCFS2_SUBALLOC_FREE
);
2521 if (IS_ERR(handle
)) {
2522 ret
= PTR_ERR(handle
);
2527 ret
= ocfs2_free_suballoc_bits(handle
, xb_alloc_inode
, xb_alloc_bh
,
2532 ocfs2_commit_trans(osb
, handle
);
2534 ocfs2_inode_unlock(xb_alloc_inode
, 1);
2535 brelse(xb_alloc_bh
);
2537 mutex_unlock(&xb_alloc_inode
->i_mutex
);
2538 iput(xb_alloc_inode
);
2545 * ocfs2_xattr_remove()
2547 * Free extended attribute resources associated with this inode.
2549 int ocfs2_xattr_remove(struct inode
*inode
, struct buffer_head
*di_bh
)
2551 struct ocfs2_inode_info
*oi
= OCFS2_I(inode
);
2552 struct ocfs2_dinode
*di
= (struct ocfs2_dinode
*)di_bh
->b_data
;
2553 struct ocfs2_refcount_tree
*ref_tree
= NULL
;
2554 struct buffer_head
*ref_root_bh
= NULL
;
2555 struct ocfs2_caching_info
*ref_ci
= NULL
;
2559 if (!ocfs2_supports_xattr(OCFS2_SB(inode
->i_sb
)))
2562 if (!(oi
->ip_dyn_features
& OCFS2_HAS_XATTR_FL
))
2565 if (OCFS2_I(inode
)->ip_dyn_features
& OCFS2_HAS_REFCOUNT_FL
) {
2566 ret
= ocfs2_lock_refcount_tree(OCFS2_SB(inode
->i_sb
),
2567 le64_to_cpu(di
->i_refcount_loc
),
2568 1, &ref_tree
, &ref_root_bh
);
2573 ref_ci
= &ref_tree
->rf_ci
;
2577 if (oi
->ip_dyn_features
& OCFS2_INLINE_XATTR_FL
) {
2578 ret
= ocfs2_xattr_ibody_remove(inode
, di_bh
,
2579 ref_ci
, ref_root_bh
);
2586 if (di
->i_xattr_loc
) {
2587 ret
= ocfs2_xattr_free_block(inode
,
2588 le64_to_cpu(di
->i_xattr_loc
),
2589 ref_ci
, ref_root_bh
);
2596 handle
= ocfs2_start_trans((OCFS2_SB(inode
->i_sb
)),
2597 OCFS2_INODE_UPDATE_CREDITS
);
2598 if (IS_ERR(handle
)) {
2599 ret
= PTR_ERR(handle
);
2603 ret
= ocfs2_journal_access_di(handle
, INODE_CACHE(inode
), di_bh
,
2604 OCFS2_JOURNAL_ACCESS_WRITE
);
2610 di
->i_xattr_loc
= 0;
2612 spin_lock(&oi
->ip_lock
);
2613 oi
->ip_dyn_features
&= ~(OCFS2_INLINE_XATTR_FL
| OCFS2_HAS_XATTR_FL
);
2614 di
->i_dyn_features
= cpu_to_le16(oi
->ip_dyn_features
);
2615 spin_unlock(&oi
->ip_lock
);
2616 ocfs2_update_inode_fsync_trans(handle
, inode
, 0);
2618 ocfs2_journal_dirty(handle
, di_bh
);
2620 ocfs2_commit_trans(OCFS2_SB(inode
->i_sb
), handle
);
2623 ocfs2_unlock_refcount_tree(OCFS2_SB(inode
->i_sb
), ref_tree
, 1);
2624 brelse(ref_root_bh
);
2628 static int ocfs2_xattr_has_space_inline(struct inode
*inode
,
2629 struct ocfs2_dinode
*di
)
2631 struct ocfs2_inode_info
*oi
= OCFS2_I(inode
);
2632 unsigned int xattrsize
= OCFS2_SB(inode
->i_sb
)->s_xattr_inline_size
;
2635 if (xattrsize
< OCFS2_MIN_XATTR_INLINE_SIZE
)
2638 if (oi
->ip_dyn_features
& OCFS2_INLINE_DATA_FL
) {
2639 struct ocfs2_inline_data
*idata
= &di
->id2
.i_data
;
2640 free
= le16_to_cpu(idata
->id_count
) - le64_to_cpu(di
->i_size
);
2641 } else if (ocfs2_inode_is_fast_symlink(inode
)) {
2642 free
= ocfs2_fast_symlink_chars(inode
->i_sb
) -
2643 le64_to_cpu(di
->i_size
);
2645 struct ocfs2_extent_list
*el
= &di
->id2
.i_list
;
2646 free
= (le16_to_cpu(el
->l_count
) -
2647 le16_to_cpu(el
->l_next_free_rec
)) *
2648 sizeof(struct ocfs2_extent_rec
);
2650 if (free
>= xattrsize
)
2657 * ocfs2_xattr_ibody_find()
2659 * Find extended attribute in inode block and
2660 * fill search info into struct ocfs2_xattr_search.
2662 static int ocfs2_xattr_ibody_find(struct inode
*inode
,
2665 struct ocfs2_xattr_search
*xs
)
2667 struct ocfs2_inode_info
*oi
= OCFS2_I(inode
);
2668 struct ocfs2_dinode
*di
= (struct ocfs2_dinode
*)xs
->inode_bh
->b_data
;
2672 if (inode
->i_sb
->s_blocksize
== OCFS2_MIN_BLOCKSIZE
)
2675 if (!(oi
->ip_dyn_features
& OCFS2_INLINE_XATTR_FL
)) {
2676 down_read(&oi
->ip_alloc_sem
);
2677 has_space
= ocfs2_xattr_has_space_inline(inode
, di
);
2678 up_read(&oi
->ip_alloc_sem
);
2683 xs
->xattr_bh
= xs
->inode_bh
;
2684 xs
->end
= (void *)di
+ inode
->i_sb
->s_blocksize
;
2685 if (oi
->ip_dyn_features
& OCFS2_INLINE_XATTR_FL
)
2686 xs
->header
= (struct ocfs2_xattr_header
*)
2687 (xs
->end
- le16_to_cpu(di
->i_xattr_inline_size
));
2689 xs
->header
= (struct ocfs2_xattr_header
*)
2690 (xs
->end
- OCFS2_SB(inode
->i_sb
)->s_xattr_inline_size
);
2691 xs
->base
= (void *)xs
->header
;
2692 xs
->here
= xs
->header
->xh_entries
;
2694 /* Find the named attribute. */
2695 if (oi
->ip_dyn_features
& OCFS2_INLINE_XATTR_FL
) {
2696 ret
= ocfs2_xattr_find_entry(name_index
, name
, xs
);
2697 if (ret
&& ret
!= -ENODATA
)
2699 xs
->not_found
= ret
;
2705 static int ocfs2_xattr_ibody_init(struct inode
*inode
,
2706 struct buffer_head
*di_bh
,
2707 struct ocfs2_xattr_set_ctxt
*ctxt
)
2710 struct ocfs2_inode_info
*oi
= OCFS2_I(inode
);
2711 struct ocfs2_dinode
*di
= (struct ocfs2_dinode
*)di_bh
->b_data
;
2712 struct ocfs2_super
*osb
= OCFS2_SB(inode
->i_sb
);
2713 unsigned int xattrsize
= osb
->s_xattr_inline_size
;
2715 if (!ocfs2_xattr_has_space_inline(inode
, di
)) {
2720 ret
= ocfs2_journal_access_di(ctxt
->handle
, INODE_CACHE(inode
), di_bh
,
2721 OCFS2_JOURNAL_ACCESS_WRITE
);
2728 * Adjust extent record count or inline data size
2729 * to reserve space for extended attribute.
2731 if (oi
->ip_dyn_features
& OCFS2_INLINE_DATA_FL
) {
2732 struct ocfs2_inline_data
*idata
= &di
->id2
.i_data
;
2733 le16_add_cpu(&idata
->id_count
, -xattrsize
);
2734 } else if (!(ocfs2_inode_is_fast_symlink(inode
))) {
2735 struct ocfs2_extent_list
*el
= &di
->id2
.i_list
;
2736 le16_add_cpu(&el
->l_count
, -(xattrsize
/
2737 sizeof(struct ocfs2_extent_rec
)));
2739 di
->i_xattr_inline_size
= cpu_to_le16(xattrsize
);
2741 spin_lock(&oi
->ip_lock
);
2742 oi
->ip_dyn_features
|= OCFS2_INLINE_XATTR_FL
|OCFS2_HAS_XATTR_FL
;
2743 di
->i_dyn_features
= cpu_to_le16(oi
->ip_dyn_features
);
2744 spin_unlock(&oi
->ip_lock
);
2746 ocfs2_journal_dirty(ctxt
->handle
, di_bh
);
2753 * ocfs2_xattr_ibody_set()
2755 * Set, replace or remove an extended attribute into inode block.
2758 static int ocfs2_xattr_ibody_set(struct inode
*inode
,
2759 struct ocfs2_xattr_info
*xi
,
2760 struct ocfs2_xattr_search
*xs
,
2761 struct ocfs2_xattr_set_ctxt
*ctxt
)
2764 struct ocfs2_inode_info
*oi
= OCFS2_I(inode
);
2765 struct ocfs2_xa_loc loc
;
2767 if (inode
->i_sb
->s_blocksize
== OCFS2_MIN_BLOCKSIZE
)
2770 down_write(&oi
->ip_alloc_sem
);
2771 if (!(oi
->ip_dyn_features
& OCFS2_INLINE_XATTR_FL
)) {
2772 ret
= ocfs2_xattr_ibody_init(inode
, xs
->inode_bh
, ctxt
);
2780 ocfs2_init_dinode_xa_loc(&loc
, inode
, xs
->inode_bh
,
2781 xs
->not_found
? NULL
: xs
->here
);
2782 ret
= ocfs2_xa_set(&loc
, xi
, ctxt
);
2788 xs
->here
= loc
.xl_entry
;
2791 up_write(&oi
->ip_alloc_sem
);
2797 * ocfs2_xattr_block_find()
2799 * Find extended attribute in external block and
2800 * fill search info into struct ocfs2_xattr_search.
2802 static int ocfs2_xattr_block_find(struct inode
*inode
,
2805 struct ocfs2_xattr_search
*xs
)
2807 struct ocfs2_dinode
*di
= (struct ocfs2_dinode
*)xs
->inode_bh
->b_data
;
2808 struct buffer_head
*blk_bh
= NULL
;
2809 struct ocfs2_xattr_block
*xb
;
2812 if (!di
->i_xattr_loc
)
2815 ret
= ocfs2_read_xattr_block(inode
, le64_to_cpu(di
->i_xattr_loc
),
2822 xs
->xattr_bh
= blk_bh
;
2823 xb
= (struct ocfs2_xattr_block
*)blk_bh
->b_data
;
2825 if (!(le16_to_cpu(xb
->xb_flags
) & OCFS2_XATTR_INDEXED
)) {
2826 xs
->header
= &xb
->xb_attrs
.xb_header
;
2827 xs
->base
= (void *)xs
->header
;
2828 xs
->end
= (void *)(blk_bh
->b_data
) + blk_bh
->b_size
;
2829 xs
->here
= xs
->header
->xh_entries
;
2831 ret
= ocfs2_xattr_find_entry(name_index
, name
, xs
);
2833 ret
= ocfs2_xattr_index_block_find(inode
, blk_bh
,
2837 if (ret
&& ret
!= -ENODATA
) {
2838 xs
->xattr_bh
= NULL
;
2841 xs
->not_found
= ret
;
2849 static int ocfs2_create_xattr_block(struct inode
*inode
,
2850 struct buffer_head
*inode_bh
,
2851 struct ocfs2_xattr_set_ctxt
*ctxt
,
2853 struct buffer_head
**ret_bh
)
2856 u16 suballoc_bit_start
;
2858 u64 suballoc_loc
, first_blkno
;
2859 struct ocfs2_dinode
*di
= (struct ocfs2_dinode
*)inode_bh
->b_data
;
2860 struct buffer_head
*new_bh
= NULL
;
2861 struct ocfs2_xattr_block
*xblk
;
2863 ret
= ocfs2_journal_access_di(ctxt
->handle
, INODE_CACHE(inode
),
2864 inode_bh
, OCFS2_JOURNAL_ACCESS_CREATE
);
2870 ret
= ocfs2_claim_metadata(ctxt
->handle
, ctxt
->meta_ac
, 1,
2871 &suballoc_loc
, &suballoc_bit_start
,
2872 &num_got
, &first_blkno
);
2878 new_bh
= sb_getblk(inode
->i_sb
, first_blkno
);
2885 ocfs2_set_new_buffer_uptodate(INODE_CACHE(inode
), new_bh
);
2887 ret
= ocfs2_journal_access_xb(ctxt
->handle
, INODE_CACHE(inode
),
2889 OCFS2_JOURNAL_ACCESS_CREATE
);
2895 /* Initialize ocfs2_xattr_block */
2896 xblk
= (struct ocfs2_xattr_block
*)new_bh
->b_data
;
2897 memset(xblk
, 0, inode
->i_sb
->s_blocksize
);
2898 strcpy((void *)xblk
, OCFS2_XATTR_BLOCK_SIGNATURE
);
2899 xblk
->xb_suballoc_slot
= cpu_to_le16(ctxt
->meta_ac
->ac_alloc_slot
);
2900 xblk
->xb_suballoc_loc
= cpu_to_le64(suballoc_loc
);
2901 xblk
->xb_suballoc_bit
= cpu_to_le16(suballoc_bit_start
);
2902 xblk
->xb_fs_generation
=
2903 cpu_to_le32(OCFS2_SB(inode
->i_sb
)->fs_generation
);
2904 xblk
->xb_blkno
= cpu_to_le64(first_blkno
);
2906 struct ocfs2_xattr_tree_root
*xr
= &xblk
->xb_attrs
.xb_root
;
2907 xr
->xt_clusters
= cpu_to_le32(1);
2908 xr
->xt_last_eb_blk
= 0;
2909 xr
->xt_list
.l_tree_depth
= 0;
2910 xr
->xt_list
.l_count
= cpu_to_le16(
2911 ocfs2_xattr_recs_per_xb(inode
->i_sb
));
2912 xr
->xt_list
.l_next_free_rec
= cpu_to_le16(1);
2913 xblk
->xb_flags
= cpu_to_le16(OCFS2_XATTR_INDEXED
);
2915 ocfs2_journal_dirty(ctxt
->handle
, new_bh
);
2917 /* Add it to the inode */
2918 di
->i_xattr_loc
= cpu_to_le64(first_blkno
);
2920 spin_lock(&OCFS2_I(inode
)->ip_lock
);
2921 OCFS2_I(inode
)->ip_dyn_features
|= OCFS2_HAS_XATTR_FL
;
2922 di
->i_dyn_features
= cpu_to_le16(OCFS2_I(inode
)->ip_dyn_features
);
2923 spin_unlock(&OCFS2_I(inode
)->ip_lock
);
2925 ocfs2_journal_dirty(ctxt
->handle
, inode_bh
);
2936 * ocfs2_xattr_block_set()
2938 * Set, replace or remove an extended attribute into external block.
2941 static int ocfs2_xattr_block_set(struct inode
*inode
,
2942 struct ocfs2_xattr_info
*xi
,
2943 struct ocfs2_xattr_search
*xs
,
2944 struct ocfs2_xattr_set_ctxt
*ctxt
)
2946 struct buffer_head
*new_bh
= NULL
;
2947 struct ocfs2_xattr_block
*xblk
= NULL
;
2949 struct ocfs2_xa_loc loc
;
2951 if (!xs
->xattr_bh
) {
2952 ret
= ocfs2_create_xattr_block(inode
, xs
->inode_bh
, ctxt
,
2959 xs
->xattr_bh
= new_bh
;
2960 xblk
= (struct ocfs2_xattr_block
*)xs
->xattr_bh
->b_data
;
2961 xs
->header
= &xblk
->xb_attrs
.xb_header
;
2962 xs
->base
= (void *)xs
->header
;
2963 xs
->end
= (void *)xblk
+ inode
->i_sb
->s_blocksize
;
2964 xs
->here
= xs
->header
->xh_entries
;
2966 xblk
= (struct ocfs2_xattr_block
*)xs
->xattr_bh
->b_data
;
2968 if (!(le16_to_cpu(xblk
->xb_flags
) & OCFS2_XATTR_INDEXED
)) {
2969 ocfs2_init_xattr_block_xa_loc(&loc
, inode
, xs
->xattr_bh
,
2970 xs
->not_found
? NULL
: xs
->here
);
2972 ret
= ocfs2_xa_set(&loc
, xi
, ctxt
);
2974 xs
->here
= loc
.xl_entry
;
2975 else if ((ret
!= -ENOSPC
) || ctxt
->set_abort
)
2978 ret
= ocfs2_xattr_create_index_block(inode
, xs
, ctxt
);
2984 if (le16_to_cpu(xblk
->xb_flags
) & OCFS2_XATTR_INDEXED
)
2985 ret
= ocfs2_xattr_set_entry_index_block(inode
, xi
, xs
, ctxt
);
2991 /* Check whether the new xattr can be inserted into the inode. */
2992 static int ocfs2_xattr_can_be_in_inode(struct inode
*inode
,
2993 struct ocfs2_xattr_info
*xi
,
2994 struct ocfs2_xattr_search
*xs
)
2996 struct ocfs2_xattr_entry
*last
;
2998 size_t min_offs
= xs
->end
- xs
->base
;
3003 last
= xs
->header
->xh_entries
;
3005 for (i
= 0; i
< le16_to_cpu(xs
->header
->xh_count
); i
++) {
3006 size_t offs
= le16_to_cpu(last
->xe_name_offset
);
3007 if (offs
< min_offs
)
3012 free
= min_offs
- ((void *)last
- xs
->base
) - OCFS2_XATTR_HEADER_GAP
;
3016 BUG_ON(!xs
->not_found
);
3018 if (free
>= (sizeof(struct ocfs2_xattr_entry
) + namevalue_size_xi(xi
)))
3024 static int ocfs2_calc_xattr_set_need(struct inode
*inode
,
3025 struct ocfs2_dinode
*di
,
3026 struct ocfs2_xattr_info
*xi
,
3027 struct ocfs2_xattr_search
*xis
,
3028 struct ocfs2_xattr_search
*xbs
,
3033 int ret
= 0, old_in_xb
= 0;
3034 int clusters_add
= 0, meta_add
= 0, credits
= 0;
3035 struct buffer_head
*bh
= NULL
;
3036 struct ocfs2_xattr_block
*xb
= NULL
;
3037 struct ocfs2_xattr_entry
*xe
= NULL
;
3038 struct ocfs2_xattr_value_root
*xv
= NULL
;
3040 int name_offset
, name_len
= 0;
3041 u32 new_clusters
= ocfs2_clusters_for_bytes(inode
->i_sb
,
3046 * Calculate the clusters we need to write.
3047 * No matter whether we replace an old one or add a new one,
3048 * we need this for writing.
3050 if (xi
->xi_value_len
> OCFS2_XATTR_INLINE_SIZE
)
3051 credits
+= new_clusters
*
3052 ocfs2_clusters_to_blocks(inode
->i_sb
, 1);
3054 if (xis
->not_found
&& xbs
->not_found
) {
3055 credits
+= ocfs2_blocks_per_xattr_bucket(inode
->i_sb
);
3057 if (xi
->xi_value_len
> OCFS2_XATTR_INLINE_SIZE
) {
3058 clusters_add
+= new_clusters
;
3059 credits
+= ocfs2_calc_extend_credits(inode
->i_sb
,
3060 &def_xv
.xv
.xr_list
);
3066 if (!xis
->not_found
) {
3068 name_offset
= le16_to_cpu(xe
->xe_name_offset
);
3069 name_len
= OCFS2_XATTR_SIZE(xe
->xe_name_len
);
3071 credits
+= OCFS2_INODE_UPDATE_CREDITS
;
3073 int i
, block_off
= 0;
3074 xb
= (struct ocfs2_xattr_block
*)xbs
->xattr_bh
->b_data
;
3076 name_offset
= le16_to_cpu(xe
->xe_name_offset
);
3077 name_len
= OCFS2_XATTR_SIZE(xe
->xe_name_len
);
3078 i
= xbs
->here
- xbs
->header
->xh_entries
;
3081 if (le16_to_cpu(xb
->xb_flags
) & OCFS2_XATTR_INDEXED
) {
3082 ret
= ocfs2_xattr_bucket_get_name_value(inode
->i_sb
,
3083 bucket_xh(xbs
->bucket
),
3086 base
= bucket_block(xbs
->bucket
, block_off
);
3087 credits
+= ocfs2_blocks_per_xattr_bucket(inode
->i_sb
);
3090 credits
+= OCFS2_XATTR_BLOCK_UPDATE_CREDITS
;
3095 * delete a xattr doesn't need metadata and cluster allocation.
3096 * so just calculate the credits and return.
3098 * The credits for removing the value tree will be extended
3099 * by ocfs2_remove_extent itself.
3101 if (!xi
->xi_value
) {
3102 if (!ocfs2_xattr_is_local(xe
))
3103 credits
+= ocfs2_remove_extent_credits(inode
->i_sb
);
3108 /* do cluster allocation guess first. */
3109 value_size
= le64_to_cpu(xe
->xe_value_size
);
3113 * In xattr set, we always try to set the xe in inode first,
3114 * so if it can be inserted into inode successfully, the old
3115 * one will be removed from the xattr block, and this xattr
3116 * will be inserted into inode as a new xattr in inode.
3118 if (ocfs2_xattr_can_be_in_inode(inode
, xi
, xis
)) {
3119 clusters_add
+= new_clusters
;
3120 credits
+= ocfs2_remove_extent_credits(inode
->i_sb
) +
3121 OCFS2_INODE_UPDATE_CREDITS
;
3122 if (!ocfs2_xattr_is_local(xe
))
3123 credits
+= ocfs2_calc_extend_credits(
3125 &def_xv
.xv
.xr_list
);
3130 if (xi
->xi_value_len
> OCFS2_XATTR_INLINE_SIZE
) {
3131 /* the new values will be stored outside. */
3132 u32 old_clusters
= 0;
3134 if (!ocfs2_xattr_is_local(xe
)) {
3135 old_clusters
= ocfs2_clusters_for_bytes(inode
->i_sb
,
3137 xv
= (struct ocfs2_xattr_value_root
*)
3138 (base
+ name_offset
+ name_len
);
3139 value_size
= OCFS2_XATTR_ROOT_SIZE
;
3143 if (old_clusters
>= new_clusters
) {
3144 credits
+= ocfs2_remove_extent_credits(inode
->i_sb
);
3147 meta_add
+= ocfs2_extend_meta_needed(&xv
->xr_list
);
3148 clusters_add
+= new_clusters
- old_clusters
;
3149 credits
+= ocfs2_calc_extend_credits(inode
->i_sb
,
3151 if (value_size
>= OCFS2_XATTR_ROOT_SIZE
)
3156 * Now the new value will be stored inside. So if the new
3157 * value is smaller than the size of value root or the old
3158 * value, we don't need any allocation, otherwise we have
3159 * to guess metadata allocation.
3161 if ((ocfs2_xattr_is_local(xe
) &&
3162 (value_size
>= xi
->xi_value_len
)) ||
3163 (!ocfs2_xattr_is_local(xe
) &&
3164 OCFS2_XATTR_ROOT_SIZE
>= xi
->xi_value_len
))
3169 /* calculate metadata allocation. */
3170 if (di
->i_xattr_loc
) {
3171 if (!xbs
->xattr_bh
) {
3172 ret
= ocfs2_read_xattr_block(inode
,
3173 le64_to_cpu(di
->i_xattr_loc
),
3180 xb
= (struct ocfs2_xattr_block
*)bh
->b_data
;
3182 xb
= (struct ocfs2_xattr_block
*)xbs
->xattr_bh
->b_data
;
3185 * If there is already an xattr tree, good, we can calculate
3186 * like other b-trees. Otherwise we may have the chance of
3187 * create a tree, the credit calculation is borrowed from
3188 * ocfs2_calc_extend_credits with root_el = NULL. And the
3189 * new tree will be cluster based, so no meta is needed.
3191 if (le16_to_cpu(xb
->xb_flags
) & OCFS2_XATTR_INDEXED
) {
3192 struct ocfs2_extent_list
*el
=
3193 &xb
->xb_attrs
.xb_root
.xt_list
;
3194 meta_add
+= ocfs2_extend_meta_needed(el
);
3195 credits
+= ocfs2_calc_extend_credits(inode
->i_sb
,
3198 credits
+= OCFS2_SUBALLOC_ALLOC
+ 1;
3201 * This cluster will be used either for new bucket or for
3203 * If the cluster size is the same as the bucket size, one
3204 * more is needed since we may need to extend the bucket
3208 credits
+= ocfs2_blocks_per_xattr_bucket(inode
->i_sb
);
3209 if (OCFS2_XATTR_BUCKET_SIZE
==
3210 OCFS2_SB(inode
->i_sb
)->s_clustersize
) {
3211 credits
+= ocfs2_blocks_per_xattr_bucket(inode
->i_sb
);
3215 credits
+= OCFS2_XATTR_BLOCK_CREATE_CREDITS
;
3216 if (xi
->xi_value_len
> OCFS2_XATTR_INLINE_SIZE
) {
3217 struct ocfs2_extent_list
*el
= &def_xv
.xv
.xr_list
;
3218 meta_add
+= ocfs2_extend_meta_needed(el
);
3219 credits
+= ocfs2_calc_extend_credits(inode
->i_sb
,
3227 *clusters_need
= clusters_add
;
3229 *meta_need
= meta_add
;
3231 *credits_need
= credits
;
3236 static int ocfs2_init_xattr_set_ctxt(struct inode
*inode
,
3237 struct ocfs2_dinode
*di
,
3238 struct ocfs2_xattr_info
*xi
,
3239 struct ocfs2_xattr_search
*xis
,
3240 struct ocfs2_xattr_search
*xbs
,
3241 struct ocfs2_xattr_set_ctxt
*ctxt
,
3245 int clusters_add
, meta_add
, ret
;
3246 struct ocfs2_super
*osb
= OCFS2_SB(inode
->i_sb
);
3248 memset(ctxt
, 0, sizeof(struct ocfs2_xattr_set_ctxt
));
3250 ocfs2_init_dealloc_ctxt(&ctxt
->dealloc
);
3252 ret
= ocfs2_calc_xattr_set_need(inode
, di
, xi
, xis
, xbs
,
3253 &clusters_add
, &meta_add
, credits
);
3259 meta_add
+= extra_meta
;
3260 trace_ocfs2_init_xattr_set_ctxt(xi
->xi_name
, meta_add
,
3261 clusters_add
, *credits
);
3264 ret
= ocfs2_reserve_new_metadata_blocks(osb
, meta_add
,
3273 ret
= ocfs2_reserve_clusters(osb
, clusters_add
, &ctxt
->data_ac
);
3279 if (ctxt
->meta_ac
) {
3280 ocfs2_free_alloc_context(ctxt
->meta_ac
);
3281 ctxt
->meta_ac
= NULL
;
3285 * We cannot have an error and a non null ctxt->data_ac.
3292 static int __ocfs2_xattr_set_handle(struct inode
*inode
,
3293 struct ocfs2_dinode
*di
,
3294 struct ocfs2_xattr_info
*xi
,
3295 struct ocfs2_xattr_search
*xis
,
3296 struct ocfs2_xattr_search
*xbs
,
3297 struct ocfs2_xattr_set_ctxt
*ctxt
)
3299 int ret
= 0, credits
, old_found
;
3301 if (!xi
->xi_value
) {
3302 /* Remove existing extended attribute */
3303 if (!xis
->not_found
)
3304 ret
= ocfs2_xattr_ibody_set(inode
, xi
, xis
, ctxt
);
3305 else if (!xbs
->not_found
)
3306 ret
= ocfs2_xattr_block_set(inode
, xi
, xbs
, ctxt
);
3308 /* We always try to set extended attribute into inode first*/
3309 ret
= ocfs2_xattr_ibody_set(inode
, xi
, xis
, ctxt
);
3310 if (!ret
&& !xbs
->not_found
) {
3312 * If succeed and that extended attribute existing in
3313 * external block, then we will remove it.
3315 xi
->xi_value
= NULL
;
3316 xi
->xi_value_len
= 0;
3318 old_found
= xis
->not_found
;
3319 xis
->not_found
= -ENODATA
;
3320 ret
= ocfs2_calc_xattr_set_need(inode
,
3328 xis
->not_found
= old_found
;
3334 ret
= ocfs2_extend_trans(ctxt
->handle
, credits
);
3339 ret
= ocfs2_xattr_block_set(inode
, xi
, xbs
, ctxt
);
3340 } else if ((ret
== -ENOSPC
) && !ctxt
->set_abort
) {
3341 if (di
->i_xattr_loc
&& !xbs
->xattr_bh
) {
3342 ret
= ocfs2_xattr_block_find(inode
,
3348 old_found
= xis
->not_found
;
3349 xis
->not_found
= -ENODATA
;
3350 ret
= ocfs2_calc_xattr_set_need(inode
,
3358 xis
->not_found
= old_found
;
3364 ret
= ocfs2_extend_trans(ctxt
->handle
, credits
);
3371 * If no space in inode, we will set extended attribute
3372 * into external block.
3374 ret
= ocfs2_xattr_block_set(inode
, xi
, xbs
, ctxt
);
3377 if (!xis
->not_found
) {
3379 * If succeed and that extended attribute
3380 * existing in inode, we will remove it.
3382 xi
->xi_value
= NULL
;
3383 xi
->xi_value_len
= 0;
3384 xbs
->not_found
= -ENODATA
;
3385 ret
= ocfs2_calc_xattr_set_need(inode
,
3398 ret
= ocfs2_extend_trans(ctxt
->handle
, credits
);
3403 ret
= ocfs2_xattr_ibody_set(inode
, xi
,
3410 /* Update inode ctime. */
3411 ret
= ocfs2_journal_access_di(ctxt
->handle
, INODE_CACHE(inode
),
3413 OCFS2_JOURNAL_ACCESS_WRITE
);
3419 inode
->i_ctime
= CURRENT_TIME
;
3420 di
->i_ctime
= cpu_to_le64(inode
->i_ctime
.tv_sec
);
3421 di
->i_ctime_nsec
= cpu_to_le32(inode
->i_ctime
.tv_nsec
);
3422 ocfs2_journal_dirty(ctxt
->handle
, xis
->inode_bh
);
3429 * This function only called duing creating inode
3430 * for init security/acl xattrs of the new inode.
3431 * All transanction credits have been reserved in mknod.
3433 int ocfs2_xattr_set_handle(handle_t
*handle
,
3434 struct inode
*inode
,
3435 struct buffer_head
*di_bh
,
3441 struct ocfs2_alloc_context
*meta_ac
,
3442 struct ocfs2_alloc_context
*data_ac
)
3444 struct ocfs2_dinode
*di
;
3447 struct ocfs2_xattr_info xi
= {
3448 .xi_name_index
= name_index
,
3450 .xi_name_len
= strlen(name
),
3452 .xi_value_len
= value_len
,
3455 struct ocfs2_xattr_search xis
= {
3456 .not_found
= -ENODATA
,
3459 struct ocfs2_xattr_search xbs
= {
3460 .not_found
= -ENODATA
,
3463 struct ocfs2_xattr_set_ctxt ctxt
= {
3469 if (!ocfs2_supports_xattr(OCFS2_SB(inode
->i_sb
)))
3473 * In extreme situation, may need xattr bucket when
3474 * block size is too small. And we have already reserved
3475 * the credits for bucket in mknod.
3477 if (inode
->i_sb
->s_blocksize
== OCFS2_MIN_BLOCKSIZE
) {
3478 xbs
.bucket
= ocfs2_xattr_bucket_new(inode
);
3480 mlog_errno(-ENOMEM
);
3485 xis
.inode_bh
= xbs
.inode_bh
= di_bh
;
3486 di
= (struct ocfs2_dinode
*)di_bh
->b_data
;
3488 down_write(&OCFS2_I(inode
)->ip_xattr_sem
);
3490 ret
= ocfs2_xattr_ibody_find(inode
, name_index
, name
, &xis
);
3493 if (xis
.not_found
) {
3494 ret
= ocfs2_xattr_block_find(inode
, name_index
, name
, &xbs
);
3499 ret
= __ocfs2_xattr_set_handle(inode
, di
, &xi
, &xis
, &xbs
, &ctxt
);
3502 up_write(&OCFS2_I(inode
)->ip_xattr_sem
);
3503 brelse(xbs
.xattr_bh
);
3504 ocfs2_xattr_bucket_free(xbs
.bucket
);
3512 * Set, replace or remove an extended attribute for this inode.
3513 * value is NULL to remove an existing extended attribute, else either
3514 * create or replace an extended attribute.
3516 int ocfs2_xattr_set(struct inode
*inode
,
3523 struct buffer_head
*di_bh
= NULL
;
3524 struct ocfs2_dinode
*di
;
3525 int ret
, credits
, ref_meta
= 0, ref_credits
= 0;
3526 struct ocfs2_super
*osb
= OCFS2_SB(inode
->i_sb
);
3527 struct inode
*tl_inode
= osb
->osb_tl_inode
;
3528 struct ocfs2_xattr_set_ctxt ctxt
= { NULL
, NULL
, NULL
, };
3529 struct ocfs2_refcount_tree
*ref_tree
= NULL
;
3531 struct ocfs2_xattr_info xi
= {
3532 .xi_name_index
= name_index
,
3534 .xi_name_len
= strlen(name
),
3536 .xi_value_len
= value_len
,
3539 struct ocfs2_xattr_search xis
= {
3540 .not_found
= -ENODATA
,
3543 struct ocfs2_xattr_search xbs
= {
3544 .not_found
= -ENODATA
,
3547 if (!ocfs2_supports_xattr(OCFS2_SB(inode
->i_sb
)))
3551 * Only xbs will be used on indexed trees. xis doesn't need a
3554 xbs
.bucket
= ocfs2_xattr_bucket_new(inode
);
3556 mlog_errno(-ENOMEM
);
3560 ret
= ocfs2_inode_lock(inode
, &di_bh
, 1);
3563 goto cleanup_nolock
;
3565 xis
.inode_bh
= xbs
.inode_bh
= di_bh
;
3566 di
= (struct ocfs2_dinode
*)di_bh
->b_data
;
3568 down_write(&OCFS2_I(inode
)->ip_xattr_sem
);
3570 * Scan inode and external block to find the same name
3571 * extended attribute and collect search information.
3573 ret
= ocfs2_xattr_ibody_find(inode
, name_index
, name
, &xis
);
3576 if (xis
.not_found
) {
3577 ret
= ocfs2_xattr_block_find(inode
, name_index
, name
, &xbs
);
3582 if (xis
.not_found
&& xbs
.not_found
) {
3584 if (flags
& XATTR_REPLACE
)
3591 if (flags
& XATTR_CREATE
)
3595 /* Check whether the value is refcounted and do some preparation. */
3596 if (OCFS2_I(inode
)->ip_dyn_features
& OCFS2_HAS_REFCOUNT_FL
&&
3597 (!xis
.not_found
|| !xbs
.not_found
)) {
3598 ret
= ocfs2_prepare_refcount_xattr(inode
, di
, &xi
,
3599 &xis
, &xbs
, &ref_tree
,
3600 &ref_meta
, &ref_credits
);
3607 mutex_lock(&tl_inode
->i_mutex
);
3609 if (ocfs2_truncate_log_needs_flush(osb
)) {
3610 ret
= __ocfs2_flush_truncate_log(osb
);
3612 mutex_unlock(&tl_inode
->i_mutex
);
3617 mutex_unlock(&tl_inode
->i_mutex
);
3619 ret
= ocfs2_init_xattr_set_ctxt(inode
, di
, &xi
, &xis
,
3620 &xbs
, &ctxt
, ref_meta
, &credits
);
3626 /* we need to update inode's ctime field, so add credit for it. */
3627 credits
+= OCFS2_INODE_UPDATE_CREDITS
;
3628 ctxt
.handle
= ocfs2_start_trans(osb
, credits
+ ref_credits
);
3629 if (IS_ERR(ctxt
.handle
)) {
3630 ret
= PTR_ERR(ctxt
.handle
);
3635 ret
= __ocfs2_xattr_set_handle(inode
, di
, &xi
, &xis
, &xbs
, &ctxt
);
3636 ocfs2_update_inode_fsync_trans(ctxt
.handle
, inode
, 0);
3638 ocfs2_commit_trans(osb
, ctxt
.handle
);
3642 ocfs2_free_alloc_context(ctxt
.data_ac
);
3644 ocfs2_free_alloc_context(ctxt
.meta_ac
);
3645 if (ocfs2_dealloc_has_cluster(&ctxt
.dealloc
))
3646 ocfs2_schedule_truncate_log_flush(osb
, 1);
3647 ocfs2_run_deallocs(osb
, &ctxt
.dealloc
);
3651 ocfs2_unlock_refcount_tree(osb
, ref_tree
, 1);
3652 up_write(&OCFS2_I(inode
)->ip_xattr_sem
);
3653 if (!value
&& !ret
) {
3654 ret
= ocfs2_try_remove_refcount_tree(inode
, di_bh
);
3658 ocfs2_inode_unlock(inode
, 1);
3661 brelse(xbs
.xattr_bh
);
3662 ocfs2_xattr_bucket_free(xbs
.bucket
);
3668 * Find the xattr extent rec which may contains name_hash.
3669 * e_cpos will be the first name hash of the xattr rec.
3670 * el must be the ocfs2_xattr_header.xb_attrs.xb_root.xt_list.
3672 static int ocfs2_xattr_get_rec(struct inode
*inode
,
3677 struct ocfs2_extent_list
*el
)
3680 struct buffer_head
*eb_bh
= NULL
;
3681 struct ocfs2_extent_block
*eb
;
3682 struct ocfs2_extent_rec
*rec
= NULL
;
3685 if (el
->l_tree_depth
) {
3686 ret
= ocfs2_find_leaf(INODE_CACHE(inode
), el
, name_hash
,
3693 eb
= (struct ocfs2_extent_block
*) eb_bh
->b_data
;
3696 if (el
->l_tree_depth
) {
3697 ocfs2_error(inode
->i_sb
,
3698 "Inode %lu has non zero tree depth in "
3699 "xattr tree block %llu\n", inode
->i_ino
,
3700 (unsigned long long)eb_bh
->b_blocknr
);
3706 for (i
= le16_to_cpu(el
->l_next_free_rec
) - 1; i
>= 0; i
--) {
3707 rec
= &el
->l_recs
[i
];
3709 if (le32_to_cpu(rec
->e_cpos
) <= name_hash
) {
3710 e_blkno
= le64_to_cpu(rec
->e_blkno
);
3716 ocfs2_error(inode
->i_sb
, "Inode %lu has bad extent "
3717 "record (%u, %u, 0) in xattr", inode
->i_ino
,
3718 le32_to_cpu(rec
->e_cpos
),
3719 ocfs2_rec_clusters(el
, rec
));
3724 *p_blkno
= le64_to_cpu(rec
->e_blkno
);
3725 *num_clusters
= le16_to_cpu(rec
->e_leaf_clusters
);
3727 *e_cpos
= le32_to_cpu(rec
->e_cpos
);
3733 typedef int (xattr_bucket_func
)(struct inode
*inode
,
3734 struct ocfs2_xattr_bucket
*bucket
,
3737 static int ocfs2_find_xe_in_bucket(struct inode
*inode
,
3738 struct ocfs2_xattr_bucket
*bucket
,
3745 int i
, ret
= 0, cmp
= 1, block_off
, new_offset
;
3746 struct ocfs2_xattr_header
*xh
= bucket_xh(bucket
);
3747 size_t name_len
= strlen(name
);
3748 struct ocfs2_xattr_entry
*xe
= NULL
;
3752 * We don't use binary search in the bucket because there
3753 * may be multiple entries with the same name hash.
3755 for (i
= 0; i
< le16_to_cpu(xh
->xh_count
); i
++) {
3756 xe
= &xh
->xh_entries
[i
];
3758 if (name_hash
> le32_to_cpu(xe
->xe_name_hash
))
3760 else if (name_hash
< le32_to_cpu(xe
->xe_name_hash
))
3763 cmp
= name_index
- ocfs2_xattr_get_type(xe
);
3765 cmp
= name_len
- xe
->xe_name_len
;
3769 ret
= ocfs2_xattr_bucket_get_name_value(inode
->i_sb
,
3780 xe_name
= bucket_block(bucket
, block_off
) + new_offset
;
3781 if (!memcmp(name
, xe_name
, name_len
)) {
3793 * Find the specified xattr entry in a series of buckets.
3794 * This series start from p_blkno and last for num_clusters.
3795 * The ocfs2_xattr_header.xh_num_buckets of the first bucket contains
3796 * the num of the valid buckets.
3798 * Return the buffer_head this xattr should reside in. And if the xattr's
3799 * hash is in the gap of 2 buckets, return the lower bucket.
3801 static int ocfs2_xattr_bucket_find(struct inode
*inode
,
3808 struct ocfs2_xattr_search
*xs
)
3811 struct ocfs2_xattr_header
*xh
= NULL
;
3812 struct ocfs2_xattr_entry
*xe
= NULL
;
3814 u16 blk_per_bucket
= ocfs2_blocks_per_xattr_bucket(inode
->i_sb
);
3815 int low_bucket
= 0, bucket
, high_bucket
;
3816 struct ocfs2_xattr_bucket
*search
;
3818 u64 blkno
, lower_blkno
= 0;
3820 search
= ocfs2_xattr_bucket_new(inode
);
3827 ret
= ocfs2_read_xattr_bucket(search
, p_blkno
);
3833 xh
= bucket_xh(search
);
3834 high_bucket
= le16_to_cpu(xh
->xh_num_buckets
) - 1;
3835 while (low_bucket
<= high_bucket
) {
3836 ocfs2_xattr_bucket_relse(search
);
3838 bucket
= (low_bucket
+ high_bucket
) / 2;
3839 blkno
= p_blkno
+ bucket
* blk_per_bucket
;
3840 ret
= ocfs2_read_xattr_bucket(search
, blkno
);
3846 xh
= bucket_xh(search
);
3847 xe
= &xh
->xh_entries
[0];
3848 if (name_hash
< le32_to_cpu(xe
->xe_name_hash
)) {
3849 high_bucket
= bucket
- 1;
3854 * Check whether the hash of the last entry in our
3855 * bucket is larger than the search one. for an empty
3856 * bucket, the last one is also the first one.
3859 xe
= &xh
->xh_entries
[le16_to_cpu(xh
->xh_count
) - 1];
3861 last_hash
= le32_to_cpu(xe
->xe_name_hash
);
3863 /* record lower_blkno which may be the insert place. */
3864 lower_blkno
= blkno
;
3866 if (name_hash
> le32_to_cpu(xe
->xe_name_hash
)) {
3867 low_bucket
= bucket
+ 1;
3871 /* the searched xattr should reside in this bucket if exists. */
3872 ret
= ocfs2_find_xe_in_bucket(inode
, search
,
3873 name_index
, name
, name_hash
,
3883 * Record the bucket we have found.
3884 * When the xattr's hash value is in the gap of 2 buckets, we will
3885 * always set it to the previous bucket.
3888 lower_blkno
= p_blkno
;
3890 /* This should be in cache - we just read it during the search */
3891 ret
= ocfs2_read_xattr_bucket(xs
->bucket
, lower_blkno
);
3897 xs
->header
= bucket_xh(xs
->bucket
);
3898 xs
->base
= bucket_block(xs
->bucket
, 0);
3899 xs
->end
= xs
->base
+ inode
->i_sb
->s_blocksize
;
3902 xs
->here
= &xs
->header
->xh_entries
[index
];
3903 trace_ocfs2_xattr_bucket_find(OCFS2_I(inode
)->ip_blkno
,
3904 name
, name_index
, name_hash
,
3905 (unsigned long long)bucket_blkno(xs
->bucket
),
3911 ocfs2_xattr_bucket_free(search
);
3915 static int ocfs2_xattr_index_block_find(struct inode
*inode
,
3916 struct buffer_head
*root_bh
,
3919 struct ocfs2_xattr_search
*xs
)
3922 struct ocfs2_xattr_block
*xb
=
3923 (struct ocfs2_xattr_block
*)root_bh
->b_data
;
3924 struct ocfs2_xattr_tree_root
*xb_root
= &xb
->xb_attrs
.xb_root
;
3925 struct ocfs2_extent_list
*el
= &xb_root
->xt_list
;
3927 u32 first_hash
, num_clusters
= 0;
3928 u32 name_hash
= ocfs2_xattr_name_hash(inode
, name
, strlen(name
));
3930 if (le16_to_cpu(el
->l_next_free_rec
) == 0)
3933 trace_ocfs2_xattr_index_block_find(OCFS2_I(inode
)->ip_blkno
,
3934 name
, name_index
, name_hash
,
3935 (unsigned long long)root_bh
->b_blocknr
,
3938 ret
= ocfs2_xattr_get_rec(inode
, name_hash
, &p_blkno
, &first_hash
,
3945 BUG_ON(p_blkno
== 0 || num_clusters
== 0 || first_hash
> name_hash
);
3947 trace_ocfs2_xattr_index_block_find_rec(OCFS2_I(inode
)->ip_blkno
,
3948 name
, name_index
, first_hash
,
3949 (unsigned long long)p_blkno
,
3952 ret
= ocfs2_xattr_bucket_find(inode
, name_index
, name
, name_hash
,
3953 p_blkno
, first_hash
, num_clusters
, xs
);
3959 static int ocfs2_iterate_xattr_buckets(struct inode
*inode
,
3962 xattr_bucket_func
*func
,
3966 u32 bpc
= ocfs2_xattr_buckets_per_cluster(OCFS2_SB(inode
->i_sb
));
3967 u32 num_buckets
= clusters
* bpc
;
3968 struct ocfs2_xattr_bucket
*bucket
;
3970 bucket
= ocfs2_xattr_bucket_new(inode
);
3972 mlog_errno(-ENOMEM
);
3976 trace_ocfs2_iterate_xattr_buckets(
3977 (unsigned long long)OCFS2_I(inode
)->ip_blkno
,
3978 (unsigned long long)blkno
, clusters
);
3980 for (i
= 0; i
< num_buckets
; i
++, blkno
+= bucket
->bu_blocks
) {
3981 ret
= ocfs2_read_xattr_bucket(bucket
, blkno
);
3988 * The real bucket num in this series of blocks is stored
3989 * in the 1st bucket.
3992 num_buckets
= le16_to_cpu(bucket_xh(bucket
)->xh_num_buckets
);
3994 trace_ocfs2_iterate_xattr_bucket((unsigned long long)blkno
,
3995 le32_to_cpu(bucket_xh(bucket
)->xh_entries
[0].xe_name_hash
));
3997 ret
= func(inode
, bucket
, para
);
3998 if (ret
&& ret
!= -ERANGE
)
4000 /* Fall through to bucket_relse() */
4003 ocfs2_xattr_bucket_relse(bucket
);
4008 ocfs2_xattr_bucket_free(bucket
);
4012 struct ocfs2_xattr_tree_list
{
4018 static int ocfs2_xattr_bucket_get_name_value(struct super_block
*sb
,
4019 struct ocfs2_xattr_header
*xh
,
4026 if (index
< 0 || index
>= le16_to_cpu(xh
->xh_count
))
4029 name_offset
= le16_to_cpu(xh
->xh_entries
[index
].xe_name_offset
);
4031 *block_off
= name_offset
>> sb
->s_blocksize_bits
;
4032 *new_offset
= name_offset
% sb
->s_blocksize
;
4037 static int ocfs2_list_xattr_bucket(struct inode
*inode
,
4038 struct ocfs2_xattr_bucket
*bucket
,
4042 struct ocfs2_xattr_tree_list
*xl
= (struct ocfs2_xattr_tree_list
*)para
;
4043 int i
, block_off
, new_offset
;
4044 const char *prefix
, *name
;
4046 for (i
= 0 ; i
< le16_to_cpu(bucket_xh(bucket
)->xh_count
); i
++) {
4047 struct ocfs2_xattr_entry
*entry
= &bucket_xh(bucket
)->xh_entries
[i
];
4048 type
= ocfs2_xattr_get_type(entry
);
4049 prefix
= ocfs2_xattr_prefix(type
);
4052 ret
= ocfs2_xattr_bucket_get_name_value(inode
->i_sb
,
4060 name
= (const char *)bucket_block(bucket
, block_off
) +
4062 ret
= ocfs2_xattr_list_entry(xl
->buffer
,
4066 entry
->xe_name_len
);
4075 static int ocfs2_iterate_xattr_index_block(struct inode
*inode
,
4076 struct buffer_head
*blk_bh
,
4077 xattr_tree_rec_func
*rec_func
,
4080 struct ocfs2_xattr_block
*xb
=
4081 (struct ocfs2_xattr_block
*)blk_bh
->b_data
;
4082 struct ocfs2_extent_list
*el
= &xb
->xb_attrs
.xb_root
.xt_list
;
4084 u32 name_hash
= UINT_MAX
, e_cpos
= 0, num_clusters
= 0;
4087 if (!el
->l_next_free_rec
|| !rec_func
)
4090 while (name_hash
> 0) {
4091 ret
= ocfs2_xattr_get_rec(inode
, name_hash
, &p_blkno
,
4092 &e_cpos
, &num_clusters
, el
);
4098 ret
= rec_func(inode
, blk_bh
, p_blkno
, e_cpos
,
4099 num_clusters
, para
);
4109 name_hash
= e_cpos
- 1;
4116 static int ocfs2_list_xattr_tree_rec(struct inode
*inode
,
4117 struct buffer_head
*root_bh
,
4118 u64 blkno
, u32 cpos
, u32 len
, void *para
)
4120 return ocfs2_iterate_xattr_buckets(inode
, blkno
, len
,
4121 ocfs2_list_xattr_bucket
, para
);
4124 static int ocfs2_xattr_tree_list_index_block(struct inode
*inode
,
4125 struct buffer_head
*blk_bh
,
4130 struct ocfs2_xattr_tree_list xl
= {
4132 .buffer_size
= buffer_size
,
4136 ret
= ocfs2_iterate_xattr_index_block(inode
, blk_bh
,
4137 ocfs2_list_xattr_tree_rec
, &xl
);
4148 static int cmp_xe(const void *a
, const void *b
)
4150 const struct ocfs2_xattr_entry
*l
= a
, *r
= b
;
4151 u32 l_hash
= le32_to_cpu(l
->xe_name_hash
);
4152 u32 r_hash
= le32_to_cpu(r
->xe_name_hash
);
4154 if (l_hash
> r_hash
)
4156 if (l_hash
< r_hash
)
4161 static void swap_xe(void *a
, void *b
, int size
)
4163 struct ocfs2_xattr_entry
*l
= a
, *r
= b
, tmp
;
4166 memcpy(l
, r
, sizeof(struct ocfs2_xattr_entry
));
4167 memcpy(r
, &tmp
, sizeof(struct ocfs2_xattr_entry
));
4171 * When the ocfs2_xattr_block is filled up, new bucket will be created
4172 * and all the xattr entries will be moved to the new bucket.
4173 * The header goes at the start of the bucket, and the names+values are
4174 * filled from the end. This is why *target starts as the last buffer.
4175 * Note: we need to sort the entries since they are not saved in order
4176 * in the ocfs2_xattr_block.
4178 static void ocfs2_cp_xattr_block_to_bucket(struct inode
*inode
,
4179 struct buffer_head
*xb_bh
,
4180 struct ocfs2_xattr_bucket
*bucket
)
4182 int i
, blocksize
= inode
->i_sb
->s_blocksize
;
4183 int blks
= ocfs2_blocks_per_xattr_bucket(inode
->i_sb
);
4184 u16 offset
, size
, off_change
;
4185 struct ocfs2_xattr_entry
*xe
;
4186 struct ocfs2_xattr_block
*xb
=
4187 (struct ocfs2_xattr_block
*)xb_bh
->b_data
;
4188 struct ocfs2_xattr_header
*xb_xh
= &xb
->xb_attrs
.xb_header
;
4189 struct ocfs2_xattr_header
*xh
= bucket_xh(bucket
);
4190 u16 count
= le16_to_cpu(xb_xh
->xh_count
);
4191 char *src
= xb_bh
->b_data
;
4192 char *target
= bucket_block(bucket
, blks
- 1);
4194 trace_ocfs2_cp_xattr_block_to_bucket_begin(
4195 (unsigned long long)xb_bh
->b_blocknr
,
4196 (unsigned long long)bucket_blkno(bucket
));
4198 for (i
= 0; i
< blks
; i
++)
4199 memset(bucket_block(bucket
, i
), 0, blocksize
);
4202 * Since the xe_name_offset is based on ocfs2_xattr_header,
4203 * there is a offset change corresponding to the change of
4204 * ocfs2_xattr_header's position.
4206 off_change
= offsetof(struct ocfs2_xattr_block
, xb_attrs
.xb_header
);
4207 xe
= &xb_xh
->xh_entries
[count
- 1];
4208 offset
= le16_to_cpu(xe
->xe_name_offset
) + off_change
;
4209 size
= blocksize
- offset
;
4211 /* copy all the names and values. */
4212 memcpy(target
+ offset
, src
+ offset
, size
);
4214 /* Init new header now. */
4215 xh
->xh_count
= xb_xh
->xh_count
;
4216 xh
->xh_num_buckets
= cpu_to_le16(1);
4217 xh
->xh_name_value_len
= cpu_to_le16(size
);
4218 xh
->xh_free_start
= cpu_to_le16(OCFS2_XATTR_BUCKET_SIZE
- size
);
4220 /* copy all the entries. */
4221 target
= bucket_block(bucket
, 0);
4222 offset
= offsetof(struct ocfs2_xattr_header
, xh_entries
);
4223 size
= count
* sizeof(struct ocfs2_xattr_entry
);
4224 memcpy(target
+ offset
, (char *)xb_xh
+ offset
, size
);
4226 /* Change the xe offset for all the xe because of the move. */
4227 off_change
= OCFS2_XATTR_BUCKET_SIZE
- blocksize
+
4228 offsetof(struct ocfs2_xattr_block
, xb_attrs
.xb_header
);
4229 for (i
= 0; i
< count
; i
++)
4230 le16_add_cpu(&xh
->xh_entries
[i
].xe_name_offset
, off_change
);
4232 trace_ocfs2_cp_xattr_block_to_bucket_end(offset
, size
, off_change
);
4234 sort(target
+ offset
, count
, sizeof(struct ocfs2_xattr_entry
),
4239 * After we move xattr from block to index btree, we have to
4240 * update ocfs2_xattr_search to the new xe and base.
4242 * When the entry is in xattr block, xattr_bh indicates the storage place.
4243 * While if the entry is in index b-tree, "bucket" indicates the
4244 * real place of the xattr.
4246 static void ocfs2_xattr_update_xattr_search(struct inode
*inode
,
4247 struct ocfs2_xattr_search
*xs
,
4248 struct buffer_head
*old_bh
)
4250 char *buf
= old_bh
->b_data
;
4251 struct ocfs2_xattr_block
*old_xb
= (struct ocfs2_xattr_block
*)buf
;
4252 struct ocfs2_xattr_header
*old_xh
= &old_xb
->xb_attrs
.xb_header
;
4255 xs
->header
= bucket_xh(xs
->bucket
);
4256 xs
->base
= bucket_block(xs
->bucket
, 0);
4257 xs
->end
= xs
->base
+ inode
->i_sb
->s_blocksize
;
4262 i
= xs
->here
- old_xh
->xh_entries
;
4263 xs
->here
= &xs
->header
->xh_entries
[i
];
4266 static int ocfs2_xattr_create_index_block(struct inode
*inode
,
4267 struct ocfs2_xattr_search
*xs
,
4268 struct ocfs2_xattr_set_ctxt
*ctxt
)
4273 handle_t
*handle
= ctxt
->handle
;
4274 struct ocfs2_inode_info
*oi
= OCFS2_I(inode
);
4275 struct buffer_head
*xb_bh
= xs
->xattr_bh
;
4276 struct ocfs2_xattr_block
*xb
=
4277 (struct ocfs2_xattr_block
*)xb_bh
->b_data
;
4278 struct ocfs2_xattr_tree_root
*xr
;
4279 u16 xb_flags
= le16_to_cpu(xb
->xb_flags
);
4281 trace_ocfs2_xattr_create_index_block_begin(
4282 (unsigned long long)xb_bh
->b_blocknr
);
4284 BUG_ON(xb_flags
& OCFS2_XATTR_INDEXED
);
4285 BUG_ON(!xs
->bucket
);
4289 * We can use this lock for now, and maybe move to a dedicated mutex
4290 * if performance becomes a problem later.
4292 down_write(&oi
->ip_alloc_sem
);
4294 ret
= ocfs2_journal_access_xb(handle
, INODE_CACHE(inode
), xb_bh
,
4295 OCFS2_JOURNAL_ACCESS_WRITE
);
4301 ret
= __ocfs2_claim_clusters(handle
, ctxt
->data_ac
,
4302 1, 1, &bit_off
, &len
);
4309 * The bucket may spread in many blocks, and
4310 * we will only touch the 1st block and the last block
4311 * in the whole bucket(one for entry and one for data).
4313 blkno
= ocfs2_clusters_to_blocks(inode
->i_sb
, bit_off
);
4315 trace_ocfs2_xattr_create_index_block((unsigned long long)blkno
);
4317 ret
= ocfs2_init_xattr_bucket(xs
->bucket
, blkno
, 1);
4323 ret
= ocfs2_xattr_bucket_journal_access(handle
, xs
->bucket
,
4324 OCFS2_JOURNAL_ACCESS_CREATE
);
4330 ocfs2_cp_xattr_block_to_bucket(inode
, xb_bh
, xs
->bucket
);
4331 ocfs2_xattr_bucket_journal_dirty(handle
, xs
->bucket
);
4333 ocfs2_xattr_update_xattr_search(inode
, xs
, xb_bh
);
4335 /* Change from ocfs2_xattr_header to ocfs2_xattr_tree_root */
4336 memset(&xb
->xb_attrs
, 0, inode
->i_sb
->s_blocksize
-
4337 offsetof(struct ocfs2_xattr_block
, xb_attrs
));
4339 xr
= &xb
->xb_attrs
.xb_root
;
4340 xr
->xt_clusters
= cpu_to_le32(1);
4341 xr
->xt_last_eb_blk
= 0;
4342 xr
->xt_list
.l_tree_depth
= 0;
4343 xr
->xt_list
.l_count
= cpu_to_le16(ocfs2_xattr_recs_per_xb(inode
->i_sb
));
4344 xr
->xt_list
.l_next_free_rec
= cpu_to_le16(1);
4346 xr
->xt_list
.l_recs
[0].e_cpos
= 0;
4347 xr
->xt_list
.l_recs
[0].e_blkno
= cpu_to_le64(blkno
);
4348 xr
->xt_list
.l_recs
[0].e_leaf_clusters
= cpu_to_le16(1);
4350 xb
->xb_flags
= cpu_to_le16(xb_flags
| OCFS2_XATTR_INDEXED
);
4352 ocfs2_journal_dirty(handle
, xb_bh
);
4355 up_write(&oi
->ip_alloc_sem
);
4360 static int cmp_xe_offset(const void *a
, const void *b
)
4362 const struct ocfs2_xattr_entry
*l
= a
, *r
= b
;
4363 u32 l_name_offset
= le16_to_cpu(l
->xe_name_offset
);
4364 u32 r_name_offset
= le16_to_cpu(r
->xe_name_offset
);
4366 if (l_name_offset
< r_name_offset
)
4368 if (l_name_offset
> r_name_offset
)
4374 * defrag a xattr bucket if we find that the bucket has some
4375 * holes beteen name/value pairs.
4376 * We will move all the name/value pairs to the end of the bucket
4377 * so that we can spare some space for insertion.
4379 static int ocfs2_defrag_xattr_bucket(struct inode
*inode
,
4381 struct ocfs2_xattr_bucket
*bucket
)
4384 size_t end
, offset
, len
;
4385 struct ocfs2_xattr_header
*xh
;
4386 char *entries
, *buf
, *bucket_buf
= NULL
;
4387 u64 blkno
= bucket_blkno(bucket
);
4389 size_t blocksize
= inode
->i_sb
->s_blocksize
;
4390 struct ocfs2_xattr_entry
*xe
;
4393 * In order to make the operation more efficient and generic,
4394 * we copy all the blocks into a contiguous memory and do the
4395 * defragment there, so if anything is error, we will not touch
4398 bucket_buf
= kmalloc(OCFS2_XATTR_BUCKET_SIZE
, GFP_NOFS
);
4405 for (i
= 0; i
< bucket
->bu_blocks
; i
++, buf
+= blocksize
)
4406 memcpy(buf
, bucket_block(bucket
, i
), blocksize
);
4408 ret
= ocfs2_xattr_bucket_journal_access(handle
, bucket
,
4409 OCFS2_JOURNAL_ACCESS_WRITE
);
4415 xh
= (struct ocfs2_xattr_header
*)bucket_buf
;
4416 entries
= (char *)xh
->xh_entries
;
4417 xh_free_start
= le16_to_cpu(xh
->xh_free_start
);
4419 trace_ocfs2_defrag_xattr_bucket(
4420 (unsigned long long)blkno
, le16_to_cpu(xh
->xh_count
),
4421 xh_free_start
, le16_to_cpu(xh
->xh_name_value_len
));
4424 * sort all the entries by their offset.
4425 * the largest will be the first, so that we can
4426 * move them to the end one by one.
4428 sort(entries
, le16_to_cpu(xh
->xh_count
),
4429 sizeof(struct ocfs2_xattr_entry
),
4430 cmp_xe_offset
, swap_xe
);
4432 /* Move all name/values to the end of the bucket. */
4433 xe
= xh
->xh_entries
;
4434 end
= OCFS2_XATTR_BUCKET_SIZE
;
4435 for (i
= 0; i
< le16_to_cpu(xh
->xh_count
); i
++, xe
++) {
4436 offset
= le16_to_cpu(xe
->xe_name_offset
);
4437 len
= namevalue_size_xe(xe
);
4440 * We must make sure that the name/value pair
4441 * exist in the same block. So adjust end to
4442 * the previous block end if needed.
4444 if (((end
- len
) / blocksize
!=
4445 (end
- 1) / blocksize
))
4446 end
= end
- end
% blocksize
;
4448 if (end
> offset
+ len
) {
4449 memmove(bucket_buf
+ end
- len
,
4450 bucket_buf
+ offset
, len
);
4451 xe
->xe_name_offset
= cpu_to_le16(end
- len
);
4454 mlog_bug_on_msg(end
< offset
+ len
, "Defrag check failed for "
4455 "bucket %llu\n", (unsigned long long)blkno
);
4460 mlog_bug_on_msg(xh_free_start
> end
, "Defrag check failed for "
4461 "bucket %llu\n", (unsigned long long)blkno
);
4463 if (xh_free_start
== end
)
4466 memset(bucket_buf
+ xh_free_start
, 0, end
- xh_free_start
);
4467 xh
->xh_free_start
= cpu_to_le16(end
);
4469 /* sort the entries by their name_hash. */
4470 sort(entries
, le16_to_cpu(xh
->xh_count
),
4471 sizeof(struct ocfs2_xattr_entry
),
4475 for (i
= 0; i
< bucket
->bu_blocks
; i
++, buf
+= blocksize
)
4476 memcpy(bucket_block(bucket
, i
), buf
, blocksize
);
4477 ocfs2_xattr_bucket_journal_dirty(handle
, bucket
);
4485 * prev_blkno points to the start of an existing extent. new_blkno
4486 * points to a newly allocated extent. Because we know each of our
4487 * clusters contains more than bucket, we can easily split one cluster
4488 * at a bucket boundary. So we take the last cluster of the existing
4489 * extent and split it down the middle. We move the last half of the
4490 * buckets in the last cluster of the existing extent over to the new
4493 * first_bh is the buffer at prev_blkno so we can update the existing
4494 * extent's bucket count. header_bh is the bucket were we were hoping
4495 * to insert our xattr. If the bucket move places the target in the new
4496 * extent, we'll update first_bh and header_bh after modifying the old
4499 * first_hash will be set as the 1st xe's name_hash in the new extent.
4501 static int ocfs2_mv_xattr_bucket_cross_cluster(struct inode
*inode
,
4503 struct ocfs2_xattr_bucket
*first
,
4504 struct ocfs2_xattr_bucket
*target
,
4510 struct super_block
*sb
= inode
->i_sb
;
4511 int blks_per_bucket
= ocfs2_blocks_per_xattr_bucket(sb
);
4512 int num_buckets
= ocfs2_xattr_buckets_per_cluster(OCFS2_SB(sb
));
4513 int to_move
= num_buckets
/ 2;
4515 u64 last_cluster_blkno
= bucket_blkno(first
) +
4516 ((num_clusters
- 1) * ocfs2_clusters_to_blocks(sb
, 1));
4518 BUG_ON(le16_to_cpu(bucket_xh(first
)->xh_num_buckets
) < num_buckets
);
4519 BUG_ON(OCFS2_XATTR_BUCKET_SIZE
== OCFS2_SB(sb
)->s_clustersize
);
4521 trace_ocfs2_mv_xattr_bucket_cross_cluster(
4522 (unsigned long long)last_cluster_blkno
,
4523 (unsigned long long)new_blkno
);
4525 ret
= ocfs2_mv_xattr_buckets(inode
, handle
, bucket_blkno(first
),
4526 last_cluster_blkno
, new_blkno
,
4527 to_move
, first_hash
);
4533 /* This is the first bucket that got moved */
4534 src_blkno
= last_cluster_blkno
+ (to_move
* blks_per_bucket
);
4537 * If the target bucket was part of the moved buckets, we need to
4538 * update first and target.
4540 if (bucket_blkno(target
) >= src_blkno
) {
4541 /* Find the block for the new target bucket */
4542 src_blkno
= new_blkno
+
4543 (bucket_blkno(target
) - src_blkno
);
4545 ocfs2_xattr_bucket_relse(first
);
4546 ocfs2_xattr_bucket_relse(target
);
4549 * These shouldn't fail - the buffers are in the
4550 * journal from ocfs2_cp_xattr_bucket().
4552 ret
= ocfs2_read_xattr_bucket(first
, new_blkno
);
4557 ret
= ocfs2_read_xattr_bucket(target
, src_blkno
);
4568 * Find the suitable pos when we divide a bucket into 2.
4569 * We have to make sure the xattrs with the same hash value exist
4570 * in the same bucket.
4572 * If this ocfs2_xattr_header covers more than one hash value, find a
4573 * place where the hash value changes. Try to find the most even split.
4574 * The most common case is that all entries have different hash values,
4575 * and the first check we make will find a place to split.
4577 static int ocfs2_xattr_find_divide_pos(struct ocfs2_xattr_header
*xh
)
4579 struct ocfs2_xattr_entry
*entries
= xh
->xh_entries
;
4580 int count
= le16_to_cpu(xh
->xh_count
);
4581 int delta
, middle
= count
/ 2;
4584 * We start at the middle. Each step gets farther away in both
4585 * directions. We therefore hit the change in hash value
4586 * nearest to the middle. Note that this loop does not execute for
4589 for (delta
= 0; delta
< middle
; delta
++) {
4590 /* Let's check delta earlier than middle */
4591 if (cmp_xe(&entries
[middle
- delta
- 1],
4592 &entries
[middle
- delta
]))
4593 return middle
- delta
;
4595 /* For even counts, don't walk off the end */
4596 if ((middle
+ delta
+ 1) == count
)
4599 /* Now try delta past middle */
4600 if (cmp_xe(&entries
[middle
+ delta
],
4601 &entries
[middle
+ delta
+ 1]))
4602 return middle
+ delta
+ 1;
4605 /* Every entry had the same hash */
4610 * Move some xattrs in old bucket(blk) to new bucket(new_blk).
4611 * first_hash will record the 1st hash of the new bucket.
4613 * Normally half of the xattrs will be moved. But we have to make
4614 * sure that the xattrs with the same hash value are stored in the
4615 * same bucket. If all the xattrs in this bucket have the same hash
4616 * value, the new bucket will be initialized as an empty one and the
4617 * first_hash will be initialized as (hash_value+1).
4619 static int ocfs2_divide_xattr_bucket(struct inode
*inode
,
4624 int new_bucket_head
)
4627 int count
, start
, len
, name_value_len
= 0, name_offset
= 0;
4628 struct ocfs2_xattr_bucket
*s_bucket
= NULL
, *t_bucket
= NULL
;
4629 struct ocfs2_xattr_header
*xh
;
4630 struct ocfs2_xattr_entry
*xe
;
4631 int blocksize
= inode
->i_sb
->s_blocksize
;
4633 trace_ocfs2_divide_xattr_bucket_begin((unsigned long long)blk
,
4634 (unsigned long long)new_blk
);
4636 s_bucket
= ocfs2_xattr_bucket_new(inode
);
4637 t_bucket
= ocfs2_xattr_bucket_new(inode
);
4638 if (!s_bucket
|| !t_bucket
) {
4644 ret
= ocfs2_read_xattr_bucket(s_bucket
, blk
);
4650 ret
= ocfs2_xattr_bucket_journal_access(handle
, s_bucket
,
4651 OCFS2_JOURNAL_ACCESS_WRITE
);
4658 * Even if !new_bucket_head, we're overwriting t_bucket. Thus,
4659 * there's no need to read it.
4661 ret
= ocfs2_init_xattr_bucket(t_bucket
, new_blk
, new_bucket_head
);
4668 * Hey, if we're overwriting t_bucket, what difference does
4669 * ACCESS_CREATE vs ACCESS_WRITE make? See the comment in the
4670 * same part of ocfs2_cp_xattr_bucket().
4672 ret
= ocfs2_xattr_bucket_journal_access(handle
, t_bucket
,
4674 OCFS2_JOURNAL_ACCESS_CREATE
:
4675 OCFS2_JOURNAL_ACCESS_WRITE
);
4681 xh
= bucket_xh(s_bucket
);
4682 count
= le16_to_cpu(xh
->xh_count
);
4683 start
= ocfs2_xattr_find_divide_pos(xh
);
4685 if (start
== count
) {
4686 xe
= &xh
->xh_entries
[start
-1];
4689 * initialized a new empty bucket here.
4690 * The hash value is set as one larger than
4691 * that of the last entry in the previous bucket.
4693 for (i
= 0; i
< t_bucket
->bu_blocks
; i
++)
4694 memset(bucket_block(t_bucket
, i
), 0, blocksize
);
4696 xh
= bucket_xh(t_bucket
);
4697 xh
->xh_free_start
= cpu_to_le16(blocksize
);
4698 xh
->xh_entries
[0].xe_name_hash
= xe
->xe_name_hash
;
4699 le32_add_cpu(&xh
->xh_entries
[0].xe_name_hash
, 1);
4701 goto set_num_buckets
;
4704 /* copy the whole bucket to the new first. */
4705 ocfs2_xattr_bucket_copy_data(t_bucket
, s_bucket
);
4707 /* update the new bucket. */
4708 xh
= bucket_xh(t_bucket
);
4711 * Calculate the total name/value len and xh_free_start for
4712 * the old bucket first.
4714 name_offset
= OCFS2_XATTR_BUCKET_SIZE
;
4716 for (i
= 0; i
< start
; i
++) {
4717 xe
= &xh
->xh_entries
[i
];
4718 name_value_len
+= namevalue_size_xe(xe
);
4719 if (le16_to_cpu(xe
->xe_name_offset
) < name_offset
)
4720 name_offset
= le16_to_cpu(xe
->xe_name_offset
);
4724 * Now begin the modification to the new bucket.
4726 * In the new bucket, We just move the xattr entry to the beginning
4727 * and don't touch the name/value. So there will be some holes in the
4728 * bucket, and they will be removed when ocfs2_defrag_xattr_bucket is
4731 xe
= &xh
->xh_entries
[start
];
4732 len
= sizeof(struct ocfs2_xattr_entry
) * (count
- start
);
4733 trace_ocfs2_divide_xattr_bucket_move(len
,
4734 (int)((char *)xe
- (char *)xh
),
4735 (int)((char *)xh
->xh_entries
- (char *)xh
));
4736 memmove((char *)xh
->xh_entries
, (char *)xe
, len
);
4737 xe
= &xh
->xh_entries
[count
- start
];
4738 len
= sizeof(struct ocfs2_xattr_entry
) * start
;
4739 memset((char *)xe
, 0, len
);
4741 le16_add_cpu(&xh
->xh_count
, -start
);
4742 le16_add_cpu(&xh
->xh_name_value_len
, -name_value_len
);
4744 /* Calculate xh_free_start for the new bucket. */
4745 xh
->xh_free_start
= cpu_to_le16(OCFS2_XATTR_BUCKET_SIZE
);
4746 for (i
= 0; i
< le16_to_cpu(xh
->xh_count
); i
++) {
4747 xe
= &xh
->xh_entries
[i
];
4748 if (le16_to_cpu(xe
->xe_name_offset
) <
4749 le16_to_cpu(xh
->xh_free_start
))
4750 xh
->xh_free_start
= xe
->xe_name_offset
;
4754 /* set xh->xh_num_buckets for the new xh. */
4755 if (new_bucket_head
)
4756 xh
->xh_num_buckets
= cpu_to_le16(1);
4758 xh
->xh_num_buckets
= 0;
4760 ocfs2_xattr_bucket_journal_dirty(handle
, t_bucket
);
4762 /* store the first_hash of the new bucket. */
4764 *first_hash
= le32_to_cpu(xh
->xh_entries
[0].xe_name_hash
);
4767 * Now only update the 1st block of the old bucket. If we
4768 * just added a new empty bucket, there is no need to modify
4774 xh
= bucket_xh(s_bucket
);
4775 memset(&xh
->xh_entries
[start
], 0,
4776 sizeof(struct ocfs2_xattr_entry
) * (count
- start
));
4777 xh
->xh_count
= cpu_to_le16(start
);
4778 xh
->xh_free_start
= cpu_to_le16(name_offset
);
4779 xh
->xh_name_value_len
= cpu_to_le16(name_value_len
);
4781 ocfs2_xattr_bucket_journal_dirty(handle
, s_bucket
);
4784 ocfs2_xattr_bucket_free(s_bucket
);
4785 ocfs2_xattr_bucket_free(t_bucket
);
4791 * Copy xattr from one bucket to another bucket.
4793 * The caller must make sure that the journal transaction
4794 * has enough space for journaling.
4796 static int ocfs2_cp_xattr_bucket(struct inode
*inode
,
4803 struct ocfs2_xattr_bucket
*s_bucket
= NULL
, *t_bucket
= NULL
;
4805 BUG_ON(s_blkno
== t_blkno
);
4807 trace_ocfs2_cp_xattr_bucket((unsigned long long)s_blkno
,
4808 (unsigned long long)t_blkno
,
4811 s_bucket
= ocfs2_xattr_bucket_new(inode
);
4812 t_bucket
= ocfs2_xattr_bucket_new(inode
);
4813 if (!s_bucket
|| !t_bucket
) {
4819 ret
= ocfs2_read_xattr_bucket(s_bucket
, s_blkno
);
4824 * Even if !t_is_new, we're overwriting t_bucket. Thus,
4825 * there's no need to read it.
4827 ret
= ocfs2_init_xattr_bucket(t_bucket
, t_blkno
, t_is_new
);
4832 * Hey, if we're overwriting t_bucket, what difference does
4833 * ACCESS_CREATE vs ACCESS_WRITE make? Well, if we allocated a new
4834 * cluster to fill, we came here from
4835 * ocfs2_mv_xattr_buckets(), and it is really new -
4836 * ACCESS_CREATE is required. But we also might have moved data
4837 * out of t_bucket before extending back into it.
4838 * ocfs2_add_new_xattr_bucket() can do this - its call to
4839 * ocfs2_add_new_xattr_cluster() may have created a new extent
4840 * and copied out the end of the old extent. Then it re-extends
4841 * the old extent back to create space for new xattrs. That's
4842 * how we get here, and the bucket isn't really new.
4844 ret
= ocfs2_xattr_bucket_journal_access(handle
, t_bucket
,
4846 OCFS2_JOURNAL_ACCESS_CREATE
:
4847 OCFS2_JOURNAL_ACCESS_WRITE
);
4851 ocfs2_xattr_bucket_copy_data(t_bucket
, s_bucket
);
4852 ocfs2_xattr_bucket_journal_dirty(handle
, t_bucket
);
4855 ocfs2_xattr_bucket_free(t_bucket
);
4856 ocfs2_xattr_bucket_free(s_bucket
);
4862 * src_blk points to the start of an existing extent. last_blk points to
4863 * last cluster in that extent. to_blk points to a newly allocated
4864 * extent. We copy the buckets from the cluster at last_blk to the new
4865 * extent. If start_bucket is non-zero, we skip that many buckets before
4866 * we start copying. The new extent's xh_num_buckets gets set to the
4867 * number of buckets we copied. The old extent's xh_num_buckets shrinks
4868 * by the same amount.
4870 static int ocfs2_mv_xattr_buckets(struct inode
*inode
, handle_t
*handle
,
4871 u64 src_blk
, u64 last_blk
, u64 to_blk
,
4872 unsigned int start_bucket
,
4875 int i
, ret
, credits
;
4876 struct ocfs2_super
*osb
= OCFS2_SB(inode
->i_sb
);
4877 int blks_per_bucket
= ocfs2_blocks_per_xattr_bucket(inode
->i_sb
);
4878 int num_buckets
= ocfs2_xattr_buckets_per_cluster(osb
);
4879 struct ocfs2_xattr_bucket
*old_first
, *new_first
;
4881 trace_ocfs2_mv_xattr_buckets((unsigned long long)last_blk
,
4882 (unsigned long long)to_blk
);
4884 BUG_ON(start_bucket
>= num_buckets
);
4886 num_buckets
-= start_bucket
;
4887 last_blk
+= (start_bucket
* blks_per_bucket
);
4890 /* The first bucket of the original extent */
4891 old_first
= ocfs2_xattr_bucket_new(inode
);
4892 /* The first bucket of the new extent */
4893 new_first
= ocfs2_xattr_bucket_new(inode
);
4894 if (!old_first
|| !new_first
) {
4900 ret
= ocfs2_read_xattr_bucket(old_first
, src_blk
);
4907 * We need to update the first bucket of the old extent and all
4908 * the buckets going to the new extent.
4910 credits
= ((num_buckets
+ 1) * blks_per_bucket
);
4911 ret
= ocfs2_extend_trans(handle
, credits
);
4917 ret
= ocfs2_xattr_bucket_journal_access(handle
, old_first
,
4918 OCFS2_JOURNAL_ACCESS_WRITE
);
4924 for (i
= 0; i
< num_buckets
; i
++) {
4925 ret
= ocfs2_cp_xattr_bucket(inode
, handle
,
4926 last_blk
+ (i
* blks_per_bucket
),
4927 to_blk
+ (i
* blks_per_bucket
),
4936 * Get the new bucket ready before we dirty anything
4937 * (This actually shouldn't fail, because we already dirtied
4938 * it once in ocfs2_cp_xattr_bucket()).
4940 ret
= ocfs2_read_xattr_bucket(new_first
, to_blk
);
4945 ret
= ocfs2_xattr_bucket_journal_access(handle
, new_first
,
4946 OCFS2_JOURNAL_ACCESS_WRITE
);
4952 /* Now update the headers */
4953 le16_add_cpu(&bucket_xh(old_first
)->xh_num_buckets
, -num_buckets
);
4954 ocfs2_xattr_bucket_journal_dirty(handle
, old_first
);
4956 bucket_xh(new_first
)->xh_num_buckets
= cpu_to_le16(num_buckets
);
4957 ocfs2_xattr_bucket_journal_dirty(handle
, new_first
);
4960 *first_hash
= le32_to_cpu(bucket_xh(new_first
)->xh_entries
[0].xe_name_hash
);
4963 ocfs2_xattr_bucket_free(new_first
);
4964 ocfs2_xattr_bucket_free(old_first
);
4969 * Move some xattrs in this cluster to the new cluster.
4970 * This function should only be called when bucket size == cluster size.
4971 * Otherwise ocfs2_mv_xattr_bucket_cross_cluster should be used instead.
4973 static int ocfs2_divide_xattr_cluster(struct inode
*inode
,
4979 u16 blk_per_bucket
= ocfs2_blocks_per_xattr_bucket(inode
->i_sb
);
4980 int ret
, credits
= 2 * blk_per_bucket
;
4982 BUG_ON(OCFS2_XATTR_BUCKET_SIZE
< OCFS2_SB(inode
->i_sb
)->s_clustersize
);
4984 ret
= ocfs2_extend_trans(handle
, credits
);
4990 /* Move half of the xattr in start_blk to the next bucket. */
4991 return ocfs2_divide_xattr_bucket(inode
, handle
, prev_blk
,
4992 new_blk
, first_hash
, 1);
4996 * Move some xattrs from the old cluster to the new one since they are not
4997 * contiguous in ocfs2 xattr tree.
4999 * new_blk starts a new separate cluster, and we will move some xattrs from
5000 * prev_blk to it. v_start will be set as the first name hash value in this
5001 * new cluster so that it can be used as e_cpos during tree insertion and
5002 * don't collide with our original b-tree operations. first_bh and header_bh
5003 * will also be updated since they will be used in ocfs2_extend_xattr_bucket
5004 * to extend the insert bucket.
5006 * The problem is how much xattr should we move to the new one and when should
5007 * we update first_bh and header_bh?
5008 * 1. If cluster size > bucket size, that means the previous cluster has more
5009 * than 1 bucket, so just move half nums of bucket into the new cluster and
5010 * update the first_bh and header_bh if the insert bucket has been moved
5011 * to the new cluster.
5012 * 2. If cluster_size == bucket_size:
5013 * a) If the previous extent rec has more than one cluster and the insert
5014 * place isn't in the last cluster, copy the entire last cluster to the
5015 * new one. This time, we don't need to upate the first_bh and header_bh
5016 * since they will not be moved into the new cluster.
5017 * b) Otherwise, move the bottom half of the xattrs in the last cluster into
5018 * the new one. And we set the extend flag to zero if the insert place is
5019 * moved into the new allocated cluster since no extend is needed.
5021 static int ocfs2_adjust_xattr_cross_cluster(struct inode
*inode
,
5023 struct ocfs2_xattr_bucket
*first
,
5024 struct ocfs2_xattr_bucket
*target
,
5032 trace_ocfs2_adjust_xattr_cross_cluster(
5033 (unsigned long long)bucket_blkno(first
),
5034 (unsigned long long)new_blk
, prev_clusters
);
5036 if (ocfs2_xattr_buckets_per_cluster(OCFS2_SB(inode
->i_sb
)) > 1) {
5037 ret
= ocfs2_mv_xattr_bucket_cross_cluster(inode
,
5046 /* The start of the last cluster in the first extent */
5047 u64 last_blk
= bucket_blkno(first
) +
5048 ((prev_clusters
- 1) *
5049 ocfs2_clusters_to_blocks(inode
->i_sb
, 1));
5051 if (prev_clusters
> 1 && bucket_blkno(target
) != last_blk
) {
5052 ret
= ocfs2_mv_xattr_buckets(inode
, handle
,
5053 bucket_blkno(first
),
5054 last_blk
, new_blk
, 0,
5059 ret
= ocfs2_divide_xattr_cluster(inode
, handle
,
5065 if ((bucket_blkno(target
) == last_blk
) && extend
)
5074 * Add a new cluster for xattr storage.
5076 * If the new cluster is contiguous with the previous one, it will be
5077 * appended to the same extent record, and num_clusters will be updated.
5078 * If not, we will insert a new extent for it and move some xattrs in
5079 * the last cluster into the new allocated one.
5080 * We also need to limit the maximum size of a btree leaf, otherwise we'll
5081 * lose the benefits of hashing because we'll have to search large leaves.
5082 * So now the maximum size is OCFS2_MAX_XATTR_TREE_LEAF_SIZE(or clustersize,
5085 * first_bh is the first block of the previous extent rec and header_bh
5086 * indicates the bucket we will insert the new xattrs. They will be updated
5087 * when the header_bh is moved into the new cluster.
5089 static int ocfs2_add_new_xattr_cluster(struct inode
*inode
,
5090 struct buffer_head
*root_bh
,
5091 struct ocfs2_xattr_bucket
*first
,
5092 struct ocfs2_xattr_bucket
*target
,
5096 struct ocfs2_xattr_set_ctxt
*ctxt
)
5099 u16 bpc
= ocfs2_clusters_to_blocks(inode
->i_sb
, 1);
5100 u32 prev_clusters
= *num_clusters
;
5101 u32 clusters_to_add
= 1, bit_off
, num_bits
, v_start
= 0;
5103 handle_t
*handle
= ctxt
->handle
;
5104 struct ocfs2_super
*osb
= OCFS2_SB(inode
->i_sb
);
5105 struct ocfs2_extent_tree et
;
5107 trace_ocfs2_add_new_xattr_cluster_begin(
5108 (unsigned long long)OCFS2_I(inode
)->ip_blkno
,
5109 (unsigned long long)bucket_blkno(first
),
5110 prev_cpos
, prev_clusters
);
5112 ocfs2_init_xattr_tree_extent_tree(&et
, INODE_CACHE(inode
), root_bh
);
5114 ret
= ocfs2_journal_access_xb(handle
, INODE_CACHE(inode
), root_bh
,
5115 OCFS2_JOURNAL_ACCESS_WRITE
);
5121 ret
= __ocfs2_claim_clusters(handle
, ctxt
->data_ac
, 1,
5122 clusters_to_add
, &bit_off
, &num_bits
);
5129 BUG_ON(num_bits
> clusters_to_add
);
5131 block
= ocfs2_clusters_to_blocks(osb
->sb
, bit_off
);
5132 trace_ocfs2_add_new_xattr_cluster((unsigned long long)block
, num_bits
);
5134 if (bucket_blkno(first
) + (prev_clusters
* bpc
) == block
&&
5135 (prev_clusters
+ num_bits
) << osb
->s_clustersize_bits
<=
5136 OCFS2_MAX_XATTR_TREE_LEAF_SIZE
) {
5138 * If this cluster is contiguous with the old one and
5139 * adding this new cluster, we don't surpass the limit of
5140 * OCFS2_MAX_XATTR_TREE_LEAF_SIZE, cool. We will let it be
5141 * initialized and used like other buckets in the previous
5143 * So add it as a contiguous one. The caller will handle
5146 v_start
= prev_cpos
+ prev_clusters
;
5147 *num_clusters
= prev_clusters
+ num_bits
;
5149 ret
= ocfs2_adjust_xattr_cross_cluster(inode
,
5163 trace_ocfs2_add_new_xattr_cluster_insert((unsigned long long)block
,
5165 ret
= ocfs2_insert_extent(handle
, &et
, v_start
, block
,
5166 num_bits
, 0, ctxt
->meta_ac
);
5172 ocfs2_journal_dirty(handle
, root_bh
);
5179 * We are given an extent. 'first' is the bucket at the very front of
5180 * the extent. The extent has space for an additional bucket past
5181 * bucket_xh(first)->xh_num_buckets. 'target_blkno' is the block number
5182 * of the target bucket. We wish to shift every bucket past the target
5183 * down one, filling in that additional space. When we get back to the
5184 * target, we split the target between itself and the now-empty bucket
5185 * at target+1 (aka, target_blkno + blks_per_bucket).
5187 static int ocfs2_extend_xattr_bucket(struct inode
*inode
,
5189 struct ocfs2_xattr_bucket
*first
,
5194 struct ocfs2_super
*osb
= OCFS2_SB(inode
->i_sb
);
5195 u16 blk_per_bucket
= ocfs2_blocks_per_xattr_bucket(inode
->i_sb
);
5197 u16 new_bucket
= le16_to_cpu(bucket_xh(first
)->xh_num_buckets
);
5199 trace_ocfs2_extend_xattr_bucket((unsigned long long)target_blk
,
5200 (unsigned long long)bucket_blkno(first
),
5201 num_clusters
, new_bucket
);
5203 /* The extent must have room for an additional bucket */
5204 BUG_ON(new_bucket
>=
5205 (num_clusters
* ocfs2_xattr_buckets_per_cluster(osb
)));
5207 /* end_blk points to the last existing bucket */
5208 end_blk
= bucket_blkno(first
) + ((new_bucket
- 1) * blk_per_bucket
);
5211 * end_blk is the start of the last existing bucket.
5212 * Thus, (end_blk - target_blk) covers the target bucket and
5213 * every bucket after it up to, but not including, the last
5214 * existing bucket. Then we add the last existing bucket, the
5215 * new bucket, and the first bucket (3 * blk_per_bucket).
5217 credits
= (end_blk
- target_blk
) + (3 * blk_per_bucket
);
5218 ret
= ocfs2_extend_trans(handle
, credits
);
5224 ret
= ocfs2_xattr_bucket_journal_access(handle
, first
,
5225 OCFS2_JOURNAL_ACCESS_WRITE
);
5231 while (end_blk
!= target_blk
) {
5232 ret
= ocfs2_cp_xattr_bucket(inode
, handle
, end_blk
,
5233 end_blk
+ blk_per_bucket
, 0);
5236 end_blk
-= blk_per_bucket
;
5239 /* Move half of the xattr in target_blkno to the next bucket. */
5240 ret
= ocfs2_divide_xattr_bucket(inode
, handle
, target_blk
,
5241 target_blk
+ blk_per_bucket
, NULL
, 0);
5243 le16_add_cpu(&bucket_xh(first
)->xh_num_buckets
, 1);
5244 ocfs2_xattr_bucket_journal_dirty(handle
, first
);
5251 * Add new xattr bucket in an extent record and adjust the buckets
5252 * accordingly. xb_bh is the ocfs2_xattr_block, and target is the
5253 * bucket we want to insert into.
5255 * In the easy case, we will move all the buckets after target down by
5256 * one. Half of target's xattrs will be moved to the next bucket.
5258 * If current cluster is full, we'll allocate a new one. This may not
5259 * be contiguous. The underlying calls will make sure that there is
5260 * space for the insert, shifting buckets around if necessary.
5261 * 'target' may be moved by those calls.
5263 static int ocfs2_add_new_xattr_bucket(struct inode
*inode
,
5264 struct buffer_head
*xb_bh
,
5265 struct ocfs2_xattr_bucket
*target
,
5266 struct ocfs2_xattr_set_ctxt
*ctxt
)
5268 struct ocfs2_xattr_block
*xb
=
5269 (struct ocfs2_xattr_block
*)xb_bh
->b_data
;
5270 struct ocfs2_xattr_tree_root
*xb_root
= &xb
->xb_attrs
.xb_root
;
5271 struct ocfs2_extent_list
*el
= &xb_root
->xt_list
;
5273 le32_to_cpu(bucket_xh(target
)->xh_entries
[0].xe_name_hash
);
5274 struct ocfs2_super
*osb
= OCFS2_SB(inode
->i_sb
);
5275 int ret
, num_buckets
, extend
= 1;
5277 u32 e_cpos
, num_clusters
;
5278 /* The bucket at the front of the extent */
5279 struct ocfs2_xattr_bucket
*first
;
5281 trace_ocfs2_add_new_xattr_bucket(
5282 (unsigned long long)bucket_blkno(target
));
5284 /* The first bucket of the original extent */
5285 first
= ocfs2_xattr_bucket_new(inode
);
5292 ret
= ocfs2_xattr_get_rec(inode
, name_hash
, &p_blkno
, &e_cpos
,
5299 ret
= ocfs2_read_xattr_bucket(first
, p_blkno
);
5305 num_buckets
= ocfs2_xattr_buckets_per_cluster(osb
) * num_clusters
;
5306 if (num_buckets
== le16_to_cpu(bucket_xh(first
)->xh_num_buckets
)) {
5308 * This can move first+target if the target bucket moves
5309 * to the new extent.
5311 ret
= ocfs2_add_new_xattr_cluster(inode
,
5326 ret
= ocfs2_extend_xattr_bucket(inode
,
5329 bucket_blkno(target
),
5336 ocfs2_xattr_bucket_free(first
);
5342 * Truncate the specified xe_off entry in xattr bucket.
5343 * bucket is indicated by header_bh and len is the new length.
5344 * Both the ocfs2_xattr_value_root and the entry will be updated here.
5346 * Copy the new updated xe and xe_value_root to new_xe and new_xv if needed.
5348 static int ocfs2_xattr_bucket_value_truncate(struct inode
*inode
,
5349 struct ocfs2_xattr_bucket
*bucket
,
5352 struct ocfs2_xattr_set_ctxt
*ctxt
)
5356 struct ocfs2_xattr_entry
*xe
;
5357 struct ocfs2_xattr_header
*xh
= bucket_xh(bucket
);
5358 size_t blocksize
= inode
->i_sb
->s_blocksize
;
5359 struct ocfs2_xattr_value_buf vb
= {
5360 .vb_access
= ocfs2_journal_access
,
5363 xe
= &xh
->xh_entries
[xe_off
];
5365 BUG_ON(!xe
|| ocfs2_xattr_is_local(xe
));
5367 offset
= le16_to_cpu(xe
->xe_name_offset
) +
5368 OCFS2_XATTR_SIZE(xe
->xe_name_len
);
5370 value_blk
= offset
/ blocksize
;
5372 /* We don't allow ocfs2_xattr_value to be stored in different block. */
5373 BUG_ON(value_blk
!= (offset
+ OCFS2_XATTR_ROOT_SIZE
- 1) / blocksize
);
5375 vb
.vb_bh
= bucket
->bu_bhs
[value_blk
];
5378 vb
.vb_xv
= (struct ocfs2_xattr_value_root
*)
5379 (vb
.vb_bh
->b_data
+ offset
% blocksize
);
5382 * From here on out we have to dirty the bucket. The generic
5383 * value calls only modify one of the bucket's bhs, but we need
5384 * to send the bucket at once. So if they error, they *could* have
5385 * modified something. We have to assume they did, and dirty
5386 * the whole bucket. This leaves us in a consistent state.
5388 trace_ocfs2_xattr_bucket_value_truncate(
5389 (unsigned long long)bucket_blkno(bucket
), xe_off
, len
);
5390 ret
= ocfs2_xattr_value_truncate(inode
, &vb
, len
, ctxt
);
5396 ret
= ocfs2_xattr_bucket_journal_access(ctxt
->handle
, bucket
,
5397 OCFS2_JOURNAL_ACCESS_WRITE
);
5403 xe
->xe_value_size
= cpu_to_le64(len
);
5405 ocfs2_xattr_bucket_journal_dirty(ctxt
->handle
, bucket
);
5411 static int ocfs2_rm_xattr_cluster(struct inode
*inode
,
5412 struct buffer_head
*root_bh
,
5419 struct ocfs2_super
*osb
= OCFS2_SB(inode
->i_sb
);
5420 struct inode
*tl_inode
= osb
->osb_tl_inode
;
5422 struct ocfs2_xattr_block
*xb
=
5423 (struct ocfs2_xattr_block
*)root_bh
->b_data
;
5424 struct ocfs2_alloc_context
*meta_ac
= NULL
;
5425 struct ocfs2_cached_dealloc_ctxt dealloc
;
5426 struct ocfs2_extent_tree et
;
5428 ret
= ocfs2_iterate_xattr_buckets(inode
, blkno
, len
,
5429 ocfs2_delete_xattr_in_bucket
, para
);
5435 ocfs2_init_xattr_tree_extent_tree(&et
, INODE_CACHE(inode
), root_bh
);
5437 ocfs2_init_dealloc_ctxt(&dealloc
);
5439 trace_ocfs2_rm_xattr_cluster(
5440 (unsigned long long)OCFS2_I(inode
)->ip_blkno
,
5441 (unsigned long long)blkno
, cpos
, len
);
5443 ocfs2_remove_xattr_clusters_from_cache(INODE_CACHE(inode
), blkno
,
5446 ret
= ocfs2_lock_allocators(inode
, &et
, 0, 1, NULL
, &meta_ac
);
5452 mutex_lock(&tl_inode
->i_mutex
);
5454 if (ocfs2_truncate_log_needs_flush(osb
)) {
5455 ret
= __ocfs2_flush_truncate_log(osb
);
5462 handle
= ocfs2_start_trans(osb
, ocfs2_remove_extent_credits(osb
->sb
));
5463 if (IS_ERR(handle
)) {
5469 ret
= ocfs2_journal_access_xb(handle
, INODE_CACHE(inode
), root_bh
,
5470 OCFS2_JOURNAL_ACCESS_WRITE
);
5476 ret
= ocfs2_remove_extent(handle
, &et
, cpos
, len
, meta_ac
,
5483 le32_add_cpu(&xb
->xb_attrs
.xb_root
.xt_clusters
, -len
);
5484 ocfs2_journal_dirty(handle
, root_bh
);
5486 ret
= ocfs2_truncate_log_append(osb
, handle
, blkno
, len
);
5489 ocfs2_update_inode_fsync_trans(handle
, inode
, 0);
5492 ocfs2_commit_trans(osb
, handle
);
5494 ocfs2_schedule_truncate_log_flush(osb
, 1);
5496 mutex_unlock(&tl_inode
->i_mutex
);
5499 ocfs2_free_alloc_context(meta_ac
);
5501 ocfs2_run_deallocs(osb
, &dealloc
);
5507 * check whether the xattr bucket is filled up with the same hash value.
5508 * If we want to insert the xattr with the same hash, return -ENOSPC.
5509 * If we want to insert a xattr with different hash value, go ahead
5510 * and ocfs2_divide_xattr_bucket will handle this.
5512 static int ocfs2_check_xattr_bucket_collision(struct inode
*inode
,
5513 struct ocfs2_xattr_bucket
*bucket
,
5516 struct ocfs2_xattr_header
*xh
= bucket_xh(bucket
);
5517 u32 name_hash
= ocfs2_xattr_name_hash(inode
, name
, strlen(name
));
5519 if (name_hash
!= le32_to_cpu(xh
->xh_entries
[0].xe_name_hash
))
5522 if (xh
->xh_entries
[le16_to_cpu(xh
->xh_count
) - 1].xe_name_hash
==
5523 xh
->xh_entries
[0].xe_name_hash
) {
5524 mlog(ML_ERROR
, "Too much hash collision in xattr bucket %llu, "
5526 (unsigned long long)bucket_blkno(bucket
),
5527 le32_to_cpu(xh
->xh_entries
[0].xe_name_hash
));
5535 * Try to set the entry in the current bucket. If we fail, the caller
5536 * will handle getting us another bucket.
5538 static int ocfs2_xattr_set_entry_bucket(struct inode
*inode
,
5539 struct ocfs2_xattr_info
*xi
,
5540 struct ocfs2_xattr_search
*xs
,
5541 struct ocfs2_xattr_set_ctxt
*ctxt
)
5544 struct ocfs2_xa_loc loc
;
5546 trace_ocfs2_xattr_set_entry_bucket(xi
->xi_name
);
5548 ocfs2_init_xattr_bucket_xa_loc(&loc
, xs
->bucket
,
5549 xs
->not_found
? NULL
: xs
->here
);
5550 ret
= ocfs2_xa_set(&loc
, xi
, ctxt
);
5552 xs
->here
= loc
.xl_entry
;
5555 if (ret
!= -ENOSPC
) {
5560 /* Ok, we need space. Let's try defragmenting the bucket. */
5561 ret
= ocfs2_defrag_xattr_bucket(inode
, ctxt
->handle
,
5568 ret
= ocfs2_xa_set(&loc
, xi
, ctxt
);
5570 xs
->here
= loc
.xl_entry
;
5581 static int ocfs2_xattr_set_entry_index_block(struct inode
*inode
,
5582 struct ocfs2_xattr_info
*xi
,
5583 struct ocfs2_xattr_search
*xs
,
5584 struct ocfs2_xattr_set_ctxt
*ctxt
)
5588 trace_ocfs2_xattr_set_entry_index_block(xi
->xi_name
);
5590 ret
= ocfs2_xattr_set_entry_bucket(inode
, xi
, xs
, ctxt
);
5593 if (ret
!= -ENOSPC
) {
5598 /* Ack, need more space. Let's try to get another bucket! */
5601 * We do not allow for overlapping ranges between buckets. And
5602 * the maximum number of collisions we will allow for then is
5603 * one bucket's worth, so check it here whether we need to
5604 * add a new bucket for the insert.
5606 ret
= ocfs2_check_xattr_bucket_collision(inode
,
5614 ret
= ocfs2_add_new_xattr_bucket(inode
,
5624 * ocfs2_add_new_xattr_bucket() will have updated
5625 * xs->bucket if it moved, but it will not have updated
5626 * any of the other search fields. Thus, we drop it and
5627 * re-search. Everything should be cached, so it'll be
5630 ocfs2_xattr_bucket_relse(xs
->bucket
);
5631 ret
= ocfs2_xattr_index_block_find(inode
, xs
->xattr_bh
,
5634 if (ret
&& ret
!= -ENODATA
)
5636 xs
->not_found
= ret
;
5638 /* Ok, we have a new bucket, let's try again */
5639 ret
= ocfs2_xattr_set_entry_bucket(inode
, xi
, xs
, ctxt
);
5640 if (ret
&& (ret
!= -ENOSPC
))
5647 static int ocfs2_delete_xattr_in_bucket(struct inode
*inode
,
5648 struct ocfs2_xattr_bucket
*bucket
,
5651 int ret
= 0, ref_credits
;
5652 struct ocfs2_xattr_header
*xh
= bucket_xh(bucket
);
5654 struct ocfs2_xattr_entry
*xe
;
5655 struct ocfs2_super
*osb
= OCFS2_SB(inode
->i_sb
);
5656 struct ocfs2_xattr_set_ctxt ctxt
= {NULL
, NULL
,};
5657 int credits
= ocfs2_remove_extent_credits(osb
->sb
) +
5658 ocfs2_blocks_per_xattr_bucket(inode
->i_sb
);
5659 struct ocfs2_xattr_value_root
*xv
;
5660 struct ocfs2_rm_xattr_bucket_para
*args
=
5661 (struct ocfs2_rm_xattr_bucket_para
*)para
;
5663 ocfs2_init_dealloc_ctxt(&ctxt
.dealloc
);
5665 for (i
= 0; i
< le16_to_cpu(xh
->xh_count
); i
++) {
5666 xe
= &xh
->xh_entries
[i
];
5667 if (ocfs2_xattr_is_local(xe
))
5670 ret
= ocfs2_get_xattr_tree_value_root(inode
->i_sb
, bucket
,
5677 ret
= ocfs2_lock_xattr_remove_allocators(inode
, xv
,
5683 ctxt
.handle
= ocfs2_start_trans(osb
, credits
+ ref_credits
);
5684 if (IS_ERR(ctxt
.handle
)) {
5685 ret
= PTR_ERR(ctxt
.handle
);
5690 ret
= ocfs2_xattr_bucket_value_truncate(inode
, bucket
,
5693 ocfs2_commit_trans(osb
, ctxt
.handle
);
5695 ocfs2_free_alloc_context(ctxt
.meta_ac
);
5696 ctxt
.meta_ac
= NULL
;
5705 ocfs2_free_alloc_context(ctxt
.meta_ac
);
5706 ocfs2_schedule_truncate_log_flush(osb
, 1);
5707 ocfs2_run_deallocs(osb
, &ctxt
.dealloc
);
5712 * Whenever we modify a xattr value root in the bucket(e.g, CoW
5713 * or change the extent record flag), we need to recalculate
5714 * the metaecc for the whole bucket. So it is done here.
5717 * We have to give the extra credits for the caller.
5719 static int ocfs2_xattr_bucket_post_refcount(struct inode
*inode
,
5724 struct ocfs2_xattr_bucket
*bucket
=
5725 (struct ocfs2_xattr_bucket
*)para
;
5727 ret
= ocfs2_xattr_bucket_journal_access(handle
, bucket
,
5728 OCFS2_JOURNAL_ACCESS_WRITE
);
5734 ocfs2_xattr_bucket_journal_dirty(handle
, bucket
);
5740 * Special action we need if the xattr value is refcounted.
5742 * 1. If the xattr is refcounted, lock the tree.
5743 * 2. CoW the xattr if we are setting the new value and the value
5744 * will be stored outside.
5745 * 3. In other case, decrease_refcount will work for us, so just
5746 * lock the refcount tree, calculate the meta and credits is OK.
5748 * We have to do CoW before ocfs2_init_xattr_set_ctxt since
5749 * currently CoW is a completed transaction, while this function
5750 * will also lock the allocators and let us deadlock. So we will
5751 * CoW the whole xattr value.
5753 static int ocfs2_prepare_refcount_xattr(struct inode
*inode
,
5754 struct ocfs2_dinode
*di
,
5755 struct ocfs2_xattr_info
*xi
,
5756 struct ocfs2_xattr_search
*xis
,
5757 struct ocfs2_xattr_search
*xbs
,
5758 struct ocfs2_refcount_tree
**ref_tree
,
5763 struct ocfs2_xattr_block
*xb
;
5764 struct ocfs2_xattr_entry
*xe
;
5766 u32 p_cluster
, num_clusters
;
5767 unsigned int ext_flags
;
5768 int name_offset
, name_len
;
5769 struct ocfs2_xattr_value_buf vb
;
5770 struct ocfs2_xattr_bucket
*bucket
= NULL
;
5771 struct ocfs2_super
*osb
= OCFS2_SB(inode
->i_sb
);
5772 struct ocfs2_post_refcount refcount
;
5773 struct ocfs2_post_refcount
*p
= NULL
;
5774 struct buffer_head
*ref_root_bh
= NULL
;
5776 if (!xis
->not_found
) {
5778 name_offset
= le16_to_cpu(xe
->xe_name_offset
);
5779 name_len
= OCFS2_XATTR_SIZE(xe
->xe_name_len
);
5781 vb
.vb_bh
= xis
->inode_bh
;
5782 vb
.vb_access
= ocfs2_journal_access_di
;
5784 int i
, block_off
= 0;
5785 xb
= (struct ocfs2_xattr_block
*)xbs
->xattr_bh
->b_data
;
5787 name_offset
= le16_to_cpu(xe
->xe_name_offset
);
5788 name_len
= OCFS2_XATTR_SIZE(xe
->xe_name_len
);
5789 i
= xbs
->here
- xbs
->header
->xh_entries
;
5791 if (le16_to_cpu(xb
->xb_flags
) & OCFS2_XATTR_INDEXED
) {
5792 ret
= ocfs2_xattr_bucket_get_name_value(inode
->i_sb
,
5793 bucket_xh(xbs
->bucket
),
5800 base
= bucket_block(xbs
->bucket
, block_off
);
5801 vb
.vb_bh
= xbs
->bucket
->bu_bhs
[block_off
];
5802 vb
.vb_access
= ocfs2_journal_access
;
5804 if (ocfs2_meta_ecc(osb
)) {
5805 /*create parameters for ocfs2_post_refcount. */
5806 bucket
= xbs
->bucket
;
5807 refcount
.credits
= bucket
->bu_blocks
;
5808 refcount
.para
= bucket
;
5810 ocfs2_xattr_bucket_post_refcount
;
5815 vb
.vb_bh
= xbs
->xattr_bh
;
5816 vb
.vb_access
= ocfs2_journal_access_xb
;
5820 if (ocfs2_xattr_is_local(xe
))
5823 vb
.vb_xv
= (struct ocfs2_xattr_value_root
*)
5824 (base
+ name_offset
+ name_len
);
5826 ret
= ocfs2_xattr_get_clusters(inode
, 0, &p_cluster
,
5827 &num_clusters
, &vb
.vb_xv
->xr_list
,
5835 * We just need to check the 1st extent record, since we always
5836 * CoW the whole xattr. So there shouldn't be a xattr with
5837 * some REFCOUNT extent recs after the 1st one.
5839 if (!(ext_flags
& OCFS2_EXT_REFCOUNTED
))
5842 ret
= ocfs2_lock_refcount_tree(osb
, le64_to_cpu(di
->i_refcount_loc
),
5843 1, ref_tree
, &ref_root_bh
);
5850 * If we are deleting the xattr or the new size will be stored inside,
5851 * cool, leave it there, the xattr truncate process will remove them
5852 * for us(it still needs the refcount tree lock and the meta, credits).
5853 * And the worse case is that every cluster truncate will split the
5854 * refcount tree, and make the original extent become 3. So we will need
5855 * 2 * cluster more extent recs at most.
5857 if (!xi
->xi_value
|| xi
->xi_value_len
<= OCFS2_XATTR_INLINE_SIZE
) {
5859 ret
= ocfs2_refcounted_xattr_delete_need(inode
,
5860 &(*ref_tree
)->rf_ci
,
5861 ref_root_bh
, vb
.vb_xv
,
5868 ret
= ocfs2_refcount_cow_xattr(inode
, di
, &vb
,
5869 *ref_tree
, ref_root_bh
, 0,
5870 le32_to_cpu(vb
.vb_xv
->xr_clusters
), p
);
5875 brelse(ref_root_bh
);
5880 * Add the REFCOUNTED flags for all the extent rec in ocfs2_xattr_value_root.
5881 * The physical clusters will be added to refcount tree.
5883 static int ocfs2_xattr_value_attach_refcount(struct inode
*inode
,
5884 struct ocfs2_xattr_value_root
*xv
,
5885 struct ocfs2_extent_tree
*value_et
,
5886 struct ocfs2_caching_info
*ref_ci
,
5887 struct buffer_head
*ref_root_bh
,
5888 struct ocfs2_cached_dealloc_ctxt
*dealloc
,
5889 struct ocfs2_post_refcount
*refcount
)
5892 u32 clusters
= le32_to_cpu(xv
->xr_clusters
);
5893 u32 cpos
, p_cluster
, num_clusters
;
5894 struct ocfs2_extent_list
*el
= &xv
->xr_list
;
5895 unsigned int ext_flags
;
5898 while (cpos
< clusters
) {
5899 ret
= ocfs2_xattr_get_clusters(inode
, cpos
, &p_cluster
,
5900 &num_clusters
, el
, &ext_flags
);
5906 cpos
+= num_clusters
;
5907 if ((ext_flags
& OCFS2_EXT_REFCOUNTED
))
5912 ret
= ocfs2_add_refcount_flag(inode
, value_et
,
5913 ref_ci
, ref_root_bh
,
5914 cpos
- num_clusters
,
5915 p_cluster
, num_clusters
,
5927 * Given a normal ocfs2_xattr_header, refcount all the entries which
5928 * have value stored outside.
5929 * Used for xattrs stored in inode and ocfs2_xattr_block.
5931 static int ocfs2_xattr_attach_refcount_normal(struct inode
*inode
,
5932 struct ocfs2_xattr_value_buf
*vb
,
5933 struct ocfs2_xattr_header
*header
,
5934 struct ocfs2_caching_info
*ref_ci
,
5935 struct buffer_head
*ref_root_bh
,
5936 struct ocfs2_cached_dealloc_ctxt
*dealloc
)
5939 struct ocfs2_xattr_entry
*xe
;
5940 struct ocfs2_xattr_value_root
*xv
;
5941 struct ocfs2_extent_tree et
;
5944 for (i
= 0; i
< le16_to_cpu(header
->xh_count
); i
++) {
5945 xe
= &header
->xh_entries
[i
];
5947 if (ocfs2_xattr_is_local(xe
))
5950 xv
= (struct ocfs2_xattr_value_root
*)((void *)header
+
5951 le16_to_cpu(xe
->xe_name_offset
) +
5952 OCFS2_XATTR_SIZE(xe
->xe_name_len
));
5955 ocfs2_init_xattr_value_extent_tree(&et
, INODE_CACHE(inode
), vb
);
5957 ret
= ocfs2_xattr_value_attach_refcount(inode
, xv
, &et
,
5958 ref_ci
, ref_root_bh
,
5969 static int ocfs2_xattr_inline_attach_refcount(struct inode
*inode
,
5970 struct buffer_head
*fe_bh
,
5971 struct ocfs2_caching_info
*ref_ci
,
5972 struct buffer_head
*ref_root_bh
,
5973 struct ocfs2_cached_dealloc_ctxt
*dealloc
)
5975 struct ocfs2_dinode
*di
= (struct ocfs2_dinode
*)fe_bh
->b_data
;
5976 struct ocfs2_xattr_header
*header
= (struct ocfs2_xattr_header
*)
5977 (fe_bh
->b_data
+ inode
->i_sb
->s_blocksize
-
5978 le16_to_cpu(di
->i_xattr_inline_size
));
5979 struct ocfs2_xattr_value_buf vb
= {
5981 .vb_access
= ocfs2_journal_access_di
,
5984 return ocfs2_xattr_attach_refcount_normal(inode
, &vb
, header
,
5985 ref_ci
, ref_root_bh
, dealloc
);
5988 struct ocfs2_xattr_tree_value_refcount_para
{
5989 struct ocfs2_caching_info
*ref_ci
;
5990 struct buffer_head
*ref_root_bh
;
5991 struct ocfs2_cached_dealloc_ctxt
*dealloc
;
5994 static int ocfs2_get_xattr_tree_value_root(struct super_block
*sb
,
5995 struct ocfs2_xattr_bucket
*bucket
,
5997 struct ocfs2_xattr_value_root
**xv
,
5998 struct buffer_head
**bh
)
6000 int ret
, block_off
, name_offset
;
6001 struct ocfs2_xattr_header
*xh
= bucket_xh(bucket
);
6002 struct ocfs2_xattr_entry
*xe
= &xh
->xh_entries
[offset
];
6005 ret
= ocfs2_xattr_bucket_get_name_value(sb
,
6015 base
= bucket_block(bucket
, block_off
);
6017 *xv
= (struct ocfs2_xattr_value_root
*)(base
+ name_offset
+
6018 OCFS2_XATTR_SIZE(xe
->xe_name_len
));
6021 *bh
= bucket
->bu_bhs
[block_off
];
6027 * For a given xattr bucket, refcount all the entries which
6028 * have value stored outside.
6030 static int ocfs2_xattr_bucket_value_refcount(struct inode
*inode
,
6031 struct ocfs2_xattr_bucket
*bucket
,
6035 struct ocfs2_extent_tree et
;
6036 struct ocfs2_xattr_tree_value_refcount_para
*ref
=
6037 (struct ocfs2_xattr_tree_value_refcount_para
*)para
;
6038 struct ocfs2_xattr_header
*xh
=
6039 (struct ocfs2_xattr_header
*)bucket
->bu_bhs
[0]->b_data
;
6040 struct ocfs2_xattr_entry
*xe
;
6041 struct ocfs2_xattr_value_buf vb
= {
6042 .vb_access
= ocfs2_journal_access
,
6044 struct ocfs2_post_refcount refcount
= {
6045 .credits
= bucket
->bu_blocks
,
6047 .func
= ocfs2_xattr_bucket_post_refcount
,
6049 struct ocfs2_post_refcount
*p
= NULL
;
6051 /* We only need post_refcount if we support metaecc. */
6052 if (ocfs2_meta_ecc(OCFS2_SB(inode
->i_sb
)))
6055 trace_ocfs2_xattr_bucket_value_refcount(
6056 (unsigned long long)bucket_blkno(bucket
),
6057 le16_to_cpu(xh
->xh_count
));
6058 for (i
= 0; i
< le16_to_cpu(xh
->xh_count
); i
++) {
6059 xe
= &xh
->xh_entries
[i
];
6061 if (ocfs2_xattr_is_local(xe
))
6064 ret
= ocfs2_get_xattr_tree_value_root(inode
->i_sb
, bucket
, i
,
6065 &vb
.vb_xv
, &vb
.vb_bh
);
6071 ocfs2_init_xattr_value_extent_tree(&et
,
6072 INODE_CACHE(inode
), &vb
);
6074 ret
= ocfs2_xattr_value_attach_refcount(inode
, vb
.vb_xv
,
6088 static int ocfs2_refcount_xattr_tree_rec(struct inode
*inode
,
6089 struct buffer_head
*root_bh
,
6090 u64 blkno
, u32 cpos
, u32 len
, void *para
)
6092 return ocfs2_iterate_xattr_buckets(inode
, blkno
, len
,
6093 ocfs2_xattr_bucket_value_refcount
,
6097 static int ocfs2_xattr_block_attach_refcount(struct inode
*inode
,
6098 struct buffer_head
*blk_bh
,
6099 struct ocfs2_caching_info
*ref_ci
,
6100 struct buffer_head
*ref_root_bh
,
6101 struct ocfs2_cached_dealloc_ctxt
*dealloc
)
6104 struct ocfs2_xattr_block
*xb
=
6105 (struct ocfs2_xattr_block
*)blk_bh
->b_data
;
6107 if (!(le16_to_cpu(xb
->xb_flags
) & OCFS2_XATTR_INDEXED
)) {
6108 struct ocfs2_xattr_header
*header
= &xb
->xb_attrs
.xb_header
;
6109 struct ocfs2_xattr_value_buf vb
= {
6111 .vb_access
= ocfs2_journal_access_xb
,
6114 ret
= ocfs2_xattr_attach_refcount_normal(inode
, &vb
, header
,
6115 ref_ci
, ref_root_bh
,
6118 struct ocfs2_xattr_tree_value_refcount_para para
= {
6120 .ref_root_bh
= ref_root_bh
,
6124 ret
= ocfs2_iterate_xattr_index_block(inode
, blk_bh
,
6125 ocfs2_refcount_xattr_tree_rec
,
6132 int ocfs2_xattr_attach_refcount_tree(struct inode
*inode
,
6133 struct buffer_head
*fe_bh
,
6134 struct ocfs2_caching_info
*ref_ci
,
6135 struct buffer_head
*ref_root_bh
,
6136 struct ocfs2_cached_dealloc_ctxt
*dealloc
)
6139 struct ocfs2_inode_info
*oi
= OCFS2_I(inode
);
6140 struct ocfs2_dinode
*di
= (struct ocfs2_dinode
*)fe_bh
->b_data
;
6141 struct buffer_head
*blk_bh
= NULL
;
6143 if (oi
->ip_dyn_features
& OCFS2_INLINE_XATTR_FL
) {
6144 ret
= ocfs2_xattr_inline_attach_refcount(inode
, fe_bh
,
6145 ref_ci
, ref_root_bh
,
6153 if (!di
->i_xattr_loc
)
6156 ret
= ocfs2_read_xattr_block(inode
, le64_to_cpu(di
->i_xattr_loc
),
6163 ret
= ocfs2_xattr_block_attach_refcount(inode
, blk_bh
, ref_ci
,
6164 ref_root_bh
, dealloc
);
6174 typedef int (should_xattr_reflinked
)(struct ocfs2_xattr_entry
*xe
);
6176 * Store the information we need in xattr reflink.
6177 * old_bh and new_bh are inode bh for the old and new inode.
6179 struct ocfs2_xattr_reflink
{
6180 struct inode
*old_inode
;
6181 struct inode
*new_inode
;
6182 struct buffer_head
*old_bh
;
6183 struct buffer_head
*new_bh
;
6184 struct ocfs2_caching_info
*ref_ci
;
6185 struct buffer_head
*ref_root_bh
;
6186 struct ocfs2_cached_dealloc_ctxt
*dealloc
;
6187 should_xattr_reflinked
*xattr_reflinked
;
6191 * Given a xattr header and xe offset,
6192 * return the proper xv and the corresponding bh.
6193 * xattr in inode, block and xattr tree have different implementaions.
6195 typedef int (get_xattr_value_root
)(struct super_block
*sb
,
6196 struct buffer_head
*bh
,
6197 struct ocfs2_xattr_header
*xh
,
6199 struct ocfs2_xattr_value_root
**xv
,
6200 struct buffer_head
**ret_bh
,
6204 * Calculate all the xattr value root metadata stored in this xattr header and
6205 * credits we need if we create them from the scratch.
6206 * We use get_xattr_value_root so that all types of xattr container can use it.
6208 static int ocfs2_value_metas_in_xattr_header(struct super_block
*sb
,
6209 struct buffer_head
*bh
,
6210 struct ocfs2_xattr_header
*xh
,
6211 int *metas
, int *credits
,
6213 get_xattr_value_root
*func
,
6217 struct ocfs2_xattr_value_root
*xv
;
6218 struct ocfs2_xattr_entry
*xe
;
6220 for (i
= 0; i
< le16_to_cpu(xh
->xh_count
); i
++) {
6221 xe
= &xh
->xh_entries
[i
];
6222 if (ocfs2_xattr_is_local(xe
))
6225 ret
= func(sb
, bh
, xh
, i
, &xv
, NULL
, para
);
6231 *metas
+= le16_to_cpu(xv
->xr_list
.l_tree_depth
) *
6232 le16_to_cpu(xv
->xr_list
.l_next_free_rec
);
6234 *credits
+= ocfs2_calc_extend_credits(sb
,
6235 &def_xv
.xv
.xr_list
);
6238 * If the value is a tree with depth > 1, We don't go deep
6239 * to the extent block, so just calculate a maximum record num.
6241 if (!xv
->xr_list
.l_tree_depth
)
6242 *num_recs
+= le16_to_cpu(xv
->xr_list
.l_next_free_rec
);
6244 *num_recs
+= ocfs2_clusters_for_bytes(sb
,
6251 /* Used by xattr inode and block to return the right xv and buffer_head. */
6252 static int ocfs2_get_xattr_value_root(struct super_block
*sb
,
6253 struct buffer_head
*bh
,
6254 struct ocfs2_xattr_header
*xh
,
6256 struct ocfs2_xattr_value_root
**xv
,
6257 struct buffer_head
**ret_bh
,
6260 struct ocfs2_xattr_entry
*xe
= &xh
->xh_entries
[offset
];
6262 *xv
= (struct ocfs2_xattr_value_root
*)((void *)xh
+
6263 le16_to_cpu(xe
->xe_name_offset
) +
6264 OCFS2_XATTR_SIZE(xe
->xe_name_len
));
6273 * Lock the meta_ac and caculate how much credits we need for reflink xattrs.
6274 * It is only used for inline xattr and xattr block.
6276 static int ocfs2_reflink_lock_xattr_allocators(struct ocfs2_super
*osb
,
6277 struct ocfs2_xattr_header
*xh
,
6278 struct buffer_head
*ref_root_bh
,
6280 struct ocfs2_alloc_context
**meta_ac
)
6282 int ret
, meta_add
= 0, num_recs
= 0;
6283 struct ocfs2_refcount_block
*rb
=
6284 (struct ocfs2_refcount_block
*)ref_root_bh
->b_data
;
6288 ret
= ocfs2_value_metas_in_xattr_header(osb
->sb
, NULL
, xh
,
6289 &meta_add
, credits
, &num_recs
,
6290 ocfs2_get_xattr_value_root
,
6298 * We need to add/modify num_recs in refcount tree, so just calculate
6299 * an approximate number we need for refcount tree change.
6300 * Sometimes we need to split the tree, and after split, half recs
6301 * will be moved to the new block, and a new block can only provide
6302 * half number of recs. So we multiple new blocks by 2.
6304 num_recs
= num_recs
/ ocfs2_refcount_recs_per_rb(osb
->sb
) * 2;
6305 meta_add
+= num_recs
;
6306 *credits
+= num_recs
+ num_recs
* OCFS2_EXPAND_REFCOUNT_TREE_CREDITS
;
6307 if (le32_to_cpu(rb
->rf_flags
) & OCFS2_REFCOUNT_TREE_FL
)
6308 *credits
+= le16_to_cpu(rb
->rf_list
.l_tree_depth
) *
6309 le16_to_cpu(rb
->rf_list
.l_next_free_rec
) + 1;
6313 ret
= ocfs2_reserve_new_metadata_blocks(osb
, meta_add
, meta_ac
);
6322 * Given a xattr header, reflink all the xattrs in this container.
6323 * It can be used for inode, block and bucket.
6326 * Before we call this function, the caller has memcpy the xattr in
6327 * old_xh to the new_xh.
6329 * If args.xattr_reflinked is set, call it to decide whether the xe should
6330 * be reflinked or not. If not, remove it from the new xattr header.
6332 static int ocfs2_reflink_xattr_header(handle_t
*handle
,
6333 struct ocfs2_xattr_reflink
*args
,
6334 struct buffer_head
*old_bh
,
6335 struct ocfs2_xattr_header
*xh
,
6336 struct buffer_head
*new_bh
,
6337 struct ocfs2_xattr_header
*new_xh
,
6338 struct ocfs2_xattr_value_buf
*vb
,
6339 struct ocfs2_alloc_context
*meta_ac
,
6340 get_xattr_value_root
*func
,
6344 struct super_block
*sb
= args
->old_inode
->i_sb
;
6345 struct buffer_head
*value_bh
;
6346 struct ocfs2_xattr_entry
*xe
, *last
;
6347 struct ocfs2_xattr_value_root
*xv
, *new_xv
;
6348 struct ocfs2_extent_tree data_et
;
6349 u32 clusters
, cpos
, p_cluster
, num_clusters
;
6350 unsigned int ext_flags
= 0;
6352 trace_ocfs2_reflink_xattr_header((unsigned long long)old_bh
->b_blocknr
,
6353 le16_to_cpu(xh
->xh_count
));
6355 last
= &new_xh
->xh_entries
[le16_to_cpu(new_xh
->xh_count
)];
6356 for (i
= 0, j
= 0; i
< le16_to_cpu(xh
->xh_count
); i
++, j
++) {
6357 xe
= &xh
->xh_entries
[i
];
6359 if (args
->xattr_reflinked
&& !args
->xattr_reflinked(xe
)) {
6360 xe
= &new_xh
->xh_entries
[j
];
6362 le16_add_cpu(&new_xh
->xh_count
, -1);
6363 if (new_xh
->xh_count
) {
6365 (void *)last
- (void *)xe
);
6367 sizeof(struct ocfs2_xattr_entry
));
6371 * We don't want j to increase in the next round since
6372 * it is already moved ahead.
6378 if (ocfs2_xattr_is_local(xe
))
6381 ret
= func(sb
, old_bh
, xh
, i
, &xv
, NULL
, para
);
6387 ret
= func(sb
, new_bh
, new_xh
, j
, &new_xv
, &value_bh
, para
);
6394 * For the xattr which has l_tree_depth = 0, all the extent
6395 * recs have already be copied to the new xh with the
6396 * propriate OCFS2_EXT_REFCOUNTED flag we just need to
6397 * increase the refount count int the refcount tree.
6399 * For the xattr which has l_tree_depth > 0, we need
6400 * to initialize it to the empty default value root,
6401 * and then insert the extents one by one.
6403 if (xv
->xr_list
.l_tree_depth
) {
6404 memcpy(new_xv
, &def_xv
, sizeof(def_xv
));
6406 vb
->vb_bh
= value_bh
;
6407 ocfs2_init_xattr_value_extent_tree(&data_et
,
6408 INODE_CACHE(args
->new_inode
), vb
);
6411 clusters
= le32_to_cpu(xv
->xr_clusters
);
6413 while (cpos
< clusters
) {
6414 ret
= ocfs2_xattr_get_clusters(args
->old_inode
,
6427 if (xv
->xr_list
.l_tree_depth
) {
6428 ret
= ocfs2_insert_extent(handle
,
6430 ocfs2_clusters_to_blocks(
6431 args
->old_inode
->i_sb
,
6433 num_clusters
, ext_flags
,
6441 ret
= ocfs2_increase_refcount(handle
, args
->ref_ci
,
6443 p_cluster
, num_clusters
,
6444 meta_ac
, args
->dealloc
);
6450 cpos
+= num_clusters
;
6458 static int ocfs2_reflink_xattr_inline(struct ocfs2_xattr_reflink
*args
)
6460 int ret
= 0, credits
= 0;
6462 struct ocfs2_super
*osb
= OCFS2_SB(args
->old_inode
->i_sb
);
6463 struct ocfs2_dinode
*di
= (struct ocfs2_dinode
*)args
->old_bh
->b_data
;
6464 int inline_size
= le16_to_cpu(di
->i_xattr_inline_size
);
6465 int header_off
= osb
->sb
->s_blocksize
- inline_size
;
6466 struct ocfs2_xattr_header
*xh
= (struct ocfs2_xattr_header
*)
6467 (args
->old_bh
->b_data
+ header_off
);
6468 struct ocfs2_xattr_header
*new_xh
= (struct ocfs2_xattr_header
*)
6469 (args
->new_bh
->b_data
+ header_off
);
6470 struct ocfs2_alloc_context
*meta_ac
= NULL
;
6471 struct ocfs2_inode_info
*new_oi
;
6472 struct ocfs2_dinode
*new_di
;
6473 struct ocfs2_xattr_value_buf vb
= {
6474 .vb_bh
= args
->new_bh
,
6475 .vb_access
= ocfs2_journal_access_di
,
6478 ret
= ocfs2_reflink_lock_xattr_allocators(osb
, xh
, args
->ref_root_bh
,
6479 &credits
, &meta_ac
);
6485 handle
= ocfs2_start_trans(osb
, credits
);
6486 if (IS_ERR(handle
)) {
6487 ret
= PTR_ERR(handle
);
6492 ret
= ocfs2_journal_access_di(handle
, INODE_CACHE(args
->new_inode
),
6493 args
->new_bh
, OCFS2_JOURNAL_ACCESS_WRITE
);
6499 memcpy(args
->new_bh
->b_data
+ header_off
,
6500 args
->old_bh
->b_data
+ header_off
, inline_size
);
6502 new_di
= (struct ocfs2_dinode
*)args
->new_bh
->b_data
;
6503 new_di
->i_xattr_inline_size
= cpu_to_le16(inline_size
);
6505 ret
= ocfs2_reflink_xattr_header(handle
, args
, args
->old_bh
, xh
,
6506 args
->new_bh
, new_xh
, &vb
, meta_ac
,
6507 ocfs2_get_xattr_value_root
, NULL
);
6513 new_oi
= OCFS2_I(args
->new_inode
);
6515 * Adjust extent record count to reserve space for extended attribute.
6516 * Inline data count had been adjusted in ocfs2_duplicate_inline_data().
6518 if (!(new_oi
->ip_dyn_features
& OCFS2_INLINE_DATA_FL
) &&
6519 !(ocfs2_inode_is_fast_symlink(args
->new_inode
))) {
6520 struct ocfs2_extent_list
*el
= &new_di
->id2
.i_list
;
6521 le16_add_cpu(&el
->l_count
, -(inline_size
/
6522 sizeof(struct ocfs2_extent_rec
)));
6524 spin_lock(&new_oi
->ip_lock
);
6525 new_oi
->ip_dyn_features
|= OCFS2_HAS_XATTR_FL
| OCFS2_INLINE_XATTR_FL
;
6526 new_di
->i_dyn_features
= cpu_to_le16(new_oi
->ip_dyn_features
);
6527 spin_unlock(&new_oi
->ip_lock
);
6529 ocfs2_journal_dirty(handle
, args
->new_bh
);
6532 ocfs2_commit_trans(osb
, handle
);
6536 ocfs2_free_alloc_context(meta_ac
);
6540 static int ocfs2_create_empty_xattr_block(struct inode
*inode
,
6541 struct buffer_head
*fe_bh
,
6542 struct buffer_head
**ret_bh
,
6546 struct ocfs2_super
*osb
= OCFS2_SB(inode
->i_sb
);
6547 struct ocfs2_xattr_set_ctxt ctxt
;
6549 memset(&ctxt
, 0, sizeof(ctxt
));
6550 ret
= ocfs2_reserve_new_metadata_blocks(osb
, 1, &ctxt
.meta_ac
);
6556 ctxt
.handle
= ocfs2_start_trans(osb
, OCFS2_XATTR_BLOCK_CREATE_CREDITS
);
6557 if (IS_ERR(ctxt
.handle
)) {
6558 ret
= PTR_ERR(ctxt
.handle
);
6563 trace_ocfs2_create_empty_xattr_block(
6564 (unsigned long long)fe_bh
->b_blocknr
, indexed
);
6565 ret
= ocfs2_create_xattr_block(inode
, fe_bh
, &ctxt
, indexed
,
6570 ocfs2_commit_trans(osb
, ctxt
.handle
);
6572 ocfs2_free_alloc_context(ctxt
.meta_ac
);
6576 static int ocfs2_reflink_xattr_block(struct ocfs2_xattr_reflink
*args
,
6577 struct buffer_head
*blk_bh
,
6578 struct buffer_head
*new_blk_bh
)
6580 int ret
= 0, credits
= 0;
6582 struct ocfs2_inode_info
*new_oi
= OCFS2_I(args
->new_inode
);
6583 struct ocfs2_dinode
*new_di
;
6584 struct ocfs2_super
*osb
= OCFS2_SB(args
->new_inode
->i_sb
);
6585 int header_off
= offsetof(struct ocfs2_xattr_block
, xb_attrs
.xb_header
);
6586 struct ocfs2_xattr_block
*xb
=
6587 (struct ocfs2_xattr_block
*)blk_bh
->b_data
;
6588 struct ocfs2_xattr_header
*xh
= &xb
->xb_attrs
.xb_header
;
6589 struct ocfs2_xattr_block
*new_xb
=
6590 (struct ocfs2_xattr_block
*)new_blk_bh
->b_data
;
6591 struct ocfs2_xattr_header
*new_xh
= &new_xb
->xb_attrs
.xb_header
;
6592 struct ocfs2_alloc_context
*meta_ac
;
6593 struct ocfs2_xattr_value_buf vb
= {
6594 .vb_bh
= new_blk_bh
,
6595 .vb_access
= ocfs2_journal_access_xb
,
6598 ret
= ocfs2_reflink_lock_xattr_allocators(osb
, xh
, args
->ref_root_bh
,
6599 &credits
, &meta_ac
);
6605 /* One more credits in case we need to add xattr flags in new inode. */
6606 handle
= ocfs2_start_trans(osb
, credits
+ 1);
6607 if (IS_ERR(handle
)) {
6608 ret
= PTR_ERR(handle
);
6613 if (!(new_oi
->ip_dyn_features
& OCFS2_HAS_XATTR_FL
)) {
6614 ret
= ocfs2_journal_access_di(handle
,
6615 INODE_CACHE(args
->new_inode
),
6617 OCFS2_JOURNAL_ACCESS_WRITE
);
6624 ret
= ocfs2_journal_access_xb(handle
, INODE_CACHE(args
->new_inode
),
6625 new_blk_bh
, OCFS2_JOURNAL_ACCESS_WRITE
);
6631 memcpy(new_blk_bh
->b_data
+ header_off
, blk_bh
->b_data
+ header_off
,
6632 osb
->sb
->s_blocksize
- header_off
);
6634 ret
= ocfs2_reflink_xattr_header(handle
, args
, blk_bh
, xh
,
6635 new_blk_bh
, new_xh
, &vb
, meta_ac
,
6636 ocfs2_get_xattr_value_root
, NULL
);
6642 ocfs2_journal_dirty(handle
, new_blk_bh
);
6644 if (!(new_oi
->ip_dyn_features
& OCFS2_HAS_XATTR_FL
)) {
6645 new_di
= (struct ocfs2_dinode
*)args
->new_bh
->b_data
;
6646 spin_lock(&new_oi
->ip_lock
);
6647 new_oi
->ip_dyn_features
|= OCFS2_HAS_XATTR_FL
;
6648 new_di
->i_dyn_features
= cpu_to_le16(new_oi
->ip_dyn_features
);
6649 spin_unlock(&new_oi
->ip_lock
);
6651 ocfs2_journal_dirty(handle
, args
->new_bh
);
6655 ocfs2_commit_trans(osb
, handle
);
6658 ocfs2_free_alloc_context(meta_ac
);
6662 struct ocfs2_reflink_xattr_tree_args
{
6663 struct ocfs2_xattr_reflink
*reflink
;
6664 struct buffer_head
*old_blk_bh
;
6665 struct buffer_head
*new_blk_bh
;
6666 struct ocfs2_xattr_bucket
*old_bucket
;
6667 struct ocfs2_xattr_bucket
*new_bucket
;
6672 * We have to handle the case that both old bucket and new bucket
6673 * will call this function to get the right ret_bh.
6674 * So The caller must give us the right bh.
6676 static int ocfs2_get_reflink_xattr_value_root(struct super_block
*sb
,
6677 struct buffer_head
*bh
,
6678 struct ocfs2_xattr_header
*xh
,
6680 struct ocfs2_xattr_value_root
**xv
,
6681 struct buffer_head
**ret_bh
,
6684 struct ocfs2_reflink_xattr_tree_args
*args
=
6685 (struct ocfs2_reflink_xattr_tree_args
*)para
;
6686 struct ocfs2_xattr_bucket
*bucket
;
6688 if (bh
== args
->old_bucket
->bu_bhs
[0])
6689 bucket
= args
->old_bucket
;
6691 bucket
= args
->new_bucket
;
6693 return ocfs2_get_xattr_tree_value_root(sb
, bucket
, offset
,
6697 struct ocfs2_value_tree_metas
{
6703 static int ocfs2_value_tree_metas_in_bucket(struct super_block
*sb
,
6704 struct buffer_head
*bh
,
6705 struct ocfs2_xattr_header
*xh
,
6707 struct ocfs2_xattr_value_root
**xv
,
6708 struct buffer_head
**ret_bh
,
6711 struct ocfs2_xattr_bucket
*bucket
=
6712 (struct ocfs2_xattr_bucket
*)para
;
6714 return ocfs2_get_xattr_tree_value_root(sb
, bucket
, offset
,
6718 static int ocfs2_calc_value_tree_metas(struct inode
*inode
,
6719 struct ocfs2_xattr_bucket
*bucket
,
6722 struct ocfs2_value_tree_metas
*metas
=
6723 (struct ocfs2_value_tree_metas
*)para
;
6724 struct ocfs2_xattr_header
*xh
=
6725 (struct ocfs2_xattr_header
*)bucket
->bu_bhs
[0]->b_data
;
6727 /* Add the credits for this bucket first. */
6728 metas
->credits
+= bucket
->bu_blocks
;
6729 return ocfs2_value_metas_in_xattr_header(inode
->i_sb
, bucket
->bu_bhs
[0],
6730 xh
, &metas
->num_metas
,
6731 &metas
->credits
, &metas
->num_recs
,
6732 ocfs2_value_tree_metas_in_bucket
,
6737 * Given a xattr extent rec starting from blkno and having len clusters,
6738 * iterate all the buckets calculate how much metadata we need for reflinking
6739 * all the ocfs2_xattr_value_root and lock the allocators accordingly.
6741 static int ocfs2_lock_reflink_xattr_rec_allocators(
6742 struct ocfs2_reflink_xattr_tree_args
*args
,
6743 struct ocfs2_extent_tree
*xt_et
,
6744 u64 blkno
, u32 len
, int *credits
,
6745 struct ocfs2_alloc_context
**meta_ac
,
6746 struct ocfs2_alloc_context
**data_ac
)
6748 int ret
, num_free_extents
;
6749 struct ocfs2_value_tree_metas metas
;
6750 struct ocfs2_super
*osb
= OCFS2_SB(args
->reflink
->old_inode
->i_sb
);
6751 struct ocfs2_refcount_block
*rb
;
6753 memset(&metas
, 0, sizeof(metas
));
6755 ret
= ocfs2_iterate_xattr_buckets(args
->reflink
->old_inode
, blkno
, len
,
6756 ocfs2_calc_value_tree_metas
, &metas
);
6762 *credits
= metas
.credits
;
6765 * Calculate we need for refcount tree change.
6767 * We need to add/modify num_recs in refcount tree, so just calculate
6768 * an approximate number we need for refcount tree change.
6769 * Sometimes we need to split the tree, and after split, half recs
6770 * will be moved to the new block, and a new block can only provide
6771 * half number of recs. So we multiple new blocks by 2.
6772 * In the end, we have to add credits for modifying the already
6773 * existed refcount block.
6775 rb
= (struct ocfs2_refcount_block
*)args
->reflink
->ref_root_bh
->b_data
;
6777 (metas
.num_recs
+ ocfs2_refcount_recs_per_rb(osb
->sb
) - 1) /
6778 ocfs2_refcount_recs_per_rb(osb
->sb
) * 2;
6779 metas
.num_metas
+= metas
.num_recs
;
6780 *credits
+= metas
.num_recs
+
6781 metas
.num_recs
* OCFS2_EXPAND_REFCOUNT_TREE_CREDITS
;
6782 if (le32_to_cpu(rb
->rf_flags
) & OCFS2_REFCOUNT_TREE_FL
)
6783 *credits
+= le16_to_cpu(rb
->rf_list
.l_tree_depth
) *
6784 le16_to_cpu(rb
->rf_list
.l_next_free_rec
) + 1;
6788 /* count in the xattr tree change. */
6789 num_free_extents
= ocfs2_num_free_extents(osb
, xt_et
);
6790 if (num_free_extents
< 0) {
6791 ret
= num_free_extents
;
6796 if (num_free_extents
< len
)
6797 metas
.num_metas
+= ocfs2_extend_meta_needed(xt_et
->et_root_el
);
6799 *credits
+= ocfs2_calc_extend_credits(osb
->sb
,
6802 if (metas
.num_metas
) {
6803 ret
= ocfs2_reserve_new_metadata_blocks(osb
, metas
.num_metas
,
6812 ret
= ocfs2_reserve_clusters(osb
, len
, data_ac
);
6819 ocfs2_free_alloc_context(*meta_ac
);
6827 static int ocfs2_reflink_xattr_bucket(handle_t
*handle
,
6828 u64 blkno
, u64 new_blkno
, u32 clusters
,
6829 u32
*cpos
, int num_buckets
,
6830 struct ocfs2_alloc_context
*meta_ac
,
6831 struct ocfs2_alloc_context
*data_ac
,
6832 struct ocfs2_reflink_xattr_tree_args
*args
)
6835 struct super_block
*sb
= args
->reflink
->old_inode
->i_sb
;
6836 int bpb
= args
->old_bucket
->bu_blocks
;
6837 struct ocfs2_xattr_value_buf vb
= {
6838 .vb_access
= ocfs2_journal_access
,
6841 for (i
= 0; i
< num_buckets
; i
++, blkno
+= bpb
, new_blkno
+= bpb
) {
6842 ret
= ocfs2_read_xattr_bucket(args
->old_bucket
, blkno
);
6848 ret
= ocfs2_init_xattr_bucket(args
->new_bucket
, new_blkno
, 1);
6854 ret
= ocfs2_xattr_bucket_journal_access(handle
,
6856 OCFS2_JOURNAL_ACCESS_CREATE
);
6862 for (j
= 0; j
< bpb
; j
++)
6863 memcpy(bucket_block(args
->new_bucket
, j
),
6864 bucket_block(args
->old_bucket
, j
),
6868 * Record the start cpos so that we can use it to initialize
6869 * our xattr tree we also set the xh_num_bucket for the new
6873 *cpos
= le32_to_cpu(bucket_xh(args
->new_bucket
)->
6874 xh_entries
[0].xe_name_hash
);
6875 bucket_xh(args
->new_bucket
)->xh_num_buckets
=
6876 cpu_to_le16(num_buckets
);
6879 ocfs2_xattr_bucket_journal_dirty(handle
, args
->new_bucket
);
6881 ret
= ocfs2_reflink_xattr_header(handle
, args
->reflink
,
6882 args
->old_bucket
->bu_bhs
[0],
6883 bucket_xh(args
->old_bucket
),
6884 args
->new_bucket
->bu_bhs
[0],
6885 bucket_xh(args
->new_bucket
),
6887 ocfs2_get_reflink_xattr_value_root
,
6895 * Re-access and dirty the bucket to calculate metaecc.
6896 * Because we may extend the transaction in reflink_xattr_header
6897 * which will let the already accessed block gone.
6899 ret
= ocfs2_xattr_bucket_journal_access(handle
,
6901 OCFS2_JOURNAL_ACCESS_WRITE
);
6907 ocfs2_xattr_bucket_journal_dirty(handle
, args
->new_bucket
);
6909 ocfs2_xattr_bucket_relse(args
->old_bucket
);
6910 ocfs2_xattr_bucket_relse(args
->new_bucket
);
6913 ocfs2_xattr_bucket_relse(args
->old_bucket
);
6914 ocfs2_xattr_bucket_relse(args
->new_bucket
);
6918 static int ocfs2_reflink_xattr_buckets(handle_t
*handle
,
6919 struct inode
*inode
,
6920 struct ocfs2_reflink_xattr_tree_args
*args
,
6921 struct ocfs2_extent_tree
*et
,
6922 struct ocfs2_alloc_context
*meta_ac
,
6923 struct ocfs2_alloc_context
*data_ac
,
6924 u64 blkno
, u32 cpos
, u32 len
)
6926 int ret
, first_inserted
= 0;
6927 u32 p_cluster
, num_clusters
, reflink_cpos
= 0;
6929 unsigned int num_buckets
, reflink_buckets
;
6931 ocfs2_xattr_buckets_per_cluster(OCFS2_SB(inode
->i_sb
));
6933 ret
= ocfs2_read_xattr_bucket(args
->old_bucket
, blkno
);
6938 num_buckets
= le16_to_cpu(bucket_xh(args
->old_bucket
)->xh_num_buckets
);
6939 ocfs2_xattr_bucket_relse(args
->old_bucket
);
6941 while (len
&& num_buckets
) {
6942 ret
= ocfs2_claim_clusters(handle
, data_ac
,
6943 1, &p_cluster
, &num_clusters
);
6949 new_blkno
= ocfs2_clusters_to_blocks(inode
->i_sb
, p_cluster
);
6950 reflink_buckets
= min(num_buckets
, bpc
* num_clusters
);
6952 ret
= ocfs2_reflink_xattr_bucket(handle
, blkno
,
6953 new_blkno
, num_clusters
,
6954 &reflink_cpos
, reflink_buckets
,
6955 meta_ac
, data_ac
, args
);
6962 * For the 1st allocated cluster, we make it use the same cpos
6963 * so that the xattr tree looks the same as the original one
6966 if (!first_inserted
) {
6967 reflink_cpos
= cpos
;
6970 ret
= ocfs2_insert_extent(handle
, et
, reflink_cpos
, new_blkno
,
6971 num_clusters
, 0, meta_ac
);
6975 trace_ocfs2_reflink_xattr_buckets((unsigned long long)new_blkno
,
6976 num_clusters
, reflink_cpos
);
6978 len
-= num_clusters
;
6979 blkno
+= ocfs2_clusters_to_blocks(inode
->i_sb
, num_clusters
);
6980 num_buckets
-= reflink_buckets
;
6987 * Create the same xattr extent record in the new inode's xattr tree.
6989 static int ocfs2_reflink_xattr_rec(struct inode
*inode
,
6990 struct buffer_head
*root_bh
,
6996 int ret
, credits
= 0;
6998 struct ocfs2_reflink_xattr_tree_args
*args
=
6999 (struct ocfs2_reflink_xattr_tree_args
*)para
;
7000 struct ocfs2_super
*osb
= OCFS2_SB(inode
->i_sb
);
7001 struct ocfs2_alloc_context
*meta_ac
= NULL
;
7002 struct ocfs2_alloc_context
*data_ac
= NULL
;
7003 struct ocfs2_extent_tree et
;
7005 trace_ocfs2_reflink_xattr_rec((unsigned long long)blkno
, len
);
7007 ocfs2_init_xattr_tree_extent_tree(&et
,
7008 INODE_CACHE(args
->reflink
->new_inode
),
7011 ret
= ocfs2_lock_reflink_xattr_rec_allocators(args
, &et
, blkno
,
7013 &meta_ac
, &data_ac
);
7019 handle
= ocfs2_start_trans(osb
, credits
);
7020 if (IS_ERR(handle
)) {
7021 ret
= PTR_ERR(handle
);
7026 ret
= ocfs2_reflink_xattr_buckets(handle
, inode
, args
, &et
,
7032 ocfs2_commit_trans(osb
, handle
);
7036 ocfs2_free_alloc_context(meta_ac
);
7038 ocfs2_free_alloc_context(data_ac
);
7043 * Create reflinked xattr buckets.
7044 * We will add bucket one by one, and refcount all the xattrs in the bucket
7045 * if they are stored outside.
7047 static int ocfs2_reflink_xattr_tree(struct ocfs2_xattr_reflink
*args
,
7048 struct buffer_head
*blk_bh
,
7049 struct buffer_head
*new_blk_bh
)
7052 struct ocfs2_reflink_xattr_tree_args para
;
7054 memset(¶
, 0, sizeof(para
));
7055 para
.reflink
= args
;
7056 para
.old_blk_bh
= blk_bh
;
7057 para
.new_blk_bh
= new_blk_bh
;
7059 para
.old_bucket
= ocfs2_xattr_bucket_new(args
->old_inode
);
7060 if (!para
.old_bucket
) {
7061 mlog_errno(-ENOMEM
);
7065 para
.new_bucket
= ocfs2_xattr_bucket_new(args
->new_inode
);
7066 if (!para
.new_bucket
) {
7072 ret
= ocfs2_iterate_xattr_index_block(args
->old_inode
, blk_bh
,
7073 ocfs2_reflink_xattr_rec
,
7079 ocfs2_xattr_bucket_free(para
.old_bucket
);
7080 ocfs2_xattr_bucket_free(para
.new_bucket
);
7084 static int ocfs2_reflink_xattr_in_block(struct ocfs2_xattr_reflink
*args
,
7085 struct buffer_head
*blk_bh
)
7087 int ret
, indexed
= 0;
7088 struct buffer_head
*new_blk_bh
= NULL
;
7089 struct ocfs2_xattr_block
*xb
=
7090 (struct ocfs2_xattr_block
*)blk_bh
->b_data
;
7093 if (le16_to_cpu(xb
->xb_flags
) & OCFS2_XATTR_INDEXED
)
7096 ret
= ocfs2_create_empty_xattr_block(args
->new_inode
, args
->new_bh
,
7097 &new_blk_bh
, indexed
);
7104 ret
= ocfs2_reflink_xattr_block(args
, blk_bh
, new_blk_bh
);
7106 ret
= ocfs2_reflink_xattr_tree(args
, blk_bh
, new_blk_bh
);
7115 static int ocfs2_reflink_xattr_no_security(struct ocfs2_xattr_entry
*xe
)
7117 int type
= ocfs2_xattr_get_type(xe
);
7119 return type
!= OCFS2_XATTR_INDEX_SECURITY
&&
7120 type
!= OCFS2_XATTR_INDEX_POSIX_ACL_ACCESS
&&
7121 type
!= OCFS2_XATTR_INDEX_POSIX_ACL_DEFAULT
;
7124 int ocfs2_reflink_xattrs(struct inode
*old_inode
,
7125 struct buffer_head
*old_bh
,
7126 struct inode
*new_inode
,
7127 struct buffer_head
*new_bh
,
7128 bool preserve_security
)
7131 struct ocfs2_xattr_reflink args
;
7132 struct ocfs2_inode_info
*oi
= OCFS2_I(old_inode
);
7133 struct ocfs2_dinode
*di
= (struct ocfs2_dinode
*)old_bh
->b_data
;
7134 struct buffer_head
*blk_bh
= NULL
;
7135 struct ocfs2_cached_dealloc_ctxt dealloc
;
7136 struct ocfs2_refcount_tree
*ref_tree
;
7137 struct buffer_head
*ref_root_bh
= NULL
;
7139 ret
= ocfs2_lock_refcount_tree(OCFS2_SB(old_inode
->i_sb
),
7140 le64_to_cpu(di
->i_refcount_loc
),
7141 1, &ref_tree
, &ref_root_bh
);
7147 ocfs2_init_dealloc_ctxt(&dealloc
);
7149 args
.old_inode
= old_inode
;
7150 args
.new_inode
= new_inode
;
7151 args
.old_bh
= old_bh
;
7152 args
.new_bh
= new_bh
;
7153 args
.ref_ci
= &ref_tree
->rf_ci
;
7154 args
.ref_root_bh
= ref_root_bh
;
7155 args
.dealloc
= &dealloc
;
7156 if (preserve_security
)
7157 args
.xattr_reflinked
= NULL
;
7159 args
.xattr_reflinked
= ocfs2_reflink_xattr_no_security
;
7161 if (oi
->ip_dyn_features
& OCFS2_INLINE_XATTR_FL
) {
7162 ret
= ocfs2_reflink_xattr_inline(&args
);
7169 if (!di
->i_xattr_loc
)
7172 ret
= ocfs2_read_xattr_block(old_inode
, le64_to_cpu(di
->i_xattr_loc
),
7179 ret
= ocfs2_reflink_xattr_in_block(&args
, blk_bh
);
7186 ocfs2_unlock_refcount_tree(OCFS2_SB(old_inode
->i_sb
),
7188 brelse(ref_root_bh
);
7190 if (ocfs2_dealloc_has_cluster(&dealloc
)) {
7191 ocfs2_schedule_truncate_log_flush(OCFS2_SB(old_inode
->i_sb
), 1);
7192 ocfs2_run_deallocs(OCFS2_SB(old_inode
->i_sb
), &dealloc
);
7200 * Initialize security and acl for a already created inode.
7201 * Used for reflink a non-preserve-security file.
7203 * It uses common api like ocfs2_xattr_set, so the caller
7204 * must not hold any lock expect i_mutex.
7206 int ocfs2_init_security_and_acl(struct inode
*dir
,
7207 struct inode
*inode
,
7208 const struct qstr
*qstr
,
7209 struct posix_acl
*default_acl
,
7210 struct posix_acl
*acl
)
7212 struct buffer_head
*dir_bh
= NULL
;
7215 ret
= ocfs2_init_security_get(inode
, dir
, qstr
, NULL
);
7221 ret
= ocfs2_inode_lock(dir
, &dir_bh
, 0);
7227 if (!ret
&& default_acl
)
7228 ret
= ocfs2_iop_set_acl(inode
, default_acl
, ACL_TYPE_DEFAULT
);
7230 ret
= ocfs2_iop_set_acl(inode
, acl
, ACL_TYPE_ACCESS
);
7232 ocfs2_inode_unlock(dir
, 0);
7238 * 'security' attributes support
7240 static size_t ocfs2_xattr_security_list(struct dentry
*dentry
, char *list
,
7241 size_t list_size
, const char *name
,
7242 size_t name_len
, int type
)
7244 const size_t prefix_len
= XATTR_SECURITY_PREFIX_LEN
;
7245 const size_t total_len
= prefix_len
+ name_len
+ 1;
7247 if (list
&& total_len
<= list_size
) {
7248 memcpy(list
, XATTR_SECURITY_PREFIX
, prefix_len
);
7249 memcpy(list
+ prefix_len
, name
, name_len
);
7250 list
[prefix_len
+ name_len
] = '\0';
7255 static int ocfs2_xattr_security_get(struct dentry
*dentry
, const char *name
,
7256 void *buffer
, size_t size
, int type
)
7258 if (strcmp(name
, "") == 0)
7260 return ocfs2_xattr_get(d_inode(dentry
), OCFS2_XATTR_INDEX_SECURITY
,
7261 name
, buffer
, size
);
7264 static int ocfs2_xattr_security_set(struct dentry
*dentry
, const char *name
,
7265 const void *value
, size_t size
, int flags
, int type
)
7267 if (strcmp(name
, "") == 0)
7270 return ocfs2_xattr_set(d_inode(dentry
), OCFS2_XATTR_INDEX_SECURITY
,
7271 name
, value
, size
, flags
);
7274 static int ocfs2_initxattrs(struct inode
*inode
, const struct xattr
*xattr_array
,
7277 const struct xattr
*xattr
;
7280 for (xattr
= xattr_array
; xattr
->name
!= NULL
; xattr
++) {
7281 err
= ocfs2_xattr_set(inode
, OCFS2_XATTR_INDEX_SECURITY
,
7282 xattr
->name
, xattr
->value
,
7283 xattr
->value_len
, XATTR_CREATE
);
7290 int ocfs2_init_security_get(struct inode
*inode
,
7292 const struct qstr
*qstr
,
7293 struct ocfs2_security_xattr_info
*si
)
7295 /* check whether ocfs2 support feature xattr */
7296 if (!ocfs2_supports_xattr(OCFS2_SB(dir
->i_sb
)))
7299 return security_old_inode_init_security(inode
, dir
, qstr
,
7300 &si
->name
, &si
->value
,
7303 return security_inode_init_security(inode
, dir
, qstr
,
7304 &ocfs2_initxattrs
, NULL
);
7307 int ocfs2_init_security_set(handle_t
*handle
,
7308 struct inode
*inode
,
7309 struct buffer_head
*di_bh
,
7310 struct ocfs2_security_xattr_info
*si
,
7311 struct ocfs2_alloc_context
*xattr_ac
,
7312 struct ocfs2_alloc_context
*data_ac
)
7314 return ocfs2_xattr_set_handle(handle
, inode
, di_bh
,
7315 OCFS2_XATTR_INDEX_SECURITY
,
7316 si
->name
, si
->value
, si
->value_len
, 0,
7320 const struct xattr_handler ocfs2_xattr_security_handler
= {
7321 .prefix
= XATTR_SECURITY_PREFIX
,
7322 .list
= ocfs2_xattr_security_list
,
7323 .get
= ocfs2_xattr_security_get
,
7324 .set
= ocfs2_xattr_security_set
,
7328 * 'trusted' attributes support
7330 static size_t ocfs2_xattr_trusted_list(struct dentry
*dentry
, char *list
,
7331 size_t list_size
, const char *name
,
7332 size_t name_len
, int type
)
7334 const size_t prefix_len
= XATTR_TRUSTED_PREFIX_LEN
;
7335 const size_t total_len
= prefix_len
+ name_len
+ 1;
7337 if (list
&& total_len
<= list_size
) {
7338 memcpy(list
, XATTR_TRUSTED_PREFIX
, prefix_len
);
7339 memcpy(list
+ prefix_len
, name
, name_len
);
7340 list
[prefix_len
+ name_len
] = '\0';
7345 static int ocfs2_xattr_trusted_get(struct dentry
*dentry
, const char *name
,
7346 void *buffer
, size_t size
, int type
)
7348 if (strcmp(name
, "") == 0)
7350 return ocfs2_xattr_get(d_inode(dentry
), OCFS2_XATTR_INDEX_TRUSTED
,
7351 name
, buffer
, size
);
7354 static int ocfs2_xattr_trusted_set(struct dentry
*dentry
, const char *name
,
7355 const void *value
, size_t size
, int flags
, int type
)
7357 if (strcmp(name
, "") == 0)
7360 return ocfs2_xattr_set(d_inode(dentry
), OCFS2_XATTR_INDEX_TRUSTED
,
7361 name
, value
, size
, flags
);
7364 const struct xattr_handler ocfs2_xattr_trusted_handler
= {
7365 .prefix
= XATTR_TRUSTED_PREFIX
,
7366 .list
= ocfs2_xattr_trusted_list
,
7367 .get
= ocfs2_xattr_trusted_get
,
7368 .set
= ocfs2_xattr_trusted_set
,
7372 * 'user' attributes support
7374 static size_t ocfs2_xattr_user_list(struct dentry
*dentry
, char *list
,
7375 size_t list_size
, const char *name
,
7376 size_t name_len
, int type
)
7378 const size_t prefix_len
= XATTR_USER_PREFIX_LEN
;
7379 const size_t total_len
= prefix_len
+ name_len
+ 1;
7380 struct ocfs2_super
*osb
= OCFS2_SB(dentry
->d_sb
);
7382 if (osb
->s_mount_opt
& OCFS2_MOUNT_NOUSERXATTR
)
7385 if (list
&& total_len
<= list_size
) {
7386 memcpy(list
, XATTR_USER_PREFIX
, prefix_len
);
7387 memcpy(list
+ prefix_len
, name
, name_len
);
7388 list
[prefix_len
+ name_len
] = '\0';
7393 static int ocfs2_xattr_user_get(struct dentry
*dentry
, const char *name
,
7394 void *buffer
, size_t size
, int type
)
7396 struct ocfs2_super
*osb
= OCFS2_SB(dentry
->d_sb
);
7398 if (strcmp(name
, "") == 0)
7400 if (osb
->s_mount_opt
& OCFS2_MOUNT_NOUSERXATTR
)
7402 return ocfs2_xattr_get(d_inode(dentry
), OCFS2_XATTR_INDEX_USER
, name
,
7406 static int ocfs2_xattr_user_set(struct dentry
*dentry
, const char *name
,
7407 const void *value
, size_t size
, int flags
, int type
)
7409 struct ocfs2_super
*osb
= OCFS2_SB(dentry
->d_sb
);
7411 if (strcmp(name
, "") == 0)
7413 if (osb
->s_mount_opt
& OCFS2_MOUNT_NOUSERXATTR
)
7416 return ocfs2_xattr_set(d_inode(dentry
), OCFS2_XATTR_INDEX_USER
,
7417 name
, value
, size
, flags
);
7420 const struct xattr_handler ocfs2_xattr_user_handler
= {
7421 .prefix
= XATTR_USER_PREFIX
,
7422 .list
= ocfs2_xattr_user_list
,
7423 .get
= ocfs2_xattr_user_get
,
7424 .set
= ocfs2_xattr_user_set
,