blob: 693aded72498e2019fd36e96630b114db89ea172 [file] [log] [blame]
Ryusuke Konishia3d93f72009-04-06 19:01:40 -07001/*
Ryusuke Konishi047180f2009-04-06 19:01:45 -07002 * gcinode.c - dummy inodes to buffer blocks for garbage collection
Ryusuke Konishia3d93f72009-04-06 19:01:40 -07003 *
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 *
Ryusuke Konishi4b420ab2016-05-23 16:23:09 -070016 * Written by Seiji Kihara, Amagai Yoshiji, and Ryusuke Konishi.
17 * Revised by Ryusuke Konishi.
Ryusuke Konishia3d93f72009-04-06 19:01:40 -070018 *
19 */
Ryusuke Konishi047180f2009-04-06 19:01:45 -070020/*
21 * This file adds the cache of on-disk blocks to be moved in garbage
22 * collection. The disk blocks are held with dummy inodes (called
23 * gcinodes), and this file provides lookup function of the dummy
24 * inodes and their buffer read function.
25 *
Ryusuke Konishi047180f2009-04-06 19:01:45 -070026 * Buffers and pages held by the dummy inodes will be released each
27 * time after they are copied to a new log. Dirty blocks made on the
28 * current generation and the blocks to be moved by GC never overlap
29 * because the dirty blocks make a new generation; they rather must be
30 * written individually.
31 */
Ryusuke Konishia3d93f72009-04-06 19:01:40 -070032
33#include <linux/buffer_head.h>
34#include <linux/mpage.h>
35#include <linux/hash.h>
Tejun Heo5a0e3ad2010-03-24 17:04:11 +090036#include <linux/slab.h>
Ryusuke Konishia3d93f72009-04-06 19:01:40 -070037#include <linux/swap.h>
38#include "nilfs.h"
Ryusuke Konishi05d0e942010-07-10 20:52:09 +090039#include "btree.h"
40#include "btnode.h"
Ryusuke Konishia3d93f72009-04-06 19:01:40 -070041#include "page.h"
42#include "mdt.h"
43#include "dat.h"
44#include "ifile.h"
45
Ryusuke Konishia3d93f72009-04-06 19:01:40 -070046/*
47 * nilfs_gccache_submit_read_data() - add data buffer and submit read request
48 * @inode - gc inode
49 * @blkoff - dummy offset treated as the key for the page cache
50 * @pbn - physical block number of the block
51 * @vbn - virtual block number of the block, 0 for non-virtual block
52 * @out_bh - indirect pointer to a buffer_head struct to receive the results
53 *
54 * Description: nilfs_gccache_submit_read_data() registers the data buffer
55 * specified by @pbn to the GC pagecache with the key @blkoff.
56 * This function sets @vbn (@pbn if @vbn is zero) in b_blocknr of the buffer.
57 *
58 * Return Value: On success, 0 is returned. On Error, one of the following
59 * negative error code is returned.
60 *
61 * %-EIO - I/O error.
62 *
63 * %-ENOMEM - Insufficient amount of memory available.
64 *
65 * %-ENOENT - The block specified with @pbn does not exist.
66 */
67int nilfs_gccache_submit_read_data(struct inode *inode, sector_t blkoff,
68 sector_t pbn, __u64 vbn,
69 struct buffer_head **out_bh)
70{
71 struct buffer_head *bh;
72 int err;
73
74 bh = nilfs_grab_buffer(inode, inode->i_mapping, blkoff, 0);
75 if (unlikely(!bh))
76 return -ENOMEM;
77
78 if (buffer_uptodate(bh))
79 goto out;
80
81 if (pbn == 0) {
Ryusuke Konishi0ef28f92011-05-05 12:56:51 +090082 struct the_nilfs *nilfs = inode->i_sb->s_fs_info;
83
84 err = nilfs_dat_translate(nilfs->ns_dat, vbn, &pbn);
Ryusuke Konishia3d93f72009-04-06 19:01:40 -070085 if (unlikely(err)) { /* -EIO, -ENOMEM, -ENOENT */
86 brelse(bh);
87 goto failed;
88 }
89 }
90
91 lock_buffer(bh);
92 if (buffer_uptodate(bh)) {
93 unlock_buffer(bh);
94 goto out;
95 }
96
97 if (!buffer_mapped(bh)) {
Ryusuke Konishi0ef28f92011-05-05 12:56:51 +090098 bh->b_bdev = inode->i_sb->s_bdev;
Ryusuke Konishia3d93f72009-04-06 19:01:40 -070099 set_buffer_mapped(bh);
100 }
101 bh->b_blocknr = pbn;
102 bh->b_end_io = end_buffer_read_sync;
103 get_bh(bh);
104 submit_bh(READ, bh);
105 if (vbn)
106 bh->b_blocknr = vbn;
107 out:
108 err = 0;
109 *out_bh = bh;
110
111 failed:
112 unlock_page(bh->b_page);
Kirill A. Shutemov09cbfea2016-04-01 15:29:47 +0300113 put_page(bh->b_page);
Ryusuke Konishia3d93f72009-04-06 19:01:40 -0700114 return err;
115}
116
117/*
118 * nilfs_gccache_submit_read_node() - add node buffer and submit read request
119 * @inode - gc inode
120 * @pbn - physical block number for the block
121 * @vbn - virtual block number for the block
122 * @out_bh - indirect pointer to a buffer_head struct to receive the results
123 *
124 * Description: nilfs_gccache_submit_read_node() registers the node buffer
125 * specified by @vbn to the GC pagecache. @pbn can be supplied by the
126 * caller to avoid translation of the disk block address.
127 *
128 * Return Value: On success, 0 is returned. On Error, one of the following
129 * negative error code is returned.
130 *
131 * %-EIO - I/O error.
132 *
133 * %-ENOMEM - Insufficient amount of memory available.
134 */
135int nilfs_gccache_submit_read_node(struct inode *inode, sector_t pbn,
136 __u64 vbn, struct buffer_head **out_bh)
137{
Ryusuke Konishi26dfdd82010-07-18 10:42:23 +0900138 int ret;
139
140 ret = nilfs_btnode_submit_block(&NILFS_I(inode)->i_btnode_cache,
141 vbn ? : pbn, pbn, READ, out_bh, &pbn);
Ryusuke Konishia3d93f72009-04-06 19:01:40 -0700142 if (ret == -EEXIST) /* internal code (cache hit) */
143 ret = 0;
144 return ret;
145}
146
147int nilfs_gccache_wait_and_mark_dirty(struct buffer_head *bh)
148{
149 wait_on_buffer(bh);
150 if (!buffer_uptodate(bh))
151 return -EIO;
152 if (buffer_dirty(bh))
153 return -EEXIST;
154
Ryusuke Konishi5fc7b142011-05-05 12:56:51 +0900155 if (buffer_nilfs_node(bh) && nilfs_btree_broken_node_block(bh)) {
156 clear_buffer_uptodate(bh);
157 return -EIO;
Ryusuke Konishi1d5385b2010-07-16 23:52:40 +0900158 }
Ryusuke Konishi5fc7b142011-05-05 12:56:51 +0900159 mark_buffer_dirty(bh);
Ryusuke Konishia3d93f72009-04-06 19:01:40 -0700160 return 0;
161}
162
Ryusuke Konishi263d90c2010-08-20 19:06:11 +0900163int nilfs_init_gcinode(struct inode *inode)
Ryusuke Konishia3d93f72009-04-06 19:01:40 -0700164{
Ryusuke Konishi263d90c2010-08-20 19:06:11 +0900165 struct nilfs_inode_info *ii = NILFS_I(inode);
Ryusuke Konishia3d93f72009-04-06 19:01:40 -0700166
Ryusuke Konishiadbb39b2010-09-05 10:14:43 +0900167 inode->i_mode = S_IFREG;
168 mapping_set_gfp_mask(inode->i_mapping, GFP_NOFS);
Ryusuke Konishi293ce0e2011-05-05 12:56:51 +0900169 inode->i_mapping->a_ops = &empty_aops;
Ryusuke Konishia3d93f72009-04-06 19:01:40 -0700170
Ryusuke Konishiadbb39b2010-09-05 10:14:43 +0900171 ii->i_flags = 0;
172 nilfs_bmap_init_gc(ii->i_bmap);
Ryusuke Konishia3d93f72009-04-06 19:01:40 -0700173
Ryusuke Konishiadbb39b2010-09-05 10:14:43 +0900174 return 0;
Ryusuke Konishia3d93f72009-04-06 19:01:40 -0700175}
176
Ryusuke Konishi263d90c2010-08-20 19:06:11 +0900177/**
178 * nilfs_remove_all_gcinodes() - remove all unprocessed gc inodes
Ryusuke Konishia3d93f72009-04-06 19:01:40 -0700179 */
Ryusuke Konishi263d90c2010-08-20 19:06:11 +0900180void nilfs_remove_all_gcinodes(struct the_nilfs *nilfs)
Ryusuke Konishia3d93f72009-04-06 19:01:40 -0700181{
Ryusuke Konishi263d90c2010-08-20 19:06:11 +0900182 struct list_head *head = &nilfs->ns_gc_inodes;
183 struct nilfs_inode_info *ii;
Ryusuke Konishia3d93f72009-04-06 19:01:40 -0700184
Ryusuke Konishi263d90c2010-08-20 19:06:11 +0900185 while (!list_empty(head)) {
186 ii = list_first_entry(head, struct nilfs_inode_info, i_dirty);
187 list_del_init(&ii->i_dirty);
Ryusuke Konishifbb24a32012-06-20 12:52:57 -0700188 truncate_inode_pages(&ii->vfs_inode.i_data, 0);
189 nilfs_btnode_cache_clear(&ii->i_btnode_cache);
Ryusuke Konishi263d90c2010-08-20 19:06:11 +0900190 iput(&ii->vfs_inode);
Ryusuke Konishia3d93f72009-04-06 19:01:40 -0700191 }
192}