xfs_attr_leaf.c 85.5 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
static void
92 93 94 95 96 97 98 99 100 101 102 103
xfs_attr_leaf_verify(
	struct xfs_buf		*bp)
{
	struct xfs_mount	*mp = bp->b_target->bt_mount;
	struct xfs_attr_leaf_hdr *hdr = bp->b_addr;
	int			block_ok = 0;

	block_ok = hdr->info.magic == cpu_to_be16(XFS_ATTR_LEAF_MAGIC);
	if (!block_ok) {
		XFS_CORRUPTION_ERROR(__func__, XFS_ERRLEVEL_LOW, mp, hdr);
		xfs_buf_ioerror(bp, EFSCORRUPTED);
	}
104 105 106
}

static void
107
xfs_attr_leaf_read_verify(
108 109 110 111
	struct xfs_buf	*bp)
{
	xfs_attr_leaf_verify(bp);
}
112

113 114
static void
xfs_attr_leaf_write_verify(
115 116 117
	struct xfs_buf	*bp)
{
	xfs_attr_leaf_verify(bp);
118 119
}

120 121 122 123
const struct xfs_buf_ops xfs_attr_leaf_buf_ops = {
	.verify_read = xfs_attr_leaf_read_verify,
	.verify_write = xfs_attr_leaf_write_verify,
};
124

125 126 127 128 129 130 131 132 133
int
xfs_attr_leaf_read(
	struct xfs_trans	*tp,
	struct xfs_inode	*dp,
	xfs_dablk_t		bno,
	xfs_daddr_t		mappedbno,
	struct xfs_buf		**bpp)
{
	return xfs_da_read_buf(tp, dp, bno, mappedbno, bpp,
134
				XFS_ATTR_FORK, &xfs_attr_leaf_buf_ops);
135 136
}

137 138 139 140 141 142 143 144
/*========================================================================
 * Namespace helper routines
 *========================================================================*/

/*
 * If namespace bits don't match return 0.
 * If all match then return 1.
 */
145
STATIC int
146 147 148 149 150
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 已提交
151 152

/*========================================================================
153
 * External routines when attribute fork size < XFS_LITINO(mp).
L
Linus Torvalds 已提交
154 155 156
 *========================================================================*/

/*
157 158
 * Query whether the requested number of additional bytes of extended
 * attribute space will be able to fit inline.
159
 *
160 161 162 163 164
 * 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 已提交
165 166
 */
int
167 168 169 170 171
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 */
172
	int dsize;
173 174
	xfs_mount_t *mp = dp->i_mount;

175 176
	/* rounded down */
	offset = (XFS_LITINO(mp, dp->i_d.di_version) - bytes) >> 3;
177 178 179 180 181 182 183 184 185 186

	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;
	}

187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205
	/*
	 * 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))
206 207
		return 0;

208
	dsize = dp->i_df.if_bytes;
209

210 211
	switch (dp->i_d.di_format) {
	case XFS_DINODE_FMT_EXTENTS:
212
		/*
213
		 * If there is no attr fork and the data fork is extents, 
214 215 216
		 * 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
217
		 * the btree root.
218
		 */
C
Christoph Hellwig 已提交
219 220
		if (!dp->i_d.di_forkoff && dp->i_df.if_bytes >
		    xfs_default_attroffset(dp))
221 222 223 224
			dsize = XFS_BMDR_SPACE_CALC(MINDBTPTRS);
		break;
	case XFS_DINODE_FMT_BTREE:
		/*
225 226 227
		 * 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
228 229 230
		 * plenty of room for attrs
		 */
		if (dp->i_d.di_forkoff) {
231
			if (offset < dp->i_d.di_forkoff)
232
				return 0;
233 234
			return dp->i_d.di_forkoff;
		}
235
		dsize = XFS_BMAP_BROOT_SPACE(mp, dp->i_df.if_broot);
236 237
		break;
	}
238 239 240

	/*
	 * A data fork btree root must have space for at least
241 242 243
	 * MINDBTPTRS key/ptr pairs if the data fork is small or empty.
	 */
	minforkoff = MAX(dsize, XFS_BMDR_SPACE_CALC(MINDBTPTRS));
244 245 246
	minforkoff = roundup(minforkoff, 8) >> 3;

	/* attr fork btree root can have at least this many key/ptr pairs */
247 248
	maxforkoff = XFS_LITINO(mp, dp->i_d.di_version) -
			XFS_BMDR_SPACE_CALC(MINABTPTRS);
249 250 251 252
	maxforkoff = maxforkoff >> 3;	/* rounded down */

	if (offset >= maxforkoff)
		return maxforkoff;
253 254
	if (offset >= minforkoff)
		return offset;
255 256 257 258 259 260 261 262 263
	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)
{
264
	if ((mp->m_flags & XFS_MOUNT_ATTR2) &&
265
	    !(xfs_sb_version_hasattr2(&mp->m_sb))) {
E
Eric Sandeen 已提交
266
		spin_lock(&mp->m_sb_lock);
267 268
		if (!xfs_sb_version_hasattr2(&mp->m_sb)) {
			xfs_sb_version_addattr2(&mp->m_sb);
E
Eric Sandeen 已提交
269
			spin_unlock(&mp->m_sb_lock);
270 271
			xfs_mod_sb(tp, XFS_SB_VERSIONNUM | XFS_SB_FEATURES2);
		} else
E
Eric Sandeen 已提交
272
			spin_unlock(&mp->m_sb_lock);
273 274 275 276 277 278 279
	}
}

/*
 * Create the initial contents of a shortform attribute list.
 */
void
L
Linus Torvalds 已提交
280 281 282 283 284 285
xfs_attr_shortform_create(xfs_da_args_t *args)
{
	xfs_attr_sf_hdr_t *hdr;
	xfs_inode_t *dp;
	xfs_ifork_t *ifp;

286 287
	trace_xfs_attr_sf_create(args);

L
Linus Torvalds 已提交
288 289 290 291 292 293 294 295 296 297 298 299 300 301 302
	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;
303
	hdr->totsize = cpu_to_be16(sizeof(*hdr));
L
Linus Torvalds 已提交
304 305 306 307 308 309 310
	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.
 */
311 312
void
xfs_attr_shortform_add(xfs_da_args_t *args, int forkoff)
L
Linus Torvalds 已提交
313 314 315 316
{
	xfs_attr_shortform_t *sf;
	xfs_attr_sf_entry_t *sfe;
	int i, offset, size;
317
	xfs_mount_t *mp;
L
Linus Torvalds 已提交
318 319 320
	xfs_inode_t *dp;
	xfs_ifork_t *ifp;

321 322
	trace_xfs_attr_sf_add(args);

L
Linus Torvalds 已提交
323
	dp = args->dp;
324 325 326
	mp = dp->i_mount;
	dp->i_d.di_forkoff = forkoff;

L
Linus Torvalds 已提交
327 328 329 330
	ifp = dp->i_afp;
	ASSERT(ifp->if_flags & XFS_IFINLINE);
	sf = (xfs_attr_shortform_t *)ifp->if_u1.if_data;
	sfe = &sf->list[0];
331
	for (i = 0; i < sf->hdr.count; sfe = XFS_ATTR_SF_NEXTENTRY(sfe), i++) {
332
#ifdef DEBUG
L
Linus Torvalds 已提交
333 334 335 336
		if (sfe->namelen != args->namelen)
			continue;
		if (memcmp(args->name, sfe->nameval, args->namelen) != 0)
			continue;
337
		if (!xfs_attr_namesp_match(args->flags, sfe->flags))
L
Linus Torvalds 已提交
338
			continue;
339 340
		ASSERT(0);
#endif
L
Linus Torvalds 已提交
341 342 343 344 345 346 347 348 349
	}

	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;
350
	sfe->valuelen = args->valuelen;
351
	sfe->flags = XFS_ATTR_NSP_ARGS_TO_ONDISK(args->flags);
L
Linus Torvalds 已提交
352 353
	memcpy(sfe->nameval, args->name, args->namelen);
	memcpy(&sfe->nameval[args->namelen], args->value, args->valuelen);
354
	sf->hdr.count++;
355
	be16_add_cpu(&sf->hdr.totsize, size);
L
Linus Torvalds 已提交
356 357
	xfs_trans_log_inode(args->trans, dp, XFS_ILOG_CORE | XFS_ILOG_ADATA);

358
	xfs_sbversion_add_attr2(mp, args->trans);
L
Linus Torvalds 已提交
359 360
}

361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379
/*
 * 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 已提交
380
/*
381
 * Remove an attribute from the shortform attribute list structure.
L
Linus Torvalds 已提交
382 383 384 385 386 387 388
 */
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;
389
	xfs_mount_t *mp;
L
Linus Torvalds 已提交
390 391
	xfs_inode_t *dp;

392 393
	trace_xfs_attr_sf_remove(args);

L
Linus Torvalds 已提交
394
	dp = args->dp;
395
	mp = dp->i_mount;
L
Linus Torvalds 已提交
396 397 398
	base = sizeof(xfs_attr_sf_hdr_t);
	sf = (xfs_attr_shortform_t *)dp->i_afp->if_u1.if_data;
	sfe = &sf->list[0];
399
	end = sf->hdr.count;
400
	for (i = 0; i < end; sfe = XFS_ATTR_SF_NEXTENTRY(sfe),
L
Linus Torvalds 已提交
401 402 403 404 405 406
					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;
407
		if (!xfs_attr_namesp_match(args->flags, sfe->flags))
L
Linus Torvalds 已提交
408 409 410
			continue;
		break;
	}
411
	if (i == end)
L
Linus Torvalds 已提交
412 413
		return(XFS_ERROR(ENOATTR));

414 415 416
	/*
	 * Fix up the attribute fork data, covering the hole
	 */
L
Linus Torvalds 已提交
417
	end = base + size;
418
	totsize = be16_to_cpu(sf->hdr.totsize);
419 420
	if (end != totsize)
		memmove(&((char *)sf)[base], &((char *)sf)[end], totsize - end);
421
	sf->hdr.count--;
422
	be16_add_cpu(&sf->hdr.totsize, -size);
423 424 425 426 427

	/*
	 * Fix up the start offset of the attribute fork
	 */
	totsize -= size;
428
	if (totsize == sizeof(xfs_attr_sf_hdr_t) &&
429 430 431 432
	    (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);
433 434 435 436
	} 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);
437 438 439 440
		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);
441 442 443 444 445
		xfs_trans_log_inode(args->trans, dp,
					XFS_ILOG_CORE | XFS_ILOG_ADATA);
	}

	xfs_sbversion_add_attr2(mp, args->trans);
L
Linus Torvalds 已提交
446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461

	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;

462 463
	trace_xfs_attr_sf_lookup(args);

L
Linus Torvalds 已提交
464 465 466 467
	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];
468
	for (i = 0; i < sf->hdr.count;
L
Linus Torvalds 已提交
469 470 471 472 473
				sfe = XFS_ATTR_SF_NEXTENTRY(sfe), i++) {
		if (sfe->namelen != args->namelen)
			continue;
		if (memcmp(args->name, sfe->nameval, args->namelen) != 0)
			continue;
474
		if (!xfs_attr_namesp_match(args->flags, sfe->flags))
L
Linus Torvalds 已提交
475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494
			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];
