data.c 29.6 KB
Newer Older
J
Jaegeuk Kim 已提交
1
/*
2 3 4 5 6 7 8 9 10 11 12 13 14
 * fs/f2fs/data.c
 *
 * Copyright (c) 2012 Samsung Electronics Co., Ltd.
 *             http://www.samsung.com/
 *
 * This program is free software; you can redistribute it and/or modify
 * it under the terms of the GNU General Public License version 2 as
 * published by the Free Software Foundation.
 */
#include <linux/fs.h>
#include <linux/f2fs_fs.h>
#include <linux/buffer_head.h>
#include <linux/mpage.h>
15
#include <linux/aio.h>
16 17 18 19
#include <linux/writeback.h>
#include <linux/backing-dev.h>
#include <linux/blkdev.h>
#include <linux/bio.h>
20
#include <linux/prefetch.h>
21 22 23 24

#include "f2fs.h"
#include "node.h"
#include "segment.h"
J
Jaegeuk Kim 已提交
25
#include "trace.h"
26
#include <trace/events/f2fs.h>
27

28 29
static void f2fs_read_end_io(struct bio *bio, int err)
{
30 31
	struct bio_vec *bvec;
	int i;
32

33
	bio_for_each_segment_all(bvec, bio, i) {
34 35
		struct page *page = bvec->bv_page;

36 37 38
		if (!err) {
			SetPageUptodate(page);
		} else {
39 40 41 42
			ClearPageUptodate(page);
			SetPageError(page);
		}
		unlock_page(page);
43
	}
44 45 46 47 48
	bio_put(bio);
}

static void f2fs_write_end_io(struct bio *bio, int err)
{
49
	struct f2fs_sb_info *sbi = bio->bi_private;
50 51
	struct bio_vec *bvec;
	int i;
52

53
	bio_for_each_segment_all(bvec, bio, i) {
54 55
		struct page *page = bvec->bv_page;

56
		if (unlikely(err)) {
57
			set_page_dirty(page);
58
			set_bit(AS_EIO, &page->mapping->flags);
59
			f2fs_stop_checkpoint(sbi);
60 61 62
		}
		end_page_writeback(page);
		dec_page_count(sbi, F2FS_WRITEBACK);
63
	}
64 65 66 67 68 69 70 71

	if (!get_pages(sbi, F2FS_WRITEBACK) &&
			!list_empty(&sbi->cp_wait.task_list))
		wake_up(&sbi->cp_wait);

	bio_put(bio);
}

72 73 74 75 76 77 78 79 80 81 82 83
/*
 * Low-level block read/write IO operations.
 */
static struct bio *__bio_alloc(struct f2fs_sb_info *sbi, block_t blk_addr,
				int npages, bool is_read)
{
	struct bio *bio;

	/* No failure on bio allocation */
	bio = bio_alloc(GFP_NOIO, npages);

	bio->bi_bdev = sbi->sb->s_bdev;
C
Chao Yu 已提交
84
	bio->bi_iter.bi_sector = SECTOR_FROM_BLOCK(blk_addr);
85
	bio->bi_end_io = is_read ? f2fs_read_end_io : f2fs_write_end_io;
86
	bio->bi_private = sbi;
87 88 89 90

	return bio;
}

J
Jaegeuk Kim 已提交
91
static void __submit_merged_bio(struct f2fs_bio_info *io)
92
{
J
Jaegeuk Kim 已提交
93
	struct f2fs_io_info *fio = &io->fio;
94 95 96 97

	if (!io->bio)
		return;

98
	if (is_read_io(fio->rw))
99
		trace_f2fs_submit_read_bio(io->sbi->sb, fio, io->bio);
100
	else
101
		trace_f2fs_submit_write_bio(io->sbi->sb, fio, io->bio);
102

103
	submit_bio(fio->rw, io->bio);
104 105 106 107
	io->bio = NULL;
}

void f2fs_submit_merged_bio(struct f2fs_sb_info *sbi,
J
Jaegeuk Kim 已提交
108
				enum page_type type, int rw)
109 110 111 112 113 114
{
	enum page_type btype = PAGE_TYPE_OF_BIO(type);
	struct f2fs_bio_info *io;

	io = is_read_io(rw) ? &sbi->read_io : &sbi->write_io[btype];

115
	down_write(&io->io_rwsem);
J
Jaegeuk Kim 已提交
116 117 118 119

	/* change META to META_FLUSH in the checkpoint procedure */
	if (type >= META_FLUSH) {
		io->fio.type = META_FLUSH;
J
Jaegeuk Kim 已提交
120 121 122 123
		if (test_opt(sbi, NOBARRIER))
			io->fio.rw = WRITE_FLUSH | REQ_META | REQ_PRIO;
		else
			io->fio.rw = WRITE_FLUSH_FUA | REQ_META | REQ_PRIO;
J
Jaegeuk Kim 已提交
124 125
	}
	__submit_merged_bio(io);
126
	up_write(&io->io_rwsem);
127 128 129 130 131 132 133
}

/*
 * Fill the locked page with data located in the block address.
 * Return unlocked page.
 */
int f2fs_submit_page_bio(struct f2fs_sb_info *sbi, struct page *page,
134
					struct f2fs_io_info *fio)
135 136 137
{
	struct bio *bio;

138
	trace_f2fs_submit_page_bio(page, fio);
J
Jaegeuk Kim 已提交
139
	f2fs_trace_ios(page, fio, 0);
140 141

	/* Allocate a new bio */
142
	bio = __bio_alloc(sbi, fio->blk_addr, 1, is_read_io(fio->rw));
143 144 145 146 147 148 149

	if (bio_add_page(bio, page, PAGE_CACHE_SIZE, 0) < PAGE_CACHE_SIZE) {
		bio_put(bio);
		f2fs_put_page(page, 1);
		return -EFAULT;
	}

150
	submit_bio(fio->rw, bio);
151 152 153 154
	return 0;
}

void f2fs_submit_page_mbio(struct f2fs_sb_info *sbi, struct page *page,
155
					struct f2fs_io_info *fio)
