segbuf.c 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534
  1. /*
  2. * segbuf.c - NILFS segment buffer
  3. *
  4. * Copyright (C) 2005-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 Ryusuke Konishi <ryusuke@osrg.net>
  21. *
  22. */
  23. #include <linux/buffer_head.h>
  24. #include <linux/writeback.h>
  25. #include <linux/crc32.h>
  26. #include <linux/backing-dev.h>
  27. #include <linux/slab.h>
  28. #include "page.h"
  29. #include "segbuf.h"
  30. struct nilfs_write_info {
  31. struct the_nilfs *nilfs;
  32. struct bio *bio;
  33. int start, end; /* The region to be submitted */
  34. int rest_blocks;
  35. int max_pages;
  36. int nr_vecs;
  37. sector_t blocknr;
  38. };
  39. static int nilfs_segbuf_write(struct nilfs_segment_buffer *segbuf,
  40. struct the_nilfs *nilfs);
  41. static int nilfs_segbuf_wait(struct nilfs_segment_buffer *segbuf);
  42. static struct kmem_cache *nilfs_segbuf_cachep;
  43. static void nilfs_segbuf_init_once(void *obj)
  44. {
  45. memset(obj, 0, sizeof(struct nilfs_segment_buffer));
  46. }
  47. int __init nilfs_init_segbuf_cache(void)
  48. {
  49. nilfs_segbuf_cachep =
  50. kmem_cache_create("nilfs2_segbuf_cache",
  51. sizeof(struct nilfs_segment_buffer),
  52. 0, SLAB_RECLAIM_ACCOUNT,
  53. nilfs_segbuf_init_once);
  54. return (nilfs_segbuf_cachep == NULL) ? -ENOMEM : 0;
  55. }
  56. void nilfs_destroy_segbuf_cache(void)
  57. {
  58. kmem_cache_destroy(nilfs_segbuf_cachep);
  59. }
  60. struct nilfs_segment_buffer *nilfs_segbuf_new(struct super_block *sb)
  61. {
  62. struct nilfs_segment_buffer *segbuf;
  63. segbuf = kmem_cache_alloc(nilfs_segbuf_cachep, GFP_NOFS);
  64. if (unlikely(!segbuf))
  65. return NULL;
  66. segbuf->sb_super = sb;
  67. INIT_LIST_HEAD(&segbuf->sb_list);
  68. INIT_LIST_HEAD(&segbuf->sb_segsum_buffers);
  69. INIT_LIST_HEAD(&segbuf->sb_payload_buffers);
  70. init_completion(&segbuf->sb_bio_event);
  71. atomic_set(&segbuf->sb_err, 0);
  72. segbuf->sb_nbio = 0;
  73. return segbuf;
  74. }
  75. void nilfs_segbuf_free(struct nilfs_segment_buffer *segbuf)
  76. {
  77. kmem_cache_free(nilfs_segbuf_cachep, segbuf);
  78. }
  79. void nilfs_segbuf_map(struct nilfs_segment_buffer *segbuf, __u64 segnum,
  80. unsigned long offset, struct the_nilfs *nilfs)
  81. {
  82. segbuf->sb_segnum = segnum;
  83. nilfs_get_segment_range(nilfs, segnum, &segbuf->sb_fseg_start,
  84. &segbuf->sb_fseg_end);
  85. segbuf->sb_pseg_start = segbuf->sb_fseg_start + offset;
  86. segbuf->sb_rest_blocks =
  87. segbuf->sb_fseg_end - segbuf->sb_pseg_start + 1;
  88. }
  89. /**
  90. * nilfs_segbuf_map_cont - map a new log behind a given log
  91. * @segbuf: new segment buffer
  92. * @prev: segment buffer containing a log to be continued
  93. */
  94. void nilfs_segbuf_map_cont(struct nilfs_segment_buffer *segbuf,
  95. struct nilfs_segment_buffer *prev)
  96. {
  97. segbuf->sb_segnum = prev->sb_segnum;
  98. segbuf->sb_fseg_start = prev->sb_fseg_start;
  99. segbuf->sb_fseg_end = prev->sb_fseg_end;
  100. segbuf->sb_pseg_start = prev->sb_pseg_start + prev->sb_sum.nblocks;
  101. segbuf->sb_rest_blocks =
  102. segbuf->sb_fseg_end - segbuf->sb_pseg_start + 1;
  103. }
  104. void nilfs_segbuf_set_next_segnum(struct nilfs_segment_buffer *segbuf,
  105. __u64 nextnum, struct the_nilfs *nilfs)
  106. {
  107. segbuf->sb_nextnum = nextnum;
  108. segbuf->sb_sum.next = nilfs_get_segment_start_blocknr(nilfs, nextnum);
  109. }
  110. int nilfs_segbuf_extend_segsum(struct nilfs_segment_buffer *segbuf)
  111. {
  112. struct buffer_head *bh;
  113. bh = sb_getblk(segbuf->sb_super,
  114. segbuf->sb_pseg_start + segbuf->sb_sum.nsumblk);
  115. if (unlikely(!bh))
  116. return -ENOMEM;
  117. nilfs_segbuf_add_segsum_buffer(segbuf, bh);
  118. return 0;
  119. }
  120. int nilfs_segbuf_extend_payload(struct nilfs_segment_buffer *segbuf,
  121. struct buffer_head **bhp)
  122. {
  123. struct buffer_head *bh;
  124. bh = sb_getblk(segbuf->sb_super,
  125. segbuf->sb_pseg_start + segbuf->sb_sum.nblocks);
  126. if (unlikely(!bh))
  127. return -ENOMEM;
  128. nilfs_segbuf_add_payload_buffer(segbuf, bh);
  129. *bhp = bh;
  130. return 0;
  131. }
  132. int nilfs_segbuf_reset(struct nilfs_segment_buffer *segbuf, unsigned flags,
  133. time_t ctime)
  134. {
  135. int err;
  136. segbuf->sb_sum.nblocks = segbuf->sb_sum.nsumblk = 0;
  137. err = nilfs_segbuf_extend_segsum(segbuf);
  138. if (unlikely(err))
  139. return err;
  140. segbuf->sb_sum.flags = flags;
  141. segbuf->sb_sum.sumbytes = sizeof(struct nilfs_segment_summary);
  142. segbuf->sb_sum.nfinfo = segbuf->sb_sum.nfileblk = 0;
  143. segbuf->sb_sum.ctime = ctime;
  144. return 0;
  145. }
  146. /*
  147. * Setup segment summary
  148. */
  149. void nilfs_segbuf_fill_in_segsum(struct nilfs_segment_buffer *segbuf)
  150. {
  151. struct nilfs_segment_summary *raw_sum;
  152. struct buffer_head *bh_sum;
  153. bh_sum = list_entry(segbuf->sb_segsum_buffers.next,
  154. struct buffer_head, b_assoc_buffers);
  155. raw_sum = (struct nilfs_segment_summary *)bh_sum->b_data;
  156. raw_sum->ss_magic = cpu_to_le32(NILFS_SEGSUM_MAGIC);
  157. raw_sum->ss_bytes = cpu_to_le16(sizeof(*raw_sum));
  158. raw_sum->ss_flags = cpu_to_le16(segbuf->sb_sum.flags);
  159. raw_sum->ss_seq = cpu_to_le64(segbuf->sb_sum.seg_seq);
  160. raw_sum->ss_create = cpu_to_le64(segbuf->sb_sum.ctime);
  161. raw_sum->ss_next = cpu_to_le64(segbuf->sb_sum.next);
  162. raw_sum->ss_nblocks = cpu_to_le32(segbuf->sb_sum.nblocks);
  163. raw_sum->ss_nfinfo = cpu_to_le32(segbuf->sb_sum.nfinfo);
  164. raw_sum->ss_sumbytes = cpu_to_le32(segbuf->sb_sum.sumbytes);
  165. raw_sum->ss_pad = 0;
  166. }
  167. /*
  168. * CRC calculation routines
  169. */
  170. void nilfs_segbuf_fill_in_segsum_crc(struct nilfs_segment_buffer *segbuf,
  171. u32 seed)
  172. {
  173. struct buffer_head *bh;
  174. struct nilfs_segment_summary *raw_sum;
  175. unsigned long size, bytes = segbuf->sb_sum.sumbytes;
  176. u32 crc;
  177. bh = list_entry(segbuf->sb_segsum_buffers.next, struct buffer_head,
  178. b_assoc_buffers);
  179. raw_sum = (struct nilfs_segment_summary *)bh->b_data;
  180. size = min_t(unsigned long, bytes, bh->b_size);
  181. crc = crc32_le(seed,
  182. (unsigned char *)raw_sum +
  183. sizeof(raw_sum->ss_datasum) + sizeof(raw_sum->ss_sumsum),
  184. size - (sizeof(raw_sum->ss_datasum) +
  185. sizeof(raw_sum->ss_sumsum)));
  186. list_for_each_entry_continue(bh, &segbuf->sb_segsum_buffers,
  187. b_assoc_buffers) {
  188. bytes -= size;
  189. size = min_t(unsigned long, bytes, bh->b_size);
  190. crc = crc32_le(crc, bh->b_data, size);
  191. }
  192. raw_sum->ss_sumsum = cpu_to_le32(crc);
  193. }
  194. void nilfs_segbuf_fill_in_data_crc(struct nilfs_segment_buffer *segbuf,
  195. u32 seed)
  196. {
  197. struct buffer_head *bh;
  198. struct nilfs_segment_summary *raw_sum;
  199. void *kaddr;
  200. u32 crc;
  201. bh = list_entry(segbuf->sb_segsum_buffers.next, struct buffer_head,
  202. b_assoc_buffers);
  203. raw_sum = (struct nilfs_segment_summary *)bh->b_data;
  204. crc = crc32_le(seed,
  205. (unsigned char *)raw_sum + sizeof(raw_sum->ss_datasum),
  206. bh->b_size - sizeof(raw_sum->ss_datasum));
  207. list_for_each_entry_continue(bh, &segbuf->sb_segsum_buffers,
  208. b_assoc_buffers) {
  209. crc = crc32_le(crc, bh->b_data, bh->b_size);
  210. }
  211. list_for_each_entry(bh, &segbuf->sb_payload_buffers, b_assoc_buffers) {
  212. kaddr = kmap_atomic(bh->b_page, KM_USER0);
  213. crc = crc32_le(crc, kaddr + bh_offset(bh), bh->b_size);
  214. kunmap_atomic(kaddr, KM_USER0);
  215. }
  216. raw_sum->ss_datasum = cpu_to_le32(crc);
  217. }
  218. static void nilfs_release_buffers(struct list_head *list)
  219. {
  220. struct buffer_head *bh, *n;
  221. list_for_each_entry_safe(bh, n, list, b_assoc_buffers) {
  222. list_del_init(&bh->b_assoc_buffers);
  223. if (buffer_nilfs_allocated(bh)) {
  224. struct page *clone_page = bh->b_page;
  225. /* remove clone page */
  226. brelse(bh);
  227. page_cache_release(clone_page); /* for each bh */
  228. if (page_count(clone_page) <= 2) {
  229. lock_page(clone_page);
  230. nilfs_free_private_page(clone_page);
  231. }
  232. continue;
  233. }
  234. brelse(bh);
  235. }
  236. }
  237. static void nilfs_segbuf_clear(struct nilfs_segment_buffer *segbuf)
  238. {
  239. nilfs_release_buffers(&segbuf->sb_segsum_buffers);
  240. nilfs_release_buffers(&segbuf->sb_payload_buffers);
  241. }
  242. /*
  243. * Iterators for segment buffers
  244. */
  245. void nilfs_clear_logs(struct list_head *logs)
  246. {
  247. struct nilfs_segment_buffer *segbuf;
  248. list_for_each_entry(segbuf, logs, sb_list)
  249. nilfs_segbuf_clear(segbuf);
  250. }
  251. void nilfs_truncate_logs(struct list_head *logs,
  252. struct nilfs_segment_buffer *last)
  253. {
  254. struct nilfs_segment_buffer *n, *segbuf;
  255. segbuf = list_prepare_entry(last, logs, sb_list);
  256. list_for_each_entry_safe_continue(segbuf, n, logs, sb_list) {
  257. list_del_init(&segbuf->sb_list);
  258. nilfs_segbuf_clear(segbuf);
  259. nilfs_segbuf_free(segbuf);
  260. }
  261. }
  262. int nilfs_write_logs(struct list_head *logs, struct the_nilfs *nilfs)
  263. {
  264. struct nilfs_segment_buffer *segbuf;
  265. int ret = 0;
  266. list_for_each_entry(segbuf, logs, sb_list) {
  267. ret = nilfs_segbuf_write(segbuf, nilfs);
  268. if (ret)
  269. break;
  270. }
  271. return ret;
  272. }
  273. int nilfs_wait_on_logs(struct list_head *logs)
  274. {
  275. struct nilfs_segment_buffer *segbuf;
  276. int err, ret = 0;
  277. list_for_each_entry(segbuf, logs, sb_list) {
  278. err = nilfs_segbuf_wait(segbuf);
  279. if (err && !ret)
  280. ret = err;
  281. }
  282. return ret;
  283. }
  284. /*
  285. * BIO operations
  286. */
  287. static void nilfs_end_bio_write(struct bio *bio, int err)
  288. {
  289. const int uptodate = test_bit(BIO_UPTODATE, &bio->bi_flags);
  290. struct nilfs_segment_buffer *segbuf = bio->bi_private;
  291. if (err == -EOPNOTSUPP) {
  292. set_bit(BIO_EOPNOTSUPP, &bio->bi_flags);
  293. bio_put(bio);
  294. /* to be detected by submit_seg_bio() */
  295. }
  296. if (!uptodate)
  297. atomic_inc(&segbuf->sb_err);
  298. bio_put(bio);
  299. complete(&segbuf->sb_bio_event);
  300. }
  301. static int nilfs_segbuf_submit_bio(struct nilfs_segment_buffer *segbuf,
  302. struct nilfs_write_info *wi, int mode)
  303. {
  304. struct bio *bio = wi->bio;
  305. int err;
  306. if (segbuf->sb_nbio > 0 && bdi_write_congested(wi->nilfs->ns_bdi)) {
  307. wait_for_completion(&segbuf->sb_bio_event);
  308. segbuf->sb_nbio--;
  309. if (unlikely(atomic_read(&segbuf->sb_err))) {
  310. bio_put(bio);
  311. err = -EIO;
  312. goto failed;
  313. }
  314. }
  315. bio->bi_end_io = nilfs_end_bio_write;
  316. bio->bi_private = segbuf;
  317. bio_get(bio);
  318. submit_bio(mode, bio);
  319. if (bio_flagged(bio, BIO_EOPNOTSUPP)) {
  320. bio_put(bio);
  321. err = -EOPNOTSUPP;
  322. goto failed;
  323. }
  324. segbuf->sb_nbio++;
  325. bio_put(bio);
  326. wi->bio = NULL;
  327. wi->rest_blocks -= wi->end - wi->start;
  328. wi->nr_vecs = min(wi->max_pages, wi->rest_blocks);
  329. wi->start = wi->end;
  330. return 0;
  331. failed:
  332. wi->bio = NULL;
  333. return err;
  334. }
  335. /**
  336. * nilfs_alloc_seg_bio - allocate a new bio for writing log
  337. * @nilfs: nilfs object
  338. * @start: start block number of the bio
  339. * @nr_vecs: request size of page vector.
  340. *
  341. * Return Value: On success, pointer to the struct bio is returned.
  342. * On error, NULL is returned.
  343. */
  344. static struct bio *nilfs_alloc_seg_bio(struct the_nilfs *nilfs, sector_t start,
  345. int nr_vecs)
  346. {
  347. struct bio *bio;
  348. bio = bio_alloc(GFP_NOIO, nr_vecs);
  349. if (bio == NULL) {
  350. while (!bio && (nr_vecs >>= 1))
  351. bio = bio_alloc(GFP_NOIO, nr_vecs);
  352. }
  353. if (likely(bio)) {
  354. bio->bi_bdev = nilfs->ns_bdev;
  355. bio->bi_sector = start << (nilfs->ns_blocksize_bits - 9);
  356. }
  357. return bio;
  358. }
  359. static void nilfs_segbuf_prepare_write(struct nilfs_segment_buffer *segbuf,
  360. struct nilfs_write_info *wi)
  361. {
  362. wi->bio = NULL;
  363. wi->rest_blocks = segbuf->sb_sum.nblocks;
  364. wi->max_pages = bio_get_nr_vecs(wi->nilfs->ns_bdev);
  365. wi->nr_vecs = min(wi->max_pages, wi->rest_blocks);
  366. wi->start = wi->end = 0;
  367. wi->blocknr = segbuf->sb_pseg_start;
  368. }
  369. static int nilfs_segbuf_submit_bh(struct nilfs_segment_buffer *segbuf,
  370. struct nilfs_write_info *wi,
  371. struct buffer_head *bh, int mode)
  372. {
  373. int len, err;
  374. BUG_ON(wi->nr_vecs <= 0);
  375. repeat:
  376. if (!wi->bio) {
  377. wi->bio = nilfs_alloc_seg_bio(wi->nilfs, wi->blocknr + wi->end,
  378. wi->nr_vecs);
  379. if (unlikely(!wi->bio))
  380. return -ENOMEM;
  381. }
  382. len = bio_add_page(wi->bio, bh->b_page, bh->b_size, bh_offset(bh));
  383. if (len == bh->b_size) {
  384. wi->end++;
  385. return 0;
  386. }
  387. /* bio is FULL */
  388. err = nilfs_segbuf_submit_bio(segbuf, wi, mode);
  389. /* never submit current bh */
  390. if (likely(!err))
  391. goto repeat;
  392. return err;
  393. }
  394. /**
  395. * nilfs_segbuf_write - submit write requests of a log
  396. * @segbuf: buffer storing a log to be written
  397. * @nilfs: nilfs object
  398. *
  399. * Return Value: On Success, 0 is returned. On Error, one of the following
  400. * negative error code is returned.
  401. *
  402. * %-EIO - I/O error
  403. *
  404. * %-ENOMEM - Insufficient memory available.
  405. */
  406. static int nilfs_segbuf_write(struct nilfs_segment_buffer *segbuf,
  407. struct the_nilfs *nilfs)
  408. {
  409. struct nilfs_write_info wi;
  410. struct buffer_head *bh;
  411. int res = 0, rw = WRITE;
  412. wi.nilfs = nilfs;
  413. nilfs_segbuf_prepare_write(segbuf, &wi);
  414. list_for_each_entry(bh, &segbuf->sb_segsum_buffers, b_assoc_buffers) {
  415. res = nilfs_segbuf_submit_bh(segbuf, &wi, bh, rw);
  416. if (unlikely(res))
  417. goto failed_bio;
  418. }
  419. list_for_each_entry(bh, &segbuf->sb_payload_buffers, b_assoc_buffers) {
  420. res = nilfs_segbuf_submit_bh(segbuf, &wi, bh, rw);
  421. if (unlikely(res))
  422. goto failed_bio;
  423. }
  424. if (wi.bio) {
  425. /*
  426. * Last BIO is always sent through the following
  427. * submission.
  428. */
  429. rw |= (1 << BIO_RW_SYNCIO) | (1 << BIO_RW_UNPLUG);
  430. res = nilfs_segbuf_submit_bio(segbuf, &wi, rw);
  431. }
  432. failed_bio:
  433. return res;
  434. }
  435. /**
  436. * nilfs_segbuf_wait - wait for completion of requested BIOs
  437. * @segbuf: segment buffer
  438. *
  439. * Return Value: On Success, 0 is returned. On Error, one of the following
  440. * negative error code is returned.
  441. *
  442. * %-EIO - I/O error
  443. */
  444. static int nilfs_segbuf_wait(struct nilfs_segment_buffer *segbuf)
  445. {
  446. int err = 0;
  447. if (!segbuf->sb_nbio)
  448. return 0;
  449. do {
  450. wait_for_completion(&segbuf->sb_bio_event);
  451. } while (--segbuf->sb_nbio > 0);
  452. if (unlikely(atomic_read(&segbuf->sb_err) > 0)) {
  453. printk(KERN_ERR "NILFS: IO error writing segment\n");
  454. err = -EIO;
  455. }
  456. return err;
  457. }