inode.c 93.5 KB
Newer Older
1
/*
2
 *  linux/fs/ext4/inode.c
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
 *
 * Copyright (C) 1992, 1993, 1994, 1995
 * Remy Card (card@masi.ibp.fr)
 * Laboratoire MASI - Institut Blaise Pascal
 * Universite Pierre et Marie Curie (Paris VI)
 *
 *  from
 *
 *  linux/fs/minix/inode.c
 *
 *  Copyright (C) 1991, 1992  Linus Torvalds
 *
 *  Goal-directed block allocation by Stephen Tweedie
 *	(sct@redhat.com), 1993, 1998
 *  Big-endian to little-endian byte-swapping/bitmaps by
 *        David S. Miller (davem@caip.rutgers.edu), 1995
 *  64-bit file support on 64-bit platforms by Jakub Jelinek
 *	(jj@sunsite.ms.mff.cuni.cz)
 *
22
 *  Assorted race fixes, rewrite of ext4_get_block() by Al Viro, 2000
23
24
25
26
27
 */

#include <linux/module.h>
#include <linux/fs.h>
#include <linux/time.h>
28
#include <linux/ext4_jbd.h>
29
30
31
32
33
34
35
36
37
38
39
40
41
42
#include <linux/jbd.h>
#include <linux/smp_lock.h>
#include <linux/highuid.h>
#include <linux/pagemap.h>
#include <linux/quotaops.h>
#include <linux/string.h>
#include <linux/buffer_head.h>
#include <linux/writeback.h>
#include <linux/mpage.h>
#include <linux/uio.h>
#include <linux/bio.h>
#include "xattr.h"
#include "acl.h"

43
static int ext4_writepage_trans_blocks(struct inode *inode);
44
45
46
47

/*
 * Test whether an inode is a fast symlink.
 */
48
static int ext4_inode_is_fast_symlink(struct inode *inode)
49
{
50
	int ea_blocks = EXT4_I(inode)->i_file_acl ?
51
52
53
54
55
56
		(inode->i_sb->s_blocksize >> 9) : 0;

	return (S_ISLNK(inode->i_mode) && inode->i_blocks - ea_blocks == 0);
}

/*
57
 * The ext4 forget function must perform a revoke if we are freeing data
58
59
60
61
62
63
64
 * which has been journaled.  Metadata (eg. indirect blocks) must be
 * revoked in all cases.
 *
 * "bh" may be NULL: a metadata block may have been freed from memory
 * but there may still be a record of it in the journal, and that record
 * still needs to be revoked.
 */
65
66
int ext4_forget(handle_t *handle, int is_metadata, struct inode *inode,
			struct buffer_head *bh, ext4_fsblk_t blocknr)
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
{
	int err;

	might_sleep();

	BUFFER_TRACE(bh, "enter");

	jbd_debug(4, "forgetting bh %p: is_metadata = %d, mode %o, "
		  "data mode %lx\n",
		  bh, is_metadata, inode->i_mode,
		  test_opt(inode->i_sb, DATA_FLAGS));

	/* Never use the revoke function if we are doing full data
	 * journaling: there is no need to, and a V1 superblock won't
	 * support it.  Otherwise, only skip the revoke on un-journaled
	 * data blocks. */

84
85
	if (test_opt(inode->i_sb, DATA_FLAGS) == EXT4_MOUNT_JOURNAL_DATA ||
	    (!is_metadata && !ext4_should_journal_data(inode))) {
86
87
		if (bh) {
			BUFFER_TRACE(bh, "call journal_forget");
88
			return ext4_journal_forget(handle, bh);
89
90
91
92
93
94
95
		}
		return 0;
	}

	/*
	 * data!=journal && (is_metadata || should_journal_data(inode))
	 */
96
97
	BUFFER_TRACE(bh, "call ext4_journal_revoke");
	err = ext4_journal_revoke(handle, blocknr, bh);
98
	if (err)
99
		ext4_abort(inode->i_sb, __FUNCTION__,
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
			   "error %d when attempting revoke", err);
	BUFFER_TRACE(bh, "exit");
	return err;
}

/*
 * Work out how many blocks we need to proceed with the next chunk of a
 * truncate transaction.
 */
static unsigned long blocks_for_truncate(struct inode *inode)
{
	unsigned long needed;

	needed = inode->i_blocks >> (inode->i_sb->s_blocksize_bits - 9);

	/* Give ourselves just enough room to cope with inodes in which
	 * i_blocks is corrupt: we've seen disk corruptions in the past
	 * which resulted in random data in an inode which looked enough
118
	 * like a regular file for ext4 to try to delete it.  Things
119
120
121
122
123
124
125
	 * will go a bit crazy if that happens, but at least we should
	 * try not to panic the whole kernel. */
	if (needed < 2)
		needed = 2;

	/* But we need to bound the transaction so we don't overflow the
	 * journal. */
126
127
	if (needed > EXT4_MAX_TRANS_DATA)
		needed = EXT4_MAX_TRANS_DATA;
128

129
	return EXT4_DATA_TRANS_BLOCKS(inode->i_sb) + needed;
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
}

