xfs_attr_leaf.c 83.6 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
#include "xfs_log.h"
23
#include "xfs_inum.h"
L
Linus Torvalds 已提交
24 25 26 27
#include "xfs_trans.h"
#include "xfs_sb.h"
#include "xfs_ag.h"
#include "xfs_mount.h"
28
#include "xfs_da_btree.h"
L
Linus Torvalds 已提交
29
#include "xfs_bmap_btree.h"
30
#include "xfs_alloc_btree.h"
L
Linus Torvalds 已提交
31 32 33
#include "xfs_ialloc_btree.h"
#include "xfs_alloc.h"
#include "xfs_btree.h"
34
#include "xfs_attr_sf.h"
L
Linus Torvalds 已提交
35 36
#include "xfs_dinode.h"
#include "xfs_inode.h"
37
#include "xfs_inode_item.h"
L
Linus Torvalds 已提交
38 39 40 41
#include "xfs_bmap.h"
#include "xfs_attr.h"
#include "xfs_attr_leaf.h"
#include "xfs_error.h"
C
Christoph Hellwig 已提交
42
#include "xfs_trace.h"
L
Linus Torvalds 已提交
43 44 45 46 47 48 49 50 51 52 53 54 55 56

/*
 * 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.
 */
57 58
STATIC int xfs_attr_leaf_create(xfs_da_args_t *args, xfs_dablk_t which_block,
				    xfs_dabuf_t **bpp);
L
Linus Torvalds 已提交
59 60 61 62 63 64 65 66 67 68 69 70
STATIC int xfs_attr_leaf_add_work(xfs_dabuf_t *leaf_buffer, xfs_da_args_t *args,
					      int freemap_index);
STATIC void xfs_attr_leaf_compact(xfs_trans_t *trans, xfs_dabuf_t *leaf_buffer);
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 75 76 77 78 79 80
/*
 * Routines used for shrinking the Btree.
 */
STATIC int xfs_attr_node_inactive(xfs_trans_t **trans, xfs_inode_t *dp,
				  xfs_dabuf_t *bp, int level);
STATIC int xfs_attr_leaf_inactive(xfs_trans_t **trans, xfs_inode_t *dp,
				  xfs_dabuf_t *bp);
STATIC int xfs_attr_leaf_freextent(xfs_trans_t **trans, xfs_inode_t *dp,
				   xfs_dablk_t blkno, int blkcnt);

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

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

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

L
Linus Torvalds 已提交
105 106

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

/*
111 112 113 114 115 116 117
 * Query whether the requested number of additional bytes of extended
 * attribute space will be able to fit inline.
 * 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 已提交
118 119
 */
int
120 121 122 123 124
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 */
125
	int dsize;	
126 127 128 129 130 131 132 133 134 135 136 137 138
	xfs_mount_t *mp = dp->i_mount;

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

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

139
	if (!(mp->m_flags & XFS_MOUNT_ATTR2)) {
140
		if (bytes <= XFS_IFORK_ASIZE(dp))
141
			return dp->i_d.di_forkoff;
142 143 144
		return 0;
	}

145 146 147 148 149 150 151 152 153 154 155
	dsize = dp->i_df.if_bytes;
	
	switch (dp->i_d.di_format) {
	case XFS_DINODE_FMT_EXTENTS:
		/* 
		 * If there is no attr fork and the data fork is extents, 
		 * 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 
		 * the btree root.
		 */ 
C
Christoph Hellwig 已提交
156 157
		if (!dp->i_d.di_forkoff && dp->i_df.if_bytes >
		    xfs_default_attroffset(dp))
158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182
			dsize = XFS_BMDR_SPACE_CALC(MINDBTPTRS);
		break;
		
	case XFS_DINODE_FMT_BTREE:
		/*
		 * If have 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 
		 * plenty of room for attrs
		 */
		if (dp->i_d.di_forkoff) {
			if (offset < dp->i_d.di_forkoff) 
				return 0;
			else 
				return dp->i_d.di_forkoff;
		} else
			dsize = XFS_BMAP_BROOT_SPACE(dp->i_df.if_broot);
		break;
	}
	
	/* 
	 * A data fork btree root must have space for at least 
	 * MINDBTPTRS key/ptr pairs if the data fork is small or empty.
	 */
	minforkoff = MAX(dsize, XFS_BMDR_SPACE_CALC(MINDBTPTRS));
183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201
	minforkoff = roundup(minforkoff, 8) >> 3;

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

	if (offset >= minforkoff && offset < maxforkoff)
		return offset;
	if (offset >= maxforkoff)
		return maxforkoff;
	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)
{
202
	if ((mp->m_flags & XFS_MOUNT_ATTR2) &&
203
	    !(xfs_sb_version_hasattr2(&mp->m_sb))) {
E
Eric Sandeen 已提交
204
		spin_lock(&mp->m_sb_lock);
205 206
		if (!xfs_sb_version_hasattr2(&mp->m_sb)) {
			xfs_sb_version_addattr2(&mp->m_sb);
E
Eric Sandeen 已提交
207
			spin_unlock(&mp->m_sb_lock);
208 209
			xfs_mod_sb(tp, XFS_SB_VERSIONNUM | XFS_SB_FEATURES2);
		} else
E
Eric Sandeen 已提交
210
			spin_unlock(&mp->m_sb_lock);
211 212 213 214 215 216 217
	}
}

/*
 * Create the initial contents of a shortform attribute list.
 */
void
L
Linus Torvalds 已提交
218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238
xfs_attr_shortform_create(xfs_da_args_t *args)
{
	xfs_attr_sf_hdr_t *hdr;
	xfs_inode_t *dp;
	xfs_ifork_t *ifp;

	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;
239
	hdr->totsize = cpu_to_be16(sizeof(*hdr));
L
Linus Torvalds 已提交
240 241 242 243 244 245 246
	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.
 */
247 248
void
xfs_attr_shortform_add(xfs_da_args_t *args, int forkoff)
L
Linus Torvalds 已提交
249 250 251 252
{
	xfs_attr_shortform_t *sf;
	xfs_attr_sf_entry_t *sfe;
	int i, offset, size;
253
	xfs_mount_t *mp;
L
Linus Torvalds 已提交
254 255 256 257
	xfs_inode_t *dp;
	xfs_ifork_t *ifp;

	dp = args->dp;
258 259 260 261 262 263 264
	mp = dp->i_mount;
	dp->i_d.di_forkoff = forkoff;
	dp->i_df.if_ext_max =
		XFS_IFORK_DSIZE(dp) / (uint)sizeof(xfs_bmbt_rec_t);
	dp->i_afp->if_ext_max =
		XFS_IFORK_ASIZE(dp) / (uint)sizeof(xfs_bmbt_rec_t);

L
Linus Torvalds 已提交
265 266 267 268
	ifp = dp->i_afp;
	ASSERT(ifp->if_flags & XFS_IFINLINE);
	sf = (xfs_attr_shortform_t *)ifp->if_u1.if_data;
	sfe = &sf->list[0];
269
	for (i = 0; i < sf->hdr.count; sfe = XFS_ATTR_SF_NEXTENTRY(sfe), i++) {
270
#ifdef DEBUG
L
Linus Torvalds 已提交
271 272 273 274
		if (sfe->namelen != args->namelen)
			continue;
		if (memcmp(args->name, sfe->nameval, args->namelen) != 0)
			continue;
275
		if (!xfs_attr_namesp_match(args->flags, sfe->flags))
L
Linus Torvalds 已提交
276
			continue;
277 278
		ASSERT(0);
#endif
L
Linus Torvalds 已提交
279 280 281 282 283 284 285 286 287
	}

	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;
288
	sfe->valuelen = args->valuelen;
289
	sfe->flags = XFS_ATTR_NSP_ARGS_TO_ONDISK(args->flags);
L
Linus Torvalds 已提交
290 291
	memcpy(sfe->nameval, args->name, args->namelen);
	memcpy(&sfe->nameval[args->namelen], args->value, args->valuelen);
292
	sf->hdr.count++;
293
	be16_add_cpu(&sf->hdr.totsize, size);
L
Linus Torvalds 已提交
294 295
	xfs_trans_log_inode(args->trans, dp, XFS_ILOG_CORE | XFS_ILOG_ADATA);

296
	xfs_sbversion_add_attr2(mp, args->trans);
L
Linus Torvalds 已提交
297 298
}

299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318
/*
 * 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);

	ip->i_df.if_ext_max = XFS_IFORK_DSIZE(ip) / sizeof(xfs_bmbt_rec_t);
	xfs_trans_log_inode(tp, ip, XFS_ILOG_CORE);
}

L
Linus Torvalds 已提交
319
/*
320
 * Remove an attribute from the shortform attribute list structure.
L
Linus Torvalds 已提交
321 322 323 324 325 326 327
 */
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;
328
	xfs_mount_t *mp;
L
Linus Torvalds 已提交
329 330 331
	xfs_inode_t *dp;

	dp = args->dp;
332
	mp = dp->i_mount;
L
Linus Torvalds 已提交
333 334 335
	base = sizeof(xfs_attr_sf_hdr_t);
	sf = (xfs_attr_shortform_t *)dp->i_afp->if_u1.if_data;
	sfe = &sf->list[0];
336
	end = sf->hdr.count;
337
	for (i = 0; i < end; sfe = XFS_ATTR_SF_NEXTENTRY(sfe),
L
Linus Torvalds 已提交
338 339 340 341 342 343
					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;
344
		if (!xfs_attr_namesp_match(args->flags, sfe->flags))
L
Linus Torvalds 已提交
345 346 347
			continue;
		break;
	}
348
	if (i == end)
L
Linus Torvalds 已提交
349 350
		return(XFS_ERROR(ENOATTR));

351 352 353
	/*
	 * Fix up the attribute fork data, covering the hole
	 */
L
Linus Torvalds 已提交
354
	end = base + size;
355
	totsize = be16_to_cpu(sf->hdr.totsize);
356 357
	if (end != totsize)
		memmove(&((char *)sf)[base], &((char *)sf)[end], totsize - end);
358
	sf->hdr.count--;
359
	be16_add_cpu(&sf->hdr.totsize, -size);
360 361 362 363 364

	/*
	 * Fix up the start offset of the attribute fork
	 */
	totsize -= size;
365
	if (totsize == sizeof(xfs_attr_sf_hdr_t) &&
366 367 368 369
	    (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);
370 371 372 373
	} 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);
374 375 376 377
		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);
378 379 380 381 382 383 384 385 386
		dp->i_afp->if_ext_max =
			XFS_IFORK_ASIZE(dp) / (uint)sizeof(xfs_bmbt_rec_t);
		dp->i_df.if_ext_max =
			XFS_IFORK_DSIZE(dp) / (uint)sizeof(xfs_bmbt_rec_t);
		xfs_trans_log_inode(args->trans, dp,
					XFS_ILOG_CORE | XFS_ILOG_ADATA);
	}

	xfs_sbversion_add_attr2(mp, args->trans);
L
Linus Torvalds 已提交
387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406

	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;

	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];
407
	for (i = 0; i < sf->hdr.count;
L
Linus Torvalds 已提交
408 409 410 411 412
				sfe = XFS_ATTR_SF_NEXTENTRY(sfe), i++) {
		if (sfe->namelen != args->namelen)
			continue;
		if (memcmp(args->name, sfe->nameval, args->namelen) != 0)
			continue;
413
		if (!xfs_attr_namesp_match(args->flags, sfe->flags))
L
Linus Torvalds 已提交
414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433
			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];
