data.c 22.9 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"
25
#include <trace/events/f2fs.h>
26

27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51
/*
 * Low-level block read/write IO operations.
 */
static struct bio *__bio_alloc(struct block_device *bdev, int npages)
{
	struct bio *bio;

	/* No failure on bio allocation */
	bio = bio_alloc(GFP_NOIO, npages);
	bio->bi_bdev = bdev;
	bio->bi_private = NULL;
	return bio;
}

static void f2fs_read_end_io(struct bio *bio, int err)
{
	const int uptodate = test_bit(BIO_UPTODATE, &bio->bi_flags);
	struct bio_vec *bvec = bio->bi_io_vec + bio->bi_vcnt - 1;

	do {
		struct page *page = bvec->bv_page;

		if (--bvec >= bio->bi_io_vec)
			prefetchw(&bvec->bv_page->flags);

52
		if (unlikely(!uptodate)) {
53 54
			ClearPageUptodate(page);
			SetPageError(page);
55 56
		} else {
			SetPageUptodate(page);
57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75
		}
		unlock_page(page);
	} while (bvec >= bio->bi_io_vec);

	bio_put(bio);
}

static void f2fs_write_end_io(struct bio *bio, int err)
{
	const int uptodate = test_bit(BIO_UPTODATE, &bio->bi_flags);
	struct bio_vec *bvec = bio->bi_io_vec + bio->bi_vcnt - 1;
	struct f2fs_sb_info *sbi = F2FS_SB(bvec->bv_page->mapping->host->i_sb);

	do {
		struct page *page = bvec->bv_page;

		if (--bvec >= bio->bi_io_vec)
			prefetchw(&bvec->bv_page->flags);

76
		if (unlikely(!uptodate)) {
77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196
			SetPageError(page);
			set_bit(AS_EIO, &page->mapping->flags);
			set_ckpt_flags(sbi->ckpt, CP_ERROR_FLAG);
			sbi->sb->s_flags |= MS_RDONLY;
		}
		end_page_writeback(page);
		dec_page_count(sbi, F2FS_WRITEBACK);
	} while (bvec >= bio->bi_io_vec);

	if (bio->bi_private)
		complete(bio->bi_private);

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

	bio_put(bio);
}

static void __submit_merged_bio(struct f2fs_sb_info *sbi,
				struct f2fs_bio_info *io,
				enum page_type type, bool sync, int rw)
{
	enum page_type btype = PAGE_TYPE_OF_BIO(type);

	if (!io->bio)
		return;

	if (btype == META)
		rw |= REQ_META;

	if (is_read_io(rw)) {
		if (sync)
			rw |= READ_SYNC;
		submit_bio(rw, io->bio);
		trace_f2fs_submit_read_bio(sbi->sb, rw, type, io->bio);
		io->bio = NULL;
		return;
	}

	if (sync)
		rw |= WRITE_SYNC;
	if (type >= META_FLUSH)
		rw |= WRITE_FLUSH_FUA;

	/*
	 * META_FLUSH is only from the checkpoint procedure, and we should wait
	 * this metadata bio for FS consistency.
	 */
	if (type == META_FLUSH) {
		DECLARE_COMPLETION_ONSTACK(wait);
		io->bio->bi_private = &wait;
		submit_bio(rw, io->bio);
		wait_for_completion(&wait);
	} else {
		submit_bio(rw, io->bio);
	}
	trace_f2fs_submit_write_bio(sbi->sb, rw, btype, io->bio);
	io->bio = NULL;
}

void f2fs_submit_merged_bio(struct f2fs_sb_info *sbi,
				enum page_type type, bool sync, int rw)
{
	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];

	mutex_lock(&io->io_mutex);
	__submit_merged_bio(sbi, io, type, sync, rw);
	mutex_unlock(&io->io_mutex);
}

