[linux-2.6-block.git] / fs / nilfs2 / segbuf.c

/*
 * segbuf.c - NILFS segment buffer
 *
 * Copyright (C) 2005-2008 Nippon Telegraph and Telephone Corporation.
 *
 * This program is free software; you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation; either version 2 of the License, or
 * (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301  USA
 *
 * Written by Ryusuke Konishi <ryusuke@osrg.net>
 *
 */

#include <linux/buffer_head.h>
#include <linux/writeback.h>
#include <linux/crc32.h>
#include <linux/backing-dev.h>
#include <linux/slab.h>
#include "page.h"
#include "segbuf.h"


struct nilfs_write_info {
	struct the_nilfs       *nilfs;
	struct bio	       *bio;
	int			start, end; /* The region to be submitted */
	int			rest_blocks;
	int			max_pages;
	int			nr_vecs;
	sector_t		blocknr;
};

static int nilfs_segbuf_write(struct nilfs_segment_buffer *segbuf,
			      struct the_nilfs *nilfs);
static int nilfs_segbuf_wait(struct nilfs_segment_buffer *segbuf);

struct nilfs_segment_buffer *nilfs_segbuf_new(struct super_block *sb)
{
	struct nilfs_segment_buffer *segbuf;

	segbuf = kmem_cache_alloc(nilfs_segbuf_cachep, GFP_NOFS);
	if (unlikely(!segbuf))
		return NULL;

	segbuf->sb_super = sb;
	INIT_LIST_HEAD(&segbuf->sb_list);
	INIT_LIST_HEAD(&segbuf->sb_segsum_buffers);
	INIT_LIST_HEAD(&segbuf->sb_payload_buffers);
	segbuf->sb_super_root = NULL;

	init_completion(&segbuf->sb_bio_event);
	atomic_set(&segbuf->sb_err, 0);
	segbuf->sb_nbio = 0;

	return segbuf;
}

void nilfs_segbuf_free(struct nilfs_segment_buffer *segbuf)
{
	kmem_cache_free(nilfs_segbuf_cachep, segbuf);
}

void nilfs_segbuf_map(struct nilfs_segment_buffer *segbuf, __u64 segnum,
		     unsigned long offset, struct the_nilfs *nilfs)
{
	segbuf->sb_segnum = segnum;
	nilfs_get_segment_range(nilfs, segnum, &segbuf->sb_fseg_start,
				&segbuf->sb_fseg_end);

	segbuf->sb_pseg_start = segbuf->sb_fseg_start + offset;
	segbuf->sb_rest_blocks =
		segbuf->sb_fseg_end - segbuf->sb_pseg_start + 1;
}

/**
 * nilfs_segbuf_map_cont - map a new log behind a given log
 * @segbuf: new segment buffer
 * @prev: segment buffer containing a log to be continued
 */
void nilfs_segbuf_map_cont(struct nilfs_segment_buffer *segbuf,
			   struct nilfs_segment_buffer *prev)
{
	segbuf->sb_segnum = prev->sb_segnum;
	segbuf->sb_fseg_start = prev->sb_fseg_start;
	segbuf->sb_fseg_end = prev->sb_fseg_end;
	segbuf->sb_pseg_start = prev->sb_pseg_start + prev->sb_sum.nblocks;
	segbuf->sb_rest_blocks =
		segbuf->sb_fseg_end - segbuf->sb_pseg_start + 1;
}

void nilfs_segbuf_set_next_segnum(struct nilfs_segment_buffer *segbuf,
				  __u64 nextnum, struct the_nilfs *nilfs)
{
	segbuf->sb_nextnum = nextnum;
	segbuf->sb_sum.next = nilfs_get_segment_start_blocknr(nilfs, nextnum);
}

int nilfs_segbuf_extend_segsum(struct nilfs_segment_buffer *segbuf)
{
	struct buffer_head *bh;

	bh = sb_getblk(segbuf->sb_super,
		       segbuf->sb_pseg_start + segbuf->sb_sum.nsumblk);
	if (unlikely(!bh))
		return -ENOMEM;

	nilfs_segbuf_add_segsum_buffer(segbuf, bh);
	return 0;
}

int nilfs_segbuf_extend_payload(struct nilfs_segment_buffer *segbuf,
				struct buffer_head **bhp)
{
	struct buffer_head *bh;

	bh = sb_getblk(segbuf->sb_super,
		       segbuf->sb_pseg_start + segbuf->sb_sum.nblocks);
	if (unlikely(!bh))
		return -ENOMEM;

	nilfs_segbuf_add_payload_buffer(segbuf, bh);
	*bhp = bh;
	return 0;
}