/*
 * Truncate transactions can be complex and absolutely huge.  So we need to
 * be able to restart the transaction at a conventient checkpoint to make
 * sure we don't overflow the journal.
 *
 * start_transaction gets us a new handle for a truncate transaction,
 * and extend_transaction tries to extend the existing one a bit.  If
 * extend fails, we need to propagate the failure up and restart the
 * transaction in the top-level truncate loop. --sct
 */
static handle_t *start_transaction(struct inode *inode)
{
	handle_t *result;

146
	result = ext4_journal_start(inode, blocks_for_truncate(inode));
147
148
149
	if (!IS_ERR(result))
		return result;

150
	ext4_std_error(inode->i_sb, PTR_ERR(result));
151
152
153
154
155
156
157
158
159
160
161
	return result;
}

/*
 * Try to extend this transaction for the purposes of truncation.
 *
 * Returns 0 if we managed to create more room.  If we can't create more
 * room, and the transaction must be restarted we return 1.
 */
static int try_to_extend_transaction(handle_t *handle, struct inode *inode)
{
162
	if (handle->h_buffer_credits > EXT4_RESERVE_TRANS_BLOCKS)
163
		return 0;
164
	if (!ext4_journal_extend(handle, blocks_for_truncate(inode)))
165
166
167
168
169
170
171
172
173
		return 0;
	return 1;
}

/*
 * Restart the transaction associated with *handle.  This does a commit,
 * so before we call here everything must be consistently dirtied against
 * this transaction.
 */
174
static int ext4_journal_test_restart(handle_t *handle, struct inode *inode)
175
176
{
	jbd_debug(2, "restarting handle %p\n", handle);
177
	return ext4_journal_restart(handle, blocks_for_truncate(inode));
178
179
180
181
182
}

/*
 * Called at the last iput() if i_nlink is zero.
 */
183
void ext4_delete_inode (struct inode * inode)
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
{
	handle_t *handle;

	truncate_inode_pages(&inode->i_data, 0);

	if (is_bad_inode(inode))
		goto no_delete;

	handle = start_transaction(inode);
	if (IS_ERR(handle)) {
		/*
		 * If we're going to skip the normal cleanup, we still need to
		 * make sure that the in-core orphan linked list is properly
		 * cleaned up.
		 */
199
		ext4_orphan_del(NULL, inode);
200
201
202
203
204
205
206
		goto no_delete;
	}

	if (IS_SYNC(inode))
		handle->h_sync = 1;
	inode->i_size = 0;
	if (inode->i_blocks)
207
		ext4_truncate(inode);
208
	/*
209
	 * Kill off the orphan record which ext4_truncate created.
210
	 * AKPM: I think this can be inside the above `if'.
211
	 * Note that ext4_orphan_del() has to be able to cope with the
212
	 * deletion of a non-existent orphan - this is because we don't
213
	 * know if ext4_truncate() actually created an orphan record.
214
215
	 * (Well, we could do this if we need to, but heck - it works)
	 */
216
217
	ext4_orphan_del(handle, inode);
	EXT4_I(inode)->i_dtime	= get_seconds();
218
219
220
221
222
223
224
225

	/*
	 * One subtle ordering requirement: if anything has gone wrong
	 * (transaction abort, IO errors, whatever), then we can still
	 * do these next steps (the fs will already have been marked as
	 * having errors), but we can't free the inode if the mark_dirty
	 * fails.
	 */
226
	if (ext4_mark_inode_dirty(handle, inode))
227
228
229
		/* If that failed, just do the required in-core inode clear. */
		clear_inode(inode);
	else
230
231
		ext4_free_inode(handle, inode);
	ext4_journal_stop(handle);
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
	return;
no_delete:
	clear_inode(inode);	/* We must guarantee clearing of inode... */
}

typedef struct {
	__le32	*p;
	__le32	key;
	struct buffer_head *bh;
} Indirect;

static inline void add_chain(Indirect *p, struct buffer_head *bh, __le32 *v)
{
	p->key = *(p->p = v);
	p->bh = bh;
}

static int verify_chain(Indirect *from, Indirect *to)
{
	while (from <= to && from->key == *from->p)
		from++;
	return (from > to);
}