156
{
J
Jaegeuk Kim 已提交
157
	enum page_type btype = PAGE_TYPE_OF_BIO(fio->type);
158
	struct f2fs_bio_info *io;
159
	bool is_read = is_read_io(fio->rw);
160

161
	io = is_read ? &sbi->read_io : &sbi->write_io[btype];
162

163
	verify_block_addr(sbi, fio->blk_addr);
164

165
	down_write(&io->io_rwsem);
166

167
	if (!is_read)
168 169
		inc_page_count(sbi, F2FS_WRITEBACK);

170
	if (io->bio && (io->last_block_in_bio != fio->blk_addr - 1 ||
J
Jaegeuk Kim 已提交
171 172
						io->fio.rw != fio->rw))
		__submit_merged_bio(io);
173 174
alloc_new:
	if (io->bio == NULL) {
J
Jaegeuk Kim 已提交
175
		int bio_blocks = MAX_BIO_BLOCKS(sbi);
176

177
		io->bio = __bio_alloc(sbi, fio->blk_addr, bio_blocks, is_read);
J
Jaegeuk Kim 已提交
178
		io->fio = *fio;
179 180 181 182
	}

	if (bio_add_page(io->bio, page, PAGE_CACHE_SIZE, 0) <
							PAGE_CACHE_SIZE) {
J
Jaegeuk Kim 已提交
183
		__submit_merged_bio(io);
184 185 186
		goto alloc_new;
	}

187
	io->last_block_in_bio = fio->blk_addr;
J
Jaegeuk Kim 已提交
188
	f2fs_trace_ios(page, fio, 0);
189

190
	up_write(&io->io_rwsem);
191
	trace_f2fs_submit_page_mbio(page, fio);
192 193
}

J
Jaegeuk Kim 已提交
194
/*
195 196 197 198 199
 * Lock ordering for the change of data block address:
 * ->data_page
 *  ->node_page
 *    update block addresses in the node page
 */
J
Jaegeuk Kim 已提交
200
static void __set_data_blkaddr(struct dnode_of_data *dn)
201 202 203 204 205 206
{
	struct f2fs_node *rn;
	__le32 *addr_array;
	struct page *node_page = dn->node_page;
	unsigned int ofs_in_node = dn->ofs_in_node;

207
	f2fs_wait_on_page_writeback(node_page, NODE);
208

209
	rn = F2FS_NODE(node_page);
210 211 212

	/* Get physical address of data block */
	addr_array = blkaddr_in_node(rn);
J
Jaegeuk Kim 已提交
213
	addr_array[ofs_in_node] = cpu_to_le32(dn->data_blkaddr);
214 215 216 217 218
	set_page_dirty(node_page);
}

int reserve_new_block(struct dnode_of_data *dn)
{
219
	struct f2fs_sb_info *sbi = F2FS_I_SB(dn->inode);
220

221
	if (unlikely(is_inode_flag_set(F2FS_I(dn->inode), FI_NO_ALLOC)))
222
		return -EPERM;
223
	if (unlikely(!inc_valid_block_count(sbi, dn->inode, 1)))
224 225
		return -ENOSPC;

226 227
	trace_f2fs_reserve_new_block(dn->inode, dn->nid, dn->ofs_in_node);

228
	dn->data_blkaddr = NEW_ADDR;
J
Jaegeuk Kim 已提交
229
	__set_data_blkaddr(dn);
230
	mark_inode_dirty(dn->inode);
231 232 233 234
	sync_inode_page(dn);
	return 0;
}

235 236 237 238 239 240 241 242
int f2fs_reserve_block(struct dnode_of_data *dn, pgoff_t index)
{
	bool need_put = dn->inode_page ? false : true;
	int err;

	err = get_dnode_of_data(dn, index, ALLOC_NODE);
	if (err)
		return err;
243

244 245
	if (dn->data_blkaddr == NULL_ADDR)
		err = reserve_new_block(dn);
246
	if (err || need_put)
247 248 249 250
		f2fs_put_dnode(dn);
	return err;
}

251 252 253 254 255 256 257 258 259 260 261 262 263 264 265
static void f2fs_map_bh(struct super_block *sb, pgoff_t pgofs,
			struct extent_info *ei, struct buffer_head *bh_result)
{
	unsigned int blkbits = sb->s_blocksize_bits;
	size_t count;

	set_buffer_new(bh_result);
	map_bh(bh_result, sb, ei->blk + pgofs - ei->fofs);
	count = ei->fofs + ei->len - pgofs;
	if (count < (UINT_MAX >> blkbits))
		bh_result->b_size = (count << blkbits);
	else
		bh_result->b_size = UINT_MAX;
}

266 267
static bool lookup_extent_info(struct inode *inode, pgoff_t pgofs,
							struct extent_info *ei)
268 269 270 271 272
{
	struct f2fs_inode_info *fi = F2FS_I(inode);
	pgoff_t start_fofs, end_fofs;
	block_t start_blkaddr;

273
	if (is_inode_flag_set(fi, FI_NO_EXTENT))
274
		return false;
275

276
	read_lock(&fi->ext_lock);
277
	if (fi->ext.len == 0) {
278
		read_unlock(&fi->ext_lock);
279
		return false;
280 281
	}

282 283
	stat_inc_total_hit(inode->i_sb);

284 285
	start_fofs = fi->ext.fofs;
	end_fofs = fi->ext.fofs + fi->ext.len - 1;
286
	start_blkaddr = fi->ext.blk;
287 288

	if (pgofs >= start_fofs && pgofs <= end_fofs) {
289
		*ei = fi->ext;
290
		stat_inc_read_hit(inode->i_sb);
291
		read_unlock(&fi->ext_lock);
292
		return true;
293
	}
294
	read_unlock(&fi->ext_lock);
295
	return false;
296 297
}

298 299
static bool update_extent_info(struct inode *inode, pgoff_t fofs,
								block_t blkaddr)