int nilfs_segbuf_reset(struct nilfs_segment_buffer *segbuf, unsigned flags,
		       time_t ctime, __u64 cno)
{
	int err;

	segbuf->sb_sum.nblocks = segbuf->sb_sum.nsumblk = 0;
	err = nilfs_segbuf_extend_segsum(segbuf);
	if (unlikely(err))
		return err;

	segbuf->sb_sum.flags = flags;
	segbuf->sb_sum.sumbytes = sizeof(struct nilfs_segment_summary);
	segbuf->sb_sum.nfinfo = segbuf->sb_sum.nfileblk = 0;
	segbuf->sb_sum.ctime = ctime;
	segbuf->sb_sum.cno = cno;
	return 0;
}

/*
 * Setup segment summary
 */
void nilfs_segbuf_fill_in_segsum(struct nilfs_segment_buffer *segbuf)
{
	struct nilfs_segment_summary *raw_sum;
	struct buffer_head *bh_sum;

	bh_sum = list_entry(segbuf->sb_segsum_buffers.next,
			    struct buffer_head, b_assoc_buffers);
	raw_sum = (struct nilfs_segment_summary *)bh_sum->b_data;

	raw_sum->ss_magic    = cpu_to_le32(NILFS_SEGSUM_MAGIC);
	raw_sum->ss_bytes    = cpu_to_le16(sizeof(*raw_sum));
	raw_sum->ss_flags    = cpu_to_le16(segbuf->sb_sum.flags);
	raw_sum->ss_seq      = cpu_to_le64(segbuf->sb_sum.seg_seq);
	raw_sum->ss_create   = cpu_to_le64(segbuf->sb_sum.ctime);
	raw_sum->ss_next     = cpu_to_le64(segbuf->sb_sum.next);
	raw_sum->ss_nblocks  = cpu_to_le32(segbuf->sb_sum.nblocks);
	raw_sum->ss_nfinfo   = cpu_to_le32(segbuf->sb_sum.nfinfo);
	raw_sum->ss_sumbytes = cpu_to_le32(segbuf->sb_sum.sumbytes);
	raw_sum->ss_pad      = 0;
	raw_sum->ss_cno      = cpu_to_le64(segbuf->sb_sum.cno);
}

/*
 * CRC calculation routines
 */
static void
nilfs_segbuf_fill_in_segsum_crc(struct nilfs_segment_buffer *segbuf, u32 seed)
{
	struct buffer_head *bh;
	struct nilfs_segment_summary *raw_sum;
	unsigned long size, bytes = segbuf->sb_sum.sumbytes;
	u32 crc;

	bh = list_entry(segbuf->sb_segsum_buffers.next, struct buffer_head,
			b_assoc_buffers);

	raw_sum = (struct nilfs_segment_summary *)bh->b_data;
	size = min_t(unsigned long, bytes, bh->b_size);
	crc = crc32_le(seed,
		       (unsigned char *)raw_sum +
		       sizeof(raw_sum->ss_datasum) + sizeof(raw_sum->ss_sumsum),
		       size - (sizeof(raw_sum->ss_datasum) +
			       sizeof(raw_sum->ss_sumsum)));

	list_for_each_entry_continue(bh, &segbuf->sb_segsum_buffers,
				     b_assoc_buffers) {
		bytes -= size;
		size = min_t(unsigned long, bytes, bh->b_size);
		crc = crc32_le(crc, bh->b_data, size);
	}
	raw_sum->ss_sumsum = cpu_to_le32(crc);
}

static void nilfs_segbuf_fill_in_data_crc(struct nilfs_segment_buffer *segbuf,
					  u32 seed)
{
	struct buffer_head *bh;
	struct nilfs_segment_summary *raw_sum;
	void *kaddr;
	u32 crc;

	bh = list_entry(segbuf->sb_segsum_buffers.next, struct buffer_head,
			b_assoc_buffers);
	raw_sum = (struct nilfs_segment_summary *)bh->b_data;
	crc = crc32_le(seed,
		       (unsigned char *)raw_sum + sizeof(raw_sum->ss_datasum),
		       bh->b_size - sizeof(raw_sum->ss_datasum));

	list_for_each_entry_continue(bh, &segbuf->sb_segsum_buffers,
				     b_assoc_buffers) {
		crc = crc32_le(crc, bh->b_data, bh->b_size);
	}
	list_for_each_entry(bh, &segbuf->sb_payload_buffers, b_assoc_buffers) {
		kaddr = kmap_atomic(bh->b_page);
		crc = crc32_le(crc, kaddr + bh_offset(bh), bh->b_size);
		kunmap_atomic(kaddr);
	}
	raw_sum->ss_datasum = cpu_to_le32(crc);
}