/*
 * 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,
					block_t blk_addr, int rw)
{
	struct block_device *bdev = sbi->sb->s_bdev;
	struct bio *bio;

	trace_f2fs_submit_page_bio(page, blk_addr, rw);

	/* Allocate a new bio */
	bio = __bio_alloc(bdev, 1);

	/* Initialize the bio */
	bio->bi_sector = SECTOR_FROM_BLOCK(sbi, blk_addr);
	bio->bi_end_io = is_read_io(rw) ? f2fs_read_end_io : f2fs_write_end_io;

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

	submit_bio(rw, bio);
	return 0;
}

void f2fs_submit_page_mbio(struct f2fs_sb_info *sbi, struct page *page,
			block_t blk_addr, enum page_type type, int rw)
{
	enum page_type btype = PAGE_TYPE_OF_BIO(type);
	struct block_device *bdev = sbi->sb->s_bdev;
	struct f2fs_bio_info *io;
	int bio_blocks;

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

	verify_block_addr(sbi, blk_addr);

	mutex_lock(&io->io_mutex);

	if (!is_read_io(rw))
		inc_page_count(sbi, F2FS_WRITEBACK);

197 198 199
	if (io->bio && (io->last_block_in_bio != blk_addr - 1 ||
						io->rw_flag != rw))
		__submit_merged_bio(sbi, io, type, false, io->rw_flag);
200 201 202 203 204 205 206
alloc_new:
	if (io->bio == NULL) {
		bio_blocks = MAX_BIO_BLOCKS(max_hw_blocks(sbi));
		io->bio = __bio_alloc(bdev, bio_blocks);
		io->bio->bi_sector = SECTOR_FROM_BLOCK(sbi, blk_addr);
		io->bio->bi_end_io = is_read_io(rw) ? f2fs_read_end_io :
							f2fs_write_end_io;
207
		io->rw_flag = rw;
208 209 210 211 212 213 214 215 216
		/*
		 * The end_io will be assigned at the sumbission phase.
		 * Until then, let bio_add_page() merge consecutive IOs as much
		 * as possible.
		 */
	}

	if (bio_add_page(io->bio, page, PAGE_CACHE_SIZE, 0) <
							PAGE_CACHE_SIZE) {
217
		__submit_merged_bio(sbi, io, type, false, rw);
218 219 220 221 222 223 224 225 226
		goto alloc_new;
	}

	io->last_block_in_bio = blk_addr;

	mutex_unlock(&io->io_mutex);
	trace_f2fs_submit_page_mbio(page, rw, type, blk_addr);
}

J
Jaegeuk Kim 已提交
227
/*
228 229 230 231 232 233 234 235 236 237 238 239
 * Lock ordering for the change of data block address:
 * ->data_page
 *  ->node_page
 *    update block addresses in the node page
 */
static void __set_data_blkaddr(struct dnode_of_data *dn, block_t new_addr)
{
	struct f2fs_node *rn;
	__le32 *addr_array;
	struct page *node_page = dn->node_page;
	unsigned int ofs_in_node = dn->ofs_in_node;

J
Jin Xu 已提交
240
	f2fs_wait_on_page_writeback(node_page, NODE, false);
241

242
	rn = F2FS_NODE(node_page);
243 244 245 246 247 248 249 250 251 252 253

	/* Get physical address of data block */
	addr_array = blkaddr_in_node(rn);
	addr_array[ofs_in_node] = cpu_to_le32(new_addr);
	set_page_dirty(node_page);
}

int reserve_new_block(struct dnode_of_data *dn)
{
	struct f2fs_sb_info *sbi = F2FS_SB(dn->inode->i_sb);

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

259 260
	trace_f2fs_reserve_new_block(dn->inode, dn->nid, dn->ofs_in_node);

261 262 263 264 265 266
	__set_data_blkaddr(dn, NEW_ADDR);
	dn->data_blkaddr = NEW_ADDR;
	sync_inode_page(dn);
	return 0;
}

267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282
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;
	if (dn->data_blkaddr == NULL_ADDR)
		err = reserve_new_block(dn);

	if (need_put)
		f2fs_put_dnode(dn);
	return err;
}

