data.c 17 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730
  1. /*
  2. * fs/f2fs/data.c
  3. *
  4. * Copyright (c) 2012 Samsung Electronics Co., Ltd.
  5. * http://www.samsung.com/
  6. *
  7. * This program is free software; you can redistribute it and/or modify
  8. * it under the terms of the GNU General Public License version 2 as
  9. * published by the Free Software Foundation.
  10. */
  11. #include <linux/fs.h>
  12. #include <linux/f2fs_fs.h>
  13. #include <linux/buffer_head.h>
  14. #include <linux/mpage.h>
  15. #include <linux/writeback.h>
  16. #include <linux/backing-dev.h>
  17. #include <linux/blkdev.h>
  18. #include <linux/bio.h>
  19. #include <linux/prefetch.h>
  20. #include "f2fs.h"
  21. #include "node.h"
  22. #include "segment.h"
  23. #include <trace/events/f2fs.h>
  24. /*
  25. * Lock ordering for the change of data block address:
  26. * ->data_page
  27. * ->node_page
  28. * update block addresses in the node page
  29. */
  30. static void __set_data_blkaddr(struct dnode_of_data *dn, block_t new_addr)
  31. {
  32. struct f2fs_node *rn;
  33. __le32 *addr_array;
  34. struct page *node_page = dn->node_page;
  35. unsigned int ofs_in_node = dn->ofs_in_node;
  36. wait_on_page_writeback(node_page);
  37. rn = (struct f2fs_node *)page_address(node_page);
  38. /* Get physical address of data block */
  39. addr_array = blkaddr_in_node(rn);
  40. addr_array[ofs_in_node] = cpu_to_le32(new_addr);
  41. set_page_dirty(node_page);
  42. }
  43. int reserve_new_block(struct dnode_of_data *dn)
  44. {
  45. struct f2fs_sb_info *sbi = F2FS_SB(dn->inode->i_sb);
  46. if (is_inode_flag_set(F2FS_I(dn->inode), FI_NO_ALLOC))
  47. return -EPERM;
  48. if (!inc_valid_block_count(sbi, dn->inode, 1))
  49. return -ENOSPC;
  50. trace_f2fs_reserve_new_block(dn->inode, dn->nid, dn->ofs_in_node);
  51. __set_data_blkaddr(dn, NEW_ADDR);
  52. dn->data_blkaddr = NEW_ADDR;
  53. sync_inode_page(dn);
  54. return 0;
  55. }
  56. static int check_extent_cache(struct inode *inode, pgoff_t pgofs,
  57. struct buffer_head *bh_result)
  58. {
  59. struct f2fs_inode_info *fi = F2FS_I(inode);
  60. struct f2fs_sb_info *sbi = F2FS_SB(inode->i_sb);
  61. pgoff_t start_fofs, end_fofs;
  62. block_t start_blkaddr;
  63. read_lock(&fi->ext.ext_lock);
  64. if (fi->ext.len == 0) {
  65. read_unlock(&fi->ext.ext_lock);
  66. return 0;
  67. }
  68. sbi->total_hit_ext++;
  69. start_fofs = fi->ext.fofs;
  70. end_fofs = fi->ext.fofs + fi->ext.len - 1;
  71. start_blkaddr = fi->ext.blk_addr;
  72. if (pgofs >= start_fofs && pgofs <= end_fofs) {
  73. unsigned int blkbits = inode->i_sb->s_blocksize_bits;
  74. size_t count;
  75. clear_buffer_new(bh_result);
  76. map_bh(bh_result, inode->i_sb,
  77. start_blkaddr + pgofs - start_fofs);
  78. count = end_fofs - pgofs + 1;
  79. if (count < (UINT_MAX >> blkbits))
  80. bh_result->b_size = (count << blkbits);
  81. else
  82. bh_result->b_size = UINT_MAX;
  83. sbi->read_hit_ext++;
  84. read_unlock(&fi->ext.ext_lock);
  85. return 1;
  86. }
  87. read_unlock(&fi->ext.ext_lock);
  88. return 0;
  89. }
  90. void update_extent_cache(block_t blk_addr, struct dnode_of_data *dn)
  91. {
  92. struct f2fs_inode_info *fi = F2FS_I(dn->inode);
  93. pgoff_t fofs, start_fofs, end_fofs;
  94. block_t start_blkaddr, end_blkaddr;
  95. BUG_ON(blk_addr == NEW_ADDR);
  96. fofs = start_bidx_of_node(ofs_of_node(dn->node_page)) + dn->ofs_in_node;
  97. /* Update the page address in the parent node */
  98. __set_data_blkaddr(dn, blk_addr);
  99. write_lock(&fi->ext.ext_lock);
  100. start_fofs = fi->ext.fofs;
  101. end_fofs = fi->ext.fofs + fi->ext.len - 1;
  102. start_blkaddr = fi->ext.blk_addr;
  103. end_blkaddr = fi->ext.blk_addr + fi->ext.len - 1;
  104. /* Drop and initialize the matched extent */
  105. if (fi->ext.len == 1 && fofs == start_fofs)
  106. fi->ext.len = 0;
  107. /* Initial extent */
  108. if (fi->ext.len == 0) {
  109. if (blk_addr != NULL_ADDR) {
  110. fi->ext.fofs = fofs;
  111. fi->ext.blk_addr = blk_addr;
  112. fi->ext.len = 1;
  113. }
  114. goto end_update;
  115. }
  116. /* Front merge */
  117. if (fofs == start_fofs - 1 && blk_addr == start_blkaddr - 1) {
  118. fi->ext.fofs--;
  119. fi->ext.blk_addr--;
  120. fi->ext.len++;
  121. goto end_update;
  122. }
  123. /* Back merge */
  124. if (fofs == end_fofs + 1 && blk_addr == end_blkaddr + 1) {
  125. fi->ext.len++;
  126. goto end_update;
  127. }
  128. /* Split the existing extent */
  129. if (fi->ext.len > 1 &&
  130. fofs >= start_fofs && fofs <= end_fofs) {
  131. if ((end_fofs - fofs) < (fi->ext.len >> 1)) {
  132. fi->ext.len = fofs - start_fofs;
  133. } else {
  134. fi->ext.fofs = fofs + 1;
  135. fi->ext.blk_addr = start_blkaddr +
  136. fofs - start_fofs + 1;
  137. fi->ext.len -= fofs - start_fofs + 1;
  138. }
  139. goto end_update;
  140. }
  141. write_unlock(&fi->ext.ext_lock);
  142. return;
  143. end_update:
  144. write_unlock(&fi->ext.ext_lock);
  145. sync_inode_page(dn);
  146. return;
  147. }
  148. struct page *find_data_page(struct inode *inode, pgoff_t index)
  149. {
  150. struct f2fs_sb_info *sbi = F2FS_SB(inode->i_sb);
  151. struct address_space *mapping = inode->i_mapping;
  152. struct dnode_of_data dn;
  153. struct page *page;
  154. int err;
  155. page = find_get_page(mapping, index);
  156. if (page && PageUptodate(page))
  157. return page;
  158. f2fs_put_page(page, 0);
  159. set_new_dnode(&dn, inode, NULL, NULL, 0);
  160. err = get_dnode_of_data(&dn, index, LOOKUP_NODE);
  161. if (err)
  162. return ERR_PTR(err);
  163. f2fs_put_dnode(&dn);
  164. if (dn.data_blkaddr == NULL_ADDR)
  165. return ERR_PTR(-ENOENT);
  166. /* By fallocate(), there is no cached page, but with NEW_ADDR */
  167. if (dn.data_blkaddr == NEW_ADDR)
  168. return ERR_PTR(-EINVAL);
  169. page = grab_cache_page(mapping, index);
  170. if (!page)
  171. return ERR_PTR(-ENOMEM);
  172. if (PageUptodate(page)) {
  173. unlock_page(page);
  174. return page;
  175. }
  176. err = f2fs_readpage(sbi, page, dn.data_blkaddr, READ_SYNC);
  177. wait_on_page_locked(page);
  178. if (!PageUptodate(page)) {
  179. f2fs_put_page(page, 0);
  180. return ERR_PTR(-EIO);
  181. }
  182. return page;
  183. }
  184. /*
  185. * If it tries to access a hole, return an error.
  186. * Because, the callers, functions in dir.c and GC, should be able to know
  187. * whether this page exists or not.
  188. */
  189. struct page *get_lock_data_page(struct inode *inode, pgoff_t index)
  190. {
  191. struct f2fs_sb_info *sbi = F2FS_SB(inode->i_sb);
  192. struct address_space *mapping = inode->i_mapping;
  193. struct dnode_of_data dn;
  194. struct page *page;
  195. int err;
  196. set_new_dnode(&dn, inode, NULL, NULL, 0);
  197. err = get_dnode_of_data(&dn, index, LOOKUP_NODE);
  198. if (err)
  199. return ERR_PTR(err);
  200. f2fs_put_dnode(&dn);
  201. if (dn.data_blkaddr == NULL_ADDR)
  202. return ERR_PTR(-ENOENT);
  203. page = grab_cache_page(mapping, index);
  204. if (!page)
  205. return ERR_PTR(-ENOMEM);
  206. if (PageUptodate(page))
  207. return page;
  208. BUG_ON(dn.data_blkaddr == NEW_ADDR);
  209. BUG_ON(dn.data_blkaddr == NULL_ADDR);
  210. err = f2fs_readpage(sbi, page, dn.data_blkaddr, READ_SYNC);
  211. if (err)
  212. return ERR_PTR(err);
  213. lock_page(page);
  214. if (!PageUptodate(page)) {
  215. f2fs_put_page(page, 1);
  216. return ERR_PTR(-EIO);
  217. }
  218. return page;
  219. }
  220. /*
  221. * Caller ensures that this data page is never allocated.
  222. * A new zero-filled data page is allocated in the page cache.
  223. *
  224. * Also, caller should grab and release a mutex by calling mutex_lock_op() and
  225. * mutex_unlock_op().
  226. */
  227. struct page *get_new_data_page(struct inode *inode, pgoff_t index,
  228. bool new_i_size)
  229. {
  230. struct f2fs_sb_info *sbi = F2FS_SB(inode->i_sb);
  231. struct address_space *mapping = inode->i_mapping;
  232. struct page *page;
  233. struct dnode_of_data dn;
  234. int err;
  235. set_new_dnode(&dn, inode, NULL, NULL, 0);
  236. err = get_dnode_of_data(&dn, index, ALLOC_NODE);
  237. if (err)
  238. return ERR_PTR(err);
  239. if (dn.data_blkaddr == NULL_ADDR) {
  240. if (reserve_new_block(&dn)) {
  241. f2fs_put_dnode(&dn);
  242. return ERR_PTR(-ENOSPC);
  243. }
  244. }
  245. f2fs_put_dnode(&dn);
  246. page = grab_cache_page(mapping, index);
  247. if (!page)
  248. return ERR_PTR(-ENOMEM);
  249. if (PageUptodate(page))
  250. return page;
  251. if (dn.data_blkaddr == NEW_ADDR) {
  252. zero_user_segment(page, 0, PAGE_CACHE_SIZE);
  253. SetPageUptodate(page);
  254. } else {
  255. err = f2fs_readpage(sbi, page, dn.data_blkaddr, READ_SYNC);
  256. if (err)
  257. return ERR_PTR(err);
  258. lock_page(page);
  259. if (!PageUptodate(page)) {
  260. f2fs_put_page(page, 1);
  261. return ERR_PTR(-EIO);
  262. }
  263. }
  264. if (new_i_size &&
  265. i_size_read(inode) < ((index + 1) << PAGE_CACHE_SHIFT)) {
  266. i_size_write(inode, ((index + 1) << PAGE_CACHE_SHIFT));
  267. mark_inode_dirty_sync(inode);
  268. }
  269. return page;
  270. }
  271. static void read_end_io(struct bio *bio, int err)
  272. {
  273. const int uptodate = test_bit(BIO_UPTODATE, &bio->bi_flags);
  274. struct bio_vec *bvec = bio->bi_io_vec + bio->bi_vcnt - 1;
  275. do {
  276. struct page *page = bvec->bv_page;
  277. if (--bvec >= bio->bi_io_vec)
  278. prefetchw(&bvec->bv_page->flags);
  279. if (uptodate) {
  280. SetPageUptodate(page);
  281. } else {
  282. ClearPageUptodate(page);
  283. SetPageError(page);
  284. }
  285. unlock_page(page);
  286. } while (bvec >= bio->bi_io_vec);
  287. kfree(bio->bi_private);
  288. bio_put(bio);
  289. }
  290. /*
  291. * Fill the locked page with data located in the block address.
  292. * Return unlocked page.
  293. */
  294. int f2fs_readpage(struct f2fs_sb_info *sbi, struct page *page,
  295. block_t blk_addr, int type)
  296. {
  297. struct block_device *bdev = sbi->sb->s_bdev;
  298. struct bio *bio;
  299. trace_f2fs_readpage(page, blk_addr, type);
  300. down_read(&sbi->bio_sem);
  301. /* Allocate a new bio */
  302. bio = f2fs_bio_alloc(bdev, 1);
  303. /* Initialize the bio */
  304. bio->bi_sector = SECTOR_FROM_BLOCK(sbi, blk_addr);
  305. bio->bi_end_io = read_end_io;
  306. if (bio_add_page(bio, page, PAGE_CACHE_SIZE, 0) < PAGE_CACHE_SIZE) {
  307. kfree(bio->bi_private);
  308. bio_put(bio);
  309. up_read(&sbi->bio_sem);
  310. f2fs_put_page(page, 1);
  311. return -EFAULT;
  312. }
  313. submit_bio(type, bio);
  314. up_read(&sbi->bio_sem);
  315. return 0;
  316. }
  317. /*
  318. * This function should be used by the data read flow only where it
  319. * does not check the "create" flag that indicates block allocation.
  320. * The reason for this special functionality is to exploit VFS readahead
  321. * mechanism.
  322. */
  323. static int get_data_block_ro(struct inode *inode, sector_t iblock,
  324. struct buffer_head *bh_result, int create)
  325. {
  326. unsigned int blkbits = inode->i_sb->s_blocksize_bits;
  327. unsigned maxblocks = bh_result->b_size >> blkbits;
  328. struct dnode_of_data dn;
  329. pgoff_t pgofs;
  330. int err;
  331. /* Get the page offset from the block offset(iblock) */
  332. pgofs = (pgoff_t)(iblock >> (PAGE_CACHE_SHIFT - blkbits));
  333. if (check_extent_cache(inode, pgofs, bh_result)) {
  334. trace_f2fs_get_data_block(inode, iblock, bh_result, 0);
  335. return 0;
  336. }
  337. /* When reading holes, we need its node page */
  338. set_new_dnode(&dn, inode, NULL, NULL, 0);
  339. err = get_dnode_of_data(&dn, pgofs, LOOKUP_NODE_RA);
  340. if (err) {
  341. trace_f2fs_get_data_block(inode, iblock, bh_result, err);
  342. return (err == -ENOENT) ? 0 : err;
  343. }
  344. /* It does not support data allocation */
  345. BUG_ON(create);
  346. if (dn.data_blkaddr != NEW_ADDR && dn.data_blkaddr != NULL_ADDR) {
  347. int i;
  348. unsigned int end_offset;
  349. end_offset = IS_INODE(dn.node_page) ?
  350. ADDRS_PER_INODE :
  351. ADDRS_PER_BLOCK;
  352. clear_buffer_new(bh_result);
  353. /* Give more consecutive addresses for the read ahead */
  354. for (i = 0; i < end_offset - dn.ofs_in_node; i++)
  355. if (((datablock_addr(dn.node_page,
  356. dn.ofs_in_node + i))
  357. != (dn.data_blkaddr + i)) || maxblocks == i)
  358. break;
  359. map_bh(bh_result, inode->i_sb, dn.data_blkaddr);
  360. bh_result->b_size = (i << blkbits);
  361. }
  362. f2fs_put_dnode(&dn);
  363. trace_f2fs_get_data_block(inode, iblock, bh_result, 0);
  364. return 0;
  365. }
  366. static int f2fs_read_data_page(struct file *file, struct page *page)
  367. {
  368. return mpage_readpage(page, get_data_block_ro);
  369. }
  370. static int f2fs_read_data_pages(struct file *file,
  371. struct address_space *mapping,
  372. struct list_head *pages, unsigned nr_pages)
  373. {
  374. return mpage_readpages(mapping, pages, nr_pages, get_data_block_ro);
  375. }
  376. int do_write_data_page(struct page *page)
  377. {
  378. struct inode *inode = page->mapping->host;
  379. block_t old_blk_addr, new_blk_addr;
  380. struct dnode_of_data dn;
  381. int err = 0;
  382. set_new_dnode(&dn, inode, NULL, NULL, 0);
  383. err = get_dnode_of_data(&dn, page->index, LOOKUP_NODE);
  384. if (err)
  385. return err;
  386. old_blk_addr = dn.data_blkaddr;
  387. /* This page is already truncated */
  388. if (old_blk_addr == NULL_ADDR)
  389. goto out_writepage;
  390. set_page_writeback(page);
  391. /*
  392. * If current allocation needs SSR,
  393. * it had better in-place writes for updated data.
  394. */
  395. if (old_blk_addr != NEW_ADDR && !is_cold_data(page) &&
  396. need_inplace_update(inode)) {
  397. rewrite_data_page(F2FS_SB(inode->i_sb), page,
  398. old_blk_addr);
  399. } else {
  400. write_data_page(inode, page, &dn,
  401. old_blk_addr, &new_blk_addr);
  402. update_extent_cache(new_blk_addr, &dn);
  403. }
  404. out_writepage:
  405. f2fs_put_dnode(&dn);
  406. return err;
  407. }
  408. static int f2fs_write_data_page(struct page *page,
  409. struct writeback_control *wbc)
  410. {
  411. struct inode *inode = page->mapping->host;
  412. struct f2fs_sb_info *sbi = F2FS_SB(inode->i_sb);
  413. loff_t i_size = i_size_read(inode);
  414. const pgoff_t end_index = ((unsigned long long) i_size)
  415. >> PAGE_CACHE_SHIFT;
  416. unsigned offset;
  417. bool need_balance_fs = false;
  418. int err = 0;
  419. if (page->index < end_index)
  420. goto write;
  421. /*
  422. * If the offset is out-of-range of file size,
  423. * this page does not have to be written to disk.
  424. */
  425. offset = i_size & (PAGE_CACHE_SIZE - 1);
  426. if ((page->index >= end_index + 1) || !offset) {
  427. if (S_ISDIR(inode->i_mode)) {
  428. dec_page_count(sbi, F2FS_DIRTY_DENTS);
  429. inode_dec_dirty_dents(inode);
  430. }
  431. goto out;
  432. }
  433. zero_user_segment(page, offset, PAGE_CACHE_SIZE);
  434. write:
  435. if (sbi->por_doing) {
  436. err = AOP_WRITEPAGE_ACTIVATE;
  437. goto redirty_out;
  438. }
  439. /* Dentry blocks are controlled by checkpoint */
  440. if (S_ISDIR(inode->i_mode)) {
  441. dec_page_count(sbi, F2FS_DIRTY_DENTS);
  442. inode_dec_dirty_dents(inode);
  443. err = do_write_data_page(page);
  444. } else {
  445. int ilock = mutex_lock_op(sbi);
  446. err = do_write_data_page(page);
  447. mutex_unlock_op(sbi, ilock);
  448. need_balance_fs = true;
  449. }
  450. if (err == -ENOENT)
  451. goto out;
  452. else if (err)
  453. goto redirty_out;
  454. if (wbc->for_reclaim)
  455. f2fs_submit_bio(sbi, DATA, true);
  456. clear_cold_data(page);
  457. out:
  458. unlock_page(page);
  459. if (need_balance_fs)
  460. f2fs_balance_fs(sbi);
  461. return 0;
  462. redirty_out:
  463. wbc->pages_skipped++;
  464. set_page_dirty(page);
  465. return err;
  466. }
  467. #define MAX_DESIRED_PAGES_WP 4096
  468. static int __f2fs_writepage(struct page *page, struct writeback_control *wbc,
  469. void *data)
  470. {
  471. struct address_space *mapping = data;
  472. int ret = mapping->a_ops->writepage(page, wbc);
  473. mapping_set_error(mapping, ret);
  474. return ret;
  475. }
  476. static int f2fs_write_data_pages(struct address_space *mapping,
  477. struct writeback_control *wbc)
  478. {
  479. struct inode *inode = mapping->host;
  480. struct f2fs_sb_info *sbi = F2FS_SB(inode->i_sb);
  481. int ret;
  482. long excess_nrtw = 0, desired_nrtw;
  483. /* deal with chardevs and other special file */
  484. if (!mapping->a_ops->writepage)
  485. return 0;
  486. if (wbc->nr_to_write < MAX_DESIRED_PAGES_WP) {
  487. desired_nrtw = MAX_DESIRED_PAGES_WP;
  488. excess_nrtw = desired_nrtw - wbc->nr_to_write;
  489. wbc->nr_to_write = desired_nrtw;
  490. }
  491. if (!S_ISDIR(inode->i_mode))
  492. mutex_lock(&sbi->writepages);
  493. ret = write_cache_pages(mapping, wbc, __f2fs_writepage, mapping);
  494. if (!S_ISDIR(inode->i_mode))
  495. mutex_unlock(&sbi->writepages);
  496. f2fs_submit_bio(sbi, DATA, (wbc->sync_mode == WB_SYNC_ALL));
  497. remove_dirty_dir_inode(inode);
  498. wbc->nr_to_write -= excess_nrtw;
  499. return ret;
  500. }
  501. static int f2fs_write_begin(struct file *file, struct address_space *mapping,
  502. loff_t pos, unsigned len, unsigned flags,
  503. struct page **pagep, void **fsdata)
  504. {
  505. struct inode *inode = mapping->host;
  506. struct f2fs_sb_info *sbi = F2FS_SB(inode->i_sb);
  507. struct page *page;
  508. pgoff_t index = ((unsigned long long) pos) >> PAGE_CACHE_SHIFT;
  509. struct dnode_of_data dn;
  510. int err = 0;
  511. int ilock;
  512. /* for nobh_write_end */
  513. *fsdata = NULL;
  514. f2fs_balance_fs(sbi);
  515. page = grab_cache_page_write_begin(mapping, index, flags);
  516. if (!page)
  517. return -ENOMEM;
  518. *pagep = page;
  519. ilock = mutex_lock_op(sbi);
  520. set_new_dnode(&dn, inode, NULL, NULL, 0);
  521. err = get_dnode_of_data(&dn, index, ALLOC_NODE);
  522. if (err)
  523. goto err;
  524. if (dn.data_blkaddr == NULL_ADDR)
  525. err = reserve_new_block(&dn);
  526. f2fs_put_dnode(&dn);
  527. if (err)
  528. goto err;
  529. mutex_unlock_op(sbi, ilock);
  530. if ((len == PAGE_CACHE_SIZE) || PageUptodate(page))
  531. return 0;
  532. if ((pos & PAGE_CACHE_MASK) >= i_size_read(inode)) {
  533. unsigned start = pos & (PAGE_CACHE_SIZE - 1);
  534. unsigned end = start + len;
  535. /* Reading beyond i_size is simple: memset to zero */
  536. zero_user_segments(page, 0, start, end, PAGE_CACHE_SIZE);
  537. goto out;
  538. }
  539. if (dn.data_blkaddr == NEW_ADDR) {
  540. zero_user_segment(page, 0, PAGE_CACHE_SIZE);
  541. } else {
  542. err = f2fs_readpage(sbi, page, dn.data_blkaddr, READ_SYNC);
  543. if (err)
  544. return err;
  545. lock_page(page);
  546. if (!PageUptodate(page)) {
  547. f2fs_put_page(page, 1);
  548. return -EIO;
  549. }
  550. }
  551. out:
  552. SetPageUptodate(page);
  553. clear_cold_data(page);
  554. return 0;
  555. err:
  556. mutex_unlock_op(sbi, ilock);
  557. f2fs_put_page(page, 1);
  558. return err;
  559. }
  560. static ssize_t f2fs_direct_IO(int rw, struct kiocb *iocb,
  561. const struct iovec *iov, loff_t offset, unsigned long nr_segs)
  562. {
  563. struct file *file = iocb->ki_filp;
  564. struct inode *inode = file->f_mapping->host;
  565. if (rw == WRITE)
  566. return 0;
  567. /* Needs synchronization with the cleaner */
  568. return blockdev_direct_IO(rw, iocb, inode, iov, offset, nr_segs,
  569. get_data_block_ro);
  570. }
  571. static void f2fs_invalidate_data_page(struct page *page, unsigned long offset)
  572. {
  573. struct inode *inode = page->mapping->host;
  574. struct f2fs_sb_info *sbi = F2FS_SB(inode->i_sb);
  575. if (S_ISDIR(inode->i_mode) && PageDirty(page)) {
  576. dec_page_count(sbi, F2FS_DIRTY_DENTS);
  577. inode_dec_dirty_dents(inode);
  578. }
  579. ClearPagePrivate(page);
  580. }
  581. static int f2fs_release_data_page(struct page *page, gfp_t wait)
  582. {
  583. ClearPagePrivate(page);
  584. return 1;
  585. }
  586. static int f2fs_set_data_page_dirty(struct page *page)
  587. {
  588. struct address_space *mapping = page->mapping;
  589. struct inode *inode = mapping->host;
  590. SetPageUptodate(page);
  591. if (!PageDirty(page)) {
  592. __set_page_dirty_nobuffers(page);
  593. set_dirty_dir_page(inode, page);
  594. return 1;
  595. }
  596. return 0;
  597. }
  598. static sector_t f2fs_bmap(struct address_space *mapping, sector_t block)
  599. {
  600. return generic_block_bmap(mapping, block, get_data_block_ro);
  601. }
  602. const struct address_space_operations f2fs_dblock_aops = {
  603. .readpage = f2fs_read_data_page,
  604. .readpages = f2fs_read_data_pages,
  605. .writepage = f2fs_write_data_page,
  606. .writepages = f2fs_write_data_pages,
  607. .write_begin = f2fs_write_begin,
  608. .write_end = nobh_write_end,
  609. .set_page_dirty = f2fs_set_data_page_dirty,
  610. .invalidatepage = f2fs_invalidate_data_page,
  611. .releasepage = f2fs_release_data_page,
  612. .direct_IO = f2fs_direct_IO,
  613. .bmap = f2fs_bmap,
  614. };