static void
nilfs_segbuf_fill_in_super_root_crc(struct nilfs_segment_buffer *segbuf,
				    u32 seed)
{
	struct nilfs_super_root *raw_sr;
	struct the_nilfs *nilfs = segbuf->sb_super->s_fs_info;
	unsigned srsize;
	u32 crc;

	raw_sr = (struct nilfs_super_root *)segbuf->sb_super_root->b_data;
	srsize = NILFS_SR_BYTES(nilfs->ns_inode_size);
	crc = crc32_le(seed,
		       (unsigned char *)raw_sr + sizeof(raw_sr->sr_sum),
		       srsize - sizeof(raw_sr->sr_sum));
	raw_sr->sr_sum = cpu_to_le32(crc);
}

static void nilfs_release_buffers(struct list_head *list)
{
	struct buffer_head *bh, *n;

	list_for_each_entry_safe(bh, n, list, b_assoc_buffers) {
		list_del_init(&bh->b_assoc_buffers);
		brelse(bh);
	}
}

static void nilfs_segbuf_clear(struct nilfs_segment_buffer *segbuf)
{
	nilfs_release_buffers(&segbuf->sb_segsum_buffers);
	nilfs_release_buffers(&segbuf->sb_payload_buffers);
	segbuf->sb_super_root = NULL;
}

/*
 * Iterators for segment buffers
 */
void nilfs_clear_logs(struct list_head *logs)
{
	struct nilfs_segment_buffer *segbuf;

	list_for_each_entry(segbuf, logs, sb_list)
		nilfs_segbuf_clear(segbuf);
}

void nilfs_truncate_logs(struct list_head *logs,
			 struct nilfs_segment_buffer *last)
{
	struct nilfs_segment_buffer *n, *segbuf;

	segbuf = list_prepare_entry(last, logs, sb_list);
	list_for_each_entry_safe_continue(segbuf, n, logs, sb_list) {
		list_del_init(&segbuf->sb_list);
		nilfs_segbuf_clear(segbuf);
		nilfs_segbuf_free(segbuf);
	}
}

int nilfs_write_logs(struct list_head *logs, struct the_nilfs *nilfs)
{
	struct nilfs_segment_buffer *segbuf;
	int ret = 0;

	list_for_each_entry(segbuf, logs, sb_list) {
		ret = nilfs_segbuf_write(segbuf, nilfs);
		if (ret)
			break;
	}
	return ret;
}

int nilfs_wait_on_logs(struct list_head *logs)
{
	struct nilfs_segment_buffer *segbuf;
	int err, ret = 0;

	list_for_each_entry(segbuf, logs, sb_list) {
		err = nilfs_segbuf_wait(segbuf);
		if (err && !ret)
			ret = err;
	}
	return ret;
}

/**
 * nilfs_add_checksums_on_logs - add checksums on the logs
 * @logs: list of segment buffers storing target logs
 * @seed: checksum seed value
 */
void nilfs_add_checksums_on_logs(struct list_head *logs, u32 seed)
{
	struct nilfs_segment_buffer *segbuf;

	list_for_each_entry(segbuf, logs, sb_list) {
		if (segbuf->sb_super_root)
			nilfs_segbuf_fill_in_super_root_crc(segbuf, seed);
		nilfs_segbuf_fill_in_segsum_crc(segbuf, seed);
		nilfs_segbuf_fill_in_data_crc(segbuf, seed);
	}
}

/*
 * BIO operations
 */
static void nilfs_end_bio_write(struct bio *bio, int err)
{
	const int uptodate = test_bit(BIO_UPTODATE, &bio->bi_flags);
	struct nilfs_segment_buffer *segbuf = bio->bi_private;

	if (err == -EOPNOTSUPP) {
		set_bit(BIO_EOPNOTSUPP, &bio->bi_flags);
		/* to be detected by nilfs_segbuf_submit_bio() */
	}

	if (!uptodate)
		atomic_inc(&segbuf->sb_err);

	bio_put(bio);
	complete(&segbuf->sb_bio_event);
}

static int nilfs_segbuf_submit_bio(struct nilfs_segment_buffer *segbuf,
				   struct nilfs_write_info *wi, int mode)
{
	struct bio *bio = wi->bio;
	int err;

	if (segbuf->sb_nbio > 0 &&
	    bdi_write_congested(segbuf->sb_super->s_bdi)) {
		wait_for_completion(&segbuf->sb_bio_event);
		segbuf->sb_nbio--;
		if (unlikely(atomic_read(&segbuf->sb_err))) {
			bio_put(bio);
			err = -EIO;
			goto failed;
		}
	}

	bio->bi_end_io = nilfs_end_bio_write;
	bio->bi_private = segbuf;
	bio_get(bio);
	submit_bio(mode, bio);
	segbuf->sb_nbio++;
	if (bio_flagged(bio, BIO_EOPNOTSUPP)) {
		bio_put(bio);
		err = -EOPNOTSUPP;
		goto failed;
	}
	bio_put(bio);

