xfs_attr_leaf.c 85.1 KB
Newer Older
L
Linus Torvalds 已提交
1
/*
2 3
 * Copyright (c) 2000-2005 Silicon Graphics, Inc.
 * All Rights Reserved.
L
Linus Torvalds 已提交
4
 *
5 6
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License as
L
Linus Torvalds 已提交
7 8
 * published by the Free Software Foundation.
 *
9 10 11 12
 * This program is distributed in the hope that it would be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
L
Linus Torvalds 已提交
13
 *
14 15 16
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write the Free Software Foundation,
 * Inc.,  51 Franklin St, Fifth Floor, Boston, MA  02110-1301  USA
L
Linus Torvalds 已提交
17 18
 */
#include "xfs.h"
19
#include "xfs_fs.h"
L
Linus Torvalds 已提交
20
#include "xfs_types.h"
21
#include "xfs_bit.h"
L
Linus Torvalds 已提交
22 23 24 25 26
#include "xfs_log.h"
#include "xfs_trans.h"
#include "xfs_sb.h"
#include "xfs_ag.h"
#include "xfs_mount.h"
27
#include "xfs_da_btree.h"
L
Linus Torvalds 已提交
28
#include "xfs_bmap_btree.h"
29
#include "xfs_alloc_btree.h"
L
Linus Torvalds 已提交
30 31 32
#include "xfs_ialloc_btree.h"
#include "xfs_alloc.h"
#include "xfs_btree.h"
33
#include "xfs_attr_sf.h"
L
Linus Torvalds 已提交
34 35
#include "xfs_dinode.h"
#include "xfs_inode.h"
36
#include "xfs_inode_item.h"
L
Linus Torvalds 已提交
37 38 39 40
#include "xfs_bmap.h"
#include "xfs_attr.h"
#include "xfs_attr_leaf.h"
#include "xfs_error.h"
C
Christoph Hellwig 已提交
41
#include "xfs_trace.h"
L
Linus Torvalds 已提交
42 43 44 45 46 47 48 49 50 51 52 53 54 55

/*
 * xfs_attr_leaf.c
 *
 * Routines to implement leaf blocks of attributes as Btrees of hashed names.
 */

/*========================================================================
 * Function prototypes for the kernel.
 *========================================================================*/

/*
 * Routines used for growing the Btree.
 */
56
STATIC int xfs_attr_leaf_create(xfs_da_args_t *args, xfs_dablk_t which_block,
57 58 59
				struct xfs_buf **bpp);
STATIC int xfs_attr_leaf_add_work(struct xfs_buf *leaf_buffer,
				  xfs_da_args_t *args, int freemap_index);
60 61
STATIC void xfs_attr_leaf_compact(struct xfs_da_args *args,
				  struct xfs_buf *leaf_buffer);
L
Linus Torvalds 已提交
62 63 64 65 66 67 68 69 70
STATIC void xfs_attr_leaf_rebalance(xfs_da_state_t *state,
						   xfs_da_state_blk_t *blk1,
						   xfs_da_state_blk_t *blk2);
STATIC int xfs_attr_leaf_figure_balance(xfs_da_state_t *state,
					   xfs_da_state_blk_t *leaf_blk_1,
					   xfs_da_state_blk_t *leaf_blk_2,
					   int *number_entries_in_blk1,
					   int *number_usedbytes_in_blk1);

71 72 73 74
/*
 * Routines used for shrinking the Btree.
 */
STATIC int xfs_attr_node_inactive(xfs_trans_t **trans, xfs_inode_t *dp,
75
				  struct xfs_buf *bp, int level);
76
STATIC int xfs_attr_leaf_inactive(xfs_trans_t **trans, xfs_inode_t *dp,
77
				  struct xfs_buf *bp);
78 79 80
STATIC int xfs_attr_leaf_freextent(xfs_trans_t **trans, xfs_inode_t *dp,
				   xfs_dablk_t blkno, int blkcnt);

L
Linus Torvalds 已提交
81 82 83 84 85 86 87 88
/*
 * Utility routines.
 */
STATIC void xfs_attr_leaf_moveents(xfs_attr_leafblock_t *src_leaf,
					 int src_start,
					 xfs_attr_leafblock_t *dst_leaf,
					 int dst_start, int move_count,
					 xfs_mount_t *mp);
89
STATIC int xfs_attr_leaf_entsize(xfs_attr_leafblock_t *leaf, int index);
90 91 92 93 94 95 96 97 98

/*========================================================================
 * Namespace helper routines
 *========================================================================*/

/*
 * If namespace bits don't match return 0.
 * If all match then return 1.
 */
99
STATIC int
100 101 102 103 104
xfs_attr_namesp_match(int arg_flags, int ondisk_flags)
{
	return XFS_ATTR_NSP_ONDISK(ondisk_flags) == XFS_ATTR_NSP_ARGS_TO_ONDISK(arg_flags);
}

L
Linus Torvalds 已提交
105 106

/*========================================================================
107
 * External routines when attribute fork size < XFS_LITINO(mp).
L
Linus Torvalds 已提交
108 109 110
 *========================================================================*/

/*
111 112
 * Query whether the requested number of additional bytes of extended
 * attribute space will be able to fit inline.
113
 *
114 115 116 117 118
 * Returns zero if not, else the di_forkoff fork offset to be used in the
 * literal area for attribute data once the new bytes have been added.
 *
 * di_forkoff must be 8 byte aligned, hence is stored as a >>3 value;
 * special case for dev/uuid inodes, they have fixed size data forks.
L
Linus Torvalds 已提交
119 120
 */
int
121 122 123 124 125
xfs_attr_shortform_bytesfit(xfs_inode_t *dp, int bytes)
{
	int offset;
	int minforkoff;	/* lower limit on valid forkoff locations */
	int maxforkoff;	/* upper limit on valid forkoff locations */
126
	int dsize;
127 128 129 130 131 132 133 134 135 136 137 138 139
	xfs_mount_t *mp = dp->i_mount;

	offset = (XFS_LITINO(mp) - bytes) >> 3; /* rounded down */

	switch (dp->i_d.di_format) {
	case XFS_DINODE_FMT_DEV:
		minforkoff = roundup(sizeof(xfs_dev_t), 8) >> 3;
		return (offset >= minforkoff) ? minforkoff : 0;
	case XFS_DINODE_FMT_UUID:
		minforkoff = roundup(sizeof(uuid_t), 8) >> 3;
		return (offset >= minforkoff) ? minforkoff : 0;
	}

140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158
	/*
	 * If the requested numbers of bytes is smaller or equal to the
	 * current attribute fork size we can always proceed.
	 *
	 * Note that if_bytes in the data fork might actually be larger than
	 * the current data fork size is due to delalloc extents. In that
	 * case either the extent count will go down when they are converted
	 * to real extents, or the delalloc conversion will take care of the
	 * literal area rebalancing.
	 */
	if (bytes <= XFS_IFORK_ASIZE(dp))
		return dp->i_d.di_forkoff;

	/*
	 * For attr2 we can try to move the forkoff if there is space in the
	 * literal area, but for the old format we are done if there is no
	 * space in the fixed attribute fork.
	 */
	if (!(mp->m_flags & XFS_MOUNT_ATTR2))
159 160
		return 0;

161
	dsize = dp->i_df.if_bytes;
162

163 164
	switch (dp->i_d.di_format) {
	case XFS_DINODE_FMT_EXTENTS:
165
		/*
166
		 * If there is no attr fork and the data fork is extents, 
167 168 169
		 * determine if creating the default attr fork will result
		 * in the extents form migrating to btree. If so, the
		 * minimum offset only needs to be the space required for
170
		 * the btree root.
171
		 */
C
Christoph Hellwig 已提交
172 173
		if (!dp->i_d.di_forkoff && dp->i_df.if_bytes >
		    xfs_default_attroffset(dp))
174 175 176 177
			dsize = XFS_BMDR_SPACE_CALC(MINDBTPTRS);
		break;
	case XFS_DINODE_FMT_BTREE:
		/*
178 179 180
		 * If we have a data btree then keep forkoff if we have one,
		 * otherwise we are adding a new attr, so then we set
		 * minforkoff to where the btree root can finish so we have
181 182 183
		 * plenty of room for attrs
		 */
		if (dp->i_d.di_forkoff) {
184
			if (offset < dp->i_d.di_forkoff)
185
				return 0;
186 187 188
			return dp->i_d.di_forkoff;
		}
		dsize = XFS_BMAP_BROOT_SPACE(dp->i_df.if_broot);
189 190
		break;
	}
191 192 193

	/*
	 * A data fork btree root must have space for at least
194 195 196
	 * MINDBTPTRS key/ptr pairs if the data fork is small or empty.
	 */
	minforkoff = MAX(dsize, XFS_BMDR_SPACE_CALC(MINDBTPTRS));
197 198 199 200 201 202 203 204
	minforkoff = roundup(minforkoff, 8) >> 3;

	/* attr fork btree root can have at least this many key/ptr pairs */
	maxforkoff = XFS_LITINO(mp) - XFS_BMDR_SPACE_CALC(MINABTPTRS);
	maxforkoff = maxforkoff >> 3;	/* rounded down */

	if (offset >= maxforkoff)
		return maxforkoff;
205 206
	if (offset >= minforkoff)
		return offset;
207 208 209 210 211 212 213 214 215
	return 0;
}

/*
 * Switch on the ATTR2 superblock bit (implies also FEATURES2)
 */
STATIC void
xfs_sbversion_add_attr2(xfs_mount_t *mp, xfs_trans_t *tp)
{
216
	if ((mp->m_flags & XFS_MOUNT_ATTR2) &&
217
	    !(xfs_sb_version_hasattr2(&mp->m_sb))) {
E
Eric Sandeen 已提交
218
		spin_lock(&mp->m_sb_lock);
219 220
		if (!xfs_sb_version_hasattr2(&mp->m_sb)) {
			xfs_sb_version_addattr2(&mp->m_sb);
E
Eric Sandeen 已提交
221
			spin_unlock(&mp->m_sb_lock);
222 223
			xfs_mod_sb(tp, XFS_SB_VERSIONNUM | XFS_SB_FEATURES2);
		} else
E
Eric Sandeen 已提交
224
			spin_unlock(&mp->m_sb_lock);
225 226 227 228 229 230 231
	}
}

/*
 * Create the initial contents of a shortform attribute list.
 */
void
L
Linus Torvalds 已提交
232 233 234 235 236 237
xfs_attr_shortform_create(xfs_da_args_t *args)
{
	xfs_attr_sf_hdr_t *hdr;
	xfs_inode_t *dp;
	xfs_ifork_t *ifp;

238 239
	trace_xfs_attr_sf_create(args);

L
Linus Torvalds 已提交
240 241 242 243 244 245 246 247 248 249 250 251 252 253 254
	dp = args->dp;
	ASSERT(dp != NULL);
	ifp = dp->i_afp;
	ASSERT(ifp != NULL);
	ASSERT(ifp->if_bytes == 0);
	if (dp->i_d.di_aformat == XFS_DINODE_FMT_EXTENTS) {
		ifp->if_flags &= ~XFS_IFEXTENTS;	/* just in case */
		dp->i_d.di_aformat = XFS_DINODE_FMT_LOCAL;
		ifp->if_flags |= XFS_IFINLINE;
	} else {
		ASSERT(ifp->if_flags & XFS_IFINLINE);
	}
	xfs_idata_realloc(dp, sizeof(*hdr), XFS_ATTR_FORK);
	hdr = (xfs_attr_sf_hdr_t *)ifp->if_u1.if_data;
	hdr->count = 0;
255
	hdr->totsize = cpu_to_be16(sizeof(*hdr));
L
Linus Torvalds 已提交
256 257 258 259 260 261 262
	xfs_trans_log_inode(args->trans, dp, XFS_ILOG_CORE | XFS_ILOG_ADATA);
}

/*
 * Add a name/value pair to the shortform attribute list.
 * Overflow from the inode has already been checked for.
 */
263 264
void
xfs_attr_shortform_add(xfs_da_args_t *args, int forkoff)
L
Linus Torvalds 已提交
265 266 267 268
{
	xfs_attr_shortform_t *sf;
	xfs_attr_sf_entry_t *sfe;
	int i, offset, size;
269
	xfs_mount_t *mp;
L
Linus Torvalds 已提交
270 271 272
	xfs_inode_t *dp;
	xfs_ifork_t *ifp;

273 274
	trace_xfs_attr_sf_add(args);

L
Linus Torvalds 已提交
275
	dp = args->dp;
276 277 278
	mp = dp->i_mount;
	dp->i_d.di_forkoff = forkoff;

L
Linus Torvalds 已提交
279 280 281 282
	ifp = dp->i_afp;
	ASSERT(ifp->if_flags & XFS_IFINLINE);
	sf = (xfs_attr_shortform_t *)ifp->if_u1.if_data;
	sfe = &sf->list[0];
283
	for (i = 0; i < sf->hdr.count; sfe = XFS_ATTR_SF_NEXTENTRY(sfe), i++) {
284
#ifdef DEBUG
L
Linus Torvalds 已提交
285 286 287 288
		if (sfe->namelen != args->namelen)
			continue;
		if (memcmp(args->name, sfe->nameval, args->namelen) != 0)
			continue;
289
		if (!xfs_attr_namesp_match(args->flags, sfe->flags))
L
Linus Torvalds 已提交
290
			continue;
291 292
		ASSERT(0);
#endif
L
Linus Torvalds 已提交
293 294 295 296 297 298 299 300 301
	}

	offset = (char *)sfe - (char *)sf;
	size = XFS_ATTR_SF_ENTSIZE_BYNAME(args->namelen, args->valuelen);
	xfs_idata_realloc(dp, size, XFS_ATTR_FORK);
	sf = (xfs_attr_shortform_t *)ifp->if_u1.if_data;
	sfe = (xfs_attr_sf_entry_t *)((char *)sf + offset);

	sfe->namelen = args->namelen;
302
	sfe->valuelen = args->valuelen;
303
	sfe->flags = XFS_ATTR_NSP_ARGS_TO_ONDISK(args->flags);
L
Linus Torvalds 已提交
304 305
	memcpy(sfe->nameval, args->name, args->namelen);
	memcpy(&sfe->nameval[args->namelen], args->value, args->valuelen);
306
	sf->hdr.count++;
307
	be16_add_cpu(&sf->hdr.totsize, size);
L
Linus Torvalds 已提交
308 309
	xfs_trans_log_inode(args->trans, dp, XFS_ILOG_CORE | XFS_ILOG_ADATA);

310
	xfs_sbversion_add_attr2(mp, args->trans);
L
Linus Torvalds 已提交
311 312
}

313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331
/*
 * After the last attribute is removed revert to original inode format,
 * making all literal area available to the data fork once more.
 */
STATIC void
xfs_attr_fork_reset(
	struct xfs_inode	*ip,
	struct xfs_trans	*tp)
{
	xfs_idestroy_fork(ip, XFS_ATTR_FORK);
	ip->i_d.di_forkoff = 0;
	ip->i_d.di_aformat = XFS_DINODE_FMT_EXTENTS;

	ASSERT(ip->i_d.di_anextents == 0);
	ASSERT(ip->i_afp == NULL);

	xfs_trans_log_inode(tp, ip, XFS_ILOG_CORE);
}

L
Linus Torvalds 已提交
332
/*
333
 * Remove an attribute from the shortform attribute list structure.
L
Linus Torvalds 已提交
334 335 336 337 338 339 340
 */
int
xfs_attr_shortform_remove(xfs_da_args_t *args)
{
	xfs_attr_shortform_t *sf;
	xfs_attr_sf_entry_t *sfe;
	int base, size=0, end, totsize, i;
341
	xfs_mount_t *mp;
L
Linus Torvalds 已提交
342 343
	xfs_inode_t *dp;

344 345
	trace_xfs_attr_sf_remove(args);

L
Linus Torvalds 已提交
346
	dp = args->dp;
347
	mp = dp->i_mount;
L
Linus Torvalds 已提交
348 349 350
	base = sizeof(xfs_attr_sf_hdr_t);
	sf = (xfs_attr_shortform_t *)dp->i_afp->if_u1.if_data;
	sfe = &sf->list[0];
351
	end = sf->hdr.count;
352
	for (i = 0; i < end; sfe = XFS_ATTR_SF_NEXTENTRY(sfe),
L
Linus Torvalds 已提交
353 354 355 356 357 358
					base += size, i++) {
		size = XFS_ATTR_SF_ENTSIZE(sfe);
		if (sfe->namelen != args->namelen)
			continue;
		if (memcmp(sfe->nameval, args->name, args->namelen) != 0)
			continue;
359
		if (!xfs_attr_namesp_match(args->flags, sfe->flags))
L
Linus Torvalds 已提交
360 361 362
			continue;
		break;
	}
363
	if (i == end)
L
Linus Torvalds 已提交
364 365
		return(XFS_ERROR(ENOATTR));

366 367 368
	/*
	 * Fix up the attribute fork data, covering the hole
	 */
L
Linus Torvalds 已提交
369
	end = base + size;
370
	totsize = be16_to_cpu(sf->hdr.totsize);
371 372
	if (end != totsize)
		memmove(&((char *)sf)[base], &((char *)sf)[end], totsize - end);
373
	sf->hdr.count--;
374
	be16_add_cpu(&sf->hdr.totsize, -size);
375 376 377 378 379

	/*
	 * Fix up the start offset of the attribute fork
	 */
	totsize -= size;
380
	if (totsize == sizeof(xfs_attr_sf_hdr_t) &&
381 382 383 384
	    (mp->m_flags & XFS_MOUNT_ATTR2) &&
	    (dp->i_d.di_format != XFS_DINODE_FMT_BTREE) &&
	    !(args->op_flags & XFS_DA_OP_ADDNAME)) {
		xfs_attr_fork_reset(dp, args->trans);
385 386 387 388
	} else {
		xfs_idata_realloc(dp, -size, XFS_ATTR_FORK);
		dp->i_d.di_forkoff = xfs_attr_shortform_bytesfit(dp, totsize);
		ASSERT(dp->i_d.di_forkoff);
389 390 391 392
		ASSERT(totsize > sizeof(xfs_attr_sf_hdr_t) ||
				(args->op_flags & XFS_DA_OP_ADDNAME) ||
				!(mp->m_flags & XFS_MOUNT_ATTR2) ||
				dp->i_d.di_format == XFS_DINODE_FMT_BTREE);
393 394 395 396 397
		xfs_trans_log_inode(args->trans, dp,
					XFS_ILOG_CORE | XFS_ILOG_ADATA);
	}

	xfs_sbversion_add_attr2(mp, args->trans);
L
Linus Torvalds 已提交
398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413

	return(0);
}