/**
257
 *	ext4_block_to_path - parse the block number into array of offsets
258
259
260
261
262
263
 *	@inode: inode in question (we are only interested in its superblock)
 *	@i_block: block number to be parsed
 *	@offsets: array to store the offsets in
 *      @boundary: set this non-zero if the referred-to block is likely to be
 *             followed (on disk) by an indirect block.
 *
264
 *	To store the locations of file's data ext4 uses a data structure common
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
 *	for UNIX filesystems - tree of pointers anchored in the inode, with
 *	data blocks at leaves and indirect blocks in intermediate nodes.
 *	This function translates the block number into path in that tree -
 *	return value is the path length and @offsets[n] is the offset of
 *	pointer to (n+1)th node in the nth one. If @block is out of range
 *	(negative or too large) warning is printed and zero returned.
 *
 *	Note: function doesn't find node addresses, so no IO is needed. All
 *	we need to know is the capacity of indirect blocks (taken from the
 *	inode->i_sb).
 */

/*
 * Portability note: the last comparison (check that we fit into triple
 * indirect block) is spelled differently, because otherwise on an
 * architecture with 32-bit longs and 8Kb pages we might get into trouble
 * if our filesystem had 8Kb blocks. We might use long long, but that would
 * kill us on x86. Oh, well, at least the sign propagation does not matter -
 * i_block would have to be negative in the very beginning, so we would not
 * get there at all.
 */

287
static int ext4_block_to_path(struct inode *inode,
288
289
			long i_block, int offsets[4], int *boundary)
{
290
291
292
	int ptrs = EXT4_ADDR_PER_BLOCK(inode->i_sb);
	int ptrs_bits = EXT4_ADDR_PER_BLOCK_BITS(inode->i_sb);
	const long direct_blocks = EXT4_NDIR_BLOCKS,
293
294
295
296
297
298
		indirect_blocks = ptrs,
		double_blocks = (1 << (ptrs_bits * 2));
	int n = 0;
	int final = 0;

	if (i_block < 0) {
299
		ext4_warning (inode->i_sb, "ext4_block_to_path", "block < 0");
300
301
302
303
	} else if (i_block < direct_blocks) {
		offsets[n++] = i_block;
		final = direct_blocks;
	} else if ( (i_block -= direct_blocks) < indirect_blocks) {
304
		offsets[n++] = EXT4_IND_BLOCK;
305
306
307
		offsets[n++] = i_block;
		final = ptrs;
	} else if ((i_block -= indirect_blocks) < double_blocks) {
308
		offsets[n++] = EXT4_DIND_BLOCK;
309
310
311
312
		offsets[n++] = i_block >> ptrs_bits;
		offsets[n++] = i_block & (ptrs - 1);
		final = ptrs;
	} else if (((i_block -= double_blocks) >> (ptrs_bits * 2)) < ptrs) {
313
		offsets[n++] = EXT4_TIND_BLOCK;
314
315
316
317
318
		offsets[n++] = i_block >> (ptrs_bits * 2);
		offsets[n++] = (i_block >> ptrs_bits) & (ptrs - 1);
		offsets[n++] = i_block & (ptrs - 1);
		final = ptrs;
	} else {
319
		ext4_warning(inode->i_sb, "ext4_block_to_path", "block > big");
320
321
322
323
324
325
326
	}
	if (boundary)
		*boundary = final - 1 - (i_block & (ptrs - 1));
	return n;
}

/**
327
 *	ext4_get_branch - read the chain of indirect blocks leading to data
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
 *	@inode: inode in question
 *	@depth: depth of the chain (1 - direct pointer, etc.)
 *	@offsets: offsets of pointers in inode/indirect blocks
 *	@chain: place to store the result
 *	@err: here we store the error value
 *
 *	Function fills the array of triples <key, p, bh> and returns %NULL
 *	if everything went OK or the pointer to the last filled triple
 *	(incomplete one) otherwise. Upon the return chain[i].key contains
 *	the number of (i+1)-th block in the chain (as it is stored in memory,
 *	i.e. little-endian 32-bit), chain[i].p contains the address of that
 *	number (it points into struct inode for i==0 and into the bh->b_data
 *	for i>0) and chain[i].bh points to the buffer_head of i-th indirect
 *	block for i>0 and NULL for i==0. In other words, it holds the block
 *	numbers of the chain, addresses they were taken from (and where we can
 *	verify that chain did not change) and buffer_heads hosting these
 *	numbers.
 *
 *	Function stops when it stumbles upon zero pointer (absent block)
 *		(pointer to last triple returned, *@err == 0)
 *	or when it gets an IO error reading an indirect block
 *		(ditto, *@err == -EIO)
 *	or when it notices that chain had been changed while it was reading
 *		(ditto, *@err == -EAGAIN)
 *	or when it reads all @depth-1 indirect blocks successfully and finds
 *	the whole chain, all way to the data (returns %NULL, *err == 0).
 */
