2009-04-07 02:01:36 +00:00
|
|
|
/*
|
|
|
|
* 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>
|
2009-11-28 16:17:31 +00:00
|
|
|
#include <linux/backing-dev.h>
|
include cleanup: Update gfp.h and slab.h includes to prepare for breaking implicit slab.h inclusion from percpu.h
percpu.h is included by sched.h and module.h and thus ends up being
included when building most .c files. percpu.h includes slab.h which
in turn includes gfp.h making everything defined by the two files
universally available and complicating inclusion dependencies.
percpu.h -> slab.h dependency is about to be removed. Prepare for
this change by updating users of gfp and slab facilities include those
headers directly instead of assuming availability. As this conversion
needs to touch large number of source files, the following script is
used as the basis of conversion.
http://userweb.kernel.org/~tj/misc/slabh-sweep.py
The script does the followings.
* Scan files for gfp and slab usages and update includes such that
only the necessary includes are there. ie. if only gfp is used,
gfp.h, if slab is used, slab.h.
* When the script inserts a new include, it looks at the include
blocks and try to put the new include such that its order conforms
to its surrounding. It's put in the include block which contains
core kernel includes, in the same order that the rest are ordered -
alphabetical, Christmas tree, rev-Xmas-tree or at the end if there
doesn't seem to be any matching order.
* If the script can't find a place to put a new include (mostly
because the file doesn't have fitting include block), it prints out
an error message indicating which .h file needs to be added to the
file.
The conversion was done in the following steps.
1. The initial automatic conversion of all .c files updated slightly
over 4000 files, deleting around 700 includes and adding ~480 gfp.h
and ~3000 slab.h inclusions. The script emitted errors for ~400
files.
2. Each error was manually checked. Some didn't need the inclusion,
some needed manual addition while adding it to implementation .h or
embedding .c file was more appropriate for others. This step added
inclusions to around 150 files.
3. The script was run again and the output was compared to the edits
from #2 to make sure no file was left behind.
4. Several build tests were done and a couple of problems were fixed.
e.g. lib/decompress_*.c used malloc/free() wrappers around slab
APIs requiring slab.h to be added manually.
5. The script was run on all .h files but without automatically
editing them as sprinkling gfp.h and slab.h inclusions around .h
files could easily lead to inclusion dependency hell. Most gfp.h
inclusion directives were ignored as stuff from gfp.h was usually
wildly available and often used in preprocessor macros. Each
slab.h inclusion directive was examined and added manually as
necessary.
6. percpu.h was updated not to include slab.h.
7. Build test were done on the following configurations and failures
were fixed. CONFIG_GCOV_KERNEL was turned off for all tests (as my
distributed build env didn't work with gcov compiles) and a few
more options had to be turned off depending on archs to make things
build (like ipr on powerpc/64 which failed due to missing writeq).
* x86 and x86_64 UP and SMP allmodconfig and a custom test config.
* powerpc and powerpc64 SMP allmodconfig
* sparc and sparc64 SMP allmodconfig
* ia64 SMP allmodconfig
* s390 SMP allmodconfig
* alpha SMP allmodconfig
* um on x86_64 SMP allmodconfig
8. percpu.h modifications were reverted so that it could be applied as
a separate patch and serve as bisection point.
Given the fact that I had only a couple of failures from tests on step
6, I'm fairly confident about the coverage of this conversion patch.
If there is a breakage, it's likely to be something in one of the arch
headers which should be easily discoverable easily on most builds of
the specific arch.
Signed-off-by: Tejun Heo <tj@kernel.org>
Guess-its-ok-by: Christoph Lameter <cl@linux-foundation.org>
Cc: Ingo Molnar <mingo@redhat.com>
Cc: Lee Schermerhorn <Lee.Schermerhorn@hp.com>
2010-03-24 08:04:11 +00:00
|
|
|
#include <linux/slab.h>
|
2009-04-07 02:01:36 +00:00
|
|
|
#include "page.h"
|
|
|
|
#include "segbuf.h"
|
|
|
|
|
|
|
|
|
2009-11-28 16:17:31 +00:00
|
|
|
struct nilfs_write_info {
|
|
|
|
struct the_nilfs *nilfs;
|
|
|
|
struct bio *bio;
|
2010-03-13 18:55:56 +00:00
|
|
|
int start, end; /* The region to be submitted */
|
2009-11-28 16:17:31 +00:00
|
|
|
int rest_blocks;
|
|
|
|
int max_pages;
|
|
|
|
int nr_vecs;
|
|
|
|
sector_t blocknr;
|
|
|
|
};
|
|
|
|
|
2009-12-16 15:55:40 +00:00
|
|
|
static int nilfs_segbuf_write(struct nilfs_segment_buffer *segbuf,
|
|
|
|
struct the_nilfs *nilfs);
|
|
|
|
static int nilfs_segbuf_wait(struct nilfs_segment_buffer *segbuf);
|
|
|
|
|
2009-04-07 02:01:36 +00:00
|
|
|
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);
|
2010-03-22 16:15:31 +00:00
|
|
|
segbuf->sb_super_root = NULL;
|
2009-11-24 16:04:21 +00:00
|
|
|
|
|
|
|
init_completion(&segbuf->sb_bio_event);
|
|
|
|
atomic_set(&segbuf->sb_err, 0);
|
|
|
|
segbuf->sb_nbio = 0;
|
|
|
|
|
2009-04-07 02:01:36 +00:00
|
|
|
return segbuf;
|
|
|
|
}
|
|
|
|
|
|
|
|
void nilfs_segbuf_free(struct nilfs_segment_buffer *segbuf)
|
|
|
|
{
|
|
|
|
kmem_cache_free(nilfs_segbuf_cachep, segbuf);
|
|
|
|
}
|
|
|
|
|
2009-04-07 02:01:58 +00:00
|
|
|
void nilfs_segbuf_map(struct nilfs_segment_buffer *segbuf, __u64 segnum,
|
2009-04-07 02:01:36 +00:00
|
|
|
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;
|
|
|
|
}
|
|
|
|
|
2009-11-29 14:03:04 +00:00
|
|
|
/**
|
|
|
|
* 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;
|
|
|
|
}
|
|
|
|
|
2009-04-07 02:01:36 +00:00
|
|
|
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)
|
|
|
|
{
|
|
|
|
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;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
2010-03-13 18:32:40 +00:00
|
|
|
* Setup segment summary
|
2009-04-07 02:01:36 +00:00
|
|
|
*/
|
|
|
|
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;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* CRC calculation routines
|
|
|
|
*/
|
2010-03-22 16:50:38 +00:00
|
|
|
static void
|
|
|
|
nilfs_segbuf_fill_in_segsum_crc(struct nilfs_segment_buffer *segbuf, u32 seed)
|
2009-04-07 02:01:36 +00:00
|
|
|
{
|
|
|
|
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);
|
|
|
|
}
|
|
|
|
|
2010-03-22 16:50:38 +00:00
|
|
|
static void nilfs_segbuf_fill_in_data_crc(struct nilfs_segment_buffer *segbuf,
|
|
|
|
u32 seed)
|
2009-04-07 02:01:36 +00:00
|
|
|
{
|
|
|
|
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, KM_USER0);
|
|
|
|
crc = crc32_le(crc, kaddr + bh_offset(bh), bh->b_size);
|
|
|
|
kunmap_atomic(kaddr, KM_USER0);
|
|
|
|
}
|
|
|
|
raw_sum->ss_datasum = cpu_to_le32(crc);
|
|
|
|
}
|
|
|
|
|
2010-03-22 16:50:38 +00:00
|
|
|
static void
|
|
|
|
nilfs_segbuf_fill_in_super_root_crc(struct nilfs_segment_buffer *segbuf,
|
|
|
|
u32 seed)
|
|
|
|
{
|
|
|
|
struct nilfs_super_root *raw_sr;
|
|
|
|
u32 crc;
|
|
|
|
|
|
|
|
raw_sr = (struct nilfs_super_root *)segbuf->sb_super_root->b_data;
|
|
|
|
crc = crc32_le(seed,
|
|
|
|
(unsigned char *)raw_sr + sizeof(raw_sr->sr_sum),
|
|
|
|
NILFS_SR_BYTES - sizeof(raw_sr->sr_sum));
|
|
|
|
raw_sr->sr_sum = cpu_to_le32(crc);
|
|
|
|
}
|
|
|
|
|
2009-11-29 07:51:16 +00:00
|
|
|
static void nilfs_release_buffers(struct list_head *list)
|
2009-04-07 02:01:36 +00:00
|
|
|
{
|
|
|
|
struct buffer_head *bh, *n;
|
|
|
|
|
|
|
|
list_for_each_entry_safe(bh, n, list, b_assoc_buffers) {
|
|
|
|
list_del_init(&bh->b_assoc_buffers);
|
|
|
|
if (buffer_nilfs_allocated(bh)) {
|
|
|
|
struct page *clone_page = bh->b_page;
|
|
|
|
|
|
|
|
/* remove clone page */
|
|
|
|
brelse(bh);
|
|
|
|
page_cache_release(clone_page); /* for each bh */
|
|
|
|
if (page_count(clone_page) <= 2) {
|
|
|
|
lock_page(clone_page);
|
|
|
|
nilfs_free_private_page(clone_page);
|
|
|
|
}
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
brelse(bh);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2009-11-29 07:51:16 +00:00
|
|
|
static void nilfs_segbuf_clear(struct nilfs_segment_buffer *segbuf)
|
|
|
|
{
|
|
|
|
nilfs_release_buffers(&segbuf->sb_segsum_buffers);
|
|
|
|
nilfs_release_buffers(&segbuf->sb_payload_buffers);
|
2010-03-22 16:15:31 +00:00
|
|
|
segbuf->sb_super_root = NULL;
|
2009-11-29 07:51:16 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* 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);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2009-12-16 15:55:40 +00:00
|
|
|
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;
|
|
|
|
}
|
|
|
|
|
2009-11-29 07:51:16 +00:00
|
|
|
int nilfs_wait_on_logs(struct list_head *logs)
|
|
|
|
{
|
|
|
|
struct nilfs_segment_buffer *segbuf;
|
2010-03-22 10:33:43 +00:00
|
|
|
int err, ret = 0;
|
2009-11-29 07:51:16 +00:00
|
|
|
|
|
|
|
list_for_each_entry(segbuf, logs, sb_list) {
|
|
|
|
err = nilfs_segbuf_wait(segbuf);
|
2010-03-22 10:33:43 +00:00
|
|
|
if (err && !ret)
|
|
|
|
ret = err;
|
2009-11-29 07:51:16 +00:00
|
|
|
}
|
2010-03-22 10:33:43 +00:00
|
|
|
return ret;
|
2009-11-29 07:51:16 +00:00
|
|
|
}
|
|
|
|
|
2010-03-22 16:50:38 +00:00
|
|
|
/**
|
|
|
|
* 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);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2009-04-07 02:01:36 +00:00
|
|
|
/*
|
|
|
|
* BIO operations
|
|
|
|
*/
|
|
|
|
static void nilfs_end_bio_write(struct bio *bio, int err)
|
|
|
|
{
|
|
|
|
const int uptodate = test_bit(BIO_UPTODATE, &bio->bi_flags);
|
2009-11-24 16:04:21 +00:00
|
|
|
struct nilfs_segment_buffer *segbuf = bio->bi_private;
|
2009-04-07 02:01:36 +00:00
|
|
|
|
|
|
|
if (err == -EOPNOTSUPP) {
|
|
|
|
set_bit(BIO_EOPNOTSUPP, &bio->bi_flags);
|
|
|
|
bio_put(bio);
|
|
|
|
/* to be detected by submit_seg_bio() */
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!uptodate)
|
2009-11-24 16:04:21 +00:00
|
|
|
atomic_inc(&segbuf->sb_err);
|
2009-04-07 02:01:36 +00:00
|
|
|
|
|
|
|
bio_put(bio);
|
2009-11-24 16:04:21 +00:00
|
|
|
complete(&segbuf->sb_bio_event);
|
2009-04-07 02:01:36 +00:00
|
|
|
}
|
|
|
|
|
2009-11-24 16:04:21 +00:00
|
|
|
static int nilfs_segbuf_submit_bio(struct nilfs_segment_buffer *segbuf,
|
|
|
|
struct nilfs_write_info *wi, int mode)
|
2009-04-07 02:01:36 +00:00
|
|
|
{
|
|
|
|
struct bio *bio = wi->bio;
|
|
|
|
int err;
|
|
|
|
|
2009-11-28 16:17:31 +00:00
|
|
|
if (segbuf->sb_nbio > 0 && bdi_write_congested(wi->nilfs->ns_bdi)) {
|
2009-11-24 16:04:21 +00:00
|
|
|
wait_for_completion(&segbuf->sb_bio_event);
|
|
|
|
segbuf->sb_nbio--;
|
|
|
|
if (unlikely(atomic_read(&segbuf->sb_err))) {
|
2009-04-07 02:01:36 +00:00
|
|
|
bio_put(bio);
|
|
|
|
err = -EIO;
|
|
|
|
goto failed;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
bio->bi_end_io = nilfs_end_bio_write;
|
2009-11-24 16:04:21 +00:00
|
|
|
bio->bi_private = segbuf;
|
2009-04-07 02:01:36 +00:00
|
|
|
bio_get(bio);
|
|
|
|
submit_bio(mode, bio);
|
|
|
|
if (bio_flagged(bio, BIO_EOPNOTSUPP)) {
|
|
|
|
bio_put(bio);
|
|
|
|
err = -EOPNOTSUPP;
|
|
|
|
goto failed;
|
|
|
|
}
|
2009-11-24 16:04:21 +00:00
|
|
|
segbuf->sb_nbio++;
|
2009-04-07 02:01:36 +00:00
|
|
|
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;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
2009-11-28 16:17:31 +00:00
|
|
|
* nilfs_alloc_seg_bio - allocate a new bio for writing log
|
|
|
|
* @nilfs: nilfs object
|
|
|
|
* @start: start block number of the bio
|
2009-04-07 02:01:36 +00:00
|
|
|
* @nr_vecs: request size of page vector.
|
|
|
|
*
|
|
|
|
* Return Value: On success, pointer to the struct bio is returned.
|
|
|
|
* On error, NULL is returned.
|
|
|
|
*/
|
2009-11-28 16:17:31 +00:00
|
|
|
static struct bio *nilfs_alloc_seg_bio(struct the_nilfs *nilfs, sector_t start,
|
2009-04-07 02:01:36 +00:00
|
|
|
int nr_vecs)
|
|
|
|
{
|
|
|
|
struct bio *bio;
|
|
|
|
|
2009-06-19 06:25:42 +00:00
|
|
|
bio = bio_alloc(GFP_NOIO, nr_vecs);
|
2009-04-07 02:01:36 +00:00
|
|
|
if (bio == NULL) {
|
|
|
|
while (!bio && (nr_vecs >>= 1))
|
2009-06-19 06:25:42 +00:00
|
|
|
bio = bio_alloc(GFP_NOIO, nr_vecs);
|
2009-04-07 02:01:36 +00:00
|
|
|
}
|
|
|
|
if (likely(bio)) {
|
2009-11-28 16:17:31 +00:00
|
|
|
bio->bi_bdev = nilfs->ns_bdev;
|
|
|
|
bio->bi_sector = start << (nilfs->ns_blocksize_bits - 9);
|
2009-04-07 02:01:36 +00:00
|
|
|
}
|
|
|
|
return bio;
|
|
|
|
}
|
|
|
|
|
2009-11-28 16:17:31 +00:00
|
|
|
static void nilfs_segbuf_prepare_write(struct nilfs_segment_buffer *segbuf,
|
|
|
|
struct nilfs_write_info *wi)
|
2009-04-07 02:01:36 +00:00
|
|
|
{
|
|
|
|
wi->bio = NULL;
|
|
|
|
wi->rest_blocks = segbuf->sb_sum.nblocks;
|
2009-11-28 16:17:31 +00:00
|
|
|
wi->max_pages = bio_get_nr_vecs(wi->nilfs->ns_bdev);
|
2009-04-07 02:01:36 +00:00
|
|
|
wi->nr_vecs = min(wi->max_pages, wi->rest_blocks);
|
|
|
|
wi->start = wi->end = 0;
|
|
|
|
wi->blocknr = segbuf->sb_pseg_start;
|
|
|
|
}
|
|
|
|
|
2009-11-24 16:04:21 +00:00
|
|
|
static int nilfs_segbuf_submit_bh(struct nilfs_segment_buffer *segbuf,
|
|
|
|
struct nilfs_write_info *wi,
|
|
|
|
struct buffer_head *bh, int mode)
|
2009-04-07 02:01:36 +00:00
|
|
|
{
|
|
|
|
int len, err;
|
|
|
|
|
|
|
|
BUG_ON(wi->nr_vecs <= 0);
|
|
|
|
repeat:
|
|
|
|
if (!wi->bio) {
|
2009-11-28 16:17:31 +00:00
|
|
|
wi->bio = nilfs_alloc_seg_bio(wi->nilfs, wi->blocknr + wi->end,
|
2009-04-07 02:01:36 +00:00
|
|
|
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 */
|
2009-11-24 16:04:21 +00:00
|
|
|
err = nilfs_segbuf_submit_bio(segbuf, wi, mode);
|
2009-04-07 02:01:36 +00:00
|
|
|
/* never submit current bh */
|
|
|
|
if (likely(!err))
|
|
|
|
goto repeat;
|
|
|
|
return err;
|
|
|
|
}
|
|
|
|
|
2009-11-28 16:17:31 +00:00
|
|
|
/**
|
|
|
|
* 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.
|
|
|
|
*/
|
2010-03-13 17:01:51 +00:00
|
|
|
static int nilfs_segbuf_write(struct nilfs_segment_buffer *segbuf,
|
|
|
|
struct the_nilfs *nilfs)
|
2009-04-07 02:01:36 +00:00
|
|
|
{
|
2009-11-28 16:17:31 +00:00
|
|
|
struct nilfs_write_info wi;
|
2009-04-07 02:01:36 +00:00
|
|
|
struct buffer_head *bh;
|
2009-11-29 10:14:17 +00:00
|
|
|
int res = 0, rw = WRITE;
|
2009-04-07 02:01:36 +00:00
|
|
|
|
2009-11-28 16:17:31 +00:00
|
|
|
wi.nilfs = nilfs;
|
|
|
|
nilfs_segbuf_prepare_write(segbuf, &wi);
|
|
|
|
|
2009-04-07 02:01:36 +00:00
|
|
|
list_for_each_entry(bh, &segbuf->sb_segsum_buffers, b_assoc_buffers) {
|
2009-11-28 16:17:31 +00:00
|
|
|
res = nilfs_segbuf_submit_bh(segbuf, &wi, bh, rw);
|
2009-04-07 02:01:36 +00:00
|
|
|
if (unlikely(res))
|
|
|
|
goto failed_bio;
|
|
|
|
}
|
|
|
|
|
|
|
|
list_for_each_entry(bh, &segbuf->sb_payload_buffers, b_assoc_buffers) {
|
2009-11-28 16:17:31 +00:00
|
|
|
res = nilfs_segbuf_submit_bh(segbuf, &wi, bh, rw);
|
2009-04-07 02:01:36 +00:00
|
|
|
if (unlikely(res))
|
|
|
|
goto failed_bio;
|
|
|
|
}
|
|
|
|
|
2009-11-28 16:17:31 +00:00
|
|
|
if (wi.bio) {
|
2009-04-07 02:01:36 +00:00
|
|
|
/*
|
|
|
|
* Last BIO is always sent through the following
|
|
|
|
* submission.
|
|
|
|
*/
|
2009-05-17 01:57:43 +00:00
|
|
|
rw |= (1 << BIO_RW_SYNCIO) | (1 << BIO_RW_UNPLUG);
|
2009-11-28 16:17:31 +00:00
|
|
|
res = nilfs_segbuf_submit_bio(segbuf, &wi, rw);
|
2009-04-07 02:01:36 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
failed_bio:
|
2009-11-29 10:14:17 +00:00
|
|
|
return res;
|
2009-04-07 02:01:36 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* nilfs_segbuf_wait - wait for completion of requested BIOs
|
2009-11-24 16:04:21 +00:00
|
|
|
* @segbuf: segment buffer
|
2009-04-07 02:01:36 +00:00
|
|
|
*
|
|
|
|
* Return Value: On Success, 0 is returned. On Error, one of the following
|
|
|
|
* negative error code is returned.
|
|
|
|
*
|
|
|
|
* %-EIO - I/O error
|
|
|
|
*/
|
2010-03-13 17:01:51 +00:00
|
|
|
static int nilfs_segbuf_wait(struct nilfs_segment_buffer *segbuf)
|
2009-04-07 02:01:36 +00:00
|
|
|
{
|
|
|
|
int err = 0;
|
|
|
|
|
2009-11-24 16:04:21 +00:00
|
|
|
if (!segbuf->sb_nbio)
|
2009-04-07 02:01:36 +00:00
|
|
|
return 0;
|
|
|
|
|
|
|
|
do {
|
2009-11-24 16:04:21 +00:00
|
|
|
wait_for_completion(&segbuf->sb_bio_event);
|
|
|
|
} while (--segbuf->sb_nbio > 0);
|
2009-04-07 02:01:36 +00:00
|
|
|
|
2009-11-24 16:04:21 +00:00
|
|
|
if (unlikely(atomic_read(&segbuf->sb_err) > 0)) {
|
2009-04-07 02:01:36 +00:00
|
|
|
printk(KERN_ERR "NILFS: IO error writing segment\n");
|
|
|
|
err = -EIO;
|
|
|
|
}
|
|
|
|
return err;
|
|
|
|
}
|