xfs_inode_fork.c 18.8 KB
Newer Older
D
Dave Chinner 已提交
1
// SPDX-License-Identifier: GPL-2.0
2 3 4 5 6 7 8
/*
 * Copyright (c) 2000-2006 Silicon Graphics, Inc.
 * All Rights Reserved.
 */

#include "xfs.h"
#include "xfs_fs.h"
9
#include "xfs_shared.h"
10
#include "xfs_format.h"
11 12
#include "xfs_log_format.h"
#include "xfs_trans_resv.h"
13 14
#include "xfs_mount.h"
#include "xfs_inode.h"
15
#include "xfs_trans.h"
16
#include "xfs_inode_item.h"
17
#include "xfs_btree.h"
18
#include "xfs_bmap_btree.h"
19 20 21
#include "xfs_bmap.h"
#include "xfs_error.h"
#include "xfs_trace.h"
22
#include "xfs_da_format.h"
23 24
#include "xfs_da_btree.h"
#include "xfs_dir2_priv.h"
25
#include "xfs_attr_leaf.h"
26 27 28

kmem_zone_t *xfs_ifork_zone;

29 30 31 32 33
void
xfs_init_local_fork(
	struct xfs_inode	*ip,
	int			whichfork,
	const void		*data,
34
	int64_t			size)
35 36
{
	struct xfs_ifork	*ifp = XFS_IFORK_PTR(ip, whichfork);
37 38 39 40 41 42 43 44 45 46 47 48
	int			mem_size = size, real_size = 0;
	bool			zero_terminate;

	/*
	 * If we are using the local fork to store a symlink body we need to
	 * zero-terminate it so that we can pass it back to the VFS directly.
	 * Overallocate the in-memory fork by one for that and add a zero
	 * to terminate it below.
	 */
	zero_terminate = S_ISLNK(VFS_I(ip)->i_mode);
	if (zero_terminate)
		mem_size++;
49

50
	if (size) {
51
		real_size = roundup(mem_size, 4);
52
		ifp->if_u1.if_data = kmem_alloc(real_size, KM_NOFS);
53
		memcpy(ifp->if_u1.if_data, data, size);
54 55
		if (zero_terminate)
			ifp->if_u1.if_data[size] = '\0';
56 57
	} else {
		ifp->if_u1.if_data = NULL;
58
	}
59 60 61 62 63 64

	ifp->if_bytes = size;
	ifp->if_flags &= ~(XFS_IFEXTENTS | XFS_IFBROOT);
	ifp->if_flags |= XFS_IFINLINE;
}

65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81
/*
 * The file is in-lined in the on-disk inode.
 */
STATIC int
xfs_iformat_local(
	xfs_inode_t	*ip,
	xfs_dinode_t	*dip,
	int		whichfork,
	int		size)
{
	/*
	 * If the size is unreasonable, then something
	 * is wrong and we just bail out rather than crash in
	 * kmem_alloc() or memcpy() below.
	 */
	if (unlikely(size > XFS_DFORK_SIZE(dip, ip->i_mount, whichfork))) {
		xfs_warn(ip->i_mount,
82
	"corrupt inode %Lu (bad size %d for local fork, size = %zd).",
83 84
			(unsigned long long) ip->i_ino, size,
			XFS_DFORK_SIZE(dip, ip->i_mount, whichfork));
85 86 87
		xfs_inode_verifier_error(ip, -EFSCORRUPTED,
				"xfs_iformat_local", dip, sizeof(*dip),
				__this_address);
D
Dave Chinner 已提交
88
		return -EFSCORRUPTED;
89
	}
90 91

	xfs_init_local_fork(ip, whichfork, XFS_DFORK_PTR(dip, whichfork), size);
92 93 94 95
	return 0;
}

/*
96
 * The file consists of a set of extents all of which fit into the on-disk
97
 * inode.
98 99 100
 */
STATIC int
xfs_iformat_extents(
101 102 103
	struct xfs_inode	*ip,
	struct xfs_dinode	*dip,
	int			whichfork)