/*
 * Look up a name in a shortform attribute list structure.
 */
/*ARGSUSED*/
int
xfs_attr_shortform_lookup(xfs_da_args_t *args)
{
	xfs_attr_shortform_t *sf;
	xfs_attr_sf_entry_t *sfe;
	int i;
	xfs_ifork_t *ifp;

414 415
	trace_xfs_attr_sf_lookup(args);

L
Linus Torvalds 已提交
416 417 418 419
	ifp = args->dp->i_afp;
	ASSERT(ifp->if_flags & XFS_IFINLINE);
	sf = (xfs_attr_shortform_t *)ifp->if_u1.if_data;
	sfe = &sf->list[0];
420
	for (i = 0; i < sf->hdr.count;
L
Linus Torvalds 已提交
421 422 423 424 425
				sfe = XFS_ATTR_SF_NEXTENTRY(sfe), i++) {
		if (sfe->namelen != args->namelen)
			continue;
		if (memcmp(args->name, sfe->nameval, args->namelen) != 0)
			continue;
426
		if (!xfs_attr_namesp_match(args->flags, sfe->flags))
L
Linus Torvalds 已提交
427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446
			continue;
		return(XFS_ERROR(EEXIST));
	}
	return(XFS_ERROR(ENOATTR));
}

/*
 * Look up a name in a shortform attribute list structure.
 */
/*ARGSUSED*/
int
xfs_attr_shortform_getvalue(xfs_da_args_t *args)
{
	xfs_attr_shortform_t *sf;
	xfs_attr_sf_entry_t *sfe;
	int i;

	ASSERT(args->dp->i_d.di_aformat == XFS_IFINLINE);
	sf = (xfs_attr_shortform_t *)args->dp->i_afp->if_u1.if_data;
	sfe = &sf->list[0];
447
	for (i = 0; i < sf->hdr.count;
L
Linus Torvalds 已提交
448 449 450 451 452
				sfe = XFS_ATTR_SF_NEXTENTRY(sfe), i++) {
		if (sfe->namelen != args->namelen)
			continue;
		if (memcmp(args->name, sfe->nameval, args->namelen) != 0)
			continue;
453
		if (!xfs_attr_namesp_match(args->flags, sfe->flags))
L
Linus Torvalds 已提交
454 455
			continue;
		if (args->flags & ATTR_KERNOVAL) {
456
			args->valuelen = sfe->valuelen;
L
Linus Torvalds 已提交
457 458
			return(XFS_ERROR(EEXIST));
		}
459 460
		if (args->valuelen < sfe->valuelen) {
			args->valuelen = sfe->valuelen;
L
Linus Torvalds 已提交
461 462
			return(XFS_ERROR(ERANGE));
		}
463
		args->valuelen = sfe->valuelen;
L
Linus Torvalds 已提交
464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483
		memcpy(args->value, &sfe->nameval[args->namelen],
						    args->valuelen);
		return(XFS_ERROR(EEXIST));
	}
	return(XFS_ERROR(ENOATTR));
}

/*
 * Convert from using the shortform to the leaf.
 */
int
xfs_attr_shortform_to_leaf(xfs_da_args_t *args)
{
	xfs_inode_t *dp;
	xfs_attr_shortform_t *sf;
	xfs_attr_sf_entry_t *sfe;
	xfs_da_args_t nargs;
	char *tmpbuffer;
	int error, i, size;
	xfs_dablk_t blkno;
484
	struct xfs_buf *bp;
L
Linus Torvalds 已提交
485 486
	xfs_ifork_t *ifp;

487 488
	trace_xfs_attr_sf_to_leaf(args);

L
Linus Torvalds 已提交
489 490 491
	dp = args->dp;
	ifp = dp->i_afp;
	sf = (xfs_attr_shortform_t *)ifp->if_u1.if_data;
492
	size = be16_to_cpu(sf->hdr.totsize);
L
Linus Torvalds 已提交
493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531
	tmpbuffer = kmem_alloc(size, KM_SLEEP);
	ASSERT(tmpbuffer != NULL);
	memcpy(tmpbuffer, ifp->if_u1.if_data, size);
	sf = (xfs_attr_shortform_t *)tmpbuffer;

	xfs_idata_realloc(dp, -size, XFS_ATTR_FORK);
	bp = NULL;
	error = xfs_da_grow_inode(args, &blkno);
	if (error) {
		/*
		 * If we hit an IO error middle of the transaction inside
		 * grow_inode(), we may have inconsistent data. Bail out.
		 */
		if (error == EIO)
			goto out;
		xfs_idata_realloc(dp, size, XFS_ATTR_FORK);	/* try to put */
		memcpy(ifp->if_u1.if_data, tmpbuffer, size);	/* it back */
		goto out;
	}

	ASSERT(blkno == 0);
	error = xfs_attr_leaf_create(args, blkno, &bp);
	if (error) {
		error = xfs_da_shrink_inode(args, 0, bp);
		bp = NULL;
		if (error)
			goto out;
		xfs_idata_realloc(dp, size, XFS_ATTR_FORK);	/* try to put */
		memcpy(ifp->if_u1.if_data, tmpbuffer, size);	/* it back */
		goto out;
	}

	memset((char *)&nargs, 0, sizeof(nargs));
	nargs.dp = dp;
	nargs.firstblock = args->firstblock;
	nargs.flist = args->flist;
	nargs.total = args->total;
	nargs.whichfork = XFS_ATTR_FORK;
	nargs.trans = args->trans;
532
	nargs.op_flags = XFS_DA_OP_OKNOENT;
L
Linus Torvalds 已提交
533 534

	sfe = &sf->list[0];
535
	for (i = 0; i < sf->hdr.count; i++) {
536
		nargs.name = sfe->nameval;
L
Linus Torvalds 已提交
537
		nargs.namelen = sfe->namelen;
538
		nargs.value = &sfe->nameval[nargs.namelen];
539
		nargs.valuelen = sfe->valuelen;
540
		nargs.hashval = xfs_da_hashname(sfe->nameval,
L
Linus Torvalds 已提交
541
						sfe->namelen);
542
		nargs.flags = XFS_ATTR_NSP_ONDISK_TO_ARGS(sfe->flags);
L
Linus Torvalds 已提交
543 544 545 546 547 548 549 550 551 552 553
		error = xfs_attr_leaf_lookup_int(bp, &nargs); /* set a->index */
		ASSERT(error == ENOATTR);
		error = xfs_attr_leaf_add(bp, &nargs);
		ASSERT(error != ENOSPC);
		if (error)
			goto out;
		sfe = XFS_ATTR_SF_NEXTENTRY(sfe);
	}
	error = 0;

out:
554
	kmem_free(tmpbuffer);
L
Linus Torvalds 已提交
555 556 557 558 559 560 561 562 563 564
	return(error);
}

STATIC int
xfs_attr_shortform_compare(const void *a, const void *b)
{
	xfs_attr_sf_sort_t *sa, *sb;

	sa = (xfs_attr_sf_sort_t *)a;
	sb = (xfs_attr_sf_sort_t *)b;
565
	if (sa->hash < sb->hash) {
L
Linus Torvalds 已提交
566
		return(-1);
567
	} else if (sa->hash > sb->hash) {
L
Linus Torvalds 已提交
568 569 570 571 572 573
		return(1);
	} else {
		return(sa->entno - sb->entno);
	}
}

574 575 576 577

#define XFS_ISRESET_CURSOR(cursor) \
	(!((cursor)->initted) && !((cursor)->hashval) && \
	 !((cursor)->blkno) && !((cursor)->offset))
L
Linus Torvalds 已提交
578 579
/*
 * Copy out entries of shortform attribute lists for attr_list().
580
 * Shortform attribute lists are not stored in hashval sorted order.
L
Linus Torvalds 已提交
581 582 583 584 585 586 587 588 589 590 591 592 593 594
 * If the output buffer is not large enough to hold them all, then we
 * we have to calculate each entries' hashvalue and sort them before
 * we can begin returning them to the user.
 */
/*ARGSUSED*/
int
xfs_attr_shortform_list(xfs_attr_list_context_t *context)
{
	attrlist_cursor_kern_t *cursor;
	xfs_attr_sf_sort_t *sbuf, *sbp;
	xfs_attr_shortform_t *sf;
	xfs_attr_sf_entry_t *sfe;
	xfs_inode_t *dp;
	int sbsize, nsbuf, count, i;
595
	int error;
L
Linus Torvalds 已提交
596 597 598 599 600 601 602 603 604 605 606 607

	ASSERT(context != NULL);
	dp = context->dp;
	ASSERT(dp != NULL);
	ASSERT(dp->i_afp != NULL);
	sf = (xfs_attr_shortform_t *)dp->i_afp->if_u1.if_data;
	ASSERT(sf != NULL);
	if (!sf->hdr.count)
		return(0);
	cursor = context->cursor;
	ASSERT(cursor != NULL);

C
Christoph Hellwig 已提交
608
	trace_xfs_attr_list_sf(context);
L
Linus Torvalds 已提交
609 610

	/*
611 612 613 614
	 * If the buffer is large enough and the cursor is at the start,
	 * do not bother with sorting since we will return everything in
	 * one buffer and another call using the cursor won't need to be
	 * made.
L
Linus Torvalds 已提交
615
	 * Note the generous fudge factor of 16 overhead bytes per entry.
616 617
	 * If bufsize is zero then put_listent must be a search function
	 * and can just scan through what we have.
L
Linus Torvalds 已提交
618
	 */
619 620 621
	if (context->bufsize == 0 ||
	    (XFS_ISRESET_CURSOR(cursor) &&
             (dp->i_afp->if_bytes + sf->hdr.count * 16) < context->bufsize)) {
622
		for (i = 0, sfe = &sf->list[0]; i < sf->hdr.count; i++) {
623
			error = context->put_listent(context,
624
					   sfe->flags,
625
					   sfe->nameval,
626 627
					   (int)sfe->namelen,
					   (int)sfe->valuelen,
628
					   &sfe->nameval[sfe->namelen]);
629 630 631 632 633 634 635 636 637 638

			/*
			 * Either search callback finished early or
			 * didn't fit it all in the buffer after all.
			 */
			if (context->seen_enough)
				break;

			if (error)
				return error;
L
Linus Torvalds 已提交
639 640
			sfe = XFS_ATTR_SF_NEXTENTRY(sfe);
		}
C
Christoph Hellwig 已提交
641
		trace_xfs_attr_list_sf_all(context);
L
Linus Torvalds 已提交
642 643 644
		return(0);
	}

645 646 647 648
	/* do no more for a search callback */
	if (context->bufsize == 0)
		return 0;

L
Linus Torvalds 已提交
649 650 651
	/*
	 * It didn't all fit, so we have to sort everything on hashval.
	 */
652
	sbsize = sf->hdr.count * sizeof(*sbuf);
653
	sbp = sbuf = kmem_alloc(sbsize, KM_SLEEP | KM_NOFS);
L
Linus Torvalds 已提交
654 655 656 657 658 659

	/*
	 * Scan the attribute list for the rest of the entries, storing
	 * the relevant info from only those that match into a buffer.
	 */
	nsbuf = 0;
660
	for (i = 0, sfe = &sf->list[0]; i < sf->hdr.count; i++) {
L
Linus Torvalds 已提交
661 662 663 664 665 666
		if (unlikely(
		    ((char *)sfe < (char *)sf) ||
		    ((char *)sfe >= ((char *)sf + dp->i_afp->if_bytes)))) {
			XFS_CORRUPTION_ERROR("xfs_attr_shortform_list",
					     XFS_ERRLEVEL_LOW,
					     context->dp->i_mount, sfe);
667
			kmem_free(sbuf);
L
Linus Torvalds 已提交
668 669
			return XFS_ERROR(EFSCORRUPTED);
		}
670

L
Linus Torvalds 已提交
671
		sbp->entno = i;
672 673
		sbp->hash = xfs_da_hashname(sfe->nameval, sfe->namelen);
		sbp->name = sfe->nameval;
L
Linus Torvalds 已提交
674 675 676 677 678 679 680 681 682 683 684 685
		sbp->namelen = sfe->namelen;
		/* These are bytes, and both on-disk, don't endian-flip */
		sbp->valuelen = sfe->valuelen;
		sbp->flags = sfe->flags;
		sfe = XFS_ATTR_SF_NEXTENTRY(sfe);
		sbp++;
		nsbuf++;
	}

	/*
	 * Sort the entries on hash then entno.
	 */
686
	xfs_sort(sbuf, nsbuf, sizeof(*sbuf), xfs_attr_shortform_compare);
L
Linus Torvalds 已提交
687 688 689 690 691 692 693 694

	/*
	 * Re-find our place IN THE SORTED LIST.
	 */
	count = 0;
	cursor->initted = 1;
	cursor->blkno = 0;
	for (sbp = sbuf, i = 0; i < nsbuf; i++, sbp++) {
695
		if (sbp->hash == cursor->hashval) {
L
Linus Torvalds 已提交
696 697 698 699
			if (cursor->offset == count) {
				break;
			}
			count++;
700
		} else if (sbp->hash > cursor->hashval) {
L
Linus Torvalds 已提交
701 702 703 704
			break;
		}
	}
	if (i == nsbuf) {
705
		kmem_free(sbuf);
L
Linus Torvalds 已提交
706 707 708 709 710 711 712
		return(0);
	}

	/*
	 * Loop putting entries into the user buffer.
	 */
	for ( ; i < nsbuf; i++, sbp++) {
713 714
		if (cursor->hashval != sbp->hash) {
			cursor->hashval = sbp->hash;
L
Linus Torvalds 已提交
715 716
			cursor->offset = 0;
		}
717
		error = context->put_listent(context,
718
					sbp->flags,
719 720 721 722 723 724 725 726
					sbp->name,
					sbp->namelen,
					sbp->valuelen,
					&sbp->name[sbp->namelen]);
		if (error)
			return error;
		if (context->seen_enough)
			break;
L
Linus Torvalds 已提交
727 728 729
		cursor->offset++;
	}

730
	kmem_free(sbuf);
L
Linus Torvalds 已提交
731 732 733 734 735 736 737 738
	return(0);
}

/*
 * Check a leaf attribute block to see if all the entries would fit into
 * a shortform attribute list.
 */
int
739 740 741
xfs_attr_shortform_allfit(
	struct xfs_buf	*bp,
	struct xfs_inode *dp)
L
Linus Torvalds 已提交
742 743 744 745 746 747
{
	xfs_attr_leafblock_t *leaf;
	xfs_attr_leaf_entry_t *entry;
	xfs_attr_leaf_name_local_t *name_loc;
	int bytes, i;

748
	leaf = bp->b_addr;
749
	ASSERT(leaf->hdr.info.magic == cpu_to_be16(XFS_ATTR_LEAF_MAGIC));
L
Linus Torvalds 已提交
750 751 752

	entry = &leaf->entries[0];
	bytes = sizeof(struct xfs_attr_sf_hdr);
753
	for (i = 0; i < be16_to_cpu(leaf->hdr.count); entry++, i++) {
L
Linus Torvalds 已提交
754 755 756 757
		if (entry->flags & XFS_ATTR_INCOMPLETE)
			continue;		/* don't copy partial entries */
		if (!(entry->flags & XFS_ATTR_LOCAL))
			return(0);
758
		name_loc = xfs_attr_leaf_name_local(leaf, i);
L
Linus Torvalds 已提交
759 760
		if (name_loc->namelen >= XFS_ATTR_SF_ENTSIZE_MAX)
			return(0);
761
		if (be16_to_cpu(name_loc->valuelen) >= XFS_ATTR_SF_ENTSIZE_MAX)
L
Linus Torvalds 已提交
762 763 764
			return(0);
		bytes += sizeof(struct xfs_attr_sf_entry)-1
				+ name_loc->namelen
765
				+ be16_to_cpu(name_loc->valuelen);
L
Linus Torvalds 已提交
766
	}
767
	if ((dp->i_mount->m_flags & XFS_MOUNT_ATTR2) &&
768
	    (dp->i_d.di_format != XFS_DINODE_FMT_BTREE) &&
769
	    (bytes == sizeof(struct xfs_attr_sf_hdr)))
770 771
		return(-1);
	return(xfs_attr_shortform_bytesfit(dp, bytes));
L
Linus Torvalds 已提交
772 773 774 775 776 777
}

/*
 * Convert a leaf attribute list to shortform attribute list
 */
int
778 779 780 781
xfs_attr_leaf_to_shortform(
	struct xfs_buf	*bp,
	xfs_da_args_t	*args,
	int		forkoff)
L
Linus Torvalds 已提交
782 783 784 785 786 787 788 789 790
{
	xfs_attr_leafblock_t *leaf;
	xfs_attr_leaf_entry_t *entry;
	xfs_attr_leaf_name_local_t *name_loc;
	xfs_da_args_t nargs;
	xfs_inode_t *dp;
	char *tmpbuffer;
	int error, i;

791 792
	trace_xfs_attr_leaf_to_sf(args);

L
Linus Torvalds 已提交
793 794 795 796 797
	dp = args->dp;
	tmpbuffer = kmem_alloc(XFS_LBSIZE(dp->i_mount), KM_SLEEP);
	ASSERT(tmpbuffer != NULL);

	ASSERT(bp != NULL);
798
	memcpy(tmpbuffer, bp->b_addr, XFS_LBSIZE(dp->i_mount));
L
Linus Torvalds 已提交
799
	leaf = (xfs_attr_leafblock_t *)tmpbuffer;
800
	ASSERT(leaf->hdr.info.magic == cpu_to_be16(XFS_ATTR_LEAF_MAGIC));
801
	memset(bp->b_addr, 0, XFS_LBSIZE(dp->i_mount));
L
Linus Torvalds 已提交
802 803 804 805 806 807 808

	/*
	 * Clean out the prior contents of the attribute list.
	 */
	error = xfs_da_shrink_inode(args, 0, bp);
	if (error)
		goto out;
809 810

	if (forkoff == -1) {
811
		ASSERT(dp->i_mount->m_flags & XFS_MOUNT_ATTR2);
812
		ASSERT(dp->i_d.di_format != XFS_DINODE_FMT_BTREE);
813
		xfs_attr_fork_reset(dp, args->trans);
L
Linus Torvalds 已提交
814
		goto out;
815 816 817
	}

	xfs_attr_shortform_create(args);
L
Linus Torvalds 已提交
818 819 820 821 822 823 824 825 826 827 828

	/*
	 * Copy the attributes
	 */
	memset((char *)&nargs, 0, sizeof(nargs));
	nargs.dp = dp;
	nargs.firstblock = args->firstblock;
	nargs.flist = args->flist;
	nargs.total = args->total;
	nargs.whichfork = XFS_ATTR_FORK;
	nargs.trans = args->trans;
829
	nargs.op_flags = XFS_DA_OP_OKNOENT;
L
Linus Torvalds 已提交
830
	entry = &leaf->entries[0];
831
	for (i = 0; i < be16_to_cpu(leaf->hdr.count); entry++, i++) {
L
Linus Torvalds 已提交
832 833 834 835 836
		if (entry->flags & XFS_ATTR_INCOMPLETE)
			continue;	/* don't copy partial entries */
		if (!entry->nameidx)
			continue;
		ASSERT(entry->flags & XFS_ATTR_LOCAL);
837
		name_loc = xfs_attr_leaf_name_local(leaf, i);
838
		nargs.name = name_loc->nameval;
L
Linus Torvalds 已提交
839
		nargs.namelen = name_loc->namelen;
840
		nargs.value = &name_loc->nameval[nargs.namelen];
841
		nargs.valuelen = be16_to_cpu(name_loc->valuelen);
842
		nargs.hashval = be32_to_cpu(entry->hashval);
843
		nargs.flags = XFS_ATTR_NSP_ONDISK_TO_ARGS(entry->flags);
844
		xfs_attr_shortform_add(&nargs, forkoff);
L
Linus Torvalds 已提交
845 846 847 848
	}
	error = 0;

out:
849
	kmem_free(tmpbuffer);
L
Linus Torvalds 已提交
850 851 852 853 854 855 856 857 858 859 860 861
	return(error);
}