300
{
301 302
	struct f2fs_inode_info *fi = F2FS_I(inode);
	pgoff_t start_fofs, end_fofs;
303
	block_t start_blkaddr, end_blkaddr;
304
	int need_update = true;
305

306
	if (is_inode_flag_set(fi, FI_NO_EXTENT))
307
		return false;
308

309
	write_lock(&fi->ext_lock);
310 311 312

	start_fofs = fi->ext.fofs;
	end_fofs = fi->ext.fofs + fi->ext.len - 1;
313 314
	start_blkaddr = fi->ext.blk;
	end_blkaddr = fi->ext.blk + fi->ext.len - 1;
315 316 317 318 319 320 321

	/* Drop and initialize the matched extent */
	if (fi->ext.len == 1 && fofs == start_fofs)
		fi->ext.len = 0;

	/* Initial extent */
	if (fi->ext.len == 0) {
322
		if (blkaddr != NULL_ADDR) {
323
			fi->ext.fofs = fofs;
324
			fi->ext.blk = blkaddr;
325 326 327 328 329
			fi->ext.len = 1;
		}
		goto end_update;
	}

N
Namjae Jeon 已提交
330
	/* Front merge */
331
	if (fofs == start_fofs - 1 && blkaddr == start_blkaddr - 1) {
332
		fi->ext.fofs--;
333
		fi->ext.blk--;
334 335 336 337 338
		fi->ext.len++;
		goto end_update;
	}

	/* Back merge */
339
	if (fofs == end_fofs + 1 && blkaddr == end_blkaddr + 1) {
340 341 342 343 344 345 346 347 348 349 350
		fi->ext.len++;
		goto end_update;
	}

	/* Split the existing extent */
	if (fi->ext.len > 1 &&
		fofs >= start_fofs && fofs <= end_fofs) {
		if ((end_fofs - fofs) < (fi->ext.len >> 1)) {
			fi->ext.len = fofs - start_fofs;
		} else {
			fi->ext.fofs = fofs + 1;
351
			fi->ext.blk = start_blkaddr + fofs - start_fofs + 1;
352 353
			fi->ext.len -= fofs - start_fofs + 1;
		}
354 355
	} else {
		need_update = false;
356 357
	}

358 359 360 361 362 363
	/* Finally, if the extent is very fragmented, let's drop the cache. */
	if (fi->ext.len < F2FS_MIN_EXTENT_LEN) {
		fi->ext.len = 0;
		set_inode_flag(fi, FI_NO_EXTENT);
		need_update = true;
	}
364
end_update:
365
	write_unlock(&fi->ext_lock);
366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388
	return need_update;
}

static bool f2fs_lookup_extent_cache(struct inode *inode, pgoff_t pgofs,
							struct extent_info *ei)
{
	return lookup_extent_info(inode, pgofs, ei);
}

void f2fs_update_extent_cache(struct dnode_of_data *dn)
{
	struct f2fs_inode_info *fi = F2FS_I(dn->inode);
	pgoff_t fofs;

	f2fs_bug_on(F2FS_I_SB(dn->inode), dn->data_blkaddr == NEW_ADDR);

	/* Update the page address in the parent node */
	__set_data_blkaddr(dn);

	fofs = start_bidx_of_node(ofs_of_node(dn->node_page), fi) +
							dn->ofs_in_node;

	if (update_extent_info(dn->inode, fofs, dn->data_blkaddr))
389
		sync_inode_page(dn);
390 391
}

392
struct page *find_data_page(struct inode *inode, pgoff_t index, bool sync)
393 394 395 396 397
{
	struct address_space *mapping = inode->i_mapping;
	struct dnode_of_data dn;
	struct page *page;
	int err;
398 399 400 401
	struct f2fs_io_info fio = {
		.type = DATA,
		.rw = sync ? READ_SYNC : READA,
	};
402 403 404 405 406 407 408

	page = find_get_page(mapping, index);
	if (page && PageUptodate(page))
		return page;
	f2fs_put_page(page, 0);

	set_new_dnode(&dn, inode, NULL, NULL, 0);
409
	err = get_dnode_of_data(&dn, index, LOOKUP_NODE);
410 411 412 413 414 415 416 417
	if (err)
		return ERR_PTR(err);
	f2fs_put_dnode(&dn);

	if (dn.data_blkaddr == NULL_ADDR)
		return ERR_PTR(-ENOENT);

	/* By fallocate(), there is no cached page, but with NEW_ADDR */
418
	if (unlikely(dn.data_blkaddr == NEW_ADDR))
419 420
		return ERR_PTR(-EINVAL);

421
	page = grab_cache_page(mapping, index);
422 423 424
	if (!page)
		return ERR_PTR(-ENOMEM);

425 426 427 428 429
	if (PageUptodate(page)) {
		unlock_page(page);
		return page;
	}

430 431
	fio.blk_addr = dn.data_blkaddr;
	err = f2fs_submit_page_bio(F2FS_I_SB(inode), page, &fio);
432 433 434
	if (err)
		return ERR_PTR(err);

435 436
	if (sync) {
		wait_on_page_locked(page);
437
		if (unlikely(!PageUptodate(page))) {
438 439 440
			f2fs_put_page(page, 0);
			return ERR_PTR(-EIO);
		}
441 442 443 444
	}
	return page;
}

J
Jaegeuk Kim 已提交
445
/*
446 447 448 449 450 451 452 453 454 455
 * If it tries to access a hole, return an error.
 * Because, the callers, functions in dir.c and GC, should be able to know
 * whether this page exists or not.
 */
struct page *get_lock_data_page(struct inode *inode, pgoff_t index)
{
	struct address_space *mapping = inode->i_mapping;
	struct dnode_of_data dn;
	struct page *page;
	int err;
456 457 458 459
	struct f2fs_io_info fio = {
		.type = DATA,
		.rw = READ_SYNC,
	};
460
repeat:
461
	page = grab_cache_page(mapping, index);
462 463 464
	if (!page)
		return ERR_PTR(-ENOMEM);

465
	set_new_dnode(&dn, inode, NULL, NULL, 0);
466
	err = get_dnode_of_data(&dn, index, LOOKUP_NODE);
467 468
	if (err) {
		f2fs_put_page(page, 1);
469
		return ERR_PTR(err);
470
	}
471 472
	f2fs_put_dnode(&dn);

473
	if (unlikely(dn.data_blkaddr == NULL_ADDR)) {
474
		f2fs_put_page(page, 1);
475
		return ERR_PTR(-ENOENT);
476
	}
477 478 479 480