434
	for (i = 0; i < sf->hdr.count;
L
Linus Torvalds 已提交
435 436 437 438 439
				sfe = XFS_ATTR_SF_NEXTENTRY(sfe), i++) {
		if (sfe->namelen != args->namelen)
			continue;
		if (memcmp(args->name, sfe->nameval, args->namelen) != 0)
			continue;
440
		if (!xfs_attr_namesp_match(args->flags, sfe->flags))
L
Linus Torvalds 已提交
441 442
			continue;
		if (args->flags & ATTR_KERNOVAL) {
443
			args->valuelen = sfe->valuelen;
L
Linus Torvalds 已提交
444 445
			return(XFS_ERROR(EEXIST));
		}
446 447
		if (args->valuelen < sfe->valuelen) {
			args->valuelen = sfe->valuelen;
L
Linus Torvalds 已提交
448 449
			return(XFS_ERROR(ERANGE));
		}
450
		args->valuelen = sfe->valuelen;
L
Linus Torvalds 已提交
451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476
		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;
	xfs_dabuf_t *bp;
	xfs_ifork_t *ifp;

	dp = args->dp;
	ifp = dp->i_afp;
	sf = (xfs_attr_shortform_t *)ifp->if_u1.if_data;
477
	size = be16_to_cpu(sf->hdr.totsize);
L
Linus Torvalds 已提交
478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516
	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;
517
	nargs.op_flags = XFS_DA_OP_OKNOENT;
L
Linus Torvalds 已提交
518 519

	sfe = &sf->list[0];
520
	for (i = 0; i < sf->hdr.count; i++) {
521
		nargs.name = sfe->nameval;
L
Linus Torvalds 已提交
522
		nargs.namelen = sfe->namelen;
523
		nargs.value = &sfe->nameval[nargs.namelen];
524
		nargs.valuelen = sfe->valuelen;
525
		nargs.hashval = xfs_da_hashname(sfe->nameval,
L
Linus Torvalds 已提交
526
						sfe->namelen);
527
		nargs.flags = XFS_ATTR_NSP_ONDISK_TO_ARGS(sfe->flags);
L
Linus Torvalds 已提交
528 529 530 531 532 533 534 535 536 537 538 539 540
		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:
	if(bp)
		xfs_da_buf_done(bp);
541
	kmem_free(tmpbuffer);
L
Linus Torvalds 已提交
542 543 544 545 546 547 548 549 550 551
	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;
552
	if (sa->hash < sb->hash) {
L
Linus Torvalds 已提交
553
		return(-1);
554
	} else if (sa->hash > sb->hash) {
L
Linus Torvalds 已提交
555 556 557 558 559 560
		return(1);
	} else {
		return(sa->entno - sb->entno);
	}
}

561 562 563 564

#define XFS_ISRESET_CURSOR(cursor) \
	(!((cursor)->initted) && !((cursor)->hashval) && \
	 !((cursor)->blkno) && !((cursor)->offset))
L
Linus Torvalds 已提交
565 566
/*
 * Copy out entries of shortform attribute lists for attr_list().
567
 * Shortform attribute lists are not stored in hashval sorted order.
L
Linus Torvalds 已提交
568 569 570 571 572 573 574 575 576 577 578 579 580 581
 * 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;
582
	int error;
L
Linus Torvalds 已提交
583 584 585 586 587 588 589 590 591 592 593 594

	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 已提交
595
	trace_xfs_attr_list_sf(context);
L
Linus Torvalds 已提交
596 597

	/*
598 599 600 601
	 * 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 已提交
602
	 * Note the generous fudge factor of 16 overhead bytes per entry.
603 604
	 * If bufsize is zero then put_listent must be a search function
	 * and can just scan through what we have.
L
Linus Torvalds 已提交
605
	 */
606 607 608
	if (context->bufsize == 0 ||
	    (XFS_ISRESET_CURSOR(cursor) &&
             (dp->i_afp->if_bytes + sf->hdr.count * 16) < context->bufsize)) {
609
		for (i = 0, sfe = &sf->list[0]; i < sf->hdr.count; i++) {
610
			error = context->put_listent(context,
611
					   sfe->flags,
612
					   sfe->nameval,
613 614
					   (int)sfe->namelen,
					   (int)sfe->valuelen,
615
					   &sfe->nameval[sfe->namelen]);
616 617 618 619 620 621 622 623 624 625

			/*
			 * 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 已提交
626 627
			sfe = XFS_ATTR_SF_NEXTENTRY(sfe);
		}
C
Christoph Hellwig 已提交
628
		trace_xfs_attr_list_sf_all(context);
L
Linus Torvalds 已提交
629 630 631
		return(0);
	}

632 633 634 635
	/* do no more for a search callback */
	if (context->bufsize == 0)
		return 0;

L
Linus Torvalds 已提交
636 637 638
	/*
	 * It didn't all fit, so we have to sort everything on hashval.
	 */
639
	sbsize = sf->hdr.count * sizeof(*sbuf);
640
	sbp = sbuf = kmem_alloc(sbsize, KM_SLEEP | KM_NOFS);
L
Linus Torvalds 已提交
641 642 643 644 645 646

	/*
	 * Scan the attribute list for the rest of the entries, storing
	 * the relevant info from only those that match into a buffer.
	 */
	nsbuf = 0;
647
	for (i = 0, sfe = &sf->list[0]; i < sf->hdr.count; i++) {
L
Linus Torvalds 已提交
648 649 650 651 652 653
		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);
654
			kmem_free(sbuf);
L
Linus Torvalds 已提交
655 656
			return XFS_ERROR(EFSCORRUPTED);
		}
657

L
Linus Torvalds 已提交
658
		sbp->entno = i;
659 660
		sbp->hash = xfs_da_hashname(sfe->nameval, sfe->namelen);
		sbp->name = sfe->nameval;
L
Linus Torvalds 已提交
661 662 663 664 665 666 667 668 669 670 671 672
		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.
	 */
673
	xfs_sort(sbuf, nsbuf, sizeof(*sbuf), xfs_attr_shortform_compare);
L
Linus Torvalds 已提交
674 675 676 677 678 679 680 681

	/*
	 * 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++) {
682
		if (sbp->hash == cursor->hashval) {
L
Linus Torvalds 已提交
683 684 685 686
			if (cursor->offset == count) {
				break;
			}
			count++;
687
		} else if (sbp->hash > cursor->hashval) {
L
Linus Torvalds 已提交
688 689 690 691
			break;
		}
	}
	if (i == nsbuf) {
692
		kmem_free(sbuf);
L
Linus Torvalds 已提交
693 694 695 696 697 698 699
		return(0);
	}

	/*
	 * Loop putting entries into the user buffer.
	 */
	for ( ; i < nsbuf; i++, sbp++) {
700 701
		if (cursor->hashval != sbp->hash) {
			cursor->hashval = sbp->hash;
L
Linus Torvalds 已提交
702 703
			cursor->offset = 0;
		}
704
		error = context->put_listent(context,
705
					sbp->flags,
706 707 708 709 710 711 712 713
					sbp->name,
					sbp->namelen,
					sbp->valuelen,
					&sbp->name[sbp->namelen]);
		if (error)
			return error;
		if (context->seen_enough)
			break;
L
Linus Torvalds 已提交
714 715 716
		cursor->offset++;
	}

717
	kmem_free(sbuf);
L
Linus Torvalds 已提交
718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733
	return(0);
}

/*
 * Check a leaf attribute block to see if all the entries would fit into
 * a shortform attribute list.
 */
int
xfs_attr_shortform_allfit(xfs_dabuf_t *bp, xfs_inode_t *dp)
{
	xfs_attr_leafblock_t *leaf;
	xfs_attr_leaf_entry_t *entry;
	xfs_attr_leaf_name_local_t *name_loc;
	int bytes, i;

	leaf = bp->data;
734
	ASSERT(be16_to_cpu(leaf->hdr.info.magic) == XFS_ATTR_LEAF_MAGIC);
L
Linus Torvalds 已提交
735 736 737

	entry = &leaf->entries[0];
	bytes = sizeof(struct xfs_attr_sf_hdr);
738
	for (i = 0; i < be16_to_cpu(leaf->hdr.count); entry++, i++) {
L
Linus Torvalds 已提交
739 740 741 742
		if (entry->flags & XFS_ATTR_INCOMPLETE)
			continue;		/* don't copy partial entries */
		if (!(entry->flags & XFS_ATTR_LOCAL))
			return(0);
743
		name_loc = xfs_attr_leaf_name_local(leaf, i);
L
Linus Torvalds 已提交
744 745
		if (name_loc->namelen >= XFS_ATTR_SF_ENTSIZE_MAX)
			return(0);
746
		if (be16_to_cpu(name_loc->valuelen) >= XFS_ATTR_SF_ENTSIZE_MAX)
L
Linus Torvalds 已提交
747 748 749
			return(0);
		bytes += sizeof(struct xfs_attr_sf_entry)-1
				+ name_loc->namelen
750
				+ be16_to_cpu(name_loc->valuelen);
L
Linus Torvalds 已提交
751
	}
752
	if ((dp->i_mount->m_flags & XFS_MOUNT_ATTR2) &&
753
	    (dp->i_d.di_format != XFS_DINODE_FMT_BTREE) &&
754
	    (bytes == sizeof(struct xfs_attr_sf_hdr)))
755 756
		return(-1);
	return(xfs_attr_shortform_bytesfit(dp, bytes));
L
Linus Torvalds 已提交
757 758 759 760 761 762
}

/*
 * Convert a leaf attribute list to shortform attribute list
 */
int
763
xfs_attr_leaf_to_shortform(xfs_dabuf_t *bp, xfs_da_args_t *args, int forkoff)
L
Linus Torvalds 已提交
764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779
{
	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;

	dp = args->dp;
	tmpbuffer = kmem_alloc(XFS_LBSIZE(dp->i_mount), KM_SLEEP);
	ASSERT(tmpbuffer != NULL);

	ASSERT(bp != NULL);
	memcpy(tmpbuffer, bp->data, XFS_LBSIZE(dp->i_mount));
	leaf = (xfs_attr_leafblock_t *)tmpbuffer;
780
	ASSERT(be16_to_cpu(leaf->hdr.info.magic) == XFS_ATTR_LEAF_MAGIC);
L
Linus Torvalds 已提交
781 782 783 784 785 786 787 788
	memset(bp->data, 0, XFS_LBSIZE(dp->i_mount));

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

	if (forkoff == -1) {
791
		ASSERT(dp->i_mount->m_flags & XFS_MOUNT_ATTR2);
792
		ASSERT(dp->i_d.di_format != XFS_DINODE_FMT_BTREE);
793
		xfs_attr_fork_reset(dp, args->trans);
L
Linus Torvalds 已提交
794
		goto out;
795 796 797
	}

	xfs_attr_shortform_create(args);
L
Linus Torvalds 已提交
798 799 800 801 802 803 804 805 806 807 808

	/*
	 * 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;
809
	nargs.op_flags = XFS_DA_OP_OKNOENT;
L
Linus Torvalds 已提交
810
	entry = &leaf->entries[0];
811
	for (i = 0; i < be16_to_cpu(leaf->hdr.count); entry++, i++) {
L
Linus Torvalds 已提交
812 813 814 815 816
		if (entry->flags & XFS_ATTR_INCOMPLETE)
			continue;	/* don't copy partial entries */
		if (!entry->nameidx)
			continue;
		ASSERT(entry->flags & XFS_ATTR_LOCAL);
817
		name_loc = xfs_attr_leaf_name_local(leaf, i);
818
		nargs.name = name_loc->nameval;
L
Linus Torvalds 已提交
819
		nargs.namelen = name_loc->namelen;
820
		nargs.value = &name_loc->nameval[nargs.namelen];
821
		nargs.valuelen = be16_to_cpu(name_loc->valuelen);
822
		nargs.hashval = be32_to_cpu(entry->hashval);
823
		nargs.flags = XFS_ATTR_NSP_ONDISK_TO_ARGS(entry->flags);
824
		xfs_attr_shortform_add(&nargs, forkoff);
L
Linus Torvalds 已提交
825 826 827 828
	}
	error = 0;

out:
829
	kmem_free(tmpbuffer);
L
Linus Torvalds 已提交
830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874
	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;
	xfs_dabuf_t *bp1, *bp2;
	xfs_dablk_t blkno;
	int error;

	dp = args->dp;
	bp1 = bp2 = NULL;
	error = xfs_da_grow_inode(args, &blkno);
	if (error)
		goto out;
	error = xfs_da_read_buf(args->trans, args->dp, 0, -1, &bp1,
					     XFS_ATTR_FORK);
	if (error)
		goto out;
	ASSERT(bp1 != NULL);
	bp2 = NULL;
	error = xfs_da_get_buf(args->trans, args->dp, blkno, -1, &bp2,
					    XFS_ATTR_FORK);
	if (error)
		goto out;
	ASSERT(bp2 != NULL);
	memcpy(bp2->data, bp1->data, XFS_LBSIZE(dp->i_mount));
	xfs_da_buf_done(bp1);
	bp1 = NULL;
	xfs_da_log_buf(args->trans, bp2, 0, XFS_LBSIZE(dp->i_mount) - 1);

	/*
	 * Set up the new root node.
	 */
	error = xfs_da_node_create(args, 0, 1, &bp1, XFS_ATTR_FORK);
	if (error)
		goto out;
	node = bp1->data;
	leaf = bp2->data;
875
	ASSERT(be16_to_cpu(leaf->hdr.info.magic) == XFS_ATTR_LEAF_MAGIC);
L
Linus Torvalds 已提交
876 877
	/* both on-disk, don't endian-flip twice */
	node->btree[0].hashval =
878
		leaf->entries[be16_to_cpu(leaf->hdr.count)-1 ].hashval;
879
	node->btree[0].before = cpu_to_be32(blkno);
880
	node->hdr.count = cpu_to_be16(1);
L
Linus Torvalds 已提交
881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899
	xfs_da_log_buf(args->trans, bp1, 0, XFS_LBSIZE(dp->i_mount) - 1);
	error = 0;
out:
	if (bp1)
		xfs_da_buf_done(bp1);
	if (bp2)
		xfs_da_buf_done(bp2);
	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.
 */
900
STATIC int
L
Linus Torvalds 已提交
901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918
xfs_attr_leaf_create(xfs_da_args_t *args, xfs_dablk_t blkno, xfs_dabuf_t **bpp)
{
	xfs_attr_leafblock_t *leaf;
	xfs_attr_leaf_hdr_t *hdr;
	xfs_inode_t *dp;
	xfs_dabuf_t *bp;
	int error;

	dp = args->dp;
	ASSERT(dp != NULL);
	error = xfs_da_get_buf(args->trans, args->dp, blkno, -1, &bp,
					    XFS_ATTR_FORK);
	if (error)
		return(error);
	ASSERT(bp != NULL);
	leaf = bp->data;
	memset((char *)leaf, 0, XFS_LBSIZE(dp->i_mount));
	hdr = &leaf->hdr;
919
	hdr->info.magic = cpu_to_be16(XFS_ATTR_LEAF_MAGIC);
920
	hdr->firstused = cpu_to_be16(XFS_LBSIZE(dp->i_mount));
L
Linus Torvalds 已提交
921
	if (!hdr->firstused) {
922
		hdr->firstused = cpu_to_be16(
L
Linus Torvalds 已提交
923 924 925
			XFS_LBSIZE(dp->i_mount) - XFS_ATTR_LEAF_NAME_ALIGN);
	}

926 927 928
	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 已提交
929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999

	xfs_da_log_buf(args->trans, bp, 0, XFS_LBSIZE(dp->i_mount) - 1);

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

	/*
	 * Allocate space for a new leaf node.
	 */
	ASSERT(oldblk->magic == XFS_ATTR_LEAF_MAGIC);
	error = xfs_da_grow_inode(state->args, &blkno);
	if (error)
		return(error);
	error = xfs_attr_leaf_create(state->args, blkno, &newblk->bp);
	if (error)
		return(error);
	newblk->blkno = blkno;
	newblk->magic = XFS_ATTR_LEAF_MAGIC;

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

	/*
	 * Save info on "old" attribute for "atomic rename" ops, leaf_add()
	 * modifies the index/blkno/rmtblk/rmtblkcnt fields to show the
	 * "new" attrs info.  Will need the "old" info to remove it later.
	 *
	 * Insert the "new" entry in the correct block.
	 */
	if (state->inleaf)
		error = xfs_attr_leaf_add(oldblk->bp, state->args);
	else
		error = xfs_attr_leaf_add(newblk->bp, state->args);

	/*
	 * 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
xfs_attr_leaf_add(xfs_dabuf_t *bp, xfs_da_args_t *args)
{
	xfs_attr_leafblock_t *leaf;
	xfs_attr_leaf_hdr_t *hdr;
	xfs_attr_leaf_map_t *map;
	int tablesize, entsize, sum, tmp, i;

	leaf = bp->data;
1000
	ASSERT(be16_to_cpu(leaf->hdr.info.magic) == XFS_ATTR_LEAF_MAGIC);
L
Linus Torvalds 已提交
1001
	ASSERT((args->index >= 0)
1002
		&& (args->index <= be16_to_cpu(leaf->hdr.count)));
L
Linus Torvalds 已提交
1003
	hdr = &leaf->hdr;
1004
	entsize = xfs_attr_leaf_newentsize(args->namelen, args->valuelen,
L
Linus Torvalds 已提交
1005 1006 1007 1008 1009 1010
			   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)
	 */
1011
	tablesize = (be16_to_cpu(hdr->count) + 1)
L
Linus Torvalds 已提交
1012 1013 1014 1015
					* 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--) {
1016 1017
		if (tablesize > be16_to_cpu(hdr->firstused)) {
			sum += be16_to_cpu(map->size);
L
Linus Torvalds 已提交
1018 1019 1020 1021 1022
			continue;
		}
		if (!map->size)
			continue;	/* no space in this map */
		tmp = entsize;
1023
		if (be16_to_cpu(map->base) < be16_to_cpu(hdr->firstused))
L
Linus Torvalds 已提交
1024
			tmp += sizeof(xfs_attr_leaf_entry_t);
1025
		if (be16_to_cpu(map->size) >= tmp) {
L
Linus Torvalds 已提交
1026 1027 1028
			tmp = xfs_attr_leaf_add_work(bp, args, i);
			return(tmp);
		}
1029
		sum += be16_to_cpu(map->size);
L
Linus Torvalds 已提交
1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049
	}

	/*
	 * 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.
	 */
	xfs_attr_leaf_compact(args->trans, bp);

	/*
	 * After compaction, the block is guaranteed to have only one
	 * free region, in freemap[0].  If it is not big enough, give up.
	 */
1050
	if (be16_to_cpu(hdr->freemap[0].size)
L
Linus Torvalds 已提交
1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072
				< (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
xfs_attr_leaf_add_work(xfs_dabuf_t *bp, xfs_da_args_t *args, int mapindex)
{
	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;

	leaf = bp->data;
1073
	ASSERT(be16_to_cpu(leaf->hdr.info.magic) == XFS_ATTR_LEAF_MAGIC);
L
Linus Torvalds 已提交
1074 1075
	hdr = &leaf->hdr;
	ASSERT((mapindex >= 0) && (mapindex < XFS_ATTR_LEAF_MAPSIZE));
1076
	ASSERT((args->index >= 0) && (args->index <= be16_to_cpu(hdr->count)));
L
Linus Torvalds 已提交
1077 1078 1079 1080 1081

	/*
	 * Force open some space in the entry array and fill it in.
	 */
	entry = &leaf->entries[args->index];
1082 1083
	if (args->index < be16_to_cpu(hdr->count)) {
		tmp  = be16_to_cpu(hdr->count) - args->index;
L
Linus Torvalds 已提交
1084 1085 1086 1087 1088
		tmp *= sizeof(xfs_attr_leaf_entry_t);
		memmove((char *)(entry+1), (char *)entry, tmp);
		xfs_da_log_buf(args->trans, bp,
		    XFS_DA_LOGRANGE(leaf, entry, tmp + sizeof(*entry)));
	}
1089
	be16_add_cpu(&hdr->count, 1);
L
Linus Torvalds 已提交
1090 1091 1092 1093 1094 1095

	/*
	 * Allocate space for the new string (at the end of the run).
	 */
	map = &hdr->freemap[mapindex];
	mp = args->trans->t_mountp;
1096 1097 1098
	ASSERT(be16_to_cpu(map->base) < XFS_LBSIZE(mp));
	ASSERT((be16_to_cpu(map->base) & 0x3) == 0);
	ASSERT(be16_to_cpu(map->size) >=
1099 1100
		xfs_attr_leaf_newentsize(args->namelen, args->valuelen,
					 mp->m_sb.sb_blocksize, NULL));
1101 1102
	ASSERT(be16_to_cpu(map->size) < XFS_LBSIZE(mp));
	ASSERT((be16_to_cpu(map->size) & 0x3) == 0);
1103
	be16_add_cpu(&map->size,
1104 1105
		-xfs_attr_leaf_newentsize(args->namelen, args->valuelen,
					  mp->m_sb.sb_blocksize, &tmp));
1106 1107 1108
	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 已提交
1109
	entry->flags = tmp ? XFS_ATTR_LOCAL : 0;
1110
	entry->flags |= XFS_ATTR_NSP_ARGS_TO_ONDISK(args->flags);
1111
	if (args->op_flags & XFS_DA_OP_RENAME) {
L
Linus Torvalds 已提交
1112 1113 1114 1115 1116 1117 1118 1119
		entry->flags |= XFS_ATTR_INCOMPLETE;
		if ((args->blkno2 == args->blkno) &&
		    (args->index2 <= args->index)) {
			args->index2++;
		}
	}
	xfs_da_log_buf(args->trans, bp,
			  XFS_DA_LOGRANGE(leaf, entry, sizeof(*entry)));
1120 1121
	ASSERT((args->index == 0) ||
	       (be32_to_cpu(entry->hashval) >= be32_to_cpu((entry-1)->hashval)));
1122
	ASSERT((args->index == be16_to_cpu(hdr->count)-1) ||
1123
	       (be32_to_cpu(entry->hashval) <= be32_to_cpu((entry+1)->hashval)));
L
Linus Torvalds 已提交
1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134

	/*
	 * Copy the attribute name and value into the new space.
	 *
	 * 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) {
1135
		name_loc = xfs_attr_leaf_name_local(leaf, args->index);
L
Linus Torvalds 已提交
1136
		name_loc->namelen = args->namelen;
1137
		name_loc->valuelen = cpu_to_be16(args->valuelen);
L
Linus Torvalds 已提交
1138 1139
		memcpy((char *)name_loc->nameval, args->name, args->namelen);
		memcpy((char *)&name_loc->nameval[args->namelen], args->value,
1140
				   be16_to_cpu(name_loc->valuelen));
L
Linus Torvalds 已提交
1141
	} else {
1142
		name_rmt = xfs_attr_leaf_name_remote(leaf, args->index);
L
Linus Torvalds 已提交
1143 1144 1145 1146 1147 1148 1149 1150 1151 1152
		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);
	}
	xfs_da_log_buf(args->trans, bp,
1153
	     XFS_DA_LOGRANGE(leaf, xfs_attr_leaf_name(leaf, args->index),
L
Linus Torvalds 已提交
1154 1155 1156 1157 1158
				   xfs_attr_leaf_entsize(leaf, args->index)));

	/*
	 * Update the control info for this leaf node
	 */
1159
	if (be16_to_cpu(entry->nameidx) < be16_to_cpu(hdr->firstused)) {
L
Linus Torvalds 已提交
1160 1161 1162
		/* both on-disk, don't endian-flip twice */
		hdr->firstused = entry->nameidx;
	}
1163 1164 1165
	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 已提交
1166 1167 1168
					+ sizeof(xfs_attr_leaf_hdr_t);
	map = &hdr->freemap[0];
	for (i = 0; i < XFS_ATTR_LEAF_MAPSIZE; map++, i++) {
1169
		if (be16_to_cpu(map->base) == tmp) {
1170 1171
			be16_add_cpu(&map->base, sizeof(xfs_attr_leaf_entry_t));
			be16_add_cpu(&map->size,
1172
				 -((int)sizeof(xfs_attr_leaf_entry_t)));
L
Linus Torvalds 已提交
1173 1174
		}
	}
1175
	be16_add_cpu(&hdr->usedbytes, xfs_attr_leaf_entsize(leaf, args->index));
L
Linus Torvalds 已提交
1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205
	xfs_da_log_buf(args->trans, bp,
		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
xfs_attr_leaf_compact(xfs_trans_t *trans, xfs_dabuf_t *bp)
{
	xfs_attr_leafblock_t *leaf_s, *leaf_d;
	xfs_attr_leaf_hdr_t *hdr_s, *hdr_d;
	xfs_mount_t *mp;
	char *tmpbuffer;

	mp = trans->t_mountp;
	tmpbuffer = kmem_alloc(XFS_LBSIZE(mp), KM_SLEEP);
	ASSERT(tmpbuffer != NULL);
	memcpy(tmpbuffer, bp->data, XFS_LBSIZE(mp));
	memset(bp->data, 0, XFS_LBSIZE(mp));

	/*
	 * Copy basic information
	 */
	leaf_s = (xfs_attr_leafblock_t *)tmpbuffer;
	leaf_d = bp->data;
	hdr_s = &leaf_s->hdr;
	hdr_d = &leaf_d->hdr;
	hdr_d->info = hdr_s->info;	/* struct copy */
1206
	hdr_d->firstused = cpu_to_be16(XFS_LBSIZE(mp));
L
Linus Torvalds 已提交
1207 1208
	/* handle truncation gracefully */
	if (!hdr_d->firstused) {
1209
		hdr_d->firstused = cpu_to_be16(
L
Linus Torvalds 已提交
1210 1211 1212 1213 1214
				XFS_LBSIZE(mp) - XFS_ATTR_LEAF_NAME_ALIGN);
	}
	hdr_d->usedbytes = 0;
	hdr_d->count = 0;
	hdr_d->holes = 0;
1215 1216 1217
	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 已提交
1218 1219 1220 1221 1222 1223

	/*
	 * 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,
1224
				be16_to_cpu(hdr_s->count), mp);
L
Linus Torvalds 已提交
1225 1226
	xfs_da_log_buf(trans, bp, 0, XFS_LBSIZE(mp) - 1);

1227
	kmem_free(tmpbuffer);
L
Linus Torvalds 已提交
1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258
}

/*
 * 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);
	leaf1 = blk1->bp->data;
	leaf2 = blk2->bp->data;
1259 1260
	ASSERT(be16_to_cpu(leaf1->hdr.info.magic) == XFS_ATTR_LEAF_MAGIC);
	ASSERT(be16_to_cpu(leaf2->hdr.info.magic) == XFS_ATTR_LEAF_MAGIC);
L
Linus Torvalds 已提交
1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296
	args = state->args;

	/*
	 * 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;
		leaf1 = blk1->bp->data;
		leaf2 = blk2->bp->data;
		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:
	 */
1297
	if (count < be16_to_cpu(hdr1->count)) {
L
Linus Torvalds 已提交
1298 1299 1300 1301
		/*
		 * Figure the total bytes to be added to the destination leaf.
		 */
		/* number entries being moved */
1302 1303
		count = be16_to_cpu(hdr1->count) - count;
		space  = be16_to_cpu(hdr1->usedbytes) - totallen;
L
Linus Torvalds 已提交
1304 1305 1306 1307 1308
		space += count * sizeof(xfs_attr_leaf_entry_t);

		/*
		 * leaf2 is the destination, compact it if it looks tight.
		 */
1309
		max  = be16_to_cpu(hdr2->firstused)
L
Linus Torvalds 已提交
1310
						- sizeof(xfs_attr_leaf_hdr_t);
1311
		max -= be16_to_cpu(hdr2->count) * sizeof(xfs_attr_leaf_entry_t);
L
Linus Torvalds 已提交
1312 1313 1314 1315 1316 1317 1318
		if (space > max) {
			xfs_attr_leaf_compact(args->trans, blk2->bp);
		}

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

		xfs_da_log_buf(args->trans, blk1->bp, 0, state->blocksize-1);
		xfs_da_log_buf(args->trans, blk2->bp, 0, state->blocksize-1);
1324
	} else if (count > be16_to_cpu(hdr1->count)) {
L
Linus Torvalds 已提交
1325 1326 1327 1328 1329 1330 1331 1332 1333
		/*
		 * I assert that since all callers pass in an empty
		 * second buffer, this code should never execute.
		 */

		/*
		 * Figure the total bytes to be added to the destination leaf.
		 */
		/* number entries being moved */
1334 1335
		count -= be16_to_cpu(hdr1->count);
		space  = totallen - be16_to_cpu(hdr1->usedbytes);
L
Linus Torvalds 已提交
1336 1337 1338 1339 1340
		space += count * sizeof(xfs_attr_leaf_entry_t);

		/*
		 * leaf1 is the destination, compact it if it looks tight.
		 */
1341
		max  = be16_to_cpu(hdr1->firstused)
L
Linus Torvalds 已提交
1342
						- sizeof(xfs_attr_leaf_hdr_t);
1343
		max -= be16_to_cpu(hdr1->count) * sizeof(xfs_attr_leaf_entry_t);
L
Linus Torvalds 已提交
1344 1345 1346 1347 1348 1349 1350 1351
		if (space > max) {
			xfs_attr_leaf_compact(args->trans, blk1->bp);
		}

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

		xfs_da_log_buf(args->trans, blk1->bp, 0, state->blocksize-1);
		xfs_da_log_buf(args->trans, blk2->bp, 0, state->blocksize-1);
	}

	/*
	 * Copy out last hashval in each block for B-tree code.
	 */
1361 1362 1363 1364
	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 已提交
1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377

	/*
	 * 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.
	 */
1378
	if (blk1->index > be16_to_cpu(leaf1->hdr.count)) {
L
Linus Torvalds 已提交
1379
		ASSERT(state->inleaf == 0);
1380
		blk2->index = blk1->index - be16_to_cpu(leaf1->hdr.count);
L
Linus Torvalds 已提交
1381 1382
		args->index = args->index2 = blk2->index;
		args->blkno = args->blkno2 = blk2->blkno;
1383
	} else if (blk1->index == be16_to_cpu(leaf1->hdr.count)) {
L
Linus Torvalds 已提交
1384 1385 1386 1387 1388 1389 1390
		if (state->inleaf) {
			args->index = blk1->index;
			args->blkno = blk1->blkno;
			args->index2 = 0;
			args->blkno2 = blk2->blkno;
		} else {
			blk2->index = blk1->index
1391
				    - be16_to_cpu(leaf1->hdr.count);
L
Linus Torvalds 已提交
1392 1393 1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434
			args->index = args->index2 = blk2->index;
			args->blkno = args->blkno2 = blk2->blkno;
		}
	} 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.
	 */
	leaf1 = blk1->bp->data;
	leaf2 = blk2->bp->data;
	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.
	 */
1435
	max = be16_to_cpu(hdr1->count) + be16_to_cpu(hdr2->count);
L
Linus Torvalds 已提交
1436
	half  = (max+1) * sizeof(*entry);
1437 1438 1439 1440 1441 1442
	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 已提交
1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 1453
	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) +
1454 1455 1456 1457
				xfs_attr_leaf_newentsize(
						state->args->namelen,
						state->args->valuelen,
						state->blocksize, NULL);
L
Linus Torvalds 已提交
1458 1459 1460 1461 1462 1463 1464 1465 1466 1467
			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.
		 */
1468
		if (count == be16_to_cpu(hdr1->count)) {
L
Linus Torvalds 已提交
1469 1470 1471 1472 1473 1474 1475 1476 1477 1478 1479 1480 1481 1482 1483 1484 1485 1486 1487 1488 1489 1490 1491 1492
			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) +
1493 1494 1495 1496
				xfs_attr_leaf_newentsize(
						state->args->namelen,
						state->args->valuelen,
						state->blocksize, NULL);
L
Linus Torvalds 已提交
1497 1498 1499 1500 1501 1502 1503 1504 1505 1506 1507 1508 1509 1510 1511 1512 1513 1514 1515 1516 1517 1518 1519 1520 1521 1522 1523 1524 1525 1526 1527 1528 1529 1530 1531 1532 1533 1534 1535
	}

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

	/*
	 * 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 ];
	info = blk->bp->data;
1536
	ASSERT(be16_to_cpu(info->magic) == XFS_ATTR_LEAF_MAGIC);
L
Linus Torvalds 已提交
1537
	leaf = (xfs_attr_leafblock_t *)info;
1538
	count = be16_to_cpu(leaf->hdr.count);
L
Linus Torvalds 已提交
1539 1540
	bytes = sizeof(xfs_attr_leaf_hdr_t) +
		count * sizeof(xfs_attr_leaf_entry_t) +
1541
		be16_to_cpu(leaf->hdr.usedbytes);
L
Linus Torvalds 已提交
1542 1543 1544 1545 1546 1547 1548 1549
	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
1550
	 * coalesce it with a sibling block.  We choose (arbitrarily)
L
Linus Torvalds 已提交
1551 1552 1553 1554 1555 1556 1557
	 * 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).
		 */
1558
		forward = (info->forw != 0);
L
Linus Torvalds 已提交
1559 1560 1561 1562 1563 1564 1565 1566 1567 1568 1569 1570 1571 1572 1573 1574 1575 1576 1577 1578 1579
		memcpy(&state->altpath, &state->path, sizeof(state->path));
		error = xfs_da_path_shift(state, &state->altpath, forward,
						 0, &retval);
		if (error)
			return(error);
		if (retval) {
			*action = 0;
		} else {
			*action = 2;
		}
		return(0);
	}

	/*
	 * Examine each sibling block to see if we can coalesce with
	 * at least 25% free space to spare.  We need to figure out
	 * whether to merge with the forward or the backward block.
	 * We prefer coalescing with the lower numbered sibling so as
	 * to shrink an attribute list over time.
	 */
	/* start with smaller blk num */
1580
	forward = (be32_to_cpu(info->forw) < be32_to_cpu(info->back));
L
Linus Torvalds 已提交
1581 1582
	for (i = 0; i < 2; forward = !forward, i++) {
		if (forward)
1583
			blkno = be32_to_cpu(info->forw);
L
Linus Torvalds 已提交
1584
		else
1585
			blkno = be32_to_cpu(info->back);
L
Linus Torvalds 已提交
1586 1587 1588 1589 1590 1591 1592 1593 1594
		if (blkno == 0)
			continue;
		error = xfs_da_read_buf(state->args->trans, state->args->dp,
					blkno, -1, &bp, XFS_ATTR_FORK);
		if (error)
			return(error);
		ASSERT(bp != NULL);

		leaf = (xfs_attr_leafblock_t *)info;
1595
		count  = be16_to_cpu(leaf->hdr.count);
L
Linus Torvalds 已提交
1596
		bytes  = state->blocksize - (state->blocksize>>2);
1597
		bytes -= be16_to_cpu(leaf->hdr.usedbytes);
L
Linus Torvalds 已提交
1598
		leaf = bp->data;
1599
		ASSERT(be16_to_cpu(leaf->hdr.info.magic) == XFS_ATTR_LEAF_MAGIC);
1600 1601
		count += be16_to_cpu(leaf->hdr.count);
		bytes -= be16_to_cpu(leaf->hdr.usedbytes);
L
Linus Torvalds 已提交
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 1629 1630 1631 1632 1633 1634 1635 1636 1637 1638 1639 1640 1641 1642 1643 1644 1645 1646 1647 1648 1649 1650 1651 1652
		bytes -= count * sizeof(xfs_attr_leaf_entry_t);
		bytes -= sizeof(xfs_attr_leaf_hdr_t);
		xfs_da_brelse(state->args->trans, bp);
		if (bytes >= 0)
			break;	/* fits with at least 25% to spare */
	}
	if (i >= 2) {
		*action = 0;
		return(0);
	}

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

/*
 * Remove a name from the leaf attribute list structure.
 *
 * Return 1 if leaf is less than 37% full, 0 if >= 37% full.
 * If two leaves are 37% full, when combined they will leave 25% free.
 */
int
xfs_attr_leaf_remove(xfs_dabuf_t *bp, xfs_da_args_t *args)
{
	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;

	leaf = bp->data;
1653
	ASSERT(be16_to_cpu(leaf->hdr.info.magic) == XFS_ATTR_LEAF_MAGIC);
L
Linus Torvalds 已提交
1654 1655
	hdr = &leaf->hdr;
	mp = args->trans->t_mountp;
1656 1657
	ASSERT((be16_to_cpu(hdr->count) > 0)
		&& (be16_to_cpu(hdr->count) < (XFS_LBSIZE(mp)/8)));
L
Linus Torvalds 已提交
1658
	ASSERT((args->index >= 0)
1659 1660 1661
		&& (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 已提交
1662
	entry = &leaf->entries[args->index];
1663 1664
	ASSERT(be16_to_cpu(entry->nameidx) >= be16_to_cpu(hdr->firstused));
	ASSERT(be16_to_cpu(entry->nameidx) < XFS_LBSIZE(mp));
L
Linus Torvalds 已提交
1665 1666 1667 1668 1669 1670 1671

	/*
	 * 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,
	 */
1672
	tablesize = be16_to_cpu(hdr->count) * sizeof(xfs_attr_leaf_entry_t)
L
Linus Torvalds 已提交
1673 1674
					+ sizeof(xfs_attr_leaf_hdr_t);
	map = &hdr->freemap[0];
1675
	tmp = be16_to_cpu(map->size);
L
Linus Torvalds 已提交
1676 1677 1678 1679
	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++) {
1680 1681 1682
		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) {
1683
			be16_add_cpu(&map->base,
1684
				 -((int)sizeof(xfs_attr_leaf_entry_t)));
1685
			be16_add_cpu(&map->size, sizeof(xfs_attr_leaf_entry_t));
L
Linus Torvalds 已提交
1686 1687
		}

1688
		if ((be16_to_cpu(map->base) + be16_to_cpu(map->size))
1689
				== be16_to_cpu(entry->nameidx)) {
L
Linus Torvalds 已提交
1690
			before = i;
1691
		} else if (be16_to_cpu(map->base)
1692
			== (be16_to_cpu(entry->nameidx) + entsize)) {
L
Linus Torvalds 已提交
1693
			after = i;
1694 1695
		} else if (be16_to_cpu(map->size) < tmp) {
			tmp = be16_to_cpu(map->size);
L
Linus Torvalds 已提交
1696 1697 1698 1699 1700 1701 1702 1703 1704 1705 1706
			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];
1707 1708
			be16_add_cpu(&map->size, entsize);
			be16_add_cpu(&map->size,
1709
				 be16_to_cpu(hdr->freemap[after].size));
L
Linus Torvalds 已提交
1710 1711 1712 1713
			hdr->freemap[after].base = 0;
			hdr->freemap[after].size = 0;
		} else if (before >= 0) {
			map = &hdr->freemap[before];
1714
			be16_add_cpu(&map->size, entsize);
L
Linus Torvalds 已提交
1715 1716 1717 1718
		} else {
			map = &hdr->freemap[after];
			/* both on-disk, don't endian flip twice */
			map->base = entry->nameidx;
1719
			be16_add_cpu(&map->size, entsize);
L
Linus Torvalds 已提交
1720 1721 1722 1723 1724 1725
		}
	} else {
		/*
		 * Replace smallest region (if it is smaller than free'd entry)
		 */
		map = &hdr->freemap[smallest];
1726
		if (be16_to_cpu(map->size) < entsize) {
1727
			map->base = cpu_to_be16(be16_to_cpu(entry->nameidx));
1728
			map->size = cpu_to_be16(entsize);
L
Linus Torvalds 已提交
1729 1730 1731 1732 1733 1734
		}
	}

	/*
	 * Did we remove the first entry?
	 */
1735
	if (be16_to_cpu(entry->nameidx) == be16_to_cpu(hdr->firstused))
L
Linus Torvalds 已提交
1736 1737 1738 1739 1740 1741 1742
		smallest = 1;
	else
		smallest = 0;

	/*
	 * Compress the remaining entries and zero out the removed stuff.
	 */
1743
	memset(xfs_attr_leaf_name(leaf, args->index), 0, entsize);
1744
	be16_add_cpu(&hdr->usedbytes, -entsize);
L
Linus Torvalds 已提交
1745
	xfs_da_log_buf(args->trans, bp,
1746
	     XFS_DA_LOGRANGE(leaf, xfs_attr_leaf_name(leaf, args->index),
L
Linus Torvalds 已提交
1747 1748
				   entsize));

1749
	tmp = (be16_to_cpu(hdr->count) - args->index)
L
Linus Torvalds 已提交
1750 1751
					* sizeof(xfs_attr_leaf_entry_t);
	memmove((char *)entry, (char *)(entry+1), tmp);
1752
	be16_add_cpu(&hdr->count, -1);
L
Linus Torvalds 已提交
1753 1754
	xfs_da_log_buf(args->trans, bp,
	    XFS_DA_LOGRANGE(leaf, entry, tmp + sizeof(*entry)));
1755
	entry = &leaf->entries[be16_to_cpu(hdr->count)];
L
Linus Torvalds 已提交
1756 1757 1758 1759 1760 1761 1762 1763 1764 1765 1766
	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];
1767
		for (i = be16_to_cpu(hdr->count)-1; i >= 0; entry++, i--) {
1768 1769 1770 1771 1772 1773
			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 已提交
1774
		}
1775
		hdr->firstused = cpu_to_be16(tmp);
L
Linus Torvalds 已提交
1776
		if (!hdr->firstused) {
1777
			hdr->firstused = cpu_to_be16(
L
Linus Torvalds 已提交
1778 1779 1780 1781 1782 1783 1784 1785 1786 1787 1788 1789 1790
					tmp - XFS_ATTR_LEAF_NAME_ALIGN);
		}
	} else {
		hdr->holes = 1;		/* mark as needing compaction */
	}
	xfs_da_log_buf(args->trans, bp,
			  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);
1791 1792
	tmp += be16_to_cpu(leaf->hdr.count) * sizeof(xfs_attr_leaf_entry_t);
	tmp += be16_to_cpu(leaf->hdr.usedbytes);
L
Linus Torvalds 已提交
1793 1794 1795 1796 1797 1798 1799 1800 1801 1802 1803 1804 1805 1806 1807 1808 1809 1810 1811 1812 1813 1814 1815
	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;

	/*
	 * Set up environment.
	 */
	mp = state->mp;
	ASSERT(drop_blk->magic == XFS_ATTR_LEAF_MAGIC);
	ASSERT(save_blk->magic == XFS_ATTR_LEAF_MAGIC);
	drop_leaf = drop_blk->bp->data;
	save_leaf = save_blk->bp->data;
1816 1817
	ASSERT(be16_to_cpu(drop_leaf->hdr.info.magic) == XFS_ATTR_LEAF_MAGIC);
	ASSERT(be16_to_cpu(save_leaf->hdr.info.magic) == XFS_ATTR_LEAF_MAGIC);
L
Linus Torvalds 已提交
1818 1819 1820 1821 1822 1823
	drop_hdr = &drop_leaf->hdr;
	save_hdr = &save_leaf->hdr;

	/*
	 * Save last hashval from dying block for later Btree fixup.
	 */
1824 1825
	drop_blk->hashval = be32_to_cpu(
		drop_leaf->entries[be16_to_cpu(drop_leaf->hdr.count)-1].hashval);
L
Linus Torvalds 已提交
1826 1827 1828 1829 1830 1831 1832 1833 1834 1835 1836 1837 1838

	/*
	 * 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,
1839
			     be16_to_cpu(drop_hdr->count), mp);
L
Linus Torvalds 已提交
1840 1841
		} else {
			xfs_attr_leaf_moveents(drop_leaf, 0, save_leaf,
1842 1843
				  be16_to_cpu(save_hdr->count),
				  be16_to_cpu(drop_hdr->count), mp);
L
Linus Torvalds 已提交
1844 1845 1846 1847 1848 1849 1850 1851 1852 1853 1854 1855 1856
		}
	} 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;
1857
		tmp_hdr->firstused = cpu_to_be16(state->blocksize);
L
Linus Torvalds 已提交
1858
		if (!tmp_hdr->firstused) {
1859
			tmp_hdr->firstused = cpu_to_be16(
L
Linus Torvalds 已提交
1860 1861 1862 1863 1864
				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,
1865
				be16_to_cpu(drop_hdr->count), mp);
L
Linus Torvalds 已提交
1866
			xfs_attr_leaf_moveents(save_leaf, 0, tmp_leaf,
1867 1868
				  be16_to_cpu(tmp_leaf->hdr.count),
				  be16_to_cpu(save_hdr->count), mp);
L
Linus Torvalds 已提交
1869 1870
		} else {
			xfs_attr_leaf_moveents(save_leaf, 0, tmp_leaf, 0,
1871
				be16_to_cpu(save_hdr->count), mp);
L
Linus Torvalds 已提交
1872
			xfs_attr_leaf_moveents(drop_leaf, 0, tmp_leaf,
1873 1874
				be16_to_cpu(tmp_leaf->hdr.count),
				be16_to_cpu(drop_hdr->count), mp);
L
Linus Torvalds 已提交
1875 1876
		}
		memcpy((char *)save_leaf, (char *)tmp_leaf, state->blocksize);
1877
		kmem_free(tmpbuffer);
L
Linus Torvalds 已提交
1878 1879 1880 1881 1882 1883 1884 1885
	}

	xfs_da_log_buf(state->args->trans, save_blk->bp, 0,
					   state->blocksize - 1);

	/*
	 * Copy out last hashval in each block for B-tree code.
	 */
1886 1887
	save_blk->hashval = be32_to_cpu(
		save_leaf->entries[be16_to_cpu(save_leaf->hdr.count)-1].hashval);
L
Linus Torvalds 已提交
1888 1889 1890 1891 1892 1893 1894 1895 1896 1897 1898 1899 1900 1901 1902 1903 1904 1905 1906 1907 1908 1909 1910 1911 1912 1913 1914 1915 1916 1917
}

