Loading...
1/*
2 * Copyright (C) Sistina Software, Inc. 1997-2003 All rights reserved.
3 * Copyright (C) 2004-2006 Red Hat, Inc. All rights reserved.
4 *
5 * This copyrighted material is made available to anyone wishing to use,
6 * modify, copy, or redistribute it subject to the terms and conditions
7 * of the GNU General Public License version 2.
8 */
9
10#include <linux/sched.h>
11#include <linux/slab.h>
12#include <linux/spinlock.h>
13#include <linux/completion.h>
14#include <linux/buffer_head.h>
15#include <linux/kallsyms.h>
16#include <linux/gfs2_ondisk.h>
17
18#include "gfs2.h"
19#include "incore.h"
20#include "glock.h"
21#include "log.h"
22#include "lops.h"
23#include "meta_io.h"
24#include "trans.h"
25#include "util.h"
26#include "trace_gfs2.h"
27
28int gfs2_trans_begin(struct gfs2_sbd *sdp, unsigned int blocks,
29 unsigned int revokes)
30{
31 struct gfs2_trans *tr;
32 int error;
33
34 BUG_ON(current->journal_info);
35 BUG_ON(blocks == 0 && revokes == 0);
36
37 if (!test_bit(SDF_JOURNAL_LIVE, &sdp->sd_flags))
38 return -EROFS;
39
40 tr = kzalloc(sizeof(struct gfs2_trans), GFP_NOFS);
41 if (!tr)
42 return -ENOMEM;
43
44 tr->tr_ip = (unsigned long)__builtin_return_address(0);
45 tr->tr_blocks = blocks;
46 tr->tr_revokes = revokes;
47 tr->tr_reserved = 1;
48 if (blocks)
49 tr->tr_reserved += 6 + blocks;
50 if (revokes)
51 tr->tr_reserved += gfs2_struct2blk(sdp, revokes,
52 sizeof(u64));
53 gfs2_holder_init(sdp->sd_trans_gl, LM_ST_SHARED, 0, &tr->tr_t_gh);
54
55 error = gfs2_glock_nq(&tr->tr_t_gh);
56 if (error)
57 goto fail_holder_uninit;
58
59 error = gfs2_log_reserve(sdp, tr->tr_reserved);
60 if (error)
61 goto fail_gunlock;
62
63 current->journal_info = tr;
64
65 return 0;
66
67fail_gunlock:
68 gfs2_glock_dq(&tr->tr_t_gh);
69
70fail_holder_uninit:
71 gfs2_holder_uninit(&tr->tr_t_gh);
72 kfree(tr);
73
74 return error;
75}
76
77/**
78 * gfs2_log_release - Release a given number of log blocks
79 * @sdp: The GFS2 superblock
80 * @blks: The number of blocks
81 *
82 */
83
84static void gfs2_log_release(struct gfs2_sbd *sdp, unsigned int blks)
85{
86
87 atomic_add(blks, &sdp->sd_log_blks_free);
88 trace_gfs2_log_blocks(sdp, blks);
89 gfs2_assert_withdraw(sdp, atomic_read(&sdp->sd_log_blks_free) <=
90 sdp->sd_jdesc->jd_blocks);
91 up_read(&sdp->sd_log_flush_lock);
92}
93
94static void gfs2_print_trans(const struct gfs2_trans *tr)
95{
96 print_symbol(KERN_WARNING "GFS2: Transaction created at: %s\n", tr->tr_ip);
97 printk(KERN_WARNING "GFS2: blocks=%u revokes=%u reserved=%u touched=%d\n",
98 tr->tr_blocks, tr->tr_revokes, tr->tr_reserved, tr->tr_touched);
99 printk(KERN_WARNING "GFS2: Buf %u/%u Databuf %u/%u Revoke %u/%u\n",
100 tr->tr_num_buf_new, tr->tr_num_buf_rm,
101 tr->tr_num_databuf_new, tr->tr_num_databuf_rm,
102 tr->tr_num_revoke, tr->tr_num_revoke_rm);
103}
104
105void gfs2_trans_end(struct gfs2_sbd *sdp)
106{
107 struct gfs2_trans *tr = current->journal_info;
108 s64 nbuf;
109 BUG_ON(!tr);
110 current->journal_info = NULL;
111
112 if (!tr->tr_touched) {
113 gfs2_log_release(sdp, tr->tr_reserved);
114 if (tr->tr_t_gh.gh_gl) {
115 gfs2_glock_dq(&tr->tr_t_gh);
116 gfs2_holder_uninit(&tr->tr_t_gh);
117 kfree(tr);
118 }
119 return;
120 }
121
122 nbuf = tr->tr_num_buf_new + tr->tr_num_databuf_new;
123 nbuf -= tr->tr_num_buf_rm;
124 nbuf -= tr->tr_num_databuf_rm;
125
126 if (gfs2_assert_withdraw(sdp, (nbuf <= tr->tr_blocks) &&
127 (tr->tr_num_revoke <= tr->tr_revokes)))
128 gfs2_print_trans(tr);
129
130 gfs2_log_commit(sdp, tr);
131 if (tr->tr_t_gh.gh_gl) {
132 gfs2_glock_dq(&tr->tr_t_gh);
133 gfs2_holder_uninit(&tr->tr_t_gh);
134 kfree(tr);
135 }
136
137 if (sdp->sd_vfs->s_flags & MS_SYNCHRONOUS)
138 gfs2_log_flush(sdp, NULL);
139}
140
141/**
142 * gfs2_trans_add_bh - Add a to-be-modified buffer to the current transaction
143 * @gl: the glock the buffer belongs to
144 * @bh: The buffer to add
145 * @meta: True in the case of adding metadata
146 *
147 */
148
149void gfs2_trans_add_bh(struct gfs2_glock *gl, struct buffer_head *bh, int meta)
150{
151 struct gfs2_sbd *sdp = gl->gl_sbd;
152 struct gfs2_bufdata *bd;
153
154 bd = bh->b_private;
155 if (bd)
156 gfs2_assert(sdp, bd->bd_gl == gl);
157 else {
158 gfs2_attach_bufdata(gl, bh, meta);
159 bd = bh->b_private;
160 }
161 lops_add(sdp, bd);
162}
163
164void gfs2_trans_add_revoke(struct gfs2_sbd *sdp, struct gfs2_bufdata *bd)
165{
166 BUG_ON(!list_empty(&bd->bd_list));
167 BUG_ON(!list_empty(&bd->bd_ail_st_list));
168 BUG_ON(!list_empty(&bd->bd_ail_gl_list));
169 lops_init_le(bd, &gfs2_revoke_lops);
170 lops_add(sdp, bd);
171}
172
173void gfs2_trans_add_unrevoke(struct gfs2_sbd *sdp, u64 blkno, unsigned int len)
174{
175 struct gfs2_bufdata *bd, *tmp;
176 struct gfs2_trans *tr = current->journal_info;
177 unsigned int n = len;
178
179 gfs2_log_lock(sdp);
180 list_for_each_entry_safe(bd, tmp, &sdp->sd_log_le_revoke, bd_list) {
181 if ((bd->bd_blkno >= blkno) && (bd->bd_blkno < (blkno + len))) {
182 list_del_init(&bd->bd_list);
183 gfs2_assert_withdraw(sdp, sdp->sd_log_num_revoke);
184 sdp->sd_log_num_revoke--;
185 kmem_cache_free(gfs2_bufdata_cachep, bd);
186 tr->tr_num_revoke_rm++;
187 if (--n == 0)
188 break;
189 }
190 }
191 gfs2_log_unlock(sdp);
192}
193
1/*
2 * Copyright (C) Sistina Software, Inc. 1997-2003 All rights reserved.
3 * Copyright (C) 2004-2006 Red Hat, Inc. All rights reserved.
4 *
5 * This copyrighted material is made available to anyone wishing to use,
6 * modify, copy, or redistribute it subject to the terms and conditions
7 * of the GNU General Public License version 2.
8 */
9
10#define pr_fmt(fmt) KBUILD_MODNAME ": " fmt
11
12#include <linux/sched.h>
13#include <linux/slab.h>
14#include <linux/spinlock.h>
15#include <linux/completion.h>
16#include <linux/buffer_head.h>
17#include <linux/kallsyms.h>
18#include <linux/gfs2_ondisk.h>
19
20#include "gfs2.h"
21#include "incore.h"
22#include "glock.h"
23#include "inode.h"
24#include "log.h"
25#include "lops.h"
26#include "meta_io.h"
27#include "trans.h"
28#include "util.h"
29#include "trace_gfs2.h"
30
31int gfs2_trans_begin(struct gfs2_sbd *sdp, unsigned int blocks,
32 unsigned int revokes)
33{
34 struct gfs2_trans *tr;
35 int error;
36
37 BUG_ON(current->journal_info);
38 BUG_ON(blocks == 0 && revokes == 0);
39
40 if (!test_bit(SDF_JOURNAL_LIVE, &sdp->sd_flags))
41 return -EROFS;
42
43 tr = kzalloc(sizeof(struct gfs2_trans), GFP_NOFS);
44 if (!tr)
45 return -ENOMEM;
46
47 tr->tr_ip = _RET_IP_;
48 tr->tr_blocks = blocks;
49 tr->tr_revokes = revokes;
50 tr->tr_reserved = 1;
51 set_bit(TR_ALLOCED, &tr->tr_flags);
52 if (blocks)
53 tr->tr_reserved += 6 + blocks;
54 if (revokes)
55 tr->tr_reserved += gfs2_struct2blk(sdp, revokes,
56 sizeof(u64));
57 INIT_LIST_HEAD(&tr->tr_databuf);
58 INIT_LIST_HEAD(&tr->tr_buf);
59
60 sb_start_intwrite(sdp->sd_vfs);
61
62 error = gfs2_log_reserve(sdp, tr->tr_reserved);
63 if (error)
64 goto fail;
65
66 current->journal_info = tr;
67
68 return 0;
69
70fail:
71 sb_end_intwrite(sdp->sd_vfs);
72 kfree(tr);
73
74 return error;
75}
76
77static void gfs2_print_trans(const struct gfs2_trans *tr)
78{
79 pr_warn("Transaction created at: %pSR\n", (void *)tr->tr_ip);
80 pr_warn("blocks=%u revokes=%u reserved=%u touched=%u\n",
81 tr->tr_blocks, tr->tr_revokes, tr->tr_reserved,
82 test_bit(TR_TOUCHED, &tr->tr_flags));
83 pr_warn("Buf %u/%u Databuf %u/%u Revoke %u/%u\n",
84 tr->tr_num_buf_new, tr->tr_num_buf_rm,
85 tr->tr_num_databuf_new, tr->tr_num_databuf_rm,
86 tr->tr_num_revoke, tr->tr_num_revoke_rm);
87}
88
89void gfs2_trans_end(struct gfs2_sbd *sdp)
90{
91 struct gfs2_trans *tr = current->journal_info;
92 s64 nbuf;
93 int alloced = test_bit(TR_ALLOCED, &tr->tr_flags);
94
95 current->journal_info = NULL;
96
97 if (!test_bit(TR_TOUCHED, &tr->tr_flags)) {
98 gfs2_log_release(sdp, tr->tr_reserved);
99 if (alloced) {
100 kfree(tr);
101 sb_end_intwrite(sdp->sd_vfs);
102 }
103 return;
104 }
105
106 nbuf = tr->tr_num_buf_new + tr->tr_num_databuf_new;
107 nbuf -= tr->tr_num_buf_rm;
108 nbuf -= tr->tr_num_databuf_rm;
109
110 if (gfs2_assert_withdraw(sdp, (nbuf <= tr->tr_blocks) &&
111 (tr->tr_num_revoke <= tr->tr_revokes)))
112 gfs2_print_trans(tr);
113
114 gfs2_log_commit(sdp, tr);
115 if (alloced && !test_bit(TR_ATTACHED, &tr->tr_flags))
116 kfree(tr);
117 up_read(&sdp->sd_log_flush_lock);
118
119 if (sdp->sd_vfs->s_flags & SB_SYNCHRONOUS)
120 gfs2_log_flush(sdp, NULL, GFS2_LOG_HEAD_FLUSH_NORMAL |
121 GFS2_LFC_TRANS_END);
122 if (alloced)
123 sb_end_intwrite(sdp->sd_vfs);
124}
125
126static struct gfs2_bufdata *gfs2_alloc_bufdata(struct gfs2_glock *gl,
127 struct buffer_head *bh,
128 const struct gfs2_log_operations *lops)
129{
130 struct gfs2_bufdata *bd;
131
132 bd = kmem_cache_zalloc(gfs2_bufdata_cachep, GFP_NOFS | __GFP_NOFAIL);
133 bd->bd_bh = bh;
134 bd->bd_gl = gl;
135 bd->bd_ops = lops;
136 INIT_LIST_HEAD(&bd->bd_list);
137 bh->b_private = bd;
138 return bd;
139}
140
141/**
142 * gfs2_trans_add_data - Add a databuf to the transaction.
143 * @gl: The inode glock associated with the buffer
144 * @bh: The buffer to add
145 *
146 * This is used in two distinct cases:
147 * i) In ordered write mode
148 * We put the data buffer on a list so that we can ensure that it's
149 * synced to disk at the right time
150 * ii) In journaled data mode
151 * We need to journal the data block in the same way as metadata in
152 * the functions above. The difference is that here we have a tag
153 * which is two __be64's being the block number (as per meta data)
154 * and a flag which says whether the data block needs escaping or
155 * not. This means we need a new log entry for each 251 or so data
156 * blocks, which isn't an enormous overhead but twice as much as
157 * for normal metadata blocks.
158 */
159void gfs2_trans_add_data(struct gfs2_glock *gl, struct buffer_head *bh)
160{
161 struct gfs2_trans *tr = current->journal_info;
162 struct gfs2_sbd *sdp = gl->gl_name.ln_sbd;
163 struct address_space *mapping = bh->b_page->mapping;
164 struct gfs2_inode *ip = GFS2_I(mapping->host);
165 struct gfs2_bufdata *bd;
166
167 if (!gfs2_is_jdata(ip)) {
168 gfs2_ordered_add_inode(ip);
169 return;
170 }
171
172 lock_buffer(bh);
173 if (buffer_pinned(bh)) {
174 set_bit(TR_TOUCHED, &tr->tr_flags);
175 goto out;
176 }
177 gfs2_log_lock(sdp);
178 bd = bh->b_private;
179 if (bd == NULL) {
180 gfs2_log_unlock(sdp);
181 unlock_buffer(bh);
182 if (bh->b_private == NULL)
183 bd = gfs2_alloc_bufdata(gl, bh, &gfs2_databuf_lops);
184 else
185 bd = bh->b_private;
186 lock_buffer(bh);
187 gfs2_log_lock(sdp);
188 }
189 gfs2_assert(sdp, bd->bd_gl == gl);
190 set_bit(TR_TOUCHED, &tr->tr_flags);
191 if (list_empty(&bd->bd_list)) {
192 set_bit(GLF_LFLUSH, &bd->bd_gl->gl_flags);
193 set_bit(GLF_DIRTY, &bd->bd_gl->gl_flags);
194 gfs2_pin(sdp, bd->bd_bh);
195 tr->tr_num_databuf_new++;
196 list_add_tail(&bd->bd_list, &tr->tr_databuf);
197 }
198 gfs2_log_unlock(sdp);
199out:
200 unlock_buffer(bh);
201}
202
203void gfs2_trans_add_meta(struct gfs2_glock *gl, struct buffer_head *bh)
204{
205
206 struct gfs2_sbd *sdp = gl->gl_name.ln_sbd;
207 struct gfs2_bufdata *bd;
208 struct gfs2_meta_header *mh;
209 struct gfs2_trans *tr = current->journal_info;
210 enum gfs2_freeze_state state = atomic_read(&sdp->sd_freeze_state);
211
212 lock_buffer(bh);
213 if (buffer_pinned(bh)) {
214 set_bit(TR_TOUCHED, &tr->tr_flags);
215 goto out;
216 }
217 gfs2_log_lock(sdp);
218 bd = bh->b_private;
219 if (bd == NULL) {
220 gfs2_log_unlock(sdp);
221 unlock_buffer(bh);
222 lock_page(bh->b_page);
223 if (bh->b_private == NULL)
224 bd = gfs2_alloc_bufdata(gl, bh, &gfs2_buf_lops);
225 else
226 bd = bh->b_private;
227 unlock_page(bh->b_page);
228 lock_buffer(bh);
229 gfs2_log_lock(sdp);
230 }
231 gfs2_assert(sdp, bd->bd_gl == gl);
232 set_bit(TR_TOUCHED, &tr->tr_flags);
233 if (!list_empty(&bd->bd_list))
234 goto out_unlock;
235 set_bit(GLF_LFLUSH, &bd->bd_gl->gl_flags);
236 set_bit(GLF_DIRTY, &bd->bd_gl->gl_flags);
237 mh = (struct gfs2_meta_header *)bd->bd_bh->b_data;
238 if (unlikely(mh->mh_magic != cpu_to_be32(GFS2_MAGIC))) {
239 pr_err("Attempting to add uninitialised block to journal (inplace block=%lld)\n",
240 (unsigned long long)bd->bd_bh->b_blocknr);
241 BUG();
242 }
243 if (unlikely(state == SFS_FROZEN)) {
244 printk(KERN_INFO "GFS2:adding buf while frozen\n");
245 gfs2_assert_withdraw(sdp, 0);
246 }
247 gfs2_pin(sdp, bd->bd_bh);
248 mh->__pad0 = cpu_to_be64(0);
249 mh->mh_jid = cpu_to_be32(sdp->sd_jdesc->jd_jid);
250 list_add(&bd->bd_list, &tr->tr_buf);
251 tr->tr_num_buf_new++;
252out_unlock:
253 gfs2_log_unlock(sdp);
254out:
255 unlock_buffer(bh);
256}
257
258void gfs2_trans_add_revoke(struct gfs2_sbd *sdp, struct gfs2_bufdata *bd)
259{
260 struct gfs2_trans *tr = current->journal_info;
261
262 BUG_ON(!list_empty(&bd->bd_list));
263 gfs2_add_revoke(sdp, bd);
264 set_bit(TR_TOUCHED, &tr->tr_flags);
265 tr->tr_num_revoke++;
266}
267
268void gfs2_trans_add_unrevoke(struct gfs2_sbd *sdp, u64 blkno, unsigned int len)
269{
270 struct gfs2_bufdata *bd, *tmp;
271 struct gfs2_trans *tr = current->journal_info;
272 unsigned int n = len;
273
274 gfs2_log_lock(sdp);
275 list_for_each_entry_safe(bd, tmp, &sdp->sd_log_le_revoke, bd_list) {
276 if ((bd->bd_blkno >= blkno) && (bd->bd_blkno < (blkno + len))) {
277 list_del_init(&bd->bd_list);
278 gfs2_assert_withdraw(sdp, sdp->sd_log_num_revoke);
279 sdp->sd_log_num_revoke--;
280 kmem_cache_free(gfs2_bufdata_cachep, bd);
281 tr->tr_num_revoke_rm++;
282 if (--n == 0)
283 break;
284 }
285 }
286 gfs2_log_unlock(sdp);
287}
288