355
static Indirect *ext4_get_branch(struct inode *inode, int depth, int *offsets,
356
357
358
359
360
361
362
363
				 Indirect chain[4], int *err)
{
	struct super_block *sb = inode->i_sb;
	Indirect *p = chain;
	struct buffer_head *bh;

	*err = 0;
	/* i_data is not going away, no lock needed */
364
	add_chain (chain, NULL, EXT4_I(inode)->i_data + *offsets);
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
	if (!p->key)
		goto no_block;
	while (--depth) {
		bh = sb_bread(sb, le32_to_cpu(p->key));
		if (!bh)
			goto failure;
		/* Reader: pointers */
		if (!verify_chain(chain, p))
			goto changed;
		add_chain(++p, bh, (__le32*)bh->b_data + *++offsets);
		/* Reader: end */
		if (!p->key)
			goto no_block;
	}
	return NULL;

changed:
	brelse(bh);
	*err = -EAGAIN;
	goto no_block;
failure:
	*err = -EIO;
no_block:
	return p;
}

/**
392
 *	ext4_find_near - find a place for allocation with sufficient locality
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
 *	@inode: owner
 *	@ind: descriptor of indirect block.
 *
 *	This function returns the prefered place for block allocation.
 *	It is used when heuristic for sequential allocation fails.
 *	Rules are:
 *	  + if there is a block to the left of our position - allocate near it.
 *	  + if pointer will live in indirect block - allocate near that block.
 *	  + if pointer will live in inode - allocate in the same
 *	    cylinder group.
 *
 * In the latter case we colour the starting block by the callers PID to
 * prevent it from clashing with concurrent allocations for a different inode
 * in the same block group.   The PID is used here so that functionally related
 * files will be close-by on-disk.
 *
 *	Caller must make sure that @ind is valid and will stay that way.
 */
411
static ext4_fsblk_t ext4_find_near(struct inode *inode, Indirect *ind)
412
{
413
	struct ext4_inode_info *ei = EXT4_I(inode);
414
415
	__le32 *start = ind->bh ? (__le32*) ind->bh->b_data : ei->i_data;
	__le32 *p;
416
417
	ext4_fsblk_t bg_start;
	ext4_grpblk_t colour;
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432

	/* Try to find previous block */
	for (p = ind->p - 1; p >= start; p--) {
		if (*p)
			return le32_to_cpu(*p);
	}

	/* No such thing, so let's try location of indirect block */
	if (ind->bh)
		return ind->bh->b_blocknr;

	/*
	 * It is going to be referred to from the inode itself? OK, just put it
	 * into the same cylinder group then.
	 */
433
	bg_start = ext4_group_first_block_no(inode->i_sb, ei->i_block_group);
434
	colour = (current->pid % 16) *
435
			(EXT4_BLOCKS_PER_GROUP(inode->i_sb) / 16);
436
437
438
439
	return bg_start + colour;
}

/**
440
 *	ext4_find_goal - find a prefered place for allocation.
441
442
443
444
445
446
447
448
449
450
 *	@inode: owner
 *	@block:  block we want
 *	@chain:  chain of indirect blocks
 *	@partial: pointer to the last triple within a chain
 *	@goal:	place to store the result.
 *
 *	Normally this function find the prefered place for block allocation,
 *	stores it in *@goal and returns zero.
 */

451
static ext4_fsblk_t ext4_find_goal(struct inode *inode, long block,
452
453
		Indirect chain[4], Indirect *partial)
{
454
	struct ext4_block_alloc_info *block_i;
455

456
	block_i =  EXT4_I(inode)->i_block_alloc_info;
457
458
459
460
461
462
463
464
465
466

	/*
	 * try the heuristic for sequential allocation,
	 * failing that at least try to get decent locality.
	 */
	if (block_i && (block == block_i->last_alloc_logical_block + 1)
		&& (block_i->last_alloc_physical_block != 0)) {
		return block_i->last_alloc_physical_block + 1;
	}

467
	return ext4_find_near(inode, partial);
468
469
470
}

/**
471
 *	ext4_blks_to_allocate: Look up the block map and count the number
472
473
474
475
476
477
478
479
480
481
 *	of direct blocks need to be allocated for the given branch.
 *
 *	@branch: chain of indirect blocks
 *	@k: number of blocks need for indirect blocks
 *	@blks: number of data blocks to be mapped.
 *	@blocks_to_boundary:  the offset in the indirect block
 *
 *	return the total number of blocks to be allocate, including the
 *	direct and indirect blocks.
 */
