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,
759
status = ocfs2_extend_trans(handle, credits);
771
static int __ocfs2_remove_xattr_range(struct inode *inode,
772
struct ocfs2_xattr_value_buf *vb,
773
u32 cpos, u32 phys_cpos, u32 len,
774
unsigned int ext_flags,
775
struct ocfs2_xattr_set_ctxt *ctxt)
778
u64 phys_blkno = ocfs2_clusters_to_blocks(inode->i_sb, phys_cpos);
779
handle_t *handle = ctxt->handle;
780
struct ocfs2_extent_tree et;
782
ocfs2_init_xattr_value_extent_tree(&et, INODE_CACHE(inode), vb);
784
ret = vb->vb_access(handle, INODE_CACHE(inode), vb->vb_bh,
785
OCFS2_JOURNAL_ACCESS_WRITE);
791
ret = ocfs2_remove_extent(handle, &et, cpos, len, ctxt->meta_ac,
798
le32_add_cpu(&vb->vb_xv->xr_clusters, -len);
799
ocfs2_journal_dirty(handle, vb->vb_bh);
801
if (ext_flags & OCFS2_EXT_REFCOUNTED)
802
ret = ocfs2_decrease_refcount(inode, handle,
803
ocfs2_blocks_to_clusters(inode->i_sb,
805
len, ctxt->meta_ac, &ctxt->dealloc, 1);
807
ret = ocfs2_cache_cluster_dealloc(&ctxt->dealloc,
816
static int ocfs2_xattr_shrink_size(struct inode *inode,
819
struct ocfs2_xattr_value_buf *vb,
820
struct ocfs2_xattr_set_ctxt *ctxt)
823
unsigned int ext_flags;
824
u32 trunc_len, cpos, phys_cpos, alloc_size;
827
if (old_clusters <= new_clusters)
831
trunc_len = old_clusters - new_clusters;
833
ret = ocfs2_xattr_get_clusters(inode, cpos, &phys_cpos,
835
&vb->vb_xv->xr_list, &ext_flags);
841
if (alloc_size > trunc_len)
842
alloc_size = trunc_len;
844
ret = __ocfs2_remove_xattr_range(inode, vb, cpos,
845
phys_cpos, alloc_size,
852
block = ocfs2_clusters_to_blocks(inode->i_sb, phys_cpos);
853
ocfs2_remove_xattr_clusters_from_cache(INODE_CACHE(inode),
856
trunc_len -= alloc_size;
863
static int ocfs2_xattr_value_truncate(struct inode *inode,
864
struct ocfs2_xattr_value_buf *vb,
866
struct ocfs2_xattr_set_ctxt *ctxt)
869
u32 new_clusters = ocfs2_clusters_for_bytes(inode->i_sb, len);
870
u32 old_clusters = le32_to_cpu(vb->vb_xv->xr_clusters);
872
if (new_clusters == old_clusters)
875
if (new_clusters > old_clusters)
876
ret = ocfs2_xattr_extend_allocation(inode,
877
new_clusters - old_clusters,
880
ret = ocfs2_xattr_shrink_size(inode,
881
old_clusters, new_clusters,
887
static int ocfs2_xattr_list_entry(char *buffer, size_t size,
888
size_t *result, const char *prefix,
889
const char *name, int name_len)
891
char *p = buffer + *result;
892
int prefix_len = strlen(prefix);
893
int total_len = prefix_len + name_len + 1;
895
*result += total_len;
897
/* we are just looking for how big our buffer needs to be */
904
memcpy(p, prefix, prefix_len);
905
memcpy(p + prefix_len, name, name_len);
906
p[prefix_len + name_len] = '\0';
911
static int ocfs2_xattr_list_entries(struct inode *inode,
912
struct ocfs2_xattr_header *header,
913
char *buffer, size_t buffer_size)
917
const char *prefix, *name;
919
for (i = 0 ; i < le16_to_cpu(header->xh_count); i++) {
920
struct ocfs2_xattr_entry *entry = &header->xh_entries[i];
921
type = ocfs2_xattr_get_type(entry);
922
prefix = ocfs2_xattr_prefix(type);
925
name = (const char *)header +
926
le16_to_cpu(entry->xe_name_offset);
928
ret = ocfs2_xattr_list_entry(buffer, buffer_size,
929
&result, prefix, name,
939
int ocfs2_has_inline_xattr_value_outside(struct inode *inode,
940
struct ocfs2_dinode *di)
942
struct ocfs2_xattr_header *xh;
945
xh = (struct ocfs2_xattr_header *)
946
((void *)di + inode->i_sb->s_blocksize -
947
le16_to_cpu(di->i_xattr_inline_size));
949
for (i = 0; i < le16_to_cpu(xh->xh_count); i++)
950
if (!ocfs2_xattr_is_local(&xh->xh_entries[i]))
956
static int ocfs2_xattr_ibody_list(struct inode *inode,
957
struct ocfs2_dinode *di,
961
struct ocfs2_xattr_header *header = NULL;
962
struct ocfs2_inode_info *oi = OCFS2_I(inode);
965
if (!(oi->ip_dyn_features & OCFS2_INLINE_XATTR_FL))
968
header = (struct ocfs2_xattr_header *)
969
((void *)di + inode->i_sb->s_blocksize -
970
le16_to_cpu(di->i_xattr_inline_size));
972
ret = ocfs2_xattr_list_entries(inode, header, buffer, buffer_size);
977
static int ocfs2_xattr_block_list(struct inode *inode,
978
struct ocfs2_dinode *di,
982
struct buffer_head *blk_bh = NULL;
983
struct ocfs2_xattr_block *xb;
986
if (!di->i_xattr_loc)
989
ret = ocfs2_read_xattr_block(inode, le64_to_cpu(di->i_xattr_loc),
996
xb = (struct ocfs2_xattr_block *)blk_bh->b_data;
997
if (!(le16_to_cpu(xb->xb_flags) & OCFS2_XATTR_INDEXED)) {
998
struct ocfs2_xattr_header *header = &xb->xb_attrs.xb_header;
999
ret = ocfs2_xattr_list_entries(inode, header,
1000
buffer, buffer_size);
1002
ret = ocfs2_xattr_tree_list_index_block(inode, blk_bh,
1003
buffer, buffer_size);
1010
ssize_t ocfs2_listxattr(struct dentry *dentry,
1014
int ret = 0, i_ret = 0, b_ret = 0;
1015
struct buffer_head *di_bh = NULL;
1016
struct ocfs2_dinode *di = NULL;
1017
struct ocfs2_inode_info *oi = OCFS2_I(dentry->d_inode);
1019
if (!ocfs2_supports_xattr(OCFS2_SB(dentry->d_sb)))
1022
if (!(oi->ip_dyn_features & OCFS2_HAS_XATTR_FL))
1025
ret = ocfs2_inode_lock(dentry->d_inode, &di_bh, 0);
1031
di = (struct ocfs2_dinode *)di_bh->b_data;
1033
down_read(&oi->ip_xattr_sem);
1034
i_ret = ocfs2_xattr_ibody_list(dentry->d_inode, di, buffer, size);
1042
b_ret = ocfs2_xattr_block_list(dentry->d_inode, di,
1047
up_read(&oi->ip_xattr_sem);
1048
ocfs2_inode_unlock(dentry->d_inode, 0);
1052
return i_ret + b_ret;
1055
static int ocfs2_xattr_find_entry(int name_index,
1057
struct ocfs2_xattr_search *xs)
1059
struct ocfs2_xattr_entry *entry;
1066
name_len = strlen(name);
1068
for (i = 0; i < le16_to_cpu(xs->header->xh_count); i++) {
1069
cmp = name_index - ocfs2_xattr_get_type(entry);
1071
cmp = name_len - entry->xe_name_len;
1073
cmp = memcmp(name, (xs->base +
1074
le16_to_cpu(entry->xe_name_offset)),
1082
return cmp ? -ENODATA : 0;
1085
static int ocfs2_xattr_get_value_outside(struct inode *inode,
1086
struct ocfs2_xattr_value_root *xv,
1090
u32 cpos, p_cluster, num_clusters, bpc, clusters;
1093
size_t cplen, blocksize;
1094
struct buffer_head *bh = NULL;
1095
struct ocfs2_extent_list *el;
1098
clusters = le32_to_cpu(xv->xr_clusters);
1099
bpc = ocfs2_clusters_to_blocks(inode->i_sb, 1);
1100
blocksize = inode->i_sb->s_blocksize;
1103
while (cpos < clusters) {
1104
ret = ocfs2_xattr_get_clusters(inode, cpos, &p_cluster,
1105
&num_clusters, el, NULL);
1111
blkno = ocfs2_clusters_to_blocks(inode->i_sb, p_cluster);
1112
/* Copy ocfs2_xattr_value */
1113
for (i = 0; i < num_clusters * bpc; i++, blkno++) {
1114
ret = ocfs2_read_block(INODE_CACHE(inode), blkno,
1121
cplen = len >= blocksize ? blocksize : len;
1122
memcpy(buffer, bh->b_data, cplen);
1131
cpos += num_clusters;
1137
static int ocfs2_xattr_ibody_get(struct inode *inode,
1142
struct ocfs2_xattr_search *xs)
1144
struct ocfs2_inode_info *oi = OCFS2_I(inode);
1145
struct ocfs2_dinode *di = (struct ocfs2_dinode *)xs->inode_bh->b_data;
1146
struct ocfs2_xattr_value_root *xv;
1150
if (!(oi->ip_dyn_features & OCFS2_INLINE_XATTR_FL))
1153
xs->end = (void *)di + inode->i_sb->s_blocksize;
1154
xs->header = (struct ocfs2_xattr_header *)
1155
(xs->end - le16_to_cpu(di->i_xattr_inline_size));
1156
xs->base = (void *)xs->header;
1157
xs->here = xs->header->xh_entries;
1159
ret = ocfs2_xattr_find_entry(name_index, name, xs);
1162
size = le64_to_cpu(xs->here->xe_value_size);
1164
if (size > buffer_size)
1166
if (ocfs2_xattr_is_local(xs->here)) {
1167
memcpy(buffer, (void *)xs->base +
1168
le16_to_cpu(xs->here->xe_name_offset) +
1169
OCFS2_XATTR_SIZE(xs->here->xe_name_len), size);
1171
xv = (struct ocfs2_xattr_value_root *)
1172
(xs->base + le16_to_cpu(
1173
xs->here->xe_name_offset) +
1174
OCFS2_XATTR_SIZE(xs->here->xe_name_len));
1175
ret = ocfs2_xattr_get_value_outside(inode, xv,
1187
static int ocfs2_xattr_block_get(struct inode *inode,
1192
struct ocfs2_xattr_search *xs)
1194
struct ocfs2_xattr_block *xb;
1195
struct ocfs2_xattr_value_root *xv;
1197
int ret = -ENODATA, name_offset, name_len, i;
1198
int uninitialized_var(block_off);
1200
xs->bucket = ocfs2_xattr_bucket_new(inode);
1207
ret = ocfs2_xattr_block_find(inode, name_index, name, xs);
1213
if (xs->not_found) {
1218
xb = (struct ocfs2_xattr_block *)xs->xattr_bh->b_data;
1219
size = le64_to_cpu(xs->here->xe_value_size);
1222
if (size > buffer_size)
1225
name_offset = le16_to_cpu(xs->here->xe_name_offset);
1226
name_len = OCFS2_XATTR_SIZE(xs->here->xe_name_len);
1227
i = xs->here - xs->header->xh_entries;
1229
if (le16_to_cpu(xb->xb_flags) & OCFS2_XATTR_INDEXED) {
1230
ret = ocfs2_xattr_bucket_get_name_value(inode->i_sb,
1231
bucket_xh(xs->bucket),
1235
xs->base = bucket_block(xs->bucket, block_off);
1237
if (ocfs2_xattr_is_local(xs->here)) {
1238
memcpy(buffer, (void *)xs->base +
1239
name_offset + name_len, size);
1241
xv = (struct ocfs2_xattr_value_root *)
1242
(xs->base + name_offset + name_len);
1243
ret = ocfs2_xattr_get_value_outside(inode, xv,
1253
ocfs2_xattr_bucket_free(xs->bucket);
1255
brelse(xs->xattr_bh);
1256
xs->xattr_bh = NULL;
1260
int ocfs2_xattr_get_nolock(struct inode *inode,
1261
struct buffer_head *di_bh,
1268
struct ocfs2_dinode *di = NULL;
1269
struct ocfs2_inode_info *oi = OCFS2_I(inode);
1270
struct ocfs2_xattr_search xis = {
1271
.not_found = -ENODATA,
1273
struct ocfs2_xattr_search xbs = {
1274
.not_found = -ENODATA,
1277
if (!ocfs2_supports_xattr(OCFS2_SB(inode->i_sb)))
1280
if (!(oi->ip_dyn_features & OCFS2_HAS_XATTR_FL))
1283
xis.inode_bh = xbs.inode_bh = di_bh;
1284
di = (struct ocfs2_dinode *)di_bh->b_data;
1286
ret = ocfs2_xattr_ibody_get(inode, name_index, name, buffer,
1288
if (ret == -ENODATA && di->i_xattr_loc)
1289
ret = ocfs2_xattr_block_get(inode, name_index, name, buffer,
1295
/* ocfs2_xattr_get()
1297
* Copy an extended attribute into the buffer provided.
1298
* Buffer is NULL to compute the size of buffer required.
1300
static int ocfs2_xattr_get(struct inode *inode,
1307
struct buffer_head *di_bh = NULL;
1309
ret = ocfs2_inode_lock(inode, &di_bh, 0);
1314
down_read(&OCFS2_I(inode)->ip_xattr_sem);
1315
ret = ocfs2_xattr_get_nolock(inode, di_bh, name_index,
1316
name, buffer, buffer_size);
1317
up_read(&OCFS2_I(inode)->ip_xattr_sem);
1319
ocfs2_inode_unlock(inode, 0);
1326
static int __ocfs2_xattr_set_value_outside(struct inode *inode,
1328
struct ocfs2_xattr_value_buf *vb,
1332
int ret = 0, i, cp_len;
1333
u16 blocksize = inode->i_sb->s_blocksize;
1334
u32 p_cluster, num_clusters;
1335
u32 cpos = 0, bpc = ocfs2_clusters_to_blocks(inode->i_sb, 1);
1336
u32 clusters = ocfs2_clusters_for_bytes(inode->i_sb, value_len);
1338
struct buffer_head *bh = NULL;
1339
unsigned int ext_flags;
1340
struct ocfs2_xattr_value_root *xv = vb->vb_xv;
1342
BUG_ON(clusters > le32_to_cpu(xv->xr_clusters));
1344
while (cpos < clusters) {
1345
ret = ocfs2_xattr_get_clusters(inode, cpos, &p_cluster,
1346
&num_clusters, &xv->xr_list,
1353
BUG_ON(ext_flags & OCFS2_EXT_REFCOUNTED);
1355
blkno = ocfs2_clusters_to_blocks(inode->i_sb, p_cluster);
1357
for (i = 0; i < num_clusters * bpc; i++, blkno++) {
1358
ret = ocfs2_read_block(INODE_CACHE(inode), blkno,
1365
ret = ocfs2_journal_access(handle,
1368
OCFS2_JOURNAL_ACCESS_WRITE);
1374
cp_len = value_len > blocksize ? blocksize : value_len;
1375
memcpy(bh->b_data, value, cp_len);
1376
value_len -= cp_len;
1378
if (cp_len < blocksize)
1379
memset(bh->b_data + cp_len, 0,
1380
blocksize - cp_len);
1382
ocfs2_journal_dirty(handle, bh);
1387
* XXX: do we need to empty all the following
1388
* blocks in this cluster?
1393
cpos += num_clusters;
1401
static int ocfs2_xa_check_space_helper(int needed_space, int free_start,
1409
free_space = free_start -
1410
sizeof(struct ocfs2_xattr_header) -
1411
(num_entries * sizeof(struct ocfs2_xattr_entry)) -
1412
OCFS2_XATTR_HEADER_GAP;
1415
if (free_space < needed_space)
1421
static int ocfs2_xa_journal_access(handle_t *handle, struct ocfs2_xa_loc *loc,
1424
return loc->xl_ops->xlo_journal_access(handle, loc, type);
1427
static void ocfs2_xa_journal_dirty(handle_t *handle, struct ocfs2_xa_loc *loc)
1429
loc->xl_ops->xlo_journal_dirty(handle, loc);
1432
/* Give a pointer into the storage for the given offset */
1433
static void *ocfs2_xa_offset_pointer(struct ocfs2_xa_loc *loc, int offset)
1435
BUG_ON(offset >= loc->xl_size);
1436
return loc->xl_ops->xlo_offset_pointer(loc, offset);
1440
* Wipe the name+value pair and allow the storage to reclaim it. This
1441
* must be followed by either removal of the entry or a call to
1442
* ocfs2_xa_add_namevalue().
1444
static void ocfs2_xa_wipe_namevalue(struct ocfs2_xa_loc *loc)
1446
loc->xl_ops->xlo_wipe_namevalue(loc);
1450
* Find lowest offset to a name+value pair. This is the start of our
1451
* downward-growing free space.
1453
static int ocfs2_xa_get_free_start(struct ocfs2_xa_loc *loc)
1455
return loc->xl_ops->xlo_get_free_start(loc);
1458
/* Can we reuse loc->xl_entry for xi? */
1459
static int ocfs2_xa_can_reuse_entry(struct ocfs2_xa_loc *loc,
1460
struct ocfs2_xattr_info *xi)
1462
return loc->xl_ops->xlo_can_reuse(loc, xi);
1465
/* How much free space is needed to set the new value */
1466
static int ocfs2_xa_check_space(struct ocfs2_xa_loc *loc,
1467
struct ocfs2_xattr_info *xi)
1469
return loc->xl_ops->xlo_check_space(loc, xi);
1472
static void ocfs2_xa_add_entry(struct ocfs2_xa_loc *loc, u32 name_hash)
1474
loc->xl_ops->xlo_add_entry(loc, name_hash);
1475
loc->xl_entry->xe_name_hash = cpu_to_le32(name_hash);
1477
* We can't leave the new entry's xe_name_offset at zero or
1478
* add_namevalue() will go nuts. We set it to the size of our
1479
* storage so that it can never be less than any other entry.
1481
loc->xl_entry->xe_name_offset = cpu_to_le16(loc->xl_size);
1484
static void ocfs2_xa_add_namevalue(struct ocfs2_xa_loc *loc,
1485
struct ocfs2_xattr_info *xi)
1487
int size = namevalue_size_xi(xi);
1491
loc->xl_ops->xlo_add_namevalue(loc, size);
1492
loc->xl_entry->xe_value_size = cpu_to_le64(xi->xi_value_len);
1493
loc->xl_entry->xe_name_len = xi->xi_name_len;
1494
ocfs2_xattr_set_type(loc->xl_entry, xi->xi_name_index);
1495
ocfs2_xattr_set_local(loc->xl_entry,
1496
xi->xi_value_len <= OCFS2_XATTR_INLINE_SIZE);
1498
nameval_offset = le16_to_cpu(loc->xl_entry->xe_name_offset);
1499
nameval_buf = ocfs2_xa_offset_pointer(loc, nameval_offset);
1500
memset(nameval_buf, 0, size);
1501
memcpy(nameval_buf, xi->xi_name, xi->xi_name_len);
1504
static void ocfs2_xa_fill_value_buf(struct ocfs2_xa_loc *loc,
1505
struct ocfs2_xattr_value_buf *vb)
1507
int nameval_offset = le16_to_cpu(loc->xl_entry->xe_name_offset);
1508
int name_size = OCFS2_XATTR_SIZE(loc->xl_entry->xe_name_len);
1510
/* Value bufs are for value trees */
1511
BUG_ON(ocfs2_xattr_is_local(loc->xl_entry));
1512
BUG_ON(namevalue_size_xe(loc->xl_entry) !=
1513
(name_size + OCFS2_XATTR_ROOT_SIZE));
1515
loc->xl_ops->xlo_fill_value_buf(loc, vb);
1517
(struct ocfs2_xattr_value_root *)ocfs2_xa_offset_pointer(loc,
1522
static int ocfs2_xa_block_journal_access(handle_t *handle,
1523
struct ocfs2_xa_loc *loc, int type)
1525
struct buffer_head *bh = loc->xl_storage;
1526
ocfs2_journal_access_func access;
1528
if (loc->xl_size == (bh->b_size -
1529
offsetof(struct ocfs2_xattr_block,
1530
xb_attrs.xb_header)))
1531
access = ocfs2_journal_access_xb;
1533
access = ocfs2_journal_access_di;
1534
return access(handle, INODE_CACHE(loc->xl_inode), bh, type);
1537
static void ocfs2_xa_block_journal_dirty(handle_t *handle,
1538
struct ocfs2_xa_loc *loc)
1540
struct buffer_head *bh = loc->xl_storage;
1542
ocfs2_journal_dirty(handle, bh);
1545
static void *ocfs2_xa_block_offset_pointer(struct ocfs2_xa_loc *loc,
1548
return (char *)loc->xl_header + offset;
1551
static int ocfs2_xa_block_can_reuse(struct ocfs2_xa_loc *loc,
1552
struct ocfs2_xattr_info *xi)
1555
* Block storage is strict. If the sizes aren't exact, we will
1556
* remove the old one and reinsert the new.
1558
return namevalue_size_xe(loc->xl_entry) ==
1559
namevalue_size_xi(xi);
1562
static int ocfs2_xa_block_get_free_start(struct ocfs2_xa_loc *loc)
1564
struct ocfs2_xattr_header *xh = loc->xl_header;
1565
int i, count = le16_to_cpu(xh->xh_count);
1566
int offset, free_start = loc->xl_size;
1568
for (i = 0; i < count; i++) {
1569
offset = le16_to_cpu(xh->xh_entries[i].xe_name_offset);
1570
if (offset < free_start)
1571
free_start = offset;
1577
static int ocfs2_xa_block_check_space(struct ocfs2_xa_loc *loc,
1578
struct ocfs2_xattr_info *xi)
1580
int count = le16_to_cpu(loc->xl_header->xh_count);
1581
int free_start = ocfs2_xa_get_free_start(loc);
1582
int needed_space = ocfs2_xi_entry_usage(xi);
1585
* Block storage will reclaim the original entry before inserting
1586
* the new value, so we only need the difference. If the new
1587
* entry is smaller than the old one, we don't need anything.
1589
if (loc->xl_entry) {
1590
/* Don't need space if we're reusing! */
1591
if (ocfs2_xa_can_reuse_entry(loc, xi))
1594
needed_space -= ocfs2_xe_entry_usage(loc->xl_entry);
1596
if (needed_space < 0)
1598
return ocfs2_xa_check_space_helper(needed_space, free_start, count);
1602
* Block storage for xattrs keeps the name+value pairs compacted. When
1603
* we remove one, we have to shift any that preceded it towards the end.
1605
static void ocfs2_xa_block_wipe_namevalue(struct ocfs2_xa_loc *loc)
1608
int namevalue_offset, first_namevalue_offset, namevalue_size;
1609
struct ocfs2_xattr_entry *entry = loc->xl_entry;
1610
struct ocfs2_xattr_header *xh = loc->xl_header;
1611
int count = le16_to_cpu(xh->xh_count);
1613
namevalue_offset = le16_to_cpu(entry->xe_name_offset);
1614
namevalue_size = namevalue_size_xe(entry);
1615
first_namevalue_offset = ocfs2_xa_get_free_start(loc);
1617
/* Shift the name+value pairs */
1618
memmove((char *)xh + first_namevalue_offset + namevalue_size,
1619
(char *)xh + first_namevalue_offset,
1620
namevalue_offset - first_namevalue_offset);
1621
memset((char *)xh + first_namevalue_offset, 0, namevalue_size);
1623
/* Now tell xh->xh_entries about it */
1624
for (i = 0; i < count; i++) {
1625
offset = le16_to_cpu(xh->xh_entries[i].xe_name_offset);
1626
if (offset <= namevalue_offset)
1627
le16_add_cpu(&xh->xh_entries[i].xe_name_offset,
1632
* Note that we don't update xh_free_start or xh_name_value_len
1633
* because they're not used in block-stored xattrs.
1637
static void ocfs2_xa_block_add_entry(struct ocfs2_xa_loc *loc, u32 name_hash)
1639
int count = le16_to_cpu(loc->xl_header->xh_count);
1640
loc->xl_entry = &(loc->xl_header->xh_entries[count]);
1641
le16_add_cpu(&loc->xl_header->xh_count, 1);
1642
memset(loc->xl_entry, 0, sizeof(struct ocfs2_xattr_entry));
1645
static void ocfs2_xa_block_add_namevalue(struct ocfs2_xa_loc *loc, int size)
1647
int free_start = ocfs2_xa_get_free_start(loc);
1649
loc->xl_entry->xe_name_offset = cpu_to_le16(free_start - size);
1652
static void ocfs2_xa_block_fill_value_buf(struct ocfs2_xa_loc *loc,
1653
struct ocfs2_xattr_value_buf *vb)
1655
struct buffer_head *bh = loc->xl_storage;
1657
if (loc->xl_size == (bh->b_size -
1658
offsetof(struct ocfs2_xattr_block,
1659
xb_attrs.xb_header)))
1660
vb->vb_access = ocfs2_journal_access_xb;
1662
vb->vb_access = ocfs2_journal_access_di;
1667
* Operations for xattrs stored in blocks. This includes inline inode
1668
* storage and unindexed ocfs2_xattr_blocks.
1670
static const struct ocfs2_xa_loc_operations ocfs2_xa_block_loc_ops = {
1671
.xlo_journal_access = ocfs2_xa_block_journal_access,
1672
.xlo_journal_dirty = ocfs2_xa_block_journal_dirty,
1673
.xlo_offset_pointer = ocfs2_xa_block_offset_pointer,
1674
.xlo_check_space = ocfs2_xa_block_check_space,
1675
.xlo_can_reuse = ocfs2_xa_block_can_reuse,
1676
.xlo_get_free_start = ocfs2_xa_block_get_free_start,
1677
.xlo_wipe_namevalue = ocfs2_xa_block_wipe_namevalue,
1678
.xlo_add_entry = ocfs2_xa_block_add_entry,
1679
.xlo_add_namevalue = ocfs2_xa_block_add_namevalue,
1680
.xlo_fill_value_buf = ocfs2_xa_block_fill_value_buf,
1683
static int ocfs2_xa_bucket_journal_access(handle_t *handle,
1684
struct ocfs2_xa_loc *loc, int type)
1686
struct ocfs2_xattr_bucket *bucket = loc->xl_storage;
1688
return ocfs2_xattr_bucket_journal_access(handle, bucket, type);
1691
static void ocfs2_xa_bucket_journal_dirty(handle_t *handle,
1692
struct ocfs2_xa_loc *loc)
1694
struct ocfs2_xattr_bucket *bucket = loc->xl_storage;
1696
ocfs2_xattr_bucket_journal_dirty(handle, bucket);
1699
static void *ocfs2_xa_bucket_offset_pointer(struct ocfs2_xa_loc *loc,
1702
struct ocfs2_xattr_bucket *bucket = loc->xl_storage;
1703
int block, block_offset;
1705
/* The header is at the front of the bucket */
1706
block = offset >> loc->xl_inode->i_sb->s_blocksize_bits;
1707
block_offset = offset % loc->xl_inode->i_sb->s_blocksize;
1709
return bucket_block(bucket, block) + block_offset;
1712
static int ocfs2_xa_bucket_can_reuse(struct ocfs2_xa_loc *loc,
1713
struct ocfs2_xattr_info *xi)
1715
return namevalue_size_xe(loc->xl_entry) >=
1716
namevalue_size_xi(xi);
1719
static int ocfs2_xa_bucket_get_free_start(struct ocfs2_xa_loc *loc)
1721
struct ocfs2_xattr_bucket *bucket = loc->xl_storage;
1722
return le16_to_cpu(bucket_xh(bucket)->xh_free_start);
1725
static int ocfs2_bucket_align_free_start(struct super_block *sb,
1726
int free_start, int size)
1729
* We need to make sure that the name+value pair fits within
1732
if (((free_start - size) >> sb->s_blocksize_bits) !=
1733
((free_start - 1) >> sb->s_blocksize_bits))
1734
free_start -= free_start % sb->s_blocksize;
1739
static int ocfs2_xa_bucket_check_space(struct ocfs2_xa_loc *loc,
1740
struct ocfs2_xattr_info *xi)
1743
int count = le16_to_cpu(loc->xl_header->xh_count);
1744
int free_start = ocfs2_xa_get_free_start(loc);
1745
int needed_space = ocfs2_xi_entry_usage(xi);
1746
int size = namevalue_size_xi(xi);
1747
struct super_block *sb = loc->xl_inode->i_sb;
1750
* Bucket storage does not reclaim name+value pairs it cannot
1751
* reuse. They live as holes until the bucket fills, and then
1752
* the bucket is defragmented. However, the bucket can reclaim
1753
* the ocfs2_xattr_entry.
1755
if (loc->xl_entry) {
1756
/* Don't need space if we're reusing! */
1757
if (ocfs2_xa_can_reuse_entry(loc, xi))
1760
needed_space -= sizeof(struct ocfs2_xattr_entry);
1762
BUG_ON(needed_space < 0);
1764
if (free_start < size) {
1769
* First we check if it would fit in the first place.
1770
* Below, we align the free start to a block. This may
1771
* slide us below the minimum gap. By checking unaligned
1772
* first, we avoid that error.
1774
rc = ocfs2_xa_check_space_helper(needed_space, free_start,
1778
free_start = ocfs2_bucket_align_free_start(sb, free_start,
1781
return ocfs2_xa_check_space_helper(needed_space, free_start, count);
1784
static void ocfs2_xa_bucket_wipe_namevalue(struct ocfs2_xa_loc *loc)
1786
le16_add_cpu(&loc->xl_header->xh_name_value_len,
1787
-namevalue_size_xe(loc->xl_entry));
1790
static void ocfs2_xa_bucket_add_entry(struct ocfs2_xa_loc *loc, u32 name_hash)
1792
struct ocfs2_xattr_header *xh = loc->xl_header;
1793
int count = le16_to_cpu(xh->xh_count);
1794
int low = 0, high = count - 1, tmp;
1795
struct ocfs2_xattr_entry *tmp_xe;
1798
* We keep buckets sorted by name_hash, so we need to find
1801
while (low <= high && count) {
1802
tmp = (low + high) / 2;
1803
tmp_xe = &xh->xh_entries[tmp];
1805
if (name_hash > le32_to_cpu(tmp_xe->xe_name_hash))
1807
else if (name_hash < le32_to_cpu(tmp_xe->xe_name_hash))
1816
memmove(&xh->xh_entries[low + 1],
1817
&xh->xh_entries[low],
1818
((count - low) * sizeof(struct ocfs2_xattr_entry)));
1820
le16_add_cpu(&xh->xh_count, 1);
1821
loc->xl_entry = &xh->xh_entries[low];
1822
memset(loc->xl_entry, 0, sizeof(struct ocfs2_xattr_entry));
1825
static void ocfs2_xa_bucket_add_namevalue(struct ocfs2_xa_loc *loc, int size)
1827
int free_start = ocfs2_xa_get_free_start(loc);
1828
struct ocfs2_xattr_header *xh = loc->xl_header;
1829
struct super_block *sb = loc->xl_inode->i_sb;
1832
free_start = ocfs2_bucket_align_free_start(sb, free_start, size);
1833
nameval_offset = free_start - size;
1834
loc->xl_entry->xe_name_offset = cpu_to_le16(nameval_offset);
1835
xh->xh_free_start = cpu_to_le16(nameval_offset);
1836
le16_add_cpu(&xh->xh_name_value_len, size);
1840
static void ocfs2_xa_bucket_fill_value_buf(struct ocfs2_xa_loc *loc,
1841
struct ocfs2_xattr_value_buf *vb)
1843
struct ocfs2_xattr_bucket *bucket = loc->xl_storage;
1844
struct super_block *sb = loc->xl_inode->i_sb;
1845
int nameval_offset = le16_to_cpu(loc->xl_entry->xe_name_offset);
1846
int size = namevalue_size_xe(loc->xl_entry);
1847
int block_offset = nameval_offset >> sb->s_blocksize_bits;
1849
/* Values are not allowed to straddle block boundaries */
1850
BUG_ON(block_offset !=
1851
((nameval_offset + size - 1) >> sb->s_blocksize_bits));
1852
/* We expect the bucket to be filled in */
1853
BUG_ON(!bucket->bu_bhs[block_offset]);
1855
vb->vb_access = ocfs2_journal_access;
1856
vb->vb_bh = bucket->bu_bhs[block_offset];
1859
/* Operations for xattrs stored in buckets. */
1860
static const struct ocfs2_xa_loc_operations ocfs2_xa_bucket_loc_ops = {
1861
.xlo_journal_access = ocfs2_xa_bucket_journal_access,
1862
.xlo_journal_dirty = ocfs2_xa_bucket_journal_dirty,
1863
.xlo_offset_pointer = ocfs2_xa_bucket_offset_pointer,
1864
.xlo_check_space = ocfs2_xa_bucket_check_space,
1865
.xlo_can_reuse = ocfs2_xa_bucket_can_reuse,
1866
.xlo_get_free_start = ocfs2_xa_bucket_get_free_start,
1867
.xlo_wipe_namevalue = ocfs2_xa_bucket_wipe_namevalue,
1868
.xlo_add_entry = ocfs2_xa_bucket_add_entry,
1869
.xlo_add_namevalue = ocfs2_xa_bucket_add_namevalue,
1870
.xlo_fill_value_buf = ocfs2_xa_bucket_fill_value_buf,
1873
static unsigned int ocfs2_xa_value_clusters(struct ocfs2_xa_loc *loc)
1875
struct ocfs2_xattr_value_buf vb;
1877
if (ocfs2_xattr_is_local(loc->xl_entry))
1880
ocfs2_xa_fill_value_buf(loc, &vb);
1881
return le32_to_cpu(vb.vb_xv->xr_clusters);
1884
static int ocfs2_xa_value_truncate(struct ocfs2_xa_loc *loc, u64 bytes,
1885
struct ocfs2_xattr_set_ctxt *ctxt)
1887
int trunc_rc, access_rc;
1888
struct ocfs2_xattr_value_buf vb;
1890
ocfs2_xa_fill_value_buf(loc, &vb);
1891
trunc_rc = ocfs2_xattr_value_truncate(loc->xl_inode, &vb, bytes,
1895
* The caller of ocfs2_xa_value_truncate() has already called
1896
* ocfs2_xa_journal_access on the loc. However, The truncate code
1897
* calls ocfs2_extend_trans(). This may commit the previous
1898
* transaction and open a new one. If this is a bucket, truncate
1899
* could leave only vb->vb_bh set up for journaling. Meanwhile,
1900
* the caller is expecting to dirty the entire bucket. So we must
1901
* reset the journal work. We do this even if truncate has failed,
1902
* as it could have failed after committing the extend.
1904
access_rc = ocfs2_xa_journal_access(ctxt->handle, loc,
1905
OCFS2_JOURNAL_ACCESS_WRITE);
1907
/* Errors in truncate take precedence */
1908
return trunc_rc ? trunc_rc : access_rc;
1911
static void ocfs2_xa_remove_entry(struct ocfs2_xa_loc *loc)
1914
struct ocfs2_xattr_header *xh = loc->xl_header;
1915
struct ocfs2_xattr_entry *entry = loc->xl_entry;
1917
ocfs2_xa_wipe_namevalue(loc);
1918
loc->xl_entry = NULL;
1920
le16_add_cpu(&xh->xh_count, -1);
1921
count = le16_to_cpu(xh->xh_count);
1924
* Only zero out the entry if there are more remaining. This is
1925
* important for an empty bucket, as it keeps track of the
1926
* bucket's hash value. It doesn't hurt empty block storage.
1929
index = ((char *)entry - (char *)&xh->xh_entries) /
1930
sizeof(struct ocfs2_xattr_entry);
1931
memmove(&xh->xh_entries[index], &xh->xh_entries[index + 1],
1932
(count - index) * sizeof(struct ocfs2_xattr_entry));
1933
memset(&xh->xh_entries[count], 0,
1934
sizeof(struct ocfs2_xattr_entry));
1939
* If we have a problem adjusting the size of an external value during
1940
* ocfs2_xa_prepare_entry() or ocfs2_xa_remove(), we may have an xattr
1941
* in an intermediate state. For example, the value may be partially
1944
* If the value tree hasn't changed, the extend/truncate went nowhere.
1945
* We have nothing to do. The caller can treat it as a straight error.
1947
* If the value tree got partially truncated, we now have a corrupted
1948
* extended attribute. We're going to wipe its entry and leak the
1949
* clusters. Better to leak some storage than leave a corrupt entry.
1951
* If the value tree grew, it obviously didn't grow enough for the
1952
* new entry. We're not going to try and reclaim those clusters either.
1953
* If there was already an external value there (orig_clusters != 0),
1954
* the new clusters are attached safely and we can just leave the old
1955
* value in place. If there was no external value there, we remove
1958
* This way, the xattr block we store in the journal will be consistent.
1959
* If the size change broke because of the journal, no changes will hit
1962
static void ocfs2_xa_cleanup_value_truncate(struct ocfs2_xa_loc *loc,
1964
unsigned int orig_clusters)
1966
unsigned int new_clusters = ocfs2_xa_value_clusters(loc);
1967
char *nameval_buf = ocfs2_xa_offset_pointer(loc,
1968
le16_to_cpu(loc->xl_entry->xe_name_offset));
1970
if (new_clusters < orig_clusters) {
1972
"Partial truncate while %s xattr %.*s. Leaking "
1973
"%u clusters and removing the entry\n",
1974
what, loc->xl_entry->xe_name_len, nameval_buf,
1975
orig_clusters - new_clusters);
1976
ocfs2_xa_remove_entry(loc);
1977
} else if (!orig_clusters) {
1979
"Unable to allocate an external value for xattr "
1980
"%.*s safely. Leaking %u clusters and removing the "
1982
loc->xl_entry->xe_name_len, nameval_buf,
1983
new_clusters - orig_clusters);
1984
ocfs2_xa_remove_entry(loc);
1985
} else if (new_clusters > orig_clusters)
1987
"Unable to grow xattr %.*s safely. %u new clusters "
1988
"have been added, but the value will not be "
1990
loc->xl_entry->xe_name_len, nameval_buf,
1991
new_clusters - orig_clusters);
1994
static int ocfs2_xa_remove(struct ocfs2_xa_loc *loc,
1995
struct ocfs2_xattr_set_ctxt *ctxt)
1998
unsigned int orig_clusters;
2000
if (!ocfs2_xattr_is_local(loc->xl_entry)) {
2001
orig_clusters = ocfs2_xa_value_clusters(loc);
2002
rc = ocfs2_xa_value_truncate(loc, 0, ctxt);
2006
* Since this is remove, we can return 0 if
2007
* ocfs2_xa_cleanup_value_truncate() is going to
2008
* wipe the entry anyway. So we check the
2009
* cluster count as well.
2011
if (orig_clusters != ocfs2_xa_value_clusters(loc))
2013
ocfs2_xa_cleanup_value_truncate(loc, "removing",
2020
ocfs2_xa_remove_entry(loc);
2026
static void ocfs2_xa_install_value_root(struct ocfs2_xa_loc *loc)
2028
int name_size = OCFS2_XATTR_SIZE(loc->xl_entry->xe_name_len);
2031
nameval_buf = ocfs2_xa_offset_pointer(loc,
2032
le16_to_cpu(loc->xl_entry->xe_name_offset));
2033
memcpy(nameval_buf + name_size, &def_xv, OCFS2_XATTR_ROOT_SIZE);
2037
* Take an existing entry and make it ready for the new value. This
2038
* won't allocate space, but it may free space. It should be ready for
2039
* ocfs2_xa_prepare_entry() to finish the work.
2041
static int ocfs2_xa_reuse_entry(struct ocfs2_xa_loc *loc,
2042
struct ocfs2_xattr_info *xi,
2043
struct ocfs2_xattr_set_ctxt *ctxt)
2046
int name_size = OCFS2_XATTR_SIZE(xi->xi_name_len);
2047
unsigned int orig_clusters;
2049
int xe_local = ocfs2_xattr_is_local(loc->xl_entry);
2050
int xi_local = xi->xi_value_len <= OCFS2_XATTR_INLINE_SIZE;
2052
BUG_ON(OCFS2_XATTR_SIZE(loc->xl_entry->xe_name_len) !=
2055
nameval_buf = ocfs2_xa_offset_pointer(loc,
2056
le16_to_cpu(loc->xl_entry->xe_name_offset));
2058
memset(nameval_buf + name_size, 0,
2059
namevalue_size_xe(loc->xl_entry) - name_size);
2061
ocfs2_xa_install_value_root(loc);
2063
orig_clusters = ocfs2_xa_value_clusters(loc);
2065
rc = ocfs2_xa_value_truncate(loc, 0, ctxt);
2069
memset(nameval_buf + name_size, 0,
2070
namevalue_size_xe(loc->xl_entry) -
2072
} else if (le64_to_cpu(loc->xl_entry->xe_value_size) >
2074
rc = ocfs2_xa_value_truncate(loc, xi->xi_value_len,
2081
ocfs2_xa_cleanup_value_truncate(loc, "reusing",
2087
loc->xl_entry->xe_value_size = cpu_to_le64(xi->xi_value_len);
2088
ocfs2_xattr_set_local(loc->xl_entry, xi_local);
2095
* Prepares loc->xl_entry to receive the new xattr. This includes
2096
* properly setting up the name+value pair region. If loc->xl_entry
2097
* already exists, it will take care of modifying it appropriately.
2099
* Note that this modifies the data. You did journal_access already,
2102
static int ocfs2_xa_prepare_entry(struct ocfs2_xa_loc *loc,
2103
struct ocfs2_xattr_info *xi,
2105
struct ocfs2_xattr_set_ctxt *ctxt)
2108
unsigned int orig_clusters;
2109
__le64 orig_value_size = 0;
2111
rc = ocfs2_xa_check_space(loc, xi);
2115
if (loc->xl_entry) {
2116
if (ocfs2_xa_can_reuse_entry(loc, xi)) {
2117
orig_value_size = loc->xl_entry->xe_value_size;
2118
rc = ocfs2_xa_reuse_entry(loc, xi, ctxt);
2124
if (!ocfs2_xattr_is_local(loc->xl_entry)) {
2125
orig_clusters = ocfs2_xa_value_clusters(loc);
2126
rc = ocfs2_xa_value_truncate(loc, 0, ctxt);
2129
ocfs2_xa_cleanup_value_truncate(loc,
2135
ocfs2_xa_wipe_namevalue(loc);
2137
ocfs2_xa_add_entry(loc, name_hash);
2140
* If we get here, we have a blank entry. Fill it. We grow our
2141
* name+value pair back from the end.
2143
ocfs2_xa_add_namevalue(loc, xi);
2144
if (xi->xi_value_len > OCFS2_XATTR_INLINE_SIZE)
2145
ocfs2_xa_install_value_root(loc);
2148
if (xi->xi_value_len > OCFS2_XATTR_INLINE_SIZE) {
2149
orig_clusters = ocfs2_xa_value_clusters(loc);
2150
rc = ocfs2_xa_value_truncate(loc, xi->xi_value_len, ctxt);
2152
ctxt->set_abort = 1;
2153
ocfs2_xa_cleanup_value_truncate(loc, "growing",
2156
* If we were growing an existing value,
2157
* ocfs2_xa_cleanup_value_truncate() won't remove
2158
* the entry. We need to restore the original value
2161
if (loc->xl_entry) {
2162
BUG_ON(!orig_value_size);
2163
loc->xl_entry->xe_value_size = orig_value_size;
2174
* Store the value portion of the name+value pair. This will skip
2175
* values that are stored externally. Their tree roots were set up
2176
* by ocfs2_xa_prepare_entry().
2178
static int ocfs2_xa_store_value(struct ocfs2_xa_loc *loc,
2179
struct ocfs2_xattr_info *xi,
2180
struct ocfs2_xattr_set_ctxt *ctxt)
2183
int nameval_offset = le16_to_cpu(loc->xl_entry->xe_name_offset);
2184
int name_size = OCFS2_XATTR_SIZE(xi->xi_name_len);
2186
struct ocfs2_xattr_value_buf vb;
2188
nameval_buf = ocfs2_xa_offset_pointer(loc, nameval_offset);
2189
if (xi->xi_value_len > OCFS2_XATTR_INLINE_SIZE) {
2190
ocfs2_xa_fill_value_buf(loc, &vb);
2191
rc = __ocfs2_xattr_set_value_outside(loc->xl_inode,
2196
memcpy(nameval_buf + name_size, xi->xi_value, xi->xi_value_len);
2201
static int ocfs2_xa_set(struct ocfs2_xa_loc *loc,
2202
struct ocfs2_xattr_info *xi,
2203
struct ocfs2_xattr_set_ctxt *ctxt)
2206
u32 name_hash = ocfs2_xattr_name_hash(loc->xl_inode, xi->xi_name,
2209
ret = ocfs2_xa_journal_access(ctxt->handle, loc,
2210
OCFS2_JOURNAL_ACCESS_WRITE);
2217
* From here on out, everything is going to modify the buffer a
2218
* little. Errors are going to leave the xattr header in a
2219
* sane state. Thus, even with errors we dirty the sucker.
2222
/* Don't worry, we are never called with !xi_value and !xl_entry */
2223
if (!xi->xi_value) {
2224
ret = ocfs2_xa_remove(loc, ctxt);
2228
ret = ocfs2_xa_prepare_entry(loc, xi, name_hash, ctxt);
2235
ret = ocfs2_xa_store_value(loc, xi, ctxt);
2240
ocfs2_xa_journal_dirty(ctxt->handle, loc);
2246
static void ocfs2_init_dinode_xa_loc(struct ocfs2_xa_loc *loc,
2247
struct inode *inode,
2248
struct buffer_head *bh,
2249
struct ocfs2_xattr_entry *entry)
2251
struct ocfs2_dinode *di = (struct ocfs2_dinode *)bh->b_data;
2253
BUG_ON(!(OCFS2_I(inode)->ip_dyn_features & OCFS2_INLINE_XATTR_FL));
2255
loc->xl_inode = inode;
2256
loc->xl_ops = &ocfs2_xa_block_loc_ops;
2257
loc->xl_storage = bh;
2258
loc->xl_entry = entry;
2259
loc->xl_size = le16_to_cpu(di->i_xattr_inline_size);
2261
(struct ocfs2_xattr_header *)(bh->b_data + bh->b_size -
2265
static void ocfs2_init_xattr_block_xa_loc(struct ocfs2_xa_loc *loc,
2266
struct inode *inode,
2267
struct buffer_head *bh,
2268
struct ocfs2_xattr_entry *entry)
2270
struct ocfs2_xattr_block *xb =
2271
(struct ocfs2_xattr_block *)bh->b_data;
2273
BUG_ON(le16_to_cpu(xb->xb_flags) & OCFS2_XATTR_INDEXED);
2275
loc->xl_inode = inode;
2276
loc->xl_ops = &ocfs2_xa_block_loc_ops;
2277
loc->xl_storage = bh;
2278
loc->xl_header = &(xb->xb_attrs.xb_header);
2279
loc->xl_entry = entry;
2280
loc->xl_size = bh->b_size - offsetof(struct ocfs2_xattr_block,
2281
xb_attrs.xb_header);
2284
static void ocfs2_init_xattr_bucket_xa_loc(struct ocfs2_xa_loc *loc,
2285
struct ocfs2_xattr_bucket *bucket,
2286
struct ocfs2_xattr_entry *entry)
2288
loc->xl_inode = bucket->bu_inode;
2289
loc->xl_ops = &ocfs2_xa_bucket_loc_ops;
2290
loc->xl_storage = bucket;
2291
loc->xl_header = bucket_xh(bucket);
2292
loc->xl_entry = entry;
2293
loc->xl_size = OCFS2_XATTR_BUCKET_SIZE;
2297
* In xattr remove, if it is stored outside and refcounted, we may have
2298
* the chance to split the refcount tree. So need the allocators.
2300
static int ocfs2_lock_xattr_remove_allocators(struct inode *inode,
2301
struct ocfs2_xattr_value_root *xv,
2302
struct ocfs2_caching_info *ref_ci,
2303
struct buffer_head *ref_root_bh,
2304
struct ocfs2_alloc_context **meta_ac,
2307
int ret, meta_add = 0;
2308
u32 p_cluster, num_clusters;
2309
unsigned int ext_flags;
2312
ret = ocfs2_xattr_get_clusters(inode, 0, &p_cluster,
2321
if (!(ext_flags & OCFS2_EXT_REFCOUNTED))
2324
ret = ocfs2_refcounted_xattr_delete_need(inode, ref_ci,
2326
&meta_add, ref_credits);
2332
ret = ocfs2_reserve_new_metadata_blocks(OCFS2_SB(inode->i_sb),
2341
static int ocfs2_remove_value_outside(struct inode*inode,
2342
struct ocfs2_xattr_value_buf *vb,
2343
struct ocfs2_xattr_header *header,
2344
struct ocfs2_caching_info *ref_ci,
2345
struct buffer_head *ref_root_bh)
2347
int ret = 0, i, ref_credits;
2348
struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
2349
struct ocfs2_xattr_set_ctxt ctxt = { NULL, NULL, };
2352
ocfs2_init_dealloc_ctxt(&ctxt.dealloc);
2354
for (i = 0; i < le16_to_cpu(header->xh_count); i++) {
2355
struct ocfs2_xattr_entry *entry = &header->xh_entries[i];
2357
if (ocfs2_xattr_is_local(entry))
2360
val = (void *)header +
2361
le16_to_cpu(entry->xe_name_offset);
2362
vb->vb_xv = (struct ocfs2_xattr_value_root *)
2363
(val + OCFS2_XATTR_SIZE(entry->xe_name_len));
2365
ret = ocfs2_lock_xattr_remove_allocators(inode, vb->vb_xv,
2366
ref_ci, ref_root_bh,
2370
ctxt.handle = ocfs2_start_trans(osb, ref_credits +
2371
ocfs2_remove_extent_credits(osb->sb));
2372
if (IS_ERR(ctxt.handle)) {
2373
ret = PTR_ERR(ctxt.handle);
2378
ret = ocfs2_xattr_value_truncate(inode, vb, 0, &ctxt);
2380
ocfs2_commit_trans(osb, ctxt.handle);
2382
ocfs2_free_alloc_context(ctxt.meta_ac);
2383
ctxt.meta_ac = NULL;
2394
ocfs2_free_alloc_context(ctxt.meta_ac);
2395
ocfs2_schedule_truncate_log_flush(osb, 1);
2396
ocfs2_run_deallocs(osb, &ctxt.dealloc);
2400
static int ocfs2_xattr_ibody_remove(struct inode *inode,
2401
struct buffer_head *di_bh,
2402
struct ocfs2_caching_info *ref_ci,
2403
struct buffer_head *ref_root_bh)
2406
struct ocfs2_dinode *di = (struct ocfs2_dinode *)di_bh->b_data;
2407
struct ocfs2_xattr_header *header;
2409
struct ocfs2_xattr_value_buf vb = {
2411
.vb_access = ocfs2_journal_access_di,
2414
header = (struct ocfs2_xattr_header *)
2415
((void *)di + inode->i_sb->s_blocksize -
2416
le16_to_cpu(di->i_xattr_inline_size));
2418
ret = ocfs2_remove_value_outside(inode, &vb, header,
2419
ref_ci, ref_root_bh);
2424
struct ocfs2_rm_xattr_bucket_para {
2425
struct ocfs2_caching_info *ref_ci;
2426
struct buffer_head *ref_root_bh;
2429
static int ocfs2_xattr_block_remove(struct inode *inode,
2430
struct buffer_head *blk_bh,
2431
struct ocfs2_caching_info *ref_ci,
2432
struct buffer_head *ref_root_bh)
2434
struct ocfs2_xattr_block *xb;
2436
struct ocfs2_xattr_value_buf vb = {
2438
.vb_access = ocfs2_journal_access_xb,
2440
struct ocfs2_rm_xattr_bucket_para args = {
2442
.ref_root_bh = ref_root_bh,
2445
xb = (struct ocfs2_xattr_block *)blk_bh->b_data;
2446
if (!(le16_to_cpu(xb->xb_flags) & OCFS2_XATTR_INDEXED)) {
2447
struct ocfs2_xattr_header *header = &(xb->xb_attrs.xb_header);
2448
ret = ocfs2_remove_value_outside(inode, &vb, header,
2449
ref_ci, ref_root_bh);
2451
ret = ocfs2_iterate_xattr_index_block(inode,
2453
ocfs2_rm_xattr_cluster,
2459
static int ocfs2_xattr_free_block(struct inode *inode,
2461
struct ocfs2_caching_info *ref_ci,
2462
struct buffer_head *ref_root_bh)
2464
struct inode *xb_alloc_inode;
2465
struct buffer_head *xb_alloc_bh = NULL;
2466
struct buffer_head *blk_bh = NULL;
2467
struct ocfs2_xattr_block *xb;
2468
struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
2474
ret = ocfs2_read_xattr_block(inode, block, &blk_bh);
2480
ret = ocfs2_xattr_block_remove(inode, blk_bh, ref_ci, ref_root_bh);
2486
xb = (struct ocfs2_xattr_block *)blk_bh->b_data;
2487
blk = le64_to_cpu(xb->xb_blkno);
2488
bit = le16_to_cpu(xb->xb_suballoc_bit);
2489
if (xb->xb_suballoc_loc)
2490
bg_blkno = le64_to_cpu(xb->xb_suballoc_loc);
2492
bg_blkno = ocfs2_which_suballoc_group(blk, bit);
2494
xb_alloc_inode = ocfs2_get_system_file_inode(osb,
2495
EXTENT_ALLOC_SYSTEM_INODE,
2496
le16_to_cpu(xb->xb_suballoc_slot));
2497
if (!xb_alloc_inode) {
2502
mutex_lock(&xb_alloc_inode->i_mutex);
2504
ret = ocfs2_inode_lock(xb_alloc_inode, &xb_alloc_bh, 1);
2510
handle = ocfs2_start_trans(osb, OCFS2_SUBALLOC_FREE);
2511
if (IS_ERR(handle)) {
2512
ret = PTR_ERR(handle);
2517
ret = ocfs2_free_suballoc_bits(handle, xb_alloc_inode, xb_alloc_bh,
2522
ocfs2_commit_trans(osb, handle);
2524
ocfs2_inode_unlock(xb_alloc_inode, 1);
2525
brelse(xb_alloc_bh);
2527
mutex_unlock(&xb_alloc_inode->i_mutex);
2528
iput(xb_alloc_inode);
2535
* ocfs2_xattr_remove()
2537
* Free extended attribute resources associated with this inode.
2539
int ocfs2_xattr_remove(struct inode *inode, struct buffer_head *di_bh)
2541
struct ocfs2_inode_info *oi = OCFS2_I(inode);
2542
struct ocfs2_dinode *di = (struct ocfs2_dinode *)di_bh->b_data;
2543
struct ocfs2_refcount_tree *ref_tree = NULL;
2544
struct buffer_head *ref_root_bh = NULL;
2545
struct ocfs2_caching_info *ref_ci = NULL;
2549
if (!ocfs2_supports_xattr(OCFS2_SB(inode->i_sb)))
2552
if (!(oi->ip_dyn_features & OCFS2_HAS_XATTR_FL))
2555
if (OCFS2_I(inode)->ip_dyn_features & OCFS2_HAS_REFCOUNT_FL) {
2556
ret = ocfs2_lock_refcount_tree(OCFS2_SB(inode->i_sb),
2557
le64_to_cpu(di->i_refcount_loc),
2558
1, &ref_tree, &ref_root_bh);
2563
ref_ci = &ref_tree->rf_ci;
2567
if (oi->ip_dyn_features & OCFS2_INLINE_XATTR_FL) {
2568
ret = ocfs2_xattr_ibody_remove(inode, di_bh,
2569
ref_ci, ref_root_bh);
2576
if (di->i_xattr_loc) {
2577
ret = ocfs2_xattr_free_block(inode,
2578
le64_to_cpu(di->i_xattr_loc),
2579
ref_ci, ref_root_bh);
2586
handle = ocfs2_start_trans((OCFS2_SB(inode->i_sb)),
2587
OCFS2_INODE_UPDATE_CREDITS);
2588
if (IS_ERR(handle)) {
2589
ret = PTR_ERR(handle);
2593
ret = ocfs2_journal_access_di(handle, INODE_CACHE(inode), di_bh,
2594
OCFS2_JOURNAL_ACCESS_WRITE);
2600
di->i_xattr_loc = 0;
2602
spin_lock(&oi->ip_lock);
2603
oi->ip_dyn_features &= ~(OCFS2_INLINE_XATTR_FL | OCFS2_HAS_XATTR_FL);
2604
di->i_dyn_features = cpu_to_le16(oi->ip_dyn_features);
2605
spin_unlock(&oi->ip_lock);
2607
ocfs2_journal_dirty(handle, di_bh);
2609
ocfs2_commit_trans(OCFS2_SB(inode->i_sb), handle);
2612
ocfs2_unlock_refcount_tree(OCFS2_SB(inode->i_sb), ref_tree, 1);
2613
brelse(ref_root_bh);
2617
static int ocfs2_xattr_has_space_inline(struct inode *inode,
2618
struct ocfs2_dinode *di)
2620
struct ocfs2_inode_info *oi = OCFS2_I(inode);
2621
unsigned int xattrsize = OCFS2_SB(inode->i_sb)->s_xattr_inline_size;
2624
if (xattrsize < OCFS2_MIN_XATTR_INLINE_SIZE)
2627
if (oi->ip_dyn_features & OCFS2_INLINE_DATA_FL) {
2628
struct ocfs2_inline_data *idata = &di->id2.i_data;
2629
free = le16_to_cpu(idata->id_count) - le64_to_cpu(di->i_size);
2630
} else if (ocfs2_inode_is_fast_symlink(inode)) {
2631
free = ocfs2_fast_symlink_chars(inode->i_sb) -
2632
le64_to_cpu(di->i_size);
2634
struct ocfs2_extent_list *el = &di->id2.i_list;
2635
free = (le16_to_cpu(el->l_count) -
2636
le16_to_cpu(el->l_next_free_rec)) *
2637
sizeof(struct ocfs2_extent_rec);
2639
if (free >= xattrsize)
2646
* ocfs2_xattr_ibody_find()
2648
* Find extended attribute in inode block and
2649
* fill search info into struct ocfs2_xattr_search.
2651
static int ocfs2_xattr_ibody_find(struct inode *inode,
2654
struct ocfs2_xattr_search *xs)
2656
struct ocfs2_inode_info *oi = OCFS2_I(inode);
2657
struct ocfs2_dinode *di = (struct ocfs2_dinode *)xs->inode_bh->b_data;
2661
if (inode->i_sb->s_blocksize == OCFS2_MIN_BLOCKSIZE)
2664
if (!(oi->ip_dyn_features & OCFS2_INLINE_XATTR_FL)) {
2665
down_read(&oi->ip_alloc_sem);
2666
has_space = ocfs2_xattr_has_space_inline(inode, di);
2667
up_read(&oi->ip_alloc_sem);
2672
xs->xattr_bh = xs->inode_bh;
2673
xs->end = (void *)di + inode->i_sb->s_blocksize;
2674
if (oi->ip_dyn_features & OCFS2_INLINE_XATTR_FL)
2675
xs->header = (struct ocfs2_xattr_header *)
2676
(xs->end - le16_to_cpu(di->i_xattr_inline_size));
2678
xs->header = (struct ocfs2_xattr_header *)
2679
(xs->end - OCFS2_SB(inode->i_sb)->s_xattr_inline_size);
2680
xs->base = (void *)xs->header;
2681
xs->here = xs->header->xh_entries;
2683
/* Find the named attribute. */
2684
if (oi->ip_dyn_features & OCFS2_INLINE_XATTR_FL) {
2685
ret = ocfs2_xattr_find_entry(name_index, name, xs);
2686
if (ret && ret != -ENODATA)
2688
xs->not_found = ret;
2694
static int ocfs2_xattr_ibody_init(struct inode *inode,
2695
struct buffer_head *di_bh,
2696
struct ocfs2_xattr_set_ctxt *ctxt)
2699
struct ocfs2_inode_info *oi = OCFS2_I(inode);
2700
struct ocfs2_dinode *di = (struct ocfs2_dinode *)di_bh->b_data;
2701
struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
2702
unsigned int xattrsize = osb->s_xattr_inline_size;
2704
if (!ocfs2_xattr_has_space_inline(inode, di)) {
2709
ret = ocfs2_journal_access_di(ctxt->handle, INODE_CACHE(inode), di_bh,
2710
OCFS2_JOURNAL_ACCESS_WRITE);
2717
* Adjust extent record count or inline data size
2718
* to reserve space for extended attribute.
2720
if (oi->ip_dyn_features & OCFS2_INLINE_DATA_FL) {
2721
struct ocfs2_inline_data *idata = &di->id2.i_data;
2722
le16_add_cpu(&idata->id_count, -xattrsize);
2723
} else if (!(ocfs2_inode_is_fast_symlink(inode))) {
2724
struct ocfs2_extent_list *el = &di->id2.i_list;
2725
le16_add_cpu(&el->l_count, -(xattrsize /
2726
sizeof(struct ocfs2_extent_rec)));
2728
di->i_xattr_inline_size = cpu_to_le16(xattrsize);
2730
spin_lock(&oi->ip_lock);
2731
oi->ip_dyn_features |= OCFS2_INLINE_XATTR_FL|OCFS2_HAS_XATTR_FL;
2732
di->i_dyn_features = cpu_to_le16(oi->ip_dyn_features);
2733
spin_unlock(&oi->ip_lock);
2735
ocfs2_journal_dirty(ctxt->handle, di_bh);
2742
* ocfs2_xattr_ibody_set()
2744
* Set, replace or remove an extended attribute into inode block.
2747
static int ocfs2_xattr_ibody_set(struct inode *inode,
2748
struct ocfs2_xattr_info *xi,
2749
struct ocfs2_xattr_search *xs,
2750
struct ocfs2_xattr_set_ctxt *ctxt)
2753
struct ocfs2_inode_info *oi = OCFS2_I(inode);
2754
struct ocfs2_dinode *di = (struct ocfs2_dinode *)xs->inode_bh->b_data;
2755
struct ocfs2_xa_loc loc;
2757
if (inode->i_sb->s_blocksize == OCFS2_MIN_BLOCKSIZE)
2760
down_write(&oi->ip_alloc_sem);
2761
if (!(oi->ip_dyn_features & OCFS2_INLINE_XATTR_FL)) {
2762
if (!ocfs2_xattr_has_space_inline(inode, di)) {
2768
if (!(oi->ip_dyn_features & OCFS2_INLINE_XATTR_FL)) {
2769
ret = ocfs2_xattr_ibody_init(inode, xs->inode_bh, ctxt);
2777
ocfs2_init_dinode_xa_loc(&loc, inode, xs->inode_bh,
2778
xs->not_found ? NULL : xs->here);
2779
ret = ocfs2_xa_set(&loc, xi, ctxt);
2785
xs->here = loc.xl_entry;
2788
up_write(&oi->ip_alloc_sem);
2794
* ocfs2_xattr_block_find()
2796
* Find extended attribute in external block and
2797
* fill search info into struct ocfs2_xattr_search.
2799
static int ocfs2_xattr_block_find(struct inode *inode,
2802
struct ocfs2_xattr_search *xs)
2804
struct ocfs2_dinode *di = (struct ocfs2_dinode *)xs->inode_bh->b_data;
2805
struct buffer_head *blk_bh = NULL;
2806
struct ocfs2_xattr_block *xb;
2809
if (!di->i_xattr_loc)
2812
ret = ocfs2_read_xattr_block(inode, le64_to_cpu(di->i_xattr_loc),
2819
xs->xattr_bh = blk_bh;
2820
xb = (struct ocfs2_xattr_block *)blk_bh->b_data;
2822
if (!(le16_to_cpu(xb->xb_flags) & OCFS2_XATTR_INDEXED)) {
2823
xs->header = &xb->xb_attrs.xb_header;
2824
xs->base = (void *)xs->header;
2825
xs->end = (void *)(blk_bh->b_data) + blk_bh->b_size;
2826
xs->here = xs->header->xh_entries;
2828
ret = ocfs2_xattr_find_entry(name_index, name, xs);
2830
ret = ocfs2_xattr_index_block_find(inode, blk_bh,
2834
if (ret && ret != -ENODATA) {
2835
xs->xattr_bh = NULL;
2838
xs->not_found = ret;
2846
static int ocfs2_create_xattr_block(struct inode *inode,
2847
struct buffer_head *inode_bh,
2848
struct ocfs2_xattr_set_ctxt *ctxt,
2850
struct buffer_head **ret_bh)
2853
u16 suballoc_bit_start;
2855
u64 suballoc_loc, first_blkno;
2856
struct ocfs2_dinode *di = (struct ocfs2_dinode *)inode_bh->b_data;
2857
struct buffer_head *new_bh = NULL;
2858
struct ocfs2_xattr_block *xblk;
2860
ret = ocfs2_journal_access_di(ctxt->handle, INODE_CACHE(inode),
2861
inode_bh, OCFS2_JOURNAL_ACCESS_CREATE);
2867
ret = ocfs2_claim_metadata(ctxt->handle, ctxt->meta_ac, 1,
2868
&suballoc_loc, &suballoc_bit_start,
2869
&num_got, &first_blkno);
2875
new_bh = sb_getblk(inode->i_sb, first_blkno);
2876
ocfs2_set_new_buffer_uptodate(INODE_CACHE(inode), new_bh);
2878
ret = ocfs2_journal_access_xb(ctxt->handle, INODE_CACHE(inode),
2880
OCFS2_JOURNAL_ACCESS_CREATE);
2886
/* Initialize ocfs2_xattr_block */
2887
xblk = (struct ocfs2_xattr_block *)new_bh->b_data;
2888
memset(xblk, 0, inode->i_sb->s_blocksize);
2889
strcpy((void *)xblk, OCFS2_XATTR_BLOCK_SIGNATURE);
2890
xblk->xb_suballoc_slot = cpu_to_le16(ctxt->meta_ac->ac_alloc_slot);
2891
xblk->xb_suballoc_loc = cpu_to_le64(suballoc_loc);
2892
xblk->xb_suballoc_bit = cpu_to_le16(suballoc_bit_start);
2893
xblk->xb_fs_generation =
2894
cpu_to_le32(OCFS2_SB(inode->i_sb)->fs_generation);
2895
xblk->xb_blkno = cpu_to_le64(first_blkno);
2897
struct ocfs2_xattr_tree_root *xr = &xblk->xb_attrs.xb_root;
2898
xr->xt_clusters = cpu_to_le32(1);
2899
xr->xt_last_eb_blk = 0;
2900
xr->xt_list.l_tree_depth = 0;
2901
xr->xt_list.l_count = cpu_to_le16(
2902
ocfs2_xattr_recs_per_xb(inode->i_sb));
2903
xr->xt_list.l_next_free_rec = cpu_to_le16(1);
2904
xblk->xb_flags = cpu_to_le16(OCFS2_XATTR_INDEXED);
2906
ocfs2_journal_dirty(ctxt->handle, new_bh);
2908
/* Add it to the inode */
2909
di->i_xattr_loc = cpu_to_le64(first_blkno);
2911
spin_lock(&OCFS2_I(inode)->ip_lock);
2912
OCFS2_I(inode)->ip_dyn_features |= OCFS2_HAS_XATTR_FL;
2913
di->i_dyn_features = cpu_to_le16(OCFS2_I(inode)->ip_dyn_features);
2914
spin_unlock(&OCFS2_I(inode)->ip_lock);
2916
ocfs2_journal_dirty(ctxt->handle, inode_bh);
2927
* ocfs2_xattr_block_set()
2929
* Set, replace or remove an extended attribute into external block.
2932
static int ocfs2_xattr_block_set(struct inode *inode,
2933
struct ocfs2_xattr_info *xi,
2934
struct ocfs2_xattr_search *xs,
2935
struct ocfs2_xattr_set_ctxt *ctxt)
2937
struct buffer_head *new_bh = NULL;
2938
struct ocfs2_xattr_block *xblk = NULL;
2940
struct ocfs2_xa_loc loc;
2942
if (!xs->xattr_bh) {
2943
ret = ocfs2_create_xattr_block(inode, xs->inode_bh, ctxt,
2950
xs->xattr_bh = new_bh;
2951
xblk = (struct ocfs2_xattr_block *)xs->xattr_bh->b_data;
2952
xs->header = &xblk->xb_attrs.xb_header;
2953
xs->base = (void *)xs->header;
2954
xs->end = (void *)xblk + inode->i_sb->s_blocksize;
2955
xs->here = xs->header->xh_entries;
2957
xblk = (struct ocfs2_xattr_block *)xs->xattr_bh->b_data;
2959
if (!(le16_to_cpu(xblk->xb_flags) & OCFS2_XATTR_INDEXED)) {
2960
ocfs2_init_xattr_block_xa_loc(&loc, inode, xs->xattr_bh,
2961
xs->not_found ? NULL : xs->here);
2963
ret = ocfs2_xa_set(&loc, xi, ctxt);
2965
xs->here = loc.xl_entry;
2966
else if ((ret != -ENOSPC) || ctxt->set_abort)
2969
ret = ocfs2_xattr_create_index_block(inode, xs, ctxt);
2975
if (le16_to_cpu(xblk->xb_flags) & OCFS2_XATTR_INDEXED)
2976
ret = ocfs2_xattr_set_entry_index_block(inode, xi, xs, ctxt);
2982
/* Check whether the new xattr can be inserted into the inode. */
2983
static int ocfs2_xattr_can_be_in_inode(struct inode *inode,
2984
struct ocfs2_xattr_info *xi,
2985
struct ocfs2_xattr_search *xs)
2987
struct ocfs2_xattr_entry *last;
2989
size_t min_offs = xs->end - xs->base;
2994
last = xs->header->xh_entries;
2996
for (i = 0; i < le16_to_cpu(xs->header->xh_count); i++) {
2997
size_t offs = le16_to_cpu(last->xe_name_offset);
2998
if (offs < min_offs)
3003
free = min_offs - ((void *)last - xs->base) - OCFS2_XATTR_HEADER_GAP;
3007
BUG_ON(!xs->not_found);
3009
if (free >= (sizeof(struct ocfs2_xattr_entry) + namevalue_size_xi(xi)))
3015
static int ocfs2_calc_xattr_set_need(struct inode *inode,
3016
struct ocfs2_dinode *di,
3017
struct ocfs2_xattr_info *xi,
3018
struct ocfs2_xattr_search *xis,
3019
struct ocfs2_xattr_search *xbs,
3024
int ret = 0, old_in_xb = 0;
3025
int clusters_add = 0, meta_add = 0, credits = 0;
3026
struct buffer_head *bh = NULL;
3027
struct ocfs2_xattr_block *xb = NULL;
3028
struct ocfs2_xattr_entry *xe = NULL;
3029
struct ocfs2_xattr_value_root *xv = NULL;
3031
int name_offset, name_len = 0;
3032
u32 new_clusters = ocfs2_clusters_for_bytes(inode->i_sb,
3037
* Calculate the clusters we need to write.
3038
* No matter whether we replace an old one or add a new one,
3039
* we need this for writing.
3041
if (xi->xi_value_len > OCFS2_XATTR_INLINE_SIZE)
3042
credits += new_clusters *
3043
ocfs2_clusters_to_blocks(inode->i_sb, 1);
3045
if (xis->not_found && xbs->not_found) {
3046
credits += ocfs2_blocks_per_xattr_bucket(inode->i_sb);
3048
if (xi->xi_value_len > OCFS2_XATTR_INLINE_SIZE) {
3049
clusters_add += new_clusters;
3050
credits += ocfs2_calc_extend_credits(inode->i_sb,
3058
if (!xis->not_found) {
3060
name_offset = le16_to_cpu(xe->xe_name_offset);
3061
name_len = OCFS2_XATTR_SIZE(xe->xe_name_len);
3063
credits += OCFS2_INODE_UPDATE_CREDITS;
3065
int i, block_off = 0;
3066
xb = (struct ocfs2_xattr_block *)xbs->xattr_bh->b_data;
3068
name_offset = le16_to_cpu(xe->xe_name_offset);
3069
name_len = OCFS2_XATTR_SIZE(xe->xe_name_len);
3070
i = xbs->here - xbs->header->xh_entries;
3073
if (le16_to_cpu(xb->xb_flags) & OCFS2_XATTR_INDEXED) {
3074
ret = ocfs2_xattr_bucket_get_name_value(inode->i_sb,
3075
bucket_xh(xbs->bucket),
3078
base = bucket_block(xbs->bucket, block_off);
3079
credits += ocfs2_blocks_per_xattr_bucket(inode->i_sb);
3082
credits += OCFS2_XATTR_BLOCK_UPDATE_CREDITS;
3087
* delete a xattr doesn't need metadata and cluster allocation.
3088
* so just calculate the credits and return.
3090
* The credits for removing the value tree will be extended
3091
* by ocfs2_remove_extent itself.
3093
if (!xi->xi_value) {
3094
if (!ocfs2_xattr_is_local(xe))
3095
credits += ocfs2_remove_extent_credits(inode->i_sb);
3100
/* do cluster allocation guess first. */
3101
value_size = le64_to_cpu(xe->xe_value_size);
3105
* In xattr set, we always try to set the xe in inode first,
3106
* so if it can be inserted into inode successfully, the old
3107
* one will be removed from the xattr block, and this xattr
3108
* will be inserted into inode as a new xattr in inode.
3110
if (ocfs2_xattr_can_be_in_inode(inode, xi, xis)) {
3111
clusters_add += new_clusters;
3112
credits += ocfs2_remove_extent_credits(inode->i_sb) +
3113
OCFS2_INODE_UPDATE_CREDITS;
3114
if (!ocfs2_xattr_is_local(xe))
3115
credits += ocfs2_calc_extend_credits(
3123
if (xi->xi_value_len > OCFS2_XATTR_INLINE_SIZE) {
3124
/* the new values will be stored outside. */
3125
u32 old_clusters = 0;
3127
if (!ocfs2_xattr_is_local(xe)) {
3128
old_clusters = ocfs2_clusters_for_bytes(inode->i_sb,
3130
xv = (struct ocfs2_xattr_value_root *)
3131
(base + name_offset + name_len);
3132
value_size = OCFS2_XATTR_ROOT_SIZE;
3136
if (old_clusters >= new_clusters) {
3137
credits += ocfs2_remove_extent_credits(inode->i_sb);
3140
meta_add += ocfs2_extend_meta_needed(&xv->xr_list);
3141
clusters_add += new_clusters - old_clusters;
3142
credits += ocfs2_calc_extend_credits(inode->i_sb,
3146
if (value_size >= OCFS2_XATTR_ROOT_SIZE)
3151
* Now the new value will be stored inside. So if the new
3152
* value is smaller than the size of value root or the old
3153
* value, we don't need any allocation, otherwise we have
3154
* to guess metadata allocation.
3156
if ((ocfs2_xattr_is_local(xe) &&
3157
(value_size >= xi->xi_value_len)) ||
3158
(!ocfs2_xattr_is_local(xe) &&
3159
OCFS2_XATTR_ROOT_SIZE >= xi->xi_value_len))
3164
/* calculate metadata allocation. */
3165
if (di->i_xattr_loc) {
3166
if (!xbs->xattr_bh) {
3167
ret = ocfs2_read_xattr_block(inode,
3168
le64_to_cpu(di->i_xattr_loc),
3175
xb = (struct ocfs2_xattr_block *)bh->b_data;
3177
xb = (struct ocfs2_xattr_block *)xbs->xattr_bh->b_data;
3180
* If there is already an xattr tree, good, we can calculate
3181
* like other b-trees. Otherwise we may have the chance of
3182
* create a tree, the credit calculation is borrowed from
3183
* ocfs2_calc_extend_credits with root_el = NULL. And the
3184
* new tree will be cluster based, so no meta is needed.
3186
if (le16_to_cpu(xb->xb_flags) & OCFS2_XATTR_INDEXED) {
3187
struct ocfs2_extent_list *el =
3188
&xb->xb_attrs.xb_root.xt_list;
3189
meta_add += ocfs2_extend_meta_needed(el);
3190
credits += ocfs2_calc_extend_credits(inode->i_sb,
3193
credits += OCFS2_SUBALLOC_ALLOC + 1;
3196
* This cluster will be used either for new bucket or for
3198
* If the cluster size is the same as the bucket size, one
3199
* more is needed since we may need to extend the bucket
3203
credits += ocfs2_blocks_per_xattr_bucket(inode->i_sb);
3204
if (OCFS2_XATTR_BUCKET_SIZE ==
3205
OCFS2_SB(inode->i_sb)->s_clustersize) {
3206
credits += ocfs2_blocks_per_xattr_bucket(inode->i_sb);
3211
credits += OCFS2_XATTR_BLOCK_CREATE_CREDITS;
3215
*clusters_need = clusters_add;
3217
*meta_need = meta_add;
3219
*credits_need = credits;
3224
static int ocfs2_init_xattr_set_ctxt(struct inode *inode,
3225
struct ocfs2_dinode *di,
3226
struct ocfs2_xattr_info *xi,
3227
struct ocfs2_xattr_search *xis,
3228
struct ocfs2_xattr_search *xbs,
3229
struct ocfs2_xattr_set_ctxt *ctxt,
3233
int clusters_add, meta_add, ret;
3234
struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
3236
memset(ctxt, 0, sizeof(struct ocfs2_xattr_set_ctxt));
3238
ocfs2_init_dealloc_ctxt(&ctxt->dealloc);
3240
ret = ocfs2_calc_xattr_set_need(inode, di, xi, xis, xbs,
3241
&clusters_add, &meta_add, credits);
3247
meta_add += extra_meta;
3248
trace_ocfs2_init_xattr_set_ctxt(xi->xi_name, meta_add,
3249
clusters_add, *credits);
3252
ret = ocfs2_reserve_new_metadata_blocks(osb, meta_add,
3261
ret = ocfs2_reserve_clusters(osb, clusters_add, &ctxt->data_ac);
3267
if (ctxt->meta_ac) {
3268
ocfs2_free_alloc_context(ctxt->meta_ac);
3269
ctxt->meta_ac = NULL;
3273
* We cannot have an error and a non null ctxt->data_ac.
3280
static int __ocfs2_xattr_set_handle(struct inode *inode,
3281
struct ocfs2_dinode *di,
3282
struct ocfs2_xattr_info *xi,
3283
struct ocfs2_xattr_search *xis,
3284
struct ocfs2_xattr_search *xbs,
3285
struct ocfs2_xattr_set_ctxt *ctxt)
3287
int ret = 0, credits, old_found;
3289
if (!xi->xi_value) {
3290
/* Remove existing extended attribute */
3291
if (!xis->not_found)
3292
ret = ocfs2_xattr_ibody_set(inode, xi, xis, ctxt);
3293
else if (!xbs->not_found)
3294
ret = ocfs2_xattr_block_set(inode, xi, xbs, ctxt);
3296
/* We always try to set extended attribute into inode first*/
3297
ret = ocfs2_xattr_ibody_set(inode, xi, xis, ctxt);
3298
if (!ret && !xbs->not_found) {
3300
* If succeed and that extended attribute existing in
3301
* external block, then we will remove it.
3303
xi->xi_value = NULL;
3304
xi->xi_value_len = 0;
3306
old_found = xis->not_found;
3307
xis->not_found = -ENODATA;
3308
ret = ocfs2_calc_xattr_set_need(inode,
3316
xis->not_found = old_found;
3322
ret = ocfs2_extend_trans(ctxt->handle, credits);
3327
ret = ocfs2_xattr_block_set(inode, xi, xbs, ctxt);
3328
} else if ((ret == -ENOSPC) && !ctxt->set_abort) {
3329
if (di->i_xattr_loc && !xbs->xattr_bh) {
3330
ret = ocfs2_xattr_block_find(inode,
3336
old_found = xis->not_found;
3337
xis->not_found = -ENODATA;
3338
ret = ocfs2_calc_xattr_set_need(inode,
3346
xis->not_found = old_found;
3352
ret = ocfs2_extend_trans(ctxt->handle, credits);
3359
* If no space in inode, we will set extended attribute
3360
* into external block.
3362
ret = ocfs2_xattr_block_set(inode, xi, xbs, ctxt);
3365
if (!xis->not_found) {
3367
* If succeed and that extended attribute
3368
* existing in inode, we will remove it.
3370
xi->xi_value = NULL;
3371
xi->xi_value_len = 0;
3372
xbs->not_found = -ENODATA;
3373
ret = ocfs2_calc_xattr_set_need(inode,
3386
ret = ocfs2_extend_trans(ctxt->handle, credits);
3391
ret = ocfs2_xattr_ibody_set(inode, xi,
3398
/* Update inode ctime. */
3399
ret = ocfs2_journal_access_di(ctxt->handle, INODE_CACHE(inode),
3401
OCFS2_JOURNAL_ACCESS_WRITE);
3407
inode->i_ctime = CURRENT_TIME;
3408
di->i_ctime = cpu_to_le64(inode->i_ctime.tv_sec);
3409
di->i_ctime_nsec = cpu_to_le32(inode->i_ctime.tv_nsec);
3410
ocfs2_journal_dirty(ctxt->handle, xis->inode_bh);
3417
* This function only called duing creating inode
3418
* for init security/acl xattrs of the new inode.
3419
* All transanction credits have been reserved in mknod.
3421
int ocfs2_xattr_set_handle(handle_t *handle,
3422
struct inode *inode,
3423
struct buffer_head *di_bh,
3429
struct ocfs2_alloc_context *meta_ac,
3430
struct ocfs2_alloc_context *data_ac)
3432
struct ocfs2_dinode *di;
3435
struct ocfs2_xattr_info xi = {
3436
.xi_name_index = name_index,
3438
.xi_name_len = strlen(name),
3440
.xi_value_len = value_len,
3443
struct ocfs2_xattr_search xis = {
3444
.not_found = -ENODATA,
3447
struct ocfs2_xattr_search xbs = {
3448
.not_found = -ENODATA,
3451
struct ocfs2_xattr_set_ctxt ctxt = {
3457
if (!ocfs2_supports_xattr(OCFS2_SB(inode->i_sb)))
3461
* In extreme situation, may need xattr bucket when
3462
* block size is too small. And we have already reserved
3463
* the credits for bucket in mknod.
3465
if (inode->i_sb->s_blocksize == OCFS2_MIN_BLOCKSIZE) {
3466
xbs.bucket = ocfs2_xattr_bucket_new(inode);
3468
mlog_errno(-ENOMEM);
3473
xis.inode_bh = xbs.inode_bh = di_bh;
3474
di = (struct ocfs2_dinode *)di_bh->b_data;
3476
down_write(&OCFS2_I(inode)->ip_xattr_sem);
3478
ret = ocfs2_xattr_ibody_find(inode, name_index, name, &xis);
3481
if (xis.not_found) {
3482
ret = ocfs2_xattr_block_find(inode, name_index, name, &xbs);
3487
ret = __ocfs2_xattr_set_handle(inode, di, &xi, &xis, &xbs, &ctxt);
3490
up_write(&OCFS2_I(inode)->ip_xattr_sem);
3491
brelse(xbs.xattr_bh);
3492
ocfs2_xattr_bucket_free(xbs.bucket);
3500
* Set, replace or remove an extended attribute for this inode.
3501
* value is NULL to remove an existing extended attribute, else either
3502
* create or replace an extended attribute.
3504
int ocfs2_xattr_set(struct inode *inode,
3511
struct buffer_head *di_bh = NULL;
3512
struct ocfs2_dinode *di;
3513
int ret, credits, ref_meta = 0, ref_credits = 0;
3514
struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
3515
struct inode *tl_inode = osb->osb_tl_inode;
3516
struct ocfs2_xattr_set_ctxt ctxt = { NULL, NULL, };
3517
struct ocfs2_refcount_tree *ref_tree = NULL;
3519
struct ocfs2_xattr_info xi = {
3520
.xi_name_index = name_index,
3522
.xi_name_len = strlen(name),
3524
.xi_value_len = value_len,
3527
struct ocfs2_xattr_search xis = {
3528
.not_found = -ENODATA,
3531
struct ocfs2_xattr_search xbs = {
3532
.not_found = -ENODATA,
3535
if (!ocfs2_supports_xattr(OCFS2_SB(inode->i_sb)))
3539
* Only xbs will be used on indexed trees. xis doesn't need a
3542
xbs.bucket = ocfs2_xattr_bucket_new(inode);
3544
mlog_errno(-ENOMEM);
3548
ret = ocfs2_inode_lock(inode, &di_bh, 1);
3551
goto cleanup_nolock;
3553
xis.inode_bh = xbs.inode_bh = di_bh;
3554
di = (struct ocfs2_dinode *)di_bh->b_data;
3556
down_write(&OCFS2_I(inode)->ip_xattr_sem);
3558
* Scan inode and external block to find the same name
3559
* extended attribute and collect search information.
3561
ret = ocfs2_xattr_ibody_find(inode, name_index, name, &xis);
3564
if (xis.not_found) {
3565
ret = ocfs2_xattr_block_find(inode, name_index, name, &xbs);
3570
if (xis.not_found && xbs.not_found) {
3572
if (flags & XATTR_REPLACE)
3579
if (flags & XATTR_CREATE)
3583
/* Check whether the value is refcounted and do some preparation. */
3584
if (OCFS2_I(inode)->ip_dyn_features & OCFS2_HAS_REFCOUNT_FL &&
3585
(!xis.not_found || !xbs.not_found)) {
3586
ret = ocfs2_prepare_refcount_xattr(inode, di, &xi,
3587
&xis, &xbs, &ref_tree,
3588
&ref_meta, &ref_credits);
3595
mutex_lock(&tl_inode->i_mutex);
3597
if (ocfs2_truncate_log_needs_flush(osb)) {
3598
ret = __ocfs2_flush_truncate_log(osb);
3600
mutex_unlock(&tl_inode->i_mutex);
3605
mutex_unlock(&tl_inode->i_mutex);
3607
ret = ocfs2_init_xattr_set_ctxt(inode, di, &xi, &xis,
3608
&xbs, &ctxt, ref_meta, &credits);
3614
/* we need to update inode's ctime field, so add credit for it. */
3615
credits += OCFS2_INODE_UPDATE_CREDITS;
3616
ctxt.handle = ocfs2_start_trans(osb, credits + ref_credits);
3617
if (IS_ERR(ctxt.handle)) {
3618
ret = PTR_ERR(ctxt.handle);
3623
ret = __ocfs2_xattr_set_handle(inode, di, &xi, &xis, &xbs, &ctxt);
3625
ocfs2_commit_trans(osb, ctxt.handle);
3628
ocfs2_free_alloc_context(ctxt.data_ac);
3630
ocfs2_free_alloc_context(ctxt.meta_ac);
3631
if (ocfs2_dealloc_has_cluster(&ctxt.dealloc))
3632
ocfs2_schedule_truncate_log_flush(osb, 1);
3633
ocfs2_run_deallocs(osb, &ctxt.dealloc);
3637
ocfs2_unlock_refcount_tree(osb, ref_tree, 1);
3638
up_write(&OCFS2_I(inode)->ip_xattr_sem);
3639
if (!value && !ret) {
3640
ret = ocfs2_try_remove_refcount_tree(inode, di_bh);
3644
ocfs2_inode_unlock(inode, 1);
3647
brelse(xbs.xattr_bh);
3648
ocfs2_xattr_bucket_free(xbs.bucket);
3654
* Find the xattr extent rec which may contains name_hash.
3655
* e_cpos will be the first name hash of the xattr rec.
3656
* el must be the ocfs2_xattr_header.xb_attrs.xb_root.xt_list.
3658
static int ocfs2_xattr_get_rec(struct inode *inode,
3663
struct ocfs2_extent_list *el)
3666
struct buffer_head *eb_bh = NULL;
3667
struct ocfs2_extent_block *eb;
3668
struct ocfs2_extent_rec *rec = NULL;
3671
if (el->l_tree_depth) {
3672
ret = ocfs2_find_leaf(INODE_CACHE(inode), el, name_hash,
3679
eb = (struct ocfs2_extent_block *) eb_bh->b_data;
3682
if (el->l_tree_depth) {
3683
ocfs2_error(inode->i_sb,
3684
"Inode %lu has non zero tree depth in "
3685
"xattr tree block %llu\n", inode->i_ino,
3686
(unsigned long long)eb_bh->b_blocknr);
3692
for (i = le16_to_cpu(el->l_next_free_rec) - 1; i >= 0; i--) {
3693
rec = &el->l_recs[i];
3695
if (le32_to_cpu(rec->e_cpos) <= name_hash) {
3696
e_blkno = le64_to_cpu(rec->e_blkno);
3702
ocfs2_error(inode->i_sb, "Inode %lu has bad extent "
3703
"record (%u, %u, 0) in xattr", inode->i_ino,
3704
le32_to_cpu(rec->e_cpos),
3705
ocfs2_rec_clusters(el, rec));
3710
*p_blkno = le64_to_cpu(rec->e_blkno);
3711
*num_clusters = le16_to_cpu(rec->e_leaf_clusters);
3713
*e_cpos = le32_to_cpu(rec->e_cpos);
3719
typedef int (xattr_bucket_func)(struct inode *inode,
3720
struct ocfs2_xattr_bucket *bucket,
3723
static int ocfs2_find_xe_in_bucket(struct inode *inode,
3724
struct ocfs2_xattr_bucket *bucket,
3731
int i, ret = 0, cmp = 1, block_off, new_offset;
3732
struct ocfs2_xattr_header *xh = bucket_xh(bucket);
3733
size_t name_len = strlen(name);
3734
struct ocfs2_xattr_entry *xe = NULL;
3738
* We don't use binary search in the bucket because there
3739
* may be multiple entries with the same name hash.
3741
for (i = 0; i < le16_to_cpu(xh->xh_count); i++) {
3742
xe = &xh->xh_entries[i];
3744
if (name_hash > le32_to_cpu(xe->xe_name_hash))
3746
else if (name_hash < le32_to_cpu(xe->xe_name_hash))
3749
cmp = name_index - ocfs2_xattr_get_type(xe);
3751
cmp = name_len - xe->xe_name_len;
3755
ret = ocfs2_xattr_bucket_get_name_value(inode->i_sb,
3766
xe_name = bucket_block(bucket, block_off) + new_offset;
3767
if (!memcmp(name, xe_name, name_len)) {
3779
* Find the specified xattr entry in a series of buckets.
3780
* This series start from p_blkno and last for num_clusters.
3781
* The ocfs2_xattr_header.xh_num_buckets of the first bucket contains
3782
* the num of the valid buckets.
3784
* Return the buffer_head this xattr should reside in. And if the xattr's
3785
* hash is in the gap of 2 buckets, return the lower bucket.
3787
static int ocfs2_xattr_bucket_find(struct inode *inode,
3794
struct ocfs2_xattr_search *xs)
3797
struct ocfs2_xattr_header *xh = NULL;
3798
struct ocfs2_xattr_entry *xe = NULL;
3800
u16 blk_per_bucket = ocfs2_blocks_per_xattr_bucket(inode->i_sb);
3801
int low_bucket = 0, bucket, high_bucket;
3802
struct ocfs2_xattr_bucket *search;
3804
u64 blkno, lower_blkno = 0;
3806
search = ocfs2_xattr_bucket_new(inode);
3813
ret = ocfs2_read_xattr_bucket(search, p_blkno);
3819
xh = bucket_xh(search);
3820
high_bucket = le16_to_cpu(xh->xh_num_buckets) - 1;
3821
while (low_bucket <= high_bucket) {
3822
ocfs2_xattr_bucket_relse(search);
3824
bucket = (low_bucket + high_bucket) / 2;
3825
blkno = p_blkno + bucket * blk_per_bucket;
3826
ret = ocfs2_read_xattr_bucket(search, blkno);
3832
xh = bucket_xh(search);
3833
xe = &xh->xh_entries[0];
3834
if (name_hash < le32_to_cpu(xe->xe_name_hash)) {
3835
high_bucket = bucket - 1;
3840
* Check whether the hash of the last entry in our
3841
* bucket is larger than the search one. for an empty
3842
* bucket, the last one is also the first one.
3845
xe = &xh->xh_entries[le16_to_cpu(xh->xh_count) - 1];
3847
last_hash = le32_to_cpu(xe->xe_name_hash);
3849
/* record lower_blkno which may be the insert place. */
3850
lower_blkno = blkno;
3852
if (name_hash > le32_to_cpu(xe->xe_name_hash)) {
3853
low_bucket = bucket + 1;
3857
/* the searched xattr should reside in this bucket if exists. */
3858
ret = ocfs2_find_xe_in_bucket(inode, search,
3859
name_index, name, name_hash,
3869
* Record the bucket we have found.
3870
* When the xattr's hash value is in the gap of 2 buckets, we will
3871
* always set it to the previous bucket.
3874
lower_blkno = p_blkno;
3876
/* This should be in cache - we just read it during the search */
3877
ret = ocfs2_read_xattr_bucket(xs->bucket, lower_blkno);
3883
xs->header = bucket_xh(xs->bucket);
3884
xs->base = bucket_block(xs->bucket, 0);
3885
xs->end = xs->base + inode->i_sb->s_blocksize;
3888
xs->here = &xs->header->xh_entries[index];
3889
trace_ocfs2_xattr_bucket_find(OCFS2_I(inode)->ip_blkno,
3890
name, name_index, name_hash,
3891
(unsigned long long)bucket_blkno(xs->bucket),
3897
ocfs2_xattr_bucket_free(search);
3901
static int ocfs2_xattr_index_block_find(struct inode *inode,
3902
struct buffer_head *root_bh,
3905
struct ocfs2_xattr_search *xs)
3908
struct ocfs2_xattr_block *xb =
3909
(struct ocfs2_xattr_block *)root_bh->b_data;
3910
struct ocfs2_xattr_tree_root *xb_root = &xb->xb_attrs.xb_root;
3911
struct ocfs2_extent_list *el = &xb_root->xt_list;
3913
u32 first_hash, num_clusters = 0;
3914
u32 name_hash = ocfs2_xattr_name_hash(inode, name, strlen(name));
3916
if (le16_to_cpu(el->l_next_free_rec) == 0)
3919
trace_ocfs2_xattr_index_block_find(OCFS2_I(inode)->ip_blkno,
3920
name, name_index, name_hash,
3921
(unsigned long long)root_bh->b_blocknr,
3924
ret = ocfs2_xattr_get_rec(inode, name_hash, &p_blkno, &first_hash,
3931
BUG_ON(p_blkno == 0 || num_clusters == 0 || first_hash > name_hash);
3933
trace_ocfs2_xattr_index_block_find_rec(OCFS2_I(inode)->ip_blkno,
3934
name, name_index, first_hash,
3935
(unsigned long long)p_blkno,
3938
ret = ocfs2_xattr_bucket_find(inode, name_index, name, name_hash,
3939
p_blkno, first_hash, num_clusters, xs);
3945
static int ocfs2_iterate_xattr_buckets(struct inode *inode,
3948
xattr_bucket_func *func,
3952
u32 bpc = ocfs2_xattr_buckets_per_cluster(OCFS2_SB(inode->i_sb));
3953
u32 num_buckets = clusters * bpc;
3954
struct ocfs2_xattr_bucket *bucket;
3956
bucket = ocfs2_xattr_bucket_new(inode);
3958
mlog_errno(-ENOMEM);
3962
trace_ocfs2_iterate_xattr_buckets(
3963
(unsigned long long)OCFS2_I(inode)->ip_blkno,
3964
(unsigned long long)blkno, clusters);
3966
for (i = 0; i < num_buckets; i++, blkno += bucket->bu_blocks) {
3967
ret = ocfs2_read_xattr_bucket(bucket, blkno);
3974
* The real bucket num in this series of blocks is stored
3975
* in the 1st bucket.
3978
num_buckets = le16_to_cpu(bucket_xh(bucket)->xh_num_buckets);
3980
trace_ocfs2_iterate_xattr_bucket((unsigned long long)blkno,
3981
le32_to_cpu(bucket_xh(bucket)->xh_entries[0].xe_name_hash));
3983
ret = func(inode, bucket, para);
3984
if (ret && ret != -ERANGE)
3986
/* Fall through to bucket_relse() */
3989
ocfs2_xattr_bucket_relse(bucket);
3994
ocfs2_xattr_bucket_free(bucket);
3998
struct ocfs2_xattr_tree_list {
4004
static int ocfs2_xattr_bucket_get_name_value(struct super_block *sb,
4005
struct ocfs2_xattr_header *xh,
4012
if (index < 0 || index >= le16_to_cpu(xh->xh_count))
4015
name_offset = le16_to_cpu(xh->xh_entries[index].xe_name_offset);
4017
*block_off = name_offset >> sb->s_blocksize_bits;
4018
*new_offset = name_offset % sb->s_blocksize;
4023
static int ocfs2_list_xattr_bucket(struct inode *inode,
4024
struct ocfs2_xattr_bucket *bucket,
4028
struct ocfs2_xattr_tree_list *xl = (struct ocfs2_xattr_tree_list *)para;
4029
int i, block_off, new_offset;
4030
const char *prefix, *name;
4032
for (i = 0 ; i < le16_to_cpu(bucket_xh(bucket)->xh_count); i++) {
4033
struct ocfs2_xattr_entry *entry = &bucket_xh(bucket)->xh_entries[i];
4034
type = ocfs2_xattr_get_type(entry);
4035
prefix = ocfs2_xattr_prefix(type);
4038
ret = ocfs2_xattr_bucket_get_name_value(inode->i_sb,
4046
name = (const char *)bucket_block(bucket, block_off) +
4048
ret = ocfs2_xattr_list_entry(xl->buffer,
4052
entry->xe_name_len);
4061
static int ocfs2_iterate_xattr_index_block(struct inode *inode,
4062
struct buffer_head *blk_bh,
4063
xattr_tree_rec_func *rec_func,
4066
struct ocfs2_xattr_block *xb =
4067
(struct ocfs2_xattr_block *)blk_bh->b_data;
4068
struct ocfs2_extent_list *el = &xb->xb_attrs.xb_root.xt_list;
4070
u32 name_hash = UINT_MAX, e_cpos = 0, num_clusters = 0;
4073
if (!el->l_next_free_rec || !rec_func)
4076
while (name_hash > 0) {
4077
ret = ocfs2_xattr_get_rec(inode, name_hash, &p_blkno,
4078
&e_cpos, &num_clusters, el);
4084
ret = rec_func(inode, blk_bh, p_blkno, e_cpos,
4085
num_clusters, para);
4095
name_hash = e_cpos - 1;
4102
static int ocfs2_list_xattr_tree_rec(struct inode *inode,
4103
struct buffer_head *root_bh,
4104
u64 blkno, u32 cpos, u32 len, void *para)
4106
return ocfs2_iterate_xattr_buckets(inode, blkno, len,
4107
ocfs2_list_xattr_bucket, para);
4110
static int ocfs2_xattr_tree_list_index_block(struct inode *inode,
4111
struct buffer_head *blk_bh,
4116
struct ocfs2_xattr_tree_list xl = {
4118
.buffer_size = buffer_size,
4122
ret = ocfs2_iterate_xattr_index_block(inode, blk_bh,
4123
ocfs2_list_xattr_tree_rec, &xl);
4134
static int cmp_xe(const void *a, const void *b)
4136
const struct ocfs2_xattr_entry *l = a, *r = b;
4137
u32 l_hash = le32_to_cpu(l->xe_name_hash);
4138
u32 r_hash = le32_to_cpu(r->xe_name_hash);
4140
if (l_hash > r_hash)
4142
if (l_hash < r_hash)
4147
static void swap_xe(void *a, void *b, int size)
4149
struct ocfs2_xattr_entry *l = a, *r = b, tmp;
4152
memcpy(l, r, sizeof(struct ocfs2_xattr_entry));
4153
memcpy(r, &tmp, sizeof(struct ocfs2_xattr_entry));
4157
* When the ocfs2_xattr_block is filled up, new bucket will be created
4158
* and all the xattr entries will be moved to the new bucket.
4159
* The header goes at the start of the bucket, and the names+values are
4160
* filled from the end. This is why *target starts as the last buffer.
4161
* Note: we need to sort the entries since they are not saved in order
4162
* in the ocfs2_xattr_block.
4164
static void ocfs2_cp_xattr_block_to_bucket(struct inode *inode,
4165
struct buffer_head *xb_bh,
4166
struct ocfs2_xattr_bucket *bucket)
4168
int i, blocksize = inode->i_sb->s_blocksize;
4169
int blks = ocfs2_blocks_per_xattr_bucket(inode->i_sb);
4170
u16 offset, size, off_change;
4171
struct ocfs2_xattr_entry *xe;
4172
struct ocfs2_xattr_block *xb =
4173
(struct ocfs2_xattr_block *)xb_bh->b_data;
4174
struct ocfs2_xattr_header *xb_xh = &xb->xb_attrs.xb_header;
4175
struct ocfs2_xattr_header *xh = bucket_xh(bucket);
4176
u16 count = le16_to_cpu(xb_xh->xh_count);
4177
char *src = xb_bh->b_data;
4178
char *target = bucket_block(bucket, blks - 1);
4180
trace_ocfs2_cp_xattr_block_to_bucket_begin(
4181
(unsigned long long)xb_bh->b_blocknr,
4182
(unsigned long long)bucket_blkno(bucket));
4184
for (i = 0; i < blks; i++)
4185
memset(bucket_block(bucket, i), 0, blocksize);
4188
* Since the xe_name_offset is based on ocfs2_xattr_header,
4189
* there is a offset change corresponding to the change of
4190
* ocfs2_xattr_header's position.
4192
off_change = offsetof(struct ocfs2_xattr_block, xb_attrs.xb_header);
4193
xe = &xb_xh->xh_entries[count - 1];
4194
offset = le16_to_cpu(xe->xe_name_offset) + off_change;
4195
size = blocksize - offset;
4197
/* copy all the names and values. */
4198
memcpy(target + offset, src + offset, size);
4200
/* Init new header now. */
4201
xh->xh_count = xb_xh->xh_count;
4202
xh->xh_num_buckets = cpu_to_le16(1);
4203
xh->xh_name_value_len = cpu_to_le16(size);
4204
xh->xh_free_start = cpu_to_le16(OCFS2_XATTR_BUCKET_SIZE - size);
4206
/* copy all the entries. */
4207
target = bucket_block(bucket, 0);
4208
offset = offsetof(struct ocfs2_xattr_header, xh_entries);
4209
size = count * sizeof(struct ocfs2_xattr_entry);
4210
memcpy(target + offset, (char *)xb_xh + offset, size);
4212
/* Change the xe offset for all the xe because of the move. */
4213
off_change = OCFS2_XATTR_BUCKET_SIZE - blocksize +
4214
offsetof(struct ocfs2_xattr_block, xb_attrs.xb_header);
4215
for (i = 0; i < count; i++)
4216
le16_add_cpu(&xh->xh_entries[i].xe_name_offset, off_change);
4218
trace_ocfs2_cp_xattr_block_to_bucket_end(offset, size, off_change);
4220
sort(target + offset, count, sizeof(struct ocfs2_xattr_entry),
4225
* After we move xattr from block to index btree, we have to
4226
* update ocfs2_xattr_search to the new xe and base.
4228
* When the entry is in xattr block, xattr_bh indicates the storage place.
4229
* While if the entry is in index b-tree, "bucket" indicates the
4230
* real place of the xattr.
4232
static void ocfs2_xattr_update_xattr_search(struct inode *inode,
4233
struct ocfs2_xattr_search *xs,
4234
struct buffer_head *old_bh)
4236
char *buf = old_bh->b_data;
4237
struct ocfs2_xattr_block *old_xb = (struct ocfs2_xattr_block *)buf;
4238
struct ocfs2_xattr_header *old_xh = &old_xb->xb_attrs.xb_header;
4241
xs->header = bucket_xh(xs->bucket);
4242
xs->base = bucket_block(xs->bucket, 0);
4243
xs->end = xs->base + inode->i_sb->s_blocksize;
4248
i = xs->here - old_xh->xh_entries;
4249
xs->here = &xs->header->xh_entries[i];
4252
static int ocfs2_xattr_create_index_block(struct inode *inode,
4253
struct ocfs2_xattr_search *xs,
4254
struct ocfs2_xattr_set_ctxt *ctxt)
4259
handle_t *handle = ctxt->handle;
4260
struct ocfs2_inode_info *oi = OCFS2_I(inode);
4261
struct buffer_head *xb_bh = xs->xattr_bh;
4262
struct ocfs2_xattr_block *xb =
4263
(struct ocfs2_xattr_block *)xb_bh->b_data;
4264
struct ocfs2_xattr_tree_root *xr;
4265
u16 xb_flags = le16_to_cpu(xb->xb_flags);
4267
trace_ocfs2_xattr_create_index_block_begin(
4268
(unsigned long long)xb_bh->b_blocknr);
4270
BUG_ON(xb_flags & OCFS2_XATTR_INDEXED);
4271
BUG_ON(!xs->bucket);
4275
* We can use this lock for now, and maybe move to a dedicated mutex
4276
* if performance becomes a problem later.
4278
down_write(&oi->ip_alloc_sem);
4280
ret = ocfs2_journal_access_xb(handle, INODE_CACHE(inode), xb_bh,
4281
OCFS2_JOURNAL_ACCESS_WRITE);
4287
ret = __ocfs2_claim_clusters(handle, ctxt->data_ac,
4288
1, 1, &bit_off, &len);
4295
* The bucket may spread in many blocks, and
4296
* we will only touch the 1st block and the last block
4297
* in the whole bucket(one for entry and one for data).
4299
blkno = ocfs2_clusters_to_blocks(inode->i_sb, bit_off);
4301
trace_ocfs2_xattr_create_index_block((unsigned long long)blkno);
4303
ret = ocfs2_init_xattr_bucket(xs->bucket, blkno);
4309
ret = ocfs2_xattr_bucket_journal_access(handle, xs->bucket,
4310
OCFS2_JOURNAL_ACCESS_CREATE);
4316
ocfs2_cp_xattr_block_to_bucket(inode, xb_bh, xs->bucket);
4317
ocfs2_xattr_bucket_journal_dirty(handle, xs->bucket);
4319
ocfs2_xattr_update_xattr_search(inode, xs, xb_bh);
4321
/* Change from ocfs2_xattr_header to ocfs2_xattr_tree_root */
4322
memset(&xb->xb_attrs, 0, inode->i_sb->s_blocksize -
4323
offsetof(struct ocfs2_xattr_block, xb_attrs));
4325
xr = &xb->xb_attrs.xb_root;
4326
xr->xt_clusters = cpu_to_le32(1);
4327
xr->xt_last_eb_blk = 0;
4328
xr->xt_list.l_tree_depth = 0;
4329
xr->xt_list.l_count = cpu_to_le16(ocfs2_xattr_recs_per_xb(inode->i_sb));
4330
xr->xt_list.l_next_free_rec = cpu_to_le16(1);
4332
xr->xt_list.l_recs[0].e_cpos = 0;
4333
xr->xt_list.l_recs[0].e_blkno = cpu_to_le64(blkno);
4334
xr->xt_list.l_recs[0].e_leaf_clusters = cpu_to_le16(1);
4336
xb->xb_flags = cpu_to_le16(xb_flags | OCFS2_XATTR_INDEXED);
4338
ocfs2_journal_dirty(handle, xb_bh);
4341
up_write(&oi->ip_alloc_sem);
4346
static int cmp_xe_offset(const void *a, const void *b)
4348
const struct ocfs2_xattr_entry *l = a, *r = b;
4349
u32 l_name_offset = le16_to_cpu(l->xe_name_offset);
4350
u32 r_name_offset = le16_to_cpu(r->xe_name_offset);
4352
if (l_name_offset < r_name_offset)
4354
if (l_name_offset > r_name_offset)
4360
* defrag a xattr bucket if we find that the bucket has some
4361
* holes beteen name/value pairs.
4362
* We will move all the name/value pairs to the end of the bucket
4363
* so that we can spare some space for insertion.
4365
static int ocfs2_defrag_xattr_bucket(struct inode *inode,
4367
struct ocfs2_xattr_bucket *bucket)
4370
size_t end, offset, len;
4371
struct ocfs2_xattr_header *xh;
4372
char *entries, *buf, *bucket_buf = NULL;
4373
u64 blkno = bucket_blkno(bucket);
4375
size_t blocksize = inode->i_sb->s_blocksize;
4376
struct ocfs2_xattr_entry *xe;
4379
* In order to make the operation more efficient and generic,
4380
* we copy all the blocks into a contiguous memory and do the
4381
* defragment there, so if anything is error, we will not touch
4384
bucket_buf = kmalloc(OCFS2_XATTR_BUCKET_SIZE, GFP_NOFS);
4391
for (i = 0; i < bucket->bu_blocks; i++, buf += blocksize)
4392
memcpy(buf, bucket_block(bucket, i), blocksize);
4394
ret = ocfs2_xattr_bucket_journal_access(handle, bucket,
4395
OCFS2_JOURNAL_ACCESS_WRITE);
4401
xh = (struct ocfs2_xattr_header *)bucket_buf;
4402
entries = (char *)xh->xh_entries;
4403
xh_free_start = le16_to_cpu(xh->xh_free_start);
4405
trace_ocfs2_defrag_xattr_bucket(
4406
(unsigned long long)blkno, le16_to_cpu(xh->xh_count),
4407
xh_free_start, le16_to_cpu(xh->xh_name_value_len));
4410
* sort all the entries by their offset.
4411
* the largest will be the first, so that we can
4412
* move them to the end one by one.
4414
sort(entries, le16_to_cpu(xh->xh_count),
4415
sizeof(struct ocfs2_xattr_entry),
4416
cmp_xe_offset, swap_xe);
4418
/* Move all name/values to the end of the bucket. */
4419
xe = xh->xh_entries;
4420
end = OCFS2_XATTR_BUCKET_SIZE;
4421
for (i = 0; i < le16_to_cpu(xh->xh_count); i++, xe++) {
4422
offset = le16_to_cpu(xe->xe_name_offset);
4423
len = namevalue_size_xe(xe);
4426
* We must make sure that the name/value pair
4427
* exist in the same block. So adjust end to
4428
* the previous block end if needed.
4430
if (((end - len) / blocksize !=
4431
(end - 1) / blocksize))
4432
end = end - end % blocksize;
4434
if (end > offset + len) {
4435
memmove(bucket_buf + end - len,
4436
bucket_buf + offset, len);
4437
xe->xe_name_offset = cpu_to_le16(end - len);
4440
mlog_bug_on_msg(end < offset + len, "Defrag check failed for "
4441
"bucket %llu\n", (unsigned long long)blkno);
4446
mlog_bug_on_msg(xh_free_start > end, "Defrag check failed for "
4447
"bucket %llu\n", (unsigned long long)blkno);
4449
if (xh_free_start == end)
4452
memset(bucket_buf + xh_free_start, 0, end - xh_free_start);
4453
xh->xh_free_start = cpu_to_le16(end);
4455
/* sort the entries by their name_hash. */
4456
sort(entries, le16_to_cpu(xh->xh_count),
4457
sizeof(struct ocfs2_xattr_entry),
4461
for (i = 0; i < bucket->bu_blocks; i++, buf += blocksize)
4462
memcpy(bucket_block(bucket, i), buf, blocksize);
4463
ocfs2_xattr_bucket_journal_dirty(handle, bucket);
4471
* prev_blkno points to the start of an existing extent. new_blkno
4472
* points to a newly allocated extent. Because we know each of our
4473
* clusters contains more than bucket, we can easily split one cluster
4474
* at a bucket boundary. So we take the last cluster of the existing
4475
* extent and split it down the middle. We move the last half of the
4476
* buckets in the last cluster of the existing extent over to the new
4479
* first_bh is the buffer at prev_blkno so we can update the existing
4480
* extent's bucket count. header_bh is the bucket were we were hoping
4481
* to insert our xattr. If the bucket move places the target in the new
4482
* extent, we'll update first_bh and header_bh after modifying the old
4485
* first_hash will be set as the 1st xe's name_hash in the new extent.
4487
static int ocfs2_mv_xattr_bucket_cross_cluster(struct inode *inode,
4489
struct ocfs2_xattr_bucket *first,
4490
struct ocfs2_xattr_bucket *target,
4496
struct super_block *sb = inode->i_sb;
4497
int blks_per_bucket = ocfs2_blocks_per_xattr_bucket(sb);
4498
int num_buckets = ocfs2_xattr_buckets_per_cluster(OCFS2_SB(sb));
4499
int to_move = num_buckets / 2;
4501
u64 last_cluster_blkno = bucket_blkno(first) +
4502
((num_clusters - 1) * ocfs2_clusters_to_blocks(sb, 1));
4504
BUG_ON(le16_to_cpu(bucket_xh(first)->xh_num_buckets) < num_buckets);
4505
BUG_ON(OCFS2_XATTR_BUCKET_SIZE == OCFS2_SB(sb)->s_clustersize);
4507
trace_ocfs2_mv_xattr_bucket_cross_cluster(
4508
(unsigned long long)last_cluster_blkno,
4509
(unsigned long long)new_blkno);
4511
ret = ocfs2_mv_xattr_buckets(inode, handle, bucket_blkno(first),
4512
last_cluster_blkno, new_blkno,
4513
to_move, first_hash);
4519
/* This is the first bucket that got moved */
4520
src_blkno = last_cluster_blkno + (to_move * blks_per_bucket);
4523
* If the target bucket was part of the moved buckets, we need to
4524
* update first and target.
4526
if (bucket_blkno(target) >= src_blkno) {
4527
/* Find the block for the new target bucket */
4528
src_blkno = new_blkno +
4529
(bucket_blkno(target) - src_blkno);
4531
ocfs2_xattr_bucket_relse(first);
4532
ocfs2_xattr_bucket_relse(target);
4535
* These shouldn't fail - the buffers are in the
4536
* journal from ocfs2_cp_xattr_bucket().
4538
ret = ocfs2_read_xattr_bucket(first, new_blkno);
4543
ret = ocfs2_read_xattr_bucket(target, src_blkno);
4554
* Find the suitable pos when we divide a bucket into 2.
4555
* We have to make sure the xattrs with the same hash value exist
4556
* in the same bucket.
4558
* If this ocfs2_xattr_header covers more than one hash value, find a
4559
* place where the hash value changes. Try to find the most even split.
4560
* The most common case is that all entries have different hash values,
4561
* and the first check we make will find a place to split.
4563
static int ocfs2_xattr_find_divide_pos(struct ocfs2_xattr_header *xh)
4565
struct ocfs2_xattr_entry *entries = xh->xh_entries;
4566
int count = le16_to_cpu(xh->xh_count);
4567
int delta, middle = count / 2;
4570
* We start at the middle. Each step gets farther away in both
4571
* directions. We therefore hit the change in hash value
4572
* nearest to the middle. Note that this loop does not execute for
4575
for (delta = 0; delta < middle; delta++) {
4576
/* Let's check delta earlier than middle */
4577
if (cmp_xe(&entries[middle - delta - 1],
4578
&entries[middle - delta]))
4579
return middle - delta;
4581
/* For even counts, don't walk off the end */
4582
if ((middle + delta + 1) == count)
4585
/* Now try delta past middle */
4586
if (cmp_xe(&entries[middle + delta],
4587
&entries[middle + delta + 1]))
4588
return middle + delta + 1;
4591
/* Every entry had the same hash */
4596
* Move some xattrs in old bucket(blk) to new bucket(new_blk).
4597
* first_hash will record the 1st hash of the new bucket.
4599
* Normally half of the xattrs will be moved. But we have to make
4600
* sure that the xattrs with the same hash value are stored in the
4601
* same bucket. If all the xattrs in this bucket have the same hash
4602
* value, the new bucket will be initialized as an empty one and the
4603
* first_hash will be initialized as (hash_value+1).
4605
static int ocfs2_divide_xattr_bucket(struct inode *inode,
4610
int new_bucket_head)
4613
int count, start, len, name_value_len = 0, name_offset = 0;
4614
struct ocfs2_xattr_bucket *s_bucket = NULL, *t_bucket = NULL;
4615
struct ocfs2_xattr_header *xh;
4616
struct ocfs2_xattr_entry *xe;
4617
int blocksize = inode->i_sb->s_blocksize;
4619
trace_ocfs2_divide_xattr_bucket_begin((unsigned long long)blk,
4620
(unsigned long long)new_blk);
4622
s_bucket = ocfs2_xattr_bucket_new(inode);
4623
t_bucket = ocfs2_xattr_bucket_new(inode);
4624
if (!s_bucket || !t_bucket) {
4630
ret = ocfs2_read_xattr_bucket(s_bucket, blk);
4636
ret = ocfs2_xattr_bucket_journal_access(handle, s_bucket,
4637
OCFS2_JOURNAL_ACCESS_WRITE);
4644
* Even if !new_bucket_head, we're overwriting t_bucket. Thus,
4645
* there's no need to read it.
4647
ret = ocfs2_init_xattr_bucket(t_bucket, new_blk);
4654
* Hey, if we're overwriting t_bucket, what difference does
4655
* ACCESS_CREATE vs ACCESS_WRITE make? See the comment in the
4656
* same part of ocfs2_cp_xattr_bucket().
4658
ret = ocfs2_xattr_bucket_journal_access(handle, t_bucket,
4660
OCFS2_JOURNAL_ACCESS_CREATE :
4661
OCFS2_JOURNAL_ACCESS_WRITE);
4667
xh = bucket_xh(s_bucket);
4668
count = le16_to_cpu(xh->xh_count);
4669
start = ocfs2_xattr_find_divide_pos(xh);
4671
if (start == count) {
4672
xe = &xh->xh_entries[start-1];
4675
* initialized a new empty bucket here.
4676
* The hash value is set as one larger than
4677
* that of the last entry in the previous bucket.
4679
for (i = 0; i < t_bucket->bu_blocks; i++)
4680
memset(bucket_block(t_bucket, i), 0, blocksize);
4682
xh = bucket_xh(t_bucket);
4683
xh->xh_free_start = cpu_to_le16(blocksize);
4684
xh->xh_entries[0].xe_name_hash = xe->xe_name_hash;
4685
le32_add_cpu(&xh->xh_entries[0].xe_name_hash, 1);
4687
goto set_num_buckets;
4690
/* copy the whole bucket to the new first. */
4691
ocfs2_xattr_bucket_copy_data(t_bucket, s_bucket);
4693
/* update the new bucket. */
4694
xh = bucket_xh(t_bucket);
4697
* Calculate the total name/value len and xh_free_start for
4698
* the old bucket first.
4700
name_offset = OCFS2_XATTR_BUCKET_SIZE;
4702
for (i = 0; i < start; i++) {
4703
xe = &xh->xh_entries[i];
4704
name_value_len += namevalue_size_xe(xe);
4705
if (le16_to_cpu(xe->xe_name_offset) < name_offset)
4706
name_offset = le16_to_cpu(xe->xe_name_offset);
4710
* Now begin the modification to the new bucket.
4712
* In the new bucket, We just move the xattr entry to the beginning
4713
* and don't touch the name/value. So there will be some holes in the
4714
* bucket, and they will be removed when ocfs2_defrag_xattr_bucket is
4717
xe = &xh->xh_entries[start];
4718
len = sizeof(struct ocfs2_xattr_entry) * (count - start);
4719
trace_ocfs2_divide_xattr_bucket_move(len,
4720
(int)((char *)xe - (char *)xh),
4721
(int)((char *)xh->xh_entries - (char *)xh));
4722
memmove((char *)xh->xh_entries, (char *)xe, len);
4723
xe = &xh->xh_entries[count - start];
4724
len = sizeof(struct ocfs2_xattr_entry) * start;
4725
memset((char *)xe, 0, len);
4727
le16_add_cpu(&xh->xh_count, -start);
4728
le16_add_cpu(&xh->xh_name_value_len, -name_value_len);
4730
/* Calculate xh_free_start for the new bucket. */
4731
xh->xh_free_start = cpu_to_le16(OCFS2_XATTR_BUCKET_SIZE);
4732
for (i = 0; i < le16_to_cpu(xh->xh_count); i++) {
4733
xe = &xh->xh_entries[i];
4734
if (le16_to_cpu(xe->xe_name_offset) <
4735
le16_to_cpu(xh->xh_free_start))
4736
xh->xh_free_start = xe->xe_name_offset;
4740
/* set xh->xh_num_buckets for the new xh. */
4741
if (new_bucket_head)
4742
xh->xh_num_buckets = cpu_to_le16(1);
4744
xh->xh_num_buckets = 0;
4746
ocfs2_xattr_bucket_journal_dirty(handle, t_bucket);
4748
/* store the first_hash of the new bucket. */
4750
*first_hash = le32_to_cpu(xh->xh_entries[0].xe_name_hash);
4753
* Now only update the 1st block of the old bucket. If we
4754
* just added a new empty bucket, there is no need to modify
4760
xh = bucket_xh(s_bucket);
4761
memset(&xh->xh_entries[start], 0,
4762
sizeof(struct ocfs2_xattr_entry) * (count - start));
4763
xh->xh_count = cpu_to_le16(start);
4764
xh->xh_free_start = cpu_to_le16(name_offset);
4765
xh->xh_name_value_len = cpu_to_le16(name_value_len);
4767
ocfs2_xattr_bucket_journal_dirty(handle, s_bucket);
4770
ocfs2_xattr_bucket_free(s_bucket);
4771
ocfs2_xattr_bucket_free(t_bucket);
4777
* Copy xattr from one bucket to another bucket.
4779
* The caller must make sure that the journal transaction
4780
* has enough space for journaling.
4782
static int ocfs2_cp_xattr_bucket(struct inode *inode,
4789
struct ocfs2_xattr_bucket *s_bucket = NULL, *t_bucket = NULL;
4791
BUG_ON(s_blkno == t_blkno);
4793
trace_ocfs2_cp_xattr_bucket((unsigned long long)s_blkno,
4794
(unsigned long long)t_blkno,
4797
s_bucket = ocfs2_xattr_bucket_new(inode);
4798
t_bucket = ocfs2_xattr_bucket_new(inode);
4799
if (!s_bucket || !t_bucket) {
4805
ret = ocfs2_read_xattr_bucket(s_bucket, s_blkno);
4810
* Even if !t_is_new, we're overwriting t_bucket. Thus,
4811
* there's no need to read it.
4813
ret = ocfs2_init_xattr_bucket(t_bucket, t_blkno);
4818
* Hey, if we're overwriting t_bucket, what difference does
4819
* ACCESS_CREATE vs ACCESS_WRITE make? Well, if we allocated a new
4820
* cluster to fill, we came here from
4821
* ocfs2_mv_xattr_buckets(), and it is really new -
4822
* ACCESS_CREATE is required. But we also might have moved data
4823
* out of t_bucket before extending back into it.
4824
* ocfs2_add_new_xattr_bucket() can do this - its call to
4825
* ocfs2_add_new_xattr_cluster() may have created a new extent
4826
* and copied out the end of the old extent. Then it re-extends
4827
* the old extent back to create space for new xattrs. That's
4828
* how we get here, and the bucket isn't really new.
4830
ret = ocfs2_xattr_bucket_journal_access(handle, t_bucket,
4832
OCFS2_JOURNAL_ACCESS_CREATE :
4833
OCFS2_JOURNAL_ACCESS_WRITE);
4837
ocfs2_xattr_bucket_copy_data(t_bucket, s_bucket);
4838
ocfs2_xattr_bucket_journal_dirty(handle, t_bucket);
4841
ocfs2_xattr_bucket_free(t_bucket);
4842
ocfs2_xattr_bucket_free(s_bucket);
4848
* src_blk points to the start of an existing extent. last_blk points to
4849
* last cluster in that extent. to_blk points to a newly allocated
4850
* extent. We copy the buckets from the cluster at last_blk to the new
4851
* extent. If start_bucket is non-zero, we skip that many buckets before
4852
* we start copying. The new extent's xh_num_buckets gets set to the
4853
* number of buckets we copied. The old extent's xh_num_buckets shrinks
4854
* by the same amount.
4856
static int ocfs2_mv_xattr_buckets(struct inode *inode, handle_t *handle,
4857
u64 src_blk, u64 last_blk, u64 to_blk,
4858
unsigned int start_bucket,
4861
int i, ret, credits;
4862
struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
4863
int blks_per_bucket = ocfs2_blocks_per_xattr_bucket(inode->i_sb);
4864
int num_buckets = ocfs2_xattr_buckets_per_cluster(osb);
4865
struct ocfs2_xattr_bucket *old_first, *new_first;
4867
trace_ocfs2_mv_xattr_buckets((unsigned long long)last_blk,
4868
(unsigned long long)to_blk);
4870
BUG_ON(start_bucket >= num_buckets);
4872
num_buckets -= start_bucket;
4873
last_blk += (start_bucket * blks_per_bucket);
4876
/* The first bucket of the original extent */
4877
old_first = ocfs2_xattr_bucket_new(inode);
4878
/* The first bucket of the new extent */
4879
new_first = ocfs2_xattr_bucket_new(inode);
4880
if (!old_first || !new_first) {
4886
ret = ocfs2_read_xattr_bucket(old_first, src_blk);
4893
* We need to update the first bucket of the old extent and all
4894
* the buckets going to the new extent.
4896
credits = ((num_buckets + 1) * blks_per_bucket);
4897
ret = ocfs2_extend_trans(handle, credits);
4903
ret = ocfs2_xattr_bucket_journal_access(handle, old_first,
4904
OCFS2_JOURNAL_ACCESS_WRITE);
4910
for (i = 0; i < num_buckets; i++) {
4911
ret = ocfs2_cp_xattr_bucket(inode, handle,
4912
last_blk + (i * blks_per_bucket),
4913
to_blk + (i * blks_per_bucket),
4922
* Get the new bucket ready before we dirty anything
4923
* (This actually shouldn't fail, because we already dirtied
4924
* it once in ocfs2_cp_xattr_bucket()).
4926
ret = ocfs2_read_xattr_bucket(new_first, to_blk);
4931
ret = ocfs2_xattr_bucket_journal_access(handle, new_first,
4932
OCFS2_JOURNAL_ACCESS_WRITE);
4938
/* Now update the headers */
4939
le16_add_cpu(&bucket_xh(old_first)->xh_num_buckets, -num_buckets);
4940
ocfs2_xattr_bucket_journal_dirty(handle, old_first);
4942
bucket_xh(new_first)->xh_num_buckets = cpu_to_le16(num_buckets);
4943
ocfs2_xattr_bucket_journal_dirty(handle, new_first);
4946
*first_hash = le32_to_cpu(bucket_xh(new_first)->xh_entries[0].xe_name_hash);
4949
ocfs2_xattr_bucket_free(new_first);
4950
ocfs2_xattr_bucket_free(old_first);
4955
* Move some xattrs in this cluster to the new cluster.
4956
* This function should only be called when bucket size == cluster size.
4957
* Otherwise ocfs2_mv_xattr_bucket_cross_cluster should be used instead.
4959
static int ocfs2_divide_xattr_cluster(struct inode *inode,
4965
u16 blk_per_bucket = ocfs2_blocks_per_xattr_bucket(inode->i_sb);
4966
int ret, credits = 2 * blk_per_bucket;
4968
BUG_ON(OCFS2_XATTR_BUCKET_SIZE < OCFS2_SB(inode->i_sb)->s_clustersize);
4970
ret = ocfs2_extend_trans(handle, credits);
4976
/* Move half of the xattr in start_blk to the next bucket. */
4977
return ocfs2_divide_xattr_bucket(inode, handle, prev_blk,
4978
new_blk, first_hash, 1);
4982
* Move some xattrs from the old cluster to the new one since they are not
4983
* contiguous in ocfs2 xattr tree.
4985
* new_blk starts a new separate cluster, and we will move some xattrs from
4986
* prev_blk to it. v_start will be set as the first name hash value in this
4987
* new cluster so that it can be used as e_cpos during tree insertion and
4988
* don't collide with our original b-tree operations. first_bh and header_bh
4989
* will also be updated since they will be used in ocfs2_extend_xattr_bucket
4990
* to extend the insert bucket.
4992
* The problem is how much xattr should we move to the new one and when should
4993
* we update first_bh and header_bh?
4994
* 1. If cluster size > bucket size, that means the previous cluster has more
4995
* than 1 bucket, so just move half nums of bucket into the new cluster and
4996
* update the first_bh and header_bh if the insert bucket has been moved
4997
* to the new cluster.
4998
* 2. If cluster_size == bucket_size:
4999
* a) If the previous extent rec has more than one cluster and the insert
5000
* place isn't in the last cluster, copy the entire last cluster to the
5001
* new one. This time, we don't need to upate the first_bh and header_bh
5002
* since they will not be moved into the new cluster.
5003
* b) Otherwise, move the bottom half of the xattrs in the last cluster into
5004
* the new one. And we set the extend flag to zero if the insert place is
5005
* moved into the new allocated cluster since no extend is needed.
5007
static int ocfs2_adjust_xattr_cross_cluster(struct inode *inode,
5009
struct ocfs2_xattr_bucket *first,
5010
struct ocfs2_xattr_bucket *target,
5018
trace_ocfs2_adjust_xattr_cross_cluster(
5019
(unsigned long long)bucket_blkno(first),
5020
(unsigned long long)new_blk, prev_clusters);
5022
if (ocfs2_xattr_buckets_per_cluster(OCFS2_SB(inode->i_sb)) > 1) {
5023
ret = ocfs2_mv_xattr_bucket_cross_cluster(inode,
5032
/* The start of the last cluster in the first extent */
5033
u64 last_blk = bucket_blkno(first) +
5034
((prev_clusters - 1) *
5035
ocfs2_clusters_to_blocks(inode->i_sb, 1));
5037
if (prev_clusters > 1 && bucket_blkno(target) != last_blk) {
5038
ret = ocfs2_mv_xattr_buckets(inode, handle,
5039
bucket_blkno(first),
5040
last_blk, new_blk, 0,
5045
ret = ocfs2_divide_xattr_cluster(inode, handle,
5051
if ((bucket_blkno(target) == last_blk) && extend)
5060
* Add a new cluster for xattr storage.
5062
* If the new cluster is contiguous with the previous one, it will be
5063
* appended to the same extent record, and num_clusters will be updated.
5064
* If not, we will insert a new extent for it and move some xattrs in
5065
* the last cluster into the new allocated one.
5066
* We also need to limit the maximum size of a btree leaf, otherwise we'll
5067
* lose the benefits of hashing because we'll have to search large leaves.
5068
* So now the maximum size is OCFS2_MAX_XATTR_TREE_LEAF_SIZE(or clustersize,
5071
* first_bh is the first block of the previous extent rec and header_bh
5072
* indicates the bucket we will insert the new xattrs. They will be updated
5073
* when the header_bh is moved into the new cluster.
5075
static int ocfs2_add_new_xattr_cluster(struct inode *inode,
5076
struct buffer_head *root_bh,
5077
struct ocfs2_xattr_bucket *first,
5078
struct ocfs2_xattr_bucket *target,
5082
struct ocfs2_xattr_set_ctxt *ctxt)
5085
u16 bpc = ocfs2_clusters_to_blocks(inode->i_sb, 1);
5086
u32 prev_clusters = *num_clusters;
5087
u32 clusters_to_add = 1, bit_off, num_bits, v_start = 0;
5089
handle_t *handle = ctxt->handle;
5090
struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
5091
struct ocfs2_extent_tree et;
5093
trace_ocfs2_add_new_xattr_cluster_begin(
5094
(unsigned long long)OCFS2_I(inode)->ip_blkno,
5095
(unsigned long long)bucket_blkno(first),
5096
prev_cpos, prev_clusters);
5098
ocfs2_init_xattr_tree_extent_tree(&et, INODE_CACHE(inode), root_bh);
5100
ret = ocfs2_journal_access_xb(handle, INODE_CACHE(inode), root_bh,
5101
OCFS2_JOURNAL_ACCESS_WRITE);
5107
ret = __ocfs2_claim_clusters(handle, ctxt->data_ac, 1,
5108
clusters_to_add, &bit_off, &num_bits);
5115
BUG_ON(num_bits > clusters_to_add);
5117
block = ocfs2_clusters_to_blocks(osb->sb, bit_off);
5118
trace_ocfs2_add_new_xattr_cluster((unsigned long long)block, num_bits);
5120
if (bucket_blkno(first) + (prev_clusters * bpc) == block &&
5121
(prev_clusters + num_bits) << osb->s_clustersize_bits <=
5122
OCFS2_MAX_XATTR_TREE_LEAF_SIZE) {
5124
* If this cluster is contiguous with the old one and
5125
* adding this new cluster, we don't surpass the limit of
5126
* OCFS2_MAX_XATTR_TREE_LEAF_SIZE, cool. We will let it be
5127
* initialized and used like other buckets in the previous
5129
* So add it as a contiguous one. The caller will handle
5132
v_start = prev_cpos + prev_clusters;
5133
*num_clusters = prev_clusters + num_bits;
5135
ret = ocfs2_adjust_xattr_cross_cluster(inode,
5149
trace_ocfs2_add_new_xattr_cluster_insert((unsigned long long)block,
5151
ret = ocfs2_insert_extent(handle, &et, v_start, block,
5152
num_bits, 0, ctxt->meta_ac);
5158
ocfs2_journal_dirty(handle, root_bh);
5165
* We are given an extent. 'first' is the bucket at the very front of
5166
* the extent. The extent has space for an additional bucket past
5167
* bucket_xh(first)->xh_num_buckets. 'target_blkno' is the block number
5168
* of the target bucket. We wish to shift every bucket past the target
5169
* down one, filling in that additional space. When we get back to the
5170
* target, we split the target between itself and the now-empty bucket
5171
* at target+1 (aka, target_blkno + blks_per_bucket).
5173
static int ocfs2_extend_xattr_bucket(struct inode *inode,
5175
struct ocfs2_xattr_bucket *first,
5180
struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
5181
u16 blk_per_bucket = ocfs2_blocks_per_xattr_bucket(inode->i_sb);
5183
u16 new_bucket = le16_to_cpu(bucket_xh(first)->xh_num_buckets);
5185
trace_ocfs2_extend_xattr_bucket((unsigned long long)target_blk,
5186
(unsigned long long)bucket_blkno(first),
5187
num_clusters, new_bucket);
5189
/* The extent must have room for an additional bucket */
5190
BUG_ON(new_bucket >=
5191
(num_clusters * ocfs2_xattr_buckets_per_cluster(osb)));
5193
/* end_blk points to the last existing bucket */
5194
end_blk = bucket_blkno(first) + ((new_bucket - 1) * blk_per_bucket);
5197
* end_blk is the start of the last existing bucket.
5198
* Thus, (end_blk - target_blk) covers the target bucket and
5199
* every bucket after it up to, but not including, the last
5200
* existing bucket. Then we add the last existing bucket, the
5201
* new bucket, and the first bucket (3 * blk_per_bucket).
5203
credits = (end_blk - target_blk) + (3 * blk_per_bucket);
5204
ret = ocfs2_extend_trans(handle, credits);
5210
ret = ocfs2_xattr_bucket_journal_access(handle, first,
5211
OCFS2_JOURNAL_ACCESS_WRITE);
5217
while (end_blk != target_blk) {
5218
ret = ocfs2_cp_xattr_bucket(inode, handle, end_blk,
5219
end_blk + blk_per_bucket, 0);
5222
end_blk -= blk_per_bucket;
5225
/* Move half of the xattr in target_blkno to the next bucket. */
5226
ret = ocfs2_divide_xattr_bucket(inode, handle, target_blk,
5227
target_blk + blk_per_bucket, NULL, 0);
5229
le16_add_cpu(&bucket_xh(first)->xh_num_buckets, 1);
5230
ocfs2_xattr_bucket_journal_dirty(handle, first);
5237
* Add new xattr bucket in an extent record and adjust the buckets
5238
* accordingly. xb_bh is the ocfs2_xattr_block, and target is the
5239
* bucket we want to insert into.
5241
* In the easy case, we will move all the buckets after target down by
5242
* one. Half of target's xattrs will be moved to the next bucket.
5244
* If current cluster is full, we'll allocate a new one. This may not
5245
* be contiguous. The underlying calls will make sure that there is
5246
* space for the insert, shifting buckets around if necessary.
5247
* 'target' may be moved by those calls.
5249
static int ocfs2_add_new_xattr_bucket(struct inode *inode,
5250
struct buffer_head *xb_bh,
5251
struct ocfs2_xattr_bucket *target,
5252
struct ocfs2_xattr_set_ctxt *ctxt)
5254
struct ocfs2_xattr_block *xb =
5255
(struct ocfs2_xattr_block *)xb_bh->b_data;
5256
struct ocfs2_xattr_tree_root *xb_root = &xb->xb_attrs.xb_root;
5257
struct ocfs2_extent_list *el = &xb_root->xt_list;
5259
le32_to_cpu(bucket_xh(target)->xh_entries[0].xe_name_hash);
5260
struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
5261
int ret, num_buckets, extend = 1;
5263
u32 e_cpos, num_clusters;
5264
/* The bucket at the front of the extent */
5265
struct ocfs2_xattr_bucket *first;
5267
trace_ocfs2_add_new_xattr_bucket(
5268
(unsigned long long)bucket_blkno(target));
5270
/* The first bucket of the original extent */
5271
first = ocfs2_xattr_bucket_new(inode);
5278
ret = ocfs2_xattr_get_rec(inode, name_hash, &p_blkno, &e_cpos,
5285
ret = ocfs2_read_xattr_bucket(first, p_blkno);
5291
num_buckets = ocfs2_xattr_buckets_per_cluster(osb) * num_clusters;
5292
if (num_buckets == le16_to_cpu(bucket_xh(first)->xh_num_buckets)) {
5294
* This can move first+target if the target bucket moves
5295
* to the new extent.
5297
ret = ocfs2_add_new_xattr_cluster(inode,
5312
ret = ocfs2_extend_xattr_bucket(inode,
5315
bucket_blkno(target),
5322
ocfs2_xattr_bucket_free(first);
5327
static inline char *ocfs2_xattr_bucket_get_val(struct inode *inode,
5328
struct ocfs2_xattr_bucket *bucket,
5331
int block_off = offs >> inode->i_sb->s_blocksize_bits;
5333
offs = offs % inode->i_sb->s_blocksize;
5334
return bucket_block(bucket, block_off) + offs;
5338
* Truncate the specified xe_off entry in xattr bucket.
5339
* bucket is indicated by header_bh and len is the new length.
5340
* Both the ocfs2_xattr_value_root and the entry will be updated here.
5342
* Copy the new updated xe and xe_value_root to new_xe and new_xv if needed.
5344
static int ocfs2_xattr_bucket_value_truncate(struct inode *inode,
5345
struct ocfs2_xattr_bucket *bucket,
5348
struct ocfs2_xattr_set_ctxt *ctxt)
5352
struct ocfs2_xattr_entry *xe;
5353
struct ocfs2_xattr_header *xh = bucket_xh(bucket);
5354
size_t blocksize = inode->i_sb->s_blocksize;
5355
struct ocfs2_xattr_value_buf vb = {
5356
.vb_access = ocfs2_journal_access,
5359
xe = &xh->xh_entries[xe_off];
5361
BUG_ON(!xe || ocfs2_xattr_is_local(xe));
5363
offset = le16_to_cpu(xe->xe_name_offset) +
5364
OCFS2_XATTR_SIZE(xe->xe_name_len);
5366
value_blk = offset / blocksize;
5368
/* We don't allow ocfs2_xattr_value to be stored in different block. */
5369
BUG_ON(value_blk != (offset + OCFS2_XATTR_ROOT_SIZE - 1) / blocksize);
5371
vb.vb_bh = bucket->bu_bhs[value_blk];
5374
vb.vb_xv = (struct ocfs2_xattr_value_root *)
5375
(vb.vb_bh->b_data + offset % blocksize);
5378
* From here on out we have to dirty the bucket. The generic
5379
* value calls only modify one of the bucket's bhs, but we need
5380
* to send the bucket at once. So if they error, they *could* have
5381
* modified something. We have to assume they did, and dirty
5382
* the whole bucket. This leaves us in a consistent state.
5384
trace_ocfs2_xattr_bucket_value_truncate(
5385
(unsigned long long)bucket_blkno(bucket), xe_off, len);
5386
ret = ocfs2_xattr_value_truncate(inode, &vb, len, ctxt);
5392
ret = ocfs2_xattr_bucket_journal_access(ctxt->handle, bucket,
5393
OCFS2_JOURNAL_ACCESS_WRITE);
5399
xe->xe_value_size = cpu_to_le64(len);
5401
ocfs2_xattr_bucket_journal_dirty(ctxt->handle, bucket);
5407
static int ocfs2_rm_xattr_cluster(struct inode *inode,
5408
struct buffer_head *root_bh,
5415
struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
5416
struct inode *tl_inode = osb->osb_tl_inode;
5418
struct ocfs2_xattr_block *xb =
5419
(struct ocfs2_xattr_block *)root_bh->b_data;
5420
struct ocfs2_alloc_context *meta_ac = NULL;
5421
struct ocfs2_cached_dealloc_ctxt dealloc;
5422
struct ocfs2_extent_tree et;
5424
ret = ocfs2_iterate_xattr_buckets(inode, blkno, len,
5425
ocfs2_delete_xattr_in_bucket, para);
5431
ocfs2_init_xattr_tree_extent_tree(&et, INODE_CACHE(inode), root_bh);
5433
ocfs2_init_dealloc_ctxt(&dealloc);
5435
trace_ocfs2_rm_xattr_cluster(
5436
(unsigned long long)OCFS2_I(inode)->ip_blkno,
5437
(unsigned long long)blkno, cpos, len);
5439
ocfs2_remove_xattr_clusters_from_cache(INODE_CACHE(inode), blkno,
5442
ret = ocfs2_lock_allocators(inode, &et, 0, 1, NULL, &meta_ac);
5448
mutex_lock(&tl_inode->i_mutex);
5450
if (ocfs2_truncate_log_needs_flush(osb)) {
5451
ret = __ocfs2_flush_truncate_log(osb);
5458
handle = ocfs2_start_trans(osb, ocfs2_remove_extent_credits(osb->sb));
5459
if (IS_ERR(handle)) {
5465
ret = ocfs2_journal_access_xb(handle, INODE_CACHE(inode), root_bh,
5466
OCFS2_JOURNAL_ACCESS_WRITE);
5472
ret = ocfs2_remove_extent(handle, &et, cpos, len, meta_ac,
5479
le32_add_cpu(&xb->xb_attrs.xb_root.xt_clusters, -len);
5480
ocfs2_journal_dirty(handle, root_bh);
5482
ret = ocfs2_truncate_log_append(osb, handle, blkno, len);
5487
ocfs2_commit_trans(osb, handle);
5489
ocfs2_schedule_truncate_log_flush(osb, 1);
5491
mutex_unlock(&tl_inode->i_mutex);
5494
ocfs2_free_alloc_context(meta_ac);
5496
ocfs2_run_deallocs(osb, &dealloc);
5502
* check whether the xattr bucket is filled up with the same hash value.
5503
* If we want to insert the xattr with the same hash, return -ENOSPC.
5504
* If we want to insert a xattr with different hash value, go ahead
5505
* and ocfs2_divide_xattr_bucket will handle this.
5507
static int ocfs2_check_xattr_bucket_collision(struct inode *inode,
5508
struct ocfs2_xattr_bucket *bucket,
5511
struct ocfs2_xattr_header *xh = bucket_xh(bucket);
5512
u32 name_hash = ocfs2_xattr_name_hash(inode, name, strlen(name));
5514
if (name_hash != le32_to_cpu(xh->xh_entries[0].xe_name_hash))
5517
if (xh->xh_entries[le16_to_cpu(xh->xh_count) - 1].xe_name_hash ==
5518
xh->xh_entries[0].xe_name_hash) {
5519
mlog(ML_ERROR, "Too much hash collision in xattr bucket %llu, "
5521
(unsigned long long)bucket_blkno(bucket),
5522
le32_to_cpu(xh->xh_entries[0].xe_name_hash));
5530
* Try to set the entry in the current bucket. If we fail, the caller
5531
* will handle getting us another bucket.
5533
static int ocfs2_xattr_set_entry_bucket(struct inode *inode,
5534
struct ocfs2_xattr_info *xi,
5535
struct ocfs2_xattr_search *xs,
5536
struct ocfs2_xattr_set_ctxt *ctxt)
5539
struct ocfs2_xa_loc loc;
5541
trace_ocfs2_xattr_set_entry_bucket(xi->xi_name);
5543
ocfs2_init_xattr_bucket_xa_loc(&loc, xs->bucket,
5544
xs->not_found ? NULL : xs->here);
5545
ret = ocfs2_xa_set(&loc, xi, ctxt);
5547
xs->here = loc.xl_entry;
5550
if (ret != -ENOSPC) {
5555
/* Ok, we need space. Let's try defragmenting the bucket. */
5556
ret = ocfs2_defrag_xattr_bucket(inode, ctxt->handle,
5563
ret = ocfs2_xa_set(&loc, xi, ctxt);
5565
xs->here = loc.xl_entry;
5576
static int ocfs2_xattr_set_entry_index_block(struct inode *inode,
5577
struct ocfs2_xattr_info *xi,
5578
struct ocfs2_xattr_search *xs,
5579
struct ocfs2_xattr_set_ctxt *ctxt)
5583
trace_ocfs2_xattr_set_entry_index_block(xi->xi_name);
5585
ret = ocfs2_xattr_set_entry_bucket(inode, xi, xs, ctxt);
5588
if (ret != -ENOSPC) {
5593
/* Ack, need more space. Let's try to get another bucket! */
5596
* We do not allow for overlapping ranges between buckets. And
5597
* the maximum number of collisions we will allow for then is
5598
* one bucket's worth, so check it here whether we need to
5599
* add a new bucket for the insert.
5601
ret = ocfs2_check_xattr_bucket_collision(inode,
5609
ret = ocfs2_add_new_xattr_bucket(inode,
5619
* ocfs2_add_new_xattr_bucket() will have updated
5620
* xs->bucket if it moved, but it will not have updated
5621
* any of the other search fields. Thus, we drop it and
5622
* re-search. Everything should be cached, so it'll be
5625
ocfs2_xattr_bucket_relse(xs->bucket);
5626
ret = ocfs2_xattr_index_block_find(inode, xs->xattr_bh,
5629
if (ret && ret != -ENODATA)
5631
xs->not_found = ret;
5633
/* Ok, we have a new bucket, let's try again */
5634
ret = ocfs2_xattr_set_entry_bucket(inode, xi, xs, ctxt);
5635
if (ret && (ret != -ENOSPC))
5642
static int ocfs2_delete_xattr_in_bucket(struct inode *inode,
5643
struct ocfs2_xattr_bucket *bucket,
5646
int ret = 0, ref_credits;
5647
struct ocfs2_xattr_header *xh = bucket_xh(bucket);
5649
struct ocfs2_xattr_entry *xe;
5650
struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
5651
struct ocfs2_xattr_set_ctxt ctxt = {NULL, NULL,};
5652
int credits = ocfs2_remove_extent_credits(osb->sb) +
5653
ocfs2_blocks_per_xattr_bucket(inode->i_sb);
5654
struct ocfs2_xattr_value_root *xv;
5655
struct ocfs2_rm_xattr_bucket_para *args =
5656
(struct ocfs2_rm_xattr_bucket_para *)para;
5658
ocfs2_init_dealloc_ctxt(&ctxt.dealloc);
5660
for (i = 0; i < le16_to_cpu(xh->xh_count); i++) {
5661
xe = &xh->xh_entries[i];
5662
if (ocfs2_xattr_is_local(xe))
5665
ret = ocfs2_get_xattr_tree_value_root(inode->i_sb, bucket,
5668
ret = ocfs2_lock_xattr_remove_allocators(inode, xv,
5674
ctxt.handle = ocfs2_start_trans(osb, credits + ref_credits);
5675
if (IS_ERR(ctxt.handle)) {
5676
ret = PTR_ERR(ctxt.handle);
5681
ret = ocfs2_xattr_bucket_value_truncate(inode, bucket,
5684
ocfs2_commit_trans(osb, ctxt.handle);
5686
ocfs2_free_alloc_context(ctxt.meta_ac);
5687
ctxt.meta_ac = NULL;
5696
ocfs2_free_alloc_context(ctxt.meta_ac);
5697
ocfs2_schedule_truncate_log_flush(osb, 1);
5698
ocfs2_run_deallocs(osb, &ctxt.dealloc);
5703
* Whenever we modify a xattr value root in the bucket(e.g, CoW
5704
* or change the extent record flag), we need to recalculate
5705
* the metaecc for the whole bucket. So it is done here.
5708
* We have to give the extra credits for the caller.
5710
static int ocfs2_xattr_bucket_post_refcount(struct inode *inode,
5715
struct ocfs2_xattr_bucket *bucket =
5716
(struct ocfs2_xattr_bucket *)para;
5718
ret = ocfs2_xattr_bucket_journal_access(handle, bucket,
5719
OCFS2_JOURNAL_ACCESS_WRITE);
5725
ocfs2_xattr_bucket_journal_dirty(handle, bucket);
5731
* Special action we need if the xattr value is refcounted.
5733
* 1. If the xattr is refcounted, lock the tree.
5734
* 2. CoW the xattr if we are setting the new value and the value
5735
* will be stored outside.
5736
* 3. In other case, decrease_refcount will work for us, so just
5737
* lock the refcount tree, calculate the meta and credits is OK.
5739
* We have to do CoW before ocfs2_init_xattr_set_ctxt since
5740
* currently CoW is a completed transaction, while this function
5741
* will also lock the allocators and let us deadlock. So we will
5742
* CoW the whole xattr value.
5744
static int ocfs2_prepare_refcount_xattr(struct inode *inode,
5745
struct ocfs2_dinode *di,
5746
struct ocfs2_xattr_info *xi,
5747
struct ocfs2_xattr_search *xis,
5748
struct ocfs2_xattr_search *xbs,
5749
struct ocfs2_refcount_tree **ref_tree,
5754
struct ocfs2_xattr_block *xb;
5755
struct ocfs2_xattr_entry *xe;
5757
u32 p_cluster, num_clusters;
5758
unsigned int ext_flags;
5759
int name_offset, name_len;
5760
struct ocfs2_xattr_value_buf vb;
5761
struct ocfs2_xattr_bucket *bucket = NULL;
5762
struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
5763
struct ocfs2_post_refcount refcount;
5764
struct ocfs2_post_refcount *p = NULL;
5765
struct buffer_head *ref_root_bh = NULL;
5767
if (!xis->not_found) {
5769
name_offset = le16_to_cpu(xe->xe_name_offset);
5770
name_len = OCFS2_XATTR_SIZE(xe->xe_name_len);
5772
vb.vb_bh = xis->inode_bh;
5773
vb.vb_access = ocfs2_journal_access_di;
5775
int i, block_off = 0;
5776
xb = (struct ocfs2_xattr_block *)xbs->xattr_bh->b_data;
5778
name_offset = le16_to_cpu(xe->xe_name_offset);
5779
name_len = OCFS2_XATTR_SIZE(xe->xe_name_len);
5780
i = xbs->here - xbs->header->xh_entries;
5782
if (le16_to_cpu(xb->xb_flags) & OCFS2_XATTR_INDEXED) {
5783
ret = ocfs2_xattr_bucket_get_name_value(inode->i_sb,
5784
bucket_xh(xbs->bucket),
5791
base = bucket_block(xbs->bucket, block_off);
5792
vb.vb_bh = xbs->bucket->bu_bhs[block_off];
5793
vb.vb_access = ocfs2_journal_access;
5795
if (ocfs2_meta_ecc(osb)) {
5796
/*create parameters for ocfs2_post_refcount. */
5797
bucket = xbs->bucket;
5798
refcount.credits = bucket->bu_blocks;
5799
refcount.para = bucket;
5801
ocfs2_xattr_bucket_post_refcount;
5806
vb.vb_bh = xbs->xattr_bh;
5807
vb.vb_access = ocfs2_journal_access_xb;
5811
if (ocfs2_xattr_is_local(xe))
5814
vb.vb_xv = (struct ocfs2_xattr_value_root *)
5815
(base + name_offset + name_len);
5817
ret = ocfs2_xattr_get_clusters(inode, 0, &p_cluster,
5818
&num_clusters, &vb.vb_xv->xr_list,
5826
* We just need to check the 1st extent record, since we always
5827
* CoW the whole xattr. So there shouldn't be a xattr with
5828
* some REFCOUNT extent recs after the 1st one.
5830
if (!(ext_flags & OCFS2_EXT_REFCOUNTED))
5833
ret = ocfs2_lock_refcount_tree(osb, le64_to_cpu(di->i_refcount_loc),
5834
1, ref_tree, &ref_root_bh);
5841
* If we are deleting the xattr or the new size will be stored inside,
5842
* cool, leave it there, the xattr truncate process will remove them
5843
* for us(it still needs the refcount tree lock and the meta, credits).
5844
* And the worse case is that every cluster truncate will split the
5845
* refcount tree, and make the original extent become 3. So we will need
5846
* 2 * cluster more extent recs at most.
5848
if (!xi->xi_value || xi->xi_value_len <= OCFS2_XATTR_INLINE_SIZE) {
5850
ret = ocfs2_refcounted_xattr_delete_need(inode,
5851
&(*ref_tree)->rf_ci,
5852
ref_root_bh, vb.vb_xv,
5859
ret = ocfs2_refcount_cow_xattr(inode, di, &vb,
5860
*ref_tree, ref_root_bh, 0,
5861
le32_to_cpu(vb.vb_xv->xr_clusters), p);
5866
brelse(ref_root_bh);
5871
* Add the REFCOUNTED flags for all the extent rec in ocfs2_xattr_value_root.
5872
* The physical clusters will be added to refcount tree.
5874
static int ocfs2_xattr_value_attach_refcount(struct inode *inode,
5875
struct ocfs2_xattr_value_root *xv,
5876
struct ocfs2_extent_tree *value_et,
5877
struct ocfs2_caching_info *ref_ci,
5878
struct buffer_head *ref_root_bh,
5879
struct ocfs2_cached_dealloc_ctxt *dealloc,
5880
struct ocfs2_post_refcount *refcount)
5883
u32 clusters = le32_to_cpu(xv->xr_clusters);
5884
u32 cpos, p_cluster, num_clusters;
5885
struct ocfs2_extent_list *el = &xv->xr_list;
5886
unsigned int ext_flags;
5889
while (cpos < clusters) {
5890
ret = ocfs2_xattr_get_clusters(inode, cpos, &p_cluster,
5891
&num_clusters, el, &ext_flags);
5893
cpos += num_clusters;
5894
if ((ext_flags & OCFS2_EXT_REFCOUNTED))
5899
ret = ocfs2_add_refcount_flag(inode, value_et,
5900
ref_ci, ref_root_bh,
5901
cpos - num_clusters,
5902
p_cluster, num_clusters,
5914
* Given a normal ocfs2_xattr_header, refcount all the entries which
5915
* have value stored outside.
5916
* Used for xattrs stored in inode and ocfs2_xattr_block.
5918
static int ocfs2_xattr_attach_refcount_normal(struct inode *inode,
5919
struct ocfs2_xattr_value_buf *vb,
5920
struct ocfs2_xattr_header *header,
5921
struct ocfs2_caching_info *ref_ci,
5922
struct buffer_head *ref_root_bh,
5923
struct ocfs2_cached_dealloc_ctxt *dealloc)
5926
struct ocfs2_xattr_entry *xe;
5927
struct ocfs2_xattr_value_root *xv;
5928
struct ocfs2_extent_tree et;
5931
for (i = 0; i < le16_to_cpu(header->xh_count); i++) {
5932
xe = &header->xh_entries[i];
5934
if (ocfs2_xattr_is_local(xe))
5937
xv = (struct ocfs2_xattr_value_root *)((void *)header +
5938
le16_to_cpu(xe->xe_name_offset) +
5939
OCFS2_XATTR_SIZE(xe->xe_name_len));
5942
ocfs2_init_xattr_value_extent_tree(&et, INODE_CACHE(inode), vb);
5944
ret = ocfs2_xattr_value_attach_refcount(inode, xv, &et,
5945
ref_ci, ref_root_bh,
5956
static int ocfs2_xattr_inline_attach_refcount(struct inode *inode,
5957
struct buffer_head *fe_bh,
5958
struct ocfs2_caching_info *ref_ci,
5959
struct buffer_head *ref_root_bh,
5960
struct ocfs2_cached_dealloc_ctxt *dealloc)
5962
struct ocfs2_dinode *di = (struct ocfs2_dinode *)fe_bh->b_data;
5963
struct ocfs2_xattr_header *header = (struct ocfs2_xattr_header *)
5964
(fe_bh->b_data + inode->i_sb->s_blocksize -
5965
le16_to_cpu(di->i_xattr_inline_size));
5966
struct ocfs2_xattr_value_buf vb = {
5968
.vb_access = ocfs2_journal_access_di,
5971
return ocfs2_xattr_attach_refcount_normal(inode, &vb, header,
5972
ref_ci, ref_root_bh, dealloc);
5975
struct ocfs2_xattr_tree_value_refcount_para {
5976
struct ocfs2_caching_info *ref_ci;
5977
struct buffer_head *ref_root_bh;
5978
struct ocfs2_cached_dealloc_ctxt *dealloc;
5981
static int ocfs2_get_xattr_tree_value_root(struct super_block *sb,
5982
struct ocfs2_xattr_bucket *bucket,
5984
struct ocfs2_xattr_value_root **xv,
5985
struct buffer_head **bh)
5987
int ret, block_off, name_offset;
5988
struct ocfs2_xattr_header *xh = bucket_xh(bucket);
5989
struct ocfs2_xattr_entry *xe = &xh->xh_entries[offset];
5992
ret = ocfs2_xattr_bucket_get_name_value(sb,
6002
base = bucket_block(bucket, block_off);
6004
*xv = (struct ocfs2_xattr_value_root *)(base + name_offset +
6005
OCFS2_XATTR_SIZE(xe->xe_name_len));
6008
*bh = bucket->bu_bhs[block_off];
6014
* For a given xattr bucket, refcount all the entries which
6015
* have value stored outside.
6017
static int ocfs2_xattr_bucket_value_refcount(struct inode *inode,
6018
struct ocfs2_xattr_bucket *bucket,
6022
struct ocfs2_extent_tree et;
6023
struct ocfs2_xattr_tree_value_refcount_para *ref =
6024
(struct ocfs2_xattr_tree_value_refcount_para *)para;
6025
struct ocfs2_xattr_header *xh =
6026
(struct ocfs2_xattr_header *)bucket->bu_bhs[0]->b_data;
6027
struct ocfs2_xattr_entry *xe;
6028
struct ocfs2_xattr_value_buf vb = {
6029
.vb_access = ocfs2_journal_access,
6031
struct ocfs2_post_refcount refcount = {
6032
.credits = bucket->bu_blocks,
6034
.func = ocfs2_xattr_bucket_post_refcount,
6036
struct ocfs2_post_refcount *p = NULL;
6038
/* We only need post_refcount if we support metaecc. */
6039
if (ocfs2_meta_ecc(OCFS2_SB(inode->i_sb)))
6042
trace_ocfs2_xattr_bucket_value_refcount(
6043
(unsigned long long)bucket_blkno(bucket),
6044
le16_to_cpu(xh->xh_count));
6045
for (i = 0; i < le16_to_cpu(xh->xh_count); i++) {
6046
xe = &xh->xh_entries[i];
6048
if (ocfs2_xattr_is_local(xe))
6051
ret = ocfs2_get_xattr_tree_value_root(inode->i_sb, bucket, i,
6052
&vb.vb_xv, &vb.vb_bh);
6058
ocfs2_init_xattr_value_extent_tree(&et,
6059
INODE_CACHE(inode), &vb);
6061
ret = ocfs2_xattr_value_attach_refcount(inode, vb.vb_xv,
6075
static int ocfs2_refcount_xattr_tree_rec(struct inode *inode,
6076
struct buffer_head *root_bh,
6077
u64 blkno, u32 cpos, u32 len, void *para)
6079
return ocfs2_iterate_xattr_buckets(inode, blkno, len,
6080
ocfs2_xattr_bucket_value_refcount,
6084
static int ocfs2_xattr_block_attach_refcount(struct inode *inode,
6085
struct buffer_head *blk_bh,
6086
struct ocfs2_caching_info *ref_ci,
6087
struct buffer_head *ref_root_bh,
6088
struct ocfs2_cached_dealloc_ctxt *dealloc)
6091
struct ocfs2_xattr_block *xb =
6092
(struct ocfs2_xattr_block *)blk_bh->b_data;
6094
if (!(le16_to_cpu(xb->xb_flags) & OCFS2_XATTR_INDEXED)) {
6095
struct ocfs2_xattr_header *header = &xb->xb_attrs.xb_header;
6096
struct ocfs2_xattr_value_buf vb = {
6098
.vb_access = ocfs2_journal_access_xb,
6101
ret = ocfs2_xattr_attach_refcount_normal(inode, &vb, header,
6102
ref_ci, ref_root_bh,
6105
struct ocfs2_xattr_tree_value_refcount_para para = {
6107
.ref_root_bh = ref_root_bh,
6111
ret = ocfs2_iterate_xattr_index_block(inode, blk_bh,
6112
ocfs2_refcount_xattr_tree_rec,
6119
int ocfs2_xattr_attach_refcount_tree(struct inode *inode,
6120
struct buffer_head *fe_bh,
6121
struct ocfs2_caching_info *ref_ci,
6122
struct buffer_head *ref_root_bh,
6123
struct ocfs2_cached_dealloc_ctxt *dealloc)
6126
struct ocfs2_inode_info *oi = OCFS2_I(inode);
6127
struct ocfs2_dinode *di = (struct ocfs2_dinode *)fe_bh->b_data;
6128
struct buffer_head *blk_bh = NULL;
6130
if (oi->ip_dyn_features & OCFS2_INLINE_XATTR_FL) {
6131
ret = ocfs2_xattr_inline_attach_refcount(inode, fe_bh,
6132
ref_ci, ref_root_bh,
6140
if (!di->i_xattr_loc)
6143
ret = ocfs2_read_xattr_block(inode, le64_to_cpu(di->i_xattr_loc),
6150
ret = ocfs2_xattr_block_attach_refcount(inode, blk_bh, ref_ci,
6151
ref_root_bh, dealloc);
6161
typedef int (should_xattr_reflinked)(struct ocfs2_xattr_entry *xe);
6163
* Store the information we need in xattr reflink.
6164
* old_bh and new_bh are inode bh for the old and new inode.
6166
struct ocfs2_xattr_reflink {
6167
struct inode *old_inode;
6168
struct inode *new_inode;
6169
struct buffer_head *old_bh;
6170
struct buffer_head *new_bh;
6171
struct ocfs2_caching_info *ref_ci;
6172
struct buffer_head *ref_root_bh;
6173
struct ocfs2_cached_dealloc_ctxt *dealloc;
6174
should_xattr_reflinked *xattr_reflinked;
6178
* Given a xattr header and xe offset,
6179
* return the proper xv and the corresponding bh.
6180
* xattr in inode, block and xattr tree have different implementaions.
6182
typedef int (get_xattr_value_root)(struct super_block *sb,
6183
struct buffer_head *bh,
6184
struct ocfs2_xattr_header *xh,
6186
struct ocfs2_xattr_value_root **xv,
6187
struct buffer_head **ret_bh,
6191
* Calculate all the xattr value root metadata stored in this xattr header and
6192
* credits we need if we create them from the scratch.
6193
* We use get_xattr_value_root so that all types of xattr container can use it.
6195
static int ocfs2_value_metas_in_xattr_header(struct super_block *sb,
6196
struct buffer_head *bh,
6197
struct ocfs2_xattr_header *xh,
6198
int *metas, int *credits,
6200
get_xattr_value_root *func,
6204
struct ocfs2_xattr_value_root *xv;
6205
struct ocfs2_xattr_entry *xe;
6207
for (i = 0; i < le16_to_cpu(xh->xh_count); i++) {
6208
xe = &xh->xh_entries[i];
6209
if (ocfs2_xattr_is_local(xe))
6212
ret = func(sb, bh, xh, i, &xv, NULL, para);
6218
*metas += le16_to_cpu(xv->xr_list.l_tree_depth) *
6219
le16_to_cpu(xv->xr_list.l_next_free_rec);
6221
*credits += ocfs2_calc_extend_credits(sb,
6223
le32_to_cpu(xv->xr_clusters));
6226
* If the value is a tree with depth > 1, We don't go deep
6227
* to the extent block, so just calculate a maximum record num.
6229
if (!xv->xr_list.l_tree_depth)
6230
*num_recs += le16_to_cpu(xv->xr_list.l_next_free_rec);
6232
*num_recs += ocfs2_clusters_for_bytes(sb,
6239
/* Used by xattr inode and block to return the right xv and buffer_head. */
6240
static int ocfs2_get_xattr_value_root(struct super_block *sb,
6241
struct buffer_head *bh,
6242
struct ocfs2_xattr_header *xh,
6244
struct ocfs2_xattr_value_root **xv,
6245
struct buffer_head **ret_bh,
6248
struct ocfs2_xattr_entry *xe = &xh->xh_entries[offset];
6250
*xv = (struct ocfs2_xattr_value_root *)((void *)xh +
6251
le16_to_cpu(xe->xe_name_offset) +
6252
OCFS2_XATTR_SIZE(xe->xe_name_len));
6261
* Lock the meta_ac and caculate how much credits we need for reflink xattrs.
6262
* It is only used for inline xattr and xattr block.
6264
static int ocfs2_reflink_lock_xattr_allocators(struct ocfs2_super *osb,
6265
struct ocfs2_xattr_header *xh,
6266
struct buffer_head *ref_root_bh,
6268
struct ocfs2_alloc_context **meta_ac)
6270
int ret, meta_add = 0, num_recs = 0;
6271
struct ocfs2_refcount_block *rb =
6272
(struct ocfs2_refcount_block *)ref_root_bh->b_data;
6276
ret = ocfs2_value_metas_in_xattr_header(osb->sb, NULL, xh,
6277
&meta_add, credits, &num_recs,
6278
ocfs2_get_xattr_value_root,
6286
* We need to add/modify num_recs in refcount tree, so just calculate
6287
* an approximate number we need for refcount tree change.
6288
* Sometimes we need to split the tree, and after split, half recs
6289
* will be moved to the new block, and a new block can only provide
6290
* half number of recs. So we multiple new blocks by 2.
6292
num_recs = num_recs / ocfs2_refcount_recs_per_rb(osb->sb) * 2;
6293
meta_add += num_recs;
6294
*credits += num_recs + num_recs * OCFS2_EXPAND_REFCOUNT_TREE_CREDITS;
6295
if (le32_to_cpu(rb->rf_flags) & OCFS2_REFCOUNT_TREE_FL)
6296
*credits += le16_to_cpu(rb->rf_list.l_tree_depth) *
6297
le16_to_cpu(rb->rf_list.l_next_free_rec) + 1;
6301
ret = ocfs2_reserve_new_metadata_blocks(osb, meta_add, meta_ac);
6310
* Given a xattr header, reflink all the xattrs in this container.
6311
* It can be used for inode, block and bucket.
6314
* Before we call this function, the caller has memcpy the xattr in
6315
* old_xh to the new_xh.
6317
* If args.xattr_reflinked is set, call it to decide whether the xe should
6318
* be reflinked or not. If not, remove it from the new xattr header.
6320
static int ocfs2_reflink_xattr_header(handle_t *handle,
6321
struct ocfs2_xattr_reflink *args,
6322
struct buffer_head *old_bh,
6323
struct ocfs2_xattr_header *xh,
6324
struct buffer_head *new_bh,
6325
struct ocfs2_xattr_header *new_xh,
6326
struct ocfs2_xattr_value_buf *vb,
6327
struct ocfs2_alloc_context *meta_ac,
6328
get_xattr_value_root *func,
6332
struct super_block *sb = args->old_inode->i_sb;
6333
struct buffer_head *value_bh;
6334
struct ocfs2_xattr_entry *xe, *last;
6335
struct ocfs2_xattr_value_root *xv, *new_xv;
6336
struct ocfs2_extent_tree data_et;
6337
u32 clusters, cpos, p_cluster, num_clusters;
6338
unsigned int ext_flags = 0;
6340
trace_ocfs2_reflink_xattr_header((unsigned long long)old_bh->b_blocknr,
6341
le16_to_cpu(xh->xh_count));
6343
last = &new_xh->xh_entries[le16_to_cpu(new_xh->xh_count)];
6344
for (i = 0, j = 0; i < le16_to_cpu(xh->xh_count); i++, j++) {
6345
xe = &xh->xh_entries[i];
6347
if (args->xattr_reflinked && !args->xattr_reflinked(xe)) {
6348
xe = &new_xh->xh_entries[j];
6350
le16_add_cpu(&new_xh->xh_count, -1);
6351
if (new_xh->xh_count) {
6353
(void *)last - (void *)xe);
6355
sizeof(struct ocfs2_xattr_entry));
6359
* We don't want j to increase in the next round since
6360
* it is already moved ahead.
6366
if (ocfs2_xattr_is_local(xe))
6369
ret = func(sb, old_bh, xh, i, &xv, NULL, para);
6375
ret = func(sb, new_bh, new_xh, j, &new_xv, &value_bh, para);
6382
* For the xattr which has l_tree_depth = 0, all the extent
6383
* recs have already be copied to the new xh with the
6384
* propriate OCFS2_EXT_REFCOUNTED flag we just need to
6385
* increase the refount count int the refcount tree.
6387
* For the xattr which has l_tree_depth > 0, we need
6388
* to initialize it to the empty default value root,
6389
* and then insert the extents one by one.
6391
if (xv->xr_list.l_tree_depth) {
6392
memcpy(new_xv, &def_xv, sizeof(def_xv));
6394
vb->vb_bh = value_bh;
6395
ocfs2_init_xattr_value_extent_tree(&data_et,
6396
INODE_CACHE(args->new_inode), vb);
6399
clusters = le32_to_cpu(xv->xr_clusters);
6401
while (cpos < clusters) {
6402
ret = ocfs2_xattr_get_clusters(args->old_inode,
6415
if (xv->xr_list.l_tree_depth) {
6416
ret = ocfs2_insert_extent(handle,
6418
ocfs2_clusters_to_blocks(
6419
args->old_inode->i_sb,
6421
num_clusters, ext_flags,
6429
ret = ocfs2_increase_refcount(handle, args->ref_ci,
6431
p_cluster, num_clusters,
6432
meta_ac, args->dealloc);
6438
cpos += num_clusters;
6446
static int ocfs2_reflink_xattr_inline(struct ocfs2_xattr_reflink *args)
6448
int ret = 0, credits = 0;
6450
struct ocfs2_super *osb = OCFS2_SB(args->old_inode->i_sb);
6451
struct ocfs2_dinode *di = (struct ocfs2_dinode *)args->old_bh->b_data;
6452
int inline_size = le16_to_cpu(di->i_xattr_inline_size);
6453
int header_off = osb->sb->s_blocksize - inline_size;
6454
struct ocfs2_xattr_header *xh = (struct ocfs2_xattr_header *)
6455
(args->old_bh->b_data + header_off);
6456
struct ocfs2_xattr_header *new_xh = (struct ocfs2_xattr_header *)
6457
(args->new_bh->b_data + header_off);
6458
struct ocfs2_alloc_context *meta_ac = NULL;
6459
struct ocfs2_inode_info *new_oi;
6460
struct ocfs2_dinode *new_di;
6461
struct ocfs2_xattr_value_buf vb = {
6462
.vb_bh = args->new_bh,
6463
.vb_access = ocfs2_journal_access_di,
6466
ret = ocfs2_reflink_lock_xattr_allocators(osb, xh, args->ref_root_bh,
6467
&credits, &meta_ac);
6473
handle = ocfs2_start_trans(osb, credits);
6474
if (IS_ERR(handle)) {
6475
ret = PTR_ERR(handle);
6480
ret = ocfs2_journal_access_di(handle, INODE_CACHE(args->new_inode),
6481
args->new_bh, OCFS2_JOURNAL_ACCESS_WRITE);
6487
memcpy(args->new_bh->b_data + header_off,
6488
args->old_bh->b_data + header_off, inline_size);
6490
new_di = (struct ocfs2_dinode *)args->new_bh->b_data;
6491
new_di->i_xattr_inline_size = cpu_to_le16(inline_size);
6493
ret = ocfs2_reflink_xattr_header(handle, args, args->old_bh, xh,
6494
args->new_bh, new_xh, &vb, meta_ac,
6495
ocfs2_get_xattr_value_root, NULL);
6501
new_oi = OCFS2_I(args->new_inode);
6502
spin_lock(&new_oi->ip_lock);
6503
new_oi->ip_dyn_features |= OCFS2_HAS_XATTR_FL | OCFS2_INLINE_XATTR_FL;
6504
new_di->i_dyn_features = cpu_to_le16(new_oi->ip_dyn_features);
6505
spin_unlock(&new_oi->ip_lock);
6507
ocfs2_journal_dirty(handle, args->new_bh);
6510
ocfs2_commit_trans(osb, handle);
6514
ocfs2_free_alloc_context(meta_ac);
6518
static int ocfs2_create_empty_xattr_block(struct inode *inode,
6519
struct buffer_head *fe_bh,
6520
struct buffer_head **ret_bh,
6524
struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
6525
struct ocfs2_xattr_set_ctxt ctxt;
6527
memset(&ctxt, 0, sizeof(ctxt));
6528
ret = ocfs2_reserve_new_metadata_blocks(osb, 1, &ctxt.meta_ac);
6534
ctxt.handle = ocfs2_start_trans(osb, OCFS2_XATTR_BLOCK_CREATE_CREDITS);
6535
if (IS_ERR(ctxt.handle)) {
6536
ret = PTR_ERR(ctxt.handle);
6541
trace_ocfs2_create_empty_xattr_block(
6542
(unsigned long long)fe_bh->b_blocknr, indexed);
6543
ret = ocfs2_create_xattr_block(inode, fe_bh, &ctxt, indexed,
6548
ocfs2_commit_trans(osb, ctxt.handle);
6550
ocfs2_free_alloc_context(ctxt.meta_ac);
6554
static int ocfs2_reflink_xattr_block(struct ocfs2_xattr_reflink *args,
6555
struct buffer_head *blk_bh,
6556
struct buffer_head *new_blk_bh)
6558
int ret = 0, credits = 0;
6560
struct ocfs2_inode_info *new_oi = OCFS2_I(args->new_inode);
6561
struct ocfs2_dinode *new_di;
6562
struct ocfs2_super *osb = OCFS2_SB(args->new_inode->i_sb);
6563
int header_off = offsetof(struct ocfs2_xattr_block, xb_attrs.xb_header);
6564
struct ocfs2_xattr_block *xb =
6565
(struct ocfs2_xattr_block *)blk_bh->b_data;
6566
struct ocfs2_xattr_header *xh = &xb->xb_attrs.xb_header;
6567
struct ocfs2_xattr_block *new_xb =
6568
(struct ocfs2_xattr_block *)new_blk_bh->b_data;
6569
struct ocfs2_xattr_header *new_xh = &new_xb->xb_attrs.xb_header;
6570
struct ocfs2_alloc_context *meta_ac;
6571
struct ocfs2_xattr_value_buf vb = {
6572
.vb_bh = new_blk_bh,
6573
.vb_access = ocfs2_journal_access_xb,
6576
ret = ocfs2_reflink_lock_xattr_allocators(osb, xh, args->ref_root_bh,
6577
&credits, &meta_ac);
6583
/* One more credits in case we need to add xattr flags in new inode. */
6584
handle = ocfs2_start_trans(osb, credits + 1);
6585
if (IS_ERR(handle)) {
6586
ret = PTR_ERR(handle);
6591
if (!(new_oi->ip_dyn_features & OCFS2_HAS_XATTR_FL)) {
6592
ret = ocfs2_journal_access_di(handle,
6593
INODE_CACHE(args->new_inode),
6595
OCFS2_JOURNAL_ACCESS_WRITE);
6602
ret = ocfs2_journal_access_xb(handle, INODE_CACHE(args->new_inode),
6603
new_blk_bh, OCFS2_JOURNAL_ACCESS_WRITE);
6609
memcpy(new_blk_bh->b_data + header_off, blk_bh->b_data + header_off,
6610
osb->sb->s_blocksize - header_off);
6612
ret = ocfs2_reflink_xattr_header(handle, args, blk_bh, xh,
6613
new_blk_bh, new_xh, &vb, meta_ac,
6614
ocfs2_get_xattr_value_root, NULL);
6620
ocfs2_journal_dirty(handle, new_blk_bh);
6622
if (!(new_oi->ip_dyn_features & OCFS2_HAS_XATTR_FL)) {
6623
new_di = (struct ocfs2_dinode *)args->new_bh->b_data;
6624
spin_lock(&new_oi->ip_lock);
6625
new_oi->ip_dyn_features |= OCFS2_HAS_XATTR_FL;
6626
new_di->i_dyn_features = cpu_to_le16(new_oi->ip_dyn_features);
6627
spin_unlock(&new_oi->ip_lock);
6629
ocfs2_journal_dirty(handle, args->new_bh);
6633
ocfs2_commit_trans(osb, handle);
6636
ocfs2_free_alloc_context(meta_ac);
6640
struct ocfs2_reflink_xattr_tree_args {
6641
struct ocfs2_xattr_reflink *reflink;
6642
struct buffer_head *old_blk_bh;
6643
struct buffer_head *new_blk_bh;
6644
struct ocfs2_xattr_bucket *old_bucket;
6645
struct ocfs2_xattr_bucket *new_bucket;
6650
* We have to handle the case that both old bucket and new bucket
6651
* will call this function to get the right ret_bh.
6652
* So The caller must give us the right bh.
6654
static int ocfs2_get_reflink_xattr_value_root(struct super_block *sb,
6655
struct buffer_head *bh,
6656
struct ocfs2_xattr_header *xh,
6658
struct ocfs2_xattr_value_root **xv,
6659
struct buffer_head **ret_bh,
6662
struct ocfs2_reflink_xattr_tree_args *args =
6663
(struct ocfs2_reflink_xattr_tree_args *)para;
6664
struct ocfs2_xattr_bucket *bucket;
6666
if (bh == args->old_bucket->bu_bhs[0])
6667
bucket = args->old_bucket;
6669
bucket = args->new_bucket;
6671
return ocfs2_get_xattr_tree_value_root(sb, bucket, offset,
6675
struct ocfs2_value_tree_metas {
6681
static int ocfs2_value_tree_metas_in_bucket(struct super_block *sb,
6682
struct buffer_head *bh,
6683
struct ocfs2_xattr_header *xh,
6685
struct ocfs2_xattr_value_root **xv,
6686
struct buffer_head **ret_bh,
6689
struct ocfs2_xattr_bucket *bucket =
6690
(struct ocfs2_xattr_bucket *)para;
6692
return ocfs2_get_xattr_tree_value_root(sb, bucket, offset,
6696
static int ocfs2_calc_value_tree_metas(struct inode *inode,
6697
struct ocfs2_xattr_bucket *bucket,
6700
struct ocfs2_value_tree_metas *metas =
6701
(struct ocfs2_value_tree_metas *)para;
6702
struct ocfs2_xattr_header *xh =
6703
(struct ocfs2_xattr_header *)bucket->bu_bhs[0]->b_data;
6705
/* Add the credits for this bucket first. */
6706
metas->credits += bucket->bu_blocks;
6707
return ocfs2_value_metas_in_xattr_header(inode->i_sb, bucket->bu_bhs[0],
6708
xh, &metas->num_metas,
6709
&metas->credits, &metas->num_recs,
6710
ocfs2_value_tree_metas_in_bucket,
6715
* Given a xattr extent rec starting from blkno and having len clusters,
6716
* iterate all the buckets calculate how much metadata we need for reflinking
6717
* all the ocfs2_xattr_value_root and lock the allocators accordingly.
6719
static int ocfs2_lock_reflink_xattr_rec_allocators(
6720
struct ocfs2_reflink_xattr_tree_args *args,
6721
struct ocfs2_extent_tree *xt_et,
6722
u64 blkno, u32 len, int *credits,
6723
struct ocfs2_alloc_context **meta_ac,
6724
struct ocfs2_alloc_context **data_ac)
6726
int ret, num_free_extents;
6727
struct ocfs2_value_tree_metas metas;
6728
struct ocfs2_super *osb = OCFS2_SB(args->reflink->old_inode->i_sb);
6729
struct ocfs2_refcount_block *rb;
6731
memset(&metas, 0, sizeof(metas));
6733
ret = ocfs2_iterate_xattr_buckets(args->reflink->old_inode, blkno, len,
6734
ocfs2_calc_value_tree_metas, &metas);
6740
*credits = metas.credits;
6743
* Calculate we need for refcount tree change.
6745
* We need to add/modify num_recs in refcount tree, so just calculate
6746
* an approximate number we need for refcount tree change.
6747
* Sometimes we need to split the tree, and after split, half recs
6748
* will be moved to the new block, and a new block can only provide
6749
* half number of recs. So we multiple new blocks by 2.
6750
* In the end, we have to add credits for modifying the already
6751
* existed refcount block.
6753
rb = (struct ocfs2_refcount_block *)args->reflink->ref_root_bh->b_data;
6755
(metas.num_recs + ocfs2_refcount_recs_per_rb(osb->sb) - 1) /
6756
ocfs2_refcount_recs_per_rb(osb->sb) * 2;
6757
metas.num_metas += metas.num_recs;
6758
*credits += metas.num_recs +
6759
metas.num_recs * OCFS2_EXPAND_REFCOUNT_TREE_CREDITS;
6760
if (le32_to_cpu(rb->rf_flags) & OCFS2_REFCOUNT_TREE_FL)
6761
*credits += le16_to_cpu(rb->rf_list.l_tree_depth) *
6762
le16_to_cpu(rb->rf_list.l_next_free_rec) + 1;
6766
/* count in the xattr tree change. */
6767
num_free_extents = ocfs2_num_free_extents(osb, xt_et);
6768
if (num_free_extents < 0) {
6769
ret = num_free_extents;
6774
if (num_free_extents < len)
6775
metas.num_metas += ocfs2_extend_meta_needed(xt_et->et_root_el);
6777
*credits += ocfs2_calc_extend_credits(osb->sb,
6778
xt_et->et_root_el, len);
6780
if (metas.num_metas) {
6781
ret = ocfs2_reserve_new_metadata_blocks(osb, metas.num_metas,
6790
ret = ocfs2_reserve_clusters(osb, len, data_ac);
6797
ocfs2_free_alloc_context(*meta_ac);
6805
static int ocfs2_reflink_xattr_bucket(handle_t *handle,
6806
u64 blkno, u64 new_blkno, u32 clusters,
6807
u32 *cpos, int num_buckets,
6808
struct ocfs2_alloc_context *meta_ac,
6809
struct ocfs2_alloc_context *data_ac,
6810
struct ocfs2_reflink_xattr_tree_args *args)
6813
struct super_block *sb = args->reflink->old_inode->i_sb;
6814
int bpb = args->old_bucket->bu_blocks;
6815
struct ocfs2_xattr_value_buf vb = {
6816
.vb_access = ocfs2_journal_access,
6819
for (i = 0; i < num_buckets; i++, blkno += bpb, new_blkno += bpb) {
6820
ret = ocfs2_read_xattr_bucket(args->old_bucket, blkno);
6826
ret = ocfs2_init_xattr_bucket(args->new_bucket, new_blkno);
6832
ret = ocfs2_xattr_bucket_journal_access(handle,
6834
OCFS2_JOURNAL_ACCESS_CREATE);
6840
for (j = 0; j < bpb; j++)
6841
memcpy(bucket_block(args->new_bucket, j),
6842
bucket_block(args->old_bucket, j),
6846
* Record the start cpos so that we can use it to initialize
6847
* our xattr tree we also set the xh_num_bucket for the new
6851
*cpos = le32_to_cpu(bucket_xh(args->new_bucket)->
6852
xh_entries[0].xe_name_hash);
6853
bucket_xh(args->new_bucket)->xh_num_buckets =
6854
cpu_to_le16(num_buckets);
6857
ocfs2_xattr_bucket_journal_dirty(handle, args->new_bucket);
6859
ret = ocfs2_reflink_xattr_header(handle, args->reflink,
6860
args->old_bucket->bu_bhs[0],
6861
bucket_xh(args->old_bucket),
6862
args->new_bucket->bu_bhs[0],
6863
bucket_xh(args->new_bucket),
6865
ocfs2_get_reflink_xattr_value_root,
6873
* Re-access and dirty the bucket to calculate metaecc.
6874
* Because we may extend the transaction in reflink_xattr_header
6875
* which will let the already accessed block gone.
6877
ret = ocfs2_xattr_bucket_journal_access(handle,
6879
OCFS2_JOURNAL_ACCESS_WRITE);
6885
ocfs2_xattr_bucket_journal_dirty(handle, args->new_bucket);
6887
ocfs2_xattr_bucket_relse(args->old_bucket);
6888
ocfs2_xattr_bucket_relse(args->new_bucket);
6891
ocfs2_xattr_bucket_relse(args->old_bucket);
6892
ocfs2_xattr_bucket_relse(args->new_bucket);
6896
static int ocfs2_reflink_xattr_buckets(handle_t *handle,
6897
struct inode *inode,
6898
struct ocfs2_reflink_xattr_tree_args *args,
6899
struct ocfs2_extent_tree *et,
6900
struct ocfs2_alloc_context *meta_ac,
6901
struct ocfs2_alloc_context *data_ac,
6902
u64 blkno, u32 cpos, u32 len)
6904
int ret, first_inserted = 0;
6905
u32 p_cluster, num_clusters, reflink_cpos = 0;
6907
unsigned int num_buckets, reflink_buckets;
6909
ocfs2_xattr_buckets_per_cluster(OCFS2_SB(inode->i_sb));
6911
ret = ocfs2_read_xattr_bucket(args->old_bucket, blkno);
6916
num_buckets = le16_to_cpu(bucket_xh(args->old_bucket)->xh_num_buckets);
6917
ocfs2_xattr_bucket_relse(args->old_bucket);
6919
while (len && num_buckets) {
6920
ret = ocfs2_claim_clusters(handle, data_ac,
6921
1, &p_cluster, &num_clusters);
6927
new_blkno = ocfs2_clusters_to_blocks(inode->i_sb, p_cluster);
6928
reflink_buckets = min(num_buckets, bpc * num_clusters);
6930
ret = ocfs2_reflink_xattr_bucket(handle, blkno,
6931
new_blkno, num_clusters,
6932
&reflink_cpos, reflink_buckets,
6933
meta_ac, data_ac, args);
6940
* For the 1st allocated cluster, we make it use the same cpos
6941
* so that the xattr tree looks the same as the original one
6944
if (!first_inserted) {
6945
reflink_cpos = cpos;
6948
ret = ocfs2_insert_extent(handle, et, reflink_cpos, new_blkno,
6949
num_clusters, 0, meta_ac);
6953
trace_ocfs2_reflink_xattr_buckets((unsigned long long)new_blkno,
6954
num_clusters, reflink_cpos);
6956
len -= num_clusters;
6957
blkno += ocfs2_clusters_to_blocks(inode->i_sb, num_clusters);
6958
num_buckets -= reflink_buckets;
6965
* Create the same xattr extent record in the new inode's xattr tree.
6967
static int ocfs2_reflink_xattr_rec(struct inode *inode,
6968
struct buffer_head *root_bh,
6974
int ret, credits = 0;
6976
struct ocfs2_reflink_xattr_tree_args *args =
6977
(struct ocfs2_reflink_xattr_tree_args *)para;
6978
struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
6979
struct ocfs2_alloc_context *meta_ac = NULL;
6980
struct ocfs2_alloc_context *data_ac = NULL;
6981
struct ocfs2_extent_tree et;
6983
trace_ocfs2_reflink_xattr_rec((unsigned long long)blkno, len);
6985
ocfs2_init_xattr_tree_extent_tree(&et,
6986
INODE_CACHE(args->reflink->new_inode),
6989
ret = ocfs2_lock_reflink_xattr_rec_allocators(args, &et, blkno,
6991
&meta_ac, &data_ac);
6997
handle = ocfs2_start_trans(osb, credits);
6998
if (IS_ERR(handle)) {
6999
ret = PTR_ERR(handle);
7004
ret = ocfs2_reflink_xattr_buckets(handle, inode, args, &et,
7010
ocfs2_commit_trans(osb, handle);
7014
ocfs2_free_alloc_context(meta_ac);
7016
ocfs2_free_alloc_context(data_ac);
7021
* Create reflinked xattr buckets.
7022
* We will add bucket one by one, and refcount all the xattrs in the bucket
7023
* if they are stored outside.
7025
static int ocfs2_reflink_xattr_tree(struct ocfs2_xattr_reflink *args,
7026
struct buffer_head *blk_bh,
7027
struct buffer_head *new_blk_bh)
7030
struct ocfs2_reflink_xattr_tree_args para;
7032
memset(¶, 0, sizeof(para));
7033
para.reflink = args;
7034
para.old_blk_bh = blk_bh;
7035
para.new_blk_bh = new_blk_bh;
7037
para.old_bucket = ocfs2_xattr_bucket_new(args->old_inode);
7038
if (!para.old_bucket) {
7039
mlog_errno(-ENOMEM);
7043
para.new_bucket = ocfs2_xattr_bucket_new(args->new_inode);
7044
if (!para.new_bucket) {
7050
ret = ocfs2_iterate_xattr_index_block(args->old_inode, blk_bh,
7051
ocfs2_reflink_xattr_rec,
7057
ocfs2_xattr_bucket_free(para.old_bucket);
7058
ocfs2_xattr_bucket_free(para.new_bucket);
7062
static int ocfs2_reflink_xattr_in_block(struct ocfs2_xattr_reflink *args,
7063
struct buffer_head *blk_bh)
7065
int ret, indexed = 0;
7066
struct buffer_head *new_blk_bh = NULL;
7067
struct ocfs2_xattr_block *xb =
7068
(struct ocfs2_xattr_block *)blk_bh->b_data;
7071
if (le16_to_cpu(xb->xb_flags) & OCFS2_XATTR_INDEXED)
7074
ret = ocfs2_create_empty_xattr_block(args->new_inode, args->new_bh,
7075
&new_blk_bh, indexed);
7082
ret = ocfs2_reflink_xattr_block(args, blk_bh, new_blk_bh);
7084
ret = ocfs2_reflink_xattr_tree(args, blk_bh, new_blk_bh);
7093
static int ocfs2_reflink_xattr_no_security(struct ocfs2_xattr_entry *xe)
7095
int type = ocfs2_xattr_get_type(xe);
7097
return type != OCFS2_XATTR_INDEX_SECURITY &&
7098
type != OCFS2_XATTR_INDEX_POSIX_ACL_ACCESS &&
7099
type != OCFS2_XATTR_INDEX_POSIX_ACL_DEFAULT;
7102
int ocfs2_reflink_xattrs(struct inode *old_inode,
7103
struct buffer_head *old_bh,
7104
struct inode *new_inode,
7105
struct buffer_head *new_bh,
7106
bool preserve_security)
7109
struct ocfs2_xattr_reflink args;
7110
struct ocfs2_inode_info *oi = OCFS2_I(old_inode);
7111
struct ocfs2_dinode *di = (struct ocfs2_dinode *)old_bh->b_data;
7112
struct buffer_head *blk_bh = NULL;
7113
struct ocfs2_cached_dealloc_ctxt dealloc;
7114
struct ocfs2_refcount_tree *ref_tree;
7115
struct buffer_head *ref_root_bh = NULL;
7117
ret = ocfs2_lock_refcount_tree(OCFS2_SB(old_inode->i_sb),
7118
le64_to_cpu(di->i_refcount_loc),
7119
1, &ref_tree, &ref_root_bh);
7125
ocfs2_init_dealloc_ctxt(&dealloc);
7127
args.old_inode = old_inode;
7128
args.new_inode = new_inode;
7129
args.old_bh = old_bh;
7130
args.new_bh = new_bh;
7131
args.ref_ci = &ref_tree->rf_ci;
7132
args.ref_root_bh = ref_root_bh;
7133
args.dealloc = &dealloc;
7134
if (preserve_security)
7135
args.xattr_reflinked = NULL;
7137
args.xattr_reflinked = ocfs2_reflink_xattr_no_security;
7139
if (oi->ip_dyn_features & OCFS2_INLINE_XATTR_FL) {
7140
ret = ocfs2_reflink_xattr_inline(&args);
7147
if (!di->i_xattr_loc)
7150
ret = ocfs2_read_xattr_block(old_inode, le64_to_cpu(di->i_xattr_loc),
7157
ret = ocfs2_reflink_xattr_in_block(&args, blk_bh);
7164
ocfs2_unlock_refcount_tree(OCFS2_SB(old_inode->i_sb),
7166
brelse(ref_root_bh);
7168
if (ocfs2_dealloc_has_cluster(&dealloc)) {
7169
ocfs2_schedule_truncate_log_flush(OCFS2_SB(old_inode->i_sb), 1);
7170
ocfs2_run_deallocs(OCFS2_SB(old_inode->i_sb), &dealloc);
7178
* Initialize security and acl for a already created inode.
7179
* Used for reflink a non-preserve-security file.
7181
* It uses common api like ocfs2_xattr_set, so the caller
7182
* must not hold any lock expect i_mutex.
7184
int ocfs2_init_security_and_acl(struct inode *dir,
7185
struct inode *inode,
7186
const struct qstr *qstr)
7189
struct buffer_head *dir_bh = NULL;
7191
ret = ocfs2_init_security_get(inode, dir, qstr, NULL);
7197
ret = ocfs2_inode_lock(dir, &dir_bh, 0);
7203
ret = ocfs2_init_acl(NULL, inode, dir, NULL, dir_bh, NULL, NULL);
7207
ocfs2_inode_unlock(dir, 0);
7213
* 'security' attributes support
7215
static size_t ocfs2_xattr_security_list(struct dentry *dentry, char *list,
7216
size_t list_size, const char *name,
7217
size_t name_len, int type)
7219
const size_t prefix_len = XATTR_SECURITY_PREFIX_LEN;
7220
const size_t total_len = prefix_len + name_len + 1;
7222
if (list && total_len <= list_size) {
7223
memcpy(list, XATTR_SECURITY_PREFIX, prefix_len);
7224
memcpy(list + prefix_len, name, name_len);
7225
list[prefix_len + name_len] = '\0';
7230
static int ocfs2_xattr_security_get(struct dentry *dentry, const char *name,
7231
void *buffer, size_t size, int type)
7233
if (strcmp(name, "") == 0)
7235
return ocfs2_xattr_get(dentry->d_inode, OCFS2_XATTR_INDEX_SECURITY,
7236
name, buffer, size);
7239
static int ocfs2_xattr_security_set(struct dentry *dentry, const char *name,
7240
const void *value, size_t size, int flags, int type)
7242
if (strcmp(name, "") == 0)
7245
return ocfs2_xattr_set(dentry->d_inode, OCFS2_XATTR_INDEX_SECURITY,
7246
name, value, size, flags);
7249
int ocfs2_initxattrs(struct inode *inode, const struct xattr *xattr_array,
7252
const struct xattr *xattr;
7255
for (xattr = xattr_array; xattr->name != NULL; xattr++) {
7256
err = ocfs2_xattr_set(inode, OCFS2_XATTR_INDEX_SECURITY,
7257
xattr->name, xattr->value,
7258
xattr->value_len, XATTR_CREATE);
7265
int ocfs2_init_security_get(struct inode *inode,
7267
const struct qstr *qstr,
7268
struct ocfs2_security_xattr_info *si)
7270
/* check whether ocfs2 support feature xattr */
7271
if (!ocfs2_supports_xattr(OCFS2_SB(dir->i_sb)))
7274
return security_old_inode_init_security(inode, dir, qstr,
7275
&si->name, &si->value,
7278
return security_inode_init_security(inode, dir, qstr,
7279
&ocfs2_initxattrs, NULL);
7282
int ocfs2_init_security_set(handle_t *handle,
7283
struct inode *inode,
7284
struct buffer_head *di_bh,
7285
struct ocfs2_security_xattr_info *si,
7286
struct ocfs2_alloc_context *xattr_ac,
7287
struct ocfs2_alloc_context *data_ac)
7289
return ocfs2_xattr_set_handle(handle, inode, di_bh,
7290
OCFS2_XATTR_INDEX_SECURITY,
7291
si->name, si->value, si->value_len, 0,
7295
const struct xattr_handler ocfs2_xattr_security_handler = {
7296
.prefix = XATTR_SECURITY_PREFIX,
7297
.list = ocfs2_xattr_security_list,
7298
.get = ocfs2_xattr_security_get,
7299
.set = ocfs2_xattr_security_set,
7303
* 'trusted' attributes support
7305
static size_t ocfs2_xattr_trusted_list(struct dentry *dentry, char *list,
7306
size_t list_size, const char *name,
7307
size_t name_len, int type)
7309
const size_t prefix_len = XATTR_TRUSTED_PREFIX_LEN;
7310
const size_t total_len = prefix_len + name_len + 1;
7312
if (list && total_len <= list_size) {
7313
memcpy(list, XATTR_TRUSTED_PREFIX, prefix_len);
7314
memcpy(list + prefix_len, name, name_len);
7315
list[prefix_len + name_len] = '\0';
7320
static int ocfs2_xattr_trusted_get(struct dentry *dentry, const char *name,
7321
void *buffer, size_t size, int type)
7323
if (strcmp(name, "") == 0)
7325
return ocfs2_xattr_get(dentry->d_inode, OCFS2_XATTR_INDEX_TRUSTED,
7326
name, buffer, size);
7329
static int ocfs2_xattr_trusted_set(struct dentry *dentry, const char *name,
7330
const void *value, size_t size, int flags, int type)
7332
if (strcmp(name, "") == 0)
7335
return ocfs2_xattr_set(dentry->d_inode, OCFS2_XATTR_INDEX_TRUSTED,
7336
name, value, size, flags);
7339
const struct xattr_handler ocfs2_xattr_trusted_handler = {
7340
.prefix = XATTR_TRUSTED_PREFIX,
7341
.list = ocfs2_xattr_trusted_list,
7342
.get = ocfs2_xattr_trusted_get,
7343
.set = ocfs2_xattr_trusted_set,
7347
* 'user' attributes support
7349
static size_t ocfs2_xattr_user_list(struct dentry *dentry, char *list,
7350
size_t list_size, const char *name,
7351
size_t name_len, int type)
7353
const size_t prefix_len = XATTR_USER_PREFIX_LEN;
7354
const size_t total_len = prefix_len + name_len + 1;
7355
struct ocfs2_super *osb = OCFS2_SB(dentry->d_sb);
7357
if (osb->s_mount_opt & OCFS2_MOUNT_NOUSERXATTR)
7360
if (list && total_len <= list_size) {
7361
memcpy(list, XATTR_USER_PREFIX, prefix_len);
7362
memcpy(list + prefix_len, name, name_len);
7363
list[prefix_len + name_len] = '\0';
7368
static int ocfs2_xattr_user_get(struct dentry *dentry, const char *name,
7369
void *buffer, size_t size, int type)
7371
struct ocfs2_super *osb = OCFS2_SB(dentry->d_sb);
7373
if (strcmp(name, "") == 0)
7375
if (osb->s_mount_opt & OCFS2_MOUNT_NOUSERXATTR)
7377
return ocfs2_xattr_get(dentry->d_inode, OCFS2_XATTR_INDEX_USER, name,
7381
static int ocfs2_xattr_user_set(struct dentry *dentry, const char *name,
7382
const void *value, size_t size, int flags, int type)
7384
struct ocfs2_super *osb = OCFS2_SB(dentry->d_sb);
7386
if (strcmp(name, "") == 0)
7388
if (osb->s_mount_opt & OCFS2_MOUNT_NOUSERXATTR)
7391
return ocfs2_xattr_set(dentry->d_inode, OCFS2_XATTR_INDEX_USER,
7392
name, value, size, flags);
7395
const struct xattr_handler ocfs2_xattr_user_handler = {
7396
.prefix = XATTR_USER_PREFIX,
7397
.list = ocfs2_xattr_user_list,
7398
.get = ocfs2_xattr_user_get,
7399
.set = ocfs2_xattr_user_set,
added
removed
fs/ocfs2/xattr.c
