sufile.c 34 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281
  1. // SPDX-License-Identifier: GPL-2.0+
  2. /*
  3. * NILFS segment usage file.
  4. *
  5. * Copyright (C) 2006-2008 Nippon Telegraph and Telephone Corporation.
  6. *
  7. * Written by Koji Sato.
  8. * Revised by Ryusuke Konishi.
  9. */
  10. #include <linux/kernel.h>
  11. #include <linux/fs.h>
  12. #include <linux/string.h>
  13. #include <linux/buffer_head.h>
  14. #include <linux/errno.h>
  15. #include "mdt.h"
  16. #include "sufile.h"
  17. #include <trace/events/nilfs2.h>
  18. /**
  19. * struct nilfs_sufile_info - on-memory private data of sufile
  20. * @mi: on-memory private data of metadata file
  21. * @ncleansegs: number of clean segments
  22. * @allocmin: lower limit of allocatable segment range
  23. * @allocmax: upper limit of allocatable segment range
  24. */
  25. struct nilfs_sufile_info {
  26. struct nilfs_mdt_info mi;
  27. unsigned long ncleansegs;/* number of clean segments */
  28. __u64 allocmin; /* lower limit of allocatable segment range */
  29. __u64 allocmax; /* upper limit of allocatable segment range */
  30. };
  31. static inline struct nilfs_sufile_info *NILFS_SUI(struct inode *sufile)
  32. {
  33. return (struct nilfs_sufile_info *)NILFS_MDT(sufile);
  34. }
  35. static inline unsigned long
  36. nilfs_sufile_segment_usages_per_block(const struct inode *sufile)
  37. {
  38. return NILFS_MDT(sufile)->mi_entries_per_block;
  39. }
  40. static unsigned long
  41. nilfs_sufile_get_blkoff(const struct inode *sufile, __u64 segnum)
  42. {
  43. __u64 t = segnum + NILFS_MDT(sufile)->mi_first_entry_offset;
  44. t = div64_ul(t, nilfs_sufile_segment_usages_per_block(sufile));
  45. return (unsigned long)t;
  46. }
  47. static unsigned long
  48. nilfs_sufile_get_offset(const struct inode *sufile, __u64 segnum)
  49. {
  50. __u64 t = segnum + NILFS_MDT(sufile)->mi_first_entry_offset;
  51. return do_div(t, nilfs_sufile_segment_usages_per_block(sufile));
  52. }
  53. static unsigned long
  54. nilfs_sufile_segment_usages_in_block(const struct inode *sufile, __u64 curr,
  55. __u64 max)
  56. {
  57. return min_t(unsigned long,
  58. nilfs_sufile_segment_usages_per_block(sufile) -
  59. nilfs_sufile_get_offset(sufile, curr),
  60. max - curr + 1);
  61. }
  62. static struct nilfs_segment_usage *
  63. nilfs_sufile_block_get_segment_usage(const struct inode *sufile, __u64 segnum,
  64. struct buffer_head *bh, void *kaddr)
  65. {
  66. return kaddr + bh_offset(bh) +
  67. nilfs_sufile_get_offset(sufile, segnum) *
  68. NILFS_MDT(sufile)->mi_entry_size;
  69. }
  70. static int nilfs_sufile_get_header_block(struct inode *sufile,
  71. struct buffer_head **bhp)
  72. {
  73. int err = nilfs_mdt_get_block(sufile, 0, 0, NULL, bhp);
  74. if (unlikely(err == -ENOENT)) {
  75. nilfs_error(sufile->i_sb,
  76. "missing header block in segment usage metadata");
  77. err = -EIO;
  78. }
  79. return err;
  80. }
  81. static inline int
  82. nilfs_sufile_get_segment_usage_block(struct inode *sufile, __u64 segnum,
  83. int create, struct buffer_head **bhp)
  84. {
  85. return nilfs_mdt_get_block(sufile,
  86. nilfs_sufile_get_blkoff(sufile, segnum),
  87. create, NULL, bhp);
  88. }
  89. static int nilfs_sufile_delete_segment_usage_block(struct inode *sufile,
  90. __u64 segnum)
  91. {
  92. return nilfs_mdt_delete_block(sufile,
  93. nilfs_sufile_get_blkoff(sufile, segnum));
  94. }
  95. static void nilfs_sufile_mod_counter(struct buffer_head *header_bh,
  96. u64 ncleanadd, u64 ndirtyadd)
  97. {
  98. struct nilfs_sufile_header *header;
  99. void *kaddr;
  100. kaddr = kmap_local_page(header_bh->b_page);
  101. header = kaddr + bh_offset(header_bh);
  102. le64_add_cpu(&header->sh_ncleansegs, ncleanadd);
  103. le64_add_cpu(&header->sh_ndirtysegs, ndirtyadd);
  104. kunmap_local(kaddr);
  105. mark_buffer_dirty(header_bh);
  106. }
  107. /**
  108. * nilfs_sufile_get_ncleansegs - return the number of clean segments
  109. * @sufile: inode of segment usage file
  110. */
  111. unsigned long nilfs_sufile_get_ncleansegs(struct inode *sufile)
  112. {
  113. return NILFS_SUI(sufile)->ncleansegs;
  114. }
  115. /**
  116. * nilfs_sufile_updatev - modify multiple segment usages at a time
  117. * @sufile: inode of segment usage file
  118. * @segnumv: array of segment numbers
  119. * @nsegs: size of @segnumv array
  120. * @create: creation flag
  121. * @ndone: place to store number of modified segments on @segnumv
  122. * @dofunc: primitive operation for the update
  123. *
  124. * Description: nilfs_sufile_updatev() repeatedly calls @dofunc
  125. * against the given array of segments. The @dofunc is called with
  126. * buffers of a header block and the sufile block in which the target
  127. * segment usage entry is contained. If @ndone is given, the number
  128. * of successfully modified segments from the head is stored in the
  129. * place @ndone points to.
  130. *
  131. * Return Value: On success, zero is returned. On error, one of the
  132. * following negative error codes is returned.
  133. *
  134. * %-EIO - I/O error.
  135. *
  136. * %-ENOMEM - Insufficient amount of memory available.
  137. *
  138. * %-ENOENT - Given segment usage is in hole block (may be returned if
  139. * @create is zero)
  140. *
  141. * %-EINVAL - Invalid segment usage number
  142. */
  143. int nilfs_sufile_updatev(struct inode *sufile, __u64 *segnumv, size_t nsegs,
  144. int create, size_t *ndone,
  145. void (*dofunc)(struct inode *, __u64,
  146. struct buffer_head *,
  147. struct buffer_head *))
  148. {
  149. struct buffer_head *header_bh, *bh;
  150. unsigned long blkoff, prev_blkoff;
  151. __u64 *seg;
  152. size_t nerr = 0, n = 0;
  153. int ret = 0;
  154. if (unlikely(nsegs == 0))
  155. goto out;
  156. down_write(&NILFS_MDT(sufile)->mi_sem);
  157. for (seg = segnumv; seg < segnumv + nsegs; seg++) {
  158. if (unlikely(*seg >= nilfs_sufile_get_nsegments(sufile))) {
  159. nilfs_warn(sufile->i_sb,
  160. "%s: invalid segment number: %llu",
  161. __func__, (unsigned long long)*seg);
  162. nerr++;
  163. }
  164. }
  165. if (nerr > 0) {
  166. ret = -EINVAL;
  167. goto out_sem;
  168. }
  169. ret = nilfs_sufile_get_header_block(sufile, &header_bh);
  170. if (ret < 0)
  171. goto out_sem;
  172. seg = segnumv;
  173. blkoff = nilfs_sufile_get_blkoff(sufile, *seg);
  174. ret = nilfs_mdt_get_block(sufile, blkoff, create, NULL, &bh);
  175. if (ret < 0)
  176. goto out_header;
  177. for (;;) {
  178. dofunc(sufile, *seg, header_bh, bh);
  179. if (++seg >= segnumv + nsegs)
  180. break;
  181. prev_blkoff = blkoff;
  182. blkoff = nilfs_sufile_get_blkoff(sufile, *seg);
  183. if (blkoff == prev_blkoff)
  184. continue;
  185. /* get different block */
  186. brelse(bh);
  187. ret = nilfs_mdt_get_block(sufile, blkoff, create, NULL, &bh);
  188. if (unlikely(ret < 0))
  189. goto out_header;
  190. }
  191. brelse(bh);
  192. out_header:
  193. n = seg - segnumv;
  194. brelse(header_bh);
  195. out_sem:
  196. up_write(&NILFS_MDT(sufile)->mi_sem);
  197. out:
  198. if (ndone)
  199. *ndone = n;
  200. return ret;
  201. }
  202. int nilfs_sufile_update(struct inode *sufile, __u64 segnum, int create,
  203. void (*dofunc)(struct inode *, __u64,
  204. struct buffer_head *,
  205. struct buffer_head *))
  206. {
  207. struct buffer_head *header_bh, *bh;
  208. int ret;
  209. if (unlikely(segnum >= nilfs_sufile_get_nsegments(sufile))) {
  210. nilfs_warn(sufile->i_sb, "%s: invalid segment number: %llu",
  211. __func__, (unsigned long long)segnum);
  212. return -EINVAL;
  213. }
  214. down_write(&NILFS_MDT(sufile)->mi_sem);
  215. ret = nilfs_sufile_get_header_block(sufile, &header_bh);
  216. if (ret < 0)
  217. goto out_sem;
  218. ret = nilfs_sufile_get_segment_usage_block(sufile, segnum, create, &bh);
  219. if (!ret) {
  220. dofunc(sufile, segnum, header_bh, bh);
  221. brelse(bh);
  222. }
  223. brelse(header_bh);
  224. out_sem:
  225. up_write(&NILFS_MDT(sufile)->mi_sem);
  226. return ret;
  227. }
  228. /**
  229. * nilfs_sufile_set_alloc_range - limit range of segment to be allocated
  230. * @sufile: inode of segment usage file
  231. * @start: minimum segment number of allocatable region (inclusive)
  232. * @end: maximum segment number of allocatable region (inclusive)
  233. *
  234. * Return Value: On success, 0 is returned. On error, one of the
  235. * following negative error codes is returned.
  236. *
  237. * %-ERANGE - invalid segment region
  238. */
  239. int nilfs_sufile_set_alloc_range(struct inode *sufile, __u64 start, __u64 end)
  240. {
  241. struct nilfs_sufile_info *sui = NILFS_SUI(sufile);
  242. __u64 nsegs;
  243. int ret = -ERANGE;
  244. down_write(&NILFS_MDT(sufile)->mi_sem);
  245. nsegs = nilfs_sufile_get_nsegments(sufile);
  246. if (start <= end && end < nsegs) {
  247. sui->allocmin = start;
  248. sui->allocmax = end;
  249. ret = 0;
  250. }
  251. up_write(&NILFS_MDT(sufile)->mi_sem);
  252. return ret;
  253. }
  254. /**
  255. * nilfs_sufile_alloc - allocate a segment
  256. * @sufile: inode of segment usage file
  257. * @segnump: pointer to segment number
  258. *
  259. * Description: nilfs_sufile_alloc() allocates a clean segment.
  260. *
  261. * Return Value: On success, 0 is returned and the segment number of the
  262. * allocated segment is stored in the place pointed by @segnump. On error, one
  263. * of the following negative error codes is returned.
  264. *
  265. * %-EIO - I/O error.
  266. *
  267. * %-ENOMEM - Insufficient amount of memory available.
  268. *
  269. * %-ENOSPC - No clean segment left.
  270. */
  271. int nilfs_sufile_alloc(struct inode *sufile, __u64 *segnump)
  272. {
  273. struct buffer_head *header_bh, *su_bh;
  274. struct nilfs_sufile_header *header;
  275. struct nilfs_segment_usage *su;
  276. struct nilfs_sufile_info *sui = NILFS_SUI(sufile);
  277. size_t susz = NILFS_MDT(sufile)->mi_entry_size;
  278. __u64 segnum, maxsegnum, last_alloc;
  279. void *kaddr;
  280. unsigned long nsegments, nsus, cnt;
  281. int ret, j;
  282. down_write(&NILFS_MDT(sufile)->mi_sem);
  283. ret = nilfs_sufile_get_header_block(sufile, &header_bh);
  284. if (ret < 0)
  285. goto out_sem;
  286. kaddr = kmap_local_page(header_bh->b_page);
  287. header = kaddr + bh_offset(header_bh);
  288. last_alloc = le64_to_cpu(header->sh_last_alloc);
  289. kunmap_local(kaddr);
  290. nsegments = nilfs_sufile_get_nsegments(sufile);
  291. maxsegnum = sui->allocmax;
  292. segnum = last_alloc + 1;
  293. if (segnum < sui->allocmin || segnum > sui->allocmax)
  294. segnum = sui->allocmin;
  295. for (cnt = 0; cnt < nsegments; cnt += nsus) {
  296. if (segnum > maxsegnum) {
  297. if (cnt < sui->allocmax - sui->allocmin + 1) {
  298. /*
  299. * wrap around in the limited region.
  300. * if allocation started from
  301. * sui->allocmin, this never happens.
  302. */
  303. segnum = sui->allocmin;
  304. maxsegnum = last_alloc;
  305. } else if (segnum > sui->allocmin &&
  306. sui->allocmax + 1 < nsegments) {
  307. segnum = sui->allocmax + 1;
  308. maxsegnum = nsegments - 1;
  309. } else if (sui->allocmin > 0) {
  310. segnum = 0;
  311. maxsegnum = sui->allocmin - 1;
  312. } else {
  313. break; /* never happens */
  314. }
  315. }
  316. trace_nilfs2_segment_usage_check(sufile, segnum, cnt);
  317. ret = nilfs_sufile_get_segment_usage_block(sufile, segnum, 1,
  318. &su_bh);
  319. if (ret < 0)
  320. goto out_header;
  321. kaddr = kmap_local_page(su_bh->b_page);
  322. su = nilfs_sufile_block_get_segment_usage(
  323. sufile, segnum, su_bh, kaddr);
  324. nsus = nilfs_sufile_segment_usages_in_block(
  325. sufile, segnum, maxsegnum);
  326. for (j = 0; j < nsus; j++, su = (void *)su + susz, segnum++) {
  327. if (!nilfs_segment_usage_clean(su))
  328. continue;
  329. /* found a clean segment */
  330. nilfs_segment_usage_set_dirty(su);
  331. kunmap_local(kaddr);
  332. kaddr = kmap_local_page(header_bh->b_page);
  333. header = kaddr + bh_offset(header_bh);
  334. le64_add_cpu(&header->sh_ncleansegs, -1);
  335. le64_add_cpu(&header->sh_ndirtysegs, 1);
  336. header->sh_last_alloc = cpu_to_le64(segnum);
  337. kunmap_local(kaddr);
  338. sui->ncleansegs--;
  339. mark_buffer_dirty(header_bh);
  340. mark_buffer_dirty(su_bh);
  341. nilfs_mdt_mark_dirty(sufile);
  342. brelse(su_bh);
  343. *segnump = segnum;
  344. trace_nilfs2_segment_usage_allocated(sufile, segnum);
  345. goto out_header;
  346. }
  347. kunmap_local(kaddr);
  348. brelse(su_bh);
  349. }
  350. /* no segments left */
  351. ret = -ENOSPC;
  352. out_header:
  353. brelse(header_bh);
  354. out_sem:
  355. up_write(&NILFS_MDT(sufile)->mi_sem);
  356. return ret;
  357. }
  358. void nilfs_sufile_do_cancel_free(struct inode *sufile, __u64 segnum,
  359. struct buffer_head *header_bh,
  360. struct buffer_head *su_bh)
  361. {
  362. struct nilfs_segment_usage *su;
  363. void *kaddr;
  364. kaddr = kmap_local_page(su_bh->b_page);
  365. su = nilfs_sufile_block_get_segment_usage(sufile, segnum, su_bh, kaddr);
  366. if (unlikely(!nilfs_segment_usage_clean(su))) {
  367. nilfs_warn(sufile->i_sb, "%s: segment %llu must be clean",
  368. __func__, (unsigned long long)segnum);
  369. kunmap_local(kaddr);
  370. return;
  371. }
  372. nilfs_segment_usage_set_dirty(su);
  373. kunmap_local(kaddr);
  374. nilfs_sufile_mod_counter(header_bh, -1, 1);
  375. NILFS_SUI(sufile)->ncleansegs--;
  376. mark_buffer_dirty(su_bh);
  377. nilfs_mdt_mark_dirty(sufile);
  378. }
  379. void nilfs_sufile_do_scrap(struct inode *sufile, __u64 segnum,
  380. struct buffer_head *header_bh,
  381. struct buffer_head *su_bh)
  382. {
  383. struct nilfs_segment_usage *su;
  384. void *kaddr;
  385. int clean, dirty;
  386. kaddr = kmap_local_page(su_bh->b_page);
  387. su = nilfs_sufile_block_get_segment_usage(sufile, segnum, su_bh, kaddr);
  388. if (su->su_flags == cpu_to_le32(BIT(NILFS_SEGMENT_USAGE_DIRTY)) &&
  389. su->su_nblocks == cpu_to_le32(0)) {
  390. kunmap_local(kaddr);
  391. return;
  392. }
  393. clean = nilfs_segment_usage_clean(su);
  394. dirty = nilfs_segment_usage_dirty(su);
  395. /* make the segment garbage */
  396. su->su_lastmod = cpu_to_le64(0);
  397. su->su_nblocks = cpu_to_le32(0);
  398. su->su_flags = cpu_to_le32(BIT(NILFS_SEGMENT_USAGE_DIRTY));
  399. kunmap_local(kaddr);
  400. nilfs_sufile_mod_counter(header_bh, clean ? (u64)-1 : 0, dirty ? 0 : 1);
  401. NILFS_SUI(sufile)->ncleansegs -= clean;
  402. mark_buffer_dirty(su_bh);
  403. nilfs_mdt_mark_dirty(sufile);
  404. }
  405. void nilfs_sufile_do_free(struct inode *sufile, __u64 segnum,
  406. struct buffer_head *header_bh,
  407. struct buffer_head *su_bh)
  408. {
  409. struct nilfs_segment_usage *su;
  410. void *kaddr;
  411. int sudirty;
  412. kaddr = kmap_local_page(su_bh->b_page);
  413. su = nilfs_sufile_block_get_segment_usage(sufile, segnum, su_bh, kaddr);
  414. if (nilfs_segment_usage_clean(su)) {
  415. nilfs_warn(sufile->i_sb, "%s: segment %llu is already clean",
  416. __func__, (unsigned long long)segnum);
  417. kunmap_local(kaddr);
  418. return;
  419. }
  420. if (unlikely(nilfs_segment_usage_error(su)))
  421. nilfs_warn(sufile->i_sb, "free segment %llu marked in error",
  422. (unsigned long long)segnum);
  423. sudirty = nilfs_segment_usage_dirty(su);
  424. if (unlikely(!sudirty))
  425. nilfs_warn(sufile->i_sb, "free unallocated segment %llu",
  426. (unsigned long long)segnum);
  427. nilfs_segment_usage_set_clean(su);
  428. kunmap_local(kaddr);
  429. mark_buffer_dirty(su_bh);
  430. nilfs_sufile_mod_counter(header_bh, 1, sudirty ? (u64)-1 : 0);
  431. NILFS_SUI(sufile)->ncleansegs++;
  432. nilfs_mdt_mark_dirty(sufile);
  433. trace_nilfs2_segment_usage_freed(sufile, segnum);
  434. }
  435. /**
  436. * nilfs_sufile_mark_dirty - mark the buffer having a segment usage dirty
  437. * @sufile: inode of segment usage file
  438. * @segnum: segment number
  439. */
  440. int nilfs_sufile_mark_dirty(struct inode *sufile, __u64 segnum)
  441. {
  442. struct buffer_head *bh;
  443. void *kaddr;
  444. struct nilfs_segment_usage *su;
  445. int ret;
  446. down_write(&NILFS_MDT(sufile)->mi_sem);
  447. ret = nilfs_sufile_get_segment_usage_block(sufile, segnum, 0, &bh);
  448. if (unlikely(ret)) {
  449. if (ret == -ENOENT) {
  450. nilfs_error(sufile->i_sb,
  451. "segment usage for segment %llu is unreadable due to a hole block",
  452. (unsigned long long)segnum);
  453. ret = -EIO;
  454. }
  455. goto out_sem;
  456. }
  457. kaddr = kmap_local_page(bh->b_page);
  458. su = nilfs_sufile_block_get_segment_usage(sufile, segnum, bh, kaddr);
  459. if (unlikely(nilfs_segment_usage_error(su))) {
  460. struct the_nilfs *nilfs = sufile->i_sb->s_fs_info;
  461. kunmap_local(kaddr);
  462. brelse(bh);
  463. if (nilfs_segment_is_active(nilfs, segnum)) {
  464. nilfs_error(sufile->i_sb,
  465. "active segment %llu is erroneous",
  466. (unsigned long long)segnum);
  467. } else {
  468. /*
  469. * Segments marked erroneous are never allocated by
  470. * nilfs_sufile_alloc(); only active segments, ie,
  471. * the segments indexed by ns_segnum or ns_nextnum,
  472. * can be erroneous here.
  473. */
  474. WARN_ON_ONCE(1);
  475. }
  476. ret = -EIO;
  477. } else {
  478. nilfs_segment_usage_set_dirty(su);
  479. kunmap_local(kaddr);
  480. mark_buffer_dirty(bh);
  481. nilfs_mdt_mark_dirty(sufile);
  482. brelse(bh);
  483. }
  484. out_sem:
  485. up_write(&NILFS_MDT(sufile)->mi_sem);
  486. return ret;
  487. }
  488. /**
  489. * nilfs_sufile_set_segment_usage - set usage of a segment
  490. * @sufile: inode of segment usage file
  491. * @segnum: segment number
  492. * @nblocks: number of live blocks in the segment
  493. * @modtime: modification time (option)
  494. */
  495. int nilfs_sufile_set_segment_usage(struct inode *sufile, __u64 segnum,
  496. unsigned long nblocks, time64_t modtime)
  497. {
  498. struct buffer_head *bh;
  499. struct nilfs_segment_usage *su;
  500. void *kaddr;
  501. int ret;
  502. down_write(&NILFS_MDT(sufile)->mi_sem);
  503. ret = nilfs_sufile_get_segment_usage_block(sufile, segnum, 0, &bh);
  504. if (ret < 0)
  505. goto out_sem;
  506. kaddr = kmap_local_page(bh->b_page);
  507. su = nilfs_sufile_block_get_segment_usage(sufile, segnum, bh, kaddr);
  508. if (modtime) {
  509. /*
  510. * Check segusage error and set su_lastmod only when updating
  511. * this entry with a valid timestamp, not for cancellation.
  512. */
  513. WARN_ON_ONCE(nilfs_segment_usage_error(su));
  514. su->su_lastmod = cpu_to_le64(modtime);
  515. }
  516. su->su_nblocks = cpu_to_le32(nblocks);
  517. kunmap_local(kaddr);
  518. mark_buffer_dirty(bh);
  519. nilfs_mdt_mark_dirty(sufile);
  520. brelse(bh);
  521. out_sem:
  522. up_write(&NILFS_MDT(sufile)->mi_sem);
  523. return ret;
  524. }
  525. /**
  526. * nilfs_sufile_get_stat - get segment usage statistics
  527. * @sufile: inode of segment usage file
  528. * @sustat: pointer to a structure of segment usage statistics
  529. *
  530. * Description: nilfs_sufile_get_stat() returns information about segment
  531. * usage.
  532. *
  533. * Return Value: On success, 0 is returned, and segment usage information is
  534. * stored in the place pointed by @sustat. On error, one of the following
  535. * negative error codes is returned.
  536. *
  537. * %-EIO - I/O error.
  538. *
  539. * %-ENOMEM - Insufficient amount of memory available.
  540. */
  541. int nilfs_sufile_get_stat(struct inode *sufile, struct nilfs_sustat *sustat)
  542. {
  543. struct buffer_head *header_bh;
  544. struct nilfs_sufile_header *header;
  545. struct the_nilfs *nilfs = sufile->i_sb->s_fs_info;
  546. void *kaddr;
  547. int ret;
  548. down_read(&NILFS_MDT(sufile)->mi_sem);
  549. ret = nilfs_sufile_get_header_block(sufile, &header_bh);
  550. if (ret < 0)
  551. goto out_sem;
  552. kaddr = kmap_local_page(header_bh->b_page);
  553. header = kaddr + bh_offset(header_bh);
  554. sustat->ss_nsegs = nilfs_sufile_get_nsegments(sufile);
  555. sustat->ss_ncleansegs = le64_to_cpu(header->sh_ncleansegs);
  556. sustat->ss_ndirtysegs = le64_to_cpu(header->sh_ndirtysegs);
  557. sustat->ss_ctime = nilfs->ns_ctime;
  558. sustat->ss_nongc_ctime = nilfs->ns_nongc_ctime;
  559. spin_lock(&nilfs->ns_last_segment_lock);
  560. sustat->ss_prot_seq = nilfs->ns_prot_seq;
  561. spin_unlock(&nilfs->ns_last_segment_lock);
  562. kunmap_local(kaddr);
  563. brelse(header_bh);
  564. out_sem:
  565. up_read(&NILFS_MDT(sufile)->mi_sem);
  566. return ret;
  567. }
  568. void nilfs_sufile_do_set_error(struct inode *sufile, __u64 segnum,
  569. struct buffer_head *header_bh,
  570. struct buffer_head *su_bh)
  571. {
  572. struct nilfs_segment_usage *su;
  573. void *kaddr;
  574. int suclean;
  575. kaddr = kmap_local_page(su_bh->b_page);
  576. su = nilfs_sufile_block_get_segment_usage(sufile, segnum, su_bh, kaddr);
  577. if (nilfs_segment_usage_error(su)) {
  578. kunmap_local(kaddr);
  579. return;
  580. }
  581. suclean = nilfs_segment_usage_clean(su);
  582. nilfs_segment_usage_set_error(su);
  583. kunmap_local(kaddr);
  584. if (suclean) {
  585. nilfs_sufile_mod_counter(header_bh, -1, 0);
  586. NILFS_SUI(sufile)->ncleansegs--;
  587. }
  588. mark_buffer_dirty(su_bh);
  589. nilfs_mdt_mark_dirty(sufile);
  590. }
  591. /**
  592. * nilfs_sufile_truncate_range - truncate range of segment array
  593. * @sufile: inode of segment usage file
  594. * @start: start segment number (inclusive)
  595. * @end: end segment number (inclusive)
  596. *
  597. * Return Value: On success, 0 is returned. On error, one of the
  598. * following negative error codes is returned.
  599. *
  600. * %-EIO - I/O error.
  601. *
  602. * %-ENOMEM - Insufficient amount of memory available.
  603. *
  604. * %-EINVAL - Invalid number of segments specified
  605. *
  606. * %-EBUSY - Dirty or active segments are present in the range
  607. */
  608. static int nilfs_sufile_truncate_range(struct inode *sufile,
  609. __u64 start, __u64 end)
  610. {
  611. struct the_nilfs *nilfs = sufile->i_sb->s_fs_info;
  612. struct buffer_head *header_bh;
  613. struct buffer_head *su_bh;
  614. struct nilfs_segment_usage *su, *su2;
  615. size_t susz = NILFS_MDT(sufile)->mi_entry_size;
  616. unsigned long segusages_per_block;
  617. unsigned long nsegs, ncleaned;
  618. __u64 segnum;
  619. void *kaddr;
  620. ssize_t n, nc;
  621. int ret;
  622. int j;
  623. nsegs = nilfs_sufile_get_nsegments(sufile);
  624. ret = -EINVAL;
  625. if (start > end || start >= nsegs)
  626. goto out;
  627. ret = nilfs_sufile_get_header_block(sufile, &header_bh);
  628. if (ret < 0)
  629. goto out;
  630. segusages_per_block = nilfs_sufile_segment_usages_per_block(sufile);
  631. ncleaned = 0;
  632. for (segnum = start; segnum <= end; segnum += n) {
  633. n = min_t(unsigned long,
  634. segusages_per_block -
  635. nilfs_sufile_get_offset(sufile, segnum),
  636. end - segnum + 1);
  637. ret = nilfs_sufile_get_segment_usage_block(sufile, segnum, 0,
  638. &su_bh);
  639. if (ret < 0) {
  640. if (ret != -ENOENT)
  641. goto out_header;
  642. /* hole */
  643. continue;
  644. }
  645. kaddr = kmap_local_page(su_bh->b_page);
  646. su = nilfs_sufile_block_get_segment_usage(
  647. sufile, segnum, su_bh, kaddr);
  648. su2 = su;
  649. for (j = 0; j < n; j++, su = (void *)su + susz) {
  650. if ((le32_to_cpu(su->su_flags) &
  651. ~BIT(NILFS_SEGMENT_USAGE_ERROR)) ||
  652. nilfs_segment_is_active(nilfs, segnum + j)) {
  653. ret = -EBUSY;
  654. kunmap_local(kaddr);
  655. brelse(su_bh);
  656. goto out_header;
  657. }
  658. }
  659. nc = 0;
  660. for (su = su2, j = 0; j < n; j++, su = (void *)su + susz) {
  661. if (nilfs_segment_usage_error(su)) {
  662. nilfs_segment_usage_set_clean(su);
  663. nc++;
  664. }
  665. }
  666. kunmap_local(kaddr);
  667. if (nc > 0) {
  668. mark_buffer_dirty(su_bh);
  669. ncleaned += nc;
  670. }
  671. brelse(su_bh);
  672. if (n == segusages_per_block) {
  673. /* make hole */
  674. nilfs_sufile_delete_segment_usage_block(sufile, segnum);
  675. }
  676. }
  677. ret = 0;
  678. out_header:
  679. if (ncleaned > 0) {
  680. NILFS_SUI(sufile)->ncleansegs += ncleaned;
  681. nilfs_sufile_mod_counter(header_bh, ncleaned, 0);
  682. nilfs_mdt_mark_dirty(sufile);
  683. }
  684. brelse(header_bh);
  685. out:
  686. return ret;
  687. }
  688. /**
  689. * nilfs_sufile_resize - resize segment array
  690. * @sufile: inode of segment usage file
  691. * @newnsegs: new number of segments
  692. *
  693. * Return Value: On success, 0 is returned. On error, one of the
  694. * following negative error codes is returned.
  695. *
  696. * %-EIO - I/O error.
  697. *
  698. * %-ENOMEM - Insufficient amount of memory available.
  699. *
  700. * %-ENOSPC - Enough free space is not left for shrinking
  701. *
  702. * %-EBUSY - Dirty or active segments exist in the region to be truncated
  703. */
  704. int nilfs_sufile_resize(struct inode *sufile, __u64 newnsegs)
  705. {
  706. struct the_nilfs *nilfs = sufile->i_sb->s_fs_info;
  707. struct buffer_head *header_bh;
  708. struct nilfs_sufile_header *header;
  709. struct nilfs_sufile_info *sui = NILFS_SUI(sufile);
  710. void *kaddr;
  711. unsigned long nsegs, nrsvsegs;
  712. int ret = 0;
  713. down_write(&NILFS_MDT(sufile)->mi_sem);
  714. nsegs = nilfs_sufile_get_nsegments(sufile);
  715. if (nsegs == newnsegs)
  716. goto out;
  717. ret = -ENOSPC;
  718. nrsvsegs = nilfs_nrsvsegs(nilfs, newnsegs);
  719. if (newnsegs < nsegs && nsegs - newnsegs + nrsvsegs > sui->ncleansegs)
  720. goto out;
  721. ret = nilfs_sufile_get_header_block(sufile, &header_bh);
  722. if (ret < 0)
  723. goto out;
  724. if (newnsegs > nsegs) {
  725. sui->ncleansegs += newnsegs - nsegs;
  726. } else /* newnsegs < nsegs */ {
  727. ret = nilfs_sufile_truncate_range(sufile, newnsegs, nsegs - 1);
  728. if (ret < 0)
  729. goto out_header;
  730. sui->ncleansegs -= nsegs - newnsegs;
  731. /*
  732. * If the sufile is successfully truncated, immediately adjust
  733. * the segment allocation space while locking the semaphore
  734. * "mi_sem" so that nilfs_sufile_alloc() never allocates
  735. * segments in the truncated space.
  736. */
  737. sui->allocmax = newnsegs - 1;
  738. sui->allocmin = 0;
  739. }
  740. kaddr = kmap_local_page(header_bh->b_page);
  741. header = kaddr + bh_offset(header_bh);
  742. header->sh_ncleansegs = cpu_to_le64(sui->ncleansegs);
  743. kunmap_local(kaddr);
  744. mark_buffer_dirty(header_bh);
  745. nilfs_mdt_mark_dirty(sufile);
  746. nilfs_set_nsegments(nilfs, newnsegs);
  747. out_header:
  748. brelse(header_bh);
  749. out:
  750. up_write(&NILFS_MDT(sufile)->mi_sem);
  751. return ret;
  752. }
  753. /**
  754. * nilfs_sufile_get_suinfo - get segment usage information
  755. * @sufile: inode of segment usage file
  756. * @segnum: segment number to start looking
  757. * @buf: array of suinfo
  758. * @sisz: byte size of suinfo
  759. * @nsi: size of suinfo array
  760. *
  761. * Return: Count of segment usage info items stored in the output buffer on
  762. * success, or the following negative error code on failure.
  763. * * %-EIO - I/O error (including metadata corruption).
  764. * * %-ENOMEM - Insufficient memory available.
  765. */
  766. ssize_t nilfs_sufile_get_suinfo(struct inode *sufile, __u64 segnum, void *buf,
  767. unsigned int sisz, size_t nsi)
  768. {
  769. struct buffer_head *su_bh;
  770. struct nilfs_segment_usage *su;
  771. struct nilfs_suinfo *si = buf;
  772. size_t susz = NILFS_MDT(sufile)->mi_entry_size;
  773. struct the_nilfs *nilfs = sufile->i_sb->s_fs_info;
  774. void *kaddr;
  775. unsigned long nsegs, segusages_per_block;
  776. ssize_t n;
  777. int ret, i, j;
  778. down_read(&NILFS_MDT(sufile)->mi_sem);
  779. segusages_per_block = nilfs_sufile_segment_usages_per_block(sufile);
  780. nsegs = min_t(unsigned long,
  781. nilfs_sufile_get_nsegments(sufile) - segnum,
  782. nsi);
  783. for (i = 0; i < nsegs; i += n, segnum += n) {
  784. n = min_t(unsigned long,
  785. segusages_per_block -
  786. nilfs_sufile_get_offset(sufile, segnum),
  787. nsegs - i);
  788. ret = nilfs_sufile_get_segment_usage_block(sufile, segnum, 0,
  789. &su_bh);
  790. if (ret < 0) {
  791. if (ret != -ENOENT)
  792. goto out;
  793. /* hole */
  794. memset(si, 0, sisz * n);
  795. si = (void *)si + sisz * n;
  796. continue;
  797. }
  798. kaddr = kmap_local_page(su_bh->b_page);
  799. su = nilfs_sufile_block_get_segment_usage(
  800. sufile, segnum, su_bh, kaddr);
  801. for (j = 0; j < n;
  802. j++, su = (void *)su + susz, si = (void *)si + sisz) {
  803. si->sui_lastmod = le64_to_cpu(su->su_lastmod);
  804. si->sui_nblocks = le32_to_cpu(su->su_nblocks);
  805. si->sui_flags = le32_to_cpu(su->su_flags) &
  806. ~BIT(NILFS_SEGMENT_USAGE_ACTIVE);
  807. if (nilfs_segment_is_active(nilfs, segnum + j))
  808. si->sui_flags |=
  809. BIT(NILFS_SEGMENT_USAGE_ACTIVE);
  810. }
  811. kunmap_local(kaddr);
  812. brelse(su_bh);
  813. }
  814. ret = nsegs;
  815. out:
  816. up_read(&NILFS_MDT(sufile)->mi_sem);
  817. return ret;
  818. }
  819. /**
  820. * nilfs_sufile_set_suinfo - sets segment usage info
  821. * @sufile: inode of segment usage file
  822. * @buf: array of suinfo_update
  823. * @supsz: byte size of suinfo_update
  824. * @nsup: size of suinfo_update array
  825. *
  826. * Description: Takes an array of nilfs_suinfo_update structs and updates
  827. * segment usage accordingly. Only the fields indicated by the sup_flags
  828. * are updated.
  829. *
  830. * Return Value: On success, 0 is returned. On error, one of the
  831. * following negative error codes is returned.
  832. *
  833. * %-EIO - I/O error.
  834. *
  835. * %-ENOMEM - Insufficient amount of memory available.
  836. *
  837. * %-EINVAL - Invalid values in input (segment number, flags or nblocks)
  838. */
  839. ssize_t nilfs_sufile_set_suinfo(struct inode *sufile, void *buf,
  840. unsigned int supsz, size_t nsup)
  841. {
  842. struct the_nilfs *nilfs = sufile->i_sb->s_fs_info;
  843. struct buffer_head *header_bh, *bh;
  844. struct nilfs_suinfo_update *sup, *supend = buf + supsz * nsup;
  845. struct nilfs_segment_usage *su;
  846. void *kaddr;
  847. unsigned long blkoff, prev_blkoff;
  848. int cleansi, cleansu, dirtysi, dirtysu;
  849. long ncleaned = 0, ndirtied = 0;
  850. int ret = 0;
  851. if (unlikely(nsup == 0))
  852. return ret;
  853. for (sup = buf; sup < supend; sup = (void *)sup + supsz) {
  854. if (sup->sup_segnum >= nilfs->ns_nsegments
  855. || (sup->sup_flags &
  856. (~0UL << __NR_NILFS_SUINFO_UPDATE_FIELDS))
  857. || (nilfs_suinfo_update_nblocks(sup) &&
  858. sup->sup_sui.sui_nblocks >
  859. nilfs->ns_blocks_per_segment))
  860. return -EINVAL;
  861. }
  862. down_write(&NILFS_MDT(sufile)->mi_sem);
  863. ret = nilfs_sufile_get_header_block(sufile, &header_bh);
  864. if (ret < 0)
  865. goto out_sem;
  866. sup = buf;
  867. blkoff = nilfs_sufile_get_blkoff(sufile, sup->sup_segnum);
  868. ret = nilfs_mdt_get_block(sufile, blkoff, 1, NULL, &bh);
  869. if (ret < 0)
  870. goto out_header;
  871. for (;;) {
  872. kaddr = kmap_local_page(bh->b_page);
  873. su = nilfs_sufile_block_get_segment_usage(
  874. sufile, sup->sup_segnum, bh, kaddr);
  875. if (nilfs_suinfo_update_lastmod(sup))
  876. su->su_lastmod = cpu_to_le64(sup->sup_sui.sui_lastmod);
  877. if (nilfs_suinfo_update_nblocks(sup))
  878. su->su_nblocks = cpu_to_le32(sup->sup_sui.sui_nblocks);
  879. if (nilfs_suinfo_update_flags(sup)) {
  880. /*
  881. * Active flag is a virtual flag projected by running
  882. * nilfs kernel code - drop it not to write it to
  883. * disk.
  884. */
  885. sup->sup_sui.sui_flags &=
  886. ~BIT(NILFS_SEGMENT_USAGE_ACTIVE);
  887. cleansi = nilfs_suinfo_clean(&sup->sup_sui);
  888. cleansu = nilfs_segment_usage_clean(su);
  889. dirtysi = nilfs_suinfo_dirty(&sup->sup_sui);
  890. dirtysu = nilfs_segment_usage_dirty(su);
  891. if (cleansi && !cleansu)
  892. ++ncleaned;
  893. else if (!cleansi && cleansu)
  894. --ncleaned;
  895. if (dirtysi && !dirtysu)
  896. ++ndirtied;
  897. else if (!dirtysi && dirtysu)
  898. --ndirtied;
  899. su->su_flags = cpu_to_le32(sup->sup_sui.sui_flags);
  900. }
  901. kunmap_local(kaddr);
  902. sup = (void *)sup + supsz;
  903. if (sup >= supend)
  904. break;
  905. prev_blkoff = blkoff;
  906. blkoff = nilfs_sufile_get_blkoff(sufile, sup->sup_segnum);
  907. if (blkoff == prev_blkoff)
  908. continue;
  909. /* get different block */
  910. mark_buffer_dirty(bh);
  911. put_bh(bh);
  912. ret = nilfs_mdt_get_block(sufile, blkoff, 1, NULL, &bh);
  913. if (unlikely(ret < 0))
  914. goto out_mark;
  915. }
  916. mark_buffer_dirty(bh);
  917. put_bh(bh);
  918. out_mark:
  919. if (ncleaned || ndirtied) {
  920. nilfs_sufile_mod_counter(header_bh, (u64)ncleaned,
  921. (u64)ndirtied);
  922. NILFS_SUI(sufile)->ncleansegs += ncleaned;
  923. }
  924. nilfs_mdt_mark_dirty(sufile);
  925. out_header:
  926. put_bh(header_bh);
  927. out_sem:
  928. up_write(&NILFS_MDT(sufile)->mi_sem);
  929. return ret;
  930. }
  931. /**
  932. * nilfs_sufile_trim_fs() - trim ioctl handle function
  933. * @sufile: inode of segment usage file
  934. * @range: fstrim_range structure
  935. *
  936. * start: First Byte to trim
  937. * len: number of Bytes to trim from start
  938. * minlen: minimum extent length in Bytes
  939. *
  940. * Decription: nilfs_sufile_trim_fs goes through all segments containing bytes
  941. * from start to start+len. start is rounded up to the next block boundary
  942. * and start+len is rounded down. For each clean segment blkdev_issue_discard
  943. * function is invoked.
  944. *
  945. * Return Value: On success, 0 is returned or negative error code, otherwise.
  946. */
  947. int nilfs_sufile_trim_fs(struct inode *sufile, struct fstrim_range *range)
  948. {
  949. struct the_nilfs *nilfs = sufile->i_sb->s_fs_info;
  950. struct buffer_head *su_bh;
  951. struct nilfs_segment_usage *su;
  952. void *kaddr;
  953. size_t n, i, susz = NILFS_MDT(sufile)->mi_entry_size;
  954. sector_t seg_start, seg_end, start_block, end_block;
  955. sector_t start = 0, nblocks = 0;
  956. u64 segnum, segnum_end, minlen, len, max_blocks, ndiscarded = 0;
  957. int ret = 0;
  958. unsigned int sects_per_block;
  959. sects_per_block = (1 << nilfs->ns_blocksize_bits) /
  960. bdev_logical_block_size(nilfs->ns_bdev);
  961. len = range->len >> nilfs->ns_blocksize_bits;
  962. minlen = range->minlen >> nilfs->ns_blocksize_bits;
  963. max_blocks = ((u64)nilfs->ns_nsegments * nilfs->ns_blocks_per_segment);
  964. if (!len || range->start >= max_blocks << nilfs->ns_blocksize_bits)
  965. return -EINVAL;
  966. start_block = (range->start + nilfs->ns_blocksize - 1) >>
  967. nilfs->ns_blocksize_bits;
  968. /*
  969. * range->len can be very large (actually, it is set to
  970. * ULLONG_MAX by default) - truncate upper end of the range
  971. * carefully so as not to overflow.
  972. */
  973. if (max_blocks - start_block < len)
  974. end_block = max_blocks - 1;
  975. else
  976. end_block = start_block + len - 1;
  977. segnum = nilfs_get_segnum_of_block(nilfs, start_block);
  978. segnum_end = nilfs_get_segnum_of_block(nilfs, end_block);
  979. down_read(&NILFS_MDT(sufile)->mi_sem);
  980. while (segnum <= segnum_end) {
  981. n = nilfs_sufile_segment_usages_in_block(sufile, segnum,
  982. segnum_end);
  983. ret = nilfs_sufile_get_segment_usage_block(sufile, segnum, 0,
  984. &su_bh);
  985. if (ret < 0) {
  986. if (ret != -ENOENT)
  987. goto out_sem;
  988. /* hole */
  989. segnum += n;
  990. continue;
  991. }
  992. kaddr = kmap_local_page(su_bh->b_page);
  993. su = nilfs_sufile_block_get_segment_usage(sufile, segnum,
  994. su_bh, kaddr);
  995. for (i = 0; i < n; ++i, ++segnum, su = (void *)su + susz) {
  996. if (!nilfs_segment_usage_clean(su))
  997. continue;
  998. nilfs_get_segment_range(nilfs, segnum, &seg_start,
  999. &seg_end);
  1000. if (!nblocks) {
  1001. /* start new extent */
  1002. start = seg_start;
  1003. nblocks = seg_end - seg_start + 1;
  1004. continue;
  1005. }
  1006. if (start + nblocks == seg_start) {
  1007. /* add to previous extent */
  1008. nblocks += seg_end - seg_start + 1;
  1009. continue;
  1010. }
  1011. /* discard previous extent */
  1012. if (start < start_block) {
  1013. nblocks -= start_block - start;
  1014. start = start_block;
  1015. }
  1016. if (nblocks >= minlen) {
  1017. kunmap_local(kaddr);
  1018. ret = blkdev_issue_discard(nilfs->ns_bdev,
  1019. start * sects_per_block,
  1020. nblocks * sects_per_block,
  1021. GFP_NOFS);
  1022. if (ret < 0) {
  1023. put_bh(su_bh);
  1024. goto out_sem;
  1025. }
  1026. ndiscarded += nblocks;
  1027. kaddr = kmap_local_page(su_bh->b_page);
  1028. su = nilfs_sufile_block_get_segment_usage(
  1029. sufile, segnum, su_bh, kaddr);
  1030. }
  1031. /* start new extent */
  1032. start = seg_start;
  1033. nblocks = seg_end - seg_start + 1;
  1034. }
  1035. kunmap_local(kaddr);
  1036. put_bh(su_bh);
  1037. }
  1038. if (nblocks) {
  1039. /* discard last extent */
  1040. if (start < start_block) {
  1041. nblocks -= start_block - start;
  1042. start = start_block;
  1043. }
  1044. if (start + nblocks > end_block + 1)
  1045. nblocks = end_block - start + 1;
  1046. if (nblocks >= minlen) {
  1047. ret = blkdev_issue_discard(nilfs->ns_bdev,
  1048. start * sects_per_block,
  1049. nblocks * sects_per_block,
  1050. GFP_NOFS);
  1051. if (!ret)
  1052. ndiscarded += nblocks;
  1053. }
  1054. }
  1055. out_sem:
  1056. up_read(&NILFS_MDT(sufile)->mi_sem);
  1057. range->len = ndiscarded << nilfs->ns_blocksize_bits;
  1058. return ret;
  1059. }
  1060. /**
  1061. * nilfs_sufile_read - read or get sufile inode
  1062. * @sb: super block instance
  1063. * @susize: size of a segment usage entry
  1064. * @raw_inode: on-disk sufile inode
  1065. * @inodep: buffer to store the inode
  1066. */
  1067. int nilfs_sufile_read(struct super_block *sb, size_t susize,
  1068. struct nilfs_inode *raw_inode, struct inode **inodep)
  1069. {
  1070. struct inode *sufile;
  1071. struct nilfs_sufile_info *sui;
  1072. struct buffer_head *header_bh;
  1073. struct nilfs_sufile_header *header;
  1074. void *kaddr;
  1075. int err;
  1076. if (susize > sb->s_blocksize) {
  1077. nilfs_err(sb, "too large segment usage size: %zu bytes",
  1078. susize);
  1079. return -EINVAL;
  1080. } else if (susize < NILFS_MIN_SEGMENT_USAGE_SIZE) {
  1081. nilfs_err(sb, "too small segment usage size: %zu bytes",
  1082. susize);
  1083. return -EINVAL;
  1084. }
  1085. sufile = nilfs_iget_locked(sb, NULL, NILFS_SUFILE_INO);
  1086. if (unlikely(!sufile))
  1087. return -ENOMEM;
  1088. if (!(sufile->i_state & I_NEW))
  1089. goto out;
  1090. err = nilfs_mdt_init(sufile, NILFS_MDT_GFP, sizeof(*sui));
  1091. if (err)
  1092. goto failed;
  1093. nilfs_mdt_set_entry_size(sufile, susize,
  1094. sizeof(struct nilfs_sufile_header));
  1095. err = nilfs_read_inode_common(sufile, raw_inode);
  1096. if (err)
  1097. goto failed;
  1098. err = nilfs_mdt_get_block(sufile, 0, 0, NULL, &header_bh);
  1099. if (unlikely(err)) {
  1100. if (err == -ENOENT) {
  1101. nilfs_err(sb,
  1102. "missing header block in segment usage metadata");
  1103. err = -EINVAL;
  1104. }
  1105. goto failed;
  1106. }
  1107. sui = NILFS_SUI(sufile);
  1108. kaddr = kmap_local_page(header_bh->b_page);
  1109. header = kaddr + bh_offset(header_bh);
  1110. sui->ncleansegs = le64_to_cpu(header->sh_ncleansegs);
  1111. kunmap_local(kaddr);
  1112. brelse(header_bh);
  1113. sui->allocmax = nilfs_sufile_get_nsegments(sufile) - 1;
  1114. sui->allocmin = 0;
  1115. unlock_new_inode(sufile);
  1116. out:
  1117. *inodep = sufile;
  1118. return 0;
  1119. failed:
  1120. iget_failed(sufile);
  1121. return err;
  1122. }