	if (PageUptodate(page))
		return page;

J
Jaegeuk Kim 已提交
481 482 483 484 485 486 487 488 489 490 491
	/*
	 * A new dentry page is allocated but not able to be written, since its
	 * new inode page couldn't be allocated due to -ENOSPC.
	 * In such the case, its blkaddr can be remained as NEW_ADDR.
	 * see, f2fs_add_link -> get_new_data_page -> init_inode_metadata.
	 */
	if (dn.data_blkaddr == NEW_ADDR) {
		zero_user_segment(page, 0, PAGE_CACHE_SIZE);
		SetPageUptodate(page);
		return page;
	}
492

493 494
	fio.blk_addr = dn.data_blkaddr;
	err = f2fs_submit_page_bio(F2FS_I_SB(inode), page, &fio);
495
	if (err)
496
		return ERR_PTR(err);
497 498

	lock_page(page);
499
	if (unlikely(!PageUptodate(page))) {
500 501
		f2fs_put_page(page, 1);
		return ERR_PTR(-EIO);
502
	}
503
	if (unlikely(page->mapping != mapping)) {
504 505
		f2fs_put_page(page, 1);
		goto repeat;
506 507 508 509
	}
	return page;
}

J
Jaegeuk Kim 已提交
510
/*
511 512
 * Caller ensures that this data page is never allocated.
 * A new zero-filled data page is allocated in the page cache.
513
 *
C
Chao Yu 已提交
514 515
 * Also, caller should grab and release a rwsem by calling f2fs_lock_op() and
 * f2fs_unlock_op().
516
 * Note that, ipage is set only by make_empty_dir.
517
 */
518
struct page *get_new_data_page(struct inode *inode,
519
		struct page *ipage, pgoff_t index, bool new_i_size)
520 521 522 523 524 525
{
	struct address_space *mapping = inode->i_mapping;
	struct page *page;
	struct dnode_of_data dn;
	int err;

526
	set_new_dnode(&dn, inode, ipage, NULL, 0);
527
	err = f2fs_reserve_block(&dn, index);
528 529
	if (err)
		return ERR_PTR(err);
530
repeat:
531
	page = grab_cache_page(mapping, index);
532 533 534 535
	if (!page) {
		err = -ENOMEM;
		goto put_err;
	}
536 537 538 539 540 541

	if (PageUptodate(page))
		return page;

	if (dn.data_blkaddr == NEW_ADDR) {
		zero_user_segment(page, 0, PAGE_CACHE_SIZE);
542
		SetPageUptodate(page);
543
	} else {
544 545 546 547 548 549
		struct f2fs_io_info fio = {
			.type = DATA,
			.rw = READ_SYNC,
			.blk_addr = dn.data_blkaddr,
		};
		err = f2fs_submit_page_bio(F2FS_I_SB(inode), page, &fio);
550
		if (err)
551 552
			goto put_err;

553
		lock_page(page);
554
		if (unlikely(!PageUptodate(page))) {
555
			f2fs_put_page(page, 1);
556 557
			err = -EIO;
			goto put_err;
558
		}
559
		if (unlikely(page->mapping != mapping)) {
560 561
			f2fs_put_page(page, 1);
			goto repeat;
562 563 564 565 566 567
		}
	}

	if (new_i_size &&
		i_size_read(inode) < ((index + 1) << PAGE_CACHE_SHIFT)) {
		i_size_write(inode, ((index + 1) << PAGE_CACHE_SHIFT));
568 569
		/* Only the directory inode sets new_i_size */
		set_inode_flag(F2FS_I(inode), FI_UPDATE_DIR);
570 571
	}
	return page;
572 573 574 575

put_err:
	f2fs_put_dnode(&dn);
	return ERR_PTR(err);
576 577
}

578 579
static int __allocate_data_block(struct dnode_of_data *dn)
{
580
	struct f2fs_sb_info *sbi = F2FS_I_SB(dn->inode);
581
	struct f2fs_inode_info *fi = F2FS_I(dn->inode);
582 583
	struct f2fs_summary sum;
	struct node_info ni;
584
	int seg = CURSEG_WARM_DATA;
585
	pgoff_t fofs;
586 587 588 589 590 591 592 593 594

	if (unlikely(is_inode_flag_set(F2FS_I(dn->inode), FI_NO_ALLOC)))
		return -EPERM;
	if (unlikely(!inc_valid_block_count(sbi, dn->inode, 1)))
		return -ENOSPC;

	get_node_info(sbi, dn->nid, &ni);
	set_summary(&sum, dn->nid, dn->ofs_in_node, ni.version);

595 596 597 598
	if (dn->ofs_in_node == 0 && dn->inode_page == dn->node_page)
		seg = CURSEG_DIRECT_IO;

	allocate_data_block(sbi, NULL, NULL_ADDR, &dn->data_blkaddr, &sum, seg);
599 600

	/* direct IO doesn't use extent cache to maximize the performance */
J
Jaegeuk Kim 已提交
601
	__set_data_blkaddr(dn);
602

603 604 605 606 607 608
	/* update i_size */
	fofs = start_bidx_of_node(ofs_of_node(dn->node_page), fi) +
							dn->ofs_in_node;
	if (i_size_read(dn->inode) < ((fofs + 1) << PAGE_CACHE_SHIFT))
		i_size_write(dn->inode, ((fofs + 1) << PAGE_CACHE_SHIFT));

609 610 611
	return 0;
}

612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661
static void __allocate_data_blocks(struct inode *inode, loff_t offset,
							size_t count)
{
	struct f2fs_sb_info *sbi = F2FS_I_SB(inode);
	struct dnode_of_data dn;
	u64 start = F2FS_BYTES_TO_BLK(offset);
	u64 len = F2FS_BYTES_TO_BLK(count);
	bool allocated;
	u64 end_offset;

	while (len) {
		f2fs_balance_fs(sbi);
		f2fs_lock_op(sbi);

		/* When reading holes, we need its node page */
		set_new_dnode(&dn, inode, NULL, NULL, 0);
		if (get_dnode_of_data(&dn, start, ALLOC_NODE))
			goto out;

		allocated = false;
		end_offset = ADDRS_PER_PAGE(dn.node_page, F2FS_I(inode));

		while (dn.ofs_in_node < end_offset && len) {
			if (dn.data_blkaddr == NULL_ADDR) {
				if (__allocate_data_block(&dn))
					goto sync_out;
				allocated = true;
			}
			len--;
			start++;
			dn.ofs_in_node++;
		}

		if (allocated)
			sync_inode_page(&dn);

		f2fs_put_dnode(&dn);
		f2fs_unlock_op(sbi);
	}
	return;

sync_out:
	if (allocated)
		sync_inode_page(&dn);
	f2fs_put_dnode(&dn);
out:
	f2fs_unlock_op(sbi);
	return;
}