283 284 285 286 287 288 289
static int check_extent_cache(struct inode *inode, pgoff_t pgofs,
					struct buffer_head *bh_result)
{
	struct f2fs_inode_info *fi = F2FS_I(inode);
	pgoff_t start_fofs, end_fofs;
	block_t start_blkaddr;

290 291 292
	if (is_inode_flag_set(fi, FI_NO_EXTENT))
		return 0;

293 294 295 296 297 298
	read_lock(&fi->ext.ext_lock);
	if (fi->ext.len == 0) {
		read_unlock(&fi->ext.ext_lock);
		return 0;
	}

299 300
	stat_inc_total_hit(inode->i_sb);

301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317
	start_fofs = fi->ext.fofs;
	end_fofs = fi->ext.fofs + fi->ext.len - 1;
	start_blkaddr = fi->ext.blk_addr;

	if (pgofs >= start_fofs && pgofs <= end_fofs) {
		unsigned int blkbits = inode->i_sb->s_blocksize_bits;
		size_t count;

		clear_buffer_new(bh_result);
		map_bh(bh_result, inode->i_sb,
				start_blkaddr + pgofs - start_fofs);
		count = end_fofs - pgofs + 1;
		if (count < (UINT_MAX >> blkbits))
			bh_result->b_size = (count << blkbits);
		else
			bh_result->b_size = UINT_MAX;

318
		stat_inc_read_hit(inode->i_sb);
319 320 321 322 323 324 325 326 327 328 329 330
		read_unlock(&fi->ext.ext_lock);
		return 1;
	}
	read_unlock(&fi->ext.ext_lock);
	return 0;
}

void update_extent_cache(block_t blk_addr, struct dnode_of_data *dn)
{
	struct f2fs_inode_info *fi = F2FS_I(dn->inode);
	pgoff_t fofs, start_fofs, end_fofs;
	block_t start_blkaddr, end_blkaddr;
331
	int need_update = true;
332

333
	f2fs_bug_on(blk_addr == NEW_ADDR);
334 335
	fofs = start_bidx_of_node(ofs_of_node(dn->node_page), fi) +
							dn->ofs_in_node;
336 337 338 339

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

340 341 342
	if (is_inode_flag_set(fi, FI_NO_EXTENT))
		return;

343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363
	write_lock(&fi->ext.ext_lock);

	start_fofs = fi->ext.fofs;
	end_fofs = fi->ext.fofs + fi->ext.len - 1;
	start_blkaddr = fi->ext.blk_addr;
	end_blkaddr = fi->ext.blk_addr + fi->ext.len - 1;

	/* 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) {
		if (blk_addr != NULL_ADDR) {
			fi->ext.fofs = fofs;
			fi->ext.blk_addr = blk_addr;
			fi->ext.len = 1;
		}
		goto end_update;
	}

N
Namjae Jeon 已提交
364
	/* Front merge */
365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388
	if (fofs == start_fofs - 1 && blk_addr == start_blkaddr - 1) {
		fi->ext.fofs--;
		fi->ext.blk_addr--;
		fi->ext.len++;
		goto end_update;
	}

	/* Back merge */
	if (fofs == end_fofs + 1 && blk_addr == end_blkaddr + 1) {
		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;
			fi->ext.blk_addr = start_blkaddr +
					fofs - start_fofs + 1;
			fi->ext.len -= fofs - start_fofs + 1;
		}
389 390
	} else {
		need_update = false;
391 392
	}

393 394 395 396 397 398
	/* 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;
	}
399 400
end_update:
	write_unlock(&fi->ext.ext_lock);
401 402 403
	if (need_update)
		sync_inode_page(dn);
	return;
404 405
}

406
struct page *find_data_page(struct inode *inode, pgoff_t index, bool sync)
407 408 409 410 411 412 413 414 415 416 417 418 419
{
	struct f2fs_sb_info *sbi = F2FS_SB(inode->i_sb);
	struct address_space *mapping = inode->i_mapping;
	struct dnode_of_data dn;
	struct page *page;
	int err;

	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);
420
	err = get_dnode_of_data(&dn, index, LOOKUP_NODE);
421 422 423 424 425 426 427 428
	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 */
429
	if (unlikely(dn.data_blkaddr == NEW_ADDR))
430 431
		return ERR_PTR(-EINVAL);