482
static int ext4_blks_to_allocate(Indirect *branch, int k, unsigned long blks,
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
		int blocks_to_boundary)
{
	unsigned long count = 0;

	/*
	 * Simple case, [t,d]Indirect block(s) has not allocated yet
	 * then it's clear blocks on that path have not allocated
	 */
	if (k > 0) {
		/* right now we don't handle cross boundary allocation */
		if (blks < blocks_to_boundary + 1)
			count += blks;
		else
			count += blocks_to_boundary + 1;
		return count;
	}

	count++;
	while (count < blks && count <= blocks_to_boundary &&
		le32_to_cpu(*(branch[0].p + count)) == 0) {
		count++;
	}
	return count;
}

/**
509
 *	ext4_alloc_blocks: multiple allocate blocks needed for a branch
510
511
512
513
514
515
516
517
 *	@indirect_blks: the number of blocks need to allocate for indirect
 *			blocks
 *
 *	@new_blocks: on return it will store the new block numbers for
 *	the indirect blocks(if needed) and the first direct block,
 *	@blks:	on return it will store the total number of allocated
 *		direct blocks
 */
518
519
520
static int ext4_alloc_blocks(handle_t *handle, struct inode *inode,
			ext4_fsblk_t goal, int indirect_blks, int blks,
			ext4_fsblk_t new_blocks[4], int *err)
521
522
523
524
{
	int target, i;
	unsigned long count = 0;
	int index = 0;
525
	ext4_fsblk_t current_block = 0;
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
	int ret = 0;

	/*
	 * Here we try to allocate the requested multiple blocks at once,
	 * on a best-effort basis.
	 * To build a branch, we should allocate blocks for
	 * the indirect blocks(if not allocated yet), and at least
	 * the first direct block of this branch.  That's the
	 * minimum number of blocks need to allocate(required)
	 */
	target = blks + indirect_blks;

	while (1) {
		count = target;
		/* allocating blocks for indirect blocks and direct blocks */
541
		current_block = ext4_new_blocks(handle,inode,goal,&count,err);
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
		if (*err)
			goto failed_out;

		target -= count;
		/* allocate blocks for indirect blocks */
		while (index < indirect_blks && count) {
			new_blocks[index++] = current_block++;
			count--;
		}

		if (count > 0)
			break;
	}

	/* save the new block number for the first direct block */
	new_blocks[index] = current_block;

	/* total number of blocks allocated for direct blocks */
	ret = count;
	*err = 0;
	return ret;
failed_out:
	for (i = 0; i <index; i++)
565
		ext4_free_blocks(handle, inode, new_blocks[i], 1);
566
567
568
569
	return ret;
}

/**
570
 *	ext4_alloc_branch - allocate and set up a chain of blocks.
571
572
573
574
575
576
577
578
579
580
 *	@inode: owner
 *	@indirect_blks: number of allocated indirect blocks
 *	@blks: number of allocated direct blocks
 *	@offsets: offsets (in the blocks) to store the pointers to next.
 *	@branch: place to store the chain in.
 *
 *	This function allocates blocks, zeroes out all but the last one,
 *	links them into chain and (if we are synchronous) writes them to disk.
 *	In other words, it prepares a branch that can be spliced onto the
 *	inode. It stores the information about that chain in the branch[], in
581
 *	the same format as ext4_get_branch() would do. We are calling it after
582
583
 *	we had read the existing part of chain and partial points to the last
 *	triple of that (one with zero ->key). Upon the exit we have the same
584
 *	picture as after the successful ext4_get_block(), except that in one
585
586
587
588
589
590
 *	place chain is disconnected - *branch->p is still zero (we did not
 *	set the last link), but branch->key contains the number that should
 *	be placed into *branch->p to fill that gap.
 *
 *	If allocation fails we free all blocks we've allocated (and forget
 *	their buffer_heads) and return the error value the from failed
591
 *	ext4_alloc_block() (normally -ENOSPC). Otherwise we set the chain
592
593
 *	as described above and return 0.
 */