J
Jaegeuk Kim 已提交
662
/*
C
Chao Yu 已提交
663 664 665 666 667 668
 * get_data_block() now supported readahead/bmap/rw direct_IO with mapped bh.
 * If original data blocks are allocated, then give them to blockdev.
 * Otherwise,
 *     a. preallocate requested block addresses
 *     b. do not use extent cache for better performance
 *     c. give the block addresses to blockdev
669
 */
670 671
static int __get_data_block(struct inode *inode, sector_t iblock,
			struct buffer_head *bh_result, int create, bool fiemap)
672 673 674 675
{
	unsigned int blkbits = inode->i_sb->s_blocksize_bits;
	unsigned maxblocks = bh_result->b_size >> blkbits;
	struct dnode_of_data dn;
676 677 678
	int mode = create ? ALLOC_NODE : LOOKUP_NODE_RA;
	pgoff_t pgofs, end_offset;
	int err = 0, ofs = 1;
679
	struct extent_info ei;
680
	bool allocated = false;
681 682 683 684

	/* Get the page offset from the block offset(iblock) */
	pgofs =	(pgoff_t)(iblock >> (PAGE_CACHE_SHIFT - blkbits));

685
	if (f2fs_lookup_extent_cache(inode, pgofs, &ei)) {
686
		f2fs_map_bh(inode->i_sb, pgofs, &ei, bh_result);
687
		goto out;
688
	}
689

690
	if (create)
691
		f2fs_lock_op(F2FS_I_SB(inode));
692 693 694

	/* When reading holes, we need its node page */
	set_new_dnode(&dn, inode, NULL, NULL, 0);
695
	err = get_dnode_of_data(&dn, pgofs, mode);
696
	if (err) {
697 698 699
		if (err == -ENOENT)
			err = 0;
		goto unlock_out;
700
	}
701
	if (dn.data_blkaddr == NEW_ADDR && !fiemap)
702
		goto put_out;
703

704
	if (dn.data_blkaddr != NULL_ADDR) {
705
		set_buffer_new(bh_result);
706 707 708 709 710 711
		map_bh(bh_result, inode->i_sb, dn.data_blkaddr);
	} else if (create) {
		err = __allocate_data_block(&dn);
		if (err)
			goto put_out;
		allocated = true;
712
		set_buffer_new(bh_result);
713 714 715 716 717
		map_bh(bh_result, inode->i_sb, dn.data_blkaddr);
	} else {
		goto put_out;
	}

718
	end_offset = ADDRS_PER_PAGE(dn.node_page, F2FS_I(inode));
719 720 721 722 723 724 725 726 727 728 729 730 731
	bh_result->b_size = (((size_t)1) << blkbits);
	dn.ofs_in_node++;
	pgofs++;

get_next:
	if (dn.ofs_in_node >= end_offset) {
		if (allocated)
			sync_inode_page(&dn);
		allocated = false;
		f2fs_put_dnode(&dn);

		set_new_dnode(&dn, inode, NULL, NULL, 0);
		err = get_dnode_of_data(&dn, pgofs, mode);
732
		if (err) {
733 734 735 736
			if (err == -ENOENT)
				err = 0;
			goto unlock_out;
		}
737
		if (dn.data_blkaddr == NEW_ADDR && !fiemap)
738 739
			goto put_out;

740
		end_offset = ADDRS_PER_PAGE(dn.node_page, F2FS_I(inode));
741
	}
742

743 744 745 746 747 748 749 750 751
	if (maxblocks > (bh_result->b_size >> blkbits)) {
		block_t blkaddr = datablock_addr(dn.node_page, dn.ofs_in_node);
		if (blkaddr == NULL_ADDR && create) {
			err = __allocate_data_block(&dn);
			if (err)
				goto sync_out;
			allocated = true;
			blkaddr = dn.data_blkaddr;
		}
A
arter97 已提交
752
		/* Give more consecutive addresses for the readahead */
753 754 755 756 757 758 759
		if (blkaddr == (bh_result->b_blocknr + ofs)) {
			ofs++;
			dn.ofs_in_node++;
			pgofs++;
			bh_result->b_size += (((size_t)1) << blkbits);
			goto get_next;
		}
760
	}
761 762 763 764
sync_out:
	if (allocated)
		sync_inode_page(&dn);
put_out:
765
	f2fs_put_dnode(&dn);
766 767
unlock_out:
	if (create)
768
		f2fs_unlock_op(F2FS_I_SB(inode));
769 770 771
out:
	trace_f2fs_get_data_block(inode, iblock, bh_result, err);
	return err;
772 773
}

774 775 776 777 778 779 780 781 782 783 784 785
static int get_data_block(struct inode *inode, sector_t iblock,
			struct buffer_head *bh_result, int create)
{
	return __get_data_block(inode, iblock, bh_result, create, false);
}

static int get_data_block_fiemap(struct inode *inode, sector_t iblock,
			struct buffer_head *bh_result, int create)
{
	return __get_data_block(inode, iblock, bh_result, create, true);
}

J
Jaegeuk Kim 已提交
786 787 788
int f2fs_fiemap(struct inode *inode, struct fiemap_extent_info *fieinfo,
		u64 start, u64 len)
{
789 790
	return generic_block_fiemap(inode, fieinfo,
				start, len, get_data_block_fiemap);
J
Jaegeuk Kim 已提交
791 792
}

