blob: 7b126f46a2f99689cf0bee0efba6c026c0e23186 [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)) {
216 XFS_CORRUPTION_ERROR(__func__, XFS_ERRLEVEL_LOW, mp, bp->b_addr);
217 xfs_buf_ioerror(bp, EFSCORRUPTED);
218 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
227 xfs_update_cksum(bp->b_addr, BBTOB(bp->b_length), XFS_ATTR3_LEAF_CRC_OFF);
228}
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
242 if ((xfs_sb_version_hascrc(&mp->m_sb) &&
243 !xfs_verify_cksum(bp->b_addr, BBTOB(bp->b_length),
244 XFS_ATTR3_LEAF_CRC_OFF)) ||
245 !xfs_attr3_leaf_verify(bp)) {
246 XFS_CORRUPTION_ERROR(__func__, XFS_ERRLEVEL_LOW, mp, bp->b_addr);
Dave Chinnerad14c332012-11-12 22:54:16 +1100247 xfs_buf_ioerror(bp, EFSCORRUPTED);
248 }
Dave Chinner612cfbf2012-11-14 17:52:32 +1100249}
Dave Chinnerad14c332012-11-12 22:54:16 +1100250
Dave Chinner517c2222013-04-24 18:58:55 +1000251const struct xfs_buf_ops xfs_attr3_leaf_buf_ops = {
252 .verify_read = xfs_attr3_leaf_read_verify,
253 .verify_write = xfs_attr3_leaf_write_verify,
Dave Chinner1813dd62012-11-14 17:54:40 +1100254};
Dave Chinner612cfbf2012-11-14 17:52:32 +1100255
Dave Chinnerad14c332012-11-12 22:54:16 +1100256int
Dave Chinner517c2222013-04-24 18:58:55 +1000257xfs_attr3_leaf_read(
Dave Chinnerad14c332012-11-12 22:54:16 +1100258 struct xfs_trans *tp,
259 struct xfs_inode *dp,
260 xfs_dablk_t bno,
261 xfs_daddr_t mappedbno,
262 struct xfs_buf **bpp)
263{
Dave Chinnerd75afeb2013-04-03 16:11:29 +1100264 int err;
265
266 err = xfs_da_read_buf(tp, dp, bno, mappedbno, bpp,
Dave Chinner517c2222013-04-24 18:58:55 +1000267 XFS_ATTR_FORK, &xfs_attr3_leaf_buf_ops);
Dave Chinnerd75afeb2013-04-03 16:11:29 +1100268 if (!err && tp)
Dave Chinner61fe1352013-04-03 16:11:30 +1100269 xfs_trans_buf_set_type(tp, *bpp, XFS_BLFT_ATTR_LEAF_BUF);
Dave Chinnerd75afeb2013-04-03 16:11:29 +1100270 return err;
Dave Chinnerad14c332012-11-12 22:54:16 +1100271}
272
Tim Shimmin726801b2006-09-28 11:01:37 +1000273/*========================================================================
274 * Namespace helper routines
275 *========================================================================*/
276
Tim Shimmin726801b2006-09-28 11:01:37 +1000277/*
278 * If namespace bits don't match return 0.
279 * If all match then return 1.
280 */
Christoph Hellwigb8f82a42009-11-14 16:17:22 +0000281STATIC int
Tim Shimmin726801b2006-09-28 11:01:37 +1000282xfs_attr_namesp_match(int arg_flags, int ondisk_flags)
283{
284 return XFS_ATTR_NSP_ONDISK(ondisk_flags) == XFS_ATTR_NSP_ARGS_TO_ONDISK(arg_flags);
285}
286
Linus Torvalds1da177e2005-04-16 15:20:36 -0700287
288/*========================================================================
Nathan Scottd8cc8902005-11-02 10:34:53 +1100289 * External routines when attribute fork size < XFS_LITINO(mp).
Linus Torvalds1da177e2005-04-16 15:20:36 -0700290 *========================================================================*/
291
292/*
Nathan Scottd8cc8902005-11-02 10:34:53 +1100293 * Query whether the requested number of additional bytes of extended
294 * attribute space will be able to fit inline.
Christoph Hellwig4c393a62011-11-19 17:44:30 +0000295 *
Nathan Scottd8cc8902005-11-02 10:34:53 +1100296 * Returns zero if not, else the di_forkoff fork offset to be used in the
297 * literal area for attribute data once the new bytes have been added.
298 *
299 * di_forkoff must be 8 byte aligned, hence is stored as a >>3 value;
300 * special case for dev/uuid inodes, they have fixed size data forks.
301 */
302int
303xfs_attr_shortform_bytesfit(xfs_inode_t *dp, int bytes)
304{
305 int offset;
306 int minforkoff; /* lower limit on valid forkoff locations */
307 int maxforkoff; /* upper limit on valid forkoff locations */
Christoph Hellwig4c393a62011-11-19 17:44:30 +0000308 int dsize;
Nathan Scottd8cc8902005-11-02 10:34:53 +1100309 xfs_mount_t *mp = dp->i_mount;
310
Christoph Hellwig56cea2d2013-03-12 23:30:36 +1100311 /* rounded down */
312 offset = (XFS_LITINO(mp, dp->i_d.di_version) - bytes) >> 3;
Nathan Scottd8cc8902005-11-02 10:34:53 +1100313
314 switch (dp->i_d.di_format) {
315 case XFS_DINODE_FMT_DEV:
316 minforkoff = roundup(sizeof(xfs_dev_t), 8) >> 3;
317 return (offset >= minforkoff) ? minforkoff : 0;
318 case XFS_DINODE_FMT_UUID:
319 minforkoff = roundup(sizeof(uuid_t), 8) >> 3;
320 return (offset >= minforkoff) ? minforkoff : 0;
321 }
322
Christoph Hellwig4c393a62011-11-19 17:44:30 +0000323 /*
324 * If the requested numbers of bytes is smaller or equal to the
325 * current attribute fork size we can always proceed.
326 *
327 * Note that if_bytes in the data fork might actually be larger than
328 * the current data fork size is due to delalloc extents. In that
329 * case either the extent count will go down when they are converted
330 * to real extents, or the delalloc conversion will take care of the
331 * literal area rebalancing.
332 */
333 if (bytes <= XFS_IFORK_ASIZE(dp))
334 return dp->i_d.di_forkoff;
335
336 /*
337 * For attr2 we can try to move the forkoff if there is space in the
338 * literal area, but for the old format we are done if there is no
339 * space in the fixed attribute fork.
340 */
341 if (!(mp->m_flags & XFS_MOUNT_ATTR2))
Nathan Scottda087ba2005-11-02 15:00:20 +1100342 return 0;
Nathan Scottda087ba2005-11-02 15:00:20 +1100343
Barry Naujoke5889e92007-02-10 18:35:58 +1100344 dsize = dp->i_df.if_bytes;
Christoph Hellwig4c393a62011-11-19 17:44:30 +0000345
Barry Naujoke5889e92007-02-10 18:35:58 +1100346 switch (dp->i_d.di_format) {
347 case XFS_DINODE_FMT_EXTENTS:
Christoph Hellwig4c393a62011-11-19 17:44:30 +0000348 /*
Barry Naujoke5889e92007-02-10 18:35:58 +1100349 * If there is no attr fork and the data fork is extents,
Christoph Hellwig4c393a62011-11-19 17:44:30 +0000350 * determine if creating the default attr fork will result
351 * in the extents form migrating to btree. If so, the
352 * minimum offset only needs to be the space required for
Barry Naujoke5889e92007-02-10 18:35:58 +1100353 * the btree root.
Christoph Hellwig4c393a62011-11-19 17:44:30 +0000354 */
Christoph Hellwig1a5902c2009-03-29 19:26:46 +0200355 if (!dp->i_d.di_forkoff && dp->i_df.if_bytes >
356 xfs_default_attroffset(dp))
Barry Naujoke5889e92007-02-10 18:35:58 +1100357 dsize = XFS_BMDR_SPACE_CALC(MINDBTPTRS);
358 break;
Barry Naujoke5889e92007-02-10 18:35:58 +1100359 case XFS_DINODE_FMT_BTREE:
360 /*
Christoph Hellwig4c393a62011-11-19 17:44:30 +0000361 * If we have a data btree then keep forkoff if we have one,
362 * otherwise we are adding a new attr, so then we set
363 * minforkoff to where the btree root can finish so we have
Barry Naujoke5889e92007-02-10 18:35:58 +1100364 * plenty of room for attrs
365 */
366 if (dp->i_d.di_forkoff) {
Christoph Hellwig4c393a62011-11-19 17:44:30 +0000367 if (offset < dp->i_d.di_forkoff)
Barry Naujoke5889e92007-02-10 18:35:58 +1100368 return 0;
Christoph Hellwig4c393a62011-11-19 17:44:30 +0000369 return dp->i_d.di_forkoff;
370 }
Christoph Hellwigee1a47a2013-04-21 14:53:46 -0500371 dsize = XFS_BMAP_BROOT_SPACE(mp, dp->i_df.if_broot);
Barry Naujoke5889e92007-02-10 18:35:58 +1100372 break;
373 }
Christoph Hellwig4c393a62011-11-19 17:44:30 +0000374
375 /*
376 * A data fork btree root must have space for at least
Barry Naujoke5889e92007-02-10 18:35:58 +1100377 * MINDBTPTRS key/ptr pairs if the data fork is small or empty.
378 */
379 minforkoff = MAX(dsize, XFS_BMDR_SPACE_CALC(MINDBTPTRS));
Nathan Scottd8cc8902005-11-02 10:34:53 +1100380 minforkoff = roundup(minforkoff, 8) >> 3;
381
382 /* attr fork btree root can have at least this many key/ptr pairs */
Christoph Hellwig56cea2d2013-03-12 23:30:36 +1100383 maxforkoff = XFS_LITINO(mp, dp->i_d.di_version) -
384 XFS_BMDR_SPACE_CALC(MINABTPTRS);
Nathan Scottd8cc8902005-11-02 10:34:53 +1100385 maxforkoff = maxforkoff >> 3; /* rounded down */
386
Nathan Scottd8cc8902005-11-02 10:34:53 +1100387 if (offset >= maxforkoff)
388 return maxforkoff;
Christoph Hellwig4c393a62011-11-19 17:44:30 +0000389 if (offset >= minforkoff)
390 return offset;
Nathan Scottd8cc8902005-11-02 10:34:53 +1100391 return 0;
392}
393
394/*
395 * Switch on the ATTR2 superblock bit (implies also FEATURES2)
396 */
397STATIC void
398xfs_sbversion_add_attr2(xfs_mount_t *mp, xfs_trans_t *tp)
399{
Nathan Scott13059ff2006-01-11 15:32:01 +1100400 if ((mp->m_flags & XFS_MOUNT_ATTR2) &&
Eric Sandeen62118702008-03-06 13:44:28 +1100401 !(xfs_sb_version_hasattr2(&mp->m_sb))) {
Eric Sandeen3685c2a2007-10-11 17:42:32 +1000402 spin_lock(&mp->m_sb_lock);
Eric Sandeen62118702008-03-06 13:44:28 +1100403 if (!xfs_sb_version_hasattr2(&mp->m_sb)) {
404 xfs_sb_version_addattr2(&mp->m_sb);
Eric Sandeen3685c2a2007-10-11 17:42:32 +1000405 spin_unlock(&mp->m_sb_lock);
Nathan Scottd8cc8902005-11-02 10:34:53 +1100406 xfs_mod_sb(tp, XFS_SB_VERSIONNUM | XFS_SB_FEATURES2);
407 } else
Eric Sandeen3685c2a2007-10-11 17:42:32 +1000408 spin_unlock(&mp->m_sb_lock);
Nathan Scottd8cc8902005-11-02 10:34:53 +1100409 }
410}
411
412/*
Linus Torvalds1da177e2005-04-16 15:20:36 -0700413 * Create the initial contents of a shortform attribute list.
414 */
Nathan Scottd8cc8902005-11-02 10:34:53 +1100415void
Linus Torvalds1da177e2005-04-16 15:20:36 -0700416xfs_attr_shortform_create(xfs_da_args_t *args)
417{
418 xfs_attr_sf_hdr_t *hdr;
419 xfs_inode_t *dp;
420 xfs_ifork_t *ifp;
421
Dave Chinner5a5881c2012-03-22 05:15:13 +0000422 trace_xfs_attr_sf_create(args);
423
Linus Torvalds1da177e2005-04-16 15:20:36 -0700424 dp = args->dp;
425 ASSERT(dp != NULL);
426 ifp = dp->i_afp;
427 ASSERT(ifp != NULL);
428 ASSERT(ifp->if_bytes == 0);
429 if (dp->i_d.di_aformat == XFS_DINODE_FMT_EXTENTS) {
430 ifp->if_flags &= ~XFS_IFEXTENTS; /* just in case */
431 dp->i_d.di_aformat = XFS_DINODE_FMT_LOCAL;
432 ifp->if_flags |= XFS_IFINLINE;
433 } else {
434 ASSERT(ifp->if_flags & XFS_IFINLINE);
435 }
436 xfs_idata_realloc(dp, sizeof(*hdr), XFS_ATTR_FORK);
437 hdr = (xfs_attr_sf_hdr_t *)ifp->if_u1.if_data;
438 hdr->count = 0;
Nathan Scott3b244aa2006-03-17 17:29:25 +1100439 hdr->totsize = cpu_to_be16(sizeof(*hdr));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700440 xfs_trans_log_inode(args->trans, dp, XFS_ILOG_CORE | XFS_ILOG_ADATA);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700441}
442
443/*
444 * Add a name/value pair to the shortform attribute list.
445 * Overflow from the inode has already been checked for.
446 */
Nathan Scottd8cc8902005-11-02 10:34:53 +1100447void
448xfs_attr_shortform_add(xfs_da_args_t *args, int forkoff)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700449{
450 xfs_attr_shortform_t *sf;
451 xfs_attr_sf_entry_t *sfe;
452 int i, offset, size;
Nathan Scottd8cc8902005-11-02 10:34:53 +1100453 xfs_mount_t *mp;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700454 xfs_inode_t *dp;
455 xfs_ifork_t *ifp;
456
Dave Chinner5a5881c2012-03-22 05:15:13 +0000457 trace_xfs_attr_sf_add(args);
458
Linus Torvalds1da177e2005-04-16 15:20:36 -0700459 dp = args->dp;
Nathan Scottd8cc8902005-11-02 10:34:53 +1100460 mp = dp->i_mount;
461 dp->i_d.di_forkoff = forkoff;
Nathan Scottd8cc8902005-11-02 10:34:53 +1100462
Linus Torvalds1da177e2005-04-16 15:20:36 -0700463 ifp = dp->i_afp;
464 ASSERT(ifp->if_flags & XFS_IFINLINE);
465 sf = (xfs_attr_shortform_t *)ifp->if_u1.if_data;
466 sfe = &sf->list[0];
Nathan Scott3b244aa2006-03-17 17:29:25 +1100467 for (i = 0; i < sf->hdr.count; sfe = XFS_ATTR_SF_NEXTENTRY(sfe), i++) {
Nathan Scottd8cc8902005-11-02 10:34:53 +1100468#ifdef DEBUG
Linus Torvalds1da177e2005-04-16 15:20:36 -0700469 if (sfe->namelen != args->namelen)
470 continue;
471 if (memcmp(args->name, sfe->nameval, args->namelen) != 0)
472 continue;
Tim Shimmin726801b2006-09-28 11:01:37 +1000473 if (!xfs_attr_namesp_match(args->flags, sfe->flags))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700474 continue;
Nathan Scottd8cc8902005-11-02 10:34:53 +1100475 ASSERT(0);
476#endif
Linus Torvalds1da177e2005-04-16 15:20:36 -0700477 }
478
479 offset = (char *)sfe - (char *)sf;
480 size = XFS_ATTR_SF_ENTSIZE_BYNAME(args->namelen, args->valuelen);
481 xfs_idata_realloc(dp, size, XFS_ATTR_FORK);
482 sf = (xfs_attr_shortform_t *)ifp->if_u1.if_data;
483 sfe = (xfs_attr_sf_entry_t *)((char *)sf + offset);
484
485 sfe->namelen = args->namelen;
Nathan Scott3b244aa2006-03-17 17:29:25 +1100486 sfe->valuelen = args->valuelen;
Tim Shimmin726801b2006-09-28 11:01:37 +1000487 sfe->flags = XFS_ATTR_NSP_ARGS_TO_ONDISK(args->flags);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700488 memcpy(sfe->nameval, args->name, args->namelen);
489 memcpy(&sfe->nameval[args->namelen], args->value, args->valuelen);
Nathan Scott3b244aa2006-03-17 17:29:25 +1100490 sf->hdr.count++;
Marcin Slusarz413d57c2008-02-13 15:03:29 -0800491 be16_add_cpu(&sf->hdr.totsize, size);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700492 xfs_trans_log_inode(args->trans, dp, XFS_ILOG_CORE | XFS_ILOG_ADATA);
493
Nathan Scottd8cc8902005-11-02 10:34:53 +1100494 xfs_sbversion_add_attr2(mp, args->trans);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700495}
496
497/*
Christoph Hellwige1486de2009-02-04 09:36:00 +0100498 * After the last attribute is removed revert to original inode format,
499 * making all literal area available to the data fork once more.
500 */
501STATIC void
502xfs_attr_fork_reset(
503 struct xfs_inode *ip,
504 struct xfs_trans *tp)
505{
506 xfs_idestroy_fork(ip, XFS_ATTR_FORK);
507 ip->i_d.di_forkoff = 0;
508 ip->i_d.di_aformat = XFS_DINODE_FMT_EXTENTS;
509
510 ASSERT(ip->i_d.di_anextents == 0);
511 ASSERT(ip->i_afp == NULL);
512
Christoph Hellwige1486de2009-02-04 09:36:00 +0100513 xfs_trans_log_inode(tp, ip, XFS_ILOG_CORE);
514}
515
516/*
Nathan Scottd8cc8902005-11-02 10:34:53 +1100517 * Remove an attribute from the shortform attribute list structure.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700518 */
519int
520xfs_attr_shortform_remove(xfs_da_args_t *args)
521{
522 xfs_attr_shortform_t *sf;
523 xfs_attr_sf_entry_t *sfe;
524 int base, size=0, end, totsize, i;
Nathan Scottd8cc8902005-11-02 10:34:53 +1100525 xfs_mount_t *mp;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700526 xfs_inode_t *dp;
527
Dave Chinner5a5881c2012-03-22 05:15:13 +0000528 trace_xfs_attr_sf_remove(args);
529
Linus Torvalds1da177e2005-04-16 15:20:36 -0700530 dp = args->dp;
Nathan Scottd8cc8902005-11-02 10:34:53 +1100531 mp = dp->i_mount;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700532 base = sizeof(xfs_attr_sf_hdr_t);
533 sf = (xfs_attr_shortform_t *)dp->i_afp->if_u1.if_data;
534 sfe = &sf->list[0];
Nathan Scott3b244aa2006-03-17 17:29:25 +1100535 end = sf->hdr.count;
Nathan Scottd8cc8902005-11-02 10:34:53 +1100536 for (i = 0; i < end; sfe = XFS_ATTR_SF_NEXTENTRY(sfe),
Linus Torvalds1da177e2005-04-16 15:20:36 -0700537 base += size, i++) {
538 size = XFS_ATTR_SF_ENTSIZE(sfe);
539 if (sfe->namelen != args->namelen)
540 continue;
541 if (memcmp(sfe->nameval, args->name, args->namelen) != 0)
542 continue;
Tim Shimmin726801b2006-09-28 11:01:37 +1000543 if (!xfs_attr_namesp_match(args->flags, sfe->flags))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700544 continue;
545 break;
546 }
Nathan Scottd8cc8902005-11-02 10:34:53 +1100547 if (i == end)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700548 return(XFS_ERROR(ENOATTR));
549
Nathan Scottd8cc8902005-11-02 10:34:53 +1100550 /*
551 * Fix up the attribute fork data, covering the hole
552 */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700553 end = base + size;
Nathan Scott3b244aa2006-03-17 17:29:25 +1100554 totsize = be16_to_cpu(sf->hdr.totsize);
Nathan Scottd8cc8902005-11-02 10:34:53 +1100555 if (end != totsize)
556 memmove(&((char *)sf)[base], &((char *)sf)[end], totsize - end);
Nathan Scott3b244aa2006-03-17 17:29:25 +1100557 sf->hdr.count--;
Marcin Slusarz413d57c2008-02-13 15:03:29 -0800558 be16_add_cpu(&sf->hdr.totsize, -size);
Nathan Scottd8cc8902005-11-02 10:34:53 +1100559
560 /*
561 * Fix up the start offset of the attribute fork
562 */
563 totsize -= size;
Barry Naujok6a178102008-05-21 16:42:05 +1000564 if (totsize == sizeof(xfs_attr_sf_hdr_t) &&
Christoph Hellwige1486de2009-02-04 09:36:00 +0100565 (mp->m_flags & XFS_MOUNT_ATTR2) &&
566 (dp->i_d.di_format != XFS_DINODE_FMT_BTREE) &&
567 !(args->op_flags & XFS_DA_OP_ADDNAME)) {
568 xfs_attr_fork_reset(dp, args->trans);
Nathan Scottd8cc8902005-11-02 10:34:53 +1100569 } else {
570 xfs_idata_realloc(dp, -size, XFS_ATTR_FORK);
571 dp->i_d.di_forkoff = xfs_attr_shortform_bytesfit(dp, totsize);
572 ASSERT(dp->i_d.di_forkoff);
Barry Naujok6a178102008-05-21 16:42:05 +1000573 ASSERT(totsize > sizeof(xfs_attr_sf_hdr_t) ||
574 (args->op_flags & XFS_DA_OP_ADDNAME) ||
575 !(mp->m_flags & XFS_MOUNT_ATTR2) ||
576 dp->i_d.di_format == XFS_DINODE_FMT_BTREE);
Nathan Scottd8cc8902005-11-02 10:34:53 +1100577 xfs_trans_log_inode(args->trans, dp,
578 XFS_ILOG_CORE | XFS_ILOG_ADATA);
579 }
580
581 xfs_sbversion_add_attr2(mp, args->trans);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700582
583 return(0);
584}
585
586/*
587 * Look up a name in a shortform attribute list structure.
588 */
589/*ARGSUSED*/
590int
591xfs_attr_shortform_lookup(xfs_da_args_t *args)
592{
593 xfs_attr_shortform_t *sf;
594 xfs_attr_sf_entry_t *sfe;
595 int i;
596 xfs_ifork_t *ifp;
597
Dave Chinner5a5881c2012-03-22 05:15:13 +0000598 trace_xfs_attr_sf_lookup(args);
599
Linus Torvalds1da177e2005-04-16 15:20:36 -0700600 ifp = args->dp->i_afp;
601 ASSERT(ifp->if_flags & XFS_IFINLINE);
602 sf = (xfs_attr_shortform_t *)ifp->if_u1.if_data;
603 sfe = &sf->list[0];
Nathan Scott3b244aa2006-03-17 17:29:25 +1100604 for (i = 0; i < sf->hdr.count;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700605 sfe = XFS_ATTR_SF_NEXTENTRY(sfe), i++) {
606 if (sfe->namelen != args->namelen)
607 continue;
608 if (memcmp(args->name, sfe->nameval, args->namelen) != 0)
609 continue;
Tim Shimmin726801b2006-09-28 11:01:37 +1000610 if (!xfs_attr_namesp_match(args->flags, sfe->flags))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700611 continue;
612 return(XFS_ERROR(EEXIST));
613 }
614 return(XFS_ERROR(ENOATTR));
615}
616
617/*
618 * Look up a name in a shortform attribute list structure.
619 */
620/*ARGSUSED*/
621int
622xfs_attr_shortform_getvalue(xfs_da_args_t *args)
623{
624 xfs_attr_shortform_t *sf;
625 xfs_attr_sf_entry_t *sfe;
626 int i;
627
Eric Sandeen914ed442012-03-30 11:24:11 -0500628 ASSERT(args->dp->i_afp->if_flags == XFS_IFINLINE);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700629 sf = (xfs_attr_shortform_t *)args->dp->i_afp->if_u1.if_data;
630 sfe = &sf->list[0];
Nathan Scott3b244aa2006-03-17 17:29:25 +1100631 for (i = 0; i < sf->hdr.count;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700632 sfe = XFS_ATTR_SF_NEXTENTRY(sfe), i++) {
633 if (sfe->namelen != args->namelen)
634 continue;
635 if (memcmp(args->name, sfe->nameval, args->namelen) != 0)
636 continue;
Tim Shimmin726801b2006-09-28 11:01:37 +1000637 if (!xfs_attr_namesp_match(args->flags, sfe->flags))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700638 continue;
639 if (args->flags & ATTR_KERNOVAL) {
Nathan Scott3b244aa2006-03-17 17:29:25 +1100640 args->valuelen = sfe->valuelen;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700641 return(XFS_ERROR(EEXIST));
642 }
Nathan Scott3b244aa2006-03-17 17:29:25 +1100643 if (args->valuelen < sfe->valuelen) {
644 args->valuelen = sfe->valuelen;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700645 return(XFS_ERROR(ERANGE));
646 }
Nathan Scott3b244aa2006-03-17 17:29:25 +1100647 args->valuelen = sfe->valuelen;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700648 memcpy(args->value, &sfe->nameval[args->namelen],
649 args->valuelen);
650 return(XFS_ERROR(EEXIST));
651 }
652 return(XFS_ERROR(ENOATTR));
653}
654
655/*
656 * Convert from using the shortform to the leaf.
657 */
658int
659xfs_attr_shortform_to_leaf(xfs_da_args_t *args)
660{
661 xfs_inode_t *dp;
662 xfs_attr_shortform_t *sf;
663 xfs_attr_sf_entry_t *sfe;
664 xfs_da_args_t nargs;
665 char *tmpbuffer;
666 int error, i, size;
667 xfs_dablk_t blkno;
Dave Chinner1d9025e2012-06-22 18:50:14 +1000668 struct xfs_buf *bp;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700669 xfs_ifork_t *ifp;
670
Dave Chinner5a5881c2012-03-22 05:15:13 +0000671 trace_xfs_attr_sf_to_leaf(args);
672
Linus Torvalds1da177e2005-04-16 15:20:36 -0700673 dp = args->dp;
674 ifp = dp->i_afp;
675 sf = (xfs_attr_shortform_t *)ifp->if_u1.if_data;
Nathan Scott3b244aa2006-03-17 17:29:25 +1100676 size = be16_to_cpu(sf->hdr.totsize);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700677 tmpbuffer = kmem_alloc(size, KM_SLEEP);
678 ASSERT(tmpbuffer != NULL);
679 memcpy(tmpbuffer, ifp->if_u1.if_data, size);
680 sf = (xfs_attr_shortform_t *)tmpbuffer;
681
682 xfs_idata_realloc(dp, -size, XFS_ATTR_FORK);
Dave Chinnerf3508bc2013-07-10 07:04:00 +1000683 xfs_bmap_local_to_extents_empty(dp, XFS_ATTR_FORK);
684
Linus Torvalds1da177e2005-04-16 15:20:36 -0700685 bp = NULL;
686 error = xfs_da_grow_inode(args, &blkno);
687 if (error) {
688 /*
689 * If we hit an IO error middle of the transaction inside
690 * grow_inode(), we may have inconsistent data. Bail out.
691 */
692 if (error == EIO)
693 goto out;
694 xfs_idata_realloc(dp, size, XFS_ATTR_FORK); /* try to put */
695 memcpy(ifp->if_u1.if_data, tmpbuffer, size); /* it back */
696 goto out;
697 }
698
699 ASSERT(blkno == 0);
Dave Chinner517c2222013-04-24 18:58:55 +1000700 error = xfs_attr3_leaf_create(args, blkno, &bp);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700701 if (error) {
702 error = xfs_da_shrink_inode(args, 0, bp);
703 bp = NULL;
704 if (error)
705 goto out;
706 xfs_idata_realloc(dp, size, XFS_ATTR_FORK); /* try to put */
707 memcpy(ifp->if_u1.if_data, tmpbuffer, size); /* it back */
708 goto out;
709 }
710
711 memset((char *)&nargs, 0, sizeof(nargs));
712 nargs.dp = dp;
713 nargs.firstblock = args->firstblock;
714 nargs.flist = args->flist;
715 nargs.total = args->total;
716 nargs.whichfork = XFS_ATTR_FORK;
717 nargs.trans = args->trans;
Barry Naujok6a178102008-05-21 16:42:05 +1000718 nargs.op_flags = XFS_DA_OP_OKNOENT;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700719
720 sfe = &sf->list[0];
Nathan Scott3b244aa2006-03-17 17:29:25 +1100721 for (i = 0; i < sf->hdr.count; i++) {
Dave Chinnera9273ca2010-01-20 10:47:48 +1100722 nargs.name = sfe->nameval;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700723 nargs.namelen = sfe->namelen;
Dave Chinnera9273ca2010-01-20 10:47:48 +1100724 nargs.value = &sfe->nameval[nargs.namelen];
Nathan Scott3b244aa2006-03-17 17:29:25 +1100725 nargs.valuelen = sfe->valuelen;
Dave Chinnera9273ca2010-01-20 10:47:48 +1100726 nargs.hashval = xfs_da_hashname(sfe->nameval,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700727 sfe->namelen);
Tim Shimmin726801b2006-09-28 11:01:37 +1000728 nargs.flags = XFS_ATTR_NSP_ONDISK_TO_ARGS(sfe->flags);
Dave Chinner517c2222013-04-24 18:58:55 +1000729 error = xfs_attr3_leaf_lookup_int(bp, &nargs); /* set a->index */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700730 ASSERT(error == ENOATTR);
Dave Chinner517c2222013-04-24 18:58:55 +1000731 error = xfs_attr3_leaf_add(bp, &nargs);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700732 ASSERT(error != ENOSPC);
733 if (error)
734 goto out;
735 sfe = XFS_ATTR_SF_NEXTENTRY(sfe);
736 }
737 error = 0;
738
739out:
Denys Vlasenkof0e2d932008-05-19 16:31:57 +1000740 kmem_free(tmpbuffer);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700741 return(error);
742}
743
Linus Torvalds1da177e2005-04-16 15:20:36 -0700744/*
745 * Check a leaf attribute block to see if all the entries would fit into
746 * a shortform attribute list.
747 */
748int
Dave Chinner1d9025e2012-06-22 18:50:14 +1000749xfs_attr_shortform_allfit(
Dave Chinnerb38958d2013-05-20 09:51:14 +1000750 struct xfs_buf *bp,
751 struct xfs_inode *dp)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700752{
Dave Chinnerb38958d2013-05-20 09:51:14 +1000753 struct xfs_attr_leafblock *leaf;
754 struct xfs_attr_leaf_entry *entry;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700755 xfs_attr_leaf_name_local_t *name_loc;
Dave Chinnerb38958d2013-05-20 09:51:14 +1000756 struct xfs_attr3_icleaf_hdr leafhdr;
757 int bytes;
758 int i;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700759
Dave Chinner1d9025e2012-06-22 18:50:14 +1000760 leaf = bp->b_addr;
Dave Chinnerb38958d2013-05-20 09:51:14 +1000761 xfs_attr3_leaf_hdr_from_disk(&leafhdr, leaf);
762 entry = xfs_attr3_leaf_entryp(leaf);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700763
Linus Torvalds1da177e2005-04-16 15:20:36 -0700764 bytes = sizeof(struct xfs_attr_sf_hdr);
Dave Chinnerb38958d2013-05-20 09:51:14 +1000765 for (i = 0; i < leafhdr.count; entry++, i++) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700766 if (entry->flags & XFS_ATTR_INCOMPLETE)
767 continue; /* don't copy partial entries */
768 if (!(entry->flags & XFS_ATTR_LOCAL))
769 return(0);
Dave Chinner517c2222013-04-24 18:58:55 +1000770 name_loc = xfs_attr3_leaf_name_local(leaf, i);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700771 if (name_loc->namelen >= XFS_ATTR_SF_ENTSIZE_MAX)
772 return(0);
Nathan Scott053b5752006-03-17 17:29:09 +1100773 if (be16_to_cpu(name_loc->valuelen) >= XFS_ATTR_SF_ENTSIZE_MAX)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700774 return(0);
Dave Chinnerb38958d2013-05-20 09:51:14 +1000775 bytes += sizeof(struct xfs_attr_sf_entry) - 1
Linus Torvalds1da177e2005-04-16 15:20:36 -0700776 + name_loc->namelen
Nathan Scott053b5752006-03-17 17:29:09 +1100777 + be16_to_cpu(name_loc->valuelen);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700778 }
Nathan Scott13059ff2006-01-11 15:32:01 +1100779 if ((dp->i_mount->m_flags & XFS_MOUNT_ATTR2) &&
Barry Naujoke5889e92007-02-10 18:35:58 +1100780 (dp->i_d.di_format != XFS_DINODE_FMT_BTREE) &&
Nathan Scotte0144ca2005-11-25 16:42:22 +1100781 (bytes == sizeof(struct xfs_attr_sf_hdr)))
Dave Chinnerb38958d2013-05-20 09:51:14 +1000782 return -1;
783 return xfs_attr_shortform_bytesfit(dp, bytes);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700784}
785
786/*
787 * Convert a leaf attribute list to shortform attribute list
788 */
789int
Dave Chinner517c2222013-04-24 18:58:55 +1000790xfs_attr3_leaf_to_shortform(
791 struct xfs_buf *bp,
792 struct xfs_da_args *args,
793 int forkoff)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700794{
Dave Chinner517c2222013-04-24 18:58:55 +1000795 struct xfs_attr_leafblock *leaf;
796 struct xfs_attr3_icleaf_hdr ichdr;
797 struct xfs_attr_leaf_entry *entry;
798 struct xfs_attr_leaf_name_local *name_loc;
799 struct xfs_da_args nargs;
800 struct xfs_inode *dp = args->dp;
801 char *tmpbuffer;
802 int error;
803 int i;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700804
Dave Chinner5a5881c2012-03-22 05:15:13 +0000805 trace_xfs_attr_leaf_to_sf(args);
806
Linus Torvalds1da177e2005-04-16 15:20:36 -0700807 tmpbuffer = kmem_alloc(XFS_LBSIZE(dp->i_mount), KM_SLEEP);
Dave Chinner517c2222013-04-24 18:58:55 +1000808 if (!tmpbuffer)
809 return ENOMEM;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700810
Dave Chinner1d9025e2012-06-22 18:50:14 +1000811 memcpy(tmpbuffer, bp->b_addr, XFS_LBSIZE(dp->i_mount));
Dave Chinner517c2222013-04-24 18:58:55 +1000812
Linus Torvalds1da177e2005-04-16 15:20:36 -0700813 leaf = (xfs_attr_leafblock_t *)tmpbuffer;
Dave Chinner517c2222013-04-24 18:58:55 +1000814 xfs_attr3_leaf_hdr_from_disk(&ichdr, leaf);
815 entry = xfs_attr3_leaf_entryp(leaf);
816
817 /* XXX (dgc): buffer is about to be marked stale - why zero it? */
Dave Chinner1d9025e2012-06-22 18:50:14 +1000818 memset(bp->b_addr, 0, XFS_LBSIZE(dp->i_mount));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700819
820 /*
821 * Clean out the prior contents of the attribute list.
822 */
823 error = xfs_da_shrink_inode(args, 0, bp);
824 if (error)
825 goto out;
Nathan Scottd8cc8902005-11-02 10:34:53 +1100826
827 if (forkoff == -1) {
Nathan Scott13059ff2006-01-11 15:32:01 +1100828 ASSERT(dp->i_mount->m_flags & XFS_MOUNT_ATTR2);
Barry Naujoke5889e92007-02-10 18:35:58 +1100829 ASSERT(dp->i_d.di_format != XFS_DINODE_FMT_BTREE);
Christoph Hellwige1486de2009-02-04 09:36:00 +0100830 xfs_attr_fork_reset(dp, args->trans);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700831 goto out;
Nathan Scottd8cc8902005-11-02 10:34:53 +1100832 }
833
834 xfs_attr_shortform_create(args);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700835
836 /*
837 * Copy the attributes
838 */
839 memset((char *)&nargs, 0, sizeof(nargs));
840 nargs.dp = dp;
841 nargs.firstblock = args->firstblock;
842 nargs.flist = args->flist;
843 nargs.total = args->total;
844 nargs.whichfork = XFS_ATTR_FORK;
845 nargs.trans = args->trans;
Barry Naujok6a178102008-05-21 16:42:05 +1000846 nargs.op_flags = XFS_DA_OP_OKNOENT;
Dave Chinner517c2222013-04-24 18:58:55 +1000847
848 for (i = 0; i < ichdr.count; entry++, i++) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700849 if (entry->flags & XFS_ATTR_INCOMPLETE)
850 continue; /* don't copy partial entries */
851 if (!entry->nameidx)
852 continue;
853 ASSERT(entry->flags & XFS_ATTR_LOCAL);
Dave Chinner517c2222013-04-24 18:58:55 +1000854 name_loc = xfs_attr3_leaf_name_local(leaf, i);
Dave Chinnera9273ca2010-01-20 10:47:48 +1100855 nargs.name = name_loc->nameval;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700856 nargs.namelen = name_loc->namelen;
Dave Chinnera9273ca2010-01-20 10:47:48 +1100857 nargs.value = &name_loc->nameval[nargs.namelen];
Nathan Scott053b5752006-03-17 17:29:09 +1100858 nargs.valuelen = be16_to_cpu(name_loc->valuelen);
Nathan Scott6b19f2d2006-03-17 17:29:02 +1100859 nargs.hashval = be32_to_cpu(entry->hashval);
Tim Shimmin726801b2006-09-28 11:01:37 +1000860 nargs.flags = XFS_ATTR_NSP_ONDISK_TO_ARGS(entry->flags);
Nathan Scottd8cc8902005-11-02 10:34:53 +1100861 xfs_attr_shortform_add(&nargs, forkoff);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700862 }
863 error = 0;
864
865out:
Denys Vlasenkof0e2d932008-05-19 16:31:57 +1000866 kmem_free(tmpbuffer);
Dave Chinner517c2222013-04-24 18:58:55 +1000867 return error;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700868}
869
870/*
871 * Convert from using a single leaf to a root node and a leaf.
872 */
873int
Dave Chinner517c2222013-04-24 18:58:55 +1000874xfs_attr3_leaf_to_node(
875 struct xfs_da_args *args)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700876{
Dave Chinner517c2222013-04-24 18:58:55 +1000877 struct xfs_attr_leafblock *leaf;
878 struct xfs_attr3_icleaf_hdr icleafhdr;
879 struct xfs_attr_leaf_entry *entries;
Dave Chinnerf5ea1102013-04-24 18:58:02 +1000880 struct xfs_da_node_entry *btree;
Dave Chinner517c2222013-04-24 18:58:55 +1000881 struct xfs_da3_icnode_hdr icnodehdr;
882 struct xfs_da_intnode *node;
883 struct xfs_inode *dp = args->dp;
884 struct xfs_mount *mp = dp->i_mount;
885 struct xfs_buf *bp1 = NULL;
886 struct xfs_buf *bp2 = NULL;
887 xfs_dablk_t blkno;
888 int error;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700889
Dave Chinner5a5881c2012-03-22 05:15:13 +0000890 trace_xfs_attr_leaf_to_node(args);
891
Linus Torvalds1da177e2005-04-16 15:20:36 -0700892 error = xfs_da_grow_inode(args, &blkno);
893 if (error)
894 goto out;
Dave Chinner517c2222013-04-24 18:58:55 +1000895 error = xfs_attr3_leaf_read(args->trans, dp, 0, -1, &bp1);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700896 if (error)
897 goto out;
Dave Chinnerad14c332012-11-12 22:54:16 +1100898
Dave Chinner517c2222013-04-24 18:58:55 +1000899 error = xfs_da_get_buf(args->trans, dp, blkno, -1, &bp2, XFS_ATTR_FORK);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700900 if (error)
901 goto out;
Dave Chinner517c2222013-04-24 18:58:55 +1000902
903 /* copy leaf to new buffer, update identifiers */
Dave Chinner61fe1352013-04-03 16:11:30 +1100904 xfs_trans_buf_set_type(args->trans, bp2, XFS_BLFT_ATTR_LEAF_BUF);
Dave Chinner1813dd62012-11-14 17:54:40 +1100905 bp2->b_ops = bp1->b_ops;
Dave Chinner517c2222013-04-24 18:58:55 +1000906 memcpy(bp2->b_addr, bp1->b_addr, XFS_LBSIZE(mp));
907 if (xfs_sb_version_hascrc(&mp->m_sb)) {
908 struct xfs_da3_blkinfo *hdr3 = bp2->b_addr;
909 hdr3->blkno = cpu_to_be64(bp2->b_bn);
910 }
911 xfs_trans_log_buf(args->trans, bp2, 0, XFS_LBSIZE(mp) - 1);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700912
913 /*
914 * Set up the new root node.
915 */
Dave Chinnerf5ea1102013-04-24 18:58:02 +1000916 error = xfs_da3_node_create(args, 0, 1, &bp1, XFS_ATTR_FORK);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700917 if (error)
918 goto out;
Dave Chinner1d9025e2012-06-22 18:50:14 +1000919 node = bp1->b_addr;
Dave Chinner01ba43b2013-10-29 22:11:52 +1100920 dp->d_ops->node_hdr_from_disk(&icnodehdr, node);
Dave Chinner4bceb182013-10-29 22:11:51 +1100921 btree = dp->d_ops->node_tree_p(node);
Dave Chinner517c2222013-04-24 18:58:55 +1000922
923 leaf = bp2->b_addr;
924 xfs_attr3_leaf_hdr_from_disk(&icleafhdr, leaf);
925 entries = xfs_attr3_leaf_entryp(leaf);
926
927 /* both on-disk, don't endian-flip twice */
928 btree[0].hashval = entries[icleafhdr.count - 1].hashval;
Dave Chinnerf5ea1102013-04-24 18:58:02 +1000929 btree[0].before = cpu_to_be32(blkno);
Dave Chinner517c2222013-04-24 18:58:55 +1000930 icnodehdr.count = 1;
Dave Chinner01ba43b2013-10-29 22:11:52 +1100931 dp->d_ops->node_hdr_to_disk(node, &icnodehdr);
Dave Chinner517c2222013-04-24 18:58:55 +1000932 xfs_trans_log_buf(args->trans, bp1, 0, XFS_LBSIZE(mp) - 1);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700933 error = 0;
934out:
Dave Chinner517c2222013-04-24 18:58:55 +1000935 return error;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700936}
937
Linus Torvalds1da177e2005-04-16 15:20:36 -0700938/*========================================================================
939 * Routines used for growing the Btree.
940 *========================================================================*/
941
942/*
943 * Create the initial contents of a leaf attribute list
944 * or a leaf in a node attribute list.
945 */
Christoph Hellwigba0f32d2005-06-21 15:36:52 +1000946STATIC int
Dave Chinner517c2222013-04-24 18:58:55 +1000947xfs_attr3_leaf_create(
948 struct xfs_da_args *args,
949 xfs_dablk_t blkno,
950 struct xfs_buf **bpp)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700951{
Dave Chinner517c2222013-04-24 18:58:55 +1000952 struct xfs_attr_leafblock *leaf;
953 struct xfs_attr3_icleaf_hdr ichdr;
954 struct xfs_inode *dp = args->dp;
955 struct xfs_mount *mp = dp->i_mount;
956 struct xfs_buf *bp;
957 int error;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700958
Dave Chinner5a5881c2012-03-22 05:15:13 +0000959 trace_xfs_attr_leaf_create(args);
960
Linus Torvalds1da177e2005-04-16 15:20:36 -0700961 error = xfs_da_get_buf(args->trans, args->dp, blkno, -1, &bp,
962 XFS_ATTR_FORK);
963 if (error)
Dave Chinner517c2222013-04-24 18:58:55 +1000964 return error;
965 bp->b_ops = &xfs_attr3_leaf_buf_ops;
Dave Chinner61fe1352013-04-03 16:11:30 +1100966 xfs_trans_buf_set_type(args->trans, bp, XFS_BLFT_ATTR_LEAF_BUF);
Dave Chinner1d9025e2012-06-22 18:50:14 +1000967 leaf = bp->b_addr;
Dave Chinner517c2222013-04-24 18:58:55 +1000968 memset(leaf, 0, XFS_LBSIZE(mp));
969
970 memset(&ichdr, 0, sizeof(ichdr));
971 ichdr.firstused = XFS_LBSIZE(mp);
972
973 if (xfs_sb_version_hascrc(&mp->m_sb)) {
974 struct xfs_da3_blkinfo *hdr3 = bp->b_addr;
975
976 ichdr.magic = XFS_ATTR3_LEAF_MAGIC;
977
978 hdr3->blkno = cpu_to_be64(bp->b_bn);
979 hdr3->owner = cpu_to_be64(dp->i_ino);
980 uuid_copy(&hdr3->uuid, &mp->m_sb.sb_uuid);
981
982 ichdr.freemap[0].base = sizeof(struct xfs_attr3_leaf_hdr);
983 } else {
984 ichdr.magic = XFS_ATTR_LEAF_MAGIC;
985 ichdr.freemap[0].base = sizeof(struct xfs_attr_leaf_hdr);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700986 }
Dave Chinner517c2222013-04-24 18:58:55 +1000987 ichdr.freemap[0].size = ichdr.firstused - ichdr.freemap[0].base;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700988
Dave Chinner517c2222013-04-24 18:58:55 +1000989 xfs_attr3_leaf_hdr_to_disk(leaf, &ichdr);
990 xfs_trans_log_buf(args->trans, bp, 0, XFS_LBSIZE(mp) - 1);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700991
992 *bpp = bp;
Dave Chinner517c2222013-04-24 18:58:55 +1000993 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700994}
995
996/*
997 * Split the leaf node, rebalance, then add the new entry.
998 */
999int
Dave Chinner517c2222013-04-24 18:58:55 +10001000xfs_attr3_leaf_split(
1001 struct xfs_da_state *state,
1002 struct xfs_da_state_blk *oldblk,
1003 struct xfs_da_state_blk *newblk)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001004{
1005 xfs_dablk_t blkno;
1006 int error;
1007
Dave Chinner5a5881c2012-03-22 05:15:13 +00001008 trace_xfs_attr_leaf_split(state->args);
1009
Linus Torvalds1da177e2005-04-16 15:20:36 -07001010 /*
1011 * Allocate space for a new leaf node.
1012 */
1013 ASSERT(oldblk->magic == XFS_ATTR_LEAF_MAGIC);
1014 error = xfs_da_grow_inode(state->args, &blkno);
1015 if (error)
1016 return(error);
Dave Chinner517c2222013-04-24 18:58:55 +10001017 error = xfs_attr3_leaf_create(state->args, blkno, &newblk->bp);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001018 if (error)
1019 return(error);
1020 newblk->blkno = blkno;
1021 newblk->magic = XFS_ATTR_LEAF_MAGIC;
1022
1023 /*
1024 * Rebalance the entries across the two leaves.
1025 * NOTE: rebalance() currently depends on the 2nd block being empty.
1026 */
Dave Chinner517c2222013-04-24 18:58:55 +10001027 xfs_attr3_leaf_rebalance(state, oldblk, newblk);
Dave Chinnerf5ea1102013-04-24 18:58:02 +10001028 error = xfs_da3_blk_link(state, oldblk, newblk);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001029 if (error)
1030 return(error);
1031
1032 /*
1033 * Save info on "old" attribute for "atomic rename" ops, leaf_add()
1034 * modifies the index/blkno/rmtblk/rmtblkcnt fields to show the
1035 * "new" attrs info. Will need the "old" info to remove it later.
1036 *
1037 * Insert the "new" entry in the correct block.
1038 */
Dave Chinner5a5881c2012-03-22 05:15:13 +00001039 if (state->inleaf) {
1040 trace_xfs_attr_leaf_add_old(state->args);
Dave Chinner517c2222013-04-24 18:58:55 +10001041 error = xfs_attr3_leaf_add(oldblk->bp, state->args);
Dave Chinner5a5881c2012-03-22 05:15:13 +00001042 } else {
1043 trace_xfs_attr_leaf_add_new(state->args);
Dave Chinner517c2222013-04-24 18:58:55 +10001044 error = xfs_attr3_leaf_add(newblk->bp, state->args);
Dave Chinner5a5881c2012-03-22 05:15:13 +00001045 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07001046
1047 /*
1048 * Update last hashval in each block since we added the name.
1049 */
1050 oldblk->hashval = xfs_attr_leaf_lasthash(oldblk->bp, NULL);
1051 newblk->hashval = xfs_attr_leaf_lasthash(newblk->bp, NULL);
1052 return(error);
1053}
1054
1055/*
1056 * Add a name to the leaf attribute list structure.
1057 */
1058int
Dave Chinner517c2222013-04-24 18:58:55 +10001059xfs_attr3_leaf_add(
Dave Chinner1d9025e2012-06-22 18:50:14 +10001060 struct xfs_buf *bp,
1061 struct xfs_da_args *args)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001062{
Dave Chinner517c2222013-04-24 18:58:55 +10001063 struct xfs_attr_leafblock *leaf;
1064 struct xfs_attr3_icleaf_hdr ichdr;
1065 int tablesize;
1066 int entsize;
1067 int sum;
1068 int tmp;
1069 int i;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001070
Dave Chinner5a5881c2012-03-22 05:15:13 +00001071 trace_xfs_attr_leaf_add(args);
1072
Dave Chinner1d9025e2012-06-22 18:50:14 +10001073 leaf = bp->b_addr;
Dave Chinner517c2222013-04-24 18:58:55 +10001074 xfs_attr3_leaf_hdr_from_disk(&ichdr, leaf);
1075 ASSERT(args->index >= 0 && args->index <= ichdr.count);
Nathan Scottaa82daa2005-11-02 10:33:33 +11001076 entsize = xfs_attr_leaf_newentsize(args->namelen, args->valuelen,
Linus Torvalds1da177e2005-04-16 15:20:36 -07001077 args->trans->t_mountp->m_sb.sb_blocksize, NULL);
1078
1079 /*
1080 * Search through freemap for first-fit on new name length.
1081 * (may need to figure in size of entry struct too)
1082 */
Dave Chinner517c2222013-04-24 18:58:55 +10001083 tablesize = (ichdr.count + 1) * sizeof(xfs_attr_leaf_entry_t)
1084 + xfs_attr3_leaf_hdr_size(leaf);
1085 for (sum = 0, i = XFS_ATTR_LEAF_MAPSIZE - 1; i >= 0; i--) {
1086 if (tablesize > ichdr.firstused) {
1087 sum += ichdr.freemap[i].size;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001088 continue;
1089 }
Dave Chinner517c2222013-04-24 18:58:55 +10001090 if (!ichdr.freemap[i].size)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001091 continue; /* no space in this map */
1092 tmp = entsize;
Dave Chinner517c2222013-04-24 18:58:55 +10001093 if (ichdr.freemap[i].base < ichdr.firstused)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001094 tmp += sizeof(xfs_attr_leaf_entry_t);
Dave Chinner517c2222013-04-24 18:58:55 +10001095 if (ichdr.freemap[i].size >= tmp) {
1096 tmp = xfs_attr3_leaf_add_work(bp, &ichdr, args, i);
1097 goto out_log_hdr;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001098 }
Dave Chinner517c2222013-04-24 18:58:55 +10001099 sum += ichdr.freemap[i].size;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001100 }
1101
1102 /*
1103 * If there are no holes in the address space of the block,
1104 * and we don't have enough freespace, then compaction will do us
1105 * no good and we should just give up.
1106 */
Dave Chinner517c2222013-04-24 18:58:55 +10001107 if (!ichdr.holes && sum < entsize)
1108 return XFS_ERROR(ENOSPC);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001109
1110 /*
1111 * Compact the entries to coalesce free space.
1112 * This may change the hdr->count via dropping INCOMPLETE entries.
1113 */
Dave Chinner517c2222013-04-24 18:58:55 +10001114 xfs_attr3_leaf_compact(args, &ichdr, bp);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001115
1116 /*
1117 * After compaction, the block is guaranteed to have only one
1118 * free region, in freemap[0]. If it is not big enough, give up.
1119 */
Dave Chinner517c2222013-04-24 18:58:55 +10001120 if (ichdr.freemap[0].size < (entsize + sizeof(xfs_attr_leaf_entry_t))) {
1121 tmp = ENOSPC;
1122 goto out_log_hdr;
1123 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07001124
Dave Chinner517c2222013-04-24 18:58:55 +10001125 tmp = xfs_attr3_leaf_add_work(bp, &ichdr, args, 0);
1126
1127out_log_hdr:
1128 xfs_attr3_leaf_hdr_to_disk(leaf, &ichdr);
1129 xfs_trans_log_buf(args->trans, bp,
1130 XFS_DA_LOGRANGE(leaf, &leaf->hdr,
1131 xfs_attr3_leaf_hdr_size(leaf)));
1132 return tmp;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001133}
1134
1135/*
1136 * Add a name to a leaf attribute list structure.
1137 */
1138STATIC int
Dave Chinner517c2222013-04-24 18:58:55 +10001139xfs_attr3_leaf_add_work(
1140 struct xfs_buf *bp,
1141 struct xfs_attr3_icleaf_hdr *ichdr,
1142 struct xfs_da_args *args,
1143 int mapindex)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001144{
Dave Chinner517c2222013-04-24 18:58:55 +10001145 struct xfs_attr_leafblock *leaf;
1146 struct xfs_attr_leaf_entry *entry;
1147 struct xfs_attr_leaf_name_local *name_loc;
1148 struct xfs_attr_leaf_name_remote *name_rmt;
1149 struct xfs_mount *mp;
1150 int tmp;
1151 int i;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001152
Dave Chinneree732592012-11-12 22:53:53 +11001153 trace_xfs_attr_leaf_add_work(args);
1154
Dave Chinner1d9025e2012-06-22 18:50:14 +10001155 leaf = bp->b_addr;
Dave Chinner517c2222013-04-24 18:58:55 +10001156 ASSERT(mapindex >= 0 && mapindex < XFS_ATTR_LEAF_MAPSIZE);
1157 ASSERT(args->index >= 0 && args->index <= ichdr->count);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001158
1159 /*
1160 * Force open some space in the entry array and fill it in.
1161 */
Dave Chinner517c2222013-04-24 18:58:55 +10001162 entry = &xfs_attr3_leaf_entryp(leaf)[args->index];
1163 if (args->index < ichdr->count) {
1164 tmp = ichdr->count - args->index;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001165 tmp *= sizeof(xfs_attr_leaf_entry_t);
Dave Chinner517c2222013-04-24 18:58:55 +10001166 memmove(entry + 1, entry, tmp);
Dave Chinner1d9025e2012-06-22 18:50:14 +10001167 xfs_trans_log_buf(args->trans, bp,
Linus Torvalds1da177e2005-04-16 15:20:36 -07001168 XFS_DA_LOGRANGE(leaf, entry, tmp + sizeof(*entry)));
1169 }
Dave Chinner517c2222013-04-24 18:58:55 +10001170 ichdr->count++;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001171
1172 /*
1173 * Allocate space for the new string (at the end of the run).
1174 */
Linus Torvalds1da177e2005-04-16 15:20:36 -07001175 mp = args->trans->t_mountp;
Dave Chinner517c2222013-04-24 18:58:55 +10001176 ASSERT(ichdr->freemap[mapindex].base < XFS_LBSIZE(mp));
1177 ASSERT((ichdr->freemap[mapindex].base & 0x3) == 0);
1178 ASSERT(ichdr->freemap[mapindex].size >=
Nathan Scottaa82daa2005-11-02 10:33:33 +11001179 xfs_attr_leaf_newentsize(args->namelen, args->valuelen,
1180 mp->m_sb.sb_blocksize, NULL));
Dave Chinner517c2222013-04-24 18:58:55 +10001181 ASSERT(ichdr->freemap[mapindex].size < XFS_LBSIZE(mp));
1182 ASSERT((ichdr->freemap[mapindex].size & 0x3) == 0);
1183
1184 ichdr->freemap[mapindex].size -=
1185 xfs_attr_leaf_newentsize(args->namelen, args->valuelen,
1186 mp->m_sb.sb_blocksize, &tmp);
1187
1188 entry->nameidx = cpu_to_be16(ichdr->freemap[mapindex].base +
1189 ichdr->freemap[mapindex].size);
Nathan Scott6b19f2d2006-03-17 17:29:02 +11001190 entry->hashval = cpu_to_be32(args->hashval);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001191 entry->flags = tmp ? XFS_ATTR_LOCAL : 0;
Tim Shimmin726801b2006-09-28 11:01:37 +10001192 entry->flags |= XFS_ATTR_NSP_ARGS_TO_ONDISK(args->flags);
Barry Naujok6a178102008-05-21 16:42:05 +10001193 if (args->op_flags & XFS_DA_OP_RENAME) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07001194 entry->flags |= XFS_ATTR_INCOMPLETE;
1195 if ((args->blkno2 == args->blkno) &&
1196 (args->index2 <= args->index)) {
1197 args->index2++;
1198 }
1199 }
Dave Chinner1d9025e2012-06-22 18:50:14 +10001200 xfs_trans_log_buf(args->trans, bp,
Linus Torvalds1da177e2005-04-16 15:20:36 -07001201 XFS_DA_LOGRANGE(leaf, entry, sizeof(*entry)));
Nathan Scott6b19f2d2006-03-17 17:29:02 +11001202 ASSERT((args->index == 0) ||
1203 (be32_to_cpu(entry->hashval) >= be32_to_cpu((entry-1)->hashval)));
Dave Chinner517c2222013-04-24 18:58:55 +10001204 ASSERT((args->index == ichdr->count - 1) ||
Nathan Scott6b19f2d2006-03-17 17:29:02 +11001205 (be32_to_cpu(entry->hashval) <= be32_to_cpu((entry+1)->hashval)));
Linus Torvalds1da177e2005-04-16 15:20:36 -07001206
1207 /*
Linus Torvalds1da177e2005-04-16 15:20:36 -07001208 * For "remote" attribute values, simply note that we need to
1209 * allocate space for the "remote" value. We can't actually
1210 * allocate the extents in this transaction, and we can't decide
1211 * which blocks they should be as we might allocate more blocks
1212 * as part of this transaction (a split operation for example).
1213 */
1214 if (entry->flags & XFS_ATTR_LOCAL) {
Dave Chinner517c2222013-04-24 18:58:55 +10001215 name_loc = xfs_attr3_leaf_name_local(leaf, args->index);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001216 name_loc->namelen = args->namelen;
Nathan Scott053b5752006-03-17 17:29:09 +11001217 name_loc->valuelen = cpu_to_be16(args->valuelen);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001218 memcpy((char *)name_loc->nameval, args->name, args->namelen);
1219 memcpy((char *)&name_loc->nameval[args->namelen], args->value,
Nathan Scott053b5752006-03-17 17:29:09 +11001220 be16_to_cpu(name_loc->valuelen));
Linus Torvalds1da177e2005-04-16 15:20:36 -07001221 } else {
Dave Chinner517c2222013-04-24 18:58:55 +10001222 name_rmt = xfs_attr3_leaf_name_remote(leaf, args->index);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001223 name_rmt->namelen = args->namelen;
1224 memcpy((char *)name_rmt->name, args->name, args->namelen);
1225 entry->flags |= XFS_ATTR_INCOMPLETE;
1226 /* just in case */
1227 name_rmt->valuelen = 0;
1228 name_rmt->valueblk = 0;
1229 args->rmtblkno = 1;
Dave Chinnerad1858d2013-05-21 18:02:08 +10001230 args->rmtblkcnt = xfs_attr3_rmt_blocks(mp, args->valuelen);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001231 }
Dave Chinner1d9025e2012-06-22 18:50:14 +10001232 xfs_trans_log_buf(args->trans, bp,
Dave Chinner517c2222013-04-24 18:58:55 +10001233 XFS_DA_LOGRANGE(leaf, xfs_attr3_leaf_name(leaf, args->index),
Linus Torvalds1da177e2005-04-16 15:20:36 -07001234 xfs_attr_leaf_entsize(leaf, args->index)));
1235
1236 /*
1237 * Update the control info for this leaf node
1238 */
Dave Chinner517c2222013-04-24 18:58:55 +10001239 if (be16_to_cpu(entry->nameidx) < ichdr->firstused)
1240 ichdr->firstused = be16_to_cpu(entry->nameidx);
1241
1242 ASSERT(ichdr->firstused >= ichdr->count * sizeof(xfs_attr_leaf_entry_t)
1243 + xfs_attr3_leaf_hdr_size(leaf));
1244 tmp = (ichdr->count - 1) * sizeof(xfs_attr_leaf_entry_t)
1245 + xfs_attr3_leaf_hdr_size(leaf);
1246
1247 for (i = 0; i < XFS_ATTR_LEAF_MAPSIZE; i++) {
1248 if (ichdr->freemap[i].base == tmp) {
1249 ichdr->freemap[i].base += sizeof(xfs_attr_leaf_entry_t);
1250 ichdr->freemap[i].size -= sizeof(xfs_attr_leaf_entry_t);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001251 }
1252 }
Dave Chinner517c2222013-04-24 18:58:55 +10001253 ichdr->usedbytes += xfs_attr_leaf_entsize(leaf, args->index);
1254 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001255}
1256
1257/*
1258 * Garbage collect a leaf attribute list block by copying it to a new buffer.
1259 */
1260STATIC void
Dave Chinner517c2222013-04-24 18:58:55 +10001261xfs_attr3_leaf_compact(
Dave Chinneree732592012-11-12 22:53:53 +11001262 struct xfs_da_args *args,
Dave Chinnerd4c712b2013-05-21 18:02:06 +10001263 struct xfs_attr3_icleaf_hdr *ichdr_dst,
Dave Chinneree732592012-11-12 22:53:53 +11001264 struct xfs_buf *bp)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001265{
Dave Chinnerd4c712b2013-05-21 18:02:06 +10001266 struct xfs_attr_leafblock *leaf_src;
1267 struct xfs_attr_leafblock *leaf_dst;
1268 struct xfs_attr3_icleaf_hdr ichdr_src;
Dave Chinneree732592012-11-12 22:53:53 +11001269 struct xfs_trans *trans = args->trans;
1270 struct xfs_mount *mp = trans->t_mountp;
1271 char *tmpbuffer;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001272
Dave Chinneree732592012-11-12 22:53:53 +11001273 trace_xfs_attr_leaf_compact(args);
1274
Linus Torvalds1da177e2005-04-16 15:20:36 -07001275 tmpbuffer = kmem_alloc(XFS_LBSIZE(mp), KM_SLEEP);
Dave Chinner1d9025e2012-06-22 18:50:14 +10001276 memcpy(tmpbuffer, bp->b_addr, XFS_LBSIZE(mp));
1277 memset(bp->b_addr, 0, XFS_LBSIZE(mp));
Dave Chinnerd4c712b2013-05-21 18:02:06 +10001278 leaf_src = (xfs_attr_leafblock_t *)tmpbuffer;
1279 leaf_dst = bp->b_addr;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001280
1281 /*
Dave Chinnerd4c712b2013-05-21 18:02:06 +10001282 * Copy the on-disk header back into the destination buffer to ensure
1283 * all the information in the header that is not part of the incore
1284 * header structure is preserved.
Linus Torvalds1da177e2005-04-16 15:20:36 -07001285 */
Dave Chinnerd4c712b2013-05-21 18:02:06 +10001286 memcpy(bp->b_addr, tmpbuffer, xfs_attr3_leaf_hdr_size(leaf_src));
1287
1288 /* Initialise the incore headers */
1289 ichdr_src = *ichdr_dst; /* struct copy */
1290 ichdr_dst->firstused = XFS_LBSIZE(mp);
1291 ichdr_dst->usedbytes = 0;
1292 ichdr_dst->count = 0;
1293 ichdr_dst->holes = 0;
1294 ichdr_dst->freemap[0].base = xfs_attr3_leaf_hdr_size(leaf_src);
1295 ichdr_dst->freemap[0].size = ichdr_dst->firstused -
1296 ichdr_dst->freemap[0].base;
1297
Dave Chinnerd4c712b2013-05-21 18:02:06 +10001298 /* write the header back to initialise the underlying buffer */
1299 xfs_attr3_leaf_hdr_to_disk(leaf_dst, ichdr_dst);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001300
1301 /*
1302 * Copy all entry's in the same (sorted) order,
1303 * but allocate name/value pairs packed and in sequence.
1304 */
Dave Chinnerd4c712b2013-05-21 18:02:06 +10001305 xfs_attr3_leaf_moveents(leaf_src, &ichdr_src, 0, leaf_dst, ichdr_dst, 0,
1306 ichdr_src.count, mp);
Dave Chinner517c2222013-04-24 18:58:55 +10001307 /*
1308 * this logs the entire buffer, but the caller must write the header
1309 * back to the buffer when it is finished modifying it.
1310 */
Dave Chinner1d9025e2012-06-22 18:50:14 +10001311 xfs_trans_log_buf(trans, bp, 0, XFS_LBSIZE(mp) - 1);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001312
Denys Vlasenkof0e2d932008-05-19 16:31:57 +10001313 kmem_free(tmpbuffer);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001314}
1315
1316/*
Dave Chinner517c2222013-04-24 18:58:55 +10001317 * Compare two leaf blocks "order".
1318 * Return 0 unless leaf2 should go before leaf1.
1319 */
1320static int
1321xfs_attr3_leaf_order(
1322 struct xfs_buf *leaf1_bp,
1323 struct xfs_attr3_icleaf_hdr *leaf1hdr,
1324 struct xfs_buf *leaf2_bp,
1325 struct xfs_attr3_icleaf_hdr *leaf2hdr)
1326{
1327 struct xfs_attr_leaf_entry *entries1;
1328 struct xfs_attr_leaf_entry *entries2;
1329
1330 entries1 = xfs_attr3_leaf_entryp(leaf1_bp->b_addr);
1331 entries2 = xfs_attr3_leaf_entryp(leaf2_bp->b_addr);
1332 if (leaf1hdr->count > 0 && leaf2hdr->count > 0 &&
1333 ((be32_to_cpu(entries2[0].hashval) <
1334 be32_to_cpu(entries1[0].hashval)) ||
1335 (be32_to_cpu(entries2[leaf2hdr->count - 1].hashval) <
1336 be32_to_cpu(entries1[leaf1hdr->count - 1].hashval)))) {
1337 return 1;
1338 }
1339 return 0;
1340}
1341
1342int
1343xfs_attr_leaf_order(
1344 struct xfs_buf *leaf1_bp,
1345 struct xfs_buf *leaf2_bp)
1346{
1347 struct xfs_attr3_icleaf_hdr ichdr1;
1348 struct xfs_attr3_icleaf_hdr ichdr2;
1349
1350 xfs_attr3_leaf_hdr_from_disk(&ichdr1, leaf1_bp->b_addr);
1351 xfs_attr3_leaf_hdr_from_disk(&ichdr2, leaf2_bp->b_addr);
1352 return xfs_attr3_leaf_order(leaf1_bp, &ichdr1, leaf2_bp, &ichdr2);
1353}
1354
1355/*
Linus Torvalds1da177e2005-04-16 15:20:36 -07001356 * Redistribute the attribute list entries between two leaf nodes,
1357 * taking into account the size of the new entry.
1358 *
1359 * NOTE: if new block is empty, then it will get the upper half of the
1360 * old block. At present, all (one) callers pass in an empty second block.
1361 *
1362 * This code adjusts the args->index/blkno and args->index2/blkno2 fields
1363 * to match what it is doing in splitting the attribute leaf block. Those
1364 * values are used in "atomic rename" operations on attributes. Note that
1365 * the "new" and "old" values can end up in different blocks.
1366 */
1367STATIC void
Dave Chinner517c2222013-04-24 18:58:55 +10001368xfs_attr3_leaf_rebalance(
1369 struct xfs_da_state *state,
1370 struct xfs_da_state_blk *blk1,
1371 struct xfs_da_state_blk *blk2)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001372{
Dave Chinner517c2222013-04-24 18:58:55 +10001373 struct xfs_da_args *args;
1374 struct xfs_attr_leafblock *leaf1;
1375 struct xfs_attr_leafblock *leaf2;
1376 struct xfs_attr3_icleaf_hdr ichdr1;
1377 struct xfs_attr3_icleaf_hdr ichdr2;
1378 struct xfs_attr_leaf_entry *entries1;
1379 struct xfs_attr_leaf_entry *entries2;
1380 int count;
1381 int totallen;
1382 int max;
1383 int space;
1384 int swap;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001385
1386 /*
1387 * Set up environment.
1388 */
1389 ASSERT(blk1->magic == XFS_ATTR_LEAF_MAGIC);
1390 ASSERT(blk2->magic == XFS_ATTR_LEAF_MAGIC);
Dave Chinner1d9025e2012-06-22 18:50:14 +10001391 leaf1 = blk1->bp->b_addr;
1392 leaf2 = blk2->bp->b_addr;
Dave Chinner517c2222013-04-24 18:58:55 +10001393 xfs_attr3_leaf_hdr_from_disk(&ichdr1, leaf1);
1394 xfs_attr3_leaf_hdr_from_disk(&ichdr2, leaf2);
1395 ASSERT(ichdr2.count == 0);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001396 args = state->args;
1397
Dave Chinner5a5881c2012-03-22 05:15:13 +00001398 trace_xfs_attr_leaf_rebalance(args);
1399
Linus Torvalds1da177e2005-04-16 15:20:36 -07001400 /*
1401 * Check ordering of blocks, reverse if it makes things simpler.
1402 *
1403 * NOTE: Given that all (current) callers pass in an empty
1404 * second block, this code should never set "swap".
1405 */
1406 swap = 0;
Dave Chinner517c2222013-04-24 18:58:55 +10001407 if (xfs_attr3_leaf_order(blk1->bp, &ichdr1, blk2->bp, &ichdr2)) {
1408 struct xfs_da_state_blk *tmp_blk;
1409 struct xfs_attr3_icleaf_hdr tmp_ichdr;
1410
Linus Torvalds1da177e2005-04-16 15:20:36 -07001411 tmp_blk = blk1;
1412 blk1 = blk2;
1413 blk2 = tmp_blk;
Dave Chinner517c2222013-04-24 18:58:55 +10001414
1415 /* struct copies to swap them rather than reconverting */
1416 tmp_ichdr = ichdr1;
1417 ichdr1 = ichdr2;
1418 ichdr2 = tmp_ichdr;
1419
Dave Chinner1d9025e2012-06-22 18:50:14 +10001420 leaf1 = blk1->bp->b_addr;
1421 leaf2 = blk2->bp->b_addr;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001422 swap = 1;
1423 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07001424
1425 /*
1426 * Examine entries until we reduce the absolute difference in
1427 * byte usage between the two blocks to a minimum. Then get
1428 * the direction to copy and the number of elements to move.
1429 *
1430 * "inleaf" is true if the new entry should be inserted into blk1.
1431 * If "swap" is also true, then reverse the sense of "inleaf".
1432 */
Dave Chinner517c2222013-04-24 18:58:55 +10001433 state->inleaf = xfs_attr3_leaf_figure_balance(state, blk1, &ichdr1,
1434 blk2, &ichdr2,
1435 &count, &totallen);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001436 if (swap)
1437 state->inleaf = !state->inleaf;
1438
1439 /*
1440 * Move any entries required from leaf to leaf:
1441 */
Dave Chinner517c2222013-04-24 18:58:55 +10001442 if (count < ichdr1.count) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07001443 /*
1444 * Figure the total bytes to be added to the destination leaf.
1445 */
1446 /* number entries being moved */
Dave Chinner517c2222013-04-24 18:58:55 +10001447 count = ichdr1.count - count;
1448 space = ichdr1.usedbytes - totallen;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001449 space += count * sizeof(xfs_attr_leaf_entry_t);
1450
1451 /*
1452 * leaf2 is the destination, compact it if it looks tight.
1453 */
Dave Chinner517c2222013-04-24 18:58:55 +10001454 max = ichdr2.firstused - xfs_attr3_leaf_hdr_size(leaf1);
1455 max -= ichdr2.count * sizeof(xfs_attr_leaf_entry_t);
Dave Chinneree732592012-11-12 22:53:53 +11001456 if (space > max)
Dave Chinner517c2222013-04-24 18:58:55 +10001457 xfs_attr3_leaf_compact(args, &ichdr2, blk2->bp);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001458
1459 /*
1460 * Move high entries from leaf1 to low end of leaf2.
1461 */
Dave Chinner517c2222013-04-24 18:58:55 +10001462 xfs_attr3_leaf_moveents(leaf1, &ichdr1, ichdr1.count - count,
1463 leaf2, &ichdr2, 0, count, state->mp);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001464
Dave Chinner517c2222013-04-24 18:58:55 +10001465 } else if (count > ichdr1.count) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07001466 /*
1467 * I assert that since all callers pass in an empty
1468 * second buffer, this code should never execute.
1469 */
Dave Chinner07428d72012-11-12 22:09:44 +11001470 ASSERT(0);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001471
1472 /*
1473 * Figure the total bytes to be added to the destination leaf.
1474 */
1475 /* number entries being moved */
Dave Chinner517c2222013-04-24 18:58:55 +10001476 count -= ichdr1.count;
1477 space = totallen - ichdr1.usedbytes;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001478 space += count * sizeof(xfs_attr_leaf_entry_t);
1479
1480 /*
1481 * leaf1 is the destination, compact it if it looks tight.
1482 */
Dave Chinner517c2222013-04-24 18:58:55 +10001483 max = ichdr1.firstused - xfs_attr3_leaf_hdr_size(leaf1);
1484 max -= ichdr1.count * sizeof(xfs_attr_leaf_entry_t);
Dave Chinneree732592012-11-12 22:53:53 +11001485 if (space > max)
Dave Chinner517c2222013-04-24 18:58:55 +10001486 xfs_attr3_leaf_compact(args, &ichdr1, blk1->bp);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001487
1488 /*
1489 * Move low entries from leaf2 to high end of leaf1.
1490 */
Dave Chinner517c2222013-04-24 18:58:55 +10001491 xfs_attr3_leaf_moveents(leaf2, &ichdr2, 0, leaf1, &ichdr1,
1492 ichdr1.count, count, state->mp);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001493 }
1494
Dave Chinner517c2222013-04-24 18:58:55 +10001495 xfs_attr3_leaf_hdr_to_disk(leaf1, &ichdr1);
1496 xfs_attr3_leaf_hdr_to_disk(leaf2, &ichdr2);
1497 xfs_trans_log_buf(args->trans, blk1->bp, 0, state->blocksize-1);
1498 xfs_trans_log_buf(args->trans, blk2->bp, 0, state->blocksize-1);
1499
Linus Torvalds1da177e2005-04-16 15:20:36 -07001500 /*
1501 * Copy out last hashval in each block for B-tree code.
1502 */
Dave Chinner517c2222013-04-24 18:58:55 +10001503 entries1 = xfs_attr3_leaf_entryp(leaf1);
1504 entries2 = xfs_attr3_leaf_entryp(leaf2);
1505 blk1->hashval = be32_to_cpu(entries1[ichdr1.count - 1].hashval);
1506 blk2->hashval = be32_to_cpu(entries2[ichdr2.count - 1].hashval);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001507
1508 /*
1509 * Adjust the expected index for insertion.
1510 * NOTE: this code depends on the (current) situation that the
1511 * second block was originally empty.
1512 *
1513 * If the insertion point moved to the 2nd block, we must adjust
1514 * the index. We must also track the entry just following the
1515 * new entry for use in an "atomic rename" operation, that entry
1516 * is always the "old" entry and the "new" entry is what we are
1517 * inserting. The index/blkno fields refer to the "old" entry,
1518 * while the index2/blkno2 fields refer to the "new" entry.
1519 */
Dave Chinner517c2222013-04-24 18:58:55 +10001520 if (blk1->index > ichdr1.count) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07001521 ASSERT(state->inleaf == 0);
Dave Chinner517c2222013-04-24 18:58:55 +10001522 blk2->index = blk1->index - ichdr1.count;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001523 args->index = args->index2 = blk2->index;
1524 args->blkno = args->blkno2 = blk2->blkno;
Dave Chinner517c2222013-04-24 18:58:55 +10001525 } else if (blk1->index == ichdr1.count) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07001526 if (state->inleaf) {
1527 args->index = blk1->index;
1528 args->blkno = blk1->blkno;
1529 args->index2 = 0;
1530 args->blkno2 = blk2->blkno;
1531 } else {
Dave Chinner07428d72012-11-12 22:09:44 +11001532 /*
1533 * On a double leaf split, the original attr location
1534 * is already stored in blkno2/index2, so don't
1535 * overwrite it overwise we corrupt the tree.
1536 */
Dave Chinner517c2222013-04-24 18:58:55 +10001537 blk2->index = blk1->index - ichdr1.count;
Dave Chinner07428d72012-11-12 22:09:44 +11001538 args->index = blk2->index;
1539 args->blkno = blk2->blkno;
1540 if (!state->extravalid) {
1541 /*
1542 * set the new attr location to match the old
1543 * one and let the higher level split code
1544 * decide where in the leaf to place it.
1545 */
1546 args->index2 = blk2->index;
1547 args->blkno2 = blk2->blkno;
1548 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07001549 }
1550 } else {
1551 ASSERT(state->inleaf == 1);
1552 args->index = args->index2 = blk1->index;
1553 args->blkno = args->blkno2 = blk1->blkno;
1554 }
1555}
1556
1557/*
1558 * Examine entries until we reduce the absolute difference in
1559 * byte usage between the two blocks to a minimum.
1560 * GROT: Is this really necessary? With other than a 512 byte blocksize,
1561 * GROT: there will always be enough room in either block for a new entry.
1562 * GROT: Do a double-split for this case?
1563 */
1564STATIC int
Dave Chinner517c2222013-04-24 18:58:55 +10001565xfs_attr3_leaf_figure_balance(
1566 struct xfs_da_state *state,
1567 struct xfs_da_state_blk *blk1,
1568 struct xfs_attr3_icleaf_hdr *ichdr1,
1569 struct xfs_da_state_blk *blk2,
1570 struct xfs_attr3_icleaf_hdr *ichdr2,
1571 int *countarg,
1572 int *usedbytesarg)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001573{
Dave Chinner517c2222013-04-24 18:58:55 +10001574 struct xfs_attr_leafblock *leaf1 = blk1->bp->b_addr;
1575 struct xfs_attr_leafblock *leaf2 = blk2->bp->b_addr;
1576 struct xfs_attr_leaf_entry *entry;
1577 int count;
1578 int max;
1579 int index;
1580 int totallen = 0;
1581 int half;
1582 int lastdelta;
1583 int foundit = 0;
1584 int tmp;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001585
1586 /*
1587 * Examine entries until we reduce the absolute difference in
1588 * byte usage between the two blocks to a minimum.
1589 */
Dave Chinner517c2222013-04-24 18:58:55 +10001590 max = ichdr1->count + ichdr2->count;
1591 half = (max + 1) * sizeof(*entry);
1592 half += ichdr1->usedbytes + ichdr2->usedbytes +
1593 xfs_attr_leaf_newentsize(state->args->namelen,
1594 state->args->valuelen,
1595 state->blocksize, NULL);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001596 half /= 2;
1597 lastdelta = state->blocksize;
Dave Chinner517c2222013-04-24 18:58:55 +10001598 entry = xfs_attr3_leaf_entryp(leaf1);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001599 for (count = index = 0; count < max; entry++, index++, count++) {
1600
1601#define XFS_ATTR_ABS(A) (((A) < 0) ? -(A) : (A))
1602 /*
1603 * The new entry is in the first block, account for it.
1604 */
1605 if (count == blk1->index) {
1606 tmp = totallen + sizeof(*entry) +
Nathan Scottaa82daa2005-11-02 10:33:33 +11001607 xfs_attr_leaf_newentsize(
1608 state->args->namelen,
1609 state->args->valuelen,
1610 state->blocksize, NULL);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001611 if (XFS_ATTR_ABS(half - tmp) > lastdelta)
1612 break;
1613 lastdelta = XFS_ATTR_ABS(half - tmp);
1614 totallen = tmp;
1615 foundit = 1;
1616 }
1617
1618 /*
1619 * Wrap around into the second block if necessary.
1620 */
Dave Chinner517c2222013-04-24 18:58:55 +10001621 if (count == ichdr1->count) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07001622 leaf1 = leaf2;
Dave Chinner517c2222013-04-24 18:58:55 +10001623 entry = xfs_attr3_leaf_entryp(leaf1);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001624 index = 0;
1625 }
1626
1627 /*
1628 * Figure out if next leaf entry would be too much.
1629 */
1630 tmp = totallen + sizeof(*entry) + xfs_attr_leaf_entsize(leaf1,
1631 index);
1632 if (XFS_ATTR_ABS(half - tmp) > lastdelta)
1633 break;
1634 lastdelta = XFS_ATTR_ABS(half - tmp);
1635 totallen = tmp;
1636#undef XFS_ATTR_ABS
1637 }
1638
1639 /*
1640 * Calculate the number of usedbytes that will end up in lower block.
1641 * If new entry not in lower block, fix up the count.
1642 */
1643 totallen -= count * sizeof(*entry);
1644 if (foundit) {
1645 totallen -= sizeof(*entry) +
Nathan Scottaa82daa2005-11-02 10:33:33 +11001646 xfs_attr_leaf_newentsize(
1647 state->args->namelen,
1648 state->args->valuelen,
1649 state->blocksize, NULL);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001650 }
1651
1652 *countarg = count;
1653 *usedbytesarg = totallen;
Dave Chinner517c2222013-04-24 18:58:55 +10001654 return foundit;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001655}
1656
1657/*========================================================================
1658 * Routines used for shrinking the Btree.
1659 *========================================================================*/
1660
1661/*
1662 * Check a leaf block and its neighbors to see if the block should be
1663 * collapsed into one or the other neighbor. Always keep the block
1664 * with the smaller block number.
1665 * If the current block is over 50% full, don't try to join it, return 0.
1666 * If the block is empty, fill in the state structure and return 2.
1667 * If it can be collapsed, fill in the state structure and return 1.
1668 * If nothing can be done, return 0.
1669 *
1670 * GROT: allow for INCOMPLETE entries in calculation.
1671 */
1672int
Dave Chinner517c2222013-04-24 18:58:55 +10001673xfs_attr3_leaf_toosmall(
1674 struct xfs_da_state *state,
1675 int *action)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001676{
Dave Chinner517c2222013-04-24 18:58:55 +10001677 struct xfs_attr_leafblock *leaf;
1678 struct xfs_da_state_blk *blk;
1679 struct xfs_attr3_icleaf_hdr ichdr;
1680 struct xfs_buf *bp;
1681 xfs_dablk_t blkno;
1682 int bytes;
1683 int forward;
1684 int error;
1685 int retval;
1686 int i;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001687
Dave Chinneree732592012-11-12 22:53:53 +11001688 trace_xfs_attr_leaf_toosmall(state->args);
1689
Linus Torvalds1da177e2005-04-16 15:20:36 -07001690 /*
1691 * Check for the degenerate case of the block being over 50% full.
1692 * If so, it's not worth even looking to see if we might be able
1693 * to coalesce with a sibling.
1694 */
1695 blk = &state->path.blk[ state->path.active-1 ];
Dave Chinner517c2222013-04-24 18:58:55 +10001696 leaf = blk->bp->b_addr;
1697 xfs_attr3_leaf_hdr_from_disk(&ichdr, leaf);
1698 bytes = xfs_attr3_leaf_hdr_size(leaf) +
1699 ichdr.count * sizeof(xfs_attr_leaf_entry_t) +
1700 ichdr.usedbytes;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001701 if (bytes > (state->blocksize >> 1)) {
1702 *action = 0; /* blk over 50%, don't try to join */
1703 return(0);
1704 }
1705
1706 /*
1707 * Check for the degenerate case of the block being empty.
1708 * If the block is empty, we'll simply delete it, no need to
Nathan Scottc41564b2006-03-29 08:55:14 +10001709 * coalesce it with a sibling block. We choose (arbitrarily)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001710 * to merge with the forward block unless it is NULL.
1711 */
Dave Chinner517c2222013-04-24 18:58:55 +10001712 if (ichdr.count == 0) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07001713 /*
1714 * Make altpath point to the block we want to keep and
1715 * path point to the block we want to drop (this one).
1716 */
Dave Chinner517c2222013-04-24 18:58:55 +10001717 forward = (ichdr.forw != 0);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001718 memcpy(&state->altpath, &state->path, sizeof(state->path));
Dave Chinnerf5ea1102013-04-24 18:58:02 +10001719 error = xfs_da3_path_shift(state, &state->altpath, forward,
Linus Torvalds1da177e2005-04-16 15:20:36 -07001720 0, &retval);
1721 if (error)
1722 return(error);
1723 if (retval) {
1724 *action = 0;
1725 } else {
1726 *action = 2;
1727 }
Dave Chinner517c2222013-04-24 18:58:55 +10001728 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001729 }
1730
1731 /*
1732 * Examine each sibling block to see if we can coalesce with
1733 * at least 25% free space to spare. We need to figure out
1734 * whether to merge with the forward or the backward block.
1735 * We prefer coalescing with the lower numbered sibling so as
1736 * to shrink an attribute list over time.
1737 */
1738 /* start with smaller blk num */
Dave Chinner517c2222013-04-24 18:58:55 +10001739 forward = ichdr.forw < ichdr.back;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001740 for (i = 0; i < 2; forward = !forward, i++) {
Dave Chinner517c2222013-04-24 18:58:55 +10001741 struct xfs_attr3_icleaf_hdr ichdr2;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001742 if (forward)
Dave Chinner517c2222013-04-24 18:58:55 +10001743 blkno = ichdr.forw;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001744 else
Dave Chinner517c2222013-04-24 18:58:55 +10001745 blkno = ichdr.back;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001746 if (blkno == 0)
1747 continue;
Dave Chinner517c2222013-04-24 18:58:55 +10001748 error = xfs_attr3_leaf_read(state->args->trans, state->args->dp,
Dave Chinnerad14c332012-11-12 22:54:16 +11001749 blkno, -1, &bp);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001750 if (error)
1751 return(error);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001752
Dave Chinner517c2222013-04-24 18:58:55 +10001753 xfs_attr3_leaf_hdr_from_disk(&ichdr2, bp->b_addr);
1754
1755 bytes = state->blocksize - (state->blocksize >> 2) -
1756 ichdr.usedbytes - ichdr2.usedbytes -
1757 ((ichdr.count + ichdr2.count) *
1758 sizeof(xfs_attr_leaf_entry_t)) -
1759 xfs_attr3_leaf_hdr_size(leaf);
1760
Dave Chinner1d9025e2012-06-22 18:50:14 +10001761 xfs_trans_brelse(state->args->trans, bp);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001762 if (bytes >= 0)
1763 break; /* fits with at least 25% to spare */
1764 }
1765 if (i >= 2) {
1766 *action = 0;
1767 return(0);
1768 }
1769
1770 /*
1771 * Make altpath point to the block we want to keep (the lower
1772 * numbered block) and path point to the block we want to drop.
1773 */
1774 memcpy(&state->altpath, &state->path, sizeof(state->path));
1775 if (blkno < blk->blkno) {
Dave Chinnerf5ea1102013-04-24 18:58:02 +10001776 error = xfs_da3_path_shift(state, &state->altpath, forward,
Linus Torvalds1da177e2005-04-16 15:20:36 -07001777 0, &retval);
1778 } else {
Dave Chinnerf5ea1102013-04-24 18:58:02 +10001779 error = xfs_da3_path_shift(state, &state->path, forward,
Linus Torvalds1da177e2005-04-16 15:20:36 -07001780 0, &retval);
1781 }
1782 if (error)
1783 return(error);
1784 if (retval) {
1785 *action = 0;
1786 } else {
1787 *action = 1;
1788 }
1789 return(0);
1790}
1791
1792/*
1793 * Remove a name from the leaf attribute list structure.
1794 *
1795 * Return 1 if leaf is less than 37% full, 0 if >= 37% full.
1796 * If two leaves are 37% full, when combined they will leave 25% free.
1797 */
1798int
Dave Chinner517c2222013-04-24 18:58:55 +10001799xfs_attr3_leaf_remove(
1800 struct xfs_buf *bp,
1801 struct xfs_da_args *args)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001802{
Dave Chinner517c2222013-04-24 18:58:55 +10001803 struct xfs_attr_leafblock *leaf;
1804 struct xfs_attr3_icleaf_hdr ichdr;
1805 struct xfs_attr_leaf_entry *entry;
1806 struct xfs_mount *mp = args->trans->t_mountp;
1807 int before;
1808 int after;
1809 int smallest;
1810 int entsize;
1811 int tablesize;
1812 int tmp;
1813 int i;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001814
Dave Chinneree732592012-11-12 22:53:53 +11001815 trace_xfs_attr_leaf_remove(args);
1816
Dave Chinner1d9025e2012-06-22 18:50:14 +10001817 leaf = bp->b_addr;
Dave Chinner517c2222013-04-24 18:58:55 +10001818 xfs_attr3_leaf_hdr_from_disk(&ichdr, leaf);
1819
1820 ASSERT(ichdr.count > 0 && ichdr.count < XFS_LBSIZE(mp) / 8);
1821 ASSERT(args->index >= 0 && args->index < ichdr.count);
1822 ASSERT(ichdr.firstused >= ichdr.count * sizeof(*entry) +
1823 xfs_attr3_leaf_hdr_size(leaf));
1824
1825 entry = &xfs_attr3_leaf_entryp(leaf)[args->index];
1826
1827 ASSERT(be16_to_cpu(entry->nameidx) >= ichdr.firstused);
Nathan Scott6b19f2d2006-03-17 17:29:02 +11001828 ASSERT(be16_to_cpu(entry->nameidx) < XFS_LBSIZE(mp));
Linus Torvalds1da177e2005-04-16 15:20:36 -07001829
1830 /*
1831 * Scan through free region table:
1832 * check for adjacency of free'd entry with an existing one,
1833 * find smallest free region in case we need to replace it,
1834 * adjust any map that borders the entry table,
1835 */
Dave Chinner517c2222013-04-24 18:58:55 +10001836 tablesize = ichdr.count * sizeof(xfs_attr_leaf_entry_t)
1837 + xfs_attr3_leaf_hdr_size(leaf);
1838 tmp = ichdr.freemap[0].size;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001839 before = after = -1;
1840 smallest = XFS_ATTR_LEAF_MAPSIZE - 1;
1841 entsize = xfs_attr_leaf_entsize(leaf, args->index);
Dave Chinner517c2222013-04-24 18:58:55 +10001842 for (i = 0; i < XFS_ATTR_LEAF_MAPSIZE; i++) {
1843 ASSERT(ichdr.freemap[i].base < XFS_LBSIZE(mp));
1844 ASSERT(ichdr.freemap[i].size < XFS_LBSIZE(mp));
1845 if (ichdr.freemap[i].base == tablesize) {
1846 ichdr.freemap[i].base -= sizeof(xfs_attr_leaf_entry_t);
1847 ichdr.freemap[i].size += sizeof(xfs_attr_leaf_entry_t);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001848 }
1849
Dave Chinner517c2222013-04-24 18:58:55 +10001850 if (ichdr.freemap[i].base + ichdr.freemap[i].size ==
1851 be16_to_cpu(entry->nameidx)) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07001852 before = i;
Dave Chinner517c2222013-04-24 18:58:55 +10001853 } else if (ichdr.freemap[i].base ==
1854 (be16_to_cpu(entry->nameidx) + entsize)) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07001855 after = i;
Dave Chinner517c2222013-04-24 18:58:55 +10001856 } else if (ichdr.freemap[i].size < tmp) {
1857 tmp = ichdr.freemap[i].size;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001858 smallest = i;
1859 }
1860 }
1861
1862 /*
1863 * Coalesce adjacent freemap regions,
1864 * or replace the smallest region.
1865 */
1866 if ((before >= 0) || (after >= 0)) {
1867 if ((before >= 0) && (after >= 0)) {
Dave Chinner517c2222013-04-24 18:58:55 +10001868 ichdr.freemap[before].size += entsize;
1869 ichdr.freemap[before].size += ichdr.freemap[after].size;
1870 ichdr.freemap[after].base = 0;
1871 ichdr.freemap[after].size = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001872 } else if (before >= 0) {
Dave Chinner517c2222013-04-24 18:58:55 +10001873 ichdr.freemap[before].size += entsize;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001874 } else {
Dave Chinner517c2222013-04-24 18:58:55 +10001875 ichdr.freemap[after].base = be16_to_cpu(entry->nameidx);
1876 ichdr.freemap[after].size += entsize;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001877 }
1878 } else {
1879 /*
1880 * Replace smallest region (if it is smaller than free'd entry)
1881 */
Dave Chinner517c2222013-04-24 18:58:55 +10001882 if (ichdr.freemap[smallest].size < entsize) {
1883 ichdr.freemap[smallest].base = be16_to_cpu(entry->nameidx);
1884 ichdr.freemap[smallest].size = entsize;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001885 }
1886 }
1887
1888 /*
1889 * Did we remove the first entry?
1890 */
Dave Chinner517c2222013-04-24 18:58:55 +10001891 if (be16_to_cpu(entry->nameidx) == ichdr.firstused)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001892 smallest = 1;
1893 else
1894 smallest = 0;
1895
1896 /*
1897 * Compress the remaining entries and zero out the removed stuff.
1898 */
Dave Chinner517c2222013-04-24 18:58:55 +10001899 memset(xfs_attr3_leaf_name(leaf, args->index), 0, entsize);
1900 ichdr.usedbytes -= entsize;
Dave Chinner1d9025e2012-06-22 18:50:14 +10001901 xfs_trans_log_buf(args->trans, bp,
Dave Chinner517c2222013-04-24 18:58:55 +10001902 XFS_DA_LOGRANGE(leaf, xfs_attr3_leaf_name(leaf, args->index),
Linus Torvalds1da177e2005-04-16 15:20:36 -07001903 entsize));
1904
Dave Chinner517c2222013-04-24 18:58:55 +10001905 tmp = (ichdr.count - args->index) * sizeof(xfs_attr_leaf_entry_t);
1906 memmove(entry, entry + 1, tmp);
1907 ichdr.count--;
Dave Chinner1d9025e2012-06-22 18:50:14 +10001908 xfs_trans_log_buf(args->trans, bp,
Dave Chinner517c2222013-04-24 18:58:55 +10001909 XFS_DA_LOGRANGE(leaf, entry, tmp + sizeof(xfs_attr_leaf_entry_t)));
1910
1911 entry = &xfs_attr3_leaf_entryp(leaf)[ichdr.count];
1912 memset(entry, 0, sizeof(xfs_attr_leaf_entry_t));
Linus Torvalds1da177e2005-04-16 15:20:36 -07001913
1914 /*
1915 * If we removed the first entry, re-find the first used byte
1916 * in the name area. Note that if the entry was the "firstused",
1917 * then we don't have a "hole" in our block resulting from
1918 * removing the name.
1919 */
1920 if (smallest) {
1921 tmp = XFS_LBSIZE(mp);
Dave Chinner517c2222013-04-24 18:58:55 +10001922 entry = xfs_attr3_leaf_entryp(leaf);
1923 for (i = ichdr.count - 1; i >= 0; entry++, i--) {
1924 ASSERT(be16_to_cpu(entry->nameidx) >= ichdr.firstused);
Nathan Scott6b19f2d2006-03-17 17:29:02 +11001925 ASSERT(be16_to_cpu(entry->nameidx) < XFS_LBSIZE(mp));
1926
1927 if (be16_to_cpu(entry->nameidx) < tmp)
1928 tmp = be16_to_cpu(entry->nameidx);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001929 }
Dave Chinner517c2222013-04-24 18:58:55 +10001930 ichdr.firstused = tmp;
1931 if (!ichdr.firstused)
1932 ichdr.firstused = tmp - XFS_ATTR_LEAF_NAME_ALIGN;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001933 } else {
Dave Chinner517c2222013-04-24 18:58:55 +10001934 ichdr.holes = 1; /* mark as needing compaction */
Linus Torvalds1da177e2005-04-16 15:20:36 -07001935 }
Dave Chinner517c2222013-04-24 18:58:55 +10001936 xfs_attr3_leaf_hdr_to_disk(leaf, &ichdr);
Dave Chinner1d9025e2012-06-22 18:50:14 +10001937 xfs_trans_log_buf(args->trans, bp,
Dave Chinner517c2222013-04-24 18:58:55 +10001938 XFS_DA_LOGRANGE(leaf, &leaf->hdr,
1939 xfs_attr3_leaf_hdr_size(leaf)));
Linus Torvalds1da177e2005-04-16 15:20:36 -07001940
1941 /*
1942 * Check if leaf is less than 50% full, caller may want to
1943 * "join" the leaf with a sibling if so.
1944 */
Dave Chinner517c2222013-04-24 18:58:55 +10001945 tmp = ichdr.usedbytes + xfs_attr3_leaf_hdr_size(leaf) +
1946 ichdr.count * sizeof(xfs_attr_leaf_entry_t);
1947
1948 return tmp < mp->m_attr_magicpct; /* leaf is < 37% full */
Linus Torvalds1da177e2005-04-16 15:20:36 -07001949}
1950
1951/*
1952 * Move all the attribute list entries from drop_leaf into save_leaf.
1953 */
1954void
Dave Chinner517c2222013-04-24 18:58:55 +10001955xfs_attr3_leaf_unbalance(
1956 struct xfs_da_state *state,
1957 struct xfs_da_state_blk *drop_blk,
1958 struct xfs_da_state_blk *save_blk)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001959{
Dave Chinner517c2222013-04-24 18:58:55 +10001960 struct xfs_attr_leafblock *drop_leaf = drop_blk->bp->b_addr;
1961 struct xfs_attr_leafblock *save_leaf = save_blk->bp->b_addr;
1962 struct xfs_attr3_icleaf_hdr drophdr;
1963 struct xfs_attr3_icleaf_hdr savehdr;
1964 struct xfs_attr_leaf_entry *entry;
1965 struct xfs_mount *mp = state->mp;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001966
Dave Chinner5a5881c2012-03-22 05:15:13 +00001967 trace_xfs_attr_leaf_unbalance(state->args);
1968
Dave Chinner1d9025e2012-06-22 18:50:14 +10001969 drop_leaf = drop_blk->bp->b_addr;
1970 save_leaf = save_blk->bp->b_addr;
Dave Chinner517c2222013-04-24 18:58:55 +10001971 xfs_attr3_leaf_hdr_from_disk(&drophdr, drop_leaf);
1972 xfs_attr3_leaf_hdr_from_disk(&savehdr, save_leaf);
1973 entry = xfs_attr3_leaf_entryp(drop_leaf);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001974
1975 /*
1976 * Save last hashval from dying block for later Btree fixup.
1977 */
Dave Chinner517c2222013-04-24 18:58:55 +10001978 drop_blk->hashval = be32_to_cpu(entry[drophdr.count - 1].hashval);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001979
1980 /*
1981 * Check if we need a temp buffer, or can we do it in place.
1982 * Note that we don't check "leaf" for holes because we will
1983 * always be dropping it, toosmall() decided that for us already.
1984 */
Dave Chinner517c2222013-04-24 18:58:55 +10001985 if (savehdr.holes == 0) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07001986 /*
1987 * dest leaf has no holes, so we add there. May need
1988 * to make some room in the entry array.
1989 */
Dave Chinner517c2222013-04-24 18:58:55 +10001990 if (xfs_attr3_leaf_order(save_blk->bp, &savehdr,
1991 drop_blk->bp, &drophdr)) {
1992 xfs_attr3_leaf_moveents(drop_leaf, &drophdr, 0,
1993 save_leaf, &savehdr, 0,
1994 drophdr.count, mp);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001995 } else {
Dave Chinner517c2222013-04-24 18:58:55 +10001996 xfs_attr3_leaf_moveents(drop_leaf, &drophdr, 0,
1997 save_leaf, &savehdr,
1998 savehdr.count, drophdr.count, mp);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001999 }
2000 } else {
2001 /*
2002 * Destination has holes, so we make a temporary copy
2003 * of the leaf and add them both to that.
2004 */
Dave Chinner517c2222013-04-24 18:58:55 +10002005 struct xfs_attr_leafblock *tmp_leaf;
2006 struct xfs_attr3_icleaf_hdr tmphdr;
2007
Dave Chinner8517de22013-05-21 18:02:05 +10002008 tmp_leaf = kmem_zalloc(state->blocksize, KM_SLEEP);
Dave Chinner517c2222013-04-24 18:58:55 +10002009
Dave Chinner8517de22013-05-21 18:02:05 +10002010 /*
2011 * Copy the header into the temp leaf so that all the stuff
2012 * not in the incore header is present and gets copied back in
2013 * once we've moved all the entries.
2014 */
2015 memcpy(tmp_leaf, save_leaf, xfs_attr3_leaf_hdr_size(save_leaf));
2016
2017 memset(&tmphdr, 0, sizeof(tmphdr));
Dave Chinner517c2222013-04-24 18:58:55 +10002018 tmphdr.magic = savehdr.magic;
2019 tmphdr.forw = savehdr.forw;
2020 tmphdr.back = savehdr.back;
2021 tmphdr.firstused = state->blocksize;
Dave Chinner8517de22013-05-21 18:02:05 +10002022
2023 /* write the header to the temp buffer to initialise it */
2024 xfs_attr3_leaf_hdr_to_disk(tmp_leaf, &tmphdr);
2025
Dave Chinner517c2222013-04-24 18:58:55 +10002026 if (xfs_attr3_leaf_order(save_blk->bp, &savehdr,
2027 drop_blk->bp, &drophdr)) {
2028 xfs_attr3_leaf_moveents(drop_leaf, &drophdr, 0,
2029 tmp_leaf, &tmphdr, 0,
2030 drophdr.count, mp);
2031 xfs_attr3_leaf_moveents(save_leaf, &savehdr, 0,
2032 tmp_leaf, &tmphdr, tmphdr.count,
2033 savehdr.count, mp);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002034 } else {
Dave Chinner517c2222013-04-24 18:58:55 +10002035 xfs_attr3_leaf_moveents(save_leaf, &savehdr, 0,
2036 tmp_leaf, &tmphdr, 0,
2037 savehdr.count, mp);
2038 xfs_attr3_leaf_moveents(drop_leaf, &drophdr, 0,
2039 tmp_leaf, &tmphdr, tmphdr.count,
2040 drophdr.count, mp);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002041 }
Dave Chinner517c2222013-04-24 18:58:55 +10002042 memcpy(save_leaf, tmp_leaf, state->blocksize);
2043 savehdr = tmphdr; /* struct copy */
2044 kmem_free(tmp_leaf);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002045 }
2046
Dave Chinner517c2222013-04-24 18:58:55 +10002047 xfs_attr3_leaf_hdr_to_disk(save_leaf, &savehdr);
Dave Chinner1d9025e2012-06-22 18:50:14 +10002048 xfs_trans_log_buf(state->args->trans, save_blk->bp, 0,
Linus Torvalds1da177e2005-04-16 15:20:36 -07002049 state->blocksize - 1);
2050
2051 /*
2052 * Copy out last hashval in each block for B-tree code.
2053 */
Dave Chinner517c2222013-04-24 18:58:55 +10002054 entry = xfs_attr3_leaf_entryp(save_leaf);
2055 save_blk->hashval = be32_to_cpu(entry[savehdr.count - 1].hashval);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002056}
2057
2058/*========================================================================
2059 * Routines used for finding things in the Btree.
2060 *========================================================================*/
2061
2062/*
2063 * Look up a name in a leaf attribute list structure.
2064 * This is the internal routine, it uses the caller's buffer.
2065 *
2066 * Note that duplicate keys are allowed, but only check within the
2067 * current leaf node. The Btree code must check in adjacent leaf nodes.
2068 *
2069 * Return in args->index the index into the entry[] array of either
2070 * the found entry, or where the entry should have been (insert before
2071 * that entry).
2072 *
2073 * Don't change the args->value unless we find the attribute.
2074 */
2075int
Dave Chinner517c2222013-04-24 18:58:55 +10002076xfs_attr3_leaf_lookup_int(
2077 struct xfs_buf *bp,
2078 struct xfs_da_args *args)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002079{
Dave Chinner517c2222013-04-24 18:58:55 +10002080 struct xfs_attr_leafblock *leaf;
2081 struct xfs_attr3_icleaf_hdr ichdr;
2082 struct xfs_attr_leaf_entry *entry;
2083 struct xfs_attr_leaf_entry *entries;
2084 struct xfs_attr_leaf_name_local *name_loc;
2085 struct xfs_attr_leaf_name_remote *name_rmt;
2086 xfs_dahash_t hashval;
2087 int probe;
2088 int span;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002089
Dave Chinner5a5881c2012-03-22 05:15:13 +00002090 trace_xfs_attr_leaf_lookup(args);
2091
Dave Chinner1d9025e2012-06-22 18:50:14 +10002092 leaf = bp->b_addr;
Dave Chinner517c2222013-04-24 18:58:55 +10002093 xfs_attr3_leaf_hdr_from_disk(&ichdr, leaf);
2094 entries = xfs_attr3_leaf_entryp(leaf);
2095 ASSERT(ichdr.count < XFS_LBSIZE(args->dp->i_mount) / 8);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002096
2097 /*
2098 * Binary search. (note: small blocks will skip this loop)
2099 */
2100 hashval = args->hashval;
Dave Chinner517c2222013-04-24 18:58:55 +10002101 probe = span = ichdr.count / 2;
2102 for (entry = &entries[probe]; span > 4; entry = &entries[probe]) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07002103 span /= 2;
Nathan Scott6b19f2d2006-03-17 17:29:02 +11002104 if (be32_to_cpu(entry->hashval) < hashval)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002105 probe += span;
Nathan Scott6b19f2d2006-03-17 17:29:02 +11002106 else if (be32_to_cpu(entry->hashval) > hashval)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002107 probe -= span;
2108 else
2109 break;
2110 }
Dave Chinner517c2222013-04-24 18:58:55 +10002111 ASSERT(probe >= 0 && (!ichdr.count || probe < ichdr.count));
2112 ASSERT(span <= 4 || be32_to_cpu(entry->hashval) == hashval);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002113
2114 /*
2115 * Since we may have duplicate hashval's, find the first matching
2116 * hashval in the leaf.
2117 */
Dave Chinner517c2222013-04-24 18:58:55 +10002118 while (probe > 0 && be32_to_cpu(entry->hashval) >= hashval) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07002119 entry--;
2120 probe--;
2121 }
Dave Chinner517c2222013-04-24 18:58:55 +10002122 while (probe < ichdr.count &&
2123 be32_to_cpu(entry->hashval) < hashval) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07002124 entry++;
2125 probe++;
2126 }
Dave Chinner517c2222013-04-24 18:58:55 +10002127 if (probe == ichdr.count || be32_to_cpu(entry->hashval) != hashval) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07002128 args->index = probe;
Dave Chinner517c2222013-04-24 18:58:55 +10002129 return XFS_ERROR(ENOATTR);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002130 }
2131
2132 /*
2133 * Duplicate keys may be present, so search all of them for a match.
2134 */
Dave Chinner517c2222013-04-24 18:58:55 +10002135 for (; probe < ichdr.count && (be32_to_cpu(entry->hashval) == hashval);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002136 entry++, probe++) {
2137/*
2138 * GROT: Add code to remove incomplete entries.
2139 */
2140 /*
2141 * If we are looking for INCOMPLETE entries, show only those.
2142 * If we are looking for complete entries, show only those.
2143 */
2144 if ((args->flags & XFS_ATTR_INCOMPLETE) !=
2145 (entry->flags & XFS_ATTR_INCOMPLETE)) {
2146 continue;
2147 }
2148 if (entry->flags & XFS_ATTR_LOCAL) {
Dave Chinner517c2222013-04-24 18:58:55 +10002149 name_loc = xfs_attr3_leaf_name_local(leaf, probe);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002150 if (name_loc->namelen != args->namelen)
2151 continue;
Dave Chinner517c2222013-04-24 18:58:55 +10002152 if (memcmp(args->name, name_loc->nameval,
2153 args->namelen) != 0)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002154 continue;
Tim Shimmin726801b2006-09-28 11:01:37 +10002155 if (!xfs_attr_namesp_match(args->flags, entry->flags))
Linus Torvalds1da177e2005-04-16 15:20:36 -07002156 continue;
2157 args->index = probe;
Dave Chinner517c2222013-04-24 18:58:55 +10002158 return XFS_ERROR(EEXIST);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002159 } else {
Dave Chinner517c2222013-04-24 18:58:55 +10002160 name_rmt = xfs_attr3_leaf_name_remote(leaf, probe);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002161 if (name_rmt->namelen != args->namelen)
2162 continue;
Dave Chinner517c2222013-04-24 18:58:55 +10002163 if (memcmp(args->name, name_rmt->name,
2164 args->namelen) != 0)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002165 continue;
Tim Shimmin726801b2006-09-28 11:01:37 +10002166 if (!xfs_attr_namesp_match(args->flags, entry->flags))
Linus Torvalds1da177e2005-04-16 15:20:36 -07002167 continue;
2168 args->index = probe;
Dave Chinnere461fcb2013-05-20 09:51:16 +10002169 args->valuelen = be32_to_cpu(name_rmt->valuelen);
Nathan Scottc0f054e2006-03-17 17:29:18 +11002170 args->rmtblkno = be32_to_cpu(name_rmt->valueblk);
Dave Chinnerad1858d2013-05-21 18:02:08 +10002171 args->rmtblkcnt = xfs_attr3_rmt_blocks(
2172 args->dp->i_mount,
2173 args->valuelen);
Dave Chinner517c2222013-04-24 18:58:55 +10002174 return XFS_ERROR(EEXIST);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002175 }
2176 }
2177 args->index = probe;
Dave Chinner517c2222013-04-24 18:58:55 +10002178 return XFS_ERROR(ENOATTR);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002179}
2180
2181/*
2182 * Get the value associated with an attribute name from a leaf attribute
2183 * list structure.
2184 */
2185int
Dave Chinner517c2222013-04-24 18:58:55 +10002186xfs_attr3_leaf_getvalue(
2187 struct xfs_buf *bp,
2188 struct xfs_da_args *args)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002189{
Dave Chinner517c2222013-04-24 18:58:55 +10002190 struct xfs_attr_leafblock *leaf;
2191 struct xfs_attr3_icleaf_hdr ichdr;
2192 struct xfs_attr_leaf_entry *entry;
2193 struct xfs_attr_leaf_name_local *name_loc;
2194 struct xfs_attr_leaf_name_remote *name_rmt;
2195 int valuelen;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002196
Dave Chinner1d9025e2012-06-22 18:50:14 +10002197 leaf = bp->b_addr;
Dave Chinner517c2222013-04-24 18:58:55 +10002198 xfs_attr3_leaf_hdr_from_disk(&ichdr, leaf);
2199 ASSERT(ichdr.count < XFS_LBSIZE(args->dp->i_mount) / 8);
2200 ASSERT(args->index < ichdr.count);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002201
Dave Chinner517c2222013-04-24 18:58:55 +10002202 entry = &xfs_attr3_leaf_entryp(leaf)[args->index];
Linus Torvalds1da177e2005-04-16 15:20:36 -07002203 if (entry->flags & XFS_ATTR_LOCAL) {
Dave Chinner517c2222013-04-24 18:58:55 +10002204 name_loc = xfs_attr3_leaf_name_local(leaf, args->index);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002205 ASSERT(name_loc->namelen == args->namelen);
2206 ASSERT(memcmp(args->name, name_loc->nameval, args->namelen) == 0);
Nathan Scott053b5752006-03-17 17:29:09 +11002207 valuelen = be16_to_cpu(name_loc->valuelen);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002208 if (args->flags & ATTR_KERNOVAL) {
2209 args->valuelen = valuelen;
Dave Chinner517c2222013-04-24 18:58:55 +10002210 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002211 }
2212 if (args->valuelen < valuelen) {
2213 args->valuelen = valuelen;
Dave Chinner517c2222013-04-24 18:58:55 +10002214 return XFS_ERROR(ERANGE);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002215 }
2216 args->valuelen = valuelen;
2217 memcpy(args->value, &name_loc->nameval[args->namelen], valuelen);
2218 } else {
Dave Chinner517c2222013-04-24 18:58:55 +10002219 name_rmt = xfs_attr3_leaf_name_remote(leaf, args->index);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002220 ASSERT(name_rmt->namelen == args->namelen);
2221 ASSERT(memcmp(args->name, name_rmt->name, args->namelen) == 0);
Nathan Scottc0f054e2006-03-17 17:29:18 +11002222 valuelen = be32_to_cpu(name_rmt->valuelen);
2223 args->rmtblkno = be32_to_cpu(name_rmt->valueblk);
Dave Chinnerad1858d2013-05-21 18:02:08 +10002224 args->rmtblkcnt = xfs_attr3_rmt_blocks(args->dp->i_mount,
2225 valuelen);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002226 if (args->flags & ATTR_KERNOVAL) {
2227 args->valuelen = valuelen;
Dave Chinner517c2222013-04-24 18:58:55 +10002228 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002229 }
2230 if (args->valuelen < valuelen) {
2231 args->valuelen = valuelen;
Dave Chinner517c2222013-04-24 18:58:55 +10002232 return XFS_ERROR(ERANGE);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002233 }
2234 args->valuelen = valuelen;
2235 }
Dave Chinner517c2222013-04-24 18:58:55 +10002236 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002237}
2238
2239/*========================================================================
2240 * Utility routines.
2241 *========================================================================*/
2242
2243/*
2244 * Move the indicated entries from one leaf to another.
2245 * NOTE: this routine modifies both source and destination leaves.
2246 */
2247/*ARGSUSED*/
2248STATIC void
Dave Chinner517c2222013-04-24 18:58:55 +10002249xfs_attr3_leaf_moveents(
2250 struct xfs_attr_leafblock *leaf_s,
2251 struct xfs_attr3_icleaf_hdr *ichdr_s,
2252 int start_s,
2253 struct xfs_attr_leafblock *leaf_d,
2254 struct xfs_attr3_icleaf_hdr *ichdr_d,
2255 int start_d,
2256 int count,
2257 struct xfs_mount *mp)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002258{
Dave Chinner517c2222013-04-24 18:58:55 +10002259 struct xfs_attr_leaf_entry *entry_s;
2260 struct xfs_attr_leaf_entry *entry_d;
2261 int desti;
2262 int tmp;
2263 int i;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002264
2265 /*
2266 * Check for nothing to do.
2267 */
2268 if (count == 0)
2269 return;
2270
2271 /*
2272 * Set up environment.
2273 */
Dave Chinner517c2222013-04-24 18:58:55 +10002274 ASSERT(ichdr_s->magic == XFS_ATTR_LEAF_MAGIC ||
2275 ichdr_s->magic == XFS_ATTR3_LEAF_MAGIC);
2276 ASSERT(ichdr_s->magic == ichdr_d->magic);
2277 ASSERT(ichdr_s->count > 0 && ichdr_s->count < XFS_LBSIZE(mp) / 8);
2278 ASSERT(ichdr_s->firstused >= (ichdr_s->count * sizeof(*entry_s))
2279 + xfs_attr3_leaf_hdr_size(leaf_s));
2280 ASSERT(ichdr_d->count < XFS_LBSIZE(mp) / 8);
2281 ASSERT(ichdr_d->firstused >= (ichdr_d->count * sizeof(*entry_d))
2282 + xfs_attr3_leaf_hdr_size(leaf_d));
Linus Torvalds1da177e2005-04-16 15:20:36 -07002283
Dave Chinner517c2222013-04-24 18:58:55 +10002284 ASSERT(start_s < ichdr_s->count);
2285 ASSERT(start_d <= ichdr_d->count);
2286 ASSERT(count <= ichdr_s->count);
2287
Linus Torvalds1da177e2005-04-16 15:20:36 -07002288
2289 /*
2290 * Move the entries in the destination leaf up to make a hole?
2291 */
Dave Chinner517c2222013-04-24 18:58:55 +10002292 if (start_d < ichdr_d->count) {
2293 tmp = ichdr_d->count - start_d;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002294 tmp *= sizeof(xfs_attr_leaf_entry_t);
Dave Chinner517c2222013-04-24 18:58:55 +10002295 entry_s = &xfs_attr3_leaf_entryp(leaf_d)[start_d];
2296 entry_d = &xfs_attr3_leaf_entryp(leaf_d)[start_d + count];
2297 memmove(entry_d, entry_s, tmp);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002298 }
2299
2300 /*
2301 * Copy all entry's in the same (sorted) order,
2302 * but allocate attribute info packed and in sequence.
2303 */
Dave Chinner517c2222013-04-24 18:58:55 +10002304 entry_s = &xfs_attr3_leaf_entryp(leaf_s)[start_s];
2305 entry_d = &xfs_attr3_leaf_entryp(leaf_d)[start_d];
Linus Torvalds1da177e2005-04-16 15:20:36 -07002306 desti = start_d;
2307 for (i = 0; i < count; entry_s++, entry_d++, desti++, i++) {
Dave Chinner517c2222013-04-24 18:58:55 +10002308 ASSERT(be16_to_cpu(entry_s->nameidx) >= ichdr_s->firstused);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002309 tmp = xfs_attr_leaf_entsize(leaf_s, start_s + i);
2310#ifdef GROT
2311 /*
2312 * Code to drop INCOMPLETE entries. Difficult to use as we
2313 * may also need to change the insertion index. Code turned
2314 * off for 6.2, should be revisited later.
2315 */
2316 if (entry_s->flags & XFS_ATTR_INCOMPLETE) { /* skip partials? */
Dave Chinner517c2222013-04-24 18:58:55 +10002317 memset(xfs_attr3_leaf_name(leaf_s, start_s + i), 0, tmp);
2318 ichdr_s->usedbytes -= tmp;
2319 ichdr_s->count -= 1;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002320 entry_d--; /* to compensate for ++ in loop hdr */
2321 desti--;
2322 if ((start_s + i) < offset)
2323 result++; /* insertion index adjustment */
2324 } else {
2325#endif /* GROT */
Dave Chinner517c2222013-04-24 18:58:55 +10002326 ichdr_d->firstused -= tmp;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002327 /* both on-disk, don't endian flip twice */
2328 entry_d->hashval = entry_s->hashval;
Dave Chinner517c2222013-04-24 18:58:55 +10002329 entry_d->nameidx = cpu_to_be16(ichdr_d->firstused);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002330 entry_d->flags = entry_s->flags;
Nathan Scott6b19f2d2006-03-17 17:29:02 +11002331 ASSERT(be16_to_cpu(entry_d->nameidx) + tmp
Linus Torvalds1da177e2005-04-16 15:20:36 -07002332 <= XFS_LBSIZE(mp));
Dave Chinner517c2222013-04-24 18:58:55 +10002333 memmove(xfs_attr3_leaf_name(leaf_d, desti),
2334 xfs_attr3_leaf_name(leaf_s, start_s + i), tmp);
Nathan Scott6b19f2d2006-03-17 17:29:02 +11002335 ASSERT(be16_to_cpu(entry_s->nameidx) + tmp
Linus Torvalds1da177e2005-04-16 15:20:36 -07002336 <= XFS_LBSIZE(mp));
Dave Chinner517c2222013-04-24 18:58:55 +10002337 memset(xfs_attr3_leaf_name(leaf_s, start_s + i), 0, tmp);
2338 ichdr_s->usedbytes -= tmp;
2339 ichdr_d->usedbytes += tmp;
2340 ichdr_s->count -= 1;
2341 ichdr_d->count += 1;
2342 tmp = ichdr_d->count * sizeof(xfs_attr_leaf_entry_t)
2343 + xfs_attr3_leaf_hdr_size(leaf_d);
2344 ASSERT(ichdr_d->firstused >= tmp);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002345#ifdef GROT
2346 }
2347#endif /* GROT */
2348 }
2349
2350 /*
2351 * Zero out the entries we just copied.
2352 */
Dave Chinner517c2222013-04-24 18:58:55 +10002353 if (start_s == ichdr_s->count) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07002354 tmp = count * sizeof(xfs_attr_leaf_entry_t);
Dave Chinner517c2222013-04-24 18:58:55 +10002355 entry_s = &xfs_attr3_leaf_entryp(leaf_s)[start_s];
Linus Torvalds1da177e2005-04-16 15:20:36 -07002356 ASSERT(((char *)entry_s + tmp) <=
2357 ((char *)leaf_s + XFS_LBSIZE(mp)));
Dave Chinner517c2222013-04-24 18:58:55 +10002358 memset(entry_s, 0, tmp);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002359 } else {
2360 /*
2361 * Move the remaining entries down to fill the hole,
2362 * then zero the entries at the top.
2363 */
Dave Chinner517c2222013-04-24 18:58:55 +10002364 tmp = (ichdr_s->count - count) * sizeof(xfs_attr_leaf_entry_t);
2365 entry_s = &xfs_attr3_leaf_entryp(leaf_s)[start_s + count];
2366 entry_d = &xfs_attr3_leaf_entryp(leaf_s)[start_s];
2367 memmove(entry_d, entry_s, tmp);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002368
2369 tmp = count * sizeof(xfs_attr_leaf_entry_t);
Dave Chinner517c2222013-04-24 18:58:55 +10002370 entry_s = &xfs_attr3_leaf_entryp(leaf_s)[ichdr_s->count];
Linus Torvalds1da177e2005-04-16 15:20:36 -07002371 ASSERT(((char *)entry_s + tmp) <=
2372 ((char *)leaf_s + XFS_LBSIZE(mp)));
Dave Chinner517c2222013-04-24 18:58:55 +10002373 memset(entry_s, 0, tmp);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002374 }
2375
2376 /*
2377 * Fill in the freemap information
2378 */
Dave Chinner517c2222013-04-24 18:58:55 +10002379 ichdr_d->freemap[0].base = xfs_attr3_leaf_hdr_size(leaf_d);
2380 ichdr_d->freemap[0].base += ichdr_d->count * sizeof(xfs_attr_leaf_entry_t);
2381 ichdr_d->freemap[0].size = ichdr_d->firstused - ichdr_d->freemap[0].base;
2382 ichdr_d->freemap[1].base = 0;
2383 ichdr_d->freemap[2].base = 0;
2384 ichdr_d->freemap[1].size = 0;
2385 ichdr_d->freemap[2].size = 0;
2386 ichdr_s->holes = 1; /* leaf may not be compact */
Linus Torvalds1da177e2005-04-16 15:20:36 -07002387}
2388
2389/*
2390 * Pick up the last hashvalue from a leaf block.
2391 */
2392xfs_dahash_t
Dave Chinner1d9025e2012-06-22 18:50:14 +10002393xfs_attr_leaf_lasthash(
2394 struct xfs_buf *bp,
2395 int *count)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002396{
Dave Chinner517c2222013-04-24 18:58:55 +10002397 struct xfs_attr3_icleaf_hdr ichdr;
2398 struct xfs_attr_leaf_entry *entries;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002399
Dave Chinner517c2222013-04-24 18:58:55 +10002400 xfs_attr3_leaf_hdr_from_disk(&ichdr, bp->b_addr);
2401 entries = xfs_attr3_leaf_entryp(bp->b_addr);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002402 if (count)
Dave Chinner517c2222013-04-24 18:58:55 +10002403 *count = ichdr.count;
2404 if (!ichdr.count)
2405 return 0;
2406 return be32_to_cpu(entries[ichdr.count - 1].hashval);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002407}
2408
2409/*
2410 * Calculate the number of bytes used to store the indicated attribute
2411 * (whether local or remote only calculate bytes in this block).
2412 */
Christoph Hellwigba0f32d2005-06-21 15:36:52 +10002413STATIC int
Linus Torvalds1da177e2005-04-16 15:20:36 -07002414xfs_attr_leaf_entsize(xfs_attr_leafblock_t *leaf, int index)
2415{
Dave Chinner517c2222013-04-24 18:58:55 +10002416 struct xfs_attr_leaf_entry *entries;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002417 xfs_attr_leaf_name_local_t *name_loc;
2418 xfs_attr_leaf_name_remote_t *name_rmt;
2419 int size;
2420
Dave Chinner517c2222013-04-24 18:58:55 +10002421 entries = xfs_attr3_leaf_entryp(leaf);
2422 if (entries[index].flags & XFS_ATTR_LOCAL) {
2423 name_loc = xfs_attr3_leaf_name_local(leaf, index);
Eric Sandeenc9fb86a2009-01-01 16:40:11 -06002424 size = xfs_attr_leaf_entsize_local(name_loc->namelen,
Nathan Scott053b5752006-03-17 17:29:09 +11002425 be16_to_cpu(name_loc->valuelen));
Linus Torvalds1da177e2005-04-16 15:20:36 -07002426 } else {
Dave Chinner517c2222013-04-24 18:58:55 +10002427 name_rmt = xfs_attr3_leaf_name_remote(leaf, index);
Eric Sandeenc9fb86a2009-01-01 16:40:11 -06002428 size = xfs_attr_leaf_entsize_remote(name_rmt->namelen);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002429 }
Dave Chinner517c2222013-04-24 18:58:55 +10002430 return size;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002431}
2432
2433/*
2434 * Calculate the number of bytes that would be required to store the new
2435 * attribute (whether local or remote only calculate bytes in this block).
2436 * This routine decides as a side effect whether the attribute will be
2437 * a "local" or a "remote" attribute.
2438 */
2439int
Nathan Scottaa82daa2005-11-02 10:33:33 +11002440xfs_attr_leaf_newentsize(int namelen, int valuelen, int blocksize, int *local)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002441{
2442 int size;
2443
Eric Sandeenc9fb86a2009-01-01 16:40:11 -06002444 size = xfs_attr_leaf_entsize_local(namelen, valuelen);
2445 if (size < xfs_attr_leaf_entsize_local_max(blocksize)) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07002446 if (local) {
2447 *local = 1;
2448 }
2449 } else {
Eric Sandeenc9fb86a2009-01-01 16:40:11 -06002450 size = xfs_attr_leaf_entsize_remote(namelen);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002451 if (local) {
2452 *local = 0;
2453 }
2454 }
Dave Chinner517c2222013-04-24 18:58:55 +10002455 return size;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002456}
2457
Linus Torvalds1da177e2005-04-16 15:20:36 -07002458
2459/*========================================================================
2460 * Manage the INCOMPLETE flag in a leaf entry
2461 *========================================================================*/
2462
2463/*
2464 * Clear the INCOMPLETE flag on an entry in a leaf block.
2465 */
2466int
Dave Chinner517c2222013-04-24 18:58:55 +10002467xfs_attr3_leaf_clearflag(
2468 struct xfs_da_args *args)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002469{
Dave Chinner517c2222013-04-24 18:58:55 +10002470 struct xfs_attr_leafblock *leaf;
2471 struct xfs_attr_leaf_entry *entry;
2472 struct xfs_attr_leaf_name_remote *name_rmt;
2473 struct xfs_buf *bp;
2474 int error;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002475#ifdef DEBUG
Dave Chinner517c2222013-04-24 18:58:55 +10002476 struct xfs_attr3_icleaf_hdr ichdr;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002477 xfs_attr_leaf_name_local_t *name_loc;
2478 int namelen;
2479 char *name;
2480#endif /* DEBUG */
2481
Dave Chinner5a5881c2012-03-22 05:15:13 +00002482 trace_xfs_attr_leaf_clearflag(args);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002483 /*
2484 * Set up the operation.
2485 */
Dave Chinner517c2222013-04-24 18:58:55 +10002486 error = xfs_attr3_leaf_read(args->trans, args->dp, args->blkno, -1, &bp);
Dave Chinnerad14c332012-11-12 22:54:16 +11002487 if (error)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002488 return(error);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002489
Dave Chinner1d9025e2012-06-22 18:50:14 +10002490 leaf = bp->b_addr;
Dave Chinner517c2222013-04-24 18:58:55 +10002491 entry = &xfs_attr3_leaf_entryp(leaf)[args->index];
Linus Torvalds1da177e2005-04-16 15:20:36 -07002492 ASSERT(entry->flags & XFS_ATTR_INCOMPLETE);
2493
2494#ifdef DEBUG
Dave Chinner517c2222013-04-24 18:58:55 +10002495 xfs_attr3_leaf_hdr_from_disk(&ichdr, leaf);
2496 ASSERT(args->index < ichdr.count);
2497 ASSERT(args->index >= 0);
2498
Linus Torvalds1da177e2005-04-16 15:20:36 -07002499 if (entry->flags & XFS_ATTR_LOCAL) {
Dave Chinner517c2222013-04-24 18:58:55 +10002500 name_loc = xfs_attr3_leaf_name_local(leaf, args->index);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002501 namelen = name_loc->namelen;
2502 name = (char *)name_loc->nameval;
2503 } else {
Dave Chinner517c2222013-04-24 18:58:55 +10002504 name_rmt = xfs_attr3_leaf_name_remote(leaf, args->index);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002505 namelen = name_rmt->namelen;
2506 name = (char *)name_rmt->name;
2507 }
Nathan Scott6b19f2d2006-03-17 17:29:02 +11002508 ASSERT(be32_to_cpu(entry->hashval) == args->hashval);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002509 ASSERT(namelen == args->namelen);
2510 ASSERT(memcmp(name, args->name, namelen) == 0);
2511#endif /* DEBUG */
2512
2513 entry->flags &= ~XFS_ATTR_INCOMPLETE;
Dave Chinner1d9025e2012-06-22 18:50:14 +10002514 xfs_trans_log_buf(args->trans, bp,
Linus Torvalds1da177e2005-04-16 15:20:36 -07002515 XFS_DA_LOGRANGE(leaf, entry, sizeof(*entry)));
2516
2517 if (args->rmtblkno) {
2518 ASSERT((entry->flags & XFS_ATTR_LOCAL) == 0);
Dave Chinner517c2222013-04-24 18:58:55 +10002519 name_rmt = xfs_attr3_leaf_name_remote(leaf, args->index);
Nathan Scottc0f054e2006-03-17 17:29:18 +11002520 name_rmt->valueblk = cpu_to_be32(args->rmtblkno);
2521 name_rmt->valuelen = cpu_to_be32(args->valuelen);
Dave Chinner1d9025e2012-06-22 18:50:14 +10002522 xfs_trans_log_buf(args->trans, bp,
Linus Torvalds1da177e2005-04-16 15:20:36 -07002523 XFS_DA_LOGRANGE(leaf, name_rmt, sizeof(*name_rmt)));
2524 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07002525
2526 /*
2527 * Commit the flag value change and start the next trans in series.
2528 */
Niv Sardi322ff6b2008-08-13 16:05:49 +10002529 return xfs_trans_roll(&args->trans, args->dp);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002530}
2531
2532/*
2533 * Set the INCOMPLETE flag on an entry in a leaf block.
2534 */
2535int
Dave Chinner517c2222013-04-24 18:58:55 +10002536xfs_attr3_leaf_setflag(
2537 struct xfs_da_args *args)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002538{
Dave Chinner517c2222013-04-24 18:58:55 +10002539 struct xfs_attr_leafblock *leaf;
2540 struct xfs_attr_leaf_entry *entry;
2541 struct xfs_attr_leaf_name_remote *name_rmt;
2542 struct xfs_buf *bp;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002543 int error;
Dave Chinner517c2222013-04-24 18:58:55 +10002544#ifdef DEBUG
2545 struct xfs_attr3_icleaf_hdr ichdr;
2546#endif
Linus Torvalds1da177e2005-04-16 15:20:36 -07002547
Dave Chinner5a5881c2012-03-22 05:15:13 +00002548 trace_xfs_attr_leaf_setflag(args);
2549
Linus Torvalds1da177e2005-04-16 15:20:36 -07002550 /*
2551 * Set up the operation.
2552 */
Dave Chinner517c2222013-04-24 18:58:55 +10002553 error = xfs_attr3_leaf_read(args->trans, args->dp, args->blkno, -1, &bp);
Dave Chinnerad14c332012-11-12 22:54:16 +11002554 if (error)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002555 return(error);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002556
Dave Chinner1d9025e2012-06-22 18:50:14 +10002557 leaf = bp->b_addr;
Dave Chinner517c2222013-04-24 18:58:55 +10002558#ifdef DEBUG
2559 xfs_attr3_leaf_hdr_from_disk(&ichdr, leaf);
2560 ASSERT(args->index < ichdr.count);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002561 ASSERT(args->index >= 0);
Dave Chinner517c2222013-04-24 18:58:55 +10002562#endif
2563 entry = &xfs_attr3_leaf_entryp(leaf)[args->index];
Linus Torvalds1da177e2005-04-16 15:20:36 -07002564
2565 ASSERT((entry->flags & XFS_ATTR_INCOMPLETE) == 0);
2566 entry->flags |= XFS_ATTR_INCOMPLETE;
Dave Chinner1d9025e2012-06-22 18:50:14 +10002567 xfs_trans_log_buf(args->trans, bp,
Linus Torvalds1da177e2005-04-16 15:20:36 -07002568 XFS_DA_LOGRANGE(leaf, entry, sizeof(*entry)));
2569 if ((entry->flags & XFS_ATTR_LOCAL) == 0) {
Dave Chinner517c2222013-04-24 18:58:55 +10002570 name_rmt = xfs_attr3_leaf_name_remote(leaf, args->index);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002571 name_rmt->valueblk = 0;
2572 name_rmt->valuelen = 0;
Dave Chinner1d9025e2012-06-22 18:50:14 +10002573 xfs_trans_log_buf(args->trans, bp,
Linus Torvalds1da177e2005-04-16 15:20:36 -07002574 XFS_DA_LOGRANGE(leaf, name_rmt, sizeof(*name_rmt)));
2575 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07002576
2577 /*
2578 * Commit the flag value change and start the next trans in series.
2579 */
Niv Sardi322ff6b2008-08-13 16:05:49 +10002580 return xfs_trans_roll(&args->trans, args->dp);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002581}
2582
2583/*
2584 * In a single transaction, clear the INCOMPLETE flag on the leaf entry
2585 * given by args->blkno/index and set the INCOMPLETE flag on the leaf
2586 * entry given by args->blkno2/index2.
2587 *
2588 * Note that they could be in different blocks, or in the same block.
2589 */
2590int
Dave Chinner517c2222013-04-24 18:58:55 +10002591xfs_attr3_leaf_flipflags(
2592 struct xfs_da_args *args)
Linus Torvalds1da177e2005-04-16 15:20:36 -07002593{
Dave Chinner517c2222013-04-24 18:58:55 +10002594 struct xfs_attr_leafblock *leaf1;
2595 struct xfs_attr_leafblock *leaf2;
2596 struct xfs_attr_leaf_entry *entry1;
2597 struct xfs_attr_leaf_entry *entry2;
2598 struct xfs_attr_leaf_name_remote *name_rmt;
2599 struct xfs_buf *bp1;
2600 struct xfs_buf *bp2;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002601 int error;
2602#ifdef DEBUG
Dave Chinner517c2222013-04-24 18:58:55 +10002603 struct xfs_attr3_icleaf_hdr ichdr1;
2604 struct xfs_attr3_icleaf_hdr ichdr2;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002605 xfs_attr_leaf_name_local_t *name_loc;
2606 int namelen1, namelen2;
2607 char *name1, *name2;
2608#endif /* DEBUG */
2609
Dave Chinner5a5881c2012-03-22 05:15:13 +00002610 trace_xfs_attr_leaf_flipflags(args);
2611
Linus Torvalds1da177e2005-04-16 15:20:36 -07002612 /*
2613 * Read the block containing the "old" attr
2614 */
Dave Chinner517c2222013-04-24 18:58:55 +10002615 error = xfs_attr3_leaf_read(args->trans, args->dp, args->blkno, -1, &bp1);
Dave Chinnerad14c332012-11-12 22:54:16 +11002616 if (error)
2617 return error;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002618
2619 /*
2620 * Read the block containing the "new" attr, if it is different
2621 */
2622 if (args->blkno2 != args->blkno) {
Dave Chinner517c2222013-04-24 18:58:55 +10002623 error = xfs_attr3_leaf_read(args->trans, args->dp, args->blkno2,
Dave Chinnerad14c332012-11-12 22:54:16 +11002624 -1, &bp2);
2625 if (error)
2626 return error;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002627 } else {
2628 bp2 = bp1;
2629 }
2630
Dave Chinner1d9025e2012-06-22 18:50:14 +10002631 leaf1 = bp1->b_addr;
Dave Chinner517c2222013-04-24 18:58:55 +10002632 entry1 = &xfs_attr3_leaf_entryp(leaf1)[args->index];
Linus Torvalds1da177e2005-04-16 15:20:36 -07002633
Dave Chinner1d9025e2012-06-22 18:50:14 +10002634 leaf2 = bp2->b_addr;
Dave Chinner517c2222013-04-24 18:58:55 +10002635 entry2 = &xfs_attr3_leaf_entryp(leaf2)[args->index2];
Linus Torvalds1da177e2005-04-16 15:20:36 -07002636
2637#ifdef DEBUG
Dave Chinner517c2222013-04-24 18:58:55 +10002638 xfs_attr3_leaf_hdr_from_disk(&ichdr1, leaf1);
2639 ASSERT(args->index < ichdr1.count);
2640 ASSERT(args->index >= 0);
2641
2642 xfs_attr3_leaf_hdr_from_disk(&ichdr2, leaf2);
2643 ASSERT(args->index2 < ichdr2.count);
2644 ASSERT(args->index2 >= 0);
2645
Linus Torvalds1da177e2005-04-16 15:20:36 -07002646 if (entry1->flags & XFS_ATTR_LOCAL) {
Dave Chinner517c2222013-04-24 18:58:55 +10002647 name_loc = xfs_attr3_leaf_name_local(leaf1, args->index);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002648 namelen1 = name_loc->namelen;
2649 name1 = (char *)name_loc->nameval;
2650 } else {
Dave Chinner517c2222013-04-24 18:58:55 +10002651 name_rmt = xfs_attr3_leaf_name_remote(leaf1, args->index);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002652 namelen1 = name_rmt->namelen;
2653 name1 = (char *)name_rmt->name;
2654 }
2655 if (entry2->flags & XFS_ATTR_LOCAL) {
Dave Chinner517c2222013-04-24 18:58:55 +10002656 name_loc = xfs_attr3_leaf_name_local(leaf2, args->index2);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002657 namelen2 = name_loc->namelen;
2658 name2 = (char *)name_loc->nameval;
2659 } else {
Dave Chinner517c2222013-04-24 18:58:55 +10002660 name_rmt = xfs_attr3_leaf_name_remote(leaf2, args->index2);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002661 namelen2 = name_rmt->namelen;
2662 name2 = (char *)name_rmt->name;
2663 }
Nathan Scott6b19f2d2006-03-17 17:29:02 +11002664 ASSERT(be32_to_cpu(entry1->hashval) == be32_to_cpu(entry2->hashval));
Linus Torvalds1da177e2005-04-16 15:20:36 -07002665 ASSERT(namelen1 == namelen2);
2666 ASSERT(memcmp(name1, name2, namelen1) == 0);
2667#endif /* DEBUG */
2668
2669 ASSERT(entry1->flags & XFS_ATTR_INCOMPLETE);
2670 ASSERT((entry2->flags & XFS_ATTR_INCOMPLETE) == 0);
2671
2672 entry1->flags &= ~XFS_ATTR_INCOMPLETE;
Dave Chinner1d9025e2012-06-22 18:50:14 +10002673 xfs_trans_log_buf(args->trans, bp1,
Linus Torvalds1da177e2005-04-16 15:20:36 -07002674 XFS_DA_LOGRANGE(leaf1, entry1, sizeof(*entry1)));
2675 if (args->rmtblkno) {
2676 ASSERT((entry1->flags & XFS_ATTR_LOCAL) == 0);
Dave Chinner517c2222013-04-24 18:58:55 +10002677 name_rmt = xfs_attr3_leaf_name_remote(leaf1, args->index);
Nathan Scottc0f054e2006-03-17 17:29:18 +11002678 name_rmt->valueblk = cpu_to_be32(args->rmtblkno);
2679 name_rmt->valuelen = cpu_to_be32(args->valuelen);
Dave Chinner1d9025e2012-06-22 18:50:14 +10002680 xfs_trans_log_buf(args->trans, bp1,
Linus Torvalds1da177e2005-04-16 15:20:36 -07002681 XFS_DA_LOGRANGE(leaf1, name_rmt, sizeof(*name_rmt)));
2682 }
2683
2684 entry2->flags |= XFS_ATTR_INCOMPLETE;
Dave Chinner1d9025e2012-06-22 18:50:14 +10002685 xfs_trans_log_buf(args->trans, bp2,
Linus Torvalds1da177e2005-04-16 15:20:36 -07002686 XFS_DA_LOGRANGE(leaf2, entry2, sizeof(*entry2)));
2687 if ((entry2->flags & XFS_ATTR_LOCAL) == 0) {
Dave Chinner517c2222013-04-24 18:58:55 +10002688 name_rmt = xfs_attr3_leaf_name_remote(leaf2, args->index2);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002689 name_rmt->valueblk = 0;
2690 name_rmt->valuelen = 0;
Dave Chinner1d9025e2012-06-22 18:50:14 +10002691 xfs_trans_log_buf(args->trans, bp2,
Linus Torvalds1da177e2005-04-16 15:20:36 -07002692 XFS_DA_LOGRANGE(leaf2, name_rmt, sizeof(*name_rmt)));
2693 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07002694
2695 /*
2696 * Commit the flag value change and start the next trans in series.
2697 */
Niv Sardi322ff6b2008-08-13 16:05:49 +10002698 error = xfs_trans_roll(&args->trans, args->dp);
Linus Torvalds1da177e2005-04-16 15:20:36 -07002699
Dave Chinner517c2222013-04-24 18:58:55 +10002700 return error;
Linus Torvalds1da177e2005-04-16 15:20:36 -07002701}