495
	for (i = 0; i < sf->hdr.count;
L
Linus Torvalds 已提交
496 497 498 499 500
				sfe = XFS_ATTR_SF_NEXTENTRY(sfe), i++) {
		if (sfe->namelen != args->namelen)
			continue;
		if (memcmp(args->name, sfe->nameval, args->namelen) != 0)
			continue;
501
		if (!xfs_attr_namesp_match(args->flags, sfe->flags))
L
Linus Torvalds 已提交
502 503
			continue;
		if (args->flags & ATTR_KERNOVAL) {
504
			args->valuelen = sfe->valuelen;
L
Linus Torvalds 已提交
505 506
			return(XFS_ERROR(EEXIST));
		}
507 508
		if (args->valuelen < sfe->valuelen) {
			args->valuelen = sfe->valuelen;
L
Linus Torvalds 已提交
509 510
			return(XFS_ERROR(ERANGE));
		}
511
		args->valuelen = sfe->valuelen;
L
Linus Torvalds 已提交
512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531
		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;
532
	struct xfs_buf *bp;
L
Linus Torvalds 已提交
533 534
	xfs_ifork_t *ifp;

535 536
	trace_xfs_attr_sf_to_leaf(args);

L
Linus Torvalds 已提交
537 538 539
	dp = args->dp;
	ifp = dp->i_afp;
	sf = (xfs_attr_shortform_t *)ifp->if_u1.if_data;
540
	size = be16_to_cpu(sf->hdr.totsize);
L
Linus Torvalds 已提交
541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579
	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;
580
	nargs.op_flags = XFS_DA_OP_OKNOENT;
L
Linus Torvalds 已提交
581 582

	sfe = &sf->list[0];
583
	for (i = 0; i < sf->hdr.count; i++) {
584
		nargs.name = sfe->nameval;
L
Linus Torvalds 已提交
585
		nargs.namelen = sfe->namelen;
586
		nargs.value = &sfe->nameval[nargs.namelen];
587
		nargs.valuelen = sfe->valuelen;
588
		nargs.hashval = xfs_da_hashname(sfe->nameval,
L
Linus Torvalds 已提交
589
						sfe->namelen);
590
		nargs.flags = XFS_ATTR_NSP_ONDISK_TO_ARGS(sfe->flags);
L
Linus Torvalds 已提交
591 592 593 594 595 596 597 598 599 600 601
		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:
602
	kmem_free(tmpbuffer);
L
Linus Torvalds 已提交
603 604 605 606 607 608 609 610 611 612
	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;
613
	if (sa->hash < sb->hash) {
L
Linus Torvalds 已提交
614
		return(-1);
615
	} else if (sa->hash > sb->hash) {
L
Linus Torvalds 已提交
616 617 618 619 620 621
		return(1);
	} else {
		return(sa->entno - sb->entno);
	}
}

622 623 624 625

#define XFS_ISRESET_CURSOR(cursor) \
	(!((cursor)->initted) && !((cursor)->hashval) && \
	 !((cursor)->blkno) && !((cursor)->offset))
L
Linus Torvalds 已提交
626 627
/*
 * Copy out entries of shortform attribute lists for attr_list().
628
 * Shortform attribute lists are not stored in hashval sorted order.
L
Linus Torvalds 已提交
629 630 631 632 633 634 635 636 637 638 639 640 641 642
 * 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;
643
	int error;
L
Linus Torvalds 已提交
644 645 646 647 648 649 650 651 652 653 654 655

	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 已提交
656
	trace_xfs_attr_list_sf(context);
L
Linus Torvalds 已提交
657 658

	/*
659 660 661 662
	 * 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 已提交
663
	 * Note the generous fudge factor of 16 overhead bytes per entry.
664 665
	 * If bufsize is zero then put_listent must be a search function
	 * and can just scan through what we have.
L
Linus Torvalds 已提交
666
	 */
667 668 669
	if (context->bufsize == 0 ||
	    (XFS_ISRESET_CURSOR(cursor) &&
             (dp->i_afp->if_bytes + sf->hdr.count * 16) < context->bufsize)) {
670
		for (i = 0, sfe = &sf->list[0]; i < sf->hdr.count; i++) {
671
			error = context->put_listent(context,
672
					   sfe->flags,
673
					   sfe->nameval,
674 675
					   (int)sfe->namelen,
					   (int)sfe->valuelen,
676
					   &sfe->nameval[sfe->namelen]);
677 678 679 680 681 682 683 684 685 686

			/*
			 * 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 已提交
687 688
			sfe = XFS_ATTR_SF_NEXTENTRY(sfe);
		}
C
Christoph Hellwig 已提交
689
		trace_xfs_attr_list_sf_all(context);
L
Linus Torvalds 已提交
690 691 692
		return(0);
	}

693 694 695 696
	/* do no more for a search callback */
	if (context->bufsize == 0)
		return 0;

L
Linus Torvalds 已提交
697 698 699
	/*
	 * It didn't all fit, so we have to sort everything on hashval.
	 */
700
	sbsize = sf->hdr.count * sizeof(*sbuf);
701
	sbp = sbuf = kmem_alloc(sbsize, KM_SLEEP | KM_NOFS);
L
Linus Torvalds 已提交
702 703 704 705 706 707

	/*
	 * Scan the attribute list for the rest of the entries, storing
	 * the relevant info from only those that match into a buffer.
	 */
	nsbuf = 0;
708
	for (i = 0, sfe = &sf->list[0]; i < sf->hdr.count; i++) {
L
Linus Torvalds 已提交
709 710 711 712 713 714
		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);
715
			kmem_free(sbuf);
L
Linus Torvalds 已提交
716 717
			return XFS_ERROR(EFSCORRUPTED);
		}
718

L
Linus Torvalds 已提交
719
		sbp->entno = i;
720 721
		sbp->hash = xfs_da_hashname(sfe->nameval, sfe->namelen);
		sbp->name = sfe->nameval;
L
Linus Torvalds 已提交
722 723 724 725 726 727 728 729 730 731 732 733
		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.
	 */
734
	xfs_sort(sbuf, nsbuf, sizeof(*sbuf), xfs_attr_shortform_compare);
L
Linus Torvalds 已提交
735 736 737 738 739 740 741 742

	/*
	 * 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++) {
743
		if (sbp->hash == cursor->hashval) {
L
Linus Torvalds 已提交
744 745 746 747
			if (cursor->offset == count) {
				break;
			}
			count++;
748
		} else if (sbp->hash > cursor->hashval) {
L
Linus Torvalds 已提交
749 750 751 752
			break;
		}
	}
	if (i == nsbuf) {
753
		kmem_free(sbuf);
L
Linus Torvalds 已提交
754 755 756 757 758 759 760
		return(0);
	}

	/*
	 * Loop putting entries into the user buffer.
	 */
	for ( ; i < nsbuf; i++, sbp++) {
761 762
		if (cursor->hashval != sbp->hash) {
			cursor->hashval = sbp->hash;
L
Linus Torvalds 已提交
763 764
			cursor->offset = 0;
		}
765
		error = context->put_listent(context,
766
					sbp->flags,
767 768 769 770 771 772 773 774
					sbp->name,
					sbp->namelen,
					sbp->valuelen,
					&sbp->name[sbp->namelen]);
		if (error)
			return error;
		if (context->seen_enough)
			break;
L
Linus Torvalds 已提交
775 776 777
		cursor->offset++;
	}

778
	kmem_free(sbuf);
L
Linus Torvalds 已提交
779 780 781 782 783 784 785 786
	return(0);
}

/*
 * Check a leaf attribute block to see if all the entries would fit into
 * a shortform attribute list.
 */
int
787 788 789
xfs_attr_shortform_allfit(
	struct xfs_buf	*bp,
	struct xfs_inode *dp)
L
Linus Torvalds 已提交
790 791 792 793 794 795
{
	xfs_attr_leafblock_t *leaf;
	xfs_attr_leaf_entry_t *entry;
	xfs_attr_leaf_name_local_t *name_loc;
	int bytes, i;

796
	leaf = bp->b_addr;
797
	ASSERT(leaf->hdr.info.magic == cpu_to_be16(XFS_ATTR_LEAF_MAGIC));
L
Linus Torvalds 已提交
798 799 800

	entry = &leaf->entries[0];
	bytes = sizeof(struct xfs_attr_sf_hdr);
801
	for (i = 0; i < be16_to_cpu(leaf->hdr.count); entry++, i++) {
L
Linus Torvalds 已提交
802 803 804 805
		if (entry->flags & XFS_ATTR_INCOMPLETE)
			continue;		/* don't copy partial entries */
		if (!(entry->flags & XFS_ATTR_LOCAL))
			return(0);
806
		name_loc = xfs_attr_leaf_name_local(leaf, i);
L
Linus Torvalds 已提交
807 808
		if (name_loc->namelen >= XFS_ATTR_SF_ENTSIZE_MAX)
			return(0);
809
		if (be16_to_cpu(name_loc->valuelen) >= XFS_ATTR_SF_ENTSIZE_MAX)
L
Linus Torvalds 已提交
810 811 812
			return(0);
		bytes += sizeof(struct xfs_attr_sf_entry)-1
				+ name_loc->namelen
813
				+ be16_to_cpu(name_loc->valuelen);
L
Linus Torvalds 已提交
814
	}
815
	if ((dp->i_mount->m_flags & XFS_MOUNT_ATTR2) &&
816
	    (dp->i_d.di_format != XFS_DINODE_FMT_BTREE) &&
817
	    (bytes == sizeof(struct xfs_attr_sf_hdr)))
818 819
		return(-1);
	return(xfs_attr_shortform_bytesfit(dp, bytes));
L
Linus Torvalds 已提交
820 821 822 823 824 825
}

/*
 * Convert a leaf attribute list to shortform attribute list
 */
int
826 827 828 829
xfs_attr_leaf_to_shortform(
	struct xfs_buf	*bp,
	xfs_da_args_t	*args,
	int		forkoff)
L
Linus Torvalds 已提交
830 831 832 833 834 835 836 837 838
{
	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;

839 840
	trace_xfs_attr_leaf_to_sf(args);

L
Linus Torvalds 已提交
841 842 843 844 845
	dp = args->dp;
	tmpbuffer = kmem_alloc(XFS_LBSIZE(dp->i_mount), KM_SLEEP);
	ASSERT(tmpbuffer != NULL);

	ASSERT(bp != NULL);
846
	memcpy(tmpbuffer, bp->b_addr, XFS_LBSIZE(dp->i_mount));
L
Linus Torvalds 已提交
847
	leaf = (xfs_attr_leafblock_t *)tmpbuffer;
848
	ASSERT(leaf->hdr.info.magic == cpu_to_be16(XFS_ATTR_LEAF_MAGIC));
849
	memset(bp->b_addr, 0, XFS_LBSIZE(dp->i_mount));
L
Linus Torvalds 已提交
850 851 852 853 854 855 856

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

	if (forkoff == -1) {
859
		ASSERT(dp->i_mount->m_flags & XFS_MOUNT_ATTR2);
860
		ASSERT(dp->i_d.di_format != XFS_DINODE_FMT_BTREE);
861
		xfs_attr_fork_reset(dp, args->trans);
L
Linus Torvalds 已提交
862
		goto out;
863 864 865
	}

	xfs_attr_shortform_create(args);
L
Linus Torvalds 已提交
866 867 868 869 870 871 872 873 874 875 876

	/*
	 * 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;
877
	nargs.op_flags = XFS_DA_OP_OKNOENT;
L
Linus Torvalds 已提交
878
	entry = &leaf->entries[0];
879
	for (i = 0; i < be16_to_cpu(leaf->hdr.count); entry++, i++) {
L
Linus Torvalds 已提交
880 881 882 883 884
		if (entry->flags & XFS_ATTR_INCOMPLETE)
			continue;	/* don't copy partial entries */
		if (!entry->nameidx)
			continue;
		ASSERT(entry->flags & XFS_ATTR_LOCAL);
885
		name_loc = xfs_attr_leaf_name_local(leaf, i);
886
		nargs.name = name_loc->nameval;
L
Linus Torvalds 已提交
887
		nargs.namelen = name_loc->namelen;
888
		nargs.value = &name_loc->nameval[nargs.namelen];
889
		nargs.valuelen = be16_to_cpu(name_loc->valuelen);
890
		nargs.hashval = be32_to_cpu(entry->hashval);
891
		nargs.flags = XFS_ATTR_NSP_ONDISK_TO_ARGS(entry->flags);
892
		xfs_attr_shortform_add(&nargs, forkoff);
L
Linus Torvalds 已提交
893 894 895 896
	}
	error = 0;

out:
897
	kmem_free(tmpbuffer);
L
Linus Torvalds 已提交
898 899 900 901 902 903 904 905 906 907 908 909
	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;
910
	struct xfs_buf *bp1, *bp2;
L
Linus Torvalds 已提交
911 912
	xfs_dablk_t blkno;
	int error;
913
	struct xfs_da_node_entry *btree;
L
Linus Torvalds 已提交
914

915 916
	trace_xfs_attr_leaf_to_node(args);

L
Linus Torvalds 已提交
917 918 919 920 921
	dp = args->dp;
	bp1 = bp2 = NULL;
	error = xfs_da_grow_inode(args, &blkno);
	if (error)
		goto out;
922
	error = xfs_attr_leaf_read(args->trans, args->dp, 0, -1, &bp1);
L
Linus Torvalds 已提交
923 924
	if (error)
		goto out;
925

L
Linus Torvalds 已提交
926 927 928 929 930
	bp2 = NULL;
	error = xfs_da_get_buf(args->trans, args->dp, blkno, -1, &bp2,
					    XFS_ATTR_FORK);
	if (error)
		goto out;
931
	bp2->b_ops = bp1->b_ops;
932
	memcpy(bp2->b_addr, bp1->b_addr, XFS_LBSIZE(dp->i_mount));
L
Linus Torvalds 已提交
933
	bp1 = NULL;
934
	xfs_trans_log_buf(args->trans, bp2, 0, XFS_LBSIZE(dp->i_mount) - 1);
L
Linus Torvalds 已提交
935 936 937 938

	/*
	 * Set up the new root node.
	 */
939
	error = xfs_da3_node_create(args, 0, 1, &bp1, XFS_ATTR_FORK);
L
Linus Torvalds 已提交
940 941
	if (error)
		goto out;
942 943
	node = bp1->b_addr;
	leaf = bp2->b_addr;
944
	ASSERT(leaf->hdr.info.magic == cpu_to_be16(XFS_ATTR_LEAF_MAGIC));
L
Linus Torvalds 已提交
945
	/* both on-disk, don't endian-flip twice */
946 947 948
	btree = xfs_da3_node_tree_p(node);
	btree[0].hashval = leaf->entries[be16_to_cpu(leaf->hdr.count)-1 ].hashval;
	btree[0].before = cpu_to_be32(blkno);
949
	node->hdr.count = cpu_to_be16(1);
950
	xfs_trans_log_buf(args->trans, bp1, 0, XFS_LBSIZE(dp->i_mount) - 1);
L
Linus Torvalds 已提交
951 952 953 954 955 956 957 958 959 960 961 962 963 964
	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.
 */
965
STATIC int
966 967 968 969
xfs_attr_leaf_create(
	xfs_da_args_t	*args,
	xfs_dablk_t	blkno,
	struct xfs_buf	**bpp)
L
Linus Torvalds 已提交
970 971 972 973
{
	xfs_attr_leafblock_t *leaf;
	xfs_attr_leaf_hdr_t *hdr;
	xfs_inode_t *dp;
974
	struct xfs_buf *bp;
L
Linus Torvalds 已提交
975 976
	int error;

977 978
	trace_xfs_attr_leaf_create(args);

L
Linus Torvalds 已提交
979 980 981 982 983 984
	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);
985
	bp->b_ops = &xfs_attr_leaf_buf_ops;
986
	leaf = bp->b_addr;
L
Linus Torvalds 已提交
987 988
	memset((char *)leaf, 0, XFS_LBSIZE(dp->i_mount));
	hdr = &leaf->hdr;
989
	hdr->info.magic = cpu_to_be16(XFS_ATTR_LEAF_MAGIC);
990
	hdr->firstused = cpu_to_be16(XFS_LBSIZE(dp->i_mount));
L
Linus Torvalds 已提交
991
	if (!hdr->firstused) {
992
		hdr->firstused = cpu_to_be16(
L
Linus Torvalds 已提交
993 994 995
			XFS_LBSIZE(dp->i_mount) - XFS_ATTR_LEAF_NAME_ALIGN);
	}

996 997 998
	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 已提交
999

1000
	xfs_trans_log_buf(args->trans, bp, 0, XFS_LBSIZE(dp->i_mount) - 1);
L
Linus Torvalds 已提交
1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015

	*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;

1016 1017
	trace_xfs_attr_leaf_split(state->args);

L
Linus Torvalds 已提交
1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035
	/*
	 * 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);
1036
	error = xfs_da3_blk_link(state, oldblk, newblk);
L
Linus Torvalds 已提交
1037 1038 1039 1040 1041 1042 1043 1044 1045 1046
	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.
	 */
1047 1048
	if (state->inleaf) {
		trace_xfs_attr_leaf_add_old(state->args);
L
Linus Torvalds 已提交
1049
		error = xfs_attr_leaf_add(oldblk->bp, state->args);
1050 1051
	} else {
		trace_xfs_attr_leaf_add_new(state->args);
L
Linus Torvalds 已提交
1052
		error = xfs_attr_leaf_add(newblk->bp, state->args);
1053
	}
L
Linus Torvalds 已提交
1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066

	/*
	 * 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
1067 1068 1069
xfs_attr_leaf_add(
	struct xfs_buf		*bp,
	struct xfs_da_args	*args)
L
Linus Torvalds 已提交
1070 1071 1072 1073 1074 1075
{
	xfs_attr_leafblock_t *leaf;
	xfs_attr_leaf_hdr_t *hdr;
	xfs_attr_leaf_map_t *map;
	int tablesize, entsize, sum, tmp, i;

1076 1077
	trace_xfs_attr_leaf_add(args);

1078
	leaf = bp->b_addr;
1079
	ASSERT(leaf->hdr.info.magic == cpu_to_be16(XFS_ATTR_LEAF_MAGIC));
L
Linus Torvalds 已提交
1080
	ASSERT((args->index >= 0)
1081
		&& (args->index <= be16_to_cpu(leaf->hdr.count)));
L
Linus Torvalds 已提交
1082
	hdr = &leaf->hdr;
1083
	entsize = xfs_attr_leaf_newentsize(args->namelen, args->valuelen,
L
Linus Torvalds 已提交
1084 1085 1086 1087 1088 1089
			   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)
	 */
1090
	tablesize = (be16_to_cpu(hdr->count) + 1)
L
Linus Torvalds 已提交
1091 1092 1093 1094
					* 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--) {
1095 1096
		if (tablesize > be16_to_cpu(hdr->firstused)) {
			sum += be16_to_cpu(map->size);
L
Linus Torvalds 已提交
1097 1098 1099 1100 1101
			continue;
		}
		if (!map->size)
			continue;	/* no space in this map */
		tmp = entsize;
1102
		if (be16_to_cpu(map->base) < be16_to_cpu(hdr->firstused))
L
Linus Torvalds 已提交
1103
			tmp += sizeof(xfs_attr_leaf_entry_t);
1104
		if (be16_to_cpu(map->size) >= tmp) {
L
Linus Torvalds 已提交
1105 1106 1107
			tmp = xfs_attr_leaf_add_work(bp, args, i);
			return(tmp);
		}
1108
		sum += be16_to_cpu(map->size);
L
Linus Torvalds 已提交
1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122
	}

	/*
	 * 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.
	 */
