blob: fe9587fab17a6822d9bec1b5862a6a133adf9dc7 [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 Chinner517c2222013-04-24 18:58:55 +100083STATIC void xfs_attr3_leaf_moveents(struct xfs_attr_leafblock *src_leaf,
84 struct xfs_attr3_icleaf_hdr *src_ichdr, int src_start,
85 struct xfs_attr_leafblock *dst_leaf,
86 struct xfs_attr3_icleaf_hdr *dst_ichdr, int dst_start,
87 int move_count, struct xfs_mount *mp);
Christoph Hellwigba0f32d2005-06-21 15:36:52 +100088STATIC int xfs_attr_leaf_entsize(xfs_attr_leafblock_t *leaf, int index);
Tim Shimmin726801b2006-09-28 11:01:37 +100089
Dave Chinner517c2222013-04-24 18:58:55 +100090void
91xfs_attr3_leaf_hdr_from_disk(
92 struct xfs_attr3_icleaf_hdr *to,
93 struct xfs_attr_leafblock *from)
94{
95 int i;
96
97 ASSERT(from->hdr.info.magic == cpu_to_be16(XFS_ATTR_LEAF_MAGIC) ||
98 from->hdr.info.magic == cpu_to_be16(XFS_ATTR3_LEAF_MAGIC));
99
100 if (from->hdr.info.magic == cpu_to_be16(XFS_ATTR3_LEAF_MAGIC)) {
101 struct xfs_attr3_leaf_hdr *hdr3 = (struct xfs_attr3_leaf_hdr *)from;
102
103 to->forw = be32_to_cpu(hdr3->info.hdr.forw);
104 to->back = be32_to_cpu(hdr3->info.hdr.back);
105 to->magic = be16_to_cpu(hdr3->info.hdr.magic);
106 to->count = be16_to_cpu(hdr3->count);
107 to->usedbytes = be16_to_cpu(hdr3->usedbytes);
108 to->firstused = be16_to_cpu(hdr3->firstused);
109 to->holes = hdr3->holes;
110
111 for (i = 0; i < XFS_ATTR_LEAF_MAPSIZE; i++) {
112 to->freemap[i].base = be16_to_cpu(hdr3->freemap[i].base);
113 to->freemap[i].size = be16_to_cpu(hdr3->freemap[i].size);
114 }
115 return;
116 }
117 to->forw = be32_to_cpu(from->hdr.info.forw);
118 to->back = be32_to_cpu(from->hdr.info.back);
119 to->magic = be16_to_cpu(from->hdr.info.magic);
120 to->count = be16_to_cpu(from->hdr.count);
121 to->usedbytes = be16_to_cpu(from->hdr.usedbytes);
122 to->firstused = be16_to_cpu(from->hdr.firstused);
123 to->holes = from->hdr.holes;
124
125 for (i = 0; i < XFS_ATTR_LEAF_MAPSIZE; i++) {
126 to->freemap[i].base = be16_to_cpu(from->hdr.freemap[i].base);
127 to->freemap[i].size = be16_to_cpu(from->hdr.freemap[i].size);
128 }
129}
130
131void
132xfs_attr3_leaf_hdr_to_disk(
133 struct xfs_attr_leafblock *to,
134 struct xfs_attr3_icleaf_hdr *from)
135{
136 int i;
137
138 ASSERT(from->magic == XFS_ATTR_LEAF_MAGIC ||
139 from->magic == XFS_ATTR3_LEAF_MAGIC);
140
141 if (from->magic == XFS_ATTR3_LEAF_MAGIC) {
142 struct xfs_attr3_leaf_hdr *hdr3 = (struct xfs_attr3_leaf_hdr *)to;
143
144 hdr3->info.hdr.forw = cpu_to_be32(from->forw);
145 hdr3->info.hdr.back = cpu_to_be32(from->back);
146 hdr3->info.hdr.magic = cpu_to_be16(from->magic);
147 hdr3->count = cpu_to_be16(from->count);
148 hdr3->usedbytes = cpu_to_be16(from->usedbytes);
149 hdr3->firstused = cpu_to_be16(from->firstused);
150 hdr3->holes = from->holes;
151 hdr3->pad1 = 0;
152
153 for (i = 0; i < XFS_ATTR_LEAF_MAPSIZE; i++) {
154 hdr3->freemap[i].base = cpu_to_be16(from->freemap[i].base);
155 hdr3->freemap[i].size = cpu_to_be16(from->freemap[i].size);
156 }
157 return;
158 }
159 to->hdr.info.forw = cpu_to_be32(from->forw);
160 to->hdr.info.back = cpu_to_be32(from->back);
161 to->hdr.info.magic = cpu_to_be16(from->magic);
162 to->hdr.count = cpu_to_be16(from->count);
163 to->hdr.usedbytes = cpu_to_be16(from->usedbytes);
164 to->hdr.firstused = cpu_to_be16(from->firstused);
165 to->hdr.holes = from->holes;
166 to->hdr.pad1 = 0;
167
168 for (i = 0; i < XFS_ATTR_LEAF_MAPSIZE; i++) {
169 to->hdr.freemap[i].base = cpu_to_be16(from->freemap[i].base);
170 to->hdr.freemap[i].size = cpu_to_be16(from->freemap[i].size);
171 }
172}
173
174static bool
175xfs_attr3_leaf_verify(
Dave Chinnerad14c332012-11-12 22:54:16 +1100176 struct xfs_buf *bp)
177{
178 struct xfs_mount *mp = bp->b_target->bt_mount;
Dave Chinner517c2222013-04-24 18:58:55 +1000179 struct xfs_attr_leafblock *leaf = bp->b_addr;
180 struct xfs_attr3_icleaf_hdr ichdr;
Dave Chinnerad14c332012-11-12 22:54:16 +1100181
Dave Chinner517c2222013-04-24 18:58:55 +1000182 xfs_attr3_leaf_hdr_from_disk(&ichdr, leaf);
183
184 if (xfs_sb_version_hascrc(&mp->m_sb)) {
185 struct xfs_da3_node_hdr *hdr3 = bp->b_addr;
186
187 if (ichdr.magic != XFS_ATTR3_LEAF_MAGIC)
188 return false;
189
190 if (!uuid_equal(&hdr3->info.uuid, &mp->m_sb.sb_uuid))
191 return false;
192 if (be64_to_cpu(hdr3->info.blkno) != bp->b_bn)
193 return false;
194 } else {
195 if (ichdr.magic != XFS_ATTR_LEAF_MAGIC)
196 return false;
197 }
198 if (ichdr.count == 0)
199 return false;
200
201 /* XXX: need to range check rest of attr header values */
202 /* XXX: hash order check? */
203
204 return true;
205}
206
207static void
208xfs_attr3_leaf_write_verify(
209 struct xfs_buf *bp)
210{
211 struct xfs_mount *mp = bp->b_target->bt_mount;
212 struct xfs_buf_log_item *bip = bp->b_fspriv;
213 struct xfs_attr3_leaf_hdr *hdr3 = bp->b_addr;
214
215 if (!xfs_attr3_leaf_verify(bp)) {
Dave Chinner517c2222013-04-24 18:58:55 +1000216 xfs_buf_ioerror(bp, EFSCORRUPTED);
Eric Sandeence5028c2014-02-27 15:23:10 +1100217 xfs_verifier_error(bp);
Dave Chinner517c2222013-04-24 18:58:55 +1000218 return;
219 }
220
221 if (!xfs_sb_version_hascrc(&mp->m_sb))
222 return;
223
224 if (bip)
225 hdr3->info.lsn = cpu_to_be64(bip->bli_item.li_lsn);
226
Eric Sandeenf1dbcd72014-02-27 15:18:23 +1100227 xfs_buf_update_cksum(bp, XFS_ATTR3_LEAF_CRC_OFF);
Dave Chinner517c2222013-04-24 18:58:55 +1000228}
229
230/*
231 * leaf/node format detection on trees is sketchy, so a node read can be done on
232 * leaf level blocks when detection identifies the tree as a node format tree
233 * incorrectly. In this case, we need to swap the verifier to match the correct
234 * format of the block being read.
235 */
236static void
237xfs_attr3_leaf_read_verify(
238 struct xfs_buf *bp)
239{
240 struct xfs_mount *mp = bp->b_target->bt_mount;
241
Eric Sandeence5028c2014-02-27 15:23:10 +1100242 if (xfs_sb_version_hascrc(&mp->m_sb) &&
243 !xfs_buf_verify_cksum(bp, XFS_ATTR3_LEAF_CRC_OFF))
244 xfs_buf_ioerror(bp, EFSBADCRC);
245 else if (!xfs_attr3_leaf_verify(bp))
Dave Chinnerad14c332012-11-12 22:54:16 +1100246 xfs_buf_ioerror(bp, EFSCORRUPTED);
Eric Sandeence5028c2014-02-27 15:23:10 +1100247
248 if (bp->b_error)
249 xfs_verifier_error(bp);
Dave Chinner612cfbf2012-11-14 17:52:32 +1100250}
Dave Chinnerad14c332012-11-12 22:54:16 +1100251
Dave Chinner517c2222013-04-24 18:58:55 +1000252const struct xfs_buf_ops xfs_attr3_leaf_buf_ops = {
253 .verify_read = xfs_attr3_leaf_read_verify,
254 .verify_write = xfs_attr3_leaf_write_verify,
Dave Chinner1813dd62012-11-14 17:54:40 +1100255};
Dave Chinner612cfbf2012-11-14 17:52:32 +1100256
Dave Chinnerad14c332012-11-12 22:54:16 +1100257int
Dave Chinner517c2222013-04-24 18:58:55 +1000258xfs_attr3_leaf_read(
Dave Chinnerad14c332012-11-12 22:54:16 +1100259 struct xfs_trans *tp,
260 struct xfs_inode *dp,
261 xfs_dablk_t bno,
262 xfs_daddr_t mappedbno,
263 struct xfs_buf **bpp)
264{
Dave Chinnerd75afeb2013-04-03 16:11:29 +1100265 int err;
266
267 err = xfs_da_read_buf(tp, dp, bno, mappedbno, bpp,
Dave Chinner517c2222013-04-24 18:58:55 +1000268 XFS_ATTR_FORK, &xfs_attr3_leaf_buf_ops);
Dave Chinnerd75afeb2013-04-03 16:11:29 +1100269 if (!err && tp)
Dave Chinner61fe1352013-04-03 16:11:30 +1100270 xfs_trans_buf_set_type(tp, *bpp, XFS_BLFT_ATTR_LEAF_BUF);
Dave Chinnerd75afeb2013-04-03 16:11:29 +1100271 return err;
Dave Chinnerad14c332012-11-12 22:54:16 +1100272}
273
Tim Shimmin726801b2006-09-28 11:01:37 +1000274/*========================================================================
275 * Namespace helper routines
276 *========================================================================*/
277
Tim Shimmin726801b2006-09-28 11:01:37 +1000278/*
279 * If namespace bits don't match return 0.
280 * If all match then return 1.
281 */
Christoph Hellwigb8f82a42009-11-14 16:17:22 +0000282STATIC int
Tim Shimmin726801b2006-09-28 11:01:37 +1000283xfs_attr_namesp_match(int arg_flags, int ondisk_flags)
284{
285 return XFS_ATTR_NSP_ONDISK(ondisk_flags) == XFS_ATTR_NSP_ARGS_TO_ONDISK(arg_flags);
286}
287
Linus Torvalds1da177e2005-04-16 15:20:36 -0700288
289/*========================================================================
Nathan Scottd8cc8902005-11-02 10:34:53 +1100290 * External routines when attribute fork size < XFS_LITINO(mp).
Linus Torvalds1da177e2005-04-16 15:20:36 -0700291 *========================================================================*/
292
293/*
Nathan Scottd8cc8902005-11-02 10:34:53 +1100294 * Query whether the requested number of additional bytes of extended
295 * attribute space will be able to fit inline.
Christoph Hellwig4c393a62011-11-19 17:44:30 +0000296 *
Nathan Scottd8cc8902005-11-02 10:34:53 +1100297 * Returns zero if not, else the di_forkoff fork offset to be used in the
298 * literal area for attribute data once the new bytes have been added.
299 *
300 * di_forkoff must be 8 byte aligned, hence is stored as a >>3 value;
301 * special case for dev/uuid inodes, they have fixed size data forks.
302 */
303int
304xfs_attr_shortform_bytesfit(xfs_inode_t *dp, int bytes)
305{
306 int offset;
307 int minforkoff; /* lower limit on valid forkoff locations */
308 int maxforkoff; /* upper limit on valid forkoff locations */
Christoph Hellwig4c393a62011-11-19 17:44:30 +0000309 int dsize;
Nathan Scottd8cc8902005-11-02 10:34:53 +1100310 xfs_mount_t *mp = dp->i_mount;
311
Christoph Hellwig56cea2d2013-03-12 23:30:36 +1100312 /* rounded down */
313 offset = (XFS_LITINO(mp, dp->i_d.di_version) - bytes) >> 3;
Nathan Scottd8cc8902005-11-02 10:34:53 +1100314
315 switch (dp->i_d.di_format) {
316 case XFS_DINODE_FMT_DEV:
317 minforkoff = roundup(sizeof(xfs_dev_t), 8) >> 3;
318 return (offset >= minforkoff) ? minforkoff : 0;
319 case XFS_DINODE_FMT_UUID:
320 minforkoff = roundup(sizeof(uuid_t), 8) >> 3;
321 return (offset >= minforkoff) ? minforkoff : 0;
322 }
323
Christoph Hellwig4c393a62011-11-19 17:44:30 +0000324 /*
325 * If the requested numbers of bytes is smaller or equal to the
326 * current attribute fork size we can always proceed.
327 *
328 * Note that if_bytes in the data fork might actually be larger than
329 * the current data fork size is due to delalloc extents. In that
330 * case either the extent count will go down when they are converted
331 * to real extents, or the delalloc conversion will take care of the
332 * literal area rebalancing.
333 */
334 if (bytes <= XFS_IFORK_ASIZE(dp))
335 return dp->i_d.di_forkoff;
336
337 /*
338 * For attr2 we can try to move the forkoff if there is space in the
339 * literal area, but for the old format we are done if there is no
340 * space in the fixed attribute fork.
341 */
342 if (!(mp->m_flags & XFS_MOUNT_ATTR2))
Nathan Scottda087ba2005-11-02 15:00:20 +1100343 return 0;
Nathan Scottda087ba2005-11-02 15:00:20 +1100344
Barry Naujoke5889e92007-02-10 18:35:58 +1100345 dsize = dp->i_df.if_bytes;
Christoph Hellwig4c393a62011-11-19 17:44:30 +0000346
Barry Naujoke5889e92007-02-10 18:35:58 +1100347 switch (dp->i_d.di_format) {
348 case XFS_DINODE_FMT_EXTENTS:
Christoph Hellwig4c393a62011-11-19 17:44:30 +0000349 /*
Barry Naujoke5889e92007-02-10 18:35:58 +1100350 * If there is no attr fork and the data fork is extents,
Christoph Hellwig4c393a62011-11-19 17:44:30 +0000351 * determine if creating the default attr fork will result
352 * in the extents form migrating to btree. If so, the
353 * minimum offset only needs to be the space required for
Barry Naujoke5889e92007-02-10 18:35:58 +1100354 * the btree root.
Christoph Hellwig4c393a62011-11-19 17:44:30 +0000355 */
Christoph Hellwig1a5902c2009-03-29 19:26:46 +0200356 if (!dp->i_d.di_forkoff && dp->i_df.if_bytes >
357 xfs_default_attroffset(dp))
Barry Naujoke5889e92007-02-10 18:35:58 +1100358 dsize = XFS_BMDR_SPACE_CALC(MINDBTPTRS);
359 break;
Barry Naujoke5889e92007-02-10 18:35:58 +1100360 case XFS_DINODE_FMT_BTREE:
361 /*
Christoph Hellwig4c393a62011-11-19 17:44:30 +0000362 * If we have a data btree then keep forkoff if we have one,
363 * otherwise we are adding a new attr, so then we set
364 * minforkoff to where the btree root can finish so we have
Barry Naujoke5889e92007-02-10 18:35:58 +1100365 * plenty of room for attrs
366 */
367 if (dp->i_d.di_forkoff) {
Christoph Hellwig4c393a62011-11-19 17:44:30 +0000368 if (offset < dp->i_d.di_forkoff)
Barry Naujoke5889e92007-02-10 18:35:58 +1100369 return 0;
Christoph Hellwig4c393a62011-11-19 17:44:30 +0000370 return dp->i_d.di_forkoff;
371 }
Christoph Hellwigee1a47a2013-04-21 14:53:46 -0500372 dsize = XFS_BMAP_BROOT_SPACE(mp, dp->i_df.if_broot);
Barry Naujoke5889e92007-02-10 18:35:58 +1100373 break;
374 }
Christoph Hellwig4c393a62011-11-19 17:44:30 +0000375
376 /*
377 * A data fork btree root must have space for at least
Barry Naujoke5889e92007-02-10 18:35:58 +1100378 * MINDBTPTRS key/ptr pairs if the data fork is small or empty.
379 */
380 minforkoff = MAX(dsize, XFS_BMDR_SPACE_CALC(MINDBTPTRS));
Nathan Scottd8cc8902005-11-02 10:34:53 +1100381 minforkoff = roundup(minforkoff, 8) >> 3;
382
383 /* attr fork btree root can have at least this many key/ptr pairs */
Christoph Hellwig56cea2d2013-03-12 23:30:36 +1100384 maxforkoff = XFS_LITINO(mp, dp->i_d.di_version) -
385 XFS_BMDR_SPACE_CALC(MINABTPTRS);
Nathan Scottd8cc8902005-11-02 10:34:53 +1100386 maxforkoff = maxforkoff >> 3; /* rounded down */
387
Nathan Scottd8cc8902005-11-02 10:34:53 +1100388 if (offset >= maxforkoff)
389 return maxforkoff;
Christoph Hellwig4c393a62011-11-19 17:44:30 +0000390 if (offset >= minforkoff)
391 return offset;
Nathan Scottd8cc8902005-11-02 10:34:53 +1100392 return 0;
393}
394
395/*
396 * Switch on the ATTR2 superblock bit (implies also FEATURES2)
397 */
398STATIC void
399xfs_sbversion_add_attr2(xfs_mount_t *mp, xfs_trans_t *tp)
400{
Nathan Scott13059ff2006-01-11 15:32:01 +1100401 if ((mp->m_flags & XFS_MOUNT_ATTR2) &&
Eric Sandeen62118702008-03-06 13:44:28 +1100402 !(xfs_sb_version_hasattr2(&mp->m_sb))) {
Eric Sandeen3685c2a2007-10-11 17:42:32 +1000403 spin_lock(&mp->m_sb_lock);
Eric Sandeen62118702008-03-06 13:44:28 +1100404 if (!xfs_sb_version_hasattr2(&mp->m_sb)) {
405 xfs_sb_version_addattr2(&mp->m_sb);
Eric Sandeen3685c2a2007-10-11 17:42:32 +1000406 spin_unlock(&mp->m_sb_lock);
Nathan Scottd8cc8902005-11-02 10:34:53 +1100407 xfs_mod_sb(tp, XFS_SB_VERSIONNUM | XFS_SB_FEATURES2);
408 } else
Eric Sandeen3685c2a2007-10-11 17:42:32 +1000409 spin_unlock(&mp->m_sb_lock);
Nathan Scottd8cc8902005-11-02 10:34:53 +1100410 }
411}
412
413/*
Linus Torvalds1da177e2005-04-16 15:20:36 -0700414 * Create the initial contents of a shortform attribute list.
415 */
Nathan Scottd8cc8902005-11-02 10:34:53 +1100416void
Linus Torvalds1da177e2005-04-16 15:20:36 -0700417xfs_attr_shortform_create(xfs_da_args_t *args)
418{
419 xfs_attr_sf_hdr_t *hdr;
420 xfs_inode_t *dp;
421 xfs_ifork_t *ifp;
422
Dave Chinner5a5881c2012-03-22 05:15:13 +0000423 trace_xfs_attr_sf_create(args);
424
Linus Torvalds1da177e2005-04-16 15:20:36 -0700425 dp = args->dp;
426 ASSERT(dp != NULL);
427 ifp = dp->i_afp;
428 ASSERT(ifp != NULL);
429 ASSERT(ifp->if_bytes == 0);
430 if (dp->i_d.di_aformat == XFS_DINODE_FMT_EXTENTS) {
431 ifp->if_flags &= ~XFS_IFEXTENTS; /* just in case */
432 dp->i_d.di_aformat = XFS_DINODE_FMT_LOCAL;
433 ifp->if_flags |= XFS_IFINLINE;
434 } else {
435 ASSERT(ifp->if_flags & XFS_IFINLINE);
436 }
437 xfs_idata_realloc(dp, sizeof(*hdr), XFS_ATTR_FORK);
438 hdr = (xfs_attr_sf_hdr_t *)ifp->if_u1.if_data;
439 hdr->count = 0;
Nathan Scott3b244aa2006-03-17 17:29:25 +1100440 hdr->totsize = cpu_to_be16(sizeof(*hdr));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700441 xfs_trans_log_inode(args->trans, dp, XFS_ILOG_CORE | XFS_ILOG_ADATA);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700442}
443
444/*
445 * Add a name/value pair to the shortform attribute list.
446 * Overflow from the inode has already been checked for.
447 */
Nathan Scottd8cc8902005-11-02 10:34:53 +1100448void
449xfs_attr_shortform_add(xfs_da_args_t *args, int forkoff)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700450{
451 xfs_attr_shortform_t *sf;
452 xfs_attr_sf_entry_t *sfe;
453 int i, offset, size;
Nathan Scottd8cc8902005-11-02 10:34:53 +1100454 xfs_mount_t *mp;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700455 xfs_inode_t *dp;
456 xfs_ifork_t *ifp;
457
Dave Chinner5a5881c2012-03-22 05:15:13 +0000458 trace_xfs_attr_sf_add(args);
459
Linus Torvalds1da177e2005-04-16 15:20:36 -0700460 dp = args->dp;
Nathan Scottd8cc8902005-11-02 10:34:53 +1100461 mp = dp->i_mount;
462 dp->i_d.di_forkoff = forkoff;
Nathan Scottd8cc8902005-11-02 10:34:53 +1100463
Linus Torvalds1da177e2005-04-16 15:20:36 -0700464 ifp = dp->i_afp;
465 ASSERT(ifp->if_flags & XFS_IFINLINE);
466 sf = (xfs_attr_shortform_t *)ifp->if_u1.if_data;
467 sfe = &sf->list[0];
Nathan Scott3b244aa2006-03-17 17:29:25 +1100468 for (i = 0; i < sf->hdr.count; sfe = XFS_ATTR_SF_NEXTENTRY(sfe), i++) {
Nathan Scottd8cc8902005-11-02 10:34:53 +1100469#ifdef DEBUG
Linus Torvalds1da177e2005-04-16 15:20:36 -0700470 if (sfe->namelen != args->namelen)
471 continue;
472 if (memcmp(args->name, sfe->nameval, args->namelen) != 0)
473 continue;
Tim Shimmin726801b2006-09-28 11:01:37 +1000474 if (!xfs_attr_namesp_match(args->flags, sfe->flags))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700475 continue;
Nathan Scottd8cc8902005-11-02 10:34:53 +1100476 ASSERT(0);
477#endif
Linus Torvalds1da177e2005-04-16 15:20:36 -0700478 }
479
480 offset = (char *)sfe - (char *)sf;
481 size = XFS_ATTR_SF_ENTSIZE_BYNAME(args->namelen, args->valuelen);
482 xfs_idata_realloc(dp, size, XFS_ATTR_FORK);
483 sf = (xfs_attr_shortform_t *)ifp->if_u1.if_data;
484 sfe = (xfs_attr_sf_entry_t *)((char *)sf + offset);
485
486 sfe->namelen = args->namelen;
Nathan Scott3b244aa2006-03-17 17:29:25 +1100487 sfe->valuelen = args->valuelen;
Tim Shimmin726801b2006-09-28 11:01:37 +1000488 sfe->flags = XFS_ATTR_NSP_ARGS_TO_ONDISK(args->flags);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700489 memcpy(sfe->nameval, args->name, args->namelen);
490 memcpy(&sfe->nameval[args->namelen], args->value, args->valuelen);
Nathan Scott3b244aa2006-03-17 17:29:25 +1100491 sf->hdr.count++;
Marcin Slusarz413d57c2008-02-13 15:03:29 -0800492 be16_add_cpu(&sf->hdr.totsize, size);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700493 xfs_trans_log_inode(args->trans, dp, XFS_ILOG_CORE | XFS_ILOG_ADATA);
494
Nathan Scottd8cc8902005-11-02 10:34:53 +1100495 xfs_sbversion_add_attr2(mp, args->trans);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700496}
497
498/*
Christoph Hellwige1486de2009-02-04 09:36:00 +0100499 * After the last attribute is removed revert to original inode format,
500 * making all literal area available to the data fork once more.
501 */
502STATIC void
503xfs_attr_fork_reset(
504 struct xfs_inode *ip,
505 struct xfs_trans *tp)
506{
507 xfs_idestroy_fork(ip, XFS_ATTR_FORK);
508 ip->i_d.di_forkoff = 0;
509 ip->i_d.di_aformat = XFS_DINODE_FMT_EXTENTS;
510
511 ASSERT(ip->i_d.di_anextents == 0);
512 ASSERT(ip->i_afp == NULL);
513
Christoph Hellwige1486de2009-02-04 09:36:00 +0100514 xfs_trans_log_inode(tp, ip, XFS_ILOG_CORE);
515}
516
517/*
Nathan Scottd8cc8902005-11-02 10:34:53 +1100518 * Remove an attribute from the shortform attribute list structure.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700519 */
520int
521xfs_attr_shortform_remove(xfs_da_args_t *args)
522{
523 xfs_attr_shortform_t *sf;
524 xfs_attr_sf_entry_t *sfe;
525 int base, size=0, end, totsize, i;
Nathan Scottd8cc8902005-11-02 10:34:53 +1100526 xfs_mount_t *mp;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700527 xfs_inode_t *dp;
528
Dave Chinner5a5881c2012-03-22 05:15:13 +0000529 trace_xfs_attr_sf_remove(args);
530
Linus Torvalds1da177e2005-04-16 15:20:36 -0700531 dp = args->dp;
Nathan Scottd8cc8902005-11-02 10:34:53 +1100532 mp = dp->i_mount;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700533 base = sizeof(xfs_attr_sf_hdr_t);
534 sf = (xfs_attr_shortform_t *)dp->i_afp->if_u1.if_data;
535 sfe = &sf->list[0];
Nathan Scott3b244aa2006-03-17 17:29:25 +1100536 end = sf->hdr.count;
Nathan Scottd8cc8902005-11-02 10:34:53 +1100537 for (i = 0; i < end; sfe = XFS_ATTR_SF_NEXTENTRY(sfe),
Linus Torvalds1da177e2005-04-16 15:20:36 -0700538 base += size, i++) {
539 size = XFS_ATTR_SF_ENTSIZE(sfe);
540 if (sfe->namelen != args->namelen)
541 continue;
542 if (memcmp(sfe->nameval, args->name, args->namelen) != 0)
543 continue;
Tim Shimmin726801b2006-09-28 11:01:37 +1000544 if (!xfs_attr_namesp_match(args->flags, sfe->flags))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700545 continue;
546 break;
547 }
Nathan Scottd8cc8902005-11-02 10:34:53 +1100548 if (i == end)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700549 return(XFS_ERROR(ENOATTR));
550
Nathan Scottd8cc8902005-11-02 10:34:53 +1100551 /*
552 * Fix up the attribute fork data, covering the hole
553 */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700554 end = base + size;
Nathan Scott3b244aa2006-03-17 17:29:25 +1100555 totsize = be16_to_cpu(sf->hdr.totsize);
Nathan Scottd8cc8902005-11-02 10:34:53 +1100556 if (end != totsize)
557 memmove(&((char *)sf)[base], &((char *)sf)[end], totsize - end);
Nathan Scott3b244aa2006-03-17 17:29:25 +1100558 sf->hdr.count--;
Marcin Slusarz413d57c2008-02-13 15:03:29 -0800559 be16_add_cpu(&sf->hdr.totsize, -size);
Nathan Scottd8cc8902005-11-02 10:34:53 +1100560
561 /*
562 * Fix up the start offset of the attribute fork
563 */
564 totsize -= size;
Barry Naujok6a178102008-05-21 16:42:05 +1000565 if (totsize == sizeof(xfs_attr_sf_hdr_t) &&
Christoph Hellwige1486de2009-02-04 09:36:00 +0100566 (mp->m_flags & XFS_MOUNT_ATTR2) &&
567 (dp->i_d.di_format != XFS_DINODE_FMT_BTREE) &&
568 !(args->op_flags & XFS_DA_OP_ADDNAME)) {
569 xfs_attr_fork_reset(dp, args->trans);
Nathan Scottd8cc8902005-11-02 10:34:53 +1100570 } else {
571 xfs_idata_realloc(dp, -size, XFS_ATTR_FORK);
572 dp->i_d.di_forkoff = xfs_attr_shortform_bytesfit(dp, totsize);
573 ASSERT(dp->i_d.di_forkoff);
Barry Naujok6a178102008-05-21 16:42:05 +1000574 ASSERT(totsize > sizeof(xfs_attr_sf_hdr_t) ||
575 (args->op_flags & XFS_DA_OP_ADDNAME) ||
576 !(mp->m_flags & XFS_MOUNT_ATTR2) ||
577 dp->i_d.di_format == XFS_DINODE_FMT_BTREE);
Nathan Scottd8cc8902005-11-02 10:34:53 +1100578 xfs_trans_log_inode(args->trans, dp,
579 XFS_ILOG_CORE | XFS_ILOG_ADATA);
580 }
581
582 xfs_sbversion_add_attr2(mp, args->trans);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700583
584 return(0);
585}
586
587/*
588 * Look up a name in a shortform attribute list structure.
589 */
590/*ARGSUSED*/
591int
592xfs_attr_shortform_lookup(xfs_da_args_t *args)
593{
594 xfs_attr_shortform_t *sf;
595 xfs_attr_sf_entry_t *sfe;
596 int i;
597 xfs_ifork_t *ifp;
598
Dave Chinner5a5881c2012-03-22 05:15:13 +0000599 trace_xfs_attr_sf_lookup(args);
600
Linus Torvalds1da177e2005-04-16 15:20:36 -0700601 ifp = args->dp->i_afp;
602 ASSERT(ifp->if_flags & XFS_IFINLINE);
603 sf = (xfs_attr_shortform_t *)ifp->if_u1.if_data;
604 sfe = &sf->list[0];
Nathan Scott3b244aa2006-03-17 17:29:25 +1100605 for (i = 0; i < sf->hdr.count;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700606 sfe = XFS_ATTR_SF_NEXTENTRY(sfe), i++) {
607 if (sfe->namelen != args->namelen)
608 continue;
609 if (memcmp(args->name, sfe->nameval, args->namelen) != 0)
610 continue;
Tim Shimmin726801b2006-09-28 11:01:37 +1000611 if (!xfs_attr_namesp_match(args->flags, sfe->flags))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700612 continue;
613 return(XFS_ERROR(EEXIST));
614 }
615 return(XFS_ERROR(ENOATTR));
616}
617
618/*
619 * Look up a name in a shortform attribute list structure.
620 */
621/*ARGSUSED*/
622int
623xfs_attr_shortform_getvalue(xfs_da_args_t *args)
624{
625 xfs_attr_shortform_t *sf;
626 xfs_attr_sf_entry_t *sfe;
627 int i;
628
Eric Sandeen914ed442012-03-30 11:24:11 -0500629 ASSERT(args->dp->i_afp->if_flags == XFS_IFINLINE);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700630 sf = (xfs_attr_shortform_t *)args->dp->i_afp->if_u1.if_data;
631 sfe = &sf->list[0];
Nathan Scott3b244aa2006-03-17 17:29:25 +1100632 for (i = 0; i < sf->hdr.count;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700633 sfe = XFS_ATTR_SF_NEXTENTRY(sfe), i++) {
634 if (sfe->namelen != args->namelen)
635 continue;
636 if (memcmp(args->name, sfe->nameval, args->namelen) != 0)
637 continue;
Tim Shimmin726801b2006-09-28 11:01:37 +1000638 if (!xfs_attr_namesp_match(args->flags, sfe->flags))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700639 continue;
640 if (args->flags & ATTR_KERNOVAL) {
Nathan Scott3b244aa2006-03-17 17:29:25 +1100641 args->valuelen = sfe->valuelen;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700642 return(XFS_ERROR(EEXIST));
643 }
Nathan Scott3b244aa2006-03-17 17:29:25 +1100644 if (args->valuelen < sfe->valuelen) {
645 args->valuelen = sfe->valuelen;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700646 return(XFS_ERROR(ERANGE));
647 }
Nathan Scott3b244aa2006-03-17 17:29:25 +1100648 args->valuelen = sfe->valuelen;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700649 memcpy(args->value, &sfe->nameval[args->namelen],
650 args->valuelen);
651 return(XFS_ERROR(EEXIST));
652 }
653 return(XFS_ERROR(ENOATTR));
654}
655
656/*
657 * Convert from using the shortform to the leaf.
658 */
659int
660xfs_attr_shortform_to_leaf(xfs_da_args_t *args)
661{
662 xfs_inode_t *dp;
663 xfs_attr_shortform_t *sf;
664 xfs_attr_sf_entry_t *sfe;
665 xfs_da_args_t nargs;
666 char *tmpbuffer;
667 int error, i, size;
668 xfs_dablk_t blkno;
Dave Chinner1d9025e2012-06-22 18:50:14 +1000669 struct xfs_buf *bp;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700670 xfs_ifork_t *ifp;
671
Dave Chinner5a5881c2012-03-22 05:15:13 +0000672 trace_xfs_attr_sf_to_leaf(args);
673
Linus Torvalds1da177e2005-04-16 15:20:36 -0700674 dp = args->dp;
675 ifp = dp->i_afp;
676 sf = (xfs_attr_shortform_t *)ifp->if_u1.if_data;
Nathan Scott3b244aa2006-03-17 17:29:25 +1100677 size = be16_to_cpu(sf->hdr.totsize);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700678 tmpbuffer = kmem_alloc(size, KM_SLEEP);
679 ASSERT(tmpbuffer != NULL);
680 memcpy(tmpbuffer, ifp->if_u1.if_data, size);
681 sf = (xfs_attr_shortform_t *)tmpbuffer;
682
683 xfs_idata_realloc(dp, -size, XFS_ATTR_FORK);
Dave Chinnerf3508bc2013-07-10 07:04:00 +1000684 xfs_bmap_local_to_extents_empty(dp, XFS_ATTR_FORK);
685
Linus Torvalds1da177e2005-04-16 15:20:36 -0700686 bp = NULL;
687 error = xfs_da_grow_inode(args, &blkno);
688 if (error) {
689 /*
690 * If we hit an IO error middle of the transaction inside
691 * grow_inode(), we may have inconsistent data. Bail out.
692 */
693 if (error == EIO)
694 goto out;
695 xfs_idata_realloc(dp, size, XFS_ATTR_FORK); /* try to put */
696 memcpy(ifp->if_u1.if_data, tmpbuffer, size); /* it back */
697 goto out;
698 }
699
700 ASSERT(blkno == 0);
Dave Chinner517c2222013-04-24 18:58:55 +1000701 error = xfs_attr3_leaf_create(args, blkno, &bp);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700702 if (error) {
703 error = xfs_da_shrink_inode(args, 0, bp);
704 bp = NULL;
705 if (error)
706 goto out;
707 xfs_idata_realloc(dp, size, XFS_ATTR_FORK); /* try to put */
708 memcpy(ifp->if_u1.if_data, tmpbuffer, size); /* it back */
709 goto out;
710 }
711
712 memset((char *)&nargs, 0, sizeof(nargs));
713 nargs.dp = dp;
714 nargs.firstblock = args->firstblock;
715 nargs.flist = args->flist;
716 nargs.total = args->total;
717 nargs.whichfork = XFS_ATTR_FORK;
718 nargs.trans = args->trans;
Barry Naujok6a178102008-05-21 16:42:05 +1000719 nargs.op_flags = XFS_DA_OP_OKNOENT;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700720
721 sfe = &sf->list[0];
Nathan Scott3b244aa2006-03-17 17:29:25 +1100722 for (i = 0; i < sf->hdr.count; i++) {
Dave Chinnera9273ca2010-01-20 10:47:48 +1100723 nargs.name = sfe->nameval;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700724 nargs.namelen = sfe->namelen;
Dave Chinnera9273ca2010-01-20 10:47:48 +1100725 nargs.value = &sfe->nameval[nargs.namelen];
Nathan Scott3b244aa2006-03-17 17:29:25 +1100726 nargs.valuelen = sfe->valuelen;
Dave Chinnera9273ca2010-01-20 10:47:48 +1100727 nargs.hashval = xfs_da_hashname(sfe->nameval,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700728 sfe->namelen);
Tim Shimmin726801b2006-09-28 11:01:37 +1000729 nargs.flags = XFS_ATTR_NSP_ONDISK_TO_ARGS(sfe->flags);
Dave Chinner517c2222013-04-24 18:58:55 +1000730 error = xfs_attr3_leaf_lookup_int(bp, &nargs); /* set a->index */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700731 ASSERT(error == ENOATTR);
Dave Chinner517c2222013-04-24 18:58:55 +1000732 error = xfs_attr3_leaf_add(bp, &nargs);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700733 ASSERT(error != ENOSPC);
734 if (error)
735 goto out;
736 sfe = XFS_ATTR_SF_NEXTENTRY(sfe);
737 }
738 error = 0;
739
740out:
Denys Vlasenkof0e2d932008-05-19 16:31:57 +1000741 kmem_free(tmpbuffer);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700742 return(error);
743}
744
Linus Torvalds1da177e2005-04-16 15:20:36 -0700745/*
746 * Check a leaf attribute block to see if all the entries would fit into
747 * a shortform attribute list.
748 */
749int
Dave Chinner1d9025e2012-06-22 18:50:14 +1000750xfs_attr_shortform_allfit(
Dave Chinnerb38958d2013-05-20 09:51:14 +1000751 struct xfs_buf *bp,
752 struct xfs_inode *dp)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700753{
Dave Chinnerb38958d2013-05-20 09:51:14 +1000754 struct xfs_attr_leafblock *leaf;
755 struct xfs_attr_leaf_entry *entry;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700756 xfs_attr_leaf_name_local_t *name_loc;
Dave Chinnerb38958d2013-05-20 09:51:14 +1000757 struct xfs_attr3_icleaf_hdr leafhdr;
758 int bytes;
759 int i;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700760
Dave Chinner1d9025e2012-06-22 18:50:14 +1000761 leaf = bp->b_addr;
Dave Chinnerb38958d2013-05-20 09:51:14 +1000762 xfs_attr3_leaf_hdr_from_disk(&leafhdr, leaf);
763 entry = xfs_attr3_leaf_entryp(leaf);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700764
Linus Torvalds1da177e2005-04-16 15:20:36 -0700765 bytes = sizeof(struct xfs_attr_sf_hdr);
Dave Chinnerb38958d2013-05-20 09:51:14 +1000766 for (i = 0; i < leafhdr.count; entry++, i++) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700767 if (entry->flags & XFS_ATTR_INCOMPLETE)
768 continue; /* don't copy partial entries */
769 if (!(entry->flags & XFS_ATTR_LOCAL))
770 return(0);
Dave Chinner517c2222013-04-24 18:58:55 +1000771 name_loc = xfs_attr3_leaf_name_local(leaf, i);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700772 if (name_loc->namelen >= XFS_ATTR_SF_ENTSIZE_MAX)
773 return(0);
Nathan Scott053b5752006-03-17 17:29:09 +1100774 if (be16_to_cpu(name_loc->valuelen) >= XFS_ATTR_SF_ENTSIZE_MAX)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700775 return(0);
Dave Chinnerb38958d2013-05-20 09:51:14 +1000776 bytes += sizeof(struct xfs_attr_sf_entry) - 1
Linus Torvalds1da177e2005-04-16 15:20:36 -0700777 + name_loc->namelen
Nathan Scott053b5752006-03-17 17:29:09 +1100778 + be16_to_cpu(name_loc->valuelen);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700779 }
Nathan Scott13059ff2006-01-11 15:32:01 +1100780 if ((dp->i_mount->m_flags & XFS_MOUNT_ATTR2) &&
Barry Naujoke5889e92007-02-10 18:35:58 +1100781 (dp->i_d.di_format != XFS_DINODE_FMT_BTREE) &&
Nathan Scotte0144ca2005-11-25 16:42:22 +1100782 (bytes == sizeof(struct xfs_attr_sf_hdr)))
Dave Chinnerb38958d2013-05-20 09:51:14 +1000783 return -1;
784 return xfs_attr_shortform_bytesfit(dp, bytes);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700785}
786
787/*
788 * Convert a leaf attribute list to shortform attribute list
789 */
790int
Dave Chinner517c2222013-04-24 18:58:55 +1000791xfs_attr3_leaf_to_shortform(
792 struct xfs_buf *bp,
793 struct xfs_da_args *args,
794 int forkoff)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700795{
Dave Chinner517c2222013-04-24 18:58:55 +1000796 struct xfs_attr_leafblock *leaf;
797 struct xfs_attr3_icleaf_hdr ichdr;
798 struct xfs_attr_leaf_entry *entry;
799 struct xfs_attr_leaf_name_local *name_loc;
800 struct xfs_da_args nargs;
801 struct xfs_inode *dp = args->dp;
802 char *tmpbuffer;
803 int error;
804 int i;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700805
Dave Chinner5a5881c2012-03-22 05:15:13 +0000806 trace_xfs_attr_leaf_to_sf(args);
807
Linus Torvalds1da177e2005-04-16 15:20:36 -0700808 tmpbuffer = kmem_alloc(XFS_LBSIZE(dp->i_mount), KM_SLEEP);
Dave Chinner517c2222013-04-24 18:58:55 +1000809 if (!tmpbuffer)
810 return ENOMEM;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700811
Dave Chinner1d9025e2012-06-22 18:50:14 +1000812 memcpy(tmpbuffer, bp->b_addr, XFS_LBSIZE(dp->i_mount));
Dave Chinner517c2222013-04-24 18:58:55 +1000813
Linus Torvalds1da177e2005-04-16 15:20:36 -0700814 leaf = (xfs_attr_leafblock_t *)tmpbuffer;
Dave Chinner517c2222013-04-24 18:58:55 +1000815 xfs_attr3_leaf_hdr_from_disk(&ichdr, leaf);
816 entry = xfs_attr3_leaf_entryp(leaf);
817
818 /* XXX (dgc): buffer is about to be marked stale - why zero it? */
Dave Chinner1d9025e2012-06-22 18:50:14 +1000819 memset(bp->b_addr, 0, XFS_LBSIZE(dp->i_mount));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700820
821 /*
822 * Clean out the prior contents of the attribute list.
823 */
824 error = xfs_da_shrink_inode(args, 0, bp);
825 if (error)
826 goto out;
Nathan Scottd8cc8902005-11-02 10:34:53 +1100827
828 if (forkoff == -1) {
Nathan Scott13059ff2006-01-11 15:32:01 +1100829 ASSERT(dp->i_mount->m_flags & XFS_MOUNT_ATTR2);
Barry Naujoke5889e92007-02-10 18:35:58 +1100830 ASSERT(dp->i_d.di_format != XFS_DINODE_FMT_BTREE);
Christoph Hellwige1486de2009-02-04 09:36:00 +0100831 xfs_attr_fork_reset(dp, args->trans);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700832 goto out;
Nathan Scottd8cc8902005-11-02 10:34:53 +1100833 }
834
835 xfs_attr_shortform_create(args);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700836
837 /*
838 * Copy the attributes
839 */
840 memset((char *)&nargs, 0, sizeof(nargs));
841 nargs.dp = dp;
842 nargs.firstblock = args->firstblock;
843 nargs.flist = args->flist;
844 nargs.total = args->total;
845 nargs.whichfork = XFS_ATTR_FORK;
846 nargs.trans = args->trans;
Barry Naujok6a178102008-05-21 16:42:05 +1000847 nargs.op_flags = XFS_DA_OP_OKNOENT;
Dave Chinner517c2222013-04-24 18:58:55 +1000848
849 for (i = 0; i < ichdr.count; entry++, i++) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700850 if (entry->flags & XFS_ATTR_INCOMPLETE)
851 continue; /* don't copy partial entries */
852 if (!entry->nameidx)
853 continue;
854 ASSERT(entry->flags & XFS_ATTR_LOCAL);
Dave Chinner517c2222013-04-24 18:58:55 +1000855 name_loc = xfs_attr3_leaf_name_local(leaf, i);
Dave Chinnera9273ca2010-01-20 10:47:48 +1100856 nargs.name = name_loc->nameval;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700857 nargs.namelen = name_loc->namelen;
Dave Chinnera9273ca2010-01-20 10:47:48 +1100858 nargs.value = &name_loc->nameval[nargs.namelen];
Nathan Scott053b5752006-03-17 17:29:09 +1100859 nargs.valuelen = be16_to_cpu(name_loc->valuelen);
Nathan Scott6b19f2d2006-03-17 17:29:02 +1100860 nargs.hashval = be32_to_cpu(entry->hashval);
Tim Shimmin726801b2006-09-28 11:01:37 +1000861 nargs.flags = XFS_ATTR_NSP_ONDISK_TO_ARGS(entry->flags);
Nathan Scottd8cc8902005-11-02 10:34:53 +1100862 xfs_attr_shortform_add(&nargs, forkoff);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700863 }
864 error = 0;
865
866out:
Denys Vlasenkof0e2d932008-05-19 16:31:57 +1000867 kmem_free(tmpbuffer);
Dave Chinner517c2222013-04-24 18:58:55 +1000868 return error;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700869}
870
871/*
872 * Convert from using a single leaf to a root node and a leaf.
873 */
874int
Dave Chinner517c2222013-04-24 18:58:55 +1000875xfs_attr3_leaf_to_node(
876 struct xfs_da_args *args)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700877{
Dave Chinner517c2222013-04-24 18:58:55 +1000878 struct xfs_attr_leafblock *leaf;
879 struct xfs_attr3_icleaf_hdr icleafhdr;
880 struct xfs_attr_leaf_entry *entries;
Dave Chinnerf5ea1102013-04-24 18:58:02 +1000881 struct xfs_da_node_entry *btree;
Dave Chinner517c2222013-04-24 18:58:55 +1000882 struct xfs_da3_icnode_hdr icnodehdr;
883 struct xfs_da_intnode *node;
884 struct xfs_inode *dp = args->dp;
885 struct xfs_mount *mp = dp->i_mount;
886 struct xfs_buf *bp1 = NULL;
887 struct xfs_buf *bp2 = NULL;
888 xfs_dablk_t blkno;
889 int error;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700890
Dave Chinner5a5881c2012-03-22 05:15:13 +0000891 trace_xfs_attr_leaf_to_node(args);
892
Linus Torvalds1da177e2005-04-16 15:20:36 -0700893 error = xfs_da_grow_inode(args, &blkno);
894 if (error)
895 goto out;
Dave Chinner517c2222013-04-24 18:58:55 +1000896 error = xfs_attr3_leaf_read(args->trans, dp, 0, -1, &bp1);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700897 if (error)
898 goto out;
Dave Chinnerad14c332012-11-12 22:54:16 +1100899
Dave Chinner517c2222013-04-24 18:58:55 +1000900 error = xfs_da_get_buf(args->trans, dp, blkno, -1, &bp2, XFS_ATTR_FORK);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700901 if (error)
902 goto out;
Dave Chinner517c2222013-04-24 18:58:55 +1000903
904 /* copy leaf to new buffer, update identifiers */
Dave Chinner61fe1352013-04-03 16:11:30 +1100905 xfs_trans_buf_set_type(args->trans, bp2, XFS_BLFT_ATTR_LEAF_BUF);
Dave Chinner1813dd62012-11-14 17:54:40 +1100906 bp2->b_ops = bp1->b_ops;
Dave Chinner517c2222013-04-24 18:58:55 +1000907 memcpy(bp2->b_addr, bp1->b_addr, XFS_LBSIZE(mp));
908 if (xfs_sb_version_hascrc(&mp->m_sb)) {
909 struct xfs_da3_blkinfo *hdr3 = bp2->b_addr;
910 hdr3->blkno = cpu_to_be64(bp2->b_bn);
911 }
912 xfs_trans_log_buf(args->trans, bp2, 0, XFS_LBSIZE(mp) - 1);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700913
914 /*
915 * Set up the new root node.
916 */
Dave Chinnerf5ea1102013-04-24 18:58:02 +1000917 error = xfs_da3_node_create(args, 0, 1, &bp1, XFS_ATTR_FORK);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700918 if (error)
919 goto out;
Dave Chinner1d9025e2012-06-22 18:50:14 +1000920 node = bp1->b_addr;
Dave Chinner01ba43b2013-10-29 22:11:52 +1100921 dp->d_ops->node_hdr_from_disk(&icnodehdr, node);
Dave Chinner4bceb182013-10-29 22:11:51 +1100922 btree = dp->d_ops->node_tree_p(node);
Dave Chinner517c2222013-04-24 18:58:55 +1000923
924 leaf = bp2->b_addr;
925 xfs_attr3_leaf_hdr_from_disk(&icleafhdr, leaf);
926 entries = xfs_attr3_leaf_entryp(leaf);
927
928 /* both on-disk, don't endian-flip twice */
929 btree[0].hashval = entries[icleafhdr.count - 1].hashval;
Dave Chinnerf5ea1102013-04-24 18:58:02 +1000930 btree[0].before = cpu_to_be32(blkno);
Dave Chinner517c2222013-04-24 18:58:55 +1000931 icnodehdr.count = 1;
Dave Chinner01ba43b2013-10-29 22:11:52 +1100932 dp->d_ops->node_hdr_to_disk(node, &icnodehdr);
Dave Chinner517c2222013-04-24 18:58:55 +1000933 xfs_trans_log_buf(args->trans, bp1, 0, XFS_LBSIZE(mp) - 1);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700934 error = 0;
935out:
Dave Chinner517c2222013-04-24 18:58:55 +1000936 return error;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700937}
938
Linus Torvalds1da177e2005-04-16 15:20:36 -0700939/*========================================================================
940 * Routines used for growing the Btree.
941 *========================================================================*/
942
943/*
944 * Create the initial contents of a leaf attribute list
945 * or a leaf in a node attribute list.
946 */
Christoph Hellwigba0f32d2005-06-21 15:36:52 +1000947STATIC int
Dave Chinner517c2222013-04-24 18:58:55 +1000948xfs_attr3_leaf_create(
949 struct xfs_da_args *args,
950 xfs_dablk_t blkno,
951 struct xfs_buf **bpp)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700952{
Dave Chinner517c2222013-04-24 18:58:55 +1000953 struct xfs_attr_leafblock *leaf;
954 struct xfs_attr3_icleaf_hdr ichdr;
955 struct xfs_inode *dp = args->dp;
956 struct xfs_mount *mp = dp->i_mount;
957 struct xfs_buf *bp;
958 int error;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700959
Dave Chinner5a5881c2012-03-22 05:15:13 +0000960 trace_xfs_attr_leaf_create(args);
961
Linus Torvalds1da177e2005-04-16 15:20:36 -0700962 error = xfs_da_get_buf(args->trans, args->dp, blkno, -1, &bp,
963 XFS_ATTR_FORK);
964 if (error)
Dave Chinner517c2222013-04-24 18:58:55 +1000965 return error;
966 bp->b_ops = &xfs_attr3_leaf_buf_ops;
Dave Chinner61fe1352013-04-03 16:11:30 +1100967 xfs_trans_buf_set_type(args->trans, bp, XFS_BLFT_ATTR_LEAF_BUF);
Dave Chinner1d9025e2012-06-22 18:50:14 +1000968 leaf = bp->b_addr;
Dave Chinner517c2222013-04-24 18:58:55 +1000969 memset(leaf, 0, XFS_LBSIZE(mp));
970
971 memset(&ichdr, 0, sizeof(ichdr));
972 ichdr.firstused = XFS_LBSIZE(mp);
973
974 if (xfs_sb_version_hascrc(&mp->m_sb)) {
975 struct xfs_da3_blkinfo *hdr3 = bp->b_addr;
976
977 ichdr.magic = XFS_ATTR3_LEAF_MAGIC;
978
979 hdr3->blkno = cpu_to_be64(bp->b_bn);
980 hdr3->owner = cpu_to_be64(dp->i_ino);
981 uuid_copy(&hdr3->uuid, &mp->m_sb.sb_uuid);
982
983 ichdr.freemap[0].base = sizeof(struct xfs_attr3_leaf_hdr);
984 } else {
985 ichdr.magic = XFS_ATTR_LEAF_MAGIC;
986 ichdr.freemap[0].base = sizeof(struct xfs_attr_leaf_hdr);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700987 }
Dave Chinner517c2222013-04-24 18:58:55 +1000988 ichdr.freemap[0].size = ichdr.firstused - ichdr.freemap[0].base;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700989
Dave Chinner517c2222013-04-24 18:58:55 +1000990 xfs_attr3_leaf_hdr_to_disk(leaf, &ichdr);
991 xfs_trans_log_buf(args->trans, bp, 0, XFS_LBSIZE(mp) - 1);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700992
993 *bpp = bp;
Dave Chinner517c2222013-04-24 18:58:55 +1000994 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700995}
996
997/*
998 * Split the leaf node, rebalance, then add the new entry.
999 */
1000int
Dave Chinner517c2222013-04-24 18:58:55 +10001001xfs_attr3_leaf_split(
1002 struct xfs_da_state *state,
1003 struct xfs_da_state_blk *oldblk,
1004 struct xfs_da_state_blk *newblk)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001005{
1006 xfs_dablk_t blkno;
1007 int error;
1008
Dave Chinner5a5881c2012-03-22 05:15:13 +00001009 trace_xfs_attr_leaf_split(state->args);
1010
Linus Torvalds1da177e2005-04-16 15:20:36 -07001011 /*
1012 * Allocate space for a new leaf node.
1013 */
1014 ASSERT(oldblk->magic == XFS_ATTR_LEAF_MAGIC);
1015 error = xfs_da_grow_inode(state->args, &blkno);
1016 if (error)
1017 return(error);
Dave Chinner517c2222013-04-24 18:58:55 +10001018 error = xfs_attr3_leaf_create(state->args, blkno, &newblk->bp);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001019 if (error)
1020 return(error);
1021 newblk->blkno = blkno;
1022 newblk->magic = XFS_ATTR_LEAF_MAGIC;
1023
1024 /*
1025 * Rebalance the entries across the two leaves.
1026 * NOTE: rebalance() currently depends on the 2nd block being empty.
1027 */
Dave Chinner517c2222013-04-24 18:58:55 +10001028 xfs_attr3_leaf_rebalance(state, oldblk, newblk);
Dave Chinnerf5ea1102013-04-24 18:58:02 +10001029 error = xfs_da3_blk_link(state, oldblk, newblk);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001030 if (error)
1031 return(error);
1032
1033 /*
1034 * Save info on "old" attribute for "atomic rename" ops, leaf_add()
1035 * modifies the index/blkno/rmtblk/rmtblkcnt fields to show the
1036 * "new" attrs info. Will need the "old" info to remove it later.
1037 *
1038 * Insert the "new" entry in the correct block.
1039 */
Dave Chinner5a5881c2012-03-22 05:15:13 +00001040 if (state->inleaf) {
1041 trace_xfs_attr_leaf_add_old(state->args);
Dave Chinner517c2222013-04-24 18:58:55 +10001042 error = xfs_attr3_leaf_add(oldblk->bp, state->args);
Dave Chinner5a5881c2012-03-22 05:15:13 +00001043 } else {
1044 trace_xfs_attr_leaf_add_new(state->args);
Dave Chinner517c2222013-04-24 18:58:55 +10001045 error = xfs_attr3_leaf_add(newblk->bp, state->args);
Dave Chinner5a5881c2012-03-22 05:15:13 +00001046 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07001047
1048 /*
1049 * Update last hashval in each block since we added the name.
1050 */
1051 oldblk->hashval = xfs_attr_leaf_lasthash(oldblk->bp, NULL);
1052 newblk->hashval = xfs_attr_leaf_lasthash(newblk->bp, NULL);
1053 return(error);
1054}
1055
1056/*
1057 * Add a name to the leaf attribute list structure.
1058 */
1059int
Dave Chinner517c2222013-04-24 18:58:55 +10001060xfs_attr3_leaf_add(
Dave Chinner1d9025e2012-06-22 18:50:14 +10001061 struct xfs_buf *bp,
1062 struct xfs_da_args *args)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001063{
Dave Chinner517c2222013-04-24 18:58:55 +10001064 struct xfs_attr_leafblock *leaf;
1065 struct xfs_attr3_icleaf_hdr ichdr;
1066 int tablesize;
1067 int entsize;
1068 int sum;
1069 int tmp;
1070 int i;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001071
Dave Chinner5a5881c2012-03-22 05:15:13 +00001072 trace_xfs_attr_leaf_add(args);
1073
Dave Chinner1d9025e2012-06-22 18:50:14 +10001074 leaf = bp->b_addr;
Dave Chinner517c2222013-04-24 18:58:55 +10001075 xfs_attr3_leaf_hdr_from_disk(&ichdr, leaf);
1076 ASSERT(args->index >= 0 && args->index <= ichdr.count);
Nathan Scottaa82daa2005-11-02 10:33:33 +11001077 entsize = xfs_attr_leaf_newentsize(args->namelen, args->valuelen,
Linus Torvalds1da177e2005-04-16 15:20:36 -07001078 args->trans->t_mountp->m_sb.sb_blocksize, NULL);
1079
1080 /*
1081 * Search through freemap for first-fit on new name length.
1082 * (may need to figure in size of entry struct too)
1083 */
Dave Chinner517c2222013-04-24 18:58:55 +10001084 tablesize = (ichdr.count + 1) * sizeof(xfs_attr_leaf_entry_t)
1085 + xfs_attr3_leaf_hdr_size(leaf);
1086 for (sum = 0, i = XFS_ATTR_LEAF_MAPSIZE - 1; i >= 0; i--) {
1087 if (tablesize > ichdr.firstused) {
1088 sum += ichdr.freemap[i].size;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001089 continue;
1090 }
Dave Chinner517c2222013-04-24 18:58:55 +10001091 if (!ichdr.freemap[i].size)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001092 continue; /* no space in this map */
1093 tmp = entsize;
Dave Chinner517c2222013-04-24 18:58:55 +10001094 if (ichdr.freemap[i].base < ichdr.firstused)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001095 tmp += sizeof(xfs_attr_leaf_entry_t);
Dave Chinner517c2222013-04-24 18:58:55 +10001096 if (ichdr.freemap[i].size >= tmp) {
1097 tmp = xfs_attr3_leaf_add_work(bp, &ichdr, args, i);
1098 goto out_log_hdr;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001099 }
Dave Chinner517c2222013-04-24 18:58:55 +10001100 sum += ichdr.freemap[i].size;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001101 }
1102
1103 /*
1104 * If there are no holes in the address space of the block,
1105 * and we don't have enough freespace, then compaction will do us
1106 * no good and we should just give up.
1107 */
Dave Chinner517c2222013-04-24 18:58:55 +10001108 if (!ichdr.holes && sum < entsize)
1109 return XFS_ERROR(ENOSPC);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001110
1111 /*
1112 * Compact the entries to coalesce free space.
1113 * This may change the hdr->count via dropping INCOMPLETE entries.
1114 */
Dave Chinner517c2222013-04-24 18:58:55 +10001115 xfs_attr3_leaf_compact(args, &ichdr, bp);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001116
1117 /*
1118 * After compaction, the block is guaranteed to have only one
1119 * free region, in freemap[0]. If it is not big enough, give up.
1120 */
Dave Chinner517c2222013-04-24 18:58:55 +10001121 if (ichdr.freemap[0].size < (entsize + sizeof(xfs_attr_leaf_entry_t))) {
1122 tmp = ENOSPC;
1123 goto out_log_hdr;
1124 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07001125
Dave Chinner517c2222013-04-24 18:58:55 +10001126 tmp = xfs_attr3_leaf_add_work(bp, &ichdr, args, 0);
1127
1128out_log_hdr:
1129 xfs_attr3_leaf_hdr_to_disk(leaf, &ichdr);
1130 xfs_trans_log_buf(args->trans, bp,
1131 XFS_DA_LOGRANGE(leaf, &leaf->hdr,
1132 xfs_attr3_leaf_hdr_size(leaf)));
1133 return tmp;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001134}
1135
1136/*
1137 * Add a name to a leaf attribute list structure.
1138 */
1139STATIC int
Dave Chinner517c2222013-04-24 18:58:55 +10001140xfs_attr3_leaf_add_work(
1141 struct xfs_buf *bp,
1142 struct xfs_attr3_icleaf_hdr *ichdr,
1143 struct xfs_da_args *args,
1144 int mapindex)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001145{
Dave Chinner517c2222013-04-24 18:58:55 +10001146 struct xfs_attr_leafblock *leaf;
1147 struct xfs_attr_leaf_entry *entry;
1148 struct xfs_attr_leaf_name_local *name_loc;
1149 struct xfs_attr_leaf_name_remote *name_rmt;
1150 struct xfs_mount *mp;
1151 int tmp;
1152 int i;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001153
Dave Chinneree732592012-11-12 22:53:53 +11001154 trace_xfs_attr_leaf_add_work(args);
1155
Dave Chinner1d9025e2012-06-22 18:50:14 +10001156 leaf = bp->b_addr;
Dave Chinner517c2222013-04-24 18:58:55 +10001157 ASSERT(mapindex >= 0 && mapindex < XFS_ATTR_LEAF_MAPSIZE);
1158 ASSERT(args->index >= 0 && args->index <= ichdr->count);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001159
1160 /*
1161 * Force open some space in the entry array and fill it in.
1162 */
Dave Chinner517c2222013-04-24 18:58:55 +10001163 entry = &xfs_attr3_leaf_entryp(leaf)[args->index];
1164 if (args->index < ichdr->count) {
1165 tmp = ichdr->count - args->index;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001166 tmp *= sizeof(xfs_attr_leaf_entry_t);
Dave Chinner517c2222013-04-24 18:58:55 +10001167 memmove(entry + 1, entry, tmp);
Dave Chinner1d9025e2012-06-22 18:50:14 +10001168 xfs_trans_log_buf(args->trans, bp,
Linus Torvalds1da177e2005-04-16 15:20:36 -07001169 XFS_DA_LOGRANGE(leaf, entry, tmp + sizeof(*entry)));
1170 }
Dave Chinner517c2222013-04-24 18:58:55 +10001171 ichdr->count++;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001172
1173 /*
1174 * Allocate space for the new string (at the end of the run).
1175 */
Linus Torvalds1da177e2005-04-16 15:20:36 -07001176 mp = args->trans->t_mountp;
Dave Chinner517c2222013-04-24 18:58:55 +10001177 ASSERT(ichdr->freemap[mapindex].base < XFS_LBSIZE(mp));
1178 ASSERT((ichdr->freemap[mapindex].base & 0x3) == 0);
1179 ASSERT(ichdr->freemap[mapindex].size >=
Nathan Scottaa82daa2005-11-02 10:33:33 +11001180 xfs_attr_leaf_newentsize(args->namelen, args->valuelen,
1181 mp->m_sb.sb_blocksize, NULL));
Dave Chinner517c2222013-04-24 18:58:55 +10001182 ASSERT(ichdr->freemap[mapindex].size < XFS_LBSIZE(mp));
1183 ASSERT((ichdr->freemap[mapindex].size & 0x3) == 0);
1184
1185 ichdr->freemap[mapindex].size -=
1186 xfs_attr_leaf_newentsize(args->namelen, args->valuelen,
1187 mp->m_sb.sb_blocksize, &tmp);
1188
1189 entry->nameidx = cpu_to_be16(ichdr->freemap[mapindex].base +
1190 ichdr->freemap[mapindex].size);
Nathan Scott6b19f2d2006-03-17 17:29:02 +11001191 entry->hashval = cpu_to_be32(args->hashval);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001192 entry->flags = tmp ? XFS_ATTR_LOCAL : 0;
Tim Shimmin726801b2006-09-28 11:01:37 +10001193 entry->flags |= XFS_ATTR_NSP_ARGS_TO_ONDISK(args->flags);
Barry Naujok6a178102008-05-21 16:42:05 +10001194 if (args->op_flags & XFS_DA_OP_RENAME) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07001195 entry->flags |= XFS_ATTR_INCOMPLETE;
1196 if ((args->blkno2 == args->blkno) &&
1197 (args->index2 <= args->index)) {
1198 args->index2++;
1199 }
1200 }
Dave Chinner1d9025e2012-06-22 18:50:14 +10001201 xfs_trans_log_buf(args->trans, bp,
Linus Torvalds1da177e2005-04-16 15:20:36 -07001202 XFS_DA_LOGRANGE(leaf, entry, sizeof(*entry)));
Nathan Scott6b19f2d2006-03-17 17:29:02 +11001203 ASSERT((args->index == 0) ||
1204 (be32_to_cpu(entry->hashval) >= be32_to_cpu((entry-1)->hashval)));
Dave Chinner517c2222013-04-24 18:58:55 +10001205 ASSERT((args->index == ichdr->count - 1) ||
Nathan Scott6b19f2d2006-03-17 17:29:02 +11001206 (be32_to_cpu(entry->hashval) <= be32_to_cpu((entry+1)->hashval)));
Linus Torvalds1da177e2005-04-16 15:20:36 -07001207
1208 /*
Linus Torvalds1da177e2005-04-16 15:20:36 -07001209 * For "remote" attribute values, simply note that we need to
1210 * allocate space for the "remote" value. We can't actually
1211 * allocate the extents in this transaction, and we can't decide
1212 * which blocks they should be as we might allocate more blocks
1213 * as part of this transaction (a split operation for example).
1214 */
1215 if (entry->flags & XFS_ATTR_LOCAL) {
Dave Chinner517c2222013-04-24 18:58:55 +10001216 name_loc = xfs_attr3_leaf_name_local(leaf, args->index);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001217 name_loc->namelen = args->namelen;
Nathan Scott053b5752006-03-17 17:29:09 +11001218 name_loc->valuelen = cpu_to_be16(args->valuelen);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001219 memcpy((char *)name_loc->nameval, args->name, args->namelen);
1220 memcpy((char *)&name_loc->nameval[args->namelen], args->value,
Nathan Scott053b5752006-03-17 17:29:09 +11001221 be16_to_cpu(name_loc->valuelen));
Linus Torvalds1da177e2005-04-16 15:20:36 -07001222 } else {
Dave Chinner517c2222013-04-24 18:58:55 +10001223 name_rmt = xfs_attr3_leaf_name_remote(leaf, args->index);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001224 name_rmt->namelen = args->namelen;
1225 memcpy((char *)name_rmt->name, args->name, args->namelen);
1226 entry->flags |= XFS_ATTR_INCOMPLETE;
1227 /* just in case */
1228 name_rmt->valuelen = 0;
1229 name_rmt->valueblk = 0;
1230 args->rmtblkno = 1;
Dave Chinnerad1858d2013-05-21 18:02:08 +10001231 args->rmtblkcnt = xfs_attr3_rmt_blocks(mp, 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;
1271 struct xfs_mount *mp = trans->t_mountp;
1272 char *tmpbuffer;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001273
Dave Chinneree732592012-11-12 22:53:53 +11001274 trace_xfs_attr_leaf_compact(args);
1275
Linus Torvalds1da177e2005-04-16 15:20:36 -07001276 tmpbuffer = kmem_alloc(XFS_LBSIZE(mp), KM_SLEEP);
Dave Chinner1d9025e2012-06-22 18:50:14 +10001277 memcpy(tmpbuffer, bp->b_addr, XFS_LBSIZE(mp));
1278 memset(bp->b_addr, 0, XFS_LBSIZE(mp));
Dave Chinnerd4c712b2013-05-21 18:02:06 +10001279 leaf_src = (xfs_attr_leafblock_t *)tmpbuffer;
1280 leaf_dst = bp->b_addr;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001281
1282 /*
Dave Chinnerd4c712b2013-05-21 18:02:06 +10001283 * Copy the on-disk header back into the destination buffer to ensure
1284 * all the information in the header that is not part of the incore
1285 * header structure is preserved.
Linus Torvalds1da177e2005-04-16 15:20:36 -07001286 */
Dave Chinnerd4c712b2013-05-21 18:02:06 +10001287 memcpy(bp->b_addr, tmpbuffer, xfs_attr3_leaf_hdr_size(leaf_src));
1288
1289 /* Initialise the incore headers */
1290 ichdr_src = *ichdr_dst; /* struct copy */
1291 ichdr_dst->firstused = XFS_LBSIZE(mp);
1292 ichdr_dst->usedbytes = 0;
1293 ichdr_dst->count = 0;
1294 ichdr_dst->holes = 0;
1295 ichdr_dst->freemap[0].base = xfs_attr3_leaf_hdr_size(leaf_src);
1296 ichdr_dst->freemap[0].size = ichdr_dst->firstused -
1297 ichdr_dst->freemap[0].base;
1298
Dave Chinnerd4c712b2013-05-21 18:02:06 +10001299 /* write the header back to initialise the underlying buffer */
1300 xfs_attr3_leaf_hdr_to_disk(leaf_dst, ichdr_dst);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001301
1302 /*
1303 * Copy all entry's in the same (sorted) order,
1304 * but allocate name/value pairs packed and in sequence.
1305 */
Dave Chinnerd4c712b2013-05-21 18:02:06 +10001306 xfs_attr3_leaf_moveents(leaf_src, &ichdr_src, 0, leaf_dst, ichdr_dst, 0,
1307 ichdr_src.count, mp);
Dave Chinner517c2222013-04-24 18:58:55 +10001308 /*
1309 * this logs the entire buffer, but the caller must write the header
1310 * back to the buffer when it is finished modifying it.
1311 */
Dave Chinner1d9025e2012-06-22 18:50:14 +10001312 xfs_trans_log_buf(trans, bp, 0, XFS_LBSIZE(mp) - 1);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001313
Denys Vlasenkof0e2d932008-05-19 16:31:57 +10001314 kmem_free(tmpbuffer);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001315}
1316
1317/*
Dave Chinner517c2222013-04-24 18:58:55 +10001318 * Compare two leaf blocks "order".
1319 * Return 0 unless leaf2 should go before leaf1.
1320 */
1321static int
1322xfs_attr3_leaf_order(
1323 struct xfs_buf *leaf1_bp,
1324 struct xfs_attr3_icleaf_hdr *leaf1hdr,
1325 struct xfs_buf *leaf2_bp,
1326 struct xfs_attr3_icleaf_hdr *leaf2hdr)
1327{
1328 struct xfs_attr_leaf_entry *entries1;
1329 struct xfs_attr_leaf_entry *entries2;
1330
1331 entries1 = xfs_attr3_leaf_entryp(leaf1_bp->b_addr);
1332 entries2 = xfs_attr3_leaf_entryp(leaf2_bp->b_addr);
1333 if (leaf1hdr->count > 0 && leaf2hdr->count > 0 &&
1334 ((be32_to_cpu(entries2[0].hashval) <
1335 be32_to_cpu(entries1[0].hashval)) ||
1336 (be32_to_cpu(entries2[leaf2hdr->count - 1].hashval) <
1337 be32_to_cpu(entries1[leaf1hdr->count - 1].hashval)))) {
1338 return 1;
1339 }
1340 return 0;
1341}
1342
1343int
1344xfs_attr_leaf_order(
1345 struct xfs_buf *leaf1_bp,
1346 struct xfs_buf *leaf2_bp)
1347{
1348 struct xfs_attr3_icleaf_hdr ichdr1;
1349 struct xfs_attr3_icleaf_hdr ichdr2;
1350
1351 xfs_attr3_leaf_hdr_from_disk(&ichdr1, leaf1_bp->b_addr);
1352 xfs_attr3_leaf_hdr_from_disk(&ichdr2, leaf2_bp->b_addr);
1353 return xfs_attr3_leaf_order(leaf1_bp, &ichdr1, leaf2_bp, &ichdr2);
1354}
1355
1356/*
Linus Torvalds1da177e2005-04-16 15:20:36 -07001357 * Redistribute the attribute list entries between two leaf nodes,
1358 * taking into account the size of the new entry.
1359 *
1360 * NOTE: if new block is empty, then it will get the upper half of the
1361 * old block. At present, all (one) callers pass in an empty second block.
1362 *
1363 * This code adjusts the args->index/blkno and args->index2/blkno2 fields
1364 * to match what it is doing in splitting the attribute leaf block. Those
1365 * values are used in "atomic rename" operations on attributes. Note that
1366 * the "new" and "old" values can end up in different blocks.
1367 */
1368STATIC void
Dave Chinner517c2222013-04-24 18:58:55 +10001369xfs_attr3_leaf_rebalance(
1370 struct xfs_da_state *state,
1371 struct xfs_da_state_blk *blk1,
1372 struct xfs_da_state_blk *blk2)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001373{
Dave Chinner517c2222013-04-24 18:58:55 +10001374 struct xfs_da_args *args;
1375 struct xfs_attr_leafblock *leaf1;
1376 struct xfs_attr_leafblock *leaf2;
1377 struct xfs_attr3_icleaf_hdr ichdr1;
1378 struct xfs_attr3_icleaf_hdr ichdr2;
1379 struct xfs_attr_leaf_entry *entries1;
1380 struct xfs_attr_leaf_entry *entries2;
1381 int count;
1382 int totallen;
1383 int max;
1384 int space;
1385 int swap;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001386
1387 /*
1388 * Set up environment.
1389 */
1390 ASSERT(blk1->magic == XFS_ATTR_LEAF_MAGIC);
1391 ASSERT(blk2->magic == XFS_ATTR_LEAF_MAGIC);
Dave Chinner1d9025e2012-06-22 18:50:14 +10001392 leaf1 = blk1->bp->b_addr;
1393 leaf2 = blk2->bp->b_addr;
Dave Chinner517c2222013-04-24 18:58:55 +10001394 xfs_attr3_leaf_hdr_from_disk(&ichdr1, leaf1);
1395 xfs_attr3_leaf_hdr_from_disk(&ichdr2, leaf2);
1396 ASSERT(ichdr2.count == 0);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001397 args = state->args;
1398
Dave Chinner5a5881c2012-03-22 05:15:13 +00001399 trace_xfs_attr_leaf_rebalance(args);
1400
Linus Torvalds1da177e2005-04-16 15:20:36 -07001401 /*
1402 * Check ordering of blocks, reverse if it makes things simpler.
1403 *
1404 * NOTE: Given that all (current) callers pass in an empty
1405 * second block, this code should never set "swap".
1406 */
1407 swap = 0;
Dave Chinner517c2222013-04-24 18:58:55 +10001408 if (xfs_attr3_leaf_order(blk1->bp, &ichdr1, blk2->bp, &ichdr2)) {
1409 struct xfs_da_state_blk *tmp_blk;
1410 struct xfs_attr3_icleaf_hdr tmp_ichdr;
1411
Linus Torvalds1da177e2005-04-16 15:20:36 -07001412 tmp_blk = blk1;
1413 blk1 = blk2;
1414 blk2 = tmp_blk;
Dave Chinner517c2222013-04-24 18:58:55 +10001415
1416 /* struct copies to swap them rather than reconverting */
1417 tmp_ichdr = ichdr1;
1418 ichdr1 = ichdr2;
1419 ichdr2 = tmp_ichdr;
1420
Dave Chinner1d9025e2012-06-22 18:50:14 +10001421 leaf1 = blk1->bp->b_addr;
1422 leaf2 = blk2->bp->b_addr;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001423 swap = 1;
1424 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07001425
1426 /*
1427 * Examine entries until we reduce the absolute difference in
1428 * byte usage between the two blocks to a minimum. Then get
1429 * the direction to copy and the number of elements to move.
1430 *
1431 * "inleaf" is true if the new entry should be inserted into blk1.
1432 * If "swap" is also true, then reverse the sense of "inleaf".
1433 */
Dave Chinner517c2222013-04-24 18:58:55 +10001434 state->inleaf = xfs_attr3_leaf_figure_balance(state, blk1, &ichdr1,
1435 blk2, &ichdr2,
1436 &count, &totallen);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001437 if (swap)
1438 state->inleaf = !state->inleaf;
1439
1440 /*
1441 * Move any entries required from leaf to leaf:
1442 */
Dave Chinner517c2222013-04-24 18:58:55 +10001443 if (count < ichdr1.count) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07001444 /*
1445 * Figure the total bytes to be added to the destination leaf.
1446 */
1447 /* number entries being moved */
Dave Chinner517c2222013-04-24 18:58:55 +10001448 count = ichdr1.count - count;
1449 space = ichdr1.usedbytes - totallen;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001450 space += count * sizeof(xfs_attr_leaf_entry_t);
1451
1452 /*
1453 * leaf2 is the destination, compact it if it looks tight.
1454 */
Dave Chinner517c2222013-04-24 18:58:55 +10001455 max = ichdr2.firstused - xfs_attr3_leaf_hdr_size(leaf1);
1456 max -= ichdr2.count * sizeof(xfs_attr_leaf_entry_t);
Dave Chinneree732592012-11-12 22:53:53 +11001457 if (space > max)
Dave Chinner517c2222013-04-24 18:58:55 +10001458 xfs_attr3_leaf_compact(args, &ichdr2, blk2->bp);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001459
1460 /*
1461 * Move high entries from leaf1 to low end of leaf2.
1462 */
Dave Chinner517c2222013-04-24 18:58:55 +10001463 xfs_attr3_leaf_moveents(leaf1, &ichdr1, ichdr1.count - count,
1464 leaf2, &ichdr2, 0, count, state->mp);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001465
Dave Chinner517c2222013-04-24 18:58:55 +10001466 } else if (count > ichdr1.count) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07001467 /*
1468 * I assert that since all callers pass in an empty
1469 * second buffer, this code should never execute.
1470 */
Dave Chinner07428d72012-11-12 22:09:44 +11001471 ASSERT(0);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001472
1473 /*
1474 * Figure the total bytes to be added to the destination leaf.
1475 */
1476 /* number entries being moved */
Dave Chinner517c2222013-04-24 18:58:55 +10001477 count -= ichdr1.count;
1478 space = totallen - ichdr1.usedbytes;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001479 space += count * sizeof(xfs_attr_leaf_entry_t);
1480
1481 /*
1482 * leaf1 is the destination, compact it if it looks tight.
1483 */
Dave Chinner517c2222013-04-24 18:58:55 +10001484 max = ichdr1.firstused - xfs_attr3_leaf_hdr_size(leaf1);
1485 max -= ichdr1.count * sizeof(xfs_attr_leaf_entry_t);
Dave Chinneree732592012-11-12 22:53:53 +11001486 if (space > max)
Dave Chinner517c2222013-04-24 18:58:55 +10001487 xfs_attr3_leaf_compact(args, &ichdr1, blk1->bp);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001488
1489 /*
1490 * Move low entries from leaf2 to high end of leaf1.
1491 */
Dave Chinner517c2222013-04-24 18:58:55 +10001492 xfs_attr3_leaf_moveents(leaf2, &ichdr2, 0, leaf1, &ichdr1,
1493 ichdr1.count, count, state->mp);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001494 }
1495
Dave Chinner517c2222013-04-24 18:58:55 +10001496 xfs_attr3_leaf_hdr_to_disk(leaf1, &ichdr1);
1497 xfs_attr3_leaf_hdr_to_disk(leaf2, &ichdr2);
1498 xfs_trans_log_buf(args->trans, blk1->bp, 0, state->blocksize-1);
1499 xfs_trans_log_buf(args->trans, blk2->bp, 0, state->blocksize-1);
1500
Linus Torvalds1da177e2005-04-16 15:20:36 -07001501 /*
1502 * Copy out last hashval in each block for B-tree code.
1503 */
Dave Chinner517c2222013-04-24 18:58:55 +10001504 entries1 = xfs_attr3_leaf_entryp(leaf1);
1505 entries2 = xfs_attr3_leaf_entryp(leaf2);
1506 blk1->hashval = be32_to_cpu(entries1[ichdr1.count - 1].hashval);
1507 blk2->hashval = be32_to_cpu(entries2[ichdr2.count - 1].hashval);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001508
1509 /*
1510 * Adjust the expected index for insertion.
1511 * NOTE: this code depends on the (current) situation that the
1512 * second block was originally empty.
1513 *
1514 * If the insertion point moved to the 2nd block, we must adjust
1515 * the index. We must also track the entry just following the
1516 * new entry for use in an "atomic rename" operation, that entry
1517 * is always the "old" entry and the "new" entry is what we are
1518 * inserting. The index/blkno fields refer to the "old" entry,
1519 * while the index2/blkno2 fields refer to the "new" entry.
1520 */
Dave Chinner517c2222013-04-24 18:58:55 +10001521 if (blk1->index > ichdr1.count) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07001522 ASSERT(state->inleaf == 0);
Dave Chinner517c2222013-04-24 18:58:55 +10001523 blk2->index = blk1->index - ichdr1.count;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001524 args->index = args->index2 = blk2->index;
1525 args->blkno = args->blkno2 = blk2->blkno;
Dave Chinner517c2222013-04-24 18:58:55 +10001526 } else if (blk1->index == ichdr1.count) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07001527 if (state->inleaf) {
1528 args->index = blk1->index;
1529 args->blkno = blk1->blkno;
1530 args->index2 = 0;
1531 args->blkno2 = blk2->blkno;
1532 } else {
Dave Chinner07428d72012-11-12 22:09:44 +11001533 /*
1534 * On a double leaf split, the original attr location
1535 * is already stored in blkno2/index2, so don't
1536 * overwrite it overwise we corrupt the tree.
1537 */
Dave Chinner517c2222013-04-24 18:58:55 +10001538 blk2->index = blk1->index - ichdr1.count;
Dave Chinner07428d72012-11-12 22:09:44 +11001539 args->index = blk2->index;
1540 args->blkno = blk2->blkno;
1541 if (!state->extravalid) {
1542 /*
1543 * set the new attr location to match the old
1544 * one and let the higher level split code
1545 * decide where in the leaf to place it.
1546 */
1547 args->index2 = blk2->index;
1548 args->blkno2 = blk2->blkno;
1549 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07001550 }
1551 } else {
1552 ASSERT(state->inleaf == 1);
1553 args->index = args->index2 = blk1->index;
1554 args->blkno = args->blkno2 = blk1->blkno;
1555 }
1556}
1557
1558/*
1559 * Examine entries until we reduce the absolute difference in
1560 * byte usage between the two blocks to a minimum.
1561 * GROT: Is this really necessary? With other than a 512 byte blocksize,
1562 * GROT: there will always be enough room in either block for a new entry.
1563 * GROT: Do a double-split for this case?
1564 */
1565STATIC int
Dave Chinner517c2222013-04-24 18:58:55 +10001566xfs_attr3_leaf_figure_balance(
1567 struct xfs_da_state *state,
1568 struct xfs_da_state_blk *blk1,
1569 struct xfs_attr3_icleaf_hdr *ichdr1,
1570 struct xfs_da_state_blk *blk2,
1571 struct xfs_attr3_icleaf_hdr *ichdr2,
1572 int *countarg,
1573 int *usedbytesarg)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001574{
Dave Chinner517c2222013-04-24 18:58:55 +10001575 struct xfs_attr_leafblock *leaf1 = blk1->bp->b_addr;
1576 struct xfs_attr_leafblock *leaf2 = blk2->bp->b_addr;
1577 struct xfs_attr_leaf_entry *entry;
1578 int count;
1579 int max;
1580 int index;
1581 int totallen = 0;
1582 int half;
1583 int lastdelta;
1584 int foundit = 0;
1585 int tmp;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001586
1587 /*
1588 * Examine entries until we reduce the absolute difference in
1589 * byte usage between the two blocks to a minimum.
1590 */
Dave Chinner517c2222013-04-24 18:58:55 +10001591 max = ichdr1->count + ichdr2->count;
1592 half = (max + 1) * sizeof(*entry);
1593 half += ichdr1->usedbytes + ichdr2->usedbytes +
1594 xfs_attr_leaf_newentsize(state->args->namelen,
1595 state->args->valuelen,
1596 state->blocksize, NULL);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001597 half /= 2;
1598 lastdelta = state->blocksize;
Dave Chinner517c2222013-04-24 18:58:55 +10001599 entry = xfs_attr3_leaf_entryp(leaf1);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001600 for (count = index = 0; count < max; entry++, index++, count++) {
1601
1602#define XFS_ATTR_ABS(A) (((A) < 0) ? -(A) : (A))
1603 /*
1604 * The new entry is in the first block, account for it.
1605 */
1606 if (count == blk1->index) {
1607 tmp = totallen + sizeof(*entry) +
Nathan Scottaa82daa2005-11-02 10:33:33 +11001608 xfs_attr_leaf_newentsize(
1609 state->args->namelen,
1610 state->args->valuelen,
1611 state->blocksize, NULL);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001612 if (XFS_ATTR_ABS(half - tmp) > lastdelta)
1613 break;
1614 lastdelta = XFS_ATTR_ABS(half - tmp);
1615 totallen = tmp;
1616 foundit = 1;
1617 }
1618
1619 /*
1620 * Wrap around into the second block if necessary.
1621 */
Dave Chinner517c2222013-04-24 18:58:55 +10001622 if (count == ichdr1->count) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07001623 leaf1 = leaf2;
Dave Chinner517c2222013-04-24 18:58:55 +10001624 entry = xfs_attr3_leaf_entryp(leaf1);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001625 index = 0;
1626 }
1627
1628 /*
1629 * Figure out if next leaf entry would be too much.
1630 */
1631 tmp = totallen + sizeof(*entry) + xfs_attr_leaf_entsize(leaf1,
1632 index);
1633 if (XFS_ATTR_ABS(half - tmp) > lastdelta)
1634 break;
1635 lastdelta = XFS_ATTR_ABS(half - tmp);
1636 totallen = tmp;
1637#undef XFS_ATTR_ABS
1638 }
1639
1640 /*
1641 * Calculate the number of usedbytes that will end up in lower block.
1642 * If new entry not in lower block, fix up the count.
1643 */
1644 totallen -= count * sizeof(*entry);
1645 if (foundit) {
1646 totallen -= sizeof(*entry) +
Nathan Scottaa82daa2005-11-02 10:33:33 +11001647 xfs_attr_leaf_newentsize(
1648 state->args->namelen,
1649 state->args->valuelen,
1650 state->blocksize, NULL);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001651 }
1652
1653 *countarg = count;
1654 *usedbytesarg = totallen;
Dave Chinner517c2222013-04-24 18:58:55 +10001655 return foundit;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001656}
1657
1658/*========================================================================
1659 * Routines used for shrinking the Btree.
1660 *========================================================================*/
1661
1662/*
1663 * Check a leaf block and its neighbors to see if the block should be
1664 * collapsed into one or the other neighbor. Always keep the block
1665 * with the smaller block number.
1666 * If the current block is over 50% full, don't try to join it, return 0.
1667 * If the block is empty, fill in the state structure and return 2.
1668 * If it can be collapsed, fill in the state structure and return 1.
1669 * If nothing can be done, return 0.
1670 *
1671 * GROT: allow for INCOMPLETE entries in calculation.
1672 */
1673int
Dave Chinner517c2222013-04-24 18:58:55 +10001674xfs_attr3_leaf_toosmall(
1675 struct xfs_da_state *state,
1676 int *action)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001677{
Dave Chinner517c2222013-04-24 18:58:55 +10001678 struct xfs_attr_leafblock *leaf;
1679 struct xfs_da_state_blk *blk;
1680 struct xfs_attr3_icleaf_hdr ichdr;
1681 struct xfs_buf *bp;
1682 xfs_dablk_t blkno;
1683 int bytes;
1684 int forward;
1685 int error;
1686 int retval;
1687 int i;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001688
Dave Chinneree732592012-11-12 22:53:53 +11001689 trace_xfs_attr_leaf_toosmall(state->args);
1690
Linus Torvalds1da177e2005-04-16 15:20:36 -07001691 /*
1692 * Check for the degenerate case of the block being over 50% full.
1693 * If so, it's not worth even looking to see if we might be able
1694 * to coalesce with a sibling.
1695 */
1696 blk = &state->path.blk[ state->path.active-1 ];
Dave Chinner517c2222013-04-24 18:58:55 +10001697 leaf = blk->bp->b_addr;
1698 xfs_attr3_leaf_hdr_from_disk(&ichdr, leaf);
1699 bytes = xfs_attr3_leaf_hdr_size(leaf) +
1700 ichdr.count * sizeof(xfs_attr_leaf_entry_t) +
1701 ichdr.usedbytes;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001702 if (bytes > (state->blocksize >> 1)) {
1703 *action = 0; /* blk over 50%, don't try to join */
1704 return(0);
1705 }
1706
1707 /*
1708 * Check for the degenerate case of the block being empty.
1709 * If the block is empty, we'll simply delete it, no need to
Nathan Scottc41564b2006-03-29 08:55:14 +10001710 * coalesce it with a sibling block. We choose (arbitrarily)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001711 * to merge with the forward block unless it is NULL.
1712 */
Dave Chinner517c2222013-04-24 18:58:55 +10001713 if (ichdr.count == 0) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07001714 /*
1715 * Make altpath point to the block we want to keep and
1716 * path point to the block we want to drop (this one).
1717 */
Dave Chinner517c2222013-04-24 18:58:55 +10001718 forward = (ichdr.forw != 0);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001719 memcpy(&state->altpath, &state->path, sizeof(state->path));
Dave Chinnerf5ea1102013-04-24 18:58:02 +10001720 error = xfs_da3_path_shift(state, &state->altpath, forward,
Linus Torvalds1da177e2005-04-16 15:20:36 -07001721 0, &retval);
1722 if (error)
1723 return(error);
1724 if (retval) {
1725 *action = 0;
1726 } else {
1727 *action = 2;
1728 }
Dave Chinner517c2222013-04-24 18:58:55 +10001729 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001730 }
1731
1732 /*
1733 * Examine each sibling block to see if we can coalesce with
1734 * at least 25% free space to spare. We need to figure out
1735 * whether to merge with the forward or the backward block.
1736 * We prefer coalescing with the lower numbered sibling so as
1737 * to shrink an attribute list over time.
1738 */
1739 /* start with smaller blk num */
Dave Chinner517c2222013-04-24 18:58:55 +10001740 forward = ichdr.forw < ichdr.back;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001741 for (i = 0; i < 2; forward = !forward, i++) {
Dave Chinner517c2222013-04-24 18:58:55 +10001742 struct xfs_attr3_icleaf_hdr ichdr2;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001743 if (forward)
Dave Chinner517c2222013-04-24 18:58:55 +10001744 blkno = ichdr.forw;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001745 else
Dave Chinner517c2222013-04-24 18:58:55 +10001746 blkno = ichdr.back;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001747 if (blkno == 0)
1748 continue;
Dave Chinner517c2222013-04-24 18:58:55 +10001749 error = xfs_attr3_leaf_read(state->args->trans, state->args->dp,
Dave Chinnerad14c332012-11-12 22:54:16 +11001750 blkno, -1, &bp);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001751 if (error)
1752 return(error);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001753
Dave Chinner517c2222013-04-24 18:58:55 +10001754 xfs_attr3_leaf_hdr_from_disk(&ichdr2, bp->b_addr);
1755
1756 bytes = state->blocksize - (state->blocksize >> 2) -
1757 ichdr.usedbytes - ichdr2.usedbytes -
1758 ((ichdr.count + ichdr2.count) *
1759 sizeof(xfs_attr_leaf_entry_t)) -
1760 xfs_attr3_leaf_hdr_size(leaf);
1761
Dave Chinner1d9025e2012-06-22 18:50:14 +10001762 xfs_trans_brelse(state->args->trans, bp);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001763 if (bytes >= 0)
1764 break; /* fits with at least 25% to spare */
1765 }
1766 if (i >= 2) {
1767 *action = 0;
1768 return(0);
1769 }
1770
1771 /*
1772 * Make altpath point to the block we want to keep (the lower
1773 * numbered block) and path point to the block we want to drop.
1774 */
1775 memcpy(&state->altpath, &state->path, sizeof(state->path));
1776 if (blkno < blk->blkno) {
Dave Chinnerf5ea1102013-04-24 18:58:02 +10001777 error = xfs_da3_path_shift(state, &state->altpath, forward,
Linus Torvalds1da177e2005-04-16 15:20:36 -07001778 0, &retval);
1779 } else {
Dave Chinnerf5ea1102013-04-24 18:58:02 +10001780 error = xfs_da3_path_shift(state, &state->path, forward,
Linus Torvalds1da177e2005-04-16 15:20:36 -07001781 0, &retval);
1782 }
1783 if (error)
1784 return(error);
1785 if (retval) {
1786 *action = 0;
1787 } else {
1788 *action = 1;
1789 }
1790 return(0);
1791}
1792
1793/*
1794 * Remove a name from the leaf attribute list structure.
1795 *
1796 * Return 1 if leaf is less than 37% full, 0 if >= 37% full.
1797 * If two leaves are 37% full, when combined they will leave 25% free.
1798 */
1799int
Dave Chinner517c2222013-04-24 18:58:55 +10001800xfs_attr3_leaf_remove(
1801 struct xfs_buf *bp,
1802 struct xfs_da_args *args)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001803{
Dave Chinner517c2222013-04-24 18:58:55 +10001804 struct xfs_attr_leafblock *leaf;
1805 struct xfs_attr3_icleaf_hdr ichdr;
1806 struct xfs_attr_leaf_entry *entry;
1807 struct xfs_mount *mp = args->trans->t_mountp;
1808 int before;
1809 int after;
1810 int smallest;
1811 int entsize;
1812 int tablesize;
1813 int tmp;
1814 int i;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001815
Dave Chinneree732592012-11-12 22:53:53 +11001816 trace_xfs_attr_leaf_remove(args);
1817
Dave Chinner1d9025e2012-06-22 18:50:14 +10001818 leaf = bp->b_addr;
Dave Chinner517c2222013-04-24 18:58:55 +10001819 xfs_attr3_leaf_hdr_from_disk(&ichdr, leaf);
1820
1821 ASSERT(ichdr.count > 0 && ichdr.count < XFS_LBSIZE(mp) / 8);
1822 ASSERT(args->index >= 0 && args->index < ichdr.count);
1823 ASSERT(ichdr.firstused >= ichdr.count * sizeof(*entry) +
1824 xfs_attr3_leaf_hdr_size(leaf));
1825
1826 entry = &xfs_attr3_leaf_entryp(leaf)[args->index];
1827
1828 ASSERT(be16_to_cpu(entry->nameidx) >= ichdr.firstused);
Nathan Scott6b19f2d2006-03-17 17:29:02 +11001829 ASSERT(be16_to_cpu(entry->nameidx) < XFS_LBSIZE(mp));
Linus Torvalds1da177e2005-04-16 15:20:36 -07001830
1831 /*
1832 * Scan through free region table:
1833 * check for adjacency of free'd entry with an existing one,
1834 * find smallest free region in case we need to replace it,
1835 * adjust any map that borders the entry table,
1836 */
Dave Chinner517c2222013-04-24 18:58:55 +10001837 tablesize = ichdr.count * sizeof(xfs_attr_leaf_entry_t)
1838 + xfs_attr3_leaf_hdr_size(leaf);
1839 tmp = ichdr.freemap[0].size;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001840 before = after = -1;
1841 smallest = XFS_ATTR_LEAF_MAPSIZE - 1;
1842 entsize = xfs_attr_leaf_entsize(leaf, args->index);
Dave Chinner517c2222013-04-24 18:58:55 +10001843 for (i = 0; i < XFS_ATTR_LEAF_MAPSIZE; i++) {
1844 ASSERT(ichdr.freemap[i].base < XFS_LBSIZE(mp));
1845 ASSERT(ichdr.freemap[i].size < XFS_LBSIZE(mp));
1846 if (ichdr.freemap[i].base == tablesize) {
1847 ichdr.freemap[i].base -= sizeof(xfs_attr_leaf_entry_t);
1848 ichdr.freemap[i].size += sizeof(xfs_attr_leaf_entry_t);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001849 }
1850
Dave Chinner517c2222013-04-24 18:58:55 +10001851 if (ichdr.freemap[i].base + ichdr.freemap[i].size ==
1852 be16_to_cpu(entry->nameidx)) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07001853 before = i;
Dave Chinner517c2222013-04-24 18:58:55 +10001854 } else if (ichdr.freemap[i].base ==
1855 (be16_to_cpu(entry->nameidx) + entsize)) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07001856 after = i;
Dave Chinner517c2222013-04-24 18:58:55 +10001857 } else if (ichdr.freemap[i].size < tmp) {
1858 tmp = ichdr.freemap[i].size;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001859 smallest = i;
1860 }
1861 }
1862
1863 /*
1864 * Coalesce adjacent freemap regions,
1865 * or replace the smallest region.
1866 */
1867 if ((before >= 0) || (after >= 0)) {
1868 if ((before >= 0) && (after >= 0)) {
Dave Chinner517c2222013-04-24 18:58:55 +10001869 ichdr.freemap[before].size += entsize;
1870 ichdr.freemap[before].size += ichdr.freemap[after].size;
1871 ichdr.freemap[after].base = 0;
1872 ichdr.freemap[after].size = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001873 } else if (before >= 0) {
Dave Chinner517c2222013-04-24 18:58:55 +10001874 ichdr.freemap[before].size += entsize;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001875 } else {
Dave Chinner517c2222013-04-24 18:58:55 +10001876 ichdr.freemap[after].base = be16_to_cpu(entry->nameidx);
1877 ichdr.freemap[after].size += entsize;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001878 }
1879 } else {
1880 /*
1881 * Replace smallest region (if it is smaller than free'd entry)
1882 */
Dave Chinner517c2222013-04-24 18:58:55 +10001883 if (ichdr.freemap[smallest].size < entsize) {
1884 ichdr.freemap[smallest].base = be16_to_cpu(entry->nameidx);
1885 ichdr.freemap[smallest].size = entsize;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001886 }
1887 }
1888
1889 /*
1890 * Did we remove the first entry?
1891 */
Dave Chinner517c2222013-04-24 18:58:55 +10001892 if (be16_to_cpu(entry->nameidx) == ichdr.firstused)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001893 smallest = 1;
1894 else
1895 smallest = 0;
1896
1897 /*
1898 * Compress the remaining entries and zero out the removed stuff.
1899 */
Dave Chinner517c2222013-04-24 18:58:55 +10001900 memset(xfs_attr3_leaf_name(leaf, args->index), 0, entsize);
1901 ichdr.usedbytes -= entsize;
Dave Chinner1d9025e2012-06-22 18:50:14 +10001902 xfs_trans_log_buf(args->trans, bp,
Dave Chinner517c2222013-04-24 18:58:55 +10001903 XFS_DA_LOGRANGE(leaf, xfs_attr3_leaf_name(leaf, args->index),
Linus Torvalds1da177e2005-04-16 15:20:36 -07001904 entsize));
1905
Dave Chinner517c2222013-04-24 18:58:55 +10001906 tmp = (ichdr.count - args->index) * sizeof(xfs_attr_leaf_entry_t);
1907 memmove(entry, entry + 1, tmp);
1908 ichdr.count--;
Dave Chinner1d9025e2012-06-22 18:50:14 +10001909 xfs_trans_log_buf(args->trans, bp,
Dave Chinner517c2222013-04-24 18:58:55 +10001910 XFS_DA_LOGRANGE(leaf, entry, tmp + sizeof(xfs_attr_leaf_entry_t)));
1911
1912 entry = &xfs_attr3_leaf_entryp(leaf)[ichdr.count];
1913 memset(entry, 0, sizeof(xfs_attr_leaf_entry_t));
Linus Torvalds1da177e2005-04-16 15:20:36 -07001914
1915 /*
1916 * If we removed the first entry, re-find the first used byte
1917 * in the name area. Note that if the entry was the "firstused",
1918 * then we don't have a "hole" in our block resulting from
1919 * removing the name.
1920 */
1921 if (smallest) {
1922 tmp = XFS_LBSIZE(mp);
Dave Chinner517c2222013-04-24 18:58:55 +10001923 entry = xfs_attr3_leaf_entryp(leaf);
1924 for (i = ichdr.count - 1; i >= 0; entry++, i--) {
1925 ASSERT(be16_to_cpu(entry->nameidx) >= ichdr.firstused);
Nathan Scott6b19f2d2006-03-17 17:29:02 +11001926 ASSERT(be16_to_cpu(entry->nameidx) < XFS_LBSIZE(mp));
1927
1928 if (be16_to_cpu(entry->nameidx) < tmp)
1929 tmp = be16_to_cpu(entry->nameidx);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001930 }
Dave Chinner517c2222013-04-24 18:58:55 +10001931 ichdr.firstused = tmp;
1932 if (!ichdr.firstused)
1933 ichdr.firstused = tmp - XFS_ATTR_LEAF_NAME_ALIGN;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001934 } else {
Dave Chinner517c2222013-04-24 18:58:55 +10001935 ichdr.holes = 1; /* mark as needing compaction */
Linus Torvalds1da177e2005-04-16 15:20:36 -07001936 }
Dave Chinner517c2222013-04-24 18:58:55 +10001937 xfs_attr3_leaf_hdr_to_disk(leaf, &ichdr);
Dave Chinner1d9025e2012-06-22 18:50:14 +10001938 xfs_trans_log_buf(args->trans, bp,
Dave Chinner517c2222013-04-24 18:58:55 +10001939 XFS_DA_LOGRANGE(leaf, &leaf->hdr,
1940 xfs_attr3_leaf_hdr_size(leaf)));
Linus Torvalds1da177e2005-04-16 15:20:36 -07001941
1942 /*
1943 * Check if leaf is less than 50% full, caller may want to
1944 * "join" the leaf with a sibling if so.
1945 */
Dave Chinner517c2222013-04-24 18:58:55 +10001946 tmp = ichdr.usedbytes + xfs_attr3_leaf_hdr_size(leaf) +
1947 ichdr.count * sizeof(xfs_attr_leaf_entry_t);
1948
1949 return tmp < mp->m_attr_magicpct; /* leaf is < 37% full */
Linus Torvalds1da177e2005-04-16 15:20:36 -07001950}
1951
1952/*
1953 * Move all the attribute list entries from drop_leaf into save_leaf.
1954 */
1955void
Dave Chinner517c2222013-04-24 18:58:55 +10001956xfs_attr3_leaf_unbalance(
1957 struct xfs_da_state *state,
1958 struct xfs_da_state_blk *drop_blk,
1959 struct xfs_da_state_blk *save_blk)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001960{
Dave Chinner517c2222013-04-24 18:58:55 +10001961 struct xfs_attr_leafblock *drop_leaf = drop_blk->bp->b_addr;
1962 struct xfs_attr_leafblock *save_leaf = save_blk->bp->b_addr;
1963 struct xfs_attr3_icleaf_hdr drophdr;
1964 struct xfs_attr3_icleaf_hdr savehdr;
1965 struct xfs_attr_leaf_entry *entry;
1966 struct xfs_mount *mp = state->mp;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001967
Dave Chinner5a5881c2012-03-22 05:15:13 +00001968 trace_xfs_attr_leaf_unbalance(state->args);
1969
Dave Chinner1d9025e2012-06-22 18:50:14 +10001970 drop_leaf = drop_blk->bp->b_addr;
1971 save_leaf = save_blk->bp->b_addr;
Dave Chinner517c2222013-04-24 18:58:55 +10001972 xfs_attr3_leaf_hdr_from_disk(&drophdr, drop_leaf);
1973 xfs_attr3_leaf_hdr_from_disk(&savehdr, save_leaf);
1974 entry = xfs_attr3_leaf_entryp(drop_leaf);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001975
1976 /*
1977 * Save last hashval from dying block for later Btree fixup.
1978 */
Dave Chinner517c2222013-04-24 18:58:55 +10001979 drop_blk->hashval = be32_to_cpu(entry[drophdr.count - 1].hashval);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001980
1981 /*
1982 * Check if we need a temp buffer, or can we do it in place.
1983 * Note that we don't check "leaf" for holes because we will
1984 * always be dropping it, toosmall() decided that for us already.
1985 */
Dave Chinner517c2222013-04-24 18:58:55 +10001986 if (savehdr.holes == 0) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07001987 /*
1988 * dest leaf has no holes, so we add there. May need
1989 * to make some room in the entry array.
1990 */
Dave Chinner517c2222013-04-24 18:58:55 +10001991 if (xfs_attr3_leaf_order(save_blk->bp, &savehdr,
1992 drop_blk->bp, &drophdr)) {
1993 xfs_attr3_leaf_moveents(drop_leaf, &drophdr, 0,
1994 save_leaf, &savehdr, 0,
1995 drophdr.count, mp);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001996 } else {
Dave Chinner517c2222013-04-24 18:58:55 +10001997 xfs_attr3_leaf_moveents(drop_leaf, &drophdr, 0,
1998 save_leaf, &savehdr,
1999 savehdr.count, drophdr.count, mp);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002000 }
2001 } else {
2002 /*
2003 * Destination has holes, so we make a temporary copy
2004 * of the leaf and add them both to that.
2005 */
Dave Chinner517c2222013-04-24 18:58:55 +10002006 struct xfs_attr_leafblock *tmp_leaf;
2007 struct xfs_attr3_icleaf_hdr tmphdr;
2008
Dave Chinner8517de22013-05-21 18:02:05 +10002009 tmp_leaf = kmem_zalloc(state->blocksize, KM_SLEEP);
Dave Chinner517c2222013-04-24 18:58:55 +10002010
Dave Chinner8517de22013-05-21 18:02:05 +10002011 /*
2012 * Copy the header into the temp leaf so that all the stuff
2013 * not in the incore header is present and gets copied back in
2014 * once we've moved all the entries.
2015 */
2016 memcpy(tmp_leaf, save_leaf, xfs_attr3_leaf_hdr_size(save_leaf));
2017
2018 memset(&tmphdr, 0, sizeof(tmphdr));
Dave Chinner517c2222013-04-24 18:58:55 +10002019 tmphdr.magic = savehdr.magic;
2020 tmphdr.forw = savehdr.forw;
2021 tmphdr.back = savehdr.back;
2022 tmphdr.firstused = state->blocksize;
Dave Chinner8517de22013-05-21 18:02:05 +10002023
2024 /* write the header to the temp buffer to initialise it */
2025 xfs_attr3_leaf_hdr_to_disk(tmp_leaf, &tmphdr);
2026
Dave Chinner517c2222013-04-24 18:58:55 +10002027 if (xfs_attr3_leaf_order(save_blk->bp, &savehdr,
2028 drop_blk->bp, &drophdr)) {
2029 xfs_attr3_leaf_moveents(drop_leaf, &drophdr, 0,
2030 tmp_leaf, &tmphdr, 0,
2031 drophdr.count, mp);
2032 xfs_attr3_leaf_moveents(save_leaf, &savehdr, 0,
2033 tmp_leaf, &tmphdr, tmphdr.count,
2034 savehdr.count, mp);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002035 } else {
Dave Chinner517c2222013-04-24 18:58:55 +10002036 xfs_attr3_leaf_moveents(save_leaf, &savehdr, 0,
2037 tmp_leaf, &tmphdr, 0,
2038 savehdr.count, mp);
2039 xfs_attr3_leaf_moveents(drop_leaf, &drophdr, 0,
2040 tmp_leaf, &tmphdr, tmphdr.count,
2041 drophdr.count, mp);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002042 }
Dave Chinner517c2222013-04-24 18:58:55 +10002043 memcpy(save_leaf, tmp_leaf, state->blocksize);
2044 savehdr = tmphdr; /* struct copy */
2045 kmem_free(tmp_leaf);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002046 }
2047
Dave Chinner517c2222013-04-24 18:58:55 +10002048 xfs_attr3_leaf_hdr_to_disk(save_leaf, &savehdr);
Dave Chinner1d9025e2012-06-22 18:50:14 +10002049 xfs_trans_log_buf(state->args->trans, save_blk->bp, 0,
Linus Torvalds1da177e2005-04-16 15:20:36 -07002050 state->blocksize - 1);
2051
2052 /*
2053 * Copy out last hashval in each block for B-tree code.
2054 */
Dave Chinner517c2222013-04-24 18:58:55 +10002055 entry = xfs_attr3_leaf_entryp(save_leaf);
2056 save_blk->hashval = be32_to_cpu(entry[savehdr.count - 1].hashval);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002057}
2058
2059/*========================================================================
2060 * Routines used for finding things in the Btree.
2061 *========================================================================*/
2062
2063/*
2064 * Look up a name in a leaf attribute list structure.
2065 * This is the internal routine, it uses the caller's buffer.
2066 *
2067 * Note that duplicate keys are allowed, but only check within the
2068 * current leaf node. The Btree code must check in adjacent leaf nodes.
2069 *
2070 * Return in args->index the index into the entry[] array of either
2071 * the found entry, or where the entry should have been (insert before
2072 * that entry).
2073 *
2074 * Don't change the args->value unless we find the attribute.
2075 */
2076int
Dave Chinner517c2222013-04-24 18:58:55 +10002077xfs_attr3_leaf_lookup_int(
2078 struct xfs_buf *bp,
2079 struct xfs_da_args *args)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002080{
Dave Chinner517c2222013-04-24 18:58:55 +10002081 struct xfs_attr_leafblock *leaf;
2082 struct xfs_attr3_icleaf_hdr ichdr;
2083 struct xfs_attr_leaf_entry *entry;
2084 struct xfs_attr_leaf_entry *entries;
2085 struct xfs_attr_leaf_name_local *name_loc;
2086 struct xfs_attr_leaf_name_remote *name_rmt;
2087 xfs_dahash_t hashval;
2088 int probe;
2089 int span;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002090
Dave Chinner5a5881c2012-03-22 05:15:13 +00002091 trace_xfs_attr_leaf_lookup(args);
2092
Dave Chinner1d9025e2012-06-22 18:50:14 +10002093 leaf = bp->b_addr;
Dave Chinner517c2222013-04-24 18:58:55 +10002094 xfs_attr3_leaf_hdr_from_disk(&ichdr, leaf);
2095 entries = xfs_attr3_leaf_entryp(leaf);
2096 ASSERT(ichdr.count < XFS_LBSIZE(args->dp->i_mount) / 8);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002097
2098 /*
2099 * Binary search. (note: small blocks will skip this loop)
2100 */
2101 hashval = args->hashval;
Dave Chinner517c2222013-04-24 18:58:55 +10002102 probe = span = ichdr.count / 2;
2103 for (entry = &entries[probe]; span > 4; entry = &entries[probe]) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07002104 span /= 2;
Nathan Scott6b19f2d2006-03-17 17:29:02 +11002105 if (be32_to_cpu(entry->hashval) < hashval)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002106 probe += span;
Nathan Scott6b19f2d2006-03-17 17:29:02 +11002107 else if (be32_to_cpu(entry->hashval) > hashval)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002108 probe -= span;
2109 else
2110 break;
2111 }
Dave Chinner517c2222013-04-24 18:58:55 +10002112 ASSERT(probe >= 0 && (!ichdr.count || probe < ichdr.count));
2113 ASSERT(span <= 4 || be32_to_cpu(entry->hashval) == hashval);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002114
2115 /*
2116 * Since we may have duplicate hashval's, find the first matching
2117 * hashval in the leaf.
2118 */
Dave Chinner517c2222013-04-24 18:58:55 +10002119 while (probe > 0 && be32_to_cpu(entry->hashval) >= hashval) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07002120 entry--;
2121 probe--;
2122 }
Dave Chinner517c2222013-04-24 18:58:55 +10002123 while (probe < ichdr.count &&
2124 be32_to_cpu(entry->hashval) < hashval) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07002125 entry++;
2126 probe++;
2127 }
Dave Chinner517c2222013-04-24 18:58:55 +10002128 if (probe == ichdr.count || be32_to_cpu(entry->hashval) != hashval) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07002129 args->index = probe;
Dave Chinner517c2222013-04-24 18:58:55 +10002130 return XFS_ERROR(ENOATTR);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002131 }
2132
2133 /*
2134 * Duplicate keys may be present, so search all of them for a match.
2135 */
Dave Chinner517c2222013-04-24 18:58:55 +10002136 for (; probe < ichdr.count && (be32_to_cpu(entry->hashval) == hashval);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002137 entry++, probe++) {
2138/*
2139 * GROT: Add code to remove incomplete entries.
2140 */
2141 /*
2142 * If we are looking for INCOMPLETE entries, show only those.
2143 * If we are looking for complete entries, show only those.
2144 */
2145 if ((args->flags & XFS_ATTR_INCOMPLETE) !=
2146 (entry->flags & XFS_ATTR_INCOMPLETE)) {
2147 continue;
2148 }
2149 if (entry->flags & XFS_ATTR_LOCAL) {
Dave Chinner517c2222013-04-24 18:58:55 +10002150 name_loc = xfs_attr3_leaf_name_local(leaf, probe);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002151 if (name_loc->namelen != args->namelen)
2152 continue;
Dave Chinner517c2222013-04-24 18:58:55 +10002153 if (memcmp(args->name, name_loc->nameval,
2154 args->namelen) != 0)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002155 continue;
Tim Shimmin726801b2006-09-28 11:01:37 +10002156 if (!xfs_attr_namesp_match(args->flags, entry->flags))
Linus Torvalds1da177e2005-04-16 15:20:36 -07002157 continue;
2158 args->index = probe;
Dave Chinner517c2222013-04-24 18:58:55 +10002159 return XFS_ERROR(EEXIST);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002160 } else {
Dave Chinner517c2222013-04-24 18:58:55 +10002161 name_rmt = xfs_attr3_leaf_name_remote(leaf, probe);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002162 if (name_rmt->namelen != args->namelen)
2163 continue;
Dave Chinner517c2222013-04-24 18:58:55 +10002164 if (memcmp(args->name, name_rmt->name,
2165 args->namelen) != 0)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002166 continue;
Tim Shimmin726801b2006-09-28 11:01:37 +10002167 if (!xfs_attr_namesp_match(args->flags, entry->flags))
Linus Torvalds1da177e2005-04-16 15:20:36 -07002168 continue;
2169 args->index = probe;
Dave Chinnere461fcb2013-05-20 09:51:16 +10002170 args->valuelen = be32_to_cpu(name_rmt->valuelen);
Nathan Scottc0f054e2006-03-17 17:29:18 +11002171 args->rmtblkno = be32_to_cpu(name_rmt->valueblk);
Dave Chinnerad1858d2013-05-21 18:02:08 +10002172 args->rmtblkcnt = xfs_attr3_rmt_blocks(
2173 args->dp->i_mount,
2174 args->valuelen);
Dave Chinner517c2222013-04-24 18:58:55 +10002175 return XFS_ERROR(EEXIST);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002176 }
2177 }
2178 args->index = probe;
Dave Chinner517c2222013-04-24 18:58:55 +10002179 return XFS_ERROR(ENOATTR);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002180}
2181
2182/*
2183 * Get the value associated with an attribute name from a leaf attribute
2184 * list structure.
2185 */
2186int
Dave Chinner517c2222013-04-24 18:58:55 +10002187xfs_attr3_leaf_getvalue(
2188 struct xfs_buf *bp,
2189 struct xfs_da_args *args)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002190{
Dave Chinner517c2222013-04-24 18:58:55 +10002191 struct xfs_attr_leafblock *leaf;
2192 struct xfs_attr3_icleaf_hdr ichdr;
2193 struct xfs_attr_leaf_entry *entry;
2194 struct xfs_attr_leaf_name_local *name_loc;
2195 struct xfs_attr_leaf_name_remote *name_rmt;
2196 int valuelen;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002197
Dave Chinner1d9025e2012-06-22 18:50:14 +10002198 leaf = bp->b_addr;
Dave Chinner517c2222013-04-24 18:58:55 +10002199 xfs_attr3_leaf_hdr_from_disk(&ichdr, leaf);
2200 ASSERT(ichdr.count < XFS_LBSIZE(args->dp->i_mount) / 8);
2201 ASSERT(args->index < ichdr.count);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002202
Dave Chinner517c2222013-04-24 18:58:55 +10002203 entry = &xfs_attr3_leaf_entryp(leaf)[args->index];
Linus Torvalds1da177e2005-04-16 15:20:36 -07002204 if (entry->flags & XFS_ATTR_LOCAL) {
Dave Chinner517c2222013-04-24 18:58:55 +10002205 name_loc = xfs_attr3_leaf_name_local(leaf, args->index);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002206 ASSERT(name_loc->namelen == args->namelen);
2207 ASSERT(memcmp(args->name, name_loc->nameval, args->namelen) == 0);
Nathan Scott053b5752006-03-17 17:29:09 +11002208 valuelen = be16_to_cpu(name_loc->valuelen);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002209 if (args->flags & ATTR_KERNOVAL) {
2210 args->valuelen = valuelen;
Dave Chinner517c2222013-04-24 18:58:55 +10002211 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002212 }
2213 if (args->valuelen < valuelen) {
2214 args->valuelen = valuelen;
Dave Chinner517c2222013-04-24 18:58:55 +10002215 return XFS_ERROR(ERANGE);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002216 }
2217 args->valuelen = valuelen;
2218 memcpy(args->value, &name_loc->nameval[args->namelen], valuelen);
2219 } else {
Dave Chinner517c2222013-04-24 18:58:55 +10002220 name_rmt = xfs_attr3_leaf_name_remote(leaf, args->index);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002221 ASSERT(name_rmt->namelen == args->namelen);
2222 ASSERT(memcmp(args->name, name_rmt->name, args->namelen) == 0);
Nathan Scottc0f054e2006-03-17 17:29:18 +11002223 valuelen = be32_to_cpu(name_rmt->valuelen);
2224 args->rmtblkno = be32_to_cpu(name_rmt->valueblk);
Dave Chinnerad1858d2013-05-21 18:02:08 +10002225 args->rmtblkcnt = xfs_attr3_rmt_blocks(args->dp->i_mount,
2226 valuelen);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002227 if (args->flags & ATTR_KERNOVAL) {
2228 args->valuelen = valuelen;
Dave Chinner517c2222013-04-24 18:58:55 +10002229 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002230 }
2231 if (args->valuelen < valuelen) {
2232 args->valuelen = valuelen;
Dave Chinner517c2222013-04-24 18:58:55 +10002233 return XFS_ERROR(ERANGE);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002234 }
2235 args->valuelen = valuelen;
2236 }
Dave Chinner517c2222013-04-24 18:58:55 +10002237 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002238}
2239
2240/*========================================================================
2241 * Utility routines.
2242 *========================================================================*/
2243
2244/*
2245 * Move the indicated entries from one leaf to another.
2246 * NOTE: this routine modifies both source and destination leaves.
2247 */
2248/*ARGSUSED*/
2249STATIC void
Dave Chinner517c2222013-04-24 18:58:55 +10002250xfs_attr3_leaf_moveents(
2251 struct xfs_attr_leafblock *leaf_s,
2252 struct xfs_attr3_icleaf_hdr *ichdr_s,
2253 int start_s,
2254 struct xfs_attr_leafblock *leaf_d,
2255 struct xfs_attr3_icleaf_hdr *ichdr_d,
2256 int start_d,
2257 int count,
2258 struct xfs_mount *mp)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002259{
Dave Chinner517c2222013-04-24 18:58:55 +10002260 struct xfs_attr_leaf_entry *entry_s;
2261 struct xfs_attr_leaf_entry *entry_d;
2262 int desti;
2263 int tmp;
2264 int i;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002265
2266 /*
2267 * Check for nothing to do.
2268 */
2269 if (count == 0)
2270 return;
2271
2272 /*
2273 * Set up environment.
2274 */
Dave Chinner517c2222013-04-24 18:58:55 +10002275 ASSERT(ichdr_s->magic == XFS_ATTR_LEAF_MAGIC ||
2276 ichdr_s->magic == XFS_ATTR3_LEAF_MAGIC);
2277 ASSERT(ichdr_s->magic == ichdr_d->magic);
2278 ASSERT(ichdr_s->count > 0 && ichdr_s->count < XFS_LBSIZE(mp) / 8);
2279 ASSERT(ichdr_s->firstused >= (ichdr_s->count * sizeof(*entry_s))
2280 + xfs_attr3_leaf_hdr_size(leaf_s));
2281 ASSERT(ichdr_d->count < XFS_LBSIZE(mp) / 8);
2282 ASSERT(ichdr_d->firstused >= (ichdr_d->count * sizeof(*entry_d))
2283 + xfs_attr3_leaf_hdr_size(leaf_d));
Linus Torvalds1da177e2005-04-16 15:20:36 -07002284
Dave Chinner517c2222013-04-24 18:58:55 +10002285 ASSERT(start_s < ichdr_s->count);
2286 ASSERT(start_d <= ichdr_d->count);
2287 ASSERT(count <= ichdr_s->count);
2288
Linus Torvalds1da177e2005-04-16 15:20:36 -07002289
2290 /*
2291 * Move the entries in the destination leaf up to make a hole?
2292 */
Dave Chinner517c2222013-04-24 18:58:55 +10002293 if (start_d < ichdr_d->count) {
2294 tmp = ichdr_d->count - start_d;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002295 tmp *= sizeof(xfs_attr_leaf_entry_t);
Dave Chinner517c2222013-04-24 18:58:55 +10002296 entry_s = &xfs_attr3_leaf_entryp(leaf_d)[start_d];
2297 entry_d = &xfs_attr3_leaf_entryp(leaf_d)[start_d + count];
2298 memmove(entry_d, entry_s, tmp);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002299 }
2300
2301 /*
2302 * Copy all entry's in the same (sorted) order,
2303 * but allocate attribute info packed and in sequence.
2304 */
Dave Chinner517c2222013-04-24 18:58:55 +10002305 entry_s = &xfs_attr3_leaf_entryp(leaf_s)[start_s];
2306 entry_d = &xfs_attr3_leaf_entryp(leaf_d)[start_d];
Linus Torvalds1da177e2005-04-16 15:20:36 -07002307 desti = start_d;
2308 for (i = 0; i < count; entry_s++, entry_d++, desti++, i++) {
Dave Chinner517c2222013-04-24 18:58:55 +10002309 ASSERT(be16_to_cpu(entry_s->nameidx) >= ichdr_s->firstused);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002310 tmp = xfs_attr_leaf_entsize(leaf_s, start_s + i);
2311#ifdef GROT
2312 /*
2313 * Code to drop INCOMPLETE entries. Difficult to use as we
2314 * may also need to change the insertion index. Code turned
2315 * off for 6.2, should be revisited later.
2316 */
2317 if (entry_s->flags & XFS_ATTR_INCOMPLETE) { /* skip partials? */
Dave Chinner517c2222013-04-24 18:58:55 +10002318 memset(xfs_attr3_leaf_name(leaf_s, start_s + i), 0, tmp);
2319 ichdr_s->usedbytes -= tmp;
2320 ichdr_s->count -= 1;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002321 entry_d--; /* to compensate for ++ in loop hdr */
2322 desti--;
2323 if ((start_s + i) < offset)
2324 result++; /* insertion index adjustment */
2325 } else {
2326#endif /* GROT */
Dave Chinner517c2222013-04-24 18:58:55 +10002327 ichdr_d->firstused -= tmp;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002328 /* both on-disk, don't endian flip twice */
2329 entry_d->hashval = entry_s->hashval;
Dave Chinner517c2222013-04-24 18:58:55 +10002330 entry_d->nameidx = cpu_to_be16(ichdr_d->firstused);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002331 entry_d->flags = entry_s->flags;
Nathan Scott6b19f2d2006-03-17 17:29:02 +11002332 ASSERT(be16_to_cpu(entry_d->nameidx) + tmp
Linus Torvalds1da177e2005-04-16 15:20:36 -07002333 <= XFS_LBSIZE(mp));
Dave Chinner517c2222013-04-24 18:58:55 +10002334 memmove(xfs_attr3_leaf_name(leaf_d, desti),
2335 xfs_attr3_leaf_name(leaf_s, start_s + i), tmp);
Nathan Scott6b19f2d2006-03-17 17:29:02 +11002336 ASSERT(be16_to_cpu(entry_s->nameidx) + tmp
Linus Torvalds1da177e2005-04-16 15:20:36 -07002337 <= XFS_LBSIZE(mp));
Dave Chinner517c2222013-04-24 18:58:55 +10002338 memset(xfs_attr3_leaf_name(leaf_s, start_s + i), 0, tmp);
2339 ichdr_s->usedbytes -= tmp;
2340 ichdr_d->usedbytes += tmp;
2341 ichdr_s->count -= 1;
2342 ichdr_d->count += 1;
2343 tmp = ichdr_d->count * sizeof(xfs_attr_leaf_entry_t)
2344 + xfs_attr3_leaf_hdr_size(leaf_d);
2345 ASSERT(ichdr_d->firstused >= tmp);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002346#ifdef GROT
2347 }
2348#endif /* GROT */
2349 }
2350
2351 /*
2352 * Zero out the entries we just copied.
2353 */
Dave Chinner517c2222013-04-24 18:58:55 +10002354 if (start_s == ichdr_s->count) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07002355 tmp = count * sizeof(xfs_attr_leaf_entry_t);
Dave Chinner517c2222013-04-24 18:58:55 +10002356 entry_s = &xfs_attr3_leaf_entryp(leaf_s)[start_s];
Linus Torvalds1da177e2005-04-16 15:20:36 -07002357 ASSERT(((char *)entry_s + tmp) <=
2358 ((char *)leaf_s + XFS_LBSIZE(mp)));
Dave Chinner517c2222013-04-24 18:58:55 +10002359 memset(entry_s, 0, tmp);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002360 } else {
2361 /*
2362 * Move the remaining entries down to fill the hole,
2363 * then zero the entries at the top.
2364 */
Dave Chinner517c2222013-04-24 18:58:55 +10002365 tmp = (ichdr_s->count - count) * sizeof(xfs_attr_leaf_entry_t);
2366 entry_s = &xfs_attr3_leaf_entryp(leaf_s)[start_s + count];
2367 entry_d = &xfs_attr3_leaf_entryp(leaf_s)[start_s];
2368 memmove(entry_d, entry_s, tmp);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002369
2370 tmp = count * sizeof(xfs_attr_leaf_entry_t);
Dave Chinner517c2222013-04-24 18:58:55 +10002371 entry_s = &xfs_attr3_leaf_entryp(leaf_s)[ichdr_s->count];
Linus Torvalds1da177e2005-04-16 15:20:36 -07002372 ASSERT(((char *)entry_s + tmp) <=
2373 ((char *)leaf_s + XFS_LBSIZE(mp)));
Dave Chinner517c2222013-04-24 18:58:55 +10002374 memset(entry_s, 0, tmp);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002375 }
2376
2377 /*
2378 * Fill in the freemap information
2379 */
Dave Chinner517c2222013-04-24 18:58:55 +10002380 ichdr_d->freemap[0].base = xfs_attr3_leaf_hdr_size(leaf_d);
2381 ichdr_d->freemap[0].base += ichdr_d->count * sizeof(xfs_attr_leaf_entry_t);
2382 ichdr_d->freemap[0].size = ichdr_d->firstused - ichdr_d->freemap[0].base;
2383 ichdr_d->freemap[1].base = 0;
2384 ichdr_d->freemap[2].base = 0;
2385 ichdr_d->freemap[1].size = 0;
2386 ichdr_d->freemap[2].size = 0;
2387 ichdr_s->holes = 1; /* leaf may not be compact */
Linus Torvalds1da177e2005-04-16 15:20:36 -07002388}
2389
2390/*
2391 * Pick up the last hashvalue from a leaf block.
2392 */
2393xfs_dahash_t
Dave Chinner1d9025e2012-06-22 18:50:14 +10002394xfs_attr_leaf_lasthash(
2395 struct xfs_buf *bp,
2396 int *count)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002397{
Dave Chinner517c2222013-04-24 18:58:55 +10002398 struct xfs_attr3_icleaf_hdr ichdr;
2399 struct xfs_attr_leaf_entry *entries;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002400
Dave Chinner517c2222013-04-24 18:58:55 +10002401 xfs_attr3_leaf_hdr_from_disk(&ichdr, bp->b_addr);
2402 entries = xfs_attr3_leaf_entryp(bp->b_addr);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002403 if (count)
Dave Chinner517c2222013-04-24 18:58:55 +10002404 *count = ichdr.count;
2405 if (!ichdr.count)
2406 return 0;
2407 return be32_to_cpu(entries[ichdr.count - 1].hashval);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002408}
2409
2410/*
2411 * Calculate the number of bytes used to store the indicated attribute
2412 * (whether local or remote only calculate bytes in this block).
2413 */
Christoph Hellwigba0f32d2005-06-21 15:36:52 +10002414STATIC int
Linus Torvalds1da177e2005-04-16 15:20:36 -07002415xfs_attr_leaf_entsize(xfs_attr_leafblock_t *leaf, int index)
2416{
Dave Chinner517c2222013-04-24 18:58:55 +10002417 struct xfs_attr_leaf_entry *entries;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002418 xfs_attr_leaf_name_local_t *name_loc;
2419 xfs_attr_leaf_name_remote_t *name_rmt;
2420 int size;
2421
Dave Chinner517c2222013-04-24 18:58:55 +10002422 entries = xfs_attr3_leaf_entryp(leaf);
2423 if (entries[index].flags & XFS_ATTR_LOCAL) {
2424 name_loc = xfs_attr3_leaf_name_local(leaf, index);
Eric Sandeenc9fb86a2009-01-01 16:40:11 -06002425 size = xfs_attr_leaf_entsize_local(name_loc->namelen,
Nathan Scott053b5752006-03-17 17:29:09 +11002426 be16_to_cpu(name_loc->valuelen));
Linus Torvalds1da177e2005-04-16 15:20:36 -07002427 } else {
Dave Chinner517c2222013-04-24 18:58:55 +10002428 name_rmt = xfs_attr3_leaf_name_remote(leaf, index);
Eric Sandeenc9fb86a2009-01-01 16:40:11 -06002429 size = xfs_attr_leaf_entsize_remote(name_rmt->namelen);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002430 }
Dave Chinner517c2222013-04-24 18:58:55 +10002431 return size;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002432}
2433
2434/*
2435 * Calculate the number of bytes that would be required to store the new
2436 * attribute (whether local or remote only calculate bytes in this block).
2437 * This routine decides as a side effect whether the attribute will be
2438 * a "local" or a "remote" attribute.
2439 */
2440int
Nathan Scottaa82daa2005-11-02 10:33:33 +11002441xfs_attr_leaf_newentsize(int namelen, int valuelen, int blocksize, int *local)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002442{
2443 int size;
2444
Eric Sandeenc9fb86a2009-01-01 16:40:11 -06002445 size = xfs_attr_leaf_entsize_local(namelen, valuelen);
2446 if (size < xfs_attr_leaf_entsize_local_max(blocksize)) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07002447 if (local) {
2448 *local = 1;
2449 }
2450 } else {
Eric Sandeenc9fb86a2009-01-01 16:40:11 -06002451 size = xfs_attr_leaf_entsize_remote(namelen);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002452 if (local) {
2453 *local = 0;
2454 }
2455 }
Dave Chinner517c2222013-04-24 18:58:55 +10002456 return size;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002457}
2458
Linus Torvalds1da177e2005-04-16 15:20:36 -07002459
2460/*========================================================================
2461 * Manage the INCOMPLETE flag in a leaf entry
2462 *========================================================================*/
2463
2464/*
2465 * Clear the INCOMPLETE flag on an entry in a leaf block.
2466 */
2467int
Dave Chinner517c2222013-04-24 18:58:55 +10002468xfs_attr3_leaf_clearflag(
2469 struct xfs_da_args *args)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002470{
Dave Chinner517c2222013-04-24 18:58:55 +10002471 struct xfs_attr_leafblock *leaf;
2472 struct xfs_attr_leaf_entry *entry;
2473 struct xfs_attr_leaf_name_remote *name_rmt;
2474 struct xfs_buf *bp;
2475 int error;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002476#ifdef DEBUG
Dave Chinner517c2222013-04-24 18:58:55 +10002477 struct xfs_attr3_icleaf_hdr ichdr;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002478 xfs_attr_leaf_name_local_t *name_loc;
2479 int namelen;
2480 char *name;
2481#endif /* DEBUG */
2482
Dave Chinner5a5881c2012-03-22 05:15:13 +00002483 trace_xfs_attr_leaf_clearflag(args);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002484 /*
2485 * Set up the operation.
2486 */
Dave Chinner517c2222013-04-24 18:58:55 +10002487 error = xfs_attr3_leaf_read(args->trans, args->dp, args->blkno, -1, &bp);
Dave Chinnerad14c332012-11-12 22:54:16 +11002488 if (error)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002489 return(error);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002490
Dave Chinner1d9025e2012-06-22 18:50:14 +10002491 leaf = bp->b_addr;
Dave Chinner517c2222013-04-24 18:58:55 +10002492 entry = &xfs_attr3_leaf_entryp(leaf)[args->index];
Linus Torvalds1da177e2005-04-16 15:20:36 -07002493 ASSERT(entry->flags & XFS_ATTR_INCOMPLETE);
2494
2495#ifdef DEBUG
Dave Chinner517c2222013-04-24 18:58:55 +10002496 xfs_attr3_leaf_hdr_from_disk(&ichdr, leaf);
2497 ASSERT(args->index < ichdr.count);
2498 ASSERT(args->index >= 0);
2499
Linus Torvalds1da177e2005-04-16 15:20:36 -07002500 if (entry->flags & XFS_ATTR_LOCAL) {
Dave Chinner517c2222013-04-24 18:58:55 +10002501 name_loc = xfs_attr3_leaf_name_local(leaf, args->index);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002502 namelen = name_loc->namelen;
2503 name = (char *)name_loc->nameval;
2504 } else {
Dave Chinner517c2222013-04-24 18:58:55 +10002505 name_rmt = xfs_attr3_leaf_name_remote(leaf, args->index);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002506 namelen = name_rmt->namelen;
2507 name = (char *)name_rmt->name;
2508 }
Nathan Scott6b19f2d2006-03-17 17:29:02 +11002509 ASSERT(be32_to_cpu(entry->hashval) == args->hashval);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002510 ASSERT(namelen == args->namelen);
2511 ASSERT(memcmp(name, args->name, namelen) == 0);
2512#endif /* DEBUG */
2513
2514 entry->flags &= ~XFS_ATTR_INCOMPLETE;
Dave Chinner1d9025e2012-06-22 18:50:14 +10002515 xfs_trans_log_buf(args->trans, bp,
Linus Torvalds1da177e2005-04-16 15:20:36 -07002516 XFS_DA_LOGRANGE(leaf, entry, sizeof(*entry)));
2517
2518 if (args->rmtblkno) {
2519 ASSERT((entry->flags & XFS_ATTR_LOCAL) == 0);
Dave Chinner517c2222013-04-24 18:58:55 +10002520 name_rmt = xfs_attr3_leaf_name_remote(leaf, args->index);
Nathan Scottc0f054e2006-03-17 17:29:18 +11002521 name_rmt->valueblk = cpu_to_be32(args->rmtblkno);
2522 name_rmt->valuelen = cpu_to_be32(args->valuelen);
Dave Chinner1d9025e2012-06-22 18:50:14 +10002523 xfs_trans_log_buf(args->trans, bp,
Linus Torvalds1da177e2005-04-16 15:20:36 -07002524 XFS_DA_LOGRANGE(leaf, name_rmt, sizeof(*name_rmt)));
2525 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07002526
2527 /*
2528 * Commit the flag value change and start the next trans in series.
2529 */
Niv Sardi322ff6b2008-08-13 16:05:49 +10002530 return xfs_trans_roll(&args->trans, args->dp);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002531}
2532
2533/*
2534 * Set the INCOMPLETE flag on an entry in a leaf block.
2535 */
2536int
Dave Chinner517c2222013-04-24 18:58:55 +10002537xfs_attr3_leaf_setflag(
2538 struct xfs_da_args *args)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002539{
Dave Chinner517c2222013-04-24 18:58:55 +10002540 struct xfs_attr_leafblock *leaf;
2541 struct xfs_attr_leaf_entry *entry;
2542 struct xfs_attr_leaf_name_remote *name_rmt;
2543 struct xfs_buf *bp;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002544 int error;
Dave Chinner517c2222013-04-24 18:58:55 +10002545#ifdef DEBUG
2546 struct xfs_attr3_icleaf_hdr ichdr;
2547#endif
Linus Torvalds1da177e2005-04-16 15:20:36 -07002548
Dave Chinner5a5881c2012-03-22 05:15:13 +00002549 trace_xfs_attr_leaf_setflag(args);
2550
Linus Torvalds1da177e2005-04-16 15:20:36 -07002551 /*
2552 * Set up the operation.
2553 */
Dave Chinner517c2222013-04-24 18:58:55 +10002554 error = xfs_attr3_leaf_read(args->trans, args->dp, args->blkno, -1, &bp);
Dave Chinnerad14c332012-11-12 22:54:16 +11002555 if (error)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002556 return(error);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002557
Dave Chinner1d9025e2012-06-22 18:50:14 +10002558 leaf = bp->b_addr;
Dave Chinner517c2222013-04-24 18:58:55 +10002559#ifdef DEBUG
2560 xfs_attr3_leaf_hdr_from_disk(&ichdr, leaf);
2561 ASSERT(args->index < ichdr.count);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002562 ASSERT(args->index >= 0);
Dave Chinner517c2222013-04-24 18:58:55 +10002563#endif
2564 entry = &xfs_attr3_leaf_entryp(leaf)[args->index];
Linus Torvalds1da177e2005-04-16 15:20:36 -07002565
2566 ASSERT((entry->flags & XFS_ATTR_INCOMPLETE) == 0);
2567 entry->flags |= XFS_ATTR_INCOMPLETE;
Dave Chinner1d9025e2012-06-22 18:50:14 +10002568 xfs_trans_log_buf(args->trans, bp,
Linus Torvalds1da177e2005-04-16 15:20:36 -07002569 XFS_DA_LOGRANGE(leaf, entry, sizeof(*entry)));
2570 if ((entry->flags & XFS_ATTR_LOCAL) == 0) {
Dave Chinner517c2222013-04-24 18:58:55 +10002571 name_rmt = xfs_attr3_leaf_name_remote(leaf, args->index);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002572 name_rmt->valueblk = 0;
2573 name_rmt->valuelen = 0;
Dave Chinner1d9025e2012-06-22 18:50:14 +10002574 xfs_trans_log_buf(args->trans, bp,
Linus Torvalds1da177e2005-04-16 15:20:36 -07002575 XFS_DA_LOGRANGE(leaf, name_rmt, sizeof(*name_rmt)));
2576 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07002577
2578 /*
2579 * Commit the flag value change and start the next trans in series.
2580 */
Niv Sardi322ff6b2008-08-13 16:05:49 +10002581 return xfs_trans_roll(&args->trans, args->dp);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002582}
2583
2584/*
2585 * In a single transaction, clear the INCOMPLETE flag on the leaf entry
2586 * given by args->blkno/index and set the INCOMPLETE flag on the leaf
2587 * entry given by args->blkno2/index2.
2588 *
2589 * Note that they could be in different blocks, or in the same block.
2590 */
2591int
Dave Chinner517c2222013-04-24 18:58:55 +10002592xfs_attr3_leaf_flipflags(
2593 struct xfs_da_args *args)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002594{
Dave Chinner517c2222013-04-24 18:58:55 +10002595 struct xfs_attr_leafblock *leaf1;
2596 struct xfs_attr_leafblock *leaf2;
2597 struct xfs_attr_leaf_entry *entry1;
2598 struct xfs_attr_leaf_entry *entry2;
2599 struct xfs_attr_leaf_name_remote *name_rmt;
2600 struct xfs_buf *bp1;
2601 struct xfs_buf *bp2;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002602 int error;
2603#ifdef DEBUG
Dave Chinner517c2222013-04-24 18:58:55 +10002604 struct xfs_attr3_icleaf_hdr ichdr1;
2605 struct xfs_attr3_icleaf_hdr ichdr2;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002606 xfs_attr_leaf_name_local_t *name_loc;
2607 int namelen1, namelen2;
2608 char *name1, *name2;
2609#endif /* DEBUG */
2610
Dave Chinner5a5881c2012-03-22 05:15:13 +00002611 trace_xfs_attr_leaf_flipflags(args);
2612
Linus Torvalds1da177e2005-04-16 15:20:36 -07002613 /*
2614 * Read the block containing the "old" attr
2615 */
Dave Chinner517c2222013-04-24 18:58:55 +10002616 error = xfs_attr3_leaf_read(args->trans, args->dp, args->blkno, -1, &bp1);
Dave Chinnerad14c332012-11-12 22:54:16 +11002617 if (error)
2618 return error;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002619
2620 /*
2621 * Read the block containing the "new" attr, if it is different
2622 */
2623 if (args->blkno2 != args->blkno) {
Dave Chinner517c2222013-04-24 18:58:55 +10002624 error = xfs_attr3_leaf_read(args->trans, args->dp, args->blkno2,
Dave Chinnerad14c332012-11-12 22:54:16 +11002625 -1, &bp2);
2626 if (error)
2627 return error;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002628 } else {
2629 bp2 = bp1;
2630 }
2631
Dave Chinner1d9025e2012-06-22 18:50:14 +10002632 leaf1 = bp1->b_addr;
Dave Chinner517c2222013-04-24 18:58:55 +10002633 entry1 = &xfs_attr3_leaf_entryp(leaf1)[args->index];
Linus Torvalds1da177e2005-04-16 15:20:36 -07002634
Dave Chinner1d9025e2012-06-22 18:50:14 +10002635 leaf2 = bp2->b_addr;
Dave Chinner517c2222013-04-24 18:58:55 +10002636 entry2 = &xfs_attr3_leaf_entryp(leaf2)[args->index2];
Linus Torvalds1da177e2005-04-16 15:20:36 -07002637
2638#ifdef DEBUG
Dave Chinner517c2222013-04-24 18:58:55 +10002639 xfs_attr3_leaf_hdr_from_disk(&ichdr1, leaf1);
2640 ASSERT(args->index < ichdr1.count);
2641 ASSERT(args->index >= 0);
2642
2643 xfs_attr3_leaf_hdr_from_disk(&ichdr2, leaf2);
2644 ASSERT(args->index2 < ichdr2.count);
2645 ASSERT(args->index2 >= 0);
2646
Linus Torvalds1da177e2005-04-16 15:20:36 -07002647 if (entry1->flags & XFS_ATTR_LOCAL) {
Dave Chinner517c2222013-04-24 18:58:55 +10002648 name_loc = xfs_attr3_leaf_name_local(leaf1, args->index);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002649 namelen1 = name_loc->namelen;
2650 name1 = (char *)name_loc->nameval;
2651 } else {
Dave Chinner517c2222013-04-24 18:58:55 +10002652 name_rmt = xfs_attr3_leaf_name_remote(leaf1, args->index);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002653 namelen1 = name_rmt->namelen;
2654 name1 = (char *)name_rmt->name;
2655 }
2656 if (entry2->flags & XFS_ATTR_LOCAL) {
Dave Chinner517c2222013-04-24 18:58:55 +10002657 name_loc = xfs_attr3_leaf_name_local(leaf2, args->index2);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002658 namelen2 = name_loc->namelen;
2659 name2 = (char *)name_loc->nameval;
2660 } else {
Dave Chinner517c2222013-04-24 18:58:55 +10002661 name_rmt = xfs_attr3_leaf_name_remote(leaf2, args->index2);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002662 namelen2 = name_rmt->namelen;
2663 name2 = (char *)name_rmt->name;
2664 }
Nathan Scott6b19f2d2006-03-17 17:29:02 +11002665 ASSERT(be32_to_cpu(entry1->hashval) == be32_to_cpu(entry2->hashval));
Linus Torvalds1da177e2005-04-16 15:20:36 -07002666 ASSERT(namelen1 == namelen2);
2667 ASSERT(memcmp(name1, name2, namelen1) == 0);
2668#endif /* DEBUG */
2669
2670 ASSERT(entry1->flags & XFS_ATTR_INCOMPLETE);
2671 ASSERT((entry2->flags & XFS_ATTR_INCOMPLETE) == 0);
2672
2673 entry1->flags &= ~XFS_ATTR_INCOMPLETE;
Dave Chinner1d9025e2012-06-22 18:50:14 +10002674 xfs_trans_log_buf(args->trans, bp1,
Linus Torvalds1da177e2005-04-16 15:20:36 -07002675 XFS_DA_LOGRANGE(leaf1, entry1, sizeof(*entry1)));
2676 if (args->rmtblkno) {
2677 ASSERT((entry1->flags & XFS_ATTR_LOCAL) == 0);
Dave Chinner517c2222013-04-24 18:58:55 +10002678 name_rmt = xfs_attr3_leaf_name_remote(leaf1, args->index);
Nathan Scottc0f054e2006-03-17 17:29:18 +11002679 name_rmt->valueblk = cpu_to_be32(args->rmtblkno);
2680 name_rmt->valuelen = cpu_to_be32(args->valuelen);
Dave Chinner1d9025e2012-06-22 18:50:14 +10002681 xfs_trans_log_buf(args->trans, bp1,
Linus Torvalds1da177e2005-04-16 15:20:36 -07002682 XFS_DA_LOGRANGE(leaf1, name_rmt, sizeof(*name_rmt)));
2683 }
2684
2685 entry2->flags |= XFS_ATTR_INCOMPLETE;
Dave Chinner1d9025e2012-06-22 18:50:14 +10002686 xfs_trans_log_buf(args->trans, bp2,
Linus Torvalds1da177e2005-04-16 15:20:36 -07002687 XFS_DA_LOGRANGE(leaf2, entry2, sizeof(*entry2)));
2688 if ((entry2->flags & XFS_ATTR_LOCAL) == 0) {
Dave Chinner517c2222013-04-24 18:58:55 +10002689 name_rmt = xfs_attr3_leaf_name_remote(leaf2, args->index2);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002690 name_rmt->valueblk = 0;
2691 name_rmt->valuelen = 0;
Dave Chinner1d9025e2012-06-22 18:50:14 +10002692 xfs_trans_log_buf(args->trans, bp2,
Linus Torvalds1da177e2005-04-16 15:20:36 -07002693 XFS_DA_LOGRANGE(leaf2, name_rmt, sizeof(*name_rmt)));
2694 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07002695
2696 /*
2697 * Commit the flag value change and start the next trans in series.
2698 */
Niv Sardi322ff6b2008-08-13 16:05:49 +10002699 error = xfs_trans_roll(&args->trans, args->dp);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002700
Dave Chinner517c2222013-04-24 18:58:55 +10002701 return error;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002702}