/*========================================================================
 * 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
xfs_attr_leaf_lookup_int(xfs_dabuf_t *bp, xfs_da_args_t *args)
{
	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;

	leaf = bp->data;
1918
	ASSERT(be16_to_cpu(leaf->hdr.info.magic) == XFS_ATTR_LEAF_MAGIC);
1919
	ASSERT(be16_to_cpu(leaf->hdr.count)
L
Linus Torvalds 已提交
1920 1921 1922 1923 1924 1925
					< (XFS_LBSIZE(args->dp->i_mount)/8));

	/*
	 * Binary search.  (note: small blocks will skip this loop)
	 */
	hashval = args->hashval;
1926
	probe = span = be16_to_cpu(leaf->hdr.count) / 2;
L
Linus Torvalds 已提交
1927 1928 1929
	for (entry = &leaf->entries[probe]; span > 4;
		   entry = &leaf->entries[probe]) {
		span /= 2;
1930
		if (be32_to_cpu(entry->hashval) < hashval)
L
Linus Torvalds 已提交
1931
			probe += span;
1932
		else if (be32_to_cpu(entry->hashval) > hashval)
L
Linus Torvalds 已提交
1933 1934 1935 1936
			probe -= span;
		else
			break;
	}
1937
	ASSERT((probe >= 0) &&
L
Linus Torvalds 已提交
1938
	       (!leaf->hdr.count
1939
	       || (probe < be16_to_cpu(leaf->hdr.count))));