104
{
105 106
	struct xfs_mount	*mp = ip->i_mount;
	struct xfs_ifork	*ifp = XFS_IFORK_PTR(ip, whichfork);
107
	int			state = xfs_bmap_fork_to_state(whichfork);
108 109
	int			nex = XFS_DFORK_NEXTENTS(dip, whichfork);
	int			size = nex * sizeof(xfs_bmbt_rec_t);
110
	struct xfs_iext_cursor	icur;
111
	struct xfs_bmbt_rec	*dp;
112
	struct xfs_bmbt_irec	new;
113
	int			i;
114 115

	/*
116 117
	 * If the number of extents is unreasonable, then something is wrong and
	 * we just bail out rather than crash in kmem_alloc() or memcpy() below.
118
	 */
119
	if (unlikely(size < 0 || size > XFS_DFORK_SIZE(dip, mp, whichfork))) {
120 121
		xfs_warn(ip->i_mount, "corrupt inode %Lu ((a)extents = %d).",
			(unsigned long long) ip->i_ino, nex);
122 123 124
		xfs_inode_verifier_error(ip, -EFSCORRUPTED,
				"xfs_iformat_extents(1)", dip, sizeof(*dip),
				__this_address);
D
Dave Chinner 已提交
125
		return -EFSCORRUPTED;
126 127
	}

128 129 130
	ifp->if_bytes = 0;
	ifp->if_u1.if_root = NULL;
	ifp->if_height = 0;
131 132
	if (size) {
		dp = (xfs_bmbt_rec_t *) XFS_DFORK_PTR(dip, whichfork);
133 134

		xfs_iext_first(ifp, &icur);
135
		for (i = 0; i < nex; i++, dp++) {
136 137
			xfs_failaddr_t	fa;

138
			xfs_bmbt_disk_get_all(dp, &new);
139 140 141 142 143
			fa = xfs_bmap_validate_extent(ip, whichfork, &new);
			if (fa) {
				xfs_inode_verifier_error(ip, -EFSCORRUPTED,
						"xfs_iformat_extents(2)",
						dp, sizeof(*dp), fa);
144 145
				return -EFSCORRUPTED;
			}
146

147
			xfs_iext_insert(ip, &icur, &new, state);
148 149
			trace_xfs_read_extent(ip, &icur, state, _THIS_IP_);
			xfs_iext_next(ifp, &icur);
150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171
		}
	}
	ifp->if_flags |= XFS_IFEXTENTS;
	return 0;
}

/*
 * The file has too many extents to fit into
 * the inode, so they are in B-tree format.
 * Allocate a buffer for the root of the B-tree
 * and copy the root into it.  The i_extents
 * field will remain NULL until all of the
 * extents are read in (when they are needed).
 */
STATIC int
xfs_iformat_btree(
	xfs_inode_t		*ip,
	xfs_dinode_t		*dip,
	int			whichfork)
{
	struct xfs_mount	*mp = ip->i_mount;
	xfs_bmdr_block_t	*dfp;
172
	struct xfs_ifork	*ifp;
173 174 175
	/* REFERENCED */
	int			nrecs;
	int			size;
176
	int			level;
177 178 179 180 181

	ifp = XFS_IFORK_PTR(ip, whichfork);
	dfp = (xfs_bmdr_block_t *)XFS_DFORK_PTR(dip, whichfork);
	size = XFS_BMAP_BROOT_SPACE(mp, dfp);
	nrecs = be16_to_cpu(dfp->bb_numrecs);
182
	level = be16_to_cpu(dfp->bb_level);
183 184 185 186 187 188 189 190

	/*
	 * blow out if -- fork has less extents than can fit in
	 * fork (fork shouldn't be a btree format), root btree
	 * block has more records than can fit into the fork,
	 * or the number of extents is greater than the number of
	 * blocks.
	 */
191
	if (unlikely(ifp->if_nextents <= XFS_IFORK_MAXEXT(ip, whichfork) ||
192
		     nrecs == 0 ||
193 194
		     XFS_BMDR_SPACE_CALC(nrecs) >
					XFS_DFORK_SIZE(dip, mp, whichfork) ||
195
		     ifp->if_nextents > ip->i_d.di_nblocks) ||
196
		     level == 0 || level > XFS_BTREE_MAXLEVELS) {
197 198
		xfs_warn(mp, "corrupt inode %Lu (btree).",
					(unsigned long long) ip->i_ino);
199 200 201
		xfs_inode_verifier_error(ip, -EFSCORRUPTED,
				"xfs_iformat_btree", dfp, size,
				__this_address);
D
Dave Chinner 已提交
202
		return -EFSCORRUPTED;
203 204 205
	}

	ifp->if_broot_bytes = size;
206
	ifp->if_broot = kmem_alloc(size, KM_NOFS);
207 208 209 210 211 212 213 214 215 216
	ASSERT(ifp->if_broot != NULL);
	/*
	 * Copy and convert from the on-disk structure
	 * to the in-memory structure.
	 */
	xfs_bmdr_to_bmbt(ip, dfp, XFS_DFORK_SIZE(dip, ip->i_mount, whichfork),
			 ifp->if_broot, size);
	ifp->if_flags &= ~XFS_IFEXTENTS;
	ifp->if_flags |= XFS_IFBROOT;

217 218 219
	ifp->if_bytes = 0;
	ifp->if_u1.if_root = NULL;
	ifp->if_height = 0;
220 221 222
	return 0;
}