/*
 * Convert from using a single leaf to a root node and a leaf.
 */
int
xfs_attr_leaf_to_node(xfs_da_args_t *args)
{
	xfs_attr_leafblock_t *leaf;
	xfs_da_intnode_t *node;
	xfs_inode_t *dp;
862
	struct xfs_buf *bp1, *bp2;
L
Linus Torvalds 已提交
863 864 865
	xfs_dablk_t blkno;
	int error;

866 867
	trace_xfs_attr_leaf_to_node(args);

L
Linus Torvalds 已提交
868 869 870 871 872 873
	dp = args->dp;
	bp1 = bp2 = NULL;
	error = xfs_da_grow_inode(args, &blkno);
	if (error)
		goto out;
	error = xfs_da_read_buf(args->trans, args->dp, 0, -1, &bp1,
874
					     XFS_ATTR_FORK, NULL);
L
Linus Torvalds 已提交
875 876 877 878 879 880 881 882 883
	if (error)
		goto out;
	ASSERT(bp1 != NULL);
	bp2 = NULL;
	error = xfs_da_get_buf(args->trans, args->dp, blkno, -1, &bp2,
					    XFS_ATTR_FORK);
	if (error)
		goto out;
	ASSERT(bp2 != NULL);
884
	memcpy(bp2->b_addr, bp1->b_addr, XFS_LBSIZE(dp->i_mount));
L
Linus Torvalds 已提交
885
	bp1 = NULL;
886
	xfs_trans_log_buf(args->trans, bp2, 0, XFS_LBSIZE(dp->i_mount) - 1);
L
Linus Torvalds 已提交
887 888 889 890 891 892 893

	/*
	 * Set up the new root node.
	 */
	error = xfs_da_node_create(args, 0, 1, &bp1, XFS_ATTR_FORK);
	if (error)
		goto out;
894 895
	node = bp1->b_addr;
	leaf = bp2->b_addr;
896
	ASSERT(leaf->hdr.info.magic == cpu_to_be16(XFS_ATTR_LEAF_MAGIC));
L
Linus Torvalds 已提交
897 898
	/* both on-disk, don't endian-flip twice */
	node->btree[0].hashval =
899
		leaf->entries[be16_to_cpu(leaf->hdr.count)-1 ].hashval;
900
	node->btree[0].before = cpu_to_be32(blkno);
901
	node->hdr.count = cpu_to_be16(1);
902
	xfs_trans_log_buf(args->trans, bp1, 0, XFS_LBSIZE(dp->i_mount) - 1);
L
Linus Torvalds 已提交
903 904 905 906 907 908 909 910 911 912 913 914 915 916
	error = 0;
out:
	return(error);
}


/*========================================================================
 * Routines used for growing the Btree.
 *========================================================================*/

/*
 * Create the initial contents of a leaf attribute list
 * or a leaf in a node attribute list.
 */
917
STATIC int
918 919 920 921
xfs_attr_leaf_create(
	xfs_da_args_t	*args,
	xfs_dablk_t	blkno,
	struct xfs_buf	**bpp)
L
Linus Torvalds 已提交
922 923 924 925
{
	xfs_attr_leafblock_t *leaf;
	xfs_attr_leaf_hdr_t *hdr;
	xfs_inode_t *dp;
926
	struct xfs_buf *bp;
L
Linus Torvalds 已提交
927 928
	int error;

929 930
	trace_xfs_attr_leaf_create(args);

L
Linus Torvalds 已提交
931 932 933 934 935 936 937
	dp = args->dp;
	ASSERT(dp != NULL);
	error = xfs_da_get_buf(args->trans, args->dp, blkno, -1, &bp,
					    XFS_ATTR_FORK);
	if (error)
		return(error);
	ASSERT(bp != NULL);
938
	leaf = bp->b_addr;
L
Linus Torvalds 已提交
939 940
	memset((char *)leaf, 0, XFS_LBSIZE(dp->i_mount));
	hdr = &leaf->hdr;
941
	hdr->info.magic = cpu_to_be16(XFS_ATTR_LEAF_MAGIC);
942
	hdr->firstused = cpu_to_be16(XFS_LBSIZE(dp->i_mount));
L
Linus Torvalds 已提交
943
	if (!hdr->firstused) {
944
		hdr->firstused = cpu_to_be16(
L
Linus Torvalds 已提交
945 946 947
			XFS_LBSIZE(dp->i_mount) - XFS_ATTR_LEAF_NAME_ALIGN);
	}

948 949 950
	hdr->freemap[0].base = cpu_to_be16(sizeof(xfs_attr_leaf_hdr_t));
	hdr->freemap[0].size = cpu_to_be16(be16_to_cpu(hdr->firstused) -
					   sizeof(xfs_attr_leaf_hdr_t));
L
Linus Torvalds 已提交
951

952
	xfs_trans_log_buf(args->trans, bp, 0, XFS_LBSIZE(dp->i_mount) - 1);
L
Linus Torvalds 已提交
953 954 955 956 957 958 959 960 961 962 963 964 965 966 967

	*bpp = bp;
	return(0);
}

/*
 * Split the leaf node, rebalance, then add the new entry.
 */
int
xfs_attr_leaf_split(xfs_da_state_t *state, xfs_da_state_blk_t *oldblk,
				   xfs_da_state_blk_t *newblk)
{
	xfs_dablk_t blkno;
	int error;

968 969
	trace_xfs_attr_leaf_split(state->args);

L
Linus Torvalds 已提交
970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998
	/*
	 * Allocate space for a new leaf node.
	 */
	ASSERT(oldblk->magic == XFS_ATTR_LEAF_MAGIC);
	error = xfs_da_grow_inode(state->args, &blkno);
	if (error)
		return(error);
	error = xfs_attr_leaf_create(state->args, blkno, &newblk->bp);
	if (error)
		return(error);
	newblk->blkno = blkno;
	newblk->magic = XFS_ATTR_LEAF_MAGIC;

	/*
	 * Rebalance the entries across the two leaves.
	 * NOTE: rebalance() currently depends on the 2nd block being empty.
	 */
	xfs_attr_leaf_rebalance(state, oldblk, newblk);
	error = xfs_da_blk_link(state, oldblk, newblk);
	if (error)
		return(error);

	/*
	 * Save info on "old" attribute for "atomic rename" ops, leaf_add()
	 * modifies the index/blkno/rmtblk/rmtblkcnt fields to show the
	 * "new" attrs info.  Will need the "old" info to remove it later.
	 *
	 * Insert the "new" entry in the correct block.
	 */
999 1000
	if (state->inleaf) {
		trace_xfs_attr_leaf_add_old(state->args);
L
Linus Torvalds 已提交
1001
		error = xfs_attr_leaf_add(oldblk->bp, state->args);
1002 1003
	} else {
		trace_xfs_attr_leaf_add_new(state->args);
L
Linus Torvalds 已提交
1004
		error = xfs_attr_leaf_add(newblk->bp, state->args);
1005
	}
L
Linus Torvalds 已提交
1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018

	/*
	 * Update last hashval in each block since we added the name.
	 */
	oldblk->hashval = xfs_attr_leaf_lasthash(oldblk->bp, NULL);
	newblk->hashval = xfs_attr_leaf_lasthash(newblk->bp, NULL);
	return(error);
}

/*
 * Add a name to the leaf attribute list structure.
 */
int
1019 1020 1021
xfs_attr_leaf_add(
	struct xfs_buf		*bp,
	struct xfs_da_args	*args)
L
Linus Torvalds 已提交
1022 1023 1024 1025 1026 1027
{
	xfs_attr_leafblock_t *leaf;
	xfs_attr_leaf_hdr_t *hdr;
	xfs_attr_leaf_map_t *map;
	int tablesize, entsize, sum, tmp, i;

1028 1029
	trace_xfs_attr_leaf_add(args);

1030
	leaf = bp->b_addr;
1031
	ASSERT(leaf->hdr.info.magic == cpu_to_be16(XFS_ATTR_LEAF_MAGIC));
L
Linus Torvalds 已提交
1032
	ASSERT((args->index >= 0)
1033
		&& (args->index <= be16_to_cpu(leaf->hdr.count)));
L
Linus Torvalds 已提交
1034
	hdr = &leaf->hdr;
1035
	entsize = xfs_attr_leaf_newentsize(args->namelen, args->valuelen,
L
Linus Torvalds 已提交
1036 1037 1038 1039 1040 1041
			   args->trans->t_mountp->m_sb.sb_blocksize, NULL);

	/*
	 * Search through freemap for first-fit on new name length.
	 * (may need to figure in size of entry struct too)
	 */
1042
	tablesize = (be16_to_cpu(hdr->count) + 1)
L
Linus Torvalds 已提交
1043 1044 1045 1046
					* sizeof(xfs_attr_leaf_entry_t)
					+ sizeof(xfs_attr_leaf_hdr_t);
	map = &hdr->freemap[XFS_ATTR_LEAF_MAPSIZE-1];
	for (sum = 0, i = XFS_ATTR_LEAF_MAPSIZE-1; i >= 0; map--, i--) {
1047 1048
		if (tablesize > be16_to_cpu(hdr->firstused)) {
			sum += be16_to_cpu(map->size);
L
Linus Torvalds 已提交
1049 1050 1051 1052 1053
			continue;
		}
		if (!map->size)
			continue;	/* no space in this map */
		tmp = entsize;
1054
		if (be16_to_cpu(map->base) < be16_to_cpu(hdr->firstused))
L
Linus Torvalds 已提交
1055
			tmp += sizeof(xfs_attr_leaf_entry_t);
1056
		if (be16_to_cpu(map->size) >= tmp) {
L
Linus Torvalds 已提交
1057 1058 1059
			tmp = xfs_attr_leaf_add_work(bp, args, i);
			return(tmp);
		}
1060
		sum += be16_to_cpu(map->size);
L
Linus Torvalds 已提交
1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074
	}

	/*
	 * If there are no holes in the address space of the block,
	 * and we don't have enough freespace, then compaction will do us
	 * no good and we should just give up.
	 */
	if (!hdr->holes && (sum < entsize))
		return(XFS_ERROR(ENOSPC));

	/*
	 * Compact the entries to coalesce free space.
	 * This may change the hdr->count via dropping INCOMPLETE entries.
	 */
1075
	xfs_attr_leaf_compact(args, bp);
L
Linus Torvalds 已提交
1076 1077 1078 1079 1080

	/*
	 * After compaction, the block is guaranteed to have only one
	 * free region, in freemap[0].  If it is not big enough, give up.
	 */
1081
	if (be16_to_cpu(hdr->freemap[0].size)
L
Linus Torvalds 已提交
1082 1083 1084 1085 1086 1087 1088 1089 1090 1091
				< (entsize + sizeof(xfs_attr_leaf_entry_t)))
		return(XFS_ERROR(ENOSPC));

	return(xfs_attr_leaf_add_work(bp, args, 0));
}

/*
 * Add a name to a leaf attribute list structure.
 */
STATIC int
1092 1093 1094 1095
xfs_attr_leaf_add_work(
	struct xfs_buf	*bp,
	xfs_da_args_t	*args,
	int		mapindex)
L
Linus Torvalds 已提交
1096 1097 1098 1099 1100 1101 1102 1103 1104 1105
{
	xfs_attr_leafblock_t *leaf;
	xfs_attr_leaf_hdr_t *hdr;
	xfs_attr_leaf_entry_t *entry;
	xfs_attr_leaf_name_local_t *name_loc;
	xfs_attr_leaf_name_remote_t *name_rmt;
	xfs_attr_leaf_map_t *map;
	xfs_mount_t *mp;
	int tmp, i;

1106 1107
	trace_xfs_attr_leaf_add_work(args);

1108
	leaf = bp->b_addr;
1109
	ASSERT(leaf->hdr.info.magic == cpu_to_be16(XFS_ATTR_LEAF_MAGIC));
L
Linus Torvalds 已提交
1110 1111
	hdr = &leaf->hdr;
	ASSERT((mapindex >= 0) && (mapindex < XFS_ATTR_LEAF_MAPSIZE));
1112
	ASSERT((args->index >= 0) && (args->index <= be16_to_cpu(hdr->count)));
L
Linus Torvalds 已提交
1113 1114 1115 1116 1117

	/*
	 * Force open some space in the entry array and fill it in.
	 */
	entry = &leaf->entries[args->index];
1118 1119
	if (args->index < be16_to_cpu(hdr->count)) {
		tmp  = be16_to_cpu(hdr->count) - args->index;
L
Linus Torvalds 已提交
1120 1121
		tmp *= sizeof(xfs_attr_leaf_entry_t);
		memmove((char *)(entry+1), (char *)entry, tmp);
1122
		xfs_trans_log_buf(args->trans, bp,
L
Linus Torvalds 已提交
1123 1124
		    XFS_DA_LOGRANGE(leaf, entry, tmp + sizeof(*entry)));
	}
1125
	be16_add_cpu(&hdr->count, 1);
L
Linus Torvalds 已提交
1126 1127 1128 1129 1130 1131

	/*
	 * Allocate space for the new string (at the end of the run).
	 */
	map = &hdr->freemap[mapindex];
	mp = args->trans->t_mountp;
1132 1133 1134
	ASSERT(be16_to_cpu(map->base) < XFS_LBSIZE(mp));
	ASSERT((be16_to_cpu(map->base) & 0x3) == 0);
	ASSERT(be16_to_cpu(map->size) >=
1135 1136
		xfs_attr_leaf_newentsize(args->namelen, args->valuelen,
					 mp->m_sb.sb_blocksize, NULL));
1137 1138
	ASSERT(be16_to_cpu(map->size) < XFS_LBSIZE(mp));
	ASSERT((be16_to_cpu(map->size) & 0x3) == 0);
1139
	be16_add_cpu(&map->size,
1140 1141
		-xfs_attr_leaf_newentsize(args->namelen, args->valuelen,
					  mp->m_sb.sb_blocksize, &tmp));
1142 1143 1144
	entry->nameidx = cpu_to_be16(be16_to_cpu(map->base) +
				     be16_to_cpu(map->size));
	entry->hashval = cpu_to_be32(args->hashval);
L
Linus Torvalds 已提交
1145
	entry->flags = tmp ? XFS_ATTR_LOCAL : 0;
1146
	entry->flags |= XFS_ATTR_NSP_ARGS_TO_ONDISK(args->flags);
1147
	if (args->op_flags & XFS_DA_OP_RENAME) {
L
Linus Torvalds 已提交
1148 1149 1150 1151 1152 1153
		entry->flags |= XFS_ATTR_INCOMPLETE;
		if ((args->blkno2 == args->blkno) &&
		    (args->index2 <= args->index)) {
			args->index2++;
		}
	}
1154
	xfs_trans_log_buf(args->trans, bp,
L
Linus Torvalds 已提交
1155
			  XFS_DA_LOGRANGE(leaf, entry, sizeof(*entry)));
1156 1157
	ASSERT((args->index == 0) ||
	       (be32_to_cpu(entry->hashval) >= be32_to_cpu((entry-1)->hashval)));
1158
	ASSERT((args->index == be16_to_cpu(hdr->count)-1) ||
1159
	       (be32_to_cpu(entry->hashval) <= be32_to_cpu((entry+1)->hashval)));
L
Linus Torvalds 已提交
1160 1161 1162 1163 1164 1165 1166 1167 1168

	/*
	 * For "remote" attribute values, simply note that we need to
	 * allocate space for the "remote" value.  We can't actually
	 * allocate the extents in this transaction, and we can't decide
	 * which blocks they should be as we might allocate more blocks
	 * as part of this transaction (a split operation for example).
	 */
	if (entry->flags & XFS_ATTR_LOCAL) {
1169
		name_loc = xfs_attr_leaf_name_local(leaf, args->index);
L
Linus Torvalds 已提交
1170
		name_loc->namelen = args->namelen;
1171
		name_loc->valuelen = cpu_to_be16(args->valuelen);
L
Linus Torvalds 已提交
1172 1173
		memcpy((char *)name_loc->nameval, args->name, args->namelen);
		memcpy((char *)&name_loc->nameval[args->namelen], args->value,
1174
				   be16_to_cpu(name_loc->valuelen));
L
Linus Torvalds 已提交
1175
	} else {
1176
		name_rmt = xfs_attr_leaf_name_remote(leaf, args->index);
L
Linus Torvalds 已提交
1177 1178 1179 1180 1181 1182 1183 1184 1185
		name_rmt->namelen = args->namelen;
		memcpy((char *)name_rmt->name, args->name, args->namelen);
		entry->flags |= XFS_ATTR_INCOMPLETE;
		/* just in case */
		name_rmt->valuelen = 0;
		name_rmt->valueblk = 0;
		args->rmtblkno = 1;
		args->rmtblkcnt = XFS_B_TO_FSB(mp, args->valuelen);
	}
1186
	xfs_trans_log_buf(args->trans, bp,
1187
	     XFS_DA_LOGRANGE(leaf, xfs_attr_leaf_name(leaf, args->index),
L
Linus Torvalds 已提交
1188 1189 1190 1191 1192
				   xfs_attr_leaf_entsize(leaf, args->index)));

	/*
	 * Update the control info for this leaf node
	 */
1193
	if (be16_to_cpu(entry->nameidx) < be16_to_cpu(hdr->firstused)) {
L
Linus Torvalds 已提交
1194 1195 1196
		/* both on-disk, don't endian-flip twice */
		hdr->firstused = entry->nameidx;
	}
1197 1198 1199
	ASSERT(be16_to_cpu(hdr->firstused) >=
	       ((be16_to_cpu(hdr->count) * sizeof(*entry)) + sizeof(*hdr)));
	tmp = (be16_to_cpu(hdr->count)-1) * sizeof(xfs_attr_leaf_entry_t)
L
Linus Torvalds 已提交
1200 1201 1202
					+ sizeof(xfs_attr_leaf_hdr_t);
	map = &hdr->freemap[0];
	for (i = 0; i < XFS_ATTR_LEAF_MAPSIZE; map++, i++) {
1203
		if (be16_to_cpu(map->base) == tmp) {
1204 1205
			be16_add_cpu(&map->base, sizeof(xfs_attr_leaf_entry_t));
			be16_add_cpu(&map->size,
1206
				 -((int)sizeof(xfs_attr_leaf_entry_t)));
L
Linus Torvalds 已提交
1207 1208
		}
	}
1209
	be16_add_cpu(&hdr->usedbytes, xfs_attr_leaf_entsize(leaf, args->index));
1210
	xfs_trans_log_buf(args->trans, bp,
L
Linus Torvalds 已提交
1211 1212 1213 1214 1215 1216 1217 1218
		XFS_DA_LOGRANGE(leaf, hdr, sizeof(*hdr)));
	return(0);
}