432
	page = grab_cache_page_write_begin(mapping, index, AOP_FLAG_NOFS);
433 434 435
	if (!page)
		return ERR_PTR(-ENOMEM);

436 437 438 439 440
	if (PageUptodate(page)) {
		unlock_page(page);
		return page;
	}

441
	err = f2fs_submit_page_bio(sbi, page, dn.data_blkaddr,
442
					sync ? READ_SYNC : READA);
443 444 445
	if (err)
		return ERR_PTR(err);

446 447
	if (sync) {
		wait_on_page_locked(page);
448
		if (unlikely(!PageUptodate(page))) {
449 450 451
			f2fs_put_page(page, 0);
			return ERR_PTR(-EIO);
		}
452 453 454 455
	}
	return page;
}

J
Jaegeuk Kim 已提交
456
/*
457 458 459 460 461 462 463 464 465 466 467 468
 * 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 f2fs_sb_info *sbi = F2FS_SB(inode->i_sb);
	struct address_space *mapping = inode->i_mapping;
	struct dnode_of_data dn;
	struct page *page;
	int err;

469
repeat:
470
	page = grab_cache_page_write_begin(mapping, index, AOP_FLAG_NOFS);
471 472 473
	if (!page)
		return ERR_PTR(-ENOMEM);

474
	set_new_dnode(&dn, inode, NULL, NULL, 0);
475
	err = get_dnode_of_data(&dn, index, LOOKUP_NODE);
476 477
	if (err) {
		f2fs_put_page(page, 1);
478
		return ERR_PTR(err);
479
	}
480 481
	f2fs_put_dnode(&dn);

482
	if (unlikely(dn.data_blkaddr == NULL_ADDR)) {
483
		f2fs_put_page(page, 1);
484
		return ERR_PTR(-ENOENT);
485
	}
486 487 488 489

	if (PageUptodate(page))
		return page;

J
Jaegeuk Kim 已提交
490 491 492 493 494 495 496 497 498 499 500
	/*
	 * 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;
	}
501

502
	err = f2fs_submit_page_bio(sbi, page, dn.data_blkaddr, READ_SYNC);
503
	if (err)
504
		return ERR_PTR(err);
505 506

	lock_page(page);
507
	if (unlikely(!PageUptodate(page))) {
508 509
		f2fs_put_page(page, 1);
		return ERR_PTR(-EIO);
510
	}
511
	if (unlikely(page->mapping != mapping)) {
512 513
		f2fs_put_page(page, 1);
		goto repeat;
514 515 516 517
	}
	return page;
}

J
Jaegeuk Kim 已提交
518
/*
519 520
 * Caller ensures that this data page is never allocated.
 * A new zero-filled data page is allocated in the page cache.
521 522 523
 *
 * Also, caller should grab and release a mutex by calling mutex_lock_op() and
 * mutex_unlock_op().
524
 * Note that, npage is set only by make_empty_dir.
525
 */
526 527
struct page *get_new_data_page(struct inode *inode,
		struct page *npage, pgoff_t index, bool new_i_size)