C
Christoph Hellwig 已提交
223 224 225 226 227 228
int
xfs_iformat_data_fork(
	struct xfs_inode	*ip,
	struct xfs_dinode	*dip)
{
	struct inode		*inode = VFS_I(ip);
229
	int			error;
C
Christoph Hellwig 已提交
230

231 232 233 234
	/*
	 * Initialize the extent count early, as the per-format routines may
	 * depend on it.
	 */
235
	ip->i_df.if_format = dip->di_format;
236 237
	ip->i_df.if_nextents = be32_to_cpu(dip->di_nextents);

C
Christoph Hellwig 已提交
238 239 240 241 242 243 244 245 246 247 248
	switch (inode->i_mode & S_IFMT) {
	case S_IFIFO:
	case S_IFCHR:
	case S_IFBLK:
	case S_IFSOCK:
		ip->i_d.di_size = 0;
		inode->i_rdev = xfs_to_linux_dev_t(xfs_dinode_get_rdev(dip));
		return 0;
	case S_IFREG:
	case S_IFLNK:
	case S_IFDIR:
249
		switch (ip->i_df.if_format) {
C
Christoph Hellwig 已提交
250
		case XFS_DINODE_FMT_LOCAL:
251
			error = xfs_iformat_local(ip, dip, XFS_DATA_FORK,
C
Christoph Hellwig 已提交
252
					be64_to_cpu(dip->di_size));
253 254 255
			if (!error)
				error = xfs_ifork_verify_local_data(ip);
			return error;
C
Christoph Hellwig 已提交
256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289
		case XFS_DINODE_FMT_EXTENTS:
			return xfs_iformat_extents(ip, dip, XFS_DATA_FORK);
		case XFS_DINODE_FMT_BTREE:
			return xfs_iformat_btree(ip, dip, XFS_DATA_FORK);
		default:
			xfs_inode_verifier_error(ip, -EFSCORRUPTED, __func__,
					dip, sizeof(*dip), __this_address);
			return -EFSCORRUPTED;
		}
		break;
	default:
		xfs_inode_verifier_error(ip, -EFSCORRUPTED, __func__, dip,
				sizeof(*dip), __this_address);
		return -EFSCORRUPTED;
	}
}

static uint16_t
xfs_dfork_attr_shortform_size(
	struct xfs_dinode		*dip)
{
	struct xfs_attr_shortform	*atp =
		(struct xfs_attr_shortform *)XFS_DFORK_APTR(dip);

	return be16_to_cpu(atp->hdr.totsize);
}

int
xfs_iformat_attr_fork(
	struct xfs_inode	*ip,
	struct xfs_dinode	*dip)
{
	int			error = 0;

290 291 292 293
	/*
	 * Initialize the extent count early, as the per-format routines may
	 * depend on it.
	 */
294
	ip->i_afp = kmem_cache_zalloc(xfs_ifork_zone, GFP_NOFS | __GFP_NOFAIL);
295 296 297
	ip->i_afp->if_format = dip->di_aformat;
	if (unlikely(ip->i_afp->if_format == 0)) /* pre IRIX 6.2 file system */
		ip->i_afp->if_format = XFS_DINODE_FMT_EXTENTS;
298 299
	ip->i_afp->if_nextents = be16_to_cpu(dip->di_anextents);

300
	switch (ip->i_afp->if_format) {
C
Christoph Hellwig 已提交
301 302 303
	case XFS_DINODE_FMT_LOCAL:
		error = xfs_iformat_local(ip, dip, XFS_ATTR_FORK,
				xfs_dfork_attr_shortform_size(dip));
304 305
		if (!error)
			error = xfs_ifork_verify_local_attr(ip);
C
Christoph Hellwig 已提交
306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326
		break;
	case XFS_DINODE_FMT_EXTENTS:
		error = xfs_iformat_extents(ip, dip, XFS_ATTR_FORK);
		break;
	case XFS_DINODE_FMT_BTREE:
		error = xfs_iformat_btree(ip, dip, XFS_ATTR_FORK);
		break;
	default:
		xfs_inode_verifier_error(ip, error, __func__, dip,
				sizeof(*dip), __this_address);
		error = -EFSCORRUPTED;
		break;
	}