1940
	ASSERT((span <= 4) || (be32_to_cpu(entry->hashval) == hashval));
L
Linus Torvalds 已提交
1941 1942 1943 1944 1945

	/*
	 * Since we may have duplicate hashval's, find the first matching
	 * hashval in the leaf.
	 */
1946
	while ((probe > 0) && (be32_to_cpu(entry->hashval) >= hashval)) {
L
Linus Torvalds 已提交
1947 1948 1949
		entry--;
		probe--;
	}
1950 1951
	while ((probe < be16_to_cpu(leaf->hdr.count)) &&
	       (be32_to_cpu(entry->hashval) < hashval)) {
L
Linus Torvalds 已提交
1952 1953 1954
		entry++;
		probe++;
	}
1955 1956
	if ((probe == be16_to_cpu(leaf->hdr.count)) ||
	    (be32_to_cpu(entry->hashval) != hashval)) {
L
Linus Torvalds 已提交
1957 1958 1959 1960 1961 1962 1963
		args->index = probe;
		return(XFS_ERROR(ENOATTR));
	}

	/*
	 * Duplicate keys may be present, so search all of them for a match.
	 */
1964 1965
	for (  ; (probe < be16_to_cpu(leaf->hdr.count)) &&
			(be32_to_cpu(entry->hashval) == hashval);
L
Linus Torvalds 已提交
1966 1967 1968 1969 1970 1971 1972 1973 1974 1975 1976 1977 1978
			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) {
1979
			name_loc = xfs_attr_leaf_name_local(leaf, probe);
L
Linus Torvalds 已提交
1980 1981
			if (name_loc->namelen != args->namelen)
				continue;
1982
			if (memcmp(args->name, (char *)name_loc->nameval, args->namelen) != 0)
L
Linus Torvalds 已提交
1983
				continue;
1984
			if (!xfs_attr_namesp_match(args->flags, entry->flags))
L
Linus Torvalds 已提交
1985 1986 1987 1988
				continue;
			args->index = probe;
			return(XFS_ERROR(EEXIST));
		} else {
1989
			name_rmt = xfs_attr_leaf_name_remote(leaf, probe);
L
Linus Torvalds 已提交
1990 1991 1992 1993 1994
			if (name_rmt->namelen != args->namelen)
				continue;
			if (memcmp(args->name, (char *)name_rmt->name,
					     args->namelen) != 0)
				continue;
1995
			if (!xfs_attr_namesp_match(args->flags, entry->flags))
L
Linus Torvalds 已提交
1996 1997
				continue;
			args->index = probe;
1998
			args->rmtblkno = be32_to_cpu(name_rmt->valueblk);
L
Linus Torvalds 已提交
1999
			args->rmtblkcnt = XFS_B_TO_FSB(args->dp->i_mount,
2000
						   be32_to_cpu(name_rmt->valuelen));
L
Linus Torvalds 已提交
2001 2002 2003 2004 2005 2006 2007 2008 2009 2010 2011 2012 2013 2014 2015 2016 2017 2018 2019 2020 2021
			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
xfs_attr_leaf_getvalue(xfs_dabuf_t *bp, xfs_da_args_t *args)
{
	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;

	leaf = bp->data;
2022
	ASSERT(be16_to_cpu(leaf->hdr.info.magic) == XFS_ATTR_LEAF_MAGIC);
2023
	ASSERT(be16_to_cpu(leaf->hdr.count)
L
Linus Torvalds 已提交
2024
					< (XFS_LBSIZE(args->dp->i_mount)/8));
2025
	ASSERT(args->index < be16_to_cpu(leaf->hdr.count));
L
Linus Torvalds 已提交
2026 2027 2028

	entry = &leaf->entries[args->index];
	if (entry->flags & XFS_ATTR_LOCAL) {
2029
		name_loc = xfs_attr_leaf_name_local(leaf, args->index);
L
Linus Torvalds 已提交
2030 2031
		ASSERT(name_loc->namelen == args->namelen);
		ASSERT(memcmp(args->name, name_loc->nameval, args->namelen) == 0);
2032
		valuelen = be16_to_cpu(name_loc->valuelen);
L
Linus Torvalds 已提交
2033 2034 2035 2036 2037 2038 2039 2040 2041 2042 2043
		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 {
2044
		name_rmt = xfs_attr_leaf_name_remote(leaf, args->index);
L
Linus Torvalds 已提交
2045 2046
		ASSERT(name_rmt->namelen == args->namelen);
		ASSERT(memcmp(args->name, name_rmt->name, args->namelen) == 0);
2047 2048
		valuelen = be32_to_cpu(name_rmt->valuelen);
		args->rmtblkno = be32_to_cpu(name_rmt->valueblk);
L
Linus Torvalds 已提交
2049 2050 2051 2052 2053 2054 2055 2056 2057 2058 2059 2060 2061 2062 2063 2064 2065 2066 2067 2068 2069 2070 2071 2072 2073 2074 2075 2076 2077 2078 2079 2080 2081 2082 2083 2084 2085 2086 2087 2088 2089
		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.
	 */
2090 2091
	ASSERT(be16_to_cpu(leaf_s->hdr.info.magic) == XFS_ATTR_LEAF_MAGIC);
	ASSERT(be16_to_cpu(leaf_d->hdr.info.magic) == XFS_ATTR_LEAF_MAGIC);
L
Linus Torvalds 已提交
2092 2093
	hdr_s = &leaf_s->hdr;
	hdr_d = &leaf_d->hdr;
2094 2095 2096 2097
	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 已提交
2098
					* sizeof(*entry_s))+sizeof(*hdr_s)));
2099 2100 2101
	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 已提交
2102 2103
					* sizeof(*entry_d))+sizeof(*hdr_d)));