793 794
static int f2fs_read_data_page(struct file *file, struct page *page)
{
H
Huajun Li 已提交
795
	struct inode *inode = page->mapping->host;
796
	int ret = -EAGAIN;
H
Huajun Li 已提交
797

798 799
	trace_f2fs_readpage(page, DATA);

A
arter97 已提交
800
	/* If the file has inline data, try to read it directly */
H
Huajun Li 已提交
801 802
	if (f2fs_has_inline_data(inode))
		ret = f2fs_read_inline_data(inode, page);
803
	if (ret == -EAGAIN)
H
Huajun Li 已提交
804 805 806
		ret = mpage_readpage(page, get_data_block);

	return ret;
807 808 809 810 811 812
}

static int f2fs_read_data_pages(struct file *file,
			struct address_space *mapping,
			struct list_head *pages, unsigned nr_pages)
{
H
Huajun Li 已提交
813 814 815 816 817 818
	struct inode *inode = file->f_mapping->host;

	/* If the file has inline data, skip readpages */
	if (f2fs_has_inline_data(inode))
		return 0;

819
	return mpage_readpages(mapping, pages, nr_pages, get_data_block);
820 821
}

J
Jaegeuk Kim 已提交
822
int do_write_data_page(struct page *page, struct f2fs_io_info *fio)
823 824 825 826 827 828
{
	struct inode *inode = page->mapping->host;
	struct dnode_of_data dn;
	int err = 0;

	set_new_dnode(&dn, inode, NULL, NULL, 0);
829
	err = get_dnode_of_data(&dn, page->index, LOOKUP_NODE);
830 831 832
	if (err)
		return err;

833
	fio->blk_addr = dn.data_blkaddr;
834 835

	/* This page is already truncated */
836
	if (fio->blk_addr == NULL_ADDR)
837 838 839 840 841 842 843 844
		goto out_writepage;

	set_page_writeback(page);

	/*
	 * If current allocation needs SSR,
	 * it had better in-place writes for updated data.
	 */
845
	if (unlikely(fio->blk_addr != NEW_ADDR &&
846 847
			!is_cold_data(page) &&
			need_inplace_update(inode))) {
848
		rewrite_data_page(page, fio);
849
		set_inode_flag(F2FS_I(inode), FI_UPDATE_WRITE);
850
	} else {
851
		write_data_page(page, &dn, fio);
852
		f2fs_update_extent_cache(&dn);
853
		set_inode_flag(F2FS_I(inode), FI_APPEND_WRITE);
854 855 856 857 858 859 860 861 862 863
	}
out_writepage:
	f2fs_put_dnode(&dn);
	return err;
}

static int f2fs_write_data_page(struct page *page,
					struct writeback_control *wbc)
{
	struct inode *inode = page->mapping->host;
864
	struct f2fs_sb_info *sbi = F2FS_I_SB(inode);
865 866 867
	loff_t i_size = i_size_read(inode);
	const pgoff_t end_index = ((unsigned long long) i_size)
							>> PAGE_CACHE_SHIFT;
H
Huajun Li 已提交
868
	unsigned offset = 0;
869
	bool need_balance_fs = false;
870
	int err = 0;
J
Jaegeuk Kim 已提交
871 872
	struct f2fs_io_info fio = {
		.type = DATA,
C
Chris Fries 已提交
873
		.rw = (wbc->sync_mode == WB_SYNC_ALL) ? WRITE_SYNC : WRITE,
J
Jaegeuk Kim 已提交
874
	};
875

876 877
	trace_f2fs_writepage(page, DATA);

878
	if (page->index < end_index)
879
		goto write;
880 881 882 883 884 885

	/*
	 * If the offset is out-of-range of file size,
	 * this page does not have to be written to disk.
	 */
	offset = i_size & (PAGE_CACHE_SIZE - 1);
886
	if ((page->index >= end_index + 1) || !offset)
887
		goto out;
888 889

	zero_user_segment(page, offset, PAGE_CACHE_SIZE);
890
write:
891
	if (unlikely(is_sbi_flag_set(sbi, SBI_POR_DOING)))
892
		goto redirty_out;
893 894 895 896 897
	if (f2fs_is_drop_cache(inode))
		goto out;
	if (f2fs_is_volatile_file(inode) && !wbc->for_reclaim &&
			available_free_memory(sbi, BASE_CHECK))
		goto redirty_out;
898

899
	/* Dentry blocks are controlled by checkpoint */
900
	if (S_ISDIR(inode->i_mode)) {
901 902
		if (unlikely(f2fs_cp_error(sbi)))
			goto redirty_out;
J
Jaegeuk Kim 已提交
903
		err = do_write_data_page(page, &fio);
904 905
		goto done;
	}
H
Huajun Li 已提交
906

907 908 909
	/* we should bypass data pages to proceed the kworkder jobs */
	if (unlikely(f2fs_cp_error(sbi))) {
		SetPageError(page);
910
		goto out;
911 912
	}

913
	if (!wbc->for_reclaim)
914
		need_balance_fs = true;
915
	else if (has_not_enough_free_secs(sbi, 0))
916
		goto redirty_out;
917

918
	err = -EAGAIN;
919
	f2fs_lock_op(sbi);
920 921 922
	if (f2fs_has_inline_data(inode))
		err = f2fs_write_inline_data(inode, page);
	if (err == -EAGAIN)
923 924 925 926 927
		err = do_write_data_page(page, &fio);
	f2fs_unlock_op(sbi);
done:
	if (err && err != -ENOENT)
		goto redirty_out;
928 929

	clear_cold_data(page);
930
out:
931
	inode_dec_dirty_pages(inode);
932
	unlock_page(page);
933
	if (need_balance_fs)
934
		f2fs_balance_fs(sbi);
935 936
	if (wbc->for_reclaim)
		f2fs_submit_merged_bio(sbi, DATA, WRITE);
937 938 939
	return 0;

redirty_out:
940
	redirty_page_for_writepage(wbc, page);
941
	return AOP_WRITEPAGE_ACTIVATE;
942 943
}

944 945 946 947 948 949 950 951 952
static int __f2fs_writepage(struct page *page, struct writeback_control *wbc,
			void *data)
{
	struct address_space *mapping = data;
	int ret = mapping->a_ops->writepage(page, wbc);
	mapping_set_error(mapping, ret);
	return ret;
}

