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 &ocfs2_xattr_acl_access_handler,
103 &ocfs2_xattr_acl_default_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 = &ocfs2_xattr_acl_access_handler,
113 [OCFS2_XATTR_INDEX_POSIX_ACL_DEFAULT]
114 = &ocfs2_xattr_acl_default_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,
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),
387 ocfs2_set_new_buffer_uptodate(INODE_CACHE(bucket->bu_inode),
392 ocfs2_xattr_bucket_relse(bucket);
396 /* Read the xattr bucket at xb_blkno */
397 static int ocfs2_read_xattr_bucket(struct ocfs2_xattr_bucket *bucket,
402 rc = ocfs2_read_blocks(INODE_CACHE(bucket->bu_inode), xb_blkno,
403 bucket->bu_blocks, bucket->bu_bhs, 0,
406 spin_lock(&OCFS2_SB(bucket->bu_inode->i_sb)->osb_xattr_lock);
407 rc = ocfs2_validate_meta_ecc_bhs(bucket->bu_inode->i_sb,
410 &bucket_xh(bucket)->xh_check);
411 spin_unlock(&OCFS2_SB(bucket->bu_inode->i_sb)->osb_xattr_lock);
417 ocfs2_xattr_bucket_relse(bucket);
421 static int ocfs2_xattr_bucket_journal_access(handle_t *handle,
422 struct ocfs2_xattr_bucket *bucket,
427 for (i = 0; i < bucket->bu_blocks; i++) {
428 rc = ocfs2_journal_access(handle,
429 INODE_CACHE(bucket->bu_inode),
430 bucket->bu_bhs[i], type);
440 static void ocfs2_xattr_bucket_journal_dirty(handle_t *handle,
441 struct ocfs2_xattr_bucket *bucket)
445 spin_lock(&OCFS2_SB(bucket->bu_inode->i_sb)->osb_xattr_lock);
446 ocfs2_compute_meta_ecc_bhs(bucket->bu_inode->i_sb,
447 bucket->bu_bhs, bucket->bu_blocks,
448 &bucket_xh(bucket)->xh_check);
449 spin_unlock(&OCFS2_SB(bucket->bu_inode->i_sb)->osb_xattr_lock);
451 for (i = 0; i < bucket->bu_blocks; i++)
452 ocfs2_journal_dirty(handle, bucket->bu_bhs[i]);
455 static void ocfs2_xattr_bucket_copy_data(struct ocfs2_xattr_bucket *dest,
456 struct ocfs2_xattr_bucket *src)
459 int blocksize = src->bu_inode->i_sb->s_blocksize;
461 BUG_ON(dest->bu_blocks != src->bu_blocks);
462 BUG_ON(dest->bu_inode != src->bu_inode);
464 for (i = 0; i < src->bu_blocks; i++) {
465 memcpy(bucket_block(dest, i), bucket_block(src, i),
470 static int ocfs2_validate_xattr_block(struct super_block *sb,
471 struct buffer_head *bh)
474 struct ocfs2_xattr_block *xb =
475 (struct ocfs2_xattr_block *)bh->b_data;
477 trace_ocfs2_validate_xattr_block((unsigned long long)bh->b_blocknr);
479 BUG_ON(!buffer_uptodate(bh));
482 * If the ecc fails, we return the error but otherwise
483 * leave the filesystem running. We know any error is
484 * local to this block.
486 rc = ocfs2_validate_meta_ecc(sb, bh->b_data, &xb->xb_check);
491 * Errors after here are fatal
494 if (!OCFS2_IS_VALID_XATTR_BLOCK(xb)) {
496 "Extended attribute block #%llu has bad "
498 (unsigned long long)bh->b_blocknr, 7,
503 if (le64_to_cpu(xb->xb_blkno) != bh->b_blocknr) {
505 "Extended attribute block #%llu has an "
506 "invalid xb_blkno of %llu",
507 (unsigned long long)bh->b_blocknr,
508 (unsigned long long)le64_to_cpu(xb->xb_blkno));
512 if (le32_to_cpu(xb->xb_fs_generation) != OCFS2_SB(sb)->fs_generation) {
514 "Extended attribute block #%llu has an invalid "
515 "xb_fs_generation of #%u",
516 (unsigned long long)bh->b_blocknr,
517 le32_to_cpu(xb->xb_fs_generation));
524 static int ocfs2_read_xattr_block(struct inode *inode, u64 xb_blkno,
525 struct buffer_head **bh)
528 struct buffer_head *tmp = *bh;
530 rc = ocfs2_read_block(INODE_CACHE(inode), xb_blkno, &tmp,
531 ocfs2_validate_xattr_block);
533 /* If ocfs2_read_block() got us a new bh, pass it up. */
540 static inline const char *ocfs2_xattr_prefix(int name_index)
542 const struct xattr_handler *handler = NULL;
544 if (name_index > 0 && name_index < OCFS2_XATTR_MAX)
545 handler = ocfs2_xattr_handler_map[name_index];
547 return handler ? handler->prefix : NULL;
550 static u32 ocfs2_xattr_name_hash(struct inode *inode,
554 /* Get hash value of uuid from super block */
555 u32 hash = OCFS2_SB(inode->i_sb)->uuid_hash;
558 /* hash extended attribute name */
559 for (i = 0; i < name_len; i++) {
560 hash = (hash << OCFS2_HASH_SHIFT) ^
561 (hash >> (8*sizeof(hash) - OCFS2_HASH_SHIFT)) ^
568 static int ocfs2_xattr_entry_real_size(int name_len, size_t value_len)
570 return namevalue_size(name_len, value_len) +
571 sizeof(struct ocfs2_xattr_entry);
574 static int ocfs2_xi_entry_usage(struct ocfs2_xattr_info *xi)
576 return namevalue_size_xi(xi) +
577 sizeof(struct ocfs2_xattr_entry);
580 static int ocfs2_xe_entry_usage(struct ocfs2_xattr_entry *xe)
582 return namevalue_size_xe(xe) +
583 sizeof(struct ocfs2_xattr_entry);
586 int ocfs2_calc_security_init(struct inode *dir,
587 struct ocfs2_security_xattr_info *si,
590 struct ocfs2_alloc_context **xattr_ac)
593 struct ocfs2_super *osb = OCFS2_SB(dir->i_sb);
594 int s_size = ocfs2_xattr_entry_real_size(strlen(si->name),
598 * The max space of security xattr taken inline is
599 * 256(name) + 80(value) + 16(entry) = 352 bytes,
600 * So reserve one metadata block for it is ok.
602 if (dir->i_sb->s_blocksize == OCFS2_MIN_BLOCKSIZE ||
603 s_size > OCFS2_XATTR_FREE_IN_IBODY) {
604 ret = ocfs2_reserve_new_metadata_blocks(osb, 1, xattr_ac);
609 *xattr_credits += OCFS2_XATTR_BLOCK_CREATE_CREDITS;
612 /* reserve clusters for xattr value which will be set in B tree*/
613 if (si->value_len > OCFS2_XATTR_INLINE_SIZE) {
614 int new_clusters = ocfs2_clusters_for_bytes(dir->i_sb,
617 *xattr_credits += ocfs2_clusters_to_blocks(dir->i_sb,
619 *want_clusters += new_clusters;
624 int ocfs2_calc_xattr_init(struct inode *dir,
625 struct buffer_head *dir_bh,
627 struct ocfs2_security_xattr_info *si,
633 struct ocfs2_super *osb = OCFS2_SB(dir->i_sb);
634 int s_size = 0, a_size = 0, acl_len = 0, new_clusters;
637 s_size = ocfs2_xattr_entry_real_size(strlen(si->name),
640 if (osb->s_mount_opt & OCFS2_MOUNT_POSIX_ACL) {
641 acl_len = ocfs2_xattr_get_nolock(dir, dir_bh,
642 OCFS2_XATTR_INDEX_POSIX_ACL_DEFAULT,
645 a_size = ocfs2_xattr_entry_real_size(0, acl_len);
648 } else if (acl_len != 0 && acl_len != -ENODATA) {
654 if (!(s_size + a_size))
658 * The max space of security xattr taken inline is
659 * 256(name) + 80(value) + 16(entry) = 352 bytes,
660 * The max space of acl xattr taken inline is
661 * 80(value) + 16(entry) * 2(if directory) = 192 bytes,
662 * when blocksize = 512, may reserve one more cluser for
663 * xattr bucket, otherwise reserve one metadata block
665 * If this is a new directory with inline data,
666 * we choose to reserve the entire inline area for
667 * directory contents and force an external xattr block.
669 if (dir->i_sb->s_blocksize == OCFS2_MIN_BLOCKSIZE ||
670 (S_ISDIR(mode) && ocfs2_supports_inline_data(osb)) ||
671 (s_size + a_size) > OCFS2_XATTR_FREE_IN_IBODY) {
672 *want_meta = *want_meta + 1;
673 *xattr_credits += OCFS2_XATTR_BLOCK_CREATE_CREDITS;
676 if (dir->i_sb->s_blocksize == OCFS2_MIN_BLOCKSIZE &&
677 (s_size + a_size) > OCFS2_XATTR_FREE_IN_BLOCK(dir)) {
679 *xattr_credits += ocfs2_blocks_per_xattr_bucket(dir->i_sb);
683 * reserve credits and clusters for xattrs which has large value
684 * and have to be set outside
686 if (si->enable && si->value_len > OCFS2_XATTR_INLINE_SIZE) {
687 new_clusters = ocfs2_clusters_for_bytes(dir->i_sb,
689 *xattr_credits += ocfs2_clusters_to_blocks(dir->i_sb,
691 *want_clusters += new_clusters;
693 if (osb->s_mount_opt & OCFS2_MOUNT_POSIX_ACL &&
694 acl_len > OCFS2_XATTR_INLINE_SIZE) {
695 /* for directory, it has DEFAULT and ACCESS two types of acls */
696 new_clusters = (S_ISDIR(mode) ? 2 : 1) *
697 ocfs2_clusters_for_bytes(dir->i_sb, acl_len);
698 *xattr_credits += ocfs2_clusters_to_blocks(dir->i_sb,
700 *want_clusters += new_clusters;
706 static int ocfs2_xattr_extend_allocation(struct inode *inode,
708 struct ocfs2_xattr_value_buf *vb,
709 struct ocfs2_xattr_set_ctxt *ctxt)
711 int status = 0, credits;
712 handle_t *handle = ctxt->handle;
713 enum ocfs2_alloc_restarted why;
714 u32 prev_clusters, logical_start = le32_to_cpu(vb->vb_xv->xr_clusters);
715 struct ocfs2_extent_tree et;
717 ocfs2_init_xattr_value_extent_tree(&et, INODE_CACHE(inode), vb);
719 while (clusters_to_add) {
720 trace_ocfs2_xattr_extend_allocation(clusters_to_add);
722 status = vb->vb_access(handle, INODE_CACHE(inode), vb->vb_bh,
723 OCFS2_JOURNAL_ACCESS_WRITE);
729 prev_clusters = le32_to_cpu(vb->vb_xv->xr_clusters);
730 status = ocfs2_add_clusters_in_btree(handle,
738 if ((status < 0) && (status != -EAGAIN)) {
739 if (status != -ENOSPC)
744 ocfs2_journal_dirty(handle, vb->vb_bh);
746 clusters_to_add -= le32_to_cpu(vb->vb_xv->xr_clusters) -
749 if (why != RESTART_NONE && clusters_to_add) {
751 * We can only fail in case the alloc file doesn't give
752 * up enough clusters.
754 BUG_ON(why == RESTART_META);
756 credits = ocfs2_calc_extend_credits(inode->i_sb,
757 &vb->vb_xv->xr_list);
758 status = ocfs2_extend_trans(handle, credits);
770 static int __ocfs2_remove_xattr_range(struct inode *inode,
771 struct ocfs2_xattr_value_buf *vb,
772 u32 cpos, u32 phys_cpos, u32 len,
773 unsigned int ext_flags,
774 struct ocfs2_xattr_set_ctxt *ctxt)
777 u64 phys_blkno = ocfs2_clusters_to_blocks(inode->i_sb, phys_cpos);
778 handle_t *handle = ctxt->handle;
779 struct ocfs2_extent_tree et;
781 ocfs2_init_xattr_value_extent_tree(&et, INODE_CACHE(inode), vb);
783 ret = vb->vb_access(handle, INODE_CACHE(inode), vb->vb_bh,
784 OCFS2_JOURNAL_ACCESS_WRITE);
790 ret = ocfs2_remove_extent(handle, &et, cpos, len, ctxt->meta_ac,
797 le32_add_cpu(&vb->vb_xv->xr_clusters, -len);
798 ocfs2_journal_dirty(handle, vb->vb_bh);
800 if (ext_flags & OCFS2_EXT_REFCOUNTED)
801 ret = ocfs2_decrease_refcount(inode, handle,
802 ocfs2_blocks_to_clusters(inode->i_sb,
804 len, ctxt->meta_ac, &ctxt->dealloc, 1);
806 ret = ocfs2_cache_cluster_dealloc(&ctxt->dealloc,
815 static int ocfs2_xattr_shrink_size(struct inode *inode,
818 struct ocfs2_xattr_value_buf *vb,
819 struct ocfs2_xattr_set_ctxt *ctxt)
822 unsigned int ext_flags;
823 u32 trunc_len, cpos, phys_cpos, alloc_size;
826 if (old_clusters <= new_clusters)
830 trunc_len = old_clusters - new_clusters;
832 ret = ocfs2_xattr_get_clusters(inode, cpos, &phys_cpos,
834 &vb->vb_xv->xr_list, &ext_flags);
840 if (alloc_size > trunc_len)
841 alloc_size = trunc_len;
843 ret = __ocfs2_remove_xattr_range(inode, vb, cpos,
844 phys_cpos, alloc_size,
851 block = ocfs2_clusters_to_blocks(inode->i_sb, phys_cpos);
852 ocfs2_remove_xattr_clusters_from_cache(INODE_CACHE(inode),
855 trunc_len -= alloc_size;
862 static int ocfs2_xattr_value_truncate(struct inode *inode,
863 struct ocfs2_xattr_value_buf *vb,
865 struct ocfs2_xattr_set_ctxt *ctxt)
868 u32 new_clusters = ocfs2_clusters_for_bytes(inode->i_sb, len);
869 u32 old_clusters = le32_to_cpu(vb->vb_xv->xr_clusters);
871 if (new_clusters == old_clusters)
874 if (new_clusters > old_clusters)
875 ret = ocfs2_xattr_extend_allocation(inode,
876 new_clusters - old_clusters,
879 ret = ocfs2_xattr_shrink_size(inode,
880 old_clusters, new_clusters,
886 static int ocfs2_xattr_list_entry(char *buffer, size_t size,
887 size_t *result, const char *prefix,
888 const char *name, int name_len)
890 char *p = buffer + *result;
891 int prefix_len = strlen(prefix);
892 int total_len = prefix_len + name_len + 1;
894 *result += total_len;
896 /* we are just looking for how big our buffer needs to be */
903 memcpy(p, prefix, prefix_len);
904 memcpy(p + prefix_len, name, name_len);
905 p[prefix_len + name_len] = '\0';
910 static int ocfs2_xattr_list_entries(struct inode *inode,
911 struct ocfs2_xattr_header *header,
912 char *buffer, size_t buffer_size)
916 const char *prefix, *name;
918 for (i = 0 ; i < le16_to_cpu(header->xh_count); i++) {
919 struct ocfs2_xattr_entry *entry = &header->xh_entries[i];
920 type = ocfs2_xattr_get_type(entry);
921 prefix = ocfs2_xattr_prefix(type);
924 name = (const char *)header +
925 le16_to_cpu(entry->xe_name_offset);
927 ret = ocfs2_xattr_list_entry(buffer, buffer_size,
928 &result, prefix, name,
938 int ocfs2_has_inline_xattr_value_outside(struct inode *inode,
939 struct ocfs2_dinode *di)
941 struct ocfs2_xattr_header *xh;
944 xh = (struct ocfs2_xattr_header *)
945 ((void *)di + inode->i_sb->s_blocksize -
946 le16_to_cpu(di->i_xattr_inline_size));
948 for (i = 0; i < le16_to_cpu(xh->xh_count); i++)
949 if (!ocfs2_xattr_is_local(&xh->xh_entries[i]))
955 static int ocfs2_xattr_ibody_list(struct inode *inode,
956 struct ocfs2_dinode *di,
960 struct ocfs2_xattr_header *header = NULL;
961 struct ocfs2_inode_info *oi = OCFS2_I(inode);
964 if (!(oi->ip_dyn_features & OCFS2_INLINE_XATTR_FL))
967 header = (struct ocfs2_xattr_header *)
968 ((void *)di + inode->i_sb->s_blocksize -
969 le16_to_cpu(di->i_xattr_inline_size));
971 ret = ocfs2_xattr_list_entries(inode, header, buffer, buffer_size);
976 static int ocfs2_xattr_block_list(struct inode *inode,
977 struct ocfs2_dinode *di,
981 struct buffer_head *blk_bh = NULL;
982 struct ocfs2_xattr_block *xb;
985 if (!di->i_xattr_loc)
988 ret = ocfs2_read_xattr_block(inode, le64_to_cpu(di->i_xattr_loc),
995 xb = (struct ocfs2_xattr_block *)blk_bh->b_data;
996 if (!(le16_to_cpu(xb->xb_flags) & OCFS2_XATTR_INDEXED)) {
997 struct ocfs2_xattr_header *header = &xb->xb_attrs.xb_header;
998 ret = ocfs2_xattr_list_entries(inode, header,
999 buffer, buffer_size);
1001 ret = ocfs2_xattr_tree_list_index_block(inode, blk_bh,
1002 buffer, buffer_size);
1009 ssize_t ocfs2_listxattr(struct dentry *dentry,
1013 int ret = 0, i_ret = 0, b_ret = 0;
1014 struct buffer_head *di_bh = NULL;
1015 struct ocfs2_dinode *di = NULL;
1016 struct ocfs2_inode_info *oi = OCFS2_I(dentry->d_inode);
1018 if (!ocfs2_supports_xattr(OCFS2_SB(dentry->d_sb)))
1021 if (!(oi->ip_dyn_features & OCFS2_HAS_XATTR_FL))
1024 ret = ocfs2_inode_lock(dentry->d_inode, &di_bh, 0);
1030 di = (struct ocfs2_dinode *)di_bh->b_data;
1032 down_read(&oi->ip_xattr_sem);
1033 i_ret = ocfs2_xattr_ibody_list(dentry->d_inode, di, buffer, size);
1041 b_ret = ocfs2_xattr_block_list(dentry->d_inode, di,
1046 up_read(&oi->ip_xattr_sem);
1047 ocfs2_inode_unlock(dentry->d_inode, 0);
1051 return i_ret + b_ret;
1054 static int ocfs2_xattr_find_entry(int name_index,
1056 struct ocfs2_xattr_search *xs)
1058 struct ocfs2_xattr_entry *entry;
1065 name_len = strlen(name);
1067 for (i = 0; i < le16_to_cpu(xs->header->xh_count); i++) {
1068 cmp = name_index - ocfs2_xattr_get_type(entry);
1070 cmp = name_len - entry->xe_name_len;
1072 cmp = memcmp(name, (xs->base +
1073 le16_to_cpu(entry->xe_name_offset)),
1081 return cmp ? -ENODATA : 0;
1084 static int ocfs2_xattr_get_value_outside(struct inode *inode,
1085 struct ocfs2_xattr_value_root *xv,
1089 u32 cpos, p_cluster, num_clusters, bpc, clusters;
1092 size_t cplen, blocksize;
1093 struct buffer_head *bh = NULL;
1094 struct ocfs2_extent_list *el;
1097 clusters = le32_to_cpu(xv->xr_clusters);
1098 bpc = ocfs2_clusters_to_blocks(inode->i_sb, 1);
1099 blocksize = inode->i_sb->s_blocksize;
1102 while (cpos < clusters) {
1103 ret = ocfs2_xattr_get_clusters(inode, cpos, &p_cluster,
1104 &num_clusters, el, NULL);
1110 blkno = ocfs2_clusters_to_blocks(inode->i_sb, p_cluster);
1111 /* Copy ocfs2_xattr_value */
1112 for (i = 0; i < num_clusters * bpc; i++, blkno++) {
1113 ret = ocfs2_read_block(INODE_CACHE(inode), blkno,
1120 cplen = len >= blocksize ? blocksize : len;
1121 memcpy(buffer, bh->b_data, cplen);
1130 cpos += num_clusters;
1136 static int ocfs2_xattr_ibody_get(struct inode *inode,
1141 struct ocfs2_xattr_search *xs)
1143 struct ocfs2_inode_info *oi = OCFS2_I(inode);
1144 struct ocfs2_dinode *di = (struct ocfs2_dinode *)xs->inode_bh->b_data;
1145 struct ocfs2_xattr_value_root *xv;
1149 if (!(oi->ip_dyn_features & OCFS2_INLINE_XATTR_FL))
1152 xs->end = (void *)di + inode->i_sb->s_blocksize;
1153 xs->header = (struct ocfs2_xattr_header *)
1154 (xs->end - le16_to_cpu(di->i_xattr_inline_size));
1155 xs->base = (void *)xs->header;
1156 xs->here = xs->header->xh_entries;
1158 ret = ocfs2_xattr_find_entry(name_index, name, xs);
1161 size = le64_to_cpu(xs->here->xe_value_size);
1163 if (size > buffer_size)
1165 if (ocfs2_xattr_is_local(xs->here)) {
1166 memcpy(buffer, (void *)xs->base +
1167 le16_to_cpu(xs->here->xe_name_offset) +
1168 OCFS2_XATTR_SIZE(xs->here->xe_name_len), size);
1170 xv = (struct ocfs2_xattr_value_root *)
1171 (xs->base + le16_to_cpu(
1172 xs->here->xe_name_offset) +
1173 OCFS2_XATTR_SIZE(xs->here->xe_name_len));
1174 ret = ocfs2_xattr_get_value_outside(inode, xv,
1186 static int ocfs2_xattr_block_get(struct inode *inode,
1191 struct ocfs2_xattr_search *xs)
1193 struct ocfs2_xattr_block *xb;
1194 struct ocfs2_xattr_value_root *xv;
1196 int ret = -ENODATA, name_offset, name_len, i;
1197 int uninitialized_var(block_off);
1199 xs->bucket = ocfs2_xattr_bucket_new(inode);
1206 ret = ocfs2_xattr_block_find(inode, name_index, name, xs);
1212 if (xs->not_found) {
1217 xb = (struct ocfs2_xattr_block *)xs->xattr_bh->b_data;
1218 size = le64_to_cpu(xs->here->xe_value_size);
1221 if (size > buffer_size)
1224 name_offset = le16_to_cpu(xs->here->xe_name_offset);
1225 name_len = OCFS2_XATTR_SIZE(xs->here->xe_name_len);
1226 i = xs->here - xs->header->xh_entries;
1228 if (le16_to_cpu(xb->xb_flags) & OCFS2_XATTR_INDEXED) {
1229 ret = ocfs2_xattr_bucket_get_name_value(inode->i_sb,
1230 bucket_xh(xs->bucket),
1234 xs->base = bucket_block(xs->bucket, block_off);
1236 if (ocfs2_xattr_is_local(xs->here)) {
1237 memcpy(buffer, (void *)xs->base +
1238 name_offset + name_len, size);
1240 xv = (struct ocfs2_xattr_value_root *)
1241 (xs->base + name_offset + name_len);
1242 ret = ocfs2_xattr_get_value_outside(inode, xv,
1252 ocfs2_xattr_bucket_free(xs->bucket);
1254 brelse(xs->xattr_bh);
1255 xs->xattr_bh = NULL;
1259 int ocfs2_xattr_get_nolock(struct inode *inode,
1260 struct buffer_head *di_bh,
1267 struct ocfs2_dinode *di = NULL;
1268 struct ocfs2_inode_info *oi = OCFS2_I(inode);
1269 struct ocfs2_xattr_search xis = {
1270 .not_found = -ENODATA,
1272 struct ocfs2_xattr_search xbs = {
1273 .not_found = -ENODATA,
1276 if (!ocfs2_supports_xattr(OCFS2_SB(inode->i_sb)))
1279 if (!(oi->ip_dyn_features & OCFS2_HAS_XATTR_FL))
1282 xis.inode_bh = xbs.inode_bh = di_bh;
1283 di = (struct ocfs2_dinode *)di_bh->b_data;
1285 ret = ocfs2_xattr_ibody_get(inode, name_index, name, buffer,
1287 if (ret == -ENODATA && di->i_xattr_loc)
1288 ret = ocfs2_xattr_block_get(inode, name_index, name, buffer,
1294 /* ocfs2_xattr_get()
1296 * Copy an extended attribute into the buffer provided.
1297 * Buffer is NULL to compute the size of buffer required.
1299 static int ocfs2_xattr_get(struct inode *inode,
1306 struct buffer_head *di_bh = NULL;
1308 ret = ocfs2_inode_lock(inode, &di_bh, 0);
1313 down_read(&OCFS2_I(inode)->ip_xattr_sem);
1314 ret = ocfs2_xattr_get_nolock(inode, di_bh, name_index,
1315 name, buffer, buffer_size);
1316 up_read(&OCFS2_I(inode)->ip_xattr_sem);
1318 ocfs2_inode_unlock(inode, 0);
1325 static int __ocfs2_xattr_set_value_outside(struct inode *inode,
1327 struct ocfs2_xattr_value_buf *vb,
1331 int ret = 0, i, cp_len;
1332 u16 blocksize = inode->i_sb->s_blocksize;
1333 u32 p_cluster, num_clusters;
1334 u32 cpos = 0, bpc = ocfs2_clusters_to_blocks(inode->i_sb, 1);
1335 u32 clusters = ocfs2_clusters_for_bytes(inode->i_sb, value_len);
1337 struct buffer_head *bh = NULL;
1338 unsigned int ext_flags;
1339 struct ocfs2_xattr_value_root *xv = vb->vb_xv;
1341 BUG_ON(clusters > le32_to_cpu(xv->xr_clusters));
1343 while (cpos < clusters) {
1344 ret = ocfs2_xattr_get_clusters(inode, cpos, &p_cluster,
1345 &num_clusters, &xv->xr_list,
1352 BUG_ON(ext_flags & OCFS2_EXT_REFCOUNTED);
1354 blkno = ocfs2_clusters_to_blocks(inode->i_sb, p_cluster);
1356 for (i = 0; i < num_clusters * bpc; i++, blkno++) {
1357 ret = ocfs2_read_block(INODE_CACHE(inode), blkno,
1364 ret = ocfs2_journal_access(handle,
1367 OCFS2_JOURNAL_ACCESS_WRITE);
1373 cp_len = value_len > blocksize ? blocksize : value_len;
1374 memcpy(bh->b_data, value, cp_len);
1375 value_len -= cp_len;
1377 if (cp_len < blocksize)
1378 memset(bh->b_data + cp_len, 0,
1379 blocksize - cp_len);
1381 ocfs2_journal_dirty(handle, bh);
1386 * XXX: do we need to empty all the following
1387 * blocks in this cluster?
1392 cpos += num_clusters;
1400 static int ocfs2_xa_check_space_helper(int needed_space, int free_start,
1408 free_space = free_start -
1409 sizeof(struct ocfs2_xattr_header) -
1410 (num_entries * sizeof(struct ocfs2_xattr_entry)) -
1411 OCFS2_XATTR_HEADER_GAP;
1414 if (free_space < needed_space)
1420 static int ocfs2_xa_journal_access(handle_t *handle, struct ocfs2_xa_loc *loc,
1423 return loc->xl_ops->xlo_journal_access(handle, loc, type);
1426 static void ocfs2_xa_journal_dirty(handle_t *handle, struct ocfs2_xa_loc *loc)
1428 loc->xl_ops->xlo_journal_dirty(handle, loc);
1431 /* Give a pointer into the storage for the given offset */
1432 static void *ocfs2_xa_offset_pointer(struct ocfs2_xa_loc *loc, int offset)
1434 BUG_ON(offset >= loc->xl_size);
1435 return loc->xl_ops->xlo_offset_pointer(loc, offset);
1439 * Wipe the name+value pair and allow the storage to reclaim it. This
1440 * must be followed by either removal of the entry or a call to
1441 * ocfs2_xa_add_namevalue().
1443 static void ocfs2_xa_wipe_namevalue(struct ocfs2_xa_loc *loc)
1445 loc->xl_ops->xlo_wipe_namevalue(loc);
1449 * Find lowest offset to a name+value pair. This is the start of our
1450 * downward-growing free space.
1452 static int ocfs2_xa_get_free_start(struct ocfs2_xa_loc *loc)
1454 return loc->xl_ops->xlo_get_free_start(loc);
1457 /* Can we reuse loc->xl_entry for xi? */
1458 static int ocfs2_xa_can_reuse_entry(struct ocfs2_xa_loc *loc,
1459 struct ocfs2_xattr_info *xi)
1461 return loc->xl_ops->xlo_can_reuse(loc, xi);
1464 /* How much free space is needed to set the new value */
1465 static int ocfs2_xa_check_space(struct ocfs2_xa_loc *loc,
1466 struct ocfs2_xattr_info *xi)
1468 return loc->xl_ops->xlo_check_space(loc, xi);
1471 static void ocfs2_xa_add_entry(struct ocfs2_xa_loc *loc, u32 name_hash)
1473 loc->xl_ops->xlo_add_entry(loc, name_hash);
1474 loc->xl_entry->xe_name_hash = cpu_to_le32(name_hash);
1476 * We can't leave the new entry's xe_name_offset at zero or
1477 * add_namevalue() will go nuts. We set it to the size of our
1478 * storage so that it can never be less than any other entry.
1480 loc->xl_entry->xe_name_offset = cpu_to_le16(loc->xl_size);
1483 static void ocfs2_xa_add_namevalue(struct ocfs2_xa_loc *loc,
1484 struct ocfs2_xattr_info *xi)
1486 int size = namevalue_size_xi(xi);
1490 loc->xl_ops->xlo_add_namevalue(loc, size);
1491 loc->xl_entry->xe_value_size = cpu_to_le64(xi->xi_value_len);
1492 loc->xl_entry->xe_name_len = xi->xi_name_len;
1493 ocfs2_xattr_set_type(loc->xl_entry, xi->xi_name_index);
1494 ocfs2_xattr_set_local(loc->xl_entry,
1495 xi->xi_value_len <= OCFS2_XATTR_INLINE_SIZE);
1497 nameval_offset = le16_to_cpu(loc->xl_entry->xe_name_offset);
1498 nameval_buf = ocfs2_xa_offset_pointer(loc, nameval_offset);
1499 memset(nameval_buf, 0, size);
1500 memcpy(nameval_buf, xi->xi_name, xi->xi_name_len);
1503 static void ocfs2_xa_fill_value_buf(struct ocfs2_xa_loc *loc,
1504 struct ocfs2_xattr_value_buf *vb)
1506 int nameval_offset = le16_to_cpu(loc->xl_entry->xe_name_offset);
1507 int name_size = OCFS2_XATTR_SIZE(loc->xl_entry->xe_name_len);
1509 /* Value bufs are for value trees */
1510 BUG_ON(ocfs2_xattr_is_local(loc->xl_entry));
1511 BUG_ON(namevalue_size_xe(loc->xl_entry) !=
1512 (name_size + OCFS2_XATTR_ROOT_SIZE));
1514 loc->xl_ops->xlo_fill_value_buf(loc, vb);
1516 (struct ocfs2_xattr_value_root *)ocfs2_xa_offset_pointer(loc,
1521 static int ocfs2_xa_block_journal_access(handle_t *handle,
1522 struct ocfs2_xa_loc *loc, int type)
1524 struct buffer_head *bh = loc->xl_storage;
1525 ocfs2_journal_access_func access;
1527 if (loc->xl_size == (bh->b_size -
1528 offsetof(struct ocfs2_xattr_block,
1529 xb_attrs.xb_header)))
1530 access = ocfs2_journal_access_xb;
1532 access = ocfs2_journal_access_di;
1533 return access(handle, INODE_CACHE(loc->xl_inode), bh, type);
1536 static void ocfs2_xa_block_journal_dirty(handle_t *handle,
1537 struct ocfs2_xa_loc *loc)
1539 struct buffer_head *bh = loc->xl_storage;
1541 ocfs2_journal_dirty(handle, bh);
1544 static void *ocfs2_xa_block_offset_pointer(struct ocfs2_xa_loc *loc,
1547 return (char *)loc->xl_header + offset;
1550 static int ocfs2_xa_block_can_reuse(struct ocfs2_xa_loc *loc,
1551 struct ocfs2_xattr_info *xi)
1554 * Block storage is strict. If the sizes aren't exact, we will
1555 * remove the old one and reinsert the new.
1557 return namevalue_size_xe(loc->xl_entry) ==
1558 namevalue_size_xi(xi);
1561 static int ocfs2_xa_block_get_free_start(struct ocfs2_xa_loc *loc)
1563 struct ocfs2_xattr_header *xh = loc->xl_header;
1564 int i, count = le16_to_cpu(xh->xh_count);
1565 int offset, free_start = loc->xl_size;
1567 for (i = 0; i < count; i++) {
1568 offset = le16_to_cpu(xh->xh_entries[i].xe_name_offset);
1569 if (offset < free_start)
1570 free_start = offset;
1576 static int ocfs2_xa_block_check_space(struct ocfs2_xa_loc *loc,
1577 struct ocfs2_xattr_info *xi)
1579 int count = le16_to_cpu(loc->xl_header->xh_count);
1580 int free_start = ocfs2_xa_get_free_start(loc);
1581 int needed_space = ocfs2_xi_entry_usage(xi);
1584 * Block storage will reclaim the original entry before inserting
1585 * the new value, so we only need the difference. If the new
1586 * entry is smaller than the old one, we don't need anything.
1588 if (loc->xl_entry) {
1589 /* Don't need space if we're reusing! */
1590 if (ocfs2_xa_can_reuse_entry(loc, xi))
1593 needed_space -= ocfs2_xe_entry_usage(loc->xl_entry);
1595 if (needed_space < 0)
1597 return ocfs2_xa_check_space_helper(needed_space, free_start, count);
1601 * Block storage for xattrs keeps the name+value pairs compacted. When
1602 * we remove one, we have to shift any that preceded it towards the end.
1604 static void ocfs2_xa_block_wipe_namevalue(struct ocfs2_xa_loc *loc)
1607 int namevalue_offset, first_namevalue_offset, namevalue_size;
1608 struct ocfs2_xattr_entry *entry = loc->xl_entry;
1609 struct ocfs2_xattr_header *xh = loc->xl_header;
1610 int count = le16_to_cpu(xh->xh_count);
1612 namevalue_offset = le16_to_cpu(entry->xe_name_offset);
1613 namevalue_size = namevalue_size_xe(entry);
1614 first_namevalue_offset = ocfs2_xa_get_free_start(loc);
1616 /* Shift the name+value pairs */
1617 memmove((char *)xh + first_namevalue_offset + namevalue_size,
1618 (char *)xh + first_namevalue_offset,
1619 namevalue_offset - first_namevalue_offset);
1620 memset((char *)xh + first_namevalue_offset, 0, namevalue_size);
1622 /* Now tell xh->xh_entries about it */
1623 for (i = 0; i < count; i++) {
1624 offset = le16_to_cpu(xh->xh_entries[i].xe_name_offset);
1625 if (offset <= namevalue_offset)
1626 le16_add_cpu(&xh->xh_entries[i].xe_name_offset,
1631 * Note that we don't update xh_free_start or xh_name_value_len
1632 * because they're not used in block-stored xattrs.
1636 static void ocfs2_xa_block_add_entry(struct ocfs2_xa_loc *loc, u32 name_hash)
1638 int count = le16_to_cpu(loc->xl_header->xh_count);
1639 loc->xl_entry = &(loc->xl_header->xh_entries[count]);
1640 le16_add_cpu(&loc->xl_header->xh_count, 1);
1641 memset(loc->xl_entry, 0, sizeof(struct ocfs2_xattr_entry));
1644 static void ocfs2_xa_block_add_namevalue(struct ocfs2_xa_loc *loc, int size)
1646 int free_start = ocfs2_xa_get_free_start(loc);
1648 loc->xl_entry->xe_name_offset = cpu_to_le16(free_start - size);
1651 static void ocfs2_xa_block_fill_value_buf(struct ocfs2_xa_loc *loc,
1652 struct ocfs2_xattr_value_buf *vb)
1654 struct buffer_head *bh = loc->xl_storage;
1656 if (loc->xl_size == (bh->b_size -
1657 offsetof(struct ocfs2_xattr_block,
1658 xb_attrs.xb_header)))
1659 vb->vb_access = ocfs2_journal_access_xb;
1661 vb->vb_access = ocfs2_journal_access_di;
1666 * Operations for xattrs stored in blocks. This includes inline inode
1667 * storage and unindexed ocfs2_xattr_blocks.
1669 static const struct ocfs2_xa_loc_operations ocfs2_xa_block_loc_ops = {
1670 .xlo_journal_access = ocfs2_xa_block_journal_access,
1671 .xlo_journal_dirty = ocfs2_xa_block_journal_dirty,
1672 .xlo_offset_pointer = ocfs2_xa_block_offset_pointer,
1673 .xlo_check_space = ocfs2_xa_block_check_space,
1674 .xlo_can_reuse = ocfs2_xa_block_can_reuse,
1675 .xlo_get_free_start = ocfs2_xa_block_get_free_start,
1676 .xlo_wipe_namevalue = ocfs2_xa_block_wipe_namevalue,
1677 .xlo_add_entry = ocfs2_xa_block_add_entry,
1678 .xlo_add_namevalue = ocfs2_xa_block_add_namevalue,
1679 .xlo_fill_value_buf = ocfs2_xa_block_fill_value_buf,
1682 static int ocfs2_xa_bucket_journal_access(handle_t *handle,
1683 struct ocfs2_xa_loc *loc, int type)
1685 struct ocfs2_xattr_bucket *bucket = loc->xl_storage;
1687 return ocfs2_xattr_bucket_journal_access(handle, bucket, type);
1690 static void ocfs2_xa_bucket_journal_dirty(handle_t *handle,
1691 struct ocfs2_xa_loc *loc)
1693 struct ocfs2_xattr_bucket *bucket = loc->xl_storage;
1695 ocfs2_xattr_bucket_journal_dirty(handle, bucket);
1698 static void *ocfs2_xa_bucket_offset_pointer(struct ocfs2_xa_loc *loc,
1701 struct ocfs2_xattr_bucket *bucket = loc->xl_storage;
1702 int block, block_offset;
1704 /* The header is at the front of the bucket */
1705 block = offset >> loc->xl_inode->i_sb->s_blocksize_bits;
1706 block_offset = offset % loc->xl_inode->i_sb->s_blocksize;
1708 return bucket_block(bucket, block) + block_offset;
1711 static int ocfs2_xa_bucket_can_reuse(struct ocfs2_xa_loc *loc,
1712 struct ocfs2_xattr_info *xi)
1714 return namevalue_size_xe(loc->xl_entry) >=
1715 namevalue_size_xi(xi);
1718 static int ocfs2_xa_bucket_get_free_start(struct ocfs2_xa_loc *loc)
1720 struct ocfs2_xattr_bucket *bucket = loc->xl_storage;
1721 return le16_to_cpu(bucket_xh(bucket)->xh_free_start);
1724 static int ocfs2_bucket_align_free_start(struct super_block *sb,
1725 int free_start, int size)
1728 * We need to make sure that the name+value pair fits within
1731 if (((free_start - size) >> sb->s_blocksize_bits) !=
1732 ((free_start - 1) >> sb->s_blocksize_bits))
1733 free_start -= free_start % sb->s_blocksize;
1738 static int ocfs2_xa_bucket_check_space(struct ocfs2_xa_loc *loc,
1739 struct ocfs2_xattr_info *xi)
1742 int count = le16_to_cpu(loc->xl_header->xh_count);
1743 int free_start = ocfs2_xa_get_free_start(loc);
1744 int needed_space = ocfs2_xi_entry_usage(xi);
1745 int size = namevalue_size_xi(xi);
1746 struct super_block *sb = loc->xl_inode->i_sb;
1749 * Bucket storage does not reclaim name+value pairs it cannot
1750 * reuse. They live as holes until the bucket fills, and then
1751 * the bucket is defragmented. However, the bucket can reclaim
1752 * the ocfs2_xattr_entry.
1754 if (loc->xl_entry) {
1755 /* Don't need space if we're reusing! */
1756 if (ocfs2_xa_can_reuse_entry(loc, xi))
1759 needed_space -= sizeof(struct ocfs2_xattr_entry);
1761 BUG_ON(needed_space < 0);
1763 if (free_start < size) {
1768 * First we check if it would fit in the first place.
1769 * Below, we align the free start to a block. This may
1770 * slide us below the minimum gap. By checking unaligned
1771 * first, we avoid that error.
1773 rc = ocfs2_xa_check_space_helper(needed_space, free_start,
1777 free_start = ocfs2_bucket_align_free_start(sb, free_start,
1780 return ocfs2_xa_check_space_helper(needed_space, free_start, count);
1783 static void ocfs2_xa_bucket_wipe_namevalue(struct ocfs2_xa_loc *loc)
1785 le16_add_cpu(&loc->xl_header->xh_name_value_len,
1786 -namevalue_size_xe(loc->xl_entry));
1789 static void ocfs2_xa_bucket_add_entry(struct ocfs2_xa_loc *loc, u32 name_hash)
1791 struct ocfs2_xattr_header *xh = loc->xl_header;
1792 int count = le16_to_cpu(xh->xh_count);
1793 int low = 0, high = count - 1, tmp;
1794 struct ocfs2_xattr_entry *tmp_xe;
1797 * We keep buckets sorted by name_hash, so we need to find
1800 while (low <= high && count) {
1801 tmp = (low + high) / 2;
1802 tmp_xe = &xh->xh_entries[tmp];
1804 if (name_hash > le32_to_cpu(tmp_xe->xe_name_hash))
1806 else if (name_hash < le32_to_cpu(tmp_xe->xe_name_hash))
1815 memmove(&xh->xh_entries[low + 1],
1816 &xh->xh_entries[low],
1817 ((count - low) * sizeof(struct ocfs2_xattr_entry)));
1819 le16_add_cpu(&xh->xh_count, 1);
1820 loc->xl_entry = &xh->xh_entries[low];
1821 memset(loc->xl_entry, 0, sizeof(struct ocfs2_xattr_entry));
1824 static void ocfs2_xa_bucket_add_namevalue(struct ocfs2_xa_loc *loc, int size)
1826 int free_start = ocfs2_xa_get_free_start(loc);
1827 struct ocfs2_xattr_header *xh = loc->xl_header;
1828 struct super_block *sb = loc->xl_inode->i_sb;
1831 free_start = ocfs2_bucket_align_free_start(sb, free_start, size);
1832 nameval_offset = free_start - size;
1833 loc->xl_entry->xe_name_offset = cpu_to_le16(nameval_offset);
1834 xh->xh_free_start = cpu_to_le16(nameval_offset);
1835 le16_add_cpu(&xh->xh_name_value_len, size);
1839 static void ocfs2_xa_bucket_fill_value_buf(struct ocfs2_xa_loc *loc,
1840 struct ocfs2_xattr_value_buf *vb)
1842 struct ocfs2_xattr_bucket *bucket = loc->xl_storage;
1843 struct super_block *sb = loc->xl_inode->i_sb;
1844 int nameval_offset = le16_to_cpu(loc->xl_entry->xe_name_offset);
1845 int size = namevalue_size_xe(loc->xl_entry);
1846 int block_offset = nameval_offset >> sb->s_blocksize_bits;
1848 /* Values are not allowed to straddle block boundaries */
1849 BUG_ON(block_offset !=
1850 ((nameval_offset + size - 1) >> sb->s_blocksize_bits));
1851 /* We expect the bucket to be filled in */
1852 BUG_ON(!bucket->bu_bhs[block_offset]);
1854 vb->vb_access = ocfs2_journal_access;
1855 vb->vb_bh = bucket->bu_bhs[block_offset];
1858 /* Operations for xattrs stored in buckets. */
1859 static const struct ocfs2_xa_loc_operations ocfs2_xa_bucket_loc_ops = {
1860 .xlo_journal_access = ocfs2_xa_bucket_journal_access,
1861 .xlo_journal_dirty = ocfs2_xa_bucket_journal_dirty,
1862 .xlo_offset_pointer = ocfs2_xa_bucket_offset_pointer,
1863 .xlo_check_space = ocfs2_xa_bucket_check_space,
1864 .xlo_can_reuse = ocfs2_xa_bucket_can_reuse,
1865 .xlo_get_free_start = ocfs2_xa_bucket_get_free_start,
1866 .xlo_wipe_namevalue = ocfs2_xa_bucket_wipe_namevalue,
1867 .xlo_add_entry = ocfs2_xa_bucket_add_entry,
1868 .xlo_add_namevalue = ocfs2_xa_bucket_add_namevalue,
1869 .xlo_fill_value_buf = ocfs2_xa_bucket_fill_value_buf,
1872 static unsigned int ocfs2_xa_value_clusters(struct ocfs2_xa_loc *loc)
1874 struct ocfs2_xattr_value_buf vb;
1876 if (ocfs2_xattr_is_local(loc->xl_entry))
1879 ocfs2_xa_fill_value_buf(loc, &vb);
1880 return le32_to_cpu(vb.vb_xv->xr_clusters);
1883 static int ocfs2_xa_value_truncate(struct ocfs2_xa_loc *loc, u64 bytes,
1884 struct ocfs2_xattr_set_ctxt *ctxt)
1886 int trunc_rc, access_rc;
1887 struct ocfs2_xattr_value_buf vb;
1889 ocfs2_xa_fill_value_buf(loc, &vb);
1890 trunc_rc = ocfs2_xattr_value_truncate(loc->xl_inode, &vb, bytes,
1894 * The caller of ocfs2_xa_value_truncate() has already called
1895 * ocfs2_xa_journal_access on the loc. However, The truncate code
1896 * calls ocfs2_extend_trans(). This may commit the previous
1897 * transaction and open a new one. If this is a bucket, truncate
1898 * could leave only vb->vb_bh set up for journaling. Meanwhile,
1899 * the caller is expecting to dirty the entire bucket. So we must
1900 * reset the journal work. We do this even if truncate has failed,
1901 * as it could have failed after committing the extend.
1903 access_rc = ocfs2_xa_journal_access(ctxt->handle, loc,
1904 OCFS2_JOURNAL_ACCESS_WRITE);
1906 /* Errors in truncate take precedence */
1907 return trunc_rc ? trunc_rc : access_rc;
1910 static void ocfs2_xa_remove_entry(struct ocfs2_xa_loc *loc)
1913 struct ocfs2_xattr_header *xh = loc->xl_header;
1914 struct ocfs2_xattr_entry *entry = loc->xl_entry;
1916 ocfs2_xa_wipe_namevalue(loc);
1917 loc->xl_entry = NULL;
1919 le16_add_cpu(&xh->xh_count, -1);
1920 count = le16_to_cpu(xh->xh_count);
1923 * Only zero out the entry if there are more remaining. This is
1924 * important for an empty bucket, as it keeps track of the
1925 * bucket's hash value. It doesn't hurt empty block storage.
1928 index = ((char *)entry - (char *)&xh->xh_entries) /
1929 sizeof(struct ocfs2_xattr_entry);
1930 memmove(&xh->xh_entries[index], &xh->xh_entries[index + 1],
1931 (count - index) * sizeof(struct ocfs2_xattr_entry));
1932 memset(&xh->xh_entries[count], 0,
1933 sizeof(struct ocfs2_xattr_entry));
1938 * If we have a problem adjusting the size of an external value during
1939 * ocfs2_xa_prepare_entry() or ocfs2_xa_remove(), we may have an xattr
1940 * in an intermediate state. For example, the value may be partially
1943 * If the value tree hasn't changed, the extend/truncate went nowhere.
1944 * We have nothing to do. The caller can treat it as a straight error.
1946 * If the value tree got partially truncated, we now have a corrupted
1947 * extended attribute. We're going to wipe its entry and leak the
1948 * clusters. Better to leak some storage than leave a corrupt entry.
1950 * If the value tree grew, it obviously didn't grow enough for the
1951 * new entry. We're not going to try and reclaim those clusters either.
1952 * If there was already an external value there (orig_clusters != 0),
1953 * the new clusters are attached safely and we can just leave the old
1954 * value in place. If there was no external value there, we remove
1957 * This way, the xattr block we store in the journal will be consistent.
1958 * If the size change broke because of the journal, no changes will hit
1961 static void ocfs2_xa_cleanup_value_truncate(struct ocfs2_xa_loc *loc,
1963 unsigned int orig_clusters)
1965 unsigned int new_clusters = ocfs2_xa_value_clusters(loc);
1966 char *nameval_buf = ocfs2_xa_offset_pointer(loc,
1967 le16_to_cpu(loc->xl_entry->xe_name_offset));
1969 if (new_clusters < orig_clusters) {
1971 "Partial truncate while %s xattr %.*s. Leaking "
1972 "%u clusters and removing the entry\n",
1973 what, loc->xl_entry->xe_name_len, nameval_buf,
1974 orig_clusters - new_clusters);
1975 ocfs2_xa_remove_entry(loc);
1976 } else if (!orig_clusters) {
1978 "Unable to allocate an external value for xattr "
1979 "%.*s safely. Leaking %u clusters and removing the "
1981 loc->xl_entry->xe_name_len, nameval_buf,
1982 new_clusters - orig_clusters);
1983 ocfs2_xa_remove_entry(loc);
1984 } else if (new_clusters > orig_clusters)
1986 "Unable to grow xattr %.*s safely. %u new clusters "
1987 "have been added, but the value will not be "
1989 loc->xl_entry->xe_name_len, nameval_buf,
1990 new_clusters - orig_clusters);
1993 static int ocfs2_xa_remove(struct ocfs2_xa_loc *loc,
1994 struct ocfs2_xattr_set_ctxt *ctxt)
1997 unsigned int orig_clusters;
1999 if (!ocfs2_xattr_is_local(loc->xl_entry)) {
2000 orig_clusters = ocfs2_xa_value_clusters(loc);
2001 rc = ocfs2_xa_value_truncate(loc, 0, ctxt);
2005 * Since this is remove, we can return 0 if
2006 * ocfs2_xa_cleanup_value_truncate() is going to
2007 * wipe the entry anyway. So we check the
2008 * cluster count as well.
2010 if (orig_clusters != ocfs2_xa_value_clusters(loc))
2012 ocfs2_xa_cleanup_value_truncate(loc, "removing",
2019 ocfs2_xa_remove_entry(loc);
2025 static void ocfs2_xa_install_value_root(struct ocfs2_xa_loc *loc)
2027 int name_size = OCFS2_XATTR_SIZE(loc->xl_entry->xe_name_len);
2030 nameval_buf = ocfs2_xa_offset_pointer(loc,
2031 le16_to_cpu(loc->xl_entry->xe_name_offset));
2032 memcpy(nameval_buf + name_size, &def_xv, OCFS2_XATTR_ROOT_SIZE);
2036 * Take an existing entry and make it ready for the new value. This
2037 * won't allocate space, but it may free space. It should be ready for
2038 * ocfs2_xa_prepare_entry() to finish the work.
2040 static int ocfs2_xa_reuse_entry(struct ocfs2_xa_loc *loc,
2041 struct ocfs2_xattr_info *xi,
2042 struct ocfs2_xattr_set_ctxt *ctxt)
2045 int name_size = OCFS2_XATTR_SIZE(xi->xi_name_len);
2046 unsigned int orig_clusters;
2048 int xe_local = ocfs2_xattr_is_local(loc->xl_entry);
2049 int xi_local = xi->xi_value_len <= OCFS2_XATTR_INLINE_SIZE;
2051 BUG_ON(OCFS2_XATTR_SIZE(loc->xl_entry->xe_name_len) !=
2054 nameval_buf = ocfs2_xa_offset_pointer(loc,
2055 le16_to_cpu(loc->xl_entry->xe_name_offset));
2057 memset(nameval_buf + name_size, 0,
2058 namevalue_size_xe(loc->xl_entry) - name_size);
2060 ocfs2_xa_install_value_root(loc);
2062 orig_clusters = ocfs2_xa_value_clusters(loc);
2064 rc = ocfs2_xa_value_truncate(loc, 0, ctxt);
2068 memset(nameval_buf + name_size, 0,
2069 namevalue_size_xe(loc->xl_entry) -
2071 } else if (le64_to_cpu(loc->xl_entry->xe_value_size) >
2073 rc = ocfs2_xa_value_truncate(loc, xi->xi_value_len,
2080 ocfs2_xa_cleanup_value_truncate(loc, "reusing",
2086 loc->xl_entry->xe_value_size = cpu_to_le64(xi->xi_value_len);
2087 ocfs2_xattr_set_local(loc->xl_entry, xi_local);
2094 * Prepares loc->xl_entry to receive the new xattr. This includes
2095 * properly setting up the name+value pair region. If loc->xl_entry
2096 * already exists, it will take care of modifying it appropriately.
2098 * Note that this modifies the data. You did journal_access already,
2101 static int ocfs2_xa_prepare_entry(struct ocfs2_xa_loc *loc,
2102 struct ocfs2_xattr_info *xi,
2104 struct ocfs2_xattr_set_ctxt *ctxt)
2107 unsigned int orig_clusters;
2108 __le64 orig_value_size = 0;
2110 rc = ocfs2_xa_check_space(loc, xi);
2114 if (loc->xl_entry) {
2115 if (ocfs2_xa_can_reuse_entry(loc, xi)) {
2116 orig_value_size = loc->xl_entry->xe_value_size;
2117 rc = ocfs2_xa_reuse_entry(loc, xi, ctxt);
2123 if (!ocfs2_xattr_is_local(loc->xl_entry)) {
2124 orig_clusters = ocfs2_xa_value_clusters(loc);
2125 rc = ocfs2_xa_value_truncate(loc, 0, ctxt);
2128 ocfs2_xa_cleanup_value_truncate(loc,
2134 ocfs2_xa_wipe_namevalue(loc);
2136 ocfs2_xa_add_entry(loc, name_hash);
2139 * If we get here, we have a blank entry. Fill it. We grow our
2140 * name+value pair back from the end.
2142 ocfs2_xa_add_namevalue(loc, xi);
2143 if (xi->xi_value_len > OCFS2_XATTR_INLINE_SIZE)
2144 ocfs2_xa_install_value_root(loc);
2147 if (xi->xi_value_len > OCFS2_XATTR_INLINE_SIZE) {
2148 orig_clusters = ocfs2_xa_value_clusters(loc);
2149 rc = ocfs2_xa_value_truncate(loc, xi->xi_value_len, ctxt);
2151 ctxt->set_abort = 1;
2152 ocfs2_xa_cleanup_value_truncate(loc, "growing",
2155 * If we were growing an existing value,
2156 * ocfs2_xa_cleanup_value_truncate() won't remove
2157 * the entry. We need to restore the original value
2160 if (loc->xl_entry) {
2161 BUG_ON(!orig_value_size);
2162 loc->xl_entry->xe_value_size = orig_value_size;
2173 * Store the value portion of the name+value pair. This will skip
2174 * values that are stored externally. Their tree roots were set up
2175 * by ocfs2_xa_prepare_entry().
2177 static int ocfs2_xa_store_value(struct ocfs2_xa_loc *loc,
2178 struct ocfs2_xattr_info *xi,
2179 struct ocfs2_xattr_set_ctxt *ctxt)
2182 int nameval_offset = le16_to_cpu(loc->xl_entry->xe_name_offset);
2183 int name_size = OCFS2_XATTR_SIZE(xi->xi_name_len);
2185 struct ocfs2_xattr_value_buf vb;
2187 nameval_buf = ocfs2_xa_offset_pointer(loc, nameval_offset);
2188 if (xi->xi_value_len > OCFS2_XATTR_INLINE_SIZE) {
2189 ocfs2_xa_fill_value_buf(loc, &vb);
2190 rc = __ocfs2_xattr_set_value_outside(loc->xl_inode,
2195 memcpy(nameval_buf + name_size, xi->xi_value, xi->xi_value_len);
2200 static int ocfs2_xa_set(struct ocfs2_xa_loc *loc,
2201 struct ocfs2_xattr_info *xi,
2202 struct ocfs2_xattr_set_ctxt *ctxt)
2205 u32 name_hash = ocfs2_xattr_name_hash(loc->xl_inode, xi->xi_name,
2208 ret = ocfs2_xa_journal_access(ctxt->handle, loc,
2209 OCFS2_JOURNAL_ACCESS_WRITE);
2216 * From here on out, everything is going to modify the buffer a
2217 * little. Errors are going to leave the xattr header in a
2218 * sane state. Thus, even with errors we dirty the sucker.
2221 /* Don't worry, we are never called with !xi_value and !xl_entry */
2222 if (!xi->xi_value) {
2223 ret = ocfs2_xa_remove(loc, ctxt);
2227 ret = ocfs2_xa_prepare_entry(loc, xi, name_hash, ctxt);
2234 ret = ocfs2_xa_store_value(loc, xi, ctxt);
2239 ocfs2_xa_journal_dirty(ctxt->handle, loc);
2245 static void ocfs2_init_dinode_xa_loc(struct ocfs2_xa_loc *loc,
2246 struct inode *inode,
2247 struct buffer_head *bh,
2248 struct ocfs2_xattr_entry *entry)
2250 struct ocfs2_dinode *di = (struct ocfs2_dinode *)bh->b_data;
2252 BUG_ON(!(OCFS2_I(inode)->ip_dyn_features & OCFS2_INLINE_XATTR_FL));
2254 loc->xl_inode = inode;
2255 loc->xl_ops = &ocfs2_xa_block_loc_ops;
2256 loc->xl_storage = bh;
2257 loc->xl_entry = entry;
2258 loc->xl_size = le16_to_cpu(di->i_xattr_inline_size);
2260 (struct ocfs2_xattr_header *)(bh->b_data + bh->b_size -
2264 static void ocfs2_init_xattr_block_xa_loc(struct ocfs2_xa_loc *loc,
2265 struct inode *inode,
2266 struct buffer_head *bh,
2267 struct ocfs2_xattr_entry *entry)
2269 struct ocfs2_xattr_block *xb =
2270 (struct ocfs2_xattr_block *)bh->b_data;
2272 BUG_ON(le16_to_cpu(xb->xb_flags) & OCFS2_XATTR_INDEXED);
2274 loc->xl_inode = inode;
2275 loc->xl_ops = &ocfs2_xa_block_loc_ops;
2276 loc->xl_storage = bh;
2277 loc->xl_header = &(xb->xb_attrs.xb_header);
2278 loc->xl_entry = entry;
2279 loc->xl_size = bh->b_size - offsetof(struct ocfs2_xattr_block,
2280 xb_attrs.xb_header);
2283 static void ocfs2_init_xattr_bucket_xa_loc(struct ocfs2_xa_loc *loc,
2284 struct ocfs2_xattr_bucket *bucket,
2285 struct ocfs2_xattr_entry *entry)
2287 loc->xl_inode = bucket->bu_inode;
2288 loc->xl_ops = &ocfs2_xa_bucket_loc_ops;
2289 loc->xl_storage = bucket;
2290 loc->xl_header = bucket_xh(bucket);
2291 loc->xl_entry = entry;
2292 loc->xl_size = OCFS2_XATTR_BUCKET_SIZE;
2296 * In xattr remove, if it is stored outside and refcounted, we may have
2297 * the chance to split the refcount tree. So need the allocators.
2299 static int ocfs2_lock_xattr_remove_allocators(struct inode *inode,
2300 struct ocfs2_xattr_value_root *xv,
2301 struct ocfs2_caching_info *ref_ci,
2302 struct buffer_head *ref_root_bh,
2303 struct ocfs2_alloc_context **meta_ac,
2306 int ret, meta_add = 0;
2307 u32 p_cluster, num_clusters;
2308 unsigned int ext_flags;
2311 ret = ocfs2_xattr_get_clusters(inode, 0, &p_cluster,
2320 if (!(ext_flags & OCFS2_EXT_REFCOUNTED))
2323 ret = ocfs2_refcounted_xattr_delete_need(inode, ref_ci,
2325 &meta_add, ref_credits);
2331 ret = ocfs2_reserve_new_metadata_blocks(OCFS2_SB(inode->i_sb),
2340 static int ocfs2_remove_value_outside(struct inode*inode,
2341 struct ocfs2_xattr_value_buf *vb,
2342 struct ocfs2_xattr_header *header,
2343 struct ocfs2_caching_info *ref_ci,
2344 struct buffer_head *ref_root_bh)
2346 int ret = 0, i, ref_credits;
2347 struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
2348 struct ocfs2_xattr_set_ctxt ctxt = { NULL, NULL, };
2351 ocfs2_init_dealloc_ctxt(&ctxt.dealloc);
2353 for (i = 0; i < le16_to_cpu(header->xh_count); i++) {
2354 struct ocfs2_xattr_entry *entry = &header->xh_entries[i];
2356 if (ocfs2_xattr_is_local(entry))
2359 val = (void *)header +
2360 le16_to_cpu(entry->xe_name_offset);
2361 vb->vb_xv = (struct ocfs2_xattr_value_root *)
2362 (val + OCFS2_XATTR_SIZE(entry->xe_name_len));
2364 ret = ocfs2_lock_xattr_remove_allocators(inode, vb->vb_xv,
2365 ref_ci, ref_root_bh,
2369 ctxt.handle = ocfs2_start_trans(osb, ref_credits +
2370 ocfs2_remove_extent_credits(osb->sb));
2371 if (IS_ERR(ctxt.handle)) {
2372 ret = PTR_ERR(ctxt.handle);
2377 ret = ocfs2_xattr_value_truncate(inode, vb, 0, &ctxt);
2379 ocfs2_commit_trans(osb, ctxt.handle);
2381 ocfs2_free_alloc_context(ctxt.meta_ac);
2382 ctxt.meta_ac = NULL;
2393 ocfs2_free_alloc_context(ctxt.meta_ac);
2394 ocfs2_schedule_truncate_log_flush(osb, 1);
2395 ocfs2_run_deallocs(osb, &ctxt.dealloc);
2399 static int ocfs2_xattr_ibody_remove(struct inode *inode,
2400 struct buffer_head *di_bh,
2401 struct ocfs2_caching_info *ref_ci,
2402 struct buffer_head *ref_root_bh)
2405 struct ocfs2_dinode *di = (struct ocfs2_dinode *)di_bh->b_data;
2406 struct ocfs2_xattr_header *header;
2408 struct ocfs2_xattr_value_buf vb = {
2410 .vb_access = ocfs2_journal_access_di,
2413 header = (struct ocfs2_xattr_header *)
2414 ((void *)di + inode->i_sb->s_blocksize -
2415 le16_to_cpu(di->i_xattr_inline_size));
2417 ret = ocfs2_remove_value_outside(inode, &vb, header,
2418 ref_ci, ref_root_bh);
2423 struct ocfs2_rm_xattr_bucket_para {
2424 struct ocfs2_caching_info *ref_ci;
2425 struct buffer_head *ref_root_bh;
2428 static int ocfs2_xattr_block_remove(struct inode *inode,
2429 struct buffer_head *blk_bh,
2430 struct ocfs2_caching_info *ref_ci,
2431 struct buffer_head *ref_root_bh)
2433 struct ocfs2_xattr_block *xb;
2435 struct ocfs2_xattr_value_buf vb = {
2437 .vb_access = ocfs2_journal_access_xb,
2439 struct ocfs2_rm_xattr_bucket_para args = {
2441 .ref_root_bh = ref_root_bh,
2444 xb = (struct ocfs2_xattr_block *)blk_bh->b_data;
2445 if (!(le16_to_cpu(xb->xb_flags) & OCFS2_XATTR_INDEXED)) {
2446 struct ocfs2_xattr_header *header = &(xb->xb_attrs.xb_header);
2447 ret = ocfs2_remove_value_outside(inode, &vb, header,
2448 ref_ci, ref_root_bh);
2450 ret = ocfs2_iterate_xattr_index_block(inode,
2452 ocfs2_rm_xattr_cluster,
2458 static int ocfs2_xattr_free_block(struct inode *inode,
2460 struct ocfs2_caching_info *ref_ci,
2461 struct buffer_head *ref_root_bh)
2463 struct inode *xb_alloc_inode;
2464 struct buffer_head *xb_alloc_bh = NULL;
2465 struct buffer_head *blk_bh = NULL;
2466 struct ocfs2_xattr_block *xb;
2467 struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
2473 ret = ocfs2_read_xattr_block(inode, block, &blk_bh);
2479 ret = ocfs2_xattr_block_remove(inode, blk_bh, ref_ci, ref_root_bh);
2485 xb = (struct ocfs2_xattr_block *)blk_bh->b_data;
2486 blk = le64_to_cpu(xb->xb_blkno);
2487 bit = le16_to_cpu(xb->xb_suballoc_bit);
2488 if (xb->xb_suballoc_loc)
2489 bg_blkno = le64_to_cpu(xb->xb_suballoc_loc);
2491 bg_blkno = ocfs2_which_suballoc_group(blk, bit);
2493 xb_alloc_inode = ocfs2_get_system_file_inode(osb,
2494 EXTENT_ALLOC_SYSTEM_INODE,
2495 le16_to_cpu(xb->xb_suballoc_slot));
2496 if (!xb_alloc_inode) {
2501 mutex_lock(&xb_alloc_inode->i_mutex);
2503 ret = ocfs2_inode_lock(xb_alloc_inode, &xb_alloc_bh, 1);
2509 handle = ocfs2_start_trans(osb, OCFS2_SUBALLOC_FREE);
2510 if (IS_ERR(handle)) {
2511 ret = PTR_ERR(handle);
2516 ret = ocfs2_free_suballoc_bits(handle, xb_alloc_inode, xb_alloc_bh,
2521 ocfs2_commit_trans(osb, handle);
2523 ocfs2_inode_unlock(xb_alloc_inode, 1);
2524 brelse(xb_alloc_bh);
2526 mutex_unlock(&xb_alloc_inode->i_mutex);
2527 iput(xb_alloc_inode);
2534 * ocfs2_xattr_remove()
2536 * Free extended attribute resources associated with this inode.
2538 int ocfs2_xattr_remove(struct inode *inode, struct buffer_head *di_bh)
2540 struct ocfs2_inode_info *oi = OCFS2_I(inode);
2541 struct ocfs2_dinode *di = (struct ocfs2_dinode *)di_bh->b_data;
2542 struct ocfs2_refcount_tree *ref_tree = NULL;
2543 struct buffer_head *ref_root_bh = NULL;
2544 struct ocfs2_caching_info *ref_ci = NULL;
2548 if (!ocfs2_supports_xattr(OCFS2_SB(inode->i_sb)))
2551 if (!(oi->ip_dyn_features & OCFS2_HAS_XATTR_FL))
2554 if (OCFS2_I(inode)->ip_dyn_features & OCFS2_HAS_REFCOUNT_FL) {
2555 ret = ocfs2_lock_refcount_tree(OCFS2_SB(inode->i_sb),
2556 le64_to_cpu(di->i_refcount_loc),
2557 1, &ref_tree, &ref_root_bh);
2562 ref_ci = &ref_tree->rf_ci;
2566 if (oi->ip_dyn_features & OCFS2_INLINE_XATTR_FL) {
2567 ret = ocfs2_xattr_ibody_remove(inode, di_bh,
2568 ref_ci, ref_root_bh);
2575 if (di->i_xattr_loc) {
2576 ret = ocfs2_xattr_free_block(inode,
2577 le64_to_cpu(di->i_xattr_loc),
2578 ref_ci, ref_root_bh);
2585 handle = ocfs2_start_trans((OCFS2_SB(inode->i_sb)),
2586 OCFS2_INODE_UPDATE_CREDITS);
2587 if (IS_ERR(handle)) {
2588 ret = PTR_ERR(handle);
2592 ret = ocfs2_journal_access_di(handle, INODE_CACHE(inode), di_bh,
2593 OCFS2_JOURNAL_ACCESS_WRITE);
2599 di->i_xattr_loc = 0;
2601 spin_lock(&oi->ip_lock);
2602 oi->ip_dyn_features &= ~(OCFS2_INLINE_XATTR_FL | OCFS2_HAS_XATTR_FL);
2603 di->i_dyn_features = cpu_to_le16(oi->ip_dyn_features);
2604 spin_unlock(&oi->ip_lock);
2606 ocfs2_journal_dirty(handle, di_bh);
2608 ocfs2_commit_trans(OCFS2_SB(inode->i_sb), handle);
2611 ocfs2_unlock_refcount_tree(OCFS2_SB(inode->i_sb), ref_tree, 1);
2612 brelse(ref_root_bh);
2616 static int ocfs2_xattr_has_space_inline(struct inode *inode,
2617 struct ocfs2_dinode *di)
2619 struct ocfs2_inode_info *oi = OCFS2_I(inode);
2620 unsigned int xattrsize = OCFS2_SB(inode->i_sb)->s_xattr_inline_size;
2623 if (xattrsize < OCFS2_MIN_XATTR_INLINE_SIZE)
2626 if (oi->ip_dyn_features & OCFS2_INLINE_DATA_FL) {
2627 struct ocfs2_inline_data *idata = &di->id2.i_data;
2628 free = le16_to_cpu(idata->id_count) - le64_to_cpu(di->i_size);
2629 } else if (ocfs2_inode_is_fast_symlink(inode)) {
2630 free = ocfs2_fast_symlink_chars(inode->i_sb) -
2631 le64_to_cpu(di->i_size);
2633 struct ocfs2_extent_list *el = &di->id2.i_list;
2634 free = (le16_to_cpu(el->l_count) -
2635 le16_to_cpu(el->l_next_free_rec)) *
2636 sizeof(struct ocfs2_extent_rec);
2638 if (free >= xattrsize)
2645 * ocfs2_xattr_ibody_find()
2647 * Find extended attribute in inode block and
2648 * fill search info into struct ocfs2_xattr_search.
2650 static int ocfs2_xattr_ibody_find(struct inode *inode,
2653 struct ocfs2_xattr_search *xs)
2655 struct ocfs2_inode_info *oi = OCFS2_I(inode);
2656 struct ocfs2_dinode *di = (struct ocfs2_dinode *)xs->inode_bh->b_data;
2660 if (inode->i_sb->s_blocksize == OCFS2_MIN_BLOCKSIZE)
2663 if (!(oi->ip_dyn_features & OCFS2_INLINE_XATTR_FL)) {
2664 down_read(&oi->ip_alloc_sem);
2665 has_space = ocfs2_xattr_has_space_inline(inode, di);
2666 up_read(&oi->ip_alloc_sem);
2671 xs->xattr_bh = xs->inode_bh;
2672 xs->end = (void *)di + inode->i_sb->s_blocksize;
2673 if (oi->ip_dyn_features & OCFS2_INLINE_XATTR_FL)
2674 xs->header = (struct ocfs2_xattr_header *)
2675 (xs->end - le16_to_cpu(di->i_xattr_inline_size));
2677 xs->header = (struct ocfs2_xattr_header *)
2678 (xs->end - OCFS2_SB(inode->i_sb)->s_xattr_inline_size);
2679 xs->base = (void *)xs->header;
2680 xs->here = xs->header->xh_entries;
2682 /* Find the named attribute. */
2683 if (oi->ip_dyn_features & OCFS2_INLINE_XATTR_FL) {
2684 ret = ocfs2_xattr_find_entry(name_index, name, xs);
2685 if (ret && ret != -ENODATA)
2687 xs->not_found = ret;
2693 static int ocfs2_xattr_ibody_init(struct inode *inode,
2694 struct buffer_head *di_bh,
2695 struct ocfs2_xattr_set_ctxt *ctxt)
2698 struct ocfs2_inode_info *oi = OCFS2_I(inode);
2699 struct ocfs2_dinode *di = (struct ocfs2_dinode *)di_bh->b_data;
2700 struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
2701 unsigned int xattrsize = osb->s_xattr_inline_size;
2703 if (!ocfs2_xattr_has_space_inline(inode, di)) {
2708 ret = ocfs2_journal_access_di(ctxt->handle, INODE_CACHE(inode), di_bh,
2709 OCFS2_JOURNAL_ACCESS_WRITE);
2716 * Adjust extent record count or inline data size
2717 * to reserve space for extended attribute.
2719 if (oi->ip_dyn_features & OCFS2_INLINE_DATA_FL) {
2720 struct ocfs2_inline_data *idata = &di->id2.i_data;
2721 le16_add_cpu(&idata->id_count, -xattrsize);
2722 } else if (!(ocfs2_inode_is_fast_symlink(inode))) {
2723 struct ocfs2_extent_list *el = &di->id2.i_list;
2724 le16_add_cpu(&el->l_count, -(xattrsize /
2725 sizeof(struct ocfs2_extent_rec)));
2727 di->i_xattr_inline_size = cpu_to_le16(xattrsize);
2729 spin_lock(&oi->ip_lock);
2730 oi->ip_dyn_features |= OCFS2_INLINE_XATTR_FL|OCFS2_HAS_XATTR_FL;
2731 di->i_dyn_features = cpu_to_le16(oi->ip_dyn_features);
2732 spin_unlock(&oi->ip_lock);
2734 ocfs2_journal_dirty(ctxt->handle, di_bh);
2741 * ocfs2_xattr_ibody_set()
2743 * Set, replace or remove an extended attribute into inode block.
2746 static int ocfs2_xattr_ibody_set(struct inode *inode,
2747 struct ocfs2_xattr_info *xi,
2748 struct ocfs2_xattr_search *xs,
2749 struct ocfs2_xattr_set_ctxt *ctxt)
2752 struct ocfs2_inode_info *oi = OCFS2_I(inode);
2753 struct ocfs2_xa_loc loc;
2755 if (inode->i_sb->s_blocksize == OCFS2_MIN_BLOCKSIZE)
2758 down_write(&oi->ip_alloc_sem);
2759 if (!(oi->ip_dyn_features & OCFS2_INLINE_XATTR_FL)) {
2760 ret = ocfs2_xattr_ibody_init(inode, xs->inode_bh, ctxt);
2768 ocfs2_init_dinode_xa_loc(&loc, inode, xs->inode_bh,
2769 xs->not_found ? NULL : xs->here);
2770 ret = ocfs2_xa_set(&loc, xi, ctxt);
2776 xs->here = loc.xl_entry;
2779 up_write(&oi->ip_alloc_sem);
2785 * ocfs2_xattr_block_find()
2787 * Find extended attribute in external block and
2788 * fill search info into struct ocfs2_xattr_search.
2790 static int ocfs2_xattr_block_find(struct inode *inode,
2793 struct ocfs2_xattr_search *xs)
2795 struct ocfs2_dinode *di = (struct ocfs2_dinode *)xs->inode_bh->b_data;
2796 struct buffer_head *blk_bh = NULL;
2797 struct ocfs2_xattr_block *xb;
2800 if (!di->i_xattr_loc)
2803 ret = ocfs2_read_xattr_block(inode, le64_to_cpu(di->i_xattr_loc),
2810 xs->xattr_bh = blk_bh;
2811 xb = (struct ocfs2_xattr_block *)blk_bh->b_data;
2813 if (!(le16_to_cpu(xb->xb_flags) & OCFS2_XATTR_INDEXED)) {
2814 xs->header = &xb->xb_attrs.xb_header;
2815 xs->base = (void *)xs->header;
2816 xs->end = (void *)(blk_bh->b_data) + blk_bh->b_size;
2817 xs->here = xs->header->xh_entries;
2819 ret = ocfs2_xattr_find_entry(name_index, name, xs);
2821 ret = ocfs2_xattr_index_block_find(inode, blk_bh,
2825 if (ret && ret != -ENODATA) {
2826 xs->xattr_bh = NULL;
2829 xs->not_found = ret;
2837 static int ocfs2_create_xattr_block(struct inode *inode,
2838 struct buffer_head *inode_bh,
2839 struct ocfs2_xattr_set_ctxt *ctxt,
2841 struct buffer_head **ret_bh)
2844 u16 suballoc_bit_start;
2846 u64 suballoc_loc, first_blkno;
2847 struct ocfs2_dinode *di = (struct ocfs2_dinode *)inode_bh->b_data;
2848 struct buffer_head *new_bh = NULL;
2849 struct ocfs2_xattr_block *xblk;
2851 ret = ocfs2_journal_access_di(ctxt->handle, INODE_CACHE(inode),
2852 inode_bh, OCFS2_JOURNAL_ACCESS_CREATE);
2858 ret = ocfs2_claim_metadata(ctxt->handle, ctxt->meta_ac, 1,
2859 &suballoc_loc, &suballoc_bit_start,
2860 &num_got, &first_blkno);
2866 new_bh = sb_getblk(inode->i_sb, first_blkno);
2867 ocfs2_set_new_buffer_uptodate(INODE_CACHE(inode), new_bh);
2869 ret = ocfs2_journal_access_xb(ctxt->handle, INODE_CACHE(inode),
2871 OCFS2_JOURNAL_ACCESS_CREATE);
2877 /* Initialize ocfs2_xattr_block */
2878 xblk = (struct ocfs2_xattr_block *)new_bh->b_data;
2879 memset(xblk, 0, inode->i_sb->s_blocksize);
2880 strcpy((void *)xblk, OCFS2_XATTR_BLOCK_SIGNATURE);
2881 xblk->xb_suballoc_slot = cpu_to_le16(ctxt->meta_ac->ac_alloc_slot);
2882 xblk->xb_suballoc_loc = cpu_to_le64(suballoc_loc);
2883 xblk->xb_suballoc_bit = cpu_to_le16(suballoc_bit_start);
2884 xblk->xb_fs_generation =
2885 cpu_to_le32(OCFS2_SB(inode->i_sb)->fs_generation);
2886 xblk->xb_blkno = cpu_to_le64(first_blkno);
2888 struct ocfs2_xattr_tree_root *xr = &xblk->xb_attrs.xb_root;
2889 xr->xt_clusters = cpu_to_le32(1);
2890 xr->xt_last_eb_blk = 0;
2891 xr->xt_list.l_tree_depth = 0;
2892 xr->xt_list.l_count = cpu_to_le16(
2893 ocfs2_xattr_recs_per_xb(inode->i_sb));
2894 xr->xt_list.l_next_free_rec = cpu_to_le16(1);
2895 xblk->xb_flags = cpu_to_le16(OCFS2_XATTR_INDEXED);
2897 ocfs2_journal_dirty(ctxt->handle, new_bh);
2899 /* Add it to the inode */
2900 di->i_xattr_loc = cpu_to_le64(first_blkno);
2902 spin_lock(&OCFS2_I(inode)->ip_lock);
2903 OCFS2_I(inode)->ip_dyn_features |= OCFS2_HAS_XATTR_FL;
2904 di->i_dyn_features = cpu_to_le16(OCFS2_I(inode)->ip_dyn_features);
2905 spin_unlock(&OCFS2_I(inode)->ip_lock);
2907 ocfs2_journal_dirty(ctxt->handle, inode_bh);
2918 * ocfs2_xattr_block_set()
2920 * Set, replace or remove an extended attribute into external block.
2923 static int ocfs2_xattr_block_set(struct inode *inode,
2924 struct ocfs2_xattr_info *xi,
2925 struct ocfs2_xattr_search *xs,
2926 struct ocfs2_xattr_set_ctxt *ctxt)
2928 struct buffer_head *new_bh = NULL;
2929 struct ocfs2_xattr_block *xblk = NULL;
2931 struct ocfs2_xa_loc loc;
2933 if (!xs->xattr_bh) {
2934 ret = ocfs2_create_xattr_block(inode, xs->inode_bh, ctxt,
2941 xs->xattr_bh = new_bh;
2942 xblk = (struct ocfs2_xattr_block *)xs->xattr_bh->b_data;
2943 xs->header = &xblk->xb_attrs.xb_header;
2944 xs->base = (void *)xs->header;
2945 xs->end = (void *)xblk + inode->i_sb->s_blocksize;
2946 xs->here = xs->header->xh_entries;
2948 xblk = (struct ocfs2_xattr_block *)xs->xattr_bh->b_data;
2950 if (!(le16_to_cpu(xblk->xb_flags) & OCFS2_XATTR_INDEXED)) {
2951 ocfs2_init_xattr_block_xa_loc(&loc, inode, xs->xattr_bh,
2952 xs->not_found ? NULL : xs->here);
2954 ret = ocfs2_xa_set(&loc, xi, ctxt);
2956 xs->here = loc.xl_entry;
2957 else if ((ret != -ENOSPC) || ctxt->set_abort)
2960 ret = ocfs2_xattr_create_index_block(inode, xs, ctxt);
2966 if (le16_to_cpu(xblk->xb_flags) & OCFS2_XATTR_INDEXED)
2967 ret = ocfs2_xattr_set_entry_index_block(inode, xi, xs, ctxt);
2973 /* Check whether the new xattr can be inserted into the inode. */
2974 static int ocfs2_xattr_can_be_in_inode(struct inode *inode,
2975 struct ocfs2_xattr_info *xi,
2976 struct ocfs2_xattr_search *xs)
2978 struct ocfs2_xattr_entry *last;
2980 size_t min_offs = xs->end - xs->base;
2985 last = xs->header->xh_entries;
2987 for (i = 0; i < le16_to_cpu(xs->header->xh_count); i++) {
2988 size_t offs = le16_to_cpu(last->xe_name_offset);
2989 if (offs < min_offs)
2994 free = min_offs - ((void *)last - xs->base) - OCFS2_XATTR_HEADER_GAP;
2998 BUG_ON(!xs->not_found);
3000 if (free >= (sizeof(struct ocfs2_xattr_entry) + namevalue_size_xi(xi)))
3006 static int ocfs2_calc_xattr_set_need(struct inode *inode,
3007 struct ocfs2_dinode *di,
3008 struct ocfs2_xattr_info *xi,
3009 struct ocfs2_xattr_search *xis,
3010 struct ocfs2_xattr_search *xbs,
3015 int ret = 0, old_in_xb = 0;
3016 int clusters_add = 0, meta_add = 0, credits = 0;
3017 struct buffer_head *bh = NULL;
3018 struct ocfs2_xattr_block *xb = NULL;
3019 struct ocfs2_xattr_entry *xe = NULL;
3020 struct ocfs2_xattr_value_root *xv = NULL;
3022 int name_offset, name_len = 0;
3023 u32 new_clusters = ocfs2_clusters_for_bytes(inode->i_sb,
3028 * Calculate the clusters we need to write.
3029 * No matter whether we replace an old one or add a new one,
3030 * we need this for writing.
3032 if (xi->xi_value_len > OCFS2_XATTR_INLINE_SIZE)
3033 credits += new_clusters *
3034 ocfs2_clusters_to_blocks(inode->i_sb, 1);
3036 if (xis->not_found && xbs->not_found) {
3037 credits += ocfs2_blocks_per_xattr_bucket(inode->i_sb);
3039 if (xi->xi_value_len > OCFS2_XATTR_INLINE_SIZE) {
3040 clusters_add += new_clusters;
3041 credits += ocfs2_calc_extend_credits(inode->i_sb,
3042 &def_xv.xv.xr_list);
3048 if (!xis->not_found) {
3050 name_offset = le16_to_cpu(xe->xe_name_offset);
3051 name_len = OCFS2_XATTR_SIZE(xe->xe_name_len);
3053 credits += OCFS2_INODE_UPDATE_CREDITS;
3055 int i, block_off = 0;
3056 xb = (struct ocfs2_xattr_block *)xbs->xattr_bh->b_data;
3058 name_offset = le16_to_cpu(xe->xe_name_offset);
3059 name_len = OCFS2_XATTR_SIZE(xe->xe_name_len);
3060 i = xbs->here - xbs->header->xh_entries;
3063 if (le16_to_cpu(xb->xb_flags) & OCFS2_XATTR_INDEXED) {
3064 ret = ocfs2_xattr_bucket_get_name_value(inode->i_sb,
3065 bucket_xh(xbs->bucket),
3068 base = bucket_block(xbs->bucket, block_off);
3069 credits += ocfs2_blocks_per_xattr_bucket(inode->i_sb);
3072 credits += OCFS2_XATTR_BLOCK_UPDATE_CREDITS;
3077 * delete a xattr doesn't need metadata and cluster allocation.
3078 * so just calculate the credits and return.
3080 * The credits for removing the value tree will be extended
3081 * by ocfs2_remove_extent itself.
3083 if (!xi->xi_value) {
3084 if (!ocfs2_xattr_is_local(xe))
3085 credits += ocfs2_remove_extent_credits(inode->i_sb);
3090 /* do cluster allocation guess first. */
3091 value_size = le64_to_cpu(xe->xe_value_size);
3095 * In xattr set, we always try to set the xe in inode first,
3096 * so if it can be inserted into inode successfully, the old
3097 * one will be removed from the xattr block, and this xattr
3098 * will be inserted into inode as a new xattr in inode.
3100 if (ocfs2_xattr_can_be_in_inode(inode, xi, xis)) {
3101 clusters_add += new_clusters;
3102 credits += ocfs2_remove_extent_credits(inode->i_sb) +
3103 OCFS2_INODE_UPDATE_CREDITS;
3104 if (!ocfs2_xattr_is_local(xe))
3105 credits += ocfs2_calc_extend_credits(
3107 &def_xv.xv.xr_list);
3112 if (xi->xi_value_len > OCFS2_XATTR_INLINE_SIZE) {
3113 /* the new values will be stored outside. */
3114 u32 old_clusters = 0;
3116 if (!ocfs2_xattr_is_local(xe)) {
3117 old_clusters = ocfs2_clusters_for_bytes(inode->i_sb,
3119 xv = (struct ocfs2_xattr_value_root *)
3120 (base + name_offset + name_len);
3121 value_size = OCFS2_XATTR_ROOT_SIZE;
3125 if (old_clusters >= new_clusters) {
3126 credits += ocfs2_remove_extent_credits(inode->i_sb);
3129 meta_add += ocfs2_extend_meta_needed(&xv->xr_list);
3130 clusters_add += new_clusters - old_clusters;
3131 credits += ocfs2_calc_extend_credits(inode->i_sb,
3133 if (value_size >= OCFS2_XATTR_ROOT_SIZE)
3138 * Now the new value will be stored inside. So if the new
3139 * value is smaller than the size of value root or the old
3140 * value, we don't need any allocation, otherwise we have
3141 * to guess metadata allocation.
3143 if ((ocfs2_xattr_is_local(xe) &&
3144 (value_size >= xi->xi_value_len)) ||
3145 (!ocfs2_xattr_is_local(xe) &&
3146 OCFS2_XATTR_ROOT_SIZE >= xi->xi_value_len))
3151 /* calculate metadata allocation. */
3152 if (di->i_xattr_loc) {
3153 if (!xbs->xattr_bh) {
3154 ret = ocfs2_read_xattr_block(inode,
3155 le64_to_cpu(di->i_xattr_loc),
3162 xb = (struct ocfs2_xattr_block *)bh->b_data;
3164 xb = (struct ocfs2_xattr_block *)xbs->xattr_bh->b_data;
3167 * If there is already an xattr tree, good, we can calculate
3168 * like other b-trees. Otherwise we may have the chance of
3169 * create a tree, the credit calculation is borrowed from
3170 * ocfs2_calc_extend_credits with root_el = NULL. And the
3171 * new tree will be cluster based, so no meta is needed.
3173 if (le16_to_cpu(xb->xb_flags) & OCFS2_XATTR_INDEXED) {
3174 struct ocfs2_extent_list *el =
3175 &xb->xb_attrs.xb_root.xt_list;
3176 meta_add += ocfs2_extend_meta_needed(el);
3177 credits += ocfs2_calc_extend_credits(inode->i_sb,
3180 credits += OCFS2_SUBALLOC_ALLOC + 1;
3183 * This cluster will be used either for new bucket or for
3185 * If the cluster size is the same as the bucket size, one
3186 * more is needed since we may need to extend the bucket
3190 credits += ocfs2_blocks_per_xattr_bucket(inode->i_sb);
3191 if (OCFS2_XATTR_BUCKET_SIZE ==
3192 OCFS2_SB(inode->i_sb)->s_clustersize) {
3193 credits += ocfs2_blocks_per_xattr_bucket(inode->i_sb);
3198 credits += OCFS2_XATTR_BLOCK_CREATE_CREDITS;
3202 *clusters_need = clusters_add;
3204 *meta_need = meta_add;
3206 *credits_need = credits;
3211 static int ocfs2_init_xattr_set_ctxt(struct inode *inode,
3212 struct ocfs2_dinode *di,
3213 struct ocfs2_xattr_info *xi,
3214 struct ocfs2_xattr_search *xis,
3215 struct ocfs2_xattr_search *xbs,
3216 struct ocfs2_xattr_set_ctxt *ctxt,
3220 int clusters_add, meta_add, ret;
3221 struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
3223 memset(ctxt, 0, sizeof(struct ocfs2_xattr_set_ctxt));
3225 ocfs2_init_dealloc_ctxt(&ctxt->dealloc);
3227 ret = ocfs2_calc_xattr_set_need(inode, di, xi, xis, xbs,
3228 &clusters_add, &meta_add, credits);
3234 meta_add += extra_meta;
3235 trace_ocfs2_init_xattr_set_ctxt(xi->xi_name, meta_add,
3236 clusters_add, *credits);
3239 ret = ocfs2_reserve_new_metadata_blocks(osb, meta_add,
3248 ret = ocfs2_reserve_clusters(osb, clusters_add, &ctxt->data_ac);
3254 if (ctxt->meta_ac) {
3255 ocfs2_free_alloc_context(ctxt->meta_ac);
3256 ctxt->meta_ac = NULL;
3260 * We cannot have an error and a non null ctxt->data_ac.
3267 static int __ocfs2_xattr_set_handle(struct inode *inode,
3268 struct ocfs2_dinode *di,
3269 struct ocfs2_xattr_info *xi,
3270 struct ocfs2_xattr_search *xis,
3271 struct ocfs2_xattr_search *xbs,
3272 struct ocfs2_xattr_set_ctxt *ctxt)
3274 int ret = 0, credits, old_found;
3276 if (!xi->xi_value) {
3277 /* Remove existing extended attribute */
3278 if (!xis->not_found)
3279 ret = ocfs2_xattr_ibody_set(inode, xi, xis, ctxt);
3280 else if (!xbs->not_found)
3281 ret = ocfs2_xattr_block_set(inode, xi, xbs, ctxt);
3283 /* We always try to set extended attribute into inode first*/
3284 ret = ocfs2_xattr_ibody_set(inode, xi, xis, ctxt);
3285 if (!ret && !xbs->not_found) {
3287 * If succeed and that extended attribute existing in
3288 * external block, then we will remove it.
3290 xi->xi_value = NULL;
3291 xi->xi_value_len = 0;
3293 old_found = xis->not_found;
3294 xis->not_found = -ENODATA;
3295 ret = ocfs2_calc_xattr_set_need(inode,
3303 xis->not_found = old_found;
3309 ret = ocfs2_extend_trans(ctxt->handle, credits);
3314 ret = ocfs2_xattr_block_set(inode, xi, xbs, ctxt);
3315 } else if ((ret == -ENOSPC) && !ctxt->set_abort) {
3316 if (di->i_xattr_loc && !xbs->xattr_bh) {
3317 ret = ocfs2_xattr_block_find(inode,
3323 old_found = xis->not_found;
3324 xis->not_found = -ENODATA;
3325 ret = ocfs2_calc_xattr_set_need(inode,
3333 xis->not_found = old_found;
3339 ret = ocfs2_extend_trans(ctxt->handle, credits);
3346 * If no space in inode, we will set extended attribute
3347 * into external block.
3349 ret = ocfs2_xattr_block_set(inode, xi, xbs, ctxt);
3352 if (!xis->not_found) {
3354 * If succeed and that extended attribute
3355 * existing in inode, we will remove it.
3357 xi->xi_value = NULL;
3358 xi->xi_value_len = 0;
3359 xbs->not_found = -ENODATA;
3360 ret = ocfs2_calc_xattr_set_need(inode,
3373 ret = ocfs2_extend_trans(ctxt->handle, credits);
3378 ret = ocfs2_xattr_ibody_set(inode, xi,
3385 /* Update inode ctime. */
3386 ret = ocfs2_journal_access_di(ctxt->handle, INODE_CACHE(inode),
3388 OCFS2_JOURNAL_ACCESS_WRITE);
3394 inode->i_ctime = CURRENT_TIME;
3395 di->i_ctime = cpu_to_le64(inode->i_ctime.tv_sec);
3396 di->i_ctime_nsec = cpu_to_le32(inode->i_ctime.tv_nsec);
3397 ocfs2_journal_dirty(ctxt->handle, xis->inode_bh);
3404 * This function only called duing creating inode
3405 * for init security/acl xattrs of the new inode.
3406 * All transanction credits have been reserved in mknod.
3408 int ocfs2_xattr_set_handle(handle_t *handle,
3409 struct inode *inode,
3410 struct buffer_head *di_bh,
3416 struct ocfs2_alloc_context *meta_ac,
3417 struct ocfs2_alloc_context *data_ac)
3419 struct ocfs2_dinode *di;
3422 struct ocfs2_xattr_info xi = {
3423 .xi_name_index = name_index,
3425 .xi_name_len = strlen(name),
3427 .xi_value_len = value_len,
3430 struct ocfs2_xattr_search xis = {
3431 .not_found = -ENODATA,
3434 struct ocfs2_xattr_search xbs = {
3435 .not_found = -ENODATA,
3438 struct ocfs2_xattr_set_ctxt ctxt = {
3444 if (!ocfs2_supports_xattr(OCFS2_SB(inode->i_sb)))
3448 * In extreme situation, may need xattr bucket when
3449 * block size is too small. And we have already reserved
3450 * the credits for bucket in mknod.
3452 if (inode->i_sb->s_blocksize == OCFS2_MIN_BLOCKSIZE) {
3453 xbs.bucket = ocfs2_xattr_bucket_new(inode);
3455 mlog_errno(-ENOMEM);
3460 xis.inode_bh = xbs.inode_bh = di_bh;
3461 di = (struct ocfs2_dinode *)di_bh->b_data;
3463 down_write(&OCFS2_I(inode)->ip_xattr_sem);
3465 ret = ocfs2_xattr_ibody_find(inode, name_index, name, &xis);
3468 if (xis.not_found) {
3469 ret = ocfs2_xattr_block_find(inode, name_index, name, &xbs);
3474 ret = __ocfs2_xattr_set_handle(inode, di, &xi, &xis, &xbs, &ctxt);
3477 up_write(&OCFS2_I(inode)->ip_xattr_sem);
3478 brelse(xbs.xattr_bh);
3479 ocfs2_xattr_bucket_free(xbs.bucket);
3487 * Set, replace or remove an extended attribute for this inode.
3488 * value is NULL to remove an existing extended attribute, else either
3489 * create or replace an extended attribute.
3491 int ocfs2_xattr_set(struct inode *inode,
3498 struct buffer_head *di_bh = NULL;
3499 struct ocfs2_dinode *di;
3500 int ret, credits, ref_meta = 0, ref_credits = 0;
3501 struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
3502 struct inode *tl_inode = osb->osb_tl_inode;
3503 struct ocfs2_xattr_set_ctxt ctxt = { NULL, NULL, NULL, };
3504 struct ocfs2_refcount_tree *ref_tree = NULL;
3506 struct ocfs2_xattr_info xi = {
3507 .xi_name_index = name_index,
3509 .xi_name_len = strlen(name),
3511 .xi_value_len = value_len,
3514 struct ocfs2_xattr_search xis = {
3515 .not_found = -ENODATA,
3518 struct ocfs2_xattr_search xbs = {
3519 .not_found = -ENODATA,
3522 if (!ocfs2_supports_xattr(OCFS2_SB(inode->i_sb)))
3526 * Only xbs will be used on indexed trees. xis doesn't need a
3529 xbs.bucket = ocfs2_xattr_bucket_new(inode);
3531 mlog_errno(-ENOMEM);
3535 ret = ocfs2_inode_lock(inode, &di_bh, 1);
3538 goto cleanup_nolock;
3540 xis.inode_bh = xbs.inode_bh = di_bh;
3541 di = (struct ocfs2_dinode *)di_bh->b_data;
3543 down_write(&OCFS2_I(inode)->ip_xattr_sem);
3545 * Scan inode and external block to find the same name
3546 * extended attribute and collect search information.
3548 ret = ocfs2_xattr_ibody_find(inode, name_index, name, &xis);
3551 if (xis.not_found) {
3552 ret = ocfs2_xattr_block_find(inode, name_index, name, &xbs);
3557 if (xis.not_found && xbs.not_found) {
3559 if (flags & XATTR_REPLACE)
3566 if (flags & XATTR_CREATE)
3570 /* Check whether the value is refcounted and do some preparation. */
3571 if (OCFS2_I(inode)->ip_dyn_features & OCFS2_HAS_REFCOUNT_FL &&
3572 (!xis.not_found || !xbs.not_found)) {
3573 ret = ocfs2_prepare_refcount_xattr(inode, di, &xi,
3574 &xis, &xbs, &ref_tree,
3575 &ref_meta, &ref_credits);
3582 mutex_lock(&tl_inode->i_mutex);
3584 if (ocfs2_truncate_log_needs_flush(osb)) {
3585 ret = __ocfs2_flush_truncate_log(osb);
3587 mutex_unlock(&tl_inode->i_mutex);
3592 mutex_unlock(&tl_inode->i_mutex);
3594 ret = ocfs2_init_xattr_set_ctxt(inode, di, &xi, &xis,
3595 &xbs, &ctxt, ref_meta, &credits);
3601 /* we need to update inode's ctime field, so add credit for it. */
3602 credits += OCFS2_INODE_UPDATE_CREDITS;
3603 ctxt.handle = ocfs2_start_trans(osb, credits + ref_credits);
3604 if (IS_ERR(ctxt.handle)) {
3605 ret = PTR_ERR(ctxt.handle);
3610 ret = __ocfs2_xattr_set_handle(inode, di, &xi, &xis, &xbs, &ctxt);
3612 ocfs2_commit_trans(osb, ctxt.handle);
3616 ocfs2_free_alloc_context(ctxt.data_ac);
3618 ocfs2_free_alloc_context(ctxt.meta_ac);
3619 if (ocfs2_dealloc_has_cluster(&ctxt.dealloc))
3620 ocfs2_schedule_truncate_log_flush(osb, 1);
3621 ocfs2_run_deallocs(osb, &ctxt.dealloc);
3625 ocfs2_unlock_refcount_tree(osb, ref_tree, 1);
3626 up_write(&OCFS2_I(inode)->ip_xattr_sem);
3627 if (!value && !ret) {
3628 ret = ocfs2_try_remove_refcount_tree(inode, di_bh);
3632 ocfs2_inode_unlock(inode, 1);
3635 brelse(xbs.xattr_bh);
3636 ocfs2_xattr_bucket_free(xbs.bucket);
3642 * Find the xattr extent rec which may contains name_hash.
3643 * e_cpos will be the first name hash of the xattr rec.
3644 * el must be the ocfs2_xattr_header.xb_attrs.xb_root.xt_list.
3646 static int ocfs2_xattr_get_rec(struct inode *inode,
3651 struct ocfs2_extent_list *el)
3654 struct buffer_head *eb_bh = NULL;
3655 struct ocfs2_extent_block *eb;
3656 struct ocfs2_extent_rec *rec = NULL;
3659 if (el->l_tree_depth) {
3660 ret = ocfs2_find_leaf(INODE_CACHE(inode), el, name_hash,
3667 eb = (struct ocfs2_extent_block *) eb_bh->b_data;
3670 if (el->l_tree_depth) {
3671 ocfs2_error(inode->i_sb,
3672 "Inode %lu has non zero tree depth in "
3673 "xattr tree block %llu\n", inode->i_ino,
3674 (unsigned long long)eb_bh->b_blocknr);
3680 for (i = le16_to_cpu(el->l_next_free_rec) - 1; i >= 0; i--) {
3681 rec = &el->l_recs[i];
3683 if (le32_to_cpu(rec->e_cpos) <= name_hash) {
3684 e_blkno = le64_to_cpu(rec->e_blkno);
3690 ocfs2_error(inode->i_sb, "Inode %lu has bad extent "
3691 "record (%u, %u, 0) in xattr", inode->i_ino,
3692 le32_to_cpu(rec->e_cpos),
3693 ocfs2_rec_clusters(el, rec));
3698 *p_blkno = le64_to_cpu(rec->e_blkno);
3699 *num_clusters = le16_to_cpu(rec->e_leaf_clusters);
3701 *e_cpos = le32_to_cpu(rec->e_cpos);
3707 typedef int (xattr_bucket_func)(struct inode *inode,
3708 struct ocfs2_xattr_bucket *bucket,
3711 static int ocfs2_find_xe_in_bucket(struct inode *inode,
3712 struct ocfs2_xattr_bucket *bucket,
3719 int i, ret = 0, cmp = 1, block_off, new_offset;
3720 struct ocfs2_xattr_header *xh = bucket_xh(bucket);
3721 size_t name_len = strlen(name);
3722 struct ocfs2_xattr_entry *xe = NULL;
3726 * We don't use binary search in the bucket because there
3727 * may be multiple entries with the same name hash.
3729 for (i = 0; i < le16_to_cpu(xh->xh_count); i++) {
3730 xe = &xh->xh_entries[i];
3732 if (name_hash > le32_to_cpu(xe->xe_name_hash))
3734 else if (name_hash < le32_to_cpu(xe->xe_name_hash))
3737 cmp = name_index - ocfs2_xattr_get_type(xe);
3739 cmp = name_len - xe->xe_name_len;
3743 ret = ocfs2_xattr_bucket_get_name_value(inode->i_sb,
3754 xe_name = bucket_block(bucket, block_off) + new_offset;
3755 if (!memcmp(name, xe_name, name_len)) {
3767 * Find the specified xattr entry in a series of buckets.
3768 * This series start from p_blkno and last for num_clusters.
3769 * The ocfs2_xattr_header.xh_num_buckets of the first bucket contains
3770 * the num of the valid buckets.
3772 * Return the buffer_head this xattr should reside in. And if the xattr's
3773 * hash is in the gap of 2 buckets, return the lower bucket.
3775 static int ocfs2_xattr_bucket_find(struct inode *inode,
3782 struct ocfs2_xattr_search *xs)
3785 struct ocfs2_xattr_header *xh = NULL;
3786 struct ocfs2_xattr_entry *xe = NULL;
3788 u16 blk_per_bucket = ocfs2_blocks_per_xattr_bucket(inode->i_sb);
3789 int low_bucket = 0, bucket, high_bucket;
3790 struct ocfs2_xattr_bucket *search;
3792 u64 blkno, lower_blkno = 0;
3794 search = ocfs2_xattr_bucket_new(inode);
3801 ret = ocfs2_read_xattr_bucket(search, p_blkno);
3807 xh = bucket_xh(search);
3808 high_bucket = le16_to_cpu(xh->xh_num_buckets) - 1;
3809 while (low_bucket <= high_bucket) {
3810 ocfs2_xattr_bucket_relse(search);
3812 bucket = (low_bucket + high_bucket) / 2;
3813 blkno = p_blkno + bucket * blk_per_bucket;
3814 ret = ocfs2_read_xattr_bucket(search, blkno);
3820 xh = bucket_xh(search);
3821 xe = &xh->xh_entries[0];
3822 if (name_hash < le32_to_cpu(xe->xe_name_hash)) {
3823 high_bucket = bucket - 1;
3828 * Check whether the hash of the last entry in our
3829 * bucket is larger than the search one. for an empty
3830 * bucket, the last one is also the first one.
3833 xe = &xh->xh_entries[le16_to_cpu(xh->xh_count) - 1];
3835 last_hash = le32_to_cpu(xe->xe_name_hash);
3837 /* record lower_blkno which may be the insert place. */
3838 lower_blkno = blkno;
3840 if (name_hash > le32_to_cpu(xe->xe_name_hash)) {
3841 low_bucket = bucket + 1;
3845 /* the searched xattr should reside in this bucket if exists. */
3846 ret = ocfs2_find_xe_in_bucket(inode, search,
3847 name_index, name, name_hash,
3857 * Record the bucket we have found.
3858 * When the xattr's hash value is in the gap of 2 buckets, we will
3859 * always set it to the previous bucket.
3862 lower_blkno = p_blkno;
3864 /* This should be in cache - we just read it during the search */
3865 ret = ocfs2_read_xattr_bucket(xs->bucket, lower_blkno);
3871 xs->header = bucket_xh(xs->bucket);
3872 xs->base = bucket_block(xs->bucket, 0);
3873 xs->end = xs->base + inode->i_sb->s_blocksize;
3876 xs->here = &xs->header->xh_entries[index];
3877 trace_ocfs2_xattr_bucket_find(OCFS2_I(inode)->ip_blkno,
3878 name, name_index, name_hash,
3879 (unsigned long long)bucket_blkno(xs->bucket),
3885 ocfs2_xattr_bucket_free(search);
3889 static int ocfs2_xattr_index_block_find(struct inode *inode,
3890 struct buffer_head *root_bh,
3893 struct ocfs2_xattr_search *xs)
3896 struct ocfs2_xattr_block *xb =
3897 (struct ocfs2_xattr_block *)root_bh->b_data;
3898 struct ocfs2_xattr_tree_root *xb_root = &xb->xb_attrs.xb_root;
3899 struct ocfs2_extent_list *el = &xb_root->xt_list;
3901 u32 first_hash, num_clusters = 0;
3902 u32 name_hash = ocfs2_xattr_name_hash(inode, name, strlen(name));
3904 if (le16_to_cpu(el->l_next_free_rec) == 0)
3907 trace_ocfs2_xattr_index_block_find(OCFS2_I(inode)->ip_blkno,
3908 name, name_index, name_hash,
3909 (unsigned long long)root_bh->b_blocknr,
3912 ret = ocfs2_xattr_get_rec(inode, name_hash, &p_blkno, &first_hash,
3919 BUG_ON(p_blkno == 0 || num_clusters == 0 || first_hash > name_hash);
3921 trace_ocfs2_xattr_index_block_find_rec(OCFS2_I(inode)->ip_blkno,
3922 name, name_index, first_hash,
3923 (unsigned long long)p_blkno,
3926 ret = ocfs2_xattr_bucket_find(inode, name_index, name, name_hash,
3927 p_blkno, first_hash, num_clusters, xs);
3933 static int ocfs2_iterate_xattr_buckets(struct inode *inode,
3936 xattr_bucket_func *func,
3940 u32 bpc = ocfs2_xattr_buckets_per_cluster(OCFS2_SB(inode->i_sb));
3941 u32 num_buckets = clusters * bpc;
3942 struct ocfs2_xattr_bucket *bucket;
3944 bucket = ocfs2_xattr_bucket_new(inode);
3946 mlog_errno(-ENOMEM);
3950 trace_ocfs2_iterate_xattr_buckets(
3951 (unsigned long long)OCFS2_I(inode)->ip_blkno,
3952 (unsigned long long)blkno, clusters);
3954 for (i = 0; i < num_buckets; i++, blkno += bucket->bu_blocks) {
3955 ret = ocfs2_read_xattr_bucket(bucket, blkno);
3962 * The real bucket num in this series of blocks is stored
3963 * in the 1st bucket.
3966 num_buckets = le16_to_cpu(bucket_xh(bucket)->xh_num_buckets);
3968 trace_ocfs2_iterate_xattr_bucket((unsigned long long)blkno,
3969 le32_to_cpu(bucket_xh(bucket)->xh_entries[0].xe_name_hash));
3971 ret = func(inode, bucket, para);
3972 if (ret && ret != -ERANGE)
3974 /* Fall through to bucket_relse() */
3977 ocfs2_xattr_bucket_relse(bucket);
3982 ocfs2_xattr_bucket_free(bucket);
3986 struct ocfs2_xattr_tree_list {
3992 static int ocfs2_xattr_bucket_get_name_value(struct super_block *sb,
3993 struct ocfs2_xattr_header *xh,
4000 if (index < 0 || index >= le16_to_cpu(xh->xh_count))
4003 name_offset = le16_to_cpu(xh->xh_entries[index].xe_name_offset);
4005 *block_off = name_offset >> sb->s_blocksize_bits;
4006 *new_offset = name_offset % sb->s_blocksize;
4011 static int ocfs2_list_xattr_bucket(struct inode *inode,
4012 struct ocfs2_xattr_bucket *bucket,
4016 struct ocfs2_xattr_tree_list *xl = (struct ocfs2_xattr_tree_list *)para;
4017 int i, block_off, new_offset;
4018 const char *prefix, *name;
4020 for (i = 0 ; i < le16_to_cpu(bucket_xh(bucket)->xh_count); i++) {
4021 struct ocfs2_xattr_entry *entry = &bucket_xh(bucket)->xh_entries[i];
4022 type = ocfs2_xattr_get_type(entry);
4023 prefix = ocfs2_xattr_prefix(type);
4026 ret = ocfs2_xattr_bucket_get_name_value(inode->i_sb,
4034 name = (const char *)bucket_block(bucket, block_off) +
4036 ret = ocfs2_xattr_list_entry(xl->buffer,
4040 entry->xe_name_len);
4049 static int ocfs2_iterate_xattr_index_block(struct inode *inode,
4050 struct buffer_head *blk_bh,
4051 xattr_tree_rec_func *rec_func,
4054 struct ocfs2_xattr_block *xb =
4055 (struct ocfs2_xattr_block *)blk_bh->b_data;
4056 struct ocfs2_extent_list *el = &xb->xb_attrs.xb_root.xt_list;
4058 u32 name_hash = UINT_MAX, e_cpos = 0, num_clusters = 0;
4061 if (!el->l_next_free_rec || !rec_func)
4064 while (name_hash > 0) {
4065 ret = ocfs2_xattr_get_rec(inode, name_hash, &p_blkno,
4066 &e_cpos, &num_clusters, el);
4072 ret = rec_func(inode, blk_bh, p_blkno, e_cpos,
4073 num_clusters, para);
4083 name_hash = e_cpos - 1;
4090 static int ocfs2_list_xattr_tree_rec(struct inode *inode,
4091 struct buffer_head *root_bh,
4092 u64 blkno, u32 cpos, u32 len, void *para)
4094 return ocfs2_iterate_xattr_buckets(inode, blkno, len,
4095 ocfs2_list_xattr_bucket, para);
4098 static int ocfs2_xattr_tree_list_index_block(struct inode *inode,
4099 struct buffer_head *blk_bh,
4104 struct ocfs2_xattr_tree_list xl = {
4106 .buffer_size = buffer_size,
4110 ret = ocfs2_iterate_xattr_index_block(inode, blk_bh,
4111 ocfs2_list_xattr_tree_rec, &xl);
4122 static int cmp_xe(const void *a, const void *b)
4124 const struct ocfs2_xattr_entry *l = a, *r = b;
4125 u32 l_hash = le32_to_cpu(l->xe_name_hash);
4126 u32 r_hash = le32_to_cpu(r->xe_name_hash);
4128 if (l_hash > r_hash)
4130 if (l_hash < r_hash)
4135 static void swap_xe(void *a, void *b, int size)
4137 struct ocfs2_xattr_entry *l = a, *r = b, tmp;
4140 memcpy(l, r, sizeof(struct ocfs2_xattr_entry));
4141 memcpy(r, &tmp, sizeof(struct ocfs2_xattr_entry));
4145 * When the ocfs2_xattr_block is filled up, new bucket will be created
4146 * and all the xattr entries will be moved to the new bucket.
4147 * The header goes at the start of the bucket, and the names+values are
4148 * filled from the end. This is why *target starts as the last buffer.
4149 * Note: we need to sort the entries since they are not saved in order
4150 * in the ocfs2_xattr_block.
4152 static void ocfs2_cp_xattr_block_to_bucket(struct inode *inode,
4153 struct buffer_head *xb_bh,
4154 struct ocfs2_xattr_bucket *bucket)
4156 int i, blocksize = inode->i_sb->s_blocksize;
4157 int blks = ocfs2_blocks_per_xattr_bucket(inode->i_sb);
4158 u16 offset, size, off_change;
4159 struct ocfs2_xattr_entry *xe;
4160 struct ocfs2_xattr_block *xb =
4161 (struct ocfs2_xattr_block *)xb_bh->b_data;
4162 struct ocfs2_xattr_header *xb_xh = &xb->xb_attrs.xb_header;
4163 struct ocfs2_xattr_header *xh = bucket_xh(bucket);
4164 u16 count = le16_to_cpu(xb_xh->xh_count);
4165 char *src = xb_bh->b_data;
4166 char *target = bucket_block(bucket, blks - 1);
4168 trace_ocfs2_cp_xattr_block_to_bucket_begin(
4169 (unsigned long long)xb_bh->b_blocknr,
4170 (unsigned long long)bucket_blkno(bucket));
4172 for (i = 0; i < blks; i++)
4173 memset(bucket_block(bucket, i), 0, blocksize);
4176 * Since the xe_name_offset is based on ocfs2_xattr_header,
4177 * there is a offset change corresponding to the change of
4178 * ocfs2_xattr_header's position.
4180 off_change = offsetof(struct ocfs2_xattr_block, xb_attrs.xb_header);
4181 xe = &xb_xh->xh_entries[count - 1];
4182 offset = le16_to_cpu(xe->xe_name_offset) + off_change;
4183 size = blocksize - offset;
4185 /* copy all the names and values. */
4186 memcpy(target + offset, src + offset, size);
4188 /* Init new header now. */
4189 xh->xh_count = xb_xh->xh_count;
4190 xh->xh_num_buckets = cpu_to_le16(1);
4191 xh->xh_name_value_len = cpu_to_le16(size);
4192 xh->xh_free_start = cpu_to_le16(OCFS2_XATTR_BUCKET_SIZE - size);
4194 /* copy all the entries. */
4195 target = bucket_block(bucket, 0);
4196 offset = offsetof(struct ocfs2_xattr_header, xh_entries);
4197 size = count * sizeof(struct ocfs2_xattr_entry);
4198 memcpy(target + offset, (char *)xb_xh + offset, size);
4200 /* Change the xe offset for all the xe because of the move. */
4201 off_change = OCFS2_XATTR_BUCKET_SIZE - blocksize +
4202 offsetof(struct ocfs2_xattr_block, xb_attrs.xb_header);
4203 for (i = 0; i < count; i++)
4204 le16_add_cpu(&xh->xh_entries[i].xe_name_offset, off_change);
4206 trace_ocfs2_cp_xattr_block_to_bucket_end(offset, size, off_change);
4208 sort(target + offset, count, sizeof(struct ocfs2_xattr_entry),
4213 * After we move xattr from block to index btree, we have to
4214 * update ocfs2_xattr_search to the new xe and base.
4216 * When the entry is in xattr block, xattr_bh indicates the storage place.
4217 * While if the entry is in index b-tree, "bucket" indicates the
4218 * real place of the xattr.
4220 static void ocfs2_xattr_update_xattr_search(struct inode *inode,
4221 struct ocfs2_xattr_search *xs,
4222 struct buffer_head *old_bh)
4224 char *buf = old_bh->b_data;
4225 struct ocfs2_xattr_block *old_xb = (struct ocfs2_xattr_block *)buf;
4226 struct ocfs2_xattr_header *old_xh = &old_xb->xb_attrs.xb_header;
4229 xs->header = bucket_xh(xs->bucket);
4230 xs->base = bucket_block(xs->bucket, 0);
4231 xs->end = xs->base + inode->i_sb->s_blocksize;
4236 i = xs->here - old_xh->xh_entries;
4237 xs->here = &xs->header->xh_entries[i];
4240 static int ocfs2_xattr_create_index_block(struct inode *inode,
4241 struct ocfs2_xattr_search *xs,
4242 struct ocfs2_xattr_set_ctxt *ctxt)
4247 handle_t *handle = ctxt->handle;
4248 struct ocfs2_inode_info *oi = OCFS2_I(inode);
4249 struct buffer_head *xb_bh = xs->xattr_bh;
4250 struct ocfs2_xattr_block *xb =
4251 (struct ocfs2_xattr_block *)xb_bh->b_data;
4252 struct ocfs2_xattr_tree_root *xr;
4253 u16 xb_flags = le16_to_cpu(xb->xb_flags);
4255 trace_ocfs2_xattr_create_index_block_begin(
4256 (unsigned long long)xb_bh->b_blocknr);
4258 BUG_ON(xb_flags & OCFS2_XATTR_INDEXED);
4259 BUG_ON(!xs->bucket);
4263 * We can use this lock for now, and maybe move to a dedicated mutex
4264 * if performance becomes a problem later.
4266 down_write(&oi->ip_alloc_sem);
4268 ret = ocfs2_journal_access_xb(handle, INODE_CACHE(inode), xb_bh,
4269 OCFS2_JOURNAL_ACCESS_WRITE);
4275 ret = __ocfs2_claim_clusters(handle, ctxt->data_ac,
4276 1, 1, &bit_off, &len);
4283 * The bucket may spread in many blocks, and
4284 * we will only touch the 1st block and the last block
4285 * in the whole bucket(one for entry and one for data).
4287 blkno = ocfs2_clusters_to_blocks(inode->i_sb, bit_off);
4289 trace_ocfs2_xattr_create_index_block((unsigned long long)blkno);
4291 ret = ocfs2_init_xattr_bucket(xs->bucket, blkno);
4297 ret = ocfs2_xattr_bucket_journal_access(handle, xs->bucket,
4298 OCFS2_JOURNAL_ACCESS_CREATE);
4304 ocfs2_cp_xattr_block_to_bucket(inode, xb_bh, xs->bucket);
4305 ocfs2_xattr_bucket_journal_dirty(handle, xs->bucket);
4307 ocfs2_xattr_update_xattr_search(inode, xs, xb_bh);
4309 /* Change from ocfs2_xattr_header to ocfs2_xattr_tree_root */
4310 memset(&xb->xb_attrs, 0, inode->i_sb->s_blocksize -
4311 offsetof(struct ocfs2_xattr_block, xb_attrs));
4313 xr = &xb->xb_attrs.xb_root;
4314 xr->xt_clusters = cpu_to_le32(1);
4315 xr->xt_last_eb_blk = 0;
4316 xr->xt_list.l_tree_depth = 0;
4317 xr->xt_list.l_count = cpu_to_le16(ocfs2_xattr_recs_per_xb(inode->i_sb));
4318 xr->xt_list.l_next_free_rec = cpu_to_le16(1);
4320 xr->xt_list.l_recs[0].e_cpos = 0;
4321 xr->xt_list.l_recs[0].e_blkno = cpu_to_le64(blkno);
4322 xr->xt_list.l_recs[0].e_leaf_clusters = cpu_to_le16(1);
4324 xb->xb_flags = cpu_to_le16(xb_flags | OCFS2_XATTR_INDEXED);
4326 ocfs2_journal_dirty(handle, xb_bh);
4329 up_write(&oi->ip_alloc_sem);
4334 static int cmp_xe_offset(const void *a, const void *b)
4336 const struct ocfs2_xattr_entry *l = a, *r = b;
4337 u32 l_name_offset = le16_to_cpu(l->xe_name_offset);
4338 u32 r_name_offset = le16_to_cpu(r->xe_name_offset);
4340 if (l_name_offset < r_name_offset)
4342 if (l_name_offset > r_name_offset)
4348 * defrag a xattr bucket if we find that the bucket has some
4349 * holes beteen name/value pairs.
4350 * We will move all the name/value pairs to the end of the bucket
4351 * so that we can spare some space for insertion.
4353 static int ocfs2_defrag_xattr_bucket(struct inode *inode,
4355 struct ocfs2_xattr_bucket *bucket)
4358 size_t end, offset, len;
4359 struct ocfs2_xattr_header *xh;
4360 char *entries, *buf, *bucket_buf = NULL;
4361 u64 blkno = bucket_blkno(bucket);
4363 size_t blocksize = inode->i_sb->s_blocksize;
4364 struct ocfs2_xattr_entry *xe;
4367 * In order to make the operation more efficient and generic,
4368 * we copy all the blocks into a contiguous memory and do the
4369 * defragment there, so if anything is error, we will not touch
4372 bucket_buf = kmalloc(OCFS2_XATTR_BUCKET_SIZE, GFP_NOFS);
4379 for (i = 0; i < bucket->bu_blocks; i++, buf += blocksize)
4380 memcpy(buf, bucket_block(bucket, i), blocksize);
4382 ret = ocfs2_xattr_bucket_journal_access(handle, bucket,
4383 OCFS2_JOURNAL_ACCESS_WRITE);
4389 xh = (struct ocfs2_xattr_header *)bucket_buf;
4390 entries = (char *)xh->xh_entries;
4391 xh_free_start = le16_to_cpu(xh->xh_free_start);
4393 trace_ocfs2_defrag_xattr_bucket(
4394 (unsigned long long)blkno, le16_to_cpu(xh->xh_count),
4395 xh_free_start, le16_to_cpu(xh->xh_name_value_len));
4398 * sort all the entries by their offset.
4399 * the largest will be the first, so that we can
4400 * move them to the end one by one.
4402 sort(entries, le16_to_cpu(xh->xh_count),
4403 sizeof(struct ocfs2_xattr_entry),
4404 cmp_xe_offset, swap_xe);
4406 /* Move all name/values to the end of the bucket. */
4407 xe = xh->xh_entries;
4408 end = OCFS2_XATTR_BUCKET_SIZE;
4409 for (i = 0; i < le16_to_cpu(xh->xh_count); i++, xe++) {
4410 offset = le16_to_cpu(xe->xe_name_offset);
4411 len = namevalue_size_xe(xe);
4414 * We must make sure that the name/value pair
4415 * exist in the same block. So adjust end to
4416 * the previous block end if needed.
4418 if (((end - len) / blocksize !=
4419 (end - 1) / blocksize))
4420 end = end - end % blocksize;
4422 if (end > offset + len) {
4423 memmove(bucket_buf + end - len,
4424 bucket_buf + offset, len);
4425 xe->xe_name_offset = cpu_to_le16(end - len);
4428 mlog_bug_on_msg(end < offset + len, "Defrag check failed for "
4429 "bucket %llu\n", (unsigned long long)blkno);
4434 mlog_bug_on_msg(xh_free_start > end, "Defrag check failed for "
4435 "bucket %llu\n", (unsigned long long)blkno);
4437 if (xh_free_start == end)
4440 memset(bucket_buf + xh_free_start, 0, end - xh_free_start);
4441 xh->xh_free_start = cpu_to_le16(end);
4443 /* sort the entries by their name_hash. */
4444 sort(entries, le16_to_cpu(xh->xh_count),
4445 sizeof(struct ocfs2_xattr_entry),
4449 for (i = 0; i < bucket->bu_blocks; i++, buf += blocksize)
4450 memcpy(bucket_block(bucket, i), buf, blocksize);
4451 ocfs2_xattr_bucket_journal_dirty(handle, bucket);
4459 * prev_blkno points to the start of an existing extent. new_blkno
4460 * points to a newly allocated extent. Because we know each of our
4461 * clusters contains more than bucket, we can easily split one cluster
4462 * at a bucket boundary. So we take the last cluster of the existing
4463 * extent and split it down the middle. We move the last half of the
4464 * buckets in the last cluster of the existing extent over to the new
4467 * first_bh is the buffer at prev_blkno so we can update the existing
4468 * extent's bucket count. header_bh is the bucket were we were hoping
4469 * to insert our xattr. If the bucket move places the target in the new
4470 * extent, we'll update first_bh and header_bh after modifying the old
4473 * first_hash will be set as the 1st xe's name_hash in the new extent.
4475 static int ocfs2_mv_xattr_bucket_cross_cluster(struct inode *inode,
4477 struct ocfs2_xattr_bucket *first,
4478 struct ocfs2_xattr_bucket *target,
4484 struct super_block *sb = inode->i_sb;
4485 int blks_per_bucket = ocfs2_blocks_per_xattr_bucket(sb);
4486 int num_buckets = ocfs2_xattr_buckets_per_cluster(OCFS2_SB(sb));
4487 int to_move = num_buckets / 2;
4489 u64 last_cluster_blkno = bucket_blkno(first) +
4490 ((num_clusters - 1) * ocfs2_clusters_to_blocks(sb, 1));
4492 BUG_ON(le16_to_cpu(bucket_xh(first)->xh_num_buckets) < num_buckets);
4493 BUG_ON(OCFS2_XATTR_BUCKET_SIZE == OCFS2_SB(sb)->s_clustersize);
4495 trace_ocfs2_mv_xattr_bucket_cross_cluster(
4496 (unsigned long long)last_cluster_blkno,
4497 (unsigned long long)new_blkno);
4499 ret = ocfs2_mv_xattr_buckets(inode, handle, bucket_blkno(first),
4500 last_cluster_blkno, new_blkno,
4501 to_move, first_hash);
4507 /* This is the first bucket that got moved */
4508 src_blkno = last_cluster_blkno + (to_move * blks_per_bucket);
4511 * If the target bucket was part of the moved buckets, we need to
4512 * update first and target.
4514 if (bucket_blkno(target) >= src_blkno) {
4515 /* Find the block for the new target bucket */
4516 src_blkno = new_blkno +
4517 (bucket_blkno(target) - src_blkno);
4519 ocfs2_xattr_bucket_relse(first);
4520 ocfs2_xattr_bucket_relse(target);
4523 * These shouldn't fail - the buffers are in the
4524 * journal from ocfs2_cp_xattr_bucket().
4526 ret = ocfs2_read_xattr_bucket(first, new_blkno);
4531 ret = ocfs2_read_xattr_bucket(target, src_blkno);
4542 * Find the suitable pos when we divide a bucket into 2.
4543 * We have to make sure the xattrs with the same hash value exist
4544 * in the same bucket.
4546 * If this ocfs2_xattr_header covers more than one hash value, find a
4547 * place where the hash value changes. Try to find the most even split.
4548 * The most common case is that all entries have different hash values,
4549 * and the first check we make will find a place to split.
4551 static int ocfs2_xattr_find_divide_pos(struct ocfs2_xattr_header *xh)
4553 struct ocfs2_xattr_entry *entries = xh->xh_entries;
4554 int count = le16_to_cpu(xh->xh_count);
4555 int delta, middle = count / 2;
4558 * We start at the middle. Each step gets farther away in both
4559 * directions. We therefore hit the change in hash value
4560 * nearest to the middle. Note that this loop does not execute for
4563 for (delta = 0; delta < middle; delta++) {
4564 /* Let's check delta earlier than middle */
4565 if (cmp_xe(&entries[middle - delta - 1],
4566 &entries[middle - delta]))
4567 return middle - delta;
4569 /* For even counts, don't walk off the end */
4570 if ((middle + delta + 1) == count)
4573 /* Now try delta past middle */
4574 if (cmp_xe(&entries[middle + delta],
4575 &entries[middle + delta + 1]))
4576 return middle + delta + 1;
4579 /* Every entry had the same hash */
4584 * Move some xattrs in old bucket(blk) to new bucket(new_blk).
4585 * first_hash will record the 1st hash of the new bucket.
4587 * Normally half of the xattrs will be moved. But we have to make
4588 * sure that the xattrs with the same hash value are stored in the
4589 * same bucket. If all the xattrs in this bucket have the same hash
4590 * value, the new bucket will be initialized as an empty one and the
4591 * first_hash will be initialized as (hash_value+1).
4593 static int ocfs2_divide_xattr_bucket(struct inode *inode,
4598 int new_bucket_head)
4601 int count, start, len, name_value_len = 0, name_offset = 0;
4602 struct ocfs2_xattr_bucket *s_bucket = NULL, *t_bucket = NULL;
4603 struct ocfs2_xattr_header *xh;
4604 struct ocfs2_xattr_entry *xe;
4605 int blocksize = inode->i_sb->s_blocksize;
4607 trace_ocfs2_divide_xattr_bucket_begin((unsigned long long)blk,
4608 (unsigned long long)new_blk);
4610 s_bucket = ocfs2_xattr_bucket_new(inode);
4611 t_bucket = ocfs2_xattr_bucket_new(inode);
4612 if (!s_bucket || !t_bucket) {
4618 ret = ocfs2_read_xattr_bucket(s_bucket, blk);
4624 ret = ocfs2_xattr_bucket_journal_access(handle, s_bucket,
4625 OCFS2_JOURNAL_ACCESS_WRITE);
4632 * Even if !new_bucket_head, we're overwriting t_bucket. Thus,
4633 * there's no need to read it.
4635 ret = ocfs2_init_xattr_bucket(t_bucket, new_blk);
4642 * Hey, if we're overwriting t_bucket, what difference does
4643 * ACCESS_CREATE vs ACCESS_WRITE make? See the comment in the
4644 * same part of ocfs2_cp_xattr_bucket().
4646 ret = ocfs2_xattr_bucket_journal_access(handle, t_bucket,
4648 OCFS2_JOURNAL_ACCESS_CREATE :
4649 OCFS2_JOURNAL_ACCESS_WRITE);
4655 xh = bucket_xh(s_bucket);
4656 count = le16_to_cpu(xh->xh_count);
4657 start = ocfs2_xattr_find_divide_pos(xh);
4659 if (start == count) {
4660 xe = &xh->xh_entries[start-1];
4663 * initialized a new empty bucket here.
4664 * The hash value is set as one larger than
4665 * that of the last entry in the previous bucket.
4667 for (i = 0; i < t_bucket->bu_blocks; i++)
4668 memset(bucket_block(t_bucket, i), 0, blocksize);
4670 xh = bucket_xh(t_bucket);
4671 xh->xh_free_start = cpu_to_le16(blocksize);
4672 xh->xh_entries[0].xe_name_hash = xe->xe_name_hash;
4673 le32_add_cpu(&xh->xh_entries[0].xe_name_hash, 1);
4675 goto set_num_buckets;
4678 /* copy the whole bucket to the new first. */
4679 ocfs2_xattr_bucket_copy_data(t_bucket, s_bucket);
4681 /* update the new bucket. */
4682 xh = bucket_xh(t_bucket);
4685 * Calculate the total name/value len and xh_free_start for
4686 * the old bucket first.
4688 name_offset = OCFS2_XATTR_BUCKET_SIZE;
4690 for (i = 0; i < start; i++) {
4691 xe = &xh->xh_entries[i];
4692 name_value_len += namevalue_size_xe(xe);
4693 if (le16_to_cpu(xe->xe_name_offset) < name_offset)
4694 name_offset = le16_to_cpu(xe->xe_name_offset);
4698 * Now begin the modification to the new bucket.
4700 * In the new bucket, We just move the xattr entry to the beginning
4701 * and don't touch the name/value. So there will be some holes in the
4702 * bucket, and they will be removed when ocfs2_defrag_xattr_bucket is
4705 xe = &xh->xh_entries[start];
4706 len = sizeof(struct ocfs2_xattr_entry) * (count - start);
4707 trace_ocfs2_divide_xattr_bucket_move(len,
4708 (int)((char *)xe - (char *)xh),
4709 (int)((char *)xh->xh_entries - (char *)xh));
4710 memmove((char *)xh->xh_entries, (char *)xe, len);
4711 xe = &xh->xh_entries[count - start];
4712 len = sizeof(struct ocfs2_xattr_entry) * start;
4713 memset((char *)xe, 0, len);
4715 le16_add_cpu(&xh->xh_count, -start);
4716 le16_add_cpu(&xh->xh_name_value_len, -name_value_len);
4718 /* Calculate xh_free_start for the new bucket. */
4719 xh->xh_free_start = cpu_to_le16(OCFS2_XATTR_BUCKET_SIZE);
4720 for (i = 0; i < le16_to_cpu(xh->xh_count); i++) {
4721 xe = &xh->xh_entries[i];
4722 if (le16_to_cpu(xe->xe_name_offset) <
4723 le16_to_cpu(xh->xh_free_start))
4724 xh->xh_free_start = xe->xe_name_offset;
4728 /* set xh->xh_num_buckets for the new xh. */
4729 if (new_bucket_head)
4730 xh->xh_num_buckets = cpu_to_le16(1);
4732 xh->xh_num_buckets = 0;
4734 ocfs2_xattr_bucket_journal_dirty(handle, t_bucket);
4736 /* store the first_hash of the new bucket. */
4738 *first_hash = le32_to_cpu(xh->xh_entries[0].xe_name_hash);
4741 * Now only update the 1st block of the old bucket. If we
4742 * just added a new empty bucket, there is no need to modify
4748 xh = bucket_xh(s_bucket);
4749 memset(&xh->xh_entries[start], 0,
4750 sizeof(struct ocfs2_xattr_entry) * (count - start));
4751 xh->xh_count = cpu_to_le16(start);
4752 xh->xh_free_start = cpu_to_le16(name_offset);
4753 xh->xh_name_value_len = cpu_to_le16(name_value_len);
4755 ocfs2_xattr_bucket_journal_dirty(handle, s_bucket);
4758 ocfs2_xattr_bucket_free(s_bucket);
4759 ocfs2_xattr_bucket_free(t_bucket);
4765 * Copy xattr from one bucket to another bucket.
4767 * The caller must make sure that the journal transaction
4768 * has enough space for journaling.
4770 static int ocfs2_cp_xattr_bucket(struct inode *inode,
4777 struct ocfs2_xattr_bucket *s_bucket = NULL, *t_bucket = NULL;
4779 BUG_ON(s_blkno == t_blkno);
4781 trace_ocfs2_cp_xattr_bucket((unsigned long long)s_blkno,
4782 (unsigned long long)t_blkno,
4785 s_bucket = ocfs2_xattr_bucket_new(inode);
4786 t_bucket = ocfs2_xattr_bucket_new(inode);
4787 if (!s_bucket || !t_bucket) {
4793 ret = ocfs2_read_xattr_bucket(s_bucket, s_blkno);
4798 * Even if !t_is_new, we're overwriting t_bucket. Thus,
4799 * there's no need to read it.
4801 ret = ocfs2_init_xattr_bucket(t_bucket, t_blkno);
4806 * Hey, if we're overwriting t_bucket, what difference does
4807 * ACCESS_CREATE vs ACCESS_WRITE make? Well, if we allocated a new
4808 * cluster to fill, we came here from
4809 * ocfs2_mv_xattr_buckets(), and it is really new -
4810 * ACCESS_CREATE is required. But we also might have moved data
4811 * out of t_bucket before extending back into it.
4812 * ocfs2_add_new_xattr_bucket() can do this - its call to
4813 * ocfs2_add_new_xattr_cluster() may have created a new extent
4814 * and copied out the end of the old extent. Then it re-extends
4815 * the old extent back to create space for new xattrs. That's
4816 * how we get here, and the bucket isn't really new.
4818 ret = ocfs2_xattr_bucket_journal_access(handle, t_bucket,
4820 OCFS2_JOURNAL_ACCESS_CREATE :
4821 OCFS2_JOURNAL_ACCESS_WRITE);
4825 ocfs2_xattr_bucket_copy_data(t_bucket, s_bucket);
4826 ocfs2_xattr_bucket_journal_dirty(handle, t_bucket);
4829 ocfs2_xattr_bucket_free(t_bucket);
4830 ocfs2_xattr_bucket_free(s_bucket);
4836 * src_blk points to the start of an existing extent. last_blk points to
4837 * last cluster in that extent. to_blk points to a newly allocated
4838 * extent. We copy the buckets from the cluster at last_blk to the new
4839 * extent. If start_bucket is non-zero, we skip that many buckets before
4840 * we start copying. The new extent's xh_num_buckets gets set to the
4841 * number of buckets we copied. The old extent's xh_num_buckets shrinks
4842 * by the same amount.
4844 static int ocfs2_mv_xattr_buckets(struct inode *inode, handle_t *handle,
4845 u64 src_blk, u64 last_blk, u64 to_blk,
4846 unsigned int start_bucket,
4849 int i, ret, credits;
4850 struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
4851 int blks_per_bucket = ocfs2_blocks_per_xattr_bucket(inode->i_sb);
4852 int num_buckets = ocfs2_xattr_buckets_per_cluster(osb);
4853 struct ocfs2_xattr_bucket *old_first, *new_first;
4855 trace_ocfs2_mv_xattr_buckets((unsigned long long)last_blk,
4856 (unsigned long long)to_blk);
4858 BUG_ON(start_bucket >= num_buckets);
4860 num_buckets -= start_bucket;
4861 last_blk += (start_bucket * blks_per_bucket);
4864 /* The first bucket of the original extent */
4865 old_first = ocfs2_xattr_bucket_new(inode);
4866 /* The first bucket of the new extent */
4867 new_first = ocfs2_xattr_bucket_new(inode);
4868 if (!old_first || !new_first) {
4874 ret = ocfs2_read_xattr_bucket(old_first, src_blk);
4881 * We need to update the first bucket of the old extent and all
4882 * the buckets going to the new extent.
4884 credits = ((num_buckets + 1) * blks_per_bucket);
4885 ret = ocfs2_extend_trans(handle, credits);
4891 ret = ocfs2_xattr_bucket_journal_access(handle, old_first,
4892 OCFS2_JOURNAL_ACCESS_WRITE);
4898 for (i = 0; i < num_buckets; i++) {
4899 ret = ocfs2_cp_xattr_bucket(inode, handle,
4900 last_blk + (i * blks_per_bucket),
4901 to_blk + (i * blks_per_bucket),
4910 * Get the new bucket ready before we dirty anything
4911 * (This actually shouldn't fail, because we already dirtied
4912 * it once in ocfs2_cp_xattr_bucket()).
4914 ret = ocfs2_read_xattr_bucket(new_first, to_blk);
4919 ret = ocfs2_xattr_bucket_journal_access(handle, new_first,
4920 OCFS2_JOURNAL_ACCESS_WRITE);
4926 /* Now update the headers */
4927 le16_add_cpu(&bucket_xh(old_first)->xh_num_buckets, -num_buckets);
4928 ocfs2_xattr_bucket_journal_dirty(handle, old_first);
4930 bucket_xh(new_first)->xh_num_buckets = cpu_to_le16(num_buckets);
4931 ocfs2_xattr_bucket_journal_dirty(handle, new_first);
4934 *first_hash = le32_to_cpu(bucket_xh(new_first)->xh_entries[0].xe_name_hash);
4937 ocfs2_xattr_bucket_free(new_first);
4938 ocfs2_xattr_bucket_free(old_first);
4943 * Move some xattrs in this cluster to the new cluster.
4944 * This function should only be called when bucket size == cluster size.
4945 * Otherwise ocfs2_mv_xattr_bucket_cross_cluster should be used instead.
4947 static int ocfs2_divide_xattr_cluster(struct inode *inode,
4953 u16 blk_per_bucket = ocfs2_blocks_per_xattr_bucket(inode->i_sb);
4954 int ret, credits = 2 * blk_per_bucket;
4956 BUG_ON(OCFS2_XATTR_BUCKET_SIZE < OCFS2_SB(inode->i_sb)->s_clustersize);
4958 ret = ocfs2_extend_trans(handle, credits);
4964 /* Move half of the xattr in start_blk to the next bucket. */
4965 return ocfs2_divide_xattr_bucket(inode, handle, prev_blk,
4966 new_blk, first_hash, 1);
4970 * Move some xattrs from the old cluster to the new one since they are not
4971 * contiguous in ocfs2 xattr tree.
4973 * new_blk starts a new separate cluster, and we will move some xattrs from
4974 * prev_blk to it. v_start will be set as the first name hash value in this
4975 * new cluster so that it can be used as e_cpos during tree insertion and
4976 * don't collide with our original b-tree operations. first_bh and header_bh
4977 * will also be updated since they will be used in ocfs2_extend_xattr_bucket
4978 * to extend the insert bucket.
4980 * The problem is how much xattr should we move to the new one and when should
4981 * we update first_bh and header_bh?
4982 * 1. If cluster size > bucket size, that means the previous cluster has more
4983 * than 1 bucket, so just move half nums of bucket into the new cluster and
4984 * update the first_bh and header_bh if the insert bucket has been moved
4985 * to the new cluster.
4986 * 2. If cluster_size == bucket_size:
4987 * a) If the previous extent rec has more than one cluster and the insert
4988 * place isn't in the last cluster, copy the entire last cluster to the
4989 * new one. This time, we don't need to upate the first_bh and header_bh
4990 * since they will not be moved into the new cluster.
4991 * b) Otherwise, move the bottom half of the xattrs in the last cluster into
4992 * the new one. And we set the extend flag to zero if the insert place is
4993 * moved into the new allocated cluster since no extend is needed.
4995 static int ocfs2_adjust_xattr_cross_cluster(struct inode *inode,
4997 struct ocfs2_xattr_bucket *first,
4998 struct ocfs2_xattr_bucket *target,
5006 trace_ocfs2_adjust_xattr_cross_cluster(
5007 (unsigned long long)bucket_blkno(first),
5008 (unsigned long long)new_blk, prev_clusters);
5010 if (ocfs2_xattr_buckets_per_cluster(OCFS2_SB(inode->i_sb)) > 1) {
5011 ret = ocfs2_mv_xattr_bucket_cross_cluster(inode,
5020 /* The start of the last cluster in the first extent */
5021 u64 last_blk = bucket_blkno(first) +
5022 ((prev_clusters - 1) *
5023 ocfs2_clusters_to_blocks(inode->i_sb, 1));
5025 if (prev_clusters > 1 && bucket_blkno(target) != last_blk) {
5026 ret = ocfs2_mv_xattr_buckets(inode, handle,
5027 bucket_blkno(first),
5028 last_blk, new_blk, 0,
5033 ret = ocfs2_divide_xattr_cluster(inode, handle,
5039 if ((bucket_blkno(target) == last_blk) && extend)
5048 * Add a new cluster for xattr storage.
5050 * If the new cluster is contiguous with the previous one, it will be
5051 * appended to the same extent record, and num_clusters will be updated.
5052 * If not, we will insert a new extent for it and move some xattrs in
5053 * the last cluster into the new allocated one.
5054 * We also need to limit the maximum size of a btree leaf, otherwise we'll
5055 * lose the benefits of hashing because we'll have to search large leaves.
5056 * So now the maximum size is OCFS2_MAX_XATTR_TREE_LEAF_SIZE(or clustersize,
5059 * first_bh is the first block of the previous extent rec and header_bh
5060 * indicates the bucket we will insert the new xattrs. They will be updated
5061 * when the header_bh is moved into the new cluster.
5063 static int ocfs2_add_new_xattr_cluster(struct inode *inode,
5064 struct buffer_head *root_bh,
5065 struct ocfs2_xattr_bucket *first,
5066 struct ocfs2_xattr_bucket *target,
5070 struct ocfs2_xattr_set_ctxt *ctxt)
5073 u16 bpc = ocfs2_clusters_to_blocks(inode->i_sb, 1);
5074 u32 prev_clusters = *num_clusters;
5075 u32 clusters_to_add = 1, bit_off, num_bits, v_start = 0;
5077 handle_t *handle = ctxt->handle;
5078 struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
5079 struct ocfs2_extent_tree et;
5081 trace_ocfs2_add_new_xattr_cluster_begin(
5082 (unsigned long long)OCFS2_I(inode)->ip_blkno,
5083 (unsigned long long)bucket_blkno(first),
5084 prev_cpos, prev_clusters);
5086 ocfs2_init_xattr_tree_extent_tree(&et, INODE_CACHE(inode), root_bh);
5088 ret = ocfs2_journal_access_xb(handle, INODE_CACHE(inode), root_bh,
5089 OCFS2_JOURNAL_ACCESS_WRITE);
5095 ret = __ocfs2_claim_clusters(handle, ctxt->data_ac, 1,
5096 clusters_to_add, &bit_off, &num_bits);
5103 BUG_ON(num_bits > clusters_to_add);
5105 block = ocfs2_clusters_to_blocks(osb->sb, bit_off);
5106 trace_ocfs2_add_new_xattr_cluster((unsigned long long)block, num_bits);
5108 if (bucket_blkno(first) + (prev_clusters * bpc) == block &&
5109 (prev_clusters + num_bits) << osb->s_clustersize_bits <=
5110 OCFS2_MAX_XATTR_TREE_LEAF_SIZE) {
5112 * If this cluster is contiguous with the old one and
5113 * adding this new cluster, we don't surpass the limit of
5114 * OCFS2_MAX_XATTR_TREE_LEAF_SIZE, cool. We will let it be
5115 * initialized and used like other buckets in the previous
5117 * So add it as a contiguous one. The caller will handle
5120 v_start = prev_cpos + prev_clusters;
5121 *num_clusters = prev_clusters + num_bits;
5123 ret = ocfs2_adjust_xattr_cross_cluster(inode,
5137 trace_ocfs2_add_new_xattr_cluster_insert((unsigned long long)block,
5139 ret = ocfs2_insert_extent(handle, &et, v_start, block,
5140 num_bits, 0, ctxt->meta_ac);
5146 ocfs2_journal_dirty(handle, root_bh);
5153 * We are given an extent. 'first' is the bucket at the very front of
5154 * the extent. The extent has space for an additional bucket past
5155 * bucket_xh(first)->xh_num_buckets. 'target_blkno' is the block number
5156 * of the target bucket. We wish to shift every bucket past the target
5157 * down one, filling in that additional space. When we get back to the
5158 * target, we split the target between itself and the now-empty bucket
5159 * at target+1 (aka, target_blkno + blks_per_bucket).
5161 static int ocfs2_extend_xattr_bucket(struct inode *inode,
5163 struct ocfs2_xattr_bucket *first,
5168 struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
5169 u16 blk_per_bucket = ocfs2_blocks_per_xattr_bucket(inode->i_sb);
5171 u16 new_bucket = le16_to_cpu(bucket_xh(first)->xh_num_buckets);
5173 trace_ocfs2_extend_xattr_bucket((unsigned long long)target_blk,
5174 (unsigned long long)bucket_blkno(first),
5175 num_clusters, new_bucket);
5177 /* The extent must have room for an additional bucket */
5178 BUG_ON(new_bucket >=
5179 (num_clusters * ocfs2_xattr_buckets_per_cluster(osb)));
5181 /* end_blk points to the last existing bucket */
5182 end_blk = bucket_blkno(first) + ((new_bucket - 1) * blk_per_bucket);
5185 * end_blk is the start of the last existing bucket.
5186 * Thus, (end_blk - target_blk) covers the target bucket and
5187 * every bucket after it up to, but not including, the last
5188 * existing bucket. Then we add the last existing bucket, the
5189 * new bucket, and the first bucket (3 * blk_per_bucket).
5191 credits = (end_blk - target_blk) + (3 * blk_per_bucket);
5192 ret = ocfs2_extend_trans(handle, credits);
5198 ret = ocfs2_xattr_bucket_journal_access(handle, first,
5199 OCFS2_JOURNAL_ACCESS_WRITE);
5205 while (end_blk != target_blk) {
5206 ret = ocfs2_cp_xattr_bucket(inode, handle, end_blk,
5207 end_blk + blk_per_bucket, 0);
5210 end_blk -= blk_per_bucket;
5213 /* Move half of the xattr in target_blkno to the next bucket. */
5214 ret = ocfs2_divide_xattr_bucket(inode, handle, target_blk,
5215 target_blk + blk_per_bucket, NULL, 0);
5217 le16_add_cpu(&bucket_xh(first)->xh_num_buckets, 1);
5218 ocfs2_xattr_bucket_journal_dirty(handle, first);
5225 * Add new xattr bucket in an extent record and adjust the buckets
5226 * accordingly. xb_bh is the ocfs2_xattr_block, and target is the
5227 * bucket we want to insert into.
5229 * In the easy case, we will move all the buckets after target down by
5230 * one. Half of target's xattrs will be moved to the next bucket.
5232 * If current cluster is full, we'll allocate a new one. This may not
5233 * be contiguous. The underlying calls will make sure that there is
5234 * space for the insert, shifting buckets around if necessary.
5235 * 'target' may be moved by those calls.
5237 static int ocfs2_add_new_xattr_bucket(struct inode *inode,
5238 struct buffer_head *xb_bh,
5239 struct ocfs2_xattr_bucket *target,
5240 struct ocfs2_xattr_set_ctxt *ctxt)
5242 struct ocfs2_xattr_block *xb =
5243 (struct ocfs2_xattr_block *)xb_bh->b_data;
5244 struct ocfs2_xattr_tree_root *xb_root = &xb->xb_attrs.xb_root;
5245 struct ocfs2_extent_list *el = &xb_root->xt_list;
5247 le32_to_cpu(bucket_xh(target)->xh_entries[0].xe_name_hash);
5248 struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
5249 int ret, num_buckets, extend = 1;
5251 u32 e_cpos, num_clusters;
5252 /* The bucket at the front of the extent */
5253 struct ocfs2_xattr_bucket *first;
5255 trace_ocfs2_add_new_xattr_bucket(
5256 (unsigned long long)bucket_blkno(target));
5258 /* The first bucket of the original extent */
5259 first = ocfs2_xattr_bucket_new(inode);
5266 ret = ocfs2_xattr_get_rec(inode, name_hash, &p_blkno, &e_cpos,
5273 ret = ocfs2_read_xattr_bucket(first, p_blkno);
5279 num_buckets = ocfs2_xattr_buckets_per_cluster(osb) * num_clusters;
5280 if (num_buckets == le16_to_cpu(bucket_xh(first)->xh_num_buckets)) {
5282 * This can move first+target if the target bucket moves
5283 * to the new extent.
5285 ret = ocfs2_add_new_xattr_cluster(inode,
5300 ret = ocfs2_extend_xattr_bucket(inode,
5303 bucket_blkno(target),
5310 ocfs2_xattr_bucket_free(first);
5315 static inline char *ocfs2_xattr_bucket_get_val(struct inode *inode,
5316 struct ocfs2_xattr_bucket *bucket,
5319 int block_off = offs >> inode->i_sb->s_blocksize_bits;
5321 offs = offs % inode->i_sb->s_blocksize;
5322 return bucket_block(bucket, block_off) + offs;
5326 * Truncate the specified xe_off entry in xattr bucket.
5327 * bucket is indicated by header_bh and len is the new length.
5328 * Both the ocfs2_xattr_value_root and the entry will be updated here.
5330 * Copy the new updated xe and xe_value_root to new_xe and new_xv if needed.
5332 static int ocfs2_xattr_bucket_value_truncate(struct inode *inode,
5333 struct ocfs2_xattr_bucket *bucket,
5336 struct ocfs2_xattr_set_ctxt *ctxt)
5340 struct ocfs2_xattr_entry *xe;
5341 struct ocfs2_xattr_header *xh = bucket_xh(bucket);
5342 size_t blocksize = inode->i_sb->s_blocksize;
5343 struct ocfs2_xattr_value_buf vb = {
5344 .vb_access = ocfs2_journal_access,
5347 xe = &xh->xh_entries[xe_off];
5349 BUG_ON(!xe || ocfs2_xattr_is_local(xe));
5351 offset = le16_to_cpu(xe->xe_name_offset) +
5352 OCFS2_XATTR_SIZE(xe->xe_name_len);
5354 value_blk = offset / blocksize;
5356 /* We don't allow ocfs2_xattr_value to be stored in different block. */
5357 BUG_ON(value_blk != (offset + OCFS2_XATTR_ROOT_SIZE - 1) / blocksize);
5359 vb.vb_bh = bucket->bu_bhs[value_blk];
5362 vb.vb_xv = (struct ocfs2_xattr_value_root *)
5363 (vb.vb_bh->b_data + offset % blocksize);
5366 * From here on out we have to dirty the bucket. The generic
5367 * value calls only modify one of the bucket's bhs, but we need
5368 * to send the bucket at once. So if they error, they *could* have
5369 * modified something. We have to assume they did, and dirty
5370 * the whole bucket. This leaves us in a consistent state.
5372 trace_ocfs2_xattr_bucket_value_truncate(
5373 (unsigned long long)bucket_blkno(bucket), xe_off, len);
5374 ret = ocfs2_xattr_value_truncate(inode, &vb, len, ctxt);
5380 ret = ocfs2_xattr_bucket_journal_access(ctxt->handle, bucket,
5381 OCFS2_JOURNAL_ACCESS_WRITE);
5387 xe->xe_value_size = cpu_to_le64(len);
5389 ocfs2_xattr_bucket_journal_dirty(ctxt->handle, bucket);
5395 static int ocfs2_rm_xattr_cluster(struct inode *inode,
5396 struct buffer_head *root_bh,
5403 struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
5404 struct inode *tl_inode = osb->osb_tl_inode;
5406 struct ocfs2_xattr_block *xb =
5407 (struct ocfs2_xattr_block *)root_bh->b_data;
5408 struct ocfs2_alloc_context *meta_ac = NULL;
5409 struct ocfs2_cached_dealloc_ctxt dealloc;
5410 struct ocfs2_extent_tree et;
5412 ret = ocfs2_iterate_xattr_buckets(inode, blkno, len,
5413 ocfs2_delete_xattr_in_bucket, para);
5419 ocfs2_init_xattr_tree_extent_tree(&et, INODE_CACHE(inode), root_bh);
5421 ocfs2_init_dealloc_ctxt(&dealloc);
5423 trace_ocfs2_rm_xattr_cluster(
5424 (unsigned long long)OCFS2_I(inode)->ip_blkno,
5425 (unsigned long long)blkno, cpos, len);
5427 ocfs2_remove_xattr_clusters_from_cache(INODE_CACHE(inode), blkno,
5430 ret = ocfs2_lock_allocators(inode, &et, 0, 1, NULL, &meta_ac);
5436 mutex_lock(&tl_inode->i_mutex);
5438 if (ocfs2_truncate_log_needs_flush(osb)) {
5439 ret = __ocfs2_flush_truncate_log(osb);
5446 handle = ocfs2_start_trans(osb, ocfs2_remove_extent_credits(osb->sb));
5447 if (IS_ERR(handle)) {
5453 ret = ocfs2_journal_access_xb(handle, INODE_CACHE(inode), root_bh,
5454 OCFS2_JOURNAL_ACCESS_WRITE);
5460 ret = ocfs2_remove_extent(handle, &et, cpos, len, meta_ac,
5467 le32_add_cpu(&xb->xb_attrs.xb_root.xt_clusters, -len);
5468 ocfs2_journal_dirty(handle, root_bh);
5470 ret = ocfs2_truncate_log_append(osb, handle, blkno, len);
5475 ocfs2_commit_trans(osb, handle);
5477 ocfs2_schedule_truncate_log_flush(osb, 1);
5479 mutex_unlock(&tl_inode->i_mutex);
5482 ocfs2_free_alloc_context(meta_ac);
5484 ocfs2_run_deallocs(osb, &dealloc);
5490 * check whether the xattr bucket is filled up with the same hash value.
5491 * If we want to insert the xattr with the same hash, return -ENOSPC.
5492 * If we want to insert a xattr with different hash value, go ahead
5493 * and ocfs2_divide_xattr_bucket will handle this.
5495 static int ocfs2_check_xattr_bucket_collision(struct inode *inode,
5496 struct ocfs2_xattr_bucket *bucket,
5499 struct ocfs2_xattr_header *xh = bucket_xh(bucket);
5500 u32 name_hash = ocfs2_xattr_name_hash(inode, name, strlen(name));
5502 if (name_hash != le32_to_cpu(xh->xh_entries[0].xe_name_hash))
5505 if (xh->xh_entries[le16_to_cpu(xh->xh_count) - 1].xe_name_hash ==
5506 xh->xh_entries[0].xe_name_hash) {
5507 mlog(ML_ERROR, "Too much hash collision in xattr bucket %llu, "
5509 (unsigned long long)bucket_blkno(bucket),
5510 le32_to_cpu(xh->xh_entries[0].xe_name_hash));
5518 * Try to set the entry in the current bucket. If we fail, the caller
5519 * will handle getting us another bucket.
5521 static int ocfs2_xattr_set_entry_bucket(struct inode *inode,
5522 struct ocfs2_xattr_info *xi,
5523 struct ocfs2_xattr_search *xs,
5524 struct ocfs2_xattr_set_ctxt *ctxt)
5527 struct ocfs2_xa_loc loc;
5529 trace_ocfs2_xattr_set_entry_bucket(xi->xi_name);
5531 ocfs2_init_xattr_bucket_xa_loc(&loc, xs->bucket,
5532 xs->not_found ? NULL : xs->here);
5533 ret = ocfs2_xa_set(&loc, xi, ctxt);
5535 xs->here = loc.xl_entry;
5538 if (ret != -ENOSPC) {
5543 /* Ok, we need space. Let's try defragmenting the bucket. */
5544 ret = ocfs2_defrag_xattr_bucket(inode, ctxt->handle,
5551 ret = ocfs2_xa_set(&loc, xi, ctxt);
5553 xs->here = loc.xl_entry;
5564 static int ocfs2_xattr_set_entry_index_block(struct inode *inode,
5565 struct ocfs2_xattr_info *xi,
5566 struct ocfs2_xattr_search *xs,
5567 struct ocfs2_xattr_set_ctxt *ctxt)
5571 trace_ocfs2_xattr_set_entry_index_block(xi->xi_name);
5573 ret = ocfs2_xattr_set_entry_bucket(inode, xi, xs, ctxt);
5576 if (ret != -ENOSPC) {
5581 /* Ack, need more space. Let's try to get another bucket! */
5584 * We do not allow for overlapping ranges between buckets. And
5585 * the maximum number of collisions we will allow for then is
5586 * one bucket's worth, so check it here whether we need to
5587 * add a new bucket for the insert.
5589 ret = ocfs2_check_xattr_bucket_collision(inode,
5597 ret = ocfs2_add_new_xattr_bucket(inode,
5607 * ocfs2_add_new_xattr_bucket() will have updated
5608 * xs->bucket if it moved, but it will not have updated
5609 * any of the other search fields. Thus, we drop it and
5610 * re-search. Everything should be cached, so it'll be
5613 ocfs2_xattr_bucket_relse(xs->bucket);
5614 ret = ocfs2_xattr_index_block_find(inode, xs->xattr_bh,
5617 if (ret && ret != -ENODATA)
5619 xs->not_found = ret;
5621 /* Ok, we have a new bucket, let's try again */
5622 ret = ocfs2_xattr_set_entry_bucket(inode, xi, xs, ctxt);
5623 if (ret && (ret != -ENOSPC))
5630 static int ocfs2_delete_xattr_in_bucket(struct inode *inode,
5631 struct ocfs2_xattr_bucket *bucket,
5634 int ret = 0, ref_credits;
5635 struct ocfs2_xattr_header *xh = bucket_xh(bucket);
5637 struct ocfs2_xattr_entry *xe;
5638 struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
5639 struct ocfs2_xattr_set_ctxt ctxt = {NULL, NULL,};
5640 int credits = ocfs2_remove_extent_credits(osb->sb) +
5641 ocfs2_blocks_per_xattr_bucket(inode->i_sb);
5642 struct ocfs2_xattr_value_root *xv;
5643 struct ocfs2_rm_xattr_bucket_para *args =
5644 (struct ocfs2_rm_xattr_bucket_para *)para;
5646 ocfs2_init_dealloc_ctxt(&ctxt.dealloc);
5648 for (i = 0; i < le16_to_cpu(xh->xh_count); i++) {
5649 xe = &xh->xh_entries[i];
5650 if (ocfs2_xattr_is_local(xe))
5653 ret = ocfs2_get_xattr_tree_value_root(inode->i_sb, bucket,
5656 ret = ocfs2_lock_xattr_remove_allocators(inode, xv,
5662 ctxt.handle = ocfs2_start_trans(osb, credits + ref_credits);
5663 if (IS_ERR(ctxt.handle)) {
5664 ret = PTR_ERR(ctxt.handle);
5669 ret = ocfs2_xattr_bucket_value_truncate(inode, bucket,
5672 ocfs2_commit_trans(osb, ctxt.handle);
5674 ocfs2_free_alloc_context(ctxt.meta_ac);
5675 ctxt.meta_ac = NULL;
5684 ocfs2_free_alloc_context(ctxt.meta_ac);
5685 ocfs2_schedule_truncate_log_flush(osb, 1);
5686 ocfs2_run_deallocs(osb, &ctxt.dealloc);
5691 * Whenever we modify a xattr value root in the bucket(e.g, CoW
5692 * or change the extent record flag), we need to recalculate
5693 * the metaecc for the whole bucket. So it is done here.
5696 * We have to give the extra credits for the caller.
5698 static int ocfs2_xattr_bucket_post_refcount(struct inode *inode,
5703 struct ocfs2_xattr_bucket *bucket =
5704 (struct ocfs2_xattr_bucket *)para;
5706 ret = ocfs2_xattr_bucket_journal_access(handle, bucket,
5707 OCFS2_JOURNAL_ACCESS_WRITE);
5713 ocfs2_xattr_bucket_journal_dirty(handle, bucket);
5719 * Special action we need if the xattr value is refcounted.
5721 * 1. If the xattr is refcounted, lock the tree.
5722 * 2. CoW the xattr if we are setting the new value and the value
5723 * will be stored outside.
5724 * 3. In other case, decrease_refcount will work for us, so just
5725 * lock the refcount tree, calculate the meta and credits is OK.
5727 * We have to do CoW before ocfs2_init_xattr_set_ctxt since
5728 * currently CoW is a completed transaction, while this function
5729 * will also lock the allocators and let us deadlock. So we will
5730 * CoW the whole xattr value.
5732 static int ocfs2_prepare_refcount_xattr(struct inode *inode,
5733 struct ocfs2_dinode *di,
5734 struct ocfs2_xattr_info *xi,
5735 struct ocfs2_xattr_search *xis,
5736 struct ocfs2_xattr_search *xbs,
5737 struct ocfs2_refcount_tree **ref_tree,
5742 struct ocfs2_xattr_block *xb;
5743 struct ocfs2_xattr_entry *xe;
5745 u32 p_cluster, num_clusters;
5746 unsigned int ext_flags;
5747 int name_offset, name_len;
5748 struct ocfs2_xattr_value_buf vb;
5749 struct ocfs2_xattr_bucket *bucket = NULL;
5750 struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
5751 struct ocfs2_post_refcount refcount;
5752 struct ocfs2_post_refcount *p = NULL;
5753 struct buffer_head *ref_root_bh = NULL;
5755 if (!xis->not_found) {
5757 name_offset = le16_to_cpu(xe->xe_name_offset);
5758 name_len = OCFS2_XATTR_SIZE(xe->xe_name_len);
5760 vb.vb_bh = xis->inode_bh;
5761 vb.vb_access = ocfs2_journal_access_di;
5763 int i, block_off = 0;
5764 xb = (struct ocfs2_xattr_block *)xbs->xattr_bh->b_data;
5766 name_offset = le16_to_cpu(xe->xe_name_offset);
5767 name_len = OCFS2_XATTR_SIZE(xe->xe_name_len);
5768 i = xbs->here - xbs->header->xh_entries;
5770 if (le16_to_cpu(xb->xb_flags) & OCFS2_XATTR_INDEXED) {
5771 ret = ocfs2_xattr_bucket_get_name_value(inode->i_sb,
5772 bucket_xh(xbs->bucket),
5779 base = bucket_block(xbs->bucket, block_off);
5780 vb.vb_bh = xbs->bucket->bu_bhs[block_off];
5781 vb.vb_access = ocfs2_journal_access;
5783 if (ocfs2_meta_ecc(osb)) {
5784 /*create parameters for ocfs2_post_refcount. */
5785 bucket = xbs->bucket;
5786 refcount.credits = bucket->bu_blocks;
5787 refcount.para = bucket;
5789 ocfs2_xattr_bucket_post_refcount;
5794 vb.vb_bh = xbs->xattr_bh;
5795 vb.vb_access = ocfs2_journal_access_xb;
5799 if (ocfs2_xattr_is_local(xe))
5802 vb.vb_xv = (struct ocfs2_xattr_value_root *)
5803 (base + name_offset + name_len);
5805 ret = ocfs2_xattr_get_clusters(inode, 0, &p_cluster,
5806 &num_clusters, &vb.vb_xv->xr_list,
5814 * We just need to check the 1st extent record, since we always
5815 * CoW the whole xattr. So there shouldn't be a xattr with
5816 * some REFCOUNT extent recs after the 1st one.
5818 if (!(ext_flags & OCFS2_EXT_REFCOUNTED))
5821 ret = ocfs2_lock_refcount_tree(osb, le64_to_cpu(di->i_refcount_loc),
5822 1, ref_tree, &ref_root_bh);
5829 * If we are deleting the xattr or the new size will be stored inside,
5830 * cool, leave it there, the xattr truncate process will remove them
5831 * for us(it still needs the refcount tree lock and the meta, credits).
5832 * And the worse case is that every cluster truncate will split the
5833 * refcount tree, and make the original extent become 3. So we will need
5834 * 2 * cluster more extent recs at most.
5836 if (!xi->xi_value || xi->xi_value_len <= OCFS2_XATTR_INLINE_SIZE) {
5838 ret = ocfs2_refcounted_xattr_delete_need(inode,
5839 &(*ref_tree)->rf_ci,
5840 ref_root_bh, vb.vb_xv,
5847 ret = ocfs2_refcount_cow_xattr(inode, di, &vb,
5848 *ref_tree, ref_root_bh, 0,
5849 le32_to_cpu(vb.vb_xv->xr_clusters), p);
5854 brelse(ref_root_bh);
5859 * Add the REFCOUNTED flags for all the extent rec in ocfs2_xattr_value_root.
5860 * The physical clusters will be added to refcount tree.
5862 static int ocfs2_xattr_value_attach_refcount(struct inode *inode,
5863 struct ocfs2_xattr_value_root *xv,
5864 struct ocfs2_extent_tree *value_et,
5865 struct ocfs2_caching_info *ref_ci,
5866 struct buffer_head *ref_root_bh,
5867 struct ocfs2_cached_dealloc_ctxt *dealloc,
5868 struct ocfs2_post_refcount *refcount)
5871 u32 clusters = le32_to_cpu(xv->xr_clusters);
5872 u32 cpos, p_cluster, num_clusters;
5873 struct ocfs2_extent_list *el = &xv->xr_list;
5874 unsigned int ext_flags;
5877 while (cpos < clusters) {
5878 ret = ocfs2_xattr_get_clusters(inode, cpos, &p_cluster,
5879 &num_clusters, el, &ext_flags);
5885 cpos += num_clusters;
5886 if ((ext_flags & OCFS2_EXT_REFCOUNTED))
5891 ret = ocfs2_add_refcount_flag(inode, value_et,
5892 ref_ci, ref_root_bh,
5893 cpos - num_clusters,
5894 p_cluster, num_clusters,
5906 * Given a normal ocfs2_xattr_header, refcount all the entries which
5907 * have value stored outside.
5908 * Used for xattrs stored in inode and ocfs2_xattr_block.
5910 static int ocfs2_xattr_attach_refcount_normal(struct inode *inode,
5911 struct ocfs2_xattr_value_buf *vb,
5912 struct ocfs2_xattr_header *header,
5913 struct ocfs2_caching_info *ref_ci,
5914 struct buffer_head *ref_root_bh,
5915 struct ocfs2_cached_dealloc_ctxt *dealloc)
5918 struct ocfs2_xattr_entry *xe;
5919 struct ocfs2_xattr_value_root *xv;
5920 struct ocfs2_extent_tree et;
5923 for (i = 0; i < le16_to_cpu(header->xh_count); i++) {
5924 xe = &header->xh_entries[i];
5926 if (ocfs2_xattr_is_local(xe))
5929 xv = (struct ocfs2_xattr_value_root *)((void *)header +
5930 le16_to_cpu(xe->xe_name_offset) +
5931 OCFS2_XATTR_SIZE(xe->xe_name_len));
5934 ocfs2_init_xattr_value_extent_tree(&et, INODE_CACHE(inode), vb);
5936 ret = ocfs2_xattr_value_attach_refcount(inode, xv, &et,
5937 ref_ci, ref_root_bh,
5948 static int ocfs2_xattr_inline_attach_refcount(struct inode *inode,
5949 struct buffer_head *fe_bh,
5950 struct ocfs2_caching_info *ref_ci,
5951 struct buffer_head *ref_root_bh,
5952 struct ocfs2_cached_dealloc_ctxt *dealloc)
5954 struct ocfs2_dinode *di = (struct ocfs2_dinode *)fe_bh->b_data;
5955 struct ocfs2_xattr_header *header = (struct ocfs2_xattr_header *)
5956 (fe_bh->b_data + inode->i_sb->s_blocksize -
5957 le16_to_cpu(di->i_xattr_inline_size));
5958 struct ocfs2_xattr_value_buf vb = {
5960 .vb_access = ocfs2_journal_access_di,
5963 return ocfs2_xattr_attach_refcount_normal(inode, &vb, header,
5964 ref_ci, ref_root_bh, dealloc);
5967 struct ocfs2_xattr_tree_value_refcount_para {
5968 struct ocfs2_caching_info *ref_ci;
5969 struct buffer_head *ref_root_bh;
5970 struct ocfs2_cached_dealloc_ctxt *dealloc;
5973 static int ocfs2_get_xattr_tree_value_root(struct super_block *sb,
5974 struct ocfs2_xattr_bucket *bucket,
5976 struct ocfs2_xattr_value_root **xv,
5977 struct buffer_head **bh)
5979 int ret, block_off, name_offset;
5980 struct ocfs2_xattr_header *xh = bucket_xh(bucket);
5981 struct ocfs2_xattr_entry *xe = &xh->xh_entries[offset];
5984 ret = ocfs2_xattr_bucket_get_name_value(sb,
5994 base = bucket_block(bucket, block_off);
5996 *xv = (struct ocfs2_xattr_value_root *)(base + name_offset +
5997 OCFS2_XATTR_SIZE(xe->xe_name_len));
6000 *bh = bucket->bu_bhs[block_off];
6006 * For a given xattr bucket, refcount all the entries which
6007 * have value stored outside.
6009 static int ocfs2_xattr_bucket_value_refcount(struct inode *inode,
6010 struct ocfs2_xattr_bucket *bucket,
6014 struct ocfs2_extent_tree et;
6015 struct ocfs2_xattr_tree_value_refcount_para *ref =
6016 (struct ocfs2_xattr_tree_value_refcount_para *)para;
6017 struct ocfs2_xattr_header *xh =
6018 (struct ocfs2_xattr_header *)bucket->bu_bhs[0]->b_data;
6019 struct ocfs2_xattr_entry *xe;
6020 struct ocfs2_xattr_value_buf vb = {
6021 .vb_access = ocfs2_journal_access,
6023 struct ocfs2_post_refcount refcount = {
6024 .credits = bucket->bu_blocks,
6026 .func = ocfs2_xattr_bucket_post_refcount,
6028 struct ocfs2_post_refcount *p = NULL;
6030 /* We only need post_refcount if we support metaecc. */
6031 if (ocfs2_meta_ecc(OCFS2_SB(inode->i_sb)))
6034 trace_ocfs2_xattr_bucket_value_refcount(
6035 (unsigned long long)bucket_blkno(bucket),
6036 le16_to_cpu(xh->xh_count));
6037 for (i = 0; i < le16_to_cpu(xh->xh_count); i++) {
6038 xe = &xh->xh_entries[i];
6040 if (ocfs2_xattr_is_local(xe))
6043 ret = ocfs2_get_xattr_tree_value_root(inode->i_sb, bucket, i,
6044 &vb.vb_xv, &vb.vb_bh);
6050 ocfs2_init_xattr_value_extent_tree(&et,
6051 INODE_CACHE(inode), &vb);
6053 ret = ocfs2_xattr_value_attach_refcount(inode, vb.vb_xv,
6067 static int ocfs2_refcount_xattr_tree_rec(struct inode *inode,
6068 struct buffer_head *root_bh,
6069 u64 blkno, u32 cpos, u32 len, void *para)
6071 return ocfs2_iterate_xattr_buckets(inode, blkno, len,
6072 ocfs2_xattr_bucket_value_refcount,
6076 static int ocfs2_xattr_block_attach_refcount(struct inode *inode,
6077 struct buffer_head *blk_bh,
6078 struct ocfs2_caching_info *ref_ci,
6079 struct buffer_head *ref_root_bh,
6080 struct ocfs2_cached_dealloc_ctxt *dealloc)
6083 struct ocfs2_xattr_block *xb =
6084 (struct ocfs2_xattr_block *)blk_bh->b_data;
6086 if (!(le16_to_cpu(xb->xb_flags) & OCFS2_XATTR_INDEXED)) {
6087 struct ocfs2_xattr_header *header = &xb->xb_attrs.xb_header;
6088 struct ocfs2_xattr_value_buf vb = {
6090 .vb_access = ocfs2_journal_access_xb,
6093 ret = ocfs2_xattr_attach_refcount_normal(inode, &vb, header,
6094 ref_ci, ref_root_bh,
6097 struct ocfs2_xattr_tree_value_refcount_para para = {
6099 .ref_root_bh = ref_root_bh,
6103 ret = ocfs2_iterate_xattr_index_block(inode, blk_bh,
6104 ocfs2_refcount_xattr_tree_rec,
6111 int ocfs2_xattr_attach_refcount_tree(struct inode *inode,
6112 struct buffer_head *fe_bh,
6113 struct ocfs2_caching_info *ref_ci,
6114 struct buffer_head *ref_root_bh,
6115 struct ocfs2_cached_dealloc_ctxt *dealloc)
6118 struct ocfs2_inode_info *oi = OCFS2_I(inode);
6119 struct ocfs2_dinode *di = (struct ocfs2_dinode *)fe_bh->b_data;
6120 struct buffer_head *blk_bh = NULL;
6122 if (oi->ip_dyn_features & OCFS2_INLINE_XATTR_FL) {
6123 ret = ocfs2_xattr_inline_attach_refcount(inode, fe_bh,
6124 ref_ci, ref_root_bh,
6132 if (!di->i_xattr_loc)
6135 ret = ocfs2_read_xattr_block(inode, le64_to_cpu(di->i_xattr_loc),
6142 ret = ocfs2_xattr_block_attach_refcount(inode, blk_bh, ref_ci,
6143 ref_root_bh, dealloc);
6153 typedef int (should_xattr_reflinked)(struct ocfs2_xattr_entry *xe);
6155 * Store the information we need in xattr reflink.
6156 * old_bh and new_bh are inode bh for the old and new inode.
6158 struct ocfs2_xattr_reflink {
6159 struct inode *old_inode;
6160 struct inode *new_inode;
6161 struct buffer_head *old_bh;
6162 struct buffer_head *new_bh;
6163 struct ocfs2_caching_info *ref_ci;
6164 struct buffer_head *ref_root_bh;
6165 struct ocfs2_cached_dealloc_ctxt *dealloc;
6166 should_xattr_reflinked *xattr_reflinked;
6170 * Given a xattr header and xe offset,
6171 * return the proper xv and the corresponding bh.
6172 * xattr in inode, block and xattr tree have different implementaions.
6174 typedef int (get_xattr_value_root)(struct super_block *sb,
6175 struct buffer_head *bh,
6176 struct ocfs2_xattr_header *xh,
6178 struct ocfs2_xattr_value_root **xv,
6179 struct buffer_head **ret_bh,
6183 * Calculate all the xattr value root metadata stored in this xattr header and
6184 * credits we need if we create them from the scratch.
6185 * We use get_xattr_value_root so that all types of xattr container can use it.
6187 static int ocfs2_value_metas_in_xattr_header(struct super_block *sb,
6188 struct buffer_head *bh,
6189 struct ocfs2_xattr_header *xh,
6190 int *metas, int *credits,
6192 get_xattr_value_root *func,
6196 struct ocfs2_xattr_value_root *xv;
6197 struct ocfs2_xattr_entry *xe;
6199 for (i = 0; i < le16_to_cpu(xh->xh_count); i++) {
6200 xe = &xh->xh_entries[i];
6201 if (ocfs2_xattr_is_local(xe))
6204 ret = func(sb, bh, xh, i, &xv, NULL, para);
6210 *metas += le16_to_cpu(xv->xr_list.l_tree_depth) *
6211 le16_to_cpu(xv->xr_list.l_next_free_rec);
6213 *credits += ocfs2_calc_extend_credits(sb,
6214 &def_xv.xv.xr_list);
6217 * If the value is a tree with depth > 1, We don't go deep
6218 * to the extent block, so just calculate a maximum record num.
6220 if (!xv->xr_list.l_tree_depth)
6221 *num_recs += le16_to_cpu(xv->xr_list.l_next_free_rec);
6223 *num_recs += ocfs2_clusters_for_bytes(sb,
6230 /* Used by xattr inode and block to return the right xv and buffer_head. */
6231 static int ocfs2_get_xattr_value_root(struct super_block *sb,
6232 struct buffer_head *bh,
6233 struct ocfs2_xattr_header *xh,
6235 struct ocfs2_xattr_value_root **xv,
6236 struct buffer_head **ret_bh,
6239 struct ocfs2_xattr_entry *xe = &xh->xh_entries[offset];
6241 *xv = (struct ocfs2_xattr_value_root *)((void *)xh +
6242 le16_to_cpu(xe->xe_name_offset) +
6243 OCFS2_XATTR_SIZE(xe->xe_name_len));
6252 * Lock the meta_ac and caculate how much credits we need for reflink xattrs.
6253 * It is only used for inline xattr and xattr block.
6255 static int ocfs2_reflink_lock_xattr_allocators(struct ocfs2_super *osb,
6256 struct ocfs2_xattr_header *xh,
6257 struct buffer_head *ref_root_bh,
6259 struct ocfs2_alloc_context **meta_ac)
6261 int ret, meta_add = 0, num_recs = 0;
6262 struct ocfs2_refcount_block *rb =
6263 (struct ocfs2_refcount_block *)ref_root_bh->b_data;
6267 ret = ocfs2_value_metas_in_xattr_header(osb->sb, NULL, xh,
6268 &meta_add, credits, &num_recs,
6269 ocfs2_get_xattr_value_root,
6277 * We need to add/modify num_recs in refcount tree, so just calculate
6278 * an approximate number we need for refcount tree change.
6279 * Sometimes we need to split the tree, and after split, half recs
6280 * will be moved to the new block, and a new block can only provide
6281 * half number of recs. So we multiple new blocks by 2.
6283 num_recs = num_recs / ocfs2_refcount_recs_per_rb(osb->sb) * 2;
6284 meta_add += num_recs;
6285 *credits += num_recs + num_recs * OCFS2_EXPAND_REFCOUNT_TREE_CREDITS;
6286 if (le32_to_cpu(rb->rf_flags) & OCFS2_REFCOUNT_TREE_FL)
6287 *credits += le16_to_cpu(rb->rf_list.l_tree_depth) *
6288 le16_to_cpu(rb->rf_list.l_next_free_rec) + 1;
6292 ret = ocfs2_reserve_new_metadata_blocks(osb, meta_add, meta_ac);
6301 * Given a xattr header, reflink all the xattrs in this container.
6302 * It can be used for inode, block and bucket.
6305 * Before we call this function, the caller has memcpy the xattr in
6306 * old_xh to the new_xh.
6308 * If args.xattr_reflinked is set, call it to decide whether the xe should
6309 * be reflinked or not. If not, remove it from the new xattr header.
6311 static int ocfs2_reflink_xattr_header(handle_t *handle,
6312 struct ocfs2_xattr_reflink *args,
6313 struct buffer_head *old_bh,
6314 struct ocfs2_xattr_header *xh,
6315 struct buffer_head *new_bh,
6316 struct ocfs2_xattr_header *new_xh,
6317 struct ocfs2_xattr_value_buf *vb,
6318 struct ocfs2_alloc_context *meta_ac,
6319 get_xattr_value_root *func,
6323 struct super_block *sb = args->old_inode->i_sb;
6324 struct buffer_head *value_bh;
6325 struct ocfs2_xattr_entry *xe, *last;
6326 struct ocfs2_xattr_value_root *xv, *new_xv;
6327 struct ocfs2_extent_tree data_et;
6328 u32 clusters, cpos, p_cluster, num_clusters;
6329 unsigned int ext_flags = 0;
6331 trace_ocfs2_reflink_xattr_header((unsigned long long)old_bh->b_blocknr,
6332 le16_to_cpu(xh->xh_count));
6334 last = &new_xh->xh_entries[le16_to_cpu(new_xh->xh_count)];
6335 for (i = 0, j = 0; i < le16_to_cpu(xh->xh_count); i++, j++) {
6336 xe = &xh->xh_entries[i];
6338 if (args->xattr_reflinked && !args->xattr_reflinked(xe)) {
6339 xe = &new_xh->xh_entries[j];
6341 le16_add_cpu(&new_xh->xh_count, -1);
6342 if (new_xh->xh_count) {
6344 (void *)last - (void *)xe);
6346 sizeof(struct ocfs2_xattr_entry));
6350 * We don't want j to increase in the next round since
6351 * it is already moved ahead.
6357 if (ocfs2_xattr_is_local(xe))
6360 ret = func(sb, old_bh, xh, i, &xv, NULL, para);
6366 ret = func(sb, new_bh, new_xh, j, &new_xv, &value_bh, para);
6373 * For the xattr which has l_tree_depth = 0, all the extent
6374 * recs have already be copied to the new xh with the
6375 * propriate OCFS2_EXT_REFCOUNTED flag we just need to
6376 * increase the refount count int the refcount tree.
6378 * For the xattr which has l_tree_depth > 0, we need
6379 * to initialize it to the empty default value root,
6380 * and then insert the extents one by one.
6382 if (xv->xr_list.l_tree_depth) {
6383 memcpy(new_xv, &def_xv, sizeof(def_xv));
6385 vb->vb_bh = value_bh;
6386 ocfs2_init_xattr_value_extent_tree(&data_et,
6387 INODE_CACHE(args->new_inode), vb);
6390 clusters = le32_to_cpu(xv->xr_clusters);
6392 while (cpos < clusters) {
6393 ret = ocfs2_xattr_get_clusters(args->old_inode,
6406 if (xv->xr_list.l_tree_depth) {
6407 ret = ocfs2_insert_extent(handle,
6409 ocfs2_clusters_to_blocks(
6410 args->old_inode->i_sb,
6412 num_clusters, ext_flags,
6420 ret = ocfs2_increase_refcount(handle, args->ref_ci,
6422 p_cluster, num_clusters,
6423 meta_ac, args->dealloc);
6429 cpos += num_clusters;
6437 static int ocfs2_reflink_xattr_inline(struct ocfs2_xattr_reflink *args)
6439 int ret = 0, credits = 0;
6441 struct ocfs2_super *osb = OCFS2_SB(args->old_inode->i_sb);
6442 struct ocfs2_dinode *di = (struct ocfs2_dinode *)args->old_bh->b_data;
6443 int inline_size = le16_to_cpu(di->i_xattr_inline_size);
6444 int header_off = osb->sb->s_blocksize - inline_size;
6445 struct ocfs2_xattr_header *xh = (struct ocfs2_xattr_header *)
6446 (args->old_bh->b_data + header_off);
6447 struct ocfs2_xattr_header *new_xh = (struct ocfs2_xattr_header *)
6448 (args->new_bh->b_data + header_off);
6449 struct ocfs2_alloc_context *meta_ac = NULL;
6450 struct ocfs2_inode_info *new_oi;
6451 struct ocfs2_dinode *new_di;
6452 struct ocfs2_xattr_value_buf vb = {
6453 .vb_bh = args->new_bh,
6454 .vb_access = ocfs2_journal_access_di,
6457 ret = ocfs2_reflink_lock_xattr_allocators(osb, xh, args->ref_root_bh,
6458 &credits, &meta_ac);
6464 handle = ocfs2_start_trans(osb, credits);
6465 if (IS_ERR(handle)) {
6466 ret = PTR_ERR(handle);
6471 ret = ocfs2_journal_access_di(handle, INODE_CACHE(args->new_inode),
6472 args->new_bh, OCFS2_JOURNAL_ACCESS_WRITE);
6478 memcpy(args->new_bh->b_data + header_off,
6479 args->old_bh->b_data + header_off, inline_size);
6481 new_di = (struct ocfs2_dinode *)args->new_bh->b_data;
6482 new_di->i_xattr_inline_size = cpu_to_le16(inline_size);
6484 ret = ocfs2_reflink_xattr_header(handle, args, args->old_bh, xh,
6485 args->new_bh, new_xh, &vb, meta_ac,
6486 ocfs2_get_xattr_value_root, NULL);
6492 new_oi = OCFS2_I(args->new_inode);
6494 * Adjust extent record count to reserve space for extended attribute.
6495 * Inline data count had been adjusted in ocfs2_duplicate_inline_data().
6497 if (!(new_oi->ip_dyn_features & OCFS2_INLINE_DATA_FL) &&
6498 !(ocfs2_inode_is_fast_symlink(args->new_inode))) {
6499 struct ocfs2_extent_list *el = &new_di->id2.i_list;
6500 le16_add_cpu(&el->l_count, -(inline_size /
6501 sizeof(struct ocfs2_extent_rec)));
6503 spin_lock(&new_oi->ip_lock);
6504 new_oi->ip_dyn_features |= OCFS2_HAS_XATTR_FL | OCFS2_INLINE_XATTR_FL;
6505 new_di->i_dyn_features = cpu_to_le16(new_oi->ip_dyn_features);
6506 spin_unlock(&new_oi->ip_lock);
6508 ocfs2_journal_dirty(handle, args->new_bh);
6511 ocfs2_commit_trans(osb, handle);
6515 ocfs2_free_alloc_context(meta_ac);
6519 static int ocfs2_create_empty_xattr_block(struct inode *inode,
6520 struct buffer_head *fe_bh,
6521 struct buffer_head **ret_bh,
6525 struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
6526 struct ocfs2_xattr_set_ctxt ctxt;
6528 memset(&ctxt, 0, sizeof(ctxt));
6529 ret = ocfs2_reserve_new_metadata_blocks(osb, 1, &ctxt.meta_ac);
6535 ctxt.handle = ocfs2_start_trans(osb, OCFS2_XATTR_BLOCK_CREATE_CREDITS);
6536 if (IS_ERR(ctxt.handle)) {
6537 ret = PTR_ERR(ctxt.handle);
6542 trace_ocfs2_create_empty_xattr_block(
6543 (unsigned long long)fe_bh->b_blocknr, indexed);
6544 ret = ocfs2_create_xattr_block(inode, fe_bh, &ctxt, indexed,
6549 ocfs2_commit_trans(osb, ctxt.handle);
6551 ocfs2_free_alloc_context(ctxt.meta_ac);
6555 static int ocfs2_reflink_xattr_block(struct ocfs2_xattr_reflink *args,
6556 struct buffer_head *blk_bh,
6557 struct buffer_head *new_blk_bh)
6559 int ret = 0, credits = 0;
6561 struct ocfs2_inode_info *new_oi = OCFS2_I(args->new_inode);
6562 struct ocfs2_dinode *new_di;
6563 struct ocfs2_super *osb = OCFS2_SB(args->new_inode->i_sb);
6564 int header_off = offsetof(struct ocfs2_xattr_block, xb_attrs.xb_header);
6565 struct ocfs2_xattr_block *xb =
6566 (struct ocfs2_xattr_block *)blk_bh->b_data;
6567 struct ocfs2_xattr_header *xh = &xb->xb_attrs.xb_header;
6568 struct ocfs2_xattr_block *new_xb =
6569 (struct ocfs2_xattr_block *)new_blk_bh->b_data;
6570 struct ocfs2_xattr_header *new_xh = &new_xb->xb_attrs.xb_header;
6571 struct ocfs2_alloc_context *meta_ac;
6572 struct ocfs2_xattr_value_buf vb = {
6573 .vb_bh = new_blk_bh,
6574 .vb_access = ocfs2_journal_access_xb,
6577 ret = ocfs2_reflink_lock_xattr_allocators(osb, xh, args->ref_root_bh,
6578 &credits, &meta_ac);
6584 /* One more credits in case we need to add xattr flags in new inode. */
6585 handle = ocfs2_start_trans(osb, credits + 1);
6586 if (IS_ERR(handle)) {
6587 ret = PTR_ERR(handle);
6592 if (!(new_oi->ip_dyn_features & OCFS2_HAS_XATTR_FL)) {
6593 ret = ocfs2_journal_access_di(handle,
6594 INODE_CACHE(args->new_inode),
6596 OCFS2_JOURNAL_ACCESS_WRITE);
6603 ret = ocfs2_journal_access_xb(handle, INODE_CACHE(args->new_inode),
6604 new_blk_bh, OCFS2_JOURNAL_ACCESS_WRITE);
6610 memcpy(new_blk_bh->b_data + header_off, blk_bh->b_data + header_off,
6611 osb->sb->s_blocksize - header_off);
6613 ret = ocfs2_reflink_xattr_header(handle, args, blk_bh, xh,
6614 new_blk_bh, new_xh, &vb, meta_ac,
6615 ocfs2_get_xattr_value_root, NULL);
6621 ocfs2_journal_dirty(handle, new_blk_bh);
6623 if (!(new_oi->ip_dyn_features & OCFS2_HAS_XATTR_FL)) {
6624 new_di = (struct ocfs2_dinode *)args->new_bh->b_data;
6625 spin_lock(&new_oi->ip_lock);
6626 new_oi->ip_dyn_features |= OCFS2_HAS_XATTR_FL;
6627 new_di->i_dyn_features = cpu_to_le16(new_oi->ip_dyn_features);
6628 spin_unlock(&new_oi->ip_lock);
6630 ocfs2_journal_dirty(handle, args->new_bh);
6634 ocfs2_commit_trans(osb, handle);
6637 ocfs2_free_alloc_context(meta_ac);
6641 struct ocfs2_reflink_xattr_tree_args {
6642 struct ocfs2_xattr_reflink *reflink;
6643 struct buffer_head *old_blk_bh;
6644 struct buffer_head *new_blk_bh;
6645 struct ocfs2_xattr_bucket *old_bucket;
6646 struct ocfs2_xattr_bucket *new_bucket;
6651 * We have to handle the case that both old bucket and new bucket
6652 * will call this function to get the right ret_bh.
6653 * So The caller must give us the right bh.
6655 static int ocfs2_get_reflink_xattr_value_root(struct super_block *sb,
6656 struct buffer_head *bh,
6657 struct ocfs2_xattr_header *xh,
6659 struct ocfs2_xattr_value_root **xv,
6660 struct buffer_head **ret_bh,
6663 struct ocfs2_reflink_xattr_tree_args *args =
6664 (struct ocfs2_reflink_xattr_tree_args *)para;
6665 struct ocfs2_xattr_bucket *bucket;
6667 if (bh == args->old_bucket->bu_bhs[0])
6668 bucket = args->old_bucket;
6670 bucket = args->new_bucket;
6672 return ocfs2_get_xattr_tree_value_root(sb, bucket, offset,
6676 struct ocfs2_value_tree_metas {
6682 static int ocfs2_value_tree_metas_in_bucket(struct super_block *sb,
6683 struct buffer_head *bh,
6684 struct ocfs2_xattr_header *xh,
6686 struct ocfs2_xattr_value_root **xv,
6687 struct buffer_head **ret_bh,
6690 struct ocfs2_xattr_bucket *bucket =
6691 (struct ocfs2_xattr_bucket *)para;
6693 return ocfs2_get_xattr_tree_value_root(sb, bucket, offset,
6697 static int ocfs2_calc_value_tree_metas(struct inode *inode,
6698 struct ocfs2_xattr_bucket *bucket,
6701 struct ocfs2_value_tree_metas *metas =
6702 (struct ocfs2_value_tree_metas *)para;
6703 struct ocfs2_xattr_header *xh =
6704 (struct ocfs2_xattr_header *)bucket->bu_bhs[0]->b_data;
6706 /* Add the credits for this bucket first. */
6707 metas->credits += bucket->bu_blocks;
6708 return ocfs2_value_metas_in_xattr_header(inode->i_sb, bucket->bu_bhs[0],
6709 xh, &metas->num_metas,
6710 &metas->credits, &metas->num_recs,
6711 ocfs2_value_tree_metas_in_bucket,
6716 * Given a xattr extent rec starting from blkno and having len clusters,
6717 * iterate all the buckets calculate how much metadata we need for reflinking
6718 * all the ocfs2_xattr_value_root and lock the allocators accordingly.
6720 static int ocfs2_lock_reflink_xattr_rec_allocators(
6721 struct ocfs2_reflink_xattr_tree_args *args,
6722 struct ocfs2_extent_tree *xt_et,
6723 u64 blkno, u32 len, int *credits,
6724 struct ocfs2_alloc_context **meta_ac,
6725 struct ocfs2_alloc_context **data_ac)
6727 int ret, num_free_extents;
6728 struct ocfs2_value_tree_metas metas;
6729 struct ocfs2_super *osb = OCFS2_SB(args->reflink->old_inode->i_sb);
6730 struct ocfs2_refcount_block *rb;
6732 memset(&metas, 0, sizeof(metas));
6734 ret = ocfs2_iterate_xattr_buckets(args->reflink->old_inode, blkno, len,
6735 ocfs2_calc_value_tree_metas, &metas);
6741 *credits = metas.credits;
6744 * Calculate we need for refcount tree change.
6746 * We need to add/modify num_recs in refcount tree, so just calculate
6747 * an approximate number we need for refcount tree change.
6748 * Sometimes we need to split the tree, and after split, half recs
6749 * will be moved to the new block, and a new block can only provide
6750 * half number of recs. So we multiple new blocks by 2.
6751 * In the end, we have to add credits for modifying the already
6752 * existed refcount block.
6754 rb = (struct ocfs2_refcount_block *)args->reflink->ref_root_bh->b_data;
6756 (metas.num_recs + ocfs2_refcount_recs_per_rb(osb->sb) - 1) /
6757 ocfs2_refcount_recs_per_rb(osb->sb) * 2;
6758 metas.num_metas += metas.num_recs;
6759 *credits += metas.num_recs +
6760 metas.num_recs * OCFS2_EXPAND_REFCOUNT_TREE_CREDITS;
6761 if (le32_to_cpu(rb->rf_flags) & OCFS2_REFCOUNT_TREE_FL)
6762 *credits += le16_to_cpu(rb->rf_list.l_tree_depth) *
6763 le16_to_cpu(rb->rf_list.l_next_free_rec) + 1;
6767 /* count in the xattr tree change. */
6768 num_free_extents = ocfs2_num_free_extents(osb, xt_et);
6769 if (num_free_extents < 0) {
6770 ret = num_free_extents;
6775 if (num_free_extents < len)
6776 metas.num_metas += ocfs2_extend_meta_needed(xt_et->et_root_el);
6778 *credits += ocfs2_calc_extend_credits(osb->sb,
6781 if (metas.num_metas) {
6782 ret = ocfs2_reserve_new_metadata_blocks(osb, metas.num_metas,
6791 ret = ocfs2_reserve_clusters(osb, len, data_ac);
6798 ocfs2_free_alloc_context(*meta_ac);
6806 static int ocfs2_reflink_xattr_bucket(handle_t *handle,
6807 u64 blkno, u64 new_blkno, u32 clusters,
6808 u32 *cpos, int num_buckets,
6809 struct ocfs2_alloc_context *meta_ac,
6810 struct ocfs2_alloc_context *data_ac,
6811 struct ocfs2_reflink_xattr_tree_args *args)
6814 struct super_block *sb = args->reflink->old_inode->i_sb;
6815 int bpb = args->old_bucket->bu_blocks;
6816 struct ocfs2_xattr_value_buf vb = {
6817 .vb_access = ocfs2_journal_access,
6820 for (i = 0; i < num_buckets; i++, blkno += bpb, new_blkno += bpb) {
6821 ret = ocfs2_read_xattr_bucket(args->old_bucket, blkno);
6827 ret = ocfs2_init_xattr_bucket(args->new_bucket, new_blkno);
6833 ret = ocfs2_xattr_bucket_journal_access(handle,
6835 OCFS2_JOURNAL_ACCESS_CREATE);
6841 for (j = 0; j < bpb; j++)
6842 memcpy(bucket_block(args->new_bucket, j),
6843 bucket_block(args->old_bucket, j),
6847 * Record the start cpos so that we can use it to initialize
6848 * our xattr tree we also set the xh_num_bucket for the new
6852 *cpos = le32_to_cpu(bucket_xh(args->new_bucket)->
6853 xh_entries[0].xe_name_hash);
6854 bucket_xh(args->new_bucket)->xh_num_buckets =
6855 cpu_to_le16(num_buckets);
6858 ocfs2_xattr_bucket_journal_dirty(handle, args->new_bucket);
6860 ret = ocfs2_reflink_xattr_header(handle, args->reflink,
6861 args->old_bucket->bu_bhs[0],
6862 bucket_xh(args->old_bucket),
6863 args->new_bucket->bu_bhs[0],
6864 bucket_xh(args->new_bucket),
6866 ocfs2_get_reflink_xattr_value_root,
6874 * Re-access and dirty the bucket to calculate metaecc.
6875 * Because we may extend the transaction in reflink_xattr_header
6876 * which will let the already accessed block gone.
6878 ret = ocfs2_xattr_bucket_journal_access(handle,
6880 OCFS2_JOURNAL_ACCESS_WRITE);
6886 ocfs2_xattr_bucket_journal_dirty(handle, args->new_bucket);
6888 ocfs2_xattr_bucket_relse(args->old_bucket);
6889 ocfs2_xattr_bucket_relse(args->new_bucket);
6892 ocfs2_xattr_bucket_relse(args->old_bucket);
6893 ocfs2_xattr_bucket_relse(args->new_bucket);
6897 static int ocfs2_reflink_xattr_buckets(handle_t *handle,
6898 struct inode *inode,
6899 struct ocfs2_reflink_xattr_tree_args *args,
6900 struct ocfs2_extent_tree *et,
6901 struct ocfs2_alloc_context *meta_ac,
6902 struct ocfs2_alloc_context *data_ac,
6903 u64 blkno, u32 cpos, u32 len)
6905 int ret, first_inserted = 0;
6906 u32 p_cluster, num_clusters, reflink_cpos = 0;
6908 unsigned int num_buckets, reflink_buckets;
6910 ocfs2_xattr_buckets_per_cluster(OCFS2_SB(inode->i_sb));
6912 ret = ocfs2_read_xattr_bucket(args->old_bucket, blkno);
6917 num_buckets = le16_to_cpu(bucket_xh(args->old_bucket)->xh_num_buckets);
6918 ocfs2_xattr_bucket_relse(args->old_bucket);
6920 while (len && num_buckets) {
6921 ret = ocfs2_claim_clusters(handle, data_ac,
6922 1, &p_cluster, &num_clusters);
6928 new_blkno = ocfs2_clusters_to_blocks(inode->i_sb, p_cluster);
6929 reflink_buckets = min(num_buckets, bpc * num_clusters);
6931 ret = ocfs2_reflink_xattr_bucket(handle, blkno,
6932 new_blkno, num_clusters,
6933 &reflink_cpos, reflink_buckets,
6934 meta_ac, data_ac, args);
6941 * For the 1st allocated cluster, we make it use the same cpos
6942 * so that the xattr tree looks the same as the original one
6945 if (!first_inserted) {
6946 reflink_cpos = cpos;
6949 ret = ocfs2_insert_extent(handle, et, reflink_cpos, new_blkno,
6950 num_clusters, 0, meta_ac);
6954 trace_ocfs2_reflink_xattr_buckets((unsigned long long)new_blkno,
6955 num_clusters, reflink_cpos);
6957 len -= num_clusters;
6958 blkno += ocfs2_clusters_to_blocks(inode->i_sb, num_clusters);
6959 num_buckets -= reflink_buckets;
6966 * Create the same xattr extent record in the new inode's xattr tree.
6968 static int ocfs2_reflink_xattr_rec(struct inode *inode,
6969 struct buffer_head *root_bh,
6975 int ret, credits = 0;
6977 struct ocfs2_reflink_xattr_tree_args *args =
6978 (struct ocfs2_reflink_xattr_tree_args *)para;
6979 struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
6980 struct ocfs2_alloc_context *meta_ac = NULL;
6981 struct ocfs2_alloc_context *data_ac = NULL;
6982 struct ocfs2_extent_tree et;
6984 trace_ocfs2_reflink_xattr_rec((unsigned long long)blkno, len);
6986 ocfs2_init_xattr_tree_extent_tree(&et,
6987 INODE_CACHE(args->reflink->new_inode),
6990 ret = ocfs2_lock_reflink_xattr_rec_allocators(args, &et, blkno,
6992 &meta_ac, &data_ac);
6998 handle = ocfs2_start_trans(osb, credits);
6999 if (IS_ERR(handle)) {
7000 ret = PTR_ERR(handle);
7005 ret = ocfs2_reflink_xattr_buckets(handle, inode, args, &et,
7011 ocfs2_commit_trans(osb, handle);
7015 ocfs2_free_alloc_context(meta_ac);
7017 ocfs2_free_alloc_context(data_ac);
7022 * Create reflinked xattr buckets.
7023 * We will add bucket one by one, and refcount all the xattrs in the bucket
7024 * if they are stored outside.
7026 static int ocfs2_reflink_xattr_tree(struct ocfs2_xattr_reflink *args,
7027 struct buffer_head *blk_bh,
7028 struct buffer_head *new_blk_bh)
7031 struct ocfs2_reflink_xattr_tree_args para;
7033 memset(¶, 0, sizeof(para));
7034 para.reflink = args;
7035 para.old_blk_bh = blk_bh;
7036 para.new_blk_bh = new_blk_bh;
7038 para.old_bucket = ocfs2_xattr_bucket_new(args->old_inode);
7039 if (!para.old_bucket) {
7040 mlog_errno(-ENOMEM);
7044 para.new_bucket = ocfs2_xattr_bucket_new(args->new_inode);
7045 if (!para.new_bucket) {
7051 ret = ocfs2_iterate_xattr_index_block(args->old_inode, blk_bh,
7052 ocfs2_reflink_xattr_rec,
7058 ocfs2_xattr_bucket_free(para.old_bucket);
7059 ocfs2_xattr_bucket_free(para.new_bucket);
7063 static int ocfs2_reflink_xattr_in_block(struct ocfs2_xattr_reflink *args,
7064 struct buffer_head *blk_bh)
7066 int ret, indexed = 0;
7067 struct buffer_head *new_blk_bh = NULL;
7068 struct ocfs2_xattr_block *xb =
7069 (struct ocfs2_xattr_block *)blk_bh->b_data;
7072 if (le16_to_cpu(xb->xb_flags) & OCFS2_XATTR_INDEXED)
7075 ret = ocfs2_create_empty_xattr_block(args->new_inode, args->new_bh,
7076 &new_blk_bh, indexed);
7083 ret = ocfs2_reflink_xattr_block(args, blk_bh, new_blk_bh);
7085 ret = ocfs2_reflink_xattr_tree(args, blk_bh, new_blk_bh);
7094 static int ocfs2_reflink_xattr_no_security(struct ocfs2_xattr_entry *xe)
7096 int type = ocfs2_xattr_get_type(xe);
7098 return type != OCFS2_XATTR_INDEX_SECURITY &&
7099 type != OCFS2_XATTR_INDEX_POSIX_ACL_ACCESS &&
7100 type != OCFS2_XATTR_INDEX_POSIX_ACL_DEFAULT;
7103 int ocfs2_reflink_xattrs(struct inode *old_inode,
7104 struct buffer_head *old_bh,
7105 struct inode *new_inode,
7106 struct buffer_head *new_bh,
7107 bool preserve_security)
7110 struct ocfs2_xattr_reflink args;
7111 struct ocfs2_inode_info *oi = OCFS2_I(old_inode);
7112 struct ocfs2_dinode *di = (struct ocfs2_dinode *)old_bh->b_data;
7113 struct buffer_head *blk_bh = NULL;
7114 struct ocfs2_cached_dealloc_ctxt dealloc;
7115 struct ocfs2_refcount_tree *ref_tree;
7116 struct buffer_head *ref_root_bh = NULL;
7118 ret = ocfs2_lock_refcount_tree(OCFS2_SB(old_inode->i_sb),
7119 le64_to_cpu(di->i_refcount_loc),
7120 1, &ref_tree, &ref_root_bh);
7126 ocfs2_init_dealloc_ctxt(&dealloc);
7128 args.old_inode = old_inode;
7129 args.new_inode = new_inode;
7130 args.old_bh = old_bh;
7131 args.new_bh = new_bh;
7132 args.ref_ci = &ref_tree->rf_ci;
7133 args.ref_root_bh = ref_root_bh;
7134 args.dealloc = &dealloc;
7135 if (preserve_security)
7136 args.xattr_reflinked = NULL;
7138 args.xattr_reflinked = ocfs2_reflink_xattr_no_security;
7140 if (oi->ip_dyn_features & OCFS2_INLINE_XATTR_FL) {
7141 ret = ocfs2_reflink_xattr_inline(&args);
7148 if (!di->i_xattr_loc)
7151 ret = ocfs2_read_xattr_block(old_inode, le64_to_cpu(di->i_xattr_loc),
7158 ret = ocfs2_reflink_xattr_in_block(&args, blk_bh);
7165 ocfs2_unlock_refcount_tree(OCFS2_SB(old_inode->i_sb),
7167 brelse(ref_root_bh);
7169 if (ocfs2_dealloc_has_cluster(&dealloc)) {
7170 ocfs2_schedule_truncate_log_flush(OCFS2_SB(old_inode->i_sb), 1);
7171 ocfs2_run_deallocs(OCFS2_SB(old_inode->i_sb), &dealloc);
7179 * Initialize security and acl for a already created inode.
7180 * Used for reflink a non-preserve-security file.
7182 * It uses common api like ocfs2_xattr_set, so the caller
7183 * must not hold any lock expect i_mutex.
7185 int ocfs2_init_security_and_acl(struct inode *dir,
7186 struct inode *inode,
7187 const struct qstr *qstr)
7190 struct buffer_head *dir_bh = NULL;
7192 ret = ocfs2_init_security_get(inode, dir, qstr, NULL);
7198 ret = ocfs2_inode_lock(dir, &dir_bh, 0);
7204 ret = ocfs2_init_acl(NULL, inode, dir, NULL, dir_bh, NULL, NULL);
7208 ocfs2_inode_unlock(dir, 0);
7214 * 'security' attributes support
7216 static size_t ocfs2_xattr_security_list(struct dentry *dentry, char *list,
7217 size_t list_size, const char *name,
7218 size_t name_len, int type)
7220 const size_t prefix_len = XATTR_SECURITY_PREFIX_LEN;
7221 const size_t total_len = prefix_len + name_len + 1;
7223 if (list && total_len <= list_size) {
7224 memcpy(list, XATTR_SECURITY_PREFIX, prefix_len);
7225 memcpy(list + prefix_len, name, name_len);
7226 list[prefix_len + name_len] = '\0';
7231 static int ocfs2_xattr_security_get(struct dentry *dentry, const char *name,
7232 void *buffer, size_t size, int type)
7234 if (strcmp(name, "") == 0)
7236 return ocfs2_xattr_get(dentry->d_inode, OCFS2_XATTR_INDEX_SECURITY,
7237 name, buffer, size);
7240 static int ocfs2_xattr_security_set(struct dentry *dentry, const char *name,
7241 const void *value, size_t size, int flags, int type)
7243 if (strcmp(name, "") == 0)
7246 return ocfs2_xattr_set(dentry->d_inode, OCFS2_XATTR_INDEX_SECURITY,
7247 name, value, size, flags);
7250 int ocfs2_initxattrs(struct inode *inode, const struct xattr *xattr_array,
7253 const struct xattr *xattr;
7256 for (xattr = xattr_array; xattr->name != NULL; xattr++) {
7257 err = ocfs2_xattr_set(inode, OCFS2_XATTR_INDEX_SECURITY,
7258 xattr->name, xattr->value,
7259 xattr->value_len, XATTR_CREATE);
7266 int ocfs2_init_security_get(struct inode *inode,
7268 const struct qstr *qstr,
7269 struct ocfs2_security_xattr_info *si)
7271 /* check whether ocfs2 support feature xattr */
7272 if (!ocfs2_supports_xattr(OCFS2_SB(dir->i_sb)))
7275 return security_old_inode_init_security(inode, dir, qstr,
7276 &si->name, &si->value,
7279 return security_inode_init_security(inode, dir, qstr,
7280 &ocfs2_initxattrs, NULL);
7283 int ocfs2_init_security_set(handle_t *handle,
7284 struct inode *inode,
7285 struct buffer_head *di_bh,
7286 struct ocfs2_security_xattr_info *si,
7287 struct ocfs2_alloc_context *xattr_ac,
7288 struct ocfs2_alloc_context *data_ac)
7290 return ocfs2_xattr_set_handle(handle, inode, di_bh,
7291 OCFS2_XATTR_INDEX_SECURITY,
7292 si->name, si->value, si->value_len, 0,
7296 const struct xattr_handler ocfs2_xattr_security_handler = {
7297 .prefix = XATTR_SECURITY_PREFIX,
7298 .list = ocfs2_xattr_security_list,
7299 .get = ocfs2_xattr_security_get,
7300 .set = ocfs2_xattr_security_set,
7304 * 'trusted' attributes support
7306 static size_t ocfs2_xattr_trusted_list(struct dentry *dentry, char *list,
7307 size_t list_size, const char *name,
7308 size_t name_len, int type)
7310 const size_t prefix_len = XATTR_TRUSTED_PREFIX_LEN;
7311 const size_t total_len = prefix_len + name_len + 1;
7313 if (list && total_len <= list_size) {
7314 memcpy(list, XATTR_TRUSTED_PREFIX, prefix_len);
7315 memcpy(list + prefix_len, name, name_len);
7316 list[prefix_len + name_len] = '\0';
7321 static int ocfs2_xattr_trusted_get(struct dentry *dentry, const char *name,
7322 void *buffer, size_t size, int type)
7324 if (strcmp(name, "") == 0)
7326 return ocfs2_xattr_get(dentry->d_inode, OCFS2_XATTR_INDEX_TRUSTED,
7327 name, buffer, size);
7330 static int ocfs2_xattr_trusted_set(struct dentry *dentry, const char *name,
7331 const void *value, size_t size, int flags, int type)
7333 if (strcmp(name, "") == 0)
7336 return ocfs2_xattr_set(dentry->d_inode, OCFS2_XATTR_INDEX_TRUSTED,
7337 name, value, size, flags);
7340 const struct xattr_handler ocfs2_xattr_trusted_handler = {
7341 .prefix = XATTR_TRUSTED_PREFIX,
7342 .list = ocfs2_xattr_trusted_list,
7343 .get = ocfs2_xattr_trusted_get,
7344 .set = ocfs2_xattr_trusted_set,
7348 * 'user' attributes support
7350 static size_t ocfs2_xattr_user_list(struct dentry *dentry, char *list,
7351 size_t list_size, const char *name,
7352 size_t name_len, int type)
7354 const size_t prefix_len = XATTR_USER_PREFIX_LEN;
7355 const size_t total_len = prefix_len + name_len + 1;
7356 struct ocfs2_super *osb = OCFS2_SB(dentry->d_sb);
7358 if (osb->s_mount_opt & OCFS2_MOUNT_NOUSERXATTR)
7361 if (list && total_len <= list_size) {
7362 memcpy(list, XATTR_USER_PREFIX, prefix_len);
7363 memcpy(list + prefix_len, name, name_len);
7364 list[prefix_len + name_len] = '\0';
7369 static int ocfs2_xattr_user_get(struct dentry *dentry, const char *name,
7370 void *buffer, size_t size, int type)
7372 struct ocfs2_super *osb = OCFS2_SB(dentry->d_sb);
7374 if (strcmp(name, "") == 0)
7376 if (osb->s_mount_opt & OCFS2_MOUNT_NOUSERXATTR)
7378 return ocfs2_xattr_get(dentry->d_inode, OCFS2_XATTR_INDEX_USER, name,
7382 static int ocfs2_xattr_user_set(struct dentry *dentry, const char *name,
7383 const void *value, size_t size, int flags, int type)
7385 struct ocfs2_super *osb = OCFS2_SB(dentry->d_sb);
7387 if (strcmp(name, "") == 0)
7389 if (osb->s_mount_opt & OCFS2_MOUNT_NOUSERXATTR)
7392 return ocfs2_xattr_set(dentry->d_inode, OCFS2_XATTR_INDEX_USER,
7393 name, value, size, flags);
7396 const struct xattr_handler ocfs2_xattr_user_handler = {
7397 .prefix = XATTR_USER_PREFIX,
7398 .list = ocfs2_xattr_user_list,
7399 .get = ocfs2_xattr_user_get,
7400 .set = ocfs2_xattr_user_set,