blob: 28712d29e43ca4d98af4e11c0ec6a541b73a0a3c [file] [log] [blame]
Linus Torvalds1da177e2005-04-16 15:20:36 -07001/*
Nathan Scott7b718762005-11-02 14:58:39 +11002 * Copyright (c) 2000-2005 Silicon Graphics, Inc.
Dave Chinner517c2222013-04-24 18:58:55 +10003 * Copyright (c) 2013 Red Hat, Inc.
Nathan Scott7b718762005-11-02 14:58:39 +11004 * All Rights Reserved.
Linus Torvalds1da177e2005-04-16 15:20:36 -07005 *
Nathan Scott7b718762005-11-02 14:58:39 +11006 * This program is free software; you can redistribute it and/or
7 * modify it under the terms of the GNU General Public License as
Linus Torvalds1da177e2005-04-16 15:20:36 -07008 * published by the Free Software Foundation.
9 *
Nathan Scott7b718762005-11-02 14:58:39 +110010 * This program is distributed in the hope that it would be useful,
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 * GNU General Public License for more details.
Linus Torvalds1da177e2005-04-16 15:20:36 -070014 *
Nathan Scott7b718762005-11-02 14:58:39 +110015 * You should have received a copy of the GNU General Public License
16 * along with this program; if not, write the Free Software Foundation,
17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
Linus Torvalds1da177e2005-04-16 15:20:36 -070018 */
Linus Torvalds1da177e2005-04-16 15:20:36 -070019#include "xfs.h"
Nathan Scotta844f452005-11-02 14:38:42 +110020#include "xfs_fs.h"
Dave Chinner632b89e2013-10-29 22:11:58 +110021#include "xfs_shared.h"
Dave Chinnera4fbe6a2013-10-23 10:51:50 +110022#include "xfs_format.h"
Dave Chinner239880e2013-10-23 10:50:10 +110023#include "xfs_log_format.h"
24#include "xfs_trans_resv.h"
Nathan Scotta844f452005-11-02 14:38:42 +110025#include "xfs_bit.h"
Linus Torvalds1da177e2005-04-16 15:20:36 -070026#include "xfs_sb.h"
27#include "xfs_ag.h"
Linus Torvalds1da177e2005-04-16 15:20:36 -070028#include "xfs_mount.h"
Dave Chinner57062782013-10-15 09:17:51 +110029#include "xfs_da_format.h"
Nathan Scotta844f452005-11-02 14:38:42 +110030#include "xfs_da_btree.h"
Linus Torvalds1da177e2005-04-16 15:20:36 -070031#include "xfs_inode.h"
Dave Chinner239880e2013-10-23 10:50:10 +110032#include "xfs_trans.h"
Nathan Scotta844f452005-11-02 14:38:42 +110033#include "xfs_inode_item.h"
Dave Chinnera4fbe6a2013-10-23 10:51:50 +110034#include "xfs_bmap_btree.h"
Linus Torvalds1da177e2005-04-16 15:20:36 -070035#include "xfs_bmap.h"
Dave Chinnera4fbe6a2013-10-23 10:51:50 +110036#include "xfs_attr_sf.h"
37#include "xfs_attr_remote.h"
Linus Torvalds1da177e2005-04-16 15:20:36 -070038#include "xfs_attr.h"
39#include "xfs_attr_leaf.h"
40#include "xfs_error.h"
Christoph Hellwig0b1b2132009-12-14 23:14:59 +000041#include "xfs_trace.h"
Dave Chinner517c2222013-04-24 18:58:55 +100042#include "xfs_buf_item.h"
43#include "xfs_cksum.h"
Dave Chinnera4fbe6a2013-10-23 10:51:50 +110044#include "xfs_dinode.h"
Dave Chinner4bceb182013-10-29 22:11:51 +110045#include "xfs_dir2.h"
Dave Chinner517c2222013-04-24 18:58:55 +100046
Linus Torvalds1da177e2005-04-16 15:20:36 -070047
48/*
49 * xfs_attr_leaf.c
50 *
51 * Routines to implement leaf blocks of attributes as Btrees of hashed names.
52 */
53
54/*========================================================================
55 * Function prototypes for the kernel.
56 *========================================================================*/
57
58/*
59 * Routines used for growing the Btree.
60 */
Dave Chinner517c2222013-04-24 18:58:55 +100061STATIC int xfs_attr3_leaf_create(struct xfs_da_args *args,
62 xfs_dablk_t which_block, struct xfs_buf **bpp);
63STATIC int xfs_attr3_leaf_add_work(struct xfs_buf *leaf_buffer,
64 struct xfs_attr3_icleaf_hdr *ichdr,
65 struct xfs_da_args *args, int freemap_index);
66STATIC void xfs_attr3_leaf_compact(struct xfs_da_args *args,
67 struct xfs_attr3_icleaf_hdr *ichdr,
68 struct xfs_buf *leaf_buffer);
69STATIC void xfs_attr3_leaf_rebalance(xfs_da_state_t *state,
Linus Torvalds1da177e2005-04-16 15:20:36 -070070 xfs_da_state_blk_t *blk1,
71 xfs_da_state_blk_t *blk2);
Dave Chinner517c2222013-04-24 18:58:55 +100072STATIC int xfs_attr3_leaf_figure_balance(xfs_da_state_t *state,
73 xfs_da_state_blk_t *leaf_blk_1,
74 struct xfs_attr3_icleaf_hdr *ichdr1,
75 xfs_da_state_blk_t *leaf_blk_2,
76 struct xfs_attr3_icleaf_hdr *ichdr2,
77 int *number_entries_in_blk1,
78 int *number_usedbytes_in_blk1);
Linus Torvalds1da177e2005-04-16 15:20:36 -070079
80/*
81 * Utility routines.
82 */
Dave Chinnerc2c4c472014-06-06 15:21:45 +100083STATIC void xfs_attr3_leaf_moveents(struct xfs_da_args *args,
84 struct xfs_attr_leafblock *src_leaf,
Dave Chinner517c2222013-04-24 18:58:55 +100085 struct xfs_attr3_icleaf_hdr *src_ichdr, int src_start,
86 struct xfs_attr_leafblock *dst_leaf,
87 struct xfs_attr3_icleaf_hdr *dst_ichdr, int dst_start,
Dave Chinnerc2c4c472014-06-06 15:21:45 +100088 int move_count);
Christoph Hellwigba0f32d2005-06-21 15:36:52 +100089STATIC int xfs_attr_leaf_entsize(xfs_attr_leafblock_t *leaf, int index);
Tim Shimmin726801b2006-09-28 11:01:37 +100090
Dave Chinner517c2222013-04-24 18:58:55 +100091void
92xfs_attr3_leaf_hdr_from_disk(
93 struct xfs_attr3_icleaf_hdr *to,
94 struct xfs_attr_leafblock *from)
95{
96 int i;
97
98 ASSERT(from->hdr.info.magic == cpu_to_be16(XFS_ATTR_LEAF_MAGIC) ||
99 from->hdr.info.magic == cpu_to_be16(XFS_ATTR3_LEAF_MAGIC));
100
101 if (from->hdr.info.magic == cpu_to_be16(XFS_ATTR3_LEAF_MAGIC)) {
102 struct xfs_attr3_leaf_hdr *hdr3 = (struct xfs_attr3_leaf_hdr *)from;
103
104 to->forw = be32_to_cpu(hdr3->info.hdr.forw);
105 to->back = be32_to_cpu(hdr3->info.hdr.back);
106 to->magic = be16_to_cpu(hdr3->info.hdr.magic);
107 to->count = be16_to_cpu(hdr3->count);
108 to->usedbytes = be16_to_cpu(hdr3->usedbytes);
109 to->firstused = be16_to_cpu(hdr3->firstused);
110 to->holes = hdr3->holes;
111
112 for (i = 0; i < XFS_ATTR_LEAF_MAPSIZE; i++) {
113 to->freemap[i].base = be16_to_cpu(hdr3->freemap[i].base);
114 to->freemap[i].size = be16_to_cpu(hdr3->freemap[i].size);
115 }
116 return;
117 }
118 to->forw = be32_to_cpu(from->hdr.info.forw);
119 to->back = be32_to_cpu(from->hdr.info.back);
120 to->magic = be16_to_cpu(from->hdr.info.magic);
121 to->count = be16_to_cpu(from->hdr.count);
122 to->usedbytes = be16_to_cpu(from->hdr.usedbytes);
123 to->firstused = be16_to_cpu(from->hdr.firstused);
124 to->holes = from->hdr.holes;
125
126 for (i = 0; i < XFS_ATTR_LEAF_MAPSIZE; i++) {
127 to->freemap[i].base = be16_to_cpu(from->hdr.freemap[i].base);
128 to->freemap[i].size = be16_to_cpu(from->hdr.freemap[i].size);
129 }
130}
131
132void
133xfs_attr3_leaf_hdr_to_disk(
134 struct xfs_attr_leafblock *to,
135 struct xfs_attr3_icleaf_hdr *from)
136{
137 int i;
138
139 ASSERT(from->magic == XFS_ATTR_LEAF_MAGIC ||
140 from->magic == XFS_ATTR3_LEAF_MAGIC);
141
142 if (from->magic == XFS_ATTR3_LEAF_MAGIC) {
143 struct xfs_attr3_leaf_hdr *hdr3 = (struct xfs_attr3_leaf_hdr *)to;
144
145 hdr3->info.hdr.forw = cpu_to_be32(from->forw);
146 hdr3->info.hdr.back = cpu_to_be32(from->back);
147 hdr3->info.hdr.magic = cpu_to_be16(from->magic);
148 hdr3->count = cpu_to_be16(from->count);
149 hdr3->usedbytes = cpu_to_be16(from->usedbytes);
150 hdr3->firstused = cpu_to_be16(from->firstused);
151 hdr3->holes = from->holes;
152 hdr3->pad1 = 0;
153
154 for (i = 0; i < XFS_ATTR_LEAF_MAPSIZE; i++) {
155 hdr3->freemap[i].base = cpu_to_be16(from->freemap[i].base);
156 hdr3->freemap[i].size = cpu_to_be16(from->freemap[i].size);
157 }
158 return;
159 }
160 to->hdr.info.forw = cpu_to_be32(from->forw);
161 to->hdr.info.back = cpu_to_be32(from->back);
162 to->hdr.info.magic = cpu_to_be16(from->magic);
163 to->hdr.count = cpu_to_be16(from->count);
164 to->hdr.usedbytes = cpu_to_be16(from->usedbytes);
165 to->hdr.firstused = cpu_to_be16(from->firstused);
166 to->hdr.holes = from->holes;
167 to->hdr.pad1 = 0;
168
169 for (i = 0; i < XFS_ATTR_LEAF_MAPSIZE; i++) {
170 to->hdr.freemap[i].base = cpu_to_be16(from->freemap[i].base);
171 to->hdr.freemap[i].size = cpu_to_be16(from->freemap[i].size);
172 }
173}
174
175static bool
176xfs_attr3_leaf_verify(
Dave Chinnerad14c332012-11-12 22:54:16 +1100177 struct xfs_buf *bp)
178{
179 struct xfs_mount *mp = bp->b_target->bt_mount;
Dave Chinner517c2222013-04-24 18:58:55 +1000180 struct xfs_attr_leafblock *leaf = bp->b_addr;
181 struct xfs_attr3_icleaf_hdr ichdr;
Dave Chinnerad14c332012-11-12 22:54:16 +1100182
Dave Chinner517c2222013-04-24 18:58:55 +1000183 xfs_attr3_leaf_hdr_from_disk(&ichdr, leaf);
184
185 if (xfs_sb_version_hascrc(&mp->m_sb)) {
186 struct xfs_da3_node_hdr *hdr3 = bp->b_addr;
187
188 if (ichdr.magic != XFS_ATTR3_LEAF_MAGIC)
189 return false;
190
191 if (!uuid_equal(&hdr3->info.uuid, &mp->m_sb.sb_uuid))
192 return false;
193 if (be64_to_cpu(hdr3->info.blkno) != bp->b_bn)
194 return false;
195 } else {
196 if (ichdr.magic != XFS_ATTR_LEAF_MAGIC)
197 return false;
198 }
199 if (ichdr.count == 0)
200 return false;
201
202 /* XXX: need to range check rest of attr header values */
203 /* XXX: hash order check? */
204
205 return true;
206}
207
208static void
209xfs_attr3_leaf_write_verify(
210 struct xfs_buf *bp)
211{
212 struct xfs_mount *mp = bp->b_target->bt_mount;
213 struct xfs_buf_log_item *bip = bp->b_fspriv;
214 struct xfs_attr3_leaf_hdr *hdr3 = bp->b_addr;
215
216 if (!xfs_attr3_leaf_verify(bp)) {
Dave Chinner517c2222013-04-24 18:58:55 +1000217 xfs_buf_ioerror(bp, EFSCORRUPTED);
Eric Sandeence5028c2014-02-27 15:23:10 +1100218 xfs_verifier_error(bp);
Dave Chinner517c2222013-04-24 18:58:55 +1000219 return;
220 }
221
222 if (!xfs_sb_version_hascrc(&mp->m_sb))
223 return;
224
225 if (bip)
226 hdr3->info.lsn = cpu_to_be64(bip->bli_item.li_lsn);
227
Eric Sandeenf1dbcd72014-02-27 15:18:23 +1100228 xfs_buf_update_cksum(bp, XFS_ATTR3_LEAF_CRC_OFF);
Dave Chinner517c2222013-04-24 18:58:55 +1000229}
230
231/*
232 * leaf/node format detection on trees is sketchy, so a node read can be done on
233 * leaf level blocks when detection identifies the tree as a node format tree
234 * incorrectly. In this case, we need to swap the verifier to match the correct
235 * format of the block being read.
236 */
237static void
238xfs_attr3_leaf_read_verify(
239 struct xfs_buf *bp)
240{
241 struct xfs_mount *mp = bp->b_target->bt_mount;
242
Eric Sandeence5028c2014-02-27 15:23:10 +1100243 if (xfs_sb_version_hascrc(&mp->m_sb) &&
244 !xfs_buf_verify_cksum(bp, XFS_ATTR3_LEAF_CRC_OFF))
245 xfs_buf_ioerror(bp, EFSBADCRC);
246 else if (!xfs_attr3_leaf_verify(bp))
Dave Chinnerad14c332012-11-12 22:54:16 +1100247 xfs_buf_ioerror(bp, EFSCORRUPTED);
Eric Sandeence5028c2014-02-27 15:23:10 +1100248
249 if (bp->b_error)
250 xfs_verifier_error(bp);
Dave Chinner612cfbf2012-11-14 17:52:32 +1100251}
Dave Chinnerad14c332012-11-12 22:54:16 +1100252
Dave Chinner517c2222013-04-24 18:58:55 +1000253const struct xfs_buf_ops xfs_attr3_leaf_buf_ops = {
254 .verify_read = xfs_attr3_leaf_read_verify,
255 .verify_write = xfs_attr3_leaf_write_verify,
Dave Chinner1813dd62012-11-14 17:54:40 +1100256};
Dave Chinner612cfbf2012-11-14 17:52:32 +1100257
Dave Chinnerad14c332012-11-12 22:54:16 +1100258int
Dave Chinner517c2222013-04-24 18:58:55 +1000259xfs_attr3_leaf_read(
Dave Chinnerad14c332012-11-12 22:54:16 +1100260 struct xfs_trans *tp,
261 struct xfs_inode *dp,
262 xfs_dablk_t bno,
263 xfs_daddr_t mappedbno,
264 struct xfs_buf **bpp)
265{
Dave Chinnerd75afeb2013-04-03 16:11:29 +1100266 int err;
267
268 err = xfs_da_read_buf(tp, dp, bno, mappedbno, bpp,
Dave Chinner517c2222013-04-24 18:58:55 +1000269 XFS_ATTR_FORK, &xfs_attr3_leaf_buf_ops);
Dave Chinnerd75afeb2013-04-03 16:11:29 +1100270 if (!err && tp)
Dave Chinner61fe1352013-04-03 16:11:30 +1100271 xfs_trans_buf_set_type(tp, *bpp, XFS_BLFT_ATTR_LEAF_BUF);
Dave Chinnerd75afeb2013-04-03 16:11:29 +1100272 return err;
Dave Chinnerad14c332012-11-12 22:54:16 +1100273}
274
Tim Shimmin726801b2006-09-28 11:01:37 +1000275/*========================================================================
276 * Namespace helper routines
277 *========================================================================*/
278
Tim Shimmin726801b2006-09-28 11:01:37 +1000279/*
280 * If namespace bits don't match return 0.
281 * If all match then return 1.
282 */
Christoph Hellwigb8f82a42009-11-14 16:17:22 +0000283STATIC int
Tim Shimmin726801b2006-09-28 11:01:37 +1000284xfs_attr_namesp_match(int arg_flags, int ondisk_flags)
285{
286 return XFS_ATTR_NSP_ONDISK(ondisk_flags) == XFS_ATTR_NSP_ARGS_TO_ONDISK(arg_flags);
287}
288
Linus Torvalds1da177e2005-04-16 15:20:36 -0700289
290/*========================================================================
Nathan Scottd8cc8902005-11-02 10:34:53 +1100291 * External routines when attribute fork size < XFS_LITINO(mp).
Linus Torvalds1da177e2005-04-16 15:20:36 -0700292 *========================================================================*/
293
294/*
Nathan Scottd8cc8902005-11-02 10:34:53 +1100295 * Query whether the requested number of additional bytes of extended
296 * attribute space will be able to fit inline.
Christoph Hellwig4c393a62011-11-19 17:44:30 +0000297 *
Nathan Scottd8cc8902005-11-02 10:34:53 +1100298 * Returns zero if not, else the di_forkoff fork offset to be used in the
299 * literal area for attribute data once the new bytes have been added.
300 *
301 * di_forkoff must be 8 byte aligned, hence is stored as a >>3 value;
302 * special case for dev/uuid inodes, they have fixed size data forks.
303 */
304int
305xfs_attr_shortform_bytesfit(xfs_inode_t *dp, int bytes)
306{
307 int offset;
308 int minforkoff; /* lower limit on valid forkoff locations */
309 int maxforkoff; /* upper limit on valid forkoff locations */
Christoph Hellwig4c393a62011-11-19 17:44:30 +0000310 int dsize;
Nathan Scottd8cc8902005-11-02 10:34:53 +1100311 xfs_mount_t *mp = dp->i_mount;
312
Christoph Hellwig56cea2d2013-03-12 23:30:36 +1100313 /* rounded down */
314 offset = (XFS_LITINO(mp, dp->i_d.di_version) - bytes) >> 3;
Nathan Scottd8cc8902005-11-02 10:34:53 +1100315
316 switch (dp->i_d.di_format) {
317 case XFS_DINODE_FMT_DEV:
318 minforkoff = roundup(sizeof(xfs_dev_t), 8) >> 3;
319 return (offset >= minforkoff) ? minforkoff : 0;
320 case XFS_DINODE_FMT_UUID:
321 minforkoff = roundup(sizeof(uuid_t), 8) >> 3;
322 return (offset >= minforkoff) ? minforkoff : 0;
323 }
324
Christoph Hellwig4c393a62011-11-19 17:44:30 +0000325 /*
326 * If the requested numbers of bytes is smaller or equal to the
327 * current attribute fork size we can always proceed.
328 *
329 * Note that if_bytes in the data fork might actually be larger than
330 * the current data fork size is due to delalloc extents. In that
331 * case either the extent count will go down when they are converted
332 * to real extents, or the delalloc conversion will take care of the
333 * literal area rebalancing.
334 */
335 if (bytes <= XFS_IFORK_ASIZE(dp))
336 return dp->i_d.di_forkoff;
337
338 /*
339 * For attr2 we can try to move the forkoff if there is space in the
340 * literal area, but for the old format we are done if there is no
341 * space in the fixed attribute fork.
342 */
343 if (!(mp->m_flags & XFS_MOUNT_ATTR2))
Nathan Scottda087ba2005-11-02 15:00:20 +1100344 return 0;
Nathan Scottda087ba2005-11-02 15:00:20 +1100345
Barry Naujoke5889e92007-02-10 18:35:58 +1100346 dsize = dp->i_df.if_bytes;
Christoph Hellwig4c393a62011-11-19 17:44:30 +0000347
Barry Naujoke5889e92007-02-10 18:35:58 +1100348 switch (dp->i_d.di_format) {
349 case XFS_DINODE_FMT_EXTENTS:
Christoph Hellwig4c393a62011-11-19 17:44:30 +0000350 /*
Barry Naujoke5889e92007-02-10 18:35:58 +1100351 * If there is no attr fork and the data fork is extents,
Christoph Hellwig4c393a62011-11-19 17:44:30 +0000352 * determine if creating the default attr fork will result
353 * in the extents form migrating to btree. If so, the
354 * minimum offset only needs to be the space required for
Barry Naujoke5889e92007-02-10 18:35:58 +1100355 * the btree root.
Christoph Hellwig4c393a62011-11-19 17:44:30 +0000356 */
Christoph Hellwig1a5902c2009-03-29 19:26:46 +0200357 if (!dp->i_d.di_forkoff && dp->i_df.if_bytes >
358 xfs_default_attroffset(dp))
Barry Naujoke5889e92007-02-10 18:35:58 +1100359 dsize = XFS_BMDR_SPACE_CALC(MINDBTPTRS);
360 break;
Barry Naujoke5889e92007-02-10 18:35:58 +1100361 case XFS_DINODE_FMT_BTREE:
362 /*
Christoph Hellwig4c393a62011-11-19 17:44:30 +0000363 * If we have a data btree then keep forkoff if we have one,
364 * otherwise we are adding a new attr, so then we set
365 * minforkoff to where the btree root can finish so we have
Barry Naujoke5889e92007-02-10 18:35:58 +1100366 * plenty of room for attrs
367 */
368 if (dp->i_d.di_forkoff) {
Christoph Hellwig4c393a62011-11-19 17:44:30 +0000369 if (offset < dp->i_d.di_forkoff)
Barry Naujoke5889e92007-02-10 18:35:58 +1100370 return 0;
Christoph Hellwig4c393a62011-11-19 17:44:30 +0000371 return dp->i_d.di_forkoff;
372 }
Christoph Hellwigee1a47a2013-04-21 14:53:46 -0500373 dsize = XFS_BMAP_BROOT_SPACE(mp, dp->i_df.if_broot);
Barry Naujoke5889e92007-02-10 18:35:58 +1100374 break;
375 }
Christoph Hellwig4c393a62011-11-19 17:44:30 +0000376
377 /*
378 * A data fork btree root must have space for at least
Barry Naujoke5889e92007-02-10 18:35:58 +1100379 * MINDBTPTRS key/ptr pairs if the data fork is small or empty.
380 */
381 minforkoff = MAX(dsize, XFS_BMDR_SPACE_CALC(MINDBTPTRS));
Nathan Scottd8cc8902005-11-02 10:34:53 +1100382 minforkoff = roundup(minforkoff, 8) >> 3;
383
384 /* attr fork btree root can have at least this many key/ptr pairs */
Christoph Hellwig56cea2d2013-03-12 23:30:36 +1100385 maxforkoff = XFS_LITINO(mp, dp->i_d.di_version) -
386 XFS_BMDR_SPACE_CALC(MINABTPTRS);
Nathan Scottd8cc8902005-11-02 10:34:53 +1100387 maxforkoff = maxforkoff >> 3; /* rounded down */
388
Nathan Scottd8cc8902005-11-02 10:34:53 +1100389 if (offset >= maxforkoff)
390 return maxforkoff;
Christoph Hellwig4c393a62011-11-19 17:44:30 +0000391 if (offset >= minforkoff)
392 return offset;
Nathan Scottd8cc8902005-11-02 10:34:53 +1100393 return 0;
394}
395
396/*
397 * Switch on the ATTR2 superblock bit (implies also FEATURES2)
398 */
399STATIC void
400xfs_sbversion_add_attr2(xfs_mount_t *mp, xfs_trans_t *tp)
401{
Nathan Scott13059ff2006-01-11 15:32:01 +1100402 if ((mp->m_flags & XFS_MOUNT_ATTR2) &&
Eric Sandeen62118702008-03-06 13:44:28 +1100403 !(xfs_sb_version_hasattr2(&mp->m_sb))) {
Eric Sandeen3685c2a2007-10-11 17:42:32 +1000404 spin_lock(&mp->m_sb_lock);
Eric Sandeen62118702008-03-06 13:44:28 +1100405 if (!xfs_sb_version_hasattr2(&mp->m_sb)) {
406 xfs_sb_version_addattr2(&mp->m_sb);
Eric Sandeen3685c2a2007-10-11 17:42:32 +1000407 spin_unlock(&mp->m_sb_lock);
Nathan Scottd8cc8902005-11-02 10:34:53 +1100408 xfs_mod_sb(tp, XFS_SB_VERSIONNUM | XFS_SB_FEATURES2);
409 } else
Eric Sandeen3685c2a2007-10-11 17:42:32 +1000410 spin_unlock(&mp->m_sb_lock);
Nathan Scottd8cc8902005-11-02 10:34:53 +1100411 }
412}
413
414/*
Linus Torvalds1da177e2005-04-16 15:20:36 -0700415 * Create the initial contents of a shortform attribute list.
416 */
Nathan Scottd8cc8902005-11-02 10:34:53 +1100417void
Linus Torvalds1da177e2005-04-16 15:20:36 -0700418xfs_attr_shortform_create(xfs_da_args_t *args)
419{
420 xfs_attr_sf_hdr_t *hdr;
421 xfs_inode_t *dp;
422 xfs_ifork_t *ifp;
423
Dave Chinner5a5881c2012-03-22 05:15:13 +0000424 trace_xfs_attr_sf_create(args);
425
Linus Torvalds1da177e2005-04-16 15:20:36 -0700426 dp = args->dp;
427 ASSERT(dp != NULL);
428 ifp = dp->i_afp;
429 ASSERT(ifp != NULL);
430 ASSERT(ifp->if_bytes == 0);
431 if (dp->i_d.di_aformat == XFS_DINODE_FMT_EXTENTS) {
432 ifp->if_flags &= ~XFS_IFEXTENTS; /* just in case */
433 dp->i_d.di_aformat = XFS_DINODE_FMT_LOCAL;
434 ifp->if_flags |= XFS_IFINLINE;
435 } else {
436 ASSERT(ifp->if_flags & XFS_IFINLINE);
437 }
438 xfs_idata_realloc(dp, sizeof(*hdr), XFS_ATTR_FORK);
439 hdr = (xfs_attr_sf_hdr_t *)ifp->if_u1.if_data;
440 hdr->count = 0;
Nathan Scott3b244aa2006-03-17 17:29:25 +1100441 hdr->totsize = cpu_to_be16(sizeof(*hdr));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700442 xfs_trans_log_inode(args->trans, dp, XFS_ILOG_CORE | XFS_ILOG_ADATA);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700443}
444
445/*
446 * Add a name/value pair to the shortform attribute list.
447 * Overflow from the inode has already been checked for.
448 */
Nathan Scottd8cc8902005-11-02 10:34:53 +1100449void
450xfs_attr_shortform_add(xfs_da_args_t *args, int forkoff)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700451{
452 xfs_attr_shortform_t *sf;
453 xfs_attr_sf_entry_t *sfe;
454 int i, offset, size;
Nathan Scottd8cc8902005-11-02 10:34:53 +1100455 xfs_mount_t *mp;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700456 xfs_inode_t *dp;
457 xfs_ifork_t *ifp;
458
Dave Chinner5a5881c2012-03-22 05:15:13 +0000459 trace_xfs_attr_sf_add(args);
460
Linus Torvalds1da177e2005-04-16 15:20:36 -0700461 dp = args->dp;
Nathan Scottd8cc8902005-11-02 10:34:53 +1100462 mp = dp->i_mount;
463 dp->i_d.di_forkoff = forkoff;
Nathan Scottd8cc8902005-11-02 10:34:53 +1100464
Linus Torvalds1da177e2005-04-16 15:20:36 -0700465 ifp = dp->i_afp;
466 ASSERT(ifp->if_flags & XFS_IFINLINE);
467 sf = (xfs_attr_shortform_t *)ifp->if_u1.if_data;
468 sfe = &sf->list[0];
Nathan Scott3b244aa2006-03-17 17:29:25 +1100469 for (i = 0; i < sf->hdr.count; sfe = XFS_ATTR_SF_NEXTENTRY(sfe), i++) {
Nathan Scottd8cc8902005-11-02 10:34:53 +1100470#ifdef DEBUG
Linus Torvalds1da177e2005-04-16 15:20:36 -0700471 if (sfe->namelen != args->namelen)
472 continue;
473 if (memcmp(args->name, sfe->nameval, args->namelen) != 0)
474 continue;
Tim Shimmin726801b2006-09-28 11:01:37 +1000475 if (!xfs_attr_namesp_match(args->flags, sfe->flags))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700476 continue;
Nathan Scottd8cc8902005-11-02 10:34:53 +1100477 ASSERT(0);
478#endif
Linus Torvalds1da177e2005-04-16 15:20:36 -0700479 }
480
481 offset = (char *)sfe - (char *)sf;
482 size = XFS_ATTR_SF_ENTSIZE_BYNAME(args->namelen, args->valuelen);
483 xfs_idata_realloc(dp, size, XFS_ATTR_FORK);
484 sf = (xfs_attr_shortform_t *)ifp->if_u1.if_data;
485 sfe = (xfs_attr_sf_entry_t *)((char *)sf + offset);
486
487 sfe->namelen = args->namelen;
Nathan Scott3b244aa2006-03-17 17:29:25 +1100488 sfe->valuelen = args->valuelen;
Tim Shimmin726801b2006-09-28 11:01:37 +1000489 sfe->flags = XFS_ATTR_NSP_ARGS_TO_ONDISK(args->flags);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700490 memcpy(sfe->nameval, args->name, args->namelen);
491 memcpy(&sfe->nameval[args->namelen], args->value, args->valuelen);
Nathan Scott3b244aa2006-03-17 17:29:25 +1100492 sf->hdr.count++;
Marcin Slusarz413d57c2008-02-13 15:03:29 -0800493 be16_add_cpu(&sf->hdr.totsize, size);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700494 xfs_trans_log_inode(args->trans, dp, XFS_ILOG_CORE | XFS_ILOG_ADATA);
495
Nathan Scottd8cc8902005-11-02 10:34:53 +1100496 xfs_sbversion_add_attr2(mp, args->trans);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700497}
498
499/*
Christoph Hellwige1486de2009-02-04 09:36:00 +0100500 * After the last attribute is removed revert to original inode format,
501 * making all literal area available to the data fork once more.
502 */
503STATIC void
504xfs_attr_fork_reset(
505 struct xfs_inode *ip,
506 struct xfs_trans *tp)
507{
508 xfs_idestroy_fork(ip, XFS_ATTR_FORK);
509 ip->i_d.di_forkoff = 0;
510 ip->i_d.di_aformat = XFS_DINODE_FMT_EXTENTS;
511
512 ASSERT(ip->i_d.di_anextents == 0);
513 ASSERT(ip->i_afp == NULL);
514
Christoph Hellwige1486de2009-02-04 09:36:00 +0100515 xfs_trans_log_inode(tp, ip, XFS_ILOG_CORE);
516}
517
518/*
Nathan Scottd8cc8902005-11-02 10:34:53 +1100519 * Remove an attribute from the shortform attribute list structure.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700520 */
521int
522xfs_attr_shortform_remove(xfs_da_args_t *args)
523{
524 xfs_attr_shortform_t *sf;
525 xfs_attr_sf_entry_t *sfe;
526 int base, size=0, end, totsize, i;
Nathan Scottd8cc8902005-11-02 10:34:53 +1100527 xfs_mount_t *mp;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700528 xfs_inode_t *dp;
529
Dave Chinner5a5881c2012-03-22 05:15:13 +0000530 trace_xfs_attr_sf_remove(args);
531
Linus Torvalds1da177e2005-04-16 15:20:36 -0700532 dp = args->dp;
Nathan Scottd8cc8902005-11-02 10:34:53 +1100533 mp = dp->i_mount;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700534 base = sizeof(xfs_attr_sf_hdr_t);
535 sf = (xfs_attr_shortform_t *)dp->i_afp->if_u1.if_data;
536 sfe = &sf->list[0];
Nathan Scott3b244aa2006-03-17 17:29:25 +1100537 end = sf->hdr.count;
Nathan Scottd8cc8902005-11-02 10:34:53 +1100538 for (i = 0; i < end; sfe = XFS_ATTR_SF_NEXTENTRY(sfe),
Linus Torvalds1da177e2005-04-16 15:20:36 -0700539 base += size, i++) {
540 size = XFS_ATTR_SF_ENTSIZE(sfe);
541 if (sfe->namelen != args->namelen)
542 continue;
543 if (memcmp(sfe->nameval, args->name, args->namelen) != 0)
544 continue;
Tim Shimmin726801b2006-09-28 11:01:37 +1000545 if (!xfs_attr_namesp_match(args->flags, sfe->flags))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700546 continue;
547 break;
548 }
Nathan Scottd8cc8902005-11-02 10:34:53 +1100549 if (i == end)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700550 return(XFS_ERROR(ENOATTR));
551
Nathan Scottd8cc8902005-11-02 10:34:53 +1100552 /*
553 * Fix up the attribute fork data, covering the hole
554 */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700555 end = base + size;
Nathan Scott3b244aa2006-03-17 17:29:25 +1100556 totsize = be16_to_cpu(sf->hdr.totsize);
Nathan Scottd8cc8902005-11-02 10:34:53 +1100557 if (end != totsize)
558 memmove(&((char *)sf)[base], &((char *)sf)[end], totsize - end);
Nathan Scott3b244aa2006-03-17 17:29:25 +1100559 sf->hdr.count--;
Marcin Slusarz413d57c2008-02-13 15:03:29 -0800560 be16_add_cpu(&sf->hdr.totsize, -size);
Nathan Scottd8cc8902005-11-02 10:34:53 +1100561
562 /*
563 * Fix up the start offset of the attribute fork
564 */
565 totsize -= size;
Barry Naujok6a178102008-05-21 16:42:05 +1000566 if (totsize == sizeof(xfs_attr_sf_hdr_t) &&
Christoph Hellwige1486de2009-02-04 09:36:00 +0100567 (mp->m_flags & XFS_MOUNT_ATTR2) &&
568 (dp->i_d.di_format != XFS_DINODE_FMT_BTREE) &&
569 !(args->op_flags & XFS_DA_OP_ADDNAME)) {
570 xfs_attr_fork_reset(dp, args->trans);
Nathan Scottd8cc8902005-11-02 10:34:53 +1100571 } else {
572 xfs_idata_realloc(dp, -size, XFS_ATTR_FORK);
573 dp->i_d.di_forkoff = xfs_attr_shortform_bytesfit(dp, totsize);
574 ASSERT(dp->i_d.di_forkoff);
Barry Naujok6a178102008-05-21 16:42:05 +1000575 ASSERT(totsize > sizeof(xfs_attr_sf_hdr_t) ||
576 (args->op_flags & XFS_DA_OP_ADDNAME) ||
577 !(mp->m_flags & XFS_MOUNT_ATTR2) ||
578 dp->i_d.di_format == XFS_DINODE_FMT_BTREE);
Nathan Scottd8cc8902005-11-02 10:34:53 +1100579 xfs_trans_log_inode(args->trans, dp,
580 XFS_ILOG_CORE | XFS_ILOG_ADATA);
581 }
582
583 xfs_sbversion_add_attr2(mp, args->trans);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700584
585 return(0);
586}
587
588/*
589 * Look up a name in a shortform attribute list structure.
590 */
591/*ARGSUSED*/
592int
593xfs_attr_shortform_lookup(xfs_da_args_t *args)
594{
595 xfs_attr_shortform_t *sf;
596 xfs_attr_sf_entry_t *sfe;
597 int i;
598 xfs_ifork_t *ifp;
599
Dave Chinner5a5881c2012-03-22 05:15:13 +0000600 trace_xfs_attr_sf_lookup(args);
601
Linus Torvalds1da177e2005-04-16 15:20:36 -0700602 ifp = args->dp->i_afp;
603 ASSERT(ifp->if_flags & XFS_IFINLINE);
604 sf = (xfs_attr_shortform_t *)ifp->if_u1.if_data;
605 sfe = &sf->list[0];
Nathan Scott3b244aa2006-03-17 17:29:25 +1100606 for (i = 0; i < sf->hdr.count;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700607 sfe = XFS_ATTR_SF_NEXTENTRY(sfe), i++) {
608 if (sfe->namelen != args->namelen)
609 continue;
610 if (memcmp(args->name, sfe->nameval, args->namelen) != 0)
611 continue;
Tim Shimmin726801b2006-09-28 11:01:37 +1000612 if (!xfs_attr_namesp_match(args->flags, sfe->flags))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700613 continue;
614 return(XFS_ERROR(EEXIST));
615 }
616 return(XFS_ERROR(ENOATTR));
617}
618
619/*
620 * Look up a name in a shortform attribute list structure.
621 */
622/*ARGSUSED*/
623int
624xfs_attr_shortform_getvalue(xfs_da_args_t *args)
625{
626 xfs_attr_shortform_t *sf;
627 xfs_attr_sf_entry_t *sfe;
628 int i;
629
Eric Sandeen914ed442012-03-30 11:24:11 -0500630 ASSERT(args->dp->i_afp->if_flags == XFS_IFINLINE);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700631 sf = (xfs_attr_shortform_t *)args->dp->i_afp->if_u1.if_data;
632 sfe = &sf->list[0];
Nathan Scott3b244aa2006-03-17 17:29:25 +1100633 for (i = 0; i < sf->hdr.count;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700634 sfe = XFS_ATTR_SF_NEXTENTRY(sfe), i++) {
635 if (sfe->namelen != args->namelen)
636 continue;
637 if (memcmp(args->name, sfe->nameval, args->namelen) != 0)
638 continue;
Tim Shimmin726801b2006-09-28 11:01:37 +1000639 if (!xfs_attr_namesp_match(args->flags, sfe->flags))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700640 continue;
641 if (args->flags & ATTR_KERNOVAL) {
Nathan Scott3b244aa2006-03-17 17:29:25 +1100642 args->valuelen = sfe->valuelen;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700643 return(XFS_ERROR(EEXIST));
644 }
Nathan Scott3b244aa2006-03-17 17:29:25 +1100645 if (args->valuelen < sfe->valuelen) {
646 args->valuelen = sfe->valuelen;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700647 return(XFS_ERROR(ERANGE));
648 }
Nathan Scott3b244aa2006-03-17 17:29:25 +1100649 args->valuelen = sfe->valuelen;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700650 memcpy(args->value, &sfe->nameval[args->namelen],
651 args->valuelen);
652 return(XFS_ERROR(EEXIST));
653 }
654 return(XFS_ERROR(ENOATTR));
655}
656
657/*
658 * Convert from using the shortform to the leaf.
659 */
660int
661xfs_attr_shortform_to_leaf(xfs_da_args_t *args)
662{
663 xfs_inode_t *dp;
664 xfs_attr_shortform_t *sf;
665 xfs_attr_sf_entry_t *sfe;
666 xfs_da_args_t nargs;
667 char *tmpbuffer;
668 int error, i, size;
669 xfs_dablk_t blkno;
Dave Chinner1d9025e2012-06-22 18:50:14 +1000670 struct xfs_buf *bp;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700671 xfs_ifork_t *ifp;
672
Dave Chinner5a5881c2012-03-22 05:15:13 +0000673 trace_xfs_attr_sf_to_leaf(args);
674
Linus Torvalds1da177e2005-04-16 15:20:36 -0700675 dp = args->dp;
676 ifp = dp->i_afp;
677 sf = (xfs_attr_shortform_t *)ifp->if_u1.if_data;
Nathan Scott3b244aa2006-03-17 17:29:25 +1100678 size = be16_to_cpu(sf->hdr.totsize);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700679 tmpbuffer = kmem_alloc(size, KM_SLEEP);
680 ASSERT(tmpbuffer != NULL);
681 memcpy(tmpbuffer, ifp->if_u1.if_data, size);
682 sf = (xfs_attr_shortform_t *)tmpbuffer;
683
684 xfs_idata_realloc(dp, -size, XFS_ATTR_FORK);
Dave Chinnerf3508bc2013-07-10 07:04:00 +1000685 xfs_bmap_local_to_extents_empty(dp, XFS_ATTR_FORK);
686
Linus Torvalds1da177e2005-04-16 15:20:36 -0700687 bp = NULL;
688 error = xfs_da_grow_inode(args, &blkno);
689 if (error) {
690 /*
691 * If we hit an IO error middle of the transaction inside
692 * grow_inode(), we may have inconsistent data. Bail out.
693 */
694 if (error == EIO)
695 goto out;
696 xfs_idata_realloc(dp, size, XFS_ATTR_FORK); /* try to put */
697 memcpy(ifp->if_u1.if_data, tmpbuffer, size); /* it back */
698 goto out;
699 }
700
701 ASSERT(blkno == 0);
Dave Chinner517c2222013-04-24 18:58:55 +1000702 error = xfs_attr3_leaf_create(args, blkno, &bp);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700703 if (error) {
704 error = xfs_da_shrink_inode(args, 0, bp);
705 bp = NULL;
706 if (error)
707 goto out;
708 xfs_idata_realloc(dp, size, XFS_ATTR_FORK); /* try to put */
709 memcpy(ifp->if_u1.if_data, tmpbuffer, size); /* it back */
710 goto out;
711 }
712
713 memset((char *)&nargs, 0, sizeof(nargs));
714 nargs.dp = dp;
Dave Chinner0650b552014-06-06 15:01:58 +1000715 nargs.geo = args->geo;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700716 nargs.firstblock = args->firstblock;
717 nargs.flist = args->flist;
718 nargs.total = args->total;
719 nargs.whichfork = XFS_ATTR_FORK;
720 nargs.trans = args->trans;
Barry Naujok6a178102008-05-21 16:42:05 +1000721 nargs.op_flags = XFS_DA_OP_OKNOENT;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700722
723 sfe = &sf->list[0];
Nathan Scott3b244aa2006-03-17 17:29:25 +1100724 for (i = 0; i < sf->hdr.count; i++) {
Dave Chinnera9273ca2010-01-20 10:47:48 +1100725 nargs.name = sfe->nameval;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700726 nargs.namelen = sfe->namelen;
Dave Chinnera9273ca2010-01-20 10:47:48 +1100727 nargs.value = &sfe->nameval[nargs.namelen];
Nathan Scott3b244aa2006-03-17 17:29:25 +1100728 nargs.valuelen = sfe->valuelen;
Dave Chinnera9273ca2010-01-20 10:47:48 +1100729 nargs.hashval = xfs_da_hashname(sfe->nameval,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700730 sfe->namelen);
Tim Shimmin726801b2006-09-28 11:01:37 +1000731 nargs.flags = XFS_ATTR_NSP_ONDISK_TO_ARGS(sfe->flags);
Dave Chinner517c2222013-04-24 18:58:55 +1000732 error = xfs_attr3_leaf_lookup_int(bp, &nargs); /* set a->index */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700733 ASSERT(error == ENOATTR);
Dave Chinner517c2222013-04-24 18:58:55 +1000734 error = xfs_attr3_leaf_add(bp, &nargs);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700735 ASSERT(error != ENOSPC);
736 if (error)
737 goto out;
738 sfe = XFS_ATTR_SF_NEXTENTRY(sfe);
739 }
740 error = 0;
741
742out:
Denys Vlasenkof0e2d932008-05-19 16:31:57 +1000743 kmem_free(tmpbuffer);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700744 return(error);
745}
746
Linus Torvalds1da177e2005-04-16 15:20:36 -0700747/*
748 * Check a leaf attribute block to see if all the entries would fit into
749 * a shortform attribute list.
750 */
751int
Dave Chinner1d9025e2012-06-22 18:50:14 +1000752xfs_attr_shortform_allfit(
Dave Chinnerb38958d2013-05-20 09:51:14 +1000753 struct xfs_buf *bp,
754 struct xfs_inode *dp)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700755{
Dave Chinnerb38958d2013-05-20 09:51:14 +1000756 struct xfs_attr_leafblock *leaf;
757 struct xfs_attr_leaf_entry *entry;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700758 xfs_attr_leaf_name_local_t *name_loc;
Dave Chinnerb38958d2013-05-20 09:51:14 +1000759 struct xfs_attr3_icleaf_hdr leafhdr;
760 int bytes;
761 int i;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700762
Dave Chinner1d9025e2012-06-22 18:50:14 +1000763 leaf = bp->b_addr;
Dave Chinnerb38958d2013-05-20 09:51:14 +1000764 xfs_attr3_leaf_hdr_from_disk(&leafhdr, leaf);
765 entry = xfs_attr3_leaf_entryp(leaf);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700766
Linus Torvalds1da177e2005-04-16 15:20:36 -0700767 bytes = sizeof(struct xfs_attr_sf_hdr);
Dave Chinnerb38958d2013-05-20 09:51:14 +1000768 for (i = 0; i < leafhdr.count; entry++, i++) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700769 if (entry->flags & XFS_ATTR_INCOMPLETE)
770 continue; /* don't copy partial entries */
771 if (!(entry->flags & XFS_ATTR_LOCAL))
772 return(0);
Dave Chinner517c2222013-04-24 18:58:55 +1000773 name_loc = xfs_attr3_leaf_name_local(leaf, i);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700774 if (name_loc->namelen >= XFS_ATTR_SF_ENTSIZE_MAX)
775 return(0);
Nathan Scott053b5752006-03-17 17:29:09 +1100776 if (be16_to_cpu(name_loc->valuelen) >= XFS_ATTR_SF_ENTSIZE_MAX)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700777 return(0);
Dave Chinnerb38958d2013-05-20 09:51:14 +1000778 bytes += sizeof(struct xfs_attr_sf_entry) - 1
Linus Torvalds1da177e2005-04-16 15:20:36 -0700779 + name_loc->namelen
Nathan Scott053b5752006-03-17 17:29:09 +1100780 + be16_to_cpu(name_loc->valuelen);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700781 }
Nathan Scott13059ff2006-01-11 15:32:01 +1100782 if ((dp->i_mount->m_flags & XFS_MOUNT_ATTR2) &&
Barry Naujoke5889e92007-02-10 18:35:58 +1100783 (dp->i_d.di_format != XFS_DINODE_FMT_BTREE) &&
Nathan Scotte0144ca2005-11-25 16:42:22 +1100784 (bytes == sizeof(struct xfs_attr_sf_hdr)))
Dave Chinnerb38958d2013-05-20 09:51:14 +1000785 return -1;
786 return xfs_attr_shortform_bytesfit(dp, bytes);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700787}
788
789/*
790 * Convert a leaf attribute list to shortform attribute list
791 */
792int
Dave Chinner517c2222013-04-24 18:58:55 +1000793xfs_attr3_leaf_to_shortform(
794 struct xfs_buf *bp,
795 struct xfs_da_args *args,
796 int forkoff)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700797{
Dave Chinner517c2222013-04-24 18:58:55 +1000798 struct xfs_attr_leafblock *leaf;
799 struct xfs_attr3_icleaf_hdr ichdr;
800 struct xfs_attr_leaf_entry *entry;
801 struct xfs_attr_leaf_name_local *name_loc;
802 struct xfs_da_args nargs;
803 struct xfs_inode *dp = args->dp;
804 char *tmpbuffer;
805 int error;
806 int i;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700807
Dave Chinner5a5881c2012-03-22 05:15:13 +0000808 trace_xfs_attr_leaf_to_sf(args);
809
Dave Chinnerc2c4c472014-06-06 15:21:45 +1000810 tmpbuffer = kmem_alloc(args->geo->blksize, KM_SLEEP);
Dave Chinner517c2222013-04-24 18:58:55 +1000811 if (!tmpbuffer)
812 return ENOMEM;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700813
Dave Chinnerc2c4c472014-06-06 15:21:45 +1000814 memcpy(tmpbuffer, bp->b_addr, args->geo->blksize);
Dave Chinner517c2222013-04-24 18:58:55 +1000815
Linus Torvalds1da177e2005-04-16 15:20:36 -0700816 leaf = (xfs_attr_leafblock_t *)tmpbuffer;
Dave Chinner517c2222013-04-24 18:58:55 +1000817 xfs_attr3_leaf_hdr_from_disk(&ichdr, leaf);
818 entry = xfs_attr3_leaf_entryp(leaf);
819
820 /* XXX (dgc): buffer is about to be marked stale - why zero it? */
Dave Chinnerc2c4c472014-06-06 15:21:45 +1000821 memset(bp->b_addr, 0, args->geo->blksize);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700822
823 /*
824 * Clean out the prior contents of the attribute list.
825 */
826 error = xfs_da_shrink_inode(args, 0, bp);
827 if (error)
828 goto out;
Nathan Scottd8cc8902005-11-02 10:34:53 +1100829
830 if (forkoff == -1) {
Nathan Scott13059ff2006-01-11 15:32:01 +1100831 ASSERT(dp->i_mount->m_flags & XFS_MOUNT_ATTR2);
Barry Naujoke5889e92007-02-10 18:35:58 +1100832 ASSERT(dp->i_d.di_format != XFS_DINODE_FMT_BTREE);
Christoph Hellwige1486de2009-02-04 09:36:00 +0100833 xfs_attr_fork_reset(dp, args->trans);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700834 goto out;
Nathan Scottd8cc8902005-11-02 10:34:53 +1100835 }
836
837 xfs_attr_shortform_create(args);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700838
839 /*
840 * Copy the attributes
841 */
842 memset((char *)&nargs, 0, sizeof(nargs));
Dave Chinner0650b552014-06-06 15:01:58 +1000843 nargs.geo = args->geo;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700844 nargs.dp = dp;
845 nargs.firstblock = args->firstblock;
846 nargs.flist = args->flist;
847 nargs.total = args->total;
848 nargs.whichfork = XFS_ATTR_FORK;
849 nargs.trans = args->trans;
Barry Naujok6a178102008-05-21 16:42:05 +1000850 nargs.op_flags = XFS_DA_OP_OKNOENT;
Dave Chinner517c2222013-04-24 18:58:55 +1000851
852 for (i = 0; i < ichdr.count; entry++, i++) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700853 if (entry->flags & XFS_ATTR_INCOMPLETE)
854 continue; /* don't copy partial entries */
855 if (!entry->nameidx)
856 continue;
857 ASSERT(entry->flags & XFS_ATTR_LOCAL);
Dave Chinner517c2222013-04-24 18:58:55 +1000858 name_loc = xfs_attr3_leaf_name_local(leaf, i);
Dave Chinnera9273ca2010-01-20 10:47:48 +1100859 nargs.name = name_loc->nameval;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700860 nargs.namelen = name_loc->namelen;
Dave Chinnera9273ca2010-01-20 10:47:48 +1100861 nargs.value = &name_loc->nameval[nargs.namelen];
Nathan Scott053b5752006-03-17 17:29:09 +1100862 nargs.valuelen = be16_to_cpu(name_loc->valuelen);
Nathan Scott6b19f2d2006-03-17 17:29:02 +1100863 nargs.hashval = be32_to_cpu(entry->hashval);
Tim Shimmin726801b2006-09-28 11:01:37 +1000864 nargs.flags = XFS_ATTR_NSP_ONDISK_TO_ARGS(entry->flags);
Nathan Scottd8cc8902005-11-02 10:34:53 +1100865 xfs_attr_shortform_add(&nargs, forkoff);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700866 }
867 error = 0;
868
869out:
Denys Vlasenkof0e2d932008-05-19 16:31:57 +1000870 kmem_free(tmpbuffer);
Dave Chinner517c2222013-04-24 18:58:55 +1000871 return error;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700872}
873
874/*
875 * Convert from using a single leaf to a root node and a leaf.
876 */
877int
Dave Chinner517c2222013-04-24 18:58:55 +1000878xfs_attr3_leaf_to_node(
879 struct xfs_da_args *args)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700880{
Dave Chinner517c2222013-04-24 18:58:55 +1000881 struct xfs_attr_leafblock *leaf;
882 struct xfs_attr3_icleaf_hdr icleafhdr;
883 struct xfs_attr_leaf_entry *entries;
Dave Chinnerf5ea1102013-04-24 18:58:02 +1000884 struct xfs_da_node_entry *btree;
Dave Chinner517c2222013-04-24 18:58:55 +1000885 struct xfs_da3_icnode_hdr icnodehdr;
886 struct xfs_da_intnode *node;
887 struct xfs_inode *dp = args->dp;
888 struct xfs_mount *mp = dp->i_mount;
889 struct xfs_buf *bp1 = NULL;
890 struct xfs_buf *bp2 = NULL;
891 xfs_dablk_t blkno;
892 int error;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700893
Dave Chinner5a5881c2012-03-22 05:15:13 +0000894 trace_xfs_attr_leaf_to_node(args);
895
Linus Torvalds1da177e2005-04-16 15:20:36 -0700896 error = xfs_da_grow_inode(args, &blkno);
897 if (error)
898 goto out;
Dave Chinner517c2222013-04-24 18:58:55 +1000899 error = xfs_attr3_leaf_read(args->trans, dp, 0, -1, &bp1);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700900 if (error)
901 goto out;
Dave Chinnerad14c332012-11-12 22:54:16 +1100902
Dave Chinner517c2222013-04-24 18:58:55 +1000903 error = xfs_da_get_buf(args->trans, dp, blkno, -1, &bp2, XFS_ATTR_FORK);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700904 if (error)
905 goto out;
Dave Chinner517c2222013-04-24 18:58:55 +1000906
907 /* copy leaf to new buffer, update identifiers */
Dave Chinner61fe1352013-04-03 16:11:30 +1100908 xfs_trans_buf_set_type(args->trans, bp2, XFS_BLFT_ATTR_LEAF_BUF);
Dave Chinner1813dd62012-11-14 17:54:40 +1100909 bp2->b_ops = bp1->b_ops;
Dave Chinnerc2c4c472014-06-06 15:21:45 +1000910 memcpy(bp2->b_addr, bp1->b_addr, args->geo->blksize);
Dave Chinner517c2222013-04-24 18:58:55 +1000911 if (xfs_sb_version_hascrc(&mp->m_sb)) {
912 struct xfs_da3_blkinfo *hdr3 = bp2->b_addr;
913 hdr3->blkno = cpu_to_be64(bp2->b_bn);
914 }
Dave Chinnerc2c4c472014-06-06 15:21:45 +1000915 xfs_trans_log_buf(args->trans, bp2, 0, args->geo->blksize - 1);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700916
917 /*
918 * Set up the new root node.
919 */
Dave Chinnerf5ea1102013-04-24 18:58:02 +1000920 error = xfs_da3_node_create(args, 0, 1, &bp1, XFS_ATTR_FORK);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700921 if (error)
922 goto out;
Dave Chinner1d9025e2012-06-22 18:50:14 +1000923 node = bp1->b_addr;
Dave Chinner01ba43b2013-10-29 22:11:52 +1100924 dp->d_ops->node_hdr_from_disk(&icnodehdr, node);
Dave Chinner4bceb182013-10-29 22:11:51 +1100925 btree = dp->d_ops->node_tree_p(node);
Dave Chinner517c2222013-04-24 18:58:55 +1000926
927 leaf = bp2->b_addr;
928 xfs_attr3_leaf_hdr_from_disk(&icleafhdr, leaf);
929 entries = xfs_attr3_leaf_entryp(leaf);
930
931 /* both on-disk, don't endian-flip twice */
932 btree[0].hashval = entries[icleafhdr.count - 1].hashval;
Dave Chinnerf5ea1102013-04-24 18:58:02 +1000933 btree[0].before = cpu_to_be32(blkno);
Dave Chinner517c2222013-04-24 18:58:55 +1000934 icnodehdr.count = 1;
Dave Chinner01ba43b2013-10-29 22:11:52 +1100935 dp->d_ops->node_hdr_to_disk(node, &icnodehdr);
Dave Chinnerc2c4c472014-06-06 15:21:45 +1000936 xfs_trans_log_buf(args->trans, bp1, 0, args->geo->blksize - 1);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700937 error = 0;
938out:
Dave Chinner517c2222013-04-24 18:58:55 +1000939 return error;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700940}
941
Linus Torvalds1da177e2005-04-16 15:20:36 -0700942/*========================================================================
943 * Routines used for growing the Btree.
944 *========================================================================*/
945
946/*
947 * Create the initial contents of a leaf attribute list
948 * or a leaf in a node attribute list.
949 */
Christoph Hellwigba0f32d2005-06-21 15:36:52 +1000950STATIC int
Dave Chinner517c2222013-04-24 18:58:55 +1000951xfs_attr3_leaf_create(
952 struct xfs_da_args *args,
953 xfs_dablk_t blkno,
954 struct xfs_buf **bpp)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700955{
Dave Chinner517c2222013-04-24 18:58:55 +1000956 struct xfs_attr_leafblock *leaf;
957 struct xfs_attr3_icleaf_hdr ichdr;
958 struct xfs_inode *dp = args->dp;
959 struct xfs_mount *mp = dp->i_mount;
960 struct xfs_buf *bp;
961 int error;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700962
Dave Chinner5a5881c2012-03-22 05:15:13 +0000963 trace_xfs_attr_leaf_create(args);
964
Linus Torvalds1da177e2005-04-16 15:20:36 -0700965 error = xfs_da_get_buf(args->trans, args->dp, blkno, -1, &bp,
966 XFS_ATTR_FORK);
967 if (error)
Dave Chinner517c2222013-04-24 18:58:55 +1000968 return error;
969 bp->b_ops = &xfs_attr3_leaf_buf_ops;
Dave Chinner61fe1352013-04-03 16:11:30 +1100970 xfs_trans_buf_set_type(args->trans, bp, XFS_BLFT_ATTR_LEAF_BUF);
Dave Chinner1d9025e2012-06-22 18:50:14 +1000971 leaf = bp->b_addr;
Dave Chinnerc2c4c472014-06-06 15:21:45 +1000972 memset(leaf, 0, args->geo->blksize);
Dave Chinner517c2222013-04-24 18:58:55 +1000973
974 memset(&ichdr, 0, sizeof(ichdr));
Dave Chinnerc2c4c472014-06-06 15:21:45 +1000975 ichdr.firstused = args->geo->blksize;
Dave Chinner517c2222013-04-24 18:58:55 +1000976
977 if (xfs_sb_version_hascrc(&mp->m_sb)) {
978 struct xfs_da3_blkinfo *hdr3 = bp->b_addr;
979
980 ichdr.magic = XFS_ATTR3_LEAF_MAGIC;
981
982 hdr3->blkno = cpu_to_be64(bp->b_bn);
983 hdr3->owner = cpu_to_be64(dp->i_ino);
984 uuid_copy(&hdr3->uuid, &mp->m_sb.sb_uuid);
985
986 ichdr.freemap[0].base = sizeof(struct xfs_attr3_leaf_hdr);
987 } else {
988 ichdr.magic = XFS_ATTR_LEAF_MAGIC;
989 ichdr.freemap[0].base = sizeof(struct xfs_attr_leaf_hdr);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700990 }
Dave Chinner517c2222013-04-24 18:58:55 +1000991 ichdr.freemap[0].size = ichdr.firstused - ichdr.freemap[0].base;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700992
Dave Chinner517c2222013-04-24 18:58:55 +1000993 xfs_attr3_leaf_hdr_to_disk(leaf, &ichdr);
Dave Chinnerc2c4c472014-06-06 15:21:45 +1000994 xfs_trans_log_buf(args->trans, bp, 0, args->geo->blksize - 1);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700995
996 *bpp = bp;
Dave Chinner517c2222013-04-24 18:58:55 +1000997 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700998}
999
1000/*
1001 * Split the leaf node, rebalance, then add the new entry.
1002 */
1003int
Dave Chinner517c2222013-04-24 18:58:55 +10001004xfs_attr3_leaf_split(
1005 struct xfs_da_state *state,
1006 struct xfs_da_state_blk *oldblk,
1007 struct xfs_da_state_blk *newblk)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001008{
1009 xfs_dablk_t blkno;
1010 int error;
1011
Dave Chinner5a5881c2012-03-22 05:15:13 +00001012 trace_xfs_attr_leaf_split(state->args);
1013
Linus Torvalds1da177e2005-04-16 15:20:36 -07001014 /*
1015 * Allocate space for a new leaf node.
1016 */
1017 ASSERT(oldblk->magic == XFS_ATTR_LEAF_MAGIC);
1018 error = xfs_da_grow_inode(state->args, &blkno);
1019 if (error)
1020 return(error);
Dave Chinner517c2222013-04-24 18:58:55 +10001021 error = xfs_attr3_leaf_create(state->args, blkno, &newblk->bp);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001022 if (error)
1023 return(error);
1024 newblk->blkno = blkno;
1025 newblk->magic = XFS_ATTR_LEAF_MAGIC;
1026
1027 /*
1028 * Rebalance the entries across the two leaves.
1029 * NOTE: rebalance() currently depends on the 2nd block being empty.
1030 */
Dave Chinner517c2222013-04-24 18:58:55 +10001031 xfs_attr3_leaf_rebalance(state, oldblk, newblk);
Dave Chinnerf5ea1102013-04-24 18:58:02 +10001032 error = xfs_da3_blk_link(state, oldblk, newblk);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001033 if (error)
1034 return(error);
1035
1036 /*
1037 * Save info on "old" attribute for "atomic rename" ops, leaf_add()
1038 * modifies the index/blkno/rmtblk/rmtblkcnt fields to show the
1039 * "new" attrs info. Will need the "old" info to remove it later.
1040 *
1041 * Insert the "new" entry in the correct block.
1042 */
Dave Chinner5a5881c2012-03-22 05:15:13 +00001043 if (state->inleaf) {
1044 trace_xfs_attr_leaf_add_old(state->args);
Dave Chinner517c2222013-04-24 18:58:55 +10001045 error = xfs_attr3_leaf_add(oldblk->bp, state->args);
Dave Chinner5a5881c2012-03-22 05:15:13 +00001046 } else {
1047 trace_xfs_attr_leaf_add_new(state->args);
Dave Chinner517c2222013-04-24 18:58:55 +10001048 error = xfs_attr3_leaf_add(newblk->bp, state->args);
Dave Chinner5a5881c2012-03-22 05:15:13 +00001049 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07001050
1051 /*
1052 * Update last hashval in each block since we added the name.
1053 */
1054 oldblk->hashval = xfs_attr_leaf_lasthash(oldblk->bp, NULL);
1055 newblk->hashval = xfs_attr_leaf_lasthash(newblk->bp, NULL);
1056 return(error);
1057}
1058
1059/*
1060 * Add a name to the leaf attribute list structure.
1061 */
1062int
Dave Chinner517c2222013-04-24 18:58:55 +10001063xfs_attr3_leaf_add(
Dave Chinner1d9025e2012-06-22 18:50:14 +10001064 struct xfs_buf *bp,
1065 struct xfs_da_args *args)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001066{
Dave Chinner517c2222013-04-24 18:58:55 +10001067 struct xfs_attr_leafblock *leaf;
1068 struct xfs_attr3_icleaf_hdr ichdr;
1069 int tablesize;
1070 int entsize;
1071 int sum;
1072 int tmp;
1073 int i;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001074
Dave Chinner5a5881c2012-03-22 05:15:13 +00001075 trace_xfs_attr_leaf_add(args);
1076
Dave Chinner1d9025e2012-06-22 18:50:14 +10001077 leaf = bp->b_addr;
Dave Chinner517c2222013-04-24 18:58:55 +10001078 xfs_attr3_leaf_hdr_from_disk(&ichdr, leaf);
1079 ASSERT(args->index >= 0 && args->index <= ichdr.count);
Dave Chinnerc59f0ad2014-06-06 15:21:27 +10001080 entsize = xfs_attr_leaf_newentsize(args, NULL);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001081
1082 /*
1083 * Search through freemap for first-fit on new name length.
1084 * (may need to figure in size of entry struct too)
1085 */
Dave Chinner517c2222013-04-24 18:58:55 +10001086 tablesize = (ichdr.count + 1) * sizeof(xfs_attr_leaf_entry_t)
1087 + xfs_attr3_leaf_hdr_size(leaf);
1088 for (sum = 0, i = XFS_ATTR_LEAF_MAPSIZE - 1; i >= 0; i--) {
1089 if (tablesize > ichdr.firstused) {
1090 sum += ichdr.freemap[i].size;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001091 continue;
1092 }
Dave Chinner517c2222013-04-24 18:58:55 +10001093 if (!ichdr.freemap[i].size)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001094 continue; /* no space in this map */
1095 tmp = entsize;
Dave Chinner517c2222013-04-24 18:58:55 +10001096 if (ichdr.freemap[i].base < ichdr.firstused)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001097 tmp += sizeof(xfs_attr_leaf_entry_t);
Dave Chinner517c2222013-04-24 18:58:55 +10001098 if (ichdr.freemap[i].size >= tmp) {
1099 tmp = xfs_attr3_leaf_add_work(bp, &ichdr, args, i);
1100 goto out_log_hdr;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001101 }
Dave Chinner517c2222013-04-24 18:58:55 +10001102 sum += ichdr.freemap[i].size;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001103 }
1104
1105 /*
1106 * If there are no holes in the address space of the block,
1107 * and we don't have enough freespace, then compaction will do us
1108 * no good and we should just give up.
1109 */
Dave Chinner517c2222013-04-24 18:58:55 +10001110 if (!ichdr.holes && sum < entsize)
1111 return XFS_ERROR(ENOSPC);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001112
1113 /*
1114 * Compact the entries to coalesce free space.
1115 * This may change the hdr->count via dropping INCOMPLETE entries.
1116 */
Dave Chinner517c2222013-04-24 18:58:55 +10001117 xfs_attr3_leaf_compact(args, &ichdr, bp);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001118
1119 /*
1120 * After compaction, the block is guaranteed to have only one
1121 * free region, in freemap[0]. If it is not big enough, give up.
1122 */
Dave Chinner517c2222013-04-24 18:58:55 +10001123 if (ichdr.freemap[0].size < (entsize + sizeof(xfs_attr_leaf_entry_t))) {
1124 tmp = ENOSPC;
1125 goto out_log_hdr;
1126 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07001127
Dave Chinner517c2222013-04-24 18:58:55 +10001128 tmp = xfs_attr3_leaf_add_work(bp, &ichdr, args, 0);
1129
1130out_log_hdr:
1131 xfs_attr3_leaf_hdr_to_disk(leaf, &ichdr);
1132 xfs_trans_log_buf(args->trans, bp,
1133 XFS_DA_LOGRANGE(leaf, &leaf->hdr,
1134 xfs_attr3_leaf_hdr_size(leaf)));
1135 return tmp;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001136}
1137
1138/*
1139 * Add a name to a leaf attribute list structure.
1140 */
1141STATIC int
Dave Chinner517c2222013-04-24 18:58:55 +10001142xfs_attr3_leaf_add_work(
1143 struct xfs_buf *bp,
1144 struct xfs_attr3_icleaf_hdr *ichdr,
1145 struct xfs_da_args *args,
1146 int mapindex)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001147{
Dave Chinner517c2222013-04-24 18:58:55 +10001148 struct xfs_attr_leafblock *leaf;
1149 struct xfs_attr_leaf_entry *entry;
1150 struct xfs_attr_leaf_name_local *name_loc;
1151 struct xfs_attr_leaf_name_remote *name_rmt;
1152 struct xfs_mount *mp;
1153 int tmp;
1154 int i;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001155
Dave Chinneree732592012-11-12 22:53:53 +11001156 trace_xfs_attr_leaf_add_work(args);
1157
Dave Chinner1d9025e2012-06-22 18:50:14 +10001158 leaf = bp->b_addr;
Dave Chinner517c2222013-04-24 18:58:55 +10001159 ASSERT(mapindex >= 0 && mapindex < XFS_ATTR_LEAF_MAPSIZE);
1160 ASSERT(args->index >= 0 && args->index <= ichdr->count);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001161
1162 /*
1163 * Force open some space in the entry array and fill it in.
1164 */
Dave Chinner517c2222013-04-24 18:58:55 +10001165 entry = &xfs_attr3_leaf_entryp(leaf)[args->index];
1166 if (args->index < ichdr->count) {
1167 tmp = ichdr->count - args->index;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001168 tmp *= sizeof(xfs_attr_leaf_entry_t);
Dave Chinner517c2222013-04-24 18:58:55 +10001169 memmove(entry + 1, entry, tmp);
Dave Chinner1d9025e2012-06-22 18:50:14 +10001170 xfs_trans_log_buf(args->trans, bp,
Linus Torvalds1da177e2005-04-16 15:20:36 -07001171 XFS_DA_LOGRANGE(leaf, entry, tmp + sizeof(*entry)));
1172 }
Dave Chinner517c2222013-04-24 18:58:55 +10001173 ichdr->count++;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001174
1175 /*
1176 * Allocate space for the new string (at the end of the run).
1177 */
Linus Torvalds1da177e2005-04-16 15:20:36 -07001178 mp = args->trans->t_mountp;
Dave Chinnerc2c4c472014-06-06 15:21:45 +10001179 ASSERT(ichdr->freemap[mapindex].base < args->geo->blksize);
Dave Chinner517c2222013-04-24 18:58:55 +10001180 ASSERT((ichdr->freemap[mapindex].base & 0x3) == 0);
1181 ASSERT(ichdr->freemap[mapindex].size >=
Dave Chinnerc59f0ad2014-06-06 15:21:27 +10001182 xfs_attr_leaf_newentsize(args, NULL));
Dave Chinnerc2c4c472014-06-06 15:21:45 +10001183 ASSERT(ichdr->freemap[mapindex].size < args->geo->blksize);
Dave Chinner517c2222013-04-24 18:58:55 +10001184 ASSERT((ichdr->freemap[mapindex].size & 0x3) == 0);
1185
Dave Chinnerc59f0ad2014-06-06 15:21:27 +10001186 ichdr->freemap[mapindex].size -= xfs_attr_leaf_newentsize(args, &tmp);
Dave Chinner517c2222013-04-24 18:58:55 +10001187
1188 entry->nameidx = cpu_to_be16(ichdr->freemap[mapindex].base +
1189 ichdr->freemap[mapindex].size);
Nathan Scott6b19f2d2006-03-17 17:29:02 +11001190 entry->hashval = cpu_to_be32(args->hashval);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001191 entry->flags = tmp ? XFS_ATTR_LOCAL : 0;
Tim Shimmin726801b2006-09-28 11:01:37 +10001192 entry->flags |= XFS_ATTR_NSP_ARGS_TO_ONDISK(args->flags);
Barry Naujok6a178102008-05-21 16:42:05 +10001193 if (args->op_flags & XFS_DA_OP_RENAME) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07001194 entry->flags |= XFS_ATTR_INCOMPLETE;
1195 if ((args->blkno2 == args->blkno) &&
1196 (args->index2 <= args->index)) {
1197 args->index2++;
1198 }
1199 }
Dave Chinner1d9025e2012-06-22 18:50:14 +10001200 xfs_trans_log_buf(args->trans, bp,
Linus Torvalds1da177e2005-04-16 15:20:36 -07001201 XFS_DA_LOGRANGE(leaf, entry, sizeof(*entry)));
Nathan Scott6b19f2d2006-03-17 17:29:02 +11001202 ASSERT((args->index == 0) ||
1203 (be32_to_cpu(entry->hashval) >= be32_to_cpu((entry-1)->hashval)));
Dave Chinner517c2222013-04-24 18:58:55 +10001204 ASSERT((args->index == ichdr->count - 1) ||
Nathan Scott6b19f2d2006-03-17 17:29:02 +11001205 (be32_to_cpu(entry->hashval) <= be32_to_cpu((entry+1)->hashval)));
Linus Torvalds1da177e2005-04-16 15:20:36 -07001206
1207 /*
Linus Torvalds1da177e2005-04-16 15:20:36 -07001208 * For "remote" attribute values, simply note that we need to
1209 * allocate space for the "remote" value. We can't actually
1210 * allocate the extents in this transaction, and we can't decide
1211 * which blocks they should be as we might allocate more blocks
1212 * as part of this transaction (a split operation for example).
1213 */
1214 if (entry->flags & XFS_ATTR_LOCAL) {
Dave Chinner517c2222013-04-24 18:58:55 +10001215 name_loc = xfs_attr3_leaf_name_local(leaf, args->index);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001216 name_loc->namelen = args->namelen;
Nathan Scott053b5752006-03-17 17:29:09 +11001217 name_loc->valuelen = cpu_to_be16(args->valuelen);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001218 memcpy((char *)name_loc->nameval, args->name, args->namelen);
1219 memcpy((char *)&name_loc->nameval[args->namelen], args->value,
Nathan Scott053b5752006-03-17 17:29:09 +11001220 be16_to_cpu(name_loc->valuelen));
Linus Torvalds1da177e2005-04-16 15:20:36 -07001221 } else {
Dave Chinner517c2222013-04-24 18:58:55 +10001222 name_rmt = xfs_attr3_leaf_name_remote(leaf, args->index);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001223 name_rmt->namelen = args->namelen;
1224 memcpy((char *)name_rmt->name, args->name, args->namelen);
1225 entry->flags |= XFS_ATTR_INCOMPLETE;
1226 /* just in case */
1227 name_rmt->valuelen = 0;
1228 name_rmt->valueblk = 0;
1229 args->rmtblkno = 1;
Dave Chinnerad1858d2013-05-21 18:02:08 +10001230 args->rmtblkcnt = xfs_attr3_rmt_blocks(mp, args->valuelen);
Dave Chinner8275cdd2014-05-06 07:37:31 +10001231 args->rmtvaluelen = args->valuelen;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001232 }
Dave Chinner1d9025e2012-06-22 18:50:14 +10001233 xfs_trans_log_buf(args->trans, bp,
Dave Chinner517c2222013-04-24 18:58:55 +10001234 XFS_DA_LOGRANGE(leaf, xfs_attr3_leaf_name(leaf, args->index),
Linus Torvalds1da177e2005-04-16 15:20:36 -07001235 xfs_attr_leaf_entsize(leaf, args->index)));
1236
1237 /*
1238 * Update the control info for this leaf node
1239 */
Dave Chinner517c2222013-04-24 18:58:55 +10001240 if (be16_to_cpu(entry->nameidx) < ichdr->firstused)
1241 ichdr->firstused = be16_to_cpu(entry->nameidx);
1242
1243 ASSERT(ichdr->firstused >= ichdr->count * sizeof(xfs_attr_leaf_entry_t)
1244 + xfs_attr3_leaf_hdr_size(leaf));
1245 tmp = (ichdr->count - 1) * sizeof(xfs_attr_leaf_entry_t)
1246 + xfs_attr3_leaf_hdr_size(leaf);
1247
1248 for (i = 0; i < XFS_ATTR_LEAF_MAPSIZE; i++) {
1249 if (ichdr->freemap[i].base == tmp) {
1250 ichdr->freemap[i].base += sizeof(xfs_attr_leaf_entry_t);
1251 ichdr->freemap[i].size -= sizeof(xfs_attr_leaf_entry_t);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001252 }
1253 }
Dave Chinner517c2222013-04-24 18:58:55 +10001254 ichdr->usedbytes += xfs_attr_leaf_entsize(leaf, args->index);
1255 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001256}
1257
1258/*
1259 * Garbage collect a leaf attribute list block by copying it to a new buffer.
1260 */
1261STATIC void
Dave Chinner517c2222013-04-24 18:58:55 +10001262xfs_attr3_leaf_compact(
Dave Chinneree732592012-11-12 22:53:53 +11001263 struct xfs_da_args *args,
Dave Chinnerd4c712b2013-05-21 18:02:06 +10001264 struct xfs_attr3_icleaf_hdr *ichdr_dst,
Dave Chinneree732592012-11-12 22:53:53 +11001265 struct xfs_buf *bp)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001266{
Dave Chinnerd4c712b2013-05-21 18:02:06 +10001267 struct xfs_attr_leafblock *leaf_src;
1268 struct xfs_attr_leafblock *leaf_dst;
1269 struct xfs_attr3_icleaf_hdr ichdr_src;
Dave Chinneree732592012-11-12 22:53:53 +11001270 struct xfs_trans *trans = args->trans;
Dave Chinneree732592012-11-12 22:53:53 +11001271 char *tmpbuffer;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001272
Dave Chinneree732592012-11-12 22:53:53 +11001273 trace_xfs_attr_leaf_compact(args);
1274
Dave Chinnerc2c4c472014-06-06 15:21:45 +10001275 tmpbuffer = kmem_alloc(args->geo->blksize, KM_SLEEP);
1276 memcpy(tmpbuffer, bp->b_addr, args->geo->blksize);
1277 memset(bp->b_addr, 0, args->geo->blksize);
Dave Chinnerd4c712b2013-05-21 18:02:06 +10001278 leaf_src = (xfs_attr_leafblock_t *)tmpbuffer;
1279 leaf_dst = bp->b_addr;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001280
1281 /*
Dave Chinnerd4c712b2013-05-21 18:02:06 +10001282 * Copy the on-disk header back into the destination buffer to ensure
1283 * all the information in the header that is not part of the incore
1284 * header structure is preserved.
Linus Torvalds1da177e2005-04-16 15:20:36 -07001285 */
Dave Chinnerd4c712b2013-05-21 18:02:06 +10001286 memcpy(bp->b_addr, tmpbuffer, xfs_attr3_leaf_hdr_size(leaf_src));
1287
1288 /* Initialise the incore headers */
1289 ichdr_src = *ichdr_dst; /* struct copy */
Dave Chinnerc2c4c472014-06-06 15:21:45 +10001290 ichdr_dst->firstused = args->geo->blksize;
Dave Chinnerd4c712b2013-05-21 18:02:06 +10001291 ichdr_dst->usedbytes = 0;
1292 ichdr_dst->count = 0;
1293 ichdr_dst->holes = 0;
1294 ichdr_dst->freemap[0].base = xfs_attr3_leaf_hdr_size(leaf_src);
1295 ichdr_dst->freemap[0].size = ichdr_dst->firstused -
1296 ichdr_dst->freemap[0].base;
1297
Dave Chinnerd4c712b2013-05-21 18:02:06 +10001298 /* write the header back to initialise the underlying buffer */
1299 xfs_attr3_leaf_hdr_to_disk(leaf_dst, ichdr_dst);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001300
1301 /*
1302 * Copy all entry's in the same (sorted) order,
1303 * but allocate name/value pairs packed and in sequence.
1304 */
Dave Chinnerc2c4c472014-06-06 15:21:45 +10001305 xfs_attr3_leaf_moveents(args, leaf_src, &ichdr_src, 0,
1306 leaf_dst, ichdr_dst, 0, ichdr_src.count);
Dave Chinner517c2222013-04-24 18:58:55 +10001307 /*
1308 * this logs the entire buffer, but the caller must write the header
1309 * back to the buffer when it is finished modifying it.
1310 */
Dave Chinnerc2c4c472014-06-06 15:21:45 +10001311 xfs_trans_log_buf(trans, bp, 0, args->geo->blksize - 1);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001312
Denys Vlasenkof0e2d932008-05-19 16:31:57 +10001313 kmem_free(tmpbuffer);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001314}
1315
1316/*
Dave Chinner517c2222013-04-24 18:58:55 +10001317 * Compare two leaf blocks "order".
1318 * Return 0 unless leaf2 should go before leaf1.
1319 */
1320static int
1321xfs_attr3_leaf_order(
1322 struct xfs_buf *leaf1_bp,
1323 struct xfs_attr3_icleaf_hdr *leaf1hdr,
1324 struct xfs_buf *leaf2_bp,
1325 struct xfs_attr3_icleaf_hdr *leaf2hdr)
1326{
1327 struct xfs_attr_leaf_entry *entries1;
1328 struct xfs_attr_leaf_entry *entries2;
1329
1330 entries1 = xfs_attr3_leaf_entryp(leaf1_bp->b_addr);
1331 entries2 = xfs_attr3_leaf_entryp(leaf2_bp->b_addr);
1332 if (leaf1hdr->count > 0 && leaf2hdr->count > 0 &&
1333 ((be32_to_cpu(entries2[0].hashval) <
1334 be32_to_cpu(entries1[0].hashval)) ||
1335 (be32_to_cpu(entries2[leaf2hdr->count - 1].hashval) <
1336 be32_to_cpu(entries1[leaf1hdr->count - 1].hashval)))) {
1337 return 1;
1338 }
1339 return 0;
1340}
1341
1342int
1343xfs_attr_leaf_order(
1344 struct xfs_buf *leaf1_bp,
1345 struct xfs_buf *leaf2_bp)
1346{
1347 struct xfs_attr3_icleaf_hdr ichdr1;
1348 struct xfs_attr3_icleaf_hdr ichdr2;
1349
1350 xfs_attr3_leaf_hdr_from_disk(&ichdr1, leaf1_bp->b_addr);
1351 xfs_attr3_leaf_hdr_from_disk(&ichdr2, leaf2_bp->b_addr);
1352 return xfs_attr3_leaf_order(leaf1_bp, &ichdr1, leaf2_bp, &ichdr2);
1353}
1354
1355/*
Linus Torvalds1da177e2005-04-16 15:20:36 -07001356 * Redistribute the attribute list entries between two leaf nodes,
1357 * taking into account the size of the new entry.
1358 *
1359 * NOTE: if new block is empty, then it will get the upper half of the
1360 * old block. At present, all (one) callers pass in an empty second block.
1361 *
1362 * This code adjusts the args->index/blkno and args->index2/blkno2 fields
1363 * to match what it is doing in splitting the attribute leaf block. Those
1364 * values are used in "atomic rename" operations on attributes. Note that
1365 * the "new" and "old" values can end up in different blocks.
1366 */
1367STATIC void
Dave Chinner517c2222013-04-24 18:58:55 +10001368xfs_attr3_leaf_rebalance(
1369 struct xfs_da_state *state,
1370 struct xfs_da_state_blk *blk1,
1371 struct xfs_da_state_blk *blk2)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001372{
Dave Chinner517c2222013-04-24 18:58:55 +10001373 struct xfs_da_args *args;
1374 struct xfs_attr_leafblock *leaf1;
1375 struct xfs_attr_leafblock *leaf2;
1376 struct xfs_attr3_icleaf_hdr ichdr1;
1377 struct xfs_attr3_icleaf_hdr ichdr2;
1378 struct xfs_attr_leaf_entry *entries1;
1379 struct xfs_attr_leaf_entry *entries2;
1380 int count;
1381 int totallen;
1382 int max;
1383 int space;
1384 int swap;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001385
1386 /*
1387 * Set up environment.
1388 */
1389 ASSERT(blk1->magic == XFS_ATTR_LEAF_MAGIC);
1390 ASSERT(blk2->magic == XFS_ATTR_LEAF_MAGIC);
Dave Chinner1d9025e2012-06-22 18:50:14 +10001391 leaf1 = blk1->bp->b_addr;
1392 leaf2 = blk2->bp->b_addr;
Dave Chinner517c2222013-04-24 18:58:55 +10001393 xfs_attr3_leaf_hdr_from_disk(&ichdr1, leaf1);
1394 xfs_attr3_leaf_hdr_from_disk(&ichdr2, leaf2);
1395 ASSERT(ichdr2.count == 0);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001396 args = state->args;
1397
Dave Chinner5a5881c2012-03-22 05:15:13 +00001398 trace_xfs_attr_leaf_rebalance(args);
1399
Linus Torvalds1da177e2005-04-16 15:20:36 -07001400 /*
1401 * Check ordering of blocks, reverse if it makes things simpler.
1402 *
1403 * NOTE: Given that all (current) callers pass in an empty
1404 * second block, this code should never set "swap".
1405 */
1406 swap = 0;
Dave Chinner517c2222013-04-24 18:58:55 +10001407 if (xfs_attr3_leaf_order(blk1->bp, &ichdr1, blk2->bp, &ichdr2)) {
1408 struct xfs_da_state_blk *tmp_blk;
1409 struct xfs_attr3_icleaf_hdr tmp_ichdr;
1410
Linus Torvalds1da177e2005-04-16 15:20:36 -07001411 tmp_blk = blk1;
1412 blk1 = blk2;
1413 blk2 = tmp_blk;
Dave Chinner517c2222013-04-24 18:58:55 +10001414
1415 /* struct copies to swap them rather than reconverting */
1416 tmp_ichdr = ichdr1;
1417 ichdr1 = ichdr2;
1418 ichdr2 = tmp_ichdr;
1419
Dave Chinner1d9025e2012-06-22 18:50:14 +10001420 leaf1 = blk1->bp->b_addr;
1421 leaf2 = blk2->bp->b_addr;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001422 swap = 1;
1423 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07001424
1425 /*
1426 * Examine entries until we reduce the absolute difference in
1427 * byte usage between the two blocks to a minimum. Then get
1428 * the direction to copy and the number of elements to move.
1429 *
1430 * "inleaf" is true if the new entry should be inserted into blk1.
1431 * If "swap" is also true, then reverse the sense of "inleaf".
1432 */
Dave Chinner517c2222013-04-24 18:58:55 +10001433 state->inleaf = xfs_attr3_leaf_figure_balance(state, blk1, &ichdr1,
1434 blk2, &ichdr2,
1435 &count, &totallen);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001436 if (swap)
1437 state->inleaf = !state->inleaf;
1438
1439 /*
1440 * Move any entries required from leaf to leaf:
1441 */
Dave Chinner517c2222013-04-24 18:58:55 +10001442 if (count < ichdr1.count) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07001443 /*
1444 * Figure the total bytes to be added to the destination leaf.
1445 */
1446 /* number entries being moved */
Dave Chinner517c2222013-04-24 18:58:55 +10001447 count = ichdr1.count - count;
1448 space = ichdr1.usedbytes - totallen;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001449 space += count * sizeof(xfs_attr_leaf_entry_t);
1450
1451 /*
1452 * leaf2 is the destination, compact it if it looks tight.
1453 */
Dave Chinner517c2222013-04-24 18:58:55 +10001454 max = ichdr2.firstused - xfs_attr3_leaf_hdr_size(leaf1);
1455 max -= ichdr2.count * sizeof(xfs_attr_leaf_entry_t);
Dave Chinneree732592012-11-12 22:53:53 +11001456 if (space > max)
Dave Chinner517c2222013-04-24 18:58:55 +10001457 xfs_attr3_leaf_compact(args, &ichdr2, blk2->bp);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001458
1459 /*
1460 * Move high entries from leaf1 to low end of leaf2.
1461 */
Dave Chinnerc2c4c472014-06-06 15:21:45 +10001462 xfs_attr3_leaf_moveents(args, leaf1, &ichdr1,
1463 ichdr1.count - count, leaf2, &ichdr2, 0, count);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001464
Dave Chinner517c2222013-04-24 18:58:55 +10001465 } else if (count > ichdr1.count) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07001466 /*
1467 * I assert that since all callers pass in an empty
1468 * second buffer, this code should never execute.
1469 */
Dave Chinner07428d72012-11-12 22:09:44 +11001470 ASSERT(0);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001471
1472 /*
1473 * Figure the total bytes to be added to the destination leaf.
1474 */
1475 /* number entries being moved */
Dave Chinner517c2222013-04-24 18:58:55 +10001476 count -= ichdr1.count;
1477 space = totallen - ichdr1.usedbytes;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001478 space += count * sizeof(xfs_attr_leaf_entry_t);
1479
1480 /*
1481 * leaf1 is the destination, compact it if it looks tight.
1482 */
Dave Chinner517c2222013-04-24 18:58:55 +10001483 max = ichdr1.firstused - xfs_attr3_leaf_hdr_size(leaf1);
1484 max -= ichdr1.count * sizeof(xfs_attr_leaf_entry_t);
Dave Chinneree732592012-11-12 22:53:53 +11001485 if (space > max)
Dave Chinner517c2222013-04-24 18:58:55 +10001486 xfs_attr3_leaf_compact(args, &ichdr1, blk1->bp);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001487
1488 /*
1489 * Move low entries from leaf2 to high end of leaf1.
1490 */
Dave Chinnerc2c4c472014-06-06 15:21:45 +10001491 xfs_attr3_leaf_moveents(args, leaf2, &ichdr2, 0, leaf1, &ichdr1,
1492 ichdr1.count, count);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001493 }
1494
Dave Chinner517c2222013-04-24 18:58:55 +10001495 xfs_attr3_leaf_hdr_to_disk(leaf1, &ichdr1);
1496 xfs_attr3_leaf_hdr_to_disk(leaf2, &ichdr2);
Dave Chinnerb2a21e72014-06-06 15:22:04 +10001497 xfs_trans_log_buf(args->trans, blk1->bp, 0, args->geo->blksize - 1);
1498 xfs_trans_log_buf(args->trans, blk2->bp, 0, args->geo->blksize - 1);
Dave Chinner517c2222013-04-24 18:58:55 +10001499
Linus Torvalds1da177e2005-04-16 15:20:36 -07001500 /*
1501 * Copy out last hashval in each block for B-tree code.
1502 */
Dave Chinner517c2222013-04-24 18:58:55 +10001503 entries1 = xfs_attr3_leaf_entryp(leaf1);
1504 entries2 = xfs_attr3_leaf_entryp(leaf2);
1505 blk1->hashval = be32_to_cpu(entries1[ichdr1.count - 1].hashval);
1506 blk2->hashval = be32_to_cpu(entries2[ichdr2.count - 1].hashval);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001507
1508 /*
1509 * Adjust the expected index for insertion.
1510 * NOTE: this code depends on the (current) situation that the
1511 * second block was originally empty.
1512 *
1513 * If the insertion point moved to the 2nd block, we must adjust
1514 * the index. We must also track the entry just following the
1515 * new entry for use in an "atomic rename" operation, that entry
1516 * is always the "old" entry and the "new" entry is what we are
1517 * inserting. The index/blkno fields refer to the "old" entry,
1518 * while the index2/blkno2 fields refer to the "new" entry.
1519 */
Dave Chinner517c2222013-04-24 18:58:55 +10001520 if (blk1->index > ichdr1.count) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07001521 ASSERT(state->inleaf == 0);
Dave Chinner517c2222013-04-24 18:58:55 +10001522 blk2->index = blk1->index - ichdr1.count;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001523 args->index = args->index2 = blk2->index;
1524 args->blkno = args->blkno2 = blk2->blkno;
Dave Chinner517c2222013-04-24 18:58:55 +10001525 } else if (blk1->index == ichdr1.count) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07001526 if (state->inleaf) {
1527 args->index = blk1->index;
1528 args->blkno = blk1->blkno;
1529 args->index2 = 0;
1530 args->blkno2 = blk2->blkno;
1531 } else {
Dave Chinner07428d72012-11-12 22:09:44 +11001532 /*
1533 * On a double leaf split, the original attr location
1534 * is already stored in blkno2/index2, so don't
1535 * overwrite it overwise we corrupt the tree.
1536 */
Dave Chinner517c2222013-04-24 18:58:55 +10001537 blk2->index = blk1->index - ichdr1.count;
Dave Chinner07428d72012-11-12 22:09:44 +11001538 args->index = blk2->index;
1539 args->blkno = blk2->blkno;
1540 if (!state->extravalid) {
1541 /*
1542 * set the new attr location to match the old
1543 * one and let the higher level split code
1544 * decide where in the leaf to place it.
1545 */
1546 args->index2 = blk2->index;
1547 args->blkno2 = blk2->blkno;
1548 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07001549 }
1550 } else {
1551 ASSERT(state->inleaf == 1);
1552 args->index = args->index2 = blk1->index;
1553 args->blkno = args->blkno2 = blk1->blkno;
1554 }
1555}
1556
1557/*
1558 * Examine entries until we reduce the absolute difference in
1559 * byte usage between the two blocks to a minimum.
1560 * GROT: Is this really necessary? With other than a 512 byte blocksize,
1561 * GROT: there will always be enough room in either block for a new entry.
1562 * GROT: Do a double-split for this case?
1563 */
1564STATIC int
Dave Chinner517c2222013-04-24 18:58:55 +10001565xfs_attr3_leaf_figure_balance(
1566 struct xfs_da_state *state,
1567 struct xfs_da_state_blk *blk1,
1568 struct xfs_attr3_icleaf_hdr *ichdr1,
1569 struct xfs_da_state_blk *blk2,
1570 struct xfs_attr3_icleaf_hdr *ichdr2,
1571 int *countarg,
1572 int *usedbytesarg)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001573{
Dave Chinner517c2222013-04-24 18:58:55 +10001574 struct xfs_attr_leafblock *leaf1 = blk1->bp->b_addr;
1575 struct xfs_attr_leafblock *leaf2 = blk2->bp->b_addr;
1576 struct xfs_attr_leaf_entry *entry;
1577 int count;
1578 int max;
1579 int index;
1580 int totallen = 0;
1581 int half;
1582 int lastdelta;
1583 int foundit = 0;
1584 int tmp;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001585
1586 /*
1587 * Examine entries until we reduce the absolute difference in
1588 * byte usage between the two blocks to a minimum.
1589 */
Dave Chinner517c2222013-04-24 18:58:55 +10001590 max = ichdr1->count + ichdr2->count;
1591 half = (max + 1) * sizeof(*entry);
1592 half += ichdr1->usedbytes + ichdr2->usedbytes +
Dave Chinnerc59f0ad2014-06-06 15:21:27 +10001593 xfs_attr_leaf_newentsize(state->args, NULL);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001594 half /= 2;
Dave Chinnerb2a21e72014-06-06 15:22:04 +10001595 lastdelta = state->args->geo->blksize;
Dave Chinner517c2222013-04-24 18:58:55 +10001596 entry = xfs_attr3_leaf_entryp(leaf1);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001597 for (count = index = 0; count < max; entry++, index++, count++) {
1598
1599#define XFS_ATTR_ABS(A) (((A) < 0) ? -(A) : (A))
1600 /*
1601 * The new entry is in the first block, account for it.
1602 */
1603 if (count == blk1->index) {
1604 tmp = totallen + sizeof(*entry) +
Dave Chinnerc59f0ad2014-06-06 15:21:27 +10001605 xfs_attr_leaf_newentsize(state->args, NULL);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001606 if (XFS_ATTR_ABS(half - tmp) > lastdelta)
1607 break;
1608 lastdelta = XFS_ATTR_ABS(half - tmp);
1609 totallen = tmp;
1610 foundit = 1;
1611 }
1612
1613 /*
1614 * Wrap around into the second block if necessary.
1615 */
Dave Chinner517c2222013-04-24 18:58:55 +10001616 if (count == ichdr1->count) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07001617 leaf1 = leaf2;
Dave Chinner517c2222013-04-24 18:58:55 +10001618 entry = xfs_attr3_leaf_entryp(leaf1);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001619 index = 0;
1620 }
1621
1622 /*
1623 * Figure out if next leaf entry would be too much.
1624 */
1625 tmp = totallen + sizeof(*entry) + xfs_attr_leaf_entsize(leaf1,
1626 index);
1627 if (XFS_ATTR_ABS(half - tmp) > lastdelta)
1628 break;
1629 lastdelta = XFS_ATTR_ABS(half - tmp);
1630 totallen = tmp;
1631#undef XFS_ATTR_ABS
1632 }
1633
1634 /*
1635 * Calculate the number of usedbytes that will end up in lower block.
1636 * If new entry not in lower block, fix up the count.
1637 */
1638 totallen -= count * sizeof(*entry);
1639 if (foundit) {
1640 totallen -= sizeof(*entry) +
Dave Chinnerc59f0ad2014-06-06 15:21:27 +10001641 xfs_attr_leaf_newentsize(state->args, NULL);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001642 }
1643
1644 *countarg = count;
1645 *usedbytesarg = totallen;
Dave Chinner517c2222013-04-24 18:58:55 +10001646 return foundit;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001647}
1648
1649/*========================================================================
1650 * Routines used for shrinking the Btree.
1651 *========================================================================*/
1652
1653/*
1654 * Check a leaf block and its neighbors to see if the block should be
1655 * collapsed into one or the other neighbor. Always keep the block
1656 * with the smaller block number.
1657 * If the current block is over 50% full, don't try to join it, return 0.
1658 * If the block is empty, fill in the state structure and return 2.
1659 * If it can be collapsed, fill in the state structure and return 1.
1660 * If nothing can be done, return 0.
1661 *
1662 * GROT: allow for INCOMPLETE entries in calculation.
1663 */
1664int
Dave Chinner517c2222013-04-24 18:58:55 +10001665xfs_attr3_leaf_toosmall(
1666 struct xfs_da_state *state,
1667 int *action)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001668{
Dave Chinner517c2222013-04-24 18:58:55 +10001669 struct xfs_attr_leafblock *leaf;
1670 struct xfs_da_state_blk *blk;
1671 struct xfs_attr3_icleaf_hdr ichdr;
1672 struct xfs_buf *bp;
1673 xfs_dablk_t blkno;
1674 int bytes;
1675 int forward;
1676 int error;
1677 int retval;
1678 int i;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001679
Dave Chinneree732592012-11-12 22:53:53 +11001680 trace_xfs_attr_leaf_toosmall(state->args);
1681
Linus Torvalds1da177e2005-04-16 15:20:36 -07001682 /*
1683 * Check for the degenerate case of the block being over 50% full.
1684 * If so, it's not worth even looking to see if we might be able
1685 * to coalesce with a sibling.
1686 */
1687 blk = &state->path.blk[ state->path.active-1 ];
Dave Chinner517c2222013-04-24 18:58:55 +10001688 leaf = blk->bp->b_addr;
1689 xfs_attr3_leaf_hdr_from_disk(&ichdr, leaf);
1690 bytes = xfs_attr3_leaf_hdr_size(leaf) +
1691 ichdr.count * sizeof(xfs_attr_leaf_entry_t) +
1692 ichdr.usedbytes;
Dave Chinnerb2a21e72014-06-06 15:22:04 +10001693 if (bytes > (state->args->geo->blksize >> 1)) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07001694 *action = 0; /* blk over 50%, don't try to join */
1695 return(0);
1696 }
1697
1698 /*
1699 * Check for the degenerate case of the block being empty.
1700 * If the block is empty, we'll simply delete it, no need to
Nathan Scottc41564b2006-03-29 08:55:14 +10001701 * coalesce it with a sibling block. We choose (arbitrarily)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001702 * to merge with the forward block unless it is NULL.
1703 */
Dave Chinner517c2222013-04-24 18:58:55 +10001704 if (ichdr.count == 0) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07001705 /*
1706 * Make altpath point to the block we want to keep and
1707 * path point to the block we want to drop (this one).
1708 */
Dave Chinner517c2222013-04-24 18:58:55 +10001709 forward = (ichdr.forw != 0);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001710 memcpy(&state->altpath, &state->path, sizeof(state->path));
Dave Chinnerf5ea1102013-04-24 18:58:02 +10001711 error = xfs_da3_path_shift(state, &state->altpath, forward,
Linus Torvalds1da177e2005-04-16 15:20:36 -07001712 0, &retval);
1713 if (error)
1714 return(error);
1715 if (retval) {
1716 *action = 0;
1717 } else {
1718 *action = 2;
1719 }
Dave Chinner517c2222013-04-24 18:58:55 +10001720 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001721 }
1722
1723 /*
1724 * Examine each sibling block to see if we can coalesce with
1725 * at least 25% free space to spare. We need to figure out
1726 * whether to merge with the forward or the backward block.
1727 * We prefer coalescing with the lower numbered sibling so as
1728 * to shrink an attribute list over time.
1729 */
1730 /* start with smaller blk num */
Dave Chinner517c2222013-04-24 18:58:55 +10001731 forward = ichdr.forw < ichdr.back;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001732 for (i = 0; i < 2; forward = !forward, i++) {
Dave Chinner517c2222013-04-24 18:58:55 +10001733 struct xfs_attr3_icleaf_hdr ichdr2;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001734 if (forward)
Dave Chinner517c2222013-04-24 18:58:55 +10001735 blkno = ichdr.forw;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001736 else
Dave Chinner517c2222013-04-24 18:58:55 +10001737 blkno = ichdr.back;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001738 if (blkno == 0)
1739 continue;
Dave Chinner517c2222013-04-24 18:58:55 +10001740 error = xfs_attr3_leaf_read(state->args->trans, state->args->dp,
Dave Chinnerad14c332012-11-12 22:54:16 +11001741 blkno, -1, &bp);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001742 if (error)
1743 return(error);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001744
Dave Chinner517c2222013-04-24 18:58:55 +10001745 xfs_attr3_leaf_hdr_from_disk(&ichdr2, bp->b_addr);
1746
Dave Chinnerb2a21e72014-06-06 15:22:04 +10001747 bytes = state->args->geo->blksize -
1748 (state->args->geo->blksize >> 2) -
Dave Chinner517c2222013-04-24 18:58:55 +10001749 ichdr.usedbytes - ichdr2.usedbytes -
1750 ((ichdr.count + ichdr2.count) *
1751 sizeof(xfs_attr_leaf_entry_t)) -
1752 xfs_attr3_leaf_hdr_size(leaf);
1753
Dave Chinner1d9025e2012-06-22 18:50:14 +10001754 xfs_trans_brelse(state->args->trans, bp);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001755 if (bytes >= 0)
1756 break; /* fits with at least 25% to spare */
1757 }
1758 if (i >= 2) {
1759 *action = 0;
1760 return(0);
1761 }
1762
1763 /*
1764 * Make altpath point to the block we want to keep (the lower
1765 * numbered block) and path point to the block we want to drop.
1766 */
1767 memcpy(&state->altpath, &state->path, sizeof(state->path));
1768 if (blkno < blk->blkno) {
Dave Chinnerf5ea1102013-04-24 18:58:02 +10001769 error = xfs_da3_path_shift(state, &state->altpath, forward,
Linus Torvalds1da177e2005-04-16 15:20:36 -07001770 0, &retval);
1771 } else {
Dave Chinnerf5ea1102013-04-24 18:58:02 +10001772 error = xfs_da3_path_shift(state, &state->path, forward,
Linus Torvalds1da177e2005-04-16 15:20:36 -07001773 0, &retval);
1774 }
1775 if (error)
1776 return(error);
1777 if (retval) {
1778 *action = 0;
1779 } else {
1780 *action = 1;
1781 }
1782 return(0);
1783}
1784
1785/*
1786 * Remove a name from the leaf attribute list structure.
1787 *
1788 * Return 1 if leaf is less than 37% full, 0 if >= 37% full.
1789 * If two leaves are 37% full, when combined they will leave 25% free.
1790 */
1791int
Dave Chinner517c2222013-04-24 18:58:55 +10001792xfs_attr3_leaf_remove(
1793 struct xfs_buf *bp,
1794 struct xfs_da_args *args)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001795{
Dave Chinner517c2222013-04-24 18:58:55 +10001796 struct xfs_attr_leafblock *leaf;
1797 struct xfs_attr3_icleaf_hdr ichdr;
1798 struct xfs_attr_leaf_entry *entry;
Dave Chinner517c2222013-04-24 18:58:55 +10001799 int before;
1800 int after;
1801 int smallest;
1802 int entsize;
1803 int tablesize;
1804 int tmp;
1805 int i;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001806
Dave Chinneree732592012-11-12 22:53:53 +11001807 trace_xfs_attr_leaf_remove(args);
1808
Dave Chinner1d9025e2012-06-22 18:50:14 +10001809 leaf = bp->b_addr;
Dave Chinner517c2222013-04-24 18:58:55 +10001810 xfs_attr3_leaf_hdr_from_disk(&ichdr, leaf);
1811
Dave Chinnerc2c4c472014-06-06 15:21:45 +10001812 ASSERT(ichdr.count > 0 && ichdr.count < args->geo->blksize / 8);
Dave Chinner517c2222013-04-24 18:58:55 +10001813 ASSERT(args->index >= 0 && args->index < ichdr.count);
1814 ASSERT(ichdr.firstused >= ichdr.count * sizeof(*entry) +
1815 xfs_attr3_leaf_hdr_size(leaf));
1816
1817 entry = &xfs_attr3_leaf_entryp(leaf)[args->index];
1818
1819 ASSERT(be16_to_cpu(entry->nameidx) >= ichdr.firstused);
Dave Chinnerc2c4c472014-06-06 15:21:45 +10001820 ASSERT(be16_to_cpu(entry->nameidx) < args->geo->blksize);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001821
1822 /*
1823 * Scan through free region table:
1824 * check for adjacency of free'd entry with an existing one,
1825 * find smallest free region in case we need to replace it,
1826 * adjust any map that borders the entry table,
1827 */
Dave Chinner517c2222013-04-24 18:58:55 +10001828 tablesize = ichdr.count * sizeof(xfs_attr_leaf_entry_t)
1829 + xfs_attr3_leaf_hdr_size(leaf);
1830 tmp = ichdr.freemap[0].size;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001831 before = after = -1;
1832 smallest = XFS_ATTR_LEAF_MAPSIZE - 1;
1833 entsize = xfs_attr_leaf_entsize(leaf, args->index);
Dave Chinner517c2222013-04-24 18:58:55 +10001834 for (i = 0; i < XFS_ATTR_LEAF_MAPSIZE; i++) {
Dave Chinnerc2c4c472014-06-06 15:21:45 +10001835 ASSERT(ichdr.freemap[i].base < args->geo->blksize);
1836 ASSERT(ichdr.freemap[i].size < args->geo->blksize);
Dave Chinner517c2222013-04-24 18:58:55 +10001837 if (ichdr.freemap[i].base == tablesize) {
1838 ichdr.freemap[i].base -= sizeof(xfs_attr_leaf_entry_t);
1839 ichdr.freemap[i].size += sizeof(xfs_attr_leaf_entry_t);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001840 }
1841
Dave Chinner517c2222013-04-24 18:58:55 +10001842 if (ichdr.freemap[i].base + ichdr.freemap[i].size ==
1843 be16_to_cpu(entry->nameidx)) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07001844 before = i;
Dave Chinner517c2222013-04-24 18:58:55 +10001845 } else if (ichdr.freemap[i].base ==
1846 (be16_to_cpu(entry->nameidx) + entsize)) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07001847 after = i;
Dave Chinner517c2222013-04-24 18:58:55 +10001848 } else if (ichdr.freemap[i].size < tmp) {
1849 tmp = ichdr.freemap[i].size;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001850 smallest = i;
1851 }
1852 }
1853
1854 /*
1855 * Coalesce adjacent freemap regions,
1856 * or replace the smallest region.
1857 */
1858 if ((before >= 0) || (after >= 0)) {
1859 if ((before >= 0) && (after >= 0)) {
Dave Chinner517c2222013-04-24 18:58:55 +10001860 ichdr.freemap[before].size += entsize;
1861 ichdr.freemap[before].size += ichdr.freemap[after].size;
1862 ichdr.freemap[after].base = 0;
1863 ichdr.freemap[after].size = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001864 } else if (before >= 0) {
Dave Chinner517c2222013-04-24 18:58:55 +10001865 ichdr.freemap[before].size += entsize;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001866 } else {
Dave Chinner517c2222013-04-24 18:58:55 +10001867 ichdr.freemap[after].base = be16_to_cpu(entry->nameidx);
1868 ichdr.freemap[after].size += entsize;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001869 }
1870 } else {
1871 /*
1872 * Replace smallest region (if it is smaller than free'd entry)
1873 */
Dave Chinner517c2222013-04-24 18:58:55 +10001874 if (ichdr.freemap[smallest].size < entsize) {
1875 ichdr.freemap[smallest].base = be16_to_cpu(entry->nameidx);
1876 ichdr.freemap[smallest].size = entsize;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001877 }
1878 }
1879
1880 /*
1881 * Did we remove the first entry?
1882 */
Dave Chinner517c2222013-04-24 18:58:55 +10001883 if (be16_to_cpu(entry->nameidx) == ichdr.firstused)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001884 smallest = 1;
1885 else
1886 smallest = 0;
1887
1888 /*
1889 * Compress the remaining entries and zero out the removed stuff.
1890 */
Dave Chinner517c2222013-04-24 18:58:55 +10001891 memset(xfs_attr3_leaf_name(leaf, args->index), 0, entsize);
1892 ichdr.usedbytes -= entsize;
Dave Chinner1d9025e2012-06-22 18:50:14 +10001893 xfs_trans_log_buf(args->trans, bp,
Dave Chinner517c2222013-04-24 18:58:55 +10001894 XFS_DA_LOGRANGE(leaf, xfs_attr3_leaf_name(leaf, args->index),
Linus Torvalds1da177e2005-04-16 15:20:36 -07001895 entsize));
1896
Dave Chinner517c2222013-04-24 18:58:55 +10001897 tmp = (ichdr.count - args->index) * sizeof(xfs_attr_leaf_entry_t);
1898 memmove(entry, entry + 1, tmp);
1899 ichdr.count--;
Dave Chinner1d9025e2012-06-22 18:50:14 +10001900 xfs_trans_log_buf(args->trans, bp,
Dave Chinner517c2222013-04-24 18:58:55 +10001901 XFS_DA_LOGRANGE(leaf, entry, tmp + sizeof(xfs_attr_leaf_entry_t)));
1902
1903 entry = &xfs_attr3_leaf_entryp(leaf)[ichdr.count];
1904 memset(entry, 0, sizeof(xfs_attr_leaf_entry_t));
Linus Torvalds1da177e2005-04-16 15:20:36 -07001905
1906 /*
1907 * If we removed the first entry, re-find the first used byte
1908 * in the name area. Note that if the entry was the "firstused",
1909 * then we don't have a "hole" in our block resulting from
1910 * removing the name.
1911 */
1912 if (smallest) {
Dave Chinnerc2c4c472014-06-06 15:21:45 +10001913 tmp = args->geo->blksize;
Dave Chinner517c2222013-04-24 18:58:55 +10001914 entry = xfs_attr3_leaf_entryp(leaf);
1915 for (i = ichdr.count - 1; i >= 0; entry++, i--) {
1916 ASSERT(be16_to_cpu(entry->nameidx) >= ichdr.firstused);
Dave Chinnerc2c4c472014-06-06 15:21:45 +10001917 ASSERT(be16_to_cpu(entry->nameidx) < args->geo->blksize);
Nathan Scott6b19f2d2006-03-17 17:29:02 +11001918
1919 if (be16_to_cpu(entry->nameidx) < tmp)
1920 tmp = be16_to_cpu(entry->nameidx);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001921 }
Dave Chinner517c2222013-04-24 18:58:55 +10001922 ichdr.firstused = tmp;
1923 if (!ichdr.firstused)
1924 ichdr.firstused = tmp - XFS_ATTR_LEAF_NAME_ALIGN;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001925 } else {
Dave Chinner517c2222013-04-24 18:58:55 +10001926 ichdr.holes = 1; /* mark as needing compaction */
Linus Torvalds1da177e2005-04-16 15:20:36 -07001927 }
Dave Chinner517c2222013-04-24 18:58:55 +10001928 xfs_attr3_leaf_hdr_to_disk(leaf, &ichdr);
Dave Chinner1d9025e2012-06-22 18:50:14 +10001929 xfs_trans_log_buf(args->trans, bp,
Dave Chinner517c2222013-04-24 18:58:55 +10001930 XFS_DA_LOGRANGE(leaf, &leaf->hdr,
1931 xfs_attr3_leaf_hdr_size(leaf)));
Linus Torvalds1da177e2005-04-16 15:20:36 -07001932
1933 /*
1934 * Check if leaf is less than 50% full, caller may want to
1935 * "join" the leaf with a sibling if so.
1936 */
Dave Chinner517c2222013-04-24 18:58:55 +10001937 tmp = ichdr.usedbytes + xfs_attr3_leaf_hdr_size(leaf) +
1938 ichdr.count * sizeof(xfs_attr_leaf_entry_t);
1939
Dave Chinnered358c02014-06-06 15:18:10 +10001940 return tmp < args->geo->magicpct; /* leaf is < 37% full */
Linus Torvalds1da177e2005-04-16 15:20:36 -07001941}
1942
1943/*
1944 * Move all the attribute list entries from drop_leaf into save_leaf.
1945 */
1946void
Dave Chinner517c2222013-04-24 18:58:55 +10001947xfs_attr3_leaf_unbalance(
1948 struct xfs_da_state *state,
1949 struct xfs_da_state_blk *drop_blk,
1950 struct xfs_da_state_blk *save_blk)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001951{
Dave Chinner517c2222013-04-24 18:58:55 +10001952 struct xfs_attr_leafblock *drop_leaf = drop_blk->bp->b_addr;
1953 struct xfs_attr_leafblock *save_leaf = save_blk->bp->b_addr;
1954 struct xfs_attr3_icleaf_hdr drophdr;
1955 struct xfs_attr3_icleaf_hdr savehdr;
1956 struct xfs_attr_leaf_entry *entry;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001957
Dave Chinner5a5881c2012-03-22 05:15:13 +00001958 trace_xfs_attr_leaf_unbalance(state->args);
1959
Dave Chinner1d9025e2012-06-22 18:50:14 +10001960 drop_leaf = drop_blk->bp->b_addr;
1961 save_leaf = save_blk->bp->b_addr;
Dave Chinner517c2222013-04-24 18:58:55 +10001962 xfs_attr3_leaf_hdr_from_disk(&drophdr, drop_leaf);
1963 xfs_attr3_leaf_hdr_from_disk(&savehdr, save_leaf);
1964 entry = xfs_attr3_leaf_entryp(drop_leaf);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001965
1966 /*
1967 * Save last hashval from dying block for later Btree fixup.
1968 */
Dave Chinner517c2222013-04-24 18:58:55 +10001969 drop_blk->hashval = be32_to_cpu(entry[drophdr.count - 1].hashval);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001970
1971 /*
1972 * Check if we need a temp buffer, or can we do it in place.
1973 * Note that we don't check "leaf" for holes because we will
1974 * always be dropping it, toosmall() decided that for us already.
1975 */
Dave Chinner517c2222013-04-24 18:58:55 +10001976 if (savehdr.holes == 0) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07001977 /*
1978 * dest leaf has no holes, so we add there. May need
1979 * to make some room in the entry array.
1980 */
Dave Chinner517c2222013-04-24 18:58:55 +10001981 if (xfs_attr3_leaf_order(save_blk->bp, &savehdr,
1982 drop_blk->bp, &drophdr)) {
Dave Chinnerc2c4c472014-06-06 15:21:45 +10001983 xfs_attr3_leaf_moveents(state->args,
1984 drop_leaf, &drophdr, 0,
Dave Chinner517c2222013-04-24 18:58:55 +10001985 save_leaf, &savehdr, 0,
Dave Chinnerc2c4c472014-06-06 15:21:45 +10001986 drophdr.count);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001987 } else {
Dave Chinnerc2c4c472014-06-06 15:21:45 +10001988 xfs_attr3_leaf_moveents(state->args,
1989 drop_leaf, &drophdr, 0,
Dave Chinner517c2222013-04-24 18:58:55 +10001990 save_leaf, &savehdr,
Dave Chinnerc2c4c472014-06-06 15:21:45 +10001991 savehdr.count, drophdr.count);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001992 }
1993 } else {
1994 /*
1995 * Destination has holes, so we make a temporary copy
1996 * of the leaf and add them both to that.
1997 */
Dave Chinner517c2222013-04-24 18:58:55 +10001998 struct xfs_attr_leafblock *tmp_leaf;
1999 struct xfs_attr3_icleaf_hdr tmphdr;
2000
Dave Chinnerb2a21e72014-06-06 15:22:04 +10002001 tmp_leaf = kmem_zalloc(state->args->geo->blksize, KM_SLEEP);
Dave Chinner517c2222013-04-24 18:58:55 +10002002
Dave Chinner8517de22013-05-21 18:02:05 +10002003 /*
2004 * Copy the header into the temp leaf so that all the stuff
2005 * not in the incore header is present and gets copied back in
2006 * once we've moved all the entries.
2007 */
2008 memcpy(tmp_leaf, save_leaf, xfs_attr3_leaf_hdr_size(save_leaf));
2009
2010 memset(&tmphdr, 0, sizeof(tmphdr));
Dave Chinner517c2222013-04-24 18:58:55 +10002011 tmphdr.magic = savehdr.magic;
2012 tmphdr.forw = savehdr.forw;
2013 tmphdr.back = savehdr.back;
Dave Chinnerb2a21e72014-06-06 15:22:04 +10002014 tmphdr.firstused = state->args->geo->blksize;
Dave Chinner8517de22013-05-21 18:02:05 +10002015
2016 /* write the header to the temp buffer to initialise it */
2017 xfs_attr3_leaf_hdr_to_disk(tmp_leaf, &tmphdr);
2018
Dave Chinner517c2222013-04-24 18:58:55 +10002019 if (xfs_attr3_leaf_order(save_blk->bp, &savehdr,
2020 drop_blk->bp, &drophdr)) {
Dave Chinnerc2c4c472014-06-06 15:21:45 +10002021 xfs_attr3_leaf_moveents(state->args,
2022 drop_leaf, &drophdr, 0,
Dave Chinner517c2222013-04-24 18:58:55 +10002023 tmp_leaf, &tmphdr, 0,
Dave Chinnerc2c4c472014-06-06 15:21:45 +10002024 drophdr.count);
2025 xfs_attr3_leaf_moveents(state->args,
2026 save_leaf, &savehdr, 0,
Dave Chinner517c2222013-04-24 18:58:55 +10002027 tmp_leaf, &tmphdr, tmphdr.count,
Dave Chinnerc2c4c472014-06-06 15:21:45 +10002028 savehdr.count);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002029 } else {
Dave Chinnerc2c4c472014-06-06 15:21:45 +10002030 xfs_attr3_leaf_moveents(state->args,
2031 save_leaf, &savehdr, 0,
Dave Chinner517c2222013-04-24 18:58:55 +10002032 tmp_leaf, &tmphdr, 0,
Dave Chinnerc2c4c472014-06-06 15:21:45 +10002033 savehdr.count);
2034 xfs_attr3_leaf_moveents(state->args,
2035 drop_leaf, &drophdr, 0,
Dave Chinner517c2222013-04-24 18:58:55 +10002036 tmp_leaf, &tmphdr, tmphdr.count,
Dave Chinnerc2c4c472014-06-06 15:21:45 +10002037 drophdr.count);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002038 }
Dave Chinnerb2a21e72014-06-06 15:22:04 +10002039 memcpy(save_leaf, tmp_leaf, state->args->geo->blksize);
Dave Chinner517c2222013-04-24 18:58:55 +10002040 savehdr = tmphdr; /* struct copy */
2041 kmem_free(tmp_leaf);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002042 }
2043
Dave Chinner517c2222013-04-24 18:58:55 +10002044 xfs_attr3_leaf_hdr_to_disk(save_leaf, &savehdr);
Dave Chinner1d9025e2012-06-22 18:50:14 +10002045 xfs_trans_log_buf(state->args->trans, save_blk->bp, 0,
Dave Chinnerb2a21e72014-06-06 15:22:04 +10002046 state->args->geo->blksize - 1);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002047
2048 /*
2049 * Copy out last hashval in each block for B-tree code.
2050 */
Dave Chinner517c2222013-04-24 18:58:55 +10002051 entry = xfs_attr3_leaf_entryp(save_leaf);
2052 save_blk->hashval = be32_to_cpu(entry[savehdr.count - 1].hashval);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002053}
2054
2055/*========================================================================
2056 * Routines used for finding things in the Btree.
2057 *========================================================================*/
2058
2059/*
2060 * Look up a name in a leaf attribute list structure.
2061 * This is the internal routine, it uses the caller's buffer.
2062 *
2063 * Note that duplicate keys are allowed, but only check within the
2064 * current leaf node. The Btree code must check in adjacent leaf nodes.
2065 *
2066 * Return in args->index the index into the entry[] array of either
2067 * the found entry, or where the entry should have been (insert before
2068 * that entry).
2069 *
2070 * Don't change the args->value unless we find the attribute.
2071 */
2072int
Dave Chinner517c2222013-04-24 18:58:55 +10002073xfs_attr3_leaf_lookup_int(
2074 struct xfs_buf *bp,
2075 struct xfs_da_args *args)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002076{
Dave Chinner517c2222013-04-24 18:58:55 +10002077 struct xfs_attr_leafblock *leaf;
2078 struct xfs_attr3_icleaf_hdr ichdr;
2079 struct xfs_attr_leaf_entry *entry;
2080 struct xfs_attr_leaf_entry *entries;
2081 struct xfs_attr_leaf_name_local *name_loc;
2082 struct xfs_attr_leaf_name_remote *name_rmt;
2083 xfs_dahash_t hashval;
2084 int probe;
2085 int span;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002086
Dave Chinner5a5881c2012-03-22 05:15:13 +00002087 trace_xfs_attr_leaf_lookup(args);
2088
Dave Chinner1d9025e2012-06-22 18:50:14 +10002089 leaf = bp->b_addr;
Dave Chinner517c2222013-04-24 18:58:55 +10002090 xfs_attr3_leaf_hdr_from_disk(&ichdr, leaf);
2091 entries = xfs_attr3_leaf_entryp(leaf);
Dave Chinnerc2c4c472014-06-06 15:21:45 +10002092 ASSERT(ichdr.count < args->geo->blksize / 8);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002093
2094 /*
2095 * Binary search. (note: small blocks will skip this loop)
2096 */
2097 hashval = args->hashval;
Dave Chinner517c2222013-04-24 18:58:55 +10002098 probe = span = ichdr.count / 2;
2099 for (entry = &entries[probe]; span > 4; entry = &entries[probe]) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07002100 span /= 2;
Nathan Scott6b19f2d2006-03-17 17:29:02 +11002101 if (be32_to_cpu(entry->hashval) < hashval)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002102 probe += span;
Nathan Scott6b19f2d2006-03-17 17:29:02 +11002103 else if (be32_to_cpu(entry->hashval) > hashval)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002104 probe -= span;
2105 else
2106 break;
2107 }
Dave Chinner517c2222013-04-24 18:58:55 +10002108 ASSERT(probe >= 0 && (!ichdr.count || probe < ichdr.count));
2109 ASSERT(span <= 4 || be32_to_cpu(entry->hashval) == hashval);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002110
2111 /*
2112 * Since we may have duplicate hashval's, find the first matching
2113 * hashval in the leaf.
2114 */
Dave Chinner517c2222013-04-24 18:58:55 +10002115 while (probe > 0 && be32_to_cpu(entry->hashval) >= hashval) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07002116 entry--;
2117 probe--;
2118 }
Dave Chinner517c2222013-04-24 18:58:55 +10002119 while (probe < ichdr.count &&
2120 be32_to_cpu(entry->hashval) < hashval) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07002121 entry++;
2122 probe++;
2123 }
Dave Chinner517c2222013-04-24 18:58:55 +10002124 if (probe == ichdr.count || be32_to_cpu(entry->hashval) != hashval) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07002125 args->index = probe;
Dave Chinner517c2222013-04-24 18:58:55 +10002126 return XFS_ERROR(ENOATTR);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002127 }
2128
2129 /*
2130 * Duplicate keys may be present, so search all of them for a match.
2131 */
Dave Chinner517c2222013-04-24 18:58:55 +10002132 for (; probe < ichdr.count && (be32_to_cpu(entry->hashval) == hashval);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002133 entry++, probe++) {
2134/*
2135 * GROT: Add code to remove incomplete entries.
2136 */
2137 /*
2138 * If we are looking for INCOMPLETE entries, show only those.
2139 * If we are looking for complete entries, show only those.
2140 */
2141 if ((args->flags & XFS_ATTR_INCOMPLETE) !=
2142 (entry->flags & XFS_ATTR_INCOMPLETE)) {
2143 continue;
2144 }
2145 if (entry->flags & XFS_ATTR_LOCAL) {
Dave Chinner517c2222013-04-24 18:58:55 +10002146 name_loc = xfs_attr3_leaf_name_local(leaf, probe);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002147 if (name_loc->namelen != args->namelen)
2148 continue;
Dave Chinner517c2222013-04-24 18:58:55 +10002149 if (memcmp(args->name, name_loc->nameval,
2150 args->namelen) != 0)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002151 continue;
Tim Shimmin726801b2006-09-28 11:01:37 +10002152 if (!xfs_attr_namesp_match(args->flags, entry->flags))
Linus Torvalds1da177e2005-04-16 15:20:36 -07002153 continue;
2154 args->index = probe;
Dave Chinner517c2222013-04-24 18:58:55 +10002155 return XFS_ERROR(EEXIST);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002156 } else {
Dave Chinner517c2222013-04-24 18:58:55 +10002157 name_rmt = xfs_attr3_leaf_name_remote(leaf, probe);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002158 if (name_rmt->namelen != args->namelen)
2159 continue;
Dave Chinner517c2222013-04-24 18:58:55 +10002160 if (memcmp(args->name, name_rmt->name,
2161 args->namelen) != 0)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002162 continue;
Tim Shimmin726801b2006-09-28 11:01:37 +10002163 if (!xfs_attr_namesp_match(args->flags, entry->flags))
Linus Torvalds1da177e2005-04-16 15:20:36 -07002164 continue;
2165 args->index = probe;
Dave Chinner8275cdd2014-05-06 07:37:31 +10002166 args->rmtvaluelen = be32_to_cpu(name_rmt->valuelen);
Nathan Scottc0f054e2006-03-17 17:29:18 +11002167 args->rmtblkno = be32_to_cpu(name_rmt->valueblk);
Dave Chinnerad1858d2013-05-21 18:02:08 +10002168 args->rmtblkcnt = xfs_attr3_rmt_blocks(
2169 args->dp->i_mount,
Dave Chinner8275cdd2014-05-06 07:37:31 +10002170 args->rmtvaluelen);
Dave Chinner517c2222013-04-24 18:58:55 +10002171 return XFS_ERROR(EEXIST);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002172 }
2173 }
2174 args->index = probe;
Dave Chinner517c2222013-04-24 18:58:55 +10002175 return XFS_ERROR(ENOATTR);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002176}
2177
2178/*
2179 * Get the value associated with an attribute name from a leaf attribute
2180 * list structure.
2181 */
2182int
Dave Chinner517c2222013-04-24 18:58:55 +10002183xfs_attr3_leaf_getvalue(
2184 struct xfs_buf *bp,
2185 struct xfs_da_args *args)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002186{
Dave Chinner517c2222013-04-24 18:58:55 +10002187 struct xfs_attr_leafblock *leaf;
2188 struct xfs_attr3_icleaf_hdr ichdr;
2189 struct xfs_attr_leaf_entry *entry;
2190 struct xfs_attr_leaf_name_local *name_loc;
2191 struct xfs_attr_leaf_name_remote *name_rmt;
2192 int valuelen;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002193
Dave Chinner1d9025e2012-06-22 18:50:14 +10002194 leaf = bp->b_addr;
Dave Chinner517c2222013-04-24 18:58:55 +10002195 xfs_attr3_leaf_hdr_from_disk(&ichdr, leaf);
Dave Chinnerc2c4c472014-06-06 15:21:45 +10002196 ASSERT(ichdr.count < args->geo->blksize / 8);
Dave Chinner517c2222013-04-24 18:58:55 +10002197 ASSERT(args->index < ichdr.count);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002198
Dave Chinner517c2222013-04-24 18:58:55 +10002199 entry = &xfs_attr3_leaf_entryp(leaf)[args->index];
Linus Torvalds1da177e2005-04-16 15:20:36 -07002200 if (entry->flags & XFS_ATTR_LOCAL) {
Dave Chinner517c2222013-04-24 18:58:55 +10002201 name_loc = xfs_attr3_leaf_name_local(leaf, args->index);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002202 ASSERT(name_loc->namelen == args->namelen);
2203 ASSERT(memcmp(args->name, name_loc->nameval, args->namelen) == 0);
Nathan Scott053b5752006-03-17 17:29:09 +11002204 valuelen = be16_to_cpu(name_loc->valuelen);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002205 if (args->flags & ATTR_KERNOVAL) {
2206 args->valuelen = valuelen;
Dave Chinner517c2222013-04-24 18:58:55 +10002207 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002208 }
2209 if (args->valuelen < valuelen) {
2210 args->valuelen = valuelen;
Dave Chinner517c2222013-04-24 18:58:55 +10002211 return XFS_ERROR(ERANGE);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002212 }
2213 args->valuelen = valuelen;
2214 memcpy(args->value, &name_loc->nameval[args->namelen], valuelen);
2215 } else {
Dave Chinner517c2222013-04-24 18:58:55 +10002216 name_rmt = xfs_attr3_leaf_name_remote(leaf, args->index);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002217 ASSERT(name_rmt->namelen == args->namelen);
2218 ASSERT(memcmp(args->name, name_rmt->name, args->namelen) == 0);
Dave Chinner8275cdd2014-05-06 07:37:31 +10002219 args->rmtvaluelen = be32_to_cpu(name_rmt->valuelen);
Nathan Scottc0f054e2006-03-17 17:29:18 +11002220 args->rmtblkno = be32_to_cpu(name_rmt->valueblk);
Dave Chinnerad1858d2013-05-21 18:02:08 +10002221 args->rmtblkcnt = xfs_attr3_rmt_blocks(args->dp->i_mount,
Dave Chinner8275cdd2014-05-06 07:37:31 +10002222 args->rmtvaluelen);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002223 if (args->flags & ATTR_KERNOVAL) {
Dave Chinner8275cdd2014-05-06 07:37:31 +10002224 args->valuelen = args->rmtvaluelen;
Dave Chinner517c2222013-04-24 18:58:55 +10002225 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002226 }
Dave Chinner8275cdd2014-05-06 07:37:31 +10002227 if (args->valuelen < args->rmtvaluelen) {
2228 args->valuelen = args->rmtvaluelen;
Dave Chinner517c2222013-04-24 18:58:55 +10002229 return XFS_ERROR(ERANGE);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002230 }
Dave Chinner8275cdd2014-05-06 07:37:31 +10002231 args->valuelen = args->rmtvaluelen;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002232 }
Dave Chinner517c2222013-04-24 18:58:55 +10002233 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002234}
2235
2236/*========================================================================
2237 * Utility routines.
2238 *========================================================================*/
2239
2240/*
2241 * Move the indicated entries from one leaf to another.
2242 * NOTE: this routine modifies both source and destination leaves.
2243 */
2244/*ARGSUSED*/
2245STATIC void
Dave Chinner517c2222013-04-24 18:58:55 +10002246xfs_attr3_leaf_moveents(
Dave Chinnerc2c4c472014-06-06 15:21:45 +10002247 struct xfs_da_args *args,
Dave Chinner517c2222013-04-24 18:58:55 +10002248 struct xfs_attr_leafblock *leaf_s,
2249 struct xfs_attr3_icleaf_hdr *ichdr_s,
2250 int start_s,
2251 struct xfs_attr_leafblock *leaf_d,
2252 struct xfs_attr3_icleaf_hdr *ichdr_d,
2253 int start_d,
Dave Chinnerc2c4c472014-06-06 15:21:45 +10002254 int count)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002255{
Dave Chinner517c2222013-04-24 18:58:55 +10002256 struct xfs_attr_leaf_entry *entry_s;
2257 struct xfs_attr_leaf_entry *entry_d;
2258 int desti;
2259 int tmp;
2260 int i;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002261
2262 /*
2263 * Check for nothing to do.
2264 */
2265 if (count == 0)
2266 return;
2267
2268 /*
2269 * Set up environment.
2270 */
Dave Chinner517c2222013-04-24 18:58:55 +10002271 ASSERT(ichdr_s->magic == XFS_ATTR_LEAF_MAGIC ||
2272 ichdr_s->magic == XFS_ATTR3_LEAF_MAGIC);
2273 ASSERT(ichdr_s->magic == ichdr_d->magic);
Dave Chinnerc2c4c472014-06-06 15:21:45 +10002274 ASSERT(ichdr_s->count > 0 && ichdr_s->count < args->geo->blksize / 8);
Dave Chinner517c2222013-04-24 18:58:55 +10002275 ASSERT(ichdr_s->firstused >= (ichdr_s->count * sizeof(*entry_s))
2276 + xfs_attr3_leaf_hdr_size(leaf_s));
Dave Chinnerc2c4c472014-06-06 15:21:45 +10002277 ASSERT(ichdr_d->count < args->geo->blksize / 8);
Dave Chinner517c2222013-04-24 18:58:55 +10002278 ASSERT(ichdr_d->firstused >= (ichdr_d->count * sizeof(*entry_d))
2279 + xfs_attr3_leaf_hdr_size(leaf_d));
Linus Torvalds1da177e2005-04-16 15:20:36 -07002280
Dave Chinner517c2222013-04-24 18:58:55 +10002281 ASSERT(start_s < ichdr_s->count);
2282 ASSERT(start_d <= ichdr_d->count);
2283 ASSERT(count <= ichdr_s->count);
2284
Linus Torvalds1da177e2005-04-16 15:20:36 -07002285
2286 /*
2287 * Move the entries in the destination leaf up to make a hole?
2288 */
Dave Chinner517c2222013-04-24 18:58:55 +10002289 if (start_d < ichdr_d->count) {
2290 tmp = ichdr_d->count - start_d;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002291 tmp *= sizeof(xfs_attr_leaf_entry_t);
Dave Chinner517c2222013-04-24 18:58:55 +10002292 entry_s = &xfs_attr3_leaf_entryp(leaf_d)[start_d];
2293 entry_d = &xfs_attr3_leaf_entryp(leaf_d)[start_d + count];
2294 memmove(entry_d, entry_s, tmp);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002295 }
2296
2297 /*
2298 * Copy all entry's in the same (sorted) order,
2299 * but allocate attribute info packed and in sequence.
2300 */
Dave Chinner517c2222013-04-24 18:58:55 +10002301 entry_s = &xfs_attr3_leaf_entryp(leaf_s)[start_s];
2302 entry_d = &xfs_attr3_leaf_entryp(leaf_d)[start_d];
Linus Torvalds1da177e2005-04-16 15:20:36 -07002303 desti = start_d;
2304 for (i = 0; i < count; entry_s++, entry_d++, desti++, i++) {
Dave Chinner517c2222013-04-24 18:58:55 +10002305 ASSERT(be16_to_cpu(entry_s->nameidx) >= ichdr_s->firstused);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002306 tmp = xfs_attr_leaf_entsize(leaf_s, start_s + i);
2307#ifdef GROT
2308 /*
2309 * Code to drop INCOMPLETE entries. Difficult to use as we
2310 * may also need to change the insertion index. Code turned
2311 * off for 6.2, should be revisited later.
2312 */
2313 if (entry_s->flags & XFS_ATTR_INCOMPLETE) { /* skip partials? */
Dave Chinner517c2222013-04-24 18:58:55 +10002314 memset(xfs_attr3_leaf_name(leaf_s, start_s + i), 0, tmp);
2315 ichdr_s->usedbytes -= tmp;
2316 ichdr_s->count -= 1;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002317 entry_d--; /* to compensate for ++ in loop hdr */
2318 desti--;
2319 if ((start_s + i) < offset)
2320 result++; /* insertion index adjustment */
2321 } else {
2322#endif /* GROT */
Dave Chinner517c2222013-04-24 18:58:55 +10002323 ichdr_d->firstused -= tmp;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002324 /* both on-disk, don't endian flip twice */
2325 entry_d->hashval = entry_s->hashval;
Dave Chinner517c2222013-04-24 18:58:55 +10002326 entry_d->nameidx = cpu_to_be16(ichdr_d->firstused);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002327 entry_d->flags = entry_s->flags;
Nathan Scott6b19f2d2006-03-17 17:29:02 +11002328 ASSERT(be16_to_cpu(entry_d->nameidx) + tmp
Dave Chinnerc2c4c472014-06-06 15:21:45 +10002329 <= args->geo->blksize);
Dave Chinner517c2222013-04-24 18:58:55 +10002330 memmove(xfs_attr3_leaf_name(leaf_d, desti),
2331 xfs_attr3_leaf_name(leaf_s, start_s + i), tmp);
Nathan Scott6b19f2d2006-03-17 17:29:02 +11002332 ASSERT(be16_to_cpu(entry_s->nameidx) + tmp
Dave Chinnerc2c4c472014-06-06 15:21:45 +10002333 <= args->geo->blksize);
Dave Chinner517c2222013-04-24 18:58:55 +10002334 memset(xfs_attr3_leaf_name(leaf_s, start_s + i), 0, tmp);
2335 ichdr_s->usedbytes -= tmp;
2336 ichdr_d->usedbytes += tmp;
2337 ichdr_s->count -= 1;
2338 ichdr_d->count += 1;
2339 tmp = ichdr_d->count * sizeof(xfs_attr_leaf_entry_t)
2340 + xfs_attr3_leaf_hdr_size(leaf_d);
2341 ASSERT(ichdr_d->firstused >= tmp);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002342#ifdef GROT
2343 }
2344#endif /* GROT */
2345 }
2346
2347 /*
2348 * Zero out the entries we just copied.
2349 */
Dave Chinner517c2222013-04-24 18:58:55 +10002350 if (start_s == ichdr_s->count) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07002351 tmp = count * sizeof(xfs_attr_leaf_entry_t);
Dave Chinner517c2222013-04-24 18:58:55 +10002352 entry_s = &xfs_attr3_leaf_entryp(leaf_s)[start_s];
Linus Torvalds1da177e2005-04-16 15:20:36 -07002353 ASSERT(((char *)entry_s + tmp) <=
Dave Chinnerc2c4c472014-06-06 15:21:45 +10002354 ((char *)leaf_s + args->geo->blksize));
Dave Chinner517c2222013-04-24 18:58:55 +10002355 memset(entry_s, 0, tmp);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002356 } else {
2357 /*
2358 * Move the remaining entries down to fill the hole,
2359 * then zero the entries at the top.
2360 */
Dave Chinner517c2222013-04-24 18:58:55 +10002361 tmp = (ichdr_s->count - count) * sizeof(xfs_attr_leaf_entry_t);
2362 entry_s = &xfs_attr3_leaf_entryp(leaf_s)[start_s + count];
2363 entry_d = &xfs_attr3_leaf_entryp(leaf_s)[start_s];
2364 memmove(entry_d, entry_s, tmp);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002365
2366 tmp = count * sizeof(xfs_attr_leaf_entry_t);
Dave Chinner517c2222013-04-24 18:58:55 +10002367 entry_s = &xfs_attr3_leaf_entryp(leaf_s)[ichdr_s->count];
Linus Torvalds1da177e2005-04-16 15:20:36 -07002368 ASSERT(((char *)entry_s + tmp) <=
Dave Chinnerc2c4c472014-06-06 15:21:45 +10002369 ((char *)leaf_s + args->geo->blksize));
Dave Chinner517c2222013-04-24 18:58:55 +10002370 memset(entry_s, 0, tmp);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002371 }
2372
2373 /*
2374 * Fill in the freemap information
2375 */
Dave Chinner517c2222013-04-24 18:58:55 +10002376 ichdr_d->freemap[0].base = xfs_attr3_leaf_hdr_size(leaf_d);
2377 ichdr_d->freemap[0].base += ichdr_d->count * sizeof(xfs_attr_leaf_entry_t);
2378 ichdr_d->freemap[0].size = ichdr_d->firstused - ichdr_d->freemap[0].base;
2379 ichdr_d->freemap[1].base = 0;
2380 ichdr_d->freemap[2].base = 0;
2381 ichdr_d->freemap[1].size = 0;
2382 ichdr_d->freemap[2].size = 0;
2383 ichdr_s->holes = 1; /* leaf may not be compact */
Linus Torvalds1da177e2005-04-16 15:20:36 -07002384}
2385
2386/*
2387 * Pick up the last hashvalue from a leaf block.
2388 */
2389xfs_dahash_t
Dave Chinner1d9025e2012-06-22 18:50:14 +10002390xfs_attr_leaf_lasthash(
2391 struct xfs_buf *bp,
2392 int *count)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002393{
Dave Chinner517c2222013-04-24 18:58:55 +10002394 struct xfs_attr3_icleaf_hdr ichdr;
2395 struct xfs_attr_leaf_entry *entries;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002396
Dave Chinner517c2222013-04-24 18:58:55 +10002397 xfs_attr3_leaf_hdr_from_disk(&ichdr, bp->b_addr);
2398 entries = xfs_attr3_leaf_entryp(bp->b_addr);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002399 if (count)
Dave Chinner517c2222013-04-24 18:58:55 +10002400 *count = ichdr.count;
2401 if (!ichdr.count)
2402 return 0;
2403 return be32_to_cpu(entries[ichdr.count - 1].hashval);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002404}
2405
2406/*
2407 * Calculate the number of bytes used to store the indicated attribute
2408 * (whether local or remote only calculate bytes in this block).
2409 */
Christoph Hellwigba0f32d2005-06-21 15:36:52 +10002410STATIC int
Linus Torvalds1da177e2005-04-16 15:20:36 -07002411xfs_attr_leaf_entsize(xfs_attr_leafblock_t *leaf, int index)
2412{
Dave Chinner517c2222013-04-24 18:58:55 +10002413 struct xfs_attr_leaf_entry *entries;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002414 xfs_attr_leaf_name_local_t *name_loc;
2415 xfs_attr_leaf_name_remote_t *name_rmt;
2416 int size;
2417
Dave Chinner517c2222013-04-24 18:58:55 +10002418 entries = xfs_attr3_leaf_entryp(leaf);
2419 if (entries[index].flags & XFS_ATTR_LOCAL) {
2420 name_loc = xfs_attr3_leaf_name_local(leaf, index);
Eric Sandeenc9fb86a2009-01-01 16:40:11 -06002421 size = xfs_attr_leaf_entsize_local(name_loc->namelen,
Nathan Scott053b5752006-03-17 17:29:09 +11002422 be16_to_cpu(name_loc->valuelen));
Linus Torvalds1da177e2005-04-16 15:20:36 -07002423 } else {
Dave Chinner517c2222013-04-24 18:58:55 +10002424 name_rmt = xfs_attr3_leaf_name_remote(leaf, index);
Eric Sandeenc9fb86a2009-01-01 16:40:11 -06002425 size = xfs_attr_leaf_entsize_remote(name_rmt->namelen);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002426 }
Dave Chinner517c2222013-04-24 18:58:55 +10002427 return size;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002428}
2429
2430/*
2431 * Calculate the number of bytes that would be required to store the new
2432 * attribute (whether local or remote only calculate bytes in this block).
2433 * This routine decides as a side effect whether the attribute will be
2434 * a "local" or a "remote" attribute.
2435 */
2436int
Dave Chinnerc59f0ad2014-06-06 15:21:27 +10002437xfs_attr_leaf_newentsize(
2438 struct xfs_da_args *args,
2439 int *local)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002440{
Dave Chinnerc59f0ad2014-06-06 15:21:27 +10002441 int size;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002442
Dave Chinnerc59f0ad2014-06-06 15:21:27 +10002443 size = xfs_attr_leaf_entsize_local(args->namelen, args->valuelen);
2444 if (size < xfs_attr_leaf_entsize_local_max(args->geo->blksize)) {
2445 if (local)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002446 *local = 1;
Dave Chinnerc59f0ad2014-06-06 15:21:27 +10002447 return size;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002448 }
Dave Chinnerc59f0ad2014-06-06 15:21:27 +10002449 if (local)
2450 *local = 0;
2451 return xfs_attr_leaf_entsize_remote(args->namelen);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002452}
2453
Linus Torvalds1da177e2005-04-16 15:20:36 -07002454
2455/*========================================================================
2456 * Manage the INCOMPLETE flag in a leaf entry
2457 *========================================================================*/
2458
2459/*
2460 * Clear the INCOMPLETE flag on an entry in a leaf block.
2461 */
2462int
Dave Chinner517c2222013-04-24 18:58:55 +10002463xfs_attr3_leaf_clearflag(
2464 struct xfs_da_args *args)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002465{
Dave Chinner517c2222013-04-24 18:58:55 +10002466 struct xfs_attr_leafblock *leaf;
2467 struct xfs_attr_leaf_entry *entry;
2468 struct xfs_attr_leaf_name_remote *name_rmt;
2469 struct xfs_buf *bp;
2470 int error;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002471#ifdef DEBUG
Dave Chinner517c2222013-04-24 18:58:55 +10002472 struct xfs_attr3_icleaf_hdr ichdr;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002473 xfs_attr_leaf_name_local_t *name_loc;
2474 int namelen;
2475 char *name;
2476#endif /* DEBUG */
2477
Dave Chinner5a5881c2012-03-22 05:15:13 +00002478 trace_xfs_attr_leaf_clearflag(args);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002479 /*
2480 * Set up the operation.
2481 */
Dave Chinner517c2222013-04-24 18:58:55 +10002482 error = xfs_attr3_leaf_read(args->trans, args->dp, args->blkno, -1, &bp);
Dave Chinnerad14c332012-11-12 22:54:16 +11002483 if (error)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002484 return(error);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002485
Dave Chinner1d9025e2012-06-22 18:50:14 +10002486 leaf = bp->b_addr;
Dave Chinner517c2222013-04-24 18:58:55 +10002487 entry = &xfs_attr3_leaf_entryp(leaf)[args->index];
Linus Torvalds1da177e2005-04-16 15:20:36 -07002488 ASSERT(entry->flags & XFS_ATTR_INCOMPLETE);
2489
2490#ifdef DEBUG
Dave Chinner517c2222013-04-24 18:58:55 +10002491 xfs_attr3_leaf_hdr_from_disk(&ichdr, leaf);
2492 ASSERT(args->index < ichdr.count);
2493 ASSERT(args->index >= 0);
2494
Linus Torvalds1da177e2005-04-16 15:20:36 -07002495 if (entry->flags & XFS_ATTR_LOCAL) {
Dave Chinner517c2222013-04-24 18:58:55 +10002496 name_loc = xfs_attr3_leaf_name_local(leaf, args->index);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002497 namelen = name_loc->namelen;
2498 name = (char *)name_loc->nameval;
2499 } else {
Dave Chinner517c2222013-04-24 18:58:55 +10002500 name_rmt = xfs_attr3_leaf_name_remote(leaf, args->index);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002501 namelen = name_rmt->namelen;
2502 name = (char *)name_rmt->name;
2503 }
Nathan Scott6b19f2d2006-03-17 17:29:02 +11002504 ASSERT(be32_to_cpu(entry->hashval) == args->hashval);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002505 ASSERT(namelen == args->namelen);
2506 ASSERT(memcmp(name, args->name, namelen) == 0);
2507#endif /* DEBUG */
2508
2509 entry->flags &= ~XFS_ATTR_INCOMPLETE;
Dave Chinner1d9025e2012-06-22 18:50:14 +10002510 xfs_trans_log_buf(args->trans, bp,
Linus Torvalds1da177e2005-04-16 15:20:36 -07002511 XFS_DA_LOGRANGE(leaf, entry, sizeof(*entry)));
2512
2513 if (args->rmtblkno) {
2514 ASSERT((entry->flags & XFS_ATTR_LOCAL) == 0);
Dave Chinner517c2222013-04-24 18:58:55 +10002515 name_rmt = xfs_attr3_leaf_name_remote(leaf, args->index);
Nathan Scottc0f054e2006-03-17 17:29:18 +11002516 name_rmt->valueblk = cpu_to_be32(args->rmtblkno);
Dave Chinner8275cdd2014-05-06 07:37:31 +10002517 name_rmt->valuelen = cpu_to_be32(args->rmtvaluelen);
Dave Chinner1d9025e2012-06-22 18:50:14 +10002518 xfs_trans_log_buf(args->trans, bp,
Linus Torvalds1da177e2005-04-16 15:20:36 -07002519 XFS_DA_LOGRANGE(leaf, name_rmt, sizeof(*name_rmt)));
2520 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07002521
2522 /*
2523 * Commit the flag value change and start the next trans in series.
2524 */
Niv Sardi322ff6b2008-08-13 16:05:49 +10002525 return xfs_trans_roll(&args->trans, args->dp);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002526}
2527
2528/*
2529 * Set the INCOMPLETE flag on an entry in a leaf block.
2530 */
2531int
Dave Chinner517c2222013-04-24 18:58:55 +10002532xfs_attr3_leaf_setflag(
2533 struct xfs_da_args *args)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002534{
Dave Chinner517c2222013-04-24 18:58:55 +10002535 struct xfs_attr_leafblock *leaf;
2536 struct xfs_attr_leaf_entry *entry;
2537 struct xfs_attr_leaf_name_remote *name_rmt;
2538 struct xfs_buf *bp;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002539 int error;
Dave Chinner517c2222013-04-24 18:58:55 +10002540#ifdef DEBUG
2541 struct xfs_attr3_icleaf_hdr ichdr;
2542#endif
Linus Torvalds1da177e2005-04-16 15:20:36 -07002543
Dave Chinner5a5881c2012-03-22 05:15:13 +00002544 trace_xfs_attr_leaf_setflag(args);
2545
Linus Torvalds1da177e2005-04-16 15:20:36 -07002546 /*
2547 * Set up the operation.
2548 */
Dave Chinner517c2222013-04-24 18:58:55 +10002549 error = xfs_attr3_leaf_read(args->trans, args->dp, args->blkno, -1, &bp);
Dave Chinnerad14c332012-11-12 22:54:16 +11002550 if (error)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002551 return(error);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002552
Dave Chinner1d9025e2012-06-22 18:50:14 +10002553 leaf = bp->b_addr;
Dave Chinner517c2222013-04-24 18:58:55 +10002554#ifdef DEBUG
2555 xfs_attr3_leaf_hdr_from_disk(&ichdr, leaf);
2556 ASSERT(args->index < ichdr.count);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002557 ASSERT(args->index >= 0);
Dave Chinner517c2222013-04-24 18:58:55 +10002558#endif
2559 entry = &xfs_attr3_leaf_entryp(leaf)[args->index];
Linus Torvalds1da177e2005-04-16 15:20:36 -07002560
2561 ASSERT((entry->flags & XFS_ATTR_INCOMPLETE) == 0);
2562 entry->flags |= XFS_ATTR_INCOMPLETE;
Dave Chinner1d9025e2012-06-22 18:50:14 +10002563 xfs_trans_log_buf(args->trans, bp,
Linus Torvalds1da177e2005-04-16 15:20:36 -07002564 XFS_DA_LOGRANGE(leaf, entry, sizeof(*entry)));
2565 if ((entry->flags & XFS_ATTR_LOCAL) == 0) {
Dave Chinner517c2222013-04-24 18:58:55 +10002566 name_rmt = xfs_attr3_leaf_name_remote(leaf, args->index);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002567 name_rmt->valueblk = 0;
2568 name_rmt->valuelen = 0;
Dave Chinner1d9025e2012-06-22 18:50:14 +10002569 xfs_trans_log_buf(args->trans, bp,
Linus Torvalds1da177e2005-04-16 15:20:36 -07002570 XFS_DA_LOGRANGE(leaf, name_rmt, sizeof(*name_rmt)));
2571 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07002572
2573 /*
2574 * Commit the flag value change and start the next trans in series.
2575 */
Niv Sardi322ff6b2008-08-13 16:05:49 +10002576 return xfs_trans_roll(&args->trans, args->dp);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002577}
2578
2579/*
2580 * In a single transaction, clear the INCOMPLETE flag on the leaf entry
2581 * given by args->blkno/index and set the INCOMPLETE flag on the leaf
2582 * entry given by args->blkno2/index2.
2583 *
2584 * Note that they could be in different blocks, or in the same block.
2585 */
2586int
Dave Chinner517c2222013-04-24 18:58:55 +10002587xfs_attr3_leaf_flipflags(
2588 struct xfs_da_args *args)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002589{
Dave Chinner517c2222013-04-24 18:58:55 +10002590 struct xfs_attr_leafblock *leaf1;
2591 struct xfs_attr_leafblock *leaf2;
2592 struct xfs_attr_leaf_entry *entry1;
2593 struct xfs_attr_leaf_entry *entry2;
2594 struct xfs_attr_leaf_name_remote *name_rmt;
2595 struct xfs_buf *bp1;
2596 struct xfs_buf *bp2;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002597 int error;
2598#ifdef DEBUG
Dave Chinner517c2222013-04-24 18:58:55 +10002599 struct xfs_attr3_icleaf_hdr ichdr1;
2600 struct xfs_attr3_icleaf_hdr ichdr2;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002601 xfs_attr_leaf_name_local_t *name_loc;
2602 int namelen1, namelen2;
2603 char *name1, *name2;
2604#endif /* DEBUG */
2605
Dave Chinner5a5881c2012-03-22 05:15:13 +00002606 trace_xfs_attr_leaf_flipflags(args);
2607
Linus Torvalds1da177e2005-04-16 15:20:36 -07002608 /*
2609 * Read the block containing the "old" attr
2610 */
Dave Chinner517c2222013-04-24 18:58:55 +10002611 error = xfs_attr3_leaf_read(args->trans, args->dp, args->blkno, -1, &bp1);
Dave Chinnerad14c332012-11-12 22:54:16 +11002612 if (error)
2613 return error;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002614
2615 /*
2616 * Read the block containing the "new" attr, if it is different
2617 */
2618 if (args->blkno2 != args->blkno) {
Dave Chinner517c2222013-04-24 18:58:55 +10002619 error = xfs_attr3_leaf_read(args->trans, args->dp, args->blkno2,
Dave Chinnerad14c332012-11-12 22:54:16 +11002620 -1, &bp2);
2621 if (error)
2622 return error;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002623 } else {
2624 bp2 = bp1;
2625 }
2626
Dave Chinner1d9025e2012-06-22 18:50:14 +10002627 leaf1 = bp1->b_addr;
Dave Chinner517c2222013-04-24 18:58:55 +10002628 entry1 = &xfs_attr3_leaf_entryp(leaf1)[args->index];
Linus Torvalds1da177e2005-04-16 15:20:36 -07002629
Dave Chinner1d9025e2012-06-22 18:50:14 +10002630 leaf2 = bp2->b_addr;
Dave Chinner517c2222013-04-24 18:58:55 +10002631 entry2 = &xfs_attr3_leaf_entryp(leaf2)[args->index2];
Linus Torvalds1da177e2005-04-16 15:20:36 -07002632
2633#ifdef DEBUG
Dave Chinner517c2222013-04-24 18:58:55 +10002634 xfs_attr3_leaf_hdr_from_disk(&ichdr1, leaf1);
2635 ASSERT(args->index < ichdr1.count);
2636 ASSERT(args->index >= 0);
2637
2638 xfs_attr3_leaf_hdr_from_disk(&ichdr2, leaf2);
2639 ASSERT(args->index2 < ichdr2.count);
2640 ASSERT(args->index2 >= 0);
2641
Linus Torvalds1da177e2005-04-16 15:20:36 -07002642 if (entry1->flags & XFS_ATTR_LOCAL) {
Dave Chinner517c2222013-04-24 18:58:55 +10002643 name_loc = xfs_attr3_leaf_name_local(leaf1, args->index);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002644 namelen1 = name_loc->namelen;
2645 name1 = (char *)name_loc->nameval;
2646 } else {
Dave Chinner517c2222013-04-24 18:58:55 +10002647 name_rmt = xfs_attr3_leaf_name_remote(leaf1, args->index);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002648 namelen1 = name_rmt->namelen;
2649 name1 = (char *)name_rmt->name;
2650 }
2651 if (entry2->flags & XFS_ATTR_LOCAL) {
Dave Chinner517c2222013-04-24 18:58:55 +10002652 name_loc = xfs_attr3_leaf_name_local(leaf2, args->index2);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002653 namelen2 = name_loc->namelen;
2654 name2 = (char *)name_loc->nameval;
2655 } else {
Dave Chinner517c2222013-04-24 18:58:55 +10002656 name_rmt = xfs_attr3_leaf_name_remote(leaf2, args->index2);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002657 namelen2 = name_rmt->namelen;
2658 name2 = (char *)name_rmt->name;
2659 }
Nathan Scott6b19f2d2006-03-17 17:29:02 +11002660 ASSERT(be32_to_cpu(entry1->hashval) == be32_to_cpu(entry2->hashval));
Linus Torvalds1da177e2005-04-16 15:20:36 -07002661 ASSERT(namelen1 == namelen2);
2662 ASSERT(memcmp(name1, name2, namelen1) == 0);
2663#endif /* DEBUG */
2664
2665 ASSERT(entry1->flags & XFS_ATTR_INCOMPLETE);
2666 ASSERT((entry2->flags & XFS_ATTR_INCOMPLETE) == 0);
2667
2668 entry1->flags &= ~XFS_ATTR_INCOMPLETE;
Dave Chinner1d9025e2012-06-22 18:50:14 +10002669 xfs_trans_log_buf(args->trans, bp1,
Linus Torvalds1da177e2005-04-16 15:20:36 -07002670 XFS_DA_LOGRANGE(leaf1, entry1, sizeof(*entry1)));
2671 if (args->rmtblkno) {
2672 ASSERT((entry1->flags & XFS_ATTR_LOCAL) == 0);
Dave Chinner517c2222013-04-24 18:58:55 +10002673 name_rmt = xfs_attr3_leaf_name_remote(leaf1, args->index);
Nathan Scottc0f054e2006-03-17 17:29:18 +11002674 name_rmt->valueblk = cpu_to_be32(args->rmtblkno);
Dave Chinner8275cdd2014-05-06 07:37:31 +10002675 name_rmt->valuelen = cpu_to_be32(args->rmtvaluelen);
Dave Chinner1d9025e2012-06-22 18:50:14 +10002676 xfs_trans_log_buf(args->trans, bp1,
Linus Torvalds1da177e2005-04-16 15:20:36 -07002677 XFS_DA_LOGRANGE(leaf1, name_rmt, sizeof(*name_rmt)));
2678 }
2679
2680 entry2->flags |= XFS_ATTR_INCOMPLETE;
Dave Chinner1d9025e2012-06-22 18:50:14 +10002681 xfs_trans_log_buf(args->trans, bp2,
Linus Torvalds1da177e2005-04-16 15:20:36 -07002682 XFS_DA_LOGRANGE(leaf2, entry2, sizeof(*entry2)));
2683 if ((entry2->flags & XFS_ATTR_LOCAL) == 0) {
Dave Chinner517c2222013-04-24 18:58:55 +10002684 name_rmt = xfs_attr3_leaf_name_remote(leaf2, args->index2);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002685 name_rmt->valueblk = 0;
2686 name_rmt->valuelen = 0;
Dave Chinner1d9025e2012-06-22 18:50:14 +10002687 xfs_trans_log_buf(args->trans, bp2,
Linus Torvalds1da177e2005-04-16 15:20:36 -07002688 XFS_DA_LOGRANGE(leaf2, name_rmt, sizeof(*name_rmt)));
2689 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07002690
2691 /*
2692 * Commit the flag value change and start the next trans in series.
2693 */
Niv Sardi322ff6b2008-08-13 16:05:49 +10002694 error = xfs_trans_roll(&args->trans, args->dp);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002695
Dave Chinner517c2222013-04-24 18:58:55 +10002696 return error;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002697}