/*
 * Garbage collect a leaf attribute list block by copying it to a new buffer.
 */
STATIC void
1219
xfs_attr_leaf_compact(
1220 1221
	struct xfs_da_args	*args,
	struct xfs_buf		*bp)
L
Linus Torvalds 已提交
1222
{
1223 1224 1225 1226 1227 1228 1229
	xfs_attr_leafblock_t	*leaf_s, *leaf_d;
	xfs_attr_leaf_hdr_t	*hdr_s, *hdr_d;
	struct xfs_trans	*trans = args->trans;
	struct xfs_mount	*mp = trans->t_mountp;
	char			*tmpbuffer;

	trace_xfs_attr_leaf_compact(args);
L
Linus Torvalds 已提交
1230 1231 1232

	tmpbuffer = kmem_alloc(XFS_LBSIZE(mp), KM_SLEEP);
	ASSERT(tmpbuffer != NULL);
1233 1234
	memcpy(tmpbuffer, bp->b_addr, XFS_LBSIZE(mp));
	memset(bp->b_addr, 0, XFS_LBSIZE(mp));
L
Linus Torvalds 已提交
1235 1236 1237 1238 1239

	/*
	 * Copy basic information
	 */
	leaf_s = (xfs_attr_leafblock_t *)tmpbuffer;
1240
	leaf_d = bp->b_addr;
L
Linus Torvalds 已提交
1241 1242 1243
	hdr_s = &leaf_s->hdr;
	hdr_d = &leaf_d->hdr;
	hdr_d->info = hdr_s->info;	/* struct copy */
1244
	hdr_d->firstused = cpu_to_be16(XFS_LBSIZE(mp));
L
Linus Torvalds 已提交
1245 1246
	/* handle truncation gracefully */
	if (!hdr_d->firstused) {
1247
		hdr_d->firstused = cpu_to_be16(
L
Linus Torvalds 已提交
1248 1249 1250 1251 1252
				XFS_LBSIZE(mp) - XFS_ATTR_LEAF_NAME_ALIGN);
	}
	hdr_d->usedbytes = 0;
	hdr_d->count = 0;
	hdr_d->holes = 0;
1253 1254 1255
	hdr_d->freemap[0].base = cpu_to_be16(sizeof(xfs_attr_leaf_hdr_t));
	hdr_d->freemap[0].size = cpu_to_be16(be16_to_cpu(hdr_d->firstused) -
					     sizeof(xfs_attr_leaf_hdr_t));
L
Linus Torvalds 已提交
1256 1257 1258 1259 1260 1261

	/*
	 * Copy all entry's in the same (sorted) order,
	 * but allocate name/value pairs packed and in sequence.
	 */
	xfs_attr_leaf_moveents(leaf_s, 0, leaf_d, 0,
1262
				be16_to_cpu(hdr_s->count), mp);
1263
	xfs_trans_log_buf(trans, bp, 0, XFS_LBSIZE(mp) - 1);
L
Linus Torvalds 已提交
1264

1265
	kmem_free(tmpbuffer);
L
Linus Torvalds 已提交
1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294
}

/*
 * Redistribute the attribute list entries between two leaf nodes,
 * taking into account the size of the new entry.
 *
 * NOTE: if new block is empty, then it will get the upper half of the
 * old block.  At present, all (one) callers pass in an empty second block.
 *
 * This code adjusts the args->index/blkno and args->index2/blkno2 fields
 * to match what it is doing in splitting the attribute leaf block.  Those
 * values are used in "atomic rename" operations on attributes.  Note that
 * the "new" and "old" values can end up in different blocks.
 */
STATIC void
xfs_attr_leaf_rebalance(xfs_da_state_t *state, xfs_da_state_blk_t *blk1,
				       xfs_da_state_blk_t *blk2)
{
	xfs_da_args_t *args;
	xfs_da_state_blk_t *tmp_blk;
	xfs_attr_leafblock_t *leaf1, *leaf2;
	xfs_attr_leaf_hdr_t *hdr1, *hdr2;
	int count, totallen, max, space, swap;

	/*
	 * Set up environment.
	 */
	ASSERT(blk1->magic == XFS_ATTR_LEAF_MAGIC);
	ASSERT(blk2->magic == XFS_ATTR_LEAF_MAGIC);
1295 1296
	leaf1 = blk1->bp->b_addr;
	leaf2 = blk2->bp->b_addr;
1297 1298
	ASSERT(leaf1->hdr.info.magic == cpu_to_be16(XFS_ATTR_LEAF_MAGIC));
	ASSERT(leaf2->hdr.info.magic == cpu_to_be16(XFS_ATTR_LEAF_MAGIC));
1299
	ASSERT(leaf2->hdr.count == 0);
L
Linus Torvalds 已提交
1300 1301
	args = state->args;

1302 1303
	trace_xfs_attr_leaf_rebalance(args);

L
Linus Torvalds 已提交
1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314
	/*
	 * Check ordering of blocks, reverse if it makes things simpler.
	 *
	 * NOTE: Given that all (current) callers pass in an empty
	 * second block, this code should never set "swap".
	 */
	swap = 0;
	if (xfs_attr_leaf_order(blk1->bp, blk2->bp)) {
		tmp_blk = blk1;
		blk1 = blk2;
		blk2 = tmp_blk;
1315 1316
		leaf1 = blk1->bp->b_addr;
		leaf2 = blk2->bp->b_addr;
L
Linus Torvalds 已提交
1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337
		swap = 1;
	}
	hdr1 = &leaf1->hdr;
	hdr2 = &leaf2->hdr;

	/*
	 * Examine entries until we reduce the absolute difference in
	 * byte usage between the two blocks to a minimum.  Then get
	 * the direction to copy and the number of elements to move.
	 *
	 * "inleaf" is true if the new entry should be inserted into blk1.
	 * If "swap" is also true, then reverse the sense of "inleaf".
	 */
	state->inleaf = xfs_attr_leaf_figure_balance(state, blk1, blk2,
							    &count, &totallen);
	if (swap)
		state->inleaf = !state->inleaf;

	/*
	 * Move any entries required from leaf to leaf:
	 */
1338
	if (count < be16_to_cpu(hdr1->count)) {
L
Linus Torvalds 已提交
1339 1340 1341 1342
		/*
		 * Figure the total bytes to be added to the destination leaf.
		 */
		/* number entries being moved */
1343 1344
		count = be16_to_cpu(hdr1->count) - count;
		space  = be16_to_cpu(hdr1->usedbytes) - totallen;
L
Linus Torvalds 已提交
1345 1346 1347 1348 1349
		space += count * sizeof(xfs_attr_leaf_entry_t);

		/*
		 * leaf2 is the destination, compact it if it looks tight.
		 */
1350
		max  = be16_to_cpu(hdr2->firstused)
L
Linus Torvalds 已提交
1351
						- sizeof(xfs_attr_leaf_hdr_t);
1352
		max -= be16_to_cpu(hdr2->count) * sizeof(xfs_attr_leaf_entry_t);
1353 1354
		if (space > max)
			xfs_attr_leaf_compact(args, blk2->bp);
L
Linus Torvalds 已提交
1355 1356 1357 1358

		/*
		 * Move high entries from leaf1 to low end of leaf2.
		 */
1359
		xfs_attr_leaf_moveents(leaf1, be16_to_cpu(hdr1->count) - count,
L
Linus Torvalds 已提交
1360 1361
				leaf2, 0, count, state->mp);

1362 1363
		xfs_trans_log_buf(args->trans, blk1->bp, 0, state->blocksize-1);
		xfs_trans_log_buf(args->trans, blk2->bp, 0, state->blocksize-1);
1364
	} else if (count > be16_to_cpu(hdr1->count)) {
L
Linus Torvalds 已提交
1365 1366 1367 1368
		/*
		 * I assert that since all callers pass in an empty
		 * second buffer, this code should never execute.
		 */
1369
		ASSERT(0);
L
Linus Torvalds 已提交
1370 1371 1372 1373 1374

		/*
		 * Figure the total bytes to be added to the destination leaf.
		 */
		/* number entries being moved */
1375 1376
		count -= be16_to_cpu(hdr1->count);
		space  = totallen - be16_to_cpu(hdr1->usedbytes);
L
Linus Torvalds 已提交
1377 1378 1379 1380 1381
		space += count * sizeof(xfs_attr_leaf_entry_t);

		/*
		 * leaf1 is the destination, compact it if it looks tight.
		 */
1382
		max  = be16_to_cpu(hdr1->firstused)
L
Linus Torvalds 已提交
1383
						- sizeof(xfs_attr_leaf_hdr_t);
1384
		max -= be16_to_cpu(hdr1->count) * sizeof(xfs_attr_leaf_entry_t);
1385 1386
		if (space > max)
			xfs_attr_leaf_compact(args, blk1->bp);
L
Linus Torvalds 已提交
1387 1388 1389 1390 1391

		/*
		 * Move low entries from leaf2 to high end of leaf1.
		 */
		xfs_attr_leaf_moveents(leaf2, 0, leaf1,
1392
				be16_to_cpu(hdr1->count), count, state->mp);
L
Linus Torvalds 已提交
1393

1394 1395
		xfs_trans_log_buf(args->trans, blk1->bp, 0, state->blocksize-1);
		xfs_trans_log_buf(args->trans, blk2->bp, 0, state->blocksize-1);
L
Linus Torvalds 已提交
1396 1397 1398 1399 1400
	}

	/*
	 * Copy out last hashval in each block for B-tree code.
	 */
1401 1402 1403 1404
	blk1->hashval = be32_to_cpu(
		leaf1->entries[be16_to_cpu(leaf1->hdr.count)-1].hashval);
	blk2->hashval = be32_to_cpu(
		leaf2->entries[be16_to_cpu(leaf2->hdr.count)-1].hashval);
L
Linus Torvalds 已提交
1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 1417

	/*
	 * Adjust the expected index for insertion.
	 * NOTE: this code depends on the (current) situation that the
	 * second block was originally empty.
	 *
	 * If the insertion point moved to the 2nd block, we must adjust
	 * the index.  We must also track the entry just following the
	 * new entry for use in an "atomic rename" operation, that entry
	 * is always the "old" entry and the "new" entry is what we are
	 * inserting.  The index/blkno fields refer to the "old" entry,
	 * while the index2/blkno2 fields refer to the "new" entry.
	 */
1418
	if (blk1->index > be16_to_cpu(leaf1->hdr.count)) {
L
Linus Torvalds 已提交
1419
		ASSERT(state->inleaf == 0);
1420
		blk2->index = blk1->index - be16_to_cpu(leaf1->hdr.count);
L
Linus Torvalds 已提交
1421 1422
		args->index = args->index2 = blk2->index;
		args->blkno = args->blkno2 = blk2->blkno;
1423
	} else if (blk1->index == be16_to_cpu(leaf1->hdr.count)) {
L
Linus Torvalds 已提交
1424 1425 1426 1427 1428 1429
		if (state->inleaf) {
			args->index = blk1->index;
			args->blkno = blk1->blkno;
			args->index2 = 0;
			args->blkno2 = blk2->blkno;
		} else {
1430 1431 1432 1433 1434
			/*
			 * On a double leaf split, the original attr location
			 * is already stored in blkno2/index2, so don't
			 * overwrite it overwise we corrupt the tree.
			 */
L
Linus Torvalds 已提交
1435
			blk2->index = blk1->index
1436
				    - be16_to_cpu(leaf1->hdr.count);
1437 1438 1439 1440 1441 1442 1443 1444 1445 1446 1447
			args->index = blk2->index;
			args->blkno = blk2->blkno;
			if (!state->extravalid) {
				/*
				 * set the new attr location to match the old
				 * one and let the higher level split code
				 * decide where in the leaf to place it.
				 */
				args->index2 = blk2->index;
				args->blkno2 = blk2->blkno;
			}
L
Linus Torvalds 已提交
1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466 1467 1468 1469 1470 1471 1472 1473 1474 1475 1476 1477
		}
	} else {
		ASSERT(state->inleaf == 1);
		args->index = args->index2 = blk1->index;
		args->blkno = args->blkno2 = blk1->blkno;
	}
}

/*
 * Examine entries until we reduce the absolute difference in
 * byte usage between the two blocks to a minimum.
 * GROT: Is this really necessary?  With other than a 512 byte blocksize,
 * GROT: there will always be enough room in either block for a new entry.
 * GROT: Do a double-split for this case?
 */
STATIC int
xfs_attr_leaf_figure_balance(xfs_da_state_t *state,
				    xfs_da_state_blk_t *blk1,
				    xfs_da_state_blk_t *blk2,
				    int *countarg, int *usedbytesarg)
{
	xfs_attr_leafblock_t *leaf1, *leaf2;
	xfs_attr_leaf_hdr_t *hdr1, *hdr2;
	xfs_attr_leaf_entry_t *entry;
	int count, max, index, totallen, half;
	int lastdelta, foundit, tmp;

	/*
	 * Set up environment.
	 */
1478 1479
	leaf1 = blk1->bp->b_addr;
	leaf2 = blk2->bp->b_addr;
L
Linus Torvalds 已提交
1480 1481 1482 1483 1484 1485 1486 1487 1488
	hdr1 = &leaf1->hdr;
	hdr2 = &leaf2->hdr;
	foundit = 0;
	totallen = 0;

	/*
	 * Examine entries until we reduce the absolute difference in
	 * byte usage between the two blocks to a minimum.
	 */
1489
	max = be16_to_cpu(hdr1->count) + be16_to_cpu(hdr2->count);
L
Linus Torvalds 已提交
1490
	half  = (max+1) * sizeof(*entry);
1491 1492 1493 1494 1495 1496
	half += be16_to_cpu(hdr1->usedbytes) +
		be16_to_cpu(hdr2->usedbytes) +
		xfs_attr_leaf_newentsize(
				state->args->namelen,
				state->args->valuelen,
				state->blocksize, NULL);
L
Linus Torvalds 已提交
1497 1498 1499 1500 1501 1502 1503 1504 1505 1506 1507
	half /= 2;
	lastdelta = state->blocksize;
	entry = &leaf1->entries[0];
	for (count = index = 0; count < max; entry++, index++, count++) {

#define XFS_ATTR_ABS(A)	(((A) < 0) ? -(A) : (A))
		/*
		 * The new entry is in the first block, account for it.
		 */
		if (count == blk1->index) {
			tmp = totallen + sizeof(*entry) +
1508 1509 1510 1511
				xfs_attr_leaf_newentsize(
						state->args->namelen,
						state->args->valuelen,
						state->blocksize, NULL);
L
Linus Torvalds 已提交
1512 1513 1514 1515 1516 1517 1518 1519 1520 1521
			if (XFS_ATTR_ABS(half - tmp) > lastdelta)
				break;
			lastdelta = XFS_ATTR_ABS(half - tmp);
			totallen = tmp;
			foundit = 1;
		}

		/*
		 * Wrap around into the second block if necessary.
		 */
1522
		if (count == be16_to_cpu(hdr1->count)) {
L
Linus Torvalds 已提交
1523 1524 1525 1526 1527 1528 1529 1530 1531 1532 1533 1534 1535 1536 1537 1538 1539 1540 1541 1542 1543 1544 1545 1546
			leaf1 = leaf2;
			entry = &leaf1->entries[0];
			index = 0;
		}

		/*
		 * Figure out if next leaf entry would be too much.
		 */
		tmp = totallen + sizeof(*entry) + xfs_attr_leaf_entsize(leaf1,
									index);
		if (XFS_ATTR_ABS(half - tmp) > lastdelta)
			break;
		lastdelta = XFS_ATTR_ABS(half - tmp);
		totallen = tmp;
#undef XFS_ATTR_ABS
	}

	/*
	 * Calculate the number of usedbytes that will end up in lower block.
	 * If new entry not in lower block, fix up the count.
	 */
	totallen -= count * sizeof(*entry);
	if (foundit) {
		totallen -= sizeof(*entry) +
1547 1548 1549 1550
				xfs_attr_leaf_newentsize(
						state->args->namelen,
						state->args->valuelen,
						state->blocksize, NULL);
L
Linus Torvalds 已提交
1551 1552 1553 1554 1555 1556 1557 1558 1559 1560 1561 1562 1563 1564 1565 1566 1567 1568 1569 1570 1571 1572 1573 1574 1575 1576 1577 1578 1579 1580
	}

	*countarg = count;
	*usedbytesarg = totallen;
	return(foundit);
}

/*========================================================================
 * Routines used for shrinking the Btree.
 *========================================================================*/

/*
 * Check a leaf block and its neighbors to see if the block should be
 * collapsed into one or the other neighbor.  Always keep the block
 * with the smaller block number.
 * If the current block is over 50% full, don't try to join it, return 0.
 * If the block is empty, fill in the state structure and return 2.
 * If it can be collapsed, fill in the state structure and return 1.
 * If nothing can be done, return 0.
 *
 * GROT: allow for INCOMPLETE entries in calculation.
 */