528 529 530 531 532 533 534
{
	struct f2fs_sb_info *sbi = F2FS_SB(inode->i_sb);
	struct address_space *mapping = inode->i_mapping;
	struct page *page;
	struct dnode_of_data dn;
	int err;

535
	set_new_dnode(&dn, inode, npage, npage, 0);
536
	err = f2fs_reserve_block(&dn, index);
537 538
	if (err)
		return ERR_PTR(err);
539
repeat:
540 541 542 543 544 545 546 547 548
	page = grab_cache_page(mapping, index);
	if (!page)
		return ERR_PTR(-ENOMEM);

	if (PageUptodate(page))
		return page;

	if (dn.data_blkaddr == NEW_ADDR) {
		zero_user_segment(page, 0, PAGE_CACHE_SIZE);
549
		SetPageUptodate(page);
550
	} else {
551 552
		err = f2fs_submit_page_bio(sbi, page, dn.data_blkaddr,
								READ_SYNC);
553
		if (err)
554
			return ERR_PTR(err);
555
		lock_page(page);
556
		if (unlikely(!PageUptodate(page))) {
557 558
			f2fs_put_page(page, 1);
			return ERR_PTR(-EIO);
559
		}
560
		if (unlikely(page->mapping != mapping)) {
561 562
			f2fs_put_page(page, 1);
			goto repeat;
563 564 565 566 567 568
		}
	}

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

J
Jaegeuk Kim 已提交
576
/*
577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593
 * This function should be used by the data read flow only where it
 * does not check the "create" flag that indicates block allocation.
 * The reason for this special functionality is to exploit VFS readahead
 * mechanism.
 */
static int get_data_block_ro(struct inode *inode, sector_t iblock,
			struct buffer_head *bh_result, int create)
{
	unsigned int blkbits = inode->i_sb->s_blocksize_bits;
	unsigned maxblocks = bh_result->b_size >> blkbits;
	struct dnode_of_data dn;
	pgoff_t pgofs;
	int err;

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

594 595
	if (check_extent_cache(inode, pgofs, bh_result)) {
		trace_f2fs_get_data_block(inode, iblock, bh_result, 0);
596
		return 0;
597
	}
598 599 600

	/* When reading holes, we need its node page */
	set_new_dnode(&dn, inode, NULL, NULL, 0);
601
	err = get_dnode_of_data(&dn, pgofs, LOOKUP_NODE_RA);
602 603
	if (err) {
		trace_f2fs_get_data_block(inode, iblock, bh_result, err);
604
		return (err == -ENOENT) ? 0 : err;
605
	}
606 607

	/* It does not support data allocation */
608
	f2fs_bug_on(create);
609 610 611 612 613 614

	if (dn.data_blkaddr != NEW_ADDR && dn.data_blkaddr != NULL_ADDR) {
		int i;
		unsigned int end_offset;

		end_offset = IS_INODE(dn.node_page) ?
615
				ADDRS_PER_INODE(F2FS_I(inode)) :
616 617 618 619 620 621 622 623 624 625 626
				ADDRS_PER_BLOCK;

		clear_buffer_new(bh_result);

		/* Give more consecutive addresses for the read ahead */
		for (i = 0; i < end_offset - dn.ofs_in_node; i++)
			if (((datablock_addr(dn.node_page,
							dn.ofs_in_node + i))
				!= (dn.data_blkaddr + i)) || maxblocks == i)
				break;
		map_bh(bh_result, inode->i_sb, dn.data_blkaddr);
627
		bh_result->b_size = (((size_t)i) << blkbits);
628 629
	}
	f2fs_put_dnode(&dn);
630
	trace_f2fs_get_data_block(inode, iblock, bh_result, 0);
631 632 633 634 635 636 637 638 639 640 641 642 643 644 645
	return 0;
}

static int f2fs_read_data_page(struct file *file, struct page *page)
{
	return mpage_readpage(page, get_data_block_ro);
}

static int f2fs_read_data_pages(struct file *file,
			struct address_space *mapping,
			struct list_head *pages, unsigned nr_pages)
{
	return mpage_readpages(mapping, pages, nr_pages, get_data_block_ro);
}

646
int do_write_data_page(struct page *page, struct writeback_control *wbc)
647 648 649 650 651 652 653
{
	struct inode *inode = page->mapping->host;
	block_t old_blk_addr, new_blk_addr;
	struct dnode_of_data dn;
	int err = 0;

	set_new_dnode(&dn, inode, NULL, NULL, 0);
654
	err = get_dnode_of_data(&dn, page->index, LOOKUP_NODE);
655 656 657 658 659 660 661 662 663 664 665 666 667 668 669
	if (err)
		return err;

	old_blk_addr = dn.data_blkaddr;

	/* This page is already truncated */
	if (old_blk_addr == NULL_ADDR)
		goto out_writepage;

	set_page_writeback(page);

	/*
	 * If current allocation needs SSR,
	 * it had better in-place writes for updated data.
	 */
670 671 672
	if (unlikely(old_blk_addr != NEW_ADDR &&
			!is_cold_data(page) &&
			need_inplace_update(inode))) {
673
		rewrite_data_page(F2FS_SB(inode->i_sb), page,
674
						old_blk_addr, wbc);
675 676
	} else {
		write_data_page(inode, page, &dn,
677
				old_blk_addr, &new_blk_addr, wbc);
678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693
		update_extent_cache(new_blk_addr, &dn);
	}
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;
	struct f2fs_sb_info *sbi = F2FS_SB(inode->i_sb);
	loff_t i_size = i_size_read(inode);
	const pgoff_t end_index = ((unsigned long long) i_size)
							>> PAGE_CACHE_SHIFT;
	unsigned offset;
694
	bool need_balance_fs = false;
695 696 697
	int err = 0;

	if (page->index < end_index)
698
		goto write;
699 700 701 702 703 704 705 706 707 708 709

	/*
	 * 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);
	if ((page->index >= end_index + 1) || !offset) {
		if (S_ISDIR(inode->i_mode)) {
			dec_page_count(sbi, F2FS_DIRTY_DENTS);
			inode_dec_dirty_dents(inode);
		}
710
		goto out;
711 712 713
	}

	zero_user_segment(page, offset, PAGE_CACHE_SIZE);
714
write:
715
	if (unlikely(sbi->por_doing)) {
716
		err = AOP_WRITEPAGE_ACTIVATE;
717
		goto redirty_out;
718
	}
719

720
	/* Dentry blocks are controlled by checkpoint */
721 722 723
	if (S_ISDIR(inode->i_mode)) {
		dec_page_count(sbi, F2FS_DIRTY_DENTS);
		inode_dec_dirty_dents(inode);
724
		err = do_write_data_page(page, wbc);
725
	} else {
726
		f2fs_lock_op(sbi);
727
		err = do_write_data_page(page, wbc);
728
		f2fs_unlock_op(sbi);
729
		need_balance_fs = true;
730
	}
731 732 733 734
	if (err == -ENOENT)
		goto out;
	else if (err)
		goto redirty_out;
735 736

	if (wbc->for_reclaim)
737
		f2fs_submit_merged_bio(sbi, DATA, true, WRITE);
738 739

	clear_cold_data(page);
740
out:
741
	unlock_page(page);
742
	if (need_balance_fs)
743 744 745 746 747 748
		f2fs_balance_fs(sbi);
	return 0;

redirty_out:
	wbc->pages_skipped++;
	set_page_dirty(page);
749
	return err;
750 751 752 753
}

#define MAX_DESIRED_PAGES_WP	4096

754 755 756 757 758 759 760 761 762
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;
}