953
static int f2fs_write_data_pages(struct address_space *mapping,
954 955 956
			    struct writeback_control *wbc)
{
	struct inode *inode = mapping->host;
957
	struct f2fs_sb_info *sbi = F2FS_I_SB(inode);
958
	bool locked = false;
959
	int ret;
960
	long diff;
961

962 963
	trace_f2fs_writepages(mapping->host, wbc, DATA);

P
P J P 已提交
964 965 966 967
	/* deal with chardevs and other special file */
	if (!mapping->a_ops->writepage)
		return 0;

968
	if (S_ISDIR(inode->i_mode) && wbc->sync_mode == WB_SYNC_NONE &&
969
			get_dirty_pages(inode) < nr_pages_to_skip(sbi, DATA) &&
970
			available_free_memory(sbi, DIRTY_DENTS))
971
		goto skip_write;
972

973
	diff = nr_pages_to_write(sbi, DATA, wbc);
974

975
	if (!S_ISDIR(inode->i_mode)) {
976
		mutex_lock(&sbi->writepages);
977 978
		locked = true;
	}
979
	ret = write_cache_pages(mapping, wbc, __f2fs_writepage, mapping);
980
	if (locked)
981
		mutex_unlock(&sbi->writepages);
J
Jaegeuk Kim 已提交
982 983

	f2fs_submit_merged_bio(sbi, DATA, WRITE);
984 985 986

	remove_dirty_dir_inode(inode);

987
	wbc->nr_to_write = max((long)0, wbc->nr_to_write - diff);
988
	return ret;
989 990

skip_write:
991
	wbc->pages_skipped += get_dirty_pages(inode);
992
	return 0;
993 994
}

995 996 997 998 999 1000
static void f2fs_write_failed(struct address_space *mapping, loff_t to)
{
	struct inode *inode = mapping->host;

	if (to > inode->i_size) {
		truncate_pagecache(inode, inode->i_size);
1001
		truncate_blocks(inode, inode->i_size, true);
1002 1003 1004
	}
}

1005 1006 1007 1008 1009
static int f2fs_write_begin(struct file *file, struct address_space *mapping,
		loff_t pos, unsigned len, unsigned flags,
		struct page **pagep, void **fsdata)
{
	struct inode *inode = mapping->host;
1010
	struct f2fs_sb_info *sbi = F2FS_I_SB(inode);
1011
	struct page *page, *ipage;
1012 1013 1014 1015
	pgoff_t index = ((unsigned long long) pos) >> PAGE_CACHE_SHIFT;
	struct dnode_of_data dn;
	int err = 0;

1016 1017
	trace_f2fs_write_begin(inode, pos, len, flags);

1018
	f2fs_balance_fs(sbi);
1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029

	/*
	 * We should check this at this moment to avoid deadlock on inode page
	 * and #0 page. The locking rule for inline_data conversion should be:
	 * lock_page(page #0) -> lock_page(inode_page)
	 */
	if (index != 0) {
		err = f2fs_convert_inline_inode(inode);
		if (err)
			goto fail;
	}
1030
repeat:
1031
	page = grab_cache_page_write_begin(mapping, index, flags);
1032 1033 1034 1035
	if (!page) {
		err = -ENOMEM;
		goto fail;
	}
1036

1037 1038
	*pagep = page;

1039
	f2fs_lock_op(sbi);
1040 1041 1042

	/* check inline_data */
	ipage = get_node_page(sbi, inode->i_ino);
1043 1044
	if (IS_ERR(ipage)) {
		err = PTR_ERR(ipage);
1045
		goto unlock_fail;
1046
	}
1047

1048 1049
	set_new_dnode(&dn, inode, ipage, ipage, 0);

1050
	if (f2fs_has_inline_data(inode)) {
1051 1052 1053 1054 1055 1056
		if (pos + len <= MAX_INLINE_DATA) {
			read_inline_data(page, ipage);
			set_inode_flag(F2FS_I(inode), FI_DATA_EXIST);
			sync_inode_page(&dn);
			goto put_next;
		}
1057 1058 1059
		err = f2fs_convert_inline_page(&dn, page);
		if (err)
			goto put_fail;
1060
	}
1061 1062
	err = f2fs_reserve_block(&dn, index);
	if (err)
1063
		goto put_fail;
1064
put_next:
1065 1066 1067
	f2fs_put_dnode(&dn);
	f2fs_unlock_op(sbi);

1068 1069 1070
	if ((len == PAGE_CACHE_SIZE) || PageUptodate(page))
		return 0;

1071 1072
	f2fs_wait_on_page_writeback(page, DATA);

1073 1074 1075 1076 1077 1078
	if ((pos & PAGE_CACHE_MASK) >= i_size_read(inode)) {
		unsigned start = pos & (PAGE_CACHE_SIZE - 1);
		unsigned end = start + len;

		/* Reading beyond i_size is simple: memset to zero */
		zero_user_segments(page, 0, start, end, PAGE_CACHE_SIZE);
1079
		goto out;
1080 1081
	}

1082
	if (dn.data_blkaddr == NEW_ADDR) {
1083 1084
		zero_user_segment(page, 0, PAGE_CACHE_SIZE);
	} else {
1085 1086 1087 1088 1089 1090
		struct f2fs_io_info fio = {
			.type = DATA,
			.rw = READ_SYNC,
			.blk_addr = dn.data_blkaddr,
		};
		err = f2fs_submit_page_bio(sbi, page, &fio);
1091 1092
		if (err)
			goto fail;
1093

1094
		lock_page(page);
1095
		if (unlikely(!PageUptodate(page))) {
1096
			f2fs_put_page(page, 1);
1097 1098
			err = -EIO;
			goto fail;
1099
		}
1100
		if (unlikely(page->mapping != mapping)) {
1101 1102
			f2fs_put_page(page, 1);
			goto repeat;
1103 1104
		}
	}
1105
out:
1106 1107 1108
	SetPageUptodate(page);
	clear_cold_data(page);
	return 0;
1109

1110 1111
put_fail:
	f2fs_put_dnode(&dn);
1112 1113
unlock_fail:
	f2fs_unlock_op(sbi);
1114
	f2fs_put_page(page, 1);
1115 1116 1117
fail:
	f2fs_write_failed(mapping, pos + len);
	return err;
1118 1119
}