int
xfs_attr_leaf_toosmall(xfs_da_state_t *state, int *action)
{
	xfs_attr_leafblock_t *leaf;
	xfs_da_state_blk_t *blk;
	xfs_da_blkinfo_t *info;
	int count, bytes, forward, error, retval, i;
	xfs_dablk_t blkno;
1581
	struct xfs_buf *bp;
L
Linus Torvalds 已提交
1582

1583 1584
	trace_xfs_attr_leaf_toosmall(state->args);

L
Linus Torvalds 已提交
1585 1586 1587 1588 1589 1590
	/*
	 * Check for the degenerate case of the block being over 50% full.
	 * If so, it's not worth even looking to see if we might be able
	 * to coalesce with a sibling.
	 */
	blk = &state->path.blk[ state->path.active-1 ];
1591
	info = blk->bp->b_addr;
1592
	ASSERT(info->magic == cpu_to_be16(XFS_ATTR_LEAF_MAGIC));
L
Linus Torvalds 已提交
1593
	leaf = (xfs_attr_leafblock_t *)info;
1594
	count = be16_to_cpu(leaf->hdr.count);
L
Linus Torvalds 已提交
1595 1596
	bytes = sizeof(xfs_attr_leaf_hdr_t) +
		count * sizeof(xfs_attr_leaf_entry_t) +
1597
		be16_to_cpu(leaf->hdr.usedbytes);
L
Linus Torvalds 已提交
1598 1599 1600 1601 1602 1603 1604 1605
	if (bytes > (state->blocksize >> 1)) {
		*action = 0;	/* blk over 50%, don't try to join */
		return(0);
	}

	/*
	 * Check for the degenerate case of the block being empty.
	 * If the block is empty, we'll simply delete it, no need to
1606
	 * coalesce it with a sibling block.  We choose (arbitrarily)
L
Linus Torvalds 已提交
1607 1608 1609 1610 1611 1612 1613
	 * to merge with the forward block unless it is NULL.
	 */
	if (count == 0) {
		/*
		 * Make altpath point to the block we want to keep and
		 * path point to the block we want to drop (this one).
		 */
1614
		forward = (info->forw != 0);
L
Linus Torvalds 已提交
1615 1616 1617 1618 1619 1620 1621 1622 1623 1624 1625 1626 1627 1628 1629 1630 1631 1632 1633 1634 1635
		memcpy(&state->altpath, &state->path, sizeof(state->path));
		error = xfs_da_path_shift(state, &state->altpath, forward,
						 0, &retval);
		if (error)
			return(error);
		if (retval) {
			*action = 0;
		} else {
			*action = 2;
		}
		return(0);
	}

	/*
	 * Examine each sibling block to see if we can coalesce with
	 * at least 25% free space to spare.  We need to figure out
	 * whether to merge with the forward or the backward block.
	 * We prefer coalescing with the lower numbered sibling so as
	 * to shrink an attribute list over time.
	 */
	/* start with smaller blk num */
1636
	forward = (be32_to_cpu(info->forw) < be32_to_cpu(info->back));
L
Linus Torvalds 已提交
1637 1638
	for (i = 0; i < 2; forward = !forward, i++) {
		if (forward)
1639
			blkno = be32_to_cpu(info->forw);
L
Linus Torvalds 已提交
1640
		else
1641
			blkno = be32_to_cpu(info->back);
L
Linus Torvalds 已提交
1642 1643 1644
		if (blkno == 0)
			continue;
		error = xfs_da_read_buf(state->args->trans, state->args->dp,
1645
					blkno, -1, &bp, XFS_ATTR_FORK, NULL);
L
Linus Torvalds 已提交
1646 1647 1648 1649 1650
		if (error)
			return(error);
		ASSERT(bp != NULL);

		leaf = (xfs_attr_leafblock_t *)info;
1651
		count  = be16_to_cpu(leaf->hdr.count);
L
Linus Torvalds 已提交
1652
		bytes  = state->blocksize - (state->blocksize>>2);
1653
		bytes -= be16_to_cpu(leaf->hdr.usedbytes);
1654
		leaf = bp->b_addr;
1655
		ASSERT(leaf->hdr.info.magic == cpu_to_be16(XFS_ATTR_LEAF_MAGIC));
1656 1657
		count += be16_to_cpu(leaf->hdr.count);
		bytes -= be16_to_cpu(leaf->hdr.usedbytes);
L
Linus Torvalds 已提交
1658 1659
		bytes -= count * sizeof(xfs_attr_leaf_entry_t);
		bytes -= sizeof(xfs_attr_leaf_hdr_t);
1660
		xfs_trans_brelse(state->args->trans, bp);
L
Linus Torvalds 已提交
1661 1662 1663 1664 1665 1666 1667 1668 1669 1670 1671 1672 1673 1674 1675 1676 1677 1678 1679 1680 1681 1682 1683 1684 1685 1686 1687 1688 1689 1690 1691 1692 1693 1694 1695 1696 1697
		if (bytes >= 0)
			break;	/* fits with at least 25% to spare */
	}
	if (i >= 2) {
		*action = 0;
		return(0);
	}

	/*
	 * Make altpath point to the block we want to keep (the lower
	 * numbered block) and path point to the block we want to drop.
	 */
	memcpy(&state->altpath, &state->path, sizeof(state->path));
	if (blkno < blk->blkno) {
		error = xfs_da_path_shift(state, &state->altpath, forward,
						 0, &retval);
	} else {
		error = xfs_da_path_shift(state, &state->path, forward,
						 0, &retval);
	}
	if (error)
		return(error);
	if (retval) {
		*action = 0;
	} else {
		*action = 1;
	}
	return(0);
}

/*
 * Remove a name from the leaf attribute list structure.
 *
 * Return 1 if leaf is less than 37% full, 0 if >= 37% full.
 * If two leaves are 37% full, when combined they will leave 25% free.
 */
int
1698 1699 1700
xfs_attr_leaf_remove(
	struct xfs_buf	*bp,
	xfs_da_args_t	*args)
L
Linus Torvalds 已提交
1701 1702 1703 1704 1705 1706 1707 1708 1709
{
	xfs_attr_leafblock_t *leaf;
	xfs_attr_leaf_hdr_t *hdr;
	xfs_attr_leaf_map_t *map;
	xfs_attr_leaf_entry_t *entry;
	int before, after, smallest, entsize;
	int tablesize, tmp, i;
	xfs_mount_t *mp;

1710 1711
	trace_xfs_attr_leaf_remove(args);

1712
	leaf = bp->b_addr;
1713
	ASSERT(leaf->hdr.info.magic == cpu_to_be16(XFS_ATTR_LEAF_MAGIC));
L
Linus Torvalds 已提交
1714 1715
	hdr = &leaf->hdr;
	mp = args->trans->t_mountp;
1716 1717
	ASSERT((be16_to_cpu(hdr->count) > 0)
		&& (be16_to_cpu(hdr->count) < (XFS_LBSIZE(mp)/8)));
L
Linus Torvalds 已提交
1718
	ASSERT((args->index >= 0)
1719 1720 1721
		&& (args->index < be16_to_cpu(hdr->count)));
	ASSERT(be16_to_cpu(hdr->firstused) >=
	       ((be16_to_cpu(hdr->count) * sizeof(*entry)) + sizeof(*hdr)));
L
Linus Torvalds 已提交
1722
	entry = &leaf->entries[args->index];
1723 1724
	ASSERT(be16_to_cpu(entry->nameidx) >= be16_to_cpu(hdr->firstused));
	ASSERT(be16_to_cpu(entry->nameidx) < XFS_LBSIZE(mp));
L
Linus Torvalds 已提交
1725 1726 1727 1728 1729 1730 1731

	/*
	 * Scan through free region table:
	 *    check for adjacency of free'd entry with an existing one,
	 *    find smallest free region in case we need to replace it,
	 *    adjust any map that borders the entry table,
	 */
1732
	tablesize = be16_to_cpu(hdr->count) * sizeof(xfs_attr_leaf_entry_t)
L
Linus Torvalds 已提交
1733 1734
					+ sizeof(xfs_attr_leaf_hdr_t);
	map = &hdr->freemap[0];
1735
	tmp = be16_to_cpu(map->size);
L
Linus Torvalds 已提交
1736 1737 1738 1739
	before = after = -1;
	smallest = XFS_ATTR_LEAF_MAPSIZE - 1;
	entsize = xfs_attr_leaf_entsize(leaf, args->index);
	for (i = 0; i < XFS_ATTR_LEAF_MAPSIZE; map++, i++) {
1740 1741 1742
		ASSERT(be16_to_cpu(map->base) < XFS_LBSIZE(mp));
		ASSERT(be16_to_cpu(map->size) < XFS_LBSIZE(mp));
		if (be16_to_cpu(map->base) == tablesize) {
1743
			be16_add_cpu(&map->base,
1744
				 -((int)sizeof(xfs_attr_leaf_entry_t)));
1745
			be16_add_cpu(&map->size, sizeof(xfs_attr_leaf_entry_t));
L
Linus Torvalds 已提交
1746 1747
		}

1748
		if ((be16_to_cpu(map->base) + be16_to_cpu(map->size))
1749
				== be16_to_cpu(entry->nameidx)) {
L
Linus Torvalds 已提交
1750
			before = i;
1751
		} else if (be16_to_cpu(map->base)
1752
			== (be16_to_cpu(entry->nameidx) + entsize)) {
L
Linus Torvalds 已提交
1753
			after = i;
1754 1755
		} else if (be16_to_cpu(map->size) < tmp) {
			tmp = be16_to_cpu(map->size);
L
Linus Torvalds 已提交
1756 1757 1758 1759 1760 1761 1762 1763 1764 1765 1766
			smallest = i;
		}
	}

	/*
	 * Coalesce adjacent freemap regions,
	 * or replace the smallest region.
	 */
	if ((before >= 0) || (after >= 0)) {
		if ((before >= 0) && (after >= 0)) {
			map = &hdr->freemap[before];
1767 1768
			be16_add_cpu(&map->size, entsize);
			be16_add_cpu(&map->size,
1769
				 be16_to_cpu(hdr->freemap[after].size));
L
Linus Torvalds 已提交
1770 1771 1772 1773
			hdr->freemap[after].base = 0;
			hdr->freemap[after].size = 0;
		} else if (before >= 0) {
			map = &hdr->freemap[before];
1774
			be16_add_cpu(&map->size, entsize);
L
Linus Torvalds 已提交
1775 1776 1777 1778
		} else {
			map = &hdr->freemap[after];
			/* both on-disk, don't endian flip twice */
			map->base = entry->nameidx;
1779
			be16_add_cpu(&map->size, entsize);
L
Linus Torvalds 已提交
1780 1781 1782 1783 1784 1785
		}
	} else {
		/*
		 * Replace smallest region (if it is smaller than free'd entry)
		 */
		map = &hdr->freemap[smallest];
1786
		if (be16_to_cpu(map->size) < entsize) {
1787
			map->base = cpu_to_be16(be16_to_cpu(entry->nameidx));
1788
			map->size = cpu_to_be16(entsize);
L
Linus Torvalds 已提交
1789 1790 1791 1792 1793 1794
		}
	}

	/*
	 * Did we remove the first entry?
	 */
1795
	if (be16_to_cpu(entry->nameidx) == be16_to_cpu(hdr->firstused))
L
Linus Torvalds 已提交
1796 1797 1798 1799 1800 1801 1802
		smallest = 1;
	else
		smallest = 0;

	/*
	 * Compress the remaining entries and zero out the removed stuff.
	 */
1803
	memset(xfs_attr_leaf_name(leaf, args->index), 0, entsize);
1804
	be16_add_cpu(&hdr->usedbytes, -entsize);
1805
	xfs_trans_log_buf(args->trans, bp,
1806
	     XFS_DA_LOGRANGE(leaf, xfs_attr_leaf_name(leaf, args->index),
L
Linus Torvalds 已提交
1807 1808
				   entsize));

1809
	tmp = (be16_to_cpu(hdr->count) - args->index)
L
Linus Torvalds 已提交
1810 1811
					* sizeof(xfs_attr_leaf_entry_t);
	memmove((char *)entry, (char *)(entry+1), tmp);
1812
	be16_add_cpu(&hdr->count, -1);
1813
	xfs_trans_log_buf(args->trans, bp,
L
Linus Torvalds 已提交
1814
	    XFS_DA_LOGRANGE(leaf, entry, tmp + sizeof(*entry)));
1815
	entry = &leaf->entries[be16_to_cpu(hdr->count)];
L
Linus Torvalds 已提交
1816 1817 1818 1819 1820 1821 1822 1823 1824 1825 1826
	memset((char *)entry, 0, sizeof(xfs_attr_leaf_entry_t));

	/*
	 * If we removed the first entry, re-find the first used byte
	 * in the name area.  Note that if the entry was the "firstused",
	 * then we don't have a "hole" in our block resulting from
	 * removing the name.
	 */
	if (smallest) {
		tmp = XFS_LBSIZE(mp);
		entry = &leaf->entries[0];
1827
		for (i = be16_to_cpu(hdr->count)-1; i >= 0; entry++, i--) {
1828 1829 1830 1831 1832 1833
			ASSERT(be16_to_cpu(entry->nameidx) >=
			       be16_to_cpu(hdr->firstused));
			ASSERT(be16_to_cpu(entry->nameidx) < XFS_LBSIZE(mp));

			if (be16_to_cpu(entry->nameidx) < tmp)
				tmp = be16_to_cpu(entry->nameidx);
L
Linus Torvalds 已提交
1834
		}
1835
		hdr->firstused = cpu_to_be16(tmp);
L
Linus Torvalds 已提交
1836
		if (!hdr->firstused) {
1837
			hdr->firstused = cpu_to_be16(
L
Linus Torvalds 已提交
1838 1839 1840 1841 1842
					tmp - XFS_ATTR_LEAF_NAME_ALIGN);
		}
	} else {
		hdr->holes = 1;		/* mark as needing compaction */
	}
1843
	xfs_trans_log_buf(args->trans, bp,
L
Linus Torvalds 已提交
1844 1845 1846 1847 1848 1849 1850
			  XFS_DA_LOGRANGE(leaf, hdr, sizeof(*hdr)));

	/*
	 * Check if leaf is less than 50% full, caller may want to
	 * "join" the leaf with a sibling if so.
	 */
	tmp  = sizeof(xfs_attr_leaf_hdr_t);
1851 1852
	tmp += be16_to_cpu(leaf->hdr.count) * sizeof(xfs_attr_leaf_entry_t);
	tmp += be16_to_cpu(leaf->hdr.usedbytes);
L
Linus Torvalds 已提交
1853 1854 1855 1856 1857 1858 1859 1860 1861 1862 1863 1864 1865 1866 1867
	return(tmp < mp->m_attr_magicpct); /* leaf is < 37% full */
}

/*
 * Move all the attribute list entries from drop_leaf into save_leaf.
 */
void
xfs_attr_leaf_unbalance(xfs_da_state_t *state, xfs_da_state_blk_t *drop_blk,
				       xfs_da_state_blk_t *save_blk)
{
	xfs_attr_leafblock_t *drop_leaf, *save_leaf, *tmp_leaf;
	xfs_attr_leaf_hdr_t *drop_hdr, *save_hdr, *tmp_hdr;
	xfs_mount_t *mp;
	char *tmpbuffer;

1868 1869
	trace_xfs_attr_leaf_unbalance(state->args);

L
Linus Torvalds 已提交
1870 1871 1872 1873 1874 1875
	/*
	 * Set up environment.
	 */
	mp = state->mp;
	ASSERT(drop_blk->magic == XFS_ATTR_LEAF_MAGIC);
	ASSERT(save_blk->magic == XFS_ATTR_LEAF_MAGIC);
1876 1877
	drop_leaf = drop_blk->bp->b_addr;
	save_leaf = save_blk->bp->b_addr;
1878 1879
	ASSERT(drop_leaf->hdr.info.magic == cpu_to_be16(XFS_ATTR_LEAF_MAGIC));
	ASSERT(save_leaf->hdr.info.magic == cpu_to_be16(XFS_ATTR_LEAF_MAGIC));
L
Linus Torvalds 已提交
1880 1881 1882 1883 1884 1885
	drop_hdr = &drop_leaf->hdr;
	save_hdr = &save_leaf->hdr;

	/*
	 * Save last hashval from dying block for later Btree fixup.
	 */
1886 1887
	drop_blk->hashval = be32_to_cpu(
		drop_leaf->entries[be16_to_cpu(drop_leaf->hdr.count)-1].hashval);
L
Linus Torvalds 已提交
1888 1889 1890 1891 1892 1893 1894 1895 1896 1897 1898 1899 1900

	/*
	 * Check if we need a temp buffer, or can we do it in place.
	 * Note that we don't check "leaf" for holes because we will
	 * always be dropping it, toosmall() decided that for us already.
	 */
	if (save_hdr->holes == 0) {
		/*
		 * dest leaf has no holes, so we add there.  May need
		 * to make some room in the entry array.
		 */
		if (xfs_attr_leaf_order(save_blk->bp, drop_blk->bp)) {
			xfs_attr_leaf_moveents(drop_leaf, 0, save_leaf, 0,
1901
			     be16_to_cpu(drop_hdr->count), mp);
L
Linus Torvalds 已提交
1902 1903
		} else {
			xfs_attr_leaf_moveents(drop_leaf, 0, save_leaf,
1904 1905
				  be16_to_cpu(save_hdr->count),
				  be16_to_cpu(drop_hdr->count), mp);
L
Linus Torvalds 已提交
1906 1907 1908 1909 1910 1911 1912 1913 1914 1915 1916 1917 1918
		}
	} else {
		/*
		 * Destination has holes, so we make a temporary copy
		 * of the leaf and add them both to that.
		 */
		tmpbuffer = kmem_alloc(state->blocksize, KM_SLEEP);
		ASSERT(tmpbuffer != NULL);
		memset(tmpbuffer, 0, state->blocksize);
		tmp_leaf = (xfs_attr_leafblock_t *)tmpbuffer;
		tmp_hdr = &tmp_leaf->hdr;
		tmp_hdr->info = save_hdr->info;	/* struct copy */
		tmp_hdr->count = 0;
1919
		tmp_hdr->firstused = cpu_to_be16(state->blocksize);
L
Linus Torvalds 已提交
1920
		if (!tmp_hdr->firstused) {
1921
			tmp_hdr->firstused = cpu_to_be16(
L
Linus Torvalds 已提交
1922 1923 1924 1925 1926
				state->blocksize - XFS_ATTR_LEAF_NAME_ALIGN);
		}
		tmp_hdr->usedbytes = 0;
		if (xfs_attr_leaf_order(save_blk->bp, drop_blk->bp)) {
			xfs_attr_leaf_moveents(drop_leaf, 0, tmp_leaf, 0,
1927
				be16_to_cpu(drop_hdr->count), mp);
L
Linus Torvalds 已提交
1928
			xfs_attr_leaf_moveents(save_leaf, 0, tmp_leaf,
1929 1930
				  be16_to_cpu(tmp_leaf->hdr.count),
				  be16_to_cpu(save_hdr->count), mp);
L
Linus Torvalds 已提交
1931 1932
		} else {
			xfs_attr_leaf_moveents(save_leaf, 0, tmp_leaf, 0,
1933
				be16_to_cpu(save_hdr->count), mp);
L
Linus Torvalds 已提交
1934
			xfs_attr_leaf_moveents(drop_leaf, 0, tmp_leaf,
1935 1936
				be16_to_cpu(tmp_leaf->hdr.count),
				be16_to_cpu(drop_hdr->count), mp);
L
Linus Torvalds 已提交
1937 1938
		}
		memcpy((char *)save_leaf, (char *)tmp_leaf, state->blocksize);
1939
		kmem_free(tmpbuffer);
L
Linus Torvalds 已提交
1940 1941
	}

1942
	xfs_trans_log_buf(state->args->trans, save_blk->bp, 0,
L
Linus Torvalds 已提交
1943 1944 1945 1946 1947
					   state->blocksize - 1);

	/*
	 * Copy out last hashval in each block for B-tree code.
	 */
1948 1949
	save_blk->hashval = be32_to_cpu(
		save_leaf->entries[be16_to_cpu(save_leaf->hdr.count)-1].hashval);
L
Linus Torvalds 已提交
1950 1951 1952 1953 1954 1955 1956 1957 1958 1959 1960 1961 1962 1963 1964 1965 1966 1967 1968 1969
}

