staging: rtl8723bs: os_dep: change return type of rtw_suspend_ap_wow
[linux/fpc-iii.git] / fs / ocfs2 / xattr.c
blob385f3aaa244809b0d442d746fb4e76bd391d7bb2
1 // SPDX-License-Identifier: GPL-2.0-only
2 /* -*- mode: c; c-basic-offset: 8; -*-
3 * vim: noexpandtab sw=8 ts=8 sts=0:
5 * xattr.c
7 * Copyright (C) 2004, 2008 Oracle. All rights reserved.
9 * CREDITS:
10 * Lots of code in this file is copy from linux/fs/ext3/xattr.c.
11 * Copyright (C) 2001-2003 Andreas Gruenbacher, <agruen@suse.de>
14 #include <linux/capability.h>
15 #include <linux/fs.h>
16 #include <linux/types.h>
17 #include <linux/slab.h>
18 #include <linux/highmem.h>
19 #include <linux/pagemap.h>
20 #include <linux/uio.h>
21 #include <linux/sched.h>
22 #include <linux/splice.h>
23 #include <linux/mount.h>
24 #include <linux/writeback.h>
25 #include <linux/falloc.h>
26 #include <linux/sort.h>
27 #include <linux/init.h>
28 #include <linux/module.h>
29 #include <linux/string.h>
30 #include <linux/security.h>
32 #include <cluster/masklog.h>
34 #include "ocfs2.h"
35 #include "alloc.h"
36 #include "blockcheck.h"
37 #include "dlmglue.h"
38 #include "file.h"
39 #include "symlink.h"
40 #include "sysfile.h"
41 #include "inode.h"
42 #include "journal.h"
43 #include "ocfs2_fs.h"
44 #include "suballoc.h"
45 #include "uptodate.h"
46 #include "buffer_head_io.h"
47 #include "super.h"
48 #include "xattr.h"
49 #include "refcounttree.h"
50 #include "acl.h"
51 #include "ocfs2_trace.h"
53 struct ocfs2_xattr_def_value_root {
54 struct ocfs2_xattr_value_root xv;
55 struct ocfs2_extent_rec er;
58 struct ocfs2_xattr_bucket {
59 /* The inode these xattrs are associated with */
60 struct inode *bu_inode;
62 /* The actual buffers that make up the bucket */
63 struct buffer_head *bu_bhs[OCFS2_XATTR_MAX_BLOCKS_PER_BUCKET];
65 /* How many blocks make up one bucket for this filesystem */
66 int bu_blocks;
69 struct ocfs2_xattr_set_ctxt {
70 handle_t *handle;
71 struct ocfs2_alloc_context *meta_ac;
72 struct ocfs2_alloc_context *data_ac;
73 struct ocfs2_cached_dealloc_ctxt dealloc;
74 int set_abort;
77 #define OCFS2_XATTR_ROOT_SIZE (sizeof(struct ocfs2_xattr_def_value_root))
78 #define OCFS2_XATTR_INLINE_SIZE 80
79 #define OCFS2_XATTR_HEADER_GAP 4
80 #define OCFS2_XATTR_FREE_IN_IBODY (OCFS2_MIN_XATTR_INLINE_SIZE \
81 - sizeof(struct ocfs2_xattr_header) \
82 - OCFS2_XATTR_HEADER_GAP)
83 #define OCFS2_XATTR_FREE_IN_BLOCK(ptr) ((ptr)->i_sb->s_blocksize \
84 - sizeof(struct ocfs2_xattr_block) \
85 - sizeof(struct ocfs2_xattr_header) \
86 - OCFS2_XATTR_HEADER_GAP)
88 static struct ocfs2_xattr_def_value_root def_xv = {
89 .xv.xr_list.l_count = cpu_to_le16(1),
92 const struct xattr_handler *ocfs2_xattr_handlers[] = {
93 &ocfs2_xattr_user_handler,
94 &posix_acl_access_xattr_handler,
95 &posix_acl_default_xattr_handler,
96 &ocfs2_xattr_trusted_handler,
97 &ocfs2_xattr_security_handler,
98 NULL
101 static const struct xattr_handler *ocfs2_xattr_handler_map[OCFS2_XATTR_MAX] = {
102 [OCFS2_XATTR_INDEX_USER] = &ocfs2_xattr_user_handler,
103 [OCFS2_XATTR_INDEX_POSIX_ACL_ACCESS]
104 = &posix_acl_access_xattr_handler,
105 [OCFS2_XATTR_INDEX_POSIX_ACL_DEFAULT]
106 = &posix_acl_default_xattr_handler,
107 [OCFS2_XATTR_INDEX_TRUSTED] = &ocfs2_xattr_trusted_handler,
108 [OCFS2_XATTR_INDEX_SECURITY] = &ocfs2_xattr_security_handler,
111 struct ocfs2_xattr_info {
112 int xi_name_index;
113 const char *xi_name;
114 int xi_name_len;
115 const void *xi_value;
116 size_t xi_value_len;
119 struct ocfs2_xattr_search {
120 struct buffer_head *inode_bh;
122 * xattr_bh point to the block buffer head which has extended attribute
123 * when extended attribute in inode, xattr_bh is equal to inode_bh.
125 struct buffer_head *xattr_bh;
126 struct ocfs2_xattr_header *header;
127 struct ocfs2_xattr_bucket *bucket;
128 void *base;
129 void *end;
130 struct ocfs2_xattr_entry *here;
131 int not_found;
134 /* Operations on struct ocfs2_xa_entry */
135 struct ocfs2_xa_loc;
136 struct ocfs2_xa_loc_operations {
138 * Journal functions
140 int (*xlo_journal_access)(handle_t *handle, struct ocfs2_xa_loc *loc,
141 int type);
142 void (*xlo_journal_dirty)(handle_t *handle, struct ocfs2_xa_loc *loc);
145 * Return a pointer to the appropriate buffer in loc->xl_storage
146 * at the given offset from loc->xl_header.
148 void *(*xlo_offset_pointer)(struct ocfs2_xa_loc *loc, int offset);
150 /* Can we reuse the existing entry for the new value? */
151 int (*xlo_can_reuse)(struct ocfs2_xa_loc *loc,
152 struct ocfs2_xattr_info *xi);
154 /* How much space is needed for the new value? */
155 int (*xlo_check_space)(struct ocfs2_xa_loc *loc,
156 struct ocfs2_xattr_info *xi);
159 * Return the offset of the first name+value pair. This is
160 * the start of our downward-filling free space.
162 int (*xlo_get_free_start)(struct ocfs2_xa_loc *loc);
165 * Remove the name+value at this location. Do whatever is
166 * appropriate with the remaining name+value pairs.
168 void (*xlo_wipe_namevalue)(struct ocfs2_xa_loc *loc);
170 /* Fill xl_entry with a new entry */
171 void (*xlo_add_entry)(struct ocfs2_xa_loc *loc, u32 name_hash);
173 /* Add name+value storage to an entry */
174 void (*xlo_add_namevalue)(struct ocfs2_xa_loc *loc, int size);
177 * Initialize the value buf's access and bh fields for this entry.
178 * ocfs2_xa_fill_value_buf() will handle the xv pointer.
180 void (*xlo_fill_value_buf)(struct ocfs2_xa_loc *loc,
181 struct ocfs2_xattr_value_buf *vb);
185 * Describes an xattr entry location. This is a memory structure
186 * tracking the on-disk structure.
188 struct ocfs2_xa_loc {
189 /* This xattr belongs to this inode */
190 struct inode *xl_inode;
192 /* The ocfs2_xattr_header inside the on-disk storage. Not NULL. */
193 struct ocfs2_xattr_header *xl_header;
195 /* Bytes from xl_header to the end of the storage */
196 int xl_size;
199 * The ocfs2_xattr_entry this location describes. If this is
200 * NULL, this location describes the on-disk structure where it
201 * would have been.
203 struct ocfs2_xattr_entry *xl_entry;
206 * Internal housekeeping
209 /* Buffer(s) containing this entry */
210 void *xl_storage;
212 /* Operations on the storage backing this location */
213 const struct ocfs2_xa_loc_operations *xl_ops;
217 * Convenience functions to calculate how much space is needed for a
218 * given name+value pair
220 static int namevalue_size(int name_len, uint64_t value_len)
222 if (value_len > OCFS2_XATTR_INLINE_SIZE)
223 return OCFS2_XATTR_SIZE(name_len) + OCFS2_XATTR_ROOT_SIZE;
224 else
225 return OCFS2_XATTR_SIZE(name_len) + OCFS2_XATTR_SIZE(value_len);
228 static int namevalue_size_xi(struct ocfs2_xattr_info *xi)
230 return namevalue_size(xi->xi_name_len, xi->xi_value_len);
233 static int namevalue_size_xe(struct ocfs2_xattr_entry *xe)
235 u64 value_len = le64_to_cpu(xe->xe_value_size);
237 BUG_ON((value_len > OCFS2_XATTR_INLINE_SIZE) &&
238 ocfs2_xattr_is_local(xe));
239 return namevalue_size(xe->xe_name_len, value_len);
243 static int ocfs2_xattr_bucket_get_name_value(struct super_block *sb,
244 struct ocfs2_xattr_header *xh,
245 int index,
246 int *block_off,
247 int *new_offset);
249 static int ocfs2_xattr_block_find(struct inode *inode,
250 int name_index,
251 const char *name,
252 struct ocfs2_xattr_search *xs);
253 static int ocfs2_xattr_index_block_find(struct inode *inode,
254 struct buffer_head *root_bh,
255 int name_index,
256 const char *name,
257 struct ocfs2_xattr_search *xs);
259 static int ocfs2_xattr_tree_list_index_block(struct inode *inode,
260 struct buffer_head *blk_bh,
261 char *buffer,
262 size_t buffer_size);
264 static int ocfs2_xattr_create_index_block(struct inode *inode,
265 struct ocfs2_xattr_search *xs,
266 struct ocfs2_xattr_set_ctxt *ctxt);
268 static int ocfs2_xattr_set_entry_index_block(struct inode *inode,
269 struct ocfs2_xattr_info *xi,
270 struct ocfs2_xattr_search *xs,
271 struct ocfs2_xattr_set_ctxt *ctxt);
273 typedef int (xattr_tree_rec_func)(struct inode *inode,
274 struct buffer_head *root_bh,
275 u64 blkno, u32 cpos, u32 len, void *para);
276 static int ocfs2_iterate_xattr_index_block(struct inode *inode,
277 struct buffer_head *root_bh,
278 xattr_tree_rec_func *rec_func,
279 void *para);
280 static int ocfs2_delete_xattr_in_bucket(struct inode *inode,
281 struct ocfs2_xattr_bucket *bucket,
282 void *para);
283 static int ocfs2_rm_xattr_cluster(struct inode *inode,
284 struct buffer_head *root_bh,
285 u64 blkno,
286 u32 cpos,
287 u32 len,
288 void *para);
290 static int ocfs2_mv_xattr_buckets(struct inode *inode, handle_t *handle,
291 u64 src_blk, u64 last_blk, u64 to_blk,
292 unsigned int start_bucket,
293 u32 *first_hash);
294 static int ocfs2_prepare_refcount_xattr(struct inode *inode,
295 struct ocfs2_dinode *di,
296 struct ocfs2_xattr_info *xi,
297 struct ocfs2_xattr_search *xis,
298 struct ocfs2_xattr_search *xbs,
299 struct ocfs2_refcount_tree **ref_tree,
300 int *meta_need,
301 int *credits);
302 static int ocfs2_get_xattr_tree_value_root(struct super_block *sb,
303 struct ocfs2_xattr_bucket *bucket,
304 int offset,
305 struct ocfs2_xattr_value_root **xv,
306 struct buffer_head **bh);
308 static inline u16 ocfs2_xattr_buckets_per_cluster(struct ocfs2_super *osb)
310 return (1 << osb->s_clustersize_bits) / OCFS2_XATTR_BUCKET_SIZE;
313 static inline u16 ocfs2_blocks_per_xattr_bucket(struct super_block *sb)
315 return OCFS2_XATTR_BUCKET_SIZE / (1 << sb->s_blocksize_bits);
318 #define bucket_blkno(_b) ((_b)->bu_bhs[0]->b_blocknr)
319 #define bucket_block(_b, _n) ((_b)->bu_bhs[(_n)]->b_data)
320 #define bucket_xh(_b) ((struct ocfs2_xattr_header *)bucket_block((_b), 0))
322 static struct ocfs2_xattr_bucket *ocfs2_xattr_bucket_new(struct inode *inode)
324 struct ocfs2_xattr_bucket *bucket;
325 int blks = ocfs2_blocks_per_xattr_bucket(inode->i_sb);
327 BUG_ON(blks > OCFS2_XATTR_MAX_BLOCKS_PER_BUCKET);
329 bucket = kzalloc(sizeof(struct ocfs2_xattr_bucket), GFP_NOFS);
330 if (bucket) {
331 bucket->bu_inode = inode;
332 bucket->bu_blocks = blks;
335 return bucket;
338 static void ocfs2_xattr_bucket_relse(struct ocfs2_xattr_bucket *bucket)
340 int i;
342 for (i = 0; i < bucket->bu_blocks; i++) {
343 brelse(bucket->bu_bhs[i]);
344 bucket->bu_bhs[i] = NULL;
348 static void ocfs2_xattr_bucket_free(struct ocfs2_xattr_bucket *bucket)
350 if (bucket) {
351 ocfs2_xattr_bucket_relse(bucket);
352 bucket->bu_inode = NULL;
353 kfree(bucket);
358 * A bucket that has never been written to disk doesn't need to be
359 * read. We just need the buffer_heads. Don't call this for
360 * buckets that are already on disk. ocfs2_read_xattr_bucket() initializes
361 * them fully.
363 static int ocfs2_init_xattr_bucket(struct ocfs2_xattr_bucket *bucket,
364 u64 xb_blkno, int new)
366 int i, rc = 0;
368 for (i = 0; i < bucket->bu_blocks; i++) {
369 bucket->bu_bhs[i] = sb_getblk(bucket->bu_inode->i_sb,
370 xb_blkno + i);
371 if (!bucket->bu_bhs[i]) {
372 rc = -ENOMEM;
373 mlog_errno(rc);
374 break;
377 if (!ocfs2_buffer_uptodate(INODE_CACHE(bucket->bu_inode),
378 bucket->bu_bhs[i])) {
379 if (new)
380 ocfs2_set_new_buffer_uptodate(INODE_CACHE(bucket->bu_inode),
381 bucket->bu_bhs[i]);
382 else {
383 set_buffer_uptodate(bucket->bu_bhs[i]);
384 ocfs2_set_buffer_uptodate(INODE_CACHE(bucket->bu_inode),
385 bucket->bu_bhs[i]);
390 if (rc)
391 ocfs2_xattr_bucket_relse(bucket);
392 return rc;
395 /* Read the xattr bucket at xb_blkno */
396 static int ocfs2_read_xattr_bucket(struct ocfs2_xattr_bucket *bucket,
397 u64 xb_blkno)
399 int rc;
401 rc = ocfs2_read_blocks(INODE_CACHE(bucket->bu_inode), xb_blkno,
402 bucket->bu_blocks, bucket->bu_bhs, 0,
403 NULL);
404 if (!rc) {
405 spin_lock(&OCFS2_SB(bucket->bu_inode->i_sb)->osb_xattr_lock);
406 rc = ocfs2_validate_meta_ecc_bhs(bucket->bu_inode->i_sb,
407 bucket->bu_bhs,
408 bucket->bu_blocks,
409 &bucket_xh(bucket)->xh_check);
410 spin_unlock(&OCFS2_SB(bucket->bu_inode->i_sb)->osb_xattr_lock);
411 if (rc)
412 mlog_errno(rc);
415 if (rc)
416 ocfs2_xattr_bucket_relse(bucket);
417 return rc;
420 static int ocfs2_xattr_bucket_journal_access(handle_t *handle,
421 struct ocfs2_xattr_bucket *bucket,
422 int type)
424 int i, rc = 0;
426 for (i = 0; i < bucket->bu_blocks; i++) {
427 rc = ocfs2_journal_access(handle,
428 INODE_CACHE(bucket->bu_inode),
429 bucket->bu_bhs[i], type);
430 if (rc) {
431 mlog_errno(rc);
432 break;
436 return rc;
439 static void ocfs2_xattr_bucket_journal_dirty(handle_t *handle,
440 struct ocfs2_xattr_bucket *bucket)
442 int i;
444 spin_lock(&OCFS2_SB(bucket->bu_inode->i_sb)->osb_xattr_lock);
445 ocfs2_compute_meta_ecc_bhs(bucket->bu_inode->i_sb,
446 bucket->bu_bhs, bucket->bu_blocks,
447 &bucket_xh(bucket)->xh_check);
448 spin_unlock(&OCFS2_SB(bucket->bu_inode->i_sb)->osb_xattr_lock);
450 for (i = 0; i < bucket->bu_blocks; i++)
451 ocfs2_journal_dirty(handle, bucket->bu_bhs[i]);
454 static void ocfs2_xattr_bucket_copy_data(struct ocfs2_xattr_bucket *dest,
455 struct ocfs2_xattr_bucket *src)
457 int i;
458 int blocksize = src->bu_inode->i_sb->s_blocksize;
460 BUG_ON(dest->bu_blocks != src->bu_blocks);
461 BUG_ON(dest->bu_inode != src->bu_inode);
463 for (i = 0; i < src->bu_blocks; i++) {
464 memcpy(bucket_block(dest, i), bucket_block(src, i),
465 blocksize);
469 static int ocfs2_validate_xattr_block(struct super_block *sb,
470 struct buffer_head *bh)
472 int rc;
473 struct ocfs2_xattr_block *xb =
474 (struct ocfs2_xattr_block *)bh->b_data;
476 trace_ocfs2_validate_xattr_block((unsigned long long)bh->b_blocknr);
478 BUG_ON(!buffer_uptodate(bh));
481 * If the ecc fails, we return the error but otherwise
482 * leave the filesystem running. We know any error is
483 * local to this block.
485 rc = ocfs2_validate_meta_ecc(sb, bh->b_data, &xb->xb_check);
486 if (rc)
487 return rc;
490 * Errors after here are fatal
493 if (!OCFS2_IS_VALID_XATTR_BLOCK(xb)) {
494 return ocfs2_error(sb,
495 "Extended attribute block #%llu has bad signature %.*s\n",
496 (unsigned long long)bh->b_blocknr, 7,
497 xb->xb_signature);
500 if (le64_to_cpu(xb->xb_blkno) != bh->b_blocknr) {
501 return ocfs2_error(sb,
502 "Extended attribute block #%llu has an invalid xb_blkno of %llu\n",
503 (unsigned long long)bh->b_blocknr,
504 (unsigned long long)le64_to_cpu(xb->xb_blkno));
507 if (le32_to_cpu(xb->xb_fs_generation) != OCFS2_SB(sb)->fs_generation) {
508 return ocfs2_error(sb,
509 "Extended attribute block #%llu has an invalid xb_fs_generation of #%u\n",
510 (unsigned long long)bh->b_blocknr,
511 le32_to_cpu(xb->xb_fs_generation));
514 return 0;
517 static int ocfs2_read_xattr_block(struct inode *inode, u64 xb_blkno,
518 struct buffer_head **bh)
520 int rc;
521 struct buffer_head *tmp = *bh;
523 rc = ocfs2_read_block(INODE_CACHE(inode), xb_blkno, &tmp,
524 ocfs2_validate_xattr_block);
526 /* If ocfs2_read_block() got us a new bh, pass it up. */
527 if (!rc && !*bh)
528 *bh = tmp;
530 return rc;
533 static inline const char *ocfs2_xattr_prefix(int name_index)
535 const struct xattr_handler *handler = NULL;
537 if (name_index > 0 && name_index < OCFS2_XATTR_MAX)
538 handler = ocfs2_xattr_handler_map[name_index];
539 return handler ? xattr_prefix(handler) : NULL;
542 static u32 ocfs2_xattr_name_hash(struct inode *inode,
543 const char *name,
544 int name_len)
546 /* Get hash value of uuid from super block */
547 u32 hash = OCFS2_SB(inode->i_sb)->uuid_hash;
548 int i;
550 /* hash extended attribute name */
551 for (i = 0; i < name_len; i++) {
552 hash = (hash << OCFS2_HASH_SHIFT) ^
553 (hash >> (8*sizeof(hash) - OCFS2_HASH_SHIFT)) ^
554 *name++;
557 return hash;
560 static int ocfs2_xattr_entry_real_size(int name_len, size_t value_len)
562 return namevalue_size(name_len, value_len) +
563 sizeof(struct ocfs2_xattr_entry);
566 static int ocfs2_xi_entry_usage(struct ocfs2_xattr_info *xi)
568 return namevalue_size_xi(xi) +
569 sizeof(struct ocfs2_xattr_entry);
572 static int ocfs2_xe_entry_usage(struct ocfs2_xattr_entry *xe)
574 return namevalue_size_xe(xe) +
575 sizeof(struct ocfs2_xattr_entry);
578 int ocfs2_calc_security_init(struct inode *dir,
579 struct ocfs2_security_xattr_info *si,
580 int *want_clusters,
581 int *xattr_credits,
582 struct ocfs2_alloc_context **xattr_ac)
584 int ret = 0;
585 struct ocfs2_super *osb = OCFS2_SB(dir->i_sb);
586 int s_size = ocfs2_xattr_entry_real_size(strlen(si->name),
587 si->value_len);
590 * The max space of security xattr taken inline is
591 * 256(name) + 80(value) + 16(entry) = 352 bytes,
592 * So reserve one metadata block for it is ok.
594 if (dir->i_sb->s_blocksize == OCFS2_MIN_BLOCKSIZE ||
595 s_size > OCFS2_XATTR_FREE_IN_IBODY) {
596 ret = ocfs2_reserve_new_metadata_blocks(osb, 1, xattr_ac);
597 if (ret) {
598 mlog_errno(ret);
599 return ret;
601 *xattr_credits += OCFS2_XATTR_BLOCK_CREATE_CREDITS;
604 /* reserve clusters for xattr value which will be set in B tree*/
605 if (si->value_len > OCFS2_XATTR_INLINE_SIZE) {
606 int new_clusters = ocfs2_clusters_for_bytes(dir->i_sb,
607 si->value_len);
609 *xattr_credits += ocfs2_clusters_to_blocks(dir->i_sb,
610 new_clusters);
611 *want_clusters += new_clusters;
613 return ret;
616 int ocfs2_calc_xattr_init(struct inode *dir,
617 struct buffer_head *dir_bh,
618 umode_t mode,
619 struct ocfs2_security_xattr_info *si,
620 int *want_clusters,
621 int *xattr_credits,
622 int *want_meta)
624 int ret = 0;
625 struct ocfs2_super *osb = OCFS2_SB(dir->i_sb);
626 int s_size = 0, a_size = 0, acl_len = 0, new_clusters;
628 if (si->enable)
629 s_size = ocfs2_xattr_entry_real_size(strlen(si->name),
630 si->value_len);
632 if (osb->s_mount_opt & OCFS2_MOUNT_POSIX_ACL) {
633 down_read(&OCFS2_I(dir)->ip_xattr_sem);
634 acl_len = ocfs2_xattr_get_nolock(dir, dir_bh,
635 OCFS2_XATTR_INDEX_POSIX_ACL_DEFAULT,
636 "", NULL, 0);
637 up_read(&OCFS2_I(dir)->ip_xattr_sem);
638 if (acl_len > 0) {
639 a_size = ocfs2_xattr_entry_real_size(0, acl_len);
640 if (S_ISDIR(mode))
641 a_size <<= 1;
642 } else if (acl_len != 0 && acl_len != -ENODATA) {
643 ret = acl_len;
644 mlog_errno(ret);
645 return ret;
649 if (!(s_size + a_size))
650 return ret;
653 * The max space of security xattr taken inline is
654 * 256(name) + 80(value) + 16(entry) = 352 bytes,
655 * The max space of acl xattr taken inline is
656 * 80(value) + 16(entry) * 2(if directory) = 192 bytes,
657 * when blocksize = 512, may reserve one more cluser for
658 * xattr bucket, otherwise reserve one metadata block
659 * for them is ok.
660 * If this is a new directory with inline data,
661 * we choose to reserve the entire inline area for
662 * directory contents and force an external xattr block.
664 if (dir->i_sb->s_blocksize == OCFS2_MIN_BLOCKSIZE ||
665 (S_ISDIR(mode) && ocfs2_supports_inline_data(osb)) ||
666 (s_size + a_size) > OCFS2_XATTR_FREE_IN_IBODY) {
667 *want_meta = *want_meta + 1;
668 *xattr_credits += OCFS2_XATTR_BLOCK_CREATE_CREDITS;
671 if (dir->i_sb->s_blocksize == OCFS2_MIN_BLOCKSIZE &&
672 (s_size + a_size) > OCFS2_XATTR_FREE_IN_BLOCK(dir)) {
673 *want_clusters += 1;
674 *xattr_credits += ocfs2_blocks_per_xattr_bucket(dir->i_sb);
678 * reserve credits and clusters for xattrs which has large value
679 * and have to be set outside
681 if (si->enable && si->value_len > OCFS2_XATTR_INLINE_SIZE) {
682 new_clusters = ocfs2_clusters_for_bytes(dir->i_sb,
683 si->value_len);
684 *xattr_credits += ocfs2_clusters_to_blocks(dir->i_sb,
685 new_clusters);
686 *want_clusters += new_clusters;
688 if (osb->s_mount_opt & OCFS2_MOUNT_POSIX_ACL &&
689 acl_len > OCFS2_XATTR_INLINE_SIZE) {
690 /* for directory, it has DEFAULT and ACCESS two types of acls */
691 new_clusters = (S_ISDIR(mode) ? 2 : 1) *
692 ocfs2_clusters_for_bytes(dir->i_sb, acl_len);
693 *xattr_credits += ocfs2_clusters_to_blocks(dir->i_sb,
694 new_clusters);
695 *want_clusters += new_clusters;
698 return ret;
701 static int ocfs2_xattr_extend_allocation(struct inode *inode,
702 u32 clusters_to_add,
703 struct ocfs2_xattr_value_buf *vb,
704 struct ocfs2_xattr_set_ctxt *ctxt)
706 int status = 0, credits;
707 handle_t *handle = ctxt->handle;
708 enum ocfs2_alloc_restarted why;
709 u32 prev_clusters, logical_start = le32_to_cpu(vb->vb_xv->xr_clusters);
710 struct ocfs2_extent_tree et;
712 ocfs2_init_xattr_value_extent_tree(&et, INODE_CACHE(inode), vb);
714 while (clusters_to_add) {
715 trace_ocfs2_xattr_extend_allocation(clusters_to_add);
717 status = vb->vb_access(handle, INODE_CACHE(inode), vb->vb_bh,
718 OCFS2_JOURNAL_ACCESS_WRITE);
719 if (status < 0) {
720 mlog_errno(status);
721 break;
724 prev_clusters = le32_to_cpu(vb->vb_xv->xr_clusters);
725 status = ocfs2_add_clusters_in_btree(handle,
726 &et,
727 &logical_start,
728 clusters_to_add,
730 ctxt->data_ac,
731 ctxt->meta_ac,
732 &why);
733 if ((status < 0) && (status != -EAGAIN)) {
734 if (status != -ENOSPC)
735 mlog_errno(status);
736 break;
739 ocfs2_journal_dirty(handle, vb->vb_bh);
741 clusters_to_add -= le32_to_cpu(vb->vb_xv->xr_clusters) -
742 prev_clusters;
744 if (why != RESTART_NONE && clusters_to_add) {
746 * We can only fail in case the alloc file doesn't give
747 * up enough clusters.
749 BUG_ON(why == RESTART_META);
751 credits = ocfs2_calc_extend_credits(inode->i_sb,
752 &vb->vb_xv->xr_list);
753 status = ocfs2_extend_trans(handle, credits);
754 if (status < 0) {
755 status = -ENOMEM;
756 mlog_errno(status);
757 break;
762 return status;
765 static int __ocfs2_remove_xattr_range(struct inode *inode,
766 struct ocfs2_xattr_value_buf *vb,
767 u32 cpos, u32 phys_cpos, u32 len,
768 unsigned int ext_flags,
769 struct ocfs2_xattr_set_ctxt *ctxt)
771 int ret;
772 u64 phys_blkno = ocfs2_clusters_to_blocks(inode->i_sb, phys_cpos);
773 handle_t *handle = ctxt->handle;
774 struct ocfs2_extent_tree et;
776 ocfs2_init_xattr_value_extent_tree(&et, INODE_CACHE(inode), vb);
778 ret = vb->vb_access(handle, INODE_CACHE(inode), vb->vb_bh,
779 OCFS2_JOURNAL_ACCESS_WRITE);
780 if (ret) {
781 mlog_errno(ret);
782 goto out;
785 ret = ocfs2_remove_extent(handle, &et, cpos, len, ctxt->meta_ac,
786 &ctxt->dealloc);
787 if (ret) {
788 mlog_errno(ret);
789 goto out;
792 le32_add_cpu(&vb->vb_xv->xr_clusters, -len);
793 ocfs2_journal_dirty(handle, vb->vb_bh);
795 if (ext_flags & OCFS2_EXT_REFCOUNTED)
796 ret = ocfs2_decrease_refcount(inode, handle,
797 ocfs2_blocks_to_clusters(inode->i_sb,
798 phys_blkno),
799 len, ctxt->meta_ac, &ctxt->dealloc, 1);
800 else
801 ret = ocfs2_cache_cluster_dealloc(&ctxt->dealloc,
802 phys_blkno, len);
803 if (ret)
804 mlog_errno(ret);
806 out:
807 return ret;
810 static int ocfs2_xattr_shrink_size(struct inode *inode,
811 u32 old_clusters,
812 u32 new_clusters,
813 struct ocfs2_xattr_value_buf *vb,
814 struct ocfs2_xattr_set_ctxt *ctxt)
816 int ret = 0;
817 unsigned int ext_flags;
818 u32 trunc_len, cpos, phys_cpos, alloc_size;
819 u64 block;
821 if (old_clusters <= new_clusters)
822 return 0;
824 cpos = new_clusters;
825 trunc_len = old_clusters - new_clusters;
826 while (trunc_len) {
827 ret = ocfs2_xattr_get_clusters(inode, cpos, &phys_cpos,
828 &alloc_size,
829 &vb->vb_xv->xr_list, &ext_flags);
830 if (ret) {
831 mlog_errno(ret);
832 goto out;
835 if (alloc_size > trunc_len)
836 alloc_size = trunc_len;
838 ret = __ocfs2_remove_xattr_range(inode, vb, cpos,
839 phys_cpos, alloc_size,
840 ext_flags, ctxt);
841 if (ret) {
842 mlog_errno(ret);
843 goto out;
846 block = ocfs2_clusters_to_blocks(inode->i_sb, phys_cpos);
847 ocfs2_remove_xattr_clusters_from_cache(INODE_CACHE(inode),
848 block, alloc_size);
849 cpos += alloc_size;
850 trunc_len -= alloc_size;
853 out:
854 return ret;
857 static int ocfs2_xattr_value_truncate(struct inode *inode,
858 struct ocfs2_xattr_value_buf *vb,
859 int len,
860 struct ocfs2_xattr_set_ctxt *ctxt)
862 int ret;
863 u32 new_clusters = ocfs2_clusters_for_bytes(inode->i_sb, len);
864 u32 old_clusters = le32_to_cpu(vb->vb_xv->xr_clusters);
866 if (new_clusters == old_clusters)
867 return 0;
869 if (new_clusters > old_clusters)
870 ret = ocfs2_xattr_extend_allocation(inode,
871 new_clusters - old_clusters,
872 vb, ctxt);
873 else
874 ret = ocfs2_xattr_shrink_size(inode,
875 old_clusters, new_clusters,
876 vb, ctxt);
878 return ret;
881 static int ocfs2_xattr_list_entry(struct super_block *sb,
882 char *buffer, size_t size,
883 size_t *result, int type,
884 const char *name, int name_len)
886 char *p = buffer + *result;
887 const char *prefix;
888 int prefix_len;
889 int total_len;
891 switch(type) {
892 case OCFS2_XATTR_INDEX_USER:
893 if (OCFS2_SB(sb)->s_mount_opt & OCFS2_MOUNT_NOUSERXATTR)
894 return 0;
895 break;
897 case OCFS2_XATTR_INDEX_POSIX_ACL_ACCESS:
898 case OCFS2_XATTR_INDEX_POSIX_ACL_DEFAULT:
899 if (!(sb->s_flags & SB_POSIXACL))
900 return 0;
901 break;
903 case OCFS2_XATTR_INDEX_TRUSTED:
904 if (!capable(CAP_SYS_ADMIN))
905 return 0;
906 break;
909 prefix = ocfs2_xattr_prefix(type);
910 if (!prefix)
911 return 0;
912 prefix_len = strlen(prefix);
913 total_len = prefix_len + name_len + 1;
914 *result += total_len;
916 /* we are just looking for how big our buffer needs to be */
917 if (!size)
918 return 0;
920 if (*result > size)
921 return -ERANGE;
923 memcpy(p, prefix, prefix_len);
924 memcpy(p + prefix_len, name, name_len);
925 p[prefix_len + name_len] = '\0';
927 return 0;
930 static int ocfs2_xattr_list_entries(struct inode *inode,
931 struct ocfs2_xattr_header *header,
932 char *buffer, size_t buffer_size)
934 size_t result = 0;
935 int i, type, ret;
936 const char *name;
938 for (i = 0 ; i < le16_to_cpu(header->xh_count); i++) {
939 struct ocfs2_xattr_entry *entry = &header->xh_entries[i];
940 type = ocfs2_xattr_get_type(entry);
941 name = (const char *)header +
942 le16_to_cpu(entry->xe_name_offset);
944 ret = ocfs2_xattr_list_entry(inode->i_sb,
945 buffer, buffer_size,
946 &result, type, name,
947 entry->xe_name_len);
948 if (ret)
949 return ret;
952 return result;
955 int ocfs2_has_inline_xattr_value_outside(struct inode *inode,
956 struct ocfs2_dinode *di)
958 struct ocfs2_xattr_header *xh;
959 int i;
961 xh = (struct ocfs2_xattr_header *)
962 ((void *)di + inode->i_sb->s_blocksize -
963 le16_to_cpu(di->i_xattr_inline_size));
965 for (i = 0; i < le16_to_cpu(xh->xh_count); i++)
966 if (!ocfs2_xattr_is_local(&xh->xh_entries[i]))
967 return 1;
969 return 0;
972 static int ocfs2_xattr_ibody_list(struct inode *inode,
973 struct ocfs2_dinode *di,
974 char *buffer,
975 size_t buffer_size)
977 struct ocfs2_xattr_header *header = NULL;
978 struct ocfs2_inode_info *oi = OCFS2_I(inode);
979 int ret = 0;
981 if (!(oi->ip_dyn_features & OCFS2_INLINE_XATTR_FL))
982 return ret;
984 header = (struct ocfs2_xattr_header *)
985 ((void *)di + inode->i_sb->s_blocksize -
986 le16_to_cpu(di->i_xattr_inline_size));
988 ret = ocfs2_xattr_list_entries(inode, header, buffer, buffer_size);
990 return ret;
993 static int ocfs2_xattr_block_list(struct inode *inode,
994 struct ocfs2_dinode *di,
995 char *buffer,
996 size_t buffer_size)
998 struct buffer_head *blk_bh = NULL;
999 struct ocfs2_xattr_block *xb;
1000 int ret = 0;
1002 if (!di->i_xattr_loc)
1003 return ret;
1005 ret = ocfs2_read_xattr_block(inode, le64_to_cpu(di->i_xattr_loc),
1006 &blk_bh);
1007 if (ret < 0) {
1008 mlog_errno(ret);
1009 return ret;
1012 xb = (struct ocfs2_xattr_block *)blk_bh->b_data;
1013 if (!(le16_to_cpu(xb->xb_flags) & OCFS2_XATTR_INDEXED)) {
1014 struct ocfs2_xattr_header *header = &xb->xb_attrs.xb_header;
1015 ret = ocfs2_xattr_list_entries(inode, header,
1016 buffer, buffer_size);
1017 } else
1018 ret = ocfs2_xattr_tree_list_index_block(inode, blk_bh,
1019 buffer, buffer_size);
1021 brelse(blk_bh);
1023 return ret;
1026 ssize_t ocfs2_listxattr(struct dentry *dentry,
1027 char *buffer,
1028 size_t size)
1030 int ret = 0, i_ret = 0, b_ret = 0;
1031 struct buffer_head *di_bh = NULL;
1032 struct ocfs2_dinode *di = NULL;
1033 struct ocfs2_inode_info *oi = OCFS2_I(d_inode(dentry));
1035 if (!ocfs2_supports_xattr(OCFS2_SB(dentry->d_sb)))
1036 return -EOPNOTSUPP;
1038 if (!(oi->ip_dyn_features & OCFS2_HAS_XATTR_FL))
1039 return ret;
1041 ret = ocfs2_inode_lock(d_inode(dentry), &di_bh, 0);
1042 if (ret < 0) {
1043 mlog_errno(ret);
1044 return ret;
1047 di = (struct ocfs2_dinode *)di_bh->b_data;
1049 down_read(&oi->ip_xattr_sem);
1050 i_ret = ocfs2_xattr_ibody_list(d_inode(dentry), di, buffer, size);
1051 if (i_ret < 0)
1052 b_ret = 0;
1053 else {
1054 if (buffer) {
1055 buffer += i_ret;
1056 size -= i_ret;
1058 b_ret = ocfs2_xattr_block_list(d_inode(dentry), di,
1059 buffer, size);
1060 if (b_ret < 0)
1061 i_ret = 0;
1063 up_read(&oi->ip_xattr_sem);
1064 ocfs2_inode_unlock(d_inode(dentry), 0);
1066 brelse(di_bh);
1068 return i_ret + b_ret;
1071 static int ocfs2_xattr_find_entry(int name_index,
1072 const char *name,
1073 struct ocfs2_xattr_search *xs)
1075 struct ocfs2_xattr_entry *entry;
1076 size_t name_len;
1077 int i, cmp = 1;
1079 if (name == NULL)
1080 return -EINVAL;
1082 name_len = strlen(name);
1083 entry = xs->here;
1084 for (i = 0; i < le16_to_cpu(xs->header->xh_count); i++) {
1085 cmp = name_index - ocfs2_xattr_get_type(entry);
1086 if (!cmp)
1087 cmp = name_len - entry->xe_name_len;
1088 if (!cmp)
1089 cmp = memcmp(name, (xs->base +
1090 le16_to_cpu(entry->xe_name_offset)),
1091 name_len);
1092 if (cmp == 0)
1093 break;
1094 entry += 1;
1096 xs->here = entry;
1098 return cmp ? -ENODATA : 0;
1101 static int ocfs2_xattr_get_value_outside(struct inode *inode,
1102 struct ocfs2_xattr_value_root *xv,
1103 void *buffer,
1104 size_t len)
1106 u32 cpos, p_cluster, num_clusters, bpc, clusters;
1107 u64 blkno;
1108 int i, ret = 0;
1109 size_t cplen, blocksize;
1110 struct buffer_head *bh = NULL;
1111 struct ocfs2_extent_list *el;
1113 el = &xv->xr_list;
1114 clusters = le32_to_cpu(xv->xr_clusters);
1115 bpc = ocfs2_clusters_to_blocks(inode->i_sb, 1);
1116 blocksize = inode->i_sb->s_blocksize;
1118 cpos = 0;
1119 while (cpos < clusters) {
1120 ret = ocfs2_xattr_get_clusters(inode, cpos, &p_cluster,
1121 &num_clusters, el, NULL);
1122 if (ret) {
1123 mlog_errno(ret);
1124 goto out;
1127 blkno = ocfs2_clusters_to_blocks(inode->i_sb, p_cluster);
1128 /* Copy ocfs2_xattr_value */
1129 for (i = 0; i < num_clusters * bpc; i++, blkno++) {
1130 ret = ocfs2_read_block(INODE_CACHE(inode), blkno,
1131 &bh, NULL);
1132 if (ret) {
1133 mlog_errno(ret);
1134 goto out;
1137 cplen = len >= blocksize ? blocksize : len;
1138 memcpy(buffer, bh->b_data, cplen);
1139 len -= cplen;
1140 buffer += cplen;
1142 brelse(bh);
1143 bh = NULL;
1144 if (len == 0)
1145 break;
1147 cpos += num_clusters;
1149 out:
1150 return ret;
1153 static int ocfs2_xattr_ibody_get(struct inode *inode,
1154 int name_index,
1155 const char *name,
1156 void *buffer,
1157 size_t buffer_size,
1158 struct ocfs2_xattr_search *xs)
1160 struct ocfs2_inode_info *oi = OCFS2_I(inode);
1161 struct ocfs2_dinode *di = (struct ocfs2_dinode *)xs->inode_bh->b_data;
1162 struct ocfs2_xattr_value_root *xv;
1163 size_t size;
1164 int ret = 0;
1166 if (!(oi->ip_dyn_features & OCFS2_INLINE_XATTR_FL))
1167 return -ENODATA;
1169 xs->end = (void *)di + inode->i_sb->s_blocksize;
1170 xs->header = (struct ocfs2_xattr_header *)
1171 (xs->end - le16_to_cpu(di->i_xattr_inline_size));
1172 xs->base = (void *)xs->header;
1173 xs->here = xs->header->xh_entries;
1175 ret = ocfs2_xattr_find_entry(name_index, name, xs);
1176 if (ret)
1177 return ret;
1178 size = le64_to_cpu(xs->here->xe_value_size);
1179 if (buffer) {
1180 if (size > buffer_size)
1181 return -ERANGE;
1182 if (ocfs2_xattr_is_local(xs->here)) {
1183 memcpy(buffer, (void *)xs->base +
1184 le16_to_cpu(xs->here->xe_name_offset) +
1185 OCFS2_XATTR_SIZE(xs->here->xe_name_len), size);
1186 } else {
1187 xv = (struct ocfs2_xattr_value_root *)
1188 (xs->base + le16_to_cpu(
1189 xs->here->xe_name_offset) +
1190 OCFS2_XATTR_SIZE(xs->here->xe_name_len));
1191 ret = ocfs2_xattr_get_value_outside(inode, xv,
1192 buffer, size);
1193 if (ret < 0) {
1194 mlog_errno(ret);
1195 return ret;
1200 return size;
1203 static int ocfs2_xattr_block_get(struct inode *inode,
1204 int name_index,
1205 const char *name,
1206 void *buffer,
1207 size_t buffer_size,
1208 struct ocfs2_xattr_search *xs)
1210 struct ocfs2_xattr_block *xb;
1211 struct ocfs2_xattr_value_root *xv;
1212 size_t size;
1213 int ret = -ENODATA, name_offset, name_len, i;
1214 int uninitialized_var(block_off);
1216 xs->bucket = ocfs2_xattr_bucket_new(inode);
1217 if (!xs->bucket) {
1218 ret = -ENOMEM;
1219 mlog_errno(ret);
1220 goto cleanup;
1223 ret = ocfs2_xattr_block_find(inode, name_index, name, xs);
1224 if (ret) {
1225 mlog_errno(ret);
1226 goto cleanup;
1229 if (xs->not_found) {
1230 ret = -ENODATA;
1231 goto cleanup;
1234 xb = (struct ocfs2_xattr_block *)xs->xattr_bh->b_data;
1235 size = le64_to_cpu(xs->here->xe_value_size);
1236 if (buffer) {
1237 ret = -ERANGE;
1238 if (size > buffer_size)
1239 goto cleanup;
1241 name_offset = le16_to_cpu(xs->here->xe_name_offset);
1242 name_len = OCFS2_XATTR_SIZE(xs->here->xe_name_len);
1243 i = xs->here - xs->header->xh_entries;
1245 if (le16_to_cpu(xb->xb_flags) & OCFS2_XATTR_INDEXED) {
1246 ret = ocfs2_xattr_bucket_get_name_value(inode->i_sb,
1247 bucket_xh(xs->bucket),
1249 &block_off,
1250 &name_offset);
1251 if (ret) {
1252 mlog_errno(ret);
1253 goto cleanup;
1255 xs->base = bucket_block(xs->bucket, block_off);
1257 if (ocfs2_xattr_is_local(xs->here)) {
1258 memcpy(buffer, (void *)xs->base +
1259 name_offset + name_len, size);
1260 } else {
1261 xv = (struct ocfs2_xattr_value_root *)
1262 (xs->base + name_offset + name_len);
1263 ret = ocfs2_xattr_get_value_outside(inode, xv,
1264 buffer, size);
1265 if (ret < 0) {
1266 mlog_errno(ret);
1267 goto cleanup;
1271 ret = size;
1272 cleanup:
1273 ocfs2_xattr_bucket_free(xs->bucket);
1275 brelse(xs->xattr_bh);
1276 xs->xattr_bh = NULL;
1277 return ret;
1280 int ocfs2_xattr_get_nolock(struct inode *inode,
1281 struct buffer_head *di_bh,
1282 int name_index,
1283 const char *name,
1284 void *buffer,
1285 size_t buffer_size)
1287 int ret;
1288 struct ocfs2_dinode *di = NULL;
1289 struct ocfs2_inode_info *oi = OCFS2_I(inode);
1290 struct ocfs2_xattr_search xis = {
1291 .not_found = -ENODATA,
1293 struct ocfs2_xattr_search xbs = {
1294 .not_found = -ENODATA,
1297 if (!ocfs2_supports_xattr(OCFS2_SB(inode->i_sb)))
1298 return -EOPNOTSUPP;
1300 if (!(oi->ip_dyn_features & OCFS2_HAS_XATTR_FL))
1301 return -ENODATA;
1303 xis.inode_bh = xbs.inode_bh = di_bh;
1304 di = (struct ocfs2_dinode *)di_bh->b_data;
1306 ret = ocfs2_xattr_ibody_get(inode, name_index, name, buffer,
1307 buffer_size, &xis);
1308 if (ret == -ENODATA && di->i_xattr_loc)
1309 ret = ocfs2_xattr_block_get(inode, name_index, name, buffer,
1310 buffer_size, &xbs);
1312 return ret;
1315 /* ocfs2_xattr_get()
1317 * Copy an extended attribute into the buffer provided.
1318 * Buffer is NULL to compute the size of buffer required.
1320 static int ocfs2_xattr_get(struct inode *inode,
1321 int name_index,
1322 const char *name,
1323 void *buffer,
1324 size_t buffer_size)
1326 int ret, had_lock;
1327 struct buffer_head *di_bh = NULL;
1328 struct ocfs2_lock_holder oh;
1330 had_lock = ocfs2_inode_lock_tracker(inode, &di_bh, 0, &oh);
1331 if (had_lock < 0) {
1332 mlog_errno(had_lock);
1333 return had_lock;
1335 down_read(&OCFS2_I(inode)->ip_xattr_sem);
1336 ret = ocfs2_xattr_get_nolock(inode, di_bh, name_index,
1337 name, buffer, buffer_size);
1338 up_read(&OCFS2_I(inode)->ip_xattr_sem);
1340 ocfs2_inode_unlock_tracker(inode, 0, &oh, had_lock);
1342 brelse(di_bh);
1344 return ret;
1347 static int __ocfs2_xattr_set_value_outside(struct inode *inode,
1348 handle_t *handle,
1349 struct ocfs2_xattr_value_buf *vb,
1350 const void *value,
1351 int value_len)
1353 int ret = 0, i, cp_len;
1354 u16 blocksize = inode->i_sb->s_blocksize;
1355 u32 p_cluster, num_clusters;
1356 u32 cpos = 0, bpc = ocfs2_clusters_to_blocks(inode->i_sb, 1);
1357 u32 clusters = ocfs2_clusters_for_bytes(inode->i_sb, value_len);
1358 u64 blkno;
1359 struct buffer_head *bh = NULL;
1360 unsigned int ext_flags;
1361 struct ocfs2_xattr_value_root *xv = vb->vb_xv;
1363 BUG_ON(clusters > le32_to_cpu(xv->xr_clusters));
1365 while (cpos < clusters) {
1366 ret = ocfs2_xattr_get_clusters(inode, cpos, &p_cluster,
1367 &num_clusters, &xv->xr_list,
1368 &ext_flags);
1369 if (ret) {
1370 mlog_errno(ret);
1371 goto out;
1374 BUG_ON(ext_flags & OCFS2_EXT_REFCOUNTED);
1376 blkno = ocfs2_clusters_to_blocks(inode->i_sb, p_cluster);
1378 for (i = 0; i < num_clusters * bpc; i++, blkno++) {
1379 ret = ocfs2_read_block(INODE_CACHE(inode), blkno,
1380 &bh, NULL);
1381 if (ret) {
1382 mlog_errno(ret);
1383 goto out;
1386 ret = ocfs2_journal_access(handle,
1387 INODE_CACHE(inode),
1389 OCFS2_JOURNAL_ACCESS_WRITE);
1390 if (ret < 0) {
1391 mlog_errno(ret);
1392 goto out;
1395 cp_len = value_len > blocksize ? blocksize : value_len;
1396 memcpy(bh->b_data, value, cp_len);
1397 value_len -= cp_len;
1398 value += cp_len;
1399 if (cp_len < blocksize)
1400 memset(bh->b_data + cp_len, 0,
1401 blocksize - cp_len);
1403 ocfs2_journal_dirty(handle, bh);
1404 brelse(bh);
1405 bh = NULL;
1408 * XXX: do we need to empty all the following
1409 * blocks in this cluster?
1411 if (!value_len)
1412 break;
1414 cpos += num_clusters;
1416 out:
1417 brelse(bh);
1419 return ret;
1422 static int ocfs2_xa_check_space_helper(int needed_space, int free_start,
1423 int num_entries)
1425 int free_space;
1427 if (!needed_space)
1428 return 0;
1430 free_space = free_start -
1431 sizeof(struct ocfs2_xattr_header) -
1432 (num_entries * sizeof(struct ocfs2_xattr_entry)) -
1433 OCFS2_XATTR_HEADER_GAP;
1434 if (free_space < 0)
1435 return -EIO;
1436 if (free_space < needed_space)
1437 return -ENOSPC;
1439 return 0;
1442 static int ocfs2_xa_journal_access(handle_t *handle, struct ocfs2_xa_loc *loc,
1443 int type)
1445 return loc->xl_ops->xlo_journal_access(handle, loc, type);
1448 static void ocfs2_xa_journal_dirty(handle_t *handle, struct ocfs2_xa_loc *loc)
1450 loc->xl_ops->xlo_journal_dirty(handle, loc);
1453 /* Give a pointer into the storage for the given offset */
1454 static void *ocfs2_xa_offset_pointer(struct ocfs2_xa_loc *loc, int offset)
1456 BUG_ON(offset >= loc->xl_size);
1457 return loc->xl_ops->xlo_offset_pointer(loc, offset);
1461 * Wipe the name+value pair and allow the storage to reclaim it. This
1462 * must be followed by either removal of the entry or a call to
1463 * ocfs2_xa_add_namevalue().
1465 static void ocfs2_xa_wipe_namevalue(struct ocfs2_xa_loc *loc)
1467 loc->xl_ops->xlo_wipe_namevalue(loc);
1471 * Find lowest offset to a name+value pair. This is the start of our
1472 * downward-growing free space.
1474 static int ocfs2_xa_get_free_start(struct ocfs2_xa_loc *loc)
1476 return loc->xl_ops->xlo_get_free_start(loc);
1479 /* Can we reuse loc->xl_entry for xi? */
1480 static int ocfs2_xa_can_reuse_entry(struct ocfs2_xa_loc *loc,
1481 struct ocfs2_xattr_info *xi)
1483 return loc->xl_ops->xlo_can_reuse(loc, xi);
1486 /* How much free space is needed to set the new value */
1487 static int ocfs2_xa_check_space(struct ocfs2_xa_loc *loc,
1488 struct ocfs2_xattr_info *xi)
1490 return loc->xl_ops->xlo_check_space(loc, xi);
1493 static void ocfs2_xa_add_entry(struct ocfs2_xa_loc *loc, u32 name_hash)
1495 loc->xl_ops->xlo_add_entry(loc, name_hash);
1496 loc->xl_entry->xe_name_hash = cpu_to_le32(name_hash);
1498 * We can't leave the new entry's xe_name_offset at zero or
1499 * add_namevalue() will go nuts. We set it to the size of our
1500 * storage so that it can never be less than any other entry.
1502 loc->xl_entry->xe_name_offset = cpu_to_le16(loc->xl_size);
1505 static void ocfs2_xa_add_namevalue(struct ocfs2_xa_loc *loc,
1506 struct ocfs2_xattr_info *xi)
1508 int size = namevalue_size_xi(xi);
1509 int nameval_offset;
1510 char *nameval_buf;
1512 loc->xl_ops->xlo_add_namevalue(loc, size);
1513 loc->xl_entry->xe_value_size = cpu_to_le64(xi->xi_value_len);
1514 loc->xl_entry->xe_name_len = xi->xi_name_len;
1515 ocfs2_xattr_set_type(loc->xl_entry, xi->xi_name_index);
1516 ocfs2_xattr_set_local(loc->xl_entry,
1517 xi->xi_value_len <= OCFS2_XATTR_INLINE_SIZE);
1519 nameval_offset = le16_to_cpu(loc->xl_entry->xe_name_offset);
1520 nameval_buf = ocfs2_xa_offset_pointer(loc, nameval_offset);
1521 memset(nameval_buf, 0, size);
1522 memcpy(nameval_buf, xi->xi_name, xi->xi_name_len);
1525 static void ocfs2_xa_fill_value_buf(struct ocfs2_xa_loc *loc,
1526 struct ocfs2_xattr_value_buf *vb)
1528 int nameval_offset = le16_to_cpu(loc->xl_entry->xe_name_offset);
1529 int name_size = OCFS2_XATTR_SIZE(loc->xl_entry->xe_name_len);
1531 /* Value bufs are for value trees */
1532 BUG_ON(ocfs2_xattr_is_local(loc->xl_entry));
1533 BUG_ON(namevalue_size_xe(loc->xl_entry) !=
1534 (name_size + OCFS2_XATTR_ROOT_SIZE));
1536 loc->xl_ops->xlo_fill_value_buf(loc, vb);
1537 vb->vb_xv =
1538 (struct ocfs2_xattr_value_root *)ocfs2_xa_offset_pointer(loc,
1539 nameval_offset +
1540 name_size);
1543 static int ocfs2_xa_block_journal_access(handle_t *handle,
1544 struct ocfs2_xa_loc *loc, int type)
1546 struct buffer_head *bh = loc->xl_storage;
1547 ocfs2_journal_access_func access;
1549 if (loc->xl_size == (bh->b_size -
1550 offsetof(struct ocfs2_xattr_block,
1551 xb_attrs.xb_header)))
1552 access = ocfs2_journal_access_xb;
1553 else
1554 access = ocfs2_journal_access_di;
1555 return access(handle, INODE_CACHE(loc->xl_inode), bh, type);
1558 static void ocfs2_xa_block_journal_dirty(handle_t *handle,
1559 struct ocfs2_xa_loc *loc)
1561 struct buffer_head *bh = loc->xl_storage;
1563 ocfs2_journal_dirty(handle, bh);
1566 static void *ocfs2_xa_block_offset_pointer(struct ocfs2_xa_loc *loc,
1567 int offset)
1569 return (char *)loc->xl_header + offset;
1572 static int ocfs2_xa_block_can_reuse(struct ocfs2_xa_loc *loc,
1573 struct ocfs2_xattr_info *xi)
1576 * Block storage is strict. If the sizes aren't exact, we will
1577 * remove the old one and reinsert the new.
1579 return namevalue_size_xe(loc->xl_entry) ==
1580 namevalue_size_xi(xi);
1583 static int ocfs2_xa_block_get_free_start(struct ocfs2_xa_loc *loc)
1585 struct ocfs2_xattr_header *xh = loc->xl_header;
1586 int i, count = le16_to_cpu(xh->xh_count);
1587 int offset, free_start = loc->xl_size;
1589 for (i = 0; i < count; i++) {
1590 offset = le16_to_cpu(xh->xh_entries[i].xe_name_offset);
1591 if (offset < free_start)
1592 free_start = offset;
1595 return free_start;
1598 static int ocfs2_xa_block_check_space(struct ocfs2_xa_loc *loc,
1599 struct ocfs2_xattr_info *xi)
1601 int count = le16_to_cpu(loc->xl_header->xh_count);
1602 int free_start = ocfs2_xa_get_free_start(loc);
1603 int needed_space = ocfs2_xi_entry_usage(xi);
1606 * Block storage will reclaim the original entry before inserting
1607 * the new value, so we only need the difference. If the new
1608 * entry is smaller than the old one, we don't need anything.
1610 if (loc->xl_entry) {
1611 /* Don't need space if we're reusing! */
1612 if (ocfs2_xa_can_reuse_entry(loc, xi))
1613 needed_space = 0;
1614 else
1615 needed_space -= ocfs2_xe_entry_usage(loc->xl_entry);
1617 if (needed_space < 0)
1618 needed_space = 0;
1619 return ocfs2_xa_check_space_helper(needed_space, free_start, count);
1623 * Block storage for xattrs keeps the name+value pairs compacted. When
1624 * we remove one, we have to shift any that preceded it towards the end.
1626 static void ocfs2_xa_block_wipe_namevalue(struct ocfs2_xa_loc *loc)
1628 int i, offset;
1629 int namevalue_offset, first_namevalue_offset, namevalue_size;
1630 struct ocfs2_xattr_entry *entry = loc->xl_entry;
1631 struct ocfs2_xattr_header *xh = loc->xl_header;
1632 int count = le16_to_cpu(xh->xh_count);
1634 namevalue_offset = le16_to_cpu(entry->xe_name_offset);
1635 namevalue_size = namevalue_size_xe(entry);
1636 first_namevalue_offset = ocfs2_xa_get_free_start(loc);
1638 /* Shift the name+value pairs */
1639 memmove((char *)xh + first_namevalue_offset + namevalue_size,
1640 (char *)xh + first_namevalue_offset,
1641 namevalue_offset - first_namevalue_offset);
1642 memset((char *)xh + first_namevalue_offset, 0, namevalue_size);
1644 /* Now tell xh->xh_entries about it */
1645 for (i = 0; i < count; i++) {
1646 offset = le16_to_cpu(xh->xh_entries[i].xe_name_offset);
1647 if (offset <= namevalue_offset)
1648 le16_add_cpu(&xh->xh_entries[i].xe_name_offset,
1649 namevalue_size);
1653 * Note that we don't update xh_free_start or xh_name_value_len
1654 * because they're not used in block-stored xattrs.
1658 static void ocfs2_xa_block_add_entry(struct ocfs2_xa_loc *loc, u32 name_hash)
1660 int count = le16_to_cpu(loc->xl_header->xh_count);
1661 loc->xl_entry = &(loc->xl_header->xh_entries[count]);
1662 le16_add_cpu(&loc->xl_header->xh_count, 1);
1663 memset(loc->xl_entry, 0, sizeof(struct ocfs2_xattr_entry));
1666 static void ocfs2_xa_block_add_namevalue(struct ocfs2_xa_loc *loc, int size)
1668 int free_start = ocfs2_xa_get_free_start(loc);
1670 loc->xl_entry->xe_name_offset = cpu_to_le16(free_start - size);
1673 static void ocfs2_xa_block_fill_value_buf(struct ocfs2_xa_loc *loc,
1674 struct ocfs2_xattr_value_buf *vb)
1676 struct buffer_head *bh = loc->xl_storage;
1678 if (loc->xl_size == (bh->b_size -
1679 offsetof(struct ocfs2_xattr_block,
1680 xb_attrs.xb_header)))
1681 vb->vb_access = ocfs2_journal_access_xb;
1682 else
1683 vb->vb_access = ocfs2_journal_access_di;
1684 vb->vb_bh = bh;
1688 * Operations for xattrs stored in blocks. This includes inline inode
1689 * storage and unindexed ocfs2_xattr_blocks.
1691 static const struct ocfs2_xa_loc_operations ocfs2_xa_block_loc_ops = {
1692 .xlo_journal_access = ocfs2_xa_block_journal_access,
1693 .xlo_journal_dirty = ocfs2_xa_block_journal_dirty,
1694 .xlo_offset_pointer = ocfs2_xa_block_offset_pointer,
1695 .xlo_check_space = ocfs2_xa_block_check_space,
1696 .xlo_can_reuse = ocfs2_xa_block_can_reuse,
1697 .xlo_get_free_start = ocfs2_xa_block_get_free_start,
1698 .xlo_wipe_namevalue = ocfs2_xa_block_wipe_namevalue,
1699 .xlo_add_entry = ocfs2_xa_block_add_entry,
1700 .xlo_add_namevalue = ocfs2_xa_block_add_namevalue,
1701 .xlo_fill_value_buf = ocfs2_xa_block_fill_value_buf,
1704 static int ocfs2_xa_bucket_journal_access(handle_t *handle,
1705 struct ocfs2_xa_loc *loc, int type)
1707 struct ocfs2_xattr_bucket *bucket = loc->xl_storage;
1709 return ocfs2_xattr_bucket_journal_access(handle, bucket, type);
1712 static void ocfs2_xa_bucket_journal_dirty(handle_t *handle,
1713 struct ocfs2_xa_loc *loc)
1715 struct ocfs2_xattr_bucket *bucket = loc->xl_storage;
1717 ocfs2_xattr_bucket_journal_dirty(handle, bucket);
1720 static void *ocfs2_xa_bucket_offset_pointer(struct ocfs2_xa_loc *loc,
1721 int offset)
1723 struct ocfs2_xattr_bucket *bucket = loc->xl_storage;
1724 int block, block_offset;
1726 /* The header is at the front of the bucket */
1727 block = offset >> loc->xl_inode->i_sb->s_blocksize_bits;
1728 block_offset = offset % loc->xl_inode->i_sb->s_blocksize;
1730 return bucket_block(bucket, block) + block_offset;
1733 static int ocfs2_xa_bucket_can_reuse(struct ocfs2_xa_loc *loc,
1734 struct ocfs2_xattr_info *xi)
1736 return namevalue_size_xe(loc->xl_entry) >=
1737 namevalue_size_xi(xi);
1740 static int ocfs2_xa_bucket_get_free_start(struct ocfs2_xa_loc *loc)
1742 struct ocfs2_xattr_bucket *bucket = loc->xl_storage;
1743 return le16_to_cpu(bucket_xh(bucket)->xh_free_start);
1746 static int ocfs2_bucket_align_free_start(struct super_block *sb,
1747 int free_start, int size)
1750 * We need to make sure that the name+value pair fits within
1751 * one block.
1753 if (((free_start - size) >> sb->s_blocksize_bits) !=
1754 ((free_start - 1) >> sb->s_blocksize_bits))
1755 free_start -= free_start % sb->s_blocksize;
1757 return free_start;
1760 static int ocfs2_xa_bucket_check_space(struct ocfs2_xa_loc *loc,
1761 struct ocfs2_xattr_info *xi)
1763 int rc;
1764 int count = le16_to_cpu(loc->xl_header->xh_count);
1765 int free_start = ocfs2_xa_get_free_start(loc);
1766 int needed_space = ocfs2_xi_entry_usage(xi);
1767 int size = namevalue_size_xi(xi);
1768 struct super_block *sb = loc->xl_inode->i_sb;
1771 * Bucket storage does not reclaim name+value pairs it cannot
1772 * reuse. They live as holes until the bucket fills, and then
1773 * the bucket is defragmented. However, the bucket can reclaim
1774 * the ocfs2_xattr_entry.
1776 if (loc->xl_entry) {
1777 /* Don't need space if we're reusing! */
1778 if (ocfs2_xa_can_reuse_entry(loc, xi))
1779 needed_space = 0;
1780 else
1781 needed_space -= sizeof(struct ocfs2_xattr_entry);
1783 BUG_ON(needed_space < 0);
1785 if (free_start < size) {
1786 if (needed_space)
1787 return -ENOSPC;
1788 } else {
1790 * First we check if it would fit in the first place.
1791 * Below, we align the free start to a block. This may
1792 * slide us below the minimum gap. By checking unaligned
1793 * first, we avoid that error.
1795 rc = ocfs2_xa_check_space_helper(needed_space, free_start,
1796 count);
1797 if (rc)
1798 return rc;
1799 free_start = ocfs2_bucket_align_free_start(sb, free_start,
1800 size);
1802 return ocfs2_xa_check_space_helper(needed_space, free_start, count);
1805 static void ocfs2_xa_bucket_wipe_namevalue(struct ocfs2_xa_loc *loc)
1807 le16_add_cpu(&loc->xl_header->xh_name_value_len,
1808 -namevalue_size_xe(loc->xl_entry));
1811 static void ocfs2_xa_bucket_add_entry(struct ocfs2_xa_loc *loc, u32 name_hash)
1813 struct ocfs2_xattr_header *xh = loc->xl_header;
1814 int count = le16_to_cpu(xh->xh_count);
1815 int low = 0, high = count - 1, tmp;
1816 struct ocfs2_xattr_entry *tmp_xe;
1819 * We keep buckets sorted by name_hash, so we need to find
1820 * our insert place.
1822 while (low <= high && count) {
1823 tmp = (low + high) / 2;
1824 tmp_xe = &xh->xh_entries[tmp];
1826 if (name_hash > le32_to_cpu(tmp_xe->xe_name_hash))
1827 low = tmp + 1;
1828 else if (name_hash < le32_to_cpu(tmp_xe->xe_name_hash))
1829 high = tmp - 1;
1830 else {
1831 low = tmp;
1832 break;
1836 if (low != count)
1837 memmove(&xh->xh_entries[low + 1],
1838 &xh->xh_entries[low],
1839 ((count - low) * sizeof(struct ocfs2_xattr_entry)));
1841 le16_add_cpu(&xh->xh_count, 1);
1842 loc->xl_entry = &xh->xh_entries[low];
1843 memset(loc->xl_entry, 0, sizeof(struct ocfs2_xattr_entry));
1846 static void ocfs2_xa_bucket_add_namevalue(struct ocfs2_xa_loc *loc, int size)
1848 int free_start = ocfs2_xa_get_free_start(loc);
1849 struct ocfs2_xattr_header *xh = loc->xl_header;
1850 struct super_block *sb = loc->xl_inode->i_sb;
1851 int nameval_offset;
1853 free_start = ocfs2_bucket_align_free_start(sb, free_start, size);
1854 nameval_offset = free_start - size;
1855 loc->xl_entry->xe_name_offset = cpu_to_le16(nameval_offset);
1856 xh->xh_free_start = cpu_to_le16(nameval_offset);
1857 le16_add_cpu(&xh->xh_name_value_len, size);
1861 static void ocfs2_xa_bucket_fill_value_buf(struct ocfs2_xa_loc *loc,
1862 struct ocfs2_xattr_value_buf *vb)
1864 struct ocfs2_xattr_bucket *bucket = loc->xl_storage;
1865 struct super_block *sb = loc->xl_inode->i_sb;
1866 int nameval_offset = le16_to_cpu(loc->xl_entry->xe_name_offset);
1867 int size = namevalue_size_xe(loc->xl_entry);
1868 int block_offset = nameval_offset >> sb->s_blocksize_bits;
1870 /* Values are not allowed to straddle block boundaries */
1871 BUG_ON(block_offset !=
1872 ((nameval_offset + size - 1) >> sb->s_blocksize_bits));
1873 /* We expect the bucket to be filled in */
1874 BUG_ON(!bucket->bu_bhs[block_offset]);
1876 vb->vb_access = ocfs2_journal_access;
1877 vb->vb_bh = bucket->bu_bhs[block_offset];
1880 /* Operations for xattrs stored in buckets. */
1881 static const struct ocfs2_xa_loc_operations ocfs2_xa_bucket_loc_ops = {
1882 .xlo_journal_access = ocfs2_xa_bucket_journal_access,
1883 .xlo_journal_dirty = ocfs2_xa_bucket_journal_dirty,
1884 .xlo_offset_pointer = ocfs2_xa_bucket_offset_pointer,
1885 .xlo_check_space = ocfs2_xa_bucket_check_space,
1886 .xlo_can_reuse = ocfs2_xa_bucket_can_reuse,
1887 .xlo_get_free_start = ocfs2_xa_bucket_get_free_start,
1888 .xlo_wipe_namevalue = ocfs2_xa_bucket_wipe_namevalue,
1889 .xlo_add_entry = ocfs2_xa_bucket_add_entry,
1890 .xlo_add_namevalue = ocfs2_xa_bucket_add_namevalue,
1891 .xlo_fill_value_buf = ocfs2_xa_bucket_fill_value_buf,
1894 static unsigned int ocfs2_xa_value_clusters(struct ocfs2_xa_loc *loc)
1896 struct ocfs2_xattr_value_buf vb;
1898 if (ocfs2_xattr_is_local(loc->xl_entry))
1899 return 0;
1901 ocfs2_xa_fill_value_buf(loc, &vb);
1902 return le32_to_cpu(vb.vb_xv->xr_clusters);
1905 static int ocfs2_xa_value_truncate(struct ocfs2_xa_loc *loc, u64 bytes,
1906 struct ocfs2_xattr_set_ctxt *ctxt)
1908 int trunc_rc, access_rc;
1909 struct ocfs2_xattr_value_buf vb;
1911 ocfs2_xa_fill_value_buf(loc, &vb);
1912 trunc_rc = ocfs2_xattr_value_truncate(loc->xl_inode, &vb, bytes,
1913 ctxt);
1916 * The caller of ocfs2_xa_value_truncate() has already called
1917 * ocfs2_xa_journal_access on the loc. However, The truncate code
1918 * calls ocfs2_extend_trans(). This may commit the previous
1919 * transaction and open a new one. If this is a bucket, truncate
1920 * could leave only vb->vb_bh set up for journaling. Meanwhile,
1921 * the caller is expecting to dirty the entire bucket. So we must
1922 * reset the journal work. We do this even if truncate has failed,
1923 * as it could have failed after committing the extend.
1925 access_rc = ocfs2_xa_journal_access(ctxt->handle, loc,
1926 OCFS2_JOURNAL_ACCESS_WRITE);
1928 /* Errors in truncate take precedence */
1929 return trunc_rc ? trunc_rc : access_rc;
1932 static void ocfs2_xa_remove_entry(struct ocfs2_xa_loc *loc)
1934 int index, count;
1935 struct ocfs2_xattr_header *xh = loc->xl_header;
1936 struct ocfs2_xattr_entry *entry = loc->xl_entry;
1938 ocfs2_xa_wipe_namevalue(loc);
1939 loc->xl_entry = NULL;
1941 le16_add_cpu(&xh->xh_count, -1);
1942 count = le16_to_cpu(xh->xh_count);
1945 * Only zero out the entry if there are more remaining. This is
1946 * important for an empty bucket, as it keeps track of the
1947 * bucket's hash value. It doesn't hurt empty block storage.
1949 if (count) {
1950 index = ((char *)entry - (char *)&xh->xh_entries) /
1951 sizeof(struct ocfs2_xattr_entry);
1952 memmove(&xh->xh_entries[index], &xh->xh_entries[index + 1],
1953 (count - index) * sizeof(struct ocfs2_xattr_entry));
1954 memset(&xh->xh_entries[count], 0,
1955 sizeof(struct ocfs2_xattr_entry));
1960 * If we have a problem adjusting the size of an external value during
1961 * ocfs2_xa_prepare_entry() or ocfs2_xa_remove(), we may have an xattr
1962 * in an intermediate state. For example, the value may be partially
1963 * truncated.
1965 * If the value tree hasn't changed, the extend/truncate went nowhere.
1966 * We have nothing to do. The caller can treat it as a straight error.
1968 * If the value tree got partially truncated, we now have a corrupted
1969 * extended attribute. We're going to wipe its entry and leak the
1970 * clusters. Better to leak some storage than leave a corrupt entry.
1972 * If the value tree grew, it obviously didn't grow enough for the
1973 * new entry. We're not going to try and reclaim those clusters either.
1974 * If there was already an external value there (orig_clusters != 0),
1975 * the new clusters are attached safely and we can just leave the old
1976 * value in place. If there was no external value there, we remove
1977 * the entry.
1979 * This way, the xattr block we store in the journal will be consistent.
1980 * If the size change broke because of the journal, no changes will hit
1981 * disk anyway.
1983 static void ocfs2_xa_cleanup_value_truncate(struct ocfs2_xa_loc *loc,
1984 const char *what,
1985 unsigned int orig_clusters)
1987 unsigned int new_clusters = ocfs2_xa_value_clusters(loc);
1988 char *nameval_buf = ocfs2_xa_offset_pointer(loc,
1989 le16_to_cpu(loc->xl_entry->xe_name_offset));
1991 if (new_clusters < orig_clusters) {
1992 mlog(ML_ERROR,
1993 "Partial truncate while %s xattr %.*s. Leaking "
1994 "%u clusters and removing the entry\n",
1995 what, loc->xl_entry->xe_name_len, nameval_buf,
1996 orig_clusters - new_clusters);
1997 ocfs2_xa_remove_entry(loc);
1998 } else if (!orig_clusters) {
1999 mlog(ML_ERROR,
2000 "Unable to allocate an external value for xattr "
2001 "%.*s safely. Leaking %u clusters and removing the "
2002 "entry\n",
2003 loc->xl_entry->xe_name_len, nameval_buf,
2004 new_clusters - orig_clusters);
2005 ocfs2_xa_remove_entry(loc);
2006 } else if (new_clusters > orig_clusters)
2007 mlog(ML_ERROR,
2008 "Unable to grow xattr %.*s safely. %u new clusters "
2009 "have been added, but the value will not be "
2010 "modified\n",
2011 loc->xl_entry->xe_name_len, nameval_buf,
2012 new_clusters - orig_clusters);
2015 static int ocfs2_xa_remove(struct ocfs2_xa_loc *loc,
2016 struct ocfs2_xattr_set_ctxt *ctxt)
2018 int rc = 0;
2019 unsigned int orig_clusters;
2021 if (!ocfs2_xattr_is_local(loc->xl_entry)) {
2022 orig_clusters = ocfs2_xa_value_clusters(loc);
2023 rc = ocfs2_xa_value_truncate(loc, 0, ctxt);
2024 if (rc) {
2025 mlog_errno(rc);
2027 * Since this is remove, we can return 0 if
2028 * ocfs2_xa_cleanup_value_truncate() is going to
2029 * wipe the entry anyway. So we check the
2030 * cluster count as well.
2032 if (orig_clusters != ocfs2_xa_value_clusters(loc))
2033 rc = 0;
2034 ocfs2_xa_cleanup_value_truncate(loc, "removing",
2035 orig_clusters);
2036 if (rc)
2037 goto out;
2041 ocfs2_xa_remove_entry(loc);
2043 out:
2044 return rc;
2047 static void ocfs2_xa_install_value_root(struct ocfs2_xa_loc *loc)
2049 int name_size = OCFS2_XATTR_SIZE(loc->xl_entry->xe_name_len);
2050 char *nameval_buf;
2052 nameval_buf = ocfs2_xa_offset_pointer(loc,
2053 le16_to_cpu(loc->xl_entry->xe_name_offset));
2054 memcpy(nameval_buf + name_size, &def_xv, OCFS2_XATTR_ROOT_SIZE);
2058 * Take an existing entry and make it ready for the new value. This
2059 * won't allocate space, but it may free space. It should be ready for
2060 * ocfs2_xa_prepare_entry() to finish the work.
2062 static int ocfs2_xa_reuse_entry(struct ocfs2_xa_loc *loc,
2063 struct ocfs2_xattr_info *xi,
2064 struct ocfs2_xattr_set_ctxt *ctxt)
2066 int rc = 0;
2067 int name_size = OCFS2_XATTR_SIZE(xi->xi_name_len);
2068 unsigned int orig_clusters;
2069 char *nameval_buf;
2070 int xe_local = ocfs2_xattr_is_local(loc->xl_entry);
2071 int xi_local = xi->xi_value_len <= OCFS2_XATTR_INLINE_SIZE;
2073 BUG_ON(OCFS2_XATTR_SIZE(loc->xl_entry->xe_name_len) !=
2074 name_size);
2076 nameval_buf = ocfs2_xa_offset_pointer(loc,
2077 le16_to_cpu(loc->xl_entry->xe_name_offset));
2078 if (xe_local) {
2079 memset(nameval_buf + name_size, 0,
2080 namevalue_size_xe(loc->xl_entry) - name_size);
2081 if (!xi_local)
2082 ocfs2_xa_install_value_root(loc);
2083 } else {
2084 orig_clusters = ocfs2_xa_value_clusters(loc);
2085 if (xi_local) {
2086 rc = ocfs2_xa_value_truncate(loc, 0, ctxt);
2087 if (rc < 0)
2088 mlog_errno(rc);
2089 else
2090 memset(nameval_buf + name_size, 0,
2091 namevalue_size_xe(loc->xl_entry) -
2092 name_size);
2093 } else if (le64_to_cpu(loc->xl_entry->xe_value_size) >
2094 xi->xi_value_len) {
2095 rc = ocfs2_xa_value_truncate(loc, xi->xi_value_len,
2096 ctxt);
2097 if (rc < 0)
2098 mlog_errno(rc);
2101 if (rc) {
2102 ocfs2_xa_cleanup_value_truncate(loc, "reusing",
2103 orig_clusters);
2104 goto out;
2108 loc->xl_entry->xe_value_size = cpu_to_le64(xi->xi_value_len);
2109 ocfs2_xattr_set_local(loc->xl_entry, xi_local);
2111 out:
2112 return rc;
2116 * Prepares loc->xl_entry to receive the new xattr. This includes
2117 * properly setting up the name+value pair region. If loc->xl_entry
2118 * already exists, it will take care of modifying it appropriately.
2120 * Note that this modifies the data. You did journal_access already,
2121 * right?
2123 static int ocfs2_xa_prepare_entry(struct ocfs2_xa_loc *loc,
2124 struct ocfs2_xattr_info *xi,
2125 u32 name_hash,
2126 struct ocfs2_xattr_set_ctxt *ctxt)
2128 int rc = 0;
2129 unsigned int orig_clusters;
2130 __le64 orig_value_size = 0;
2132 rc = ocfs2_xa_check_space(loc, xi);
2133 if (rc)
2134 goto out;
2136 if (loc->xl_entry) {
2137 if (ocfs2_xa_can_reuse_entry(loc, xi)) {
2138 orig_value_size = loc->xl_entry->xe_value_size;
2139 rc = ocfs2_xa_reuse_entry(loc, xi, ctxt);
2140 if (rc)
2141 goto out;
2142 goto alloc_value;
2145 if (!ocfs2_xattr_is_local(loc->xl_entry)) {
2146 orig_clusters = ocfs2_xa_value_clusters(loc);
2147 rc = ocfs2_xa_value_truncate(loc, 0, ctxt);
2148 if (rc) {
2149 mlog_errno(rc);
2150 ocfs2_xa_cleanup_value_truncate(loc,
2151 "overwriting",
2152 orig_clusters);
2153 goto out;
2156 ocfs2_xa_wipe_namevalue(loc);
2157 } else
2158 ocfs2_xa_add_entry(loc, name_hash);
2161 * If we get here, we have a blank entry. Fill it. We grow our
2162 * name+value pair back from the end.
2164 ocfs2_xa_add_namevalue(loc, xi);
2165 if (xi->xi_value_len > OCFS2_XATTR_INLINE_SIZE)
2166 ocfs2_xa_install_value_root(loc);
2168 alloc_value:
2169 if (xi->xi_value_len > OCFS2_XATTR_INLINE_SIZE) {
2170 orig_clusters = ocfs2_xa_value_clusters(loc);
2171 rc = ocfs2_xa_value_truncate(loc, xi->xi_value_len, ctxt);
2172 if (rc < 0) {
2173 ctxt->set_abort = 1;
2174 ocfs2_xa_cleanup_value_truncate(loc, "growing",
2175 orig_clusters);
2177 * If we were growing an existing value,
2178 * ocfs2_xa_cleanup_value_truncate() won't remove
2179 * the entry. We need to restore the original value
2180 * size.
2182 if (loc->xl_entry) {
2183 BUG_ON(!orig_value_size);
2184 loc->xl_entry->xe_value_size = orig_value_size;
2186 mlog_errno(rc);
2190 out:
2191 return rc;
2195 * Store the value portion of the name+value pair. This will skip
2196 * values that are stored externally. Their tree roots were set up
2197 * by ocfs2_xa_prepare_entry().
2199 static int ocfs2_xa_store_value(struct ocfs2_xa_loc *loc,
2200 struct ocfs2_xattr_info *xi,
2201 struct ocfs2_xattr_set_ctxt *ctxt)
2203 int rc = 0;
2204 int nameval_offset = le16_to_cpu(loc->xl_entry->xe_name_offset);
2205 int name_size = OCFS2_XATTR_SIZE(xi->xi_name_len);
2206 char *nameval_buf;
2207 struct ocfs2_xattr_value_buf vb;
2209 nameval_buf = ocfs2_xa_offset_pointer(loc, nameval_offset);
2210 if (xi->xi_value_len > OCFS2_XATTR_INLINE_SIZE) {
2211 ocfs2_xa_fill_value_buf(loc, &vb);
2212 rc = __ocfs2_xattr_set_value_outside(loc->xl_inode,
2213 ctxt->handle, &vb,
2214 xi->xi_value,
2215 xi->xi_value_len);
2216 } else
2217 memcpy(nameval_buf + name_size, xi->xi_value, xi->xi_value_len);
2219 return rc;
2222 static int ocfs2_xa_set(struct ocfs2_xa_loc *loc,
2223 struct ocfs2_xattr_info *xi,
2224 struct ocfs2_xattr_set_ctxt *ctxt)
2226 int ret;
2227 u32 name_hash = ocfs2_xattr_name_hash(loc->xl_inode, xi->xi_name,
2228 xi->xi_name_len);
2230 ret = ocfs2_xa_journal_access(ctxt->handle, loc,
2231 OCFS2_JOURNAL_ACCESS_WRITE);
2232 if (ret) {
2233 mlog_errno(ret);
2234 goto out;
2238 * From here on out, everything is going to modify the buffer a
2239 * little. Errors are going to leave the xattr header in a
2240 * sane state. Thus, even with errors we dirty the sucker.
2243 /* Don't worry, we are never called with !xi_value and !xl_entry */
2244 if (!xi->xi_value) {
2245 ret = ocfs2_xa_remove(loc, ctxt);
2246 goto out_dirty;
2249 ret = ocfs2_xa_prepare_entry(loc, xi, name_hash, ctxt);
2250 if (ret) {
2251 if (ret != -ENOSPC)
2252 mlog_errno(ret);
2253 goto out_dirty;
2256 ret = ocfs2_xa_store_value(loc, xi, ctxt);
2257 if (ret)
2258 mlog_errno(ret);
2260 out_dirty:
2261 ocfs2_xa_journal_dirty(ctxt->handle, loc);
2263 out:
2264 return ret;
2267 static void ocfs2_init_dinode_xa_loc(struct ocfs2_xa_loc *loc,
2268 struct inode *inode,
2269 struct buffer_head *bh,
2270 struct ocfs2_xattr_entry *entry)
2272 struct ocfs2_dinode *di = (struct ocfs2_dinode *)bh->b_data;
2274 BUG_ON(!(OCFS2_I(inode)->ip_dyn_features & OCFS2_INLINE_XATTR_FL));
2276 loc->xl_inode = inode;
2277 loc->xl_ops = &ocfs2_xa_block_loc_ops;
2278 loc->xl_storage = bh;
2279 loc->xl_entry = entry;
2280 loc->xl_size = le16_to_cpu(di->i_xattr_inline_size);
2281 loc->xl_header =
2282 (struct ocfs2_xattr_header *)(bh->b_data + bh->b_size -
2283 loc->xl_size);
2286 static void ocfs2_init_xattr_block_xa_loc(struct ocfs2_xa_loc *loc,
2287 struct inode *inode,
2288 struct buffer_head *bh,
2289 struct ocfs2_xattr_entry *entry)
2291 struct ocfs2_xattr_block *xb =
2292 (struct ocfs2_xattr_block *)bh->b_data;
2294 BUG_ON(le16_to_cpu(xb->xb_flags) & OCFS2_XATTR_INDEXED);
2296 loc->xl_inode = inode;
2297 loc->xl_ops = &ocfs2_xa_block_loc_ops;
2298 loc->xl_storage = bh;
2299 loc->xl_header = &(xb->xb_attrs.xb_header);
2300 loc->xl_entry = entry;
2301 loc->xl_size = bh->b_size - offsetof(struct ocfs2_xattr_block,
2302 xb_attrs.xb_header);
2305 static void ocfs2_init_xattr_bucket_xa_loc(struct ocfs2_xa_loc *loc,
2306 struct ocfs2_xattr_bucket *bucket,
2307 struct ocfs2_xattr_entry *entry)
2309 loc->xl_inode = bucket->bu_inode;
2310 loc->xl_ops = &ocfs2_xa_bucket_loc_ops;
2311 loc->xl_storage = bucket;
2312 loc->xl_header = bucket_xh(bucket);
2313 loc->xl_entry = entry;
2314 loc->xl_size = OCFS2_XATTR_BUCKET_SIZE;
2318 * In xattr remove, if it is stored outside and refcounted, we may have
2319 * the chance to split the refcount tree. So need the allocators.
2321 static int ocfs2_lock_xattr_remove_allocators(struct inode *inode,
2322 struct ocfs2_xattr_value_root *xv,
2323 struct ocfs2_caching_info *ref_ci,
2324 struct buffer_head *ref_root_bh,
2325 struct ocfs2_alloc_context **meta_ac,
2326 int *ref_credits)
2328 int ret, meta_add = 0;
2329 u32 p_cluster, num_clusters;
2330 unsigned int ext_flags;
2332 *ref_credits = 0;
2333 ret = ocfs2_xattr_get_clusters(inode, 0, &p_cluster,
2334 &num_clusters,
2335 &xv->xr_list,
2336 &ext_flags);
2337 if (ret) {
2338 mlog_errno(ret);
2339 goto out;
2342 if (!(ext_flags & OCFS2_EXT_REFCOUNTED))
2343 goto out;
2345 ret = ocfs2_refcounted_xattr_delete_need(inode, ref_ci,
2346 ref_root_bh, xv,
2347 &meta_add, ref_credits);
2348 if (ret) {
2349 mlog_errno(ret);
2350 goto out;
2353 ret = ocfs2_reserve_new_metadata_blocks(OCFS2_SB(inode->i_sb),
2354 meta_add, meta_ac);
2355 if (ret)
2356 mlog_errno(ret);
2358 out:
2359 return ret;
2362 static int ocfs2_remove_value_outside(struct inode*inode,
2363 struct ocfs2_xattr_value_buf *vb,
2364 struct ocfs2_xattr_header *header,
2365 struct ocfs2_caching_info *ref_ci,
2366 struct buffer_head *ref_root_bh)
2368 int ret = 0, i, ref_credits;
2369 struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
2370 struct ocfs2_xattr_set_ctxt ctxt = { NULL, NULL, };
2371 void *val;
2373 ocfs2_init_dealloc_ctxt(&ctxt.dealloc);
2375 for (i = 0; i < le16_to_cpu(header->xh_count); i++) {
2376 struct ocfs2_xattr_entry *entry = &header->xh_entries[i];
2378 if (ocfs2_xattr_is_local(entry))
2379 continue;
2381 val = (void *)header +
2382 le16_to_cpu(entry->xe_name_offset);
2383 vb->vb_xv = (struct ocfs2_xattr_value_root *)
2384 (val + OCFS2_XATTR_SIZE(entry->xe_name_len));
2386 ret = ocfs2_lock_xattr_remove_allocators(inode, vb->vb_xv,
2387 ref_ci, ref_root_bh,
2388 &ctxt.meta_ac,
2389 &ref_credits);
2391 ctxt.handle = ocfs2_start_trans(osb, ref_credits +
2392 ocfs2_remove_extent_credits(osb->sb));
2393 if (IS_ERR(ctxt.handle)) {
2394 ret = PTR_ERR(ctxt.handle);
2395 mlog_errno(ret);
2396 break;
2399 ret = ocfs2_xattr_value_truncate(inode, vb, 0, &ctxt);
2401 ocfs2_commit_trans(osb, ctxt.handle);
2402 if (ctxt.meta_ac) {
2403 ocfs2_free_alloc_context(ctxt.meta_ac);
2404 ctxt.meta_ac = NULL;
2407 if (ret < 0) {
2408 mlog_errno(ret);
2409 break;
2414 if (ctxt.meta_ac)
2415 ocfs2_free_alloc_context(ctxt.meta_ac);
2416 ocfs2_schedule_truncate_log_flush(osb, 1);
2417 ocfs2_run_deallocs(osb, &ctxt.dealloc);
2418 return ret;
2421 static int ocfs2_xattr_ibody_remove(struct inode *inode,
2422 struct buffer_head *di_bh,
2423 struct ocfs2_caching_info *ref_ci,
2424 struct buffer_head *ref_root_bh)
2427 struct ocfs2_dinode *di = (struct ocfs2_dinode *)di_bh->b_data;
2428 struct ocfs2_xattr_header *header;
2429 int ret;
2430 struct ocfs2_xattr_value_buf vb = {
2431 .vb_bh = di_bh,
2432 .vb_access = ocfs2_journal_access_di,
2435 header = (struct ocfs2_xattr_header *)
2436 ((void *)di + inode->i_sb->s_blocksize -
2437 le16_to_cpu(di->i_xattr_inline_size));
2439 ret = ocfs2_remove_value_outside(inode, &vb, header,
2440 ref_ci, ref_root_bh);
2442 return ret;
2445 struct ocfs2_rm_xattr_bucket_para {
2446 struct ocfs2_caching_info *ref_ci;
2447 struct buffer_head *ref_root_bh;
2450 static int ocfs2_xattr_block_remove(struct inode *inode,
2451 struct buffer_head *blk_bh,
2452 struct ocfs2_caching_info *ref_ci,
2453 struct buffer_head *ref_root_bh)
2455 struct ocfs2_xattr_block *xb;
2456 int ret = 0;
2457 struct ocfs2_xattr_value_buf vb = {
2458 .vb_bh = blk_bh,
2459 .vb_access = ocfs2_journal_access_xb,
2461 struct ocfs2_rm_xattr_bucket_para args = {
2462 .ref_ci = ref_ci,
2463 .ref_root_bh = ref_root_bh,
2466 xb = (struct ocfs2_xattr_block *)blk_bh->b_data;
2467 if (!(le16_to_cpu(xb->xb_flags) & OCFS2_XATTR_INDEXED)) {
2468 struct ocfs2_xattr_header *header = &(xb->xb_attrs.xb_header);
2469 ret = ocfs2_remove_value_outside(inode, &vb, header,
2470 ref_ci, ref_root_bh);
2471 } else
2472 ret = ocfs2_iterate_xattr_index_block(inode,
2473 blk_bh,
2474 ocfs2_rm_xattr_cluster,
2475 &args);
2477 return ret;
2480 static int ocfs2_xattr_free_block(struct inode *inode,
2481 u64 block,
2482 struct ocfs2_caching_info *ref_ci,
2483 struct buffer_head *ref_root_bh)
2485 struct inode *xb_alloc_inode;
2486 struct buffer_head *xb_alloc_bh = NULL;
2487 struct buffer_head *blk_bh = NULL;
2488 struct ocfs2_xattr_block *xb;
2489 struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
2490 handle_t *handle;
2491 int ret = 0;
2492 u64 blk, bg_blkno;
2493 u16 bit;
2495 ret = ocfs2_read_xattr_block(inode, block, &blk_bh);
2496 if (ret < 0) {
2497 mlog_errno(ret);
2498 goto out;
2501 ret = ocfs2_xattr_block_remove(inode, blk_bh, ref_ci, ref_root_bh);
2502 if (ret < 0) {
2503 mlog_errno(ret);
2504 goto out;
2507 xb = (struct ocfs2_xattr_block *)blk_bh->b_data;
2508 blk = le64_to_cpu(xb->xb_blkno);
2509 bit = le16_to_cpu(xb->xb_suballoc_bit);
2510 if (xb->xb_suballoc_loc)
2511 bg_blkno = le64_to_cpu(xb->xb_suballoc_loc);
2512 else
2513 bg_blkno = ocfs2_which_suballoc_group(blk, bit);
2515 xb_alloc_inode = ocfs2_get_system_file_inode(osb,
2516 EXTENT_ALLOC_SYSTEM_INODE,
2517 le16_to_cpu(xb->xb_suballoc_slot));
2518 if (!xb_alloc_inode) {
2519 ret = -ENOMEM;
2520 mlog_errno(ret);
2521 goto out;
2523 inode_lock(xb_alloc_inode);
2525 ret = ocfs2_inode_lock(xb_alloc_inode, &xb_alloc_bh, 1);
2526 if (ret < 0) {
2527 mlog_errno(ret);
2528 goto out_mutex;
2531 handle = ocfs2_start_trans(osb, OCFS2_SUBALLOC_FREE);
2532 if (IS_ERR(handle)) {
2533 ret = PTR_ERR(handle);
2534 mlog_errno(ret);
2535 goto out_unlock;
2538 ret = ocfs2_free_suballoc_bits(handle, xb_alloc_inode, xb_alloc_bh,
2539 bit, bg_blkno, 1);
2540 if (ret < 0)
2541 mlog_errno(ret);
2543 ocfs2_commit_trans(osb, handle);
2544 out_unlock:
2545 ocfs2_inode_unlock(xb_alloc_inode, 1);
2546 brelse(xb_alloc_bh);
2547 out_mutex:
2548 inode_unlock(xb_alloc_inode);
2549 iput(xb_alloc_inode);
2550 out:
2551 brelse(blk_bh);
2552 return ret;
2556 * ocfs2_xattr_remove()
2558 * Free extended attribute resources associated with this inode.
2560 int ocfs2_xattr_remove(struct inode *inode, struct buffer_head *di_bh)
2562 struct ocfs2_inode_info *oi = OCFS2_I(inode);
2563 struct ocfs2_dinode *di = (struct ocfs2_dinode *)di_bh->b_data;
2564 struct ocfs2_refcount_tree *ref_tree = NULL;
2565 struct buffer_head *ref_root_bh = NULL;
2566 struct ocfs2_caching_info *ref_ci = NULL;
2567 handle_t *handle;
2568 int ret;
2570 if (!ocfs2_supports_xattr(OCFS2_SB(inode->i_sb)))
2571 return 0;
2573 if (!(oi->ip_dyn_features & OCFS2_HAS_XATTR_FL))
2574 return 0;
2576 if (ocfs2_is_refcount_inode(inode)) {
2577 ret = ocfs2_lock_refcount_tree(OCFS2_SB(inode->i_sb),
2578 le64_to_cpu(di->i_refcount_loc),
2579 1, &ref_tree, &ref_root_bh);
2580 if (ret) {
2581 mlog_errno(ret);
2582 goto out;
2584 ref_ci = &ref_tree->rf_ci;
2588 if (oi->ip_dyn_features & OCFS2_INLINE_XATTR_FL) {
2589 ret = ocfs2_xattr_ibody_remove(inode, di_bh,
2590 ref_ci, ref_root_bh);
2591 if (ret < 0) {
2592 mlog_errno(ret);
2593 goto out;
2597 if (di->i_xattr_loc) {
2598 ret = ocfs2_xattr_free_block(inode,
2599 le64_to_cpu(di->i_xattr_loc),
2600 ref_ci, ref_root_bh);
2601 if (ret < 0) {
2602 mlog_errno(ret);
2603 goto out;
2607 handle = ocfs2_start_trans((OCFS2_SB(inode->i_sb)),
2608 OCFS2_INODE_UPDATE_CREDITS);
2609 if (IS_ERR(handle)) {
2610 ret = PTR_ERR(handle);
2611 mlog_errno(ret);
2612 goto out;
2614 ret = ocfs2_journal_access_di(handle, INODE_CACHE(inode), di_bh,
2615 OCFS2_JOURNAL_ACCESS_WRITE);
2616 if (ret) {
2617 mlog_errno(ret);
2618 goto out_commit;
2621 di->i_xattr_loc = 0;
2623 spin_lock(&oi->ip_lock);
2624 oi->ip_dyn_features &= ~(OCFS2_INLINE_XATTR_FL | OCFS2_HAS_XATTR_FL);
2625 di->i_dyn_features = cpu_to_le16(oi->ip_dyn_features);
2626 spin_unlock(&oi->ip_lock);
2627 ocfs2_update_inode_fsync_trans(handle, inode, 0);
2629 ocfs2_journal_dirty(handle, di_bh);
2630 out_commit:
2631 ocfs2_commit_trans(OCFS2_SB(inode->i_sb), handle);
2632 out:
2633 if (ref_tree)
2634 ocfs2_unlock_refcount_tree(OCFS2_SB(inode->i_sb), ref_tree, 1);
2635 brelse(ref_root_bh);
2636 return ret;
2639 static int ocfs2_xattr_has_space_inline(struct inode *inode,
2640 struct ocfs2_dinode *di)
2642 struct ocfs2_inode_info *oi = OCFS2_I(inode);
2643 unsigned int xattrsize = OCFS2_SB(inode->i_sb)->s_xattr_inline_size;
2644 int free;
2646 if (xattrsize < OCFS2_MIN_XATTR_INLINE_SIZE)
2647 return 0;
2649 if (oi->ip_dyn_features & OCFS2_INLINE_DATA_FL) {
2650 struct ocfs2_inline_data *idata = &di->id2.i_data;
2651 free = le16_to_cpu(idata->id_count) - le64_to_cpu(di->i_size);
2652 } else if (ocfs2_inode_is_fast_symlink(inode)) {
2653 free = ocfs2_fast_symlink_chars(inode->i_sb) -
2654 le64_to_cpu(di->i_size);
2655 } else {
2656 struct ocfs2_extent_list *el = &di->id2.i_list;
2657 free = (le16_to_cpu(el->l_count) -
2658 le16_to_cpu(el->l_next_free_rec)) *
2659 sizeof(struct ocfs2_extent_rec);
2661 if (free >= xattrsize)
2662 return 1;
2664 return 0;
2668 * ocfs2_xattr_ibody_find()
2670 * Find extended attribute in inode block and
2671 * fill search info into struct ocfs2_xattr_search.
2673 static int ocfs2_xattr_ibody_find(struct inode *inode,
2674 int name_index,
2675 const char *name,
2676 struct ocfs2_xattr_search *xs)
2678 struct ocfs2_inode_info *oi = OCFS2_I(inode);
2679 struct ocfs2_dinode *di = (struct ocfs2_dinode *)xs->inode_bh->b_data;
2680 int ret;
2681 int has_space = 0;
2683 if (inode->i_sb->s_blocksize == OCFS2_MIN_BLOCKSIZE)
2684 return 0;
2686 if (!(oi->ip_dyn_features & OCFS2_INLINE_XATTR_FL)) {
2687 down_read(&oi->ip_alloc_sem);
2688 has_space = ocfs2_xattr_has_space_inline(inode, di);
2689 up_read(&oi->ip_alloc_sem);
2690 if (!has_space)
2691 return 0;
2694 xs->xattr_bh = xs->inode_bh;
2695 xs->end = (void *)di + inode->i_sb->s_blocksize;
2696 if (oi->ip_dyn_features & OCFS2_INLINE_XATTR_FL)
2697 xs->header = (struct ocfs2_xattr_header *)
2698 (xs->end - le16_to_cpu(di->i_xattr_inline_size));
2699 else
2700 xs->header = (struct ocfs2_xattr_header *)
2701 (xs->end - OCFS2_SB(inode->i_sb)->s_xattr_inline_size);
2702 xs->base = (void *)xs->header;
2703 xs->here = xs->header->xh_entries;
2705 /* Find the named attribute. */
2706 if (oi->ip_dyn_features & OCFS2_INLINE_XATTR_FL) {
2707 ret = ocfs2_xattr_find_entry(name_index, name, xs);
2708 if (ret && ret != -ENODATA)
2709 return ret;
2710 xs->not_found = ret;
2713 return 0;
2716 static int ocfs2_xattr_ibody_init(struct inode *inode,
2717 struct buffer_head *di_bh,
2718 struct ocfs2_xattr_set_ctxt *ctxt)
2720 int ret;
2721 struct ocfs2_inode_info *oi = OCFS2_I(inode);
2722 struct ocfs2_dinode *di = (struct ocfs2_dinode *)di_bh->b_data;
2723 struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
2724 unsigned int xattrsize = osb->s_xattr_inline_size;
2726 if (!ocfs2_xattr_has_space_inline(inode, di)) {
2727 ret = -ENOSPC;
2728 goto out;
2731 ret = ocfs2_journal_access_di(ctxt->handle, INODE_CACHE(inode), di_bh,
2732 OCFS2_JOURNAL_ACCESS_WRITE);
2733 if (ret) {
2734 mlog_errno(ret);
2735 goto out;
2739 * Adjust extent record count or inline data size
2740 * to reserve space for extended attribute.
2742 if (oi->ip_dyn_features & OCFS2_INLINE_DATA_FL) {
2743 struct ocfs2_inline_data *idata = &di->id2.i_data;
2744 le16_add_cpu(&idata->id_count, -xattrsize);
2745 } else if (!(ocfs2_inode_is_fast_symlink(inode))) {
2746 struct ocfs2_extent_list *el = &di->id2.i_list;
2747 le16_add_cpu(&el->l_count, -(xattrsize /
2748 sizeof(struct ocfs2_extent_rec)));
2750 di->i_xattr_inline_size = cpu_to_le16(xattrsize);
2752 spin_lock(&oi->ip_lock);
2753 oi->ip_dyn_features |= OCFS2_INLINE_XATTR_FL|OCFS2_HAS_XATTR_FL;
2754 di->i_dyn_features = cpu_to_le16(oi->ip_dyn_features);
2755 spin_unlock(&oi->ip_lock);
2757 ocfs2_journal_dirty(ctxt->handle, di_bh);
2759 out:
2760 return ret;
2764 * ocfs2_xattr_ibody_set()
2766 * Set, replace or remove an extended attribute into inode block.
2769 static int ocfs2_xattr_ibody_set(struct inode *inode,
2770 struct ocfs2_xattr_info *xi,
2771 struct ocfs2_xattr_search *xs,
2772 struct ocfs2_xattr_set_ctxt *ctxt)
2774 int ret;
2775 struct ocfs2_inode_info *oi = OCFS2_I(inode);
2776 struct ocfs2_xa_loc loc;
2778 if (inode->i_sb->s_blocksize == OCFS2_MIN_BLOCKSIZE)
2779 return -ENOSPC;
2781 down_write(&oi->ip_alloc_sem);
2782 if (!(oi->ip_dyn_features & OCFS2_INLINE_XATTR_FL)) {
2783 ret = ocfs2_xattr_ibody_init(inode, xs->inode_bh, ctxt);
2784 if (ret) {
2785 if (ret != -ENOSPC)
2786 mlog_errno(ret);
2787 goto out;
2791 ocfs2_init_dinode_xa_loc(&loc, inode, xs->inode_bh,
2792 xs->not_found ? NULL : xs->here);
2793 ret = ocfs2_xa_set(&loc, xi, ctxt);
2794 if (ret) {
2795 if (ret != -ENOSPC)
2796 mlog_errno(ret);
2797 goto out;
2799 xs->here = loc.xl_entry;
2801 out:
2802 up_write(&oi->ip_alloc_sem);
2804 return ret;
2808 * ocfs2_xattr_block_find()
2810 * Find extended attribute in external block and
2811 * fill search info into struct ocfs2_xattr_search.
2813 static int ocfs2_xattr_block_find(struct inode *inode,
2814 int name_index,
2815 const char *name,
2816 struct ocfs2_xattr_search *xs)
2818 struct ocfs2_dinode *di = (struct ocfs2_dinode *)xs->inode_bh->b_data;
2819 struct buffer_head *blk_bh = NULL;
2820 struct ocfs2_xattr_block *xb;
2821 int ret = 0;
2823 if (!di->i_xattr_loc)
2824 return ret;
2826 ret = ocfs2_read_xattr_block(inode, le64_to_cpu(di->i_xattr_loc),
2827 &blk_bh);
2828 if (ret < 0) {
2829 mlog_errno(ret);
2830 return ret;
2833 xs->xattr_bh = blk_bh;
2834 xb = (struct ocfs2_xattr_block *)blk_bh->b_data;
2836 if (!(le16_to_cpu(xb->xb_flags) & OCFS2_XATTR_INDEXED)) {
2837 xs->header = &xb->xb_attrs.xb_header;
2838 xs->base = (void *)xs->header;
2839 xs->end = (void *)(blk_bh->b_data) + blk_bh->b_size;
2840 xs->here = xs->header->xh_entries;
2842 ret = ocfs2_xattr_find_entry(name_index, name, xs);
2843 } else
2844 ret = ocfs2_xattr_index_block_find(inode, blk_bh,
2845 name_index,
2846 name, xs);
2848 if (ret && ret != -ENODATA) {
2849 xs->xattr_bh = NULL;
2850 goto cleanup;
2852 xs->not_found = ret;
2853 return 0;
2854 cleanup:
2855 brelse(blk_bh);
2857 return ret;
2860 static int ocfs2_create_xattr_block(struct inode *inode,
2861 struct buffer_head *inode_bh,
2862 struct ocfs2_xattr_set_ctxt *ctxt,
2863 int indexed,
2864 struct buffer_head **ret_bh)
2866 int ret;
2867 u16 suballoc_bit_start;
2868 u32 num_got;
2869 u64 suballoc_loc, first_blkno;
2870 struct ocfs2_dinode *di = (struct ocfs2_dinode *)inode_bh->b_data;
2871 struct buffer_head *new_bh = NULL;
2872 struct ocfs2_xattr_block *xblk;
2874 ret = ocfs2_journal_access_di(ctxt->handle, INODE_CACHE(inode),
2875 inode_bh, OCFS2_JOURNAL_ACCESS_CREATE);
2876 if (ret < 0) {
2877 mlog_errno(ret);
2878 goto end;
2881 ret = ocfs2_claim_metadata(ctxt->handle, ctxt->meta_ac, 1,
2882 &suballoc_loc, &suballoc_bit_start,
2883 &num_got, &first_blkno);
2884 if (ret < 0) {
2885 mlog_errno(ret);
2886 goto end;
2889 new_bh = sb_getblk(inode->i_sb, first_blkno);
2890 if (!new_bh) {
2891 ret = -ENOMEM;
2892 mlog_errno(ret);
2893 goto end;
2896 ocfs2_set_new_buffer_uptodate(INODE_CACHE(inode), new_bh);
2898 ret = ocfs2_journal_access_xb(ctxt->handle, INODE_CACHE(inode),
2899 new_bh,
2900 OCFS2_JOURNAL_ACCESS_CREATE);
2901 if (ret < 0) {
2902 mlog_errno(ret);
2903 goto end;
2906 /* Initialize ocfs2_xattr_block */
2907 xblk = (struct ocfs2_xattr_block *)new_bh->b_data;
2908 memset(xblk, 0, inode->i_sb->s_blocksize);
2909 strcpy((void *)xblk, OCFS2_XATTR_BLOCK_SIGNATURE);
2910 xblk->xb_suballoc_slot = cpu_to_le16(ctxt->meta_ac->ac_alloc_slot);
2911 xblk->xb_suballoc_loc = cpu_to_le64(suballoc_loc);
2912 xblk->xb_suballoc_bit = cpu_to_le16(suballoc_bit_start);
2913 xblk->xb_fs_generation =
2914 cpu_to_le32(OCFS2_SB(inode->i_sb)->fs_generation);
2915 xblk->xb_blkno = cpu_to_le64(first_blkno);
2916 if (indexed) {
2917 struct ocfs2_xattr_tree_root *xr = &xblk->xb_attrs.xb_root;
2918 xr->xt_clusters = cpu_to_le32(1);
2919 xr->xt_last_eb_blk = 0;
2920 xr->xt_list.l_tree_depth = 0;
2921 xr->xt_list.l_count = cpu_to_le16(
2922 ocfs2_xattr_recs_per_xb(inode->i_sb));
2923 xr->xt_list.l_next_free_rec = cpu_to_le16(1);
2924 xblk->xb_flags = cpu_to_le16(OCFS2_XATTR_INDEXED);
2926 ocfs2_journal_dirty(ctxt->handle, new_bh);
2928 /* Add it to the inode */
2929 di->i_xattr_loc = cpu_to_le64(first_blkno);
2931 spin_lock(&OCFS2_I(inode)->ip_lock);
2932 OCFS2_I(inode)->ip_dyn_features |= OCFS2_HAS_XATTR_FL;
2933 di->i_dyn_features = cpu_to_le16(OCFS2_I(inode)->ip_dyn_features);
2934 spin_unlock(&OCFS2_I(inode)->ip_lock);
2936 ocfs2_journal_dirty(ctxt->handle, inode_bh);
2938 *ret_bh = new_bh;
2939 new_bh = NULL;
2941 end:
2942 brelse(new_bh);
2943 return ret;
2947 * ocfs2_xattr_block_set()
2949 * Set, replace or remove an extended attribute into external block.
2952 static int ocfs2_xattr_block_set(struct inode *inode,
2953 struct ocfs2_xattr_info *xi,
2954 struct ocfs2_xattr_search *xs,
2955 struct ocfs2_xattr_set_ctxt *ctxt)
2957 struct buffer_head *new_bh = NULL;
2958 struct ocfs2_xattr_block *xblk = NULL;
2959 int ret;
2960 struct ocfs2_xa_loc loc;
2962 if (!xs->xattr_bh) {
2963 ret = ocfs2_create_xattr_block(inode, xs->inode_bh, ctxt,
2964 0, &new_bh);
2965 if (ret) {
2966 mlog_errno(ret);
2967 goto end;
2970 xs->xattr_bh = new_bh;
2971 xblk = (struct ocfs2_xattr_block *)xs->xattr_bh->b_data;
2972 xs->header = &xblk->xb_attrs.xb_header;
2973 xs->base = (void *)xs->header;
2974 xs->end = (void *)xblk + inode->i_sb->s_blocksize;
2975 xs->here = xs->header->xh_entries;
2976 } else
2977 xblk = (struct ocfs2_xattr_block *)xs->xattr_bh->b_data;
2979 if (!(le16_to_cpu(xblk->xb_flags) & OCFS2_XATTR_INDEXED)) {
2980 ocfs2_init_xattr_block_xa_loc(&loc, inode, xs->xattr_bh,
2981 xs->not_found ? NULL : xs->here);
2983 ret = ocfs2_xa_set(&loc, xi, ctxt);
2984 if (!ret)
2985 xs->here = loc.xl_entry;
2986 else if ((ret != -ENOSPC) || ctxt->set_abort)
2987 goto end;
2988 else {
2989 ret = ocfs2_xattr_create_index_block(inode, xs, ctxt);
2990 if (ret)
2991 goto end;
2995 if (le16_to_cpu(xblk->xb_flags) & OCFS2_XATTR_INDEXED)
2996 ret = ocfs2_xattr_set_entry_index_block(inode, xi, xs, ctxt);
2998 end:
2999 return ret;
3002 /* Check whether the new xattr can be inserted into the inode. */
3003 static int ocfs2_xattr_can_be_in_inode(struct inode *inode,
3004 struct ocfs2_xattr_info *xi,
3005 struct ocfs2_xattr_search *xs)
3007 struct ocfs2_xattr_entry *last;
3008 int free, i;
3009 size_t min_offs = xs->end - xs->base;
3011 if (!xs->header)
3012 return 0;
3014 last = xs->header->xh_entries;
3016 for (i = 0; i < le16_to_cpu(xs->header->xh_count); i++) {
3017 size_t offs = le16_to_cpu(last->xe_name_offset);
3018 if (offs < min_offs)
3019 min_offs = offs;
3020 last += 1;
3023 free = min_offs - ((void *)last - xs->base) - OCFS2_XATTR_HEADER_GAP;
3024 if (free < 0)
3025 return 0;
3027 BUG_ON(!xs->not_found);
3029 if (free >= (sizeof(struct ocfs2_xattr_entry) + namevalue_size_xi(xi)))
3030 return 1;
3032 return 0;
3035 static int ocfs2_calc_xattr_set_need(struct inode *inode,
3036 struct ocfs2_dinode *di,
3037 struct ocfs2_xattr_info *xi,
3038 struct ocfs2_xattr_search *xis,
3039 struct ocfs2_xattr_search *xbs,
3040 int *clusters_need,
3041 int *meta_need,
3042 int *credits_need)
3044 int ret = 0, old_in_xb = 0;
3045 int clusters_add = 0, meta_add = 0, credits = 0;
3046 struct buffer_head *bh = NULL;
3047 struct ocfs2_xattr_block *xb = NULL;
3048 struct ocfs2_xattr_entry *xe = NULL;
3049 struct ocfs2_xattr_value_root *xv = NULL;
3050 char *base = NULL;
3051 int name_offset, name_len = 0;
3052 u32 new_clusters = ocfs2_clusters_for_bytes(inode->i_sb,
3053 xi->xi_value_len);
3054 u64 value_size;
3057 * Calculate the clusters we need to write.
3058 * No matter whether we replace an old one or add a new one,
3059 * we need this for writing.
3061 if (xi->xi_value_len > OCFS2_XATTR_INLINE_SIZE)
3062 credits += new_clusters *
3063 ocfs2_clusters_to_blocks(inode->i_sb, 1);
3065 if (xis->not_found && xbs->not_found) {
3066 credits += ocfs2_blocks_per_xattr_bucket(inode->i_sb);
3068 if (xi->xi_value_len > OCFS2_XATTR_INLINE_SIZE) {
3069 clusters_add += new_clusters;
3070 credits += ocfs2_calc_extend_credits(inode->i_sb,
3071 &def_xv.xv.xr_list);
3074 goto meta_guess;
3077 if (!xis->not_found) {
3078 xe = xis->here;
3079 name_offset = le16_to_cpu(xe->xe_name_offset);
3080 name_len = OCFS2_XATTR_SIZE(xe->xe_name_len);
3081 base = xis->base;
3082 credits += OCFS2_INODE_UPDATE_CREDITS;
3083 } else {
3084 int i, block_off = 0;
3085 xb = (struct ocfs2_xattr_block *)xbs->xattr_bh->b_data;
3086 xe = xbs->here;
3087 name_offset = le16_to_cpu(xe->xe_name_offset);
3088 name_len = OCFS2_XATTR_SIZE(xe->xe_name_len);
3089 i = xbs->here - xbs->header->xh_entries;
3090 old_in_xb = 1;
3092 if (le16_to_cpu(xb->xb_flags) & OCFS2_XATTR_INDEXED) {
3093 ret = ocfs2_xattr_bucket_get_name_value(inode->i_sb,
3094 bucket_xh(xbs->bucket),
3095 i, &block_off,
3096 &name_offset);
3097 base = bucket_block(xbs->bucket, block_off);
3098 credits += ocfs2_blocks_per_xattr_bucket(inode->i_sb);
3099 } else {
3100 base = xbs->base;
3101 credits += OCFS2_XATTR_BLOCK_UPDATE_CREDITS;
3106 * delete a xattr doesn't need metadata and cluster allocation.
3107 * so just calculate the credits and return.
3109 * The credits for removing the value tree will be extended
3110 * by ocfs2_remove_extent itself.
3112 if (!xi->xi_value) {
3113 if (!ocfs2_xattr_is_local(xe))
3114 credits += ocfs2_remove_extent_credits(inode->i_sb);
3116 goto out;
3119 /* do cluster allocation guess first. */
3120 value_size = le64_to_cpu(xe->xe_value_size);
3122 if (old_in_xb) {
3124 * In xattr set, we always try to set the xe in inode first,
3125 * so if it can be inserted into inode successfully, the old
3126 * one will be removed from the xattr block, and this xattr
3127 * will be inserted into inode as a new xattr in inode.
3129 if (ocfs2_xattr_can_be_in_inode(inode, xi, xis)) {
3130 clusters_add += new_clusters;
3131 credits += ocfs2_remove_extent_credits(inode->i_sb) +
3132 OCFS2_INODE_UPDATE_CREDITS;
3133 if (!ocfs2_xattr_is_local(xe))
3134 credits += ocfs2_calc_extend_credits(
3135 inode->i_sb,
3136 &def_xv.xv.xr_list);
3137 goto out;
3141 if (xi->xi_value_len > OCFS2_XATTR_INLINE_SIZE) {
3142 /* the new values will be stored outside. */
3143 u32 old_clusters = 0;
3145 if (!ocfs2_xattr_is_local(xe)) {
3146 old_clusters = ocfs2_clusters_for_bytes(inode->i_sb,
3147 value_size);
3148 xv = (struct ocfs2_xattr_value_root *)
3149 (base + name_offset + name_len);
3150 value_size = OCFS2_XATTR_ROOT_SIZE;
3151 } else
3152 xv = &def_xv.xv;
3154 if (old_clusters >= new_clusters) {
3155 credits += ocfs2_remove_extent_credits(inode->i_sb);
3156 goto out;
3157 } else {
3158 meta_add += ocfs2_extend_meta_needed(&xv->xr_list);
3159 clusters_add += new_clusters - old_clusters;
3160 credits += ocfs2_calc_extend_credits(inode->i_sb,
3161 &xv->xr_list);
3162 if (value_size >= OCFS2_XATTR_ROOT_SIZE)
3163 goto out;
3165 } else {
3167 * Now the new value will be stored inside. So if the new
3168 * value is smaller than the size of value root or the old
3169 * value, we don't need any allocation, otherwise we have
3170 * to guess metadata allocation.
3172 if ((ocfs2_xattr_is_local(xe) &&
3173 (value_size >= xi->xi_value_len)) ||
3174 (!ocfs2_xattr_is_local(xe) &&
3175 OCFS2_XATTR_ROOT_SIZE >= xi->xi_value_len))
3176 goto out;
3179 meta_guess:
3180 /* calculate metadata allocation. */
3181 if (di->i_xattr_loc) {
3182 if (!xbs->xattr_bh) {
3183 ret = ocfs2_read_xattr_block(inode,
3184 le64_to_cpu(di->i_xattr_loc),
3185 &bh);
3186 if (ret) {
3187 mlog_errno(ret);
3188 goto out;
3191 xb = (struct ocfs2_xattr_block *)bh->b_data;
3192 } else
3193 xb = (struct ocfs2_xattr_block *)xbs->xattr_bh->b_data;
3196 * If there is already an xattr tree, good, we can calculate
3197 * like other b-trees. Otherwise we may have the chance of
3198 * create a tree, the credit calculation is borrowed from
3199 * ocfs2_calc_extend_credits with root_el = NULL. And the
3200 * new tree will be cluster based, so no meta is needed.
3202 if (le16_to_cpu(xb->xb_flags) & OCFS2_XATTR_INDEXED) {
3203 struct ocfs2_extent_list *el =
3204 &xb->xb_attrs.xb_root.xt_list;
3205 meta_add += ocfs2_extend_meta_needed(el);
3206 credits += ocfs2_calc_extend_credits(inode->i_sb,
3207 el);
3208 } else
3209 credits += OCFS2_SUBALLOC_ALLOC + 1;
3212 * This cluster will be used either for new bucket or for
3213 * new xattr block.
3214 * If the cluster size is the same as the bucket size, one
3215 * more is needed since we may need to extend the bucket
3216 * also.
3218 clusters_add += 1;
3219 credits += ocfs2_blocks_per_xattr_bucket(inode->i_sb);
3220 if (OCFS2_XATTR_BUCKET_SIZE ==
3221 OCFS2_SB(inode->i_sb)->s_clustersize) {
3222 credits += ocfs2_blocks_per_xattr_bucket(inode->i_sb);
3223 clusters_add += 1;
3225 } else {
3226 credits += OCFS2_XATTR_BLOCK_CREATE_CREDITS;
3227 if (xi->xi_value_len > OCFS2_XATTR_INLINE_SIZE) {
3228 struct ocfs2_extent_list *el = &def_xv.xv.xr_list;
3229 meta_add += ocfs2_extend_meta_needed(el);
3230 credits += ocfs2_calc_extend_credits(inode->i_sb,
3231 el);
3232 } else {
3233 meta_add += 1;
3236 out:
3237 if (clusters_need)
3238 *clusters_need = clusters_add;
3239 if (meta_need)
3240 *meta_need = meta_add;
3241 if (credits_need)
3242 *credits_need = credits;
3243 brelse(bh);
3244 return ret;
3247 static int ocfs2_init_xattr_set_ctxt(struct inode *inode,
3248 struct ocfs2_dinode *di,
3249 struct ocfs2_xattr_info *xi,
3250 struct ocfs2_xattr_search *xis,
3251 struct ocfs2_xattr_search *xbs,
3252 struct ocfs2_xattr_set_ctxt *ctxt,
3253 int extra_meta,
3254 int *credits)
3256 int clusters_add, meta_add, ret;
3257 struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
3259 memset(ctxt, 0, sizeof(struct ocfs2_xattr_set_ctxt));
3261 ocfs2_init_dealloc_ctxt(&ctxt->dealloc);
3263 ret = ocfs2_calc_xattr_set_need(inode, di, xi, xis, xbs,
3264 &clusters_add, &meta_add, credits);
3265 if (ret) {
3266 mlog_errno(ret);
3267 return ret;
3270 meta_add += extra_meta;
3271 trace_ocfs2_init_xattr_set_ctxt(xi->xi_name, meta_add,
3272 clusters_add, *credits);
3274 if (meta_add) {
3275 ret = ocfs2_reserve_new_metadata_blocks(osb, meta_add,
3276 &ctxt->meta_ac);
3277 if (ret) {
3278 mlog_errno(ret);
3279 goto out;
3283 if (clusters_add) {
3284 ret = ocfs2_reserve_clusters(osb, clusters_add, &ctxt->data_ac);
3285 if (ret)
3286 mlog_errno(ret);
3288 out:
3289 if (ret) {
3290 if (ctxt->meta_ac) {
3291 ocfs2_free_alloc_context(ctxt->meta_ac);
3292 ctxt->meta_ac = NULL;
3296 * We cannot have an error and a non null ctxt->data_ac.
3300 return ret;
3303 static int __ocfs2_xattr_set_handle(struct inode *inode,
3304 struct ocfs2_dinode *di,
3305 struct ocfs2_xattr_info *xi,
3306 struct ocfs2_xattr_search *xis,
3307 struct ocfs2_xattr_search *xbs,
3308 struct ocfs2_xattr_set_ctxt *ctxt)
3310 int ret = 0, credits, old_found;
3312 if (!xi->xi_value) {
3313 /* Remove existing extended attribute */
3314 if (!xis->not_found)
3315 ret = ocfs2_xattr_ibody_set(inode, xi, xis, ctxt);
3316 else if (!xbs->not_found)
3317 ret = ocfs2_xattr_block_set(inode, xi, xbs, ctxt);
3318 } else {
3319 /* We always try to set extended attribute into inode first*/
3320 ret = ocfs2_xattr_ibody_set(inode, xi, xis, ctxt);
3321 if (!ret && !xbs->not_found) {
3323 * If succeed and that extended attribute existing in
3324 * external block, then we will remove it.
3326 xi->xi_value = NULL;
3327 xi->xi_value_len = 0;
3329 old_found = xis->not_found;
3330 xis->not_found = -ENODATA;
3331 ret = ocfs2_calc_xattr_set_need(inode,
3334 xis,
3335 xbs,
3336 NULL,
3337 NULL,
3338 &credits);
3339 xis->not_found = old_found;
3340 if (ret) {
3341 mlog_errno(ret);
3342 goto out;
3345 ret = ocfs2_extend_trans(ctxt->handle, credits);
3346 if (ret) {
3347 mlog_errno(ret);
3348 goto out;
3350 ret = ocfs2_xattr_block_set(inode, xi, xbs, ctxt);
3351 } else if ((ret == -ENOSPC) && !ctxt->set_abort) {
3352 if (di->i_xattr_loc && !xbs->xattr_bh) {
3353 ret = ocfs2_xattr_block_find(inode,
3354 xi->xi_name_index,
3355 xi->xi_name, xbs);
3356 if (ret)
3357 goto out;
3359 old_found = xis->not_found;
3360 xis->not_found = -ENODATA;
3361 ret = ocfs2_calc_xattr_set_need(inode,
3364 xis,
3365 xbs,
3366 NULL,
3367 NULL,
3368 &credits);
3369 xis->not_found = old_found;
3370 if (ret) {
3371 mlog_errno(ret);
3372 goto out;
3375 ret = ocfs2_extend_trans(ctxt->handle, credits);
3376 if (ret) {
3377 mlog_errno(ret);
3378 goto out;
3382 * If no space in inode, we will set extended attribute
3383 * into external block.
3385 ret = ocfs2_xattr_block_set(inode, xi, xbs, ctxt);
3386 if (ret)
3387 goto out;
3388 if (!xis->not_found) {
3390 * If succeed and that extended attribute
3391 * existing in inode, we will remove it.
3393 xi->xi_value = NULL;
3394 xi->xi_value_len = 0;
3395 xbs->not_found = -ENODATA;
3396 ret = ocfs2_calc_xattr_set_need(inode,
3399 xis,
3400 xbs,
3401 NULL,
3402 NULL,
3403 &credits);
3404 if (ret) {
3405 mlog_errno(ret);
3406 goto out;
3409 ret = ocfs2_extend_trans(ctxt->handle, credits);
3410 if (ret) {
3411 mlog_errno(ret);
3412 goto out;
3414 ret = ocfs2_xattr_ibody_set(inode, xi,
3415 xis, ctxt);
3420 if (!ret) {
3421 /* Update inode ctime. */
3422 ret = ocfs2_journal_access_di(ctxt->handle, INODE_CACHE(inode),
3423 xis->inode_bh,
3424 OCFS2_JOURNAL_ACCESS_WRITE);
3425 if (ret) {
3426 mlog_errno(ret);
3427 goto out;
3430 inode->i_ctime = current_time(inode);
3431 di->i_ctime = cpu_to_le64(inode->i_ctime.tv_sec);
3432 di->i_ctime_nsec = cpu_to_le32(inode->i_ctime.tv_nsec);
3433 ocfs2_journal_dirty(ctxt->handle, xis->inode_bh);
3435 out:
3436 return ret;
3440 * This function only called duing creating inode
3441 * for init security/acl xattrs of the new inode.
3442 * All transanction credits have been reserved in mknod.
3444 int ocfs2_xattr_set_handle(handle_t *handle,
3445 struct inode *inode,
3446 struct buffer_head *di_bh,
3447 int name_index,
3448 const char *name,
3449 const void *value,
3450 size_t value_len,
3451 int flags,
3452 struct ocfs2_alloc_context *meta_ac,
3453 struct ocfs2_alloc_context *data_ac)
3455 struct ocfs2_dinode *di;
3456 int ret;
3458 struct ocfs2_xattr_info xi = {
3459 .xi_name_index = name_index,
3460 .xi_name = name,
3461 .xi_name_len = strlen(name),
3462 .xi_value = value,
3463 .xi_value_len = value_len,
3466 struct ocfs2_xattr_search xis = {
3467 .not_found = -ENODATA,
3470 struct ocfs2_xattr_search xbs = {
3471 .not_found = -ENODATA,
3474 struct ocfs2_xattr_set_ctxt ctxt = {
3475 .handle = handle,
3476 .meta_ac = meta_ac,
3477 .data_ac = data_ac,
3480 if (!ocfs2_supports_xattr(OCFS2_SB(inode->i_sb)))
3481 return -EOPNOTSUPP;
3484 * In extreme situation, may need xattr bucket when
3485 * block size is too small. And we have already reserved
3486 * the credits for bucket in mknod.
3488 if (inode->i_sb->s_blocksize == OCFS2_MIN_BLOCKSIZE) {
3489 xbs.bucket = ocfs2_xattr_bucket_new(inode);
3490 if (!xbs.bucket) {
3491 mlog_errno(-ENOMEM);
3492 return -ENOMEM;
3496 xis.inode_bh = xbs.inode_bh = di_bh;
3497 di = (struct ocfs2_dinode *)di_bh->b_data;
3499 down_write(&OCFS2_I(inode)->ip_xattr_sem);
3501 ret = ocfs2_xattr_ibody_find(inode, name_index, name, &xis);
3502 if (ret)
3503 goto cleanup;
3504 if (xis.not_found) {
3505 ret = ocfs2_xattr_block_find(inode, name_index, name, &xbs);
3506 if (ret)
3507 goto cleanup;
3510 ret = __ocfs2_xattr_set_handle(inode, di, &xi, &xis, &xbs, &ctxt);
3512 cleanup:
3513 up_write(&OCFS2_I(inode)->ip_xattr_sem);
3514 brelse(xbs.xattr_bh);
3515 ocfs2_xattr_bucket_free(xbs.bucket);
3517 return ret;
3521 * ocfs2_xattr_set()
3523 * Set, replace or remove an extended attribute for this inode.
3524 * value is NULL to remove an existing extended attribute, else either
3525 * create or replace an extended attribute.
3527 int ocfs2_xattr_set(struct inode *inode,
3528 int name_index,
3529 const char *name,
3530 const void *value,
3531 size_t value_len,
3532 int flags)
3534 struct buffer_head *di_bh = NULL;
3535 struct ocfs2_dinode *di;
3536 int ret, credits, had_lock, ref_meta = 0, ref_credits = 0;
3537 struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
3538 struct inode *tl_inode = osb->osb_tl_inode;
3539 struct ocfs2_xattr_set_ctxt ctxt = { NULL, NULL, NULL, };
3540 struct ocfs2_refcount_tree *ref_tree = NULL;
3541 struct ocfs2_lock_holder oh;
3543 struct ocfs2_xattr_info xi = {
3544 .xi_name_index = name_index,
3545 .xi_name = name,
3546 .xi_name_len = strlen(name),
3547 .xi_value = value,
3548 .xi_value_len = value_len,
3551 struct ocfs2_xattr_search xis = {
3552 .not_found = -ENODATA,
3555 struct ocfs2_xattr_search xbs = {
3556 .not_found = -ENODATA,
3559 if (!ocfs2_supports_xattr(osb))
3560 return -EOPNOTSUPP;
3563 * Only xbs will be used on indexed trees. xis doesn't need a
3564 * bucket.
3566 xbs.bucket = ocfs2_xattr_bucket_new(inode);
3567 if (!xbs.bucket) {
3568 mlog_errno(-ENOMEM);
3569 return -ENOMEM;
3572 had_lock = ocfs2_inode_lock_tracker(inode, &di_bh, 1, &oh);
3573 if (had_lock < 0) {
3574 ret = had_lock;
3575 mlog_errno(ret);
3576 goto cleanup_nolock;
3578 xis.inode_bh = xbs.inode_bh = di_bh;
3579 di = (struct ocfs2_dinode *)di_bh->b_data;
3581 down_write(&OCFS2_I(inode)->ip_xattr_sem);
3583 * Scan inode and external block to find the same name
3584 * extended attribute and collect search information.
3586 ret = ocfs2_xattr_ibody_find(inode, name_index, name, &xis);
3587 if (ret)
3588 goto cleanup;
3589 if (xis.not_found) {
3590 ret = ocfs2_xattr_block_find(inode, name_index, name, &xbs);
3591 if (ret)
3592 goto cleanup;
3595 if (xis.not_found && xbs.not_found) {
3596 ret = -ENODATA;
3597 if (flags & XATTR_REPLACE)
3598 goto cleanup;
3599 ret = 0;
3600 if (!value)
3601 goto cleanup;
3602 } else {
3603 ret = -EEXIST;
3604 if (flags & XATTR_CREATE)
3605 goto cleanup;
3608 /* Check whether the value is refcounted and do some preparation. */
3609 if (ocfs2_is_refcount_inode(inode) &&
3610 (!xis.not_found || !xbs.not_found)) {
3611 ret = ocfs2_prepare_refcount_xattr(inode, di, &xi,
3612 &xis, &xbs, &ref_tree,
3613 &ref_meta, &ref_credits);
3614 if (ret) {
3615 mlog_errno(ret);
3616 goto cleanup;
3620 inode_lock(tl_inode);
3622 if (ocfs2_truncate_log_needs_flush(osb)) {
3623 ret = __ocfs2_flush_truncate_log(osb);
3624 if (ret < 0) {
3625 inode_unlock(tl_inode);
3626 mlog_errno(ret);
3627 goto cleanup;
3630 inode_unlock(tl_inode);
3632 ret = ocfs2_init_xattr_set_ctxt(inode, di, &xi, &xis,
3633 &xbs, &ctxt, ref_meta, &credits);
3634 if (ret) {
3635 mlog_errno(ret);
3636 goto cleanup;
3639 /* we need to update inode's ctime field, so add credit for it. */
3640 credits += OCFS2_INODE_UPDATE_CREDITS;
3641 ctxt.handle = ocfs2_start_trans(osb, credits + ref_credits);
3642 if (IS_ERR(ctxt.handle)) {
3643 ret = PTR_ERR(ctxt.handle);
3644 mlog_errno(ret);
3645 goto out_free_ac;
3648 ret = __ocfs2_xattr_set_handle(inode, di, &xi, &xis, &xbs, &ctxt);
3649 ocfs2_update_inode_fsync_trans(ctxt.handle, inode, 0);
3651 ocfs2_commit_trans(osb, ctxt.handle);
3653 out_free_ac:
3654 if (ctxt.data_ac)
3655 ocfs2_free_alloc_context(ctxt.data_ac);
3656 if (ctxt.meta_ac)
3657 ocfs2_free_alloc_context(ctxt.meta_ac);
3658 if (ocfs2_dealloc_has_cluster(&ctxt.dealloc))
3659 ocfs2_schedule_truncate_log_flush(osb, 1);
3660 ocfs2_run_deallocs(osb, &ctxt.dealloc);
3662 cleanup:
3663 if (ref_tree)
3664 ocfs2_unlock_refcount_tree(osb, ref_tree, 1);
3665 up_write(&OCFS2_I(inode)->ip_xattr_sem);
3666 if (!value && !ret) {
3667 ret = ocfs2_try_remove_refcount_tree(inode, di_bh);
3668 if (ret)
3669 mlog_errno(ret);
3671 ocfs2_inode_unlock_tracker(inode, 1, &oh, had_lock);
3672 cleanup_nolock:
3673 brelse(di_bh);
3674 brelse(xbs.xattr_bh);
3675 ocfs2_xattr_bucket_free(xbs.bucket);
3677 return ret;
3681 * Find the xattr extent rec which may contains name_hash.
3682 * e_cpos will be the first name hash of the xattr rec.
3683 * el must be the ocfs2_xattr_header.xb_attrs.xb_root.xt_list.
3685 static int ocfs2_xattr_get_rec(struct inode *inode,
3686 u32 name_hash,
3687 u64 *p_blkno,
3688 u32 *e_cpos,
3689 u32 *num_clusters,
3690 struct ocfs2_extent_list *el)
3692 int ret = 0, i;
3693 struct buffer_head *eb_bh = NULL;
3694 struct ocfs2_extent_block *eb;
3695 struct ocfs2_extent_rec *rec = NULL;
3696 u64 e_blkno = 0;
3698 if (el->l_tree_depth) {
3699 ret = ocfs2_find_leaf(INODE_CACHE(inode), el, name_hash,
3700 &eb_bh);
3701 if (ret) {
3702 mlog_errno(ret);
3703 goto out;
3706 eb = (struct ocfs2_extent_block *) eb_bh->b_data;
3707 el = &eb->h_list;
3709 if (el->l_tree_depth) {
3710 ret = ocfs2_error(inode->i_sb,
3711 "Inode %lu has non zero tree depth in xattr tree block %llu\n",
3712 inode->i_ino,
3713 (unsigned long long)eb_bh->b_blocknr);
3714 goto out;
3718 for (i = le16_to_cpu(el->l_next_free_rec) - 1; i >= 0; i--) {
3719 rec = &el->l_recs[i];
3721 if (le32_to_cpu(rec->e_cpos) <= name_hash) {
3722 e_blkno = le64_to_cpu(rec->e_blkno);
3723 break;
3727 if (!e_blkno) {
3728 ret = ocfs2_error(inode->i_sb, "Inode %lu has bad extent record (%u, %u, 0) in xattr\n",
3729 inode->i_ino,
3730 le32_to_cpu(rec->e_cpos),
3731 ocfs2_rec_clusters(el, rec));
3732 goto out;
3735 *p_blkno = le64_to_cpu(rec->e_blkno);
3736 *num_clusters = le16_to_cpu(rec->e_leaf_clusters);
3737 if (e_cpos)
3738 *e_cpos = le32_to_cpu(rec->e_cpos);
3739 out:
3740 brelse(eb_bh);
3741 return ret;
3744 typedef int (xattr_bucket_func)(struct inode *inode,
3745 struct ocfs2_xattr_bucket *bucket,
3746 void *para);
3748 static int ocfs2_find_xe_in_bucket(struct inode *inode,
3749 struct ocfs2_xattr_bucket *bucket,
3750 int name_index,
3751 const char *name,
3752 u32 name_hash,
3753 u16 *xe_index,
3754 int *found)
3756 int i, ret = 0, cmp = 1, block_off, new_offset;
3757 struct ocfs2_xattr_header *xh = bucket_xh(bucket);
3758 size_t name_len = strlen(name);
3759 struct ocfs2_xattr_entry *xe = NULL;
3760 char *xe_name;
3763 * We don't use binary search in the bucket because there
3764 * may be multiple entries with the same name hash.
3766 for (i = 0; i < le16_to_cpu(xh->xh_count); i++) {
3767 xe = &xh->xh_entries[i];
3769 if (name_hash > le32_to_cpu(xe->xe_name_hash))
3770 continue;
3771 else if (name_hash < le32_to_cpu(xe->xe_name_hash))
3772 break;
3774 cmp = name_index - ocfs2_xattr_get_type(xe);
3775 if (!cmp)
3776 cmp = name_len - xe->xe_name_len;
3777 if (cmp)
3778 continue;
3780 ret = ocfs2_xattr_bucket_get_name_value(inode->i_sb,
3783 &block_off,
3784 &new_offset);
3785 if (ret) {
3786 mlog_errno(ret);
3787 break;
3791 xe_name = bucket_block(bucket, block_off) + new_offset;
3792 if (!memcmp(name, xe_name, name_len)) {
3793 *xe_index = i;
3794 *found = 1;
3795 ret = 0;
3796 break;
3800 return ret;
3804 * Find the specified xattr entry in a series of buckets.
3805 * This series start from p_blkno and last for num_clusters.
3806 * The ocfs2_xattr_header.xh_num_buckets of the first bucket contains
3807 * the num of the valid buckets.
3809 * Return the buffer_head this xattr should reside in. And if the xattr's
3810 * hash is in the gap of 2 buckets, return the lower bucket.
3812 static int ocfs2_xattr_bucket_find(struct inode *inode,
3813 int name_index,
3814 const char *name,
3815 u32 name_hash,
3816 u64 p_blkno,
3817 u32 first_hash,
3818 u32 num_clusters,
3819 struct ocfs2_xattr_search *xs)
3821 int ret, found = 0;
3822 struct ocfs2_xattr_header *xh = NULL;
3823 struct ocfs2_xattr_entry *xe = NULL;
3824 u16 index = 0;
3825 u16 blk_per_bucket = ocfs2_blocks_per_xattr_bucket(inode->i_sb);
3826 int low_bucket = 0, bucket, high_bucket;
3827 struct ocfs2_xattr_bucket *search;
3828 u32 last_hash;
3829 u64 blkno, lower_blkno = 0;
3831 search = ocfs2_xattr_bucket_new(inode);
3832 if (!search) {
3833 ret = -ENOMEM;
3834 mlog_errno(ret);
3835 goto out;
3838 ret = ocfs2_read_xattr_bucket(search, p_blkno);
3839 if (ret) {
3840 mlog_errno(ret);
3841 goto out;
3844 xh = bucket_xh(search);
3845 high_bucket = le16_to_cpu(xh->xh_num_buckets) - 1;
3846 while (low_bucket <= high_bucket) {
3847 ocfs2_xattr_bucket_relse(search);
3849 bucket = (low_bucket + high_bucket) / 2;
3850 blkno = p_blkno + bucket * blk_per_bucket;
3851 ret = ocfs2_read_xattr_bucket(search, blkno);
3852 if (ret) {
3853 mlog_errno(ret);
3854 goto out;
3857 xh = bucket_xh(search);
3858 xe = &xh->xh_entries[0];
3859 if (name_hash < le32_to_cpu(xe->xe_name_hash)) {
3860 high_bucket = bucket - 1;
3861 continue;
3865 * Check whether the hash of the last entry in our
3866 * bucket is larger than the search one. for an empty
3867 * bucket, the last one is also the first one.
3869 if (xh->xh_count)
3870 xe = &xh->xh_entries[le16_to_cpu(xh->xh_count) - 1];
3872 last_hash = le32_to_cpu(xe->xe_name_hash);
3874 /* record lower_blkno which may be the insert place. */
3875 lower_blkno = blkno;
3877 if (name_hash > le32_to_cpu(xe->xe_name_hash)) {
3878 low_bucket = bucket + 1;
3879 continue;
3882 /* the searched xattr should reside in this bucket if exists. */
3883 ret = ocfs2_find_xe_in_bucket(inode, search,
3884 name_index, name, name_hash,
3885 &index, &found);
3886 if (ret) {
3887 mlog_errno(ret);
3888 goto out;
3890 break;
3894 * Record the bucket we have found.
3895 * When the xattr's hash value is in the gap of 2 buckets, we will
3896 * always set it to the previous bucket.
3898 if (!lower_blkno)
3899 lower_blkno = p_blkno;
3901 /* This should be in cache - we just read it during the search */
3902 ret = ocfs2_read_xattr_bucket(xs->bucket, lower_blkno);
3903 if (ret) {
3904 mlog_errno(ret);
3905 goto out;
3908 xs->header = bucket_xh(xs->bucket);
3909 xs->base = bucket_block(xs->bucket, 0);
3910 xs->end = xs->base + inode->i_sb->s_blocksize;
3912 if (found) {
3913 xs->here = &xs->header->xh_entries[index];
3914 trace_ocfs2_xattr_bucket_find(OCFS2_I(inode)->ip_blkno,
3915 name, name_index, name_hash,
3916 (unsigned long long)bucket_blkno(xs->bucket),
3917 index);
3918 } else
3919 ret = -ENODATA;
3921 out:
3922 ocfs2_xattr_bucket_free(search);
3923 return ret;
3926 static int ocfs2_xattr_index_block_find(struct inode *inode,
3927 struct buffer_head *root_bh,
3928 int name_index,
3929 const char *name,
3930 struct ocfs2_xattr_search *xs)
3932 int ret;
3933 struct ocfs2_xattr_block *xb =
3934 (struct ocfs2_xattr_block *)root_bh->b_data;
3935 struct ocfs2_xattr_tree_root *xb_root = &xb->xb_attrs.xb_root;
3936 struct ocfs2_extent_list *el = &xb_root->xt_list;
3937 u64 p_blkno = 0;
3938 u32 first_hash, num_clusters = 0;
3939 u32 name_hash = ocfs2_xattr_name_hash(inode, name, strlen(name));
3941 if (le16_to_cpu(el->l_next_free_rec) == 0)
3942 return -ENODATA;
3944 trace_ocfs2_xattr_index_block_find(OCFS2_I(inode)->ip_blkno,
3945 name, name_index, name_hash,
3946 (unsigned long long)root_bh->b_blocknr,
3947 -1);
3949 ret = ocfs2_xattr_get_rec(inode, name_hash, &p_blkno, &first_hash,
3950 &num_clusters, el);
3951 if (ret) {
3952 mlog_errno(ret);
3953 goto out;
3956 BUG_ON(p_blkno == 0 || num_clusters == 0 || first_hash > name_hash);
3958 trace_ocfs2_xattr_index_block_find_rec(OCFS2_I(inode)->ip_blkno,
3959 name, name_index, first_hash,
3960 (unsigned long long)p_blkno,
3961 num_clusters);
3963 ret = ocfs2_xattr_bucket_find(inode, name_index, name, name_hash,
3964 p_blkno, first_hash, num_clusters, xs);
3966 out:
3967 return ret;
3970 static int ocfs2_iterate_xattr_buckets(struct inode *inode,
3971 u64 blkno,
3972 u32 clusters,
3973 xattr_bucket_func *func,
3974 void *para)
3976 int i, ret = 0;
3977 u32 bpc = ocfs2_xattr_buckets_per_cluster(OCFS2_SB(inode->i_sb));
3978 u32 num_buckets = clusters * bpc;
3979 struct ocfs2_xattr_bucket *bucket;
3981 bucket = ocfs2_xattr_bucket_new(inode);
3982 if (!bucket) {
3983 mlog_errno(-ENOMEM);
3984 return -ENOMEM;
3987 trace_ocfs2_iterate_xattr_buckets(
3988 (unsigned long long)OCFS2_I(inode)->ip_blkno,
3989 (unsigned long long)blkno, clusters);
3991 for (i = 0; i < num_buckets; i++, blkno += bucket->bu_blocks) {
3992 ret = ocfs2_read_xattr_bucket(bucket, blkno);
3993 if (ret) {
3994 mlog_errno(ret);
3995 break;
3999 * The real bucket num in this series of blocks is stored
4000 * in the 1st bucket.
4002 if (i == 0)
4003 num_buckets = le16_to_cpu(bucket_xh(bucket)->xh_num_buckets);
4005 trace_ocfs2_iterate_xattr_bucket((unsigned long long)blkno,
4006 le32_to_cpu(bucket_xh(bucket)->xh_entries[0].xe_name_hash));
4007 if (func) {
4008 ret = func(inode, bucket, para);
4009 if (ret && ret != -ERANGE)
4010 mlog_errno(ret);
4011 /* Fall through to bucket_relse() */
4014 ocfs2_xattr_bucket_relse(bucket);
4015 if (ret)
4016 break;
4019 ocfs2_xattr_bucket_free(bucket);
4020 return ret;
4023 struct ocfs2_xattr_tree_list {
4024 char *buffer;
4025 size_t buffer_size;
4026 size_t result;
4029 static int ocfs2_xattr_bucket_get_name_value(struct super_block *sb,
4030 struct ocfs2_xattr_header *xh,
4031 int index,
4032 int *block_off,
4033 int *new_offset)
4035 u16 name_offset;
4037 if (index < 0 || index >= le16_to_cpu(xh->xh_count))
4038 return -EINVAL;
4040 name_offset = le16_to_cpu(xh->xh_entries[index].xe_name_offset);
4042 *block_off = name_offset >> sb->s_blocksize_bits;
4043 *new_offset = name_offset % sb->s_blocksize;
4045 return 0;
4048 static int ocfs2_list_xattr_bucket(struct inode *inode,
4049 struct ocfs2_xattr_bucket *bucket,
4050 void *para)
4052 int ret = 0, type;
4053 struct ocfs2_xattr_tree_list *xl = (struct ocfs2_xattr_tree_list *)para;
4054 int i, block_off, new_offset;
4055 const char *name;
4057 for (i = 0 ; i < le16_to_cpu(bucket_xh(bucket)->xh_count); i++) {
4058 struct ocfs2_xattr_entry *entry = &bucket_xh(bucket)->xh_entries[i];
4059 type = ocfs2_xattr_get_type(entry);
4061 ret = ocfs2_xattr_bucket_get_name_value(inode->i_sb,
4062 bucket_xh(bucket),
4064 &block_off,
4065 &new_offset);
4066 if (ret)
4067 break;
4069 name = (const char *)bucket_block(bucket, block_off) +
4070 new_offset;
4071 ret = ocfs2_xattr_list_entry(inode->i_sb,
4072 xl->buffer,
4073 xl->buffer_size,
4074 &xl->result,
4075 type, name,
4076 entry->xe_name_len);
4077 if (ret)
4078 break;
4081 return ret;
4084 static int ocfs2_iterate_xattr_index_block(struct inode *inode,
4085 struct buffer_head *blk_bh,
4086 xattr_tree_rec_func *rec_func,
4087 void *para)
4089 struct ocfs2_xattr_block *xb =
4090 (struct ocfs2_xattr_block *)blk_bh->b_data;
4091 struct ocfs2_extent_list *el = &xb->xb_attrs.xb_root.xt_list;
4092 int ret = 0;
4093 u32 name_hash = UINT_MAX, e_cpos = 0, num_clusters = 0;
4094 u64 p_blkno = 0;
4096 if (!el->l_next_free_rec || !rec_func)
4097 return 0;
4099 while (name_hash > 0) {
4100 ret = ocfs2_xattr_get_rec(inode, name_hash, &p_blkno,
4101 &e_cpos, &num_clusters, el);
4102 if (ret) {
4103 mlog_errno(ret);
4104 break;
4107 ret = rec_func(inode, blk_bh, p_blkno, e_cpos,
4108 num_clusters, para);
4109 if (ret) {
4110 if (ret != -ERANGE)
4111 mlog_errno(ret);
4112 break;
4115 if (e_cpos == 0)
4116 break;
4118 name_hash = e_cpos - 1;
4121 return ret;
4125 static int ocfs2_list_xattr_tree_rec(struct inode *inode,
4126 struct buffer_head *root_bh,
4127 u64 blkno, u32 cpos, u32 len, void *para)
4129 return ocfs2_iterate_xattr_buckets(inode, blkno, len,
4130 ocfs2_list_xattr_bucket, para);
4133 static int ocfs2_xattr_tree_list_index_block(struct inode *inode,
4134 struct buffer_head *blk_bh,
4135 char *buffer,
4136 size_t buffer_size)
4138 int ret;
4139 struct ocfs2_xattr_tree_list xl = {
4140 .buffer = buffer,
4141 .buffer_size = buffer_size,
4142 .result = 0,
4145 ret = ocfs2_iterate_xattr_index_block(inode, blk_bh,
4146 ocfs2_list_xattr_tree_rec, &xl);
4147 if (ret) {
4148 mlog_errno(ret);
4149 goto out;
4152 ret = xl.result;
4153 out:
4154 return ret;
4157 static int cmp_xe(const void *a, const void *b)
4159 const struct ocfs2_xattr_entry *l = a, *r = b;
4160 u32 l_hash = le32_to_cpu(l->xe_name_hash);
4161 u32 r_hash = le32_to_cpu(r->xe_name_hash);
4163 if (l_hash > r_hash)
4164 return 1;
4165 if (l_hash < r_hash)
4166 return -1;
4167 return 0;
4170 static void swap_xe(void *a, void *b, int size)
4172 struct ocfs2_xattr_entry *l = a, *r = b, tmp;
4174 tmp = *l;
4175 memcpy(l, r, sizeof(struct ocfs2_xattr_entry));
4176 memcpy(r, &tmp, sizeof(struct ocfs2_xattr_entry));
4180 * When the ocfs2_xattr_block is filled up, new bucket will be created
4181 * and all the xattr entries will be moved to the new bucket.
4182 * The header goes at the start of the bucket, and the names+values are
4183 * filled from the end. This is why *target starts as the last buffer.
4184 * Note: we need to sort the entries since they are not saved in order
4185 * in the ocfs2_xattr_block.
4187 static void ocfs2_cp_xattr_block_to_bucket(struct inode *inode,
4188 struct buffer_head *xb_bh,
4189 struct ocfs2_xattr_bucket *bucket)
4191 int i, blocksize = inode->i_sb->s_blocksize;
4192 int blks = ocfs2_blocks_per_xattr_bucket(inode->i_sb);
4193 u16 offset, size, off_change;
4194 struct ocfs2_xattr_entry *xe;
4195 struct ocfs2_xattr_block *xb =
4196 (struct ocfs2_xattr_block *)xb_bh->b_data;
4197 struct ocfs2_xattr_header *xb_xh = &xb->xb_attrs.xb_header;
4198 struct ocfs2_xattr_header *xh = bucket_xh(bucket);
4199 u16 count = le16_to_cpu(xb_xh->xh_count);
4200 char *src = xb_bh->b_data;
4201 char *target = bucket_block(bucket, blks - 1);
4203 trace_ocfs2_cp_xattr_block_to_bucket_begin(
4204 (unsigned long long)xb_bh->b_blocknr,
4205 (unsigned long long)bucket_blkno(bucket));
4207 for (i = 0; i < blks; i++)
4208 memset(bucket_block(bucket, i), 0, blocksize);
4211 * Since the xe_name_offset is based on ocfs2_xattr_header,
4212 * there is a offset change corresponding to the change of
4213 * ocfs2_xattr_header's position.
4215 off_change = offsetof(struct ocfs2_xattr_block, xb_attrs.xb_header);
4216 xe = &xb_xh->xh_entries[count - 1];
4217 offset = le16_to_cpu(xe->xe_name_offset) + off_change;
4218 size = blocksize - offset;
4220 /* copy all the names and values. */
4221 memcpy(target + offset, src + offset, size);
4223 /* Init new header now. */
4224 xh->xh_count = xb_xh->xh_count;
4225 xh->xh_num_buckets = cpu_to_le16(1);
4226 xh->xh_name_value_len = cpu_to_le16(size);
4227 xh->xh_free_start = cpu_to_le16(OCFS2_XATTR_BUCKET_SIZE - size);
4229 /* copy all the entries. */
4230 target = bucket_block(bucket, 0);
4231 offset = offsetof(struct ocfs2_xattr_header, xh_entries);
4232 size = count * sizeof(struct ocfs2_xattr_entry);
4233 memcpy(target + offset, (char *)xb_xh + offset, size);
4235 /* Change the xe offset for all the xe because of the move. */
4236 off_change = OCFS2_XATTR_BUCKET_SIZE - blocksize +
4237 offsetof(struct ocfs2_xattr_block, xb_attrs.xb_header);
4238 for (i = 0; i < count; i++)
4239 le16_add_cpu(&xh->xh_entries[i].xe_name_offset, off_change);
4241 trace_ocfs2_cp_xattr_block_to_bucket_end(offset, size, off_change);
4243 sort(target + offset, count, sizeof(struct ocfs2_xattr_entry),
4244 cmp_xe, swap_xe);
4248 * After we move xattr from block to index btree, we have to
4249 * update ocfs2_xattr_search to the new xe and base.
4251 * When the entry is in xattr block, xattr_bh indicates the storage place.
4252 * While if the entry is in index b-tree, "bucket" indicates the
4253 * real place of the xattr.
4255 static void ocfs2_xattr_update_xattr_search(struct inode *inode,
4256 struct ocfs2_xattr_search *xs,
4257 struct buffer_head *old_bh)
4259 char *buf = old_bh->b_data;
4260 struct ocfs2_xattr_block *old_xb = (struct ocfs2_xattr_block *)buf;
4261 struct ocfs2_xattr_header *old_xh = &old_xb->xb_attrs.xb_header;
4262 int i;
4264 xs->header = bucket_xh(xs->bucket);
4265 xs->base = bucket_block(xs->bucket, 0);
4266 xs->end = xs->base + inode->i_sb->s_blocksize;
4268 if (xs->not_found)
4269 return;
4271 i = xs->here - old_xh->xh_entries;
4272 xs->here = &xs->header->xh_entries[i];
4275 static int ocfs2_xattr_create_index_block(struct inode *inode,
4276 struct ocfs2_xattr_search *xs,
4277 struct ocfs2_xattr_set_ctxt *ctxt)
4279 int ret;
4280 u32 bit_off, len;
4281 u64 blkno;
4282 handle_t *handle = ctxt->handle;
4283 struct ocfs2_inode_info *oi = OCFS2_I(inode);
4284 struct buffer_head *xb_bh = xs->xattr_bh;
4285 struct ocfs2_xattr_block *xb =
4286 (struct ocfs2_xattr_block *)xb_bh->b_data;
4287 struct ocfs2_xattr_tree_root *xr;
4288 u16 xb_flags = le16_to_cpu(xb->xb_flags);
4290 trace_ocfs2_xattr_create_index_block_begin(
4291 (unsigned long long)xb_bh->b_blocknr);
4293 BUG_ON(xb_flags & OCFS2_XATTR_INDEXED);
4294 BUG_ON(!xs->bucket);
4297 * XXX:
4298 * We can use this lock for now, and maybe move to a dedicated mutex
4299 * if performance becomes a problem later.
4301 down_write(&oi->ip_alloc_sem);
4303 ret = ocfs2_journal_access_xb(handle, INODE_CACHE(inode), xb_bh,
4304 OCFS2_JOURNAL_ACCESS_WRITE);
4305 if (ret) {
4306 mlog_errno(ret);
4307 goto out;
4310 ret = __ocfs2_claim_clusters(handle, ctxt->data_ac,
4311 1, 1, &bit_off, &len);
4312 if (ret) {
4313 mlog_errno(ret);
4314 goto out;
4318 * The bucket may spread in many blocks, and
4319 * we will only touch the 1st block and the last block
4320 * in the whole bucket(one for entry and one for data).
4322 blkno = ocfs2_clusters_to_blocks(inode->i_sb, bit_off);
4324 trace_ocfs2_xattr_create_index_block((unsigned long long)blkno);
4326 ret = ocfs2_init_xattr_bucket(xs->bucket, blkno, 1);
4327 if (ret) {
4328 mlog_errno(ret);
4329 goto out;
4332 ret = ocfs2_xattr_bucket_journal_access(handle, xs->bucket,
4333 OCFS2_JOURNAL_ACCESS_CREATE);
4334 if (ret) {
4335 mlog_errno(ret);
4336 goto out;
4339 ocfs2_cp_xattr_block_to_bucket(inode, xb_bh, xs->bucket);
4340 ocfs2_xattr_bucket_journal_dirty(handle, xs->bucket);
4342 ocfs2_xattr_update_xattr_search(inode, xs, xb_bh);
4344 /* Change from ocfs2_xattr_header to ocfs2_xattr_tree_root */
4345 memset(&xb->xb_attrs, 0, inode->i_sb->s_blocksize -
4346 offsetof(struct ocfs2_xattr_block, xb_attrs));
4348 xr = &xb->xb_attrs.xb_root;
4349 xr->xt_clusters = cpu_to_le32(1);
4350 xr->xt_last_eb_blk = 0;
4351 xr->xt_list.l_tree_depth = 0;
4352 xr->xt_list.l_count = cpu_to_le16(ocfs2_xattr_recs_per_xb(inode->i_sb));
4353 xr->xt_list.l_next_free_rec = cpu_to_le16(1);
4355 xr->xt_list.l_recs[0].e_cpos = 0;
4356 xr->xt_list.l_recs[0].e_blkno = cpu_to_le64(blkno);
4357 xr->xt_list.l_recs[0].e_leaf_clusters = cpu_to_le16(1);
4359 xb->xb_flags = cpu_to_le16(xb_flags | OCFS2_XATTR_INDEXED);
4361 ocfs2_journal_dirty(handle, xb_bh);
4363 out:
4364 up_write(&oi->ip_alloc_sem);
4366 return ret;
4369 static int cmp_xe_offset(const void *a, const void *b)
4371 const struct ocfs2_xattr_entry *l = a, *r = b;
4372 u32 l_name_offset = le16_to_cpu(l->xe_name_offset);
4373 u32 r_name_offset = le16_to_cpu(r->xe_name_offset);
4375 if (l_name_offset < r_name_offset)
4376 return 1;
4377 if (l_name_offset > r_name_offset)
4378 return -1;
4379 return 0;
4383 * defrag a xattr bucket if we find that the bucket has some
4384 * holes beteen name/value pairs.
4385 * We will move all the name/value pairs to the end of the bucket
4386 * so that we can spare some space for insertion.
4388 static int ocfs2_defrag_xattr_bucket(struct inode *inode,
4389 handle_t *handle,
4390 struct ocfs2_xattr_bucket *bucket)
4392 int ret, i;
4393 size_t end, offset, len;
4394 struct ocfs2_xattr_header *xh;
4395 char *entries, *buf, *bucket_buf = NULL;
4396 u64 blkno = bucket_blkno(bucket);
4397 u16 xh_free_start;
4398 size_t blocksize = inode->i_sb->s_blocksize;
4399 struct ocfs2_xattr_entry *xe;
4402 * In order to make the operation more efficient and generic,
4403 * we copy all the blocks into a contiguous memory and do the
4404 * defragment there, so if anything is error, we will not touch
4405 * the real block.
4407 bucket_buf = kmalloc(OCFS2_XATTR_BUCKET_SIZE, GFP_NOFS);
4408 if (!bucket_buf) {
4409 ret = -EIO;
4410 goto out;
4413 buf = bucket_buf;
4414 for (i = 0; i < bucket->bu_blocks; i++, buf += blocksize)
4415 memcpy(buf, bucket_block(bucket, i), blocksize);
4417 ret = ocfs2_xattr_bucket_journal_access(handle, bucket,
4418 OCFS2_JOURNAL_ACCESS_WRITE);
4419 if (ret < 0) {
4420 mlog_errno(ret);
4421 goto out;
4424 xh = (struct ocfs2_xattr_header *)bucket_buf;
4425 entries = (char *)xh->xh_entries;
4426 xh_free_start = le16_to_cpu(xh->xh_free_start);
4428 trace_ocfs2_defrag_xattr_bucket(
4429 (unsigned long long)blkno, le16_to_cpu(xh->xh_count),
4430 xh_free_start, le16_to_cpu(xh->xh_name_value_len));
4433 * sort all the entries by their offset.
4434 * the largest will be the first, so that we can
4435 * move them to the end one by one.
4437 sort(entries, le16_to_cpu(xh->xh_count),
4438 sizeof(struct ocfs2_xattr_entry),
4439 cmp_xe_offset, swap_xe);
4441 /* Move all name/values to the end of the bucket. */
4442 xe = xh->xh_entries;
4443 end = OCFS2_XATTR_BUCKET_SIZE;
4444 for (i = 0; i < le16_to_cpu(xh->xh_count); i++, xe++) {
4445 offset = le16_to_cpu(xe->xe_name_offset);
4446 len = namevalue_size_xe(xe);
4449 * We must make sure that the name/value pair
4450 * exist in the same block. So adjust end to
4451 * the previous block end if needed.
4453 if (((end - len) / blocksize !=
4454 (end - 1) / blocksize))
4455 end = end - end % blocksize;
4457 if (end > offset + len) {
4458 memmove(bucket_buf + end - len,
4459 bucket_buf + offset, len);
4460 xe->xe_name_offset = cpu_to_le16(end - len);
4463 mlog_bug_on_msg(end < offset + len, "Defrag check failed for "
4464 "bucket %llu\n", (unsigned long long)blkno);
4466 end -= len;
4469 mlog_bug_on_msg(xh_free_start > end, "Defrag check failed for "
4470 "bucket %llu\n", (unsigned long long)blkno);
4472 if (xh_free_start == end)
4473 goto out;
4475 memset(bucket_buf + xh_free_start, 0, end - xh_free_start);
4476 xh->xh_free_start = cpu_to_le16(end);
4478 /* sort the entries by their name_hash. */
4479 sort(entries, le16_to_cpu(xh->xh_count),
4480 sizeof(struct ocfs2_xattr_entry),
4481 cmp_xe, swap_xe);
4483 buf = bucket_buf;
4484 for (i = 0; i < bucket->bu_blocks; i++, buf += blocksize)
4485 memcpy(bucket_block(bucket, i), buf, blocksize);
4486 ocfs2_xattr_bucket_journal_dirty(handle, bucket);
4488 out:
4489 kfree(bucket_buf);
4490 return ret;
4494 * prev_blkno points to the start of an existing extent. new_blkno
4495 * points to a newly allocated extent. Because we know each of our
4496 * clusters contains more than bucket, we can easily split one cluster
4497 * at a bucket boundary. So we take the last cluster of the existing
4498 * extent and split it down the middle. We move the last half of the
4499 * buckets in the last cluster of the existing extent over to the new
4500 * extent.
4502 * first_bh is the buffer at prev_blkno so we can update the existing
4503 * extent's bucket count. header_bh is the bucket were we were hoping
4504 * to insert our xattr. If the bucket move places the target in the new
4505 * extent, we'll update first_bh and header_bh after modifying the old
4506 * extent.
4508 * first_hash will be set as the 1st xe's name_hash in the new extent.
4510 static int ocfs2_mv_xattr_bucket_cross_cluster(struct inode *inode,
4511 handle_t *handle,
4512 struct ocfs2_xattr_bucket *first,
4513 struct ocfs2_xattr_bucket *target,
4514 u64 new_blkno,
4515 u32 num_clusters,
4516 u32 *first_hash)
4518 int ret;
4519 struct super_block *sb = inode->i_sb;
4520 int blks_per_bucket = ocfs2_blocks_per_xattr_bucket(sb);
4521 int num_buckets = ocfs2_xattr_buckets_per_cluster(OCFS2_SB(sb));
4522 int to_move = num_buckets / 2;
4523 u64 src_blkno;
4524 u64 last_cluster_blkno = bucket_blkno(first) +
4525 ((num_clusters - 1) * ocfs2_clusters_to_blocks(sb, 1));
4527 BUG_ON(le16_to_cpu(bucket_xh(first)->xh_num_buckets) < num_buckets);
4528 BUG_ON(OCFS2_XATTR_BUCKET_SIZE == OCFS2_SB(sb)->s_clustersize);
4530 trace_ocfs2_mv_xattr_bucket_cross_cluster(
4531 (unsigned long long)last_cluster_blkno,
4532 (unsigned long long)new_blkno);
4534 ret = ocfs2_mv_xattr_buckets(inode, handle, bucket_blkno(first),
4535 last_cluster_blkno, new_blkno,
4536 to_move, first_hash);
4537 if (ret) {
4538 mlog_errno(ret);
4539 goto out;
4542 /* This is the first bucket that got moved */
4543 src_blkno = last_cluster_blkno + (to_move * blks_per_bucket);
4546 * If the target bucket was part of the moved buckets, we need to
4547 * update first and target.
4549 if (bucket_blkno(target) >= src_blkno) {
4550 /* Find the block for the new target bucket */
4551 src_blkno = new_blkno +
4552 (bucket_blkno(target) - src_blkno);
4554 ocfs2_xattr_bucket_relse(first);
4555 ocfs2_xattr_bucket_relse(target);
4558 * These shouldn't fail - the buffers are in the
4559 * journal from ocfs2_cp_xattr_bucket().
4561 ret = ocfs2_read_xattr_bucket(first, new_blkno);
4562 if (ret) {
4563 mlog_errno(ret);
4564 goto out;
4566 ret = ocfs2_read_xattr_bucket(target, src_blkno);
4567 if (ret)
4568 mlog_errno(ret);
4572 out:
4573 return ret;
4577 * Find the suitable pos when we divide a bucket into 2.
4578 * We have to make sure the xattrs with the same hash value exist
4579 * in the same bucket.
4581 * If this ocfs2_xattr_header covers more than one hash value, find a
4582 * place where the hash value changes. Try to find the most even split.
4583 * The most common case is that all entries have different hash values,
4584 * and the first check we make will find a place to split.
4586 static int ocfs2_xattr_find_divide_pos(struct ocfs2_xattr_header *xh)
4588 struct ocfs2_xattr_entry *entries = xh->xh_entries;
4589 int count = le16_to_cpu(xh->xh_count);
4590 int delta, middle = count / 2;
4593 * We start at the middle. Each step gets farther away in both
4594 * directions. We therefore hit the change in hash value
4595 * nearest to the middle. Note that this loop does not execute for
4596 * count < 2.
4598 for (delta = 0; delta < middle; delta++) {
4599 /* Let's check delta earlier than middle */
4600 if (cmp_xe(&entries[middle - delta - 1],
4601 &entries[middle - delta]))
4602 return middle - delta;
4604 /* For even counts, don't walk off the end */
4605 if ((middle + delta + 1) == count)
4606 continue;
4608 /* Now try delta past middle */
4609 if (cmp_xe(&entries[middle + delta],
4610 &entries[middle + delta + 1]))
4611 return middle + delta + 1;
4614 /* Every entry had the same hash */
4615 return count;
4619 * Move some xattrs in old bucket(blk) to new bucket(new_blk).
4620 * first_hash will record the 1st hash of the new bucket.
4622 * Normally half of the xattrs will be moved. But we have to make
4623 * sure that the xattrs with the same hash value are stored in the
4624 * same bucket. If all the xattrs in this bucket have the same hash
4625 * value, the new bucket will be initialized as an empty one and the
4626 * first_hash will be initialized as (hash_value+1).
4628 static int ocfs2_divide_xattr_bucket(struct inode *inode,
4629 handle_t *handle,
4630 u64 blk,
4631 u64 new_blk,
4632 u32 *first_hash,
4633 int new_bucket_head)
4635 int ret, i;
4636 int count, start, len, name_value_len = 0, name_offset = 0;
4637 struct ocfs2_xattr_bucket *s_bucket = NULL, *t_bucket = NULL;
4638 struct ocfs2_xattr_header *xh;
4639 struct ocfs2_xattr_entry *xe;
4640 int blocksize = inode->i_sb->s_blocksize;
4642 trace_ocfs2_divide_xattr_bucket_begin((unsigned long long)blk,
4643 (unsigned long long)new_blk);
4645 s_bucket = ocfs2_xattr_bucket_new(inode);
4646 t_bucket = ocfs2_xattr_bucket_new(inode);
4647 if (!s_bucket || !t_bucket) {
4648 ret = -ENOMEM;
4649 mlog_errno(ret);
4650 goto out;
4653 ret = ocfs2_read_xattr_bucket(s_bucket, blk);
4654 if (ret) {
4655 mlog_errno(ret);
4656 goto out;
4659 ret = ocfs2_xattr_bucket_journal_access(handle, s_bucket,
4660 OCFS2_JOURNAL_ACCESS_WRITE);
4661 if (ret) {
4662 mlog_errno(ret);
4663 goto out;
4667 * Even if !new_bucket_head, we're overwriting t_bucket. Thus,
4668 * there's no need to read it.
4670 ret = ocfs2_init_xattr_bucket(t_bucket, new_blk, new_bucket_head);
4671 if (ret) {
4672 mlog_errno(ret);
4673 goto out;
4677 * Hey, if we're overwriting t_bucket, what difference does
4678 * ACCESS_CREATE vs ACCESS_WRITE make? See the comment in the
4679 * same part of ocfs2_cp_xattr_bucket().
4681 ret = ocfs2_xattr_bucket_journal_access(handle, t_bucket,
4682 new_bucket_head ?
4683 OCFS2_JOURNAL_ACCESS_CREATE :
4684 OCFS2_JOURNAL_ACCESS_WRITE);
4685 if (ret) {
4686 mlog_errno(ret);
4687 goto out;
4690 xh = bucket_xh(s_bucket);
4691 count = le16_to_cpu(xh->xh_count);
4692 start = ocfs2_xattr_find_divide_pos(xh);
4694 if (start == count) {
4695 xe = &xh->xh_entries[start-1];
4698 * initialized a new empty bucket here.
4699 * The hash value is set as one larger than
4700 * that of the last entry in the previous bucket.
4702 for (i = 0; i < t_bucket->bu_blocks; i++)
4703 memset(bucket_block(t_bucket, i), 0, blocksize);
4705 xh = bucket_xh(t_bucket);
4706 xh->xh_free_start = cpu_to_le16(blocksize);
4707 xh->xh_entries[0].xe_name_hash = xe->xe_name_hash;
4708 le32_add_cpu(&xh->xh_entries[0].xe_name_hash, 1);
4710 goto set_num_buckets;
4713 /* copy the whole bucket to the new first. */
4714 ocfs2_xattr_bucket_copy_data(t_bucket, s_bucket);
4716 /* update the new bucket. */
4717 xh = bucket_xh(t_bucket);
4720 * Calculate the total name/value len and xh_free_start for
4721 * the old bucket first.
4723 name_offset = OCFS2_XATTR_BUCKET_SIZE;
4724 name_value_len = 0;
4725 for (i = 0; i < start; i++) {
4726 xe = &xh->xh_entries[i];
4727 name_value_len += namevalue_size_xe(xe);
4728 if (le16_to_cpu(xe->xe_name_offset) < name_offset)
4729 name_offset = le16_to_cpu(xe->xe_name_offset);
4733 * Now begin the modification to the new bucket.
4735 * In the new bucket, We just move the xattr entry to the beginning
4736 * and don't touch the name/value. So there will be some holes in the
4737 * bucket, and they will be removed when ocfs2_defrag_xattr_bucket is
4738 * called.
4740 xe = &xh->xh_entries[start];
4741 len = sizeof(struct ocfs2_xattr_entry) * (count - start);
4742 trace_ocfs2_divide_xattr_bucket_move(len,
4743 (int)((char *)xe - (char *)xh),
4744 (int)((char *)xh->xh_entries - (char *)xh));
4745 memmove((char *)xh->xh_entries, (char *)xe, len);
4746 xe = &xh->xh_entries[count - start];
4747 len = sizeof(struct ocfs2_xattr_entry) * start;
4748 memset((char *)xe, 0, len);
4750 le16_add_cpu(&xh->xh_count, -start);
4751 le16_add_cpu(&xh->xh_name_value_len, -name_value_len);
4753 /* Calculate xh_free_start for the new bucket. */
4754 xh->xh_free_start = cpu_to_le16(OCFS2_XATTR_BUCKET_SIZE);
4755 for (i = 0; i < le16_to_cpu(xh->xh_count); i++) {
4756 xe = &xh->xh_entries[i];
4757 if (le16_to_cpu(xe->xe_name_offset) <
4758 le16_to_cpu(xh->xh_free_start))
4759 xh->xh_free_start = xe->xe_name_offset;
4762 set_num_buckets:
4763 /* set xh->xh_num_buckets for the new xh. */
4764 if (new_bucket_head)
4765 xh->xh_num_buckets = cpu_to_le16(1);
4766 else
4767 xh->xh_num_buckets = 0;
4769 ocfs2_xattr_bucket_journal_dirty(handle, t_bucket);
4771 /* store the first_hash of the new bucket. */
4772 if (first_hash)
4773 *first_hash = le32_to_cpu(xh->xh_entries[0].xe_name_hash);
4776 * Now only update the 1st block of the old bucket. If we
4777 * just added a new empty bucket, there is no need to modify
4778 * it.
4780 if (start == count)
4781 goto out;
4783 xh = bucket_xh(s_bucket);
4784 memset(&xh->xh_entries[start], 0,
4785 sizeof(struct ocfs2_xattr_entry) * (count - start));
4786 xh->xh_count = cpu_to_le16(start);
4787 xh->xh_free_start = cpu_to_le16(name_offset);
4788 xh->xh_name_value_len = cpu_to_le16(name_value_len);
4790 ocfs2_xattr_bucket_journal_dirty(handle, s_bucket);
4792 out:
4793 ocfs2_xattr_bucket_free(s_bucket);
4794 ocfs2_xattr_bucket_free(t_bucket);
4796 return ret;
4800 * Copy xattr from one bucket to another bucket.
4802 * The caller must make sure that the journal transaction
4803 * has enough space for journaling.
4805 static int ocfs2_cp_xattr_bucket(struct inode *inode,
4806 handle_t *handle,
4807 u64 s_blkno,
4808 u64 t_blkno,
4809 int t_is_new)
4811 int ret;
4812 struct ocfs2_xattr_bucket *s_bucket = NULL, *t_bucket = NULL;
4814 BUG_ON(s_blkno == t_blkno);
4816 trace_ocfs2_cp_xattr_bucket((unsigned long long)s_blkno,
4817 (unsigned long long)t_blkno,
4818 t_is_new);
4820 s_bucket = ocfs2_xattr_bucket_new(inode);
4821 t_bucket = ocfs2_xattr_bucket_new(inode);
4822 if (!s_bucket || !t_bucket) {
4823 ret = -ENOMEM;
4824 mlog_errno(ret);
4825 goto out;
4828 ret = ocfs2_read_xattr_bucket(s_bucket, s_blkno);
4829 if (ret)
4830 goto out;
4833 * Even if !t_is_new, we're overwriting t_bucket. Thus,
4834 * there's no need to read it.
4836 ret = ocfs2_init_xattr_bucket(t_bucket, t_blkno, t_is_new);
4837 if (ret)
4838 goto out;
4841 * Hey, if we're overwriting t_bucket, what difference does
4842 * ACCESS_CREATE vs ACCESS_WRITE make? Well, if we allocated a new
4843 * cluster to fill, we came here from
4844 * ocfs2_mv_xattr_buckets(), and it is really new -
4845 * ACCESS_CREATE is required. But we also might have moved data
4846 * out of t_bucket before extending back into it.
4847 * ocfs2_add_new_xattr_bucket() can do this - its call to
4848 * ocfs2_add_new_xattr_cluster() may have created a new extent
4849 * and copied out the end of the old extent. Then it re-extends
4850 * the old extent back to create space for new xattrs. That's
4851 * how we get here, and the bucket isn't really new.
4853 ret = ocfs2_xattr_bucket_journal_access(handle, t_bucket,
4854 t_is_new ?
4855 OCFS2_JOURNAL_ACCESS_CREATE :
4856 OCFS2_JOURNAL_ACCESS_WRITE);
4857 if (ret)
4858 goto out;
4860 ocfs2_xattr_bucket_copy_data(t_bucket, s_bucket);
4861 ocfs2_xattr_bucket_journal_dirty(handle, t_bucket);
4863 out:
4864 ocfs2_xattr_bucket_free(t_bucket);
4865 ocfs2_xattr_bucket_free(s_bucket);
4867 return ret;
4871 * src_blk points to the start of an existing extent. last_blk points to
4872 * last cluster in that extent. to_blk points to a newly allocated
4873 * extent. We copy the buckets from the cluster at last_blk to the new
4874 * extent. If start_bucket is non-zero, we skip that many buckets before
4875 * we start copying. The new extent's xh_num_buckets gets set to the
4876 * number of buckets we copied. The old extent's xh_num_buckets shrinks
4877 * by the same amount.
4879 static int ocfs2_mv_xattr_buckets(struct inode *inode, handle_t *handle,
4880 u64 src_blk, u64 last_blk, u64 to_blk,
4881 unsigned int start_bucket,
4882 u32 *first_hash)
4884 int i, ret, credits;
4885 struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
4886 int blks_per_bucket = ocfs2_blocks_per_xattr_bucket(inode->i_sb);
4887 int num_buckets = ocfs2_xattr_buckets_per_cluster(osb);
4888 struct ocfs2_xattr_bucket *old_first, *new_first;
4890 trace_ocfs2_mv_xattr_buckets((unsigned long long)last_blk,
4891 (unsigned long long)to_blk);
4893 BUG_ON(start_bucket >= num_buckets);
4894 if (start_bucket) {
4895 num_buckets -= start_bucket;
4896 last_blk += (start_bucket * blks_per_bucket);
4899 /* The first bucket of the original extent */
4900 old_first = ocfs2_xattr_bucket_new(inode);
4901 /* The first bucket of the new extent */
4902 new_first = ocfs2_xattr_bucket_new(inode);
4903 if (!old_first || !new_first) {
4904 ret = -ENOMEM;
4905 mlog_errno(ret);
4906 goto out;
4909 ret = ocfs2_read_xattr_bucket(old_first, src_blk);
4910 if (ret) {
4911 mlog_errno(ret);
4912 goto out;
4916 * We need to update the first bucket of the old extent and all
4917 * the buckets going to the new extent.
4919 credits = ((num_buckets + 1) * blks_per_bucket);
4920 ret = ocfs2_extend_trans(handle, credits);
4921 if (ret) {
4922 mlog_errno(ret);
4923 goto out;
4926 ret = ocfs2_xattr_bucket_journal_access(handle, old_first,
4927 OCFS2_JOURNAL_ACCESS_WRITE);
4928 if (ret) {
4929 mlog_errno(ret);
4930 goto out;
4933 for (i = 0; i < num_buckets; i++) {
4934 ret = ocfs2_cp_xattr_bucket(inode, handle,
4935 last_blk + (i * blks_per_bucket),
4936 to_blk + (i * blks_per_bucket),
4938 if (ret) {
4939 mlog_errno(ret);
4940 goto out;
4945 * Get the new bucket ready before we dirty anything
4946 * (This actually shouldn't fail, because we already dirtied
4947 * it once in ocfs2_cp_xattr_bucket()).
4949 ret = ocfs2_read_xattr_bucket(new_first, to_blk);
4950 if (ret) {
4951 mlog_errno(ret);
4952 goto out;
4954 ret = ocfs2_xattr_bucket_journal_access(handle, new_first,
4955 OCFS2_JOURNAL_ACCESS_WRITE);
4956 if (ret) {
4957 mlog_errno(ret);
4958 goto out;
4961 /* Now update the headers */
4962 le16_add_cpu(&bucket_xh(old_first)->xh_num_buckets, -num_buckets);
4963 ocfs2_xattr_bucket_journal_dirty(handle, old_first);
4965 bucket_xh(new_first)->xh_num_buckets = cpu_to_le16(num_buckets);
4966 ocfs2_xattr_bucket_journal_dirty(handle, new_first);
4968 if (first_hash)
4969 *first_hash = le32_to_cpu(bucket_xh(new_first)->xh_entries[0].xe_name_hash);
4971 out:
4972 ocfs2_xattr_bucket_free(new_first);
4973 ocfs2_xattr_bucket_free(old_first);
4974 return ret;
4978 * Move some xattrs in this cluster to the new cluster.
4979 * This function should only be called when bucket size == cluster size.
4980 * Otherwise ocfs2_mv_xattr_bucket_cross_cluster should be used instead.
4982 static int ocfs2_divide_xattr_cluster(struct inode *inode,
4983 handle_t *handle,
4984 u64 prev_blk,
4985 u64 new_blk,
4986 u32 *first_hash)
4988 u16 blk_per_bucket = ocfs2_blocks_per_xattr_bucket(inode->i_sb);
4989 int ret, credits = 2 * blk_per_bucket;
4991 BUG_ON(OCFS2_XATTR_BUCKET_SIZE < OCFS2_SB(inode->i_sb)->s_clustersize);
4993 ret = ocfs2_extend_trans(handle, credits);
4994 if (ret) {
4995 mlog_errno(ret);
4996 return ret;
4999 /* Move half of the xattr in start_blk to the next bucket. */
5000 return ocfs2_divide_xattr_bucket(inode, handle, prev_blk,
5001 new_blk, first_hash, 1);
5005 * Move some xattrs from the old cluster to the new one since they are not
5006 * contiguous in ocfs2 xattr tree.
5008 * new_blk starts a new separate cluster, and we will move some xattrs from
5009 * prev_blk to it. v_start will be set as the first name hash value in this
5010 * new cluster so that it can be used as e_cpos during tree insertion and
5011 * don't collide with our original b-tree operations. first_bh and header_bh
5012 * will also be updated since they will be used in ocfs2_extend_xattr_bucket
5013 * to extend the insert bucket.
5015 * The problem is how much xattr should we move to the new one and when should
5016 * we update first_bh and header_bh?
5017 * 1. If cluster size > bucket size, that means the previous cluster has more
5018 * than 1 bucket, so just move half nums of bucket into the new cluster and
5019 * update the first_bh and header_bh if the insert bucket has been moved
5020 * to the new cluster.
5021 * 2. If cluster_size == bucket_size:
5022 * a) If the previous extent rec has more than one cluster and the insert
5023 * place isn't in the last cluster, copy the entire last cluster to the
5024 * new one. This time, we don't need to upate the first_bh and header_bh
5025 * since they will not be moved into the new cluster.
5026 * b) Otherwise, move the bottom half of the xattrs in the last cluster into
5027 * the new one. And we set the extend flag to zero if the insert place is
5028 * moved into the new allocated cluster since no extend is needed.
5030 static int ocfs2_adjust_xattr_cross_cluster(struct inode *inode,
5031 handle_t *handle,
5032 struct ocfs2_xattr_bucket *first,
5033 struct ocfs2_xattr_bucket *target,
5034 u64 new_blk,
5035 u32 prev_clusters,
5036 u32 *v_start,
5037 int *extend)
5039 int ret;
5041 trace_ocfs2_adjust_xattr_cross_cluster(
5042 (unsigned long long)bucket_blkno(first),
5043 (unsigned long long)new_blk, prev_clusters);
5045 if (ocfs2_xattr_buckets_per_cluster(OCFS2_SB(inode->i_sb)) > 1) {
5046 ret = ocfs2_mv_xattr_bucket_cross_cluster(inode,
5047 handle,
5048 first, target,
5049 new_blk,
5050 prev_clusters,
5051 v_start);
5052 if (ret)
5053 mlog_errno(ret);
5054 } else {
5055 /* The start of the last cluster in the first extent */
5056 u64 last_blk = bucket_blkno(first) +
5057 ((prev_clusters - 1) *
5058 ocfs2_clusters_to_blocks(inode->i_sb, 1));
5060 if (prev_clusters > 1 && bucket_blkno(target) != last_blk) {
5061 ret = ocfs2_mv_xattr_buckets(inode, handle,
5062 bucket_blkno(first),
5063 last_blk, new_blk, 0,
5064 v_start);
5065 if (ret)
5066 mlog_errno(ret);
5067 } else {
5068 ret = ocfs2_divide_xattr_cluster(inode, handle,
5069 last_blk, new_blk,
5070 v_start);
5071 if (ret)
5072 mlog_errno(ret);
5074 if ((bucket_blkno(target) == last_blk) && extend)
5075 *extend = 0;
5079 return ret;
5083 * Add a new cluster for xattr storage.
5085 * If the new cluster is contiguous with the previous one, it will be
5086 * appended to the same extent record, and num_clusters will be updated.
5087 * If not, we will insert a new extent for it and move some xattrs in
5088 * the last cluster into the new allocated one.
5089 * We also need to limit the maximum size of a btree leaf, otherwise we'll
5090 * lose the benefits of hashing because we'll have to search large leaves.
5091 * So now the maximum size is OCFS2_MAX_XATTR_TREE_LEAF_SIZE(or clustersize,
5092 * if it's bigger).
5094 * first_bh is the first block of the previous extent rec and header_bh
5095 * indicates the bucket we will insert the new xattrs. They will be updated
5096 * when the header_bh is moved into the new cluster.
5098 static int ocfs2_add_new_xattr_cluster(struct inode *inode,
5099 struct buffer_head *root_bh,
5100 struct ocfs2_xattr_bucket *first,
5101 struct ocfs2_xattr_bucket *target,
5102 u32 *num_clusters,
5103 u32 prev_cpos,
5104 int *extend,
5105 struct ocfs2_xattr_set_ctxt *ctxt)
5107 int ret;
5108 u16 bpc = ocfs2_clusters_to_blocks(inode->i_sb, 1);
5109 u32 prev_clusters = *num_clusters;
5110 u32 clusters_to_add = 1, bit_off, num_bits, v_start = 0;
5111 u64 block;
5112 handle_t *handle = ctxt->handle;
5113 struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
5114 struct ocfs2_extent_tree et;
5116 trace_ocfs2_add_new_xattr_cluster_begin(
5117 (unsigned long long)OCFS2_I(inode)->ip_blkno,
5118 (unsigned long long)bucket_blkno(first),
5119 prev_cpos, prev_clusters);
5121 ocfs2_init_xattr_tree_extent_tree(&et, INODE_CACHE(inode), root_bh);
5123 ret = ocfs2_journal_access_xb(handle, INODE_CACHE(inode), root_bh,
5124 OCFS2_JOURNAL_ACCESS_WRITE);
5125 if (ret < 0) {
5126 mlog_errno(ret);
5127 goto leave;
5130 ret = __ocfs2_claim_clusters(handle, ctxt->data_ac, 1,
5131 clusters_to_add, &bit_off, &num_bits);
5132 if (ret < 0) {
5133 if (ret != -ENOSPC)
5134 mlog_errno(ret);
5135 goto leave;
5138 BUG_ON(num_bits > clusters_to_add);
5140 block = ocfs2_clusters_to_blocks(osb->sb, bit_off);
5141 trace_ocfs2_add_new_xattr_cluster((unsigned long long)block, num_bits);
5143 if (bucket_blkno(first) + (prev_clusters * bpc) == block &&
5144 (prev_clusters + num_bits) << osb->s_clustersize_bits <=
5145 OCFS2_MAX_XATTR_TREE_LEAF_SIZE) {
5147 * If this cluster is contiguous with the old one and
5148 * adding this new cluster, we don't surpass the limit of
5149 * OCFS2_MAX_XATTR_TREE_LEAF_SIZE, cool. We will let it be
5150 * initialized and used like other buckets in the previous
5151 * cluster.
5152 * So add it as a contiguous one. The caller will handle
5153 * its init process.
5155 v_start = prev_cpos + prev_clusters;
5156 *num_clusters = prev_clusters + num_bits;
5157 } else {
5158 ret = ocfs2_adjust_xattr_cross_cluster(inode,
5159 handle,
5160 first,
5161 target,
5162 block,
5163 prev_clusters,
5164 &v_start,
5165 extend);
5166 if (ret) {
5167 mlog_errno(ret);
5168 goto leave;
5172 trace_ocfs2_add_new_xattr_cluster_insert((unsigned long long)block,
5173 v_start, num_bits);
5174 ret = ocfs2_insert_extent(handle, &et, v_start, block,
5175 num_bits, 0, ctxt->meta_ac);
5176 if (ret < 0) {
5177 mlog_errno(ret);
5178 goto leave;
5181 ocfs2_journal_dirty(handle, root_bh);
5183 leave:
5184 return ret;
5188 * We are given an extent. 'first' is the bucket at the very front of
5189 * the extent. The extent has space for an additional bucket past
5190 * bucket_xh(first)->xh_num_buckets. 'target_blkno' is the block number
5191 * of the target bucket. We wish to shift every bucket past the target
5192 * down one, filling in that additional space. When we get back to the
5193 * target, we split the target between itself and the now-empty bucket
5194 * at target+1 (aka, target_blkno + blks_per_bucket).
5196 static int ocfs2_extend_xattr_bucket(struct inode *inode,
5197 handle_t *handle,
5198 struct ocfs2_xattr_bucket *first,
5199 u64 target_blk,
5200 u32 num_clusters)
5202 int ret, credits;
5203 struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
5204 u16 blk_per_bucket = ocfs2_blocks_per_xattr_bucket(inode->i_sb);
5205 u64 end_blk;
5206 u16 new_bucket = le16_to_cpu(bucket_xh(first)->xh_num_buckets);
5208 trace_ocfs2_extend_xattr_bucket((unsigned long long)target_blk,
5209 (unsigned long long)bucket_blkno(first),
5210 num_clusters, new_bucket);
5212 /* The extent must have room for an additional bucket */
5213 BUG_ON(new_bucket >=
5214 (num_clusters * ocfs2_xattr_buckets_per_cluster(osb)));
5216 /* end_blk points to the last existing bucket */
5217 end_blk = bucket_blkno(first) + ((new_bucket - 1) * blk_per_bucket);
5220 * end_blk is the start of the last existing bucket.
5221 * Thus, (end_blk - target_blk) covers the target bucket and
5222 * every bucket after it up to, but not including, the last
5223 * existing bucket. Then we add the last existing bucket, the
5224 * new bucket, and the first bucket (3 * blk_per_bucket).
5226 credits = (end_blk - target_blk) + (3 * blk_per_bucket);
5227 ret = ocfs2_extend_trans(handle, credits);
5228 if (ret) {
5229 mlog_errno(ret);
5230 goto out;
5233 ret = ocfs2_xattr_bucket_journal_access(handle, first,
5234 OCFS2_JOURNAL_ACCESS_WRITE);
5235 if (ret) {
5236 mlog_errno(ret);
5237 goto out;
5240 while (end_blk != target_blk) {
5241 ret = ocfs2_cp_xattr_bucket(inode, handle, end_blk,
5242 end_blk + blk_per_bucket, 0);
5243 if (ret)
5244 goto out;
5245 end_blk -= blk_per_bucket;
5248 /* Move half of the xattr in target_blkno to the next bucket. */
5249 ret = ocfs2_divide_xattr_bucket(inode, handle, target_blk,
5250 target_blk + blk_per_bucket, NULL, 0);
5252 le16_add_cpu(&bucket_xh(first)->xh_num_buckets, 1);
5253 ocfs2_xattr_bucket_journal_dirty(handle, first);
5255 out:
5256 return ret;
5260 * Add new xattr bucket in an extent record and adjust the buckets
5261 * accordingly. xb_bh is the ocfs2_xattr_block, and target is the
5262 * bucket we want to insert into.
5264 * In the easy case, we will move all the buckets after target down by
5265 * one. Half of target's xattrs will be moved to the next bucket.
5267 * If current cluster is full, we'll allocate a new one. This may not
5268 * be contiguous. The underlying calls will make sure that there is
5269 * space for the insert, shifting buckets around if necessary.
5270 * 'target' may be moved by those calls.
5272 static int ocfs2_add_new_xattr_bucket(struct inode *inode,
5273 struct buffer_head *xb_bh,
5274 struct ocfs2_xattr_bucket *target,
5275 struct ocfs2_xattr_set_ctxt *ctxt)
5277 struct ocfs2_xattr_block *xb =
5278 (struct ocfs2_xattr_block *)xb_bh->b_data;
5279 struct ocfs2_xattr_tree_root *xb_root = &xb->xb_attrs.xb_root;
5280 struct ocfs2_extent_list *el = &xb_root->xt_list;
5281 u32 name_hash =
5282 le32_to_cpu(bucket_xh(target)->xh_entries[0].xe_name_hash);
5283 struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
5284 int ret, num_buckets, extend = 1;
5285 u64 p_blkno;
5286 u32 e_cpos, num_clusters;
5287 /* The bucket at the front of the extent */
5288 struct ocfs2_xattr_bucket *first;
5290 trace_ocfs2_add_new_xattr_bucket(
5291 (unsigned long long)bucket_blkno(target));
5293 /* The first bucket of the original extent */
5294 first = ocfs2_xattr_bucket_new(inode);
5295 if (!first) {
5296 ret = -ENOMEM;
5297 mlog_errno(ret);
5298 goto out;
5301 ret = ocfs2_xattr_get_rec(inode, name_hash, &p_blkno, &e_cpos,
5302 &num_clusters, el);
5303 if (ret) {
5304 mlog_errno(ret);
5305 goto out;
5308 ret = ocfs2_read_xattr_bucket(first, p_blkno);
5309 if (ret) {
5310 mlog_errno(ret);
5311 goto out;
5314 num_buckets = ocfs2_xattr_buckets_per_cluster(osb) * num_clusters;
5315 if (num_buckets == le16_to_cpu(bucket_xh(first)->xh_num_buckets)) {
5317 * This can move first+target if the target bucket moves
5318 * to the new extent.
5320 ret = ocfs2_add_new_xattr_cluster(inode,
5321 xb_bh,
5322 first,
5323 target,
5324 &num_clusters,
5325 e_cpos,
5326 &extend,
5327 ctxt);
5328 if (ret) {
5329 mlog_errno(ret);
5330 goto out;
5334 if (extend) {
5335 ret = ocfs2_extend_xattr_bucket(inode,
5336 ctxt->handle,
5337 first,
5338 bucket_blkno(target),
5339 num_clusters);
5340 if (ret)
5341 mlog_errno(ret);
5344 out:
5345 ocfs2_xattr_bucket_free(first);
5347 return ret;
5351 * Truncate the specified xe_off entry in xattr bucket.
5352 * bucket is indicated by header_bh and len is the new length.
5353 * Both the ocfs2_xattr_value_root and the entry will be updated here.
5355 * Copy the new updated xe and xe_value_root to new_xe and new_xv if needed.
5357 static int ocfs2_xattr_bucket_value_truncate(struct inode *inode,
5358 struct ocfs2_xattr_bucket *bucket,
5359 int xe_off,
5360 int len,
5361 struct ocfs2_xattr_set_ctxt *ctxt)
5363 int ret, offset;
5364 u64 value_blk;
5365 struct ocfs2_xattr_entry *xe;
5366 struct ocfs2_xattr_header *xh = bucket_xh(bucket);
5367 size_t blocksize = inode->i_sb->s_blocksize;
5368 struct ocfs2_xattr_value_buf vb = {
5369 .vb_access = ocfs2_journal_access,
5372 xe = &xh->xh_entries[xe_off];
5374 BUG_ON(!xe || ocfs2_xattr_is_local(xe));
5376 offset = le16_to_cpu(xe->xe_name_offset) +
5377 OCFS2_XATTR_SIZE(xe->xe_name_len);
5379 value_blk = offset / blocksize;
5381 /* We don't allow ocfs2_xattr_value to be stored in different block. */
5382 BUG_ON(value_blk != (offset + OCFS2_XATTR_ROOT_SIZE - 1) / blocksize);
5384 vb.vb_bh = bucket->bu_bhs[value_blk];
5385 BUG_ON(!vb.vb_bh);
5387 vb.vb_xv = (struct ocfs2_xattr_value_root *)
5388 (vb.vb_bh->b_data + offset % blocksize);
5391 * From here on out we have to dirty the bucket. The generic
5392 * value calls only modify one of the bucket's bhs, but we need
5393 * to send the bucket at once. So if they error, they *could* have
5394 * modified something. We have to assume they did, and dirty
5395 * the whole bucket. This leaves us in a consistent state.
5397 trace_ocfs2_xattr_bucket_value_truncate(
5398 (unsigned long long)bucket_blkno(bucket), xe_off, len);
5399 ret = ocfs2_xattr_value_truncate(inode, &vb, len, ctxt);
5400 if (ret) {
5401 mlog_errno(ret);
5402 goto out;
5405 ret = ocfs2_xattr_bucket_journal_access(ctxt->handle, bucket,
5406 OCFS2_JOURNAL_ACCESS_WRITE);
5407 if (ret) {
5408 mlog_errno(ret);
5409 goto out;
5412 xe->xe_value_size = cpu_to_le64(len);
5414 ocfs2_xattr_bucket_journal_dirty(ctxt->handle, bucket);
5416 out:
5417 return ret;
5420 static int ocfs2_rm_xattr_cluster(struct inode *inode,
5421 struct buffer_head *root_bh,
5422 u64 blkno,
5423 u32 cpos,
5424 u32 len,
5425 void *para)
5427 int ret;
5428 struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
5429 struct inode *tl_inode = osb->osb_tl_inode;
5430 handle_t *handle;
5431 struct ocfs2_xattr_block *xb =
5432 (struct ocfs2_xattr_block *)root_bh->b_data;
5433 struct ocfs2_alloc_context *meta_ac = NULL;
5434 struct ocfs2_cached_dealloc_ctxt dealloc;
5435 struct ocfs2_extent_tree et;
5437 ret = ocfs2_iterate_xattr_buckets(inode, blkno, len,
5438 ocfs2_delete_xattr_in_bucket, para);
5439 if (ret) {
5440 mlog_errno(ret);
5441 return ret;
5444 ocfs2_init_xattr_tree_extent_tree(&et, INODE_CACHE(inode), root_bh);
5446 ocfs2_init_dealloc_ctxt(&dealloc);
5448 trace_ocfs2_rm_xattr_cluster(
5449 (unsigned long long)OCFS2_I(inode)->ip_blkno,
5450 (unsigned long long)blkno, cpos, len);
5452 ocfs2_remove_xattr_clusters_from_cache(INODE_CACHE(inode), blkno,
5453 len);
5455 ret = ocfs2_lock_allocators(inode, &et, 0, 1, NULL, &meta_ac);
5456 if (ret) {
5457 mlog_errno(ret);
5458 return ret;
5461 inode_lock(tl_inode);
5463 if (ocfs2_truncate_log_needs_flush(osb)) {
5464 ret = __ocfs2_flush_truncate_log(osb);
5465 if (ret < 0) {
5466 mlog_errno(ret);
5467 goto out;
5471 handle = ocfs2_start_trans(osb, ocfs2_remove_extent_credits(osb->sb));
5472 if (IS_ERR(handle)) {
5473 ret = -ENOMEM;
5474 mlog_errno(ret);
5475 goto out;
5478 ret = ocfs2_journal_access_xb(handle, INODE_CACHE(inode), root_bh,
5479 OCFS2_JOURNAL_ACCESS_WRITE);
5480 if (ret) {
5481 mlog_errno(ret);
5482 goto out_commit;
5485 ret = ocfs2_remove_extent(handle, &et, cpos, len, meta_ac,
5486 &dealloc);
5487 if (ret) {
5488 mlog_errno(ret);
5489 goto out_commit;
5492 le32_add_cpu(&xb->xb_attrs.xb_root.xt_clusters, -len);
5493 ocfs2_journal_dirty(handle, root_bh);
5495 ret = ocfs2_truncate_log_append(osb, handle, blkno, len);
5496 if (ret)
5497 mlog_errno(ret);
5498 ocfs2_update_inode_fsync_trans(handle, inode, 0);
5500 out_commit:
5501 ocfs2_commit_trans(osb, handle);
5502 out:
5503 ocfs2_schedule_truncate_log_flush(osb, 1);
5505 inode_unlock(tl_inode);
5507 if (meta_ac)
5508 ocfs2_free_alloc_context(meta_ac);
5510 ocfs2_run_deallocs(osb, &dealloc);
5512 return ret;
5516 * check whether the xattr bucket is filled up with the same hash value.
5517 * If we want to insert the xattr with the same hash, return -ENOSPC.
5518 * If we want to insert a xattr with different hash value, go ahead
5519 * and ocfs2_divide_xattr_bucket will handle this.
5521 static int ocfs2_check_xattr_bucket_collision(struct inode *inode,
5522 struct ocfs2_xattr_bucket *bucket,
5523 const char *name)
5525 struct ocfs2_xattr_header *xh = bucket_xh(bucket);
5526 u32 name_hash = ocfs2_xattr_name_hash(inode, name, strlen(name));
5528 if (name_hash != le32_to_cpu(xh->xh_entries[0].xe_name_hash))
5529 return 0;
5531 if (xh->xh_entries[le16_to_cpu(xh->xh_count) - 1].xe_name_hash ==
5532 xh->xh_entries[0].xe_name_hash) {
5533 mlog(ML_ERROR, "Too much hash collision in xattr bucket %llu, "
5534 "hash = %u\n",
5535 (unsigned long long)bucket_blkno(bucket),
5536 le32_to_cpu(xh->xh_entries[0].xe_name_hash));
5537 return -ENOSPC;
5540 return 0;
5544 * Try to set the entry in the current bucket. If we fail, the caller
5545 * will handle getting us another bucket.
5547 static int ocfs2_xattr_set_entry_bucket(struct inode *inode,
5548 struct ocfs2_xattr_info *xi,
5549 struct ocfs2_xattr_search *xs,
5550 struct ocfs2_xattr_set_ctxt *ctxt)
5552 int ret;
5553 struct ocfs2_xa_loc loc;
5555 trace_ocfs2_xattr_set_entry_bucket(xi->xi_name);
5557 ocfs2_init_xattr_bucket_xa_loc(&loc, xs->bucket,
5558 xs->not_found ? NULL : xs->here);
5559 ret = ocfs2_xa_set(&loc, xi, ctxt);
5560 if (!ret) {
5561 xs->here = loc.xl_entry;
5562 goto out;
5564 if (ret != -ENOSPC) {
5565 mlog_errno(ret);
5566 goto out;
5569 /* Ok, we need space. Let's try defragmenting the bucket. */
5570 ret = ocfs2_defrag_xattr_bucket(inode, ctxt->handle,
5571 xs->bucket);
5572 if (ret) {
5573 mlog_errno(ret);
5574 goto out;
5577 ret = ocfs2_xa_set(&loc, xi, ctxt);
5578 if (!ret) {
5579 xs->here = loc.xl_entry;
5580 goto out;
5582 if (ret != -ENOSPC)
5583 mlog_errno(ret);
5586 out:
5587 return ret;
5590 static int ocfs2_xattr_set_entry_index_block(struct inode *inode,
5591 struct ocfs2_xattr_info *xi,
5592 struct ocfs2_xattr_search *xs,
5593 struct ocfs2_xattr_set_ctxt *ctxt)
5595 int ret;
5597 trace_ocfs2_xattr_set_entry_index_block(xi->xi_name);
5599 ret = ocfs2_xattr_set_entry_bucket(inode, xi, xs, ctxt);
5600 if (!ret)
5601 goto out;
5602 if (ret != -ENOSPC) {
5603 mlog_errno(ret);
5604 goto out;
5607 /* Ack, need more space. Let's try to get another bucket! */
5610 * We do not allow for overlapping ranges between buckets. And
5611 * the maximum number of collisions we will allow for then is
5612 * one bucket's worth, so check it here whether we need to
5613 * add a new bucket for the insert.
5615 ret = ocfs2_check_xattr_bucket_collision(inode,
5616 xs->bucket,
5617 xi->xi_name);
5618 if (ret) {
5619 mlog_errno(ret);
5620 goto out;
5623 ret = ocfs2_add_new_xattr_bucket(inode,
5624 xs->xattr_bh,
5625 xs->bucket,
5626 ctxt);
5627 if (ret) {
5628 mlog_errno(ret);
5629 goto out;
5633 * ocfs2_add_new_xattr_bucket() will have updated
5634 * xs->bucket if it moved, but it will not have updated
5635 * any of the other search fields. Thus, we drop it and
5636 * re-search. Everything should be cached, so it'll be
5637 * quick.
5639 ocfs2_xattr_bucket_relse(xs->bucket);
5640 ret = ocfs2_xattr_index_block_find(inode, xs->xattr_bh,
5641 xi->xi_name_index,
5642 xi->xi_name, xs);
5643 if (ret && ret != -ENODATA)
5644 goto out;
5645 xs->not_found = ret;
5647 /* Ok, we have a new bucket, let's try again */
5648 ret = ocfs2_xattr_set_entry_bucket(inode, xi, xs, ctxt);
5649 if (ret && (ret != -ENOSPC))
5650 mlog_errno(ret);
5652 out:
5653 return ret;
5656 static int ocfs2_delete_xattr_in_bucket(struct inode *inode,
5657 struct ocfs2_xattr_bucket *bucket,
5658 void *para)
5660 int ret = 0, ref_credits;
5661 struct ocfs2_xattr_header *xh = bucket_xh(bucket);
5662 u16 i;
5663 struct ocfs2_xattr_entry *xe;
5664 struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
5665 struct ocfs2_xattr_set_ctxt ctxt = {NULL, NULL,};
5666 int credits = ocfs2_remove_extent_credits(osb->sb) +
5667 ocfs2_blocks_per_xattr_bucket(inode->i_sb);
5668 struct ocfs2_xattr_value_root *xv;
5669 struct ocfs2_rm_xattr_bucket_para *args =
5670 (struct ocfs2_rm_xattr_bucket_para *)para;
5672 ocfs2_init_dealloc_ctxt(&ctxt.dealloc);
5674 for (i = 0; i < le16_to_cpu(xh->xh_count); i++) {
5675 xe = &xh->xh_entries[i];
5676 if (ocfs2_xattr_is_local(xe))
5677 continue;
5679 ret = ocfs2_get_xattr_tree_value_root(inode->i_sb, bucket,
5680 i, &xv, NULL);
5681 if (ret) {
5682 mlog_errno(ret);
5683 break;
5686 ret = ocfs2_lock_xattr_remove_allocators(inode, xv,
5687 args->ref_ci,
5688 args->ref_root_bh,
5689 &ctxt.meta_ac,
5690 &ref_credits);
5692 ctxt.handle = ocfs2_start_trans(osb, credits + ref_credits);
5693 if (IS_ERR(ctxt.handle)) {
5694 ret = PTR_ERR(ctxt.handle);
5695 mlog_errno(ret);
5696 break;
5699 ret = ocfs2_xattr_bucket_value_truncate(inode, bucket,
5700 i, 0, &ctxt);
5702 ocfs2_commit_trans(osb, ctxt.handle);
5703 if (ctxt.meta_ac) {
5704 ocfs2_free_alloc_context(ctxt.meta_ac);
5705 ctxt.meta_ac = NULL;
5707 if (ret) {
5708 mlog_errno(ret);
5709 break;
5713 if (ctxt.meta_ac)
5714 ocfs2_free_alloc_context(ctxt.meta_ac);
5715 ocfs2_schedule_truncate_log_flush(osb, 1);
5716 ocfs2_run_deallocs(osb, &ctxt.dealloc);
5717 return ret;
5721 * Whenever we modify a xattr value root in the bucket(e.g, CoW
5722 * or change the extent record flag), we need to recalculate
5723 * the metaecc for the whole bucket. So it is done here.
5725 * Note:
5726 * We have to give the extra credits for the caller.
5728 static int ocfs2_xattr_bucket_post_refcount(struct inode *inode,
5729 handle_t *handle,
5730 void *para)
5732 int ret;
5733 struct ocfs2_xattr_bucket *bucket =
5734 (struct ocfs2_xattr_bucket *)para;
5736 ret = ocfs2_xattr_bucket_journal_access(handle, bucket,
5737 OCFS2_JOURNAL_ACCESS_WRITE);
5738 if (ret) {
5739 mlog_errno(ret);
5740 return ret;
5743 ocfs2_xattr_bucket_journal_dirty(handle, bucket);
5745 return 0;
5749 * Special action we need if the xattr value is refcounted.
5751 * 1. If the xattr is refcounted, lock the tree.
5752 * 2. CoW the xattr if we are setting the new value and the value
5753 * will be stored outside.
5754 * 3. In other case, decrease_refcount will work for us, so just
5755 * lock the refcount tree, calculate the meta and credits is OK.
5757 * We have to do CoW before ocfs2_init_xattr_set_ctxt since
5758 * currently CoW is a completed transaction, while this function
5759 * will also lock the allocators and let us deadlock. So we will
5760 * CoW the whole xattr value.
5762 static int ocfs2_prepare_refcount_xattr(struct inode *inode,
5763 struct ocfs2_dinode *di,
5764 struct ocfs2_xattr_info *xi,
5765 struct ocfs2_xattr_search *xis,
5766 struct ocfs2_xattr_search *xbs,
5767 struct ocfs2_refcount_tree **ref_tree,
5768 int *meta_add,
5769 int *credits)
5771 int ret = 0;
5772 struct ocfs2_xattr_block *xb;
5773 struct ocfs2_xattr_entry *xe;
5774 char *base;
5775 u32 p_cluster, num_clusters;
5776 unsigned int ext_flags;
5777 int name_offset, name_len;
5778 struct ocfs2_xattr_value_buf vb;
5779 struct ocfs2_xattr_bucket *bucket = NULL;
5780 struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
5781 struct ocfs2_post_refcount refcount;
5782 struct ocfs2_post_refcount *p = NULL;
5783 struct buffer_head *ref_root_bh = NULL;
5785 if (!xis->not_found) {
5786 xe = xis->here;
5787 name_offset = le16_to_cpu(xe->xe_name_offset);
5788 name_len = OCFS2_XATTR_SIZE(xe->xe_name_len);
5789 base = xis->base;
5790 vb.vb_bh = xis->inode_bh;
5791 vb.vb_access = ocfs2_journal_access_di;
5792 } else {
5793 int i, block_off = 0;
5794 xb = (struct ocfs2_xattr_block *)xbs->xattr_bh->b_data;
5795 xe = xbs->here;
5796 name_offset = le16_to_cpu(xe->xe_name_offset);
5797 name_len = OCFS2_XATTR_SIZE(xe->xe_name_len);
5798 i = xbs->here - xbs->header->xh_entries;
5800 if (le16_to_cpu(xb->xb_flags) & OCFS2_XATTR_INDEXED) {
5801 ret = ocfs2_xattr_bucket_get_name_value(inode->i_sb,
5802 bucket_xh(xbs->bucket),
5803 i, &block_off,
5804 &name_offset);
5805 if (ret) {
5806 mlog_errno(ret);
5807 goto out;
5809 base = bucket_block(xbs->bucket, block_off);
5810 vb.vb_bh = xbs->bucket->bu_bhs[block_off];
5811 vb.vb_access = ocfs2_journal_access;
5813 if (ocfs2_meta_ecc(osb)) {
5814 /*create parameters for ocfs2_post_refcount. */
5815 bucket = xbs->bucket;
5816 refcount.credits = bucket->bu_blocks;
5817 refcount.para = bucket;
5818 refcount.func =
5819 ocfs2_xattr_bucket_post_refcount;
5820 p = &refcount;
5822 } else {
5823 base = xbs->base;
5824 vb.vb_bh = xbs->xattr_bh;
5825 vb.vb_access = ocfs2_journal_access_xb;
5829 if (ocfs2_xattr_is_local(xe))
5830 goto out;
5832 vb.vb_xv = (struct ocfs2_xattr_value_root *)
5833 (base + name_offset + name_len);
5835 ret = ocfs2_xattr_get_clusters(inode, 0, &p_cluster,
5836 &num_clusters, &vb.vb_xv->xr_list,
5837 &ext_flags);
5838 if (ret) {
5839 mlog_errno(ret);
5840 goto out;
5844 * We just need to check the 1st extent record, since we always
5845 * CoW the whole xattr. So there shouldn't be a xattr with
5846 * some REFCOUNT extent recs after the 1st one.
5848 if (!(ext_flags & OCFS2_EXT_REFCOUNTED))
5849 goto out;
5851 ret = ocfs2_lock_refcount_tree(osb, le64_to_cpu(di->i_refcount_loc),
5852 1, ref_tree, &ref_root_bh);
5853 if (ret) {
5854 mlog_errno(ret);
5855 goto out;
5859 * If we are deleting the xattr or the new size will be stored inside,
5860 * cool, leave it there, the xattr truncate process will remove them
5861 * for us(it still needs the refcount tree lock and the meta, credits).
5862 * And the worse case is that every cluster truncate will split the
5863 * refcount tree, and make the original extent become 3. So we will need
5864 * 2 * cluster more extent recs at most.
5866 if (!xi->xi_value || xi->xi_value_len <= OCFS2_XATTR_INLINE_SIZE) {
5868 ret = ocfs2_refcounted_xattr_delete_need(inode,
5869 &(*ref_tree)->rf_ci,
5870 ref_root_bh, vb.vb_xv,
5871 meta_add, credits);
5872 if (ret)
5873 mlog_errno(ret);
5874 goto out;
5877 ret = ocfs2_refcount_cow_xattr(inode, di, &vb,
5878 *ref_tree, ref_root_bh, 0,
5879 le32_to_cpu(vb.vb_xv->xr_clusters), p);
5880 if (ret)
5881 mlog_errno(ret);
5883 out:
5884 brelse(ref_root_bh);
5885 return ret;
5889 * Add the REFCOUNTED flags for all the extent rec in ocfs2_xattr_value_root.
5890 * The physical clusters will be added to refcount tree.
5892 static int ocfs2_xattr_value_attach_refcount(struct inode *inode,
5893 struct ocfs2_xattr_value_root *xv,
5894 struct ocfs2_extent_tree *value_et,
5895 struct ocfs2_caching_info *ref_ci,
5896 struct buffer_head *ref_root_bh,
5897 struct ocfs2_cached_dealloc_ctxt *dealloc,
5898 struct ocfs2_post_refcount *refcount)
5900 int ret = 0;
5901 u32 clusters = le32_to_cpu(xv->xr_clusters);
5902 u32 cpos, p_cluster, num_clusters;
5903 struct ocfs2_extent_list *el = &xv->xr_list;
5904 unsigned int ext_flags;
5906 cpos = 0;
5907 while (cpos < clusters) {
5908 ret = ocfs2_xattr_get_clusters(inode, cpos, &p_cluster,
5909 &num_clusters, el, &ext_flags);
5910 if (ret) {
5911 mlog_errno(ret);
5912 break;
5915 cpos += num_clusters;
5916 if ((ext_flags & OCFS2_EXT_REFCOUNTED))
5917 continue;
5919 BUG_ON(!p_cluster);
5921 ret = ocfs2_add_refcount_flag(inode, value_et,
5922 ref_ci, ref_root_bh,
5923 cpos - num_clusters,
5924 p_cluster, num_clusters,
5925 dealloc, refcount);
5926 if (ret) {
5927 mlog_errno(ret);
5928 break;
5932 return ret;
5936 * Given a normal ocfs2_xattr_header, refcount all the entries which
5937 * have value stored outside.
5938 * Used for xattrs stored in inode and ocfs2_xattr_block.
5940 static int ocfs2_xattr_attach_refcount_normal(struct inode *inode,
5941 struct ocfs2_xattr_value_buf *vb,
5942 struct ocfs2_xattr_header *header,
5943 struct ocfs2_caching_info *ref_ci,
5944 struct buffer_head *ref_root_bh,
5945 struct ocfs2_cached_dealloc_ctxt *dealloc)
5948 struct ocfs2_xattr_entry *xe;
5949 struct ocfs2_xattr_value_root *xv;
5950 struct ocfs2_extent_tree et;
5951 int i, ret = 0;
5953 for (i = 0; i < le16_to_cpu(header->xh_count); i++) {
5954 xe = &header->xh_entries[i];
5956 if (ocfs2_xattr_is_local(xe))
5957 continue;
5959 xv = (struct ocfs2_xattr_value_root *)((void *)header +
5960 le16_to_cpu(xe->xe_name_offset) +
5961 OCFS2_XATTR_SIZE(xe->xe_name_len));
5963 vb->vb_xv = xv;
5964 ocfs2_init_xattr_value_extent_tree(&et, INODE_CACHE(inode), vb);
5966 ret = ocfs2_xattr_value_attach_refcount(inode, xv, &et,
5967 ref_ci, ref_root_bh,
5968 dealloc, NULL);
5969 if (ret) {
5970 mlog_errno(ret);
5971 break;
5975 return ret;
5978 static int ocfs2_xattr_inline_attach_refcount(struct inode *inode,
5979 struct buffer_head *fe_bh,
5980 struct ocfs2_caching_info *ref_ci,
5981 struct buffer_head *ref_root_bh,
5982 struct ocfs2_cached_dealloc_ctxt *dealloc)
5984 struct ocfs2_dinode *di = (struct ocfs2_dinode *)fe_bh->b_data;
5985 struct ocfs2_xattr_header *header = (struct ocfs2_xattr_header *)
5986 (fe_bh->b_data + inode->i_sb->s_blocksize -
5987 le16_to_cpu(di->i_xattr_inline_size));
5988 struct ocfs2_xattr_value_buf vb = {
5989 .vb_bh = fe_bh,
5990 .vb_access = ocfs2_journal_access_di,
5993 return ocfs2_xattr_attach_refcount_normal(inode, &vb, header,
5994 ref_ci, ref_root_bh, dealloc);
5997 struct ocfs2_xattr_tree_value_refcount_para {
5998 struct ocfs2_caching_info *ref_ci;
5999 struct buffer_head *ref_root_bh;
6000 struct ocfs2_cached_dealloc_ctxt *dealloc;
6003 static int ocfs2_get_xattr_tree_value_root(struct super_block *sb,
6004 struct ocfs2_xattr_bucket *bucket,
6005 int offset,
6006 struct ocfs2_xattr_value_root **xv,
6007 struct buffer_head **bh)
6009 int ret, block_off, name_offset;
6010 struct ocfs2_xattr_header *xh = bucket_xh(bucket);
6011 struct ocfs2_xattr_entry *xe = &xh->xh_entries[offset];
6012 void *base;
6014 ret = ocfs2_xattr_bucket_get_name_value(sb,
6015 bucket_xh(bucket),
6016 offset,
6017 &block_off,
6018 &name_offset);
6019 if (ret) {
6020 mlog_errno(ret);
6021 goto out;
6024 base = bucket_block(bucket, block_off);
6026 *xv = (struct ocfs2_xattr_value_root *)(base + name_offset +
6027 OCFS2_XATTR_SIZE(xe->xe_name_len));
6029 if (bh)
6030 *bh = bucket->bu_bhs[block_off];
6031 out:
6032 return ret;
6036 * For a given xattr bucket, refcount all the entries which
6037 * have value stored outside.
6039 static int ocfs2_xattr_bucket_value_refcount(struct inode *inode,
6040 struct ocfs2_xattr_bucket *bucket,
6041 void *para)
6043 int i, ret = 0;
6044 struct ocfs2_extent_tree et;
6045 struct ocfs2_xattr_tree_value_refcount_para *ref =
6046 (struct ocfs2_xattr_tree_value_refcount_para *)para;
6047 struct ocfs2_xattr_header *xh =
6048 (struct ocfs2_xattr_header *)bucket->bu_bhs[0]->b_data;
6049 struct ocfs2_xattr_entry *xe;
6050 struct ocfs2_xattr_value_buf vb = {
6051 .vb_access = ocfs2_journal_access,
6053 struct ocfs2_post_refcount refcount = {
6054 .credits = bucket->bu_blocks,
6055 .para = bucket,
6056 .func = ocfs2_xattr_bucket_post_refcount,
6058 struct ocfs2_post_refcount *p = NULL;
6060 /* We only need post_refcount if we support metaecc. */
6061 if (ocfs2_meta_ecc(OCFS2_SB(inode->i_sb)))
6062 p = &refcount;
6064 trace_ocfs2_xattr_bucket_value_refcount(
6065 (unsigned long long)bucket_blkno(bucket),
6066 le16_to_cpu(xh->xh_count));
6067 for (i = 0; i < le16_to_cpu(xh->xh_count); i++) {
6068 xe = &xh->xh_entries[i];
6070 if (ocfs2_xattr_is_local(xe))
6071 continue;
6073 ret = ocfs2_get_xattr_tree_value_root(inode->i_sb, bucket, i,
6074 &vb.vb_xv, &vb.vb_bh);
6075 if (ret) {
6076 mlog_errno(ret);
6077 break;
6080 ocfs2_init_xattr_value_extent_tree(&et,
6081 INODE_CACHE(inode), &vb);
6083 ret = ocfs2_xattr_value_attach_refcount(inode, vb.vb_xv,
6084 &et, ref->ref_ci,
6085 ref->ref_root_bh,
6086 ref->dealloc, p);
6087 if (ret) {
6088 mlog_errno(ret);
6089 break;
6093 return ret;
6097 static int ocfs2_refcount_xattr_tree_rec(struct inode *inode,
6098 struct buffer_head *root_bh,
6099 u64 blkno, u32 cpos, u32 len, void *para)
6101 return ocfs2_iterate_xattr_buckets(inode, blkno, len,
6102 ocfs2_xattr_bucket_value_refcount,
6103 para);
6106 static int ocfs2_xattr_block_attach_refcount(struct inode *inode,
6107 struct buffer_head *blk_bh,
6108 struct ocfs2_caching_info *ref_ci,
6109 struct buffer_head *ref_root_bh,
6110 struct ocfs2_cached_dealloc_ctxt *dealloc)
6112 int ret = 0;
6113 struct ocfs2_xattr_block *xb =
6114 (struct ocfs2_xattr_block *)blk_bh->b_data;
6116 if (!(le16_to_cpu(xb->xb_flags) & OCFS2_XATTR_INDEXED)) {
6117 struct ocfs2_xattr_header *header = &xb->xb_attrs.xb_header;
6118 struct ocfs2_xattr_value_buf vb = {
6119 .vb_bh = blk_bh,
6120 .vb_access = ocfs2_journal_access_xb,
6123 ret = ocfs2_xattr_attach_refcount_normal(inode, &vb, header,
6124 ref_ci, ref_root_bh,
6125 dealloc);
6126 } else {
6127 struct ocfs2_xattr_tree_value_refcount_para para = {
6128 .ref_ci = ref_ci,
6129 .ref_root_bh = ref_root_bh,
6130 .dealloc = dealloc,
6133 ret = ocfs2_iterate_xattr_index_block(inode, blk_bh,
6134 ocfs2_refcount_xattr_tree_rec,
6135 &para);
6138 return ret;
6141 int ocfs2_xattr_attach_refcount_tree(struct inode *inode,
6142 struct buffer_head *fe_bh,
6143 struct ocfs2_caching_info *ref_ci,
6144 struct buffer_head *ref_root_bh,
6145 struct ocfs2_cached_dealloc_ctxt *dealloc)
6147 int ret = 0;
6148 struct ocfs2_inode_info *oi = OCFS2_I(inode);
6149 struct ocfs2_dinode *di = (struct ocfs2_dinode *)fe_bh->b_data;
6150 struct buffer_head *blk_bh = NULL;
6152 if (oi->ip_dyn_features & OCFS2_INLINE_XATTR_FL) {
6153 ret = ocfs2_xattr_inline_attach_refcount(inode, fe_bh,
6154 ref_ci, ref_root_bh,
6155 dealloc);
6156 if (ret) {
6157 mlog_errno(ret);
6158 goto out;
6162 if (!di->i_xattr_loc)
6163 goto out;
6165 ret = ocfs2_read_xattr_block(inode, le64_to_cpu(di->i_xattr_loc),
6166 &blk_bh);
6167 if (ret < 0) {
6168 mlog_errno(ret);
6169 goto out;
6172 ret = ocfs2_xattr_block_attach_refcount(inode, blk_bh, ref_ci,
6173 ref_root_bh, dealloc);
6174 if (ret)
6175 mlog_errno(ret);
6177 brelse(blk_bh);
6178 out:
6180 return ret;
6183 typedef int (should_xattr_reflinked)(struct ocfs2_xattr_entry *xe);
6185 * Store the information we need in xattr reflink.
6186 * old_bh and new_bh are inode bh for the old and new inode.
6188 struct ocfs2_xattr_reflink {
6189 struct inode *old_inode;
6190 struct inode *new_inode;
6191 struct buffer_head *old_bh;
6192 struct buffer_head *new_bh;
6193 struct ocfs2_caching_info *ref_ci;
6194 struct buffer_head *ref_root_bh;
6195 struct ocfs2_cached_dealloc_ctxt *dealloc;
6196 should_xattr_reflinked *xattr_reflinked;
6200 * Given a xattr header and xe offset,
6201 * return the proper xv and the corresponding bh.
6202 * xattr in inode, block and xattr tree have different implementaions.
6204 typedef int (get_xattr_value_root)(struct super_block *sb,
6205 struct buffer_head *bh,
6206 struct ocfs2_xattr_header *xh,
6207 int offset,
6208 struct ocfs2_xattr_value_root **xv,
6209 struct buffer_head **ret_bh,
6210 void *para);
6213 * Calculate all the xattr value root metadata stored in this xattr header and
6214 * credits we need if we create them from the scratch.
6215 * We use get_xattr_value_root so that all types of xattr container can use it.
6217 static int ocfs2_value_metas_in_xattr_header(struct super_block *sb,
6218 struct buffer_head *bh,
6219 struct ocfs2_xattr_header *xh,
6220 int *metas, int *credits,
6221 int *num_recs,
6222 get_xattr_value_root *func,
6223 void *para)
6225 int i, ret = 0;
6226 struct ocfs2_xattr_value_root *xv;
6227 struct ocfs2_xattr_entry *xe;
6229 for (i = 0; i < le16_to_cpu(xh->xh_count); i++) {
6230 xe = &xh->xh_entries[i];
6231 if (ocfs2_xattr_is_local(xe))
6232 continue;
6234 ret = func(sb, bh, xh, i, &xv, NULL, para);
6235 if (ret) {
6236 mlog_errno(ret);
6237 break;
6240 *metas += le16_to_cpu(xv->xr_list.l_tree_depth) *
6241 le16_to_cpu(xv->xr_list.l_next_free_rec);
6243 *credits += ocfs2_calc_extend_credits(sb,
6244 &def_xv.xv.xr_list);
6247 * If the value is a tree with depth > 1, We don't go deep
6248 * to the extent block, so just calculate a maximum record num.
6250 if (!xv->xr_list.l_tree_depth)
6251 *num_recs += le16_to_cpu(xv->xr_list.l_next_free_rec);
6252 else
6253 *num_recs += ocfs2_clusters_for_bytes(sb,
6254 XATTR_SIZE_MAX);
6257 return ret;
6260 /* Used by xattr inode and block to return the right xv and buffer_head. */
6261 static int ocfs2_get_xattr_value_root(struct super_block *sb,
6262 struct buffer_head *bh,
6263 struct ocfs2_xattr_header *xh,
6264 int offset,
6265 struct ocfs2_xattr_value_root **xv,
6266 struct buffer_head **ret_bh,
6267 void *para)
6269 struct ocfs2_xattr_entry *xe = &xh->xh_entries[offset];
6271 *xv = (struct ocfs2_xattr_value_root *)((void *)xh +
6272 le16_to_cpu(xe->xe_name_offset) +
6273 OCFS2_XATTR_SIZE(xe->xe_name_len));
6275 if (ret_bh)
6276 *ret_bh = bh;
6278 return 0;
6282 * Lock the meta_ac and caculate how much credits we need for reflink xattrs.
6283 * It is only used for inline xattr and xattr block.
6285 static int ocfs2_reflink_lock_xattr_allocators(struct ocfs2_super *osb,
6286 struct ocfs2_xattr_header *xh,
6287 struct buffer_head *ref_root_bh,
6288 int *credits,
6289 struct ocfs2_alloc_context **meta_ac)
6291 int ret, meta_add = 0, num_recs = 0;
6292 struct ocfs2_refcount_block *rb =
6293 (struct ocfs2_refcount_block *)ref_root_bh->b_data;
6295 *credits = 0;
6297 ret = ocfs2_value_metas_in_xattr_header(osb->sb, NULL, xh,
6298 &meta_add, credits, &num_recs,
6299 ocfs2_get_xattr_value_root,
6300 NULL);
6301 if (ret) {
6302 mlog_errno(ret);
6303 goto out;
6307 * We need to add/modify num_recs in refcount tree, so just calculate
6308 * an approximate number we need for refcount tree change.
6309 * Sometimes we need to split the tree, and after split, half recs
6310 * will be moved to the new block, and a new block can only provide
6311 * half number of recs. So we multiple new blocks by 2.
6313 num_recs = num_recs / ocfs2_refcount_recs_per_rb(osb->sb) * 2;
6314 meta_add += num_recs;
6315 *credits += num_recs + num_recs * OCFS2_EXPAND_REFCOUNT_TREE_CREDITS;
6316 if (le32_to_cpu(rb->rf_flags) & OCFS2_REFCOUNT_TREE_FL)
6317 *credits += le16_to_cpu(rb->rf_list.l_tree_depth) *
6318 le16_to_cpu(rb->rf_list.l_next_free_rec) + 1;
6319 else
6320 *credits += 1;
6322 ret = ocfs2_reserve_new_metadata_blocks(osb, meta_add, meta_ac);
6323 if (ret)
6324 mlog_errno(ret);
6326 out:
6327 return ret;
6331 * Given a xattr header, reflink all the xattrs in this container.
6332 * It can be used for inode, block and bucket.
6334 * NOTE:
6335 * Before we call this function, the caller has memcpy the xattr in
6336 * old_xh to the new_xh.
6338 * If args.xattr_reflinked is set, call it to decide whether the xe should
6339 * be reflinked or not. If not, remove it from the new xattr header.
6341 static int ocfs2_reflink_xattr_header(handle_t *handle,
6342 struct ocfs2_xattr_reflink *args,
6343 struct buffer_head *old_bh,
6344 struct ocfs2_xattr_header *xh,
6345 struct buffer_head *new_bh,
6346 struct ocfs2_xattr_header *new_xh,
6347 struct ocfs2_xattr_value_buf *vb,
6348 struct ocfs2_alloc_context *meta_ac,
6349 get_xattr_value_root *func,
6350 void *para)
6352 int ret = 0, i, j;
6353 struct super_block *sb = args->old_inode->i_sb;
6354 struct buffer_head *value_bh;
6355 struct ocfs2_xattr_entry *xe, *last;
6356 struct ocfs2_xattr_value_root *xv, *new_xv;
6357 struct ocfs2_extent_tree data_et;
6358 u32 clusters, cpos, p_cluster, num_clusters;
6359 unsigned int ext_flags = 0;
6361 trace_ocfs2_reflink_xattr_header((unsigned long long)old_bh->b_blocknr,
6362 le16_to_cpu(xh->xh_count));
6364 last = &new_xh->xh_entries[le16_to_cpu(new_xh->xh_count)];
6365 for (i = 0, j = 0; i < le16_to_cpu(xh->xh_count); i++, j++) {
6366 xe = &xh->xh_entries[i];
6368 if (args->xattr_reflinked && !args->xattr_reflinked(xe)) {
6369 xe = &new_xh->xh_entries[j];
6371 le16_add_cpu(&new_xh->xh_count, -1);
6372 if (new_xh->xh_count) {
6373 memmove(xe, xe + 1,
6374 (void *)last - (void *)xe);
6375 memset(last, 0,
6376 sizeof(struct ocfs2_xattr_entry));
6380 * We don't want j to increase in the next round since
6381 * it is already moved ahead.
6383 j--;
6384 continue;
6387 if (ocfs2_xattr_is_local(xe))
6388 continue;
6390 ret = func(sb, old_bh, xh, i, &xv, NULL, para);
6391 if (ret) {
6392 mlog_errno(ret);
6393 break;
6396 ret = func(sb, new_bh, new_xh, j, &new_xv, &value_bh, para);
6397 if (ret) {
6398 mlog_errno(ret);
6399 break;
6403 * For the xattr which has l_tree_depth = 0, all the extent
6404 * recs have already be copied to the new xh with the
6405 * propriate OCFS2_EXT_REFCOUNTED flag we just need to
6406 * increase the refount count int the refcount tree.
6408 * For the xattr which has l_tree_depth > 0, we need
6409 * to initialize it to the empty default value root,
6410 * and then insert the extents one by one.
6412 if (xv->xr_list.l_tree_depth) {
6413 memcpy(new_xv, &def_xv, OCFS2_XATTR_ROOT_SIZE);
6414 vb->vb_xv = new_xv;
6415 vb->vb_bh = value_bh;
6416 ocfs2_init_xattr_value_extent_tree(&data_et,
6417 INODE_CACHE(args->new_inode), vb);
6420 clusters = le32_to_cpu(xv->xr_clusters);
6421 cpos = 0;
6422 while (cpos < clusters) {
6423 ret = ocfs2_xattr_get_clusters(args->old_inode,
6424 cpos,
6425 &p_cluster,
6426 &num_clusters,
6427 &xv->xr_list,
6428 &ext_flags);
6429 if (ret) {
6430 mlog_errno(ret);
6431 goto out;
6434 BUG_ON(!p_cluster);
6436 if (xv->xr_list.l_tree_depth) {
6437 ret = ocfs2_insert_extent(handle,
6438 &data_et, cpos,
6439 ocfs2_clusters_to_blocks(
6440 args->old_inode->i_sb,
6441 p_cluster),
6442 num_clusters, ext_flags,
6443 meta_ac);
6444 if (ret) {
6445 mlog_errno(ret);
6446 goto out;
6450 ret = ocfs2_increase_refcount(handle, args->ref_ci,
6451 args->ref_root_bh,
6452 p_cluster, num_clusters,
6453 meta_ac, args->dealloc);
6454 if (ret) {
6455 mlog_errno(ret);
6456 goto out;
6459 cpos += num_clusters;
6463 out:
6464 return ret;
6467 static int ocfs2_reflink_xattr_inline(struct ocfs2_xattr_reflink *args)
6469 int ret = 0, credits = 0;
6470 handle_t *handle;
6471 struct ocfs2_super *osb = OCFS2_SB(args->old_inode->i_sb);
6472 struct ocfs2_dinode *di = (struct ocfs2_dinode *)args->old_bh->b_data;
6473 int inline_size = le16_to_cpu(di->i_xattr_inline_size);
6474 int header_off = osb->sb->s_blocksize - inline_size;
6475 struct ocfs2_xattr_header *xh = (struct ocfs2_xattr_header *)
6476 (args->old_bh->b_data + header_off);
6477 struct ocfs2_xattr_header *new_xh = (struct ocfs2_xattr_header *)
6478 (args->new_bh->b_data + header_off);
6479 struct ocfs2_alloc_context *meta_ac = NULL;
6480 struct ocfs2_inode_info *new_oi;
6481 struct ocfs2_dinode *new_di;
6482 struct ocfs2_xattr_value_buf vb = {
6483 .vb_bh = args->new_bh,
6484 .vb_access = ocfs2_journal_access_di,
6487 ret = ocfs2_reflink_lock_xattr_allocators(osb, xh, args->ref_root_bh,
6488 &credits, &meta_ac);
6489 if (ret) {
6490 mlog_errno(ret);
6491 goto out;
6494 handle = ocfs2_start_trans(osb, credits);
6495 if (IS_ERR(handle)) {
6496 ret = PTR_ERR(handle);
6497 mlog_errno(ret);
6498 goto out;
6501 ret = ocfs2_journal_access_di(handle, INODE_CACHE(args->new_inode),
6502 args->new_bh, OCFS2_JOURNAL_ACCESS_WRITE);
6503 if (ret) {
6504 mlog_errno(ret);
6505 goto out_commit;
6508 memcpy(args->new_bh->b_data + header_off,
6509 args->old_bh->b_data + header_off, inline_size);
6511 new_di = (struct ocfs2_dinode *)args->new_bh->b_data;
6512 new_di->i_xattr_inline_size = cpu_to_le16(inline_size);
6514 ret = ocfs2_reflink_xattr_header(handle, args, args->old_bh, xh,
6515 args->new_bh, new_xh, &vb, meta_ac,
6516 ocfs2_get_xattr_value_root, NULL);
6517 if (ret) {
6518 mlog_errno(ret);
6519 goto out_commit;
6522 new_oi = OCFS2_I(args->new_inode);
6524 * Adjust extent record count to reserve space for extended attribute.
6525 * Inline data count had been adjusted in ocfs2_duplicate_inline_data().
6527 if (!(new_oi->ip_dyn_features & OCFS2_INLINE_DATA_FL) &&
6528 !(ocfs2_inode_is_fast_symlink(args->new_inode))) {
6529 struct ocfs2_extent_list *el = &new_di->id2.i_list;
6530 le16_add_cpu(&el->l_count, -(inline_size /
6531 sizeof(struct ocfs2_extent_rec)));
6533 spin_lock(&new_oi->ip_lock);
6534 new_oi->ip_dyn_features |= OCFS2_HAS_XATTR_FL | OCFS2_INLINE_XATTR_FL;
6535 new_di->i_dyn_features = cpu_to_le16(new_oi->ip_dyn_features);
6536 spin_unlock(&new_oi->ip_lock);
6538 ocfs2_journal_dirty(handle, args->new_bh);
6540 out_commit:
6541 ocfs2_commit_trans(osb, handle);
6543 out:
6544 if (meta_ac)
6545 ocfs2_free_alloc_context(meta_ac);
6546 return ret;
6549 static int ocfs2_create_empty_xattr_block(struct inode *inode,
6550 struct buffer_head *fe_bh,
6551 struct buffer_head **ret_bh,
6552 int indexed)
6554 int ret;
6555 struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
6556 struct ocfs2_xattr_set_ctxt ctxt;
6558 memset(&ctxt, 0, sizeof(ctxt));
6559 ret = ocfs2_reserve_new_metadata_blocks(osb, 1, &ctxt.meta_ac);
6560 if (ret < 0) {
6561 mlog_errno(ret);
6562 return ret;
6565 ctxt.handle = ocfs2_start_trans(osb, OCFS2_XATTR_BLOCK_CREATE_CREDITS);
6566 if (IS_ERR(ctxt.handle)) {
6567 ret = PTR_ERR(ctxt.handle);
6568 mlog_errno(ret);
6569 goto out;
6572 trace_ocfs2_create_empty_xattr_block(
6573 (unsigned long long)fe_bh->b_blocknr, indexed);
6574 ret = ocfs2_create_xattr_block(inode, fe_bh, &ctxt, indexed,
6575 ret_bh);
6576 if (ret)
6577 mlog_errno(ret);
6579 ocfs2_commit_trans(osb, ctxt.handle);
6580 out:
6581 ocfs2_free_alloc_context(ctxt.meta_ac);
6582 return ret;
6585 static int ocfs2_reflink_xattr_block(struct ocfs2_xattr_reflink *args,
6586 struct buffer_head *blk_bh,
6587 struct buffer_head *new_blk_bh)
6589 int ret = 0, credits = 0;
6590 handle_t *handle;
6591 struct ocfs2_inode_info *new_oi = OCFS2_I(args->new_inode);
6592 struct ocfs2_dinode *new_di;
6593 struct ocfs2_super *osb = OCFS2_SB(args->new_inode->i_sb);
6594 int header_off = offsetof(struct ocfs2_xattr_block, xb_attrs.xb_header);
6595 struct ocfs2_xattr_block *xb =
6596 (struct ocfs2_xattr_block *)blk_bh->b_data;
6597 struct ocfs2_xattr_header *xh = &xb->xb_attrs.xb_header;
6598 struct ocfs2_xattr_block *new_xb =
6599 (struct ocfs2_xattr_block *)new_blk_bh->b_data;
6600 struct ocfs2_xattr_header *new_xh = &new_xb->xb_attrs.xb_header;
6601 struct ocfs2_alloc_context *meta_ac;
6602 struct ocfs2_xattr_value_buf vb = {
6603 .vb_bh = new_blk_bh,
6604 .vb_access = ocfs2_journal_access_xb,
6607 ret = ocfs2_reflink_lock_xattr_allocators(osb, xh, args->ref_root_bh,
6608 &credits, &meta_ac);
6609 if (ret) {
6610 mlog_errno(ret);
6611 return ret;
6614 /* One more credits in case we need to add xattr flags in new inode. */
6615 handle = ocfs2_start_trans(osb, credits + 1);
6616 if (IS_ERR(handle)) {
6617 ret = PTR_ERR(handle);
6618 mlog_errno(ret);
6619 goto out;
6622 if (!(new_oi->ip_dyn_features & OCFS2_HAS_XATTR_FL)) {
6623 ret = ocfs2_journal_access_di(handle,
6624 INODE_CACHE(args->new_inode),
6625 args->new_bh,
6626 OCFS2_JOURNAL_ACCESS_WRITE);
6627 if (ret) {
6628 mlog_errno(ret);
6629 goto out_commit;
6633 ret = ocfs2_journal_access_xb(handle, INODE_CACHE(args->new_inode),
6634 new_blk_bh, OCFS2_JOURNAL_ACCESS_WRITE);
6635 if (ret) {
6636 mlog_errno(ret);
6637 goto out_commit;
6640 memcpy(new_blk_bh->b_data + header_off, blk_bh->b_data + header_off,
6641 osb->sb->s_blocksize - header_off);
6643 ret = ocfs2_reflink_xattr_header(handle, args, blk_bh, xh,
6644 new_blk_bh, new_xh, &vb, meta_ac,
6645 ocfs2_get_xattr_value_root, NULL);
6646 if (ret) {
6647 mlog_errno(ret);
6648 goto out_commit;
6651 ocfs2_journal_dirty(handle, new_blk_bh);
6653 if (!(new_oi->ip_dyn_features & OCFS2_HAS_XATTR_FL)) {
6654 new_di = (struct ocfs2_dinode *)args->new_bh->b_data;
6655 spin_lock(&new_oi->ip_lock);
6656 new_oi->ip_dyn_features |= OCFS2_HAS_XATTR_FL;
6657 new_di->i_dyn_features = cpu_to_le16(new_oi->ip_dyn_features);
6658 spin_unlock(&new_oi->ip_lock);
6660 ocfs2_journal_dirty(handle, args->new_bh);
6663 out_commit:
6664 ocfs2_commit_trans(osb, handle);
6666 out:
6667 ocfs2_free_alloc_context(meta_ac);
6668 return ret;
6671 struct ocfs2_reflink_xattr_tree_args {
6672 struct ocfs2_xattr_reflink *reflink;
6673 struct buffer_head *old_blk_bh;
6674 struct buffer_head *new_blk_bh;
6675 struct ocfs2_xattr_bucket *old_bucket;
6676 struct ocfs2_xattr_bucket *new_bucket;
6680 * NOTE:
6681 * We have to handle the case that both old bucket and new bucket
6682 * will call this function to get the right ret_bh.
6683 * So The caller must give us the right bh.
6685 static int ocfs2_get_reflink_xattr_value_root(struct super_block *sb,
6686 struct buffer_head *bh,
6687 struct ocfs2_xattr_header *xh,
6688 int offset,
6689 struct ocfs2_xattr_value_root **xv,
6690 struct buffer_head **ret_bh,
6691 void *para)
6693 struct ocfs2_reflink_xattr_tree_args *args =
6694 (struct ocfs2_reflink_xattr_tree_args *)para;
6695 struct ocfs2_xattr_bucket *bucket;
6697 if (bh == args->old_bucket->bu_bhs[0])
6698 bucket = args->old_bucket;
6699 else
6700 bucket = args->new_bucket;
6702 return ocfs2_get_xattr_tree_value_root(sb, bucket, offset,
6703 xv, ret_bh);
6706 struct ocfs2_value_tree_metas {
6707 int num_metas;
6708 int credits;
6709 int num_recs;
6712 static int ocfs2_value_tree_metas_in_bucket(struct super_block *sb,
6713 struct buffer_head *bh,
6714 struct ocfs2_xattr_header *xh,
6715 int offset,
6716 struct ocfs2_xattr_value_root **xv,
6717 struct buffer_head **ret_bh,
6718 void *para)
6720 struct ocfs2_xattr_bucket *bucket =
6721 (struct ocfs2_xattr_bucket *)para;
6723 return ocfs2_get_xattr_tree_value_root(sb, bucket, offset,
6724 xv, ret_bh);
6727 static int ocfs2_calc_value_tree_metas(struct inode *inode,
6728 struct ocfs2_xattr_bucket *bucket,
6729 void *para)
6731 struct ocfs2_value_tree_metas *metas =
6732 (struct ocfs2_value_tree_metas *)para;
6733 struct ocfs2_xattr_header *xh =
6734 (struct ocfs2_xattr_header *)bucket->bu_bhs[0]->b_data;
6736 /* Add the credits for this bucket first. */
6737 metas->credits += bucket->bu_blocks;
6738 return ocfs2_value_metas_in_xattr_header(inode->i_sb, bucket->bu_bhs[0],
6739 xh, &metas->num_metas,
6740 &metas->credits, &metas->num_recs,
6741 ocfs2_value_tree_metas_in_bucket,
6742 bucket);
6746 * Given a xattr extent rec starting from blkno and having len clusters,
6747 * iterate all the buckets calculate how much metadata we need for reflinking
6748 * all the ocfs2_xattr_value_root and lock the allocators accordingly.
6750 static int ocfs2_lock_reflink_xattr_rec_allocators(
6751 struct ocfs2_reflink_xattr_tree_args *args,
6752 struct ocfs2_extent_tree *xt_et,
6753 u64 blkno, u32 len, int *credits,
6754 struct ocfs2_alloc_context **meta_ac,
6755 struct ocfs2_alloc_context **data_ac)
6757 int ret, num_free_extents;
6758 struct ocfs2_value_tree_metas metas;
6759 struct ocfs2_super *osb = OCFS2_SB(args->reflink->old_inode->i_sb);
6760 struct ocfs2_refcount_block *rb;
6762 memset(&metas, 0, sizeof(metas));
6764 ret = ocfs2_iterate_xattr_buckets(args->reflink->old_inode, blkno, len,
6765 ocfs2_calc_value_tree_metas, &metas);
6766 if (ret) {
6767 mlog_errno(ret);
6768 goto out;
6771 *credits = metas.credits;
6774 * Calculate we need for refcount tree change.
6776 * We need to add/modify num_recs in refcount tree, so just calculate
6777 * an approximate number we need for refcount tree change.
6778 * Sometimes we need to split the tree, and after split, half recs
6779 * will be moved to the new block, and a new block can only provide
6780 * half number of recs. So we multiple new blocks by 2.
6781 * In the end, we have to add credits for modifying the already
6782 * existed refcount block.
6784 rb = (struct ocfs2_refcount_block *)args->reflink->ref_root_bh->b_data;
6785 metas.num_recs =
6786 (metas.num_recs + ocfs2_refcount_recs_per_rb(osb->sb) - 1) /
6787 ocfs2_refcount_recs_per_rb(osb->sb) * 2;
6788 metas.num_metas += metas.num_recs;
6789 *credits += metas.num_recs +
6790 metas.num_recs * OCFS2_EXPAND_REFCOUNT_TREE_CREDITS;
6791 if (le32_to_cpu(rb->rf_flags) & OCFS2_REFCOUNT_TREE_FL)
6792 *credits += le16_to_cpu(rb->rf_list.l_tree_depth) *
6793 le16_to_cpu(rb->rf_list.l_next_free_rec) + 1;
6794 else
6795 *credits += 1;
6797 /* count in the xattr tree change. */
6798 num_free_extents = ocfs2_num_free_extents(xt_et);
6799 if (num_free_extents < 0) {
6800 ret = num_free_extents;
6801 mlog_errno(ret);
6802 goto out;
6805 if (num_free_extents < len)
6806 metas.num_metas += ocfs2_extend_meta_needed(xt_et->et_root_el);
6808 *credits += ocfs2_calc_extend_credits(osb->sb,
6809 xt_et->et_root_el);
6811 if (metas.num_metas) {
6812 ret = ocfs2_reserve_new_metadata_blocks(osb, metas.num_metas,
6813 meta_ac);
6814 if (ret) {
6815 mlog_errno(ret);
6816 goto out;
6820 if (len) {
6821 ret = ocfs2_reserve_clusters(osb, len, data_ac);
6822 if (ret)
6823 mlog_errno(ret);
6825 out:
6826 if (ret) {
6827 if (*meta_ac) {
6828 ocfs2_free_alloc_context(*meta_ac);
6829 *meta_ac = NULL;
6833 return ret;
6836 static int ocfs2_reflink_xattr_bucket(handle_t *handle,
6837 u64 blkno, u64 new_blkno, u32 clusters,
6838 u32 *cpos, int num_buckets,
6839 struct ocfs2_alloc_context *meta_ac,
6840 struct ocfs2_alloc_context *data_ac,
6841 struct ocfs2_reflink_xattr_tree_args *args)
6843 int i, j, ret = 0;
6844 struct super_block *sb = args->reflink->old_inode->i_sb;
6845 int bpb = args->old_bucket->bu_blocks;
6846 struct ocfs2_xattr_value_buf vb = {
6847 .vb_access = ocfs2_journal_access,
6850 for (i = 0; i < num_buckets; i++, blkno += bpb, new_blkno += bpb) {
6851 ret = ocfs2_read_xattr_bucket(args->old_bucket, blkno);
6852 if (ret) {
6853 mlog_errno(ret);
6854 break;
6857 ret = ocfs2_init_xattr_bucket(args->new_bucket, new_blkno, 1);
6858 if (ret) {
6859 mlog_errno(ret);
6860 break;
6863 ret = ocfs2_xattr_bucket_journal_access(handle,
6864 args->new_bucket,
6865 OCFS2_JOURNAL_ACCESS_CREATE);
6866 if (ret) {
6867 mlog_errno(ret);
6868 break;
6871 for (j = 0; j < bpb; j++)
6872 memcpy(bucket_block(args->new_bucket, j),
6873 bucket_block(args->old_bucket, j),
6874 sb->s_blocksize);
6877 * Record the start cpos so that we can use it to initialize
6878 * our xattr tree we also set the xh_num_bucket for the new
6879 * bucket.
6881 if (i == 0) {
6882 *cpos = le32_to_cpu(bucket_xh(args->new_bucket)->
6883 xh_entries[0].xe_name_hash);
6884 bucket_xh(args->new_bucket)->xh_num_buckets =
6885 cpu_to_le16(num_buckets);
6888 ocfs2_xattr_bucket_journal_dirty(handle, args->new_bucket);
6890 ret = ocfs2_reflink_xattr_header(handle, args->reflink,
6891 args->old_bucket->bu_bhs[0],
6892 bucket_xh(args->old_bucket),
6893 args->new_bucket->bu_bhs[0],
6894 bucket_xh(args->new_bucket),
6895 &vb, meta_ac,
6896 ocfs2_get_reflink_xattr_value_root,
6897 args);
6898 if (ret) {
6899 mlog_errno(ret);
6900 break;
6904 * Re-access and dirty the bucket to calculate metaecc.
6905 * Because we may extend the transaction in reflink_xattr_header
6906 * which will let the already accessed block gone.
6908 ret = ocfs2_xattr_bucket_journal_access(handle,
6909 args->new_bucket,
6910 OCFS2_JOURNAL_ACCESS_WRITE);
6911 if (ret) {
6912 mlog_errno(ret);
6913 break;
6916 ocfs2_xattr_bucket_journal_dirty(handle, args->new_bucket);
6918 ocfs2_xattr_bucket_relse(args->old_bucket);
6919 ocfs2_xattr_bucket_relse(args->new_bucket);
6922 ocfs2_xattr_bucket_relse(args->old_bucket);
6923 ocfs2_xattr_bucket_relse(args->new_bucket);
6924 return ret;
6927 static int ocfs2_reflink_xattr_buckets(handle_t *handle,
6928 struct inode *inode,
6929 struct ocfs2_reflink_xattr_tree_args *args,
6930 struct ocfs2_extent_tree *et,
6931 struct ocfs2_alloc_context *meta_ac,
6932 struct ocfs2_alloc_context *data_ac,
6933 u64 blkno, u32 cpos, u32 len)
6935 int ret, first_inserted = 0;
6936 u32 p_cluster, num_clusters, reflink_cpos = 0;
6937 u64 new_blkno;
6938 unsigned int num_buckets, reflink_buckets;
6939 unsigned int bpc =
6940 ocfs2_xattr_buckets_per_cluster(OCFS2_SB(inode->i_sb));
6942 ret = ocfs2_read_xattr_bucket(args->old_bucket, blkno);
6943 if (ret) {
6944 mlog_errno(ret);
6945 goto out;
6947 num_buckets = le16_to_cpu(bucket_xh(args->old_bucket)->xh_num_buckets);
6948 ocfs2_xattr_bucket_relse(args->old_bucket);
6950 while (len && num_buckets) {
6951 ret = ocfs2_claim_clusters(handle, data_ac,
6952 1, &p_cluster, &num_clusters);
6953 if (ret) {
6954 mlog_errno(ret);
6955 goto out;
6958 new_blkno = ocfs2_clusters_to_blocks(inode->i_sb, p_cluster);
6959 reflink_buckets = min(num_buckets, bpc * num_clusters);
6961 ret = ocfs2_reflink_xattr_bucket(handle, blkno,
6962 new_blkno, num_clusters,
6963 &reflink_cpos, reflink_buckets,
6964 meta_ac, data_ac, args);
6965 if (ret) {
6966 mlog_errno(ret);
6967 goto out;
6971 * For the 1st allocated cluster, we make it use the same cpos
6972 * so that the xattr tree looks the same as the original one
6973 * in the most case.
6975 if (!first_inserted) {
6976 reflink_cpos = cpos;
6977 first_inserted = 1;
6979 ret = ocfs2_insert_extent(handle, et, reflink_cpos, new_blkno,
6980 num_clusters, 0, meta_ac);
6981 if (ret)
6982 mlog_errno(ret);
6984 trace_ocfs2_reflink_xattr_buckets((unsigned long long)new_blkno,
6985 num_clusters, reflink_cpos);
6987 len -= num_clusters;
6988 blkno += ocfs2_clusters_to_blocks(inode->i_sb, num_clusters);
6989 num_buckets -= reflink_buckets;
6991 out:
6992 return ret;
6996 * Create the same xattr extent record in the new inode's xattr tree.
6998 static int ocfs2_reflink_xattr_rec(struct inode *inode,
6999 struct buffer_head *root_bh,
7000 u64 blkno,
7001 u32 cpos,
7002 u32 len,
7003 void *para)
7005 int ret, credits = 0;
7006 handle_t *handle;
7007 struct ocfs2_reflink_xattr_tree_args *args =
7008 (struct ocfs2_reflink_xattr_tree_args *)para;
7009 struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
7010 struct ocfs2_alloc_context *meta_ac = NULL;
7011 struct ocfs2_alloc_context *data_ac = NULL;
7012 struct ocfs2_extent_tree et;
7014 trace_ocfs2_reflink_xattr_rec((unsigned long long)blkno, len);
7016 ocfs2_init_xattr_tree_extent_tree(&et,
7017 INODE_CACHE(args->reflink->new_inode),
7018 args->new_blk_bh);
7020 ret = ocfs2_lock_reflink_xattr_rec_allocators(args, &et, blkno,
7021 len, &credits,
7022 &meta_ac, &data_ac);
7023 if (ret) {
7024 mlog_errno(ret);
7025 goto out;
7028 handle = ocfs2_start_trans(osb, credits);
7029 if (IS_ERR(handle)) {
7030 ret = PTR_ERR(handle);
7031 mlog_errno(ret);
7032 goto out;
7035 ret = ocfs2_reflink_xattr_buckets(handle, inode, args, &et,
7036 meta_ac, data_ac,
7037 blkno, cpos, len);
7038 if (ret)
7039 mlog_errno(ret);
7041 ocfs2_commit_trans(osb, handle);
7043 out:
7044 if (meta_ac)
7045 ocfs2_free_alloc_context(meta_ac);
7046 if (data_ac)
7047 ocfs2_free_alloc_context(data_ac);
7048 return ret;
7052 * Create reflinked xattr buckets.
7053 * We will add bucket one by one, and refcount all the xattrs in the bucket
7054 * if they are stored outside.
7056 static int ocfs2_reflink_xattr_tree(struct ocfs2_xattr_reflink *args,
7057 struct buffer_head *blk_bh,
7058 struct buffer_head *new_blk_bh)
7060 int ret;
7061 struct ocfs2_reflink_xattr_tree_args para;
7063 memset(&para, 0, sizeof(para));
7064 para.reflink = args;
7065 para.old_blk_bh = blk_bh;
7066 para.new_blk_bh = new_blk_bh;
7068 para.old_bucket = ocfs2_xattr_bucket_new(args->old_inode);
7069 if (!para.old_bucket) {
7070 mlog_errno(-ENOMEM);
7071 return -ENOMEM;
7074 para.new_bucket = ocfs2_xattr_bucket_new(args->new_inode);
7075 if (!para.new_bucket) {
7076 ret = -ENOMEM;
7077 mlog_errno(ret);
7078 goto out;
7081 ret = ocfs2_iterate_xattr_index_block(args->old_inode, blk_bh,
7082 ocfs2_reflink_xattr_rec,
7083 &para);
7084 if (ret)
7085 mlog_errno(ret);
7087 out:
7088 ocfs2_xattr_bucket_free(para.old_bucket);
7089 ocfs2_xattr_bucket_free(para.new_bucket);
7090 return ret;
7093 static int ocfs2_reflink_xattr_in_block(struct ocfs2_xattr_reflink *args,
7094 struct buffer_head *blk_bh)
7096 int ret, indexed = 0;
7097 struct buffer_head *new_blk_bh = NULL;
7098 struct ocfs2_xattr_block *xb =
7099 (struct ocfs2_xattr_block *)blk_bh->b_data;
7102 if (le16_to_cpu(xb->xb_flags) & OCFS2_XATTR_INDEXED)
7103 indexed = 1;
7105 ret = ocfs2_create_empty_xattr_block(args->new_inode, args->new_bh,
7106 &new_blk_bh, indexed);
7107 if (ret) {
7108 mlog_errno(ret);
7109 goto out;
7112 if (!indexed)
7113 ret = ocfs2_reflink_xattr_block(args, blk_bh, new_blk_bh);
7114 else
7115 ret = ocfs2_reflink_xattr_tree(args, blk_bh, new_blk_bh);
7116 if (ret)
7117 mlog_errno(ret);
7119 out:
7120 brelse(new_blk_bh);
7121 return ret;
7124 static int ocfs2_reflink_xattr_no_security(struct ocfs2_xattr_entry *xe)
7126 int type = ocfs2_xattr_get_type(xe);
7128 return type != OCFS2_XATTR_INDEX_SECURITY &&
7129 type != OCFS2_XATTR_INDEX_POSIX_ACL_ACCESS &&
7130 type != OCFS2_XATTR_INDEX_POSIX_ACL_DEFAULT;
7133 int ocfs2_reflink_xattrs(struct inode *old_inode,
7134 struct buffer_head *old_bh,
7135 struct inode *new_inode,
7136 struct buffer_head *new_bh,
7137 bool preserve_security)
7139 int ret;
7140 struct ocfs2_xattr_reflink args;
7141 struct ocfs2_inode_info *oi = OCFS2_I(old_inode);
7142 struct ocfs2_dinode *di = (struct ocfs2_dinode *)old_bh->b_data;
7143 struct buffer_head *blk_bh = NULL;
7144 struct ocfs2_cached_dealloc_ctxt dealloc;
7145 struct ocfs2_refcount_tree *ref_tree;
7146 struct buffer_head *ref_root_bh = NULL;
7148 ret = ocfs2_lock_refcount_tree(OCFS2_SB(old_inode->i_sb),
7149 le64_to_cpu(di->i_refcount_loc),
7150 1, &ref_tree, &ref_root_bh);
7151 if (ret) {
7152 mlog_errno(ret);
7153 goto out;
7156 ocfs2_init_dealloc_ctxt(&dealloc);
7158 args.old_inode = old_inode;
7159 args.new_inode = new_inode;
7160 args.old_bh = old_bh;
7161 args.new_bh = new_bh;
7162 args.ref_ci = &ref_tree->rf_ci;
7163 args.ref_root_bh = ref_root_bh;
7164 args.dealloc = &dealloc;
7165 if (preserve_security)
7166 args.xattr_reflinked = NULL;
7167 else
7168 args.xattr_reflinked = ocfs2_reflink_xattr_no_security;
7170 if (oi->ip_dyn_features & OCFS2_INLINE_XATTR_FL) {
7171 ret = ocfs2_reflink_xattr_inline(&args);
7172 if (ret) {
7173 mlog_errno(ret);
7174 goto out_unlock;
7178 if (!di->i_xattr_loc)
7179 goto out_unlock;
7181 ret = ocfs2_read_xattr_block(old_inode, le64_to_cpu(di->i_xattr_loc),
7182 &blk_bh);
7183 if (ret < 0) {
7184 mlog_errno(ret);
7185 goto out_unlock;
7188 ret = ocfs2_reflink_xattr_in_block(&args, blk_bh);
7189 if (ret)
7190 mlog_errno(ret);
7192 brelse(blk_bh);
7194 out_unlock:
7195 ocfs2_unlock_refcount_tree(OCFS2_SB(old_inode->i_sb),
7196 ref_tree, 1);
7197 brelse(ref_root_bh);
7199 if (ocfs2_dealloc_has_cluster(&dealloc)) {
7200 ocfs2_schedule_truncate_log_flush(OCFS2_SB(old_inode->i_sb), 1);
7201 ocfs2_run_deallocs(OCFS2_SB(old_inode->i_sb), &dealloc);
7204 out:
7205 return ret;
7209 * Initialize security and acl for a already created inode.
7210 * Used for reflink a non-preserve-security file.
7212 * It uses common api like ocfs2_xattr_set, so the caller
7213 * must not hold any lock expect i_mutex.
7215 int ocfs2_init_security_and_acl(struct inode *dir,
7216 struct inode *inode,
7217 const struct qstr *qstr)
7219 int ret = 0;
7220 struct buffer_head *dir_bh = NULL;
7222 ret = ocfs2_init_security_get(inode, dir, qstr, NULL);
7223 if (ret) {
7224 mlog_errno(ret);
7225 goto leave;
7228 ret = ocfs2_inode_lock(dir, &dir_bh, 0);
7229 if (ret) {
7230 mlog_errno(ret);
7231 goto leave;
7233 ret = ocfs2_init_acl(NULL, inode, dir, NULL, dir_bh, NULL, NULL);
7234 if (ret)
7235 mlog_errno(ret);
7237 ocfs2_inode_unlock(dir, 0);
7238 brelse(dir_bh);
7239 leave:
7240 return ret;
7244 * 'security' attributes support
7246 static int ocfs2_xattr_security_get(const struct xattr_handler *handler,
7247 struct dentry *unused, struct inode *inode,
7248 const char *name, void *buffer, size_t size)
7250 return ocfs2_xattr_get(inode, OCFS2_XATTR_INDEX_SECURITY,
7251 name, buffer, size);
7254 static int ocfs2_xattr_security_set(const struct xattr_handler *handler,
7255 struct dentry *unused, struct inode *inode,
7256 const char *name, const void *value,
7257 size_t size, int flags)
7259 return ocfs2_xattr_set(inode, OCFS2_XATTR_INDEX_SECURITY,
7260 name, value, size, flags);
7263 static int ocfs2_initxattrs(struct inode *inode, const struct xattr *xattr_array,
7264 void *fs_info)
7266 const struct xattr *xattr;
7267 int err = 0;
7269 for (xattr = xattr_array; xattr->name != NULL; xattr++) {
7270 err = ocfs2_xattr_set(inode, OCFS2_XATTR_INDEX_SECURITY,
7271 xattr->name, xattr->value,
7272 xattr->value_len, XATTR_CREATE);
7273 if (err)
7274 break;
7276 return err;
7279 int ocfs2_init_security_get(struct inode *inode,
7280 struct inode *dir,
7281 const struct qstr *qstr,
7282 struct ocfs2_security_xattr_info *si)
7284 /* check whether ocfs2 support feature xattr */
7285 if (!ocfs2_supports_xattr(OCFS2_SB(dir->i_sb)))
7286 return -EOPNOTSUPP;
7287 if (si)
7288 return security_old_inode_init_security(inode, dir, qstr,
7289 &si->name, &si->value,
7290 &si->value_len);
7292 return security_inode_init_security(inode, dir, qstr,
7293 &ocfs2_initxattrs, NULL);
7296 int ocfs2_init_security_set(handle_t *handle,
7297 struct inode *inode,
7298 struct buffer_head *di_bh,
7299 struct ocfs2_security_xattr_info *si,
7300 struct ocfs2_alloc_context *xattr_ac,
7301 struct ocfs2_alloc_context *data_ac)
7303 return ocfs2_xattr_set_handle(handle, inode, di_bh,
7304 OCFS2_XATTR_INDEX_SECURITY,
7305 si->name, si->value, si->value_len, 0,
7306 xattr_ac, data_ac);
7309 const struct xattr_handler ocfs2_xattr_security_handler = {
7310 .prefix = XATTR_SECURITY_PREFIX,
7311 .get = ocfs2_xattr_security_get,
7312 .set = ocfs2_xattr_security_set,
7316 * 'trusted' attributes support
7318 static int ocfs2_xattr_trusted_get(const struct xattr_handler *handler,
7319 struct dentry *unused, struct inode *inode,
7320 const char *name, void *buffer, size_t size)
7322 return ocfs2_xattr_get(inode, OCFS2_XATTR_INDEX_TRUSTED,
7323 name, buffer, size);
7326 static int ocfs2_xattr_trusted_set(const struct xattr_handler *handler,
7327 struct dentry *unused, struct inode *inode,
7328 const char *name, const void *value,
7329 size_t size, int flags)
7331 return ocfs2_xattr_set(inode, OCFS2_XATTR_INDEX_TRUSTED,
7332 name, value, size, flags);
7335 const struct xattr_handler ocfs2_xattr_trusted_handler = {
7336 .prefix = XATTR_TRUSTED_PREFIX,
7337 .get = ocfs2_xattr_trusted_get,
7338 .set = ocfs2_xattr_trusted_set,
7342 * 'user' attributes support
7344 static int ocfs2_xattr_user_get(const struct xattr_handler *handler,
7345 struct dentry *unused, struct inode *inode,
7346 const char *name, void *buffer, size_t size)
7348 struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
7350 if (osb->s_mount_opt & OCFS2_MOUNT_NOUSERXATTR)
7351 return -EOPNOTSUPP;
7352 return ocfs2_xattr_get(inode, OCFS2_XATTR_INDEX_USER, name,
7353 buffer, size);
7356 static int ocfs2_xattr_user_set(const struct xattr_handler *handler,
7357 struct dentry *unused, struct inode *inode,
7358 const char *name, const void *value,
7359 size_t size, int flags)
7361 struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
7363 if (osb->s_mount_opt & OCFS2_MOUNT_NOUSERXATTR)
7364 return -EOPNOTSUPP;
7366 return ocfs2_xattr_set(inode, OCFS2_XATTR_INDEX_USER,
7367 name, value, size, flags);
7370 const struct xattr_handler ocfs2_xattr_user_handler = {
7371 .prefix = XATTR_USER_PREFIX,
7372 .get = ocfs2_xattr_user_get,
7373 .set = ocfs2_xattr_user_set,