2104 2105 2106
	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 已提交
2107 2108 2109 2110

	/*
	 * Move the entries in the destination leaf up to make a hole?
	 */
2111 2112
	if (start_d < be16_to_cpu(hdr_d->count)) {
		tmp  = be16_to_cpu(hdr_d->count) - start_d;
L
Linus Torvalds 已提交
2113 2114 2115 2116 2117 2118 2119 2120 2121 2122 2123 2124 2125 2126
		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++) {
2127
		ASSERT(be16_to_cpu(entry_s->nameidx)
2128
				>= be16_to_cpu(hdr_s->firstused));
L
Linus Torvalds 已提交
2129 2130 2131 2132 2133 2134 2135 2136
		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? */
2137
			memset(xfs_attr_leaf_name(leaf_s, start_s + i), 0, tmp);
2138 2139
			be16_add_cpu(&hdr_s->usedbytes, -tmp);
			be16_add_cpu(&hdr_s->count, -1);
L
Linus Torvalds 已提交
2140 2141 2142 2143 2144 2145
			entry_d--;	/* to compensate for ++ in loop hdr */
			desti--;
			if ((start_s + i) < offset)
				result++;	/* insertion index adjustment */
		} else {
#endif /* GROT */
2146
			be16_add_cpu(&hdr_d->firstused, -tmp);
L
Linus Torvalds 已提交
2147 2148 2149 2150 2151
			/* 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;
2152
			ASSERT(be16_to_cpu(entry_d->nameidx) + tmp
L
Linus Torvalds 已提交
2153
							<= XFS_LBSIZE(mp));
2154 2155
			memmove(xfs_attr_leaf_name(leaf_d, desti),
				xfs_attr_leaf_name(leaf_s, start_s + i), tmp);
2156
			ASSERT(be16_to_cpu(entry_s->nameidx) + tmp
L
Linus Torvalds 已提交
2157
							<= XFS_LBSIZE(mp));
2158
			memset(xfs_attr_leaf_name(leaf_s, start_s + i), 0, tmp);
2159 2160 2161 2162
			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);
2163
			tmp = be16_to_cpu(hdr_d->count)
L
Linus Torvalds 已提交
2164 2165
						* sizeof(xfs_attr_leaf_entry_t)
						+ sizeof(xfs_attr_leaf_hdr_t);
2166
			ASSERT(be16_to_cpu(hdr_d->firstused) >= tmp);
L
Linus Torvalds 已提交
2167 2168 2169 2170 2171 2172 2173 2174
#ifdef GROT
		}
#endif /* GROT */
	}

	/*
	 * Zero out the entries we just copied.
	 */
