sufile.c 18 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659
  1. /*
  2. * sufile.c - NILFS segment usage file.
  3. *
  4. * Copyright (C) 2006-2008 Nippon Telegraph and Telephone Corporation.
  5. *
  6. * This program is free software; you can redistribute it and/or modify
  7. * it under the terms of the GNU General Public License as published by
  8. * the Free Software Foundation; either version 2 of the License, or
  9. * (at your option) any later version.
  10. *
  11. * This program is distributed in the hope that it will be useful,
  12. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  13. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  14. * GNU General Public License for more details.
  15. *
  16. * You should have received a copy of the GNU General Public License
  17. * along with this program; if not, write to the Free Software
  18. * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
  19. *
  20. * Written by Koji Sato <koji@osrg.net>.
  21. * Rivised by Ryusuke Konishi <ryusuke@osrg.net>.
  22. */
  23. #include <linux/kernel.h>
  24. #include <linux/fs.h>
  25. #include <linux/string.h>
  26. #include <linux/buffer_head.h>
  27. #include <linux/errno.h>
  28. #include <linux/nilfs2_fs.h>
  29. #include "mdt.h"
  30. #include "sufile.h"
  31. static inline unsigned long
  32. nilfs_sufile_segment_usages_per_block(const struct inode *sufile)
  33. {
  34. return NILFS_MDT(sufile)->mi_entries_per_block;
  35. }
  36. static unsigned long
  37. nilfs_sufile_get_blkoff(const struct inode *sufile, __u64 segnum)
  38. {
  39. __u64 t = segnum + NILFS_MDT(sufile)->mi_first_entry_offset;
  40. do_div(t, nilfs_sufile_segment_usages_per_block(sufile));
  41. return (unsigned long)t;
  42. }
  43. static unsigned long
  44. nilfs_sufile_get_offset(const struct inode *sufile, __u64 segnum)
  45. {
  46. __u64 t = segnum + NILFS_MDT(sufile)->mi_first_entry_offset;
  47. return do_div(t, nilfs_sufile_segment_usages_per_block(sufile));
  48. }
  49. static unsigned long
  50. nilfs_sufile_segment_usages_in_block(const struct inode *sufile, __u64 curr,
  51. __u64 max)
  52. {
  53. return min_t(unsigned long,
  54. nilfs_sufile_segment_usages_per_block(sufile) -
  55. nilfs_sufile_get_offset(sufile, curr),
  56. max - curr + 1);
  57. }
  58. static inline struct nilfs_sufile_header *
  59. nilfs_sufile_block_get_header(const struct inode *sufile,
  60. struct buffer_head *bh,
  61. void *kaddr)
  62. {
  63. return kaddr + bh_offset(bh);
  64. }
  65. static struct nilfs_segment_usage *
  66. nilfs_sufile_block_get_segment_usage(const struct inode *sufile, __u64 segnum,
  67. struct buffer_head *bh, void *kaddr)
  68. {
  69. return kaddr + bh_offset(bh) +
  70. nilfs_sufile_get_offset(sufile, segnum) *
  71. NILFS_MDT(sufile)->mi_entry_size;
  72. }
  73. static inline int nilfs_sufile_get_header_block(struct inode *sufile,
  74. struct buffer_head **bhp)
  75. {
  76. return nilfs_mdt_get_block(sufile, 0, 0, NULL, bhp);
  77. }
  78. static inline int
  79. nilfs_sufile_get_segment_usage_block(struct inode *sufile, __u64 segnum,
  80. int create, struct buffer_head **bhp)
  81. {
  82. return nilfs_mdt_get_block(sufile,
  83. nilfs_sufile_get_blkoff(sufile, segnum),
  84. create, NULL, bhp);
  85. }
  86. static void nilfs_sufile_mod_counter(struct buffer_head *header_bh,
  87. u64 ncleanadd, u64 ndirtyadd)
  88. {
  89. struct nilfs_sufile_header *header;
  90. void *kaddr;
  91. kaddr = kmap_atomic(header_bh->b_page, KM_USER0);
  92. header = kaddr + bh_offset(header_bh);
  93. le64_add_cpu(&header->sh_ncleansegs, ncleanadd);
  94. le64_add_cpu(&header->sh_ndirtysegs, ndirtyadd);
  95. kunmap_atomic(kaddr, KM_USER0);
  96. nilfs_mdt_mark_buffer_dirty(header_bh);
  97. }
  98. /**
  99. * nilfs_sufile_updatev - modify multiple segment usages at a time
  100. * @sufile: inode of segment usage file
  101. * @segnumv: array of segment numbers
  102. * @nsegs: size of @segnumv array
  103. * @create: creation flag
  104. * @ndone: place to store number of modified segments on @segnumv
  105. * @dofunc: primitive operation for the update
  106. *
  107. * Description: nilfs_sufile_updatev() repeatedly calls @dofunc
  108. * against the given array of segments. The @dofunc is called with
  109. * buffers of a header block and the sufile block in which the target
  110. * segment usage entry is contained. If @ndone is given, the number
  111. * of successfully modified segments from the head is stored in the
  112. * place @ndone points to.
  113. *
  114. * Return Value: On success, zero is returned. On error, one of the
  115. * following negative error codes is returned.
  116. *
  117. * %-EIO - I/O error.
  118. *
  119. * %-ENOMEM - Insufficient amount of memory available.
  120. *
  121. * %-ENOENT - Given segment usage is in hole block (may be returned if
  122. * @create is zero)
  123. *
  124. * %-EINVAL - Invalid segment usage number
  125. */
  126. int nilfs_sufile_updatev(struct inode *sufile, __u64 *segnumv, size_t nsegs,
  127. int create, size_t *ndone,
  128. void (*dofunc)(struct inode *, __u64,
  129. struct buffer_head *,
  130. struct buffer_head *))
  131. {
  132. struct buffer_head *header_bh, *bh;
  133. unsigned long blkoff, prev_blkoff;
  134. __u64 *seg;
  135. size_t nerr = 0, n = 0;
  136. int ret = 0;
  137. if (unlikely(nsegs == 0))
  138. goto out;
  139. down_write(&NILFS_MDT(sufile)->mi_sem);
  140. for (seg = segnumv; seg < segnumv + nsegs; seg++) {
  141. if (unlikely(*seg >= nilfs_sufile_get_nsegments(sufile))) {
  142. printk(KERN_WARNING
  143. "%s: invalid segment number: %llu\n", __func__,
  144. (unsigned long long)*seg);
  145. nerr++;
  146. }
  147. }
  148. if (nerr > 0) {
  149. ret = -EINVAL;
  150. goto out_sem;
  151. }
  152. ret = nilfs_sufile_get_header_block(sufile, &header_bh);
  153. if (ret < 0)
  154. goto out_sem;
  155. seg = segnumv;
  156. blkoff = nilfs_sufile_get_blkoff(sufile, *seg);
  157. ret = nilfs_mdt_get_block(sufile, blkoff, create, NULL, &bh);
  158. if (ret < 0)
  159. goto out_header;
  160. for (;;) {
  161. dofunc(sufile, *seg, header_bh, bh);
  162. if (++seg >= segnumv + nsegs)
  163. break;
  164. prev_blkoff = blkoff;
  165. blkoff = nilfs_sufile_get_blkoff(sufile, *seg);
  166. if (blkoff == prev_blkoff)
  167. continue;
  168. /* get different block */
  169. brelse(bh);
  170. ret = nilfs_mdt_get_block(sufile, blkoff, create, NULL, &bh);
  171. if (unlikely(ret < 0))
  172. goto out_header;
  173. }
  174. brelse(bh);
  175. out_header:
  176. n = seg - segnumv;
  177. brelse(header_bh);
  178. out_sem:
  179. up_write(&NILFS_MDT(sufile)->mi_sem);
  180. out:
  181. if (ndone)
  182. *ndone = n;
  183. return ret;
  184. }
  185. int nilfs_sufile_update(struct inode *sufile, __u64 segnum, int create,
  186. void (*dofunc)(struct inode *, __u64,
  187. struct buffer_head *,
  188. struct buffer_head *))
  189. {
  190. struct buffer_head *header_bh, *bh;
  191. int ret;
  192. if (unlikely(segnum >= nilfs_sufile_get_nsegments(sufile))) {
  193. printk(KERN_WARNING "%s: invalid segment number: %llu\n",
  194. __func__, (unsigned long long)segnum);
  195. return -EINVAL;
  196. }
  197. down_write(&NILFS_MDT(sufile)->mi_sem);
  198. ret = nilfs_sufile_get_header_block(sufile, &header_bh);
  199. if (ret < 0)
  200. goto out_sem;
  201. ret = nilfs_sufile_get_segment_usage_block(sufile, segnum, create, &bh);
  202. if (!ret) {
  203. dofunc(sufile, segnum, header_bh, bh);
  204. brelse(bh);
  205. }
  206. brelse(header_bh);
  207. out_sem:
  208. up_write(&NILFS_MDT(sufile)->mi_sem);
  209. return ret;
  210. }
  211. /**
  212. * nilfs_sufile_alloc - allocate a segment
  213. * @sufile: inode of segment usage file
  214. * @segnump: pointer to segment number
  215. *
  216. * Description: nilfs_sufile_alloc() allocates a clean segment.
  217. *
  218. * Return Value: On success, 0 is returned and the segment number of the
  219. * allocated segment is stored in the place pointed by @segnump. On error, one
  220. * of the following negative error codes is returned.
  221. *
  222. * %-EIO - I/O error.
  223. *
  224. * %-ENOMEM - Insufficient amount of memory available.
  225. *
  226. * %-ENOSPC - No clean segment left.
  227. */
  228. int nilfs_sufile_alloc(struct inode *sufile, __u64 *segnump)
  229. {
  230. struct buffer_head *header_bh, *su_bh;
  231. struct nilfs_sufile_header *header;
  232. struct nilfs_segment_usage *su;
  233. size_t susz = NILFS_MDT(sufile)->mi_entry_size;
  234. __u64 segnum, maxsegnum, last_alloc;
  235. void *kaddr;
  236. unsigned long nsegments, ncleansegs, nsus;
  237. int ret, i, j;
  238. down_write(&NILFS_MDT(sufile)->mi_sem);
  239. ret = nilfs_sufile_get_header_block(sufile, &header_bh);
  240. if (ret < 0)
  241. goto out_sem;
  242. kaddr = kmap_atomic(header_bh->b_page, KM_USER0);
  243. header = nilfs_sufile_block_get_header(sufile, header_bh, kaddr);
  244. ncleansegs = le64_to_cpu(header->sh_ncleansegs);
  245. last_alloc = le64_to_cpu(header->sh_last_alloc);
  246. kunmap_atomic(kaddr, KM_USER0);
  247. nsegments = nilfs_sufile_get_nsegments(sufile);
  248. segnum = last_alloc + 1;
  249. maxsegnum = nsegments - 1;
  250. for (i = 0; i < nsegments; i += nsus) {
  251. if (segnum >= nsegments) {
  252. /* wrap around */
  253. segnum = 0;
  254. maxsegnum = last_alloc;
  255. }
  256. ret = nilfs_sufile_get_segment_usage_block(sufile, segnum, 1,
  257. &su_bh);
  258. if (ret < 0)
  259. goto out_header;
  260. kaddr = kmap_atomic(su_bh->b_page, KM_USER0);
  261. su = nilfs_sufile_block_get_segment_usage(
  262. sufile, segnum, su_bh, kaddr);
  263. nsus = nilfs_sufile_segment_usages_in_block(
  264. sufile, segnum, maxsegnum);
  265. for (j = 0; j < nsus; j++, su = (void *)su + susz, segnum++) {
  266. if (!nilfs_segment_usage_clean(su))
  267. continue;
  268. /* found a clean segment */
  269. nilfs_segment_usage_set_dirty(su);
  270. kunmap_atomic(kaddr, KM_USER0);
  271. kaddr = kmap_atomic(header_bh->b_page, KM_USER0);
  272. header = nilfs_sufile_block_get_header(
  273. sufile, header_bh, kaddr);
  274. le64_add_cpu(&header->sh_ncleansegs, -1);
  275. le64_add_cpu(&header->sh_ndirtysegs, 1);
  276. header->sh_last_alloc = cpu_to_le64(segnum);
  277. kunmap_atomic(kaddr, KM_USER0);
  278. nilfs_mdt_mark_buffer_dirty(header_bh);
  279. nilfs_mdt_mark_buffer_dirty(su_bh);
  280. nilfs_mdt_mark_dirty(sufile);
  281. brelse(su_bh);
  282. *segnump = segnum;
  283. goto out_header;
  284. }
  285. kunmap_atomic(kaddr, KM_USER0);
  286. brelse(su_bh);
  287. }
  288. /* no segments left */
  289. ret = -ENOSPC;
  290. out_header:
  291. brelse(header_bh);
  292. out_sem:
  293. up_write(&NILFS_MDT(sufile)->mi_sem);
  294. return ret;
  295. }
  296. void nilfs_sufile_do_cancel_free(struct inode *sufile, __u64 segnum,
  297. struct buffer_head *header_bh,
  298. struct buffer_head *su_bh)
  299. {
  300. struct nilfs_segment_usage *su;
  301. void *kaddr;
  302. kaddr = kmap_atomic(su_bh->b_page, KM_USER0);
  303. su = nilfs_sufile_block_get_segment_usage(sufile, segnum, su_bh, kaddr);
  304. if (unlikely(!nilfs_segment_usage_clean(su))) {
  305. printk(KERN_WARNING "%s: segment %llu must be clean\n",
  306. __func__, (unsigned long long)segnum);
  307. kunmap_atomic(kaddr, KM_USER0);
  308. return;
  309. }
  310. nilfs_segment_usage_set_dirty(su);
  311. kunmap_atomic(kaddr, KM_USER0);
  312. nilfs_sufile_mod_counter(header_bh, -1, 1);
  313. nilfs_mdt_mark_buffer_dirty(su_bh);
  314. nilfs_mdt_mark_dirty(sufile);
  315. }
  316. void nilfs_sufile_do_scrap(struct inode *sufile, __u64 segnum,
  317. struct buffer_head *header_bh,
  318. struct buffer_head *su_bh)
  319. {
  320. struct nilfs_segment_usage *su;
  321. void *kaddr;
  322. int clean, dirty;
  323. kaddr = kmap_atomic(su_bh->b_page, KM_USER0);
  324. su = nilfs_sufile_block_get_segment_usage(sufile, segnum, su_bh, kaddr);
  325. if (su->su_flags == cpu_to_le32(1UL << NILFS_SEGMENT_USAGE_DIRTY) &&
  326. su->su_nblocks == cpu_to_le32(0)) {
  327. kunmap_atomic(kaddr, KM_USER0);
  328. return;
  329. }
  330. clean = nilfs_segment_usage_clean(su);
  331. dirty = nilfs_segment_usage_dirty(su);
  332. /* make the segment garbage */
  333. su->su_lastmod = cpu_to_le64(0);
  334. su->su_nblocks = cpu_to_le32(0);
  335. su->su_flags = cpu_to_le32(1UL << NILFS_SEGMENT_USAGE_DIRTY);
  336. kunmap_atomic(kaddr, KM_USER0);
  337. nilfs_sufile_mod_counter(header_bh, clean ? (u64)-1 : 0, dirty ? 0 : 1);
  338. nilfs_mdt_mark_buffer_dirty(su_bh);
  339. nilfs_mdt_mark_dirty(sufile);
  340. }
  341. void nilfs_sufile_do_free(struct inode *sufile, __u64 segnum,
  342. struct buffer_head *header_bh,
  343. struct buffer_head *su_bh)
  344. {
  345. struct nilfs_segment_usage *su;
  346. void *kaddr;
  347. int sudirty;
  348. kaddr = kmap_atomic(su_bh->b_page, KM_USER0);
  349. su = nilfs_sufile_block_get_segment_usage(sufile, segnum, su_bh, kaddr);
  350. if (nilfs_segment_usage_clean(su)) {
  351. printk(KERN_WARNING "%s: segment %llu is already clean\n",
  352. __func__, (unsigned long long)segnum);
  353. kunmap_atomic(kaddr, KM_USER0);
  354. return;
  355. }
  356. WARN_ON(nilfs_segment_usage_error(su));
  357. WARN_ON(!nilfs_segment_usage_dirty(su));
  358. sudirty = nilfs_segment_usage_dirty(su);
  359. nilfs_segment_usage_set_clean(su);
  360. kunmap_atomic(kaddr, KM_USER0);
  361. nilfs_mdt_mark_buffer_dirty(su_bh);
  362. nilfs_sufile_mod_counter(header_bh, 1, sudirty ? (u64)-1 : 0);
  363. nilfs_mdt_mark_dirty(sufile);
  364. }
  365. /**
  366. * nilfs_sufile_get_segment_usage - get a segment usage
  367. * @sufile: inode of segment usage file
  368. * @segnum: segment number
  369. * @sup: pointer to segment usage
  370. * @bhp: pointer to buffer head
  371. *
  372. * Description: nilfs_sufile_get_segment_usage() acquires the segment usage
  373. * specified by @segnum.
  374. *
  375. * Return Value: On success, 0 is returned, and the segment usage and the
  376. * buffer head of the buffer on which the segment usage is located are stored
  377. * in the place pointed by @sup and @bhp, respectively. On error, one of the
  378. * following negative error codes is returned.
  379. *
  380. * %-EIO - I/O error.
  381. *
  382. * %-ENOMEM - Insufficient amount of memory available.
  383. *
  384. * %-EINVAL - Invalid segment usage number.
  385. */
  386. int nilfs_sufile_get_segment_usage(struct inode *sufile, __u64 segnum,
  387. struct nilfs_segment_usage **sup,
  388. struct buffer_head **bhp)
  389. {
  390. struct buffer_head *bh;
  391. struct nilfs_segment_usage *su;
  392. void *kaddr;
  393. int ret;
  394. /* segnum is 0 origin */
  395. if (segnum >= nilfs_sufile_get_nsegments(sufile))
  396. return -EINVAL;
  397. down_write(&NILFS_MDT(sufile)->mi_sem);
  398. ret = nilfs_sufile_get_segment_usage_block(sufile, segnum, 1, &bh);
  399. if (ret < 0)
  400. goto out_sem;
  401. kaddr = kmap(bh->b_page);
  402. su = nilfs_sufile_block_get_segment_usage(sufile, segnum, bh, kaddr);
  403. if (nilfs_segment_usage_error(su)) {
  404. kunmap(bh->b_page);
  405. brelse(bh);
  406. ret = -EINVAL;
  407. goto out_sem;
  408. }
  409. if (sup != NULL)
  410. *sup = su;
  411. *bhp = bh;
  412. out_sem:
  413. up_write(&NILFS_MDT(sufile)->mi_sem);
  414. return ret;
  415. }
  416. /**
  417. * nilfs_sufile_put_segment_usage - put a segment usage
  418. * @sufile: inode of segment usage file
  419. * @segnum: segment number
  420. * @bh: buffer head
  421. *
  422. * Description: nilfs_sufile_put_segment_usage() releases the segment usage
  423. * specified by @segnum. @bh must be the buffer head which have been returned
  424. * by a previous call to nilfs_sufile_get_segment_usage() with @segnum.
  425. */
  426. void nilfs_sufile_put_segment_usage(struct inode *sufile, __u64 segnum,
  427. struct buffer_head *bh)
  428. {
  429. kunmap(bh->b_page);
  430. brelse(bh);
  431. }
  432. /**
  433. * nilfs_sufile_get_stat - get segment usage statistics
  434. * @sufile: inode of segment usage file
  435. * @stat: pointer to a structure of segment usage statistics
  436. *
  437. * Description: nilfs_sufile_get_stat() returns information about segment
  438. * usage.
  439. *
  440. * Return Value: On success, 0 is returned, and segment usage information is
  441. * stored in the place pointed by @stat. On error, one of the following
  442. * negative error codes is returned.
  443. *
  444. * %-EIO - I/O error.
  445. *
  446. * %-ENOMEM - Insufficient amount of memory available.
  447. */
  448. int nilfs_sufile_get_stat(struct inode *sufile, struct nilfs_sustat *sustat)
  449. {
  450. struct buffer_head *header_bh;
  451. struct nilfs_sufile_header *header;
  452. struct the_nilfs *nilfs = NILFS_MDT(sufile)->mi_nilfs;
  453. void *kaddr;
  454. int ret;
  455. down_read(&NILFS_MDT(sufile)->mi_sem);
  456. ret = nilfs_sufile_get_header_block(sufile, &header_bh);
  457. if (ret < 0)
  458. goto out_sem;
  459. kaddr = kmap_atomic(header_bh->b_page, KM_USER0);
  460. header = nilfs_sufile_block_get_header(sufile, header_bh, kaddr);
  461. sustat->ss_nsegs = nilfs_sufile_get_nsegments(sufile);
  462. sustat->ss_ncleansegs = le64_to_cpu(header->sh_ncleansegs);
  463. sustat->ss_ndirtysegs = le64_to_cpu(header->sh_ndirtysegs);
  464. sustat->ss_ctime = nilfs->ns_ctime;
  465. sustat->ss_nongc_ctime = nilfs->ns_nongc_ctime;
  466. spin_lock(&nilfs->ns_last_segment_lock);
  467. sustat->ss_prot_seq = nilfs->ns_prot_seq;
  468. spin_unlock(&nilfs->ns_last_segment_lock);
  469. kunmap_atomic(kaddr, KM_USER0);
  470. brelse(header_bh);
  471. out_sem:
  472. up_read(&NILFS_MDT(sufile)->mi_sem);
  473. return ret;
  474. }
  475. /**
  476. * nilfs_sufile_get_ncleansegs - get the number of clean segments
  477. * @sufile: inode of segment usage file
  478. * @nsegsp: pointer to the number of clean segments
  479. *
  480. * Description: nilfs_sufile_get_ncleansegs() acquires the number of clean
  481. * segments.
  482. *
  483. * Return Value: On success, 0 is returned and the number of clean segments is
  484. * stored in the place pointed by @nsegsp. On error, one of the following
  485. * negative error codes is returned.
  486. *
  487. * %-EIO - I/O error.
  488. *
  489. * %-ENOMEM - Insufficient amount of memory available.
  490. */
  491. int nilfs_sufile_get_ncleansegs(struct inode *sufile, unsigned long *nsegsp)
  492. {
  493. struct nilfs_sustat sustat;
  494. int ret;
  495. ret = nilfs_sufile_get_stat(sufile, &sustat);
  496. if (ret == 0)
  497. *nsegsp = sustat.ss_ncleansegs;
  498. return ret;
  499. }
  500. void nilfs_sufile_do_set_error(struct inode *sufile, __u64 segnum,
  501. struct buffer_head *header_bh,
  502. struct buffer_head *su_bh)
  503. {
  504. struct nilfs_segment_usage *su;
  505. void *kaddr;
  506. int suclean;
  507. kaddr = kmap_atomic(su_bh->b_page, KM_USER0);
  508. su = nilfs_sufile_block_get_segment_usage(sufile, segnum, su_bh, kaddr);
  509. if (nilfs_segment_usage_error(su)) {
  510. kunmap_atomic(kaddr, KM_USER0);
  511. return;
  512. }
  513. suclean = nilfs_segment_usage_clean(su);
  514. nilfs_segment_usage_set_error(su);
  515. kunmap_atomic(kaddr, KM_USER0);
  516. if (suclean)
  517. nilfs_sufile_mod_counter(header_bh, -1, 0);
  518. nilfs_mdt_mark_buffer_dirty(su_bh);
  519. nilfs_mdt_mark_dirty(sufile);
  520. }
  521. /**
  522. * nilfs_sufile_get_suinfo -
  523. * @sufile: inode of segment usage file
  524. * @segnum: segment number to start looking
  525. * @buf: array of suinfo
  526. * @sisz: byte size of suinfo
  527. * @nsi: size of suinfo array
  528. *
  529. * Description:
  530. *
  531. * Return Value: On success, 0 is returned and .... On error, one of the
  532. * following negative error codes is returned.
  533. *
  534. * %-EIO - I/O error.
  535. *
  536. * %-ENOMEM - Insufficient amount of memory available.
  537. */
  538. ssize_t nilfs_sufile_get_suinfo(struct inode *sufile, __u64 segnum, void *buf,
  539. unsigned sisz, size_t nsi)
  540. {
  541. struct buffer_head *su_bh;
  542. struct nilfs_segment_usage *su;
  543. struct nilfs_suinfo *si = buf;
  544. size_t susz = NILFS_MDT(sufile)->mi_entry_size;
  545. struct the_nilfs *nilfs = NILFS_MDT(sufile)->mi_nilfs;
  546. void *kaddr;
  547. unsigned long nsegs, segusages_per_block;
  548. ssize_t n;
  549. int ret, i, j;
  550. down_read(&NILFS_MDT(sufile)->mi_sem);
  551. segusages_per_block = nilfs_sufile_segment_usages_per_block(sufile);
  552. nsegs = min_t(unsigned long,
  553. nilfs_sufile_get_nsegments(sufile) - segnum,
  554. nsi);
  555. for (i = 0; i < nsegs; i += n, segnum += n) {
  556. n = min_t(unsigned long,
  557. segusages_per_block -
  558. nilfs_sufile_get_offset(sufile, segnum),
  559. nsegs - i);
  560. ret = nilfs_sufile_get_segment_usage_block(sufile, segnum, 0,
  561. &su_bh);
  562. if (ret < 0) {
  563. if (ret != -ENOENT)
  564. goto out;
  565. /* hole */
  566. memset(si, 0, sisz * n);
  567. si = (void *)si + sisz * n;
  568. continue;
  569. }
  570. kaddr = kmap_atomic(su_bh->b_page, KM_USER0);
  571. su = nilfs_sufile_block_get_segment_usage(
  572. sufile, segnum, su_bh, kaddr);
  573. for (j = 0; j < n;
  574. j++, su = (void *)su + susz, si = (void *)si + sisz) {
  575. si->sui_lastmod = le64_to_cpu(su->su_lastmod);
  576. si->sui_nblocks = le32_to_cpu(su->su_nblocks);
  577. si->sui_flags = le32_to_cpu(su->su_flags) &
  578. ~(1UL << NILFS_SEGMENT_USAGE_ACTIVE);
  579. if (nilfs_segment_is_active(nilfs, segnum + j))
  580. si->sui_flags |=
  581. (1UL << NILFS_SEGMENT_USAGE_ACTIVE);
  582. }
  583. kunmap_atomic(kaddr, KM_USER0);
  584. brelse(su_bh);
  585. }
  586. ret = nsegs;
  587. out:
  588. up_read(&NILFS_MDT(sufile)->mi_sem);
  589. return ret;
  590. }