segbuf.c 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430
  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 "page.h"
  27. #include "segbuf.h"
  28. static struct kmem_cache *nilfs_segbuf_cachep;
  29. static void nilfs_segbuf_init_once(void *obj)
  30. {
  31. memset(obj, 0, sizeof(struct nilfs_segment_buffer));
  32. }
  33. int __init nilfs_init_segbuf_cache(void)
  34. {
  35. nilfs_segbuf_cachep =
  36. kmem_cache_create("nilfs2_segbuf_cache",
  37. sizeof(struct nilfs_segment_buffer),
  38. 0, SLAB_RECLAIM_ACCOUNT,
  39. nilfs_segbuf_init_once);
  40. return (nilfs_segbuf_cachep == NULL) ? -ENOMEM : 0;
  41. }
  42. void nilfs_destroy_segbuf_cache(void)
  43. {
  44. kmem_cache_destroy(nilfs_segbuf_cachep);
  45. }
  46. struct nilfs_segment_buffer *nilfs_segbuf_new(struct super_block *sb)
  47. {
  48. struct nilfs_segment_buffer *segbuf;
  49. segbuf = kmem_cache_alloc(nilfs_segbuf_cachep, GFP_NOFS);
  50. if (unlikely(!segbuf))
  51. return NULL;
  52. segbuf->sb_super = sb;
  53. INIT_LIST_HEAD(&segbuf->sb_list);
  54. INIT_LIST_HEAD(&segbuf->sb_segsum_buffers);
  55. INIT_LIST_HEAD(&segbuf->sb_payload_buffers);
  56. init_completion(&segbuf->sb_bio_event);
  57. atomic_set(&segbuf->sb_err, 0);
  58. segbuf->sb_nbio = 0;
  59. return segbuf;
  60. }
  61. void nilfs_segbuf_free(struct nilfs_segment_buffer *segbuf)
  62. {
  63. kmem_cache_free(nilfs_segbuf_cachep, segbuf);
  64. }
  65. void nilfs_segbuf_map(struct nilfs_segment_buffer *segbuf, __u64 segnum,
  66. unsigned long offset, struct the_nilfs *nilfs)
  67. {
  68. segbuf->sb_segnum = segnum;
  69. nilfs_get_segment_range(nilfs, segnum, &segbuf->sb_fseg_start,
  70. &segbuf->sb_fseg_end);
  71. segbuf->sb_pseg_start = segbuf->sb_fseg_start + offset;
  72. segbuf->sb_rest_blocks =
  73. segbuf->sb_fseg_end - segbuf->sb_pseg_start + 1;
  74. }
  75. void nilfs_segbuf_set_next_segnum(struct nilfs_segment_buffer *segbuf,
  76. __u64 nextnum, struct the_nilfs *nilfs)
  77. {
  78. segbuf->sb_nextnum = nextnum;
  79. segbuf->sb_sum.next = nilfs_get_segment_start_blocknr(nilfs, nextnum);
  80. }
  81. int nilfs_segbuf_extend_segsum(struct nilfs_segment_buffer *segbuf)
  82. {
  83. struct buffer_head *bh;
  84. bh = sb_getblk(segbuf->sb_super,
  85. segbuf->sb_pseg_start + segbuf->sb_sum.nsumblk);
  86. if (unlikely(!bh))
  87. return -ENOMEM;
  88. nilfs_segbuf_add_segsum_buffer(segbuf, bh);
  89. return 0;
  90. }
  91. int nilfs_segbuf_extend_payload(struct nilfs_segment_buffer *segbuf,
  92. struct buffer_head **bhp)
  93. {
  94. struct buffer_head *bh;
  95. bh = sb_getblk(segbuf->sb_super,
  96. segbuf->sb_pseg_start + segbuf->sb_sum.nblocks);
  97. if (unlikely(!bh))
  98. return -ENOMEM;
  99. nilfs_segbuf_add_payload_buffer(segbuf, bh);
  100. *bhp = bh;
  101. return 0;
  102. }
  103. int nilfs_segbuf_reset(struct nilfs_segment_buffer *segbuf, unsigned flags,
  104. time_t ctime)
  105. {
  106. int err;
  107. segbuf->sb_sum.nblocks = segbuf->sb_sum.nsumblk = 0;
  108. err = nilfs_segbuf_extend_segsum(segbuf);
  109. if (unlikely(err))
  110. return err;
  111. segbuf->sb_sum.flags = flags;
  112. segbuf->sb_sum.sumbytes = sizeof(struct nilfs_segment_summary);
  113. segbuf->sb_sum.nfinfo = segbuf->sb_sum.nfileblk = 0;
  114. segbuf->sb_sum.ctime = ctime;
  115. return 0;
  116. }
  117. /*
  118. * Setup segument summary
  119. */
  120. void nilfs_segbuf_fill_in_segsum(struct nilfs_segment_buffer *segbuf)
  121. {
  122. struct nilfs_segment_summary *raw_sum;
  123. struct buffer_head *bh_sum;
  124. bh_sum = list_entry(segbuf->sb_segsum_buffers.next,
  125. struct buffer_head, b_assoc_buffers);
  126. raw_sum = (struct nilfs_segment_summary *)bh_sum->b_data;
  127. raw_sum->ss_magic = cpu_to_le32(NILFS_SEGSUM_MAGIC);
  128. raw_sum->ss_bytes = cpu_to_le16(sizeof(*raw_sum));
  129. raw_sum->ss_flags = cpu_to_le16(segbuf->sb_sum.flags);
  130. raw_sum->ss_seq = cpu_to_le64(segbuf->sb_sum.seg_seq);
  131. raw_sum->ss_create = cpu_to_le64(segbuf->sb_sum.ctime);
  132. raw_sum->ss_next = cpu_to_le64(segbuf->sb_sum.next);
  133. raw_sum->ss_nblocks = cpu_to_le32(segbuf->sb_sum.nblocks);
  134. raw_sum->ss_nfinfo = cpu_to_le32(segbuf->sb_sum.nfinfo);
  135. raw_sum->ss_sumbytes = cpu_to_le32(segbuf->sb_sum.sumbytes);
  136. raw_sum->ss_pad = 0;
  137. }
  138. /*
  139. * CRC calculation routines
  140. */
  141. void nilfs_segbuf_fill_in_segsum_crc(struct nilfs_segment_buffer *segbuf,
  142. u32 seed)
  143. {
  144. struct buffer_head *bh;
  145. struct nilfs_segment_summary *raw_sum;
  146. unsigned long size, bytes = segbuf->sb_sum.sumbytes;
  147. u32 crc;
  148. bh = list_entry(segbuf->sb_segsum_buffers.next, struct buffer_head,
  149. b_assoc_buffers);
  150. raw_sum = (struct nilfs_segment_summary *)bh->b_data;
  151. size = min_t(unsigned long, bytes, bh->b_size);
  152. crc = crc32_le(seed,
  153. (unsigned char *)raw_sum +
  154. sizeof(raw_sum->ss_datasum) + sizeof(raw_sum->ss_sumsum),
  155. size - (sizeof(raw_sum->ss_datasum) +
  156. sizeof(raw_sum->ss_sumsum)));
  157. list_for_each_entry_continue(bh, &segbuf->sb_segsum_buffers,
  158. b_assoc_buffers) {
  159. bytes -= size;
  160. size = min_t(unsigned long, bytes, bh->b_size);
  161. crc = crc32_le(crc, bh->b_data, size);
  162. }
  163. raw_sum->ss_sumsum = cpu_to_le32(crc);
  164. }
  165. void nilfs_segbuf_fill_in_data_crc(struct nilfs_segment_buffer *segbuf,
  166. u32 seed)
  167. {
  168. struct buffer_head *bh;
  169. struct nilfs_segment_summary *raw_sum;
  170. void *kaddr;
  171. u32 crc;
  172. bh = list_entry(segbuf->sb_segsum_buffers.next, struct buffer_head,
  173. b_assoc_buffers);
  174. raw_sum = (struct nilfs_segment_summary *)bh->b_data;
  175. crc = crc32_le(seed,
  176. (unsigned char *)raw_sum + sizeof(raw_sum->ss_datasum),
  177. bh->b_size - sizeof(raw_sum->ss_datasum));
  178. list_for_each_entry_continue(bh, &segbuf->sb_segsum_buffers,
  179. b_assoc_buffers) {
  180. crc = crc32_le(crc, bh->b_data, bh->b_size);
  181. }
  182. list_for_each_entry(bh, &segbuf->sb_payload_buffers, b_assoc_buffers) {
  183. kaddr = kmap_atomic(bh->b_page, KM_USER0);
  184. crc = crc32_le(crc, kaddr + bh_offset(bh), bh->b_size);
  185. kunmap_atomic(kaddr, KM_USER0);
  186. }
  187. raw_sum->ss_datasum = cpu_to_le32(crc);
  188. }
  189. void nilfs_release_buffers(struct list_head *list)
  190. {
  191. struct buffer_head *bh, *n;
  192. list_for_each_entry_safe(bh, n, list, b_assoc_buffers) {
  193. list_del_init(&bh->b_assoc_buffers);
  194. if (buffer_nilfs_allocated(bh)) {
  195. struct page *clone_page = bh->b_page;
  196. /* remove clone page */
  197. brelse(bh);
  198. page_cache_release(clone_page); /* for each bh */
  199. if (page_count(clone_page) <= 2) {
  200. lock_page(clone_page);
  201. nilfs_free_private_page(clone_page);
  202. }
  203. continue;
  204. }
  205. brelse(bh);
  206. }
  207. }
  208. /*
  209. * BIO operations
  210. */
  211. static void nilfs_end_bio_write(struct bio *bio, int err)
  212. {
  213. const int uptodate = test_bit(BIO_UPTODATE, &bio->bi_flags);
  214. struct nilfs_segment_buffer *segbuf = bio->bi_private;
  215. if (err == -EOPNOTSUPP) {
  216. set_bit(BIO_EOPNOTSUPP, &bio->bi_flags);
  217. bio_put(bio);
  218. /* to be detected by submit_seg_bio() */
  219. }
  220. if (!uptodate)
  221. atomic_inc(&segbuf->sb_err);
  222. bio_put(bio);
  223. complete(&segbuf->sb_bio_event);
  224. }
  225. static int nilfs_segbuf_submit_bio(struct nilfs_segment_buffer *segbuf,
  226. struct nilfs_write_info *wi, int mode)
  227. {
  228. struct bio *bio = wi->bio;
  229. int err;
  230. if (segbuf->sb_nbio > 0 && bdi_write_congested(wi->bdi)) {
  231. wait_for_completion(&segbuf->sb_bio_event);
  232. segbuf->sb_nbio--;
  233. if (unlikely(atomic_read(&segbuf->sb_err))) {
  234. bio_put(bio);
  235. err = -EIO;
  236. goto failed;
  237. }
  238. }
  239. bio->bi_end_io = nilfs_end_bio_write;
  240. bio->bi_private = segbuf;
  241. bio_get(bio);
  242. submit_bio(mode, bio);
  243. if (bio_flagged(bio, BIO_EOPNOTSUPP)) {
  244. bio_put(bio);
  245. err = -EOPNOTSUPP;
  246. goto failed;
  247. }
  248. segbuf->sb_nbio++;
  249. bio_put(bio);
  250. wi->bio = NULL;
  251. wi->rest_blocks -= wi->end - wi->start;
  252. wi->nr_vecs = min(wi->max_pages, wi->rest_blocks);
  253. wi->start = wi->end;
  254. return 0;
  255. failed:
  256. wi->bio = NULL;
  257. return err;
  258. }
  259. /**
  260. * nilfs_alloc_seg_bio - allocate a bio for writing segment.
  261. * @sb: super block
  262. * @start: beginning disk block number of this BIO.
  263. * @nr_vecs: request size of page vector.
  264. *
  265. * alloc_seg_bio() allocates a new BIO structure and initialize it.
  266. *
  267. * Return Value: On success, pointer to the struct bio is returned.
  268. * On error, NULL is returned.
  269. */
  270. static struct bio *nilfs_alloc_seg_bio(struct super_block *sb, sector_t start,
  271. int nr_vecs)
  272. {
  273. struct bio *bio;
  274. bio = bio_alloc(GFP_NOIO, nr_vecs);
  275. if (bio == NULL) {
  276. while (!bio && (nr_vecs >>= 1))
  277. bio = bio_alloc(GFP_NOIO, nr_vecs);
  278. }
  279. if (likely(bio)) {
  280. bio->bi_bdev = sb->s_bdev;
  281. bio->bi_sector = (sector_t)start << (sb->s_blocksize_bits - 9);
  282. }
  283. return bio;
  284. }
  285. void nilfs_segbuf_prepare_write(struct nilfs_segment_buffer *segbuf,
  286. struct nilfs_write_info *wi)
  287. {
  288. wi->bio = NULL;
  289. wi->rest_blocks = segbuf->sb_sum.nblocks;
  290. wi->max_pages = bio_get_nr_vecs(wi->sb->s_bdev);
  291. wi->nr_vecs = min(wi->max_pages, wi->rest_blocks);
  292. wi->start = wi->end = 0;
  293. wi->blocknr = segbuf->sb_pseg_start;
  294. }
  295. static int nilfs_segbuf_submit_bh(struct nilfs_segment_buffer *segbuf,
  296. struct nilfs_write_info *wi,
  297. struct buffer_head *bh, int mode)
  298. {
  299. int len, err;
  300. BUG_ON(wi->nr_vecs <= 0);
  301. repeat:
  302. if (!wi->bio) {
  303. wi->bio = nilfs_alloc_seg_bio(wi->sb, wi->blocknr + wi->end,
  304. wi->nr_vecs);
  305. if (unlikely(!wi->bio))
  306. return -ENOMEM;
  307. }
  308. len = bio_add_page(wi->bio, bh->b_page, bh->b_size, bh_offset(bh));
  309. if (len == bh->b_size) {
  310. wi->end++;
  311. return 0;
  312. }
  313. /* bio is FULL */
  314. err = nilfs_segbuf_submit_bio(segbuf, wi, mode);
  315. /* never submit current bh */
  316. if (likely(!err))
  317. goto repeat;
  318. return err;
  319. }
  320. int nilfs_segbuf_write(struct nilfs_segment_buffer *segbuf,
  321. struct nilfs_write_info *wi)
  322. {
  323. struct buffer_head *bh;
  324. int res = 0, rw = WRITE;
  325. list_for_each_entry(bh, &segbuf->sb_segsum_buffers, b_assoc_buffers) {
  326. res = nilfs_segbuf_submit_bh(segbuf, wi, bh, rw);
  327. if (unlikely(res))
  328. goto failed_bio;
  329. }
  330. list_for_each_entry(bh, &segbuf->sb_payload_buffers, b_assoc_buffers) {
  331. res = nilfs_segbuf_submit_bh(segbuf, wi, bh, rw);
  332. if (unlikely(res))
  333. goto failed_bio;
  334. }
  335. if (wi->bio) {
  336. /*
  337. * Last BIO is always sent through the following
  338. * submission.
  339. */
  340. rw |= (1 << BIO_RW_SYNCIO) | (1 << BIO_RW_UNPLUG);
  341. res = nilfs_segbuf_submit_bio(segbuf, wi, rw);
  342. }
  343. failed_bio:
  344. return res;
  345. }
  346. /**
  347. * nilfs_segbuf_wait - wait for completion of requested BIOs
  348. * @segbuf: segment buffer
  349. *
  350. * Return Value: On Success, 0 is returned. On Error, one of the following
  351. * negative error code is returned.
  352. *
  353. * %-EIO - I/O error
  354. */
  355. int nilfs_segbuf_wait(struct nilfs_segment_buffer *segbuf)
  356. {
  357. int err = 0;
  358. if (!segbuf->sb_nbio)
  359. return 0;
  360. do {
  361. wait_for_completion(&segbuf->sb_bio_event);
  362. } while (--segbuf->sb_nbio > 0);
  363. if (unlikely(atomic_read(&segbuf->sb_err) > 0)) {
  364. printk(KERN_ERR "NILFS: IO error writing segment\n");
  365. err = -EIO;
  366. }
  367. return err;
  368. }