/*========================================================================
 * Routines used for finding things in the Btree.
 *========================================================================*/

/*
 * Look up a name in a leaf attribute list structure.
 * This is the internal routine, it uses the caller's buffer.
 *
 * Note that duplicate keys are allowed, but only check within the
 * current leaf node.  The Btree code must check in adjacent leaf nodes.
 *
 * Return in args->index the index into the entry[] array of either
 * the found entry, or where the entry should have been (insert before
 * that entry).
 *
 * Don't change the args->value unless we find the attribute.
 */
int
1970 1971 1972
xfs_attr_leaf_lookup_int(
	struct xfs_buf	*bp,
	xfs_da_args_t	*args)
L
Linus Torvalds 已提交
1973 1974 1975 1976 1977 1978 1979 1980
{
	xfs_attr_leafblock_t *leaf;
	xfs_attr_leaf_entry_t *entry;
	xfs_attr_leaf_name_local_t *name_loc;
	xfs_attr_leaf_name_remote_t *name_rmt;
	int probe, span;
	xfs_dahash_t hashval;

1981 1982
	trace_xfs_attr_leaf_lookup(args);

1983
	leaf = bp->b_addr;
1984
	ASSERT(leaf->hdr.info.magic == cpu_to_be16(XFS_ATTR_LEAF_MAGIC));
1985
	ASSERT(be16_to_cpu(leaf->hdr.count)
L
Linus Torvalds 已提交
1986 1987 1988 1989 1990 1991
					< (XFS_LBSIZE(args->dp->i_mount)/8));

	/*
	 * Binary search.  (note: small blocks will skip this loop)
	 */
	hashval = args->hashval;
1992
	probe = span = be16_to_cpu(leaf->hdr.count) / 2;
L
Linus Torvalds 已提交
1993 1994 1995
	for (entry = &leaf->entries[probe]; span > 4;
		   entry = &leaf->entries[probe]) {
		span /= 2;
1996
		if (be32_to_cpu(entry->hashval) < hashval)
L
Linus Torvalds 已提交
1997
			probe += span;
1998
		else if (be32_to_cpu(entry->hashval) > hashval)
L
Linus Torvalds 已提交
1999 2000 2001 2002
			probe -= span;
		else
			break;
	}
2003
	ASSERT((probe >= 0) &&
L
Linus Torvalds 已提交
2004
	       (!leaf->hdr.count
2005
	       || (probe < be16_to_cpu(leaf->hdr.count))));
2006
	ASSERT((span <= 4) || (be32_to_cpu(entry->hashval) == hashval));
L
Linus Torvalds 已提交
2007 2008 2009 2010 2011

	/*
	 * Since we may have duplicate hashval's, find the first matching
	 * hashval in the leaf.
	 */
2012
	while ((probe > 0) && (be32_to_cpu(entry->hashval) >= hashval)) {
L
Linus Torvalds 已提交
2013 2014 2015
		entry--;
		probe--;
	}
2016 2017
	while ((probe < be16_to_cpu(leaf->hdr.count)) &&
	       (be32_to_cpu(entry->hashval) < hashval)) {
L
Linus Torvalds 已提交
2018 2019 2020
		entry++;
		probe++;
	}
2021 2022
	if ((probe == be16_to_cpu(leaf->hdr.count)) ||
	    (be32_to_cpu(entry->hashval) != hashval)) {
L
Linus Torvalds 已提交
2023 2024 2025 2026 2027 2028 2029
		args->index = probe;
		return(XFS_ERROR(ENOATTR));
	}

	/*
	 * Duplicate keys may be present, so search all of them for a match.
	 */
2030 2031
	for (  ; (probe < be16_to_cpu(leaf->hdr.count)) &&
			(be32_to_cpu(entry->hashval) == hashval);
L
Linus Torvalds 已提交
2032 2033 2034 2035 2036 2037 2038 2039 2040 2041 2042 2043 2044
			entry++, probe++) {
/*
 * GROT: Add code to remove incomplete entries.
 */
		/*
		 * If we are looking for INCOMPLETE entries, show only those.
		 * If we are looking for complete entries, show only those.
		 */
		if ((args->flags & XFS_ATTR_INCOMPLETE) !=
		    (entry->flags & XFS_ATTR_INCOMPLETE)) {
			continue;
		}
		if (entry->flags & XFS_ATTR_LOCAL) {
2045
			name_loc = xfs_attr_leaf_name_local(leaf, probe);
L
Linus Torvalds 已提交
2046 2047
			if (name_loc->namelen != args->namelen)
				continue;
2048
			if (memcmp(args->name, (char *)name_loc->nameval, args->namelen) != 0)
L
Linus Torvalds 已提交
2049
				continue;
2050
			if (!xfs_attr_namesp_match(args->flags, entry->flags))
L
Linus Torvalds 已提交
2051 2052 2053 2054
				continue;
			args->index = probe;
			return(XFS_ERROR(EEXIST));
		} else {
2055
			name_rmt = xfs_attr_leaf_name_remote(leaf, probe);
L
Linus Torvalds 已提交
2056 2057 2058 2059 2060
			if (name_rmt->namelen != args->namelen)
				continue;
			if (memcmp(args->name, (char *)name_rmt->name,
					     args->namelen) != 0)
				continue;
2061
			if (!xfs_attr_namesp_match(args->flags, entry->flags))
L
Linus Torvalds 已提交
2062 2063
				continue;
			args->index = probe;
2064
			args->rmtblkno = be32_to_cpu(name_rmt->valueblk);
L
Linus Torvalds 已提交
2065
			args->rmtblkcnt = XFS_B_TO_FSB(args->dp->i_mount,
2066
						   be32_to_cpu(name_rmt->valuelen));
L
Linus Torvalds 已提交
2067 2068 2069 2070 2071 2072 2073 2074 2075 2076 2077 2078
			return(XFS_ERROR(EEXIST));
		}
	}
	args->index = probe;
	return(XFS_ERROR(ENOATTR));
}

/*
 * Get the value associated with an attribute name from a leaf attribute
 * list structure.
 */
int
2079 2080 2081
xfs_attr_leaf_getvalue(
	struct xfs_buf	*bp,
	xfs_da_args_t	*args)
L
Linus Torvalds 已提交
2082 2083 2084 2085 2086 2087 2088
{
	int valuelen;
	xfs_attr_leafblock_t *leaf;
	xfs_attr_leaf_entry_t *entry;
	xfs_attr_leaf_name_local_t *name_loc;
	xfs_attr_leaf_name_remote_t *name_rmt;

2089
	leaf = bp->b_addr;
2090
	ASSERT(leaf->hdr.info.magic == cpu_to_be16(XFS_ATTR_LEAF_MAGIC));
2091
	ASSERT(be16_to_cpu(leaf->hdr.count)
L
Linus Torvalds 已提交
2092
					< (XFS_LBSIZE(args->dp->i_mount)/8));
2093
	ASSERT(args->index < be16_to_cpu(leaf->hdr.count));
L
Linus Torvalds 已提交
2094 2095 2096

	entry = &leaf->entries[args->index];
	if (entry->flags & XFS_ATTR_LOCAL) {
2097
		name_loc = xfs_attr_leaf_name_local(leaf, args->index);
L
Linus Torvalds 已提交
2098 2099
		ASSERT(name_loc->namelen == args->namelen);
		ASSERT(memcmp(args->name, name_loc->nameval, args->namelen) == 0);
2100
		valuelen = be16_to_cpu(name_loc->valuelen);
L
Linus Torvalds 已提交
2101 2102 2103 2104 2105 2106 2107 2108 2109 2110 2111
		if (args->flags & ATTR_KERNOVAL) {
			args->valuelen = valuelen;
			return(0);
		}
		if (args->valuelen < valuelen) {
			args->valuelen = valuelen;
			return(XFS_ERROR(ERANGE));
		}
		args->valuelen = valuelen;
		memcpy(args->value, &name_loc->nameval[args->namelen], valuelen);
	} else {
2112
		name_rmt = xfs_attr_leaf_name_remote(leaf, args->index);
L
Linus Torvalds 已提交
2113 2114
		ASSERT(name_rmt->namelen == args->namelen);
		ASSERT(memcmp(args->name, name_rmt->name, args->namelen) == 0);
2115 2116
		valuelen = be32_to_cpu(name_rmt->valuelen);
		args->rmtblkno = be32_to_cpu(name_rmt->valueblk);
L
Linus Torvalds 已提交
2117 2118 2119 2120 2121 2122 2123 2124 2125 2126 2127 2128 2129 2130 2131 2132 2133 2134 2135 2136 2137 2138 2139 2140 2141 2142 2143 2144 2145 2146 2147 2148 2149 2150 2151 2152 2153 2154 2155 2156 2157
		args->rmtblkcnt = XFS_B_TO_FSB(args->dp->i_mount, valuelen);
		if (args->flags & ATTR_KERNOVAL) {
			args->valuelen = valuelen;
			return(0);
		}
		if (args->valuelen < valuelen) {
			args->valuelen = valuelen;
			return(XFS_ERROR(ERANGE));
		}
		args->valuelen = valuelen;
	}
	return(0);
}

/*========================================================================
 * Utility routines.
 *========================================================================*/

/*
 * Move the indicated entries from one leaf to another.
 * NOTE: this routine modifies both source and destination leaves.
 */
/*ARGSUSED*/
STATIC void
xfs_attr_leaf_moveents(xfs_attr_leafblock_t *leaf_s, int start_s,
			xfs_attr_leafblock_t *leaf_d, int start_d,
			int count, xfs_mount_t *mp)
{
	xfs_attr_leaf_hdr_t *hdr_s, *hdr_d;
	xfs_attr_leaf_entry_t *entry_s, *entry_d;
	int desti, tmp, i;

	/*
	 * Check for nothing to do.
	 */
	if (count == 0)
		return;

	/*
	 * Set up environment.
	 */
2158 2159
	ASSERT(leaf_s->hdr.info.magic == cpu_to_be16(XFS_ATTR_LEAF_MAGIC));
	ASSERT(leaf_d->hdr.info.magic == cpu_to_be16(XFS_ATTR_LEAF_MAGIC));
L
Linus Torvalds 已提交
2160 2161
	hdr_s = &leaf_s->hdr;
	hdr_d = &leaf_d->hdr;
2162 2163 2164 2165
	ASSERT((be16_to_cpu(hdr_s->count) > 0) &&
	       (be16_to_cpu(hdr_s->count) < (XFS_LBSIZE(mp)/8)));
	ASSERT(be16_to_cpu(hdr_s->firstused) >=
		((be16_to_cpu(hdr_s->count)
L
Linus Torvalds 已提交
2166
					* sizeof(*entry_s))+sizeof(*hdr_s)));
2167 2168 2169
	ASSERT(be16_to_cpu(hdr_d->count) < (XFS_LBSIZE(mp)/8));
	ASSERT(be16_to_cpu(hdr_d->firstused) >=
		((be16_to_cpu(hdr_d->count)
L
Linus Torvalds 已提交
2170 2171
					* sizeof(*entry_d))+sizeof(*hdr_d)));

2172 2173 2174
	ASSERT(start_s < be16_to_cpu(hdr_s->count));
	ASSERT(start_d <= be16_to_cpu(hdr_d->count));
	ASSERT(count <= be16_to_cpu(hdr_s->count));
L
Linus Torvalds 已提交
2175 2176 2177 2178

	/*
	 * Move the entries in the destination leaf up to make a hole?
	 */
2179 2180
	if (start_d < be16_to_cpu(hdr_d->count)) {
		tmp  = be16_to_cpu(hdr_d->count) - start_d;
L
Linus Torvalds 已提交
2181 2182 2183 2184 2185 2186 2187 2188 2189 2190 2191 2192 2193 2194
		tmp *= sizeof(xfs_attr_leaf_entry_t);
		entry_s = &leaf_d->entries[start_d];
		entry_d = &leaf_d->entries[start_d + count];
		memmove((char *)entry_d, (char *)entry_s, tmp);
	}

	/*
	 * Copy all entry's in the same (sorted) order,
	 * but allocate attribute info packed and in sequence.
	 */
	entry_s = &leaf_s->entries[start_s];
	entry_d = &leaf_d->entries[start_d];
	desti = start_d;
	for (i = 0; i < count; entry_s++, entry_d++, desti++, i++) {
2195
		ASSERT(be16_to_cpu(entry_s->nameidx)
2196
				>= be16_to_cpu(hdr_s->firstused));
L
Linus Torvalds 已提交
2197 2198 2199 2200 2201 2202 2203 2204
		tmp = xfs_attr_leaf_entsize(leaf_s, start_s + i);
#ifdef GROT
		/*
		 * Code to drop INCOMPLETE entries.  Difficult to use as we
		 * may also need to change the insertion index.  Code turned
		 * off for 6.2, should be revisited later.
		 */
		if (entry_s->flags & XFS_ATTR_INCOMPLETE) { /* skip partials? */
2205
			memset(xfs_attr_leaf_name(leaf_s, start_s + i), 0, tmp);
2206 2207
			be16_add_cpu(&hdr_s->usedbytes, -tmp);
			be16_add_cpu(&hdr_s->count, -1);
L
Linus Torvalds 已提交
2208 2209 2210 2211 2212 2213
			entry_d--;	/* to compensate for ++ in loop hdr */
			desti--;
			if ((start_s + i) < offset)
				result++;	/* insertion index adjustment */
		} else {
#endif /* GROT */
2214
			be16_add_cpu(&hdr_d->firstused, -tmp);
L
Linus Torvalds 已提交
2215 2216 2217 2218 2219
			/* both on-disk, don't endian flip twice */
			entry_d->hashval = entry_s->hashval;
			/* both on-disk, don't endian flip twice */
			entry_d->nameidx = hdr_d->firstused;
			entry_d->flags = entry_s->flags;
2220
			ASSERT(be16_to_cpu(entry_d->nameidx) + tmp
L
Linus Torvalds 已提交
2221
							<= XFS_LBSIZE(mp));
2222 2223
			memmove(xfs_attr_leaf_name(leaf_d, desti),
				xfs_attr_leaf_name(leaf_s, start_s + i), tmp);
2224
			ASSERT(be16_to_cpu(entry_s->nameidx) + tmp
L
Linus Torvalds 已提交
2225
							<= XFS_LBSIZE(mp));
2226
			memset(xfs_attr_leaf_name(leaf_s, start_s + i), 0, tmp);
2227 2228 2229 2230
			be16_add_cpu(&hdr_s->usedbytes, -tmp);
			be16_add_cpu(&hdr_d->usedbytes, tmp);
			be16_add_cpu(&hdr_s->count, -1);
			be16_add_cpu(&hdr_d->count, 1);
2231
			tmp = be16_to_cpu(hdr_d->count)
L
Linus Torvalds 已提交
2232 2233
						* sizeof(xfs_attr_leaf_entry_t)
						+ sizeof(xfs_attr_leaf_hdr_t);
2234
			ASSERT(be16_to_cpu(hdr_d->firstused) >= tmp);
L
Linus Torvalds 已提交
2235 2236 2237 2238 2239 2240 2241 2242
#ifdef GROT
		}
#endif /* GROT */
	}

	/*
	 * Zero out the entries we just copied.
	 */
2243
	if (start_s == be16_to_cpu(hdr_s->count)) {
L
Linus Torvalds 已提交
2244 2245 2246 2247 2248 2249 2250 2251 2252 2253
		tmp = count * sizeof(xfs_attr_leaf_entry_t);
		entry_s = &leaf_s->entries[start_s];
		ASSERT(((char *)entry_s + tmp) <=
		       ((char *)leaf_s + XFS_LBSIZE(mp)));
		memset((char *)entry_s, 0, tmp);
	} else {
		/*
		 * Move the remaining entries down to fill the hole,
		 * then zero the entries at the top.
		 */
2254
		tmp  = be16_to_cpu(hdr_s->count) - count;
L
Linus Torvalds 已提交
2255 2256 2257 2258 2259 2260
		tmp *= sizeof(xfs_attr_leaf_entry_t);
		entry_s = &leaf_s->entries[start_s + count];
		entry_d = &leaf_s->entries[start_s];
		memmove((char *)entry_d, (char *)entry_s, tmp);

		tmp = count * sizeof(xfs_attr_leaf_entry_t);
2261
		entry_s = &leaf_s->entries[be16_to_cpu(hdr_s->count)];
L
Linus Torvalds 已提交
2262 2263 2264 2265 2266 2267 2268 2269
		ASSERT(((char *)entry_s + tmp) <=
		       ((char *)leaf_s + XFS_LBSIZE(mp)));
		memset((char *)entry_s, 0, tmp);
	}

	/*
	 * Fill in the freemap information
	 */
2270
	hdr_d->freemap[0].base = cpu_to_be16(sizeof(xfs_attr_leaf_hdr_t));
2271
	be16_add_cpu(&hdr_d->freemap[0].base, be16_to_cpu(hdr_d->count) *
2272 2273 2274
			sizeof(xfs_attr_leaf_entry_t));
	hdr_d->freemap[0].size = cpu_to_be16(be16_to_cpu(hdr_d->firstused)
			      - be16_to_cpu(hdr_d->freemap[0].base));
L
Linus Torvalds 已提交
2275 2276 2277 2278 2279 2280 2281 2282 2283 2284 2285 2286
	hdr_d->freemap[1].base = 0;
	hdr_d->freemap[2].base = 0;
	hdr_d->freemap[1].size = 0;
	hdr_d->freemap[2].size = 0;
	hdr_s->holes = 1;	/* leaf may not be compact */
}