2175
	if (start_s == be16_to_cpu(hdr_s->count)) {
L
Linus Torvalds 已提交
2176 2177 2178 2179 2180 2181 2182 2183 2184 2185
		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.
		 */
2186
		tmp  = be16_to_cpu(hdr_s->count) - count;
L
Linus Torvalds 已提交
2187 2188 2189 2190 2191 2192
		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);
2193
		entry_s = &leaf_s->entries[be16_to_cpu(hdr_s->count)];
L
Linus Torvalds 已提交
2194 2195 2196 2197 2198 2199 2200 2201
		ASSERT(((char *)entry_s + tmp) <=
		       ((char *)leaf_s + XFS_LBSIZE(mp)));
		memset((char *)entry_s, 0, tmp);
	}

	/*
	 * Fill in the freemap information
	 */
2202
	hdr_d->freemap[0].base = cpu_to_be16(sizeof(xfs_attr_leaf_hdr_t));
2203
	be16_add_cpu(&hdr_d->freemap[0].base, be16_to_cpu(hdr_d->count) *
2204 2205 2206
			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 已提交
2207 2208 2209 2210 2211 2212 2213 2214 2215 2216 2217 2218 2219 2220 2221 2222 2223 2224
	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
xfs_attr_leaf_order(xfs_dabuf_t *leaf1_bp, xfs_dabuf_t *leaf2_bp)
{
	xfs_attr_leafblock_t *leaf1, *leaf2;

	leaf1 = leaf1_bp->data;
	leaf2 = leaf2_bp->data;
2225 2226
	ASSERT((be16_to_cpu(leaf1->hdr.info.magic) == XFS_ATTR_LEAF_MAGIC) &&
	       (be16_to_cpu(leaf2->hdr.info.magic) == XFS_ATTR_LEAF_MAGIC));
2227 2228
	if ((be16_to_cpu(leaf1->hdr.count) > 0) &&
	    (be16_to_cpu(leaf2->hdr.count) > 0) &&
2229 2230 2231 2232 2233 2234
	    ((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 已提交
2235 2236 2237 2238 2239 2240 2241 2242 2243 2244 2245 2246 2247 2248
		return(1);
	}
	return(0);
}

/*
 * Pick up the last hashvalue from a leaf block.
 */
xfs_dahash_t
xfs_attr_leaf_lasthash(xfs_dabuf_t *bp, int *count)
{
	xfs_attr_leafblock_t *leaf;

	leaf = bp->data;
2249
	ASSERT(be16_to_cpu(leaf->hdr.info.magic) == XFS_ATTR_LEAF_MAGIC);
L
Linus Torvalds 已提交
2250
	if (count)
2251
		*count = be16_to_cpu(leaf->hdr.count);
L
Linus Torvalds 已提交
2252 2253
	if (!leaf->hdr.count)
		return(0);
2254
	return be32_to_cpu(leaf->entries[be16_to_cpu(leaf->hdr.count)-1].hashval);
L
Linus Torvalds 已提交
2255 2256 2257 2258 2259 2260
}

/*
 * Calculate the number of bytes used to store the indicated attribute
 * (whether local or remote only calculate bytes in this block).
 */
2261
STATIC int
L
Linus Torvalds 已提交
2262 2263 2264 2265 2266 2267
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;

2268
	ASSERT(be16_to_cpu(leaf->hdr.info.magic) == XFS_ATTR_LEAF_MAGIC);
L
Linus Torvalds 已提交
2269
	if (leaf->entries[index].flags & XFS_ATTR_LOCAL) {
2270 2271
		name_loc = xfs_attr_leaf_name_local(leaf, index);
		size = xfs_attr_leaf_entsize_local(name_loc->namelen,
2272
						   be16_to_cpu(name_loc->valuelen));
L
Linus Torvalds 已提交
2273
	} else {
2274 2275
		name_rmt = xfs_attr_leaf_name_remote(leaf, index);
		size = xfs_attr_leaf_entsize_remote(name_rmt->namelen);
L
Linus Torvalds 已提交
2276 2277 2278 2279 2280 2281 2282 2283 2284 2285 2286
	}
	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
2287
xfs_attr_leaf_newentsize(int namelen, int valuelen, int blocksize, int *local)
L
Linus Torvalds 已提交
2288 2289 2290
{
	int size;

2291 2292
	size = xfs_attr_leaf_entsize_local(namelen, valuelen);
	if (size < xfs_attr_leaf_entsize_local_max(blocksize)) {
L
Linus Torvalds 已提交
2293 2294 2295 2296
		if (local) {
			*local = 1;
		}
	} else {
2297
		size = xfs_attr_leaf_entsize_remote(namelen);
L
Linus Torvalds 已提交
2298 2299 2300 2301 2302 2303 2304 2305 2306 2307 2308 2309 2310 2311 2312 2313 2314 2315 2316 2317 2318 2319 2320
		if (local) {
			*local = 0;
		}
	}
	return(size);
}

/*
 * Copy out attribute list entries for attr_list(), for leaf attribute lists.
 */
int
xfs_attr_leaf_list_int(xfs_dabuf_t *bp, xfs_attr_list_context_t *context)
{
	attrlist_cursor_kern_t *cursor;
	xfs_attr_leafblock_t *leaf;
	xfs_attr_leaf_entry_t *entry;
	int retval, i;

	ASSERT(bp != NULL);
	leaf = bp->data;
	cursor = context->cursor;
	cursor->initted = 1;

C
Christoph Hellwig 已提交
2321
	trace_xfs_attr_list_leaf(context);
L
Linus Torvalds 已提交
2322 2323 2324 2325 2326 2327

	/*
	 * Re-find our place in the leaf block if this is a new syscall.
	 */
	if (context->resynch) {
		entry = &leaf->entries[0];
2328
		for (i = 0; i < be16_to_cpu(leaf->hdr.count); entry++, i++) {
2329
			if (be32_to_cpu(entry->hashval) == cursor->hashval) {
L
Linus Torvalds 已提交
2330 2331 2332 2333 2334
				if (cursor->offset == context->dupcnt) {
					context->dupcnt = 0;
					break;
				}
				context->dupcnt++;
2335 2336
			} else if (be32_to_cpu(entry->hashval) >
					cursor->hashval) {
L
Linus Torvalds 已提交
2337 2338 2339 2340
				context->dupcnt = 0;
				break;
			}
		}
2341
		if (i == be16_to_cpu(leaf->hdr.count)) {
C
Christoph Hellwig 已提交
2342
			trace_xfs_attr_list_notfound(context);
L
Linus Torvalds 已提交
2343 2344 2345 2346 2347 2348 2349 2350 2351 2352 2353 2354
			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;
2355
	for (  ; (i < be16_to_cpu(leaf->hdr.count)); entry++, i++) {
2356 2357
		if (be32_to_cpu(entry->hashval) != cursor->hashval) {
			cursor->hashval = be32_to_cpu(entry->hashval);
L
Linus Torvalds 已提交
2358 2359 2360 2361 2362 2363 2364
			cursor->offset = 0;
		}

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

		if (entry->flags & XFS_ATTR_LOCAL) {
2365
			xfs_attr_leaf_name_local_t *name_loc =
2366
				xfs_attr_leaf_name_local(leaf, i);
2367 2368

			retval = context->put_listent(context,
2369
						entry->flags,
2370
						name_loc->nameval,
2371 2372
						(int)name_loc->namelen,
						be16_to_cpu(name_loc->valuelen),
2373
						&name_loc->nameval[name_loc->namelen]);
2374 2375
			if (retval)
				return retval;
L
Linus Torvalds 已提交
2376
		} else {
2377
			xfs_attr_leaf_name_remote_t *name_rmt =
2378
				xfs_attr_leaf_name_remote(leaf, i);
2379 2380 2381 2382 2383 2384 2385 2386 2387 2388

			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;
2389
				args.value = kmem_alloc(valuelen, KM_SLEEP | KM_NOFS);
2390 2391 2392 2393 2394 2395
				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,
2396
						entry->flags,
2397
						name_rmt->name,
2398 2399
						(int)name_rmt->namelen,
						valuelen,
2400
						args.value);
2401
				kmem_free(args.value);
2402
			} else {
2403
				retval = context->put_listent(context,
2404
						entry->flags,
2405
						name_rmt->name,
2406 2407 2408 2409 2410 2411
						(int)name_rmt->namelen,
						valuelen,
						NULL);
			}
			if (retval)
				return retval;
L
Linus Torvalds 已提交
2412
		}
2413 2414 2415
		if (context->seen_enough)
			break;
		cursor->offset++;
L
Linus Torvalds 已提交
2416
	}
C
Christoph Hellwig 已提交
2417
	trace_xfs_attr_list_leaf_end(context);
L
Linus Torvalds 已提交
2418 2419 2420 2421 2422 2423 2424 2425 2426 2427 2428 2429 2430 2431 2432 2433 2434 2435 2436 2437 2438 2439 2440 2441 2442 2443 2444 2445 2446 2447 2448 2449 2450 2451 2452 2453
	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;
	xfs_dabuf_t *bp;
	int error;
#ifdef DEBUG
	xfs_attr_leaf_name_local_t *name_loc;
	int namelen;
	char *name;
#endif /* DEBUG */

	/*
	 * Set up the operation.
	 */
	error = xfs_da_read_buf(args->trans, args->dp, args->blkno, -1, &bp,
					     XFS_ATTR_FORK);
	if (error) {
		return(error);
	}
	ASSERT(bp != NULL);

	leaf = bp->data;
2454
	ASSERT(be16_to_cpu(leaf->hdr.info.magic) == XFS_ATTR_LEAF_MAGIC);
2455
	ASSERT(args->index < be16_to_cpu(leaf->hdr.count));
L
Linus Torvalds 已提交
2456 2457 2458 2459 2460 2461
	ASSERT(args->index >= 0);
	entry = &leaf->entries[ args->index ];
	ASSERT(entry->flags & XFS_ATTR_INCOMPLETE);

#ifdef DEBUG
	if (entry->flags & XFS_ATTR_LOCAL) {
2462
		name_loc = xfs_attr_leaf_name_local(leaf, args->index);
L
Linus Torvalds 已提交
2463 2464 2465
		namelen = name_loc->namelen;
		name = (char *)name_loc->nameval;
	} else {
2466
		name_rmt = xfs_attr_leaf_name_remote(leaf, args->index);
L
Linus Torvalds 已提交
2467 2468 2469
		namelen = name_rmt->namelen;
		name = (char *)name_rmt->name;
	}
2470
	ASSERT(be32_to_cpu(entry->hashval) == args->hashval);
L
Linus Torvalds 已提交
2471 2472 2473 2474 2475 2476 2477 2478 2479 2480
	ASSERT(namelen == args->namelen);
	ASSERT(memcmp(name, args->name, namelen) == 0);
#endif /* DEBUG */

	entry->flags &= ~XFS_ATTR_INCOMPLETE;
	xfs_da_log_buf(args->trans, bp,
			 XFS_DA_LOGRANGE(leaf, entry, sizeof(*entry)));

	if (args->rmtblkno) {
		ASSERT((entry->flags & XFS_ATTR_LOCAL) == 0);
2481
		name_rmt = xfs_attr_leaf_name_remote(leaf, args->index);
2482 2483
		name_rmt->valueblk = cpu_to_be32(args->rmtblkno);
		name_rmt->valuelen = cpu_to_be32(args->valuelen);
L
Linus Torvalds 已提交
2484 2485 2486 2487 2488 2489 2490 2491
		xfs_da_log_buf(args->trans, bp,
			 XFS_DA_LOGRANGE(leaf, name_rmt, sizeof(*name_rmt)));
	}
	xfs_da_buf_done(bp);

	/*
	 * Commit the flag value change and start the next trans in series.
	 */
2492
	return xfs_trans_roll(&args->trans, args->dp);
L
Linus Torvalds 已提交
2493 2494 2495 2496 2497 2498 2499 2500 2501 2502 2503 2504 2505 2506 2507 2508 2509 2510 2511 2512 2513 2514 2515 2516 2517
}

/*
 * 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;
	xfs_dabuf_t *bp;
	int error;

	/*
	 * Set up the operation.
	 */
	error = xfs_da_read_buf(args->trans, args->dp, args->blkno, -1, &bp,
					     XFS_ATTR_FORK);
	if (error) {
		return(error);
	}
	ASSERT(bp != NULL);

	leaf = bp->data;
2518
	ASSERT(be16_to_cpu(leaf->hdr.info.magic) == XFS_ATTR_LEAF_MAGIC);
2519
	ASSERT(args->index < be16_to_cpu(leaf->hdr.count));
L
Linus Torvalds 已提交
2520 2521 2522 2523 2524 2525 2526 2527
	ASSERT(args->index >= 0);
	entry = &leaf->entries[ args->index ];

	ASSERT((entry->flags & XFS_ATTR_INCOMPLETE) == 0);
	entry->flags |= XFS_ATTR_INCOMPLETE;
	xfs_da_log_buf(args->trans, bp,
			XFS_DA_LOGRANGE(leaf, entry, sizeof(*entry)));
	if ((entry->flags & XFS_ATTR_LOCAL) == 0) {
2528
		name_rmt = xfs_attr_leaf_name_remote(leaf, args->index);
L
Linus Torvalds 已提交
2529 2530 2531 2532 2533 2534 2535 2536 2537 2538
		name_rmt->valueblk = 0;
		name_rmt->valuelen = 0;
		xfs_da_log_buf(args->trans, bp,
			 XFS_DA_LOGRANGE(leaf, name_rmt, sizeof(*name_rmt)));
	}
	xfs_da_buf_done(bp);

	/*
	 * Commit the flag value change and start the next trans in series.
	 */
2539
	return xfs_trans_roll(&args->trans, args->dp);
L
Linus Torvalds 已提交
2540 2541 2542 2543 2544 2545 2546 2547 2548 2549 2550 2551 2552 2553 2554 2555 2556 2557 2558 2559 2560 2561 2562 2563 2564 2565 2566 2567 2568 2569 2570 2571 2572 2573 2574 2575 2576 2577 2578 2579 2580 2581 2582 2583 2584 2585 2586 2587
}

/*
 * 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;
	xfs_dabuf_t *bp1, *bp2;
	int error;
#ifdef DEBUG
	xfs_attr_leaf_name_local_t *name_loc;
	int namelen1, namelen2;
	char *name1, *name2;
#endif /* DEBUG */

	/*
	 * Read the block containing the "old" attr
	 */
	error = xfs_da_read_buf(args->trans, args->dp, args->blkno, -1, &bp1,
					     XFS_ATTR_FORK);
	if (error) {
		return(error);
	}
	ASSERT(bp1 != NULL);

	/*
	 * Read the block containing the "new" attr, if it is different
	 */
	if (args->blkno2 != args->blkno) {
		error = xfs_da_read_buf(args->trans, args->dp, args->blkno2,
					-1, &bp2, XFS_ATTR_FORK);
		if (error) {
			return(error);
		}
		ASSERT(bp2 != NULL);
	} else {
		bp2 = bp1;
	}

	leaf1 = bp1->data;
2588
	ASSERT(be16_to_cpu(leaf1->hdr.info.magic) == XFS_ATTR_LEAF_MAGIC);
2589
	ASSERT(args->index < be16_to_cpu(leaf1->hdr.count));
L
Linus Torvalds 已提交
2590 2591 2592 2593
	ASSERT(args->index >= 0);
	entry1 = &leaf1->entries[ args->index ];

	leaf2 = bp2->data;
2594
	ASSERT(be16_to_cpu(leaf2->hdr.info.magic) == XFS_ATTR_LEAF_MAGIC);
2595
	ASSERT(args->index2 < be16_to_cpu(leaf2->hdr.count));
L
Linus Torvalds 已提交
2596 2597 2598 2599 2600
	ASSERT(args->index2 >= 0);
	entry2 = &leaf2->entries[ args->index2 ];

#ifdef DEBUG
	if (entry1->flags & XFS_ATTR_LOCAL) {
2601
		name_loc = xfs_attr_leaf_name_local(leaf1, args->index);
L
Linus Torvalds 已提交
2602 2603 2604
		namelen1 = name_loc->namelen;
		name1 = (char *)name_loc->nameval;
	} else {
2605
		name_rmt = xfs_attr_leaf_name_remote(leaf1, args->index);
L
Linus Torvalds 已提交
2606 2607 2608 2609
		namelen1 = name_rmt->namelen;
		name1 = (char *)name_rmt->name;
	}
	if (entry2->flags & XFS_ATTR_LOCAL) {
2610
		name_loc = xfs_attr_leaf_name_local(leaf2, args->index2);
L
Linus Torvalds 已提交
2611 2612 2613
		namelen2 = name_loc->namelen;
		name2 = (char *)name_loc->nameval;
	} else {
2614
		name_rmt = xfs_attr_leaf_name_remote(leaf2, args->index2);
L
Linus Torvalds 已提交
2615 2616 2617
		namelen2 = name_rmt->namelen;
		name2 = (char *)name_rmt->name;
	}
2618
	ASSERT(be32_to_cpu(entry1->hashval) == be32_to_cpu(entry2->hashval));
L
Linus Torvalds 已提交
2619 2620 2621 2622 2623 2624 2625 2626 2627 2628 2629 2630
	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;
	xfs_da_log_buf(args->trans, bp1,
			  XFS_DA_LOGRANGE(leaf1, entry1, sizeof(*entry1)));
	if (args->rmtblkno) {
		ASSERT((entry1->flags & XFS_ATTR_LOCAL) == 0);
2631
		name_rmt = xfs_attr_leaf_name_remote(leaf1, args->index);
2632 2633
		name_rmt->valueblk = cpu_to_be32(args->rmtblkno);
		name_rmt->valuelen = cpu_to_be32(args->valuelen);
L
Linus Torvalds 已提交
2634 2635 2636 2637 2638 2639 2640 2641
		xfs_da_log_buf(args->trans, bp1,
			 XFS_DA_LOGRANGE(leaf1, name_rmt, sizeof(*name_rmt)));
	}

	entry2->flags |= XFS_ATTR_INCOMPLETE;
	xfs_da_log_buf(args->trans, bp2,
			  XFS_DA_LOGRANGE(leaf2, entry2, sizeof(*entry2)));
	if ((entry2->flags & XFS_ATTR_LOCAL) == 0) {
2642
		name_rmt = xfs_attr_leaf_name_remote(leaf2, args->index2);
L
Linus Torvalds 已提交
2643 2644 2645 2646 2647 2648 2649 2650 2651 2652 2653 2654
		name_rmt->valueblk = 0;
		name_rmt->valuelen = 0;
		xfs_da_log_buf(args->trans, bp2,
			 XFS_DA_LOGRANGE(leaf2, name_rmt, sizeof(*name_rmt)));
	}
	xfs_da_buf_done(bp1);
	if (bp1 != bp2)
		xfs_da_buf_done(bp2);

	/*
	 * Commit the flag value change and start the next trans in series.
	 */
2655
	error = xfs_trans_roll(&args->trans, args->dp);
L
Linus Torvalds 已提交
2656 2657 2658 2659 2660 2661 2662 2663 2664 2665 2666 2667 2668 2669 2670 2671 2672 2673 2674 2675 2676 2677 2678 2679 2680 2681 2682 2683 2684 2685 2686 2687 2688 2689 2690 2691

	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;
	xfs_dabuf_t *bp;
	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.
	 */
	error = xfs_da_read_buf(*trans, dp, 0, -1, &bp, XFS_ATTR_FORK);
	if (error)
		return(error);
	blkno = xfs_da_blkno(bp);

	/*
	 * Invalidate the tree, even if the "tree" is only a single leaf block.
	 * This is a depth-first traversal!
	 */
	info = bp->data;
2692
	if (be16_to_cpu(info->magic) == XFS_DA_NODE_MAGIC) {
L
Linus Torvalds 已提交
2693
		error = xfs_attr_node_inactive(trans, dp, bp, 1);
2694
	} else if (be16_to_cpu(info->magic) == XFS_ATTR_LEAF_MAGIC) {
L
Linus Torvalds 已提交
2695 2696 2697 2698 2699 2700 2701 2702 2703 2704 2705 2706 2707 2708 2709 2710 2711 2712
		error = xfs_attr_leaf_inactive(trans, dp, bp);
	} else {
		error = XFS_ERROR(EIO);
		xfs_da_brelse(*trans, bp);
	}
	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);
	xfs_da_binval(*trans, bp);	/* remove from cache */
	/*
	 * Commit the invalidate and start the next transaction.
	 */
2713
	error = xfs_trans_roll(trans, dp);
L
Linus Torvalds 已提交
2714 2715 2716 2717 2718 2719 2720 2721

	return (error);
}