	if (error) {
		kmem_cache_free(xfs_ifork_zone, ip->i_afp);
		ip->i_afp = NULL;
	}
	return error;
}

327 328 329 330 331 332 333 334 335 336
/*
 * Reallocate the space for if_broot based on the number of records
 * being added or deleted as indicated in rec_diff.  Move the records
 * and pointers in if_broot to fit the new size.  When shrinking this
 * will eliminate holes between the records and pointers created by
 * the caller.  When growing this will create holes to be filled in
 * by the caller.
 *
 * The caller must not request to add more records than would fit in
 * the on-disk inode root.  If the if_broot is currently NULL, then
337
 * if we are adding records, one will be allocated.  The caller must also
338 339 340 341 342 343 344 345 346 347 348 349 350 351 352
 * not request that the number of records go below zero, although
 * it can go to zero.
 *
 * ip -- the inode whose if_broot area is changing
 * ext_diff -- the change in the number of records, positive or negative,
 *	 requested for the if_broot array.
 */
void
xfs_iroot_realloc(
	xfs_inode_t		*ip,
	int			rec_diff,
	int			whichfork)
{
	struct xfs_mount	*mp = ip->i_mount;
	int			cur_max;
353
	struct xfs_ifork	*ifp;
354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374
	struct xfs_btree_block	*new_broot;
	int			new_max;
	size_t			new_size;
	char			*np;
	char			*op;

	/*
	 * Handle the degenerate case quietly.
	 */
	if (rec_diff == 0) {
		return;
	}

	ifp = XFS_IFORK_PTR(ip, whichfork);
	if (rec_diff > 0) {
		/*
		 * If there wasn't any memory allocated before, just
		 * allocate it now and get out.
		 */
		if (ifp->if_broot_bytes == 0) {
			new_size = XFS_BMAP_BROOT_SPACE_CALC(mp, rec_diff);
375
			ifp->if_broot = kmem_alloc(new_size, KM_NOFS);
376 377 378 379 380 381 382 383 384 385 386 387 388 389
			ifp->if_broot_bytes = (int)new_size;
			return;
		}

		/*
		 * If there is already an existing if_broot, then we need
		 * to realloc() it and shift the pointers to their new
		 * location.  The records don't change location because
		 * they are kept butted up against the btree block header.
		 */
		cur_max = xfs_bmbt_maxrecs(mp, ifp->if_broot_bytes, 0);
		new_max = cur_max + rec_diff;
		new_size = XFS_BMAP_BROOT_SPACE_CALC(mp, new_max);
		ifp->if_broot = kmem_realloc(ifp->if_broot, new_size,
390
				KM_NOFS);
391 392 393 394 395 396 397
		op = (char *)XFS_BMAP_BROOT_PTR_ADDR(mp, ifp->if_broot, 1,
						     ifp->if_broot_bytes);
		np = (char *)XFS_BMAP_BROOT_PTR_ADDR(mp, ifp->if_broot, 1,
						     (int)new_size);
		ifp->if_broot_bytes = (int)new_size;
		ASSERT(XFS_BMAP_BMDR_SPACE(ifp->if_broot) <=
			XFS_IFORK_SIZE(ip, whichfork));
C
Christoph Hellwig 已提交
398
		memmove(np, op, cur_max * (uint)sizeof(xfs_fsblock_t));
399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415
		return;
	}

	/*
	 * rec_diff is less than 0.  In this case, we are shrinking the
	 * if_broot buffer.  It must already exist.  If we go to zero
	 * records, just get rid of the root and clear the status bit.
	 */
	ASSERT((ifp->if_broot != NULL) && (ifp->if_broot_bytes > 0));
	cur_max = xfs_bmbt_maxrecs(mp, ifp->if_broot_bytes, 0);
	new_max = cur_max + rec_diff;
	ASSERT(new_max >= 0);
	if (new_max > 0)
		new_size = XFS_BMAP_BROOT_SPACE_CALC(mp, new_max);
	else
		new_size = 0;
	if (new_size > 0) {
416
		new_broot = kmem_alloc(new_size, KM_NOFS);
417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444
		/*
		 * First copy over the btree block header.
		 */
		memcpy(new_broot, ifp->if_broot,
			XFS_BMBT_BLOCK_LEN(ip->i_mount));
	} else {
		new_broot = NULL;
		ifp->if_flags &= ~XFS_IFBROOT;
	}

	/*
	 * Only copy the records and pointers if there are any.
	 */
	if (new_max > 0) {
		/*
		 * First copy the records.
		 */
		op = (char *)XFS_BMBT_REC_ADDR(mp, ifp->if_broot, 1);
		np = (char *)XFS_BMBT_REC_ADDR(mp, new_broot, 1);
		memcpy(np, op, new_max * (uint)sizeof(xfs_bmbt_rec_t));

		/*
		 * Then copy the pointers.
		 */
		op = (char *)XFS_BMAP_BROOT_PTR_ADDR(mp, ifp->if_broot, 1,
						     ifp->if_broot_bytes);
		np = (char *)XFS_BMAP_BROOT_PTR_ADDR(mp, new_broot, 1,
						     (int)new_size);
C
Christoph Hellwig 已提交
445
		memcpy(np, op, new_max * (uint)sizeof(xfs_fsblock_t));
446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473
	}
	kmem_free(ifp->if_broot);
	ifp->if_broot = new_broot;
	ifp->if_broot_bytes = (int)new_size;
	if (ifp->if_broot)
		ASSERT(XFS_BMAP_BMDR_SPACE(ifp->if_broot) <=
			XFS_IFORK_SIZE(ip, whichfork));
	return;
}