594
595
static int ext4_alloc_branch(handle_t *handle, struct inode *inode,
			int indirect_blks, int *blks, ext4_fsblk_t goal,
596
597
598
599
600
601
602
			int *offsets, Indirect *branch)
{
	int blocksize = inode->i_sb->s_blocksize;
	int i, n = 0;
	int err = 0;
	struct buffer_head *bh;
	int num;
603
604
	ext4_fsblk_t new_blocks[4];
	ext4_fsblk_t current_block;
605

606
	num = ext4_alloc_blocks(handle, inode, goal, indirect_blks,
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
				*blks, new_blocks, &err);
	if (err)
		return err;

	branch[0].key = cpu_to_le32(new_blocks[0]);
	/*
	 * metadata blocks and data blocks are allocated.
	 */
	for (n = 1; n <= indirect_blks;  n++) {
		/*
		 * Get buffer_head for parent block, zero it out
		 * and set the pointer to new one, then send
		 * parent to disk.
		 */
		bh = sb_getblk(inode->i_sb, new_blocks[n-1]);
		branch[n].bh = bh;
		lock_buffer(bh);
		BUFFER_TRACE(bh, "call get_create_access");
625
		err = ext4_journal_get_create_access(handle, bh);
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
		if (err) {
			unlock_buffer(bh);
			brelse(bh);
			goto failed;
		}

		memset(bh->b_data, 0, blocksize);
		branch[n].p = (__le32 *) bh->b_data + offsets[n];
		branch[n].key = cpu_to_le32(new_blocks[n]);
		*branch[n].p = branch[n].key;
		if ( n == indirect_blks) {
			current_block = new_blocks[n];
			/*
			 * End of chain, update the last new metablock of
			 * the chain to point to the new allocated
			 * data blocks numbers
			 */
			for (i=1; i < num; i++)
				*(branch[n].p + i) = cpu_to_le32(++current_block);
		}
		BUFFER_TRACE(bh, "marking uptodate");
		set_buffer_uptodate(bh);
		unlock_buffer(bh);

650
651
		BUFFER_TRACE(bh, "call ext4_journal_dirty_metadata");
		err = ext4_journal_dirty_metadata(handle, bh);
652
653
654
655
656
657
658
659
660
		if (err)
			goto failed;
	}
	*blks = num;
	return err;
failed:
	/* Allocation failed, free what we already allocated */
	for (i = 1; i <= n ; i++) {
		BUFFER_TRACE(branch[i].bh, "call journal_forget");
661
		ext4_journal_forget(handle, branch[i].bh);
662
663
	}
	for (i = 0; i <indirect_blks; i++)
664
		ext4_free_blocks(handle, inode, new_blocks[i], 1);
665

666
	ext4_free_blocks(handle, inode, new_blocks[i], num);
667
668
669
670
671

	return err;
}

/**
672
 * ext4_splice_branch - splice the allocated branch onto inode.
673
674
675
 * @inode: owner
 * @block: (logical) number of block we are adding
 * @chain: chain of indirect blocks (with a missing link - see
676
 *	ext4_alloc_branch)
677
678
679
680
681
682
683
684
 * @where: location of missing link
 * @num:   number of indirect blocks we are adding
 * @blks:  number of direct blocks we are adding
 *
 * This function fills the missing link and does all housekeeping needed in
 * inode (->i_blocks, etc.). In case of success we end up with the full
 * chain to new block and return 0.
 */
685
static int ext4_splice_branch(handle_t *handle, struct inode *inode,
686
687
688
689
			long block, Indirect *where, int num, int blks)
{
	int i;
	int err = 0;
690
691
	struct ext4_block_alloc_info *block_i;
	ext4_fsblk_t current_block;
692

693
	block_i = EXT4_I(inode)->i_block_alloc_info;
694
695
696
697
698
699
700
	/*
	 * If we're splicing into a [td]indirect block (as opposed to the
	 * inode) then we need to get write access to the [td]indirect block
	 * before the splice.
	 */
	if (where->bh) {
		BUFFER_TRACE(where->bh, "get_write_access");
701
		err = ext4_journal_get_write_access(handle, where->bh);
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
		if (err)
			goto err_out;
	}
	/* That's it */

	*where->p = where->key;

	/*
	 * Update the host buffer_head or inode to point to more just allocated
	 * direct blocks blocks
	 */
	if (num == 0 && blks > 1) {
		current_block = le32_to_cpu(where->key) + 1;
		for (i = 1; i < blks; i++)
			*(where->p + i ) = cpu_to_le32(current_block++);
	}

	/*
	 * update the most recently allocated logical & physical block
	 * in i_block_alloc_info, to assist find the proper goal block for next
	 * allocation
	 */
	if (block_i) {
		block_i->last_alloc_logical_block = block + blks - 1;
		block_i->last_alloc_physical_block =
				le32_to_cpu(where[num].key) + blks - 1;
	}

	/* We are done with atomic stuff, now do the rest of housekeeping */

	inode->i_ctime = CURRENT_TIME_SEC;
733
	ext4_mark_inode_dirty(handle, inode);
734
735
736
737
738
739
740
741
742

	/* had we spliced it onto indirect block? */
	if (where->bh) {
		/*
		 * If we spliced it onto an indirect block, we haven't
		 * altered the inode.  Note however that if it is being spliced
		 * onto an indirect block at the very end of the file (the
		 * file is growing) then we *will* alter the inode to reflect
		 * the new i_size.  But that is not done here - it is done in
743
		 * generic_commit_write->__mark_inode_dirty->ext4_dirty_inode.
744
745
		 */
		jbd_debug(5, "splicing indirect only\n");
746
747
		BUFFER_TRACE(where->bh, "call ext4_journal_dirty_metadata");
		err = ext4_journal_dirty_metadata(handle, where->bh);
748
749
750
751
752
753
754
755
756
757
758
759
760
761
		if (err)
			goto err_out;
	} else {
		/*
		 * OK, we spliced it into the inode itself on a direct block.
		 * Inode was dirtied above.
		 */
		jbd_debug(5, "splicing direct\n");
	}
	return err;

err_out:
	for (i = 1; i <= num; i++) {
		BUFFER_TRACE(where[i].bh, "call journal_forget");
762
763
		ext4_journal_forget(handle, where[i].bh);
		ext4_free_blocks(handle,inode,le32_to_cpu(where[i-1].key),1);
764
	}
765
	ext4_free_blocks(handle, inode, le32_to_cpu(where[num].key), blks);
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788

	return err;
}