763
static int f2fs_write_data_pages(struct address_space *mapping,
764 765 766 767
			    struct writeback_control *wbc)
{
	struct inode *inode = mapping->host;
	struct f2fs_sb_info *sbi = F2FS_SB(inode->i_sb);
768
	bool locked = false;
769 770 771
	int ret;
	long excess_nrtw = 0, desired_nrtw;

P
P J P 已提交
772 773 774 775
	/* deal with chardevs and other special file */
	if (!mapping->a_ops->writepage)
		return 0;

776 777 778 779 780 781
	if (wbc->nr_to_write < MAX_DESIRED_PAGES_WP) {
		desired_nrtw = MAX_DESIRED_PAGES_WP;
		excess_nrtw = desired_nrtw - wbc->nr_to_write;
		wbc->nr_to_write = desired_nrtw;
	}

782
	if (!S_ISDIR(inode->i_mode)) {
783
		mutex_lock(&sbi->writepages);
784 785
		locked = true;
	}
786
	ret = write_cache_pages(mapping, wbc, __f2fs_writepage, mapping);
787
	if (locked)
788
		mutex_unlock(&sbi->writepages);
789
	f2fs_submit_merged_bio(sbi, DATA, wbc->sync_mode == WB_SYNC_ALL, WRITE);
790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808

	remove_dirty_dir_inode(inode);

	wbc->nr_to_write -= excess_nrtw;
	return ret;
}

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;
	struct f2fs_sb_info *sbi = F2FS_SB(inode->i_sb);
	struct page *page;
	pgoff_t index = ((unsigned long long) pos) >> PAGE_CACHE_SHIFT;
	struct dnode_of_data dn;
	int err = 0;

	f2fs_balance_fs(sbi);