1123
	xfs_attr_leaf_compact(args, bp);
L
Linus Torvalds 已提交
1124 1125 1126 1127 1128

	/*
	 * After compaction, the block is guaranteed to have only one
	 * free region, in freemap[0].  If it is not big enough, give up.
	 */
1129
	if (be16_to_cpu(hdr->freemap[0].size)
L
Linus Torvalds 已提交
1130 1131 1132 1133 1134 1135 1136 1137 1138 1139
				< (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
1140 1141 1142 1143
xfs_attr_leaf_add_work(
	struct xfs_buf	*bp,
	xfs_da_args_t	*args,
	int		mapindex)
L
Linus Torvalds 已提交
1144 1145 1146 1147 1148 1149 1150 1151 1152 1153
{
	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;

1154 1155
	trace_xfs_attr_leaf_add_work(args);

1156
	leaf = bp->b_addr;
1157
	ASSERT(leaf->hdr.info.magic == cpu_to_be16(XFS_ATTR_LEAF_MAGIC));
L
Linus Torvalds 已提交
1158 1159
	hdr = &leaf->hdr;
	ASSERT((mapindex >= 0) && (mapindex < XFS_ATTR_LEAF_MAPSIZE));
1160
	ASSERT((args->index >= 0) && (args->index <= be16_to_cpu(hdr->count)));
L
Linus Torvalds 已提交
1161 1162 1163 1164 1165

	/*
	 * Force open some space in the entry array and fill it in.
	 */
	entry = &leaf->entries[args->index];
1166 1167
	if (args->index < be16_to_cpu(hdr->count)) {
		tmp  = be16_to_cpu(hdr->count) - args->index;
L
Linus Torvalds 已提交
1168 1169
		tmp *= sizeof(xfs_attr_leaf_entry_t);
		memmove((char *)(entry+1), (char *)entry, tmp);
1170
		xfs_trans_log_buf(args->trans, bp,
L
Linus Torvalds 已提交
1171 1172
		    XFS_DA_LOGRANGE(leaf, entry, tmp + sizeof(*entry)));
	}
1173
	be16_add_cpu(&hdr->count, 1);
L
Linus Torvalds 已提交
1174 1175 1176 1177 1178 1179

	/*
	 * Allocate space for the new string (at the end of the run).
	 */
	map = &hdr->freemap[mapindex];
	mp = args->trans->t_mountp;
1180 1181 1182
	ASSERT(be16_to_cpu(map->base) < XFS_LBSIZE(mp));
	ASSERT((be16_to_cpu(map->base) & 0x3) == 0);
	ASSERT(be16_to_cpu(map->size) >=
1183 1184
		xfs_attr_leaf_newentsize(args->namelen, args->valuelen,
					 mp->m_sb.sb_blocksize, NULL));
1185 1186
	ASSERT(be16_to_cpu(map->size) < XFS_LBSIZE(mp));
	ASSERT((be16_to_cpu(map->size) & 0x3) == 0);
1187
	be16_add_cpu(&map->size,
1188 1189
		-xfs_attr_leaf_newentsize(args->namelen, args->valuelen,
					  mp->m_sb.sb_blocksize, &tmp));
1190 1191 1192
	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 已提交
1193
	entry->flags = tmp ? XFS_ATTR_LOCAL : 0;
1194
	entry->flags |= XFS_ATTR_NSP_ARGS_TO_ONDISK(args->flags);
1195
	if (args->op_flags & XFS_DA_OP_RENAME) {
L
Linus Torvalds 已提交
1196 1197 1198 1199 1200 1201
		entry->flags |= XFS_ATTR_INCOMPLETE;
		if ((args->blkno2 == args->blkno) &&
		    (args->index2 <= args->index)) {
			args->index2++;
		}
	}
1202
	xfs_trans_log_buf(args->trans, bp,
L
Linus Torvalds 已提交
1203
			  XFS_DA_LOGRANGE(leaf, entry, sizeof(*entry)));
1204 1205
	ASSERT((args->index == 0) ||
	       (be32_to_cpu(entry->hashval) >= be32_to_cpu((entry-1)->hashval)));
1206
	ASSERT((args->index == be16_to_cpu(hdr->count)-1) ||
1207
	       (be32_to_cpu(entry->hashval) <= be32_to_cpu((entry+1)->hashval)));
L
Linus Torvalds 已提交
1208 1209 1210 1211 1212 1213 1214 1215 1216

	/*
	 * 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) {
1217
		name_loc = xfs_attr_leaf_name_local(leaf, args->index);
L
Linus Torvalds 已提交
1218
		name_loc->namelen = args->namelen;
1219
		name_loc->valuelen = cpu_to_be16(args->valuelen);
L
Linus Torvalds 已提交
1220 1221
		memcpy((char *)name_loc->nameval, args->name, args->namelen);
		memcpy((char *)&name_loc->nameval[args->namelen], args->value,
1222
				   be16_to_cpu(name_loc->valuelen));
L
Linus Torvalds 已提交
1223
	} else {
1224
		name_rmt = xfs_attr_leaf_name_remote(leaf, args->index);
L
Linus Torvalds 已提交
1225 1226 1227 1228 1229 1230 1231 1232 1233
		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);
	}
1234
	xfs_trans_log_buf(args->trans, bp,
1235
	     XFS_DA_LOGRANGE(leaf, xfs_attr_leaf_name(leaf, args->index),
L
Linus Torvalds 已提交
1236 1237 1238 1239 1240
				   xfs_attr_leaf_entsize(leaf, args->index)));

	/*
	 * Update the control info for this leaf node
	 */
1241
	if (be16_to_cpu(entry->nameidx) < be16_to_cpu(hdr->firstused)) {
L
Linus Torvalds 已提交
1242 1243 1244
		/* both on-disk, don't endian-flip twice */
		hdr->firstused = entry->nameidx;
	}
1245 1246 1247
	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 已提交
1248 1249 1250
					+ sizeof(xfs_attr_leaf_hdr_t);
	map = &hdr->freemap[0];
	for (i = 0; i < XFS_ATTR_LEAF_MAPSIZE; map++, i++) {
1251
		if (be16_to_cpu(map->base) == tmp) {
1252 1253
			be16_add_cpu(&map->base, sizeof(xfs_attr_leaf_entry_t));
			be16_add_cpu(&map->size,
1254
				 -((int)sizeof(xfs_attr_leaf_entry_t)));
L
Linus Torvalds 已提交
1255 1256
		}
	}
1257
	be16_add_cpu(&hdr->usedbytes, xfs_attr_leaf_entsize(leaf, args->index));
1258
	xfs_trans_log_buf(args->trans, bp,
L
Linus Torvalds 已提交
1259 1260 1261 1262 1263 1264 1265 1266
		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
1267
xfs_attr_leaf_compact(
1268 1269
	struct xfs_da_args	*args,
	struct xfs_buf		*bp)
L
Linus Torvalds 已提交
1270
{
1271 1272 1273 1274 1275 1276 1277
	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 已提交
1278 1279 1280

	tmpbuffer = kmem_alloc(XFS_LBSIZE(mp), KM_SLEEP);
	ASSERT(tmpbuffer != NULL);
1281 1282
	memcpy(tmpbuffer, bp->b_addr, XFS_LBSIZE(mp));
	memset(bp->b_addr, 0, XFS_LBSIZE(mp));
L
Linus Torvalds 已提交
1283 1284 1285 1286 1287

	/*
	 * Copy basic information
	 */
	leaf_s = (xfs_attr_leafblock_t *)tmpbuffer;
1288
	leaf_d = bp->b_addr;
L
Linus Torvalds 已提交
1289 1290 1291
	hdr_s = &leaf_s->hdr;
	hdr_d = &leaf_d->hdr;
	hdr_d->info = hdr_s->info;	/* struct copy */
1292
	hdr_d->firstused = cpu_to_be16(XFS_LBSIZE(mp));
L
Linus Torvalds 已提交
1293 1294
	/* handle truncation gracefully */
	if (!hdr_d->firstused) {
1295
		hdr_d->firstused = cpu_to_be16(
L
Linus Torvalds 已提交
1296 1297 1298 1299 1300
				XFS_LBSIZE(mp) - XFS_ATTR_LEAF_NAME_ALIGN);
	}
	hdr_d->usedbytes = 0;
	hdr_d->count = 0;
	hdr_d->holes = 0;
1301 1302 1303
	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 已提交
1304 1305 1306 1307 1308 1309

	/*
	 * 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,
1310
				be16_to_cpu(hdr_s->count), mp);
1311
	xfs_trans_log_buf(trans, bp, 0, XFS_LBSIZE(mp) - 1);
L
Linus Torvalds 已提交
1312

1313
	kmem_free(tmpbuffer);
L
Linus Torvalds 已提交
1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342
}

/*
 * 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);
1343 1344
	leaf1 = blk1->bp->b_addr;
	leaf2 = blk2->bp->b_addr;
1345 1346
	ASSERT(leaf1->hdr.info.magic == cpu_to_be16(XFS_ATTR_LEAF_MAGIC));
	ASSERT(leaf2->hdr.info.magic == cpu_to_be16(XFS_ATTR_LEAF_MAGIC));
1347
	ASSERT(leaf2->hdr.count == 0);
L
Linus Torvalds 已提交
1348 1349
	args = state->args;

1350 1351
	trace_xfs_attr_leaf_rebalance(args);

L
Linus Torvalds 已提交
1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362
	/*
	 * 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;
1363 1364
		leaf1 = blk1->bp->b_addr;
		leaf2 = blk2->bp->b_addr;
L
Linus Torvalds 已提交
1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385
		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:
	 */
1386
	if (count < be16_to_cpu(hdr1->count)) {
L
Linus Torvalds 已提交
1387 1388 1389 1390
		/*
		 * Figure the total bytes to be added to the destination leaf.
		 */
		/* number entries being moved */
1391 1392
		count = be16_to_cpu(hdr1->count) - count;
		space  = be16_to_cpu(hdr1->usedbytes) - totallen;
L
Linus Torvalds 已提交
1393 1394 1395 1396 1397
		space += count * sizeof(xfs_attr_leaf_entry_t);

		/*
		 * leaf2 is the destination, compact it if it looks tight.
		 */
1398
		max  = be16_to_cpu(hdr2->firstused)
L
Linus Torvalds 已提交
1399
						- sizeof(xfs_attr_leaf_hdr_t);
1400
		max -= be16_to_cpu(hdr2->count) * sizeof(xfs_attr_leaf_entry_t);
1401 1402
		if (space > max)
			xfs_attr_leaf_compact(args, blk2->bp);
L
Linus Torvalds 已提交
1403 1404 1405 1406

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

1410 1411
		xfs_trans_log_buf(args->trans, blk1->bp, 0, state->blocksize-1);
		xfs_trans_log_buf(args->trans, blk2->bp, 0, state->blocksize-1);
1412
	} else if (count > be16_to_cpu(hdr1->count)) {
L
Linus Torvalds 已提交
1413 1414 1415 1416
		/*
		 * I assert that since all callers pass in an empty
		 * second buffer, this code should never execute.
		 */
1417
		ASSERT(0);
L
Linus Torvalds 已提交
1418 1419 1420 1421 1422

		/*
		 * Figure the total bytes to be added to the destination leaf.
		 */
		/* number entries being moved */
1423 1424
		count -= be16_to_cpu(hdr1->count);
		space  = totallen - be16_to_cpu(hdr1->usedbytes);
L
Linus Torvalds 已提交
1425 1426 1427 1428 1429
		space += count * sizeof(xfs_attr_leaf_entry_t);

		/*
		 * leaf1 is the destination, compact it if it looks tight.
		 */
1430
		max  = be16_to_cpu(hdr1->firstused)
L
Linus Torvalds 已提交
1431
						- sizeof(xfs_attr_leaf_hdr_t);
1432
		max -= be16_to_cpu(hdr1->count) * sizeof(xfs_attr_leaf_entry_t);
1433 1434
		if (space > max)
			xfs_attr_leaf_compact(args, blk1->bp);
L
Linus Torvalds 已提交
1435 1436 1437 1438 1439

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

1442 1443
		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 已提交
1444 1445 1446 1447 1448
	}

	/*
	 * Copy out last hashval in each block for B-tree code.
	 */
1449 1450 1451 1452
	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 已提交
1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465

	/*
	 * 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.
	 */
1466
	if (blk1->index > be16_to_cpu(leaf1->hdr.count)) {
L
Linus Torvalds 已提交
1467
		ASSERT(state->inleaf == 0);
1468
		blk2->index = blk1->index - be16_to_cpu(leaf1->hdr.count);
L
Linus Torvalds 已提交
1469 1470
		args->index = args->index2 = blk2->index;
		args->blkno = args->blkno2 = blk2->blkno;
1471
	} else if (blk1->index == be16_to_cpu(leaf1->hdr.count)) {
L
Linus Torvalds 已提交
1472 1473 1474 1475 1476 1477
		if (state->inleaf) {
			args->index = blk1->index;
			args->blkno = blk1->blkno;
			args->index2 = 0;
			args->blkno2 = blk2->blkno;
		} else {
1478 1479 1480 1481 1482
			/*
			 * 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 已提交
1483
			blk2->index = blk1->index
1484
				    - be16_to_cpu(leaf1->hdr.count);
1485 1486 1487 1488 1489 1490 1491 1492 1493 1494 1495
			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 已提交
1496 1497 1498 1499 1500 1501 1502 1503 1504 1505 1506 1507 1508 1509 1510 1511 1512 1513 1514 1515 1516 1517 1518 1519 1520 1521 1522 1523 1524 1525
		}
	} 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.
	 */
1526 1527
	leaf1 = blk1->bp->b_addr;
	leaf2 = blk2->bp->b_addr;
L
Linus Torvalds 已提交
1528 1529 1530 1531 1532 1533 1534 1535 1536
	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.
	 */
1537
	max = be16_to_cpu(hdr1->count) + be16_to_cpu(hdr2->count);
L
Linus Torvalds 已提交
1538
	half  = (max+1) * sizeof(*entry);
1539 1540 1541 1542 1543 1544
	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 已提交
1545 1546 1547 1548 1549 1550 1551 1552 1553 1554 1555
	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) +
1556 1557 1558 1559
				xfs_attr_leaf_newentsize(
						state->args->namelen,
						state->args->valuelen,
						state->blocksize, NULL);
L
Linus Torvalds 已提交
1560 1561 1562 1563 1564 1565 1566 1567 1568 1569
			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.
		 */
1570
		if (count == be16_to_cpu(hdr1->count)) {
L
Linus Torvalds 已提交
1571 1572 1573 1574 1575 1576 1577 1578 1579 1580 1581 1582 1583 1584 1585 1586 1587 1588 1589 1590 1591 1592 1593 1594
			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) +
1595 1596 1597 1598
				xfs_attr_leaf_newentsize(
						state->args->namelen,
						state->args->valuelen,
						state->blocksize, NULL);
L
Linus Torvalds 已提交
1599 1600 1601 1602 1603 1604 1605 1606 1607 1608 1609 1610 1611 1612 1613 1614 1615 1616 1617 1618 1619 1620 1621 1622 1623 1624 1625 1626 1627 1628
	}

	*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;
1629
	struct xfs_buf *bp;
L
Linus Torvalds 已提交
1630

1631 1632
	trace_xfs_attr_leaf_toosmall(state->args);

L
Linus Torvalds 已提交
1633 1634 1635 1636 1637 1638
	/*
	 * 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 ];
1639
	info = blk->bp->b_addr;
1640
	ASSERT(info->magic == cpu_to_be16(XFS_ATTR_LEAF_MAGIC));
L
Linus Torvalds 已提交
1641
	leaf = (xfs_attr_leafblock_t *)info;
1642
	count = be16_to_cpu(leaf->hdr.count);
L
Linus Torvalds 已提交
1643 1644
	bytes = sizeof(xfs_attr_leaf_hdr_t) +
		count * sizeof(xfs_attr_leaf_entry_t) +
1645
		be16_to_cpu(leaf->hdr.usedbytes);
L
Linus Torvalds 已提交
1646 1647 1648 1649 1650 1651 1652 1653
	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
1654
	 * coalesce it with a sibling block.  We choose (arbitrarily)
L
Linus Torvalds 已提交
1655 1656 1657 1658 1659 1660 1661
	 * 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).
		 */
1662
		forward = (info->forw != 0);
L
Linus Torvalds 已提交
1663
		memcpy(&state->altpath, &state->path, sizeof(state->path));
1664
		error = xfs_da3_path_shift(state, &state->altpath, forward,
L
Linus Torvalds 已提交
1665 1666 1667 1668 1669 1670 1671 1672 1673 1674 1675 1676 1677 1678 1679 1680 1681 1682 1683
						 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 */
1684
	forward = (be32_to_cpu(info->forw) < be32_to_cpu(info->back));
L
Linus Torvalds 已提交
1685 1686
	for (i = 0; i < 2; forward = !forward, i++) {
		if (forward)
1687
			blkno = be32_to_cpu(info->forw);
L
Linus Torvalds 已提交
1688
		else
1689
			blkno = be32_to_cpu(info->back);
L
Linus Torvalds 已提交
1690 1691
		if (blkno == 0)
			continue;
1692 1693
		error = xfs_attr_leaf_read(state->args->trans, state->args->dp,
					blkno, -1, &bp);
L
Linus Torvalds 已提交
1694 1695 1696 1697
		if (error)
			return(error);

		leaf = (xfs_attr_leafblock_t *)info;
1698
		count  = be16_to_cpu(leaf->hdr.count);
L
Linus Torvalds 已提交
1699
		bytes  = state->blocksize - (state->blocksize>>2);
1700
		bytes -= be16_to_cpu(leaf->hdr.usedbytes);
1701
		leaf = bp->b_addr;
1702 1703
		count += be16_to_cpu(leaf->hdr.count);
		bytes -= be16_to_cpu(leaf->hdr.usedbytes);
L
Linus Torvalds 已提交
1704 1705
		bytes -= count * sizeof(xfs_attr_leaf_entry_t);
		bytes -= sizeof(xfs_attr_leaf_hdr_t);
1706
		xfs_trans_brelse(state->args->trans, bp);
L
Linus Torvalds 已提交
1707 1708 1709 1710 1711 1712 1713 1714 1715 1716 1717 1718 1719 1720
		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) {
1721
		error = xfs_da3_path_shift(state, &state->altpath, forward,
L
Linus Torvalds 已提交
1722 1723
						 0, &retval);
	} else {
1724
		error = xfs_da3_path_shift(state, &state->path, forward,
L
Linus Torvalds 已提交
1725 1726 1727 1728 1729 1730 1731 1732 1733 1734 1735 1736 1737 1738 1739 1740 1741 1742 1743
						 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
1744 1745 1746
xfs_attr_leaf_remove(
	struct xfs_buf	*bp,
	xfs_da_args_t	*args)
L
Linus Torvalds 已提交
1747 1748 1749 1750 1751 1752 1753 1754 1755
{
	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;

1756 1757
	trace_xfs_attr_leaf_remove(args);

1758
	leaf = bp->b_addr;
1759
	ASSERT(leaf->hdr.info.magic == cpu_to_be16(XFS_ATTR_LEAF_MAGIC));
L
Linus Torvalds 已提交
1760 1761
	hdr = &leaf->hdr;
	mp = args->trans->t_mountp;
1762 1763
	ASSERT((be16_to_cpu(hdr->count) > 0)
		&& (be16_to_cpu(hdr->count) < (XFS_LBSIZE(mp)/8)));
L
Linus Torvalds 已提交
1764
	ASSERT((args->index >= 0)
1765 1766 1767
		&& (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 已提交
1768
	entry = &leaf->entries[args->index];
1769 1770
	ASSERT(be16_to_cpu(entry->nameidx) >= be16_to_cpu(hdr->firstused));
	ASSERT(be16_to_cpu(entry->nameidx) < XFS_LBSIZE(mp));
L
Linus Torvalds 已提交
1771 1772 1773 1774 1775 1776 1777

	/*
	 * 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,
	 */
1778
	tablesize = be16_to_cpu(hdr->count) * sizeof(xfs_attr_leaf_entry_t)
L
Linus Torvalds 已提交
1779 1780
					+ sizeof(xfs_attr_leaf_hdr_t);
	map = &hdr->freemap[0];
1781
	tmp = be16_to_cpu(map->size);
L
Linus Torvalds 已提交
1782 1783 1784 1785
	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++) {
1786 1787 1788
		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) {
1789
			be16_add_cpu(&map->base,
1790
				 -((int)sizeof(xfs_attr_leaf_entry_t)));
1791
			be16_add_cpu(&map->size, sizeof(xfs_attr_leaf_entry_t));
L
Linus Torvalds 已提交
1792 1793
		}

1794
		if ((be16_to_cpu(map->base) + be16_to_cpu(map->size))
1795
				== be16_to_cpu(entry->nameidx)) {
L
Linus Torvalds 已提交
1796
			before = i;
1797
		} else if (be16_to_cpu(map->base)
1798
			== (be16_to_cpu(entry->nameidx) + entsize)) {
L
Linus Torvalds 已提交
1799
			after = i;
1800 1801
		} else if (be16_to_cpu(map->size) < tmp) {
			tmp = be16_to_cpu(map->size);
L
Linus Torvalds 已提交
1802 1803 1804 1805 1806 1807 1808 1809 1810 1811 1812
			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];
1813 1814
			be16_add_cpu(&map->size, entsize);
			be16_add_cpu(&map->size,
1815
				 be16_to_cpu(hdr->freemap[after].size));
L
Linus Torvalds 已提交
1816 1817 1818 1819
			hdr->freemap[after].base = 0;
			hdr->freemap[after].size = 0;
		} else if (before >= 0) {
			map = &hdr->freemap[before];
1820
			be16_add_cpu(&map->size, entsize);
L
Linus Torvalds 已提交
1821 1822 1823 1824
		} else {
			map = &hdr->freemap[after];
			/* both on-disk, don't endian flip twice */
			map->base = entry->nameidx;
1825
			be16_add_cpu(&map->size, entsize);
L
Linus Torvalds 已提交
1826 1827 1828 1829 1830 1831
		}
	} else {
		/*
		 * Replace smallest region (if it is smaller than free'd entry)
		 */
		map = &hdr->freemap[smallest];
1832
		if (be16_to_cpu(map->size) < entsize) {
1833
			map->base = cpu_to_be16(be16_to_cpu(entry->nameidx));
1834
			map->size = cpu_to_be16(entsize);
L
Linus Torvalds 已提交
1835 1836 1837 1838 1839 1840
		}
	}

	/*
	 * Did we remove the first entry?
	 */
1841
	if (be16_to_cpu(entry->nameidx) == be16_to_cpu(hdr->firstused))
L
Linus Torvalds 已提交
1842 1843 1844 1845 1846 1847 1848
		smallest = 1;
	else
		smallest = 0;

	/*
	 * Compress the remaining entries and zero out the removed stuff.
	 */
1849
	memset(xfs_attr_leaf_name(leaf, args->index), 0, entsize);
1850
	be16_add_cpu(&hdr->usedbytes, -entsize);
1851
	xfs_trans_log_buf(args->trans, bp,
1852
	     XFS_DA_LOGRANGE(leaf, xfs_attr_leaf_name(leaf, args->index),
L
Linus Torvalds 已提交
1853 1854
				   entsize));

1855
	tmp = (be16_to_cpu(hdr->count) - args->index)
L
Linus Torvalds 已提交
1856 1857
					* sizeof(xfs_attr_leaf_entry_t);
	memmove((char *)entry, (char *)(entry+1), tmp);
1858
	be16_add_cpu(&hdr->count, -1);
1859
	xfs_trans_log_buf(args->trans, bp,
L
Linus Torvalds 已提交
1860
	    XFS_DA_LOGRANGE(leaf, entry, tmp + sizeof(*entry)));
1861
	entry = &leaf->entries[be16_to_cpu(hdr->count)];
L
Linus Torvalds 已提交
1862 1863 1864 1865 1866 1867 1868 1869 1870 1871 1872
	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];
1873
		for (i = be16_to_cpu(hdr->count)-1; i >= 0; entry++, i--) {
1874 1875 1876 1877 1878 1879
			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 已提交
1880
		}
1881
		hdr->firstused = cpu_to_be16(tmp);
L
Linus Torvalds 已提交
1882
		if (!hdr->firstused) {
1883
			hdr->firstused = cpu_to_be16(
L
Linus Torvalds 已提交
1884 1885 1886 1887 1888
					tmp - XFS_ATTR_LEAF_NAME_ALIGN);
		}
	} else {
		hdr->holes = 1;		/* mark as needing compaction */
	}
1889
	xfs_trans_log_buf(args->trans, bp,
L
Linus Torvalds 已提交
1890 1891 1892 1893 1894 1895 1896
			  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);
1897 1898
	tmp += be16_to_cpu(leaf->hdr.count) * sizeof(xfs_attr_leaf_entry_t);
	tmp += be16_to_cpu(leaf->hdr.usedbytes);
L
Linus Torvalds 已提交
1899 1900 1901 1902 1903 1904 1905 1906 1907 1908 1909 1910 1911 1912 1913
	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;

1914 1915
	trace_xfs_attr_leaf_unbalance(state->args);

L
Linus Torvalds 已提交
1916 1917 1918 1919 1920 1921
	/*
	 * Set up environment.
	 */
	mp = state->mp;
	ASSERT(drop_blk->magic == XFS_ATTR_LEAF_MAGIC);
	ASSERT(save_blk->magic == XFS_ATTR_LEAF_MAGIC);
1922 1923
	drop_leaf = drop_blk->bp->b_addr;
	save_leaf = save_blk->bp->b_addr;
1924 1925
	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 已提交
1926 1927 1928 1929 1930 1931
	drop_hdr = &drop_leaf->hdr;
	save_hdr = &save_leaf->hdr;

	/*
	 * Save last hashval from dying block for later Btree fixup.
	 */
1932 1933
	drop_blk->hashval = be32_to_cpu(
		drop_leaf->entries[be16_to_cpu(drop_leaf->hdr.count)-1].hashval);
L
Linus Torvalds 已提交
1934 1935 1936 1937 1938 1939 1940 1941 1942 1943 1944 1945 1946

	/*
	 * 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,
1947
			     be16_to_cpu(drop_hdr->count), mp);
L
Linus Torvalds 已提交
1948 1949
		} else {
			xfs_attr_leaf_moveents(drop_leaf, 0, save_leaf,
1950 1951
				  be16_to_cpu(save_hdr->count),
				  be16_to_cpu(drop_hdr->count), mp);
L
Linus Torvalds 已提交
1952 1953 1954 1955 1956 1957 1958 1959 1960 1961 1962 1963 1964
		}
	} 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;
1965
		tmp_hdr->firstused = cpu_to_be16(state->blocksize);
L
Linus Torvalds 已提交
1966
		if (!tmp_hdr->firstused) {
1967
			tmp_hdr->firstused = cpu_to_be16(
L
Linus Torvalds 已提交
1968 1969 1970 1971 1972
				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,
1973
				be16_to_cpu(drop_hdr->count), mp);
L
Linus Torvalds 已提交
1974
			xfs_attr_leaf_moveents(save_leaf, 0, tmp_leaf,
1975 1976
				  be16_to_cpu(tmp_leaf->hdr.count),
				  be16_to_cpu(save_hdr->count), mp);
L
Linus Torvalds 已提交
1977 1978
		} else {
			xfs_attr_leaf_moveents(save_leaf, 0, tmp_leaf, 0,
1979
				be16_to_cpu(save_hdr->count), mp);
L
Linus Torvalds 已提交
1980
			xfs_attr_leaf_moveents(drop_leaf, 0, tmp_leaf,
1981 1982
				be16_to_cpu(tmp_leaf->hdr.count),
				be16_to_cpu(drop_hdr->count), mp);
L
Linus Torvalds 已提交
1983 1984
		}
		memcpy((char *)save_leaf, (char *)tmp_leaf, state->blocksize);
1985
		kmem_free(tmpbuffer);
L
Linus Torvalds 已提交
1986 1987
	}

1988
	xfs_trans_log_buf(state->args->trans, save_blk->bp, 0,
L
Linus Torvalds 已提交
1989 1990 1991 1992 1993
					   state->blocksize - 1);

	/*
	 * Copy out last hashval in each block for B-tree code.
	 */
1994 1995
	save_blk->hashval = be32_to_cpu(
		save_leaf->entries[be16_to_cpu(save_leaf->hdr.count)-1].hashval);
L
Linus Torvalds 已提交
1996 1997 1998 1999 2000 2001 2002 2003 2004 2005 2006 2007 2008 2009 2010 2011 2012 2013 2014 2015
}

/*========================================================================
 * 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
2016 2017 2018
xfs_attr_leaf_lookup_int(
	struct xfs_buf	*bp,
	xfs_da_args_t	*args)
L
Linus Torvalds 已提交
2019 2020 2021 2022 2023 2024 2025 2026
{
	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;

2027 2028
	trace_xfs_attr_leaf_lookup(args);

2029
	leaf = bp->b_addr;
2030
	ASSERT(leaf->hdr.info.magic == cpu_to_be16(XFS_ATTR_LEAF_MAGIC));
2031
	ASSERT(be16_to_cpu(leaf->hdr.count)
L
Linus Torvalds 已提交
2032 2033 2034 2035 2036 2037
					< (XFS_LBSIZE(args->dp->i_mount)/8));

	/*
	 * Binary search.  (note: small blocks will skip this loop)
	 */
	hashval = args->hashval;
2038
	probe = span = be16_to_cpu(leaf->hdr.count) / 2;
L
Linus Torvalds 已提交
2039 2040 2041
	for (entry = &leaf->entries[probe]; span > 4;
		   entry = &leaf->entries[probe]) {
		span /= 2;
2042
		if (be32_to_cpu(entry->hashval) < hashval)
L
Linus Torvalds 已提交
2043
			probe += span;
2044
		else if (be32_to_cpu(entry->hashval) > hashval)
L
Linus Torvalds 已提交
2045 2046 2047 2048
			probe -= span;
		else
			break;
	}
2049
	ASSERT((probe >= 0) &&
L
Linus Torvalds 已提交
2050
	       (!leaf->hdr.count
2051
	       || (probe < be16_to_cpu(leaf->hdr.count))));
2052
	ASSERT((span <= 4) || (be32_to_cpu(entry->hashval) == hashval));
L
Linus Torvalds 已提交
2053 2054 2055 2056 2057

	/*
	 * Since we may have duplicate hashval's, find the first matching
	 * hashval in the leaf.
	 */
2058
	while ((probe > 0) && (be32_to_cpu(entry->hashval) >= hashval)) {
L
Linus Torvalds 已提交
2059 2060 2061
		entry--;
		probe--;
	}
2062 2063
	while ((probe < be16_to_cpu(leaf->hdr.count)) &&
	       (be32_to_cpu(entry->hashval) < hashval)) {
L
Linus Torvalds 已提交
2064 2065 2066
		entry++;
		probe++;
	}
2067 2068
	if ((probe == be16_to_cpu(leaf->hdr.count)) ||
	    (be32_to_cpu(entry->hashval) != hashval)) {
L
Linus Torvalds 已提交
2069 2070 2071 2072 2073 2074 2075
		args->index = probe;
		return(XFS_ERROR(ENOATTR));
	}

	/*
	 * Duplicate keys may be present, so search all of them for a match.
	 */
2076 2077
	for (  ; (probe < be16_to_cpu(leaf->hdr.count)) &&
			(be32_to_cpu(entry->hashval) == hashval);
L
Linus Torvalds 已提交
2078 2079 2080 2081 2082 2083 2084 2085 2086 2087 2088 2089 2090
			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) {
2091
			name_loc = xfs_attr_leaf_name_local(leaf, probe);
L
Linus Torvalds 已提交
2092 2093
			if (name_loc->namelen != args->namelen)
				continue;
2094
			if (memcmp(args->name, (char *)name_loc->nameval, args->namelen) != 0)
L
Linus Torvalds 已提交
2095
				continue;
2096
			if (!xfs_attr_namesp_match(args->flags, entry->flags))
L
Linus Torvalds 已提交
2097 2098 2099 2100
				continue;
			args->index = probe;
			return(XFS_ERROR(EEXIST));
		} else {
2101
			name_rmt = xfs_attr_leaf_name_remote(leaf, probe);
L
Linus Torvalds 已提交
2102 2103 2104 2105 2106
			if (name_rmt->namelen != args->namelen)
				continue;
			if (memcmp(args->name, (char *)name_rmt->name,
					     args->namelen) != 0)
				continue;
2107
			if (!xfs_attr_namesp_match(args->flags, entry->flags))
L
Linus Torvalds 已提交
2108 2109
				continue;
			args->index = probe;
2110
			args->rmtblkno = be32_to_cpu(name_rmt->valueblk);
L
Linus Torvalds 已提交
2111
			args->rmtblkcnt = XFS_B_TO_FSB(args->dp->i_mount,
2112
						   be32_to_cpu(name_rmt->valuelen));
L
Linus Torvalds 已提交
2113 2114 2115 2116 2117 2118 2119 2120 2121 2122 2123 2124
			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
2125 2126 2127
xfs_attr_leaf_getvalue(
	struct xfs_buf	*bp,
	xfs_da_args_t	*args)
L
Linus Torvalds 已提交
2128 2129 2130 2131 2132 2133 2134
{
	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;

2135
	leaf = bp->b_addr;
2136
	ASSERT(leaf->hdr.info.magic == cpu_to_be16(XFS_ATTR_LEAF_MAGIC));
2137
	ASSERT(be16_to_cpu(leaf->hdr.count)
L
Linus Torvalds 已提交
2138
					< (XFS_LBSIZE(args->dp->i_mount)/8));
2139
	ASSERT(args->index < be16_to_cpu(leaf->hdr.count));
L
Linus Torvalds 已提交
2140 2141 2142

	entry = &leaf->entries[args->index];
	if (entry->flags & XFS_ATTR_LOCAL) {
2143
		name_loc = xfs_attr_leaf_name_local(leaf, args->index);
L
Linus Torvalds 已提交
2144 2145
		ASSERT(name_loc->namelen == args->namelen);
		ASSERT(memcmp(args->name, name_loc->nameval, args->namelen) == 0);
2146
		valuelen = be16_to_cpu(name_loc->valuelen);
L
Linus Torvalds 已提交
2147 2148 2149 2150 2151 2152 2153 2154 2155 2156 2157
		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 {
2158
		name_rmt = xfs_attr_leaf_name_remote(leaf, args->index);
L
Linus Torvalds 已提交
2159 2160
		ASSERT(name_rmt->namelen == args->namelen);
		ASSERT(memcmp(args->name, name_rmt->name, args->namelen) == 0);
2161 2162
		valuelen = be32_to_cpu(name_rmt->valuelen);
		args->rmtblkno = be32_to_cpu(name_rmt->valueblk);
L
Linus Torvalds 已提交
2163 2164 2165 2166 2167 2168 2169 2170 2171 2172 2173 2174 2175 2176 2177 2178 2179 2180 2181 2182 2183 2184 2185 2186 2187 2188 2189 2190 2191 2192 2193 2194 2195 2196 2197 2198 2199 2200 2201 2202 2203
		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.
	 */
2204 2205
	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 已提交
2206 2207
	hdr_s = &leaf_s->hdr;
	hdr_d = &leaf_d->hdr;
2208 2209 2210 2211
	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 已提交
2212
					* sizeof(*entry_s))+sizeof(*hdr_s)));
2213 2214 2215
	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 已提交
2216 2217
					* sizeof(*entry_d))+sizeof(*hdr_d)));

2218 2219 2220
	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 已提交
2221 2222 2223 2224

	/*
	 * Move the entries in the destination leaf up to make a hole?
	 */
2225 2226
	if (start_d < be16_to_cpu(hdr_d->count)) {
		tmp  = be16_to_cpu(hdr_d->count) - start_d;
L
Linus Torvalds 已提交
2227 2228 2229 2230 2231 2232 2233 2234 2235 2236 2237 2238 2239 2240
		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++) {
2241
		ASSERT(be16_to_cpu(entry_s->nameidx)
2242
				>= be16_to_cpu(hdr_s->firstused));
L
Linus Torvalds 已提交
2243 2244 2245 2246 2247 2248 2249 2250
		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? */
2251
			memset(xfs_attr_leaf_name(leaf_s, start_s + i), 0, tmp);
2252 2253
			be16_add_cpu(&hdr_s->usedbytes, -tmp);
			be16_add_cpu(&hdr_s->count, -1);
L
Linus Torvalds 已提交
2254 2255 2256 2257 2258 2259
			entry_d--;	/* to compensate for ++ in loop hdr */
			desti--;
			if ((start_s + i) < offset)
				result++;	/* insertion index adjustment */
		} else {
#endif /* GROT */
2260
			be16_add_cpu(&hdr_d->firstused, -tmp);
L
Linus Torvalds 已提交
2261 2262 2263 2264 2265
			/* 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;
2266
			ASSERT(be16_to_cpu(entry_d->nameidx) + tmp
L
Linus Torvalds 已提交
2267
							<= XFS_LBSIZE(mp));
2268 2269
			memmove(xfs_attr_leaf_name(leaf_d, desti),
				xfs_attr_leaf_name(leaf_s, start_s + i), tmp);
2270
			ASSERT(be16_to_cpu(entry_s->nameidx) + tmp
L
Linus Torvalds 已提交
2271
							<= XFS_LBSIZE(mp));
2272
			memset(xfs_attr_leaf_name(leaf_s, start_s + i), 0, tmp);
2273 2274 2275 2276
			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);
2277
			tmp = be16_to_cpu(hdr_d->count)
L
Linus Torvalds 已提交
2278 2279
						* sizeof(xfs_attr_leaf_entry_t)
						+ sizeof(xfs_attr_leaf_hdr_t);
2280
			ASSERT(be16_to_cpu(hdr_d->firstused) >= tmp);
L
Linus Torvalds 已提交
2281 2282 2283 2284 2285 2286 2287 2288
#ifdef GROT
		}
#endif /* GROT */
	}

	/*
	 * Zero out the entries we just copied.
	 */
2289
	if (start_s == be16_to_cpu(hdr_s->count)) {
L
Linus Torvalds 已提交
2290 2291 2292 2293 2294 2295 2296 2297 2298 2299
		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.
		 */
2300
		tmp  = be16_to_cpu(hdr_s->count) - count;
L
Linus Torvalds 已提交
2301 2302 2303 2304 2305 2306
		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);
2307
		entry_s = &leaf_s->entries[be16_to_cpu(hdr_s->count)];
L
Linus Torvalds 已提交
2308 2309 2310 2311 2312 2313 2314 2315
		ASSERT(((char *)entry_s + tmp) <=
		       ((char *)leaf_s + XFS_LBSIZE(mp)));
		memset((char *)entry_s, 0, tmp);
	}

	/*
	 * Fill in the freemap information
	 */
2316
	hdr_d->freemap[0].base = cpu_to_be16(sizeof(xfs_attr_leaf_hdr_t));
2317
	be16_add_cpu(&hdr_d->freemap[0].base, be16_to_cpu(hdr_d->count) *
2318 2319 2320
			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 已提交
2321 2322 2323 2324 2325 2326 2327 2328 2329 2330 2331 2332
	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
2333 2334 2335
xfs_attr_leaf_order(
	struct xfs_buf	*leaf1_bp,
	struct xfs_buf	*leaf2_bp)
L
Linus Torvalds 已提交
2336 2337 2338
{
	xfs_attr_leafblock_t *leaf1, *leaf2;

2339 2340
	leaf1 = leaf1_bp->b_addr;
	leaf2 = leaf2_bp->b_addr;
2341 2342
	ASSERT((leaf1->hdr.info.magic == cpu_to_be16(XFS_ATTR_LEAF_MAGIC)) &&
	       (leaf2->hdr.info.magic == cpu_to_be16(XFS_ATTR_LEAF_MAGIC)));
2343 2344
	if ((be16_to_cpu(leaf1->hdr.count) > 0) &&
	    (be16_to_cpu(leaf2->hdr.count) > 0) &&
2345 2346 2347 2348 2349 2350
	    ((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 已提交
2351 2352 2353 2354 2355 2356 2357 2358 2359
		return(1);
	}
	return(0);
}

/*
 * Pick up the last hashvalue from a leaf block.
 */
xfs_dahash_t
2360 2361 2362
xfs_attr_leaf_lasthash(
	struct xfs_buf	*bp,
	int		*count)
L
Linus Torvalds 已提交
2363 2364 2365
{
	xfs_attr_leafblock_t *leaf;

2366
	leaf = bp->b_addr;
2367
	ASSERT(leaf->hdr.info.magic == cpu_to_be16(XFS_ATTR_LEAF_MAGIC));
L
Linus Torvalds 已提交
2368
	if (count)
2369
		*count = be16_to_cpu(leaf->hdr.count);
L
Linus Torvalds 已提交
2370 2371
	if (!leaf->hdr.count)
		return(0);
2372
	return be32_to_cpu(leaf->entries[be16_to_cpu(leaf->hdr.count)-1].hashval);
L
Linus Torvalds 已提交
2373 2374 2375 2376 2377 2378
}

/*
 * Calculate the number of bytes used to store the indicated attribute
 * (whether local or remote only calculate bytes in this block).
 */
2379
STATIC int
L
Linus Torvalds 已提交
2380 2381 2382 2383 2384 2385
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;

2386
	ASSERT(leaf->hdr.info.magic == cpu_to_be16(XFS_ATTR_LEAF_MAGIC));
L
Linus Torvalds 已提交
2387
	if (leaf->entries[index].flags & XFS_ATTR_LOCAL) {
2388 2389
		name_loc = xfs_attr_leaf_name_local(leaf, index);
		size = xfs_attr_leaf_entsize_local(name_loc->namelen,
2390
						   be16_to_cpu(name_loc->valuelen));
L
Linus Torvalds 已提交
2391
	} else {
2392 2393
		name_rmt = xfs_attr_leaf_name_remote(leaf, index);
		size = xfs_attr_leaf_entsize_remote(name_rmt->namelen);
L
Linus Torvalds 已提交
2394 2395 2396 2397 2398 2399 2400 2401 2402 2403 2404
	}
	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
2405
xfs_attr_leaf_newentsize(int namelen, int valuelen, int blocksize, int *local)
L
Linus Torvalds 已提交
2406 2407 2408
{
	int size;

2409 2410
	size = xfs_attr_leaf_entsize_local(namelen, valuelen);
	if (size < xfs_attr_leaf_entsize_local_max(blocksize)) {
L
Linus Torvalds 已提交
2411 2412 2413 2414
		if (local) {
			*local = 1;
		}
	} else {
2415
		size = xfs_attr_leaf_entsize_remote(namelen);
L
Linus Torvalds 已提交
2416 2417 2418 2419 2420 2421 2422 2423 2424 2425 2426
		if (local) {
			*local = 0;
		}
	}
	return(size);
}

/*
 * Copy out attribute list entries for attr_list(), for leaf attribute lists.
 */
int
2427 2428 2429
xfs_attr_leaf_list_int(
	struct xfs_buf		*bp,
	xfs_attr_list_context_t	*context)
L
Linus Torvalds 已提交
2430 2431 2432 2433 2434 2435 2436
{
	attrlist_cursor_kern_t *cursor;
	xfs_attr_leafblock_t *leaf;
	xfs_attr_leaf_entry_t *entry;
	int retval, i;

	ASSERT(bp != NULL);
2437
	leaf = bp->b_addr;
L
Linus Torvalds 已提交
2438 2439 2440
	cursor = context->cursor;
	cursor->initted = 1;

C
Christoph Hellwig 已提交
2441
	trace_xfs_attr_list_leaf(context);
L
Linus Torvalds 已提交
2442 2443 2444 2445 2446 2447

	/*
	 * Re-find our place in the leaf block if this is a new syscall.
	 */
	if (context->resynch) {
		entry = &leaf->entries[0];
2448
		for (i = 0; i < be16_to_cpu(leaf->hdr.count); entry++, i++) {
2449
			if (be32_to_cpu(entry->hashval) == cursor->hashval) {
L
Linus Torvalds 已提交
2450 2451 2452 2453 2454
				if (cursor->offset == context->dupcnt) {
					context->dupcnt = 0;
					break;
				}
				context->dupcnt++;
2455 2456
			} else if (be32_to_cpu(entry->hashval) >
					cursor->hashval) {
L
Linus Torvalds 已提交
2457 2458 2459 2460
				context->dupcnt = 0;
				break;
			}
		}
2461
		if (i == be16_to_cpu(leaf->hdr.count)) {
C
Christoph Hellwig 已提交
2462
			trace_xfs_attr_list_notfound(context);
L
Linus Torvalds 已提交
2463 2464 2465 2466 2467 2468 2469 2470 2471 2472 2473 2474
			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;
2475
	for (  ; (i < be16_to_cpu(leaf->hdr.count)); entry++, i++) {
2476 2477
		if (be32_to_cpu(entry->hashval) != cursor->hashval) {
			cursor->hashval = be32_to_cpu(entry->hashval);
L
Linus Torvalds 已提交
2478 2479 2480 2481 2482 2483 2484
			cursor->offset = 0;
		}

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

		if (entry->flags & XFS_ATTR_LOCAL) {
2485
			xfs_attr_leaf_name_local_t *name_loc =
2486
				xfs_attr_leaf_name_local(leaf, i);
2487 2488

			retval = context->put_listent(context,
2489
						entry->flags,
2490
						name_loc->nameval,
2491 2492
						(int)name_loc->namelen,
						be16_to_cpu(name_loc->valuelen),
2493
						&name_loc->nameval[name_loc->namelen]);
2494 2495
			if (retval)
				return retval;
L
Linus Torvalds 已提交
2496
		} else {
2497
			xfs_attr_leaf_name_remote_t *name_rmt =
2498
				xfs_attr_leaf_name_remote(leaf, i);
2499 2500 2501 2502 2503 2504 2505 2506 2507 2508

			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;
2509
				args.value = kmem_alloc(valuelen, KM_SLEEP | KM_NOFS);
2510 2511 2512 2513 2514 2515
				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,
2516
						entry->flags,
2517
						name_rmt->name,
2518 2519
						(int)name_rmt->namelen,
						valuelen,
2520
						args.value);
2521
				kmem_free(args.value);
2522
			} else {
2523
				retval = context->put_listent(context,
2524
						entry->flags,
2525
						name_rmt->name,
2526 2527 2528 2529 2530 2531
						(int)name_rmt->namelen,
						valuelen,
						NULL);
			}
			if (retval)
				return retval;
L
Linus Torvalds 已提交
2532
		}
2533 2534 2535
		if (context->seen_enough)
			break;
		cursor->offset++;
L
Linus Torvalds 已提交
2536
	}
C
Christoph Hellwig 已提交
2537
	trace_xfs_attr_list_leaf_end(context);
L
Linus Torvalds 已提交
2538 2539 2540 2541 2542 2543 2544 2545 2546 2547 2548 2549 2550 2551 2552 2553 2554
	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;
2555
	struct xfs_buf *bp;
L
Linus Torvalds 已提交
2556 2557 2558 2559 2560 2561 2562
	int error;
#ifdef DEBUG
	xfs_attr_leaf_name_local_t *name_loc;
	int namelen;
	char *name;
#endif /* DEBUG */

2563
	trace_xfs_attr_leaf_clearflag(args);
L
Linus Torvalds 已提交
2564 2565 2566
	/*
	 * Set up the operation.
	 */
2567 2568
	error = xfs_attr_leaf_read(args->trans, args->dp, args->blkno, -1, &bp);
	if (error)
L
Linus Torvalds 已提交
2569 2570
		return(error);

2571
	leaf = bp->b_addr;
2572
	ASSERT(args->index < be16_to_cpu(leaf->hdr.count));
L
Linus Torvalds 已提交
2573 2574 2575 2576 2577 2578
	ASSERT(args->index >= 0);
	entry = &leaf->entries[ args->index ];
	ASSERT(entry->flags & XFS_ATTR_INCOMPLETE);

#ifdef DEBUG
	if (entry->flags & XFS_ATTR_LOCAL) {
2579
		name_loc = xfs_attr_leaf_name_local(leaf, args->index);
L
Linus Torvalds 已提交
2580 2581 2582
		namelen = name_loc->namelen;
		name = (char *)name_loc->nameval;
	} else {
2583
		name_rmt = xfs_attr_leaf_name_remote(leaf, args->index);
L
Linus Torvalds 已提交
2584 2585 2586
		namelen = name_rmt->namelen;
		name = (char *)name_rmt->name;
	}
2587
	ASSERT(be32_to_cpu(entry->hashval) == args->hashval);
L
Linus Torvalds 已提交
2588 2589 2590 2591 2592
	ASSERT(namelen == args->namelen);
	ASSERT(memcmp(name, args->name, namelen) == 0);
#endif /* DEBUG */

	entry->flags &= ~XFS_ATTR_INCOMPLETE;
2593
	xfs_trans_log_buf(args->trans, bp,
L
Linus Torvalds 已提交
2594 2595 2596 2597
			 XFS_DA_LOGRANGE(leaf, entry, sizeof(*entry)));

	if (args->rmtblkno) {
		ASSERT((entry->flags & XFS_ATTR_LOCAL) == 0);
2598
		name_rmt = xfs_attr_leaf_name_remote(leaf, args->index);
2599 2600
		name_rmt->valueblk = cpu_to_be32(args->rmtblkno);
		name_rmt->valuelen = cpu_to_be32(args->valuelen);
2601
		xfs_trans_log_buf(args->trans, bp,
L
Linus Torvalds 已提交
2602 2603 2604 2605 2606 2607
			 XFS_DA_LOGRANGE(leaf, name_rmt, sizeof(*name_rmt)));
	}

	/*
	 * Commit the flag value change and start the next trans in series.
	 */
2608
	return xfs_trans_roll(&args->trans, args->dp);
L
Linus Torvalds 已提交
2609 2610 2611 2612 2613 2614 2615 2616 2617 2618 2619
}

/*
 * 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;
2620
	struct xfs_buf *bp;
L
Linus Torvalds 已提交
2621 2622
	int error;

2623 2624
	trace_xfs_attr_leaf_setflag(args);

L
Linus Torvalds 已提交
2625 2626 2627
	/*
	 * Set up the operation.
	 */
2628 2629
	error = xfs_attr_leaf_read(args->trans, args->dp, args->blkno, -1, &bp);
	if (error)
L
Linus Torvalds 已提交
2630 2631
		return(error);

2632
	leaf = bp->b_addr;
2633
	ASSERT(args->index < be16_to_cpu(leaf->hdr.count));
L
Linus Torvalds 已提交
2634 2635 2636 2637 2638
	ASSERT(args->index >= 0);
	entry = &leaf->entries[ args->index ];

	ASSERT((entry->flags & XFS_ATTR_INCOMPLETE) == 0);
	entry->flags |= XFS_ATTR_INCOMPLETE;
2639
	xfs_trans_log_buf(args->trans, bp,
L
Linus Torvalds 已提交
2640 2641
			XFS_DA_LOGRANGE(leaf, entry, sizeof(*entry)));
	if ((entry->flags & XFS_ATTR_LOCAL) == 0) {
2642
		name_rmt = xfs_attr_leaf_name_remote(leaf, args->index);
L
Linus Torvalds 已提交
2643 2644
		name_rmt->valueblk = 0;
		name_rmt->valuelen = 0;
2645
		xfs_trans_log_buf(args->trans, bp,
L
Linus Torvalds 已提交
2646 2647 2648 2649 2650 2651
			 XFS_DA_LOGRANGE(leaf, name_rmt, sizeof(*name_rmt)));
	}

	/*
	 * Commit the flag value change and start the next trans in series.
	 */
2652
	return xfs_trans_roll(&args->trans, args->dp);
L
Linus Torvalds 已提交
2653 2654 2655 2656 2657 2658 2659 2660 2661 2662 2663 2664 2665 2666 2667
}

/*
 * 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;
2668
	struct xfs_buf *bp1, *bp2;
L
Linus Torvalds 已提交
2669 2670 2671 2672 2673 2674 2675
	int error;
#ifdef DEBUG
	xfs_attr_leaf_name_local_t *name_loc;
	int namelen1, namelen2;
	char *name1, *name2;
#endif /* DEBUG */

2676 2677
	trace_xfs_attr_leaf_flipflags(args);

L
Linus Torvalds 已提交
2678 2679 2680
	/*
	 * Read the block containing the "old" attr
	 */
2681 2682 2683
	error = xfs_attr_leaf_read(args->trans, args->dp, args->blkno, -1, &bp1);
	if (error)
		return error;
L
Linus Torvalds 已提交
2684 2685 2686 2687 2688

	/*
	 * Read the block containing the "new" attr, if it is different
	 */
	if (args->blkno2 != args->blkno) {
2689 2690 2691 2692
		error = xfs_attr_leaf_read(args->trans, args->dp, args->blkno2,
					   -1, &bp2);
		if (error)
			return error;
L
Linus Torvalds 已提交
2693 2694 2695 2696
	} else {
		bp2 = bp1;
	}

2697
	leaf1 = bp1->b_addr;
2698
	ASSERT(args->index < be16_to_cpu(leaf1->hdr.count));
L
Linus Torvalds 已提交
2699 2700 2701
	ASSERT(args->index >= 0);
	entry1 = &leaf1->entries[ args->index ];

2702
	leaf2 = bp2->b_addr;
2703
	ASSERT(args->index2 < be16_to_cpu(leaf2->hdr.count));
L
Linus Torvalds 已提交
2704 2705 2706 2707 2708
	ASSERT(args->index2 >= 0);
	entry2 = &leaf2->entries[ args->index2 ];

#ifdef DEBUG
	if (entry1->flags & XFS_ATTR_LOCAL) {
2709
		name_loc = xfs_attr_leaf_name_local(leaf1, args->index);
L
Linus Torvalds 已提交
2710 2711 2712
		namelen1 = name_loc->namelen;
		name1 = (char *)name_loc->nameval;
	} else {
2713
		name_rmt = xfs_attr_leaf_name_remote(leaf1, args->index);
L
Linus Torvalds 已提交
2714 2715 2716 2717
		namelen1 = name_rmt->namelen;
		name1 = (char *)name_rmt->name;
	}
	if (entry2->flags & XFS_ATTR_LOCAL) {
2718
		name_loc = xfs_attr_leaf_name_local(leaf2, args->index2);
L
Linus Torvalds 已提交
2719 2720 2721
		namelen2 = name_loc->namelen;
		name2 = (char *)name_loc->nameval;
	} else {
2722
		name_rmt = xfs_attr_leaf_name_remote(leaf2, args->index2);
L
Linus Torvalds 已提交
2723 2724 2725
		namelen2 = name_rmt->namelen;
		name2 = (char *)name_rmt->name;
	}
2726
	ASSERT(be32_to_cpu(entry1->hashval) == be32_to_cpu(entry2->hashval));
L
Linus Torvalds 已提交
2727 2728 2729 2730 2731 2732 2733 2734
	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;
2735
	xfs_trans_log_buf(args->trans, bp1,
L
Linus Torvalds 已提交
2736 2737 2738
			  XFS_DA_LOGRANGE(leaf1, entry1, sizeof(*entry1)));
	if (args->rmtblkno) {
		ASSERT((entry1->flags & XFS_ATTR_LOCAL) == 0);
2739
		name_rmt = xfs_attr_leaf_name_remote(leaf1, args->index);
2740 2741
		name_rmt->valueblk = cpu_to_be32(args->rmtblkno);
		name_rmt->valuelen = cpu_to_be32(args->valuelen);
2742
		xfs_trans_log_buf(args->trans, bp1,
L
Linus Torvalds 已提交
2743 2744 2745 2746
			 XFS_DA_LOGRANGE(leaf1, name_rmt, sizeof(*name_rmt)));
	}

	entry2->flags |= XFS_ATTR_INCOMPLETE;
2747
	xfs_trans_log_buf(args->trans, bp2,
L
Linus Torvalds 已提交
2748 2749
			  XFS_DA_LOGRANGE(leaf2, entry2, sizeof(*entry2)));
	if ((entry2->flags & XFS_ATTR_LOCAL) == 0) {
2750
		name_rmt = xfs_attr_leaf_name_remote(leaf2, args->index2);
L
Linus Torvalds 已提交
2751 2752
		name_rmt->valueblk = 0;
		name_rmt->valuelen = 0;
2753
		xfs_trans_log_buf(args->trans, bp2,
L
Linus Torvalds 已提交
2754 2755 2756 2757 2758 2759
			 XFS_DA_LOGRANGE(leaf2, name_rmt, sizeof(*name_rmt)));
	}

	/*
	 * Commit the flag value change and start the next trans in series.
	 */
2760
	error = xfs_trans_roll(&args->trans, args->dp);
L
Linus Torvalds 已提交
2761 2762 2763 2764 2765 2766 2767 2768 2769 2770 2771 2772 2773 2774 2775 2776 2777

	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;
2778
	struct xfs_buf *bp;
L
Linus Torvalds 已提交
2779 2780 2781 2782 2783 2784 2785 2786
	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.
	 */
2787
	error = xfs_da3_node_read(*trans, dp, 0, -1, &bp, XFS_ATTR_FORK);
L
Linus Torvalds 已提交
2788 2789
	if (error)
		return(error);
2790
	blkno = XFS_BUF_ADDR(bp);
L
Linus Torvalds 已提交
2791 2792 2793 2794 2795

	/*
	 * Invalidate the tree, even if the "tree" is only a single leaf block.
	 * This is a depth-first traversal!
	 */
2796
	info = bp->b_addr;
2797
	if (info->magic == cpu_to_be16(XFS_DA_NODE_MAGIC)) {
L
Linus Torvalds 已提交
2798
		error = xfs_attr_node_inactive(trans, dp, bp, 1);
2799
	} else if (info->magic == cpu_to_be16(XFS_ATTR_LEAF_MAGIC)) {
L
Linus Torvalds 已提交
2800 2801 2802
		error = xfs_attr_leaf_inactive(trans, dp, bp);
	} else {
		error = XFS_ERROR(EIO);
2803
		xfs_trans_brelse(*trans, bp);
L
Linus Torvalds 已提交
2804 2805 2806 2807 2808 2809 2810 2811 2812 2813
	}
	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);
2814
	xfs_trans_binval(*trans, bp);	/* remove from cache */
L
Linus Torvalds 已提交
2815 2816 2817
	/*
	 * Commit the invalidate and start the next transaction.
	 */
2818
	error = xfs_trans_roll(trans, dp);
L
Linus Torvalds 已提交
2819 2820 2821 2822 2823 2824 2825 2826

	return (error);
}

/*
 * Recurse (gasp!) through the attribute nodes until we find leaves.
 * We're doing a depth-first traversal in order to invalidate everything.
 */
2827
STATIC int
2828 2829 2830 2831 2832
xfs_attr_node_inactive(
	struct xfs_trans **trans,
	struct xfs_inode *dp,
	struct xfs_buf	*bp,
	int		level)
L
Linus Torvalds 已提交
2833 2834 2835 2836 2837 2838
{
	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;
2839
	struct xfs_buf *child_bp;
2840
	struct xfs_da_node_entry *btree;
L
Linus Torvalds 已提交
2841 2842 2843 2844 2845

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

2850
	node = bp->b_addr;
2851
	ASSERT(node->hdr.info.magic == cpu_to_be16(XFS_DA_NODE_MAGIC));
2852
	parent_blkno = XFS_BUF_ADDR(bp);	/* save for re-read later */
2853
	count = be16_to_cpu(node->hdr.count);
L
Linus Torvalds 已提交
2854
	if (!count) {
2855
		xfs_trans_brelse(*trans, bp);
L
Linus Torvalds 已提交
2856 2857
		return(0);
	}
2858 2859
	btree = xfs_da3_node_tree_p(node);
	child_fsb = be32_to_cpu(btree[0].before);
2860
	xfs_trans_brelse(*trans, bp);	/* no locks for later trans */
L
Linus Torvalds 已提交
2861 2862 2863 2864 2865 2866 2867 2868 2869 2870 2871 2872 2873

	/*
	 * 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.
		 */
2874
		error = xfs_da3_node_read(*trans, dp, child_fsb, -2, &child_bp,
D
Dave Chinner 已提交
2875
						XFS_ATTR_FORK);
L
Linus Torvalds 已提交
2876 2877 2878 2879
		if (error)
			return(error);
		if (child_bp) {
						/* save for re-read later */
2880
			child_blkno = XFS_BUF_ADDR(child_bp);
L
Linus Torvalds 已提交
2881 2882 2883 2884

			/*
			 * Invalidate the subtree, however we have to.
			 */
2885
			info = child_bp->b_addr;
2886
			if (info->magic == cpu_to_be16(XFS_DA_NODE_MAGIC)) {
L
Linus Torvalds 已提交
2887 2888
				error = xfs_attr_node_inactive(trans, dp,
						child_bp, level+1);
2889
			} else if (info->magic == cpu_to_be16(XFS_ATTR_LEAF_MAGIC)) {
L
Linus Torvalds 已提交
2890 2891 2892 2893
				error = xfs_attr_leaf_inactive(trans, dp,
						child_bp);
			} else {
				error = XFS_ERROR(EIO);
2894
				xfs_trans_brelse(*trans, child_bp);
L
Linus Torvalds 已提交
2895 2896 2897 2898 2899 2900 2901 2902 2903 2904 2905 2906
			}
			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);
2907
			xfs_trans_binval(*trans, child_bp);
L
Linus Torvalds 已提交
2908 2909 2910 2911 2912 2913 2914
		}

		/*
		 * If we're not done, re-read the parent to get the next
		 * child block number.
		 */
		if ((i+1) < count) {
2915
			error = xfs_da3_node_read(*trans, dp, 0, parent_blkno,
D
Dave Chinner 已提交
2916
						 &bp, XFS_ATTR_FORK);
L
Linus Torvalds 已提交
2917 2918
			if (error)
				return(error);
2919
			child_fsb = be32_to_cpu(btree[i+1].before);
2920
			xfs_trans_brelse(*trans, bp);
L
Linus Torvalds 已提交
2921 2922 2923 2924
		}
		/*
		 * Atomically commit the whole invalidate stuff.
		 */
2925 2926
		error = xfs_trans_roll(trans, dp);
		if (error)
L
Linus Torvalds 已提交
2927 2928 2929 2930 2931 2932 2933 2934 2935 2936 2937 2938
			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.
 */
2939
STATIC int
2940 2941 2942 2943
xfs_attr_leaf_inactive(
	struct xfs_trans **trans,
	struct xfs_inode *dp,
	struct xfs_buf	*bp)
L
Linus Torvalds 已提交
2944 2945 2946 2947 2948 2949 2950
{
	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;

2951
	leaf = bp->b_addr;
2952
	ASSERT(leaf->hdr.info.magic == cpu_to_be16(XFS_ATTR_LEAF_MAGIC));
L
Linus Torvalds 已提交
2953 2954 2955 2956 2957 2958

	/*
	 * Count the number of "remote" value extents.
	 */
	count = 0;
	entry = &leaf->entries[0];
2959
	for (i = 0; i < be16_to_cpu(leaf->hdr.count); entry++, i++) {
2960 2961
		if (be16_to_cpu(entry->nameidx) &&
		    ((entry->flags & XFS_ATTR_LOCAL) == 0)) {
2962
			name_rmt = xfs_attr_leaf_name_remote(leaf, i);
L
Linus Torvalds 已提交
2963 2964 2965 2966 2967 2968 2969 2970 2971
			if (name_rmt->valueblk)
				count++;
		}
	}

	/*
	 * If there are no "remote" values, we're done.
	 */
	if (count == 0) {
2972
		xfs_trans_brelse(*trans, bp);
L
Linus Torvalds 已提交
2973 2974 2975 2976 2977 2978 2979 2980 2981 2982 2983 2984 2985 2986
		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];
2987
	for (i = 0; i < be16_to_cpu(leaf->hdr.count); entry++, i++) {
2988 2989
		if (be16_to_cpu(entry->nameidx) &&
		    ((entry->flags & XFS_ATTR_LOCAL) == 0)) {
2990
			name_rmt = xfs_attr_leaf_name_remote(leaf, i);
L
Linus Torvalds 已提交
2991
			if (name_rmt->valueblk) {
2992 2993 2994
				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 已提交
2995 2996 2997 2998
				lp++;
			}
		}
	}
2999
	xfs_trans_brelse(*trans, bp);	/* unlock for trans. in freextent() */
L
Linus Torvalds 已提交
3000 3001 3002 3003 3004 3005 3006

	/*
	 * 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,
3007 3008
				lp->valueblk, lp->valuelen);

L
Linus Torvalds 已提交
3009 3010 3011 3012
		if (error == 0)
			error = tmp;	/* save only the 1st errno */
	}

3013
	kmem_free((xfs_caddr_t)list);
L
Linus Torvalds 已提交
3014 3015 3016 3017 3018 3019 3020
	return(error);
}

/*
 * Look at all the extents for this logical region,
 * invalidate any buffers that are incore/in transactions.
 */
3021
STATIC int
L
Linus Torvalds 已提交
3022 3023 3024 3025 3026 3027 3028 3029 3030 3031 3032 3033 3034 3035 3036 3037 3038 3039 3040 3041
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 已提交
3042 3043
		error = xfs_bmapi_read(dp, (xfs_fileoff_t)tblkno, tblkcnt,
				       &map, &nmap, XFS_BMAPI_ATTRFORK);
L
Linus Torvalds 已提交
3044 3045 3046 3047 3048 3049 3050 3051 3052 3053 3054 3055 3056 3057 3058 3059 3060 3061
		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 已提交
3062
					dblkno, dblkcnt, 0);
3063 3064
			if (!bp)
				return ENOMEM;
L
Linus Torvalds 已提交
3065 3066 3067 3068
			xfs_trans_binval(*trans, bp);
			/*
			 * Roll to next transaction.
			 */
3069 3070
			error = xfs_trans_roll(trans, dp);
			if (error)
L
Linus Torvalds 已提交
3071 3072 3073 3074 3075 3076 3077 3078 3079
				return (error);
		}

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

	return(0);
}