/*
 * Allocation strategy is simple: if we have to allocate something, we will
 * have to go the whole way to leaf. So let's do it before attaching anything
 * to tree, set linkage between the newborn blocks, write them if sync is
 * required, recheck the path, free and repeat if check fails, otherwise
 * set the last missing link (that will protect us from any truncate-generated
 * removals - all blocks on the path are immune now) and possibly force the
 * write on the parent block.
 * That has a nice additional property: no special recovery from the failed
 * allocations is needed - we simply release blocks and do not touch anything
 * reachable from inode.
 *
 * `handle' can be NULL if create == 0.
 *
 * The BKL may not be held on entry here.  Be sure to take it early.
 * return > 0, # of blocks mapped or allocated.
 * return = 0, if plain lookup failed.
 * return < 0, error case.
 */
789
int ext4_get_blocks_handle(handle_t *handle, struct inode *inode,
790
791
792
793
794
795
796
797
		sector_t iblock, unsigned long maxblocks,
		struct buffer_head *bh_result,
		int create, int extend_disksize)
{
	int err = -EIO;
	int offsets[4];
	Indirect chain[4];
	Indirect *partial;
798
	ext4_fsblk_t goal;
799
800
801
	int indirect_blks;
	int blocks_to_boundary = 0;
	int depth;
802
	struct ext4_inode_info *ei = EXT4_I(inode);
803
	int count = 0;
804
	ext4_fsblk_t first_block = 0;
805
806
807


	J_ASSERT(handle != NULL || create == 0);
808
	depth = ext4_block_to_path(inode,iblock,offsets,&blocks_to_boundary);
809
810
811
812

	if (depth == 0)
		goto out;

813
	partial = ext4_get_branch(inode, depth, offsets, chain, &err);
814
815
816
817
818
819
820
821

	/* Simplest case - block found, no allocation needed */
	if (!partial) {
		first_block = le32_to_cpu(chain[depth - 1].key);
		clear_buffer_new(bh_result);
		count++;
		/*map more blocks*/
		while (count < maxblocks && count <= blocks_to_boundary) {
822
			ext4_fsblk_t blk;
823
824
825
826
827
828
829
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

			if (!verify_chain(chain, partial)) {
				/*
				 * Indirect block might be removed by
				 * truncate while we were reading it.
				 * Handling of that case: forget what we've
				 * got now. Flag the err as EAGAIN, so it
				 * will reread.
				 */
				err = -EAGAIN;
				count = 0;
				break;
			}
			blk = le32_to_cpu(*(chain[depth-1].p + count));

			if (blk == first_block + count)
				count++;
			else
				break;
		}
		if (err != -EAGAIN)
			goto got_it;
	}

	/* Next simple case - plain lookup or failed read of indirect block */
	if (!create || err == -EIO)
		goto cleanup;

	mutex_lock(&ei->truncate_mutex);

	/*
	 * If the indirect block is missing while we are reading
855
	 * the chain(ext4_get_branch() returns -EAGAIN err), or
856
857
858
859
860
861
862
863
864
865
866
867
868
869
	 * if the chain has been changed after we grab the semaphore,
	 * (either because another process truncated this branch, or
	 * another get_block allocated this branch) re-grab the chain to see if
	 * the request block has been allocated or not.
	 *
	 * Since we already block the truncate/other get_block
	 * at this point, we will have the current copy of the chain when we
	 * splice the branch into the tree.
	 */
	if (err == -EAGAIN || !verify_chain(chain, partial)) {
		while (partial > chain) {
			brelse(partial->bh);
			partial--;
		}
870
		partial = ext4_get_branch(inode, depth, offsets, chain, &err);
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
		if (!partial) {
			count++;
			mutex_unlock(&ei->truncate_mutex);
			if (err)
				goto cleanup;
			clear_buffer_new(bh_result);
			goto got_it;
		}
	}

	/*
	 * Okay, we need to do block allocation.  Lazily initialize the block
	 * allocation info here if necessary
	*/
	if (S_ISREG(inode->i_mode) && (!ei->i_block_alloc_info))
886
		ext4_init_block_alloc_info(inode);
887

888
	goal = ext4_find_goal(inode, iblock, chain, partial);
889
890
891
892
893
894
895
896

	/* the number of blocks need to allocate for [d,t]indirect blocks */
	indirect_blks = (chain + depth) - partial - 1;

	/*
	 * Next look up the indirect map to count the totoal number of
	 * direct blocks to allocate for this branch.
	 */
897
	count = ext4_blks_to_allocate(partial, indirect_blks,
898
899
					maxblocks, blocks_to_boundary);
	/*
900
	 * Block out ext4_truncate while we alter the tree
901
	 */
902
	err = ext4_alloc_branch(handle, inode, indirect_blks, &count, goal,
903
904
905
				offsets + (partial - chain), partial);

	/*
906
	 * The ext4_splice_branch call will free and forget any buffers
907
908
909
910
911
912
	 * on the new chain if there is a failure, but that risks using
	 * up transaction credits, especially for bitmaps where the
	 * credits cannot be returned.  Can we handle this somehow?  We
	 * may need to return -EAGAIN upwards in the worst case.  --sct
	 */
	if (!err)
913
		err = ext4_splice_branch(handle, inode, iblock,
914
915
916
917
					partial, indirect_blks, count);
	/*
	 * i_disksize growing is protected by truncate_mutex.  Don't forget to
	 * protect it if you're about to implement concurrent
918
	 * ext4_get_block() -bzzz
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
	*/
	if (!err && extend_disksize && inode->i_size > ei->i_disksize)
		ei->i_disksize = inode->i_size;
	mutex_unlock(&ei->truncate_mutex);
	if (err)
		goto cleanup;

	set_buffer_new(bh_result);
got_it:
	map_bh(bh_result, inode->i_sb, le32_to_cpu(chain[depth-1].key));
	if (count > blocks_to_boundary)
		set_buffer_boundary(bh_result);
	err = count;
	/* Clean up and exit */
	partial = chain + depth - 1;	/* the whole chain */
cleanup:
	while (partial > chain) {
		BUFFER_TRACE(partial->bh, "call brelse");
		brelse(partial->bh);
		partial--;
	}
	BUFFER_TRACE(bh_result, "returned");
out:
	return err;
}

