xref: /openbmc/linux/fs/gfs2/trans.c (revision 6d7dce3b)
1 // SPDX-License-Identifier: GPL-2.0-only
2 /*
3  * Copyright (C) Sistina Software, Inc.  1997-2003 All rights reserved.
4  * Copyright (C) 2004-2006 Red Hat, Inc.  All rights reserved.
5  */
6 
7 #define pr_fmt(fmt) KBUILD_MODNAME ": " fmt
8 
9 #include <linux/sched.h>
10 #include <linux/slab.h>
11 #include <linux/spinlock.h>
12 #include <linux/completion.h>
13 #include <linux/buffer_head.h>
14 #include <linux/kallsyms.h>
15 #include <linux/gfs2_ondisk.h>
16 
17 #include "gfs2.h"
18 #include "incore.h"
19 #include "glock.h"
20 #include "inode.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 
28 static void gfs2_print_trans(struct gfs2_sbd *sdp, const struct gfs2_trans *tr)
29 {
30 	fs_warn(sdp, "Transaction created at: %pSR\n", (void *)tr->tr_ip);
31 	fs_warn(sdp, "blocks=%u revokes=%u reserved=%u touched=%u\n",
32 		tr->tr_blocks, tr->tr_revokes, tr->tr_reserved,
33 		test_bit(TR_TOUCHED, &tr->tr_flags));
34 	fs_warn(sdp, "Buf %u/%u Databuf %u/%u Revoke %u/%u\n",
35 		tr->tr_num_buf_new, tr->tr_num_buf_rm,
36 		tr->tr_num_databuf_new, tr->tr_num_databuf_rm,
37 		tr->tr_num_revoke, tr->tr_num_revoke_rm);
38 }
39 
40 int gfs2_trans_begin(struct gfs2_sbd *sdp, unsigned int blocks,
41 		     unsigned int revokes)
42 {
43 	struct gfs2_trans *tr;
44 	int error;
45 
46 	if (current->journal_info) {
47 		gfs2_print_trans(sdp, current->journal_info);
48 		BUG();
49 	}
50 	BUG_ON(blocks == 0 && revokes == 0);
51 
52 	if (!test_bit(SDF_JOURNAL_LIVE, &sdp->sd_flags))
53 		return -EROFS;
54 
55 	tr = kmem_cache_zalloc(gfs2_trans_cachep, GFP_NOFS);
56 	if (!tr)
57 		return -ENOMEM;
58 
59 	tr->tr_ip = _RET_IP_;
60 	tr->tr_blocks = blocks;
61 	tr->tr_revokes = revokes;
62 	tr->tr_reserved = 1;
63 	set_bit(TR_ALLOCED, &tr->tr_flags);
64 	if (blocks)
65 		tr->tr_reserved += 6 + blocks;
66 	if (revokes)
67 		tr->tr_reserved += gfs2_struct2blk(sdp, revokes);
68 	INIT_LIST_HEAD(&tr->tr_databuf);
69 	INIT_LIST_HEAD(&tr->tr_buf);
70 	INIT_LIST_HEAD(&tr->tr_list);
71 	INIT_LIST_HEAD(&tr->tr_ail1_list);
72 	INIT_LIST_HEAD(&tr->tr_ail2_list);
73 
74 	sb_start_intwrite(sdp->sd_vfs);
75 
76 	error = gfs2_log_reserve(sdp, tr->tr_reserved);
77 	if (error)
78 		goto fail;
79 
80 	current->journal_info = tr;
81 
82 	return 0;
83 
84 fail:
85 	sb_end_intwrite(sdp->sd_vfs);
86 	kmem_cache_free(gfs2_trans_cachep, tr);
87 
88 	return error;
89 }
90 
91 void gfs2_trans_end(struct gfs2_sbd *sdp)
92 {
93 	struct gfs2_trans *tr = current->journal_info;
94 	s64 nbuf;
95 	int alloced = test_bit(TR_ALLOCED, &tr->tr_flags);
96 
97 	current->journal_info = NULL;
98 
99 	if (!test_bit(TR_TOUCHED, &tr->tr_flags)) {
100 		gfs2_log_release(sdp, tr->tr_reserved);
101 		if (alloced) {
102 			gfs2_trans_free(sdp, tr);
103 			sb_end_intwrite(sdp->sd_vfs);
104 		}
105 		return;
106 	}
107 
108 	nbuf = tr->tr_num_buf_new + tr->tr_num_databuf_new;
109 	nbuf -= tr->tr_num_buf_rm;
110 	nbuf -= tr->tr_num_databuf_rm;
111 
112 	if (gfs2_assert_withdraw(sdp, (nbuf <= tr->tr_blocks) &&
113 				       (tr->tr_num_revoke <= tr->tr_revokes)))
114 		gfs2_print_trans(sdp, tr);
115 
116 	gfs2_log_commit(sdp, tr);
117 	if (alloced && !test_bit(TR_ATTACHED, &tr->tr_flags))
118 		gfs2_trans_free(sdp, tr);
119 	up_read(&sdp->sd_log_flush_lock);
120 
121 	if (sdp->sd_vfs->s_flags & SB_SYNCHRONOUS)
122 		gfs2_log_flush(sdp, NULL, GFS2_LOG_HEAD_FLUSH_NORMAL |
123 			       GFS2_LFC_TRANS_END);
124 	if (alloced)
125 		sb_end_intwrite(sdp->sd_vfs);
126 }
127 
128 static struct gfs2_bufdata *gfs2_alloc_bufdata(struct gfs2_glock *gl,
129 					       struct buffer_head *bh)
130 {
131 	struct gfs2_bufdata *bd;
132 
133 	bd = kmem_cache_zalloc(gfs2_bufdata_cachep, GFP_NOFS | __GFP_NOFAIL);
134 	bd->bd_bh = bh;
135 	bd->bd_gl = gl;
136 	INIT_LIST_HEAD(&bd->bd_list);
137 	INIT_LIST_HEAD(&bd->bd_ail_st_list);
138 	INIT_LIST_HEAD(&bd->bd_ail_gl_list);
139 	bh->b_private = bd;
140 	return bd;
141 }
142 
143 /**
144  * gfs2_trans_add_data - Add a databuf to the transaction.
145  * @gl: The inode glock associated with the buffer
146  * @bh: The buffer to add
147  *
148  * This is used in journaled data mode.
149  * We need to journal the data block in the same way as metadata in
150  * the functions above. The difference is that here we have a tag
151  * which is two __be64's being the block number (as per meta data)
152  * and a flag which says whether the data block needs escaping or
153  * not. This means we need a new log entry for each 251 or so data
154  * blocks, which isn't an enormous overhead but twice as much as
155  * for normal metadata blocks.
156  */
157 void gfs2_trans_add_data(struct gfs2_glock *gl, struct buffer_head *bh)
158 {
159 	struct gfs2_trans *tr = current->journal_info;
160 	struct gfs2_sbd *sdp = gl->gl_name.ln_sbd;
161 	struct gfs2_bufdata *bd;
162 
163 	lock_buffer(bh);
164 	if (buffer_pinned(bh)) {
165 		set_bit(TR_TOUCHED, &tr->tr_flags);
166 		goto out;
167 	}
168 	gfs2_log_lock(sdp);
169 	bd = bh->b_private;
170 	if (bd == NULL) {
171 		gfs2_log_unlock(sdp);
172 		unlock_buffer(bh);
173 		if (bh->b_private == NULL)
174 			bd = gfs2_alloc_bufdata(gl, bh);
175 		else
176 			bd = bh->b_private;
177 		lock_buffer(bh);
178 		gfs2_log_lock(sdp);
179 	}
180 	gfs2_assert(sdp, bd->bd_gl == gl);
181 	set_bit(TR_TOUCHED, &tr->tr_flags);
182 	if (list_empty(&bd->bd_list)) {
183 		set_bit(GLF_LFLUSH, &bd->bd_gl->gl_flags);
184 		set_bit(GLF_DIRTY, &bd->bd_gl->gl_flags);
185 		gfs2_pin(sdp, bd->bd_bh);
186 		tr->tr_num_databuf_new++;
187 		list_add_tail(&bd->bd_list, &tr->tr_databuf);
188 	}
189 	gfs2_log_unlock(sdp);
190 out:
191 	unlock_buffer(bh);
192 }
193 
194 void gfs2_trans_add_meta(struct gfs2_glock *gl, struct buffer_head *bh)
195 {
196 
197 	struct gfs2_sbd *sdp = gl->gl_name.ln_sbd;
198 	struct gfs2_bufdata *bd;
199 	struct gfs2_meta_header *mh;
200 	struct gfs2_trans *tr = current->journal_info;
201 	enum gfs2_freeze_state state = atomic_read(&sdp->sd_freeze_state);
202 
203 	lock_buffer(bh);
204 	if (buffer_pinned(bh)) {
205 		set_bit(TR_TOUCHED, &tr->tr_flags);
206 		goto out;
207 	}
208 	gfs2_log_lock(sdp);
209 	bd = bh->b_private;
210 	if (bd == NULL) {
211 		gfs2_log_unlock(sdp);
212 		unlock_buffer(bh);
213 		lock_page(bh->b_page);
214 		if (bh->b_private == NULL)
215 			bd = gfs2_alloc_bufdata(gl, bh);
216 		else
217 			bd = bh->b_private;
218 		unlock_page(bh->b_page);
219 		lock_buffer(bh);
220 		gfs2_log_lock(sdp);
221 	}
222 	gfs2_assert(sdp, bd->bd_gl == gl);
223 	set_bit(TR_TOUCHED, &tr->tr_flags);
224 	if (!list_empty(&bd->bd_list))
225 		goto out_unlock;
226 	set_bit(GLF_LFLUSH, &bd->bd_gl->gl_flags);
227 	set_bit(GLF_DIRTY, &bd->bd_gl->gl_flags);
228 	mh = (struct gfs2_meta_header *)bd->bd_bh->b_data;
229 	if (unlikely(mh->mh_magic != cpu_to_be32(GFS2_MAGIC))) {
230 		fs_err(sdp, "Attempting to add uninitialised block to "
231 		       "journal (inplace block=%lld)\n",
232 		       (unsigned long long)bd->bd_bh->b_blocknr);
233 		BUG();
234 	}
235 	if (unlikely(state == SFS_FROZEN)) {
236 		fs_info(sdp, "GFS2:adding buf while frozen\n");
237 		gfs2_assert_withdraw(sdp, 0);
238 	}
239 	if (unlikely(gfs2_withdrawn(sdp))) {
240 		fs_info(sdp, "GFS2:adding buf while withdrawn! 0x%llx\n",
241 			(unsigned long long)bd->bd_bh->b_blocknr);
242 	}
243 	gfs2_pin(sdp, bd->bd_bh);
244 	mh->__pad0 = cpu_to_be64(0);
245 	mh->mh_jid = cpu_to_be32(sdp->sd_jdesc->jd_jid);
246 	list_add(&bd->bd_list, &tr->tr_buf);
247 	tr->tr_num_buf_new++;
248 out_unlock:
249 	gfs2_log_unlock(sdp);
250 out:
251 	unlock_buffer(bh);
252 }
253 
254 void gfs2_trans_add_revoke(struct gfs2_sbd *sdp, struct gfs2_bufdata *bd)
255 {
256 	struct gfs2_trans *tr = current->journal_info;
257 
258 	BUG_ON(!list_empty(&bd->bd_list));
259 	gfs2_add_revoke(sdp, bd);
260 	set_bit(TR_TOUCHED, &tr->tr_flags);
261 	tr->tr_num_revoke++;
262 }
263 
264 void gfs2_trans_remove_revoke(struct gfs2_sbd *sdp, u64 blkno, unsigned int len)
265 {
266 	struct gfs2_bufdata *bd, *tmp;
267 	struct gfs2_trans *tr = current->journal_info;
268 	unsigned int n = len;
269 
270 	gfs2_log_lock(sdp);
271 	list_for_each_entry_safe(bd, tmp, &sdp->sd_log_revokes, bd_list) {
272 		if ((bd->bd_blkno >= blkno) && (bd->bd_blkno < (blkno + len))) {
273 			list_del_init(&bd->bd_list);
274 			gfs2_assert_withdraw(sdp, sdp->sd_log_num_revoke);
275 			sdp->sd_log_num_revoke--;
276 			if (bd->bd_gl)
277 				gfs2_glock_remove_revoke(bd->bd_gl);
278 			kmem_cache_free(gfs2_bufdata_cachep, bd);
279 			tr->tr_num_revoke_rm++;
280 			if (--n == 0)
281 				break;
282 		}
283 	}
284 	gfs2_log_unlock(sdp);
285 }
286 
287 void gfs2_trans_free(struct gfs2_sbd *sdp, struct gfs2_trans *tr)
288 {
289 	if (tr == NULL)
290 		return;
291 
292 	gfs2_assert_warn(sdp, list_empty(&tr->tr_ail1_list));
293 	gfs2_assert_warn(sdp, list_empty(&tr->tr_ail2_list));
294 	gfs2_assert_warn(sdp, list_empty(&tr->tr_databuf));
295 	gfs2_assert_warn(sdp, list_empty(&tr->tr_buf));
296 	kmem_cache_free(gfs2_trans_cachep, tr);
297 }
298