/*
 * Compare two leaf blocks "order".
 * Return 0 unless leaf2 should go before leaf1.
 */
int
2287 2288 2289
xfs_attr_leaf_order(
	struct xfs_buf	*leaf1_bp,
	struct xfs_buf	*leaf2_bp)
L
Linus Torvalds 已提交
2290 2291 2292
{
	xfs_attr_leafblock_t *leaf1, *leaf2;

2293 2294
	leaf1 = leaf1_bp->b_addr;
	leaf2 = leaf2_bp->b_addr;
2295 2296
	ASSERT((leaf1->hdr.info.magic == cpu_to_be16(XFS_ATTR_LEAF_MAGIC)) &&
	       (leaf2->hdr.info.magic == cpu_to_be16(XFS_ATTR_LEAF_MAGIC)));
2297 2298
	if ((be16_to_cpu(leaf1->hdr.count) > 0) &&
	    (be16_to_cpu(leaf2->hdr.count) > 0) &&
2299 2300 2301 2302 2303 2304
	    ((be32_to_cpu(leaf2->entries[0].hashval) <
	      be32_to_cpu(leaf1->entries[0].hashval)) ||
	     (be32_to_cpu(leaf2->entries[
			be16_to_cpu(leaf2->hdr.count)-1].hashval) <
	      be32_to_cpu(leaf1->entries[
			be16_to_cpu(leaf1->hdr.count)-1].hashval)))) {
L
Linus Torvalds 已提交
2305 2306 2307 2308 2309 2310 2311 2312 2313
		return(1);
	}
	return(0);
}

/*
 * Pick up the last hashvalue from a leaf block.
 */
xfs_dahash_t
2314 2315 2316
xfs_attr_leaf_lasthash(
	struct xfs_buf	*bp,
	int		*count)
L
Linus Torvalds 已提交
2317 2318 2319
{
	xfs_attr_leafblock_t *leaf;

2320
	leaf = bp->b_addr;
2321
	ASSERT(leaf->hdr.info.magic == cpu_to_be16(XFS_ATTR_LEAF_MAGIC));
L
Linus Torvalds 已提交
2322
	if (count)
2323
		*count = be16_to_cpu(leaf->hdr.count);
L
Linus Torvalds 已提交
2324 2325
	if (!leaf->hdr.count)
		return(0);
2326
	return be32_to_cpu(leaf->entries[be16_to_cpu(leaf->hdr.count)-1].hashval);
L
Linus Torvalds 已提交
2327 2328 2329 2330 2331 2332
}

/*
 * Calculate the number of bytes used to store the indicated attribute
 * (whether local or remote only calculate bytes in this block).
 */
2333
STATIC int
L
Linus Torvalds 已提交
2334 2335 2336 2337 2338 2339
xfs_attr_leaf_entsize(xfs_attr_leafblock_t *leaf, int index)
{
	xfs_attr_leaf_name_local_t *name_loc;
	xfs_attr_leaf_name_remote_t *name_rmt;
	int size;

2340
	ASSERT(leaf->hdr.info.magic == cpu_to_be16(XFS_ATTR_LEAF_MAGIC));
L
Linus Torvalds 已提交
2341
	if (leaf->entries[index].flags & XFS_ATTR_LOCAL) {
2342 2343
		name_loc = xfs_attr_leaf_name_local(leaf, index);
		size = xfs_attr_leaf_entsize_local(name_loc->namelen,
2344
						   be16_to_cpu(name_loc->valuelen));
L
Linus Torvalds 已提交
2345
	} else {
2346 2347
		name_rmt = xfs_attr_leaf_name_remote(leaf, index);
		size = xfs_attr_leaf_entsize_remote(name_rmt->namelen);
L
Linus Torvalds 已提交
2348 2349 2350 2351 2352 2353 2354 2355 2356 2357 2358
	}
	return(size);
}

/*
 * Calculate the number of bytes that would be required to store the new
 * attribute (whether local or remote only calculate bytes in this block).
 * This routine decides as a side effect whether the attribute will be
 * a "local" or a "remote" attribute.
 */
int
2359
xfs_attr_leaf_newentsize(int namelen, int valuelen, int blocksize, int *local)
L
Linus Torvalds 已提交
2360 2361 2362
{
	int size;

2363 2364
	size = xfs_attr_leaf_entsize_local(namelen, valuelen);
	if (size < xfs_attr_leaf_entsize_local_max(blocksize)) {
L
Linus Torvalds 已提交
2365 2366 2367 2368
		if (local) {
			*local = 1;
		}
	} else {
2369
		size = xfs_attr_leaf_entsize_remote(namelen);
L
Linus Torvalds 已提交
2370 2371 2372 2373 2374 2375 2376 2377 2378 2379 2380
		if (local) {
			*local = 0;
		}
	}
	return(size);
}

/*
 * Copy out attribute list entries for attr_list(), for leaf attribute lists.
 */
int
2381 2382 2383
xfs_attr_leaf_list_int(
	struct xfs_buf		*bp,
	xfs_attr_list_context_t	*context)
L
Linus Torvalds 已提交
2384 2385 2386 2387 2388 2389 2390
{
	attrlist_cursor_kern_t *cursor;
	xfs_attr_leafblock_t *leaf;
	xfs_attr_leaf_entry_t *entry;
	int retval, i;

	ASSERT(bp != NULL);
2391
	leaf = bp->b_addr;
L
Linus Torvalds 已提交
2392 2393 2394
	cursor = context->cursor;
	cursor->initted = 1;

C
Christoph Hellwig 已提交
2395
	trace_xfs_attr_list_leaf(context);
L
Linus Torvalds 已提交
2396 2397 2398 2399 2400 2401

	/*
	 * Re-find our place in the leaf block if this is a new syscall.
	 */
	if (context->resynch) {
		entry = &leaf->entries[0];
2402
		for (i = 0; i < be16_to_cpu(leaf->hdr.count); entry++, i++) {
2403
			if (be32_to_cpu(entry->hashval) == cursor->hashval) {
L
Linus Torvalds 已提交
2404 2405 2406 2407 2408
				if (cursor->offset == context->dupcnt) {
					context->dupcnt = 0;
					break;
				}
				context->dupcnt++;
2409 2410
			} else if (be32_to_cpu(entry->hashval) >
					cursor->hashval) {
L
Linus Torvalds 已提交
2411 2412 2413 2414
				context->dupcnt = 0;
				break;
			}
		}
2415
		if (i == be16_to_cpu(leaf->hdr.count)) {
C
Christoph Hellwig 已提交
2416
			trace_xfs_attr_list_notfound(context);
L
Linus Torvalds 已提交
2417 2418 2419 2420 2421 2422 2423 2424 2425 2426 2427 2428
			return(0);
		}
	} else {
		entry = &leaf->entries[0];
		i = 0;
	}
	context->resynch = 0;

	/*
	 * We have found our place, start copying out the new attributes.
	 */
	retval = 0;
2429
	for (  ; (i < be16_to_cpu(leaf->hdr.count)); entry++, i++) {
2430 2431
		if (be32_to_cpu(entry->hashval) != cursor->hashval) {
			cursor->hashval = be32_to_cpu(entry->hashval);
L
Linus Torvalds 已提交
2432 2433 2434 2435 2436 2437 2438
			cursor->offset = 0;
		}

		if (entry->flags & XFS_ATTR_INCOMPLETE)
			continue;		/* skip incomplete entries */

		if (entry->flags & XFS_ATTR_LOCAL) {
2439
			xfs_attr_leaf_name_local_t *name_loc =
2440
				xfs_attr_leaf_name_local(leaf, i);
2441 2442

			retval = context->put_listent(context,
2443
						entry->flags,
2444
						name_loc->nameval,
2445 2446
						(int)name_loc->namelen,
						be16_to_cpu(name_loc->valuelen),
2447
						&name_loc->nameval[name_loc->namelen]);
2448 2449
			if (retval)
				return retval;
L
Linus Torvalds 已提交
2450
		} else {
2451
			xfs_attr_leaf_name_remote_t *name_rmt =
2452
				xfs_attr_leaf_name_remote(leaf, i);
2453 2454 2455 2456 2457 2458 2459 2460 2461 2462

			int valuelen = be32_to_cpu(name_rmt->valuelen);

			if (context->put_value) {
				xfs_da_args_t args;

				memset((char *)&args, 0, sizeof(args));
				args.dp = context->dp;
				args.whichfork = XFS_ATTR_FORK;
				args.valuelen = valuelen;
2463
				args.value = kmem_alloc(valuelen, KM_SLEEP | KM_NOFS);
2464 2465 2466 2467 2468 2469
				args.rmtblkno = be32_to_cpu(name_rmt->valueblk);
				args.rmtblkcnt = XFS_B_TO_FSB(args.dp->i_mount, valuelen);
				retval = xfs_attr_rmtval_get(&args);
				if (retval)
					return retval;
				retval = context->put_listent(context,
2470
						entry->flags,
2471
						name_rmt->name,
2472 2473
						(int)name_rmt->namelen,
						valuelen,
2474
						args.value);
2475
				kmem_free(args.value);
2476
			} else {
2477
				retval = context->put_listent(context,
2478
						entry->flags,
2479
						name_rmt->name,
2480 2481 2482 2483 2484 2485
						(int)name_rmt->namelen,
						valuelen,
						NULL);
			}
			if (retval)
				return retval;
L
Linus Torvalds 已提交
2486
		}
2487 2488 2489
		if (context->seen_enough)
			break;
		cursor->offset++;
L
Linus Torvalds 已提交
2490
	}
C
Christoph Hellwig 已提交
2491
	trace_xfs_attr_list_leaf_end(context);
L
Linus Torvalds 已提交
2492 2493 2494 2495 2496 2497 2498 2499 2500 2501 2502 2503 2504 2505 2506 2507 2508
	return(retval);
}


/*========================================================================
 * Manage the INCOMPLETE flag in a leaf entry
 *========================================================================*/

/*
 * Clear the INCOMPLETE flag on an entry in a leaf block.
 */
int
xfs_attr_leaf_clearflag(xfs_da_args_t *args)
{
	xfs_attr_leafblock_t *leaf;
	xfs_attr_leaf_entry_t *entry;
	xfs_attr_leaf_name_remote_t *name_rmt;
2509
	struct xfs_buf *bp;
L
Linus Torvalds 已提交
2510 2511 2512 2513 2514 2515 2516
	int error;
#ifdef DEBUG
	xfs_attr_leaf_name_local_t *name_loc;
	int namelen;
	char *name;
#endif /* DEBUG */

2517
	trace_xfs_attr_leaf_clearflag(args);
L
Linus Torvalds 已提交
2518 2519 2520 2521
	/*
	 * Set up the operation.
	 */
	error = xfs_da_read_buf(args->trans, args->dp, args->blkno, -1, &bp,
2522
					     XFS_ATTR_FORK, NULL);
L
Linus Torvalds 已提交
2523 2524 2525 2526 2527
	if (error) {
		return(error);
	}
	ASSERT(bp != NULL);

2528
	leaf = bp->b_addr;
2529
	ASSERT(leaf->hdr.info.magic == cpu_to_be16(XFS_ATTR_LEAF_MAGIC));
2530
	ASSERT(args->index < be16_to_cpu(leaf->hdr.count));
L
Linus Torvalds 已提交
2531 2532 2533 2534 2535 2536
	ASSERT(args->index >= 0);
	entry = &leaf->entries[ args->index ];
	ASSERT(entry->flags & XFS_ATTR_INCOMPLETE);

#ifdef DEBUG
	if (entry->flags & XFS_ATTR_LOCAL) {
2537
		name_loc = xfs_attr_leaf_name_local(leaf, args->index);
L
Linus Torvalds 已提交
2538 2539 2540
		namelen = name_loc->namelen;
		name = (char *)name_loc->nameval;
	} else {
2541
		name_rmt = xfs_attr_leaf_name_remote(leaf, args->index);
L
Linus Torvalds 已提交
2542 2543 2544
		namelen = name_rmt->namelen;
		name = (char *)name_rmt->name;
	}
2545
	ASSERT(be32_to_cpu(entry->hashval) == args->hashval);
L
Linus Torvalds 已提交
2546 2547 2548 2549 2550
	ASSERT(namelen == args->namelen);
	ASSERT(memcmp(name, args->name, namelen) == 0);
#endif /* DEBUG */

	entry->flags &= ~XFS_ATTR_INCOMPLETE;
2551
	xfs_trans_log_buf(args->trans, bp,
L
Linus Torvalds 已提交
2552 2553 2554 2555
			 XFS_DA_LOGRANGE(leaf, entry, sizeof(*entry)));

	if (args->rmtblkno) {
		ASSERT((entry->flags & XFS_ATTR_LOCAL) == 0);
2556
		name_rmt = xfs_attr_leaf_name_remote(leaf, args->index);
2557 2558
		name_rmt->valueblk = cpu_to_be32(args->rmtblkno);
		name_rmt->valuelen = cpu_to_be32(args->valuelen);
2559
		xfs_trans_log_buf(args->trans, bp,
L
Linus Torvalds 已提交
2560 2561 2562 2563 2564 2565
			 XFS_DA_LOGRANGE(leaf, name_rmt, sizeof(*name_rmt)));
	}

	/*
	 * Commit the flag value change and start the next trans in series.
	 */
2566
	return xfs_trans_roll(&args->trans, args->dp);
L
Linus Torvalds 已提交
2567 2568 2569 2570 2571 2572 2573 2574 2575 2576 2577
}

/*
 * Set the INCOMPLETE flag on an entry in a leaf block.
 */
int
xfs_attr_leaf_setflag(xfs_da_args_t *args)
{
	xfs_attr_leafblock_t *leaf;
	xfs_attr_leaf_entry_t *entry;
	xfs_attr_leaf_name_remote_t *name_rmt;
2578
	struct xfs_buf *bp;
L
Linus Torvalds 已提交
2579 2580
	int error;

2581 2582
	trace_xfs_attr_leaf_setflag(args);

L
Linus Torvalds 已提交
2583 2584 2585 2586
	/*
	 * Set up the operation.
	 */
	error = xfs_da_read_buf(args->trans, args->dp, args->blkno, -1, &bp,
2587
					     XFS_ATTR_FORK, NULL);
L
Linus Torvalds 已提交
2588 2589 2590 2591 2592
	if (error) {
		return(error);
	}
	ASSERT(bp != NULL);

2593
	leaf = bp->b_addr;
2594
	ASSERT(leaf->hdr.info.magic == cpu_to_be16(XFS_ATTR_LEAF_MAGIC));
2595
	ASSERT(args->index < be16_to_cpu(leaf->hdr.count));
L
Linus Torvalds 已提交
2596 2597 2598 2599 2600
	ASSERT(args->index >= 0);
	entry = &leaf->entries[ args->index ];

	ASSERT((entry->flags & XFS_ATTR_INCOMPLETE) == 0);
	entry->flags |= XFS_ATTR_INCOMPLETE;
2601
	xfs_trans_log_buf(args->trans, bp,
L
Linus Torvalds 已提交
2602 2603
			XFS_DA_LOGRANGE(leaf, entry, sizeof(*entry)));
	if ((entry->flags & XFS_ATTR_LOCAL) == 0) {
2604
		name_rmt = xfs_attr_leaf_name_remote(leaf, args->index);
L
Linus Torvalds 已提交
2605 2606
		name_rmt->valueblk = 0;
		name_rmt->valuelen = 0;
2607
		xfs_trans_log_buf(args->trans, bp,
L
Linus Torvalds 已提交
2608 2609 2610 2611 2612 2613
			 XFS_DA_LOGRANGE(leaf, name_rmt, sizeof(*name_rmt)));
	}

	/*
	 * Commit the flag value change and start the next trans in series.
	 */
2614
	return xfs_trans_roll(&args->trans, args->dp);
L
Linus Torvalds 已提交
2615 2616 2617 2618 2619 2620 2621 2622 2623 2624 2625 2626 2627 2628 2629
}

/*
 * In a single transaction, clear the INCOMPLETE flag on the leaf entry
 * given by args->blkno/index and set the INCOMPLETE flag on the leaf
 * entry given by args->blkno2/index2.
 *
 * Note that they could be in different blocks, or in the same block.
 */
