2009-04-07 10:01:40 +08:00
|
|
|
/*
|
2009-04-07 10:01:45 +08:00
|
|
|
* gcinode.c - dummy inodes to buffer blocks for garbage collection
|
2009-04-07 10:01:40 +08:00
|
|
|
*
|
|
|
|
* 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 Seiji Kihara <kihara@osrg.net>, Amagai Yoshiji <amagai@osrg.net>,
|
|
|
|
* and Ryusuke Konishi <ryusuke@osrg.net>.
|
|
|
|
* Revised by Ryusuke Konishi <ryusuke@osrg.net>.
|
|
|
|
*
|
|
|
|
*/
|
2009-04-07 10:01:45 +08:00
|
|
|
/*
|
|
|
|
* This file adds the cache of on-disk blocks to be moved in garbage
|
|
|
|
* collection. The disk blocks are held with dummy inodes (called
|
|
|
|
* gcinodes), and this file provides lookup function of the dummy
|
|
|
|
* inodes and their buffer read function.
|
|
|
|
*
|
2010-03-14 02:32:40 +08:00
|
|
|
* Since NILFS2 keeps up multiple checkpoints/snapshots across GC, it
|
2009-04-07 10:01:45 +08:00
|
|
|
* has to treat blocks that belong to a same file but have different
|
|
|
|
* checkpoint numbers. To avoid interference among generations, dummy
|
2010-03-14 02:32:40 +08:00
|
|
|
* inodes are managed separately from actual inodes, and their lookup
|
2009-04-07 10:01:45 +08:00
|
|
|
* function (nilfs_gc_iget) is designed to be specified with a
|
|
|
|
* checkpoint number argument as well as an inode number.
|
|
|
|
*
|
|
|
|
* Buffers and pages held by the dummy inodes will be released each
|
|
|
|
* time after they are copied to a new log. Dirty blocks made on the
|
|
|
|
* current generation and the blocks to be moved by GC never overlap
|
|
|
|
* because the dirty blocks make a new generation; they rather must be
|
|
|
|
* written individually.
|
|
|
|
*/
|
2009-04-07 10:01:40 +08:00
|
|
|
|
|
|
|
#include <linux/buffer_head.h>
|
|
|
|
#include <linux/mpage.h>
|
|
|
|
#include <linux/hash.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 16:04:11 +08:00
|
|
|
#include <linux/slab.h>
|
2009-04-07 10:01:40 +08:00
|
|
|
#include <linux/swap.h>
|
|
|
|
#include "nilfs.h"
|
|
|
|
#include "page.h"
|
|
|
|
#include "mdt.h"
|
|
|
|
#include "dat.h"
|
|
|
|
#include "ifile.h"
|
|
|
|
|
2009-09-22 08:01:10 +08:00
|
|
|
static const struct address_space_operations def_gcinode_aops = {
|
2009-05-27 21:44:34 +08:00
|
|
|
.sync_page = block_sync_page,
|
|
|
|
};
|
2009-04-07 10:01:40 +08:00
|
|
|
|
|
|
|
/*
|
|
|
|
* nilfs_gccache_submit_read_data() - add data buffer and submit read request
|
|
|
|
* @inode - gc inode
|
|
|
|
* @blkoff - dummy offset treated as the key for the page cache
|
|
|
|
* @pbn - physical block number of the block
|
|
|
|
* @vbn - virtual block number of the block, 0 for non-virtual block
|
|
|
|
* @out_bh - indirect pointer to a buffer_head struct to receive the results
|
|
|
|
*
|
|
|
|
* Description: nilfs_gccache_submit_read_data() registers the data buffer
|
|
|
|
* specified by @pbn to the GC pagecache with the key @blkoff.
|
|
|
|
* This function sets @vbn (@pbn if @vbn is zero) in b_blocknr of the buffer.
|
|
|
|
*
|
|
|
|
* Return Value: On success, 0 is returned. On Error, one of the following
|
|
|
|
* negative error code is returned.
|
|
|
|
*
|
|
|
|
* %-EIO - I/O error.
|
|
|
|
*
|
|
|
|
* %-ENOMEM - Insufficient amount of memory available.
|
|
|
|
*
|
|
|
|
* %-ENOENT - The block specified with @pbn does not exist.
|
|
|
|
*/
|
|
|
|
int nilfs_gccache_submit_read_data(struct inode *inode, sector_t blkoff,
|
|
|
|
sector_t pbn, __u64 vbn,
|
|
|
|
struct buffer_head **out_bh)
|
|
|
|
{
|
|
|
|
struct buffer_head *bh;
|
|
|
|
int err;
|
|
|
|
|
|
|
|
bh = nilfs_grab_buffer(inode, inode->i_mapping, blkoff, 0);
|
|
|
|
if (unlikely(!bh))
|
|
|
|
return -ENOMEM;
|
|
|
|
|
|
|
|
if (buffer_uptodate(bh))
|
|
|
|
goto out;
|
|
|
|
|
|
|
|
if (pbn == 0) {
|
|
|
|
struct inode *dat_inode = NILFS_I_NILFS(inode)->ns_dat;
|
|
|
|
/* use original dat, not gc dat. */
|
|
|
|
err = nilfs_dat_translate(dat_inode, vbn, &pbn);
|
|
|
|
if (unlikely(err)) { /* -EIO, -ENOMEM, -ENOENT */
|
|
|
|
brelse(bh);
|
|
|
|
goto failed;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
lock_buffer(bh);
|
|
|
|
if (buffer_uptodate(bh)) {
|
|
|
|
unlock_buffer(bh);
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!buffer_mapped(bh)) {
|
|
|
|
bh->b_bdev = NILFS_I_NILFS(inode)->ns_bdev;
|
|
|
|
set_buffer_mapped(bh);
|
|
|
|
}
|
|
|
|
bh->b_blocknr = pbn;
|
|
|
|
bh->b_end_io = end_buffer_read_sync;
|
|
|
|
get_bh(bh);
|
|
|
|
submit_bh(READ, bh);
|
|
|
|
if (vbn)
|
|
|
|
bh->b_blocknr = vbn;
|
|
|
|
out:
|
|
|
|
err = 0;
|
|
|
|
*out_bh = bh;
|
|
|
|
|
|
|
|
failed:
|
|
|
|
unlock_page(bh->b_page);
|
|
|
|
page_cache_release(bh->b_page);
|
|
|
|
return err;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* nilfs_gccache_submit_read_node() - add node buffer and submit read request
|
|
|
|
* @inode - gc inode
|
|
|
|
* @pbn - physical block number for the block
|
|
|
|
* @vbn - virtual block number for the block
|
|
|
|
* @out_bh - indirect pointer to a buffer_head struct to receive the results
|
|
|
|
*
|
|
|
|
* Description: nilfs_gccache_submit_read_node() registers the node buffer
|
|
|
|
* specified by @vbn to the GC pagecache. @pbn can be supplied by the
|
|
|
|
* caller to avoid translation of the disk block address.
|
|
|
|
*
|
|
|
|
* Return Value: On success, 0 is returned. On Error, one of the following
|
|
|
|
* negative error code is returned.
|
|
|
|
*
|
|
|
|
* %-EIO - I/O error.
|
|
|
|
*
|
|
|
|
* %-ENOMEM - Insufficient amount of memory available.
|
|
|
|
*/
|
|
|
|
int nilfs_gccache_submit_read_node(struct inode *inode, sector_t pbn,
|
|
|
|
__u64 vbn, struct buffer_head **out_bh)
|
|
|
|
{
|
|
|
|
int ret = nilfs_btnode_submit_block(&NILFS_I(inode)->i_btnode_cache,
|
2009-11-13 15:30:41 +08:00
|
|
|
vbn ? : pbn, pbn, out_bh);
|
2009-04-07 10:01:40 +08:00
|
|
|
if (ret == -EEXIST) /* internal code (cache hit) */
|
|
|
|
ret = 0;
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
int nilfs_gccache_wait_and_mark_dirty(struct buffer_head *bh)
|
|
|
|
{
|
|
|
|
wait_on_buffer(bh);
|
|
|
|
if (!buffer_uptodate(bh))
|
|
|
|
return -EIO;
|
|
|
|
if (buffer_dirty(bh))
|
|
|
|
return -EEXIST;
|
|
|
|
|
|
|
|
if (buffer_nilfs_node(bh))
|
|
|
|
nilfs_btnode_mark_dirty(bh);
|
|
|
|
else
|
|
|
|
nilfs_mdt_mark_buffer_dirty(bh);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* nilfs_init_gccache() - allocate and initialize gc_inode hash table
|
|
|
|
* @nilfs - the_nilfs
|
|
|
|
*
|
|
|
|
* Return Value: On success, 0.
|
|
|
|
* On error, a negative error code is returned.
|
|
|
|
*/
|
|
|
|
int nilfs_init_gccache(struct the_nilfs *nilfs)
|
|
|
|
{
|
|
|
|
int loop;
|
|
|
|
|
|
|
|
BUG_ON(nilfs->ns_gc_inodes_h);
|
|
|
|
|
|
|
|
INIT_LIST_HEAD(&nilfs->ns_gc_inodes);
|
|
|
|
|
|
|
|
nilfs->ns_gc_inodes_h =
|
|
|
|
kmalloc(sizeof(struct hlist_head) * NILFS_GCINODE_HASH_SIZE,
|
|
|
|
GFP_NOFS);
|
|
|
|
if (nilfs->ns_gc_inodes_h == NULL)
|
|
|
|
return -ENOMEM;
|
|
|
|
|
|
|
|
for (loop = 0; loop < NILFS_GCINODE_HASH_SIZE; loop++)
|
|
|
|
INIT_HLIST_HEAD(&nilfs->ns_gc_inodes_h[loop]);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* nilfs_destroy_gccache() - free gc_inode hash table
|
|
|
|
* @nilfs - the nilfs
|
|
|
|
*/
|
|
|
|
void nilfs_destroy_gccache(struct the_nilfs *nilfs)
|
|
|
|
{
|
|
|
|
if (nilfs->ns_gc_inodes_h) {
|
|
|
|
nilfs_remove_all_gcinode(nilfs);
|
|
|
|
kfree(nilfs->ns_gc_inodes_h);
|
|
|
|
nilfs->ns_gc_inodes_h = NULL;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
static struct inode *alloc_gcinode(struct the_nilfs *nilfs, ino_t ino,
|
|
|
|
__u64 cno)
|
|
|
|
{
|
2009-11-12 21:42:04 +08:00
|
|
|
struct inode *inode;
|
2009-04-07 10:01:40 +08:00
|
|
|
struct nilfs_inode_info *ii;
|
|
|
|
|
2009-11-12 21:42:04 +08:00
|
|
|
inode = nilfs_mdt_new_common(nilfs, NULL, ino, GFP_NOFS, 0);
|
2009-04-07 10:01:40 +08:00
|
|
|
if (!inode)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
inode->i_op = NULL;
|
|
|
|
inode->i_fop = NULL;
|
|
|
|
inode->i_mapping->a_ops = &def_gcinode_aops;
|
|
|
|
|
|
|
|
ii = NILFS_I(inode);
|
|
|
|
ii->i_cno = cno;
|
|
|
|
ii->i_flags = 0;
|
|
|
|
ii->i_state = 1 << NILFS_I_GCINODE;
|
|
|
|
ii->i_bh = NULL;
|
|
|
|
nilfs_bmap_init_gc(ii->i_bmap);
|
|
|
|
|
|
|
|
return inode;
|
|
|
|
}
|
|
|
|
|
|
|
|
static unsigned long ihash(ino_t ino, __u64 cno)
|
|
|
|
{
|
|
|
|
return hash_long((unsigned long)((ino << 2) + cno),
|
|
|
|
NILFS_GCINODE_HASH_BITS);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* nilfs_gc_iget() - find or create gc inode with specified (ino,cno)
|
|
|
|
*/
|
|
|
|
struct inode *nilfs_gc_iget(struct the_nilfs *nilfs, ino_t ino, __u64 cno)
|
|
|
|
{
|
|
|
|
struct hlist_head *head = nilfs->ns_gc_inodes_h + ihash(ino, cno);
|
|
|
|
struct hlist_node *node;
|
|
|
|
struct inode *inode;
|
|
|
|
|
|
|
|
hlist_for_each_entry(inode, node, head, i_hash) {
|
|
|
|
if (inode->i_ino == ino && NILFS_I(inode)->i_cno == cno)
|
|
|
|
return inode;
|
|
|
|
}
|
|
|
|
|
|
|
|
inode = alloc_gcinode(nilfs, ino, cno);
|
|
|
|
if (likely(inode)) {
|
|
|
|
hlist_add_head(&inode->i_hash, head);
|
|
|
|
list_add(&NILFS_I(inode)->i_dirty, &nilfs->ns_gc_inodes);
|
|
|
|
}
|
|
|
|
return inode;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* nilfs_clear_gcinode() - clear and free a gc inode
|
|
|
|
*/
|
|
|
|
void nilfs_clear_gcinode(struct inode *inode)
|
|
|
|
{
|
|
|
|
nilfs_mdt_destroy(inode);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* nilfs_remove_all_gcinode() - remove all inodes from the_nilfs
|
|
|
|
*/
|
|
|
|
void nilfs_remove_all_gcinode(struct the_nilfs *nilfs)
|
|
|
|
{
|
|
|
|
struct hlist_head *head = nilfs->ns_gc_inodes_h;
|
|
|
|
struct hlist_node *node, *n;
|
|
|
|
struct inode *inode;
|
|
|
|
int loop;
|
|
|
|
|
|
|
|
for (loop = 0; loop < NILFS_GCINODE_HASH_SIZE; loop++, head++) {
|
|
|
|
hlist_for_each_entry_safe(inode, node, n, head, i_hash) {
|
|
|
|
hlist_del_init(&inode->i_hash);
|
|
|
|
list_del_init(&NILFS_I(inode)->i_dirty);
|
|
|
|
nilfs_clear_gcinode(inode); /* might sleep */
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|