/*
 * This is called when the amount of space needed for if_data
 * is increased or decreased.  The change in size is indicated by
 * the number of bytes that need to be added or deleted in the
 * byte_diff parameter.
 *
 * If the amount of space needed has decreased below the size of the
 * inline buffer, then switch to using the inline buffer.  Otherwise,
 * use kmem_realloc() or kmem_alloc() to adjust the size of the buffer
 * to what is needed.
 *
 * ip -- the inode whose if_data area is changing
 * byte_diff -- the change in the number of bytes, positive or negative,
 *	 requested for the if_data array.
 */
void
xfs_idata_realloc(
474
	struct xfs_inode	*ip,
475
	int64_t			byte_diff,
476
	int			whichfork)
477
{
478
	struct xfs_ifork	*ifp = XFS_IFORK_PTR(ip, whichfork);
479
	int64_t			new_size = ifp->if_bytes + byte_diff;
480 481

	ASSERT(new_size >= 0);
482 483 484 485
	ASSERT(new_size <= XFS_IFORK_SIZE(ip, whichfork));

	if (byte_diff == 0)
		return;
486 487

	if (new_size == 0) {
488
		kmem_free(ifp->if_u1.if_data);
489
		ifp->if_u1.if_data = NULL;
490 491
		ifp->if_bytes = 0;
		return;
492
	}
493 494 495 496 497 498 499

	/*
	 * For inline data, the underlying buffer must be a multiple of 4 bytes
	 * in size so that it can be logged and stay on word boundaries.
	 * We enforce that here.
	 */
	ifp->if_u1.if_data = kmem_realloc(ifp->if_u1.if_data,
500
			roundup(new_size, 4), KM_NOFS);
501 502 503 504 505
	ifp->if_bytes = new_size;
}

void
xfs_idestroy_fork(
506
	struct xfs_ifork	*ifp)