/*
 * Recurse (gasp!) through the attribute nodes until we find leaves.
 * We're doing a depth-first traversal in order to invalidate everything.
 */
2722
STATIC int
L
Linus Torvalds 已提交
2723 2724 2725 2726 2727 2728 2729 2730 2731 2732 2733 2734 2735 2736 2737 2738 2739 2740 2741
xfs_attr_node_inactive(xfs_trans_t **trans, xfs_inode_t *dp, xfs_dabuf_t *bp,
				   int level)
{
	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;
	xfs_dabuf_t *child_bp;

	/*
	 * Since this code is recursive (gasp!) we must protect ourselves.
	 */
	if (level > XFS_DA_NODE_MAXDEPTH) {
		xfs_da_brelse(*trans, bp);	/* no locks for later trans */
		return(XFS_ERROR(EIO));
	}

	node = bp->data;
2742
	ASSERT(be16_to_cpu(node->hdr.info.magic) == XFS_DA_NODE_MAGIC);
L
Linus Torvalds 已提交
2743
	parent_blkno = xfs_da_blkno(bp);	/* save for re-read later */
2744
	count = be16_to_cpu(node->hdr.count);
L
Linus Torvalds 已提交
2745 2746 2747 2748
	if (!count) {
		xfs_da_brelse(*trans, bp);
		return(0);
	}
2749
	child_fsb = be32_to_cpu(node->btree[0].before);
L
Linus Torvalds 已提交
2750 2751 2752 2753 2754 2755 2756 2757 2758 2759 2760 2761 2762 2763 2764 2765 2766 2767 2768 2769 2770 2771 2772 2773 2774 2775
	xfs_da_brelse(*trans, bp);	/* no locks for later trans */

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

			/*
			 * Invalidate the subtree, however we have to.
			 */
			info = child_bp->data;
2776
			if (be16_to_cpu(info->magic) == XFS_DA_NODE_MAGIC) {
L
Linus Torvalds 已提交
2777 2778
				error = xfs_attr_node_inactive(trans, dp,
						child_bp, level+1);
2779
			} else if (be16_to_cpu(info->magic) == XFS_ATTR_LEAF_MAGIC) {
L
Linus Torvalds 已提交
2780 2781 2782 2783 2784 2785 2786 2787 2788 2789 2790 2791 2792 2793 2794 2795 2796 2797 2798 2799 2800 2801 2802 2803 2804 2805 2806 2807 2808
				error = xfs_attr_leaf_inactive(trans, dp,
						child_bp);
			} else {
				error = XFS_ERROR(EIO);
				xfs_da_brelse(*trans, child_bp);
			}
			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);
			xfs_da_binval(*trans, child_bp);
		}

		/*
		 * If we're not done, re-read the parent to get the next
		 * child block number.
		 */
		if ((i+1) < count) {
			error = xfs_da_read_buf(*trans, dp, 0, parent_blkno,
				&bp, XFS_ATTR_FORK);
			if (error)
				return(error);
2809
			child_fsb = be32_to_cpu(node->btree[i+1].before);
L
Linus Torvalds 已提交
2810 2811 2812 2813 2814
			xfs_da_brelse(*trans, bp);
		}
		/*
		 * Atomically commit the whole invalidate stuff.
		 */