809
repeat:
810 811 812 813 814
	page = grab_cache_page_write_begin(mapping, index, flags);
	if (!page)
		return -ENOMEM;
	*pagep = page;

815
	f2fs_lock_op(sbi);
816
	set_new_dnode(&dn, inode, NULL, NULL, 0);
817
	err = f2fs_reserve_block(&dn, index);
818
	f2fs_unlock_op(sbi);
819

820 821 822 823 824
	if (err) {
		f2fs_put_page(page, 1);
		return err;
	}

825 826 827 828 829 830 831 832 833
	if ((len == PAGE_CACHE_SIZE) || PageUptodate(page))
		return 0;

	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);
834
		goto out;
835 836 837 838 839
	}

	if (dn.data_blkaddr == NEW_ADDR) {
		zero_user_segment(page, 0, PAGE_CACHE_SIZE);
	} else {
840 841
		err = f2fs_submit_page_bio(sbi, page, dn.data_blkaddr,
							READ_SYNC);
842
		if (err)
843
			return err;
844
		lock_page(page);
845
		if (unlikely(!PageUptodate(page))) {
846 847
			f2fs_put_page(page, 1);
			return -EIO;
848
		}
849
		if (unlikely(page->mapping != mapping)) {
850 851
			f2fs_put_page(page, 1);
			goto repeat;
852 853
		}
	}
854
out:
855 856 857 858 859
	SetPageUptodate(page);
	clear_cold_data(page);
	return 0;
}

860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875
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;

	SetPageUptodate(page);
	set_page_dirty(page);

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

876
	f2fs_put_page(page, 1);
877 878 879
	return copied;
}

880 881 882 883 884 885 886 887 888 889 890 891 892 893
static ssize_t f2fs_direct_IO(int rw, struct kiocb *iocb,
		const struct iovec *iov, loff_t offset, unsigned long nr_segs)
{
	struct file *file = iocb->ki_filp;
	struct inode *inode = file->f_mapping->host;

	if (rw == WRITE)
		return 0;

	/* Needs synchronization with the cleaner */
	return blockdev_direct_IO(rw, iocb, inode, iov, offset, nr_segs,
						  get_data_block_ro);
}

894 895
static void f2fs_invalidate_data_page(struct page *page, unsigned int offset,
				      unsigned int length)
896 897 898 899 900 901 902 903 904 905 906 907 908
{
	struct inode *inode = page->mapping->host;
	struct f2fs_sb_info *sbi = F2FS_SB(inode->i_sb);
	if (S_ISDIR(inode->i_mode) && PageDirty(page)) {
		dec_page_count(sbi, F2FS_DIRTY_DENTS);
		inode_dec_dirty_dents(inode);
	}
	ClearPagePrivate(page);
}

static int f2fs_release_data_page(struct page *page, gfp_t wait)
{
	ClearPagePrivate(page);
909
	return 1;
910 911 912 913 914 915 916
}

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

917 918
	trace_f2fs_set_page_dirty(page, DATA);

919 920 921 922 923 924 925 926 927
	SetPageUptodate(page);
	if (!PageDirty(page)) {
		__set_page_dirty_nobuffers(page);
		set_dirty_dir_page(inode, page);
		return 1;
	}
	return 0;
}

J
Jaegeuk Kim 已提交
928 929 930 931 932
static sector_t f2fs_bmap(struct address_space *mapping, sector_t block)
{
	return generic_block_bmap(mapping, block, get_data_block_ro);
}

933 934 935 936 937 938
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,
939
	.write_end	= f2fs_write_end,
940 941 942 943
	.set_page_dirty	= f2fs_set_data_page_dirty,
	.invalidatepage	= f2fs_invalidate_data_page,
	.releasepage	= f2fs_release_data_page,
	.direct_IO	= f2fs_direct_IO,
J
Jaegeuk Kim 已提交
944
	.bmap		= f2fs_bmap,
945
};