507 508 509 510 511 512 513
{
	if (ifp->if_broot != NULL) {
		kmem_free(ifp->if_broot);
		ifp->if_broot = NULL;
	}

	/*
514 515 516
	 * If the format is local, then we can't have an extents array so just
	 * look for an inline data array.  If we're not local then we may or may
	 * not have an extents list, so check and free it up if we do.
517
	 */
518
	if (ifp->if_format == XFS_DINODE_FMT_LOCAL) {
519 520 521 522 523
		kmem_free(ifp->if_u1.if_data);
		ifp->if_u1.if_data = NULL;
	} else if (ifp->if_flags & XFS_IFEXTENTS) {
		if (ifp->if_height)
			xfs_iext_destroy(ifp);
524 525 526 527
	}
}

/*
528
 * Convert in-core extents to on-disk form
529
 *
530 531 532 533 534
 * In the case of the data fork, the in-core and on-disk fork sizes can be
 * different due to delayed allocation extents. We only copy on-disk extents
 * here, so callers must always use the physical fork size to determine the
 * size of the buffer passed to this routine.  We will return the size actually
 * used.
535 536 537
 */
int
xfs_iextents_copy(
538 539
	struct xfs_inode	*ip,
	struct xfs_bmbt_rec	*dp,
540 541
	int			whichfork)
{
542
	int			state = xfs_bmap_fork_to_state(whichfork);
543
	struct xfs_ifork	*ifp = XFS_IFORK_PTR(ip, whichfork);
544
	struct xfs_iext_cursor	icur;
545
	struct xfs_bmbt_irec	rec;
546
	int64_t			copied = 0;
547

548
	ASSERT(xfs_isilocked(ip, XFS_ILOCK_EXCL | XFS_ILOCK_SHARED));
549 550
	ASSERT(ifp->if_bytes > 0);

551
	for_each_xfs_iext(ifp, &icur, &rec) {
552
		if (isnullstartblock(rec.br_startblock))
553
			continue;
554
		ASSERT(xfs_bmap_validate_extent(ip, whichfork, &rec) == NULL);
555
		xfs_bmbt_disk_set_all(dp, &rec);
556
		trace_xfs_write_extent(ip, &icur, state, _RET_IP_);
557
		copied += sizeof(struct xfs_bmbt_rec);
558 559 560
		dp++;
	}

561 562 563
	ASSERT(copied > 0);
	ASSERT(copied <= ifp->if_bytes);
	return copied;
564 565 566 567 568 569 570 571 572 573 574 575
}

/*
 * Each of the following cases stores data into the same region
 * of the on-disk inode, so only one of them can be valid at
 * any given time. While it is possible to have conflicting formats
 * and log flags, e.g. having XFS_ILOG_?DATA set when the fork is
 * in EXTENTS format, this can only happen when the fork has
 * changed formats after being modified but before being flushed.
 * In these cases, the format always takes precedence, because the
 * format indicates the current state of the fork.
 */
576
void
577 578 579
xfs_iflush_fork(
	xfs_inode_t		*ip,
	xfs_dinode_t		*dip,
580
	struct xfs_inode_log_item *iip,
581
	int			whichfork)