int
xfs_attr_leaf_flipflags(xfs_da_args_t *args)
{
	xfs_attr_leafblock_t *leaf1, *leaf2;
	xfs_attr_leaf_entry_t *entry1, *entry2;
	xfs_attr_leaf_name_remote_t *name_rmt;
2630
	struct xfs_buf *bp1, *bp2;
L
Linus Torvalds 已提交
2631 2632 2633 2634 2635 2636 2637
	int error;
#ifdef DEBUG
	xfs_attr_leaf_name_local_t *name_loc;
	int namelen1, namelen2;
	char *name1, *name2;
#endif /* DEBUG */

2638 2639
	trace_xfs_attr_leaf_flipflags(args);

L
Linus Torvalds 已提交
2640 2641 2642 2643
	/*
	 * Read the block containing the "old" attr
	 */
	error = xfs_da_read_buf(args->trans, args->dp, args->blkno, -1, &bp1,
2644
					     XFS_ATTR_FORK, NULL);
L
Linus Torvalds 已提交
2645 2646 2647 2648 2649 2650 2651 2652 2653 2654
	if (error) {
		return(error);
	}
	ASSERT(bp1 != NULL);

	/*
	 * Read the block containing the "new" attr, if it is different
	 */
	if (args->blkno2 != args->blkno) {
		error = xfs_da_read_buf(args->trans, args->dp, args->blkno2,
2655
					-1, &bp2, XFS_ATTR_FORK, NULL);
L
Linus Torvalds 已提交
2656 2657 2658 2659 2660 2661 2662 2663
		if (error) {
			return(error);
		}
		ASSERT(bp2 != NULL);
	} else {
		bp2 = bp1;
	}

2664
	leaf1 = bp1->b_addr;
2665
	ASSERT(leaf1->hdr.info.magic == cpu_to_be16(XFS_ATTR_LEAF_MAGIC));
2666
	ASSERT(args->index < be16_to_cpu(leaf1->hdr.count));
L
Linus Torvalds 已提交
2667 2668 2669
	ASSERT(args->index >= 0);
	entry1 = &leaf1->entries[ args->index ];

2670
	leaf2 = bp2->b_addr;
2671
	ASSERT(leaf2->hdr.info.magic == cpu_to_be16(XFS_ATTR_LEAF_MAGIC));
2672
	ASSERT(args->index2 < be16_to_cpu(leaf2->hdr.count));
L
Linus Torvalds 已提交
2673 2674 2675 2676 2677
	ASSERT(args->index2 >= 0);
	entry2 = &leaf2->entries[ args->index2 ];

#ifdef DEBUG
	if (entry1->flags & XFS_ATTR_LOCAL) {
2678
		name_loc = xfs_attr_leaf_name_local(leaf1, args->index);
L
Linus Torvalds 已提交
2679 2680 2681
		namelen1 = name_loc->namelen;
		name1 = (char *)name_loc->nameval;
	} else {
2682
		name_rmt = xfs_attr_leaf_name_remote(leaf1, args->index);
L
Linus Torvalds 已提交
2683 2684 2685 2686
		namelen1 = name_rmt->namelen;
		name1 = (char *)name_rmt->name;
	}
	if (entry2->flags & XFS_ATTR_LOCAL) {
2687
		name_loc = xfs_attr_leaf_name_local(leaf2, args->index2);
L
Linus Torvalds 已提交
2688 2689 2690
		namelen2 = name_loc->namelen;
		name2 = (char *)name_loc->nameval;
	} else {
2691
		name_rmt = xfs_attr_leaf_name_remote(leaf2, args->index2);
L
Linus Torvalds 已提交
2692 2693 2694
		namelen2 = name_rmt->namelen;
		name2 = (char *)name_rmt->name;
	}
2695
	ASSERT(be32_to_cpu(entry1->hashval) == be32_to_cpu(entry2->hashval));
L
Linus Torvalds 已提交
2696 2697 2698 2699 2700 2701 2702 2703
	ASSERT(namelen1 == namelen2);
	ASSERT(memcmp(name1, name2, namelen1) == 0);
#endif /* DEBUG */

	ASSERT(entry1->flags & XFS_ATTR_INCOMPLETE);
	ASSERT((entry2->flags & XFS_ATTR_INCOMPLETE) == 0);

	entry1->flags &= ~XFS_ATTR_INCOMPLETE;
2704
	xfs_trans_log_buf(args->trans, bp1,
L
Linus Torvalds 已提交
2705 2706 2707
			  XFS_DA_LOGRANGE(leaf1, entry1, sizeof(*entry1)));
	if (args->rmtblkno) {
		ASSERT((entry1->flags & XFS_ATTR_LOCAL) == 0);
2708
		name_rmt = xfs_attr_leaf_name_remote(leaf1, args->index);
2709 2710
		name_rmt->valueblk = cpu_to_be32(args->rmtblkno);
		name_rmt->valuelen = cpu_to_be32(args->valuelen);
2711
		xfs_trans_log_buf(args->trans, bp1,
L
Linus Torvalds 已提交
2712 2713 2714 2715
			 XFS_DA_LOGRANGE(leaf1, name_rmt, sizeof(*name_rmt)));
	}

	entry2->flags |= XFS_ATTR_INCOMPLETE;
2716
	xfs_trans_log_buf(args->trans, bp2,
L
Linus Torvalds 已提交
2717 2718
			  XFS_DA_LOGRANGE(leaf2, entry2, sizeof(*entry2)));
	if ((entry2->flags & XFS_ATTR_LOCAL) == 0) {
2719
		name_rmt = xfs_attr_leaf_name_remote(leaf2, args->index2);
L
Linus Torvalds 已提交
2720 2721
		name_rmt->valueblk = 0;
		name_rmt->valuelen = 0;
2722
		xfs_trans_log_buf(args->trans, bp2,
L
Linus Torvalds 已提交
2723 2724 2725 2726 2727 2728
			 XFS_DA_LOGRANGE(leaf2, name_rmt, sizeof(*name_rmt)));
	}

	/*
	 * Commit the flag value change and start the next trans in series.
	 */
2729
	error = xfs_trans_roll(&args->trans, args->dp);
L
Linus Torvalds 已提交
2730 2731 2732 2733 2734 2735 2736 2737 2738 2739 2740 2741 2742 2743 2744 2745 2746

	return(error);
}

/*========================================================================
 * Indiscriminately delete the entire attribute fork
 *========================================================================*/

/*
 * Recurse (gasp!) through the attribute nodes until we find leaves.
 * We're doing a depth-first traversal in order to invalidate everything.
 */
int
xfs_attr_root_inactive(xfs_trans_t **trans, xfs_inode_t *dp)
{
	xfs_da_blkinfo_t *info;
	xfs_daddr_t blkno;
2747
	struct xfs_buf *bp;
L
Linus Torvalds 已提交
2748 2749 2750 2751 2752 2753 2754 2755
	int error;

	/*
	 * Read block 0 to see what we have to work with.
	 * We only get here if we have extents, since we remove
	 * the extents in reverse order the extent containing
	 * block 0 must still be there.
	 */
2756
	error = xfs_da_read_buf(*trans, dp, 0, -1, &bp, XFS_ATTR_FORK, NULL);
L
Linus Torvalds 已提交
2757 2758
	if (error)
		return(error);
2759
	blkno = XFS_BUF_ADDR(bp);
L
Linus Torvalds 已提交
2760 2761 2762 2763 2764

	/*
	 * Invalidate the tree, even if the "tree" is only a single leaf block.
	 * This is a depth-first traversal!
	 */
2765
	info = bp->b_addr;
2766
	if (info->magic == cpu_to_be16(XFS_DA_NODE_MAGIC)) {
L
Linus Torvalds 已提交
2767
		error = xfs_attr_node_inactive(trans, dp, bp, 1);
2768
	} else if (info->magic == cpu_to_be16(XFS_ATTR_LEAF_MAGIC)) {
L
Linus Torvalds 已提交
2769 2770 2771
		error = xfs_attr_leaf_inactive(trans, dp, bp);
	} else {
		error = XFS_ERROR(EIO);
2772
		xfs_trans_brelse(*trans, bp);
L
Linus Torvalds 已提交
2773 2774 2775 2776 2777 2778 2779 2780 2781 2782
	}
	if (error)
		return(error);

	/*
	 * Invalidate the incore copy of the root block.
	 */
	error = xfs_da_get_buf(*trans, dp, 0, blkno, &bp, XFS_ATTR_FORK);
	if (error)
		return(error);
2783
	xfs_trans_binval(*trans, bp);	/* remove from cache */
L
Linus Torvalds 已提交
2784 2785 2786
	/*
	 * Commit the invalidate and start the next transaction.
	 */
2787
	error = xfs_trans_roll(trans, dp);
L
Linus Torvalds 已提交
2788 2789 2790 2791 2792 2793 2794 2795

	return (error);
}

/*
 * Recurse (gasp!) through the attribute nodes until we find leaves.
 * We're doing a depth-first traversal in order to invalidate everything.
 */
2796
STATIC int
2797 2798 2799 2800 2801
xfs_attr_node_inactive(
	struct xfs_trans **trans,
	struct xfs_inode *dp,
	struct xfs_buf	*bp,
	int		level)
L
Linus Torvalds 已提交
2802 2803 2804 2805 2806 2807
{
	xfs_da_blkinfo_t *info;
	xfs_da_intnode_t *node;
	xfs_dablk_t child_fsb;
	xfs_daddr_t parent_blkno, child_blkno;
	int error, count, i;
2808
	struct xfs_buf *child_bp;
L
Linus Torvalds 已提交
2809 2810 2811 2812 2813

	/*
	 * Since this code is recursive (gasp!) we must protect ourselves.
	 */
	if (level > XFS_DA_NODE_MAXDEPTH) {
2814
		xfs_trans_brelse(*trans, bp);	/* no locks for later trans */
L
Linus Torvalds 已提交
2815 2816 2817
		return(XFS_ERROR(EIO));
	}

2818
	node = bp->b_addr;
2819
	ASSERT(node->hdr.info.magic == cpu_to_be16(XFS_DA_NODE_MAGIC));
2820
	parent_blkno = XFS_BUF_ADDR(bp);	/* save for re-read later */
2821
	count = be16_to_cpu(node->hdr.count);
L
Linus Torvalds 已提交
2822
	if (!count) {
2823
		xfs_trans_brelse(*trans, bp);
L
Linus Torvalds 已提交
2824 2825
		return(0);
	}
2826
	child_fsb = be32_to_cpu(node->btree[0].before);
2827
	xfs_trans_brelse(*trans, bp);	/* no locks for later trans */
L
Linus Torvalds 已提交
2828 2829 2830 2831 2832 2833 2834 2835 2836 2837 2838 2839 2840 2841

	/*
	 * If this is the node level just above the leaves, simply loop
	 * over the leaves removing all of them.  If this is higher up
	 * in the tree, recurse downward.
	 */
	for (i = 0; i < count; i++) {
		/*
		 * Read the subsidiary block to see what we have to work with.
		 * Don't do this in a transaction.  This is a depth-first
		 * traversal of the tree so we may deal with many blocks
		 * before we come back to this one.
		 */
		error = xfs_da_read_buf(*trans, dp, child_fsb, -2, &child_bp,
2842
						XFS_ATTR_FORK, NULL);
L
Linus Torvalds 已提交
2843 2844 2845 2846
		if (error)
			return(error);
		if (child_bp) {
						/* save for re-read later */
2847
			child_blkno = XFS_BUF_ADDR(child_bp);
L
Linus Torvalds 已提交
2848 2849 2850 2851

			/*
			 * Invalidate the subtree, however we have to.
			 */
2852
			info = child_bp->b_addr;
2853
			if (info->magic == cpu_to_be16(XFS_DA_NODE_MAGIC)) {
L
Linus Torvalds 已提交
2854 2855
				error = xfs_attr_node_inactive(trans, dp,
						child_bp, level+1);
2856
			} else if (info->magic == cpu_to_be16(XFS_ATTR_LEAF_MAGIC)) {
L
Linus Torvalds 已提交
2857 2858 2859 2860
				error = xfs_attr_leaf_inactive(trans, dp,
						child_bp);
			} else {
				error = XFS_ERROR(EIO);
2861
				xfs_trans_brelse(*trans, child_bp);
L
Linus Torvalds 已提交
2862 2863 2864 2865 2866 2867 2868 2869 2870 2871 2872 2873
			}
			if (error)
				return(error);

			/*
			 * Remove the subsidiary block from the cache
			 * and from the log.
			 */
			error = xfs_da_get_buf(*trans, dp, 0, child_blkno,
				&child_bp, XFS_ATTR_FORK);
			if (error)
				return(error);
2874
			xfs_trans_binval(*trans, child_bp);
L
Linus Torvalds 已提交
2875 2876 2877 2878 2879 2880 2881 2882
		}

		/*
		 * If we're not done, re-read the parent to get the next
		 * child block number.
		 */
		if ((i+1) < count) {
			error = xfs_da_read_buf(*trans, dp, 0, parent_blkno,
2883
				&bp, XFS_ATTR_FORK, NULL);
L
Linus Torvalds 已提交
2884 2885
			if (error)
				return(error);
2886
			child_fsb = be32_to_cpu(node->btree[i+1].before);
2887
			xfs_trans_brelse(*trans, bp);
L
Linus Torvalds 已提交
2888 2889 2890 2891
		}
		/*
		 * Atomically commit the whole invalidate stuff.
		 */
2892 2893
		error = xfs_trans_roll(trans, dp);
		if (error)
L
Linus Torvalds 已提交
2894 2895 2896 2897 2898 2899 2900 2901 2902 2903 2904 2905
			return (error);
	}

	return(0);
}

/*
 * Invalidate all of the "remote" value regions pointed to by a particular
 * leaf block.
 * Note that we must release the lock on the buffer so that we are not
 * caught holding something that the logging code wants to flush to disk.
 */
2906
STATIC int
2907 2908 2909 2910
xfs_attr_leaf_inactive(
	struct xfs_trans **trans,
	struct xfs_inode *dp,
	struct xfs_buf	*bp)
L
Linus Torvalds 已提交
2911 2912 2913 2914 2915 2916 2917
{
	xfs_attr_leafblock_t *leaf;
	xfs_attr_leaf_entry_t *entry;
	xfs_attr_leaf_name_remote_t *name_rmt;
	xfs_attr_inactive_list_t *list, *lp;
	int error, count, size, tmp, i;

2918
	leaf = bp->b_addr;
2919
	ASSERT(leaf->hdr.info.magic == cpu_to_be16(XFS_ATTR_LEAF_MAGIC));
L
Linus Torvalds 已提交
2920 2921 2922 2923 2924 2925

	/*
	 * Count the number of "remote" value extents.
	 */
	count = 0;
	entry = &leaf->entries[0];
2926
	for (i = 0; i < be16_to_cpu(leaf->hdr.count); entry++, i++) {
2927 2928
		if (be16_to_cpu(entry->nameidx) &&
		    ((entry->flags & XFS_ATTR_LOCAL) == 0)) {
2929
			name_rmt = xfs_attr_leaf_name_remote(leaf, i);
L
Linus Torvalds 已提交
2930 2931 2932 2933 2934 2935 2936 2937 2938
			if (name_rmt->valueblk)
				count++;
		}
	}

	/*
	 * If there are no "remote" values, we're done.
	 */
	if (count == 0) {
2939
		xfs_trans_brelse(*trans, bp);
L
Linus Torvalds 已提交
2940 2941 2942 2943 2944 2945 2946 2947 2948 2949 2950 2951 2952 2953
		return(0);
	}

	/*
	 * Allocate storage for a list of all the "remote" value extents.
	 */
	size = count * sizeof(xfs_attr_inactive_list_t);
	list = (xfs_attr_inactive_list_t *)kmem_alloc(size, KM_SLEEP);

	/*
	 * Identify each of the "remote" value extents.
	 */
	lp = list;
	entry = &leaf->entries[0];
2954
	for (i = 0; i < be16_to_cpu(leaf->hdr.count); entry++, i++) {
2955 2956
		if (be16_to_cpu(entry->nameidx) &&
		    ((entry->flags & XFS_ATTR_LOCAL) == 0)) {
2957
			name_rmt = xfs_attr_leaf_name_remote(leaf, i);
L
Linus Torvalds 已提交
2958
			if (name_rmt->valueblk) {
2959 2960 2961
				lp->valueblk = be32_to_cpu(name_rmt->valueblk);
				lp->valuelen = XFS_B_TO_FSB(dp->i_mount,
						    be32_to_cpu(name_rmt->valuelen));
L
Linus Torvalds 已提交
2962 2963 2964 2965
				lp++;
			}
		}
	}
2966
	xfs_trans_brelse(*trans, bp);	/* unlock for trans. in freextent() */
L
Linus Torvalds 已提交
2967 2968 2969 2970 2971 2972 2973

	/*
	 * Invalidate each of the "remote" value extents.
	 */
	error = 0;
	for (lp = list, i = 0; i < count; i++, lp++) {
		tmp = xfs_attr_leaf_freextent(trans, dp,
2974 2975
				lp->valueblk, lp->valuelen);

L
Linus Torvalds 已提交
2976 2977 2978 2979
		if (error == 0)
			error = tmp;	/* save only the 1st errno */
	}

2980
	kmem_free((xfs_caddr_t)list);
L
Linus Torvalds 已提交
2981 2982 2983 2984 2985 2986 2987
	return(error);
}

/*
 * Look at all the extents for this logical region,
 * invalidate any buffers that are incore/in transactions.
 */
2988
STATIC int
L
Linus Torvalds 已提交
2989 2990 2991 2992 2993 2994 2995 2996 2997 2998 2999 3000 3001 3002 3003 3004 3005 3006 3007 3008
xfs_attr_leaf_freextent(xfs_trans_t **trans, xfs_inode_t *dp,
				    xfs_dablk_t blkno, int blkcnt)
{
	xfs_bmbt_irec_t map;
	xfs_dablk_t tblkno;
	int tblkcnt, dblkcnt, nmap, error;
	xfs_daddr_t dblkno;
	xfs_buf_t *bp;

	/*
	 * Roll through the "value", invalidating the attribute value's
	 * blocks.
	 */
	tblkno = blkno;
	tblkcnt = blkcnt;
	while (tblkcnt > 0) {
		/*
		 * Try to remember where we decided to put the value.
		 */
		nmap = 1;
D
Dave Chinner 已提交
3009 3010
		error = xfs_bmapi_read(dp, (xfs_fileoff_t)tblkno, tblkcnt,
				       &map, &nmap, XFS_BMAPI_ATTRFORK);
L
Linus Torvalds 已提交
3011 3012 3013 3014 3015 3016 3017 3018 3019 3020 3021 3022 3023 3024 3025 3026 3027 3028
		if (error) {
			return(error);
		}
		ASSERT(nmap == 1);
		ASSERT(map.br_startblock != DELAYSTARTBLOCK);

		/*
		 * If it's a hole, these are already unmapped
		 * so there's nothing to invalidate.
		 */
		if (map.br_startblock != HOLESTARTBLOCK) {

			dblkno = XFS_FSB_TO_DADDR(dp->i_mount,
						  map.br_startblock);
			dblkcnt = XFS_FSB_TO_BB(dp->i_mount,
						map.br_blockcount);
			bp = xfs_trans_get_buf(*trans,
					dp->i_mount->m_ddev_targp,
D
Dave Chinner 已提交
3029
					dblkno, dblkcnt, 0);
3030 3031
			if (!bp)
				return ENOMEM;
L
Linus Torvalds 已提交
3032 3033 3034 3035
			xfs_trans_binval(*trans, bp);
			/*
			 * Roll to next transaction.
			 */
3036 3037
			error = xfs_trans_roll(trans, dp);
			if (error)
L
Linus Torvalds 已提交
3038 3039 3040 3041 3042 3043 3044 3045 3046
				return (error);
		}

		tblkno += map.br_blockcount;
		tblkcnt -= map.br_blockcount;
	}

	return(0);
}