2815 2816
		error = xfs_trans_roll(trans, dp);
		if (error)
L
Linus Torvalds 已提交
2817 2818 2819 2820 2821 2822 2823 2824 2825 2826 2827 2828
			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.
 */
2829
STATIC int
L
Linus Torvalds 已提交
2830 2831 2832 2833 2834 2835 2836 2837 2838
xfs_attr_leaf_inactive(xfs_trans_t **trans, xfs_inode_t *dp, xfs_dabuf_t *bp)
{
	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;

	leaf = bp->data;
2839
	ASSERT(be16_to_cpu(leaf->hdr.info.magic) == XFS_ATTR_LEAF_MAGIC);
L
Linus Torvalds 已提交
2840 2841 2842 2843 2844 2845

	/*
	 * Count the number of "remote" value extents.
	 */
	count = 0;
	entry = &leaf->entries[0];
2846
	for (i = 0; i < be16_to_cpu(leaf->hdr.count); entry++, i++) {
2847 2848
		if (be16_to_cpu(entry->nameidx) &&
		    ((entry->flags & XFS_ATTR_LOCAL) == 0)) {
2849
			name_rmt = xfs_attr_leaf_name_remote(leaf, i);
L
Linus Torvalds 已提交
2850 2851 2852 2853 2854 2855 2856 2857 2858 2859 2860 2861 2862 2863 2864 2865 2866 2867 2868 2869 2870 2871 2872 2873
			if (name_rmt->valueblk)
				count++;
		}
	}

	/*
	 * If there are no "remote" values, we're done.
	 */
	if (count == 0) {
		xfs_da_brelse(*trans, bp);
		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];
2874
	for (i = 0; i < be16_to_cpu(leaf->hdr.count); entry++, i++) {
2875 2876
		if (be16_to_cpu(entry->nameidx) &&
		    ((entry->flags & XFS_ATTR_LOCAL) == 0)) {
2877
			name_rmt = xfs_attr_leaf_name_remote(leaf, i);
L
Linus Torvalds 已提交
2878
			if (name_rmt->valueblk) {
2879 2880 2881
				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 已提交
2882 2883 2884 2885 2886 2887 2888 2889 2890 2891 2892 2893
				lp++;
			}
		}
	}
	xfs_da_brelse(*trans, bp);	/* unlock for trans. in freextent() */

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

L
Linus Torvalds 已提交
2896 2897 2898 2899
		if (error == 0)
			error = tmp;	/* save only the 1st errno */
	}

2900
	kmem_free((xfs_caddr_t)list);
L
Linus Torvalds 已提交
2901 2902 2903 2904 2905 2906 2907
	return(error);
}

/*
 * Look at all the extents for this logical region,
 * invalidate any buffers that are incore/in transactions.
 */
2908
STATIC int
L
Linus Torvalds 已提交
2909 2910 2911 2912 2913 2914 2915 2916 2917 2918 2919 2920 2921 2922 2923 2924 2925 2926 2927 2928 2929 2930
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;
		error = xfs_bmapi(*trans, dp, (xfs_fileoff_t)tblkno, tblkcnt,
					XFS_BMAPI_ATTRFORK | XFS_BMAPI_METADATA,
2931
					NULL, 0, &map, &nmap, NULL);
L
Linus Torvalds 已提交
2932 2933 2934 2935 2936 2937 2938 2939 2940 2941 2942 2943 2944 2945 2946 2947 2948 2949
		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,
2950
					dblkno, dblkcnt, XBF_LOCK);
L
Linus Torvalds 已提交
2951 2952 2953 2954
			xfs_trans_binval(*trans, bp);
			/*
			 * Roll to next transaction.
			 */
2955 2956
			error = xfs_trans_roll(trans, dp);
			if (error)
L
Linus Torvalds 已提交
2957 2958 2959 2960 2961 2962 2963 2964 2965
				return (error);
		}

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

	return(0);
}