582 583
{
	char			*cp;
584
	struct xfs_ifork	*ifp;
585 586 587 588 589 590 591 592 593
	xfs_mount_t		*mp;
	static const short	brootflag[2] =
		{ XFS_ILOG_DBROOT, XFS_ILOG_ABROOT };
	static const short	dataflag[2] =
		{ XFS_ILOG_DDATA, XFS_ILOG_ADATA };
	static const short	extflag[2] =
		{ XFS_ILOG_DEXT, XFS_ILOG_AEXT };

	if (!iip)
594
		return;
595 596 597 598 599 600 601
	ifp = XFS_IFORK_PTR(ip, whichfork);
	/*
	 * This can happen if we gave up in iformat in an error path,
	 * for the attribute fork.
	 */
	if (!ifp) {
		ASSERT(whichfork == XFS_ATTR_FORK);
602
		return;
603 604 605
	}
	cp = XFS_DFORK_PTR(dip, whichfork);
	mp = ip->i_mount;
606
	switch (ifp->if_format) {
607 608 609 610 611 612 613 614 615 616 617 618 619 620
	case XFS_DINODE_FMT_LOCAL:
		if ((iip->ili_fields & dataflag[whichfork]) &&
		    (ifp->if_bytes > 0)) {
			ASSERT(ifp->if_u1.if_data != NULL);
			ASSERT(ifp->if_bytes <= XFS_IFORK_SIZE(ip, whichfork));
			memcpy(cp, ifp->if_u1.if_data, ifp->if_bytes);
		}
		break;

	case XFS_DINODE_FMT_EXTENTS:
		ASSERT((ifp->if_flags & XFS_IFEXTENTS) ||
		       !(iip->ili_fields & extflag[whichfork]));
		if ((iip->ili_fields & extflag[whichfork]) &&
		    (ifp->if_bytes > 0)) {
621
			ASSERT(ifp->if_nextents > 0);
622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641
			(void)xfs_iextents_copy(ip, (xfs_bmbt_rec_t *)cp,
				whichfork);
		}
		break;

	case XFS_DINODE_FMT_BTREE:
		if ((iip->ili_fields & brootflag[whichfork]) &&
		    (ifp->if_broot_bytes > 0)) {
			ASSERT(ifp->if_broot != NULL);
			ASSERT(XFS_BMAP_BMDR_SPACE(ifp->if_broot) <=
			        XFS_IFORK_SIZE(ip, whichfork));
			xfs_bmbt_to_bmdr(mp, ifp->if_broot, ifp->if_broot_bytes,
				(xfs_bmdr_block_t *)cp,
				XFS_DFORK_SIZE(dip, mp, whichfork));
		}
		break;

	case XFS_DINODE_FMT_DEV:
		if (iip->ili_fields & XFS_ILOG_DEV) {
			ASSERT(whichfork == XFS_DATA_FORK);
642 643
			xfs_dinode_put_rdev(dip,
					linux_to_xfs_dev_t(VFS_I(ip)->i_rdev));
644 645 646 647 648 649 650 651 652
		}
		break;

	default:
		ASSERT(0);
		break;
	}
}

D
Darrick J. Wong 已提交
653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675
/* Convert bmap state flags to an inode fork. */
struct xfs_ifork *
xfs_iext_state_to_fork(
	struct xfs_inode	*ip,
	int			state)
{
	if (state & BMAP_COWFORK)
		return ip->i_cowfp;
	else if (state & BMAP_ATTRFORK)
		return ip->i_afp;
	return &ip->i_df;
}

/*
 * Initialize an inode's copy-on-write fork.
 */
void
xfs_ifork_init_cow(
	struct xfs_inode	*ip)
{
	if (ip->i_cowfp)
		return;

676 677
	ip->i_cowfp = kmem_cache_zalloc(xfs_ifork_zone,
				       GFP_NOFS | __GFP_NOFAIL);
D
Darrick J. Wong 已提交
678
	ip->i_cowfp->if_flags = XFS_IFEXTENTS;
679
	ip->i_cowfp->if_format = XFS_DINODE_FMT_EXTENTS;
D
Darrick J. Wong 已提交
680
}
681 682

/* Verify the inline contents of the data fork of an inode. */
683 684
int
xfs_ifork_verify_local_data(
C
Christoph Hellwig 已提交
685
	struct xfs_inode	*ip)
686
{
687
	xfs_failaddr_t		fa = NULL;
688 689 690

	switch (VFS_I(ip)->i_mode & S_IFMT) {
	case S_IFDIR:
691 692
		fa = xfs_dir2_sf_verify(ip);
		break;
693
	case S_IFLNK:
694 695
		fa = xfs_symlink_shortform_verify(ip);
		break;
696
	default:
697
		break;
698
	}
699 700 701 702 703 704 705 706

	if (fa) {
		xfs_inode_verifier_error(ip, -EFSCORRUPTED, "data fork",
				ip->i_df.if_u1.if_data, ip->i_df.if_bytes, fa);
		return -EFSCORRUPTED;
	}

	return 0;
707 708 709
}

/* Verify the inline contents of the attr fork of an inode. */
710 711
int
xfs_ifork_verify_local_attr(
C
Christoph Hellwig 已提交
712
	struct xfs_inode	*ip)
713
{
714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729
	struct xfs_ifork	*ifp = ip->i_afp;
	xfs_failaddr_t		fa;

	if (!ifp)
		fa = __this_address;
	else
		fa = xfs_attr_shortform_verify(ip);

	if (fa) {
		xfs_inode_verifier_error(ip, -EFSCORRUPTED, "attr fork",
				ifp ? ifp->if_u1.if_data : NULL,
				ifp ? ifp->if_bytes : 0, fa);
		return -EFSCORRUPTED;
	}

	return 0;
730
}