945
#define DIO_CREDITS (EXT4_RESERVE_TRANS_BLOCKS + 32)
946

947
static int ext4_get_block(struct inode *inode, sector_t iblock,
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
			struct buffer_head *bh_result, int create)
{
	handle_t *handle = journal_current_handle();
	int ret = 0;
	unsigned max_blocks = bh_result->b_size >> inode->i_blkbits;

	if (!create)
		goto get_block;		/* A read */

	if (max_blocks == 1)
		goto get_block;		/* A single block get */

	if (handle->h_transaction->t_state == T_LOCKED) {
		/*
		 * Huge direct-io writes can hold off commits for long
		 * periods of time.  Let this commit run.
		 */
965
966
		ext4_journal_stop(handle);
		handle = ext4_journal_start(inode, DIO_CREDITS);
967
968
969
970
971
		if (IS_ERR(handle))
			ret = PTR_ERR(handle);
		goto get_block;
	}

972
	if (handle->h_buffer_credits <= EXT4_RESERVE_TRANS_BLOCKS) {
973
974
975
		/*
		 * Getting low on buffer credits...
		 */
976
		ret = ext4_journal_extend(handle, DIO_CREDITS);
977
978
979
980
		if (ret > 0) {
			/*
			 * Couldn't extend the transaction.  Start a new one.
			 */
981
			ret = ext4_journal_restart(handle, DIO_CREDITS);
982
983
984
985
986
		}
	}

get_block:
	if (ret == 0) {
987
		ret = ext4_get_blocks_handle(handle, inode, iblock,
988
989
990
991
992
993
994
995
996
997
998
999
					max_blocks, bh_result, create, 0);
		if (ret > 0) {
			bh_result->b_size = (ret << inode->i_blkbits);
			ret = 0;
		}
	}
	return ret;
}

/*
 * `handle' can be NULL if create is zero
 */
1000
struct buffer_head *ext4_getblk(handle_t *handle, struct inode *inode,
For faster browsing, not all history is shown. View entire blame