1120 1121 1122 1123 1124 1125 1126
static int f2fs_write_end(struct file *file,
			struct address_space *mapping,
			loff_t pos, unsigned len, unsigned copied,
			struct page *page, void *fsdata)
{
	struct inode *inode = page->mapping->host;

1127 1128
	trace_f2fs_write_end(inode, pos, len, copied);

1129
	set_page_dirty(page);
1130 1131 1132 1133 1134 1135 1136

	if (pos + copied > i_size_read(inode)) {
		i_size_write(inode, pos + copied);
		mark_inode_dirty(inode);
		update_inode_page(inode);
	}

1137
	f2fs_put_page(page, 1);
1138 1139 1140
	return copied;
}

1141
static int check_direct_IO(struct inode *inode, int rw,
A
Al Viro 已提交
1142
		struct iov_iter *iter, loff_t offset)
1143 1144 1145 1146 1147 1148 1149 1150 1151
{
	unsigned blocksize_mask = inode->i_sb->s_blocksize - 1;

	if (rw == READ)
		return 0;

	if (offset & blocksize_mask)
		return -EINVAL;

A
Al Viro 已提交
1152 1153 1154
	if (iov_iter_alignment(iter) & blocksize_mask)
		return -EINVAL;

1155 1156 1157
	return 0;
}

1158
static ssize_t f2fs_direct_IO(int rw, struct kiocb *iocb,
A
Al Viro 已提交
1159
		struct iov_iter *iter, loff_t offset)
1160 1161
{
	struct file *file = iocb->ki_filp;
1162 1163 1164 1165
	struct address_space *mapping = file->f_mapping;
	struct inode *inode = mapping->host;
	size_t count = iov_iter_count(iter);
	int err;
1166

1167 1168 1169 1170 1171 1172
	/* we don't need to use inline_data strictly */
	if (f2fs_has_inline_data(inode)) {
		err = f2fs_convert_inline_inode(inode);
		if (err)
			return err;
	}
H
Huajun Li 已提交
1173

A
Al Viro 已提交
1174
	if (check_direct_IO(inode, rw, iter, offset))
1175 1176
		return 0;

1177 1178
	trace_f2fs_direct_IO_enter(inode, offset, count, rw);

1179 1180 1181
	if (rw & WRITE)
		__allocate_data_blocks(inode, offset, count);

1182 1183 1184
	err = blockdev_direct_IO(rw, iocb, inode, iter, offset, get_data_block);
	if (err < 0 && (rw & WRITE))
		f2fs_write_failed(mapping, offset + count);
1185 1186 1187

	trace_f2fs_direct_IO_exit(inode, offset, count, rw, err);

1188
	return err;
1189 1190
}

1191 1192
void f2fs_invalidate_page(struct page *page, unsigned int offset,
							unsigned int length)
1193 1194
{
	struct inode *inode = page->mapping->host;
1195
	struct f2fs_sb_info *sbi = F2FS_I_SB(inode);
1196

1197 1198
	if (inode->i_ino >= F2FS_ROOT_INO(sbi) &&
		(offset % PAGE_CACHE_SIZE || length != PAGE_CACHE_SIZE))
1199 1200
		return;

1201 1202 1203 1204 1205 1206 1207 1208
	if (PageDirty(page)) {
		if (inode->i_ino == F2FS_META_INO(sbi))
			dec_page_count(sbi, F2FS_DIRTY_META);
		else if (inode->i_ino == F2FS_NODE_INO(sbi))
			dec_page_count(sbi, F2FS_DIRTY_NODES);
		else
			inode_dec_dirty_pages(inode);
	}
1209 1210 1211
	ClearPagePrivate(page);
}

1212
int f2fs_release_page(struct page *page, gfp_t wait)
1213
{
1214 1215 1216 1217
	/* If this is dirty page, keep PagePrivate */
	if (PageDirty(page))
		return 0;

1218
	ClearPagePrivate(page);
1219
	return 1;
1220 1221 1222 1223 1224 1225 1226
}

static int f2fs_set_data_page_dirty(struct page *page)
{
	struct address_space *mapping = page->mapping;
	struct inode *inode = mapping->host;

1227 1228
	trace_f2fs_set_page_dirty(page, DATA);

1229
	SetPageUptodate(page);
1230

1231
	if (f2fs_is_atomic_file(inode)) {
1232 1233 1234 1235
		register_inmem_page(inode, page);
		return 1;
	}

1236 1237
	mark_inode_dirty(inode);

1238 1239
	if (!PageDirty(page)) {
		__set_page_dirty_nobuffers(page);
1240
		update_dirty_page(inode, page);
1241 1242 1243 1244 1245
		return 1;
	}
	return 0;
}

J
Jaegeuk Kim 已提交
1246 1247
static sector_t f2fs_bmap(struct address_space *mapping, sector_t block)
{
1248 1249
	struct inode *inode = mapping->host;

1250 1251 1252 1253 1254 1255
	/* we don't need to use inline_data strictly */
	if (f2fs_has_inline_data(inode)) {
		int err = f2fs_convert_inline_inode(inode);
		if (err)
			return err;
	}
1256
	return generic_block_bmap(mapping, block, get_data_block);
J
Jaegeuk Kim 已提交
1257 1258
}

1259 1260 1261 1262 1263 1264
const struct address_space_operations f2fs_dblock_aops = {
	.readpage	= f2fs_read_data_page,
	.readpages	= f2fs_read_data_pages,
	.writepage	= f2fs_write_data_page,
	.writepages	= f2fs_write_data_pages,
	.write_begin	= f2fs_write_begin,
1265
	.write_end	= f2fs_write_end,
1266
	.set_page_dirty	= f2fs_set_data_page_dirty,
1267 1268
	.invalidatepage	= f2fs_invalidate_page,
	.releasepage	= f2fs_release_page,
1269
	.direct_IO	= f2fs_direct_IO,
J
Jaegeuk Kim 已提交
1270
	.bmap		= f2fs_bmap,
1271
};