	wi->bio = NULL;
	wi->rest_blocks -= wi->end - wi->start;
	wi->nr_vecs = min(wi->max_pages, wi->rest_blocks);
	wi->start = wi->end;
	return 0;

 failed:
	wi->bio = NULL;
	return err;
}

/**
 * nilfs_alloc_seg_bio - allocate a new bio for writing log
 * @nilfs: nilfs object
 * @start: start block number of the bio
 * @nr_vecs: request size of page vector.
 *
 * Return Value: On success, pointer to the struct bio is returned.
 * On error, NULL is returned.
 */
static struct bio *nilfs_alloc_seg_bio(struct the_nilfs *nilfs, sector_t start,
				       int nr_vecs)
{
	struct bio *bio;

	bio = bio_alloc(GFP_NOIO, nr_vecs);
	if (bio == NULL) {
		while (!bio && (nr_vecs >>= 1))
			bio = bio_alloc(GFP_NOIO, nr_vecs);
	}
	if (likely(bio)) {
		bio->bi_bdev = nilfs->ns_bdev;
		bio->bi_iter.bi_sector =
			start << (nilfs->ns_blocksize_bits - 9);
	}
	return bio;
}

static void nilfs_segbuf_prepare_write(struct nilfs_segment_buffer *segbuf,
				       struct nilfs_write_info *wi)
{
	wi->bio = NULL;
	wi->rest_blocks = segbuf->sb_sum.nblocks;
	wi->max_pages = bio_get_nr_vecs(wi->nilfs->ns_bdev);
	wi->nr_vecs = min(wi->max_pages, wi->rest_blocks);
	wi->start = wi->end = 0;
	wi->blocknr = segbuf->sb_pseg_start;
}

static int nilfs_segbuf_submit_bh(struct nilfs_segment_buffer *segbuf,
				  struct nilfs_write_info *wi,
				  struct buffer_head *bh, int mode)
{
	int len, err;

	BUG_ON(wi->nr_vecs <= 0);
 repeat:
	if (!wi->bio) {
		wi->bio = nilfs_alloc_seg_bio(wi->nilfs, wi->blocknr + wi->end,
					      wi->nr_vecs);
		if (unlikely(!wi->bio))
			return -ENOMEM;
	}

	len = bio_add_page(wi->bio, bh->b_page, bh->b_size, bh_offset(bh));
	if (len == bh->b_size) {
		wi->end++;
		return 0;
	}
	/* bio is FULL */
	err = nilfs_segbuf_submit_bio(segbuf, wi, mode);
	/* never submit current bh */
	if (likely(!err))
		goto repeat;
	return err;
}

/**
 * nilfs_segbuf_write - submit write requests of a log
 * @segbuf: buffer storing a log to be written
 * @nilfs: nilfs object
 *
 * Return Value: On Success, 0 is returned. On Error, one of the following
 * negative error code is returned.
 *
 * %-EIO - I/O error
 *
 * %-ENOMEM - Insufficient memory available.
 */
static int nilfs_segbuf_write(struct nilfs_segment_buffer *segbuf,
			      struct the_nilfs *nilfs)
{
	struct nilfs_write_info wi;
	struct buffer_head *bh;
	int res = 0, rw = WRITE;

	wi.nilfs = nilfs;
	nilfs_segbuf_prepare_write(segbuf, &wi);

	list_for_each_entry(bh, &segbuf->sb_segsum_buffers, b_assoc_buffers) {
		res = nilfs_segbuf_submit_bh(segbuf, &wi, bh, rw);
		if (unlikely(res))
			goto failed_bio;
	}

	list_for_each_entry(bh, &segbuf->sb_payload_buffers, b_assoc_buffers) {
		res = nilfs_segbuf_submit_bh(segbuf, &wi, bh, rw);
		if (unlikely(res))
			goto failed_bio;
	}

	if (wi.bio) {
		/*
		 * Last BIO is always sent through the following
		 * submission.
		 */
		rw |= REQ_SYNC;
		res = nilfs_segbuf_submit_bio(segbuf, &wi, rw);
	}

 failed_bio:
	return res;
}

/**
 * nilfs_segbuf_wait - wait for completion of requested BIOs
 * @segbuf: segment buffer
 *
 * Return Value: On Success, 0 is returned. On Error, one of the following
 * negative error code is returned.
 *
 * %-EIO - I/O error
 */
static int nilfs_segbuf_wait(struct nilfs_segment_buffer *segbuf)
{
	int err = 0;

	if (!segbuf->sb_nbio)
		return 0;

	do {
		wait_for_completion(&segbuf->sb_bio_event);
	} while (--segbuf->sb_nbio > 0);

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