checkpoint.c 48 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908190919101911191219131914191519161917191819191920192119221923192419251926192719281929193019311932193319341935193619371938193919401941194219431944194519461947194819491950195119521953195419551956
  1. // SPDX-License-Identifier: GPL-2.0
  2. /*
  3. * fs/f2fs/checkpoint.c
  4. *
  5. * Copyright (c) 2012 Samsung Electronics Co., Ltd.
  6. * http://www.samsung.com/
  7. */
  8. #include <linux/fs.h>
  9. #include <linux/bio.h>
  10. #include <linux/mpage.h>
  11. #include <linux/writeback.h>
  12. #include <linux/blkdev.h>
  13. #include <linux/f2fs_fs.h>
  14. #include <linux/pagevec.h>
  15. #include <linux/swap.h>
  16. #include <linux/kthread.h>
  17. #include "f2fs.h"
  18. #include "node.h"
  19. #include "segment.h"
  20. #include "iostat.h"
  21. #include <trace/events/f2fs.h>
  22. #define DEFAULT_CHECKPOINT_IOPRIO (IOPRIO_PRIO_VALUE(IOPRIO_CLASS_BE, 3))
  23. static struct kmem_cache *ino_entry_slab;
  24. struct kmem_cache *f2fs_inode_entry_slab;
  25. void f2fs_stop_checkpoint(struct f2fs_sb_info *sbi, bool end_io,
  26. unsigned char reason)
  27. {
  28. f2fs_build_fault_attr(sbi, 0, 0);
  29. if (!end_io)
  30. f2fs_flush_merged_writes(sbi);
  31. f2fs_handle_critical_error(sbi, reason);
  32. }
  33. /*
  34. * We guarantee no failure on the returned page.
  35. */
  36. struct page *f2fs_grab_meta_page(struct f2fs_sb_info *sbi, pgoff_t index)
  37. {
  38. struct address_space *mapping = META_MAPPING(sbi);
  39. struct page *page;
  40. repeat:
  41. page = f2fs_grab_cache_page(mapping, index, false);
  42. if (!page) {
  43. cond_resched();
  44. goto repeat;
  45. }
  46. f2fs_wait_on_page_writeback(page, META, true, true);
  47. if (!PageUptodate(page))
  48. SetPageUptodate(page);
  49. return page;
  50. }
  51. static struct page *__get_meta_page(struct f2fs_sb_info *sbi, pgoff_t index,
  52. bool is_meta)
  53. {
  54. struct address_space *mapping = META_MAPPING(sbi);
  55. struct page *page;
  56. struct f2fs_io_info fio = {
  57. .sbi = sbi,
  58. .type = META,
  59. .op = REQ_OP_READ,
  60. .op_flags = REQ_META | REQ_PRIO,
  61. .old_blkaddr = index,
  62. .new_blkaddr = index,
  63. .encrypted_page = NULL,
  64. .is_por = !is_meta ? 1 : 0,
  65. };
  66. int err;
  67. if (unlikely(!is_meta))
  68. fio.op_flags &= ~REQ_META;
  69. repeat:
  70. page = f2fs_grab_cache_page(mapping, index, false);
  71. if (!page) {
  72. cond_resched();
  73. goto repeat;
  74. }
  75. if (PageUptodate(page))
  76. goto out;
  77. fio.page = page;
  78. err = f2fs_submit_page_bio(&fio);
  79. if (err) {
  80. f2fs_put_page(page, 1);
  81. return ERR_PTR(err);
  82. }
  83. f2fs_update_iostat(sbi, NULL, FS_META_READ_IO, F2FS_BLKSIZE);
  84. lock_page(page);
  85. if (unlikely(page->mapping != mapping)) {
  86. f2fs_put_page(page, 1);
  87. goto repeat;
  88. }
  89. if (unlikely(!PageUptodate(page))) {
  90. f2fs_handle_page_eio(sbi, page_folio(page), META);
  91. f2fs_put_page(page, 1);
  92. return ERR_PTR(-EIO);
  93. }
  94. out:
  95. return page;
  96. }
  97. struct page *f2fs_get_meta_page(struct f2fs_sb_info *sbi, pgoff_t index)
  98. {
  99. return __get_meta_page(sbi, index, true);
  100. }
  101. struct page *f2fs_get_meta_page_retry(struct f2fs_sb_info *sbi, pgoff_t index)
  102. {
  103. struct page *page;
  104. int count = 0;
  105. retry:
  106. page = __get_meta_page(sbi, index, true);
  107. if (IS_ERR(page)) {
  108. if (PTR_ERR(page) == -EIO &&
  109. ++count <= DEFAULT_RETRY_IO_COUNT)
  110. goto retry;
  111. f2fs_stop_checkpoint(sbi, false, STOP_CP_REASON_META_PAGE);
  112. }
  113. return page;
  114. }
  115. /* for POR only */
  116. struct page *f2fs_get_tmp_page(struct f2fs_sb_info *sbi, pgoff_t index)
  117. {
  118. return __get_meta_page(sbi, index, false);
  119. }
  120. static bool __is_bitmap_valid(struct f2fs_sb_info *sbi, block_t blkaddr,
  121. int type)
  122. {
  123. struct seg_entry *se;
  124. unsigned int segno, offset;
  125. bool exist;
  126. if (type == DATA_GENERIC)
  127. return true;
  128. segno = GET_SEGNO(sbi, blkaddr);
  129. offset = GET_BLKOFF_FROM_SEG0(sbi, blkaddr);
  130. se = get_seg_entry(sbi, segno);
  131. exist = f2fs_test_bit(offset, se->cur_valid_map);
  132. /* skip data, if we already have an error in checkpoint. */
  133. if (unlikely(f2fs_cp_error(sbi)))
  134. return exist;
  135. if ((exist && type == DATA_GENERIC_ENHANCE_UPDATE) ||
  136. (!exist && type == DATA_GENERIC_ENHANCE))
  137. goto out_err;
  138. if (!exist && type != DATA_GENERIC_ENHANCE_UPDATE)
  139. goto out_handle;
  140. return exist;
  141. out_err:
  142. f2fs_err(sbi, "Inconsistent error blkaddr:%u, sit bitmap:%d",
  143. blkaddr, exist);
  144. set_sbi_flag(sbi, SBI_NEED_FSCK);
  145. dump_stack();
  146. out_handle:
  147. f2fs_handle_error(sbi, ERROR_INVALID_BLKADDR);
  148. return exist;
  149. }
  150. static bool __f2fs_is_valid_blkaddr(struct f2fs_sb_info *sbi,
  151. block_t blkaddr, int type)
  152. {
  153. switch (type) {
  154. case META_NAT:
  155. break;
  156. case META_SIT:
  157. if (unlikely(blkaddr >= SIT_BLK_CNT(sbi)))
  158. goto check_only;
  159. break;
  160. case META_SSA:
  161. if (unlikely(blkaddr >= MAIN_BLKADDR(sbi) ||
  162. blkaddr < SM_I(sbi)->ssa_blkaddr))
  163. goto check_only;
  164. break;
  165. case META_CP:
  166. if (unlikely(blkaddr >= SIT_I(sbi)->sit_base_addr ||
  167. blkaddr < __start_cp_addr(sbi)))
  168. goto check_only;
  169. break;
  170. case META_POR:
  171. if (unlikely(blkaddr >= MAX_BLKADDR(sbi) ||
  172. blkaddr < MAIN_BLKADDR(sbi)))
  173. goto check_only;
  174. break;
  175. case DATA_GENERIC:
  176. case DATA_GENERIC_ENHANCE:
  177. case DATA_GENERIC_ENHANCE_READ:
  178. case DATA_GENERIC_ENHANCE_UPDATE:
  179. if (unlikely(blkaddr >= MAX_BLKADDR(sbi) ||
  180. blkaddr < MAIN_BLKADDR(sbi))) {
  181. /* Skip to emit an error message. */
  182. if (unlikely(f2fs_cp_error(sbi)))
  183. return false;
  184. f2fs_warn(sbi, "access invalid blkaddr:%u",
  185. blkaddr);
  186. set_sbi_flag(sbi, SBI_NEED_FSCK);
  187. dump_stack();
  188. goto err;
  189. } else {
  190. return __is_bitmap_valid(sbi, blkaddr, type);
  191. }
  192. break;
  193. case META_GENERIC:
  194. if (unlikely(blkaddr < SEG0_BLKADDR(sbi) ||
  195. blkaddr >= MAIN_BLKADDR(sbi)))
  196. goto err;
  197. break;
  198. default:
  199. BUG();
  200. }
  201. return true;
  202. err:
  203. f2fs_handle_error(sbi, ERROR_INVALID_BLKADDR);
  204. check_only:
  205. return false;
  206. }
  207. bool f2fs_is_valid_blkaddr(struct f2fs_sb_info *sbi,
  208. block_t blkaddr, int type)
  209. {
  210. if (time_to_inject(sbi, FAULT_BLKADDR_VALIDITY))
  211. return false;
  212. return __f2fs_is_valid_blkaddr(sbi, blkaddr, type);
  213. }
  214. bool f2fs_is_valid_blkaddr_raw(struct f2fs_sb_info *sbi,
  215. block_t blkaddr, int type)
  216. {
  217. return __f2fs_is_valid_blkaddr(sbi, blkaddr, type);
  218. }
  219. /*
  220. * Readahead CP/NAT/SIT/SSA/POR pages
  221. */
  222. int f2fs_ra_meta_pages(struct f2fs_sb_info *sbi, block_t start, int nrpages,
  223. int type, bool sync)
  224. {
  225. struct page *page;
  226. block_t blkno = start;
  227. struct f2fs_io_info fio = {
  228. .sbi = sbi,
  229. .type = META,
  230. .op = REQ_OP_READ,
  231. .op_flags = sync ? (REQ_META | REQ_PRIO) : REQ_RAHEAD,
  232. .encrypted_page = NULL,
  233. .in_list = 0,
  234. .is_por = (type == META_POR) ? 1 : 0,
  235. };
  236. struct blk_plug plug;
  237. int err;
  238. if (unlikely(type == META_POR))
  239. fio.op_flags &= ~REQ_META;
  240. blk_start_plug(&plug);
  241. for (; nrpages-- > 0; blkno++) {
  242. if (!f2fs_is_valid_blkaddr(sbi, blkno, type))
  243. goto out;
  244. switch (type) {
  245. case META_NAT:
  246. if (unlikely(blkno >=
  247. NAT_BLOCK_OFFSET(NM_I(sbi)->max_nid)))
  248. blkno = 0;
  249. /* get nat block addr */
  250. fio.new_blkaddr = current_nat_addr(sbi,
  251. blkno * NAT_ENTRY_PER_BLOCK);
  252. break;
  253. case META_SIT:
  254. if (unlikely(blkno >= TOTAL_SEGS(sbi)))
  255. goto out;
  256. /* get sit block addr */
  257. fio.new_blkaddr = current_sit_addr(sbi,
  258. blkno * SIT_ENTRY_PER_BLOCK);
  259. break;
  260. case META_SSA:
  261. case META_CP:
  262. case META_POR:
  263. fio.new_blkaddr = blkno;
  264. break;
  265. default:
  266. BUG();
  267. }
  268. page = f2fs_grab_cache_page(META_MAPPING(sbi),
  269. fio.new_blkaddr, false);
  270. if (!page)
  271. continue;
  272. if (PageUptodate(page)) {
  273. f2fs_put_page(page, 1);
  274. continue;
  275. }
  276. fio.page = page;
  277. err = f2fs_submit_page_bio(&fio);
  278. f2fs_put_page(page, err ? 1 : 0);
  279. if (!err)
  280. f2fs_update_iostat(sbi, NULL, FS_META_READ_IO,
  281. F2FS_BLKSIZE);
  282. }
  283. out:
  284. blk_finish_plug(&plug);
  285. return blkno - start;
  286. }
  287. void f2fs_ra_meta_pages_cond(struct f2fs_sb_info *sbi, pgoff_t index,
  288. unsigned int ra_blocks)
  289. {
  290. struct page *page;
  291. bool readahead = false;
  292. if (ra_blocks == RECOVERY_MIN_RA_BLOCKS)
  293. return;
  294. page = find_get_page(META_MAPPING(sbi), index);
  295. if (!page || !PageUptodate(page))
  296. readahead = true;
  297. f2fs_put_page(page, 0);
  298. if (readahead)
  299. f2fs_ra_meta_pages(sbi, index, ra_blocks, META_POR, true);
  300. }
  301. static int __f2fs_write_meta_page(struct page *page,
  302. struct writeback_control *wbc,
  303. enum iostat_type io_type)
  304. {
  305. struct f2fs_sb_info *sbi = F2FS_P_SB(page);
  306. struct folio *folio = page_folio(page);
  307. trace_f2fs_writepage(folio, META);
  308. if (unlikely(f2fs_cp_error(sbi))) {
  309. if (is_sbi_flag_set(sbi, SBI_IS_CLOSE)) {
  310. folio_clear_uptodate(folio);
  311. dec_page_count(sbi, F2FS_DIRTY_META);
  312. folio_unlock(folio);
  313. return 0;
  314. }
  315. goto redirty_out;
  316. }
  317. if (unlikely(is_sbi_flag_set(sbi, SBI_POR_DOING)))
  318. goto redirty_out;
  319. if (wbc->for_reclaim && folio->index < GET_SUM_BLOCK(sbi, 0))
  320. goto redirty_out;
  321. f2fs_do_write_meta_page(sbi, folio, io_type);
  322. dec_page_count(sbi, F2FS_DIRTY_META);
  323. if (wbc->for_reclaim)
  324. f2fs_submit_merged_write_cond(sbi, NULL, page, 0, META);
  325. folio_unlock(folio);
  326. if (unlikely(f2fs_cp_error(sbi)))
  327. f2fs_submit_merged_write(sbi, META);
  328. return 0;
  329. redirty_out:
  330. redirty_page_for_writepage(wbc, page);
  331. return AOP_WRITEPAGE_ACTIVATE;
  332. }
  333. static int f2fs_write_meta_page(struct page *page,
  334. struct writeback_control *wbc)
  335. {
  336. return __f2fs_write_meta_page(page, wbc, FS_META_IO);
  337. }
  338. static int f2fs_write_meta_pages(struct address_space *mapping,
  339. struct writeback_control *wbc)
  340. {
  341. struct f2fs_sb_info *sbi = F2FS_M_SB(mapping);
  342. long diff, written;
  343. if (unlikely(is_sbi_flag_set(sbi, SBI_POR_DOING)))
  344. goto skip_write;
  345. /* collect a number of dirty meta pages and write together */
  346. if (wbc->sync_mode != WB_SYNC_ALL &&
  347. get_pages(sbi, F2FS_DIRTY_META) <
  348. nr_pages_to_skip(sbi, META))
  349. goto skip_write;
  350. /* if locked failed, cp will flush dirty pages instead */
  351. if (!f2fs_down_write_trylock(&sbi->cp_global_sem))
  352. goto skip_write;
  353. trace_f2fs_writepages(mapping->host, wbc, META);
  354. diff = nr_pages_to_write(sbi, META, wbc);
  355. written = f2fs_sync_meta_pages(sbi, META, wbc->nr_to_write, FS_META_IO);
  356. f2fs_up_write(&sbi->cp_global_sem);
  357. wbc->nr_to_write = max((long)0, wbc->nr_to_write - written - diff);
  358. return 0;
  359. skip_write:
  360. wbc->pages_skipped += get_pages(sbi, F2FS_DIRTY_META);
  361. trace_f2fs_writepages(mapping->host, wbc, META);
  362. return 0;
  363. }
  364. long f2fs_sync_meta_pages(struct f2fs_sb_info *sbi, enum page_type type,
  365. long nr_to_write, enum iostat_type io_type)
  366. {
  367. struct address_space *mapping = META_MAPPING(sbi);
  368. pgoff_t index = 0, prev = ULONG_MAX;
  369. struct folio_batch fbatch;
  370. long nwritten = 0;
  371. int nr_folios;
  372. struct writeback_control wbc = {
  373. .for_reclaim = 0,
  374. };
  375. struct blk_plug plug;
  376. folio_batch_init(&fbatch);
  377. blk_start_plug(&plug);
  378. while ((nr_folios = filemap_get_folios_tag(mapping, &index,
  379. (pgoff_t)-1,
  380. PAGECACHE_TAG_DIRTY, &fbatch))) {
  381. int i;
  382. for (i = 0; i < nr_folios; i++) {
  383. struct folio *folio = fbatch.folios[i];
  384. if (nr_to_write != LONG_MAX && i != 0 &&
  385. folio->index != prev +
  386. folio_nr_pages(fbatch.folios[i-1])) {
  387. folio_batch_release(&fbatch);
  388. goto stop;
  389. }
  390. folio_lock(folio);
  391. if (unlikely(folio->mapping != mapping)) {
  392. continue_unlock:
  393. folio_unlock(folio);
  394. continue;
  395. }
  396. if (!folio_test_dirty(folio)) {
  397. /* someone wrote it for us */
  398. goto continue_unlock;
  399. }
  400. f2fs_wait_on_page_writeback(&folio->page, META,
  401. true, true);
  402. if (!folio_clear_dirty_for_io(folio))
  403. goto continue_unlock;
  404. if (__f2fs_write_meta_page(&folio->page, &wbc,
  405. io_type)) {
  406. folio_unlock(folio);
  407. break;
  408. }
  409. nwritten += folio_nr_pages(folio);
  410. prev = folio->index;
  411. if (unlikely(nwritten >= nr_to_write))
  412. break;
  413. }
  414. folio_batch_release(&fbatch);
  415. cond_resched();
  416. }
  417. stop:
  418. if (nwritten)
  419. f2fs_submit_merged_write(sbi, type);
  420. blk_finish_plug(&plug);
  421. return nwritten;
  422. }
  423. static bool f2fs_dirty_meta_folio(struct address_space *mapping,
  424. struct folio *folio)
  425. {
  426. trace_f2fs_set_page_dirty(folio, META);
  427. if (!folio_test_uptodate(folio))
  428. folio_mark_uptodate(folio);
  429. if (filemap_dirty_folio(mapping, folio)) {
  430. inc_page_count(F2FS_M_SB(mapping), F2FS_DIRTY_META);
  431. set_page_private_reference(&folio->page);
  432. return true;
  433. }
  434. return false;
  435. }
  436. const struct address_space_operations f2fs_meta_aops = {
  437. .writepage = f2fs_write_meta_page,
  438. .writepages = f2fs_write_meta_pages,
  439. .dirty_folio = f2fs_dirty_meta_folio,
  440. .invalidate_folio = f2fs_invalidate_folio,
  441. .release_folio = f2fs_release_folio,
  442. .migrate_folio = filemap_migrate_folio,
  443. };
  444. static void __add_ino_entry(struct f2fs_sb_info *sbi, nid_t ino,
  445. unsigned int devidx, int type)
  446. {
  447. struct inode_management *im = &sbi->im[type];
  448. struct ino_entry *e = NULL, *new = NULL;
  449. if (type == FLUSH_INO) {
  450. rcu_read_lock();
  451. e = radix_tree_lookup(&im->ino_root, ino);
  452. rcu_read_unlock();
  453. }
  454. retry:
  455. if (!e)
  456. new = f2fs_kmem_cache_alloc(ino_entry_slab,
  457. GFP_NOFS, true, NULL);
  458. radix_tree_preload(GFP_NOFS | __GFP_NOFAIL);
  459. spin_lock(&im->ino_lock);
  460. e = radix_tree_lookup(&im->ino_root, ino);
  461. if (!e) {
  462. if (!new) {
  463. spin_unlock(&im->ino_lock);
  464. radix_tree_preload_end();
  465. goto retry;
  466. }
  467. e = new;
  468. if (unlikely(radix_tree_insert(&im->ino_root, ino, e)))
  469. f2fs_bug_on(sbi, 1);
  470. memset(e, 0, sizeof(struct ino_entry));
  471. e->ino = ino;
  472. list_add_tail(&e->list, &im->ino_list);
  473. if (type != ORPHAN_INO)
  474. im->ino_num++;
  475. }
  476. if (type == FLUSH_INO)
  477. f2fs_set_bit(devidx, (char *)&e->dirty_device);
  478. spin_unlock(&im->ino_lock);
  479. radix_tree_preload_end();
  480. if (new && e != new)
  481. kmem_cache_free(ino_entry_slab, new);
  482. }
  483. static void __remove_ino_entry(struct f2fs_sb_info *sbi, nid_t ino, int type)
  484. {
  485. struct inode_management *im = &sbi->im[type];
  486. struct ino_entry *e;
  487. spin_lock(&im->ino_lock);
  488. e = radix_tree_lookup(&im->ino_root, ino);
  489. if (e) {
  490. list_del(&e->list);
  491. radix_tree_delete(&im->ino_root, ino);
  492. im->ino_num--;
  493. spin_unlock(&im->ino_lock);
  494. kmem_cache_free(ino_entry_slab, e);
  495. return;
  496. }
  497. spin_unlock(&im->ino_lock);
  498. }
  499. void f2fs_add_ino_entry(struct f2fs_sb_info *sbi, nid_t ino, int type)
  500. {
  501. /* add new dirty ino entry into list */
  502. __add_ino_entry(sbi, ino, 0, type);
  503. }
  504. void f2fs_remove_ino_entry(struct f2fs_sb_info *sbi, nid_t ino, int type)
  505. {
  506. /* remove dirty ino entry from list */
  507. __remove_ino_entry(sbi, ino, type);
  508. }
  509. /* mode should be APPEND_INO, UPDATE_INO or TRANS_DIR_INO */
  510. bool f2fs_exist_written_data(struct f2fs_sb_info *sbi, nid_t ino, int mode)
  511. {
  512. struct inode_management *im = &sbi->im[mode];
  513. struct ino_entry *e;
  514. spin_lock(&im->ino_lock);
  515. e = radix_tree_lookup(&im->ino_root, ino);
  516. spin_unlock(&im->ino_lock);
  517. return e ? true : false;
  518. }
  519. void f2fs_release_ino_entry(struct f2fs_sb_info *sbi, bool all)
  520. {
  521. struct ino_entry *e, *tmp;
  522. int i;
  523. for (i = all ? ORPHAN_INO : APPEND_INO; i < MAX_INO_ENTRY; i++) {
  524. struct inode_management *im = &sbi->im[i];
  525. spin_lock(&im->ino_lock);
  526. list_for_each_entry_safe(e, tmp, &im->ino_list, list) {
  527. list_del(&e->list);
  528. radix_tree_delete(&im->ino_root, e->ino);
  529. kmem_cache_free(ino_entry_slab, e);
  530. im->ino_num--;
  531. }
  532. spin_unlock(&im->ino_lock);
  533. }
  534. }
  535. void f2fs_set_dirty_device(struct f2fs_sb_info *sbi, nid_t ino,
  536. unsigned int devidx, int type)
  537. {
  538. __add_ino_entry(sbi, ino, devidx, type);
  539. }
  540. bool f2fs_is_dirty_device(struct f2fs_sb_info *sbi, nid_t ino,
  541. unsigned int devidx, int type)
  542. {
  543. struct inode_management *im = &sbi->im[type];
  544. struct ino_entry *e;
  545. bool is_dirty = false;
  546. spin_lock(&im->ino_lock);
  547. e = radix_tree_lookup(&im->ino_root, ino);
  548. if (e && f2fs_test_bit(devidx, (char *)&e->dirty_device))
  549. is_dirty = true;
  550. spin_unlock(&im->ino_lock);
  551. return is_dirty;
  552. }
  553. int f2fs_acquire_orphan_inode(struct f2fs_sb_info *sbi)
  554. {
  555. struct inode_management *im = &sbi->im[ORPHAN_INO];
  556. int err = 0;
  557. spin_lock(&im->ino_lock);
  558. if (time_to_inject(sbi, FAULT_ORPHAN)) {
  559. spin_unlock(&im->ino_lock);
  560. return -ENOSPC;
  561. }
  562. if (unlikely(im->ino_num >= sbi->max_orphans))
  563. err = -ENOSPC;
  564. else
  565. im->ino_num++;
  566. spin_unlock(&im->ino_lock);
  567. return err;
  568. }
  569. void f2fs_release_orphan_inode(struct f2fs_sb_info *sbi)
  570. {
  571. struct inode_management *im = &sbi->im[ORPHAN_INO];
  572. spin_lock(&im->ino_lock);
  573. f2fs_bug_on(sbi, im->ino_num == 0);
  574. im->ino_num--;
  575. spin_unlock(&im->ino_lock);
  576. }
  577. void f2fs_add_orphan_inode(struct inode *inode)
  578. {
  579. /* add new orphan ino entry into list */
  580. __add_ino_entry(F2FS_I_SB(inode), inode->i_ino, 0, ORPHAN_INO);
  581. f2fs_update_inode_page(inode);
  582. }
  583. void f2fs_remove_orphan_inode(struct f2fs_sb_info *sbi, nid_t ino)
  584. {
  585. /* remove orphan entry from orphan list */
  586. __remove_ino_entry(sbi, ino, ORPHAN_INO);
  587. }
  588. static int recover_orphan_inode(struct f2fs_sb_info *sbi, nid_t ino)
  589. {
  590. struct inode *inode;
  591. struct node_info ni;
  592. int err;
  593. inode = f2fs_iget_retry(sbi->sb, ino);
  594. if (IS_ERR(inode)) {
  595. /*
  596. * there should be a bug that we can't find the entry
  597. * to orphan inode.
  598. */
  599. f2fs_bug_on(sbi, PTR_ERR(inode) == -ENOENT);
  600. return PTR_ERR(inode);
  601. }
  602. err = f2fs_dquot_initialize(inode);
  603. if (err) {
  604. iput(inode);
  605. goto err_out;
  606. }
  607. clear_nlink(inode);
  608. /* truncate all the data during iput */
  609. iput(inode);
  610. err = f2fs_get_node_info(sbi, ino, &ni, false);
  611. if (err)
  612. goto err_out;
  613. /* ENOMEM was fully retried in f2fs_evict_inode. */
  614. if (ni.blk_addr != NULL_ADDR) {
  615. err = -EIO;
  616. goto err_out;
  617. }
  618. return 0;
  619. err_out:
  620. set_sbi_flag(sbi, SBI_NEED_FSCK);
  621. f2fs_warn(sbi, "%s: orphan failed (ino=%x), run fsck to fix.",
  622. __func__, ino);
  623. return err;
  624. }
  625. int f2fs_recover_orphan_inodes(struct f2fs_sb_info *sbi)
  626. {
  627. block_t start_blk, orphan_blocks, i, j;
  628. int err = 0;
  629. if (!is_set_ckpt_flags(sbi, CP_ORPHAN_PRESENT_FLAG))
  630. return 0;
  631. if (f2fs_hw_is_readonly(sbi)) {
  632. f2fs_info(sbi, "write access unavailable, skipping orphan cleanup");
  633. return 0;
  634. }
  635. if (is_sbi_flag_set(sbi, SBI_IS_WRITABLE))
  636. f2fs_info(sbi, "orphan cleanup on readonly fs");
  637. start_blk = __start_cp_addr(sbi) + 1 + __cp_payload(sbi);
  638. orphan_blocks = __start_sum_addr(sbi) - 1 - __cp_payload(sbi);
  639. f2fs_ra_meta_pages(sbi, start_blk, orphan_blocks, META_CP, true);
  640. for (i = 0; i < orphan_blocks; i++) {
  641. struct page *page;
  642. struct f2fs_orphan_block *orphan_blk;
  643. page = f2fs_get_meta_page(sbi, start_blk + i);
  644. if (IS_ERR(page)) {
  645. err = PTR_ERR(page);
  646. goto out;
  647. }
  648. orphan_blk = (struct f2fs_orphan_block *)page_address(page);
  649. for (j = 0; j < le32_to_cpu(orphan_blk->entry_count); j++) {
  650. nid_t ino = le32_to_cpu(orphan_blk->ino[j]);
  651. err = recover_orphan_inode(sbi, ino);
  652. if (err) {
  653. f2fs_put_page(page, 1);
  654. goto out;
  655. }
  656. }
  657. f2fs_put_page(page, 1);
  658. }
  659. /* clear Orphan Flag */
  660. clear_ckpt_flags(sbi, CP_ORPHAN_PRESENT_FLAG);
  661. out:
  662. set_sbi_flag(sbi, SBI_IS_RECOVERED);
  663. return err;
  664. }
  665. static void write_orphan_inodes(struct f2fs_sb_info *sbi, block_t start_blk)
  666. {
  667. struct list_head *head;
  668. struct f2fs_orphan_block *orphan_blk = NULL;
  669. unsigned int nentries = 0;
  670. unsigned short index = 1;
  671. unsigned short orphan_blocks;
  672. struct page *page = NULL;
  673. struct ino_entry *orphan = NULL;
  674. struct inode_management *im = &sbi->im[ORPHAN_INO];
  675. orphan_blocks = GET_ORPHAN_BLOCKS(im->ino_num);
  676. /*
  677. * we don't need to do spin_lock(&im->ino_lock) here, since all the
  678. * orphan inode operations are covered under f2fs_lock_op().
  679. * And, spin_lock should be avoided due to page operations below.
  680. */
  681. head = &im->ino_list;
  682. /* loop for each orphan inode entry and write them in journal block */
  683. list_for_each_entry(orphan, head, list) {
  684. if (!page) {
  685. page = f2fs_grab_meta_page(sbi, start_blk++);
  686. orphan_blk =
  687. (struct f2fs_orphan_block *)page_address(page);
  688. memset(orphan_blk, 0, sizeof(*orphan_blk));
  689. }
  690. orphan_blk->ino[nentries++] = cpu_to_le32(orphan->ino);
  691. if (nentries == F2FS_ORPHANS_PER_BLOCK) {
  692. /*
  693. * an orphan block is full of 1020 entries,
  694. * then we need to flush current orphan blocks
  695. * and bring another one in memory
  696. */
  697. orphan_blk->blk_addr = cpu_to_le16(index);
  698. orphan_blk->blk_count = cpu_to_le16(orphan_blocks);
  699. orphan_blk->entry_count = cpu_to_le32(nentries);
  700. set_page_dirty(page);
  701. f2fs_put_page(page, 1);
  702. index++;
  703. nentries = 0;
  704. page = NULL;
  705. }
  706. }
  707. if (page) {
  708. orphan_blk->blk_addr = cpu_to_le16(index);
  709. orphan_blk->blk_count = cpu_to_le16(orphan_blocks);
  710. orphan_blk->entry_count = cpu_to_le32(nentries);
  711. set_page_dirty(page);
  712. f2fs_put_page(page, 1);
  713. }
  714. }
  715. static __u32 f2fs_checkpoint_chksum(struct f2fs_sb_info *sbi,
  716. struct f2fs_checkpoint *ckpt)
  717. {
  718. unsigned int chksum_ofs = le32_to_cpu(ckpt->checksum_offset);
  719. __u32 chksum;
  720. chksum = f2fs_crc32(sbi, ckpt, chksum_ofs);
  721. if (chksum_ofs < CP_CHKSUM_OFFSET) {
  722. chksum_ofs += sizeof(chksum);
  723. chksum = f2fs_chksum(sbi, chksum, (__u8 *)ckpt + chksum_ofs,
  724. F2FS_BLKSIZE - chksum_ofs);
  725. }
  726. return chksum;
  727. }
  728. static int get_checkpoint_version(struct f2fs_sb_info *sbi, block_t cp_addr,
  729. struct f2fs_checkpoint **cp_block, struct page **cp_page,
  730. unsigned long long *version)
  731. {
  732. size_t crc_offset = 0;
  733. __u32 crc;
  734. *cp_page = f2fs_get_meta_page(sbi, cp_addr);
  735. if (IS_ERR(*cp_page))
  736. return PTR_ERR(*cp_page);
  737. *cp_block = (struct f2fs_checkpoint *)page_address(*cp_page);
  738. crc_offset = le32_to_cpu((*cp_block)->checksum_offset);
  739. if (crc_offset < CP_MIN_CHKSUM_OFFSET ||
  740. crc_offset > CP_CHKSUM_OFFSET) {
  741. f2fs_put_page(*cp_page, 1);
  742. f2fs_warn(sbi, "invalid crc_offset: %zu", crc_offset);
  743. return -EINVAL;
  744. }
  745. crc = f2fs_checkpoint_chksum(sbi, *cp_block);
  746. if (crc != cur_cp_crc(*cp_block)) {
  747. f2fs_put_page(*cp_page, 1);
  748. f2fs_warn(sbi, "invalid crc value");
  749. return -EINVAL;
  750. }
  751. *version = cur_cp_version(*cp_block);
  752. return 0;
  753. }
  754. static struct page *validate_checkpoint(struct f2fs_sb_info *sbi,
  755. block_t cp_addr, unsigned long long *version)
  756. {
  757. struct page *cp_page_1 = NULL, *cp_page_2 = NULL;
  758. struct f2fs_checkpoint *cp_block = NULL;
  759. unsigned long long cur_version = 0, pre_version = 0;
  760. unsigned int cp_blocks;
  761. int err;
  762. err = get_checkpoint_version(sbi, cp_addr, &cp_block,
  763. &cp_page_1, version);
  764. if (err)
  765. return NULL;
  766. cp_blocks = le32_to_cpu(cp_block->cp_pack_total_block_count);
  767. if (cp_blocks > BLKS_PER_SEG(sbi) || cp_blocks <= F2FS_CP_PACKS) {
  768. f2fs_warn(sbi, "invalid cp_pack_total_block_count:%u",
  769. le32_to_cpu(cp_block->cp_pack_total_block_count));
  770. goto invalid_cp;
  771. }
  772. pre_version = *version;
  773. cp_addr += cp_blocks - 1;
  774. err = get_checkpoint_version(sbi, cp_addr, &cp_block,
  775. &cp_page_2, version);
  776. if (err)
  777. goto invalid_cp;
  778. cur_version = *version;
  779. if (cur_version == pre_version) {
  780. *version = cur_version;
  781. f2fs_put_page(cp_page_2, 1);
  782. return cp_page_1;
  783. }
  784. f2fs_put_page(cp_page_2, 1);
  785. invalid_cp:
  786. f2fs_put_page(cp_page_1, 1);
  787. return NULL;
  788. }
  789. int f2fs_get_valid_checkpoint(struct f2fs_sb_info *sbi)
  790. {
  791. struct f2fs_checkpoint *cp_block;
  792. struct f2fs_super_block *fsb = sbi->raw_super;
  793. struct page *cp1, *cp2, *cur_page;
  794. unsigned long blk_size = sbi->blocksize;
  795. unsigned long long cp1_version = 0, cp2_version = 0;
  796. unsigned long long cp_start_blk_no;
  797. unsigned int cp_blks = 1 + __cp_payload(sbi);
  798. block_t cp_blk_no;
  799. int i;
  800. int err;
  801. sbi->ckpt = f2fs_kvzalloc(sbi, array_size(blk_size, cp_blks),
  802. GFP_KERNEL);
  803. if (!sbi->ckpt)
  804. return -ENOMEM;
  805. /*
  806. * Finding out valid cp block involves read both
  807. * sets( cp pack 1 and cp pack 2)
  808. */
  809. cp_start_blk_no = le32_to_cpu(fsb->cp_blkaddr);
  810. cp1 = validate_checkpoint(sbi, cp_start_blk_no, &cp1_version);
  811. /* The second checkpoint pack should start at the next segment */
  812. cp_start_blk_no += ((unsigned long long)1) <<
  813. le32_to_cpu(fsb->log_blocks_per_seg);
  814. cp2 = validate_checkpoint(sbi, cp_start_blk_no, &cp2_version);
  815. if (cp1 && cp2) {
  816. if (ver_after(cp2_version, cp1_version))
  817. cur_page = cp2;
  818. else
  819. cur_page = cp1;
  820. } else if (cp1) {
  821. cur_page = cp1;
  822. } else if (cp2) {
  823. cur_page = cp2;
  824. } else {
  825. err = -EFSCORRUPTED;
  826. goto fail_no_cp;
  827. }
  828. cp_block = (struct f2fs_checkpoint *)page_address(cur_page);
  829. memcpy(sbi->ckpt, cp_block, blk_size);
  830. if (cur_page == cp1)
  831. sbi->cur_cp_pack = 1;
  832. else
  833. sbi->cur_cp_pack = 2;
  834. /* Sanity checking of checkpoint */
  835. if (f2fs_sanity_check_ckpt(sbi)) {
  836. err = -EFSCORRUPTED;
  837. goto free_fail_no_cp;
  838. }
  839. if (cp_blks <= 1)
  840. goto done;
  841. cp_blk_no = le32_to_cpu(fsb->cp_blkaddr);
  842. if (cur_page == cp2)
  843. cp_blk_no += BIT(le32_to_cpu(fsb->log_blocks_per_seg));
  844. for (i = 1; i < cp_blks; i++) {
  845. void *sit_bitmap_ptr;
  846. unsigned char *ckpt = (unsigned char *)sbi->ckpt;
  847. cur_page = f2fs_get_meta_page(sbi, cp_blk_no + i);
  848. if (IS_ERR(cur_page)) {
  849. err = PTR_ERR(cur_page);
  850. goto free_fail_no_cp;
  851. }
  852. sit_bitmap_ptr = page_address(cur_page);
  853. memcpy(ckpt + i * blk_size, sit_bitmap_ptr, blk_size);
  854. f2fs_put_page(cur_page, 1);
  855. }
  856. done:
  857. f2fs_put_page(cp1, 1);
  858. f2fs_put_page(cp2, 1);
  859. return 0;
  860. free_fail_no_cp:
  861. f2fs_put_page(cp1, 1);
  862. f2fs_put_page(cp2, 1);
  863. fail_no_cp:
  864. kvfree(sbi->ckpt);
  865. return err;
  866. }
  867. static void __add_dirty_inode(struct inode *inode, enum inode_type type)
  868. {
  869. struct f2fs_sb_info *sbi = F2FS_I_SB(inode);
  870. int flag = (type == DIR_INODE) ? FI_DIRTY_DIR : FI_DIRTY_FILE;
  871. if (is_inode_flag_set(inode, flag))
  872. return;
  873. set_inode_flag(inode, flag);
  874. list_add_tail(&F2FS_I(inode)->dirty_list, &sbi->inode_list[type]);
  875. stat_inc_dirty_inode(sbi, type);
  876. }
  877. static void __remove_dirty_inode(struct inode *inode, enum inode_type type)
  878. {
  879. int flag = (type == DIR_INODE) ? FI_DIRTY_DIR : FI_DIRTY_FILE;
  880. if (get_dirty_pages(inode) || !is_inode_flag_set(inode, flag))
  881. return;
  882. list_del_init(&F2FS_I(inode)->dirty_list);
  883. clear_inode_flag(inode, flag);
  884. stat_dec_dirty_inode(F2FS_I_SB(inode), type);
  885. }
  886. void f2fs_update_dirty_folio(struct inode *inode, struct folio *folio)
  887. {
  888. struct f2fs_sb_info *sbi = F2FS_I_SB(inode);
  889. enum inode_type type = S_ISDIR(inode->i_mode) ? DIR_INODE : FILE_INODE;
  890. if (!S_ISDIR(inode->i_mode) && !S_ISREG(inode->i_mode) &&
  891. !S_ISLNK(inode->i_mode))
  892. return;
  893. spin_lock(&sbi->inode_lock[type]);
  894. if (type != FILE_INODE || test_opt(sbi, DATA_FLUSH))
  895. __add_dirty_inode(inode, type);
  896. inode_inc_dirty_pages(inode);
  897. spin_unlock(&sbi->inode_lock[type]);
  898. set_page_private_reference(&folio->page);
  899. }
  900. void f2fs_remove_dirty_inode(struct inode *inode)
  901. {
  902. struct f2fs_sb_info *sbi = F2FS_I_SB(inode);
  903. enum inode_type type = S_ISDIR(inode->i_mode) ? DIR_INODE : FILE_INODE;
  904. if (!S_ISDIR(inode->i_mode) && !S_ISREG(inode->i_mode) &&
  905. !S_ISLNK(inode->i_mode))
  906. return;
  907. if (type == FILE_INODE && !test_opt(sbi, DATA_FLUSH))
  908. return;
  909. spin_lock(&sbi->inode_lock[type]);
  910. __remove_dirty_inode(inode, type);
  911. spin_unlock(&sbi->inode_lock[type]);
  912. }
  913. int f2fs_sync_dirty_inodes(struct f2fs_sb_info *sbi, enum inode_type type,
  914. bool from_cp)
  915. {
  916. struct list_head *head;
  917. struct inode *inode;
  918. struct f2fs_inode_info *fi;
  919. bool is_dir = (type == DIR_INODE);
  920. unsigned long ino = 0;
  921. trace_f2fs_sync_dirty_inodes_enter(sbi->sb, is_dir,
  922. get_pages(sbi, is_dir ?
  923. F2FS_DIRTY_DENTS : F2FS_DIRTY_DATA));
  924. retry:
  925. if (unlikely(f2fs_cp_error(sbi))) {
  926. trace_f2fs_sync_dirty_inodes_exit(sbi->sb, is_dir,
  927. get_pages(sbi, is_dir ?
  928. F2FS_DIRTY_DENTS : F2FS_DIRTY_DATA));
  929. return -EIO;
  930. }
  931. spin_lock(&sbi->inode_lock[type]);
  932. head = &sbi->inode_list[type];
  933. if (list_empty(head)) {
  934. spin_unlock(&sbi->inode_lock[type]);
  935. trace_f2fs_sync_dirty_inodes_exit(sbi->sb, is_dir,
  936. get_pages(sbi, is_dir ?
  937. F2FS_DIRTY_DENTS : F2FS_DIRTY_DATA));
  938. return 0;
  939. }
  940. fi = list_first_entry(head, struct f2fs_inode_info, dirty_list);
  941. inode = igrab(&fi->vfs_inode);
  942. spin_unlock(&sbi->inode_lock[type]);
  943. if (inode) {
  944. unsigned long cur_ino = inode->i_ino;
  945. if (from_cp)
  946. F2FS_I(inode)->cp_task = current;
  947. F2FS_I(inode)->wb_task = current;
  948. filemap_fdatawrite(inode->i_mapping);
  949. F2FS_I(inode)->wb_task = NULL;
  950. if (from_cp)
  951. F2FS_I(inode)->cp_task = NULL;
  952. iput(inode);
  953. /* We need to give cpu to another writers. */
  954. if (ino == cur_ino)
  955. cond_resched();
  956. else
  957. ino = cur_ino;
  958. } else {
  959. /*
  960. * We should submit bio, since it exists several
  961. * writebacking dentry pages in the freeing inode.
  962. */
  963. f2fs_submit_merged_write(sbi, DATA);
  964. cond_resched();
  965. }
  966. goto retry;
  967. }
  968. static int f2fs_sync_inode_meta(struct f2fs_sb_info *sbi)
  969. {
  970. struct list_head *head = &sbi->inode_list[DIRTY_META];
  971. struct inode *inode;
  972. struct f2fs_inode_info *fi;
  973. s64 total = get_pages(sbi, F2FS_DIRTY_IMETA);
  974. while (total--) {
  975. if (unlikely(f2fs_cp_error(sbi)))
  976. return -EIO;
  977. spin_lock(&sbi->inode_lock[DIRTY_META]);
  978. if (list_empty(head)) {
  979. spin_unlock(&sbi->inode_lock[DIRTY_META]);
  980. return 0;
  981. }
  982. fi = list_first_entry(head, struct f2fs_inode_info,
  983. gdirty_list);
  984. inode = igrab(&fi->vfs_inode);
  985. spin_unlock(&sbi->inode_lock[DIRTY_META]);
  986. if (inode) {
  987. sync_inode_metadata(inode, 0);
  988. /* it's on eviction */
  989. if (is_inode_flag_set(inode, FI_DIRTY_INODE))
  990. f2fs_update_inode_page(inode);
  991. iput(inode);
  992. }
  993. }
  994. return 0;
  995. }
  996. static void __prepare_cp_block(struct f2fs_sb_info *sbi)
  997. {
  998. struct f2fs_checkpoint *ckpt = F2FS_CKPT(sbi);
  999. struct f2fs_nm_info *nm_i = NM_I(sbi);
  1000. nid_t last_nid = nm_i->next_scan_nid;
  1001. next_free_nid(sbi, &last_nid);
  1002. ckpt->valid_block_count = cpu_to_le64(valid_user_blocks(sbi));
  1003. ckpt->valid_node_count = cpu_to_le32(valid_node_count(sbi));
  1004. ckpt->valid_inode_count = cpu_to_le32(valid_inode_count(sbi));
  1005. ckpt->next_free_nid = cpu_to_le32(last_nid);
  1006. /* update user_block_counts */
  1007. sbi->last_valid_block_count = sbi->total_valid_block_count;
  1008. percpu_counter_set(&sbi->alloc_valid_block_count, 0);
  1009. percpu_counter_set(&sbi->rf_node_block_count, 0);
  1010. }
  1011. static bool __need_flush_quota(struct f2fs_sb_info *sbi)
  1012. {
  1013. bool ret = false;
  1014. if (!is_journalled_quota(sbi))
  1015. return false;
  1016. if (!f2fs_down_write_trylock(&sbi->quota_sem))
  1017. return true;
  1018. if (is_sbi_flag_set(sbi, SBI_QUOTA_SKIP_FLUSH)) {
  1019. ret = false;
  1020. } else if (is_sbi_flag_set(sbi, SBI_QUOTA_NEED_REPAIR)) {
  1021. ret = false;
  1022. } else if (is_sbi_flag_set(sbi, SBI_QUOTA_NEED_FLUSH)) {
  1023. clear_sbi_flag(sbi, SBI_QUOTA_NEED_FLUSH);
  1024. ret = true;
  1025. } else if (get_pages(sbi, F2FS_DIRTY_QDATA)) {
  1026. ret = true;
  1027. }
  1028. f2fs_up_write(&sbi->quota_sem);
  1029. return ret;
  1030. }
  1031. /*
  1032. * Freeze all the FS-operations for checkpoint.
  1033. */
  1034. static int block_operations(struct f2fs_sb_info *sbi)
  1035. {
  1036. struct writeback_control wbc = {
  1037. .sync_mode = WB_SYNC_ALL,
  1038. .nr_to_write = LONG_MAX,
  1039. .for_reclaim = 0,
  1040. };
  1041. int err = 0, cnt = 0;
  1042. /*
  1043. * Let's flush inline_data in dirty node pages.
  1044. */
  1045. f2fs_flush_inline_data(sbi);
  1046. retry_flush_quotas:
  1047. f2fs_lock_all(sbi);
  1048. if (__need_flush_quota(sbi)) {
  1049. int locked;
  1050. if (++cnt > DEFAULT_RETRY_QUOTA_FLUSH_COUNT) {
  1051. set_sbi_flag(sbi, SBI_QUOTA_SKIP_FLUSH);
  1052. set_sbi_flag(sbi, SBI_QUOTA_NEED_FLUSH);
  1053. goto retry_flush_dents;
  1054. }
  1055. f2fs_unlock_all(sbi);
  1056. /* only failed during mount/umount/freeze/quotactl */
  1057. locked = down_read_trylock(&sbi->sb->s_umount);
  1058. f2fs_quota_sync(sbi->sb, -1);
  1059. if (locked)
  1060. up_read(&sbi->sb->s_umount);
  1061. cond_resched();
  1062. goto retry_flush_quotas;
  1063. }
  1064. retry_flush_dents:
  1065. /* write all the dirty dentry pages */
  1066. if (get_pages(sbi, F2FS_DIRTY_DENTS)) {
  1067. f2fs_unlock_all(sbi);
  1068. err = f2fs_sync_dirty_inodes(sbi, DIR_INODE, true);
  1069. if (err)
  1070. return err;
  1071. cond_resched();
  1072. goto retry_flush_quotas;
  1073. }
  1074. /*
  1075. * POR: we should ensure that there are no dirty node pages
  1076. * until finishing nat/sit flush. inode->i_blocks can be updated.
  1077. */
  1078. f2fs_down_write(&sbi->node_change);
  1079. if (get_pages(sbi, F2FS_DIRTY_IMETA)) {
  1080. f2fs_up_write(&sbi->node_change);
  1081. f2fs_unlock_all(sbi);
  1082. err = f2fs_sync_inode_meta(sbi);
  1083. if (err)
  1084. return err;
  1085. cond_resched();
  1086. goto retry_flush_quotas;
  1087. }
  1088. retry_flush_nodes:
  1089. f2fs_down_write(&sbi->node_write);
  1090. if (get_pages(sbi, F2FS_DIRTY_NODES)) {
  1091. f2fs_up_write(&sbi->node_write);
  1092. atomic_inc(&sbi->wb_sync_req[NODE]);
  1093. err = f2fs_sync_node_pages(sbi, &wbc, false, FS_CP_NODE_IO);
  1094. atomic_dec(&sbi->wb_sync_req[NODE]);
  1095. if (err) {
  1096. f2fs_up_write(&sbi->node_change);
  1097. f2fs_unlock_all(sbi);
  1098. return err;
  1099. }
  1100. cond_resched();
  1101. goto retry_flush_nodes;
  1102. }
  1103. /*
  1104. * sbi->node_change is used only for AIO write_begin path which produces
  1105. * dirty node blocks and some checkpoint values by block allocation.
  1106. */
  1107. __prepare_cp_block(sbi);
  1108. f2fs_up_write(&sbi->node_change);
  1109. return err;
  1110. }
  1111. static void unblock_operations(struct f2fs_sb_info *sbi)
  1112. {
  1113. f2fs_up_write(&sbi->node_write);
  1114. f2fs_unlock_all(sbi);
  1115. }
  1116. void f2fs_wait_on_all_pages(struct f2fs_sb_info *sbi, int type)
  1117. {
  1118. DEFINE_WAIT(wait);
  1119. for (;;) {
  1120. if (!get_pages(sbi, type))
  1121. break;
  1122. if (unlikely(f2fs_cp_error(sbi) &&
  1123. !is_sbi_flag_set(sbi, SBI_IS_CLOSE)))
  1124. break;
  1125. if (type == F2FS_DIRTY_META)
  1126. f2fs_sync_meta_pages(sbi, META, LONG_MAX,
  1127. FS_CP_META_IO);
  1128. else if (type == F2FS_WB_CP_DATA)
  1129. f2fs_submit_merged_write(sbi, DATA);
  1130. prepare_to_wait(&sbi->cp_wait, &wait, TASK_UNINTERRUPTIBLE);
  1131. io_schedule_timeout(DEFAULT_IO_TIMEOUT);
  1132. }
  1133. finish_wait(&sbi->cp_wait, &wait);
  1134. }
  1135. static void update_ckpt_flags(struct f2fs_sb_info *sbi, struct cp_control *cpc)
  1136. {
  1137. unsigned long orphan_num = sbi->im[ORPHAN_INO].ino_num;
  1138. struct f2fs_checkpoint *ckpt = F2FS_CKPT(sbi);
  1139. unsigned long flags;
  1140. spin_lock_irqsave(&sbi->cp_lock, flags);
  1141. if ((cpc->reason & CP_UMOUNT) &&
  1142. le32_to_cpu(ckpt->cp_pack_total_block_count) >
  1143. sbi->blocks_per_seg - NM_I(sbi)->nat_bits_blocks)
  1144. disable_nat_bits(sbi, false);
  1145. if (cpc->reason & CP_TRIMMED)
  1146. __set_ckpt_flags(ckpt, CP_TRIMMED_FLAG);
  1147. else
  1148. __clear_ckpt_flags(ckpt, CP_TRIMMED_FLAG);
  1149. if (cpc->reason & CP_UMOUNT)
  1150. __set_ckpt_flags(ckpt, CP_UMOUNT_FLAG);
  1151. else
  1152. __clear_ckpt_flags(ckpt, CP_UMOUNT_FLAG);
  1153. if (cpc->reason & CP_FASTBOOT)
  1154. __set_ckpt_flags(ckpt, CP_FASTBOOT_FLAG);
  1155. else
  1156. __clear_ckpt_flags(ckpt, CP_FASTBOOT_FLAG);
  1157. if (orphan_num)
  1158. __set_ckpt_flags(ckpt, CP_ORPHAN_PRESENT_FLAG);
  1159. else
  1160. __clear_ckpt_flags(ckpt, CP_ORPHAN_PRESENT_FLAG);
  1161. if (is_sbi_flag_set(sbi, SBI_NEED_FSCK))
  1162. __set_ckpt_flags(ckpt, CP_FSCK_FLAG);
  1163. if (is_sbi_flag_set(sbi, SBI_IS_RESIZEFS))
  1164. __set_ckpt_flags(ckpt, CP_RESIZEFS_FLAG);
  1165. else
  1166. __clear_ckpt_flags(ckpt, CP_RESIZEFS_FLAG);
  1167. if (is_sbi_flag_set(sbi, SBI_CP_DISABLED))
  1168. __set_ckpt_flags(ckpt, CP_DISABLED_FLAG);
  1169. else
  1170. __clear_ckpt_flags(ckpt, CP_DISABLED_FLAG);
  1171. if (is_sbi_flag_set(sbi, SBI_CP_DISABLED_QUICK))
  1172. __set_ckpt_flags(ckpt, CP_DISABLED_QUICK_FLAG);
  1173. else
  1174. __clear_ckpt_flags(ckpt, CP_DISABLED_QUICK_FLAG);
  1175. if (is_sbi_flag_set(sbi, SBI_QUOTA_SKIP_FLUSH))
  1176. __set_ckpt_flags(ckpt, CP_QUOTA_NEED_FSCK_FLAG);
  1177. else
  1178. __clear_ckpt_flags(ckpt, CP_QUOTA_NEED_FSCK_FLAG);
  1179. if (is_sbi_flag_set(sbi, SBI_QUOTA_NEED_REPAIR))
  1180. __set_ckpt_flags(ckpt, CP_QUOTA_NEED_FSCK_FLAG);
  1181. /* set this flag to activate crc|cp_ver for recovery */
  1182. __set_ckpt_flags(ckpt, CP_CRC_RECOVERY_FLAG);
  1183. __clear_ckpt_flags(ckpt, CP_NOCRC_RECOVERY_FLAG);
  1184. spin_unlock_irqrestore(&sbi->cp_lock, flags);
  1185. }
  1186. static void commit_checkpoint(struct f2fs_sb_info *sbi,
  1187. void *src, block_t blk_addr)
  1188. {
  1189. struct writeback_control wbc = {
  1190. .for_reclaim = 0,
  1191. };
  1192. /*
  1193. * filemap_get_folios_tag and lock_page again will take
  1194. * some extra time. Therefore, f2fs_update_meta_pages and
  1195. * f2fs_sync_meta_pages are combined in this function.
  1196. */
  1197. struct page *page = f2fs_grab_meta_page(sbi, blk_addr);
  1198. int err;
  1199. f2fs_wait_on_page_writeback(page, META, true, true);
  1200. memcpy(page_address(page), src, PAGE_SIZE);
  1201. set_page_dirty(page);
  1202. if (unlikely(!clear_page_dirty_for_io(page)))
  1203. f2fs_bug_on(sbi, 1);
  1204. /* writeout cp pack 2 page */
  1205. err = __f2fs_write_meta_page(page, &wbc, FS_CP_META_IO);
  1206. if (unlikely(err && f2fs_cp_error(sbi))) {
  1207. f2fs_put_page(page, 1);
  1208. return;
  1209. }
  1210. f2fs_bug_on(sbi, err);
  1211. f2fs_put_page(page, 0);
  1212. /* submit checkpoint (with barrier if NOBARRIER is not set) */
  1213. f2fs_submit_merged_write(sbi, META_FLUSH);
  1214. }
  1215. static inline u64 get_sectors_written(struct block_device *bdev)
  1216. {
  1217. return (u64)part_stat_read(bdev, sectors[STAT_WRITE]);
  1218. }
  1219. u64 f2fs_get_sectors_written(struct f2fs_sb_info *sbi)
  1220. {
  1221. if (f2fs_is_multi_device(sbi)) {
  1222. u64 sectors = 0;
  1223. int i;
  1224. for (i = 0; i < sbi->s_ndevs; i++)
  1225. sectors += get_sectors_written(FDEV(i).bdev);
  1226. return sectors;
  1227. }
  1228. return get_sectors_written(sbi->sb->s_bdev);
  1229. }
  1230. static int do_checkpoint(struct f2fs_sb_info *sbi, struct cp_control *cpc)
  1231. {
  1232. struct f2fs_checkpoint *ckpt = F2FS_CKPT(sbi);
  1233. struct f2fs_nm_info *nm_i = NM_I(sbi);
  1234. unsigned long orphan_num = sbi->im[ORPHAN_INO].ino_num, flags;
  1235. block_t start_blk;
  1236. unsigned int data_sum_blocks, orphan_blocks;
  1237. __u32 crc32 = 0;
  1238. int i;
  1239. int cp_payload_blks = __cp_payload(sbi);
  1240. struct curseg_info *seg_i = CURSEG_I(sbi, CURSEG_HOT_NODE);
  1241. u64 kbytes_written;
  1242. int err;
  1243. /* Flush all the NAT/SIT pages */
  1244. f2fs_sync_meta_pages(sbi, META, LONG_MAX, FS_CP_META_IO);
  1245. /* start to update checkpoint, cp ver is already updated previously */
  1246. ckpt->elapsed_time = cpu_to_le64(get_mtime(sbi, true));
  1247. ckpt->free_segment_count = cpu_to_le32(free_segments(sbi));
  1248. for (i = 0; i < NR_CURSEG_NODE_TYPE; i++) {
  1249. struct curseg_info *curseg = CURSEG_I(sbi, i + CURSEG_HOT_NODE);
  1250. ckpt->cur_node_segno[i] = cpu_to_le32(curseg->segno);
  1251. ckpt->cur_node_blkoff[i] = cpu_to_le16(curseg->next_blkoff);
  1252. ckpt->alloc_type[i + CURSEG_HOT_NODE] = curseg->alloc_type;
  1253. }
  1254. for (i = 0; i < NR_CURSEG_DATA_TYPE; i++) {
  1255. struct curseg_info *curseg = CURSEG_I(sbi, i + CURSEG_HOT_DATA);
  1256. ckpt->cur_data_segno[i] = cpu_to_le32(curseg->segno);
  1257. ckpt->cur_data_blkoff[i] = cpu_to_le16(curseg->next_blkoff);
  1258. ckpt->alloc_type[i + CURSEG_HOT_DATA] = curseg->alloc_type;
  1259. }
  1260. /* 2 cp + n data seg summary + orphan inode blocks */
  1261. data_sum_blocks = f2fs_npages_for_summary_flush(sbi, false);
  1262. spin_lock_irqsave(&sbi->cp_lock, flags);
  1263. if (data_sum_blocks < NR_CURSEG_DATA_TYPE)
  1264. __set_ckpt_flags(ckpt, CP_COMPACT_SUM_FLAG);
  1265. else
  1266. __clear_ckpt_flags(ckpt, CP_COMPACT_SUM_FLAG);
  1267. spin_unlock_irqrestore(&sbi->cp_lock, flags);
  1268. orphan_blocks = GET_ORPHAN_BLOCKS(orphan_num);
  1269. ckpt->cp_pack_start_sum = cpu_to_le32(1 + cp_payload_blks +
  1270. orphan_blocks);
  1271. if (__remain_node_summaries(cpc->reason))
  1272. ckpt->cp_pack_total_block_count = cpu_to_le32(F2FS_CP_PACKS +
  1273. cp_payload_blks + data_sum_blocks +
  1274. orphan_blocks + NR_CURSEG_NODE_TYPE);
  1275. else
  1276. ckpt->cp_pack_total_block_count = cpu_to_le32(F2FS_CP_PACKS +
  1277. cp_payload_blks + data_sum_blocks +
  1278. orphan_blocks);
  1279. /* update ckpt flag for checkpoint */
  1280. update_ckpt_flags(sbi, cpc);
  1281. /* update SIT/NAT bitmap */
  1282. get_sit_bitmap(sbi, __bitmap_ptr(sbi, SIT_BITMAP));
  1283. get_nat_bitmap(sbi, __bitmap_ptr(sbi, NAT_BITMAP));
  1284. crc32 = f2fs_checkpoint_chksum(sbi, ckpt);
  1285. *((__le32 *)((unsigned char *)ckpt +
  1286. le32_to_cpu(ckpt->checksum_offset)))
  1287. = cpu_to_le32(crc32);
  1288. start_blk = __start_cp_next_addr(sbi);
  1289. /* write nat bits */
  1290. if (enabled_nat_bits(sbi, cpc)) {
  1291. __u64 cp_ver = cur_cp_version(ckpt);
  1292. block_t blk;
  1293. cp_ver |= ((__u64)crc32 << 32);
  1294. *(__le64 *)nm_i->nat_bits = cpu_to_le64(cp_ver);
  1295. blk = start_blk + BLKS_PER_SEG(sbi) - nm_i->nat_bits_blocks;
  1296. for (i = 0; i < nm_i->nat_bits_blocks; i++)
  1297. f2fs_update_meta_page(sbi, nm_i->nat_bits +
  1298. F2FS_BLK_TO_BYTES(i), blk + i);
  1299. }
  1300. /* write out checkpoint buffer at block 0 */
  1301. f2fs_update_meta_page(sbi, ckpt, start_blk++);
  1302. for (i = 1; i < 1 + cp_payload_blks; i++)
  1303. f2fs_update_meta_page(sbi, (char *)ckpt + i * F2FS_BLKSIZE,
  1304. start_blk++);
  1305. if (orphan_num) {
  1306. write_orphan_inodes(sbi, start_blk);
  1307. start_blk += orphan_blocks;
  1308. }
  1309. f2fs_write_data_summaries(sbi, start_blk);
  1310. start_blk += data_sum_blocks;
  1311. /* Record write statistics in the hot node summary */
  1312. kbytes_written = sbi->kbytes_written;
  1313. kbytes_written += (f2fs_get_sectors_written(sbi) -
  1314. sbi->sectors_written_start) >> 1;
  1315. seg_i->journal->info.kbytes_written = cpu_to_le64(kbytes_written);
  1316. if (__remain_node_summaries(cpc->reason)) {
  1317. f2fs_write_node_summaries(sbi, start_blk);
  1318. start_blk += NR_CURSEG_NODE_TYPE;
  1319. }
  1320. /* Here, we have one bio having CP pack except cp pack 2 page */
  1321. f2fs_sync_meta_pages(sbi, META, LONG_MAX, FS_CP_META_IO);
  1322. /* Wait for all dirty meta pages to be submitted for IO */
  1323. f2fs_wait_on_all_pages(sbi, F2FS_DIRTY_META);
  1324. /* wait for previous submitted meta pages writeback */
  1325. f2fs_wait_on_all_pages(sbi, F2FS_WB_CP_DATA);
  1326. /* flush all device cache */
  1327. err = f2fs_flush_device_cache(sbi);
  1328. if (err)
  1329. return err;
  1330. /* barrier and flush checkpoint cp pack 2 page if it can */
  1331. commit_checkpoint(sbi, ckpt, start_blk);
  1332. f2fs_wait_on_all_pages(sbi, F2FS_WB_CP_DATA);
  1333. /*
  1334. * invalidate intermediate page cache borrowed from meta inode which are
  1335. * used for migration of encrypted, verity or compressed inode's blocks.
  1336. */
  1337. if (f2fs_sb_has_encrypt(sbi) || f2fs_sb_has_verity(sbi) ||
  1338. f2fs_sb_has_compression(sbi))
  1339. f2fs_bug_on(sbi,
  1340. invalidate_inode_pages2_range(META_MAPPING(sbi),
  1341. MAIN_BLKADDR(sbi), MAX_BLKADDR(sbi) - 1));
  1342. f2fs_release_ino_entry(sbi, false);
  1343. f2fs_reset_fsync_node_info(sbi);
  1344. clear_sbi_flag(sbi, SBI_IS_DIRTY);
  1345. clear_sbi_flag(sbi, SBI_NEED_CP);
  1346. clear_sbi_flag(sbi, SBI_QUOTA_SKIP_FLUSH);
  1347. spin_lock(&sbi->stat_lock);
  1348. sbi->unusable_block_count = 0;
  1349. spin_unlock(&sbi->stat_lock);
  1350. __set_cp_next_pack(sbi);
  1351. /*
  1352. * redirty superblock if metadata like node page or inode cache is
  1353. * updated during writing checkpoint.
  1354. */
  1355. if (get_pages(sbi, F2FS_DIRTY_NODES) ||
  1356. get_pages(sbi, F2FS_DIRTY_IMETA))
  1357. set_sbi_flag(sbi, SBI_IS_DIRTY);
  1358. f2fs_bug_on(sbi, get_pages(sbi, F2FS_DIRTY_DENTS));
  1359. return unlikely(f2fs_cp_error(sbi)) ? -EIO : 0;
  1360. }
  1361. int f2fs_write_checkpoint(struct f2fs_sb_info *sbi, struct cp_control *cpc)
  1362. {
  1363. struct f2fs_checkpoint *ckpt = F2FS_CKPT(sbi);
  1364. unsigned long long ckpt_ver;
  1365. int err = 0;
  1366. if (f2fs_readonly(sbi->sb) || f2fs_hw_is_readonly(sbi))
  1367. return -EROFS;
  1368. if (unlikely(is_sbi_flag_set(sbi, SBI_CP_DISABLED))) {
  1369. if (cpc->reason != CP_PAUSE)
  1370. return 0;
  1371. f2fs_warn(sbi, "Start checkpoint disabled!");
  1372. }
  1373. if (cpc->reason != CP_RESIZE)
  1374. f2fs_down_write(&sbi->cp_global_sem);
  1375. if (!is_sbi_flag_set(sbi, SBI_IS_DIRTY) &&
  1376. ((cpc->reason & CP_FASTBOOT) || (cpc->reason & CP_SYNC) ||
  1377. ((cpc->reason & CP_DISCARD) && !sbi->discard_blks)))
  1378. goto out;
  1379. if (unlikely(f2fs_cp_error(sbi))) {
  1380. err = -EIO;
  1381. goto out;
  1382. }
  1383. trace_f2fs_write_checkpoint(sbi->sb, cpc->reason, "start block_ops");
  1384. err = block_operations(sbi);
  1385. if (err)
  1386. goto out;
  1387. trace_f2fs_write_checkpoint(sbi->sb, cpc->reason, "finish block_ops");
  1388. f2fs_flush_merged_writes(sbi);
  1389. /* this is the case of multiple fstrims without any changes */
  1390. if (cpc->reason & CP_DISCARD) {
  1391. if (!f2fs_exist_trim_candidates(sbi, cpc)) {
  1392. unblock_operations(sbi);
  1393. goto out;
  1394. }
  1395. if (NM_I(sbi)->nat_cnt[DIRTY_NAT] == 0 &&
  1396. SIT_I(sbi)->dirty_sentries == 0 &&
  1397. prefree_segments(sbi) == 0) {
  1398. f2fs_flush_sit_entries(sbi, cpc);
  1399. f2fs_clear_prefree_segments(sbi, cpc);
  1400. unblock_operations(sbi);
  1401. goto out;
  1402. }
  1403. }
  1404. /*
  1405. * update checkpoint pack index
  1406. * Increase the version number so that
  1407. * SIT entries and seg summaries are written at correct place
  1408. */
  1409. ckpt_ver = cur_cp_version(ckpt);
  1410. ckpt->checkpoint_ver = cpu_to_le64(++ckpt_ver);
  1411. /* write cached NAT/SIT entries to NAT/SIT area */
  1412. err = f2fs_flush_nat_entries(sbi, cpc);
  1413. if (err) {
  1414. f2fs_err(sbi, "f2fs_flush_nat_entries failed err:%d, stop checkpoint", err);
  1415. f2fs_bug_on(sbi, !f2fs_cp_error(sbi));
  1416. goto stop;
  1417. }
  1418. f2fs_flush_sit_entries(sbi, cpc);
  1419. /* save inmem log status */
  1420. f2fs_save_inmem_curseg(sbi);
  1421. err = do_checkpoint(sbi, cpc);
  1422. if (err) {
  1423. f2fs_err(sbi, "do_checkpoint failed err:%d, stop checkpoint", err);
  1424. f2fs_bug_on(sbi, !f2fs_cp_error(sbi));
  1425. f2fs_release_discard_addrs(sbi);
  1426. } else {
  1427. f2fs_clear_prefree_segments(sbi, cpc);
  1428. }
  1429. f2fs_restore_inmem_curseg(sbi);
  1430. f2fs_reinit_atgc_curseg(sbi);
  1431. stat_inc_cp_count(sbi);
  1432. stop:
  1433. unblock_operations(sbi);
  1434. if (cpc->reason & CP_RECOVERY)
  1435. f2fs_notice(sbi, "checkpoint: version = %llx", ckpt_ver);
  1436. /* update CP_TIME to trigger checkpoint periodically */
  1437. f2fs_update_time(sbi, CP_TIME);
  1438. trace_f2fs_write_checkpoint(sbi->sb, cpc->reason, "finish checkpoint");
  1439. out:
  1440. if (cpc->reason != CP_RESIZE)
  1441. f2fs_up_write(&sbi->cp_global_sem);
  1442. return err;
  1443. }
  1444. void f2fs_init_ino_entry_info(struct f2fs_sb_info *sbi)
  1445. {
  1446. int i;
  1447. for (i = 0; i < MAX_INO_ENTRY; i++) {
  1448. struct inode_management *im = &sbi->im[i];
  1449. INIT_RADIX_TREE(&im->ino_root, GFP_ATOMIC);
  1450. spin_lock_init(&im->ino_lock);
  1451. INIT_LIST_HEAD(&im->ino_list);
  1452. im->ino_num = 0;
  1453. }
  1454. sbi->max_orphans = (BLKS_PER_SEG(sbi) - F2FS_CP_PACKS -
  1455. NR_CURSEG_PERSIST_TYPE - __cp_payload(sbi)) *
  1456. F2FS_ORPHANS_PER_BLOCK;
  1457. }
  1458. int __init f2fs_create_checkpoint_caches(void)
  1459. {
  1460. ino_entry_slab = f2fs_kmem_cache_create("f2fs_ino_entry",
  1461. sizeof(struct ino_entry));
  1462. if (!ino_entry_slab)
  1463. return -ENOMEM;
  1464. f2fs_inode_entry_slab = f2fs_kmem_cache_create("f2fs_inode_entry",
  1465. sizeof(struct inode_entry));
  1466. if (!f2fs_inode_entry_slab) {
  1467. kmem_cache_destroy(ino_entry_slab);
  1468. return -ENOMEM;
  1469. }
  1470. return 0;
  1471. }
  1472. void f2fs_destroy_checkpoint_caches(void)
  1473. {
  1474. kmem_cache_destroy(ino_entry_slab);
  1475. kmem_cache_destroy(f2fs_inode_entry_slab);
  1476. }
  1477. static int __write_checkpoint_sync(struct f2fs_sb_info *sbi)
  1478. {
  1479. struct cp_control cpc = { .reason = CP_SYNC, };
  1480. int err;
  1481. f2fs_down_write(&sbi->gc_lock);
  1482. err = f2fs_write_checkpoint(sbi, &cpc);
  1483. f2fs_up_write(&sbi->gc_lock);
  1484. return err;
  1485. }
  1486. static void __checkpoint_and_complete_reqs(struct f2fs_sb_info *sbi)
  1487. {
  1488. struct ckpt_req_control *cprc = &sbi->cprc_info;
  1489. struct ckpt_req *req, *next;
  1490. struct llist_node *dispatch_list;
  1491. u64 sum_diff = 0, diff, count = 0;
  1492. int ret;
  1493. dispatch_list = llist_del_all(&cprc->issue_list);
  1494. if (!dispatch_list)
  1495. return;
  1496. dispatch_list = llist_reverse_order(dispatch_list);
  1497. ret = __write_checkpoint_sync(sbi);
  1498. atomic_inc(&cprc->issued_ckpt);
  1499. llist_for_each_entry_safe(req, next, dispatch_list, llnode) {
  1500. diff = (u64)ktime_ms_delta(ktime_get(), req->queue_time);
  1501. req->ret = ret;
  1502. complete(&req->wait);
  1503. sum_diff += diff;
  1504. count++;
  1505. }
  1506. atomic_sub(count, &cprc->queued_ckpt);
  1507. atomic_add(count, &cprc->total_ckpt);
  1508. spin_lock(&cprc->stat_lock);
  1509. cprc->cur_time = (unsigned int)div64_u64(sum_diff, count);
  1510. if (cprc->peak_time < cprc->cur_time)
  1511. cprc->peak_time = cprc->cur_time;
  1512. spin_unlock(&cprc->stat_lock);
  1513. }
  1514. static int issue_checkpoint_thread(void *data)
  1515. {
  1516. struct f2fs_sb_info *sbi = data;
  1517. struct ckpt_req_control *cprc = &sbi->cprc_info;
  1518. wait_queue_head_t *q = &cprc->ckpt_wait_queue;
  1519. repeat:
  1520. if (kthread_should_stop())
  1521. return 0;
  1522. if (!llist_empty(&cprc->issue_list))
  1523. __checkpoint_and_complete_reqs(sbi);
  1524. wait_event_interruptible(*q,
  1525. kthread_should_stop() || !llist_empty(&cprc->issue_list));
  1526. goto repeat;
  1527. }
  1528. static void flush_remained_ckpt_reqs(struct f2fs_sb_info *sbi,
  1529. struct ckpt_req *wait_req)
  1530. {
  1531. struct ckpt_req_control *cprc = &sbi->cprc_info;
  1532. if (!llist_empty(&cprc->issue_list)) {
  1533. __checkpoint_and_complete_reqs(sbi);
  1534. } else {
  1535. /* already dispatched by issue_checkpoint_thread */
  1536. if (wait_req)
  1537. wait_for_completion(&wait_req->wait);
  1538. }
  1539. }
  1540. static void init_ckpt_req(struct ckpt_req *req)
  1541. {
  1542. memset(req, 0, sizeof(struct ckpt_req));
  1543. init_completion(&req->wait);
  1544. req->queue_time = ktime_get();
  1545. }
  1546. int f2fs_issue_checkpoint(struct f2fs_sb_info *sbi)
  1547. {
  1548. struct ckpt_req_control *cprc = &sbi->cprc_info;
  1549. struct ckpt_req req;
  1550. struct cp_control cpc;
  1551. cpc.reason = __get_cp_reason(sbi);
  1552. if (!test_opt(sbi, MERGE_CHECKPOINT) || cpc.reason != CP_SYNC) {
  1553. int ret;
  1554. f2fs_down_write(&sbi->gc_lock);
  1555. ret = f2fs_write_checkpoint(sbi, &cpc);
  1556. f2fs_up_write(&sbi->gc_lock);
  1557. return ret;
  1558. }
  1559. if (!cprc->f2fs_issue_ckpt)
  1560. return __write_checkpoint_sync(sbi);
  1561. init_ckpt_req(&req);
  1562. llist_add(&req.llnode, &cprc->issue_list);
  1563. atomic_inc(&cprc->queued_ckpt);
  1564. /*
  1565. * update issue_list before we wake up issue_checkpoint thread,
  1566. * this smp_mb() pairs with another barrier in ___wait_event(),
  1567. * see more details in comments of waitqueue_active().
  1568. */
  1569. smp_mb();
  1570. if (waitqueue_active(&cprc->ckpt_wait_queue))
  1571. wake_up(&cprc->ckpt_wait_queue);
  1572. if (cprc->f2fs_issue_ckpt)
  1573. wait_for_completion(&req.wait);
  1574. else
  1575. flush_remained_ckpt_reqs(sbi, &req);
  1576. return req.ret;
  1577. }
  1578. int f2fs_start_ckpt_thread(struct f2fs_sb_info *sbi)
  1579. {
  1580. dev_t dev = sbi->sb->s_bdev->bd_dev;
  1581. struct ckpt_req_control *cprc = &sbi->cprc_info;
  1582. if (cprc->f2fs_issue_ckpt)
  1583. return 0;
  1584. cprc->f2fs_issue_ckpt = kthread_run(issue_checkpoint_thread, sbi,
  1585. "f2fs_ckpt-%u:%u", MAJOR(dev), MINOR(dev));
  1586. if (IS_ERR(cprc->f2fs_issue_ckpt)) {
  1587. int err = PTR_ERR(cprc->f2fs_issue_ckpt);
  1588. cprc->f2fs_issue_ckpt = NULL;
  1589. return err;
  1590. }
  1591. set_task_ioprio(cprc->f2fs_issue_ckpt, cprc->ckpt_thread_ioprio);
  1592. return 0;
  1593. }
  1594. void f2fs_stop_ckpt_thread(struct f2fs_sb_info *sbi)
  1595. {
  1596. struct ckpt_req_control *cprc = &sbi->cprc_info;
  1597. struct task_struct *ckpt_task;
  1598. if (!cprc->f2fs_issue_ckpt)
  1599. return;
  1600. ckpt_task = cprc->f2fs_issue_ckpt;
  1601. cprc->f2fs_issue_ckpt = NULL;
  1602. kthread_stop(ckpt_task);
  1603. f2fs_flush_ckpt_thread(sbi);
  1604. }
  1605. void f2fs_flush_ckpt_thread(struct f2fs_sb_info *sbi)
  1606. {
  1607. struct ckpt_req_control *cprc = &sbi->cprc_info;
  1608. flush_remained_ckpt_reqs(sbi, NULL);
  1609. /* Let's wait for the previous dispatched checkpoint. */
  1610. while (atomic_read(&cprc->queued_ckpt))
  1611. io_schedule_timeout(DEFAULT_IO_TIMEOUT);
  1612. }
  1613. void f2fs_init_ckpt_req_control(struct f2fs_sb_info *sbi)
  1614. {
  1615. struct ckpt_req_control *cprc = &sbi->cprc_info;
  1616. atomic_set(&cprc->issued_ckpt, 0);
  1617. atomic_set(&cprc->total_ckpt, 0);
  1618. atomic_set(&cprc->queued_ckpt, 0);
  1619. cprc->ckpt_thread_ioprio = DEFAULT_CHECKPOINT_IOPRIO;
  1620. init_waitqueue_head(&cprc->ckpt_wait_queue);
  1621. init_llist_head(&cprc->issue_list);
  1622. spin_lock_init(&cprc->stat_lock);
  1623. }